diff --git a/common/src/app/common/features.cljc b/common/src/app/common/features.cljc
index 90ed0930a2..c628d8f0ab 100644
--- a/common/src/app/common/features.cljc
+++ b/common/src/app/common/features.cljc
@@ -56,6 +56,7 @@
     "text-editor/v2-html-paste"
     "text-editor/v2"
     "render-wasm/v1"
+    "graph-wasm/v1"
     "variants/v1"})
 
 ;; A set of features enabled by default
@@ -79,7 +80,8 @@
     "text-editor/v2-html-paste"
     "text-editor/v2"
     "tokens/numeric-input"
-    "render-wasm/v1"})
+    "render-wasm/v1"
+    "graph-wasm/v1"})
 
 ;; Features that are mainly backend only or there are a proper
 ;; fallback when frontend reports no support for it
@@ -128,6 +130,7 @@
     :feature-text-editor-v2 "text-editor/v2"
     :feature-text-editor-v2-html-paste "text-editor/v2-html-paste"
     :feature-render-wasm "render-wasm/v1"
+    :feature-graph-wasm "graph-wasm/v1"
     :feature-variants "variants/v1"
     :feature-token-input "tokens/numeric-input"
     nil))
diff --git a/frontend/resources/wasm-playground/graph.html b/frontend/resources/wasm-playground/graph.html
new file mode 100644
index 0000000000..3a71334ee3
--- /dev/null
+++ b/frontend/resources/wasm-playground/graph.html
@@ -0,0 +1,23 @@
+<!DOCTYPE html>
+<html lang="es">
+<head>
+  <meta charset="UTF-8" />
+</head>
+<body>  
+  <script type="module">
+    import initWasmModule from '/js/graph-wasm.js';
+
+    let Module = null;
+    function init(moduleInstance) {
+      Module = moduleInstance;
+    }
+
+    console.log("Loading module");
+    initWasmModule().then(Module => {      
+      init(Module);
+      Module._hello();
+    });
+    
+  </script>
+</body>
+</html>
diff --git a/frontend/shadow-cljs.edn b/frontend/shadow-cljs.edn
index 5dceccf652..26c48f0701 100644
--- a/frontend/shadow-cljs.edn
+++ b/frontend/shadow-cljs.edn
@@ -92,7 +92,7 @@
    {:main
     {:entries [app.worker]
      :web-worker true
-     :prepend-js "importScripts('./render.js');"
+     :prepend-js "importScripts('./render.js', './graph-wasm-worker.js');"
      :depends-on #{}}}
 
    :js-options
diff --git a/frontend/src/app/graph_wasm.cljs b/frontend/src/app/graph_wasm.cljs
new file mode 100644
index 0000000000..9191970611
--- /dev/null
+++ b/frontend/src/app/graph_wasm.cljs
@@ -0,0 +1,12 @@
+;; This Source Code Form is subject to the terms of the Mozilla Public
+;; License, v. 2.0. If a copy of the MPL was not distributed with this
+;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
+;;
+;; Copyright (c) KALEIDOS INC
+
+(ns app.graph-wasm
+  "A WASM based render API"
+  (:require
+   [app.graph-wasm.api :as wasm.api]))
+
+(def module wasm.api/module)
diff --git a/frontend/src/app/graph_wasm/api.cljs b/frontend/src/app/graph_wasm/api.cljs
new file mode 100644
index 0000000000..9e352a124a
--- /dev/null
+++ b/frontend/src/app/graph_wasm/api.cljs
@@ -0,0 +1,91 @@
+;; This Source Code Form is subject to the terms of the Mozilla Public
+;; License, v. 2.0. If a copy of the MPL was not distributed with this
+;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
+;;
+;; Copyright (c) KALEIDOS INC
+
+(ns app.graph-wasm.api
+  (:require
+   [app.common.data.macros :as dm]
+   [app.common.uuid :as uuid]
+   [app.config :as cf]
+   [app.graph-wasm.wasm :as wasm]
+   [app.render-wasm.helpers :as h]
+   [app.render-wasm.serializers :as sr]
+   [app.util.modules :as mod]
+   [promesa.core :as p]))
+
+(defn hello []
+  (h/call wasm/internal-module "_hello"))
+
+(defn init []
+  (h/call wasm/internal-module "_init"))
+
+(defn use-shape
+  [id]
+  (let [buffer (uuid/get-u32 id)]
+    (println "use-shape" id)
+    (h/call wasm/internal-module "_use_shape"
+            (aget buffer 0)
+            (aget buffer 1)
+            (aget buffer 2)
+            (aget buffer 3))))
+
+(defn set-shape-parent-id
+  [id]
+  (let [buffer (uuid/get-u32 id)]
+    (h/call wasm/internal-module "_set_shape_parent"
+            (aget buffer 0)
+            (aget buffer 1)
+            (aget buffer 2)
+            (aget buffer 3))))
+
+(defn set-shape-type
+  [type]
+  (h/call wasm/internal-module "_set_shape_type" (sr/translate-shape-type type)))
+
+(defn set-shape-selrect
+  [selrect]
+  (h/call wasm/internal-module "_set_shape_selrect"
+          (dm/get-prop selrect :x1)
+          (dm/get-prop selrect :y1)
+          (dm/get-prop selrect :x2)
+          (dm/get-prop selrect :y2)))
+
+(defn set-object
+  [shape]
+  (let [id           (dm/get-prop shape :id)
+        type         (dm/get-prop shape :type)
+        parent-id    (get shape :parent-id)
+        selrect      (get shape :selrect)
+        children     (get shape :shapes)]
+    (use-shape id)
+    (set-shape-type type)
+    (set-shape-parent-id parent-id)
+    (set-shape-selrect selrect)))
+
+(defn set-objects
+  [objects]
+  (doseq [shape (vals objects)]
+    (set-object shape)))
+
+(defn init-wasm-module
+  [module]
+  (let [default-fn (unchecked-get module "default")
+        href       (cf/resolve-href "js/graph-wasm.wasm")]
+    (default-fn #js {:locateFile (constantly href)})))
+
+(defonce module
+  (delay
+    (if (exists? js/dynamicImport)
+      (let [uri (cf/resolve-href "js/graph-wasm.js")]
+        (->> (mod/import uri)
+             (p/mcat init-wasm-module)
+             (p/fmap (fn [default]
+                       (set! wasm/internal-module default)
+                       true))
+             (p/merr
+              (fn [cause]
+                (js/console.error cause)
+                (p/resolved false)))))
+      (p/resolved false))))
\ No newline at end of file
diff --git a/frontend/src/app/graph_wasm/wasm.cljs b/frontend/src/app/graph_wasm/wasm.cljs
new file mode 100644
index 0000000000..6792d8b7cc
--- /dev/null
+++ b/frontend/src/app/graph_wasm/wasm.cljs
@@ -0,0 +1,9 @@
+;; This Source Code Form is subject to the terms of the Mozilla Public
+;; License, v. 2.0. If a copy of the MPL was not distributed with this
+;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
+;;
+;; Copyright (c) KALEIDOS INC
+
+(ns app.graph-wasm.wasm)
+
+(defonce internal-module #js {})
diff --git a/frontend/src/app/main/data/workspace/componentize.cljs b/frontend/src/app/main/data/workspace/componentize.cljs
new file mode 100644
index 0000000000..4e94297c8e
--- /dev/null
+++ b/frontend/src/app/main/data/workspace/componentize.cljs
@@ -0,0 +1,288 @@
+;; This Source Code Form is subject to the terms of the Mozilla Public
+;; License, v. 2.0. If a copy of the MPL was not distributed with this
+;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
+;;
+;; Copyright (c) KALEIDOS INC
+;;
+;; High level helpers to turn a shape subtree into a component and
+;; replace equivalent subtrees by instances of that component.
+
+(ns app.main.data.workspace.componentize
+  (:require
+   [app.common.data :as d]
+   [app.common.data.macros :as dm]
+   [app.common.files.changes-builder :as pcb]
+   [app.common.files.helpers :as cfh]
+   [app.common.geom.point :as gpt]
+   [app.common.logic.libraries :as cll]
+   [app.common.logic.shapes :as cls]
+   [app.common.types.shape :as cts]
+   [app.common.uuid :as uuid]
+   [app.main.data.changes :as dch]
+   [app.main.data.helpers :as dsh]
+   [app.main.data.workspace.libraries :as dwl]
+   [app.main.data.workspace.selection :as dws]
+   [app.main.data.workspace.shapes :as dwsh]
+   [app.main.data.workspace.undo :as dwu]
+   [beicon.v2.core :as rx]
+   [potok.v2.core :as ptk]))
+
+;; NOTE: We keep this separate from `workspace.libraries` to avoid
+;; introducing more complexity in that already big namespace.
+
+(def ^:private instance-structural-keys
+  "Keys we do NOT want to copy from the original shape when creating a
+  new component instance. These are identity / structural / component
+  metadata keys that must be managed by the component system itself."
+  #{:id
+    :parent-id
+    :frame-id
+    :shapes
+    ;; Component metadata
+    :component-id
+    :component-file
+    :component-root
+    :main-instance
+    :remote-synced
+    :shape-ref
+    :touched})
+
+(def ^:private instance-geometry-keys
+  "Geometry-related keys that we *do* want to override per instance when
+  copying props from an existing subtree to a component instance."
+  #{:x
+    :y
+    :width
+    :height
+    :rotation
+    :flip-x
+    :flip-y
+    :selrect
+    :points
+    :proportion
+    :proportion-lock
+    :transform
+    :transform-inverse})
+
+(defn- instantiate-similar-subtrees
+  "Internal helper. Given an atom `id-ref` that will contain the
+  `component-id`, replace each subtree rooted at the ids in
+  `similar-ids` by an instance of that component.
+
+  The operation is performed in a single undo transaction:
+  - Instantiate the component once per similar id, roughly at the same
+    top-left position as the original root.
+  - Delete the original subtrees.
+  - Select the main instance plus all the new instances."
+  [id-ref root-id similar-ids]
+  (ptk/reify ::instantiate-similar-subtrees
+    ptk/WatchEvent
+    (watch [it state _]
+      (let [component-id @id-ref
+            similar-ids   (vec (or similar-ids []))]
+        (if (or (uuid/zero? component-id)
+                (empty? similar-ids))
+          (rx/empty)
+          (let [file-id   (:current-file-id state)
+                page      (dsh/lookup-page state)
+                page-id   (:id page)
+                objects   (:objects page)
+                libraries (dsh/lookup-libraries state)
+                fdata     (dsh/lookup-file-data state file-id)
+
+                ;; Reference subtree: shapes used to build the component.
+                ;; We'll compute per-shape deltas against this subtree so
+                ;; that we only override attributes that actually differ.
+                ref-subtree-ids (cfh/get-children-ids objects root-id)
+                ref-all-ids     (into [root-id] ref-subtree-ids)
+
+                undo-id   (js/Symbol)
+
+                ;; 1) Instantiate component at each similar root position,
+                ;;    preserving per-instance overrides (geometry, style, etc.)
+                [changes new-root-ids]
+                (reduce
+                 (fn [[changes acc] sid]
+                   (if-let [shape (get objects sid)]
+                     (let [position (gpt/point (:x shape) (:y shape))
+                           ;; Remember original parent and index so we can keep
+                           ;; the same ordering among the parent's children.
+                           orig-root        (get objects sid)
+                           orig-parent-id   (:parent-id orig-root)
+                           orig-index       (when orig-parent-id
+                                              (cfh/get-position-on-parent objects sid))
+                           ;; Instantiate a new component instance at the same position
+                           [new-shape changes']
+                           (cll/generate-instantiate-component
+                            (or changes
+                                (-> (pcb/empty-changes it page-id)
+                                    (pcb/with-objects objects)))
+                            objects
+                            file-id
+                            component-id
+                            position
+                            page
+                            libraries)
+                           ;; Build a structural mapping between the original subtree
+                           ;; (rooted at `sid`) and the new instance subtree.
+                           ;; NOTE 1: instantiating a component can introduce an extra
+                           ;; wrapper frame, so we try to align the original root
+                           ;; with the "equivalent" root inside the instance.
+                           ;; NOTE 2: by default the instance may be created *inside*
+                           ;; the original shape (because of layout / hit-testing).
+                           ;; We explicitly move the new instance to the same parent
+                           ;; and index as the original root, so that later deletes of
+                           ;; the original subtree don't remove the new instances and
+                           ;; the ordering among siblings is preserved.
+                           changes'         (cond-> changes'
+                                              (some? orig-parent-id)
+                                              (pcb/change-parent orig-parent-id [new-shape] orig-index
+                                                                 {:allow-altering-copies true
+                                                                  :ignore-touched true}))
+                           objects'         (pcb/get-objects changes')
+                           orig-root        (get objects sid)
+                           new-root         new-shape
+                           orig-type        (:type orig-root)
+                           new-type         (:type new-root)
+                           ;; Full original subtree (root + descendants)
+                           orig-subtree-ids (cfh/get-children-ids objects sid)
+                           orig-all-ids     (into [sid] orig-subtree-ids)
+                           ;; Try to find an inner instance root matching the original type
+                           ;; when the outer instance root type differs (e.g. rect -> frame+rect).
+                           direct-new-children (cfh/get-children-ids objects' (:id new-root))
+                           candidate-instance-root
+                           (when (and orig-type (not= orig-type new-type))
+                             (let [cands (->> direct-new-children
+                                              (filter (fn [nid]
+                                                        (when-let [s (get objects' nid)]
+                                                          (= (:type s) orig-type)))))]
+                               (when (= 1 (count cands))
+                                 (first cands))))
+                           instance-root-id (or candidate-instance-root (:id new-root))
+                           instance-root    (get objects' instance-root-id)
+                           new-subtree-ids  (cfh/get-children-ids objects' instance-root-id)
+                           new-all-ids      (into [instance-root-id] new-subtree-ids)
+                           id-pairs         (map vector orig-all-ids new-all-ids)
+                           changes''
+                           ;; Compute per-shape deltas against the reference
+                           ;; subtree (root-id) and apply only the differences
+                           ;; to the new instance subtree, so we don't blindly
+                           ;; overwrite attributes that are the same.
+                           (reduce
+                            (fn [ch [idx orig-id new-id]]
+                              (let [ref-id     (nth ref-all-ids idx nil)
+                                    ref-shape  (get objects ref-id)
+                                    orig-shape (get objects orig-id)]
+                                (if (and ref-shape orig-shape)
+                                  (let [;; Style / layout / text props (see `extract-props`)
+                                        ref-style   (cts/extract-props ref-shape)
+                                        orig-style  (cts/extract-props orig-shape)
+                                        style-delta (reduce (fn [m k]
+                                                              (let [rv (get ref-style k ::none)
+                                                                    ov (get orig-style k ::none)]
+                                                                (if (= rv ov)
+                                                                  m
+                                                                  (assoc m k ov))))
+                                                            {}
+                                                            (keys orig-style))
+
+                                        ;; Geometry props
+                                        ref-geom    (select-keys ref-shape instance-geometry-keys)
+                                        orig-geom   (select-keys orig-shape instance-geometry-keys)
+                                        geom-delta  (reduce (fn [m k]
+                                                              (let [rv (get ref-geom k ::none)
+                                                                    ov (get orig-geom k ::none)]
+                                                                (if (= rv ov)
+                                                                  m
+                                                                  (assoc m k ov))))
+                                                            {}
+                                                            (keys orig-geom))
+
+                                        ;; Text content: if the subtree reference and the
+                                        ;; original differ in `:content`, treat the whole
+                                        ;; content tree as an override for this instance.
+                                        content-delta? (not= (:content ref-shape) (:content orig-shape))]
+                                    (-> ch
+                                        ;; First patch style/text/layout props using the
+                                        ;; canonical helpers so we don't touch structural ids.
+                                        (cond-> (seq style-delta)
+                                          (pcb/update-shapes
+                                           [new-id]
+                                           (fn [s objs] (cts/patch-props s style-delta objs))
+                                           {:with-objects? true}))
+                                        ;; Then patch geometry directly on the instance.
+                                        (cond-> (seq geom-delta)
+                                          (pcb/update-shapes
+                                           [new-id]
+                                           (d/patch-object geom-delta)))
+                                        ;; Finally, if text content differs between the
+                                        ;; reference subtree and the similar subtree,
+                                        ;; override the instance content with the original.
+                                        (cond-> content-delta?
+                                          (pcb/update-shapes
+                                           [new-id]
+                                           #(assoc % :content (:content orig-shape))))))
+                                  ch)))
+                            changes'
+                            (map-indexed (fn [idx [orig-id new-id]]
+                                           [idx orig-id new-id])
+                                         id-pairs))]
+                       [changes'' (conj acc (:id new-shape))])
+                     ;; If the shape does not exist we just skip it
+                     [changes acc]))
+                 [nil []]
+                 similar-ids)
+
+                changes (or changes
+                            (-> (pcb/empty-changes it page-id)
+                                (pcb/with-objects objects)))
+
+                ;; 2) Delete original similar subtrees
+                ;; NOTE: `d/ordered-set` with a single arg treats it as a single
+                ;; element, so we must use `into` when we already have a collection.
+                ids-to-delete (into (d/ordered-set) similar-ids)
+                [all-parents changes]
+                (cls/generate-delete-shapes
+                 changes
+                 fdata
+                 page
+                 objects
+                 ids-to-delete
+                 {:allow-altering-copies true})
+
+                ;; 3) Select main instance + new instances
+                ;;    Root id is kept as-is; add all new roots.
+                sel-ids (into (d/ordered-set) (cons root-id new-root-ids))]
+
+            (rx/of
+             (dwu/start-undo-transaction undo-id)
+             (dch/commit-changes changes)
+             (ptk/data-event :layout/update {:ids all-parents})
+             (dwu/commit-undo-transaction undo-id))))))))
+
+(defn componentize-similar-subtrees
+  "Turn the subtree rooted at `root-id` into a component, then replace
+  the subtrees rooted at `similar-ids` with instances of that component.
+
+  This is implemented in two phases:
+  1) Use the existing `dwl/add-component` flow to create a component
+     from `root-id` (and obtain its `component-id`).
+  2) Using the new `component-id`, instantiate the component once per
+     entry in `similar-ids` and delete the old subtrees."
+  [root-id similar-ids]
+  (dm/assert!
+   "expected valid uuid for `root-id`"
+   (uuid? root-id))
+
+  (let [similar-ids (vec (or similar-ids []))]
+    (ptk/reify ::componentize-similar-subtrees
+      ptk/WatchEvent
+      (watch [_ _ _]
+        (let [id-ref (atom uuid/zero)]
+          (rx/concat
+           ;; 1) Create component using the existing pipeline
+           (rx/of (dwl/add-component id-ref (d/ordered-set root-id)))
+           ;; 2) Replace similar subtrees by instances of the new component
+           (rx/of (instantiate-similar-subtrees id-ref root-id similar-ids))))))))
+
+
diff --git a/frontend/src/app/main/ui/workspace/viewport.cljs b/frontend/src/app/main/ui/workspace/viewport.cljs
index 7d08054fb4..52da3b5806 100644
--- a/frontend/src/app/main/ui/workspace/viewport.cljs
+++ b/frontend/src/app/main/ui/workspace/viewport.cljs
@@ -13,11 +13,16 @@
    [app.common.geom.shapes :as gsh]
    [app.common.types.color :as clr]
    [app.common.types.component :as ctk]
+   [app.common.types.container :as ctn]
    [app.common.types.path :as path]
    [app.common.types.shape :as cts]
    [app.common.types.shape-tree :as ctt]
    [app.common.types.shape.layout :as ctl]
+   [app.config :as cf]
+   [app.graph-wasm.api :as graph-wasm.api]
+   [app.main.data.workspace.componentize :as dwc]
    [app.main.data.workspace.modifiers :as dwm]
+   [app.main.data.workspace.selection :as dws]
    [app.main.data.workspace.variants :as dwv]
    [app.main.features :as features]
    [app.main.refs :as refs]
@@ -57,8 +62,11 @@
    [app.main.ui.workspace.viewport.utils :as utils]
    [app.main.ui.workspace.viewport.viewport-ref :refer [create-viewport-ref]]
    [app.main.ui.workspace.viewport.widgets :as widgets]
+   [app.main.worker :as worker]
    [app.util.debug :as dbg]
+   [app.util.modules :as mod]
    [beicon.v2.core :as rx]
+   [promesa.core :as p]
    [rumext.v2 :as mf]))
 
 ;; --- Viewport
@@ -134,6 +142,7 @@
         mod?               (mf/use-state false)
         space?             (mf/use-state false)
         z?                 (mf/use-state false)
+        g?                 (mf/use-state false)
         cursor             (mf/use-state #(utils/get-cursor :pointer-inner))
         hover-ids          (mf/use-state nil)
         hover              (mf/use-state nil)
@@ -302,12 +311,79 @@
         (mf/use-fn
          (mf/deps first-shape)
          #(st/emit!
-           (dwv/add-new-variant (:id first-shape))))]
+           (dwv/add-new-variant (:id first-shape))))
+
+        graph-wasm-enabled? (features/use-feature "graph-wasm/v1")]
+
+    (mf/with-effect [page-id]
+      (when graph-wasm-enabled?
+        ;; Initialize graph-wasm in the worker to avoid blocking main thread
+        (let [subscription
+              (->> (worker/ask! {:cmd :graph-wasm/init})
+                   (rx/filter #(= (:status %) :ok))
+                   (rx/take 1)
+                   (rx/merge-map (fn [_]
+                                   (worker/ask! {:cmd :graph-wasm/set-objects
+                                                 :objects base-objects}))))]
+
+          (rx/subscribe subscription
+                        (fn [result]
+                          (when (= (:status result) :ok)
+                            (js/console.debug "Graph WASM initialized in worker"
+                                              (select-keys result [:processed]))))
+                        (fn [error]
+                          (js/console.error "Error initializing graph-wasm in worker:" error))
+                        (fn []
+                          (js/console.debug "Graph WASM worker operations completed"))))))
+
+    (mf/with-effect [selected @g?]
+      (when graph-wasm-enabled?
+        ;; Search for similar shapes when selection changes or when
+        ;; the user presses the \"c\" key while having a single
+        ;; selection.
+        (when (and @g?
+                   (some? selected)
+                   (= (count selected) 1))
+          (let [selected-id    (first selected)
+                selected-shape (get base-objects selected-id)
+                ;; Skip shapes that already belong to a component
+                non-component? (and (some? selected-shape)
+                                    (not (ctn/in-any-component? base-objects selected-shape)))]
+
+            (println selected-shape)
+            (println (ctn/in-any-component? base-objects selected-shape))
+
+            (when non-component?
+              (let [subscription
+                    (worker/ask! {:cmd :graph-wasm/search-similar-shapes
+                                  :shape-id selected-id})]
+
+                (rx/subscribe subscription
+                              (fn [result]
+                                (when (= (:status result) :ok)
+                                  (let [raw-similar-shapes (:similar-shapes result)
+                                      ;; Filter out shapes that already belong to some component
+                                      ;; (main instance, instance head or inside a component copy).
+                                        similar-shapes      (->> raw-similar-shapes
+                                                                 (remove (fn [sid]
+                                                                           (when-let [s (get base-objects sid)]
+                                                                             (ctn/in-any-component? base-objects s))))
+                                                                 (into []))]
+                                    (when (d/not-empty? similar-shapes)
+                                    ;; Transform the selected subtree into a component and
+                                    ;; replace similar subtrees by instances of that component.
+                                      (st/emit! (dwc/componentize-similar-subtrees
+                                                 selected-id
+                                                 similar-shapes))))))
+                              (fn [error]
+                                (js/console.error "Error searching similar shapes:" error))
+                              (fn []
+                                (js/console.debug "Similar shapes search completed")))))))))
 
     (hooks/setup-dom-events zoom disable-paste-ref in-viewport-ref read-only? drawing-tool path-drawing?)
     (hooks/setup-viewport-size vport viewport-ref)
     (hooks/setup-cursor cursor alt? mod? space? panning drawing-tool path-drawing? path-editing? z? read-only?)
-    (hooks/setup-keyboard alt? mod? space? z? shift?)
+    (hooks/setup-keyboard alt? mod? space? z? shift? g?)
     (hooks/setup-hover-shapes page-id move-stream base-objects transform selected mod? hover measure-hover
                               hover-ids hover-top-frame-id @hover-disabled? focus zoom show-measures?)
     (hooks/setup-viewport-modifiers modifiers base-objects)
diff --git a/frontend/src/app/main/ui/workspace/viewport/hooks.cljs b/frontend/src/app/main/ui/workspace/viewport/hooks.cljs
index 922e18057d..af8f4ad692 100644
--- a/frontend/src/app/main/ui/workspace/viewport/hooks.cljs
+++ b/frontend/src/app/main/ui/workspace/viewport/hooks.cljs
@@ -124,7 +124,7 @@
          (reset! cursor new-cursor))))))
 
 (defn setup-keyboard
-  [alt* mod* space* z* shift*]
+  [alt* mod* space* z* shift* g*]
   (let [kbd-zoom-s
         (mf/with-memo []
           (->> ms/keyboard
@@ -151,12 +151,22 @@
                (rx/filter kbd/z?)
                (rx/filter (complement kbd/editing-event?))
                (rx/map kbd/key-down-event?)
-               (rx/pipe (rxo/distinct-contiguous))))]
+               (rx/pipe (rxo/distinct-contiguous))))
+
+        kbd-g-s
+        (mf/with-memo []
+          (let [c-pred (kbd/is-key-ignore-case? "g")]
+            (->> ms/keyboard
+                 (rx/filter c-pred)
+                 (rx/filter (complement kbd/editing-event?))
+                 (rx/map kbd/key-down-event?)
+                 (rx/pipe (rxo/distinct-contiguous)))))]
 
     (hooks/use-stream ms/keyboard-alt (partial reset! alt*))
     (hooks/use-stream ms/keyboard-space (partial reset! space*))
     (hooks/use-stream kbd-z-s (partial reset! z*))
     (hooks/use-stream kbd-shift-s (partial reset! shift*))
+    (hooks/use-stream kbd-g-s (partial reset! g*))
     (hooks/use-stream ms/keyboard-mod
                       (fn [value]
                         (reset! mod* value)
diff --git a/frontend/src/app/main/ui/workspace/viewport_wasm.cljs b/frontend/src/app/main/ui/workspace/viewport_wasm.cljs
index a667d3abc5..2d83f6c3d7 100644
--- a/frontend/src/app/main/ui/workspace/viewport_wasm.cljs
+++ b/frontend/src/app/main/ui/workspace/viewport_wasm.cljs
@@ -122,6 +122,7 @@
         mod?              (mf/use-state false)
         space?            (mf/use-state false)
         z?                (mf/use-state false)
+        c?                (mf/use-state false)
         cursor            (mf/use-state (utils/get-cursor :pointer-inner))
         hover-ids         (mf/use-state nil)
         hover             (mf/use-state nil)
@@ -360,7 +361,7 @@
     (hooks/setup-dom-events zoom disable-paste-ref in-viewport-ref read-only? drawing-tool path-drawing?)
     (hooks/setup-viewport-size vport viewport-ref)
     (hooks/setup-cursor cursor alt? mod? space? panning drawing-tool path-drawing? path-editing? z? read-only?)
-    (hooks/setup-keyboard alt? mod? space? z? shift?)
+    (hooks/setup-keyboard alt? mod? space? z? shift? c?)
     (hooks/setup-hover-shapes page-id move-stream base-objects transform selected mod? hover measure-hover
                               hover-ids hover-top-frame-id @hover-disabled? focus zoom show-measures?)
     (hooks/setup-shortcuts path-editing? path-drawing? text-editing? grid-editing?)
diff --git a/frontend/src/app/worker.cljs b/frontend/src/app/worker.cljs
index e6ca3fb1d2..56e33d7d12 100644
--- a/frontend/src/app/worker.cljs
+++ b/frontend/src/app/worker.cljs
@@ -11,6 +11,7 @@
    [app.common.schema :as sm]
    [app.common.types.objects-map]
    [app.util.object :as obj]
+   [app.worker.graph-wasm]
    [app.worker.impl :as impl]
    [app.worker.import]
    [app.worker.index]
diff --git a/frontend/src/app/worker/graph_wasm.cljs b/frontend/src/app/worker/graph_wasm.cljs
new file mode 100644
index 0000000000..07340b8f41
--- /dev/null
+++ b/frontend/src/app/worker/graph_wasm.cljs
@@ -0,0 +1,181 @@
+;; This Source Code Form is subject to the terms of the Mozilla Public
+;; License, v. 2.0. If a copy of the MPL was not distributed with this
+;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
+;;
+;; Copyright (c) KALEIDOS INC
+
+(ns app.worker.graph-wasm
+  "Graph WASM operations within the worker."
+  (:require
+   [app.common.data.macros :as dm]
+   [app.common.logging :as log]
+   [app.common.uuid :as uuid]
+   [app.config :as cf]
+   [app.graph-wasm.wasm :as wasm]
+   [app.render-wasm.helpers :as h]
+   [app.render-wasm.serializers :as sr]
+   [app.worker.impl :as impl]
+   [beicon.v2.core :as rx]
+   [promesa.core :as p]))
+
+(log/set-level! :info)
+
+(defn- use-shape
+  [module id]
+  (let [buffer (uuid/get-u32 id)]
+    (h/call module "_use_shape"
+            (aget buffer 0)
+            (aget buffer 1)
+            (aget buffer 2)
+            (aget buffer 3))))
+
+(defn- set-shape-parent-id
+  [module id]
+  (let [buffer (uuid/get-u32 id)]
+    (h/call module "_set_shape_parent"
+            (aget buffer 0)
+            (aget buffer 1)
+            (aget buffer 2)
+            (aget buffer 3))))
+
+(defn- set-shape-type
+  [module type]
+  (h/call module "_set_shape_type" (sr/translate-shape-type type)))
+
+(defn- set-shape-selrect
+  [module selrect]
+  (h/call module "_set_shape_selrect"
+          (dm/get-prop selrect :x1)
+          (dm/get-prop selrect :y1)
+          (dm/get-prop selrect :x2)
+          (dm/get-prop selrect :y2)))
+
+(defn- set-object
+  [module shape]
+  (let [id           (dm/get-prop shape :id)
+        type         (dm/get-prop shape :type)
+        parent-id    (get shape :parent-id)
+        selrect      (get shape :selrect)]
+    (use-shape module id)
+    (set-shape-type module type)
+    (set-shape-parent-id module parent-id)
+    (set-shape-selrect module selrect)))
+
+(defonce ^:private graph-wasm-module
+  (delay
+    (let [module  (unchecked-get js/globalThis "GraphWasmModule")
+          init-fn (unchecked-get module "default")
+          href    (cf/resolve-href "js/graph-wasm.wasm")]
+      (->> (init-fn #js {:locateFile (constantly href)})
+           (p/fnly (fn [module cause]
+                     (if cause
+                       (js/console.error cause)
+                       (set! wasm/internal-module module))))))))
+
+(defmethod impl/handler :graph-wasm/init
+  [message transfer]
+  (rx/create
+   (fn [subs]
+     (-> @graph-wasm-module
+         (p/then (fn [module]
+                   (if module
+                     (try
+                       (h/call module "_init")
+                       (rx/push! subs {:status :ok})
+                       (rx/end! subs)
+                       (catch :default cause
+                         (log/error :hint "Error in graph-wasm/init" :cause cause)
+                         (rx/error! subs cause)
+                         (rx/end! subs)))
+                     (do
+                       (log/warn :hint "Graph WASM module not available")
+                       (rx/push! subs {:status :error :message "Module not available"})
+                       (rx/end! subs)))))
+         (p/catch (fn [cause]
+                    (log/error :hint "Error loading graph-wasm module" :cause cause)
+                    (rx/error! subs cause)
+                    (rx/end! subs))))
+     nil)))
+
+(defmethod impl/handler :graph-wasm/set-objects
+  [message transfer]
+  (let [objects (:objects message)]
+    (rx/create
+     (fn [subs]
+       (-> @graph-wasm-module
+           (p/then (fn [module]
+                     (if module
+                       (try
+                         (doseq [shape (vals objects)]
+                           (set-object module shape))
+                         (h/call module "_generate_db")
+                         (rx/push! subs {:status :ok :processed (count objects)})
+                         (rx/end! subs)
+                         (catch :default cause
+                           (log/error :hint "Error in graph-wasm/set-objects" :cause cause)
+                           (rx/error! subs cause)
+                           (rx/end! subs)))
+                       (do
+                         (log/warn :hint "Graph WASM module not available")
+                         (rx/push! subs {:status :error :message "Module not available"})
+                         (rx/end! subs)))))
+           (p/catch (fn [cause]
+                      (log/error :hint "Error loading graph-wasm module" :cause cause)
+                      (rx/error! subs cause)
+                      (rx/end! subs))))
+       nil))))
+
+(defmethod impl/handler :graph-wasm/search-similar-shapes
+  [message transfer]
+  (let [shape-id (:shape-id message)]
+    (rx/create
+     (fn [subs]
+       (-> @graph-wasm-module
+           (p/then (fn [module]
+                     (if module
+                       (try
+                         (let [buffer (uuid/get-u32 shape-id)
+                               ptr-raw (h/call module "_search_similar_shapes"
+                                               (aget buffer 0)
+                                               (aget buffer 1)
+                                               (aget buffer 2)
+                                               (aget buffer 3))
+                               ;; Convert pointer to unsigned 32-bit (handle negative numbers from WASM)
+                               ;; Use unsigned right shift to convert signed to unsigned 32-bit
+                               ptr (unsigned-bit-shift-right ptr-raw 0)
+                               heapu8 (unchecked-get module "HEAPU8")
+
+                               ;; Read count (first 4 bytes, little-endian u32)
+                               count (bit-or (aget heapu8 ptr)
+                                             (bit-shift-left (aget heapu8 (+ ptr 1)) 8)
+                                             (bit-shift-left (aget heapu8 (+ ptr 2)) 16)
+                                             (bit-shift-left (aget heapu8 (+ ptr 3)) 24))
+                               ;; Read UUIDs (16 bytes each, starting at offset 4)
+                               similar-shapes (loop [offset (+ ptr 4)
+                                                     remaining count
+                                                     result []]
+                                                (if (zero? remaining)
+                                                  result
+                                                  (let [uuid-bytes (.slice heapu8 offset (+ offset 16))]
+                                                    (recur (+ offset 16)
+                                                           (dec remaining)
+                                                           (conj result (uuid/from-bytes uuid-bytes))))))]
+
+                           ;; Free the buffer
+                           (h/call module "_free_similar_shapes_buffer")
+
+                           (rx/push! subs {:status :ok :similar-shapes similar-shapes})
+                           (rx/end! subs))
+                         (catch :default cause
+                           (log/error :hint "Error in graph-wasm/search-similar-shapes" :cause cause)
+                           (rx/error! subs cause)
+                           (rx/end! subs)))
+                       (do
+                         (log/warn :hint "Graph WASM module not available")
+                         (rx/push! subs {:status :error :message "Module not available"})
+                         (rx/end! subs)))))
+           (p/catch (fn [cause]
+                      (log/error :hint "Error loading graph-wasm module" :cause cause)
+                      (rx/error! subs cause)
+                      (rx/end! subs))))
+       nil))))
diff --git a/frontend/test/frontend_tests/svg_filters_test.cljs b/frontend/test/frontend_tests/svg_filters_test.cljs
index d469183389..8fccd29bdb 100644
--- a/frontend/test/frontend_tests/svg_filters_test.cljs
+++ b/frontend/test/frontend_tests/svg_filters_test.cljs
@@ -47,3 +47,6 @@
         result (svg-filters/apply-svg-filters shape)]
     (is (= shape result))))
 
+
+
+
diff --git a/graph-wasm/.cargo/config.toml b/graph-wasm/.cargo/config.toml
new file mode 100644
index 0000000000..46eec127dc
--- /dev/null
+++ b/graph-wasm/.cargo/config.toml
@@ -0,0 +1,6 @@
+[target.wasm32-unknown-emscripten]
+# Note: Not using atomics to avoid recompiling std library
+# We're running without pthreads, so lbug needs to work single-threaded
+rustflags = ["-C", "link-arg=-fexceptions"]
+# Linker is configured via environment variable CARGO_TARGET_WASM32_UNKNOWN_EMSCRIPTEN_LINKER in _build_env
+
diff --git a/graph-wasm/.gitignore b/graph-wasm/.gitignore
new file mode 100644
index 0000000000..391ed4d660
--- /dev/null
+++ b/graph-wasm/.gitignore
@@ -0,0 +1,5 @@
+target/
+debug/
+
+**/*.rs.bk
+
diff --git a/graph-wasm/Cargo.lock b/graph-wasm/Cargo.lock
new file mode 100644
index 0000000000..3526a993e2
--- /dev/null
+++ b/graph-wasm/Cargo.lock
@@ -0,0 +1,486 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 4
+
+[[package]]
+name = "anstyle"
+version = "1.0.13"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5192cca8006f1fd4f7237516f40fa183bb07f8fbdfedaa0036de5ea9b0b45e78"
+
+[[package]]
+name = "arrayvec"
+version = "0.7.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7c02d123df017efcdfbd739ef81735b36c5ba83ec3c59c80a9d7ecc718f92e50"
+
+[[package]]
+name = "autocfg"
+version = "1.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c08606f8c3cbf4ce6ec8e28fb0014a2c086708fe954eaa885384a6165172e7e8"
+
+[[package]]
+name = "bumpalo"
+version = "3.19.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "46c5e41b57b8bba42a04676d81cb89e9ee8e859a1a66f80a5a72e1cb76b34d43"
+
+[[package]]
+name = "cc"
+version = "1.2.49"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "90583009037521a116abf44494efecd645ba48b6622457080f080b85544e2215"
+dependencies = [
+ "find-msvc-tools",
+ "shlex",
+]
+
+[[package]]
+name = "cfg-if"
+version = "1.0.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9330f8b2ff13f34540b44e946ef35111825727b38d33286ef986142615121801"
+
+[[package]]
+name = "clap"
+version = "4.5.53"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c9e340e012a1bf4935f5282ed1436d1489548e8f72308207ea5df0e23d2d03f8"
+dependencies = [
+ "clap_builder",
+]
+
+[[package]]
+name = "clap_builder"
+version = "4.5.53"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d76b5d13eaa18c901fd2f7fca939fefe3a0727a953561fefdf3b2922b8569d00"
+dependencies = [
+ "anstyle",
+ "clap_lex",
+ "strsim",
+]
+
+[[package]]
+name = "clap_lex"
+version = "0.7.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a1d728cc89cf3aee9ff92b05e62b19ee65a02b5702cff7d5a377e32c6ae29d8d"
+
+[[package]]
+name = "cmake"
+version = "0.1.56"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b042e5d8a74ae91bb0961acd039822472ec99f8ab0948cbf6d1369588f8be586"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "codespan-reporting"
+version = "0.11.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3538270d33cc669650c4b093848450d380def10c331d38c768e34cac80576e6e"
+dependencies = [
+ "termcolor",
+ "unicode-width",
+]
+
+[[package]]
+name = "cxx"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3956d60afa98653c5a57f60d7056edd513bfe0307ef6fb06f6167400c3884459"
+dependencies = [
+ "cc",
+ "cxxbridge-cmd",
+ "cxxbridge-flags",
+ "cxxbridge-macro",
+ "foldhash",
+ "link-cplusplus",
+]
+
+[[package]]
+name = "cxx-build"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9a4b7522f539fe056f1d6fc8577d8ab731451f6f33a89b1e5912e22b76c553e7"
+dependencies = [
+ "cc",
+ "codespan-reporting",
+ "proc-macro2",
+ "quote",
+ "scratch",
+ "syn",
+]
+
+[[package]]
+name = "cxxbridge-cmd"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0f01e92ab4ce9fd4d16e3bb11b158d98cbdcca803c1417aa43130a6526fbf208"
+dependencies = [
+ "clap",
+ "codespan-reporting",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "cxxbridge-flags"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8c41cbfab344869e70998b388923f7d1266588f56c8ca284abf259b1c1ffc695"
+
+[[package]]
+name = "cxxbridge-macro"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "88d82a2f759f0ad3eae43b96604efd42b1d4729a35a6f2dc7bdb797ae25d9284"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "rustversion",
+ "syn",
+]
+
+[[package]]
+name = "deranged"
+version = "0.5.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ececcb659e7ba858fb4f10388c250a7252eb0a27373f1a72b8748afdd248e587"
+dependencies = [
+ "powerfmt",
+]
+
+[[package]]
+name = "find-msvc-tools"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3a3076410a55c90011c298b04d0cfa770b00fa04e1e3c97d3f6c9de105a03844"
+
+[[package]]
+name = "foldhash"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d9c4f5dac5e15c24eb999c26181a6ca40b39fe946cbe4c263c7209467bc83af2"
+
+[[package]]
+name = "getrandom"
+version = "0.3.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "899def5c37c4fd7b2664648c28120ecec138e4d395b459e5ca34f9cce2dd77fd"
+dependencies = [
+ "cfg-if",
+ "libc",
+ "r-efi",
+ "wasip2",
+]
+
+[[package]]
+name = "graph"
+version = "0.1.0"
+dependencies = [
+ "lbug",
+ "uuid",
+]
+
+[[package]]
+name = "js-sys"
+version = "0.3.83"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "464a3709c7f55f1f721e5389aa6ea4e3bc6aba669353300af094b29ffbdde1d8"
+dependencies = [
+ "once_cell",
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "lbug"
+version = "0.12.2"
+dependencies = [
+ "cmake",
+ "cxx",
+ "cxx-build",
+ "rust_decimal",
+ "rustversion",
+ "time",
+ "uuid",
+]
+
+[[package]]
+name = "libc"
+version = "0.2.178"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "37c93d8daa9d8a012fd8ab92f088405fb202ea0b6ab73ee2482ae66af4f42091"
+
+[[package]]
+name = "link-cplusplus"
+version = "1.0.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7f78c730aaa7d0b9336a299029ea49f9ee53b0ed06e9202e8cb7db9bae7b8c82"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "num-conv"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "51d515d32fb182ee37cda2ccdcb92950d6a3c2893aa280e540671c2cd0f3b1d9"
+
+[[package]]
+name = "num-traits"
+version = "0.2.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "071dfc062690e90b734c0b2273ce72ad0ffa95f0c74596bc250dcfd960262841"
+dependencies = [
+ "autocfg",
+]
+
+[[package]]
+name = "once_cell"
+version = "1.21.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "42f5e15c9953c5e4ccceeb2e7382a716482c34515315f7b03532b8b4e8393d2d"
+
+[[package]]
+name = "powerfmt"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "439ee305def115ba05938db6eb1644ff94165c5ab5e9420d1c1bcedbba909391"
+
+[[package]]
+name = "proc-macro2"
+version = "1.0.103"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5ee95bc4ef87b8d5ba32e8b7714ccc834865276eab0aed5c9958d00ec45f49e8"
+dependencies = [
+ "unicode-ident",
+]
+
+[[package]]
+name = "quote"
+version = "1.0.42"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a338cc41d27e6cc6dce6cefc13a0729dfbb81c262b1f519331575dd80ef3067f"
+dependencies = [
+ "proc-macro2",
+]
+
+[[package]]
+name = "r-efi"
+version = "5.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "69cdb34c158ceb288df11e18b4bd39de994f6657d83847bdffdbd7f346754b0f"
+
+[[package]]
+name = "rust_decimal"
+version = "1.39.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "35affe401787a9bd846712274d97654355d21b2a2c092a3139aabe31e9022282"
+dependencies = [
+ "arrayvec",
+ "num-traits",
+]
+
+[[package]]
+name = "rustversion"
+version = "1.0.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b39cdef0fa800fc44525c84ccb54a029961a8215f9619753635a9c0d2538d46d"
+
+[[package]]
+name = "scratch"
+version = "1.0.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d68f2ec51b097e4c1a75b681a8bec621909b5e91f15bb7b840c4f2f7b01148b2"
+
+[[package]]
+name = "serde"
+version = "1.0.228"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9a8e94ea7f378bd32cbbd37198a4a91436180c5bb472411e48b5ec2e2124ae9e"
+dependencies = [
+ "serde_core",
+]
+
+[[package]]
+name = "serde_core"
+version = "1.0.228"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "41d385c7d4ca58e59fc732af25c3983b67ac852c1a25000afe1175de458b67ad"
+dependencies = [
+ "serde_derive",
+]
+
+[[package]]
+name = "serde_derive"
+version = "1.0.228"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d540f220d3187173da220f885ab66608367b6574e925011a9353e4badda91d79"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "shlex"
+version = "1.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0fda2ff0d084019ba4d7c6f371c95d8fd75ce3524c3cb8fb653a3023f6323e64"
+
+[[package]]
+name = "strsim"
+version = "0.11.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7da8b5736845d9f2fcb837ea5d9e2628564b3b043a70948a3f0b778838c5fb4f"
+
+[[package]]
+name = "syn"
+version = "2.0.111"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "390cc9a294ab71bdb1aa2e99d13be9c753cd2d7bd6560c77118597410c4d2e87"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "unicode-ident",
+]
+
+[[package]]
+name = "termcolor"
+version = "1.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "06794f8f6c5c898b3275aebefa6b8a1cb24cd2c6c79397ab15774837a0bc5755"
+dependencies = [
+ "winapi-util",
+]
+
+[[package]]
+name = "time"
+version = "0.3.44"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "91e7d9e3bb61134e77bde20dd4825b97c010155709965fedf0f49bb138e52a9d"
+dependencies = [
+ "deranged",
+ "num-conv",
+ "powerfmt",
+ "serde",
+ "time-core",
+]
+
+[[package]]
+name = "time-core"
+version = "0.1.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "40868e7c1d2f0b8d73e4a8c7f0ff63af4f6d19be117e90bd73eb1d62cf831c6b"
+
+[[package]]
+name = "unicode-ident"
+version = "1.0.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9312f7c4f6ff9069b165498234ce8be658059c6728633667c526e27dc2cf1df5"
+
+[[package]]
+name = "unicode-width"
+version = "0.1.14"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7dd6e30e90baa6f72411720665d41d89b9a3d039dc45b8faea1ddd07f617f6af"
+
+[[package]]
+name = "uuid"
+version = "1.19.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e2e054861b4bd027cd373e18e8d8d8e6548085000e41290d95ce0c373a654b4a"
+dependencies = [
+ "getrandom",
+ "js-sys",
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "wasip2"
+version = "1.0.1+wasi-0.2.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0562428422c63773dad2c345a1882263bbf4d65cf3f42e90921f787ef5ad58e7"
+dependencies = [
+ "wit-bindgen",
+]
+
+[[package]]
+name = "wasm-bindgen"
+version = "0.2.106"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0d759f433fa64a2d763d1340820e46e111a7a5ab75f993d1852d70b03dbb80fd"
+dependencies = [
+ "cfg-if",
+ "once_cell",
+ "rustversion",
+ "wasm-bindgen-macro",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-macro"
+version = "0.2.106"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "48cb0d2638f8baedbc542ed444afc0644a29166f1595371af4fecf8ce1e7eeb3"
+dependencies = [
+ "quote",
+ "wasm-bindgen-macro-support",
+]
+
+[[package]]
+name = "wasm-bindgen-macro-support"
+version = "0.2.106"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cefb59d5cd5f92d9dcf80e4683949f15ca4b511f4ac0a6e14d4e1ac60c6ecd40"
+dependencies = [
+ "bumpalo",
+ "proc-macro2",
+ "quote",
+ "syn",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-shared"
+version = "0.2.106"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cbc538057e648b67f72a982e708d485b2efa771e1ac05fec311f9f63e5800db4"
+dependencies = [
+ "unicode-ident",
+]
+
+[[package]]
+name = "winapi-util"
+version = "0.1.11"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c2a7b1c03c876122aa43f3020e6c3c3ee5c05081c9a00739faf7503aeba10d22"
+dependencies = [
+ "windows-sys",
+]
+
+[[package]]
+name = "windows-link"
+version = "0.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f0805222e57f7521d6a62e36fa9163bc891acd422f971defe97d64e70d0a4fe5"
+
+[[package]]
+name = "windows-sys"
+version = "0.61.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ae137229bcbd6cdf0f7b80a31df61766145077ddf49416a728b02cb3921ff3fc"
+dependencies = [
+ "windows-link",
+]
+
+[[package]]
+name = "wit-bindgen"
+version = "0.46.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f17a85883d4e6d00e8a97c586de764dabcc06133f7f1d55dce5cdc070ad7fe59"
diff --git a/graph-wasm/Cargo.toml b/graph-wasm/Cargo.toml
new file mode 100644
index 0000000000..575781c60c
--- /dev/null
+++ b/graph-wasm/Cargo.toml
@@ -0,0 +1,31 @@
+[package]
+name = "graph"
+version = "0.1.0"
+edition = "2021"
+repository = "https://github.com/penpot/penpot"
+license-file = "../LICENSE"
+description = "Wasm-based graph module for Penpot"
+
+build = "build.rs"
+
+[[bin]]
+name = "graph_wasm"
+path = "src/main.rs"
+
+[profile.release]
+opt-level = "s"
+# Note: We need panic=unwind because core requires it
+# We'll compile std from source with atomics support instead
+
+[profile.dev]
+# Note: We need panic=unwind because core requires it
+# We'll compile std from source with atomics support instead
+
+[dependencies]
+lbug = "0.12.2"
+uuid = { version = "1.11.0", features = ["v4", "js"] }
+
+# Patch lbug to use local version with wasm32-unknown-emscripten support
+[patch.crates-io]
+lbug = { path = "./lbug-0.12.2" }
+
diff --git a/graph-wasm/README_WASM.md b/graph-wasm/README_WASM.md
new file mode 100644
index 0000000000..f5912db5c4
--- /dev/null
+++ b/graph-wasm/README_WASM.md
@@ -0,0 +1,197 @@
+# lbug WASM Support
+
+This document describes the modifications made to the `lbug` crate to enable compilation for the `wasm32-unknown-emscripten` target, and the build requirements for using it in a WASM context.
+
+## Overview
+
+The `lbug` crate is a Rust wrapper around a C++ graph database library. To compile it for WebAssembly using Emscripten, several modifications were necessary to handle:
+
+1. C++ exception handling in WASM
+2. Conditional compilation for WASM-specific code paths
+3. Proper linking of static libraries for Emscripten
+4. CMake configuration for single-threaded mode
+
+## Changes Made to lbug
+
+### 1. `build.rs` Modifications
+
+The build script (`build.rs`) was modified to detect and handle the `wasm32-unknown-emscripten` target:
+
+#### WASM Detection
+```rust
+fn is_wasm_emscripten() -> bool {
+    env::var("TARGET")
+        .map(|t| t == "wasm32-unknown-emscripten")
+        .unwrap_or(false)
+}
+```
+
+#### CMake Configuration (`build_bundled_cmake()`)
+- **Single-threaded mode**: Sets `SINGLE_THREADED=TRUE` for WASM builds (required by Emscripten)
+- The Emscripten toolchain is automatically detected when `CC`/`CXX` point to `emcc`/`em++`
+
+#### FFI Build Configuration (`build_ffi()`)
+- **C++20 standard**: Uses `-std=c++20` flag for WASM
+- **Exception support**: Enables `-fexceptions` flag (exceptions must be enabled at compile time)
+- Note: `-sDISABLE_EXCEPTION_CATCHING=0` is a linker flag and should be set via `EMCC_CFLAGS`
+
+#### Library Linking (`link_libraries()`)
+- **Explicit dependency linking**: For WASM, all static dependencies are explicitly linked:
+  - `utf8proc`, `antlr4_cypher`, `antlr4_runtime`, `re2`, `fastpfor`
+  - `parquet`, `thrift`, `snappy`, `zstd`, `miniz`
+  - `mbedtls`, `brotlidec`, `brotlicommon`, `lz4`
+  - `roaring_bitmap`, `simsimd`
+- **Linking order**: Libraries are linked after FFI compilation for WASM (different from native builds)
+
+### 2. `src/error.rs` Modifications
+
+The error handling code was modified to conditionally compile C++ exception support:
+
+#### Conditional C++ Exception Variant
+The `Error::CxxException` variant and related implementations are conditionally compiled:
+
+```rust
+#[cfg(not(target_arch = "wasm32"))]
+pub enum Error {
+    // ... other variants ...
+    CxxException(cxx::Exception),
+    // ...
+}
+```
+
+#### Exception Mapping for WASM
+In WASM builds, `cxx::Exception` is mapped to `Error::FailedQuery`:
+
+```rust
+impl From<cxx::Exception> for Error {
+    fn from(item: cxx::Exception) -> Self {
+        #[cfg(not(target_arch = "wasm32"))]
+        {
+            Error::CxxException(item)
+        }
+        #[cfg(target_arch = "wasm32")]
+        {
+            // In wasm, CxxException is not available, map to a generic error
+            Error::FailedQuery(item.to_string())
+        }
+    }
+}
+```
+
+**Note**: This change does not affect the rest of `lbug` due to `#[cfg]` guards, ensuring native builds remain unchanged.
+
+## Build Requirements
+
+### 1. Using the Modified lbug Crate
+
+To use the modified `lbug` crate in your project, add a `[patch.crates-io]` section to your `Cargo.toml`:
+
+```toml
+[dependencies]
+lbug = "0.12.2"
+
+# Patch lbug to use local version with wasm32-unknown-emscripten support
+[patch.crates-io]
+lbug = { path = "./lbug-0.12.2" }
+```
+
+### 2. Emscripten Environment Setup
+
+The build requires Emscripten to be properly configured. The following environment variables should be set:
+
+#### Memory Configuration
+```bash
+export EM_INITIAL_HEAP=$((256 * 1024 * 1024))  # 256 MB initial heap
+export EM_MAXIMUM_MEMORY=$((4 * 1024 * 1024 * 1024))  # 4 GB maximum
+export EM_MEMORY_GROWTH_GEOMETRIC_STEP=0.8
+export EM_MALLOC=dlmalloc
+```
+
+#### Compiler/Linker Configuration
+```bash
+# Prevent cc-rs from adding default flags that conflict with Emscripten
+export CRATE_CC_NO_DEFAULTS=1
+
+# Emscripten compiler flags
+export EMCC_CFLAGS="--no-entry \
+    -sASSERTIONS=1 \
+    -sALLOW_TABLE_GROWTH=1 \
+    -sALLOW_MEMORY_GROWTH=1 \
+    -sINITIAL_HEAP=$EM_INITIAL_HEAP \
+    -sMEMORY_GROWTH_GEOMETRIC_STEP=$EM_MEMORY_GROWTH_GEOMETRIC_STEP \
+    -sMAXIMUM_MEMORY=$EM_MAXIMUM_MEMORY \
+    -sERROR_ON_UNDEFINED_SYMBOLS=0 \
+    -sDISABLE_EXCEPTION_CATCHING=0 \
+    -sEXPORT_NAME=createGraphModule \
+    -sEXPORTED_RUNTIME_METHODS=stringToUTF8,HEAPU8 \
+    -sENVIRONMENT=web \
+    -sMODULARIZE=1 \
+    -sEXPORT_ES6=1"
+```
+
+#### Function Exports
+
+To control which functions are exported (avoiding issues with `$` symbols in auto-generated exports), use `RUSTFLAGS`:
+
+```bash
+export RUSTFLAGS="-C link-arg=-sEXPORTED_FUNCTIONS=@${SCRIPT_DIR}/exports.txt -C link-arg=-sEXPORT_ALL=0"
+```
+
+Where `exports.txt` contains the list of functions to export (one per line, with `_` prefix):
+```
+_hello
+_generate_db
+_init
+_search_similar_shapes
+# ... etc
+```
+
+### 3. Build Process
+
+1. **Source Emscripten environment**:
+   ```bash
+   source /opt/emsdk/emsdk_env.sh
+   ```
+
+2. **Set build environment**:
+   ```bash
+   source ./_build_env
+   ```
+
+3. **Build**:
+   ```bash
+   cargo build --target=wasm32-unknown-emscripten
+   ```
+
+## Key Differences from Native Builds
+
+1. **Single-threaded**: WASM builds use `SINGLE_THREADED=TRUE` in CMake
+2. **Exception handling**: C++ exceptions are enabled at compile time (`-fexceptions`) and runtime (`-sDISABLE_EXCEPTION_CATCHING=0`)
+3. **Linking order**: Libraries are linked after FFI compilation for WASM
+4. **Error handling**: C++ exceptions are mapped to `FailedQuery` errors in WASM
+5. **Function exports**: Manual control of exported functions via `EXPORTED_FUNCTIONS` file
+
+## Troubleshooting
+
+### Missing Symbols
+If you encounter "missing function" errors at runtime, ensure:
+- All required static libraries are listed in `link_libraries()` for WASM
+- Libraries are linked in the correct order (after FFI compilation)
+- `EXPORTED_FUNCTIONS` includes all functions you need to call from JavaScript
+
+### Invalid Export Names
+If you see errors like `invalid export name: cxxbridge1$exception`:
+- Use `EXPORT_ALL=0` and manually specify functions in `exports.txt`
+- Avoid using `EXPORT_ALL=1` with auto-generated export lists that may contain `$` symbols
+
+### CMake Compiler Detection Errors
+If CMake fails to detect the compiler:
+- Ensure `CC` and `CXX` environment variables point to `emcc` and `em++`
+- The Emscripten toolchain should be automatically detected by `cmake-rs`
+
+## References
+
+- [Emscripten Documentation](https://emscripten.org/docs/getting_started/index.html)
+- [Rust and WebAssembly](https://rustwasm.github.io/docs/book/)
+- [cxx crate documentation](https://cxx.rs/)
+
diff --git a/graph-wasm/_build_env b/graph-wasm/_build_env
new file mode 100644
index 0000000000..a3617193c4
--- /dev/null
+++ b/graph-wasm/_build_env
@@ -0,0 +1,105 @@
+#!/usr/bin/env bash
+
+# --------------------
+# Build configuration
+# --------------------
+
+_SCRIPT_DIR="$(cd "$(dirname "${BASH_SOURCE[0]}")" && pwd)"
+
+export CURRENT_VERSION="${CURRENT_VERSION:-develop}"
+export BUILD_NAME="${BUILD_NAME:-graph-wasm}"
+export CARGO_BUILD_TARGET="${CARGO_BUILD_TARGET:-wasm32-unknown-emscripten}"
+# Keep the emscripten cache in-repo so system cache cleaners do not wipe it.
+export EM_CACHE="${EM_CACHE:-${_SCRIPT_DIR}/.emsdk_cache}"
+export CARGO_TARGET_DIR="${CARGO_TARGET_DIR:-${_SCRIPT_DIR}/target}"
+if [[ -z "${CARGO_INCREMENTAL:-}" && "${NODE_ENV:-}" != "production" ]]; then
+    export CARGO_INCREMENTAL=1
+fi
+if [[ -z "${RUSTC_WRAPPER:-}" ]] && command -v sccache >/dev/null 2>&1; then
+    export RUSTC_WRAPPER=sccache
+fi
+export CRATE_CC_NO_DEFAULTS=1
+
+# BUILD_MODE
+if [[ "${NODE_ENV:-}" == "production" ]]; then
+    BUILD_MODE=release
+else
+    BUILD_MODE="${1:-debug}"
+fi
+export BUILD_MODE
+
+# --------------------
+# Emscripten memory
+# --------------------
+
+export EM_INITIAL_HEAP=$((256 * 1024 * 1024))
+export EM_MAXIMUM_MEMORY=$((4 * 1024 * 1024 * 1024))
+export EM_MEMORY_GROWTH_GEOMETRIC_STEP=0.8
+export EM_MALLOC=dlmalloc
+
+# --------------------
+# Flags
+# --------------------
+
+EMCC_COMMON_FLAGS=(
+    --no-entry
+    -sASSERTIONS=1
+    -sALLOW_TABLE_GROWTH=1
+    -sALLOW_MEMORY_GROWTH=1
+    -sINITIAL_HEAP=$EM_INITIAL_HEAP
+    -sMEMORY_GROWTH_GEOMETRIC_STEP=$EM_MEMORY_GROWTH_GEOMETRIC_STEP
+    -sMAXIMUM_MEMORY=$EM_MAXIMUM_MEMORY
+    -sERROR_ON_UNDEFINED_SYMBOLS=0
+    -sDISABLE_EXCEPTION_CATCHING=0
+    -sEXPORT_NAME=createGraphModule
+    -sEXPORTED_RUNTIME_METHODS=stringToUTF8,HEAPU8
+    -sENVIRONMENT=web
+    -sMODULARIZE=1
+    -sEXPORT_ES6=1
+)
+
+export RUSTFLAGS="-C link-arg=-sEXPORTED_FUNCTIONS=@${_SCRIPT_DIR}/exports.txt -C link-arg=-sEXPORT_ALL=0"
+
+# Mode-specific flags
+if [[ "$BUILD_MODE" == "release" ]]; then
+    export EMCC_CFLAGS="-Os ${EMCC_COMMON_FLAGS[*]}"
+    CARGO_PARAMS=(--release "${@:2}")
+else
+    export EMCC_CFLAGS="-g -sVERBOSE=1 -sMALLOC=$EM_MALLOC ${EMCC_COMMON_FLAGS[*]}"
+    CARGO_PARAMS=("${@:2}")
+fi
+
+export CARGO_PARAMS
+
+# --------------------
+# Tasks
+# --------------------
+
+clean() {
+    cargo clean
+}
+
+setup() {
+    :
+}
+
+build() {
+    cargo build "${CARGO_PARAMS[@]}"
+}
+
+copy_artifacts() {
+    local dest=$1
+    local base="target/$CARGO_BUILD_TARGET/$BUILD_MODE"
+
+    mkdir -p "$dest"
+
+    cp "$base/graph_wasm.js"   "$dest/$BUILD_NAME.js"
+    cp "$base/graph_wasm.wasm" "$dest/$BUILD_NAME.wasm"
+
+    sed -i "s/graph_wasm.wasm/$BUILD_NAME.wasm?version=$CURRENT_VERSION/g" \
+        "$dest/$BUILD_NAME.js"
+}
+
+copy_shared_artifact() {
+    :
+}
diff --git a/graph-wasm/build b/graph-wasm/build
new file mode 100755
index 0000000000..1107f12c3f
--- /dev/null
+++ b/graph-wasm/build
@@ -0,0 +1,20 @@
+#!/usr/bin/env bash
+
+EMSDK_QUIET=1 . /opt/emsdk/emsdk_env.sh
+
+_SCRIPT_DIR=$(cd "$(dirname "$0")" && pwd);
+pushd $_SCRIPT_DIR;
+
+. ./_build_env
+
+set -ex;
+
+setup;
+build;
+copy_artifacts "../frontend/resources/public/js";
+copy_shared_artifact;
+
+exit $?;
+
+popd
+
diff --git a/graph-wasm/build.log b/graph-wasm/build.log
new file mode 100644
index 0000000000..aab4f223df
--- /dev/null
+++ b/graph-wasm/build.log
@@ -0,0 +1,26 @@
+~/penpot/graph-wasm ~/penpot/graph-wasm
+./_build_env: line 60: export: `CXX_wasm32-unknown-emscripten=/home/penpot/penpot/graph-wasm/wrapper-em++.sh': not a valid identifier
+./_build_env: line 110: export: `CXXFLAGS_wasm32-unknown-emscripten=-ffunction-sections -fdata-sections -fexceptions --target=wasm32-unknown-emscripten': not a valid identifier
++ setup
++ true
++ build
++ cargo build
+   Compiling graph v0.1.0 (/home/penpot/penpot/graph-wasm)
+warning: unused import: `Error`
+ --> src/main.rs:1:48
+  |
+1 | use lbug::{Database, Connection, SystemConfig, Error};
+  |                                                ^^^^^
+  |
+  = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
+
+warning: variable does not need to be mutable
+  --> src/main.rs:23:9
+   |
+23 |     let mut conn = match Connection::new(&db) {
+   |         ----^^^^
+   |         |
+   |         help: remove this `mut`
+   |
+   = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
+
diff --git a/graph-wasm/build.rs b/graph-wasm/build.rs
new file mode 100644
index 0000000000..1f151b4e94
--- /dev/null
+++ b/graph-wasm/build.rs
@@ -0,0 +1,2 @@
+// We need this empty script so OUT_DIR is automatically set
+fn main() {}
diff --git a/graph-wasm/exports.txt b/graph-wasm/exports.txt
new file mode 100644
index 0000000000..cc71b6d709
--- /dev/null
+++ b/graph-wasm/exports.txt
@@ -0,0 +1,11 @@
+_hello
+_generate_db
+_init
+_search_similar_shapes
+_free_similar_shapes_buffer
+_set_shape_parent
+_set_shape_selrect
+_set_shape_type
+_use_shape
+
+
diff --git a/graph-wasm/lbug-0.12.2/.gitignore b/graph-wasm/lbug-0.12.2/.gitignore
new file mode 100644
index 0000000000..391ed4d660
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/.gitignore
@@ -0,0 +1,5 @@
+target/
+debug/
+
+**/*.rs.bk
+
diff --git a/graph-wasm/lbug-0.12.2/Cargo.lock b/graph-wasm/lbug-0.12.2/Cargo.lock
new file mode 100644
index 0000000000..14cd17d92d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/Cargo.lock
@@ -0,0 +1,1234 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 3
+
+[[package]]
+name = "ahash"
+version = "0.8.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5a15f179cd60c4584b8a8c596927aadc462e27f2ca70c04e0071964a73ba7a75"
+dependencies = [
+ "cfg-if",
+ "const-random",
+ "getrandom 0.3.3",
+ "once_cell",
+ "version_check",
+ "zerocopy",
+]
+
+[[package]]
+name = "aho-corasick"
+version = "1.1.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8e60d3430d3a69478ad0993f19238d2df97c507009a52b3c10addcd7f6bcb916"
+dependencies = [
+ "memchr",
+]
+
+[[package]]
+name = "android_system_properties"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "819e7219dbd41043ac279b19830f2efc897156490d7fd6ea916720117ee66311"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "anstyle"
+version = "1.0.11"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "862ed96ca487e809f1c8e5a8447f6ee2cf102f846893800b20cebdf541fc6bbd"
+
+[[package]]
+name = "anyhow"
+version = "1.0.99"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b0674a1ddeecb70197781e945de4b3b8ffb61fa939a5597bcf48503737663100"
+
+[[package]]
+name = "arrayvec"
+version = "0.7.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7c02d123df017efcdfbd739ef81735b36c5ba83ec3c59c80a9d7ecc718f92e50"
+
+[[package]]
+name = "arrow"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f3f15b4c6b148206ff3a2b35002e08929c2462467b62b9c02036d9c34f9ef994"
+dependencies = [
+ "arrow-arith",
+ "arrow-array",
+ "arrow-buffer",
+ "arrow-cast",
+ "arrow-data",
+ "arrow-ord",
+ "arrow-row",
+ "arrow-schema",
+ "arrow-select",
+ "arrow-string",
+]
+
+[[package]]
+name = "arrow-arith"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "30feb679425110209ae35c3fbf82404a39a4c0436bb3ec36164d8bffed2a4ce4"
+dependencies = [
+ "arrow-array",
+ "arrow-buffer",
+ "arrow-data",
+ "arrow-schema",
+ "chrono",
+ "num",
+]
+
+[[package]]
+name = "arrow-array"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "70732f04d285d49054a48b72c54f791bb3424abae92d27aafdf776c98af161c8"
+dependencies = [
+ "ahash",
+ "arrow-buffer",
+ "arrow-data",
+ "arrow-schema",
+ "chrono",
+ "half",
+ "hashbrown",
+ "num",
+]
+
+[[package]]
+name = "arrow-buffer"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "169b1d5d6cb390dd92ce582b06b23815c7953e9dfaaea75556e89d890d19993d"
+dependencies = [
+ "bytes",
+ "half",
+ "num",
+]
+
+[[package]]
+name = "arrow-cast"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e4f12eccc3e1c05a766cafb31f6a60a46c2f8efec9b74c6e0648766d30686af8"
+dependencies = [
+ "arrow-array",
+ "arrow-buffer",
+ "arrow-data",
+ "arrow-schema",
+ "arrow-select",
+ "atoi",
+ "base64",
+ "chrono",
+ "half",
+ "lexical-core",
+ "num",
+ "ryu",
+]
+
+[[package]]
+name = "arrow-data"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8de1ce212d803199684b658fc4ba55fb2d7e87b213de5af415308d2fee3619c2"
+dependencies = [
+ "arrow-buffer",
+ "arrow-schema",
+ "half",
+ "num",
+]
+
+[[package]]
+name = "arrow-ord"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6506e3a059e3be23023f587f79c82ef0bcf6d293587e3272d20f2d30b969b5a7"
+dependencies = [
+ "arrow-array",
+ "arrow-buffer",
+ "arrow-data",
+ "arrow-schema",
+ "arrow-select",
+]
+
+[[package]]
+name = "arrow-row"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "52bf7393166beaf79b4bed9bfdf19e97472af32ce5b6b48169d321518a08cae2"
+dependencies = [
+ "arrow-array",
+ "arrow-buffer",
+ "arrow-data",
+ "arrow-schema",
+ "half",
+]
+
+[[package]]
+name = "arrow-schema"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "af7686986a3bf2254c9fb130c623cdcb2f8e1f15763e7c71c310f0834da3d292"
+dependencies = [
+ "bitflags",
+]
+
+[[package]]
+name = "arrow-select"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dd2b45757d6a2373faa3352d02ff5b54b098f5e21dccebc45a21806bc34501e5"
+dependencies = [
+ "ahash",
+ "arrow-array",
+ "arrow-buffer",
+ "arrow-data",
+ "arrow-schema",
+ "num",
+]
+
+[[package]]
+name = "arrow-string"
+version = "55.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0377d532850babb4d927a06294314b316e23311503ed580ec6ce6a0158f49d40"
+dependencies = [
+ "arrow-array",
+ "arrow-buffer",
+ "arrow-data",
+ "arrow-schema",
+ "arrow-select",
+ "memchr",
+ "num",
+ "regex",
+ "regex-syntax",
+]
+
+[[package]]
+name = "atoi"
+version = "2.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f28d99ec8bfea296261ca1af174f24225171fea9664ba9003cbebee704810528"
+dependencies = [
+ "num-traits",
+]
+
+[[package]]
+name = "autocfg"
+version = "1.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c08606f8c3cbf4ce6ec8e28fb0014a2c086708fe954eaa885384a6165172e7e8"
+
+[[package]]
+name = "base64"
+version = "0.22.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "72b3254f16251a8381aa12e40e3c4d2f0199f8c6508fbecb9d91f575e0fbb8c6"
+
+[[package]]
+name = "bitflags"
+version = "2.9.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2261d10cca569e4643e526d8dc2e62e433cc8aba21ab764233731f8d369bf394"
+
+[[package]]
+name = "bumpalo"
+version = "3.19.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "46c5e41b57b8bba42a04676d81cb89e9ee8e859a1a66f80a5a72e1cb76b34d43"
+
+[[package]]
+name = "bytes"
+version = "1.10.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d71b6127be86fdcfddb610f7182ac57211d4b18a3e9c82eb2d17662f2227ad6a"
+
+[[package]]
+name = "cc"
+version = "1.2.36"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5252b3d2648e5eedbc1a6f501e3c795e07025c1e93bbf8bbdd6eef7f447a6d54"
+dependencies = [
+ "find-msvc-tools",
+ "shlex",
+]
+
+[[package]]
+name = "cfg-if"
+version = "1.0.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2fd1289c04a9ea8cb22300a459a72a385d7c73d3259e2ed7dcb2af674838cfa9"
+
+[[package]]
+name = "chrono"
+version = "0.4.42"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "145052bdd345b87320e369255277e3fb5152762ad123a901ef5c262dd38fe8d2"
+dependencies = [
+ "iana-time-zone",
+ "num-traits",
+ "windows-link 0.2.0",
+]
+
+[[package]]
+name = "clap"
+version = "4.5.47"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7eac00902d9d136acd712710d71823fb8ac8004ca445a89e73a41d45aa712931"
+dependencies = [
+ "clap_builder",
+]
+
+[[package]]
+name = "clap_builder"
+version = "4.5.47"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2ad9bbf750e73b5884fb8a211a9424a1906c1e156724260fdae972f31d70e1d6"
+dependencies = [
+ "anstyle",
+ "clap_lex",
+ "strsim",
+]
+
+[[package]]
+name = "clap_lex"
+version = "0.7.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b94f61472cee1439c0b966b47e3aca9ae07e45d070759512cd390ea2bebc6675"
+
+[[package]]
+name = "cmake"
+version = "0.1.54"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e7caa3f9de89ddbe2c607f4101924c5abec803763ae9534e4f4d7d8f84aa81f0"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "codespan-reporting"
+version = "0.11.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3538270d33cc669650c4b093848450d380def10c331d38c768e34cac80576e6e"
+dependencies = [
+ "termcolor",
+ "unicode-width",
+]
+
+[[package]]
+name = "const-random"
+version = "0.1.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "87e00182fe74b066627d63b85fd550ac2998d4b0bd86bfed477a0ae4c7c71359"
+dependencies = [
+ "const-random-macro",
+]
+
+[[package]]
+name = "const-random-macro"
+version = "0.1.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f9d839f2a20b0aee515dc581a6172f2321f96cab76c1a38a4c584a194955390e"
+dependencies = [
+ "getrandom 0.2.16",
+ "once_cell",
+ "tiny-keccak",
+]
+
+[[package]]
+name = "core-foundation-sys"
+version = "0.8.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "773648b94d0e5d620f64f280777445740e61fe701025087ec8b57f45c791888b"
+
+[[package]]
+name = "crunchy"
+version = "0.2.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "460fbee9c2c2f33933d720630a6a0bac33ba7053db5344fac858d4b8952d77d5"
+
+[[package]]
+name = "cxx"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3956d60afa98653c5a57f60d7056edd513bfe0307ef6fb06f6167400c3884459"
+dependencies = [
+ "cc",
+ "cxxbridge-cmd",
+ "cxxbridge-flags",
+ "cxxbridge-macro",
+ "foldhash",
+ "link-cplusplus",
+]
+
+[[package]]
+name = "cxx-build"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9a4b7522f539fe056f1d6fc8577d8ab731451f6f33a89b1e5912e22b76c553e7"
+dependencies = [
+ "cc",
+ "codespan-reporting",
+ "proc-macro2",
+ "quote",
+ "scratch",
+ "syn",
+]
+
+[[package]]
+name = "cxxbridge-cmd"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0f01e92ab4ce9fd4d16e3bb11b158d98cbdcca803c1417aa43130a6526fbf208"
+dependencies = [
+ "clap",
+ "codespan-reporting",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "cxxbridge-flags"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8c41cbfab344869e70998b388923f7d1266588f56c8ca284abf259b1c1ffc695"
+
+[[package]]
+name = "cxxbridge-macro"
+version = "1.0.138"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "88d82a2f759f0ad3eae43b96604efd42b1d4729a35a6f2dc7bdb797ae25d9284"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "rustversion",
+ "syn",
+]
+
+[[package]]
+name = "deranged"
+version = "0.5.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d630bccd429a5bb5a64b5e94f693bfc48c9f8566418fda4c494cc94f911f87cc"
+dependencies = [
+ "powerfmt",
+]
+
+[[package]]
+name = "errno"
+version = "0.3.13"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "778e2ac28f6c47af28e4907f13ffd1e1ddbd400980a9abd7c8df189bf578a5ad"
+dependencies = [
+ "libc",
+ "windows-sys 0.60.2",
+]
+
+[[package]]
+name = "fastrand"
+version = "2.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "37909eebbb50d72f9059c3b6d82c0463f2ff062c9e95845c43a6c9c0355411be"
+
+[[package]]
+name = "find-msvc-tools"
+version = "0.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7fd99930f64d146689264c637b5af2f0233a933bef0d8570e2526bf9e083192d"
+
+[[package]]
+name = "foldhash"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d9c4f5dac5e15c24eb999c26181a6ca40b39fe946cbe4c263c7209467bc83af2"
+
+[[package]]
+name = "getrandom"
+version = "0.2.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "335ff9f135e4384c8150d6f27c6daed433577f86b4750418338c01a1a2528592"
+dependencies = [
+ "cfg-if",
+ "libc",
+ "wasi 0.11.1+wasi-snapshot-preview1",
+]
+
+[[package]]
+name = "getrandom"
+version = "0.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "26145e563e54f2cadc477553f1ec5ee650b00862f0a58bcd12cbdc5f0ea2d2f4"
+dependencies = [
+ "cfg-if",
+ "libc",
+ "r-efi",
+ "wasi 0.14.4+wasi-0.2.4",
+]
+
+[[package]]
+name = "half"
+version = "2.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "459196ed295495a68f7d7fe1d84f6c4b7ff0e21fe3017b2f283c6fac3ad803c9"
+dependencies = [
+ "cfg-if",
+ "crunchy",
+ "num-traits",
+]
+
+[[package]]
+name = "hashbrown"
+version = "0.15.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9229cfe53dfd69f0609a49f65461bd93001ea1ef889cd5529dd176593f5338a1"
+
+[[package]]
+name = "iana-time-zone"
+version = "0.1.63"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b0c919e5debc312ad217002b8048a17b7d83f80703865bbfcfebb0458b0b27d8"
+dependencies = [
+ "android_system_properties",
+ "core-foundation-sys",
+ "iana-time-zone-haiku",
+ "js-sys",
+ "log",
+ "wasm-bindgen",
+ "windows-core",
+]
+
+[[package]]
+name = "iana-time-zone-haiku"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f31827a206f56af32e590ba56d5d2d085f558508192593743f16b2306495269f"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "js-sys"
+version = "0.3.78"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0c0b063578492ceec17683ef2f8c5e89121fbd0b172cbc280635ab7567db2738"
+dependencies = [
+ "once_cell",
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "lbug"
+version = "0.12.2"
+dependencies = [
+ "anyhow",
+ "arrow",
+ "cmake",
+ "cxx",
+ "cxx-build",
+ "rust_decimal",
+ "rust_decimal_macros",
+ "rustversion",
+ "tempfile",
+ "time",
+ "uuid",
+]
+
+[[package]]
+name = "lexical-core"
+version = "1.0.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b765c31809609075565a70b4b71402281283aeda7ecaf4818ac14a7b2ade8958"
+dependencies = [
+ "lexical-parse-float",
+ "lexical-parse-integer",
+ "lexical-util",
+ "lexical-write-float",
+ "lexical-write-integer",
+]
+
+[[package]]
+name = "lexical-parse-float"
+version = "1.0.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "de6f9cb01fb0b08060209a057c048fcbab8717b4c1ecd2eac66ebfe39a65b0f2"
+dependencies = [
+ "lexical-parse-integer",
+ "lexical-util",
+ "static_assertions",
+]
+
+[[package]]
+name = "lexical-parse-integer"
+version = "1.0.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "72207aae22fc0a121ba7b6d479e42cbfea549af1479c3f3a4f12c70dd66df12e"
+dependencies = [
+ "lexical-util",
+ "static_assertions",
+]
+
+[[package]]
+name = "lexical-util"
+version = "1.0.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5a82e24bf537fd24c177ffbbdc6ebcc8d54732c35b50a3f28cc3f4e4c949a0b3"
+dependencies = [
+ "static_assertions",
+]
+
+[[package]]
+name = "lexical-write-float"
+version = "1.0.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c5afc668a27f460fb45a81a757b6bf2f43c2d7e30cb5a2dcd3abf294c78d62bd"
+dependencies = [
+ "lexical-util",
+ "lexical-write-integer",
+ "static_assertions",
+]
+
+[[package]]
+name = "lexical-write-integer"
+version = "1.0.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "629ddff1a914a836fb245616a7888b62903aae58fa771e1d83943035efa0f978"
+dependencies = [
+ "lexical-util",
+ "static_assertions",
+]
+
+[[package]]
+name = "libc"
+version = "0.2.175"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6a82ae493e598baaea5209805c49bbf2ea7de956d50d7da0da1164f9c6d28543"
+
+[[package]]
+name = "libm"
+version = "0.2.15"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f9fbbcab51052fe104eb5e5d351cf728d30a5be1fe14d9be8a3b097481fb97de"
+
+[[package]]
+name = "link-cplusplus"
+version = "1.0.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7f78c730aaa7d0b9336a299029ea49f9ee53b0ed06e9202e8cb7db9bae7b8c82"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "linux-raw-sys"
+version = "0.9.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cd945864f07fe9f5371a27ad7b52a172b4b499999f1d97574c9fa68373937e12"
+
+[[package]]
+name = "log"
+version = "0.4.28"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "34080505efa8e45a4b816c349525ebe327ceaa8559756f0356cba97ef3bf7432"
+
+[[package]]
+name = "memchr"
+version = "2.7.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "32a282da65faaf38286cf3be983213fcf1d2e2a58700e808f83f4ea9a4804bc0"
+
+[[package]]
+name = "num"
+version = "0.4.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "35bd024e8b2ff75562e5f34e7f4905839deb4b22955ef5e73d2fea1b9813cb23"
+dependencies = [
+ "num-bigint",
+ "num-complex",
+ "num-integer",
+ "num-iter",
+ "num-rational",
+ "num-traits",
+]
+
+[[package]]
+name = "num-bigint"
+version = "0.4.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a5e44f723f1133c9deac646763579fdb3ac745e418f2a7af9cd0c431da1f20b9"
+dependencies = [
+ "num-integer",
+ "num-traits",
+]
+
+[[package]]
+name = "num-complex"
+version = "0.4.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "73f88a1307638156682bada9d7604135552957b7818057dcef22705b4d509495"
+dependencies = [
+ "num-traits",
+]
+
+[[package]]
+name = "num-conv"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "51d515d32fb182ee37cda2ccdcb92950d6a3c2893aa280e540671c2cd0f3b1d9"
+
+[[package]]
+name = "num-integer"
+version = "0.1.46"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7969661fd2958a5cb096e56c8e1ad0444ac2bbcd0061bd28660485a44879858f"
+dependencies = [
+ "num-traits",
+]
+
+[[package]]
+name = "num-iter"
+version = "0.1.45"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1429034a0490724d0075ebb2bc9e875d6503c3cf69e235a8941aa757d83ef5bf"
+dependencies = [
+ "autocfg",
+ "num-integer",
+ "num-traits",
+]
+
+[[package]]
+name = "num-rational"
+version = "0.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f83d14da390562dca69fc84082e73e548e1ad308d24accdedd2720017cb37824"
+dependencies = [
+ "num-bigint",
+ "num-integer",
+ "num-traits",
+]
+
+[[package]]
+name = "num-traits"
+version = "0.2.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "071dfc062690e90b734c0b2273ce72ad0ffa95f0c74596bc250dcfd960262841"
+dependencies = [
+ "autocfg",
+ "libm",
+]
+
+[[package]]
+name = "once_cell"
+version = "1.21.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "42f5e15c9953c5e4ccceeb2e7382a716482c34515315f7b03532b8b4e8393d2d"
+
+[[package]]
+name = "powerfmt"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "439ee305def115ba05938db6eb1644ff94165c5ab5e9420d1c1bcedbba909391"
+
+[[package]]
+name = "proc-macro2"
+version = "1.0.101"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "89ae43fd86e4158d6db51ad8e2b80f313af9cc74f5c0e03ccb87de09998732de"
+dependencies = [
+ "unicode-ident",
+]
+
+[[package]]
+name = "quote"
+version = "1.0.40"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1885c039570dc00dcb4ff087a89e185fd56bae234ddc7f056a945bf36467248d"
+dependencies = [
+ "proc-macro2",
+]
+
+[[package]]
+name = "r-efi"
+version = "5.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "69cdb34c158ceb288df11e18b4bd39de994f6657d83847bdffdbd7f346754b0f"
+
+[[package]]
+name = "regex"
+version = "1.11.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "23d7fd106d8c02486a8d64e778353d1cffe08ce79ac2e82f540c86d0facf6912"
+dependencies = [
+ "aho-corasick",
+ "memchr",
+ "regex-automata",
+ "regex-syntax",
+]
+
+[[package]]
+name = "regex-automata"
+version = "0.4.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6b9458fa0bfeeac22b5ca447c63aaf45f28439a709ccd244698632f9aa6394d6"
+dependencies = [
+ "aho-corasick",
+ "memchr",
+ "regex-syntax",
+]
+
+[[package]]
+name = "regex-syntax"
+version = "0.8.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "caf4aa5b0f434c91fe5c7f1ecb6a5ece2130b02ad2a590589dda5146df959001"
+
+[[package]]
+name = "rust_decimal"
+version = "1.37.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b203a6425500a03e0919c42d3c47caca51e79f1132046626d2c8871c5092035d"
+dependencies = [
+ "arrayvec",
+ "num-traits",
+]
+
+[[package]]
+name = "rust_decimal_macros"
+version = "1.37.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f6268b74858287e1a062271b988a0c534bf85bbeb567fe09331bf40ed78113d5"
+dependencies = [
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "rustix"
+version = "1.0.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "11181fbabf243db407ef8df94a6ce0b2f9a733bd8be4ad02b4eda9602296cac8"
+dependencies = [
+ "bitflags",
+ "errno",
+ "libc",
+ "linux-raw-sys",
+ "windows-sys 0.60.2",
+]
+
+[[package]]
+name = "rustversion"
+version = "1.0.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b39cdef0fa800fc44525c84ccb54a029961a8215f9619753635a9c0d2538d46d"
+
+[[package]]
+name = "ryu"
+version = "1.0.20"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "28d3b2b1366ec20994f1fd18c3c594f05c5dd4bc44d8bb0c1c632c8d6829481f"
+
+[[package]]
+name = "scratch"
+version = "1.0.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d68f2ec51b097e4c1a75b681a8bec621909b5e91f15bb7b840c4f2f7b01148b2"
+
+[[package]]
+name = "serde"
+version = "1.0.219"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5f0e2c6ed6606019b4e29e69dbaba95b11854410e5347d525002456dbbb786b6"
+dependencies = [
+ "serde_derive",
+]
+
+[[package]]
+name = "serde_derive"
+version = "1.0.219"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5b0276cf7f2c73365f7157c8123c21cd9a50fbbd844757af28ca1f5925fc2a00"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "shlex"
+version = "1.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0fda2ff0d084019ba4d7c6f371c95d8fd75ce3524c3cb8fb653a3023f6323e64"
+
+[[package]]
+name = "static_assertions"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a2eb9349b6444b326872e140eb1cf5e7c522154d69e7a0ffb0fb81c06b37543f"
+
+[[package]]
+name = "strsim"
+version = "0.11.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7da8b5736845d9f2fcb837ea5d9e2628564b3b043a70948a3f0b778838c5fb4f"
+
+[[package]]
+name = "syn"
+version = "2.0.106"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ede7c438028d4436d71104916910f5bb611972c5cfd7f89b8300a8186e6fada6"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "unicode-ident",
+]
+
+[[package]]
+name = "tempfile"
+version = "3.21.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "15b61f8f20e3a6f7e0649d825294eaf317edce30f82cf6026e7e4cb9222a7d1e"
+dependencies = [
+ "fastrand",
+ "getrandom 0.3.3",
+ "once_cell",
+ "rustix",
+ "windows-sys 0.60.2",
+]
+
+[[package]]
+name = "termcolor"
+version = "1.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "06794f8f6c5c898b3275aebefa6b8a1cb24cd2c6c79397ab15774837a0bc5755"
+dependencies = [
+ "winapi-util",
+]
+
+[[package]]
+name = "time"
+version = "0.3.43"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "83bde6f1ec10e72d583d91623c939f623002284ef622b87de38cfd546cbf2031"
+dependencies = [
+ "deranged",
+ "num-conv",
+ "powerfmt",
+ "serde",
+ "time-core",
+ "time-macros",
+]
+
+[[package]]
+name = "time-core"
+version = "0.1.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "40868e7c1d2f0b8d73e4a8c7f0ff63af4f6d19be117e90bd73eb1d62cf831c6b"
+
+[[package]]
+name = "time-macros"
+version = "0.2.24"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "30cfb0125f12d9c277f35663a0a33f8c30190f4e4574868a330595412d34ebf3"
+dependencies = [
+ "num-conv",
+ "time-core",
+]
+
+[[package]]
+name = "tiny-keccak"
+version = "2.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2c9d3793400a45f954c52e73d068316d76b6f4e36977e3fcebb13a2721e80237"
+dependencies = [
+ "crunchy",
+]
+
+[[package]]
+name = "unicode-ident"
+version = "1.0.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5a5f39404a5da50712a4c1eecf25e90dd62b613502b7e925fd4e4d19b5c96512"
+
+[[package]]
+name = "unicode-width"
+version = "0.1.14"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7dd6e30e90baa6f72411720665d41d89b9a3d039dc45b8faea1ddd07f617f6af"
+
+[[package]]
+name = "uuid"
+version = "1.18.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2f87b8aa10b915a06587d0dec516c282ff295b475d94abf425d62b57710070a2"
+dependencies = [
+ "js-sys",
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "version_check"
+version = "0.9.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0b928f33d975fc6ad9f86c8f283853ad26bdd5b10b7f1542aa2fa15e2289105a"
+
+[[package]]
+name = "wasi"
+version = "0.11.1+wasi-snapshot-preview1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ccf3ec651a847eb01de73ccad15eb7d99f80485de043efb2f370cd654f4ea44b"
+
+[[package]]
+name = "wasi"
+version = "0.14.4+wasi-0.2.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "88a5f4a424faf49c3c2c344f166f0662341d470ea185e939657aaff130f0ec4a"
+dependencies = [
+ "wit-bindgen",
+]
+
+[[package]]
+name = "wasm-bindgen"
+version = "0.2.101"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7e14915cadd45b529bb8d1f343c4ed0ac1de926144b746e2710f9cd05df6603b"
+dependencies = [
+ "cfg-if",
+ "once_cell",
+ "rustversion",
+ "wasm-bindgen-macro",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-backend"
+version = "0.2.101"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e28d1ba982ca7923fd01448d5c30c6864d0a14109560296a162f80f305fb93bb"
+dependencies = [
+ "bumpalo",
+ "log",
+ "proc-macro2",
+ "quote",
+ "syn",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-macro"
+version = "0.2.101"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7c3d463ae3eff775b0c45df9da45d68837702ac35af998361e2c84e7c5ec1b0d"
+dependencies = [
+ "quote",
+ "wasm-bindgen-macro-support",
+]
+
+[[package]]
+name = "wasm-bindgen-macro-support"
+version = "0.2.101"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7bb4ce89b08211f923caf51d527662b75bdc9c9c7aab40f86dcb9fb85ac552aa"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+ "wasm-bindgen-backend",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-shared"
+version = "0.2.101"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f143854a3b13752c6950862c906306adb27c7e839f7414cec8fea35beab624c1"
+dependencies = [
+ "unicode-ident",
+]
+
+[[package]]
+name = "winapi-util"
+version = "0.1.11"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c2a7b1c03c876122aa43f3020e6c3c3ee5c05081c9a00739faf7503aeba10d22"
+dependencies = [
+ "windows-sys 0.61.0",
+]
+
+[[package]]
+name = "windows-core"
+version = "0.61.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c0fdd3ddb90610c7638aa2b3a3ab2904fb9e5cdbecc643ddb3647212781c4ae3"
+dependencies = [
+ "windows-implement",
+ "windows-interface",
+ "windows-link 0.1.3",
+ "windows-result",
+ "windows-strings",
+]
+
+[[package]]
+name = "windows-implement"
+version = "0.60.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a47fddd13af08290e67f4acabf4b459f647552718f683a7b415d290ac744a836"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "windows-interface"
+version = "0.59.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bd9211b69f8dcdfa817bfd14bf1c97c9188afa36f4750130fcdf3f400eca9fa8"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "windows-link"
+version = "0.1.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5e6ad25900d524eaabdbbb96d20b4311e1e7ae1699af4fb28c17ae66c80d798a"
+
+[[package]]
+name = "windows-link"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "45e46c0661abb7180e7b9c281db115305d49ca1709ab8242adf09666d2173c65"
+
+[[package]]
+name = "windows-result"
+version = "0.3.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "56f42bd332cc6c8eac5af113fc0c1fd6a8fd2aa08a0119358686e5160d0586c6"
+dependencies = [
+ "windows-link 0.1.3",
+]
+
+[[package]]
+name = "windows-strings"
+version = "0.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "56e6c93f3a0c3b36176cb1327a4958a0353d5d166c2a35cb268ace15e91d3b57"
+dependencies = [
+ "windows-link 0.1.3",
+]
+
+[[package]]
+name = "windows-sys"
+version = "0.60.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f2f500e4d28234f72040990ec9d39e3a6b950f9f22d3dba18416c35882612bcb"
+dependencies = [
+ "windows-targets",
+]
+
+[[package]]
+name = "windows-sys"
+version = "0.61.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e201184e40b2ede64bc2ea34968b28e33622acdbbf37104f0e4a33f7abe657aa"
+dependencies = [
+ "windows-link 0.2.0",
+]
+
+[[package]]
+name = "windows-targets"
+version = "0.53.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d5fe6031c4041849d7c496a8ded650796e7b6ecc19df1a431c1a363342e5dc91"
+dependencies = [
+ "windows-link 0.1.3",
+ "windows_aarch64_gnullvm",
+ "windows_aarch64_msvc",
+ "windows_i686_gnu",
+ "windows_i686_gnullvm",
+ "windows_i686_msvc",
+ "windows_x86_64_gnu",
+ "windows_x86_64_gnullvm",
+ "windows_x86_64_msvc",
+]
+
+[[package]]
+name = "windows_aarch64_gnullvm"
+version = "0.53.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "86b8d5f90ddd19cb4a147a5fa63ca848db3df085e25fee3cc10b39b6eebae764"
+
+[[package]]
+name = "windows_aarch64_msvc"
+version = "0.53.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c7651a1f62a11b8cbd5e0d42526e55f2c99886c77e007179efff86c2b137e66c"
+
+[[package]]
+name = "windows_i686_gnu"
+version = "0.53.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c1dc67659d35f387f5f6c479dc4e28f1d4bb90ddd1a5d3da2e5d97b42d6272c3"
+
+[[package]]
+name = "windows_i686_gnullvm"
+version = "0.53.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9ce6ccbdedbf6d6354471319e781c0dfef054c81fbc7cf83f338a4296c0cae11"
+
+[[package]]
+name = "windows_i686_msvc"
+version = "0.53.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "581fee95406bb13382d2f65cd4a908ca7b1e4c2f1917f143ba16efe98a589b5d"
+
+[[package]]
+name = "windows_x86_64_gnu"
+version = "0.53.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2e55b5ac9ea33f2fc1716d1742db15574fd6fc8dadc51caab1c16a3d3b4190ba"
+
+[[package]]
+name = "windows_x86_64_gnullvm"
+version = "0.53.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0a6e035dd0599267ce1ee132e51c27dd29437f63325753051e71dd9e42406c57"
+
+[[package]]
+name = "windows_x86_64_msvc"
+version = "0.53.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "271414315aff87387382ec3d271b52d7ae78726f5d44ac98b4f4030c91880486"
+
+[[package]]
+name = "wit-bindgen"
+version = "0.45.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5c573471f125075647d03df72e026074b7203790d41351cd6edc96f46bcccd36"
+
+[[package]]
+name = "zerocopy"
+version = "0.8.27"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0894878a5fa3edfd6da3f88c4805f4c8558e2b996227a3d864f47fe11e38282c"
+dependencies = [
+ "zerocopy-derive",
+]
+
+[[package]]
+name = "zerocopy-derive"
+version = "0.8.27"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "88d2b8d9c68ad2b9e4340d7832716a4d21a22a1154777ad56ea55c51a9cf3831"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
diff --git a/graph-wasm/lbug-0.12.2/Cargo.toml b/graph-wasm/lbug-0.12.2/Cargo.toml
new file mode 100644
index 0000000000..ea839f84c3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/Cargo.toml
@@ -0,0 +1,144 @@
+# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
+#
+# When uploading crates to the registry Cargo will automatically
+# "normalize" Cargo.toml files for maximal compatibility
+# with all versions of Cargo and also rewrite `path` dependencies
+# to registry (e.g., crates.io) dependencies.
+#
+# If you are reading this file be aware that the original Cargo.toml
+# will likely look very different (and much more reasonable).
+# See Cargo.toml.orig for the original contents.
+
+[package]
+edition = "2021"
+rust-version = "1.81"
+name = "lbug"
+version = "0.12.2"
+build = "build.rs"
+include = [
+    "build.rs",
+    "/src",
+    "/include",
+    "/lbug-src/src",
+    "/lbug-src/cmake",
+    "/lbug-src/third_party",
+    "/lbug-src/CMakeLists.txt",
+    "/lbug-src/tools/CMakeLists.txt",
+]
+autolib = false
+autobins = false
+autoexamples = false
+autotests = false
+autobenches = false
+description = "An in-process property graph database management system built for query speed and scalability"
+homepage = "https://ladybugdb.com/"
+readme = "lbug-src/README.md"
+keywords = [
+    "database",
+    "graph",
+    "ffi",
+]
+categories = ["database"]
+license = "MIT"
+repository = "https://github.com/lbugdb/lbug"
+
+[package.metadata.docs.rs]
+all-features = true
+
+[features]
+arrow = ["dep:arrow"]
+default = []
+extension_tests = []
+
+[lib]
+name = "lbug"
+path = "src/lib.rs"
+
+[dependencies.arrow]
+version = "55"
+features = ["ffi"]
+optional = true
+default-features = false
+
+[dependencies.cxx]
+version = "=1.0.138"
+
+[dependencies.rust_decimal]
+version = "1.37"
+default-features = false
+
+[dependencies.time]
+version = "0.3"
+
+[dependencies.uuid]
+version = "1.6"
+
+[dev-dependencies.anyhow]
+version = "1"
+
+[dev-dependencies.rust_decimal_macros]
+version = "1.37"
+
+[dev-dependencies.tempfile]
+version = "3"
+
+[dev-dependencies.time]
+version = "0.3"
+features = ["macros"]
+
+[build-dependencies.cmake]
+version = "0.1"
+
+[build-dependencies.cxx-build]
+version = "=1.0.138"
+
+[build-dependencies.rustversion]
+version = "1"
+
+[lints.clippy]
+inline_always = "allow"
+missing_errors_doc = "allow"
+missing_panics_doc = "allow"
+module_name_repetitions = "allow"
+must_use_candidate = "allow"
+needless_pass_by_value = "allow"
+redundant_closure_for_method_calls = "allow"
+return_self_not_must_use = "allow"
+similar_names = "allow"
+struct_excessive_bools = "allow"
+too_many_arguments = "allow"
+too_many_lines = "allow"
+type_complexity = "allow"
+unreadable_literal = "allow"
+
+[lints.clippy.cargo]
+level = "warn"
+priority = -1
+
+[lints.clippy.complexity]
+level = "warn"
+priority = -1
+
+[lints.clippy.correctness]
+level = "warn"
+priority = -1
+
+[lints.clippy.pedantic]
+level = "warn"
+priority = -1
+
+[lints.clippy.perf]
+level = "warn"
+priority = -1
+
+[lints.clippy.style]
+level = "warn"
+priority = -1
+
+[lints.clippy.suspicious]
+level = "warn"
+priority = -1
+
+[profile.relwithdebinfo]
+debug = 2
+inherits = "release"
diff --git a/graph-wasm/lbug-0.12.2/build.rs b/graph-wasm/lbug-0.12.2/build.rs
new file mode 100644
index 0000000000..23f644a5af
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/build.rs
@@ -0,0 +1,283 @@
+use std::env;
+use std::path::{Path, PathBuf};
+
+fn link_mode() -> &'static str {
+    if env::var("LBUG_SHARED").is_ok() {
+        "dylib"
+    } else {
+        "static"
+    }
+}
+
+fn get_target() -> String {
+    env::var("PROFILE").unwrap()
+}
+
+fn is_wasm_emscripten() -> bool {
+    env::var("TARGET")
+        .map(|t| t == "wasm32-unknown-emscripten")
+        .unwrap_or(false)
+}
+
+fn link_libraries() {
+    // For wasm32-unknown-emscripten, we need to link lbug and all its dependencies
+    // These are built by CMake and need to be linked here
+    if is_wasm_emscripten() {
+        // Link all dependencies first (built by CMake)
+        for lib in [
+            "utf8proc",
+            "antlr4_cypher",
+            "antlr4_runtime",
+            "re2",
+            "fastpfor",
+            "parquet",
+            "thrift",
+            "snappy",
+            "zstd",
+            "miniz",
+            "mbedtls",
+            "brotlidec",
+            "brotlicommon",
+            "lz4",
+            "roaring_bitmap",
+            "simsimd",
+        ] {
+            println!("cargo:rustc-link-lib=static={lib}");
+        }
+        // Link the lbug static library (built by CMake)
+        println!("cargo:rustc-link-lib=static=lbug");
+        // Don't link system libraries for wasm (they're handled by Emscripten)
+        return;
+    }
+    
+    // This also needs to be set by any crates using it if they want to use extensions
+    if !cfg!(windows) && link_mode() == "static" {
+        println!("cargo:rustc-link-arg=-rdynamic");
+    }
+    if cfg!(windows) && link_mode() == "dylib" {
+        println!("cargo:rustc-link-lib=dylib=lbug_shared");
+    } else if link_mode() == "dylib" {
+        println!("cargo:rustc-link-lib={}=lbug", link_mode());
+    } else if rustversion::cfg!(since(1.82)) {
+        println!("cargo:rustc-link-lib=static:+whole-archive=lbug");
+    } else {
+        println!("cargo:rustc-link-lib=static=lbug");
+    }
+    if link_mode() == "static" {
+        if cfg!(windows) {
+            println!("cargo:rustc-link-lib=dylib=msvcrt");
+            println!("cargo:rustc-link-lib=dylib=shell32");
+            println!("cargo:rustc-link-lib=dylib=ole32");
+        } else if cfg!(target_os = "macos") {
+            println!("cargo:rustc-link-lib=dylib=c++");
+        } else {
+            println!("cargo:rustc-link-lib=dylib=stdc++");
+        }
+
+        for lib in [
+            "utf8proc",
+            "antlr4_cypher",
+            "antlr4_runtime",
+            "re2",
+            "fastpfor",
+            "parquet",
+            "thrift",
+            "snappy",
+            "zstd",
+            "miniz",
+            "mbedtls",
+            "brotlidec",
+            "brotlicommon",
+            "lz4",
+            "roaring_bitmap",
+            "simsimd",
+        ] {
+            if rustversion::cfg!(since(1.82)) {
+                println!("cargo:rustc-link-lib=static:+whole-archive={lib}");
+            } else {
+                println!("cargo:rustc-link-lib=static={lib}");
+            }
+        }
+    }
+}
+
+fn build_bundled_cmake() -> Vec<PathBuf> {
+    let lbug_root = {
+        let root = Path::new(&std::env::var("CARGO_MANIFEST_DIR").unwrap()).join("lbug-src");
+        if root.is_symlink() || root.is_dir() {
+            root
+        } else {
+            // If the path is not directory, this is probably an in-source build on windows where the
+            // symlink is unreadable.
+            Path::new(&std::env::var("CARGO_MANIFEST_DIR").unwrap()).join("../..")
+        }
+    };
+
+    let mut build = cmake::Config::new(&lbug_root);
+    build
+        .no_build_target(true)
+        .define("BUILD_SHELL", "OFF")
+        .define("BUILD_SINGLE_FILE_HEADER", "OFF")
+        .define("AUTO_UPDATE_GRAMMAR", "OFF");
+    
+    // Configure for wasm32-unknown-emscripten
+    if is_wasm_emscripten() {
+        // Same configuration as ladybug/tools/wasm build
+        build.define("SINGLE_THREADED", "TRUE");
+        // cmake-rs should automatically detect emscripten toolchain when CC/CXX point to emcc/em++
+    } else if cfg!(windows) {
+        build.generator("Ninja");
+        build.cxxflag("/EHsc");
+        build.define("CMAKE_MSVC_RUNTIME_LIBRARY", "MultiThreadedDLL");
+        build.define("CMAKE_POLICY_DEFAULT_CMP0091", "NEW");
+    }
+    if let Ok(jobs) = env::var("NUM_JOBS") {
+        // SAFETY: Setting environment variables in build scripts is safe
+        unsafe {
+            env::set_var("CMAKE_BUILD_PARALLEL_LEVEL", jobs);
+        }
+    }
+    let build_dir = build.build();
+
+    let lbug_lib_path = build_dir.join("build").join("src");
+    println!("cargo:rustc-link-search=native={}", lbug_lib_path.display());
+
+    for dir in [
+        "utf8proc",
+        "antlr4_cypher",
+        "antlr4_runtime",
+        "re2",
+        "brotli",
+        "alp",
+        "fastpfor",
+        "parquet",
+        "thrift",
+        "snappy",
+        "zstd",
+        "miniz",
+        "mbedtls",
+        "lz4",
+        "roaring_bitmap",
+        "simsimd",
+    ] {
+        let lib_path = build_dir
+            .join("build")
+            .join("third_party")
+            .join(dir)
+            .canonicalize()
+            .unwrap_or_else(|_| {
+                panic!(
+                    "Could not find {}/build/third_party/{}",
+                    build_dir.display(),
+                    dir
+                )
+            });
+        println!("cargo:rustc-link-search=native={}", lib_path.display());
+    }
+
+    vec![
+        lbug_root.join("src/include"),
+        build_dir.join("build/src"),
+        build_dir.join("build/src/include"),
+        lbug_root.join("third_party/nlohmann_json"),
+        lbug_root.join("third_party/fastpfor"),
+        lbug_root.join("third_party/alp/include"),
+    ]
+}
+
+fn build_ffi(
+    bridge_file: &str,
+    out_name: &str,
+    source_file: &str,
+    bundled: bool,
+    include_paths: &Vec<PathBuf>,
+) {
+    let mut build = cxx_build::bridge(bridge_file);
+    build.file(source_file);
+
+    if bundled {
+        build.define("LBUG_BUNDLED", None);
+    }
+    if get_target() == "debug" || get_target() == "relwithdebinfo" {
+        build.define("ENABLE_RUNTIME_CHECKS", "1");
+    }
+    if link_mode() == "static" {
+        build.define("LBUG_STATIC_DEFINE", None);
+    }
+
+    build.includes(include_paths);
+
+    println!("cargo:rerun-if-env-changed=LBUG_SHARED");
+
+    println!("cargo:rerun-if-changed=include/lbug_rs.h");
+    println!("cargo:rerun-if-changed=src/lbug_rs.cpp");
+    // Note that this should match the lbug-src/* entries in the package.include list in Cargo.toml
+    // Unfortunately they appear to need to be specified individually since the symlink is
+    // considered to be changed each time.
+    println!("cargo:rerun-if-changed=lbug-src/src");
+    println!("cargo:rerun-if-changed=lbug-src/cmake");
+    println!("cargo:rerun-if-changed=lbug-src/third_party");
+    println!("cargo:rerun-if-changed=lbug-src/CMakeLists.txt");
+    println!("cargo:rerun-if-changed=lbug-src/tools/CMakeLists.txt");
+
+    if is_wasm_emscripten() {
+        // For emscripten, use C++20 and enable exceptions
+        build.flag("-std=c++20");
+        build.flag("-fexceptions");
+        // Note: -sDISABLE_EXCEPTION_CATCHING=0 is a linker flag, not a compiler flag
+        // It should be set via EMCC_CFLAGS environment variable or cargo rustc-link-arg
+    } else if cfg!(windows) {
+        build.flag("/std:c++20");
+        build.flag("/MD");
+    } else {
+        build.flag("-std=c++2a");
+    }
+    build.compile(out_name);
+}
+
+fn main() {
+    if env::var("DOCS_RS").is_ok() {
+        // Do nothing; we're just building docs and don't need the C++ library
+        return;
+    }
+
+    let mut bundled = false;
+    let mut include_paths =
+        vec![Path::new(&std::env::var("CARGO_MANIFEST_DIR").unwrap()).join("include")];
+
+    if let (Ok(lbug_lib_dir), Ok(lbug_include)) =
+        (env::var("LBUG_LIBRARY_DIR"), env::var("LBUG_INCLUDE_DIR"))
+    {
+        println!("cargo:rustc-link-search=native={lbug_lib_dir}");
+        println!("cargo:rustc-link-arg=-Wl,-rpath,{lbug_lib_dir}");
+        include_paths.push(Path::new(&lbug_include).to_path_buf());
+    } else {
+        include_paths.extend(build_bundled_cmake());
+        bundled = true;
+    }
+    // For wasm, we need to link libraries after building FFI to ensure proper symbol resolution
+    if !is_wasm_emscripten() && link_mode() == "static" {
+        link_libraries();
+    }
+    build_ffi(
+        "src/ffi.rs",
+        "lbug_rs",
+        "src/lbug_rs.cpp",
+        bundled,
+        &include_paths,
+    );
+
+    if cfg!(feature = "arrow") {
+        build_ffi(
+            "src/ffi/arrow.rs",
+            "lbug_arrow_rs",
+            "src/lbug_arrow.cpp",
+            bundled,
+            &include_paths,
+        );
+    }
+    // For wasm, link libraries after FFI; for dylib, link after FFI
+    if is_wasm_emscripten() || link_mode() == "dylib" {
+        link_libraries();
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/include/lbug_arrow.h b/graph-wasm/lbug-0.12.2/include/lbug_arrow.h
new file mode 100644
index 0000000000..a3587a7276
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/include/lbug_arrow.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "rust/cxx.h"
+#ifdef LBUG_BUNDLED
+#include "main/lbug.h"
+#else
+#include <lbug.hpp>
+#endif
+
+namespace lbug_arrow {
+
+ArrowSchema query_result_get_arrow_schema(const lbug::main::QueryResult& result);
+ArrowArray query_result_get_next_arrow_chunk(lbug::main::QueryResult& result, uint64_t chunkSize);
+
+} // namespace lbug_arrow
diff --git a/graph-wasm/lbug-0.12.2/include/lbug_rs.h b/graph-wasm/lbug-0.12.2/include/lbug_rs.h
new file mode 100644
index 0000000000..64006650cd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/include/lbug_rs.h
@@ -0,0 +1,243 @@
+#pragma once
+
+#include <cstdint>
+#include <memory>
+
+#include "rust/cxx.h"
+#ifdef LBUG_BUNDLED
+#include "common/type_utils.h"
+#include "common/types/int128_t.h"
+#include "common/types/types.h"
+#include "common/types/value/nested.h"
+#include "common/types/value/node.h"
+#include "common/types/value/recursive_rel.h"
+#include "common/types/value/rel.h"
+#include "common/types/value/value.h"
+#include "main/lbug.h"
+#include "storage/storage_version_info.h"
+#else
+#include <lbug.hpp>
+#endif
+
+namespace lbug_rs {
+
+struct TypeListBuilder {
+    std::vector<lbug::common::LogicalType> types;
+
+    void insert(std::unique_ptr<lbug::common::LogicalType> type) {
+        types.push_back(std::move(*type));
+    }
+};
+
+std::unique_ptr<TypeListBuilder> create_type_list();
+
+struct QueryParams {
+    std::unordered_map<std::string, std::unique_ptr<lbug::common::Value>> inputParams;
+
+    void insert(const rust::Str key, std::unique_ptr<lbug::common::Value> value) {
+        inputParams.insert(std::make_pair(key, std::move(value)));
+    }
+};
+
+std::unique_ptr<QueryParams> new_params();
+
+std::unique_ptr<lbug::common::LogicalType> create_logical_type(lbug::common::LogicalTypeID id);
+std::unique_ptr<lbug::common::LogicalType> create_logical_type_list(
+    std::unique_ptr<lbug::common::LogicalType> childType);
+std::unique_ptr<lbug::common::LogicalType> create_logical_type_array(
+    std::unique_ptr<lbug::common::LogicalType> childType, uint64_t numElements);
+
+inline std::unique_ptr<lbug::common::LogicalType> create_logical_type_struct(
+    const rust::Vec<rust::String>& fieldNames, std::unique_ptr<TypeListBuilder> fieldTypes) {
+    std::vector<lbug::common::StructField> fields;
+    for (auto i = 0u; i < fieldNames.size(); i++) {
+        fields.emplace_back(std::string(fieldNames[i]), std::move(fieldTypes->types[i]));
+    }
+    return std::make_unique<lbug::common::LogicalType>(
+        lbug::common::LogicalType::STRUCT(std::move(fields)));
+}
+inline std::unique_ptr<lbug::common::LogicalType> create_logical_type_union(
+    const rust::Vec<rust::String>& fieldNames, std::unique_ptr<TypeListBuilder> fieldTypes) {
+    std::vector<lbug::common::StructField> fields;
+    for (auto i = 0u; i < fieldNames.size(); i++) {
+        fields.emplace_back(std::string(fieldNames[i]), std::move(fieldTypes->types[i]));
+    }
+    return std::make_unique<lbug::common::LogicalType>(
+        lbug::common::LogicalType::UNION(std::move(fields)));
+}
+std::unique_ptr<lbug::common::LogicalType> create_logical_type_map(
+    std::unique_ptr<lbug::common::LogicalType> keyType,
+    std::unique_ptr<lbug::common::LogicalType> valueType);
+
+inline std::unique_ptr<lbug::common::LogicalType> create_logical_type_decimal(uint32_t precision,
+    uint32_t scale) {
+    return std::make_unique<lbug::common::LogicalType>(
+        lbug::common::LogicalType::DECIMAL(precision, scale));
+}
+
+std::unique_ptr<lbug::common::LogicalType> logical_type_get_list_child_type(
+    const lbug::common::LogicalType& logicalType);
+std::unique_ptr<lbug::common::LogicalType> logical_type_get_array_child_type(
+    const lbug::common::LogicalType& logicalType);
+uint64_t logical_type_get_array_num_elements(const lbug::common::LogicalType& logicalType);
+
+rust::Vec<rust::String> logical_type_get_struct_field_names(const lbug::common::LogicalType& value);
+std::unique_ptr<std::vector<lbug::common::LogicalType>> logical_type_get_struct_field_types(
+    const lbug::common::LogicalType& value);
+
+inline uint32_t logical_type_get_decimal_precision(const lbug::common::LogicalType& logicalType) {
+    return lbug::common::DecimalType::getPrecision(logicalType);
+}
+inline uint32_t logical_type_get_decimal_scale(const lbug::common::LogicalType& logicalType) {
+    return lbug::common::DecimalType::getScale(logicalType);
+}
+
+/* Database */
+std::unique_ptr<lbug::main::Database> new_database(std::string_view databasePath,
+    uint64_t bufferPoolSize, uint64_t maxNumThreads, bool enableCompression, bool readOnly,
+    uint64_t maxDBSize, bool autoCheckpoint, int64_t checkpointThreshold,
+    bool throwOnWalReplayFailure, bool enableChecksums);
+
+void database_set_logging_level(lbug::main::Database& database, const std::string& level);
+
+/* Connection */
+std::unique_ptr<lbug::main::Connection> database_connect(lbug::main::Database& database);
+std::unique_ptr<lbug::main::QueryResult> connection_execute(lbug::main::Connection& connection,
+    lbug::main::PreparedStatement& query, std::unique_ptr<QueryParams> params);
+inline std::unique_ptr<lbug::main::QueryResult> connection_query(lbug::main::Connection& connection,
+    std::string_view query) {
+    return connection.query(query);
+}
+
+/* PreparedStatement */
+rust::String prepared_statement_error_message(const lbug::main::PreparedStatement& statement);
+
+/* QueryResult */
+rust::String query_result_to_string(const lbug::main::QueryResult& result);
+rust::String query_result_get_error_message(const lbug::main::QueryResult& result);
+
+double query_result_get_compiling_time(const lbug::main::QueryResult& result);
+double query_result_get_execution_time(const lbug::main::QueryResult& result);
+
+std::unique_ptr<std::vector<lbug::common::LogicalType>> query_result_column_data_types(
+    const lbug::main::QueryResult& query_result);
+rust::Vec<rust::String> query_result_column_names(const lbug::main::QueryResult& query_result);
+
+/* NodeVal/RelVal */
+rust::String node_value_get_label_name(const lbug::common::Value& val);
+rust::String rel_value_get_label_name(const lbug::common::Value& val);
+
+size_t node_value_get_num_properties(const lbug::common::Value& value);
+size_t rel_value_get_num_properties(const lbug::common::Value& value);
+
+rust::String node_value_get_property_name(const lbug::common::Value& value, size_t index);
+rust::String rel_value_get_property_name(const lbug::common::Value& value, size_t index);
+
+const lbug::common::Value& node_value_get_property_value(const lbug::common::Value& value,
+    size_t index);
+const lbug::common::Value& rel_value_get_property_value(const lbug::common::Value& value,
+    size_t index);
+
+/* NodeVal */
+const lbug::common::Value& node_value_get_node_id(const lbug::common::Value& val);
+
+/* RelVal */
+const lbug::common::Value& rel_value_get_src_id(const lbug::common::Value& val);
+std::array<uint64_t, 2> rel_value_get_dst_id(const lbug::common::Value& val);
+
+/* RecursiveRel */
+const lbug::common::Value& recursive_rel_get_nodes(const lbug::common::Value& val);
+const lbug::common::Value& recursive_rel_get_rels(const lbug::common::Value& val);
+
+/* FlatTuple */
+const lbug::common::Value& flat_tuple_get_value(const lbug::processor::FlatTuple& flatTuple,
+    uint32_t index);
+
+/* Value */
+const std::string& value_get_string(const lbug::common::Value& value);
+
+template<typename T>
+std::unique_ptr<T> value_get_unique(const lbug::common::Value& value) {
+    return std::make_unique<T>(value.getValue<T>());
+}
+
+int64_t value_get_interval_secs(const lbug::common::Value& value);
+int32_t value_get_interval_micros(const lbug::common::Value& value);
+int32_t value_get_date_days(const lbug::common::Value& value);
+int64_t value_get_timestamp_ns(const lbug::common::Value& value);
+int64_t value_get_timestamp_ms(const lbug::common::Value& value);
+int64_t value_get_timestamp_sec(const lbug::common::Value& value);
+int64_t value_get_timestamp_micros(const lbug::common::Value& value);
+int64_t value_get_timestamp_tz(const lbug::common::Value& value);
+std::array<uint64_t, 2> value_get_int128_t(const lbug::common::Value& value);
+std::array<uint64_t, 2> value_get_internal_id(const lbug::common::Value& value);
+uint32_t value_get_children_size(const lbug::common::Value& value);
+const lbug::common::Value& value_get_child(const lbug::common::Value& value, uint32_t index);
+lbug::common::LogicalTypeID value_get_data_type_id(const lbug::common::Value& value);
+const lbug::common::LogicalType& value_get_data_type(const lbug::common::Value& value);
+inline lbug::common::PhysicalTypeID value_get_physical_type(const lbug::common::Value& value) {
+    return value.getDataType().getPhysicalType();
+}
+rust::String value_to_string(const lbug::common::Value& val);
+
+std::unique_ptr<lbug::common::Value> create_value_string(lbug::common::LogicalTypeID typ,
+    const rust::Slice<const unsigned char> value);
+std::unique_ptr<lbug::common::Value> create_value_timestamp(const int64_t timestamp);
+std::unique_ptr<lbug::common::Value> create_value_timestamp_tz(const int64_t timestamp);
+std::unique_ptr<lbug::common::Value> create_value_timestamp_ns(const int64_t timestamp);
+std::unique_ptr<lbug::common::Value> create_value_timestamp_ms(const int64_t timestamp);
+std::unique_ptr<lbug::common::Value> create_value_timestamp_sec(const int64_t timestamp);
+inline std::unique_ptr<lbug::common::Value> create_value_date(const int32_t date) {
+    return std::make_unique<lbug::common::Value>(lbug::common::date_t(date));
+}
+std::unique_ptr<lbug::common::Value> create_value_interval(const int32_t months, const int32_t days,
+    const int64_t micros);
+std::unique_ptr<lbug::common::Value> create_value_null(
+    std::unique_ptr<lbug::common::LogicalType> typ);
+std::unique_ptr<lbug::common::Value> create_value_int128_t(int64_t high, uint64_t low);
+std::unique_ptr<lbug::common::Value> create_value_internal_id(uint64_t offset, uint64_t table);
+
+inline std::unique_ptr<lbug::common::Value> create_value_uuid_t(int64_t high, uint64_t low) {
+    return std::make_unique<lbug::common::Value>(
+        lbug::common::ku_uuid_t{lbug::common::int128_t(low, high)});
+}
+
+template<typename T>
+std::unique_ptr<lbug::common::Value> create_value(const T value) {
+    return std::make_unique<lbug::common::Value>(value);
+}
+inline std::unique_ptr<lbug::common::Value> create_value_decimal(int64_t high, uint64_t low,
+    uint32_t scale, uint32_t precision) {
+    auto value =
+        std::make_unique<lbug::common::Value>(lbug::common::LogicalType::DECIMAL(precision, scale),
+            std::vector<std::unique_ptr<lbug::common::Value>>{});
+    auto i128 = lbug::common::int128_t(low, high);
+    lbug::common::TypeUtils::visit(
+        value->getDataType().getPhysicalType(),
+        [&](lbug::common::int128_t) { value->val.int128Val = i128; },
+        [&](int64_t) { value->val.int64Val = static_cast<int64_t>(i128); },
+        [&](int32_t) { value->val.int32Val = static_cast<int32_t>(i128); },
+        [&](int16_t) { value->val.int16Val = static_cast<int16_t>(i128); },
+        [](auto) { KU_UNREACHABLE; });
+    return value;
+}
+
+struct ValueListBuilder {
+    std::vector<std::unique_ptr<lbug::common::Value>> values;
+
+    void insert(std::unique_ptr<lbug::common::Value> value) { values.push_back(std::move(value)); }
+};
+
+std::unique_ptr<lbug::common::Value> get_list_value(std::unique_ptr<lbug::common::LogicalType> typ,
+    std::unique_ptr<ValueListBuilder> value);
+std::unique_ptr<ValueListBuilder> create_list();
+
+inline std::string_view string_view_from_str(rust::Str s) {
+    return {s.data(), s.size()};
+}
+
+inline lbug::storage::storage_version_t get_storage_version() {
+    return lbug::storage::StorageVersionInfo::getStorageVersion();
+}
+
+} // namespace lbug_rs
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/CMakeLists.txt
new file mode 100644
index 0000000000..90890a5b51
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/CMakeLists.txt
@@ -0,0 +1,454 @@
+cmake_minimum_required(VERSION 3.15)
+
+project(Lbug VERSION 0.12.2 LANGUAGES CXX C)
+
+option(SINGLE_THREADED "Single-threaded mode" FALSE)
+if(SINGLE_THREADED)
+    set(__SINGLE_THREADED__ TRUE)
+    add_compile_definitions(__SINGLE_THREADED__)
+    message(STATUS "Single-threaded mode is enabled")
+else()
+    message(STATUS "Multi-threaded mode is enabled: CMAKE_BUILD_PARALLEL_LEVEL=$ENV{CMAKE_BUILD_PARALLEL_LEVEL}")
+    find_package(Threads REQUIRED)
+endif()
+
+set(CMAKE_CXX_STANDARD 20)
+set(CMAKE_CXX_STANDARD_REQUIRED TRUE)
+set(CMAKE_CXX_VISIBILITY_PRESET hidden)
+set(CMAKE_C_VISIBILITY_PRESET hidden)
+set(CMAKE_EXPORT_COMPILE_COMMANDS TRUE)
+set(CMAKE_FIND_PACKAGE_RESOLVE_SYMLINKS TRUE)
+set(CMAKE_POSITION_INDEPENDENT_CODE ON)
+set(CMAKE_VISIBILITY_INLINES_HIDDEN ON)
+# On Linux, symbols in executables are not accessible by loaded shared libraries (e.g. via dlopen(3)). However, we need to export public symbols in executables so that extensions can access public symbols. This enables that behaviour.
+set(CMAKE_ENABLE_EXPORTS TRUE)
+
+option(ENABLE_WERROR "Treat all warnings as errors" FALSE)
+if(ENABLE_WERROR)
+    if (CMAKE_VERSION VERSION_GREATER "3.24.0" OR CMAKE_VERSION VERSION_EQUAL "3.24.0")
+        set(CMAKE_COMPILE_WARNING_AS_ERROR TRUE)
+    elseif (MSVC)
+        add_compile_options(\WX)
+    else ()
+        add_compile_options(-Werror)
+    endif()
+endif()
+
+# Detect OS and architecture, copied from DuckDB
+set(OS_NAME "unknown")
+set(OS_ARCH "amd64")
+
+string(REGEX MATCH "(arm64|aarch64)" IS_ARM "${CMAKE_SYSTEM_PROCESSOR}")
+if(IS_ARM)
+  set(OS_ARCH "arm64")
+elseif(FORCE_32_BIT)
+  set(OS_ARCH "i386")
+endif()
+
+if(APPLE)
+  set(OS_NAME "osx")
+endif()
+if(WIN32)
+  set(OS_NAME "windows")
+endif()
+if(UNIX AND NOT APPLE)
+  set(OS_NAME "linux") # sorry BSD
+endif()
+
+if(CMAKE_SIZEOF_VOID_P EQUAL 8)
+    message(STATUS "64-bit architecture detected")
+    add_compile_definitions(__64BIT__)
+elseif(CMAKE_SIZEOF_VOID_P EQUAL 4)
+    message(STATUS "32-bit architecture detected")
+    add_compile_definitions(__32BIT__)
+    set(__32BIT__ TRUE)
+endif()
+
+if(NOT CMAKE_BUILD_TYPE)
+    set(CMAKE_BUILD_TYPE Release)
+endif()
+
+if(DEFINED ENV{PYBIND11_PYTHON_VERSION})
+    set(PYBIND11_PYTHON_VERSION $ENV{PYBIND11_PYTHON_VERSION})
+endif()
+
+if(DEFINED ENV{PYTHON_EXECUTABLE})
+    set(PYTHON_EXECUTABLE $ENV{PYTHON_EXECUTABLE})
+endif()
+
+find_program(CCACHE_PROGRAM ccache)
+if (CCACHE_PROGRAM)
+    set(CMAKE_C_COMPILER_LAUNCHER "${CCACHE_PROGRAM}")
+    set(CMAKE_CXX_COMPILER_LAUNCHER "${CCACHE_PROGRAM}")
+    message(STATUS "ccache found and enabled")
+else ()
+    find_program(CCACHE_PROGRAM sccache)
+    if (CCACHE_PROGRAM)
+        set(CMAKE_C_COMPILER_LAUNCHER "${CCACHE_PROGRAM}")
+        set(CMAKE_CXX_COMPILER_LAUNCHER "${CCACHE_PROGRAM}")
+        message(STATUS "sccache found and enabled")
+    endif ()
+endif ()
+
+set(INSTALL_LIB_DIR
+        lib
+        CACHE PATH "Installation directory for libraries")
+set(INSTALL_BIN_DIR
+        bin
+        CACHE PATH "Installation directory for executables")
+set(INSTALL_INCLUDE_DIR
+        include
+        CACHE PATH "Installation directory for header files")
+set(INSTALL_CMAKE_DIR
+        ${DEF_INSTALL_CMAKE_DIR}
+        CACHE PATH "Installation directory for CMake files")
+
+option(ENABLE_ADDRESS_SANITIZER "Enable address sanitizer." FALSE)
+option(ENABLE_THREAD_SANITIZER "Enable thread sanitizer." FALSE)
+option(ENABLE_UBSAN "Enable undefined behavior sanitizer." FALSE)
+option(ENABLE_RUNTIME_CHECKS "Enable runtime coherency checks (e.g. asserts)" FALSE)
+option(ENABLE_LTO "Enable Link-Time Optimization" FALSE)
+option(ENABLE_MALLOC_BUFFER_MANAGER "Enable Buffer manager using malloc. Default option for webassembly" OFF)
+
+option(LBUG_DEFAULT_REL_STORAGE_DIRECTION "Only store fwd direction in rel tables by default." BOTH)
+if(NOT LBUG_DEFAULT_REL_STORAGE_DIRECTION)
+    set(LBUG_DEFAULT_REL_STORAGE_DIRECTION BOTH)
+endif()
+set(LBUG_DEFAULT_REL_STORAGE_DIRECTION ${LBUG_DEFAULT_REL_STORAGE_DIRECTION}_REL_STORAGE)
+option(LBUG_PAGE_SIZE_LOG2 "Log2 of the page size." 12)
+if(NOT LBUG_PAGE_SIZE_LOG2)
+    set(LBUG_PAGE_SIZE_LOG2 12)
+endif()
+message(STATUS "LBUG_PAGE_SIZE_LOG2: ${LBUG_PAGE_SIZE_LOG2}")
+option(LBUG_VECTOR_CAPACITY_LOG2 "Log2 of the vector capacity." 11)
+if(NOT LBUG_VECTOR_CAPACITY_LOG2)
+    set(LBUG_VECTOR_CAPACITY_LOG2 11)
+endif()
+message(STATUS "LBUG_VECTOR_CAPACITY_LOG2: ${LBUG_VECTOR_CAPACITY_LOG2}")
+
+# 64 * 2048 nodes per group
+option(LBUG_NODE_GROUP_SIZE_LOG2 "Log2 of the vector capacity." 17)
+if(NOT LBUG_NODE_GROUP_SIZE_LOG2)
+    set(LBUG_NODE_GROUP_SIZE_LOG2 17)
+endif()
+message(STATUS "LBUG_NODE_GROUP_SIZE_LOG2: ${LBUG_NODE_GROUP_SIZE_LOG2}")
+
+option(LBUG_MAX_SEGMENT_SIZE_LOG2 "Log2 of the maximum segment size in bytes." 18)
+if(NOT LBUG_MAX_SEGMENT_SIZE_LOG2)
+    set(LBUG_MAX_SEGMENT_SIZE_LOG2 18)
+endif()
+message(STATUS "LBUG_MAX_SEGMENT_SIZE_LOG2: ${LBUG_MAX_SEGMENT_SIZE_LOG2}")
+
+configure_file(${CMAKE_CURRENT_SOURCE_DIR}/cmake/templates/system_config.h.in ${CMAKE_CURRENT_BINARY_DIR}/src/include/common/system_config.h @ONLY)
+
+include(CheckCXXSymbolExists)
+check_cxx_symbol_exists(F_FULLFSYNC "fcntl.h" HAS_FULLFSYNC)
+check_cxx_symbol_exists(fdatasync "unistd.h" HAS_FDATASYNC)
+if(HAS_FULLFSYNC)
+    message(STATUS "✓ F_FULLFSYNC will be used on this platform")
+    add_compile_definitions(HAS_FULLFSYNC)
+else()
+    message(STATUS "✗ F_FULLFSYNC not available")
+endif()
+
+if(HAS_FDATASYNC)
+    message(STATUS "✓ fdatasync will be used on this platform")
+    add_compile_definitions(HAS_FDATASYNC)
+else()
+    message(STATUS "✗ fdatasync not available, using fsync fallback")
+endif()
+
+if(MSVC)
+    # Required for M_PI on Windows
+    add_compile_definitions(_USE_MATH_DEFINES)
+    add_compile_definitions(NOMINMAX)
+    add_compile_definitions(SERD_STATIC)
+    # This is a workaround for regex oom issue on windows in gtest.
+    add_compile_definitions(_REGEX_MAX_STACK_COUNT=0)
+    add_compile_definitions(_REGEX_MAX_COMPLEXITY_COUNT=0)
+    # Disable constexpr mutex constructor to avoid compatibility issues with
+    # older versions of the MSVC runtime library
+    # See: https://github.com/microsoft/STL/wiki/Changelog#vs-2022-1710
+    add_compile_definitions(_DISABLE_CONSTEXPR_MUTEX_CONSTRUCTOR)
+    # TODO (bmwinger): Figure out if this can be set automatically by cmake,
+    # or at least better integrated with user-specified options
+    # For now, hardcode _AMD64_
+    # CMAKE_GENERATOR_PLATFORM can be used for visual studio builds, but not for ninja
+    add_compile_definitions(_AMD64_)
+    # Non-english windows system may use other encodings other than utf-8 (e.g. Chinese use GBK).
+    add_compile_options("/utf-8")
+    # Enables support for custom hardware exception handling
+    add_compile_options("/EHa")
+    # Reduces the size of the static library by roughly 1/2
+    add_compile_options("/Zc:inline")
+    # Disable type conversion warnings
+    add_compile_options(/wd4244 /wd4267)
+    # Remove the default to avoid warnings
+    STRING(REPLACE "/EHsc" "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+    STRING(REPLACE "/EHs" "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+    # Store all libraries and binaries in the same directory so that lbug_shared.dll is found at runtime
+    set(LIBRARY_OUTPUT_PATH "${CMAKE_BINARY_DIR}/src")
+    set(EXECUTABLE_OUTPUT_PATH "${CMAKE_BINARY_DIR}/src")
+    # This is a workaround for regex stackoverflow issue on windows in gtest.
+    set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} /STACK:8388608")
+
+    string(REGEX REPLACE "/W[3|4]" "/w" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+    add_compile_options($<$<CONFIG:Release>:/W0>)
+else()
+    add_compile_options(-Wall -Wextra)
+    # Disable warnings for unknown pragmas, which is used by several third-party libraries
+    add_compile_options(-Wno-unknown-pragmas)
+endif()
+
+if(${BUILD_WASM})
+    if(NOT __SINGLE_THREADED__)
+        add_compile_options(-pthread)
+        add_link_options(-pthread)
+        add_link_options(-sPTHREAD_POOL_SIZE=8)
+    endif()
+    add_compile_options(-s DISABLE_EXCEPTION_CATCHING=0)
+    add_link_options(-sSTACK_SIZE=4MB)
+    add_link_options(-sASSERTIONS=1)
+    add_link_options(-lembind)
+    add_link_options(-sWASM_BIGINT)
+
+    if(BUILD_TESTS OR BUILD_EXTENSION_TESTS)
+        add_link_options(-sINITIAL_MEMORY=3892MB)
+        add_link_options(-sNODERAWFS=1)
+    elseif(WASM_NODEFS)
+        add_link_options(-sNODERAWFS=1)
+        add_link_options(-sALLOW_MEMORY_GROWTH=1)
+        add_link_options(-sMODULARIZE=1)
+        add_link_options(-sEXPORTED_RUNTIME_METHODS=FS,wasmMemory)
+        add_link_options(-sEXPORT_NAME=lbug)
+        add_link_options(-sMAXIMUM_MEMORY=4GB)
+    else()
+        add_link_options(-sSINGLE_FILE=1)
+        add_link_options(-sALLOW_MEMORY_GROWTH=1)
+        add_link_options(-sMODULARIZE=1)
+        add_link_options(-sEXPORTED_RUNTIME_METHODS=FS,wasmMemory)
+        add_link_options(-lidbfs.js)
+        add_link_options(-lworkerfs.js)
+        add_link_options(-sEXPORT_NAME=lbug)
+        add_link_options(-sMAXIMUM_MEMORY=4GB)
+    endif()
+    set(__WASM__ TRUE)
+    add_compile_options(-fexceptions)
+    add_link_options(-s DISABLE_EXCEPTION_CATCHING=0)
+    add_link_options(-fexceptions)
+    add_compile_definitions(__WASM__)
+    set(ENABLE_MALLOC_BUFFER_MANAGER ON)
+endif()
+
+if(${BUILD_SWIFT})
+    add_compile_definitions(__SWIFT__)
+    set(ENABLE_MALLOC_BUFFER_MANAGER ON)
+endif()
+
+if (${ENABLE_MALLOC_BUFFER_MANAGER})
+    add_compile_definitions(BM_MALLOC)
+endif()
+
+if(ANDROID_ABI)
+    message(STATUS "Android ABI detected: ${ANDROID_ABI}")
+    add_compile_definitions(__ANDROID__)
+    set(__ANDROID__ TRUE)
+endif()
+
+if(CMAKE_CXX_COMPILER_ID STREQUAL "GNU")
+    add_compile_options(-Wno-restrict) # no restrict until https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105651 is fixed
+endif()
+
+if(${ENABLE_THREAD_SANITIZER} AND (NOT __SINGLE_THREADED__))
+    if(MSVC)
+        message(FATAL_ERROR "Thread sanitizer is not supported on MSVC")
+    else()
+        set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fsanitize=thread -fno-omit-frame-pointer")
+    endif()
+endif()
+if(${ENABLE_ADDRESS_SANITIZER})
+    if(MSVC)
+        set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /fsanitize=address")
+    else()
+        set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fsanitize=address -fno-omit-frame-pointer")
+    endif()
+endif()
+if(${ENABLE_UBSAN})
+    if(MSVC)
+        message(FATAL_ERROR "Undefined behavior sanitizer is not supported on MSVC")
+    else()
+        set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fsanitize=undefined -fno-omit-frame-pointer")
+    endif()
+endif()
+
+if(${ENABLE_RUNTIME_CHECKS})
+    add_compile_definitions(LBUG_RUNTIME_CHECKS)
+endif()
+
+if (${ENABLE_DESER_DEBUG})
+    add_compile_definitions(LBUG_DESER_DEBUG)
+endif()
+
+if(${ENABLE_LTO})
+    set(CMAKE_INTERPROCEDURAL_OPTIMIZATION TRUE)
+endif()
+
+option(AUTO_UPDATE_GRAMMAR "Automatically regenerate C++ grammar files on change." TRUE)
+option(BUILD_BENCHMARK "Build benchmarks." FALSE)
+option(BUILD_EXTENSIONS "Semicolon-separated list of extensions to build." "")
+option(BUILD_EXAMPLES "Build examples." FALSE)
+option(BUILD_JAVA "Build Java API." FALSE)
+option(BUILD_NODEJS "Build NodeJS API." FALSE)
+option(BUILD_PYTHON "Build Python API." FALSE)
+option(BUILD_SHELL "Build Interactive Shell" TRUE)
+option(BUILD_SINGLE_FILE_HEADER "Build single file header. Requires Python >= 3.9." TRUE)
+option(BUILD_TESTS "Build C++ tests." FALSE)
+option(BUILD_EXTENSION_TESTS "Build C++ extension tests." FALSE)
+option(BUILD_LBUG "Build Lbug." TRUE)
+option(ENABLE_BACKTRACES "Enable backtrace printing for exceptions and segfaults" FALSE)
+option(USE_STD_FORMAT "Use std::format instead of a custom formatter." FALSE)
+option(PREFER_SYSTEM_DEPS "Only download certain deps if not found on the system" TRUE)
+
+option(BUILD_LCOV "Build coverage report." FALSE)
+if(${BUILD_LCOV})
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fprofile-arcs -ftest-coverage")
+endif()
+
+if (ENABLE_BACKTRACES)
+    set(DOWNLOAD_CPPTRACE TRUE)
+    if(${PREFER_SYSTEM_DEPS})
+        find_package(cpptrace QUIET)
+        if(cpptrace_FOUND)
+            message(STATUS "Using system cpptrace")
+            set(DOWNLOAD_CPPTRACE FALSE)
+        endif()
+    endif()
+    if(${DOWNLOAD_CPPTRACE})
+        message(STATUS "Fetching cpptrace from GitHub...")
+        include(FetchContent)
+        FetchContent_Declare(
+            cpptrace
+            GIT_REPOSITORY https://github.com/jeremy-rifkin/cpptrace.git
+            GIT_TAG        v0.8.3
+            GIT_SHALLOW    TRUE
+        )
+        FetchContent_MakeAvailable(cpptrace)
+    endif()
+    add_compile_definitions(LBUG_BACKTRACE)
+endif()
+
+if (USE_STD_FORMAT)
+    add_compile_definitions(USE_STD_FORMAT)
+endif()
+
+function(add_lbug_test TEST_NAME)
+    set(SRCS ${ARGN})
+    add_executable(${TEST_NAME} ${SRCS})
+    target_link_libraries(${TEST_NAME} PRIVATE test_helper test_runner graph_test)
+    if (ENABLE_BACKTRACES)
+        target_link_libraries(${TEST_NAME} PRIVATE register_backtrace_signal_handler)
+    endif()
+    target_include_directories(${TEST_NAME} PRIVATE ${PROJECT_SOURCE_DIR}/test/include)
+    include(GoogleTest)
+
+    if (TEST_NAME STREQUAL "e2e_test")
+        gtest_discover_tests(${TEST_NAME}
+            DISCOVERY_TIMEOUT 600
+            DISCOVERY_MODE PRE_TEST
+            TEST_PREFIX e2e_test_
+        )
+    else()
+        gtest_discover_tests(${TEST_NAME}
+            DISCOVERY_TIMEOUT 600
+            DISCOVERY_MODE PRE_TEST
+        )
+    endif()
+endfunction()
+
+function(add_lbug_api_test TEST_NAME)
+    set(SRCS ${ARGN})
+    add_executable(${TEST_NAME} ${SRCS})
+    target_link_libraries(${TEST_NAME} PRIVATE api_graph_test api_test_helper)
+    if (ENABLE_BACKTRACES)
+        target_link_libraries(${TEST_NAME} PRIVATE register_backtrace_signal_handler)
+    endif()
+    target_include_directories(${TEST_NAME} PRIVATE ${PROJECT_SOURCE_DIR}/test/include)
+    include(GoogleTest)
+    gtest_discover_tests(${TEST_NAME})
+endfunction()
+
+# Windows doesn't support dynamic lookup, so we have to link extensions against lbug.
+if (MSVC AND (NOT BUILD_EXTENSIONS EQUAL ""))
+    set(BUILD_LBUG TRUE)
+endif ()
+
+include_directories(third_party/antlr4_cypher/include)
+include_directories(third_party/antlr4_runtime/src)
+include_directories(third_party/brotli/c/include)
+include_directories(third_party/fast_float/include)
+include_directories(third_party/mbedtls/include)
+include_directories(third_party/parquet)
+include_directories(third_party/snappy)
+include_directories(third_party/thrift)
+include_directories(third_party/miniz)
+include_directories(third_party/nlohmann_json)
+include_directories(third_party/pybind11/include)
+include_directories(third_party/pyparse)
+include_directories(third_party/re2/include)
+include_directories(third_party/alp/include)
+if (${BUILD_TESTS} OR ${BUILD_EXTENSION_TESTS})
+    include_directories(third_party/spdlog)
+elseif (${BUILD_BENCHMARK})
+    include_directories(third_party/spdlog)
+endif ()
+include_directories(third_party/utf8proc/include)
+include_directories(third_party/zstd/include)
+include_directories(third_party/httplib)
+include_directories(third_party/pcg)
+include_directories(third_party/lz4)
+include_directories(third_party/roaring_bitmap)
+# Use SYSTEM to suppress warnings from simsimd
+include_directories(SYSTEM third_party/simsimd/include)
+
+add_subdirectory(third_party)
+
+add_definitions(-DLBUG_ROOT_DIRECTORY="${PROJECT_SOURCE_DIR}")
+add_definitions(-DLBUG_CMAKE_VERSION="${CMAKE_PROJECT_VERSION}")
+add_definitions(-DLBUG_EXTENSION_VERSION="0.12.0")
+
+if(BUILD_LBUG)
+include_directories(
+    src/include
+    ${CMAKE_CURRENT_BINARY_DIR}/src/include
+)
+endif()
+
+if (EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/extension/CMakeLists.txt")
+    add_subdirectory(extension)
+endif ()
+
+if(BUILD_LBUG)
+
+add_subdirectory(src)
+
+# Link extensions which require static linking.
+foreach(ext IN LISTS STATICALLY_LINKED_EXTENSIONS)
+    if (${BUILD_EXTENSION_TESTS})
+        add_compile_definitions(__STATIC_LINK_EXTENSION_TEST__)
+    endif ()
+    target_link_libraries(lbug PRIVATE "lbug_${ext}_static_extension")
+    target_link_libraries(lbug_shared PRIVATE "lbug_${ext}_static_extension")
+endforeach()
+
+if (${BUILD_TESTS} OR ${BUILD_EXTENSION_TESTS})
+    add_subdirectory(test)
+elseif (${BUILD_BENCHMARK})
+    add_subdirectory(test/test_helper)
+endif ()
+add_subdirectory(tools)
+endif ()
+
+if (${BUILD_EXAMPLES})
+    add_subdirectory(examples/c)
+    add_subdirectory(examples/cpp)
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/README.md b/graph-wasm/lbug-0.12.2/lbug-src/README.md
new file mode 100644
index 0000000000..8ffe98d7c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/README.md
@@ -0,0 +1,73 @@
+<div align="center">
+  <picture>
+    <!-- <source srcset="https://ladybugdb.com/img/lbug-logo-dark.png" media="(prefers-color-scheme: dark)"> -->
+    <img src="https://ladybugdb.com/logo.png" height="100" alt="Ladybug Logo">
+  </picture>
+</div>
+
+<br>
+
+<p align="center">
+  <a href="https://github.com/LadybugDB/ladybug/actions">
+    <img src="https://github.com/LadybugDB/ladybug/actions/workflows/ci-workflow.yml/badge.svg?branch=master" alt="Github Actions Badge"></a>
+  <a href="https://discord.com/invite/hXyHmvW3Vy">
+    <img src="https://img.shields.io/discord/1162999022819225631?logo=discord" alt="discord" /></a>
+  <a href="https://twitter.com/lbugdb">
+    <img src="https://img.shields.io/badge/follow-@lbugdb-1DA1F2?logo=twitter" alt="twitter"></a>
+</p>
+
+# Ladybug
+Ladybug is an embedded graph database built for query speed and scalability. Ladybug is optimized for handling complex analytical workloads
+on very large databases and provides a set of retrieval features, such as a full text search and vector indices. Our core feature set includes:
+
+- Flexible Property Graph Data Model and Cypher query language
+- Embeddable, serverless integration into applications
+- Native full text search and vector index
+- Columnar disk-based storage
+- Columnar sparse row-based (CSR) adjacency list/join indices
+- Vectorized and factorized query processor
+- Novel and very fast join algorithms
+- Multi-core query parallelism
+- Serializable ACID transactions
+- Wasm (WebAssembly) bindings for fast, secure execution in the browser
+
+Ladybug is being developed by [LadybugDB Developers](https://github.com/LadybugDB) and
+is available under a permissible license. So try it out and help us make it better! We welcome your feedback and feature requests.
+
+The database was formerly known as [Kuzu](https://github.com/kuzudb/kuzu).
+
+## Installation
+
+> [!WARNING]
+> Many of these binary installation methods are not functional yet. We need to work through package names, availability and convention issues.
+> For now, use the build from source method.
+
+| Language | Installation                                                           |
+| -------- |------------------------------------------------------------------------|
+| Python   | `pip install real_ladybug`                                                     |
+| NodeJS   | `npm install lbug`                                                     |
+| Rust     | `cargo add lbug`                                                       |
+| Go       | `go get github.com/lbugdb/go-lbug`                                     |
+| Swift    | [lbug-swift](https://github.com/lbugdb/lbug-swift)                     |
+| Java     | [Maven Central](https://central.sonatype.com/artifact/com.ladybugdb/lbug) |
+| C/C++    | [precompiled binaries](https://github.com/LadybugDB/ladybug/releases/latest) |
+| CLI      | [precompiled binaries](https://github.com/LadybugDB/ladybug/releases/latest) |
+
+To learn more about installation, see our [Installation](https://docs.ladybugdb.com/installation) page.
+
+## Getting Started
+
+Refer to our [Getting Started](https://docs.ladybugdb.com/get-started/) page for your first example.
+
+## Build from Source
+
+You can build from source using the instructions provided in the [developer guide](https://docs.ladybugdb.com/developer-guide/).
+
+## Contributing
+We welcome contributions to Ladybug. If you are interested in contributing to Ladybug, please read our [Contributing Guide](CONTRIBUTING.md).
+
+## License
+By contributing to Ladybug, you agree that your contributions will be licensed under the [MIT License](LICENSE).
+
+## Contact
+You can contact us at [social@ladybugdb.com](mailto:social@ladybugdb.com) or [join our Discord community](https://discord.com/invite/hXyHmvW3Vy).
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/cmake/templates/system_config.h.in b/graph-wasm/lbug-0.12.2/lbug-src/cmake/templates/system_config.h.in
new file mode 100644
index 0000000000..971c5874c2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/cmake/templates/system_config.h.in
@@ -0,0 +1,75 @@
+/*
+ * This is a template header used for generating the header 'system_config.h'
+ * Any value in the format @VALUE_NAME@ can be substituted with a value passed into CMakeLists.txt
+ * See https://cmake.org/cmake/help/latest/command/configure_file.html for more details
+ */
+
+#pragma once
+
+#include <algorithm>
+#include <cstdint>
+
+#include "common/enums/extend_direction.h"
+
+#define BOTH_REL_STORAGE 0
+#define FWD_REL_STORAGE 1
+#define BWD_REL_STORAGE 2
+
+namespace lbug {
+namespace common {
+
+#define VECTOR_CAPACITY_LOG_2 @LBUG_VECTOR_CAPACITY_LOG2@
+#if VECTOR_CAPACITY_LOG_2 > 12
+#error "Vector capacity log2 should be less than or equal to 12"
+#endif
+constexpr uint64_t DEFAULT_VECTOR_CAPACITY = static_cast<uint64_t>(1) << VECTOR_CAPACITY_LOG_2;
+
+// Currently the system supports files with 2 different pages size, which we refer to as
+// PAGE_SIZE and TEMP_PAGE_SIZE. PAGE_SIZE is the default size of the page which is the
+// unit of read/write to the database files.
+static constexpr uint64_t PAGE_SIZE_LOG2 = @LBUG_PAGE_SIZE_LOG2@; // Default to 4KB.
+static constexpr uint64_t LBUG_PAGE_SIZE = static_cast<uint64_t>(1) << PAGE_SIZE_LOG2;
+// Page size for files with large pages, e.g., temporary files that are used by operators that
+// may require large amounts of memory.
+static constexpr uint64_t TEMP_PAGE_SIZE_LOG2 = 18;
+static const uint64_t TEMP_PAGE_SIZE = static_cast<uint64_t>(1) << TEMP_PAGE_SIZE_LOG2;
+
+#define DEFAULT_REL_STORAGE_DIRECTION @LBUG_DEFAULT_REL_STORAGE_DIRECTION@
+#if DEFAULT_REL_STORAGE_DIRECTION == FWD_REL_STORAGE
+static constexpr ExtendDirection DEFAULT_EXTEND_DIRECTION = ExtendDirection::FWD;
+#elif DEFAULT_REL_STORAGE_DIRECTION == BWD_REL_STORAGE
+static constexpr ExtendDirection DEFAULT_EXTEND_DIRECTION = ExtendDirection::BWD;
+#else
+static constexpr ExtendDirection DEFAULT_EXTEND_DIRECTION = ExtendDirection::BOTH;
+#endif
+
+struct StorageConfig {
+    static constexpr uint64_t NODE_GROUP_SIZE_LOG2 = @LBUG_NODE_GROUP_SIZE_LOG2@;
+    static constexpr uint64_t NODE_GROUP_SIZE = static_cast<uint64_t>(1) << NODE_GROUP_SIZE_LOG2;
+    // The number of CSR lists in a leaf region.
+    static constexpr uint64_t CSR_LEAF_REGION_SIZE_LOG2 =
+        std::min(static_cast<uint64_t>(10), NODE_GROUP_SIZE_LOG2 - 1);
+    static constexpr uint64_t CSR_LEAF_REGION_SIZE = static_cast<uint64_t>(1)
+                                                     << CSR_LEAF_REGION_SIZE_LOG2;
+    static constexpr uint64_t CHUNKED_NODE_GROUP_CAPACITY =
+        std::min(static_cast<uint64_t>(2048), NODE_GROUP_SIZE);
+
+    // Maximum size for a segment in bytes
+    static constexpr uint64_t MAX_SEGMENT_SIZE_LOG2 = @LBUG_MAX_SEGMENT_SIZE_LOG2@;
+    static constexpr uint64_t MAX_SEGMENT_SIZE = 1 << MAX_SEGMENT_SIZE_LOG2;
+};
+
+struct OrderByConfig {
+    static constexpr uint64_t MIN_SIZE_TO_REDUCE = common::DEFAULT_VECTOR_CAPACITY * 5;
+};
+
+struct CopyConfig {
+    static constexpr uint64_t PANDAS_PARTITION_COUNT = 50 * DEFAULT_VECTOR_CAPACITY;
+};
+
+} // namespace common
+} // namespace lbug
+
+#undef BOTH_REL_STORAGE
+#undef FWD_REL_STORAGE
+#undef BWD_REL_STORAGE
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/CMakeLists.txt
new file mode 100644
index 0000000000..2250ce477f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/CMakeLists.txt
@@ -0,0 +1,79 @@
+include_directories(${CMAKE_CURRENT_BINARY_DIR})
+
+# Have to pass this down to every subdirectory, which actually adds the files.
+# This doesn't affect parent directories.
+add_compile_definitions(LBUG_EXPORTS)
+add_compile_definitions(ANTLR4CPP_STATIC)
+add_subdirectory(binder)
+add_subdirectory(c_api)
+add_subdirectory(catalog)
+add_subdirectory(common)
+add_subdirectory(expression_evaluator)
+add_subdirectory(function)
+add_subdirectory(graph)
+add_subdirectory(main)
+add_subdirectory(optimizer)
+add_subdirectory(parser)
+add_subdirectory(planner)
+add_subdirectory(processor)
+add_subdirectory(storage)
+add_subdirectory(transaction)
+add_subdirectory(extension)
+
+add_library(lbug STATIC ${ALL_OBJECT_FILES})
+add_library(lbug_shared SHARED ${ALL_OBJECT_FILES})
+
+set(LBUG_LIBRARIES antlr4_cypher antlr4_runtime brotlidec brotlicommon fast_float utf8proc re2 fastpfor parquet snappy thrift yyjson zstd miniz mbedtls lz4 roaring_bitmap simsimd)
+if (NOT __SINGLE_THREADED__)
+        set(LBUG_LIBRARIES ${LBUG_LIBRARIES} Threads::Threads)
+endif()
+if(NOT WIN32)
+        set(LBUG_LIBRARIES dl ${LBUG_LIBRARIES})
+endif()
+# Seems to be needed for clang on linux only
+# for compiling std::atomic<T>::compare_exchange_weak
+if ((NOT APPLE AND CMAKE_CXX_COMPILER_ID STREQUAL "Clang") AND NOT __WASM__ AND NOT __SINGLE_THREADED__)
+        set(LBUG_LIBRARIES atomic ${LBUG_LIBRARIES})
+endif()
+if (ENABLE_BACKTRACES)
+        set(LBUG_LIBRARIES ${LBUG_LIBRARIES} cpptrace::cpptrace)
+endif()
+target_link_libraries(lbug PUBLIC ${LBUG_LIBRARIES})
+target_link_libraries(lbug_shared PUBLIC ${LBUG_LIBRARIES})
+unset(LBUG_LIBRARIES)
+
+set(LBUG_INCLUDES $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/include> $<INSTALL_INTERFACE:${CMAKE_INSTALL_INCLUDEDIR}> ${CMAKE_CURRENT_BINARY_DIR} ${CMAKE_CURRENT_SOURCE_DIR}/include/c_api ${CMAKE_CURRENT_BINARY_DIR}/../src/include)
+target_include_directories(lbug PUBLIC ${LBUG_INCLUDES})
+target_include_directories(lbug_shared PUBLIC ${LBUG_INCLUDES})
+unset(LBUG_INCLUDES)
+
+if(WIN32)
+        # Anything linking against the static library must not use dllimport.
+        target_compile_definitions(lbug INTERFACE LBUG_STATIC_DEFINE)
+endif()
+
+if(NOT WIN32)
+        set_target_properties(lbug_shared PROPERTIES OUTPUT_NAME lbug)
+endif()
+
+install(TARGETS lbug lbug_shared)
+
+if(${BUILD_SINGLE_FILE_HEADER})
+        # Create a command to generate lbug.hpp, and then create a target that is
+        # always built that depends on it. This allows our generator to detect when
+        # exactly to build lbug.hpp, while still building the target by default.
+        find_package(Python3 3.9...4 REQUIRED)
+        add_custom_command(
+                OUTPUT lbug.hpp
+                COMMAND
+                        ${Python3_EXECUTABLE} ${PROJECT_SOURCE_DIR}/scripts/collect-single-file-header.py ${CMAKE_CURRENT_BINARY_DIR}/..
+                DEPENDS
+                        ${PROJECT_SOURCE_DIR}/scripts/collect-single-file-header.py lbug_shared)
+        add_custom_target(single_file_header ALL DEPENDS lbug.hpp)
+endif()
+
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/include/c_api/lbug.h TYPE INCLUDE)
+
+if(${BUILD_SINGLE_FILE_HEADER})
+        install(FILES ${CMAKE_CURRENT_BINARY_DIR}/lbug.hpp  TYPE INCLUDE)
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/antlr4/Cypher.g4 b/graph-wasm/lbug-0.12.2/lbug-src/src/antlr4/Cypher.g4
new file mode 100644
index 0000000000..e409515c72
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/antlr4/Cypher.g4
@@ -0,0 +1,917 @@
+
+ku_Statements
+    : oC_Cypher ( SP? ';' SP? oC_Cypher )* SP? EOF ;
+
+oC_Cypher
+    : oC_AnyCypherOption? SP? ( oC_Statement ) ( SP? ';' )?;
+
+oC_Statement
+    : oC_Query
+        | kU_CreateUser
+        | kU_CreateRole
+        | kU_CreateNodeTable
+        | kU_CreateRelTable
+        | kU_CreateSequence
+        | kU_CreateType
+        | kU_Drop
+        | kU_AlterTable
+        | kU_CopyFrom
+        | kU_CopyFromByColumn
+        | kU_CopyTO
+        | kU_StandaloneCall
+        | kU_CreateMacro
+        | kU_CommentOn
+        | kU_Transaction
+        | kU_Extension
+        | kU_ExportDatabase
+        | kU_ImportDatabase
+        | kU_AttachDatabase
+        | kU_DetachDatabase
+        | kU_UseDatabase;
+
+kU_CopyFrom
+    : COPY SP oC_SchemaName kU_ColumnNames? SP FROM SP kU_ScanSource ( SP? '(' SP? kU_Options SP? ')' )? ;
+
+kU_ColumnNames
+    : SP? '(' SP? (oC_SchemaName ( SP? ',' SP? oC_SchemaName )* SP?)? ')';
+
+kU_ScanSource
+    : kU_FilePaths
+        | '(' SP? oC_Query SP? ')'
+        | oC_Parameter
+        | oC_Variable
+        | oC_Variable '.' SP? oC_SchemaName
+        | oC_FunctionInvocation ;
+
+kU_CopyFromByColumn
+    : COPY SP oC_SchemaName SP FROM SP '(' SP? StringLiteral ( SP? ',' SP? StringLiteral )* ')' SP BY SP COLUMN ;
+
+kU_CopyTO
+    : COPY SP '(' SP? oC_Query SP? ')' SP TO SP StringLiteral ( SP? '(' SP? kU_Options SP? ')' )? ;
+
+kU_ExportDatabase
+    : EXPORT SP DATABASE SP StringLiteral ( SP? '(' SP? kU_Options SP? ')' )? ;
+
+kU_ImportDatabase
+    : IMPORT SP DATABASE SP StringLiteral;
+
+kU_AttachDatabase
+    : ATTACH SP StringLiteral (SP AS SP oC_SchemaName)? SP '(' SP? DBTYPE SP oC_SymbolicName (SP? ',' SP? kU_Options)? SP? ')' ;
+
+kU_Option
+    : oC_SymbolicName (SP? '=' SP? | SP*) oC_Literal | oC_SymbolicName;
+
+kU_Options
+    : kU_Option ( SP? ',' SP? kU_Option )* ;
+
+kU_DetachDatabase
+    : DETACH SP oC_SchemaName;
+
+kU_UseDatabase
+    : USE SP oC_SchemaName;
+
+kU_StandaloneCall
+    : CALL SP oC_SymbolicName SP? '=' SP? oC_Expression
+        | CALL SP oC_FunctionInvocation;
+
+kU_CommentOn
+    : COMMENT SP ON SP TABLE SP oC_SchemaName SP IS SP StringLiteral ;
+
+kU_CreateMacro
+    : CREATE SP MACRO SP oC_FunctionName SP? '(' SP? kU_PositionalArgs? SP? kU_DefaultArg? ( SP? ',' SP? kU_DefaultArg )* SP? ')' SP AS SP oC_Expression ;
+
+kU_PositionalArgs
+    : oC_SymbolicName ( SP? ',' SP? oC_SymbolicName )* ;
+
+kU_DefaultArg
+    : oC_SymbolicName SP? ':' '=' SP? oC_Literal ;
+
+kU_FilePaths
+    : '[' SP? StringLiteral ( SP? ',' SP? StringLiteral )* ']'
+        | StringLiteral
+        | GLOB SP? '(' SP? StringLiteral SP? ')' ;
+
+kU_IfNotExists
+    : IF SP NOT SP EXISTS ;
+
+kU_CreateNodeTable
+    : CREATE SP NODE SP TABLE SP (kU_IfNotExists SP)? oC_SchemaName ( SP? '(' SP? kU_PropertyDefinitions SP? ( ',' SP? kU_CreateNodeConstraint )? SP? ')' | SP AS SP oC_Query ) ;
+
+kU_CreateRelTable
+    : CREATE SP REL SP TABLE ( SP GROUP )? ( SP kU_IfNotExists )? SP oC_SchemaName
+        SP? '(' SP?
+            kU_FromToConnections SP? (
+            ( ',' SP? kU_PropertyDefinitions SP? )?
+            ( ',' SP? oC_SymbolicName SP? )? // Constraints
+            ')'
+            | ')' SP AS SP oC_Query )
+         ( SP WITH SP? '(' SP? kU_Options SP? ')')? ;
+
+kU_FromToConnections
+    : kU_FromToConnection ( SP? ',' SP? kU_FromToConnection )* ;
+
+kU_FromToConnection
+    : FROM SP oC_SchemaName SP TO SP oC_SchemaName ;
+
+kU_CreateSequence
+    : CREATE SP SEQUENCE SP (kU_IfNotExists SP)? oC_SchemaName (SP kU_SequenceOptions)* ;
+
+kU_CreateType
+    : CREATE SP TYPE SP oC_SchemaName SP AS SP kU_DataType SP? ;
+
+kU_SequenceOptions
+    : kU_IncrementBy
+        | kU_MinValue
+        | kU_MaxValue
+        | kU_StartWith
+        | kU_Cycle;
+
+kU_WithPasswd
+    : SP WITH SP PASSWORD SP StringLiteral ;
+
+kU_CreateUser
+    : CREATE SP USER SP (kU_IfNotExists SP)? oC_Variable kU_WithPasswd? ;
+
+kU_CreateRole
+    : CREATE SP ROLE SP (kU_IfNotExists SP)? oC_Variable ;
+
+kU_IncrementBy : INCREMENT SP ( BY SP )? MINUS? oC_IntegerLiteral ;
+
+kU_MinValue : (NO SP MINVALUE) | (MINVALUE SP MINUS? oC_IntegerLiteral) ;
+
+kU_MaxValue : (NO SP MAXVALUE) | (MAXVALUE SP MINUS? oC_IntegerLiteral) ;
+
+kU_StartWith : START SP ( WITH SP )? MINUS? oC_IntegerLiteral ;
+
+kU_Cycle : (NO SP)? CYCLE ;
+
+kU_IfExists
+    : IF SP EXISTS ;
+
+kU_Drop
+    : DROP SP (TABLE | SEQUENCE | MACRO) SP (kU_IfExists SP)? oC_SchemaName ;
+
+kU_AlterTable
+    : ALTER SP TABLE SP oC_SchemaName SP kU_AlterOptions ;
+
+kU_AlterOptions
+    : kU_AddProperty
+        | kU_DropProperty
+        | kU_RenameTable
+        | kU_RenameProperty
+        | kU_AddFromToConnection
+        | kU_DropFromToConnection;
+
+kU_AddProperty
+    : ADD SP (kU_IfNotExists SP)? oC_PropertyKeyName SP kU_DataType ( SP kU_Default )? ;
+
+kU_Default
+    : DEFAULT SP oC_Expression ;
+
+kU_DropProperty
+    : DROP SP (kU_IfExists SP)? oC_PropertyKeyName ;
+
+kU_RenameTable
+    : RENAME SP TO SP oC_SchemaName ;
+
+kU_RenameProperty
+    : RENAME SP oC_PropertyKeyName SP TO SP oC_PropertyKeyName ;
+
+kU_AddFromToConnection
+    : ADD SP (kU_IfNotExists SP)? kU_FromToConnection ;
+
+kU_DropFromToConnection
+    : DROP SP (kU_IfExists SP)? kU_FromToConnection ;
+
+kU_ColumnDefinitions: kU_ColumnDefinition ( SP? ',' SP? kU_ColumnDefinition )* ;
+
+kU_ColumnDefinition : oC_PropertyKeyName SP kU_DataType ;
+
+kU_PropertyDefinitions : kU_PropertyDefinition ( SP? ',' SP? kU_PropertyDefinition )* ;
+
+kU_PropertyDefinition : kU_ColumnDefinition ( SP kU_Default )? ( SP PRIMARY SP KEY)?;
+
+kU_CreateNodeConstraint : PRIMARY SP KEY SP? '(' SP? oC_PropertyKeyName SP? ')' ;
+
+DECIMAL: ( 'D' | 'd' ) ( 'E' | 'e' ) ( 'C' | 'c' ) ( 'I' | 'i' ) ( 'M' | 'm' ) ( 'A' | 'a' ) ( 'L' | 'l' ) ;
+
+kU_UnionType
+    : UNION SP? '(' SP? kU_ColumnDefinitions SP? ')' ;
+
+kU_StructType
+    : STRUCT SP? '(' SP? kU_ColumnDefinitions SP? ')' ;
+
+kU_MapType
+    : MAP SP? '(' SP? kU_DataType SP? ',' SP? kU_DataType SP? ')' ;
+
+kU_DecimalType
+    : DECIMAL SP? '(' SP? oC_IntegerLiteral SP? ',' SP? oC_IntegerLiteral SP? ')' ;
+
+kU_DataType
+    : oC_SymbolicName
+        | kU_DataType kU_ListIdentifiers
+        | kU_UnionType
+        | kU_StructType
+        | kU_MapType
+        | kU_DecimalType ;
+
+kU_ListIdentifiers : kU_ListIdentifier ( kU_ListIdentifier )* ;
+
+kU_ListIdentifier : '[' oC_IntegerLiteral? ']' ;
+
+oC_AnyCypherOption
+    : oC_Explain
+        | oC_Profile ;
+
+oC_Explain
+    : EXPLAIN (SP LOGICAL)? ;
+
+oC_Profile
+    : PROFILE ;
+
+kU_Transaction
+    : BEGIN SP TRANSACTION
+        | BEGIN SP TRANSACTION SP READ SP ONLY
+        | COMMIT
+        | ROLLBACK
+        | CHECKPOINT;
+
+kU_Extension
+    : kU_LoadExtension
+        | kU_InstallExtension
+        | kU_UninstallExtension
+        | kU_UpdateExtension ;
+
+kU_LoadExtension
+    : LOAD SP (EXTENSION SP)? ( StringLiteral | oC_Variable ) ;
+
+kU_InstallExtension
+    : (FORCE SP)? INSTALL SP oC_Variable (SP FROM SP StringLiteral)?;
+
+kU_UninstallExtension
+    : UNINSTALL SP oC_Variable;
+
+kU_UpdateExtension
+    : UPDATE SP oC_Variable;
+
+oC_Query
+    : oC_RegularQuery ;
+
+oC_RegularQuery
+    : oC_SingleQuery ( SP? oC_Union )*
+        | (oC_Return SP? )+ oC_SingleQuery { notifyReturnNotAtEnd($ctx->start); }
+        ;
+
+oC_Union
+     :  ( UNION SP ALL SP? oC_SingleQuery )
+         | ( UNION SP? oC_SingleQuery ) ;
+
+oC_SingleQuery
+    : oC_SinglePartQuery
+        | oC_MultiPartQuery
+        ;
+
+oC_SinglePartQuery
+    : ( oC_ReadingClause SP? )* oC_Return
+        | ( ( oC_ReadingClause SP? )* oC_UpdatingClause ( SP? oC_UpdatingClause )* ( SP? oC_Return )? )
+        ;
+
+oC_MultiPartQuery
+    : ( kU_QueryPart SP? )+ oC_SinglePartQuery;
+
+kU_QueryPart
+    : (oC_ReadingClause SP? )* ( oC_UpdatingClause SP? )* oC_With ;
+
+oC_UpdatingClause
+    : oC_Create
+        | oC_Merge
+        | oC_Set
+        | oC_Delete
+        ;
+
+oC_ReadingClause
+    : oC_Match
+        | oC_Unwind
+        | kU_InQueryCall
+        | kU_LoadFrom
+        ;
+
+kU_LoadFrom
+    :  LOAD ( SP WITH SP HEADERS SP? '(' SP? kU_ColumnDefinitions SP? ')' )? SP FROM SP kU_ScanSource (SP? '(' SP? kU_Options SP? ')')? (SP? oC_Where)? ;
+
+
+oC_YieldItem
+         :  ( oC_Variable SP AS SP )? oC_Variable ;
+
+oC_YieldItems
+          :  oC_YieldItem ( SP? ',' SP? oC_YieldItem )* ;
+
+kU_InQueryCall
+    : CALL SP oC_FunctionInvocation (SP? oC_Where)? ( SP? YIELD SP oC_YieldItems )? ;
+
+oC_Match
+    : ( OPTIONAL SP )? MATCH SP? oC_Pattern ( SP oC_Where )? ( SP kU_Hint )? ;
+
+kU_Hint
+    : HINT SP kU_JoinNode;
+
+kU_JoinNode
+    :  kU_JoinNode SP JOIN SP kU_JoinNode
+        | kU_JoinNode ( SP MULTI_JOIN SP oC_SchemaName)+
+        | '(' SP? kU_JoinNode SP? ')'
+        | oC_SchemaName ;
+
+oC_Unwind : UNWIND SP? oC_Expression SP AS SP oC_Variable ;
+
+oC_Create
+    : CREATE SP? oC_Pattern ;
+
+// For unknown reason, openCypher use oC_PatternPart instead of oC_Pattern. There should be no difference in terms of planning.
+// So we choose to be consistent with oC_Create and use oC_Pattern instead.
+oC_Merge : MERGE SP? oC_Pattern ( SP oC_MergeAction )* ;
+
+oC_MergeAction
+    :  ( ON SP MATCH SP oC_Set )
+        | ( ON SP CREATE SP oC_Set )
+        ;
+
+oC_Set
+    : SET SP? oC_SetItem ( SP? ',' SP? oC_SetItem )*
+        | SET SP? oC_Atom SP? '=' SP? kU_Properties;
+
+oC_SetItem
+    : ( oC_PropertyExpression SP? '=' SP? oC_Expression ) ;
+
+oC_Delete
+    : ( DETACH SP )? DELETE SP? oC_Expression ( SP? ',' SP? oC_Expression )*;
+
+oC_With
+    : WITH oC_ProjectionBody ( SP? oC_Where )? ;
+
+oC_Return
+    : RETURN oC_ProjectionBody ;
+
+oC_ProjectionBody
+    : ( SP? DISTINCT )? SP oC_ProjectionItems (SP oC_Order )? ( SP oC_Skip )? ( SP oC_Limit )? ;
+
+oC_ProjectionItems
+    : ( STAR ( SP? ',' SP? oC_ProjectionItem )* )
+        | ( oC_ProjectionItem ( SP? ',' SP? oC_ProjectionItem )* )
+        ;
+
+STAR : '*' ;
+
+oC_ProjectionItem
+    : ( oC_Expression SP AS SP oC_Variable )
+        | oC_Expression
+        ;
+
+oC_Order
+    : ORDER SP BY SP oC_SortItem ( ',' SP? oC_SortItem )* ;
+
+oC_Skip
+    :  L_SKIP SP oC_Expression ;
+
+L_SKIP : ( 'S' | 's' ) ( 'K' | 'k' ) ( 'I' | 'i' ) ( 'P' | 'p' ) ;
+
+oC_Limit
+    : LIMIT SP oC_Expression ;
+
+oC_SortItem
+    : oC_Expression ( SP? ( ASCENDING | ASC | DESCENDING | DESC ) )? ;
+
+oC_Where
+    : WHERE SP oC_Expression ;
+
+oC_Pattern
+    : oC_PatternPart ( SP? ',' SP? oC_PatternPart )* ;
+
+oC_PatternPart
+    :  ( oC_Variable SP? '=' SP? oC_AnonymousPatternPart )
+        | oC_AnonymousPatternPart ;
+
+oC_AnonymousPatternPart
+    : oC_PatternElement ;
+
+oC_PatternElement
+    : ( oC_NodePattern ( SP? oC_PatternElementChain )* )
+        | ( '(' oC_PatternElement ')' )
+        ;
+
+oC_NodePattern
+    : '(' SP? ( oC_Variable SP? )? ( oC_NodeLabels SP? )? ( kU_Properties SP? )? ')' ;
+
+oC_PatternElementChain
+    : oC_RelationshipPattern SP? oC_NodePattern ;
+
+oC_RelationshipPattern
+    : ( oC_LeftArrowHead SP? oC_Dash SP? oC_RelationshipDetail? SP? oC_Dash )
+        | ( oC_Dash SP? oC_RelationshipDetail? SP? oC_Dash SP? oC_RightArrowHead )
+        | ( oC_Dash SP? oC_RelationshipDetail? SP? oC_Dash )
+        ;
+
+oC_RelationshipDetail
+    : '[' SP? ( oC_Variable SP? )? ( oC_RelationshipTypes SP? )? ( kU_RecursiveDetail SP? )? ( kU_Properties SP? )? ']' ;
+
+// The original oC_Properties definition is  oC_MapLiteral | oC_Parameter.
+// We choose to not support parameter as properties which will be the decision for a long time.
+// We then substitute with oC_MapLiteral definition. We create oC_MapLiteral only when we decide to add MAP type.
+kU_Properties
+    : '{' SP? ( oC_PropertyKeyName SP? ':' SP? oC_Expression SP? ( ',' SP? oC_PropertyKeyName SP? ':' SP? oC_Expression SP? )* )? '}';
+
+oC_RelationshipTypes
+    :  ':' SP? oC_RelTypeName ( SP? '|' ':'? SP? oC_RelTypeName )* ;
+
+oC_NodeLabels
+    :  ':' SP? oC_LabelName ( SP? ('|' ':'? | ':') SP? oC_LabelName )* ;
+
+kU_RecursiveDetail
+    : '*' ( SP? kU_RecursiveType)? ( SP? oC_RangeLiteral )? ( SP? kU_RecursiveComprehension )? ;
+
+kU_RecursiveType
+    : (ALL SP)? WSHORTEST SP? '(' SP? oC_PropertyKeyName SP? ')'
+        | SHORTEST
+        | ALL SP SHORTEST
+        | TRAIL
+        | ACYCLIC ;
+
+oC_RangeLiteral
+    :  oC_LowerBound? SP? DOTDOT SP? oC_UpperBound?
+        | oC_IntegerLiteral ;
+
+kU_RecursiveComprehension
+    : '(' SP? oC_Variable SP? ',' SP? oC_Variable ( SP? '|' SP? oC_Where SP? )? ( SP? '|' SP? kU_RecursiveProjectionItems SP? ',' SP? kU_RecursiveProjectionItems SP? )? ')' ;
+
+kU_RecursiveProjectionItems
+    : '{' SP? oC_ProjectionItems? SP? '}' ;
+
+oC_LowerBound
+    : DecimalInteger ;
+
+oC_UpperBound
+    : DecimalInteger ;
+
+oC_LabelName
+    : oC_SchemaName ;
+
+oC_RelTypeName
+    : oC_SchemaName ;
+
+oC_Expression
+    : oC_OrExpression ;
+
+oC_OrExpression
+    : oC_XorExpression ( SP OR SP oC_XorExpression )* ;
+
+oC_XorExpression
+    : oC_AndExpression ( SP XOR SP oC_AndExpression )* ;
+
+oC_AndExpression
+    : oC_NotExpression ( SP AND SP oC_NotExpression )* ;
+
+oC_NotExpression
+    : ( NOT SP? )*  oC_ComparisonExpression;
+
+oC_ComparisonExpression
+    : kU_BitwiseOrOperatorExpression ( SP? kU_ComparisonOperator SP? kU_BitwiseOrOperatorExpression )?
+        | kU_BitwiseOrOperatorExpression ( SP? INVALID_NOT_EQUAL SP? kU_BitwiseOrOperatorExpression ) { notifyInvalidNotEqualOperator($INVALID_NOT_EQUAL); }
+        | kU_BitwiseOrOperatorExpression SP? kU_ComparisonOperator SP? kU_BitwiseOrOperatorExpression ( SP? kU_ComparisonOperator SP? kU_BitwiseOrOperatorExpression )+ { notifyNonBinaryComparison($ctx->start); }
+        ;
+
+kU_ComparisonOperator : '=' | '<>' | '<' | '<=' | '>' | '>=' ;
+
+INVALID_NOT_EQUAL : '!=' ;
+
+kU_BitwiseOrOperatorExpression
+    : kU_BitwiseAndOperatorExpression ( SP? '|' SP? kU_BitwiseAndOperatorExpression )* ;
+
+kU_BitwiseAndOperatorExpression
+    : kU_BitShiftOperatorExpression ( SP? '&' SP? kU_BitShiftOperatorExpression )* ;
+
+kU_BitShiftOperatorExpression
+    : oC_AddOrSubtractExpression ( SP? kU_BitShiftOperator SP? oC_AddOrSubtractExpression )* ;
+
+kU_BitShiftOperator : '>>' | '<<' ;
+
+oC_AddOrSubtractExpression
+    : oC_MultiplyDivideModuloExpression ( SP? kU_AddOrSubtractOperator SP? oC_MultiplyDivideModuloExpression )* ;
+
+kU_AddOrSubtractOperator : '+' | '-' ;
+
+oC_MultiplyDivideModuloExpression
+    : oC_PowerOfExpression ( SP? kU_MultiplyDivideModuloOperator SP? oC_PowerOfExpression )* ;
+
+kU_MultiplyDivideModuloOperator : '*' | '/' | '%' ;
+
+oC_PowerOfExpression
+    : oC_StringListNullOperatorExpression ( SP? '^' SP? oC_StringListNullOperatorExpression )* ;
+
+oC_StringListNullOperatorExpression
+    : oC_UnaryAddSubtractOrFactorialExpression ( oC_StringOperatorExpression | oC_ListOperatorExpression+ | oC_NullOperatorExpression )? ;
+
+oC_ListOperatorExpression
+    : ( SP IN SP? oC_PropertyOrLabelsExpression )
+        | ( '[' oC_Expression ']' )
+        | ( '[' oC_Expression? ( COLON | DOTDOT ) oC_Expression? ']' ) ;
+
+COLON : ':' ;
+
+DOTDOT : '..' ;
+
+oC_StringOperatorExpression
+    :  ( oC_RegularExpression | ( SP STARTS SP WITH ) | ( SP ENDS SP WITH ) | ( SP CONTAINS ) ) SP? oC_PropertyOrLabelsExpression ;
+
+oC_RegularExpression
+    :  SP? '=~' ;
+
+oC_NullOperatorExpression
+    : ( SP IS SP NULL )
+        | ( SP IS SP NOT SP NULL ) ;
+
+MINUS : '-' ;
+
+FACTORIAL : '!' ;
+
+oC_UnaryAddSubtractOrFactorialExpression
+    : ( MINUS SP? )* oC_PropertyOrLabelsExpression (SP? FACTORIAL)? ;
+
+oC_PropertyOrLabelsExpression
+    : oC_Atom ( SP? oC_PropertyLookup )* ;
+
+oC_Atom
+    : oC_Literal
+        | oC_Parameter
+        | oC_CaseExpression
+        | oC_ParenthesizedExpression
+        | oC_FunctionInvocation
+        | oC_PathPatterns
+        | oC_ExistCountSubquery
+        | oC_Variable
+        | oC_Quantifier
+        ;
+
+oC_Quantifier
+    :  ( ALL SP? '(' SP? oC_FilterExpression SP? ')' )
+        | ( ANY SP? '(' SP? oC_FilterExpression SP? ')' )
+        | ( NONE SP? '(' SP? oC_FilterExpression SP? ')' )
+        | ( SINGLE SP? '(' SP? oC_FilterExpression SP? ')' )
+        ;
+
+oC_FilterExpression
+    :  oC_IdInColl SP oC_Where ;
+
+oC_IdInColl
+    :  oC_Variable SP IN SP oC_Expression ;
+
+oC_Literal
+    : oC_NumberLiteral
+        | StringLiteral
+        | oC_BooleanLiteral
+        | NULL
+        | oC_ListLiteral
+        | kU_StructLiteral
+        ;
+
+oC_BooleanLiteral
+    : TRUE
+        | FALSE
+        ;
+
+oC_ListLiteral
+    :  '[' SP? ( oC_Expression SP? ( kU_ListEntry SP? )* )? ']' ;
+
+kU_ListEntry
+    : ',' SP? oC_Expression? ;
+
+kU_StructLiteral
+    :  '{' SP? kU_StructField SP? ( ',' SP? kU_StructField SP? )* '}' ;
+
+kU_StructField
+    :   ( oC_SymbolicName | StringLiteral ) SP? ':' SP? oC_Expression ;
+
+oC_ParenthesizedExpression
+    : '(' SP? oC_Expression SP? ')' ;
+
+oC_FunctionInvocation
+    : COUNT SP? '(' SP? '*' SP? ')'
+        | CAST SP? '(' SP? kU_FunctionParameter SP? ( ( AS SP? kU_DataType ) | ( ',' SP? kU_FunctionParameter ) ) SP? ')'
+        | oC_FunctionName SP? '(' SP? ( DISTINCT SP? )? ( kU_FunctionParameter SP? ( ',' SP? kU_FunctionParameter SP? )* )? ')' ;
+
+oC_FunctionName
+    : oC_SymbolicName ;
+
+kU_FunctionParameter
+    : ( oC_SymbolicName SP? ':' '=' SP? )? oC_Expression
+        | kU_LambdaParameter ;
+
+kU_LambdaParameter
+    : kU_LambdaVars SP? '-' '>' SP? oC_Expression SP? ;
+
+kU_LambdaVars
+    : oC_SymbolicName
+    | '(' SP? oC_SymbolicName SP? ( ',' SP? oC_SymbolicName SP?)* ')' ;
+
+oC_PathPatterns
+    : oC_NodePattern ( SP? oC_PatternElementChain )+;
+
+oC_ExistCountSubquery
+    : (EXISTS | COUNT) SP? '{' SP? MATCH SP? oC_Pattern ( SP? oC_Where )? ( SP? kU_Hint )? SP? '}' ;
+
+oC_PropertyLookup
+    : '.' SP? ( oC_PropertyKeyName | STAR ) ;
+
+oC_CaseExpression
+    :  ( ( CASE ( SP? oC_CaseAlternative )+ ) | ( CASE SP? oC_Expression ( SP? oC_CaseAlternative )+ ) ) ( SP? ELSE SP? oC_Expression )? SP? END ;
+
+oC_CaseAlternative
+    :  WHEN SP? oC_Expression SP? THEN SP? oC_Expression ;
+
+oC_Variable
+    : oC_SymbolicName ;
+
+StringLiteral
+    : ( '"' ( StringLiteral_0 | EscapedChar )* '"' )
+        | ( '\'' ( StringLiteral_1 | EscapedChar )* '\'' )
+        ;
+
+EscapedChar
+    : '\\' ( '\\' | '\'' | '"' | ( 'B' | 'b' ) | ( 'F' | 'f' ) | ( 'N' | 'n' ) | ( 'R' | 'r' ) | ( 'T' | 't' ) | ( ( 'X' | 'x' ) ( HexDigit HexDigit ) ) | ( ( 'U' | 'u' ) ( HexDigit HexDigit HexDigit HexDigit ) ) | ( ( 'U' | 'u' ) ( HexDigit HexDigit HexDigit HexDigit HexDigit HexDigit HexDigit HexDigit ) ) ) ;
+
+oC_NumberLiteral
+    : oC_DoubleLiteral
+        | oC_IntegerLiteral
+        ;
+
+oC_Parameter
+    : '$' ( oC_SymbolicName | DecimalInteger ) ;
+
+oC_PropertyExpression
+    : oC_Atom SP? oC_PropertyLookup ;
+
+oC_PropertyKeyName
+    : oC_SchemaName ;
+
+oC_IntegerLiteral
+    : DecimalInteger ;
+
+DecimalInteger
+    : ZeroDigit
+        | ( NonZeroDigit ( Digit )* )
+        ;
+
+HexLetter
+    : ( 'A' | 'a' )
+        | ( 'B' | 'b' )
+        | ( 'C' | 'c' )
+        | ( 'D' | 'd' )
+        | ( 'E' | 'e' )
+        | ( 'F' | 'f' )
+        ;
+
+HexDigit
+    : Digit
+        | HexLetter
+        ;
+
+Digit
+    : ZeroDigit
+        | NonZeroDigit
+        ;
+
+NonZeroDigit
+    : NonZeroOctDigit
+        | '8'
+        | '9'
+        ;
+
+NonZeroOctDigit
+    : '1'
+        | '2'
+        | '3'
+        | '4'
+        | '5'
+        | '6'
+        | '7'
+        ;
+
+ZeroDigit
+    : '0' ;
+
+oC_DoubleLiteral
+    : ExponentDecimalReal
+        | RegularDecimalReal
+        ;
+
+ExponentDecimalReal
+    : ( ( Digit )+ | ( ( Digit )+ '.' ( Digit )+ ) | ( '.' ( Digit )+ ) ) ( 'E' | 'e' ) '-'? ( Digit )+ ;
+
+RegularDecimalReal
+    : ( Digit )* '.' ( Digit )+ ;
+
+oC_SchemaName
+    : oC_SymbolicName ;
+
+oC_SymbolicName
+    : UnescapedSymbolicName
+        | EscapedSymbolicName {if ($EscapedSymbolicName.text == "``") { notifyEmptyToken($EscapedSymbolicName); }}
+        | HexLetter
+        | kU_NonReservedKeywords
+        ;
+
+// example of BEGIN and END: TCKWith2.Scenario1
+kU_NonReservedKeywords
+    : COMMENT
+        | ADD
+        | ALTER
+        | AS
+        | ATTACH
+        | BEGIN
+        | BY
+        | CALL
+        | CHECKPOINT
+        | COMMENT
+        | COMMIT
+        | CONTAINS
+        | COPY
+        | COUNT
+        | CYCLE
+        | DATABASE
+        | DECIMAL
+        | DELETE
+        | DETACH
+        | DROP
+        | EXPLAIN
+        | EXPORT
+        | EXTENSION
+        | FORCE
+        | GRAPH
+        | IF
+        | IS
+        | IMPORT
+        | INCREMENT
+        | KEY
+        | LOAD
+        | LOGICAL
+        | MATCH
+        | MAXVALUE
+        | MERGE
+        | MINVALUE
+        | NO
+        | NODE
+        | PROJECT
+        | READ
+        | REL
+        | RENAME
+        | RETURN
+        | ROLLBACK
+        | ROLE
+        | SEQUENCE
+        | SET
+        | START
+        | STRUCT
+        | L_SKIP
+        | LIMIT
+        | TRANSACTION
+        | TYPE
+        | USE
+        | UNINSTALL
+        | UPDATE
+        | WRITE
+        | FROM
+        | TO
+        | YIELD
+        | USER
+        | PASSWORD
+        | MAP
+        ;
+
+UnescapedSymbolicName
+    : IdentifierStart ( IdentifierPart )* ;
+
+IdentifierStart
+    : ID_Start
+        | Pc
+        ;
+
+IdentifierPart
+    : ID_Continue
+        | Sc
+        ;
+
+EscapedSymbolicName
+    : ( '`' ( EscapedSymbolicName_0 )* '`' )+ ;
+
+SP
+  : ( WHITESPACE )+ ;
+
+WHITESPACE
+    : SPACE
+        | TAB
+        | LF
+        | VT
+        | FF
+        | CR
+        | FS
+        | GS
+        | RS
+        | US
+        | '\u1680'
+        | '\u180e'
+        | '\u2000'
+        | '\u2001'
+        | '\u2002'
+        | '\u2003'
+        | '\u2004'
+        | '\u2005'
+        | '\u2006'
+        | '\u2008'
+        | '\u2009'
+        | '\u200a'
+        | '\u2028'
+        | '\u2029'
+        | '\u205f'
+        | '\u3000'
+        | '\u00a0'
+        | '\u2007'
+        | '\u202f'
+        | CypherComment
+        ;
+
+CypherComment
+    : ( '/*' ( Comment_1 | ( '*' Comment_2 ) )* '*/' )
+        | ( '//' ( Comment_3 )* CR? ( LF | EOF ) )
+        ;
+
+oC_LeftArrowHead
+    : '<'
+        | '\u27e8'
+        | '\u3008'
+        | '\ufe64'
+        | '\uff1c'
+        ;
+
+oC_RightArrowHead
+    : '>'
+        | '\u27e9'
+        | '\u3009'
+        | '\ufe65'
+        | '\uff1e'
+        ;
+
+oC_Dash
+    : '-'
+        | '\u00ad'
+        | '\u2010'
+        | '\u2011'
+        | '\u2012'
+        | '\u2013'
+        | '\u2014'
+        | '\u2015'
+        | '\u2212'
+        | '\ufe58'
+        | '\ufe63'
+        | '\uff0d'
+        ;
+
+fragment FF : [\f] ;
+
+fragment EscapedSymbolicName_0 : ~[`] ;
+
+fragment RS : [\u001E] ;
+
+fragment ID_Continue : [\p{ID_Continue}] ;
+
+fragment Comment_1 : ~[*] ;
+
+fragment StringLiteral_1 : ~['\\] ;
+
+fragment Comment_3 : ~[\n\r] ;
+
+fragment Comment_2 : ~[/] ;
+
+fragment GS : [\u001D] ;
+
+fragment FS : [\u001C] ;
+
+fragment CR : [\r] ;
+
+fragment Sc : [\p{Sc}] ;
+
+fragment SPACE : [ ] ;
+
+fragment Pc : [\p{Pc}] ;
+
+fragment TAB : [\t] ;
+
+fragment StringLiteral_0 : ~["\\] ;
+
+fragment LF : [\n] ;
+
+fragment VT : [\u000B] ;
+
+fragment US : [\u001F] ;
+
+fragment ID_Start : [\p{ID_Start}] ;
+
+// This is used to capture unknown lexer input (e.g. !) to avoid parser exception.
+Unknown : .;
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/antlr4/README.md b/graph-wasm/lbug-0.12.2/lbug-src/src/antlr4/README.md
new file mode 100644
index 0000000000..7bf65b6970
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/antlr4/README.md
@@ -0,0 +1 @@
+Neither `Cypher.g4` nor `keywords.txt` can be individually used to generate Ladybug's grammar. Rather, the files are combined to generate `scripts/antlr4/Cypher.g4`, which is immediately digestible.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/antlr4/keywords.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/antlr4/keywords.txt
new file mode 100644
index 0000000000..563f123f3c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/antlr4/keywords.txt
@@ -0,0 +1,115 @@
+ACYCLIC
+ANY
+ADD
+ALL
+ALTER
+AND
+AS
+ASC
+ASCENDING
+ATTACH
+BEGIN
+BY
+CALL
+CASE
+CAST
+CHECKPOINT
+COLUMN
+COMMENT
+COMMIT
+COMMIT_SKIP_CHECKPOINT
+CONTAINS
+COPY
+COUNT
+CREATE
+CYCLE
+DATABASE
+DBTYPE
+DEFAULT
+DELETE
+DESC
+DESCENDING
+DETACH
+DISTINCT
+DROP
+ELSE
+END
+ENDS
+EXISTS
+EXPLAIN
+EXPORT
+EXTENSION
+FALSE
+FROM
+FORCE
+GLOB
+GRAPH
+GROUP
+HEADERS
+HINT
+IMPORT
+IF
+IN
+INCREMENT
+INSTALL
+IS
+JOIN
+KEY
+LIMIT
+LOAD
+LOGICAL
+MACRO
+MATCH
+MAXVALUE
+MERGE
+MINVALUE
+MULTI_JOIN
+NO
+NODE
+NOT
+NONE
+NULL
+ON
+ONLY
+OPTIONAL
+OR
+ORDER
+PRIMARY
+PROFILE
+PROJECT
+READ
+REL
+RENAME
+RETURN
+ROLLBACK
+ROLLBACK_SKIP_CHECKPOINT
+SEQUENCE
+SET
+SHORTEST
+START
+STARTS
+STRUCT
+TABLE
+THEN
+TO
+TRAIL
+TRANSACTION
+TRUE
+TYPE
+UNION
+UNWIND
+UNINSTALL
+UPDATE
+USE
+WHEN
+WHERE
+WITH
+WRITE
+WSHORTEST
+XOR
+SINGLE
+YIELD
+USER
+PASSWORD
+ROLE
+MAP
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/CMakeLists.txt
new file mode 100644
index 0000000000..8d8a03a51c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/CMakeLists.txt
@@ -0,0 +1,22 @@
+add_subdirectory(bind)
+add_subdirectory(bind_expression)
+add_subdirectory(ddl)
+add_subdirectory(expression)
+add_subdirectory(query)
+add_subdirectory(rewriter)
+add_subdirectory(visitor)
+
+add_library(lbug_binder
+        OBJECT
+        binder.cpp
+        binder_scope.cpp
+        bound_statement_result.cpp
+        bound_scan_source.cpp
+        bound_statement_rewriter.cpp
+        bound_statement_visitor.cpp
+        expression_binder.cpp
+        expression_visitor.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/CMakeLists.txt
new file mode 100644
index 0000000000..04787014be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/CMakeLists.txt
@@ -0,0 +1,32 @@
+add_subdirectory(copy)
+add_subdirectory(ddl)
+add_subdirectory(read)
+
+add_library(
+        lbug_binder_bind
+        OBJECT
+        bind_attach_database.cpp
+        bind_create_macro.cpp
+        bind_ddl.cpp
+        bind_detach_database.cpp
+        bind_explain.cpp
+        bind_extension_clause.cpp
+        bind_file_scan.cpp
+        bind_graph_pattern.cpp
+        bind_projection_clause.cpp
+        bind_query.cpp
+        bind_reading_clause.cpp
+        bind_standalone_call.cpp
+        bind_table_function.cpp
+        bind_transaction.cpp
+        bind_updating_clause.cpp
+        bind_extension.cpp
+        bind_export_database.cpp
+        bind_import_database.cpp
+        bind_use_database.cpp
+        bind_standalone_call_function.cpp
+        bind_table_function.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_bind>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_attach_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_attach_database.cpp
new file mode 100644
index 0000000000..8dbc95f229
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_attach_database.cpp
@@ -0,0 +1,36 @@
+#include "binder/binder.h"
+#include "binder/bound_attach_database.h"
+#include "common/exception/binder.h"
+#include "common/string_utils.h"
+#include "parser/attach_database.h"
+#include "parser/expression/parsed_literal_expression.h"
+
+namespace lbug {
+namespace binder {
+
+static AttachInfo bindAttachInfo(const parser::AttachInfo& attachInfo) {
+    binder::AttachOption attachOption;
+    for (auto& [name, value] : attachInfo.options) {
+        if (value->getExpressionType() != common::ExpressionType::LITERAL) {
+            throw common::BinderException{"Attach option must be a literal expression."};
+        }
+        auto val = value->constPtrCast<parser::ParsedLiteralExpression>()->getValue();
+        attachOption.options.emplace(name, std::move(val));
+    }
+
+    if (common::StringUtils::getUpper(attachInfo.dbType) == common::ATTACHED_LBUG_DB_TYPE &&
+        attachInfo.dbAlias.empty()) {
+        throw common::BinderException{"Attaching a lbug database without an alias is not allowed."};
+    }
+    return binder::AttachInfo{attachInfo.dbPath, attachInfo.dbAlias, attachInfo.dbType,
+        std::move(attachOption)};
+}
+
+std::unique_ptr<BoundStatement> Binder::bindAttachDatabase(const parser::Statement& statement) {
+    auto& attachDatabase = statement.constCast<parser::AttachDatabase>();
+    auto boundAttachInfo = bindAttachInfo(attachDatabase.getAttachInfo());
+    return std::make_unique<BoundAttachDatabase>(std::move(boundAttachInfo));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_create_macro.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_create_macro.cpp
new file mode 100644
index 0000000000..7f80046efc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_create_macro.cpp
@@ -0,0 +1,35 @@
+#include "binder/binder.h"
+#include "binder/bound_create_macro.h"
+#include "catalog/catalog.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+#include "parser/create_macro.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bindCreateMacro(const Statement& statement) const {
+    auto& createMacro = ku_dynamic_cast<const CreateMacro&>(statement);
+    auto macroName = createMacro.getMacroName();
+    StringUtils::toUpper(macroName);
+    if (catalog::Catalog::Get(*clientContext)
+            ->containsMacro(transaction::Transaction::Get(*clientContext), macroName)) {
+        throw BinderException{stringFormat("Macro {} already exists.", macroName)};
+    }
+    parser::default_macro_args defaultArgs;
+    for (auto& defaultArg : createMacro.getDefaultArgs()) {
+        defaultArgs.emplace_back(defaultArg.first, defaultArg.second->copy());
+    }
+    auto scalarMacro =
+        std::make_unique<function::ScalarMacroFunction>(createMacro.getMacroExpression()->copy(),
+            createMacro.getPositionalArgs(), std::move(defaultArgs));
+    return std::make_unique<BoundCreateMacro>(std::move(macroName), std::move(scalarMacro));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_ddl.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_ddl.cpp
new file mode 100644
index 0000000000..3169cc7b3f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_ddl.cpp
@@ -0,0 +1,492 @@
+#include "binder/binder.h"
+#include "binder/ddl/bound_alter.h"
+#include "binder/ddl/bound_create_sequence.h"
+#include "binder/ddl/bound_create_table.h"
+#include "binder/ddl/bound_create_type.h"
+#include "binder/ddl/bound_drop.h"
+#include "binder/expression_visitor.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "common/enums/extend_direction_util.h"
+#include "common/exception/binder.h"
+#include "common/exception/message.h"
+#include "common/string_format.h"
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include "function/cast/functions/cast_from_string_functions.h"
+#include "function/sequence/sequence_functions.h"
+#include "main/client_context.h"
+#include "parser/ddl/alter.h"
+#include "parser/ddl/create_sequence.h"
+#include "parser/ddl/create_table.h"
+#include "parser/ddl/create_table_info.h"
+#include "parser/ddl/create_type.h"
+#include "parser/ddl/drop.h"
+#include "parser/expression/parsed_function_expression.h"
+#include "parser/expression/parsed_literal_expression.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+static void validatePropertyName(const std::vector<PropertyDefinition>& definitions) {
+    case_insensitve_set_t nameSet;
+    for (auto& definition : definitions) {
+        if (nameSet.contains(definition.getName())) {
+            throw BinderException(stringFormat(
+                "Duplicated column name: {}, column name must be unique.", definition.getName()));
+        }
+        if (Binder::reservedInColumnName(definition.getName())) {
+            throw BinderException(
+                stringFormat("{} is a reserved property name.", definition.getName()));
+        }
+        nameSet.insert(definition.getName());
+    }
+}
+
+std::vector<PropertyDefinition> Binder::bindPropertyDefinitions(
+    const std::vector<ParsedPropertyDefinition>& parsedDefinitions, const std::string& tableName) {
+    std::vector<PropertyDefinition> definitions;
+    for (auto& def : parsedDefinitions) {
+        auto type = LogicalType::convertFromString(def.getType(), clientContext);
+        auto defaultExpr =
+            resolvePropertyDefault(def.defaultExpr.get(), type, tableName, def.getName());
+        auto boundExpr = expressionBinder.bindExpression(*defaultExpr);
+        if (boundExpr->dataType != type) {
+            expressionBinder.implicitCast(boundExpr, type);
+        }
+        auto columnDefinition = ColumnDefinition(def.getName(), std::move(type));
+        definitions.emplace_back(std::move(columnDefinition), std::move(defaultExpr));
+    }
+    validatePropertyName(definitions);
+    return definitions;
+}
+
+std::unique_ptr<ParsedExpression> Binder::resolvePropertyDefault(ParsedExpression* parsedDefault,
+    const LogicalType& type, const std::string& tableName, const std::string& propertyName) {
+    if (parsedDefault == nullptr) { // No default provided.
+        if (type.getLogicalTypeID() == LogicalTypeID::SERIAL) {
+            auto serialName = SequenceCatalogEntry::getSerialName(tableName, propertyName);
+            auto literalExpr = std::make_unique<ParsedLiteralExpression>(Value(serialName), "");
+            return std::make_unique<ParsedFunctionExpression>(function::NextValFunction::name,
+                std::move(literalExpr), "" /* rawName */);
+        } else {
+            return std::make_unique<ParsedLiteralExpression>(Value::createNullValue(type), "NULL");
+        }
+    } else {
+        if (type.getLogicalTypeID() == LogicalTypeID::SERIAL) {
+            throw BinderException("No DEFAULT value should be set for SERIAL columns");
+        }
+        return parsedDefault->copy();
+    }
+}
+
+static void validatePrimaryKey(const std::string& pkColName,
+    const std::vector<PropertyDefinition>& definitions) {
+    uint32_t primaryKeyIdx = UINT32_MAX;
+    for (auto i = 0u; i < definitions.size(); i++) {
+        if (definitions[i].getName() == pkColName) {
+            primaryKeyIdx = i;
+        }
+    }
+    if (primaryKeyIdx == UINT32_MAX) {
+        throw BinderException(
+            "Primary key " + pkColName + " does not match any of the predefined node properties.");
+    }
+    const auto& pkType = definitions[primaryKeyIdx].getType();
+    if (!pkType.isInternalType()) {
+        throw BinderException(ExceptionMessage::invalidPKType(pkType.toString()));
+    }
+    switch (pkType.getPhysicalType()) {
+    case PhysicalTypeID::UINT8:
+    case PhysicalTypeID::UINT16:
+    case PhysicalTypeID::UINT32:
+    case PhysicalTypeID::UINT64:
+    case PhysicalTypeID::INT8:
+    case PhysicalTypeID::INT16:
+    case PhysicalTypeID::INT32:
+    case PhysicalTypeID::INT64:
+    case PhysicalTypeID::INT128:
+    case PhysicalTypeID::UINT128:
+    case PhysicalTypeID::STRING:
+    case PhysicalTypeID::FLOAT:
+    case PhysicalTypeID::DOUBLE:
+        break;
+    default:
+        throw BinderException(ExceptionMessage::invalidPKType(pkType.toString()));
+    }
+}
+
+BoundCreateTableInfo Binder::bindCreateTableInfo(const CreateTableInfo* info) {
+    switch (info->type) {
+    case TableType::NODE: {
+        return bindCreateNodeTableInfo(info);
+    }
+    case TableType::REL: {
+        return bindCreateRelTableGroupInfo(info);
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+BoundCreateTableInfo Binder::bindCreateNodeTableInfo(const CreateTableInfo* info) {
+    auto propertyDefinitions = bindPropertyDefinitions(info->propertyDefinitions, info->tableName);
+    auto& extraInfo = info->extraInfo->constCast<ExtraCreateNodeTableInfo>();
+    validatePrimaryKey(extraInfo.pKName, propertyDefinitions);
+    auto boundExtraInfo = std::make_unique<BoundExtraCreateNodeTableInfo>(extraInfo.pKName,
+        std::move(propertyDefinitions));
+    return BoundCreateTableInfo(CatalogEntryType::NODE_TABLE_ENTRY, info->tableName,
+        info->onConflict, std::move(boundExtraInfo), clientContext->useInternalCatalogEntry());
+}
+
+void Binder::validateNodeTableType(const TableCatalogEntry* entry) {
+    if (entry->getType() != CatalogEntryType::NODE_TABLE_ENTRY) {
+        throw BinderException(stringFormat("{} is not of type NODE.", entry->getName()));
+    }
+}
+
+void Binder::validateTableExistence(const main::ClientContext& context,
+    const std::string& tableName) {
+    auto transaction = transaction::Transaction::Get(context);
+    if (!Catalog::Get(context)->containsTable(transaction, tableName)) {
+        throw BinderException{stringFormat("Table {} does not exist.", tableName)};
+    }
+}
+
+void Binder::validateColumnExistence(const TableCatalogEntry* entry,
+    const std::string& columnName) {
+    if (!entry->containsProperty(columnName)) {
+        throw BinderException{
+            stringFormat("Column {} does not exist in table {}.", columnName, entry->getName())};
+    }
+}
+
+static ExtendDirection getStorageDirection(const case_insensitive_map_t<Value>& options) {
+    if (options.contains(TableOptionConstants::REL_STORAGE_DIRECTION_OPTION)) {
+        return ExtendDirectionUtil::fromString(
+            options.at(TableOptionConstants::REL_STORAGE_DIRECTION_OPTION).toString());
+    }
+    return DEFAULT_EXTEND_DIRECTION;
+}
+
+std::vector<PropertyDefinition> Binder::bindRelPropertyDefinitions(const CreateTableInfo& info) {
+    std::vector<PropertyDefinition> propertyDefinitions;
+    propertyDefinitions.emplace_back(
+        ColumnDefinition(InternalKeyword::ID, LogicalType::INTERNAL_ID()));
+    for (auto& definition : bindPropertyDefinitions(info.propertyDefinitions, info.tableName)) {
+        propertyDefinitions.push_back(definition.copy());
+    }
+    return propertyDefinitions;
+}
+
+BoundCreateTableInfo Binder::bindCreateRelTableGroupInfo(const CreateTableInfo* info) {
+    auto propertyDefinitions = bindRelPropertyDefinitions(*info);
+    auto& extraInfo = info->extraInfo->constCast<ExtraCreateRelTableGroupInfo>();
+    auto srcMultiplicity = RelMultiplicityUtils::getFwd(extraInfo.relMultiplicity);
+    auto dstMultiplicity = RelMultiplicityUtils::getBwd(extraInfo.relMultiplicity);
+    auto boundOptions = bindParsingOptions(extraInfo.options);
+    auto storageDirection = getStorageDirection(boundOptions);
+    // Bind from to pairs
+    node_table_id_pair_set_t nodePairsSet;
+    std::vector<NodeTableIDPair> nodePairs;
+    for (auto& [srcTableName, dstTableName] : extraInfo.srcDstTablePairs) {
+        auto srcEntry = bindNodeTableEntry(srcTableName);
+        validateNodeTableType(srcEntry);
+        auto dstEntry = bindNodeTableEntry(dstTableName);
+        validateNodeTableType(dstEntry);
+        NodeTableIDPair pair{srcEntry->getTableID(), dstEntry->getTableID()};
+        if (nodePairsSet.contains(pair)) {
+            throw BinderException(
+                stringFormat("Found duplicate FROM-TO {}-{} pairs.", srcTableName, dstTableName));
+        }
+        nodePairsSet.insert(pair);
+        nodePairs.emplace_back(pair);
+    }
+    auto boundExtraInfo =
+        std::make_unique<BoundExtraCreateRelTableGroupInfo>(std::move(propertyDefinitions),
+            srcMultiplicity, dstMultiplicity, storageDirection, std::move(nodePairs));
+    return BoundCreateTableInfo(CatalogEntryType::REL_GROUP_ENTRY, info->tableName,
+        info->onConflict, std::move(boundExtraInfo), clientContext->useInternalCatalogEntry());
+}
+
+std::unique_ptr<BoundStatement> Binder::bindCreateTable(const Statement& statement) {
+    auto& createTable = statement.constCast<CreateTable>();
+    if (createTable.getSource()) {
+        return bindCreateTableAs(createTable);
+    }
+    auto boundCreateInfo = bindCreateTableInfo(createTable.getInfo());
+    return std::make_unique<BoundCreateTable>(std::move(boundCreateInfo),
+        BoundStatementResult::createSingleStringColumnResult());
+}
+
+std::unique_ptr<BoundStatement> Binder::bindCreateTableAs(const Statement& statement) {
+    auto& createTable = statement.constCast<CreateTable>();
+    auto boundInnerQuery = bindQuery(*createTable.getSource()->statement.get());
+    auto innerQueryResult = boundInnerQuery->getStatementResult();
+    auto columnNames = innerQueryResult->getColumnNames();
+    auto columnTypes = innerQueryResult->getColumnTypes();
+    std::vector<PropertyDefinition> propertyDefinitions;
+    propertyDefinitions.reserve(columnNames.size());
+    for (size_t i = 0; i < columnNames.size(); ++i) {
+        propertyDefinitions.emplace_back(
+            ColumnDefinition(std::string(columnNames[i]), columnTypes[i].copy()));
+    }
+    if (columnNames.empty()) {
+        throw BinderException("Subquery returns no columns");
+    }
+    auto createInfo = createTable.getInfo();
+    switch (createInfo->type) {
+    case TableType::NODE: {
+        // first column is primary key column temporarily for now
+        auto pkName = columnNames[0];
+        validatePrimaryKey(pkName, propertyDefinitions);
+        auto boundCopyFromInfo = bindCopyNodeFromInfo(createInfo->tableName, propertyDefinitions,
+            createTable.getSource(), options_t{}, columnNames, columnTypes, false /* byColumn */);
+        auto boundExtraInfo =
+            std::make_unique<BoundExtraCreateNodeTableInfo>(pkName, std::move(propertyDefinitions));
+        auto boundCreateInfo = BoundCreateTableInfo(CatalogEntryType::NODE_TABLE_ENTRY,
+            createInfo->tableName, createInfo->onConflict, std::move(boundExtraInfo),
+            clientContext->useInternalCatalogEntry());
+        auto boundCreateTable = std::make_unique<BoundCreateTable>(std::move(boundCreateInfo),
+            BoundStatementResult::createSingleStringColumnResult());
+        boundCreateTable->setCopyInfo(std::move(boundCopyFromInfo));
+        return boundCreateTable;
+    }
+    case TableType::REL: {
+        auto& extraInfo = createInfo->extraInfo->constCast<ExtraCreateRelTableGroupInfo>();
+        // Currently we don't support multiple from/to pairs for create rel table as
+        if (extraInfo.srcDstTablePairs.size() > 1) {
+            throw BinderException(
+                "Multiple FROM/TO pairs are not supported for CREATE REL TABLE AS.");
+        }
+        propertyDefinitions.insert(propertyDefinitions.begin(),
+            PropertyDefinition(ColumnDefinition(InternalKeyword::ID, LogicalType::INTERNAL_ID())));
+        auto catalog = Catalog::Get(*clientContext);
+        auto transaction = transaction::Transaction::Get(*clientContext);
+        auto fromTable =
+            catalog->getTableCatalogEntry(transaction, extraInfo.srcDstTablePairs[0].first)
+                ->ptrCast<NodeTableCatalogEntry>();
+        auto toTable =
+            catalog->getTableCatalogEntry(transaction, extraInfo.srcDstTablePairs[0].second)
+                ->ptrCast<NodeTableCatalogEntry>();
+        auto boundCreateInfo = bindCreateRelTableGroupInfo(createInfo);
+        auto boundCopyFromInfo = bindCopyRelFromInfo(createInfo->tableName, propertyDefinitions,
+            createTable.getSource(), options_t{}, columnNames, columnTypes, fromTable, toTable);
+        boundCreateInfo.extraInfo->ptrCast<BoundExtraCreateTableInfo>()->propertyDefinitions =
+            std::move(propertyDefinitions);
+        auto boundCreateTable = std::make_unique<BoundCreateTable>(std::move(boundCreateInfo),
+            BoundStatementResult::createSingleStringColumnResult());
+        boundCreateTable->setCopyInfo(std::move(boundCopyFromInfo));
+        return boundCreateTable;
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+std::unique_ptr<BoundStatement> Binder::bindCreateType(const Statement& statement) const {
+    auto createType = statement.constPtrCast<CreateType>();
+    auto name = createType->getName();
+    LogicalType type = LogicalType::convertFromString(createType->getDataType(), clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    if (Catalog::Get(*clientContext)->containsType(transaction, name)) {
+        throw BinderException{stringFormat("Duplicated type name: {}.", name)};
+    }
+    return std::make_unique<BoundCreateType>(std::move(name), std::move(type));
+}
+
+std::unique_ptr<BoundStatement> Binder::bindCreateSequence(const Statement& statement) const {
+    auto& createSequence = statement.constCast<CreateSequence>();
+    auto info = createSequence.getInfo();
+    auto sequenceName = info.sequenceName;
+    int64_t startWith = 0;
+    int64_t increment = 0;
+    int64_t minValue = 0;
+    int64_t maxValue = 0;
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    switch (info.onConflict) {
+    case ConflictAction::ON_CONFLICT_THROW: {
+        if (Catalog::Get(*clientContext)->containsSequence(transaction, sequenceName)) {
+            throw BinderException(sequenceName + " already exists in catalog.");
+        }
+    } break;
+    default:
+        break;
+    }
+    auto literal = ku_string_t{info.increment.c_str(), info.increment.length()};
+    if (!function::CastString::tryCast(literal, increment)) {
+        throw BinderException("Out of bounds: SEQUENCE accepts integers within INT64.");
+    }
+    if (increment == 0) {
+        throw BinderException("INCREMENT must be non-zero.");
+    }
+
+    if (info.minValue == "") {
+        minValue = increment > 0 ? 1 : std::numeric_limits<int64_t>::min();
+    } else {
+        literal = ku_string_t{info.minValue.c_str(), info.minValue.length()};
+        if (!function::CastString::tryCast(literal, minValue)) {
+            throw BinderException("Out of bounds: SEQUENCE accepts integers within INT64.");
+        }
+    }
+    if (info.maxValue == "") {
+        maxValue = increment > 0 ? std::numeric_limits<int64_t>::max() : -1;
+    } else {
+        literal = ku_string_t{info.maxValue.c_str(), info.maxValue.length()};
+        if (!function::CastString::tryCast(literal, maxValue)) {
+            throw BinderException("Out of bounds: SEQUENCE accepts integers within INT64.");
+        }
+    }
+    if (info.startWith == "") {
+        startWith = increment > 0 ? minValue : maxValue;
+    } else {
+        literal = ku_string_t{info.startWith.c_str(), info.startWith.length()};
+        if (!function::CastString::tryCast(literal, startWith)) {
+            throw BinderException("Out of bounds: SEQUENCE accepts integers within INT64.");
+        }
+    }
+
+    if (maxValue < minValue) {
+        throw BinderException("SEQUENCE MAXVALUE should be greater than or equal to MINVALUE.");
+    }
+    if (startWith < minValue || startWith > maxValue) {
+        throw BinderException("SEQUENCE START value should be between MINVALUE and MAXVALUE.");
+    }
+
+    auto boundInfo = BoundCreateSequenceInfo(sequenceName, startWith, increment, minValue, maxValue,
+        info.cycle, info.onConflict, false /* isInternal */);
+    return std::make_unique<BoundCreateSequence>(std::move(boundInfo));
+}
+
+std::unique_ptr<BoundStatement> Binder::bindDrop(const Statement& statement) {
+    auto& drop = statement.constCast<Drop>();
+    return std::make_unique<BoundDrop>(drop.getDropInfo());
+}
+
+std::unique_ptr<BoundStatement> Binder::bindAlter(const Statement& statement) {
+    auto& alter = statement.constCast<Alter>();
+    switch (alter.getInfo()->type) {
+    case AlterType::RENAME: {
+        return bindRenameTable(statement);
+    }
+    case AlterType::ADD_PROPERTY: {
+        return bindAddProperty(statement);
+    }
+    case AlterType::DROP_PROPERTY: {
+        return bindDropProperty(statement);
+    }
+    case AlterType::RENAME_PROPERTY: {
+        return bindRenameProperty(statement);
+    }
+    case AlterType::COMMENT: {
+        return bindCommentOn(statement);
+    }
+    case AlterType::ADD_FROM_TO_CONNECTION:
+    case AlterType::DROP_FROM_TO_CONNECTION: {
+        return bindAlterFromToConnection(statement);
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+std::unique_ptr<BoundStatement> Binder::bindRenameTable(const Statement& statement) const {
+    auto& alter = statement.constCast<Alter>();
+    auto info = alter.getInfo();
+    auto extraInfo = ku_dynamic_cast<ExtraRenameTableInfo*>(info->extraInfo.get());
+    auto tableName = info->tableName;
+    auto newName = extraInfo->newName;
+    auto boundExtraInfo = std::make_unique<BoundExtraRenameTableInfo>(newName);
+    auto boundInfo =
+        BoundAlterInfo(AlterType::RENAME, tableName, std::move(boundExtraInfo), info->onConflict);
+    return std::make_unique<BoundAlter>(std::move(boundInfo));
+}
+
+std::unique_ptr<BoundStatement> Binder::bindAddProperty(const Statement& statement) {
+    auto& alter = statement.constCast<Alter>();
+    auto info = alter.getInfo();
+    auto extraInfo = info->extraInfo->ptrCast<ExtraAddPropertyInfo>();
+    auto tableName = info->tableName;
+    auto propertyName = extraInfo->propertyName;
+    auto type = LogicalType::convertFromString(extraInfo->dataType, clientContext);
+    auto columnDefinition = ColumnDefinition(propertyName, type.copy());
+    auto defaultExpr =
+        resolvePropertyDefault(extraInfo->defaultValue.get(), type, tableName, propertyName);
+    auto boundDefault = expressionBinder.bindExpression(*defaultExpr);
+    boundDefault = expressionBinder.implicitCastIfNecessary(boundDefault, type);
+    if (ConstantExpressionVisitor::needFold(*boundDefault)) {
+        boundDefault = expressionBinder.foldExpression(boundDefault);
+    }
+    auto propertyDefinition =
+        PropertyDefinition(std::move(columnDefinition), std::move(defaultExpr));
+    auto boundExtraInfo = std::make_unique<BoundExtraAddPropertyInfo>(std::move(propertyDefinition),
+        std::move(boundDefault));
+    auto boundInfo = BoundAlterInfo(AlterType::ADD_PROPERTY, tableName, std::move(boundExtraInfo),
+        info->onConflict);
+    return std::make_unique<BoundAlter>(std::move(boundInfo));
+}
+
+std::unique_ptr<BoundStatement> Binder::bindDropProperty(const Statement& statement) const {
+    auto& alter = statement.constCast<Alter>();
+    auto info = alter.getInfo();
+    auto extraInfo = info->extraInfo->constPtrCast<ExtraDropPropertyInfo>();
+    auto tableName = info->tableName;
+    auto propertyName = extraInfo->propertyName;
+    auto boundExtraInfo = std::make_unique<BoundExtraDropPropertyInfo>(propertyName);
+    auto boundInfo = BoundAlterInfo(AlterType::DROP_PROPERTY, tableName, std::move(boundExtraInfo),
+        info->onConflict);
+    return std::make_unique<BoundAlter>(std::move(boundInfo));
+}
+
+std::unique_ptr<BoundStatement> Binder::bindRenameProperty(const Statement& statement) const {
+    auto& alter = statement.constCast<Alter>();
+    auto info = alter.getInfo();
+    auto extraInfo = info->extraInfo->constPtrCast<ExtraRenamePropertyInfo>();
+    auto tableName = info->tableName;
+    auto propertyName = extraInfo->propertyName;
+    auto newName = extraInfo->newName;
+    auto boundExtraInfo = std::make_unique<BoundExtraRenamePropertyInfo>(newName, propertyName);
+    auto boundInfo = BoundAlterInfo(AlterType::RENAME_PROPERTY, tableName,
+        std::move(boundExtraInfo), info->onConflict);
+    return std::make_unique<BoundAlter>(std::move(boundInfo));
+}
+
+std::unique_ptr<BoundStatement> Binder::bindCommentOn(const Statement& statement) const {
+    auto& alter = statement.constCast<Alter>();
+    auto info = alter.getInfo();
+    auto extraInfo = info->extraInfo->constPtrCast<ExtraCommentInfo>();
+    auto tableName = info->tableName;
+    auto comment = extraInfo->comment;
+    auto boundExtraInfo = std::make_unique<BoundExtraCommentInfo>(comment);
+    auto boundInfo =
+        BoundAlterInfo(AlterType::COMMENT, tableName, std::move(boundExtraInfo), info->onConflict);
+    return std::make_unique<BoundAlter>(std::move(boundInfo));
+}
+
+std::unique_ptr<BoundStatement> Binder::bindAlterFromToConnection(
+    const Statement& statement) const {
+    auto& alter = statement.constCast<Alter>();
+    auto info = alter.getInfo();
+    auto extraInfo = info->extraInfo->constPtrCast<ExtraAddFromToConnection>();
+    auto tableName = info->tableName;
+    auto srcTableEntry = bindNodeTableEntry(extraInfo->srcTableName);
+    auto dstTableEntry = bindNodeTableEntry(extraInfo->dstTableName);
+    auto srcTableID = srcTableEntry->getTableID();
+    auto dstTableID = dstTableEntry->getTableID();
+    auto boundExtraInfo = std::make_unique<BoundExtraAlterFromToConnection>(srcTableID, dstTableID);
+    auto boundInfo =
+        BoundAlterInfo(info->type, tableName, std::move(boundExtraInfo), info->onConflict);
+    return std::make_unique<BoundAlter>(std::move(boundInfo));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_detach_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_detach_database.cpp
new file mode 100644
index 0000000000..5506e9afc2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_detach_database.cpp
@@ -0,0 +1,14 @@
+#include "binder/binder.h"
+#include "binder/bound_detach_database.h"
+#include "parser/detach_database.h"
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bindDetachDatabase(const parser::Statement& statement) {
+    auto& detachDatabase = statement.constCast<parser::DetachDatabase>();
+    return std::make_unique<BoundDetachDatabase>(detachDatabase.getDBName());
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_explain.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_explain.cpp
new file mode 100644
index 0000000000..789d246c4b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_explain.cpp
@@ -0,0 +1,16 @@
+#include "binder/binder.h"
+#include "binder/bound_explain.h"
+#include "parser/explain_statement.h"
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bindExplain(const parser::Statement& statement) {
+    auto& explain = statement.constCast<parser::ExplainStatement>();
+    auto boundStatementToExplain = bind(*explain.getStatementToExplain());
+    return std::make_unique<BoundExplain>(std::move(boundStatementToExplain),
+        explain.getExplainType());
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_export_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_export_database.cpp
new file mode 100644
index 0000000000..3da7586a27
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_export_database.cpp
@@ -0,0 +1,169 @@
+#include "binder/bound_export_database.h"
+#include "binder/query/bound_regular_query.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/index_catalog_entry.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/string_utils.h"
+#include "main/client_context.h"
+#include "parser/parser.h"
+#include "parser/port_db.h"
+#include "parser/query/regular_query.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::catalog;
+using namespace lbug::transaction;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace binder {
+
+FileTypeInfo getFileType(case_insensitive_map_t<Value>& options) {
+    auto fileTypeInfo =
+        FileTypeInfo{FileType::PARQUET, PortDBConstants::DEFAULT_EXPORT_FORMAT_OPTION};
+    if (options.contains(PortDBConstants::EXPORT_FORMAT_OPTION)) {
+        auto value = options.at(PortDBConstants::EXPORT_FORMAT_OPTION);
+        if (value.getDataType().getLogicalTypeID() != LogicalTypeID::STRING) {
+            throw BinderException("The type of format option must be a string.");
+        }
+        auto valueStr = value.getValue<std::string>();
+        StringUtils::toUpper(valueStr);
+        fileTypeInfo = FileTypeInfo{FileTypeUtils::fromString(valueStr), valueStr};
+        options.erase(PortDBConstants::EXPORT_FORMAT_OPTION);
+    }
+    return fileTypeInfo;
+}
+
+void bindExportTableData(ExportedTableData& tableData, const std::string& query,
+    main::ClientContext* context, Binder* binder) {
+    auto parsedStatement = Parser::parseQuery(query);
+    KU_ASSERT(parsedStatement.size() == 1);
+    auto parsedQuery = parsedStatement[0]->constPtrCast<RegularQuery>();
+    context->setUseInternalCatalogEntry(true /* useInternalCatalogEntry */);
+    auto boundQuery = binder->bindQuery(*parsedQuery);
+    context->setUseInternalCatalogEntry(false /* useInternalCatalogEntry */);
+    auto columns = boundQuery->getStatementResult()->getColumns();
+    for (auto& column : columns) {
+        auto columnName = column->hasAlias() ? column->getAlias() : column->toString();
+        tableData.columnNames.push_back(columnName);
+        tableData.columnTypes.push_back(column->getDataType().copy());
+    }
+    tableData.regularQuery = std::move(boundQuery);
+}
+
+static std::string getExportNodeTableDataQuery(const TableCatalogEntry& entry) {
+    return stringFormat("match (a:`{}`) return a.*", entry.getName());
+}
+
+static std::string getExportRelTableDataQuery(const TableCatalogEntry& relGroupEntry,
+    const NodeTableCatalogEntry& srcEntry, const NodeTableCatalogEntry& dstEntry) {
+    return stringFormat("match (a:`{}`)-[r:`{}`]->(b:`{}`) return a.{},b.{},r.*;",
+        srcEntry.getName(), relGroupEntry.getName(), dstEntry.getName(),
+        srcEntry.getPrimaryKeyName(), dstEntry.getPrimaryKeyName());
+}
+
+static std::vector<ExportedTableData> getExportInfo(const Catalog& catalog,
+    main::ClientContext* context, Binder* binder, FileTypeInfo& fileTypeInfo) {
+    auto transaction = Transaction::Get(*context);
+    std::vector<ExportedTableData> exportData;
+    for (auto entry : catalog.getNodeTableEntries(transaction, false /*useInternal*/)) {
+        ExportedTableData tableData;
+        tableData.tableName = entry->getName();
+        tableData.fileName =
+            entry->getName() + "." + StringUtils::getLower(fileTypeInfo.fileTypeStr);
+        auto query = getExportNodeTableDataQuery(*entry);
+        bindExportTableData(tableData, query, context, binder);
+        exportData.push_back(std::move(tableData));
+    }
+    for (auto entry : catalog.getRelGroupEntries(transaction, false /* useInternal */)) {
+        auto& relGroupEntry = entry->constCast<RelGroupCatalogEntry>();
+        for (auto& info : relGroupEntry.getRelEntryInfos()) {
+            ExportedTableData tableData;
+            auto srcTableID = info.nodePair.srcTableID;
+            auto dstTableID = info.nodePair.dstTableID;
+            auto& srcEntry = catalog.getTableCatalogEntry(transaction, srcTableID)
+                                 ->constCast<NodeTableCatalogEntry>();
+            auto& dstEntry = catalog.getTableCatalogEntry(transaction, dstTableID)
+                                 ->constCast<NodeTableCatalogEntry>();
+            tableData.tableName = entry->getName();
+            tableData.fileName =
+                stringFormat("{}_{}_{}.{}", relGroupEntry.getName(), srcEntry.getName(),
+                    dstEntry.getName(), StringUtils::getLower(fileTypeInfo.fileTypeStr));
+            auto query = getExportRelTableDataQuery(relGroupEntry, srcEntry, dstEntry);
+            bindExportTableData(tableData, query, context, binder);
+            exportData.push_back(std::move(tableData));
+        }
+    }
+
+    for (auto indexEntry : catalog.getIndexEntries(transaction)) {
+        // Export
+        ExportedTableData tableData;
+        auto entry = indexEntry->getTableEntryToExport(context);
+        if (entry == nullptr) {
+            continue;
+        }
+        KU_ASSERT(entry->getTableType() == TableType::NODE);
+        tableData.tableName = entry->getName();
+        tableData.fileName =
+            entry->getName() + "." + StringUtils::getLower(fileTypeInfo.fileTypeStr);
+        auto query = getExportNodeTableDataQuery(*entry);
+        bindExportTableData(tableData, query, context, binder);
+        exportData.push_back(std::move(tableData));
+    }
+    return exportData;
+}
+
+static bool schemaOnly(case_insensitive_map_t<Value>& parsedOptions,
+    const parser::ExportDB& exportDB) {
+    auto isSchemaOnlyOption = [](const std::pair<std::string, Value>& option) -> bool {
+        if (option.first != PortDBConstants::SCHEMA_ONLY_OPTION) {
+            return false;
+        }
+        if (option.second.getDataType() != LogicalType::BOOL()) {
+            throw common::BinderException{common::stringFormat(
+                "The '{}' option must have a BOOL value.", PortDBConstants::SCHEMA_ONLY_OPTION)};
+        }
+        return option.second.getValue<bool>();
+    };
+    auto exportSchemaOnly =
+        std::count_if(parsedOptions.begin(), parsedOptions.end(), isSchemaOnlyOption) != 0;
+    if (exportSchemaOnly && exportDB.getParsingOptionsRef().size() != 1) {
+        throw common::BinderException{
+            common::stringFormat("When '{}' option is set to true in export "
+                                 "database, no other options are allowed.",
+                PortDBConstants::SCHEMA_ONLY_OPTION)};
+    }
+    parsedOptions.erase(PortDBConstants::SCHEMA_ONLY_OPTION);
+    return exportSchemaOnly;
+}
+
+std::unique_ptr<BoundStatement> Binder::bindExportDatabaseClause(const Statement& statement) {
+    auto& exportDB = statement.constCast<ExportDB>();
+    auto parsedOptions = bindParsingOptions(exportDB.getParsingOptionsRef());
+    auto fileTypeInfo = getFileType(parsedOptions);
+    switch (fileTypeInfo.fileType) {
+    case FileType::CSV:
+    case FileType::PARQUET:
+        break;
+    default:
+        throw BinderException("Export database currently only supports csv and parquet files.");
+    }
+    auto exportSchemaOnly = schemaOnly(parsedOptions, exportDB);
+    if (!exportSchemaOnly && fileTypeInfo.fileType != FileType::CSV && parsedOptions.size() != 0) {
+        throw BinderException{"Only export to csv can have options."};
+    }
+    auto exportData =
+        getExportInfo(*Catalog::Get(*clientContext), clientContext, this, fileTypeInfo);
+    auto boundFilePath = VirtualFileSystem::GetUnsafe(*clientContext)
+                             ->expandPath(clientContext, exportDB.getFilePath());
+    return std::make_unique<BoundExportDatabase>(boundFilePath, fileTypeInfo, std::move(exportData),
+        std::move(parsedOptions), exportSchemaOnly);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_extension.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_extension.cpp
new file mode 100644
index 0000000000..1ba10b366c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_extension.cpp
@@ -0,0 +1,79 @@
+#include "binder/binder.h"
+#include "binder/bound_extension_statement.h"
+#include "common/exception/binder.h"
+#include "common/file_system/local_file_system.h"
+#include "common/string_utils.h"
+#include "extension/extension.h"
+#include "parser/extension_statement.h"
+
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+static void bindInstallExtension(const ExtensionAuxInfo& auxInfo) {
+    if (!ExtensionUtils::isOfficialExtension(auxInfo.path)) {
+        throw common::BinderException(
+            common::stringFormat("{} is not an official extension.\nNon-official extensions "
+                                 "can be installed directly by: `LOAD EXTENSION [EXTENSION_PATH]`.",
+                auxInfo.path));
+    }
+}
+
+static void bindLoadExtension(main::ClientContext* context, const ExtensionAuxInfo& auxInfo) {
+    auto localFileSystem = common::LocalFileSystem("");
+    if (ExtensionUtils::isOfficialExtension(auxInfo.path)) {
+        auto extensionName = common::StringUtils::getLower(auxInfo.path);
+        if (!localFileSystem.fileOrPathExists(
+                ExtensionUtils::getLocalPathForExtensionLib(context, extensionName))) {
+            throw common::BinderException(
+                common::stringFormat("Extension: {} is an official extension and has not been "
+                                     "installed.\nYou can install it by: install {}.",
+                    extensionName, extensionName));
+        }
+        return;
+    }
+    if (!localFileSystem.fileOrPathExists(auxInfo.path, nullptr /* clientContext */)) {
+        throw common::BinderException(
+            common::stringFormat("The extension {} is neither an official extension, nor does "
+                                 "the extension path: '{}' exists.",
+                auxInfo.path, auxInfo.path));
+    }
+}
+
+static void bindUninstallExtension(const ExtensionAuxInfo& auxInfo) {
+    if (!ExtensionUtils::isOfficialExtension(auxInfo.path)) {
+        throw common::BinderException(
+            common::stringFormat("The extension {} is not an official extension.\nOnly official "
+                                 "extensions can be uninstalled.",
+                auxInfo.path));
+    }
+}
+
+std::unique_ptr<BoundStatement> Binder::bindExtension(const Statement& statement) {
+#ifdef __WASM__
+    throw common::BinderException{"Extensions are not available in the WASM environment"};
+#endif
+    auto extensionStatement = statement.constPtrCast<ExtensionStatement>();
+    auto auxInfo = extensionStatement->getAuxInfo();
+    switch (auxInfo->action) {
+    case ExtensionAction::INSTALL:
+        bindInstallExtension(*auxInfo);
+        break;
+    case ExtensionAction::LOAD:
+        bindLoadExtension(clientContext, *auxInfo);
+        break;
+    case ExtensionAction::UNINSTALL:
+        bindUninstallExtension(*auxInfo);
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+    if (ExtensionUtils::isOfficialExtension(auxInfo->path)) {
+        common::StringUtils::toLower(auxInfo->path);
+    }
+    return std::make_unique<BoundExtensionStatement>(std::move(auxInfo));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_extension_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_extension_clause.cpp
new file mode 100644
index 0000000000..af937fc206
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_extension_clause.cpp
@@ -0,0 +1,21 @@
+#include "binder/binder.h"
+#include "extension/binder_extension.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bindExtensionClause(const parser::Statement& statement) {
+    for (auto& binderExtension : binderExtensions) {
+        auto boundStatement = binderExtension->bind(statement);
+        if (boundStatement) {
+            return boundStatement;
+        }
+    }
+    KU_UNREACHABLE;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_file_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_file_scan.cpp
new file mode 100644
index 0000000000..1627f3ee92
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_file_scan.cpp
@@ -0,0 +1,312 @@
+#include "binder/binder.h"
+#include "binder/bound_scan_source.h"
+#include "binder/expression/literal_expression.h"
+#include "binder/expression/parameter_expression.h"
+#include "common/exception/binder.h"
+#include "common/exception/copy.h"
+#include "common/exception/message.h"
+#include "common/file_system/local_file_system.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+#include "extension/extension_manager.h"
+#include "function/table/bind_input.h"
+#include "main/client_context.h"
+#include "main/database_manager.h"
+#include "parser/expression/parsed_function_expression.h"
+#include "parser/scan_source.h"
+
+using namespace lbug::parser;
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::function;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+FileTypeInfo bindSingleFileType(const main::ClientContext* context, const std::string& filePath) {
+    std::filesystem::path fileName(filePath);
+    auto extension = VirtualFileSystem::GetUnsafe(*context)->getFileExtension(fileName);
+    return FileTypeInfo{FileTypeUtils::getFileTypeFromExtension(extension),
+        extension.substr(std::min<uint64_t>(1, extension.length()))};
+}
+
+FileTypeInfo Binder::bindFileTypeInfo(const std::vector<std::string>& filePaths) const {
+    auto expectedFileType = FileTypeInfo{FileType::UNKNOWN, "" /* fileTypeStr */};
+    for (auto& filePath : filePaths) {
+        auto fileType = bindSingleFileType(clientContext, filePath);
+        expectedFileType =
+            (expectedFileType.fileType == FileType::UNKNOWN) ? fileType : expectedFileType;
+        if (fileType.fileType != expectedFileType.fileType) {
+            throw CopyException("Loading files with different types is not currently supported.");
+        }
+    }
+    return expectedFileType;
+}
+
+std::vector<std::string> Binder::bindFilePaths(const std::vector<std::string>& filePaths) const {
+    std::vector<std::string> boundFilePaths;
+    for (auto& filePath : filePaths) {
+        // This is a temporary workaround because we use duckdb to read from iceberg/delta/azure.
+        // When we read delta/iceberg/azure tables from s3/httpfs, we don't have the httpfs
+        // extension loaded meaning that we cannot handle remote paths. So we pass the file path to
+        // duckdb for validation when we bindFileScanSource.
+        const auto& loadedExtensions =
+            extension::ExtensionManager::Get(*clientContext)->getLoadedExtensions();
+        const bool httpfsExtensionLoaded =
+            std::any_of(loadedExtensions.begin(), loadedExtensions.end(),
+                [](const auto& extension) { return extension.getExtensionName() == "HTTPFS"; });
+        if (!httpfsExtensionLoaded && !LocalFileSystem::isLocalPath(filePath)) {
+            boundFilePaths.push_back(filePath);
+            continue;
+        }
+        auto globbedFilePaths =
+            VirtualFileSystem::GetUnsafe(*clientContext)->glob(clientContext, filePath);
+        if (globbedFilePaths.empty()) {
+            throw BinderException{
+                stringFormat("No file found that matches the pattern: {}.", filePath)};
+        }
+        for (auto& globbedPath : globbedFilePaths) {
+            boundFilePaths.push_back(globbedPath);
+        }
+    }
+    return boundFilePaths;
+}
+
+case_insensitive_map_t<Value> Binder::bindParsingOptions(const options_t& parsingOptions) {
+    case_insensitive_map_t<Value> options;
+    for (auto& option : parsingOptions) {
+        auto name = option.first;
+        StringUtils::toUpper(name);
+        auto expr = expressionBinder.bindExpression(*option.second);
+        KU_ASSERT(expr->expressionType == ExpressionType::LITERAL);
+        auto literalExpr = ku_dynamic_cast<LiteralExpression*>(expr.get());
+        options.insert({name, literalExpr->getValue()});
+    }
+    return options;
+}
+
+std::unique_ptr<BoundBaseScanSource> Binder::bindScanSource(const BaseScanSource* source,
+    const options_t& options, const std::vector<std::string>& columnNames,
+    const std::vector<LogicalType>& columnTypes) {
+    switch (source->type) {
+    case ScanSourceType::FILE: {
+        return bindFileScanSource(*source, options, columnNames, columnTypes);
+    }
+    case ScanSourceType::QUERY: {
+        return bindQueryScanSource(*source, options, columnNames, columnTypes);
+    }
+    case ScanSourceType::OBJECT: {
+        return bindObjectScanSource(*source, options, columnNames, columnTypes);
+    }
+    case ScanSourceType::TABLE_FUNC: {
+        return bindTableFuncScanSource(*source, options, columnNames, columnTypes);
+    }
+    case ScanSourceType::PARAM: {
+        return bindParameterScanSource(*source, options, columnNames, columnTypes);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+bool handleFileViaFunction(main::ClientContext* context, std::vector<std::string> filePaths) {
+    bool handleFileViaFunction = false;
+    if (VirtualFileSystem::GetUnsafe(*context)->fileOrPathExists(filePaths[0], context)) {
+        handleFileViaFunction =
+            VirtualFileSystem::GetUnsafe(*context)->handleFileViaFunction(filePaths[0]);
+    }
+    return handleFileViaFunction;
+}
+
+std::unique_ptr<BoundBaseScanSource> Binder::bindFileScanSource(const BaseScanSource& scanSource,
+    const options_t& options, const std::vector<std::string>& columnNames,
+    const std::vector<LogicalType>& columnTypes) {
+    auto fileSource = scanSource.constPtrCast<FileScanSource>();
+    auto filePaths = bindFilePaths(fileSource->filePaths);
+    auto boundOptions = bindParsingOptions(options);
+    FileTypeInfo fileTypeInfo;
+
+    if (boundOptions.contains(FileScanInfo::FILE_FORMAT_OPTION_NAME)) {
+        auto fileFormat = boundOptions.at(FileScanInfo::FILE_FORMAT_OPTION_NAME).toString();
+        fileTypeInfo = FileTypeInfo{FileTypeUtils::fromString(fileFormat), fileFormat};
+    } else {
+        fileTypeInfo = bindFileTypeInfo(filePaths);
+    }
+    // If we defined a certain FileType, we have to ensure the path is a file, not something else
+    // (e.g. an existed directory)
+    if (fileTypeInfo.fileType != FileType::UNKNOWN) {
+        for (const auto& filePath : filePaths) {
+            if (!LocalFileSystem::fileExists(filePath) && LocalFileSystem::isLocalPath(filePath)) {
+                throw BinderException{stringFormat("Provided path is not a file: {}.", filePath)};
+            }
+        }
+    }
+    boundOptions.erase(FileScanInfo::FILE_FORMAT_OPTION_NAME);
+    // Bind file configuration
+    auto fileScanInfo = std::make_unique<FileScanInfo>(std::move(fileTypeInfo), filePaths);
+    fileScanInfo->options = std::move(boundOptions);
+    TableFunction func;
+    if (handleFileViaFunction(clientContext, filePaths)) {
+        func = VirtualFileSystem::GetUnsafe(*clientContext)->getHandleFunction(filePaths[0]);
+    } else {
+        func = getScanFunction(fileScanInfo->fileTypeInfo, *fileScanInfo);
+    }
+    // Bind table function
+    auto bindInput = TableFuncBindInput();
+    bindInput.addLiteralParam(Value::createValue(filePaths[0]));
+    auto extraInput = std::make_unique<ExtraScanTableFuncBindInput>();
+    extraInput->fileScanInfo = fileScanInfo->copy();
+    extraInput->expectedColumnNames = columnNames;
+    extraInput->expectedColumnTypes = LogicalType::copy(columnTypes);
+    extraInput->tableFunction = &func;
+    bindInput.extraInput = std::move(extraInput);
+    bindInput.binder = this;
+    auto bindData = func.bindFunc(clientContext, &bindInput);
+    auto info = BoundTableScanInfo(func, std::move(bindData));
+    return std::make_unique<BoundTableScanSource>(ScanSourceType::FILE, std::move(info));
+}
+
+std::unique_ptr<BoundBaseScanSource> Binder::bindQueryScanSource(const BaseScanSource& scanSource,
+    const options_t& options, const std::vector<std::string>& columnNames,
+    const std::vector<LogicalType>&) {
+    auto querySource = scanSource.constPtrCast<QueryScanSource>();
+    auto boundStatement = bind(*querySource->statement);
+    auto columns = boundStatement->getStatementResult()->getColumns();
+    if (columns.size() != columnNames.size()) {
+        throw BinderException(stringFormat("Query returns {} columns but {} columns were expected.",
+            columns.size(), columnNames.size()));
+    }
+    for (auto i = 0u; i < columns.size(); ++i) {
+        columns[i]->setAlias(columnNames[i]);
+    }
+    auto scanInfo = BoundQueryScanSourceInfo(bindParsingOptions(options));
+    return std::make_unique<BoundQueryScanSource>(std::move(boundStatement), std::move(scanInfo));
+}
+
+static TableFunction getObjectScanFunc(const std::string& dbName, const std::string& tableName,
+    main::ClientContext* clientContext) {
+    // Bind external database table
+    auto attachedDB = main::DatabaseManager::Get(*clientContext)->getAttachedDatabase(dbName);
+    auto attachedCatalog = attachedDB->getCatalog();
+    auto entry = attachedCatalog->getTableCatalogEntry(
+        transaction::Transaction::Get(*clientContext), tableName);
+    return entry->ptrCast<TableCatalogEntry>()->getScanFunction();
+}
+
+BoundTableScanInfo bindTableScanSourceInfo(Binder& binder, TableFunction func,
+    const std::string& sourceName, std::unique_ptr<TableFuncBindData> bindData,
+    const std::vector<std::string>& columnNames, const std::vector<LogicalType>& columnTypes) {
+    expression_vector columns;
+    if (columnTypes.empty()) {
+    } else {
+        if (bindData->getNumColumns() != columnTypes.size()) {
+            throw BinderException(stringFormat("{} has {} columns but {} columns were expected.",
+                sourceName, bindData->getNumColumns(), columnTypes.size()));
+        }
+        for (auto i = 0u; i < bindData->getNumColumns(); ++i) {
+            auto column =
+                binder.createInvisibleVariable(columnNames[i], bindData->columns[i]->getDataType());
+            binder.replaceExpressionInScope(bindData->columns[i]->toString(), columnNames[i],
+                column);
+            columns.push_back(column);
+        }
+        bindData->columns = columns;
+    }
+    return BoundTableScanInfo(func, std::move(bindData));
+}
+
+std::unique_ptr<BoundBaseScanSource> Binder::bindParameterScanSource(
+    const BaseScanSource& scanSource, const options_t& options,
+    const std::vector<std::string>& columnNames, const std::vector<LogicalType>& columnTypes) {
+    auto paramSource = scanSource.constPtrCast<ParameterScanSource>();
+    auto paramExpr = expressionBinder.bindParameterExpression(*paramSource->paramExpression);
+    auto scanSourceValue = paramExpr->constCast<ParameterExpression>().getValue();
+    if (scanSourceValue.getDataType().getLogicalTypeID() != LogicalTypeID::POINTER) {
+        throw BinderException(stringFormat(
+            "Trying to scan from unsupported data type {}. The only parameter types that can be "
+            "scanned from are pandas/polars dataframes and pyarrow tables.",
+            scanSourceValue.getDataType().toString()));
+    }
+    TableFunction func;
+    std::unique_ptr<TableFuncBindData> bindData;
+    auto bindInput = TableFuncBindInput();
+    bindInput.binder = this;
+    // Bind external object as table
+    auto replacementData =
+        clientContext->tryReplaceByHandle(scanSourceValue.getValue<scan_replace_handle_t>());
+    func = replacementData->func;
+    auto replaceExtraInput = std::make_unique<ExtraScanTableFuncBindInput>();
+    replaceExtraInput->fileScanInfo.options = bindParsingOptions(options);
+    replacementData->bindInput.extraInput = std::move(replaceExtraInput);
+    replacementData->bindInput.binder = this;
+    bindData = func.bindFunc(clientContext, &replacementData->bindInput);
+    auto info = bindTableScanSourceInfo(*this, func, paramExpr->toString(), std::move(bindData),
+        columnNames, columnTypes);
+    return std::make_unique<BoundTableScanSource>(ScanSourceType::OBJECT, std::move(info));
+}
+
+std::unique_ptr<BoundBaseScanSource> Binder::bindObjectScanSource(const BaseScanSource& scanSource,
+    const options_t& options, const std::vector<std::string>& columnNames,
+    const std::vector<LogicalType>& columnTypes) {
+    auto objectSource = scanSource.constPtrCast<ObjectScanSource>();
+    TableFunction func;
+    std::unique_ptr<TableFuncBindData> bindData;
+    std::string objectName;
+    auto bindInput = TableFuncBindInput();
+    bindInput.binder = this;
+    if (objectSource->objectNames.size() == 1) {
+        // Bind external object as table
+        objectName = objectSource->objectNames[0];
+        auto replacementData = clientContext->tryReplaceByName(objectName);
+        if (replacementData != nullptr) { // Replace as python object
+            func = replacementData->func;
+            auto replaceExtraInput = std::make_unique<ExtraScanTableFuncBindInput>();
+            replaceExtraInput->fileScanInfo.options = bindParsingOptions(options);
+            replacementData->bindInput.extraInput = std::move(replaceExtraInput);
+            replacementData->bindInput.binder = this;
+            bindData = func.bindFunc(clientContext, &replacementData->bindInput);
+        } else if (main::DatabaseManager::Get(*clientContext)->hasDefaultDatabase()) {
+            auto dbName = main::DatabaseManager::Get(*clientContext)->getDefaultDatabase();
+            func = getObjectScanFunc(dbName, objectSource->objectNames[0], clientContext);
+            bindData = func.bindFunc(clientContext, &bindInput);
+        } else {
+            throw BinderException(ExceptionMessage::variableNotInScope(objectName));
+        }
+    } else if (objectSource->objectNames.size() == 2) {
+        // Bind external database table
+        objectName = objectSource->objectNames[0] + "." + objectSource->objectNames[1];
+        func = getObjectScanFunc(objectSource->objectNames[0], objectSource->objectNames[1],
+            clientContext);
+        bindData = func.bindFunc(clientContext, &bindInput);
+    } else {
+        // LCOV_EXCL_START
+        throw BinderException(stringFormat("Cannot find object {}.",
+            StringUtils::join(objectSource->objectNames, ",")));
+        // LCOV_EXCL_STOP
+    }
+    auto info = bindTableScanSourceInfo(*this, func, objectName, std::move(bindData), columnNames,
+        columnTypes);
+    return std::make_unique<BoundTableScanSource>(ScanSourceType::OBJECT, std::move(info));
+}
+
+std::unique_ptr<BoundBaseScanSource> Binder::bindTableFuncScanSource(
+    const BaseScanSource& scanSource, const options_t& options,
+    const std::vector<std::string>& columnNames, const std::vector<LogicalType>& columnTypes) {
+    if (!options.empty()) {
+        throw common::BinderException{"No option is supported when copying from table functions."};
+    }
+    auto tableFuncScanSource = scanSource.constPtrCast<TableFuncScanSource>();
+    auto& parsedFuncExpression =
+        tableFuncScanSource->functionExpression->constCast<parser::ParsedFunctionExpression>();
+    auto boundTableFunc = bindTableFunc(parsedFuncExpression.getFunctionName(),
+        *tableFuncScanSource->functionExpression, {} /* yieldVariables */);
+    auto& tableFunc = boundTableFunc.func;
+    auto info = bindTableScanSourceInfo(*this, tableFunc, tableFunc.name,
+        std::move(boundTableFunc.bindData), columnNames, columnTypes);
+    return std::make_unique<BoundTableScanSource>(ScanSourceType::OBJECT, std::move(info));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_graph_pattern.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_graph_pattern.cpp
new file mode 100644
index 0000000000..1ad1af5ee8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_graph_pattern.cpp
@@ -0,0 +1,695 @@
+#include "binder/binder.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression/path_expression.h"
+#include "binder/expression/property_expression.h"
+#include "binder/expression_visitor.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/enums/rel_direction.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "common/utils.h"
+#include "function/cast/functions/cast_from_string_functions.h"
+#include "function/gds/rec_joins.h"
+#include "function/rewrite_function.h"
+#include "function/schema/vector_node_rel_functions.h"
+#include "main/client_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+// A graph pattern contains node/rel and a set of key-value pairs associated with the variable. We
+// bind node/rel as query graph and key-value pairs as a separate collection. This collection is
+// interpreted in two different ways.
+//    - In MATCH clause, these are additional predicates to WHERE clause
+//    - In UPDATE clause, there are properties to set.
+// We do not store key-value pairs in query graph primarily because we will merge key-value
+// std::pairs with other predicates specified in WHERE clause.
+BoundGraphPattern Binder::bindGraphPattern(const std::vector<PatternElement>& graphPattern) {
+    auto queryGraphCollection = QueryGraphCollection();
+    for (auto& patternElement : graphPattern) {
+        queryGraphCollection.addAndMergeQueryGraphIfConnected(bindPatternElement(patternElement));
+    }
+    queryGraphCollection.finalize();
+    auto boundPattern = BoundGraphPattern();
+    boundPattern.queryGraphCollection = std::move(queryGraphCollection);
+    return boundPattern;
+}
+
+// Grammar ensures pattern element is always connected and thus can be bound as a query graph.
+QueryGraph Binder::bindPatternElement(const PatternElement& patternElement) {
+    auto queryGraph = QueryGraph();
+    expression_vector nodeAndRels;
+    auto leftNode = bindQueryNode(*patternElement.getFirstNodePattern(), queryGraph);
+    nodeAndRels.push_back(leftNode);
+    for (auto i = 0u; i < patternElement.getNumPatternElementChains(); ++i) {
+        auto patternElementChain = patternElement.getPatternElementChain(i);
+        auto rightNode = bindQueryNode(*patternElementChain->getNodePattern(), queryGraph);
+        auto rel =
+            bindQueryRel(*patternElementChain->getRelPattern(), leftNode, rightNode, queryGraph);
+        nodeAndRels.push_back(rel);
+        nodeAndRels.push_back(rightNode);
+        leftNode = rightNode;
+    }
+    if (patternElement.hasPathName()) {
+        auto pathName = patternElement.getPathName();
+        auto pathExpression = createPath(pathName, nodeAndRels);
+        addToScope(pathName, pathExpression);
+    }
+    return queryGraph;
+}
+
+static LogicalType getRecursiveRelLogicalType(const LogicalType& nodeType,
+    const LogicalType& relType) {
+    auto nodesType = LogicalType::LIST(nodeType.copy());
+    auto relsType = LogicalType::LIST(relType.copy());
+    std::vector<StructField> recursiveRelFields;
+    recursiveRelFields.emplace_back(InternalKeyword::NODES, std::move(nodesType));
+    recursiveRelFields.emplace_back(InternalKeyword::RELS, std::move(relsType));
+    return LogicalType::RECURSIVE_REL(std::move(recursiveRelFields));
+}
+
+static void extraFieldFromStructType(const LogicalType& structType,
+    std::unordered_set<std::string>& set, std::vector<StructField>& structFields) {
+    for (auto& field : StructType::getFields(structType)) {
+        if (!set.contains(field.getName())) {
+            set.insert(field.getName());
+            structFields.emplace_back(field.getName(), field.getType().copy());
+        }
+    }
+}
+
+std::shared_ptr<Expression> Binder::createPath(const std::string& pathName,
+    const expression_vector& children) {
+    std::unordered_set<std::string> nodeFieldNameSet;
+    std::vector<StructField> nodeFields;
+    std::unordered_set<std::string> relFieldNameSet;
+    std::vector<StructField> relFields;
+    for (auto& child : children) {
+        if (ExpressionUtil::isNodePattern(*child)) {
+            auto& node = child->constCast<NodeExpression>();
+            extraFieldFromStructType(node.getDataType(), nodeFieldNameSet, nodeFields);
+        } else if (ExpressionUtil::isRelPattern(*child)) {
+            auto rel = ku_dynamic_cast<RelExpression*>(child.get());
+            extraFieldFromStructType(rel->getDataType(), relFieldNameSet, relFields);
+        } else if (ExpressionUtil::isRecursiveRelPattern(*child)) {
+            auto recursiveRel = ku_dynamic_cast<RelExpression*>(child.get());
+            auto recursiveInfo = recursiveRel->getRecursiveInfo();
+            extraFieldFromStructType(recursiveInfo->node->getDataType(), nodeFieldNameSet,
+                nodeFields);
+            extraFieldFromStructType(recursiveInfo->rel->getDataType(), relFieldNameSet, relFields);
+        } else {
+            KU_UNREACHABLE;
+        }
+    }
+    auto nodeType = LogicalType::NODE(std::move(nodeFields));
+    auto relType = LogicalType::REL(std::move(relFields));
+    auto uniqueName = getUniqueExpressionName(pathName);
+    return std::make_shared<PathExpression>(getRecursiveRelLogicalType(nodeType, relType),
+        uniqueName, pathName, std::move(nodeType), std::move(relType), children);
+}
+
+static std::vector<std::string> getPropertyNames(const std::vector<TableCatalogEntry*>& entries) {
+    std::vector<std::string> result;
+    std::unordered_set<std::string> propertyNamesSet;
+    for (auto& entry : entries) {
+        for (auto& property : entry->getProperties()) {
+            if (propertyNamesSet.contains(property.getName())) {
+                continue;
+            }
+            propertyNamesSet.insert(property.getName());
+            result.push_back(property.getName());
+        }
+    }
+    return result;
+}
+
+static std::shared_ptr<PropertyExpression> createPropertyExpression(const std::string& propertyName,
+    const std::string& uniqueVariableName, const std::string& rawVariableName,
+    const std::vector<TableCatalogEntry*>& entries) {
+    table_id_map_t<SingleLabelPropertyInfo> infos;
+    std::vector<LogicalType> dataTypes;
+    for (auto& entry : entries) {
+        bool exists = false;
+        if (entry->containsProperty(propertyName)) {
+            exists = true;
+            dataTypes.push_back(entry->getProperty(propertyName).getType().copy());
+        }
+        // Bind isPrimaryKey
+        auto isPrimaryKey = false;
+        if (entry->getTableType() == TableType::NODE) {
+            auto nodeEntry = entry->constPtrCast<NodeTableCatalogEntry>();
+            isPrimaryKey = nodeEntry->getPrimaryKeyName() == propertyName;
+        }
+        auto info = SingleLabelPropertyInfo(exists, isPrimaryKey);
+        infos.insert({entry->getTableID(), std::move(info)});
+    }
+    LogicalType maxType = LogicalTypeUtils::combineTypes(dataTypes);
+    return std::make_shared<PropertyExpression>(std::move(maxType), propertyName,
+        uniqueVariableName, rawVariableName, std::move(infos));
+}
+
+static void checkRelDirectionTypeAgainstStorageDirection(const RelExpression* rel) {
+    switch (rel->getDirectionType()) {
+    case RelDirectionType::SINGLE:
+        // Directed pattern is in the fwd direction
+        if (!containsValue(rel->getExtendDirections(), ExtendDirection::FWD)) {
+            throw BinderException(stringFormat("Querying table matched in rel pattern '{}' with "
+                                               "bwd-only storage direction isn't supported.",
+                rel->toString()));
+        }
+        break;
+    case RelDirectionType::BOTH:
+        if (rel->getExtendDirections().size() < NUM_REL_DIRECTIONS) {
+            throw BinderException(
+                stringFormat("Undirected rel pattern '{}' has at least one matched rel table with "
+                             "storage type 'fwd' or 'bwd'. Undirected rel patterns are only "
+                             "supported if every matched rel table has storage type 'both'.",
+                    rel->toString()));
+        }
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::shared_ptr<RelExpression> Binder::bindQueryRel(const RelPattern& relPattern,
+    const std::shared_ptr<NodeExpression>& leftNode,
+    const std::shared_ptr<NodeExpression>& rightNode, QueryGraph& queryGraph) {
+    auto parsedName = relPattern.getVariableName();
+    if (scope.contains(parsedName)) {
+        auto prevVariable = scope.getExpression(parsedName);
+        auto expectedDataType = QueryRelTypeUtils::isRecursive(relPattern.getRelType()) ?
+                                    LogicalTypeID::RECURSIVE_REL :
+                                    LogicalTypeID::REL;
+        ExpressionUtil::validateDataType(*prevVariable, expectedDataType);
+        throw BinderException("Bind relationship " + parsedName +
+                              " to relationship with same name is not supported.");
+    }
+    auto entries = bindRelGroupEntries(relPattern.getTableNames());
+    // bind src & dst node
+    RelDirectionType directionType = RelDirectionType::UNKNOWN;
+    std::shared_ptr<NodeExpression> srcNode;
+    std::shared_ptr<NodeExpression> dstNode;
+    switch (relPattern.getDirection()) {
+    case ArrowDirection::LEFT: {
+        srcNode = rightNode;
+        dstNode = leftNode;
+        directionType = RelDirectionType::SINGLE;
+    } break;
+    case ArrowDirection::RIGHT: {
+        srcNode = leftNode;
+        dstNode = rightNode;
+        directionType = RelDirectionType::SINGLE;
+    } break;
+    case ArrowDirection::BOTH: {
+        // For both direction, left and right will be written with the same label set. So either one
+        // being src will be correct.
+        srcNode = leftNode;
+        dstNode = rightNode;
+        directionType = RelDirectionType::BOTH;
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    // bind variable length
+    std::shared_ptr<RelExpression> queryRel;
+    if (QueryRelTypeUtils::isRecursive(relPattern.getRelType())) {
+        queryRel = createRecursiveQueryRel(relPattern, entries, srcNode, dstNode, directionType);
+    } else {
+        queryRel = createNonRecursiveQueryRel(relPattern.getVariableName(), entries, srcNode,
+            dstNode, directionType);
+        for (auto& [propertyName, rhs] : relPattern.getPropertyKeyVals()) {
+            auto boundLhs =
+                expressionBinder.bindNodeOrRelPropertyExpression(*queryRel, propertyName);
+            auto boundRhs = expressionBinder.bindExpression(*rhs);
+            boundRhs = expressionBinder.implicitCastIfNecessary(boundRhs, boundLhs->dataType);
+            queryRel->addPropertyDataExpr(propertyName, std::move(boundRhs));
+        }
+    }
+    queryRel->setLeftNode(leftNode);
+    queryRel->setRightNode(rightNode);
+    queryRel->setAlias(parsedName);
+    if (!parsedName.empty()) {
+        addToScope(parsedName, queryRel);
+    }
+    queryGraph.addQueryRel(queryRel);
+    checkRelDirectionTypeAgainstStorageDirection(queryRel.get());
+    return queryRel;
+}
+
+static std::vector<StructField> getBaseNodeStructFields() {
+    std::vector<StructField> fields;
+    fields.emplace_back(InternalKeyword::ID, LogicalType::INTERNAL_ID());
+    fields.emplace_back(InternalKeyword::LABEL, LogicalType::STRING());
+    return fields;
+}
+
+static std::vector<StructField> getBaseRelStructFields() {
+    std::vector<StructField> fields;
+    fields.emplace_back(InternalKeyword::SRC, LogicalType::INTERNAL_ID());
+    fields.emplace_back(InternalKeyword::DST, LogicalType::INTERNAL_ID());
+    fields.emplace_back(InternalKeyword::LABEL, LogicalType::STRING());
+    return fields;
+}
+
+static std::shared_ptr<PropertyExpression> construct(LogicalType type,
+    const std::string& propertyName, const Expression& child) {
+    KU_ASSERT(child.expressionType == ExpressionType::PATTERN);
+    auto& patternExpr = child.constCast<NodeOrRelExpression>();
+    auto variableName = patternExpr.getVariableName();
+    auto uniqueName = patternExpr.getUniqueName();
+    // Assign an invalid property id for virtual property.
+    table_id_map_t<SingleLabelPropertyInfo> infos;
+    for (auto& entry : patternExpr.getEntries()) {
+        infos.insert({entry->getTableID(),
+            SingleLabelPropertyInfo(false /* exists */, false /* isPrimaryKey */)});
+    }
+    return std::make_unique<PropertyExpression>(std::move(type), propertyName, uniqueName,
+        variableName, std::move(infos));
+}
+
+std::shared_ptr<RelExpression> Binder::createNonRecursiveQueryRel(const std::string& parsedName,
+    const std::vector<TableCatalogEntry*>& entries, std::shared_ptr<NodeExpression> srcNode,
+    std::shared_ptr<NodeExpression> dstNode, RelDirectionType directionType) {
+    auto uniqueName = getUniqueExpressionName(parsedName);
+    // Bind properties
+    auto structFields = getBaseRelStructFields();
+    std::vector<std::shared_ptr<PropertyExpression>> propertyExpressions;
+    if (entries.empty()) {
+        structFields.emplace_back(InternalKeyword::ID, LogicalType::INTERNAL_ID());
+    } else {
+        for (auto& propertyName : getPropertyNames(entries)) {
+            auto property = createPropertyExpression(propertyName, uniqueName, parsedName, entries);
+            structFields.emplace_back(property->getPropertyName(), property->getDataType().copy());
+            propertyExpressions.push_back(std::move(property));
+        }
+    }
+    auto queryRel = std::make_shared<RelExpression>(LogicalType::REL(std::move(structFields)),
+        uniqueName, parsedName, entries, std::move(srcNode), std::move(dstNode), directionType,
+        QueryRelType::NON_RECURSIVE);
+    queryRel->setAlias(parsedName);
+    if (entries.empty()) {
+        queryRel->addPropertyExpression(
+            construct(LogicalType::INTERNAL_ID(), InternalKeyword::ID, *queryRel));
+    } else {
+        for (auto& property : propertyExpressions) {
+            queryRel->addPropertyExpression(property);
+        }
+    }
+    // Bind internal expressions.
+    if (directionType == RelDirectionType::BOTH) {
+        queryRel->setDirectionExpr(expressionBinder.createVariableExpression(LogicalType::BOOL(),
+            queryRel->getUniqueName() + InternalKeyword::DIRECTION));
+    }
+    auto input = function::RewriteFunctionBindInput(clientContext, &expressionBinder, {queryRel});
+    queryRel->setLabelExpression(function::LabelFunction::rewriteFunc(input));
+    return queryRel;
+}
+
+static void bindProjectionListAsStructField(const expression_vector& projectionList,
+    std::vector<StructField>& fields) {
+    for (auto& expression : projectionList) {
+        if (expression->expressionType != ExpressionType::PROPERTY) {
+            throw BinderException(stringFormat("Unsupported projection item {} on recursive rel.",
+                expression->toString()));
+        }
+        auto& property = expression->constCast<PropertyExpression>();
+        fields.emplace_back(property.getPropertyName(), property.getDataType().copy());
+    }
+}
+
+static void checkWeightedShortestPathSupportedType(const LogicalType& type) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::INT8:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::FLOAT:
+        return;
+    default:
+        break;
+    }
+    throw BinderException(stringFormat(
+        "{} weight type is not supported for weighted shortest path.", type.toString()));
+}
+
+std::shared_ptr<RelExpression> Binder::createRecursiveQueryRel(const parser::RelPattern& relPattern,
+    const std::vector<TableCatalogEntry*>& entries, std::shared_ptr<NodeExpression> srcNode,
+    std::shared_ptr<NodeExpression> dstNode, RelDirectionType directionType) {
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    table_catalog_entry_set_t nodeEntrySet;
+    for (auto entry : entries) {
+        auto& relGroupEntry = entry->constCast<RelGroupCatalogEntry>();
+        for (auto id : relGroupEntry.getSrcNodeTableIDSet()) {
+            nodeEntrySet.insert(catalog->getTableCatalogEntry(transaction, id));
+        }
+        for (auto id : relGroupEntry.getDstNodeTableIDSet()) {
+            nodeEntrySet.insert(catalog->getTableCatalogEntry(transaction, id));
+        }
+    }
+    auto nodeEntries = std::vector<TableCatalogEntry*>{nodeEntrySet.begin(), nodeEntrySet.end()};
+    auto recursivePatternInfo = relPattern.getRecursiveInfo();
+    auto prevScope = saveScope();
+    scope.clear();
+    // Bind intermediate node.
+    auto node = createQueryNode(recursivePatternInfo->nodeName, nodeEntries);
+    addToScope(node->toString(), node);
+    auto nodeFields = getBaseNodeStructFields();
+    auto nodeProjectionList = bindRecursivePatternNodeProjectionList(*recursivePatternInfo, *node);
+    bindProjectionListAsStructField(nodeProjectionList, nodeFields);
+    node->setDataType(LogicalType::NODE(std::move(nodeFields)));
+    auto nodeCopy = createQueryNode(recursivePatternInfo->nodeName, nodeEntries);
+    // Bind intermediate rel
+    auto rel = createNonRecursiveQueryRel(recursivePatternInfo->relName, entries,
+        nullptr /* srcNode */, nullptr /* dstNode */, directionType);
+    addToScope(rel->toString(), rel);
+    auto relProjectionList = bindRecursivePatternRelProjectionList(*recursivePatternInfo, *rel);
+    auto relFields = getBaseRelStructFields();
+    relFields.emplace_back(InternalKeyword::ID, LogicalType::INTERNAL_ID());
+    bindProjectionListAsStructField(relProjectionList, relFields);
+    rel->setDataType(LogicalType::REL(std::move(relFields)));
+    // Bind predicates in {}, e.g. [e* {date=1999-01-01}]
+    std::shared_ptr<Expression> relPredicate = nullptr;
+    for (auto& [propertyName, rhs] : relPattern.getPropertyKeyVals()) {
+        auto boundLhs = expressionBinder.bindNodeOrRelPropertyExpression(*rel, propertyName);
+        auto boundRhs = expressionBinder.bindExpression(*rhs);
+        boundRhs = expressionBinder.implicitCastIfNecessary(boundRhs, boundLhs->dataType);
+        auto predicate = expressionBinder.createEqualityComparisonExpression(boundLhs, boundRhs);
+        relPredicate = expressionBinder.combineBooleanExpressions(ExpressionType::AND, relPredicate,
+            predicate);
+    }
+    // Bind predicates in (r, n | WHERE )
+    bool emptyRecursivePattern = false;
+    std::shared_ptr<Expression> nodePredicate = nullptr;
+    if (recursivePatternInfo->whereExpression != nullptr) {
+        expressionBinder.config.disableLabelFunctionLiteralRewrite = true;
+        auto wherePredicate = bindWhereExpression(*recursivePatternInfo->whereExpression);
+        expressionBinder.config.disableLabelFunctionLiteralRewrite = false;
+        for (auto& predicate : wherePredicate->splitOnAND()) {
+            auto collector = DependentVarNameCollector();
+            collector.visit(predicate);
+            auto dependentVariableNames = collector.getVarNames();
+            auto dependOnNode = dependentVariableNames.contains(node->getUniqueName());
+            auto dependOnRel = dependentVariableNames.contains(rel->getUniqueName());
+            if (dependOnNode && dependOnRel) {
+                throw BinderException(
+                    stringFormat("Cannot evaluate {} because it depends on both {} and {}.",
+                        predicate->toString(), node->toString(), rel->toString()));
+            } else if (dependOnNode) {
+                nodePredicate = expressionBinder.combineBooleanExpressions(ExpressionType::AND,
+                    nodePredicate, predicate);
+            } else if (dependOnRel) {
+                relPredicate = expressionBinder.combineBooleanExpressions(ExpressionType::AND,
+                    relPredicate, predicate);
+            } else {
+                if (!ExpressionUtil::isBoolLiteral(*predicate)) {
+                    throw BinderException(stringFormat(
+                        "Cannot evaluate {} because it does not depend on {} or {}. Treating it as "
+                        "a node or relationship predicate is ambiguous.",
+                        predicate->toString(), node->toString(), rel->toString()));
+                }
+                // If predicate is true literal, we ignore.
+                // If predicate is false literal, we mark this recursive relationship as empty
+                // and later in planner we replace it with EmptyResult.
+                if (!ExpressionUtil::getLiteralValue<bool>(*predicate)) {
+                    emptyRecursivePattern = true;
+                }
+            }
+        }
+    }
+    // Bind rel
+    restoreScope(std::move(prevScope));
+    auto parsedName = relPattern.getVariableName();
+    auto prunedRelEntries = entries;
+    if (emptyRecursivePattern) {
+        prunedRelEntries.clear();
+    }
+    auto queryRel = std::make_shared<RelExpression>(
+        getRecursiveRelLogicalType(node->getDataType(), rel->getDataType()),
+        getUniqueExpressionName(parsedName), parsedName, prunedRelEntries, std::move(srcNode),
+        std::move(dstNode), directionType, relPattern.getRelType());
+    // Bind graph entry.
+    auto graphEntry = graph::NativeGraphEntry();
+    for (auto nodeEntry : node->getEntries()) {
+        graphEntry.nodeInfos.emplace_back(nodeEntry);
+    }
+    for (auto relEntry : rel->getEntries()) {
+        graphEntry.relInfos.emplace_back(relEntry, rel, relPredicate);
+    }
+    auto bindData = std::make_unique<function::RJBindData>(graphEntry.copy());
+    // Bind lower upper bound.
+    auto [lowerBound, upperBound] = bindVariableLengthRelBound(relPattern);
+    bindData->lowerBound = lowerBound;
+    bindData->upperBound = upperBound;
+    // Bind semantic.
+    bindData->semantic = QueryRelTypeUtils::getPathSemantic(queryRel->getRelType());
+    // Bind path related expressions.
+    bindData->lengthExpr = construct(LogicalType::INT64(), InternalKeyword::LENGTH, *queryRel);
+    bindData->pathNodeIDsExpr =
+        createInvisibleVariable("pathNodeIDs", LogicalType::LIST(LogicalType::INTERNAL_ID()));
+    bindData->pathEdgeIDsExpr =
+        createInvisibleVariable("pathEdgeIDs", LogicalType::LIST(LogicalType::INTERNAL_ID()));
+    if (queryRel->getDirectionType() == RelDirectionType::BOTH) {
+        bindData->directionExpr =
+            createInvisibleVariable("pathEdgeDirections", LogicalType::LIST(LogicalType::BOOL()));
+    }
+    // Bind weighted path related expressions.
+    if (QueryRelTypeUtils::isWeighted(queryRel->getRelType())) {
+        auto propertyExpr = expressionBinder.bindNodeOrRelPropertyExpression(*rel,
+            recursivePatternInfo->weightPropertyName);
+        checkWeightedShortestPathSupportedType(propertyExpr->getDataType());
+        bindData->weightPropertyExpr = propertyExpr;
+        bindData->weightOutputExpr =
+            createInvisibleVariable(parsedName + "_cost", LogicalType::DOUBLE());
+    }
+
+    auto recursiveInfo = std::make_unique<RecursiveInfo>();
+    recursiveInfo->node = node;
+    recursiveInfo->nodeCopy = nodeCopy;
+    recursiveInfo->rel = rel;
+    recursiveInfo->nodePredicate = std::move(nodePredicate);
+    recursiveInfo->relPredicate = std::move(relPredicate);
+    recursiveInfo->nodeProjectionList = std::move(nodeProjectionList);
+    recursiveInfo->relProjectionList = std::move(relProjectionList);
+    recursiveInfo->function = QueryRelTypeUtils::getFunction(queryRel->getRelType());
+    recursiveInfo->bindData = std::move(bindData);
+    queryRel->setRecursiveInfo(std::move(recursiveInfo));
+    return queryRel;
+}
+
+expression_vector Binder::bindRecursivePatternNodeProjectionList(
+    const RecursiveRelPatternInfo& info, const NodeOrRelExpression& expr) {
+    expression_vector result;
+    if (!info.hasProjection) {
+        for (auto& expression : expr.getPropertyExpressions()) {
+            result.push_back(expression);
+        }
+    } else {
+        for (auto& expression : info.nodeProjectionList) {
+            result.push_back(expressionBinder.bindExpression(*expression));
+        }
+    }
+    return result;
+}
+
+expression_vector Binder::bindRecursivePatternRelProjectionList(const RecursiveRelPatternInfo& info,
+    const NodeOrRelExpression& expr) {
+    expression_vector result;
+    if (!info.hasProjection) {
+        for (auto& property : expr.getPropertyExpressions()) {
+            if (property->isInternalID()) {
+                continue;
+            }
+            result.push_back(property);
+        }
+    } else {
+        for (auto& expression : info.relProjectionList) {
+            result.push_back(expressionBinder.bindExpression(*expression));
+        }
+    }
+    return result;
+}
+
+std::pair<uint64_t, uint64_t> Binder::bindVariableLengthRelBound(const RelPattern& relPattern) {
+    auto recursiveInfo = relPattern.getRecursiveInfo();
+    uint32_t lowerBound = 0;
+    function::CastString::operation(
+        ku_string_t{recursiveInfo->lowerBound.c_str(), recursiveInfo->lowerBound.length()},
+        lowerBound);
+    auto maxDepth = clientContext->getClientConfig()->varLengthMaxDepth;
+    auto upperBound = maxDepth;
+    if (!recursiveInfo->upperBound.empty()) {
+        function::CastString::operation(
+            ku_string_t{recursiveInfo->upperBound.c_str(), recursiveInfo->upperBound.length()},
+            upperBound);
+    }
+    if (lowerBound > upperBound) {
+        throw BinderException(stringFormat("Lower bound of rel {} is greater than upperBound.",
+            relPattern.getVariableName()));
+    }
+    if (upperBound > maxDepth) {
+        throw BinderException(stringFormat("Upper bound of rel {} exceeds maximum: {}.",
+            relPattern.getVariableName(), std::to_string(maxDepth)));
+    }
+    if ((relPattern.getRelType() == QueryRelType::ALL_SHORTEST ||
+            relPattern.getRelType() == QueryRelType::SHORTEST) &&
+        lowerBound != 1) {
+        throw BinderException("Lower bound of shortest/all_shortest path must be 1.");
+    }
+    return std::make_pair(lowerBound, upperBound);
+}
+
+std::shared_ptr<NodeExpression> Binder::bindQueryNode(const NodePattern& nodePattern,
+    QueryGraph& queryGraph) {
+    auto parsedName = nodePattern.getVariableName();
+    std::shared_ptr<NodeExpression> queryNode;
+    if (scope.contains(parsedName)) { // bind to node in scope
+        auto prevVariable = scope.getExpression(parsedName);
+        if (!ExpressionUtil::isNodePattern(*prevVariable)) {
+            if (!scope.hasNodeReplacement(parsedName)) {
+                throw BinderException(stringFormat("Cannot bind {} as node pattern.", parsedName));
+            }
+            queryNode = scope.getNodeReplacement(parsedName);
+            queryNode->addPropertyDataExpr(InternalKeyword::ID, queryNode->getInternalID());
+        } else {
+            queryNode = std::static_pointer_cast<NodeExpression>(prevVariable);
+            // E.g. MATCH (a:person) MATCH (a:organisation)
+            // We bind to a single node with both labels
+            if (!nodePattern.getTableNames().empty()) {
+                auto otherNodeEntries = bindNodeTableEntries(nodePattern.getTableNames());
+                queryNode->addEntries(otherNodeEntries);
+            }
+        }
+    } else {
+        queryNode = createQueryNode(nodePattern);
+        if (!parsedName.empty()) {
+            addToScope(parsedName, queryNode);
+        }
+    }
+    for (auto& [propertyName, rhs] : nodePattern.getPropertyKeyVals()) {
+        auto boundLhs = expressionBinder.bindNodeOrRelPropertyExpression(*queryNode, propertyName);
+        auto boundRhs = expressionBinder.bindExpression(*rhs);
+        boundRhs = expressionBinder.forceCast(boundRhs, boundLhs->dataType);
+        queryNode->addPropertyDataExpr(propertyName, std::move(boundRhs));
+    }
+    queryGraph.addQueryNode(queryNode);
+    return queryNode;
+}
+
+std::shared_ptr<NodeExpression> Binder::createQueryNode(const NodePattern& nodePattern) {
+    auto parsedName = nodePattern.getVariableName();
+    return createQueryNode(parsedName, bindNodeTableEntries(nodePattern.getTableNames()));
+}
+
+std::shared_ptr<NodeExpression> Binder::createQueryNode(const std::string& parsedName,
+    const std::vector<TableCatalogEntry*>& entries) {
+    auto uniqueName = getUniqueExpressionName(parsedName);
+    // Bind properties.
+    auto structFields = getBaseNodeStructFields();
+    std::vector<std::shared_ptr<PropertyExpression>> propertyExpressions;
+    for (auto& propertyName : getPropertyNames(entries)) {
+        auto property = createPropertyExpression(propertyName, uniqueName, parsedName, entries);
+        structFields.emplace_back(property->getPropertyName(), property->getDataType().copy());
+        propertyExpressions.push_back(std::move(property));
+    }
+    auto queryNode = std::make_shared<NodeExpression>(LogicalType::NODE(std::move(structFields)),
+        uniqueName, parsedName, entries);
+    queryNode->setAlias(parsedName);
+    for (auto& property : propertyExpressions) {
+        queryNode->addPropertyExpression(property);
+    }
+    // Bind internal expressions
+    queryNode->setInternalID(
+        construct(LogicalType::INTERNAL_ID(), InternalKeyword::ID, *queryNode));
+    auto input = function::RewriteFunctionBindInput(clientContext, &expressionBinder, {queryNode});
+    queryNode->setLabelExpression(function::LabelFunction::rewriteFunc(input));
+    return queryNode;
+}
+
+static std::vector<TableCatalogEntry*> sortEntries(const table_catalog_entry_set_t& set) {
+    std::vector<TableCatalogEntry*> entries;
+    for (auto entry : set) {
+        entries.push_back(entry);
+    }
+    std::sort(entries.begin(), entries.end(),
+        [](const TableCatalogEntry* a, const TableCatalogEntry* b) {
+            return a->getTableID() < b->getTableID();
+        });
+    return entries;
+}
+
+std::vector<TableCatalogEntry*> Binder::bindNodeTableEntries(
+    const std::vector<std::string>& tableNames) const {
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto catalog = Catalog::Get(*clientContext);
+    auto useInternal = clientContext->useInternalCatalogEntry();
+    table_catalog_entry_set_t entrySet;
+    if (tableNames.empty()) { // Rewrite as all node tables in database.
+        for (auto entry : catalog->getNodeTableEntries(transaction, useInternal)) {
+            entrySet.insert(entry);
+        }
+    } else {
+        for (auto& name : tableNames) {
+            auto entry = bindNodeTableEntry(name);
+            if (entry->getType() != CatalogEntryType::NODE_TABLE_ENTRY) {
+                throw BinderException(
+                    stringFormat("Cannot bind {} as a node pattern label.", entry->getName()));
+            }
+            entrySet.insert(entry);
+        }
+    }
+    return sortEntries(entrySet);
+}
+
+TableCatalogEntry* Binder::bindNodeTableEntry(const std::string& name) const {
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto catalog = Catalog::Get(*clientContext);
+    auto useInternal = clientContext->useInternalCatalogEntry();
+    if (!catalog->containsTable(transaction, name, useInternal)) {
+        throw BinderException(stringFormat("Table {} does not exist.", name));
+    }
+    return catalog->getTableCatalogEntry(transaction, name, useInternal);
+}
+
+std::vector<TableCatalogEntry*> Binder::bindRelGroupEntries(
+    const std::vector<std::string>& tableNames) const {
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto catalog = Catalog::Get(*clientContext);
+    auto useInternal = clientContext->useInternalCatalogEntry();
+    table_catalog_entry_set_t entrySet;
+    if (tableNames.empty()) { // Rewrite as all rel groups in database.
+        for (auto entry : catalog->getRelGroupEntries(transaction, useInternal)) {
+            entrySet.insert(entry);
+        }
+    } else {
+        for (auto& name : tableNames) {
+            if (catalog->containsTable(transaction, name)) {
+                auto entry = catalog->getTableCatalogEntry(transaction, name, useInternal);
+                if (entry->getType() != CatalogEntryType::REL_GROUP_ENTRY) {
+                    throw BinderException(stringFormat(
+                        "Cannot bind {} as a relationship pattern label.", entry->getName()));
+                }
+                entrySet.insert(entry);
+            } else {
+                throw BinderException(stringFormat("Table {} does not exist.", name));
+            }
+        }
+    }
+    return sortEntries(entrySet);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_import_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_import_database.cpp
new file mode 100644
index 0000000000..24be90d5cf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_import_database.cpp
@@ -0,0 +1,144 @@
+#include "binder/binder.h"
+#include "binder/bound_import_database.h"
+#include "common/copier_config/csv_reader_config.h"
+#include "common/exception/binder.h"
+#include "common/file_system/virtual_file_system.h"
+#include "main/client_context.h"
+#include "parser/copy.h"
+#include "parser/parser.h"
+#include "parser/port_db.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+static std::string getQueryFromFile(VirtualFileSystem* vfs, const std::string& boundFilePath,
+    const std::string& fileName, main::ClientContext* context) {
+    auto filePath = vfs->joinPath(boundFilePath, fileName);
+    if (!vfs->fileOrPathExists(filePath, context)) {
+        if (fileName == PortDBConstants::COPY_FILE_NAME) {
+            return "";
+        }
+        if (fileName == PortDBConstants::INDEX_FILE_NAME) {
+            return "";
+        }
+        throw BinderException(stringFormat("File {} does not exist.", filePath));
+    }
+    auto fileInfo = vfs->openFile(filePath, FileOpenFlags(FileFlags::READ_ONLY
+#ifdef _WIN32
+                                                          | FileFlags::BINARY
+#endif
+                                                ));
+    auto fsize = fileInfo->getFileSize();
+    auto buffer = std::make_unique<char[]>(fsize);
+    fileInfo->readFile(buffer.get(), fsize);
+    return std::string(buffer.get(), fsize);
+}
+
+static std::string getColumnNamesToCopy(const CopyFrom& copyFrom) {
+    std::string columns = "";
+    std::string delimiter = "";
+    for (auto& column : copyFrom.getCopyColumnInfo().columnNames) {
+        columns += delimiter;
+        columns += "`" + column + "`";
+        if (delimiter == "") {
+            delimiter = ",";
+        }
+    }
+    if (columns.empty()) {
+        return columns;
+    }
+    return stringFormat("({})", columns);
+}
+
+static std::string getCopyFilePath(const std::string& boundFilePath, const std::string& filePath) {
+    if (filePath[0] == '/' || (std::isalpha(filePath[0]) && filePath[1] == ':')) {
+        // Note:
+        // Unix absolute path starts with '/'
+        // Windows absolute path starts with "[DiskID]://"
+        // This code path is for backward compatibility, we used to export the absolute path for
+        // csv files to copy.cypher files.
+        return filePath;
+    }
+
+    auto path = boundFilePath + "/" + filePath;
+#if defined(_WIN32)
+    // TODO(Ziyi): This is a temporary workaround because our parser requires input cypher queries
+    // to escape all special characters in string literal. E.g. The user input query is: 'IMPORT
+    // DATABASE 'C:\\db\\uw''. The parser removes any escaped characters and this function accepts
+    // the path parameter as 'C:\db\uw'. Then the ImportDatabase operator gives the file path to
+    // antlr4 parser directly without escaping any special characters in the path, which causes a
+    // parser exception. However, the parser exception is not thrown properly which leads to the
+    // undefined behaviour.
+    size_t pos = 0;
+    while ((pos = path.find('\\', pos)) != std::string::npos) {
+        path.replace(pos, 1, "\\\\");
+        pos += 2;
+    }
+#endif
+    return path;
+}
+
+std::unique_ptr<BoundStatement> Binder::bindImportDatabaseClause(const Statement& statement) {
+    auto& importDB = statement.constCast<ImportDB>();
+    auto fs = VirtualFileSystem::GetUnsafe(*clientContext);
+    auto boundFilePath = fs->expandPath(clientContext, importDB.getFilePath());
+    if (!fs->fileOrPathExists(boundFilePath, clientContext)) {
+        throw BinderException(stringFormat("Directory {} does not exist.", boundFilePath));
+    }
+    std::string finalQueryStatements;
+    finalQueryStatements +=
+        getQueryFromFile(fs, boundFilePath, PortDBConstants::SCHEMA_FILE_NAME, clientContext);
+    // replace the path in copy from statements with the bound path
+    auto copyQuery =
+        getQueryFromFile(fs, boundFilePath, PortDBConstants::COPY_FILE_NAME, clientContext);
+    if (!copyQuery.empty()) {
+        auto parsedStatements = Parser::parseQuery(copyQuery);
+        for (auto& parsedStatement : parsedStatements) {
+            KU_ASSERT(parsedStatement->getStatementType() == StatementType::COPY_FROM);
+            auto& copyFromStatement = parsedStatement->constCast<CopyFrom>();
+            KU_ASSERT(copyFromStatement.getSource()->type == ScanSourceType::FILE);
+            auto filePaths =
+                copyFromStatement.getSource()->constPtrCast<FileScanSource>()->filePaths;
+            KU_ASSERT(filePaths.size() == 1);
+            auto fileTypeInfo = bindFileTypeInfo(filePaths);
+            std::string query;
+            auto copyFilePath = getCopyFilePath(boundFilePath, filePaths[0]);
+            auto columnNames = getColumnNamesToCopy(copyFromStatement);
+            auto parsingOptions = bindParsingOptions(copyFromStatement.getParsingOptions());
+            std::unordered_map<std::string, std::string> copyFromOptions;
+            if (parsingOptions.contains(CopyConstants::FROM_OPTION_NAME)) {
+                KU_ASSERT(parsingOptions.contains(CopyConstants::TO_OPTION_NAME));
+                copyFromOptions[CopyConstants::FROM_OPTION_NAME] = stringFormat("'{}'",
+                    parsingOptions.at(CopyConstants::FROM_OPTION_NAME).getValue<std::string>());
+                copyFromOptions[CopyConstants::TO_OPTION_NAME] = stringFormat("'{}'",
+                    parsingOptions.at(CopyConstants::TO_OPTION_NAME).getValue<std::string>());
+                parsingOptions.erase(CopyConstants::FROM_OPTION_NAME);
+                parsingOptions.erase(CopyConstants::TO_OPTION_NAME);
+            }
+            if (fileTypeInfo.fileType == FileType::CSV) {
+                auto csvConfig = CSVReaderConfig::construct(parsingOptions);
+                csvConfig.option.autoDetection = false;
+                auto optionsMap = csvConfig.option.toOptionsMap(csvConfig.parallel);
+                if (!copyFromOptions.empty()) {
+                    optionsMap.insert(copyFromOptions.begin(), copyFromOptions.end());
+                }
+                query =
+                    stringFormat("COPY `{}` {} FROM \"{}\" {};", copyFromStatement.getTableName(),
+                        columnNames, copyFilePath, CSVOption::toCypher(optionsMap));
+            } else {
+                query =
+                    stringFormat("COPY `{}` {} FROM \"{}\" {};", copyFromStatement.getTableName(),
+                        columnNames, copyFilePath, CSVOption::toCypher(copyFromOptions));
+            }
+            finalQueryStatements += query;
+        }
+    }
+    return std::make_unique<BoundImportDatabase>(boundFilePath, finalQueryStatements,
+        getQueryFromFile(fs, boundFilePath, PortDBConstants::INDEX_FILE_NAME, clientContext));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_projection_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_projection_clause.cpp
new file mode 100644
index 0000000000..31266f0849
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_projection_clause.cpp
@@ -0,0 +1,308 @@
+#include "binder/binder.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression/lambda_expression.h"
+#include "binder/expression_visitor.h"
+#include "binder/query/return_with_clause/bound_return_clause.h"
+#include "binder/query/return_with_clause/bound_with_clause.h"
+#include "common/exception/binder.h"
+#include "parser/expression/parsed_property_expression.h"
+#include "parser/query/return_with_clause/with_clause.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+void validateColumnNamesAreUnique(const std::vector<std::string>& columnNames) {
+    auto existColumnNames = std::unordered_set<std::string>();
+    for (auto& name : columnNames) {
+        if (existColumnNames.contains(name)) {
+            throw BinderException(
+                "Multiple result columns with the same name " + name + " are not supported.");
+        }
+        existColumnNames.insert(name);
+    }
+}
+
+std::vector<std::string> getColumnNames(const expression_vector& exprs,
+    const std::vector<std::string>& aliases) {
+    std::vector<std::string> columnNames;
+    for (auto i = 0u; i < exprs.size(); ++i) {
+        if (aliases[i].empty()) {
+            columnNames.push_back(exprs[i]->toString());
+        } else {
+            columnNames.push_back(aliases[i]);
+        }
+    }
+    return columnNames;
+}
+
+static void validateOrderByFollowedBySkipOrLimitInWithClause(
+    const BoundProjectionBody& boundProjectionBody) {
+    auto hasSkipOrLimit = boundProjectionBody.hasSkip() || boundProjectionBody.hasLimit();
+    if (boundProjectionBody.hasOrderByExpressions() && !hasSkipOrLimit) {
+        throw BinderException("In WITH clause, ORDER BY must be followed by SKIP or LIMIT.");
+    }
+}
+
+BoundWithClause Binder::bindWithClause(const WithClause& withClause) {
+    auto projectionBody = withClause.getProjectionBody();
+    auto [projectionExprs, aliases] = bindProjectionList(*projectionBody);
+    // Check all expressions are aliased
+    for (auto& alias : aliases) {
+        if (alias.empty()) {
+            throw BinderException("Expression in WITH must be aliased (use AS).");
+        }
+    }
+    auto columnNames = getColumnNames(projectionExprs, aliases);
+    validateColumnNamesAreUnique(columnNames);
+    auto boundProjectionBody = bindProjectionBody(*projectionBody, projectionExprs, aliases);
+    validateOrderByFollowedBySkipOrLimitInWithClause(boundProjectionBody);
+    // Update scope
+    scope.clear();
+    for (auto i = 0u; i < projectionExprs.size(); ++i) {
+        addToScope(aliases[i], projectionExprs[i]);
+    }
+    auto boundWithClause = BoundWithClause(std::move(boundProjectionBody));
+    if (withClause.hasWhereExpression()) {
+        boundWithClause.setWhereExpression(bindWhereExpression(*withClause.getWhereExpression()));
+    }
+    return boundWithClause;
+}
+
+BoundReturnClause Binder::bindReturnClause(const ReturnClause& returnClause) {
+    auto projectionBody = returnClause.getProjectionBody();
+    auto [projectionExprs, aliases] = bindProjectionList(*projectionBody);
+    auto columnNames = getColumnNames(projectionExprs, aliases);
+    auto boundProjectionBody = bindProjectionBody(*projectionBody, projectionExprs, aliases);
+    auto statementResult = BoundStatementResult();
+    KU_ASSERT(columnNames.size() == projectionExprs.size());
+    for (auto i = 0u; i < columnNames.size(); ++i) {
+        statementResult.addColumn(columnNames[i], projectionExprs[i]);
+    }
+    return BoundReturnClause(std::move(boundProjectionBody), std::move(statementResult));
+}
+
+static expression_vector getAggregateExpressions(const std::shared_ptr<Expression>& expression,
+    const BinderScope& scope) {
+    expression_vector result;
+    if (expression->hasAlias() && scope.contains(expression->getAlias())) {
+        return result;
+    }
+    if (expression->expressionType == ExpressionType::AGGREGATE_FUNCTION) {
+        result.push_back(expression);
+        return result;
+    }
+    for (auto& child : ExpressionChildrenCollector::collectChildren(*expression)) {
+        for (auto& expr : getAggregateExpressions(child, scope)) {
+            result.push_back(expr);
+        }
+    }
+    return result;
+}
+
+std::pair<expression_vector, std::vector<std::string>> Binder::bindProjectionList(
+    const ProjectionBody& projectionBody) {
+    expression_vector projectionExprs;
+    std::vector<std::string> aliases;
+    for (auto& parsedExpr : projectionBody.getProjectionExpressions()) {
+        if (parsedExpr->getExpressionType() == ExpressionType::STAR) {
+            // Rewrite star expression as all expression in scope.
+            if (scope.empty()) {
+                throw BinderException(
+                    "RETURN or WITH * is not allowed when there are no variables in scope.");
+            }
+            for (auto& expr : scope.getExpressions()) {
+                projectionExprs.push_back(expr);
+                aliases.push_back(expr->getAlias());
+            }
+        } else if (parsedExpr->getExpressionType() == ExpressionType::PROPERTY) {
+            auto& propExpr = parsedExpr->constCast<ParsedPropertyExpression>();
+            if (propExpr.isStar()) {
+                // Rewrite property star expression
+                for (auto& expr : expressionBinder.bindPropertyStarExpression(*parsedExpr)) {
+                    projectionExprs.push_back(expr);
+                    aliases.push_back("");
+                }
+            } else {
+                auto expr = expressionBinder.bindExpression(*parsedExpr);
+                projectionExprs.push_back(expr);
+                aliases.push_back(parsedExpr->getAlias());
+            }
+        } else {
+            auto expr = expressionBinder.bindExpression(*parsedExpr);
+            projectionExprs.push_back(expr);
+            aliases.push_back(parsedExpr->hasAlias() ? parsedExpr->getAlias() : expr->getAlias());
+        }
+    }
+    return {projectionExprs, aliases};
+}
+
+class NestedAggCollector final : public ExpressionVisitor {
+public:
+    expression_vector exprs;
+
+protected:
+    void visitAggFunctionExpr(std::shared_ptr<Expression> expr) override { exprs.push_back(expr); }
+    void visitChildren(const Expression& expr) override {
+        switch (expr.expressionType) {
+        case ExpressionType::CASE_ELSE: {
+            visitCaseExprChildren(expr);
+        } break;
+        case ExpressionType::LAMBDA: {
+            auto& lambda = expr.constCast<LambdaExpression>();
+            visit(lambda.getFunctionExpr());
+        } break;
+        case ExpressionType::AGGREGATE_FUNCTION: {
+            // We do not traverse the child or aggregate because nested agg is validated recursively
+            // e.g.  WITH SUM(1) AS x WITH SUM(x) AS y RETURN SUM(y)
+            // when validating SUM(y) we only need to check y and not x.
+        } break;
+        default: {
+            for (auto& child : expr.getChildren()) {
+                visit(child);
+            }
+        }
+        }
+    }
+};
+
+static void validateNestedAggregate(const Expression& expr, const BinderScope& scope) {
+    KU_ASSERT(expr.expressionType == ExpressionType::AGGREGATE_FUNCTION);
+    if (expr.getNumChildren() == 0) { // Skip COUNT(*)
+        return;
+    }
+    auto collector = NestedAggCollector();
+    collector.visit(expr.getChild(0));
+    for (auto& childAgg : collector.exprs) {
+        if (!scope.contains(childAgg->getAlias())) {
+            throw BinderException(
+                stringFormat("Expression {} contains nested aggregation.", expr.toString()));
+        }
+    }
+}
+
+BoundProjectionBody Binder::bindProjectionBody(const parser::ProjectionBody& projectionBody,
+    const expression_vector& projectionExprs, const std::vector<std::string>& aliases) {
+    expression_vector groupByExprs;
+    expression_vector aggregateExprs;
+    KU_ASSERT(projectionExprs.size() == aliases.size());
+    for (auto i = 0u; i < projectionExprs.size(); ++i) {
+        auto expr = projectionExprs[i];
+        auto aggExprs = getAggregateExpressions(expr, scope);
+        if (!aggExprs.empty()) {
+            for (auto& agg : aggExprs) {
+                aggregateExprs.push_back(agg);
+            }
+        } else {
+            groupByExprs.push_back(expr);
+        }
+        expr->setAlias(aliases[i]);
+    }
+
+    auto boundProjectionBody = BoundProjectionBody(projectionBody.getIsDistinct());
+    boundProjectionBody.setProjectionExpressions(projectionExprs);
+
+    if (!aggregateExprs.empty()) {
+        for (auto& expr : aggregateExprs) {
+            validateNestedAggregate(*expr, scope);
+        }
+        if (!groupByExprs.empty()) {
+            // TODO(Xiyang): we can remove augment group by. But make sure we test sufficient
+            // including edge case and bug before release.
+            expression_vector augmentedGroupByExpressions = groupByExprs;
+            for (auto& expression : groupByExprs) {
+                if (ExpressionUtil::isNodePattern(*expression)) {
+                    auto& node = expression->constCast<NodeExpression>();
+                    augmentedGroupByExpressions.push_back(node.getInternalID());
+                } else if (ExpressionUtil::isRelPattern(*expression)) {
+                    auto& rel = expression->constCast<RelExpression>();
+                    augmentedGroupByExpressions.push_back(rel.getInternalID());
+                }
+            }
+            boundProjectionBody.setGroupByExpressions(std::move(augmentedGroupByExpressions));
+        }
+        boundProjectionBody.setAggregateExpressions(std::move(aggregateExprs));
+    }
+    // Bind order by
+    if (projectionBody.hasOrderByExpressions()) {
+        // Cypher rule of ORDER BY expression scope: if projection contains aggregation, only
+        // expressions in projection are available. Otherwise, expressions before projection are
+        // also available
+        expression_vector orderByExprs;
+        if (boundProjectionBody.hasAggregateExpressions() || boundProjectionBody.isDistinct()) {
+            scope.clear();
+            KU_ASSERT(projectionBody.getProjectionExpressions().size() == projectionExprs.size());
+            std::vector<std::string> tmpAliases;
+            for (auto& expr : projectionBody.getProjectionExpressions()) {
+                tmpAliases.push_back(expr->hasAlias() ? expr->getAlias() : expr->toString());
+            }
+            addToScope(tmpAliases, projectionExprs);
+            expressionBinder.config.bindOrderByAfterAggregate = true;
+            orderByExprs = bindOrderByExpressions(projectionBody.getOrderByExpressions());
+            expressionBinder.config.bindOrderByAfterAggregate = false;
+        } else {
+            addToScope(aliases, projectionExprs);
+            orderByExprs = bindOrderByExpressions(projectionBody.getOrderByExpressions());
+        }
+        boundProjectionBody.setOrderByExpressions(std::move(orderByExprs),
+            projectionBody.getSortOrders());
+    }
+    // Bind skip
+    if (projectionBody.hasSkipExpression()) {
+        boundProjectionBody.setSkipNumber(
+            bindSkipLimitExpression(*projectionBody.getSkipExpression()));
+    }
+    // Bind limit
+    if (projectionBody.hasLimitExpression()) {
+        boundProjectionBody.setLimitNumber(
+            bindSkipLimitExpression(*projectionBody.getLimitExpression()));
+    }
+    return boundProjectionBody;
+}
+
+static bool isOrderByKeyTypeSupported(const LogicalType& dataType) {
+    switch (dataType.getLogicalTypeID()) {
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::INTERNAL_ID:
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::STRUCT:
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::UNION:
+    case LogicalTypeID::POINTER:
+        return false;
+    default:
+        return true;
+    }
+}
+
+expression_vector Binder::bindOrderByExpressions(
+    const std::vector<std::unique_ptr<ParsedExpression>>& parsedExprs) {
+    expression_vector exprs;
+    for (auto& parsedExpr : parsedExprs) {
+        auto expr = expressionBinder.bindExpression(*parsedExpr);
+        if (!isOrderByKeyTypeSupported(expr->dataType)) {
+            throw BinderException(stringFormat("Cannot order by {}. Order by {} is not supported.",
+                expr->toString(), expr->dataType.toString()));
+        }
+        exprs.push_back(std::move(expr));
+    }
+    return exprs;
+}
+
+std::shared_ptr<Expression> Binder::bindSkipLimitExpression(const ParsedExpression& expression) {
+    auto boundExpression = expressionBinder.bindExpression(expression);
+    if (boundExpression->expressionType != ExpressionType::LITERAL &&
+        boundExpression->expressionType != ExpressionType::PARAMETER) {
+        throw BinderException(
+            "The number of rows to skip/limit must be a parameter/literal expression.");
+    }
+    return boundExpression;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_query.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_query.cpp
new file mode 100644
index 0000000000..45a305aa3d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_query.cpp
@@ -0,0 +1,106 @@
+#include "binder/binder.h"
+#include "binder/expression/expression_util.h"
+#include "binder/query/return_with_clause/bound_return_clause.h"
+#include "binder/query/return_with_clause/bound_with_clause.h"
+#include "common/exception/binder.h"
+#include "parser/query/regular_query.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+void validateUnionColumnsOfTheSameType(
+    const std::vector<NormalizedSingleQuery>& normalizedSingleQueries) {
+    if (normalizedSingleQueries.size() <= 1) {
+        return;
+    }
+    auto columns = normalizedSingleQueries[0].getStatementResult()->getColumns();
+    for (auto i = 1u; i < normalizedSingleQueries.size(); i++) {
+        auto otherColumns = normalizedSingleQueries[i].getStatementResult()->getColumns();
+        if (columns.size() != otherColumns.size()) {
+            throw BinderException("The number of columns to union/union all must be the same.");
+        }
+        // Check whether the dataTypes in union expressions are exactly the same in each single
+        // query.
+        for (auto j = 0u; j < columns.size(); j++) {
+            ExpressionUtil::validateDataType(*otherColumns[j], columns[j]->getDataType());
+        }
+    }
+}
+
+void validateIsAllUnionOrUnionAll(const BoundRegularQuery& regularQuery) {
+    auto unionAllExpressionCounter = 0u;
+    for (auto i = 0u; i < regularQuery.getNumSingleQueries() - 1; i++) {
+        unionAllExpressionCounter += regularQuery.getIsUnionAll(i);
+    }
+    if ((0 < unionAllExpressionCounter) &&
+        (unionAllExpressionCounter < regularQuery.getNumSingleQueries() - 1)) {
+        throw BinderException("Union and union all can not be used together.");
+    }
+}
+
+std::unique_ptr<BoundRegularQuery> Binder::bindQuery(const Statement& statement) {
+    auto& regularQuery = statement.constCast<RegularQuery>();
+    std::vector<NormalizedSingleQuery> normalizedSingleQueries;
+    for (auto i = 0u; i < regularQuery.getNumSingleQueries(); i++) {
+        // Don't clear scope within bindSingleQuery() yet because it is also used for subquery
+        // binding.
+        scope.clear();
+        normalizedSingleQueries.push_back(bindSingleQuery(*regularQuery.getSingleQuery(i)));
+    }
+    validateUnionColumnsOfTheSameType(normalizedSingleQueries);
+    KU_ASSERT(!normalizedSingleQueries.empty());
+    auto boundRegularQuery = std::make_unique<BoundRegularQuery>(regularQuery.getIsUnionAll(),
+        normalizedSingleQueries[0].getStatementResult()->copy());
+    for (auto& normalizedSingleQuery : normalizedSingleQueries) {
+        boundRegularQuery->addSingleQuery(std::move(normalizedSingleQuery));
+    }
+    validateIsAllUnionOrUnionAll(*boundRegularQuery);
+    return boundRegularQuery;
+}
+
+NormalizedSingleQuery Binder::bindSingleQuery(const SingleQuery& singleQuery) {
+    auto normalizedSingleQuery = NormalizedSingleQuery();
+    for (auto i = 0u; i < singleQuery.getNumQueryParts(); ++i) {
+        normalizedSingleQuery.appendQueryPart(bindQueryPart(*singleQuery.getQueryPart(i)));
+    }
+    auto lastQueryPart = NormalizedQueryPart();
+    for (auto i = 0u; i < singleQuery.getNumReadingClauses(); i++) {
+        lastQueryPart.addReadingClause(bindReadingClause(*singleQuery.getReadingClause(i)));
+    }
+    for (auto i = 0u; i < singleQuery.getNumUpdatingClauses(); ++i) {
+        lastQueryPart.addUpdatingClause(bindUpdatingClause(*singleQuery.getUpdatingClause(i)));
+    }
+    auto statementResult = BoundStatementResult();
+    if (singleQuery.hasReturnClause()) {
+        auto boundReturnClause = bindReturnClause(*singleQuery.getReturnClause());
+        lastQueryPart.setProjectionBody(boundReturnClause.getProjectionBody()->copy());
+        statementResult = boundReturnClause.getStatementResult()->copy();
+    } else {
+        statementResult = BoundStatementResult::createEmptyResult();
+    }
+    normalizedSingleQuery.appendQueryPart(std::move(lastQueryPart));
+    normalizedSingleQuery.setStatementResult(std::move(statementResult));
+    return normalizedSingleQuery;
+}
+
+NormalizedQueryPart Binder::bindQueryPart(const QueryPart& queryPart) {
+    auto normalizedQueryPart = NormalizedQueryPart();
+    for (auto i = 0u; i < queryPart.getNumReadingClauses(); i++) {
+        normalizedQueryPart.addReadingClause(bindReadingClause(*queryPart.getReadingClause(i)));
+    }
+    for (auto i = 0u; i < queryPart.getNumUpdatingClauses(); ++i) {
+        normalizedQueryPart.addUpdatingClause(bindUpdatingClause(*queryPart.getUpdatingClause(i)));
+    }
+    auto boundWithClause = bindWithClause(*queryPart.getWithClause());
+    normalizedQueryPart.setProjectionBody(boundWithClause.getProjectionBody()->copy());
+    if (boundWithClause.hasWhereExpression()) {
+        normalizedQueryPart.setProjectionBodyPredicate(boundWithClause.getWhereExpression());
+    }
+    return normalizedQueryPart;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_reading_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_reading_clause.cpp
new file mode 100644
index 0000000000..d22010e40d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_reading_clause.cpp
@@ -0,0 +1,30 @@
+#include "binder/binder.h"
+#include "parser/query/reading_clause/reading_clause.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundReadingClause> Binder::bindReadingClause(const ReadingClause& readingClause) {
+    switch (readingClause.getClauseType()) {
+    case ClauseType::MATCH: {
+        return bindMatchClause(readingClause);
+    }
+    case ClauseType::UNWIND: {
+        return bindUnwindClause(readingClause);
+    }
+    case ClauseType::IN_QUERY_CALL: {
+        return bindInQueryCall(readingClause);
+    }
+    case ClauseType::LOAD_FROM: {
+        return bindLoadFrom(readingClause);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_standalone_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_standalone_call.cpp
new file mode 100644
index 0000000000..c006540530
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_standalone_call.cpp
@@ -0,0 +1,44 @@
+#include "binder/binder.h"
+#include "binder/bound_standalone_call.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression_visitor.h"
+#include "common/cast.h"
+#include "common/exception/binder.h"
+#include "main/client_context.h"
+#include "main/db_config.h"
+#include "parser/standalone_call.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bindStandaloneCall(const parser::Statement& statement) {
+    auto& callStatement = ku_dynamic_cast<const parser::StandaloneCall&>(statement);
+    const main::Option* option = main::DBConfig::getOptionByName(callStatement.getOptionName());
+    if (option == nullptr) {
+        option = clientContext->getExtensionOption(callStatement.getOptionName());
+    }
+    if (option == nullptr) {
+        throw BinderException{"Invalid option name: " + callStatement.getOptionName() + "."};
+    }
+    auto optionValue = expressionBinder.bindExpression(*callStatement.getOptionValue());
+    ExpressionUtil::validateExpressionType(*optionValue, ExpressionType::LITERAL);
+    if (LogicalTypeUtils::isFloatingPoint(optionValue->dataType.getLogicalTypeID()) &&
+        LogicalTypeUtils::isIntegral(LogicalType(option->parameterType))) {
+        throw BinderException{stringFormat(
+            "Expression {} has data type {} but expected {}. Implicit cast is not supported.",
+            optionValue->toString(),
+            LogicalTypeUtils::toString(optionValue->dataType.getLogicalTypeID()),
+            LogicalTypeUtils::toString(option->parameterType))};
+    }
+    optionValue =
+        expressionBinder.implicitCastIfNecessary(optionValue, LogicalType(option->parameterType));
+    if (ConstantExpressionVisitor::needFold(*optionValue)) {
+        optionValue = expressionBinder.foldExpression(optionValue);
+    }
+    return std::make_unique<BoundStandaloneCall>(option, std::move(optionValue));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_standalone_call_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_standalone_call_function.cpp
new file mode 100644
index 0000000000..40ed05f28b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_standalone_call_function.cpp
@@ -0,0 +1,35 @@
+#include "binder/binder.h"
+#include "binder/bound_standalone_call_function.h"
+#include "catalog/catalog.h"
+#include "common/exception/binder.h"
+#include "main/client_context.h"
+#include "parser/expression/parsed_function_expression.h"
+#include "parser/standalone_call_function.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bindStandaloneCallFunction(
+    const parser::Statement& statement) {
+    auto& callStatement = statement.constCast<parser::StandaloneCallFunction>();
+    auto& funcExpr =
+        callStatement.getFunctionExpression()->constCast<parser::ParsedFunctionExpression>();
+    auto funcName = funcExpr.getFunctionName();
+    auto catalog = catalog::Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto entry =
+        catalog->getFunctionEntry(transaction, funcName, clientContext->useInternalCatalogEntry());
+    KU_ASSERT(entry);
+    if (entry->getType() != catalog::CatalogEntryType::STANDALONE_TABLE_FUNCTION_ENTRY) {
+        throw BinderException(
+            "Only standalone table functions can be called without return statement.");
+    }
+    auto boundTableFunction = bindTableFunc(funcName, funcExpr, {} /* yieldVariables */);
+    return std::make_unique<BoundStandaloneCallFunction>(std::move(boundTableFunction));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_table_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_table_function.cpp
new file mode 100644
index 0000000000..2277c1b6db
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_table_function.cpp
@@ -0,0 +1,77 @@
+#include "binder/binder.h"
+#include "binder/bound_table_scan_info.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression/literal_expression.h"
+#include "catalog/catalog.h"
+#include "function/built_in_function_utils.h"
+#include "main/client_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace binder {
+
+BoundTableScanInfo Binder::bindTableFunc(const std::string& tableFuncName,
+    const parser::ParsedExpression& expr, std::vector<parser::YieldVariable> yieldVariables) {
+    auto catalog = catalog::Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto entry = catalog->getFunctionEntry(transaction, tableFuncName,
+        clientContext->useInternalCatalogEntry());
+    expression_vector positionalParams;
+    std::vector<LogicalType> positionalParamTypes;
+    optional_params_t optionalParams;
+    expression_vector optionalParamsLegacy;
+    for (auto i = 0u; i < expr.getNumChildren(); i++) {
+        auto& childExpr = *expr.getChild(i);
+        auto param = expressionBinder.bindExpression(childExpr);
+        ExpressionUtil::validateExpressionType(*param,
+            {ExpressionType::LITERAL, ExpressionType::PARAMETER, ExpressionType::PATTERN});
+        if (!childExpr.hasAlias()) {
+            positionalParams.push_back(param);
+            positionalParamTypes.push_back(param->getDataType().copy());
+        } else {
+            if (param->expressionType == ExpressionType::LITERAL) {
+                auto literalExpr = param->constPtrCast<LiteralExpression>();
+                optionalParams.emplace(childExpr.getAlias(), literalExpr->getValue());
+            }
+            param->setAlias(expr.getChild(i)->getAlias());
+            optionalParamsLegacy.push_back(param);
+        }
+    }
+    auto func = BuiltInFunctionsUtils::matchFunction(tableFuncName, positionalParamTypes,
+        entry->ptrCast<catalog::FunctionCatalogEntry>());
+    auto tableFunc = func->constPtrCast<TableFunction>();
+    std::vector<LogicalType> inputTypes;
+    if (tableFunc->inferInputTypes) {
+        // For functions which take in nested data types, we have to use the input parameters to
+        // detect the input types. (E.g. query_hnsw_index takes in an ARRAY which needs the user
+        // input parameters to decide the array dimension).
+        inputTypes = tableFunc->inferInputTypes(positionalParams);
+    } else {
+        // For functions which don't have nested type parameters, we can simply use the types
+        // declared in the function signature.
+        for (auto i = 0u; i < tableFunc->parameterTypeIDs.size(); i++) {
+            inputTypes.push_back(LogicalType(tableFunc->parameterTypeIDs[i]));
+        }
+    }
+    for (auto i = 0u; i < positionalParams.size(); ++i) {
+        auto parameterTypeID = tableFunc->parameterTypeIDs[i];
+        if (positionalParams[i]->expressionType == ExpressionType::LITERAL &&
+            parameterTypeID != LogicalTypeID::ANY) {
+            positionalParams[i] = expressionBinder.foldExpression(
+                expressionBinder.implicitCastIfNecessary(positionalParams[i], inputTypes[i]));
+        }
+    }
+    auto bindInput = TableFuncBindInput();
+    bindInput.params = std::move(positionalParams);
+    bindInput.optionalParams = std::move(optionalParams);
+    bindInput.optionalParamsLegacy = std::move(optionalParamsLegacy);
+    bindInput.binder = this;
+    bindInput.yieldVariables = std::move(yieldVariables);
+    return BoundTableScanInfo{*tableFunc, tableFunc->bindFunc(clientContext, &bindInput)};
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_transaction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_transaction.cpp
new file mode 100644
index 0000000000..21277ddadc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_transaction.cpp
@@ -0,0 +1,16 @@
+#include "binder/binder.h"
+#include "binder/bound_transaction_statement.h"
+#include "parser/transaction_statement.h"
+
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bindTransaction(const Statement& statement) {
+    auto& transactionStatement = statement.constCast<TransactionStatement>();
+    return std::make_unique<BoundTransactionStatement>(transactionStatement.getTransactionAction());
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_updating_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_updating_clause.cpp
new file mode 100644
index 0000000000..d5686b412b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_updating_clause.cpp
@@ -0,0 +1,387 @@
+#include "binder/binder.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression/property_expression.h"
+#include "binder/query/query_graph_label_analyzer.h"
+#include "binder/query/updating_clause/bound_delete_clause.h"
+#include "binder/query/updating_clause/bound_insert_clause.h"
+#include "binder/query/updating_clause/bound_merge_clause.h"
+#include "binder/query/updating_clause/bound_set_clause.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/index_catalog_entry.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/assert.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "parser/query/updating_clause/delete_clause.h"
+#include "parser/query/updating_clause/insert_clause.h"
+#include "parser/query/updating_clause/merge_clause.h"
+#include "parser/query/updating_clause/set_clause.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundUpdatingClause> Binder::bindUpdatingClause(
+    const UpdatingClause& updatingClause) {
+    switch (updatingClause.getClauseType()) {
+    case ClauseType::INSERT: {
+        return bindInsertClause(updatingClause);
+    }
+    case ClauseType::MERGE: {
+        return bindMergeClause(updatingClause);
+    }
+    case ClauseType::SET: {
+        return bindSetClause(updatingClause);
+    }
+    case ClauseType::DELETE_: {
+        return bindDeleteClause(updatingClause);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static std::unordered_set<std::string> populatePatternsScope(const BinderScope& scope) {
+    std::unordered_set<std::string> result;
+    for (auto& expression : scope.getExpressions()) {
+        if (ExpressionUtil::isNodePattern(*expression) ||
+            ExpressionUtil::isRelPattern(*expression)) {
+            result.insert(expression->toString());
+        } else if (expression->expressionType == ExpressionType::VARIABLE) {
+            if (scope.hasNodeReplacement(expression->toString())) {
+                result.insert(expression->toString());
+            }
+        }
+    }
+    return result;
+}
+
+std::unique_ptr<BoundUpdatingClause> Binder::bindInsertClause(
+    const UpdatingClause& updatingClause) {
+    auto& insertClause = updatingClause.constCast<InsertClause>();
+    auto patternsScope = populatePatternsScope(scope);
+    // bindGraphPattern will update scope.
+    auto boundGraphPattern = bindGraphPattern(insertClause.getPatternElementsRef());
+    auto insertInfos = bindInsertInfos(boundGraphPattern.queryGraphCollection, patternsScope);
+    return std::make_unique<BoundInsertClause>(std::move(insertInfos));
+}
+
+static expression_vector getColumnDataExprs(QueryGraphCollection& collection) {
+    expression_vector exprs;
+    for (auto i = 0u; i < collection.getNumQueryGraphs(); ++i) {
+        auto queryGraph = collection.getQueryGraph(i);
+        for (auto& pattern : queryGraph->getAllPatterns()) {
+            for (auto& [_, rhs] : pattern->getPropertyDataExprRef()) {
+                exprs.push_back(rhs);
+            }
+        }
+    }
+    return exprs;
+}
+
+std::unique_ptr<BoundUpdatingClause> Binder::bindMergeClause(const UpdatingClause& updatingClause) {
+    auto& mergeClause = updatingClause.constCast<MergeClause>();
+    auto patternsScope = populatePatternsScope(scope);
+    // bindGraphPattern will update scope.
+    auto boundGraphPattern = bindGraphPattern(mergeClause.getPatternElementsRef());
+    auto columnDataExprs = getColumnDataExprs(boundGraphPattern.queryGraphCollection);
+    // Rewrite key value pairs in MATCH clause as predicate
+    rewriteMatchPattern(boundGraphPattern);
+    auto existenceMark =
+        expressionBinder.createVariableExpression(LogicalType::BOOL(), std::string("__existence"));
+    auto distinctMark =
+        expressionBinder.createVariableExpression(LogicalType::BOOL(), std::string("__distinct"));
+    auto createInfos = bindInsertInfos(boundGraphPattern.queryGraphCollection, patternsScope);
+    auto boundMergeClause =
+        std::make_unique<BoundMergeClause>(columnDataExprs, std::move(existenceMark),
+            std::move(distinctMark), std::move(boundGraphPattern.queryGraphCollection),
+            std::move(boundGraphPattern.where), std::move(createInfos));
+    if (mergeClause.hasOnMatchSetItems()) {
+        for (auto& [lhs, rhs] : mergeClause.getOnMatchSetItemsRef()) {
+            auto setPropertyInfo = bindSetPropertyInfo(lhs.get(), rhs.get());
+            boundMergeClause->addOnMatchSetPropertyInfo(std::move(setPropertyInfo));
+        }
+    }
+    if (mergeClause.hasOnCreateSetItems()) {
+        for (auto& [lhs, rhs] : mergeClause.getOnCreateSetItemsRef()) {
+            auto setPropertyInfo = bindSetPropertyInfo(lhs.get(), rhs.get());
+            boundMergeClause->addOnCreateSetPropertyInfo(std::move(setPropertyInfo));
+        }
+    }
+    return boundMergeClause;
+}
+
+std::vector<BoundInsertInfo> Binder::bindInsertInfos(QueryGraphCollection& queryGraphCollection,
+    const std::unordered_set<std::string>& patternsInScope_) {
+    auto patternsInScope = patternsInScope_;
+    std::vector<BoundInsertInfo> result;
+    auto analyzer = QueryGraphLabelAnalyzer(*clientContext, true /* throwOnViolate */);
+    for (auto i = 0u; i < queryGraphCollection.getNumQueryGraphs(); ++i) {
+        auto queryGraph = queryGraphCollection.getQueryGraphUnsafe(i);
+        // Ensure query graph does not violate declared schema.
+        analyzer.pruneLabel(*queryGraph);
+        for (auto j = 0u; j < queryGraph->getNumQueryNodes(); ++j) {
+            auto node = queryGraph->getQueryNode(j);
+            if (node->getVariableName().empty()) { // Always create anonymous node.
+                bindInsertNode(node, result);
+                continue;
+            }
+            if (patternsInScope.contains(node->getVariableName())) {
+                continue;
+            }
+            patternsInScope.insert(node->getVariableName());
+            bindInsertNode(node, result);
+        }
+        for (auto j = 0u; j < queryGraph->getNumQueryRels(); ++j) {
+            auto rel = queryGraph->getQueryRel(j);
+            if (rel->getVariableName().empty()) { // Always create anonymous rel.
+                bindInsertRel(rel, result);
+                continue;
+            }
+            if (patternsInScope.contains(rel->getVariableName())) {
+                continue;
+            }
+            patternsInScope.insert(rel->getVariableName());
+            bindInsertRel(rel, result);
+        }
+    }
+    if (result.empty()) {
+        throw BinderException("Cannot resolve any node or relationship to create.");
+    }
+    return result;
+}
+
+static void validatePrimaryKeyExistence(const NodeTableCatalogEntry* nodeTableEntry,
+    const NodeExpression& node, const expression_vector& defaultExprs) {
+    auto primaryKeyName = nodeTableEntry->getPrimaryKeyName();
+    auto pkeyDefaultExpr = defaultExprs.at(nodeTableEntry->getPrimaryKeyID());
+    if (!node.hasPropertyDataExpr(primaryKeyName) &&
+        ExpressionUtil::isNullLiteral(*pkeyDefaultExpr)) {
+        throw BinderException(stringFormat("Create node {} expects primary key {} as input.",
+            node.toString(), primaryKeyName));
+    }
+}
+
+void Binder::bindInsertNode(std::shared_ptr<NodeExpression> node,
+    std::vector<BoundInsertInfo>& infos) {
+    if (node->isMultiLabeled()) {
+        throw BinderException(
+            "Create node " + node->toString() + " with multiple node labels is not supported.");
+    }
+    if (node->isEmpty()) {
+        throw BinderException(
+            "Create node " + node->toString() + " with empty node labels is not supported.");
+    }
+    KU_ASSERT(node->getNumEntries() == 1);
+    auto entry = node->getEntry(0);
+    KU_ASSERT(entry->getTableType() == TableType::NODE);
+    auto insertInfo = BoundInsertInfo(TableType::NODE, node);
+    for (auto& property : node->getPropertyExpressions()) {
+        if (property->hasProperty(entry->getTableID())) {
+            insertInfo.columnExprs.push_back(property);
+        }
+    }
+    insertInfo.columnDataExprs =
+        bindInsertColumnDataExprs(node->getPropertyDataExprRef(), entry->getProperties());
+    auto nodeEntry = entry->ptrCast<NodeTableCatalogEntry>();
+    validatePrimaryKeyExistence(nodeEntry, *node, insertInfo.columnDataExprs);
+    // Check extension secondary index loaded
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    for (auto indexEntry : catalog->getIndexEntries(transaction, nodeEntry->getTableID())) {
+        if (!indexEntry->isLoaded()) {
+            throw BinderException(stringFormat(
+                "Trying to insert into an index on table {} but its extension is not loaded.",
+                nodeEntry->getName()));
+        }
+    }
+    infos.push_back(std::move(insertInfo));
+}
+
+static TableCatalogEntry* tryPruneMultiLabeled(const RelExpression& rel,
+    const TableCatalogEntry& srcEntry, const TableCatalogEntry& dstEntry) {
+    std::vector<TableCatalogEntry*> candidates;
+    for (auto& entry : rel.getEntries()) {
+        KU_ASSERT(entry->getType() == CatalogEntryType::REL_GROUP_ENTRY);
+        auto& relEntry = entry->constCast<RelGroupCatalogEntry>();
+        if (relEntry.hasRelEntryInfo(srcEntry.getTableID(), dstEntry.getTableID())) {
+            candidates.push_back(entry);
+        }
+    }
+    if (candidates.size() > 1) {
+        throw BinderException(stringFormat(
+            "Create rel {} with multiple rel labels is not supported.", rel.toString()));
+    }
+    if (candidates.size() == 0) {
+        throw BinderException(
+            stringFormat("Cannot find a valid label in {} that connects {} and {}.", rel.toString(),
+                srcEntry.getName(), dstEntry.getName()));
+    }
+    return candidates[0];
+}
+
+void Binder::bindInsertRel(std::shared_ptr<RelExpression> rel,
+    std::vector<BoundInsertInfo>& infos) {
+    if (rel->isBoundByMultiLabeledNode()) {
+        throw BinderException(stringFormat(
+            "Create rel {} bound by multiple node labels is not supported.", rel->toString()));
+    }
+    if (rel->getDirectionType() == RelDirectionType::BOTH) {
+        throw BinderException(stringFormat("Create undirected relationship is not supported. "
+                                           "Try create 2 directed relationships instead."));
+    }
+    if (ExpressionUtil::isRecursiveRelPattern(*rel)) {
+        throw BinderException(stringFormat("Cannot create recursive rel {}.", rel->toString()));
+    }
+    TableCatalogEntry* entry = nullptr;
+    if (!rel->isMultiLabeled()) {
+        KU_ASSERT(rel->getNumEntries() == 1);
+        entry = rel->getEntry(0);
+    } else {
+        auto srcEntry = rel->getSrcNode()->getEntry(0);
+        auto dstEntry = rel->getDstNode()->getEntry(0);
+        entry = tryPruneMultiLabeled(*rel, *srcEntry, *dstEntry);
+    }
+    rel->setEntries(std::vector{entry});
+    auto insertInfo = BoundInsertInfo(TableType::REL, rel);
+    // Because we might prune entries, some property exprs may belong to pruned entry
+    for (auto& p : entry->getProperties()) {
+        insertInfo.columnExprs.push_back(rel->getPropertyExpression(p.getName()));
+    }
+    insertInfo.columnDataExprs =
+        bindInsertColumnDataExprs(rel->getPropertyDataExprRef(), entry->getProperties());
+    infos.push_back(std::move(insertInfo));
+}
+
+expression_vector Binder::bindInsertColumnDataExprs(
+    const case_insensitive_map_t<std::shared_ptr<Expression>>& propertyDataExprs,
+    const std::vector<PropertyDefinition>& propertyDefinitions) {
+    expression_vector result;
+    for (auto& definition : propertyDefinitions) {
+        std::shared_ptr<Expression> rhs;
+        if (propertyDataExprs.contains(definition.getName())) {
+            rhs = propertyDataExprs.at(definition.getName());
+        } else {
+            rhs = expressionBinder.bindExpression(*definition.defaultExpr);
+        }
+        rhs = expressionBinder.implicitCastIfNecessary(rhs, definition.getType());
+        result.push_back(std::move(rhs));
+    }
+    return result;
+}
+
+std::unique_ptr<BoundUpdatingClause> Binder::bindSetClause(const UpdatingClause& updatingClause) {
+    auto& setClause = updatingClause.constCast<SetClause>();
+    auto boundSetClause = std::make_unique<BoundSetClause>();
+    for (auto& setItem : setClause.getSetItemsRef()) {
+        boundSetClause->addInfo(bindSetPropertyInfo(setItem.first.get(), setItem.second.get()));
+    }
+    return boundSetClause;
+}
+
+BoundSetPropertyInfo Binder::bindSetPropertyInfo(const ParsedExpression* column,
+    const ParsedExpression* columnData) {
+    auto expr = expressionBinder.bindExpression(*column->getChild(0));
+    auto isNode = ExpressionUtil::isNodePattern(*expr);
+    auto isRel = ExpressionUtil::isRelPattern(*expr);
+    if (!isNode && !isRel) {
+        throw BinderException(
+            stringFormat("Cannot set expression {} with type {}. Expect node or rel pattern.",
+                expr->toString(), ExpressionTypeUtil::toString(expr->expressionType)));
+    }
+    auto boundSetItem = bindSetItem(column, columnData);
+    auto boundColumn = boundSetItem.first;
+    auto boundColumnData = boundSetItem.second;
+    auto& nodeOrRel = expr->constCast<NodeOrRelExpression>();
+    auto& property = boundSetItem.first->constCast<PropertyExpression>();
+    // Check secondary index constraint
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    for (auto entry : nodeOrRel.getEntries()) {
+        // When setting multi labeled node, skip checking if property is not in current table.
+        if (!property.hasProperty(entry->getTableID())) {
+            continue;
+        }
+        auto propertyID = entry->getPropertyID(property.getPropertyName());
+        if (catalog->containsUnloadedIndex(transaction, entry->getTableID(), propertyID)) {
+            throw BinderException(
+                stringFormat("Cannot set property {} in table {} because it is used in one or more "
+                             "indexes which is unloaded.",
+                    property.getPropertyName(), entry->getName()));
+        }
+    }
+    // Check primary key constraint
+    if (isNode) {
+        for (auto entry : nodeOrRel.getEntries()) {
+            if (property.isPrimaryKey(entry->getTableID())) {
+                throw BinderException(
+                    stringFormat("Cannot set property {} in table {} because it is used as primary "
+                                 "key. Try delete and then insert.",
+                        property.getPropertyName(), entry->getName()));
+            }
+        }
+        return BoundSetPropertyInfo(TableType::NODE, expr, boundColumn, boundColumnData);
+    }
+    return BoundSetPropertyInfo(TableType::REL, expr, boundColumn, boundColumnData);
+}
+
+expression_pair Binder::bindSetItem(const ParsedExpression* column,
+    const ParsedExpression* columnData) {
+    auto boundColumn = expressionBinder.bindExpression(*column);
+    auto boundColumnData = expressionBinder.bindExpression(*columnData);
+    boundColumnData =
+        expressionBinder.implicitCastIfNecessary(boundColumnData, boundColumn->dataType);
+    return make_pair(std::move(boundColumn), std::move(boundColumnData));
+}
+
+std::unique_ptr<BoundUpdatingClause> Binder::bindDeleteClause(
+    const UpdatingClause& updatingClause) {
+    auto& deleteClause = updatingClause.constCast<DeleteClause>();
+    auto deleteType = deleteClause.getDeleteClauseType();
+    auto boundDeleteClause = std::make_unique<BoundDeleteClause>();
+    for (auto i = 0u; i < deleteClause.getNumExpressions(); ++i) {
+        auto pattern = expressionBinder.bindExpression(*deleteClause.getExpression(i));
+        if (ExpressionUtil::isNodePattern(*pattern)) {
+            auto deleteNodeInfo = BoundDeleteInfo(deleteType, TableType::NODE, pattern);
+            auto& node = pattern->constCast<NodeExpression>();
+            auto catalog = Catalog::Get(*clientContext);
+            auto transaction = transaction::Transaction::Get(*clientContext);
+            for (auto entry : node.getEntries()) {
+                for (auto index : catalog->getIndexEntries(transaction, entry->getTableID())) {
+                    if (!index->isLoaded()) {
+                        throw BinderException(
+                            stringFormat("Trying to delete from an index on table {} but its "
+                                         "extension is not loaded.",
+                                entry->getName()));
+                    }
+                }
+            }
+            boundDeleteClause->addInfo(std::move(deleteNodeInfo));
+        } else if (ExpressionUtil::isRelPattern(*pattern)) {
+            // LCOV_EXCL_START
+            if (deleteClause.getDeleteClauseType() == DeleteNodeType::DETACH_DELETE) {
+                throw BinderException("Detach delete on rel tables is not supported.");
+            }
+            // LCOV_EXCL_STOP
+            auto rel = pattern->constPtrCast<RelExpression>();
+            if (rel->getDirectionType() == RelDirectionType::BOTH) {
+                throw BinderException("Delete undirected rel is not supported.");
+            }
+            auto deleteRel = BoundDeleteInfo(deleteType, TableType::REL, pattern);
+            boundDeleteClause->addInfo(std::move(deleteRel));
+        } else {
+            throw BinderException(stringFormat(
+                "Cannot delete expression {} with type {}. Expect node or rel pattern.",
+                pattern->toString(), ExpressionTypeUtil::toString(pattern->expressionType)));
+        }
+    }
+    return boundDeleteClause;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_use_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_use_database.cpp
new file mode 100644
index 0000000000..57dda7669d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/bind_use_database.cpp
@@ -0,0 +1,14 @@
+#include "binder/binder.h"
+#include "binder/bound_use_database.h"
+#include "parser/use_database.h"
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bindUseDatabase(const parser::Statement& statement) {
+    auto useDatabase = statement.constCast<parser::UseDatabase>();
+    return std::make_unique<BoundUseDatabase>(useDatabase.getDBName());
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/copy/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/copy/CMakeLists.txt
new file mode 100644
index 0000000000..c4b0da135d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/copy/CMakeLists.txt
@@ -0,0 +1,8 @@
+add_library(lbug_binder_bind_copy
+        OBJECT
+        bind_copy_to.cpp
+        bind_copy_from.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_bind_copy>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/copy/bind_copy_from.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/copy/bind_copy_from.cpp
new file mode 100644
index 0000000000..93a6627f7c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/copy/bind_copy_from.cpp
@@ -0,0 +1,344 @@
+#include "binder/binder.h"
+#include "binder/copy/bound_copy_from.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/index_catalog_entry.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+#include "parser/copy.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::function;
+
+namespace lbug {
+namespace binder {
+
+static void throwTableNotExist(const std::string& tableName) {
+    throw BinderException(stringFormat("Table {} does not exist.", tableName));
+}
+
+std::unique_ptr<BoundStatement> Binder::bindLegacyCopyRelGroupFrom(const Statement& statement) {
+    auto& copyFrom = statement.constCast<CopyFrom>();
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto tableName = copyFrom.getTableName();
+    auto tableNameParts = common::StringUtils::split(tableName, "_");
+    if (tableNameParts.size() != 3 || !catalog->containsTable(transaction, tableNameParts[0])) {
+        throwTableNotExist(tableName);
+    }
+    auto entry = catalog->getTableCatalogEntry(transaction, tableNameParts[0]);
+    if (entry->getType() != CatalogEntryType::REL_GROUP_ENTRY) {
+        throwTableNotExist(tableName);
+    }
+    auto relGroupEntry = entry->ptrCast<RelGroupCatalogEntry>();
+    try {
+        return bindCopyRelFrom(copyFrom, *relGroupEntry, tableNameParts[1], tableNameParts[2]);
+    } catch (Exception& e) {
+        throwTableNotExist(tableName);
+        return nullptr;
+    }
+}
+
+std::unique_ptr<BoundStatement> Binder::bindCopyFromClause(const Statement& statement) {
+    auto& copyStatement = statement.constCast<CopyFrom>();
+    auto tableName = copyStatement.getTableName();
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    if (!catalog->containsTable(transaction, tableName)) {
+        return bindLegacyCopyRelGroupFrom(statement);
+    }
+    auto tableEntry = catalog->getTableCatalogEntry(transaction, tableName);
+    switch (tableEntry->getType()) {
+    case CatalogEntryType::NODE_TABLE_ENTRY: {
+        return bindCopyNodeFrom(statement, *tableEntry->ptrCast<NodeTableCatalogEntry>());
+    }
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        auto entry = tableEntry->ptrCast<RelGroupCatalogEntry>();
+        auto properties = entry->getProperties();
+        KU_ASSERT(entry->getNumRelTables() > 0);
+        if (entry->getNumRelTables() == 1) {
+            auto fromToNodePair = entry->getSingleRelEntryInfo().nodePair;
+            auto fromTable = catalog->getTableCatalogEntry(transaction, fromToNodePair.srcTableID);
+            auto toTable = catalog->getTableCatalogEntry(transaction, fromToNodePair.dstTableID);
+            return bindCopyRelFrom(statement, *entry, fromTable->getName(), toTable->getName());
+        } else {
+            auto options = bindParsingOptions(copyStatement.getParsingOptions());
+            if (!options.contains(CopyConstants::FROM_OPTION_NAME) ||
+                !options.contains(CopyConstants::TO_OPTION_NAME)) {
+                throw BinderException(stringFormat(
+                    "The table {} has multiple FROM and TO pairs defined in the schema. A "
+                    "specific pair of FROM and TO options is expected when copying data "
+                    "into "
+                    "the {} table.",
+                    tableName, tableName));
+            }
+            auto from = options.at(CopyConstants::FROM_OPTION_NAME).getValue<std::string>();
+            auto to = options.at(CopyConstants::TO_OPTION_NAME).getValue<std::string>();
+            return bindCopyRelFrom(statement, *entry, from, to);
+        }
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+static void bindExpectedNodeColumns(const NodeTableCatalogEntry& entry,
+    const CopyFromColumnInfo& info, std::vector<std::string>& columnNames,
+    std::vector<LogicalType>& columnTypes);
+static void bindExpectedRelColumns(const RelGroupCatalogEntry& entry,
+    const NodeTableCatalogEntry& fromEntry, const NodeTableCatalogEntry& toEntry,
+    const CopyFromColumnInfo& info, std::vector<std::string>& columnNames,
+    std::vector<LogicalType>& columnTypes);
+
+static std::pair<ColumnEvaluateType, std::shared_ptr<Expression>> matchColumnExpression(
+    const expression_vector& columns, const PropertyDefinition& property,
+    ExpressionBinder& expressionBinder) {
+    for (auto& column : columns) {
+        if (property.getName() == column->toString()) {
+            if (column->dataType == property.getType()) {
+                return {ColumnEvaluateType::REFERENCE, column};
+            } else {
+                return {ColumnEvaluateType::CAST,
+                    expressionBinder.forceCast(column, property.getType())};
+            }
+        }
+    }
+    return {ColumnEvaluateType::DEFAULT, expressionBinder.bindExpression(*property.defaultExpr)};
+}
+
+BoundCopyFromInfo Binder::bindCopyNodeFromInfo(std::string tableName,
+    const std::vector<PropertyDefinition>& properties, const BaseScanSource* source,
+    const options_t& parsingOptions, const std::vector<std::string>& expectedColumnNames,
+    const std::vector<LogicalType>& expectedColumnTypes, bool byColumn) {
+    auto boundSource =
+        bindScanSource(source, parsingOptions, expectedColumnNames, expectedColumnTypes);
+    expression_vector warningDataExprs = boundSource->getWarningColumns();
+    if (boundSource->type == ScanSourceType::FILE) {
+        auto bindData = boundSource->constCast<BoundTableScanSource>()
+                            .info.bindData->constPtrCast<ScanFileBindData>();
+        if (byColumn && bindData->fileScanInfo.fileTypeInfo.fileType != FileType::NPY) {
+            throw BinderException(stringFormat("Copy by column with {} file type is not supported.",
+                bindData->fileScanInfo.fileTypeInfo.fileTypeStr));
+        }
+    }
+    expression_vector columns;
+    std::vector<ColumnEvaluateType> evaluateTypes;
+    for (auto& property : properties) {
+        auto [evaluateType, column] =
+            matchColumnExpression(boundSource->getColumns(), property, expressionBinder);
+        columns.push_back(column);
+        evaluateTypes.push_back(evaluateType);
+    }
+    columns.insert(columns.end(), warningDataExprs.begin(), warningDataExprs.end());
+    auto offset =
+        createInvisibleVariable(std::string(InternalKeyword::ROW_OFFSET), LogicalType::INT64());
+    return BoundCopyFromInfo(tableName, TableType::NODE, std::move(boundSource), std::move(offset),
+        std::move(columns), std::move(evaluateTypes), nullptr /* extraInfo */);
+}
+
+std::unique_ptr<BoundStatement> Binder::bindCopyNodeFrom(const Statement& statement,
+    NodeTableCatalogEntry& nodeTableEntry) {
+    auto& copyStatement = statement.constCast<CopyFrom>();
+    // Check extension secondary index loaded
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    for (auto indexEntry : catalog->getIndexEntries(transaction, nodeTableEntry.getTableID())) {
+        if (!indexEntry->isLoaded()) {
+            throw BinderException(stringFormat(
+                "Trying to insert into an index on table {} but its extension is not loaded.",
+                nodeTableEntry.getName()));
+        }
+    }
+    // Bind expected columns based on catalog information.
+    std::vector<std::string> expectedColumnNames;
+    std::vector<LogicalType> expectedColumnTypes;
+    bindExpectedNodeColumns(nodeTableEntry, copyStatement.getCopyColumnInfo(), expectedColumnNames,
+        expectedColumnTypes);
+    auto boundCopyFromInfo =
+        bindCopyNodeFromInfo(nodeTableEntry.getName(), nodeTableEntry.getProperties(),
+            copyStatement.getSource(), copyStatement.getParsingOptions(), expectedColumnNames,
+            expectedColumnTypes, copyStatement.byColumn());
+    return std::make_unique<BoundCopyFrom>(std::move(boundCopyFromInfo));
+}
+
+static options_t getScanSourceOptions(const CopyFrom& copyFrom) {
+    options_t options;
+    static case_insensitve_set_t copyFromPairsOptions = {CopyConstants::FROM_OPTION_NAME,
+        CopyConstants::TO_OPTION_NAME};
+    for (auto& option : copyFrom.getParsingOptions()) {
+        if (copyFromPairsOptions.contains(option.first)) {
+            continue;
+        }
+        options.emplace(option.first, option.second->copy());
+    }
+    return options;
+}
+
+BoundCopyFromInfo Binder::bindCopyRelFromInfo(std::string tableName,
+    const std::vector<PropertyDefinition>& properties, const BaseScanSource* source,
+    const options_t& parsingOptions, const std::vector<std::string>& expectedColumnNames,
+    const std::vector<LogicalType>& expectedColumnTypes, const NodeTableCatalogEntry* fromTable,
+    const NodeTableCatalogEntry* toTable) {
+    auto boundSource =
+        bindScanSource(source, parsingOptions, expectedColumnNames, expectedColumnTypes);
+    expression_vector warningDataExprs = boundSource->getWarningColumns();
+    auto columns = boundSource->getColumns();
+    auto offset =
+        createInvisibleVariable(std::string(InternalKeyword::ROW_OFFSET), LogicalType::INT64());
+    auto srcOffset = createVariable(std::string(InternalKeyword::SRC_OFFSET), LogicalType::INT64());
+    auto dstOffset = createVariable(std::string(InternalKeyword::DST_OFFSET), LogicalType::INT64());
+    expression_vector columnExprs{srcOffset, dstOffset, offset};
+    std::vector<ColumnEvaluateType> evaluateTypes{ColumnEvaluateType::REFERENCE,
+        ColumnEvaluateType::REFERENCE, ColumnEvaluateType::REFERENCE};
+    for (auto i = 1u; i < properties.size(); ++i) { // skip internal ID
+        auto& property = properties[i];
+        auto [evaluateType, column] =
+            matchColumnExpression(boundSource->getColumns(), property, expressionBinder);
+        columnExprs.push_back(column);
+        evaluateTypes.push_back(evaluateType);
+    }
+    columnExprs.insert(columnExprs.end(), warningDataExprs.begin(), warningDataExprs.end());
+    std::shared_ptr<Expression> srcKey = nullptr, dstKey = nullptr;
+    if (expectedColumnTypes[0] != columns[0]->getDataType()) {
+        srcKey = expressionBinder.forceCast(columns[0], expectedColumnTypes[0]);
+    } else {
+        srcKey = columns[0];
+    }
+    if (expectedColumnTypes[1] != columns[1]->getDataType()) {
+        dstKey = expressionBinder.forceCast(columns[1], expectedColumnTypes[1]);
+    } else {
+        dstKey = columns[1];
+    }
+    auto srcLookUpInfo =
+        IndexLookupInfo(fromTable->getTableID(), srcOffset, srcKey, warningDataExprs);
+    auto dstLookUpInfo =
+        IndexLookupInfo(toTable->getTableID(), dstOffset, dstKey, warningDataExprs);
+    auto lookupInfos = std::vector<IndexLookupInfo>{srcLookUpInfo, dstLookUpInfo};
+    auto internalIDColumnIndices = std::vector<idx_t>{0, 1, 2};
+    auto extraCopyRelInfo = std::make_unique<ExtraBoundCopyRelInfo>(fromTable->getName(),
+        toTable->getName(), internalIDColumnIndices, lookupInfos);
+    return BoundCopyFromInfo(tableName, TableType::REL, boundSource->copy(), offset,
+        std::move(columnExprs), std::move(evaluateTypes), std::move(extraCopyRelInfo));
+}
+
+std::unique_ptr<BoundStatement> Binder::bindCopyRelFrom(const Statement& statement,
+    RelGroupCatalogEntry& relGroupEntry, const std::string& fromTableName,
+    const std::string& toTableName) {
+    auto& copyStatement = statement.constCast<CopyFrom>();
+    if (copyStatement.byColumn()) {
+        throw BinderException(
+            stringFormat("Copy by column is not supported for relationship table."));
+    }
+    // Bind from to tables
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto fromTable =
+        catalog->getTableCatalogEntry(transaction, fromTableName)->ptrCast<NodeTableCatalogEntry>();
+    auto toTable =
+        catalog->getTableCatalogEntry(transaction, toTableName)->ptrCast<NodeTableCatalogEntry>();
+    auto relInfo = relGroupEntry.getRelEntryInfo(fromTable->getTableID(), toTable->getTableID());
+    if (relInfo == nullptr) {
+        throw BinderException(stringFormat("Rel table {} does not contain {}-{} from-to pair.",
+            relGroupEntry.getName(), fromTable->getName(), toTable->getName()));
+    }
+    // Bind expected columns based on catalog information.
+    std::vector<std::string> expectedColumnNames;
+    std::vector<LogicalType> expectedColumnTypes;
+    bindExpectedRelColumns(relGroupEntry, *fromTable, *toTable, copyStatement.getCopyColumnInfo(),
+        expectedColumnNames, expectedColumnTypes);
+    // Bind info
+    auto boundCopyFromInfo =
+        bindCopyRelFromInfo(relGroupEntry.getName(), relGroupEntry.getProperties(),
+            copyStatement.getSource(), getScanSourceOptions(copyStatement), expectedColumnNames,
+            expectedColumnTypes, fromTable, toTable);
+    return std::make_unique<BoundCopyFrom>(std::move(boundCopyFromInfo));
+}
+
+static bool skipPropertyInFile(const PropertyDefinition& property) {
+    if (property.getName() == InternalKeyword::ID) {
+        return true;
+    }
+    return false;
+}
+
+static bool skipPropertyInSchema(const PropertyDefinition& property) {
+    if (property.getType().getLogicalTypeID() == LogicalTypeID::SERIAL) {
+        return true;
+    }
+    if (property.getName() == InternalKeyword::ID) {
+        return true;
+    }
+    return false;
+}
+
+static void bindExpectedColumns(const TableCatalogEntry& entry, const CopyFromColumnInfo& info,
+    std::vector<std::string>& columnNames, std::vector<LogicalType>& columnTypes) {
+    if (info.inputColumnOrder) {
+        std::unordered_set<std::string> inputColumnNamesSet;
+        for (auto& columName : info.columnNames) {
+            if (inputColumnNamesSet.contains(columName)) {
+                throw BinderException(
+                    stringFormat("Detect duplicate column name {} during COPY.", columName));
+            }
+            inputColumnNamesSet.insert(columName);
+        }
+        // Search column data type for each input column.
+        for (auto& columnName : info.columnNames) {
+            if (!entry.containsProperty(columnName)) {
+                throw BinderException(stringFormat("Table {} does not contain column {}.",
+                    entry.getName(), columnName));
+            }
+            auto& property = entry.getProperty(columnName);
+            if (skipPropertyInFile(property)) {
+                continue;
+            }
+            columnNames.push_back(columnName);
+            columnTypes.push_back(property.getType().copy());
+        }
+    } else {
+        // No column specified. Fall back to schema columns.
+        for (auto& property : entry.getProperties()) {
+            if (skipPropertyInSchema(property)) {
+                continue;
+            }
+            columnNames.push_back(property.getName());
+            columnTypes.push_back(property.getType().copy());
+        }
+    }
+}
+
+void bindExpectedNodeColumns(const NodeTableCatalogEntry& entry, const CopyFromColumnInfo& info,
+    std::vector<std::string>& columnNames, std::vector<LogicalType>& columnTypes) {
+    KU_ASSERT(columnNames.empty() && columnTypes.empty());
+    bindExpectedColumns(entry, info, columnNames, columnTypes);
+}
+
+void bindExpectedRelColumns(const RelGroupCatalogEntry& entry,
+    const NodeTableCatalogEntry& fromEntry, const NodeTableCatalogEntry& toEntry,
+    const CopyFromColumnInfo& info, std::vector<std::string>& columnNames,
+    std::vector<LogicalType>& columnTypes) {
+    KU_ASSERT(columnNames.empty() && columnTypes.empty());
+    columnNames.push_back("from");
+    columnNames.push_back("to");
+    auto srcPKColumnType = fromEntry.getPrimaryKeyDefinition().getType().copy();
+    if (srcPKColumnType.getLogicalTypeID() == LogicalTypeID::SERIAL) {
+        srcPKColumnType = LogicalType::INT64();
+    }
+    auto dstPKColumnType = toEntry.getPrimaryKeyDefinition().getType().copy();
+    if (dstPKColumnType.getLogicalTypeID() == LogicalTypeID::SERIAL) {
+        dstPKColumnType = LogicalType::INT64();
+    }
+    columnTypes.push_back(std::move(srcPKColumnType));
+    columnTypes.push_back(std::move(dstPKColumnType));
+    bindExpectedColumns(entry, info, columnNames, columnTypes);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/copy/bind_copy_to.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/copy/bind_copy_to.cpp
new file mode 100644
index 0000000000..97bb97da61
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/copy/bind_copy_to.cpp
@@ -0,0 +1,48 @@
+#include "binder/binder.h"
+#include "binder/copy/bound_copy_to.h"
+#include "catalog/catalog.h"
+#include "common/exception/catalog.h"
+#include "common/exception/runtime.h"
+#include "function/built_in_function_utils.h"
+#include "parser/copy.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bindCopyToClause(const Statement& statement) {
+    auto& copyToStatement = statement.constCast<CopyTo>();
+    auto boundFilePath = copyToStatement.getFilePath();
+    auto fileTypeInfo = bindFileTypeInfo({boundFilePath});
+    std::vector<std::string> columnNames;
+    auto parsedQuery = copyToStatement.getStatement();
+    auto query = bindQuery(*parsedQuery);
+    auto columns = query->getStatementResult()->getColumns();
+    auto fileTypeStr = fileTypeInfo.fileTypeStr;
+    auto name = stringFormat("COPY_{}", fileTypeStr);
+    catalog::CatalogEntry* entry = nullptr;
+    try {
+        entry = catalog::Catalog::Get(*clientContext)
+                    ->getFunctionEntry(transaction::Transaction::Get(*clientContext), name);
+    } catch (CatalogException& exception) {
+        throw RuntimeException{common::stringFormat(
+            "Exporting query result to the '{}' file is currently not supported.", fileTypeStr)};
+    }
+    auto exportFunc = function::BuiltInFunctionsUtils::matchFunction(name,
+        entry->ptrCast<catalog::FunctionCatalogEntry>())
+                          ->constPtrCast<function::ExportFunction>();
+    for (auto& column : columns) {
+        auto columnName = column->hasAlias() ? column->getAlias() : column->toString();
+        columnNames.push_back(columnName);
+    }
+    function::ExportFuncBindInput bindInput{std::move(columnNames), std::move(boundFilePath),
+        bindParsingOptions(copyToStatement.getParsingOptions())};
+    auto bindData = exportFunc->bind(bindInput);
+    return std::make_unique<BoundCopyTo>(std::move(bindData), *exportFunc, std::move(query));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/ddl/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/ddl/CMakeLists.txt
new file mode 100644
index 0000000000..e5720d33d2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/ddl/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_binder_bind_ddl
+        OBJECT
+        bound_create_table_info.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_bind_ddl>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/ddl/bound_create_table_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/ddl/bound_create_table_info.cpp
new file mode 100644
index 0000000000..a777a1fb31
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/ddl/bound_create_table_info.cpp
@@ -0,0 +1,43 @@
+#include "binder/ddl/bound_create_table_info.h"
+
+#include "catalog/catalog_entry/catalog_entry_type.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+
+using namespace lbug::parser;
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+std::string BoundCreateTableInfo::toString() const {
+    std::string result = "";
+    switch (type) {
+    case CatalogEntryType::NODE_TABLE_ENTRY: {
+        result += "Create Node Table: ";
+        result += tableName;
+        result += ",Properties: ";
+        auto nodeInfo = extraInfo->ptrCast<BoundExtraCreateNodeTableInfo>();
+        for (auto& definition : nodeInfo->propertyDefinitions) {
+            result += definition.getName();
+            result += ", ";
+        }
+    } break;
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        result += "Create Relationship Table: ";
+        result += tableName;
+        auto relGroupInfo = extraInfo->ptrCast<BoundExtraCreateRelTableGroupInfo>();
+        result += "Properties: ";
+        for (auto& definition : relGroupInfo->propertyDefinitions) {
+            result += definition.getName();
+            result += ", ";
+        }
+    } break;
+    default:
+        break;
+    }
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/CMakeLists.txt
new file mode 100644
index 0000000000..1e7669d963
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/CMakeLists.txt
@@ -0,0 +1,10 @@
+add_library(lbug_binder_bind_read
+        OBJECT
+        bind_in_query_call.cpp
+        bind_load_from.cpp
+        bind_match.cpp
+        bind_unwind.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_bind_read>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_in_query_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_in_query_call.cpp
new file mode 100644
index 0000000000..d06581ebc6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_in_query_call.cpp
@@ -0,0 +1,45 @@
+#include "binder/binder.h"
+#include "binder/query/reading_clause/bound_table_function_call.h"
+#include "catalog/catalog.h"
+#include "common/exception/binder.h"
+#include "parser/expression/parsed_function_expression.h"
+#include "parser/query/reading_clause/in_query_call_clause.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::parser;
+using namespace lbug::function;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundReadingClause> Binder::bindInQueryCall(const ReadingClause& readingClause) {
+    auto& call = readingClause.constCast<InQueryCallClause>();
+    auto expr = call.getFunctionExpression();
+    auto functionExpr = expr->constPtrCast<ParsedFunctionExpression>();
+    auto functionName = functionExpr->getFunctionName();
+    std::unique_ptr<BoundReadingClause> boundReadingClause;
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto entry = Catalog::Get(*clientContext)->getFunctionEntry(transaction, functionName);
+    switch (entry->getType()) {
+    case CatalogEntryType::TABLE_FUNCTION_ENTRY: {
+        auto boundTableFunction =
+            bindTableFunc(functionName, *functionExpr, call.getYieldVariables());
+        boundReadingClause =
+            std::make_unique<BoundTableFunctionCall>(std::move(boundTableFunction));
+    } break;
+    default:
+        throw BinderException(
+            stringFormat("{} is not a table or algorithm function.", functionName));
+    }
+    if (call.hasWherePredicate()) {
+        auto wherePredicate = bindWhereExpression(*call.getWherePredicate());
+        boundReadingClause->setPredicate(std::move(wherePredicate));
+    }
+    return boundReadingClause;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_load_from.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_load_from.cpp
new file mode 100644
index 0000000000..6e399cae79
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_load_from.cpp
@@ -0,0 +1,64 @@
+#include "binder/binder.h"
+#include "binder/bound_scan_source.h"
+#include "binder/expression/expression_util.h"
+#include "binder/query/reading_clause/bound_load_from.h"
+#include "common/exception/binder.h"
+#include "parser/query/reading_clause/load_from.h"
+#include "parser/scan_source.h"
+
+using namespace lbug::function;
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundReadingClause> Binder::bindLoadFrom(const ReadingClause& readingClause) {
+    auto& loadFrom = readingClause.constCast<LoadFrom>();
+    auto source = loadFrom.getSource();
+    std::unique_ptr<BoundLoadFrom> boundLoadFrom;
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    for (auto& [name, type] : loadFrom.getColumnDefinitions()) {
+        columnNames.push_back(name);
+        columnTypes.push_back(LogicalType::convertFromString(type, clientContext));
+    }
+    switch (source->type) {
+    case ScanSourceType::OBJECT: {
+        auto objectSource = source->ptrCast<ObjectScanSource>();
+        auto boundScanSource = bindObjectScanSource(*objectSource, loadFrom.getParsingOptions(),
+            columnNames, columnTypes);
+        auto& scanInfo = boundScanSource->constCast<BoundTableScanSource>().info;
+        boundLoadFrom = std::make_unique<BoundLoadFrom>(scanInfo.copy());
+    } break;
+    case ScanSourceType::FILE: {
+        auto boundScanSource =
+            bindFileScanSource(*source, loadFrom.getParsingOptions(), columnNames, columnTypes);
+        auto& scanInfo = boundScanSource->constCast<BoundTableScanSource>().info;
+        boundLoadFrom = std::make_unique<BoundLoadFrom>(scanInfo.copy());
+    } break;
+    case ScanSourceType::PARAM: {
+        auto boundScanSource = bindParameterScanSource(*source, loadFrom.getParsingOptions(),
+            columnNames, columnTypes);
+        auto& scanInfo = boundScanSource->constCast<BoundTableScanSource>().info;
+        boundLoadFrom = std::make_unique<BoundLoadFrom>(scanInfo.copy());
+    } break;
+    default:
+        throw BinderException(stringFormat("LOAD FROM subquery is not supported."));
+    }
+    if (!columnTypes.empty()) {
+        auto info = boundLoadFrom->getInfo();
+        for (auto i = 0u; i < columnTypes.size(); ++i) {
+            ExpressionUtil::validateDataType(*info->bindData->columns[i], columnTypes[i]);
+        }
+    }
+    if (loadFrom.hasWherePredicate()) {
+        auto wherePredicate = bindWhereExpression(*loadFrom.getWherePredicate());
+        boundLoadFrom->setPredicate(std::move(wherePredicate));
+    }
+    return boundLoadFrom;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_match.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_match.cpp
new file mode 100644
index 0000000000..bd1a9b67e4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_match.cpp
@@ -0,0 +1,126 @@
+#include "binder/binder.h"
+#include "binder/query/reading_clause/bound_match_clause.h"
+#include "common/exception/binder.h"
+#include "parser/query/reading_clause/match_clause.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+static void collectHintPattern(const BoundJoinHintNode& node, binder::expression_set& set) {
+    if (node.isLeaf()) {
+        set.insert(node.nodeOrRel);
+        return;
+    }
+    for (auto& child : node.children) {
+        collectHintPattern(*child, set);
+    }
+}
+
+static void validateHintCompleteness(const BoundJoinHintNode& root, const QueryGraph& queryGraph) {
+    binder::expression_set set;
+    collectHintPattern(root, set);
+    for (auto& nodeOrRel : queryGraph.getAllPatterns()) {
+        if (nodeOrRel->getVariableName().empty()) {
+            throw BinderException(
+                "Cannot hint join order in a match patter with anonymous node or relationship.");
+        }
+        if (!set.contains(nodeOrRel)) {
+            throw BinderException(
+                stringFormat("Cannot find {} in join hint.", nodeOrRel->toString()));
+        }
+    }
+}
+
+std::unique_ptr<BoundReadingClause> Binder::bindMatchClause(const ReadingClause& readingClause) {
+    auto& matchClause = readingClause.constCast<MatchClause>();
+    auto boundGraphPattern = bindGraphPattern(matchClause.getPatternElementsRef());
+    if (matchClause.hasWherePredicate()) {
+        boundGraphPattern.where = bindWhereExpression(*matchClause.getWherePredicate());
+    }
+    rewriteMatchPattern(boundGraphPattern);
+    auto boundMatch = std::make_unique<BoundMatchClause>(
+        std::move(boundGraphPattern.queryGraphCollection), matchClause.getMatchClauseType());
+    if (matchClause.hasHint()) {
+        boundMatch->setHint(
+            bindJoinHint(*boundMatch->getQueryGraphCollection(), *matchClause.getHint()));
+    }
+    boundMatch->setPredicate(boundGraphPattern.where);
+    return boundMatch;
+}
+
+std::shared_ptr<BoundJoinHintNode> Binder::bindJoinHint(
+    const QueryGraphCollection& queryGraphCollection, const JoinHintNode& joinHintNode) {
+    if (queryGraphCollection.getNumQueryGraphs() > 1) {
+        throw BinderException("Join hint on disconnected match pattern is not supported.");
+    }
+    auto hint = bindJoinNode(joinHintNode);
+    validateHintCompleteness(*hint, *queryGraphCollection.getQueryGraph(0));
+    return hint;
+}
+
+std::shared_ptr<BoundJoinHintNode> Binder::bindJoinNode(const JoinHintNode& joinHintNode) {
+    if (joinHintNode.isLeaf()) {
+        std::shared_ptr<Expression> pattern = nullptr;
+        if (scope.contains(joinHintNode.variableName)) {
+            pattern = scope.getExpression(joinHintNode.variableName);
+        }
+        if (pattern == nullptr || pattern->expressionType != ExpressionType::PATTERN) {
+            throw BinderException(stringFormat("Cannot bind {} to a node or relationship pattern",
+                joinHintNode.variableName));
+        }
+        return std::make_shared<BoundJoinHintNode>(std::move(pattern));
+    }
+    auto node = std::make_shared<BoundJoinHintNode>();
+    for (auto& child : joinHintNode.children) {
+        node->addChild(bindJoinNode(*child));
+    }
+    return node;
+}
+
+void Binder::rewriteMatchPattern(BoundGraphPattern& boundGraphPattern) {
+    // Rewrite self loop edge
+    // e.g. rewrite (a)-[e]->(a) as [a]-[e]->(b) WHERE id(a) = id(b)
+    expression_vector selfLoopEdgePredicates;
+    auto& graphCollection = boundGraphPattern.queryGraphCollection;
+    for (auto i = 0u; i < graphCollection.getNumQueryGraphs(); ++i) {
+        auto queryGraph = graphCollection.getQueryGraphUnsafe(i);
+        for (auto& queryRel : queryGraph->getQueryRels()) {
+            if (!queryRel->isSelfLoop()) {
+                continue;
+            }
+            auto src = queryRel->getSrcNode();
+            auto dst = queryRel->getDstNode();
+            auto newDst = createQueryNode(dst->getVariableName(), dst->getEntries());
+            queryGraph->addQueryNode(newDst);
+            queryRel->setDstNode(newDst);
+            auto predicate = expressionBinder.createEqualityComparisonExpression(
+                src->getInternalID(), newDst->getInternalID());
+            selfLoopEdgePredicates.push_back(std::move(predicate));
+        }
+    }
+    auto where = boundGraphPattern.where;
+    for (auto& predicate : selfLoopEdgePredicates) {
+        where = expressionBinder.combineBooleanExpressions(ExpressionType::AND, predicate, where);
+    }
+    // Rewrite key value pairs in MATCH clause as predicate
+    for (auto i = 0u; i < graphCollection.getNumQueryGraphs(); ++i) {
+        auto queryGraph = graphCollection.getQueryGraphUnsafe(i);
+        for (auto& pattern : queryGraph->getAllPatterns()) {
+            for (auto& [propertyName, rhs] : pattern->getPropertyDataExprRef()) {
+                auto propertyExpr =
+                    expressionBinder.bindNodeOrRelPropertyExpression(*pattern, propertyName);
+                auto predicate =
+                    expressionBinder.createEqualityComparisonExpression(propertyExpr, rhs);
+                where = expressionBinder.combineBooleanExpressions(ExpressionType::AND, predicate,
+                    where);
+            }
+        }
+    }
+    boundGraphPattern.where = std::move(where);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_unwind.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_unwind.cpp
new file mode 100644
index 0000000000..b5d4b43b9a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind/read/bind_unwind.cpp
@@ -0,0 +1,55 @@
+#include "binder/binder.h"
+#include "binder/expression/expression_util.h"
+#include "binder/query/reading_clause/bound_unwind_clause.h"
+#include "parser/query/reading_clause/unwind_clause.h"
+
+using namespace lbug::parser;
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+// E.g. UNWIND $1. We cannot validate $1 has data type LIST until we see the actual parameter.
+static bool skipDataTypeValidation(const Expression& expr) {
+    return expr.expressionType == ExpressionType::PARAMETER &&
+           expr.getDataType().getLogicalTypeID() == LogicalTypeID::ANY;
+}
+
+std::unique_ptr<BoundReadingClause> Binder::bindUnwindClause(const ReadingClause& readingClause) {
+    auto& unwindClause = readingClause.constCast<UnwindClause>();
+    auto boundExpression = expressionBinder.bindExpression(*unwindClause.getExpression());
+    auto aliasName = unwindClause.getAlias();
+    std::shared_ptr<Expression> alias;
+    if (boundExpression->getDataType().getLogicalTypeID() == LogicalTypeID::ARRAY) {
+        auto targetType =
+            LogicalType::LIST(ArrayType::getChildType(boundExpression->dataType).copy());
+        boundExpression = expressionBinder.implicitCast(boundExpression, targetType);
+    }
+    if (!skipDataTypeValidation(*boundExpression)) {
+        if (ExpressionUtil::isNullLiteral(*boundExpression)) {
+            // For the `unwind NULL` clause, we assign the STRING[] type to the NULL literal.
+            alias = createVariable(aliasName, LogicalType::STRING());
+            boundExpression = expressionBinder.implicitCast(boundExpression,
+                LogicalType::LIST(LogicalType::STRING()));
+        } else {
+            ExpressionUtil::validateDataType(*boundExpression, LogicalTypeID::LIST);
+            boundExpression = expressionBinder.implicitCastIfNecessary(boundExpression,
+                LogicalTypeUtils::purgeAny(boundExpression->dataType, LogicalType::STRING()));
+            alias = createVariable(aliasName, ListType::getChildType(boundExpression->dataType));
+        }
+    } else {
+        alias = createVariable(aliasName, LogicalType::ANY());
+    }
+    std::shared_ptr<Expression> idExpr = nullptr;
+    if (scope.hasMemorizedTableIDs(boundExpression->getAlias())) {
+        auto entries = scope.getMemorizedTableEntries(boundExpression->getAlias());
+        auto node = createQueryNode(aliasName, entries);
+        idExpr = node->getInternalID();
+        scope.addNodeReplacement(node);
+    }
+    return make_unique<BoundUnwindClause>(std::move(boundExpression), std::move(alias),
+        std::move(idExpr));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/CMakeLists.txt
new file mode 100644
index 0000000000..d2a1a3f47c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/CMakeLists.txt
@@ -0,0 +1,18 @@
+add_library(
+        lbug_binder_bind_expression
+        OBJECT
+        bind_boolean_expression.cpp
+        bind_case_expression.cpp
+        bind_comparison_expression.cpp
+        bind_function_expression.cpp
+        bind_literal_expression.cpp
+        bind_null_operator_expression.cpp
+        bind_parameter_expression.cpp
+        bind_property_expression.cpp
+        bind_subquery_expression.cpp
+        bind_variable_expression.cpp
+        bind_lambda_expression.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_bind_expression>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_boolean_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_boolean_expression.cpp
new file mode 100644
index 0000000000..89011b1f02
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_boolean_expression.cpp
@@ -0,0 +1,57 @@
+#include "binder/expression/scalar_function_expression.h"
+#include "binder/expression_binder.h"
+#include "function/boolean/vector_boolean_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::function;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindBooleanExpression(
+    const ParsedExpression& parsedExpression) {
+    expression_vector children;
+    for (auto i = 0u; i < parsedExpression.getNumChildren(); ++i) {
+        children.push_back(bindExpression(*parsedExpression.getChild(i)));
+    }
+    return bindBooleanExpression(parsedExpression.getExpressionType(), children);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindBooleanExpression(ExpressionType expressionType,
+    const expression_vector& children) {
+    expression_vector childrenAfterCast;
+    std::vector<LogicalTypeID> inputTypeIDs;
+    for (auto& child : children) {
+        childrenAfterCast.push_back(implicitCastIfNecessary(child, LogicalType::BOOL()));
+        inputTypeIDs.push_back(LogicalTypeID::BOOL);
+    }
+    auto functionName = ExpressionTypeUtil::toString(expressionType);
+    scalar_func_exec_t execFunc;
+    VectorBooleanFunction::bindExecFunction(expressionType, childrenAfterCast, execFunc);
+    scalar_func_select_t selectFunc;
+    VectorBooleanFunction::bindSelectFunction(expressionType, childrenAfterCast, selectFunc);
+    auto bindData = std::make_unique<FunctionBindData>(LogicalType::BOOL());
+    auto uniqueExpressionName =
+        ScalarFunctionExpression::getUniqueName(functionName, childrenAfterCast);
+    auto func = std::make_unique<ScalarFunction>(functionName, inputTypeIDs, LogicalTypeID::BOOL,
+        execFunc, selectFunc);
+    return std::make_shared<ScalarFunctionExpression>(expressionType, std::move(func),
+        std::move(bindData), std::move(childrenAfterCast), uniqueExpressionName);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::combineBooleanExpressions(
+    ExpressionType expressionType, std::shared_ptr<Expression> left,
+    std::shared_ptr<Expression> right) {
+    if (left == nullptr) {
+        return right;
+    } else if (right == nullptr) {
+        return left;
+    } else {
+        return bindBooleanExpression(expressionType,
+            expression_vector{std::move(left), std::move(right)});
+    }
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_case_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_case_expression.cpp
new file mode 100644
index 0000000000..695c5fb895
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_case_expression.cpp
@@ -0,0 +1,75 @@
+#include "binder/binder.h"
+#include "binder/expression/case_expression.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression_binder.h"
+#include "parser/expression/parsed_case_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindCaseExpression(
+    const ParsedExpression& parsedExpression) {
+    auto& parsedCaseExpression = parsedExpression.constCast<ParsedCaseExpression>();
+    auto resultType = LogicalType::ANY();
+    // Resolve result type by checking each then expression type.
+    for (auto i = 0u; i < parsedCaseExpression.getNumCaseAlternative(); ++i) {
+        auto alternative = parsedCaseExpression.getCaseAlternative(i);
+        auto boundThen = bindExpression(*alternative->thenExpression);
+        if (boundThen->getDataType().getLogicalTypeID() != LogicalTypeID::ANY) {
+            resultType = boundThen->getDataType().copy();
+        }
+    }
+    // Resolve result type by else expression if above resolving fails.
+    if (resultType.getLogicalTypeID() == LogicalTypeID::ANY &&
+        parsedCaseExpression.hasElseExpression()) {
+        auto elseExpression = bindExpression(*parsedCaseExpression.getElseExpression());
+        resultType = elseExpression->getDataType().copy();
+    }
+    auto name = binder->getUniqueExpressionName(parsedExpression.getRawName());
+    // bind ELSE ...
+    std::shared_ptr<Expression> elseExpression;
+    if (parsedCaseExpression.hasElseExpression()) {
+        elseExpression = bindExpression(*parsedCaseExpression.getElseExpression());
+    } else {
+        elseExpression = createNullLiteralExpression();
+    }
+    elseExpression = implicitCastIfNecessary(elseExpression, resultType);
+    auto boundCaseExpression =
+        make_shared<CaseExpression>(resultType.copy(), std::move(elseExpression), name);
+    // bind WHEN ... THEN ...
+    if (parsedCaseExpression.hasCaseExpression()) {
+        auto boundCase = bindExpression(*parsedCaseExpression.getCaseExpression());
+        for (auto i = 0u; i < parsedCaseExpression.getNumCaseAlternative(); ++i) {
+            auto caseAlternative = parsedCaseExpression.getCaseAlternative(i);
+            auto boundWhen = bindExpression(*caseAlternative->whenExpression);
+            boundWhen = implicitCastIfNecessary(boundWhen, boundCase->dataType);
+            // rewrite "CASE a.age WHEN 1" as "CASE WHEN a.age = 1"
+            if (ExpressionUtil::isNullLiteral(*boundWhen)) {
+                boundWhen = bindNullOperatorExpression(ExpressionType::IS_NULL,
+                    expression_vector{boundWhen});
+            } else {
+                boundWhen = bindComparisonExpression(ExpressionType::EQUALS,
+                    expression_vector{boundCase, boundWhen});
+            }
+            auto boundThen = bindExpression(*caseAlternative->thenExpression);
+            boundThen = implicitCastIfNecessary(boundThen, resultType);
+            boundCaseExpression->addCaseAlternative(boundWhen, boundThen);
+        }
+    } else {
+        for (auto i = 0u; i < parsedCaseExpression.getNumCaseAlternative(); ++i) {
+            auto caseAlternative = parsedCaseExpression.getCaseAlternative(i);
+            auto boundWhen = bindExpression(*caseAlternative->whenExpression);
+            boundWhen = implicitCastIfNecessary(boundWhen, LogicalType::BOOL());
+            auto boundThen = bindExpression(*caseAlternative->thenExpression);
+            boundThen = implicitCastIfNecessary(boundThen, resultType);
+            boundCaseExpression->addCaseAlternative(boundWhen, boundThen);
+        }
+    }
+    return boundCaseExpression;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_comparison_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_comparison_expression.cpp
new file mode 100644
index 0000000000..db1576e31c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_comparison_expression.cpp
@@ -0,0 +1,96 @@
+#include "binder/binder.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression/scalar_function_expression.h"
+#include "binder/expression_binder.h"
+#include "catalog/catalog.h"
+#include "common/exception/binder.h"
+#include "function/built_in_function_utils.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::parser;
+using namespace lbug::function;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindComparisonExpression(
+    const ParsedExpression& parsedExpression) {
+    expression_vector children;
+    for (auto i = 0u; i < parsedExpression.getNumChildren(); ++i) {
+        auto child = bindExpression(*parsedExpression.getChild(i));
+        children.push_back(std::move(child));
+    }
+    return bindComparisonExpression(parsedExpression.getExpressionType(), children);
+}
+
+static bool isNodeOrRel(const Expression& expression) {
+    switch (expression.getDataType().getLogicalTypeID()) {
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+        return true;
+    default:
+        return false;
+    }
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindComparisonExpression(
+    ExpressionType expressionType, const expression_vector& children) {
+    // Rewrite node or rel comparison
+    KU_ASSERT(children.size() == 2);
+    if (isNodeOrRel(*children[0]) && isNodeOrRel(*children[1])) {
+        expression_vector newChildren;
+        newChildren.push_back(children[0]->constCast<NodeOrRelExpression>().getInternalID());
+        newChildren.push_back(children[1]->constCast<NodeOrRelExpression>().getInternalID());
+        return bindComparisonExpression(expressionType, newChildren);
+    }
+
+    auto catalog = Catalog::Get(*context);
+    auto transaction = transaction::Transaction::Get(*context);
+    auto functionName = ExpressionTypeUtil::toString(expressionType);
+    LogicalType combinedType(LogicalTypeID::ANY);
+    if (!ExpressionUtil::tryCombineDataType(children, combinedType)) {
+        throw BinderException(stringFormat("Type Mismatch: Cannot compare types {} and {}",
+            children[0]->dataType.toString(), children[1]->dataType.toString()));
+    }
+    if (combinedType.getLogicalTypeID() == LogicalTypeID::ANY) {
+        combinedType = LogicalType(LogicalTypeID::INT8);
+    }
+    std::vector<LogicalType> childrenTypes;
+    for (auto i = 0u; i < children.size(); i++) {
+        childrenTypes.push_back(combinedType.copy());
+    }
+    auto entry =
+        catalog->getFunctionEntry(transaction, functionName)->ptrCast<FunctionCatalogEntry>();
+    auto function = BuiltInFunctionsUtils::matchFunction(functionName, childrenTypes, entry)
+                        ->ptrCast<ScalarFunction>();
+    expression_vector childrenAfterCast;
+    for (auto i = 0u; i < children.size(); ++i) {
+        if (children[i]->dataType != combinedType) {
+            childrenAfterCast.push_back(forceCast(children[i], combinedType));
+        } else {
+            childrenAfterCast.push_back(children[i]);
+        }
+    }
+    if (function->bindFunc) {
+        // Resolve exec and select function if necessary
+        // Only used for decimal at the moment. See `bindDecimalCompare`.
+        function->bindFunc({childrenAfterCast, function, nullptr,
+            std::vector<std::string>{} /* optionalParams */});
+    }
+    auto bindData = std::make_unique<FunctionBindData>(LogicalType(function->returnTypeID));
+    auto uniqueExpressionName =
+        ScalarFunctionExpression::getUniqueName(function->name, childrenAfterCast);
+    return std::make_shared<ScalarFunctionExpression>(expressionType, function->copy(),
+        std::move(bindData), std::move(childrenAfterCast), uniqueExpressionName);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::createEqualityComparisonExpression(
+    std::shared_ptr<Expression> left, std::shared_ptr<Expression> right) {
+    return bindComparisonExpression(ExpressionType::EQUALS,
+        expression_vector{std::move(left), std::move(right)});
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_function_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_function_expression.cpp
new file mode 100644
index 0000000000..18e11c96ea
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_function_expression.cpp
@@ -0,0 +1,215 @@
+#include "binder/binder.h"
+#include "binder/expression/aggregate_function_expression.h"
+#include "binder/expression/scalar_function_expression.h"
+#include "binder/expression_binder.h"
+#include "catalog/catalog.h"
+#include "common/exception/binder.h"
+#include "function/built_in_function_utils.h"
+#include "function/cast/vector_cast_functions.h"
+#include "function/rewrite_function.h"
+#include "function/scalar_macro_function.h"
+#include "parser/expression/parsed_expression_visitor.h"
+#include "parser/expression/parsed_function_expression.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::function;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindFunctionExpression(const ParsedExpression& expr) {
+    auto funcExpr = expr.constPtrCast<ParsedFunctionExpression>();
+    auto functionName = funcExpr->getNormalizedFunctionName();
+    auto transaction = transaction::Transaction::Get(*context);
+    auto catalog = Catalog::Get(*context);
+    auto entry = catalog->getFunctionEntry(transaction, functionName);
+    switch (entry->getType()) {
+    case CatalogEntryType::SCALAR_FUNCTION_ENTRY:
+        return bindScalarFunctionExpression(expr, functionName);
+    case CatalogEntryType::REWRITE_FUNCTION_ENTRY:
+        return bindRewriteFunctionExpression(expr);
+    case CatalogEntryType::AGGREGATE_FUNCTION_ENTRY:
+        return bindAggregateFunctionExpression(expr, functionName, funcExpr->getIsDistinct());
+    case CatalogEntryType::SCALAR_MACRO_ENTRY:
+        return bindMacroExpression(expr, functionName);
+    default:
+        throw BinderException(
+            stringFormat("{} is a {}. Scalar function, aggregate function or macro was expected. ",
+                functionName, CatalogEntryTypeUtils::toString(entry->getType())));
+    }
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindScalarFunctionExpression(
+    const ParsedExpression& parsedExpression, const std::string& functionName) {
+    expression_vector children;
+    for (auto i = 0u; i < parsedExpression.getNumChildren(); ++i) {
+        auto expr = bindExpression(*parsedExpression.getChild(i));
+        if (parsedExpression.getChild(i)->hasAlias()) {
+            expr->setAlias(parsedExpression.getChild(i)->getAlias());
+        }
+        children.push_back(expr);
+    }
+    return bindScalarFunctionExpression(children, functionName,
+        parsedExpression.constCast<ParsedFunctionExpression>().getOptionalArguments());
+}
+
+static std::vector<LogicalType> getTypes(const expression_vector& exprs) {
+    std::vector<LogicalType> result;
+    for (auto& expr : exprs) {
+        result.push_back(expr->getDataType().copy());
+    }
+    return result;
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindScalarFunctionExpression(
+    const expression_vector& children, const std::string& functionName,
+    std::vector<std::string> optionalArguments) {
+    auto catalog = Catalog::Get(*context);
+    auto transaction = transaction::Transaction::Get(*context);
+    auto childrenTypes = getTypes(children);
+
+    auto entry = catalog->getFunctionEntry(transaction, functionName);
+
+    auto function = BuiltInFunctionsUtils::matchFunction(functionName, childrenTypes,
+        entry->ptrCast<FunctionCatalogEntry>())
+                        ->ptrCast<ScalarFunction>()
+                        ->copy();
+    if (children.size() == 2 && children[1]->expressionType == ExpressionType::LAMBDA) {
+        if (!function->isListLambda) {
+            throw BinderException(stringFormat("{} does not support lambda input.", functionName));
+        }
+        bindLambdaExpression(*children[0], *children[1]);
+    }
+    expression_vector childrenAfterCast;
+    std::unique_ptr<FunctionBindData> bindData;
+    auto bindInput =
+        ScalarBindFuncInput{children, function.get(), context, std::move(optionalArguments)};
+    if (functionName == CastAnyFunction::name) {
+        bindData = function->bindFunc(bindInput);
+        if (bindData == nullptr) { // No need to cast.
+            // TODO(Xiyang): We should return a deep copy otherwise the same expression might
+            // appear in the final projection list repeatedly.
+            // E.g. RETURN cast([NULL], "INT64[1][]"), cast([NULL], "INT64[1][][]")
+            return children[0];
+        }
+        auto childAfterCast = children[0];
+        if (children[0]->getDataType().getLogicalTypeID() == LogicalTypeID::ANY) {
+            childAfterCast = implicitCastIfNecessary(children[0], LogicalType::STRING());
+        }
+        childrenAfterCast.push_back(std::move(childAfterCast));
+    } else {
+        if (function->bindFunc) {
+            bindData = function->bindFunc(bindInput);
+        } else {
+            bindData = std::make_unique<FunctionBindData>(LogicalType(function->returnTypeID));
+        }
+        if (!bindData->paramTypes.empty()) {
+            for (auto i = 0u; i < children.size(); ++i) {
+                childrenAfterCast.push_back(
+                    implicitCastIfNecessary(children[i], bindData->paramTypes[i]));
+            }
+        } else {
+            for (auto i = 0u; i < children.size(); ++i) {
+                auto id = function->isVarLength ? function->parameterTypeIDs[0] :
+                                                  function->parameterTypeIDs[i];
+                auto type = LogicalType(id);
+                childrenAfterCast.push_back(implicitCastIfNecessary(children[i], type));
+            }
+        }
+    }
+    auto uniqueExpressionName =
+        ScalarFunctionExpression::getUniqueName(function->name, childrenAfterCast);
+    return std::make_shared<ScalarFunctionExpression>(ExpressionType::FUNCTION, std::move(function),
+        std::move(bindData), std::move(childrenAfterCast), uniqueExpressionName);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindRewriteFunctionExpression(
+    const ParsedExpression& expr) {
+    auto& funcExpr = expr.constCast<ParsedFunctionExpression>();
+    expression_vector children;
+    for (auto i = 0u; i < expr.getNumChildren(); ++i) {
+        children.push_back(bindExpression(*expr.getChild(i)));
+    }
+    auto childrenTypes = getTypes(children);
+    auto functionName = funcExpr.getNormalizedFunctionName();
+    auto transaction = transaction::Transaction::Get(*context);
+    auto entry = Catalog::Get(*context)->getFunctionEntry(transaction, functionName);
+    auto match = BuiltInFunctionsUtils::matchFunction(functionName, childrenTypes,
+        entry->ptrCast<FunctionCatalogEntry>());
+    auto function = match->constPtrCast<RewriteFunction>();
+    KU_ASSERT(function->rewriteFunc != nullptr);
+    auto input = RewriteFunctionBindInput(context, this, children);
+    return function->rewriteFunc(input);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindAggregateFunctionExpression(
+    const ParsedExpression& parsedExpression, const std::string& functionName, bool isDistinct) {
+    std::vector<LogicalType> childrenTypes;
+    expression_vector children;
+    for (auto i = 0u; i < parsedExpression.getNumChildren(); ++i) {
+        auto child = bindExpression(*parsedExpression.getChild(i));
+        childrenTypes.push_back(child->dataType.copy());
+        children.push_back(std::move(child));
+    }
+    auto transaction = transaction::Transaction::Get(*context);
+    auto entry = Catalog::Get(*context)->getFunctionEntry(transaction, functionName);
+    auto function = BuiltInFunctionsUtils::matchAggregateFunction(functionName, childrenTypes,
+        isDistinct, entry->ptrCast<FunctionCatalogEntry>())
+                        ->copy();
+    if (function.paramRewriteFunc) {
+        function.paramRewriteFunc(children);
+    }
+    if (functionName == CollectFunction::name && parsedExpression.hasAlias() &&
+        children[0]->getDataType().getLogicalTypeID() == LogicalTypeID::NODE) {
+        auto& node = children[0]->constCast<NodeExpression>();
+        binder->scope.memorizeTableEntries(parsedExpression.getAlias(), node.getEntries());
+    }
+    auto uniqueExpressionName =
+        AggregateFunctionExpression::getUniqueName(function.name, children, function.isDistinct);
+    if (children.empty()) {
+        uniqueExpressionName = binder->getUniqueExpressionName(uniqueExpressionName);
+    }
+    std::unique_ptr<FunctionBindData> bindData;
+    if (function.bindFunc) {
+        auto bindInput = ScalarBindFuncInput{children, &function, context,
+            std::vector<std::string>{} /* optionalParams */};
+        bindData = function.bindFunc(bindInput);
+    } else {
+        bindData = std::make_unique<FunctionBindData>(LogicalType(function.returnTypeID));
+    }
+    return std::make_shared<AggregateFunctionExpression>(std::move(function), std::move(bindData),
+        std::move(children), uniqueExpressionName);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindMacroExpression(
+    const ParsedExpression& parsedExpression, const std::string& macroName) {
+    auto transaction = transaction::Transaction::Get(*context);
+    auto scalarMacroFunction =
+        Catalog::Get(*context)->getScalarMacroFunction(transaction, macroName);
+    auto macroExpr = scalarMacroFunction->expression->copy();
+    auto parameterVals = scalarMacroFunction->getDefaultParameterVals();
+    auto& parsedFuncExpr = parsedExpression.constCast<ParsedFunctionExpression>();
+    auto positionalArgs = scalarMacroFunction->getPositionalArgs();
+    if (parsedFuncExpr.getNumChildren() > scalarMacroFunction->getNumArgs() ||
+        parsedFuncExpr.getNumChildren() < positionalArgs.size()) {
+        throw BinderException{"Invalid number of arguments for macro " + macroName + "."};
+    }
+    // Bind positional arguments.
+    for (auto i = 0u; i < positionalArgs.size(); i++) {
+        parameterVals[positionalArgs[i]] = parsedFuncExpr.getChild(i);
+    }
+    // Bind arguments with default values.
+    for (auto i = positionalArgs.size(); i < parsedFuncExpr.getNumChildren(); i++) {
+        auto parameterName =
+            scalarMacroFunction->getDefaultParameterName(i - positionalArgs.size());
+        parameterVals[parameterName] = parsedFuncExpr.getChild(i);
+    }
+    auto replacer = MacroParameterReplacer(parameterVals);
+    return bindExpression(*replacer.replace(std::move(macroExpr)));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_lambda_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_lambda_expression.cpp
new file mode 100644
index 0000000000..79ff810608
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_lambda_expression.cpp
@@ -0,0 +1,37 @@
+#include "binder/binder.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression/lambda_expression.h"
+#include "parser/expression/parsed_lambda_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+void ExpressionBinder::bindLambdaExpression(const Expression& lambdaInput,
+    Expression& lambdaExpr) const {
+    ExpressionUtil::validateDataType(lambdaInput, LogicalTypeID::LIST);
+    auto& listChildType = ListType::getChildType(lambdaInput.getDataType());
+    auto& boundLambdaExpr = lambdaExpr.cast<LambdaExpression>();
+    auto& parsedLambdaExpr =
+        boundLambdaExpr.getParsedLambdaExpr()->constCast<ParsedLambdaExpression>();
+    auto prevScope = binder->saveScope();
+    for (auto& varName : parsedLambdaExpr.getVarNames()) {
+        binder->createVariable(varName, listChildType);
+    }
+    auto funcExpr =
+        binder->getExpressionBinder()->bindExpression(*parsedLambdaExpr.getFunctionExpr());
+    binder->restoreScope(std::move(prevScope));
+    boundLambdaExpr.cast(funcExpr->getDataType().copy());
+    boundLambdaExpr.setFunctionExpr(std::move(funcExpr));
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindLambdaExpression(
+    const parser::ParsedExpression& parsedExpr) const {
+    auto uniqueName = getUniqueName(parsedExpr.getRawName());
+    return std::make_shared<LambdaExpression>(parsedExpr.copy(), uniqueName);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_literal_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_literal_expression.cpp
new file mode 100644
index 0000000000..2dd049081d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_literal_expression.cpp
@@ -0,0 +1,43 @@
+#include "binder/binder.h"
+#include "binder/expression/literal_expression.h"
+#include "binder/expression_binder.h"
+#include "parser/expression/parsed_literal_expression.h"
+
+using namespace lbug::parser;
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindLiteralExpression(
+    const ParsedExpression& parsedExpression) const {
+    auto& literalExpression = parsedExpression.constCast<ParsedLiteralExpression>();
+    auto value = literalExpression.getValue();
+    if (value.isNull()) {
+        return createNullLiteralExpression(value);
+    }
+    return createLiteralExpression(value);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::createLiteralExpression(const Value& value) const {
+    auto uniqueName = binder->getUniqueExpressionName(value.toString());
+    return std::make_unique<LiteralExpression>(value, uniqueName);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::createLiteralExpression(
+    const std::string& strVal) const {
+    return createLiteralExpression(Value(strVal));
+}
+
+std::shared_ptr<Expression> ExpressionBinder::createNullLiteralExpression() const {
+    return make_shared<LiteralExpression>(Value::createNullValue(),
+        binder->getUniqueExpressionName("NULL"));
+}
+
+std::shared_ptr<Expression> ExpressionBinder::createNullLiteralExpression(
+    const Value& value) const {
+    return make_shared<LiteralExpression>(value, binder->getUniqueExpressionName("NULL"));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_null_operator_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_null_operator_expression.cpp
new file mode 100644
index 0000000000..f6d8e48e91
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_null_operator_expression.cpp
@@ -0,0 +1,48 @@
+#include "binder/expression/scalar_function_expression.h"
+#include "binder/expression_binder.h"
+#include "function/null/vector_null_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::function;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindNullOperatorExpression(
+    const ParsedExpression& parsedExpression) {
+    expression_vector children;
+    for (auto i = 0u; i < parsedExpression.getNumChildren(); ++i) {
+        children.push_back(bindExpression(*parsedExpression.getChild(i)));
+    }
+    return bindNullOperatorExpression(parsedExpression.getExpressionType(), children);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindNullOperatorExpression(
+    ExpressionType expressionType, const expression_vector& children) {
+    expression_vector childrenAfterCast;
+    std::vector<LogicalTypeID> inputTypeIDs;
+    for (auto& child : children) {
+        inputTypeIDs.push_back(child->getDataType().getLogicalTypeID());
+        if (child->dataType.getLogicalTypeID() == LogicalTypeID::ANY) {
+            childrenAfterCast.push_back(implicitCastIfNecessary(child, LogicalType::BOOL()));
+        } else {
+            childrenAfterCast.push_back(child);
+        }
+    }
+    auto functionName = ExpressionTypeUtil::toString(expressionType);
+    function::scalar_func_exec_t execFunc;
+    function::VectorNullFunction::bindExecFunction(expressionType, childrenAfterCast, execFunc);
+    function::scalar_func_select_t selectFunc;
+    function::VectorNullFunction::bindSelectFunction(expressionType, childrenAfterCast, selectFunc);
+    auto bindData = std::make_unique<function::FunctionBindData>(LogicalType::BOOL());
+    auto uniqueExpressionName =
+        ScalarFunctionExpression::getUniqueName(functionName, childrenAfterCast);
+    auto func = std::make_unique<ScalarFunction>(functionName, inputTypeIDs, LogicalTypeID::BOOL,
+        execFunc, selectFunc);
+    return make_shared<ScalarFunctionExpression>(expressionType, std::move(func),
+        std::move(bindData), std::move(childrenAfterCast), uniqueExpressionName);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_parameter_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_parameter_expression.cpp
new file mode 100644
index 0000000000..de56757708
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_parameter_expression.cpp
@@ -0,0 +1,26 @@
+#include "binder/expression/parameter_expression.h"
+#include "binder/expression_binder.h"
+#include "common/exception/binder.h"
+#include "parser/expression/parsed_parameter_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindParameterExpression(
+    const ParsedExpression& parsedExpression) {
+    auto& parsedParameterExpression = parsedExpression.constCast<ParsedParameterExpression>();
+    auto parameterName = parsedParameterExpression.getParameterName();
+    if (knownParameters.contains(parameterName)) {
+        return make_shared<ParameterExpression>(parameterName, *knownParameters.at(parameterName));
+    }
+    // LCOV_EXCL_START
+    throw BinderException(
+        stringFormat("Cannot find parameter {}. This should not happen.", parameterName));
+    // LCOV_EXCL_STOP
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_property_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_property_expression.cpp
new file mode 100644
index 0000000000..2010a2f6cc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_property_expression.cpp
@@ -0,0 +1,124 @@
+#include "binder/binder.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression/node_rel_expression.h"
+#include "binder/expression_binder.h"
+#include "common/cast.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "function/struct/vector_struct_functions.h"
+#include "parser/expression/parsed_property_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+static bool isNodeOrRelPattern(const Expression& expression) {
+    return ExpressionUtil::isNodePattern(expression) || ExpressionUtil::isRelPattern(expression);
+}
+
+static bool isStructPattern(const Expression& expression) {
+    auto logicalTypeID = expression.getDataType().getLogicalTypeID();
+    return logicalTypeID == LogicalTypeID::NODE || logicalTypeID == LogicalTypeID::REL ||
+           logicalTypeID == LogicalTypeID::STRUCT;
+}
+
+expression_vector ExpressionBinder::bindPropertyStarExpression(
+    const parser::ParsedExpression& parsedExpression) {
+    auto child = bindExpression(*parsedExpression.getChild(0));
+    if (isNodeOrRelPattern(*child)) {
+        return bindNodeOrRelPropertyStarExpression(*child);
+    } else if (isStructPattern(*child)) {
+        return bindStructPropertyStarExpression(child);
+    } else {
+        throw BinderException(stringFormat("Cannot bind property for expression {} with type {}.",
+            child->toString(), ExpressionTypeUtil::toString(child->expressionType)));
+    }
+}
+
+expression_vector ExpressionBinder::bindNodeOrRelPropertyStarExpression(const Expression& child) {
+    expression_vector result;
+    auto& nodeOrRel = child.constCast<NodeOrRelExpression>();
+    for (auto& property : nodeOrRel.getPropertyExpressions()) {
+        if (Binder::reservedInPropertyLookup(property->getPropertyName())) {
+            continue;
+        }
+        result.push_back(property);
+    }
+    return result;
+}
+
+expression_vector ExpressionBinder::bindStructPropertyStarExpression(
+    const std::shared_ptr<Expression>& child) {
+    expression_vector result;
+    const auto& childType = child->getDataType();
+    for (auto& field : StructType::getFields(childType)) {
+        result.push_back(bindStructPropertyExpression(child, field.getName()));
+    }
+    return result;
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindPropertyExpression(
+    const ParsedExpression& parsedExpression) {
+    auto& propertyExpression = parsedExpression.constCast<ParsedPropertyExpression>();
+    if (propertyExpression.isStar()) {
+        throw BinderException(stringFormat("Cannot bind {} as a single property expression.",
+            parsedExpression.toString()));
+    }
+    auto propertyName = propertyExpression.getPropertyName();
+    auto child = bindExpression(*parsedExpression.getChild(0));
+    ExpressionUtil::validateDataType(*child,
+        std::vector<LogicalTypeID>{LogicalTypeID::NODE, LogicalTypeID::REL, LogicalTypeID::STRUCT,
+            LogicalTypeID::ANY});
+    if (config.bindOrderByAfterAggregate) {
+        // See the declaration of this field for more information.
+        return bindStructPropertyExpression(child, propertyName);
+    }
+    if (isNodeOrRelPattern(*child)) {
+        if (Binder::reservedInPropertyLookup(propertyName)) {
+            // Note we don't expose direct access to internal properties in case user tries to
+            // modify them. However, we can expose indirect read-only access through function e.g.
+            // ID().
+            throw BinderException(
+                propertyName + " is reserved for system usage. External access is not allowed.");
+        }
+        return bindNodeOrRelPropertyExpression(*child, propertyName);
+    } else if (isStructPattern(*child)) {
+        return bindStructPropertyExpression(child, propertyName);
+    } else if (child->getDataType().getLogicalTypeID() == LogicalTypeID::ANY) {
+        return createVariableExpression(LogicalType::ANY(), binder->getUniqueExpressionName(""));
+    } else {
+        throw BinderException(stringFormat("Cannot bind property for expression {} with type {}.",
+            child->toString(), ExpressionTypeUtil::toString(child->expressionType)));
+    }
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindNodeOrRelPropertyExpression(
+    const Expression& child, const std::string& propertyName) {
+    auto& nodeOrRel = child.constCast<NodeOrRelExpression>();
+    // TODO(Xiyang): we should be able to remove l97-l100 after removing propertyDataExprs from node
+    // & rel expression.
+    if (propertyName == InternalKeyword::ID &&
+        child.dataType.getLogicalTypeID() == common::LogicalTypeID::NODE) {
+        auto& node = ku_dynamic_cast<const NodeExpression&>(child);
+        return node.getInternalID();
+    }
+    if (!nodeOrRel.hasPropertyExpression(propertyName)) {
+        throw BinderException(
+            "Cannot find property " + propertyName + " for " + child.toString() + ".");
+    }
+    // We always create new object when binding expression except when referring to an existing
+    // alias when binding variables.
+    return nodeOrRel.getPropertyExpression(propertyName)->copy();
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindStructPropertyExpression(
+    std::shared_ptr<Expression> child, const std::string& propertyName) {
+    auto children = expression_vector{std::move(child), createLiteralExpression(propertyName)};
+    return bindScalarFunctionExpression(children, function::StructExtractFunctions::name);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_subquery_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_subquery_expression.cpp
new file mode 100644
index 0000000000..4e09f7bf6b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_subquery_expression.cpp
@@ -0,0 +1,74 @@
+#include "binder/binder.h"
+#include "binder/expression/aggregate_function_expression.h"
+#include "binder/expression/subquery_expression.h"
+#include "binder/expression_binder.h"
+#include "catalog/catalog.h"
+#include "common/types/value/value.h"
+#include "function/aggregate/count_star.h"
+#include "function/built_in_function_utils.h"
+#include "parser/expression/parsed_subquery_expression.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::parser;
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindSubqueryExpression(
+    const ParsedExpression& parsedExpr) {
+    auto& subqueryExpr = ku_dynamic_cast<const ParsedSubqueryExpression&>(parsedExpr);
+    auto prevScope = binder->saveScope();
+    auto boundGraphPattern = binder->bindGraphPattern(subqueryExpr.getPatternElements());
+    if (subqueryExpr.hasWhereClause()) {
+        boundGraphPattern.where = binder->bindWhereExpression(*subqueryExpr.getWhereClause());
+    }
+    binder->rewriteMatchPattern(boundGraphPattern);
+    auto subqueryType = subqueryExpr.getSubqueryType();
+    auto dataType =
+        subqueryType == SubqueryType::COUNT ? LogicalType::INT64() : LogicalType::BOOL();
+    auto rawName = subqueryExpr.getRawName();
+    auto uniqueName = binder->getUniqueExpressionName(rawName);
+    auto boundSubqueryExpr = make_shared<SubqueryExpression>(subqueryType, std::move(dataType),
+        std::move(boundGraphPattern.queryGraphCollection), uniqueName, std::move(rawName));
+    boundSubqueryExpr->setWhereExpression(boundGraphPattern.where);
+    // Bind projection
+    auto entry = catalog::Catalog::Get(*context)->getFunctionEntry(
+        transaction::Transaction::Get(*context), CountStarFunction::name);
+    auto function = BuiltInFunctionsUtils::matchAggregateFunction(CountStarFunction::name,
+        std::vector<LogicalType>{}, false, entry->ptrCast<catalog::FunctionCatalogEntry>());
+    auto bindData = std::make_unique<FunctionBindData>(LogicalType(function->returnTypeID));
+    auto countStarExpr =
+        std::make_shared<AggregateFunctionExpression>(function->copy(), std::move(bindData),
+            expression_vector{}, binder->getUniqueExpressionName(CountStarFunction::name));
+    boundSubqueryExpr->setCountStarExpr(countStarExpr);
+    std::shared_ptr<Expression> projectionExpr;
+    switch (subqueryType) {
+    case SubqueryType::COUNT: {
+        // Rewrite COUNT subquery as COUNT(*)
+        projectionExpr = countStarExpr;
+    } break;
+    case SubqueryType::EXISTS: {
+        // Rewrite EXISTS subquery as COUNT(*) > 0
+        auto literalExpr = createLiteralExpression(Value(static_cast<int64_t>(0)));
+        projectionExpr = bindComparisonExpression(ExpressionType::GREATER_THAN,
+            expression_vector{countStarExpr, literalExpr});
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    // Use the same unique identifier for projection & subquery expression. We will replace subquery
+    // expression with projection expression during processing.
+    projectionExpr->setUniqueName(uniqueName);
+    boundSubqueryExpr->setProjectionExpr(projectionExpr);
+    if (subqueryExpr.hasHint()) {
+        boundSubqueryExpr->setHint(binder->bindJoinHint(
+            *boundSubqueryExpr->getQueryGraphCollection(), *subqueryExpr.getHint()));
+    }
+    binder->restoreScope(std::move(prevScope));
+    return boundSubqueryExpr;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_variable_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_variable_expression.cpp
new file mode 100644
index 0000000000..e84fb1211e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bind_expression/bind_variable_expression.cpp
@@ -0,0 +1,41 @@
+#include "binder/binder.h"
+#include "binder/expression/variable_expression.h"
+#include "binder/expression_binder.h"
+#include "common/exception/binder.h"
+#include "common/exception/message.h"
+#include "parser/expression/parsed_variable_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindVariableExpression(
+    const ParsedExpression& parsedExpression) const {
+    auto& variableExpression = ku_dynamic_cast<const ParsedVariableExpression&>(parsedExpression);
+    auto variableName = variableExpression.getVariableName();
+    return bindVariableExpression(variableName);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::bindVariableExpression(
+    const std::string& varName) const {
+    if (binder->scope.contains(varName)) {
+        return binder->scope.getExpression(varName);
+    }
+    throw BinderException(ExceptionMessage::variableNotInScope(varName));
+}
+
+std::shared_ptr<Expression> ExpressionBinder::createVariableExpression(LogicalType logicalType,
+    std::string_view name) const {
+    return createVariableExpression(std::move(logicalType), std::string(name));
+}
+
+std::shared_ptr<Expression> ExpressionBinder::createVariableExpression(LogicalType logicalType,
+    std::string name) const {
+    return std::make_shared<VariableExpression>(std::move(logicalType),
+        binder->getUniqueExpressionName(name), std::move(name));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/binder.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/binder.cpp
new file mode 100644
index 0000000000..d3cfb679a3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/binder.cpp
@@ -0,0 +1,278 @@
+#include "binder/binder.h"
+
+#include "binder/bound_statement_rewriter.h"
+#include "catalog/catalog.h"
+#include "common/copier_config/csv_reader_config.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+#include "function/built_in_function_utils.h"
+#include "function/table/table_function.h"
+#include "parser/statement.h"
+#include "processor/operator/persistent/reader/csv/parallel_csv_reader.h"
+#include "processor/operator/persistent/reader/csv/serial_csv_reader.h"
+#include "processor/operator/persistent/reader/npy/npy_reader.h"
+#include "processor/operator/persistent/reader/parquet/parquet_reader.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::function;
+using namespace lbug::parser;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace binder {
+
+std::unique_ptr<BoundStatement> Binder::bind(const Statement& statement) {
+    std::unique_ptr<BoundStatement> boundStatement;
+    switch (statement.getStatementType()) {
+    case StatementType::CREATE_TABLE: {
+        boundStatement = bindCreateTable(statement);
+    } break;
+    case StatementType::CREATE_TYPE: {
+        boundStatement = bindCreateType(statement);
+    } break;
+    case StatementType::CREATE_SEQUENCE: {
+        boundStatement = bindCreateSequence(statement);
+    } break;
+    case StatementType::COPY_FROM: {
+        boundStatement = bindCopyFromClause(statement);
+    } break;
+    case StatementType::COPY_TO: {
+        boundStatement = bindCopyToClause(statement);
+    } break;
+    case StatementType::DROP: {
+        boundStatement = bindDrop(statement);
+    } break;
+    case StatementType::ALTER: {
+        boundStatement = bindAlter(statement);
+    } break;
+    case StatementType::QUERY: {
+        boundStatement = bindQuery(statement);
+    } break;
+    case StatementType::STANDALONE_CALL: {
+        boundStatement = bindStandaloneCall(statement);
+    } break;
+    case StatementType::STANDALONE_CALL_FUNCTION: {
+        boundStatement = bindStandaloneCallFunction(statement);
+    } break;
+    case StatementType::EXPLAIN: {
+        boundStatement = bindExplain(statement);
+    } break;
+    case StatementType::CREATE_MACRO: {
+        boundStatement = bindCreateMacro(statement);
+    } break;
+    case StatementType::TRANSACTION: {
+        boundStatement = bindTransaction(statement);
+    } break;
+    case StatementType::EXTENSION: {
+        boundStatement = bindExtension(statement);
+    } break;
+    case StatementType::EXPORT_DATABASE: {
+        boundStatement = bindExportDatabaseClause(statement);
+    } break;
+    case StatementType::IMPORT_DATABASE: {
+        boundStatement = bindImportDatabaseClause(statement);
+    } break;
+    case StatementType::ATTACH_DATABASE: {
+        boundStatement = bindAttachDatabase(statement);
+    } break;
+    case StatementType::DETACH_DATABASE: {
+        boundStatement = bindDetachDatabase(statement);
+    } break;
+    case StatementType::USE_DATABASE: {
+        boundStatement = bindUseDatabase(statement);
+    } break;
+    case StatementType::EXTENSION_CLAUSE: {
+        boundStatement = bindExtensionClause(statement);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    BoundStatementRewriter::rewrite(*boundStatement, *clientContext);
+    return boundStatement;
+}
+
+std::shared_ptr<Expression> Binder::bindWhereExpression(const ParsedExpression& parsedExpression) {
+    auto whereExpression = expressionBinder.bindExpression(parsedExpression);
+    expressionBinder.implicitCastIfNecessary(whereExpression, LogicalType::BOOL());
+    return whereExpression;
+}
+
+std::shared_ptr<Expression> Binder::createVariable(std::string_view name, LogicalTypeID typeID) {
+    return createVariable(std::string(name), LogicalType{typeID});
+}
+
+std::shared_ptr<Expression> Binder::createVariable(const std::string& name,
+    LogicalTypeID logicalTypeID) {
+    return createVariable(name, LogicalType{logicalTypeID});
+}
+
+std::shared_ptr<Expression> Binder::createVariable(const std::string& name,
+    const LogicalType& dataType) {
+    if (scope.contains(name)) {
+        throw BinderException("Variable " + name + " already exists.");
+    }
+    auto expression = expressionBinder.createVariableExpression(dataType.copy(), name);
+    expression->setAlias(name);
+    addToScope(name, expression);
+    return expression;
+}
+
+std::shared_ptr<Expression> Binder::createInvisibleVariable(const std::string& name,
+    const LogicalType& dataType) const {
+    auto expression = expressionBinder.createVariableExpression(dataType.copy(), name);
+    expression->setAlias(name);
+    return expression;
+}
+
+expression_vector Binder::createVariables(const std::vector<std::string>& names,
+    const std::vector<common::LogicalType>& types) {
+    KU_ASSERT(names.size() == types.size());
+    expression_vector variables;
+    for (auto i = 0u; i < names.size(); ++i) {
+        variables.push_back(createVariable(names[i], types[i]));
+    }
+    return variables;
+}
+
+expression_vector Binder::createInvisibleVariables(const std::vector<std::string>& names,
+    const std::vector<LogicalType>& types) const {
+    KU_ASSERT(names.size() == types.size());
+    expression_vector variables;
+    for (auto i = 0u; i < names.size(); ++i) {
+        variables.push_back(createInvisibleVariable(names[i], types[i]));
+    }
+    return variables;
+}
+
+std::string Binder::getUniqueExpressionName(const std::string& name) {
+    return "_" + std::to_string(lastExpressionId++) + "_" + name;
+}
+
+struct ReservedNames {
+    // Column name that might conflict with internal names.
+    static std::unordered_set<std::string> getColumnNames() {
+        return {
+            InternalKeyword::ID,
+            InternalKeyword::LABEL,
+            InternalKeyword::SRC,
+            InternalKeyword::DST,
+            InternalKeyword::DIRECTION,
+            InternalKeyword::LENGTH,
+            InternalKeyword::NODES,
+            InternalKeyword::RELS,
+            InternalKeyword::PLACE_HOLDER,
+            StringUtils::getUpper(InternalKeyword::ROW_OFFSET),
+            StringUtils::getUpper(InternalKeyword::SRC_OFFSET),
+            StringUtils::getUpper(InternalKeyword::DST_OFFSET),
+        };
+    }
+
+    // Properties that should be hidden from user access.
+    static std::unordered_set<std::string> getPropertyLookupName() {
+        return {
+            InternalKeyword::ID,
+        };
+    }
+};
+
+bool Binder::reservedInColumnName(const std::string& name) {
+    auto normalizedName = StringUtils::getUpper(name);
+    return ReservedNames::getColumnNames().contains(normalizedName);
+}
+
+bool Binder::reservedInPropertyLookup(const std::string& name) {
+    auto normalizedName = StringUtils::getUpper(name);
+    return ReservedNames::getPropertyLookupName().contains(normalizedName);
+}
+
+void Binder::addToScope(const std::vector<std::string>& names, const expression_vector& exprs) {
+    KU_ASSERT(names.size() == exprs.size());
+    for (auto i = 0u; i < names.size(); ++i) {
+        addToScope(names[i], exprs[i]);
+    }
+}
+
+void Binder::addToScope(const std::string& name, std::shared_ptr<Expression> expr) {
+    // TODO(Xiyang): assert name not in scope.
+    // Note to Xiyang: I don't think the TODO still stands here. I tried adding the assertion, but
+    // it failed a few tests. You may want to revisit this TODO.
+    scope.addExpression(name, std::move(expr));
+}
+
+BinderScope Binder::saveScope() const {
+    return scope.copy();
+}
+
+void Binder::restoreScope(BinderScope prevScope) {
+    scope = std::move(prevScope);
+}
+
+void Binder::replaceExpressionInScope(const std::string& oldName, const std::string& newName,
+    std::shared_ptr<Expression> expression) {
+    scope.replaceExpression(oldName, newName, expression);
+}
+
+TableFunction Binder::getScanFunction(const FileTypeInfo& typeInfo,
+    const FileScanInfo& fileScanInfo) const {
+    Function* func = nullptr;
+    std::vector<LogicalType> inputTypes;
+    inputTypes.push_back(LogicalType::STRING());
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    switch (typeInfo.fileType) {
+    case FileType::PARQUET: {
+        auto entry = catalog->getFunctionEntry(transaction, ParquetScanFunction::name);
+        func = BuiltInFunctionsUtils::matchFunction(ParquetScanFunction::name, inputTypes,
+            entry->ptrCast<FunctionCatalogEntry>());
+    } break;
+    case FileType::NPY: {
+        auto entry = catalog->getFunctionEntry(transaction, NpyScanFunction::name);
+        func = BuiltInFunctionsUtils::matchFunction(NpyScanFunction::name, inputTypes,
+            entry->ptrCast<FunctionCatalogEntry>());
+    } break;
+    case FileType::CSV: {
+        bool containCompressedCSV = std::any_of(fileScanInfo.filePaths.begin(),
+            fileScanInfo.filePaths.end(), [&](const auto& file) {
+                return VirtualFileSystem::GetUnsafe(*clientContext)->isCompressedFile(file);
+            });
+        auto csvConfig = CSVReaderConfig::construct(fileScanInfo.options);
+        // Parallel CSV scanning is only allowed:
+        // 1. No newline character inside the csv body.
+        // 2. The CSV file to scan is not compressed (because we couldn't perform seek in such
+        // case).
+        // 3. Not explicitly set by the user to use the serial csv reader.
+        auto name = (csvConfig.parallel && !containCompressedCSV) ? ParallelCSVScan::name :
+                                                                    SerialCSVScan::name;
+        auto entry = catalog->getFunctionEntry(transaction, name);
+        func = BuiltInFunctionsUtils::matchFunction(name, inputTypes,
+            entry->ptrCast<FunctionCatalogEntry>());
+    } break;
+    case FileType::UNKNOWN: {
+        try {
+            auto name = stringFormat("{}_SCAN", typeInfo.fileTypeStr);
+            auto entry = catalog->getFunctionEntry(transaction, name);
+            func = BuiltInFunctionsUtils::matchFunction(name, inputTypes,
+                entry->ptrCast<FunctionCatalogEntry>());
+        } catch (...) {
+            if (typeInfo.fileTypeStr == "") {
+                throw BinderException{"Cannot infer the format of the given file. Please "
+                                      "set the file format explicitly by (file_format=<type>)."};
+            }
+            throw BinderException{
+                stringFormat("Cannot load from file type {}. If this file type is part of a lbug "
+                             "extension please load the extension then try again.",
+                    typeInfo.fileTypeStr)};
+        }
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return *func->ptrCast<TableFunction>();
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/binder_scope.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/binder_scope.cpp
new file mode 100644
index 0000000000..765ed33d69
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/binder_scope.cpp
@@ -0,0 +1,27 @@
+#include "binder/binder_scope.h"
+
+namespace lbug {
+namespace binder {
+
+void BinderScope::addExpression(const std::string& varName,
+    std::shared_ptr<Expression> expression) {
+    nameToExprIdx.insert({varName, expressions.size()});
+    expressions.push_back(std::move(expression));
+}
+
+void BinderScope::replaceExpression(const std::string& oldName, const std::string& newName,
+    std::shared_ptr<Expression> expression) {
+    KU_ASSERT(nameToExprIdx.contains(oldName));
+    auto idx = nameToExprIdx.at(oldName);
+    expressions[idx] = std::move(expression);
+    nameToExprIdx.erase(oldName);
+    nameToExprIdx.insert({newName, idx});
+}
+
+void BinderScope::clear() {
+    expressions.clear();
+    nameToExprIdx.clear();
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_scan_source.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_scan_source.cpp
new file mode 100644
index 0000000000..166b37f121
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_scan_source.cpp
@@ -0,0 +1,36 @@
+#include "binder/bound_scan_source.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+expression_vector BoundTableScanSource::getWarningColumns() const {
+    expression_vector warningDataExprs;
+    auto& columns = info.bindData->columns;
+    switch (type) {
+    case ScanSourceType::FILE: {
+        auto bindData = info.bindData->constPtrCast<function::ScanFileBindData>();
+        for (auto i = bindData->numWarningDataColumns; i >= 1; --i) {
+            KU_ASSERT(i < columns.size());
+            warningDataExprs.push_back(columns[columns.size() - i]);
+        }
+    } break;
+    default:
+        break;
+    }
+    return warningDataExprs;
+}
+
+bool BoundTableScanSource::getIgnoreErrorsOption() const {
+    return info.bindData->getIgnoreErrorsOption();
+}
+
+bool BoundQueryScanSource::getIgnoreErrorsOption() const {
+    return info.options.contains(CopyConstants::IGNORE_ERRORS_OPTION_NAME) ?
+               info.options.at(CopyConstants::IGNORE_ERRORS_OPTION_NAME).getValue<bool>() :
+               CopyConstants::DEFAULT_IGNORE_ERRORS;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_statement_result.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_statement_result.cpp
new file mode 100644
index 0000000000..10fc8985fb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_statement_result.cpp
@@ -0,0 +1,20 @@
+#include "binder/bound_statement_result.h"
+
+#include "binder/expression/literal_expression.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+BoundStatementResult BoundStatementResult::createSingleStringColumnResult(
+    const std::string& columnName) {
+    auto result = BoundStatementResult();
+    auto value = Value(LogicalType::STRING(), columnName);
+    auto stringColumn = std::make_shared<LiteralExpression>(std::move(value), columnName);
+    result.addColumn(columnName, stringColumn);
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_statement_rewriter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_statement_rewriter.cpp
new file mode 100644
index 0000000000..368db62743
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_statement_rewriter.cpp
@@ -0,0 +1,27 @@
+#include "binder/bound_statement_rewriter.h"
+
+#include "binder/rewriter/match_clause_pattern_label_rewriter.h"
+#include "binder/rewriter/normalized_query_part_match_rewriter.h"
+#include "binder/rewriter/with_clause_projection_rewriter.h"
+#include "binder/visitor/default_type_solver.h"
+
+namespace lbug {
+namespace binder {
+
+void BoundStatementRewriter::rewrite(BoundStatement& boundStatement,
+    main::ClientContext& clientContext) {
+    auto withClauseProjectionRewriter = WithClauseProjectionRewriter();
+    withClauseProjectionRewriter.visitUnsafe(boundStatement);
+
+    auto normalizedQueryPartMatchRewriter = NormalizedQueryPartMatchRewriter(&clientContext);
+    normalizedQueryPartMatchRewriter.visitUnsafe(boundStatement);
+
+    auto matchClausePatternLabelRewriter = MatchClausePatternLabelRewriter(clientContext);
+    matchClausePatternLabelRewriter.visitUnsafe(boundStatement);
+
+    auto defaultTypeSolver = DefaultTypeSolver();
+    defaultTypeSolver.visit(boundStatement);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_statement_visitor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_statement_visitor.cpp
new file mode 100644
index 0000000000..230e67cd39
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/bound_statement_visitor.cpp
@@ -0,0 +1,222 @@
+#include "binder/bound_statement_visitor.h"
+
+#include "binder/bound_explain.h"
+#include "binder/copy/bound_copy_from.h"
+#include "binder/copy/bound_copy_to.h"
+#include "binder/query/bound_regular_query.h"
+#include "common/cast.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+void BoundStatementVisitor::visit(const BoundStatement& statement) {
+    switch (statement.getStatementType()) {
+    case StatementType::QUERY: {
+        visitRegularQuery(statement);
+    } break;
+    case StatementType::CREATE_SEQUENCE: {
+        visitCreateSequence(statement);
+    } break;
+    case StatementType::DROP: {
+        visitDrop(statement);
+    } break;
+    case StatementType::CREATE_TABLE: {
+        visitCreateTable(statement);
+    } break;
+    case StatementType::CREATE_TYPE: {
+        visitCreateType(statement);
+    } break;
+    case StatementType::ALTER: {
+        visitAlter(statement);
+    } break;
+    case StatementType::COPY_FROM: {
+        visitCopyFrom(statement);
+    } break;
+    case StatementType::COPY_TO: {
+        visitCopyTo(statement);
+    } break;
+    case StatementType::STANDALONE_CALL: {
+        visitStandaloneCall(statement);
+    } break;
+    case StatementType::EXPLAIN: {
+        visitExplain(statement);
+    } break;
+    case StatementType::CREATE_MACRO: {
+        visitCreateMacro(statement);
+    } break;
+    case StatementType::TRANSACTION: {
+        visitTransaction(statement);
+    } break;
+    case StatementType::EXTENSION: {
+        visitExtension(statement);
+    } break;
+    case StatementType::EXPORT_DATABASE: {
+        visitExportDatabase(statement);
+    } break;
+    case StatementType::IMPORT_DATABASE: {
+        visitImportDatabase(statement);
+    } break;
+    case StatementType::ATTACH_DATABASE: {
+        visitAttachDatabase(statement);
+    } break;
+    case StatementType::DETACH_DATABASE: {
+        visitDetachDatabase(statement);
+    } break;
+    case StatementType::USE_DATABASE: {
+        visitUseDatabase(statement);
+    } break;
+    case StatementType::STANDALONE_CALL_FUNCTION: {
+        visitStandaloneCallFunction(statement);
+    } break;
+    case StatementType::EXTENSION_CLAUSE: {
+        visitExtensionClause(statement);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void BoundStatementVisitor::visitUnsafe(BoundStatement& statement) {
+    switch (statement.getStatementType()) {
+    case StatementType::QUERY: {
+        visitRegularQueryUnsafe(statement);
+    } break;
+    default:
+        break;
+    }
+}
+
+void BoundStatementVisitor::visitCopyFrom(const BoundStatement& statement) {
+    auto& copyFrom = ku_dynamic_cast<const BoundCopyFrom&>(statement);
+    if (copyFrom.getInfo()->source->type == ScanSourceType::QUERY) {
+        auto querySource = ku_dynamic_cast<BoundQueryScanSource*>(copyFrom.getInfo()->source.get());
+        visit(*querySource->statement);
+    }
+}
+
+void BoundStatementVisitor::visitCopyTo(const BoundStatement& statement) {
+    auto& copyTo = ku_dynamic_cast<const BoundCopyTo&>(statement);
+    visitRegularQuery(*copyTo.getRegularQuery());
+}
+
+void BoundStatementVisitor::visitRegularQuery(const BoundStatement& statement) {
+    auto& regularQuery = ku_dynamic_cast<const BoundRegularQuery&>(statement);
+    for (auto i = 0u; i < regularQuery.getNumSingleQueries(); ++i) {
+        visitSingleQuery(*regularQuery.getSingleQuery(i));
+    }
+}
+
+void BoundStatementVisitor::visitRegularQueryUnsafe(BoundStatement& statement) {
+    auto& regularQuery = statement.cast<BoundRegularQuery>();
+    for (auto i = 0u; i < regularQuery.getNumSingleQueries(); ++i) {
+        visitSingleQueryUnsafe(*regularQuery.getSingleQueryUnsafe(i));
+    }
+}
+
+void BoundStatementVisitor::visitSingleQuery(const NormalizedSingleQuery& singleQuery) {
+    for (auto i = 0u; i < singleQuery.getNumQueryParts(); ++i) {
+        visitQueryPart(*singleQuery.getQueryPart(i));
+    }
+}
+
+void BoundStatementVisitor::visitSingleQueryUnsafe(NormalizedSingleQuery& singleQuery) {
+    for (auto i = 0u; i < singleQuery.getNumQueryParts(); ++i) {
+        visitQueryPartUnsafe(*singleQuery.getQueryPartUnsafe(i));
+    }
+}
+
+void BoundStatementVisitor::visitQueryPart(const NormalizedQueryPart& queryPart) {
+    for (auto i = 0u; i < queryPart.getNumReadingClause(); ++i) {
+        visitReadingClause(*queryPart.getReadingClause(i));
+    }
+    for (auto i = 0u; i < queryPart.getNumUpdatingClause(); ++i) {
+        visitUpdatingClause(*queryPart.getUpdatingClause(i));
+    }
+    if (queryPart.hasProjectionBody()) {
+        visitProjectionBody(*queryPart.getProjectionBody());
+        if (queryPart.hasProjectionBodyPredicate()) {
+            visitProjectionBodyPredicate(queryPart.getProjectionBodyPredicate());
+        }
+    }
+}
+
+void BoundStatementVisitor::visitQueryPartUnsafe(NormalizedQueryPart& queryPart) {
+    for (auto i = 0u; i < queryPart.getNumReadingClause(); ++i) {
+        visitReadingClauseUnsafe(*queryPart.getReadingClause(i));
+    }
+    for (auto i = 0u; i < queryPart.getNumUpdatingClause(); ++i) {
+        visitUpdatingClause(*queryPart.getUpdatingClause(i));
+    }
+    if (queryPart.hasProjectionBody()) {
+        visitProjectionBody(*queryPart.getProjectionBody());
+        if (queryPart.hasProjectionBodyPredicate()) {
+            visitProjectionBodyPredicate(queryPart.getProjectionBodyPredicate());
+        }
+    }
+}
+
+void BoundStatementVisitor::visitExplain(const BoundStatement& statement) {
+    visit(*(statement.constCast<BoundExplain>()).getStatementToExplain());
+}
+
+void BoundStatementVisitor::visitReadingClause(const BoundReadingClause& readingClause) {
+    switch (readingClause.getClauseType()) {
+    case ClauseType::MATCH: {
+        visitMatch(readingClause);
+    } break;
+    case ClauseType::UNWIND: {
+        visitUnwind(readingClause);
+    } break;
+    case ClauseType::TABLE_FUNCTION_CALL: {
+        visitTableFunctionCall(readingClause);
+    } break;
+    case ClauseType::LOAD_FROM: {
+        visitLoadFrom(readingClause);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void BoundStatementVisitor::visitReadingClauseUnsafe(BoundReadingClause& readingClause) {
+    switch (readingClause.getClauseType()) {
+    case ClauseType::MATCH: {
+        visitMatchUnsafe(readingClause);
+    } break;
+    case ClauseType::UNWIND: {
+        visitUnwind(readingClause);
+    } break;
+    case ClauseType::TABLE_FUNCTION_CALL: {
+        visitTableFunctionCall(readingClause);
+    } break;
+    case ClauseType::LOAD_FROM: {
+        visitLoadFrom(readingClause);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void BoundStatementVisitor::visitUpdatingClause(const BoundUpdatingClause& updatingClause) {
+    switch (updatingClause.getClauseType()) {
+    case ClauseType::SET: {
+        visitSet(updatingClause);
+    } break;
+    case ClauseType::DELETE_: {
+        visitDelete(updatingClause);
+    } break;
+    case ClauseType::INSERT: {
+        visitInsert(updatingClause);
+    } break;
+    case ClauseType::MERGE: {
+        visitMerge(updatingClause);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/ddl/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/ddl/CMakeLists.txt
new file mode 100644
index 0000000000..d0630c0c49
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/ddl/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(
+        lbug_binder_ddl
+        OBJECT
+        bound_alter_info.cpp
+        property_definition.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_ddl>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/ddl/bound_alter_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/ddl/bound_alter_info.cpp
new file mode 100644
index 0000000000..1ef37ccb50
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/ddl/bound_alter_info.cpp
@@ -0,0 +1,43 @@
+#include "binder/ddl/bound_alter_info.h"
+
+namespace lbug {
+namespace binder {
+
+std::string BoundAlterInfo::toString() const {
+    std::string result = "Operation: ";
+    switch (alterType) {
+    case common::AlterType::RENAME: {
+        auto renameInfo = common::ku_dynamic_cast<BoundExtraRenameTableInfo*>(extraInfo.get());
+        result += "Rename Table " + tableName + " to " + renameInfo->newName;
+        break;
+    }
+    case common::AlterType::ADD_PROPERTY: {
+        auto addPropInfo = common::ku_dynamic_cast<BoundExtraAddPropertyInfo*>(extraInfo.get());
+        result +=
+            "Add Property " + addPropInfo->propertyDefinition.getName() + " to Table " + tableName;
+        break;
+    }
+    case common::AlterType::DROP_PROPERTY: {
+        auto dropPropInfo = common::ku_dynamic_cast<BoundExtraDropPropertyInfo*>(extraInfo.get());
+        result += "Drop Property " + dropPropInfo->propertyName + " from Table " + tableName;
+        break;
+    }
+    case common::AlterType::RENAME_PROPERTY: {
+        auto renamePropInfo =
+            common::ku_dynamic_cast<BoundExtraRenamePropertyInfo*>(extraInfo.get());
+        result += "Rename Property " + renamePropInfo->oldName + " to " + renamePropInfo->newName +
+                  " in Table " + tableName;
+        break;
+    }
+    case common::AlterType::COMMENT: {
+        result += "Comment on Table " + tableName;
+        break;
+    }
+    default:
+        break;
+    }
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/ddl/property_definition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/ddl/property_definition.cpp
new file mode 100644
index 0000000000..f125ea80fe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/ddl/property_definition.cpp
@@ -0,0 +1,34 @@
+#include "binder/ddl/property_definition.h"
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "parser/expression/parsed_literal_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+PropertyDefinition::PropertyDefinition(ColumnDefinition columnDefinition)
+    : columnDefinition{std::move(columnDefinition)} {
+    defaultExpr = std::make_unique<ParsedLiteralExpression>(Value::createNullValue(), "NULL");
+}
+
+void PropertyDefinition::serialize(Serializer& serializer) const {
+    serializer.serializeValue(columnDefinition.name);
+    columnDefinition.type.serialize(serializer);
+    defaultExpr->serialize(serializer);
+}
+
+PropertyDefinition PropertyDefinition::deserialize(Deserializer& deserializer) {
+    std::string name;
+    deserializer.deserializeValue(name);
+    auto type = LogicalType::deserialize(deserializer);
+    auto columnDefinition = ColumnDefinition(name, std::move(type));
+    auto defaultExpr = ParsedExpression::deserialize(deserializer);
+    return PropertyDefinition(std::move(columnDefinition), std::move(defaultExpr));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/CMakeLists.txt
new file mode 100644
index 0000000000..02da08a61e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/CMakeLists.txt
@@ -0,0 +1,19 @@
+add_library(
+        lbug_binder_expression
+        OBJECT
+        aggregate_function_expression.cpp
+        case_expression.cpp
+        expression.cpp
+        expression_util.cpp
+        literal_expression.cpp
+        node_expression.cpp
+        node_rel_expression.cpp
+        parameter_expression.cpp
+        property_expression.cpp
+        rel_expression.cpp
+        scalar_function_expression.cpp
+        variable_expression.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_expression>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/aggregate_function_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/aggregate_function_expression.cpp
new file mode 100644
index 0000000000..f88907e843
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/aggregate_function_expression.cpp
@@ -0,0 +1,22 @@
+#include "binder/expression/aggregate_function_expression.h"
+
+#include "binder/expression/expression_util.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+std::string AggregateFunctionExpression::toStringInternal() const {
+    return stringFormat("{}({}{})", function.name, function.isDistinct ? "DISTINCT " : "",
+        ExpressionUtil::toString(children));
+}
+
+std::string AggregateFunctionExpression::getUniqueName(const std::string& functionName,
+    const expression_vector& children, bool isDistinct) {
+    return stringFormat("{}({}{})", functionName, isDistinct ? "DISTINCT " : "",
+        ExpressionUtil::getUniqueName(children));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/case_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/case_expression.cpp
new file mode 100644
index 0000000000..aac05b480c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/case_expression.cpp
@@ -0,0 +1,17 @@
+#include "binder/expression/case_expression.h"
+
+namespace lbug {
+namespace binder {
+
+std::string CaseExpression::toStringInternal() const {
+    std::string result = "CASE ";
+    for (auto& caseAlternative : caseAlternatives) {
+        result += "WHEN " + caseAlternative->whenExpression->toString() + " THEN " +
+                  caseAlternative->thenExpression->toString();
+    }
+    result += " ELSE " + elseExpression->toString();
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/expression.cpp
new file mode 100644
index 0000000000..1c29348b06
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/expression.cpp
@@ -0,0 +1,34 @@
+#include "binder/expression/expression.h"
+
+#include "common/exception/binder.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+Expression::~Expression() = default;
+
+void Expression::cast(const LogicalType&) {
+    // LCOV_EXCL_START
+    throw BinderException(
+        stringFormat("Data type of expression {} should not be modified.", toString()));
+    // LCOV_EXCL_STOP
+}
+
+expression_vector Expression::splitOnAND() {
+    expression_vector result;
+    if (ExpressionType::AND == expressionType) {
+        for (auto& child : children) {
+            for (auto& exp : child->splitOnAND()) {
+                result.push_back(exp);
+            }
+        }
+    } else {
+        result.push_back(shared_from_this());
+    }
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/expression_util.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/expression_util.cpp
new file mode 100644
index 0000000000..0708a416d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/expression_util.cpp
@@ -0,0 +1,568 @@
+#include "binder/expression/expression_util.h"
+
+#include <algorithm>
+
+#include "binder/binder.h"
+#include "binder/expression/literal_expression.h"
+#include "binder/expression/node_rel_expression.h"
+#include "binder/expression/parameter_expression.h"
+#include "common/exception/binder.h"
+#include "common/exception/runtime.h"
+#include "common/type_utils.h"
+#include "common/types/value/nested.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+expression_vector ExpressionUtil::getExpressionsWithDataType(const expression_vector& expressions,
+    LogicalTypeID dataTypeID) {
+    expression_vector result;
+    for (auto& expression : expressions) {
+        if (expression->dataType.getLogicalTypeID() == dataTypeID) {
+            result.push_back(expression);
+        }
+    }
+    return result;
+}
+
+uint32_t ExpressionUtil::find(const Expression* target, const expression_vector& expressions) {
+    for (auto i = 0u; i < expressions.size(); ++i) {
+        if (target->getUniqueName() == expressions[i]->getUniqueName()) {
+            return i;
+        }
+    }
+    return INVALID_IDX;
+}
+
+std::string ExpressionUtil::toString(const expression_vector& expressions) {
+    if (expressions.empty()) {
+        return std::string{};
+    }
+    auto result = expressions[0]->toString();
+    for (auto i = 1u; i < expressions.size(); ++i) {
+        result += "," + expressions[i]->toString();
+    }
+    return result;
+}
+
+std::string ExpressionUtil::toStringOrdered(const expression_vector& expressions) {
+    auto expressions_ = expressions;
+    std::sort(expressions_.begin(), expressions_.end(),
+        [](const std::shared_ptr<Expression>& a, const std::shared_ptr<Expression>& b) {
+            return a->toString() < b->toString();
+        });
+    return toString(expressions_);
+}
+
+std::string ExpressionUtil::toString(const std::vector<expression_pair>& expressionPairs) {
+    if (expressionPairs.empty()) {
+        return std::string{};
+    }
+    auto result = toString(expressionPairs[0]);
+    for (auto i = 1u; i < expressionPairs.size(); ++i) {
+        result += "," + toString(expressionPairs[i]);
+    }
+    return result;
+}
+
+std::string ExpressionUtil::toString(const expression_pair& expressionPair) {
+    return expressionPair.first->toString() + "=" + expressionPair.second->toString();
+}
+
+std::string ExpressionUtil::getUniqueName(const expression_vector& expressions) {
+    if (expressions.empty()) {
+        return std::string();
+    }
+    auto result = expressions[0]->getUniqueName();
+    for (auto i = 1u; i < expressions.size(); ++i) {
+        result += "," + expressions[i]->getUniqueName();
+    }
+    return result;
+}
+
+expression_vector ExpressionUtil::excludeExpression(const expression_vector& exprs,
+    const Expression& exprToExclude) {
+    expression_vector result;
+    for (auto& expr : exprs) {
+        if (*expr != exprToExclude) {
+            result.push_back(expr);
+        }
+    }
+    return result;
+}
+
+expression_vector ExpressionUtil::excludeExpressions(const expression_vector& expressions,
+    const expression_vector& expressionsToExclude) {
+    expression_set excludeSet;
+    for (auto& expression : expressionsToExclude) {
+        excludeSet.insert(expression);
+    }
+    expression_vector result;
+    for (auto& expression : expressions) {
+        if (!excludeSet.contains(expression)) {
+            result.push_back(expression);
+        }
+    }
+    return result;
+}
+
+logical_type_vec_t ExpressionUtil::getDataTypes(const expression_vector& expressions) {
+    std::vector<LogicalType> result;
+    result.reserve(expressions.size());
+    for (auto& expression : expressions) {
+        result.push_back(expression->getDataType().copy());
+    }
+    return result;
+}
+
+expression_vector ExpressionUtil::removeDuplication(const expression_vector& expressions) {
+    expression_vector result;
+    expression_set expressionSet;
+    for (auto& expression : expressions) {
+        if (expressionSet.contains(expression)) {
+            continue;
+        }
+        result.push_back(expression);
+        expressionSet.insert(expression);
+    }
+    return result;
+}
+
+bool ExpressionUtil::isEmptyPattern(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::PATTERN) {
+        return false;
+    }
+    return expression.constCast<NodeOrRelExpression>().isEmpty();
+}
+
+bool ExpressionUtil::isNodePattern(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::PATTERN) {
+        return false;
+    }
+    return expression.dataType.getLogicalTypeID() == LogicalTypeID::NODE;
+};
+
+bool ExpressionUtil::isRelPattern(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::PATTERN) {
+        return false;
+    }
+    return expression.dataType.getLogicalTypeID() == LogicalTypeID::REL;
+}
+
+bool ExpressionUtil::isRecursiveRelPattern(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::PATTERN) {
+        return false;
+    }
+    return expression.dataType.getLogicalTypeID() == LogicalTypeID::RECURSIVE_REL;
+}
+
+bool ExpressionUtil::isNullLiteral(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::LITERAL) {
+        return false;
+    }
+    return expression.constCast<LiteralExpression>().getValue().isNull();
+}
+
+bool ExpressionUtil::isBoolLiteral(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::LITERAL) {
+        return false;
+    }
+    return expression.dataType == LogicalType::BOOL();
+}
+
+bool ExpressionUtil::isFalseLiteral(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::LITERAL) {
+        return false;
+    }
+    return expression.constCast<LiteralExpression>().getValue().getValue<bool>() == false;
+}
+
+bool ExpressionUtil::isEmptyList(const Expression& expression) {
+    auto val = Value::createNullValue();
+    switch (expression.expressionType) {
+    case ExpressionType::LITERAL: {
+        val = expression.constCast<LiteralExpression>().getValue();
+    } break;
+    case ExpressionType::PARAMETER: {
+        val = expression.constCast<ParameterExpression>().getValue();
+    } break;
+    default:
+        return false;
+    }
+    if (val.getDataType().getLogicalTypeID() != LogicalTypeID::LIST) {
+        return false;
+    }
+    return val.getChildrenSize() == 0;
+}
+
+void ExpressionUtil::validateExpressionType(const Expression& expr, ExpressionType expectedType) {
+    if (expr.expressionType == expectedType) {
+        return;
+    }
+    throw BinderException(stringFormat("{} has type {} but {} was expected.", expr.toString(),
+        ExpressionTypeUtil::toString(expr.expressionType),
+        ExpressionTypeUtil::toString(expectedType)));
+}
+
+void ExpressionUtil::validateExpressionType(const Expression& expr,
+    std::vector<ExpressionType> expectedType) {
+    if (std::find(expectedType.begin(), expectedType.end(), expr.expressionType) !=
+        expectedType.end()) {
+        return;
+    }
+    std::string expectedTypesStr = "";
+    std::for_each(expectedType.begin(), expectedType.end(),
+        [&expectedTypesStr](ExpressionType type) {
+            expectedTypesStr += expectedTypesStr.empty() ? ExpressionTypeUtil::toString(type) :
+                                                           "," + ExpressionTypeUtil::toString(type);
+        });
+    throw BinderException(stringFormat("{} has type {} but {} was expected.", expr.toString(),
+        ExpressionTypeUtil::toString(expr.expressionType), expectedTypesStr));
+}
+
+void ExpressionUtil::validateDataType(const Expression& expr, const LogicalType& expectedType) {
+    if (expr.getDataType() == expectedType) {
+        return;
+    }
+    throw BinderException(stringFormat("{} has data type {} but {} was expected.", expr.toString(),
+        expr.getDataType().toString(), expectedType.toString()));
+}
+
+void ExpressionUtil::validateDataType(const Expression& expr, LogicalTypeID expectedTypeID) {
+    if (expr.getDataType().getLogicalTypeID() == expectedTypeID) {
+        return;
+    }
+    throw BinderException(stringFormat("{} has data type {} but {} was expected.", expr.toString(),
+        expr.getDataType().toString(), LogicalTypeUtils::toString(expectedTypeID)));
+}
+
+void ExpressionUtil::validateDataType(const Expression& expr,
+    const std::vector<LogicalTypeID>& expectedTypeIDs) {
+    auto targetsSet =
+        std::unordered_set<LogicalTypeID>{expectedTypeIDs.begin(), expectedTypeIDs.end()};
+    if (targetsSet.contains(expr.getDataType().getLogicalTypeID())) {
+        return;
+    }
+    throw BinderException(stringFormat("{} has data type {} but {} was expected.", expr.toString(),
+        expr.getDataType().toString(), LogicalTypeUtils::toString(expectedTypeIDs)));
+}
+
+template<>
+uint64_t ExpressionUtil::getLiteralValue(const Expression& expr) {
+    validateExpressionType(expr, ExpressionType::LITERAL);
+    validateDataType(expr, LogicalType::UINT64());
+    return expr.constCast<LiteralExpression>().getValue().getValue<uint64_t>();
+}
+template<>
+int64_t ExpressionUtil::getLiteralValue(const Expression& expr) {
+    validateExpressionType(expr, ExpressionType::LITERAL);
+    validateDataType(expr, LogicalType::INT64());
+    return expr.constCast<LiteralExpression>().getValue().getValue<int64_t>();
+}
+template<>
+bool ExpressionUtil::getLiteralValue(const Expression& expr) {
+    validateExpressionType(expr, ExpressionType::LITERAL);
+    validateDataType(expr, LogicalType::BOOL());
+    return expr.constCast<LiteralExpression>().getValue().getValue<bool>();
+}
+template<>
+std::string ExpressionUtil::getLiteralValue(const Expression& expr) {
+    validateExpressionType(expr, ExpressionType::LITERAL);
+    validateDataType(expr, LogicalType::STRING());
+    return expr.constCast<LiteralExpression>().getValue().getValue<std::string>();
+}
+template<>
+double ExpressionUtil::getLiteralValue(const Expression& expr) {
+    validateExpressionType(expr, ExpressionType::LITERAL);
+    validateDataType(expr, LogicalType::DOUBLE());
+    return expr.constCast<LiteralExpression>().getValue().getValue<double>();
+}
+
+// For primitive types, two types are compatible if they have the same id.
+// For nested types, two types are compatible if they have the same id and their children are also
+// compatible.
+// E.g. [NULL] is compatible with [1,2]
+// E.g. {a: NULL, b: NULL} is compatible with {a: [1,2], b: ['c']}
+static bool compatible(const LogicalType& type, const LogicalType& target) {
+    if (type.isInternalType() != target.isInternalType()) {
+        return false;
+    }
+    if (type.getLogicalTypeID() == LogicalTypeID::ANY) {
+        return true;
+    }
+    if (type.getLogicalTypeID() != target.getLogicalTypeID()) {
+        return false;
+    }
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::LIST: {
+        return compatible(ListType::getChildType(type), ListType::getChildType(target));
+    }
+    case LogicalTypeID::ARRAY: {
+        return compatible(ArrayType::getChildType(type), ArrayType::getChildType(target));
+    }
+    case LogicalTypeID::STRUCT: {
+        if (StructType::getNumFields(type) != StructType::getNumFields(target)) {
+            return false;
+        }
+        for (auto i = 0u; i < StructType::getNumFields(type); ++i) {
+            if (!compatible(StructType::getField(type, i).getType(),
+                    StructType::getField(target, i).getType())) {
+                return false;
+            }
+        }
+        return true;
+    }
+    case LogicalTypeID::DECIMAL:
+    case LogicalTypeID::UNION:
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL:
+        return false;
+    default:
+        return true;
+    }
+}
+
+// Handle special cases where value can be compatible to a type. This happens when a value is a
+// nested value but does not have any child.
+// E.g. [] is compatible with [1,2]
+static bool compatible(const Value& value, const LogicalType& targetType) {
+    if (value.isNull()) { // Value is null. We can safely change its type.
+        return true;
+    }
+    if (value.getDataType().getLogicalTypeID() != targetType.getLogicalTypeID()) {
+        return false;
+    }
+    switch (value.getDataType().getLogicalTypeID()) {
+    case LogicalTypeID::LIST: {
+        if (!value.hasNoneNullChildren()) { // Empty list free to change.
+            return true;
+        }
+        for (auto i = 0u; i < NestedVal::getChildrenSize(&value); ++i) {
+            if (!compatible(*NestedVal::getChildVal(&value, i),
+                    ListType::getChildType(targetType))) {
+                return false;
+            }
+        }
+        return true;
+    }
+    case LogicalTypeID::ARRAY: {
+        if (!value.hasNoneNullChildren()) { // Empty array free to change.
+            return true;
+        }
+        for (auto i = 0u; i < NestedVal::getChildrenSize(&value); ++i) {
+            if (!compatible(*NestedVal::getChildVal(&value, i),
+                    ArrayType::getChildType(targetType))) {
+                return false;
+            }
+        }
+        return true;
+    }
+    case LogicalTypeID::MAP: {
+        if (!value.hasNoneNullChildren()) { // Empty map free to change.
+            return true;
+        }
+        const auto& keyType = MapType::getKeyType(targetType);
+        const auto& valType = MapType::getValueType(targetType);
+        for (auto i = 0u; i < NestedVal::getChildrenSize(&value); ++i) {
+            auto childVal = NestedVal::getChildVal(&value, i);
+            KU_ASSERT(NestedVal::getChildrenSize(childVal) == 2);
+            auto key = NestedVal::getChildVal(childVal, 0);
+            auto val = NestedVal::getChildVal(childVal, 1);
+            if (!compatible(*key, keyType) || !compatible(*val, valType)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    default:
+        break;
+    }
+    return compatible(value.getDataType(), targetType);
+}
+
+bool ExpressionUtil::tryCombineDataType(const expression_vector& expressions, LogicalType& result) {
+    std::vector<Value> secondaryValues;
+    std::vector<LogicalType> primaryTypes;
+    for (auto& expr : expressions) {
+        if (expr->expressionType != ExpressionType::LITERAL) {
+            primaryTypes.push_back(expr->getDataType().copy());
+            continue;
+        }
+        auto literalExpr = expr->constPtrCast<LiteralExpression>();
+        if (literalExpr->getValue().allowTypeChange()) {
+            secondaryValues.push_back(literalExpr->getValue());
+            continue;
+        }
+        primaryTypes.push_back(expr->getDataType().copy());
+    }
+    if (!LogicalTypeUtils::tryGetMaxLogicalType(primaryTypes, result)) {
+        return false;
+    }
+    for (auto& value : secondaryValues) {
+        if (compatible(value, result)) {
+            continue;
+        }
+        if (!LogicalTypeUtils::tryGetMaxLogicalType(result, value.getDataType(), result)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool ExpressionUtil::canCastStatically(const Expression& expr, const LogicalType& targetType) {
+    switch (expr.expressionType) {
+    case ExpressionType::LITERAL: {
+        auto value = expr.constPtrCast<LiteralExpression>()->getValue();
+        return compatible(value, targetType);
+    }
+    case ExpressionType::PARAMETER: {
+        auto value = expr.constPtrCast<ParameterExpression>()->getValue();
+        return compatible(value, targetType);
+    }
+    default:
+        return compatible(expr.getDataType(), targetType);
+    }
+}
+
+bool ExpressionUtil::canEvaluateAsLiteral(const Expression& expr) {
+    switch (expr.expressionType) {
+    case ExpressionType::LITERAL:
+        return true;
+    case ExpressionType::PARAMETER:
+        return expr.getDataType().getLogicalTypeID() != LogicalTypeID::ANY;
+    default:
+        return false;
+    }
+}
+
+Value ExpressionUtil::evaluateAsLiteralValue(const Expression& expr) {
+    KU_ASSERT(canEvaluateAsLiteral(expr));
+    auto value = Value::createDefaultValue(expr.dataType);
+    switch (expr.expressionType) {
+    case ExpressionType::LITERAL: {
+        value = expr.constCast<LiteralExpression>().getValue();
+    } break;
+    case ExpressionType::PARAMETER: {
+        value = expr.constCast<ParameterExpression>().getValue();
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return value;
+}
+
+uint64_t ExpressionUtil::evaluateAsSkipLimit(const Expression& expr) {
+    auto value = evaluateAsLiteralValue(expr);
+    auto errorMsg = "The number of rows to skip/limit must be a non-negative integer.";
+    uint64_t number = INVALID_LIMIT;
+    TypeUtils::visit(
+        value.getDataType(),
+        [&]<IntegerTypes T>(T) {
+            if (value.getValue<T>() < 0) {
+                throw RuntimeException{errorMsg};
+            }
+            number = (uint64_t)value.getValue<T>();
+        },
+        [&](auto) { throw RuntimeException{errorMsg}; });
+    return number;
+}
+
+template<typename T>
+T ExpressionUtil::getExpressionVal(const Expression& expr, const Value& value,
+    const LogicalType& targetType, validate_param_func<T> validateParamFunc) {
+    if (value.getDataType() != targetType) {
+        throw RuntimeException{common::stringFormat("Parameter: {} must be a {} literal.",
+            expr.getAlias(), targetType.toString())};
+    }
+    T val = value.getValue<T>();
+    if (validateParamFunc != nullptr) {
+        validateParamFunc(val);
+    }
+    return val;
+}
+
+template<typename T>
+T ExpressionUtil::evaluateLiteral(main::ClientContext* context,
+    std::shared_ptr<Expression> expression, const common::LogicalType& type,
+    validate_param_func<T> validateParamFunc) {
+    if (!canEvaluateAsLiteral(*expression)) {
+        std::string errMsg;
+        switch (expression->expressionType) {
+        case ExpressionType::PARAMETER: {
+            errMsg = common::stringFormat(
+                "The expression: '{}' is a parameter expression. Please assign it a value.",
+                expression->toString());
+        } break;
+        default: {
+            errMsg =
+                common::stringFormat("The expression: '{}' must be a parameter/literal expression.",
+                    expression->toString());
+            ;
+        } break;
+        }
+        throw RuntimeException{errMsg};
+    }
+    if (expression->getDataType() != type) {
+        binder::Binder binder{context};
+        auto literalExpr = std::make_shared<LiteralExpression>(
+            ExpressionUtil::evaluateAsLiteralValue(*expression), expression->getUniqueName());
+        expression = binder.getExpressionBinder()->implicitCast(literalExpr, type.copy());
+        expression = binder.getExpressionBinder()->foldExpression(expression);
+    }
+    auto value = evaluateAsLiteralValue(*expression);
+    return getExpressionVal(*expression, value, type, validateParamFunc);
+}
+
+std::shared_ptr<Expression> ExpressionUtil::applyImplicitCastingIfNecessary(
+    main::ClientContext* context, std::shared_ptr<Expression> expr,
+    common::LogicalType targetType) {
+    if (expr->getDataType() != targetType) {
+        binder::Binder binder{context};
+        expr = binder.getExpressionBinder()->implicitCastIfNecessary(expr, targetType);
+        expr = binder.getExpressionBinder()->foldExpression(expr);
+    }
+    return expr;
+}
+
+template LBUG_API std::string ExpressionUtil::getExpressionVal(const Expression& expr,
+    const common::Value& value, const common::LogicalType& targetType,
+    validate_param_func<std::string> validateParamFunc);
+
+template LBUG_API double ExpressionUtil::getExpressionVal(const Expression& expr,
+    const common::Value& value, const common::LogicalType& targetType,
+    validate_param_func<double> validateParamFunc);
+
+template LBUG_API int64_t ExpressionUtil::getExpressionVal(const Expression& expr,
+    const common::Value& value, const common::LogicalType& targetType,
+    validate_param_func<int64_t> validateParamFunc);
+
+template LBUG_API bool ExpressionUtil::getExpressionVal(const Expression& expr,
+    const common::Value& value, const common::LogicalType& targetType,
+    validate_param_func<bool> validateParamFunc);
+
+template LBUG_API std::string ExpressionUtil::evaluateLiteral<std::string>(
+    main::ClientContext* context, std::shared_ptr<Expression> expression,
+    const common::LogicalType& type, validate_param_func<std::string> validateParamFunc);
+
+template LBUG_API double ExpressionUtil::evaluateLiteral<double>(main::ClientContext* context,
+    std::shared_ptr<Expression> expression, const LogicalType& type,
+    validate_param_func<double> validateParamFunc);
+
+template LBUG_API int64_t ExpressionUtil::evaluateLiteral<int64_t>(main::ClientContext* context,
+    std::shared_ptr<Expression> expression, const LogicalType& type,
+    validate_param_func<int64_t> validateParamFunc);
+
+template LBUG_API bool ExpressionUtil::evaluateLiteral<bool>(main::ClientContext* context,
+    std::shared_ptr<Expression> expression, const LogicalType& type,
+    validate_param_func<bool> validateParamFunc);
+
+template LBUG_API uint64_t ExpressionUtil::evaluateLiteral<uint64_t>(main::ClientContext* context,
+    std::shared_ptr<Expression> expression, const LogicalType& type,
+    validate_param_func<uint64_t> validateParamFunc);
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/literal_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/literal_expression.cpp
new file mode 100644
index 0000000000..faddcef800
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/literal_expression.cpp
@@ -0,0 +1,24 @@
+#include "binder/expression/literal_expression.h"
+
+#include "common/exception/binder.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+void LiteralExpression::cast(const LogicalType& type) {
+    // The following is a safeguard to make sure we are not changing literal type unexpectedly.
+    if (!value.allowTypeChange()) {
+        // LCOV_EXCL_START
+        throw BinderException(
+            stringFormat("Cannot change literal expression data type from {} to {}.",
+                dataType.toString(), type.toString()));
+        // LCOV_EXCL_STOP
+    }
+    dataType = type.copy();
+    value.setDataType(type);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/node_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/node_expression.cpp
new file mode 100644
index 0000000000..72e235f5c3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/node_expression.cpp
@@ -0,0 +1,18 @@
+#include "binder/expression/node_expression.h"
+
+namespace lbug {
+namespace binder {
+
+NodeExpression::~NodeExpression() = default;
+
+std::shared_ptr<Expression> NodeExpression::getPrimaryKey(common::table_id_t tableID) const {
+    for (auto& property : propertyExprs) {
+        if (property->isPrimaryKey(tableID)) {
+            return property;
+        }
+    }
+    KU_UNREACHABLE;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/node_rel_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/node_rel_expression.cpp
new file mode 100644
index 0000000000..a8d414eb3c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/node_rel_expression.cpp
@@ -0,0 +1,44 @@
+#include "binder/expression/node_rel_expression.h"
+
+#include "catalog/catalog_entry/table_catalog_entry.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+table_id_vector_t NodeOrRelExpression::getTableIDs() const {
+    table_id_vector_t result;
+    for (auto& entry : entries) {
+        result.push_back(entry->getTableID());
+    }
+    return result;
+}
+
+table_id_set_t NodeOrRelExpression::getTableIDsSet() const {
+    table_id_set_t result;
+    for (auto& entry : entries) {
+        result.insert(entry->getTableID());
+    }
+    return result;
+}
+
+void NodeOrRelExpression::addEntries(const std::vector<TableCatalogEntry*>& entries_) {
+    auto tableIDsSet = getTableIDsSet();
+    for (auto& entry : entries_) {
+        if (!tableIDsSet.contains(entry->getTableID())) {
+            entries.push_back(entry);
+        }
+    }
+}
+
+void NodeOrRelExpression::addPropertyExpression(std::shared_ptr<PropertyExpression> property) {
+    auto propertyName = property->getPropertyName();
+    KU_ASSERT(!propertyNameToIdx.contains(propertyName));
+    propertyNameToIdx.insert({propertyName, propertyExprs.size()});
+    propertyExprs.push_back(std::move(property));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/parameter_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/parameter_expression.cpp
new file mode 100644
index 0000000000..42a33e8a50
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/parameter_expression.cpp
@@ -0,0 +1,23 @@
+#include "binder/expression/parameter_expression.h"
+
+#include "common/exception/binder.h"
+
+namespace lbug {
+using namespace common;
+
+namespace binder {
+
+void ParameterExpression::cast(const LogicalType& type) {
+    if (!dataType.containsAny()) {
+        // LCOV_EXCL_START
+        throw BinderException(
+            stringFormat("Cannot change parameter expression data type from {} to {}.",
+                dataType.toString(), type.toString()));
+        // LCOV_EXCL_STOP
+    }
+    dataType = type.copy();
+    value.setDataType(type);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/property_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/property_expression.cpp
new file mode 100644
index 0000000000..05b8648fbd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/property_expression.cpp
@@ -0,0 +1,31 @@
+#include "binder/expression/property_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace binder {
+
+bool PropertyExpression::isPrimaryKey() const {
+    for (auto& [id, info] : infos) {
+        if (!info.isPrimaryKey) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool PropertyExpression::isPrimaryKey(table_id_t tableID) const {
+    if (!infos.contains(tableID)) {
+        return false;
+    }
+    return infos.at(tableID).isPrimaryKey;
+}
+
+bool PropertyExpression::hasProperty(table_id_t tableID) const {
+    KU_ASSERT(infos.contains(tableID));
+    return infos.at(tableID).exists;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/rel_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/rel_expression.cpp
new file mode 100644
index 0000000000..79ddcf246a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/rel_expression.cpp
@@ -0,0 +1,88 @@
+#include "binder/expression/rel_expression.h"
+
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/enums/extend_direction_util.h"
+#include "common/exception/binder.h"
+#include "common/utils.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+bool RelExpression::isMultiLabeled() const {
+    if (entries.size() > 1) {
+        return true;
+    }
+    for (auto& entry : entries) {
+        auto relGroupEntry = entry->ptrCast<catalog::RelGroupCatalogEntry>();
+        if (relGroupEntry->getNumRelTables() > 1) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::string RelExpression::detailsToString() const {
+    std::string result = toString();
+    switch (relType) {
+    case QueryRelType::SHORTEST: {
+        result += "SHORTEST";
+    } break;
+    case QueryRelType::ALL_SHORTEST: {
+        result += "ALL SHORTEST";
+    } break;
+    case QueryRelType::WEIGHTED_SHORTEST: {
+        result += "WEIGHTED SHORTEST";
+    } break;
+    case QueryRelType::ALL_WEIGHTED_SHORTEST: {
+        result += "ALL WEIGHTED SHORTEST";
+    } break;
+    default:
+        break;
+    }
+    if (QueryRelTypeUtils::isRecursive(relType)) {
+        result += std::to_string(recursiveInfo->bindData->lowerBound);
+        result += "..";
+        result += std::to_string(recursiveInfo->bindData->upperBound);
+    }
+    return result;
+}
+
+std::vector<ExtendDirection> RelExpression::getExtendDirections() const {
+    std::vector<ExtendDirection> ret;
+    for (const auto direction : {ExtendDirection::FWD, ExtendDirection::BWD}) {
+        const bool addDirection = std::all_of(entries.begin(), entries.end(),
+            [direction](const catalog::TableCatalogEntry* tableEntry) {
+                const auto* entry = tableEntry->constPtrCast<catalog::RelGroupCatalogEntry>();
+                return common::containsValue(entry->getRelDataDirections(),
+                    ExtendDirectionUtil::getRelDataDirection(direction));
+            });
+        if (addDirection) {
+            ret.push_back(direction);
+        }
+    }
+    if (ret.empty()) {
+        throw BinderException(stringFormat(
+            "There are no common storage directions among the rel "
+            "tables matched by pattern '{}' (some tables have storage direction 'fwd' "
+            "while others have storage direction 'bwd'). Scanning different tables matching the "
+            "same pattern in different directions is currently unsupported.",
+            toString()));
+    }
+    return ret;
+}
+
+std::vector<table_id_t> RelExpression::getInnerRelTableIDs() const {
+    std::vector<table_id_t> innerTableIDs;
+    for (auto& entry : entries) {
+        for (auto& info : entry->cast<catalog::RelGroupCatalogEntry>().getRelEntryInfos()) {
+            innerTableIDs.push_back(info.oid);
+        }
+    }
+    return innerTableIDs;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/scalar_function_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/scalar_function_expression.cpp
new file mode 100644
index 0000000000..c24bfaed85
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/scalar_function_expression.cpp
@@ -0,0 +1,24 @@
+#include "binder/expression/scalar_function_expression.h"
+
+#include "binder/expression/expression_util.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+std::string ScalarFunctionExpression::toStringInternal() const {
+    if (function->name.starts_with("CAST")) {
+        return stringFormat("CAST({}, {})", ExpressionUtil::toString(children),
+            bindData->resultType.toString());
+    }
+    return stringFormat("{}({})", function->name, ExpressionUtil::toString(children));
+}
+
+std::string ScalarFunctionExpression::getUniqueName(const std::string& functionName,
+    const expression_vector& children) {
+    return stringFormat("{}({})", functionName, ExpressionUtil::getUniqueName(children));
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/variable_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/variable_expression.cpp
new file mode 100644
index 0000000000..0df190cb7e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression/variable_expression.cpp
@@ -0,0 +1,22 @@
+#include "binder/expression/variable_expression.h"
+
+#include "common/exception/binder.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+void VariableExpression::cast(const LogicalType& type) {
+    if (!dataType.containsAny()) {
+        // LCOV_EXCL_START
+        throw BinderException(
+            stringFormat("Cannot change variable expression data type from {} to {}.",
+                dataType.toString(), type.toString()));
+        // LCOV_EXCL_STOP
+    }
+    dataType = type.copy();
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression_binder.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression_binder.cpp
new file mode 100644
index 0000000000..40aad2d390
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression_binder.cpp
@@ -0,0 +1,154 @@
+#include "binder/expression_binder.h"
+
+#include "binder/binder.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression/parameter_expression.h"
+#include "binder/expression_visitor.h"
+#include "common/exception/binder.h"
+#include "common/exception/not_implemented.h"
+#include "common/string_format.h"
+#include "expression_evaluator/expression_evaluator_utils.h"
+#include "function/cast/vector_cast_functions.h"
+#include "parser/expression/parsed_expression_visitor.h"
+#include "parser/expression/parsed_parameter_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace binder {
+
+std::shared_ptr<Expression> ExpressionBinder::bindExpression(
+    const ParsedExpression& parsedExpression) {
+    // Normally u can only reference an existing expression through alias which is a parsed
+    // VARIABLE expression.
+    // An exception is order by binding, e.g. RETURN a, COUNT(*) ORDER BY COUNT(*)
+    // the later COUNT(*) should reference the one in projection list. So we need to explicitly
+    // check scope when binding order by list.
+    if (config.bindOrderByAfterAggregate && binder->scope.contains(parsedExpression.toString())) {
+        return binder->scope.getExpression(parsedExpression.toString());
+    }
+    auto collector = ParsedParamExprCollector();
+    collector.visit(&parsedExpression);
+    if (collector.hasParamExprs()) {
+        bool allParamExist = true;
+        for (auto& parsedExpr : collector.getParamExprs()) {
+            auto name = parsedExpr->constCast<ParsedParameterExpression>().getParameterName();
+            if (!knownParameters.contains(name)) {
+                unknownParameters.insert(name);
+                allParamExist = false;
+            }
+        }
+        if (!allParamExist) {
+            auto expr = std::make_shared<ParameterExpression>(binder->getUniqueExpressionName(""),
+                Value::createNullValue());
+            if (parsedExpression.hasAlias()) {
+                expr->setAlias(parsedExpression.getAlias());
+            }
+            return expr;
+        }
+    }
+    std::shared_ptr<Expression> expression;
+    auto expressionType = parsedExpression.getExpressionType();
+    if (ExpressionTypeUtil::isBoolean(expressionType)) {
+        expression = bindBooleanExpression(parsedExpression);
+    } else if (ExpressionTypeUtil::isComparison(expressionType)) {
+        expression = bindComparisonExpression(parsedExpression);
+    } else if (ExpressionTypeUtil::isNullOperator(expressionType)) {
+        expression = bindNullOperatorExpression(parsedExpression);
+    } else if (ExpressionType::FUNCTION == expressionType) {
+        expression = bindFunctionExpression(parsedExpression);
+    } else if (ExpressionType::PROPERTY == expressionType) {
+        expression = bindPropertyExpression(parsedExpression);
+    } else if (ExpressionType::PARAMETER == expressionType) {
+        expression = bindParameterExpression(parsedExpression);
+    } else if (ExpressionType::LITERAL == expressionType) {
+        expression = bindLiteralExpression(parsedExpression);
+    } else if (ExpressionType::VARIABLE == expressionType) {
+        expression = bindVariableExpression(parsedExpression);
+    } else if (ExpressionType::SUBQUERY == expressionType) {
+        expression = bindSubqueryExpression(parsedExpression);
+    } else if (ExpressionType::CASE_ELSE == expressionType) {
+        expression = bindCaseExpression(parsedExpression);
+    } else if (ExpressionType::LAMBDA == expressionType) {
+        expression = bindLambdaExpression(parsedExpression);
+    } else {
+        throw NotImplementedException(
+            "bindExpression(" + ExpressionTypeUtil::toString(expressionType) + ").");
+    }
+    if (ConstantExpressionVisitor::needFold(*expression)) {
+        return foldExpression(expression);
+    }
+    return expression;
+}
+
+std::shared_ptr<Expression> ExpressionBinder::foldExpression(
+    const std::shared_ptr<Expression>& expression) const {
+    auto value =
+        evaluator::ExpressionEvaluatorUtils::evaluateConstantExpression(expression, context);
+    auto result = createLiteralExpression(value);
+    // Fold result should preserve the alias original expression. E.g.
+    // RETURN 2, 1 + 1 AS x
+    // Once folded, 1 + 1 will become 2 and have the same identifier as the first RETURN element.
+    // We preserve alias (x) to avoid such conflict.
+    if (expression->hasAlias()) {
+        result->setAlias(expression->getAlias());
+    } else {
+        result->setAlias(expression->toString());
+    }
+    return result;
+}
+
+static std::string unsupportedImplicitCastException(const Expression& expression,
+    const std::string& targetTypeStr) {
+    return stringFormat(
+        "Expression {} has data type {} but expected {}. Implicit cast is not supported.",
+        expression.toString(), expression.dataType.toString(), targetTypeStr);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::implicitCastIfNecessary(
+    const std::shared_ptr<Expression>& expression, const LogicalType& targetType) {
+    auto& type = expression->dataType;
+    if (type == targetType || targetType.containsAny()) { // No need to cast.
+        return expression;
+    }
+    if (!type.isInternalType() || !targetType.isInternalType()) {
+        return implicitCast(expression, targetType);
+    }
+    if (ExpressionUtil::canCastStatically(*expression, targetType)) {
+        expression->cast(targetType);
+        return expression;
+    }
+    return implicitCast(expression, targetType);
+}
+
+std::shared_ptr<Expression> ExpressionBinder::implicitCast(
+    const std::shared_ptr<Expression>& expression, const LogicalType& targetType) {
+    if (CastFunction::hasImplicitCast(expression->dataType, targetType)) {
+        return forceCast(expression, targetType);
+    } else {
+        throw BinderException(unsupportedImplicitCastException(*expression, targetType.toString()));
+    }
+}
+
+// cast without implicit checking.
+std::shared_ptr<Expression> ExpressionBinder::forceCast(
+    const std::shared_ptr<Expression>& expression, const LogicalType& targetType) {
+    auto functionName = "CAST";
+    auto children =
+        expression_vector{expression, createLiteralExpression(Value(targetType.toString()))};
+    return bindScalarFunctionExpression(children, functionName);
+}
+
+std::string ExpressionBinder::getUniqueName(const std::string& name) const {
+    return binder->getUniqueExpressionName(name);
+}
+
+void ExpressionBinder::addParameter(const std::string& name, std::shared_ptr<Value> value) {
+    KU_ASSERT(!knownParameters.contains(name));
+    knownParameters[name] = value;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression_visitor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression_visitor.cpp
new file mode 100644
index 0000000000..b95af484fe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/expression_visitor.cpp
@@ -0,0 +1,337 @@
+#include "binder/expression_visitor.h"
+
+#include "binder/expression/case_expression.h"
+#include "binder/expression/lambda_expression.h"
+#include "binder/expression/node_expression.h"
+#include "binder/expression/property_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "binder/expression/scalar_function_expression.h"
+#include "binder/expression/subquery_expression.h"
+#include "common/exception/not_implemented.h"
+#include "function/arithmetic/vector_arithmetic_functions.h"
+#include "function/sequence/sequence_functions.h"
+#include "function/uuid/vector_uuid_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+void ExpressionVisitor::visit(std::shared_ptr<Expression> expr) {
+    visitChildren(*expr);
+    visitSwitch(expr);
+}
+
+void ExpressionVisitor::visitSwitch(std::shared_ptr<Expression> expr) {
+    switch (expr->expressionType) {
+    case ExpressionType::OR:
+    case ExpressionType::XOR:
+    case ExpressionType::AND:
+    case ExpressionType::NOT:
+    case ExpressionType::EQUALS:
+    case ExpressionType::NOT_EQUALS:
+    case ExpressionType::GREATER_THAN:
+    case ExpressionType::GREATER_THAN_EQUALS:
+    case ExpressionType::LESS_THAN:
+    case ExpressionType::LESS_THAN_EQUALS:
+    case ExpressionType::IS_NULL:
+    case ExpressionType::IS_NOT_NULL:
+    case ExpressionType::FUNCTION: {
+        visitFunctionExpr(expr);
+    } break;
+    case ExpressionType::AGGREGATE_FUNCTION: {
+        visitAggFunctionExpr(expr);
+    } break;
+    case ExpressionType::PROPERTY: {
+        visitPropertyExpr(expr);
+    } break;
+    case ExpressionType::LITERAL: {
+        visitLiteralExpr(expr);
+    } break;
+    case ExpressionType::VARIABLE: {
+        visitVariableExpr(expr);
+    } break;
+    case ExpressionType::PATH: {
+        visitPathExpr(expr);
+    } break;
+    case ExpressionType::PATTERN: {
+        visitNodeRelExpr(expr);
+    } break;
+    case ExpressionType::PARAMETER: {
+        visitParamExpr(expr);
+    } break;
+    case ExpressionType::SUBQUERY: {
+        visitSubqueryExpr(expr);
+    } break;
+    case ExpressionType::CASE_ELSE: {
+        visitCaseExpr(expr);
+    } break;
+    case ExpressionType::GRAPH: {
+        visitGraphExpr(expr);
+    } break;
+    case ExpressionType::LAMBDA: {
+        visitLambdaExpr(expr);
+    } break;
+        // LCOV_EXCL_START
+    default:
+        throw NotImplementedException("ExpressionVisitor::visitSwitch");
+        // LCOV_EXCL_STOP
+    }
+}
+
+void ExpressionVisitor::visitChildren(const Expression& expr) {
+    switch (expr.expressionType) {
+    case ExpressionType::CASE_ELSE: {
+        visitCaseExprChildren(expr);
+    } break;
+    case ExpressionType::LAMBDA: {
+        auto& lambda = expr.constCast<LambdaExpression>();
+        visit(lambda.getFunctionExpr());
+    } break;
+    default: {
+        for (auto& child : expr.getChildren()) {
+            visit(child);
+        }
+    }
+    }
+}
+
+void ExpressionVisitor::visitCaseExprChildren(const Expression& expr) {
+    auto& caseExpr = expr.constCast<CaseExpression>();
+    for (auto i = 0u; i < caseExpr.getNumCaseAlternatives(); ++i) {
+        auto caseAlternative = caseExpr.getCaseAlternative(i);
+        visit(caseAlternative->whenExpression);
+        visit(caseAlternative->thenExpression);
+    }
+    visit(caseExpr.getElseExpression());
+}
+
+expression_vector ExpressionChildrenCollector::collectChildren(const Expression& expression) {
+    switch (expression.expressionType) {
+    case ExpressionType::CASE_ELSE: {
+        return collectCaseChildren(expression);
+    }
+    case ExpressionType::SUBQUERY: {
+        return collectSubqueryChildren(expression);
+    }
+    case ExpressionType::PATTERN: {
+        switch (expression.dataType.getLogicalTypeID()) {
+        case LogicalTypeID::NODE: {
+            return collectNodeChildren(expression);
+        }
+        case LogicalTypeID::REL: {
+            return collectRelChildren(expression);
+        }
+        default: {
+            return expression_vector{};
+        }
+        }
+    }
+    default: {
+        return expression.children;
+    }
+    }
+}
+
+expression_vector ExpressionChildrenCollector::collectCaseChildren(const Expression& expression) {
+    expression_vector result;
+    auto& caseExpression = expression.constCast<CaseExpression>();
+    for (auto i = 0u; i < caseExpression.getNumCaseAlternatives(); ++i) {
+        auto caseAlternative = caseExpression.getCaseAlternative(i);
+        result.push_back(caseAlternative->whenExpression);
+        result.push_back(caseAlternative->thenExpression);
+    }
+    result.push_back(caseExpression.getElseExpression());
+    return result;
+}
+
+expression_vector ExpressionChildrenCollector::collectSubqueryChildren(
+    const Expression& expression) {
+    expression_vector result;
+    auto& subqueryExpression = expression.constCast<SubqueryExpression>();
+    for (auto& node : subqueryExpression.getQueryGraphCollection()->getQueryNodes()) {
+        result.push_back(node->getInternalID());
+    }
+    if (subqueryExpression.hasWhereExpression()) {
+        result.push_back(subqueryExpression.getWhereExpression());
+    }
+    return result;
+}
+
+expression_vector ExpressionChildrenCollector::collectNodeChildren(const Expression& expression) {
+    expression_vector result;
+    auto& node = expression.constCast<NodeExpression>();
+    for (auto& property : node.getPropertyExpressions()) {
+        result.push_back(property);
+    }
+    result.push_back(node.getInternalID());
+    return result;
+}
+
+expression_vector ExpressionChildrenCollector::collectRelChildren(const Expression& expression) {
+    expression_vector result;
+    auto& rel = expression.constCast<RelExpression>();
+    result.push_back(rel.getSrcNode()->getInternalID());
+    result.push_back(rel.getDstNode()->getInternalID());
+    for (auto& property : rel.getPropertyExpressions()) {
+        result.push_back(property);
+    }
+    if (rel.hasDirectionExpr()) {
+        result.push_back(rel.getDirectionExpr());
+    }
+    return result;
+}
+
+bool ExpressionVisitor::isRandom(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::FUNCTION) {
+        return false;
+    }
+    auto& funcExpr = expression.constCast<ScalarFunctionExpression>();
+    auto funcName = funcExpr.getFunction().name;
+    if (funcName == function::GenRandomUUIDFunction::name ||
+        funcName == function::RandFunction::name) {
+        return true;
+    }
+    for (auto& child : ExpressionChildrenCollector::collectChildren(expression)) {
+        if (isRandom(*child)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void DependentVarNameCollector::visitSubqueryExpr(std::shared_ptr<Expression> expr) {
+    auto& subqueryExpr = expr->constCast<SubqueryExpression>();
+    for (auto& node : subqueryExpr.getQueryGraphCollection()->getQueryNodes()) {
+        varNames.insert(node->getUniqueName());
+    }
+    if (subqueryExpr.hasWhereExpression()) {
+        visit(subqueryExpr.getWhereExpression());
+    }
+}
+
+void DependentVarNameCollector::visitPropertyExpr(std::shared_ptr<Expression> expr) {
+    varNames.insert(expr->constCast<PropertyExpression>().getVariableName());
+}
+
+void DependentVarNameCollector::visitNodeRelExpr(std::shared_ptr<Expression> expr) {
+    varNames.insert(expr->getUniqueName());
+    if (expr->getDataType().getLogicalTypeID() == LogicalTypeID::REL) {
+        auto& rel = expr->constCast<RelExpression>();
+        varNames.insert(rel.getSrcNodeName());
+        varNames.insert(rel.getDstNodeName());
+    }
+}
+
+void DependentVarNameCollector::visitVariableExpr(std::shared_ptr<Expression> expr) {
+    varNames.insert(expr->getUniqueName());
+}
+
+void PropertyExprCollector::visitSubqueryExpr(std::shared_ptr<Expression> expr) {
+    auto& subqueryExpr = expr->constCast<SubqueryExpression>();
+    for (auto& rel : subqueryExpr.getQueryGraphCollection()->getQueryRels()) {
+        if (rel->isEmpty() || rel->getRelType() != QueryRelType::NON_RECURSIVE) {
+            // If a query rel is empty then it does not have an internal id property.
+            continue;
+        }
+        expressions.push_back(rel->getInternalID());
+    }
+    if (subqueryExpr.hasWhereExpression()) {
+        visit(subqueryExpr.getWhereExpression());
+    }
+}
+
+void PropertyExprCollector::visitPropertyExpr(std::shared_ptr<Expression> expr) {
+    expressions.push_back(expr);
+}
+
+void PropertyExprCollector::visitNodeRelExpr(std::shared_ptr<Expression> expr) {
+    for (auto& property : expr->constCast<NodeOrRelExpression>().getPropertyExpressions()) {
+        expressions.push_back(property);
+    }
+}
+
+bool ConstantExpressionVisitor::needFold(const Expression& expr) {
+    if (expr.expressionType == common::ExpressionType::LITERAL) {
+        return false; // No need to fold a literal.
+    }
+    return isConstant(expr);
+}
+
+bool ConstantExpressionVisitor::isConstant(const Expression& expr) {
+    switch (expr.expressionType) {
+    case ExpressionType::LITERAL:
+        return true;
+    case ExpressionType::AGGREGATE_FUNCTION:
+    case ExpressionType::PROPERTY:
+    case ExpressionType::VARIABLE:
+    case ExpressionType::PATH:
+    case ExpressionType::PATTERN:
+    case ExpressionType::PARAMETER:
+    case ExpressionType::SUBQUERY:
+    case ExpressionType::GRAPH:
+    case ExpressionType::LAMBDA:
+        return false;
+    case ExpressionType::FUNCTION:
+        return visitFunction(expr);
+    case ExpressionType::CASE_ELSE:
+        return visitCase(expr);
+    case ExpressionType::OR:
+    case ExpressionType::XOR:
+    case ExpressionType::AND:
+    case ExpressionType::NOT:
+    case ExpressionType::EQUALS:
+    case ExpressionType::NOT_EQUALS:
+    case ExpressionType::GREATER_THAN:
+    case ExpressionType::GREATER_THAN_EQUALS:
+    case ExpressionType::LESS_THAN:
+    case ExpressionType::LESS_THAN_EQUALS:
+    case ExpressionType::IS_NULL:
+    case ExpressionType::IS_NOT_NULL:
+        return visitChildren(expr);
+        // LCOV_EXCL_START
+    default:
+        throw NotImplementedException("ConstantExpressionVisitor::isConstant");
+        // LCOV_EXCL_STOP
+    }
+}
+
+bool ConstantExpressionVisitor::visitFunction(const Expression& expr) {
+    auto& funcExpr = expr.constCast<ScalarFunctionExpression>();
+    if (funcExpr.getFunction().name == function::NextValFunction::name) {
+        return false;
+    }
+    if (funcExpr.getFunction().name == function::GenRandomUUIDFunction::name) {
+        return false;
+    }
+    if (funcExpr.getFunction().name == function::RandFunction::name) {
+        return false;
+    }
+    return visitChildren(expr);
+}
+
+bool ConstantExpressionVisitor::visitCase(const Expression& expr) {
+    auto& caseExpr = expr.constCast<CaseExpression>();
+    for (auto i = 0u; i < caseExpr.getNumCaseAlternatives(); ++i) {
+        auto caseAlternative = caseExpr.getCaseAlternative(i);
+        if (!isConstant(*caseAlternative->whenExpression)) {
+            return false;
+        }
+        if (!isConstant(*caseAlternative->thenExpression)) {
+            return false;
+        }
+    }
+    return isConstant(*caseExpr.getElseExpression());
+}
+
+bool ConstantExpressionVisitor::visitChildren(const Expression& expr) {
+    for (auto& child : expr.getChildren()) {
+        if (!isConstant(*child)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/CMakeLists.txt
new file mode 100644
index 0000000000..a80019b7c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/CMakeLists.txt
@@ -0,0 +1,13 @@
+add_library(
+        lbug_binder_query
+        OBJECT
+        bound_insert_clause.cpp
+        bound_delete_clause.cpp
+        bound_merge_clause.cpp
+        bound_set_clause.cpp
+        query_graph.cpp
+        query_graph_label_analyzer.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_query>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_delete_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_delete_clause.cpp
new file mode 100644
index 0000000000..e0270a7368
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_delete_clause.cpp
@@ -0,0 +1,29 @@
+#include "binder/query/updating_clause/bound_delete_clause.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+bool BoundDeleteClause::hasInfo(const std::function<bool(const BoundDeleteInfo&)>& check) const {
+    for (auto& info : infos) {
+        if (check(info)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::vector<BoundDeleteInfo> BoundDeleteClause::getInfos(
+    const std::function<bool(const BoundDeleteInfo&)>& check) const {
+    std::vector<BoundDeleteInfo> result;
+    for (auto& info : infos) {
+        if (check(info)) {
+            result.push_back(info.copy());
+        }
+    }
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_insert_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_insert_clause.cpp
new file mode 100644
index 0000000000..18982e3cb3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_insert_clause.cpp
@@ -0,0 +1,29 @@
+#include "binder/query/updating_clause/bound_insert_clause.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+bool BoundInsertClause::hasInfo(const std::function<bool(const BoundInsertInfo&)>& check) const {
+    for (auto& info : infos) {
+        if (check(info)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::vector<const BoundInsertInfo*> BoundInsertClause::getInfos(
+    const std::function<bool(const BoundInsertInfo&)>& check) const {
+    std::vector<const BoundInsertInfo*> result;
+    for (auto& info : infos) {
+        if (check(info)) {
+            result.push_back(&info);
+        }
+    }
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_merge_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_merge_clause.cpp
new file mode 100644
index 0000000000..9ea91b10fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_merge_clause.cpp
@@ -0,0 +1,72 @@
+#include "binder/query/updating_clause/bound_merge_clause.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+bool BoundMergeClause::hasInsertInfo(
+    const std::function<bool(const BoundInsertInfo&)>& check) const {
+    for (auto& info : insertInfos) {
+        if (check(info)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::vector<const BoundInsertInfo*> BoundMergeClause::getInsertInfos(
+    const std::function<bool(const BoundInsertInfo&)>& check) const {
+    std::vector<const BoundInsertInfo*> result;
+    for (auto& info : insertInfos) {
+        if (check(info)) {
+            result.push_back(&info);
+        }
+    }
+    return result;
+}
+
+bool BoundMergeClause::hasOnMatchSetInfo(
+    const std::function<bool(const BoundSetPropertyInfo&)>& check) const {
+    for (auto& info : onMatchSetPropertyInfos) {
+        if (check(info)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::vector<BoundSetPropertyInfo> BoundMergeClause::getOnMatchSetInfos(
+    const std::function<bool(const BoundSetPropertyInfo&)>& check) const {
+    std::vector<BoundSetPropertyInfo> result;
+    for (auto& info : onMatchSetPropertyInfos) {
+        if (check(info)) {
+            result.push_back(info.copy());
+        }
+    }
+    return result;
+}
+
+bool BoundMergeClause::hasOnCreateSetInfo(
+    const std::function<bool(const BoundSetPropertyInfo&)>& check) const {
+    for (auto& info : onCreateSetPropertyInfos) {
+        if (check(info)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::vector<BoundSetPropertyInfo> BoundMergeClause::getOnCreateSetInfos(
+    const std::function<bool(const BoundSetPropertyInfo&)>& check) const {
+    std::vector<BoundSetPropertyInfo> result;
+    for (auto& info : onCreateSetPropertyInfos) {
+        if (check(info)) {
+            result.push_back(info.copy());
+        }
+    }
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_set_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_set_clause.cpp
new file mode 100644
index 0000000000..0bb2dca194
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/bound_set_clause.cpp
@@ -0,0 +1,29 @@
+#include "binder/query/updating_clause/bound_set_clause.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+bool BoundSetClause::hasInfo(const std::function<bool(const BoundSetPropertyInfo&)>& check) const {
+    for (auto& info : infos) {
+        if (check(info)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::vector<BoundSetPropertyInfo> BoundSetClause::getInfos(
+    const std::function<bool(const BoundSetPropertyInfo&)>& check) const {
+    std::vector<BoundSetPropertyInfo> result;
+    for (auto& info : infos) {
+        if (check(info)) {
+            result.push_back(info.copy());
+        }
+    }
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/query_graph.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/query_graph.cpp
new file mode 100644
index 0000000000..0358a1afef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/query_graph.cpp
@@ -0,0 +1,338 @@
+#include "binder/query/query_graph.h"
+
+#include "binder/expression_visitor.h"
+
+namespace lbug {
+namespace binder {
+
+std::size_t SubqueryGraphHasher::operator()(const SubqueryGraph& key) const {
+    if (0 == key.queryRelsSelector.count()) {
+        return std::hash<std::bitset<MAX_NUM_QUERY_VARIABLES>>{}(key.queryNodesSelector);
+    }
+    return std::hash<std::bitset<MAX_NUM_QUERY_VARIABLES>>{}(key.queryRelsSelector);
+}
+
+bool SubqueryGraph::containAllVariables(const std::unordered_set<std::string>& variables) const {
+    for (auto& var : variables) {
+        if (queryGraph.containsQueryNode(var) &&
+            !queryNodesSelector[queryGraph.getQueryNodeIdx(var)]) {
+            return false;
+        }
+        if (queryGraph.containsQueryRel(var) &&
+            !queryRelsSelector[queryGraph.getQueryRelIdx(var)]) {
+            return false;
+        }
+    }
+    return true;
+}
+
+std::unordered_set<uint32_t> SubqueryGraph::getNodeNbrPositions() const {
+    std::unordered_set<uint32_t> result;
+    for (auto relPos = 0u; relPos < queryGraph.getNumQueryRels(); ++relPos) {
+        if (!queryRelsSelector[relPos]) { // rel not in subgraph, no need to check
+            continue;
+        }
+        auto rel = queryGraph.getQueryRel(relPos);
+        auto srcNodePos = queryGraph.getQueryNodeIdx(*rel->getSrcNode());
+        if (!queryNodesSelector[srcNodePos]) {
+            result.insert(srcNodePos);
+        }
+        auto dstNodePos = queryGraph.getQueryNodeIdx(*rel->getDstNode());
+        if (!queryNodesSelector[dstNodePos]) {
+            result.insert(dstNodePos);
+        }
+    }
+    return result;
+}
+
+std::unordered_set<uint32_t> SubqueryGraph::getRelNbrPositions() const {
+    std::unordered_set<uint32_t> result;
+    for (auto relPos = 0u; relPos < queryGraph.getNumQueryRels(); ++relPos) {
+        if (queryRelsSelector[relPos]) { // rel already in subgraph, cannot be rel neighbour
+            continue;
+        }
+        auto rel = queryGraph.getQueryRel(relPos);
+        auto srcNodePos = queryGraph.getQueryNodeIdx(*rel->getSrcNode());
+        auto dstNodePos = queryGraph.getQueryNodeIdx(*rel->getDstNode());
+        if (queryNodesSelector[srcNodePos] || queryNodesSelector[dstNodePos]) {
+            result.insert(relPos);
+        }
+    }
+    return result;
+}
+
+subquery_graph_set_t SubqueryGraph::getNbrSubgraphs(uint32_t size) const {
+    auto result = getBaseNbrSubgraph();
+    for (auto i = 1u; i < size; ++i) {
+        std::unordered_set<SubqueryGraph, SubqueryGraphHasher> tmp;
+        for (auto& prevNbr : result) {
+            for (auto& subgraph : getNextNbrSubgraphs(prevNbr)) {
+                tmp.insert(subgraph);
+            }
+        }
+        result = std::move(tmp);
+    }
+    return result;
+}
+
+std::vector<uint32_t> SubqueryGraph::getConnectedNodePos(const SubqueryGraph& nbr) const {
+    std::vector<uint32_t> result;
+    for (auto& nodePos : getNodeNbrPositions()) {
+        if (nbr.queryNodesSelector[nodePos]) {
+            result.push_back(nodePos);
+        }
+    }
+    for (auto& nodePos : nbr.getNodeNbrPositions()) {
+        if (queryNodesSelector[nodePos]) {
+            result.push_back(nodePos);
+        }
+    }
+    return result;
+}
+
+std::unordered_set<uint32_t> SubqueryGraph::getNodePositionsIgnoringNodeSelector() const {
+    std::unordered_set<uint32_t> result;
+    for (auto nodePos = 0u; nodePos < queryGraph.getNumQueryNodes(); ++nodePos) {
+        if (queryNodesSelector[nodePos]) {
+            result.insert(nodePos);
+        }
+    }
+    for (auto relPos = 0u; relPos < queryGraph.getNumQueryRels(); ++relPos) {
+        auto rel = queryGraph.getQueryRel(relPos);
+        if (queryRelsSelector[relPos]) {
+            result.insert(queryGraph.getQueryNodeIdx(rel->getSrcNodeName()));
+            result.insert(queryGraph.getQueryNodeIdx(rel->getDstNodeName()));
+        }
+    }
+    return result;
+}
+
+std::vector<common::idx_t> SubqueryGraph::getNbrNodeIndices() const {
+    std::unordered_set<common::idx_t> result;
+    for (auto i = 0u; i < queryGraph.getNumQueryRels(); ++i) {
+        if (!queryRelsSelector[i]) {
+            continue;
+        }
+        auto rel = queryGraph.getQueryRel(i);
+        auto srcNodePos = queryGraph.getQueryNodeIdx(rel->getSrcNodeName());
+        auto dstNodePos = queryGraph.getQueryNodeIdx(rel->getDstNodeName());
+        if (!queryNodesSelector[srcNodePos]) {
+            result.insert(srcNodePos);
+        }
+        if (!queryNodesSelector[dstNodePos]) {
+            result.insert(dstNodePos);
+        }
+    }
+    return std::vector<common::idx_t>{result.begin(), result.end()};
+}
+
+subquery_graph_set_t SubqueryGraph::getBaseNbrSubgraph() const {
+    subquery_graph_set_t result;
+    for (auto& nodePos : getNodeNbrPositions()) {
+        auto nbr = SubqueryGraph(queryGraph);
+        nbr.addQueryNode(nodePos);
+        result.insert(nbr);
+    }
+    for (auto& relPos : getRelNbrPositions()) {
+        auto nbr = SubqueryGraph(queryGraph);
+        nbr.addQueryRel(relPos);
+        result.insert(nbr);
+    }
+    return result;
+}
+
+subquery_graph_set_t SubqueryGraph::getNextNbrSubgraphs(const SubqueryGraph& prevNbr) const {
+    subquery_graph_set_t result;
+    for (auto& nodePos : prevNbr.getNodeNbrPositions()) {
+        if (queryNodesSelector[nodePos]) {
+            continue;
+        }
+        auto nbr = prevNbr;
+        nbr.addQueryNode(nodePos);
+        result.insert(nbr);
+    }
+    for (auto& relPos : prevNbr.getRelNbrPositions()) {
+        if (queryRelsSelector[relPos]) {
+            continue;
+        }
+        auto nbr = prevNbr;
+        nbr.addQueryRel(relPos);
+        result.insert(nbr);
+    }
+    return result;
+}
+
+bool QueryGraph::isEmpty() const {
+    for (auto& n : queryNodes) {
+        if (n->isEmpty()) {
+            return true;
+        }
+    }
+    for (auto& r : queryRels) {
+        if (r->isEmpty()) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::vector<std::shared_ptr<NodeOrRelExpression>> QueryGraph::getAllPatterns() const {
+    std::vector<std::shared_ptr<NodeOrRelExpression>> patterns;
+    for (auto& p : queryNodes) {
+        patterns.push_back(p);
+    }
+    for (auto& p : queryRels) {
+        patterns.push_back(p);
+    }
+    return patterns;
+}
+
+void QueryGraph::addQueryNode(std::shared_ptr<NodeExpression> queryNode) {
+    // Note that a node may be added multiple times. We should only keep one of it.
+    // E.g. MATCH (a:person)-[:knows]->(b:person), (a)-[:knows]->(c:person)
+    // a will be added twice during binding
+    if (containsQueryNode(queryNode->getUniqueName())) {
+        return;
+    }
+    queryNodeNameToPosMap.insert({queryNode->getUniqueName(), queryNodes.size()});
+    queryNodes.push_back(std::move(queryNode));
+}
+
+void QueryGraph::addQueryRel(std::shared_ptr<RelExpression> queryRel) {
+    if (containsQueryRel(queryRel->getUniqueName())) {
+        return;
+    }
+    queryRelNameToPosMap.insert({queryRel->getUniqueName(), queryRels.size()});
+    queryRels.push_back(std::move(queryRel));
+}
+
+void QueryGraph::merge(const QueryGraph& other) {
+    for (auto& otherNode : other.queryNodes) {
+        addQueryNode(otherNode);
+    }
+    for (auto& otherRel : other.queryRels) {
+        addQueryRel(otherRel);
+    }
+}
+
+bool QueryGraph::canProjectExpression(const std::shared_ptr<Expression>& expression) const {
+    auto collector = DependentVarNameCollector();
+    collector.visit(expression);
+    for (auto& variable : collector.getVarNames()) {
+        if (!containsQueryNode(variable) && !containsQueryRel(variable)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool QueryGraph::isConnected(const QueryGraph& other) const {
+    for (auto& queryNode : queryNodes) {
+        if (other.containsQueryNode(queryNode->getUniqueName())) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void QueryGraphCollection::merge(const QueryGraphCollection& other) {
+    for (auto& queryGraph : other.queryGraphs) {
+        addAndMergeQueryGraphIfConnected(queryGraph);
+    }
+    finalize();
+}
+
+void QueryGraphCollection::addAndMergeQueryGraphIfConnected(QueryGraph queryGraphToAdd) {
+    auto newQueryGraphSet = std::vector<QueryGraph>();
+    for (auto i = 0u; i < queryGraphs.size(); i++) {
+        auto queryGraph = std::move(queryGraphs[i]);
+        if (queryGraph.isConnected(queryGraphToAdd)) {
+            queryGraphToAdd.merge(queryGraph);
+        } else {
+            newQueryGraphSet.push_back(std::move(queryGraph));
+        }
+    }
+    newQueryGraphSet.push_back(std::move(queryGraphToAdd));
+    queryGraphs = std::move(newQueryGraphSet);
+}
+
+void QueryGraphCollection::finalize() {
+    common::idx_t baseGraphIdx = 0;
+    while (true) {
+        auto prevNumGraphs = queryGraphs.size();
+        queryGraphs = mergeGraphs(baseGraphIdx++);
+        if (queryGraphs.size() == prevNumGraphs || baseGraphIdx == queryGraphs.size()) {
+            return;
+        }
+    }
+}
+
+std::vector<QueryGraph> QueryGraphCollection::mergeGraphs(common::idx_t baseGraphIdx) {
+    KU_ASSERT(baseGraphIdx < queryGraphs.size());
+    auto& baseGraph = queryGraphs[baseGraphIdx];
+    std::unordered_set<common::idx_t> mergedGraphIndices;
+    mergedGraphIndices.insert(baseGraphIdx);
+    while (true) {
+        // find graph to merge
+        common::idx_t graphToMergeIdx = common::INVALID_IDX;
+        for (auto i = 0u; i < queryGraphs.size(); ++i) {
+            if (mergedGraphIndices.contains(i)) { // graph has been merged.
+                continue;
+            }
+            if (baseGraph.isConnected(queryGraphs[i])) { // find graph to merge.
+                graphToMergeIdx = i;
+                break;
+            }
+        }
+        if (graphToMergeIdx == common::INVALID_IDX) { // No graph can be merged. Terminate.
+            break;
+        }
+        // Perform merge
+        baseGraph.merge(queryGraphs[graphToMergeIdx]);
+        mergedGraphIndices.insert(graphToMergeIdx);
+    }
+    std::vector<QueryGraph> finalGraphs;
+    for (auto i = 0u; i < queryGraphs.size(); ++i) {
+        if (i == baseGraphIdx) {
+            finalGraphs.push_back(baseGraph);
+            continue;
+        }
+        if (mergedGraphIndices.contains(i)) {
+            continue;
+        }
+        finalGraphs.push_back(std::move(queryGraphs[i]));
+    }
+    return finalGraphs;
+}
+
+bool QueryGraphCollection::contains(const std::string& name) const {
+    for (auto& queryGraph : queryGraphs) {
+        if (queryGraph.containsQueryNode(name) || queryGraph.containsQueryRel(name)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::vector<std::shared_ptr<NodeExpression>> QueryGraphCollection::getQueryNodes() const {
+    std::vector<std::shared_ptr<NodeExpression>> result;
+    for (auto& queryGraph : queryGraphs) {
+        for (auto& node : queryGraph.getQueryNodes()) {
+            result.push_back(node);
+        }
+    }
+    return result;
+}
+
+std::vector<std::shared_ptr<RelExpression>> QueryGraphCollection::getQueryRels() const {
+    std::vector<std::shared_ptr<RelExpression>> result;
+    for (auto& queryGraph : queryGraphs) {
+        for (auto& rel : queryGraph.getQueryRels()) {
+            result.push_back(rel);
+        }
+    }
+    return result;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/query_graph_label_analyzer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/query_graph_label_analyzer.cpp
new file mode 100644
index 0000000000..094716e4db
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/query/query_graph_label_analyzer.cpp
@@ -0,0 +1,159 @@
+#include "binder/query/query_graph_label_analyzer.h"
+
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace binder {
+
+// NOLINTNEXTLINE(readability-non-const-parameter): graph is supposed to be modified.
+void QueryGraphLabelAnalyzer::pruneLabel(QueryGraph& graph) const {
+    for (auto i = 0u; i < graph.getNumQueryNodes(); ++i) {
+        pruneNode(graph, *graph.getQueryNode(i));
+    }
+    for (auto i = 0u; i < graph.getNumQueryRels(); ++i) {
+        pruneRel(*graph.getQueryRel(i));
+    }
+}
+
+struct Candidates {
+    table_id_set_t idSet;
+    std::unordered_set<std::string> nameSet;
+
+    void insert(const table_id_set_t& idsToInsert, Catalog* catalog, Transaction* transaction) {
+        for (auto id : idsToInsert) {
+            auto name = catalog->getTableCatalogEntry(transaction, id)->getName();
+            idSet.insert(id);
+            nameSet.insert(name);
+        }
+    }
+
+    bool empty() const { return idSet.empty(); }
+
+    bool contains(const table_id_t& id) const { return idSet.contains(id); }
+
+    std::string toString() const {
+        auto names = std::vector<std::string>{nameSet.begin(), nameSet.end()};
+        auto result = names[0];
+        for (auto j = 1u; j < names.size(); ++j) {
+            result += ", " + names[j];
+        }
+        return result;
+    }
+};
+
+void QueryGraphLabelAnalyzer::pruneNode(const QueryGraph& graph, NodeExpression& node) const {
+    auto catalog = Catalog::Get(clientContext);
+    for (auto i = 0u; i < graph.getNumQueryRels(); ++i) {
+        auto queryRel = graph.getQueryRel(i);
+        if (queryRel->isRecursive()) {
+            continue;
+        }
+        Candidates candidates;
+        auto isSrcConnect = *queryRel->getSrcNode() == node;
+        auto isDstConnect = *queryRel->getDstNode() == node;
+        auto tx = transaction::Transaction::Get(clientContext);
+        if (queryRel->getDirectionType() == RelDirectionType::BOTH) {
+            if (isSrcConnect || isDstConnect) {
+                for (auto entry : queryRel->getEntries()) {
+                    auto& relEntry = entry->constCast<RelGroupCatalogEntry>();
+                    candidates.insert(relEntry.getSrcNodeTableIDSet(), catalog, tx);
+                    candidates.insert(relEntry.getDstNodeTableIDSet(), catalog, tx);
+                }
+            }
+        } else {
+            if (isSrcConnect) {
+                for (auto entry : queryRel->getEntries()) {
+                    auto& relEntry = entry->constCast<RelGroupCatalogEntry>();
+                    candidates.insert(relEntry.getSrcNodeTableIDSet(), catalog, tx);
+                }
+            } else if (isDstConnect) {
+                for (auto entry : queryRel->getEntries()) {
+                    auto& relEntry = entry->constCast<RelGroupCatalogEntry>();
+                    candidates.insert(relEntry.getDstNodeTableIDSet(), catalog, tx);
+                }
+            }
+        }
+        if (candidates.empty()) { // No need to prune.
+            continue;
+        }
+        std::vector<TableCatalogEntry*> prunedEntries;
+        for (auto entry : node.getEntries()) {
+            if (!candidates.contains(entry->getTableID())) {
+                continue;
+            }
+            prunedEntries.push_back(entry);
+        }
+        node.setEntries(prunedEntries);
+        if (prunedEntries.empty()) {
+            if (throwOnViolate) {
+                throw BinderException(
+                    stringFormat("Query node {} violates schema. Expected labels are {}.",
+                        node.toString(), candidates.toString()));
+            }
+        }
+    }
+}
+
+bool hasOverlap(const table_id_set_t& left, const table_id_set_t& right) {
+    for (auto id : left) {
+        if (right.contains(id)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void QueryGraphLabelAnalyzer::pruneRel(RelExpression& rel) const {
+    if (rel.isRecursive()) {
+        return;
+    }
+    std::vector<TableCatalogEntry*> prunedEntries;
+    auto srcTableIDSet = rel.getSrcNode()->getTableIDsSet();
+    auto dstTableIDSet = rel.getDstNode()->getTableIDsSet();
+    if (rel.getDirectionType() == RelDirectionType::BOTH) {
+        for (auto& entry : rel.getEntries()) {
+            auto& relEntry = entry->constCast<RelGroupCatalogEntry>();
+            auto fwdSrcOverlap = hasOverlap(srcTableIDSet, relEntry.getSrcNodeTableIDSet());
+            auto fwdDstOverlap = hasOverlap(dstTableIDSet, relEntry.getDstNodeTableIDSet());
+            auto fwdOverlap = fwdSrcOverlap && fwdDstOverlap;
+            auto bwdSrcOverlap = hasOverlap(dstTableIDSet, relEntry.getSrcNodeTableIDSet());
+            auto bwdDstOverlap = hasOverlap(srcTableIDSet, relEntry.getDstNodeTableIDSet());
+            auto bwdOverlap = bwdSrcOverlap && bwdDstOverlap;
+            if (fwdOverlap || bwdOverlap) {
+                prunedEntries.push_back(entry);
+            }
+        }
+    } else {
+        for (auto& entry : rel.getEntries()) {
+            auto& relEntry = entry->constCast<RelGroupCatalogEntry>();
+            auto srcOverlap = hasOverlap(srcTableIDSet, relEntry.getSrcNodeTableIDSet());
+            auto dstOverlap = hasOverlap(dstTableIDSet, relEntry.getDstNodeTableIDSet());
+            if (srcOverlap && dstOverlap) {
+                prunedEntries.push_back(entry);
+            }
+        }
+    }
+    rel.setEntries(prunedEntries);
+    // Note the pruning for node should guarantee the following exception won't be triggered.
+    // For safety (and consistency) reason, we still write the check but skip coverage check.
+    // LCOV_EXCL_START
+    if (prunedEntries.empty()) {
+        if (throwOnViolate) {
+            throw BinderException(stringFormat("Cannot find a label for relationship {} that "
+                                               "connects to all of its neighbour nodes.",
+                rel.toString()));
+        }
+    }
+    // LCOV_EXCL_STOP
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/CMakeLists.txt
new file mode 100644
index 0000000000..1b3788ca13
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/CMakeLists.txt
@@ -0,0 +1,10 @@
+add_library(
+        lbug_binder_rewriter
+        OBJECT
+        match_clause_pattern_label_rewriter.cpp
+        normalized_query_part_match_rewriter.cpp
+        with_clause_projection_rewriter.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_rewriter>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/match_clause_pattern_label_rewriter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/match_clause_pattern_label_rewriter.cpp
new file mode 100644
index 0000000000..405eb12af1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/match_clause_pattern_label_rewriter.cpp
@@ -0,0 +1,22 @@
+#include "binder/rewriter/match_clause_pattern_label_rewriter.h"
+
+#include "binder/query/reading_clause/bound_match_clause.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+void MatchClausePatternLabelRewriter::visitMatchUnsafe(BoundReadingClause& readingClause) {
+    auto& matchClause = readingClause.cast<BoundMatchClause>();
+    if (matchClause.getMatchClauseType() == MatchClauseType::OPTIONAL_MATCH) {
+        return;
+    }
+    auto collection = matchClause.getQueryGraphCollectionUnsafe();
+    for (auto i = 0u; i < collection->getNumQueryGraphs(); ++i) {
+        analyzer.pruneLabel(*collection->getQueryGraphUnsafe(i));
+    }
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/normalized_query_part_match_rewriter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/normalized_query_part_match_rewriter.cpp
new file mode 100644
index 0000000000..b4db8e2652
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/normalized_query_part_match_rewriter.cpp
@@ -0,0 +1,48 @@
+#include "binder/rewriter/normalized_query_part_match_rewriter.h"
+
+#include "binder/binder.h"
+#include "binder/query/reading_clause/bound_match_clause.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+static bool canRewrite(const BoundMatchClause& matchClause) {
+    return !matchClause.hasHint() &&
+           matchClause.getMatchClauseType() != MatchClauseType::OPTIONAL_MATCH;
+}
+
+void NormalizedQueryPartMatchRewriter::visitQueryPartUnsafe(NormalizedQueryPart& queryPart) {
+    if (queryPart.getNumReadingClause() == 0) {
+        return;
+    }
+    for (auto i = 0u; i < queryPart.getNumReadingClause(); i++) {
+        if (queryPart.getReadingClause(i)->getClauseType() != ClauseType::MATCH) {
+            return;
+        }
+        auto& match = queryPart.getReadingClause(i)->constCast<BoundMatchClause>();
+        if (!canRewrite(match)) {
+            return;
+        }
+    }
+    // Merge consecutive match clauses
+    std::vector<std::unique_ptr<BoundReadingClause>> newReadingClauses;
+    newReadingClauses.push_back(std::move(queryPart.readingClauses[0]));
+    auto& leadingMatchClause = newReadingClauses[0]->cast<BoundMatchClause>();
+    auto binder = Binder(clientContext);
+    auto expressionBinder = binder.getExpressionBinder();
+    for (auto idx = 1u; idx < queryPart.getNumReadingClause(); idx++) {
+        auto& otherMatchClause = queryPart.readingClauses[idx]->constCast<BoundMatchClause>();
+        leadingMatchClause.getQueryGraphCollectionUnsafe()->merge(
+            *otherMatchClause.getQueryGraphCollection());
+        auto predicate = expressionBinder->combineBooleanExpressions(ExpressionType::AND,
+            leadingMatchClause.getPredicate(), otherMatchClause.getPredicate());
+        leadingMatchClause.setPredicate(std::move(predicate));
+    }
+    // Move remaining reading clause
+    queryPart.readingClauses = std::move(newReadingClauses);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/with_clause_projection_rewriter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/with_clause_projection_rewriter.cpp
new file mode 100644
index 0000000000..63dba5a0a6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/rewriter/with_clause_projection_rewriter.cpp
@@ -0,0 +1,101 @@
+#include "binder/rewriter/with_clause_projection_rewriter.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/expression/node_expression.h"
+#include "binder/expression/property_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "binder/expression_visitor.h"
+#include "binder/visitor/property_collector.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+static void rewrite(std::shared_ptr<Expression> expr, expression_vector& projectionList,
+    const std::unordered_map<std::string, expression_vector>& varNameToProperties) {
+    std::string varName;
+    if (ExpressionUtil::isNodePattern(*expr)) {
+        auto& node = expr->constCast<NodeExpression>();
+        projectionList.push_back(node.getInternalID());
+        varName = node.getUniqueName();
+    } else if (ExpressionUtil::isRelPattern(*expr)) {
+        auto& rel = expr->constCast<RelExpression>();
+        projectionList.push_back(rel.getSrcNode()->getInternalID());
+        projectionList.push_back(rel.getDstNode()->getInternalID());
+        projectionList.push_back(rel.getInternalID());
+        if (rel.hasDirectionExpr()) {
+            projectionList.push_back(rel.getDirectionExpr());
+        }
+        varName = rel.getUniqueName();
+    } else if (ExpressionUtil::isRecursiveRelPattern(*expr)) {
+        auto& rel = expr->constCast<RelExpression>();
+        projectionList.push_back(rel.getLengthExpression());
+        projectionList.push_back(expr);
+        varName = rel.getUniqueName();
+    }
+    if (!varName.empty()) {
+        if (varNameToProperties.contains(varName)) {
+            for (auto& property : varNameToProperties.at(varName)) {
+                projectionList.push_back(property);
+            }
+        }
+    } else {
+        projectionList.push_back(expr);
+    }
+}
+
+static expression_vector rewrite(const expression_vector& exprs,
+    const std::unordered_map<std::string, expression_vector>& varNameToProperties) {
+    expression_vector projectionList;
+    for (auto& expr : exprs) {
+        rewrite(expr, projectionList, varNameToProperties);
+    }
+    return projectionList;
+}
+
+void WithClauseProjectionRewriter::visitSingleQueryUnsafe(NormalizedSingleQuery& singleQuery) {
+    auto propertyCollector = PropertyCollector();
+    propertyCollector.visitSingleQuerySkipNodeRel(singleQuery);
+    std::unordered_map<std::string, expression_vector> varNameToProperties;
+    for (auto& expr : propertyCollector.getProperties()) {
+        auto& property = expr->constCast<PropertyExpression>();
+        if (!varNameToProperties.contains(property.getVariableName())) {
+            varNameToProperties.insert({property.getVariableName(), expression_vector{}});
+        }
+        varNameToProperties.at(property.getVariableName()).push_back(expr);
+    }
+    // Rewrite WITH clause node, relationship pattern projection as node.* & rel.*
+    // Because we want to delay the evaluation of node and rel as a struct.
+    for (auto i = 0u; i < singleQuery.getNumQueryParts() - 1; ++i) {
+        auto queryPart = singleQuery.getQueryPartUnsafe(i);
+        auto projectionBody = queryPart->getProjectionBodyUnsafe();
+        auto newProjectionExprs =
+            rewrite(projectionBody->getProjectionExpressions(), varNameToProperties);
+        projectionBody->setProjectionExpressions(std::move(newProjectionExprs));
+        auto newGroupByExprs =
+            rewrite(projectionBody->getGroupByExpressions(), varNameToProperties);
+        projectionBody->setGroupByExpressions(std::move(newGroupByExprs));
+    }
+    // Remove constant expressions from WITH clause projection list.
+    for (auto i = 0u; i < singleQuery.getNumQueryParts() - 1; ++i) {
+        auto queryPart = singleQuery.getQueryPartUnsafe(i);
+        auto projectionBody = queryPart->getProjectionBodyUnsafe();
+        // Avoid rewrite in the case of ORDER BY 1 or aggregate by constant. Because operator
+        // implementation replies on expressions to be projected first.
+        if (projectionBody->hasOrderByExpressions() || projectionBody->hasAggregateExpressions()) {
+            continue;
+        }
+        expression_vector nonConstantProjectionExprs;
+        for (auto& expr : projectionBody->getProjectionExpressions()) {
+            if (ConstantExpressionVisitor::isConstant(*expr)) {
+                continue;
+            }
+            nonConstantProjectionExprs.push_back(expr);
+        }
+        projectionBody->setProjectionExpressions(nonConstantProjectionExprs);
+    }
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/CMakeLists.txt
new file mode 100644
index 0000000000..413008bf8b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/CMakeLists.txt
@@ -0,0 +1,10 @@
+add_library(
+        lbug_binder_visitor
+        OBJECT
+        confidential_statement_analyzer.cpp
+        default_type_solver.cpp
+        property_collector.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_binder_visitor>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/confidential_statement_analyzer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/confidential_statement_analyzer.cpp
new file mode 100644
index 0000000000..17f741b304
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/confidential_statement_analyzer.cpp
@@ -0,0 +1,17 @@
+#include "binder/visitor/confidential_statement_analyzer.h"
+
+#include "binder/bound_standalone_call.h"
+#include "main/db_config.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+void ConfidentialStatementAnalyzer::visitStandaloneCall(const BoundStatement& boundStatement) {
+    auto& standaloneCall = boundStatement.constCast<BoundStandaloneCall>();
+    confidentialStatement = standaloneCall.getOption()->isConfidential;
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/default_type_solver.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/default_type_solver.cpp
new file mode 100644
index 0000000000..947ef3e208
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/default_type_solver.cpp
@@ -0,0 +1,25 @@
+#include "binder/visitor/default_type_solver.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+static void resolveAnyType(Expression& expr) {
+    if (expr.getDataType().getLogicalTypeID() != LogicalTypeID::ANY) {
+        return;
+    }
+    expr.cast(LogicalType::STRING());
+}
+
+void DefaultTypeSolver::visitProjectionBody(const BoundProjectionBody& projectionBody) {
+    for (auto& expr : projectionBody.getProjectionExpressions()) {
+        resolveAnyType(*expr);
+    }
+    for (auto& expr : projectionBody.getOrderByExpressions()) {
+        resolveAnyType(*expr);
+    }
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/property_collector.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/property_collector.cpp
new file mode 100644
index 0000000000..3f0902b087
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/binder/visitor/property_collector.cpp
@@ -0,0 +1,180 @@
+#include "binder/visitor/property_collector.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/expression_visitor.h"
+#include "binder/query/reading_clause/bound_load_from.h"
+#include "binder/query/reading_clause/bound_match_clause.h"
+#include "binder/query/reading_clause/bound_table_function_call.h"
+#include "binder/query/reading_clause/bound_unwind_clause.h"
+#include "binder/query/updating_clause/bound_delete_clause.h"
+#include "binder/query/updating_clause/bound_insert_clause.h"
+#include "binder/query/updating_clause/bound_merge_clause.h"
+#include "binder/query/updating_clause/bound_set_clause.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace binder {
+
+expression_vector PropertyCollector::getProperties() const {
+    expression_vector result;
+    for (auto& property : properties) {
+        result.push_back(property);
+    }
+    return result;
+}
+
+void PropertyCollector::visitSingleQuerySkipNodeRel(const NormalizedSingleQuery& singleQuery) {
+    KU_ASSERT(singleQuery.getNumQueryParts() != 0);
+    auto numQueryParts = singleQuery.getNumQueryParts();
+    for (auto i = 0u; i < numQueryParts - 1; ++i) {
+        visitQueryPartSkipNodeRel(*singleQuery.getQueryPart(i));
+    }
+    visitQueryPart(*singleQuery.getQueryPart(numQueryParts - 1));
+}
+
+void PropertyCollector::visitQueryPartSkipNodeRel(const NormalizedQueryPart& queryPart) {
+    for (auto i = 0u; i < queryPart.getNumReadingClause(); ++i) {
+        visitReadingClause(*queryPart.getReadingClause(i));
+    }
+    for (auto i = 0u; i < queryPart.getNumUpdatingClause(); ++i) {
+        visitUpdatingClause(*queryPart.getUpdatingClause(i));
+    }
+    if (queryPart.hasProjectionBody()) {
+        visitProjectionBodySkipNodeRel(*queryPart.getProjectionBody());
+        if (queryPart.hasProjectionBodyPredicate()) {
+            visitProjectionBodyPredicate(queryPart.getProjectionBodyPredicate());
+        }
+    }
+}
+
+void PropertyCollector::visitMatch(const BoundReadingClause& readingClause) {
+    auto& matchClause = readingClause.constCast<BoundMatchClause>();
+    if (matchClause.hasPredicate()) {
+        collectProperties(matchClause.getPredicate());
+    }
+}
+
+void PropertyCollector::visitUnwind(const BoundReadingClause& readingClause) {
+    auto& unwindClause = readingClause.constCast<BoundUnwindClause>();
+    collectProperties(unwindClause.getInExpr());
+}
+
+void PropertyCollector::visitLoadFrom(const BoundReadingClause& readingClause) {
+    auto& loadFromClause = readingClause.constCast<BoundLoadFrom>();
+    if (loadFromClause.hasPredicate()) {
+        collectProperties(loadFromClause.getPredicate());
+    }
+}
+
+void PropertyCollector::visitTableFunctionCall(const BoundReadingClause& readingClause) {
+    auto& call = readingClause.constCast<BoundTableFunctionCall>();
+    if (call.hasPredicate()) {
+        collectProperties(call.getPredicate());
+    }
+}
+
+void PropertyCollector::visitSet(const BoundUpdatingClause& updatingClause) {
+    auto& boundSetClause = updatingClause.constCast<BoundSetClause>();
+    for (auto& info : boundSetClause.getInfos()) {
+        collectProperties(info.columnData);
+    }
+    for (const auto& info : boundSetClause.getRelInfos()) {
+        auto& rel = info.pattern->constCast<RelExpression>();
+        KU_ASSERT(!rel.isEmpty() && rel.getRelType() == QueryRelType::NON_RECURSIVE);
+        properties.insert(rel.getInternalID());
+    }
+}
+
+void PropertyCollector::visitDelete(const BoundUpdatingClause& updatingClause) {
+    auto& boundDeleteClause = updatingClause.constCast<BoundDeleteClause>();
+    // Read primary key if we are deleting nodes;
+    for (const auto& info : boundDeleteClause.getNodeInfos()) {
+        auto& node = info.pattern->constCast<NodeExpression>();
+        for (const auto entry : node.getEntries()) {
+            properties.insert(node.getPrimaryKey(entry->getTableID()));
+        }
+    }
+    // Read rel internal id if we are deleting relationships.
+    for (const auto& info : boundDeleteClause.getRelInfos()) {
+        auto& rel = info.pattern->constCast<RelExpression>();
+        if (!rel.isEmpty() && rel.getRelType() == QueryRelType::NON_RECURSIVE) {
+            properties.insert(rel.getInternalID());
+        }
+    }
+}
+
+void PropertyCollector::visitInsert(const BoundUpdatingClause& updatingClause) {
+    auto& insertClause = updatingClause.constCast<BoundInsertClause>();
+    for (auto& info : insertClause.getInfos()) {
+        for (auto& expr : info.columnDataExprs) {
+            collectProperties(expr);
+        }
+    }
+}
+
+void PropertyCollector::visitMerge(const BoundUpdatingClause& updatingClause) {
+    auto& boundMergeClause = updatingClause.constCast<BoundMergeClause>();
+    for (auto& rel : boundMergeClause.getQueryGraphCollection()->getQueryRels()) {
+        if (rel->getRelType() == QueryRelType::NON_RECURSIVE) {
+            properties.insert(rel->getInternalID());
+        }
+    }
+    if (boundMergeClause.hasPredicate()) {
+        collectProperties(boundMergeClause.getPredicate());
+    }
+    for (auto& info : boundMergeClause.getInsertInfosRef()) {
+        for (auto& expr : info.columnDataExprs) {
+            collectProperties(expr);
+        }
+    }
+    for (auto& info : boundMergeClause.getOnMatchSetInfosRef()) {
+        collectProperties(info.columnData);
+    }
+    for (auto& info : boundMergeClause.getOnCreateSetInfosRef()) {
+        collectProperties(info.columnData);
+    }
+}
+
+void PropertyCollector::visitProjectionBodySkipNodeRel(const BoundProjectionBody& projectionBody) {
+    for (auto& expression : projectionBody.getProjectionExpressions()) {
+        collectPropertiesSkipNodeRel(expression);
+    }
+    for (auto& expression : projectionBody.getOrderByExpressions()) {
+        collectPropertiesSkipNodeRel(expression);
+    }
+}
+
+void PropertyCollector::visitProjectionBody(const BoundProjectionBody& projectionBody) {
+    for (auto& expression : projectionBody.getProjectionExpressions()) {
+        collectProperties(expression);
+    }
+    for (auto& expression : projectionBody.getOrderByExpressions()) {
+        collectProperties(expression);
+    }
+}
+
+void PropertyCollector::visitProjectionBodyPredicate(const std::shared_ptr<Expression>& predicate) {
+    collectProperties(predicate);
+}
+
+void PropertyCollector::collectProperties(const std::shared_ptr<Expression>& expression) {
+    auto collector = PropertyExprCollector();
+    collector.visit(expression);
+    for (auto& expr : collector.getPropertyExprs()) {
+        properties.insert(expr);
+    }
+}
+
+void PropertyCollector::collectPropertiesSkipNodeRel(
+    const std::shared_ptr<Expression>& expression) {
+    if (ExpressionUtil::isNodePattern(*expression) || ExpressionUtil::isRelPattern(*expression) ||
+        ExpressionUtil::isRecursiveRelPattern(*expression)) {
+        return;
+    }
+    collectProperties(expression);
+}
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/CMakeLists.txt
new file mode 100644
index 0000000000..619e092e13
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/CMakeLists.txt
@@ -0,0 +1,16 @@
+add_library(lbug_c_api
+        OBJECT
+        connection.cpp
+        database.cpp
+        data_type.cpp
+        helpers.cpp
+        flat_tuple.cpp
+        prepared_statement.cpp
+        query_result.cpp
+        query_summary.cpp
+        value.cpp
+        version.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_c_api>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/connection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/connection.cpp
new file mode 100644
index 0000000000..ab70353174
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/connection.cpp
@@ -0,0 +1,157 @@
+#include "c_api/lbug.h"
+#include "common/exception/exception.h"
+#include "main/lbug.h"
+
+namespace lbug {
+namespace common {
+class Value;
+}
+} // namespace lbug
+
+using namespace lbug::common;
+using namespace lbug::main;
+
+lbug_state lbug_connection_init(lbug_database* database, lbug_connection* out_connection) {
+    if (database == nullptr || database->_database == nullptr) {
+        out_connection->_connection = nullptr;
+        return LbugError;
+    }
+    try {
+        out_connection->_connection = new Connection(static_cast<Database*>(database->_database));
+    } catch (Exception& e) {
+        out_connection->_connection = nullptr;
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+void lbug_connection_destroy(lbug_connection* connection) {
+    if (connection == nullptr) {
+        return;
+    }
+    if (connection->_connection != nullptr) {
+        delete static_cast<Connection*>(connection->_connection);
+    }
+}
+
+lbug_state lbug_connection_set_max_num_thread_for_exec(lbug_connection* connection,
+    uint64_t num_threads) {
+    if (connection == nullptr || connection->_connection == nullptr) {
+        return LbugError;
+    }
+    try {
+        static_cast<Connection*>(connection->_connection)->setMaxNumThreadForExec(num_threads);
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_connection_get_max_num_thread_for_exec(lbug_connection* connection,
+    uint64_t* out_result) {
+    if (connection == nullptr || connection->_connection == nullptr) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Connection*>(connection->_connection)->getMaxNumThreadForExec();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_connection_query(lbug_connection* connection, const char* query,
+    lbug_query_result* out_query_result) {
+    if (connection == nullptr || connection->_connection == nullptr) {
+        return LbugError;
+    }
+    try {
+        auto query_result =
+            static_cast<Connection*>(connection->_connection)->query(query).release();
+        if (query_result == nullptr) {
+            return LbugError;
+        }
+        out_query_result->_query_result = query_result;
+        out_query_result->_is_owned_by_cpp = false;
+        if (!query_result->isSuccess()) {
+            return LbugError;
+        }
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_connection_prepare(lbug_connection* connection, const char* query,
+    lbug_prepared_statement* out_prepared_statement) {
+    if (connection == nullptr || connection->_connection == nullptr) {
+        return LbugError;
+    }
+    try {
+        auto prepared_statement =
+            static_cast<Connection*>(connection->_connection)->prepare(query).release();
+        if (prepared_statement == nullptr) {
+            return LbugError;
+        }
+        out_prepared_statement->_prepared_statement = prepared_statement;
+        out_prepared_statement->_bound_values =
+            new std::unordered_map<std::string, std::unique_ptr<Value>>;
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_connection_execute(lbug_connection* connection,
+    lbug_prepared_statement* prepared_statement, lbug_query_result* out_query_result) {
+    if (connection == nullptr || connection->_connection == nullptr ||
+        prepared_statement == nullptr || prepared_statement->_prepared_statement == nullptr ||
+        prepared_statement->_bound_values == nullptr) {
+        return LbugError;
+    }
+    try {
+        auto prepared_statement_ptr =
+            static_cast<PreparedStatement*>(prepared_statement->_prepared_statement);
+        auto bound_values = static_cast<std::unordered_map<std::string, std::unique_ptr<Value>>*>(
+            prepared_statement->_bound_values);
+
+        // Must copy the parameters for safety, and so that the parameters in the prepared statement
+        // stay the same.
+        std::unordered_map<std::string, std::unique_ptr<Value>> copied_bound_values;
+        for (auto& [name, value] : *bound_values) {
+            copied_bound_values.emplace(name, value->copy());
+        }
+
+        auto query_result =
+            static_cast<Connection*>(connection->_connection)
+                ->executeWithParams(prepared_statement_ptr, std::move(copied_bound_values))
+                .release();
+        if (query_result == nullptr) {
+            return LbugError;
+        }
+        out_query_result->_query_result = query_result;
+        out_query_result->_is_owned_by_cpp = false;
+        if (!query_result->isSuccess()) {
+            return LbugError;
+        }
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+void lbug_connection_interrupt(lbug_connection* connection) {
+    static_cast<Connection*>(connection->_connection)->interrupt();
+}
+
+lbug_state lbug_connection_set_query_timeout(lbug_connection* connection, uint64_t timeout_in_ms) {
+    if (connection == nullptr || connection->_connection == nullptr) {
+        return LbugError;
+    }
+    try {
+        static_cast<Connection*>(connection->_connection)->setQueryTimeOut(timeout_in_ms);
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/data_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/data_type.cpp
new file mode 100644
index 0000000000..37c57ca848
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/data_type.cpp
@@ -0,0 +1,70 @@
+#include "c_api/lbug.h"
+#include "common/types/types.h"
+
+using namespace lbug::common;
+
+namespace lbug::common {
+struct CAPIHelper {
+    static inline LogicalType* createLogicalType(LogicalTypeID typeID,
+        std::unique_ptr<ExtraTypeInfo> extraTypeInfo) {
+        return new LogicalType(typeID, std::move(extraTypeInfo));
+    }
+};
+} // namespace lbug::common
+
+void lbug_data_type_create(lbug_data_type_id id, lbug_logical_type* child_type,
+    uint64_t num_elements_in_array, lbug_logical_type* out_data_type) {
+    uint8_t data_type_id_u8 = id;
+    LogicalType* data_type = nullptr;
+    auto logicalTypeID = static_cast<LogicalTypeID>(data_type_id_u8);
+    if (child_type == nullptr) {
+        data_type = new LogicalType(logicalTypeID);
+    } else {
+        auto child_type_pty = static_cast<LogicalType*>(child_type->_data_type)->copy();
+        auto extraTypeInfo =
+            num_elements_in_array > 0 ?
+                std::make_unique<ArrayTypeInfo>(std::move(child_type_pty), num_elements_in_array) :
+                std::make_unique<ListTypeInfo>(std::move(child_type_pty));
+        data_type = CAPIHelper::createLogicalType(logicalTypeID, std::move(extraTypeInfo));
+    }
+    out_data_type->_data_type = data_type;
+}
+
+void lbug_data_type_clone(lbug_logical_type* data_type, lbug_logical_type* out_data_type) {
+    out_data_type->_data_type =
+        new LogicalType(static_cast<LogicalType*>(data_type->_data_type)->copy());
+}
+
+void lbug_data_type_destroy(lbug_logical_type* data_type) {
+    if (data_type == nullptr) {
+        return;
+    }
+    if (data_type->_data_type != nullptr) {
+        delete static_cast<LogicalType*>(data_type->_data_type);
+    }
+}
+
+bool lbug_data_type_equals(lbug_logical_type* data_type1, lbug_logical_type* data_type2) {
+    return *static_cast<LogicalType*>(data_type1->_data_type) ==
+           *static_cast<LogicalType*>(data_type2->_data_type);
+}
+
+lbug_data_type_id lbug_data_type_get_id(lbug_logical_type* data_type) {
+    auto data_type_id_u8 =
+        static_cast<uint8_t>(static_cast<LogicalType*>(data_type->_data_type)->getLogicalTypeID());
+    return static_cast<lbug_data_type_id>(data_type_id_u8);
+}
+
+lbug_state lbug_data_type_get_num_elements_in_array(lbug_logical_type* data_type,
+    uint64_t* out_result) {
+    auto parent_type = static_cast<LogicalType*>(data_type->_data_type);
+    if (parent_type->getLogicalTypeID() != LogicalTypeID::ARRAY) {
+        return LbugError;
+    }
+    try {
+        *out_result = ArrayType::getNumElements(*parent_type);
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/database.cpp
new file mode 100644
index 0000000000..80c60689dd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/database.cpp
@@ -0,0 +1,49 @@
+#include "c_api/lbug.h"
+#include "common/exception/exception.h"
+#include "main/lbug.h"
+using namespace lbug::main;
+using namespace lbug::common;
+
+lbug_state lbug_database_init(const char* database_path, lbug_system_config config,
+    lbug_database* out_database) {
+    try {
+        std::string database_path_str = database_path;
+        auto systemConfig = SystemConfig(config.buffer_pool_size, config.max_num_threads,
+            config.enable_compression, config.read_only, config.max_db_size, config.auto_checkpoint,
+            config.checkpoint_threshold);
+
+#if defined(__APPLE__)
+        systemConfig.threadQos = config.thread_qos;
+#endif
+        out_database->_database = new Database(database_path_str, systemConfig);
+    } catch (Exception& e) {
+        out_database->_database = nullptr;
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+void lbug_database_destroy(lbug_database* database) {
+    if (database == nullptr) {
+        return;
+    }
+    if (database->_database != nullptr) {
+        delete static_cast<Database*>(database->_database);
+    }
+}
+
+lbug_system_config lbug_default_system_config() {
+    SystemConfig config = SystemConfig();
+    auto cSystemConfig = lbug_system_config();
+    cSystemConfig.buffer_pool_size = config.bufferPoolSize;
+    cSystemConfig.max_num_threads = config.maxNumThreads;
+    cSystemConfig.enable_compression = config.enableCompression;
+    cSystemConfig.read_only = config.readOnly;
+    cSystemConfig.max_db_size = config.maxDBSize;
+    cSystemConfig.auto_checkpoint = config.autoCheckpoint;
+    cSystemConfig.checkpoint_threshold = config.checkpointThreshold;
+#if defined(__APPLE__)
+    cSystemConfig.thread_qos = config.threadQos;
+#endif
+    return cSystemConfig;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/flat_tuple.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/flat_tuple.cpp
new file mode 100644
index 0000000000..a4580a20a6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/flat_tuple.cpp
@@ -0,0 +1,38 @@
+#include "processor/result/flat_tuple.h"
+
+#include "c_api/helpers.h"
+#include "c_api/lbug.h"
+#include "common/exception/exception.h"
+
+using namespace lbug::common;
+using namespace lbug::processor;
+
+void lbug_flat_tuple_destroy(lbug_flat_tuple* flat_tuple) {
+    if (flat_tuple == nullptr) {
+        return;
+    }
+    if (flat_tuple->_flat_tuple != nullptr && !flat_tuple->_is_owned_by_cpp) {
+        delete static_cast<FlatTuple*>(flat_tuple->_flat_tuple);
+    }
+}
+
+lbug_state lbug_flat_tuple_get_value(lbug_flat_tuple* flat_tuple, uint64_t index,
+    lbug_value* out_value) {
+    auto flat_tuple_ptr = static_cast<FlatTuple*>(flat_tuple->_flat_tuple);
+    Value* _value = nullptr;
+    try {
+        _value = flat_tuple_ptr->getValue(index);
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    out_value->_value = _value;
+    // We set the ownership of the value to C++, so it will not be deleted if the value is destroyed
+    // in C.
+    out_value->_is_owned_by_cpp = true;
+    return LbugSuccess;
+}
+
+char* lbug_flat_tuple_to_string(lbug_flat_tuple* flat_tuple) {
+    auto flat_tuple_ptr = static_cast<FlatTuple*>(flat_tuple->_flat_tuple);
+    return convertToOwnedCString(flat_tuple_ptr->toString());
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/helpers.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/helpers.cpp
new file mode 100644
index 0000000000..4eb8955dd1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/helpers.cpp
@@ -0,0 +1,54 @@
+#include "c_api/helpers.h"
+
+#include <cstring>
+
+#ifdef _WIN32
+const uint64_t NS_TO_SEC = 10000000ULL;
+const uint64_t SEC_TO_UNIX_EPOCH = 11644473600ULL;
+
+time_t convertTmToTime(struct tm tm) {
+    SYSTEMTIME st;
+    st.wYear = tm.tm_year + 1900;
+    st.wMonth = tm.tm_mon + 1;
+    st.wDay = tm.tm_mday;
+    st.wHour = tm.tm_hour;
+    st.wMinute = tm.tm_min;
+    st.wSecond = tm.tm_sec;
+    st.wMilliseconds = 0;
+    FILETIME ft;
+    if (!SystemTimeToFileTime(&st, &ft)) {
+        return -1;
+    }
+    ULARGE_INTEGER ull;
+    ull.LowPart = ft.dwLowDateTime;
+    ull.HighPart = ft.dwHighDateTime;
+    return static_cast<time_t>((ull.QuadPart / NS_TO_SEC) - SEC_TO_UNIX_EPOCH);
+}
+
+int32_t convertTimeToTm(time_t time, struct tm* out_tm) {
+    ULARGE_INTEGER ull;
+    ull.QuadPart = (time + SEC_TO_UNIX_EPOCH) * NS_TO_SEC;
+    FILETIME ft;
+    ft.dwLowDateTime = ull.LowPart;
+    ft.dwHighDateTime = ull.HighPart;
+    SYSTEMTIME st;
+    if (!FileTimeToSystemTime(&ft, &st)) {
+        return -1;
+    }
+    out_tm->tm_year = st.wYear - 1900;
+    out_tm->tm_mon = st.wMonth - 1;
+    out_tm->tm_mday = st.wDay;
+    out_tm->tm_hour = st.wHour;
+    out_tm->tm_min = st.wMinute;
+    out_tm->tm_sec = st.wSecond;
+    return 0;
+}
+#endif
+
+char* convertToOwnedCString(const std::string& str) {
+    size_t src_len = str.size();
+    auto* c_str = (char*)malloc(sizeof(char) * (src_len + 1));
+    memcpy(c_str, str.c_str(), src_len);
+    c_str[src_len] = '\0';
+    return c_str;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/prepared_statement.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/prepared_statement.cpp
new file mode 100644
index 0000000000..4000f2a8a2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/prepared_statement.cpp
@@ -0,0 +1,283 @@
+#include "main/prepared_statement.h"
+
+#include "c_api/helpers.h"
+#include "c_api/lbug.h"
+#include "common/types/value/value.h"
+
+using namespace lbug::common;
+using namespace lbug::main;
+
+void lbug_prepared_statement_bind_cpp_value(lbug_prepared_statement* prepared_statement,
+    const char* param_name, std::unique_ptr<Value> value) {
+    auto* bound_values = static_cast<std::unordered_map<std::string, std::unique_ptr<Value>>*>(
+        prepared_statement->_bound_values);
+    bound_values->erase(param_name);
+    bound_values->insert({param_name, std::move(value)});
+}
+
+void lbug_prepared_statement_destroy(lbug_prepared_statement* prepared_statement) {
+    if (prepared_statement == nullptr) {
+        return;
+    }
+    if (prepared_statement->_prepared_statement != nullptr) {
+        delete static_cast<PreparedStatement*>(prepared_statement->_prepared_statement);
+    }
+    if (prepared_statement->_bound_values != nullptr) {
+        delete static_cast<std::unordered_map<std::string, std::unique_ptr<Value>>*>(
+            prepared_statement->_bound_values);
+    }
+}
+
+bool lbug_prepared_statement_is_success(lbug_prepared_statement* prepared_statement) {
+    return static_cast<PreparedStatement*>(prepared_statement->_prepared_statement)->isSuccess();
+}
+
+char* lbug_prepared_statement_get_error_message(lbug_prepared_statement* prepared_statement) {
+    auto error_message =
+        static_cast<PreparedStatement*>(prepared_statement->_prepared_statement)->getErrorMessage();
+    if (error_message.empty()) {
+        return nullptr;
+    }
+    return convertToOwnedCString(error_message);
+}
+
+lbug_state lbug_prepared_statement_bind_bool(lbug_prepared_statement* prepared_statement,
+    const char* param_name, bool value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_int64(lbug_prepared_statement* prepared_statement,
+    const char* param_name, int64_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_int32(lbug_prepared_statement* prepared_statement,
+    const char* param_name, int32_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_int16(lbug_prepared_statement* prepared_statement,
+    const char* param_name, int16_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_int8(lbug_prepared_statement* prepared_statement,
+    const char* param_name, int8_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_uint64(lbug_prepared_statement* prepared_statement,
+    const char* param_name, uint64_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_uint32(lbug_prepared_statement* prepared_statement,
+    const char* param_name, uint32_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_uint16(lbug_prepared_statement* prepared_statement,
+    const char* param_name, uint16_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_uint8(lbug_prepared_statement* prepared_statement,
+    const char* param_name, uint8_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_double(lbug_prepared_statement* prepared_statement,
+    const char* param_name, double value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_float(lbug_prepared_statement* prepared_statement,
+    const char* param_name, float value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(value);
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_date(lbug_prepared_statement* prepared_statement,
+    const char* param_name, lbug_date_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(date_t(value.days));
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_timestamp_ns(lbug_prepared_statement* prepared_statement,
+    const char* param_name, lbug_timestamp_ns_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(timestamp_ns_t(value.value));
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_timestamp_ms(lbug_prepared_statement* prepared_statement,
+    const char* param_name, lbug_timestamp_ms_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(timestamp_ms_t(value.value));
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_timestamp_sec(lbug_prepared_statement* prepared_statement,
+    const char* param_name, lbug_timestamp_sec_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(timestamp_sec_t(value.value));
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_timestamp_tz(lbug_prepared_statement* prepared_statement,
+    const char* param_name, lbug_timestamp_tz_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(timestamp_tz_t(value.value));
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_timestamp(lbug_prepared_statement* prepared_statement,
+    const char* param_name, lbug_timestamp_t value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(timestamp_t(value.value));
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_interval(lbug_prepared_statement* prepared_statement,
+    const char* param_name, lbug_interval_t value) {
+    try {
+        auto value_ptr =
+            std::make_unique<Value>(interval_t(value.months, value.days, value.micros));
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_string(lbug_prepared_statement* prepared_statement,
+    const char* param_name, const char* value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(std::string(value));
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_prepared_statement_bind_value(lbug_prepared_statement* prepared_statement,
+    const char* param_name, lbug_value* value) {
+    try {
+        auto value_ptr = std::make_unique<Value>(*static_cast<Value*>(value->_value));
+        lbug_prepared_statement_bind_cpp_value(prepared_statement, param_name,
+            std::move(value_ptr));
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/query_result.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/query_result.cpp
new file mode 100644
index 0000000000..bb3f77aae7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/query_result.cpp
@@ -0,0 +1,136 @@
+#include "main/query_result.h"
+
+#include "c_api/helpers.h"
+#include "c_api/lbug.h"
+
+using namespace lbug::main;
+using namespace lbug::common;
+using namespace lbug::processor;
+
+void lbug_query_result_destroy(lbug_query_result* query_result) {
+    if (query_result == nullptr) {
+        return;
+    }
+    if (query_result->_query_result != nullptr) {
+        if (!query_result->_is_owned_by_cpp) {
+            delete static_cast<QueryResult*>(query_result->_query_result);
+        }
+    }
+}
+
+bool lbug_query_result_is_success(lbug_query_result* query_result) {
+    return static_cast<QueryResult*>(query_result->_query_result)->isSuccess();
+}
+
+char* lbug_query_result_get_error_message(lbug_query_result* query_result) {
+    auto error_message = static_cast<QueryResult*>(query_result->_query_result)->getErrorMessage();
+    if (error_message.empty()) {
+        return nullptr;
+    }
+    return convertToOwnedCString(error_message);
+}
+
+uint64_t lbug_query_result_get_num_columns(lbug_query_result* query_result) {
+    return static_cast<QueryResult*>(query_result->_query_result)->getNumColumns();
+}
+
+lbug_state lbug_query_result_get_column_name(lbug_query_result* query_result, uint64_t index,
+    char** out_column_name) {
+    auto column_names = static_cast<QueryResult*>(query_result->_query_result)->getColumnNames();
+    if (index >= column_names.size()) {
+        return LbugError;
+    }
+    *out_column_name = convertToOwnedCString(column_names[index]);
+    return LbugSuccess;
+}
+
+lbug_state lbug_query_result_get_column_data_type(lbug_query_result* query_result, uint64_t index,
+    lbug_logical_type* out_column_data_type) {
+    auto column_data_types =
+        static_cast<QueryResult*>(query_result->_query_result)->getColumnDataTypes();
+    if (index >= column_data_types.size()) {
+        return LbugError;
+    }
+    const auto& column_data_type = column_data_types[index];
+    out_column_data_type->_data_type = new LogicalType(column_data_type.copy());
+    return LbugSuccess;
+}
+
+uint64_t lbug_query_result_get_num_tuples(lbug_query_result* query_result) {
+    return static_cast<QueryResult*>(query_result->_query_result)->getNumTuples();
+}
+
+lbug_state lbug_query_result_get_query_summary(lbug_query_result* query_result,
+    lbug_query_summary* out_query_summary) {
+    if (out_query_summary == nullptr) {
+        return LbugError;
+    }
+    auto query_summary = static_cast<QueryResult*>(query_result->_query_result)->getQuerySummary();
+    out_query_summary->_query_summary = query_summary;
+    return LbugSuccess;
+}
+
+bool lbug_query_result_has_next(lbug_query_result* query_result) {
+    return static_cast<QueryResult*>(query_result->_query_result)->hasNext();
+}
+
+bool lbug_query_result_has_next_query_result(lbug_query_result* query_result) {
+    return static_cast<QueryResult*>(query_result->_query_result)->hasNextQueryResult();
+}
+
+lbug_state lbug_query_result_get_next_query_result(lbug_query_result* query_result,
+    lbug_query_result* out_query_result) {
+    if (!lbug_query_result_has_next_query_result(query_result)) {
+        return LbugError;
+    }
+    auto next_query_result =
+        static_cast<QueryResult*>(query_result->_query_result)->getNextQueryResult();
+    if (next_query_result == nullptr) {
+        return LbugError;
+    }
+    out_query_result->_query_result = next_query_result;
+    out_query_result->_is_owned_by_cpp = true;
+    return LbugSuccess;
+}
+
+lbug_state lbug_query_result_get_next(lbug_query_result* query_result,
+    lbug_flat_tuple* out_flat_tuple) {
+    try {
+        auto flat_tuple = static_cast<QueryResult*>(query_result->_query_result)->getNext();
+        out_flat_tuple->_flat_tuple = flat_tuple.get();
+        out_flat_tuple->_is_owned_by_cpp = true;
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+char* lbug_query_result_to_string(lbug_query_result* query_result) {
+    std::string result_string = static_cast<QueryResult*>(query_result->_query_result)->toString();
+    return convertToOwnedCString(result_string);
+}
+
+void lbug_query_result_reset_iterator(lbug_query_result* query_result) {
+    static_cast<QueryResult*>(query_result->_query_result)->resetIterator();
+}
+
+lbug_state lbug_query_result_get_arrow_schema(lbug_query_result* query_result,
+    ArrowSchema* out_schema) {
+    try {
+        *out_schema = *static_cast<QueryResult*>(query_result->_query_result)->getArrowSchema();
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_query_result_get_next_arrow_chunk(lbug_query_result* query_result,
+    int64_t chunk_size, ArrowArray* out_arrow_array) {
+    try {
+        *out_arrow_array =
+            *static_cast<QueryResult*>(query_result->_query_result)->getNextArrowChunk(chunk_size);
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/query_summary.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/query_summary.cpp
new file mode 100644
index 0000000000..7f75090d84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/query_summary.cpp
@@ -0,0 +1,23 @@
+#include "main/query_summary.h"
+
+#include <cstdlib>
+
+#include "c_api/lbug.h"
+
+using namespace lbug::main;
+
+void lbug_query_summary_destroy(lbug_query_summary* query_summary) {
+    if (query_summary == nullptr) {
+        return;
+    }
+    // The query summary is owned by the query result, so it should not be deleted here.
+    query_summary->_query_summary = nullptr;
+}
+
+double lbug_query_summary_get_compiling_time(lbug_query_summary* query_summary) {
+    return static_cast<QuerySummary*>(query_summary->_query_summary)->getCompilingTime();
+}
+
+double lbug_query_summary_get_execution_time(lbug_query_summary* query_summary) {
+    return static_cast<QuerySummary*>(query_summary->_query_summary)->getExecutionTime();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/value.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/value.cpp
new file mode 100644
index 0000000000..24335fe7c2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/value.cpp
@@ -0,0 +1,1192 @@
+#include "common/types/value/value.h"
+
+#include "c_api/helpers.h"
+#include "c_api/lbug.h"
+#include "common/constants.h"
+#include "common/types/types.h"
+#include "common/types/value/nested.h"
+#include "common/types/value/node.h"
+#include "common/types/value/recursive_rel.h"
+#include "common/types/value/rel.h"
+#include "function/cast/functions/cast_from_string_functions.h"
+
+using namespace lbug::common;
+
+lbug_value* lbug_value_create_null() {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(Value::createNullValue());
+    return c_value;
+}
+
+lbug_value* lbug_value_create_null_with_data_type(lbug_logical_type* data_type) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value =
+        new Value(Value::createNullValue(*static_cast<LogicalType*>(data_type->_data_type)));
+    return c_value;
+}
+
+bool lbug_value_is_null(lbug_value* value) {
+    return static_cast<Value*>(value->_value)->isNull();
+}
+
+void lbug_value_set_null(lbug_value* value, bool is_null) {
+    static_cast<Value*>(value->_value)->setNull(is_null);
+}
+
+lbug_value* lbug_value_create_default(lbug_logical_type* data_type) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value =
+        new Value(Value::createDefaultValue(*static_cast<LogicalType*>(data_type->_data_type)));
+    return c_value;
+}
+
+lbug_value* lbug_value_create_bool(bool val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_int8(int8_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_int16(int16_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_int32(int32_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_int64(int64_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_uint8(uint8_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_uint16(uint16_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_uint32(uint32_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_uint64(uint64_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_int128(lbug_int128_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    int128_t int128(val_.low, val_.high);
+    c_value->_value = new Value(int128);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_float(float val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_double(double val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_internal_id(lbug_internal_id_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    internalID_t id(val_.offset, val_.table_id);
+    c_value->_value = new Value(id);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_date(lbug_date_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    auto date = date_t(val_.days);
+    c_value->_value = new Value(date);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_timestamp_ns(lbug_timestamp_ns_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    auto timestamp_ns = timestamp_ns_t(val_.value);
+    c_value->_value = new Value(timestamp_ns);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_timestamp_ms(lbug_timestamp_ms_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    auto timestamp_ms = timestamp_ms_t(val_.value);
+    c_value->_value = new Value(timestamp_ms);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_timestamp_sec(lbug_timestamp_sec_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    auto timestamp_sec = timestamp_sec_t(val_.value);
+    c_value->_value = new Value(timestamp_sec);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_timestamp_tz(lbug_timestamp_tz_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    auto timestamp_tz = timestamp_tz_t(val_.value);
+    c_value->_value = new Value(timestamp_tz);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_timestamp(lbug_timestamp_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    auto timestamp = timestamp_t(val_.value);
+    c_value->_value = new Value(timestamp);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_interval(lbug_interval_t val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    auto interval = interval_t(val_.months, val_.days, val_.micros);
+    c_value->_value = new Value(interval);
+    return c_value;
+}
+
+lbug_value* lbug_value_create_string(const char* val_) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(val_);
+    return c_value;
+}
+
+lbug_state lbug_value_create_list(uint64_t num_elements, lbug_value** elements,
+    lbug_value** out_value) {
+    if (num_elements == 0) {
+        return LbugError;
+    }
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    std::vector<std::unique_ptr<Value>> children;
+
+    auto first_element = static_cast<Value*>(elements[0]->_value);
+    auto type = first_element->getDataType().copy();
+
+    for (uint64_t i = 0; i < num_elements; ++i) {
+        auto child = static_cast<Value*>(elements[i]->_value);
+        if (child->getDataType() != type) {
+            free(c_value);
+            return LbugError;
+        }
+        // Copy the value to the list value to transfer ownership to the C++ side.
+        children.push_back(child->copy());
+    }
+    auto list_type = LogicalType::LIST(first_element->getDataType().copy());
+    c_value->_value = new Value(list_type.copy(), std::move(children));
+    c_value->_is_owned_by_cpp = false;
+    *out_value = c_value;
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_create_struct(uint64_t num_fields, const char** field_names,
+    lbug_value** field_values, lbug_value** out_value) {
+    if (num_fields == 0) {
+        return LbugError;
+    }
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    std::vector<std::unique_ptr<Value>> children;
+    auto struct_fields = std::vector<StructField>{};
+    for (uint64_t i = 0; i < num_fields; ++i) {
+        auto field_name = std::string(field_names[i]);
+        auto field_value = static_cast<Value*>(field_values[i]->_value);
+        auto field_type = field_value->getDataType().copy();
+        struct_fields.emplace_back(std::move(field_name), std::move(field_type));
+        children.push_back(field_value->copy());
+    }
+    auto struct_type = LogicalType::STRUCT(std::move(struct_fields));
+    c_value->_value = new Value(std::move(struct_type), std::move(children));
+    c_value->_is_owned_by_cpp = false;
+    *out_value = c_value;
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_create_map(uint64_t num_fields, lbug_value** keys, lbug_value** values,
+    lbug_value** out_value) {
+    if (num_fields == 0) {
+        return LbugError;
+    }
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    std::vector<std::unique_ptr<Value>> children;
+
+    auto first_key = static_cast<Value*>(keys[0]->_value);
+    auto first_value = static_cast<Value*>(values[0]->_value);
+    auto key_type = first_key->getDataType().copy();
+    auto value_type = first_value->getDataType().copy();
+
+    for (uint64_t i = 0; i < num_fields; ++i) {
+        auto key = static_cast<Value*>(keys[i]->_value);
+        auto value = static_cast<Value*>(values[i]->_value);
+        if (key->getDataType() != key_type || value->getDataType() != value_type) {
+            free(c_value);
+            return LbugError;
+        }
+        std::vector<StructField> struct_fields;
+        struct_fields.emplace_back(InternalKeyword::MAP_KEY, key_type.copy());
+        struct_fields.emplace_back(InternalKeyword::MAP_VALUE, value_type.copy());
+        std::vector<std::unique_ptr<Value>> struct_values;
+        struct_values.push_back(key->copy());
+        struct_values.push_back(value->copy());
+        auto struct_type = LogicalType::STRUCT(std::move(struct_fields));
+        auto struct_value = new Value(std::move(struct_type), std::move(struct_values));
+        children.push_back(std::unique_ptr<Value>(struct_value));
+    }
+    auto map_type = LogicalType::MAP(key_type.copy(), value_type.copy());
+    c_value->_value = new Value(map_type.copy(), std::move(children));
+    c_value->_is_owned_by_cpp = false;
+    *out_value = c_value;
+    return LbugSuccess;
+}
+
+lbug_value* lbug_value_clone(lbug_value* value) {
+    auto* c_value = (lbug_value*)calloc(1, sizeof(lbug_value));
+    c_value->_value = new Value(*static_cast<Value*>(value->_value));
+    return c_value;
+}
+
+void lbug_value_copy(lbug_value* value, lbug_value* other) {
+    static_cast<Value*>(value->_value)->copyValueFrom(*static_cast<Value*>(other->_value));
+}
+
+void lbug_value_destroy(lbug_value* value) {
+    if (value == nullptr) {
+        return;
+    }
+    if (!value->_is_owned_by_cpp) {
+        if (value->_value != nullptr) {
+            delete static_cast<Value*>(value->_value);
+        }
+        free(value);
+    }
+}
+
+lbug_state lbug_value_get_list_size(lbug_value* value, uint64_t* out_result) {
+    if (static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID() !=
+        LogicalTypeID::LIST) {
+        return LbugError;
+    }
+    *out_result = NestedVal::getChildrenSize(static_cast<Value*>(value->_value));
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_list_element(lbug_value* value, uint64_t index, lbug_value* out_value) {
+    auto physical_type_id = static_cast<Value*>(value->_value)->getDataType().getPhysicalType();
+    if (physical_type_id != PhysicalTypeID::ARRAY && physical_type_id != PhysicalTypeID::STRUCT &&
+        physical_type_id != PhysicalTypeID::LIST) {
+        return LbugError;
+    }
+    auto listValue = static_cast<Value*>(value->_value);
+    if (index >= NestedVal::getChildrenSize(listValue)) {
+        return LbugError;
+    }
+    try {
+        auto val = NestedVal::getChildVal(listValue, index);
+        out_value->_value = val;
+        out_value->_is_owned_by_cpp = true;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_struct_num_fields(lbug_value* value, uint64_t* out_result) {
+    auto physical_type_id = static_cast<Value*>(value->_value)->getDataType().getPhysicalType();
+    if (physical_type_id != PhysicalTypeID::STRUCT) {
+        return LbugError;
+    }
+    auto val = static_cast<Value*>(value->_value);
+    const auto& data_type = val->getDataType();
+    try {
+        *out_result = StructType::getNumFields(data_type);
+        return LbugSuccess;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+}
+
+lbug_state lbug_value_get_struct_field_name(lbug_value* value, uint64_t index, char** out_result) {
+    auto physical_type_id = static_cast<Value*>(value->_value)->getDataType().getPhysicalType();
+    if (physical_type_id != PhysicalTypeID::STRUCT) {
+        return LbugError;
+    }
+    auto val = static_cast<Value*>(value->_value);
+    const auto& data_type = val->getDataType();
+    if (index >= StructType::getNumFields(data_type)) {
+        return LbugError;
+    }
+    std::string struct_field_name = StructType::getFields(data_type)[index].getName();
+    if (struct_field_name.empty()) {
+        return LbugError;
+    }
+    *out_result = convertToOwnedCString(struct_field_name);
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_struct_field_value(lbug_value* value, uint64_t index,
+    lbug_value* out_value) {
+    return lbug_value_get_list_element(value, index, out_value);
+}
+
+lbug_state lbug_value_get_map_size(lbug_value* value, uint64_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::MAP) {
+        return LbugError;
+    }
+    auto listValue = static_cast<Value*>(value->_value);
+    *out_result = NestedVal::getChildrenSize(listValue);
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_map_key(lbug_value* value, uint64_t index, lbug_value* out_key) {
+    lbug_value map_entry;
+    if (lbug_value_get_list_element(value, index, &map_entry) == LbugError) {
+        return LbugError;
+    }
+    return lbug_value_get_struct_field_value(&map_entry, 0, out_key);
+}
+
+lbug_state lbug_value_get_map_value(lbug_value* value, uint64_t index, lbug_value* out_value) {
+    lbug_value map_entry;
+    if (lbug_value_get_list_element(value, index, &map_entry) == LbugError) {
+        return LbugError;
+    }
+    return lbug_value_get_struct_field_value(&map_entry, 1, out_value);
+}
+
+lbug_state lbug_value_get_recursive_rel_node_list(lbug_value* value, lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::RECURSIVE_REL) {
+        return LbugError;
+    }
+    out_value->_is_owned_by_cpp = true;
+    try {
+        out_value->_value = RecursiveRelVal::getNodes(static_cast<Value*>(value->_value));
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_recursive_rel_rel_list(lbug_value* value, lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::RECURSIVE_REL) {
+        return LbugError;
+    }
+    out_value->_is_owned_by_cpp = true;
+    try {
+        out_value->_value = RecursiveRelVal::getRels(static_cast<Value*>(value->_value));
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+void lbug_value_get_data_type(lbug_value* value, lbug_logical_type* out_data_type) {
+    out_data_type->_data_type =
+        new LogicalType(static_cast<Value*>(value->_value)->getDataType().copy());
+}
+
+lbug_state lbug_value_get_bool(lbug_value* value, bool* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::BOOL) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<bool>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_int8(lbug_value* value, int8_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::INT8) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<int8_t>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_int16(lbug_value* value, int16_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::INT16) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<int16_t>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_int32(lbug_value* value, int32_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::INT32) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<int32_t>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_int64(lbug_value* value, int64_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::INT64) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<int64_t>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_uint8(lbug_value* value, uint8_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::UINT8) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<uint8_t>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_uint16(lbug_value* value, uint16_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::UINT16) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<uint16_t>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_uint32(lbug_value* value, uint32_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::UINT32) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<uint32_t>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_uint64(lbug_value* value, uint64_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::UINT64) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<uint64_t>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_int128(lbug_value* value, lbug_int128_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::INT128) {
+        return LbugError;
+    }
+    try {
+        auto int128_val = static_cast<Value*>(value->_value)->getValue<int128_t>();
+        out_result->low = int128_val.low;
+        out_result->high = int128_val.high;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_int128_t_from_string(const char* str, lbug_int128_t* out_result) {
+    int128_t int128_val = 0;
+    try {
+        lbug::function::CastString::operation(ku_string_t{str, strlen(str)}, int128_val);
+        out_result->low = int128_val.low;
+        out_result->high = int128_val.high;
+    } catch (ConversionException& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_int128_t_to_string(lbug_int128_t int128_val, char** out_result) {
+    int128_t c_int128 = 0;
+    c_int128.low = int128_val.low;
+    c_int128.high = int128_val.high;
+    try {
+        *out_result = convertToOwnedCString(TypeUtils::toString(c_int128));
+    } catch (ConversionException& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+// TODO: bind all int128_t supported functions
+
+lbug_state lbug_value_get_float(lbug_value* value, float* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::FLOAT) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<float>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_double(lbug_value* value, double* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::DOUBLE) {
+        return LbugError;
+    }
+    try {
+        *out_result = static_cast<Value*>(value->_value)->getValue<double>();
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_internal_id(lbug_value* value, lbug_internal_id_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::INTERNAL_ID) {
+        return LbugError;
+    }
+    try {
+        auto id = static_cast<Value*>(value->_value)->getValue<internalID_t>();
+        out_result->offset = id.offset;
+        out_result->table_id = id.tableID;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_date(lbug_value* value, lbug_date_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::DATE) {
+        return LbugError;
+    }
+    try {
+        auto date_val = static_cast<Value*>(value->_value)->getValue<date_t>();
+        out_result->days = date_val.days;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_timestamp(lbug_value* value, lbug_timestamp_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::TIMESTAMP) {
+        return LbugError;
+    }
+    try {
+        auto timestamp_val = static_cast<Value*>(value->_value)->getValue<timestamp_t>();
+        out_result->value = timestamp_val.value;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_timestamp_ns(lbug_value* value, lbug_timestamp_ns_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::TIMESTAMP_NS) {
+        return LbugError;
+    }
+    try {
+        auto timestamp_val = static_cast<Value*>(value->_value)->getValue<timestamp_ns_t>();
+        out_result->value = timestamp_val.value;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_timestamp_ms(lbug_value* value, lbug_timestamp_ms_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::TIMESTAMP_MS) {
+        return LbugError;
+    }
+    try {
+        auto timestamp_val = static_cast<Value*>(value->_value)->getValue<timestamp_ms_t>();
+        out_result->value = timestamp_val.value;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_timestamp_sec(lbug_value* value, lbug_timestamp_sec_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::TIMESTAMP_SEC) {
+        return LbugError;
+    }
+    try {
+        auto timestamp_val = static_cast<Value*>(value->_value)->getValue<timestamp_sec_t>();
+        out_result->value = timestamp_val.value;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_timestamp_tz(lbug_value* value, lbug_timestamp_tz_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::TIMESTAMP_TZ) {
+        return LbugError;
+    }
+    try {
+        auto timestamp_val = static_cast<Value*>(value->_value)->getValue<timestamp_tz_t>();
+        out_result->value = timestamp_val.value;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_decimal_as_string(lbug_value* value, char** out_result) {
+    auto decimal_val = static_cast<Value*>(value->_value);
+    auto logical_type_id = decimal_val->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::DECIMAL) {
+        return LbugError;
+    }
+
+    *out_result = convertToOwnedCString(decimal_val->toString());
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_interval(lbug_value* value, lbug_interval_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::INTERVAL) {
+        return LbugError;
+    }
+    try {
+        auto interval_val = static_cast<Value*>(value->_value)->getValue<interval_t>();
+        out_result->months = interval_val.months;
+        out_result->days = interval_val.days;
+        out_result->micros = interval_val.micros;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_string(lbug_value* value, char** out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::STRING) {
+        return LbugError;
+    }
+    try {
+        *out_result =
+            convertToOwnedCString(static_cast<Value*>(value->_value)->getValue<std::string>());
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_blob(lbug_value* value, uint8_t** out_result, uint64_t* out_length) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::BLOB) {
+        return LbugError;
+    }
+    try {
+        auto blob = static_cast<Value*>(value->_value)->getValue<std::string>();
+        *out_length = blob.size();
+        auto* buffer = (uint8_t*)malloc(sizeof(uint8_t) * blob.size());
+        memcpy(buffer, blob.data(), blob.size());
+        *out_result = buffer;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_value_get_uuid(lbug_value* value, char** out_result) {
+    auto logical_type_id = static_cast<Value*>(value->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::UUID) {
+        return LbugError;
+    }
+    try {
+        *out_result =
+            convertToOwnedCString(static_cast<Value*>(value->_value)->getValue<std::string>());
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+char* lbug_value_to_string(lbug_value* value) {
+    return convertToOwnedCString(static_cast<Value*>(value->_value)->toString());
+}
+
+lbug_state lbug_node_val_get_id_val(lbug_value* node_val, lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(node_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::NODE) {
+        return LbugError;
+    }
+    try {
+        auto id_val = NodeVal::getNodeIDVal(static_cast<Value*>(node_val->_value));
+        out_value->_value = id_val;
+        out_value->_is_owned_by_cpp = true;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_node_val_get_label_val(lbug_value* node_val, lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(node_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::NODE) {
+        return LbugError;
+    }
+    try {
+        auto label_val = NodeVal::getLabelVal(static_cast<Value*>(node_val->_value));
+        out_value->_value = label_val;
+        out_value->_is_owned_by_cpp = true;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_node_val_get_property_size(lbug_value* node_val, uint64_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(node_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::NODE) {
+        return LbugError;
+    }
+    try {
+        *out_result = NodeVal::getNumProperties(static_cast<Value*>(node_val->_value));
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_node_val_get_property_name_at(lbug_value* node_val, uint64_t index,
+    char** out_result) {
+    auto logical_type_id = static_cast<Value*>(node_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::NODE) {
+        return LbugError;
+    }
+    try {
+        std::string property_name =
+            NodeVal::getPropertyName(static_cast<Value*>(node_val->_value), index);
+        if (property_name.empty()) {
+            return LbugError;
+        }
+        *out_result = convertToOwnedCString(property_name);
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_node_val_get_property_value_at(lbug_value* node_val, uint64_t index,
+    lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(node_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::NODE) {
+        return LbugError;
+    }
+    try {
+        auto value = NodeVal::getPropertyVal(static_cast<Value*>(node_val->_value), index);
+        out_value->_value = value;
+        out_value->_is_owned_by_cpp = true;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_node_val_to_string(lbug_value* node_val, char** out_result) {
+    auto logical_type_id = static_cast<Value*>(node_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::NODE) {
+        return LbugError;
+    }
+    try {
+        *out_result =
+            convertToOwnedCString(NodeVal::toString(static_cast<Value*>(node_val->_value)));
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_rel_val_get_id_val(lbug_value* rel_val, lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(rel_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::REL) {
+        return LbugError;
+    }
+    try {
+        auto id_val = RelVal::getIDVal(static_cast<Value*>(rel_val->_value));
+        out_value->_value = id_val;
+        out_value->_is_owned_by_cpp = true;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_rel_val_get_src_id_val(lbug_value* rel_val, lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(rel_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::REL) {
+        return LbugError;
+    }
+    try {
+        auto src_id_val = RelVal::getSrcNodeIDVal(static_cast<Value*>(rel_val->_value));
+        out_value->_value = src_id_val;
+        out_value->_is_owned_by_cpp = true;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_rel_val_get_dst_id_val(lbug_value* rel_val, lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(rel_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::REL) {
+        return LbugError;
+    }
+    try {
+        auto dst_id_val = RelVal::getDstNodeIDVal(static_cast<Value*>(rel_val->_value));
+        out_value->_value = dst_id_val;
+        out_value->_is_owned_by_cpp = true;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_rel_val_get_label_val(lbug_value* rel_val, lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(rel_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::REL) {
+        return LbugError;
+    }
+    try {
+        auto label_val = RelVal::getLabelVal(static_cast<Value*>(rel_val->_value));
+        out_value->_value = label_val;
+        out_value->_is_owned_by_cpp = true;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_rel_val_get_property_size(lbug_value* rel_val, uint64_t* out_result) {
+    auto logical_type_id = static_cast<Value*>(rel_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::REL) {
+        return LbugError;
+    }
+    try {
+        *out_result = RelVal::getNumProperties(static_cast<Value*>(rel_val->_value));
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+lbug_state lbug_rel_val_get_property_name_at(lbug_value* rel_val, uint64_t index,
+    char** out_result) {
+    auto logical_type_id = static_cast<Value*>(rel_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::REL) {
+        return LbugError;
+    }
+    try {
+        std::string property_name =
+            RelVal::getPropertyName(static_cast<Value*>(rel_val->_value), index);
+        if (property_name.empty()) {
+            return LbugError;
+        }
+        *out_result = convertToOwnedCString(property_name);
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_rel_val_get_property_value_at(lbug_value* rel_val, uint64_t index,
+    lbug_value* out_value) {
+    auto logical_type_id = static_cast<Value*>(rel_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::REL) {
+        return LbugError;
+    }
+    try {
+        auto value = RelVal::getPropertyVal(static_cast<Value*>(rel_val->_value), index);
+        out_value->_value = value;
+        out_value->_is_owned_by_cpp = true;
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+lbug_state lbug_rel_val_to_string(lbug_value* rel_val, char** out_result) {
+    auto logical_type_id = static_cast<Value*>(rel_val->_value)->getDataType().getLogicalTypeID();
+    if (logical_type_id != LogicalTypeID::REL) {
+        return LbugError;
+    }
+    try {
+        *out_result = convertToOwnedCString(RelVal::toString(static_cast<Value*>(rel_val->_value)));
+    } catch (Exception& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+void lbug_destroy_string(char* str) {
+    free(str);
+}
+
+void lbug_destroy_blob(uint8_t* blob) {
+    free(blob);
+}
+
+lbug_state lbug_timestamp_ns_to_tm(lbug_timestamp_ns_t timestamp, struct tm* out_result) {
+    time_t time = timestamp.value / 1000000000;
+#ifdef _WIN32
+    if (convertTimeToTm(time, out_result) != 0) {
+        return LbugError;
+    }
+#else
+    if (gmtime_r(&time, out_result) == nullptr) {
+        return LbugError;
+    }
+#endif
+    return LbugSuccess;
+}
+
+lbug_state lbug_timestamp_ms_to_tm(lbug_timestamp_ms_t timestamp, struct tm* out_result) {
+    time_t time = timestamp.value / 1000;
+#ifdef _WIN32
+    if (convertTimeToTm(time, out_result) != 0) {
+        return LbugError;
+    }
+#else
+    if (gmtime_r(&time, out_result) == nullptr) {
+        return LbugError;
+    }
+#endif
+    return LbugSuccess;
+}
+
+lbug_state lbug_timestamp_sec_to_tm(lbug_timestamp_sec_t timestamp, struct tm* out_result) {
+    time_t time = timestamp.value;
+#ifdef _WIN32
+    if (convertTimeToTm(time, out_result) != 0) {
+        return LbugError;
+    }
+#else
+    if (gmtime_r(&time, out_result) == nullptr) {
+        return LbugError;
+    }
+#endif
+    return LbugSuccess;
+}
+
+lbug_state lbug_timestamp_tz_to_tm(lbug_timestamp_tz_t timestamp, struct tm* out_result) {
+    time_t time = timestamp.value / 1000000;
+#ifdef _WIN32
+    if (convertTimeToTm(time, out_result) != 0) {
+        return LbugError;
+    }
+#else
+    if (gmtime_r(&time, out_result) == nullptr) {
+        return LbugError;
+    }
+#endif
+    return LbugSuccess;
+}
+
+lbug_state lbug_timestamp_to_tm(lbug_timestamp_t timestamp, struct tm* out_result) {
+    time_t time = timestamp.value / 1000000;
+#ifdef _WIN32
+    if (convertTimeToTm(time, out_result) != 0) {
+        return LbugError;
+    }
+#else
+    if (gmtime_r(&time, out_result) == nullptr) {
+        return LbugError;
+    }
+#endif
+    return LbugSuccess;
+}
+
+lbug_state lbug_timestamp_ns_from_tm(struct tm tm, lbug_timestamp_ns_t* out_result) {
+#ifdef _WIN32
+    int64_t time = convertTmToTime(tm);
+#else
+    int64_t time = timegm(&tm);
+#endif
+    if (time == -1) {
+        return LbugError;
+    }
+    out_result->value = time * 1000000000;
+    return LbugSuccess;
+}
+
+lbug_state lbug_timestamp_ms_from_tm(struct tm tm, lbug_timestamp_ms_t* out_result) {
+#ifdef _WIN32
+    int64_t time = convertTmToTime(tm);
+#else
+    int64_t time = timegm(&tm);
+#endif
+    if (time == -1) {
+        return LbugError;
+    }
+    out_result->value = time * 1000;
+    return LbugSuccess;
+}
+
+lbug_state lbug_timestamp_sec_from_tm(struct tm tm, lbug_timestamp_sec_t* out_result) {
+#ifdef _WIN32
+    int64_t time = convertTmToTime(tm);
+#else
+    int64_t time = timegm(&tm);
+#endif
+    if (time == -1) {
+        return LbugError;
+    }
+    out_result->value = time;
+    return LbugSuccess;
+}
+
+lbug_state lbug_timestamp_tz_from_tm(struct tm tm, lbug_timestamp_tz_t* out_result) {
+#ifdef _WIN32
+    int64_t time = convertTmToTime(tm);
+#else
+    int64_t time = timegm(&tm);
+#endif
+    if (time == -1) {
+        return LbugError;
+    }
+    out_result->value = time * 1000000;
+    return LbugSuccess;
+}
+
+lbug_state lbug_timestamp_from_tm(struct tm tm, lbug_timestamp_t* out_result) {
+#ifdef _WIN32
+    int64_t time = convertTmToTime(tm);
+#else
+    int64_t time = timegm(&tm);
+#endif
+    if (time == -1) {
+        return LbugError;
+    }
+    out_result->value = time * 1000000;
+    return LbugSuccess;
+}
+
+lbug_state lbug_date_to_tm(lbug_date_t date, struct tm* out_result) {
+    time_t time = date.days * 86400;
+#ifdef _WIN32
+    if (convertTimeToTm(time, out_result) != 0) {
+        return LbugError;
+    }
+#else
+    if (gmtime_r(&time, out_result) == nullptr) {
+        return LbugError;
+    }
+#endif
+    out_result->tm_hour = 0;
+    out_result->tm_min = 0;
+    out_result->tm_sec = 0;
+    return LbugSuccess;
+}
+
+lbug_state lbug_date_from_tm(struct tm tm, lbug_date_t* out_result) {
+#ifdef _WIN32
+    int64_t time = convertTmToTime(tm);
+#else
+    int64_t time = timegm(&tm);
+#endif
+    if (time == -1) {
+        return LbugError;
+    }
+    out_result->days = time / 86400;
+    return LbugSuccess;
+}
+
+lbug_state lbug_date_to_string(lbug_date_t date, char** out_result) {
+    tm tm{};
+    if (lbug_date_to_tm(date, &tm) != LbugSuccess) {
+        return LbugError;
+    }
+    char buffer[80];
+    if (strftime(buffer, 80, "%Y-%m-%d", &tm) == 0) {
+        return LbugError;
+    }
+    *out_result = convertToOwnedCString(buffer);
+    return LbugSuccess;
+}
+
+lbug_state lbug_date_from_string(const char* str, lbug_date_t* out_result) {
+    try {
+        date_t date = Date::fromCString(str, strlen(str));
+        out_result->days = date.days;
+    } catch (ConversionException& e) {
+        return LbugError;
+    }
+    return LbugSuccess;
+}
+
+void lbug_interval_to_difftime(lbug_interval_t interval, double* out_result) {
+    auto micros = interval.micros + interval.months * Interval::MICROS_PER_MONTH +
+                  interval.days * Interval::MICROS_PER_DAY;
+    double seconds = micros / 1000000.0;
+    *out_result = seconds;
+}
+
+void lbug_interval_from_difftime(double difftime, lbug_interval_t* out_result) {
+    int64_t total_micros = static_cast<int64_t>(difftime * 1000000);
+    out_result->months = total_micros / Interval::MICROS_PER_MONTH;
+    total_micros -= out_result->months * Interval::MICROS_PER_MONTH;
+    out_result->days = total_micros / Interval::MICROS_PER_DAY;
+    total_micros -= out_result->days * Interval::MICROS_PER_DAY;
+    out_result->micros = total_micros;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/version.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/version.cpp
new file mode 100644
index 0000000000..dd1d2651e6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/c_api/version.cpp
@@ -0,0 +1,12 @@
+#include "main/version.h"
+
+#include "c_api/helpers.h"
+#include "c_api/lbug.h"
+
+char* lbug_get_version() {
+    return convertToOwnedCString(lbug::main::Version::getVersion());
+}
+
+uint64_t lbug_get_storage_version() {
+    return lbug::main::Version::getStorageVersion();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/CMakeLists.txt
new file mode 100644
index 0000000000..ace8f72ba8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/CMakeLists.txt
@@ -0,0 +1,11 @@
+add_subdirectory(catalog_entry)
+
+add_library(lbug_catalog
+        OBJECT
+        catalog.cpp
+        catalog_set.cpp
+        property_definition_collection.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_catalog>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog.cpp
new file mode 100644
index 0000000000..edc82180f8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog.cpp
@@ -0,0 +1,607 @@
+#include "catalog/catalog.h"
+
+#include "binder/ddl/bound_create_sequence_info.h"
+#include "binder/ddl/bound_create_table_info.h"
+#include "catalog/catalog_entry/function_catalog_entry.h"
+#include "catalog/catalog_entry/index_catalog_entry.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "catalog/catalog_entry/scalar_macro_catalog_entry.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "catalog/catalog_entry/type_catalog_entry.h"
+#include "common/exception/catalog.h"
+#include "common/exception/runtime.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/string_format.h"
+#include "extension/extension_manager.h"
+#include "function/function_collection.h"
+#include "main/client_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace catalog {
+
+Catalog::Catalog() : version{0} {
+    initCatalogSets();
+    registerBuiltInFunctions();
+}
+
+Catalog* Catalog::Get(const main::ClientContext& context) {
+    if (context.getAttachedDatabase()) {
+        return context.getAttachedDatabase()->getCatalog();
+    } else {
+        return context.getDatabase()->getCatalog();
+    }
+}
+
+void Catalog::initCatalogSets() {
+    tables = std::make_unique<CatalogSet>();
+    sequences = std::make_unique<CatalogSet>();
+    functions = std::make_unique<CatalogSet>();
+    types = std::make_unique<CatalogSet>();
+    indexes = std::make_unique<CatalogSet>();
+    macros = std::make_unique<CatalogSet>();
+    internalTables = std::make_unique<CatalogSet>(true /* isInternal */);
+    internalSequences = std::make_unique<CatalogSet>(true /* isInternal */);
+    internalFunctions = std::make_unique<CatalogSet>(true /* isInternal */);
+}
+
+bool Catalog::containsTable(const Transaction* transaction, const std::string& tableName,
+    bool useInternal) const {
+    if (tables->containsEntry(transaction, tableName)) {
+        return true;
+    }
+    if (useInternal) {
+        return internalTables->containsEntry(transaction, tableName);
+    }
+    return false;
+}
+
+bool Catalog::containsTable(const Transaction* transaction, table_id_t tableID,
+    bool useInternal) const {
+    if (tables->getEntryOfOID(transaction, tableID) != nullptr) {
+        return true;
+    }
+    if (useInternal) {
+        return internalTables->getEntryOfOID(transaction, tableID) != nullptr;
+    }
+    return false;
+}
+
+TableCatalogEntry* Catalog::getTableCatalogEntry(const Transaction* transaction,
+    table_id_t tableID) const {
+    auto result = tables->getEntryOfOID(transaction, tableID);
+    if (result == nullptr) {
+        result = internalTables->getEntryOfOID(transaction, tableID);
+    }
+    // LCOV_EXCL_START
+    if (result == nullptr) {
+        throw RuntimeException(
+            stringFormat("Cannot find table catalog entry with id {}.", std::to_string(tableID)));
+    }
+    // LCOV_EXCL_STOP
+    return result->ptrCast<TableCatalogEntry>();
+}
+
+TableCatalogEntry* Catalog::getTableCatalogEntry(const Transaction* transaction,
+    const std::string& tableName, bool useInternal) const {
+    CatalogEntry* result = nullptr;
+    if (!tables->containsEntry(transaction, tableName)) {
+        if (!useInternal) {
+            throw CatalogException(stringFormat("{} does not exist in catalog.", tableName));
+        } else {
+            result = internalTables->getEntry(transaction, tableName);
+        }
+    } else {
+        result = tables->getEntry(transaction, tableName);
+    }
+    // LCOV_EXCL_STOP
+    return result->ptrCast<TableCatalogEntry>();
+}
+
+template<TableCatalogEntryType T>
+std::vector<T*> Catalog::getTableEntries(const Transaction* transaction, bool useInternal,
+    CatalogEntryType entryType) const {
+    std::vector<T*> result;
+    for (auto& [_, entry] : tables->getEntries(transaction)) {
+        if (entry->getType() != entryType) {
+            continue;
+        }
+        result.push_back(entry->template ptrCast<T>());
+    }
+    if (useInternal) {
+        for (auto& [_, entry] : internalTables->getEntries(transaction)) {
+            if (entry->getType() != entryType) {
+                continue;
+            }
+            result.push_back(entry->template ptrCast<T>());
+        }
+    }
+    return result;
+}
+
+std::vector<NodeTableCatalogEntry*> Catalog::getNodeTableEntries(const Transaction* transaction,
+    bool useInternal) const {
+    return getTableEntries<NodeTableCatalogEntry>(transaction, useInternal,
+        CatalogEntryType::NODE_TABLE_ENTRY);
+}
+
+std::vector<RelGroupCatalogEntry*> Catalog::getRelGroupEntries(const Transaction* transaction,
+    bool useInternal) const {
+    return getTableEntries<RelGroupCatalogEntry>(transaction, useInternal,
+        CatalogEntryType::REL_GROUP_ENTRY);
+}
+
+std::vector<TableCatalogEntry*> Catalog::getTableEntries(const Transaction* transaction,
+    bool useInternal) const {
+    std::vector<TableCatalogEntry*> result;
+    for (auto& [_, entry] : tables->getEntries(transaction)) {
+        result.push_back(entry->ptrCast<TableCatalogEntry>());
+    }
+    if (useInternal) {
+        for (auto& [_, entry] : internalTables->getEntries(transaction)) {
+            result.push_back(entry->ptrCast<TableCatalogEntry>());
+        }
+    }
+    return result;
+}
+
+void Catalog::dropTableEntryAndIndex(Transaction* transaction, const std::string& name) {
+    auto tableID = getTableCatalogEntry(transaction, name)->getTableID();
+    dropAllIndexes(transaction, tableID);
+    dropTableEntry(transaction, tableID);
+}
+
+void Catalog::dropTableEntry(Transaction* transaction, table_id_t tableID) {
+    dropTableEntry(transaction, getTableCatalogEntry(transaction, tableID));
+}
+
+void Catalog::dropTableEntry(Transaction* transaction, const TableCatalogEntry* entry) {
+    dropSerialSequence(transaction, entry);
+    if (tables->containsEntry(transaction, entry->getName())) {
+        tables->dropEntry(transaction, entry->getName(), entry->getOID());
+    } else {
+        internalTables->dropEntry(transaction, entry->getName(), entry->getOID());
+    }
+}
+void Catalog::dropMacroEntry(Transaction* transaction, const lbug::common::oid_t macroID) {
+    dropMacroEntry(transaction, getScalarMacroCatalogEntry(transaction, macroID));
+}
+
+void Catalog::dropMacroEntry(Transaction* transaction, const ScalarMacroCatalogEntry* entry) {
+    macros->dropEntry(transaction, entry->getName(), entry->getOID());
+}
+
+void Catalog::alterTableEntry(Transaction* transaction, const BoundAlterInfo& info) {
+    tables->alterTableEntry(transaction, info);
+}
+
+CatalogEntry* Catalog::createRelGroupEntry(Transaction* transaction,
+    const BoundCreateTableInfo& info) {
+    const auto extraInfo = info.extraInfo->ptrCast<BoundExtraCreateRelTableGroupInfo>();
+    std::vector<RelTableCatalogInfo> relTableInfos;
+    KU_ASSERT(extraInfo->nodePairs.size() > 0);
+    for (auto& nodePair : extraInfo->nodePairs) {
+        relTableInfos.emplace_back(nodePair, tables->getNextOID());
+    }
+    auto relGroupEntry =
+        std::make_unique<RelGroupCatalogEntry>(info.tableName, extraInfo->srcMultiplicity,
+            extraInfo->dstMultiplicity, extraInfo->storageDirection, std::move(relTableInfos));
+    for (auto& definition : extraInfo->propertyDefinitions) {
+        relGroupEntry->addProperty(definition);
+    }
+    KU_ASSERT(info.hasParent == false);
+    relGroupEntry->setHasParent(info.hasParent);
+    createSerialSequence(transaction, relGroupEntry.get(), info.isInternal);
+    auto catalogSet = info.isInternal ? internalTables.get() : tables.get();
+    catalogSet->createEntry(transaction, std::move(relGroupEntry));
+    return catalogSet->getEntry(transaction, info.tableName);
+}
+
+bool Catalog::containsSequence(const Transaction* transaction, const std::string& name) const {
+    return sequences->containsEntry(transaction, name);
+}
+
+SequenceCatalogEntry* Catalog::getSequenceEntry(const Transaction* transaction,
+    const std::string& sequenceName, bool useInternalSeq) const {
+    CatalogEntry* entry = nullptr;
+    if (!sequences->containsEntry(transaction, sequenceName) && useInternalSeq) {
+        entry = internalSequences->getEntry(transaction, sequenceName);
+    } else {
+        entry = sequences->getEntry(transaction, sequenceName);
+    }
+    KU_ASSERT(entry);
+    return entry->ptrCast<SequenceCatalogEntry>();
+}
+
+SequenceCatalogEntry* Catalog::getSequenceEntry(const Transaction* transaction,
+    sequence_id_t sequenceID) const {
+    auto entry = internalSequences->getEntryOfOID(transaction, sequenceID);
+    if (entry == nullptr) {
+        entry = sequences->getEntryOfOID(transaction, sequenceID);
+    }
+    KU_ASSERT(entry);
+    return entry->ptrCast<SequenceCatalogEntry>();
+}
+
+std::vector<SequenceCatalogEntry*> Catalog::getSequenceEntries(
+    const Transaction* transaction) const {
+    std::vector<SequenceCatalogEntry*> result;
+    for (auto& [_, entry] : sequences->getEntries(transaction)) {
+        result.push_back(entry->ptrCast<SequenceCatalogEntry>());
+    }
+    return result;
+}
+
+sequence_id_t Catalog::createSequence(Transaction* transaction,
+    const BoundCreateSequenceInfo& info) {
+    auto entry = std::make_unique<SequenceCatalogEntry>(info);
+    entry->setHasParent(info.hasParent);
+    if (info.isInternal) {
+        return internalSequences->createEntry(transaction, std::move(entry));
+    } else {
+        return sequences->createEntry(transaction, std::move(entry));
+    }
+}
+
+void Catalog::dropSequence(Transaction* transaction, const std::string& name) {
+    const auto entry = getSequenceEntry(transaction, name);
+    dropSequence(transaction, entry->getOID());
+}
+
+void Catalog::dropSequence(Transaction* transaction, sequence_id_t sequenceID) {
+    const auto sequenceEntry = getSequenceEntry(transaction, sequenceID);
+    CatalogSet* set = nullptr;
+    set = sequences->containsEntry(transaction, sequenceEntry->getName()) ? sequences.get() :
+                                                                            internalSequences.get();
+    set->dropEntry(transaction, sequenceEntry->getName(), sequenceEntry->getOID());
+}
+
+void Catalog::createType(Transaction* transaction, std::string name, LogicalType type) {
+    if (types->containsEntry(transaction, name)) {
+        return;
+    }
+    auto entry = std::make_unique<TypeCatalogEntry>(std::move(name), std::move(type));
+    types->createEntry(transaction, std::move(entry));
+}
+
+static std::string getInstallExtensionMessage(std::string_view extensionName,
+    std::string_view entryType) {
+    return stringFormat("This {} exists in the {} "
+                        "extension. You can install and load the "
+                        "extension by running 'INSTALL {}; LOAD EXTENSION {};'.",
+        entryType, extensionName, extensionName, extensionName);
+}
+
+static std::string getTypeDoesNotExistMessage(std::string_view entryName) {
+    std::string message =
+        stringFormat("{} is neither an internal type nor a user defined type.", entryName);
+    const auto matchingExtensionFunction =
+        extension::ExtensionManager::lookupExtensionsByTypeName(entryName);
+    if (matchingExtensionFunction.has_value()) {
+        message = stringFormat("{} {}", message,
+            getInstallExtensionMessage(matchingExtensionFunction->extensionName, "type"));
+    }
+    return message;
+}
+
+LogicalType Catalog::getType(const Transaction* transaction, const std::string& name) const {
+    if (!types->containsEntry(transaction, name)) {
+        throw CatalogException{getTypeDoesNotExistMessage(name)};
+    }
+    return types->getEntry(transaction, name)
+        ->constCast<TypeCatalogEntry>()
+        .getLogicalType()
+        .copy();
+}
+
+bool Catalog::containsType(const Transaction* transaction, const std::string& typeName) const {
+    return types->containsEntry(transaction, typeName);
+}
+
+void Catalog::createIndex(Transaction* transaction,
+    std::unique_ptr<CatalogEntry> indexCatalogEntry) {
+    KU_ASSERT(indexCatalogEntry->getType() == CatalogEntryType::INDEX_ENTRY);
+    indexes->createEntry(transaction, std::move(indexCatalogEntry));
+}
+
+IndexCatalogEntry* Catalog::getIndex(const Transaction* transaction, table_id_t tableID,
+    const std::string& indexName) const {
+    auto internalName = IndexCatalogEntry::getInternalIndexName(tableID, indexName);
+    return indexes->getEntry(transaction, internalName)->ptrCast<IndexCatalogEntry>();
+}
+
+std::vector<IndexCatalogEntry*> Catalog::getIndexEntries(const Transaction* transaction) const {
+    std::vector<IndexCatalogEntry*> result;
+    for (auto& [_, entry] : indexes->getEntries(transaction)) {
+        result.push_back(entry->ptrCast<IndexCatalogEntry>());
+    }
+    return result;
+}
+
+std::vector<IndexCatalogEntry*> Catalog::getIndexEntries(const Transaction* transaction,
+    table_id_t tableID) const {
+    std::vector<IndexCatalogEntry*> result;
+    for (auto& [_, entry] : indexes->getEntries(transaction)) {
+        auto indexEntry = entry->ptrCast<IndexCatalogEntry>();
+        if (indexEntry->getTableID() == tableID) {
+            result.push_back(indexEntry);
+        }
+    }
+    return result;
+}
+
+bool Catalog::containsIndex(const Transaction* transaction, table_id_t tableID,
+    const std::string& indexName) const {
+    return indexes->containsEntry(transaction,
+        IndexCatalogEntry::getInternalIndexName(tableID, indexName));
+}
+
+bool Catalog::containsIndex(const Transaction* transaction, table_id_t tableID,
+    property_id_t propertyID) const {
+    for (auto& [_, entry] : indexes->getEntries(transaction)) {
+        auto indexEntry = entry->ptrCast<IndexCatalogEntry>();
+        if (indexEntry->getTableID() != tableID) {
+            continue;
+        }
+        if (indexEntry->containsPropertyID(propertyID)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool Catalog::containsUnloadedIndex(const Transaction* transaction, common::table_id_t tableID,
+    common::property_id_t propertyID) const {
+    for (auto& [_, entry] : indexes->getEntries(transaction)) {
+        auto indexEntry = entry->ptrCast<IndexCatalogEntry>();
+        if (indexEntry->getTableID() != tableID || !indexEntry->containsPropertyID(propertyID)) {
+            continue;
+        }
+        if (!indexEntry->isLoaded()) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void Catalog::dropAllIndexes(Transaction* transaction, table_id_t tableID) {
+    for (auto catalogEntry : indexes->getEntries(transaction)) {
+        auto& indexCatalogEntry = catalogEntry.second->constCast<IndexCatalogEntry>();
+        if (indexCatalogEntry.getTableID() == tableID) {
+            indexes->dropEntry(transaction, catalogEntry.first, catalogEntry.second->getOID());
+        }
+    }
+}
+
+void Catalog::dropIndex(Transaction* transaction, table_id_t tableID,
+    const std::string& indexName) const {
+    auto uniqueName = IndexCatalogEntry::getInternalIndexName(tableID, indexName);
+    const auto entry = indexes->getEntry(transaction, uniqueName);
+    indexes->dropEntry(transaction, uniqueName, entry->getOID());
+}
+
+void Catalog::dropIndex(Transaction* transaction, oid_t indexOID) {
+    const auto entry = indexes->getEntryOfOID(transaction, indexOID);
+    if (entry == nullptr) {
+        throw CatalogException{stringFormat("Index with OID {} does not exist.", indexOID)};
+    }
+    indexes->dropEntry(transaction, entry->getName(), indexOID);
+}
+
+bool Catalog::containsFunction(const Transaction* transaction, const std::string& name,
+    bool useInternal) const {
+    auto hasEntry = functions->containsEntry(transaction, name);
+    if (!hasEntry && useInternal) {
+        return internalFunctions->containsEntry(transaction, name);
+    }
+    return hasEntry;
+}
+
+void Catalog::addFunction(Transaction* transaction, CatalogEntryType entryType, std::string name,
+    function::function_set functionSet, bool isInternal) {
+    auto& catalogSet = isInternal ? internalFunctions : functions;
+    if (catalogSet->containsEntry(transaction, name)) {
+        throw CatalogException{stringFormat("function {} already exists.", name)};
+    }
+    catalogSet->createEntry(transaction,
+        std::make_unique<FunctionCatalogEntry>(entryType, std::move(name), std::move(functionSet)));
+}
+
+static std::string getFunctionDoesNotExistMessage(std::string_view entryName) {
+    std::string message = stringFormat("function {} does not exist.", entryName);
+    const auto matchingExtensionFunction =
+        extension::ExtensionManager::lookupExtensionsByFunctionName(entryName);
+    if (matchingExtensionFunction.has_value()) {
+        message = stringFormat("function {} is not defined. {}", entryName,
+            getInstallExtensionMessage(matchingExtensionFunction->extensionName, "function"));
+    }
+    return message;
+}
+
+void Catalog::dropFunction(Transaction* transaction, const std::string& name) {
+    if (!containsFunction(transaction, name)) {
+        throw CatalogException{stringFormat("function {} doesn't exist.", name)};
+    }
+    auto entry = getFunctionEntry(transaction, name);
+    functions->dropEntry(transaction, name, entry->getOID());
+}
+
+CatalogEntry* Catalog::getFunctionEntry(const Transaction* transaction, const std::string& name,
+    bool useInternal) const {
+    CatalogEntry* result = nullptr;
+    if (functions->containsEntry(transaction, name)) {
+        result = functions->getEntry(transaction, name);
+    } else if (macros->containsEntry(transaction, name)) {
+        result = macros->getEntry(transaction, name);
+    } else if (useInternal) {
+        result = internalFunctions->getEntry(transaction, name);
+    } else {
+        throw CatalogException(getFunctionDoesNotExistMessage(name));
+    }
+    return result;
+}
+
+std::vector<ScalarMacroCatalogEntry*> Catalog::getMacroEntries(
+    const Transaction* transaction) const {
+    std::vector<ScalarMacroCatalogEntry*> result;
+    for (auto& [_, entry] : macros->getEntries(transaction)) {
+        KU_ASSERT(entry->getType() == CatalogEntryType::SCALAR_MACRO_ENTRY);
+        result.push_back(entry->ptrCast<ScalarMacroCatalogEntry>());
+    }
+    return result;
+}
+
+std::vector<FunctionCatalogEntry*> Catalog::getFunctionEntries(
+    const Transaction* transaction) const {
+    std::vector<FunctionCatalogEntry*> result;
+    for (auto& [_, entry] : functions->getEntries(transaction)) {
+        result.push_back(entry->ptrCast<FunctionCatalogEntry>());
+    }
+    return result;
+}
+
+bool Catalog::containsMacro(const Transaction* transaction, const std::string& macroName) const {
+    return macros->containsEntry(transaction, macroName);
+}
+
+function::ScalarMacroFunction* Catalog::getScalarMacroFunction(const Transaction* transaction,
+    const std::string& name) const {
+    return macros->getEntry(transaction, name)
+        ->constCast<ScalarMacroCatalogEntry>()
+        .getMacroFunction();
+}
+
+// addScalarMacroFunction
+void Catalog::addScalarMacroFunction(Transaction* transaction, std::string name,
+    std::unique_ptr<function::ScalarMacroFunction> macro) {
+    auto entry = std::make_unique<ScalarMacroCatalogEntry>(std::move(name), std::move(macro));
+    macros->createEntry(transaction, std::move(entry));
+}
+
+ScalarMacroCatalogEntry* Catalog::getScalarMacroCatalogEntry(const Transaction* transaction,
+    lbug::common::oid_t macroID) const {
+    auto result = functions->getEntryOfOID(transaction, macroID);
+    if (result == nullptr) {
+        throw RuntimeException(
+            stringFormat("Cannot find macro catalog entry with id {}.", std::to_string(macroID)));
+    }
+
+    return result->ptrCast<ScalarMacroCatalogEntry>();
+}
+
+std::vector<std::string> Catalog::getMacroNames(const Transaction* transaction) const {
+    std::vector<std::string> macroNames;
+    for (auto& [_, function] : macros->getEntries(transaction)) {
+        KU_ASSERT(function->getType() == CatalogEntryType::SCALAR_MACRO_ENTRY);
+        macroNames.push_back(function->getName());
+    }
+    return macroNames;
+}
+
+void Catalog::dropMacro(Transaction* transaction, std::string& name) {
+    if (!containsMacro(transaction, name)) {
+        throw CatalogException{stringFormat("Marco {} doesn't exist.", name)};
+    }
+    auto entry = getFunctionEntry(transaction, name);
+    macros->dropEntry(transaction, name, entry->getOID());
+}
+
+void Catalog::registerBuiltInFunctions() {
+    auto functionCollection = function::FunctionCollection::getFunctions();
+    for (auto i = 0u; functionCollection[i].name != nullptr; ++i) {
+        auto& f = functionCollection[i];
+        auto functionSet = f.getFunctionSetFunc();
+        functions->createEntry(&DUMMY_TRANSACTION,
+            std::make_unique<FunctionCatalogEntry>(f.catalogEntryType, f.name,
+                std::move(functionSet)));
+    }
+}
+
+CatalogEntry* Catalog::createTableEntry(Transaction* transaction,
+    const BoundCreateTableInfo& info) {
+    switch (info.type) {
+    case CatalogEntryType::NODE_TABLE_ENTRY: {
+        return createNodeTableEntry(transaction, info);
+    }
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        return createRelGroupEntry(transaction, info);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+CatalogEntry* Catalog::createNodeTableEntry(Transaction* transaction,
+    const BoundCreateTableInfo& info) {
+    const auto extraInfo = info.extraInfo->constPtrCast<BoundExtraCreateNodeTableInfo>();
+    auto entry = std::make_unique<NodeTableCatalogEntry>(info.tableName, extraInfo->primaryKeyName);
+    for (auto& definition : extraInfo->propertyDefinitions) {
+        entry->addProperty(definition);
+    }
+    entry->setHasParent(info.hasParent);
+    createSerialSequence(transaction, entry.get(), info.isInternal);
+    auto catalogSet = info.isInternal ? internalTables.get() : tables.get();
+    catalogSet->createEntry(transaction, std::move(entry));
+    return catalogSet->getEntry(transaction, info.tableName);
+}
+
+void Catalog::createSerialSequence(Transaction* transaction, const TableCatalogEntry* entry,
+    bool isInternal) {
+    for (auto& definition : entry->getProperties()) {
+        if (definition.getType().getLogicalTypeID() != LogicalTypeID::SERIAL) {
+            continue;
+        }
+        const auto seqName =
+            SequenceCatalogEntry::getSerialName(entry->getName(), definition.getName());
+        auto seqInfo =
+            BoundCreateSequenceInfo(seqName, 0, 1, 0, std::numeric_limits<int64_t>::max(), false,
+                ConflictAction::ON_CONFLICT_THROW, isInternal);
+        seqInfo.hasParent = true;
+        createSequence(transaction, seqInfo);
+    }
+}
+
+void Catalog::dropSerialSequence(Transaction* transaction, const TableCatalogEntry* entry) {
+    for (auto& definition : entry->getProperties()) {
+        if (definition.getType().getLogicalTypeID() != LogicalTypeID::SERIAL) {
+            continue;
+        }
+        auto seqName = SequenceCatalogEntry::getSerialName(entry->getName(), definition.getName());
+        dropSequence(transaction, seqName);
+    }
+}
+
+void Catalog::serialize(Serializer& ser) const {
+    tables->serialize(ser);
+    sequences->serialize(ser);
+    functions->serialize(ser);
+    types->serialize(ser);
+    indexes->serialize(ser);
+    macros->serialize(ser);
+    internalTables->serialize(ser);
+    internalSequences->serialize(ser);
+    internalFunctions->serialize(ser);
+}
+
+void Catalog::deserialize(Deserializer& deSer) {
+    tables = CatalogSet::deserialize(deSer);
+    sequences = CatalogSet::deserialize(deSer);
+    functions = CatalogSet::deserialize(deSer);
+    registerBuiltInFunctions();
+    types = CatalogSet::deserialize(deSer);
+    indexes = CatalogSet::deserialize(deSer);
+    macros = CatalogSet::deserialize(deSer);
+    internalTables = CatalogSet::deserialize(deSer);
+    internalSequences = CatalogSet::deserialize(deSer);
+    internalFunctions = CatalogSet::deserialize(deSer);
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/CMakeLists.txt
new file mode 100644
index 0000000000..e7f697c93c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/CMakeLists.txt
@@ -0,0 +1,17 @@
+add_library(lbug_catalog_entry
+        OBJECT
+        catalog_entry.cpp
+        catalog_entry_type.cpp
+        function_catalog_entry.cpp
+        table_catalog_entry.cpp
+        node_table_catalog_entry.cpp
+        node_table_id_pair.cpp
+        rel_group_catalog_entry.cpp
+        scalar_macro_catalog_entry.cpp
+        type_catalog_entry.cpp
+        sequence_catalog_entry.cpp
+        index_catalog_entry.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_catalog_entry>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/catalog_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/catalog_entry.cpp
new file mode 100644
index 0000000000..73250d06e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/catalog_entry.cpp
@@ -0,0 +1,78 @@
+#include "catalog/catalog_entry/catalog_entry.h"
+
+#include "catalog/catalog_entry/index_catalog_entry.h"
+#include "catalog/catalog_entry/scalar_macro_catalog_entry.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "catalog/catalog_entry/type_catalog_entry.h"
+#include "common/serializer/deserializer.h"
+#include "transaction/transaction.h"
+
+namespace lbug {
+namespace catalog {
+
+void CatalogEntry::serialize(common::Serializer& serializer) const {
+    serializer.writeDebuggingInfo("type");
+    serializer.write(type);
+    serializer.writeDebuggingInfo("name");
+    serializer.write(name);
+    serializer.writeDebuggingInfo("oid");
+    serializer.write(oid);
+    serializer.writeDebuggingInfo("hasParent_");
+    serializer.write(hasParent_);
+}
+
+std::unique_ptr<CatalogEntry> CatalogEntry::deserialize(common::Deserializer& deserializer) {
+    std::string debuggingInfo;
+    auto type = CatalogEntryType::DUMMY_ENTRY;
+    std::string name;
+    common::oid_t oid = common::INVALID_OID;
+    bool hasParent_ = false;
+    deserializer.validateDebuggingInfo(debuggingInfo, "type");
+    deserializer.deserializeValue(type);
+    deserializer.validateDebuggingInfo(debuggingInfo, "name");
+    deserializer.deserializeValue(name);
+    deserializer.validateDebuggingInfo(debuggingInfo, "oid");
+    deserializer.deserializeValue(oid);
+    deserializer.validateDebuggingInfo(debuggingInfo, "hasParent_");
+    deserializer.deserializeValue(hasParent_);
+    std::unique_ptr<CatalogEntry> entry;
+    switch (type) {
+    case CatalogEntryType::NODE_TABLE_ENTRY:
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        entry = TableCatalogEntry::deserialize(deserializer, type);
+    } break;
+    case CatalogEntryType::SCALAR_MACRO_ENTRY: {
+        entry = ScalarMacroCatalogEntry::deserialize(deserializer);
+    } break;
+    case CatalogEntryType::SEQUENCE_ENTRY: {
+        entry = SequenceCatalogEntry::deserialize(deserializer);
+    } break;
+    case CatalogEntryType::TYPE_ENTRY: {
+        entry = TypeCatalogEntry::deserialize(deserializer);
+    } break;
+    case CatalogEntryType::INDEX_ENTRY: {
+        entry = IndexCatalogEntry::deserialize(deserializer);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    entry->type = type;
+    entry->name = std::move(name);
+    entry->oid = oid;
+    entry->hasParent_ = hasParent_;
+    entry->timestamp = transaction::Transaction::DUMMY_START_TIMESTAMP;
+    return entry;
+}
+
+void CatalogEntry::copyFrom(const CatalogEntry& other) {
+    type = other.type;
+    name = other.name;
+    oid = other.oid;
+    timestamp = other.timestamp;
+    deleted = other.deleted;
+    hasParent_ = other.hasParent_;
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/catalog_entry_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/catalog_entry_type.cpp
new file mode 100644
index 0000000000..7779e4e5e9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/catalog_entry_type.cpp
@@ -0,0 +1,61 @@
+#include "catalog/catalog_entry/catalog_entry_type.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace catalog {
+
+std::string CatalogEntryTypeUtils::toString(CatalogEntryType type) {
+    switch (type) {
+    case CatalogEntryType::NODE_TABLE_ENTRY:
+        return "NODE_TABLE_ENTRY";
+    case CatalogEntryType::REL_GROUP_ENTRY:
+        return "REL_GROUP_ENTRY";
+    case CatalogEntryType::FOREIGN_TABLE_ENTRY:
+        return "FOREIGN_TABLE_ENTRY";
+    case CatalogEntryType::SCALAR_MACRO_ENTRY:
+        return "SCALAR_MACRO_ENTRY";
+    case CatalogEntryType::AGGREGATE_FUNCTION_ENTRY:
+        return "AGGREGATE_FUNCTION_ENTRY";
+    case CatalogEntryType::SCALAR_FUNCTION_ENTRY:
+        return "SCALAR_FUNCTION_ENTRY";
+    case CatalogEntryType::REWRITE_FUNCTION_ENTRY:
+        return "REWRITE_FUNCTION_ENTRY";
+    case CatalogEntryType::TABLE_FUNCTION_ENTRY:
+        return "TABLE_FUNCTION_ENTRY";
+    case CatalogEntryType::STANDALONE_TABLE_FUNCTION_ENTRY:
+        return "STANDALONE_TABLE_FUNCTION_ENTRY";
+    case CatalogEntryType::COPY_FUNCTION_ENTRY:
+        return "COPY_FUNCTION_ENTRY";
+    case CatalogEntryType::DUMMY_ENTRY:
+        return "DUMMY_ENTRY";
+    case CatalogEntryType::SEQUENCE_ENTRY:
+        return "SEQUENCE_ENTRY";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::string FunctionEntryTypeUtils::toString(CatalogEntryType type) {
+    switch (type) {
+    case CatalogEntryType::SCALAR_MACRO_ENTRY:
+        return "MACRO FUNCTION";
+    case CatalogEntryType::AGGREGATE_FUNCTION_ENTRY:
+        return "AGGREGATE FUNCTION";
+    case CatalogEntryType::SCALAR_FUNCTION_ENTRY:
+        return "SCALAR FUNCTION";
+    case CatalogEntryType::REWRITE_FUNCTION_ENTRY:
+        return "REWRITE FUNCTION";
+    case CatalogEntryType::TABLE_FUNCTION_ENTRY:
+        return "TABLE FUNCTION";
+    case CatalogEntryType::STANDALONE_TABLE_FUNCTION_ENTRY:
+        return "STANDALONE TABLE FUNCTION";
+    case CatalogEntryType::COPY_FUNCTION_ENTRY:
+        return "COPY FUNCTION";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/function_catalog_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/function_catalog_entry.cpp
new file mode 100644
index 0000000000..c4dc949151
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/function_catalog_entry.cpp
@@ -0,0 +1,11 @@
+#include "catalog/catalog_entry/function_catalog_entry.h"
+
+namespace lbug {
+namespace catalog {
+
+FunctionCatalogEntry::FunctionCatalogEntry(CatalogEntryType entryType, std::string name,
+    function::function_set functionSet)
+    : CatalogEntry{entryType, std::move(name)}, functionSet{std::move(functionSet)} {}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/index_catalog_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/index_catalog_entry.cpp
new file mode 100644
index 0000000000..2d4d83e7d2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/index_catalog_entry.cpp
@@ -0,0 +1,84 @@
+#include "catalog/catalog_entry/index_catalog_entry.h"
+
+#include "common/exception/runtime.h"
+#include "common/serializer/buffer_writer.h"
+
+namespace lbug {
+namespace catalog {
+
+std::shared_ptr<common::BufferWriter> IndexAuxInfo::serialize() const {
+    return std::make_shared<common::BufferWriter>(0 /*maximumSize*/);
+}
+
+void IndexCatalogEntry::setAuxInfo(std::unique_ptr<IndexAuxInfo> auxInfo_) {
+    auxInfo = std::move(auxInfo_);
+    auxBuffer = nullptr;
+    auxBufferSize = 0;
+}
+
+bool IndexCatalogEntry::containsPropertyID(common::property_id_t propertyID) const {
+    for (auto id : propertyIDs) {
+        if (id == propertyID) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void IndexCatalogEntry::serialize(common::Serializer& serializer) const {
+    CatalogEntry::serialize(serializer);
+    serializer.write(type);
+    serializer.write(tableID);
+    serializer.write(indexName);
+    serializer.serializeVector(propertyIDs);
+    if (isLoaded()) {
+        const auto bufferedWriter = auxInfo->serialize();
+        serializer.write<uint64_t>(bufferedWriter->getSize());
+        serializer.write(bufferedWriter->getData().data.get(), bufferedWriter->getSize());
+    } else {
+        serializer.write(auxBufferSize);
+        serializer.write(auxBuffer.get(), auxBufferSize);
+    }
+}
+
+std::unique_ptr<IndexCatalogEntry> IndexCatalogEntry::deserialize(
+    common::Deserializer& deserializer) {
+    std::string type;
+    common::table_id_t tableID = common::INVALID_TABLE_ID;
+    std::string indexName;
+    std::vector<common::property_id_t> propertyIDs;
+    deserializer.deserializeValue(type);
+    deserializer.deserializeValue(tableID);
+    deserializer.deserializeValue(indexName);
+    deserializer.deserializeVector(propertyIDs);
+    auto indexEntry = std::make_unique<IndexCatalogEntry>(type, tableID, std::move(indexName),
+        std::move(propertyIDs), nullptr /* auxInfo */);
+    uint64_t auxBufferSize = 0;
+    deserializer.deserializeValue(auxBufferSize);
+    indexEntry->auxBuffer = std::make_unique<uint8_t[]>(auxBufferSize);
+    indexEntry->auxBufferSize = auxBufferSize;
+    deserializer.read(indexEntry->auxBuffer.get(), auxBufferSize);
+    return indexEntry;
+}
+
+void IndexCatalogEntry::copyFrom(const CatalogEntry& other) {
+    CatalogEntry::copyFrom(other);
+    auto& otherTable = other.constCast<IndexCatalogEntry>();
+    tableID = otherTable.tableID;
+    indexName = otherTable.indexName;
+    if (auxInfo) {
+        auxInfo = otherTable.auxInfo->copy();
+    }
+}
+std::unique_ptr<common::BufferReader> IndexCatalogEntry::getAuxBufferReader() const {
+    // LCOV_EXCL_START
+    if (!auxBuffer) {
+        throw common::RuntimeException(
+            common::stringFormat("Auxiliary buffer for index \"{}\" is not set.", indexName));
+    }
+    // LCOV_EXCL_STOP
+    return std::make_unique<common::BufferReader>(auxBuffer.get(), auxBufferSize);
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/node_table_catalog_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/node_table_catalog_entry.cpp
new file mode 100644
index 0000000000..53515154ed
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/node_table_catalog_entry.cpp
@@ -0,0 +1,56 @@
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+
+#include "binder/ddl/bound_create_table_info.h"
+#include "common/serializer/deserializer.h"
+#include "common/string_utils.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace catalog {
+
+void NodeTableCatalogEntry::renameProperty(const std::string& propertyName,
+    const std::string& newName) {
+    TableCatalogEntry::renameProperty(propertyName, newName);
+    if (common::StringUtils::caseInsensitiveEquals(propertyName, primaryKeyName)) {
+        primaryKeyName = newName;
+    }
+}
+
+void NodeTableCatalogEntry::serialize(common::Serializer& serializer) const {
+    TableCatalogEntry::serialize(serializer);
+    serializer.writeDebuggingInfo("primaryKeyName");
+    serializer.write(primaryKeyName);
+}
+
+std::unique_ptr<NodeTableCatalogEntry> NodeTableCatalogEntry::deserialize(
+    common::Deserializer& deserializer) {
+    std::string debuggingInfo;
+    std::string primaryKeyName;
+    deserializer.validateDebuggingInfo(debuggingInfo, "primaryKeyName");
+    deserializer.deserializeValue(primaryKeyName);
+    auto nodeTableEntry = std::make_unique<NodeTableCatalogEntry>();
+    nodeTableEntry->primaryKeyName = primaryKeyName;
+    return nodeTableEntry;
+}
+
+std::string NodeTableCatalogEntry::toCypher(const ToCypherInfo& /*info*/) const {
+    return common::stringFormat("CREATE NODE TABLE `{}` ({} PRIMARY KEY(`{}`));", getName(),
+        propertyCollection.toCypher(), primaryKeyName);
+}
+
+std::unique_ptr<TableCatalogEntry> NodeTableCatalogEntry::copy() const {
+    auto other = std::make_unique<NodeTableCatalogEntry>();
+    other->primaryKeyName = primaryKeyName;
+    other->copyFrom(*this);
+    return other;
+}
+
+std::unique_ptr<BoundExtraCreateCatalogEntryInfo> NodeTableCatalogEntry::getBoundExtraCreateInfo(
+    transaction::Transaction*) const {
+    return std::make_unique<BoundExtraCreateNodeTableInfo>(primaryKeyName,
+        copyVector(getProperties()));
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/node_table_id_pair.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/node_table_id_pair.cpp
new file mode 100644
index 0000000000..3d98763d04
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/node_table_id_pair.cpp
@@ -0,0 +1,30 @@
+#include "catalog/catalog_entry/node_table_id_pair.h"
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace catalog {
+
+void NodeTableIDPair::serialize(Serializer& serializer) const {
+    serializer.writeDebuggingInfo("srcTableID");
+    serializer.serializeValue(srcTableID);
+    serializer.writeDebuggingInfo("dstTableID");
+    serializer.serializeValue(dstTableID);
+}
+
+NodeTableIDPair NodeTableIDPair::deserialize(Deserializer& deser) {
+    std::string debuggingInfo;
+    table_id_t srcTableID = INVALID_TABLE_ID;
+    table_id_t dstTableID = INVALID_TABLE_ID;
+    deser.validateDebuggingInfo(debuggingInfo, "srcTableID");
+    deser.deserializeValue(srcTableID);
+    deser.validateDebuggingInfo(debuggingInfo, "dstTableID");
+    deser.deserializeValue(dstTableID);
+    return NodeTableIDPair{srcTableID, dstTableID};
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/rel_group_catalog_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/rel_group_catalog_entry.cpp
new file mode 100644
index 0000000000..b87722c6bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/rel_group_catalog_entry.cpp
@@ -0,0 +1,187 @@
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+
+#include <sstream>
+
+#include "binder/ddl/bound_create_table_info.h"
+#include "catalog/catalog.h"
+#include "common/serializer/deserializer.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace catalog {
+
+void RelGroupCatalogEntry::addFromToConnection(table_id_t srcTableID, table_id_t dstTableID,
+    oid_t oid) {
+    relTableInfos.emplace_back(NodeTableIDPair{srcTableID, dstTableID}, oid);
+}
+
+void RelGroupCatalogEntry::dropFromToConnection(table_id_t srcTableID, table_id_t dstTableID) {
+    auto tmpInfos = relTableInfos;
+    relTableInfos.clear();
+    for (auto& tmpInfo : tmpInfos) {
+        if (tmpInfo.nodePair.srcTableID == srcTableID &&
+            tmpInfo.nodePair.dstTableID == dstTableID) {
+            continue;
+        }
+        relTableInfos.emplace_back(tmpInfo);
+    }
+}
+
+void RelTableCatalogInfo::serialize(Serializer& ser) const {
+    ser.writeDebuggingInfo("nodePair");
+    nodePair.serialize(ser);
+    ser.writeDebuggingInfo("oid");
+    ser.serializeValue(oid);
+}
+
+RelTableCatalogInfo RelTableCatalogInfo::deserialize(Deserializer& deser) {
+    std::string debuggingInfo;
+    oid_t oid = INVALID_OID;
+    deser.validateDebuggingInfo(debuggingInfo, "nodePair");
+    auto nodePair = NodeTableIDPair::deserialize(deser);
+    deser.validateDebuggingInfo(debuggingInfo, "oid");
+    deser.deserializeValue(oid);
+    return RelTableCatalogInfo{nodePair, oid};
+}
+
+bool RelGroupCatalogEntry::isParent(table_id_t tableID) {
+    for (auto& info : relTableInfos) {
+        if (info.nodePair.srcTableID == tableID || info.nodePair.dstTableID == tableID) {
+            return true;
+        }
+    }
+    return false;
+}
+
+const RelTableCatalogInfo& RelGroupCatalogEntry::getSingleRelEntryInfo() const {
+    KU_ASSERT(relTableInfos.size() == 1);
+    return relTableInfos[0];
+}
+
+const RelTableCatalogInfo* RelGroupCatalogEntry::getRelEntryInfo(table_id_t srcTableID,
+    table_id_t dstTableID) const {
+    for (auto& info : relTableInfos) {
+        if (info.nodePair.srcTableID == srcTableID && info.nodePair.dstTableID == dstTableID) {
+            return &info;
+        }
+    }
+    return nullptr;
+}
+
+std::unordered_set<table_id_t> RelGroupCatalogEntry::getSrcNodeTableIDSet() const {
+    std::unordered_set<table_id_t> result;
+    for (auto& info : relTableInfos) {
+        result.insert(info.nodePair.srcTableID);
+    }
+    return result;
+}
+
+std::unordered_set<table_id_t> RelGroupCatalogEntry::getDstNodeTableIDSet() const {
+    std::unordered_set<table_id_t> result;
+    for (auto& info : relTableInfos) {
+        result.insert(info.nodePair.dstTableID);
+    }
+    return result;
+}
+
+void RelGroupCatalogEntry::serialize(Serializer& serializer) const {
+    TableCatalogEntry::serialize(serializer);
+    serializer.writeDebuggingInfo("srcMultiplicity");
+    serializer.serializeValue(srcMultiplicity);
+    serializer.writeDebuggingInfo("dstMultiplicity");
+    serializer.serializeValue(dstMultiplicity);
+    serializer.writeDebuggingInfo("storageDirection");
+    serializer.serializeValue(storageDirection);
+    serializer.writeDebuggingInfo("relTableInfos");
+    serializer.serializeVector(relTableInfos);
+}
+
+std::unique_ptr<RelGroupCatalogEntry> RelGroupCatalogEntry::deserialize(
+    Deserializer& deserializer) {
+    std::string debuggingInfo;
+    auto srcMultiplicity = RelMultiplicity::MANY;
+    auto dstMultiplicity = RelMultiplicity::MANY;
+    auto storageDirection = ExtendDirection::BOTH;
+    std::vector<RelTableCatalogInfo> relTableInfos;
+    deserializer.validateDebuggingInfo(debuggingInfo, "srcMultiplicity");
+    deserializer.deserializeValue(srcMultiplicity);
+    deserializer.validateDebuggingInfo(debuggingInfo, "dstMultiplicity");
+    deserializer.deserializeValue(dstMultiplicity);
+    deserializer.validateDebuggingInfo(debuggingInfo, "storageDirection");
+    deserializer.deserializeValue(storageDirection);
+    deserializer.validateDebuggingInfo(debuggingInfo, "relTableInfos");
+    deserializer.deserializeVector(relTableInfos);
+    auto relGroupEntry = std::make_unique<RelGroupCatalogEntry>();
+    relGroupEntry->srcMultiplicity = srcMultiplicity;
+    relGroupEntry->dstMultiplicity = dstMultiplicity;
+    relGroupEntry->storageDirection = storageDirection;
+    relGroupEntry->relTableInfos = relTableInfos;
+    return relGroupEntry;
+}
+
+static std::string getFromToStr(const NodeTableIDPair& pair, const Catalog* catalog,
+    const transaction::Transaction* transaction) {
+    auto srcTableName = catalog->getTableCatalogEntry(transaction, pair.srcTableID)->getName();
+    auto dstTableName = catalog->getTableCatalogEntry(transaction, pair.dstTableID)->getName();
+    return stringFormat("FROM `{}` TO `{}`", srcTableName, dstTableName);
+}
+
+std::string RelGroupCatalogEntry::toCypher(const ToCypherInfo& info) const {
+    auto relGroupInfo = info.constCast<RelGroupToCypherInfo>();
+    auto catalog = Catalog::Get(*relGroupInfo.context);
+    auto transaction = transaction::Transaction::Get(*relGroupInfo.context);
+    std::stringstream ss;
+    ss << stringFormat("CREATE REL TABLE `{}` (", getName());
+    KU_ASSERT(!relTableInfos.empty());
+    ss << getFromToStr(relTableInfos[0].nodePair, catalog, transaction);
+    for (auto i = 1u; i < relTableInfos.size(); ++i) {
+        ss << stringFormat(", {}", getFromToStr(relTableInfos[i].nodePair, catalog, transaction));
+    }
+    ss << ", " << propertyCollection.toCypher() << RelMultiplicityUtils::toString(srcMultiplicity)
+       << "_" << RelMultiplicityUtils::toString(dstMultiplicity) << ");";
+    return ss.str();
+}
+
+std::vector<RelDataDirection> RelGroupCatalogEntry::getRelDataDirections() const {
+    switch (storageDirection) {
+    case ExtendDirection::FWD: {
+        return {RelDataDirection::FWD};
+    }
+    case ExtendDirection::BWD: {
+        return {RelDataDirection::BWD};
+    }
+    case ExtendDirection::BOTH: {
+        return {RelDataDirection::FWD, RelDataDirection::BWD};
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+std::unique_ptr<TableCatalogEntry> RelGroupCatalogEntry::copy() const {
+    auto other = std::make_unique<RelGroupCatalogEntry>();
+    other->srcMultiplicity = srcMultiplicity;
+    other->dstMultiplicity = dstMultiplicity;
+    other->storageDirection = storageDirection;
+    other->relTableInfos = relTableInfos;
+    other->copyFrom(*this);
+    return other;
+}
+
+std::unique_ptr<binder::BoundExtraCreateCatalogEntryInfo>
+RelGroupCatalogEntry::getBoundExtraCreateInfo(transaction::Transaction*) const {
+    std::vector<NodeTableIDPair> nodePairs;
+    for (auto& relTableInfo : relTableInfos) {
+        nodePairs.push_back(relTableInfo.nodePair);
+    }
+    return std::make_unique<binder::BoundExtraCreateRelTableGroupInfo>(
+        copyVector(propertyCollection.getDefinitions()), srcMultiplicity, dstMultiplicity,
+        storageDirection, std::move(nodePairs));
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/scalar_macro_catalog_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/scalar_macro_catalog_entry.cpp
new file mode 100644
index 0000000000..7cebd6d328
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/scalar_macro_catalog_entry.cpp
@@ -0,0 +1,29 @@
+#include "catalog/catalog_entry/scalar_macro_catalog_entry.h"
+
+namespace lbug {
+namespace catalog {
+
+ScalarMacroCatalogEntry::ScalarMacroCatalogEntry(std::string name,
+    std::unique_ptr<function::ScalarMacroFunction> macroFunction)
+    : CatalogEntry{CatalogEntryType::SCALAR_MACRO_ENTRY, std::move(name)},
+      macroFunction{std::move(macroFunction)} {}
+
+void ScalarMacroCatalogEntry::serialize(common::Serializer& serializer) const {
+    CatalogEntry::serialize(serializer);
+    macroFunction->serialize(serializer);
+}
+
+std::unique_ptr<ScalarMacroCatalogEntry> ScalarMacroCatalogEntry::deserialize(
+    common::Deserializer& deserializer) {
+    auto scalarMacroCatalogEntry = std::make_unique<ScalarMacroCatalogEntry>();
+    scalarMacroCatalogEntry->macroFunction =
+        function::ScalarMacroFunction::deserialize(deserializer);
+    return scalarMacroCatalogEntry;
+}
+
+std::string ScalarMacroCatalogEntry::toCypher(const ToCypherInfo& /*info*/) const {
+    return macroFunction->toCypher(getName());
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/sequence_catalog_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/sequence_catalog_entry.cpp
new file mode 100644
index 0000000000..aeb8c8d641
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/sequence_catalog_entry.cpp
@@ -0,0 +1,173 @@
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+
+#include "binder/ddl/bound_create_sequence_info.h"
+#include "common/exception/catalog.h"
+#include "common/exception/overflow.h"
+#include "common/serializer/deserializer.h"
+#include "common/vector/value_vector.h"
+#include "function/arithmetic/add.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace catalog {
+
+SequenceData SequenceCatalogEntry::getSequenceData() {
+    std::lock_guard lck(mtx);
+    return sequenceData;
+}
+
+int64_t SequenceCatalogEntry::currVal() {
+    std::lock_guard lck(mtx);
+    if (sequenceData.usageCount == 0) {
+        throw CatalogException(
+            "currval: sequence \"" + name +
+            "\" is not yet defined. To define the sequence, call nextval first.");
+    }
+    return sequenceData.currVal;
+}
+
+void SequenceCatalogEntry::nextValNoLock() {
+    if (sequenceData.usageCount == 0) {
+        // initialization of sequence
+        sequenceData.usageCount++;
+        return;
+    }
+    bool overflow = false;
+    auto next = sequenceData.currVal;
+    try {
+        function::Add::operation(next, sequenceData.increment, next);
+    } catch (const OverflowException&) {
+        overflow = true;
+    }
+    if (sequenceData.cycle) {
+        if (overflow) {
+            next = sequenceData.increment < 0 ? sequenceData.maxValue : sequenceData.minValue;
+        } else if (next < sequenceData.minValue) {
+            next = sequenceData.maxValue;
+        } else if (next > sequenceData.maxValue) {
+            next = sequenceData.minValue;
+        }
+    } else {
+        const bool minError = overflow ? sequenceData.increment < 0 : next < sequenceData.minValue;
+        const bool maxError = overflow ? sequenceData.increment > 0 : next > sequenceData.maxValue;
+        if (minError) {
+            throw CatalogException("nextval: reached minimum value of sequence \"" + name + "\" " +
+                                   std::to_string(sequenceData.minValue));
+        }
+        if (maxError) {
+            throw CatalogException("nextval: reached maximum value of sequence \"" + name + "\" " +
+                                   std::to_string(sequenceData.maxValue));
+        }
+    }
+    sequenceData.currVal = next;
+    sequenceData.usageCount++;
+}
+
+// referenced from DuckDB
+void SequenceCatalogEntry::nextKVal(transaction::Transaction* transaction, const uint64_t& count) {
+    KU_ASSERT(count > 0);
+    SequenceRollbackData rollbackData{};
+    {
+        std::lock_guard lck(mtx);
+        rollbackData = SequenceRollbackData{sequenceData.usageCount, sequenceData.currVal};
+        for (auto i = 0ul; i < count; i++) {
+            nextValNoLock();
+        }
+    }
+    transaction->pushSequenceChange(this, count, rollbackData);
+}
+
+void SequenceCatalogEntry::nextKVal(transaction::Transaction* transaction, const uint64_t& count,
+    ValueVector& resultVector) {
+    KU_ASSERT(count > 0);
+    SequenceRollbackData rollbackData{};
+    {
+        std::lock_guard lck(mtx);
+        rollbackData = SequenceRollbackData{sequenceData.usageCount, sequenceData.currVal};
+        for (auto i = 0ul; i < count; i++) {
+            nextValNoLock();
+            resultVector.setValue(i, sequenceData.currVal);
+        }
+    }
+    transaction->pushSequenceChange(this, count, rollbackData);
+}
+
+void SequenceCatalogEntry::rollbackVal(const uint64_t& usageCount, const int64_t& currVal) {
+    std::lock_guard lck(mtx);
+    sequenceData.usageCount = usageCount;
+    sequenceData.currVal = currVal;
+}
+
+void SequenceCatalogEntry::serialize(Serializer& serializer) const {
+    CatalogEntry::serialize(serializer);
+    serializer.writeDebuggingInfo("usageCount");
+    serializer.write(sequenceData.usageCount);
+    serializer.writeDebuggingInfo("currVal");
+    serializer.write(sequenceData.currVal);
+    serializer.writeDebuggingInfo("increment");
+    serializer.write(sequenceData.increment);
+    serializer.writeDebuggingInfo("startValue");
+    serializer.write(sequenceData.startValue);
+    serializer.writeDebuggingInfo("minValue");
+    serializer.write(sequenceData.minValue);
+    serializer.writeDebuggingInfo("maxValue");
+    serializer.write(sequenceData.maxValue);
+    serializer.writeDebuggingInfo("cycle");
+    serializer.write(sequenceData.cycle);
+}
+
+std::unique_ptr<SequenceCatalogEntry> SequenceCatalogEntry::deserialize(
+    Deserializer& deserializer) {
+    std::string debuggingInfo;
+    uint64_t usageCount = 0;
+    int64_t currVal = 0;
+    int64_t increment = 0;
+    int64_t startValue = 0;
+    int64_t minValue = 0;
+    int64_t maxValue = 0;
+    bool cycle = false;
+    deserializer.validateDebuggingInfo(debuggingInfo, "usageCount");
+    deserializer.deserializeValue(usageCount);
+    deserializer.validateDebuggingInfo(debuggingInfo, "currVal");
+    deserializer.deserializeValue(currVal);
+    deserializer.validateDebuggingInfo(debuggingInfo, "increment");
+    deserializer.deserializeValue(increment);
+    deserializer.validateDebuggingInfo(debuggingInfo, "startValue");
+    deserializer.deserializeValue(startValue);
+    deserializer.validateDebuggingInfo(debuggingInfo, "minValue");
+    deserializer.deserializeValue(minValue);
+    deserializer.validateDebuggingInfo(debuggingInfo, "maxValue");
+    deserializer.deserializeValue(maxValue);
+    deserializer.validateDebuggingInfo(debuggingInfo, "cycle");
+    deserializer.deserializeValue(cycle);
+    auto result = std::make_unique<SequenceCatalogEntry>();
+    result->sequenceData.usageCount = usageCount;
+    result->sequenceData.currVal = currVal;
+    result->sequenceData.increment = increment;
+    result->sequenceData.startValue = startValue;
+    result->sequenceData.minValue = minValue;
+    result->sequenceData.maxValue = maxValue;
+    result->sequenceData.cycle = cycle;
+    return result;
+}
+
+std::string SequenceCatalogEntry::toCypher(const ToCypherInfo& /* info */) const {
+    return stringFormat("DROP SEQUENCE IF EXISTS `{}`;\n"
+                        "CREATE SEQUENCE IF NOT EXISTS `{}` START {} INCREMENT {} MINVALUE {} "
+                        "MAXVALUE {} {} CYCLE;\n"
+                        "RETURN nextval('{}');",
+        getName(), getName(), sequenceData.currVal, sequenceData.increment, sequenceData.minValue,
+        sequenceData.maxValue, sequenceData.cycle ? "" : "NO", getName());
+}
+
+BoundCreateSequenceInfo SequenceCatalogEntry::getBoundCreateSequenceInfo(bool isInternal) const {
+    return BoundCreateSequenceInfo(name, sequenceData.startValue, sequenceData.increment,
+        sequenceData.minValue, sequenceData.maxValue, sequenceData.cycle,
+        ConflictAction::ON_CONFLICT_THROW, isInternal);
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/table_catalog_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/table_catalog_entry.cpp
new file mode 100644
index 0000000000..4ec34c733a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/table_catalog_entry.cpp
@@ -0,0 +1,153 @@
+#include "catalog/catalog_entry/table_catalog_entry.h"
+
+#include "binder/ddl/bound_alter_info.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/serializer/deserializer.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace catalog {
+
+std::unique_ptr<TableCatalogEntry> TableCatalogEntry::alter(transaction_t timestamp,
+    const BoundAlterInfo& alterInfo, CatalogSet* tables) const {
+    KU_ASSERT(!deleted);
+    auto newEntry = copy();
+    switch (alterInfo.alterType) {
+    case AlterType::RENAME: {
+        auto& renameTableInfo = *alterInfo.extraInfo->constPtrCast<BoundExtraRenameTableInfo>();
+        newEntry->rename(renameTableInfo.newName);
+    } break;
+    case AlterType::RENAME_PROPERTY: {
+        auto& renamePropInfo = *alterInfo.extraInfo->constPtrCast<BoundExtraRenamePropertyInfo>();
+        newEntry->renameProperty(renamePropInfo.oldName, renamePropInfo.newName);
+    } break;
+    case AlterType::ADD_PROPERTY: {
+        auto& addPropInfo = *alterInfo.extraInfo->constPtrCast<BoundExtraAddPropertyInfo>();
+        newEntry->addProperty(addPropInfo.propertyDefinition);
+    } break;
+    case AlterType::DROP_PROPERTY: {
+        auto& dropPropInfo = *alterInfo.extraInfo->constPtrCast<BoundExtraDropPropertyInfo>();
+        newEntry->dropProperty(dropPropInfo.propertyName);
+    } break;
+    case AlterType::COMMENT: {
+        auto& commentInfo = *alterInfo.extraInfo->constPtrCast<BoundExtraCommentInfo>();
+        newEntry->setComment(commentInfo.comment);
+    } break;
+    case AlterType::ADD_FROM_TO_CONNECTION: {
+        auto& connectionInfo =
+            *alterInfo.extraInfo->constPtrCast<BoundExtraAlterFromToConnection>();
+        newEntry->ptrCast<RelGroupCatalogEntry>()->addFromToConnection(connectionInfo.fromTableID,
+            connectionInfo.toTableID, tables->getNextOIDNoLock());
+    } break;
+    case AlterType::DROP_FROM_TO_CONNECTION: {
+        auto& connectionInfo =
+            *alterInfo.extraInfo->constPtrCast<BoundExtraAlterFromToConnection>();
+        newEntry->ptrCast<RelGroupCatalogEntry>()->dropFromToConnection(connectionInfo.fromTableID,
+            connectionInfo.toTableID);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    newEntry->setOID(oid);
+    newEntry->setTimestamp(timestamp);
+    return newEntry;
+}
+
+column_id_t TableCatalogEntry::getMaxColumnID() const {
+    return propertyCollection.getMaxColumnID();
+}
+
+void TableCatalogEntry::vacuumColumnIDs(column_id_t nextColumnID) {
+    propertyCollection.vacuumColumnIDs(nextColumnID);
+}
+
+bool TableCatalogEntry::containsProperty(const std::string& propertyName) const {
+    return propertyCollection.contains(propertyName);
+}
+
+property_id_t TableCatalogEntry::getPropertyID(const std::string& propertyName) const {
+    return propertyCollection.getPropertyID(propertyName);
+}
+
+const PropertyDefinition& TableCatalogEntry::getProperty(const std::string& propertyName) const {
+    return propertyCollection.getDefinition(propertyName);
+}
+
+const PropertyDefinition& TableCatalogEntry::getProperty(idx_t idx) const {
+    return propertyCollection.getDefinition(idx);
+}
+
+column_id_t TableCatalogEntry::getColumnID(const std::string& propertyName) const {
+    return propertyCollection.getColumnID(propertyName);
+}
+
+common::column_id_t TableCatalogEntry::getColumnID(common::idx_t idx) const {
+    return propertyCollection.getColumnID(idx);
+}
+
+void TableCatalogEntry::addProperty(const PropertyDefinition& propertyDefinition) {
+    propertyCollection.add(propertyDefinition);
+}
+
+void TableCatalogEntry::dropProperty(const std::string& propertyName) {
+    propertyCollection.drop(propertyName);
+}
+
+void TableCatalogEntry::renameProperty(const std::string& propertyName,
+    const std::string& newName) {
+    propertyCollection.rename(propertyName, newName);
+}
+
+void TableCatalogEntry::serialize(Serializer& serializer) const {
+    CatalogEntry::serialize(serializer);
+    serializer.writeDebuggingInfo("comment");
+    serializer.write(comment);
+    serializer.writeDebuggingInfo("properties");
+    propertyCollection.serialize(serializer);
+}
+
+std::unique_ptr<TableCatalogEntry> TableCatalogEntry::deserialize(Deserializer& deserializer,
+    CatalogEntryType type) {
+    std::string debuggingInfo;
+    std::string comment;
+    deserializer.validateDebuggingInfo(debuggingInfo, "comment");
+    deserializer.deserializeValue(comment);
+    deserializer.validateDebuggingInfo(debuggingInfo, "properties");
+    auto propertyCollection = PropertyDefinitionCollection::deserialize(deserializer);
+    std::unique_ptr<TableCatalogEntry> result;
+    switch (type) {
+    case CatalogEntryType::NODE_TABLE_ENTRY:
+        result = NodeTableCatalogEntry::deserialize(deserializer);
+        break;
+    case CatalogEntryType::REL_GROUP_ENTRY:
+        result = RelGroupCatalogEntry::deserialize(deserializer);
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+    result->comment = std::move(comment);
+    result->propertyCollection = std::move(propertyCollection);
+    return result;
+}
+
+void TableCatalogEntry::copyFrom(const CatalogEntry& other) {
+    CatalogEntry::copyFrom(other);
+    auto& otherTable = ku_dynamic_cast<const TableCatalogEntry&>(other);
+    comment = otherTable.comment;
+    propertyCollection = otherTable.propertyCollection.copy();
+}
+
+BoundCreateTableInfo TableCatalogEntry::getBoundCreateTableInfo(
+    transaction::Transaction* transaction, bool isInternal) const {
+    auto extraInfo = getBoundExtraCreateInfo(transaction);
+    return BoundCreateTableInfo(type, name, ConflictAction::ON_CONFLICT_THROW, std::move(extraInfo),
+        isInternal, hasParent_);
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/type_catalog_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/type_catalog_entry.cpp
new file mode 100644
index 0000000000..215cda26e9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_entry/type_catalog_entry.cpp
@@ -0,0 +1,24 @@
+#include "catalog/catalog_entry/type_catalog_entry.h"
+
+#include "common/serializer/deserializer.h"
+
+namespace lbug {
+namespace catalog {
+
+void TypeCatalogEntry::serialize(common::Serializer& serializer) const {
+    CatalogEntry::serialize(serializer);
+    serializer.writeDebuggingInfo("type");
+    type.serialize(serializer);
+}
+
+std::unique_ptr<TypeCatalogEntry> TypeCatalogEntry::deserialize(
+    common::Deserializer& deserializer) {
+    std::string debuggingInfo;
+    auto typeCatalogEntry = std::make_unique<TypeCatalogEntry>();
+    deserializer.validateDebuggingInfo(debuggingInfo, "type");
+    typeCatalogEntry->type = common::LogicalType::deserialize(deserializer);
+    return typeCatalogEntry;
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_set.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_set.cpp
new file mode 100644
index 0000000000..051cf65daf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/catalog_set.cpp
@@ -0,0 +1,302 @@
+#include "catalog/catalog_set.h"
+
+#include <mutex>
+
+#include "binder/ddl/bound_alter_info.h"
+#include "catalog/catalog_entry/dummy_catalog_entry.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/assert.h"
+#include "common/exception/catalog.h"
+#include "common/serializer/deserializer.h"
+#include "common/string_format.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace catalog {
+
+CatalogSet::CatalogSet(bool isInternal) {
+    if (isInternal) {
+        nextOID = INTERNAL_CATALOG_SET_START_OID;
+    }
+}
+
+static bool checkWWConflict(const Transaction* transaction, const CatalogEntry* entry) {
+    return (entry->getTimestamp() >= Transaction::START_TRANSACTION_ID &&
+               entry->getTimestamp() != transaction->getID()) ||
+           (entry->getTimestamp() < Transaction::START_TRANSACTION_ID &&
+               entry->getTimestamp() > transaction->getStartTS());
+}
+
+bool CatalogSet::containsEntry(const Transaction* transaction, const std::string& name) {
+    std::shared_lock lck{mtx};
+    return containsEntryNoLock(transaction, name);
+}
+
+bool CatalogSet::containsEntryNoLock(const Transaction* transaction,
+    const std::string& name) const {
+    if (!entries.contains(name)) {
+        return false;
+    }
+    // Check versions.
+    const auto entry =
+        traverseVersionChainsForTransactionNoLock(transaction, entries.at(name).get());
+    return !entry->isDeleted();
+}
+
+CatalogEntry* CatalogSet::getEntry(const Transaction* transaction, const std::string& name) {
+    std::shared_lock lck{mtx};
+    return getEntryNoLock(transaction, name);
+}
+
+CatalogEntry* CatalogSet::getEntryNoLock(const Transaction* transaction,
+    const std::string& name) const {
+    // LCOV_EXCL_START
+    validateExistNoLock(transaction, name);
+    // LCOV_EXCL_STOP
+    const auto entry =
+        traverseVersionChainsForTransactionNoLock(transaction, entries.at(name).get());
+    KU_ASSERT(entry != nullptr && !entry->isDeleted());
+    return entry;
+}
+
+oid_t CatalogSet::createEntry(Transaction* transaction, std::unique_ptr<CatalogEntry> entry) {
+    CatalogEntry* entryPtr = nullptr;
+    oid_t oid = INVALID_OID;
+    {
+        std::unique_lock lck{mtx};
+        oid = nextOID++;
+        entry->setOID(oid);
+        entryPtr = createEntryNoLock(transaction, std::move(entry));
+    }
+    KU_ASSERT(entryPtr);
+    if (transaction->shouldAppendToUndoBuffer()) {
+        transaction->pushCreateDropCatalogEntry(*this, *entryPtr, isInternal());
+    }
+    return oid;
+}
+
+CatalogEntry* CatalogSet::createEntryNoLock(const Transaction* transaction,
+    std::unique_ptr<CatalogEntry> entry) {
+    // LCOV_EXCL_START
+    validateNotExistNoLock(transaction, entry->getName());
+    // LCOV_EXCL_STOP
+    entry->setTimestamp(transaction->getID());
+    if (entries.contains(entry->getName())) {
+        const auto existingEntry = entries.at(entry->getName()).get();
+        if (checkWWConflict(transaction, existingEntry)) {
+            throw CatalogException(stringFormat(
+                "Write-write conflict on creating catalog entry with name {}.", entry->getName()));
+        }
+        if (!existingEntry->isDeleted()) {
+            throw CatalogException(
+                stringFormat("Catalog entry with name {} already exists.", entry->getName()));
+        }
+    }
+    auto dummyEntry = createDummyEntryNoLock(entry->getName(), entry->getOID());
+    entries.emplace(entry->getName(), std::move(dummyEntry));
+    const auto entryPtr = entry.get();
+    emplaceNoLock(std::move(entry));
+    return entryPtr->getPrev();
+}
+
+void CatalogSet::emplaceNoLock(std::unique_ptr<CatalogEntry> entry) {
+    if (entries.contains(entry->getName())) {
+        entry->setPrev(std::move(entries.at(entry->getName())));
+        entries.erase(entry->getName());
+    }
+    entries.emplace(entry->getName(), std::move(entry));
+}
+
+void CatalogSet::eraseNoLock(const std::string& name) {
+    entries.erase(name);
+}
+
+std::unique_ptr<CatalogEntry> CatalogSet::createDummyEntryNoLock(std::string name, oid_t oid) {
+    return std::make_unique<DummyCatalogEntry>(std::move(name), oid);
+}
+
+CatalogEntry* CatalogSet::traverseVersionChainsForTransactionNoLock(const Transaction* transaction,
+    CatalogEntry* currentEntry) {
+    while (currentEntry) {
+        if (currentEntry->getTimestamp() == transaction->getID()) {
+            // This entry is created by the current transaction.
+            break;
+        }
+        if (currentEntry->getTimestamp() <= transaction->getStartTS()) {
+            // This entry was committed before the current transaction starts.
+            break;
+        }
+        currentEntry = currentEntry->getPrev();
+    }
+    return currentEntry;
+}
+
+CatalogEntry* CatalogSet::getCommittedEntryNoLock(CatalogEntry* entry) {
+    while (entry) {
+        if (entry->getTimestamp() < Transaction::START_TRANSACTION_ID) {
+            break;
+        }
+        entry = entry->getPrev();
+    }
+    return entry;
+}
+
+void CatalogSet::dropEntry(Transaction* transaction, const std::string& name, oid_t oid) {
+    CatalogEntry* entryPtr = nullptr;
+    {
+        std::unique_lock lck{mtx};
+        entryPtr = dropEntryNoLock(transaction, name, oid);
+    }
+    KU_ASSERT(entryPtr);
+    if (transaction->shouldAppendToUndoBuffer()) {
+        transaction->pushCreateDropCatalogEntry(*this, *entryPtr, isInternal());
+    }
+}
+
+CatalogEntry* CatalogSet::dropEntryNoLock(const Transaction* transaction, const std::string& name,
+    oid_t oid) {
+    // LCOV_EXCL_START
+    validateExistNoLock(transaction, name);
+    // LCOV_EXCL_STOP
+    auto tombstone = createDummyEntryNoLock(name, oid);
+    tombstone->setTimestamp(transaction->getID());
+    const auto tombstonePtr = tombstone.get();
+    emplaceNoLock(std::move(tombstone));
+    return tombstonePtr->getPrev();
+}
+
+void CatalogSet::alterTableEntry(Transaction* transaction,
+    const binder::BoundAlterInfo& alterInfo) {
+    std::unique_lock lck{mtx};
+    // LCOV_EXCL_START
+    validateExistNoLock(transaction, alterInfo.tableName);
+    // LCOV_EXCL_STOP
+    auto entry = getEntryNoLock(transaction, alterInfo.tableName);
+    KU_ASSERT(entry->getType() == CatalogEntryType::NODE_TABLE_ENTRY ||
+              entry->getType() == CatalogEntryType::REL_GROUP_ENTRY);
+    const auto tableEntry = entry->ptrCast<TableCatalogEntry>();
+    auto newEntry = tableEntry->alter(transaction->getID(), alterInfo, this);
+    switch (alterInfo.alterType) {
+    case AlterType::RENAME: {
+        // We treat rename table as drop and create.
+        dropEntryNoLock(transaction, alterInfo.tableName, entry->getOID());
+        auto createdEntry = createEntryNoLock(transaction, std::move(newEntry));
+        if (transaction->shouldAppendToUndoBuffer()) {
+            transaction->pushAlterCatalogEntry(*this, *entry, alterInfo);
+            transaction->pushCreateDropCatalogEntry(*this, *createdEntry, isInternal(),
+                true /* skipLoggingToWAL */);
+        }
+    } break;
+    case AlterType::COMMENT:
+    case AlterType::ADD_PROPERTY:
+    case AlterType::DROP_PROPERTY:
+    case AlterType::RENAME_PROPERTY:
+    case AlterType::ADD_FROM_TO_CONNECTION:
+    case AlterType::DROP_FROM_TO_CONNECTION: {
+        emplaceNoLock(std::move(newEntry));
+        if (transaction->shouldAppendToUndoBuffer()) {
+            transaction->pushAlterCatalogEntry(*this, *entry, alterInfo);
+        }
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+CatalogEntrySet CatalogSet::getEntries(const Transaction* transaction) {
+    CatalogEntrySet result;
+    std::shared_lock lck{mtx};
+    for (auto& [name, entry] : entries) {
+        auto currentEntry = traverseVersionChainsForTransactionNoLock(transaction, entry.get());
+        if (currentEntry->isDeleted()) {
+            continue;
+        }
+        result.emplace(name, currentEntry);
+    }
+    return result;
+}
+
+CatalogEntry* CatalogSet::getEntryOfOID(const Transaction* transaction, oid_t oid) {
+    std::shared_lock lck{mtx};
+    for (auto& [_, entry] : entries) {
+        if (entry->getOID() != oid) {
+            continue;
+        }
+        const auto currentEntry =
+            traverseVersionChainsForTransactionNoLock(transaction, entry.get());
+        if (currentEntry->isDeleted()) {
+            continue;
+        }
+        return currentEntry;
+    }
+    return nullptr;
+}
+
+void CatalogSet::serialize(Serializer serializer) const {
+    std::vector<CatalogEntry*> entriesToSerialize;
+    for (auto& [_, entry] : entries) {
+        switch (entry->getType()) {
+        case CatalogEntryType::SCALAR_FUNCTION_ENTRY:
+        case CatalogEntryType::REWRITE_FUNCTION_ENTRY:
+        case CatalogEntryType::AGGREGATE_FUNCTION_ENTRY:
+        case CatalogEntryType::COPY_FUNCTION_ENTRY:
+        case CatalogEntryType::TABLE_FUNCTION_ENTRY:
+        case CatalogEntryType::STANDALONE_TABLE_FUNCTION_ENTRY:
+            continue;
+        default: {
+            auto committedEntry = getCommittedEntryNoLock(entry.get());
+            if (committedEntry && !committedEntry->isDeleted()) {
+                entriesToSerialize.push_back(committedEntry);
+            }
+        }
+        }
+    }
+    serializer.writeDebuggingInfo("nextOID");
+    serializer.serializeValue<oid_t>(nextOID);
+    serializer.writeDebuggingInfo("numEntries");
+    const uint64_t numEntriesToSerialize = entriesToSerialize.size();
+    serializer.serializeValue<uint64_t>(numEntriesToSerialize);
+    for (const auto entry : entriesToSerialize) {
+        entry->serialize(serializer);
+    }
+}
+
+std::unique_ptr<CatalogSet> CatalogSet::deserialize(Deserializer& deserializer) {
+    std::string debuggingInfo;
+    auto catalogSet = std::make_unique<CatalogSet>();
+    deserializer.validateDebuggingInfo(debuggingInfo, "nextOID");
+    deserializer.deserializeValue<oid_t>(catalogSet->nextOID);
+    uint64_t numEntries = 0;
+    deserializer.validateDebuggingInfo(debuggingInfo, "numEntries");
+    deserializer.deserializeValue<uint64_t>(numEntries);
+    for (uint64_t i = 0; i < numEntries; i++) {
+        auto entry = CatalogEntry::deserialize(deserializer);
+        if (entry != nullptr) {
+            catalogSet->emplaceNoLock(std::move(entry));
+        }
+    }
+    return catalogSet;
+}
+
+// Ideally we should not trigger the following check. Instead, we should throw more informative
+// error message at catalog level.
+void CatalogSet::validateExistNoLock(const Transaction* transaction,
+    const std::string& name) const {
+    if (!containsEntryNoLock(transaction, name)) {
+        throw CatalogException(stringFormat("{} does not exist in catalog.", name));
+    }
+}
+
+void CatalogSet::validateNotExistNoLock(const Transaction* transaction,
+    const std::string& name) const {
+    if (containsEntryNoLock(transaction, name)) {
+        throw CatalogException(stringFormat("{} already exists in catalog.", name));
+    }
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/property_definition_collection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/property_definition_collection.cpp
new file mode 100644
index 0000000000..fcf0ddbb66
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/catalog/property_definition_collection.cpp
@@ -0,0 +1,147 @@
+#include "catalog/property_definition_collection.h"
+
+#include <map>
+#include <sstream>
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/string_utils.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace catalog {
+
+std::vector<binder::PropertyDefinition> PropertyDefinitionCollection::getDefinitions() const {
+    std::vector<binder::PropertyDefinition> propertyDefinitions;
+    for (auto i = 0u; i < nextPropertyID; i++) {
+        if (definitions.contains(i)) {
+            propertyDefinitions.push_back(definitions.at(i).copy());
+        }
+    }
+    return propertyDefinitions;
+}
+
+const PropertyDefinition& PropertyDefinitionCollection::getDefinition(
+    const std::string& name) const {
+    return getDefinition(getPropertyID(name));
+}
+
+const PropertyDefinition& PropertyDefinitionCollection::getDefinition(
+    property_id_t propertyID) const {
+    KU_ASSERT(definitions.contains(propertyID));
+    return definitions.at(propertyID);
+}
+
+column_id_t PropertyDefinitionCollection::getColumnID(const std::string& name) const {
+    return getColumnID(getPropertyID(name));
+}
+
+column_id_t PropertyDefinitionCollection::getColumnID(property_id_t propertyID) const {
+    KU_ASSERT(columnIDs.contains(propertyID));
+    return columnIDs.at(propertyID);
+}
+
+void PropertyDefinitionCollection::vacuumColumnIDs(column_id_t nextColumnID) {
+    this->nextColumnID = nextColumnID;
+    columnIDs.clear();
+    for (auto& [propertyID, definition] : definitions) {
+        columnIDs.emplace(propertyID, this->nextColumnID++);
+    }
+}
+
+void PropertyDefinitionCollection::add(const PropertyDefinition& definition) {
+    auto propertyID = nextPropertyID++;
+    columnIDs.emplace(propertyID, nextColumnID++);
+    definitions.emplace(propertyID, definition.copy());
+    nameToPropertyIDMap.emplace(definition.getName(), propertyID);
+}
+
+void PropertyDefinitionCollection::drop(const std::string& name) {
+    KU_ASSERT(contains(name));
+    auto propertyID = nameToPropertyIDMap.at(name);
+    definitions.erase(propertyID);
+    columnIDs.erase(propertyID);
+    nameToPropertyIDMap.erase(name);
+}
+
+void PropertyDefinitionCollection::rename(const std::string& name, const std::string& newName) {
+    KU_ASSERT(contains(name));
+    auto idx = nameToPropertyIDMap.at(name);
+    definitions[idx].rename(newName);
+    nameToPropertyIDMap.erase(name);
+    nameToPropertyIDMap.insert({newName, idx});
+}
+
+column_id_t PropertyDefinitionCollection::getMaxColumnID() const {
+    column_id_t maxID = 0;
+    for (auto [_, id] : columnIDs) {
+        if (id > maxID) {
+            maxID = id;
+        }
+    }
+    return maxID;
+}
+
+property_id_t PropertyDefinitionCollection::getPropertyID(const std::string& name) const {
+    KU_ASSERT(contains(name));
+    return nameToPropertyIDMap.at(name);
+}
+
+std::string PropertyDefinitionCollection::toCypher() const {
+    std::stringstream ss;
+    for (auto& [_, def] : definitions) {
+        auto& dataType = def.getType();
+        // Avoid exporting internal ID
+        if (dataType.getPhysicalType() == PhysicalTypeID::INTERNAL_ID) {
+            continue;
+        }
+        auto typeStr = dataType.toString();
+        StringUtils::replaceAll(typeStr, ":", " ");
+        if (typeStr.find("MAP") != std::string::npos) {
+            StringUtils::replaceAll(typeStr, "  ", ",");
+        }
+        ss << "`" << def.getName() << "`" << " " << typeStr << ",";
+    }
+    return ss.str();
+}
+
+void PropertyDefinitionCollection::serialize(Serializer& serializer) const {
+    serializer.writeDebuggingInfo("nextColumnID");
+    serializer.serializeValue(nextColumnID);
+    serializer.writeDebuggingInfo("nextPropertyID");
+    serializer.serializeValue(nextPropertyID);
+    serializer.writeDebuggingInfo("definitions");
+    serializer.serializeMap(definitions);
+    serializer.writeDebuggingInfo("columnIDs");
+    serializer.serializeUnorderedMap(columnIDs);
+}
+
+PropertyDefinitionCollection PropertyDefinitionCollection::deserialize(Deserializer& deserializer) {
+    std::string debuggingInfo;
+    column_id_t nextColumnID = 0;
+    deserializer.validateDebuggingInfo(debuggingInfo, "nextColumnID");
+    deserializer.deserializeValue(nextColumnID);
+    property_id_t nextPropertyID = 0;
+    deserializer.validateDebuggingInfo(debuggingInfo, "nextPropertyID");
+    deserializer.deserializeValue(nextPropertyID);
+    std::map<property_id_t, PropertyDefinition> definitions;
+    deserializer.validateDebuggingInfo(debuggingInfo, "definitions");
+    deserializer.deserializeMap(definitions);
+    std::unordered_map<property_id_t, column_id_t> columnIDs;
+    deserializer.validateDebuggingInfo(debuggingInfo, "columnIDs");
+    deserializer.deserializeUnorderedMap(columnIDs);
+    auto collection = PropertyDefinitionCollection();
+    for (auto& [propertyID, definition] : definitions) {
+        collection.nameToPropertyIDMap.insert({definition.getName(), propertyID});
+    }
+    collection.nextColumnID = nextColumnID;
+    collection.nextPropertyID = nextPropertyID;
+    collection.definitions = std::move(definitions);
+    collection.columnIDs = std::move(columnIDs);
+    return collection;
+}
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/CMakeLists.txt
new file mode 100644
index 0000000000..a9e1c5d3bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/CMakeLists.txt
@@ -0,0 +1,37 @@
+add_subdirectory(arrow)
+add_subdirectory(copier_config)
+add_subdirectory(data_chunk)
+add_subdirectory(enums)
+add_subdirectory(exception)
+add_subdirectory(serializer)
+add_subdirectory(signal)
+add_subdirectory(task_system)
+add_subdirectory(types)
+add_subdirectory(vector)
+add_subdirectory(file_system)
+
+add_library(lbug_common
+        OBJECT
+        case_insensitive_map.cpp
+        checksum.cpp
+        constants.cpp
+        database_lifecycle_manager.cpp
+        expression_type.cpp
+        in_mem_overflow_buffer.cpp
+        mask.cpp
+        md5.cpp
+        metric.cpp
+        null_mask.cpp
+        profiler.cpp
+        random_engine.cpp
+        roaring_mask.cpp
+        sha256.cpp
+        string_utils.cpp
+        system_message.cpp
+        type_utils.cpp
+        utils.cpp
+        windows_utils.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/CMakeLists.txt
new file mode 100644
index 0000000000..e9659d26a4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/CMakeLists.txt
@@ -0,0 +1,11 @@
+add_library(lbug_common_arrow
+        OBJECT
+        arrow_array_scan.cpp
+        arrow_converter.cpp
+        arrow_null_mask_tree.cpp
+        arrow_row_batch.cpp
+        arrow_type.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_arrow>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_array_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_array_scan.cpp
new file mode 100644
index 0000000000..ae23c27074
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_array_scan.cpp
@@ -0,0 +1,599 @@
+#include "common/arrow/arrow_converter.h"
+#include "common/exception/runtime.h"
+#include "common/types/int128_t.h"
+#include "common/types/interval_t.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace common {
+
+// scans are based on data specification found here
+// https://arrow.apache.org/docs/format/Columnar.html
+
+// all offsets are measured by value, not physical size
+
+template<typename T>
+static void scanArrowArrayFixedSizePrimitive(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
+    auto arrayBuffer = (const uint8_t*)array->buffers[1];
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    memcpy(outputVector.getData() + dstOffset * outputVector.getNumBytesPerValue(),
+        arrayBuffer + srcOffset * sizeof(T), count * sizeof(T));
+}
+
+template<typename SRC, typename DST>
+static void scanArrowArrayFixedSizePrimitiveAndCastTo(const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    auto arrayBuffer = (const SRC*)array->buffers[1];
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            auto curValue = arrayBuffer[i + srcOffset];
+            outputVector.setValue<DST>(i + dstOffset, (DST)curValue);
+        }
+    }
+}
+
+template<>
+void scanArrowArrayFixedSizePrimitive<bool>(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
+    auto arrayBuffer = (const uint8_t*)array->buffers[1];
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        outputVector.setValue<bool>(i + dstOffset,
+            NullMask::isNull((const uint64_t*)arrayBuffer, i + srcOffset));
+    }
+}
+
+static void scanArrowArrayDurationScaledUp(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, int64_t scaleFactor, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    auto arrayBuffer = ((const int64_t*)array->buffers[1]) + srcOffset;
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            auto curValue = arrayBuffer[i];
+            outputVector.setValue<interval_t>(i + dstOffset,
+                interval_t(0, 0, curValue * scaleFactor));
+        }
+    }
+}
+
+static void scanArrowArrayDurationScaledDown(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, int64_t scaleFactor, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    auto arrayBuffer = ((const int64_t*)array->buffers[1]) + srcOffset;
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            auto curValue = arrayBuffer[i];
+            outputVector.setValue<interval_t>(i + dstOffset,
+                interval_t(0, 0, curValue / scaleFactor));
+        }
+    }
+}
+
+static void scanArrowArrayMonthInterval(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
+    auto arrayBuffer = ((const int32_t*)array->buffers[1]) + srcOffset;
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            auto curValue = arrayBuffer[i];
+            outputVector.setValue<interval_t>(i + dstOffset, interval_t(curValue, 0, 0));
+        }
+    }
+}
+
+static void scanArrowArrayDayTimeInterval(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
+    auto arrayBuffer = ((const int64_t*)array->buffers[1]) + srcOffset;
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            int64_t curValue = arrayBuffer[i];
+            int32_t day = curValue;
+            int64_t micros = (curValue >> (4 * sizeof(int64_t))) * 1000;
+            // arrow stores ms, while we store us
+            outputVector.setValue<interval_t>(i + dstOffset, interval_t(0, day, micros));
+        }
+    }
+}
+
+static void scanArrowArrayMonthDayNanoInterval(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
+    auto arrayBuffer =
+        (const int64_t*)((const uint8_t*)array->buffers[1] + srcOffset * 16); // 16 bits per value
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            int64_t curValue = arrayBuffer[2 * i];
+            int32_t month = curValue;
+            int32_t day = curValue >> (4 * sizeof(int64_t));
+            int64_t micros = arrayBuffer[2 * i + 1] / 1000;
+            outputVector.setValue<interval_t>(i + dstOffset, interval_t(month, day, micros));
+        }
+    }
+}
+
+template<typename offsetsT>
+static void scanArrowArrayBLOB(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
+    auto offsets = ((const offsetsT*)array->buffers[1]) + srcOffset;
+    auto arrayBuffer = (const uint8_t*)array->buffers[2];
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            auto curOffset = offsets[i], nextOffset = offsets[i + 1];
+            const uint8_t* data = arrayBuffer + curOffset;
+            auto length = nextOffset - curOffset;
+            BlobVector::addBlob(&outputVector, i + dstOffset, data, length);
+        }
+    }
+}
+
+static void scanArrowArrayBLOBView(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
+    auto arrayBuffer = (const uint8_t*)(array->buffers[1]);
+    auto valueBuffs = (const uint8_t**)(array->buffers + 2);
+    // BLOB value buffers begin from index 2 onwards
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            auto curView = (const int32_t*)(arrayBuffer + (i + srcOffset) * 16);
+            // view structures are 16 bytes long
+            auto viewLength = curView[0];
+            if (viewLength <= 12) {
+                BlobVector::addBlob(&outputVector, i + dstOffset, (uint8_t*)(curView + 1),
+                    viewLength);
+            } else {
+                auto bufIndex = curView[2];
+                auto offset = curView[3];
+                BlobVector::addBlob(&outputVector, i + dstOffset, valueBuffs[bufIndex] + offset,
+                    viewLength);
+            }
+        }
+    }
+}
+
+static void scanArrowArrayFixedBLOB(const ArrowArray* array, ValueVector& outputVector,
+    ArrowNullMaskTree* mask, int64_t BLOBsize, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    auto arrayBuffer = ((const uint8_t*)array->buffers[1]) + srcOffset * BLOBsize;
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            BlobVector::addBlob(&outputVector, i + dstOffset, arrayBuffer + i * BLOBsize, BLOBsize);
+        }
+    }
+}
+
+template<typename offsetsT>
+static void scanArrowArrayList(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    auto offsets = ((const offsetsT*)array->buffers[1]) + srcOffset;
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    uint64_t auxDstPosition = 0;
+    for (uint64_t i = 0; i < count; i++) {
+        auto curOffset = offsets[i], nextOffset = offsets[i + 1];
+        // don't check for validity, since we still need to update the offsets
+        auto newEntry = ListVector::addList(&outputVector, nextOffset - curOffset);
+        outputVector.setValue<list_entry_t>(i + dstOffset, newEntry);
+        if (i == 0) {
+            auxDstPosition = newEntry.offset;
+        }
+    }
+    ValueVector* auxiliaryBuffer = ListVector::getDataVector(&outputVector);
+    ArrowConverter::fromArrowArray(schema->children[0], array->children[0], *auxiliaryBuffer,
+        mask->getChild(0), offsets[0] + array->children[0]->offset, auxDstPosition,
+        offsets[count] - offsets[0]);
+}
+
+template<typename offsetsT>
+static void scanArrowArrayListView(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    auto offsets = ((const offsetsT*)array->buffers[1]) + srcOffset;
+    auto sizes = ((const offsetsT*)array->buffers[2]) + srcOffset;
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    ValueVector* auxiliaryBuffer = ListVector::getDataVector(&outputVector);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            auto curOffset = offsets[i], size = sizes[i];
+            auto newEntry = ListVector::addList(&outputVector, size);
+            outputVector.setValue<list_entry_t>(i + dstOffset, newEntry);
+            ArrowNullMaskTree childTree(schema->children[0], array->children[0], srcOffset, count);
+            // make our own child here. precomputing through the mask tree is too complicated
+            ArrowConverter::fromArrowArray(schema->children[0], array->children[0],
+                *auxiliaryBuffer, &childTree, curOffset, newEntry.offset, newEntry.size);
+        }
+    }
+}
+
+static void scanArrowArrayFixedList(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    auto numElements = ArrayType::getNumElements(outputVector.dataType);
+    for (auto i = 0u; i < count; ++i) {
+        auto newEntry = ListVector::addList(&outputVector, numElements);
+        outputVector.setValue<list_entry_t>(i + dstOffset, newEntry);
+    }
+    auto auxiliaryBuffer = ListVector::getDataVector(&outputVector);
+    ArrowConverter::fromArrowArray(schema->children[0], array->children[0], *auxiliaryBuffer,
+        mask->getChild(0), srcOffset * numElements + array->children[0]->offset,
+        dstOffset * numElements, count * numElements);
+}
+
+static void scanArrowArrayStruct(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            outputVector.setValue<int64_t>(i + dstOffset,
+                i + dstOffset); // struct_entry_t doesn't work for some reason
+        }
+    }
+    for (int64_t j = 0; j < schema->n_children; j++) {
+        ArrowConverter::fromArrowArray(schema->children[j], array->children[j],
+            *StructVector::getFieldVector(&outputVector, j).get(), mask->getChild(j),
+            srcOffset + array->children[j]->offset, dstOffset, count);
+    }
+}
+
+static void scanArrowArrayDenseUnion(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    auto types = ((const uint8_t*)array->buffers[0]) + srcOffset;
+    auto dstTypes = (uint16_t*)UnionVector::getTagVector(&outputVector)->getData();
+    auto offsets = ((const int32_t*)array->buffers[1]) + srcOffset;
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    std::vector<int32_t> firstIncident(array->n_children, INT32_MAX);
+    for (auto i = 0u; i < count; i++) {
+        auto curType = types[i];
+        auto curOffset = offsets[i];
+        if (curOffset < firstIncident[curType]) {
+            firstIncident[curType] = curOffset;
+        }
+        if (!mask->isNull(i)) {
+            dstTypes[i] = curType;
+            auto childOffset =
+                mask->getChild(curType)->offsetBy(curOffset - firstIncident[curType]);
+            ArrowConverter::fromArrowArray(schema->children[curType], array->children[curType],
+                *UnionVector::getValVector(&outputVector, curType), &childOffset,
+                curOffset + array->children[curType]->offset, i + dstOffset, 1);
+            // may be inefficient, since we're only scanning a single value
+        }
+    }
+}
+
+static void scanArrowArraySparseUnion(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    auto types = ((const uint8_t*)array->buffers[0]) + srcOffset;
+    auto dstTypes = (uint16_t*)UnionVector::getTagVector(&outputVector)->getData();
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            dstTypes[i] = types[i];
+        }
+    }
+    // it is specified that values that aren't selected in the type buffer
+    // must also be semantically correct. this is why this scanning works.
+    // however, there is possibly room for optimization here.
+    // eg. nulling out unselected children
+    for (int8_t i = 0; i < array->n_children; i++) {
+        ArrowConverter::fromArrowArray(schema->children[i], array->children[i],
+            *UnionVector::getValVector(&outputVector, i), mask->getChild(i),
+            srcOffset + array->children[i]->offset, dstOffset, count);
+    }
+}
+
+template<typename offsetsT>
+static void scanArrowArrayDictionaryEncoded(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+
+    auto values = ((const offsetsT*)array->buffers[1]) + srcOffset;
+    mask->copyToValueVector(&outputVector, dstOffset, count);
+    for (uint64_t i = 0; i < count; i++) {
+        if (!mask->isNull(i)) {
+            auto dictOffseted = mask->getDictionary()->offsetBy(values[i]);
+            ArrowConverter::fromArrowArray(schema->dictionary, array->dictionary, outputVector,
+                &dictOffseted, values[i] + array->dictionary->offset, i + dstOffset,
+                1); // possibly inefficient?
+        }
+    }
+}
+
+static void scanArrowArrayRunEndEncoded(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+
+    const ArrowArray* runEndArray = array->children[0];
+    auto runEndBuffer = (const uint32_t*)runEndArray->buffers[1];
+
+    // binary search run end corresponding to srcOffset
+    auto runEndIdx = runEndArray->offset;
+    {
+        auto L = runEndArray->offset, H = L + runEndArray->length;
+        while (H >= L) {
+            auto M = (H + L) >> 1;
+            if (runEndBuffer[M] < srcOffset) {
+                runEndIdx = M;
+                H = M - 1;
+            } else {
+                L = M + 1;
+            }
+        }
+    }
+
+    for (uint64_t i = 0; i < count; i++) {
+        while (i + srcOffset >= runEndBuffer[runEndIdx + 1]) {
+            runEndIdx++;
+        }
+        auto valuesOffseted = mask->getChild(1)->offsetBy(runEndIdx);
+        ArrowConverter::fromArrowArray(schema->children[1], array->children[1], outputVector,
+            &valuesOffseted, runEndIdx, i + dstOffset,
+            1); // there is optimization to be made here...
+    }
+}
+
+void ArrowConverter::fromArrowArray(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+    uint64_t count) {
+    const auto arrowType = schema->format;
+    if (array->dictionary != nullptr) {
+        switch (arrowType[0]) {
+        case 'c':
+            return scanArrowArrayDictionaryEncoded<int8_t>(schema, array, outputVector, mask,
+                srcOffset, dstOffset, count);
+        case 'C':
+            return scanArrowArrayDictionaryEncoded<uint8_t>(schema, array, outputVector, mask,
+                srcOffset, dstOffset, count);
+        case 's':
+            return scanArrowArrayDictionaryEncoded<int16_t>(schema, array, outputVector, mask,
+                srcOffset, dstOffset, count);
+        case 'S':
+            return scanArrowArrayDictionaryEncoded<uint16_t>(schema, array, outputVector, mask,
+                srcOffset, dstOffset, count);
+        case 'i':
+            return scanArrowArrayDictionaryEncoded<int32_t>(schema, array, outputVector, mask,
+                srcOffset, dstOffset, count);
+        case 'I':
+            return scanArrowArrayDictionaryEncoded<uint32_t>(schema, array, outputVector, mask,
+                srcOffset, dstOffset, count);
+        case 'l':
+            return scanArrowArrayDictionaryEncoded<int64_t>(schema, array, outputVector, mask,
+                srcOffset, dstOffset, count);
+        case 'L':
+            return scanArrowArrayDictionaryEncoded<uint64_t>(schema, array, outputVector, mask,
+                srcOffset, dstOffset, count);
+        default:
+            throw RuntimeException("Invalid Index Type: " + std::string(arrowType));
+        }
+    }
+    switch (arrowType[0]) {
+    case 'n':
+        // NULL
+        outputVector.setAllNull();
+        return;
+    case 'b':
+        // BOOL
+        return scanArrowArrayFixedSizePrimitive<bool>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'c':
+        // INT8
+        return scanArrowArrayFixedSizePrimitive<int8_t>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'C':
+        // UINT8
+        return scanArrowArrayFixedSizePrimitive<uint8_t>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 's':
+        // INT16
+        return scanArrowArrayFixedSizePrimitive<int16_t>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'S':
+        // UINT16
+        return scanArrowArrayFixedSizePrimitive<uint16_t>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'i':
+        // INT32
+        return scanArrowArrayFixedSizePrimitive<int32_t>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'I':
+        // UINT32
+        return scanArrowArrayFixedSizePrimitive<uint32_t>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'l':
+        // INT64
+        return scanArrowArrayFixedSizePrimitive<int64_t>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'L':
+        // UINT64
+        return scanArrowArrayFixedSizePrimitive<uint64_t>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'f':
+        // FLOAT
+        return scanArrowArrayFixedSizePrimitive<float>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'g':
+        // DOUBLE
+        return scanArrowArrayFixedSizePrimitive<double>(array, outputVector, mask, srcOffset,
+            dstOffset, count);
+    case 'z':
+        // BLOB
+        return scanArrowArrayBLOB<int32_t>(array, outputVector, mask, srcOffset, dstOffset, count);
+    case 'Z':
+        // LONG BLOB
+        return scanArrowArrayBLOB<int64_t>(array, outputVector, mask, srcOffset, dstOffset, count);
+    case 'u':
+        // STRING
+        return scanArrowArrayBLOB<int32_t>(array, outputVector, mask, srcOffset, dstOffset, count);
+    case 'U':
+        // LONG STRING
+        return scanArrowArrayBLOB<int64_t>(array, outputVector, mask, srcOffset, dstOffset, count);
+    case 'v':
+        switch (arrowType[1]) {
+        case 'z':
+            // BINARY VIEW
+        case 'u':
+            // STRING VIEW
+            return scanArrowArrayBLOBView(array, outputVector, mask, srcOffset, dstOffset, count);
+        default:
+            KU_UNREACHABLE;
+        }
+    case 'd': {
+        switch (outputVector.dataType.getPhysicalType()) {
+        case PhysicalTypeID::INT16:
+            return scanArrowArrayFixedSizePrimitiveAndCastTo<int128_t, int16_t>(array, outputVector,
+                mask, srcOffset, dstOffset, count);
+        case PhysicalTypeID::INT32:
+            return scanArrowArrayFixedSizePrimitiveAndCastTo<int128_t, int32_t>(array, outputVector,
+                mask, srcOffset, dstOffset, count);
+        case PhysicalTypeID::INT64:
+            return scanArrowArrayFixedSizePrimitiveAndCastTo<int128_t, int64_t>(array, outputVector,
+                mask, srcOffset, dstOffset, count);
+        case PhysicalTypeID::INT128:
+            return scanArrowArrayFixedSizePrimitive<int128_t>(array, outputVector, mask, srcOffset,
+                dstOffset, count);
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    case 'w':
+        // FIXED BLOB
+        return scanArrowArrayFixedBLOB(array, outputVector, mask, std::stoi(arrowType + 2),
+            srcOffset, dstOffset, count);
+    case 't':
+        switch (arrowType[1]) {
+        case 'd':
+            // DATE
+            if (arrowType[2] == 'D') {
+                // days since unix epoch
+                return scanArrowArrayFixedSizePrimitive<int32_t>(array, outputVector, mask,
+                    srcOffset, dstOffset, count);
+            } else {
+                // ms since unix epoch
+                return scanArrowArrayFixedSizePrimitive<int64_t>(array, outputVector, mask,
+                    srcOffset, dstOffset, count);
+            }
+        case 't':
+            // TODO pure time type
+            KU_UNREACHABLE;
+        case 's':
+            // TIMESTAMP
+            return scanArrowArrayFixedSizePrimitive<int64_t>(array, outputVector, mask, srcOffset,
+                dstOffset, count);
+        case 'D':
+            // DURATION (LBUG INTERVAL)
+            switch (arrowType[2]) {
+            case 's':
+                // consider implement overflow checking here?
+                return scanArrowArrayDurationScaledUp(array, outputVector, mask, 1000000, srcOffset,
+                    dstOffset, count);
+            case 'm':
+                return scanArrowArrayDurationScaledUp(array, outputVector, mask, 1000, srcOffset,
+                    dstOffset, count);
+            case 'u':
+                return scanArrowArrayDurationScaledUp(array, outputVector, mask, 1, srcOffset,
+                    dstOffset, count);
+            case 'n':
+                return scanArrowArrayDurationScaledDown(array, outputVector, mask, 1000, srcOffset,
+                    dstOffset, count);
+            default:
+                KU_UNREACHABLE;
+            }
+        case 'i':
+            // INTERVAL
+            switch (arrowType[2]) {
+            case 'M':
+                return scanArrowArrayMonthInterval(array, outputVector, mask, srcOffset, dstOffset,
+                    count);
+            case 'D':
+                return scanArrowArrayDayTimeInterval(array, outputVector, mask, srcOffset,
+                    dstOffset, count);
+            case 'n':
+                return scanArrowArrayMonthDayNanoInterval(array, outputVector, mask, srcOffset,
+                    dstOffset, count);
+            default:
+                KU_UNREACHABLE;
+            }
+        default:
+            KU_UNREACHABLE;
+        }
+    case '+':
+        switch (arrowType[1]) {
+        case 'r':
+            // RUN END ENCODED
+            return scanArrowArrayRunEndEncoded(schema, array, outputVector, mask, srcOffset,
+                dstOffset, count);
+        case 'l':
+            // LIST
+            return scanArrowArrayList<int32_t>(schema, array, outputVector, mask, srcOffset,
+                dstOffset, count);
+        case 'L':
+            // LONG LIST
+            return scanArrowArrayList<int64_t>(schema, array, outputVector, mask, srcOffset,
+                dstOffset, count);
+        case 'w': {
+            // ARRAY
+            RUNTIME_CHECK({
+                auto arrowNumElements = std::stoul(arrowType + 3);
+                auto outputNumElements = ArrayType::getNumElements(outputVector.dataType);
+                KU_ASSERT(arrowNumElements == outputNumElements);
+            });
+            return scanArrowArrayFixedList(schema, array, outputVector, mask, srcOffset, dstOffset,
+                count);
+        }
+        case 's':
+            // STRUCT
+            return scanArrowArrayStruct(schema, array, outputVector, mask, srcOffset, dstOffset,
+                count);
+        case 'm':
+            // MAP
+            return scanArrowArrayList<int32_t>(schema, array, outputVector, mask, srcOffset,
+                dstOffset, count);
+        case 'u':
+            if (arrowType[2] == 'd') {
+                // DENSE UNION
+                return scanArrowArrayDenseUnion(schema, array, outputVector, mask, srcOffset,
+                    dstOffset, count);
+            } else {
+                // SPARSE UNION
+                return scanArrowArraySparseUnion(schema, array, outputVector, mask, srcOffset,
+                    dstOffset, count);
+            }
+        case 'v':
+            switch (arrowType[2]) {
+            case 'l':
+                return scanArrowArrayListView<int32_t>(schema, array, outputVector, mask, srcOffset,
+                    dstOffset, count);
+            case 'L':
+                return scanArrowArrayListView<int64_t>(schema, array, outputVector, mask, srcOffset,
+                    dstOffset, count);
+                // LONG LIST VIEW
+            default:
+                KU_UNREACHABLE;
+            }
+        default:
+            KU_UNREACHABLE;
+        }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void ArrowConverter::fromArrowArray(const ArrowSchema* schema, const ArrowArray* array,
+    ValueVector& outputVector) {
+    ArrowNullMaskTree mask(schema, array, array->offset, array->length);
+    return fromArrowArray(schema, array, outputVector, &mask, array->offset, 0, array->length);
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_converter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_converter.cpp
new file mode 100644
index 0000000000..ce74a18db5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_converter.cpp
@@ -0,0 +1,322 @@
+#include "common/arrow/arrow_converter.h"
+
+#include <cstring>
+
+#include "common/arrow/arrow_row_batch.h"
+#include "common/exception/runtime.h"
+
+namespace lbug {
+namespace common {
+
+static void releaseArrowSchema(ArrowSchema* schema) {
+    if (!schema || !schema->release) {
+        return;
+    }
+    schema->release = nullptr;
+    auto holder = static_cast<ArrowSchemaHolder*>(schema->private_data);
+    delete holder;
+}
+
+// Copies the given string into the arrow holder's owned names and returns a pointer to the owned
+// version
+static const char* copyName(ArrowSchemaHolder& rootHolder, const std::string& name) {
+    auto length = name.length();
+    std::unique_ptr<char[]> namePtr = std::make_unique<char[]>(length + 1);
+    std::memcpy(namePtr.get(), name.c_str(), length);
+    namePtr[length] = '\0';
+    rootHolder.ownedTypeNames.push_back(std::move(namePtr));
+    return rootHolder.ownedTypeNames.back().get();
+}
+
+// The resulting byte array follows the format described here:
+// https://arrow.apache.org/docs/format/CDataInterface.html#c.ArrowSchema.metadata
+static std::unique_ptr<char[]> serializeMetadata(
+    const std::map<std::string, std::string>& metadata) {
+    // Calculate size of byte array
+    auto numEntries = metadata.size();
+    auto size = (2 * numEntries + 1) * sizeof(int32_t);
+    for (const auto& [k, v] : metadata) {
+        size += k.size() + v.size();
+    }
+    std::unique_ptr<char[]> bytes(new char[size]);
+    // Copy data into byte array
+    char* ptr = bytes.get();
+    memcpy(ptr, &numEntries, sizeof(int32_t));
+    ptr += sizeof(int32_t);
+    for (const auto& [k, v] : metadata) {
+        auto ksz = k.size(), vsz = v.size();
+        memcpy(ptr, &ksz, sizeof(int32_t));
+        ptr += sizeof(int32_t);
+        memcpy(ptr, k.c_str(), ksz);
+        ptr += ksz;
+        memcpy(ptr, &vsz, sizeof(int32_t));
+        ptr += sizeof(int32_t);
+        memcpy(ptr, v.c_str(), vsz);
+        ptr += vsz;
+    }
+    return bytes;
+}
+
+static const char* copyMetadata(ArrowSchemaHolder& rootHolder,
+    const std::map<std::string, std::string>& metadata) {
+    rootHolder.ownedMetadatas.push_back(serializeMetadata(metadata));
+    return rootHolder.ownedMetadatas.back().get();
+}
+
+void ArrowConverter::initializeChild(ArrowSchema& child, const std::string& name) {
+    //! Child is cleaned up by parent
+    child.private_data = nullptr;
+    child.release = releaseArrowSchema;
+
+    //! Store the child schema
+    child.flags = ARROW_FLAG_NULLABLE;
+    child.name = name.c_str();
+    child.n_children = 0;
+    child.children = nullptr;
+    child.metadata = nullptr;
+    child.dictionary = nullptr;
+}
+
+void ArrowConverter::setArrowFormatForStruct(ArrowSchemaHolder& rootHolder, ArrowSchema& child,
+    const LogicalType& dataType, bool fallbackExtensionTypes) {
+    child.format = "+s";
+    // name is set by parent.
+    child.n_children = (std::int64_t)StructType::getNumFields(dataType);
+    rootHolder.nestedChildren.emplace_back();
+    rootHolder.nestedChildren.back().resize(child.n_children);
+    rootHolder.nestedChildrenPtr.emplace_back();
+    rootHolder.nestedChildrenPtr.back().resize(child.n_children);
+    for (auto i = 0u; i < child.n_children; i++) {
+        rootHolder.nestedChildrenPtr.back()[i] = &rootHolder.nestedChildren.back()[i];
+    }
+    child.children = &rootHolder.nestedChildrenPtr.back()[0];
+    for (auto i = 0u; i < child.n_children; i++) {
+        initializeChild(*child.children[i]);
+        const auto& structField = StructType::getField(dataType, i);
+        child.children[i]->name = copyName(rootHolder, structField.getName());
+        setArrowFormat(rootHolder, *child.children[i], structField.getType(),
+            fallbackExtensionTypes);
+    }
+}
+
+void ArrowConverter::setArrowFormatForUnion(ArrowSchemaHolder& rootHolder, ArrowSchema& child,
+    const LogicalType& dataType, bool fallbackExtensionTypes) {
+    std::string formatStr = "+ud";
+    child.n_children = (std::int64_t)UnionType::getNumFields(dataType);
+    rootHolder.nestedChildren.emplace_back();
+    rootHolder.nestedChildren.back().resize(child.n_children);
+    rootHolder.nestedChildrenPtr.emplace_back();
+    rootHolder.nestedChildrenPtr.back().resize(child.n_children);
+    for (auto i = 0u; i < child.n_children; i++) {
+        rootHolder.nestedChildrenPtr.back()[i] = &rootHolder.nestedChildren.back()[i];
+    }
+    child.children = &rootHolder.nestedChildrenPtr.back()[0];
+    for (auto i = 0u; i < child.n_children; i++) {
+        initializeChild(*child.children[i]);
+        const auto& unionFieldType = UnionType::getFieldType(dataType, i);
+        auto unionFieldName = UnionType::getFieldName(dataType, i);
+        child.children[i]->name = copyName(rootHolder, unionFieldName);
+        setArrowFormat(rootHolder, *child.children[i], unionFieldType, fallbackExtensionTypes);
+        formatStr += (i == 0u ? ":" : ",") + std::to_string(i);
+    }
+    child.format = copyName(rootHolder, formatStr);
+}
+
+void ArrowConverter::setArrowFormatForInternalID(ArrowSchemaHolder& rootHolder, ArrowSchema& child,
+    const LogicalType& /*dataType*/, bool fallbackExtensionTypes) {
+    child.format = "+s";
+    // name is set by parent.
+    child.n_children = 2;
+    rootHolder.nestedChildren.emplace_back();
+    rootHolder.nestedChildren.back().resize(child.n_children);
+    rootHolder.nestedChildrenPtr.emplace_back();
+    rootHolder.nestedChildrenPtr.back().resize(child.n_children);
+    for (auto i = 0u; i < child.n_children; i++) {
+        rootHolder.nestedChildrenPtr.back()[i] = &rootHolder.nestedChildren.back()[i];
+    }
+    child.children = &rootHolder.nestedChildrenPtr.back()[0];
+    initializeChild(*child.children[0]);
+    child.children[0]->name = copyName(rootHolder, "offset");
+    setArrowFormat(rootHolder, *child.children[0], LogicalType::INT64(), fallbackExtensionTypes);
+    initializeChild(*child.children[1]);
+    child.children[1]->name = copyName(rootHolder, "table");
+    setArrowFormat(rootHolder, *child.children[1], LogicalType::INT64(), fallbackExtensionTypes);
+}
+
+void ArrowConverter::setArrowFormat(ArrowSchemaHolder& rootHolder, ArrowSchema& child,
+    const LogicalType& dataType, bool fallbackExtensionTypes) {
+    switch (dataType.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL: {
+        child.format = "b";
+    } break;
+    case LogicalTypeID::INT128: {
+        child.format = "d:38,0";
+    } break;
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64: {
+        child.format = "l";
+    } break;
+    case LogicalTypeID::INT32: {
+        child.format = "i";
+    } break;
+    case LogicalTypeID::INT16: {
+        child.format = "s";
+    } break;
+    case LogicalTypeID::INT8: {
+        child.format = "c";
+    } break;
+    case LogicalTypeID::UINT64: {
+        child.format = "L";
+    } break;
+    case LogicalTypeID::UINT32: {
+        child.format = "I";
+    } break;
+    case LogicalTypeID::UINT16: {
+        child.format = "S";
+    } break;
+    case LogicalTypeID::UINT8: {
+        child.format = "C";
+    } break;
+    case LogicalTypeID::DOUBLE: {
+        child.format = "g";
+    } break;
+    case LogicalTypeID::FLOAT: {
+        child.format = "f";
+    } break;
+    case LogicalTypeID::DECIMAL: {
+        auto formatString = "d:" + std::to_string(DecimalType::getPrecision(dataType)) + "," +
+                            std::to_string(DecimalType::getScale(dataType));
+        child.format = copyName(rootHolder, formatString);
+    } break;
+    case LogicalTypeID::DATE: {
+        child.format = "tdD";
+    } break;
+    case LogicalTypeID::TIMESTAMP_MS: {
+        child.format = "tsm:";
+    } break;
+    case LogicalTypeID::TIMESTAMP_NS: {
+        child.format = "tsn:";
+    } break;
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        child.format = "tss:";
+    } break;
+    case LogicalTypeID::TIMESTAMP_TZ: {
+        auto format = "tsu:UTC";
+        child.format = copyName(rootHolder, format);
+    } break;
+    case LogicalTypeID::TIMESTAMP: {
+        child.format = "tsu:";
+    } break;
+    case LogicalTypeID::INTERVAL: {
+        child.format = "tDu";
+    } break;
+    case LogicalTypeID::UUID: {
+        if (!fallbackExtensionTypes) {
+            child.format = "w:16";
+            child.metadata = copyMetadata(rootHolder,
+                {{"ARROW:extension:name", "arrow.uuid"}, {"ARROW:extension:metadata", ""}});
+            break;
+        }
+        [[fallthrough]];
+    }
+    case LogicalTypeID::STRING: {
+        child.format = "u";
+    } break;
+    case LogicalTypeID::BLOB: {
+        child.format = "z";
+    } break;
+    case LogicalTypeID::LIST: {
+        child.format = "+l";
+        child.n_children = 1;
+        rootHolder.nestedChildren.emplace_back();
+        rootHolder.nestedChildren.back().resize(1);
+        rootHolder.nestedChildrenPtr.emplace_back();
+        rootHolder.nestedChildrenPtr.back().push_back(&rootHolder.nestedChildren.back()[0]);
+        initializeChild(rootHolder.nestedChildren.back()[0]);
+        child.children = &rootHolder.nestedChildrenPtr.back()[0];
+        child.children[0]->name = "l";
+        setArrowFormat(rootHolder, **child.children, ListType::getChildType(dataType),
+            fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::ARRAY: {
+        auto numValuesPerArray = "+w:" + std::to_string(ArrayType::getNumElements(dataType));
+        child.format = copyName(rootHolder, numValuesPerArray);
+        child.n_children = 1;
+        rootHolder.nestedChildren.emplace_back();
+        rootHolder.nestedChildren.back().resize(1);
+        rootHolder.nestedChildrenPtr.emplace_back();
+        rootHolder.nestedChildrenPtr.back().push_back(&rootHolder.nestedChildren.back()[0]);
+        initializeChild(rootHolder.nestedChildren.back()[0]);
+        child.children = &rootHolder.nestedChildrenPtr.back()[0];
+        child.children[0]->name = "l";
+        setArrowFormat(rootHolder, **child.children, ArrayType::getChildType(dataType),
+            fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::MAP: {
+        child.format = "+m";
+        child.n_children = 1;
+        rootHolder.nestedChildren.emplace_back();
+        rootHolder.nestedChildren.back().resize(1);
+        rootHolder.nestedChildrenPtr.emplace_back();
+        rootHolder.nestedChildrenPtr.back().push_back(&rootHolder.nestedChildren.back()[0]);
+        initializeChild(rootHolder.nestedChildren.back()[0]);
+        child.children = &rootHolder.nestedChildrenPtr.back()[0];
+        child.children[0]->name = "entries";
+        setArrowFormat(rootHolder, **child.children, ListType::getChildType(dataType),
+            fallbackExtensionTypes);
+        child.children[0]->children[0]->flags &=
+            ~ARROW_FLAG_NULLABLE; // Map's keys must be non-nullable
+    } break;
+    case LogicalTypeID::STRUCT:
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL:
+        setArrowFormatForStruct(rootHolder, child, dataType, fallbackExtensionTypes);
+        break;
+    case LogicalTypeID::INTERNAL_ID:
+        setArrowFormatForInternalID(rootHolder, child, dataType, fallbackExtensionTypes);
+        break;
+    case LogicalTypeID::UNION:
+        setArrowFormatForUnion(rootHolder, child, dataType, fallbackExtensionTypes);
+        break;
+    default:
+        throw RuntimeException(
+            stringFormat("{} cannot be exported to arrow.", dataType.toString()));
+    }
+}
+
+std::unique_ptr<ArrowSchema> ArrowConverter::toArrowSchema(
+    const std::vector<LogicalType>& dataTypes, const std::vector<std::string>& columnNames,
+    bool fallbackExtensionTypes) {
+    auto outSchema = std::make_unique<ArrowSchema>();
+    auto rootHolder = std::make_unique<ArrowSchemaHolder>();
+
+    auto columnCount = (int64_t)dataTypes.size();
+    rootHolder->children.resize(columnCount);
+    rootHolder->childrenPtrs.resize(columnCount);
+    for (auto i = 0u; i < columnCount; i++) {
+        rootHolder->childrenPtrs[i] = &rootHolder->children[i];
+    }
+    outSchema->children = rootHolder->childrenPtrs.data();
+    outSchema->n_children = columnCount;
+
+    outSchema->format = "+s"; // struct apparently
+    outSchema->flags = 0;
+    outSchema->metadata = nullptr;
+    outSchema->name = "lbug_query_result";
+    outSchema->dictionary = nullptr;
+
+    for (auto i = 0u; i < columnCount; i++) {
+        auto& child = rootHolder->children[i];
+        initializeChild(child);
+        child.name = copyName(*rootHolder, columnNames[i]);
+        setArrowFormat(*rootHolder, child, dataTypes[i], fallbackExtensionTypes);
+    }
+
+    outSchema->private_data = rootHolder.release();
+    outSchema->release = releaseArrowSchema;
+    return outSchema;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_null_mask_tree.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_null_mask_tree.cpp
new file mode 100644
index 0000000000..0ad4fa4034
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_null_mask_tree.cpp
@@ -0,0 +1,222 @@
+#include <vector>
+
+#include "common/arrow/arrow.h"
+#include "common/arrow/arrow_nullmask_tree.h"
+
+namespace lbug {
+namespace common {
+
+// scans are based on data specification found here
+// https://arrow.apache.org/docs/format/Columnar.html
+
+// all offsets are measured by value, not physical size
+
+void ArrowNullMaskTree::copyToValueVector(ValueVector* vec, uint64_t dstOffset, uint64_t count) {
+    vec->setNullFromBits(mask->getData(), offset, dstOffset, count);
+}
+
+ArrowNullMaskTree ArrowNullMaskTree::offsetBy(int64_t offset) {
+    // this operation is mostly a special case for dictionary/run-end encoding
+    ArrowNullMaskTree ret(*this);
+    ret.offset += offset;
+    return ret;
+}
+
+bool ArrowNullMaskTree::copyFromBuffer(const void* buffer, uint64_t srcOffset, uint64_t count) {
+    if (buffer == nullptr) {
+        mask->setAllNonNull();
+        return false;
+    }
+    mask->copyFromNullBits((const uint64_t*)buffer, srcOffset, 0, count, true);
+    return true;
+}
+
+bool ArrowNullMaskTree::applyParentBitmap(const NullMask* parent) {
+    if (parent == nullptr) {
+        return false;
+    }
+    if (parent->getData() != nullptr) {
+        *mask |= *parent;
+        return true;
+    }
+    return false;
+}
+
+template<typename offsetsT>
+void ArrowNullMaskTree::scanListPushDown(const ArrowSchema* schema, const ArrowArray* array,
+    uint64_t srcOffset, uint64_t count) {
+    const offsetsT* offsets = ((const offsetsT*)array->buffers[1]) + srcOffset;
+    offsetsT auxiliaryLength = offsets[count] - offsets[0];
+    NullMask pushDownMask(auxiliaryLength);
+    for (uint64_t i = 0; i < count; i++) {
+        pushDownMask.setNullFromRange(offsets[i] - offsets[0], offsets[i + 1] - offsets[i],
+            isNull(i));
+    }
+    children->push_back(ArrowNullMaskTree(schema->children[0], array->children[0],
+        offsets[0] + array->children[0]->offset, auxiliaryLength, &pushDownMask));
+}
+
+void ArrowNullMaskTree::scanArrayPushDown(const ArrowSchema* schema, const ArrowArray* array,
+    uint64_t srcOffset, uint64_t count) {
+    auto numElements = std::stoul(schema->format + 3);
+    auto auxiliaryLength = count * numElements;
+    NullMask pushDownMask(auxiliaryLength);
+    for (auto i = 0u; i < count; ++i) {
+        pushDownMask.setNullFromRange(i * numElements, numElements, isNull(i));
+    }
+    children->push_back(ArrowNullMaskTree(schema->children[0], array->children[0],
+        srcOffset * numElements + array->children[0]->offset, auxiliaryLength, &pushDownMask));
+}
+
+void ArrowNullMaskTree::scanStructPushDown(const ArrowSchema* schema, const ArrowArray* array,
+    uint64_t srcOffset, uint64_t count) {
+    for (int64_t i = 0; i < array->n_children; i++) {
+        children->push_back(ArrowNullMaskTree(schema->children[i], array->children[i],
+            srcOffset + array->children[i]->offset, count, mask.get()));
+    }
+}
+
+ArrowNullMaskTree::ArrowNullMaskTree(const ArrowSchema* schema, const ArrowArray* array,
+    uint64_t srcOffset, uint64_t count, const NullMask* parentBitmap)
+    : offset{0}, mask{std::make_shared<common::NullMask>(count)},
+      children(std::make_shared<std::vector<ArrowNullMaskTree>>()) {
+    if (schema->dictionary != nullptr) {
+        copyFromBuffer(array->buffers[0], srcOffset, count);
+        applyParentBitmap(parentBitmap);
+        dictionary = std::make_shared<ArrowNullMaskTree>(schema->dictionary, array->dictionary,
+            array->dictionary->offset, array->dictionary->length);
+        return;
+    }
+    const char* arrowType = schema->format;
+    std::vector<common::StructField> structFields;
+    switch (arrowType[0]) {
+    case 'n':
+        mask->setAllNull();
+        break;
+    case 'b':
+    case 'c':
+    case 'C':
+    case 's':
+    case 'S':
+    case 'i':
+    case 'I':
+    case 'l':
+    case 'L':
+    case 'd':
+    case 'f':
+    case 'g':
+        copyFromBuffer(array->buffers[0], srcOffset, count);
+        break;
+    case 'z':
+    case 'Z':
+    case 'u':
+    case 'U':
+    case 'v':
+    case 'w':
+    case 't':
+        copyFromBuffer(array->buffers[0], srcOffset, count);
+        applyParentBitmap(parentBitmap);
+        break;
+    case '+':
+        switch (arrowType[1]) {
+        case 'l':
+            copyFromBuffer(array->buffers[0], srcOffset, count);
+            applyParentBitmap(parentBitmap);
+            scanListPushDown<int32_t>(schema, array, srcOffset, count);
+            break;
+        case 'L':
+            copyFromBuffer(array->buffers[0], srcOffset, count);
+            applyParentBitmap(parentBitmap);
+            scanListPushDown<int64_t>(schema, array, srcOffset, count);
+            break;
+        case 'w':
+            copyFromBuffer(array->buffers[0], srcOffset, count);
+            applyParentBitmap(parentBitmap);
+            scanArrayPushDown(schema, array, srcOffset, count);
+            break;
+        case 's':
+            copyFromBuffer(array->buffers[0], srcOffset, count);
+            applyParentBitmap(parentBitmap);
+            scanStructPushDown(schema, array, srcOffset, count);
+            break;
+        case 'm':
+            copyFromBuffer(array->buffers[0], srcOffset, count);
+            applyParentBitmap(parentBitmap);
+            scanListPushDown<int32_t>(schema, array, srcOffset, count);
+            break;
+        case 'u': {
+            auto types = (const int8_t*)array->buffers[0];
+            if (schema->format[2] == 'd') {
+                auto offsets = (const int32_t*)array->buffers[1];
+                std::vector<int32_t> countChildren(array->n_children),
+                    lowestOffsets(array->n_children);
+                std::vector<int32_t> highestOffsets(array->n_children);
+                for (auto i = srcOffset; i < srcOffset + count; i++) {
+                    int32_t curOffset = offsets[i];
+                    int32_t curType = types[i];
+                    if (countChildren[curType] == 0) {
+                        lowestOffsets[curType] = curOffset;
+                    }
+                    highestOffsets[curType] = curOffset;
+                    countChildren[curType]++;
+                }
+                for (int64_t i = 0; i < array->n_children; i++) {
+                    children->push_back(ArrowNullMaskTree(schema->children[i], array->children[i],
+                        lowestOffsets[i] + array->children[i]->offset,
+                        highestOffsets[i] - lowestOffsets[i] + 1));
+                }
+                for (auto i = 0u; i < count; i++) {
+                    int32_t curOffset = offsets[i + srcOffset];
+                    int8_t curType = types[i + srcOffset];
+                    mask->setNull(i,
+                        children->operator[](curType).isNull(curOffset - lowestOffsets[curType]));
+                }
+            } else {
+                for (int64_t i = 0; i < array->n_children; i++) {
+                    children->push_back(ArrowNullMaskTree(schema->children[i], array->children[i],
+                        srcOffset + array->children[i]->offset, count));
+                }
+                for (auto i = 0u; i < count; i++) {
+                    int8_t curType = types[i + srcOffset];
+                    mask->setNull(i, children->operator[](curType).isNull(i));
+                    // this isn't specified in the arrow specification, but is it valid to
+                    // compute this using a bitwise OR?
+                }
+            }
+            if (parentBitmap != nullptr) {
+                *mask |= *parentBitmap;
+            }
+        } break;
+        case 'v':
+            // list views *suck*, especially when trying to write code that can support
+            // parallelization for this, we generate child NullMaskTrees on the fly, rather than
+            // attempt any precomputation
+            if (array->buffers[0] == nullptr) {
+                mask->setAllNonNull();
+            } else {
+                mask->copyFromNullBits((const uint64_t*)array->buffers[0], srcOffset, 0, count,
+                    true);
+            }
+            if (parentBitmap != nullptr) {
+                *mask |= *parentBitmap;
+            }
+            break;
+        case 'r':
+            // it's better to resolve validity during the actual scanning for run-end encoded arrays
+            // so for this, let's just resolve child validities and move on
+            for (int64_t i = 0; i < array->n_children; i++) {
+                children->push_back(ArrowNullMaskTree(schema->children[i], array->children[i],
+                    array->children[i]->offset, array->children[i]->length));
+            }
+            break;
+        default:
+            KU_UNREACHABLE;
+        }
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_row_batch.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_row_batch.cpp
new file mode 100644
index 0000000000..dba091ef8b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_row_batch.cpp
@@ -0,0 +1,1022 @@
+#include "common/arrow/arrow_row_batch.h"
+
+#include <cstring>
+
+#include "common/exception/runtime.h"
+#include "common/types/value/node.h"
+#include "common/types/value/rel.h"
+#include "common/types/value/value.h"
+#include "processor/result/flat_tuple.h"
+#include "storage/storage_utils.h"
+
+namespace lbug {
+namespace common {
+
+static void resizeVector(ArrowVector* vector, const LogicalType& type, int64_t capacity,
+    bool fallbackExtensionTypes);
+
+ArrowRowBatch::ArrowRowBatch(const std::vector<LogicalType>& types, std::int64_t capacity,
+    bool fallbackExtensionTypes)
+    : numTuples{0}, fallbackExtensionTypes{fallbackExtensionTypes} {
+    vectors.resize(types.size());
+    for (auto i = 0u; i < types.size(); i++) {
+        vectors[i] = std::make_unique<ArrowVector>();
+        resizeVector(vectors[i].get(), types[i], capacity, fallbackExtensionTypes);
+    }
+}
+
+static uint64_t getArrowMainBufferSize(const LogicalType& type, uint64_t capacity,
+    bool fallbackExtensionTypes) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL:
+        return getNumBytesForBits(capacity);
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::TIMESTAMP:
+    case LogicalTypeID::TIMESTAMP_SEC:
+    case LogicalTypeID::TIMESTAMP_MS:
+    case LogicalTypeID::TIMESTAMP_NS:
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::INTERVAL:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::INT64:
+        return sizeof(int64_t) * capacity;
+    case LogicalTypeID::DATE:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::INT32:
+        return sizeof(int32_t) * capacity;
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::INT16:
+        return sizeof(int16_t) * capacity;
+    case LogicalTypeID::UNION:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::INT8:
+        return sizeof(int8_t) * capacity;
+    case LogicalTypeID::DECIMAL:
+    case LogicalTypeID::INT128:
+        return sizeof(int128_t) * capacity;
+    case LogicalTypeID::DOUBLE:
+        return sizeof(double) * capacity;
+    case LogicalTypeID::FLOAT:
+        return sizeof(float) * capacity;
+    case LogicalTypeID::UUID: {
+        if (!fallbackExtensionTypes) {
+            return sizeof(char) * 16 * capacity;
+        }
+        [[fallthrough]];
+    }
+    case LogicalTypeID::STRING:
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::MAP:
+        return sizeof(int32_t) * (capacity + 1);
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::STRUCT:
+    case LogicalTypeID::INTERNAL_ID:
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+        return 0; // no main buffer
+    default:
+        KU_UNREACHABLE; // should enumerate all types.
+    }
+}
+
+static void resizeValidityBuffer(ArrowVector* vector, int64_t capacity) {
+    vector->validity.resize(getNumBytesForBits(capacity), 0xFF);
+}
+
+static void resizeMainBuffer(ArrowVector* vector, const LogicalType& type, int64_t capacity,
+    bool fallbackExtensionTypes) {
+    vector->data.resize(getArrowMainBufferSize(type, capacity, fallbackExtensionTypes));
+}
+
+static void resizeBLOBOverflow(ArrowVector* vector, int64_t capacity) {
+    vector->overflow.resize(capacity);
+}
+
+static void resizeUnionOverflow(ArrowVector* vector, int64_t capacity) {
+    vector->overflow.resize(capacity * sizeof(int32_t));
+}
+
+static void resizeChildVectors(ArrowVector* vector, const std::vector<LogicalType>& childTypes,
+    int64_t childCapacity, bool fallbackExtensionTypes) {
+    for (auto i = 0u; i < childTypes.size(); i++) {
+        if (i >= vector->childData.size()) {
+            vector->childData.push_back(std::make_unique<ArrowVector>());
+        }
+        resizeVector(vector->childData[i].get(), childTypes[i], childCapacity,
+            fallbackExtensionTypes);
+    }
+}
+
+static void resizeGeneric(ArrowVector* vector, const LogicalType& type, int64_t capacity,
+    bool fallbackExtensionTypes) {
+    if (vector->capacity >= capacity) {
+        return;
+    }
+    while (vector->capacity < capacity) {
+        if (vector->capacity == 0) {
+            vector->capacity = 1;
+        } else {
+            vector->capacity *= 2;
+        }
+    }
+    resizeValidityBuffer(vector, vector->capacity);
+    resizeMainBuffer(vector, type, vector->capacity, fallbackExtensionTypes);
+}
+
+static void resizeBLOBVector(ArrowVector* vector, const LogicalType& type, int64_t capacity,
+    int64_t overflowCapacity, bool fallbackExtensionTypes) {
+    resizeGeneric(vector, type, capacity, fallbackExtensionTypes);
+    resizeBLOBOverflow(vector, overflowCapacity);
+}
+
+static void resizeFixedListVector(ArrowVector* vector, const LogicalType& type, int64_t capacity,
+    bool fallbackExtensionTypes) {
+    resizeGeneric(vector, type, capacity, fallbackExtensionTypes);
+    std::vector<LogicalType> typeVec;
+    typeVec.push_back(ArrayType::getChildType(type).copy());
+    resizeChildVectors(vector, typeVec, vector->capacity * ArrayType::getNumElements(type),
+        fallbackExtensionTypes);
+}
+
+static void resizeListVector(ArrowVector* vector, const LogicalType& type, int64_t capacity,
+    int64_t childCapacity, bool fallbackExtensionTypes) {
+    resizeGeneric(vector, type, capacity, fallbackExtensionTypes);
+    std::vector<LogicalType> typeVec;
+    typeVec.push_back(ListType::getChildType(type).copy());
+    resizeChildVectors(vector, typeVec, childCapacity, fallbackExtensionTypes);
+}
+
+static void resizeStructVector(ArrowVector* vector, const LogicalType& type, int64_t capacity,
+    bool fallbackExtensionTypes) {
+    resizeGeneric(vector, type, capacity, fallbackExtensionTypes);
+    std::vector<LogicalType> typeVec;
+    for (auto i : StructType::getFieldTypes(type)) {
+        typeVec.push_back(i->copy());
+    }
+    resizeChildVectors(vector, typeVec, vector->capacity, fallbackExtensionTypes);
+}
+
+static void resizeUnionVector(ArrowVector* vector, const LogicalType& type, int64_t capacity,
+    bool fallbackExtensionTypes) {
+    if (vector->capacity < capacity) {
+        while (vector->capacity < capacity) {
+            if (vector->capacity == 0) {
+                vector->capacity = 1;
+            } else {
+                vector->capacity *= 2;
+            }
+        }
+        resizeMainBuffer(vector, type, vector->capacity, fallbackExtensionTypes);
+    }
+    resizeUnionOverflow(vector, vector->capacity);
+    std::vector<LogicalType> childTypes;
+    for (auto i = 0u; i < UnionType::getNumFields(type); i++) {
+        childTypes.push_back(UnionType::getFieldType(type, i).copy());
+    }
+    resizeChildVectors(vector, childTypes, vector->capacity, fallbackExtensionTypes);
+}
+
+static void resizeInternalIDVector(ArrowVector* vector, const LogicalType& type, int64_t capacity,
+    bool fallbackExtensionTypes) {
+    resizeGeneric(vector, type, capacity, fallbackExtensionTypes);
+    std::vector<LogicalType> typeVec;
+    typeVec.push_back(LogicalType::INT64());
+    typeVec.push_back(LogicalType::INT64());
+    resizeChildVectors(vector, typeVec, vector->capacity, fallbackExtensionTypes);
+}
+
+static void resizeVector(ArrowVector* vector, const LogicalType& type, std::int64_t capacity,
+    bool fallbackExtensionTypes) {
+    auto result = std::make_unique<ArrowVector>();
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::UUID: {
+        if (fallbackExtensionTypes) {
+            resizeBLOBVector(vector, type, capacity, capacity, fallbackExtensionTypes);
+            return;
+        }
+        [[fallthrough]];
+    }
+    case LogicalTypeID::BOOL:
+    case LogicalTypeID::DECIMAL:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::INT8:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DATE:
+    case LogicalTypeID::TIMESTAMP_MS:
+    case LogicalTypeID::TIMESTAMP_NS:
+    case LogicalTypeID::TIMESTAMP_SEC:
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::TIMESTAMP:
+    case LogicalTypeID::INTERVAL:
+        return resizeGeneric(vector, type, capacity, fallbackExtensionTypes);
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::STRING:
+        return resizeBLOBVector(vector, type, capacity, capacity, fallbackExtensionTypes);
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::MAP:
+        return resizeListVector(vector, type, capacity, capacity, fallbackExtensionTypes);
+    case LogicalTypeID::ARRAY:
+        return resizeFixedListVector(vector, type, capacity, fallbackExtensionTypes);
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::STRUCT:
+        return resizeStructVector(vector, type, capacity, fallbackExtensionTypes);
+    case LogicalTypeID::UNION:
+        return resizeUnionVector(vector, type, capacity, fallbackExtensionTypes);
+    case LogicalTypeID::INTERNAL_ID:
+        return resizeInternalIDVector(vector, type, capacity, fallbackExtensionTypes);
+    default: {
+        // LCOV_EXCL_START
+        throw common::RuntimeException{
+            common::stringFormat("Unsupported type: {} for arrow conversion.", type.toString())};
+        // LCOV_EXCL_STOP
+    }
+    }
+}
+
+static void getBitPosition(std::int64_t pos, std::int64_t& bytePos, std::int64_t& bitOffset) {
+    bytePos = pos >> 3;
+    bitOffset = pos - (bytePos << 3);
+}
+
+static void setBitToZero(std::uint8_t* data, std::int64_t pos) {
+    std::int64_t bytePos = 0, bitOffset = 0;
+    getBitPosition(pos, bytePos, bitOffset);
+    data[bytePos] &= ~((std::uint64_t)1 << bitOffset);
+}
+
+static void setBitToOne(std::uint8_t* data, std::int64_t pos) {
+    std::int64_t bytePos = 0, bitOffset = 0;
+    getBitPosition(pos, bytePos, bitOffset);
+    data[bytePos] |= ((std::uint64_t)1 << bitOffset);
+}
+
+void ArrowRowBatch::appendValue(ArrowVector* vector, const Value& value,
+    bool fallbackExtensionTypes) {
+    if (value.isNull()) {
+        copyNullValue(vector, value, vector->numValues);
+    } else {
+        copyNonNullValue(vector, value, vector->numValues, fallbackExtensionTypes);
+    }
+    vector->numValues++;
+}
+
+template<LogicalTypeID DT>
+void ArrowRowBatch::templateCopyNonNullValue(ArrowVector* vector, const Value& value,
+    std::int64_t pos, bool) {
+    auto valSize = storage::StorageUtils::getDataTypeSize(LogicalType{DT});
+    std::memcpy(vector->data.data() + pos * valSize, &value.val, valSize);
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::DECIMAL>(ArrowVector* vector,
+    const Value& value, std::int64_t pos, bool) {
+    auto valSize = storage::StorageUtils::getDataTypeSize(value.getDataType());
+    std::memcpy(vector->data.data() + pos * 16, &value.val, valSize);
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::INTERVAL>(ArrowVector* vector,
+    const Value& value, std::int64_t pos, bool) {
+    auto destAddr = (int64_t*)(vector->data.data() + pos * sizeof(std::int64_t));
+    auto intervalVal = value.val.intervalVal;
+    *destAddr = intervalVal.micros + intervalVal.days * Interval::MICROS_PER_DAY +
+                intervalVal.months * Interval::MICROS_PER_MONTH;
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::BOOL>(ArrowVector* vector,
+    const Value& value, std::int64_t pos, bool) {
+    if (value.val.booleanVal) {
+        setBitToOne(vector->data.data(), pos);
+    } else {
+        setBitToZero(vector->data.data(), pos);
+    }
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::STRING>(ArrowVector* vector,
+    const Value& value, std::int64_t pos, bool) {
+    auto offsets = (std::uint32_t*)vector->data.data();
+    auto strLength = value.strVal.length();
+    if (pos == 0) {
+        offsets[pos] = 0;
+    }
+    offsets[pos + 1] = offsets[pos] + strLength;
+    vector->overflow.resize(offsets[pos + 1] + 1);
+    std::memcpy(vector->overflow.data() + offsets[pos], value.strVal.data(), strLength);
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::UUID>(ArrowVector* vector,
+    const Value& value, std::int64_t pos, bool fallbackExtensionTypes) {
+    if (!fallbackExtensionTypes) {
+        auto valSize = sizeof(int128_t);
+        auto val = value.val.int128Val;
+        val.high ^= (int64_t(1) << 63); // MSB is stored flipped internally
+        // Convert to little-endian
+        auto valPtr = reinterpret_cast<int8_t*>(&val);
+        for (auto i = 0u; i < valSize / 2; ++i) {
+            std::swap(valPtr[i], valPtr[valSize - i - 1]);
+        }
+        std::memcpy(vector->data.data() + pos * valSize, &val, valSize);
+    } else {
+        auto offsets = (std::uint32_t*)vector->data.data();
+        auto str = UUID::toString(value.val.int128Val);
+        auto strLength = str.length();
+        if (pos == 0) {
+            offsets[pos] = 0;
+        }
+        offsets[pos + 1] = offsets[pos] + strLength;
+        vector->overflow.resize(offsets[pos + 1]);
+        std::memcpy(vector->overflow.data() + offsets[pos], str.data(), strLength);
+    }
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::LIST>(ArrowVector* vector,
+    const Value& value, std::int64_t pos, bool fallbackExtensionTypes) {
+    auto offsets = (std::uint32_t*)vector->data.data();
+    auto numElements = value.childrenSize;
+    if (pos == 0) {
+        offsets[pos] = 0;
+    }
+    offsets[pos + 1] = offsets[pos] + numElements;
+    std::vector<LogicalType> typeVec;
+    typeVec.push_back(ListType::getChildType(value.getDataType()).copy());
+    resizeChildVectors(vector, typeVec, offsets[pos + 1] + 1, fallbackExtensionTypes);
+    for (auto i = 0u; i < numElements; i++) {
+        appendValue(vector->childData[0].get(), *value.children[i], fallbackExtensionTypes);
+    }
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::ARRAY>(ArrowVector* vector,
+    const Value& value, std::int64_t /*pos*/, bool fallbackExtensionTypes) {
+    auto numElements = value.childrenSize;
+    for (auto i = 0u; i < numElements; i++) {
+        appendValue(vector->childData[0].get(), *value.children[i], fallbackExtensionTypes);
+    }
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::MAP>(ArrowVector* vector,
+    const Value& value, std::int64_t pos, bool fallbackExtensionTypes) {
+    // Verify all keys are not null
+    for (auto i = 0u; i < value.childrenSize; ++i) {
+        if (value.children[i]->children[0]->isNull()) {
+            throw RuntimeException{
+                stringFormat("Cannot convert map with null key to Arrow: {}", value.toString())};
+        }
+    }
+    return templateCopyNonNullValue<LogicalTypeID::LIST>(vector, value, pos,
+        fallbackExtensionTypes);
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::STRUCT>(ArrowVector* vector,
+    const Value& value, std::int64_t /*pos*/, bool fallbackExtensionTypes) {
+    for (auto i = 0u; i < value.childrenSize; i++) {
+        appendValue(vector->childData[i].get(), *value.children[i], fallbackExtensionTypes);
+    }
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::UNION>(ArrowVector* vector,
+    const Value& value, std::int64_t pos, bool fallbackExtensionTypes) {
+    auto typeBuffer = (std::uint8_t*)vector->data.data();
+    auto offsetsBuffer = (std::int32_t*)vector->overflow.data();
+    auto& type = value.getDataType();
+    for (auto i = 0u; i < UnionType::getNumFields(type); i++) {
+        if (UnionType::getFieldType(type, i) == value.children[0]->dataType) {
+            typeBuffer[pos] = i;
+            offsetsBuffer[pos] = vector->childData[i]->numValues;
+            return appendValue(vector->childData[i].get(), *value.children[0],
+                fallbackExtensionTypes);
+        }
+    }
+    KU_UNREACHABLE; // We should always be able to find a matching type
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::INTERNAL_ID>(ArrowVector* vector,
+    const Value& value, std::int64_t /*pos*/, bool fallbackExtensionTypes) {
+    auto nodeID = value.getValue<nodeID_t>();
+    Value offsetVal((std::int64_t)nodeID.offset);
+    Value tableIDVal((std::int64_t)nodeID.tableID);
+    appendValue(vector->childData[0].get(), offsetVal, fallbackExtensionTypes);
+    appendValue(vector->childData[1].get(), tableIDVal, fallbackExtensionTypes);
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::NODE>(ArrowVector* vector,
+    const Value& value, std::int64_t /*pos*/, bool fallbackExtensionTypes) {
+    appendValue(vector->childData[0].get(), *NodeVal::getNodeIDVal(&value), fallbackExtensionTypes);
+    appendValue(vector->childData[1].get(), *NodeVal::getLabelVal(&value), fallbackExtensionTypes);
+    std::int64_t propertyId = 2;
+    auto numProperties = NodeVal::getNumProperties(&value);
+    for (auto i = 0u; i < numProperties; i++) {
+        auto val = NodeVal::getPropertyVal(&value, i);
+        appendValue(vector->childData[propertyId].get(), *val, fallbackExtensionTypes);
+        propertyId++;
+    }
+}
+
+template<>
+void ArrowRowBatch::templateCopyNonNullValue<LogicalTypeID::REL>(ArrowVector* vector,
+    const Value& value, std::int64_t /*pos*/, bool fallbackExtensionTypes) {
+    appendValue(vector->childData[0].get(), *RelVal::getSrcNodeIDVal(&value),
+        fallbackExtensionTypes);
+    appendValue(vector->childData[1].get(), *RelVal::getDstNodeIDVal(&value),
+        fallbackExtensionTypes);
+    appendValue(vector->childData[2].get(), *RelVal::getLabelVal(&value), fallbackExtensionTypes);
+    appendValue(vector->childData[3].get(), *RelVal::getIDVal(&value), fallbackExtensionTypes);
+    common::property_id_t propertyID = 4;
+    auto numProperties = RelVal::getNumProperties(&value);
+    for (auto i = 0u; i < numProperties; i++) {
+        auto val = RelVal::getPropertyVal(&value, i);
+        appendValue(vector->childData[propertyID].get(), *val, fallbackExtensionTypes);
+        propertyID++;
+    }
+}
+
+void ArrowRowBatch::copyNonNullValue(ArrowVector* vector, const Value& value, std::int64_t pos,
+    bool fallbackExtensionTypes) {
+    switch (value.getDataType().getLogicalTypeID()) {
+    case LogicalTypeID::BOOL: {
+        templateCopyNonNullValue<LogicalTypeID::BOOL>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::DECIMAL:
+    case LogicalTypeID::INT128: {
+        templateCopyNonNullValue<LogicalTypeID::INT128>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::UUID: {
+        templateCopyNonNullValue<LogicalTypeID::UUID>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64: {
+        templateCopyNonNullValue<LogicalTypeID::INT64>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::INT32: {
+        templateCopyNonNullValue<LogicalTypeID::INT32>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::INT16: {
+        templateCopyNonNullValue<LogicalTypeID::INT16>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::INT8: {
+        templateCopyNonNullValue<LogicalTypeID::INT8>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::UINT64: {
+        templateCopyNonNullValue<LogicalTypeID::UINT64>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::UINT32: {
+        templateCopyNonNullValue<LogicalTypeID::UINT32>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::UINT16: {
+        templateCopyNonNullValue<LogicalTypeID::UINT16>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::UINT8: {
+        templateCopyNonNullValue<LogicalTypeID::UINT8>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::DOUBLE: {
+        templateCopyNonNullValue<LogicalTypeID::DOUBLE>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::FLOAT: {
+        templateCopyNonNullValue<LogicalTypeID::FLOAT>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::DATE: {
+        templateCopyNonNullValue<LogicalTypeID::DATE>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::TIMESTAMP: {
+        templateCopyNonNullValue<LogicalTypeID::TIMESTAMP>(vector, value, pos,
+            fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::TIMESTAMP_TZ: {
+        templateCopyNonNullValue<LogicalTypeID::TIMESTAMP_TZ>(vector, value, pos,
+            fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::TIMESTAMP_NS: {
+        templateCopyNonNullValue<LogicalTypeID::TIMESTAMP_NS>(vector, value, pos,
+            fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::TIMESTAMP_MS: {
+        templateCopyNonNullValue<LogicalTypeID::TIMESTAMP_MS>(vector, value, pos,
+            fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        templateCopyNonNullValue<LogicalTypeID::TIMESTAMP_SEC>(vector, value, pos,
+            fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::INTERVAL: {
+        templateCopyNonNullValue<LogicalTypeID::INTERVAL>(vector, value, pos,
+            fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::STRING: {
+        templateCopyNonNullValue<LogicalTypeID::STRING>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::LIST: {
+        templateCopyNonNullValue<LogicalTypeID::LIST>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::ARRAY: {
+        templateCopyNonNullValue<LogicalTypeID::ARRAY>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::MAP: {
+        templateCopyNonNullValue<LogicalTypeID::MAP>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::STRUCT: {
+        templateCopyNonNullValue<LogicalTypeID::STRUCT>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::UNION: {
+        templateCopyNonNullValue<LogicalTypeID::UNION>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::INTERNAL_ID: {
+        templateCopyNonNullValue<LogicalTypeID::INTERNAL_ID>(vector, value, pos,
+            fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::NODE: {
+        templateCopyNonNullValue<LogicalTypeID::NODE>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    case LogicalTypeID::REL: {
+        templateCopyNonNullValue<LogicalTypeID::REL>(vector, value, pos, fallbackExtensionTypes);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+template<LogicalTypeID DT>
+void ArrowRowBatch::templateCopyNullValue(ArrowVector* vector, std::int64_t pos) {
+    // TODO(Guodong): make this as a function.
+    setBitToZero(vector->validity.data(), pos);
+    vector->numNulls++;
+}
+
+template<>
+void ArrowRowBatch::templateCopyNullValue<LogicalTypeID::STRING>(ArrowVector* vector,
+    std::int64_t pos) {
+    auto offsets = (std::uint32_t*)vector->data.data();
+    if (pos == 0) {
+        offsets[pos] = 0;
+    }
+    offsets[pos + 1] = offsets[pos];
+    setBitToZero(vector->validity.data(), pos);
+    vector->numNulls++;
+}
+
+template<>
+void ArrowRowBatch::templateCopyNullValue<LogicalTypeID::LIST>(ArrowVector* vector,
+    std::int64_t pos) {
+    auto offsets = (std::uint32_t*)vector->data.data();
+    if (pos == 0) {
+        offsets[pos] = 0;
+    }
+    offsets[pos + 1] = offsets[pos];
+    setBitToZero(vector->validity.data(), pos);
+    vector->numNulls++;
+}
+
+template<>
+void ArrowRowBatch::templateCopyNullValue<LogicalTypeID::MAP>(ArrowVector* vector,
+    std::int64_t pos) {
+    return templateCopyNullValue<LogicalTypeID::LIST>(vector, pos);
+}
+
+template<>
+void ArrowRowBatch::templateCopyNullValue<LogicalTypeID::STRUCT>(ArrowVector* vector,
+    std::int64_t pos) {
+    setBitToZero(vector->validity.data(), pos);
+    vector->numNulls++;
+}
+
+void ArrowRowBatch::copyNullValueUnion(ArrowVector* vector, const Value& value, std::int64_t pos) {
+    auto typeBuffer = (std::uint8_t*)vector->data.data();
+    auto offsetsBuffer = (std::int32_t*)vector->overflow.data();
+    typeBuffer[pos] = 0;
+    offsetsBuffer[pos] = vector->childData[0]->numValues;
+    copyNullValue(vector->childData[0].get(), *value.children[0], pos);
+    vector->numNulls++;
+}
+
+static void copyArrowArray(ArrowVector* vector, std::int64_t pos, uint64_t numElements) {
+    setBitToZero(vector->validity.data(), pos);
+    vector->numNulls++;
+    auto& child = vector->childData[0];
+    child->numValues += numElements;
+}
+
+void ArrowRowBatch::copyNullValue(ArrowVector* vector, const Value& value, std::int64_t pos) {
+    switch (value.dataType.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL: {
+        templateCopyNullValue<LogicalTypeID::BOOL>(vector, pos);
+    } break;
+    case LogicalTypeID::DECIMAL:
+    case LogicalTypeID::INT128: {
+        templateCopyNullValue<LogicalTypeID::INT128>(vector, pos);
+    } break;
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64: {
+        templateCopyNullValue<LogicalTypeID::INT64>(vector, pos);
+    } break;
+    case LogicalTypeID::INT32: {
+        templateCopyNullValue<LogicalTypeID::INT32>(vector, pos);
+    } break;
+    case LogicalTypeID::INT16: {
+        templateCopyNullValue<LogicalTypeID::INT16>(vector, pos);
+    } break;
+    case LogicalTypeID::INT8: {
+        templateCopyNullValue<LogicalTypeID::INT8>(vector, pos);
+    } break;
+    case LogicalTypeID::UINT64: {
+        templateCopyNullValue<LogicalTypeID::UINT64>(vector, pos);
+    } break;
+    case LogicalTypeID::UINT32: {
+        templateCopyNullValue<LogicalTypeID::UINT32>(vector, pos);
+    } break;
+    case LogicalTypeID::UINT16: {
+        templateCopyNullValue<LogicalTypeID::UINT16>(vector, pos);
+    } break;
+    case LogicalTypeID::UINT8: {
+        templateCopyNullValue<LogicalTypeID::UINT8>(vector, pos);
+    } break;
+    case LogicalTypeID::DOUBLE: {
+        templateCopyNullValue<LogicalTypeID::DOUBLE>(vector, pos);
+    } break;
+    case LogicalTypeID::FLOAT: {
+        templateCopyNullValue<LogicalTypeID::FLOAT>(vector, pos);
+    } break;
+    case LogicalTypeID::DATE: {
+        templateCopyNullValue<LogicalTypeID::DATE>(vector, pos);
+    } break;
+    case LogicalTypeID::TIMESTAMP_MS: {
+        templateCopyNullValue<LogicalTypeID::TIMESTAMP_MS>(vector, pos);
+    } break;
+    case LogicalTypeID::TIMESTAMP_NS: {
+        templateCopyNullValue<LogicalTypeID::TIMESTAMP_NS>(vector, pos);
+    } break;
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        templateCopyNullValue<LogicalTypeID::TIMESTAMP_SEC>(vector, pos);
+    } break;
+    case LogicalTypeID::TIMESTAMP_TZ: {
+        templateCopyNullValue<LogicalTypeID::TIMESTAMP_TZ>(vector, pos);
+    } break;
+    case LogicalTypeID::TIMESTAMP: {
+        templateCopyNullValue<LogicalTypeID::TIMESTAMP>(vector, pos);
+    } break;
+    case LogicalTypeID::INTERVAL: {
+        templateCopyNullValue<LogicalTypeID::INTERVAL>(vector, pos);
+    } break;
+    case LogicalTypeID::UUID: {
+        templateCopyNullValue<LogicalTypeID::UUID>(vector, pos);
+    } break;
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::STRING: {
+        templateCopyNullValue<LogicalTypeID::STRING>(vector, pos);
+    } break;
+    case LogicalTypeID::LIST: {
+        templateCopyNullValue<LogicalTypeID::LIST>(vector, pos);
+    } break;
+    case LogicalTypeID::ARRAY: {
+        copyArrowArray(vector, pos, ArrayType::getNumElements(value.dataType));
+    } break;
+    case LogicalTypeID::MAP: {
+        templateCopyNullValue<LogicalTypeID::MAP>(vector, pos);
+    } break;
+    case LogicalTypeID::INTERNAL_ID: {
+        templateCopyNullValue<LogicalTypeID::INTERNAL_ID>(vector, pos);
+    } break;
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::STRUCT: {
+        templateCopyNullValue<LogicalTypeID::STRUCT>(vector, pos);
+    } break;
+    case LogicalTypeID::UNION: {
+        copyNullValueUnion(vector, value, pos);
+    } break;
+    case LogicalTypeID::NODE: {
+        templateCopyNullValue<LogicalTypeID::NODE>(vector, pos);
+    } break;
+    case LogicalTypeID::REL: {
+        templateCopyNullValue<LogicalTypeID::REL>(vector, pos);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+static void releaseArrowVector(ArrowArray* array) {
+    if (!array || !array->release) {
+        return;
+    }
+    array->release = nullptr;
+    auto holder = static_cast<ArrowVector*>(array->private_data);
+    delete holder;
+}
+
+static std::unique_ptr<ArrowArray> createArrayFromVector(ArrowVector& vector) {
+    auto result = std::make_unique<ArrowArray>();
+    result->private_data = nullptr;
+    result->release = releaseArrowVector;
+    result->n_children = 0;
+    result->offset = 0;
+    result->dictionary = nullptr;
+    result->buffers = vector.buffers.data();
+    result->null_count = vector.numNulls;
+    result->length = vector.numValues;
+    result->n_buffers = 1;
+    result->buffers[0] = vector.validity.data();
+    if (vector.data.data() != nullptr) {
+        result->n_buffers++;
+        result->buffers[1] = vector.data.data();
+    }
+    return result;
+}
+
+template<LogicalTypeID DT>
+ArrowArray* ArrowRowBatch::templateCreateArray(ArrowVector& vector, const LogicalType& /*type*/,
+    bool) {
+    auto result = createArrayFromVector(vector);
+    vector.array = std::move(result);
+    return vector.array.get();
+}
+
+template<>
+ArrowArray* ArrowRowBatch::templateCreateArray<LogicalTypeID::STRING>(ArrowVector& vector,
+    const LogicalType& /*type*/, bool) {
+    auto result = createArrayFromVector(vector);
+    result->n_buffers = 3;
+    result->buffers[2] = vector.overflow.data();
+    vector.array = std::move(result);
+    return vector.array.get();
+}
+
+template<>
+ArrowArray* ArrowRowBatch::templateCreateArray<LogicalTypeID::LIST>(ArrowVector& vector,
+    const LogicalType& type, bool fallbackExtensionTypes) {
+    auto result = createArrayFromVector(vector);
+    vector.childPointers.resize(1);
+    result->children = vector.childPointers.data();
+    result->n_children = 1;
+    vector.childPointers[0] = convertVectorToArray(*vector.childData[0],
+        ListType::getChildType(type), fallbackExtensionTypes);
+    vector.array = std::move(result);
+    return vector.array.get();
+}
+
+template<>
+ArrowArray* ArrowRowBatch::templateCreateArray<LogicalTypeID::ARRAY>(ArrowVector& vector,
+    const LogicalType& type, bool fallbackExtensionTypes) {
+    auto result = createArrayFromVector(vector);
+    vector.childPointers.resize(1);
+    result->n_buffers = 1;
+    result->children = vector.childPointers.data();
+    result->n_children = 1;
+    vector.childPointers[0] = convertVectorToArray(*vector.childData[0],
+        ArrayType::getChildType(type), fallbackExtensionTypes);
+    vector.array = std::move(result);
+    return vector.array.get();
+}
+
+template<>
+ArrowArray* ArrowRowBatch::templateCreateArray<LogicalTypeID::MAP>(ArrowVector& vector,
+    const LogicalType& type, bool fallbackExtensionTypes) {
+    return templateCreateArray<LogicalTypeID::LIST>(vector, type, fallbackExtensionTypes);
+}
+
+template<>
+ArrowArray* ArrowRowBatch::templateCreateArray<LogicalTypeID::STRUCT>(ArrowVector& vector,
+    const LogicalType& type, bool fallbackExtensionTypes) {
+    return convertStructVectorToArray(vector, type, fallbackExtensionTypes);
+}
+
+ArrowArray* ArrowRowBatch::convertStructVectorToArray(ArrowVector& vector, const LogicalType& type,
+    bool fallbackExtensionTypes) {
+    auto result = createArrayFromVector(vector);
+    result->n_buffers = 1;
+    vector.childPointers.resize(StructType::getNumFields(type));
+    result->children = vector.childPointers.data();
+    result->n_children = (std::int64_t)StructType::getNumFields(type);
+    for (auto i = 0u; i < StructType::getNumFields(type); i++) {
+        const auto& childType = StructType::getFieldType(type, i);
+        vector.childPointers[i] =
+            convertVectorToArray(*vector.childData[i], childType, fallbackExtensionTypes);
+    }
+    vector.array = std::move(result);
+    return vector.array.get();
+}
+
+ArrowArray* ArrowRowBatch::convertInternalIDVectorToArray(ArrowVector& vector,
+    const LogicalType& /*type*/, bool fallbackExtensionTypes) {
+    auto result = createArrayFromVector(vector);
+    result->n_buffers = 1;
+    vector.childPointers.resize(2);
+    result->children = vector.childPointers.data();
+    result->n_children = 2;
+    for (auto i = 0; i < 2; i++) {
+        auto childType = LogicalType::INT64();
+        vector.childPointers[i] =
+            convertVectorToArray(*vector.childData[i], childType, fallbackExtensionTypes);
+    }
+    vector.array = std::move(result);
+    return vector.array.get();
+}
+
+template<>
+ArrowArray* ArrowRowBatch::templateCreateArray<LogicalTypeID::UNION>(ArrowVector& vector,
+    const LogicalType& type, bool fallbackExtensionTypes) {
+    // since union is a special case, we make the ArrowArray ourselves instead of using
+    // createArrayFromVector
+    auto nChildren = UnionType::getNumFields(type);
+    vector.array = std::make_unique<ArrowArray>();
+    vector.array->private_data = nullptr;
+    vector.array->release = releaseArrowVector;
+    vector.array->n_children = nChildren;
+    vector.childPointers.resize(nChildren);
+    vector.array->children = vector.childPointers.data();
+    vector.array->offset = 0;
+    vector.array->dictionary = nullptr;
+    vector.array->buffers = vector.buffers.data();
+    vector.array->null_count = 0;
+    vector.array->length = vector.numValues;
+    vector.array->n_buffers = 2;
+    vector.array->buffers[0] = vector.data.data();
+    vector.array->buffers[1] = vector.overflow.data();
+    for (auto i = 0u; i < nChildren; i++) {
+        const auto& childType = UnionType::getFieldType(type, i);
+        vector.childPointers[i] =
+            convertVectorToArray(*vector.childData[i], childType, fallbackExtensionTypes);
+    }
+    return vector.array.get();
+}
+
+template<>
+ArrowArray* ArrowRowBatch::templateCreateArray<LogicalTypeID::INTERNAL_ID>(ArrowVector& vector,
+    const LogicalType& type, bool fallbackExtensionTypes) {
+    return convertInternalIDVectorToArray(vector, type, fallbackExtensionTypes);
+}
+
+template<>
+ArrowArray* ArrowRowBatch::templateCreateArray<LogicalTypeID::NODE>(ArrowVector& vector,
+    const LogicalType& type, bool fallbackExtensionTypes) {
+    return convertStructVectorToArray(vector, type, fallbackExtensionTypes);
+}
+
+template<>
+ArrowArray* ArrowRowBatch::templateCreateArray<LogicalTypeID::REL>(ArrowVector& vector,
+    const LogicalType& type, bool fallbackExtensionTypes) {
+    return convertStructVectorToArray(vector, type, fallbackExtensionTypes);
+}
+
+ArrowArray* ArrowRowBatch::convertVectorToArray(ArrowVector& vector, const LogicalType& type,
+    bool fallbackExtensionTypes) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL: {
+        return templateCreateArray<LogicalTypeID::BOOL>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::DECIMAL:
+    case LogicalTypeID::INT128: {
+        return templateCreateArray<LogicalTypeID::INT128>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64: {
+        return templateCreateArray<LogicalTypeID::INT64>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::INT32: {
+        return templateCreateArray<LogicalTypeID::INT32>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::INT16: {
+        return templateCreateArray<LogicalTypeID::INT16>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::INT8: {
+        return templateCreateArray<LogicalTypeID::INT8>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::UINT64: {
+        return templateCreateArray<LogicalTypeID::UINT64>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::UINT32: {
+        return templateCreateArray<LogicalTypeID::UINT32>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::UINT16: {
+        return templateCreateArray<LogicalTypeID::UINT16>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::UINT8: {
+        return templateCreateArray<LogicalTypeID::UINT8>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::DOUBLE: {
+        return templateCreateArray<LogicalTypeID::DOUBLE>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::FLOAT: {
+        return templateCreateArray<LogicalTypeID::FLOAT>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::DATE: {
+        return templateCreateArray<LogicalTypeID::DATE>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::TIMESTAMP_MS: {
+        return templateCreateArray<LogicalTypeID::TIMESTAMP_MS>(vector, type,
+            fallbackExtensionTypes);
+    }
+    case LogicalTypeID::TIMESTAMP_NS: {
+        return templateCreateArray<LogicalTypeID::TIMESTAMP_NS>(vector, type,
+            fallbackExtensionTypes);
+    }
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        return templateCreateArray<LogicalTypeID::TIMESTAMP_SEC>(vector, type,
+            fallbackExtensionTypes);
+    }
+    case LogicalTypeID::TIMESTAMP_TZ: {
+        return templateCreateArray<LogicalTypeID::TIMESTAMP_TZ>(vector, type,
+            fallbackExtensionTypes);
+    }
+    case LogicalTypeID::TIMESTAMP: {
+        return templateCreateArray<LogicalTypeID::TIMESTAMP>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::INTERVAL: {
+        return templateCreateArray<LogicalTypeID::INTERVAL>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::UUID: {
+        if (!fallbackExtensionTypes) {
+            return templateCreateArray<LogicalTypeID::UUID>(vector, type, fallbackExtensionTypes);
+        }
+        [[fallthrough]];
+    }
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::STRING: {
+        return templateCreateArray<LogicalTypeID::STRING>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::LIST: {
+        return templateCreateArray<LogicalTypeID::LIST>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::ARRAY: {
+        return templateCreateArray<LogicalTypeID::ARRAY>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::MAP: {
+        return templateCreateArray<LogicalTypeID::MAP>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::STRUCT: {
+        return templateCreateArray<LogicalTypeID::STRUCT>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::UNION: {
+        return templateCreateArray<LogicalTypeID::UNION>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::INTERNAL_ID: {
+        return templateCreateArray<LogicalTypeID::INTERNAL_ID>(vector, type,
+            fallbackExtensionTypes);
+    }
+    case LogicalTypeID::NODE: {
+        return templateCreateArray<LogicalTypeID::NODE>(vector, type, fallbackExtensionTypes);
+    }
+    case LogicalTypeID::REL: {
+        return templateCreateArray<LogicalTypeID::REL>(vector, type, fallbackExtensionTypes);
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+ArrowArray ArrowRowBatch::toArray(const std::vector<LogicalType>& types) {
+    auto rootHolder = std::make_unique<ArrowVector>();
+    ArrowArray result{};
+    rootHolder->childPointers.resize(vectors.size());
+    result.children = rootHolder->childPointers.data();
+    result.n_children = (std::int64_t)vectors.size();
+    result.length = numTuples;
+    result.n_buffers = 1;
+    result.buffers = rootHolder->buffers.data(); // no actual buffer
+    result.offset = 0;
+    result.null_count = 0;
+    result.dictionary = nullptr;
+    rootHolder->childData = std::move(vectors);
+    for (auto i = 0u; i < rootHolder->childData.size(); i++) {
+        rootHolder->childPointers[i] =
+            convertVectorToArray(*rootHolder->childData[i], types[i], fallbackExtensionTypes);
+    }
+    result.private_data = rootHolder.release();
+    result.release = releaseArrowVector;
+    return result;
+}
+
+void ArrowRowBatch::append(const processor::FlatTuple& tuple) {
+    for (auto i = 0u; i < vectors.size(); i++) {
+        appendValue(vectors[i].get(), tuple[i], fallbackExtensionTypes);
+    }
+    numTuples++;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_type.cpp
new file mode 100644
index 0000000000..7d17fc541a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/arrow/arrow_type.cpp
@@ -0,0 +1,151 @@
+#include "common/arrow/arrow_converter.h"
+#include "common/exception/not_implemented.h"
+#include "common/string_utils.h"
+
+namespace lbug {
+namespace common {
+
+// Pyarrow format string specifications can be found here
+// https://arrow.apache.org/docs/format/CDataInterface.html#data-type-description-format-strings
+
+LogicalType ArrowConverter::fromArrowSchema(const ArrowSchema* schema) {
+    const char* arrowType = schema->format;
+    std::vector<StructField> structFields;
+    // If we have a dictionary, then the logical type of the column is dependent upon the
+    // logical type of the dict
+    if (schema->dictionary != nullptr) {
+        return fromArrowSchema(schema->dictionary);
+    }
+    switch (arrowType[0]) {
+    case 'n':
+        return LogicalType(LogicalTypeID::ANY);
+    case 'b':
+        return LogicalType(LogicalTypeID::BOOL);
+    case 'c':
+        return LogicalType(LogicalTypeID::INT8);
+    case 'C':
+        return LogicalType(LogicalTypeID::UINT8);
+    case 's':
+        return LogicalType(LogicalTypeID::INT16);
+    case 'S':
+        return LogicalType(LogicalTypeID::UINT16);
+    case 'i':
+        return LogicalType(LogicalTypeID::INT32);
+    case 'I':
+        return LogicalType(LogicalTypeID::UINT32);
+    case 'l':
+        return LogicalType(LogicalTypeID::INT64);
+    case 'L':
+        return LogicalType(LogicalTypeID::UINT64);
+    case 'e':
+        throw NotImplementedException("16 bit floats are not supported");
+    case 'f':
+        return LogicalType(LogicalTypeID::FLOAT);
+    case 'g':
+        return LogicalType(LogicalTypeID::DOUBLE);
+    case 'z':
+    case 'Z':
+        return LogicalType(LogicalTypeID::BLOB);
+    case 'u':
+    case 'U':
+        return LogicalType(LogicalTypeID::STRING);
+    case 'v':
+        switch (arrowType[1]) {
+        case 'z':
+            return LogicalType(LogicalTypeID::BLOB);
+        case 'u':
+            return LogicalType(LogicalTypeID::STRING);
+        default:
+            KU_UNREACHABLE;
+        }
+
+    case 'd': {
+        auto split = StringUtils::splitComma(std::string(arrowType + 2));
+        if (split.size() > 2 && split[2] != "128") {
+            throw NotImplementedException("Decimal bitwidths other than 128 are not implemented");
+        }
+        return LogicalType::DECIMAL(stoul(split[0]), stoul(split[1]));
+    }
+    case 'w':
+        return LogicalType(LogicalTypeID::BLOB); // fixed width binary
+    case 't':
+        switch (arrowType[1]) {
+        case 'd':
+            if (arrowType[2] == 'D') {
+                return LogicalType(LogicalTypeID::DATE);
+            } else {
+                return LogicalType(LogicalTypeID::TIMESTAMP_MS);
+            }
+        case 't':
+            // TODO implement pure time type
+            throw NotImplementedException("Pure time types are not supported");
+        case 's':
+            // TODO maxwell: timezone support
+            switch (arrowType[2]) {
+            case 's':
+                return LogicalType(LogicalTypeID::TIMESTAMP_SEC);
+            case 'm':
+                return LogicalType(LogicalTypeID::TIMESTAMP_MS);
+            case 'u':
+                return LogicalType(LogicalTypeID::TIMESTAMP);
+            case 'n':
+                return LogicalType(LogicalTypeID::TIMESTAMP_NS);
+            default:
+                KU_UNREACHABLE;
+            }
+        case 'D':
+            // duration
+        case 'i':
+            // interval
+            return LogicalType(LogicalTypeID::INTERVAL);
+        default:
+            KU_UNREACHABLE;
+        }
+    case '+':
+        KU_ASSERT(schema->n_children > 0);
+        switch (arrowType[1]) {
+        // complex types need a complementary ExtraTypeInfo object
+        case 'l':
+        case 'L':
+            return LogicalType::LIST(LogicalType(fromArrowSchema(schema->children[0])));
+        case 'w':
+            return LogicalType::ARRAY(LogicalType(fromArrowSchema(schema->children[0])),
+                std::stoul(arrowType + 3));
+        case 's':
+            for (int64_t i = 0; i < schema->n_children; i++) {
+                structFields.emplace_back(std::string(schema->children[i]->name),
+                    LogicalType(fromArrowSchema(schema->children[i])));
+            }
+            return LogicalType::STRUCT(std::move(structFields));
+        case 'm':
+            return LogicalType::MAP(LogicalType(fromArrowSchema(schema->children[0]->children[0])),
+                LogicalType(fromArrowSchema(schema->children[0]->children[1])));
+        case 'u': {
+            for (int64_t i = 0; i < schema->n_children; i++) {
+                structFields.emplace_back(std::to_string(i),
+                    LogicalType(fromArrowSchema(schema->children[i])));
+            }
+            return LogicalType::UNION(std::move(structFields));
+        }
+        case 'v':
+            switch (arrowType[2]) {
+            case 'l':
+            case 'L':
+                return LogicalType::LIST(LogicalType(fromArrowSchema(schema->children[0])));
+            default:
+                KU_UNREACHABLE;
+            }
+        case 'r':
+            // logical type corresponds to second child
+            return fromArrowSchema(schema->children[1]);
+        default:
+            KU_UNREACHABLE;
+        }
+    default:
+        KU_UNREACHABLE;
+    }
+    // refer to arrow_converted.cpp:65
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/case_insensitive_map.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/case_insensitive_map.cpp
new file mode 100644
index 0000000000..b00a217757
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/case_insensitive_map.cpp
@@ -0,0 +1,18 @@
+#include "common/case_insensitive_map.h"
+
+#include "common/string_utils.h"
+
+namespace lbug {
+namespace common {
+
+uint64_t CaseInsensitiveStringHashFunction::operator()(const std::string& str) const {
+    return common::StringUtils::caseInsensitiveHash(str);
+}
+
+bool CaseInsensitiveStringEquality::operator()(const std::string& lhs,
+    const std::string& rhs) const {
+    return common::StringUtils::caseInsensitiveEquals(lhs, rhs);
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/checksum.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/checksum.cpp
new file mode 100644
index 0000000000..2abeb6cc6a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/checksum.cpp
@@ -0,0 +1,88 @@
+/**
+ * The implementation for checksumming is taken from DuckDB:
+ * https://github.com/duckdb/duckdb/blob/v1.3-ossivalis/src/common/checksum.cpp
+ * https://github.com/duckdb/duckdb/blob/v1.3-ossivalis/LICENSE
+ */
+
+#include "common/checksum.h"
+
+#include "common/types/types.h"
+
+namespace lbug::common {
+
+hash_t checksum(uint64_t x) {
+    return x * UINT64_C(0xbf58476d1ce4e5b9);
+}
+
+// MIT License
+// Copyright (c) 2018-2021 Martin Ankerl
+// https://github.com/martinus/robin-hood-hashing/blob/3.11.5/LICENSE
+hash_t checksumRemainder(void* ptr, size_t len) noexcept {
+    static constexpr uint64_t M = UINT64_C(0xc6a4a7935bd1e995);
+    static constexpr uint64_t SEED = UINT64_C(0xe17a1465);
+    static constexpr unsigned int R = 47;
+
+    auto const* const data64 = static_cast<uint64_t const*>(ptr);
+    uint64_t h = SEED ^ (len * M);
+
+    size_t const n_blocks = len / 8;
+    for (size_t i = 0; i < n_blocks; ++i) {
+        auto k = *reinterpret_cast<const uint64_t*>(data64 + i);
+
+        k *= M;
+        k ^= k >> R;
+        k *= M;
+
+        h ^= k;
+        h *= M;
+    }
+
+    auto const* const data8 = reinterpret_cast<uint8_t const*>(data64 + n_blocks);
+    switch (len & 7U) {
+    case 7:
+        h ^= static_cast<uint64_t>(data8[6]) << 48U;
+        [[fallthrough]];
+    case 6:
+        h ^= static_cast<uint64_t>(data8[5]) << 40U;
+        [[fallthrough]];
+    case 5:
+        h ^= static_cast<uint64_t>(data8[4]) << 32U;
+        [[fallthrough]];
+    case 4:
+        h ^= static_cast<uint64_t>(data8[3]) << 24U;
+        [[fallthrough]];
+    case 3:
+        h ^= static_cast<uint64_t>(data8[2]) << 16U;
+        [[fallthrough]];
+    case 2:
+        h ^= static_cast<uint64_t>(data8[1]) << 8U;
+        [[fallthrough]];
+    case 1:
+        h ^= static_cast<uint64_t>(data8[0]);
+        h *= M;
+        [[fallthrough]];
+    default:
+        break;
+    }
+    h ^= h >> R;
+    h *= M;
+    h ^= h >> R;
+    return static_cast<hash_t>(h);
+}
+
+uint64_t checksum(uint8_t* buffer, size_t size) {
+    uint64_t result = 5381;
+    uint64_t* ptr = reinterpret_cast<uint64_t*>(buffer);
+    size_t i{};
+    // for efficiency, we first checksum uint64_t values
+    for (i = 0; i < size / 8; i++) {
+        result ^= checksum(ptr[i]);
+    }
+    if (size - i * 8 > 0) {
+        // the remaining 0-7 bytes we hash using a string hash
+        result ^= checksumRemainder(buffer + i * 8, size - i * 8);
+    }
+    return result;
+}
+
+} // namespace lbug::common
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/constants.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/constants.cpp
new file mode 100644
index 0000000000..ab9e2f3bec
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/constants.cpp
@@ -0,0 +1,6 @@
+namespace lbug {
+namespace common {
+
+const char* LBUG_VERSION = LBUG_CMAKE_VERSION;
+}
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/copier_config/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/copier_config/CMakeLists.txt
new file mode 100644
index 0000000000..2ea2e7492a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/copier_config/CMakeLists.txt
@@ -0,0 +1,8 @@
+add_library(lbug_common_copier_config
+        OBJECT
+        csv_reader_config.cpp
+        reader_config.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_copier_config>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/copier_config/csv_reader_config.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/copier_config/csv_reader_config.cpp
new file mode 100644
index 0000000000..39f978efb2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/copier_config/csv_reader_config.cpp
@@ -0,0 +1,170 @@
+#include "common/copier_config/csv_reader_config.h"
+
+#include <algorithm>
+
+#include "common/exception/binder.h"
+#include "common/exception/runtime.h"
+#include "common/string_utils.h"
+#include "common/types/value/nested.h"
+
+namespace lbug {
+namespace common {
+
+static char bindParsingOptionValue(const std::string& value) {
+    if (value == "\\t") {
+        return '\t';
+    }
+    if (value.length() < 1 || value.length() > 2 || (value.length() == 2 && value[0] != '\\')) {
+        throw BinderException("Copy csv option value must be a single character with an "
+                              "optional escape character.");
+    }
+    return value[value.length() - 1];
+}
+
+static void bindBoolParsingOption(CSVReaderConfig& config, const std::string& optionName,
+    bool optionValue) {
+    if (optionName == "HEADER") {
+        config.option.hasHeader = optionValue;
+        config.option.setHeader = true;
+    } else if (optionName == "PARALLEL") {
+        config.parallel = optionValue;
+    } else if (optionName == "LIST_UNBRACED") {
+        config.option.allowUnbracedList = optionValue;
+    } else if (optionName == CopyConstants::IGNORE_ERRORS_OPTION_NAME) {
+        config.option.ignoreErrors = optionValue;
+    } else if (optionName == "AUTODETECT" || optionName == "AUTO_DETECT") {
+        config.option.autoDetection = optionValue;
+    } else {
+        KU_UNREACHABLE;
+    }
+}
+
+static void bindStringParsingOption(CSVReaderConfig& config, const std::string& optionName,
+    const std::string& optionValue) {
+    auto parsingOptionValue = bindParsingOptionValue(optionValue);
+    if (optionName == "ESCAPE") {
+        config.option.escapeChar = parsingOptionValue;
+        config.option.setEscape = true;
+    } else if (optionName == "DELIM" || optionName == "DELIMITER") {
+        config.option.delimiter = parsingOptionValue;
+        config.option.setDelim = true;
+    } else if (optionName == "QUOTE") {
+        config.option.quoteChar = parsingOptionValue;
+        config.option.setQuote = true;
+    } else {
+        KU_UNREACHABLE;
+    }
+}
+
+static void bindIntParsingOption(CSVReaderConfig& config, const std::string& optionName,
+    const int64_t& optionValue) {
+    if (optionName == "SKIP") {
+        if (optionValue < 0) {
+            throw RuntimeException{"Skip number must be a non-negative integer"};
+        }
+        config.option.skipNum = optionValue;
+    } else if (optionName == "SAMPLE_SIZE") {
+        if (optionValue < 0) {
+            // technically impossible at the moment since negative values aren't supported
+            // in parameters
+            throw RuntimeException{"Sample size must be a non-negative integer"};
+        }
+        config.option.sampleSize = optionValue;
+    } else {
+        KU_UNREACHABLE;
+    }
+}
+
+static void bindListParsingOption(CSVReaderConfig& config, const std::string& optionName,
+    const std::vector<std::string>& optionValue) {
+    if (optionName == "NULL_STRINGS") {
+        config.option.nullStrings = optionValue;
+    } else {
+        KU_UNREACHABLE;
+    }
+}
+
+template<uint64_t size>
+static bool hasOption(const char* const (&arr)[size], const std::string& option) {
+    return std::find(std::begin(arr), std::end(arr), option) != std::end(arr);
+}
+
+static bool validateBoolParsingOptionName(const std::string& parsingOptionName) {
+    return hasOption(CopyConstants::BOOL_CSV_PARSING_OPTIONS, parsingOptionName);
+}
+
+static bool validateStringParsingOptionName(const std::string& parsingOptionName) {
+    return hasOption(CopyConstants::STRING_CSV_PARSING_OPTIONS, parsingOptionName);
+}
+
+static bool validateIntParsingOptionName(const std::string& parsingOptionName) {
+    return hasOption(CopyConstants::INT_CSV_PARSING_OPTIONS, parsingOptionName);
+}
+
+static bool validateListParsingOptionName(const std::string& parsingOptionName) {
+    return hasOption(CopyConstants::LIST_CSV_PARSING_OPTIONS, parsingOptionName);
+}
+
+static bool isValidBooleanOptionValue(const Value& value, const std::string& name) {
+    // Normalize and check if the string is a valid Boolean representation
+    auto strValue = value.toString();
+    StringUtils::toUpper(strValue);
+
+    // Check for valid Boolean string representations
+    if (strValue == "TRUE" || strValue == "1") {
+        return true;
+    } else if (strValue == "FALSE" || strValue == "0") {
+        return false;
+    } else {
+        // In this case the boolean is not valid
+        throw BinderException(
+            stringFormat("The type of csv parsing option {} must be a boolean.", name));
+    }
+}
+
+CSVReaderConfig CSVReaderConfig::construct(const case_insensitive_map_t<Value>& options) {
+    auto config = CSVReaderConfig();
+    for (auto& op : options) {
+        auto name = op.first;
+        auto isValidStringParsingOption = validateStringParsingOptionName(name);
+        auto isValidBoolParsingOption = validateBoolParsingOptionName(name);
+        auto isValidIntParsingOption = validateIntParsingOptionName(name);
+        auto isValidListParsingOption = validateListParsingOptionName(name);
+        if (isValidBoolParsingOption) {
+            bindBoolParsingOption(config, name, isValidBooleanOptionValue(op.second, name));
+        } else if (isValidStringParsingOption) {
+            if (op.second.getDataType() != LogicalType::STRING()) {
+                throw BinderException(
+                    stringFormat("The type of csv parsing option {} must be a string.", name));
+            }
+            bindStringParsingOption(config, name, op.second.getValue<std::string>());
+        } else if (isValidIntParsingOption) {
+            if (op.second.getDataType() != LogicalType::INT64()) {
+                throw BinderException(
+                    stringFormat("The type of csv parsing option {} must be a INT64.", name));
+            }
+            bindIntParsingOption(config, name, op.second.getValue<int64_t>());
+        } else if (isValidListParsingOption) {
+            if (op.second.getDataType() != LogicalType::LIST(LogicalType::STRING())) {
+                throw BinderException(
+                    stringFormat("The type of csv parsing option {} must be a STRING[].", name));
+            }
+            std::vector<std::string> optionValues;
+            for (auto i = 0u; i < op.second.getChildrenSize(); i++) {
+                optionValues.push_back(
+                    NestedVal::getChildVal(&op.second, i)->getValue<std::string>());
+            }
+            bindListParsingOption(config, name, optionValues);
+        } else {
+            throw BinderException(stringFormat("Unrecognized csv parsing option: {}.", name));
+        }
+    }
+    if (config.option.skipNum > 0) {
+        // If the user sets the number of rows to skip, we cannot read in parallel mode.
+        config.parallel = false;
+    }
+    return config;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/copier_config/reader_config.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/copier_config/reader_config.cpp
new file mode 100644
index 0000000000..2aaae3b2d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/copier_config/reader_config.cpp
@@ -0,0 +1,56 @@
+#include "common/assert.h"
+#include "common/copier_config/file_scan_info.h"
+#include "common/string_utils.h"
+
+namespace lbug {
+namespace common {
+
+FileType FileTypeUtils::getFileTypeFromExtension(std::string_view extension) {
+    if (extension == ".csv") {
+        return FileType::CSV;
+    }
+    if (extension == ".parquet") {
+        return FileType::PARQUET;
+    }
+    if (extension == ".npy") {
+        return FileType::NPY;
+    }
+    return FileType::UNKNOWN;
+}
+
+std::string FileTypeUtils::toString(FileType fileType) {
+    switch (fileType) {
+    case FileType::UNKNOWN: {
+        return "UNKNOWN";
+    }
+    case FileType::CSV: {
+        return "CSV";
+    }
+    case FileType::PARQUET: {
+        return "PARQUET";
+    }
+    case FileType::NPY: {
+        return "NPY";
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+FileType FileTypeUtils::fromString(std::string fileType) {
+    fileType = common::StringUtils::getUpper(fileType);
+    if (fileType == "CSV") {
+        return FileType::CSV;
+    } else if (fileType == "PARQUET") {
+        return FileType::PARQUET;
+    } else if (fileType == "NPY") {
+        return FileType::NPY;
+    } else {
+        return FileType::UNKNOWN;
+        // throw BinderException(stringFormat("Unsupported file type: {}.", fileType));
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/CMakeLists.txt
new file mode 100644
index 0000000000..d2fe29e0de
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/CMakeLists.txt
@@ -0,0 +1,10 @@
+add_library(lbug_common_data_chunk
+        OBJECT
+        data_chunk.cpp
+        data_chunk_collection.cpp
+        data_chunk_state.cpp
+        sel_vector.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_data_chunk>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/data_chunk.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/data_chunk.cpp
new file mode 100644
index 0000000000..85d08396a5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/data_chunk.cpp
@@ -0,0 +1,19 @@
+#include "common/data_chunk/data_chunk.h"
+
+namespace lbug {
+namespace common {
+
+void DataChunk::insert(uint32_t pos, std::shared_ptr<ValueVector> valueVector) {
+    valueVector->setState(state);
+    KU_ASSERT(valueVectors.size() > pos);
+    valueVectors[pos] = std::move(valueVector);
+}
+
+void DataChunk::resetAuxiliaryBuffer() {
+    for (auto& valueVector : valueVectors) {
+        valueVector->resetAuxiliaryBuffer();
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/data_chunk_collection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/data_chunk_collection.cpp
new file mode 100644
index 0000000000..1b02a69bc4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/data_chunk_collection.cpp
@@ -0,0 +1,57 @@
+#include "common/data_chunk/data_chunk_collection.h"
+
+#include "common/system_config.h"
+
+namespace lbug {
+namespace common {
+
+DataChunkCollection::DataChunkCollection(storage::MemoryManager* mm) : mm{mm} {}
+
+void DataChunkCollection::append(DataChunk& chunk) {
+    auto numTuplesToAppend = chunk.state->getSelVector().getSelSize();
+    auto numTuplesAppended = 0u;
+    while (numTuplesAppended < numTuplesToAppend) {
+        if (chunks.empty() ||
+            chunks.back().state->getSelVector().getSelSize() == DEFAULT_VECTOR_CAPACITY) {
+            allocateChunk(chunk);
+        }
+        auto& chunkToAppend = chunks.back();
+        auto numTuplesToCopy = std::min((uint64_t)numTuplesToAppend - numTuplesAppended,
+            DEFAULT_VECTOR_CAPACITY - chunkToAppend.state->getSelVector().getSelSize());
+        for (auto vectorIdx = 0u; vectorIdx < chunk.getNumValueVectors(); vectorIdx++) {
+            for (auto i = 0u; i < numTuplesToCopy; i++) {
+                auto srcPos = chunk.state->getSelVector()[numTuplesAppended + i];
+                auto dstPos = chunkToAppend.state->getSelVector().getSelSize() + i;
+                chunkToAppend.getValueVectorMutable(vectorIdx).copyFromVectorData(dstPos,
+                    &chunk.getValueVector(vectorIdx), srcPos);
+            }
+        }
+        chunkToAppend.state->getSelVectorUnsafe().incrementSelSize(numTuplesToCopy);
+        numTuplesAppended += numTuplesToCopy;
+    }
+}
+
+void DataChunkCollection::initTypes(const DataChunk& chunk) {
+    types.clear();
+    types.reserve(chunk.getNumValueVectors());
+    for (auto vectorIdx = 0u; vectorIdx < chunk.getNumValueVectors(); vectorIdx++) {
+        types.push_back(chunk.getValueVector(vectorIdx).dataType.copy());
+    }
+}
+
+void DataChunkCollection::allocateChunk(const DataChunk& chunk) {
+    if (chunks.empty()) {
+        types.reserve(chunk.getNumValueVectors());
+        for (auto vectorIdx = 0u; vectorIdx < chunk.getNumValueVectors(); vectorIdx++) {
+            types.push_back(chunk.getValueVector(vectorIdx).dataType.copy());
+        }
+    }
+    DataChunk newChunk(types.size(), std::make_shared<DataChunkState>());
+    for (auto i = 0u; i < types.size(); i++) {
+        newChunk.insert(i, std::make_shared<ValueVector>(types[i].copy(), mm));
+    }
+    chunks.push_back(std::move(newChunk));
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/data_chunk_state.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/data_chunk_state.cpp
new file mode 100644
index 0000000000..36afb266a7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/data_chunk_state.cpp
@@ -0,0 +1,18 @@
+#include "common/data_chunk/data_chunk_state.h"
+
+#include "common/system_config.h"
+
+namespace lbug {
+namespace common {
+
+DataChunkState::DataChunkState() : DataChunkState(DEFAULT_VECTOR_CAPACITY) {}
+
+std::shared_ptr<DataChunkState> DataChunkState::getSingleValueDataChunkState() {
+    auto state = std::make_shared<DataChunkState>(1);
+    state->initOriginalAndSelectedSize(1);
+    state->setToFlat();
+    return state;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/sel_vector.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/sel_vector.cpp
new file mode 100644
index 0000000000..14aec93f50
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/data_chunk/sel_vector.cpp
@@ -0,0 +1,48 @@
+#include "common/data_chunk/sel_vector.h"
+
+#include <array>
+#include <numeric>
+
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace common {
+
+// NOLINTNEXTLINE(cert-err58-cpp): always evaluated at compile time, and even not it would not throw
+static const std::array<sel_t, DEFAULT_VECTOR_CAPACITY> INCREMENTAL_SELECTED_POS =
+    []() constexpr noexcept {
+        std::array<sel_t, DEFAULT_VECTOR_CAPACITY> selectedPos{};
+        std::iota(selectedPos.begin(), selectedPos.end(), 0);
+        return selectedPos;
+    }();
+
+SelectionView::SelectionView(sel_t selectedSize)
+    : selectedPositions{INCREMENTAL_SELECTED_POS.data()}, selectedSize{selectedSize},
+      state{State::STATIC} {}
+
+SelectionVector::SelectionVector() : SelectionVector{DEFAULT_VECTOR_CAPACITY} {}
+
+void SelectionVector::setToUnfiltered() {
+    selectedPositions = INCREMENTAL_SELECTED_POS.data();
+    state = State::STATIC;
+}
+void SelectionVector::setToUnfiltered(sel_t size) {
+    KU_ASSERT(size <= capacity);
+    selectedPositions = INCREMENTAL_SELECTED_POS.data();
+    selectedSize = size;
+    state = State::STATIC;
+}
+
+std::vector<SelectionVector*> SelectionVector::fromValueVectors(
+    const std::vector<std::shared_ptr<ValueVector>>& vec) {
+    std::vector<SelectionVector*> ret(vec.size());
+    for (size_t i = 0; i < vec.size(); ++i) {
+        ret[i] = vec[i]->getSelVectorPtr();
+    }
+    return ret;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/database_lifecycle_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/database_lifecycle_manager.cpp
new file mode 100644
index 0000000000..48b7714f41
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/database_lifecycle_manager.cpp
@@ -0,0 +1,14 @@
+#include "common/database_lifecycle_manager.h"
+
+#include "common/exception/runtime.h"
+
+namespace lbug {
+namespace common {
+void DatabaseLifeCycleManager::checkDatabaseClosedOrThrow() const {
+    if (isDatabaseClosed) {
+        throw RuntimeException(
+            "The current operation is not allowed because the parent database is closed.");
+    }
+}
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/CMakeLists.txt
new file mode 100644
index 0000000000..f789e52a0d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/CMakeLists.txt
@@ -0,0 +1,17 @@
+add_library(lbug_common_enums
+        OBJECT
+        accumulate_type.cpp
+        path_semantic.cpp
+        query_rel_type.cpp
+        rel_direction.cpp
+        rel_multiplicity.cpp
+        scan_source_type.cpp
+        table_type.cpp
+        transaction_action.cpp
+        drop_type.cpp
+        extend_direction_util.cpp
+        conflict_action.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_enums>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/accumulate_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/accumulate_type.cpp
new file mode 100644
index 0000000000..b6a2d56e91
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/accumulate_type.cpp
@@ -0,0 +1,22 @@
+#include "common/enums/accumulate_type.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace common {
+
+std::string AccumulateTypeUtil::toString(AccumulateType type) {
+    switch (type) {
+    case AccumulateType::REGULAR: {
+        return "REGULAR";
+    }
+    case AccumulateType::OPTIONAL_: {
+        return "OPTIONAL";
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/conflict_action.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/conflict_action.cpp
new file mode 100644
index 0000000000..054069eb18
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/conflict_action.cpp
@@ -0,0 +1,22 @@
+#include "common/enums/conflict_action.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace common {
+
+std::string ConflictActionUtil::toString(ConflictAction action) {
+    switch (action) {
+    case ConflictAction::ON_CONFLICT_THROW: {
+        return "ON_CONFLICT_THROW";
+    }
+    case ConflictAction::ON_CONFLICT_DO_NOTHING: {
+        return "ON_CONFLICT_DO_NOTHING";
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/drop_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/drop_type.cpp
new file mode 100644
index 0000000000..3ac4ad7630
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/drop_type.cpp
@@ -0,0 +1,20 @@
+#include "common/enums/drop_type.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace common {
+
+std::string DropTypeUtils::toString(DropType type) {
+    switch (type) {
+    case DropType::TABLE:
+        return "Table";
+    case DropType::SEQUENCE:
+        return "Sequence";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/extend_direction_util.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/extend_direction_util.cpp
new file mode 100644
index 0000000000..fc4f249bda
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/extend_direction_util.cpp
@@ -0,0 +1,36 @@
+#include "common/enums/extend_direction_util.h"
+
+#include "common/exception/runtime.h"
+#include "common/string_utils.h"
+
+namespace lbug {
+namespace common {
+
+ExtendDirection ExtendDirectionUtil::fromString(const std::string& str) {
+    auto normalizedString = StringUtils::getUpper(str);
+    if (normalizedString == "FWD") {
+        return ExtendDirection::FWD;
+    } else if (normalizedString == "BWD") {
+        return ExtendDirection::BWD;
+    } else if (normalizedString == "BOTH") {
+        return ExtendDirection::BOTH;
+    } else {
+        throw RuntimeException(stringFormat("Cannot parse {} as ExtendDirection.", str));
+    }
+}
+
+std::string ExtendDirectionUtil::toString(ExtendDirection direction) {
+    switch (direction) {
+    case ExtendDirection::FWD:
+        return "fwd";
+    case ExtendDirection::BWD:
+        return "bwd";
+    case ExtendDirection::BOTH:
+        return "both";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/path_semantic.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/path_semantic.cpp
new file mode 100644
index 0000000000..9ab229e09c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/path_semantic.cpp
@@ -0,0 +1,40 @@
+#include "common/enums/path_semantic.h"
+
+#include "common/assert.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+
+namespace lbug {
+namespace common {
+
+PathSemantic PathSemanticUtils::fromString(const std::string& str) {
+    auto normalizedStr = StringUtils::getUpper(str);
+    if (normalizedStr == "WALK") {
+        return PathSemantic::WALK;
+    }
+    if (normalizedStr == "TRAIL") {
+        return PathSemantic::TRAIL;
+    }
+    if (normalizedStr == "ACYCLIC") {
+        return PathSemantic::ACYCLIC;
+    }
+    throw BinderException(stringFormat(
+        "Cannot parse {} as a path semantic. Supported inputs are [WALK, TRAIL, ACYCLIC]", str));
+}
+
+std::string PathSemanticUtils::toString(PathSemantic semantic) {
+    switch (semantic) {
+    case PathSemantic::WALK:
+        return "WALK";
+    case PathSemantic::TRAIL:
+        return "TRAIL";
+    case PathSemantic::ACYCLIC:
+        return "ACYCLIC";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/query_rel_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/query_rel_type.cpp
new file mode 100644
index 0000000000..fb9f417b46
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/query_rel_type.cpp
@@ -0,0 +1,53 @@
+#include "common/enums/query_rel_type.h"
+
+#include "common/assert.h"
+#include "function/gds/gds_function_collection.h"
+
+using namespace lbug::function;
+
+namespace lbug {
+namespace common {
+
+PathSemantic QueryRelTypeUtils::getPathSemantic(QueryRelType queryRelType) {
+    switch (queryRelType) {
+    case QueryRelType::VARIABLE_LENGTH_WALK:
+        return PathSemantic::WALK;
+    case QueryRelType::VARIABLE_LENGTH_TRAIL:
+        return PathSemantic::TRAIL;
+    case QueryRelType::VARIABLE_LENGTH_ACYCLIC:
+    case QueryRelType::SHORTEST:
+    case QueryRelType::ALL_SHORTEST:
+    case QueryRelType::WEIGHTED_SHORTEST:
+    case QueryRelType::ALL_WEIGHTED_SHORTEST:
+        return PathSemantic::ACYCLIC;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::unique_ptr<function::RJAlgorithm> QueryRelTypeUtils::getFunction(QueryRelType type) {
+    switch (type) {
+    case QueryRelType::VARIABLE_LENGTH_WALK:
+    case QueryRelType::VARIABLE_LENGTH_TRAIL:
+    case QueryRelType::VARIABLE_LENGTH_ACYCLIC: {
+        return VarLenJoinsFunction::getAlgorithm();
+    }
+    case QueryRelType::SHORTEST: {
+        return SingleSPPathsFunction::getAlgorithm();
+    }
+    case QueryRelType::ALL_SHORTEST: {
+        return AllSPPathsFunction::getAlgorithm();
+    }
+    case QueryRelType::WEIGHTED_SHORTEST: {
+        return WeightedSPPathsFunction::getAlgorithm();
+    }
+    case QueryRelType::ALL_WEIGHTED_SHORTEST: {
+        return AllWeightedSPPathsFunction::getAlgorithm();
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/rel_direction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/rel_direction.cpp
new file mode 100644
index 0000000000..310cf9da33
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/rel_direction.cpp
@@ -0,0 +1,44 @@
+#include "common/enums/rel_direction.h"
+
+#include <array>
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace common {
+
+RelDataDirection RelDirectionUtils::getOppositeDirection(RelDataDirection direction) {
+    static constexpr std::array oppositeDirections = {RelDataDirection::BWD, RelDataDirection::FWD};
+    return oppositeDirections[relDirectionToKeyIdx(direction)];
+}
+
+std::string RelDirectionUtils::relDirectionToString(RelDataDirection direction) {
+    static constexpr std::array directionStrs = {"fwd", "bwd"};
+    return directionStrs[relDirectionToKeyIdx(direction)];
+}
+
+idx_t RelDirectionUtils::relDirectionToKeyIdx(RelDataDirection direction) {
+    switch (direction) {
+    case RelDataDirection::FWD:
+        return 0;
+    case RelDataDirection::BWD:
+        return 1;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+table_id_t RelDirectionUtils::getNbrTableID(RelDataDirection direction, table_id_t srcTableID,
+    table_id_t dstTableID) {
+    switch (direction) {
+    case RelDataDirection::FWD:
+        return dstTableID;
+    case RelDataDirection::BWD:
+        return srcTableID;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/rel_multiplicity.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/rel_multiplicity.cpp
new file mode 100644
index 0000000000..2f1a6bef16
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/rel_multiplicity.cpp
@@ -0,0 +1,43 @@
+#include "common/enums/rel_multiplicity.h"
+
+#include "common/assert.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+
+namespace lbug {
+namespace common {
+
+RelMultiplicity RelMultiplicityUtils::getFwd(const std::string& str) {
+    auto normStr = common::StringUtils::getUpper(str);
+    if ("ONE_ONE" == normStr || "ONE_MANY" == normStr) {
+        return RelMultiplicity::ONE;
+    } else if ("MANY_ONE" == normStr || "MANY_MANY" == normStr) {
+        return RelMultiplicity::MANY;
+    }
+    throw BinderException(stringFormat("Cannot bind {} as relationship multiplicity.", str));
+}
+
+RelMultiplicity RelMultiplicityUtils::getBwd(const std::string& str) {
+    auto normStr = common::StringUtils::getUpper(str);
+    if ("ONE_ONE" == normStr || "MANY_ONE" == normStr) {
+        return RelMultiplicity::ONE;
+    } else if ("ONE_MANY" == normStr || "MANY_MANY" == normStr) {
+        return RelMultiplicity::MANY;
+    }
+    throw BinderException(stringFormat("Cannot bind {} as relationship multiplicity.", str));
+}
+
+std::string RelMultiplicityUtils::toString(RelMultiplicity multiplicity) {
+    switch (multiplicity) {
+    case RelMultiplicity::ONE:
+        return "ONE";
+    case RelMultiplicity::MANY:
+        return "MANY";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/scan_source_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/scan_source_type.cpp
new file mode 100644
index 0000000000..84908a2b26
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/scan_source_type.cpp
@@ -0,0 +1,28 @@
+#include "common/enums/scan_source_type.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace common {
+
+std::string ScanSourceTypeUtils::toString(ScanSourceType type) {
+    switch (type) {
+    case ScanSourceType::EMPTY: {
+        return "EMPTY";
+    }
+    case ScanSourceType::FILE: {
+        return "FILE";
+    }
+    case ScanSourceType::OBJECT: {
+        return "OBJECT";
+    }
+    case ScanSourceType::QUERY: {
+        return "QUERY";
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/table_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/table_type.cpp
new file mode 100644
index 0000000000..e68252ff6d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/table_type.cpp
@@ -0,0 +1,28 @@
+#include "common/enums/table_type.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace common {
+
+std::string TableTypeUtils::toString(TableType tableType) {
+    switch (tableType) {
+    case TableType::UNKNOWN: {
+        return "UNKNOWN";
+    }
+    case TableType::NODE: {
+        return "NODE";
+    }
+    case TableType::REL: {
+        return "REL";
+    }
+    case TableType::FOREIGN: {
+        return "ATTACHED";
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/transaction_action.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/transaction_action.cpp
new file mode 100644
index 0000000000..5321b61b08
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/enums/transaction_action.cpp
@@ -0,0 +1,31 @@
+#include "transaction/transaction_action.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace transaction {
+
+std::string TransactionActionUtils::toString(TransactionAction action) {
+    switch (action) {
+    case TransactionAction::BEGIN_READ: {
+        return "BEGIN_READ";
+    }
+    case TransactionAction::BEGIN_WRITE: {
+        return "BEGIN_WRITE";
+    }
+    case TransactionAction::COMMIT: {
+        return "COMMIT";
+    }
+    case TransactionAction::ROLLBACK: {
+        return "ROLLBACK";
+    }
+    case TransactionAction::CHECKPOINT: {
+        return "CHECKPOINT";
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace transaction
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/exception/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/exception/CMakeLists.txt
new file mode 100644
index 0000000000..7f7036a7ad
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/exception/CMakeLists.txt
@@ -0,0 +1,12 @@
+add_library(lbug_common_exception
+        OBJECT
+        exception.cpp
+        message.cpp)
+
+if (ENABLE_BACKTRACES)
+        target_link_libraries(lbug_common_exception PRIVATE cpptrace::cpptrace)
+endif()
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_exception>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/exception/exception.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/exception/exception.cpp
new file mode 100644
index 0000000000..550d1bb567
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/exception/exception.cpp
@@ -0,0 +1,17 @@
+#include "common/exception/exception.h"
+
+#ifdef LBUG_BACKTRACE
+#include <cpptrace/cpptrace.hpp>
+#endif
+
+namespace lbug {
+namespace common {
+
+Exception::Exception(std::string msg) : exception(), exception_message_(std::move(msg)) {
+#ifdef LBUG_BACKTRACE
+    cpptrace::generate_trace(1 /*skip this function's frame*/).print();
+#endif
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/exception/message.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/exception/message.cpp
new file mode 100644
index 0000000000..30570f6d5b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/exception/message.cpp
@@ -0,0 +1,70 @@
+#include "common/exception/message.h"
+
+#include "common/string_format.h"
+
+namespace lbug {
+namespace common {
+
+std::string ExceptionMessage::duplicatePKException(const std::string& pkString) {
+    return stringFormat("Found duplicated primary key value {}, which violates the uniqueness"
+                        " constraint of the primary key column.",
+        pkString);
+}
+
+std::string ExceptionMessage::nonExistentPKException(const std::string& pkString) {
+    return stringFormat("Unable to find primary key value {}.", pkString);
+}
+
+std::string ExceptionMessage::invalidPKType(const std::string& type) {
+    return stringFormat("Invalid primary key column type {}. Primary keys must be either STRING or "
+                        "a numeric type.",
+        type);
+}
+
+std::string ExceptionMessage::nullPKException() {
+    return "Found NULL, which violates the non-null constraint of the primary key column.";
+}
+
+std::string ExceptionMessage::overLargeStringPKValueException(uint64_t length) {
+    return stringFormat("The maximum length of primary key strings is 262144 bytes. The input "
+                        "string's length was {}.",
+        length);
+}
+
+std::string ExceptionMessage::overLargeStringValueException(uint64_t length) {
+    return stringFormat(
+        "The maximum length of strings is 262144 bytes. The input string's length was {}.", length);
+}
+
+std::string ExceptionMessage::violateDeleteNodeWithConnectedEdgesConstraint(
+    const std::string& tableName, const std::string& offset, const std::string& direction) {
+    return stringFormat(
+        "Node(nodeOffset: {}) has connected edges in table {} in the {} direction, "
+        "which cannot be deleted. Please delete the edges first or try DETACH DELETE.",
+        offset, tableName, direction);
+}
+
+std::string ExceptionMessage::violateRelMultiplicityConstraint(const std::string& tableName,
+    const std::string& offset, const std::string& direction) {
+    return stringFormat("Node(nodeOffset: {}) has more than one neighbour in table {} in the {} "
+                        "direction, which violates the rel multiplicity constraint.",
+        offset, tableName, direction);
+}
+
+std::string ExceptionMessage::variableNotInScope(const std::string& varName) {
+    return stringFormat("Variable {} is not in scope.", varName);
+}
+
+std::string ExceptionMessage::listFunctionIncompatibleChildrenType(const std::string& functionName,
+    const std::string& leftType, const std::string& rightType) {
+    return std::string("Cannot bind " + functionName + " with parameter type " + leftType +
+                       " and " + rightType + ".");
+}
+
+std::string ExceptionMessage::invalidSkipLimitParam(const std::string& exprName,
+    const std::string& skipOrLimit) {
+    return stringFormat("Cannot evaluate {} as a valid {} number.", exprName, skipOrLimit);
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/expression_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/expression_type.cpp
new file mode 100644
index 0000000000..4210a3fe07
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/expression_type.cpp
@@ -0,0 +1,136 @@
+#include "common/enums/expression_type.h"
+
+#include "common/assert.h"
+#include "function/comparison/vector_comparison_functions.h"
+
+using namespace lbug::function;
+
+namespace lbug {
+namespace common {
+
+bool ExpressionTypeUtil::isUnary(ExpressionType type) {
+    return ExpressionType::NOT == type || ExpressionType::IS_NULL == type ||
+           ExpressionType::IS_NOT_NULL == type;
+}
+
+bool ExpressionTypeUtil::isBinary(ExpressionType type) {
+    return isComparison(type) || ExpressionType::OR == type || ExpressionType::XOR == type ||
+           ExpressionType::AND == type;
+}
+
+bool ExpressionTypeUtil::isBoolean(ExpressionType type) {
+    return ExpressionType::OR == type || ExpressionType::XOR == type ||
+           ExpressionType::AND == type || ExpressionType::NOT == type;
+}
+
+bool ExpressionTypeUtil::isComparison(ExpressionType type) {
+    return ExpressionType::EQUALS == type || ExpressionType::NOT_EQUALS == type ||
+           ExpressionType::GREATER_THAN == type || ExpressionType::GREATER_THAN_EQUALS == type ||
+           ExpressionType::LESS_THAN == type || ExpressionType::LESS_THAN_EQUALS == type;
+}
+
+bool ExpressionTypeUtil::isNullOperator(ExpressionType type) {
+    return ExpressionType::IS_NULL == type || ExpressionType::IS_NOT_NULL == type;
+}
+
+ExpressionType ExpressionTypeUtil::reverseComparisonDirection(ExpressionType type) {
+    KU_ASSERT(isComparison(type));
+    switch (type) {
+    case ExpressionType::GREATER_THAN:
+        return ExpressionType::LESS_THAN;
+    case ExpressionType::GREATER_THAN_EQUALS:
+        return ExpressionType::LESS_THAN_EQUALS;
+    case ExpressionType::LESS_THAN:
+        return ExpressionType::GREATER_THAN;
+    case ExpressionType::LESS_THAN_EQUALS:
+        return ExpressionType::GREATER_THAN_EQUALS;
+    default:
+        return type;
+    }
+}
+
+// LCOV_EXCL_START
+std::string ExpressionTypeUtil::toString(ExpressionType type) {
+    switch (type) {
+    case ExpressionType::OR:
+        return "OR";
+    case ExpressionType::XOR:
+        return "XOR";
+    case ExpressionType::AND:
+        return "AND";
+    case ExpressionType::NOT:
+        return "NOT";
+    case ExpressionType::EQUALS:
+        return EqualsFunction::name;
+    case ExpressionType::NOT_EQUALS:
+        return NotEqualsFunction::name;
+    case ExpressionType::GREATER_THAN:
+        return GreaterThanFunction::name;
+    case ExpressionType::GREATER_THAN_EQUALS:
+        return GreaterThanEqualsFunction::name;
+    case ExpressionType::LESS_THAN:
+        return LessThanFunction::name;
+    case ExpressionType::LESS_THAN_EQUALS:
+        return LessThanEqualsFunction::name;
+    case ExpressionType::IS_NULL:
+        return "IS_NULL";
+    case ExpressionType::IS_NOT_NULL:
+        return "IS_NOT_NULL";
+    case ExpressionType::PROPERTY:
+        return "PROPERTY";
+    case ExpressionType::LITERAL:
+        return "LITERAL";
+    case ExpressionType::STAR:
+        return "STAR";
+    case ExpressionType::VARIABLE:
+        return "VARIABLE";
+    case ExpressionType::PATH:
+        return "PATH";
+    case ExpressionType::PATTERN:
+        return "PATTERN";
+    case ExpressionType::PARAMETER:
+        return "PARAMETER";
+    case ExpressionType::FUNCTION:
+        return "SCALAR_FUNCTION";
+    case ExpressionType::AGGREGATE_FUNCTION:
+        return "AGGREGATE_FUNCTION";
+    case ExpressionType::SUBQUERY:
+        return "SUBQUERY";
+    case ExpressionType::CASE_ELSE:
+        return "CASE_ELSE";
+    case ExpressionType::GRAPH:
+        return "GRAPH";
+    case ExpressionType::LAMBDA:
+        return "LAMBDA";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::string ExpressionTypeUtil::toParsableString(ExpressionType type) {
+    switch (type) {
+    case ExpressionType::EQUALS:
+        return "=";
+    case ExpressionType::NOT_EQUALS:
+        return "<>";
+    case ExpressionType::GREATER_THAN:
+        return ">";
+    case ExpressionType::GREATER_THAN_EQUALS:
+        return ">=";
+    case ExpressionType::LESS_THAN:
+        return "<";
+    case ExpressionType::LESS_THAN_EQUALS:
+        return "<=";
+    case ExpressionType::IS_NULL:
+        return "IS NULL";
+    case ExpressionType::IS_NOT_NULL:
+        return "IS NOT NULL";
+    default:
+        throw RuntimeException(stringFormat(
+            "ExpressionTypeUtil::toParsableString not implemented for {}", toString(type)));
+    }
+}
+// LCOV_EXCL_STOP
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/CMakeLists.txt
new file mode 100644
index 0000000000..0b91ee771a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/CMakeLists.txt
@@ -0,0 +1,14 @@
+add_library(lbug_file_system
+        OBJECT
+        compressed_file_system.cpp
+        file_info.cpp
+        file_system.cpp
+        local_file_system.cpp
+        virtual_file_system.cpp
+        gzip_file_system.cpp)
+
+target_link_libraries(lbug_file_system Glob)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_file_system>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/compressed_file_system.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/compressed_file_system.cpp
new file mode 100644
index 0000000000..be1f9053f3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/compressed_file_system.cpp
@@ -0,0 +1,123 @@
+#include "common/file_system/compressed_file_system.h"
+
+#include <string.h>
+
+#include "common/exception/io.h"
+
+namespace lbug {
+namespace common {
+
+int64_t CompressedFileSystem::readFile(lbug::common::FileInfo& fileInfo, void* buf,
+    size_t numBytes) const {
+    auto& compressedFileInfo = fileInfo.cast<CompressedFileInfo>();
+    return compressedFileInfo.readData(buf, numBytes);
+}
+
+void CompressedFileSystem::reset(lbug::common::FileInfo& fileInfo) {
+    auto& compressedFileInfo = fileInfo.cast<CompressedFileInfo>();
+    compressedFileInfo.childFileInfo->reset();
+    compressedFileInfo.initialize();
+}
+
+uint64_t CompressedFileSystem::getFileSize(const lbug::common::FileInfo& fileInfo) const {
+    auto& compressedFileInfo = fileInfo.constCast<CompressedFileInfo>();
+    return compressedFileInfo.childFileInfo->getFileSize();
+}
+
+void CompressedFileSystem::syncFile(const lbug::common::FileInfo& fileInfo) const {
+    auto& compressedFileInfo = fileInfo.constCast<CompressedFileInfo>();
+    return compressedFileInfo.childFileInfo->syncFile();
+}
+
+void CompressedFileSystem::readFromFile(FileInfo& /*fileInfo*/, void* /*buffer*/,
+    uint64_t /*numBytes*/, uint64_t /*position*/) const {
+    throw IOException("Only sequential read is allowed in compressed file system.");
+}
+
+void CompressedFileInfo::initialize() {
+    close();
+    streamData.inputBufSize = compressedFS.getInputBufSize();
+    streamData.outputBufSize = compressedFS.getOutputBufSize();
+    streamData.inputBuf = std::make_unique<uint8_t[]>(streamData.inputBufSize);
+    streamData.inputBufStart = streamData.inputBuf.get();
+    streamData.inputBufEnd = streamData.inputBuf.get();
+    streamData.outputBuf = std::make_unique<uint8_t[]>(streamData.outputBufSize);
+    streamData.outputBufStart = streamData.outputBuf.get();
+    streamData.outputBufEnd = streamData.outputBuf.get();
+    currentPos = 0;
+    stream_wrapper = compressedFS.createStream();
+    stream_wrapper->initialize(*this);
+}
+
+int64_t CompressedFileInfo::readData(void* buffer, size_t numBytes) {
+    common::idx_t totalNumBytesRead = 0;
+    while (true) {
+        if (streamData.outputBufStart != streamData.outputBufEnd) {
+            auto available =
+                std::min<idx_t>(numBytes, streamData.outputBufEnd - streamData.outputBufStart);
+            memcpy(reinterpret_cast<uint8_t*>(buffer) + totalNumBytesRead,
+                streamData.outputBufStart, available);
+            streamData.outputBufStart += available;
+            totalNumBytesRead += available;
+            numBytes -= available;
+            if (numBytes == 0) {
+                return totalNumBytesRead;
+            }
+        }
+        if (!stream_wrapper) {
+            return totalNumBytesRead;
+        }
+        currentPos += streamData.inputBufEnd - streamData.inputBufStart;
+        streamData.outputBufStart = streamData.outputBuf.get();
+        streamData.outputBufEnd = streamData.outputBuf.get();
+        if (streamData.refresh &&
+            (streamData.inputBufEnd == streamData.inputBuf.get() + streamData.inputBufSize)) {
+            auto numBytesLeftInBuf = streamData.inputBufEnd - streamData.inputBufStart;
+            memmove(streamData.inputBuf.get(), streamData.inputBufStart, numBytesLeftInBuf);
+            streamData.inputBufStart = streamData.inputBuf.get();
+            auto sz = childFileInfo->readFile(streamData.inputBufStart + numBytesLeftInBuf,
+                streamData.inputBufSize - numBytesLeftInBuf);
+            streamData.inputBufEnd = streamData.inputBufStart + numBytesLeftInBuf + sz;
+            if (sz <= 0) {
+                stream_wrapper.reset();
+                break;
+            }
+        }
+
+        if (streamData.inputBufStart == streamData.inputBufEnd) {
+            streamData.inputBufStart = streamData.inputBuf.get();
+            streamData.inputBufEnd = streamData.inputBufStart;
+            auto sz = childFileInfo->readFile(streamData.inputBuf.get(), streamData.inputBufSize);
+            if (sz <= 0) {
+                stream_wrapper.reset();
+                break;
+            }
+            streamData.inputBufEnd = streamData.inputBufStart + sz;
+        }
+
+        auto finished = stream_wrapper->read(streamData);
+        if (finished) {
+            stream_wrapper.reset();
+        }
+    }
+    return totalNumBytesRead;
+}
+
+void CompressedFileInfo::close() {
+    if (stream_wrapper) {
+        stream_wrapper->close();
+        stream_wrapper.reset();
+    }
+    streamData.inputBuf.reset();
+    streamData.outputBuf.reset();
+    streamData.outputBufStart = nullptr;
+    streamData.outputBufEnd = nullptr;
+    streamData.inputBufStart = nullptr;
+    streamData.inputBufEnd = nullptr;
+    streamData.inputBufSize = 0;
+    streamData.outputBufSize = 0;
+    streamData.refresh = false;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/file_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/file_info.cpp
new file mode 100644
index 0000000000..72355ec266
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/file_info.cpp
@@ -0,0 +1,51 @@
+#include "common/file_system/file_info.h"
+
+#include "common/file_system/file_system.h"
+
+#if defined(_WIN32)
+#include <windows.h>
+#else
+#include <unistd.h>
+#endif
+
+namespace lbug {
+namespace common {
+
+uint64_t FileInfo::getFileSize() const {
+    return fileSystem->getFileSize(*this);
+}
+
+void FileInfo::readFromFile(void* buffer, uint64_t numBytes, uint64_t position) {
+    fileSystem->readFromFile(*this, buffer, numBytes, position);
+}
+
+int64_t FileInfo::readFile(void* buf, size_t nbyte) {
+    return fileSystem->readFile(*this, buf, nbyte);
+}
+
+void FileInfo::writeFile(const uint8_t* buffer, uint64_t numBytes, uint64_t offset) {
+    fileSystem->writeFile(*this, buffer, numBytes, offset);
+}
+
+void FileInfo::syncFile() const {
+    fileSystem->syncFile(*this);
+}
+
+int64_t FileInfo::seek(uint64_t offset, int whence) {
+    return fileSystem->seek(*this, offset, whence);
+}
+
+void FileInfo::reset() {
+    fileSystem->reset(*this);
+}
+
+void FileInfo::truncate(uint64_t size) {
+    fileSystem->truncate(*this, size);
+}
+
+bool FileInfo::canPerformSeek() const {
+    return fileSystem->canPerformSeek();
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/file_system.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/file_system.cpp
new file mode 100644
index 0000000000..4993c106de
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/file_system.cpp
@@ -0,0 +1,72 @@
+#include "common/file_system/file_system.h"
+
+#include "common/string_utils.h"
+
+namespace lbug {
+namespace common {
+
+void FileSystem::overwriteFile(const std::string& /*from*/, const std::string& /*to*/) {
+    KU_UNREACHABLE;
+}
+
+void FileSystem::copyFile(const std::string& /*from*/, const std::string& /*to*/) {
+    KU_UNREACHABLE;
+}
+
+void FileSystem::createDir(const std::string& /*dir*/) const {
+    KU_UNREACHABLE;
+}
+
+void FileSystem::removeFileIfExists(const std::string&, const main::ClientContext* /*context*/) {
+    KU_UNREACHABLE;
+}
+
+bool FileSystem::fileOrPathExists(const std::string& /*path*/, main::ClientContext* /*context*/) {
+    KU_UNREACHABLE;
+}
+
+std::string FileSystem::expandPath(main::ClientContext* /*context*/,
+    const std::string& path) const {
+    return path;
+}
+
+std::string FileSystem::joinPath(const std::string& base, const std::string& part) {
+    return base + "/" + part;
+}
+
+std::string FileSystem::getFileExtension(const std::filesystem::path& path) {
+    auto extension = path.extension();
+    if (isCompressedFile(path)) {
+        extension = path.stem().extension();
+    }
+    return extension.string();
+}
+
+bool FileSystem::isCompressedFile(const std::filesystem::path& path) {
+    return isGZIPCompressed(path);
+}
+
+std::string FileSystem::getFileName(const std::filesystem::path& path) {
+    return path.filename().string();
+}
+
+void FileSystem::writeFile(FileInfo& /*fileInfo*/, const uint8_t* /*buffer*/, uint64_t /*numBytes*/,
+    uint64_t /*offset*/) const {
+    KU_UNREACHABLE;
+}
+
+void FileSystem::truncate(FileInfo& /*fileInfo*/, uint64_t /*size*/) const {
+    KU_UNREACHABLE;
+}
+
+void FileSystem::reset(FileInfo& fileInfo) {
+    fileInfo.seek(0, SEEK_SET);
+}
+
+bool FileSystem::isGZIPCompressed(const std::filesystem::path& path) {
+    auto extensionLowerCase = StringUtils::getLower(path.extension().string());
+    return extensionLowerCase == ".gz" || extensionLowerCase == ".gzip";
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/gzip_file_system.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/gzip_file_system.cpp
new file mode 100644
index 0000000000..b3eb0e5264
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/gzip_file_system.cpp
@@ -0,0 +1,166 @@
+#include "common/file_system/gzip_file_system.h"
+
+#include "common/exception/io.h"
+#include "miniz.hpp"
+
+namespace lbug {
+namespace common {
+
+std::unique_ptr<FileInfo> GZipFileSystem::openCompressedFile(std::unique_ptr<FileInfo> fileInfo) {
+    return std::make_unique<GZIPFileInfo>(*this, std::move(fileInfo));
+}
+
+static idx_t consumeStr(FileInfo& input) {
+    idx_t size = 1; // terminator
+    char buffer[1];
+    while (input.readFile(buffer, 1) == 1) {
+        if (buffer[0] == '\0') {
+            break;
+        }
+        size++;
+    }
+    return size;
+}
+
+struct MiniZStreamWrapper : public StreamWrapper {
+    ~MiniZStreamWrapper() override { MiniZStreamWrapper::close(); }
+
+    CompressedFileInfo* file = nullptr;
+    std::unique_ptr<miniz::mz_stream> mzStreamPtr = nullptr;
+    miniz::mz_ulong crc = 0;
+    idx_t total_size = 0;
+
+public:
+    void initialize(CompressedFileInfo& fileInfo) override;
+
+    bool read(StreamData& stream_data) override;
+
+    void close() override;
+};
+
+static void verifyGZIPHeader(const uint8_t gzip_hdr[], idx_t read_count) {
+    if (read_count != GZipFileSystem::GZIP_HEADER_MINSIZE) {
+        throw IOException("Input is not a GZIP stream.");
+    }
+    if (gzip_hdr[0] != 0x1F || gzip_hdr[1] != 0x8B) {
+        throw IOException("Input is not a GZIP stream.");
+    }
+    if (gzip_hdr[2] != GZipFileSystem::GZIP_COMPRESSION_DEFLATE) {
+        throw IOException("Unsupported GZIP compression method.");
+    }
+    if (gzip_hdr[3] & GZipFileSystem::GZIP_FLAG_UNSUPPORTED) {
+        throw IOException("Unsupported GZIP archive.");
+    }
+}
+
+void MiniZStreamWrapper::initialize(CompressedFileInfo& fileInfo) {
+    close();
+    this->file = &fileInfo;
+    mzStreamPtr = std::make_unique<miniz::mz_stream>();
+    memset(mzStreamPtr.get(), 0, sizeof(miniz::mz_stream));
+    uint8_t gzipHdr[GZipFileSystem::GZIP_HEADER_MINSIZE];
+
+    idx_t dataStart = GZipFileSystem::GZIP_HEADER_MINSIZE;
+    auto numBytesRead =
+        fileInfo.childFileInfo->readFile(gzipHdr, GZipFileSystem::GZIP_HEADER_MINSIZE);
+    verifyGZIPHeader(gzipHdr, numBytesRead);
+    if (gzipHdr[3] & GZipFileSystem::GZIP_FLAG_EXTRA) {
+        uint8_t gzipXLen[2];
+        fileInfo.childFileInfo->seek(dataStart, SEEK_SET);
+        fileInfo.childFileInfo->readFile(gzipXLen, 2);
+        auto xlen = (uint8_t)gzipXLen[0] | (uint8_t)gzipXLen[1] << 8;
+        dataStart += xlen + 2;
+    }
+    if (gzipHdr[3] & GZipFileSystem::GZIP_FLAG_NAME) {
+        fileInfo.childFileInfo->seek(dataStart, SEEK_SET);
+        dataStart += consumeStr(*fileInfo.childFileInfo);
+    }
+    fileInfo.childFileInfo->seek(dataStart, SEEK_SET);
+    auto ret = miniz::mz_inflateInit2(mzStreamPtr.get(), -MZ_DEFAULT_WINDOW_BITS);
+    // LCOV_EXCL_START
+    if (ret != miniz::MZ_OK) {
+        throw InternalException("Failed to initialize miniz");
+    }
+    // LCOV_EXCL_STOP
+}
+
+bool MiniZStreamWrapper::read(StreamData& sd) {
+    if (sd.refresh) {
+        uint32_t available = sd.inputBufEnd - sd.inputBufStart;
+        if (available <= GZipFileSystem::GZIP_FOOTER_SIZE) {
+            close();
+            return true;
+        }
+
+        sd.refresh = false;
+        auto bodyPtr = sd.inputBufStart + GZipFileSystem::GZIP_FOOTER_SIZE;
+        uint8_t gzipHdr[GZipFileSystem::GZIP_HEADER_MINSIZE];
+        memcpy(gzipHdr, bodyPtr, GZipFileSystem::GZIP_HEADER_MINSIZE);
+        verifyGZIPHeader(gzipHdr, GZipFileSystem::GZIP_HEADER_MINSIZE);
+        bodyPtr += GZipFileSystem::GZIP_HEADER_MINSIZE;
+        if (gzipHdr[3] & GZipFileSystem::GZIP_FLAG_EXTRA) {
+            auto xlen = (uint8_t)*bodyPtr | (uint8_t) * (bodyPtr + 1) << 8;
+            bodyPtr += xlen + 2;
+            KU_ASSERT((common::idx_t)(GZipFileSystem::GZIP_FOOTER_SIZE +
+                                      GZipFileSystem::GZIP_HEADER_MINSIZE + 2 + xlen) <
+                      GZipFileSystem::GZIP_HEADER_MAXSIZE);
+        }
+        if (gzipHdr[3] & GZipFileSystem::GZIP_FLAG_NAME) {
+            char c = '\0';
+            do {
+                c = *bodyPtr;
+                bodyPtr++;
+            } while (c != '\0' && bodyPtr < sd.inputBufEnd);
+            KU_ASSERT(bodyPtr - sd.inputBufStart < GZipFileSystem::GZIP_HEADER_MAXSIZE);
+        }
+        sd.inputBufStart = bodyPtr;
+        if (sd.inputBufEnd - sd.inputBufStart < 1) {
+            close();
+            return true;
+        }
+        miniz::mz_inflateEnd(mzStreamPtr.get());
+        auto sta = miniz::mz_inflateInit2(mzStreamPtr.get(), -MZ_DEFAULT_WINDOW_BITS);
+        // LCOV_EXCL_START
+        if (sta != miniz::MZ_OK) {
+            throw InternalException("Failed to initialize miniz");
+        }
+        // LCOV_EXCL_STOP
+    }
+
+    mzStreamPtr->next_in = sd.inputBufStart;
+    mzStreamPtr->avail_in = sd.inputBufEnd - sd.inputBufStart;
+    mzStreamPtr->next_out = sd.outputBufEnd;
+    mzStreamPtr->avail_out = sd.outputBuf.get() + sd.outputBufSize - sd.outputBufEnd;
+    auto ret = miniz::mz_inflate(mzStreamPtr.get(), miniz::MZ_NO_FLUSH);
+    // LCOV_EXCL_START
+    if (ret != miniz::MZ_OK && ret != miniz::MZ_STREAM_END) {
+        throw IOException(
+            common::stringFormat("Failed to decode gzip stream: {}", miniz::mz_error(ret)));
+    }
+    // LCOV_EXCL_STOP
+    sd.inputBufStart = (uint8_t*)mzStreamPtr->next_in;
+    sd.inputBufEnd = sd.inputBufStart + mzStreamPtr->avail_in;
+    sd.outputBufEnd = (uint8_t*)mzStreamPtr->next_out;
+    KU_ASSERT(sd.outputBufEnd + mzStreamPtr->avail_out == sd.outputBuf.get() + sd.outputBufSize);
+
+    if (ret == miniz::MZ_STREAM_END) {
+        sd.refresh = true;
+    }
+    return false;
+}
+
+void MiniZStreamWrapper::close() {
+    if (!mzStreamPtr) {
+        return;
+    }
+    miniz::mz_inflateEnd(mzStreamPtr.get());
+    mzStreamPtr = nullptr;
+    file = nullptr;
+}
+
+std::unique_ptr<StreamWrapper> GZipFileSystem::createStream() {
+    return std::make_unique<MiniZStreamWrapper>();
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/local_file_system.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/local_file_system.cpp
new file mode 100644
index 0000000000..1903b7d465
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/local_file_system.cpp
@@ -0,0 +1,553 @@
+#include "common/file_system/local_file_system.h"
+
+#include "common/assert.h"
+#include "common/exception/io.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+#include "common/system_message.h"
+#include "glob/glob.hpp"
+#include "main/client_context.h"
+#include "main/settings.h"
+
+#if defined(_WIN32)
+#include <sys/stat.h>
+
+#include "common/windows_utils.h"
+#include <fileapi.h>
+#include <io.h>
+#include <windows.h>
+#else
+#include "sys/stat.h"
+#include <unistd.h>
+#endif
+
+#include <fcntl.h>
+
+#include <cstring>
+
+#include "storage/storage_utils.h"
+
+namespace lbug {
+namespace common {
+
+LocalFileInfo::~LocalFileInfo() {
+#ifdef _WIN32
+    if (handle != nullptr) {
+        CloseHandle((HANDLE)handle);
+    }
+#else
+    if (fd != -1) {
+        close(fd);
+    }
+#endif
+}
+
+static void validateFileFlags(uint8_t flags) {
+    const bool isRead = flags & FileFlags::READ_ONLY;
+    const bool isWrite = flags & FileFlags::WRITE;
+    KU_UNUSED(isRead);
+    KU_UNUSED(isWrite);
+    // Require either READ or WRITE (or both).
+    KU_ASSERT(isRead || isWrite);
+    // CREATE flags require writing.
+    KU_ASSERT(isWrite || !(flags & FileFlags::CREATE_IF_NOT_EXISTS));
+    KU_ASSERT(isWrite || !(flags & FileFlags::CREATE_AND_TRUNCATE_IF_EXISTS));
+    // CREATE_IF_NOT_EXISTS and CREATE_AND_TRUNCATE_IF_EXISTS flags cannot be combined.
+    KU_ASSERT(!(flags & FileFlags::CREATE_IF_NOT_EXISTS &&
+                flags & FileFlags::CREATE_AND_TRUNCATE_IF_EXISTS));
+}
+
+std::unique_ptr<FileInfo> LocalFileSystem::openFile(const std::string& path, FileOpenFlags flags,
+    main::ClientContext* context) {
+    auto fullPath = expandPath(context, path);
+    auto fileFlags = flags.flags;
+    validateFileFlags(fileFlags);
+
+    int openFlags = 0;
+    bool readMode = fileFlags & FileFlags::READ_ONLY;
+    bool writeMode = fileFlags & FileFlags::WRITE;
+    if (readMode && writeMode) {
+        openFlags = O_RDWR;
+    } else if (readMode) {
+        openFlags = O_RDONLY;
+    } else if (writeMode) {
+        openFlags = O_WRONLY;
+    } else {
+        // LCOV_EXCL_START
+        throw InternalException("READ, WRITE or both should be specified when opening a file.");
+        // LCOV_EXCL_STOP
+    }
+    if (writeMode) {
+        KU_ASSERT(fileFlags & FileFlags::WRITE);
+        if (fileFlags & FileFlags::CREATE_IF_NOT_EXISTS) {
+            openFlags |= O_CREAT;
+        } else if (fileFlags & FileFlags::CREATE_AND_TRUNCATE_IF_EXISTS) {
+            openFlags |= O_CREAT | O_TRUNC;
+        }
+    }
+
+#if defined(_WIN32)
+    auto dwDesiredAccess = 0ul;
+    int dwCreationDisposition;
+    if (fileFlags & FileFlags::CREATE_IF_NOT_EXISTS) {
+        dwCreationDisposition = OPEN_ALWAYS;
+    } else if (fileFlags & FileFlags::CREATE_AND_TRUNCATE_IF_EXISTS) {
+        dwCreationDisposition = CREATE_ALWAYS;
+    } else {
+        dwCreationDisposition = OPEN_EXISTING;
+    }
+    auto dwShareMode = FILE_SHARE_READ | FILE_SHARE_WRITE | FILE_SHARE_DELETE;
+    if (openFlags & (O_CREAT | O_WRONLY | O_RDWR)) {
+        dwDesiredAccess |= GENERIC_WRITE;
+    }
+    // O_RDONLY is 0 in practice, so openFlags & (O_RDONLY | O_RDWR) doesn't work.
+    if (!(openFlags & O_WRONLY)) {
+        dwDesiredAccess |= GENERIC_READ;
+    }
+    if (openFlags & FileFlags::BINARY) {
+        dwDesiredAccess |= _O_BINARY;
+    }
+
+    HANDLE handle = CreateFileA(fullPath.c_str(), dwDesiredAccess, dwShareMode, nullptr,
+        dwCreationDisposition, FILE_ATTRIBUTE_NORMAL, nullptr);
+    if (handle == INVALID_HANDLE_VALUE) {
+        throw IOException(stringFormat("Cannot open file. path: {} - Error {}: {}", fullPath,
+            GetLastError(), std::system_category().message(GetLastError())));
+    }
+    if (flags.lockType != FileLockType::NO_LOCK) {
+        DWORD dwFlags = flags.lockType == FileLockType::READ_LOCK ?
+                            LOCKFILE_FAIL_IMMEDIATELY :
+                            LOCKFILE_FAIL_IMMEDIATELY | LOCKFILE_EXCLUSIVE_LOCK;
+        OVERLAPPED overlapped = {0};
+        overlapped.Offset = 0;
+        BOOL rc = LockFileEx(handle, dwFlags, 0 /*reserved*/, 1 /*numBytesLow*/, 0 /*numBytesHigh*/,
+            &overlapped);
+        if (!rc) {
+            throw IOException(
+                "Could not set lock on file : " + fullPath + "\n" +
+                "See the docs: https://docs.ladybugdb.com/concurrency for more information.");
+        }
+    }
+    return std::make_unique<LocalFileInfo>(fullPath, handle, this);
+#else
+    int fd = open(fullPath.c_str(), openFlags, 0644);
+    if (fd == -1) {
+        throw IOException(stringFormat("Cannot open file {}: {}", fullPath, posixErrMessage()));
+    }
+    if (flags.lockType != FileLockType::NO_LOCK) {
+        struct flock fl {};
+        memset(&fl, 0, sizeof fl);
+        fl.l_type = flags.lockType == FileLockType::READ_LOCK ? F_RDLCK : F_WRLCK;
+        fl.l_whence = SEEK_SET;
+        fl.l_start = 0;
+        fl.l_len = 0;
+        int rc = fcntl(fd, F_SETLK, &fl);
+        if (rc == -1) {
+            throw IOException(
+                "Could not set lock on file : " + fullPath + "\n" +
+                "See the docs: https://docs.ladybugdb.com/concurrency for more information.");
+        }
+    }
+    return std::make_unique<LocalFileInfo>(fullPath, fd, this);
+#endif
+}
+
+std::vector<std::string> LocalFileSystem::glob(main::ClientContext* context,
+    const std::string& path) const {
+    if (path.empty()) {
+        return std::vector<std::string>();
+    }
+    std::vector<std::string> pathsToGlob;
+    if (path[0] == '/' || (std::isalpha(path[0]) && path[1] == ':')) {
+        // Note:
+        // Unix absolute path starts with '/'
+        // Windows absolute path starts with "[DiskID]://"
+        pathsToGlob.push_back(path);
+    } else if (path[0] == '~') {
+        // Expands home directory
+        auto homeDirectory =
+            context->getCurrentSetting(main::HomeDirectorySetting::name).getValue<std::string>();
+        pathsToGlob.push_back(homeDirectory + path.substr(1));
+    } else {
+        // Relative path to the file search path.
+        auto globbedPaths = glob::glob(path);
+        if (!globbedPaths.empty()) {
+            pathsToGlob.push_back(path);
+        } else {
+            auto fileSearchPath = context->getCurrentSetting(main::FileSearchPathSetting::name)
+                                      .getValue<std::string>();
+            if (fileSearchPath != "") {
+                auto searchPaths = StringUtils::split(fileSearchPath, ",");
+                for (auto& searchPath : searchPaths) {
+                    pathsToGlob.push_back(stringFormat("{}/{}", searchPath, path));
+                }
+            }
+        }
+    }
+    std::vector<std::string> result;
+    for (auto& pathToGlob : pathsToGlob) {
+        for (auto& resultPath : glob::glob(pathToGlob)) {
+            result.emplace_back(resultPath.string());
+        }
+    }
+    return result;
+}
+
+void LocalFileSystem::overwriteFile(const std::string& from, const std::string& to) {
+    if (!fileOrPathExists(from) || !fileOrPathExists(to)) {
+        return;
+    }
+    std::error_code errorCode;
+    if (!std::filesystem::copy_file(from, to, std::filesystem::copy_options::overwrite_existing,
+            errorCode)) {
+        // LCOV_EXCL_START
+        throw IOException(stringFormat("Error copying file {} to {}.  ErrorMessage: {}", from, to,
+            errorCode.message()));
+        // LCOV_EXCL_STOP
+    }
+}
+
+void LocalFileSystem::copyFile(const std::string& from, const std::string& to) {
+    if (!fileOrPathExists(from)) {
+        return;
+    }
+    std::error_code errorCode;
+    if (!std::filesystem::copy_file(from, to, std::filesystem::copy_options::none, errorCode)) {
+        // LCOV_EXCL_START
+        throw IOException(stringFormat("Error copying file {} to {}.  ErrorMessage: {}", from, to,
+            errorCode.message()));
+        // LCOV_EXCL_STOP
+    }
+}
+
+void LocalFileSystem::createDir(const std::string& dir) const {
+    try {
+        if (std::filesystem::exists(dir)) {
+            // LCOV_EXCL_START
+            throw IOException(stringFormat("Directory {} already exists.", dir));
+            // LCOV_EXCL_STOP
+        }
+        auto directoryToCreate = dir;
+        if (directoryToCreate.ends_with('/')
+#if defined(_WIN32)
+            || directoryToCreate.ends_with('\\')
+#endif
+        ) {
+            // This is a known issue with std::filesystem::create_directories. (link:
+            // https://github.com/llvm/llvm-project/issues/60634). We have to manually remove the
+            // last '/' if the path ends with '/'. (Added the second one for windows)
+            directoryToCreate = directoryToCreate.substr(0, directoryToCreate.size() - 1);
+        }
+        std::error_code errCode;
+        if (!std::filesystem::create_directories(directoryToCreate, errCode)) {
+            // LCOV_EXCL_START
+            throw IOException(
+                stringFormat("Directory {} cannot be created. Check if it exists and remove it.",
+                    directoryToCreate));
+            // LCOV_EXCL_STOP
+        }
+        if (errCode) {
+            // LCOV_EXCL_START
+            throw IOException(stringFormat("Failed to create directory: {}, error message: {}.",
+                dir, errCode.message()));
+            // LCOV_EXCL_STOP
+        }
+    } catch (std::exception& e) {
+        // LCOV_EXCL_START
+        throw IOException(stringFormat("Failed to create directory {} due to: {}", dir, e.what()));
+        // LCOV_EXCL_STOP
+    }
+}
+
+static std::unordered_set<std::string> getDatabaseFileSet(const std::string& path) {
+    std::unordered_set<std::string> result;
+    result.insert(storage::StorageUtils::getWALFilePath(path));
+    result.insert(storage::StorageUtils::getShadowFilePath(path));
+    result.insert(storage::StorageUtils::getTmpFilePath(path));
+    return result;
+}
+
+static bool isExtensionFile(const main::ClientContext* context, const std::string& path) {
+    if (context == nullptr) {
+        return false;
+    }
+    auto extensionDir = context->getExtensionDir();
+    std::filesystem::path rel = std::filesystem::relative(path, extensionDir);
+    for (const auto& part : rel) {
+        if (part == "..") {
+            return false;
+        }
+    }
+    return true;
+}
+
+void LocalFileSystem::removeFileIfExists(const std::string& path,
+    const main::ClientContext* context) {
+    if (!fileOrPathExists(path)) {
+        return;
+    }
+    if (!getDatabaseFileSet(dbPath).contains(path) && !isExtensionFile(context, path)) {
+        throw IOException(stringFormat(
+            "Error: Path {} is not within the allowed list of files to be removed.", path));
+    }
+    std::error_code errCode;
+    bool success = false;
+    if (std::filesystem::is_directory(path)) {
+        success = std::filesystem::remove_all(path, errCode);
+    } else {
+        success = std::filesystem::remove(path, errCode);
+    }
+    if (!success) {
+        // LCOV_EXCL_START
+        throw IOException(stringFormat("Error removing directory or file {}.  Error Message: {}",
+            path, errCode.message()));
+        // LCOV_EXCL_STOP
+    }
+}
+
+bool LocalFileSystem::fileOrPathExists(const std::string& path, main::ClientContext* /*context*/) {
+    return std::filesystem::exists(path);
+}
+
+#ifndef _WIN32
+bool LocalFileSystem::fileExists(const std::string& filename) {
+    if (!filename.empty()) {
+        if (access(filename.c_str(), 0) == 0) {
+            struct stat status = {};
+            stat(filename.c_str(), &status);
+            if (S_ISREG(status.st_mode)) {
+                return true;
+            }
+        }
+    }
+    // if any condition fails
+    return false;
+}
+#else
+bool LocalFileSystem::fileExists(const std::string& filename) {
+    auto unicode_path = WindowsUtils::utf8ToUnicode(filename.c_str());
+    const wchar_t* wpath = unicode_path.c_str();
+    if (_waccess(wpath, 0) == 0) {
+        struct _stati64 status = {};
+        _wstati64(wpath, &status);
+        if (status.st_mode & _S_IFREG) {
+            return true;
+        }
+    }
+    return false;
+}
+#endif
+
+std::string LocalFileSystem::expandPath(main::ClientContext* context,
+    const std::string& path) const {
+    auto fullPath = path;
+    if (path.starts_with('~')) {
+        fullPath =
+            context->getCurrentSetting(main::HomeDirectorySetting::name).getValue<std::string>() +
+            fullPath.substr(1);
+    }
+    return fullPath;
+}
+
+bool LocalFileSystem::isLocalPath(const std::string& path) {
+    return path.rfind("s3://", 0) != 0 && path.rfind("gs://", 0) != 0 &&
+           path.rfind("gcs://", 0) != 0 && path.rfind("http://", 0) != 0 &&
+           path.rfind("https://", 0) != 0 && path.rfind("az://", 0) != 0 &&
+           path.rfind("abfss://", 0) != 0;
+}
+
+void LocalFileSystem::readFromFile(FileInfo& fileInfo, void* buffer, uint64_t numBytes,
+    uint64_t position) const {
+    auto localFileInfo = fileInfo.constPtrCast<LocalFileInfo>();
+    KU_ASSERT(localFileInfo->getFileSize() >= position + numBytes);
+#if defined(_WIN32)
+    DWORD numBytesRead;
+    OVERLAPPED overlapped{0, 0, 0, 0};
+    overlapped.Offset = position & 0xffffffff;
+    overlapped.OffsetHigh = position >> 32;
+    if (!ReadFile((HANDLE)localFileInfo->handle, buffer, numBytes, &numBytesRead, &overlapped)) {
+        auto error = GetLastError();
+        throw IOException(
+            stringFormat("Cannot read from file: {} handle: {} "
+                         "numBytesRead: {} numBytesToRead: {} position: {}. Error {}: {}",
+                fileInfo.path, (intptr_t)localFileInfo->handle, numBytesRead, numBytes, position,
+                error, std::system_category().message(error)));
+    }
+    if (numBytesRead != numBytes && fileInfo.getFileSize() != position + numBytesRead) {
+        throw IOException(stringFormat("Cannot read from file: {} handle: {} "
+                                       "numBytesRead: {} numBytesToRead: {} position: {}",
+            fileInfo.path, (intptr_t)localFileInfo->handle, numBytesRead, numBytes, position));
+    }
+#else
+    auto numBytesRead = pread(localFileInfo->fd, buffer, numBytes, position);
+    if (static_cast<uint64_t>(numBytesRead) != numBytes &&
+        localFileInfo->getFileSize() != position + numBytesRead) {
+        // LCOV_EXCL_START
+        throw IOException(stringFormat("Cannot read from file: {} fileDescriptor: {} "
+                                       "numBytesRead: {} numBytesToRead: {} position: {}",
+            fileInfo.path, localFileInfo->fd, numBytesRead, numBytes, position));
+        // LCOV_EXCL_STOP
+    }
+#endif
+}
+
+int64_t LocalFileSystem::readFile(FileInfo& fileInfo, void* buf, size_t nbyte) const {
+    auto localFileInfo = fileInfo.constPtrCast<LocalFileInfo>();
+#if defined(_WIN32)
+    DWORD numBytesRead;
+    ReadFile((HANDLE)localFileInfo->handle, buf, nbyte, &numBytesRead, nullptr);
+    return numBytesRead;
+#else
+    return read(localFileInfo->fd, buf, nbyte);
+#endif
+}
+
+void LocalFileSystem::writeFile(FileInfo& fileInfo, const uint8_t* buffer, uint64_t numBytes,
+    uint64_t offset) const {
+    auto localFileInfo = fileInfo.constPtrCast<LocalFileInfo>();
+    uint64_t remainingNumBytesToWrite = numBytes;
+    uint64_t bufferOffset = 0;
+    // Split large writes to 1GB at a time
+    uint64_t maxBytesToWriteAtOnce = 1ull << 30; // 1ull << 30 = 1G
+    while (remainingNumBytesToWrite > 0) {
+        uint64_t numBytesToWrite = std::min(remainingNumBytesToWrite, maxBytesToWriteAtOnce);
+
+#if defined(_WIN32)
+        DWORD numBytesWritten;
+        OVERLAPPED overlapped{0, 0, 0, 0};
+        overlapped.Offset = offset & 0xffffffff;
+        overlapped.OffsetHigh = offset >> 32;
+        if (!WriteFile((HANDLE)localFileInfo->handle, buffer + bufferOffset, numBytesToWrite,
+                &numBytesWritten, &overlapped)) {
+            auto error = GetLastError();
+            throw IOException(
+                stringFormat("Cannot write to file. path: {} handle: {} offsetToWrite: {} "
+                             "numBytesToWrite: {} numBytesWritten: {}. Error {}: {}.",
+                    fileInfo.path, (intptr_t)localFileInfo->handle, offset, numBytesToWrite,
+                    numBytesWritten, error, std::system_category().message(error)));
+        }
+#else
+        auto numBytesWritten =
+            pwrite(localFileInfo->fd, buffer + bufferOffset, numBytesToWrite, offset);
+        if (numBytesWritten != static_cast<int64_t>(numBytesToWrite)) {
+            // LCOV_EXCL_START
+            throw IOException(
+                stringFormat("Cannot write to file. path: {} fileDescriptor: {} offsetToWrite: {} "
+                             "numBytesToWrite: {} numBytesWritten: {}. Error: {}",
+                    fileInfo.path, localFileInfo->fd, offset, numBytesToWrite, numBytesWritten,
+                    posixErrMessage()));
+            // LCOV_EXCL_STOP
+        }
+#endif
+        remainingNumBytesToWrite -= numBytesWritten;
+        offset += numBytesWritten;
+        bufferOffset += numBytesWritten;
+    }
+}
+
+void LocalFileSystem::syncFile(const FileInfo& fileInfo) const {
+    auto localFileInfo = fileInfo.constPtrCast<LocalFileInfo>();
+#if defined(_WIN32)
+    // Note that `FlushFileBuffers` returns 0 when fails, while `fsync` returns 0 when succeeds.
+    if (FlushFileBuffers((HANDLE)localFileInfo->handle) == 0) {
+        auto error = GetLastError();
+        throw IOException(stringFormat("Failed to sync file {}. Error {}: {}", fileInfo.path, error,
+            std::system_category().message(error)));
+    }
+#else
+#if HAS_FULLFSYNC and defined(__APPLE__)
+    // Try F_FULLFSYNC first on macOS/iOS, which is required to guarantee durability past power
+    // failures.
+    if (fcntl(localFileInfo->fd, F_FULLFSYNC) == 0) {
+        return;
+    }
+    if (errno != ENOTSUP && errno != EINVAL) {
+        // LCOV_EXCL_START
+        if (errno == EIO) {
+            throw IOException("Fatal error: fsync failed!");
+        }
+        throw IOException(
+            stringFormat("Failed to sync file {}: {}", fileInfo.path, posixErrMessage()));
+        // LCOV_EXCL_STOP
+    }
+#endif
+    bool syncSuccess = false;
+#if HAS_FDATASYNC
+    syncSuccess = fdatasync(localFileInfo->fd) == 0; // Only sync file data + essential metadata.
+#else
+    syncSuccess = fsync(localFileInfo->fd) == 0; // Sync file data + all metadata.
+#endif
+    if (!syncSuccess) {
+        throw IOException(stringFormat("Failed to sync file {}.", fileInfo.path));
+    }
+#endif
+}
+
+int64_t LocalFileSystem::seek(FileInfo& fileInfo, uint64_t offset, int whence) const {
+    auto localFileInfo = fileInfo.constPtrCast<LocalFileInfo>();
+#if defined(_WIN32)
+    LARGE_INTEGER result;
+    LARGE_INTEGER offset_;
+    offset_.QuadPart = offset;
+    SetFilePointerEx((HANDLE)localFileInfo->handle, offset_, &result, whence);
+    return result.QuadPart;
+#else
+    return lseek(localFileInfo->fd, offset, whence);
+#endif
+}
+
+void LocalFileSystem::truncate(FileInfo& fileInfo, uint64_t size) const {
+    auto localFileInfo = fileInfo.constPtrCast<LocalFileInfo>();
+#if defined(_WIN32)
+    auto offsetHigh = (LONG)(size >> 32);
+    LONG* offsetHighPtr = NULL;
+    if (offsetHigh > 0)
+        offsetHighPtr = &offsetHigh;
+    if (SetFilePointer((HANDLE)localFileInfo->handle, size & 0xffffffff, offsetHighPtr,
+            FILE_BEGIN) == INVALID_SET_FILE_POINTER) {
+        auto error = GetLastError();
+        throw IOException(stringFormat("Cannot set file pointer for file: {} handle: {} "
+                                       "new position: {}. Error {}: {}",
+            fileInfo.path, (intptr_t)localFileInfo->handle, size, error,
+            std::system_category().message(error)));
+    }
+    if (!SetEndOfFile((HANDLE)localFileInfo->handle)) {
+        auto error = GetLastError();
+        throw IOException(stringFormat("Cannot truncate file: {} handle: {} "
+                                       "size: {}. Error {}: {}",
+            fileInfo.path, (intptr_t)localFileInfo->handle, size, error,
+            std::system_category().message(error)));
+    }
+#else
+    if (ftruncate(localFileInfo->fd, size) < 0) {
+        // LCOV_EXCL_START
+        throw IOException(
+            stringFormat("Failed to truncate file {}: {}", fileInfo.path, posixErrMessage()));
+        // LCOV_EXCL_STOP
+    }
+#endif
+}
+
+uint64_t LocalFileSystem::getFileSize(const FileInfo& fileInfo) const {
+    auto localFileInfo = fileInfo.constPtrCast<LocalFileInfo>();
+#ifdef _WIN32
+    LARGE_INTEGER size;
+    if (!GetFileSizeEx((HANDLE)localFileInfo->handle, &size)) {
+        auto error = GetLastError();
+        throw IOException(stringFormat("Cannot read size of file. path: {} - Error {}: {}",
+            fileInfo.path, error, systemErrMessage(error)));
+    }
+    return size.QuadPart;
+#else
+    struct stat s {};
+    if (fstat(localFileInfo->fd, &s) == -1) {
+        throw IOException(stringFormat("Cannot read size of file. path: {} - Error {}: {}",
+            fileInfo.path, errno, posixErrMessage()));
+    }
+    KU_ASSERT(s.st_size >= 0);
+    return s.st_size;
+#endif
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/virtual_file_system.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/virtual_file_system.cpp
new file mode 100644
index 0000000000..869a7db67a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/file_system/virtual_file_system.cpp
@@ -0,0 +1,139 @@
+#include "common/file_system/virtual_file_system.h"
+
+#include "common/assert.h"
+#include "common/exception/io.h"
+#include "common/file_system/gzip_file_system.h"
+#include "common/file_system/local_file_system.h"
+#include "common/string_utils.h"
+#include "main/client_context.h"
+#include "main/database.h"
+
+namespace lbug {
+namespace common {
+
+VirtualFileSystem::VirtualFileSystem() : VirtualFileSystem{""} {}
+
+VirtualFileSystem::VirtualFileSystem(std::string homeDir) {
+    defaultFS = std::make_unique<LocalFileSystem>(homeDir);
+    compressedFileSystem.emplace(FileCompressionType::GZIP, std::make_unique<GZipFileSystem>());
+}
+
+VirtualFileSystem::~VirtualFileSystem() = default;
+
+void VirtualFileSystem::registerFileSystem(std::unique_ptr<FileSystem> fileSystem) {
+    subSystems.push_back(std::move(fileSystem));
+}
+
+FileCompressionType VirtualFileSystem::autoDetectCompressionType(const std::string& path) {
+    if (isGZIPCompressed(path)) {
+        return FileCompressionType::GZIP;
+    }
+    return FileCompressionType::UNCOMPRESSED;
+}
+
+std::unique_ptr<FileInfo> VirtualFileSystem::openFile(const std::string& path, FileOpenFlags flags,
+    main::ClientContext* context) {
+    auto compressionType = flags.compressionType;
+    if (compressionType == FileCompressionType::AUTO_DETECT) {
+        compressionType = autoDetectCompressionType(path);
+    }
+    auto fileHandle = findFileSystem(path)->openFile(path, flags, context);
+    if (compressionType == FileCompressionType::UNCOMPRESSED) {
+        return fileHandle;
+    }
+    if (flags.flags & FileFlags::WRITE) {
+        throw IOException{"Writing to compressed files is not supported yet."};
+    }
+    if (StringUtils::getLower(getFileExtension(path)) != ".csv") {
+        throw IOException{"Lbug currently only supports reading from compressed csv files."};
+    }
+    return compressedFileSystem.at(compressionType)->openCompressedFile(std::move(fileHandle));
+}
+
+std::vector<std::string> VirtualFileSystem::glob(main::ClientContext* context,
+    const std::string& path) const {
+    return findFileSystem(path)->glob(context, path);
+}
+
+void VirtualFileSystem::overwriteFile(const std::string& from, const std::string& to) {
+    findFileSystem(from)->overwriteFile(from, to);
+}
+
+void VirtualFileSystem::createDir(const std::string& dir) const {
+    findFileSystem(dir)->createDir(dir);
+}
+
+void VirtualFileSystem::removeFileIfExists(const std::string& path,
+    const main::ClientContext* context) {
+    findFileSystem(path)->removeFileIfExists(path, context);
+}
+
+bool VirtualFileSystem::fileOrPathExists(const std::string& path, main::ClientContext* context) {
+    return findFileSystem(path)->fileOrPathExists(path, context);
+}
+
+std::string VirtualFileSystem::expandPath(main::ClientContext* context,
+    const std::string& path) const {
+    return findFileSystem(path)->expandPath(context, path);
+}
+
+void VirtualFileSystem::readFromFile(FileInfo& /*fileInfo*/, void* /*buffer*/,
+    uint64_t /*numBytes*/, uint64_t /*position*/) const {
+    KU_UNREACHABLE;
+}
+
+int64_t VirtualFileSystem::readFile(FileInfo& /*fileInfo*/, void* /*buf*/, size_t /*nbyte*/) const {
+    KU_UNREACHABLE;
+}
+
+void VirtualFileSystem::writeFile(FileInfo& /*fileInfo*/, const uint8_t* /*buffer*/,
+    uint64_t /*numBytes*/, uint64_t /*offset*/) const {
+    KU_UNREACHABLE;
+}
+
+void VirtualFileSystem::syncFile(const FileInfo& fileInfo) const {
+    findFileSystem(fileInfo.path)->syncFile(fileInfo);
+}
+
+void VirtualFileSystem::cleanUP(main::ClientContext* context) {
+    for (auto& subSystem : subSystems) {
+        subSystem->cleanUP(context);
+    }
+    defaultFS->cleanUP(context);
+}
+
+bool VirtualFileSystem::handleFileViaFunction(const std::string& path) const {
+    return findFileSystem(path)->handleFileViaFunction(path);
+}
+
+function::TableFunction VirtualFileSystem::getHandleFunction(const std::string& path) const {
+    return findFileSystem(path)->getHandleFunction(path);
+}
+
+int64_t VirtualFileSystem::seek(FileInfo& /*fileInfo*/, uint64_t /*offset*/, int /*whence*/) const {
+    KU_UNREACHABLE;
+}
+
+void VirtualFileSystem::truncate(FileInfo& /*fileInfo*/, uint64_t /*size*/) const {
+    KU_UNREACHABLE;
+}
+
+uint64_t VirtualFileSystem::getFileSize(const FileInfo& /*fileInfo*/) const {
+    KU_UNREACHABLE;
+}
+
+FileSystem* VirtualFileSystem::findFileSystem(const std::string& path) const {
+    for (auto& subSystem : subSystems) {
+        if (subSystem->canHandleFile(path)) {
+            return subSystem.get();
+        }
+    }
+    return defaultFS.get();
+}
+
+VirtualFileSystem* VirtualFileSystem::GetUnsafe(const main::ClientContext& context) {
+    return context.getDatabase()->getVFS();
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/in_mem_overflow_buffer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/in_mem_overflow_buffer.cpp
new file mode 100644
index 0000000000..b118c77787
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/in_mem_overflow_buffer.cpp
@@ -0,0 +1,69 @@
+#include "common/in_mem_overflow_buffer.h"
+
+#include "common/system_config.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include <bit>
+
+using namespace lbug::storage;
+
+namespace lbug {
+namespace common {
+
+BufferBlock::BufferBlock(std::unique_ptr<storage::MemoryBuffer> block)
+    : currentOffset{0}, block{std::move(block)} {}
+
+BufferBlock::~BufferBlock() = default;
+
+uint64_t BufferBlock::size() const {
+    return block->getBuffer().size();
+}
+
+uint8_t* BufferBlock::data() const {
+    return block->getBuffer().data();
+}
+
+uint8_t* InMemOverflowBuffer::allocateSpace(uint64_t size) {
+    if (requireNewBlock(size)) {
+        if (!blocks.empty() && currentBlock()->currentOffset == 0) {
+            blocks.pop_back();
+        }
+        allocateNewBlock(size);
+    }
+    auto data = currentBlock()->data() + currentBlock()->currentOffset;
+    currentBlock()->currentOffset += size;
+    return data;
+}
+
+void InMemOverflowBuffer::resetBuffer() {
+    if (!blocks.empty()) {
+        // Last block is usually the largest
+        auto lastBlock = std::move(blocks.back());
+        blocks.clear();
+        lastBlock->resetCurrentOffset();
+        blocks.push_back(std::move(lastBlock));
+    }
+}
+
+void InMemOverflowBuffer::preventDestruction() {
+    for (auto& block : blocks) {
+        block->block->preventDestruction();
+    }
+}
+
+void InMemOverflowBuffer::allocateNewBlock(uint64_t size) {
+    std::unique_ptr<BufferBlock> newBlock;
+    if (blocks.empty()) {
+        newBlock = make_unique<BufferBlock>(
+            memoryManager->allocateBuffer(false /* do not initialize to zero */, size));
+    } else {
+        // Use the doubling strategy so that the initial allocations are small, but if we need many
+        // allocations they approach the TEMP_PAGE_SIZE quickly
+        auto min = std::min(TEMP_PAGE_SIZE, std::bit_ceil(currentBlock()->size() * 2));
+        newBlock = make_unique<BufferBlock>(memoryManager->allocateBuffer(
+            false /* do not initialize to zero */, std::max(min, size)));
+    }
+    blocks.push_back(std::move(newBlock));
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/mask.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/mask.cpp
new file mode 100644
index 0000000000..daf440a263
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/mask.cpp
@@ -0,0 +1,24 @@
+#include "common/mask.h"
+
+#include "common/roaring_mask.h"
+
+namespace lbug {
+namespace common {
+
+std::unique_ptr<SemiMask> SemiMaskUtil::createMask(offset_t maxOffset) {
+    if (maxOffset > std::numeric_limits<uint32_t>::max()) {
+        return std::make_unique<Roaring64BitmapSemiMask>(maxOffset);
+    }
+    return std::make_unique<Roaring32BitmapSemiMask>(maxOffset);
+}
+
+offset_t NodeOffsetMaskMap::getNumMaskedNode() const {
+    offset_t numNodes = 0;
+    for (auto& [tableID, mask] : maskMap) {
+        numNodes += mask->getNumMaskedNodes();
+    }
+    return numNodes;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/md5.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/md5.cpp
new file mode 100644
index 0000000000..6dc16e0221
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/md5.cpp
@@ -0,0 +1,233 @@
+/*
+** This code taken from the SQLite test library (can be found at
+** https://www.sqlite.org/sqllogictest/doc/trunk/about.wiki).
+** Originally found on the internet. The original header comment follows this comment.
+** The code has been refactored, but the algorithm stays the same.
+*/
+/*
+ * This code implements the MD5 message-digest algorithm.
+ * The algorithm is due to Ron Rivest.  This code was
+ * written by Colin Plumb in 1993, no copyright is claimed.
+ * This code is in the public domain; do with it what you wish.
+ *
+ * Equivalent code is available from RSA Data Security, Inc.
+ * This code has been tested against that, and is equivalent,
+ * except that you don't need to include two pages of legalese
+ * with every copy.
+ *
+ * To compute the message digest of a chunk of bytes, declare an
+ * MD5Context structure, pass it to MD5Init, call MD5Update as
+ * needed on buffers full of bytes, and then call MD5Final, which
+ * will fill a supplied 16-byte array with the digest.
+ */
+
+#include "common/md5.h"
+
+#include <cstring>
+
+namespace lbug {
+namespace common {
+
+void MD5::byteReverse(unsigned char* buf, unsigned longs) {
+    uint32_t t = 0;
+    do {
+        t = (uint32_t)((unsigned)buf[3] << 8 | buf[2]) << 16 | ((unsigned)buf[1] << 8 | buf[0]);
+        *(uint32_t*)buf = t;
+        buf += 4;
+    } while (--longs);
+}
+
+// The four core functions - F1 is optimized somewhat
+#define F1(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
+#define F2(x, y, z) F1(z, x, y)
+#define F3(x, y, z) ((x) ^ (y) ^ (z))
+#define F4(x, y, z) ((y) ^ ((x) | ~(z)))
+// This is the central step in the MD5 algorithm.
+#define MD5STEP(f, w, x, y, z, data, s)                                                            \
+    ((w) += f(x, y, z) + (data), (w) = (w) << (s) | (w) >> (32 - (s)), (w) += (x))
+
+void MD5::MD5Transform(uint32_t buf[4], const uint32_t in[16]) {
+    uint32_t a = buf[0];
+    uint32_t b = buf[1];
+    uint32_t c = buf[2];
+    uint32_t d = buf[3];
+
+    MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
+    MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
+    MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
+    MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
+    MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
+    MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
+    MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
+    MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
+    MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
+    MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
+    MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
+    MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
+    MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
+    MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
+    MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
+    MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
+
+    MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
+    MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
+    MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
+    MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
+    MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
+    MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
+    MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
+    MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
+    MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
+    MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
+    MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
+    MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
+    MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
+    MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
+    MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
+    MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
+
+    MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
+    MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
+    MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
+    MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
+    MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
+    MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
+    MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
+    MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
+    MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
+    MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
+    MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
+    MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
+    MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
+    MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
+    MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
+    MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
+
+    MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
+    MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
+    MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
+    MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
+    MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
+    MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
+    MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
+    MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
+    MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
+    MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
+    MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
+    MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
+    MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
+    MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
+    MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
+    MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
+
+    buf[0] += a;
+    buf[1] += b;
+    buf[2] += c;
+    buf[3] += d;
+}
+
+void MD5::MD5Init() {
+    ctx.isInit = 1;
+    ctx.buf[0] = 0x67452301;
+    ctx.buf[1] = 0xefcdab89;
+    ctx.buf[2] = 0x98badcfe;
+    ctx.buf[3] = 0x10325476;
+    ctx.bits[0] = 0;
+    ctx.bits[1] = 0;
+}
+
+void MD5::MD5Update(const unsigned char* buf, unsigned int len) {
+    // Update bitcount
+
+    uint32_t t = ctx.bits[0];
+    ctx.bits[0] = t + ((uint32_t)len << 3);
+    if (ctx.bits[0] < t) {
+        ctx.bits[1]++; // Carry from low to high
+    }
+    ctx.bits[1] += len >> 29;
+
+    t = (t >> 3) & 0x3f; // Bytes already in shsInfo->data
+
+    // Handle any leading odd-sized chunks
+
+    if (t) {
+        unsigned char* p = (unsigned char*)ctx.in + t;
+
+        t = 64 - t;
+        if (len < t) {
+            std::memcpy(p, buf, len);
+            return;
+        }
+        std::memcpy(p, buf, t);
+        byteReverse(ctx.in, 16);
+        MD5Transform(ctx.buf, (uint32_t*)ctx.in);
+        buf += t;
+        len -= t;
+    }
+
+    // Process data in 64-byte chunks
+
+    while (len >= 64) {
+        std::memcpy(ctx.in, buf, 64);
+        byteReverse(ctx.in, 16);
+        MD5Transform(ctx.buf, (uint32_t*)ctx.in);
+        buf += 64;
+        len -= 64;
+    }
+
+    // Handle any remaining bytes of data.
+
+    std::memcpy(ctx.in, buf, len);
+}
+
+void MD5::MD5Final(unsigned char digest[16]) {
+    // Compute number of bytes mod 64 */
+    unsigned count = (ctx.bits[0] >> 3) & 0x3F;
+
+    // Set the first char of padding to 0x80.  This is safe since there is
+    // always at least one byte free
+    unsigned char* p = ctx.in + count;
+    *p++ = 0x80;
+
+    // Bytes of padding needed to make 64 bytes
+    count = 64 - 1 - count;
+
+    // Pad out to 56 mod 64
+    if (count < 8) {
+        // Two lots of padding:  Pad the first block to 64 bytes
+        std::memset(p, 0, count);
+        byteReverse(ctx.in, 16);
+        MD5Transform(ctx.buf, (uint32_t*)ctx.in);
+
+        // Now fill the next block with 56 bytes
+        std::memset(ctx.in, 0, 56);
+    } else {
+        // Pad block to 56 bytes */
+        std::memset(p, 0, count - 8);
+    }
+    byteReverse(ctx.in, 14);
+
+    // Append length in bits and transform
+    ((uint32_t*)ctx.in)[14] = ctx.bits[0];
+    ((uint32_t*)ctx.in)[15] = ctx.bits[1];
+
+    MD5Transform(ctx.buf, (uint32_t*)ctx.in);
+    byteReverse((unsigned char*)ctx.buf, 4);
+    std::memcpy(digest, ctx.buf, 16);
+    std::memset(&ctx, 0, sizeof(ctx)); // In case it is sensitive
+}
+
+void MD5::DigestToBase16(const unsigned char* digest, char* zBuf) {
+    static char const zEncode[] = "0123456789abcdef";
+    int i = 0, j = 0;
+
+    for (j = i = 0; i < 16; i++) {
+        int a = digest[i];
+        zBuf[j++] = zEncode[(a >> 4) & 0xf];
+        zBuf[j++] = zEncode[a & 0xf];
+    }
+    zBuf[j] = 0;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/metric.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/metric.cpp
new file mode 100644
index 0000000000..3954cecd44
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/metric.cpp
@@ -0,0 +1,55 @@
+#include "common/metric.h"
+
+namespace lbug {
+namespace common {
+
+TimeMetric::TimeMetric(bool enable) : Metric(enable) {
+    accumulatedTime = 0;
+    isStarted = false;
+    timer = Timer();
+}
+
+void TimeMetric::start() {
+    if (!enabled) {
+        return;
+    }
+    isStarted = true;
+    timer.start();
+}
+
+void TimeMetric::stop() {
+    if (!enabled) {
+        return;
+    }
+    if (!isStarted) {
+        throw Exception("Timer metric has not started.");
+    }
+    timer.stop();
+    accumulatedTime += timer.getDuration();
+    isStarted = false;
+}
+
+double TimeMetric::getElapsedTimeMS() const {
+    return accumulatedTime / 1000;
+}
+
+NumericMetric::NumericMetric(bool enable) : Metric(enable) {
+    accumulatedValue = 0u;
+}
+
+void NumericMetric::increase(uint64_t value) {
+    if (!enabled) {
+        return;
+    }
+    accumulatedValue += value;
+}
+
+void NumericMetric::incrementByOne() {
+    if (!enabled) {
+        return;
+    }
+    accumulatedValue++;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/null_mask.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/null_mask.cpp
new file mode 100644
index 0000000000..7ced00b80a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/null_mask.cpp
@@ -0,0 +1,291 @@
+#include "common/null_mask.h"
+
+#include <algorithm>
+#include <cstring>
+#include <utility>
+
+#include "common/assert.h"
+#include <bit>
+
+namespace lbug {
+namespace common {
+
+void NullMask::setNull(uint64_t* nullEntries, uint32_t pos, bool isNull) {
+    auto entryPos = pos >> NUM_BITS_PER_NULL_ENTRY_LOG2;
+    auto bitPosInEntry = pos - (entryPos << NUM_BITS_PER_NULL_ENTRY_LOG2);
+    if (isNull) {
+        nullEntries[entryPos] |= NULL_BITMASKS_WITH_SINGLE_ONE[bitPosInEntry];
+    } else {
+        nullEntries[entryPos] &= NULL_BITMASKS_WITH_SINGLE_ZERO[bitPosInEntry];
+    }
+}
+
+bool NullMask::copyNullMask(const uint64_t* srcNullEntries, uint64_t srcOffset,
+    uint64_t* dstNullEntries, uint64_t dstOffset, uint64_t numBitsToCopy, bool invert) {
+    // From benchmarks using setNull/isNull is faster for up to 3 bits
+    // (~4x faster for a single bit copy)
+    if (numBitsToCopy <= 3) {
+        bool anyNull = false;
+        for (size_t i = 0; i < numBitsToCopy; i++) {
+            bool isNull = NullMask::isNull(srcNullEntries, srcOffset + i);
+            NullMask::setNull(dstNullEntries, dstOffset + i, isNull ^ invert);
+            anyNull |= isNull;
+        }
+        return anyNull;
+    }
+    // If both offsets are aligned relative to each other then copy up to the first byte using the
+    // non-aligned method, then copy aligned, then copy the end unaligned again.
+    if (!invert && (srcOffset % 8 == dstOffset % 8) && numBitsToCopy >= 8 &&
+        numBitsToCopy - (srcOffset % 8) >= 8) {
+        auto numBitsInFirstByte = 0;
+        bool hasNullInSrcNullMask = false;
+        if (srcOffset != 0) {
+            numBitsInFirstByte = 8 - (srcOffset % 8);
+            if (copyUnaligned(srcNullEntries, srcOffset, dstNullEntries, dstOffset,
+                    numBitsInFirstByte, false)) {
+                hasNullInSrcNullMask = true;
+            }
+        }
+        auto* src =
+            reinterpret_cast<const uint8_t*>(srcNullEntries) + (srcOffset + numBitsInFirstByte) / 8;
+        auto* dst =
+            reinterpret_cast<uint8_t*>(dstNullEntries) + (dstOffset + numBitsInFirstByte) / 8;
+        auto numBytesForAlignedCopy = (numBitsToCopy - numBitsInFirstByte) / 8;
+        memcpy(dst, src, numBytesForAlignedCopy);
+        if (std::any_of(src, src + numBytesForAlignedCopy, [&](uint8_t val) { return val != 0; })) {
+            hasNullInSrcNullMask = true;
+        }
+        auto lastByteStart = numBitsInFirstByte + numBytesForAlignedCopy * 8;
+        auto numBitsInLastByte = numBitsToCopy - numBitsInFirstByte - numBytesForAlignedCopy * 8;
+        if (numBitsInLastByte > 0) {
+            return copyUnaligned(srcNullEntries, srcOffset + lastByteStart, dstNullEntries,
+                       dstOffset + lastByteStart, numBitsInLastByte, false) ||
+                   hasNullInSrcNullMask;
+        } else {
+            return hasNullInSrcNullMask;
+        }
+    } else {
+        return copyUnaligned(srcNullEntries, srcOffset, dstNullEntries, dstOffset, numBitsToCopy,
+            invert);
+    }
+}
+
+bool NullMask::copyUnaligned(const uint64_t* srcNullEntries, uint64_t srcOffset,
+    uint64_t* dstNullEntries, uint64_t dstOffset, uint64_t numBitsToCopy, bool invert) {
+    uint64_t bitPos = 0;
+    bool hasNullInSrcNullMask = false;
+    auto [srcNullEntryPos, srcNullBitPos] = getNullEntryAndBitPos(srcOffset + bitPos);
+    auto [dstNullEntryPos, dstNullBitPos] = getNullEntryAndBitPos(dstOffset + bitPos);
+    while (bitPos < numBitsToCopy) {
+        auto curDstNullEntryPos = dstNullEntryPos;
+        auto curDstNullBitPos = dstNullBitPos;
+        uint64_t numBitsToReadInCurrentEntry = 0;
+        uint64_t srcNullMaskEntry =
+            invert ? ~srcNullEntries[srcNullEntryPos] : srcNullEntries[srcNullEntryPos];
+        if (dstNullBitPos < srcNullBitPos) {
+            numBitsToReadInCurrentEntry =
+                std::min(NullMask::NUM_BITS_PER_NULL_ENTRY - srcNullBitPos, numBitsToCopy - bitPos);
+            // Mask higher bits out of current read range to 0.
+            srcNullMaskEntry &= ~NULL_HIGH_MASKS[NullMask::NUM_BITS_PER_NULL_ENTRY -
+                                                 (srcNullBitPos + numBitsToReadInCurrentEntry)];
+            // Shift right to align the bit in the src and dst entry.
+            srcNullMaskEntry = srcNullMaskEntry >> (srcNullBitPos - dstNullBitPos);
+            // Mask lower bits out of current read range to 0.
+            srcNullMaskEntry &= ~NULL_LOWER_MASKS[dstNullBitPos];
+            // Move to the next null entry in src null mask.
+            srcNullEntryPos++;
+            srcNullBitPos = 0;
+            dstNullBitPos += numBitsToReadInCurrentEntry;
+        } else if (dstNullBitPos > srcNullBitPos) {
+            numBitsToReadInCurrentEntry =
+                std::min(NullMask::NUM_BITS_PER_NULL_ENTRY - dstNullBitPos, numBitsToCopy - bitPos);
+            // Mask lower bits out of current read range to 0.
+            srcNullMaskEntry &= ~NULL_LOWER_MASKS[srcNullBitPos];
+            // Shift left to align the bit in the src and dst entry.
+            srcNullMaskEntry = srcNullMaskEntry << (dstNullBitPos - srcNullBitPos);
+            // Mask higher bits out of current read range to 0.
+            srcNullMaskEntry &= ~NULL_HIGH_MASKS[NullMask::NUM_BITS_PER_NULL_ENTRY -
+                                                 (dstNullBitPos + numBitsToReadInCurrentEntry)];
+            // Move to the next null entry in dst null mask.
+            dstNullEntryPos++;
+            dstNullBitPos = 0;
+            srcNullBitPos += numBitsToReadInCurrentEntry;
+        } else {
+            numBitsToReadInCurrentEntry =
+                std::min(NullMask::NUM_BITS_PER_NULL_ENTRY - dstNullBitPos, numBitsToCopy - bitPos);
+            // Mask lower bits out of current read range to 0.
+            srcNullMaskEntry &= ~NULL_LOWER_MASKS[srcNullBitPos];
+            // Mask higher bits out of current read range to 0.
+            srcNullMaskEntry &= ~NULL_HIGH_MASKS[NullMask::NUM_BITS_PER_NULL_ENTRY -
+                                                 (dstNullBitPos + numBitsToReadInCurrentEntry)];
+            // The input entry and the result entry are already aligned.
+            srcNullEntryPos++;
+            dstNullEntryPos++;
+            srcNullBitPos = dstNullBitPos = 0;
+        }
+        bitPos += numBitsToReadInCurrentEntry;
+        dstNullEntries[curDstNullEntryPos] &=
+            ~(NULL_LOWER_MASKS[numBitsToReadInCurrentEntry] << curDstNullBitPos);
+        if (srcNullMaskEntry != 0) {
+            dstNullEntries[curDstNullEntryPos] |= srcNullMaskEntry;
+            hasNullInSrcNullMask = true;
+        }
+    }
+    return hasNullInSrcNullMask;
+}
+
+void NullMask::resize(uint64_t capacity) {
+    auto numNullEntries = (capacity + NUM_BITS_PER_NULL_ENTRY - 1) / NUM_BITS_PER_NULL_ENTRY;
+    auto resizedBuffer = std::make_unique<uint64_t[]>(numNullEntries);
+    memcpy(resizedBuffer.get(), data.data(), data.size_bytes());
+    buffer = std::move(resizedBuffer);
+    data = std::span(buffer.get(), numNullEntries);
+}
+
+bool NullMask::copyFromNullBits(const uint64_t* srcNullEntries, uint64_t srcOffset,
+    uint64_t dstOffset, uint64_t numBitsToCopy, bool invert) {
+    KU_ASSERT(dstOffset + numBitsToCopy <= getNumNullBits(data));
+    if (copyNullMask(srcNullEntries, srcOffset, this->data.data(), dstOffset, numBitsToCopy,
+            invert)) {
+        this->mayContainNulls = true;
+        return true;
+    }
+    return false;
+}
+
+void NullMask::setNullFromRange(uint64_t offset, uint64_t numBitsToSet, bool isNull) {
+    if (isNull) {
+        this->mayContainNulls = true;
+    }
+    KU_ASSERT(offset + numBitsToSet <= getNumNullBits(data));
+    setNullRange(data.data(), offset, numBitsToSet, isNull);
+}
+
+void NullMask::setNullRange(uint64_t* nullEntries, uint64_t offset, uint64_t numBitsToSet,
+    bool isNull) {
+    if (numBitsToSet == 0) {
+        return;
+    }
+
+    auto [firstEntryPos, firstBitPos] = getNullEntryAndBitPos(offset);
+    auto [lastEntryPos, lastBitPos] = getNullEntryAndBitPos(offset + numBitsToSet);
+
+    // If the range spans multiple entries, set the entries in the middle to the appropriate value
+    // with std::fill
+    if (lastEntryPos > firstEntryPos + 1) {
+        std::fill(nullEntries + firstEntryPos + 1, nullEntries + lastEntryPos,
+            isNull ? ALL_NULL_ENTRY : NO_NULL_ENTRY);
+    }
+
+    if (firstEntryPos == lastEntryPos) {
+        if (isNull) {
+            // Set bits between the first and the last bit pos to true
+            nullEntries[firstEntryPos] |= (~NULL_LOWER_MASKS[firstBitPos] &
+                                           ~NULL_HIGH_MASKS[NUM_BITS_PER_NULL_ENTRY - lastBitPos]);
+        } else {
+            // Set bits between the first and the last bit pos to false
+            nullEntries[firstEntryPos] &= (NULL_LOWER_MASKS[firstBitPos] |
+                                           NULL_HIGH_MASKS[NUM_BITS_PER_NULL_ENTRY - lastBitPos]);
+        }
+    } else {
+        if (isNull) {
+            // Set bits including and after the first bit pos to true
+            nullEntries[firstEntryPos] |= ~NULL_LOWER_MASKS[firstBitPos];
+            if (lastBitPos > 0) {
+                // Set bits before the last bit pos to true
+                nullEntries[lastEntryPos] |= NULL_LOWER_MASKS[lastBitPos];
+            }
+        } else {
+            // Set bits including and after the first bit pos to false
+            nullEntries[firstEntryPos] &= NULL_LOWER_MASKS[firstBitPos];
+            if (lastBitPos > 0) {
+                // Set bits before the last bit pos to false
+                nullEntries[lastEntryPos] &= ~NULL_LOWER_MASKS[lastBitPos];
+            }
+        }
+    }
+}
+
+void NullMask::operator|=(const NullMask& other) {
+    KU_ASSERT(other.data.size() == data.size());
+    for (size_t i = 0; i < data.size(); i++) {
+        data[i] |= other.getData()[i];
+    }
+}
+
+std::pair<bool, bool> NullMask::getMinMax(const uint64_t* nullEntries, uint64_t offset,
+    uint64_t numValues) {
+    nullEntries += offset / NUM_BITS_PER_NULL_ENTRY;
+    offset = offset % NUM_BITS_PER_NULL_ENTRY;
+
+    // If the offset+numValues are both within a word, just combine the appropriate masks and
+    // compare to 0/mask to determine if they are all 1s/all 0s (else a mix)
+    if (offset + numValues <= NUM_BITS_PER_NULL_ENTRY) {
+        auto mask = NULL_HIGH_MASKS[NUM_BITS_PER_NULL_ENTRY - offset] &
+                    NULL_LOWER_MASKS[offset + numValues];
+        auto masked = *nullEntries & mask;
+        if (masked == 0) {
+            return std::make_pair(false, false);
+        } else if (masked == mask) {
+            return std::make_pair(true, true);
+        } else {
+            return std::make_pair(false, true);
+        }
+    }
+    // If the range spans multiple entries, check the first one by masking the start
+    bool min = false, max = false;
+    if (offset > 0) {
+        auto mask = NULL_HIGH_MASKS[NUM_BITS_PER_NULL_ENTRY - offset];
+        auto masked = *nullEntries & mask;
+        if (masked == 0) {
+            min = max = false;
+        } else if (masked == mask) {
+            min = max = true;
+        } else {
+            return std::make_pair(false, true);
+        }
+        nullEntries++;
+        numValues -= NUM_BITS_PER_NULL_ENTRY - offset;
+    } else {
+        // Rest of the entry will be checked in the loop below
+        min = max = isNull(nullEntries, 0);
+    }
+
+    // Check central full bytes, which can be compared in a single operation since we don't ignore
+    // any bits If there was no offset, then we calculate the baseline based on the first bit, and
+    // compare that to the actual entry
+    auto baseline = min ? ~static_cast<uint64_t>(0) : 0;
+    for (size_t i = 0; i < numValues / NUM_BITS_PER_NULL_ENTRY; i++) {
+        if (nullEntries[i] != baseline) {
+            return std::make_pair(false, true);
+        }
+    }
+    nullEntries += numValues / NUM_BITS_PER_NULL_ENTRY;
+    numValues = numValues % NUM_BITS_PER_NULL_ENTRY;
+    if (numValues > 0) {
+        // Check last entry
+        auto mask = NULL_LOWER_MASKS[numValues];
+        auto masked = *nullEntries & mask;
+        if (masked == 0) {
+            return std::make_pair(false, max);
+        } else if (masked == mask) {
+            return std::make_pair(min, true);
+        } else {
+            return std::make_pair(false, true);
+        }
+    }
+    return std::make_pair(min, max);
+}
+
+uint64_t NullMask::countNulls() const {
+    // If capacity % 64 != 0 then there may be unused bits at the end of the last entry,
+    // but these should always be 0.
+    uint64_t sum = 0;
+    for (auto entry : data) {
+        sum += std::popcount(entry);
+    }
+    return sum;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/profiler.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/profiler.cpp
new file mode 100644
index 0000000000..973468f167
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/profiler.cpp
@@ -0,0 +1,51 @@
+#include "common/profiler.h"
+
+namespace lbug {
+namespace common {
+
+TimeMetric* Profiler::registerTimeMetric(const std::string& key) {
+    auto timeMetric = std::make_unique<TimeMetric>(enabled);
+    auto metricPtr = timeMetric.get();
+    addMetric(key, std::move(timeMetric));
+    return metricPtr;
+}
+
+NumericMetric* Profiler::registerNumericMetric(const std::string& key) {
+    auto numericMetric = std::make_unique<NumericMetric>(enabled);
+    auto metricPtr = numericMetric.get();
+    addMetric(key, std::move(numericMetric));
+    return metricPtr;
+}
+
+double Profiler::sumAllTimeMetricsWithKey(const std::string& key) {
+    auto sum = 0.0;
+    if (!metrics.contains(key)) {
+        return sum;
+    }
+    for (auto& metric : metrics.at(key)) {
+        sum += ((TimeMetric*)metric.get())->getElapsedTimeMS();
+    }
+    return sum;
+}
+
+uint64_t Profiler::sumAllNumericMetricsWithKey(const std::string& key) {
+    auto sum = 0ul;
+    if (!metrics.contains(key)) {
+        return sum;
+    }
+    for (auto& metric : metrics.at(key)) {
+        sum += ((NumericMetric*)metric.get())->accumulatedValue;
+    }
+    return sum;
+}
+
+void Profiler::addMetric(const std::string& key, std::unique_ptr<Metric> metric) {
+    std::lock_guard<std::mutex> lck(mtx);
+    if (!metrics.contains(key)) {
+        metrics.insert({key, std::vector<std::unique_ptr<Metric>>()});
+    }
+    metrics.at(key).push_back(std::move(metric));
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/random_engine.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/random_engine.cpp
new file mode 100644
index 0000000000..9f991e83c2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/random_engine.cpp
@@ -0,0 +1,38 @@
+#include "common/random_engine.h"
+
+#include <random>
+
+#include "main/client_context.h"
+
+namespace lbug {
+namespace common {
+
+RandomEngine::RandomEngine() : randomState(RandomState()) {
+    randomState.pcg.seed(pcg_extras::seed_seq_from<std::random_device>());
+}
+
+RandomEngine::RandomEngine(uint64_t seed, uint64_t stream) : randomState(RandomState()) {
+    randomState.pcg.seed(seed, stream);
+}
+
+void RandomEngine::setSeed(uint64_t seed) {
+    std::unique_lock xLck{mtx};
+    randomState.pcg.seed(seed);
+}
+
+uint32_t RandomEngine::nextRandomInteger() {
+    std::unique_lock xLck{mtx};
+    return randomState.pcg();
+}
+
+uint32_t RandomEngine::nextRandomInteger(uint32_t upper) {
+    std::unique_lock xLck{mtx};
+    return randomState.pcg(upper);
+}
+
+RandomEngine* RandomEngine::Get(const main::ClientContext& context) {
+    return context.randomEngine.get();
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/roaring_mask.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/roaring_mask.cpp
new file mode 100644
index 0000000000..2a5876cea1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/roaring_mask.cpp
@@ -0,0 +1,63 @@
+#include "common/roaring_mask.h"
+
+namespace lbug {
+namespace common {
+
+offset_vec_t Roaring32BitmapSemiMask::collectMaskedNodes(uint64_t size) const {
+    offset_vec_t result;
+    result.reserve(size);
+    auto it = roaring->begin();
+    for (; it != roaring->end(); it++) {
+        auto value = *it;
+        result.push_back(value);
+        if (result.size() == size) {
+            break;
+        }
+    }
+    return result;
+}
+
+offset_vec_t Roaring32BitmapSemiMask::range(uint32_t start, uint32_t end) {
+    auto it = roaring->begin();
+    it.equalorlarger(start);
+    offset_vec_t ans;
+    for (; it != roaring->end(); it++) {
+        auto value = *it;
+        if (value >= end) {
+            break;
+        }
+        ans.push_back(value);
+    }
+    return ans;
+}
+
+offset_vec_t Roaring64BitmapSemiMask::collectMaskedNodes(uint64_t size) const {
+    offset_vec_t result;
+    result.reserve(size);
+    auto it = roaring->begin();
+    for (; it != roaring->end(); it++) {
+        auto value = *it;
+        result.push_back(value);
+        if (result.size() == size) {
+            break;
+        }
+    }
+    return result;
+}
+
+offset_vec_t Roaring64BitmapSemiMask::range(uint32_t start, uint32_t end) {
+    auto it = roaring->begin();
+    it.move(start);
+    offset_vec_t ans;
+    for (; it != roaring->end(); it++) {
+        auto value = *it;
+        if (value >= end) {
+            break;
+        }
+        ans.push_back(value);
+    }
+    return ans;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/CMakeLists.txt
new file mode 100644
index 0000000000..8a8fba4f80
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/CMakeLists.txt
@@ -0,0 +1,11 @@
+add_library(lbug_common_serializer
+        OBJECT
+        buffer_writer.cpp
+        buffered_file.cpp
+        deserializer.cpp
+        in_mem_file_writer.cpp
+        serializer.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_serializer>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/buffer_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/buffer_writer.cpp
new file mode 100644
index 0000000000..4545bd134e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/buffer_writer.cpp
@@ -0,0 +1,30 @@
+#include "common/serializer/buffer_writer.h"
+
+#include <cstring>
+
+namespace lbug {
+namespace common {
+
+BufferWriter::BufferWriter(uint64_t maximumSize) : maximumSize(maximumSize) {
+    blob.data = std::make_unique<uint8_t[]>(maximumSize);
+    blob.size = 0;
+    data = blob.data.get();
+}
+
+void BufferWriter::write(const uint8_t* buffer, uint64_t len) {
+    if (blob.size + len >= maximumSize) {
+        do {
+            maximumSize *= 2;
+        } while (blob.size + len > maximumSize);
+        auto new_data = std::make_unique<uint8_t[]>(maximumSize);
+        memcpy(new_data.get(), data, blob.size);
+        data = new_data.get();
+        blob.data = std::move(new_data);
+    }
+
+    memcpy(data + blob.size, buffer, len);
+    blob.size += len;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/buffered_file.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/buffered_file.cpp
new file mode 100644
index 0000000000..3ccd794623
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/buffered_file.cpp
@@ -0,0 +1,114 @@
+#include "common/serializer/buffered_file.h"
+
+#include <cstring>
+
+#include "common/assert.h"
+#include "common/exception/runtime.h"
+#include "common/file_system/file_info.h"
+#include "common/system_config.h"
+
+namespace lbug {
+namespace common {
+
+static constexpr uint64_t BUFFER_SIZE = LBUG_PAGE_SIZE;
+
+BufferedFileWriter::BufferedFileWriter(FileInfo& fileInfo)
+    : buffer(std::make_unique<uint8_t[]>(BUFFER_SIZE)), fileOffset(0), bufferOffset(0),
+      fileInfo(fileInfo) {}
+
+BufferedFileWriter::~BufferedFileWriter() {
+    flush();
+}
+
+void BufferedFileWriter::write(const uint8_t* data, uint64_t size) {
+    if (size > BUFFER_SIZE) {
+        flush();
+        fileInfo.writeFile(data, size, fileOffset);
+        fileOffset += size;
+        return;
+    }
+    KU_ASSERT(size <= BUFFER_SIZE);
+    if (bufferOffset + size <= BUFFER_SIZE) {
+        memcpy(&buffer[bufferOffset], data, size);
+        bufferOffset += size;
+    } else {
+        auto toCopy = BUFFER_SIZE - bufferOffset;
+        memcpy(&buffer[bufferOffset], data, toCopy);
+        bufferOffset += toCopy;
+        flush();
+        auto remaining = size - toCopy;
+        memcpy(buffer.get(), data + toCopy, remaining);
+        bufferOffset += remaining;
+    }
+}
+
+void BufferedFileWriter::clear() {
+    fileInfo.truncate(0);
+    resetOffsets();
+}
+
+void BufferedFileWriter::flush() {
+    if (bufferOffset == 0) {
+        return;
+    }
+    fileInfo.writeFile(buffer.get(), bufferOffset, fileOffset);
+    fileOffset += bufferOffset;
+    bufferOffset = 0;
+    memset(buffer.get(), 0, BUFFER_SIZE);
+}
+
+void BufferedFileWriter::sync() {
+    fileInfo.syncFile();
+}
+
+uint64_t BufferedFileWriter::getSize() const {
+    return fileInfo.getFileSize() + bufferOffset;
+}
+
+BufferedFileReader::BufferedFileReader(FileInfo& fileInfo)
+    : buffer(std::make_unique<uint8_t[]>(BUFFER_SIZE)), fileOffset(0), bufferOffset(0),
+      fileInfo(fileInfo), bufferSize{0} {
+    fileSize = this->fileInfo.getFileSize();
+    readNextPage();
+}
+
+void BufferedFileReader::read(uint8_t* data, uint64_t size) {
+    if (size > BUFFER_SIZE) {
+        // Clear read buffer.
+        fileOffset -= bufferSize;
+        fileOffset += bufferOffset;
+        fileInfo.readFromFile(data, size, fileOffset);
+        fileOffset += size;
+        bufferOffset = bufferSize;
+    } else if (bufferOffset + size <= bufferSize) {
+        memcpy(data, &buffer[bufferOffset], size);
+        bufferOffset += size;
+    } else {
+        auto toCopy = bufferSize - bufferOffset;
+        memcpy(data, &buffer[bufferOffset], toCopy);
+        bufferOffset += toCopy;
+        readNextPage();
+        auto remaining = size - toCopy;
+        memcpy(data + toCopy, buffer.get(), remaining);
+        bufferOffset += remaining;
+    }
+}
+
+bool BufferedFileReader::finished() {
+    return bufferOffset >= bufferSize && fileSize <= fileOffset;
+}
+
+void BufferedFileReader::readNextPage() {
+    if (fileSize <= fileOffset) {
+        throw RuntimeException(
+            stringFormat("Reading past the end of the file {} with size {} at offset {}",
+                fileInfo.path, fileSize, fileOffset));
+    }
+    bufferSize = std::min(fileSize - fileOffset, BUFFER_SIZE);
+    fileInfo.readFromFile(buffer.get(), bufferSize, fileOffset);
+    fileOffset += bufferSize;
+    bufferOffset = 0;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/deserializer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/deserializer.cpp
new file mode 100644
index 0000000000..e2512f4a5c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/deserializer.cpp
@@ -0,0 +1,25 @@
+#include "common/serializer/deserializer.h"
+
+namespace lbug {
+namespace common {
+
+template<>
+void Deserializer::deserializeValue(std::string& value) {
+    uint64_t valueLength = 0;
+    deserializeValue(valueLength);
+    value.resize(valueLength);
+    reader->read(reinterpret_cast<uint8_t*>(value.data()), valueLength);
+}
+
+void Deserializer::validateDebuggingInfo(std::string& value, const std::string& expectedVal) {
+#if defined(LBUG_DESER_DEBUG) && (defined(LBUG_RUNTIME_CHECKS) || !defined(NDEBUG))
+    deserializeValue<std::string>(value);
+    KU_ASSERT(value == expectedVal);
+#endif
+    // DO NOTHING
+    KU_UNUSED(value);
+    KU_UNUSED(expectedVal);
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/in_mem_file_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/in_mem_file_writer.cpp
new file mode 100644
index 0000000000..dfee92209f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/in_mem_file_writer.cpp
@@ -0,0 +1,83 @@
+#include "common/serializer/in_mem_file_writer.h"
+
+#include "storage/file_handle.h"
+#include "storage/shadow_file.h"
+#include "storage/shadow_utils.h"
+
+namespace lbug {
+namespace common {
+
+InMemFileWriter::InMemFileWriter(storage::MemoryManager& mm) : mm{mm}, pageOffset{0} {}
+
+void InMemFileWriter::write(const uint8_t* data, uint64_t size) {
+    auto remaining = size;
+    while (remaining > 0) {
+        if (needNewBuffer(size)) {
+            const auto lastPage = pages.empty() ? nullptr : pages.back().get();
+            if (lastPage) {
+                auto toCopy = std::min(size, LBUG_PAGE_SIZE - pageOffset);
+                memcpy(lastPage->getData() + pageOffset, data + (size - remaining), toCopy);
+                remaining -= toCopy;
+            }
+            pages.push_back(mm.allocateBuffer(false, LBUG_PAGE_SIZE));
+            pageOffset = 0;
+        }
+        auto toCopy = std::min(remaining, LBUG_PAGE_SIZE - pageOffset);
+        memcpy(pages.back()->getData() + pageOffset, data + (size - remaining), toCopy);
+        pageOffset += toCopy;
+        remaining -= toCopy;
+    }
+}
+
+storage::PageRange InMemFileWriter::flush(storage::PageAllocator& pageAllocator,
+    storage::ShadowFile& shadowFile) const {
+    auto numPagesToFlush = getNumPagesToFlush();
+    auto pageRange = pageAllocator.allocatePageRange(numPagesToFlush);
+    flush(pageRange, pageAllocator.getDataFH(), shadowFile);
+    return pageRange;
+}
+
+void InMemFileWriter::flush(storage::PageRange allocatedPageRange, storage::FileHandle* fileHandle,
+    storage::ShadowFile& shadowFile) const {
+    auto numPagesToWrite = getNumPagesToFlush();
+    KU_ASSERT(allocatedPageRange.numPages >= numPagesToWrite);
+    auto numPagesBeforeAllocate = allocatedPageRange.startPageIdx;
+    for (auto i = 0u; i < numPagesToWrite; i++) {
+        auto pageIdx = allocatedPageRange.startPageIdx + i;
+        auto insertingNewPage = pageIdx >= numPagesBeforeAllocate;
+        auto shadowPageAndFrame = storage::ShadowUtils::createShadowVersionIfNecessaryAndPinPage(
+            pageIdx, insertingNewPage, *fileHandle, shadowFile);
+        memcpy(shadowPageAndFrame.frame, pages[i]->getData(), LBUG_PAGE_SIZE);
+        shadowFile.getShadowingFH().unpinPage(shadowPageAndFrame.shadowPage);
+    }
+
+    // Write zeroes to any extra pages
+    // This ensures that the size of the data file matches the size expected from allocations
+    // even if we reload the database immediately after this
+    for (auto i = numPagesToWrite; i < allocatedPageRange.numPages; i++) {
+        auto pageIdx = allocatedPageRange.startPageIdx + i;
+        auto insertingNewPage = pageIdx >= numPagesBeforeAllocate;
+        auto shadowPageAndFrame = storage::ShadowUtils::createShadowVersionIfNecessaryAndPinPage(
+            pageIdx, insertingNewPage, *fileHandle, shadowFile);
+        memset(shadowPageAndFrame.frame, 0u, LBUG_PAGE_SIZE);
+        shadowFile.getShadowingFH().unpinPage(shadowPageAndFrame.shadowPage);
+    }
+}
+
+void InMemFileWriter::flush(Writer& writer) const {
+    for (auto i = 0u; i < pages.size(); i++) {
+        auto sizeToFlush = (i == pages.size() - 1) ? pageOffset : LBUG_PAGE_SIZE;
+        writer.write(pages[i]->getData(), sizeToFlush);
+    }
+}
+
+bool InMemFileWriter::needNewBuffer(uint64_t size) const {
+    return pages.empty() || pageOffset + size > LBUG_PAGE_SIZE;
+}
+
+uint64_t InMemFileWriter::getPageSize() {
+    return LBUG_PAGE_SIZE;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/serializer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/serializer.cpp
new file mode 100644
index 0000000000..10eafeb1be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/serializer/serializer.cpp
@@ -0,0 +1,24 @@
+#include "common/serializer/serializer.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace common {
+
+template<>
+void Serializer::serializeValue(const std::string& value) {
+    uint64_t valueLength = value.length();
+    writer->write((uint8_t*)&valueLength, sizeof(uint64_t));
+    writer->write((uint8_t*)value.data(), valueLength);
+}
+
+void Serializer::writeDebuggingInfo(const std::string& value) {
+#if defined(LBUG_DESER_DEBUG) && (defined(LBUG_RUNTIME_CHECKS) || !defined(NDEBUG))
+    serializeValue<std::string>(value);
+#endif
+    // DO NOTHING
+    KU_UNUSED(value);
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/sha256.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/sha256.cpp
new file mode 100644
index 0000000000..8079f7ee75
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/sha256.cpp
@@ -0,0 +1,52 @@
+#include "common/sha256.h"
+
+#include "common/exception/runtime.h"
+
+namespace lbug {
+namespace common {
+
+SHA256::SHA256() : shaContext{} {
+    mbedtls_sha256_init(&shaContext);
+
+    // These errors would only occur if there's an issue with shaContext which is wrapped inside
+    // SHA256, or with the mbedtls library itself
+    if (mbedtls_sha256_starts(&shaContext, false)) {
+        throw RuntimeException{"SHA256 Error"};
+    }
+}
+
+SHA256::~SHA256() {
+    mbedtls_sha256_free(&shaContext);
+}
+
+void SHA256::addString(const std::string& str) {
+    if (mbedtls_sha256_update(&shaContext, reinterpret_cast<const unsigned char*>(str.data()),
+            str.size())) {
+        throw RuntimeException{"SHA256 Error"};
+    }
+}
+
+void SHA256::finishSHA256(char* out) {
+    std::string hash;
+    hash.resize(SHA256_HASH_LENGTH_BYTES);
+
+    if (mbedtls_sha256_finish(&shaContext, reinterpret_cast<unsigned char*>(hash.data()))) {
+        throw RuntimeException{"SHA256 Error"};
+    }
+
+    toBase16(hash.c_str(), out, SHA256_HASH_LENGTH_BYTES);
+}
+
+void SHA256::toBase16(const char* in, char* out, size_t len) {
+    static char const HEX_CODES[] = "0123456789abcdef";
+    size_t i = 0, j = 0;
+
+    for (j = i = 0; i < len; i++) {
+        int a = in[i];
+        out[j++] = HEX_CODES[(a >> 4) & 0xf];
+        out[j++] = HEX_CODES[a & 0xf];
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/signal/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/signal/CMakeLists.txt
new file mode 100644
index 0000000000..af256cc72e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/signal/CMakeLists.txt
@@ -0,0 +1,4 @@
+if (ENABLE_BACKTRACES)
+    add_library(register_backtrace_signal_handler OBJECT register.cpp)
+    target_link_libraries(register_backtrace_signal_handler cpptrace::cpptrace)
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/signal/register.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/signal/register.cpp
new file mode 100644
index 0000000000..8da3340832
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/signal/register.cpp
@@ -0,0 +1,32 @@
+#ifdef LBUG_BACKTRACE
+#include <csignal>
+#include <cstdlib>
+#include <cstring>
+#include <iostream>
+
+#include <cpptrace/cpptrace.hpp>
+
+namespace {
+
+void handler(int signo) {
+    // Not safe. Safe method would be writing directly to stderr with a pre-defined string
+    // But since the below isn't safe either...
+    std::cerr << "Fatal signal " << signo << std::endl;
+    // This is not safe, however the safe version, described at the link below,
+    // was causing hangs when the tracer program can't be found.
+    // Since this is only used in CI, the occasional failure/hang is probably acceptable.
+    // https://github.com/jeremy-rifkin/cpptrace/blob/main/docs/signal-safe-tracing.md
+    cpptrace::generate_trace(1 /*skip this function's frame*/).print();
+    std::_Exit(1);
+}
+
+int register_signal_handlers() noexcept {
+    std::signal(SIGSEGV, handler);
+    std::signal(SIGFPE, handler);
+    cpptrace::register_terminate_handler();
+    return 0;
+}
+
+static int ignore = register_signal_handlers();
+}; // namespace
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/string_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/string_utils.cpp
new file mode 100644
index 0000000000..e474de398d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/string_utils.cpp
@@ -0,0 +1,281 @@
+#include "common/string_utils.h"
+
+#include <sstream>
+#include <vector>
+
+#include "common/exception/runtime.h"
+#include "function/string/functions/base_lower_upper_function.h"
+#include "utf8proc_wrapper.h"
+
+namespace lbug {
+namespace common {
+
+std::vector<std::string> StringUtils::splitComma(const std::string& input) {
+    auto result = std::vector<std::string>();
+    auto currentPos = 0u;
+    auto lvl = 0u;
+    while (currentPos < input.length()) {
+        if (input[currentPos] == '(') {
+            lvl++;
+        } else if (input[currentPos] == ')') {
+            lvl--;
+        } else if (lvl == 0 && input[currentPos] == ',') {
+            break;
+        }
+        currentPos++;
+    }
+    result.push_back(input.substr(0, currentPos));
+    result.push_back(input.substr(currentPos == input.length() ? input.length() : currentPos + 1));
+    return result;
+}
+
+static char openingBracket(char c) {
+    if (c == ')') {
+        return '(';
+    }
+    if (c == ']') {
+        return '[';
+    }
+    if (c == '}') {
+        return '{';
+    }
+    return c;
+}
+
+std::vector<std::string_view> StringUtils::smartSplit(std::string_view input, char splitChar,
+    uint64_t maxNumEle) {
+    if (input.size() == 0) {
+        return {};
+    }
+    std::vector<std::string_view> result;
+    auto currentItem = 0u;
+    std::vector<char> stk;
+    bool insideSingleQuote = false;
+    for (auto i = 0u; i < input.size(); i++) {
+        char c = input[i];
+
+        if (c == '\'' && (stk.size() == 0 || stk.back() != '\'')) {
+            // Entering/Exiting a single-quoted block.
+            insideSingleQuote = !insideSingleQuote;
+        } else if (c == splitChar && stk.size() == 0u && !insideSingleQuote) {
+            if (result.size() + 1 == maxNumEle) {
+                result.push_back(input.substr(currentItem));
+                return result;
+            } else {
+                result.push_back(input.substr(currentItem, i - currentItem));
+                currentItem = i + 1;
+            }
+        } else if (c == '{' || c == '(' || c == '[' ||
+                   (c == '\"' && (stk.size() == 0u || stk.back() != '\"'))) {
+            stk.push_back(c);
+        } else if (stk.size() > 0 && openingBracket(c) == stk.back()) {
+            stk.pop_back();
+        }
+    }
+    result.push_back(input.substr(currentItem));
+    return result;
+}
+
+uint64_t findDelim(const std::string& input, const std::string& delimiter, uint64_t prevPos) {
+    if (delimiter != "") {
+        return input.find(delimiter, prevPos);
+    }
+    return prevPos < input.size() - 1 ? prevPos + 1 : std::string::npos;
+}
+
+std::vector<std::string> StringUtils::split(const std::string& input, const std::string& delimiter,
+    bool ignoreEmptyStringParts) {
+    auto result = std::vector<std::string>();
+    auto prevPos = 0u;
+    auto currentPos = findDelim(input, delimiter, prevPos);
+    while (currentPos != std::string::npos) {
+        auto stringPart = input.substr(prevPos, currentPos - prevPos);
+        if (!ignoreEmptyStringParts || !stringPart.empty()) {
+            result.push_back(input.substr(prevPos, currentPos - prevPos));
+        }
+        prevPos = currentPos + delimiter.size();
+        currentPos = findDelim(input, delimiter, prevPos);
+    }
+    result.push_back(input.substr(prevPos));
+    return result;
+}
+
+std::vector<std::string> StringUtils::splitBySpace(const std::string& input) {
+    std::istringstream iss(input);
+    std::vector<std::string> result;
+    std::string token;
+    while (iss >> token) {
+        result.push_back(token);
+    }
+    return result;
+}
+
+std::string StringUtils::getUpper(const std::string& input) {
+    auto result = input;
+    toUpper(result);
+    return result;
+}
+
+std::string StringUtils::getUpper(const std::string_view& input) {
+    auto result = std::string(input);
+    toUpper(result);
+    return result;
+}
+
+std::string StringUtils::getLower(const std::string& input) {
+    auto result = input;
+    toLower(result);
+    return result;
+}
+
+template<bool toUpper>
+static void changeCase(std::string& input) {
+    if (!utf8proc::Utf8Proc::isValid(input.c_str(), input.length())) {
+        throw RuntimeException{"Invalid UTF8-encoded string."};
+    }
+    auto resultLen = function::BaseLowerUpperFunction::getResultLen((char*)input.data(),
+        input.length(), toUpper);
+    std::string result(resultLen, '\0' /* char */);
+    function::BaseLowerUpperFunction::convertCase((char*)result.data(), input.length(),
+        input.data(), toUpper);
+    input = result;
+}
+
+void StringUtils::toLower(std::string& input) {
+    changeCase<false>(input);
+}
+
+void StringUtils::toUpper(std::string& input) {
+    changeCase<true>(input);
+}
+
+void StringUtils::removeCStringWhiteSpaces(const char*& input, uint64_t& len) {
+    // skip leading/trailing spaces
+    while (len > 0 && isspace(input[0])) {
+        input++;
+        len--;
+    }
+    while (len > 0 && isspace(input[len - 1])) {
+        len--;
+    }
+}
+
+void StringUtils::replaceAll(std::string& str, const std::string& search,
+    const std::string& replacement) {
+    size_t pos = 0;
+    while ((pos = str.find(search, pos)) != std::string::npos) {
+        str.replace(pos, search.length(), replacement);
+        pos += replacement.length();
+    }
+}
+
+std::string StringUtils::extractStringBetween(const std::string& input, char delimiterStart,
+    char delimiterEnd, bool includeDelimiter) {
+    std::string::size_type posStart = input.find_first_of(delimiterStart);
+    std::string::size_type posEnd = input.find_last_of(delimiterEnd);
+    if (posStart == std::string::npos || posEnd == std::string::npos || posStart >= posEnd) {
+        return "";
+    }
+    if (includeDelimiter) {
+        posEnd++;
+    } else {
+        posStart++;
+    }
+    return input.substr(posStart, posEnd - posStart);
+}
+
+// Jenkins hash function: https://en.wikipedia.org/wiki/Jenkins_hash_function.
+// We transform each character to its lower case and apply one_at_a_time hash.
+uint64_t StringUtils::caseInsensitiveHash(const std::string& str) {
+    uint32_t hash = 0;
+    for (auto c : str) {
+        hash += tolower(c);
+        hash += hash << 10;
+        hash ^= hash >> 6;
+    }
+    hash += hash << 3;
+    hash ^= hash >> 11;
+    hash += hash << 15;
+    return hash;
+}
+
+bool StringUtils::caseInsensitiveEquals(std::string_view left, std::string_view right) {
+    if (left.size() != right.size()) {
+        return false;
+    }
+    for (auto c = 0u; c < left.size(); c++) {
+        if (asciiToLowerCaseMap[(uint8_t)left[c]] != asciiToLowerCaseMap[(uint8_t)right[c]]) {
+            return false;
+        }
+    }
+    return true;
+}
+
+std::string StringUtils::join(const std::vector<std::string>& input, const std::string& separator) {
+    return StringUtils::join(input, input.size(), separator,
+        [](const std::string& s) { return s; });
+}
+
+std::string StringUtils::join(const std::span<const std::string_view> input,
+    const std::string& separator) {
+    return StringUtils::join(input, input.size(), separator,
+        [](const std::string_view s) { return std::string{s}; });
+}
+
+template<typename C, typename S, typename Func>
+std::string StringUtils::join(const C& input, S count, const std::string& separator, Func f) {
+    std::string result;
+    // if the input isn't empty, append the first element. We do this so we
+    // don't need to introduce an if into the loop.
+    if (count > 0) {
+        result += f(input[0]);
+    }
+    // append the remaining input components, after the first
+    for (size_t i = 1; i < count; i++) {
+        result += separator + f(input[i]);
+    }
+    return result;
+}
+
+std::string StringUtils::ltrimNewlines(const std::string& input) {
+    auto s = input;
+    s.erase(s.begin(),
+        find_if(s.begin(), s.end(), [](unsigned char ch) { return !characterIsNewLine(ch); }));
+    return s;
+}
+
+std::string StringUtils::rtrimNewlines(const std::string& input) {
+    auto s = input;
+    s.erase(find_if(s.rbegin(), s.rend(), [](unsigned char ch) { return !characterIsNewLine(ch); })
+                .base(),
+        s.end());
+    return s;
+}
+
+std::string StringUtils::encodeURL(const std::string& input, bool encodeSlash) {
+    static const char* hex_digit = "0123456789ABCDEF";
+    static constexpr std::string_view unreserved_chars = "_.-~";
+    constexpr auto isUnreserved = [](char ch) {
+        return std::isalnum(ch) || unreserved_chars.find(ch) != std::string_view::npos;
+    };
+    std::string result;
+    result.reserve(input.size());
+    for (auto ch : input) {
+        if (isUnreserved(ch)) {
+            result += ch;
+        } else if (ch == '/') {
+            if (encodeSlash) {
+                result += std::string("%2F");
+            } else {
+                result += ch;
+            }
+        } else {
+            result += std::string("%");
+            result += hex_digit[static_cast<unsigned char>(ch) >> 4];
+            result += hex_digit[static_cast<unsigned char>(ch) & 15];
+        }
+    }
+    return result;
+}
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/system_message.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/system_message.cpp
new file mode 100644
index 0000000000..8abe2b82a5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/system_message.cpp
@@ -0,0 +1,37 @@
+#include "common/system_message.h"
+
+#ifdef _WIN32
+#include "windows.h"
+#else
+#include <dlfcn.h>
+#endif
+
+namespace lbug {
+namespace common {
+
+std::string dlErrMessage() {
+#ifdef _WIN32
+    DWORD errorMessageID = GetLastError();
+    if (errorMessageID == 0) {
+        return std::string();
+    }
+
+    LPSTR messageBuffer = nullptr;
+    auto size = FormatMessageA(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM |
+                                   FORMAT_MESSAGE_IGNORE_INSERTS,
+        NULL, errorMessageID, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), (LPSTR)&messageBuffer, 0,
+        NULL);
+
+    std::string message(messageBuffer, size);
+
+    // Free the buffer.
+    LocalFree(messageBuffer);
+
+    return message;
+#else
+    return dlerror(); // NOLINT(concurrency-mt-unsafe): load can only be executed in single thread.
+#endif
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/CMakeLists.txt
new file mode 100644
index 0000000000..141c08fbeb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/CMakeLists.txt
@@ -0,0 +1,10 @@
+add_library(lbug_common_task_system
+        OBJECT
+        task.cpp
+        task_scheduler.cpp 
+        progress_bar.cpp
+        terminal_progress_bar_display.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_task_system>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/progress_bar.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/progress_bar.cpp
new file mode 100644
index 0000000000..b53e418747
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/progress_bar.cpp
@@ -0,0 +1,79 @@
+#include "common/task_system/progress_bar.h"
+
+#include "common/task_system/terminal_progress_bar_display.h"
+#include "main/client_context.h"
+
+namespace lbug {
+namespace common {
+
+ProgressBar::ProgressBar(bool enableProgressBar) {
+    display = DefaultProgressBarDisplay();
+    numPipelines = 0;
+    numPipelinesFinished = 0;
+    trackProgress = enableProgressBar;
+}
+
+std::shared_ptr<ProgressBarDisplay> ProgressBar::DefaultProgressBarDisplay() {
+    return std::make_shared<TerminalProgressBarDisplay>();
+}
+
+void ProgressBar::setDisplay(std::shared_ptr<ProgressBarDisplay> progressBarDipslay) {
+    display = progressBarDipslay;
+}
+
+void ProgressBar::startProgress(uint64_t queryID) {
+    if (!trackProgress) {
+        return;
+    }
+    std::lock_guard<std::mutex> lock(progressBarLock);
+    updateDisplay(queryID, 0.0);
+}
+
+void ProgressBar::endProgress(uint64_t queryID) {
+    std::lock_guard<std::mutex> lock(progressBarLock);
+    resetProgressBar(queryID);
+}
+
+void ProgressBar::addPipeline() {
+    if (!trackProgress) {
+        return;
+    }
+    numPipelines++;
+    display->setNumPipelines(numPipelines);
+}
+
+void ProgressBar::finishPipeline(uint64_t queryID) {
+    if (!trackProgress) {
+        return;
+    }
+    numPipelinesFinished++;
+    updateProgress(queryID, 0.0);
+}
+
+void ProgressBar::updateProgress(uint64_t queryID, double curPipelineProgress) {
+    if (!trackProgress) {
+        return;
+    }
+    updateDisplay(queryID, curPipelineProgress);
+}
+
+void ProgressBar::resetProgressBar(uint64_t queryID) {
+    numPipelines = 0;
+    numPipelinesFinished = 0;
+    display->finishProgress(queryID);
+}
+
+void ProgressBar::updateDisplay(uint64_t queryID, double curPipelineProgress) {
+    display->updateProgress(queryID, curPipelineProgress, numPipelinesFinished);
+}
+
+void ProgressBar::toggleProgressBarPrinting(bool enable) {
+    trackProgress = enable;
+}
+
+ProgressBar* ProgressBar::Get(const main::ClientContext& context) {
+    return context.progressBar.get();
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/task.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/task.cpp
new file mode 100644
index 0000000000..c0cd09d009
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/task.cpp
@@ -0,0 +1,32 @@
+#include "common/task_system/task.h"
+
+namespace lbug {
+namespace common {
+
+bool Task::registerThread() {
+    lock_t lck{taskMtx};
+    if (!hasExceptionNoLock() && canRegisterNoLock()) {
+        numThreadsRegistered++;
+        return true;
+    }
+    return false;
+}
+
+void Task::deRegisterThreadAndFinalizeTask() {
+    lock_t lck{taskMtx};
+    ++numThreadsFinished;
+    if (!hasExceptionNoLock() && isCompletedNoLock()) {
+        try {
+            finalize();
+        } catch (std::exception& e) {
+            setExceptionNoLock(std::current_exception());
+        }
+    }
+    if (isCompletedNoLock()) {
+        lck.unlock();
+        cv.notify_all();
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/task_scheduler.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/task_scheduler.cpp
new file mode 100644
index 0000000000..59ef8d56dc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/task_scheduler.cpp
@@ -0,0 +1,230 @@
+#include "common/task_system/task_scheduler.h"
+
+#include "main/client_context.h"
+#include "main/database.h"
+#include "processor/processor.h"
+
+#if defined(__APPLE__)
+#include <pthread.h>
+
+#include <pthread/qos.h>
+#endif
+
+namespace lbug {
+namespace common {
+
+#ifndef __SINGLE_THREADED__
+
+#if defined(__APPLE__)
+TaskScheduler::TaskScheduler(uint64_t numWorkerThreads, uint32_t threadQos)
+#else
+TaskScheduler::TaskScheduler(uint64_t numWorkerThreads)
+#endif
+    : stopWorkerThreads{false}, nextScheduledTaskID{0} {
+#if defined(__APPLE__)
+    this->threadQos = threadQos;
+#endif
+    for (auto n = 0u; n < numWorkerThreads; ++n) {
+        workerThreads.emplace_back([&] { runWorkerThread(); });
+    }
+}
+
+TaskScheduler::~TaskScheduler() {
+    lock_t lck{taskSchedulerMtx};
+    stopWorkerThreads = true;
+    lck.unlock();
+    cv.notify_all();
+    for (auto& thread : workerThreads) {
+        thread.join();
+    }
+}
+
+void TaskScheduler::scheduleTaskAndWaitOrError(const std::shared_ptr<Task>& task,
+    processor::ExecutionContext* context, bool launchNewWorkerThread) {
+    for (auto& dependency : task->children) {
+        scheduleTaskAndWaitOrError(dependency, context);
+        if (dependency->terminate()) {
+            return;
+        }
+    }
+    std::thread newWorkerThread;
+    if (launchNewWorkerThread) {
+        // Note that newWorkerThread is not executing yet. However, we still call
+        // task->registerThread() function because the call in the next line will guarantee
+        // that the thread starts working on it. registerThread() function only increases the
+        // numThreadsRegistered field of the task, tt does not keep track of the thread ids or
+        // anything specific to the thread.
+        task->registerThread();
+        newWorkerThread = std::thread(runTask, task.get());
+    }
+    auto scheduledTask = pushTaskIntoQueue(task);
+    cv.notify_all();
+    std::unique_lock<std::mutex> taskLck{task->taskMtx, std::defer_lock};
+    while (true) {
+        taskLck.lock();
+        bool timedWait = false;
+        auto timeout = 0u;
+        if (task->isCompletedNoLock()) {
+            // Note: we do not remove completed tasks from the queue in this function. They will be
+            // removed by the worker threads when they traverse down the queue for a task to work on
+            // (see getTaskAndRegister()).
+            taskLck.unlock();
+            break;
+        }
+        if (context->clientContext->hasTimeout()) {
+            timeout = context->clientContext->getTimeoutRemainingInMS();
+            if (timeout == 0) {
+                context->clientContext->interrupt();
+            } else {
+                timedWait = true;
+            }
+        } else if (task->hasExceptionNoLock()) {
+            // Interrupt tasks that errored, so other threads can stop working on them early.
+            context->clientContext->interrupt();
+        }
+        if (timedWait) {
+            task->cv.wait_for(taskLck, std::chrono::milliseconds(timeout));
+        } else {
+            task->cv.wait(taskLck);
+        }
+        taskLck.unlock();
+    }
+    if (launchNewWorkerThread) {
+        newWorkerThread.join();
+    }
+    if (task->hasException()) {
+        removeErroringTask(scheduledTask->ID);
+        std::rethrow_exception(task->getExceptionPtr());
+    }
+}
+
+void TaskScheduler::runWorkerThread() {
+#if defined(__APPLE__)
+    qos_class_t qosClass = (qos_class_t)threadQos;
+    if (qosClass != QOS_CLASS_DEFAULT && qosClass != QOS_CLASS_UNSPECIFIED) {
+        auto pthreadQosStatus = pthread_set_qos_class_self_np(qosClass, 0);
+        KU_UNUSED(pthreadQosStatus);
+    }
+#endif
+    std::unique_lock<std::mutex> lck{taskSchedulerMtx, std::defer_lock};
+    std::exception_ptr exceptionPtr = nullptr;
+    std::shared_ptr<ScheduledTask> scheduledTask = nullptr;
+    while (true) {
+        // Warning: Threads acquire a global lock (using taskSchedulerMutex) right before
+        // deregistering themselves from a task (and they immediately register themselves for
+        // another task without releasing the lock). This acquire-right-before-deregistering ensures
+        // that all writes that were done by threads in Task_j happen before a Task_{j+1} which
+        // depends on Task_j can start. That's because before Task_{j+1} can start, each thread T_i
+        // working on Task_j will need to deregister itself using the global lock. Therefore, by the
+        // time any thread gets to start on Task_{j+1}, all writes made to Task_j by T_i will become
+        // globally visible because T_i grabbed the global lock before deregistering (and without
+        // T_i deregistering Task_{j+1} cannot start).
+        lck.lock();
+        if (scheduledTask != nullptr) {
+            if (exceptionPtr != nullptr) {
+                scheduledTask->task->setException(exceptionPtr);
+                exceptionPtr = nullptr;
+            }
+            scheduledTask->task->deRegisterThreadAndFinalizeTask();
+            scheduledTask = nullptr;
+        }
+        cv.wait(lck, [&] {
+            scheduledTask = getTaskAndRegister();
+            return scheduledTask != nullptr || stopWorkerThreads;
+        });
+        lck.unlock();
+        if (stopWorkerThreads) {
+            return;
+        }
+        try {
+            scheduledTask->task->run();
+        } catch (std::exception& e) {
+            exceptionPtr = std::current_exception();
+        }
+    }
+}
+#else
+// Single-threaded version of TaskScheduler
+TaskScheduler::TaskScheduler(uint64_t) : stopWorkerThreads{false}, nextScheduledTaskID{0} {}
+
+TaskScheduler::~TaskScheduler() {
+    stopWorkerThreads = true;
+}
+
+void TaskScheduler::scheduleTaskAndWaitOrError(const std::shared_ptr<Task>& task,
+    processor::ExecutionContext* context, bool) {
+    for (auto& dependency : task->children) {
+        scheduleTaskAndWaitOrError(dependency, context);
+        if (dependency->terminate()) {
+            return;
+        }
+    }
+    task->registerThread();
+    // runTask deregisters, so we don't need to deregister explicitly here
+    runTask(task.get());
+    if (task->hasException()) {
+        removeErroringTask(task->ID);
+        std::rethrow_exception(task->getExceptionPtr());
+    }
+}
+#endif
+
+std::shared_ptr<ScheduledTask> TaskScheduler::pushTaskIntoQueue(const std::shared_ptr<Task>& task) {
+    lock_t lck{taskSchedulerMtx};
+    auto scheduledTask = std::make_shared<ScheduledTask>(task, nextScheduledTaskID++);
+    taskQueue.push_back(scheduledTask);
+    return scheduledTask;
+}
+
+std::shared_ptr<ScheduledTask> TaskScheduler::getTaskAndRegister() {
+    if (taskQueue.empty()) {
+        return nullptr;
+    }
+    auto it = taskQueue.begin();
+    while (it != taskQueue.end()) {
+        auto task = (*it)->task;
+        if (!task->registerThread()) {
+            // If we cannot register for a thread it is because of three possibilities:
+            // (i) maximum number of threads have registered for task and the task is completed
+            // without an exception; or (ii) same as (i) but the task has not yet successfully
+            // completed; or (iii) task has an exception; Only in (i) we remove the task from the
+            // queue. For (ii) and (iii) we keep the task in queue. Recall erroring tasks need to be
+            // manually removed.
+            if (task->isCompletedSuccessfully()) { // option (i)
+                it = taskQueue.erase(it);
+            } else { // option (ii) or (iii): keep the task in the queue.
+                ++it;
+            }
+        } else {
+            return *it;
+        }
+    }
+    return nullptr;
+}
+
+void TaskScheduler::removeErroringTask(uint64_t scheduledTaskID) {
+    lock_t lck{taskSchedulerMtx};
+    for (auto it = taskQueue.begin(); it != taskQueue.end(); ++it) {
+        if (scheduledTaskID == (*it)->ID) {
+            taskQueue.erase(it);
+            return;
+        }
+    }
+}
+
+void TaskScheduler::runTask(Task* task) {
+    try {
+        task->run();
+        task->deRegisterThreadAndFinalizeTask();
+    } catch (std::exception& e) {
+        task->setException(std::current_exception());
+        task->deRegisterThreadAndFinalizeTask();
+    }
+}
+
+TaskScheduler* TaskScheduler::Get(const main::ClientContext& context) {
+    return context.getDatabase()->getQueryProcessor()->getTaskScheduler();
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/terminal_progress_bar_display.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/terminal_progress_bar_display.cpp
new file mode 100644
index 0000000000..e275ef558b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/task_system/terminal_progress_bar_display.cpp
@@ -0,0 +1,66 @@
+#include "common/task_system/terminal_progress_bar_display.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace common {
+
+void TerminalProgressBarDisplay::updateProgress(uint64_t /*queryID*/, double newPipelineProgress,
+    uint32_t newNumPipelinesFinished) {
+    KU_ASSERT(0.0 <= newPipelineProgress && newPipelineProgress <= 1.0);
+
+    // There can still be data races as the comparison + update of cur/old progress is not done
+    // atomically
+    // However this error does not build up over time and we don't require perfect progress bar
+    // accuracy
+    // So we implement it this way with atomics (instead of mutexes) for better performance
+    uint32_t curPipelineProgress = (uint32_t)(newPipelineProgress * 100.0);
+    uint32_t oldPipelineProgress = (uint32_t)(pipelineProgress * 100.0);
+    if (curPipelineProgress > oldPipelineProgress ||
+        newNumPipelinesFinished > numPipelinesFinished) {
+        pipelineProgress.store(newPipelineProgress);
+        numPipelinesFinished.store(newNumPipelinesFinished);
+        printProgressBar();
+    }
+}
+
+void TerminalProgressBarDisplay::finishProgress(uint64_t /*queryID*/) {
+    if (printing) {
+        std::cout << "\033[2A\033[2K\033[1B\033[2K\033[1A";
+        std::cout.flush();
+    }
+    printing = false;
+    numPipelines = 0;
+    numPipelinesFinished = 0;
+    pipelineProgress = 0;
+}
+
+void TerminalProgressBarDisplay::printProgressBar() {
+    // If a different thread is already printing the progress skip the current update
+    // As we do not require the displayed value to be perfectly up to date
+    bool falseValue{false};
+    if (currentlyPrintingProgress.compare_exchange_strong(falseValue, true)) {
+        setGreenFont();
+        if (printing) {
+            if (pipelineProgress == 0) {
+                std::cout << "\033[1A\033[2K\033[1A";
+                printing = false;
+            } else {
+                std::cout << "\033[1A";
+            }
+        }
+        if (!printing) {
+            std::cout << "Pipelines Finished: " << numPipelinesFinished << "/" << numPipelines
+                      << "\n";
+            printing = true;
+        }
+        std::cout << "Current Pipeline Progress: " << uint32_t(pipelineProgress * 100.0) << "%"
+                  << "\n";
+        setDefaultFont();
+        std::cout.flush();
+        currentlyPrintingProgress.store(false);
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/type_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/type_utils.cpp
new file mode 100644
index 0000000000..f2f896978c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/type_utils.cpp
@@ -0,0 +1,298 @@
+#include "common/type_utils.h"
+
+#include "common/exception/runtime.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace common {
+
+std::string TypeUtils::entryToString(const LogicalType& dataType, const uint8_t* value,
+    ValueVector* vector) {
+    auto valueVector = reinterpret_cast<ValueVector*>(vector);
+    switch (dataType.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL:
+        return TypeUtils::toString(*reinterpret_cast<const bool*>(value));
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64:
+        return TypeUtils::toString(*reinterpret_cast<const int64_t*>(value));
+    case LogicalTypeID::INT32:
+        return TypeUtils::toString(*reinterpret_cast<const int32_t*>(value));
+    case LogicalTypeID::INT16:
+        return TypeUtils::toString(*reinterpret_cast<const int16_t*>(value));
+    case LogicalTypeID::INT8:
+        return TypeUtils::toString(*reinterpret_cast<const int8_t*>(value));
+    case LogicalTypeID::UINT64:
+        return TypeUtils::toString(*reinterpret_cast<const uint64_t*>(value));
+    case LogicalTypeID::UINT32:
+        return TypeUtils::toString(*reinterpret_cast<const uint32_t*>(value));
+    case LogicalTypeID::UINT16:
+        return TypeUtils::toString(*reinterpret_cast<const uint16_t*>(value));
+    case LogicalTypeID::UINT8:
+        return TypeUtils::toString(*reinterpret_cast<const uint8_t*>(value));
+    case LogicalTypeID::INT128:
+        return TypeUtils::toString(*reinterpret_cast<const int128_t*>(value));
+    case LogicalTypeID::DOUBLE:
+        return TypeUtils::toString(*reinterpret_cast<const double*>(value));
+    case LogicalTypeID::FLOAT:
+        return TypeUtils::toString(*reinterpret_cast<const float*>(value));
+    case LogicalTypeID::DECIMAL:
+        switch (dataType.getPhysicalType()) {
+        case PhysicalTypeID::INT16:
+            return DecimalType::insertDecimalPoint(
+                TypeUtils::toString(*reinterpret_cast<const int16_t*>(value)),
+                DecimalType::getScale(dataType));
+        case PhysicalTypeID::INT32:
+            return DecimalType::insertDecimalPoint(
+                TypeUtils::toString(*reinterpret_cast<const int32_t*>(value)),
+                DecimalType::getScale(dataType));
+        case PhysicalTypeID::INT64:
+            return DecimalType::insertDecimalPoint(
+                TypeUtils::toString(*reinterpret_cast<const int64_t*>(value)),
+                DecimalType::getScale(dataType));
+        case PhysicalTypeID::INT128:
+            return DecimalType::insertDecimalPoint(
+                TypeUtils::toString(*reinterpret_cast<const int128_t*>(value)),
+                DecimalType::getScale(dataType));
+        default:
+            // decimals should always be backed by one of these four
+            KU_UNREACHABLE;
+        }
+    case LogicalTypeID::DATE:
+        return TypeUtils::toString(*reinterpret_cast<const date_t*>(value));
+    case LogicalTypeID::TIMESTAMP_NS:
+        return TypeUtils::toString(*reinterpret_cast<const timestamp_ns_t*>(value));
+    case LogicalTypeID::TIMESTAMP_MS:
+        return TypeUtils::toString(*reinterpret_cast<const timestamp_ms_t*>(value));
+    case LogicalTypeID::TIMESTAMP_SEC:
+        return TypeUtils::toString(*reinterpret_cast<const timestamp_sec_t*>(value));
+    case LogicalTypeID::TIMESTAMP_TZ:
+        return TypeUtils::toString(*reinterpret_cast<const timestamp_tz_t*>(value));
+    case LogicalTypeID::TIMESTAMP:
+        return TypeUtils::toString(*reinterpret_cast<const timestamp_t*>(value));
+    case LogicalTypeID::INTERVAL:
+        return TypeUtils::toString(*reinterpret_cast<const interval_t*>(value));
+    case LogicalTypeID::BLOB:
+        return TypeUtils::toString(*reinterpret_cast<const blob_t*>(value));
+    case LogicalTypeID::STRING:
+        return TypeUtils::toString(*reinterpret_cast<const ku_string_t*>(value));
+    case LogicalTypeID::INTERNAL_ID:
+        return TypeUtils::toString(*reinterpret_cast<const internalID_t*>(value));
+    case LogicalTypeID::UINT128:
+        return TypeUtils::toString(*reinterpret_cast<const uint128_t*>(value));
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::LIST:
+        return TypeUtils::toString(*reinterpret_cast<const list_entry_t*>(value), valueVector);
+    case LogicalTypeID::MAP:
+        return TypeUtils::toString(*reinterpret_cast<const map_entry_t*>(value), valueVector);
+    case LogicalTypeID::STRUCT:
+        return TypeUtils::toString(*reinterpret_cast<const struct_entry_t*>(value), valueVector);
+    case LogicalTypeID::UNION:
+        return TypeUtils::toString(*reinterpret_cast<const union_entry_t*>(value), valueVector);
+    case LogicalTypeID::UUID:
+        return TypeUtils::toString(*reinterpret_cast<const ku_uuid_t*>(value));
+    case LogicalTypeID::NODE:
+        return TypeUtils::nodeToString(*reinterpret_cast<const struct_entry_t*>(value),
+            valueVector);
+    case LogicalTypeID::REL:
+        return TypeUtils::relToString(*reinterpret_cast<const struct_entry_t*>(value), valueVector);
+    default:
+        throw common::RuntimeException{
+            common::stringFormat("Unsupported type: {} to string.", dataType.toString())};
+    }
+}
+
+static std::string entryToStringWithPos(sel_t pos, ValueVector* vector) {
+    if (vector->isNull(pos)) {
+        return "";
+    }
+    return TypeUtils::entryToString(vector->dataType,
+        vector->getData() + vector->getNumBytesPerValue() * pos, vector);
+}
+
+template<>
+std::string TypeUtils::toString(const int128_t& val, void* /*valueVector*/) {
+    return Int128_t::toString(val);
+}
+
+template<>
+std::string TypeUtils::toString(const uint128_t& val, void* /*valueVector*/) {
+    return UInt128_t::toString(val);
+}
+
+template<>
+std::string TypeUtils::toString(const bool& val, void* /*valueVector*/) {
+    return val ? "True" : "False";
+}
+
+template<>
+std::string TypeUtils::toString(const internalID_t& val, void* /*valueVector*/) {
+    return std::to_string(val.tableID) + ":" + std::to_string(val.offset);
+}
+
+template<>
+std::string TypeUtils::toString(const date_t& val, void* /*valueVector*/) {
+    return Date::toString(val);
+}
+
+template<>
+std::string TypeUtils::toString(const timestamp_ns_t& val, void* /*valueVector*/) {
+    return toString(Timestamp::fromEpochNanoSeconds(val.value));
+}
+
+template<>
+std::string TypeUtils::toString(const timestamp_ms_t& val, void* /*valueVector*/) {
+    return toString(Timestamp::fromEpochMilliSeconds(val.value));
+}
+
+template<>
+std::string TypeUtils::toString(const timestamp_sec_t& val, void* /*valueVector*/) {
+    return toString(Timestamp::fromEpochSeconds(val.value));
+}
+
+template<>
+std::string TypeUtils::toString(const timestamp_tz_t& val, void* /*valueVector*/) {
+    return toString(static_cast<timestamp_t>(val)) + "+00";
+}
+
+template<>
+std::string TypeUtils::toString(const timestamp_t& val, void* /*valueVector*/) {
+    return Timestamp::toString(val);
+}
+
+template<>
+std::string TypeUtils::toString(const interval_t& val, void* /*valueVector*/) {
+    return Interval::toString(val);
+}
+
+template<>
+std::string TypeUtils::toString(const ku_string_t& val, void* /*valueVector*/) {
+    return val.getAsString();
+}
+
+template<>
+std::string TypeUtils::toString(const blob_t& val, void* /*valueVector*/) {
+    return Blob::toString(val.value.getData(), val.value.len);
+}
+
+template<>
+std::string TypeUtils::toString(const ku_uuid_t& val, void* /*valueVector*/) {
+    return UUID::toString(val);
+}
+
+template<>
+std::string TypeUtils::toString(const list_entry_t& val, void* valueVector) {
+    auto listVector = (ValueVector*)valueVector;
+    if (val.size == 0) {
+        return "[]";
+    }
+    std::string result = "[";
+    auto dataVector = ListVector::getDataVector(listVector);
+    for (auto i = 0u; i < val.size - 1; ++i) {
+        result += entryToStringWithPos(val.offset + i, dataVector);
+        result += ",";
+    }
+    result += entryToStringWithPos(val.offset + val.size - 1, dataVector);
+    result += "]";
+    return result;
+}
+
+static std::string getMapEntryStr(sel_t pos, ValueVector* dataVector, ValueVector* keyVector,
+    ValueVector* valVector) {
+    if (dataVector->isNull(pos)) {
+        return "";
+    }
+    return entryToStringWithPos(pos, keyVector) + "=" + entryToStringWithPos(pos, valVector);
+}
+
+template<>
+std::string TypeUtils::toString(const map_entry_t& val, void* valueVector) {
+    auto mapVector = (ValueVector*)valueVector;
+    if (val.entry.size == 0) {
+        return "{}";
+    }
+    std::string result = "{";
+    auto dataVector = ListVector::getDataVector(mapVector);
+    auto keyVector = MapVector::getKeyVector(mapVector);
+    auto valVector = MapVector::getValueVector(mapVector);
+    for (auto i = 0u; i < val.entry.size - 1; ++i) {
+        auto pos = val.entry.offset + i;
+        result += getMapEntryStr(pos, dataVector, keyVector, valVector);
+        result += ", ";
+    }
+    auto pos = val.entry.offset + val.entry.size - 1;
+    result += getMapEntryStr(pos, dataVector, keyVector, valVector);
+    result += "}";
+    return result;
+}
+
+template<bool SKIP_NULL_ENTRY>
+static std::string structToString(const struct_entry_t& val, ValueVector* vector) {
+    const auto& fields = StructType::getFields(vector->dataType);
+    if (fields.size() == 0) {
+        return "{}";
+    }
+    std::string result = "{";
+    auto i = 0u;
+    for (; i < fields.size() - 1; ++i) {
+        auto fieldVector = StructVector::getFieldVector(vector, i);
+        if constexpr (SKIP_NULL_ENTRY) {
+            if (fieldVector->isNull(val.pos)) {
+                continue;
+            }
+        }
+        if (i != 0) {
+            result += ", ";
+        }
+        result += StructType::getField(vector->dataType, i).getName();
+        result += ": ";
+        result += entryToStringWithPos(val.pos, fieldVector.get());
+    }
+    auto fieldVector = StructVector::getFieldVector(vector, i);
+    if constexpr (SKIP_NULL_ENTRY) {
+        if (fieldVector->isNull(val.pos)) {
+            result += "}";
+            return result;
+        }
+    }
+    if (i != 0) {
+        result += ", ";
+    }
+    result += StructType::getField(vector->dataType, i).getName();
+    result += ": ";
+    result += entryToStringWithPos(val.pos, fieldVector.get());
+    result += "}";
+    return result;
+}
+
+std::string TypeUtils::nodeToString(const struct_entry_t& val, ValueVector* vector) {
+    // Internal ID vector is the first field vector.
+    if (StructVector::getFieldVector(vector, 0)->isNull(val.pos)) {
+        return "";
+    }
+    return structToString<true>(val, vector);
+}
+
+std::string TypeUtils::relToString(const struct_entry_t& val, ValueVector* vector) {
+    // Internal ID vector is the third field vector.
+    if (StructVector::getFieldVector(vector, 3)->isNull(val.pos)) {
+        return "";
+    }
+    return structToString<true>(val, vector);
+}
+
+template<>
+std::string TypeUtils::toString(const struct_entry_t& val, void* valVector) {
+    return structToString<false>(val, (ValueVector*)valVector);
+}
+
+template<>
+std::string TypeUtils::toString(const union_entry_t& val, void* valVector) {
+    auto structVector = (ValueVector*)valVector;
+    auto unionFieldIdx =
+        UnionVector::getTagVector(structVector)->getValue<union_field_idx_t>(val.entry.pos);
+    auto unionFieldVector = UnionVector::getValVector(structVector, unionFieldIdx);
+    return entryToStringWithPos(val.entry.pos, unionFieldVector);
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/CMakeLists.txt
new file mode 100644
index 0000000000..c87bb7acc2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/CMakeLists.txt
@@ -0,0 +1,19 @@
+add_subdirectory(value)
+
+add_library(lbug_common_types
+        OBJECT
+        blob.cpp
+        date_t.cpp
+        dtime_t.cpp
+        interval_t.cpp
+        ku_list.cpp
+        ku_string.cpp
+        timestamp_t.cpp
+        types.cpp
+        int128_t.cpp
+        uint128_t.cpp
+        uuid.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_types>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/blob.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/blob.cpp
new file mode 100644
index 0000000000..c98494089e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/blob.cpp
@@ -0,0 +1,101 @@
+#include "common/types/blob.h"
+
+#include "common/exception/conversion.h"
+#include "common/string_format.h"
+
+namespace lbug {
+namespace common {
+
+const int HexFormatConstants::HEX_MAP[256] = {-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, -1, -1, -1, -1, -1,
+    -1, -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1};
+
+static bool isRegularChar(char c) {
+    return c >= 32 && c <= 126 && c != '\\' && c != '\'' && c != '"';
+}
+
+uint64_t Blob::getBlobSize(const ku_string_t& blob) {
+    uint64_t blobSize = 0;
+    auto length = blob.len;
+    auto blobStr = blob.getData();
+    for (auto i = 0u; i < length; i++) {
+        if (blobStr[i] == '\\') {
+            validateHexCode(blobStr, length, i);
+            blobSize++;
+            i += HexFormatConstants::LENGTH - 1;
+        } else if (blobStr[i] <= 127) {
+            blobSize++;
+        } else {
+            throw ConversionException(
+                "Invalid byte encountered in STRING -> BLOB conversion. All non-ascii characters "
+                "must be escaped with hex codes (e.g. \\xAA)");
+        }
+    }
+    return blobSize;
+}
+
+uint64_t Blob::fromString(const char* str, uint64_t length, uint8_t* resultBuffer) {
+    auto resultPos = 0u;
+    for (auto i = 0u; i < length; i++) {
+        if (str[i] == '\\') {
+            validateHexCode(reinterpret_cast<const uint8_t*>(str), length, i);
+            auto firstByte = HexFormatConstants::HEX_MAP[(
+                unsigned char)str[i + HexFormatConstants::FIRST_BYTE_POS]];
+            auto secondByte = HexFormatConstants::HEX_MAP[(
+                unsigned char)str[i + HexFormatConstants::SECOND_BYTES_POS]];
+            resultBuffer[resultPos++] =
+                (firstByte << HexFormatConstants::NUM_BYTES_TO_SHIFT_FOR_FIRST_BYTE) + secondByte;
+            i += HexFormatConstants::LENGTH - 1;
+        } else {
+            resultBuffer[resultPos++] = str[i];
+        }
+    }
+    return resultPos;
+}
+
+std::string Blob::toString(const uint8_t* value, uint64_t len) {
+    std::string result;
+    for (auto i = 0u; i < len; i++) {
+        if (isRegularChar(value[i])) {
+            // ascii characters are rendered as-is.
+            result += value[i];
+        } else {
+            auto firstByte = value[i] >> HexFormatConstants::NUM_BYTES_TO_SHIFT_FOR_FIRST_BYTE;
+            auto secondByte = value[i] & HexFormatConstants::SECOND_BYTE_MASK;
+            // non-ascii characters are rendered as hexadecimal (e.g. \x00).
+            result += '\\';
+            result += 'x';
+            result += HexFormatConstants::HEX_TABLE[firstByte];
+            result += HexFormatConstants::HEX_TABLE[secondByte];
+        }
+    }
+    return result;
+}
+
+void Blob::validateHexCode(const uint8_t* blobStr, uint64_t length, uint64_t curPos) {
+    if (curPos + HexFormatConstants::LENGTH > length) {
+        throw ConversionException(
+            "Invalid hex escape code encountered in string -> blob conversion: "
+            "unterminated escape code at end of string");
+    }
+    if (memcmp(blobStr + curPos, HexFormatConstants::PREFIX, HexFormatConstants::PREFIX_LENGTH) !=
+            0 ||
+        HexFormatConstants::HEX_MAP[blobStr[curPos + HexFormatConstants::FIRST_BYTE_POS]] < 0 ||
+        HexFormatConstants::HEX_MAP[blobStr[curPos + HexFormatConstants::SECOND_BYTES_POS]] < 0) {
+        throw ConversionException(
+            stringFormat("Invalid hex escape code encountered in string -> blob conversion: {}",
+                std::string((char*)blobStr + curPos, HexFormatConstants::LENGTH)));
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/date_t.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/date_t.cpp
new file mode 100644
index 0000000000..c7ab372ee0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/date_t.cpp
@@ -0,0 +1,485 @@
+#include "common/types/date_t.h"
+
+#include "common/assert.h"
+#include "common/exception/conversion.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+#include "common/types/cast_helpers.h"
+#include "common/types/timestamp_t.h"
+#include "re2.h"
+
+namespace lbug {
+namespace common {
+
+date_t::date_t() : days{0} {}
+
+date_t::date_t(int32_t days_p) : days(days_p) {}
+
+bool date_t::operator==(const date_t& rhs) const {
+    return days == rhs.days;
+}
+
+bool date_t::operator!=(const date_t& rhs) const {
+    return days != rhs.days;
+}
+
+bool date_t::operator<=(const date_t& rhs) const {
+    return days <= rhs.days;
+}
+
+bool date_t::operator<(const date_t& rhs) const {
+    return days < rhs.days;
+}
+
+bool date_t::operator>(const date_t& rhs) const {
+    return days > rhs.days;
+}
+
+bool date_t::operator>=(const date_t& rhs) const {
+    return days >= rhs.days;
+}
+
+date_t date_t::operator+(const interval_t& interval) const {
+    date_t result{};
+    if (interval.months != 0) {
+        int32_t year = 0, month = 0, day = 0, maxDayInMonth = 0;
+        Date::convert(*this, year, month, day);
+        int32_t year_diff = interval.months / Interval::MONTHS_PER_YEAR;
+        year += year_diff;
+        month += interval.months - year_diff * Interval::MONTHS_PER_YEAR;
+        if (month > Interval::MONTHS_PER_YEAR) {
+            year++;
+            month -= Interval::MONTHS_PER_YEAR;
+        } else if (month <= 0) {
+            year--;
+            month += Interval::MONTHS_PER_YEAR;
+        }
+        // handle date overflow
+        // example: 2020-01-31 + "1 months"
+        maxDayInMonth = Date::monthDays(year, month);
+        day = day > maxDayInMonth ? maxDayInMonth : day;
+        result = Date::fromDate(year, month, day);
+    } else {
+        result = *this;
+    }
+    if (interval.days != 0) {
+        result.days += interval.days;
+    }
+    if (interval.micros != 0) {
+        result.days += int32_t(interval.micros / Interval::MICROS_PER_DAY);
+    }
+    return result;
+}
+
+date_t date_t::operator-(const interval_t& interval) const {
+    interval_t inverseRight{};
+    inverseRight.months = -interval.months;
+    inverseRight.days = -interval.days;
+    inverseRight.micros = -interval.micros;
+    return *this + inverseRight;
+}
+
+int64_t date_t::operator-(const date_t& rhs) const {
+    return (*this).days - rhs.days;
+}
+
+bool date_t::operator==(const timestamp_t& rhs) const {
+    return Timestamp::fromDateTime(*this, dtime_t(0)).value == rhs.value;
+}
+
+bool date_t::operator!=(const timestamp_t& rhs) const {
+    return !(*this == rhs);
+}
+
+bool date_t::operator<(const timestamp_t& rhs) const {
+    return Timestamp::fromDateTime(*this, dtime_t(0)).value < rhs.value;
+}
+
+bool date_t::operator<=(const timestamp_t& rhs) const {
+    return (*this) < rhs || (*this) == rhs;
+}
+
+bool date_t::operator>(const timestamp_t& rhs) const {
+    return !(*this <= rhs);
+}
+
+bool date_t::operator>=(const timestamp_t& rhs) const {
+    return !(*this < rhs);
+}
+
+date_t date_t::operator+(const int32_t& day) const {
+    return date_t(this->days + day);
+};
+date_t date_t::operator-(const int32_t& day) const {
+    return date_t(this->days - day);
+};
+
+const int32_t Date::NORMAL_DAYS[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
+const int32_t Date::LEAP_DAYS[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
+const int32_t Date::CUMULATIVE_LEAP_DAYS[] = {0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335,
+    366};
+const int32_t Date::CUMULATIVE_DAYS[] = {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334,
+    365};
+const int8_t Date::MONTH_PER_DAY_OF_YEAR[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+    2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+    3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+    4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+    5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+    6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+    7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+    8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10,
+    10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
+    10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+    11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
+    12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12};
+const int8_t Date::LEAP_MONTH_PER_DAY_OF_YEAR[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+    2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+    3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+    4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+    5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+    6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+    7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+    8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
+    9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
+    10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+    11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12,
+    12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12};
+const int32_t Date::CUMULATIVE_YEAR_DAYS[] = {0, 365, 730, 1096, 1461, 1826, 2191, 2557, 2922, 3287,
+    3652, 4018, 4383, 4748, 5113, 5479, 5844, 6209, 6574, 6940, 7305, 7670, 8035, 8401, 8766, 9131,
+    9496, 9862, 10227, 10592, 10957, 11323, 11688, 12053, 12418, 12784, 13149, 13514, 13879, 14245,
+    14610, 14975, 15340, 15706, 16071, 16436, 16801, 17167, 17532, 17897, 18262, 18628, 18993,
+    19358, 19723, 20089, 20454, 20819, 21184, 21550, 21915, 22280, 22645, 23011, 23376, 23741,
+    24106, 24472, 24837, 25202, 25567, 25933, 26298, 26663, 27028, 27394, 27759, 28124, 28489,
+    28855, 29220, 29585, 29950, 30316, 30681, 31046, 31411, 31777, 32142, 32507, 32872, 33238,
+    33603, 33968, 34333, 34699, 35064, 35429, 35794, 36160, 36525, 36890, 37255, 37621, 37986,
+    38351, 38716, 39082, 39447, 39812, 40177, 40543, 40908, 41273, 41638, 42004, 42369, 42734,
+    43099, 43465, 43830, 44195, 44560, 44926, 45291, 45656, 46021, 46387, 46752, 47117, 47482,
+    47847, 48212, 48577, 48942, 49308, 49673, 50038, 50403, 50769, 51134, 51499, 51864, 52230,
+    52595, 52960, 53325, 53691, 54056, 54421, 54786, 55152, 55517, 55882, 56247, 56613, 56978,
+    57343, 57708, 58074, 58439, 58804, 59169, 59535, 59900, 60265, 60630, 60996, 61361, 61726,
+    62091, 62457, 62822, 63187, 63552, 63918, 64283, 64648, 65013, 65379, 65744, 66109, 66474,
+    66840, 67205, 67570, 67935, 68301, 68666, 69031, 69396, 69762, 70127, 70492, 70857, 71223,
+    71588, 71953, 72318, 72684, 73049, 73414, 73779, 74145, 74510, 74875, 75240, 75606, 75971,
+    76336, 76701, 77067, 77432, 77797, 78162, 78528, 78893, 79258, 79623, 79989, 80354, 80719,
+    81084, 81450, 81815, 82180, 82545, 82911, 83276, 83641, 84006, 84371, 84736, 85101, 85466,
+    85832, 86197, 86562, 86927, 87293, 87658, 88023, 88388, 88754, 89119, 89484, 89849, 90215,
+    90580, 90945, 91310, 91676, 92041, 92406, 92771, 93137, 93502, 93867, 94232, 94598, 94963,
+    95328, 95693, 96059, 96424, 96789, 97154, 97520, 97885, 98250, 98615, 98981, 99346, 99711,
+    100076, 100442, 100807, 101172, 101537, 101903, 102268, 102633, 102998, 103364, 103729, 104094,
+    104459, 104825, 105190, 105555, 105920, 106286, 106651, 107016, 107381, 107747, 108112, 108477,
+    108842, 109208, 109573, 109938, 110303, 110669, 111034, 111399, 111764, 112130, 112495, 112860,
+    113225, 113591, 113956, 114321, 114686, 115052, 115417, 115782, 116147, 116513, 116878, 117243,
+    117608, 117974, 118339, 118704, 119069, 119435, 119800, 120165, 120530, 120895, 121260, 121625,
+    121990, 122356, 122721, 123086, 123451, 123817, 124182, 124547, 124912, 125278, 125643, 126008,
+    126373, 126739, 127104, 127469, 127834, 128200, 128565, 128930, 129295, 129661, 130026, 130391,
+    130756, 131122, 131487, 131852, 132217, 132583, 132948, 133313, 133678, 134044, 134409, 134774,
+    135139, 135505, 135870, 136235, 136600, 136966, 137331, 137696, 138061, 138427, 138792, 139157,
+    139522, 139888, 140253, 140618, 140983, 141349, 141714, 142079, 142444, 142810, 143175, 143540,
+    143905, 144271, 144636, 145001, 145366, 145732, 146097};
+
+void Date::extractYearOffset(int32_t& n, int32_t& year, int32_t& year_offset) {
+    year = Date::EPOCH_YEAR;
+    // first we normalize n to be in the year range [1970, 2370]
+    // since leap years repeat every 400 years, we can safely normalize just by "shifting" the
+    // CumulativeYearDays array
+    while (n < 0) {
+        n += Date::DAYS_PER_YEAR_INTERVAL;
+        year -= Date::YEAR_INTERVAL;
+    }
+    while (n >= Date::DAYS_PER_YEAR_INTERVAL) {
+        n -= Date::DAYS_PER_YEAR_INTERVAL;
+        year += Date::YEAR_INTERVAL;
+    }
+    // interpolation search
+    // we can find an upper bound of the year by assuming each year has 365 days
+    year_offset = n / 365;
+    // because of leap years we might be off by a little bit: compensate by decrementing the year
+    // offset until we find our year
+    while (n < Date::CUMULATIVE_YEAR_DAYS[year_offset]) {
+        year_offset--;
+        KU_ASSERT(year_offset >= 0);
+    }
+    year += year_offset;
+    KU_ASSERT(n >= Date::CUMULATIVE_YEAR_DAYS[year_offset]);
+}
+
+void Date::convert(date_t date, int32_t& out_year, int32_t& out_month, int32_t& out_day) {
+    auto n = date.days;
+    int32_t year_offset = 0;
+    Date::extractYearOffset(n, out_year, year_offset);
+
+    out_day = n - Date::CUMULATIVE_YEAR_DAYS[year_offset];
+    KU_ASSERT(out_day >= 0 && out_day <= 365);
+
+    bool is_leap_year = (Date::CUMULATIVE_YEAR_DAYS[year_offset + 1] -
+                            Date::CUMULATIVE_YEAR_DAYS[year_offset]) == 366;
+    if (is_leap_year) {
+        out_month = Date::LEAP_MONTH_PER_DAY_OF_YEAR[out_day];
+        out_day -= Date::CUMULATIVE_LEAP_DAYS[out_month - 1];
+    } else {
+        out_month = Date::MONTH_PER_DAY_OF_YEAR[out_day];
+        out_day -= Date::CUMULATIVE_DAYS[out_month - 1];
+    }
+    out_day++;
+    KU_ASSERT(out_day > 0 && out_day <= (is_leap_year ? Date::LEAP_DAYS[out_month] :
+                                                        Date::NORMAL_DAYS[out_month]));
+    KU_ASSERT(out_month > 0 && out_month <= 12);
+    KU_ASSERT(Date::isValid(out_year, out_month, out_day));
+}
+
+date_t Date::fromDate(int32_t year, int32_t month, int32_t day) {
+    int32_t n = 0;
+    if (!Date::isValid(year, month, day)) {
+        throw ConversionException(stringFormat("Date out of range: {}-{}-{}.", year, month, day));
+    }
+    while (year < 1970) {
+        year += Date::YEAR_INTERVAL;
+        n -= Date::DAYS_PER_YEAR_INTERVAL;
+    }
+    while (year >= 2370) {
+        year -= Date::YEAR_INTERVAL;
+        n += Date::DAYS_PER_YEAR_INTERVAL;
+    }
+    n += Date::CUMULATIVE_YEAR_DAYS[year - 1970];
+    n += Date::isLeapYear(year) ? Date::CUMULATIVE_LEAP_DAYS[month - 1] :
+                                  Date::CUMULATIVE_DAYS[month - 1];
+    n += day - 1;
+    return date_t(n);
+}
+
+bool Date::parseDoubleDigit(const char* buf, uint64_t len, uint64_t& pos, int32_t& result) {
+    if (pos < len && StringUtils::CharacterIsDigit(buf[pos])) {
+        result = buf[pos++] - '0';
+        if (pos < len && StringUtils::CharacterIsDigit(buf[pos])) {
+            result = (buf[pos++] - '0') + result * 10;
+        }
+        return true;
+    }
+    return false;
+}
+
+// Checks if the date std::string given in buf complies with the YYYY:MM:DD format. Ignores leading
+// and trailing spaces. Removes from the original DuckDB code the following features:
+// 1) we don't parse "negative years", i.e., date formats that start with -.
+// 2) we don't parse dates that end with trailing "BC".
+bool Date::tryConvertDate(const char* buf, uint64_t len, uint64_t& pos, date_t& result,
+    bool allowTrailing) {
+    if (len == 0) {
+        return false;
+    }
+
+    int32_t day = 0;
+    int32_t month = -1;
+    int32_t year = 0;
+
+    // skip leading spaces
+    while (pos < len && StringUtils::isSpace(buf[pos])) {
+        pos++;
+    }
+
+    if (pos >= len) {
+        return false;
+    }
+
+    if (!StringUtils::CharacterIsDigit(buf[pos])) {
+        return false;
+    }
+    // first parse the year
+    for (; pos < len && StringUtils::CharacterIsDigit(buf[pos]); pos++) {
+        year = (buf[pos] - '0') + year * 10;
+        if (year > Date::MAX_YEAR) {
+            break;
+        }
+    }
+
+    if (pos >= len) {
+        return false;
+    }
+
+    // fetch the separator
+    char sep = buf[pos++];
+    if (sep != ' ' && sep != '-' && sep != '/' && sep != '\\') {
+        // invalid separator
+        return false;
+    }
+
+    // parse the month
+    if (!Date::parseDoubleDigit(buf, len, pos, month)) {
+        return false;
+    }
+
+    // Also checks that the separator is not the end of the string
+    if (pos + 1 >= len) {
+        return false;
+    }
+
+    if (buf[pos++] != sep) {
+        return false;
+    }
+
+    // now parse the day
+    if (!Date::parseDoubleDigit(buf, len, pos, day)) {
+        return false;
+    }
+
+    // skip trailing spaces
+    while (pos < len && StringUtils::isSpace((unsigned char)buf[pos])) {
+        pos++;
+    }
+    // check position. if end was not reached, non-space chars remaining
+    if (pos < len && !allowTrailing) {
+        return false;
+    }
+
+    try {
+        result = Date::fromDate(year, month, day);
+    } catch (ConversionException& exc) {
+        return false;
+    }
+    return true;
+}
+
+date_t Date::fromCString(const char* str, uint64_t len) {
+    date_t result;
+    uint64_t pos = 0;
+    if (!tryConvertDate(str, len, pos, result)) {
+        throw ConversionException("Error occurred during parsing date. Given: \"" +
+                                  std::string(str, len) + "\". Expected format: (YYYY-MM-DD)");
+    }
+    return result;
+}
+
+std::string Date::toString(date_t date) {
+    int32_t dateUnits[3];
+    uint64_t yearLength = 0;
+    bool addBC = false;
+    Date::convert(date, dateUnits[0], dateUnits[1], dateUnits[2]);
+
+    auto length = DateToStringCast::Length(dateUnits, yearLength, addBC);
+    auto buffer = std::make_unique<char[]>(length);
+    DateToStringCast::Format(buffer.get(), dateUnits, yearLength, addBC);
+    return std::string(buffer.get(), length);
+}
+
+bool Date::isLeapYear(int32_t year) {
+    return year % 4 == 0 && (year % 100 != 0 || year % 400 == 0);
+}
+
+bool Date::isValid(int32_t year, int32_t month, int32_t day) {
+    if (month < 1 || month > 12) {
+        return false;
+    }
+    if (year < Date::MIN_YEAR || year > Date::MAX_YEAR) {
+        return false;
+    }
+    if (day < 1) {
+        return false;
+    }
+    return Date::isLeapYear(year) ? day <= Date::LEAP_DAYS[month] : day <= Date::NORMAL_DAYS[month];
+}
+
+int32_t Date::monthDays(int32_t year, int32_t month) {
+    KU_ASSERT(month >= 1 && month <= 12);
+    return Date::isLeapYear(year) ? Date::LEAP_DAYS[month] : Date::NORMAL_DAYS[month];
+}
+
+std::string Date::getDayName(date_t date) {
+    std::string dayNames[] = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday",
+        "Saturday"};
+    return dayNames[(date.days < 0 ? 7 - ((-date.days + 3) % 7) : ((date.days + 3) % 7) + 1) % 7];
+}
+
+std::string Date::getMonthName(date_t date) {
+    std::string monthNames[] = {"January", "February", "March", "April", "May", "June", "July",
+        "August", "September", "October", "November", "December"};
+    int32_t year = 0, month = 0, day = 0;
+    Date::convert(date, year, month, day);
+    return monthNames[month - 1];
+}
+
+date_t Date::getLastDay(date_t date) {
+    int32_t year = 0, month = 0, day = 0;
+    Date::convert(date, year, month, day);
+    year += (month / 12);
+    month %= 12;
+    ++month;
+    return Date::fromDate(year, month, 1) - 1;
+}
+
+int32_t Date::getDatePart(DatePartSpecifier specifier, date_t date) {
+    int32_t year = 0, month = 0, day = 0;
+    Date::convert(date, year, month, day);
+    switch (specifier) {
+    case DatePartSpecifier::YEAR: {
+        int32_t yearOffset = 0;
+        extractYearOffset(date.days, year, yearOffset);
+        return year;
+    }
+    case DatePartSpecifier::MONTH:
+        return month;
+    case DatePartSpecifier::DAY:
+        return day;
+    case DatePartSpecifier::DECADE:
+        return year / 10;
+    case DatePartSpecifier::CENTURY:
+        // From the PG docs:
+        // "The first century starts at 0001-01-01 00:00:00 AD, although they did not know it at the
+        // time. This definition applies to all Gregorian calendar countries. There is no century
+        // number 0, you go from -1 century to 1 century. If you disagree with this, please write
+        // your complaint to: Pope, Cathedral Saint-Peter of Roma, Vatican." (To be fair, His
+        // Holiness had nothing to do with this - it was the lack of zero in the counting systems of
+        // the time...).
+        return year > 0 ? ((year - 1) / 100) + 1 : (year / 100) - 1;
+    case DatePartSpecifier::MILLENNIUM:
+        return year > 0 ? ((year - 1) / 1000) + 1 : (year / 1000) - 1;
+    case DatePartSpecifier::QUARTER:
+        return (month - 1) / Interval::MONTHS_PER_QUARTER + 1;
+    default:
+        return 0;
+    }
+}
+
+date_t Date::trunc(DatePartSpecifier specifier, date_t date) {
+    switch (specifier) {
+    case DatePartSpecifier::YEAR:
+        return Date::fromDate(Date::getDatePart(DatePartSpecifier::YEAR, date), 1 /* month */,
+            1 /* day */);
+    case DatePartSpecifier::MONTH:
+        return Date::fromDate(Date::getDatePart(DatePartSpecifier::YEAR, date),
+            Date::getDatePart(DatePartSpecifier::MONTH, date), 1 /* day */);
+    case DatePartSpecifier::DAY:
+        return date;
+    case DatePartSpecifier::DECADE:
+        return Date::fromDate((Date::getDatePart(DatePartSpecifier::YEAR, date) / 10) * 10,
+            1 /* month */, 1 /* day */);
+    case DatePartSpecifier::CENTURY:
+        return Date::fromDate((Date::getDatePart(DatePartSpecifier::YEAR, date) / 100) * 100,
+            1 /* month */, 1 /* day */);
+    case DatePartSpecifier::MILLENNIUM:
+        return Date::fromDate((Date::getDatePart(DatePartSpecifier::YEAR, date) / 1000) * 1000,
+            1 /* month */, 1 /* day */);
+    case DatePartSpecifier::QUARTER: {
+        int32_t year = 0, month = 0, day = 0;
+        Date::convert(date, year, month, day);
+        month = 1 + (((month - 1) / 3) * 3);
+        return Date::fromDate(year, month, 1);
+    }
+    default:
+        return date;
+    }
+}
+
+int64_t Date::getEpochNanoSeconds(const date_t& date) {
+    return ((int64_t)date.days) * (Interval::MICROS_PER_DAY * Interval::NANOS_PER_MICRO);
+}
+
+const regex::RE2& Date::regexPattern() {
+    static regex::RE2 retval("\\d{4}/\\d{1,2}/\\d{1,2}|\\d{4}-\\d{1,2}-\\d{1,2}|\\d{4} \\d{1,2} "
+                             "\\d{1,2}|\\d{4}\\\\\\d{1,2}\\\\\\d{1,2}");
+    return retval;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/dtime_t.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/dtime_t.cpp
new file mode 100644
index 0000000000..eaa7836075
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/dtime_t.cpp
@@ -0,0 +1,222 @@
+#include "common/types/dtime_t.h"
+
+#include <memory>
+
+#include "common/assert.h"
+#include "common/exception/conversion.h"
+#include "common/string_format.h"
+#include "common/types/cast_helpers.h"
+#include "common/types/date_t.h"
+
+namespace lbug {
+namespace common {
+
+static_assert(sizeof(dtime_t) == sizeof(int64_t), "dtime_t was padded");
+
+dtime_t::dtime_t() : micros(0) {}
+
+dtime_t::dtime_t(int64_t micros_p) : micros(micros_p) {}
+
+dtime_t& dtime_t::operator=(int64_t micros_p) {
+    micros = micros_p;
+    return *this;
+}
+
+dtime_t::operator int64_t() const {
+    return micros;
+}
+
+dtime_t::operator double() const {
+    return micros;
+}
+
+bool dtime_t::operator==(const dtime_t& rhs) const {
+    return micros == rhs.micros;
+}
+
+bool dtime_t::operator!=(const dtime_t& rhs) const {
+    return micros != rhs.micros;
+}
+
+bool dtime_t::operator<=(const dtime_t& rhs) const {
+    return micros <= rhs.micros;
+}
+
+bool dtime_t::operator<(const dtime_t& rhs) const {
+    return micros < rhs.micros;
+}
+
+bool dtime_t::operator>(const dtime_t& rhs) const {
+    return micros > rhs.micros;
+}
+
+bool dtime_t::operator>=(const dtime_t& rhs) const {
+    return micros >= rhs.micros;
+}
+
+bool Time::tryConvertInternal(const char* buf, uint64_t len, uint64_t& pos, dtime_t& result) {
+    int32_t hour = -1, min = -1, sec = -1, micros = -1;
+    pos = 0;
+
+    if (len == 0) {
+        return false;
+    }
+
+    // skip leading spaces
+    while (pos < len && isspace(buf[pos])) {
+        pos++;
+    }
+
+    if (pos >= len) {
+        return false;
+    }
+
+    if (!isdigit(buf[pos])) {
+        return false;
+    }
+
+    // Allow up to 9 digit hours to support intervals
+    hour = 0;
+    for (int32_t digits = 9; pos < len && isdigit(buf[pos]); ++pos) {
+        if (digits-- > 0) {
+            hour = hour * 10 + (buf[pos] - '0');
+        } else {
+            return false;
+        }
+    }
+
+    if (pos >= len) {
+        return false;
+    }
+
+    // fetch the separator
+    char sep = buf[pos++];
+    if (sep != ':') {
+        // invalid separator
+        return false;
+    }
+
+    if (!Date::parseDoubleDigit(buf, len, pos, min)) {
+        return false;
+    }
+    if (min < 0 || min >= 60) {
+        return false;
+    }
+
+    if (pos >= len) {
+        return false;
+    }
+
+    if (buf[pos++] != sep) {
+        return false;
+    }
+
+    if (!Date::parseDoubleDigit(buf, len, pos, sec)) {
+        return false;
+    }
+    if (sec < 0 || sec >= 60) {
+        return false;
+    }
+
+    micros = 0;
+    if (pos < len && buf[pos] == '.') {
+        pos++;
+        // we expect some microseconds
+        int32_t mult = 100000;
+        for (; pos < len && isdigit(buf[pos]); pos++, mult /= 10) {
+            if (mult > 0) {
+                micros += (buf[pos] - '0') * mult;
+            }
+        }
+    }
+
+    result = Time::fromTimeInternal(hour, min, sec, micros);
+    return true;
+}
+
+bool Time::tryConvertInterval(const char* buf, uint64_t len, uint64_t& pos, dtime_t& result) {
+    if (!Time::tryConvertInternal(buf, len, pos, result)) {
+        return false;
+    }
+    // check remaining string for non-space characters
+    // skip trailing spaces
+    while (pos < len && isspace(buf[pos])) {
+        pos++;
+    }
+    // check position. if end was not reached, non-space chars remaining
+    if (pos < len) {
+        return false;
+    }
+    return true;
+}
+
+// string format is hh:mm:ss[.mmmmmm] (ISO 8601) (m represent microseconds)
+// microseconds is optional, timezone is currently not supported
+bool Time::tryConvertTime(const char* buf, uint64_t len, uint64_t& pos, dtime_t& result) {
+    if (!Time::tryConvertInternal(buf, len, pos, result)) {
+        return false;
+    }
+    return result.micros < Interval::MICROS_PER_DAY;
+}
+
+dtime_t Time::fromCString(const char* buf, uint64_t len) {
+    dtime_t result;
+    uint64_t pos = 0;
+    if (!Time::tryConvertTime(buf, len, pos, result)) {
+        throw ConversionException(stringFormat("Error occurred during parsing time. Given: \"{}\". "
+                                               "Expected format: (hh:mm:ss[.zzzzzz]).",
+            std::string(buf, len)));
+    }
+    return result;
+}
+
+std::string Time::toString(dtime_t time) {
+    int32_t time_units[4];
+    Time::convert(time, time_units[0], time_units[1], time_units[2], time_units[3]);
+
+    char micro_buffer[6];
+    auto length = TimeToStringCast::Length(time_units, micro_buffer);
+    auto buffer = std::unique_ptr<char[]>(new char[length]);
+    TimeToStringCast::Format(buffer.get(), length, time_units, micro_buffer);
+    return std::string(buffer.get(), length);
+}
+
+bool Time::isValid(int32_t hour, int32_t minute, int32_t second, int32_t microseconds) {
+    if (hour > 23 || hour < 0 || minute > 59 || minute < 0 || second > 59 || second < 0 ||
+        microseconds > 999999 || microseconds < 0) {
+        return false;
+    }
+    return true;
+}
+
+dtime_t Time::fromTimeInternal(int32_t hour, int32_t minute, int32_t second, int32_t microseconds) {
+    int64_t result = 0;
+    result = hour;                                             // hours
+    result = result * Interval::MINS_PER_HOUR + minute;        // hours -> minutes
+    result = result * Interval::SECS_PER_MINUTE + second;      // minutes -> seconds
+    result = result * Interval::MICROS_PER_SEC + microseconds; // seconds -> microseconds
+    return dtime_t(result);
+}
+
+dtime_t Time::fromTime(int32_t hour, int32_t minute, int32_t second, int32_t microseconds) {
+    if (!Time::isValid(hour, minute, second, microseconds)) {
+        throw ConversionException(stringFormat("Time field value out of range: {}:{}:{}[.{}].",
+            hour, minute, second, microseconds));
+    }
+    return Time::fromTimeInternal(hour, minute, second, microseconds);
+}
+
+void Time::convert(dtime_t dtime, int32_t& hour, int32_t& min, int32_t& sec, int32_t& micros) {
+    int64_t time = dtime.micros;
+    hour = int32_t(time / Interval::MICROS_PER_HOUR);
+    time -= int64_t(hour) * Interval::MICROS_PER_HOUR;
+    min = int32_t(time / Interval::MICROS_PER_MINUTE);
+    time -= int64_t(min) * Interval::MICROS_PER_MINUTE;
+    sec = int32_t(time / Interval::MICROS_PER_SEC);
+    time -= int64_t(sec) * Interval::MICROS_PER_SEC;
+    micros = int32_t(time);
+    KU_ASSERT(Time::isValid(hour, min, sec, micros));
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/int128_t.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/int128_t.cpp
new file mode 100644
index 0000000000..f1d5cd6b1f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/int128_t.cpp
@@ -0,0 +1,778 @@
+#include "common/types/int128_t.h"
+
+#include <cmath>
+#include <cstdint>
+
+#include "common/exception/runtime.h"
+#include "common/numeric_utils.h"
+#include "common/type_utils.h"
+#include "common/types/uint128_t.h"
+#include "function/cast/functions/numeric_limits.h"
+#include "function/hash/hash_functions.h"
+#include <bit>
+
+namespace lbug::common {
+
+static uint8_t positiveInt128BitsAmount(int128_t input) {
+    if (input.high) {
+        return 128 - std::countl_zero((uint64_t)input.high);
+    } else {
+        return 64 - std::countl_zero(input.low);
+    }
+}
+
+static bool positiveInt128IsBitSet(int128_t input, uint8_t bit) {
+    if (bit < 64) {
+        return input.low & (1ULL << uint64_t(bit));
+    } else {
+        return input.high & (1ULL << uint64_t(bit - 64));
+    }
+}
+
+int128_t positiveInt128LeftShift(int128_t lhs, uint32_t amount) {
+    int128_t result{};
+    result.low = lhs.low << amount;
+    result.high = (lhs.high << amount) + (lhs.low >> (64 - amount));
+    return result;
+}
+
+int128_t Int128_t::divModPositive(int128_t lhs, uint64_t rhs, uint64_t& remainder) {
+    int128_t result{0};
+    remainder = 0;
+
+    for (uint8_t i = positiveInt128BitsAmount(lhs); i > 0; i--) {
+        result = positiveInt128LeftShift(result, 1);
+        remainder <<= 1;
+        if (positiveInt128IsBitSet(lhs, i - 1)) {
+            remainder++;
+        }
+        if (remainder >= rhs) {
+            remainder -= rhs;
+            result.low++;
+            if (result.low == 0) {
+                result.high++;
+            }
+        }
+    }
+    return result;
+}
+
+std::string Int128_t::toString(int128_t input) {
+    bool isMin = (input.high == INT64_MIN && input.low == 0);
+    bool negative = input.high < 0;
+
+    if (isMin) {
+
+        uint64_t remainder = 0;
+        int128_t quotient = divModPositive(input, 10, remainder);
+
+        std::string result = toString(quotient);
+
+        result += static_cast<char>('0' + remainder);
+
+        return "-" + result;
+    }
+
+    if (negative) {
+        negateInPlace(input);
+    }
+
+    std::string result;
+    uint64_t remainder = 0;
+
+    while (input.high != 0 || input.low != 0) {
+        input = divModPositive(input, 10, remainder);
+        result = std::string(1, '0' + remainder) + std::move(result);
+    }
+
+    if (result.empty()) {
+        result = "0";
+    }
+
+    return negative ? "-" + result : result;
+}
+
+bool Int128_t::addInPlace(int128_t& lhs, int128_t rhs) {
+    bool lhsPositive = lhs.high >= 0;
+    bool rhsPositive = rhs.high >= 0;
+    int overflow = lhs.low + rhs.low < lhs.low;
+    if (rhs.high >= 0) {
+        if (lhs.high > INT64_MAX - rhs.high - overflow) {
+            return false;
+        }
+        lhs.high = lhs.high + rhs.high + overflow;
+    } else {
+        if (lhs.high < INT64_MIN - rhs.high - overflow) {
+            return false;
+        }
+        lhs.high = lhs.high + rhs.high + overflow;
+    }
+    lhs.low += rhs.low;
+    if (lhsPositive && rhsPositive && lhs.high == INT64_MIN && lhs.low == 0) {
+        return false;
+    }
+    return true;
+}
+
+bool Int128_t::subInPlace(int128_t& lhs, int128_t rhs) {
+    int underflow = lhs.low - rhs.low > lhs.low;
+    if (rhs.high >= 0) {
+        if (lhs.high < INT64_MIN + rhs.high + underflow) {
+            return false;
+        }
+        lhs.high = lhs.high - rhs.high - underflow;
+    } else {
+        if (lhs.high > INT64_MIN && lhs.high - 1 >= INT64_MAX + rhs.high + underflow) {
+            return false;
+        }
+        lhs.high = lhs.high - rhs.high - underflow;
+    }
+    lhs.low -= rhs.low;
+    if (lhs.high == INT64_MIN && lhs.low == 0) {
+        return false;
+    }
+    return true;
+}
+
+int128_t Int128_t::Add(int128_t lhs, const int128_t rhs) {
+    if (!addInPlace(lhs, rhs)) {
+        throw common::OverflowException("INT128 is out of range: cannot add.");
+    }
+    return lhs;
+}
+
+int128_t Int128_t::Sub(int128_t lhs, const int128_t rhs) {
+    if (!subInPlace(lhs, rhs)) {
+        throw common::OverflowException("INT128 is out of range: cannot subtract.");
+    }
+    return lhs;
+}
+
+bool Int128_t::tryMultiply(int128_t lhs, int128_t rhs, int128_t& result) {
+    bool lhs_negative = lhs.high < 0;
+    bool rhs_negative = rhs.high < 0;
+    if (lhs_negative) {
+        negateInPlace(lhs);
+    }
+    if (rhs_negative) {
+        negateInPlace(rhs);
+    }
+#if ((__GNUC__ >= 5) || defined(__clang__)) && defined(__SIZEOF_INT128__)
+    __uint128_t left = __uint128_t(lhs.low) + (__uint128_t(lhs.high) << 64);
+    __uint128_t right = __uint128_t(rhs.low) + (__uint128_t(rhs.high) << 64);
+    __uint128_t result_i128 = 0;
+    if (__builtin_mul_overflow(left, right, &result_i128)) {
+        return false;
+    }
+    auto high = uint64_t(result_i128 >> 64);
+    if (high & 0x8000000000000000) {
+        return false;
+    }
+    result.high = int64_t(high);
+    result.low = uint64_t(result_i128 & 0xffffffffffffffff);
+#else
+    // Multiply code adapted from:
+    // https://github.com/calccrypto/uint128_t/blob/master/uint128_t.cpp
+    // License: https://github.com/calccrypto/uint128_t/blob/c%2B%2B11_14/LICENSE
+    uint64_t top[4] = {uint64_t(lhs.high) >> 32, uint64_t(lhs.high) & 0xffffffff, lhs.low >> 32,
+        lhs.low & 0xffffffff};
+    uint64_t bottom[4] = {uint64_t(rhs.high) >> 32, uint64_t(rhs.high) & 0xffffffff, rhs.low >> 32,
+        rhs.low & 0xffffffff};
+    uint64_t products[4][4];
+
+    // multiply each component of the values
+    for (auto x = 0; x < 4; x++) {
+        for (auto y = 0; y < 4; y++) {
+            products[x][y] = top[x] * bottom[y];
+        }
+    }
+
+    // if any of these products are set to a non-zero value, there is always an overflow
+    if (products[0][0] || products[0][1] || products[0][2] || products[1][0] || products[2][0] ||
+        products[1][1]) {
+        return false;
+    }
+    // if the high bits of any of these are set, there is always an overflow
+    if ((products[0][3] & 0xffffffff80000000) || (products[1][2] & 0xffffffff80000000) ||
+        (products[2][1] & 0xffffffff80000000) || (products[3][0] & 0xffffffff80000000)) {
+        return false;
+    }
+
+    // otherwise we merge the result of the different products together in-order
+
+    // first row
+    uint64_t fourth32 = (products[3][3] & 0xffffffff);
+    uint64_t third32 = (products[3][2] & 0xffffffff) + (products[3][3] >> 32);
+    uint64_t second32 = (products[3][1] & 0xffffffff) + (products[3][2] >> 32);
+    uint64_t first32 = (products[3][0] & 0xffffffff) + (products[3][1] >> 32);
+
+    // second row
+    third32 += (products[2][3] & 0xffffffff);
+    second32 += (products[2][2] & 0xffffffff) + (products[2][3] >> 32);
+    first32 += (products[2][1] & 0xffffffff) + (products[2][2] >> 32);
+
+    // third row
+    second32 += (products[1][3] & 0xffffffff);
+    first32 += (products[1][2] & 0xffffffff) + (products[1][3] >> 32);
+
+    // fourth row
+    first32 += (products[0][3] & 0xffffffff);
+
+    // move carry to next digit
+    third32 += fourth32 >> 32;
+    second32 += third32 >> 32;
+    first32 += second32 >> 32;
+
+    // check if the combination of the different products resulted in an overflow
+    if (first32 & 0xffffff80000000) {
+        return false;
+    }
+
+    // remove carry from current digit
+    fourth32 &= 0xffffffff;
+    third32 &= 0xffffffff;
+    second32 &= 0xffffffff;
+    first32 &= 0xffffffff;
+
+    // combine components
+    result.low = (third32 << 32) | fourth32;
+    result.high = (first32 << 32) | second32;
+#endif
+    if (lhs_negative ^ rhs_negative) {
+        negateInPlace(result);
+    }
+    return true;
+}
+
+int128_t Int128_t::Mul(int128_t lhs, int128_t rhs) {
+    int128_t result{};
+    if (!tryMultiply(lhs, rhs, result)) {
+        throw common::OverflowException("INT128 is out of range: cannot multiply.");
+    }
+    return result;
+}
+
+int128_t Int128_t::divMod(int128_t lhs, int128_t rhs, int128_t& remainder) {
+    bool lhs_negative = lhs.high < 0;
+    bool rhs_negative = rhs.high < 0;
+    if (lhs_negative) {
+        negateInPlace(lhs);
+    }
+    if (rhs_negative) {
+        negateInPlace(rhs);
+    }
+
+    // divMod code adapted from:
+    // https://github.com/calccrypto/uint128_t/blob/master/uint128_t.cpp
+    // License: https://github.com/calccrypto/uint128_t/blob/c%2B%2B11_14/LICENSE
+    // initialize the result and remainder to 0
+    int128_t div_result{0};
+    remainder.low = 0;
+    remainder.high = 0;
+
+    // now iterate over the amount of bits that are set in the LHS
+    for (uint8_t x = positiveInt128BitsAmount(lhs); x > 0; x--) {
+        // left-shift the current result and remainder by 1
+        div_result = positiveInt128LeftShift(div_result, 1);
+        remainder = positiveInt128LeftShift(remainder, 1);
+
+        // we get the value of the bit at position X, where position 0 is the least-significant bit
+        if (positiveInt128IsBitSet(lhs, x - 1)) {
+            // increment the remainder
+            addInPlace(remainder, 1);
+        }
+        if (greaterThanOrEquals(remainder, rhs)) {
+            // the remainder has passed the division multiplier: add one to the divide result
+            remainder = Sub(remainder, rhs);
+            addInPlace(div_result, 1);
+        }
+    }
+    if (lhs_negative ^ rhs_negative) {
+        negateInPlace(div_result);
+    }
+    if (lhs_negative) {
+        negateInPlace(remainder);
+    }
+    return div_result;
+}
+
+int128_t Int128_t::Div(int128_t lhs, int128_t rhs) {
+    if (rhs.high == 0 && rhs.low == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    int128_t remainder{};
+    return divMod(lhs, rhs, remainder);
+}
+
+int128_t Int128_t::Mod(int128_t lhs, int128_t rhs) {
+    if (rhs.high == 0 && rhs.low == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    int128_t result{};
+    divMod(lhs, rhs, result);
+    return result;
+}
+
+int128_t Int128_t::Xor(int128_t lhs, int128_t rhs) {
+    int128_t result{lhs.low ^ rhs.low, lhs.high ^ rhs.high};
+    return result;
+}
+
+int128_t Int128_t::BinaryAnd(int128_t lhs, int128_t rhs) {
+    int128_t result{lhs.low & rhs.low, lhs.high & rhs.high};
+    return result;
+}
+
+int128_t Int128_t::BinaryOr(int128_t lhs, int128_t rhs) {
+    int128_t result{lhs.low | rhs.low, lhs.high | rhs.high};
+    return result;
+}
+
+int128_t Int128_t::BinaryNot(int128_t val) {
+    return int128_t{~val.low, ~val.high};
+}
+
+int128_t Int128_t::LeftShift(int128_t lhs, int amount) {
+    // adapted from
+    // https://github.com/abseil/abseil-cpp/blob/master/absl/numeric/int128.h
+    return amount >= 64 ? int128_t(0, lhs.low << (amount - 64)) :
+           amount == 0  ? lhs :
+                          int128_t{lhs.low << amount,
+                             (lhs.high << amount) |
+                                 (numeric_utils::makeValueSigned(lhs.low >> (64 - amount)))};
+}
+
+int128_t Int128_t::RightShift(int128_t lhs, int amount) {
+    // adapted from
+    // https://github.com/abseil/abseil-cpp/blob/master/absl/numeric/int128.h
+    return amount >= 64 ?
+               // we shift the high value regardless for sign extension
+               int128_t(lhs.high >> (amount - 64), lhs.high >> 63) :
+               amount == 0 ?
+               lhs :
+               int128_t((lhs.low >> amount) | (lhs.high << (64 - amount)), lhs.high >> amount);
+}
+
+//===============================================================================================
+// Cast operation
+//===============================================================================================
+template<class DST, bool SIGNED = true>
+bool TryCastInt128Template(int128_t input, DST& result) {
+    switch (input.high) {
+    case 0:
+        if (input.low <= uint64_t(function::NumericLimits<DST>::maximum())) {
+            result = static_cast<DST>(input.low);
+            return true;
+        }
+        break;
+    case -1:
+        if constexpr (!SIGNED) {
+            throw common::OverflowException(
+                "Cast failed. Cannot cast " + Int128_t::toString(input) + " to unsigned type.");
+        }
+        if (input.low >= function::NumericLimits<uint64_t>::maximum() -
+                             uint64_t(function::NumericLimits<DST>::maximum())) {
+            result = -DST(function::NumericLimits<uint64_t>::maximum() - input.low) - 1;
+            return true;
+        }
+        break;
+    default:
+        break;
+    }
+    return false;
+}
+// we can use the above template if we can get max using something like DST.max
+
+template<>
+bool Int128_t::tryCast(int128_t input, int8_t& result) {
+    return TryCastInt128Template<int8_t>(input, result);
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, int16_t& result) {
+    return TryCastInt128Template<int16_t>(input, result);
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, int32_t& result) {
+    return TryCastInt128Template<int32_t>(input, result);
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, int64_t& result) {
+    return TryCastInt128Template<int64_t>(input, result);
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, uint8_t& result) {
+    return TryCastInt128Template<uint8_t, false>(input, result);
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, uint16_t& result) {
+    return TryCastInt128Template<uint16_t, false>(input, result);
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, uint32_t& result) {
+    return TryCastInt128Template<uint32_t, false>(input, result);
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, uint64_t& result) {
+    return TryCastInt128Template<uint64_t, false>(input, result);
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, uint128_t& result) {
+    if (input.high < 0) {
+        return false;
+    }
+    result.low = input.low;
+    result.high = uint64_t(input.high);
+    return true;
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, float& result) {
+    double temp_res = NAN;
+    tryCast(input, temp_res);
+    result = static_cast<float>(temp_res);
+    return true;
+}
+
+template<class REAL_T>
+bool CastInt128ToFloating(int128_t input, REAL_T& result) {
+    switch (input.high) {
+    case -1:
+        result = -REAL_T(function::NumericLimits<uint64_t>::maximum() - input.low) - 1;
+        break;
+    default:
+        result = REAL_T(input.high) * REAL_T(function::NumericLimits<uint64_t>::maximum()) +
+                 REAL_T(input.low);
+        break;
+    }
+    return true;
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, double& result) {
+    return CastInt128ToFloating<double>(input, result);
+}
+
+template<>
+bool Int128_t::tryCast(int128_t input, long double& result) {
+    return CastInt128ToFloating<long double>(input, result);
+}
+
+template<class SRC>
+int128_t tryCastToTemplate(SRC value) {
+    int128_t result{};
+    result.low = (uint64_t)value;
+    result.high = (value < 0) * -1;
+    return result;
+}
+
+template<>
+bool Int128_t::tryCastTo(int8_t value, int128_t& result) {
+    result = tryCastToTemplate<int8_t>(value);
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(int16_t value, int128_t& result) {
+    result = tryCastToTemplate<int16_t>(value);
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(int32_t value, int128_t& result) {
+    result = tryCastToTemplate<int32_t>(value);
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(int64_t value, int128_t& result) {
+    result = tryCastToTemplate<int64_t>(value);
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(uint8_t value, int128_t& result) {
+    result = tryCastToTemplate<uint8_t>(value);
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(uint16_t value, int128_t& result) {
+    result = tryCastToTemplate<uint16_t>(value);
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(uint32_t value, int128_t& result) {
+    result = tryCastToTemplate<uint32_t>(value);
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(uint64_t value, int128_t& result) {
+    result = tryCastToTemplate<uint64_t>(value);
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(int128_t value, int128_t& result) {
+    result = value;
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(float value, int128_t& result) {
+    return tryCastTo(double(value), result);
+}
+
+template<class REAL_T>
+bool castFloatingToInt128(REAL_T value, int128_t& result) {
+    // TODO: Maybe need to add func isFinite in value.h to see if every type is finite.
+    if (value <= -170141183460469231731687303715884105728.0 ||
+        value >= 170141183460469231731687303715884105727.0) {
+        return false;
+    }
+    bool negative = value < 0;
+    if (negative) {
+        value = -value;
+    }
+    value = std::nearbyint(value);
+    result.low = (uint64_t)fmod(value, REAL_T(function::NumericLimits<uint64_t>::maximum()));
+    result.high = (uint64_t)(value / REAL_T(function::NumericLimits<uint64_t>::maximum()));
+    if (negative) {
+        Int128_t::negateInPlace(result);
+    }
+    return true;
+}
+
+template<>
+bool Int128_t::tryCastTo(double value, int128_t& result) {
+    return castFloatingToInt128<double>(value, result);
+}
+
+template<>
+bool Int128_t::tryCastTo(long double value, int128_t& result) {
+    return castFloatingToInt128<long double>(value, result);
+}
+//===============================================================================================
+
+template<NumericTypes T>
+void constructInt128Template(T value, int128_t& result) {
+    int128_t casted = Int128_t::castTo(value);
+    result.low = casted.low;
+    result.high = casted.high;
+}
+
+int128_t::int128_t(int64_t value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+int128_t::int128_t(int32_t value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+int128_t::int128_t(int16_t value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+int128_t::int128_t(int8_t value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+int128_t::int128_t(uint64_t value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+int128_t::int128_t(uint32_t value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+int128_t::int128_t(uint16_t value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+int128_t::int128_t(uint8_t value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+int128_t::int128_t(double value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+int128_t::int128_t(float value) { // NOLINT: fields are constructed by the template
+    constructInt128Template(value, *this);
+}
+
+//============================================================================================
+bool operator==(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::equals(lhs, rhs);
+}
+
+bool operator!=(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::notEquals(lhs, rhs);
+}
+
+bool operator>(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::greaterThan(lhs, rhs);
+}
+
+bool operator>=(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::greaterThanOrEquals(lhs, rhs);
+}
+
+bool operator<(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::lessThan(lhs, rhs);
+}
+
+bool operator<=(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::lessThanOrEquals(lhs, rhs);
+}
+
+int128_t int128_t::operator-() const {
+    return Int128_t::negate(*this);
+}
+
+// support for operations like (int32_t)x + (int128_t)y
+
+int128_t operator+(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::Add(lhs, rhs);
+}
+int128_t operator-(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::Sub(lhs, rhs);
+}
+int128_t operator*(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::Mul(lhs, rhs);
+}
+int128_t operator/(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::Div(lhs, rhs);
+}
+int128_t operator%(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::Mod(lhs, rhs);
+}
+
+int128_t operator^(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::Xor(lhs, rhs);
+}
+
+int128_t operator&(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::BinaryAnd(lhs, rhs);
+}
+
+int128_t operator|(const int128_t& lhs, const int128_t& rhs) {
+    return Int128_t::BinaryOr(lhs, rhs);
+}
+
+int128_t operator~(const int128_t& val) {
+    return Int128_t::BinaryNot(val);
+}
+
+int128_t operator<<(const int128_t& lhs, int amount) {
+    return Int128_t::LeftShift(lhs, amount);
+}
+
+int128_t operator>>(const int128_t& lhs, int amount) {
+    return Int128_t::RightShift(lhs, amount);
+}
+
+// inplace arithmetic operators
+int128_t& int128_t::operator+=(const int128_t& rhs) {
+    if (!Int128_t::addInPlace(*this, rhs)) {
+        throw common::OverflowException("INT128 is out of range: cannot add in place.");
+    }
+    return *this;
+}
+
+int128_t& int128_t::operator*=(const int128_t& rhs) {
+    *this = Int128_t::Mul(*this, rhs);
+    return *this;
+}
+
+int128_t& int128_t::operator|=(const int128_t& rhs) {
+    *this = Int128_t::BinaryOr(*this, rhs);
+    return *this;
+}
+
+int128_t& int128_t::operator&=(const int128_t& rhs) {
+    *this = Int128_t::BinaryAnd(*this, rhs);
+    return *this;
+}
+
+template<class T>
+static T NarrowCast(const int128_t& input) {
+    return static_cast<T>(input.low);
+}
+
+int128_t::operator int64_t() const {
+    return NarrowCast<int64_t>(*this);
+}
+
+int128_t::operator int32_t() const {
+    return NarrowCast<int32_t>(*this);
+}
+
+int128_t::operator int16_t() const {
+    return NarrowCast<int16_t>(*this);
+}
+
+int128_t::operator int8_t() const {
+    return NarrowCast<int8_t>(*this);
+}
+
+int128_t::operator uint64_t() const {
+    return NarrowCast<uint64_t>(*this);
+}
+
+int128_t::operator uint32_t() const {
+    return NarrowCast<uint32_t>(*this);
+}
+
+int128_t::operator uint16_t() const {
+    return NarrowCast<uint16_t>(*this);
+}
+
+int128_t::operator uint8_t() const {
+    return NarrowCast<uint8_t>(*this);
+}
+
+int128_t::operator double() const {
+    double result = NAN;
+    if (!Int128_t::tryCast(*this, result)) { // LCOV_EXCL_START
+        throw common::OverflowException(common::stringFormat("Value {} is not within DOUBLE range",
+            common::TypeUtils::toString(*this)));
+    } // LCOV_EXCL_STOP
+    return result;
+}
+
+int128_t::operator float() const {
+    float result = NAN;
+    if (!Int128_t::tryCast(*this, result)) { // LCOV_EXCL_START
+        throw common::OverflowException(common::stringFormat("Value {} is not within FLOAT range",
+            common::TypeUtils::toString(*this)));
+    } // LCOV_EXCL_STOP
+    return result;
+}
+
+int128_t::operator uint128_t() const {
+    uint128_t result{};
+    if (!Int128_t::tryCast(*this, result)) {
+        throw common::OverflowException(common::stringFormat(
+            "Cannot cast negative INT128 value {} to UINT128", common::TypeUtils::toString(*this)));
+    }
+    return result;
+}
+
+} // namespace lbug::common
+
+std::size_t std::hash<lbug::common::int128_t>::operator()(
+    const lbug::common::int128_t& v) const noexcept {
+    lbug::common::hash_t hash = 0;
+    lbug::function::Hash::operation(v, hash);
+    return hash;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/interval_t.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/interval_t.cpp
new file mode 100644
index 0000000000..0591e2e0d7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/interval_t.cpp
@@ -0,0 +1,483 @@
+#include "common/types/interval_t.h"
+
+#include "common/assert.h"
+#include "common/exception/conversion.h"
+#include "common/exception/overflow.h"
+#include "common/string_utils.h"
+#include "common/types/cast_helpers.h"
+#include "common/types/timestamp_t.h"
+#include "function/arithmetic/add.h"
+#include "function/arithmetic/multiply.h"
+#include "function/cast/functions/cast_from_string_functions.h"
+#include "function/cast/functions/cast_functions.h"
+#include "re2.h"
+
+namespace lbug {
+namespace common {
+
+interval_t::interval_t() = default;
+
+interval_t::interval_t(int32_t months_p, int32_t days_p, int64_t micros_p)
+    : months(months_p), days(days_p), micros(micros_p) {}
+
+bool interval_t::operator==(const interval_t& rhs) const {
+    return this->days == rhs.days && this->months == rhs.months && this->micros == rhs.micros;
+}
+
+bool interval_t::operator!=(const interval_t& rhs) const {
+    return !(*this == rhs);
+}
+
+bool interval_t::operator>(const interval_t& rhs) const {
+    return Interval::greaterThan(*this, rhs);
+}
+
+bool interval_t::operator<=(const interval_t& rhs) const {
+    return !(*this > rhs);
+}
+
+bool interval_t::operator<(const interval_t& rhs) const {
+    return !(*this >= rhs);
+}
+
+bool interval_t::operator>=(const interval_t& rhs) const {
+    return *this > rhs || *this == rhs;
+}
+
+interval_t interval_t::operator+(const interval_t& rhs) const {
+    interval_t result{};
+    result.months = months + rhs.months;
+    result.days = days + rhs.days;
+    result.micros = micros + rhs.micros;
+    return result;
+}
+
+timestamp_t interval_t::operator+(const timestamp_t& rhs) const {
+    return rhs + *this;
+}
+
+date_t interval_t::operator+(const date_t& rhs) const {
+    return rhs + *this;
+}
+
+interval_t interval_t::operator-(const interval_t& rhs) const {
+    interval_t result{};
+    result.months = months - rhs.months;
+    result.days = days - rhs.days;
+    result.micros = micros - rhs.micros;
+    return result;
+}
+
+interval_t interval_t::operator/(const uint64_t& rhs) const {
+    interval_t result{};
+    int32_t monthsRemainder = months % rhs;
+    int32_t daysRemainder = (days + monthsRemainder * Interval::DAYS_PER_MONTH) % rhs;
+    result.months = months / rhs;
+    result.days = (days + monthsRemainder * Interval::DAYS_PER_MONTH) / rhs;
+    result.micros = (micros + daysRemainder * Interval::MICROS_PER_DAY) / rhs;
+    return result;
+}
+
+void Interval::addition(interval_t& result, uint64_t number, std::string specifierStr) {
+    StringUtils::toLower(specifierStr);
+    if (specifierStr == "year" || specifierStr == "years" || specifierStr == "y") {
+        result.months += number * MONTHS_PER_YEAR;
+    } else if (specifierStr == "month" || specifierStr == "months" || specifierStr == "mon") {
+        result.months += number;
+    } else if (specifierStr == "day" || specifierStr == "days" || specifierStr == "d") {
+        result.days += number;
+    } else if (specifierStr == "hour" || specifierStr == "hours" || specifierStr == "h") {
+        result.micros += number * MICROS_PER_HOUR;
+    } else if (specifierStr == "minute" || specifierStr == "minutes" || specifierStr == "m") {
+        result.micros += number * MICROS_PER_MINUTE;
+    } else if (specifierStr == "second" || specifierStr == "seconds" || specifierStr == "s") {
+        result.micros += number * MICROS_PER_SEC;
+    } else if (specifierStr == "millisecond" || specifierStr == "milliseconds" ||
+               specifierStr == "ms" || specifierStr == "msec") {
+        result.micros += number * MICROS_PER_MSEC;
+    } else if (specifierStr == "microsecond" || specifierStr == "microseconds" ||
+               specifierStr == "us") {
+        result.micros += number;
+    } else {
+        throw ConversionException("Unrecognized interval specifier string: " + specifierStr + ".");
+    }
+}
+
+template<class T>
+T intervalTryCastInteger(int64_t input) {
+    if (std::is_same<T, int8_t>()) {
+        int8_t result = 0;
+        function::CastToInt8::operation<int64_t>(input, result);
+        return result;
+    } else if (std::is_same<T, int16_t>()) {
+        int16_t result = 0;
+        function::CastToInt16::operation<int64_t>(input, result);
+        return result;
+    } else if (std::is_same<T, int32_t>()) {
+        int32_t result = 0;
+        function::CastToInt32::operation<int64_t>(input, result);
+        return result;
+    } else if (std::is_same<T, int64_t>()) {
+        int64_t result = 0;
+        function::CastToInt64::operation<int64_t>(input, result);
+        return result;
+    } else {
+        throw ConversionException("The destination is not an integer");
+    }
+}
+
+template<class T>
+void intervalTryAddition(T& target, int64_t input, int64_t multiplier, int64_t fraction = 0) {
+    int64_t addition = 0;
+    try {
+        function::Multiply::operation(input, multiplier, addition);
+    } catch (const OverflowException& e) {
+        throw OverflowException{"Interval value is out of range"};
+    }
+    T additionBase = intervalTryCastInteger<T>(addition);
+    try {
+        function::Add::operation(target, additionBase, target);
+    } catch (const OverflowException& e) {
+        throw OverflowException{"Interval value is out of range"};
+    }
+    if (fraction) {
+        //	Add in (fraction * multiplier) / MICROS_PER_SEC
+        //	This is always in range
+        addition = (fraction * multiplier) / Interval::MICROS_PER_SEC;
+        additionBase = intervalTryCastInteger<T>(addition);
+        try {
+            function::Add::operation(target, additionBase, target);
+        } catch (const OverflowException& e) {
+            throw OverflowException{"Interval fraction is out of range"};
+        }
+    }
+}
+
+interval_t Interval::fromCString(const char* str, uint64_t len) {
+    interval_t result;
+    uint64_t pos = 0;
+    uint64_t startPos = 0;
+    bool foundAny = false;
+    int64_t number = 0;
+    int64_t fraction = 0;
+    DatePartSpecifier specifier{};
+    std::string specifierStr{};
+
+    result.days = 0;
+    result.micros = 0;
+    result.months = 0;
+
+    if (len == 0) {
+        throw ConversionException("Error occurred during parsing interval. Given empty string.");
+    }
+
+    if (str[pos] == '@') {
+        pos++;
+    }
+
+parse_interval:
+    for (; pos < len; pos++) {
+        char c = str[pos];
+        if (isspace(c)) {
+            // skip spaces
+            continue;
+        } else if (isdigit(c)) {
+            // start parsing a number
+            goto interval_parse_number;
+        } else {
+            // unrecognized character, expected a number or end of string
+            throw ConversionException("Error occurred during parsing interval. Given: \"" +
+                                      std::string(str, len) + "\".");
+        }
+    }
+    goto end_of_string;
+
+interval_parse_number:
+    startPos = pos;
+    for (; pos < len; pos++) {
+        char c = str[pos];
+        if (isdigit(c)) {
+            // the number continues
+            continue;
+        } else if (c == ':') {
+            // colon: we are parsing a time
+            goto interval_parse_time;
+        } else {
+            // finished the number, parse it from the string
+            function::CastString::operation(ku_string_t{str + startPos, pos - startPos}, number);
+            fraction = 0;
+            if (c == '.') {
+                // we expect some microseconds
+                int32_t mult = 100000;
+                for (++pos; pos < len && isdigit(str[pos]); ++pos, mult /= 10) {
+                    if (mult > 0) {
+                        fraction += int64_t(str[pos] - '0') * mult;
+                    }
+                }
+            }
+            goto interval_parse_identifier;
+        }
+    }
+    goto interval_parse_identifier;
+
+interval_parse_time: {
+    // parse the remainder of the time as a Time type
+    dtime_t time;
+    uint64_t tmpPos = 0;
+    if (!Time::tryConvertInterval(str + startPos, len - startPos, tmpPos, time)) {
+        throw ConversionException("Error occurred during parsing time. Given: \"" +
+                                  std::string(str + startPos, len - startPos) + "\".");
+    }
+    result.micros += time.micros;
+    foundAny = true;
+    goto end_of_string;
+}
+
+interval_parse_identifier:
+    for (; pos < len; pos++) {
+        char c = str[pos];
+        if (isspace(c)) {
+            // skip spaces at the start
+            continue;
+        } else {
+            break;
+        }
+    }
+    // now parse the identifier
+    startPos = pos;
+    for (; pos < len; pos++) {
+        char c = str[pos];
+        if (!isspace(c)) {
+            // keep parsing the string
+            continue;
+        } else {
+            break;
+        }
+    }
+    specifierStr = std::string(str + startPos, pos - startPos);
+
+    // Specifier string is empty, missing field name
+    if (specifierStr.empty()) {
+        throw ConversionException("Error occurred during parsing interval. Field name is missing.");
+    }
+
+    tryGetDatePartSpecifier(specifierStr, specifier);
+
+    switch (specifier) {
+    case DatePartSpecifier::MILLENNIUM:
+        intervalTryAddition<int32_t>(result.months, number, MONTHS_PER_MILLENIUM, fraction);
+        break;
+    case DatePartSpecifier::CENTURY:
+        intervalTryAddition<int32_t>(result.months, number, MONTHS_PER_CENTURY, fraction);
+        break;
+    case DatePartSpecifier::DECADE:
+        intervalTryAddition<int32_t>(result.months, number, MONTHS_PER_DECADE, fraction);
+        break;
+    case DatePartSpecifier::YEAR:
+        intervalTryAddition<int32_t>(result.months, number, MONTHS_PER_YEAR, fraction);
+        break;
+    case DatePartSpecifier::QUARTER:
+        intervalTryAddition<int32_t>(result.months, number, MONTHS_PER_QUARTER, fraction);
+        // Reduce to fraction of a month
+        fraction *= MONTHS_PER_QUARTER;
+        fraction %= MICROS_PER_SEC;
+        intervalTryAddition<int32_t>(result.days, 0, DAYS_PER_MONTH, fraction);
+        break;
+    case DatePartSpecifier::MONTH:
+        intervalTryAddition<int32_t>(result.months, number, 1);
+        intervalTryAddition<int32_t>(result.days, 0, DAYS_PER_MONTH, fraction);
+        break;
+    case DatePartSpecifier::DAY:
+        intervalTryAddition<int32_t>(result.days, number, 1);
+        intervalTryAddition<int64_t>(result.micros, 0, MICROS_PER_DAY, fraction);
+        break;
+    case DatePartSpecifier::WEEK:
+        intervalTryAddition<int32_t>(result.days, number, DAYS_PER_WEEK, fraction);
+        // Reduce to fraction of a day
+        fraction *= DAYS_PER_WEEK;
+        fraction %= MICROS_PER_SEC;
+        intervalTryAddition<int64_t>(result.micros, 0, MICROS_PER_DAY, fraction);
+        break;
+    case DatePartSpecifier::HOUR:
+        intervalTryAddition<int64_t>(result.micros, number, MICROS_PER_HOUR, fraction);
+        break;
+    case DatePartSpecifier::MINUTE:
+        intervalTryAddition<int64_t>(result.micros, number, MICROS_PER_MINUTE, fraction);
+        break;
+    case DatePartSpecifier::SECOND:
+        intervalTryAddition<int64_t>(result.micros, number, MICROS_PER_SEC, fraction);
+        break;
+    case DatePartSpecifier::MILLISECOND:
+        intervalTryAddition<int64_t>(result.micros, number, MICROS_PER_MSEC, fraction);
+        break;
+    case DatePartSpecifier::MICROSECOND:
+        // Round the fraction
+        number += (fraction * 2) / MICROS_PER_SEC;
+        intervalTryAddition<int64_t>(result.micros, number, 1);
+        break;
+    default:
+        throw ConversionException("Unrecognized interval specifier string: " + specifierStr + ".");
+    }
+
+    foundAny = true;
+    goto parse_interval;
+
+end_of_string:
+    if (!foundAny) {
+        throw ConversionException(
+            "Error occurred during parsing interval. Given: \"" + std::string(str, len) + "\".");
+    }
+    return result;
+}
+
+std::string Interval::toString(interval_t interval) {
+    char buffer[70];
+    uint64_t length = IntervalToStringCast::Format(interval, buffer);
+    return std::string(buffer, length);
+}
+
+// helper function of interval comparison
+void Interval::normalizeIntervalEntries(interval_t input, int64_t& months, int64_t& days,
+    int64_t& micros) {
+    int64_t extra_months_d = input.days / Interval::DAYS_PER_MONTH;
+    int64_t extra_months_micros = input.micros / Interval::MICROS_PER_MONTH;
+    input.days -= extra_months_d * Interval::DAYS_PER_MONTH;
+    input.micros -= extra_months_micros * Interval::MICROS_PER_MONTH;
+
+    int64_t extra_days_micros = input.micros / Interval::MICROS_PER_DAY;
+    input.micros -= extra_days_micros * Interval::MICROS_PER_DAY;
+
+    months = input.months + extra_months_d + extra_months_micros;
+    days = input.days + extra_days_micros;
+    micros = input.micros;
+}
+
+bool Interval::greaterThan(const interval_t& left, const interval_t& right) {
+    int64_t lMonths = 0, lDays = 0, lMicros = 0;
+    int64_t rMonths = 0, rDays = 0, rMicros = 0;
+    normalizeIntervalEntries(left, lMonths, lDays, lMicros);
+    normalizeIntervalEntries(right, rMonths, rDays, rMicros);
+    if (lMonths > rMonths) {
+        return true;
+    } else if (lMonths < rMonths) {
+        return false;
+    }
+    if (lDays > rDays) {
+        return true;
+    } else if (lDays < rDays) {
+        return false;
+    }
+    return lMicros > rMicros;
+}
+
+void Interval::tryGetDatePartSpecifier(std::string specifier, DatePartSpecifier& result) {
+    StringUtils::toLower(specifier);
+    if (specifier == "year" || specifier == "yr" || specifier == "y" || specifier == "years" ||
+        specifier == "yrs") {
+        result = DatePartSpecifier::YEAR;
+    } else if (specifier == "month" || specifier == "mon" || specifier == "months" ||
+               specifier == "mons") {
+        result = DatePartSpecifier::MONTH;
+    } else if (specifier == "day" || specifier == "days" || specifier == "d" ||
+               specifier == "dayofmonth") {
+        result = DatePartSpecifier::DAY;
+    } else if (specifier == "decade" || specifier == "dec" || specifier == "decades" ||
+               specifier == "decs") {
+        result = DatePartSpecifier::DECADE;
+    } else if (specifier == "century" || specifier == "cent" || specifier == "centuries" ||
+               specifier == "c") {
+        result = DatePartSpecifier::CENTURY;
+    } else if (specifier == "millennium" || specifier == "mil" || specifier == "millenniums" ||
+               specifier == "millennia" || specifier == "mils" || specifier == "millenium" ||
+               specifier == "milleniums") {
+        result = DatePartSpecifier::MILLENNIUM;
+    } else if (specifier == "microseconds" || specifier == "microsecond" || specifier == "us" ||
+               specifier == "usec" || specifier == "usecs" || specifier == "usecond" ||
+               specifier == "useconds") {
+        result = DatePartSpecifier::MICROSECOND;
+    } else if (specifier == "milliseconds" || specifier == "millisecond" || specifier == "ms" ||
+               specifier == "msec" || specifier == "msecs" || specifier == "msecond" ||
+               specifier == "mseconds") {
+        result = DatePartSpecifier::MILLISECOND;
+    } else if (specifier == "second" || specifier == "sec" || specifier == "seconds" ||
+               specifier == "secs" || specifier == "s") {
+        result = DatePartSpecifier::SECOND;
+    } else if (specifier == "minute" || specifier == "min" || specifier == "minutes" ||
+               specifier == "mins" || specifier == "m") {
+        result = DatePartSpecifier::MINUTE;
+    } else if (specifier == "hour" || specifier == "hr" || specifier == "hours" ||
+               specifier == "hrs" || specifier == "h") {
+        result = DatePartSpecifier::HOUR;
+    } else if (specifier == "week" || specifier == "weeks" || specifier == "w" ||
+               specifier == "weekofyear") {
+        // ISO week number
+        result = DatePartSpecifier::WEEK;
+    } else if (specifier == "quarter" || specifier == "quarters") {
+        // quarter of the year (1-4)
+        result = DatePartSpecifier::QUARTER;
+    } else {
+        throw ConversionException("Unrecognized interval specifier string: " + specifier + ".");
+    }
+}
+
+int32_t Interval::getIntervalPart(DatePartSpecifier specifier, interval_t interval) {
+    switch (specifier) {
+    case DatePartSpecifier::YEAR:
+        return interval.months / Interval::MONTHS_PER_YEAR;
+    case DatePartSpecifier::MONTH:
+        return interval.months % Interval::MONTHS_PER_YEAR;
+    case DatePartSpecifier::DAY:
+        return interval.days;
+    case DatePartSpecifier::DECADE:
+        return interval.months / Interval::MONTHS_PER_DECADE;
+    case DatePartSpecifier::CENTURY:
+        return interval.months / Interval::MONTHS_PER_CENTURY;
+    case DatePartSpecifier::MILLENNIUM:
+        return interval.months / Interval::MONTHS_PER_MILLENIUM;
+    case DatePartSpecifier::QUARTER:
+        return getIntervalPart(DatePartSpecifier::MONTH, interval) / Interval::MONTHS_PER_QUARTER +
+               1;
+    case DatePartSpecifier::MICROSECOND:
+        return interval.micros % Interval::MICROS_PER_MINUTE;
+    case DatePartSpecifier::MILLISECOND:
+        return getIntervalPart(DatePartSpecifier::MICROSECOND, interval) /
+               Interval::MICROS_PER_MSEC;
+    case DatePartSpecifier::SECOND:
+        return getIntervalPart(DatePartSpecifier::MICROSECOND, interval) / Interval::MICROS_PER_SEC;
+    case DatePartSpecifier::MINUTE:
+        return (interval.micros % Interval::MICROS_PER_HOUR) / Interval::MICROS_PER_MINUTE;
+    case DatePartSpecifier::HOUR:
+        return interval.micros / Interval::MICROS_PER_HOUR;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+int64_t Interval::getMicro(const interval_t& val) {
+    return val.micros + val.months * MICROS_PER_MONTH + val.days * MICROS_PER_DAY;
+}
+
+int64_t Interval::getNanoseconds(const interval_t& val) {
+    return getMicro(val) * NANOS_PER_MICRO;
+}
+
+const regex::RE2& Interval::regexPattern1() {
+    static regex::RE2 retval(
+        "(?i)((0|[1-9]\\d*) "
+        "+(YEARS?|YRS?|Y|MONS?|MONTHS?|DAYS?|D|DAYOFMONTH|DECADES?|DECS?|CENTURY|CENTURIES|CENT|C|"
+        "MILLENN?IUMS?|MILS?|MILLENNIA|MICROSECONDS?|US|USECS?|USECONDS?|MILLISECONDS?|MS|SECONDS?|"
+        "SECS?|S|MINUTES?|MINS?|M|HOURS?|HRS?|H|WEEKS?|WEEKOFYEAR|W|QUARTERS?))( +(0|[1-9]\\d*) "
+        "+(YEARS?|YRS?|Y|MONS?|MONTHS?|DAYS?|D|DAYOFMONTH|DECADES?|DECS?|CENTURY|CENTURIES|CENT|C|"
+        "MILLENN?IUMS?|MILS?|MILLENNIA|MICROSECONDS?|US|USECS?|USECONDS?|MILLISECONDS?|MS|SECONDS?|"
+        "SECS?|S|MINUTES?|MINS?|M|HOURS?|HRS?|H|WEEKS?|WEEKOFYEAR|W|QUARTERS?))*( "
+        "+\\d+:\\d{2}:\\d{2}(\\.\\d+)?)?");
+    return retval;
+}
+
+const regex::RE2& Interval::regexPattern2() {
+    static regex::RE2 retval("\\d+:\\d{2}:\\d{2}(\\.\\d+)?");
+    return retval;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/ku_list.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/ku_list.cpp
new file mode 100644
index 0000000000..8cfb117a19
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/ku_list.cpp
@@ -0,0 +1,25 @@
+#include "common/types/ku_list.h"
+
+#include <cstring>
+
+#include "storage/storage_utils.h"
+
+namespace lbug {
+namespace common {
+
+void ku_list_t::set(const uint8_t* values, const LogicalType& dataType) const {
+    memcpy(reinterpret_cast<uint8_t*>(overflowPtr), values,
+        size * storage::StorageUtils::getDataTypeSize(ListType::getChildType(dataType)));
+}
+
+void ku_list_t::set(const std::vector<uint8_t*>& parameters, LogicalTypeID childTypeId) {
+    this->size = parameters.size();
+    auto numBytesOfListElement = storage::StorageUtils::getDataTypeSize(LogicalType{childTypeId});
+    for (auto i = 0u; i < parameters.size(); i++) {
+        memcpy(reinterpret_cast<uint8_t*>(this->overflowPtr) + (i * numBytesOfListElement),
+            parameters[i], numBytesOfListElement);
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/ku_string.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/ku_string.cpp
new file mode 100644
index 0000000000..f1e257019e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/ku_string.cpp
@@ -0,0 +1,79 @@
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace common {
+
+ku_string_t::ku_string_t(const char* value, uint64_t length) : len(length), prefix{} {
+    if (isShortString(length)) {
+        memcpy(prefix, value, length);
+        return;
+    }
+    overflowPtr = (uint64_t)(value);
+    memcpy(prefix, value, PREFIX_LENGTH);
+}
+
+void ku_string_t::set(const std::string& value) {
+    set(value.data(), value.length());
+}
+
+void ku_string_t::set(const char* value, uint64_t length) {
+    if (length <= SHORT_STR_LENGTH) {
+        setShortString(value, length);
+    } else {
+        setLongString(value, length);
+    }
+}
+
+void ku_string_t::set(const ku_string_t& value) {
+    if (value.len <= SHORT_STR_LENGTH) {
+        setShortString(value);
+    } else {
+        setLongString(value);
+    }
+}
+
+std::string ku_string_t::getAsShortString() const {
+    return std::string((char*)prefix, len);
+}
+
+std::string ku_string_t::getAsString() const {
+    return std::string(getAsStringView());
+}
+
+std::string_view ku_string_t::getAsStringView() const {
+    if (len <= SHORT_STR_LENGTH) {
+        return std::string_view((char*)prefix, len);
+    } else {
+        return std::string_view(reinterpret_cast<char*>(overflowPtr), len);
+    }
+}
+
+bool ku_string_t::operator==(const ku_string_t& rhs) const {
+    // First compare the length and prefix of the strings.
+    auto numBytesOfLenAndPrefix =
+        sizeof(uint32_t) +
+        std::min((uint64_t)len, static_cast<uint64_t>(ku_string_t::PREFIX_LENGTH));
+    if (!memcmp(this, &rhs, numBytesOfLenAndPrefix)) {
+        // If length and prefix of a and b are equal, we compare the overflow buffer.
+        return !memcmp(getData(), rhs.getData(), len);
+    }
+    return false;
+}
+
+bool ku_string_t::operator>(const ku_string_t& rhs) const {
+    // Compare ku_string_t up to the shared length.
+    // If there is a tie, we just need to compare the std::string lengths.
+    auto sharedLen = std::min(len, rhs.len);
+    auto memcmpResult = memcmp(prefix, rhs.prefix,
+        sharedLen <= ku_string_t::PREFIX_LENGTH ? sharedLen : ku_string_t::PREFIX_LENGTH);
+    if (memcmpResult == 0 && len > ku_string_t::PREFIX_LENGTH) {
+        memcmpResult = memcmp(getData(), rhs.getData(), sharedLen);
+    }
+    if (memcmpResult == 0) {
+        return len > rhs.len;
+    }
+    return memcmpResult > 0;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/timestamp_t.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/timestamp_t.cpp
new file mode 100644
index 0000000000..641ecb762a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/timestamp_t.cpp
@@ -0,0 +1,383 @@
+#include "common/types/timestamp_t.h"
+
+#include <chrono>
+#include <string>
+
+#include "common/exception/conversion.h"
+#include "common/string_format.h"
+#include "function/arithmetic/multiply.h"
+
+namespace lbug {
+namespace common {
+
+timestamp_t::timestamp_t() : value(0) {}
+
+timestamp_t::timestamp_t(int64_t value_p) : value(value_p) {}
+
+timestamp_t& timestamp_t::operator=(int64_t value_p) {
+    value = value_p;
+    return *this;
+}
+
+timestamp_t::operator int64_t() const {
+    return value;
+}
+
+bool timestamp_t::operator==(const timestamp_t& rhs) const {
+    return value == rhs.value;
+}
+
+bool timestamp_t::operator!=(const timestamp_t& rhs) const {
+    return value != rhs.value;
+}
+
+bool timestamp_t::operator<=(const timestamp_t& rhs) const {
+    return value <= rhs.value;
+}
+
+bool timestamp_t::operator<(const timestamp_t& rhs) const {
+    return value < rhs.value;
+}
+
+bool timestamp_t::operator>(const timestamp_t& rhs) const {
+    return value > rhs.value;
+}
+
+bool timestamp_t::operator>=(const timestamp_t& rhs) const {
+    return value >= rhs.value;
+}
+
+bool timestamp_t::operator==(const date_t& rhs) const {
+    return rhs == *this;
+}
+
+bool timestamp_t::operator!=(const date_t& rhs) const {
+    return !(rhs == *this);
+}
+
+bool timestamp_t::operator<(const date_t& rhs) const {
+    return rhs > *this;
+}
+
+bool timestamp_t::operator<=(const date_t& rhs) const {
+    return rhs >= *this;
+}
+
+bool timestamp_t::operator>(const date_t& rhs) const {
+    return rhs < *this;
+}
+
+bool timestamp_t::operator>=(const date_t& rhs) const {
+    return rhs <= *this;
+}
+
+timestamp_t timestamp_t::operator+(const interval_t& interval) const {
+    date_t date{};
+    date_t result_date{};
+    dtime_t time{};
+    Timestamp::convert(*this, date, time);
+    result_date = date + interval;
+    date = result_date;
+    int64_t diff =
+        interval.micros - ((interval.micros / Interval::MICROS_PER_DAY) * Interval::MICROS_PER_DAY);
+    time.micros += diff;
+    if (time.micros >= Interval::MICROS_PER_DAY) {
+        time.micros -= Interval::MICROS_PER_DAY;
+        date.days++;
+    } else if (time.micros < 0) {
+        time.micros += Interval::MICROS_PER_DAY;
+        date.days--;
+    }
+    return Timestamp::fromDateTime(date, time);
+}
+
+timestamp_t timestamp_t::operator-(const interval_t& interval) const {
+    interval_t inverseRight{};
+    inverseRight.months = -interval.months;
+    inverseRight.days = -interval.days;
+    inverseRight.micros = -interval.micros;
+    return (*this) + inverseRight;
+}
+
+interval_t timestamp_t::operator-(const timestamp_t& rhs) const {
+    interval_t result{};
+    uint64_t diff = std::abs(value - rhs.value);
+    result.months = 0;
+    result.days = diff / Interval::MICROS_PER_DAY;
+    result.micros = diff % Interval::MICROS_PER_DAY;
+    if (value < rhs.value) {
+        result.days = -result.days;
+        result.micros = -result.micros;
+    }
+    return result;
+}
+
+static_assert(sizeof(timestamp_t) == sizeof(int64_t), "timestamp_t was padded");
+
+bool Timestamp::tryConvertTimestamp(const char* str, uint64_t len, timestamp_t& result) {
+    uint64_t pos = 0;
+    date_t date;
+    dtime_t time;
+
+    if (!Date::tryConvertDate(str, len, pos, date, true /*allowTrailing*/)) {
+        return false;
+    }
+    if (pos == len) {
+        // no time: only a date
+        result = fromDateTime(date, dtime_t(0));
+        return true;
+    }
+    // try to parse a time field
+    if (str[pos] == ' ' || str[pos] == 'T') {
+        pos++;
+    }
+    uint64_t time_pos = 0;
+    if (!Time::tryConvertTime(str + pos, len - pos, time_pos, time)) {
+        return false;
+    }
+    pos += time_pos;
+    result = fromDateTime(date, time);
+    if (pos < len) {
+        // skip a "Z" at the end (as per the ISO8601 specs)
+        if (str[pos] == 'Z') {
+            pos++;
+        }
+        int hour_offset = 0, minute_offset = 0;
+        if (Timestamp::tryParseUTCOffset(str, pos, len, hour_offset, minute_offset)) {
+            result.value -= hour_offset * Interval::MICROS_PER_HOUR +
+                            minute_offset * Interval::MICROS_PER_MINUTE;
+        }
+        // skip any spaces at the end
+        while (pos < len && isspace(str[pos])) {
+            pos++;
+        }
+        if (pos < len) {
+            return false;
+        }
+    }
+    return true;
+}
+
+// string format is YYYY-MM-DDThh:mm:ss[.mmmmmm]
+// T may be a space, timezone is not supported yet
+// ISO 8601
+timestamp_t Timestamp::fromCString(const char* str, uint64_t len) {
+    timestamp_t result;
+    if (!tryConvertTimestamp(str, len, result)) {
+        throw ConversionException(getTimestampConversionExceptionMsg(str, len));
+    }
+    return result;
+}
+
+bool Timestamp::tryParseUTCOffset(const char* str, uint64_t& pos, uint64_t len, int& hour_offset,
+    int& minute_offset) {
+    minute_offset = 0;
+    uint64_t curpos = pos;
+    // parse the next 3 characters
+    if (curpos + 3 > len) {
+        // no characters left to parse
+        return false;
+    }
+    char sign_char = str[curpos];
+    if (sign_char != '+' && sign_char != '-') {
+        // expected either + or -
+        return false;
+    }
+    curpos++;
+    if (!isdigit(str[curpos]) || !isdigit(str[curpos + 1])) {
+        // expected +HH or -HH
+        return false;
+    }
+    hour_offset = (str[curpos] - '0') * 10 + (str[curpos + 1] - '0');
+    if (sign_char == '-') {
+        hour_offset = -hour_offset;
+    }
+    curpos += 2;
+
+    // optional minute specifier: expected either "MM" or ":MM"
+    if (curpos >= len) {
+        // done, nothing left
+        pos = curpos;
+        return true;
+    }
+    if (str[curpos] == ':') {
+        curpos++;
+    }
+    if (curpos + 2 > len || !isdigit(str[curpos]) || !isdigit(str[curpos + 1])) {
+        // no MM specifier
+        pos = curpos;
+        return true;
+    }
+    // we have an MM specifier: parse it
+    minute_offset = (str[curpos] - '0') * 10 + (str[curpos + 1] - '0');
+    if (sign_char == '-') {
+        minute_offset = -minute_offset;
+    }
+    pos = curpos + 2;
+    return true;
+}
+
+std::string Timestamp::toString(timestamp_t timestamp) {
+    date_t date;
+    dtime_t time;
+    Timestamp::convert(timestamp, date, time);
+    return Date::toString(date) + " " + Time::toString(time);
+}
+
+// Date header is in the format: %Y%m%d.
+std::string Timestamp::getDateHeader(const timestamp_t& timestamp) {
+    auto date = Timestamp::getDate(timestamp);
+    int32_t year = 0, month = 0, day = 0;
+    std::string yearStr, monthStr, dayStr;
+    Date::convert(date, year, month, day);
+    yearStr = std::to_string(year);
+    monthStr = std::to_string(month);
+    dayStr = std::to_string(day);
+    if (month < 10) {
+        monthStr = "0" + monthStr;
+    }
+    if (day < 10) {
+        dayStr = "0" + dayStr;
+    }
+    return stringFormat("{}{}{}", yearStr, monthStr, dayStr);
+}
+
+// Timestamp header is in the format: %Y%m%dT%H%M%SZ.
+std::string Timestamp::getDateTimeHeader(const timestamp_t& timestamp) {
+    auto dateHeader = getDateHeader(timestamp);
+    auto time = Timestamp::getTime(timestamp);
+    int32_t hours = 0, minutes = 0, seconds = 0, micros = 0;
+    std::string hoursStr, minutesStr, secondsStr;
+    Time::convert(time, hours, minutes, seconds, micros);
+    hoursStr = std::to_string(hours);
+    minutesStr = std::to_string(minutes);
+    secondsStr = std::to_string(seconds);
+
+    if (hours < 10) {
+        hoursStr = "0" + hoursStr;
+    }
+    if (minutes < 10) {
+        minutesStr = "0" + minutesStr;
+    }
+    if (seconds < 10) {
+        secondsStr = "0" + secondsStr;
+    }
+    return stringFormat("{}T{}{}{}Z", dateHeader, hoursStr, minutesStr, secondsStr);
+}
+
+date_t Timestamp::getDate(timestamp_t timestamp) {
+    return date_t((timestamp.value + (timestamp.value < 0)) / Interval::MICROS_PER_DAY -
+                  (timestamp.value < 0));
+}
+
+dtime_t Timestamp::getTime(timestamp_t timestamp) {
+    date_t date = Timestamp::getDate(timestamp);
+    return dtime_t(timestamp.value - (int64_t(date.days) * int64_t(Interval::MICROS_PER_DAY)));
+}
+
+timestamp_t Timestamp::fromDateTime(date_t date, dtime_t time) {
+    timestamp_t result;
+    int32_t year = 0, month = 0, day = 0, hour = 0, minute = 0, second = 0, microsecond = -1;
+    Date::convert(date, year, month, day);
+    Time::convert(time, hour, minute, second, microsecond);
+    result.value = date.days * Interval::MICROS_PER_DAY + time.micros;
+    return result;
+}
+
+void Timestamp::convert(timestamp_t timestamp, date_t& out_date, dtime_t& out_time) {
+    out_date = getDate(timestamp);
+    out_time = getTime(timestamp);
+}
+
+timestamp_t Timestamp::fromEpochMicroSeconds(int64_t micros) {
+    return timestamp_t(micros);
+}
+
+timestamp_t Timestamp::fromEpochMilliSeconds(int64_t ms) {
+    int64_t microSeconds = 0;
+    function::Multiply::operation(ms, Interval::MICROS_PER_MSEC, microSeconds);
+    return fromEpochMicroSeconds(microSeconds);
+}
+
+// LCOV_EXCL_START
+// TODO(Kebing): will add the tests in the timestamp PR
+timestamp_t Timestamp::fromEpochSeconds(int64_t sec) {
+    int64_t microSeconds = 0;
+    function::Multiply::operation(sec, Interval::MICROS_PER_SEC, microSeconds);
+    return fromEpochMicroSeconds(microSeconds);
+}
+// LCOV_EXCL_STOP
+
+timestamp_t Timestamp::fromEpochNanoSeconds(int64_t ns) {
+    return fromEpochMicroSeconds(ns / 1000);
+}
+
+int32_t Timestamp::getTimestampPart(DatePartSpecifier specifier, timestamp_t timestamp) {
+    switch (specifier) {
+    case DatePartSpecifier::MICROSECOND:
+        return getTime(timestamp).micros % Interval::MICROS_PER_MINUTE;
+    case DatePartSpecifier::MILLISECOND:
+        return getTimestampPart(DatePartSpecifier::MICROSECOND, timestamp) /
+               Interval::MICROS_PER_MSEC;
+    case DatePartSpecifier::SECOND:
+        return getTimestampPart(DatePartSpecifier::MICROSECOND, timestamp) /
+               Interval::MICROS_PER_SEC;
+    case DatePartSpecifier::MINUTE:
+        return (getTime(timestamp).micros % Interval::MICROS_PER_HOUR) /
+               Interval::MICROS_PER_MINUTE;
+    case DatePartSpecifier::HOUR:
+        return getTime(timestamp).micros / Interval::MICROS_PER_HOUR;
+    default:
+        date_t date = getDate(timestamp);
+        return Date::getDatePart(specifier, date);
+    }
+}
+
+timestamp_t Timestamp::trunc(DatePartSpecifier specifier, timestamp_t timestamp) {
+    int32_t hour = 0, min = 0, sec = 0, micros = 0;
+    date_t date;
+    dtime_t time;
+    Timestamp::convert(timestamp, date, time);
+    Time::convert(time, hour, min, sec, micros);
+    switch (specifier) {
+    case DatePartSpecifier::MICROSECOND:
+        return timestamp;
+    case DatePartSpecifier::MILLISECOND:
+        micros -= micros % Interval::MICROS_PER_MSEC;
+        return Timestamp::fromDateTime(date, Time::fromTime(hour, min, sec, micros));
+    case DatePartSpecifier::SECOND:
+        return Timestamp::fromDateTime(date, Time::fromTime(hour, min, sec, 0 /* microseconds */));
+    case DatePartSpecifier::MINUTE:
+        return Timestamp::fromDateTime(date,
+            Time::fromTime(hour, min, 0 /* seconds */, 0 /* microseconds */));
+    case DatePartSpecifier::HOUR:
+        return Timestamp::fromDateTime(date,
+            Time::fromTime(hour, 0 /* minutes */, 0 /* seconds */, 0 /* microseconds */));
+    default:
+        date = getDate(timestamp);
+        return fromDateTime(Date::trunc(specifier, date), dtime_t(0));
+    }
+}
+
+int64_t Timestamp::getEpochNanoSeconds(const timestamp_t& timestamp) {
+    int64_t result = 0;
+    function::Multiply::operation(timestamp.value, Interval::NANOS_PER_MICRO, result);
+    return result;
+}
+
+int64_t Timestamp::getEpochMilliSeconds(const timestamp_t& timestamp) {
+    return timestamp.value / Interval::MICROS_PER_MSEC;
+}
+
+int64_t Timestamp::getEpochSeconds(const timestamp_t& timestamp) {
+    return timestamp.value / Interval::MICROS_PER_SEC;
+}
+
+timestamp_t Timestamp::getCurrentTimestamp() {
+    auto now = std::chrono::system_clock::now();
+    return Timestamp::fromEpochMilliSeconds(
+        duration_cast<std::chrono::milliseconds>(now.time_since_epoch()).count());
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/types.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/types.cpp
new file mode 100644
index 0000000000..017e266a83
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/types.cpp
@@ -0,0 +1,1969 @@
+#include "common/types/types.h"
+
+#include <set>
+
+#include "catalog/catalog.h"
+#include "common/cast.h"
+#include "common/constants.h"
+#include "common/exception/binder.h"
+#include "common/exception/conversion.h"
+#include "common/exception/runtime.h"
+#include "common/null_buffer.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/string_utils.h"
+#include "common/types/int128_t.h"
+#include "common/types/interval_t.h"
+#include "common/types/ku_list.h"
+#include "common/types/ku_string.h"
+#include "common/types/uint128_t.h"
+#include "function/built_in_function_utils.h"
+#include "function/cast/functions/numeric_limits.h"
+#include "storage/compression/float_compression.h"
+#include "transaction/transaction.h"
+
+using lbug::function::BuiltInFunctionsUtils;
+
+namespace lbug {
+namespace common {
+
+internalID_t::internalID_t() : offset{INVALID_OFFSET}, tableID{INVALID_TABLE_ID} {}
+
+internalID_t::internalID_t(offset_t offset, table_id_t tableID)
+    : offset(offset), tableID(tableID) {}
+
+bool internalID_t::operator==(const internalID_t& rhs) const {
+    return offset == rhs.offset && tableID == rhs.tableID;
+}
+
+bool internalID_t::operator!=(const internalID_t& rhs) const {
+    return offset != rhs.offset || tableID != rhs.tableID;
+}
+
+bool internalID_t::operator>(const internalID_t& rhs) const {
+    return (tableID > rhs.tableID) || (tableID == rhs.tableID && offset > rhs.offset);
+}
+
+bool internalID_t::operator>=(const internalID_t& rhs) const {
+    return (tableID > rhs.tableID) || (tableID == rhs.tableID && offset >= rhs.offset);
+}
+
+bool internalID_t::operator<(const internalID_t& rhs) const {
+    return (tableID < rhs.tableID) || (tableID == rhs.tableID && offset < rhs.offset);
+}
+
+bool internalID_t::operator<=(const internalID_t& rhs) const {
+    return (tableID < rhs.tableID) || (tableID == rhs.tableID && offset <= rhs.offset);
+}
+
+std::string DecimalType::insertDecimalPoint(const std::string& value, uint32_t positionFromEnd) {
+    if (positionFromEnd == 0) {
+        return value;
+        // Don't want to end up with cases where integral values are followed by a useless dot
+    }
+    std::string retval;
+    if (positionFromEnd > value.size()) {
+        auto greaterBy = positionFromEnd - value.size();
+        retval = "0.";
+        for (auto i = 0u; i < greaterBy; i++) {
+            retval += "0";
+        }
+        retval += value;
+    } else {
+        auto lessBy = value.size() - positionFromEnd;
+        retval = value.substr(0, lessBy);
+        if (retval == "" || retval == "-") {
+            retval += '0';
+        }
+        retval += ".";
+        retval += value.substr(lessBy);
+    }
+    return retval;
+}
+
+bool UDTTypeInfo::operator==(const lbug::common::ExtraTypeInfo& other) const {
+    return typeName == other.constPtrCast<UDTTypeInfo>()->typeName;
+}
+
+std::unique_ptr<ExtraTypeInfo> UDTTypeInfo::copy() const {
+    return std::make_unique<UDTTypeInfo>(typeName);
+}
+
+std::unique_ptr<ExtraTypeInfo> UDTTypeInfo::deserialize(Deserializer& deserializer) {
+    std::string typeName;
+    deserializer.deserializeValue(typeName);
+    return std::make_unique<UDTTypeInfo>(std::move(typeName));
+}
+
+void UDTTypeInfo::serializeInternal(Serializer& serializer) const {
+    serializer.serializeValue(typeName);
+}
+
+uint32_t DecimalType::getPrecision(const LogicalType& type) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::DECIMAL);
+    auto decimalTypeInfo = type.extraTypeInfo->constPtrCast<DecimalTypeInfo>();
+    return decimalTypeInfo->getPrecision();
+}
+
+uint32_t DecimalType::getScale(const LogicalType& type) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::DECIMAL);
+    auto decimalTypeInfo = type.extraTypeInfo->constPtrCast<DecimalTypeInfo>();
+    return decimalTypeInfo->getScale();
+}
+
+const LogicalType& ListType::getChildType(const lbug::common::LogicalType& type) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::LIST ||
+              type.getPhysicalType() == PhysicalTypeID::ARRAY);
+    auto listTypeInfo = type.extraTypeInfo->constPtrCast<ListTypeInfo>();
+    return listTypeInfo->getChildType();
+}
+
+const LogicalType& ArrayType::getChildType(const LogicalType& type) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::ARRAY);
+    auto arrayTypeInfo = type.extraTypeInfo->constPtrCast<ArrayTypeInfo>();
+    return arrayTypeInfo->getChildType();
+}
+
+uint64_t ArrayType::getNumElements(const LogicalType& type) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::ARRAY);
+    auto arrayTypeInfo = type.extraTypeInfo->constPtrCast<ArrayTypeInfo>();
+    return arrayTypeInfo->getNumElements();
+}
+
+std::vector<const LogicalType*> StructType::getFieldTypes(const LogicalType& type) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::STRUCT);
+    auto structTypeInfo = type.extraTypeInfo->constPtrCast<StructTypeInfo>();
+    return structTypeInfo->getChildrenTypes();
+}
+
+const LogicalType& StructType::getFieldType(const LogicalType& type, struct_field_idx_t idx) {
+    return StructType::getField(type, idx).getType();
+}
+
+const LogicalType& StructType::getFieldType(const LogicalType& type, const std::string& key) {
+    return StructType::getField(type, key).getType();
+}
+
+std::vector<std::string> StructType::getFieldNames(const LogicalType& type) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::STRUCT);
+    auto structTypeInfo = type.extraTypeInfo->constPtrCast<StructTypeInfo>();
+    return structTypeInfo->getChildrenNames();
+}
+
+uint64_t StructType::getNumFields(const LogicalType& type) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::STRUCT);
+    return getFields(type).size();
+}
+
+const std::vector<StructField>& StructType::getFields(const LogicalType& type) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::STRUCT);
+    auto structTypeInfo = type.extraTypeInfo->constPtrCast<StructTypeInfo>();
+    return structTypeInfo->getStructFields();
+}
+
+bool StructType::hasField(const LogicalType& type, const std::string& key) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::STRUCT);
+    auto structTypeInfo = type.extraTypeInfo->constPtrCast<StructTypeInfo>();
+    return structTypeInfo->hasField(key);
+}
+
+const StructField& StructType::getField(const LogicalType& type, struct_field_idx_t idx) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::STRUCT);
+    auto structTypeInfo = type.extraTypeInfo->constPtrCast<StructTypeInfo>();
+    return structTypeInfo->getStructField(idx);
+}
+
+const StructField& StructType::getField(const LogicalType& type, const std::string& key) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::STRUCT);
+    auto structTypeInfo = type.extraTypeInfo->constPtrCast<StructTypeInfo>();
+    return structTypeInfo->getStructField(key);
+}
+
+struct_field_idx_t StructType::getFieldIdx(const LogicalType& type, const std::string& key) {
+    KU_ASSERT(type.getPhysicalType() == PhysicalTypeID::STRUCT);
+    auto structTypeInfo = type.extraTypeInfo->constPtrCast<StructTypeInfo>();
+    return structTypeInfo->getStructFieldIdx(key);
+}
+
+const LogicalType& MapType::getKeyType(const LogicalType& type) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::MAP);
+    return *StructType::getFieldTypes(ListType::getChildType(type))[0];
+}
+
+const LogicalType& MapType::getValueType(const LogicalType& type) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::MAP);
+    return *StructType::getFieldTypes(ListType::getChildType(type))[1];
+}
+
+union_field_idx_t UnionType::getInternalFieldIdx(union_field_idx_t idx) {
+    return idx + 1;
+}
+
+std::string UnionType::getFieldName(const LogicalType& type, union_field_idx_t idx) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::UNION);
+    return StructType::getFieldNames(type)[getInternalFieldIdx(idx)];
+}
+
+const LogicalType& UnionType::getFieldType(const LogicalType& type, union_field_idx_t idx) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::UNION);
+    return StructType::getFieldType(type, getInternalFieldIdx(idx));
+}
+
+const LogicalType& UnionType::getFieldType(const LogicalType& type, const std::string& key) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::UNION);
+    return StructType::getFieldType(type, key);
+}
+
+uint64_t UnionType::getNumFields(const LogicalType& type) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::UNION);
+    return StructType::getNumFields(type) - 1;
+}
+
+bool UnionType::hasField(const LogicalType& type, const std::string& key) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::UNION);
+    return StructType::hasField(type, key);
+}
+
+union_field_idx_t UnionType::getFieldIdx(const LogicalType& type, const std::string& key) {
+    KU_ASSERT(type.getLogicalTypeID() == LogicalTypeID::UNION);
+    return StructType::getFieldIdx(type, key) - 1; // inverse of getInternalFieldIdx
+}
+
+std::string PhysicalTypeUtils::toString(PhysicalTypeID physicalType) {
+    // LCOV_EXCL_START
+    switch (physicalType) {
+    case PhysicalTypeID::BOOL:
+        return "BOOL";
+    case PhysicalTypeID::INT64:
+        return "INT64";
+    case PhysicalTypeID::INT32:
+        return "INT32";
+    case PhysicalTypeID::INT16:
+        return "INT16";
+    case PhysicalTypeID::INT8:
+        return "INT8";
+    case PhysicalTypeID::UINT64:
+        return "UINT64";
+    case PhysicalTypeID::UINT32:
+        return "UINT32";
+    case PhysicalTypeID::UINT16:
+        return "UINT16";
+    case PhysicalTypeID::UINT8:
+        return "UINT8";
+    case PhysicalTypeID::INT128:
+        return "INT128";
+    case PhysicalTypeID::DOUBLE:
+        return "DOUBLE";
+    case PhysicalTypeID::FLOAT:
+        return "FLOAT";
+    case PhysicalTypeID::INTERVAL:
+        return "INTERVAL";
+    case PhysicalTypeID::INTERNAL_ID:
+        return "INTERNAL_ID";
+    case PhysicalTypeID::UINT128:
+        return "UINT128";
+    case PhysicalTypeID::STRING:
+        return "STRING";
+    case PhysicalTypeID::STRUCT:
+        return "STRUCT";
+    case PhysicalTypeID::LIST:
+        return "LIST";
+    case PhysicalTypeID::ARRAY:
+        return "ARRAY";
+    case PhysicalTypeID::POINTER:
+        return "POINTER";
+    case PhysicalTypeID::ALP_EXCEPTION_FLOAT:
+        return "ALP_EXCEPTION_FLOAT";
+    case PhysicalTypeID::ALP_EXCEPTION_DOUBLE:
+        return "ALP_EXCEPTION_DOUBLE";
+    default:
+        KU_UNREACHABLE;
+    }
+    // LCOV_EXCL_STOP
+}
+
+uint32_t PhysicalTypeUtils::getFixedTypeSize(PhysicalTypeID physicalType) {
+    switch (physicalType) {
+    case PhysicalTypeID::BOOL:
+        return sizeof(bool);
+    case PhysicalTypeID::INT64:
+        return sizeof(int64_t);
+    case PhysicalTypeID::INT32:
+        return sizeof(int32_t);
+    case PhysicalTypeID::INT16:
+        return sizeof(int16_t);
+    case PhysicalTypeID::INT8:
+        return sizeof(int8_t);
+    case PhysicalTypeID::UINT64:
+        return sizeof(uint64_t);
+    case PhysicalTypeID::UINT32:
+        return sizeof(uint32_t);
+    case PhysicalTypeID::UINT16:
+        return sizeof(uint16_t);
+    case PhysicalTypeID::UINT8:
+        return sizeof(uint8_t);
+    case PhysicalTypeID::INT128:
+        return sizeof(int128_t);
+    case PhysicalTypeID::DOUBLE:
+        return sizeof(double);
+    case PhysicalTypeID::FLOAT:
+        return sizeof(float);
+    case PhysicalTypeID::INTERVAL:
+        return sizeof(interval_t);
+    case PhysicalTypeID::INTERNAL_ID:
+        return sizeof(internalID_t);
+    case PhysicalTypeID::UINT128:
+        return sizeof(uint128_t);
+    case PhysicalTypeID::ALP_EXCEPTION_FLOAT:
+        return storage::EncodeException<float>::sizeInBytes();
+    case PhysicalTypeID::ALP_EXCEPTION_DOUBLE:
+        return storage::EncodeException<double>::sizeInBytes();
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+bool DecimalTypeInfo::operator==(const ExtraTypeInfo& other) const {
+    auto otherDecimalTypeInfo = ku_dynamic_cast<const DecimalTypeInfo*>(&other);
+    if (otherDecimalTypeInfo) {
+        return precision == otherDecimalTypeInfo->precision && scale == otherDecimalTypeInfo->scale;
+    }
+    return false;
+}
+
+std::unique_ptr<ExtraTypeInfo> DecimalTypeInfo::copy() const {
+    return std::make_unique<DecimalTypeInfo>(precision, scale);
+}
+
+std::unique_ptr<ExtraTypeInfo> DecimalTypeInfo::deserialize(Deserializer& deserializer) {
+    uint32_t precision = 0, scale = 0;
+    deserializer.deserializeValue<uint32_t>(precision);
+    deserializer.deserializeValue<uint32_t>(scale);
+    return std::make_unique<DecimalTypeInfo>(precision, scale);
+}
+
+void DecimalTypeInfo::serializeInternal(Serializer& serializer) const {
+    serializer.serializeValue(precision);
+    serializer.serializeValue(scale);
+}
+
+bool ListTypeInfo::containsAny() const {
+    return childType.containsAny();
+}
+
+bool ListTypeInfo::operator==(const ExtraTypeInfo& other) const {
+    auto otherListTypeInfo = ku_dynamic_cast<const ListTypeInfo*>(&other);
+    if (otherListTypeInfo) {
+        return childType == otherListTypeInfo->childType;
+    }
+    return false;
+}
+
+std::unique_ptr<ExtraTypeInfo> ListTypeInfo::copy() const {
+    return std::make_unique<ListTypeInfo>(childType.copy());
+}
+
+std::unique_ptr<ExtraTypeInfo> ListTypeInfo::deserialize(Deserializer& deserializer) {
+    return std::make_unique<ListTypeInfo>(LogicalType::deserialize(deserializer));
+}
+
+void ListTypeInfo::serializeInternal(Serializer& serializer) const {
+    childType.serialize(serializer);
+}
+
+bool ArrayTypeInfo::operator==(const ExtraTypeInfo& other) const {
+    auto otherArrayTypeInfo = ku_dynamic_cast<const ArrayTypeInfo*>(&other);
+    if (otherArrayTypeInfo) {
+        return childType == otherArrayTypeInfo->childType &&
+               numElements == otherArrayTypeInfo->numElements;
+    }
+    return false;
+}
+
+std::unique_ptr<ExtraTypeInfo> ArrayTypeInfo::deserialize(Deserializer& deserializer) {
+    auto childType = LogicalType::deserialize(deserializer);
+    uint64_t numElements = 0;
+    deserializer.deserializeValue(numElements);
+    return std::make_unique<ArrayTypeInfo>(std::move(childType), numElements);
+}
+
+std::unique_ptr<ExtraTypeInfo> ArrayTypeInfo::copy() const {
+    return std::make_unique<ArrayTypeInfo>(childType.copy(), numElements);
+}
+
+void ArrayTypeInfo::serializeInternal(Serializer& serializer) const {
+    ListTypeInfo::serializeInternal(serializer);
+    serializer.serializeValue(numElements);
+}
+
+bool StructField::containsAny() const {
+    return type.containsAny();
+}
+
+bool StructField::operator==(const StructField& other) const {
+    return type == other.type;
+}
+
+void StructField::serialize(Serializer& serializer) const {
+    serializer.serializeValue(name);
+    type.serialize(serializer);
+}
+
+StructField StructField::deserialize(Deserializer& deserializer) {
+    std::string name;
+    deserializer.deserializeValue(name);
+    auto type = LogicalType::deserialize(deserializer);
+    return StructField(std::move(name), std::move(type));
+}
+
+StructField StructField::copy() const {
+    return StructField(name, type.copy());
+}
+
+StructTypeInfo::StructTypeInfo(std::vector<StructField>&& fields) : fields{std::move(fields)} {
+    for (auto i = 0u; i < this->fields.size(); i++) {
+        auto fieldName = this->fields[i].getName();
+        StringUtils::toUpper(fieldName);
+        fieldNameToIdxMap.emplace(std::move(fieldName), i);
+    }
+}
+
+StructTypeInfo::StructTypeInfo(const std::vector<std::string>& fieldNames,
+    const std::vector<LogicalType>& fieldTypes) {
+    for (auto i = 0u; i < fieldNames.size(); ++i) {
+        auto fieldName = fieldNames[i];
+        auto normalizedFieldName = fieldName;
+        StringUtils::toUpper(normalizedFieldName);
+        fieldNameToIdxMap.emplace(normalizedFieldName, i);
+        fields.emplace_back(fieldName, fieldTypes[i].copy());
+    }
+}
+
+bool StructTypeInfo::hasField(const std::string& fieldName) const {
+    auto copy = fieldName;
+    StringUtils::toUpper(copy);
+    return fieldNameToIdxMap.contains(copy);
+}
+
+struct_field_idx_t StructTypeInfo::getStructFieldIdx(std::string fieldName) const {
+    StringUtils::toUpper(fieldName);
+    if (fieldNameToIdxMap.contains(fieldName)) {
+        return fieldNameToIdxMap.at(fieldName);
+    }
+    return INVALID_STRUCT_FIELD_IDX;
+}
+
+const StructField& StructTypeInfo::getStructField(struct_field_idx_t idx) const {
+    return fields[idx];
+}
+
+const StructField& StructTypeInfo::getStructField(const std::string& fieldName) const {
+    auto idx = getStructFieldIdx(fieldName);
+    if (idx == INVALID_STRUCT_FIELD_IDX) {
+        throw BinderException("Cannot find field " + fieldName + " in STRUCT.");
+    }
+    return fields[idx];
+}
+
+const LogicalType& StructTypeInfo::getChildType(lbug::common::struct_field_idx_t idx) const {
+    return fields[idx].getType();
+}
+
+std::vector<const LogicalType*> StructTypeInfo::getChildrenTypes() const {
+    std::vector<const LogicalType*> childrenTypesToReturn;
+    for (auto i = 0u; i < fields.size(); i++) {
+        childrenTypesToReturn.push_back(&fields[i].getType());
+    }
+    return childrenTypesToReturn;
+}
+
+std::vector<std::string> StructTypeInfo::getChildrenNames() const {
+    std::vector<std::string> childrenNames{fields.size()};
+    for (auto i = 0u; i < fields.size(); i++) {
+        childrenNames[i] = fields[i].getName();
+    }
+    return childrenNames;
+}
+
+const std::vector<StructField>& StructTypeInfo::getStructFields() const {
+    return fields;
+}
+
+bool StructTypeInfo::containsAny() const {
+    for (auto& field : fields) {
+        if (field.containsAny()) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool StructTypeInfo::operator==(const ExtraTypeInfo& other) const {
+    auto otherStructTypeInfo = ku_dynamic_cast<const StructTypeInfo*>(&other);
+    if (otherStructTypeInfo) {
+        if (fields.size() != otherStructTypeInfo->fields.size()) {
+            return false;
+        }
+        for (auto i = 0u; i < fields.size(); ++i) {
+            if (fields[i] != otherStructTypeInfo->fields[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+    return false;
+}
+
+std::unique_ptr<ExtraTypeInfo> StructTypeInfo::deserialize(Deserializer& deserializer) {
+    std::vector<StructField> fields;
+    deserializer.deserializeVector(fields);
+    return std::make_unique<StructTypeInfo>(std::move(fields));
+}
+
+std::unique_ptr<ExtraTypeInfo> StructTypeInfo::copy() const {
+    std::vector<StructField> structFields{fields.size()};
+    for (auto i = 0u; i < fields.size(); i++) {
+        structFields[i] = fields[i].copy();
+    }
+    return std::make_unique<StructTypeInfo>(std::move(structFields));
+}
+
+void StructTypeInfo::serializeInternal(Serializer& serializer) const {
+    serializer.serializeVector(fields);
+}
+
+static std::string getIncompleteTypeErrMsg(LogicalTypeID id) {
+    return "Trying to create nested type " + LogicalTypeUtils::toString(id) +
+           " without child information.";
+}
+
+LogicalType::LogicalType(LogicalTypeID typeID, TypeCategory info)
+    : typeID{typeID}, extraTypeInfo{nullptr}, category{info} {
+    // LCOV_EXCL_START
+    switch (typeID) {
+    case LogicalTypeID::DECIMAL:
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::STRUCT:
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::UNION:
+        throw BinderException(getIncompleteTypeErrMsg(typeID));
+    default:
+        break;
+    }
+    physicalType = getPhysicalType(typeID);
+    // LCOV_EXCL_STOP
+}
+
+LogicalType::LogicalType(LogicalTypeID typeID, std::unique_ptr<ExtraTypeInfo> extraTypeInfo)
+    : typeID{typeID}, extraTypeInfo{std::move(extraTypeInfo)} {
+    physicalType = getPhysicalType(typeID, this->extraTypeInfo);
+}
+
+LogicalType::LogicalType(const LogicalType& other) {
+    typeID = other.typeID;
+    physicalType = other.physicalType;
+    if (other.extraTypeInfo != nullptr) {
+        extraTypeInfo = other.extraTypeInfo->copy();
+    }
+    category = other.category;
+}
+
+bool LogicalType::containsAny() const {
+    if (extraTypeInfo != nullptr) {
+        return extraTypeInfo->containsAny();
+    }
+    return typeID == LogicalTypeID::ANY;
+}
+
+bool LogicalType::operator==(const LogicalType& other) const {
+    if (typeID != other.typeID || category != other.category) {
+        return false;
+    }
+    if (extraTypeInfo) {
+        return *extraTypeInfo == *other.extraTypeInfo;
+    }
+    return true;
+}
+
+bool LogicalType::operator!=(const LogicalType& other) const {
+    return !((*this) == other);
+}
+
+std::string LogicalType::toString() const {
+    if (!isInternalType()) {
+        return extraTypeInfo->constPtrCast<UDTTypeInfo>()->getTypeName();
+    }
+    switch (typeID) {
+    case LogicalTypeID::MAP: {
+        auto structType = ku_dynamic_cast<ListTypeInfo*>(extraTypeInfo.get())->getChildType();
+        auto fieldTypes = StructType::getFieldTypes(structType);
+        return "MAP(" + fieldTypes[0]->toString() + ", " + fieldTypes[1]->toString() + ")";
+    }
+    case LogicalTypeID::LIST: {
+        auto listTypeInfo = ku_dynamic_cast<ListTypeInfo*>(extraTypeInfo.get());
+        return listTypeInfo->getChildType().toString() + "[]";
+    }
+    case LogicalTypeID::ARRAY: {
+        auto arrayTypeInfo = ku_dynamic_cast<ArrayTypeInfo*>(extraTypeInfo.get());
+        return arrayTypeInfo->getChildType().toString() + "[" +
+               std::to_string(arrayTypeInfo->getNumElements()) + "]";
+    }
+    case LogicalTypeID::UNION: {
+        auto unionTypeInfo = ku_dynamic_cast<StructTypeInfo*>(extraTypeInfo.get());
+        std::string dataTypeStr = LogicalTypeUtils::toString(typeID) + "(";
+        auto numFields = unionTypeInfo->getChildrenTypes().size();
+        auto fieldNames = unionTypeInfo->getChildrenNames();
+        for (auto i = 1u; i < numFields; i++) {
+            dataTypeStr += fieldNames[i] + " ";
+            dataTypeStr += unionTypeInfo->getChildType(i).toString();
+            dataTypeStr += (i == numFields - 1 ? ")" : ", ");
+        }
+        return dataTypeStr;
+    }
+    case LogicalTypeID::STRUCT: {
+        auto structTypeInfo = ku_dynamic_cast<StructTypeInfo*>(extraTypeInfo.get());
+        std::string dataTypeStr = LogicalTypeUtils::toString(typeID) + "(";
+        auto numFields = structTypeInfo->getChildrenTypes().size();
+        auto fieldNames = structTypeInfo->getChildrenNames();
+        for (auto i = 0u; i < numFields; i++) {
+            dataTypeStr += fieldNames[i] + " ";
+            dataTypeStr += structTypeInfo->getChildType(i).toString();
+            if (i + 1 != numFields) {
+                dataTypeStr += ", ";
+            }
+        }
+        return dataTypeStr + ")";
+    }
+    case LogicalTypeID::DECIMAL: {
+        auto decimalTypeInfo = ku_dynamic_cast<DecimalTypeInfo*>(extraTypeInfo.get());
+        return "DECIMAL(" + std::to_string(decimalTypeInfo->getPrecision()) + ", " +
+               std::to_string(decimalTypeInfo->getScale()) + ")";
+    }
+    case LogicalTypeID::ANY:
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::INTERNAL_ID:
+    case LogicalTypeID::BOOL:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::INT8:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DATE:
+    case LogicalTypeID::TIMESTAMP_NS:
+    case LogicalTypeID::TIMESTAMP_MS:
+    case LogicalTypeID::TIMESTAMP_SEC:
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::TIMESTAMP:
+    case LogicalTypeID::INTERVAL:
+    case LogicalTypeID::UINT128:
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::UUID:
+    case LogicalTypeID::STRING:
+    case LogicalTypeID::SERIAL:
+        return LogicalTypeUtils::toString(typeID);
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static bool tryGetIDFromString(const std::string& trimmedStr, LogicalTypeID& id);
+static std::vector<std::string> parseStructFields(const std::string& structTypeStr);
+static LogicalType parseListType(const std::string& trimmedStr,
+    main::ClientContext* context = nullptr);
+static LogicalType parseArrayType(const std::string& trimmedStr,
+    main::ClientContext* context = nullptr);
+static std::vector<StructField> parseStructTypeInfo(const std::string& structTypeStr,
+    main::ClientContext* context, std::string defType);
+static LogicalType parseStructType(const std::string& trimmedStr,
+    main::ClientContext* context = nullptr);
+static LogicalType parseMapType(const std::string& trimmedStr,
+    main::ClientContext* context = nullptr);
+static LogicalType parseUnionType(const std::string& trimmedStr,
+    main::ClientContext* context = nullptr);
+static LogicalType parseDecimalType(const std::string& trimmedStr);
+
+bool LogicalType::isBuiltInType(const std::string& str) {
+    auto trimmedStr = StringUtils::ltrim(StringUtils::rtrim(str));
+    auto upperDataTypeString = StringUtils::getUpper(trimmedStr);
+    auto id = LogicalTypeID::ANY;
+    try {
+        if (upperDataTypeString.ends_with("[]")) {
+            parseListType(trimmedStr);
+        } else if (upperDataTypeString.ends_with("]")) {
+            parseArrayType(trimmedStr);
+        } else if (upperDataTypeString.starts_with("STRUCT")) {
+            parseStructType(trimmedStr);
+        } else if (upperDataTypeString.starts_with("MAP")) {
+            parseMapType(trimmedStr);
+        } else if (upperDataTypeString.starts_with("UNION")) {
+            parseUnionType(trimmedStr);
+        } else if (upperDataTypeString.starts_with("DECIMAL") ||
+                   upperDataTypeString.starts_with("NUMERIC")) {
+            parseDecimalType(trimmedStr);
+        } else if (!tryGetIDFromString(upperDataTypeString, id)) {
+            return false;
+        }
+    } catch (...) {
+        return false;
+    }
+    return true;
+}
+
+LogicalType LogicalType::convertFromString(const std::string& str, main::ClientContext* context) {
+    LogicalType type;
+    auto trimmedStr = StringUtils::ltrim(StringUtils::rtrim(str));
+    auto upperDataTypeString = StringUtils::getUpper(trimmedStr);
+    if (upperDataTypeString.ends_with("[]")) {
+        type = parseListType(trimmedStr, context);
+    } else if (upperDataTypeString.ends_with("]")) {
+        type = parseArrayType(trimmedStr, context);
+    } else if (upperDataTypeString.starts_with("STRUCT")) {
+        type = parseStructType(trimmedStr, context);
+    } else if (upperDataTypeString.starts_with("MAP")) {
+        type = parseMapType(trimmedStr, context);
+    } else if (upperDataTypeString.starts_with("UNION")) {
+        type = parseUnionType(trimmedStr, context);
+    } else if (upperDataTypeString.starts_with("DECIMAL") ||
+               upperDataTypeString.starts_with("NUMERIC")) {
+        type = parseDecimalType(trimmedStr);
+    } else if (tryGetIDFromString(upperDataTypeString, type.typeID)) {
+        type.physicalType = LogicalType::getPhysicalType(type.typeID, type.extraTypeInfo);
+    } else if (context != nullptr) {
+        auto transaction = transaction::Transaction::Get(*context);
+        type = catalog::Catalog::Get(*context)->getType(transaction, upperDataTypeString);
+    } else {
+        throw common::RuntimeException{"Invalid datatype string: " + str};
+    }
+    return type;
+}
+
+void LogicalType::serialize(Serializer& serializer) const {
+    serializer.serializeValue(typeID);
+    serializer.serializeValue(physicalType);
+    serializer.serializeValue(category);
+    if (extraTypeInfo != nullptr) {
+        extraTypeInfo->serialize(serializer);
+    }
+}
+
+LogicalType LogicalType::deserialize(Deserializer& deserializer) {
+    auto typeID = LogicalTypeID::ANY;
+    deserializer.deserializeValue(typeID);
+    auto physicalType = PhysicalTypeID::ANY;
+    deserializer.deserializeValue(physicalType);
+    TypeCategory typeCategory{};
+    deserializer.deserializeValue(typeCategory);
+    std::unique_ptr<ExtraTypeInfo> extraTypeInfo;
+    if (typeCategory == TypeCategory::UDT) {
+        extraTypeInfo = UDTTypeInfo::deserialize(deserializer);
+    } else {
+        switch (physicalType) {
+        case PhysicalTypeID::LIST: {
+            extraTypeInfo = ListTypeInfo::deserialize(deserializer);
+        } break;
+        case PhysicalTypeID::ARRAY: {
+            extraTypeInfo = ArrayTypeInfo::deserialize(deserializer);
+        } break;
+        case PhysicalTypeID::STRUCT: {
+            extraTypeInfo = StructTypeInfo::deserialize(deserializer);
+        } break;
+        default:
+            if (typeID == LogicalTypeID::DECIMAL) {
+                extraTypeInfo = DecimalTypeInfo::deserialize(deserializer);
+            } else {
+                extraTypeInfo = nullptr;
+            }
+        }
+    }
+    auto result = LogicalType();
+    result.typeID = typeID;
+    result.physicalType = physicalType;
+    result.extraTypeInfo = std::move(extraTypeInfo);
+    result.category = typeCategory;
+    return result;
+}
+
+std::vector<LogicalType> LogicalType::copy(const std::vector<LogicalType>& types) {
+    std::vector<LogicalType> typesCopy;
+    for (auto& type : types) {
+        typesCopy.push_back(type.copy());
+    }
+    return typesCopy;
+}
+
+std::vector<LogicalType> LogicalType::copy(const std::vector<LogicalType*>& types) {
+    std::vector<LogicalType> typesCopy;
+    typesCopy.reserve(types.size());
+    for (auto& type : types) {
+        typesCopy.push_back(type->copy());
+    }
+    return typesCopy;
+}
+
+PhysicalTypeID LogicalType::getPhysicalType(LogicalTypeID typeID,
+    const std::unique_ptr<ExtraTypeInfo>& extraTypeInfo) {
+    switch (typeID) {
+    case LogicalTypeID::ANY: {
+        return PhysicalTypeID::ANY;
+    }
+    case LogicalTypeID::BOOL: {
+        return PhysicalTypeID::BOOL;
+    }
+    case LogicalTypeID::TIMESTAMP_MS:
+    case LogicalTypeID::TIMESTAMP_NS:
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::TIMESTAMP_SEC:
+    case LogicalTypeID::TIMESTAMP:
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64: {
+        return PhysicalTypeID::INT64;
+    }
+    case LogicalTypeID::DATE:
+    case LogicalTypeID::INT32: {
+        return PhysicalTypeID::INT32;
+    }
+    case LogicalTypeID::INT16: {
+        return PhysicalTypeID::INT16;
+    }
+    case LogicalTypeID::INT8: {
+        return PhysicalTypeID::INT8;
+    }
+    case LogicalTypeID::UINT64: {
+        return PhysicalTypeID::UINT64;
+    }
+    case LogicalTypeID::UINT32: {
+        return PhysicalTypeID::UINT32;
+    }
+    case LogicalTypeID::UINT16: {
+        return PhysicalTypeID::UINT16;
+    }
+    case LogicalTypeID::UINT8: {
+        return PhysicalTypeID::UINT8;
+    }
+    case LogicalTypeID::UUID:
+    case LogicalTypeID::INT128: {
+        return PhysicalTypeID::INT128;
+    }
+    case LogicalTypeID::DOUBLE: {
+        return PhysicalTypeID::DOUBLE;
+    }
+    case LogicalTypeID::FLOAT: {
+        return PhysicalTypeID::FLOAT;
+    }
+    case LogicalTypeID::DECIMAL: {
+        if (extraTypeInfo == nullptr) {
+            throw BinderException(getIncompleteTypeErrMsg(typeID));
+        }
+        auto decimalTypeInfo = extraTypeInfo->constPtrCast<DecimalTypeInfo>();
+        auto precision = decimalTypeInfo->getPrecision();
+        if (precision <= 4) {
+            return PhysicalTypeID::INT16;
+        } else if (precision <= 9) {
+            return PhysicalTypeID::INT32;
+        } else if (precision <= 18) {
+            return PhysicalTypeID::INT64;
+        } else if (precision <= 38) {
+            return PhysicalTypeID::INT128;
+        } else {
+            throw BinderException("Precision of decimal must be no greater than 38");
+        }
+    }
+    case LogicalTypeID::INTERVAL: {
+        return PhysicalTypeID::INTERVAL;
+    }
+    case LogicalTypeID::INTERNAL_ID: {
+        return PhysicalTypeID::INTERNAL_ID;
+    }
+    case LogicalTypeID::UINT128: {
+        return PhysicalTypeID::UINT128;
+    }
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::STRING: {
+        return PhysicalTypeID::STRING;
+    }
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::LIST: {
+        return PhysicalTypeID::LIST;
+    }
+    case LogicalTypeID::ARRAY: {
+        return PhysicalTypeID::ARRAY;
+    }
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::UNION:
+    case LogicalTypeID::STRUCT: {
+        return PhysicalTypeID::STRUCT;
+    }
+    case LogicalTypeID::POINTER: {
+        return PhysicalTypeID::POINTER;
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+bool tryGetIDFromString(const std::string& str, LogicalTypeID& id) {
+    auto upperStr = StringUtils::getUpper(str);
+    if ("INTERNAL_ID" == upperStr) {
+        id = LogicalTypeID::INTERNAL_ID;
+    } else if ("INT64" == upperStr) {
+        id = LogicalTypeID::INT64;
+    } else if ("INT32" == upperStr || "INT" == upperStr) {
+        id = LogicalTypeID::INT32;
+    } else if ("INT16" == upperStr) {
+        id = LogicalTypeID::INT16;
+    } else if ("INT8" == upperStr) {
+        id = LogicalTypeID::INT8;
+    } else if ("UINT64" == upperStr) {
+        id = LogicalTypeID::UINT64;
+    } else if ("UINT32" == upperStr) {
+        id = LogicalTypeID::UINT32;
+    } else if ("UINT16" == upperStr) {
+        id = LogicalTypeID::UINT16;
+    } else if ("UINT8" == upperStr) {
+        id = LogicalTypeID::UINT8;
+    } else if ("INT128" == upperStr) {
+        id = LogicalTypeID::INT128;
+    } else if ("UINT128" == upperStr) {
+        id = LogicalTypeID::UINT128;
+    } else if ("DOUBLE" == upperStr || "FLOAT8" == upperStr) {
+        id = LogicalTypeID::DOUBLE;
+    } else if ("FLOAT" == upperStr || "FLOAT4" == upperStr || "REAL" == upperStr) {
+        id = LogicalTypeID::FLOAT;
+    } else if ("DECIMAL" == upperStr || "NUMERIC" == upperStr) {
+        id = LogicalTypeID::DECIMAL;
+    } else if ("BOOLEAN" == upperStr || "BOOL" == upperStr) {
+        id = LogicalTypeID::BOOL;
+    } else if ("BYTEA" == upperStr || "BLOB" == upperStr) {
+        id = LogicalTypeID::BLOB;
+    } else if ("UUID" == upperStr) {
+        id = LogicalTypeID::UUID;
+    } else if ("STRING" == upperStr) {
+        id = LogicalTypeID::STRING;
+    } else if ("DATE" == upperStr) {
+        id = LogicalTypeID::DATE;
+    } else if ("TIMESTAMP" == upperStr) {
+        id = LogicalTypeID::TIMESTAMP;
+    } else if ("TIMESTAMP_NS" == upperStr) {
+        id = LogicalTypeID::TIMESTAMP_NS;
+    } else if ("TIMESTAMP_MS" == upperStr) {
+        id = LogicalTypeID::TIMESTAMP_MS;
+    } else if ("TIMESTAMP_SEC" == upperStr || "TIMESTAMP_S" == upperStr) {
+        id = LogicalTypeID::TIMESTAMP_SEC;
+    } else if ("TIMESTAMP_TZ" == upperStr) {
+        id = LogicalTypeID::TIMESTAMP_TZ;
+    } else if ("INTERVAL" == upperStr || "DURATION" == upperStr) {
+        id = LogicalTypeID::INTERVAL;
+    } else if ("SERIAL" == upperStr) {
+        id = LogicalTypeID::SERIAL;
+    } else {
+        return false;
+    }
+    return true;
+}
+
+std::string LogicalTypeUtils::toString(LogicalTypeID dataTypeID) {
+    // LCOV_EXCL_START
+    switch (dataTypeID) {
+    case LogicalTypeID::ANY:
+        return "ANY";
+    case LogicalTypeID::NODE:
+        return "NODE";
+    case LogicalTypeID::REL:
+        return "REL";
+    case LogicalTypeID::RECURSIVE_REL:
+        return "RECURSIVE_REL";
+    case LogicalTypeID::INTERNAL_ID:
+        return "INTERNAL_ID";
+    case LogicalTypeID::BOOL:
+        return "BOOL";
+    case LogicalTypeID::INT64:
+        return "INT64";
+    case LogicalTypeID::INT32:
+        return "INT32";
+    case LogicalTypeID::INT16:
+        return "INT16";
+    case LogicalTypeID::INT8:
+        return "INT8";
+    case LogicalTypeID::UINT64:
+        return "UINT64";
+    case LogicalTypeID::UINT32:
+        return "UINT32";
+    case LogicalTypeID::UINT16:
+        return "UINT16";
+    case LogicalTypeID::UINT8:
+        return "UINT8";
+    case LogicalTypeID::INT128:
+        return "INT128";
+    case LogicalTypeID::UINT128:
+        return "UINT128";
+    case LogicalTypeID::DOUBLE:
+        return "DOUBLE";
+    case LogicalTypeID::FLOAT:
+        return "FLOAT";
+    case LogicalTypeID::DATE:
+        return "DATE";
+    case LogicalTypeID::TIMESTAMP_NS:
+        return "TIMESTAMP_NS";
+    case LogicalTypeID::TIMESTAMP_MS:
+        return "TIMESTAMP_MS";
+    case LogicalTypeID::TIMESTAMP_SEC:
+        return "TIMESTAMP_SEC";
+    case LogicalTypeID::TIMESTAMP_TZ:
+        return "TIMESTAMP_TZ";
+    case LogicalTypeID::TIMESTAMP:
+        return "TIMESTAMP";
+    case LogicalTypeID::INTERVAL:
+        return "INTERVAL";
+    case LogicalTypeID::DECIMAL:
+        return "DECIMAL";
+    case LogicalTypeID::BLOB:
+        return "BLOB";
+    case LogicalTypeID::UUID:
+        return "UUID";
+    case LogicalTypeID::STRING:
+        return "STRING";
+    case LogicalTypeID::LIST:
+        return "LIST";
+    case LogicalTypeID::ARRAY:
+        return "ARRAY";
+    case LogicalTypeID::STRUCT:
+        return "STRUCT";
+    case LogicalTypeID::SERIAL:
+        return "SERIAL";
+    case LogicalTypeID::MAP:
+        return "MAP";
+    case LogicalTypeID::UNION:
+        return "UNION";
+    case LogicalTypeID::POINTER:
+        return "POINTER";
+    default:
+        KU_UNREACHABLE;
+    }
+    // LCOV_EXCL_STOP
+}
+
+std::string LogicalTypeUtils::toString(const std::vector<LogicalType>& dataTypes) {
+    if (dataTypes.empty()) {
+        return {""};
+    }
+    std::string result = "(" + dataTypes[0].toString();
+    for (auto i = 1u; i < dataTypes.size(); ++i) {
+        result += "," + dataTypes[i].toString();
+    }
+    result += ")";
+    return result;
+}
+
+std::string LogicalTypeUtils::toString(const std::vector<LogicalTypeID>& dataTypeIDs) {
+    if (dataTypeIDs.empty()) {
+        return {"()"};
+    }
+    std::string result = "(" + LogicalTypeUtils::toString(dataTypeIDs[0]);
+    for (auto i = 1u; i < dataTypeIDs.size(); ++i) {
+        result += "," + LogicalTypeUtils::toString(dataTypeIDs[i]);
+    }
+    result += ")";
+    return result;
+}
+
+uint32_t LogicalTypeUtils::getRowLayoutSize(const LogicalType& type) {
+    switch (type.getPhysicalType()) {
+    case PhysicalTypeID::STRING: {
+        return sizeof(ku_string_t);
+    }
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        return sizeof(ku_list_t);
+    }
+    case PhysicalTypeID::STRUCT: {
+        uint32_t size = 0;
+        auto fieldsTypes = StructType::getFieldTypes(type);
+        for (const auto& fieldType : fieldsTypes) {
+            size += getRowLayoutSize(*fieldType);
+        }
+        size += NullBuffer::getNumBytesForNullValues(fieldsTypes.size());
+        return size;
+    }
+    default:
+        return PhysicalTypeUtils::getFixedTypeSize(type.getPhysicalType());
+    }
+}
+
+bool LogicalTypeUtils::isDate(const LogicalType& dataType) {
+    return isDate(dataType.typeID);
+}
+
+bool LogicalTypeUtils::isDate(const LogicalTypeID& dataType) {
+    return dataType == LogicalTypeID::DATE;
+}
+
+bool LogicalTypeUtils::isTimestamp(const LogicalType& dataType) {
+    return isTimestamp(dataType.typeID);
+}
+
+bool LogicalTypeUtils::isTimestamp(const LogicalTypeID& dataType) {
+    switch (dataType) {
+    case LogicalTypeID::TIMESTAMP:
+    case LogicalTypeID::TIMESTAMP_SEC:
+    case LogicalTypeID::TIMESTAMP_MS:
+    case LogicalTypeID::TIMESTAMP_NS:
+        return true;
+    default:
+        return false;
+    }
+}
+
+bool LogicalTypeUtils::isUnsigned(const LogicalType& dataType) {
+    return isUnsigned(dataType.typeID);
+}
+
+bool LogicalTypeUtils::isUnsigned(const LogicalTypeID& dataType) {
+    switch (dataType) {
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::UINT128:
+        return true;
+    default:
+        return false;
+    }
+}
+
+bool LogicalTypeUtils::isIntegral(const LogicalType& dataType) {
+    return isIntegral(dataType.typeID);
+}
+
+bool LogicalTypeUtils::isIntegral(const LogicalTypeID& dataType) {
+    switch (dataType) {
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::INT8:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::UINT128:
+    case LogicalTypeID::SERIAL:
+        return true;
+    default:
+        return false;
+    }
+}
+
+bool LogicalTypeUtils::isNumerical(const LogicalType& dataType) {
+    return isNumerical(dataType.typeID);
+}
+
+bool LogicalTypeUtils::isNumerical(const LogicalTypeID& dataType) {
+    switch (dataType) {
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::INT8:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::UINT128:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::DECIMAL:
+        return true;
+    default:
+        return false;
+    }
+}
+
+bool LogicalTypeUtils::isFloatingPoint(const LogicalTypeID& dataType) {
+    switch (dataType) {
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::DECIMAL:
+        return true;
+    default:
+        return false;
+    }
+}
+
+bool LogicalTypeUtils::isNested(const LogicalType& dataType) {
+    return isNested(dataType.typeID);
+}
+
+bool LogicalTypeUtils::isNested(lbug::common::LogicalTypeID logicalTypeID) {
+    switch (logicalTypeID) {
+    case LogicalTypeID::STRUCT:
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::UNION:
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL:
+        return true;
+    default:
+        return false;
+    }
+}
+
+std::vector<LogicalTypeID> LogicalTypeUtils::getAllValidComparableLogicalTypes() {
+    return std::vector<LogicalTypeID>{LogicalTypeID::BOOL, LogicalTypeID::INT64,
+        LogicalTypeID::INT32, LogicalTypeID::INT16, LogicalTypeID::INT8, LogicalTypeID::UINT64,
+        LogicalTypeID::UINT32, LogicalTypeID::UINT16, LogicalTypeID::UINT8, LogicalTypeID::INT128,
+        LogicalTypeID::UINT128, LogicalTypeID::DOUBLE, LogicalTypeID::FLOAT, LogicalTypeID::DATE,
+        LogicalTypeID::TIMESTAMP, LogicalTypeID::TIMESTAMP_NS, LogicalTypeID::TIMESTAMP_MS,
+        LogicalTypeID::TIMESTAMP_SEC, LogicalTypeID::TIMESTAMP_TZ, LogicalTypeID::INTERVAL,
+        LogicalTypeID::BLOB, LogicalTypeID::UUID, LogicalTypeID::STRING, LogicalTypeID::SERIAL};
+}
+
+std::vector<LogicalTypeID> LogicalTypeUtils::getIntegerTypeIDs() {
+    return std::vector<LogicalTypeID>{LogicalTypeID::INT128, LogicalTypeID::INT64,
+        LogicalTypeID::INT32, LogicalTypeID::INT16, LogicalTypeID::INT8, LogicalTypeID::SERIAL,
+        LogicalTypeID::UINT128, LogicalTypeID::UINT64, LogicalTypeID::UINT32, LogicalTypeID::UINT16,
+        LogicalTypeID::UINT8};
+}
+
+std::vector<LogicalTypeID> LogicalTypeUtils::getFloatingPointTypeIDs() {
+    return std::vector<LogicalTypeID>{LogicalTypeID::DOUBLE, LogicalTypeID::FLOAT};
+}
+
+std::vector<LogicalTypeID> LogicalTypeUtils::getNumericalLogicalTypeIDs() {
+    auto integerTypes = getIntegerTypeIDs();
+    auto floatingPointTypes = getFloatingPointTypeIDs();
+    integerTypes.insert(integerTypes.end(), floatingPointTypes.begin(), floatingPointTypes.end());
+    // integerTypes.push_back(LogicalTypeID::DECIMAL); // fixed point numeric
+    return integerTypes;
+}
+
+std::vector<LogicalTypeID> LogicalTypeUtils::getAllValidLogicTypeIDs() {
+    return std::vector<LogicalTypeID>{LogicalTypeID::INTERNAL_ID, LogicalTypeID::BOOL,
+        LogicalTypeID::INT64, LogicalTypeID::INT32, LogicalTypeID::INT16, LogicalTypeID::INT8,
+        LogicalTypeID::UINT64, LogicalTypeID::UINT32, LogicalTypeID::UINT16, LogicalTypeID::UINT8,
+        LogicalTypeID::INT128, LogicalTypeID::UINT128, LogicalTypeID::DOUBLE, LogicalTypeID::STRING,
+        LogicalTypeID::BLOB, LogicalTypeID::UUID, LogicalTypeID::DATE, LogicalTypeID::TIMESTAMP,
+        LogicalTypeID::TIMESTAMP_NS, LogicalTypeID::TIMESTAMP_MS, LogicalTypeID::TIMESTAMP_SEC,
+        LogicalTypeID::TIMESTAMP_TZ, LogicalTypeID::INTERVAL, LogicalTypeID::LIST,
+        LogicalTypeID::ARRAY, LogicalTypeID::MAP, LogicalTypeID::FLOAT, LogicalTypeID::SERIAL,
+        LogicalTypeID::NODE, LogicalTypeID::REL, LogicalTypeID::RECURSIVE_REL,
+        LogicalTypeID::STRUCT, LogicalTypeID::UNION};
+}
+
+std::vector<LogicalType> LogicalTypeUtils::getAllValidLogicTypes() {
+    std::vector<LogicalType> typeVec;
+    typeVec.push_back(LogicalType::INTERNAL_ID());
+    typeVec.push_back(LogicalType::BOOL());
+    typeVec.push_back(LogicalType::INT32());
+    typeVec.push_back(LogicalType::INT64());
+    typeVec.push_back(LogicalType::INT16());
+    typeVec.push_back(LogicalType::INT8());
+    typeVec.push_back(LogicalType::UINT64());
+    typeVec.push_back(LogicalType::UINT32());
+    typeVec.push_back(LogicalType::UINT16());
+    typeVec.push_back(LogicalType::UINT8());
+    typeVec.push_back(LogicalType::INT128());
+    typeVec.push_back(LogicalType::UINT128());
+    typeVec.push_back(LogicalType::DOUBLE());
+    typeVec.push_back(LogicalType::STRING());
+    typeVec.push_back(LogicalType::BLOB());
+    typeVec.push_back(LogicalType::UUID());
+    typeVec.push_back(LogicalType::DATE());
+    typeVec.push_back(LogicalType::TIMESTAMP());
+    typeVec.push_back(LogicalType::TIMESTAMP_NS());
+    typeVec.push_back(LogicalType::TIMESTAMP_MS());
+    typeVec.push_back(LogicalType::TIMESTAMP_SEC());
+    typeVec.push_back(LogicalType::TIMESTAMP_TZ());
+    typeVec.push_back(LogicalType::INTERVAL());
+    typeVec.push_back(LogicalType::LIST(LogicalType::ANY()));
+    typeVec.push_back(LogicalType::ARRAY(LogicalType::ANY(), 0));
+    typeVec.push_back(LogicalType::MAP(LogicalType::ANY(), LogicalType::ANY()));
+    typeVec.push_back(LogicalType::FLOAT());
+    typeVec.push_back(LogicalType::SERIAL());
+    typeVec.push_back(LogicalType::NODE({}));
+    typeVec.push_back(LogicalType::REL({}));
+    typeVec.push_back(LogicalType::STRUCT({}));
+    typeVec.push_back(LogicalType::UNION({}));
+    return typeVec;
+}
+
+std::vector<std::string> parseStructFields(const std::string& structTypeStr) {
+    std::vector<std::string> structFieldsStr;
+    auto startPos = 0u;
+    auto curPos = 0u;
+    auto numOpenBrackets = 0u;
+    while (curPos < structTypeStr.length()) {
+        switch (structTypeStr[curPos]) {
+        case '(': {
+            numOpenBrackets++;
+        } break;
+        case ')': {
+            numOpenBrackets--;
+        } break;
+        case ',': {
+            if (numOpenBrackets == 0) {
+                structFieldsStr.push_back(
+                    StringUtils::ltrim(structTypeStr.substr(startPos, curPos - startPos)));
+                startPos = curPos + 1;
+            }
+        } break;
+        default: {
+            // Normal character, continue.
+        }
+        }
+        curPos++;
+    }
+    structFieldsStr.push_back(
+        StringUtils::ltrim(structTypeStr.substr(startPos, curPos - startPos)));
+    return structFieldsStr;
+}
+
+LogicalType parseListType(const std::string& trimmedStr, main::ClientContext* context) {
+    return LogicalType::LIST(
+        LogicalType::convertFromString(trimmedStr.substr(0, trimmedStr.size() - 2), context));
+}
+
+LogicalType parseArrayType(const std::string& trimmedStr, main::ClientContext* context) {
+    auto leftBracketPos = trimmedStr.find_last_of('[');
+    auto rightBracketPos = trimmedStr.find_last_of(']');
+    auto childType =
+        LogicalType(LogicalType::convertFromString(trimmedStr.substr(0, leftBracketPos), context));
+    auto numElements = std::strtoll(
+        trimmedStr.substr(leftBracketPos + 1, rightBracketPos - leftBracketPos - 1).c_str(),
+        nullptr, 0 /* base */);
+    if (numElements <= 0) {
+        // Note: the parser already guarantees that the number of elements is a non-negative
+        // number. However, we still need to check whether the number of elements is 0.
+        throw BinderException("The number of elements in an array must be greater than 0. Given: " +
+                              std::to_string(numElements) + ".");
+    }
+    return LogicalType::ARRAY(std::move(childType), numElements);
+}
+
+std::vector<StructField> parseStructTypeInfo(const std::string& structTypeStr,
+    main::ClientContext* context, std::string defType) {
+    auto leftBracketPos = structTypeStr.find('(');
+    auto rightBracketPos = structTypeStr.find_last_of(')');
+    if (leftBracketPos == std::string::npos || rightBracketPos == std::string::npos) {
+        throw Exception("Cannot parse struct type: " + structTypeStr);
+    }
+    // Remove the leading and trailing brackets.
+    auto structFieldsStr =
+        structTypeStr.substr(leftBracketPos + 1, rightBracketPos - leftBracketPos - 1);
+    std::vector<StructField> structFields;
+    auto structFieldStrs = parseStructFields(structFieldsStr);
+    auto numFields = structFieldStrs.size();
+    if (numFields > INVALID_STRUCT_FIELD_IDX + 1) {
+        throw BinderException(stringFormat("Too many fields in {} definition (max {}, got {})",
+            defType, INVALID_STRUCT_FIELD_IDX + 1, numFields));
+    }
+    std::set<std::string> fieldNames;
+    for (auto& structFieldStr : structFieldStrs) {
+        auto pos = structFieldStr.find(' ');
+        auto fieldName = structFieldStr.substr(0, pos);
+        if (!fieldNames.insert(fieldName).second) {
+            throw BinderException(
+                stringFormat("Duplicate field '{}' in {} definition", fieldName, defType));
+        }
+        auto fieldTypeString = structFieldStr.substr(pos + 1);
+        LogicalType fieldType = LogicalType::convertFromString(fieldTypeString, context);
+        structFields.emplace_back(fieldName, std::move(fieldType));
+    }
+    return structFields;
+}
+
+LogicalType parseStructType(const std::string& trimmedStr, main::ClientContext* context) {
+    return LogicalType::STRUCT(parseStructTypeInfo(trimmedStr, context, "STRUCT"));
+}
+
+LogicalType parseMapType(const std::string& trimmedStr, main::ClientContext* context) {
+    auto leftBracketPos = trimmedStr.find('(');
+    auto rightBracketPos = trimmedStr.find_last_of(')');
+    if (leftBracketPos == std::string::npos || rightBracketPos == std::string::npos) {
+        throw Exception("Cannot parse map type: " + trimmedStr);
+    }
+    auto mapTypeStr = trimmedStr.substr(leftBracketPos + 1, rightBracketPos - leftBracketPos - 1);
+    auto keyValueTypes = StringUtils::splitComma(mapTypeStr);
+    return LogicalType::MAP(LogicalType::convertFromString(keyValueTypes[0], context),
+        LogicalType::convertFromString(keyValueTypes[1], context));
+}
+
+LogicalType parseUnionType(const std::string& trimmedStr, main::ClientContext* context) {
+    return LogicalType::UNION(parseStructTypeInfo(trimmedStr, context, "UNION"));
+}
+
+LogicalType parseDecimalType(const std::string& trimmedStr) {
+    auto leftBracketPos = trimmedStr.find_last_of('(');
+    auto rightBracketPos = trimmedStr.find_last_of(')');
+    if (leftBracketPos == std::string::npos) {
+        return LogicalType::DECIMAL(18, 3);
+    }
+    auto paramSubstr = StringUtils::ltrim(StringUtils::rtrim(
+        trimmedStr.substr(leftBracketPos + 1, rightBracketPos - leftBracketPos - 1)));
+    auto commaPos = paramSubstr.find_last_of(',');
+    if (commaPos == std::string::npos) {
+        throw BinderException("Only found 1 parameter for NUMERIC/DECIMAL type, expected 2");
+    }
+    auto precisionStr = StringUtils::ltrim(StringUtils::rtrim(paramSubstr.substr(0, commaPos)));
+    auto scaleStr = StringUtils::ltrim(StringUtils::rtrim(paramSubstr.substr(commaPos + 1)));
+    auto precision = std::strtoll(precisionStr.c_str(), nullptr, 0);
+    auto scale = std::strtoll(scaleStr.c_str(), nullptr, 0);
+    if (precision <= 0 || precision > 38) {
+        throw BinderException(
+            "Precision of DECIMAL/NUMERIC must be a positive integer no greater than 38");
+    }
+    if (scale < 0 || scale > precision) {
+        throw BinderException(
+            "Scale of DECIMAL/NUMERIC must be a nonnegative integer no greater than the precision");
+    }
+    return LogicalType::DECIMAL((uint32_t)precision, (uint32_t)scale);
+}
+
+LogicalType LogicalType::DECIMAL(uint32_t precision, uint32_t scale) {
+    return LogicalType(LogicalTypeID::DECIMAL, std::make_unique<DecimalTypeInfo>(precision, scale));
+}
+
+LogicalType LogicalType::STRUCT(std::vector<StructField>&& fields) {
+    return LogicalType(LogicalTypeID::STRUCT, std::make_unique<StructTypeInfo>(std::move(fields)));
+}
+
+LogicalType LogicalType::RECURSIVE_REL(std::vector<StructField>&& fields) {
+    return LogicalType(LogicalTypeID::RECURSIVE_REL,
+        std::make_unique<StructTypeInfo>(std::move(fields)));
+}
+
+LogicalType LogicalType::NODE(std::vector<StructField>&& fields) {
+    return LogicalType(LogicalTypeID::NODE, std::make_unique<StructTypeInfo>(std::move(fields)));
+}
+
+LogicalType LogicalType::REL(std::vector<StructField>&& fields) {
+    return LogicalType(LogicalTypeID::REL, std::make_unique<StructTypeInfo>(std::move(fields)));
+}
+
+LogicalType LogicalType::UNION(std::vector<StructField>&& fields) {
+    // TODO(Ziy): Use UINT8 to represent tag value.
+    fields.insert(fields.begin(),
+        StructField(UnionType::TAG_FIELD_NAME, LogicalType(UnionType::TAG_FIELD_TYPE)));
+    return LogicalType(LogicalTypeID::UNION, std::make_unique<StructTypeInfo>(std::move(fields)));
+}
+
+LogicalType LogicalType::LIST(LogicalType childType) {
+    return LogicalType(LogicalTypeID::LIST, std::make_unique<ListTypeInfo>(std::move(childType)));
+}
+
+LogicalType LogicalType::MAP(LogicalType keyType, LogicalType valueType) {
+    std::vector<StructField> structFields;
+    structFields.emplace_back(InternalKeyword::MAP_KEY, std::move(keyType));
+    structFields.emplace_back(InternalKeyword::MAP_VALUE, std::move(valueType));
+    auto mapStructType = LogicalType::STRUCT(std::move(structFields));
+    return LogicalType(LogicalTypeID::MAP,
+        std::make_unique<ListTypeInfo>(std::move(mapStructType)));
+}
+
+LogicalType LogicalType::ARRAY(LogicalType childType, uint64_t numElements) {
+    return LogicalType(LogicalTypeID::ARRAY,
+        std::make_unique<ArrayTypeInfo>(std::move(childType), numElements));
+}
+
+// If we can combine the child types, then we can combine the list
+static bool tryCombineListTypes(const LogicalType& left, const LogicalType& right,
+    LogicalType& result) {
+    LogicalType childType;
+    if (!LogicalTypeUtils::tryGetMaxLogicalType(ListType::getChildType(left),
+            ListType::getChildType(right), childType)) {
+        return false;
+    }
+    result = LogicalType::LIST(std::move(childType));
+    return true;
+}
+
+static bool tryCombineArrayTypes(const LogicalType& left, const LogicalType& right,
+    LogicalType& result) {
+    if (ArrayType::getNumElements(left) != ArrayType::getNumElements(right)) {
+        return tryCombineListTypes(left, right, result);
+    }
+    LogicalType childType;
+    if (!LogicalTypeUtils::tryGetMaxLogicalType(ArrayType::getChildType(left),
+            ArrayType::getChildType(right), childType)) {
+        return false;
+    }
+    result = LogicalType::ARRAY(std::move(childType), ArrayType::getNumElements(left));
+    return true;
+}
+
+static bool tryCombineListArrayTypes(const LogicalType& left, const LogicalType& right,
+    LogicalType& result) {
+    LogicalType childType;
+    if (!LogicalTypeUtils::tryGetMaxLogicalType(ListType::getChildType(left),
+            ArrayType::getChildType(right), childType)) {
+        return false;
+    }
+    result = LogicalType::LIST(std::move(childType));
+    return true;
+}
+
+// If we can match child labels and combine their types, then we can combine
+// the struct
+static bool tryCombineStructTypes(const LogicalType& left, const LogicalType& right,
+    LogicalType& result) {
+    const auto& leftFields = StructType::getFields(left);
+    const auto& rightFields = StructType::getFields(right);
+    if (leftFields.size() != rightFields.size()) {
+        return false;
+    }
+    std::vector<StructField> newFields;
+    for (auto i = 0u; i < leftFields.size(); i++) {
+        if (leftFields[i].getName() != rightFields[i].getName()) {
+            return false;
+        }
+        LogicalType combinedType;
+        if (LogicalTypeUtils::tryGetMaxLogicalType(leftFields[i].getType(),
+                rightFields[i].getType(), combinedType)) {
+            newFields.push_back(StructField(leftFields[i].getName(), std::move(combinedType)));
+        } else {
+            return false;
+        }
+    }
+    result = LogicalType::STRUCT(std::move(newFields));
+    return true;
+}
+
+// If we can combine the key and value, then we cna combine the map
+static bool tryCombineMapTypes(const LogicalType& left, const LogicalType& right,
+    LogicalType& result) {
+    const auto& leftKeyType = MapType::getKeyType(left);
+    const auto& leftValueType = MapType::getValueType(left);
+    const auto& rightKeyType = MapType::getKeyType(right);
+    const auto& rightValueType = MapType::getValueType(right);
+    LogicalType resultKeyType, resultValueType;
+    if (!LogicalTypeUtils::tryGetMaxLogicalType(leftKeyType, rightKeyType, resultKeyType) ||
+        !LogicalTypeUtils::tryGetMaxLogicalType(leftValueType, rightValueType, resultValueType)) {
+        return false;
+    }
+    result = LogicalType::MAP(std::move(resultKeyType), std::move(resultValueType));
+    return true;
+}
+
+/*
+// If one of the unions labels is a subset of the other labels, and we can
+// combine corresponding labels, then we can combine the union
+static bool tryCombineUnionTypes(const LogicalType& left, const LogicalType& right,
+    LogicalType& result) {
+    auto leftFields = StructType::getFields(left), rightFields = StructType::getFields(right);
+    if (leftFields.size() > rightFields.size()) {
+        std::swap(leftFields, rightFields);
+    }
+    std::vector<StructField> newFields;
+    for (auto i = 1u, j = 1u; i < leftFields.size(); i++) {
+        while (j < rightFields.size() && leftFields[i].getName() != rightFields[j].getName()) {
+            j++;
+        }
+        if (j == rightFields.size()) {
+            return false;
+        }
+        LogicalType combinedType;
+        if (!LogicalTypeUtils::tryGetMaxLogicalType(leftFields[i].getType(),
+                rightFields[j].getType(), combinedType)) {
+            newFields.push_back(
+                StructField(leftFields[i].getName(), LogicalType(combinedType)));
+        }
+    }
+    result = LogicalType::UNION(std::move(newFields));
+    return true;
+}
+*/
+
+static LogicalTypeID joinToWiderType(const LogicalTypeID& left, const LogicalTypeID& right) {
+    KU_ASSERT(LogicalTypeUtils::isIntegral(left));
+    KU_ASSERT(LogicalTypeUtils::isIntegral(right));
+    if (PhysicalTypeUtils::getFixedTypeSize(LogicalType::getPhysicalType(left)) >
+        PhysicalTypeUtils::getFixedTypeSize(LogicalType::getPhysicalType(right))) {
+        return left;
+    } else {
+        return right;
+    }
+}
+
+static bool tryUnsignedToSigned(const LogicalTypeID& input, LogicalTypeID& result) {
+    switch (input) {
+    case LogicalTypeID::UINT8:
+        result = LogicalTypeID::INT16;
+        break;
+    case LogicalTypeID::UINT16:
+        result = LogicalTypeID::INT32;
+        break;
+    case LogicalTypeID::UINT32:
+        result = LogicalTypeID::INT64;
+        break;
+    case LogicalTypeID::UINT64:
+        result = LogicalTypeID::INT128;
+        break;
+    default:
+        return false;
+    }
+    return true;
+}
+
+static LogicalTypeID joinDifferentSignIntegrals(const LogicalTypeID& signedType,
+    const LogicalTypeID& unsignedType) {
+    auto unsignedToSigned = LogicalTypeID::ANY;
+    if (!tryUnsignedToSigned(unsignedType, unsignedToSigned)) {
+        return LogicalTypeID::DOUBLE;
+    } else {
+        return joinToWiderType(signedType, unsignedToSigned);
+    }
+}
+
+static uint32_t internalTimeOrder(const LogicalTypeID& type) {
+    switch (type) {
+    case LogicalTypeID::DATE:
+        return 50;
+    case LogicalTypeID::TIMESTAMP_SEC:
+        return 51;
+    case LogicalTypeID::TIMESTAMP_MS:
+        return 52;
+    case LogicalTypeID::TIMESTAMP:
+        return 53;
+    case LogicalTypeID::TIMESTAMP_TZ:
+        return 54;
+    case LogicalTypeID::TIMESTAMP_NS:
+        return 55;
+    default:
+        return 0; // return 0 if not timestamp
+    }
+}
+
+static int alwaysCastOrder(const LogicalTypeID& typeID) {
+    switch (typeID) {
+    case LogicalTypeID::ANY:
+        return 0;
+    case LogicalTypeID::STRING:
+        return 2;
+    default:
+        return -1;
+    }
+}
+
+static bool canAlwaysCast(const LogicalTypeID& typeID) {
+    switch (typeID) {
+    case LogicalTypeID::ANY:
+    case LogicalTypeID::STRING:
+        return true;
+    default:
+        return false;
+    }
+}
+
+bool LogicalTypeUtils::tryGetMaxLogicalTypeID(const LogicalTypeID& left, const LogicalTypeID& right,
+    LogicalTypeID& result) {
+    if (canAlwaysCast(left) && canAlwaysCast(right)) {
+        if (alwaysCastOrder(left) > alwaysCastOrder(right)) {
+            result = left;
+        } else {
+            result = right;
+        }
+        return true;
+    }
+    if (left == right || canAlwaysCast(left)) {
+        result = right;
+        return true;
+    }
+    if (canAlwaysCast(right)) {
+        result = left;
+        return true;
+    }
+    auto leftToRight = BuiltInFunctionsUtils::getCastCost(left, right);
+    auto rightToLeft = BuiltInFunctionsUtils::getCastCost(right, left);
+    if (leftToRight != UNDEFINED_CAST_COST || rightToLeft != UNDEFINED_CAST_COST) {
+        if (leftToRight < rightToLeft) {
+            result = right;
+        } else {
+            result = left;
+        }
+        return true;
+    }
+    if (isIntegral(left) && isIntegral(right)) {
+        if (isUnsigned(left) && !isUnsigned(right)) {
+            result = joinDifferentSignIntegrals(right, left);
+            return true;
+        } else if (isUnsigned(right) && !isUnsigned(left)) {
+            result = joinDifferentSignIntegrals(left, right);
+            return true;
+        }
+    }
+
+    // check timestamp combination
+    // note: this will become obsolete if implicit casting
+    // between timestamps is allowed
+    auto leftOrder = internalTimeOrder(left);
+    auto rightOrder = internalTimeOrder(right);
+    if (leftOrder && rightOrder) {
+        if (leftOrder > rightOrder) {
+            result = left;
+        } else {
+            result = right;
+        }
+        return true;
+    }
+
+    return false;
+}
+
+static inline bool isSemanticallyNested(LogicalTypeID ID) {
+    return LogicalTypeUtils::isNested(ID);
+}
+
+static inline bool tryCombineDecimalTypes(const LogicalType& left, const LogicalType& right,
+    LogicalType& result) {
+    auto precisionLeft = DecimalType::getPrecision(left);
+    auto scaleLeft = DecimalType::getScale(left);
+    auto precisionRight = DecimalType::getPrecision(right);
+    auto scaleRight = DecimalType::getScale(right);
+    auto resultingScale = std::max(scaleLeft, scaleRight);
+    auto resultingPrecision =
+        std::max(precisionLeft - scaleLeft, precisionRight - scaleRight) + resultingScale;
+    if (resultingPrecision > DECIMAL_PRECISION_LIMIT) {
+        result = LogicalType::DOUBLE();
+        return true;
+    }
+    result = LogicalType::DECIMAL(resultingPrecision, resultingScale);
+    return true;
+}
+
+static inline bool tryCombineDecimalWithNumeric(const LogicalType& dec, const LogicalType& nonDec,
+    LogicalType& result) {
+    auto precision = DecimalType::getPrecision(dec);
+    auto scale = DecimalType::getScale(dec);
+    uint32_t requiredDigits = 0;
+    // How many digits before the decimal point does result require?
+    switch (nonDec.getLogicalTypeID()) {
+    case LogicalTypeID::INT8:
+        requiredDigits = function::NumericLimits<int8_t>::maxNumDigits();
+        break;
+    case LogicalTypeID::UINT8:
+        requiredDigits = function::NumericLimits<uint8_t>::maxNumDigits();
+        break;
+    case LogicalTypeID::INT16:
+        requiredDigits = function::NumericLimits<int16_t>::maxNumDigits();
+        break;
+    case LogicalTypeID::UINT16:
+        requiredDigits = function::NumericLimits<uint16_t>::maxNumDigits();
+        break;
+    case LogicalTypeID::INT32:
+        requiredDigits = function::NumericLimits<int32_t>::maxNumDigits();
+        break;
+    case LogicalTypeID::UINT32:
+        requiredDigits = function::NumericLimits<uint32_t>::maxNumDigits();
+        break;
+    case LogicalTypeID::INT64:
+        requiredDigits = function::NumericLimits<int64_t>::maxNumDigits();
+        break;
+    case LogicalTypeID::UINT64:
+        requiredDigits = function::NumericLimits<uint64_t>::maxNumDigits();
+        break;
+    case LogicalTypeID::INT128:
+        requiredDigits = function::NumericLimits<int128_t>::maxNumDigits();
+        break;
+    case LogicalTypeID::UINT128:
+        requiredDigits = function::NumericLimits<uint128_t>::maxNumDigits();
+        break;
+    default:
+        requiredDigits = DECIMAL_PRECISION_LIMIT + 1;
+    }
+    if (requiredDigits + scale > DECIMAL_PRECISION_LIMIT) {
+        result = LogicalType::DOUBLE();
+        return true;
+    }
+    result = LogicalType::DECIMAL(std::max(requiredDigits + scale, precision), scale);
+    return true;
+}
+
+bool LogicalTypeUtils::tryGetMaxLogicalType(const LogicalType& left, const LogicalType& right,
+    LogicalType& result) {
+    if (canAlwaysCast(left.typeID) && canAlwaysCast(right.typeID)) {
+        if (alwaysCastOrder(left.typeID) > alwaysCastOrder(right.typeID)) {
+            result = left.copy();
+        } else {
+            result = right.copy();
+        }
+        return true;
+    }
+    if (left == right || canAlwaysCast(left.typeID)) {
+        result = right.copy();
+        return true;
+    }
+    if (canAlwaysCast(right.typeID)) {
+        result = left.copy();
+        return true;
+    }
+    if (left.typeID == LogicalTypeID::DECIMAL && right.typeID == LogicalTypeID::DECIMAL) {
+        return tryCombineDecimalTypes(left, right, result);
+    }
+    if (left.typeID == LogicalTypeID::DECIMAL && LogicalTypeUtils::isNumerical(right.typeID)) {
+        return tryCombineDecimalWithNumeric(left, right, result);
+    }
+    if (right.typeID == LogicalTypeID::DECIMAL && LogicalTypeUtils::isNumerical(left.typeID)) {
+        return tryCombineDecimalWithNumeric(right, left, result);
+    }
+    if (isSemanticallyNested(left.typeID) || isSemanticallyNested(right.typeID)) {
+        if (left.typeID == LogicalTypeID::LIST && right.typeID == LogicalTypeID::ARRAY) {
+            return tryCombineListArrayTypes(left, right, result);
+        }
+        if (left.typeID == LogicalTypeID::ARRAY && right.typeID == LogicalTypeID::LIST) {
+            return tryCombineListArrayTypes(right, left, result);
+        }
+        if (left.typeID != right.typeID) {
+            return false;
+        }
+        switch (left.typeID) {
+        case LogicalTypeID::LIST:
+            return tryCombineListTypes(left, right, result);
+        case LogicalTypeID::ARRAY:
+            return tryCombineArrayTypes(left, right, result);
+        case LogicalTypeID::STRUCT:
+            return tryCombineStructTypes(left, right, result);
+        case LogicalTypeID::MAP:
+            return tryCombineMapTypes(left, right, result);
+        // LCOV_EXCL_START
+        case LogicalTypeID::UNION:
+            throw ConversionException("Union casting is not supported");
+            // return tryCombineUnionTypes(left, right, result);
+        default:
+            throw RuntimeException(stringFormat("Casting between {} and {} is not implemented.",
+                left.toString(), right.toString()));
+            // LCOV_EXCL_END
+        }
+    }
+    auto resultID = LogicalTypeID::ANY;
+    if (!tryGetMaxLogicalTypeID(left.typeID, right.typeID, resultID)) {
+        return false;
+    }
+    // attempt to make complete types first
+    if (resultID == left.typeID) {
+        result = left.copy();
+    } else if (resultID == right.typeID) {
+        result = right.copy();
+    } else {
+        result = LogicalType(resultID);
+    }
+    return true;
+}
+
+bool LogicalTypeUtils::tryGetMaxLogicalType(const std::vector<LogicalType>& types,
+    LogicalType& result) {
+    LogicalType combinedType(LogicalTypeID::ANY);
+    for (auto& type : types) {
+        if (!tryGetMaxLogicalType(combinedType, type, combinedType)) {
+            return false;
+        }
+    }
+    result = combinedType.copy();
+    return true;
+}
+
+LogicalType LogicalTypeUtils::combineTypes(const LogicalType& lft,
+    const LogicalType& rit) { // always succeeds
+    if (lft.getLogicalTypeID() == LogicalTypeID::STRING ||
+        rit.getLogicalTypeID() == LogicalTypeID::STRING) {
+        return LogicalType::STRING();
+    }
+    if (isSemanticallyNested(lft.getLogicalTypeID()) &&
+        isSemanticallyNested(rit.getLogicalTypeID())) {}
+    if (lft.getLogicalTypeID() == rit.getLogicalTypeID() &&
+        lft.getLogicalTypeID() == LogicalTypeID::STRUCT) {
+        std::vector<StructField> resultingFields;
+        for (const auto& i : StructType::getFields(lft)) {
+            auto name = i.getName();
+            if (StructType::hasField(rit, name)) {
+                resultingFields.emplace_back(name,
+                    combineTypes(i.getType(), StructType::getFieldType(rit, name)));
+            } else {
+                resultingFields.push_back(i.copy());
+            }
+        }
+        for (const auto& i : StructType::getFields(rit)) {
+            auto name = i.getName();
+            if (!StructType::hasField(lft, name)) {
+                resultingFields.push_back(i.copy());
+            }
+        }
+        return LogicalType::STRUCT(std::move(resultingFields));
+    }
+    if (lft.getLogicalTypeID() == rit.getLogicalTypeID() &&
+        lft.getLogicalTypeID() == LogicalTypeID::LIST) {
+        const auto& lftChild = ListType::getChildType(lft);
+        const auto& ritChild = ListType::getChildType(rit);
+        return LogicalType::LIST(combineTypes(lftChild, ritChild));
+    }
+    if (lft.getLogicalTypeID() == rit.getLogicalTypeID() &&
+        lft.getLogicalTypeID() == LogicalTypeID::MAP) {
+        const auto& lftKey = MapType::getKeyType(lft);
+        const auto& lftValue = MapType::getValueType(lft);
+        const auto& ritKey = MapType::getKeyType(rit);
+        const auto& ritValue = MapType::getValueType(rit);
+        return LogicalType::MAP(combineTypes(lftKey, ritKey), combineTypes(lftValue, ritValue));
+    }
+    common::LogicalType result;
+    if (!tryGetMaxLogicalType(lft, rit, result)) {
+        return LogicalType::STRING();
+    }
+    return result;
+}
+
+LogicalType LogicalTypeUtils::combineTypes(const std::vector<LogicalType>& types) {
+    if (types.empty()) {
+        // LCOV_EXCL_START
+        throw RuntimeException(
+            stringFormat("Trying to combine empty types. This should never happen."));
+        // LCOV_EXCL_STOP
+    }
+    if (types.size() == 1) {
+        return types[0].copy();
+    }
+    auto result = combineTypes(types[0], types[1]);
+    for (auto i = 2u; i < types.size(); i++) {
+        result = combineTypes(result, types[i]);
+    }
+    return result;
+}
+
+LogicalType LogicalTypeUtils::purgeAny(const LogicalType& type, const LogicalType& replacement) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::ANY:
+        return replacement.copy();
+    case LogicalTypeID::LIST:
+        return LogicalType::LIST(purgeAny(ListType::getChildType(type), replacement));
+    case LogicalTypeID::ARRAY:
+        return LogicalType::ARRAY(purgeAny(ArrayType::getChildType(type), replacement),
+            ArrayType::getNumElements(type));
+    case LogicalTypeID::MAP:
+        return LogicalType::MAP(purgeAny(MapType::getKeyType(type), replacement),
+            purgeAny(MapType::getValueType(type), replacement));
+    case LogicalTypeID::STRUCT: {
+        std::vector<StructField> fields;
+        for (const auto& i : StructType::getFields(type)) {
+            fields.emplace_back(i.getName(), purgeAny(i.getType(), replacement));
+        }
+        return LogicalType::STRUCT(std::move(fields));
+    }
+    default:
+        return type.copy();
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/uint128_t.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/uint128_t.cpp
new file mode 100644
index 0000000000..f70b081812
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/uint128_t.cpp
@@ -0,0 +1,673 @@
+#include "common/types/uint128_t.h"
+
+#include <cmath>
+
+#include "common/exception/runtime.h"
+#include "common/type_utils.h"
+#include "common/types/int128_t.h"
+#include "function/cast/functions/numeric_limits.h"
+#include "function/hash/hash_functions.h"
+#include <bit>
+
+namespace lbug::common {
+
+static uint8_t uint128BitsAmount(uint128_t input) {
+    if (input.high) {
+        return 128 - std::countl_zero(input.high);
+    } else {
+        return 64 - std::countl_zero(input.low);
+    }
+}
+
+static bool uint128IsBitSet(uint128_t input, uint8_t bit) {
+    if (bit < 64) {
+        return input.low & (1ULL << uint64_t(bit));
+    } else {
+        return input.high & (1ULL << uint64_t(bit - 64));
+    }
+}
+
+uint128_t uint128LeftShift(uint128_t lhs, uint32_t amount) {
+    uint128_t result{};
+    result.low = lhs.low << amount;
+    result.high = (lhs.high << amount) + (lhs.low >> (64 - amount));
+    return result;
+}
+
+uint128_t UInt128_t::divModPositive(uint128_t lhs, uint64_t rhs, uint64_t& remainder) {
+    uint128_t result{0};
+    remainder = 0;
+
+    for (uint8_t i = uint128BitsAmount(lhs); i > 0; i--) {
+        result = uint128LeftShift(result, 1);
+        remainder <<= 1;
+        if (uint128IsBitSet(lhs, i - 1)) {
+            remainder++;
+        }
+        if (remainder >= rhs) {
+            remainder -= rhs;
+            result.low++;
+            if (result.low == 0) {
+                result.high++;
+            }
+        }
+    }
+    return result;
+}
+
+std::string UInt128_t::toString(uint128_t input) {
+    std::string result;
+    uint64_t remainder = 0;
+
+    while (input.high != 0 || input.low != 0) {
+        input = divModPositive(input, 10, remainder);
+        result = std::string(1, '0' + remainder) + std::move(result);
+    }
+
+    if (result.empty()) {
+        result = "0";
+    }
+
+    return result;
+}
+
+bool UInt128_t::addInPlace(uint128_t& lhs, uint128_t rhs) {
+    int overflow = lhs.low + rhs.low < lhs.low;
+    if (lhs.high > UINT64_MAX - rhs.high - overflow ||
+        (rhs.high == UINT64_MAX &&
+            lhs.high + overflow != 0)) { // need second condition in case the unsigned (UINT64_MAX -
+                                         // rhs.high - overflow) evaluates to -1
+        return false;
+    }
+    lhs.high = lhs.high + rhs.high + overflow;
+    lhs.low += rhs.low;
+    return true;
+}
+
+bool UInt128_t::subInPlace(uint128_t& lhs, uint128_t rhs) {
+    // check if lhs > rhs; if so return false
+    if (UInt128_t::lessThan(lhs, rhs)) {
+        return false;
+    }
+    int underflow = lhs.low - rhs.low > lhs.low;
+    lhs.high = lhs.high - rhs.high - underflow;
+    lhs.low -= rhs.low;
+    return true;
+}
+
+uint128_t UInt128_t::Add(uint128_t lhs, const uint128_t rhs) {
+    if (!addInPlace(lhs, rhs)) {
+        throw common::OverflowException("UINT128 is out of range: cannot add.");
+    }
+    return lhs;
+}
+
+uint128_t UInt128_t::Sub(uint128_t lhs, const uint128_t rhs) {
+    if (!subInPlace(lhs, rhs)) {
+        throw common::OverflowException("UINT128 is out of range: cannot subtract.");
+    }
+    return lhs;
+}
+
+bool UInt128_t::tryMultiply(uint128_t lhs, uint128_t rhs, uint128_t& result) {
+#if ((__GNUC__ >= 5) || defined(__clang__)) && defined(__SIZEOF_INT128__)
+    __uint128_t left = __uint128_t(lhs.low) + (__uint128_t(lhs.high) << 64);
+    __uint128_t right = __uint128_t(rhs.low) + (__uint128_t(rhs.high) << 64);
+    __uint128_t result_ui128 = 0;
+    if (__builtin_mul_overflow(left, right, &result_ui128)) {
+        return false;
+    }
+    result.high = uint64_t(result_ui128 >> 64);
+    result.low = uint64_t(result_ui128 & 0xffffffffffffffff);
+#else
+    // Multiply code adapted from:
+    // https://github.com/calccrypto/uint128_t/blob/master/uint128_t.cpp
+    // License: https://github.com/calccrypto/uint128_t/blob/c%2B%2B11_14/LICENSE
+    uint64_t top[4] = {uint64_t(lhs.high) >> 32, uint64_t(lhs.high) & 0xffffffff, lhs.low >> 32,
+        lhs.low & 0xffffffff};
+    uint64_t bottom[4] = {uint64_t(rhs.high) >> 32, uint64_t(rhs.high) & 0xffffffff, rhs.low >> 32,
+        rhs.low & 0xffffffff};
+    uint64_t products[4][4];
+
+    // multiply each component of the values
+    for (auto x = 0; x < 4; x++) {
+        for (auto y = 0; y < 4; y++) {
+            products[x][y] = top[x] * bottom[y];
+        }
+    }
+
+    // if any of these products are set to a non-zero value, there is always an overflow
+    if (products[0][0] || products[0][1] || products[0][2] || products[1][0] || products[2][0] ||
+        products[1][1]) {
+        return false;
+    }
+    // if the high bits of any of these are set, there is always an overflow
+    if ((products[0][3] & 0xffffffff00000000) || (products[1][2] & 0xffffffff00000000) ||
+        (products[2][1] & 0xffffffff00000000) || (products[3][0] & 0xffffffff00000000)) {
+        return false;
+    }
+
+    // otherwise we merge the result of the different products together in-order
+
+    // first row
+    uint64_t fourth32 = (products[3][3] & 0xffffffff);
+    uint64_t third32 = (products[3][2] & 0xffffffff) + (products[3][3] >> 32);
+    uint64_t second32 = (products[3][1] & 0xffffffff) + (products[3][2] >> 32);
+    uint64_t first32 = (products[3][0] & 0xffffffff) + (products[3][1] >> 32);
+
+    // second row
+    third32 += (products[2][3] & 0xffffffff);
+    second32 += (products[2][2] & 0xffffffff) + (products[2][3] >> 32);
+    first32 += (products[2][1] & 0xffffffff) + (products[2][2] >> 32);
+
+    // third row
+    second32 += (products[1][3] & 0xffffffff);
+    first32 += (products[1][2] & 0xffffffff) + (products[1][3] >> 32);
+
+    // fourth row
+    first32 += (products[0][3] & 0xffffffff);
+
+    // move carry to next digit
+    third32 += fourth32 >> 32;
+    second32 += third32 >> 32;
+    first32 += second32 >> 32;
+
+    // check if the combination of the different products resulted in an overflow
+    if (first32 & 0xffffff00000000) {
+        return false;
+    }
+
+    // remove carry from current digit
+    fourth32 &= 0xffffffff;
+    third32 &= 0xffffffff;
+    second32 &= 0xffffffff;
+    first32 &= 0xffffffff;
+
+    // combine components
+    result.low = (third32 << 32) | fourth32;
+    result.high = (first32 << 32) | second32;
+#endif
+    return true;
+}
+
+uint128_t UInt128_t::Mul(uint128_t lhs, uint128_t rhs) {
+    uint128_t result{};
+    if (!tryMultiply(lhs, rhs, result)) {
+        throw common::OverflowException("UINT128 is out of range: cannot multiply.");
+    }
+    return result;
+}
+
+uint128_t UInt128_t::divMod(uint128_t lhs, uint128_t rhs, uint128_t& remainder) {
+    // divMod code adapted from:
+    // https://github.com/calccrypto/uint128_t/blob/master/uint128_t.cpp
+    // License: https://github.com/calccrypto/uint128_t/blob/c%2B%2B11_14/LICENSE
+    // initialize the result and remainder to 0
+    uint128_t div_result{0};
+    remainder.low = 0;
+    remainder.high = 0;
+
+    // now iterate over the amount of bits that are set in the LHS
+    for (uint8_t x = uint128BitsAmount(lhs); x > 0; x--) {
+        // left-shift the current result and remainder by 1
+        div_result = uint128LeftShift(div_result, 1);
+        remainder = uint128LeftShift(remainder, 1);
+
+        // we get the value of the bit at position X, where position 0 is the least-significant bit
+        if (uint128IsBitSet(lhs, x - 1)) {
+            // increment the remainder
+            addInPlace(remainder, 1);
+        }
+        if (greaterThanOrEquals(remainder, rhs)) {
+            // the remainder has passed the division multiplier: add one to the divide result
+            remainder = Sub(remainder, rhs);
+            addInPlace(div_result, 1);
+        }
+    }
+    return div_result;
+}
+
+uint128_t UInt128_t::Div(uint128_t lhs, uint128_t rhs) {
+    if (rhs.high == 0 && rhs.low == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    uint128_t remainder{};
+    return divMod(lhs, rhs, remainder);
+}
+
+uint128_t UInt128_t::Mod(uint128_t lhs, uint128_t rhs) {
+    if (rhs.high == 0 && rhs.low == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    uint128_t result{};
+    divMod(lhs, rhs, result);
+    return result;
+}
+
+uint128_t UInt128_t::Xor(uint128_t lhs, uint128_t rhs) {
+    uint128_t result{lhs.low ^ rhs.low, lhs.high ^ rhs.high};
+    return result;
+}
+
+uint128_t UInt128_t::BinaryAnd(uint128_t lhs, uint128_t rhs) {
+    uint128_t result{lhs.low & rhs.low, lhs.high & rhs.high};
+    return result;
+}
+
+uint128_t UInt128_t::BinaryOr(uint128_t lhs, uint128_t rhs) {
+    uint128_t result{lhs.low | rhs.low, lhs.high | rhs.high};
+    return result;
+}
+
+uint128_t UInt128_t::BinaryNot(uint128_t val) {
+    return uint128_t{~val.low, ~val.high};
+}
+
+uint128_t UInt128_t::LeftShift(uint128_t lhs, int amount) {
+    return amount >= 64 ?
+               uint128_t(0, lhs.low << (amount - 64)) :
+           amount == 0 ?
+               lhs :
+               uint128_t{lhs.low << amount, (lhs.high << amount) | (lhs.low >> (64 - amount))};
+}
+
+uint128_t UInt128_t::RightShift(uint128_t lhs, int amount) {
+    return amount >= 64 ?
+               uint128_t(lhs.high >> (amount - 64), 0) :
+           amount == 0 ?
+               lhs :
+               uint128_t((lhs.low >> amount) | (lhs.high << (64 - amount)), lhs.high >> amount);
+}
+
+//===============================================================================================
+// Cast operation
+//===============================================================================================
+template<class DST, bool SIGNED = true>
+bool TryCastUint128Template(uint128_t input, DST& result) {
+    if (input.high == 0 && input.low <= uint64_t(function::NumericLimits<DST>::maximum())) {
+        result = static_cast<DST>(input.low);
+        return true;
+    }
+    return false;
+}
+// we can use the above template if we can get max using something like DST.max
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, int8_t& result) {
+    return TryCastUint128Template<int8_t>(input, result);
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, int16_t& result) {
+    return TryCastUint128Template<int16_t>(input, result);
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, int32_t& result) {
+    return TryCastUint128Template<int32_t>(input, result);
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, int64_t& result) {
+    return TryCastUint128Template<int64_t>(input, result);
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, uint8_t& result) {
+    return TryCastUint128Template<uint8_t, false>(input, result);
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, uint16_t& result) {
+    return TryCastUint128Template<uint16_t, false>(input, result);
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, uint32_t& result) {
+    return TryCastUint128Template<uint32_t, false>(input, result);
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, uint64_t& result) {
+    return TryCastUint128Template<uint64_t, false>(input, result);
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, int128_t& result) { // unsigned to signed
+    if (input.high > (uint64_t)(function::NumericLimits<int64_t>::maximum())) {
+        return false;
+    }
+    result = {input.low, int64_t(input.high)};
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, float& result) {
+    double temp_res = NAN;
+    tryCast(input, temp_res);
+    result = static_cast<float>(temp_res);
+    return true;
+}
+
+template<class REAL_T>
+bool CastUint128ToFloating(uint128_t input, REAL_T& result) {
+    result = REAL_T(input.high) * REAL_T(function::NumericLimits<uint64_t>::maximum()) +
+             REAL_T(input.low);
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, double& result) {
+    return CastUint128ToFloating<double>(input, result);
+}
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, long double& result) {
+    return CastUint128ToFloating<long double>(input, result);
+}
+
+template<class SRC>
+uint128_t tryCastToTemplate(SRC value) {
+    if (value < 0) {
+        throw common::OverflowException("Cannot cast negative value to UINT128.");
+    }
+    uint128_t result{};
+    result.low = (uint64_t)value;
+    result.high = 0;
+    return result;
+}
+
+template<>
+bool UInt128_t::tryCastTo(int8_t value, uint128_t& result) {
+    result = tryCastToTemplate<int8_t>(value);
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(int16_t value, uint128_t& result) {
+    result = tryCastToTemplate<int16_t>(value);
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(int32_t value, uint128_t& result) {
+    result = tryCastToTemplate<int32_t>(value);
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(int64_t value, uint128_t& result) {
+    result = tryCastToTemplate<int64_t>(value);
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(uint8_t value, uint128_t& result) {
+    result = tryCastToTemplate<uint8_t>(value);
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(uint16_t value, uint128_t& result) {
+    result = tryCastToTemplate<uint16_t>(value);
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(uint32_t value, uint128_t& result) {
+    result = tryCastToTemplate<uint32_t>(value);
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(uint64_t value, uint128_t& result) {
+    result = tryCastToTemplate<uint64_t>(value);
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(uint128_t value, uint128_t& result) {
+    result = value;
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(float value, uint128_t& result) {
+    return tryCastTo(double(value), result);
+}
+
+template<class REAL_T>
+bool castFloatingToUint128(REAL_T value, uint128_t& result) {
+    if (value < 0.0 || value >= 340282366920938463463374607431768211455.0) {
+        return false;
+    }
+    value = std::nearbyint(value);
+    result.low = (uint64_t)fmod(value, REAL_T(function::NumericLimits<uint64_t>::maximum()));
+    result.high = (uint64_t)(value / REAL_T(function::NumericLimits<uint64_t>::maximum()));
+    return true;
+}
+
+template<>
+bool UInt128_t::tryCastTo(double value, uint128_t& result) {
+    return castFloatingToUint128<double>(value, result);
+}
+
+template<>
+bool UInt128_t::tryCastTo(long double value, uint128_t& result) {
+    return castFloatingToUint128<long double>(value, result);
+}
+//===============================================================================================
+
+template<NumericTypes T>
+void constructUInt128Template(T value, uint128_t& result) {
+    uint128_t casted = UInt128_t::castTo(value);
+    result.low = casted.low;
+    result.high = casted.high;
+}
+
+uint128_t::uint128_t(int64_t value) {
+    auto result = UInt128_t::castTo(value);
+    this->low = result.low;
+    this->high = result.high;
+}
+
+uint128_t::uint128_t(int32_t value) { // NOLINT: fields are constructed by the template
+    constructUInt128Template(value, *this);
+}
+
+uint128_t::uint128_t(int16_t value) { // NOLINT: fields are constructed by the template
+    constructUInt128Template(value, *this);
+}
+
+uint128_t::uint128_t(int8_t value) { // NOLINT: fields are constructed by the template
+    constructUInt128Template(value, *this);
+}
+
+uint128_t::uint128_t(uint64_t value) { // NOLINT: fields are constructed by the template
+    constructUInt128Template(value, *this);
+}
+
+uint128_t::uint128_t(uint32_t value) { // NOLINT: fields are constructed by the template
+    constructUInt128Template(value, *this);
+}
+
+uint128_t::uint128_t(uint16_t value) { // NOLINT: fields are constructed by the template
+    constructUInt128Template(value, *this);
+}
+
+uint128_t::uint128_t(uint8_t value) { // NOLINT: fields are constructed by the template
+    constructUInt128Template(value, *this);
+}
+
+uint128_t::uint128_t(double value) { // NOLINT: fields are constructed by the template
+    constructUInt128Template(value, *this);
+}
+
+uint128_t::uint128_t(float value) { // NOLINT: fields are constructed by the template
+    constructUInt128Template(value, *this);
+}
+
+//============================================================================================
+bool operator==(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::equals(lhs, rhs);
+}
+
+bool operator!=(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::notEquals(lhs, rhs);
+}
+
+bool operator>(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::greaterThan(lhs, rhs);
+}
+
+bool operator>=(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::greaterThanOrEquals(lhs, rhs);
+}
+
+bool operator<(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::lessThan(lhs, rhs);
+}
+
+bool operator<=(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::lessThanOrEquals(lhs, rhs);
+}
+
+uint128_t uint128_t::operator-() const {
+    return UInt128_t::negate(*this);
+}
+
+// support for operations like (int32_t)x + (uint128_t)y
+
+uint128_t operator+(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::Add(lhs, rhs);
+}
+uint128_t operator-(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::Sub(lhs, rhs);
+}
+uint128_t operator*(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::Mul(lhs, rhs);
+}
+uint128_t operator/(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::Div(lhs, rhs);
+}
+uint128_t operator%(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::Mod(lhs, rhs);
+}
+
+uint128_t operator^(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::Xor(lhs, rhs);
+}
+
+uint128_t operator&(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::BinaryAnd(lhs, rhs);
+}
+
+uint128_t operator|(const uint128_t& lhs, const uint128_t& rhs) {
+    return UInt128_t::BinaryOr(lhs, rhs);
+}
+
+uint128_t operator~(const uint128_t& val) {
+    return UInt128_t::BinaryNot(val);
+}
+
+uint128_t operator<<(const uint128_t& lhs, int amount) {
+    return UInt128_t::LeftShift(lhs, amount);
+}
+
+uint128_t operator>>(const uint128_t& lhs, int amount) {
+    return UInt128_t::RightShift(lhs, amount);
+}
+
+// inplace arithmetic operators
+uint128_t& uint128_t::operator+=(const uint128_t& rhs) {
+    if (!UInt128_t::addInPlace(*this, rhs)) {
+        throw common::OverflowException("UINT128 is out of range: cannot add in place.");
+    }
+    return *this;
+}
+
+uint128_t& uint128_t::operator*=(const uint128_t& rhs) {
+    *this = UInt128_t::Mul(*this, rhs);
+    return *this;
+}
+
+uint128_t& uint128_t::operator|=(const uint128_t& rhs) {
+    *this = UInt128_t::BinaryOr(*this, rhs);
+    return *this;
+}
+
+uint128_t& uint128_t::operator&=(const uint128_t& rhs) {
+    *this = UInt128_t::BinaryAnd(*this, rhs);
+    return *this;
+}
+
+template<class T>
+static T NarrowCast(const uint128_t& input) {
+    return static_cast<T>(input.low);
+}
+
+uint128_t::operator int64_t() const {
+    return NarrowCast<int64_t>(*this);
+}
+
+uint128_t::operator int32_t() const {
+    return NarrowCast<int32_t>(*this);
+}
+
+uint128_t::operator int16_t() const {
+    return NarrowCast<int16_t>(*this);
+}
+
+uint128_t::operator int8_t() const {
+    return NarrowCast<int8_t>(*this);
+}
+
+uint128_t::operator uint64_t() const {
+    return NarrowCast<uint64_t>(*this);
+}
+
+uint128_t::operator uint32_t() const {
+    return NarrowCast<uint32_t>(*this);
+}
+
+uint128_t::operator uint16_t() const {
+    return NarrowCast<uint16_t>(*this);
+}
+
+uint128_t::operator uint8_t() const {
+    return NarrowCast<uint8_t>(*this);
+}
+
+uint128_t::operator double() const {
+    double result = NAN;
+    [[maybe_unused]] bool success =
+        UInt128_t::tryCast(*this, result); // casting to double should always succeed
+    KU_ASSERT(success);
+    return result;
+}
+
+uint128_t::operator float() const {
+    float result = NAN;
+    [[maybe_unused]] bool success = UInt128_t::tryCast(*this,
+        result); // casting overly large values to float currently returns inf
+    KU_ASSERT(success);
+    return result;
+}
+
+uint128_t::operator int128_t() const {
+    int128_t result{};
+    if (!UInt128_t::tryCast(*this, result)) {
+        throw common::OverflowException(common::stringFormat("Value {} is not within INT128 range.",
+            common::TypeUtils::toString(*this)));
+    }
+    return result;
+}
+
+} // namespace lbug::common
+
+std::size_t std::hash<lbug::common::uint128_t>::operator()(
+    const lbug::common::uint128_t& v) const noexcept {
+    lbug::common::hash_t hash = 0;
+    lbug::function::Hash::operation(v, hash);
+    return hash;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/uuid.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/uuid.cpp
new file mode 100644
index 0000000000..2d3cb89833
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/uuid.cpp
@@ -0,0 +1,156 @@
+#include "common/types/uuid.h"
+
+#include "common/exception/conversion.h"
+#include "common/random_engine.h"
+#include "re2.h"
+
+namespace lbug {
+namespace common {
+
+void UUID::byteToHex(char byteVal, char* buf, uint64_t& pos) {
+    buf[pos++] = HEX_DIGITS[(byteVal >> 4) & 0xf];
+    buf[pos++] = HEX_DIGITS[byteVal & 0xf];
+}
+
+unsigned char UUID::hex2Char(char ch) {
+    if (ch >= '0' && ch <= '9') {
+        return ch - '0';
+    }
+    if (ch >= 'a' && ch <= 'f') {
+        return 10 + ch - 'a';
+    }
+    if (ch >= 'A' && ch <= 'F') {
+        return 10 + ch - 'A';
+    }
+    return 0;
+}
+
+bool UUID::isHex(char ch) {
+    return (ch >= '0' && ch <= '9') || (ch >= 'a' && ch <= 'f') || (ch >= 'A' && ch <= 'F');
+}
+
+bool UUID::fromString(std::string str, int128_t& result) {
+    if (str.empty()) {
+        return false;
+    }
+    uint32_t numBrackets = 0;
+    if (str.front() == '{') {
+        numBrackets = 1;
+    }
+    // LCOV_EXCL_START
+    if (numBrackets && str.back() != '}') {
+        return false;
+    }
+    // LCOV_EXCL_STOP
+
+    result.low = 0;
+    result.high = 0;
+    uint32_t count = 0;
+    for (auto i = numBrackets; i < str.size() - numBrackets; ++i) {
+        if (str[i] == '-') {
+            continue;
+        }
+        if (count >= 32 || !isHex(str[i])) {
+            return false;
+        }
+        if (count >= 16) {
+            result.low = (result.low << 4) | hex2Char(str[i]);
+        } else {
+            result.high = (result.high << 4) | hex2Char(str[i]);
+        }
+        count++;
+    }
+    // Flip the first bit to make `order by uuid` same as `order by uuid::varchar`
+    result.high ^= (int64_t(1) << 63);
+    return count == 32;
+}
+
+int128_t UUID::fromString(std::string str) {
+    int128_t result = 0;
+    if (!fromString(str, result)) {
+        throw ConversionException("Invalid UUID: " + str);
+    }
+    return result;
+}
+
+int128_t UUID::fromCString(const char* str, uint64_t len) {
+    return fromString(std::string(str, len));
+}
+
+void UUID::toString(int128_t input, char* buf) {
+    // Flip back before convert to string
+    int64_t high = input.high ^ (int64_t(1) << 63);
+    uint64_t pos = 0;
+    byteToHex(high >> 56 & 0xFF, buf, pos);
+    byteToHex(high >> 48 & 0xFF, buf, pos);
+    byteToHex(high >> 40 & 0xFF, buf, pos);
+    byteToHex(high >> 32 & 0xFF, buf, pos);
+    buf[pos++] = '-';
+    byteToHex(high >> 24 & 0xFF, buf, pos);
+    byteToHex(high >> 16 & 0xFF, buf, pos);
+    buf[pos++] = '-';
+    byteToHex(high >> 8 & 0xFF, buf, pos);
+    byteToHex(high & 0xFF, buf, pos);
+    buf[pos++] = '-';
+    byteToHex(input.low >> 56 & 0xFF, buf, pos);
+    byteToHex(input.low >> 48 & 0xFF, buf, pos);
+    buf[pos++] = '-';
+    byteToHex(input.low >> 40 & 0xFF, buf, pos);
+    byteToHex(input.low >> 32 & 0xFF, buf, pos);
+    byteToHex(input.low >> 24 & 0xFF, buf, pos);
+    byteToHex(input.low >> 16 & 0xFF, buf, pos);
+    byteToHex(input.low >> 8 & 0xFF, buf, pos);
+    byteToHex(input.low & 0xFF, buf, pos);
+}
+
+std::string UUID::toString(int128_t input) {
+    char buff[UUID_STRING_LENGTH];
+    toString(input, buff);
+    return std::string(buff, UUID_STRING_LENGTH);
+}
+
+std::string UUID::toString(ku_uuid_t val) {
+    return toString(val.value);
+}
+
+ku_uuid_t UUID::generateRandomUUID(RandomEngine* engine) {
+    uint8_t bytes[16];
+    for (int i = 0; i < 16; i += 4) {
+        *reinterpret_cast<uint32_t*>(bytes + i) = engine->nextRandomInteger();
+    }
+    // variant must be 10xxxxxx
+    bytes[8] &= 0xBF;
+    bytes[8] |= 0x80;
+    // version must be 0100xxxx
+    bytes[6] &= 0x4F;
+    bytes[6] |= 0x40;
+
+    int128_t result = 0;
+    result.high = 0;
+    result.high |= ((int64_t)bytes[0] << 56);
+    result.high |= ((int64_t)bytes[1] << 48);
+    result.high |= ((int64_t)bytes[2] << 40);
+    result.high |= ((int64_t)bytes[3] << 32);
+    result.high |= ((int64_t)bytes[4] << 24);
+    result.high |= ((int64_t)bytes[5] << 16);
+    result.high |= ((int64_t)bytes[6] << 8);
+    result.high |= bytes[7];
+    result.low = 0;
+    result.low |= ((uint64_t)bytes[8] << 56);
+    result.low |= ((uint64_t)bytes[9] << 48);
+    result.low |= ((uint64_t)bytes[10] << 40);
+    result.low |= ((uint64_t)bytes[11] << 32);
+    result.low |= ((uint64_t)bytes[12] << 24);
+    result.low |= ((uint64_t)bytes[13] << 16);
+    result.low |= ((uint64_t)bytes[14] << 8);
+    result.low |= bytes[15];
+    return ku_uuid_t{result};
+}
+
+const regex::RE2& UUID::regexPattern() {
+    static regex::RE2 retval("(?i)[0-9A-F]{8}-[0-9A-F]{4}-[0-9A-F]{4}-[0-9A-F]{4}-[0-9A-F]{12}");
+    return retval;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/CMakeLists.txt
new file mode 100644
index 0000000000..45101be3f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/CMakeLists.txt
@@ -0,0 +1,11 @@
+add_library(lbug_common_types_value
+        OBJECT
+        nested.cpp
+        node.cpp
+        recursive_rel.cpp
+        rel.cpp
+        value.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_types_value>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/nested.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/nested.cpp
new file mode 100644
index 0000000000..0361d43e86
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/nested.cpp
@@ -0,0 +1,21 @@
+#include "common/types/value/nested.h"
+
+#include "common/exception/runtime.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace common {
+
+uint32_t NestedVal::getChildrenSize(const Value* val) {
+    return val->childrenSize;
+}
+
+Value* NestedVal::getChildVal(const Value* val, uint32_t idx) {
+    if (idx > val->childrenSize) {
+        throw RuntimeException("NestedVal::getChildVal index out of bound.");
+    }
+    return val->children[idx].get();
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/node.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/node.cpp
new file mode 100644
index 0000000000..74105165bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/node.cpp
@@ -0,0 +1,77 @@
+#include "common/types/value/node.h"
+
+#include "common/constants.h"
+#include "common/string_format.h"
+#include "common/types/types.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace common {
+
+std::vector<std::pair<std::string, std::unique_ptr<Value>>> NodeVal::getProperties(
+    const Value* val) {
+    throwIfNotNode(val);
+    std::vector<std::pair<std::string, std::unique_ptr<Value>>> properties;
+    auto fieldNames = StructType::getFieldNames(val->dataType);
+    for (auto i = 0u; i < val->childrenSize; ++i) {
+        auto currKey = fieldNames[i];
+        if (currKey == InternalKeyword::ID || currKey == InternalKeyword::LABEL) {
+            continue;
+        }
+        properties.emplace_back(currKey, val->children[i]->copy());
+    }
+    return properties;
+}
+
+uint64_t NodeVal::getNumProperties(const Value* val) {
+    throwIfNotNode(val);
+    auto fieldNames = StructType::getFieldNames(val->dataType);
+    return fieldNames.size() - OFFSET;
+}
+
+std::string NodeVal::getPropertyName(const Value* val, uint64_t index) {
+    throwIfNotNode(val);
+    auto fieldNames = StructType::getFieldNames(val->dataType);
+    if (index >= fieldNames.size() - OFFSET) {
+        return "";
+    }
+    return fieldNames[index + OFFSET];
+}
+
+Value* NodeVal::getPropertyVal(const Value* val, uint64_t index) {
+    throwIfNotNode(val);
+    auto fieldNames = StructType::getFieldNames(val->dataType);
+    if (index >= fieldNames.size() - OFFSET) {
+        return nullptr;
+    }
+    return val->children[index + OFFSET].get();
+}
+
+Value* NodeVal::getNodeIDVal(const Value* val) {
+    throwIfNotNode(val);
+    auto fieldIdx = StructType::getFieldIdx(val->dataType, InternalKeyword::ID);
+    return val->children[fieldIdx].get();
+}
+
+Value* NodeVal::getLabelVal(const Value* val) {
+    throwIfNotNode(val);
+    auto fieldIdx = StructType::getFieldIdx(val->dataType, InternalKeyword::LABEL);
+    return val->children[fieldIdx].get();
+}
+
+std::string NodeVal::toString(const Value* val) {
+    throwIfNotNode(val);
+    return val->toString();
+}
+
+void NodeVal::throwIfNotNode(const Value* val) {
+    // LCOV_EXCL_START
+    if (val->dataType.getLogicalTypeID() != LogicalTypeID::NODE) {
+        throw Exception(
+            stringFormat("Expected NODE type, but got {} type", val->dataType.toString()));
+    }
+    // LCOV_EXCL_STOP
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/recursive_rel.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/recursive_rel.cpp
new file mode 100644
index 0000000000..aaac11567a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/recursive_rel.cpp
@@ -0,0 +1,31 @@
+#include "common/types/value/recursive_rel.h"
+
+#include "common/exception/exception.h"
+#include "common/string_format.h"
+#include "common/types/types.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace common {
+
+Value* RecursiveRelVal::getNodes(const Value* val) {
+    throwIfNotRecursiveRel(val);
+    return val->children[0].get();
+}
+
+Value* RecursiveRelVal::getRels(const Value* val) {
+    throwIfNotRecursiveRel(val);
+    return val->children[1].get();
+}
+
+void RecursiveRelVal::throwIfNotRecursiveRel(const Value* val) {
+    // LCOV_EXCL_START
+    if (val->dataType.getLogicalTypeID() != LogicalTypeID::RECURSIVE_REL) {
+        throw Exception(
+            stringFormat("Expected RECURSIVE_REL type, but got {} type", val->dataType.toString()));
+    }
+    // LCOV_EXCL_STOP
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/rel.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/rel.cpp
new file mode 100644
index 0000000000..d75c471187
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/rel.cpp
@@ -0,0 +1,86 @@
+#include "common/types/value/rel.h"
+
+#include "common/constants.h"
+#include "common/string_format.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace common {
+
+std::vector<std::pair<std::string, std::unique_ptr<Value>>> RelVal::getProperties(
+    const Value* val) {
+    throwIfNotRel(val);
+    std::vector<std::pair<std::string, std::unique_ptr<Value>>> properties;
+    auto fieldNames = StructType::getFieldNames(val->dataType);
+    for (auto i = 0u; i < val->childrenSize; ++i) {
+        auto currKey = fieldNames[i];
+        if (currKey == InternalKeyword::ID || currKey == InternalKeyword::LABEL ||
+            currKey == InternalKeyword::SRC || currKey == InternalKeyword::DST) {
+            continue;
+        }
+        auto currVal = val->children[i]->copy();
+        properties.emplace_back(currKey, std::move(currVal));
+    }
+    return properties;
+}
+
+uint64_t RelVal::getNumProperties(const Value* val) {
+    throwIfNotRel(val);
+    auto fieldNames = StructType::getFieldNames(val->dataType);
+    return fieldNames.size() - OFFSET;
+}
+
+std::string RelVal::getPropertyName(const Value* val, uint64_t index) {
+    throwIfNotRel(val);
+    auto fieldNames = StructType::getFieldNames(val->dataType);
+    if (index >= fieldNames.size() - OFFSET) {
+        return "";
+    }
+    return fieldNames[index + OFFSET];
+}
+
+Value* RelVal::getPropertyVal(const Value* val, uint64_t index) {
+    throwIfNotRel(val);
+    auto fieldNames = StructType::getFieldNames(val->dataType);
+    if (index >= fieldNames.size() - OFFSET) {
+        return nullptr;
+    }
+    return val->children[index + OFFSET].get();
+}
+
+Value* RelVal::getIDVal(const Value* val) {
+    auto fieldIdx = StructType::getFieldIdx(val->dataType, InternalKeyword::ID);
+    return val->children[fieldIdx].get();
+}
+
+Value* RelVal::getSrcNodeIDVal(const Value* val) {
+    auto fieldIdx = StructType::getFieldIdx(val->dataType, InternalKeyword::SRC);
+    return val->children[fieldIdx].get();
+}
+
+Value* RelVal::getDstNodeIDVal(const Value* val) {
+    auto fieldIdx = StructType::getFieldIdx(val->dataType, InternalKeyword::DST);
+    return val->children[fieldIdx].get();
+}
+
+Value* RelVal::getLabelVal(const Value* val) {
+    auto fieldIdx = StructType::getFieldIdx(val->dataType, InternalKeyword::LABEL);
+    return val->children[fieldIdx].get();
+}
+
+std::string RelVal::toString(const Value* val) {
+    throwIfNotRel(val);
+    return val->toString();
+}
+
+void RelVal::throwIfNotRel(const Value* val) {
+    // LCOV_EXCL_START
+    if (val->dataType.getLogicalTypeID() != LogicalTypeID::REL) {
+        throw Exception(
+            stringFormat("Expected REL type, but got {} type", val->dataType.toString()));
+    }
+    // LCOV_EXCL_STOP
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/value.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/value.cpp
new file mode 100644
index 0000000000..f9f7f9734d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/types/value/value.cpp
@@ -0,0 +1,1162 @@
+#include "common/types/value/value.h"
+
+#include <utility>
+
+#include "common/exception/binder.h"
+#include "common/null_buffer.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/type_utils.h"
+#include "common/types/blob.h"
+#include "common/types/ku_string.h"
+#include "common/types/uuid.h"
+#include "common/vector/value_vector.h"
+#include "function/hash/hash_functions.h"
+#include "storage/storage_utils.h"
+
+namespace lbug {
+namespace common {
+
+bool Value::operator==(const Value& rhs) const {
+    if (dataType != rhs.dataType || isNull_ != rhs.isNull_) {
+        return false;
+    }
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL:
+        return val.booleanVal == rhs.val.booleanVal;
+    case PhysicalTypeID::INT128:
+        return val.int128Val == rhs.val.int128Val;
+    case PhysicalTypeID::INT64:
+        return val.int64Val == rhs.val.int64Val;
+    case PhysicalTypeID::INT32:
+        return val.int32Val == rhs.val.int32Val;
+    case PhysicalTypeID::INT16:
+        return val.int16Val == rhs.val.int16Val;
+    case PhysicalTypeID::INT8:
+        return val.int8Val == rhs.val.int8Val;
+    case PhysicalTypeID::UINT64:
+        return val.uint64Val == rhs.val.uint64Val;
+    case PhysicalTypeID::UINT32:
+        return val.uint32Val == rhs.val.uint32Val;
+    case PhysicalTypeID::UINT16:
+        return val.uint16Val == rhs.val.uint16Val;
+    case PhysicalTypeID::UINT8:
+        return val.uint8Val == rhs.val.uint8Val;
+    case PhysicalTypeID::DOUBLE:
+        return val.doubleVal == rhs.val.doubleVal;
+    case PhysicalTypeID::FLOAT:
+        return val.floatVal == rhs.val.floatVal;
+    case PhysicalTypeID::POINTER:
+        return val.pointer == rhs.val.pointer;
+    case PhysicalTypeID::INTERVAL:
+        return val.intervalVal == rhs.val.intervalVal;
+    case PhysicalTypeID::INTERNAL_ID:
+        return val.internalIDVal == rhs.val.internalIDVal;
+    case PhysicalTypeID::UINT128:
+        return val.uint128Val == rhs.val.uint128Val;
+    case PhysicalTypeID::STRING:
+        return strVal == rhs.strVal;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST:
+    case PhysicalTypeID::STRUCT: {
+        if (childrenSize != rhs.childrenSize) {
+            return false;
+        }
+        for (auto i = 0u; i < childrenSize; ++i) {
+            if (*children[i] != *rhs.children[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void Value::setDataType(const LogicalType& dataType_) {
+    KU_ASSERT(allowTypeChange());
+    dataType = dataType_.copy();
+}
+
+const LogicalType& Value::getDataType() const {
+    return dataType;
+}
+
+void Value::setNull(bool flag) {
+    isNull_ = flag;
+}
+
+void Value::setNull() {
+    isNull_ = true;
+}
+
+bool Value::isNull() const {
+    return isNull_;
+}
+
+std::unique_ptr<Value> Value::copy() const {
+    return std::make_unique<Value>(*this);
+}
+
+Value Value::createNullValue() {
+    return {};
+}
+
+Value Value::createNullValue(const LogicalType& dataType) {
+    return Value(dataType);
+}
+
+Value Value::createDefaultValue(const LogicalType& dataType) {
+    switch (dataType.getLogicalTypeID()) {
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64:
+        return Value((int64_t)0);
+    case LogicalTypeID::INT32:
+        return Value((int32_t)0);
+    case LogicalTypeID::INT16:
+        return Value((int16_t)0);
+    case LogicalTypeID::INT8:
+        return Value((int8_t)0);
+    case LogicalTypeID::UINT64:
+        return Value((uint64_t)0);
+    case LogicalTypeID::UINT32:
+        return Value((uint32_t)0);
+    case LogicalTypeID::UINT16:
+        return Value((uint16_t)0);
+    case LogicalTypeID::UINT8:
+        return Value((uint8_t)0);
+    case LogicalTypeID::INT128:
+        return Value(int128_t(0));
+    case LogicalTypeID::BOOL:
+        return Value(true);
+    case LogicalTypeID::DOUBLE:
+        return Value((double)0);
+    case LogicalTypeID::DATE:
+        return Value(date_t());
+    case LogicalTypeID::TIMESTAMP_NS:
+        return Value(timestamp_ns_t());
+    case LogicalTypeID::TIMESTAMP_MS:
+        return Value(timestamp_ms_t());
+    case LogicalTypeID::TIMESTAMP_SEC:
+        return Value(timestamp_sec_t());
+    case LogicalTypeID::TIMESTAMP_TZ:
+        return Value(timestamp_tz_t());
+    case LogicalTypeID::TIMESTAMP:
+        return Value(timestamp_t());
+    case LogicalTypeID::INTERVAL:
+        return Value(interval_t());
+    case LogicalTypeID::INTERNAL_ID:
+        return Value(nodeID_t());
+    case LogicalTypeID::UINT128:
+        return Value(uint128_t(0));
+    case LogicalTypeID::BLOB:
+        return Value(LogicalType::BLOB(), std::string(""));
+    case LogicalTypeID::UUID:
+        return Value(LogicalType::UUID(), std::string(""));
+    case LogicalTypeID::STRING:
+        return Value(LogicalType::STRING(), std::string(""));
+    case LogicalTypeID::FLOAT:
+        return Value((float)0);
+    case LogicalTypeID::DECIMAL: {
+        Value ret(dataType.copy());
+        ret.val.int128Val = 0;
+        ret.isNull_ = false;
+        ret.childrenSize = 0;
+        return ret;
+    }
+    case LogicalTypeID::ARRAY: {
+        std::vector<std::unique_ptr<Value>> children;
+        const auto& childType = ArrayType::getChildType(dataType);
+        auto arraySize = ArrayType::getNumElements(dataType);
+        children.reserve(arraySize);
+        for (auto i = 0u; i < arraySize; ++i) {
+            children.push_back(std::make_unique<Value>(createDefaultValue(childType)));
+        }
+        return Value(dataType.copy(), std::move(children));
+    }
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::UNION: {
+        // We can't create a default value for the union since the
+        // selected variant is runtime information. Default value
+        // is initialized when copying (see Value::copyFromUnion).
+        return Value(dataType.copy(), std::vector<std::unique_ptr<Value>>{});
+    }
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::STRUCT: {
+        std::vector<std::unique_ptr<Value>> children;
+        for (auto& field : StructType::getFields(dataType)) {
+            children.push_back(std::make_unique<Value>(createDefaultValue(field.getType())));
+        }
+        return Value(dataType.copy(), std::move(children));
+    }
+    case LogicalTypeID::ANY: {
+        return createNullValue();
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+Value::Value(bool val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::BOOL();
+    val.booleanVal = val_;
+}
+
+Value::Value(int8_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::INT8();
+    val.int8Val = val_;
+}
+
+Value::Value(int16_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::INT16();
+    val.int16Val = val_;
+}
+
+Value::Value(int32_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::INT32();
+    val.int32Val = val_;
+}
+
+Value::Value(int64_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::INT64();
+    val.int64Val = val_;
+}
+
+Value::Value(uint8_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::UINT8();
+    val.uint8Val = val_;
+}
+
+Value::Value(uint16_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::UINT16();
+    val.uint16Val = val_;
+}
+
+Value::Value(uint32_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::UINT32();
+    val.uint32Val = val_;
+}
+
+Value::Value(uint64_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::UINT64();
+    val.uint64Val = val_;
+}
+
+Value::Value(int128_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::INT128();
+    val.int128Val = val_;
+}
+
+Value::Value(ku_uuid_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::UUID();
+    val.int128Val = val_.value;
+}
+
+Value::Value(float val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::FLOAT();
+    val.floatVal = val_;
+}
+
+Value::Value(double val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::DOUBLE();
+    val.doubleVal = val_;
+}
+
+Value::Value(date_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::DATE();
+    val.int32Val = val_.days;
+}
+
+Value::Value(timestamp_ns_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::TIMESTAMP_NS();
+    val.int64Val = val_.value;
+}
+
+Value::Value(timestamp_ms_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::TIMESTAMP_MS();
+    val.int64Val = val_.value;
+}
+
+Value::Value(timestamp_sec_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::TIMESTAMP_SEC();
+    val.int64Val = val_.value;
+}
+
+Value::Value(timestamp_tz_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::TIMESTAMP_TZ();
+    val.int64Val = val_.value;
+}
+
+Value::Value(timestamp_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::TIMESTAMP();
+    val.int64Val = val_.value;
+}
+
+Value::Value(interval_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::INTERVAL();
+    val.intervalVal = val_;
+}
+
+Value::Value(internalID_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::INTERNAL_ID();
+    val.internalIDVal = val_;
+}
+
+Value::Value(uint128_t val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::UINT128();
+    val.uint128Val = val_;
+}
+
+Value::Value(const char* val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::STRING();
+    strVal = std::string(val_);
+}
+
+Value::Value(const std::string& val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::STRING();
+    strVal = val_;
+}
+
+Value::Value(uint8_t* val_) : isNull_{false}, childrenSize{0} {
+    dataType = LogicalType::POINTER();
+    val.pointer = val_;
+}
+
+Value::Value(LogicalType type, std::string val_)
+    : dataType{std::move(type)}, isNull_{false}, childrenSize{0} {
+    strVal = std::move(val_);
+}
+
+Value::Value(LogicalType dataType_, std::vector<std::unique_ptr<Value>> children)
+    : dataType{std::move(dataType_)}, isNull_{false} {
+    this->children = std::move(children);
+    childrenSize = this->children.size();
+}
+
+Value::Value(const Value& other) : isNull_{other.isNull_} {
+    dataType = other.dataType.copy();
+    copyValueFrom(other);
+    childrenSize = other.childrenSize;
+}
+
+void Value::copyFromRowLayout(const uint8_t* value) {
+    switch (dataType.getLogicalTypeID()) {
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::TIMESTAMP_NS:
+    case LogicalTypeID::TIMESTAMP_MS:
+    case LogicalTypeID::TIMESTAMP_SEC:
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::TIMESTAMP:
+    case LogicalTypeID::INT64: {
+        val.int64Val = *((int64_t*)value);
+    } break;
+    case LogicalTypeID::DATE:
+    case LogicalTypeID::INT32: {
+        val.int32Val = *((int32_t*)value);
+    } break;
+    case LogicalTypeID::INT16: {
+        val.int16Val = *((int16_t*)value);
+    } break;
+    case LogicalTypeID::INT8: {
+        val.int8Val = *((int8_t*)value);
+    } break;
+    case LogicalTypeID::UINT64: {
+        val.uint64Val = *((uint64_t*)value);
+    } break;
+    case LogicalTypeID::UINT32: {
+        val.uint32Val = *((uint32_t*)value);
+    } break;
+    case LogicalTypeID::UINT16: {
+        val.uint16Val = *((uint16_t*)value);
+    } break;
+    case LogicalTypeID::UINT8: {
+        val.uint8Val = *((uint8_t*)value);
+    } break;
+    case LogicalTypeID::INT128: {
+        val.int128Val = *((int128_t*)value);
+    } break;
+    case LogicalTypeID::BOOL: {
+        val.booleanVal = *((bool*)value);
+    } break;
+    case LogicalTypeID::DOUBLE: {
+        val.doubleVal = *((double*)value);
+    } break;
+    case LogicalTypeID::FLOAT: {
+        val.floatVal = *((float*)value);
+    } break;
+    case LogicalTypeID::DECIMAL: {
+        switch (dataType.getPhysicalType()) {
+        case PhysicalTypeID::INT16:
+            val.int16Val = (*(int16_t*)value);
+            break;
+        case PhysicalTypeID::INT32:
+            val.int32Val = (*(int32_t*)value);
+            break;
+        case PhysicalTypeID::INT64:
+            val.int64Val = (*(int64_t*)value);
+            break;
+        case PhysicalTypeID::INT128:
+            val.int128Val = (*(int128_t*)value);
+            break;
+        default:
+            KU_UNREACHABLE;
+        }
+    } break;
+    case LogicalTypeID::INTERVAL: {
+        val.intervalVal = *((interval_t*)value);
+    } break;
+    case LogicalTypeID::INTERNAL_ID: {
+        val.internalIDVal = *((nodeID_t*)value);
+    } break;
+    case LogicalTypeID::UINT128: {
+        val.uint128Val = *((uint128_t*)value);
+    } break;
+    case LogicalTypeID::BLOB: {
+        strVal = ((blob_t*)value)->value.getAsString();
+    } break;
+    case LogicalTypeID::UUID: {
+        val.int128Val = ((ku_uuid_t*)value)->value;
+        strVal = UUID::toString(*((ku_uuid_t*)value));
+    } break;
+    case LogicalTypeID::STRING: {
+        strVal = ((ku_string_t*)value)->getAsString();
+    } break;
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::LIST: {
+        copyFromRowLayoutList(*(ku_list_t*)value, ListType::getChildType(dataType));
+    } break;
+    case LogicalTypeID::ARRAY: {
+        copyFromRowLayoutList(*(ku_list_t*)value, ArrayType::getChildType(dataType));
+    } break;
+    case LogicalTypeID::UNION: {
+        copyFromUnion(value);
+    } break;
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::STRUCT: {
+        copyFromRowLayoutStruct(value);
+    } break;
+    case LogicalTypeID::POINTER: {
+        val.pointer = *((uint8_t**)value);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void Value::copyFromColLayout(const uint8_t* value, ValueVector* vector) {
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::INT64: {
+        val.int64Val = *((int64_t*)value);
+    } break;
+    case PhysicalTypeID::INT32: {
+        val.int32Val = *((int32_t*)value);
+    } break;
+    case PhysicalTypeID::INT16: {
+        val.int16Val = *((int16_t*)value);
+    } break;
+    case PhysicalTypeID::INT8: {
+        val.int8Val = *((int8_t*)value);
+    } break;
+    case PhysicalTypeID::UINT64: {
+        val.uint64Val = *((uint64_t*)value);
+    } break;
+    case PhysicalTypeID::UINT32: {
+        val.uint32Val = *((uint32_t*)value);
+    } break;
+    case PhysicalTypeID::UINT16: {
+        val.uint16Val = *((uint16_t*)value);
+    } break;
+    case PhysicalTypeID::UINT8: {
+        val.uint8Val = *((uint8_t*)value);
+    } break;
+    case PhysicalTypeID::INT128: {
+        val.int128Val = *((int128_t*)value);
+    } break;
+    case PhysicalTypeID::BOOL: {
+        val.booleanVal = *((bool*)value);
+    } break;
+    case PhysicalTypeID::DOUBLE: {
+        val.doubleVal = *((double*)value);
+    } break;
+    case PhysicalTypeID::FLOAT: {
+        val.floatVal = *((float*)value);
+    } break;
+    case PhysicalTypeID::INTERVAL: {
+        val.intervalVal = *((interval_t*)value);
+    } break;
+    case PhysicalTypeID::STRING: {
+        strVal = ((ku_string_t*)value)->getAsString();
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        copyFromColLayoutList(*(list_entry_t*)value, vector);
+    } break;
+    case PhysicalTypeID::STRUCT: {
+        copyFromColLayoutStruct(*(struct_entry_t*)value, vector);
+    } break;
+    case PhysicalTypeID::INTERNAL_ID: {
+        val.internalIDVal = *((nodeID_t*)value);
+    } break;
+    case PhysicalTypeID::UINT128: {
+        val.uint128Val = *((uint128_t*)value);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void Value::copyValueFrom(const Value& other) {
+    if (other.isNull()) {
+        isNull_ = true;
+        return;
+    }
+    isNull_ = false;
+    KU_ASSERT(dataType == other.dataType);
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL: {
+        val.booleanVal = other.val.booleanVal;
+    } break;
+    case PhysicalTypeID::INT64: {
+        val.int64Val = other.val.int64Val;
+    } break;
+    case PhysicalTypeID::INT32: {
+        val.int32Val = other.val.int32Val;
+    } break;
+    case PhysicalTypeID::INT16: {
+        val.int16Val = other.val.int16Val;
+    } break;
+    case PhysicalTypeID::INT8: {
+        val.int8Val = other.val.int8Val;
+    } break;
+    case PhysicalTypeID::UINT64: {
+        val.uint64Val = other.val.uint64Val;
+    } break;
+    case PhysicalTypeID::UINT32: {
+        val.uint32Val = other.val.uint32Val;
+    } break;
+    case PhysicalTypeID::UINT16: {
+        val.uint16Val = other.val.uint16Val;
+    } break;
+    case PhysicalTypeID::UINT8: {
+        val.uint8Val = other.val.uint8Val;
+    } break;
+    case PhysicalTypeID::INT128: {
+        val.int128Val = other.val.int128Val;
+    } break;
+    case PhysicalTypeID::DOUBLE: {
+        val.doubleVal = other.val.doubleVal;
+    } break;
+    case PhysicalTypeID::FLOAT: {
+        val.floatVal = other.val.floatVal;
+    } break;
+    case PhysicalTypeID::INTERVAL: {
+        val.intervalVal = other.val.intervalVal;
+    } break;
+    case PhysicalTypeID::INTERNAL_ID: {
+        val.internalIDVal = other.val.internalIDVal;
+    } break;
+    case PhysicalTypeID::UINT128: {
+        val.uint128Val = other.val.uint128Val;
+    } break;
+    case PhysicalTypeID::STRING: {
+        strVal = other.strVal;
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST:
+    case PhysicalTypeID::STRUCT: {
+        for (auto& child : other.children) {
+            children.push_back(child->copy());
+        }
+    } break;
+    case PhysicalTypeID::POINTER: {
+        val.pointer = other.val.pointer;
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::string Value::toString() const {
+    if (isNull_) {
+        return "";
+    }
+    switch (dataType.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL:
+        return TypeUtils::toString(val.booleanVal);
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64:
+        return TypeUtils::toString(val.int64Val);
+    case LogicalTypeID::INT32:
+        return TypeUtils::toString(val.int32Val);
+    case LogicalTypeID::INT16:
+        return TypeUtils::toString(val.int16Val);
+    case LogicalTypeID::INT8:
+        return TypeUtils::toString(val.int8Val);
+    case LogicalTypeID::UINT64:
+        return TypeUtils::toString(val.uint64Val);
+    case LogicalTypeID::UINT32:
+        return TypeUtils::toString(val.uint32Val);
+    case LogicalTypeID::UINT16:
+        return TypeUtils::toString(val.uint16Val);
+    case LogicalTypeID::UINT8:
+        return TypeUtils::toString(val.uint8Val);
+    case LogicalTypeID::INT128:
+        return TypeUtils::toString(val.int128Val);
+    case LogicalTypeID::DOUBLE:
+        return TypeUtils::toString(val.doubleVal);
+    case LogicalTypeID::FLOAT:
+        return TypeUtils::toString(val.floatVal);
+    case LogicalTypeID::DECIMAL:
+        return decimalToString();
+    case LogicalTypeID::POINTER:
+        return TypeUtils::toString((uint64_t)val.pointer);
+    case LogicalTypeID::DATE:
+        return TypeUtils::toString(date_t{val.int32Val});
+    case LogicalTypeID::TIMESTAMP_NS:
+        return TypeUtils::toString(timestamp_ns_t{val.int64Val});
+    case LogicalTypeID::TIMESTAMP_MS:
+        return TypeUtils::toString(timestamp_ms_t{val.int64Val});
+    case LogicalTypeID::TIMESTAMP_SEC:
+        return TypeUtils::toString(timestamp_sec_t{val.int64Val});
+    case LogicalTypeID::TIMESTAMP_TZ:
+        return TypeUtils::toString(timestamp_tz_t{val.int64Val});
+    case LogicalTypeID::TIMESTAMP:
+        return TypeUtils::toString(timestamp_t{val.int64Val});
+    case LogicalTypeID::INTERVAL:
+        return TypeUtils::toString(val.intervalVal);
+    case LogicalTypeID::INTERNAL_ID:
+        return TypeUtils::toString(val.internalIDVal);
+    case LogicalTypeID::UINT128:
+        return TypeUtils::toString(val.uint128Val);
+    case LogicalTypeID::BLOB:
+        return Blob::toString(reinterpret_cast<const uint8_t*>(strVal.c_str()), strVal.length());
+    case LogicalTypeID::UUID:
+        return UUID::toString(val.int128Val);
+    case LogicalTypeID::STRING:
+        return strVal;
+    case LogicalTypeID::MAP: {
+        return mapToString();
+    }
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::ARRAY: {
+        return listToString();
+    }
+    case LogicalTypeID::UNION: {
+        // Only one member in the union can be active at a time and that member is always stored
+        // at index 0.
+        return children[0]->toString();
+    }
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::STRUCT: {
+        return structToString();
+    }
+    case LogicalTypeID::NODE: {
+        return nodeToString();
+    }
+    case LogicalTypeID::REL: {
+        return relToString();
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+Value::Value() : isNull_{true}, childrenSize{0} {
+    dataType = LogicalType(LogicalTypeID::ANY);
+}
+
+Value::Value(const LogicalType& dataType_) : isNull_{true}, childrenSize{0} {
+    dataType = dataType_.copy();
+}
+
+void Value::resizeChildrenVector(uint64_t size, const LogicalType& childType) {
+    if (size > children.size()) {
+        children.reserve(size);
+        for (auto i = children.size(); i < size; ++i) {
+            children.push_back(std::make_unique<Value>(createDefaultValue(childType)));
+        }
+    }
+    childrenSize = size;
+}
+
+void Value::copyFromRowLayoutList(const ku_list_t& list, const LogicalType& childType) {
+    resizeChildrenVector(list.size, childType);
+    auto numBytesPerElement = storage::StorageUtils::getDataTypeSize(childType);
+    auto listNullBytes = reinterpret_cast<uint8_t*>(list.overflowPtr);
+    auto numBytesForNullValues = NullBuffer::getNumBytesForNullValues(list.size);
+    auto listValues = listNullBytes + numBytesForNullValues;
+    for (auto i = 0u; i < list.size; i++) {
+        auto childValue = children[i].get();
+        if (NullBuffer::isNull(listNullBytes, i)) {
+            childValue->setNull(true);
+        } else {
+            childValue->setNull(false);
+            childValue->copyFromRowLayout(listValues);
+        }
+        listValues += numBytesPerElement;
+    }
+}
+
+void Value::copyFromColLayoutList(const list_entry_t& listEntry, ValueVector* vec) {
+    auto dataVec = ListVector::getDataVector(vec);
+    resizeChildrenVector(listEntry.size, dataVec->dataType);
+    for (auto i = 0u; i < listEntry.size; i++) {
+        auto childValue = children[i].get();
+        childValue->setNull(dataVec->isNull(listEntry.offset + i));
+        if (!childValue->isNull()) {
+            childValue->copyFromColLayout(ListVector::getListValuesWithOffset(vec, listEntry, i),
+                dataVec);
+        }
+    }
+}
+
+void Value::copyFromRowLayoutStruct(const uint8_t* kuStruct) {
+    auto numFields = childrenSize;
+    auto structNullValues = kuStruct;
+    auto structValues = structNullValues + NullBuffer::getNumBytesForNullValues(numFields);
+    for (auto i = 0u; i < numFields; i++) {
+        auto childValue = children[i].get();
+        if (NullBuffer::isNull(structNullValues, i)) {
+            childValue->setNull(true);
+        } else {
+            childValue->setNull(false);
+            childValue->copyFromRowLayout(structValues);
+        }
+        structValues += storage::StorageUtils::getDataTypeSize(childValue->dataType);
+    }
+}
+
+void Value::copyFromColLayoutStruct(const struct_entry_t& structEntry, ValueVector* vec) {
+    for (auto i = 0u; i < childrenSize; i++) {
+        children[i]->setNull(StructVector::getFieldVector(vec, i)->isNull(structEntry.pos));
+        if (!children[i]->isNull()) {
+            auto fieldVector = StructVector::getFieldVector(vec, i);
+            children[i]->copyFromColLayout(fieldVector->getData() +
+                                               fieldVector->getNumBytesPerValue() * structEntry.pos,
+                fieldVector.get());
+        }
+    }
+}
+
+void Value::copyFromUnion(const uint8_t* kuUnion) {
+    auto childrenTypes = StructType::getFieldTypes(dataType);
+    auto unionNullValues = kuUnion;
+    auto unionValues = unionNullValues + NullBuffer::getNumBytesForNullValues(childrenTypes.size());
+    // For union dataType, only one member can be active at a time. So we don't need to copy all
+    // union fields into value.
+    auto activeFieldIdx = UnionType::getInternalFieldIdx(*(union_field_idx_t*)unionValues);
+    // Create default value now that we know the active field
+    auto childValue = Value::createDefaultValue(*childrenTypes[activeFieldIdx]);
+    auto curMemberIdx = 0u;
+    // Seek to the current active member value.
+    while (curMemberIdx < activeFieldIdx) {
+        unionValues += storage::StorageUtils::getDataTypeSize(*childrenTypes[curMemberIdx]);
+        curMemberIdx++;
+    }
+    if (NullBuffer::isNull(unionNullValues, activeFieldIdx)) {
+        childValue.setNull(true);
+    } else {
+        childValue.setNull(false);
+        childValue.copyFromRowLayout(unionValues);
+    }
+    if (children.empty()) {
+        children.push_back(std::make_unique<Value>(std::move(childValue)));
+        childrenSize = 1;
+    } else {
+        children[0] = std::make_unique<Value>(std::move(childValue));
+    }
+}
+
+void Value::serialize(Serializer& serializer) const {
+    dataType.serialize(serializer);
+    serializer.serializeValue(isNull_);
+    serializer.serializeValue(childrenSize);
+
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL: {
+        serializer.serializeValue(val.booleanVal);
+    } break;
+    case PhysicalTypeID::INT64: {
+        serializer.serializeValue(val.int64Val);
+    } break;
+    case PhysicalTypeID::INT32: {
+        serializer.serializeValue(val.int32Val);
+    } break;
+    case PhysicalTypeID::INT16: {
+        serializer.serializeValue(val.int16Val);
+    } break;
+    case PhysicalTypeID::INT8: {
+        serializer.serializeValue(val.int8Val);
+    } break;
+    case PhysicalTypeID::UINT64: {
+        serializer.serializeValue(val.uint64Val);
+    } break;
+    case PhysicalTypeID::UINT32: {
+        serializer.serializeValue(val.uint32Val);
+    } break;
+    case PhysicalTypeID::UINT16: {
+        serializer.serializeValue(val.uint16Val);
+    } break;
+    case PhysicalTypeID::UINT8: {
+        serializer.serializeValue(val.uint8Val);
+    } break;
+    case PhysicalTypeID::INT128: {
+        serializer.serializeValue(val.int128Val);
+    } break;
+    case PhysicalTypeID::DOUBLE: {
+        serializer.serializeValue(val.doubleVal);
+    } break;
+    case PhysicalTypeID::FLOAT: {
+        serializer.serializeValue(val.floatVal);
+    } break;
+    case PhysicalTypeID::INTERVAL: {
+        serializer.serializeValue(val.intervalVal);
+    } break;
+    case PhysicalTypeID::INTERNAL_ID: {
+        serializer.serializeValue(val.internalIDVal);
+    } break;
+    case PhysicalTypeID::UINT128: {
+        serializer.serializeValue(val.uint128Val);
+    } break;
+    case PhysicalTypeID::STRING: {
+        serializer.serializeValue(strVal);
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST:
+    case PhysicalTypeID::STRUCT: {
+        for (auto i = 0u; i < childrenSize; ++i) {
+            children[i]->serialize(serializer);
+        }
+    } break;
+    case PhysicalTypeID::ANY: {
+        // We want to be able to ser/deser values that are meant to just be null
+        if (!isNull_) {
+            KU_UNREACHABLE;
+        }
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+std::unique_ptr<Value> Value::deserialize(Deserializer& deserializer) {
+    LogicalType dataType = LogicalType::deserialize(deserializer);
+    std::unique_ptr<Value> val = std::make_unique<Value>(createDefaultValue(dataType));
+    deserializer.deserializeValue(val->isNull_);
+    deserializer.deserializeValue(val->childrenSize);
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL: {
+        deserializer.deserializeValue(val->val.booleanVal);
+    } break;
+    case PhysicalTypeID::INT64: {
+        deserializer.deserializeValue(val->val.int64Val);
+    } break;
+    case PhysicalTypeID::INT32: {
+        deserializer.deserializeValue(val->val.int32Val);
+    } break;
+    case PhysicalTypeID::INT16: {
+        deserializer.deserializeValue(val->val.int16Val);
+    } break;
+    case PhysicalTypeID::INT8: {
+        deserializer.deserializeValue(val->val.int8Val);
+    } break;
+    case PhysicalTypeID::UINT64: {
+        deserializer.deserializeValue(val->val.uint64Val);
+    } break;
+    case PhysicalTypeID::UINT32: {
+        deserializer.deserializeValue(val->val.uint32Val);
+    } break;
+    case PhysicalTypeID::UINT16: {
+        deserializer.deserializeValue(val->val.uint16Val);
+    } break;
+    case PhysicalTypeID::UINT8: {
+        deserializer.deserializeValue(val->val.uint8Val);
+    } break;
+    case PhysicalTypeID::INT128: {
+        deserializer.deserializeValue(val->val.int128Val);
+    } break;
+    case PhysicalTypeID::DOUBLE: {
+        deserializer.deserializeValue(val->val.doubleVal);
+    } break;
+    case PhysicalTypeID::FLOAT: {
+        deserializer.deserializeValue(val->val.floatVal);
+    } break;
+    case PhysicalTypeID::INTERVAL: {
+        deserializer.deserializeValue(val->val.intervalVal);
+    } break;
+    case PhysicalTypeID::INTERNAL_ID: {
+        deserializer.deserializeValue(val->val.internalIDVal);
+    } break;
+    case PhysicalTypeID::UINT128: {
+        deserializer.deserializeValue(val->val.uint128Val);
+    } break;
+    case PhysicalTypeID::STRING: {
+        deserializer.deserializeValue(val->strVal);
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST:
+    case PhysicalTypeID::STRUCT: {
+        val->children.resize(val->childrenSize);
+        for (auto i = 0u; i < val->childrenSize; i++) {
+            val->children[i] = deserialize(deserializer);
+        }
+    } break;
+    case PhysicalTypeID::ANY: {
+        // We want to be able to ser/deser values that are meant to just be null
+        if (!val->isNull_) {
+            KU_UNREACHABLE;
+        }
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    return val;
+}
+
+void Value::validateType(LogicalTypeID targetTypeID) const {
+    if (dataType.getLogicalTypeID() == targetTypeID) {
+        return;
+    }
+    throw BinderException(stringFormat("{} has data type {} but {} was expected.", toString(),
+        dataType.toString(), LogicalTypeUtils::toString(targetTypeID)));
+}
+
+bool Value::hasNoneNullChildren() const {
+    for (auto i = 0u; i < childrenSize; ++i) {
+        if (!children[i]->isNull()) {
+            return true;
+        }
+    }
+    return false;
+}
+
+// Handle the case of casting empty list to a different type.
+bool Value::allowTypeChange() const {
+    if (isNull_ || !dataType.isInternalType()) {
+        return true;
+    }
+    switch (dataType.getLogicalTypeID()) {
+    case LogicalTypeID::ANY:
+        return true;
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::ARRAY: {
+        if (childrenSize == 0) {
+            return true;
+        }
+        for (auto i = 0u; i < childrenSize; ++i) {
+            if (children[i]->allowTypeChange()) {
+                return true;
+            }
+        }
+        return false;
+    }
+    case LogicalTypeID::STRUCT: {
+        for (auto i = 0u; i < childrenSize; ++i) {
+            if (children[i]->allowTypeChange()) {
+                return true;
+            }
+        }
+        return false;
+    }
+    case LogicalTypeID::MAP: {
+        if (childrenSize == 0) {
+            return true;
+        }
+        for (auto i = 0u; i < childrenSize; ++i) {
+            auto k = children[i]->children[0].get();
+            auto v = children[i]->children[1].get();
+            if (k->allowTypeChange() || v->allowTypeChange()) {
+                return true;
+            }
+        }
+        return false;
+    }
+    default:
+        return false;
+    }
+}
+
+uint64_t Value::computeHash() const {
+    if (isNull_) {
+        return function::NULL_HASH;
+    }
+    hash_t hashValue = 0;
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL: {
+        function::Hash::operation(val.booleanVal, hashValue);
+    } break;
+    case PhysicalTypeID::INT128: {
+        function::Hash::operation(val.int128Val, hashValue);
+    } break;
+    case PhysicalTypeID::INT64: {
+        function::Hash::operation(val.int64Val, hashValue);
+    } break;
+    case PhysicalTypeID::INT32: {
+        function::Hash::operation(val.int32Val, hashValue);
+    } break;
+    case PhysicalTypeID::INT16: {
+        function::Hash::operation(val.int16Val, hashValue);
+    } break;
+    case PhysicalTypeID::INT8: {
+        function::Hash::operation(val.int8Val, hashValue);
+    } break;
+    case PhysicalTypeID::UINT64: {
+        function::Hash::operation(val.uint64Val, hashValue);
+    } break;
+    case PhysicalTypeID::UINT32: {
+        function::Hash::operation(val.uint32Val, hashValue);
+    } break;
+    case PhysicalTypeID::UINT16: {
+        function::Hash::operation(val.uint16Val, hashValue);
+    } break;
+    case PhysicalTypeID::UINT8: {
+        function::Hash::operation(val.uint8Val, hashValue);
+    } break;
+    case PhysicalTypeID::DOUBLE: {
+        function::Hash::operation(val.doubleVal, hashValue);
+    } break;
+    case PhysicalTypeID::FLOAT: {
+        function::Hash::operation(val.floatVal, hashValue);
+    } break;
+    case PhysicalTypeID::INTERVAL: {
+        function::Hash::operation(val.intervalVal, hashValue);
+    } break;
+    case PhysicalTypeID::INTERNAL_ID: {
+        function::Hash::operation(val.internalIDVal, hashValue);
+    } break;
+    case PhysicalTypeID::UINT128: {
+        function::Hash::operation(val.uint128Val, hashValue);
+    } break;
+    case PhysicalTypeID::STRING: {
+        function::Hash::operation(strVal, hashValue);
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST:
+    case PhysicalTypeID::STRUCT: {
+        if (childrenSize == 0) {
+            return function::NULL_HASH;
+        }
+        hashValue = children[0]->computeHash();
+        for (auto i = 1u; i < childrenSize; i++) {
+            hashValue = function::combineHashScalar(hashValue, children[i]->computeHash());
+        }
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    return hashValue;
+}
+
+std::string Value::mapToString() const {
+    std::string result = "{";
+    for (auto i = 0u; i < childrenSize; ++i) {
+        auto structVal = children[i].get();
+        result += structVal->children[0]->toString();
+        result += "=";
+        result += structVal->children[1]->toString();
+        result += (i == childrenSize - 1 ? "" : ", ");
+    }
+    result += "}";
+    return result;
+}
+
+std::string Value::listToString() const {
+    std::string result = "[";
+    for (auto i = 0u; i < childrenSize; ++i) {
+        result += children[i]->toString();
+        if (i != childrenSize - 1) {
+            result += ",";
+        }
+    }
+    result += "]";
+    return result;
+}
+
+std::string Value::structToString() const {
+    std::string result = "{";
+    auto fieldNames = StructType::getFieldNames(dataType);
+    for (auto i = 0u; i < childrenSize; ++i) {
+        result += fieldNames[i] + ": ";
+        result += children[i]->toString();
+        if (i != childrenSize - 1) {
+            result += ", ";
+        }
+    }
+    result += "}";
+    return result;
+}
+
+std::string Value::nodeToString() const {
+    if (children[0]->isNull_) {
+        // NODE is represented as STRUCT. We don't have a way to represent STRUCT as null.
+        // Instead, we check the internal ID entry to decide if a NODE is NULL.
+        return "";
+    }
+    std::string result = "{";
+    auto fieldNames = StructType::getFieldNames(dataType);
+    for (auto i = 0u; i < childrenSize; ++i) {
+        if (children[i]->isNull_) {
+            // Avoid printing null key value pair.
+            continue;
+        }
+        if (i != 0) {
+            result += ", ";
+        }
+        result += fieldNames[i] + ": " + children[i]->toString();
+    }
+    result += "}";
+    return result;
+}
+
+std::string Value::relToString() const {
+    if (children[3]->isNull_) {
+        // REL is represented as STRUCT. We don't have a way to represent STRUCT as null.
+        // Instead, we check the internal ID entry to decide if a REL is NULL.
+        return "";
+    }
+    std::string result = "(" + children[0]->toString() + ")-{";
+    auto fieldNames = StructType::getFieldNames(dataType);
+    for (auto i = 2u; i < childrenSize; ++i) {
+        if (children[i]->isNull_) {
+            // Avoid printing null key value pair.
+            continue;
+        }
+        if (i != 2) {
+            result += ", ";
+        }
+        result += fieldNames[i] + ": " + children[i]->toString();
+    }
+    result += "}->(" + children[1]->toString() + ")";
+    return result;
+}
+
+std::string Value::decimalToString() const {
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::INT16:
+        return DecimalType::insertDecimalPoint(TypeUtils::toString(val.int16Val),
+            DecimalType::getScale(dataType));
+    case PhysicalTypeID::INT32:
+        return DecimalType::insertDecimalPoint(TypeUtils::toString(val.int32Val),
+            DecimalType::getScale(dataType));
+    case PhysicalTypeID::INT64:
+        return DecimalType::insertDecimalPoint(TypeUtils::toString(val.int64Val),
+            DecimalType::getScale(dataType));
+    case PhysicalTypeID::INT128:
+        return DecimalType::insertDecimalPoint(TypeUtils::toString(val.int128Val),
+            DecimalType::getScale(dataType));
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/utils.cpp
new file mode 100644
index 0000000000..2475408a65
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/utils.cpp
@@ -0,0 +1,29 @@
+#include "common/utils.h"
+
+namespace lbug {
+namespace common {
+
+uint64_t nextPowerOfTwo(uint64_t v) {
+    v--;
+    v |= v >> 1;
+    v |= v >> 2;
+    v |= v >> 4;
+    v |= v >> 8;
+    v |= v >> 16;
+    v |= v >> 32;
+    v++;
+    return v;
+}
+
+uint64_t prevPowerOfTwo(uint64_t v) {
+    return nextPowerOfTwo((v / 2) + 1);
+}
+
+bool isLittleEndian() {
+    // Little endian arch stores the least significant value in the lower bytes.
+    int testNumber = 1;
+    return *(uint8_t*)&testNumber == 1;
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/vector/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/common/vector/CMakeLists.txt
new file mode 100644
index 0000000000..b5b23d9bf2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/vector/CMakeLists.txt
@@ -0,0 +1,8 @@
+add_library(lbug_common_vector
+        OBJECT
+        auxiliary_buffer.cpp
+        value_vector.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_common_vector>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/vector/auxiliary_buffer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/vector/auxiliary_buffer.cpp
new file mode 100644
index 0000000000..0b596a9794
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/vector/auxiliary_buffer.cpp
@@ -0,0 +1,95 @@
+#include "common/vector/auxiliary_buffer.h"
+
+#include <numeric>
+
+#include "common/constants.h"
+#include "common/system_config.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace common {
+
+StructAuxiliaryBuffer::StructAuxiliaryBuffer(const LogicalType& type,
+    storage::MemoryManager* memoryManager) {
+    auto fieldTypes = StructType::getFieldTypes(type);
+    childrenVectors.reserve(fieldTypes.size());
+    for (const auto& fieldType : fieldTypes) {
+        childrenVectors.push_back(std::make_shared<ValueVector>(fieldType->copy(), memoryManager));
+    }
+}
+
+ListAuxiliaryBuffer::ListAuxiliaryBuffer(const LogicalType& dataVectorType,
+    storage::MemoryManager* memoryManager)
+    : capacity{DEFAULT_VECTOR_CAPACITY}, size{0},
+      dataVector{std::make_shared<ValueVector>(dataVectorType.copy(), memoryManager)} {}
+
+list_entry_t ListAuxiliaryBuffer::addList(list_size_t listSize) {
+    auto listEntry = list_entry_t{size, listSize};
+    bool needResizeDataVector = size + listSize > capacity;
+    while (size + listSize > capacity) {
+        capacity *= CHUNK_RESIZE_RATIO;
+    }
+    if (needResizeDataVector) {
+        resizeDataVector(dataVector.get());
+    }
+    size += listSize;
+    return listEntry;
+}
+
+void ListAuxiliaryBuffer::resize(uint64_t numValues) {
+    if (numValues <= capacity) {
+        size = numValues;
+        return;
+    }
+    bool needResizeDataVector = numValues > capacity;
+    while (numValues > capacity) {
+        capacity *= 2;
+        KU_ASSERT(capacity != 0);
+    }
+    if (needResizeDataVector) {
+        resizeDataVector(dataVector.get());
+    }
+    size = numValues;
+}
+
+void ListAuxiliaryBuffer::resizeDataVector(ValueVector* dataVector) {
+    auto buffer = std::make_unique<uint8_t[]>(capacity * dataVector->getNumBytesPerValue());
+    memcpy(buffer.get(), dataVector->valueBuffer.get(), size * dataVector->getNumBytesPerValue());
+    dataVector->valueBuffer = std::move(buffer);
+    dataVector->nullMask.resize(capacity);
+    // If the dataVector is a struct vector, we need to resize its field vectors.
+    if (dataVector->dataType.getPhysicalType() == PhysicalTypeID::STRUCT) {
+        resizeStructDataVector(dataVector);
+    }
+}
+
+void ListAuxiliaryBuffer::resizeStructDataVector(ValueVector* dataVector) {
+    std::iota(reinterpret_cast<int64_t*>(
+                  dataVector->getData() + dataVector->getNumBytesPerValue() * size),
+        reinterpret_cast<int64_t*>(
+            dataVector->getData() + dataVector->getNumBytesPerValue() * capacity),
+        size);
+    auto fieldVectors = StructVector::getFieldVectors(dataVector);
+    for (auto& fieldVector : fieldVectors) {
+        resizeDataVector(fieldVector.get());
+    }
+}
+
+std::unique_ptr<AuxiliaryBuffer> AuxiliaryBufferFactory::getAuxiliaryBuffer(LogicalType& type,
+    storage::MemoryManager* memoryManager) {
+    switch (type.getPhysicalType()) {
+    case PhysicalTypeID::STRING:
+        return std::make_unique<StringAuxiliaryBuffer>(memoryManager);
+    case PhysicalTypeID::STRUCT:
+        return std::make_unique<StructAuxiliaryBuffer>(type, memoryManager);
+    case PhysicalTypeID::LIST:
+        return std::make_unique<ListAuxiliaryBuffer>(ListType::getChildType(type), memoryManager);
+    case PhysicalTypeID::ARRAY:
+        return std::make_unique<ListAuxiliaryBuffer>(ArrayType::getChildType(type), memoryManager);
+    default:
+        return nullptr;
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/vector/value_vector.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/vector/value_vector.cpp
new file mode 100644
index 0000000000..4a3b6f9c8b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/vector/value_vector.cpp
@@ -0,0 +1,704 @@
+#include "common/vector/value_vector.h"
+
+#include <numeric>
+
+#include "common/exception/runtime.h"
+#include "common/null_buffer.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/system_config.h"
+#include "common/types/uint128_t.h"
+#include "common/types/value/nested.h"
+#include "common/types/value/value.h"
+#include "common/vector/auxiliary_buffer.h"
+
+namespace lbug {
+namespace common {
+
+ValueVector::ValueVector(LogicalType dataType, storage::MemoryManager* memoryManager,
+    std::shared_ptr<DataChunkState> dataChunkState)
+    : dataType{std::move(dataType)}, nullMask{DEFAULT_VECTOR_CAPACITY} {
+    if (this->dataType.getLogicalTypeID() == LogicalTypeID::ANY) {
+        // LCOV_EXCL_START
+        // Alternatively we can assign a default type here but I don't think it's a good practice.
+        throw RuntimeException("Trying to a create a vector with ANY type. This should not happen. "
+                               "Data type is expected to be resolved during binding.");
+        // LCOV_EXCL_STOP
+    }
+    numBytesPerValue = getDataTypeSize(this->dataType);
+    initializeValueBuffer();
+    auxiliaryBuffer = AuxiliaryBufferFactory::getAuxiliaryBuffer(this->dataType, memoryManager);
+    if (dataChunkState) {
+        setState(dataChunkState);
+    }
+}
+
+void ValueVector::setState(const std::shared_ptr<DataChunkState>& state_) {
+    this->state = state_;
+    if (dataType.getPhysicalType() == PhysicalTypeID::STRUCT) {
+        auto childrenVectors = StructVector::getFieldVectors(this);
+        for (auto& childVector : childrenVectors) {
+            childVector->setState(state_);
+        }
+    }
+}
+
+uint32_t ValueVector::countNonNull() const {
+    if (hasNoNullsGuarantee()) {
+        return state->getSelVector().getSelSize();
+    } else if (state->getSelVector().isUnfiltered() &&
+               state->getSelVector().getSelSize() == DEFAULT_VECTOR_CAPACITY) {
+        return DEFAULT_VECTOR_CAPACITY - nullMask.countNulls();
+    } else {
+        uint32_t count = 0;
+        forEachNonNull([&](auto) { count++; });
+        return count;
+    }
+}
+
+bool ValueVector::discardNull(ValueVector& vector) {
+    if (vector.hasNoNullsGuarantee()) {
+        return true;
+    }
+    auto selectedPos = 0u;
+    if (vector.state->getSelVector().isUnfiltered()) {
+        auto buffer = vector.state->getSelVectorUnsafe().getMutableBuffer();
+        for (auto i = 0u; i < vector.state->getSelVector().getSelSize(); i++) {
+            buffer[selectedPos] = i;
+            selectedPos += !vector.isNull(i);
+        }
+        vector.state->getSelVectorUnsafe().setToFiltered();
+    } else {
+        for (auto i = 0u; i < vector.state->getSelVector().getSelSize(); i++) {
+            auto pos = vector.state->getSelVector()[i];
+            vector.state->getSelVectorUnsafe()[selectedPos] = pos;
+            selectedPos += !vector.isNull(pos);
+        }
+    }
+    vector.state->getSelVectorUnsafe().setSelSize(selectedPos);
+    return selectedPos > 0;
+}
+
+bool ValueVector::setNullFromBits(const uint64_t* srcNullEntries, uint64_t srcOffset,
+    uint64_t dstOffset, uint64_t numBitsToCopy, bool invert) {
+    return nullMask.copyFromNullBits(srcNullEntries, srcOffset, dstOffset, numBitsToCopy, invert);
+}
+
+template<typename T>
+void ValueVector::setValue(uint32_t pos, T val) {
+    ((T*)valueBuffer.get())[pos] = val;
+}
+
+void ValueVector::copyFromRowData(uint32_t pos, const uint8_t* rowData) {
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::STRUCT: {
+        StructVector::copyFromRowData(this, pos, rowData);
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        ListVector::copyFromRowData(this, pos, rowData);
+    } break;
+    case PhysicalTypeID::STRING: {
+        StringVector::addString(this, pos, *(ku_string_t*)rowData);
+    } break;
+    default: {
+        auto dataTypeSize = LogicalTypeUtils::getRowLayoutSize(dataType);
+        memcpy(getData() + pos * dataTypeSize, rowData, dataTypeSize);
+    }
+    }
+}
+
+void ValueVector::copyToRowData(uint32_t pos, uint8_t* rowData,
+    InMemOverflowBuffer* rowOverflowBuffer) const {
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::STRUCT: {
+        StructVector::copyToRowData(this, pos, rowData, rowOverflowBuffer);
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        ListVector::copyToRowData(this, pos, rowData, rowOverflowBuffer);
+    } break;
+    case PhysicalTypeID::STRING: {
+        StringVector::copyToRowData(this, pos, rowData, rowOverflowBuffer);
+    } break;
+    default: {
+        auto dataTypeSize = LogicalTypeUtils::getRowLayoutSize(dataType);
+        memcpy(rowData, getData() + pos * dataTypeSize, dataTypeSize);
+    }
+    }
+}
+
+void ValueVector::copyFromVectorData(uint8_t* dstData, const ValueVector* srcVector,
+    const uint8_t* srcVectorData) {
+    KU_ASSERT(srcVector->dataType.getPhysicalType() == dataType.getPhysicalType());
+    switch (srcVector->dataType.getPhysicalType()) {
+    case PhysicalTypeID::STRUCT: {
+        StructVector::copyFromVectorData(this, dstData, srcVector, srcVectorData);
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        ListVector::copyFromVectorData(this, dstData, srcVector, srcVectorData);
+    } break;
+    case PhysicalTypeID::STRING: {
+        StringVector::addString(this, *(ku_string_t*)dstData, *(ku_string_t*)srcVectorData);
+    } break;
+    default: {
+        memcpy(dstData, srcVectorData, srcVector->getNumBytesPerValue());
+    }
+    }
+}
+
+void ValueVector::copyFromVectorData(uint64_t dstPos, const ValueVector* srcVector,
+    uint64_t srcPos) {
+    setNull(dstPos, srcVector->isNull(srcPos));
+    if (!isNull(dstPos)) {
+        copyFromVectorData(getData() + dstPos * getNumBytesPerValue(), srcVector,
+            srcVector->getData() + srcPos * srcVector->getNumBytesPerValue());
+    }
+}
+
+void ValueVector::copyFromValue(uint64_t pos, const Value& value) {
+    if (value.isNull()) {
+        setNull(pos, true);
+        return;
+    }
+    setNull(pos, false);
+    auto dstValue = valueBuffer.get() + pos * numBytesPerValue;
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::INT64: {
+        memcpy(dstValue, &value.val.int64Val, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::INT32: {
+        memcpy(dstValue, &value.val.int32Val, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::INT16: {
+        memcpy(dstValue, &value.val.int16Val, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::INT8: {
+        memcpy(dstValue, &value.val.int8Val, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::UINT64: {
+        memcpy(dstValue, &value.val.uint64Val, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::UINT32: {
+        memcpy(dstValue, &value.val.uint32Val, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::UINT16: {
+        memcpy(dstValue, &value.val.uint16Val, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::UINT8: {
+        memcpy(dstValue, &value.val.uint8Val, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::INT128: {
+        memcpy(dstValue, &value.val.int128Val, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::DOUBLE: {
+        memcpy(dstValue, &value.val.doubleVal, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::FLOAT: {
+        memcpy(dstValue, &value.val.floatVal, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::BOOL: {
+        memcpy(dstValue, &value.val.booleanVal, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::INTERVAL: {
+        memcpy(dstValue, &value.val.intervalVal, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::STRING: {
+        StringVector::addString(this, *(ku_string_t*)dstValue, value.strVal.data(),
+            value.strVal.length());
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        auto listEntry = reinterpret_cast<list_entry_t*>(dstValue);
+        auto numValues = NestedVal::getChildrenSize(&value);
+        *listEntry = ListVector::addList(this, numValues);
+        auto dstDataVector = ListVector::getDataVector(this);
+        for (auto i = 0u; i < numValues; ++i) {
+            auto childVal = NestedVal::getChildVal(&value, i);
+            dstDataVector->setNull(listEntry->offset + i, childVal->isNull());
+            if (!childVal->isNull()) {
+                dstDataVector->copyFromValue(listEntry->offset + i,
+                    *NestedVal::getChildVal(&value, i));
+            }
+        }
+    } break;
+    case PhysicalTypeID::STRUCT: {
+        auto structFields = StructVector::getFieldVectors(this);
+        for (auto i = 0u; i < structFields.size(); ++i) {
+            structFields[i]->copyFromValue(pos, *NestedVal::getChildVal(&value, i));
+        }
+    } break;
+    case PhysicalTypeID::INTERNAL_ID: {
+        memcpy(dstValue, &value.val.internalIDVal, numBytesPerValue);
+    } break;
+    case PhysicalTypeID::UINT128: {
+        memcpy(dstValue, &value.val.uint128Val, numBytesPerValue);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+std::unique_ptr<Value> ValueVector::getAsValue(uint64_t pos) const {
+    auto value = Value::createNullValue(dataType).copy();
+    if (isNull(pos)) {
+        return value;
+    }
+    value->setNull(false);
+    value->dataType = dataType.copy();
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::INT64: {
+        value->val.int64Val = getValue<int64_t>(pos);
+    } break;
+    case PhysicalTypeID::INT32: {
+        value->val.int32Val = getValue<int32_t>(pos);
+    } break;
+    case PhysicalTypeID::INT16: {
+        value->val.int16Val = getValue<int16_t>(pos);
+    } break;
+    case PhysicalTypeID::INT8: {
+        value->val.int8Val = getValue<int8_t>(pos);
+    } break;
+    case PhysicalTypeID::UINT64: {
+        value->val.uint64Val = getValue<uint64_t>(pos);
+    } break;
+    case PhysicalTypeID::UINT32: {
+        value->val.uint32Val = getValue<uint32_t>(pos);
+    } break;
+    case PhysicalTypeID::UINT16: {
+        value->val.uint16Val = getValue<uint16_t>(pos);
+    } break;
+    case PhysicalTypeID::UINT8: {
+        value->val.uint8Val = getValue<uint8_t>(pos);
+    } break;
+    case PhysicalTypeID::INT128: {
+        value->val.int128Val = getValue<int128_t>(pos);
+    } break;
+    case PhysicalTypeID::DOUBLE: {
+        value->val.doubleVal = getValue<double>(pos);
+    } break;
+    case PhysicalTypeID::FLOAT: {
+        value->val.floatVal = getValue<float>(pos);
+    } break;
+    case PhysicalTypeID::BOOL: {
+        value->val.booleanVal = getValue<bool>(pos);
+    } break;
+    case PhysicalTypeID::INTERVAL: {
+        value->val.intervalVal = getValue<interval_t>(pos);
+    } break;
+    case PhysicalTypeID::STRING: {
+        value->strVal = getValue<ku_string_t>(pos).getAsString();
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        auto dataVector = ListVector::getDataVector(this);
+        auto listEntry = getValue<list_entry_t>(pos);
+        std::vector<std::unique_ptr<Value>> children;
+        children.reserve(listEntry.size);
+        for (auto i = 0u; i < listEntry.size; ++i) {
+            children.push_back(dataVector->getAsValue(listEntry.offset + i));
+        }
+        value->childrenSize = children.size();
+        value->children = std::move(children);
+    } break;
+    case PhysicalTypeID::STRUCT: {
+        auto& fieldVectors = StructVector::getFieldVectors(this);
+        std::vector<std::unique_ptr<Value>> children;
+        children.reserve(fieldVectors.size());
+        for (auto& fieldVector : fieldVectors) {
+            children.push_back(fieldVector->getAsValue(pos));
+        }
+        value->childrenSize = children.size();
+        value->children = std::move(children);
+    } break;
+    case PhysicalTypeID::INTERNAL_ID: {
+        value->val.internalIDVal = getValue<internalID_t>(pos);
+    } break;
+    case PhysicalTypeID::UINT128: {
+        value->val.uint128Val = getValue<uint128_t>(pos);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    return value;
+}
+
+void ValueVector::resetAuxiliaryBuffer() {
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::STRING: {
+        ku_dynamic_cast<StringAuxiliaryBuffer*>(auxiliaryBuffer.get())->resetOverflowBuffer();
+        return;
+    }
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        auto listAuxiliaryBuffer = ku_dynamic_cast<ListAuxiliaryBuffer*>(auxiliaryBuffer.get());
+        listAuxiliaryBuffer->resetSize();
+        listAuxiliaryBuffer->getDataVector()->resetAuxiliaryBuffer();
+        return;
+    }
+    case PhysicalTypeID::STRUCT: {
+        auto structAuxiliaryBuffer = ku_dynamic_cast<StructAuxiliaryBuffer*>(auxiliaryBuffer.get());
+        for (auto& vector : structAuxiliaryBuffer->getFieldVectors()) {
+            vector->resetAuxiliaryBuffer();
+        }
+        return;
+    }
+    default:
+        return;
+    }
+}
+
+uint32_t ValueVector::getDataTypeSize(const LogicalType& type) {
+    switch (type.getPhysicalType()) {
+    case PhysicalTypeID::STRING: {
+        return sizeof(ku_string_t);
+    }
+    case PhysicalTypeID::STRUCT: {
+        return sizeof(struct_entry_t);
+    }
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        return sizeof(list_entry_t);
+    }
+    default: {
+        return PhysicalTypeUtils::getFixedTypeSize(type.getPhysicalType());
+    }
+    }
+}
+
+void ValueVector::initializeValueBuffer() {
+    valueBuffer = std::make_unique<uint8_t[]>(numBytesPerValue * DEFAULT_VECTOR_CAPACITY);
+    if (dataType.getPhysicalType() == PhysicalTypeID::STRUCT) {
+        // For struct valueVectors, each struct_entry_t stores its current position in the
+        // valueVector.
+        std::iota(reinterpret_cast<int64_t*>(getData()),
+            reinterpret_cast<int64_t*>(getData() + getNumBytesPerValue() * DEFAULT_VECTOR_CAPACITY),
+            0);
+    }
+}
+
+void ValueVector::serialize(Serializer& ser) const {
+    // dataType, num_values, data, nullMask, aux
+    ser.writeDebuggingInfo("data_type");
+    dataType.serialize(ser);
+    ser.writeDebuggingInfo("num_values");
+    const auto selSize = state->getSelVector().getSelSize();
+    ser.write<sel_t>(selSize);
+    for (auto i = 0u; i < selSize; i++) {
+        const auto pos = state->getSelVector()[i];
+        ser.write<bool>(nullMask.isNull(pos));
+    }
+    ser.writeDebuggingInfo("values");
+    for (auto i = 0u; i < selSize; i++) {
+        getAsValue(state->getSelVector()[i])->serialize(ser);
+    }
+}
+
+std::unique_ptr<ValueVector> ValueVector::deSerialize(Deserializer& deSer,
+    storage::MemoryManager* mm, std::shared_ptr<DataChunkState> dataChunkState) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "data_type");
+    auto dataType = LogicalType::deserialize(deSer);
+    auto result = std::make_unique<ValueVector>(std::move(dataType), mm);
+    result->setState(dataChunkState);
+    deSer.validateDebuggingInfo(key, "num_values");
+    sel_t numValues = 0;
+    deSer.deserializeValue<sel_t>(numValues);
+    result->state->getSelVectorUnsafe().setSelSize(numValues);
+    KU_ASSERT(result->state->getSelVector().isUnfiltered());
+    bool isNull = false;
+    for (auto i = 0u; i < numValues; i++) {
+        deSer.deserializeValue<bool>(isNull);
+        result->setNull(i, isNull);
+    }
+    deSer.validateDebuggingInfo(key, "values");
+    for (auto i = 0u; i < numValues; i++) {
+        auto val = Value::deserialize(deSer);
+        result->copyFromValue(result->state->getSelVector()[i], *val);
+    }
+    return result;
+}
+
+template LBUG_API void ValueVector::setValue<nodeID_t>(uint32_t pos, nodeID_t val);
+template LBUG_API void ValueVector::setValue<bool>(uint32_t pos, bool val);
+template LBUG_API void ValueVector::setValue<int64_t>(uint32_t pos, int64_t val);
+template LBUG_API void ValueVector::setValue<int32_t>(uint32_t pos, int32_t val);
+template LBUG_API void ValueVector::setValue<int16_t>(uint32_t pos, int16_t val);
+template LBUG_API void ValueVector::setValue<int8_t>(uint32_t pos, int8_t val);
+template LBUG_API void ValueVector::setValue<uint64_t>(uint32_t pos, uint64_t val);
+template LBUG_API void ValueVector::setValue<uint32_t>(uint32_t pos, uint32_t val);
+template LBUG_API void ValueVector::setValue<uint16_t>(uint32_t pos, uint16_t val);
+template LBUG_API void ValueVector::setValue<uint8_t>(uint32_t pos, uint8_t val);
+template LBUG_API void ValueVector::setValue<int128_t>(uint32_t pos, int128_t val);
+template LBUG_API void ValueVector::setValue<uint128_t>(uint32_t pos, uint128_t val);
+template LBUG_API void ValueVector::setValue<double>(uint32_t pos, double val);
+template LBUG_API void ValueVector::setValue<float>(uint32_t pos, float val);
+template LBUG_API void ValueVector::setValue<date_t>(uint32_t pos, date_t val);
+template LBUG_API void ValueVector::setValue<timestamp_t>(uint32_t pos, timestamp_t val);
+template LBUG_API void ValueVector::setValue<timestamp_ns_t>(uint32_t pos, timestamp_ns_t val);
+template LBUG_API void ValueVector::setValue<timestamp_ms_t>(uint32_t pos, timestamp_ms_t val);
+template LBUG_API void ValueVector::setValue<timestamp_sec_t>(uint32_t pos, timestamp_sec_t val);
+template LBUG_API void ValueVector::setValue<timestamp_tz_t>(uint32_t pos, timestamp_tz_t val);
+template LBUG_API void ValueVector::setValue<interval_t>(uint32_t pos, interval_t val);
+template LBUG_API void ValueVector::setValue<list_entry_t>(uint32_t pos, list_entry_t val);
+template LBUG_API void ValueVector::setValue<ku_uuid_t>(uint32_t pos, ku_uuid_t val);
+
+template<>
+void ValueVector::setValue(uint32_t pos, ku_string_t val) {
+    StringVector::addString(this, pos, val);
+}
+template<>
+void ValueVector::setValue(uint32_t pos, std::string val) {
+    StringVector::addString(this, pos, val.data(), val.length());
+}
+template<>
+void ValueVector::setValue(uint32_t pos, std::string_view val) {
+    StringVector::addString(this, pos, val.data(), val.length());
+}
+
+void ValueVector::setNull(uint32_t pos, bool isNull) {
+    nullMask.setNull(pos, isNull);
+}
+
+void StringVector::addString(ValueVector* vector, uint32_t vectorPos, ku_string_t& srcStr) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+    auto stringBuffer = ku_dynamic_cast<StringAuxiliaryBuffer*>(vector->auxiliaryBuffer.get());
+    auto& dstStr = vector->getValue<ku_string_t>(vectorPos);
+    if (ku_string_t::isShortString(srcStr.len)) {
+        dstStr.setShortString(srcStr);
+    } else {
+        dstStr.overflowPtr = reinterpret_cast<uint64_t>(stringBuffer->allocateOverflow(srcStr.len));
+        dstStr.setLongString(srcStr);
+    }
+}
+
+void StringVector::addString(ValueVector* vector, uint32_t vectorPos, const char* srcStr,
+    uint64_t length) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+    auto stringBuffer = ku_dynamic_cast<StringAuxiliaryBuffer*>(vector->auxiliaryBuffer.get());
+    auto& dstStr = vector->getValue<ku_string_t>(vectorPos);
+    if (ku_string_t::isShortString(length)) {
+        dstStr.setShortString(srcStr, length);
+    } else {
+        dstStr.overflowPtr = reinterpret_cast<uint64_t>(stringBuffer->allocateOverflow(length));
+        dstStr.setLongString(srcStr, length);
+    }
+}
+
+void StringVector::addString(ValueVector* vector, uint32_t vectorPos, std::string_view srcStr) {
+    addString(vector, vectorPos, srcStr.data(), srcStr.length());
+}
+
+ku_string_t& StringVector::reserveString(ValueVector* vector, uint32_t vectorPos, uint64_t length) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+    auto stringBuffer = ku_dynamic_cast<StringAuxiliaryBuffer*>(vector->auxiliaryBuffer.get());
+    auto& dstStr = vector->getValue<ku_string_t>(vectorPos);
+    dstStr.len = length;
+    if (!ku_string_t::isShortString(length)) {
+        dstStr.overflowPtr = reinterpret_cast<uint64_t>(stringBuffer->allocateOverflow(length));
+    }
+    return dstStr;
+}
+
+void StringVector::reserveString(ValueVector* vector, ku_string_t& dstStr, uint64_t length) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+    auto stringBuffer = ku_dynamic_cast<StringAuxiliaryBuffer*>(vector->auxiliaryBuffer.get());
+    dstStr.len = length;
+    if (!ku_string_t::isShortString(length)) {
+        dstStr.overflowPtr = reinterpret_cast<uint64_t>(stringBuffer->allocateOverflow(length));
+    }
+}
+
+void StringVector::addString(ValueVector* vector, ku_string_t& dstStr, ku_string_t& srcStr) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+    auto stringBuffer = ku_dynamic_cast<StringAuxiliaryBuffer*>(vector->auxiliaryBuffer.get());
+    if (ku_string_t::isShortString(srcStr.len)) {
+        dstStr.setShortString(srcStr);
+    } else {
+        dstStr.overflowPtr = reinterpret_cast<uint64_t>(stringBuffer->allocateOverflow(srcStr.len));
+        dstStr.setLongString(srcStr);
+    }
+}
+
+void StringVector::addString(ValueVector* vector, ku_string_t& dstStr, const char* srcStr,
+    uint64_t length) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+    auto stringBuffer = ku_dynamic_cast<StringAuxiliaryBuffer*>(vector->auxiliaryBuffer.get());
+    if (ku_string_t::isShortString(length)) {
+        dstStr.setShortString(srcStr, length);
+    } else {
+        dstStr.overflowPtr = reinterpret_cast<uint64_t>(stringBuffer->allocateOverflow(length));
+        dstStr.setLongString(srcStr, length);
+    }
+}
+
+void StringVector::addString(lbug::common::ValueVector* vector, ku_string_t& dstStr,
+    const std::string& srcStr) {
+    addString(vector, dstStr, srcStr.data(), srcStr.length());
+}
+
+void StringVector::copyToRowData(const ValueVector* vector, uint32_t pos, uint8_t* rowData,
+    InMemOverflowBuffer* rowOverflowBuffer) {
+    auto& srcStr = vector->getValue<ku_string_t>(pos);
+    auto& dstStr = *(ku_string_t*)rowData;
+    if (ku_string_t::isShortString(srcStr.len)) {
+        dstStr.setShortString(srcStr);
+    } else {
+        dstStr.overflowPtr =
+            reinterpret_cast<uint64_t>(rowOverflowBuffer->allocateSpace(srcStr.len));
+        dstStr.setLongString(srcStr);
+    }
+}
+
+void ListVector::copyListEntryAndBufferMetaData(ValueVector& vector,
+    const SelectionVector& selVector, const ValueVector& other,
+    const SelectionVector& otherSelVector) {
+    KU_ASSERT(selVector.getSelSize() == otherSelVector.getSelSize());
+    // Copy list entries
+    for (auto i = 0u; i < otherSelVector.getSelSize(); ++i) {
+        auto pos = selVector[i];
+        auto otherPos = otherSelVector[i];
+        vector.setNull(pos, other.isNull(pos));
+        if (!other.isNull(otherPos)) {
+            vector.setValue(pos, other.getValue<list_entry_t>(otherPos));
+        }
+    }
+    // Copy buffer metadata
+    auto& buffer = getAuxBufferUnsafe(vector);
+    auto& otherBuffer = getAuxBuffer(other);
+    buffer.capacity = otherBuffer.capacity;
+    buffer.size = otherBuffer.size;
+}
+
+void ListVector::copyFromRowData(ValueVector* vector, uint32_t pos, const uint8_t* rowData) {
+    KU_ASSERT(validateType(*vector));
+    auto& srcKuList = *(ku_list_t*)rowData;
+    auto srcNullBytes = reinterpret_cast<uint8_t*>(srcKuList.overflowPtr);
+    auto srcListValues = srcNullBytes + NullBuffer::getNumBytesForNullValues(srcKuList.size);
+    auto dstListEntry = addList(vector, srcKuList.size);
+    vector->setValue<list_entry_t>(pos, dstListEntry);
+    auto resultDataVector = getDataVector(vector);
+    auto rowLayoutSize = LogicalTypeUtils::getRowLayoutSize(resultDataVector->dataType);
+    for (auto i = 0u; i < srcKuList.size; i++) {
+        auto dstListValuePos = dstListEntry.offset + i;
+        if (NullBuffer::isNull(srcNullBytes, i)) {
+            resultDataVector->setNull(dstListValuePos, true);
+        } else {
+            resultDataVector->setNull(dstListValuePos, false);
+            resultDataVector->copyFromRowData(dstListValuePos, srcListValues);
+        }
+        srcListValues += rowLayoutSize;
+    }
+}
+
+void ListVector::copyToRowData(const ValueVector* vector, uint32_t pos, uint8_t* rowData,
+    InMemOverflowBuffer* rowOverflowBuffer) {
+    auto& srcListEntry = vector->getValue<list_entry_t>(pos);
+    auto srcListDataVector = ListVector::getDataVector(vector);
+    auto& dstListEntry = *(ku_list_t*)rowData;
+    dstListEntry.size = srcListEntry.size;
+    auto nullBytesSize = NullBuffer::getNumBytesForNullValues(dstListEntry.size);
+    auto dataRowLayoutSize = LogicalTypeUtils::getRowLayoutSize(srcListDataVector->dataType);
+    auto dstListOverflowSize = dataRowLayoutSize * dstListEntry.size + nullBytesSize;
+    auto dstListOverflow = rowOverflowBuffer->allocateSpace(dstListOverflowSize);
+    dstListEntry.overflowPtr = reinterpret_cast<uint64_t>(dstListOverflow);
+    NullBuffer::initNullBytes(dstListOverflow, dstListEntry.size);
+    auto dstListValues = dstListOverflow + nullBytesSize;
+    for (auto i = 0u; i < srcListEntry.size; i++) {
+        if (srcListDataVector->isNull(srcListEntry.offset + i)) {
+            NullBuffer::setNull(dstListOverflow, i);
+        } else {
+            srcListDataVector->copyToRowData(srcListEntry.offset + i, dstListValues,
+                rowOverflowBuffer);
+        }
+        dstListValues += dataRowLayoutSize;
+    }
+}
+
+void ListVector::copyFromVectorData(ValueVector* dstVector, uint8_t* dstData,
+    const ValueVector* srcVector, const uint8_t* srcData) {
+    auto& srcListEntry = *(list_entry_t*)(srcData);
+    auto& dstListEntry = *(list_entry_t*)(dstData);
+    dstListEntry = addList(dstVector, srcListEntry.size);
+    auto srcDataVector = getDataVector(srcVector);
+    auto srcPos = srcListEntry.offset;
+    auto dstDataVector = getDataVector(dstVector);
+    auto dstPos = dstListEntry.offset;
+    for (auto i = 0u; i < srcListEntry.size; i++) {
+        dstDataVector->copyFromVectorData(dstPos++, srcDataVector, srcPos++);
+    }
+}
+
+void ListVector::appendDataVector(ValueVector* dstVector, ValueVector* srcDataVector,
+    uint64_t numValuesToAppend) {
+    auto offset = getDataVectorSize(dstVector);
+    resizeDataVector(dstVector, offset + numValuesToAppend);
+    auto dstDataVector = getDataVector(dstVector);
+    for (auto i = 0u; i < numValuesToAppend; i++) {
+        dstDataVector->copyFromVectorData(offset + i, srcDataVector, i);
+    }
+}
+
+void ListVector::sliceDataVector(ValueVector* vectorToSlice, uint64_t offset, uint64_t numValues) {
+    if (offset == 0) {
+        return;
+    }
+    for (auto i = 0u; i < numValues - offset; i++) {
+        vectorToSlice->copyFromVectorData(i, vectorToSlice, i + offset);
+    }
+}
+
+void StructVector::copyFromRowData(ValueVector* vector, uint32_t pos, const uint8_t* rowData) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRUCT);
+    auto& structFields = getFieldVectors(vector);
+    auto structNullBytes = rowData;
+    auto structValues = structNullBytes + NullBuffer::getNumBytesForNullValues(structFields.size());
+    for (auto i = 0u; i < structFields.size(); i++) {
+        auto structField = structFields[i];
+        if (NullBuffer::isNull(structNullBytes, i)) {
+            structField->setNull(pos, true /* isNull */);
+        } else {
+            structField->setNull(pos, false /* isNull */);
+            structField->copyFromRowData(pos, structValues);
+        }
+        structValues += LogicalTypeUtils::getRowLayoutSize(structField->dataType);
+    }
+}
+
+void StructVector::copyToRowData(const ValueVector* vector, uint32_t pos, uint8_t* rowData,
+    InMemOverflowBuffer* rowOverflowBuffer) {
+    // The storage structure of STRUCT type in factorizedTable is:
+    // [NULLBYTES, FIELD1, FIELD2, ...]
+    auto& structFields = StructVector::getFieldVectors(vector);
+    NullBuffer::initNullBytes(rowData, structFields.size());
+    auto structNullBytes = rowData;
+    auto structValues = structNullBytes + NullBuffer::getNumBytesForNullValues(structFields.size());
+    for (auto i = 0u; i < structFields.size(); i++) {
+        auto structField = structFields[i];
+        if (structField->isNull(pos)) {
+            NullBuffer::setNull(structNullBytes, i);
+        } else {
+            structField->copyToRowData(pos, structValues, rowOverflowBuffer);
+        }
+        structValues += LogicalTypeUtils::getRowLayoutSize(structField->dataType);
+    }
+}
+
+void StructVector::copyFromVectorData(ValueVector* dstVector, const uint8_t* dstData,
+    const ValueVector* srcVector, const uint8_t* srcData) {
+    auto& srcPos = (*(struct_entry_t*)srcData).pos;
+    auto& dstPos = (*(struct_entry_t*)dstData).pos;
+    auto& srcFieldVectors = getFieldVectors(srcVector);
+    auto& dstFieldVectors = getFieldVectors(dstVector);
+    for (auto i = 0u; i < srcFieldVectors.size(); i++) {
+        auto srcFieldVector = srcFieldVectors[i];
+        auto dstFieldVector = dstFieldVectors[i];
+        dstFieldVector->copyFromVectorData(dstPos, srcFieldVector.get(), srcPos);
+    }
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/common/windows_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/common/windows_utils.cpp
new file mode 100644
index 0000000000..ab499a39df
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/common/windows_utils.cpp
@@ -0,0 +1,43 @@
+#if defined(_WIN32)
+#include "common/windows_utils.h"
+
+#include <memory>
+
+#include "common/exception/io.h"
+
+namespace lbug {
+namespace common {
+
+std::wstring WindowsUtils::utf8ToUnicode(const char* input) {
+    uint32_t result;
+
+    result = MultiByteToWideChar(CP_UTF8, 0, input, -1, nullptr, 0);
+    if (result == 0) {
+        throw IOException("Failure in MultiByteToWideChar");
+    }
+    auto buffer = std::make_unique<wchar_t[]>(result);
+    result = MultiByteToWideChar(CP_UTF8, 0, input, -1, buffer.get(), result);
+    if (result == 0) {
+        throw IOException("Failure in MultiByteToWideChar");
+    }
+    return std::wstring(buffer.get(), result);
+}
+
+std::string WindowsUtils::unicodeToUTF8(LPCWSTR input) {
+    uint64_t resultSize;
+
+    resultSize = WideCharToMultiByte(CP_UTF8, 0, input, -1, 0, 0, 0, 0);
+    if (resultSize == 0) {
+        throw IOException("Failure in WideCharToMultiByte");
+    }
+    auto buffer = std::make_unique<char[]>(resultSize);
+    resultSize = WideCharToMultiByte(CP_UTF8, 0, input, -1, buffer.get(), resultSize, 0, 0);
+    if (resultSize == 0) {
+        throw IOException("Failure in WideCharToMultiByte");
+    }
+    return std::string(buffer.get(), resultSize - 1);
+}
+
+} // namespace common
+} // namespace lbug
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/CMakeLists.txt
new file mode 100644
index 0000000000..301161287a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/CMakeLists.txt
@@ -0,0 +1,17 @@
+add_library(lbug_expression_evaluator
+        OBJECT
+        case_evaluator.cpp
+        expression_evaluator.cpp
+        expression_evaluator_utils.cpp
+        expression_evaluator_visitor.cpp
+        function_evaluator.cpp
+        lambda_evaluator.cpp
+        list_slice_info.cpp
+        literal_evaluator.cpp
+        pattern_evaluator.cpp
+        path_evaluator.cpp
+        reference_evaluator.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_expression_evaluator>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/case_evaluator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/case_evaluator.cpp
new file mode 100644
index 0000000000..d4e072a06f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/case_evaluator.cpp
@@ -0,0 +1,108 @@
+#include "expression_evaluator/case_evaluator.h"
+
+using namespace lbug::main;
+using namespace lbug::common;
+using namespace lbug::processor;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace evaluator {
+
+void CaseAlternativeEvaluator::init(const ResultSet& resultSet,
+    main::ClientContext* clientContext) {
+    whenEvaluator->init(resultSet, clientContext);
+    thenEvaluator->init(resultSet, clientContext);
+    whenSelVector = std::make_unique<SelectionVector>(DEFAULT_VECTOR_CAPACITY);
+    whenSelVector->setToFiltered();
+}
+
+void CaseExpressionEvaluator::init(const ResultSet& resultSet, main::ClientContext* clientContext) {
+    for (auto& alternativeEvaluator : alternativeEvaluators) {
+        alternativeEvaluator.init(resultSet, clientContext);
+    }
+    elseEvaluator->init(resultSet, clientContext);
+    ExpressionEvaluator::init(resultSet, clientContext);
+}
+
+void CaseExpressionEvaluator::evaluate() {
+    filledMask.reset();
+    for (auto& alternativeEvaluator : alternativeEvaluators) {
+        auto whenSelVector = alternativeEvaluator.whenSelVector.get();
+        // the sel vector is already set to filtered in init()
+        auto hasAtLeastOneValue = alternativeEvaluator.whenEvaluator->select(*whenSelVector, false);
+        if (!hasAtLeastOneValue) {
+            continue;
+        }
+        alternativeEvaluator.thenEvaluator->evaluate();
+        auto thenVector = alternativeEvaluator.thenEvaluator->resultVector.get();
+        if (alternativeEvaluator.whenEvaluator->isResultFlat()) {
+            fillAll(thenVector);
+        } else {
+            fillSelected(*whenSelVector, thenVector);
+        }
+        if (filledMask.count() == resultVector->state->getSelVector().getSelSize()) {
+            return;
+        }
+    }
+    elseEvaluator->evaluate();
+    fillAll(elseEvaluator->resultVector.get());
+}
+
+bool CaseExpressionEvaluator::selectInternal(SelectionVector& selVector) {
+    evaluate();
+    KU_ASSERT(resultVector->state->getSelVector().getSelSize() != 0);
+    KU_ASSERT(selVector.getSelSize() != 0);
+    KU_ASSERT(resultVector->state->getSelVector().getSelSize() == selVector.getSelSize());
+    auto numSelectedValues = 0u;
+    auto selectedPosBuffer = selVector.getMutableBuffer();
+    for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+        auto selVectorPos = selVector[i];
+        auto resultVectorPos = resultVector->state->getSelVector()[i];
+        selectedPosBuffer[numSelectedValues] = selVectorPos;
+        const bool selectCurrentValue =
+            !resultVector->isNull(resultVectorPos) && resultVector->getValue<bool>(resultVectorPos);
+        numSelectedValues += selectCurrentValue;
+    }
+    selVector.setSelSize(numSelectedValues);
+    return numSelectedValues > 0;
+}
+
+void CaseExpressionEvaluator::resolveResultVector(const ResultSet& /*resultSet*/,
+    MemoryManager* memoryManager) {
+    resultVector = std::make_shared<ValueVector>(expression->dataType.copy(), memoryManager);
+    std::vector<ExpressionEvaluator*> inputEvaluators;
+    for (auto& alternative : alternativeEvaluators) {
+        inputEvaluators.push_back(alternative.whenEvaluator.get());
+        inputEvaluators.push_back(alternative.thenEvaluator.get());
+    }
+    inputEvaluators.push_back(elseEvaluator.get());
+    resolveResultStateFromChildren(inputEvaluators);
+}
+
+void CaseExpressionEvaluator::fillSelected(const SelectionVector& selVector,
+    ValueVector* srcVector) {
+    for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+        auto resultPos = selVector[i];
+        fillEntry(resultPos, srcVector);
+    }
+}
+
+void CaseExpressionEvaluator::fillAll(ValueVector* srcVector) {
+    auto& resultSelVector = resultVector->state->getSelVector();
+    for (auto i = 0u; i < resultSelVector.getSelSize(); ++i) {
+        auto resultPos = resultSelVector[i];
+        fillEntry(resultPos, srcVector);
+    }
+}
+
+void CaseExpressionEvaluator::fillEntry(sel_t resultPos, ValueVector* srcVector) {
+    if (filledMask[resultPos]) {
+        return;
+    }
+    filledMask[resultPos] = true;
+    auto srcPos = srcVector->state->isFlat() ? srcVector->state->getSelVector()[0] : resultPos;
+    resultVector->copyFromVectorData(resultPos, srcVector, srcPos);
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/expression_evaluator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/expression_evaluator.cpp
new file mode 100644
index 0000000000..1d2b2fdf95
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/expression_evaluator.cpp
@@ -0,0 +1,59 @@
+#include "expression_evaluator/expression_evaluator.h"
+
+#include "common/exception/runtime.h"
+#include "main/client_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace evaluator {
+
+void ExpressionEvaluator::init(const processor::ResultSet& resultSet,
+    main::ClientContext* clientContext) {
+    localState.clientContext = clientContext;
+    for (auto& child : children) {
+        child->init(resultSet, clientContext);
+    }
+    resolveResultVector(resultSet, storage::MemoryManager::Get(*clientContext));
+}
+
+void ExpressionEvaluator::resolveResultStateFromChildren(
+    const std::vector<ExpressionEvaluator*>& inputEvaluators) {
+    if (resultVector->state != nullptr) {
+        return;
+    }
+    for (auto& input : inputEvaluators) {
+        if (!input->isResultFlat()) {
+            isResultFlat_ = false;
+            resultVector->setState(input->resultVector->state);
+            return;
+        }
+    }
+    // All children are flat.
+    isResultFlat_ = true;
+    // We need to leave capacity for multiple evaluations
+    resultVector->setState(std::make_shared<DataChunkState>());
+    resultVector->state->initOriginalAndSelectedSize(1);
+    resultVector->state->setToFlat();
+}
+
+void ExpressionEvaluator::evaluate(common::sel_t) {
+    // LCOV_EXCL_START
+    throw RuntimeException(stringFormat("Cannot evaluate expression {} with count. This should "
+                                        "never happen.",
+        expression->toString()));
+    // LCOV_EXCL_STOP
+}
+
+bool ExpressionEvaluator::select(common::SelectionVector& selVector,
+    bool shouldSetSelVectorToFiltered) {
+    bool ret = selectInternal(selVector);
+    if (shouldSetSelVectorToFiltered && selVector.isUnfiltered()) {
+        selVector.setToFiltered();
+    }
+    return ret;
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/expression_evaluator_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/expression_evaluator_utils.cpp
new file mode 100644
index 0000000000..1fee13ab8f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/expression_evaluator_utils.cpp
@@ -0,0 +1,25 @@
+#include "expression_evaluator/expression_evaluator_utils.h"
+
+#include "common/types/value/value.h"
+#include "processor/expression_mapper.h"
+
+using namespace lbug::common;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace evaluator {
+
+Value ExpressionEvaluatorUtils::evaluateConstantExpression(
+    std::shared_ptr<binder::Expression> expression, main::ClientContext* clientContext) {
+    auto exprMapper = ExpressionMapper();
+    auto evaluator = exprMapper.getConstantEvaluator(expression);
+    auto emptyResultSet = std::make_unique<ResultSet>(0);
+    evaluator->init(*emptyResultSet, clientContext);
+    evaluator->evaluate();
+    auto& selVector = evaluator->resultVector->state->getSelVector();
+    KU_ASSERT(selVector.getSelSize() == 1);
+    return *evaluator->resultVector->getAsValue(selVector[0]);
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/expression_evaluator_visitor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/expression_evaluator_visitor.cpp
new file mode 100644
index 0000000000..669b1f50d7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/expression_evaluator_visitor.cpp
@@ -0,0 +1,67 @@
+#include "expression_evaluator/expression_evaluator_visitor.h"
+
+#include "expression_evaluator/case_evaluator.h"
+
+namespace lbug {
+namespace evaluator {
+
+void ExpressionEvaluatorVisitor::visitSwitch(ExpressionEvaluator* evaluator) {
+    switch (evaluator->getEvaluatorType()) {
+    case EvaluatorType::CASE_ELSE: {
+        visitCase(evaluator);
+    } break;
+    case EvaluatorType::FUNCTION: {
+        visitFunction(evaluator);
+    } break;
+    case EvaluatorType::LAMBDA_PARAM: {
+        visitLambdaParam(evaluator);
+    } break;
+    case EvaluatorType::LIST_LAMBDA: {
+        visitListLambda(evaluator);
+    } break;
+    case EvaluatorType::LITERAL: {
+        visitLiteral(evaluator);
+    } break;
+    case EvaluatorType::PATH: {
+        visitPath(evaluator);
+    } break;
+    case EvaluatorType::NODE_REL: {
+        visitPattern(evaluator);
+    } break;
+    case EvaluatorType::REFERENCE: {
+        visitReference(evaluator);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void LambdaParamEvaluatorCollector::visit(ExpressionEvaluator* evaluator) {
+    std::vector<ExpressionEvaluator*> children;
+    switch (evaluator->getEvaluatorType()) {
+    case EvaluatorType::CASE_ELSE: {
+        auto& caseEvaluator = evaluator->constCast<CaseExpressionEvaluator>();
+        children.push_back(caseEvaluator.getElseEvaluator());
+        for (auto& alternativeEvaluator : caseEvaluator.getAlternativeEvaluators()) {
+            children.push_back(alternativeEvaluator.whenEvaluator.get());
+            children.push_back(alternativeEvaluator.thenEvaluator.get());
+        }
+    } break;
+    case EvaluatorType::LAMBDA_PARAM: {
+        evaluators.push_back(evaluator);
+        return;
+    }
+    default: {
+        for (auto& child : evaluator->getChildren()) {
+            children.push_back(child.get());
+        }
+    }
+    }
+    for (auto& child : children) {
+        visit(child);
+        visitSwitch(child);
+    }
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/function_evaluator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/function_evaluator.cpp
new file mode 100644
index 0000000000..cc1802de0c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/function_evaluator.cpp
@@ -0,0 +1,81 @@
+#include "expression_evaluator/function_evaluator.h"
+
+#include "binder/expression/scalar_function_expression.h"
+#include "function/sequence/sequence_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::processor;
+using namespace lbug::storage;
+using namespace lbug::main;
+using namespace lbug::binder;
+using namespace lbug::function;
+
+namespace lbug {
+namespace evaluator {
+
+FunctionExpressionEvaluator::FunctionExpressionEvaluator(std::shared_ptr<Expression> expression,
+    std::vector<std::unique_ptr<ExpressionEvaluator>> children)
+    : ExpressionEvaluator{type_, std::move(expression), std::move(children)} {
+    auto& functionExpr = this->expression->constCast<ScalarFunctionExpression>();
+    function = functionExpr.getFunction().copy();
+    bindData = functionExpr.getBindData()->copy();
+}
+
+void FunctionExpressionEvaluator::evaluate() {
+    auto ctx = localState.clientContext;
+    for (auto& child : children) {
+        child->evaluate();
+    }
+    if (function->execFunc != nullptr) {
+        bindData->clientContext = ctx;
+        runExecFunc(bindData.get());
+    }
+}
+
+void FunctionExpressionEvaluator::evaluate(common::sel_t count) {
+    KU_ASSERT(expression->constCast<ScalarFunctionExpression>().getFunction().name ==
+              NextValFunction::name);
+    for (auto& child : children) {
+        child->evaluate(count);
+    }
+    bindData->count = count;
+    bindData->clientContext = localState.clientContext;
+    runExecFunc(bindData.get());
+}
+
+bool FunctionExpressionEvaluator::selectInternal(SelectionVector& selVector) {
+    for (auto& child : children) {
+        child->evaluate();
+    }
+    // Temporary code path for function whose return type is BOOL but select interface is not
+    // implemented (e.g. list_contains). We should remove this if statement eventually.
+    if (function->selectFunc == nullptr) {
+        KU_ASSERT(resultVector->dataType.getLogicalTypeID() == LogicalTypeID::BOOL);
+        runExecFunc();
+        return updateSelectedPos(selVector);
+    }
+    return function->selectFunc(parameters, selVector, bindData.get());
+}
+
+void FunctionExpressionEvaluator::runExecFunc(void* dataPtr) {
+    function->execFunc(parameters, common::SelectionVector::fromValueVectors(parameters),
+        *resultVector, resultVector->getSelVectorPtr(), dataPtr);
+}
+
+void FunctionExpressionEvaluator::resolveResultVector(const ResultSet& /*resultSet*/,
+    MemoryManager* memoryManager) {
+    resultVector = std::make_shared<ValueVector>(expression->dataType.copy(), memoryManager);
+    std::vector<ExpressionEvaluator*> inputEvaluators;
+    inputEvaluators.reserve(children.size());
+    for (auto& child : children) {
+        parameters.push_back(child->resultVector);
+        inputEvaluators.push_back(child.get());
+    }
+    resolveResultStateFromChildren(inputEvaluators);
+    if (function->compileFunc != nullptr) {
+        function->compileFunc(bindData.get(), parameters, resultVector);
+    }
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/lambda_evaluator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/lambda_evaluator.cpp
new file mode 100644
index 0000000000..7e809b59d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/lambda_evaluator.cpp
@@ -0,0 +1,120 @@
+#include "expression_evaluator/lambda_evaluator.h"
+
+#include "binder/expression/lambda_expression.h"
+#include "common/exception/runtime.h"
+#include "expression_evaluator/expression_evaluator_visitor.h"
+#include "expression_evaluator/list_slice_info.h"
+#include "function/list/vector_list_functions.h"
+#include "main/client_context.h"
+#include "parser/expression/parsed_lambda_expression.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::processor;
+using namespace lbug::main;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace evaluator {
+
+void ListLambdaEvaluator::init(const ResultSet& resultSet, ClientContext* clientContext) {
+    for (auto& child : children) {
+        child->init(resultSet, clientContext);
+    }
+    KU_ASSERT(children.size() == 1);
+    auto listInputVector = children[0]->resultVector.get();
+    // Find all param in lambda, e.g. find x in x->x+1
+    auto collector = LambdaParamEvaluatorCollector();
+    collector.visit(lambdaRootEvaluator.get());
+    auto evaluators = collector.getEvaluators();
+    auto lambdaVarState = std::make_shared<DataChunkState>();
+    memoryManager = MemoryManager::Get(*clientContext);
+    for (auto& evaluator : evaluators) {
+        // For list_filter, list_transform:
+        // The resultVector of lambdaEvaluator should be the list dataVector.
+        // For list_reduce:
+        // We should create two vectors for each lambda variable resultVector since we are going to
+        // update the list elements during execution.
+        evaluator->resultVector =
+            listLambdaType != ListLambdaType::LIST_REDUCE ?
+                ListVector::getSharedDataVector(listInputVector) :
+                std::make_shared<ValueVector>(
+                    ListType::getChildType(listInputVector->dataType).copy(), memoryManager);
+        evaluator->resultVector->state = lambdaVarState;
+        lambdaParamEvaluators.push_back(evaluator->ptrCast<LambdaParamEvaluator>());
+    }
+    lambdaRootEvaluator->init(resultSet, clientContext);
+    resolveResultVector(resultSet, memoryManager);
+    params.push_back(children[0]->resultVector);
+    params.push_back(lambdaRootEvaluator->resultVector);
+    auto paramIndices = getParamIndices();
+    bindData = ListLambdaBindData{lambdaParamEvaluators, paramIndices, lambdaRootEvaluator.get()};
+}
+
+void ListLambdaEvaluator::evaluateInternal() {
+    auto* inputVector = params[0].get();
+    if (resultVector->dataType.getPhysicalType() == PhysicalTypeID::LIST) {
+        ListVector::resizeDataVector(resultVector.get(),
+            ListVector::getDataVectorSize(inputVector));
+    }
+    ListSliceInfo sliceInfo{inputVector};
+    bindData.sliceInfo = &sliceInfo;
+    auto selVectors = SelectionVector::fromValueVectors(params);
+    do {
+        sliceInfo.nextSlice();
+        execFunc(params, selVectors, *resultVector, resultVector->getSelVectorPtr(), &bindData);
+    } while (!sliceInfo.done());
+}
+
+void ListLambdaEvaluator::evaluate() {
+    KU_ASSERT(children.size() == 1);
+    children[0]->evaluate();
+    evaluateInternal();
+}
+
+bool ListLambdaEvaluator::selectInternal(SelectionVector& selVector) {
+    KU_ASSERT(children.size() == 1);
+    children[0]->evaluate();
+    evaluateInternal();
+    return updateSelectedPos(selVector);
+}
+
+void ListLambdaEvaluator::resolveResultVector(const ResultSet&, MemoryManager* memoryManager) {
+    resultVector = std::make_shared<ValueVector>(expression->getDataType().copy(), memoryManager);
+    resultVector->state = children[0]->resultVector->state;
+    isResultFlat_ = children[0]->isResultFlat();
+}
+
+std::vector<idx_t> ListLambdaEvaluator::getParamIndices() {
+    const auto& paramNames = getExpression()
+                                 ->getChild(1)
+                                 ->constCast<binder::LambdaExpression>()
+                                 .getParsedLambdaExpr()
+                                 ->constCast<parser::ParsedLambdaExpression>()
+                                 .getVarNames();
+    std::vector<idx_t> index(lambdaParamEvaluators.size());
+    for (idx_t i = 0; i < lambdaParamEvaluators.size(); i++) {
+        auto paramName = lambdaParamEvaluators[i]->getVarName();
+        auto it = std::find(paramNames.begin(), paramNames.end(), paramName);
+        if (it != paramNames.end()) {
+            index[i] = it - paramNames.begin();
+        } else {
+            throw RuntimeException(stringFormat("Lambda paramName {} cannot found.", paramName));
+        }
+    }
+    return index;
+}
+ListLambdaType ListLambdaEvaluator::checkListLambdaTypeWithFunctionName(std::string functionName) {
+    if (0 == functionName.compare(function::ListTransformFunction::name)) {
+        return ListLambdaType::LIST_TRANSFORM;
+    } else if (0 == functionName.compare(function::ListFilterFunction::name)) {
+        return ListLambdaType::LIST_FILTER;
+    } else if (0 == functionName.compare(function::ListReduceFunction::name)) {
+        return ListLambdaType::LIST_REDUCE;
+    } else {
+        return ListLambdaType::DEFAULT;
+    }
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/list_slice_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/list_slice_info.cpp
new file mode 100644
index 0000000000..7d24f4e70f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/list_slice_info.cpp
@@ -0,0 +1,106 @@
+
+#include "expression_evaluator/list_slice_info.h"
+
+#include "common/system_config.h"
+#include "expression_evaluator/lambda_evaluator.h"
+
+namespace lbug {
+namespace evaluator {
+
+ListEntryTracker::ListEntryTracker(common::ValueVector* listVector)
+    : listVector(listVector), listEntryIdx(0), offsetInList(0),
+      listEntries(listVector->state->getSelSize()) {
+    // it is not guaranteed that the list entries in a list vector are sorted by offset (the
+    // case evaluator breaks this) so we need to sort it manually
+    for (common::sel_t i = 0; i < listVector->state->getSelSize(); ++i) {
+        listEntries[i] = listVector->state->getSelVector()[i];
+    }
+    std::sort(listEntries.begin(), listEntries.end(), [listVector](const auto a, const auto b) {
+        return listVector->getValue<common::list_entry_t>(a).offset <
+               listVector->getValue<common::list_entry_t>(b).offset;
+    });
+    updateListEntry();
+}
+
+common::offset_t ListEntryTracker::getNextDataOffset() {
+    ++offsetInList;
+    if (offsetInList >= getCurListEntry().size) {
+        ++listEntryIdx;
+        updateListEntry();
+        offsetInList = 0;
+        if (done()) {
+            return common::INVALID_OFFSET;
+        }
+    }
+    return getCurDataOffset();
+}
+
+void ListEntryTracker::updateListEntry() {
+    while (true) {
+        if (listEntryIdx >= listEntries.size()) {
+            break;
+        }
+        const auto newEntry = listVector->getValue<common::list_entry_t>(getListEntryPos());
+        if (!listVector->isNull(getListEntryPos()) && newEntry.size > 0) {
+            break;
+        }
+        ++listEntryIdx;
+    }
+}
+
+std::vector<std::shared_ptr<common::DataChunkState>> ListSliceInfo::overrideAndSaveParamStates(
+    std::span<LambdaParamEvaluator*> lambdaParamEvaluators) {
+    std::vector<std::shared_ptr<common::DataChunkState>> savedStates;
+
+    // The sel states of the result vectors in evaluator trees often point to the same state
+    // First set the states to the unfiltered slice size
+    // This makes sure upstream evaluators have the correct input size and don't use the sliced
+    // offset
+    for (auto& lambdaParamEvaluator : lambdaParamEvaluators) {
+        auto param = lambdaParamEvaluator->resultVector.get();
+        param->state->getSelVectorUnsafe().setToUnfiltered(getSliceSize());
+        savedStates.push_back(param->state);
+    }
+
+    // Then override the output sel state of the param's result vector
+    // This will be a list data vector that we need to get data from using the sliced offset
+    for (auto& lambdaParamEvaluator : lambdaParamEvaluators) {
+        auto param = lambdaParamEvaluator->resultVector.get();
+        param->state = sliceDataState;
+    }
+    return savedStates;
+}
+
+bool ListSliceInfo::done() const {
+    return listEntryTracker.done();
+}
+
+void ListSliceInfo::restoreParamStates(
+    std::span<evaluator::LambdaParamEvaluator*> lambdaParamEvaluators,
+    std::vector<std::shared_ptr<common::DataChunkState>> savedStates) {
+    for (size_t i = 0; i < lambdaParamEvaluators.size(); ++i) {
+        auto param = lambdaParamEvaluators[i]->resultVector.get();
+        param->state = savedStates[i];
+    }
+}
+
+void ListSliceInfo::nextSlice() {
+    updateSelVector();
+}
+
+void ListSliceInfo::updateSelVector() {
+    auto& dataSel = sliceDataState->getSelVectorUnsafe();
+    auto& listEntrySel = sliceListEntryState->getSelVectorUnsafe();
+    common::offset_t sliceSize = 0;
+    while (!listEntryTracker.done() && sliceSize < common::DEFAULT_VECTOR_CAPACITY) {
+        dataSel[sliceSize] = listEntryTracker.getCurDataOffset();
+        listEntrySel[sliceSize] = listEntryTracker.getListEntryPos();
+        listEntryTracker.getNextDataOffset();
+        ++sliceSize;
+    }
+    dataSel.setSelSize(sliceSize);
+    listEntrySel.setSelSize(sliceSize);
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/literal_evaluator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/literal_evaluator.cpp
new file mode 100644
index 0000000000..f11db492ab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/literal_evaluator.cpp
@@ -0,0 +1,43 @@
+#include "expression_evaluator/literal_evaluator.h"
+
+#include "common/types/value/value.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::main;
+
+namespace lbug {
+namespace evaluator {
+
+void LiteralExpressionEvaluator::evaluate() {}
+
+void LiteralExpressionEvaluator::evaluate(sel_t count) {
+    unFlatState->getSelVectorUnsafe().setSelSize(count);
+    resultVector->setState(unFlatState);
+    for (auto i = 1ul; i < count; i++) {
+        resultVector->copyFromVectorData(i, resultVector.get(), 0);
+    }
+}
+
+bool LiteralExpressionEvaluator::selectInternal(SelectionVector&) {
+    KU_ASSERT(resultVector->dataType.getLogicalTypeID() == LogicalTypeID::BOOL);
+    auto pos = resultVector->state->getSelVector()[0];
+    KU_ASSERT(pos == 0u);
+    return resultVector->getValue<bool>(pos) && (!resultVector->isNull(pos));
+}
+
+void LiteralExpressionEvaluator::resolveResultVector(const processor::ResultSet& /*resultSet*/,
+    MemoryManager* memoryManager) {
+    resultVector = std::make_shared<ValueVector>(value.getDataType().copy(), memoryManager);
+    flatState = DataChunkState::getSingleValueDataChunkState();
+    unFlatState = std::make_shared<DataChunkState>();
+    resultVector->setState(flatState);
+    if (value.isNull()) {
+        resultVector->setNull(0 /* pos */, true);
+    } else {
+        resultVector->copyFromValue(resultVector->state->getSelVector()[0], value);
+    }
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/path_evaluator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/path_evaluator.cpp
new file mode 100644
index 0000000000..b654b19eac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/path_evaluator.cpp
@@ -0,0 +1,227 @@
+#include "expression_evaluator/path_evaluator.h"
+
+#include "binder/expression/path_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "common/string_utils.h"
+
+using namespace lbug::main;
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace evaluator {
+
+// For each result field vector, find its corresponding input field vector if exist.
+static std::vector<ValueVector*> getFieldVectors(const LogicalType& inputType,
+    const LogicalType& resultType, ValueVector* inputVector) {
+    std::vector<ValueVector*> result;
+    for (auto& field : StructType::getFields(resultType)) {
+        auto fieldName = StringUtils::getUpper(field.getName());
+        if (StructType::hasField(inputType, fieldName)) {
+            auto idx = StructType::getFieldIdx(inputType, fieldName);
+            result.push_back(StructVector::getFieldVector(inputVector, idx).get());
+        } else {
+            result.push_back(nullptr);
+        }
+    }
+    return result;
+}
+
+void PathExpressionEvaluator::init(const processor::ResultSet& resultSet,
+    main::ClientContext* clientContext) {
+    ExpressionEvaluator::init(resultSet, clientContext);
+    auto resultNodesIdx = StructType::getFieldIdx(resultVector->dataType, InternalKeyword::NODES);
+    resultNodesVector = StructVector::getFieldVector(resultVector.get(), resultNodesIdx).get();
+    auto resultNodesDataVector = ListVector::getDataVector(resultNodesVector);
+    for (auto& fieldVector : StructVector::getFieldVectors(resultNodesDataVector)) {
+        resultNodesFieldVectors.push_back(fieldVector.get());
+    }
+    auto resultRelsIdx = StructType::getFieldIdx(resultVector->dataType, InternalKeyword::RELS);
+    resultRelsVector = StructVector::getFieldVector(resultVector.get(), resultRelsIdx).get();
+    auto resultRelsDataVector = ListVector::getDataVector(resultRelsVector);
+    for (auto& fieldVector : StructVector::getFieldVectors(resultRelsDataVector)) {
+        resultRelsFieldVectors.push_back(fieldVector.get());
+    }
+    auto pathExpression = (PathExpression*)expression.get();
+    for (auto i = 0u; i < expression->getNumChildren(); ++i) {
+        auto child = expression->getChild(i).get();
+        auto vectors = std::make_unique<InputVectors>();
+        vectors->input = children[i]->resultVector.get();
+        switch (child->dataType.getLogicalTypeID()) {
+        case LogicalTypeID::NODE: {
+            vectors->nodeFieldVectors =
+                getFieldVectors(child->dataType, pathExpression->getNodeType(), vectors->input);
+        } break;
+        case LogicalTypeID::REL: {
+            vectors->relFieldVectors =
+                getFieldVectors(child->dataType, pathExpression->getRelType(), vectors->input);
+        } break;
+        case LogicalTypeID::RECURSIVE_REL: {
+            auto rel = (RelExpression*)child;
+            auto recursiveNode = rel->getRecursiveInfo()->node;
+            auto recursiveRel = rel->getRecursiveInfo()->rel;
+            auto nodeFieldIdx = StructType::getFieldIdx(child->dataType, InternalKeyword::NODES);
+            vectors->nodesInput = StructVector::getFieldVector(vectors->input, nodeFieldIdx).get();
+            vectors->nodesDataInput = ListVector::getDataVector(vectors->nodesInput);
+            vectors->nodeFieldVectors = getFieldVectors(recursiveNode->dataType,
+                pathExpression->getNodeType(), vectors->nodesDataInput);
+            auto relFieldIdx =
+                StructType::getFieldIdx(vectors->input->dataType, InternalKeyword::RELS);
+            vectors->relsInput = StructVector::getFieldVector(vectors->input, relFieldIdx).get();
+            vectors->relsDataInput = ListVector::getDataVector(vectors->relsInput);
+            vectors->relFieldVectors = getFieldVectors(recursiveRel->dataType,
+                pathExpression->getRelType(), vectors->relsDataInput);
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+        inputVectorsPerChild.push_back(std::move(vectors));
+    }
+}
+
+void PathExpressionEvaluator::evaluate() {
+    resultVector->resetAuxiliaryBuffer();
+    for (auto& child : children) {
+        child->evaluate();
+    }
+    auto& selVector = resultVector->state->getSelVector();
+    for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+        auto pos = selVector[i];
+        auto numRels = copyRels(pos);
+        copyNodes(pos, numRels == 0);
+    }
+}
+
+static inline uint32_t getCurrentPos(ValueVector* vector, uint32_t pos) {
+    if (vector->state->isFlat()) {
+        return vector->state->getSelVector()[0];
+    }
+    return pos;
+}
+
+void PathExpressionEvaluator::copyNodes(sel_t resultPos, bool isEmptyRels) {
+    auto listSize = 0u;
+    // Calculate list size.
+    for (auto i = 0u; i < expression->getNumChildren(); ++i) {
+        auto child = expression->getChild(i).get();
+        switch (child->dataType.getLogicalTypeID()) {
+        case LogicalTypeID::NODE: {
+            listSize++;
+        } break;
+        case LogicalTypeID::RECURSIVE_REL: {
+            auto vectors = inputVectorsPerChild[i].get();
+            auto inputPos = getCurrentPos(vectors->input, resultPos);
+            listSize += vectors->nodesInput->getValue<list_entry_t>(inputPos).size;
+        } break;
+        default:
+            break;
+        }
+    }
+    if (isEmptyRels) {
+        listSize = 1;
+    }
+    // Add list entry.
+    auto entry = ListVector::addList(resultNodesVector, listSize);
+    resultNodesVector->setValue(resultPos, entry);
+    // Copy field vectors
+    offset_t resultDataPos = entry.offset;
+    auto numChildrenToCopy = isEmptyRels ? 1 : expression->getNumChildren();
+    for (auto i = 0u; i < numChildrenToCopy; ++i) {
+        auto child = expression->getChild(i).get();
+        auto vectors = inputVectorsPerChild[i].get();
+        auto inputPos = getCurrentPos(vectors->input, resultPos);
+        switch (child->dataType.getLogicalTypeID()) {
+        case LogicalTypeID::NODE: {
+            copyFieldVectors(inputPos, vectors->nodeFieldVectors, resultDataPos,
+                resultNodesFieldVectors);
+        } break;
+        case LogicalTypeID::RECURSIVE_REL: {
+            auto& listEntry = vectors->nodesInput->getValue<list_entry_t>(inputPos);
+            for (auto j = 0u; j < listEntry.size; ++j) {
+                copyFieldVectors(listEntry.offset + j, vectors->nodeFieldVectors, resultDataPos,
+                    resultNodesFieldVectors);
+            }
+        } break;
+        default:
+            break;
+        }
+    }
+}
+
+uint64_t PathExpressionEvaluator::copyRels(sel_t resultPos) {
+    auto listSize = 0u;
+    // Calculate list size.
+    for (auto i = 0u; i < expression->getNumChildren(); ++i) {
+        auto child = expression->getChild(i).get();
+        switch (child->dataType.getLogicalTypeID()) {
+        case LogicalTypeID::REL: {
+            listSize++;
+        } break;
+        case LogicalTypeID::RECURSIVE_REL: {
+            auto vectors = inputVectorsPerChild[i].get();
+            auto inputPos = getCurrentPos(vectors->input, resultPos);
+            listSize += vectors->relsInput->getValue<list_entry_t>(inputPos).size;
+        } break;
+        default:
+            break;
+        }
+    }
+    // Add list entry.
+    auto entry = ListVector::addList(resultRelsVector, listSize);
+    resultRelsVector->setValue(resultPos, entry);
+    // Copy field vectors
+    offset_t resultDataPos = entry.offset;
+    for (auto i = 0u; i < expression->getNumChildren(); ++i) {
+        auto child = expression->getChild(i).get();
+        auto vectors = inputVectorsPerChild[i].get();
+        auto inputPos = getCurrentPos(vectors->input, resultPos);
+        switch (child->dataType.getLogicalTypeID()) {
+        case LogicalTypeID::REL: {
+            copyFieldVectors(inputPos, vectors->relFieldVectors, resultDataPos,
+                resultRelsFieldVectors);
+        } break;
+        case LogicalTypeID::RECURSIVE_REL: {
+            auto& listEntry = vectors->relsInput->getValue<list_entry_t>(inputPos);
+            for (auto j = 0u; j < listEntry.size; ++j) {
+                copyFieldVectors(listEntry.offset + j, vectors->relFieldVectors, resultDataPos,
+                    resultRelsFieldVectors);
+            }
+        } break;
+        default:
+            break;
+        }
+    }
+    return listSize;
+}
+
+void PathExpressionEvaluator::copyFieldVectors(offset_t inputVectorPos,
+    const std::vector<ValueVector*>& inputFieldVectors, offset_t& resultVectorPos,
+    const std::vector<ValueVector*>& resultFieldVectors) {
+    KU_ASSERT(resultFieldVectors.size() == inputFieldVectors.size());
+    for (auto i = 0u; i < inputFieldVectors.size(); ++i) {
+        auto inputFieldVector = inputFieldVectors[i];
+        auto resultFieldVector = resultFieldVectors[i];
+        if (inputFieldVector == nullptr || inputFieldVector->isNull(inputVectorPos)) {
+            resultFieldVector->setNull(resultVectorPos, true);
+            continue;
+        }
+        resultFieldVector->setNull(resultVectorPos, false);
+        KU_ASSERT(inputFieldVector->dataType == resultFieldVector->dataType);
+        resultFieldVector->copyFromVectorData(resultVectorPos, inputFieldVector, inputVectorPos);
+    }
+    resultVectorPos++;
+}
+
+void PathExpressionEvaluator::resolveResultVector(const processor::ResultSet& /*resultSet*/,
+    storage::MemoryManager* memoryManager) {
+    resultVector = std::make_shared<ValueVector>(expression->getDataType().copy(), memoryManager);
+    std::vector<ExpressionEvaluator*> inputEvaluators;
+    inputEvaluators.reserve(children.size());
+    for (auto& child : children) {
+        inputEvaluators.push_back(child.get());
+    }
+    resolveResultStateFromChildren(inputEvaluators);
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/pattern_evaluator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/pattern_evaluator.cpp
new file mode 100644
index 0000000000..3fb1245244
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/pattern_evaluator.cpp
@@ -0,0 +1,88 @@
+#include "expression_evaluator/pattern_evaluator.h"
+
+#include "common/constants.h"
+#include "function/struct/vector_struct_functions.h"
+
+using namespace lbug::storage;
+using namespace lbug::main;
+using namespace lbug::common;
+using namespace lbug::function;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace evaluator {
+
+static void updateNullPattern(ValueVector& patternVector, const ValueVector& idVector) {
+    // If internal id is NULL, we should mark entire struct/node/rel as NULL.
+    for (auto i = 0u; i < patternVector.state->getSelVector().getSelSize(); ++i) {
+        auto pos = patternVector.state->getSelVector()[i];
+        patternVector.setNull(pos, idVector.isNull(pos));
+    }
+}
+
+void PatternExpressionEvaluator::evaluate() {
+    for (auto& child : children) {
+        child->evaluate();
+    }
+    StructPackFunctions::execFunc(parameters, SelectionVector::fromValueVectors(parameters),
+        *resultVector, resultVector->getSelVectorPtr());
+    updateNullPattern(*resultVector, *idVector);
+}
+
+void PatternExpressionEvaluator::resolveResultVector(const ResultSet& resultSet,
+    MemoryManager* memoryManager) {
+    const auto& dataType = expression->getDataType();
+    resultVector = std::make_shared<ValueVector>(dataType.copy(), memoryManager);
+    std::vector<ExpressionEvaluator*> inputEvaluators;
+    inputEvaluators.reserve(children.size());
+    for (auto& child : children) {
+        parameters.push_back(child->resultVector);
+        inputEvaluators.push_back(child.get());
+    }
+    resolveResultStateFromChildren(inputEvaluators);
+    initFurther(resultSet);
+}
+
+void PatternExpressionEvaluator::initFurther(const ResultSet&) {
+    StructPackFunctions::compileFunc(nullptr, parameters, resultVector);
+    const auto& dataType = expression->getDataType();
+    auto fieldIdx = StructType::getFieldIdx(dataType.copy(), InternalKeyword::ID);
+    KU_ASSERT(fieldIdx != INVALID_STRUCT_FIELD_IDX);
+    idVector = StructVector::getFieldVector(resultVector.get(), fieldIdx).get();
+}
+
+void UndirectedRelExpressionEvaluator::evaluate() {
+    for (auto& child : children) {
+        child->evaluate();
+    }
+    StructPackFunctions::undirectedRelPackExecFunc(parameters, *resultVector);
+    updateNullPattern(*resultVector, *idVector);
+    directionEvaluator->evaluate();
+    auto& selVector = resultVector->state->getSelVector();
+    for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+        if (!directionVector->getValue<bool>(directionVector->state->getSelVector()[i])) {
+            continue;
+        }
+        auto pos = selVector[i];
+        auto srcID = srcIDVector->getValue<internalID_t>(pos);
+        auto dstID = dstIDVector->getValue<internalID_t>(pos);
+        srcIDVector->setValue(pos, dstID);
+        dstIDVector->setValue(pos, srcID);
+    }
+}
+
+void UndirectedRelExpressionEvaluator::initFurther(const ResultSet& resultSet) {
+    directionEvaluator->init(resultSet, localState.clientContext);
+    directionVector = directionEvaluator->resultVector.get();
+    StructPackFunctions::undirectedRelCompileFunc(nullptr, parameters, resultVector);
+    const auto& dataType = expression->getDataType();
+    auto idFieldIdx = StructType::getFieldIdx(dataType, InternalKeyword::ID);
+    auto srcFieldIdx = StructType::getFieldIdx(dataType, InternalKeyword::SRC);
+    auto dstFieldIdx = StructType::getFieldIdx(dataType, InternalKeyword::DST);
+    idVector = StructVector::getFieldVector(resultVector.get(), idFieldIdx).get();
+    srcIDVector = StructVector::getFieldVector(resultVector.get(), srcFieldIdx).get();
+    dstIDVector = StructVector::getFieldVector(resultVector.get(), dstFieldIdx).get();
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/reference_evaluator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/reference_evaluator.cpp
new file mode 100644
index 0000000000..1f40db48e8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/expression_evaluator/reference_evaluator.cpp
@@ -0,0 +1,34 @@
+#include "expression_evaluator/reference_evaluator.h"
+
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace evaluator {
+
+inline static bool isTrue(ValueVector& vector, uint64_t pos) {
+    KU_ASSERT(vector.dataType.getLogicalTypeID() == LogicalTypeID::BOOL);
+    return !vector.isNull(pos) && vector.getValue<bool>(pos);
+}
+
+bool ReferenceExpressionEvaluator::selectInternal(SelectionVector& selVector) {
+    uint64_t numSelectedValues = 0;
+    auto selectedBuffer = resultVector->state->getSelVectorUnsafe().getMutableBuffer();
+    if (resultVector->state->getSelVector().isUnfiltered()) {
+        for (auto i = 0u; i < resultVector->state->getSelVector().getSelSize(); i++) {
+            selectedBuffer[numSelectedValues] = i;
+            numSelectedValues += isTrue(*resultVector, i);
+        }
+    } else {
+        for (auto i = 0u; i < resultVector->state->getSelVector().getSelSize(); i++) {
+            auto pos = resultVector->state->getSelVector()[i];
+            selectedBuffer[numSelectedValues] = pos;
+            numSelectedValues += isTrue(*resultVector, pos);
+        }
+    }
+    selVector.setSelSize(numSelectedValues);
+    return numSelectedValues > 0;
+}
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/extension/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/CMakeLists.txt
new file mode 100644
index 0000000000..b3ff980655
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/CMakeLists.txt
@@ -0,0 +1,70 @@
+set(INCLUDES "")
+set(LOAD_LINKED_EXTENSION "")
+
+foreach (EXT_NAME IN LISTS STATICALLY_LINKED_EXTENSIONS)
+    string(TOLOWER "${EXT_NAME}" EXT_NAME_LOWER)
+    # Convert to camel case
+    string(REPLACE "_" ";" EXT_NAME_SPLIT ${EXT_NAME})
+    set(EXT_NAME_CAMELCASE "")
+    foreach (EXT_NAME_PART IN LISTS EXT_NAME_SPLIT)
+        string(SUBSTRING ${EXT_NAME_PART} 0 1 FIRST_LETTER)
+        string(SUBSTRING ${EXT_NAME_PART} 1 -1 REMAINDER)
+        string(TOUPPER ${FIRST_LETTER} FIRST_LETTER)
+        set(EXT_NAME_CAMELCASE "${EXT_NAME_CAMELCASE}${FIRST_LETTER}${REMAINDER}")
+    endforeach ()
+
+    set(LOAD_LINKED_EXTENSION "${LOAD_LINKED_EXTENSION}\
+{
+        ${EXT_NAME_LOWER}_extension::${EXT_NAME_CAMELCASE}Extension extension{};
+        extension.load(context);
+        loadedExtensions.push_back(LoadedExtension(${EXT_NAME_LOWER}_extension::${EXT_NAME_CAMELCASE}Extension::EXTENSION_NAME, \" \",
+            ExtensionSource::STATIC_LINKED));
+    }\n")
+    include_directories(${PROJECT_SOURCE_DIR}/extension/${EXT_NAME}/src/include/main)
+    set(INCLUDES "${INCLUDES}#include \"${EXT_NAME_LOWER}_extension.h\"\n")
+endforeach ()
+
+configure_file(
+        "generated_extension_loader.h.in"
+        "${CMAKE_CURRENT_BINARY_DIR}/codegen/include/generated_extension_loader.h"
+        @ONLY
+)
+
+configure_file(
+        "generated_extension_loader.cpp.in"
+        "${CMAKE_CURRENT_BINARY_DIR}/codegen/generated_extension_loader.cpp"
+        @ONLY
+)
+
+set(GENERATED_CPP_FILE
+        ${CMAKE_CURRENT_BINARY_DIR}/codegen/generated_extension_loader.cpp)
+
+include_directories(
+        "${CMAKE_CURRENT_BINARY_DIR}/codegen/include/"
+        ${PROJECT_SOURCE_DIR}/third_party/httplib
+)
+
+add_library(lbug_generated_extension_loader OBJECT ${GENERATED_CPP_FILE})
+
+# Both the lbug source and httpfs extension includes the httplib which is a header
+# only library. Httpfs requires the openssl function to be enabled in httplib, so
+# we also have to enable httplib there if httpfs is static linked.
+if ("httpfs" IN_LIST STATICALLY_LINKED_EXTENSIONS)
+    add_compile_definitions(CPPHTTPLIB_OPENSSL_SUPPORT)
+    include_directories(${OPENSSL_INCLUDE_DIR})
+endif ()
+
+add_library(lbug_extension
+        OBJECT
+        catalog_extension.cpp
+        extension.cpp
+        extension_entries.cpp
+        extension_installer.cpp
+        extension_manager.cpp
+        loaded_extension.cpp
+)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_extension>
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_generated_extension_loader>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/extension/catalog_extension.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/catalog_extension.cpp
new file mode 100644
index 0000000000..2518e71294
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/catalog_extension.cpp
@@ -0,0 +1,12 @@
+#include "extension/catalog_extension.h"
+
+namespace lbug {
+namespace extension {
+
+void CatalogExtension::invalidateCache() {
+    tables = std::make_unique<catalog::CatalogSet>();
+    init();
+}
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension.cpp
new file mode 100644
index 0000000000..9895591f37
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension.cpp
@@ -0,0 +1,247 @@
+#include "extension/extension.h"
+
+#include "common/exception/io.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+#include "common/system_message.h"
+#include "main/client_context.h"
+#include "main/database.h"
+#include "storage/storage_manager.h"
+
+#ifdef _WIN32
+
+#include "windows.h"
+#define RTLD_NOW 0
+#define RTLD_LOCAL 0
+
+#else
+#include <dlfcn.h>
+#endif
+
+namespace lbug {
+namespace extension {
+
+std::string getOS() {
+    std::string os = "linux";
+#if !defined(_GLIBCXX_USE_CXX11_ABI) || _GLIBCXX_USE_CXX11_ABI == 0
+    if (os == "linux") {
+        os = "linux_old";
+    }
+#endif
+#ifdef _WIN32
+    os = "win";
+#elif defined(__APPLE__)
+    os = "osx";
+#endif
+    return os;
+}
+
+std::string getArch() {
+    std::string arch = "amd64";
+#if defined(__i386__) || defined(_M_IX86)
+    arch = "x86";
+#elif defined(__aarch64__) || defined(__ARM_ARCH_ISA_A64)
+    arch = "arm64";
+#endif
+    return arch;
+}
+
+std::string getPlatform() {
+    return getOS() + "_" + getArch();
+}
+
+static ExtensionRepoInfo getExtensionRepoInfo(std::string& extensionURL) {
+    common::StringUtils::replaceAll(extensionURL, "http://", "");
+    auto hostNamePos = extensionURL.find('/');
+    auto hostName = extensionURL.substr(0, hostNamePos);
+    auto hostURL = "http://" + hostName;
+    auto hostPath = extensionURL.substr(hostNamePos);
+    return {hostPath, hostURL, extensionURL};
+}
+
+std::string ExtensionSourceUtils::toString(ExtensionSource source) {
+    switch (source) {
+    case ExtensionSource::OFFICIAL:
+        return "OFFICIAL";
+    case ExtensionSource::USER:
+        return "USER";
+    case ExtensionSource::STATIC_LINKED:
+        return "STATIC LINK";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static ExtensionRepoInfo getExtensionFilePath(const std::string& extensionName,
+    const std::string& extensionRepo, const std::string& fileName) {
+    auto extensionURL = common::stringFormat(ExtensionUtils::EXTENSION_FILE_REPO_PATH,
+        extensionRepo, LBUG_EXTENSION_VERSION, getPlatform(), extensionName, fileName);
+    return getExtensionRepoInfo(extensionURL);
+}
+
+ExtensionRepoInfo ExtensionUtils::getExtensionLibRepoInfo(const std::string& extensionName,
+    const std::string& extensionRepo) {
+    return getExtensionFilePath(extensionName, extensionRepo, getExtensionFileName(extensionName));
+}
+
+ExtensionRepoInfo ExtensionUtils::getExtensionLoaderRepoInfo(const std::string& extensionName,
+    const std::string& extensionRepo) {
+    return getExtensionFilePath(extensionName, extensionRepo,
+        getExtensionFileName(extensionName + EXTENSION_LOADER_SUFFIX));
+}
+
+ExtensionRepoInfo ExtensionUtils::getExtensionInstallerRepoInfo(const std::string& extensionName,
+    const std::string& extensionRepo) {
+    return getExtensionFilePath(extensionName, extensionRepo,
+        getExtensionFileName(extensionName + EXTENSION_INSTALLER_SUFFIX));
+}
+
+ExtensionRepoInfo ExtensionUtils::getSharedLibRepoInfo(const std::string& fileName,
+    const std::string& extensionRepo) {
+    auto extensionURL = common::stringFormat(SHARED_LIB_REPO, extensionRepo, LBUG_EXTENSION_VERSION,
+        getPlatform(), fileName);
+    return getExtensionRepoInfo(extensionURL);
+}
+
+std::string ExtensionUtils::getExtensionFileName(const std::string& name) {
+    return common::stringFormat(EXTENSION_FILE_NAME, common::StringUtils::getLower(name),
+        EXTENSION_FILE_SUFFIX);
+}
+
+std::string ExtensionUtils::getLocalPathForExtensionLib(main::ClientContext* context,
+    const std::string& extensionName) {
+    return common::stringFormat("{}/{}", getLocalDirForExtension(context, extensionName),
+        getExtensionFileName(extensionName));
+}
+
+std::string ExtensionUtils::getLocalPathForExtensionLoader(main::ClientContext* context,
+    const std::string& extensionName) {
+    return common::stringFormat("{}/{}", getLocalDirForExtension(context, extensionName),
+        getExtensionFileName(extensionName + EXTENSION_LOADER_SUFFIX));
+}
+
+std::string ExtensionUtils::getLocalPathForExtensionInstaller(main::ClientContext* context,
+    const std::string& extensionName) {
+    return common::stringFormat("{}/{}", getLocalDirForExtension(context, extensionName),
+        getExtensionFileName(extensionName + EXTENSION_INSTALLER_SUFFIX));
+}
+
+std::string ExtensionUtils::getLocalDirForExtension(main::ClientContext* context,
+    const std::string& extensionName) {
+    return common::stringFormat("{}{}", context->getExtensionDir(), extensionName);
+}
+
+std::string ExtensionUtils::appendLibSuffix(const std::string& libName) {
+    auto os = getOS();
+    std::string suffix;
+    if (os == "linux" || os == "linux_old") {
+        suffix = "so";
+    } else if (os == "osx") {
+        suffix = "dylib";
+    } else {
+        KU_UNREACHABLE;
+    }
+    return common::stringFormat("{}.{}", libName, suffix);
+}
+
+std::string ExtensionUtils::getLocalPathForSharedLib(main::ClientContext* context,
+    const std::string& libName) {
+    return common::stringFormat("{}common/{}", context->getExtensionDir(), libName);
+}
+
+std::string ExtensionUtils::getLocalPathForSharedLib(main::ClientContext* context) {
+    return common::stringFormat("{}common/", context->getExtensionDir());
+}
+
+bool ExtensionUtils::isOfficialExtension(const std::string& extension) {
+    auto extensionUpperCase = common::StringUtils::getUpper(extension);
+    for (auto& officialExtension : OFFICIAL_EXTENSION) {
+        if (officialExtension == extensionUpperCase) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void ExtensionUtils::registerIndexType(main::Database& database, storage::IndexType type) {
+    database.getStorageManager()->registerIndexType(std::move(type));
+}
+
+ExtensionLibLoader::ExtensionLibLoader(const std::string& extensionName, const std::string& path)
+    : extensionName{extensionName} {
+    libHdl = dlopen(path.c_str(), RTLD_NOW | RTLD_LOCAL);
+    if (libHdl == nullptr) {
+        throw common::IOException(common::stringFormat(
+            "Failed to load library: {} which is needed by extension: {}.\nError: {}.", path,
+            extensionName, common::dlErrMessage()));
+    }
+}
+
+ext_load_func_t ExtensionLibLoader::getLoadFunc() {
+    return (ext_load_func_t)getDynamicLibFunc(EXTENSION_LOAD_FUNC_NAME);
+}
+
+ext_init_func_t ExtensionLibLoader::getInitFunc() {
+    return (ext_init_func_t)getDynamicLibFunc(EXTENSION_INIT_FUNC_NAME);
+}
+
+ext_name_func_t ExtensionLibLoader::getNameFunc() {
+    return (ext_name_func_t)getDynamicLibFunc(EXTENSION_NAME_FUNC_NAME);
+}
+
+ext_install_func_t ExtensionLibLoader::getInstallFunc() {
+    return (ext_install_func_t)getDynamicLibFunc(EXTENSION_INSTALL_FUNC_NAME);
+}
+
+void ExtensionLibLoader::unload() {
+    KU_ASSERT(libHdl != nullptr);
+    dlclose(libHdl);
+    libHdl = nullptr;
+}
+
+void* ExtensionLibLoader::getDynamicLibFunc(const std::string& funcName) {
+    KU_ASSERT(libHdl != nullptr);
+    auto sym = dlsym(libHdl, funcName.c_str());
+    if (sym == nullptr) {
+        throw common::IOException(
+            common::stringFormat("Failed to load {} function in extension {}.\nError: {}", funcName,
+                extensionName, common::dlErrMessage()));
+    }
+    return sym;
+}
+
+#ifdef _WIN32
+std::wstring utf8ToUnicode(const char* input) {
+    uint32_t result;
+
+    result = MultiByteToWideChar(CP_UTF8, 0, input, -1, nullptr, 0);
+    if (result == 0) {
+        throw common::IOException("Failure in MultiByteToWideChar");
+    }
+    auto buffer = std::make_unique<wchar_t[]>(result);
+    result = MultiByteToWideChar(CP_UTF8, 0, input, -1, buffer.get(), result);
+    if (result == 0) {
+        throw common::IOException("Failure in MultiByteToWideChar");
+    }
+    return std::wstring(buffer.get(), result);
+}
+
+void* dlopen(const char* file, int /*mode*/) {
+    KU_ASSERT(file);
+    auto fpath = utf8ToUnicode(file);
+    return (void*)LoadLibraryW(fpath.c_str());
+}
+
+void* dlsym(void* handle, const char* name) {
+    KU_ASSERT(handle);
+    return (void*)GetProcAddress((HINSTANCE)handle, name);
+}
+
+void dlclose(void* handle) {
+    KU_ASSERT(handle);
+    FreeLibrary((HINSTANCE)handle);
+}
+#endif
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension_entries.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension_entries.cpp
new file mode 100644
index 0000000000..ae3029cbb3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension_entries.cpp
@@ -0,0 +1,75 @@
+#include "common/string_utils.h"
+#include "extension/extension_manager.h"
+
+namespace lbug {
+namespace extension {
+
+struct EntriesForExtension {
+    const char* extensionName;
+    std::span<const char* const> entries;
+    size_t numEntries;
+};
+
+static constexpr std::array ftsExtensionFunctions = {"STEM", "QUERY_FTS_INDEX", "CREATE_FTS_INDEX",
+    "DROP_FTS_INDEX"};
+static constexpr std::array jsonExtensionFunctions = {"TO_JSON", "JSON_QUOTE", "ARRAY_TO_JSON",
+    "ROW_TO_JSON", "CAST_TO_JSON", "JSON_ARRAY", "JSON_OBJECT", "JSON_MERGE_PATCH", "COPY_JSON",
+    "JSON_EXTRACT", "JSON_ARRAY_LENGTH", "JSON_CONTAINS", "JSON_KEYS", "JSON_STRUCTURE",
+    "JSON_TYPE", "JSON_VALID", "JSON"};
+static constexpr std::array duckdbExtensionFunctions = {"CLEAR_ATTACHED_DB_CACHE"};
+static constexpr std::array deltaExtensionFunctions = {"DELTA_SCAN"};
+static constexpr std::array icebergExtensionFunctions = {"ICEBERG_SCAN", "ICEBERG_METADATA",
+    "ICEBERG_SNAPSHOTS"};
+static constexpr std::array azureExtensionFunctions = {"AZURE_SCAN"};
+static constexpr std::array vectorExtensionFunctions = {"QUERY_VECTOR_INDEX", "CREATE_VECTOR_INDEX",
+    "DROP_VECTOR_INDEX"};
+static constexpr std::array llmExtensionFunctions = {"CREATE_EMBEDDING"};
+static constexpr std::array neo4jExtensionFunctions = {"NEO4J_MIGRATE"};
+static constexpr std::array algoExtensionFunctions = {"K_CORE_DECOMPOSITION", "PAGE_RANK",
+    "STRONGLY_CONNECTED_COMPONENTS_KOSARAJU", "STRONGLY_CONNECTED_COMPONENTS",
+    "WEAKLY_CONNECTED_COMPONENTS"};
+
+static constexpr EntriesForExtension functionsForExtensionsRaw[] = {
+    {"FTS", ftsExtensionFunctions, ftsExtensionFunctions.size()},
+    {"DUCKDB", duckdbExtensionFunctions, duckdbExtensionFunctions.size()},
+    {"DELTA", deltaExtensionFunctions, deltaExtensionFunctions.size()},
+    {"ICEBERG", icebergExtensionFunctions, icebergExtensionFunctions.size()},
+    {"AZURE", azureExtensionFunctions, azureExtensionFunctions.size()},
+    {"JSON", jsonExtensionFunctions, jsonExtensionFunctions.size()},
+    {"VECTOR", vectorExtensionFunctions, vectorExtensionFunctions.size()},
+    {"LLM", llmExtensionFunctions, llmExtensionFunctions.size()},
+    {"NEO4J", neo4jExtensionFunctions, neo4jExtensionFunctions.size()},
+    {"ALGO", algoExtensionFunctions, algoExtensionFunctions.size()},
+};
+static constexpr std::array functionsForExtensions = std::to_array(functionsForExtensionsRaw);
+
+static constexpr std::array jsonExtensionTypes = {"JSON"};
+static constexpr std::array<EntriesForExtension, 1> typesForExtensions = {
+    EntriesForExtension{"JSON", jsonExtensionTypes, jsonExtensionTypes.size()}};
+
+static std::optional<ExtensionEntry> lookupExtensionsByEntryName(std::string_view functionName,
+    std::span<const EntriesForExtension> entriesForExtensions) {
+    std::vector<ExtensionEntry> ret;
+    for (const auto extension : entriesForExtensions) {
+        for (const auto* entry : extension.entries) {
+            if (entry == functionName) {
+                return ExtensionEntry{.name = entry, .extensionName = extension.extensionName};
+            }
+        }
+    }
+    return {};
+}
+
+std::optional<ExtensionEntry> ExtensionManager::lookupExtensionsByFunctionName(
+    std::string_view functionName) {
+    return lookupExtensionsByEntryName(common::StringUtils::getUpper(functionName),
+        functionsForExtensions);
+}
+
+std::optional<ExtensionEntry> ExtensionManager::lookupExtensionsByTypeName(
+    std::string_view typeName) {
+    return lookupExtensionsByEntryName(common::StringUtils::getUpper(typeName), typesForExtensions);
+}
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension_installer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension_installer.cpp
new file mode 100644
index 0000000000..16fa63b158
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension_installer.cpp
@@ -0,0 +1,94 @@
+#include "extension/extension_installer.h"
+
+#include "common/exception/io.h"
+#include "common/file_system/virtual_file_system.h"
+#include "httplib.h"
+#include "main/client_context.h"
+
+namespace lbug {
+namespace extension {
+
+void ExtensionInstaller::tryDownloadExtensionFile(const ExtensionRepoInfo& repoInfo,
+    const std::string& localFilePath) {
+    httplib::Client cli(repoInfo.hostURL.c_str());
+    httplib::Headers headers = {
+        {"User-Agent", common::stringFormat("lbug/v{}", LBUG_EXTENSION_VERSION)}};
+    auto res = cli.Get(repoInfo.hostPath.c_str(), headers);
+    if (!res || res->status != 200) {
+        if (res.error() == httplib::Error::Success) {
+            // LCOV_EXCL_START
+            throw common::IOException(common::stringFormat(
+                "HTTP Returns: {}, Failed to download extension: \"{}\" from {}.",
+                res.value().status, info.name, repoInfo.repoURL));
+            // LCOC_EXCL_STOP
+        } else {
+            throw common::IOException(
+                common::stringFormat("Failed to download extension: {} at URL {} (ERROR: {})",
+                    info.name, repoInfo.repoURL, to_string(res.error())));
+        }
+    }
+
+    auto vfs = common::VirtualFileSystem::GetUnsafe(context);
+    auto fileInfo = vfs->openFile(localFilePath,
+        common::FileOpenFlags(common::FileFlags::WRITE | common::FileFlags::READ_ONLY |
+                              common::FileFlags::CREATE_AND_TRUNCATE_IF_EXISTS));
+    fileInfo->writeFile(reinterpret_cast<const uint8_t*>(res->body.c_str()), res->body.size(),
+        0 /* offset */);
+    fileInfo->syncFile();
+}
+
+bool ExtensionInstaller::install() {
+    auto install = installExtension();
+    if (install) {
+        installDependencies();
+    }
+    return install;
+}
+
+bool ExtensionInstaller::installExtension() {
+    auto vfs = common::VirtualFileSystem::GetUnsafe(context);
+    auto localExtensionDir = context.getExtensionDir();
+    if (!vfs->fileOrPathExists(localExtensionDir, &context)) {
+        vfs->createDir(localExtensionDir);
+    }
+    auto localDirForExtension =
+        extension::ExtensionUtils::getLocalDirForExtension(&context, info.name);
+    if (!vfs->fileOrPathExists(localDirForExtension)) {
+        vfs->createDir(localDirForExtension);
+    }
+    auto localLibFilePath =
+        extension::ExtensionUtils::getLocalPathForExtensionLib(&context, info.name);
+    if (vfs->fileOrPathExists(localLibFilePath) && !info.forceInstall) {
+        // The extension has been installed, skip downloading from the repo.
+        return false;
+    }
+    auto localDirForSharedLib = extension::ExtensionUtils::getLocalPathForSharedLib(&context);
+    if (!vfs->fileOrPathExists(localDirForSharedLib)) {
+        vfs->createDir(localDirForSharedLib);
+    }
+    auto libFileRepoInfo = extension::ExtensionUtils::getExtensionLibRepoInfo(info.name, info.repo);
+
+    tryDownloadExtensionFile(libFileRepoInfo, localLibFilePath);
+    return true;
+}
+
+void ExtensionInstaller::installDependencies() {
+    auto extensionRepoInfo = ExtensionUtils::getExtensionInstallerRepoInfo(info.name, info.repo);
+    httplib::Client cli(extensionRepoInfo.hostURL.c_str());
+    httplib::Headers headers = {
+        {"User-Agent", common::stringFormat("lbug/v{}", LBUG_EXTENSION_VERSION)}};
+    auto res = cli.Get(extensionRepoInfo.hostPath.c_str(), headers);
+    if (!res || res->status != 200) {
+        // The extension doesn't have an installer.
+        return;
+    }
+    auto extensionInstallerPath =
+        ExtensionUtils::getLocalPathForExtensionInstaller(&context, info.name);
+    tryDownloadExtensionFile(extensionRepoInfo, extensionInstallerPath);
+    auto libLoader = ExtensionLibLoader(info.name, extensionInstallerPath.c_str());
+    auto install = libLoader.getInstallFunc();
+    (*install)(info.repo, context);
+}
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension_manager.cpp
new file mode 100644
index 0000000000..d01f841596
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/extension_manager.cpp
@@ -0,0 +1,105 @@
+#include "extension/extension_manager.h"
+
+#include "common/file_system/virtual_file_system.h"
+#include "common/string_utils.h"
+#include "extension/extension.h"
+#include "generated_extension_loader.h"
+#include "storage/wal/local_wal.h"
+#include "transaction/transaction_context.h"
+
+namespace lbug {
+namespace extension {
+
+static void executeExtensionLoader(main::ClientContext* context, const std::string& extensionName) {
+    auto loaderPath = ExtensionUtils::getLocalPathForExtensionLoader(context, extensionName);
+    if (common::VirtualFileSystem::GetUnsafe(*context)->fileOrPathExists(loaderPath)) {
+        auto libLoader = ExtensionLibLoader(extensionName, loaderPath);
+        auto load = libLoader.getLoadFunc();
+        (*load)(context);
+    }
+}
+
+void ExtensionManager::loadExtension(const std::string& path, main::ClientContext* context) {
+    auto fullPath = path;
+    bool isOfficial = ExtensionUtils::isOfficialExtension(path);
+    if (isOfficial) {
+        auto localPathForSharedLib = ExtensionUtils::getLocalPathForSharedLib(context);
+        if (!common::VirtualFileSystem::GetUnsafe(*context)->fileOrPathExists(
+                localPathForSharedLib)) {
+            common::VirtualFileSystem::GetUnsafe(*context)->createDir(localPathForSharedLib);
+        }
+        executeExtensionLoader(context, path);
+        fullPath = ExtensionUtils::getLocalPathForExtensionLib(context, path);
+    }
+
+    auto libLoader = ExtensionLibLoader(path, fullPath);
+    auto name = libLoader.getNameFunc();
+    std::string extensionName = (*name)();
+    if (std::any_of(loadedExtensions.begin(), loadedExtensions.end(),
+            [&](const LoadedExtension& ext) { return ext.getExtensionName() == extensionName; })) {
+        libLoader.unload();
+        return;
+    }
+    auto init = libLoader.getInitFunc();
+    (*init)(context);
+    loadedExtensions.push_back(LoadedExtension(extensionName, fullPath,
+        isOfficial ? ExtensionSource::OFFICIAL : ExtensionSource::USER));
+    auto transaction = transaction::Transaction::Get(*context);
+    if (transaction->shouldLogToWAL()) {
+        transaction->getLocalWAL().logLoadExtension(path);
+    }
+}
+
+std::string ExtensionManager::toCypher() {
+    std::string cypher;
+    for (auto& extension : loadedExtensions) {
+        cypher += extension.toCypher();
+    }
+    return cypher;
+}
+
+void ExtensionManager::addExtensionOption(std::string name, common::LogicalTypeID type,
+    common::Value defaultValue, bool isConfidential) {
+    if (getExtensionOption(name) != nullptr) {
+        // One extension option can be shared by multiple extensions.
+        return;
+    }
+    common::StringUtils::toLower(name);
+    extensionOptions.emplace(name,
+        main::ExtensionOption{name, type, std::move(defaultValue), isConfidential});
+}
+
+const main::ExtensionOption* ExtensionManager::getExtensionOption(std::string name) const {
+    common::StringUtils::toLower(name);
+    return extensionOptions.contains(name) ? &extensionOptions.at(name) : nullptr;
+}
+
+void ExtensionManager::registerStorageExtension(std::string name,
+    std::unique_ptr<storage::StorageExtension> storageExtension) {
+    if (storageExtensions.contains(name)) {
+        return;
+    }
+    storageExtensions.emplace(std::move(name), std::move(storageExtension));
+}
+
+std::vector<storage::StorageExtension*> ExtensionManager::getStorageExtensions() {
+    std::vector<storage::StorageExtension*> storageExtensionsToReturn;
+    for (auto& [name, storageExtension] : storageExtensions) {
+        storageExtensionsToReturn.push_back(storageExtension.get());
+    }
+    return storageExtensionsToReturn;
+}
+
+void ExtensionManager::autoLoadLinkedExtensions(main::ClientContext* context) {
+    auto trxContext = transaction::TransactionContext::Get(*context);
+    trxContext->beginRecoveryTransaction();
+    loadLinkedExtensions(context, loadedExtensions);
+    trxContext->commit();
+}
+
+ExtensionManager* ExtensionManager::Get(const main::ClientContext& context) {
+    return context.getDatabase()->getExtensionManager();
+}
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/extension/generated_extension_loader.cpp.in b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/generated_extension_loader.cpp.in
new file mode 100644
index 0000000000..dd8e7c5e3f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/generated_extension_loader.cpp.in
@@ -0,0 +1,13 @@
+#include "extension/loaded_extension.h"
+#include "generated_extension_loader.h"
+
+namespace lbug {
+namespace extension {
+
+void loadLinkedExtensions([[maybe_unused]] main::ClientContext* context,
+    [[maybe_unused]] std::vector<LoadedExtension>& loadedExtensions) {
+    @LOAD_LINKED_EXTENSION@
+}
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/extension/generated_extension_loader.h.in b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/generated_extension_loader.h.in
new file mode 100644
index 0000000000..0e60030ca8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/generated_extension_loader.h.in
@@ -0,0 +1,12 @@
+#pragma once
+
+#include "main/client_context.h"
+@INCLUDES@
+
+namespace lbug {
+namespace extension {
+
+void loadLinkedExtensions(main::ClientContext* context, std::vector<LoadedExtension>& loadedExtensions);
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/extension/loaded_extension.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/loaded_extension.cpp
new file mode 100644
index 0000000000..041771ac4e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/extension/loaded_extension.cpp
@@ -0,0 +1,23 @@
+#include "extension/loaded_extension.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace extension {
+
+std::string LoadedExtension::toCypher() {
+    switch (source) {
+    case ExtensionSource::OFFICIAL:
+        return common::stringFormat("INSTALL {};\nLOAD EXTENSION {};\n", extensionName,
+            extensionName);
+    case ExtensionSource::USER:
+        return common::stringFormat("LOAD EXTENSION '{}';\n", fullPath);
+    case ExtensionSource::STATIC_LINKED:
+        return "";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/CMakeLists.txt
new file mode 100644
index 0000000000..43de0feb64
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/CMakeLists.txt
@@ -0,0 +1,48 @@
+add_subdirectory(aggregate)
+add_subdirectory(arithmetic)
+add_subdirectory(array)
+add_subdirectory(cast)
+add_subdirectory(date)
+add_subdirectory(gds)
+add_subdirectory(list)
+add_subdirectory(map)
+add_subdirectory(path)
+add_subdirectory(pattern)
+add_subdirectory(sequence)
+add_subdirectory(struct)
+add_subdirectory(table)
+add_subdirectory(union)
+add_subdirectory(utility)
+add_subdirectory(uuid)
+add_subdirectory(string)
+add_subdirectory(export)
+add_subdirectory(internal_id)
+add_subdirectory(timestamp)
+
+add_library(lbug_function
+        OBJECT
+        aggregate_function.cpp
+        base_lower_upper_operation.cpp
+        built_in_function_utils.cpp
+        cast_string_non_nested_functions.cpp
+        cast_from_string_functions.cpp
+        comparison_functions.cpp
+        find_function.cpp
+        function.cpp
+        function_collection.cpp
+        scalar_macro_function.cpp
+        vector_arithmetic_functions.cpp
+        vector_boolean_functions.cpp
+        vector_cast_functions.cpp
+        vector_date_functions.cpp
+        vector_hash_functions.cpp
+        vector_null_functions.cpp
+        vector_node_rel_functions.cpp
+        vector_string_functions.cpp
+        vector_timestamp_functions.cpp
+        vector_blob_functions.cpp
+        vector_uuid_functions.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/CMakeLists.txt
new file mode 100644
index 0000000000..ba4550c3f7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/CMakeLists.txt
@@ -0,0 +1,12 @@
+add_library(lbug_function_aggregate
+        OBJECT
+        count.cpp
+        count_star.cpp
+        collect.cpp
+        min_max.cpp
+        sum.cpp
+        avg.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_aggregate>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/avg.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/avg.cpp
new file mode 100644
index 0000000000..d84e1ce434
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/avg.cpp
@@ -0,0 +1,17 @@
+#include "function/aggregate/avg.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+function_set AggregateAvgFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        AggregateFunctionUtils::appendSumOrAvgFuncs<AvgFunction>(name, typeID, result);
+    }
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/collect.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/collect.cpp
new file mode 100644
index 0000000000..4a78e202c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/collect.cpp
@@ -0,0 +1,185 @@
+#include "function/aggregate_function.h"
+#include "storage/storage_utils.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+/**
+ * For collect each grouped key corresponds to a list of values
+ * We store this value as a linked list where each element is allocated from the shared overflow
+ * buffer
+ * The format for each element in the list is the following in order:
+ * - The value of the current element
+ * - The pointer to the next element in the list
+ */
+struct CollectListElement {
+    CollectListElement() : elementPtr(nullptr) {}
+    explicit CollectListElement(uint8_t* elementPtr) : elementPtr(elementPtr) {}
+
+    CollectListElement getNextElement() const { return CollectListElement{*getNextElementPtr()}; }
+    uint8_t** getNextElementPtr() const { return reinterpret_cast<uint8_t**>(elementPtr); }
+    void setNextElement(CollectListElement next) const {
+        KU_ASSERT(*getNextElementPtr() == nullptr);
+        *getNextElementPtr() = next.elementPtr;
+    }
+    void setNextElement(std::nullptr_t next) const { *getNextElementPtr() = next; }
+    uint8_t* getDataPtr() const { return elementPtr + sizeof(uint8_t*); }
+
+    static uint64_t size(LogicalType& elementType) {
+        return sizeof(uint8_t*) + StorageUtils::getDataTypeSize(elementType);
+    }
+
+    bool valid() const { return elementPtr; }
+
+    uint8_t* elementPtr;
+};
+
+struct CollectState : public AggregateStateWithNull {
+    CollectState() = default;
+    uint32_t getStateSize() const override { return sizeof(*this); }
+    void writeToVector(common::ValueVector* outputVector, uint64_t pos) override;
+
+    void appendElement(ValueVector* input, uint32_t pos, InMemOverflowBuffer* overflowBuffer);
+    void resetList();
+    void appendList(const CollectState& o);
+
+    // We store the head + tail of the linked list
+    CollectListElement head;
+    CollectListElement tail;
+    uint64_t listSize = 0;
+
+    // CollectStates are stored in factorizedTable entries. When the factorizedTable is
+    // destructed, the destructor of CollectStates won't be called. Therefore, we need to make sure
+    // that no additional actions are required for destructing the head/tail outside of deallocating
+    // their memory
+
+    static_assert(std::is_trivially_destructible_v<CollectListElement>);
+};
+
+void CollectState::appendList(const CollectState& o) {
+    if (head.valid()) {
+        KU_ASSERT(tail.valid());
+        tail.setNextElement(o.head);
+        tail = o.tail;
+    } else {
+        head = o.head;
+        tail = o.tail;
+    }
+    listSize += o.listSize;
+}
+
+void CollectState::appendElement(ValueVector* input, uint32_t pos,
+    InMemOverflowBuffer* overflowBuffer) {
+    CollectListElement newElement{
+        overflowBuffer->allocateSpace(CollectListElement::size(input->dataType))};
+    newElement.setNextElement(nullptr);
+    input->copyToRowData(pos, newElement.getDataPtr(), overflowBuffer);
+
+    if (tail.valid()) {
+        tail.setNextElement(newElement);
+    } else {
+        KU_ASSERT(!head.valid());
+        head = newElement;
+    }
+    tail = newElement;
+
+    ++listSize;
+}
+
+void CollectState::resetList() {
+    head = {};
+    tail = {};
+    listSize = 0;
+}
+
+void CollectState::writeToVector(common::ValueVector* outputVector, uint64_t pos) {
+    auto listEntry = common::ListVector::addList(outputVector, listSize);
+    outputVector->setValue<common::list_entry_t>(pos, listEntry);
+    auto outputDataVector = common::ListVector::getDataVector(outputVector);
+    CollectListElement curElement = head;
+    for (auto i = 0u; i < listEntry.size; i++) {
+        KU_ASSERT(curElement.valid());
+        outputDataVector->copyFromRowData(listEntry.offset + i, curElement.getDataPtr());
+        curElement = curElement.getNextElement();
+    }
+}
+
+static std::unique_ptr<AggregateState> initialize() {
+    return std::make_unique<CollectState>();
+}
+
+static void updateSingleValue(CollectState* state, ValueVector* input, uint32_t pos,
+    uint64_t multiplicity, InMemOverflowBuffer* overflowBuffer) {
+    for (auto i = 0u; i < multiplicity; ++i) {
+        state->isNull = false;
+        state->appendElement(input, pos, overflowBuffer);
+    }
+}
+
+static void updateAll(uint8_t* state_, ValueVector* input, uint64_t multiplicity,
+    InMemOverflowBuffer* overflowBuffer) {
+    KU_ASSERT(!input->state->isFlat());
+    auto state = reinterpret_cast<CollectState*>(state_);
+    auto& inputSelVector = input->state->getSelVector();
+    if (input->hasNoNullsGuarantee()) {
+        for (auto i = 0u; i < inputSelVector.getSelSize(); ++i) {
+            auto pos = inputSelVector[i];
+            updateSingleValue(state, input, pos, multiplicity, overflowBuffer);
+        }
+    } else {
+        for (auto i = 0u; i < inputSelVector.getSelSize(); ++i) {
+            auto pos = inputSelVector[i];
+            if (!input->isNull(pos)) {
+                updateSingleValue(state, input, pos, multiplicity, overflowBuffer);
+            }
+        }
+    }
+}
+
+static void updatePos(uint8_t* state_, ValueVector* input, uint64_t multiplicity, uint32_t pos,
+    InMemOverflowBuffer* overflowBuffer) {
+    auto state = reinterpret_cast<CollectState*>(state_);
+    updateSingleValue(state, input, pos, multiplicity, overflowBuffer);
+}
+
+static void finalize(uint8_t* /*state_*/) {}
+
+static void combine(uint8_t* state_, uint8_t* otherState_,
+    InMemOverflowBuffer* /*overflowBuffer*/) {
+    auto otherState = reinterpret_cast<CollectState*>(otherState_);
+    if (otherState->isNull) {
+        return;
+    }
+    auto state = reinterpret_cast<CollectState*>(state_);
+    state->appendList(*otherState);
+    state->isNull = false;
+    otherState->resetList();
+    otherState->isNull = true;
+}
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    KU_ASSERT(input.arguments.size() == 1);
+    auto aggFuncDefinition = reinterpret_cast<AggregateFunction*>(input.definition);
+    aggFuncDefinition->parameterTypeIDs[0] = input.arguments[0]->dataType.getLogicalTypeID();
+    auto returnType = LogicalType::LIST(input.arguments[0]->dataType.copy());
+    return std::make_unique<FunctionBindData>(std::move(returnType));
+}
+
+function_set CollectFunction::getFunctionSet() {
+    function_set result;
+    for (auto isDistinct : std::vector<bool>{true, false}) {
+        result.push_back(std::make_unique<AggregateFunction>(name,
+            std::vector<LogicalTypeID>{LogicalTypeID::ANY}, LogicalTypeID::LIST, initialize,
+            updateAll, updatePos, combine, finalize, isDistinct, bindFunc,
+            nullptr /* paramRewriteFunc */));
+    }
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/count.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/count.cpp
new file mode 100644
index 0000000000..d6321b7607
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/count.cpp
@@ -0,0 +1,43 @@
+#include "function/aggregate/count.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/expression/node_expression.h"
+#include "binder/expression/rel_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+void CountFunction::updateAll(uint8_t* state_, ValueVector* input, uint64_t multiplicity,
+    InMemOverflowBuffer* /*overflowBuffer*/) {
+    auto state = reinterpret_cast<CountState*>(state_);
+    state->count += multiplicity * input->countNonNull();
+}
+
+void CountFunction::paramRewriteFunc(expression_vector& arguments) {
+    KU_ASSERT(arguments.size() == 1);
+    if (ExpressionUtil::isNodePattern(*arguments[0])) {
+        arguments[0] = arguments[0]->constCast<NodeExpression>().getInternalID();
+    } else if (ExpressionUtil::isRelPattern(*arguments[0])) {
+        arguments[0] = arguments[0]->constCast<RelExpression>().getInternalID();
+    }
+}
+
+function_set CountFunction::getFunctionSet() {
+    function_set result;
+    for (auto& type : LogicalTypeUtils::getAllValidLogicTypeIDs()) {
+        for (auto isDistinct : std::vector<bool>{true, false}) {
+            auto func = AggregateFunctionUtils::getAggFunc<CountFunction>(name, type,
+                LogicalTypeID::INT64, isDistinct, paramRewriteFunc);
+            func->needToHandleNulls = true;
+            result.push_back(std::move(func));
+        }
+    }
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/count_star.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/count_star.cpp
new file mode 100644
index 0000000000..8e354fb258
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/count_star.cpp
@@ -0,0 +1,35 @@
+#include "function/aggregate/count_star.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace function {
+
+void CountStarFunction::updateAll(uint8_t* state_, ValueVector* input, uint64_t multiplicity,
+    InMemOverflowBuffer* /*overflowBuffer*/) {
+    auto state = reinterpret_cast<CountState*>(state_);
+    KU_ASSERT(input == nullptr);
+    (void)input;
+    state->count += multiplicity;
+}
+
+void CountStarFunction::updatePos(uint8_t* state_, ValueVector* input, uint64_t multiplicity,
+    uint32_t /*pos*/, InMemOverflowBuffer* /*overflowBuffer*/) {
+    auto state = reinterpret_cast<CountState*>(state_);
+    KU_ASSERT(input == nullptr);
+    (void)input;
+    state->count += multiplicity;
+}
+
+function_set CountStarFunction::getFunctionSet() {
+    function_set result;
+    auto aggFunc = std::make_unique<AggregateFunction>(name, std::vector<LogicalTypeID>{},
+        LogicalTypeID::INT64, initialize, updateAll, updatePos, combine, finalize, false);
+    aggFunc->needToHandleNulls = true;
+    result.push_back(std::move(aggFunc));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/min_max.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/min_max.cpp
new file mode 100644
index 0000000000..98920a903d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/min_max.cpp
@@ -0,0 +1,45 @@
+#include "function/aggregate/min_max.h"
+
+#include "common/type_utils.h"
+#include "function/comparison/comparison_functions.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+template<typename FUNC>
+static void getMinMaxFunction(std::string name, function_set& set) {
+    std::unique_ptr<AggregateFunction> func;
+    for (auto& type : LogicalTypeUtils::getAllValidComparableLogicalTypes()) {
+        auto inputTypes = std::vector<common::LogicalTypeID>{type};
+        for (auto isDistinct : std::vector<bool>{true, false}) {
+            common::TypeUtils::visit(
+                LogicalType::getPhysicalType(type),
+                [&]<ComparableTypes T>(T) {
+                    func = std::make_unique<AggregateFunction>(name, inputTypes, type,
+                        MinMaxFunction<T>::initialize, MinMaxFunction<T>::template updateAll<FUNC>,
+                        MinMaxFunction<T>::template updatePos<FUNC>,
+                        MinMaxFunction<T>::template combine<FUNC>, MinMaxFunction<T>::finalize,
+                        isDistinct);
+                },
+                [](auto) { KU_UNREACHABLE; });
+            set.push_back(std::move(func));
+        }
+    }
+}
+
+function_set AggregateMinFunction::getFunctionSet() {
+    function_set result;
+    getMinMaxFunction<LessThan>(AggregateMinFunction::name, result);
+    return result;
+}
+
+function_set AggregateMaxFunction::getFunctionSet() {
+    function_set result;
+    getMinMaxFunction<GreaterThan>(AggregateMaxFunction::name, result);
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/sum.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/sum.cpp
new file mode 100644
index 0000000000..0efb546502
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate/sum.cpp
@@ -0,0 +1,17 @@
+#include "function/aggregate/sum.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+function_set AggregateSumFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        AggregateFunctionUtils::appendSumOrAvgFuncs<SumFunction>(name, typeID, result);
+    }
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate_function.cpp
new file mode 100644
index 0000000000..aeb0d7ccb4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/aggregate_function.cpp
@@ -0,0 +1,62 @@
+#include "function/aggregate_function.h"
+
+#include "common/type_utils.h"
+#include "function/aggregate/avg.h"
+#include "function/aggregate/sum.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace function {
+
+AggregateFunction::AggregateFunction(const AggregateFunction& other)
+    : ScalarOrAggregateFunction{other.name, other.parameterTypeIDs, other.returnTypeID,
+          other.bindFunc} {
+    needToHandleNulls = other.needToHandleNulls;
+    isDistinct = other.isDistinct;
+    initializeFunc = other.initializeFunc;
+    updateAllFunc = other.updateAllFunc;
+    updatePosFunc = other.updatePosFunc;
+    combineFunc = other.combineFunc;
+    finalizeFunc = other.finalizeFunc;
+    paramRewriteFunc = other.paramRewriteFunc;
+    initialNullAggregateState = createInitialNullAggregateState();
+}
+
+template void AggregateFunctionUtils::appendSumOrAvgFuncs<AvgFunction>(std::string name,
+    common::LogicalTypeID inputType, function_set& result);
+template void AggregateFunctionUtils::appendSumOrAvgFuncs<SumFunction>(std::string name,
+    common::LogicalTypeID inputType, function_set& result);
+
+template<template<typename, typename> class FunctionType>
+void AggregateFunctionUtils::appendSumOrAvgFuncs(std::string name, common::LogicalTypeID inputType,
+    function_set& result) {
+    std::unique_ptr<AggregateFunction> aggFunc;
+    for (auto isDistinct : std::vector<bool>{true, false}) {
+        TypeUtils::visit(
+            LogicalType{inputType},
+            [&]<IntegerTypes T>(T) {
+                using ResultType =
+                    std::conditional<UnsignedIntegerTypes<T>, uint128_t, int128_t>::type;
+                LogicalTypeID resultType =
+                    UnsignedIntegerTypes<T> ? LogicalTypeID::UINT128 : LogicalTypeID::INT128;
+                // For avg aggregate functions, the result type is always double.
+                if constexpr (std::is_same_v<FunctionType<T, ResultType>,
+                                  AvgFunction<T, ResultType>>) {
+                    resultType = LogicalTypeID::DOUBLE;
+                }
+                aggFunc = AggregateFunctionUtils::getAggFunc<FunctionType<T, ResultType>>(name,
+                    inputType, resultType, isDistinct);
+            },
+            [&]<FloatingPointTypes T>(T) {
+                aggFunc = AggregateFunctionUtils::getAggFunc<FunctionType<T, double>>(name,
+                    inputType, LogicalTypeID::DOUBLE, isDistinct);
+            },
+            [](auto) { KU_UNREACHABLE; });
+        result.push_back(std::move(aggFunc));
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/CMakeLists.txt
new file mode 100644
index 0000000000..fb68e258f8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/CMakeLists.txt
@@ -0,0 +1,15 @@
+add_library(lbug_function_arithmetic
+        OBJECT
+        multiply.cpp
+        add.cpp
+        subtract.cpp
+        divide.cpp
+        modulo.cpp
+        negate.cpp
+        abs.cpp
+        rand_function.cpp
+        set_seed.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_arithmetic>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/abs.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/abs.cpp
new file mode 100644
index 0000000000..e8fb117527
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/abs.cpp
@@ -0,0 +1,88 @@
+#include "function/arithmetic/abs.h"
+
+#include "common/exception/overflow.h"
+#include "common/string_format.h"
+#include "common/type_utils.h"
+#include "function/cast/functions/numeric_limits.h"
+
+namespace lbug {
+namespace function {
+
+// reference from duckDB arithmetic.cpp
+template<class SRC_TYPE>
+static inline bool AbsInPlaceWithOverflowCheck(SRC_TYPE input, SRC_TYPE& result) {
+    if (input == NumericLimits<SRC_TYPE>::minimum()) {
+        return false;
+    }
+    result = std::abs(input);
+    return true;
+}
+
+struct AbsInPlace {
+    template<class T>
+    static inline bool operation(T& input, T& result);
+};
+
+template<>
+bool inline AbsInPlace::operation(int8_t& input, int8_t& result) {
+    return AbsInPlaceWithOverflowCheck<int8_t>(input, result);
+}
+
+template<>
+bool inline AbsInPlace::operation(int16_t& input, int16_t& result) {
+    return AbsInPlaceWithOverflowCheck<int16_t>(input, result);
+}
+
+template<>
+bool inline AbsInPlace::operation(int32_t& input, int32_t& result) {
+    return AbsInPlaceWithOverflowCheck<int32_t>(input, result);
+}
+
+template<>
+bool AbsInPlace::operation(int64_t& input, int64_t& result) {
+    return AbsInPlaceWithOverflowCheck<int64_t>(input, result);
+}
+
+template<>
+void Abs::operation(int8_t& input, int8_t& result) {
+    if (!AbsInPlace::operation(input, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Cannot take the absolute value of {} within INT8 range.",
+                common::TypeUtils::toString(input))};
+    }
+}
+
+template<>
+void Abs::operation(int16_t& input, int16_t& result) {
+    if (!AbsInPlace::operation(input, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Cannot take the absolute value of {} within INT16 range.",
+                common::TypeUtils::toString(input))};
+    }
+}
+
+template<>
+void Abs::operation(int32_t& input, int32_t& result) {
+    if (!AbsInPlace::operation(input, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Cannot take the absolute value of {} within INT32 range.",
+                common::TypeUtils::toString(input))};
+    }
+}
+
+template<>
+void Abs::operation(int64_t& input, int64_t& result) {
+    if (!AbsInPlace::operation(input, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Cannot take the absolute value of {} within INT64 range.",
+                common::TypeUtils::toString(input))};
+    }
+}
+
+template<>
+void Abs::operation(common::int128_t& input, common::int128_t& result) {
+    result = input < 0 ? -input : input;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/add.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/add.cpp
new file mode 100644
index 0000000000..0957d9c12d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/add.cpp
@@ -0,0 +1,157 @@
+#include "function/arithmetic/add.h"
+
+#include "common/exception/overflow.h"
+#include "common/string_format.h"
+#include "common/type_utils.h"
+#include "function/cast/functions/numeric_limits.h"
+
+namespace lbug {
+namespace function {
+
+// reference from duckDB add.cpp
+template<class SRC_TYPE, class DST_TYPE>
+static inline bool addInPlaceWithOverflowCheck(SRC_TYPE left, SRC_TYPE right, SRC_TYPE& result) {
+    DST_TYPE uresult;
+    uresult = static_cast<DST_TYPE>(left) + static_cast<DST_TYPE>(right);
+    if (uresult < NumericLimits<SRC_TYPE>::minimum() ||
+        uresult > NumericLimits<SRC_TYPE>::maximum()) {
+        return false;
+    }
+    result = static_cast<SRC_TYPE>(uresult);
+    return true;
+}
+
+struct AddInPlace {
+    template<class A, class B, class R>
+    static inline bool operation(A& left, B& right, R& result);
+};
+
+template<>
+bool inline AddInPlace::operation(uint8_t& left, uint8_t& right, uint8_t& result) {
+    return addInPlaceWithOverflowCheck<uint8_t, uint16_t>(left, right, result);
+}
+
+template<>
+bool inline AddInPlace::operation(uint16_t& left, uint16_t& right, uint16_t& result) {
+    return addInPlaceWithOverflowCheck<uint16_t, uint32_t>(left, right, result);
+}
+
+template<>
+bool inline AddInPlace::operation(uint32_t& left, uint32_t& right, uint32_t& result) {
+    return addInPlaceWithOverflowCheck<uint32_t, uint64_t>(left, right, result);
+}
+
+template<>
+bool AddInPlace::operation(uint64_t& left, uint64_t& right, uint64_t& result) {
+    if (NumericLimits<uint64_t>::maximum() - left < right) {
+        return false;
+    }
+    return addInPlaceWithOverflowCheck<uint64_t, uint64_t>(left, right, result);
+}
+
+template<>
+bool inline AddInPlace::operation(int8_t& left, int8_t& right, int8_t& result) {
+    return addInPlaceWithOverflowCheck<int8_t, int16_t>(left, right, result);
+}
+
+template<>
+bool inline AddInPlace::operation(int16_t& left, int16_t& right, int16_t& result) {
+    return addInPlaceWithOverflowCheck<int16_t, int32_t>(left, right, result);
+}
+
+template<>
+bool inline AddInPlace::operation(int32_t& left, int32_t& right, int32_t& result) {
+    return addInPlaceWithOverflowCheck<int32_t, int64_t>(left, right, result);
+}
+
+template<>
+bool AddInPlace::operation(int64_t& left, int64_t& right, int64_t& result) {
+#if (__GNUC__ >= 5) || defined(__clang__)
+    if (__builtin_add_overflow(left, right, &result)) {
+        return false;
+    }
+#else
+    // https://blog.regehr.org/archives/1139
+    int64_t tmp = int64_t((uint64_t)left + (uint64_t)right);
+    if ((left < 0 && right < 0 && tmp >= 0) || (left >= 0 && right >= 0 && tmp < 0)) {
+        return false;
+    }
+    result = std::move(tmp);
+#endif
+    return true;
+}
+
+template<>
+void Add::operation(uint8_t& left, uint8_t& right, uint8_t& result) {
+    if (!AddInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} + {} is not within UINT8 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Add::operation(uint16_t& left, uint16_t& right, uint16_t& result) {
+    if (!AddInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} + {} is not within UINT16 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Add::operation(uint32_t& left, uint32_t& right, uint32_t& result) {
+    if (!AddInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} + {} is not within UINT32 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Add::operation(uint64_t& left, uint64_t& right, uint64_t& result) {
+    if (!AddInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} + {} is not within UINT64 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Add::operation(int8_t& left, int8_t& right, int8_t& result) {
+    if (!AddInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} + {} is not within INT8 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Add::operation(int16_t& left, int16_t& right, int16_t& result) {
+    if (!AddInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} + {} is not within INT16 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Add::operation(int32_t& left, int32_t& right, int32_t& result) {
+    if (!AddInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} + {} is not within INT32 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Add::operation(int64_t& left, int64_t& right, int64_t& result) {
+    if (!AddInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} + {} is not within INT64 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/divide.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/divide.cpp
new file mode 100644
index 0000000000..74e7778719
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/divide.cpp
@@ -0,0 +1,170 @@
+#include "function/arithmetic/divide.h"
+
+#include "common/exception/overflow.h"
+#include "common/exception/runtime.h"
+#include "common/string_format.h"
+#include "common/type_utils.h"
+#include "function/cast/functions/numeric_limits.h"
+
+namespace lbug {
+namespace function {
+
+// reference from duckDB multiply.cpp
+template<class SRC_TYPE, class DST_TYPE>
+static inline bool tryDivideWithOverflowCheck(SRC_TYPE left, SRC_TYPE right, SRC_TYPE& result) {
+    DST_TYPE uresult;
+    uresult = static_cast<DST_TYPE>(left) / static_cast<DST_TYPE>(right);
+    if (uresult < NumericLimits<SRC_TYPE>::minimum() ||
+        uresult > NumericLimits<SRC_TYPE>::maximum()) {
+        return false;
+    }
+    result = static_cast<SRC_TYPE>(uresult);
+    return true;
+}
+
+struct TryDivide {
+    template<class A, class B, class R>
+    static inline bool operation(A& left, B& right, R& result);
+};
+
+template<>
+bool inline TryDivide::operation(uint8_t& left, uint8_t& right, uint8_t& result) {
+    return tryDivideWithOverflowCheck<uint8_t, uint16_t>(left, right, result);
+}
+
+template<>
+bool inline TryDivide::operation(uint16_t& left, uint16_t& right, uint16_t& result) {
+    return tryDivideWithOverflowCheck<uint16_t, uint32_t>(left, right, result);
+}
+
+template<>
+bool inline TryDivide::operation(uint32_t& left, uint32_t& right, uint32_t& result) {
+    return tryDivideWithOverflowCheck<uint32_t, uint64_t>(left, right, result);
+}
+
+template<>
+bool TryDivide::operation(uint64_t& left, uint64_t& right, uint64_t& result) {
+    return tryDivideWithOverflowCheck<uint64_t, uint64_t>(left, right, result);
+}
+
+template<>
+bool inline TryDivide::operation(int8_t& left, int8_t& right, int8_t& result) {
+    return tryDivideWithOverflowCheck<int8_t, int16_t>(left, right, result);
+}
+
+template<>
+bool inline TryDivide::operation(int16_t& left, int16_t& right, int16_t& result) {
+    return tryDivideWithOverflowCheck<int16_t, int32_t>(left, right, result);
+}
+
+template<>
+bool inline TryDivide::operation(int32_t& left, int32_t& right, int32_t& result) {
+    return tryDivideWithOverflowCheck<int32_t, int64_t>(left, right, result);
+}
+
+template<>
+bool TryDivide::operation(int64_t& left, int64_t& right, int64_t& result) {
+    if (left == NumericLimits<int64_t>::minimum() && right == -1) {
+        return false;
+    }
+    return tryDivideWithOverflowCheck<int64_t, int64_t>(left, right, result);
+}
+
+template<>
+void Divide::operation(uint8_t& left, uint8_t& right, uint8_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    if (!TryDivide::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} / {} is not within UINT8 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Divide::operation(uint16_t& left, uint16_t& right, uint16_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    if (!TryDivide::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} / {} is not within UINT16 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Divide::operation(uint32_t& left, uint32_t& right, uint32_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    if (!TryDivide::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} / {} is not within UINT32 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Divide::operation(uint64_t& left, uint64_t& right, uint64_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    if (!TryDivide::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} / {} is not within UINT64 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Divide::operation(int8_t& left, int8_t& right, int8_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    if (!TryDivide::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} / {} is not within INT8 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Divide::operation(int16_t& left, int16_t& right, int16_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    if (!TryDivide::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} / {} is not within INT16 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Divide::operation(int32_t& left, int32_t& right, int32_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    if (!TryDivide::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} / {} is not within INT32 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Divide::operation(int64_t& left, int64_t& right, int64_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Divide by zero.");
+    }
+    if (!TryDivide::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} / {} is not within INT64 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/modulo.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/modulo.cpp
new file mode 100644
index 0000000000..55be6cdd69
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/modulo.cpp
@@ -0,0 +1,144 @@
+#include "function/arithmetic/modulo.h"
+
+#include "common/exception/overflow.h"
+#include "common/exception/runtime.h"
+#include "common/string_format.h"
+#include "common/type_utils.h"
+#include "function/cast/functions/numeric_limits.h"
+
+namespace lbug {
+namespace function {
+
+// reference from duckDB multiply.cpp
+template<class SRC_TYPE, class DST_TYPE>
+static inline bool tryModuloWithOverflowCheck(SRC_TYPE left, SRC_TYPE right, SRC_TYPE& result) {
+    DST_TYPE uresult;
+    if (left == NumericLimits<SRC_TYPE>::minimum() && right == -1) {
+        return false;
+    }
+    uresult = static_cast<DST_TYPE>(left) % static_cast<DST_TYPE>(right);
+    result = static_cast<SRC_TYPE>(uresult);
+    return true;
+}
+
+struct TryModulo {
+    template<class A, class B, class R>
+    static inline bool operation(A& left, B& right, R& result);
+};
+
+template<>
+bool inline TryModulo::operation(int8_t& left, int8_t& right, int8_t& result) {
+    return tryModuloWithOverflowCheck<int8_t, int16_t>(left, right, result);
+}
+
+template<>
+bool inline TryModulo::operation(int16_t& left, int16_t& right, int16_t& result) {
+    return tryModuloWithOverflowCheck<int16_t, int32_t>(left, right, result);
+}
+
+template<>
+bool inline TryModulo::operation(int32_t& left, int32_t& right, int32_t& result) {
+    return tryModuloWithOverflowCheck<int32_t, int64_t>(left, right, result);
+}
+
+template<>
+bool TryModulo::operation(int64_t& left, int64_t& right, int64_t& result) {
+    if (left == NumericLimits<int64_t>::minimum() && right == -1) {
+        return false;
+    }
+    return tryModuloWithOverflowCheck<int64_t, int64_t>(left, right, result);
+}
+
+template<>
+void Modulo::operation(uint8_t& left, uint8_t& right, uint8_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    result = left % right;
+}
+
+template<>
+void Modulo::operation(uint16_t& left, uint16_t& right, uint16_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    result = left % right;
+}
+
+template<>
+void Modulo::operation(uint32_t& left, uint32_t& right, uint32_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    result = left % right;
+}
+
+template<>
+void Modulo::operation(uint64_t& left, uint64_t& right, uint64_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    result = left % right;
+}
+
+template<>
+void Modulo::operation(int8_t& left, int8_t& right, int8_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    if (!TryModulo::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} % {} is not within INT8 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Modulo::operation(int16_t& left, int16_t& right, int16_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    if (!TryModulo::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} % {} is not within INT16 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Modulo::operation(int32_t& left, int32_t& right, int32_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    if (!TryModulo::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} % {} is not within INT32 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Modulo::operation(int64_t& left, int64_t& right, int64_t& result) {
+    if (right == 0) {
+        throw common::RuntimeException("Modulo by zero.");
+    }
+    if (!TryModulo::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} % {} is not within INT64 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Modulo::operation(common::int128_t& left, common::int128_t& right, common::int128_t& result) {
+    result = left % right;
+}
+
+template<>
+void Modulo::operation(common::uint128_t& left, common::uint128_t& right,
+    common::uint128_t& result) {
+    result = left % right;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/multiply.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/multiply.cpp
new file mode 100644
index 0000000000..0b9a3f15c1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/multiply.cpp
@@ -0,0 +1,230 @@
+#include "function/arithmetic/multiply.h"
+
+#include "common/exception/overflow.h"
+#include "common/string_format.h"
+#include "common/type_utils.h"
+#include "function/cast/functions/numeric_limits.h"
+
+namespace lbug {
+namespace function {
+
+// reference from duckDB multiply.cpp
+template<class SRC_TYPE, class DST_TYPE>
+static inline bool tryMultiplyWithOverflowCheck(SRC_TYPE left, SRC_TYPE right, SRC_TYPE& result) {
+    DST_TYPE uresult;
+    uresult = static_cast<DST_TYPE>(left) * static_cast<DST_TYPE>(right);
+    if (uresult < NumericLimits<SRC_TYPE>::minimum() ||
+        uresult > NumericLimits<SRC_TYPE>::maximum()) {
+        return false;
+    }
+    result = static_cast<SRC_TYPE>(uresult);
+    return true;
+}
+
+struct TryMultiply {
+    template<class A, class B, class R>
+    static inline bool operation(A& left, B& right, R& result);
+};
+
+template<>
+bool inline TryMultiply::operation(uint8_t& left, uint8_t& right, uint8_t& result) {
+    return tryMultiplyWithOverflowCheck<uint8_t, uint16_t>(left, right, result);
+}
+
+template<>
+bool inline TryMultiply::operation(uint16_t& left, uint16_t& right, uint16_t& result) {
+    return tryMultiplyWithOverflowCheck<uint16_t, uint32_t>(left, right, result);
+}
+
+template<>
+bool inline TryMultiply::operation(uint32_t& left, uint32_t& right, uint32_t& result) {
+    return tryMultiplyWithOverflowCheck<uint32_t, uint64_t>(left, right, result);
+}
+
+template<>
+bool TryMultiply::operation(uint64_t& left, uint64_t& right, uint64_t& result) {
+    if (left > right) {
+        std::swap(left, right);
+    }
+    if (left > NumericLimits<uint32_t>::maximum()) {
+        return false;
+    }
+    uint32_t c = right >> 32;
+    uint32_t d = NumericLimits<uint32_t>::maximum() & right;
+    uint64_t r = left * c;
+    uint64_t s = left * d;
+    if (r > NumericLimits<uint32_t>::maximum()) {
+        return false;
+    }
+    r <<= 32;
+    if (NumericLimits<uint64_t>::maximum() - s < r) {
+        return false;
+    }
+    return tryMultiplyWithOverflowCheck<uint64_t, uint64_t>(left, right, result);
+}
+
+template<>
+bool inline TryMultiply::operation(int8_t& left, int8_t& right, int8_t& result) {
+    return tryMultiplyWithOverflowCheck<int8_t, int16_t>(left, right, result);
+}
+
+template<>
+bool inline TryMultiply::operation(int16_t& left, int16_t& right, int16_t& result) {
+    return tryMultiplyWithOverflowCheck<int16_t, int32_t>(left, right, result);
+}
+
+template<>
+bool inline TryMultiply::operation(int32_t& left, int32_t& right, int32_t& result) {
+    return tryMultiplyWithOverflowCheck<int32_t, int64_t>(left, right, result);
+}
+
+template<>
+bool TryMultiply::operation(int64_t& left, int64_t& right, int64_t& result) {
+#if (__GNUC__ >= 5) || defined(__clang__)
+    if (__builtin_mul_overflow(left, right, &result)) {
+        return false;
+    }
+#else
+    if (left == std::numeric_limits<int64_t>::min()) {
+        if (right == 0) {
+            result = 0;
+            return true;
+        }
+        if (right == 1) {
+            result = left;
+            return true;
+        }
+        return false;
+    }
+    if (right == std::numeric_limits<int64_t>::min()) {
+        if (left == 0) {
+            result = 0;
+            return true;
+        }
+        if (left == 1) {
+            result = right;
+            return true;
+        }
+        return false;
+    }
+    uint64_t left_non_negative = uint64_t(std::abs(left));
+    uint64_t right_non_negative = uint64_t(std::abs(right));
+    // split values into 2 32-bit parts
+    uint64_t left_high_bits = left_non_negative >> 32;
+    uint64_t left_low_bits = left_non_negative & 0xffffffff;
+    uint64_t right_high_bits = right_non_negative >> 32;
+    uint64_t right_low_bits = right_non_negative & 0xffffffff;
+
+    // check the high bits of both
+    // the high bits define the overflow
+    if (left_high_bits == 0) {
+        if (right_high_bits != 0) {
+            // only the right has high bits set
+            // multiply the high bits of right with the low bits of left
+            // multiply the low bits, and carry any overflow to the high bits
+            // then check for any overflow
+            auto low_low = left_low_bits * right_low_bits;
+            auto low_high = left_low_bits * right_high_bits;
+            auto high_bits = low_high + (low_low >> 32);
+            if (high_bits & 0xffffff80000000) {
+                // there is! abort
+                return false;
+            }
+        }
+    } else if (right_high_bits == 0) {
+        // only the left has high bits set
+        // multiply the high bits of left with the low bits of right
+        // multiply the low bits, and carry any overflow to the high bits
+        // then check for any overflow
+        auto low_low = left_low_bits * right_low_bits;
+        auto high_low = left_high_bits * right_low_bits;
+        auto high_bits = high_low + (low_low >> 32);
+        if (high_bits & 0xffffff80000000) {
+            // there is! abort
+            return false;
+        }
+    } else {
+        // both left and right have high bits set: guaranteed overflow
+        // abort!
+        return false;
+    }
+    // now we know that there is no overflow, we can just perform the multiplication
+    result = left * right;
+#endif
+    return true;
+}
+
+template<>
+void Multiply::operation(uint8_t& left, uint8_t& right, uint8_t& result) {
+    if (!TryMultiply::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} * {} is not within UINT8 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Multiply::operation(uint16_t& left, uint16_t& right, uint16_t& result) {
+    if (!TryMultiply::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} * {} is not within UINT16 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Multiply::operation(uint32_t& left, uint32_t& right, uint32_t& result) {
+    if (!TryMultiply::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} * {} is not within UINT32 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Multiply::operation(uint64_t& left, uint64_t& right, uint64_t& result) {
+    if (!TryMultiply::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} * {} is not within UINT64 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Multiply::operation(int8_t& left, int8_t& right, int8_t& result) {
+    if (!TryMultiply::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} * {} is not within INT8 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Multiply::operation(int16_t& left, int16_t& right, int16_t& result) {
+    if (!TryMultiply::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} * {} is not within INT16 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Multiply::operation(int32_t& left, int32_t& right, int32_t& result) {
+    if (!TryMultiply::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} * {} is not within INT32 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Multiply::operation(int64_t& left, int64_t& right, int64_t& result) {
+    if (!TryMultiply::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} * {} is not within INT64 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/negate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/negate.cpp
new file mode 100644
index 0000000000..4efa5c291c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/negate.cpp
@@ -0,0 +1,79 @@
+#include "function/arithmetic/negate.h"
+
+#include "common/exception/overflow.h"
+#include "common/string_format.h"
+#include "common/type_utils.h"
+#include "function/cast/functions/numeric_limits.h"
+
+namespace lbug {
+namespace function {
+
+// reference from duckDB arithmetic.cpp
+template<class SRC_TYPE>
+static inline bool NegateInPlaceWithOverflowCheck(SRC_TYPE input, SRC_TYPE& result) {
+    if (input == NumericLimits<SRC_TYPE>::minimum()) {
+        return false;
+    }
+    result = -input;
+    return true;
+}
+
+struct NegateInPlace {
+    template<class T>
+    static inline bool operation(T& input, T& result);
+};
+
+template<>
+bool inline NegateInPlace::operation(int8_t& input, int8_t& result) {
+    return NegateInPlaceWithOverflowCheck<int8_t>(input, result);
+}
+
+template<>
+bool inline NegateInPlace::operation(int16_t& input, int16_t& result) {
+    return NegateInPlaceWithOverflowCheck<int16_t>(input, result);
+}
+
+template<>
+bool inline NegateInPlace::operation(int32_t& input, int32_t& result) {
+    return NegateInPlaceWithOverflowCheck<int32_t>(input, result);
+}
+
+template<>
+bool NegateInPlace::operation(int64_t& input, int64_t& result) {
+    return NegateInPlaceWithOverflowCheck<int64_t>(input, result);
+}
+
+template<>
+void Negate::operation(int8_t& input, int8_t& result) {
+    if (!NegateInPlace::operation(input, result)) {
+        throw common::OverflowException{common::stringFormat(
+            "Value {} cannot be negated within INT8 range.", common::TypeUtils::toString(input))};
+    }
+}
+
+template<>
+void Negate::operation(int16_t& input, int16_t& result) {
+    if (!NegateInPlace::operation(input, result)) {
+        throw common::OverflowException{common::stringFormat(
+            "Value {} cannot be negated within INT16 range.", common::TypeUtils::toString(input))};
+    }
+}
+
+template<>
+void Negate::operation(int32_t& input, int32_t& result) {
+    if (!NegateInPlace::operation(input, result)) {
+        throw common::OverflowException{common::stringFormat(
+            "Value {} cannot be negated within INT32 range.", common::TypeUtils::toString(input))};
+    }
+}
+
+template<>
+void Negate::operation(int64_t& input, int64_t& result) {
+    if (!NegateInPlace::operation(input, result)) {
+        throw common::OverflowException{common::stringFormat(
+            "Value {} cannot be negated within INT64 range.", common::TypeUtils::toString(input))};
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/rand_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/rand_function.cpp
new file mode 100644
index 0000000000..6298ec6df8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/rand_function.cpp
@@ -0,0 +1,27 @@
+#include "common/random_engine.h"
+#include "function/arithmetic/vector_arithmetic_functions.h"
+#include "function/scalar_function.h"
+#include "main/client_context.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+struct Rand {
+    static void operation(double& result, void* dataPtr) {
+        auto context = reinterpret_cast<FunctionBindData*>(dataPtr)->clientContext;
+        result = static_cast<double>(RandomEngine::Get(*context)->nextRandomInteger()) /
+                 static_cast<double>(UINT32_MAX);
+    }
+};
+
+function_set RandFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(std::make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{},
+        LogicalTypeID::DOUBLE, ScalarFunction::NullaryAuxilaryExecFunction<double, Rand>));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/set_seed.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/set_seed.cpp
new file mode 100644
index 0000000000..c0cc4e07d8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/set_seed.cpp
@@ -0,0 +1,27 @@
+#include "common/random_engine.h"
+#include "function/arithmetic/vector_arithmetic_functions.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+struct SetSeed {
+    static void operation(double& seed, void* dataPtr) {
+        auto context = reinterpret_cast<FunctionBindData*>(dataPtr)->clientContext;
+        RandomEngine::Get(*context)->setSeed(
+            static_cast<uint64_t>(seed * static_cast<double>(UINT64_MAX)));
+    }
+};
+
+function_set SetSeedFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        std::make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::DOUBLE},
+            LogicalTypeID::INT32, ScalarFunction::UnarySetSeedFunction<double, int, SetSeed>));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/subtract.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/subtract.cpp
new file mode 100644
index 0000000000..07b05b7b94
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/arithmetic/subtract.cpp
@@ -0,0 +1,171 @@
+#include "function/arithmetic/subtract.h"
+
+#include "common/exception/overflow.h"
+#include "common/string_format.h"
+#include "common/type_utils.h"
+#include "function/cast/functions/numeric_limits.h"
+
+namespace lbug {
+namespace function {
+
+// reference from duckDB subtract.cpp
+template<class SRC_TYPE, class DST_TYPE>
+static inline bool SubtractInPlaceWithOverflowCheck(SRC_TYPE left, SRC_TYPE right,
+    SRC_TYPE& result) {
+    DST_TYPE uresult;
+    uresult = static_cast<DST_TYPE>(left) - static_cast<DST_TYPE>(right);
+    if (uresult < NumericLimits<SRC_TYPE>::minimum() ||
+        uresult > NumericLimits<SRC_TYPE>::maximum()) {
+        return false;
+    }
+    result = static_cast<SRC_TYPE>(uresult);
+    return true;
+}
+
+struct SubtractInPlace {
+    template<class A, class B, class R>
+    static inline bool operation(A& left, B& right, R& result);
+};
+
+template<>
+bool inline SubtractInPlace::operation(uint8_t& left, uint8_t& right, uint8_t& result) {
+    if (right > left) {
+        return false;
+    }
+    return SubtractInPlaceWithOverflowCheck<uint8_t, uint16_t>(left, right, result);
+}
+
+template<>
+bool inline SubtractInPlace::operation(uint16_t& left, uint16_t& right, uint16_t& result) {
+    if (right > left) {
+        return false;
+    }
+    return SubtractInPlaceWithOverflowCheck<uint16_t, uint32_t>(left, right, result);
+}
+
+template<>
+bool inline SubtractInPlace::operation(uint32_t& left, uint32_t& right, uint32_t& result) {
+    if (right > left) {
+        return false;
+    }
+    return SubtractInPlaceWithOverflowCheck<uint32_t, uint64_t>(left, right, result);
+}
+
+template<>
+bool SubtractInPlace::operation(uint64_t& left, uint64_t& right, uint64_t& result) {
+    if (right > left) {
+        return false;
+    }
+    return SubtractInPlaceWithOverflowCheck<uint64_t, uint64_t>(left, right, result);
+}
+
+template<>
+bool inline SubtractInPlace::operation(int8_t& left, int8_t& right, int8_t& result) {
+    return SubtractInPlaceWithOverflowCheck<int8_t, int16_t>(left, right, result);
+}
+
+template<>
+bool inline SubtractInPlace::operation(int16_t& left, int16_t& right, int16_t& result) {
+    return SubtractInPlaceWithOverflowCheck<int16_t, int32_t>(left, right, result);
+}
+
+template<>
+bool inline SubtractInPlace::operation(int32_t& left, int32_t& right, int32_t& result) {
+    return SubtractInPlaceWithOverflowCheck<int32_t, int64_t>(left, right, result);
+}
+
+template<>
+bool SubtractInPlace::operation(int64_t& left, int64_t& right, int64_t& result) {
+#if (__GNUC__ >= 5) || defined(__clang__)
+    if (__builtin_sub_overflow(left, right, &result)) {
+        return false;
+    }
+#else
+    if (right < 0) {
+        if (NumericLimits<int64_t>::maximum() + right < left) {
+            return false;
+        }
+    } else {
+        if (NumericLimits<int64_t>::minimum() + right > left) {
+            return false;
+        }
+    }
+    result = left - right;
+#endif
+    return true;
+}
+
+template<>
+void Subtract::operation(uint8_t& left, uint8_t& right, uint8_t& result) {
+    if (!SubtractInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} - {} is not within UINT8 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Subtract::operation(uint16_t& left, uint16_t& right, uint16_t& result) {
+    if (!SubtractInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} - {} is not within UINT16 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Subtract::operation(uint32_t& left, uint32_t& right, uint32_t& result) {
+    if (!SubtractInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} - {} is not within UINT32 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Subtract::operation(uint64_t& left, uint64_t& right, uint64_t& result) {
+    if (!SubtractInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} - {} is not within UINT64 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Subtract::operation(int8_t& left, int8_t& right, int8_t& result) {
+    if (!SubtractInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} - {} is not within INT8 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Subtract::operation(int16_t& left, int16_t& right, int16_t& result) {
+    if (!SubtractInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} - {} is not within INT16 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Subtract::operation(int32_t& left, int32_t& right, int32_t& result) {
+    if (!SubtractInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} - {} is not within INT32 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+template<>
+void Subtract::operation(int64_t& left, int64_t& right, int64_t& result) {
+    if (!SubtractInPlace::operation(left, right, result)) {
+        throw common::OverflowException{
+            common::stringFormat("Value {} - {} is not within INT64 range.",
+                common::TypeUtils::toString(left), common::TypeUtils::toString(right))};
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/array/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/array/CMakeLists.txt
new file mode 100644
index 0000000000..a085ca8168
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/array/CMakeLists.txt
@@ -0,0 +1,8 @@
+add_library(lbug_function_array
+        OBJECT
+        array_functions.cpp
+        array_value.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_array>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/array/array_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/array/array_functions.cpp
new file mode 100644
index 0000000000..be9f5d030b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/array/array_functions.cpp
@@ -0,0 +1,205 @@
+#include "binder/expression/literal_expression.h"
+#include "common/exception/binder.h"
+#include "function/array/functions/array_cosine_similarity.h"
+#include "function/array/functions/array_cross_product.h"
+#include "function/array/functions/array_distance.h"
+#include "function/array/functions/array_inner_product.h"
+#include "function/array/functions/array_squared_distance.h"
+#include "function/array/vector_array_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static LogicalType interpretLogicalType(const binder::Expression* expr) {
+    if (expr->expressionType == ExpressionType::LITERAL &&
+        expr->dataType.getLogicalTypeID() == LogicalTypeID::LIST) {
+        auto numChildren =
+            expr->constPtrCast<binder::LiteralExpression>()->getValue().getChildrenSize();
+        return LogicalType::ARRAY(ListType::getChildType(expr->dataType).copy(), numChildren);
+    }
+    return expr->dataType.copy();
+}
+
+std::unique_ptr<FunctionBindData> ArrayCrossProductBindFunc(const ScalarBindFuncInput& input) {
+    auto leftType = interpretLogicalType(input.arguments[0].get());
+    auto rightType = interpretLogicalType(input.arguments[1].get());
+    if (leftType != rightType) {
+        throw BinderException(
+            stringFormat("{} requires both arrays to have the same element type and size of 3",
+                ArrayCrossProductFunction::name));
+    }
+    scalar_func_exec_t execFunc;
+    switch (ArrayType::getChildType(leftType).getLogicalTypeID()) {
+    case LogicalTypeID::INT128:
+        execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t,
+            list_entry_t, ArrayCrossProduct<int128_t>>;
+        break;
+    case LogicalTypeID::INT64:
+        execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t,
+            list_entry_t, ArrayCrossProduct<int64_t>>;
+        break;
+    case LogicalTypeID::INT32:
+        execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t,
+            list_entry_t, ArrayCrossProduct<int32_t>>;
+        break;
+    case LogicalTypeID::INT16:
+        execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t,
+            list_entry_t, ArrayCrossProduct<int16_t>>;
+        break;
+    case LogicalTypeID::INT8:
+        execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t,
+            list_entry_t, ArrayCrossProduct<int8_t>>;
+        break;
+    case LogicalTypeID::FLOAT:
+        execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t,
+            list_entry_t, ArrayCrossProduct<float>>;
+        break;
+    case LogicalTypeID::DOUBLE:
+        execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t,
+            list_entry_t, ArrayCrossProduct<double>>;
+        break;
+    default:
+        throw BinderException{
+            stringFormat("{} can only be applied on array of floating points or signed integers",
+                ArrayCrossProductFunction::name)};
+    }
+    input.definition->ptrCast<ScalarFunction>()->execFunc = execFunc;
+    const auto resultType = LogicalType::ARRAY(ArrayType::getChildType(leftType).copy(),
+        ArrayType::getNumElements(leftType));
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+}
+
+function_set ArrayCrossProductFunction::getFunctionSet() {
+    function_set result;
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{
+            LogicalTypeID::ARRAY,
+            LogicalTypeID::ARRAY,
+        },
+        LogicalTypeID::ARRAY);
+    func->bindFunc = ArrayCrossProductBindFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+static LogicalType getChildType(const LogicalType& type) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::ARRAY:
+        return ArrayType::getChildType(type).copy();
+    case LogicalTypeID::LIST:
+        return ListType::getChildType(type).copy();
+        // LCOV_EXCL_START
+    default:
+        throw BinderException(stringFormat(
+            "Cannot retrieve child type of type {}. LIST or ARRAY is expected.", type.toString()));
+        // LCOV_EXCL_STOP
+    }
+}
+
+static void validateChildType(const LogicalType& type, const std::string& functionName) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::FLOAT:
+        return;
+    default:
+        throw BinderException(
+            stringFormat("{} requires argument type to be FLOAT[] or DOUBLE[].", functionName));
+    }
+}
+
+static LogicalType validateArrayFunctionParameters(const LogicalType& leftType,
+    const LogicalType& rightType, const std::string& functionName) {
+    auto leftChildType = getChildType(leftType);
+    auto rightChildType = getChildType(rightType);
+    validateChildType(leftChildType, functionName);
+    validateChildType(rightChildType, functionName);
+    if (leftType.getLogicalTypeID() == common::LogicalTypeID::ARRAY) {
+        return leftType.copy();
+    } else if (rightType.getLogicalTypeID() == common::LogicalTypeID::ARRAY) {
+        return rightType.copy();
+    }
+    throw BinderException(
+        stringFormat("{} requires at least one argument to be ARRAY but all parameters are LIST.",
+            functionName));
+}
+
+template<typename OPERATION, typename RESULT>
+static scalar_func_exec_t getBinaryArrayExecFuncSwitchResultType() {
+    auto execFunc =
+        ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t, RESULT, OPERATION>;
+    return execFunc;
+}
+
+template<typename OPERATION>
+scalar_func_exec_t getScalarExecFunc(LogicalType type) {
+    scalar_func_exec_t execFunc;
+    switch (ArrayType::getChildType(type).getLogicalTypeID()) {
+    case LogicalTypeID::FLOAT:
+        execFunc = getBinaryArrayExecFuncSwitchResultType<OPERATION, float>();
+        break;
+    case LogicalTypeID::DOUBLE:
+        execFunc = getBinaryArrayExecFuncSwitchResultType<OPERATION, double>();
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return execFunc;
+}
+
+template<typename OPERATION>
+std::unique_ptr<FunctionBindData> arrayTemplateBindFunc(std::string functionName,
+    ScalarBindFuncInput input) {
+    auto leftType = interpretLogicalType(input.arguments[0].get());
+    auto rightType = interpretLogicalType(input.arguments[1].get());
+    auto paramType = validateArrayFunctionParameters(leftType, rightType, functionName);
+    input.definition->ptrCast<ScalarFunction>()->execFunc =
+        std::move(getScalarExecFunc<OPERATION>(paramType.copy()));
+    auto bindData = std::make_unique<FunctionBindData>(ArrayType::getChildType(paramType).copy());
+    std::vector<LogicalType> paramTypes;
+    for (auto& _ : input.arguments) {
+        (void)_;
+        bindData->paramTypes.push_back(paramType.copy());
+    }
+    return bindData;
+}
+
+template<typename OPERATION>
+function_set templateGetFunctionSet(const std::string& functionName) {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(functionName,
+        std::vector<LogicalTypeID>{
+            LogicalTypeID::ARRAY,
+            LogicalTypeID::ARRAY,
+        },
+        LogicalTypeID::ANY);
+    function->bindFunc =
+        std::bind(arrayTemplateBindFunc<OPERATION>, functionName, std::placeholders::_1);
+    result.push_back(std::move(function));
+    return result;
+}
+
+function_set ArrayCosineSimilarityFunction::getFunctionSet() {
+    return templateGetFunctionSet<ArrayCosineSimilarity>(name);
+}
+
+function_set ArrayDistanceFunction::getFunctionSet() {
+    return templateGetFunctionSet<ArrayDistance>(name);
+}
+
+function_set ArraySquaredDistanceFunction::getFunctionSet() {
+    return templateGetFunctionSet<ArraySquaredDistance>(name);
+}
+
+function_set ArrayInnerProductFunction::getFunctionSet() {
+    return templateGetFunctionSet<ArrayInnerProduct>(name);
+}
+
+function_set ArrayDotProductFunction::getFunctionSet() {
+    return templateGetFunctionSet<ArrayInnerProduct>(name);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/array/array_value.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/array/array_value.cpp
new file mode 100644
index 0000000000..4582e219f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/array/array_value.cpp
@@ -0,0 +1,38 @@
+#include "binder/expression/expression_util.h"
+#include "function/array/vector_array_functions.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    LogicalType combinedType(LogicalTypeID::ANY);
+    binder::ExpressionUtil::tryCombineDataType(input.arguments, combinedType);
+    if (combinedType.getLogicalTypeID() == LogicalTypeID::ANY) {
+        combinedType = LogicalType::STRING();
+    }
+    auto resultType = LogicalType::ARRAY(combinedType.copy(), input.arguments.size());
+    auto bindData = std::make_unique<FunctionBindData>(std::move(resultType));
+    for (auto& _ : input.arguments) {
+        (void)_;
+        bindData->paramTypes.push_back(combinedType.copy());
+    }
+    return bindData;
+}
+
+function_set ArrayValueFunction::getFunctionSet() {
+    function_set result;
+    auto function =
+        std::make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::ANY},
+            LogicalTypeID::ARRAY, ListCreationFunction::execFunc);
+    function->bindFunc = bindFunc;
+    function->isVarLength = true;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/base_lower_upper_operation.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/base_lower_upper_operation.cpp
new file mode 100644
index 0000000000..38bd1a1f38
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/base_lower_upper_operation.cpp
@@ -0,0 +1,68 @@
+#include "common/exception/runtime.h"
+#include "common/string_format.h"
+#include "function/string/functions/base_lower_upper_function.h"
+#include "utf8proc.h"
+
+using namespace lbug::common;
+using namespace lbug::utf8proc;
+
+namespace lbug {
+namespace function {
+
+uint32_t BaseLowerUpperFunction::getResultLen(char* inputStr, uint32_t inputLen, bool isUpper) {
+    uint32_t outputLength = 0;
+    for (uint32_t i = 0; i < inputLen;) {
+        // For UTF-8 characters, changing case can increase / decrease total byte length.
+        // Eg.: 'ß' lower case -> 'SS' upper case [more bytes + more chars]
+        if (inputStr[i] & 0x80) {
+            int size = 0;
+            int codepoint = utf8proc_codepoint(inputStr + i, size);
+            if (codepoint < 0) {
+                // LCOV_EXCL_START
+                // TODO(Xiyang): We shouldn't allow invalid UTF-8 to enter a string column.
+                std::string funcName = isUpper ? "UPPER" : "LOWER";
+                throw RuntimeException(
+                    common::stringFormat("Failed calling {}: Invalid UTF-8.", funcName));
+                // LCOV_EXCL_STOP
+            }
+            int convertedCodepoint =
+                isUpper ? utf8proc_toupper(codepoint) : utf8proc_tolower(codepoint);
+            int newSize = utf8proc_codepoint_length(convertedCodepoint);
+            KU_ASSERT(newSize >= 0);
+            outputLength += newSize;
+            i += size;
+        } else {
+            outputLength++;
+            i++;
+        }
+    }
+    return outputLength;
+}
+
+void BaseLowerUpperFunction::convertCharCase(char* result, const char* input, int32_t charPos,
+    bool toUpper, int& originalSize, int& newSize) {
+    originalSize = 1;
+    newSize = 1;
+    if (input[charPos] & 0x80) {
+        auto codepoint = utf8proc_codepoint(input + charPos, originalSize);
+        KU_ASSERT(codepoint >= 0); // Validity ensured by getResultLen.
+        int convertedCodepoint =
+            toUpper ? utf8proc_toupper(codepoint) : utf8proc_tolower(codepoint);
+        utf8proc_codepoint_to_utf8(convertedCodepoint, newSize, result);
+    } else {
+        *result = toUpper ? toupper(input[charPos]) : tolower(input[charPos]);
+    }
+}
+
+void BaseLowerUpperFunction::convertCase(char* result, uint32_t len, char* input, bool toUpper) {
+    int originalSize = 0;
+    int newSize = 0;
+    for (auto i = 0u; i < len;) {
+        convertCharCase(result, input, i, toUpper, originalSize, newSize);
+        i += originalSize;
+        result += newSize;
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/built_in_function_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/built_in_function_utils.cpp
new file mode 100644
index 0000000000..c445af2ab2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/built_in_function_utils.cpp
@@ -0,0 +1,558 @@
+#include "function/built_in_function_utils.h"
+
+#include <sstream>
+
+#include "catalog/catalog_entry/function_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "function/aggregate_function.h"
+#include "function/arithmetic/vector_arithmetic_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+static void validateNonEmptyCandidateFunctions(std::vector<AggregateFunction*>& candidateFunctions,
+    const std::string& name, const std::vector<LogicalType>& inputTypes, bool isDistinct,
+    const function::function_set& set);
+static void validateNonEmptyCandidateFunctions(std::vector<Function*>& candidateFunctions,
+    const std::string& name, const std::vector<LogicalType>& inputTypes,
+    const function::function_set& set);
+
+Function* BuiltInFunctionsUtils::matchFunction(const std::string& name,
+    const std::vector<LogicalType>& inputTypes,
+    const catalog::FunctionCatalogEntry* functionEntry) {
+    auto& functionSet = functionEntry->getFunctionSet();
+    std::vector<Function*> candidateFunctions;
+    uint32_t minCost = UINT32_MAX;
+    for (auto& function : functionSet) {
+        auto func = function.get();
+        auto cost = getFunctionCost(inputTypes, func, functionEntry->getType());
+        if (cost == UINT32_MAX) {
+            continue;
+        }
+        if (cost < minCost) {
+            candidateFunctions.clear();
+            candidateFunctions.push_back(func);
+            minCost = cost;
+        } else if (cost == minCost) {
+            candidateFunctions.push_back(func);
+        }
+    }
+    validateNonEmptyCandidateFunctions(candidateFunctions, name, inputTypes, functionSet);
+    if (candidateFunctions.size() > 1) {
+        return getBestMatch(candidateFunctions);
+    }
+    validateSpecialCases(candidateFunctions, name, inputTypes, functionSet);
+    return candidateFunctions[0];
+}
+
+AggregateFunction* BuiltInFunctionsUtils::matchAggregateFunction(const std::string& name,
+    const std::vector<common::LogicalType>& inputTypes, bool isDistinct,
+    const catalog::FunctionCatalogEntry* functionEntry) {
+    auto& functionSet = functionEntry->getFunctionSet();
+    std::vector<AggregateFunction*> candidateFunctions;
+    for (auto& function : functionSet) {
+        auto aggregateFunction = function->ptrCast<AggregateFunction>();
+        auto cost = getAggregateFunctionCost(inputTypes, isDistinct, aggregateFunction);
+        if (cost == UINT32_MAX) {
+            continue;
+        }
+        candidateFunctions.push_back(aggregateFunction);
+    }
+    validateNonEmptyCandidateFunctions(candidateFunctions, name, inputTypes, isDistinct,
+        functionSet);
+    KU_ASSERT(candidateFunctions.size() == 1);
+    return candidateFunctions[0];
+}
+
+uint32_t BuiltInFunctionsUtils::getCastCost(LogicalTypeID inputTypeID, LogicalTypeID targetTypeID) {
+    if (inputTypeID == targetTypeID) {
+        return 0;
+    }
+    // TODO(Jiamin): should check any type
+    if (inputTypeID == LogicalTypeID::ANY || targetTypeID == LogicalTypeID::ANY) {
+        // anything can be cast to ANY type for (almost no) cost
+        return 1;
+    }
+    if (targetTypeID == LogicalTypeID::STRING) {
+        return castFromString(inputTypeID);
+    }
+    switch (inputTypeID) {
+    case LogicalTypeID::INT64:
+        return castInt64(targetTypeID);
+    case LogicalTypeID::INT32:
+        return castInt32(targetTypeID);
+    case LogicalTypeID::INT16:
+        return castInt16(targetTypeID);
+    case LogicalTypeID::INT8:
+        return castInt8(targetTypeID);
+    case LogicalTypeID::UINT64:
+        return castUInt64(targetTypeID);
+    case LogicalTypeID::UINT32:
+        return castUInt32(targetTypeID);
+    case LogicalTypeID::UINT16:
+        return castUInt16(targetTypeID);
+    case LogicalTypeID::UINT8:
+        return castUInt8(targetTypeID);
+    case LogicalTypeID::INT128:
+        return castInt128(targetTypeID);
+    case LogicalTypeID::DOUBLE:
+        return castDouble(targetTypeID);
+    case LogicalTypeID::FLOAT:
+        return castFloat(targetTypeID);
+    case LogicalTypeID::DECIMAL:
+        return castDecimal(targetTypeID);
+    case LogicalTypeID::DATE:
+        return castDate(targetTypeID);
+    case LogicalTypeID::UUID:
+        return castUUID(targetTypeID);
+    case LogicalTypeID::SERIAL:
+        return castSerial(targetTypeID);
+    case LogicalTypeID::TIMESTAMP_SEC:
+    case LogicalTypeID::TIMESTAMP_MS:
+    case LogicalTypeID::TIMESTAMP_NS:
+    case LogicalTypeID::TIMESTAMP_TZ:
+        // currently don't allow timestamp to other timestamp types
+        // When we implement this in the future, revise tryGetMaxLogicalTypeID
+        return castTimestamp(targetTypeID);
+    case LogicalTypeID::LIST:
+        return castList(targetTypeID);
+    case LogicalTypeID::ARRAY:
+        return castArray(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::getTargetTypeCost(LogicalTypeID typeID) {
+    switch (typeID) {
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT16:
+        return 100;
+    case LogicalTypeID::INT64:
+        return 101;
+    case LogicalTypeID::INT32:
+        return 102;
+    case LogicalTypeID::INT128:
+        return 103;
+    case LogicalTypeID::DECIMAL:
+        return 104;
+    case LogicalTypeID::DOUBLE:
+        return 105;
+    case LogicalTypeID::TIMESTAMP:
+        return 120;
+    case LogicalTypeID::STRING:
+        return 149;
+    case LogicalTypeID::STRUCT:
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::UNION:
+        return 160;
+    default:
+        return 110;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castInt64(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::DECIMAL:
+        return getTargetTypeCost(targetTypeID);
+    case LogicalTypeID::SERIAL:
+        return 0;
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castInt32(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::DECIMAL:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castInt16(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::DECIMAL:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castInt8(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::DECIMAL:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castUInt64(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::DECIMAL:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castUInt32(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::DECIMAL:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castUInt16(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::DECIMAL:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castUInt8(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::DECIMAL:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castInt128(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::DECIMAL:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castUUID(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::STRING:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castDouble(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castFloat(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::DOUBLE:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castDecimal(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::FLOAT:
+    case LogicalTypeID::DOUBLE:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castDate(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::TIMESTAMP:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castSerial(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::INT64:
+        return 0;
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castTimestamp(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::TIMESTAMP:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castFromString(LogicalTypeID inputTypeID) {
+    switch (inputTypeID) {
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::INTERNAL_ID:
+    case LogicalTypeID::NODE:
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL:
+        return UNDEFINED_CAST_COST;
+    default: // Any other inputTypeID can be cast to String, but this cast has a high cost
+        return getTargetTypeCost(LogicalTypeID::STRING);
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castList(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::ARRAY:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+uint32_t BuiltInFunctionsUtils::castArray(LogicalTypeID targetTypeID) {
+    switch (targetTypeID) {
+    case LogicalTypeID::LIST:
+        return getTargetTypeCost(targetTypeID);
+    default:
+        return UNDEFINED_CAST_COST;
+    }
+}
+
+// When there is multiple candidates functions, e.g. double + int and double + double for input
+// "1.5 + parameter", we prefer the one without any implicit casting i.e. double + double.
+// Additionally, we prefer function with string parameter because string is most permissive and
+// can be cast to any type.
+Function* BuiltInFunctionsUtils::getBestMatch(std::vector<Function*>& functionsToMatch) {
+    KU_ASSERT(functionsToMatch.size() > 1);
+    Function* result = nullptr;
+    auto cost = UNDEFINED_CAST_COST;
+    for (auto& function : functionsToMatch) {
+        auto currentCost = 0u;
+        std::unordered_set<LogicalTypeID> distinctParameterTypes;
+        for (auto& parameterTypeID : function->parameterTypeIDs) {
+            if (parameterTypeID != LogicalTypeID::STRING) {
+                currentCost++;
+            }
+            if (!distinctParameterTypes.contains(parameterTypeID)) {
+                currentCost++;
+                distinctParameterTypes.insert(parameterTypeID);
+            }
+        }
+        if (currentCost < cost) {
+            cost = currentCost;
+            result = function;
+        }
+    }
+    KU_ASSERT(result != nullptr);
+    return result;
+}
+
+uint32_t BuiltInFunctionsUtils::getFunctionCost(const std::vector<LogicalType>& inputTypes,
+    Function* function, CatalogEntryType type) {
+    bool isVarLength = (type == CatalogEntryType::SCALAR_FUNCTION_ENTRY ?
+                            function->constPtrCast<ScalarFunction>()->isVarLength :
+                            false);
+    if (isVarLength) {
+        KU_ASSERT(function->parameterTypeIDs.size() == 1);
+        return matchVarLengthParameters(inputTypes, function->parameterTypeIDs[0]);
+    }
+    return matchParameters(inputTypes, function->parameterTypeIDs);
+}
+
+uint32_t BuiltInFunctionsUtils::getAggregateFunctionCost(const std::vector<LogicalType>& inputTypes,
+    bool isDistinct, AggregateFunction* function) {
+    if (inputTypes.size() != function->parameterTypeIDs.size() ||
+        isDistinct != function->isDistinct) {
+        return UINT32_MAX;
+    }
+    for (auto i = 0u; i < inputTypes.size(); ++i) {
+        if (function->parameterTypeIDs[i] == LogicalTypeID::ANY) {
+            continue;
+        } else if (inputTypes[i].getLogicalTypeID() != function->parameterTypeIDs[i]) {
+            return UINT32_MAX;
+        }
+    }
+    return 0;
+}
+
+uint32_t BuiltInFunctionsUtils::matchParameters(const std::vector<LogicalType>& inputTypes,
+    const std::vector<LogicalTypeID>& targetTypeIDs) {
+    if (inputTypes.size() != targetTypeIDs.size()) {
+        return UINT32_MAX;
+    }
+    auto cost = 0u;
+    for (auto i = 0u; i < inputTypes.size(); ++i) {
+        auto castCost = getCastCost(inputTypes[i].getLogicalTypeID(), targetTypeIDs[i]);
+        if (castCost == UNDEFINED_CAST_COST) {
+            return UINT32_MAX;
+        }
+        cost += castCost;
+    }
+    return cost;
+}
+
+uint32_t BuiltInFunctionsUtils::matchVarLengthParameters(const std::vector<LogicalType>& inputTypes,
+    LogicalTypeID targetTypeID) {
+    auto cost = 0u;
+    for (const auto& inputType : inputTypes) {
+        auto castCost = getCastCost(inputType.getLogicalTypeID(), targetTypeID);
+        if (castCost == UNDEFINED_CAST_COST) {
+            return UINT32_MAX;
+        }
+        cost += castCost;
+    }
+    return cost;
+}
+
+void BuiltInFunctionsUtils::validateSpecialCases(std::vector<Function*>& candidateFunctions,
+    const std::string& name, const std::vector<LogicalType>& inputTypes,
+    const function::function_set& set) {
+    // special case for add func
+    if (name == AddFunction::name) {
+        auto targetType0 = candidateFunctions[0]->parameterTypeIDs[0];
+        auto targetType1 = candidateFunctions[0]->parameterTypeIDs[1];
+        auto inputType0 = inputTypes[0].getLogicalTypeID();
+        auto inputType1 = inputTypes[1].getLogicalTypeID();
+        if ((inputType0 != LogicalTypeID::STRING || inputType1 != LogicalTypeID::STRING) &&
+            targetType0 == LogicalTypeID::STRING && targetType1 == LogicalTypeID::STRING) {
+            std::string supportedInputsString;
+            for (auto& function : set) {
+                supportedInputsString += function->signatureToString() + "\n";
+            }
+            throw BinderException("Cannot match a built-in function for given function " + name +
+                                  LogicalTypeUtils::toString(inputTypes) +
+                                  ". Supported inputs are\n" + supportedInputsString);
+        }
+    }
+}
+
+static std::string alignedString(const std::string& input) {
+    std::istringstream stream(input);
+    std::ostringstream result;
+    std::string line;
+    std::string prefix = "Expected: ";
+    std::string padding(prefix.length(), ' ');
+    bool firstLine = true;
+    while (std::getline(stream, line)) {
+        if (firstLine) {
+            result << line << '\n';
+            firstLine = false;
+        } else {
+            result << padding << line << '\n';
+        }
+    }
+    return result.str();
+}
+
+std::string BuiltInFunctionsUtils::getFunctionMatchFailureMsg(const std::string name,
+    const std::vector<LogicalType>& inputTypes, const std::string& supportedInputs,
+    bool isDistinct) {
+    std::string result = stringFormat("Function {} did not receive correct arguments:\n", name);
+    result += stringFormat("Actual:   {}{}\n", isDistinct ? "DISTINCT " : "",
+        inputTypes.empty() ? "()" : LogicalTypeUtils::toString(inputTypes));
+    result += stringFormat("Expected: {}\n",
+        supportedInputs.empty() ? "()" : alignedString(supportedInputs));
+    return result;
+}
+
+void validateNonEmptyCandidateFunctions(std::vector<AggregateFunction*>& candidateFunctions,
+    const std::string& name, const std::vector<LogicalType>& inputTypes, bool isDistinct,
+    const function::function_set& set) {
+    if (candidateFunctions.empty()) {
+        std::string supportedInputsString;
+        for (auto& function : set) {
+            auto aggregateFunction = function->constPtrCast<AggregateFunction>();
+            if (aggregateFunction->isDistinct) {
+                supportedInputsString += "DISTINCT ";
+            }
+            supportedInputsString += aggregateFunction->signatureToString() + "\n";
+        }
+        throw BinderException(BuiltInFunctionsUtils::getFunctionMatchFailureMsg(name, inputTypes,
+            supportedInputsString, isDistinct));
+    }
+}
+
+void validateNonEmptyCandidateFunctions(std::vector<Function*>& candidateFunctions,
+    const std::string& name, const std::vector<LogicalType>& inputTypes,
+    const function::function_set& set) {
+    if (candidateFunctions.empty()) {
+        std::string supportedInputsString;
+        for (auto& function : set) {
+            if (function->parameterTypeIDs.empty()) {
+                continue;
+            }
+            supportedInputsString += function->signatureToString() + "\n";
+        }
+        throw BinderException(BuiltInFunctionsUtils::getFunctionMatchFailureMsg(name, inputTypes,
+            supportedInputsString));
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast/CMakeLists.txt
new file mode 100644
index 0000000000..a32d293977
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_function_cast
+        OBJECT
+        cast_array.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_cast>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast/cast_array.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast/cast_array.cpp
new file mode 100644
index 0000000000..4f3c500eb6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast/cast_array.cpp
@@ -0,0 +1,155 @@
+#include "function/cast/functions/cast_array.h"
+
+#include "common/exception/conversion.h"
+#include "common/type_utils.h"
+
+namespace lbug {
+namespace function {
+
+bool CastArrayHelper::checkCompatibleNestedTypes(LogicalTypeID sourceTypeID,
+    LogicalTypeID targetTypeID) {
+    switch (sourceTypeID) {
+    case LogicalTypeID::ANY: {
+        return true;
+    }
+    case LogicalTypeID::LIST: {
+        return targetTypeID == LogicalTypeID::ARRAY || targetTypeID == LogicalTypeID::LIST;
+    }
+    case LogicalTypeID::UNION:
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::STRUCT: {
+        return sourceTypeID == targetTypeID || targetTypeID == LogicalTypeID::UNION;
+    }
+    case LogicalTypeID::ARRAY: {
+        return targetTypeID == LogicalTypeID::LIST || targetTypeID == LogicalTypeID::ARRAY;
+    }
+    default:
+        return false;
+    }
+}
+
+bool CastArrayHelper::isUnionSpecialCast(const LogicalType& srcType, const LogicalType& dstType) {
+    if (srcType.getLogicalTypeID() != LogicalTypeID::STRUCT ||
+        dstType.getLogicalTypeID() != LogicalTypeID::UNION ||
+        !StructType::hasField(srcType, "tag")) {
+        return false;
+    }
+    for (auto& field : StructType::getFields(srcType)) {
+        if (!UnionType::hasField(dstType, field.getName()) ||
+            UnionType::getFieldType(dstType, field.getName()) != field.getType()) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool CastArrayHelper::containsListToArray(const LogicalType& srcType, const LogicalType& dstType) {
+    auto srcTypeID = srcType.getLogicalTypeID();
+    auto dstTypeID = dstType.getLogicalTypeID();
+
+    if ((srcTypeID == LogicalTypeID::LIST || srcTypeID == LogicalTypeID::ARRAY) &&
+        dstTypeID == LogicalTypeID::ARRAY) {
+        return true;
+    }
+
+    if (!isUnionSpecialCast(srcType, dstType) &&
+        (srcTypeID == LogicalTypeID::UNION || dstTypeID == LogicalTypeID::UNION)) {
+        return false;
+    }
+
+    if (checkCompatibleNestedTypes(srcTypeID, dstTypeID)) {
+        switch (srcType.getPhysicalType()) {
+        case PhysicalTypeID::LIST: {
+            return containsListToArray(ListType::getChildType(srcType),
+                ListType::getChildType(dstType));
+        }
+        case PhysicalTypeID::ARRAY: {
+            return containsListToArray(ArrayType::getChildType(srcType),
+                ListType::getChildType(dstType));
+        }
+        case PhysicalTypeID::STRUCT: {
+            auto srcFieldTypes = StructType::getFieldTypes(srcType);
+            auto dstFieldTypes = StructType::getFieldTypes(dstType);
+            if (srcFieldTypes.size() != dstFieldTypes.size()) {
+                throw ConversionException{
+                    stringFormat("Unsupported casting function from {} to {}.", srcType.toString(),
+                        dstType.toString())};
+            }
+
+            for (auto i = 0u; i < srcFieldTypes.size(); i++) {
+                if (containsListToArray(*srcFieldTypes[i], *dstFieldTypes[i])) {
+                    return true;
+                }
+            }
+        } break;
+        default:
+            return false;
+        }
+    }
+    return false;
+}
+
+void CastArrayHelper::validateListEntry(ValueVector* inputVector, const LogicalType& resultType,
+    uint64_t pos) {
+    if (inputVector->isNull(pos)) {
+        return;
+    }
+    const auto& inputType = inputVector->dataType;
+
+    switch (resultType.getPhysicalType()) {
+    case PhysicalTypeID::ARRAY: {
+        if (inputType.getPhysicalType() == PhysicalTypeID::LIST) {
+            auto listEntry = inputVector->getValue<list_entry_t>(pos);
+            if (listEntry.size != ArrayType::getNumElements(resultType)) {
+                throw ConversionException{
+                    stringFormat("Unsupported casting LIST with incorrect list entry to ARRAY. "
+                                 "Expected: {}, Actual: {}.",
+                        ArrayType::getNumElements(resultType),
+                        inputVector->getValue<list_entry_t>(pos).size)};
+            }
+            auto inputChildVector = ListVector::getDataVector(inputVector);
+            for (auto i = listEntry.offset; i < listEntry.offset + listEntry.size; i++) {
+                validateListEntry(inputChildVector, ArrayType::getChildType(resultType), i);
+            }
+        } else if (inputType.getPhysicalType() == PhysicalTypeID::ARRAY) {
+            if (ArrayType::getNumElements(inputType) != ArrayType::getNumElements(resultType)) {
+                throw ConversionException(
+                    stringFormat("Unsupported casting function from {} to {}.",
+                        inputType.toString(), resultType.toString()));
+            }
+            auto listEntry = inputVector->getValue<list_entry_t>(pos);
+            auto inputChildVector = ListVector::getDataVector(inputVector);
+            for (auto i = listEntry.offset; i < listEntry.offset + listEntry.size; i++) {
+                validateListEntry(inputChildVector, ArrayType::getChildType(resultType), i);
+            }
+        }
+    } break;
+    case PhysicalTypeID::LIST: {
+        if (inputType.getPhysicalType() == PhysicalTypeID::LIST ||
+            inputType.getPhysicalType() == PhysicalTypeID::ARRAY) {
+            auto listEntry = inputVector->getValue<list_entry_t>(pos);
+            auto inputChildVector = ListVector::getDataVector(inputVector);
+            for (auto i = listEntry.offset; i < listEntry.offset + listEntry.size; i++) {
+                validateListEntry(inputChildVector, ListType::getChildType(resultType), i);
+            }
+        }
+    } break;
+    case PhysicalTypeID::STRUCT: {
+        if (inputType.getPhysicalType() == PhysicalTypeID::STRUCT) {
+            auto fieldVectors = StructVector::getFieldVectors(inputVector);
+            auto fieldTypes = StructType::getFieldTypes(resultType);
+
+            auto structEntry = inputVector->getValue<struct_entry_t>(pos);
+            for (auto i = 0u; i < fieldVectors.size(); i++) {
+                validateListEntry(fieldVectors[i].get(), *fieldTypes[i], structEntry.pos);
+            }
+        }
+    } break;
+    default: {
+        return;
+    }
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast_from_string_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast_from_string_functions.cpp
new file mode 100644
index 0000000000..c8cbc98627
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast_from_string_functions.cpp
@@ -0,0 +1,1056 @@
+#include "function/cast/functions/cast_from_string_functions.h"
+
+#include "common/exception/parser.h"
+#include "common/string_format.h"
+#include "common/types/blob.h"
+#include "function/list/functions/list_unique_function.h"
+#include "utf8proc_wrapper.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+// ---------------------- cast String Helper ------------------------------ //
+struct CastStringHelper {
+    template<typename T>
+    static void cast(const char* input, uint64_t len, T& result, ValueVector* /*vector*/ = nullptr,
+        uint64_t /*rowToAdd*/ = 0, const CSVOption* /*option*/ = nullptr) {
+        simpleIntegerCast<int64_t>(input, len, result, LogicalTypeID::INT64);
+    }
+};
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, int128_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<int128_t>(input, len, result, LogicalTypeID::INT128);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, uint128_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint128_t, false>(input, len, result, LogicalTypeID::UINT128);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, int32_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<int32_t>(input, len, result, LogicalTypeID::INT32);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, int16_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<int16_t>(input, len, result, LogicalTypeID::INT16);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, int8_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<int8_t>(input, len, result, LogicalTypeID::INT8);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, uint64_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint64_t, false>(input, len, result, LogicalTypeID::UINT64);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, uint32_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint32_t, false>(input, len, result, LogicalTypeID::UINT32);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, uint16_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint16_t, false>(input, len, result, LogicalTypeID::UINT16);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, uint8_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint8_t, false>(input, len, result, LogicalTypeID::UINT8);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, float& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    doubleCast<float>(input, len, result, LogicalTypeID::FLOAT);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, double& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    doubleCast<double>(input, len, result, LogicalTypeID::DOUBLE);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, bool& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    castStringToBool(input, len, result);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, date_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    result = Date::fromCString(input, len);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, timestamp_ms_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    TryCastStringToTimestamp::cast<timestamp_ms_t>(input, len, result, LogicalTypeID::TIMESTAMP_MS);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, timestamp_ns_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    TryCastStringToTimestamp::cast<timestamp_ns_t>(input, len, result, LogicalTypeID::TIMESTAMP_NS);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, timestamp_sec_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    TryCastStringToTimestamp::cast<timestamp_sec_t>(input, len, result,
+        LogicalTypeID::TIMESTAMP_SEC);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, timestamp_tz_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    TryCastStringToTimestamp::cast<timestamp_tz_t>(input, len, result, LogicalTypeID::TIMESTAMP_TZ);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, timestamp_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    result = Timestamp::fromCString(input, len);
+}
+
+template<>
+inline void CastStringHelper::cast(const char* input, uint64_t len, interval_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    result = Interval::fromCString(input, len);
+}
+
+// ---------------------- cast String to Blob ------------------------------ //
+template<>
+void CastString::operation(const ku_string_t& input, blob_t& result, ValueVector* resultVector,
+    uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    result.value.len = Blob::getBlobSize(input);
+    if (!ku_string_t::isShortString(result.value.len)) {
+        auto overflowBuffer = StringVector::getInMemOverflowBuffer(resultVector);
+        auto overflowPtr = overflowBuffer->allocateSpace(result.value.len);
+        result.value.overflowPtr = reinterpret_cast<int64_t>(overflowPtr);
+        Blob::fromString(reinterpret_cast<const char*>(input.getData()), input.len, overflowPtr);
+        memcpy(result.value.prefix, overflowPtr, ku_string_t::PREFIX_LENGTH);
+    } else {
+        Blob::fromString(reinterpret_cast<const char*>(input.getData()), input.len,
+            result.value.prefix);
+    }
+}
+
+template<>
+void CastStringHelper::cast(const char* input, uint64_t len, blob_t& /*result*/,
+    ValueVector* vector, uint64_t rowToAdd, const CSVOption* /*option*/) {
+    // base case: blob
+    auto blobBuffer = std::make_unique<uint8_t[]>(len);
+    auto blobLen = Blob::fromString(input, len, blobBuffer.get());
+    BlobVector::addBlob(vector, rowToAdd, blobBuffer.get(), blobLen);
+}
+
+//---------------------- cast String to UUID ------------------------------ //
+template<>
+void CastString::operation(const ku_string_t& input, ku_uuid_t& result,
+    ValueVector* /*result_vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    result.value = UUID::fromString(input.getAsString());
+}
+
+// LCOV_EXCL_START
+template<>
+void CastStringHelper::cast(const char* input, uint64_t len, ku_uuid_t& result,
+    ValueVector* /*vector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    result.value = UUID::fromCString(input, len);
+}
+// LCOV_EXCL_STOP
+
+// ---------------------- cast String to nested types ------------------------------ //
+static void skipWhitespace(const char*& input, const char* end) {
+    while (input < end) {
+        if (*input & 0x80) {
+            // We only skip ASCII white spaces there.
+            break;
+        } else {
+            KU_ASSERT(*input >= -1);
+            if (!isspace(*input)) {
+                break;
+            }
+        }
+        input++;
+    }
+}
+
+static void trimRightWhitespace(const char* input, const char*& end) {
+    while (input < end && isspace(*(end - 1))) {
+        end--;
+    }
+}
+
+static void trimQuotes(const char*& keyStart, const char*& keyEnd) {
+    // Skip quotations on struct keys.
+    if ((keyStart[0] == '\'' && (keyEnd - 1)[0] == '\'') ||
+        (keyStart[0] == '\"' && (keyEnd - 1)[0] == '\"')) {
+        keyStart++;
+        keyEnd--;
+    }
+}
+
+static bool skipToCloseQuotes(const char*& input, const char* end) {
+    auto ch = *input;
+    input++; // skip the first " '
+    // TODO: escape char
+    while (input != end) {
+        if (*input == ch) {
+            return true;
+        }
+        input++;
+    }
+    return false;
+}
+
+static bool skipToClose(const char*& input, const char* end, uint64_t& lvl, char target,
+    const CSVOption* option) {
+    input++;
+    while (input != end) {
+        if (*input == '\'') {
+            if (!skipToCloseQuotes(input, end)) {
+                return false;
+            }
+        } else if (*input == '{') { // must have closing brackets {, ] if they are not quoted
+            if (!skipToClose(input, end, lvl, '}', option)) {
+                return false;
+            }
+        } else if (*input == CopyConstants::DEFAULT_CSV_LIST_BEGIN_CHAR) {
+            if (!skipToClose(input, end, lvl, CopyConstants::DEFAULT_CSV_LIST_END_CHAR, option)) {
+                return false;
+            }
+            lvl++; // nested one more level
+        } else if (*input == target) {
+            if (target == CopyConstants::DEFAULT_CSV_LIST_END_CHAR) {
+                lvl--;
+            }
+            return true;
+        }
+        input++;
+    }
+    return false; // no corresponding closing bracket
+}
+
+static bool isNull(std::string_view& str) {
+    auto start = str.data();
+    auto end = start + str.length();
+    skipWhitespace(start, end);
+    if (start == end) {
+        return true;
+    }
+    if (end - start >= 4 && (*start == 'N' || *start == 'n') &&
+        (*(start + 1) == 'U' || *(start + 1) == 'u') &&
+        (*(start + 2) == 'L' || *(start + 2) == 'l') &&
+        (*(start + 3) == 'L' || *(start + 3) == 'l')) {
+        start += 4;
+        skipWhitespace(start, end);
+        if (start == end) {
+            return true;
+        }
+    }
+    return false;
+}
+
+// ---------------------- cast String to List Helper ------------------------------ //
+struct CountPartOperation {
+    uint64_t count = 0;
+
+    static inline bool handleKey(const char* /*start*/, const char* /*end*/,
+        const CSVOption* /*config*/) {
+        return true;
+    }
+    inline void handleValue(const char* /*start*/, const char* /*end*/,
+        const CSVOption* /*config*/) {
+        count++;
+    }
+};
+
+struct SplitStringListOperation {
+    SplitStringListOperation(uint64_t& offset, ValueVector* resultVector)
+        : offset(offset), resultVector(resultVector) {}
+
+    uint64_t& offset;
+    ValueVector* resultVector;
+
+    void handleValue(const char* start, const char* end, const CSVOption* option) {
+        skipWhitespace(start, end);
+        trimRightWhitespace(start, end);
+        CastString::copyStringToVector(resultVector, offset,
+            std::string_view{start, (uint32_t)(end - start)}, option);
+        offset++;
+    }
+};
+
+template<typename T>
+static bool splitCStringList(const char* input, uint64_t len, T& state, const CSVOption* option) {
+    auto end = input + len;
+    uint64_t lvl = 1;
+    bool seenValue = false;
+
+    // locate [
+    skipWhitespace(input, end);
+    if (input == end || *input != CopyConstants::DEFAULT_CSV_LIST_BEGIN_CHAR) {
+        return false;
+    }
+    skipWhitespace(++input, end);
+
+    bool justFinishedEntry = true; // true at start
+    auto startPtr = input;
+    while (input < end) {
+        auto ch = *input;
+        if (ch == CopyConstants::DEFAULT_CSV_LIST_BEGIN_CHAR) {
+            if (!skipToClose(input, end, ++lvl, CopyConstants::DEFAULT_CSV_LIST_END_CHAR, option)) {
+                return false;
+            }
+        } else if ((ch == '\'' || ch == '"') && justFinishedEntry) {
+            const char* prevInput = input;
+            if (!skipToCloseQuotes(input, end)) {
+                input = prevInput;
+            }
+        } else if (ch == '{') {
+            uint64_t struct_lvl = 0;
+            skipToClose(input, end, struct_lvl, '}', option);
+        } else if (ch == ',' || ch == CopyConstants::DEFAULT_CSV_LIST_END_CHAR) { // split
+            if (ch != CopyConstants::DEFAULT_CSV_LIST_END_CHAR || startPtr < input || seenValue) {
+                state.handleValue(startPtr, input, option);
+                seenValue = true;
+            }
+            if (ch == CopyConstants::DEFAULT_CSV_LIST_END_CHAR) { // last ]
+                lvl--;
+                break;
+            }
+            skipWhitespace(++input, end);
+            startPtr = input;
+            justFinishedEntry = true;
+            continue;
+        }
+        justFinishedEntry = false;
+        input++;
+    }
+    skipWhitespace(++input, end);
+    return (input == end && lvl == 0);
+}
+
+template<typename T>
+static bool splitPossibleUnbracedList(std::string_view input, T& state, const CSVOption* option) {
+    input = StringUtils::ltrim(StringUtils::rtrim(input));
+    auto split = StringUtils::smartSplit(input, ';');
+    if (split.size() == 1 && input.front() == '[' && input.back() == ']') {
+        split = StringUtils::smartSplit(input.substr(1, input.size() - 2), ';');
+    }
+    for (auto& i : split) {
+        state.handleValue(i.data(), i.data() + i.length(), option);
+    }
+    return true;
+}
+
+template<typename T>
+static inline void startListCast(const char* input, uint64_t len, T split, const CSVOption* option,
+    ValueVector* vector) {
+    auto validList = option->allowUnbracedList ?
+                         splitPossibleUnbracedList(std::string_view(input, len), split, option) :
+                         splitCStringList(input, len, split, option);
+    if (!validList) {
+        throw ConversionException("Cast failed. " + std::string{input, (size_t)len} +
+                                  " is not in " + vector->dataType.toString() + " range.");
+    }
+}
+
+// ---------------------- cast String to Array Helper ------------------------------ //
+static void validateNumElementsInArray(uint64_t numElementsRead, const LogicalType& type) {
+    auto numElementsInArray = ArrayType::getNumElements(type);
+    if (numElementsRead != numElementsInArray) {
+        throw ConversionException(stringFormat(
+            "Each array should have fixed number of elements. Expected: {}, Actual: {}.",
+            numElementsInArray, numElementsRead));
+    }
+}
+
+// ---------------------- cast String to List/Array ------------------------------ //
+template<>
+void CastStringHelper::cast(const char* input, uint64_t len, list_entry_t& /*result*/,
+    ValueVector* vector, uint64_t rowToAdd, const CSVOption* option) {
+    auto logicalTypeID = vector->dataType.getLogicalTypeID();
+
+    // calculate the number of elements in array
+    CountPartOperation state;
+    if (option->allowUnbracedList) {
+        splitPossibleUnbracedList(std::string_view(input, len), state, option);
+    } else {
+        splitCStringList(input, len, state, option);
+    }
+    if (logicalTypeID == LogicalTypeID::ARRAY) {
+        validateNumElementsInArray(state.count, vector->dataType);
+    }
+
+    auto list_entry = ListVector::addList(vector, state.count);
+    vector->setValue<list_entry_t>(rowToAdd, list_entry);
+    auto listDataVector = ListVector::getDataVector(vector);
+
+    SplitStringListOperation split{list_entry.offset, listDataVector};
+    startListCast(input, len, split, option, vector);
+}
+
+template<>
+void CastString::operation(const ku_string_t& input, list_entry_t& result,
+    ValueVector* resultVector, uint64_t rowToAdd, const CSVOption* option) {
+    CastStringHelper::cast(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        resultVector, rowToAdd, option);
+}
+
+// ---------------------- cast String to Map ------------------------------ //
+struct SplitStringMapOperation {
+    SplitStringMapOperation(uint64_t& offset, ValueVector* resultVector)
+        : offset{offset}, resultVector{resultVector} {}
+
+    uint64_t& offset;
+    ValueVector* resultVector;
+    ValueSet uniqueKeys;
+
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    bool handleKey(const char* start, const char* end, const CSVOption* option);
+
+    void handleValue(const char* start, const char* end, const CSVOption* option);
+};
+
+bool SplitStringMapOperation::handleKey(const char* start, const char* end,
+    const CSVOption* option) {
+    trimRightWhitespace(start, end);
+    auto fieldVector = StructVector::getFieldVector(resultVector, 0).get();
+    CastString::copyStringToVector(fieldVector, offset,
+        std::string_view{start, (uint32_t)(end - start)}, option);
+    if (fieldVector->isNull(offset)) {
+        throw common::ConversionException{"Map does not allow null as key."};
+    }
+    auto val = common::Value::createDefaultValue(fieldVector->dataType);
+    val.copyFromColLayout(fieldVector->getData() + fieldVector->getNumBytesPerValue() * offset,
+        fieldVector);
+    auto uniqueKey = uniqueKeys.insert(val).second;
+    if (!uniqueKey) {
+        throw common::ConversionException{"Map does not allow duplicate keys."};
+    }
+    return true;
+}
+
+void SplitStringMapOperation::handleValue(const char* start, const char* end,
+    const CSVOption* option) {
+    trimRightWhitespace(start, end);
+    CastString::copyStringToVector(StructVector::getFieldVector(resultVector, 1).get(), offset++,
+        std::string_view{start, (uint32_t)(end - start)}, option);
+}
+
+template<typename T>
+static bool parseKeyOrValue(const char*& input, const char* end, T& state, bool isKey,
+    bool& closeBracket, const CSVOption* option) {
+    auto start = input;
+    uint64_t lvl = 0;
+
+    while (input < end) {
+        if (*input == '"' || *input == '\'') {
+            if (!skipToCloseQuotes(input, end)) {
+                return false;
+            }
+        } else if (*input == '{') {
+            if (!skipToClose(input, end, lvl, '}', option)) {
+                return false;
+            }
+        } else if (*input == CopyConstants::DEFAULT_CSV_LIST_BEGIN_CHAR) {
+            if (!skipToClose(input, end, lvl, CopyConstants::DEFAULT_CSV_LIST_END_CHAR, option)) {
+                return false;
+            }
+        } else if (isKey && *input == '=') {
+            return state.handleKey(start, input, option);
+        } else if (!isKey && (*input == ',' || *input == '}')) {
+            state.handleValue(start, input, option);
+            if (*input == '}') {
+                closeBracket = true;
+            }
+            return true;
+        }
+        input++;
+    }
+    return false;
+}
+
+// Split map of format: {a=12,b=13}
+template<typename T>
+static bool splitCStringMap(const char* input, uint64_t len, T& state, const CSVOption* option) {
+    auto end = input + len;
+    bool closeBracket = false;
+
+    skipWhitespace(input, end);
+    if (input == end || *input != '{') { // start with {
+        return false;
+    }
+    skipWhitespace(++input, end);
+    if (input == end) {
+        return false;
+    }
+    if (*input == '}') {
+        skipWhitespace(++input, end); // empty
+        return input == end;
+    }
+
+    while (input < end) {
+        if (!parseKeyOrValue(input, end, state, true, closeBracket, option)) {
+            return false;
+        }
+        skipWhitespace(++input, end);
+        if (!parseKeyOrValue(input, end, state, false, closeBracket, option)) {
+            return false;
+        }
+        skipWhitespace(++input, end);
+        if (closeBracket) {
+            return (input == end);
+        }
+    }
+    return false;
+}
+
+template<>
+void CastStringHelper::cast(const char* input, uint64_t len, map_entry_t& /*result*/,
+    ValueVector* vector, uint64_t rowToAdd, const CSVOption* option) {
+    // count the number of maps in map
+    CountPartOperation state;
+    splitCStringMap(input, len, state, option);
+
+    auto list_entry = ListVector::addList(vector, state.count);
+    vector->setValue<list_entry_t>(rowToAdd, list_entry);
+    auto structVector = ListVector::getDataVector(vector);
+
+    SplitStringMapOperation split{list_entry.offset, structVector};
+    if (!splitCStringMap(input, len, split, option)) {
+        throw ConversionException("Cast failed. " + std::string{input, (size_t)len} +
+                                  " is not in " + vector->dataType.toString() + " range.");
+    }
+}
+
+template<>
+void CastString::operation(const ku_string_t& input, map_entry_t& result, ValueVector* resultVector,
+    uint64_t rowToAdd, const CSVOption* option) {
+    CastStringHelper::cast(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        resultVector, rowToAdd, option);
+}
+
+// ---------------------- cast String to Struct ------------------------------ //
+static bool parseStructFieldName(const char*& input, const char* end) {
+    while (input < end) {
+        if (*input == ':') {
+            return true;
+        }
+        input++;
+    }
+    return false;
+}
+
+static bool parseStructFieldValue(const char*& input, const char* end, const CSVOption* option,
+    bool& closeBrack) {
+    uint64_t lvl = 0;
+    while (input < end) {
+        if (*input == '"' || *input == '\'') {
+            if (!skipToCloseQuotes(input, end)) {
+                return false;
+            }
+        } else if (*input == '{') {
+            if (!skipToClose(input, end, lvl, '}', option)) {
+                return false;
+            }
+        } else if (*input == CopyConstants::DEFAULT_CSV_LIST_BEGIN_CHAR) {
+            if (!skipToClose(input, end, ++lvl, CopyConstants::DEFAULT_CSV_LIST_END_CHAR, option)) {
+                return false;
+            }
+        } else if (*input == ',' || *input == '}') {
+            if (*input == '}') {
+                closeBrack = true;
+            }
+            return (lvl == 0);
+        }
+        input++;
+    }
+    return false;
+}
+
+static bool tryCastStringToStruct(const char* input, uint64_t len, ValueVector* vector,
+    uint64_t rowToAdd, const CSVOption* option) {
+    // default values to NULL
+    auto fieldVectors = StructVector::getFieldVectors(vector);
+    for (auto& fieldVector : fieldVectors) {
+        fieldVector->setNull(rowToAdd, true);
+    }
+
+    // check if start with {
+    auto end = input + len;
+    const auto& type = vector->dataType;
+    skipWhitespace(input, end);
+    if (input == end || *input != '{') {
+        return false;
+    }
+    skipWhitespace(++input, end);
+
+    if (input == end) { // no closing bracket
+        return false;
+    }
+    if (*input == '}') {
+        skipWhitespace(++input, end);
+        return input == end;
+    }
+
+    bool closeBracket = false;
+    while (input < end) {
+        auto keyStart = input;
+        if (!parseStructFieldName(input, end)) { // find key
+            return false;
+        }
+        auto keyEnd = input;
+        trimRightWhitespace(keyStart, keyEnd);
+        trimQuotes(keyStart, keyEnd);
+        auto fieldIdx = StructType::getFieldIdx(type, std::string{keyStart, keyEnd});
+        if (fieldIdx == INVALID_STRUCT_FIELD_IDX) {
+            throw ParserException{"Invalid struct field name: " + std::string{keyStart, keyEnd}};
+        }
+
+        skipWhitespace(++input, end);
+        auto valStart = input;
+        if (!parseStructFieldValue(input, end, option, closeBracket)) { // find value
+            return false;
+        }
+        auto valEnd = input;
+        trimRightWhitespace(valStart, valEnd);
+        trimQuotes(valStart, valEnd);
+        skipWhitespace(++input, end);
+
+        auto fieldVector = StructVector::getFieldVector(vector, fieldIdx).get();
+        fieldVector->setNull(rowToAdd, false);
+        CastString::copyStringToVector(fieldVector, rowToAdd,
+            std::string_view{valStart, (uint32_t)(valEnd - valStart)}, option);
+
+        if (closeBracket) {
+            return (input == end);
+        }
+    }
+    return false;
+}
+
+template<>
+void CastStringHelper::cast(const char* input, uint64_t len, struct_entry_t& /*result*/,
+    ValueVector* vector, uint64_t rowToAdd, const CSVOption* option) {
+    if (!tryCastStringToStruct(input, len, vector, rowToAdd, option)) {
+        throw ConversionException("Cast failed. " + std::string{input, (size_t)len} +
+                                  " is not in " + vector->dataType.toString() + " range.");
+    }
+}
+
+template<>
+void CastString::operation(const ku_string_t& input, struct_entry_t& result,
+    ValueVector* resultVector, uint64_t rowToAdd, const CSVOption* option) {
+    CastStringHelper::cast(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        resultVector, rowToAdd, option);
+}
+
+// ---------------------- cast String to Union ------------------------------ //
+template<typename T>
+static inline void testAndSetValue(ValueVector* vector, uint64_t rowToAdd, T result, bool success) {
+    if (success) {
+        vector->setValue(rowToAdd, result);
+    }
+}
+
+static bool tryCastUnionField(ValueVector* vector, uint64_t rowToAdd, const char* input,
+    uint64_t len) {
+    auto& targetType = vector->dataType;
+    bool success = false;
+    switch (targetType.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL: {
+        bool result = false;
+        success = function::tryCastToBool(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::INT128: {
+        int128_t result = 0;
+        success = function::trySimpleIntegerCast(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::UINT128: {
+        uint128_t result = 0;
+        success = function::trySimpleIntegerCast<uint128_t, false>(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::INT64: {
+        int64_t result = 0;
+        success = function::trySimpleIntegerCast(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::INT32: {
+        int32_t result = 0;
+        success = function::trySimpleIntegerCast(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::INT16: {
+        int16_t result = 0;
+        success = function::trySimpleIntegerCast(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::INT8: {
+        int8_t result = 0;
+        success = function::trySimpleIntegerCast(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::UINT64: {
+        uint64_t result = 0;
+        success = function::trySimpleIntegerCast<uint64_t, false>(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::UINT32: {
+        uint32_t result = 0;
+        success = function::trySimpleIntegerCast<uint32_t, false>(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::UINT16: {
+        uint16_t result = 0;
+        success = function::trySimpleIntegerCast<uint16_t, false>(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::UINT8: {
+        uint8_t result = 0;
+        success = function::trySimpleIntegerCast<uint8_t, false>(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::DOUBLE: {
+        double result = 0;
+        success = function::tryDoubleCast(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::FLOAT: {
+        float result = 0;
+        success = function::tryDoubleCast(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::DECIMAL: {
+        switch (targetType.getPhysicalType()) {
+        case PhysicalTypeID::INT16: {
+            int16_t result = 0;
+            tryDecimalCast(input, len, result, DecimalType::getPrecision(targetType),
+                DecimalType::getScale(targetType));
+            testAndSetValue(vector, rowToAdd, result, success);
+        } break;
+        case PhysicalTypeID::INT32: {
+            int32_t result = 0;
+            tryDecimalCast(input, len, result, DecimalType::getPrecision(targetType),
+                DecimalType::getScale(targetType));
+            testAndSetValue(vector, rowToAdd, result, success);
+        } break;
+        case PhysicalTypeID::INT64: {
+            int64_t result = 0;
+            tryDecimalCast(input, len, result, DecimalType::getPrecision(targetType),
+                DecimalType::getScale(targetType));
+            testAndSetValue(vector, rowToAdd, result, success);
+        } break;
+        case PhysicalTypeID::INT128: {
+            int128_t result = 0;
+            tryDecimalCast(input, len, result, DecimalType::getPrecision(targetType),
+                DecimalType::getScale(targetType));
+            testAndSetValue(vector, rowToAdd, result, success);
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    } break;
+    case LogicalTypeID::DATE: {
+        date_t result;
+        uint64_t pos = 0;
+        success = Date::tryConvertDate(input, len, pos, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::TIMESTAMP_NS: {
+        timestamp_ns_t result;
+        success = TryCastStringToTimestamp::tryCast<timestamp_ns_t>(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::TIMESTAMP_MS: {
+        timestamp_ms_t result;
+        success = TryCastStringToTimestamp::tryCast<timestamp_ms_t>(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        timestamp_sec_t result;
+        success = TryCastStringToTimestamp::tryCast<timestamp_sec_t>(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::TIMESTAMP_TZ: {
+        timestamp_tz_t result;
+        success = TryCastStringToTimestamp::tryCast<timestamp_tz_t>(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::TIMESTAMP: {
+        timestamp_t result;
+        success = Timestamp::tryConvertTimestamp(input, len, result);
+        testAndSetValue(vector, rowToAdd, result, success);
+    } break;
+    case LogicalTypeID::STRING: {
+        if (!utf8proc::Utf8Proc::isValid(input, len)) {
+            throw ConversionException{"Invalid UTF8-encoded string."};
+        }
+        StringVector::addString(vector, rowToAdd, input, len);
+        return true;
+    }
+    default: {
+        return false;
+    }
+    }
+    return success;
+}
+
+template<>
+void CastStringHelper::cast(const char* input, uint64_t len, union_entry_t& /*result*/,
+    ValueVector* vector, uint64_t rowToAdd, const CSVOption* /*option*/) {
+    auto& type = vector->dataType;
+    union_field_idx_t selectedFieldIdx = INVALID_STRUCT_FIELD_IDX;
+
+    auto i = 0u;
+    for (; i < UnionType::getNumFields(type); i++) {
+        auto internalFieldIdx = UnionType::getInternalFieldIdx(i);
+        auto fieldVector = StructVector::getFieldVector(vector, internalFieldIdx).get();
+        if (tryCastUnionField(fieldVector, rowToAdd, input, len)) {
+            fieldVector->setNull(rowToAdd, false /* isNull */);
+            selectedFieldIdx = i;
+            i++;
+            break;
+        } else {
+            fieldVector->setNull(rowToAdd, true /* isNull */);
+        }
+    }
+    for (; i < UnionType::getNumFields(type); i++) {
+        auto fieldVector = UnionVector::getValVector(vector, i);
+        fieldVector->setNull(rowToAdd, true /* isNull */);
+    }
+
+    if (selectedFieldIdx == INVALID_STRUCT_FIELD_IDX) {
+        throw ConversionException{stringFormat("Could not convert to union type {}: {}.",
+            type.toString(), std::string{input, (size_t)len})};
+    }
+    StructVector::getFieldVector(vector, UnionType::TAG_FIELD_IDX)
+        ->setValue(rowToAdd, selectedFieldIdx);
+    StructVector::getFieldVector(vector, UnionType::TAG_FIELD_IDX)
+        ->setNull(rowToAdd, false /* isNull */);
+}
+
+template<>
+void CastString::operation(const ku_string_t& input, union_entry_t& result,
+    ValueVector* resultVector, uint64_t rowToAdd, const CSVOption* CSVOption) {
+    CastStringHelper::cast(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        resultVector, rowToAdd, CSVOption);
+}
+
+static void setVectorNull(ValueVector* vector, uint64_t vectorPos, std::string_view strVal,
+    const CSVOption* option) {
+    auto& type = vector->dataType;
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::STRING: {
+        if (std::any_of(option->nullStrings.begin(), option->nullStrings.end(),
+                [&](const std::string& nullStr) { return nullStr == strVal; })) {
+            vector->setNull(vectorPos, true /* isNull */);
+            return;
+        }
+    } break;
+    default: {
+        if (isNull(strVal)) {
+            vector->setNull(vectorPos, true /* isNull */);
+            return;
+        }
+    } break;
+    }
+    vector->setNull(vectorPos, false /* isNull */);
+}
+
+void CastString::copyStringToVector(ValueVector* vector, uint64_t vectorPos,
+    std::string_view strVal, const CSVOption* option) {
+    auto& type = vector->dataType;
+    setVectorNull(vector, vectorPos, strVal, option);
+    if (vector->isNull(vectorPos)) {
+        return;
+    }
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::INT128: {
+        int128_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64: {
+        int64_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::INT32: {
+        int32_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::INT16: {
+        int16_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::INT8: {
+        int8_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::UINT64: {
+        uint64_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::UINT32: {
+        uint32_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::UINT16: {
+        uint16_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::UINT8: {
+        uint8_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::FLOAT: {
+        float val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::DECIMAL: {
+        switch (type.getPhysicalType()) {
+        case PhysicalTypeID::INT16: {
+            int16_t val = 0;
+            decimalCast(strVal.data(), strVal.length(), val, type);
+            vector->setValue(vectorPos, val);
+        } break;
+        case PhysicalTypeID::INT32: {
+            int32_t val = 0;
+            decimalCast(strVal.data(), strVal.length(), val, type);
+            vector->setValue(vectorPos, val);
+        } break;
+        case PhysicalTypeID::INT64: {
+            int64_t val = 0;
+            decimalCast(strVal.data(), strVal.length(), val, type);
+            vector->setValue(vectorPos, val);
+        } break;
+        case PhysicalTypeID::INT128: {
+            int128_t val = 0;
+            decimalCast(strVal.data(), strVal.length(), val, type);
+            vector->setValue(vectorPos, val);
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    } break;
+    case LogicalTypeID::DOUBLE: {
+        double val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::BOOL: {
+        bool val = false;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::BLOB: {
+        blob_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val, vector, vectorPos, option);
+    } break;
+    case LogicalTypeID::UUID: {
+        ku_uuid_t val{};
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val.value);
+    } break;
+    case LogicalTypeID::STRING: {
+        if (!utf8proc::Utf8Proc::isValid(strVal.data(), strVal.length())) {
+            throw ConversionException{"Invalid UTF8-encoded string."};
+        }
+        StringVector::addString(vector, vectorPos, strVal.data(), strVal.length());
+    } break;
+    case LogicalTypeID::DATE: {
+        date_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::TIMESTAMP_NS: {
+        timestamp_ns_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::TIMESTAMP_MS: {
+        timestamp_ms_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        timestamp_sec_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::TIMESTAMP_TZ: {
+        timestamp_tz_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::TIMESTAMP: {
+        timestamp_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::INTERVAL: {
+        interval_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::UINT128: {
+        uint128_t val = 0;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val);
+        vector->setValue(vectorPos, val);
+    } break;
+    case LogicalTypeID::MAP: {
+        map_entry_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val, vector, vectorPos, option);
+    } break;
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::LIST: {
+        list_entry_t val;
+        CastStringHelper::cast(strVal.data(), strVal.length(), val, vector, vectorPos, option);
+    } break;
+    case LogicalTypeID::STRUCT: {
+        struct_entry_t val{};
+        CastStringHelper::cast(strVal.data(), strVal.length(), val, vector, vectorPos, option);
+    } break;
+    case LogicalTypeID::UNION: {
+        union_entry_t val{};
+        CastStringHelper::cast(strVal.data(), strVal.length(), val, vector, vectorPos, option);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast_string_non_nested_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast_string_non_nested_functions.cpp
new file mode 100644
index 0000000000..ad64393447
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/cast_string_non_nested_functions.cpp
@@ -0,0 +1,272 @@
+#include "function/cast/functions/cast_string_non_nested_functions.h"
+
+#include "common/constants.h"
+#include "common/types/date_t.h"
+#include "common/types/interval_t.h"
+#include "common/types/timestamp_t.h"
+#include "common/types/uuid.h"
+#include "function/cast/functions/numeric_limits.h"
+#include "re2.h"
+
+namespace lbug {
+namespace function {
+
+bool tryCastToBool(const char* input, uint64_t len, bool& result) {
+    StringUtils::removeCStringWhiteSpaces(input, len);
+
+    switch (len) {
+    case 1: {
+        char c = std::tolower(*input);
+        if (c == 't' || c == '1') {
+            result = true;
+            return true;
+        } else if (c == 'f' || c == '0') {
+            result = false;
+            return true;
+        }
+        return false;
+    }
+    case 4: {
+        auto t = std::tolower(input[0]);
+        auto r = std::tolower(input[1]);
+        auto u = std::tolower(input[2]);
+        auto e = std::tolower(input[3]);
+        if (t == 't' && r == 'r' && u == 'u' && e == 'e') {
+            result = true;
+            return true;
+        }
+        return false;
+    }
+    case 5: {
+        auto f = std::tolower(input[0]);
+        auto a = std::tolower(input[1]);
+        auto l = std::tolower(input[2]);
+        auto s = std::tolower(input[3]);
+        auto e = std::tolower(input[4]);
+        if (f == 'f' && a == 'a' && l == 'l' && s == 's' && e == 'e') {
+            result = false;
+            return true;
+        }
+        return false;
+    }
+    default:
+        return false;
+    }
+}
+
+void castStringToBool(const char* input, uint64_t len, bool& result) {
+    if (!tryCastToBool(input, len, result)) {
+        throw ConversionException{
+            stringFormat("Value {} is not a valid boolean", std::string{input, (size_t)len})};
+    }
+}
+
+template<>
+bool TryCastStringToTimestamp::tryCast<timestamp_ns_t>(const char* input, uint64_t len,
+    timestamp_t& result) {
+    if (!Timestamp::tryConvertTimestamp(input, len, result)) {
+        return false;
+    }
+    result = Timestamp::getEpochNanoSeconds(result);
+    return true;
+}
+
+template<>
+bool TryCastStringToTimestamp::tryCast<timestamp_ms_t>(const char* input, uint64_t len,
+    timestamp_t& result) {
+    if (!Timestamp::tryConvertTimestamp(input, len, result)) {
+        return false;
+    }
+    result = Timestamp::getEpochMilliSeconds(result);
+    return true;
+}
+
+template<>
+bool TryCastStringToTimestamp::tryCast<timestamp_sec_t>(const char* input, uint64_t len,
+    timestamp_t& result) {
+    if (!Timestamp::tryConvertTimestamp(input, len, result)) {
+        return false;
+    }
+    result = Timestamp::getEpochSeconds(result);
+    return true;
+}
+
+static bool isDate(std::string_view str) {
+    return RE2::FullMatch(str, Date::regexPattern());
+}
+
+static bool isUUID(std::string_view str) {
+    return RE2::FullMatch(str, UUID::regexPattern());
+}
+
+static bool isInterval(std::string_view str) {
+    return RE2::FullMatch(str, Interval::regexPattern1()) ||
+           RE2::FullMatch(str, Interval::regexPattern2());
+}
+
+static LogicalType inferMapOrStruct(std::string_view str) {
+    auto split = StringUtils::smartSplit(str.substr(1, str.size() - 2), ',');
+    bool isMap = true, isStruct = true; // Default match to map if both are true
+    for (auto& ele : split) {
+        if (StringUtils::smartSplit(ele, '=', 2).size() != 2) {
+            isMap = false;
+        }
+        if (StringUtils::smartSplit(ele, ':', 2).size() != 2) {
+            isStruct = false;
+        }
+    }
+    if (isMap) {
+        auto childKeyType = LogicalType::ANY();
+        auto childValueType = LogicalType::ANY();
+        for (auto& ele : split) {
+            auto split = StringUtils::smartSplit(ele, '=', 2);
+            auto& key = split[0];
+            auto& value = split[1];
+            childKeyType =
+                LogicalTypeUtils::combineTypes(childKeyType, inferMinimalTypeFromString(key));
+            childValueType =
+                LogicalTypeUtils::combineTypes(childValueType, inferMinimalTypeFromString(value));
+        }
+        return LogicalType::MAP(std::move(childKeyType), std::move(childValueType));
+    } else if (isStruct) {
+        std::vector<StructField> fields;
+        for (auto& ele : split) {
+            auto split = StringUtils::smartSplit(ele, ':', 2);
+            auto fieldKey = StringUtils::ltrim(StringUtils::rtrim(split[0]));
+            if (fieldKey.size() > 0 && fieldKey.front() == '\'') {
+                fieldKey = fieldKey.substr(1);
+            }
+            if (fieldKey.size() > 0 && fieldKey.back() == '\'') {
+                fieldKey = fieldKey.substr(0, fieldKey.size() - 1);
+            }
+            auto fieldType = inferMinimalTypeFromString(split[1]);
+            fields.emplace_back(std::string(fieldKey), std::move(fieldType));
+        }
+        return LogicalType::STRUCT(std::move(fields));
+    } else {
+        return LogicalType::STRING();
+    }
+}
+
+LogicalType inferMinimalTypeFromString(const std::string& str) {
+    return inferMinimalTypeFromString(std::string_view(str));
+}
+
+static RE2& boolPattern() {
+    static RE2 retval("(?i)(T|F|TRUE|FALSE)");
+    return retval;
+}
+static RE2& intPattern() {
+    static RE2 retval("(-?0)|(-?[1-9]\\d*)");
+    return retval;
+}
+static RE2& realPattern() {
+    static RE2 retval("(\\+|-)?(0|[1-9]\\d*)?\\.(\\d*)");
+    return retval;
+}
+
+bool isAnyType(std::string_view cpy) {
+    return cpy.size() == 0 || StringUtils::caseInsensitiveEquals(cpy, "NULL") ||
+           StringUtils::caseInsensitiveEquals(cpy, "NAN");
+}
+
+bool isINF(std::string_view cpy) {
+    return StringUtils::caseInsensitiveEquals(cpy, "INF") ||
+           StringUtils::caseInsensitiveEquals(cpy, "+INF") ||
+           StringUtils::caseInsensitiveEquals(cpy, "-INF") ||
+           StringUtils::caseInsensitiveEquals(cpy, "INFINITY") ||
+           StringUtils::caseInsensitiveEquals(cpy, "+INFINITY") ||
+           StringUtils::caseInsensitiveEquals(cpy, "-INFINITY");
+}
+
+LogicalType inferMinimalTypeFromString(std::string_view str) {
+    constexpr char array_begin = common::CopyConstants::DEFAULT_CSV_LIST_BEGIN_CHAR;
+    constexpr char array_end = common::CopyConstants::DEFAULT_CSV_LIST_END_CHAR;
+    auto cpy = StringUtils::ltrim(StringUtils::rtrim(str));
+    // Check special double literals
+    if (isINF(cpy)) {
+        return LogicalType::DOUBLE();
+    }
+    // Any
+    if (isAnyType(cpy)) {
+        return LogicalType::ANY();
+    }
+    // Boolean
+    if (RE2::FullMatch(cpy, boolPattern())) {
+        return LogicalType::BOOL();
+    }
+    // The reason we're not going to try to match to a minimal width integer
+    // is because if we're infering the type of integer from a sequence of
+    // increasing integers, we're bound to underestimate the width
+    // if we only sniff the first few elements; a rather common occurrence.
+
+    // integer
+    if (RE2::FullMatch(cpy, intPattern())) {
+        if (cpy.size() >= 1 + NumericLimits<int128_t>::maxNumDigits()) {
+            return LogicalType::DOUBLE();
+        }
+        int128_t int128val = 0;
+        uint128_t uint128val = 0;
+        if (trySimpleIntegerCast<int128_t, true>(cpy.data(), cpy.length(), int128val)) {
+            if (NumericLimits<int64_t>::isInBounds(int128val)) {
+                return LogicalType::INT64();
+            }
+            KU_ASSERT(NumericLimits<int128_t>::isInBounds(int128val));
+            return LogicalType::INT128();
+        } else if (trySimpleIntegerCast<uint128_t, false>(cpy.data(), cpy.length(), uint128val)) {
+            return LogicalType::UINT128();
+        }
+        return LogicalType::STRING();
+    }
+    // Real value checking
+    if (RE2::FullMatch(cpy, realPattern())) {
+        if (cpy[0] == '-') {
+            cpy = cpy.substr(1);
+        }
+        if (cpy.size() <= DECIMAL_PRECISION_LIMIT) {
+            auto decimalPoint = cpy.find('.');
+            KU_ASSERT(decimalPoint != std::string::npos);
+            return LogicalType::DECIMAL(cpy.size() - 1, cpy.size() - decimalPoint - 1);
+        } else {
+            return LogicalType::DOUBLE();
+        }
+    }
+    // date
+    if (isDate(cpy)) {
+        return LogicalType::DATE();
+    }
+    // It might just be quicker to try cast to timestamp.
+    timestamp_t tmp;
+    if (common::Timestamp::tryConvertTimestamp(cpy.data(), cpy.length(), tmp)) {
+        return LogicalType::TIMESTAMP();
+    }
+
+    // UUID
+    if (isUUID(cpy)) {
+        return LogicalType::UUID();
+    }
+
+    // interval checking
+    if (isInterval(cpy)) {
+        return LogicalType::INTERVAL();
+    }
+
+    // array_begin and array_end are constants
+    if (cpy.front() == array_begin && cpy.back() == array_end) {
+        auto split = StringUtils::smartSplit(cpy.substr(1, cpy.size() - 2), ',');
+        auto childType = LogicalType::ANY();
+        for (auto& ele : split) {
+            childType = LogicalTypeUtils::combineTypes(childType, inferMinimalTypeFromString(ele));
+        }
+        return LogicalType::LIST(std::move(childType));
+    }
+
+    if (cpy.front() == '{' && cpy.back() == '}') {
+        return inferMapOrStruct(cpy);
+    }
+
+    return LogicalType::STRING();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/comparison_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/comparison_functions.cpp
new file mode 100644
index 0000000000..621856bad6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/comparison_functions.cpp
@@ -0,0 +1,225 @@
+#include "function/comparison/comparison_functions.h"
+
+#include "common/types/int128_t.h"
+#include "common/types/interval_t.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+template<typename OP>
+static void executeNestedOperation(uint8_t& result, ValueVector* leftVector,
+    ValueVector* rightVector, uint64_t leftPos, uint64_t rightPos) {
+    switch (leftVector->dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL: {
+        OP::operation(leftVector->getValue<uint8_t>(leftPos),
+            rightVector->getValue<uint8_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::INT64: {
+        OP::operation(leftVector->getValue<int64_t>(leftPos),
+            rightVector->getValue<int64_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::INT32: {
+        OP::operation(leftVector->getValue<int32_t>(leftPos),
+            rightVector->getValue<int32_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::INT16: {
+        OP::operation(leftVector->getValue<int16_t>(leftPos),
+            rightVector->getValue<int16_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::INT8: {
+        OP::operation(leftVector->getValue<int8_t>(leftPos),
+            rightVector->getValue<int8_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::UINT64: {
+        OP::operation(leftVector->getValue<uint64_t>(leftPos),
+            rightVector->getValue<uint64_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::UINT32: {
+        OP::operation(leftVector->getValue<uint32_t>(leftPos),
+            rightVector->getValue<uint32_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::UINT16: {
+        OP::operation(leftVector->getValue<uint16_t>(leftPos),
+            rightVector->getValue<uint16_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::UINT8: {
+        OP::operation(leftVector->getValue<uint8_t>(leftPos),
+            rightVector->getValue<uint8_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::INT128: {
+        OP::operation(leftVector->getValue<int128_t>(leftPos),
+            rightVector->getValue<int128_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::DOUBLE: {
+        OP::operation(leftVector->getValue<double>(leftPos),
+            rightVector->getValue<double>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::FLOAT: {
+        OP::operation(leftVector->getValue<float>(leftPos), rightVector->getValue<float>(rightPos),
+            result, nullptr /* left */, nullptr /* right */);
+    } break;
+    case PhysicalTypeID::STRING: {
+        OP::operation(leftVector->getValue<ku_string_t>(leftPos),
+            rightVector->getValue<ku_string_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::INTERVAL: {
+        OP::operation(leftVector->getValue<interval_t>(leftPos),
+            rightVector->getValue<interval_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::INTERNAL_ID: {
+        OP::operation(leftVector->getValue<internalID_t>(leftPos),
+            rightVector->getValue<internalID_t>(rightPos), result, nullptr /* left */,
+            nullptr /* right */);
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        OP::operation(leftVector->getValue<list_entry_t>(leftPos),
+            rightVector->getValue<list_entry_t>(rightPos), result, leftVector, rightVector);
+    } break;
+    case PhysicalTypeID::STRUCT: {
+        OP::operation(leftVector->getValue<struct_entry_t>(leftPos),
+            rightVector->getValue<struct_entry_t>(rightPos), result, leftVector, rightVector);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+static void executeNestedEqual(uint8_t& result, ValueVector* leftVector, ValueVector* rightVector,
+    uint64_t leftPos, uint64_t rightPos) {
+    if (leftVector->isNull(leftPos) && rightVector->isNull(rightPos)) {
+        result = true;
+    } else if (leftVector->isNull(leftPos) != rightVector->isNull(rightPos)) {
+        result = false;
+    } else {
+        executeNestedOperation<Equals>(result, leftVector, rightVector, leftPos, rightPos);
+    }
+}
+
+template<>
+void Equals::operation(const list_entry_t& left, const list_entry_t& right, uint8_t& result,
+    ValueVector* leftVector, ValueVector* rightVector) {
+    if (leftVector->dataType != rightVector->dataType || left.size != right.size) {
+        result = false;
+        return;
+    }
+    auto leftDataVector = ListVector::getDataVector(leftVector);
+    auto rightDataVector = ListVector::getDataVector(rightVector);
+    for (auto i = 0u; i < left.size; i++) {
+        auto leftPos = left.offset + i;
+        auto rightPos = right.offset + i;
+        executeNestedEqual(result, leftDataVector, rightDataVector, leftPos, rightPos);
+        if (!result) {
+            return;
+        }
+    }
+    result = true;
+}
+
+template<>
+void Equals::operation(const struct_entry_t& left, const struct_entry_t& right, uint8_t& result,
+    ValueVector* leftVector, ValueVector* rightVector) {
+    if (leftVector->dataType != rightVector->dataType) {
+        result = false;
+        return;
+    }
+    auto leftFields = StructVector::getFieldVectors(leftVector);
+    auto rightFields = StructVector::getFieldVectors(rightVector);
+    for (auto i = 0u; i < leftFields.size(); i++) {
+        auto leftField = leftFields[i].get();
+        auto rightField = rightFields[i].get();
+        executeNestedEqual(result, leftField, rightField, left.pos, right.pos);
+        if (!result) {
+            return;
+        }
+    }
+    result = true;
+    // For STRUCT type, we also need to check their field names
+    if (result || leftVector->dataType.getLogicalTypeID() == LogicalTypeID::STRUCT ||
+        rightVector->dataType.getLogicalTypeID() == LogicalTypeID::STRUCT) {
+        auto leftTypeNames = StructType::getFieldNames(leftVector->dataType);
+        auto rightTypeNames = StructType::getFieldNames(rightVector->dataType);
+        for (auto i = 0u; i < leftTypeNames.size(); i++) {
+            if (leftTypeNames[i] != rightTypeNames[i]) {
+                result = false;
+            }
+        }
+    }
+}
+
+static void executeNestedGreaterThan(uint8_t& isGreaterThan, uint8_t& isEqual,
+    ValueVector* leftDataVector, ValueVector* rightDataVector, uint64_t leftPos,
+    uint64_t rightPos) {
+    auto isLeftNull = leftDataVector->isNull(leftPos);
+    auto isRightNull = rightDataVector->isNull(rightPos);
+    if (isLeftNull || isRightNull) {
+        isGreaterThan = !isRightNull;
+        isEqual = (isLeftNull == isRightNull);
+    } else {
+        executeNestedOperation<GreaterThan>(isGreaterThan, leftDataVector, rightDataVector, leftPos,
+            rightPos);
+        if (!isGreaterThan) {
+            executeNestedOperation<Equals>(isEqual, leftDataVector, rightDataVector, leftPos,
+                rightPos);
+        } else {
+            isEqual = false;
+        }
+    }
+}
+
+template<>
+void GreaterThan::operation(const list_entry_t& left, const list_entry_t& right, uint8_t& result,
+    ValueVector* leftVector, ValueVector* rightVector) {
+    KU_ASSERT(leftVector->dataType == rightVector->dataType);
+    auto leftDataVector = ListVector::getDataVector(leftVector);
+    auto rightDataVector = ListVector::getDataVector(rightVector);
+    auto commonLength = std::min(left.size, right.size);
+    uint8_t isEqual = 0;
+    for (auto i = 0u; i < commonLength; i++) {
+        auto leftPos = left.offset + i;
+        auto rightPos = right.offset + i;
+        executeNestedGreaterThan(result, isEqual, leftDataVector, rightDataVector, leftPos,
+            rightPos);
+        if (result || (!result && !isEqual)) {
+            return;
+        }
+    }
+    result = left.size > right.size;
+}
+
+template<>
+void GreaterThan::operation(const struct_entry_t& left, const struct_entry_t& right,
+    uint8_t& result, ValueVector* leftVector, ValueVector* rightVector) {
+    KU_ASSERT(leftVector->dataType == rightVector->dataType);
+    auto leftFields = StructVector::getFieldVectors(leftVector);
+    auto rightFields = StructVector::getFieldVectors(rightVector);
+    uint8_t isEqual = 0;
+    for (auto i = 0u; i < leftFields.size(); i++) {
+        auto leftField = leftFields[i].get();
+        auto rightField = rightFields[i].get();
+        executeNestedGreaterThan(result, isEqual, leftField, rightField, left.pos, right.pos);
+        if (result || (!result && !isEqual)) {
+            return;
+        }
+    }
+    result = false;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/date/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/date/CMakeLists.txt
new file mode 100644
index 0000000000..b77489769f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/date/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_function_date
+        OBJECT
+        date_functions.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_date>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/date/date_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/date/date_functions.cpp
new file mode 100644
index 0000000000..258c444a95
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/date/date_functions.cpp
@@ -0,0 +1,24 @@
+#include "function/date/date_functions.h"
+
+#include "function/function.h"
+#include "transaction/transaction.h"
+
+namespace lbug {
+namespace function {
+
+void CurrentDate::operation(common::date_t& result, void* dataPtr) {
+    auto clientContext = reinterpret_cast<FunctionBindData*>(dataPtr)->clientContext;
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto currentTS = transaction->getCurrentTS();
+    result = common::Timestamp::getDate(common::timestamp_tz_t(currentTS));
+}
+
+void CurrentTimestamp::operation(common::timestamp_tz_t& result, void* dataPtr) {
+    auto clientContext = reinterpret_cast<FunctionBindData*>(dataPtr)->clientContext;
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto currentTS = transaction->getCurrentTS();
+    result = common::timestamp_tz_t(currentTS);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/export/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/export/CMakeLists.txt
new file mode 100644
index 0000000000..6d2ac8b837
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/export/CMakeLists.txt
@@ -0,0 +1,8 @@
+add_library(lbug_function_export
+        OBJECT
+        export_csv_function.cpp
+        export_parquet_function.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_export>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/export/export_csv_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/export/export_csv_function.cpp
new file mode 100644
index 0000000000..54d684bc72
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/export/export_csv_function.cpp
@@ -0,0 +1,282 @@
+#include "common/file_system/virtual_file_system.h"
+#include "common/serializer/buffer_writer.h"
+#include "function/cast/vector_cast_functions.h"
+#include "function/export/export_function.h"
+#include "function/scalar_function.h"
+#include "main/client_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace function {
+
+using namespace common;
+
+struct ExportCSVBindData : public ExportFuncBindData {
+    CSVOption exportOption;
+
+    ExportCSVBindData(std::vector<std::string> names, std::string fileName, CSVOption exportOption)
+        : ExportFuncBindData{std::move(names), std::move(fileName)},
+          exportOption{std::move(exportOption)} {}
+
+    std::unique_ptr<ExportFuncBindData> copy() const override {
+        auto bindData =
+            std::make_unique<ExportCSVBindData>(columnNames, fileName, exportOption.copy());
+        bindData->types = LogicalType::copy(types);
+        return bindData;
+    }
+};
+
+static std::string addEscapes(char toEscape, char escape, const std::string& val) {
+    uint64_t i = 0;
+    std::string escapedStr = "";
+    auto found = val.find(toEscape);
+
+    while (found != std::string::npos) {
+        while (i < found) {
+            escapedStr += val[i];
+            i++;
+        }
+        escapedStr += escape;
+        found = val.find(toEscape, found + sizeof(escape));
+    }
+    while (i < val.length()) {
+        escapedStr += val[i];
+        i++;
+    }
+    return escapedStr;
+}
+
+static bool requireQuotes(const ExportCSVBindData& exportCSVBindData, const uint8_t* str,
+    uint64_t len, std::atomic<bool>& parallelFlag) {
+    // Check if the string is equal to the null string.
+    if (len == strlen(ExportCSVConstants::DEFAULT_NULL_STR) &&
+        memcmp(str, ExportCSVConstants::DEFAULT_NULL_STR, len) == 0) {
+        return true;
+    }
+    for (auto i = 0u; i < len; i++) {
+        if (str[i] == ExportCSVConstants::DEFAULT_CSV_NEWLINE[0] ||
+            str[i] == ExportCSVConstants::DEFAULT_CSV_NEWLINE[1]) {
+            parallelFlag.store(false, std::memory_order_relaxed);
+            return true;
+        }
+        if (str[i] == exportCSVBindData.exportOption.quoteChar ||
+            str[i] == exportCSVBindData.exportOption.delimiter) {
+            return true;
+        }
+    }
+    return false;
+}
+
+static void writeString(BufferWriter* serializer, const ExportFuncBindData& bindData,
+    const uint8_t* strData, uint64_t strLen, bool forceQuote, std::atomic<bool>& parallelFlag) {
+    auto& exportCSVBindData = bindData.constCast<ExportCSVBindData>();
+    if (!forceQuote) {
+        forceQuote = requireQuotes(exportCSVBindData, strData, strLen, parallelFlag);
+    }
+    if (forceQuote) {
+        bool requiresEscape = false;
+        for (auto i = 0u; i < strLen; i++) {
+            if (strData[i] == exportCSVBindData.exportOption.quoteChar ||
+                strData[i] == exportCSVBindData.exportOption.escapeChar) {
+                requiresEscape = true;
+                break;
+            }
+        }
+
+        if (!requiresEscape) {
+            serializer->writeBufferData(exportCSVBindData.exportOption.quoteChar);
+            serializer->write(strData, strLen);
+            serializer->writeBufferData(exportCSVBindData.exportOption.quoteChar);
+            return;
+        }
+
+        std::string strValToWrite = std::string(reinterpret_cast<const char*>(strData), strLen);
+        strValToWrite = addEscapes(exportCSVBindData.exportOption.escapeChar,
+            exportCSVBindData.exportOption.escapeChar, strValToWrite);
+        if (exportCSVBindData.exportOption.escapeChar != exportCSVBindData.exportOption.quoteChar) {
+            strValToWrite = addEscapes(exportCSVBindData.exportOption.quoteChar,
+                exportCSVBindData.exportOption.escapeChar, strValToWrite);
+        }
+        serializer->writeBufferData(exportCSVBindData.exportOption.quoteChar);
+        serializer->writeBufferData(strValToWrite);
+        serializer->writeBufferData(exportCSVBindData.exportOption.quoteChar);
+    } else {
+        serializer->write(strData, strLen);
+    }
+}
+
+struct ExportCSVSharedState : public ExportFuncSharedState {
+    std::mutex mtx;
+    std::unique_ptr<FileInfo> fileInfo;
+    offset_t offset = 0;
+
+    ExportCSVSharedState() = default;
+
+    void init(main::ClientContext& context, const ExportFuncBindData& bindData) override {
+        fileInfo = VirtualFileSystem::GetUnsafe(context)->openFile(bindData.fileName,
+            FileOpenFlags(FileFlags::WRITE | FileFlags::CREATE_AND_TRUNCATE_IF_EXISTS), &context);
+        writeHeader(bindData);
+    }
+
+    void writeHeader(const ExportFuncBindData& bindData) {
+        auto& exportCSVBindData = bindData.constCast<ExportCSVBindData>();
+        BufferWriter bufferedSerializer;
+        if (exportCSVBindData.exportOption.hasHeader) {
+            for (auto i = 0u; i < exportCSVBindData.columnNames.size(); i++) {
+                if (i != 0) {
+                    bufferedSerializer.writeBufferData(exportCSVBindData.exportOption.delimiter);
+                }
+                auto& name = exportCSVBindData.columnNames[i];
+                writeString(&bufferedSerializer, exportCSVBindData,
+                    reinterpret_cast<const uint8_t*>(name.c_str()), name.length(),
+                    false /* forceQuote */, parallelFlag);
+            }
+            bufferedSerializer.writeBufferData(ExportCSVConstants::DEFAULT_CSV_NEWLINE[0]);
+            writeRows(bufferedSerializer.getBlobData(), bufferedSerializer.getSize());
+        }
+    }
+
+    void writeRows(const uint8_t* data, uint64_t size) {
+        std::lock_guard<std::mutex> lck(mtx);
+        fileInfo->writeFile(data, size, offset);
+        offset += size;
+    }
+};
+
+struct ExportCSVLocalState final : public ExportFuncLocalState {
+    std::unique_ptr<BufferWriter> serializer;
+    std::unique_ptr<DataChunk> unflatCastDataChunk;
+    std::unique_ptr<DataChunk> flatCastDataChunk;
+    std::vector<ValueVector*> castVectors;
+    std::vector<function::scalar_func_exec_t> castFuncs;
+
+    ExportCSVLocalState(main::ClientContext& context, const ExportFuncBindData& bindData,
+        std::vector<bool> isFlatVec) {
+        auto& exportCSVBindData = bindData.constCast<ExportCSVBindData>();
+        serializer = std::make_unique<BufferWriter>();
+        auto numFlatVectors = std::count(isFlatVec.begin(), isFlatVec.end(), true /* isFlat */);
+        unflatCastDataChunk = std::make_unique<DataChunk>(isFlatVec.size() - numFlatVectors);
+        flatCastDataChunk = std::make_unique<DataChunk>(numFlatVectors,
+            DataChunkState::getSingleValueDataChunkState());
+        uint64_t numInsertedFlatVector = 0;
+        castFuncs.resize(exportCSVBindData.types.size());
+        for (auto i = 0u; i < exportCSVBindData.types.size(); i++) {
+            castFuncs[i] = function::CastFunction::bindCastFunction("cast",
+                exportCSVBindData.types[i], LogicalType::STRING())
+                               ->execFunc;
+            auto castVector = std::make_unique<ValueVector>(LogicalTypeID::STRING,
+                storage::MemoryManager::Get(context));
+            castVectors.push_back(castVector.get());
+            if (isFlatVec[i]) {
+                flatCastDataChunk->insert(numInsertedFlatVector, std::move(castVector));
+                numInsertedFlatVector++;
+            } else {
+                unflatCastDataChunk->insert(i - numInsertedFlatVector, std::move(castVector));
+            }
+        }
+    }
+};
+
+static std::unique_ptr<ExportFuncBindData> bindFunc(ExportFuncBindInput& bindInput) {
+    return std::make_unique<ExportCSVBindData>(bindInput.columnNames, bindInput.filePath,
+        CSVReaderConfig::construct(bindInput.parsingOptions).option.copy());
+}
+
+static std::unique_ptr<ExportFuncLocalState> initLocalStateFunc(main::ClientContext& context,
+    const ExportFuncBindData& bindData, std::vector<bool> isFlatVec) {
+    return std::make_unique<ExportCSVLocalState>(context, bindData, isFlatVec);
+}
+
+static std::shared_ptr<ExportFuncSharedState> createSharedStateFunc() {
+    return std::make_shared<ExportCSVSharedState>();
+}
+
+static void initSharedStateFunc(ExportFuncSharedState& sharedState, main::ClientContext& context,
+    const ExportFuncBindData& bindData) {
+    sharedState.init(context, bindData);
+}
+
+static void writeRows(const ExportCSVBindData& exportCSVBindData, ExportCSVLocalState& localState,
+    ExportCSVSharedState& sharedState, std::vector<std::shared_ptr<ValueVector>> inputVectors) {
+    auto& exportCSVLocalState = localState.cast<ExportCSVLocalState>();
+    auto& castVectors = localState.castVectors;
+    auto& serializer = localState.serializer;
+    for (auto i = 0u; i < inputVectors.size(); i++) {
+        auto vectorToCast = {inputVectors[i]};
+        exportCSVLocalState.castFuncs[i](vectorToCast,
+            common::SelectionVector::fromValueVectors(vectorToCast), *castVectors[i],
+            castVectors[i]->getSelVectorPtr(), nullptr /* dataPtr */);
+    }
+
+    uint64_t numRowsToWrite = 1;
+    for (auto& vectorToCast : inputVectors) {
+        if (!vectorToCast->state->isFlat()) {
+            numRowsToWrite = vectorToCast->state->getSelVector().getSelSize();
+            break;
+        }
+    }
+    for (auto i = 0u; i < numRowsToWrite; i++) {
+        for (auto j = 0u; j < castVectors.size(); j++) {
+            if (j != 0) {
+                serializer->writeBufferData(exportCSVBindData.exportOption.delimiter);
+            }
+            auto vector = castVectors[j];
+            auto pos = vector->state->isFlat() ? vector->state->getSelVector()[0] :
+                                                 vector->state->getSelVector()[i];
+            if (vector->isNull(pos)) {
+                // write null value
+                serializer->writeBufferData(ExportCSVConstants::DEFAULT_NULL_STR);
+                continue;
+            }
+            auto strValue = vector->getValue<ku_string_t>(pos);
+            // Note: we need blindly add quotes to LIST.
+            writeString(serializer.get(), exportCSVBindData, strValue.getData(), strValue.len,
+                ExportCSVConstants::DEFAULT_FORCE_QUOTE ||
+                    inputVectors[j]->dataType.getLogicalTypeID() == LogicalTypeID::LIST,
+                sharedState.parallelFlag);
+        }
+        serializer->writeBufferData(ExportCSVConstants::DEFAULT_CSV_NEWLINE[0]);
+    }
+}
+
+static void sinkFunc(ExportFuncSharedState& sharedState, ExportFuncLocalState& localState,
+    const ExportFuncBindData& bindData, std::vector<std::shared_ptr<ValueVector>> inputVectors) {
+    auto& exportCSVLocalState = localState.cast<ExportCSVLocalState>();
+    auto& exportCSVBindData = bindData.constCast<ExportCSVBindData>();
+    auto& exportCSVSharedState = sharedState.cast<ExportCSVSharedState>();
+    writeRows(exportCSVBindData, exportCSVLocalState, exportCSVSharedState,
+        std::move(inputVectors));
+    auto& serializer = exportCSVLocalState.serializer;
+    if (serializer->getSize() > ExportCSVConstants::DEFAULT_CSV_FLUSH_SIZE) {
+        exportCSVSharedState.writeRows(serializer->getBlobData(), serializer->getSize());
+        serializer->clear();
+    }
+}
+
+static void combineFunc(ExportFuncSharedState& sharedState, ExportFuncLocalState& localState) {
+    auto& serializer = localState.cast<ExportCSVLocalState>().serializer;
+    auto& exportCSVSharedState = sharedState.cast<ExportCSVSharedState>();
+    if (serializer->getSize() > 0) {
+        exportCSVSharedState.writeRows(serializer->getBlobData(), serializer->getSize());
+        serializer->clear();
+    }
+}
+
+static void finalizeFunc(ExportFuncSharedState&) {}
+
+function_set ExportCSVFunction::getFunctionSet() {
+    function_set functionSet;
+    auto exportFunc = std::make_unique<ExportFunction>(name);
+    exportFunc->bind = bindFunc;
+    exportFunc->initLocalState = initLocalStateFunc;
+    exportFunc->createSharedState = createSharedStateFunc;
+    exportFunc->initSharedState = initSharedStateFunc;
+    exportFunc->sink = sinkFunc;
+    exportFunc->combine = combineFunc;
+    exportFunc->finalize = finalizeFunc;
+    functionSet.push_back(std::move(exportFunc));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/export/export_parquet_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/export/export_parquet_function.cpp
new file mode 100644
index 0000000000..49d14366f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/export/export_parquet_function.cpp
@@ -0,0 +1,183 @@
+#include "common/exception/runtime.h"
+#include "common/string_utils.h"
+#include "common/system_config.h"
+#include "function/export/export_function.h"
+#include "main/client_context.h"
+#include "parquet_types.h"
+#include "processor/operator/persistent/writer/parquet/parquet_writer.h"
+#include "processor/result/factorized_table.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace function {
+
+using namespace common;
+using namespace processor;
+
+struct ParquetOptions {
+    lbug_parquet::format::CompressionCodec::type codec =
+        lbug_parquet::format::CompressionCodec::SNAPPY;
+
+    explicit ParquetOptions(case_insensitive_map_t<common::Value> parsingOptions) {
+        for (auto& [name, value] : parsingOptions) {
+            if (name == "COMPRESSION") {
+                setCompression(value);
+            } else {
+                throw common::RuntimeException{
+                    common::stringFormat("Unrecognized parquet option: {}.", name)};
+            }
+        }
+    }
+
+    void setCompression(common::Value& value) {
+        if (value.getDataType().getLogicalTypeID() != LogicalTypeID::STRING) {
+            throw common::RuntimeException{
+                common::stringFormat("Parquet compression option expects a string value, got: {}.",
+                    value.getDataType().toString())};
+        }
+        auto strVal = common::StringUtils::getUpper(value.getValue<std::string>());
+        if (strVal == "UNCOMPRESSED") {
+            codec = lbug_parquet::format::CompressionCodec::UNCOMPRESSED;
+        } else if (strVal == "SNAPPY") {
+            codec = lbug_parquet::format::CompressionCodec::SNAPPY;
+        } else if (strVal == "ZSTD") {
+            codec = lbug_parquet::format::CompressionCodec::ZSTD;
+        } else if (strVal == "GZIP") {
+            codec = lbug_parquet::format::CompressionCodec::GZIP;
+        } else if (strVal == "LZ4_RAW") {
+            codec = lbug_parquet::format::CompressionCodec::LZ4_RAW;
+        } else {
+            throw common::RuntimeException{common::stringFormat(
+                "Unrecognized parquet compression option: {}.", value.toString())};
+        }
+    }
+};
+
+struct ExportParquetBindData final : public ExportFuncBindData {
+    ParquetOptions parquetOptions;
+
+    ExportParquetBindData(std::vector<std::string> names, std::string fileName,
+        ParquetOptions parquetOptions)
+        : ExportFuncBindData{std::move(names), std::move(fileName)},
+          parquetOptions{parquetOptions} {}
+
+    std::unique_ptr<ExportFuncBindData> copy() const override {
+        auto bindData =
+            std::make_unique<ExportParquetBindData>(columnNames, fileName, parquetOptions);
+        bindData->types = LogicalType::copy(types);
+        return bindData;
+    }
+};
+
+struct ExportParquetLocalState final : public ExportFuncLocalState {
+    std::unique_ptr<FactorizedTable> ft;
+    uint64_t numTuplesInFT;
+    storage::MemoryManager* mm;
+
+    ExportParquetLocalState(const ExportFuncBindData& bindData, main::ClientContext& context,
+        std::vector<bool> isFlatVec)
+        : mm{storage::MemoryManager::Get(context)} {
+        auto tableSchema = FactorizedTableSchema();
+        for (auto i = 0u; i < isFlatVec.size(); i++) {
+            auto columnSchema =
+                isFlatVec[i] ?
+                    ColumnSchema(false, 0 /* dummyGroupPos */,
+                        LogicalTypeUtils::getRowLayoutSize(bindData.types[i])) :
+                    ColumnSchema(true, 1 /* dummyGroupPos */, (uint32_t)sizeof(overflow_value_t));
+            tableSchema.appendColumn(std::move(columnSchema));
+        }
+        ft = std::make_unique<FactorizedTable>(mm, tableSchema.copy());
+        numTuplesInFT = 0;
+    }
+};
+
+struct ExportParquetSharedState : public ExportFuncSharedState {
+    std::unique_ptr<ParquetWriter> writer;
+
+    ExportParquetSharedState() = default;
+
+    void init(main::ClientContext& context, const ExportFuncBindData& bindData) override {
+        auto& exportParquetBindData = bindData.constCast<ExportParquetBindData>();
+        writer = std::make_unique<ParquetWriter>(exportParquetBindData.fileName,
+            common::LogicalType::copy(exportParquetBindData.types),
+            exportParquetBindData.columnNames, exportParquetBindData.parquetOptions.codec,
+            &context);
+    }
+};
+
+static std::unique_ptr<ExportFuncBindData> bindFunc(ExportFuncBindInput& bindInput) {
+    ParquetOptions parquetOptions{bindInput.parsingOptions};
+    return std::make_unique<ExportParquetBindData>(bindInput.columnNames, bindInput.filePath,
+        parquetOptions);
+}
+
+static std::unique_ptr<ExportFuncLocalState> initLocalStateFunc(main::ClientContext& context,
+    const ExportFuncBindData& bindData, std::vector<bool> isFlatVec) {
+    return std::make_unique<ExportParquetLocalState>(bindData, context, isFlatVec);
+}
+
+static std::shared_ptr<ExportFuncSharedState> createSharedStateFunc() {
+    return std::make_shared<ExportParquetSharedState>();
+}
+
+static void initSharedStateFunc(ExportFuncSharedState& sharedState, main::ClientContext& context,
+    const ExportFuncBindData& bindData) {
+    sharedState.init(context, bindData);
+}
+
+static std::vector<ValueVector*> extractSharedPtr(
+    std::vector<std::shared_ptr<ValueVector>> inputVectors, uint64_t& numTuplesToAppend) {
+    std::vector<ValueVector*> vecs;
+    numTuplesToAppend =
+        inputVectors.size() > 0 ? inputVectors[0]->state->getSelVector().getSelSize() : 0;
+    for (auto& inputVector : inputVectors) {
+        if (!inputVector->state->isFlat()) {
+            numTuplesToAppend = inputVector->state->getSelVector().getSelSize();
+        }
+        vecs.push_back(inputVector.get());
+    }
+    return vecs;
+}
+
+static void sinkFunc(ExportFuncSharedState& sharedState, ExportFuncLocalState& localState,
+    const ExportFuncBindData& /*bindData*/,
+    std::vector<std::shared_ptr<ValueVector>> inputVectors) {
+    auto& exportParquetLocalState = localState.cast<ExportParquetLocalState>();
+    uint64_t numTuplesToAppend = 0;
+    // TODO(Ziyi): We should let factorizedTable::append return the numTuples appended.
+    exportParquetLocalState.ft->append(extractSharedPtr(inputVectors, numTuplesToAppend));
+    exportParquetLocalState.numTuplesInFT += numTuplesToAppend;
+    if (exportParquetLocalState.numTuplesInFT > StorageConfig::NODE_GROUP_SIZE) {
+        auto& exportParquetSharedState = sharedState.cast<ExportParquetSharedState>();
+        exportParquetSharedState.writer->flush(*exportParquetLocalState.ft);
+        exportParquetLocalState.numTuplesInFT = 0;
+    }
+}
+
+static void combineFunc(ExportFuncSharedState& sharedState, ExportFuncLocalState& localState) {
+    auto& exportParquetSharedState = sharedState.cast<ExportParquetSharedState>();
+    auto& exportParquetLocalState = localState.cast<ExportParquetLocalState>();
+    exportParquetSharedState.writer->flush(*exportParquetLocalState.ft);
+}
+
+static void finalizeFunc(ExportFuncSharedState& sharedState) {
+    auto& exportParquetSharedState = sharedState.cast<ExportParquetSharedState>();
+    exportParquetSharedState.writer->finalize();
+}
+
+function_set ExportParquetFunction::getFunctionSet() {
+    function_set functionSet;
+    auto exportFunc = std::make_unique<ExportFunction>(name);
+    exportFunc->initLocalState = initLocalStateFunc;
+    exportFunc->createSharedState = createSharedStateFunc;
+    exportFunc->initSharedState = initSharedStateFunc;
+    exportFunc->sink = sinkFunc;
+    exportFunc->combine = combineFunc;
+    exportFunc->finalize = finalizeFunc;
+    exportFunc->bind = bindFunc;
+    functionSet.push_back(std::move(exportFunc));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/find_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/find_function.cpp
new file mode 100644
index 0000000000..866eaf106d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/find_function.cpp
@@ -0,0 +1,130 @@
+#include "function/string/functions/find_function.h"
+
+#include <cstring>
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+template<class UNSIGNED>
+int64_t Find::unalignedNeedleSizeFind(const uint8_t* haystack, uint32_t haystackLen,
+    const uint8_t* needle, uint32_t needleLen, uint32_t firstMatchCharOffset) {
+    if (needleLen > haystackLen) {
+        return -1;
+    }
+    // We perform unsigned integer comparisons to check for equality of the entire needle in a
+    // single comparison. This implementation is inspired by the memmem implementation of
+    // freebsd.
+    UNSIGNED needleEntry = 0;
+    UNSIGNED haystackEntry = 0;
+    const UNSIGNED start = (sizeof(UNSIGNED) * 8) - 8;
+    const UNSIGNED shift = (sizeof(UNSIGNED) - needleLen) * 8;
+    for (auto i = 0u; i < needleLen; i++) {
+        needleEntry |= UNSIGNED(needle[i]) << UNSIGNED(start - i * 8);
+        haystackEntry |= UNSIGNED(haystack[i]) << UNSIGNED(start - i * 8);
+    }
+    for (auto offset = needleLen; offset < haystackLen; offset++) {
+        if (haystackEntry == needleEntry) {
+            return firstMatchCharOffset + offset - needleLen;
+        }
+        // We adjust the haystack entry by
+        // (1) removing the left-most character (shift by 8)
+        // (2) adding the next character (bitwise or, with potential shift)
+        // this shift is only necessary if the needle size is not aligned with the unsigned
+        // integer size (e.g. needle size 3, unsigned integer size 4, we need to shift by 1).
+        haystackEntry = (haystackEntry << 8) | ((UNSIGNED(haystack[offset])) << shift);
+    }
+    if (haystackEntry == needleEntry) {
+        return firstMatchCharOffset + haystackLen - needleLen;
+    }
+    return -1;
+}
+
+template<class UNSIGNED>
+int64_t Find::alignedNeedleSizeFind(const uint8_t* haystack, uint32_t haystackLen,
+    const uint8_t* needle, uint32_t firstMatchCharOffset) {
+    if (sizeof(UNSIGNED) > haystackLen) {
+        return -1;
+    }
+    auto needleVal = *((UNSIGNED*)needle);
+    for (auto offset = 0u; offset <= haystackLen - sizeof(UNSIGNED); offset++) {
+        auto haystackVal = *((UNSIGNED*)(haystack + offset));
+        if (needleVal == haystackVal) {
+            return firstMatchCharOffset + offset;
+        }
+    }
+    return -1;
+}
+
+int64_t Find::genericFind(const uint8_t* haystack, uint32_t haystackLen, const uint8_t* needle,
+    uint32_t needLen, uint32_t firstMatchCharOffset) {
+    if (needLen > haystackLen) {
+        return -1;
+    }
+    // This implementation is inspired by Raphael Javaux's faststrstr
+    // (https://github.com/RaphaelJ/fast_strstr) generic contains; note that we can't use strstr
+    // because we don't have null-terminated strings anymore we keep track of a shifting window
+    // sum of all characters with window size equal to needle_size this shifting sum is used to
+    // avoid calling into memcmp; we only need to call into memcmp when the window sum is equal
+    // to the needle sum when that happens, the characters are potentially the same and we call
+    // into memcmp to check if they are.
+    auto sumsDiff = 0u;
+    for (auto i = 0u; i < needLen; i++) {
+        sumsDiff += haystack[i];
+        sumsDiff -= needle[i];
+    }
+    auto offset = 0u;
+    while (true) {
+        if (sumsDiff == 0 && haystack[offset] == needle[0]) {
+            if (memcmp(haystack + offset, needle, needLen) == 0) {
+                return firstMatchCharOffset + offset;
+            }
+        }
+        if (offset >= haystackLen - needLen) {
+            return -1;
+        }
+        sumsDiff -= haystack[offset];
+        sumsDiff += haystack[offset + needLen];
+        offset++;
+    }
+}
+
+// Returns the position of the first occurrence of needle in the haystack. If haystack doesn't
+// contain needle, it returns -1.
+int64_t Find::find(const uint8_t* haystack, uint32_t haystackLen, const uint8_t* needle,
+    uint32_t needleLen) {
+    auto firstMatchCharPos = (uint8_t*)memchr(haystack, needle[0], haystackLen);
+    if (firstMatchCharPos == nullptr) {
+        return -1;
+    }
+    auto firstMatchCharOffset = firstMatchCharPos - haystack;
+    auto numCharsToMatch = haystackLen - firstMatchCharOffset;
+    switch (needleLen) {
+    case 1:
+        return firstMatchCharOffset;
+    case 2:
+        return alignedNeedleSizeFind<uint16_t>(firstMatchCharPos, numCharsToMatch, needle,
+            firstMatchCharOffset);
+    case 3:
+        return unalignedNeedleSizeFind<uint32_t>(firstMatchCharPos, numCharsToMatch, needle, 3,
+            firstMatchCharOffset);
+    case 4:
+        return alignedNeedleSizeFind<uint32_t>(firstMatchCharPos, numCharsToMatch, needle,
+            firstMatchCharOffset);
+    case 5:
+    case 6:
+    case 7:
+        return unalignedNeedleSizeFind<uint64_t>(firstMatchCharPos, numCharsToMatch, needle,
+            needleLen, firstMatchCharOffset);
+    case 8:
+        return alignedNeedleSizeFind<uint64_t>(firstMatchCharPos, numCharsToMatch, needle,
+            firstMatchCharOffset);
+    default:
+        return genericFind(firstMatchCharPos, numCharsToMatch, needle, needleLen,
+            firstMatchCharOffset);
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/function.cpp
new file mode 100644
index 0000000000..8765e1b90a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/function.cpp
@@ -0,0 +1,18 @@
+#include "function/function.h"
+
+#include "binder/expression/expression_util.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+std::unique_ptr<FunctionBindData> FunctionBindData::getSimpleBindData(
+    const expression_vector& params, const LogicalType& resultType) {
+    auto paramTypes = ExpressionUtil::getDataTypes(params);
+    return std::make_unique<FunctionBindData>(std::move(paramTypes), resultType.copy());
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/function_collection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/function_collection.cpp
new file mode 100644
index 0000000000..f4790ad3e3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/function_collection.cpp
@@ -0,0 +1,257 @@
+#include "function/function_collection.h"
+
+#include "function/aggregate/count.h"
+#include "function/aggregate/count_star.h"
+#include "function/arithmetic/vector_arithmetic_functions.h"
+#include "function/array/vector_array_functions.h"
+#include "function/blob/vector_blob_functions.h"
+#include "function/cast/vector_cast_functions.h"
+#include "function/comparison/vector_comparison_functions.h"
+#include "function/date/vector_date_functions.h"
+#include "function/export/export_function.h"
+#include "function/hash/vector_hash_functions.h"
+#include "function/internal_id/vector_internal_id_functions.h"
+#include "function/interval/vector_interval_functions.h"
+#include "function/list/vector_list_functions.h"
+#include "function/map/vector_map_functions.h"
+#include "function/path/vector_path_functions.h"
+#include "function/schema/vector_node_rel_functions.h"
+#include "function/sequence/sequence_functions.h"
+#include "function/string/vector_string_functions.h"
+#include "function/struct/vector_struct_functions.h"
+#include "function/table/simple_table_function.h"
+#include "function/table/standalone_call_function.h"
+#include "function/timestamp/vector_timestamp_functions.h"
+#include "function/union/vector_union_functions.h"
+#include "function/utility/vector_utility_functions.h"
+#include "function/uuid/vector_uuid_functions.h"
+#include "processor/operator/persistent/reader/csv/parallel_csv_reader.h"
+#include "processor/operator/persistent/reader/csv/serial_csv_reader.h"
+#include "processor/operator/persistent/reader/npy/npy_reader.h"
+#include "processor/operator/persistent/reader/parquet/parquet_reader.h"
+
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+#define SCALAR_FUNCTION_BASE(_PARAM, _NAME)                                                        \
+    { _PARAM::getFunctionSet, _NAME, CatalogEntryType::SCALAR_FUNCTION_ENTRY }
+#define SCALAR_FUNCTION(_PARAM) SCALAR_FUNCTION_BASE(_PARAM, _PARAM::name)
+#define SCALAR_FUNCTION_ALIAS(_PARAM) SCALAR_FUNCTION_BASE(_PARAM::alias, _PARAM::name)
+#define REWRITE_FUNCTION_BASE(_PARAM, _NAME)                                                       \
+    { _PARAM::getFunctionSet, _NAME, CatalogEntryType::REWRITE_FUNCTION_ENTRY }
+#define REWRITE_FUNCTION(_PARAM) REWRITE_FUNCTION_BASE(_PARAM, _PARAM::name)
+#define REWRITE_FUNCTION_ALIAS(_PARAM) REWRITE_FUNCTION_BASE(_PARAM::alias, _PARAM::name)
+#define AGGREGATE_FUNCTION(_PARAM)                                                                 \
+    { _PARAM::getFunctionSet, _PARAM::name, CatalogEntryType::AGGREGATE_FUNCTION_ENTRY }
+#define EXPORT_FUNCTION(_PARAM)                                                                    \
+    { _PARAM::getFunctionSet, _PARAM::name, CatalogEntryType::COPY_FUNCTION_ENTRY }
+#define TABLE_FUNCTION(_PARAM)                                                                     \
+    { _PARAM::getFunctionSet, _PARAM::name, CatalogEntryType::TABLE_FUNCTION_ENTRY }
+#define STANDALONE_TABLE_FUNCTION(_PARAM)                                                          \
+    { _PARAM::getFunctionSet, _PARAM::name, CatalogEntryType::STANDALONE_TABLE_FUNCTION_ENTRY }
+#define FINAL_FUNCTION                                                                             \
+    { nullptr, nullptr, CatalogEntryType::SCALAR_FUNCTION_ENTRY }
+
+FunctionCollection* FunctionCollection::getFunctions() {
+    static FunctionCollection functions[] = {
+
+        // Arithmetic Functions
+        SCALAR_FUNCTION(AddFunction), SCALAR_FUNCTION(SubtractFunction),
+        SCALAR_FUNCTION(MultiplyFunction), SCALAR_FUNCTION(DivideFunction),
+        SCALAR_FUNCTION(ModuloFunction), SCALAR_FUNCTION(PowerFunction),
+        SCALAR_FUNCTION(AbsFunction), SCALAR_FUNCTION(AcosFunction), SCALAR_FUNCTION(AsinFunction),
+        SCALAR_FUNCTION(AtanFunction), SCALAR_FUNCTION(Atan2Function),
+        SCALAR_FUNCTION(BitwiseXorFunction), SCALAR_FUNCTION(BitwiseAndFunction),
+        SCALAR_FUNCTION(BitwiseOrFunction), SCALAR_FUNCTION(BitShiftLeftFunction),
+        SCALAR_FUNCTION(BitShiftRightFunction), SCALAR_FUNCTION(CbrtFunction),
+        SCALAR_FUNCTION(CeilFunction), SCALAR_FUNCTION_ALIAS(CeilingFunction),
+        SCALAR_FUNCTION(CosFunction), SCALAR_FUNCTION(CotFunction),
+        SCALAR_FUNCTION(DegreesFunction), SCALAR_FUNCTION(EvenFunction),
+        SCALAR_FUNCTION(FactorialFunction), SCALAR_FUNCTION(FloorFunction),
+        SCALAR_FUNCTION(GammaFunction), SCALAR_FUNCTION(LgammaFunction),
+        SCALAR_FUNCTION(LnFunction), SCALAR_FUNCTION(LogFunction),
+        SCALAR_FUNCTION_ALIAS(Log10Function), SCALAR_FUNCTION(Log2Function),
+        SCALAR_FUNCTION(NegateFunction), SCALAR_FUNCTION(PiFunction),
+        SCALAR_FUNCTION_ALIAS(PowFunction), SCALAR_FUNCTION(RadiansFunction),
+        SCALAR_FUNCTION(RoundFunction), SCALAR_FUNCTION(SinFunction), SCALAR_FUNCTION(SignFunction),
+        SCALAR_FUNCTION(SqrtFunction), SCALAR_FUNCTION(TanFunction), SCALAR_FUNCTION(RandFunction),
+        SCALAR_FUNCTION(SetSeedFunction),
+
+        // String Functions
+        SCALAR_FUNCTION(ArrayExtractFunction), SCALAR_FUNCTION(ConcatFunction),
+        SCALAR_FUNCTION(ContainsFunction), SCALAR_FUNCTION(LowerFunction),
+        SCALAR_FUNCTION_ALIAS(ToLowerFunction), SCALAR_FUNCTION_ALIAS(LcaseFunction),
+        SCALAR_FUNCTION(LeftFunction), SCALAR_FUNCTION(LpadFunction),
+        SCALAR_FUNCTION(LtrimFunction), SCALAR_FUNCTION(StartsWithFunction),
+        SCALAR_FUNCTION_ALIAS(PrefixFunction), SCALAR_FUNCTION(RepeatFunction),
+        SCALAR_FUNCTION(ReverseFunction), SCALAR_FUNCTION(RightFunction),
+        SCALAR_FUNCTION(RpadFunction), SCALAR_FUNCTION(RtrimFunction),
+        SCALAR_FUNCTION(SubStrFunction), SCALAR_FUNCTION_ALIAS(SubstringFunction),
+        SCALAR_FUNCTION(EndsWithFunction), SCALAR_FUNCTION_ALIAS(SuffixFunction),
+        SCALAR_FUNCTION(TrimFunction), SCALAR_FUNCTION(UpperFunction),
+        SCALAR_FUNCTION_ALIAS(UCaseFunction), SCALAR_FUNCTION_ALIAS(ToUpperFunction),
+        SCALAR_FUNCTION(RegexpFullMatchFunction), SCALAR_FUNCTION(RegexpMatchesFunction),
+        SCALAR_FUNCTION(RegexpReplaceFunction), SCALAR_FUNCTION(RegexpExtractFunction),
+        SCALAR_FUNCTION(RegexpExtractAllFunction), SCALAR_FUNCTION(LevenshteinFunction),
+        SCALAR_FUNCTION(RegexpSplitToArrayFunction), SCALAR_FUNCTION(InitCapFunction),
+        SCALAR_FUNCTION(StringSplitFunction), SCALAR_FUNCTION_ALIAS(StrSplitFunction),
+        SCALAR_FUNCTION_ALIAS(StringToArrayFunction), SCALAR_FUNCTION(SplitPartFunction),
+        SCALAR_FUNCTION(InternalIDCreationFunction), SCALAR_FUNCTION(ConcatWSFunction),
+
+        // Array Functions
+        SCALAR_FUNCTION(ArrayValueFunction), SCALAR_FUNCTION(ArrayCrossProductFunction),
+        SCALAR_FUNCTION(ArrayCosineSimilarityFunction), SCALAR_FUNCTION(ArrayDistanceFunction),
+        SCALAR_FUNCTION(ArraySquaredDistanceFunction), SCALAR_FUNCTION(ArrayInnerProductFunction),
+        SCALAR_FUNCTION(ArrayDotProductFunction),
+
+        // List functions
+        SCALAR_FUNCTION(ListCreationFunction), SCALAR_FUNCTION(ListRangeFunction),
+        SCALAR_FUNCTION(ListExtractFunction), SCALAR_FUNCTION_ALIAS(ListElementFunction),
+        SCALAR_FUNCTION(ListConcatFunction), SCALAR_FUNCTION_ALIAS(ListCatFunction),
+        SCALAR_FUNCTION(ArrayConcatFunction), SCALAR_FUNCTION_ALIAS(ArrayCatFunction),
+        SCALAR_FUNCTION(ListAppendFunction), SCALAR_FUNCTION(ArrayAppendFunction),
+        SCALAR_FUNCTION_ALIAS(ArrayPushFrontFunction), SCALAR_FUNCTION(ListPrependFunction),
+        SCALAR_FUNCTION(ArrayPrependFunction), SCALAR_FUNCTION_ALIAS(ArrayPushBackFunction),
+        SCALAR_FUNCTION(ListPositionFunction), SCALAR_FUNCTION_ALIAS(ListIndexOfFunction),
+        SCALAR_FUNCTION(ArrayPositionFunction), SCALAR_FUNCTION_ALIAS(ArrayIndexOfFunction),
+        SCALAR_FUNCTION(ListContainsFunction), SCALAR_FUNCTION_ALIAS(ListHasFunction),
+        SCALAR_FUNCTION(ArrayContainsFunction), SCALAR_FUNCTION_ALIAS(ArrayHasFunction),
+        SCALAR_FUNCTION(ListSliceFunction), SCALAR_FUNCTION(ArraySliceFunction),
+        SCALAR_FUNCTION(ListSortFunction), SCALAR_FUNCTION(ListReverseSortFunction),
+        SCALAR_FUNCTION(ListSumFunction), SCALAR_FUNCTION(ListProductFunction),
+        SCALAR_FUNCTION(ListDistinctFunction), SCALAR_FUNCTION(ListUniqueFunction),
+        SCALAR_FUNCTION(ListAnyValueFunction), SCALAR_FUNCTION(ListReverseFunction),
+        SCALAR_FUNCTION(SizeFunction), SCALAR_FUNCTION(ListToStringFunction),
+        SCALAR_FUNCTION(ListTransformFunction), SCALAR_FUNCTION(ListFilterFunction),
+        SCALAR_FUNCTION(ListReduceFunction), SCALAR_FUNCTION(ListAnyFunction),
+        SCALAR_FUNCTION(ListAllFunction), SCALAR_FUNCTION(ListNoneFunction),
+        SCALAR_FUNCTION(ListSingleFunction), SCALAR_FUNCTION(ListHasAllFunction),
+
+        // Cast functions
+        SCALAR_FUNCTION(CastToDateFunction), SCALAR_FUNCTION_ALIAS(DateFunction),
+        SCALAR_FUNCTION(CastToTimestampFunction), SCALAR_FUNCTION(CastToIntervalFunction),
+        SCALAR_FUNCTION_ALIAS(IntervalFunctionAlias), SCALAR_FUNCTION_ALIAS(DurationFunction),
+        SCALAR_FUNCTION(CastToStringFunction), SCALAR_FUNCTION_ALIAS(StringFunction),
+        SCALAR_FUNCTION(CastToBlobFunction), SCALAR_FUNCTION_ALIAS(BlobFunction),
+        SCALAR_FUNCTION(CastToUUIDFunction), SCALAR_FUNCTION_ALIAS(UUIDFunction),
+        SCALAR_FUNCTION(CastToDoubleFunction), SCALAR_FUNCTION(CastToFloatFunction),
+        SCALAR_FUNCTION(CastToSerialFunction), SCALAR_FUNCTION(CastToInt64Function),
+        SCALAR_FUNCTION(CastToInt32Function), SCALAR_FUNCTION(CastToInt16Function),
+        SCALAR_FUNCTION(CastToInt8Function), SCALAR_FUNCTION(CastToUInt64Function),
+        SCALAR_FUNCTION(CastToUInt32Function), SCALAR_FUNCTION(CastToUInt16Function),
+        SCALAR_FUNCTION(CastToUInt8Function), SCALAR_FUNCTION(CastToInt128Function),
+        SCALAR_FUNCTION(CastToUInt128Function), SCALAR_FUNCTION(CastToBoolFunction),
+        SCALAR_FUNCTION(CastAnyFunction),
+
+        // Comparison functions
+        SCALAR_FUNCTION(EqualsFunction), SCALAR_FUNCTION(NotEqualsFunction),
+        SCALAR_FUNCTION(GreaterThanFunction), SCALAR_FUNCTION(GreaterThanEqualsFunction),
+        SCALAR_FUNCTION(LessThanFunction), SCALAR_FUNCTION(LessThanEqualsFunction),
+
+        // Date functions
+        SCALAR_FUNCTION(DatePartFunction), SCALAR_FUNCTION_ALIAS(DatePartFunctionAlias),
+        SCALAR_FUNCTION(DateTruncFunction), SCALAR_FUNCTION_ALIAS(DateTruncFunctionAlias),
+        SCALAR_FUNCTION(DayNameFunction), SCALAR_FUNCTION(GreatestFunction),
+        SCALAR_FUNCTION(LastDayFunction), SCALAR_FUNCTION(LeastFunction),
+        SCALAR_FUNCTION(MakeDateFunction), SCALAR_FUNCTION(MonthNameFunction),
+        SCALAR_FUNCTION(CurrentDateFunction),
+
+        // Timestamp functions
+        SCALAR_FUNCTION(CenturyFunction), SCALAR_FUNCTION(EpochMsFunction),
+        SCALAR_FUNCTION(ToTimestampFunction), SCALAR_FUNCTION(CurrentTimestampFunction),
+        SCALAR_FUNCTION(ToEpochMsFunction),
+
+        // Interval functions
+        SCALAR_FUNCTION(ToYearsFunction), SCALAR_FUNCTION(ToMonthsFunction),
+        SCALAR_FUNCTION(ToDaysFunction), SCALAR_FUNCTION(ToHoursFunction),
+        SCALAR_FUNCTION(ToMinutesFunction), SCALAR_FUNCTION(ToSecondsFunction),
+        SCALAR_FUNCTION(ToMillisecondsFunction), SCALAR_FUNCTION(ToMicrosecondsFunction),
+
+        // Blob functions
+        SCALAR_FUNCTION(OctetLengthFunctions), SCALAR_FUNCTION(EncodeFunctions),
+        SCALAR_FUNCTION(DecodeFunctions),
+
+        // UUID functions
+        SCALAR_FUNCTION(GenRandomUUIDFunction),
+
+        // Struct functions
+        SCALAR_FUNCTION(StructPackFunctions), SCALAR_FUNCTION(StructExtractFunctions),
+        REWRITE_FUNCTION(KeysFunctions),
+
+        // Map functions
+        SCALAR_FUNCTION(MapCreationFunctions), SCALAR_FUNCTION(MapExtractFunctions),
+        SCALAR_FUNCTION_ALIAS(ElementAtFunctions), SCALAR_FUNCTION_ALIAS(CardinalityFunction),
+        SCALAR_FUNCTION(MapKeysFunctions), SCALAR_FUNCTION(MapValuesFunctions),
+
+        // Union functions
+        SCALAR_FUNCTION(UnionValueFunction), SCALAR_FUNCTION(UnionTagFunction),
+        SCALAR_FUNCTION(UnionExtractFunction),
+
+        // Node/rel functions
+        SCALAR_FUNCTION(OffsetFunction), REWRITE_FUNCTION(IDFunction),
+        REWRITE_FUNCTION(StartNodeFunction), REWRITE_FUNCTION(EndNodeFunction),
+        REWRITE_FUNCTION(LabelFunction), REWRITE_FUNCTION_ALIAS(LabelsFunction),
+        REWRITE_FUNCTION(CostFunction),
+
+        // Path functions
+        SCALAR_FUNCTION(NodesFunction), SCALAR_FUNCTION(RelsFunction),
+        SCALAR_FUNCTION_ALIAS(RelationshipsFunction), SCALAR_FUNCTION(PropertiesFunction),
+        SCALAR_FUNCTION(IsTrailFunction), SCALAR_FUNCTION(IsACyclicFunction),
+        REWRITE_FUNCTION(LengthFunction),
+
+        // Hash functions
+        SCALAR_FUNCTION(MD5Function), SCALAR_FUNCTION(SHA256Function),
+        SCALAR_FUNCTION(HashFunction),
+
+        // Scalar utility functions
+        SCALAR_FUNCTION(CoalesceFunction), SCALAR_FUNCTION(IfNullFunction),
+        SCALAR_FUNCTION(ConstantOrNullFunction), SCALAR_FUNCTION(CountIfFunction),
+        SCALAR_FUNCTION(ErrorFunction), REWRITE_FUNCTION(NullIfFunction),
+        SCALAR_FUNCTION(TypeOfFunction),
+
+        // Sequence functions
+        SCALAR_FUNCTION(CurrValFunction), SCALAR_FUNCTION(NextValFunction),
+
+        // Aggregate functions
+        AGGREGATE_FUNCTION(CountStarFunction), AGGREGATE_FUNCTION(CountFunction),
+        AGGREGATE_FUNCTION(AggregateSumFunction), AGGREGATE_FUNCTION(AggregateAvgFunction),
+        AGGREGATE_FUNCTION(AggregateMinFunction), AGGREGATE_FUNCTION(AggregateMaxFunction),
+        AGGREGATE_FUNCTION(CollectFunction),
+
+        // Table functions
+        TABLE_FUNCTION(CurrentSettingFunction), TABLE_FUNCTION(CatalogVersionFunction),
+        TABLE_FUNCTION(DBVersionFunction), TABLE_FUNCTION(ShowTablesFunction),
+        TABLE_FUNCTION(FreeSpaceInfoFunction), TABLE_FUNCTION(ShowWarningsFunction),
+        TABLE_FUNCTION(TableInfoFunction), TABLE_FUNCTION(ShowConnectionFunction),
+        TABLE_FUNCTION(StatsInfoFunction), TABLE_FUNCTION(StorageInfoFunction),
+        TABLE_FUNCTION(ShowAttachedDatabasesFunction), TABLE_FUNCTION(ShowSequencesFunction),
+        TABLE_FUNCTION(ShowFunctionsFunction), TABLE_FUNCTION(BMInfoFunction),
+        TABLE_FUNCTION(FileInfoFunction), TABLE_FUNCTION(ShowLoadedExtensionsFunction),
+        TABLE_FUNCTION(ShowOfficialExtensionsFunction), TABLE_FUNCTION(ShowIndexesFunction),
+        TABLE_FUNCTION(ShowProjectedGraphsFunction), TABLE_FUNCTION(ProjectedGraphInfoFunction),
+        TABLE_FUNCTION(ShowMacrosFunction),
+
+        // Standalone Table functions
+        STANDALONE_TABLE_FUNCTION(LocalCacheArrayColumnFunction),
+        STANDALONE_TABLE_FUNCTION(ClearWarningsFunction),
+        STANDALONE_TABLE_FUNCTION(ProjectGraphNativeFunction),
+        STANDALONE_TABLE_FUNCTION(ProjectGraphCypherFunction),
+        STANDALONE_TABLE_FUNCTION(DropProjectedGraphFunction),
+
+        // Scan functions
+        TABLE_FUNCTION(ParquetScanFunction), TABLE_FUNCTION(NpyScanFunction),
+        TABLE_FUNCTION(SerialCSVScan), TABLE_FUNCTION(ParallelCSVScan),
+
+        // Export functions
+        EXPORT_FUNCTION(ExportCSVFunction), EXPORT_FUNCTION(ExportParquetFunction),
+
+        // End of array
+        FINAL_FUNCTION};
+
+    return functions;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/CMakeLists.txt
new file mode 100644
index 0000000000..9552f8d4f5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/CMakeLists.txt
@@ -0,0 +1,24 @@
+add_library(lbug_function_algorithm
+        OBJECT
+        asp_destinations.cpp
+        asp_paths.cpp
+        awsp_paths.cpp
+        bfs_graph.cpp
+        frontier_morsel.cpp
+        gds.cpp
+        gds_frontier.cpp
+        gds_state.cpp
+        gds_task.cpp
+        gds_utils.cpp
+        output_writer.cpp
+        rec_joins.cpp
+        ssp_destinations.cpp
+        ssp_paths.cpp
+        variable_length_path.cpp
+        wsp_destinations.cpp
+        wsp_paths.cpp
+        )
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_algorithm>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/asp_destinations.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/asp_destinations.cpp
new file mode 100644
index 0000000000..4cc221b101
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/asp_destinations.cpp
@@ -0,0 +1,333 @@
+#include "binder/expression/node_expression.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/rec_joins.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::processor;
+using namespace lbug::common;
+using namespace lbug::binder;
+using namespace lbug::storage;
+using namespace lbug::graph;
+
+namespace lbug {
+namespace function {
+
+using multiplicity_t = uint64_t;
+
+class Multiplicities {
+public:
+    virtual ~Multiplicities() = default;
+
+    virtual void pinTableID(table_id_t tableID) = 0;
+
+    virtual void increaseMultiplicity(offset_t offset, multiplicity_t multiplicity) = 0;
+
+    virtual multiplicity_t getMultiplicity(offset_t offset) = 0;
+};
+
+class SparseMultiplicitiesReference final : public Multiplicities {
+public:
+    explicit SparseMultiplicitiesReference(GDSSpareObjectManager<multiplicity_t>& spareObjects)
+        : spareObjects{spareObjects} {}
+
+    void pinTableID(table_id_t tableID) override { curData = spareObjects.getData(tableID); }
+
+    void increaseMultiplicity(offset_t offset, multiplicity_t multiplicity) override {
+        KU_ASSERT(curData);
+        if (curData->contains(offset)) {
+            curData->at(offset) += multiplicity;
+        } else {
+            curData->insert({offset, multiplicity});
+        }
+    }
+
+    multiplicity_t getMultiplicity(offset_t offset) override {
+        KU_ASSERT(curData);
+        if (curData->contains(offset)) {
+            return curData->at(offset);
+        }
+        return 0;
+    }
+
+private:
+    GDSSpareObjectManager<multiplicity_t>& spareObjects;
+    std::unordered_map<offset_t, multiplicity_t>* curData = nullptr;
+};
+
+class DenseMultiplicitiesReference final : public Multiplicities {
+public:
+    explicit DenseMultiplicitiesReference(
+        GDSDenseObjectManager<std::atomic<multiplicity_t>>& denseObjects)
+        : denseObjects(denseObjects) {}
+
+    void pinTableID(table_id_t tableID) override { curData = denseObjects.getData(tableID); }
+
+    void increaseMultiplicity(offset_t offset, multiplicity_t multiplicity) override {
+        KU_ASSERT(curData);
+        curData[offset].fetch_add(multiplicity);
+    }
+
+    multiplicity_t getMultiplicity(offset_t offset) override {
+        KU_ASSERT(curData);
+        return curData[offset].load(std::memory_order_relaxed);
+    }
+
+private:
+    GDSDenseObjectManager<std::atomic<multiplicity_t>>& denseObjects;
+    std::atomic<multiplicity_t>* curData = nullptr;
+};
+
+class MultiplicitiesPair {
+public:
+    explicit MultiplicitiesPair(const table_id_map_t<offset_t>& maxOffsetMap)
+        : maxOffsetMap{maxOffsetMap}, densityState{GDSDensityState::SPARSE},
+          sparseObjects{maxOffsetMap} {
+        curSparseMultiplicities = std::make_unique<SparseMultiplicitiesReference>(sparseObjects);
+        nextSparseMultiplicities = std::make_unique<SparseMultiplicitiesReference>(sparseObjects);
+        denseObjects = GDSDenseObjectManager<std::atomic<multiplicity_t>>();
+        curDenseMultiplicities = std::make_unique<DenseMultiplicitiesReference>(denseObjects);
+        nextDenseMultiplicities = std::make_unique<DenseMultiplicitiesReference>(denseObjects);
+    }
+
+    void pinCurTableID(table_id_t tableID) {
+        switch (densityState) {
+        case GDSDensityState::SPARSE: {
+            curSparseMultiplicities->pinTableID(tableID);
+            curMultiplicities = curSparseMultiplicities.get();
+        } break;
+        case GDSDensityState::DENSE: {
+            curDenseMultiplicities->pinTableID(tableID);
+            curMultiplicities = curDenseMultiplicities.get();
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+
+    void pinNextTableID(table_id_t tableID) {
+        switch (densityState) {
+        case GDSDensityState::SPARSE: {
+            nextSparseMultiplicities->pinTableID(tableID);
+            nextMultiplicities = nextSparseMultiplicities.get();
+        } break;
+        case GDSDensityState::DENSE: {
+            nextDenseMultiplicities->pinTableID(tableID);
+            nextMultiplicities = nextDenseMultiplicities.get();
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+
+    void increaseNextMultiplicity(offset_t offset, multiplicity_t multiplicity) {
+        nextMultiplicities->increaseMultiplicity(offset, multiplicity);
+    }
+
+    multiplicity_t getCurrentMultiplicity(offset_t offset) const {
+        return curMultiplicities->getMultiplicity(offset);
+    }
+    Multiplicities* getCurrentMultiplicities() { return curMultiplicities; }
+
+    void switchToDense(ExecutionContext* context) {
+        KU_ASSERT(densityState == GDSDensityState::SPARSE);
+        densityState = GDSDensityState::DENSE;
+        for (auto& [tableID, maxOffset] : maxOffsetMap) {
+            denseObjects.allocate(tableID, maxOffset, MemoryManager::Get(*context->clientContext));
+            auto data = denseObjects.getData(tableID);
+            for (auto i = 0u; i < maxOffset; i++) {
+                data[i].store(0);
+            }
+        }
+        for (auto& [tableID, map] : sparseObjects.getData()) {
+            auto data = denseObjects.getData(tableID);
+            for (auto& [offset, multiplicity] : map) {
+                data[offset].store(multiplicity);
+            }
+        }
+    }
+
+private:
+    table_id_map_t<offset_t> maxOffsetMap;
+    GDSDensityState densityState;
+    GDSSpareObjectManager<multiplicity_t> sparseObjects;
+    std::unique_ptr<SparseMultiplicitiesReference> curSparseMultiplicities;
+    std::unique_ptr<SparseMultiplicitiesReference> nextSparseMultiplicities;
+    GDSDenseObjectManager<std::atomic<multiplicity_t>> denseObjects;
+    std::unique_ptr<DenseMultiplicitiesReference> curDenseMultiplicities;
+    std::unique_ptr<DenseMultiplicitiesReference> nextDenseMultiplicities;
+
+    Multiplicities* curMultiplicities = nullptr;
+    Multiplicities* nextMultiplicities = nullptr;
+};
+
+class ASPDestinationsAuxiliaryState : public GDSAuxiliaryState {
+public:
+    explicit ASPDestinationsAuxiliaryState(std::unique_ptr<MultiplicitiesPair> multiplicitiesPair)
+        : multiplicitiesPair{std::move(multiplicitiesPair)} {}
+
+    MultiplicitiesPair* getMultiplicitiesPair() const { return multiplicitiesPair.get(); }
+
+    void initSource(nodeID_t source) override {
+        multiplicitiesPair->pinNextTableID(source.tableID);
+        multiplicitiesPair->increaseNextMultiplicity(source.offset, 1);
+    }
+
+    void beginFrontierCompute(table_id_t curTableID, table_id_t nextTableID) override {
+        multiplicitiesPair->pinCurTableID(curTableID);
+        multiplicitiesPair->pinNextTableID(nextTableID);
+    }
+
+    void switchToDense(ExecutionContext* context, Graph*) override {
+        multiplicitiesPair->switchToDense(context);
+    }
+
+private:
+    std::unique_ptr<MultiplicitiesPair> multiplicitiesPair;
+};
+
+class ASPDestinationsOutputWriter : public RJOutputWriter {
+public:
+    ASPDestinationsOutputWriter(main::ClientContext* context, NodeOffsetMaskMap* outputNodeMask,
+        nodeID_t sourceNodeID, Frontier* frontier, Multiplicities* multiplicities)
+        : RJOutputWriter{context, outputNodeMask, sourceNodeID}, frontier{frontier},
+          multiplicities{multiplicities} {
+        lengthVector = createVector(LogicalType::UINT16());
+    }
+
+    void beginWritingInternal(table_id_t tableID) override {
+        frontier->pinTableID(tableID);
+        multiplicities->pinTableID(tableID);
+    }
+
+    void write(FactorizedTable& fTable, table_id_t tableID, LimitCounter* counter) override {
+        auto& sparseFrontier = frontier->cast<SparseFrontier>();
+        for (auto [offset, _] : sparseFrontier.getCurrentData()) {
+            write(fTable, {offset, tableID}, counter);
+        }
+    }
+
+    void write(FactorizedTable& fTable, nodeID_t dstNodeID, LimitCounter* counter) override {
+        if (!inOutputNodeMask(dstNodeID.offset)) { // Skip dst if it not is in scope.
+            return;
+        }
+        if (dstNodeID == sourceNodeID_) { // Skip writing source node.
+            return;
+        }
+        auto iter = frontier->getIteration(dstNodeID.offset);
+        if (iter == FRONTIER_UNVISITED) { // Skip if dst is not visited.
+            return;
+        }
+        dstNodeIDVector->setValue<nodeID_t>(0, dstNodeID);
+        lengthVector->setValue<uint16_t>(0, iter);
+        auto multiplicity = multiplicities->getMultiplicity(dstNodeID.offset);
+        for (auto i = 0u; i < multiplicity; ++i) {
+            fTable.append(vectors);
+        }
+        if (counter != nullptr) {
+            counter->increase(multiplicity);
+        }
+    }
+
+    std::unique_ptr<RJOutputWriter> copy() override {
+        return std::make_unique<ASPDestinationsOutputWriter>(context, outputNodeMask, sourceNodeID_,
+            frontier, multiplicities);
+    }
+
+private:
+    std::unique_ptr<ValueVector> lengthVector;
+    Frontier* frontier;
+    Multiplicities* multiplicities;
+};
+
+class ASPDestinationsEdgeCompute : public SPEdgeCompute {
+public:
+    ASPDestinationsEdgeCompute(SPFrontierPair* frontierPair, MultiplicitiesPair* multiplicitiesPair)
+        : SPEdgeCompute{frontierPair}, multiplicitiesPair{multiplicitiesPair} {};
+
+    std::vector<nodeID_t> edgeCompute(nodeID_t boundNodeID, NbrScanState::Chunk& resultChunk,
+        bool) override {
+        std::vector<nodeID_t> activeNodes;
+        resultChunk.forEach([&](auto neighbors, auto, auto i) {
+            auto nbrNodeID = neighbors[i];
+            auto nbrVal = frontierPair->getNextFrontierValue(nbrNodeID.offset);
+            // We should update the nbrID's multiplicity in 2 cases: 1) if nbrID is being visited
+            // for the first time, i.e., when its value in the pathLengths frontier is
+            // FRONTIER_UNVISITED. Or 2) if nbrID has already been visited but in this
+            // iteration, so it's value is curIter + 1.
+            auto shouldUpdate =
+                nbrVal == FRONTIER_UNVISITED || nbrVal == frontierPair->getCurrentIter();
+            if (shouldUpdate) {
+                // This is safe because boundNodeID is in the current frontier, so its
+                // shortest paths multiplicity is guaranteed to not change in the current iteration.
+                auto boundMultiplicity =
+                    multiplicitiesPair->getCurrentMultiplicity(boundNodeID.offset);
+                multiplicitiesPair->increaseNextMultiplicity(nbrNodeID.offset, boundMultiplicity);
+            }
+            if (nbrVal == FRONTIER_UNVISITED) {
+                activeNodes.push_back(nbrNodeID);
+            }
+        });
+        return activeNodes;
+    }
+
+    std::unique_ptr<EdgeCompute> copy() override {
+        return std::make_unique<ASPDestinationsEdgeCompute>(frontierPair, multiplicitiesPair);
+    }
+
+private:
+    MultiplicitiesPair* multiplicitiesPair;
+};
+
+// All shortest path algorithm. Only destinations are tracked (reachability query).
+class AllSPDestinationsAlgorithm final : public RJAlgorithm {
+public:
+    std::string getFunctionName() const override { return AllSPDestinationsFunction::name; }
+
+    expression_vector getResultColumns(const RJBindData& bindData) const override {
+        expression_vector columns;
+        columns.push_back(bindData.nodeInput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.nodeOutput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.lengthExpr);
+        return columns;
+    }
+
+    std::unique_ptr<RJAlgorithm> copy() const override {
+        return std::make_unique<AllSPDestinationsAlgorithm>(*this);
+    }
+
+private:
+    std::unique_ptr<GDSComputeState> getComputeState(ExecutionContext* context, const RJBindData&,
+        RecursiveExtendSharedState* sharedState) override {
+        auto clientContext = context->clientContext;
+        auto graph = sharedState->graph.get();
+        auto multiplicitiesPair = std::make_unique<MultiplicitiesPair>(
+            graph->getMaxOffsetMap(transaction::Transaction::Get(*clientContext)));
+        auto frontier = DenseFrontier::getUnvisitedFrontier(context, graph);
+        auto frontierPair = std::make_unique<SPFrontierPair>(std::move(frontier));
+        auto edgeCompute = std::make_unique<ASPDestinationsEdgeCompute>(frontierPair.get(),
+            multiplicitiesPair.get());
+        auto auxiliaryState =
+            std::make_unique<ASPDestinationsAuxiliaryState>(std::move(multiplicitiesPair));
+        return std::make_unique<GDSComputeState>(std::move(frontierPair), std::move(edgeCompute),
+            std::move(auxiliaryState));
+    }
+
+    std::unique_ptr<RJOutputWriter> getOutputWriter(ExecutionContext* context, const RJBindData&,
+        GDSComputeState& computeState, nodeID_t sourceNodeID,
+        RecursiveExtendSharedState* sharedState) override {
+        auto frontier = computeState.frontierPair->ptrCast<SPFrontierPair>()->getFrontier();
+        auto multiplicities = computeState.auxiliaryState->ptrCast<ASPDestinationsAuxiliaryState>()
+                                  ->getMultiplicitiesPair()
+                                  ->getCurrentMultiplicities();
+        return std::make_unique<ASPDestinationsOutputWriter>(context->clientContext,
+            sharedState->getOutputNodeMaskMap(), sourceNodeID, frontier, multiplicities);
+    }
+};
+
+std::unique_ptr<RJAlgorithm> AllSPDestinationsFunction::getAlgorithm() {
+    return std::make_unique<AllSPDestinationsAlgorithm>();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/asp_paths.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/asp_paths.cpp
new file mode 100644
index 0000000000..7a7c068d2a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/asp_paths.cpp
@@ -0,0 +1,115 @@
+#include "binder/expression/node_expression.h"
+#include "function/gds/auxiliary_state/path_auxiliary_state.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/rec_joins.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+class ASPPathsEdgeCompute : public SPEdgeCompute {
+public:
+    ASPPathsEdgeCompute(SPFrontierPair* frontiersPair, BFSGraphManager* bfsGraphManager)
+        : SPEdgeCompute{frontiersPair}, bfsGraphManager{bfsGraphManager} {
+        block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+    }
+
+    std::vector<nodeID_t> edgeCompute(nodeID_t boundNodeID, graph::NbrScanState::Chunk& resultChunk,
+        bool fwdEdge) override {
+        std::vector<nodeID_t> activeNodes;
+        resultChunk.forEach([&](auto neighbors, auto propertyVectors, auto i) {
+            auto nbrNodeID = neighbors[i];
+            auto iter = frontierPair->getNextFrontierValue(nbrNodeID.offset);
+            // We should update in 2 cases: 1) if nbrID is being visited
+            // for the first time, i.e., when its value in the pathLengths frontier is
+            // PathLengths::UNVISITED. Or 2) if nbrID has already been visited but in this
+            // iteration, so it's value is curIter + 1.
+            auto shouldUpdate =
+                iter == FRONTIER_UNVISITED || iter == frontierPair->getCurrentIter();
+            if (shouldUpdate) {
+                if (!block->hasSpace()) {
+                    block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+                }
+                auto edgeID = propertyVectors[0]->template getValue<nodeID_t>(i);
+                bfsGraphManager->getCurrentGraph()->addParent(frontierPair->getCurrentIter(),
+                    boundNodeID, edgeID, nbrNodeID, fwdEdge, block);
+            }
+            if (iter == FRONTIER_UNVISITED) {
+                activeNodes.push_back(nbrNodeID);
+            }
+        });
+        return activeNodes;
+    }
+
+    std::unique_ptr<EdgeCompute> copy() override {
+        return std::make_unique<ASPPathsEdgeCompute>(frontierPair, bfsGraphManager);
+    }
+
+private:
+    BFSGraphManager* bfsGraphManager;
+    ObjectBlock<ParentList>* block = nullptr;
+};
+
+// All shortest path algorithm. Paths are tracked.
+class AllSPPathsAlgorithm final : public RJAlgorithm {
+public:
+    std::string getFunctionName() const override { return AllSPPathsFunction::name; }
+
+    expression_vector getResultColumns(const RJBindData& bindData) const override {
+        expression_vector columns;
+        columns.push_back(bindData.nodeInput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.nodeOutput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.lengthExpr);
+        if (bindData.extendDirection == ExtendDirection::BOTH) {
+            columns.push_back(bindData.directionExpr);
+        }
+        columns.push_back(bindData.pathNodeIDsExpr);
+        columns.push_back(bindData.pathEdgeIDsExpr);
+        return columns;
+    }
+
+    std::unique_ptr<RJAlgorithm> copy() const override {
+        return std::make_unique<AllSPPathsAlgorithm>(*this);
+    }
+
+private:
+    std::unique_ptr<GDSComputeState> getComputeState(ExecutionContext* context, const RJBindData&,
+        RecursiveExtendSharedState* sharedState) override {
+        auto clientContext = context->clientContext;
+        auto mm = storage::MemoryManager::Get(*clientContext);
+        auto denseFrontier =
+            DenseFrontier::getUninitializedFrontier(context, sharedState->graph.get());
+        auto frontierPair = std::make_unique<SPFrontierPair>(std::move(denseFrontier));
+        auto bfsGraph = std::make_unique<BFSGraphManager>(
+            sharedState->graph->getMaxOffsetMap(transaction::Transaction::Get(*clientContext)), mm);
+        auto edgeCompute =
+            std::make_unique<ASPPathsEdgeCompute>(frontierPair.get(), bfsGraph.get());
+        auto auxiliaryState = std::make_unique<PathAuxiliaryState>(std::move(bfsGraph));
+        return std::make_unique<GDSComputeState>(std::move(frontierPair), std::move(edgeCompute),
+            std::move(auxiliaryState));
+    }
+
+    std::unique_ptr<RJOutputWriter> getOutputWriter(ExecutionContext* context,
+        const RJBindData& bindData, GDSComputeState& computeState, nodeID_t sourceNodeID,
+        RecursiveExtendSharedState* sharedState) override {
+        auto bfsGraph = computeState.auxiliaryState->ptrCast<PathAuxiliaryState>()
+                            ->getBFSGraphManager()
+                            ->getCurrentGraph();
+        auto writerInfo = bindData.getPathWriterInfo();
+        writerInfo.pathNodeMask = sharedState->getPathNodeMaskMap();
+        return std::make_unique<SPPathsOutputWriter>(context->clientContext,
+            sharedState->getOutputNodeMaskMap(), sourceNodeID, writerInfo, *bfsGraph);
+    }
+};
+
+std::unique_ptr<RJAlgorithm> AllSPPathsFunction::getAlgorithm() {
+    return std::make_unique<AllSPPathsAlgorithm>();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/awsp_paths.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/awsp_paths.cpp
new file mode 100644
index 0000000000..16d7cd62c5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/awsp_paths.cpp
@@ -0,0 +1,184 @@
+#include "binder/expression/node_expression.h"
+#include "common/exception/interrupt.h"
+#include "function/gds/auxiliary_state/path_auxiliary_state.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/rec_joins.h"
+#include "function/gds/weight_utils.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+template<typename T>
+class AWSPPathsEdgeCompute : public EdgeCompute {
+public:
+    explicit AWSPPathsEdgeCompute(BFSGraphManager* bfsGraphManager)
+        : bfsGraphManager{bfsGraphManager} {
+        block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+    }
+
+    std::vector<nodeID_t> edgeCompute(nodeID_t boundNodeID, graph::NbrScanState::Chunk& chunk,
+        bool fwdEdge) override {
+        std::vector<nodeID_t> result;
+        chunk.forEach([&](auto neighbors, auto propertyVectors, auto i) {
+            auto nbrNodeID = neighbors[i];
+            auto edgeID = propertyVectors[0]->template getValue<relID_t>(i);
+            auto weight = propertyVectors[1]->template getValue<T>(i);
+            WeightUtils::checkWeight(AllWeightedSPPathsFunction::name, weight);
+            if (!block->hasSpace()) {
+                block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+            }
+            if (bfsGraphManager->getCurrentGraph()->tryAddParentWithWeight(boundNodeID, edgeID,
+                    nbrNodeID, fwdEdge, static_cast<double>(weight), block)) {
+                result.push_back(nbrNodeID);
+            }
+        });
+        return result;
+    }
+
+    std::unique_ptr<EdgeCompute> copy() override {
+        return std::make_unique<AWSPPathsEdgeCompute<T>>(bfsGraphManager);
+    }
+
+private:
+    BFSGraphManager* bfsGraphManager;
+    ObjectBlock<ParentList>* block = nullptr;
+};
+
+class AWSPPathsOutputWriter : public PathsOutputWriter {
+public:
+    AWSPPathsOutputWriter(main::ClientContext* context, NodeOffsetMaskMap* outputNodeMask,
+        nodeID_t sourceNodeID, PathsOutputWriterInfo info, BaseBFSGraph& bfsGraph)
+        : PathsOutputWriter{context, outputNodeMask, sourceNodeID, info, bfsGraph} {
+        costVector = createVector(LogicalType::DOUBLE());
+    }
+
+    void writeInternal(FactorizedTable& fTable, nodeID_t dstNodeID,
+        LimitCounter* counter) override {
+        if (dstNodeID == sourceNodeID_) { // Skip writing
+            return;
+        }
+        auto firstParent = bfsGraph.getParentListHead(dstNodeID.offset);
+        if (firstParent == nullptr) { // Skip if dst is not visited.
+            return;
+        }
+        if (firstParent->getCost() == std::numeric_limits<double>::max()) {
+            // Skip if dst is not visited.
+            return;
+        }
+        costVector->setValue<double>(0, firstParent->getCost());
+        std::vector<ParentList*> curPath;
+        curPath.push_back(firstParent);
+        auto backtracking = false;
+        while (!curPath.empty()) {
+            if (context->interrupted()) {
+                throw InterruptException{};
+            }
+            if (curPath[curPath.size() - 1]->getCost() == 0) { // Find source. Start writing path.
+                curPath.pop_back();
+                writePath(curPath);
+                fTable.append(vectors);
+                if (updateCounterAndTerminate(counter)) {
+                    return;
+                }
+                backtracking = true;
+            }
+            auto topIdx = curPath.size() - 1;
+            if (backtracking) {
+                auto next = curPath[topIdx]->getNextPtr();
+                if (next != nullptr) { // Find next top node with the same cost.
+                    KU_ASSERT(curPath[topIdx]->getCost() == next->getCost());
+                    curPath[topIdx] = next;
+                    backtracking = false;
+                } else { // Move to next top.
+                    curPath.pop_back();
+                }
+            } else { // Forward track fill path.
+                auto parent = bfsGraph.getParentListHead(curPath[topIdx]->getNodeID());
+                KU_ASSERT(parent != nullptr);
+                curPath.push_back(parent);
+                backtracking = false;
+            }
+        }
+    }
+
+    std::unique_ptr<RJOutputWriter> copy() override {
+        return std::make_unique<AWSPPathsOutputWriter>(context, outputNodeMask, sourceNodeID_, info,
+            bfsGraph);
+    }
+
+private:
+    std::unique_ptr<ValueVector> costVector;
+};
+
+// All weighted shortest path algorithm. Paths are returned.
+class AllWeightedSPPathsAlgorithm : public RJAlgorithm {
+public:
+    std::string getFunctionName() const override { return AllWeightedSPPathsFunction::name; }
+
+    // return srcNodeID, dstNodeID, length, [direction], pathNodeIDs, pathEdgeIDs, weight
+    expression_vector getResultColumns(const RJBindData& bindData) const override {
+        expression_vector columns;
+        columns.push_back(bindData.nodeInput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.nodeOutput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.lengthExpr);
+        if (bindData.extendDirection == ExtendDirection::BOTH) {
+            columns.push_back(bindData.directionExpr);
+        }
+        columns.push_back(bindData.pathNodeIDsExpr);
+        columns.push_back(bindData.pathEdgeIDsExpr);
+        columns.push_back(bindData.weightOutputExpr);
+        return columns;
+    }
+
+    std::unique_ptr<RJAlgorithm> copy() const override {
+        return std::make_unique<AllWeightedSPPathsAlgorithm>(*this);
+    }
+
+private:
+    std::unique_ptr<GDSComputeState> getComputeState(ExecutionContext* context,
+        const RJBindData& bindData, RecursiveExtendSharedState* sharedState) override {
+        auto clientContext = context->clientContext;
+        auto mm = storage::MemoryManager::Get(*clientContext);
+        auto graph = sharedState->graph.get();
+        auto curDenseFrontier = DenseFrontier::getUninitializedFrontier(context, graph);
+        auto nextDenseFrontier = DenseFrontier::getUninitializedFrontier(context, graph);
+        auto frontierPair = std::make_unique<DenseSparseDynamicFrontierPair>(
+            std::move(curDenseFrontier), std::move(nextDenseFrontier));
+        auto bfsGraph = std::make_unique<BFSGraphManager>(
+            sharedState->graph->getMaxOffsetMap(transaction::Transaction::Get(*clientContext)), mm);
+        std::unique_ptr<GDSComputeState> gdsState;
+        WeightUtils::visit(AllWeightedSPPathsFunction::name,
+            bindData.weightPropertyExpr->getDataType(), [&]<typename T>(T) {
+                auto edgeCompute = std::make_unique<AWSPPathsEdgeCompute<T>>(bfsGraph.get());
+                auto auxiliaryState = std::make_unique<WSPPathsAuxiliaryState>(std::move(bfsGraph));
+                gdsState = std::make_unique<GDSComputeState>(std::move(frontierPair),
+                    std::move(edgeCompute), std::move(auxiliaryState));
+            });
+        return gdsState;
+    }
+
+    std::unique_ptr<RJOutputWriter> getOutputWriter(ExecutionContext* context,
+        const RJBindData& bindData, GDSComputeState& computeState, nodeID_t sourceNodeID,
+        RecursiveExtendSharedState* sharedState) override {
+        auto bfsGraph = computeState.auxiliaryState->ptrCast<WSPPathsAuxiliaryState>()
+                            ->getBFSGraphManager()
+                            ->getCurrentGraph();
+        auto writerInfo = bindData.getPathWriterInfo();
+        return std::make_unique<AWSPPathsOutputWriter>(context->clientContext,
+            sharedState->getOutputNodeMaskMap(), sourceNodeID, writerInfo, *bfsGraph);
+    }
+};
+
+std::unique_ptr<RJAlgorithm> AllWeightedSPPathsFunction::getAlgorithm() {
+    return std::make_unique<AllWeightedSPPathsAlgorithm>();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/bfs_graph.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/bfs_graph.cpp
new file mode 100644
index 0000000000..d588a3d154
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/bfs_graph.cpp
@@ -0,0 +1,276 @@
+#include "function/gds/bfs_graph.h"
+
+#include "function/gds/gds_utils.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::common;
+using namespace lbug::graph;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+static constexpr uint64_t BFS_GRAPH_BLOCK_SIZE = (std::uint64_t)1 << 19;
+
+ObjectBlock<ParentList>* BaseBFSGraph::addNewBlock() {
+    std::unique_lock lck{mtx};
+    auto memBlock = mm->allocateBuffer(false /* init to 0 */, BFS_GRAPH_BLOCK_SIZE);
+    blocks.push_back(
+        std::make_unique<ObjectBlock<ParentList>>(std::move(memBlock), BFS_GRAPH_BLOCK_SIZE));
+    return blocks[blocks.size() - 1].get();
+}
+
+class BFSGraphInitVertexCompute : public VertexCompute {
+public:
+    explicit BFSGraphInitVertexCompute(DenseBFSGraph& bfsGraph) : bfsGraph{bfsGraph} {}
+
+    bool beginOnTable(table_id_t tableID) override {
+        bfsGraph.pinTableID(tableID);
+        return true;
+    }
+
+    void vertexCompute(offset_t startOffset, offset_t endOffset, table_id_t) override {
+        for (auto i = startOffset; i < endOffset; ++i) {
+            bfsGraph.curData[i].store(nullptr);
+        }
+    }
+
+    std::unique_ptr<VertexCompute> copy() override {
+        return std::make_unique<BFSGraphInitVertexCompute>(bfsGraph);
+    }
+
+private:
+    DenseBFSGraph& bfsGraph;
+};
+
+void DenseBFSGraph::init(ExecutionContext* context, Graph* graph) {
+    auto mm = storage::MemoryManager::Get(*context->clientContext);
+    for (auto& [tableID, maxOffset] : maxOffsetMap) {
+        denseObjects.allocate(tableID, maxOffset, mm);
+    }
+    auto vc = std::make_unique<BFSGraphInitVertexCompute>(*this);
+    GDSUtils::runVertexCompute(context, GDSDensityState::DENSE, graph, *vc);
+}
+
+void DenseBFSGraph::pinTableID(table_id_t tableID) {
+    curData = denseObjects.getData(tableID);
+}
+
+static ParentList* reserveParent(nodeID_t boundNodeID, relID_t edgeID, bool fwdEdge,
+    ObjectBlock<ParentList>* block) {
+    auto parent = block->reserveNext();
+    parent->setNbrInfo(boundNodeID, edgeID, fwdEdge);
+    return parent;
+}
+
+void DenseBFSGraph::addParent(uint16_t iter, nodeID_t boundNodeID, relID_t edgeID,
+    nodeID_t nbrNodeID, bool fwdEdge, ObjectBlock<ParentList>* block) {
+    auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+    parent->setIter(iter);
+    // Since by default the parentPtr of each node is nullptr, that's what we start with.
+    ParentList* expected = nullptr;
+    while (!curData[nbrNodeID.offset].compare_exchange_strong(expected, parent)) {}
+    parent->setNextPtr(expected);
+}
+
+void DenseBFSGraph::addSingleParent(uint16_t iter, nodeID_t boundNodeID, relID_t edgeID,
+    nodeID_t nbrNodeID, bool fwdEdge, ObjectBlock<ParentList>* block) {
+    auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+    parent->setIter(iter);
+    ParentList* expected = nullptr;
+    if (curData[nbrNodeID.offset].compare_exchange_strong(expected, parent)) {
+        parent->setNextPtr(expected);
+    } else {
+        // Other thread has added the parent. Do NOT add parent and revert reserved slot.
+        block->revertLast();
+    }
+}
+
+static double getCost(ParentList* parentList) {
+    return parentList == nullptr ? std::numeric_limits<double>::max() : parentList->getCost();
+}
+
+bool DenseBFSGraph::tryAddParentWithWeight(nodeID_t boundNodeID, relID_t edgeID, nodeID_t nbrNodeID,
+    bool fwdEdge, double weight, ObjectBlock<ParentList>* block) {
+    ParentList* expected = getParentListHead(nbrNodeID.offset);
+    auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+    parent->setCost(getParentListHead(boundNodeID)->getCost() + weight);
+    while (true) {
+        if (parent->getCost() < getCost(expected)) {
+            // New parent has smaller cost, erase all existing parents and add new parent.
+            if (curData[nbrNodeID.offset].compare_exchange_strong(expected, parent)) {
+                parent->setNextPtr(nullptr);
+                return true;
+            }
+        } else if (parent->getCost() == getCost(expected) && expected->getEdgeID() != edgeID) {
+            // New parent has the same cost and comes from different edge,
+            // append new parent as after existing parents.
+            if (curData[nbrNodeID.offset].compare_exchange_strong(expected, parent)) {
+                parent->setNextPtr(expected);
+                return true;
+            }
+        } else {
+            block->revertLast();
+            return false;
+        }
+    }
+}
+
+bool DenseBFSGraph::tryAddSingleParentWithWeight(nodeID_t boundNodeID, relID_t edgeID,
+    nodeID_t nbrNodeID, bool fwdEdge, double weight, ObjectBlock<ParentList>* block) {
+    ParentList* expected = getParentListHead(nbrNodeID.offset);
+    auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+    parent->setCost(getParentListHead(boundNodeID)->getCost() + weight);
+    while (parent->getCost() < getCost(expected)) {
+        if (curData[nbrNodeID.offset].compare_exchange_strong(expected, parent)) {
+            // Since each node can have one parent, set next ptr to nullptr.
+            parent->setNextPtr(nullptr);
+            return true;
+        }
+    }
+    // Other thread has added the parent. Do NOT add parent and revert reserved slot.
+    block->revertLast();
+    return false;
+}
+
+ParentList* DenseBFSGraph::getParentListHead(offset_t offset) {
+    KU_ASSERT(curData);
+    return curData[offset].load(std::memory_order_relaxed);
+}
+
+ParentList* DenseBFSGraph::getParentListHead(nodeID_t nodeID) {
+    return denseObjects.getData(nodeID.tableID)[nodeID.offset].load(std::memory_order_relaxed);
+}
+
+void DenseBFSGraph::setParentList(offset_t offset, ParentList* parentList) {
+    KU_ASSERT(curData && getParentListHead(offset) == nullptr);
+    curData[offset].store(parentList, std::memory_order_relaxed);
+}
+
+void SparseBFSGraph::pinTableID(table_id_t tableID) {
+    curData = sparseObjects.getData(tableID);
+}
+
+void SparseBFSGraph::addParent(uint16_t iter, nodeID_t boundNodeID, relID_t edgeID,
+    nodeID_t nbrNodeID, bool fwdEdge, ObjectBlock<ParentList>* block) {
+    auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+    parent->setIter(iter);
+    if (curData->contains(nbrNodeID.offset)) {
+        parent->setNextPtr(curData->at(nbrNodeID.offset));
+        curData->at(nbrNodeID.offset) = parent;
+    } else {
+        parent->setNextPtr(nullptr);
+        curData->insert({nbrNodeID.offset, parent});
+    }
+}
+
+void SparseBFSGraph::addSingleParent(uint16_t iter, nodeID_t boundNodeID, relID_t edgeID,
+    nodeID_t nbrNodeID, bool fwdEdge, ObjectBlock<ParentList>* block) {
+    if (curData->contains(nbrNodeID.offset)) {
+        return;
+    }
+    auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+    parent->setIter(iter);
+    parent->setNextPtr(nullptr);
+    curData->insert({nbrNodeID.offset, parent});
+}
+
+bool SparseBFSGraph::tryAddParentWithWeight(nodeID_t boundNodeID, relID_t edgeID,
+    nodeID_t nbrNodeID, bool fwdEdge, double weight, ObjectBlock<ParentList>* block) {
+    auto nbrParent = getParentListHead(nbrNodeID.offset);
+    auto nbrCost = getCost(nbrParent);
+    auto newCost = getParentListHead(boundNodeID)->getCost() + weight;
+    if (newCost < nbrCost) {
+        auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+        parent->setCost(newCost);
+        parent->setNextPtr(nullptr);
+        curData->erase(nbrNodeID.offset);
+        curData->insert({nbrNodeID.offset, parent});
+        return true;
+    }
+    // Append parent if newCost is the same as old cost. And the newCost comes from a different edge
+    // Otherwise, for cases like A->B->C, A->D->C, C->E. If ABD and ADC has the same cost, we will
+    // visit twice to E with the same cost and same edge.
+    if (newCost == nbrCost && nbrParent->getEdgeID() != edgeID) {
+        auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+        parent->setCost(newCost);
+        if (curData->contains(nbrNodeID.offset)) {
+            parent->setNextPtr(curData->at(nbrNodeID.offset));
+            curData->erase(nbrNodeID.offset);
+        } else {
+            parent->setNextPtr(nullptr);
+        }
+        curData->insert({nbrNodeID.offset, parent});
+        return true;
+    }
+    return false;
+}
+
+bool SparseBFSGraph::tryAddSingleParentWithWeight(nodeID_t boundNodeID, relID_t edgeID,
+    nodeID_t nbrNodeID, bool fwdEdge, double weight, ObjectBlock<ParentList>* block) {
+    auto nbrCost = getCost(getParentListHead(nbrNodeID.offset));
+    auto newCost = getParentListHead(boundNodeID)->getCost() + weight;
+    if (newCost < nbrCost) {
+        auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+        parent->setCost(newCost);
+        parent->setNextPtr(nullptr);
+        curData->erase(nbrNodeID.offset);
+        curData->insert({nbrNodeID.offset, parent});
+        return true;
+    }
+    if (newCost == nbrCost) {
+        if (curData->contains(nbrNodeID.offset)) {
+            return false;
+        }
+        auto parent = reserveParent(boundNodeID, edgeID, fwdEdge, block);
+        parent->setCost(newCost);
+        parent->setNextPtr(nullptr);
+        curData->insert({nbrNodeID.offset, parent});
+    }
+    return false;
+}
+
+ParentList* SparseBFSGraph::getParentListHead(offset_t offset) {
+    KU_ASSERT(curData);
+    if (!curData->contains(offset)) {
+        return nullptr;
+    }
+    return curData->at(offset);
+}
+
+ParentList* SparseBFSGraph::getParentListHead(nodeID_t nodeID) {
+    auto data = sparseObjects.getData(nodeID.tableID);
+    if (!data->contains(nodeID.offset)) {
+        return nullptr;
+    }
+    return data->at(nodeID.offset);
+}
+
+void SparseBFSGraph::setParentList(offset_t offset, ParentList* parentList) {
+    KU_ASSERT(!curData->contains(offset));
+    curData->insert({offset, parentList});
+}
+
+BFSGraphManager::BFSGraphManager(table_id_map_t<offset_t> maxOffsetMap,
+    storage::MemoryManager* mm) {
+    denseBFSGraph = std::make_unique<DenseBFSGraph>(mm, maxOffsetMap);
+    sparseBFSGraph = std::make_unique<SparseBFSGraph>(mm, maxOffsetMap);
+    curGraph = sparseBFSGraph.get();
+}
+
+void BFSGraphManager::switchToDense(ExecutionContext* context, Graph* graph) {
+    KU_ASSERT(state == GDSDensityState::SPARSE);
+    state = GDSDensityState::DENSE;
+    denseBFSGraph->init(context, graph);
+    denseBFSGraph->blocks = std::move(sparseBFSGraph->blocks);
+    for (auto& [tableID, map] : sparseBFSGraph->sparseObjects.getData()) {
+        denseBFSGraph->pinTableID(tableID);
+        for (auto& [offset, ptr] : map) {
+            denseBFSGraph->setParentList(offset, ptr);
+        }
+    }
+    curGraph = denseBFSGraph.get();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/frontier_morsel.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/frontier_morsel.cpp
new file mode 100644
index 0000000000..2243446117
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/frontier_morsel.cpp
@@ -0,0 +1,35 @@
+#include "function/gds/frontier_morsel.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+FrontierMorselDispatcher::FrontierMorselDispatcher(uint64_t maxThreads)
+    : maxOffset{INVALID_OFFSET}, maxThreads{maxThreads}, morselSize(UINT64_MAX) {
+    nextOffset.store(INVALID_OFFSET);
+}
+
+void FrontierMorselDispatcher::init(offset_t _maxOffset) {
+    maxOffset = _maxOffset;
+    nextOffset.store(0u);
+    // Frontier size calculation: The ideal scenario is to have k^2 many morsels where k
+    // the number of maximum threads that could be working on this frontier. However, if
+    // that is too small then we default to MIN_FRONTIER_MORSEL_SIZE.
+    auto idealMorselSize =
+        maxOffset / std::max(MIN_NUMBER_OF_FRONTIER_MORSELS, maxThreads * maxThreads);
+    morselSize = std::max(MIN_FRONTIER_MORSEL_SIZE, idealMorselSize);
+}
+
+bool FrontierMorselDispatcher::getNextRangeMorsel(FrontierMorsel& frontierMorsel) {
+    auto beginOffset = nextOffset.fetch_add(morselSize, std::memory_order_acq_rel);
+    if (beginOffset >= maxOffset) {
+        return false;
+    }
+    auto endOffset = beginOffset + morselSize > maxOffset ? maxOffset : beginOffset + morselSize;
+    frontierMorsel.init(beginOffset, endOffset);
+    return true;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds.cpp
new file mode 100644
index 0000000000..0266bae691
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds.cpp
@@ -0,0 +1,281 @@
+#include "function/gds/gds.h"
+
+#include "binder/binder.h"
+#include "binder/expression/rel_expression.h"
+#include "binder/query/reading_clause/bound_table_function_call.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "function/table/bind_input.h"
+#include "graph/graph_entry_set.h"
+#include "graph/on_disk_graph.h"
+#include "parser/parser.h"
+#include "planner/operator/logical_table_function_call.h"
+#include "planner/operator/sip/logical_semi_masker.h"
+#include "planner/planner.h"
+#include "processor/operator/table_function_call.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::binder;
+using namespace lbug::main;
+using namespace lbug::graph;
+using namespace lbug::processor;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace function {
+
+void GDSFuncSharedState::setGraphNodeMask(std::unique_ptr<NodeOffsetMaskMap> maskMap) {
+    auto onDiskGraph = ku_dynamic_cast<OnDiskGraph*>(graph.get());
+    onDiskGraph->setNodeOffsetMask(maskMap.get());
+    graphNodeMask = std::move(maskMap);
+}
+
+static expression_vector getResultColumns(const std::string& cypher, ClientContext* context) {
+    auto parsedStatements = parser::Parser::parseQuery(cypher);
+    KU_ASSERT(parsedStatements.size() == 1);
+    auto binder = Binder(context);
+    auto boundStatement = binder.bind(*parsedStatements[0]);
+    return boundStatement->getStatementResult()->getColumns();
+}
+
+static void validateNodeProjected(const table_id_set_t& connectedNodeTableIDSet,
+    const table_id_set_t& projectedNodeIDSet, const std::string& relName, Catalog* catalog,
+    transaction::Transaction* transaction) {
+    for (auto id : connectedNodeTableIDSet) {
+        if (!projectedNodeIDSet.contains(id)) {
+            auto entryName = catalog->getTableCatalogEntry(transaction, id)->getName();
+            throw BinderException(
+                stringFormat("{} is connected to {} but not projected.", entryName, relName));
+        }
+    }
+}
+
+static void validateRelSrcDstNodeAreProjected(const TableCatalogEntry& entry,
+    const table_id_set_t& projectedNodeIDSet, Catalog* catalog,
+    transaction::Transaction* transaction) {
+    auto& relEntry = entry.constCast<RelGroupCatalogEntry>();
+    validateNodeProjected(relEntry.getSrcNodeTableIDSet(), projectedNodeIDSet, relEntry.getName(),
+        catalog, transaction);
+    validateNodeProjected(relEntry.getDstNodeTableIDSet(), projectedNodeIDSet, relEntry.getName(),
+        catalog, transaction);
+}
+
+NativeGraphEntry GDSFunction::bindGraphEntry(ClientContext& context, const std::string& name) {
+    auto set = GraphEntrySet::Get(context);
+    set->validateGraphExist(name);
+    auto entry = set->getEntry(name);
+    if (entry->type != GraphEntryType::NATIVE) {
+        throw BinderException("AA");
+    }
+    return bindGraphEntry(context, entry->cast<ParsedNativeGraphEntry>());
+}
+
+static NativeGraphEntryTableInfo bindNodeEntry(ClientContext& context, const std::string& tableName,
+    const std::string& predicate) {
+    auto catalog = Catalog::Get(context);
+    auto transaction = transaction::Transaction::Get(context);
+    auto nodeEntry = catalog->getTableCatalogEntry(transaction, tableName);
+    if (nodeEntry->getType() != CatalogEntryType::NODE_TABLE_ENTRY) {
+        throw BinderException(stringFormat("{} is not a NODE table.", tableName));
+    }
+    if (!predicate.empty()) {
+        auto cypher = stringFormat("MATCH (n:`{}`) RETURN n, {}", nodeEntry->getName(), predicate);
+        auto columns = getResultColumns(cypher, &context);
+        KU_ASSERT(columns.size() == 2);
+        return {nodeEntry, columns[0], columns[1]};
+    } else {
+        auto cypher = stringFormat("MATCH (n:`{}`) RETURN n", nodeEntry->getName());
+        auto columns = getResultColumns(cypher, &context);
+        KU_ASSERT(columns.size() == 1);
+        return {nodeEntry, columns[0], nullptr /* empty predicate */};
+    }
+}
+
+static NativeGraphEntryTableInfo bindRelEntry(ClientContext& context, const std::string& tableName,
+    const std::string& predicate) {
+    auto catalog = Catalog::Get(context);
+    auto transaction = transaction::Transaction::Get(context);
+    auto relEntry = catalog->getTableCatalogEntry(transaction, tableName);
+    if (relEntry->getType() != CatalogEntryType::REL_GROUP_ENTRY) {
+        throw BinderException(
+            stringFormat("{} has catalog entry type. REL entry was expected.", tableName));
+    }
+    if (!predicate.empty()) {
+        auto cypher =
+            stringFormat("MATCH ()-[r:`{}`]->() RETURN r, {}", relEntry->getName(), predicate);
+        auto columns = getResultColumns(cypher, &context);
+        KU_ASSERT(columns.size() == 2);
+        return {relEntry, columns[0], columns[1]};
+    } else {
+        auto cypher = stringFormat("MATCH ()-[r:`{}`]->() RETURN r", relEntry->getName());
+        auto columns = getResultColumns(cypher, &context);
+        KU_ASSERT(columns.size() == 1);
+        return {relEntry, columns[0], nullptr /* empty predicate */};
+    }
+}
+
+NativeGraphEntry GDSFunction::bindGraphEntry(ClientContext& context,
+    const ParsedNativeGraphEntry& entry) {
+    auto catalog = Catalog::Get(context);
+    auto transaction = transaction::Transaction::Get(context);
+    auto result = NativeGraphEntry();
+    table_id_set_t projectedNodeTableIDSet;
+    for (auto& nodeInfo : entry.nodeInfos) {
+        auto boundInfo = bindNodeEntry(context, nodeInfo.tableName, nodeInfo.predicate);
+        projectedNodeTableIDSet.insert(boundInfo.entry->getTableID());
+        result.nodeInfos.push_back(std::move(boundInfo));
+    }
+    for (auto& relInfo : entry.relInfos) {
+        if (catalog->containsTable(transaction, relInfo.tableName)) {
+            auto boundInfo = bindRelEntry(context, relInfo.tableName, relInfo.predicate);
+            validateRelSrcDstNodeAreProjected(*boundInfo.entry, projectedNodeTableIDSet, catalog,
+                transaction);
+            result.relInfos.push_back(std::move(boundInfo));
+        } else {
+            throw BinderException(stringFormat("{} is not a REL table.", relInfo.tableName));
+        }
+    }
+    return result;
+}
+
+std::shared_ptr<binder::Expression> GDSFunction::bindRelOutput(const TableFuncBindInput& bindInput,
+    const std::vector<catalog::TableCatalogEntry*>& relEntries,
+    std::shared_ptr<NodeExpression> srcNode, std::shared_ptr<NodeExpression> dstNode,
+    const std::optional<std::string>& name, const std::optional<uint64_t>& yieldVariableIdx) {
+    std::string relColumnName = name.value_or(REL_COLUMN_NAME);
+    StringUtils::toLower(relColumnName);
+    if (!bindInput.yieldVariables.empty()) {
+        relColumnName =
+            bindColumnName(bindInput.yieldVariables[yieldVariableIdx.value_or(0)], relColumnName);
+    }
+    auto rel = bindInput.binder->createNonRecursiveQueryRel(relColumnName, relEntries, srcNode,
+        dstNode, RelDirectionType::SINGLE);
+    bindInput.binder->addToScope(REL_COLUMN_NAME, rel);
+    return rel;
+}
+
+std::shared_ptr<Expression> GDSFunction::bindNodeOutput(const TableFuncBindInput& bindInput,
+    const std::vector<TableCatalogEntry*>& nodeEntries, const std::optional<std::string>& name,
+    const std::optional<uint64_t>& yieldVariableIdx) {
+    std::string nodeColumnName = name.value_or(NODE_COLUMN_NAME);
+    StringUtils::toLower(nodeColumnName);
+    if (!bindInput.yieldVariables.empty()) {
+        nodeColumnName =
+            bindColumnName(bindInput.yieldVariables[yieldVariableIdx.value_or(0)], nodeColumnName);
+    }
+    auto node = bindInput.binder->createQueryNode(nodeColumnName, nodeEntries);
+    bindInput.binder->addToScope(nodeColumnName, node);
+    return node;
+}
+
+std::string GDSFunction::bindColumnName(const parser::YieldVariable& yieldVariable,
+    std::string expressionName) {
+    if (yieldVariable.name != expressionName) {
+        throw common::BinderException{
+            common::stringFormat("Unknown variable name: {}.", yieldVariable.name)};
+    }
+    if (yieldVariable.hasAlias()) {
+        return yieldVariable.alias;
+    }
+    return expressionName;
+}
+
+std::unique_ptr<TableFuncSharedState> GDSFunction::initSharedState(
+    const TableFuncInitSharedStateInput& input) {
+    auto bindData = input.bindData->constPtrCast<GDSBindData>();
+    auto graph =
+        std::make_unique<OnDiskGraph>(input.context->clientContext, bindData->graphEntry.copy());
+    return std::make_unique<GDSFuncSharedState>(bindData->getResultTable(), std::move(graph));
+}
+
+std::vector<std::shared_ptr<LogicalOperator>> getNodeMaskPlanRoots(const GDSBindData& bindData,
+    Planner* planner) {
+    std::vector<std::shared_ptr<LogicalOperator>> nodeMaskPlanRoots;
+    for (auto& nodeInfo : bindData.graphEntry.nodeInfos) {
+        if (nodeInfo.predicate == nullptr) {
+            continue;
+        }
+        auto& node = nodeInfo.nodeOrRel->constCast<NodeExpression>();
+        planner->getCardinliatyEstimatorUnsafe().init(node);
+        auto p = planner->getNodeSemiMaskPlan(SemiMaskTargetType::GDS_GRAPH_NODE, node,
+            nodeInfo.predicate);
+        nodeMaskPlanRoots.push_back(p.getLastOperator());
+    }
+    return nodeMaskPlanRoots;
+};
+
+void GDSFunction::getLogicalPlan(Planner* planner, const BoundReadingClause& readingClause,
+    expression_vector predicates, LogicalPlan& plan) {
+    auto& call = readingClause.constCast<BoundTableFunctionCall>();
+    auto bindData = call.getBindData()->constPtrCast<GDSBindData>();
+    auto op = std::make_shared<LogicalTableFunctionCall>(call.getTableFunc(), bindData->copy());
+    for (auto root : getNodeMaskPlanRoots(*bindData, planner)) {
+        op->addChild(root);
+    }
+    op->computeFactorizedSchema();
+    planner->planReadOp(std::move(op), predicates, plan);
+
+    auto nodeOutput = bindData->output[0]->ptrCast<NodeExpression>();
+    KU_ASSERT(nodeOutput != nullptr);
+    planner->getCardinliatyEstimatorUnsafe().init(*nodeOutput);
+    auto scanPlan = planner->getNodePropertyScanPlan(*nodeOutput);
+    if (scanPlan.isEmpty()) {
+        return;
+    }
+    expression_vector joinConditions;
+    joinConditions.push_back(nodeOutput->getInternalID());
+    planner->appendHashJoin(joinConditions, JoinType::INNER, plan, scanPlan, plan);
+}
+
+std::unique_ptr<PhysicalOperator> GDSFunction::getPhysicalPlan(PlanMapper* planMapper,
+    const LogicalOperator* logicalOp) {
+    auto logicalCall = logicalOp->constPtrCast<LogicalTableFunctionCall>();
+    auto bindData = logicalCall->getBindData()->copy();
+    auto columns = bindData->columns;
+    auto tableSchema = PlanMapper::createFlatFTableSchema(columns, *logicalCall->getSchema());
+    auto table = std::make_shared<FactorizedTable>(
+        storage::MemoryManager::Get(*planMapper->clientContext), tableSchema.copy());
+    bindData->cast<GDSBindData>().setResultFTable(table);
+    auto info = TableFunctionCallInfo();
+    info.function = logicalCall->getTableFunc();
+    info.bindData = std::move(bindData);
+    auto initInput =
+        TableFuncInitSharedStateInput(info.bindData.get(), planMapper->executionContext);
+    auto sharedState = info.function.initSharedStateFunc(initInput);
+    auto printInfo =
+        std::make_unique<TableFunctionCallPrintInfo>(info.function.name, info.bindData->columns);
+    auto call = std::make_unique<TableFunctionCall>(std::move(info), sharedState,
+        planMapper->getOperatorID(), std::move(printInfo));
+    if (logicalCall->getNumChildren() > 0u) {
+        const auto funcSharedState = sharedState->ptrCast<GDSFuncSharedState>();
+        funcSharedState->setGraphNodeMask(std::make_unique<NodeOffsetMaskMap>());
+        auto maskMap = funcSharedState->getGraphNodeMaskMap();
+        planMapper->addOperatorMapping(logicalOp, call.get());
+        for (auto logicalRoot : logicalCall->getChildren()) {
+            KU_ASSERT(logicalRoot->getNumChildren() == 1);
+            auto child = logicalRoot->getChild(0);
+            KU_ASSERT(child->getOperatorType() == LogicalOperatorType::SEMI_MASKER);
+            auto logicalSemiMasker = child->ptrCast<LogicalSemiMasker>();
+            logicalSemiMasker->addTarget(logicalOp);
+            for (auto tableID : logicalSemiMasker->getNodeTableIDs()) {
+                maskMap->addMask(tableID, planMapper->createSemiMask(tableID));
+            }
+            auto root = planMapper->mapOperator(logicalRoot.get());
+            call->addChild(std::move(root));
+        }
+        planMapper->eraseOperatorMapping(logicalOp);
+    }
+    planMapper->addOperatorMapping(logicalOp, call.get());
+    physical_op_vector_t children;
+    auto dummySink = std::make_unique<DummySink>(std::move(call), planMapper->getOperatorID());
+    dummySink->setDescriptor(std::make_unique<ResultSetDescriptor>(logicalCall->getSchema()));
+    children.push_back(std::move(dummySink));
+    return planMapper->createFTableScanAligned(columns, logicalCall->getSchema(), table,
+        DEFAULT_VECTOR_CAPACITY, std::move(children));
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_frontier.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_frontier.cpp
new file mode 100644
index 0000000000..4aae9bacd2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_frontier.cpp
@@ -0,0 +1,423 @@
+#include "function/gds/gds_frontier.h"
+
+#include "function/gds/gds_utils.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::graph;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+void SparseFrontier::pinTableID(table_id_t tableID) {
+    curData = sparseObjects.getData(tableID);
+}
+
+void SparseFrontier::addNode(nodeID_t nodeID, iteration_t iter) {
+    KU_ASSERT(curData);
+    addNode(nodeID.offset, iter);
+}
+
+void SparseFrontier::addNode(offset_t offset, iteration_t iter) {
+    KU_ASSERT(curData);
+    if (!curData->contains(offset)) {
+        curData->insert({offset, iter});
+    } else {
+        curData->at(offset) = iter;
+    }
+}
+
+void SparseFrontier::addNodes(const std::vector<nodeID_t>& nodeIDs, iteration_t iter) {
+    KU_ASSERT(curData);
+    for (auto& nodeID : nodeIDs) {
+        addNode(nodeID.offset, iter);
+    }
+}
+
+iteration_t SparseFrontier::getIteration(offset_t offset) const {
+    KU_ASSERT(curData);
+    if (!curData->contains(offset)) {
+        return FRONTIER_UNVISITED;
+    }
+    return curData->at(offset);
+}
+
+void SparseFrontierReference::pinTableID(table_id_t tableID) {
+    curData = sparseObjects.getData(tableID);
+}
+
+void SparseFrontierReference::addNode(offset_t offset, iteration_t iter) {
+    KU_ASSERT(curData);
+    if (!curData->contains(offset)) {
+        curData->insert({offset, iter});
+    } else {
+        curData->at(offset) = iter;
+    }
+}
+
+void SparseFrontierReference::addNode(nodeID_t nodeID, iteration_t iter) {
+    KU_ASSERT(curData);
+    addNode(nodeID.offset, iter);
+}
+
+void SparseFrontierReference::addNodes(const std::vector<nodeID_t>& nodeIDs, iteration_t iter) {
+    KU_ASSERT(curData);
+    for (auto nodeID : nodeIDs) {
+        addNode(nodeID.offset, iter);
+    }
+}
+
+iteration_t SparseFrontierReference::getIteration(offset_t offset) const {
+    KU_ASSERT(curData);
+    if (!curData->contains(offset)) {
+        return FRONTIER_UNVISITED;
+    }
+    return curData->at(offset);
+}
+
+class DenseFrontierInitVertexCompute : public VertexCompute {
+public:
+    DenseFrontierInitVertexCompute(DenseFrontier& frontier, iteration_t val)
+        : frontier{frontier}, val{val} {}
+
+    bool beginOnTable(table_id_t tableID) override {
+        frontier.pinTableID(tableID);
+        return true;
+    }
+
+    void vertexCompute(offset_t startOffset, offset_t endOffset, table_id_t) override {
+        for (auto i = startOffset; i < endOffset; ++i) {
+            frontier.addNode(i, val);
+        }
+    }
+
+    std::unique_ptr<VertexCompute> copy() override {
+        return std::make_unique<DenseFrontierInitVertexCompute>(frontier, val);
+    }
+
+private:
+    DenseFrontier& frontier;
+    iteration_t val;
+};
+
+void DenseFrontier::init(ExecutionContext* context, Graph* graph, iteration_t val) {
+    auto mm = storage::MemoryManager::Get(*context->clientContext);
+    for (const auto& [tableID, maxOffset] : nodeMaxOffsetMap) {
+        denseObjects.allocate(tableID, maxOffset, mm);
+    }
+    resetValue(context, graph, val);
+}
+
+void DenseFrontier::resetValue(ExecutionContext* context, Graph* graph, iteration_t val) {
+    auto vc = DenseFrontierInitVertexCompute(*this, val);
+    GDSUtils::runVertexCompute(context, GDSDensityState::DENSE, graph, vc);
+}
+
+void DenseFrontier::pinTableID(table_id_t tableID) {
+    curData = denseObjects.getData(tableID);
+}
+
+void DenseFrontier::addNode(nodeID_t nodeID, iteration_t iter) {
+    KU_ASSERT(curData);
+    curData[nodeID.offset].store(iter, std::memory_order_relaxed);
+}
+
+void DenseFrontier::addNode(offset_t offset, iteration_t iter) {
+    KU_ASSERT(curData);
+    curData[offset].store(iter, std::memory_order_relaxed);
+}
+
+void DenseFrontier::addNodes(const std::vector<nodeID_t>& nodeIDs, iteration_t iter) {
+    KU_ASSERT(curData);
+    for (auto nodeID : nodeIDs) {
+        curData[nodeID.offset].store(iter, std::memory_order_relaxed);
+    }
+}
+
+iteration_t DenseFrontier::getIteration(offset_t offset) const {
+    KU_ASSERT(curData);
+    return curData[offset].load(std::memory_order_relaxed);
+}
+
+std::unique_ptr<DenseFrontier> DenseFrontier::getUninitializedFrontier(ExecutionContext* context,
+    Graph* graph) {
+    auto transaction = transaction::Transaction::Get(*context->clientContext);
+    return std::make_unique<DenseFrontier>(graph->getMaxOffsetMap(transaction));
+}
+
+std::unique_ptr<DenseFrontier> DenseFrontier::getUnvisitedFrontier(ExecutionContext* context,
+    Graph* graph) {
+    auto transaction = transaction::Transaction::Get(*context->clientContext);
+    auto frontier = std::make_unique<DenseFrontier>(graph->getMaxOffsetMap(transaction));
+    frontier->init(context, graph, FRONTIER_UNVISITED);
+    return frontier;
+}
+
+std::unique_ptr<DenseFrontier> DenseFrontier::getVisitedFrontier(ExecutionContext* context,
+    Graph* graph) {
+    auto transaction = transaction::Transaction::Get(*context->clientContext);
+    auto frontier = std::make_unique<DenseFrontier>(graph->getMaxOffsetMap(transaction));
+    frontier->init(context, graph, FRONTIER_INITIAL_VISITED);
+    return frontier;
+}
+
+std::unique_ptr<DenseFrontier> DenseFrontier::getVisitedFrontier(ExecutionContext* context,
+    Graph* graph, NodeOffsetMaskMap* maskMap) {
+    if (maskMap == nullptr) {
+        return getVisitedFrontier(context, graph);
+    }
+    auto transaction = transaction::Transaction::Get(*context->clientContext);
+    auto frontier = std::make_unique<DenseFrontier>(graph->getMaxOffsetMap(transaction));
+    frontier->init(context, graph, FRONTIER_INITIAL_VISITED);
+    for (auto [tableID, numNodes] : graph->getMaxOffsetMap(transaction)) {
+        frontier->pinTableID(tableID);
+        if (maskMap->containsTableID(tableID)) {
+            auto mask = maskMap->getOffsetMask(tableID);
+            for (auto i = 0u; i < numNodes; ++i) {
+                if (!mask->isMasked(i)) {
+                    frontier->curData[i].store(FRONTIER_UNVISITED);
+                }
+            }
+        }
+    }
+    return frontier;
+}
+
+void DenseFrontierReference::pinTableID(table_id_t tableID) {
+    curData = denseObjects.getData(tableID);
+}
+
+void DenseFrontierReference::addNode(nodeID_t nodeID, iteration_t iter) {
+    KU_ASSERT(curData);
+    curData[nodeID.offset].store(iter, std::memory_order_relaxed);
+}
+
+void DenseFrontierReference::addNode(offset_t offset, iteration_t iter) {
+    KU_ASSERT(curData);
+    curData[offset].store(iter, std::memory_order_relaxed);
+}
+
+void DenseFrontierReference::addNodes(const std::vector<nodeID_t>& nodeIDs, iteration_t iter) {
+    KU_ASSERT(curData);
+    for (auto nodeID : nodeIDs) {
+        curData[nodeID.offset].store(iter, std::memory_order_relaxed);
+    }
+}
+
+iteration_t DenseFrontierReference::getIteration(offset_t offset) const {
+    KU_ASSERT(curData);
+    return curData[offset].load(std::memory_order_relaxed);
+}
+
+void FrontierPair::beginNewIteration() {
+    std::unique_lock<std::mutex> lck{mtx};
+    curIter++;
+    hasActiveNodesForNextIter_.store(false);
+    beginNewIterationInternalNoLock();
+}
+
+void FrontierPair::beginFrontierComputeBetweenTables(table_id_t curTableID,
+    table_id_t nextTableID) {
+    pinCurrentFrontier(curTableID);
+    pinNextFrontier(nextTableID);
+}
+
+void FrontierPair::pinCurrentFrontier(table_id_t tableID) {
+    currentFrontier->pinTableID(tableID);
+}
+
+void FrontierPair::pinNextFrontier(table_id_t tableID) {
+    nextFrontier->pinTableID(tableID);
+}
+
+void FrontierPair::addNodeToNextFrontier(nodeID_t nodeID) {
+    nextFrontier->addNode(nodeID, curIter);
+}
+
+void FrontierPair::addNodeToNextFrontier(offset_t offset) {
+    nextFrontier->addNode(offset, curIter);
+}
+
+void FrontierPair::addNodesToNextFrontier(const std::vector<nodeID_t>& nodeIDs) {
+    nextFrontier->addNodes(nodeIDs, curIter);
+}
+
+iteration_t FrontierPair::getNextFrontierValue(offset_t offset) {
+    return nextFrontier->getIteration(offset);
+}
+
+bool FrontierPair::isActiveOnCurrentFrontier(offset_t offset) {
+    return currentFrontier->getIteration(offset) == curIter - 1;
+}
+
+Frontier* SPFrontierPair::getFrontier() {
+    switch (state) {
+    case GDSDensityState::SPARSE: {
+        return sparseFrontier.get();
+    }
+    case GDSDensityState::DENSE: {
+        return denseFrontier.get();
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+SPFrontierPair::SPFrontierPair(std::unique_ptr<DenseFrontier> denseFrontier)
+    : state{GDSDensityState::SPARSE}, denseFrontier{std::move(denseFrontier)} {
+    curDenseFrontier = std::make_unique<DenseFrontierReference>(*this->denseFrontier);
+    nextDenseFrontier = std::make_unique<DenseFrontierReference>(*this->denseFrontier);
+    sparseFrontier = std::make_unique<SparseFrontier>(this->denseFrontier->nodeMaxOffsetMap);
+    curSparseFrontier = std::make_unique<SparseFrontierReference>(*this->sparseFrontier);
+    nextSparseFrontier = std::make_unique<SparseFrontierReference>(*this->sparseFrontier);
+    currentFrontier = curSparseFrontier.get();
+    nextFrontier = nextSparseFrontier.get();
+}
+
+void SPFrontierPair::beginNewIterationInternalNoLock() {
+    switch (state) {
+    case GDSDensityState::SPARSE: {
+        std::swap(curSparseFrontier, nextSparseFrontier);
+        currentFrontier = curSparseFrontier.get();
+        nextFrontier = nextSparseFrontier.get();
+    } break;
+    case GDSDensityState::DENSE: {
+        std::swap(curDenseFrontier, nextDenseFrontier);
+        currentFrontier = curDenseFrontier.get();
+        nextFrontier = nextDenseFrontier.get();
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+offset_t SPFrontierPair::getNumActiveNodesInCurrentFrontier(NodeOffsetMaskMap& mask) {
+    auto result = 0u;
+    for (auto& [tableID, maxNumNodes] : denseFrontier->nodeMaxOffsetMap) {
+        currentFrontier->pinTableID(tableID);
+        if (!mask.containsTableID(tableID)) {
+            continue;
+        }
+        auto offsetMask = mask.getOffsetMask(tableID);
+        for (auto offset = 0u; offset < maxNumNodes; ++offset) {
+            if (isActiveOnCurrentFrontier(offset)) {
+                result += offsetMask->isMasked(offset);
+            }
+        }
+    }
+    return result;
+}
+
+std::unordered_set<offset_t> SPFrontierPair::getActiveNodesOnCurrentFrontier() {
+    KU_ASSERT(state == GDSDensityState::SPARSE);
+    std::unordered_set<offset_t> result;
+    for (auto& [offset, iter] : curSparseFrontier->getCurrentData()) {
+        if (iter != curIter - 1) {
+            continue;
+        }
+        result.insert(offset);
+    }
+    return result;
+}
+
+void SPFrontierPair::switchToDense(ExecutionContext* context, graph::Graph* graph) {
+    KU_ASSERT(state == GDSDensityState::SPARSE);
+    state = GDSDensityState::DENSE;
+    denseFrontier->init(context, graph, FRONTIER_UNVISITED);
+    for (auto& [tableID, map] : sparseFrontier->sparseObjects.getData()) {
+        nextDenseFrontier->pinTableID(tableID);
+        for (auto [offset, iter] : map) {
+            nextDenseFrontier->curData[offset].store(iter);
+        }
+    }
+}
+
+DenseSparseDynamicFrontierPair::DenseSparseDynamicFrontierPair(
+    std::unique_ptr<DenseFrontier> curDenseFrontier,
+    std::unique_ptr<DenseFrontier> nextDenseFrontier)
+    : state{GDSDensityState::SPARSE}, curDenseFrontier{std::move(curDenseFrontier)},
+      nextDenseFrontier{std::move(nextDenseFrontier)} {
+    curSparseFrontier = std::make_unique<SparseFrontier>(this->curDenseFrontier->nodeMaxOffsetMap);
+    nextSparseFrontier =
+        std::make_unique<SparseFrontier>(this->nextDenseFrontier->nodeMaxOffsetMap);
+    currentFrontier = curSparseFrontier.get();
+    nextFrontier = nextSparseFrontier.get();
+}
+
+void DenseSparseDynamicFrontierPair::beginNewIterationInternalNoLock() {
+    switch (state) {
+    case GDSDensityState::SPARSE: {
+        std::swap(curSparseFrontier, nextSparseFrontier);
+        currentFrontier = curSparseFrontier.get();
+        nextFrontier = nextSparseFrontier.get();
+    } break;
+    case GDSDensityState::DENSE: {
+        std::swap(curDenseFrontier, nextDenseFrontier);
+        currentFrontier = curDenseFrontier.get();
+        nextFrontier = nextDenseFrontier.get();
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::unordered_set<offset_t> DenseSparseDynamicFrontierPair::getActiveNodesOnCurrentFrontier() {
+    KU_ASSERT(state == GDSDensityState::SPARSE);
+    std::unordered_set<offset_t> result;
+    for (auto& [offset, iter] : *curSparseFrontier->curData) {
+        if (iter != curIter - 1) {
+            continue;
+        }
+        result.insert(offset);
+    }
+    return result;
+}
+
+void DenseSparseDynamicFrontierPair::switchToDense(ExecutionContext* context, Graph* graph) {
+    KU_ASSERT(state == GDSDensityState::SPARSE);
+    state = GDSDensityState::DENSE;
+    curDenseFrontier->init(context, graph, FRONTIER_UNVISITED);
+    nextDenseFrontier->init(context, graph, FRONTIER_UNVISITED);
+    for (auto& [tableID, map] : nextSparseFrontier->sparseObjects.getData()) {
+        nextDenseFrontier->pinTableID(tableID);
+        for (auto [offset, iter] : map) {
+            nextDenseFrontier->curData[offset].store(iter);
+        }
+    }
+}
+
+DenseFrontierPair::DenseFrontierPair(std::unique_ptr<DenseFrontier> curDenseFrontier,
+    std::unique_ptr<DenseFrontier> nextDenseFrontier)
+    : curDenseFrontier{std::move(curDenseFrontier)},
+      nextDenseFrontier{std::move(nextDenseFrontier)} {
+    currentFrontier = this->curDenseFrontier.get();
+    nextFrontier = this->nextDenseFrontier.get();
+}
+
+void DenseFrontierPair::beginNewIterationInternalNoLock() {
+    std::swap(curDenseFrontier, nextDenseFrontier);
+    currentFrontier = curDenseFrontier.get();
+    nextFrontier = nextDenseFrontier.get();
+}
+
+void DenseFrontierPair::resetValue(ExecutionContext* context, Graph* graph, iteration_t val) {
+    curDenseFrontier->resetValue(context, graph, val);
+    nextDenseFrontier->resetValue(context, graph, val);
+}
+
+static constexpr uint64_t EARLY_TERM_NUM_NODES_THRESHOLD = 100;
+
+bool SPEdgeCompute::terminate(NodeOffsetMaskMap& maskMap) {
+    auto targetNumNodes = maskMap.getNumMaskedNode();
+    if (targetNumNodes > EARLY_TERM_NUM_NODES_THRESHOLD) {
+        // Skip checking if it's unlikely to early terminate.
+        return false;
+    }
+    numNodesReached += frontierPair->getNumActiveNodesInCurrentFrontier(maskMap);
+    return numNodesReached == targetNumNodes;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_state.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_state.cpp
new file mode 100644
index 0000000000..aecfa7608e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_state.cpp
@@ -0,0 +1,26 @@
+#include "function/gds/gds_state.h"
+
+namespace lbug {
+namespace function {
+
+void GDSComputeState::initSource(common::nodeID_t sourceNodeID) const {
+    frontierPair->pinNextFrontier(sourceNodeID.tableID);
+    frontierPair->addNodeToNextFrontier(sourceNodeID);
+    frontierPair->setActiveNodesForNextIter();
+    auxiliaryState->initSource(sourceNodeID);
+}
+
+void GDSComputeState::beginFrontierCompute(common::table_id_t currTableID,
+    common::table_id_t nextTableID) const {
+    frontierPair->beginFrontierComputeBetweenTables(currTableID, nextTableID);
+    auxiliaryState->beginFrontierCompute(currTableID, nextTableID);
+}
+
+void GDSComputeState::switchToDense(processor::ExecutionContext* context,
+    graph::Graph* graph) const {
+    frontierPair->switchToDense(context, graph);
+    auxiliaryState->switchToDense(context, graph);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_task.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_task.cpp
new file mode 100644
index 0000000000..b57527370d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_task.cpp
@@ -0,0 +1,151 @@
+#include "function/gds/gds_task.h"
+
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "function/gds/frontier_morsel.h"
+#include "graph/graph.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+table_id_t FrontierTaskInfo::getBoundTableID() const {
+    switch (direction) {
+    case ExtendDirection::FWD:
+        return srcTableID;
+    case ExtendDirection::BWD:
+        return dstTableID;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+table_id_t FrontierTaskInfo::getNbrTableID() const {
+    switch (direction) {
+    case ExtendDirection::FWD:
+        return dstTableID;
+    case ExtendDirection::BWD:
+        return srcTableID;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+oid_t FrontierTaskInfo::getRelTableID() const {
+    return relGroupEntry->constCast<catalog::RelGroupCatalogEntry>()
+        .getRelEntryInfo(srcTableID, dstTableID)
+        ->oid;
+}
+
+void FrontierTask::run() {
+    FrontierMorsel morsel;
+    auto numActiveNodes = 0u;
+    auto graph = info.graph;
+    auto scanState = graph->prepareRelScan(*info.relGroupEntry, info.getRelTableID(),
+        info.getNbrTableID(), info.propertiesToScan);
+    auto ec = info.edgeCompute.copy();
+    auto boundTableID = info.getBoundTableID();
+    switch (info.direction) {
+    case ExtendDirection::FWD: {
+        while (sharedState->morselDispatcher.getNextRangeMorsel(morsel)) {
+            for (auto offset = morsel.getBeginOffset(); offset < morsel.getEndOffset(); ++offset) {
+                if (!sharedState->frontierPair.isActiveOnCurrentFrontier(offset)) {
+                    continue;
+                }
+                nodeID_t nodeID = {offset, boundTableID};
+                for (auto chunk : graph->scanFwd(nodeID, *scanState)) {
+                    auto activeNodes = ec->edgeCompute(nodeID, chunk, true);
+                    sharedState->frontierPair.addNodesToNextFrontier(activeNodes);
+                    numActiveNodes += activeNodes.size();
+                }
+            }
+        }
+    } break;
+    case ExtendDirection::BWD: {
+        while (sharedState->morselDispatcher.getNextRangeMorsel(morsel)) {
+            for (auto offset = morsel.getBeginOffset(); offset < morsel.getEndOffset(); ++offset) {
+                if (!sharedState->frontierPair.isActiveOnCurrentFrontier(offset)) {
+                    continue;
+                }
+                nodeID_t nodeID = {offset, boundTableID};
+                for (auto chunk : graph->scanBwd(nodeID, *scanState)) {
+                    auto activeNodes = ec->edgeCompute(nodeID, chunk, false);
+                    sharedState->frontierPair.addNodesToNextFrontier(activeNodes);
+                    numActiveNodes += activeNodes.size();
+                }
+            }
+        }
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    if (numActiveNodes) {
+        sharedState->frontierPair.setActiveNodesForNextIter();
+    }
+}
+
+void FrontierTask::runSparse() {
+    auto numActiveNodes = 0u;
+    auto graph = info.graph;
+    auto scanState = graph->prepareRelScan(*info.relGroupEntry, info.getRelTableID(),
+        info.getNbrTableID(), info.propertiesToScan);
+    auto ec = info.edgeCompute.copy();
+    auto boundTableID = info.getBoundTableID();
+    switch (info.direction) {
+    case ExtendDirection::FWD: {
+        for (const auto offset : sharedState->frontierPair.getActiveNodesOnCurrentFrontier()) {
+            auto nodeID = nodeID_t{offset, boundTableID};
+            for (auto chunk : graph->scanFwd(nodeID, *scanState)) {
+                auto activeNodes = ec->edgeCompute(nodeID, chunk, true);
+                sharedState->frontierPair.addNodesToNextFrontier(activeNodes);
+                numActiveNodes += activeNodes.size();
+            }
+        }
+    } break;
+    case ExtendDirection::BWD: {
+        for (auto& offset : sharedState->frontierPair.getActiveNodesOnCurrentFrontier()) {
+            auto nodeID = nodeID_t{offset, boundTableID};
+            for (auto chunk : graph->scanBwd(nodeID, *scanState)) {
+                auto activeNodes = ec->edgeCompute(nodeID, chunk, false);
+                sharedState->frontierPair.addNodesToNextFrontier(activeNodes);
+                numActiveNodes += activeNodes.size();
+            }
+        }
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    if (numActiveNodes) {
+        sharedState->frontierPair.setActiveNodesForNextIter();
+    }
+}
+
+void VertexComputeTask::run() {
+    FrontierMorsel morsel;
+    auto graph = info.graph;
+    auto localVc = info.vc.copy();
+    if (info.hasPropertiesToScan()) {
+        auto scanState = graph->prepareVertexScan(info.tableEntry, info.propertiesToScan);
+        while (sharedState->morselDispatcher.getNextRangeMorsel(morsel)) {
+            for (auto chunk :
+                graph->scanVertices(morsel.getBeginOffset(), morsel.getEndOffset(), *scanState)) {
+                localVc->vertexCompute(chunk);
+            }
+        }
+    } else {
+        while (sharedState->morselDispatcher.getNextRangeMorsel(morsel)) {
+            localVc->vertexCompute(morsel.getBeginOffset(), morsel.getEndOffset(),
+                info.tableEntry->getTableID());
+        }
+    }
+}
+
+void VertexComputeTask::runSparse() {
+    KU_ASSERT(!info.hasPropertiesToScan());
+    auto localVc = info.vc.copy();
+    localVc->vertexCompute(info.tableEntry->getTableID());
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_utils.cpp
new file mode 100644
index 0000000000..789fe38557
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/gds_utils.cpp
@@ -0,0 +1,173 @@
+#include "function/gds/gds_utils.h"
+
+#include "binder/expression/property_expression.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/exception/interrupt.h"
+#include "common/task_system/task_scheduler.h"
+#include "function/gds/gds_task.h"
+#include "graph/graph.h"
+#include "graph/graph_entry.h"
+#include "main/client_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::function;
+using namespace lbug::processor;
+using namespace lbug::graph;
+
+namespace lbug {
+namespace function {
+
+static std::shared_ptr<FrontierTask> getFrontierTask(const main::ClientContext* context,
+    const GraphRelInfo& relInfo, Graph* graph, ExtendDirection extendDirection,
+    const GDSComputeState& computeState, std::vector<std::string> propertiesToScan) {
+    auto info = FrontierTaskInfo(relInfo.srcTableID, relInfo.dstTableID, relInfo.relGroupEntry,
+        graph, extendDirection, *computeState.edgeCompute, std::move(propertiesToScan));
+    computeState.beginFrontierCompute(info.getBoundTableID(), info.getNbrTableID());
+    auto numThreads = context->getMaxNumThreadForExec();
+    auto sharedState =
+        std::make_shared<FrontierTaskSharedState>(numThreads, *computeState.frontierPair);
+    auto maxOffset =
+        graph->getMaxOffset(transaction::Transaction::Get(*context), info.getBoundTableID());
+    sharedState->morselDispatcher.init(maxOffset);
+    return std::make_shared<FrontierTask>(numThreads, info, sharedState);
+}
+
+static void scheduleFrontierTask(ExecutionContext* context, const GraphRelInfo& relInfo,
+    Graph* graph, ExtendDirection extendDirection, const GDSComputeState& computeState,
+    std::vector<std::string> propertiesToScan) {
+    auto clientContext = context->clientContext;
+    auto task = getFrontierTask(clientContext, relInfo, graph, extendDirection, computeState,
+        std::move(propertiesToScan));
+    if (computeState.frontierPair->getState() == GDSDensityState::SPARSE) {
+        task->runSparse();
+        return;
+    }
+
+    // GDSUtils::runFrontiersUntilConvergence is called from a GDSCall operator, which is
+    // already executed by a worker thread Tm of the task scheduler. So this function is
+    // executed by Tm. Because this function will monitor the task and wait for it to
+    // complete, running GDS algorithms effectively "loses" Tm. This can even lead to the
+    // query processor to halt, e.g., if there is a single worker thread in the system, and
+    // more generally decrease the number of worker threads by 1. Therefore, we instruct
+    // scheduleTaskAndWaitOrError to start a new thread by passing true as the last
+    // argument.
+    TaskScheduler::Get(*context->clientContext)
+        ->scheduleTaskAndWaitOrError(task, context, true /* launchNewWorkerThread */);
+}
+
+static void runOneIteration(ExecutionContext* context, Graph* graph,
+    ExtendDirection extendDirection, const GDSComputeState& compState,
+    const std::vector<std::string>& propertiesToScan) {
+    for (auto info : graph->getGraphEntry()->nodeInfos) {
+        for (const auto& relInfo : graph->getRelInfos(info.entry->getTableID())) {
+            if (context->clientContext->interrupted()) {
+                throw InterruptException{};
+            }
+            switch (extendDirection) {
+            case ExtendDirection::FWD: {
+                scheduleFrontierTask(context, relInfo, graph, ExtendDirection::FWD, compState,
+                    propertiesToScan);
+            } break;
+            case ExtendDirection::BWD: {
+                scheduleFrontierTask(context, relInfo, graph, ExtendDirection::BWD, compState,
+                    propertiesToScan);
+            } break;
+            case ExtendDirection::BOTH: {
+                scheduleFrontierTask(context, relInfo, graph, ExtendDirection::FWD, compState,
+                    propertiesToScan);
+                scheduleFrontierTask(context, relInfo, graph, ExtendDirection::BWD, compState,
+                    propertiesToScan);
+            } break;
+            default:
+                KU_UNREACHABLE;
+            }
+        }
+    }
+}
+
+void GDSUtils::runAlgorithmEdgeCompute(ExecutionContext* context, GDSComputeState& compState,
+    Graph* graph, ExtendDirection extendDirection, uint64_t maxIteration) {
+    auto frontierPair = compState.frontierPair.get();
+    while (frontierPair->continueNextIter(maxIteration)) {
+        frontierPair->beginNewIteration();
+        runOneIteration(context, graph, extendDirection, compState, {});
+    }
+}
+
+void GDSUtils::runFTSEdgeCompute(ExecutionContext* context, GDSComputeState& compState,
+    Graph* graph, ExtendDirection extendDirection,
+    const std::vector<std::string>& propertiesToScan) {
+    compState.frontierPair->beginNewIteration();
+    runOneIteration(context, graph, extendDirection, compState, propertiesToScan);
+}
+
+void GDSUtils::runRecursiveJoinEdgeCompute(ExecutionContext* context, GDSComputeState& compState,
+    Graph* graph, ExtendDirection extendDirection, uint64_t maxIteration,
+    NodeOffsetMaskMap* outputNodeMask, const std::vector<std::string>& propertiesToScan) {
+    auto frontierPair = compState.frontierPair.get();
+    compState.edgeCompute->resetSingleThreadState();
+    while (frontierPair->continueNextIter(maxIteration)) {
+        frontierPair->beginNewIteration();
+        if (outputNodeMask != nullptr && compState.edgeCompute->terminate(*outputNodeMask)) {
+            break;
+        }
+        runOneIteration(context, graph, extendDirection, compState, propertiesToScan);
+        if (frontierPair->needSwitchToDense(
+                context->clientContext->getClientConfig()->sparseFrontierThreshold)) {
+            compState.switchToDense(context, graph);
+        }
+    }
+}
+
+static void runVertexComputeInternal(const TableCatalogEntry* currentEntry,
+    GDSDensityState densityState, const Graph* graph, std::shared_ptr<VertexComputeTask> task,
+    ExecutionContext* context) {
+    if (densityState == GDSDensityState::SPARSE) {
+        task->runSparse();
+        return;
+    }
+    auto maxOffset = graph->getMaxOffset(transaction::Transaction::Get(*context->clientContext),
+        currentEntry->getTableID());
+    auto sharedState = task->getSharedState();
+    sharedState->morselDispatcher.init(maxOffset);
+    TaskScheduler::Get(*context->clientContext)
+        ->scheduleTaskAndWaitOrError(task, context, true /* launchNewWorkerThread */);
+}
+
+void GDSUtils::runVertexCompute(ExecutionContext* context, GDSDensityState densityState,
+    Graph* graph, VertexCompute& vc, const std::vector<std::string>& propertiesToScan) {
+    auto maxThreads = context->clientContext->getMaxNumThreadForExec();
+    auto sharedState = std::make_shared<VertexComputeTaskSharedState>(maxThreads);
+    for (const auto& nodeInfo : graph->getGraphEntry()->nodeInfos) {
+        auto entry = nodeInfo.entry;
+        if (!vc.beginOnTable(entry->getTableID())) {
+            continue;
+        }
+        auto info = VertexComputeTaskInfo(vc, graph, entry, propertiesToScan);
+        auto task = std::make_shared<VertexComputeTask>(maxThreads, info, sharedState);
+        runVertexComputeInternal(entry, densityState, graph, task, context);
+    }
+}
+
+void GDSUtils::runVertexCompute(ExecutionContext* context, GDSDensityState densityState,
+    Graph* graph, VertexCompute& vc) {
+    runVertexCompute(context, densityState, graph, vc, std::vector<std::string>{});
+}
+
+void GDSUtils::runVertexCompute(ExecutionContext* context, GDSDensityState densityState,
+    Graph* graph, VertexCompute& vc, TableCatalogEntry* entry,
+    const std::vector<std::string>& propertiesToScan) {
+    auto maxThreads = context->clientContext->getMaxNumThreadForExec();
+    auto info = VertexComputeTaskInfo(vc, graph, entry, propertiesToScan);
+    auto sharedState = std::make_shared<VertexComputeTaskSharedState>(maxThreads);
+    if (!vc.beginOnTable(entry->getTableID())) {
+        return;
+    }
+    auto task = std::make_shared<VertexComputeTask>(maxThreads, info, sharedState);
+    runVertexComputeInternal(entry, densityState, graph, task, context);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/output_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/output_writer.cpp
new file mode 100644
index 0000000000..150d0db5a1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/output_writer.cpp
@@ -0,0 +1,396 @@
+#include "common/exception/interrupt.h"
+#include "function/gds/rj_output_writer.h"
+#include "main/client_context.h"
+#include <function/gds/gds_frontier.h>
+
+using namespace lbug::common;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+RJOutputWriter::RJOutputWriter(main::ClientContext* context, NodeOffsetMaskMap* outputNodeMask,
+    nodeID_t sourceNodeID)
+    : context{context}, outputNodeMask{outputNodeMask}, sourceNodeID_{sourceNodeID} {
+    srcNodeIDVector = createVector(LogicalType::INTERNAL_ID());
+    dstNodeIDVector = createVector(LogicalType::INTERNAL_ID());
+    srcNodeIDVector->setValue<nodeID_t>(0, sourceNodeID);
+}
+
+void RJOutputWriter::pinOutputNodeMask(table_id_t tableID) {
+    if (outputNodeMask != nullptr) {
+        outputNodeMask->pin(tableID);
+    }
+}
+
+bool RJOutputWriter::inOutputNodeMask(common::offset_t offset) {
+    if (outputNodeMask == nullptr) { // No mask
+        return true;
+    }
+    auto mask = outputNodeMask->getPinnedMask();
+    if (!mask->isEnabled()) { // No mask
+        return true;
+    }
+    return mask->isMasked(offset);
+}
+
+std::unique_ptr<ValueVector> RJOutputWriter::createVector(const LogicalType& type) {
+    auto vector = std::make_unique<ValueVector>(type.copy(), storage::MemoryManager::Get(*context));
+    vector->state = DataChunkState::getSingleValueDataChunkState();
+    vectors.push_back(vector.get());
+    return vector;
+}
+
+PathsOutputWriter::PathsOutputWriter(main::ClientContext* context,
+    NodeOffsetMaskMap* outputNodeMask, nodeID_t sourceNodeID, PathsOutputWriterInfo info,
+    BaseBFSGraph& bfsGraph)
+    : RJOutputWriter{context, outputNodeMask, sourceNodeID}, info{info}, bfsGraph{bfsGraph} {
+    lengthVector = createVector(LogicalType::UINT16());
+    if (info.writeEdgeDirection) {
+        directionVector = createVector(LogicalType::LIST(LogicalType::BOOL()));
+    }
+    if (info.writePath) {
+        pathNodeIDsVector = createVector(LogicalType::LIST(LogicalType::INTERNAL_ID()));
+        pathEdgeIDsVector = createVector(LogicalType::LIST(LogicalType::INTERNAL_ID()));
+    }
+}
+
+static void addListEntry(ValueVector* vector, uint64_t length) {
+    vector->resetAuxiliaryBuffer();
+    auto entry = ListVector::addList(vector, length);
+    KU_ASSERT(entry.offset == 0);
+    vector->setValue(0, entry);
+}
+
+static ParentList* getTop(const std::vector<ParentList*>& path) {
+    return path[path.size() - 1];
+}
+
+void PathsOutputWriter::write(FactorizedTable& fTable, table_id_t tableID, LimitCounter* counter) {
+    auto& sparseGraph = bfsGraph.cast<SparseBFSGraph>();
+    for (auto& [offset, _] : sparseGraph.getCurrentData()) {
+        write(fTable, {offset, tableID}, counter);
+    }
+    if (info.lowerBound == 0 && sourceNodeID_.tableID == tableID) {
+        write(fTable, sourceNodeID_, counter);
+    }
+}
+
+void PathsOutputWriter::write(FactorizedTable& fTable, nodeID_t dstNodeID, LimitCounter* counter) {
+    if (!inOutputNodeMask(dstNodeID.offset)) {
+        return;
+    }
+    dstNodeIDVector->setValue<nodeID_t>(0, dstNodeID);
+    writeInternal(fTable, dstNodeID, counter);
+}
+
+void PathsOutputWriter::dfsFast(ParentList* firstParent, FactorizedTable& fTable,
+    LimitCounter* counter) {
+    std::vector<ParentList*> curPath;
+    curPath.push_back(firstParent);
+    auto backtracking = false;
+    while (!curPath.empty()) {
+        if (context->interrupted()) {
+            throw InterruptException{};
+        }
+        auto top = curPath[curPath.size() - 1];
+        auto topNodeID = top->getNodeID();
+        if (top->getIter() == 1) {
+            writePath(curPath);
+            fTable.append(vectors);
+            if (updateCounterAndTerminate(counter)) {
+                return;
+            }
+            backtracking = true;
+        }
+        if (backtracking) {
+            auto next = getTop(curPath)->getNextPtr();
+            if (isNextViable(next, curPath)) {
+                curPath[curPath.size() - 1] = next;
+                backtracking = false;
+            } else {
+                curPath.pop_back();
+            }
+        } else {
+            auto parent = bfsGraph.getParentListHead(topNodeID);
+            while (parent->getIter() != top->getIter() - 1) {
+                parent = parent->getNextPtr();
+            }
+            curPath.push_back(parent);
+            backtracking = false;
+        }
+    }
+}
+
+void PathsOutputWriter::dfsSlow(ParentList* firstParent, FactorizedTable& fTable,
+    LimitCounter* counter) {
+    std::vector<ParentList*> curPath;
+    curPath.push_back(firstParent);
+    auto backtracking = false;
+    while (!curPath.empty()) {
+        if (context->interrupted()) {
+            throw InterruptException{};
+        }
+        if (getTop(curPath)->getIter() == 1) {
+            writePath(curPath);
+            fTable.append(vectors);
+            if (updateCounterAndTerminate(counter)) {
+                return;
+            }
+            backtracking = true;
+        }
+        if (backtracking) {
+            auto next = getTop(curPath)->getNextPtr();
+            while (true) {
+                if (!isNextViable(next, curPath)) {
+                    curPath.pop_back();
+                    break;
+                }
+                // Further check next against path node mask (predicate).
+                if (!checkPathNodeMask(next) || !checkReplaceTopSemantic(curPath, next)) {
+                    next = next->getNextPtr();
+                    continue;
+                }
+                // Next is a valid path element. Push into stack and switch to forward track.
+                curPath[curPath.size() - 1] = next;
+                backtracking = false;
+                break;
+            }
+        } else {
+            auto top = getTop(curPath);
+            auto parent = bfsGraph.getParentListHead(top->getNodeID());
+            while (true) {
+                if (parent == nullptr) {
+                    // No more forward tracking candidates. Switch to backward tracking.
+                    backtracking = true;
+                    break;
+                }
+                if (parent->getIter() == top->getIter() - 1 && checkPathNodeMask(parent) &&
+                    checkAppendSemantic(curPath, parent)) {
+                    // A forward tracking candidate should decrease the iteration by one and also
+                    // pass node predicate checking.
+                    curPath.push_back(parent);
+                    backtracking = false;
+                    break;
+                }
+                parent = parent->getNextPtr();
+            }
+        }
+    }
+}
+
+bool PathsOutputWriter::updateCounterAndTerminate(LimitCounter* counter) {
+    if (counter != nullptr) {
+        counter->increase(1);
+        return counter->exceedLimit();
+    }
+    return false;
+}
+
+ParentList* PathsOutputWriter::findFirstParent(offset_t dstOffset) const {
+    auto result = bfsGraph.getParentListHead(dstOffset);
+    if (!info.hasNodeMask() && info.semantic == PathSemantic::WALK) {
+        // Fast path when there is no node predicate or semantic check
+        return result;
+    }
+    while (result) {
+        // A valid parent should
+        // (1) satisfies path node semi mask (i.e. path node predicate)
+        // (2) since first parent has the largest iteration number which decides path length, we
+        //     also need to check if path length is greater than lower bound.
+        if (checkPathNodeMask(result) && result->getIter() >= info.lowerBound) {
+            break;
+        }
+        result = result->getNextPtr();
+    }
+    return result;
+}
+
+// This code checks if we should switch from backtracking to forward-tracking, i.e.,
+// moving forward in the DFS logic to find paths. We switch from backtracking if:
+bool PathsOutputWriter::isNextViable(ParentList* next, const std::vector<ParentList*>& path) const {
+    if (next == nullptr) {
+        return false;
+    }
+    auto nextIter = next->getIter();
+    // (1) if this is the first element in the stack (curPath.size() == 1), i.e., we
+    // are enumerating the parents of the destination, then we should switch to
+    // forward-tracking if the next parent has visited the destination at a length
+    // that's greater than or equal to the lower bound of the recursive join. Otherwise, we would
+    // enumerate paths that are smaller than the lower bound from the start element, so we can stop
+    // here.; OR
+    if (path.size() == 1) {
+        return nextIter >= info.lowerBound;
+    }
+    // (2) if this is not the first element in the stack, i.e., then we should switch
+    // to forward tracking only if the next parent of the top node in the stack has the
+    // same iter value as the current parent. That's because the levels/iter need to
+    // decrease by 1 each time we add a new node in the stack.
+    if (nextIter == getTop(path)->getIter()) {
+        return true;
+    }
+    return false;
+}
+
+bool PathsOutputWriter::checkPathNodeMask(ParentList* element) const {
+    if (!info.hasNodeMask() || element->getIter() == 1) {
+        return true;
+    }
+    return info.pathNodeMask->valid(element->getNodeID());
+}
+
+bool PathsOutputWriter::checkAppendSemantic(const std::vector<ParentList*>& path,
+    ParentList* candidate) const {
+    switch (info.semantic) {
+    case PathSemantic::WALK:
+        return true;
+    case PathSemantic::TRAIL:
+        return isAppendTrail(path, candidate);
+    case PathSemantic::ACYCLIC:
+        return isAppendAcyclic(path, candidate);
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+bool PathsOutputWriter::checkReplaceTopSemantic(const std::vector<ParentList*>& path,
+    ParentList* candidate) const {
+    switch (info.semantic) {
+    case PathSemantic::WALK:
+        return true;
+    case PathSemantic::TRAIL:
+        return isReplaceTopTrail(path, candidate);
+    case PathSemantic::ACYCLIC:
+        return isReplaceTopAcyclic(path, candidate);
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+bool PathsOutputWriter::isAppendTrail(const std::vector<ParentList*>& path,
+    ParentList* candidate) const {
+    for (auto& element : path) {
+        if (candidate->getEdgeID() == element->getEdgeID()) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool PathsOutputWriter::isAppendAcyclic(const std::vector<ParentList*>& path,
+    ParentList* candidate) const {
+    // Skip dst for semantic checking
+    for (auto i = 1u; i < path.size() - 1; ++i) {
+        if (candidate->getNodeID() == path[i]->getNodeID()) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool PathsOutputWriter::isReplaceTopTrail(const std::vector<ParentList*>& path,
+    ParentList* candidate) const {
+    for (auto i = 0u; i < path.size() - 1; ++i) {
+        if (candidate->getEdgeID() == path[i]->getEdgeID()) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool PathsOutputWriter::isReplaceTopAcyclic(const std::vector<ParentList*>& path,
+    ParentList* candidate) const {
+    // Skip dst for semantic checking
+    for (auto i = 1u; i < path.size() - 1; ++i) {
+        if (candidate->getNodeID() == path[i]->getNodeID()) {
+            return false;
+        }
+    }
+    return true;
+}
+
+static void setLength(ValueVector* vector, uint16_t length) {
+    KU_ASSERT(vector->dataType.getLogicalTypeID() == LogicalTypeID::UINT16);
+    vector->setValue<uint16_t>(0, length);
+}
+
+void PathsOutputWriter::beginWritePath(idx_t length) const {
+    KU_ASSERT(info.writePath);
+    addListEntry(pathNodeIDsVector.get(), length > 1 ? length - 1 : 0);
+    addListEntry(pathEdgeIDsVector.get(), length);
+    if (info.writeEdgeDirection) {
+        addListEntry(directionVector.get(), length);
+    }
+}
+
+void PathsOutputWriter::writePath(const std::vector<ParentList*>& path) const {
+    setLength(lengthVector.get(), path.size());
+    if (!info.writePath) {
+        return;
+    }
+    beginWritePath(path.size());
+    if (path.size() == 0) {
+        return;
+    }
+    if (!info.flipPath) {
+        // By default, write path in reverse direction because we append ParentList from dst to src.
+        writePathBwd(path);
+    } else {
+        // Write path in original direction because computation started from dst node.
+        // We want to present result in src->dst order.
+        writePathFwd(path);
+    }
+}
+
+void PathsOutputWriter::writePathFwd(const std::vector<ParentList*>& path) const {
+    auto length = path.size();
+    for (auto i = 0u; i < length - 1; i++) {
+        auto p = path[i];
+        addNode(p->getNodeID(), i);
+        addEdge(p->getEdgeID(), p->isFwdEdge(), i);
+    }
+    auto lastPathElement = path[length - 1];
+    addEdge(lastPathElement->getEdgeID(), lastPathElement->isFwdEdge(), length - 1);
+}
+
+void PathsOutputWriter::writePathBwd(const std::vector<ParentList*>& path) const {
+    auto length = path.size();
+    for (auto i = 1u; i < length; i++) {
+        auto p = path[length - 1 - i];
+        addNode(p->getNodeID(), i - 1);
+        addEdge(p->getEdgeID(), p->isFwdEdge(), i);
+    }
+    auto lastPathElement = path[length - 1];
+    addEdge(lastPathElement->getEdgeID(), lastPathElement->isFwdEdge(), 0);
+}
+
+void PathsOutputWriter::addEdge(relID_t edgeID, bool fwdEdge, sel_t pos) const {
+    ListVector::getDataVector(pathEdgeIDsVector.get())->setValue(pos, edgeID);
+    if (info.writeEdgeDirection) {
+        ListVector::getDataVector(directionVector.get())->setValue(pos, fwdEdge);
+    }
+}
+
+void PathsOutputWriter::addNode(nodeID_t nodeID, sel_t pos) const {
+    ListVector::getDataVector(pathNodeIDsVector.get())->setValue(pos, nodeID);
+}
+
+void SPPathsOutputWriter::writeInternal(FactorizedTable& fTable, nodeID_t dstNodeID,
+    LimitCounter* counter) {
+    auto firstParent = findFirstParent(dstNodeID.offset);
+    if (firstParent == nullptr) {
+        return;
+    }
+    if (dstNodeID == sourceNodeID_) { // Avoid writing source
+        KU_ASSERT(firstParent->getIter() == FRONTIER_INITIAL_VISITED);
+        return;
+    }
+    if (!info.hasNodeMask() && info.semantic == PathSemantic::WALK) {
+        dfsFast(firstParent, fTable, counter);
+        return;
+    }
+    dfsSlow(firstParent, fTable, counter);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/rec_joins.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/rec_joins.cpp
new file mode 100644
index 0000000000..d01ee757a3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/rec_joins.cpp
@@ -0,0 +1,35 @@
+#include "function/gds/rec_joins.h"
+
+namespace lbug {
+namespace function {
+
+RJBindData::RJBindData(const RJBindData& other) {
+    graphEntry = other.graphEntry.copy();
+    nodeInput = other.nodeInput;
+    nodeOutput = other.nodeOutput;
+    lowerBound = other.lowerBound;
+    upperBound = other.upperBound;
+    semantic = other.semantic;
+    extendDirection = other.extendDirection;
+    flipPath = other.flipPath;
+    writePath = other.writePath;
+    directionExpr = other.directionExpr;
+    lengthExpr = other.lengthExpr;
+    pathNodeIDsExpr = other.pathNodeIDsExpr;
+    pathEdgeIDsExpr = other.pathEdgeIDsExpr;
+    weightPropertyExpr = other.weightPropertyExpr;
+    weightOutputExpr = other.weightOutputExpr;
+}
+
+PathsOutputWriterInfo RJBindData::getPathWriterInfo() const {
+    auto info = PathsOutputWriterInfo();
+    info.semantic = semantic;
+    info.lowerBound = lowerBound;
+    info.flipPath = flipPath;
+    info.writeEdgeDirection = writePath && extendDirection == common::ExtendDirection::BOTH;
+    info.writePath = writePath;
+    return info;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/ssp_destinations.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/ssp_destinations.cpp
new file mode 100644
index 0000000000..1c6e788095
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/ssp_destinations.cpp
@@ -0,0 +1,127 @@
+#include "binder/expression/node_expression.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/rec_joins.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::processor;
+using namespace lbug::graph;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+class SSPDestinationsOutputWriter : public RJOutputWriter {
+public:
+    SSPDestinationsOutputWriter(ClientContext* context, NodeOffsetMaskMap* outputNodeMask,
+        nodeID_t sourceNodeID, Frontier* frontier)
+        : RJOutputWriter{context, outputNodeMask, sourceNodeID}, frontier{frontier} {
+        lengthVector = createVector(LogicalType::UINT16());
+    }
+
+    void beginWritingInternal(table_id_t tableID) override { frontier->pinTableID(tableID); }
+
+    void write(FactorizedTable& fTable, table_id_t tableID, LimitCounter* counter) override {
+        auto& sparseFrontier = frontier->cast<SparseFrontier>();
+        for (auto [offset, _] : sparseFrontier.getCurrentData()) {
+            write(fTable, {offset, tableID}, counter);
+        }
+    }
+
+    void write(FactorizedTable& fTable, nodeID_t dstNodeID, LimitCounter* counter) override {
+        if (!inOutputNodeMask(dstNodeID.offset)) { // Skip dst if it not is in scope.
+            return;
+        }
+        if (sourceNodeID_ == dstNodeID) { // Skip writing source node.
+            return;
+        }
+        auto iter = frontier->getIteration(dstNodeID.offset);
+        if (iter == FRONTIER_UNVISITED) { // Skip if dst is not visited.
+            return;
+        }
+        dstNodeIDVector->setValue<nodeID_t>(0, dstNodeID);
+        lengthVector->setValue<uint16_t>(0, iter);
+        fTable.append(vectors);
+        if (counter != nullptr) {
+            counter->increase(1);
+        }
+    }
+
+    std::unique_ptr<RJOutputWriter> copy() override {
+        return std::make_unique<SSPDestinationsOutputWriter>(context, outputNodeMask, sourceNodeID_,
+            frontier);
+    }
+
+private:
+    Frontier* frontier;
+    std::unique_ptr<ValueVector> lengthVector;
+};
+
+class SSPDestinationsEdgeCompute : public SPEdgeCompute {
+public:
+    explicit SSPDestinationsEdgeCompute(SPFrontierPair* frontierPair)
+        : SPEdgeCompute{frontierPair} {};
+
+    std::vector<nodeID_t> edgeCompute(nodeID_t, NbrScanState::Chunk& resultChunk, bool) override {
+        std::vector<nodeID_t> activeNodes;
+        resultChunk.forEach([&](auto neighbors, auto, auto i) {
+            auto nbrNode = neighbors[i];
+            auto iter = frontierPair->getNextFrontierValue(nbrNode.offset);
+            if (iter == FRONTIER_UNVISITED) {
+                activeNodes.push_back(nbrNode);
+            }
+        });
+        return activeNodes;
+    }
+
+    std::unique_ptr<EdgeCompute> copy() override {
+        return std::make_unique<SSPDestinationsEdgeCompute>(frontierPair);
+    }
+};
+
+// Single shortest path algorithm. Only destinations are tracked (reachability query).
+// If there are multiple path to a destination. Only one of the path is tracked.
+class SingleSPDestinationsAlgorithm : public RJAlgorithm {
+public:
+    std::string getFunctionName() const override { return SingleSPDestinationsFunction::name; }
+
+    expression_vector getResultColumns(const RJBindData& bindData) const override {
+        expression_vector columns;
+        columns.push_back(bindData.nodeInput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.nodeOutput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.lengthExpr);
+        return columns;
+    }
+
+    std::unique_ptr<RJAlgorithm> copy() const override {
+        return std::make_unique<SingleSPDestinationsAlgorithm>(*this);
+    }
+
+private:
+    std::unique_ptr<GDSComputeState> getComputeState(ExecutionContext* context, const RJBindData&,
+        RecursiveExtendSharedState* sharedState) override {
+        auto graph = sharedState->graph.get();
+        auto denseFrontier = DenseFrontier::getUninitializedFrontier(context, graph);
+        auto frontierPair = std::make_unique<SPFrontierPair>(std::move(denseFrontier));
+        auto edgeCompute = std::make_unique<SSPDestinationsEdgeCompute>(frontierPair.get());
+        auto auxiliaryState = std::make_unique<EmptyGDSAuxiliaryState>();
+        return std::make_unique<GDSComputeState>(std::move(frontierPair), std::move(edgeCompute),
+            std::move(auxiliaryState));
+    }
+
+    std::unique_ptr<RJOutputWriter> getOutputWriter(ExecutionContext* context, const RJBindData&,
+        GDSComputeState& computeState, nodeID_t sourceNodeID,
+        RecursiveExtendSharedState* sharedState) override {
+        auto frontier = computeState.frontierPair->ptrCast<SPFrontierPair>()->getFrontier();
+        return std::make_unique<SSPDestinationsOutputWriter>(context->clientContext,
+            sharedState->getOutputNodeMaskMap(), sourceNodeID, frontier);
+    }
+};
+
+std::unique_ptr<RJAlgorithm> SingleSPDestinationsFunction::getAlgorithm() {
+    return std::make_unique<SingleSPDestinationsAlgorithm>();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/ssp_paths.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/ssp_paths.cpp
new file mode 100644
index 0000000000..96ecbe9ff8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/ssp_paths.cpp
@@ -0,0 +1,109 @@
+#include "binder/expression/node_expression.h"
+#include "function/gds/auxiliary_state/path_auxiliary_state.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/rec_joins.h"
+// #include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+class SSPPathsEdgeCompute : public SPEdgeCompute {
+public:
+    SSPPathsEdgeCompute(SPFrontierPair* frontierPair, BFSGraphManager* bfsGraphManager)
+        : SPEdgeCompute{frontierPair}, bfsGraphManager{bfsGraphManager} {
+        block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+    }
+
+    std::vector<nodeID_t> edgeCompute(nodeID_t boundNodeID, graph::NbrScanState::Chunk& resultChunk,
+        bool isFwd) override {
+        std::vector<nodeID_t> activeNodes;
+        resultChunk.forEach([&](auto neighbors, auto propertyVectors, auto i) {
+            auto nbrNodeID = neighbors[i];
+            auto iter = frontierPair->getNextFrontierValue(nbrNodeID.offset);
+            if (iter == FRONTIER_UNVISITED) {
+                if (!block->hasSpace()) {
+                    block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+                }
+                auto edgeID = propertyVectors[0]->template getValue<nodeID_t>(i);
+                bfsGraphManager->getCurrentGraph()->addSingleParent(frontierPair->getCurrentIter(),
+                    boundNodeID, edgeID, nbrNodeID, isFwd, block);
+                activeNodes.push_back(nbrNodeID);
+            }
+        });
+        return activeNodes;
+    }
+
+    std::unique_ptr<EdgeCompute> copy() override {
+        return std::make_unique<SSPPathsEdgeCompute>(frontierPair, bfsGraphManager);
+    }
+
+private:
+    BFSGraphManager* bfsGraphManager;
+    ObjectBlock<ParentList>* block = nullptr;
+};
+
+// Single shortest path algorithm. Paths are tracked.
+// If there are multiple path to a destination. Only one of the path is tracked.
+class SingleSPPathsAlgorithm : public RJAlgorithm {
+public:
+    std::string getFunctionName() const override { return SingleSPPathsFunction::name; }
+
+    expression_vector getResultColumns(const RJBindData& bindData) const override {
+        expression_vector columns;
+        columns.push_back(bindData.nodeInput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.nodeOutput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.lengthExpr);
+        if (bindData.extendDirection == ExtendDirection::BOTH) {
+            columns.push_back(bindData.directionExpr);
+        }
+        columns.push_back(bindData.pathNodeIDsExpr);
+        columns.push_back(bindData.pathEdgeIDsExpr);
+        return columns;
+    }
+
+    std::unique_ptr<RJAlgorithm> copy() const override {
+        return std::make_unique<SingleSPPathsAlgorithm>(*this);
+    }
+
+private:
+    std::unique_ptr<GDSComputeState> getComputeState(ExecutionContext* context, const RJBindData&,
+        RecursiveExtendSharedState* sharedState) override {
+        auto clientContext = context->clientContext;
+        auto frontier = DenseFrontier::getUninitializedFrontier(context, sharedState->graph.get());
+        auto frontierPair = std::make_unique<SPFrontierPair>(std::move(frontier));
+        auto transaction = transaction::Transaction::Get(*context->clientContext);
+        auto bfsGraph =
+            std::make_unique<BFSGraphManager>(sharedState->graph->getMaxOffsetMap(transaction),
+                storage::MemoryManager::Get(*clientContext));
+        auto edgeCompute =
+            std::make_unique<SSPPathsEdgeCompute>(frontierPair.get(), bfsGraph.get());
+        auto auxiliaryState = std::make_unique<PathAuxiliaryState>(std::move(bfsGraph));
+        return std::make_unique<GDSComputeState>(std::move(frontierPair), std::move(edgeCompute),
+            std::move(auxiliaryState));
+    }
+
+    std::unique_ptr<RJOutputWriter> getOutputWriter(ExecutionContext* context,
+        const RJBindData& bindData, GDSComputeState& computeState, nodeID_t sourceNodeID,
+        RecursiveExtendSharedState* sharedState) override {
+        auto bfsGraph = computeState.auxiliaryState->ptrCast<PathAuxiliaryState>()
+                            ->getBFSGraphManager()
+                            ->getCurrentGraph();
+        auto writerInfo = bindData.getPathWriterInfo();
+        writerInfo.pathNodeMask = sharedState->getPathNodeMaskMap();
+        return std::make_unique<SPPathsOutputWriter>(context->clientContext,
+            sharedState->getOutputNodeMaskMap(), sourceNodeID, writerInfo, *bfsGraph);
+    }
+};
+
+std::unique_ptr<RJAlgorithm> SingleSPPathsFunction::getAlgorithm() {
+    return std::make_unique<SingleSPPathsAlgorithm>();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/variable_length_path.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/variable_length_path.cpp
new file mode 100644
index 0000000000..c3ad260bd8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/variable_length_path.cpp
@@ -0,0 +1,155 @@
+#include "binder/expression/node_expression.h"
+#include "function/gds/auxiliary_state/path_auxiliary_state.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/rec_joins.h"
+#include "graph/graph.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+class VarLenPathsOutputWriter final : public PathsOutputWriter {
+public:
+    VarLenPathsOutputWriter(main::ClientContext* context, NodeOffsetMaskMap* outputNodeMask,
+        nodeID_t sourceNodeID, PathsOutputWriterInfo info, BaseBFSGraph& bfsGraph)
+        : PathsOutputWriter{context, outputNodeMask, sourceNodeID, info, bfsGraph} {}
+
+    void writeInternal(FactorizedTable& fTable, nodeID_t dstNodeID,
+        LimitCounter* counter) override {
+        auto firstParent = findFirstParent(dstNodeID.offset);
+        if (firstParent == nullptr) {
+            if (sourceNodeID_ == dstNodeID && info.lowerBound == 0) {
+                // We still output a path from src to src if required path length is 0.
+                // e.g. MATCH (a)-[e*0..]->
+                // "a" needs to be in the output
+                writePath({});
+                fTable.append(vectors);
+                updateCounterAndTerminate(counter);
+            }
+            return;
+        }
+        if (firstParent->getIter() < info.lowerBound) { // Skip if lower bound is not met.
+            return;
+        }
+        if (!info.hasNodeMask() && info.semantic == PathSemantic::WALK) {
+            dfsFast(firstParent, fTable, counter);
+            return;
+        }
+        dfsSlow(firstParent, fTable, counter);
+    }
+
+    std::unique_ptr<RJOutputWriter> copy() override {
+        return std::make_unique<VarLenPathsOutputWriter>(context, outputNodeMask, sourceNodeID_,
+            info, bfsGraph);
+    }
+};
+
+class VarLenJoinsEdgeCompute : public EdgeCompute {
+public:
+    VarLenJoinsEdgeCompute(DenseSparseDynamicFrontierPair* frontierPair,
+        BFSGraphManager* bfsGraphManager)
+        : frontierPair{frontierPair}, bfsGraphManager{bfsGraphManager} {
+        block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+    };
+
+    std::vector<nodeID_t> edgeCompute(nodeID_t boundNodeID, graph::NbrScanState::Chunk& chunk,
+        bool fwdEdge) override {
+        std::vector<nodeID_t> activeNodes;
+        chunk.forEach([&](auto neighbors, auto propertyVectors, auto i) {
+            // We should always update the nbrID in variable length joins
+            auto nbrNodeID = neighbors[i];
+            auto edgeID = propertyVectors[0]->template getValue<relID_t>(i);
+            if (!block->hasSpace()) {
+                block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+            }
+            bfsGraphManager->getCurrentGraph()->addParent(frontierPair->getCurrentIter(),
+                boundNodeID, edgeID, nbrNodeID, fwdEdge, block);
+            activeNodes.push_back(nbrNodeID);
+        });
+        return activeNodes;
+    }
+
+    std::unique_ptr<EdgeCompute> copy() override {
+        return std::make_unique<VarLenJoinsEdgeCompute>(frontierPair, bfsGraphManager);
+    }
+
+private:
+    DenseSparseDynamicFrontierPair* frontierPair;
+    BFSGraphManager* bfsGraphManager;
+    ObjectBlock<ParentList>* block = nullptr;
+};
+
+/**
+ * Algorithm for parallel all shortest paths computation, so all shortest paths from a source to
+ * is returned for each destination. If paths are not returned, multiplicities indicate the
+ * number of paths to each destination.
+ */
+class VarLenJoinsAlgorithm final : public RJAlgorithm {
+public:
+    std::string getFunctionName() const override { return VarLenJoinsFunction::name; }
+
+    // return srcNodeID, dstNodeID, length, [direction, pathNodeIDs, pathEdgeIDs] (if track path)
+    expression_vector getResultColumns(const RJBindData& bindData) const override {
+        expression_vector columns;
+        columns.push_back(bindData.nodeInput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.nodeOutput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.lengthExpr);
+        if (bindData.writePath) {
+            if (bindData.extendDirection == ExtendDirection::BOTH) {
+                columns.push_back(bindData.directionExpr);
+            }
+            columns.push_back(bindData.pathNodeIDsExpr);
+            columns.push_back(bindData.pathEdgeIDsExpr);
+        }
+        return columns;
+    }
+
+    std::unique_ptr<RJAlgorithm> copy() const override {
+        return std::make_unique<VarLenJoinsAlgorithm>(*this);
+    }
+
+private:
+    std::unique_ptr<GDSComputeState> getComputeState(ExecutionContext* context, const RJBindData&,
+        RecursiveExtendSharedState* sharedState) override {
+        auto clientContext = context->clientContext;
+        auto transaction = transaction::Transaction::Get(*clientContext);
+        auto bfsGraph =
+            std::make_unique<BFSGraphManager>(sharedState->graph->getMaxOffsetMap(transaction),
+                storage::MemoryManager::Get(*clientContext));
+        auto currentDenseFrontier =
+            DenseFrontier::getUninitializedFrontier(context, sharedState->graph.get());
+        auto nextDenseFrontier =
+            DenseFrontier::getUninitializedFrontier(context, sharedState->graph.get());
+        auto frontierPair = std::make_unique<DenseSparseDynamicFrontierPair>(
+            std::move(currentDenseFrontier), std::move(nextDenseFrontier));
+        auto edgeCompute =
+            std::make_unique<VarLenJoinsEdgeCompute>(frontierPair.get(), bfsGraph.get());
+        auto auxiliaryState = std::make_unique<PathAuxiliaryState>(std::move(bfsGraph));
+        return std::make_unique<GDSComputeState>(std::move(frontierPair), std::move(edgeCompute),
+            std::move(auxiliaryState));
+    }
+
+    std::unique_ptr<RJOutputWriter> getOutputWriter(ExecutionContext* context,
+        const RJBindData& bindData, GDSComputeState& computeState, common::nodeID_t sourceNodeID,
+        processor::RecursiveExtendSharedState* sharedState) override {
+        auto bfsGraph = computeState.auxiliaryState->ptrCast<PathAuxiliaryState>()
+                            ->getBFSGraphManager()
+                            ->getCurrentGraph();
+        auto writerInfo = bindData.getPathWriterInfo();
+        writerInfo.pathNodeMask = sharedState->getPathNodeMaskMap();
+        return std::make_unique<VarLenPathsOutputWriter>(context->clientContext,
+            sharedState->getOutputNodeMaskMap(), sourceNodeID, writerInfo, *bfsGraph);
+    }
+};
+
+std::unique_ptr<RJAlgorithm> VarLenJoinsFunction::getAlgorithm() {
+    return std::make_unique<VarLenJoinsAlgorithm>();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/wsp_destinations.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/wsp_destinations.cpp
new file mode 100644
index 0000000000..da44fac0dc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/wsp_destinations.cpp
@@ -0,0 +1,340 @@
+#include "binder/expression/node_expression.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/rec_joins.h"
+#include "function/gds/weight_utils.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+class Costs {
+public:
+    virtual ~Costs() = default;
+
+    virtual void pinTableID(table_id_t tableID) = 0;
+
+    virtual void setCost(offset_t offset, double cost) = 0;
+    virtual bool tryReplaceWithMinCost(offset_t offset, double newCost) = 0;
+
+    virtual double getCost(offset_t offset) = 0;
+};
+
+class SparseCostsReference : public Costs {
+public:
+    explicit SparseCostsReference(GDSSpareObjectManager<double>& sparseObjects)
+        : sparseObjects{sparseObjects} {}
+
+    void pinTableID(table_id_t tableID) override { curData = sparseObjects.getData(tableID); }
+
+    void setCost(offset_t offset, double cost) override {
+        KU_ASSERT(curData != nullptr);
+        if (curData->contains(offset)) {
+            curData->at(offset) = cost;
+        } else {
+            curData->insert({offset, cost});
+        }
+    }
+
+    bool tryReplaceWithMinCost(offset_t offset, double newCost) override {
+        auto curCost = getCost(offset);
+        if (newCost < curCost) {
+            setCost(offset, newCost);
+            return true;
+        }
+        return false;
+    }
+
+    double getCost(offset_t offset) override {
+        KU_ASSERT(curData != nullptr);
+        if (curData->contains(offset)) {
+            return curData->at(offset);
+        }
+        return std::numeric_limits<double>::max();
+    }
+
+private:
+    std::unordered_map<offset_t, double>* curData = nullptr;
+    GDSSpareObjectManager<double>& sparseObjects;
+};
+
+class DenseCostsReference : public Costs {
+public:
+    explicit DenseCostsReference(GDSDenseObjectManager<std::atomic<double>>& denseObjects)
+        : denseObjects{denseObjects} {}
+
+    void pinTableID(table_id_t tableID) override { curData = denseObjects.getData(tableID); }
+
+    void setCost(offset_t offset, double cost) override {
+        KU_ASSERT(curData != nullptr);
+        curData[offset].store(cost, std::memory_order_relaxed);
+    }
+
+    bool tryReplaceWithMinCost(offset_t offset, double newCost) override {
+        auto curCost = getCost(offset);
+        while (newCost < curCost) {
+            if (curData[offset].compare_exchange_strong(curCost, newCost)) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    double getCost(offset_t offset) override {
+        KU_ASSERT(curData != nullptr);
+        return curData[offset].load(std::memory_order_relaxed);
+    }
+
+private:
+    table_id_map_t<offset_t> nodeMaxOffsetMap;
+    std::atomic<double>* curData = nullptr;
+    GDSDenseObjectManager<std::atomic<double>>& denseObjects;
+};
+
+class CostsPair {
+public:
+    explicit CostsPair(const table_id_map_t<offset_t>& maxOffsetMap)
+        : maxOffsetMap{maxOffsetMap}, densityState{GDSDensityState::SPARSE},
+          sparseObjects{maxOffsetMap} {
+        curSparseCosts = std::make_unique<SparseCostsReference>(sparseObjects);
+        nextSparseCosts = std::make_unique<SparseCostsReference>(sparseObjects);
+        denseObjects = GDSDenseObjectManager<std::atomic<double>>();
+        curDenseCosts = std::make_unique<DenseCostsReference>(denseObjects);
+        nextDenseCosts = std::make_unique<DenseCostsReference>(denseObjects);
+    }
+
+    Costs* getCurrentCosts() { return curCosts; }
+
+    void pinCurTableID(table_id_t tableID) {
+        switch (densityState) {
+        case GDSDensityState::SPARSE: {
+            curSparseCosts->pinTableID(tableID);
+            curCosts = curSparseCosts.get();
+        } break;
+        case GDSDensityState::DENSE: {
+            curDenseCosts->pinTableID(tableID);
+            curCosts = curDenseCosts.get();
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+
+    void pinNextTableID(table_id_t tableID) {
+        switch (densityState) {
+        case GDSDensityState::SPARSE: {
+            nextSparseCosts->pinTableID(tableID);
+            nextCosts = nextSparseCosts.get();
+        } break;
+        case GDSDensityState::DENSE: {
+            nextDenseCosts->pinTableID(tableID);
+            nextCosts = nextDenseCosts.get();
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+
+    // CAS update nbrOffset if new path from boundOffset has a smaller cost.
+    bool update(offset_t boundOffset, offset_t nbrOffset, double val) {
+        KU_ASSERT(curCosts && nextCosts);
+        auto newCost = curCosts->getCost(boundOffset) + val;
+        return nextCosts->tryReplaceWithMinCost(nbrOffset, newCost);
+    }
+
+    void switchToDense(ExecutionContext* context) {
+        KU_ASSERT(densityState == GDSDensityState::SPARSE);
+        densityState = GDSDensityState::DENSE;
+        auto mm = MemoryManager::Get(*context->clientContext);
+        for (auto& [tableID, maxOffset] : maxOffsetMap) {
+            denseObjects.allocate(tableID, maxOffset, mm);
+            auto data = denseObjects.getData(tableID);
+            for (auto i = 0u; i < maxOffset; i++) {
+                data[i].store(std::numeric_limits<double>::max());
+            }
+        }
+        for (auto& [tableID, map] : sparseObjects.getData()) {
+            auto data = denseObjects.getData(tableID);
+            for (auto& [offset, cost] : map) {
+                data[offset].store(cost);
+            }
+        }
+    }
+
+private:
+    table_id_map_t<offset_t> maxOffsetMap;
+    GDSDensityState densityState;
+    GDSSpareObjectManager<double> sparseObjects;
+    std::unique_ptr<SparseCostsReference> curSparseCosts;
+    std::unique_ptr<SparseCostsReference> nextSparseCosts;
+    GDSDenseObjectManager<std::atomic<double>> denseObjects;
+    std::unique_ptr<DenseCostsReference> curDenseCosts;
+    std::unique_ptr<DenseCostsReference> nextDenseCosts;
+
+    Costs* curCosts = nullptr;
+    Costs* nextCosts = nullptr;
+};
+
+template<typename T>
+class WSPDestinationsEdgeCompute : public EdgeCompute {
+public:
+    explicit WSPDestinationsEdgeCompute(CostsPair* costsPair) : costsPair{costsPair} {}
+
+    std::vector<nodeID_t> edgeCompute(nodeID_t boundNodeID, graph::NbrScanState::Chunk& chunk,
+        bool) override {
+        std::vector<nodeID_t> result;
+        chunk.forEach([&](auto neighbors, auto propertyVectors, auto i) {
+            auto nbrNodeID = neighbors[i];
+            auto weight = propertyVectors[0]->template getValue<T>(i);
+            WeightUtils::checkWeight(WeightedSPDestinationsFunction::name, weight);
+            if (costsPair->update(boundNodeID.offset, nbrNodeID.offset,
+                    static_cast<double>(weight))) {
+                result.push_back(nbrNodeID);
+            }
+        });
+        return result;
+    }
+
+    std::unique_ptr<EdgeCompute> copy() override {
+        return std::make_unique<WSPDestinationsEdgeCompute<T>>(costsPair);
+    }
+
+private:
+    CostsPair* costsPair;
+};
+
+class WSPDestinationsAuxiliaryState : public GDSAuxiliaryState {
+public:
+    explicit WSPDestinationsAuxiliaryState(std::unique_ptr<CostsPair> costsPair)
+        : costsPair{std::move(costsPair)} {}
+
+    Costs* getCosts() { return costsPair->getCurrentCosts(); }
+
+    void initSource(nodeID_t sourceNodeID) override {
+        costsPair->pinCurTableID(sourceNodeID.tableID);
+        costsPair->getCurrentCosts()->setCost(sourceNodeID.offset, 0);
+    }
+
+    void beginFrontierCompute(table_id_t fromTableID, table_id_t toTableID) override {
+        costsPair->pinCurTableID(fromTableID);
+        costsPair->pinNextTableID(toTableID);
+    }
+
+    void switchToDense(ExecutionContext* context, graph::Graph*) override {
+        costsPair->switchToDense(context);
+    }
+
+private:
+    std::unique_ptr<CostsPair> costsPair;
+};
+
+class WSPDestinationsOutputWriter : public RJOutputWriter {
+public:
+    WSPDestinationsOutputWriter(main::ClientContext* context, NodeOffsetMaskMap* outputNodeMask,
+        nodeID_t sourceNodeID, Costs* costs, const table_id_map_t<offset_t>& maxOffsetMap)
+        : RJOutputWriter{context, outputNodeMask, sourceNodeID}, costs{costs},
+          maxOffsetMap{maxOffsetMap} {
+        costVector = createVector(LogicalType::DOUBLE());
+    }
+
+    void beginWritingInternal(table_id_t tableID) override { costs->pinTableID(tableID); }
+
+    void write(FactorizedTable& fTable, table_id_t tableID, LimitCounter* counter) override {
+        for (auto i = 0u; i < maxOffsetMap.at(tableID); ++i) {
+            write(fTable, {i, tableID}, counter);
+        }
+    }
+
+    void write(FactorizedTable& fTable, nodeID_t dstNodeID, LimitCounter* counter) override {
+        if (!inOutputNodeMask(dstNodeID.offset)) { // Skip dst if it not is in scope.
+            return;
+        }
+        if (dstNodeID == sourceNodeID_) { // Skip writing source node.
+            return;
+        }
+        dstNodeIDVector->setValue<nodeID_t>(0, dstNodeID);
+        auto cost = costs->getCost(dstNodeID.offset);
+        if (cost == std::numeric_limits<double>::max()) { // Skip if dst is not visited.
+            return;
+        }
+        costVector->setValue<double>(0, cost);
+        fTable.append(vectors);
+        if (counter != nullptr) {
+            counter->increase(1);
+        }
+    }
+
+    std::unique_ptr<RJOutputWriter> copy() override {
+        return std::make_unique<WSPDestinationsOutputWriter>(context, outputNodeMask, sourceNodeID_,
+            costs, maxOffsetMap);
+    }
+
+private:
+    Costs* costs;
+    std::unique_ptr<ValueVector> costVector;
+    table_id_map_t<offset_t> maxOffsetMap;
+};
+
+class WeightedSPDestinationsAlgorithm : public RJAlgorithm {
+public:
+    std::string getFunctionName() const override { return WeightedSPDestinationsFunction::name; }
+
+    // return srcNodeID, dstNodeID, weight
+    expression_vector getResultColumns(const RJBindData& bindData) const override {
+        expression_vector columns;
+        columns.push_back(bindData.nodeInput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.nodeOutput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.weightOutputExpr);
+        return columns;
+    }
+
+    std::unique_ptr<RJAlgorithm> copy() const override {
+        return std::make_unique<WeightedSPDestinationsAlgorithm>(*this);
+    }
+
+private:
+    std::unique_ptr<GDSComputeState> getComputeState(ExecutionContext* context,
+        const RJBindData& bindData, RecursiveExtendSharedState* sharedState) override {
+        auto clientContext = context->clientContext;
+        auto graph = sharedState->graph.get();
+        auto curDenseFrontier = DenseFrontier::getUninitializedFrontier(context, graph);
+        auto nextDenseFrontier = DenseFrontier::getUninitializedFrontier(context, graph);
+        auto frontierPair = std::make_unique<DenseSparseDynamicFrontierPair>(
+            std::move(curDenseFrontier), std::move(nextDenseFrontier));
+        auto costsPair = std::make_unique<CostsPair>(
+            graph->getMaxOffsetMap(transaction::Transaction::Get(*clientContext)));
+        auto costPairPtr = costsPair.get();
+        auto auxiliaryState = std::make_unique<WSPDestinationsAuxiliaryState>(std::move(costsPair));
+        std::unique_ptr<GDSComputeState> gdsState;
+        WeightUtils::visit(WeightedSPDestinationsFunction::name,
+            bindData.weightPropertyExpr->getDataType(), [&]<typename T>(T) {
+                auto edgeCompute = std::make_unique<WSPDestinationsEdgeCompute<T>>(costPairPtr);
+                gdsState = std::make_unique<GDSComputeState>(std::move(frontierPair),
+                    std::move(edgeCompute), std::move(auxiliaryState));
+            });
+        return gdsState;
+    }
+
+    std::unique_ptr<RJOutputWriter> getOutputWriter(ExecutionContext* context, const RJBindData&,
+        GDSComputeState& computeState, nodeID_t sourceNodeID,
+        RecursiveExtendSharedState* sharedState) override {
+        auto costs =
+            computeState.auxiliaryState->ptrCast<WSPDestinationsAuxiliaryState>()->getCosts();
+        auto clientContext = context->clientContext;
+        return std::make_unique<WSPDestinationsOutputWriter>(clientContext,
+            sharedState->getOutputNodeMaskMap(), sourceNodeID, costs,
+            sharedState->graph->getMaxOffsetMap(transaction::Transaction::Get(*clientContext)));
+    }
+};
+
+std::unique_ptr<RJAlgorithm> WeightedSPDestinationsFunction::getAlgorithm() {
+    return std::make_unique<WeightedSPDestinationsAlgorithm>();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/wsp_paths.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/wsp_paths.cpp
new file mode 100644
index 0000000000..03eb73e015
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/gds/wsp_paths.cpp
@@ -0,0 +1,155 @@
+#include "binder/binder.h"
+#include "function/gds/auxiliary_state/path_auxiliary_state.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/rec_joins.h"
+#include "function/gds/weight_utils.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::processor;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+template<typename T>
+class WSPPathsEdgeCompute : public EdgeCompute {
+public:
+    explicit WSPPathsEdgeCompute(BFSGraphManager* bfsGraphManager)
+        : bfsGraphManager{bfsGraphManager} {
+        block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+    }
+
+    std::vector<nodeID_t> edgeCompute(nodeID_t boundNodeID, graph::NbrScanState::Chunk& chunk,
+        bool fwdEdge) override {
+        std::vector<nodeID_t> result;
+        chunk.forEach([&](auto neighbors, auto propertyVectors, auto i) {
+            auto nbrNodeID = neighbors[i];
+            auto edgeID = propertyVectors[0]->template getValue<relID_t>(i);
+            auto weight = propertyVectors[1]->template getValue<T>(i);
+            WeightUtils::checkWeight(WeightedSPPathsFunction::name, weight);
+            if (!block->hasSpace()) {
+                block = bfsGraphManager->getCurrentGraph()->addNewBlock();
+            }
+            if (bfsGraphManager->getCurrentGraph()->tryAddSingleParentWithWeight(boundNodeID,
+                    edgeID, nbrNodeID, fwdEdge, static_cast<double>(weight), block)) {
+                result.push_back(nbrNodeID);
+            }
+        });
+        return result;
+    }
+
+    std::unique_ptr<EdgeCompute> copy() override {
+        return std::make_unique<WSPPathsEdgeCompute<T>>(bfsGraphManager);
+    }
+
+private:
+    BFSGraphManager* bfsGraphManager;
+    ObjectBlock<ParentList>* block = nullptr;
+};
+
+class WSPPathsOutputWriter : public PathsOutputWriter {
+public:
+    WSPPathsOutputWriter(main::ClientContext* context, NodeOffsetMaskMap* outputNodeMask,
+        nodeID_t sourceNodeID, PathsOutputWriterInfo info, BaseBFSGraph& bfsGraph)
+        : PathsOutputWriter{context, outputNodeMask, sourceNodeID, info, bfsGraph} {
+        costVector = createVector(LogicalType::DOUBLE());
+    }
+
+    void writeInternal(FactorizedTable& fTable, nodeID_t dstNodeID,
+        LimitCounter* counter) override {
+        if (dstNodeID == sourceNodeID_) { // Skip writing source node.
+            return;
+        }
+        auto parent = bfsGraph.getParentListHead(dstNodeID.offset);
+        if (parent == nullptr) { // Skip if dst is not visited.
+            return;
+        }
+        costVector->setValue<double>(0, parent->getCost());
+        std::vector<ParentList*> curPath;
+        curPath.push_back(parent);
+        while (parent->getCost() != 0) {
+            parent = bfsGraph.getParentListHead(parent->getNodeID());
+            curPath.push_back(parent);
+        }
+        curPath.pop_back();
+        writePath(curPath);
+        fTable.append(vectors);
+        updateCounterAndTerminate(counter);
+    }
+
+    std::unique_ptr<RJOutputWriter> copy() override {
+        return std::make_unique<WSPPathsOutputWriter>(context, outputNodeMask, sourceNodeID_, info,
+            bfsGraph);
+    }
+
+private:
+    std::unique_ptr<ValueVector> costVector;
+};
+
+class WeightedSPPathsAlgorithm : public RJAlgorithm {
+public:
+    std::string getFunctionName() const override { return WeightedSPPathsFunction::name; }
+
+    // return srcNodeID, dstNodeID, length, [direction], pathNodeIDs, pathEdgeIDs, weight
+    binder::expression_vector getResultColumns(const RJBindData& bindData) const override {
+        expression_vector columns;
+        columns.push_back(bindData.nodeInput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.nodeOutput->constCast<NodeExpression>().getInternalID());
+        columns.push_back(bindData.lengthExpr);
+        if (bindData.extendDirection == ExtendDirection::BOTH) {
+            columns.push_back(bindData.directionExpr);
+        }
+        columns.push_back(bindData.pathNodeIDsExpr);
+        columns.push_back(bindData.pathEdgeIDsExpr);
+        columns.push_back(bindData.weightOutputExpr);
+        return columns;
+    }
+
+    std::unique_ptr<RJAlgorithm> copy() const override {
+        return std::make_unique<WeightedSPPathsAlgorithm>(*this);
+    }
+
+private:
+    std::unique_ptr<GDSComputeState> getComputeState(ExecutionContext* context,
+        const RJBindData& bindData, RecursiveExtendSharedState* sharedState) override {
+        auto clientContext = context->clientContext;
+        auto graph = sharedState->graph.get();
+        auto curDenseFrontier = DenseFrontier::getUninitializedFrontier(context, graph);
+        auto nextDenseFrontier = DenseFrontier::getUninitializedFrontier(context, graph);
+        auto frontierPair = std::make_unique<DenseSparseDynamicFrontierPair>(
+            std::move(curDenseFrontier), std::move(nextDenseFrontier));
+        auto bfsGraph = std::make_unique<BFSGraphManager>(
+            sharedState->graph->getMaxOffsetMap(transaction::Transaction::Get(*clientContext)),
+            MemoryManager::Get(*clientContext));
+        std::unique_ptr<GDSComputeState> gdsState;
+        WeightUtils::visit(WeightedSPPathsFunction::name,
+            bindData.weightPropertyExpr->getDataType(), [&]<typename T>(T) {
+                auto edgeCompute = std::make_unique<WSPPathsEdgeCompute<T>>(bfsGraph.get());
+                auto auxiliaryState = std::make_unique<WSPPathsAuxiliaryState>(std::move(bfsGraph));
+                gdsState = std::make_unique<GDSComputeState>(std::move(frontierPair),
+                    std::move(edgeCompute), std::move(auxiliaryState));
+            });
+        return gdsState;
+    }
+
+    std::unique_ptr<RJOutputWriter> getOutputWriter(ExecutionContext* context,
+        const RJBindData& bindData, GDSComputeState& computeState, nodeID_t sourceNodeID,
+        RecursiveExtendSharedState* sharedState) override {
+        auto bfsGraph = computeState.auxiliaryState->ptrCast<WSPPathsAuxiliaryState>()
+                            ->getBFSGraphManager()
+                            ->getCurrentGraph();
+        auto writerInfo = bindData.getPathWriterInfo();
+        return std::make_unique<WSPPathsOutputWriter>(context->clientContext,
+            sharedState->getOutputNodeMaskMap(), sourceNodeID, writerInfo, *bfsGraph);
+    }
+};
+
+std::unique_ptr<RJAlgorithm> WeightedSPPathsFunction::getAlgorithm() {
+    return std::make_unique<WeightedSPPathsAlgorithm>();
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/internal_id/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/internal_id/CMakeLists.txt
new file mode 100644
index 0000000000..40d38818c3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/internal_id/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_function_internal_id
+        OBJECT
+        internal_id_creation_function.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_internal_id>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/internal_id/internal_id_creation_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/internal_id/internal_id_creation_function.cpp
new file mode 100644
index 0000000000..62f865d0c5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/internal_id/internal_id_creation_function.cpp
@@ -0,0 +1,37 @@
+#include "common/type_utils.h"
+#include "common/types/types.h"
+#include "function/internal_id/vector_internal_id_functions.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+using namespace common;
+
+struct InternalIDCreation {
+    template<typename T>
+    static void operation(T& tableID, T& offset, internalID_t& result) {
+        result = internalID_t((offset_t)offset, (offset_t)tableID);
+    }
+};
+
+function_set InternalIDCreationFunction::getFunctionSet() {
+    function_set result;
+    function::scalar_func_exec_t execFunc;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        common::TypeUtils::visit(
+            common::LogicalType(typeID),
+            [&]<common::NumericTypes T>(T) {
+                execFunc =
+                    ScalarFunction::BinaryExecFunction<T, T, internalID_t, InternalIDCreation>;
+            },
+            [](auto) { KU_UNREACHABLE; });
+        result.push_back(std::make_unique<ScalarFunction>(name,
+            std::vector<common::LogicalTypeID>{typeID, typeID}, LogicalTypeID::INTERNAL_ID,
+            execFunc));
+    }
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/CMakeLists.txt
new file mode 100644
index 0000000000..aa8250b934
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/CMakeLists.txt
@@ -0,0 +1,33 @@
+add_library(lbug_list_function
+        OBJECT
+        list_agg_function.cpp
+        list_any_value_function.cpp
+        list_any.cpp
+        list_all.cpp
+        list_append_function.cpp
+        list_concat_function.cpp
+        list_contains_function.cpp
+        list_creation.cpp
+        list_distinct_function.cpp
+        list_extract_function.cpp
+        list_range_function.cpp
+        list_reverse_function.cpp
+        list_slice_function.cpp
+        list_sort_function.cpp
+        list_to_string_function.cpp
+        list_unique_function.cpp
+        list_prepend_function.cpp
+        list_position_function.cpp
+        list_transform.cpp
+        list_filter.cpp
+        list_function_utils.cpp
+        list_reduce.cpp
+        list_none.cpp
+        list_single.cpp
+        size_function.cpp
+        quantifier_functions.cpp
+        list_has_all.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_list_function>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_agg_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_agg_function.cpp
new file mode 100644
index 0000000000..2b33b27071
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_agg_function.cpp
@@ -0,0 +1,77 @@
+#include "common/exception/binder.h"
+#include "common/type_utils.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+template<typename OPERATION>
+static std::unique_ptr<FunctionBindData> bindFuncListAggr(const ScalarBindFuncInput& input) {
+    auto scalarFunction = input.definition->ptrCast<ScalarFunction>();
+    const auto& resultType = ListType::getChildType(input.arguments[0]->dataType);
+    TypeUtils::visit(
+        resultType,
+        [&scalarFunction]<NumericTypes T>(T) {
+            scalarFunction->execFunc =
+                ScalarFunction::UnaryExecNestedTypeFunction<list_entry_t, T, OPERATION>;
+        },
+        [&input, &resultType](auto) {
+            throw BinderException(stringFormat("Unsupported inner data type for {}: {}",
+                input.definition->name, LogicalTypeUtils::toString(resultType.getLogicalTypeID())));
+        });
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+}
+
+struct ListSum {
+    template<typename T>
+    static void operation(common::list_entry_t& input, T& result, common::ValueVector& inputVector,
+        common::ValueVector& /*resultVector*/) {
+        auto inputDataVector = common::ListVector::getDataVector(&inputVector);
+        result = 0;
+        for (auto i = 0u; i < input.size; i++) {
+            if (inputDataVector->isNull(input.offset + i)) {
+                continue;
+            }
+            result += inputDataVector->getValue<T>(input.offset + i);
+        }
+    }
+};
+
+function_set ListSumFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST}, LogicalTypeID::INT64);
+    function->bindFunc = bindFuncListAggr<ListSum>;
+    result.push_back(std::move(function));
+    return result;
+}
+
+struct ListProduct {
+    template<typename T>
+    static void operation(common::list_entry_t& input, T& result, common::ValueVector& inputVector,
+        common::ValueVector& /*resultVector*/) {
+        auto inputDataVector = common::ListVector::getDataVector(&inputVector);
+        result = 1;
+        for (auto i = 0u; i < input.size; i++) {
+            if (inputDataVector->isNull(input.offset + i)) {
+                continue;
+            }
+            result *= inputDataVector->getValue<T>(input.offset + i);
+        }
+    }
+};
+
+function_set ListProductFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST}, LogicalTypeID::INT64);
+    function->bindFunc = bindFuncListAggr<ListProduct>;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_all.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_all.cpp
new file mode 100644
index 0000000000..9141c7b3bc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_all.cpp
@@ -0,0 +1,26 @@
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+bool allHandler(uint64_t numSelectedValues, uint64_t originalSize) {
+    return numSelectedValues == originalSize;
+}
+
+function_set ListAllFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::BOOL,
+        std::bind(execQuantifierFunc, allHandler, std::placeholders::_1, std::placeholders::_2,
+            std::placeholders::_3, std::placeholders::_4, std::placeholders::_5));
+    function->bindFunc = bindQuantifierFunc;
+    function->isListLambda = true;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_any.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_any.cpp
new file mode 100644
index 0000000000..aceb140526
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_any.cpp
@@ -0,0 +1,26 @@
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+bool anyHandler(uint64_t numSelectedValues, uint64_t /*originalSize*/) {
+    return numSelectedValues > 0;
+}
+
+function_set ListAnyFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::BOOL,
+        std::bind(execQuantifierFunc, anyHandler, std::placeholders::_1, std::placeholders::_2,
+            std::placeholders::_3, std::placeholders::_4, std::placeholders::_5));
+    function->bindFunc = bindQuantifierFunc;
+    function->isListLambda = true;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_any_value_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_any_value_function.cpp
new file mode 100644
index 0000000000..03bac730bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_any_value_function.cpp
@@ -0,0 +1,49 @@
+#include "common/type_utils.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct ListAnyValue {
+    template<typename T>
+    static void operation(common::list_entry_t& input, T& result, common::ValueVector& inputVector,
+        common::ValueVector& resultVector) {
+        auto inputValues = common::ListVector::getListValues(&inputVector, input);
+        auto inputDataVector = common::ListVector::getDataVector(&inputVector);
+        auto numBytesPerValue = inputDataVector->getNumBytesPerValue();
+
+        for (auto i = 0u; i < input.size; i++) {
+            if (!(inputDataVector->isNull(input.offset + i))) {
+                resultVector.copyFromVectorData(reinterpret_cast<uint8_t*>(&result),
+                    inputDataVector, inputValues);
+                break;
+            }
+            inputValues += numBytesPerValue;
+        }
+    }
+};
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    auto scalarFunction = ku_dynamic_cast<ScalarFunction*>(input.definition);
+    const auto& resultType = ListType::getChildType(input.arguments[0]->dataType);
+    TypeUtils::visit(resultType.getPhysicalType(), [&scalarFunction]<typename T>(T) {
+        scalarFunction->execFunc =
+            ScalarFunction::UnaryExecNestedTypeFunction<list_entry_t, T, ListAnyValue>;
+    });
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+}
+
+function_set ListAnyValueFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST}, LogicalTypeID::ANY);
+    function->bindFunc = bindFunc;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_append_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_append_function.cpp
new file mode 100644
index 0000000000..281bc048ff
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_append_function.cpp
@@ -0,0 +1,69 @@
+#include "common/exception/binder.h"
+#include "common/exception/message.h"
+#include "common/type_utils.h"
+#include "common/types/types.h"
+#include "function/function.h"
+#include "function/list/functions/list_function_utils.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct ListAppend {
+    template<typename T>
+    static void operation(common::list_entry_t& listEntry, T& value, common::list_entry_t& result,
+        common::ValueVector& listVector, common::ValueVector& valueVector,
+        common::ValueVector& resultVector) {
+        result = common::ListVector::addList(&resultVector, listEntry.size + 1);
+        auto listDataVector = common::ListVector::getDataVector(&listVector);
+        auto listPos = listEntry.offset;
+        auto resultDataVector = common::ListVector::getDataVector(&resultVector);
+        auto resultPos = result.offset;
+        for (auto i = 0u; i < listEntry.size; i++) {
+            resultDataVector->copyFromVectorData(resultPos++, listDataVector, listPos++);
+        }
+        resultDataVector->copyFromVectorData(
+            resultDataVector->getData() + resultPos * resultDataVector->getNumBytesPerValue(),
+            &valueVector, reinterpret_cast<uint8_t*>(&value));
+    }
+};
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+
+    std::vector<LogicalType> types;
+    types.push_back(input.arguments[0]->getDataType().copy());
+    types.push_back(input.arguments[1]->getDataType().copy());
+
+    using resolver = ListTypeResolver<ListOp::Append>;
+    ListFunctionUtils::resolveTypes(input, types, resolver::anyEmpty, resolver::anyEmpty,
+        resolver::anyEmpty, resolver::finalResolver, resolver::bothNull, resolver::leftNull,
+        resolver::rightNull, resolver::finalResolver);
+
+    if (types[0].getLogicalTypeID() != LogicalTypeID::ANY &&
+        types[1] != ListType::getChildType(types[0])) {
+        throw BinderException(ExceptionMessage::listFunctionIncompatibleChildrenType(
+            ListAppendFunction::name, types[0].toString(), types[1].toString()));
+    }
+
+    auto scalarFunction = input.definition->ptrCast<ScalarFunction>();
+    TypeUtils::visit(types[1].getPhysicalType(), [&scalarFunction]<typename T>(T) {
+        scalarFunction->execFunc =
+            ScalarFunction::BinaryExecListStructFunction<list_entry_t, T, list_entry_t, ListAppend>;
+    });
+    return std::make_unique<FunctionBindData>(std::move(types), types[0].copy());
+}
+
+function_set ListAppendFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::LIST);
+    function->bindFunc = bindFunc;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_concat_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_concat_function.cpp
new file mode 100644
index 0000000000..9605234a2c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_concat_function.cpp
@@ -0,0 +1,62 @@
+#include "function/list/functions/list_concat_function.h"
+
+#include "common/exception/binder.h"
+#include "common/exception/message.h"
+#include "function/list/functions/list_function_utils.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+void ListConcat::operation(common::list_entry_t& left, common::list_entry_t& right,
+    common::list_entry_t& result, common::ValueVector& leftVector, common::ValueVector& rightVector,
+    common::ValueVector& resultVector) {
+    result = common::ListVector::addList(&resultVector, left.size + right.size);
+    auto resultDataVector = common::ListVector::getDataVector(&resultVector);
+    auto resultPos = result.offset;
+    auto leftDataVector = common::ListVector::getDataVector(&leftVector);
+    auto leftPos = left.offset;
+    for (auto i = 0u; i < left.size; i++) {
+        resultDataVector->copyFromVectorData(resultPos++, leftDataVector, leftPos++);
+    }
+    auto rightDataVector = common::ListVector::getDataVector(&rightVector);
+    auto rightPos = right.offset;
+    for (auto i = 0u; i < right.size; i++) {
+        resultDataVector->copyFromVectorData(resultPos++, rightDataVector, rightPos++);
+    }
+}
+
+std::unique_ptr<FunctionBindData> ListConcatFunction::bindFunc(const ScalarBindFuncInput& input) {
+    std::vector<LogicalType> types;
+    types.push_back(input.arguments[0]->getDataType().copy());
+    types.push_back(input.arguments[1]->getDataType().copy());
+
+    using resolver = ListTypeResolver<ListOp::Concat>;
+    ListFunctionUtils::resolveTypes(input, types, resolver::leftEmpty, resolver::leftEmpty,
+        resolver::rightEmpty, resolver::finalResolver, resolver::bothNull, resolver::leftEmpty,
+        resolver::rightEmpty, resolver::finalResolver);
+
+    if (types[0] != types[1]) {
+        throw BinderException(ExceptionMessage::listFunctionIncompatibleChildrenType(name,
+            types[0].toString(), types[1].toString()));
+    }
+    return std::make_unique<FunctionBindData>(std::move(types), types[0].copy());
+}
+
+function_set ListConcatFunction::getFunctionSet() {
+    function_set result;
+    auto execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t,
+        list_entry_t, ListConcat>;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::LIST}, LogicalTypeID::LIST,
+        execFunc);
+    function->bindFunc = bindFunc;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_contains_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_contains_function.cpp
new file mode 100644
index 0000000000..24064ce53e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_contains_function.cpp
@@ -0,0 +1,68 @@
+#include "binder/expression/expression_util.h"
+#include "common/exception/binder.h"
+#include "common/type_utils.h"
+#include "function/list/functions/list_position_function.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+struct ListContains {
+    template<typename T>
+    static void operation(common::list_entry_t& list, T& element, uint8_t& result,
+        common::ValueVector& listVector, common::ValueVector& elementVector,
+        common::ValueVector& resultVector) {
+        int64_t pos = 0;
+        ListPosition::operation(list, element, pos, listVector, elementVector, resultVector);
+        result = (pos != 0);
+    }
+};
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    auto scalarFunction = input.definition->ptrCast<ScalarFunction>();
+    // for list_contains(list, input), we expect input and list child have the same type, if list
+    // is empty, we use in the input type. Otherwise, we use list child type because casting list
+    // is more expensive.
+    std::vector<LogicalType> paramTypes;
+    LogicalType childType;
+    auto listExpr = input.arguments[0];
+    auto elementExpr = input.arguments[1];
+    if (ExpressionUtil::isEmptyList(*listExpr)) {
+        childType = elementExpr->getDataType().copy();
+    } else {
+        auto& listChildType = ListType::getChildType(listExpr->getDataType());
+        auto& elementType = elementExpr->getDataType();
+        if (!LogicalTypeUtils::tryGetMaxLogicalType(listChildType, elementType, childType)) {
+            throw BinderException(
+                stringFormat("Cannot compare {} and {} in list_contains function.",
+                    listChildType.toString(), elementType.toString()));
+        }
+    }
+    if (childType.getLogicalTypeID() == LogicalTypeID::ANY) {
+        childType = LogicalType::STRING();
+    }
+    auto listType = LogicalType::LIST(childType.copy());
+    paramTypes.push_back(listType.copy());
+    paramTypes.push_back(childType.copy());
+    TypeUtils::visit(childType.getPhysicalType(), [&scalarFunction]<typename T>(T) {
+        scalarFunction->execFunc =
+            ScalarFunction::BinaryExecListStructFunction<list_entry_t, T, uint8_t, ListContains>;
+    });
+    return std::make_unique<FunctionBindData>(std::move(paramTypes), LogicalType::BOOL());
+}
+
+function_set ListContainsFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::BOOL);
+    function->bindFunc = bindFunc;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_creation.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_creation.cpp
new file mode 100644
index 0000000000..a163a7d7be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_creation.cpp
@@ -0,0 +1,56 @@
+#include "binder/expression/expression_util.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+void ListCreationFunction::execFunc(
+    const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+    const std::vector<common::SelectionVector*>& parameterSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* /*dataPtr*/) {
+    result.resetAuxiliaryBuffer();
+    for (auto selectedPos = 0u; selectedPos < resultSelVector->getSelSize(); ++selectedPos) {
+        auto pos = (*resultSelVector)[selectedPos];
+        auto resultEntry = ListVector::addList(&result, parameters.size());
+        result.setValue(pos, resultEntry);
+        auto resultDataVector = ListVector::getDataVector(&result);
+        auto resultPos = resultEntry.offset;
+        for (auto i = 0u; i < parameters.size(); i++) {
+            const auto& parameter = parameters[i];
+            const auto& parameterSelVector = *parameterSelVectors[i];
+            auto paramPos = parameter->state->isFlat() ? parameterSelVector[0] : pos;
+            resultDataVector->copyFromVectorData(resultPos++, parameter.get(), paramPos);
+        }
+    }
+}
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    LogicalType combinedType(LogicalTypeID::ANY);
+    binder::ExpressionUtil::tryCombineDataType(input.arguments, combinedType);
+    if (combinedType.getLogicalTypeID() == LogicalTypeID::ANY) {
+        combinedType = LogicalType::INT64();
+    }
+    auto resultType = LogicalType::LIST(combinedType.copy());
+    auto bindData = std::make_unique<FunctionBindData>(std::move(resultType));
+    for (auto& _ : input.arguments) {
+        (void)_;
+        bindData->paramTypes.push_back(combinedType.copy());
+    }
+    return bindData;
+}
+
+function_set ListCreationFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ANY}, LogicalTypeID::LIST, execFunc);
+    function->bindFunc = bindFunc;
+    function->isVarLength = true;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_distinct_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_distinct_function.cpp
new file mode 100644
index 0000000000..84e1b70cfa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_distinct_function.cpp
@@ -0,0 +1,43 @@
+#include "function/list/functions/list_unique_function.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct ListDistinct {
+    static void operation(common::list_entry_t& input, common::list_entry_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector) {
+        auto numUniqueValues = ListUnique::appendListElementsToValueSet(input, inputVector);
+        result = common::ListVector::addList(&resultVector, numUniqueValues);
+        auto resultDataVector = common::ListVector::getDataVector(&resultVector);
+        auto resultDataVectorBuffer =
+            common::ListVector::getListValuesWithOffset(&resultVector, result, 0 /* offset */);
+        ListUnique::appendListElementsToValueSet(input, inputVector, nullptr,
+            [&resultDataVector, &resultDataVectorBuffer](common::ValueVector& dataVector,
+                uint64_t pos) -> void {
+                resultDataVector->copyFromVectorData(resultDataVectorBuffer, &dataVector,
+                    dataVector.getData() + pos * dataVector.getNumBytesPerValue());
+                resultDataVectorBuffer += dataVector.getNumBytesPerValue();
+            });
+    }
+};
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    return FunctionBindData::getSimpleBindData(input.arguments, input.arguments[0]->getDataType());
+}
+
+function_set ListDistinctFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST}, LogicalTypeID::LIST,
+        ScalarFunction::UnaryExecNestedTypeFunction<list_entry_t, list_entry_t, ListDistinct>);
+    function->bindFunc = bindFunc;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_extract_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_extract_function.cpp
new file mode 100644
index 0000000000..1efe243719
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_extract_function.cpp
@@ -0,0 +1,55 @@
+#include "function/list/functions/list_extract_function.h"
+
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+static void BinaryExecListExtractFunction(
+    const std::vector<std::shared_ptr<common::ValueVector>>& params,
+    const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* dataPtr = nullptr) {
+    KU_ASSERT(params.size() == 2);
+    BinaryFunctionExecutor::executeSwitch<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC,
+        BinaryListExtractFunctionWrapper>(*params[0], paramSelVectors[0], *params[1],
+        paramSelVectors[1], result, resultSelVector, dataPtr);
+}
+
+static std::unique_ptr<FunctionBindData> ListExtractBindFunc(const ScalarBindFuncInput& input) {
+    const auto& resultType = ListType::getChildType(input.arguments[0]->dataType);
+    auto scalarFunction = input.definition->ptrCast<ScalarFunction>();
+    TypeUtils::visit(resultType.getPhysicalType(), [&scalarFunction]<typename T>(T) {
+        scalarFunction->execFunc =
+            BinaryExecListExtractFunction<list_entry_t, int64_t, T, ListExtract>;
+    });
+    std::vector<LogicalType> paramTypes;
+    paramTypes.push_back(input.arguments[0]->getDataType().copy());
+    paramTypes.push_back(LogicalType(input.definition->parameterTypeIDs[1]));
+    return std::make_unique<FunctionBindData>(std::move(paramTypes), resultType.copy());
+}
+
+function_set ListExtractFunction::getFunctionSet() {
+    function_set result;
+    std::unique_ptr<ScalarFunction> func;
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::INT64}, LogicalTypeID::ANY);
+    func->bindFunc = ListExtractBindFunc;
+    result.push_back(std::move(func));
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64},
+        LogicalTypeID::STRING,
+        ScalarFunction::BinaryExecFunction<ku_string_t, int64_t, ku_string_t, ListExtract>);
+    result.push_back(std::move(func));
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ARRAY, LogicalTypeID::INT64}, LogicalTypeID::ANY);
+    func->bindFunc = ListExtractBindFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_filter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_filter.cpp
new file mode 100644
index 0000000000..c0cf43dbbf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_filter.cpp
@@ -0,0 +1,134 @@
+#include "common/exception/binder.h"
+#include "expression_evaluator/lambda_evaluator.h"
+#include "expression_evaluator/list_slice_info.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    if (input.arguments[1]->expressionType != ExpressionType::LAMBDA) {
+        throw BinderException(stringFormat(
+            "The second argument of LIST_FILTER should be a lambda expression but got {}.",
+            ExpressionTypeUtil::toString(input.arguments[1]->expressionType)));
+    }
+    std::vector<LogicalType> paramTypes;
+    paramTypes.push_back(input.arguments[0]->getDataType().copy());
+    paramTypes.push_back(input.arguments[1]->getDataType().copy());
+    if (input.arguments[1]->getDataType() != LogicalType::BOOL()) {
+        throw BinderException(stringFormat(
+            "{} requires the result type of lambda expression be BOOL.", ListFilterFunction::name));
+    }
+    return std::make_unique<FunctionBindData>(std::move(paramTypes),
+        LogicalType::LIST(ListType::getChildType(input.arguments[0]->getDataType()).copy()));
+}
+
+static void constEvaluateFilterResult(const common::ValueVector& inputVector,
+    const common::SelectionVector& listInputSelVector, common::ValueVector& result,
+    common::SelectionVector& resultSelVector, const common::ValueVector& filterVector,
+    const common::SelectionVector& filterSelVector, evaluator::ListSliceInfo* sliceInfo) {
+    auto srcDataVector = ListVector::getDataVector(&inputVector);
+    auto dstDataVector = ListVector::getDataVector(&result);
+    KU_ASSERT(!filterVector.isNull(filterSelVector[0]));
+    auto filterResult = filterVector.getValue<bool>(filterSelVector[0]);
+
+    // resolve data vector
+    if (filterResult) {
+        for (sel_t i = 0; i < sliceInfo->getSliceSize(); ++i) {
+            const auto [_, dataOffset] = sliceInfo->getPos(i);
+            dstDataVector->copyFromVectorData(dataOffset, srcDataVector, dataOffset);
+            dstDataVector->setNull(dataOffset, srcDataVector->isNull(dataOffset));
+        }
+    }
+
+    // resolve list entries
+    if (sliceInfo->done()) {
+        for (uint64_t i = 0; i < listInputSelVector.getSelSize(); ++i) {
+            list_entry_t dstListEntry;
+            auto srcListEntry = inputVector.getValue<list_entry_t>(listInputSelVector[i]);
+            if (filterResult) {
+                dstListEntry = srcListEntry;
+            } else {
+                dstListEntry = {srcListEntry.offset, 0};
+            }
+            result.setValue(resultSelVector[i], dstListEntry);
+        }
+    }
+}
+
+static void evaluateFilterResult(const common::ValueVector& inputVector,
+    common::ValueVector& result, const common::ValueVector& filterVector,
+    [[maybe_unused]] const common::SelectionVector& filterSelVector,
+    evaluator::ListSliceInfo* sliceInfo) {
+    KU_ASSERT(filterSelVector.isUnfiltered());
+    auto srcDataVector = ListVector::getDataVector(&inputVector);
+    auto dstDataVector = ListVector::getDataVector(&result);
+
+    auto& resultDataOffset = sliceInfo->getResultSliceOffset();
+    for (sel_t i = 0; i < sliceInfo->getSliceSize(); ++i) {
+        const auto [listEntryPos, dataOffset] = sliceInfo->getPos(i);
+        const auto listEntry = inputVector.getValue<list_entry_t>(listEntryPos);
+        if (dataOffset == listEntry.offset) {
+            result.setValue(listEntryPos, list_entry_t{resultDataOffset, 0});
+        }
+        if (filterVector.getValue<bool>(i) && !filterVector.isNull(i)) {
+            // TODO(Royi) make the output pos respect resultSelVector
+            auto& resultListEntry = result.getValue<list_entry_t>(listEntryPos);
+            dstDataVector->copyFromVectorData(resultDataOffset, srcDataVector, dataOffset);
+            dstDataVector->setNull(resultDataOffset, srcDataVector->isNull(dataOffset));
+            ++resultListEntry.size;
+            ++resultDataOffset;
+        }
+    }
+}
+
+static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& input,
+    const std::vector<common::SelectionVector*>& inputSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* bindData) {
+    auto listLambdaBindData = reinterpret_cast<evaluator::ListLambdaBindData*>(bindData);
+    auto* sliceInfo = listLambdaBindData->sliceInfo;
+    const auto& inputVector = *input[0];
+
+    auto savedParamStates =
+        sliceInfo->overrideAndSaveParamStates(listLambdaBindData->lambdaParamEvaluators);
+
+    listLambdaBindData->rootEvaluator->evaluate();
+    KU_ASSERT(input.size() == 2);
+    auto& listInputSelVector = *inputSelVectors[0];
+    auto& filterVector = *input[1];
+    auto& filterSelVector = *inputSelVectors[1];
+
+    if (listLambdaBindData->lambdaParamEvaluators.empty()) {
+        constEvaluateFilterResult(inputVector, listInputSelVector, result, *resultSelVector,
+            filterVector, filterSelVector, sliceInfo);
+    } else {
+        evaluateFilterResult(inputVector, result, filterVector, filterSelVector, sliceInfo);
+    }
+
+    if (listLambdaBindData->sliceInfo->done()) {
+        for (idx_t i = 0; i < inputSelVectors[0]->getSelSize(); ++i) {
+            const auto pos = (*inputSelVectors[0])[i];
+            result.setNull(pos, inputVector.isNull(i));
+        }
+    }
+
+    sliceInfo->restoreParamStates(listLambdaBindData->lambdaParamEvaluators,
+        std::move(savedParamStates));
+}
+
+function_set ListFilterFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::LIST,
+        execFunc);
+    function->bindFunc = bindFunc;
+    function->isListLambda = true;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_function_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_function_utils.cpp
new file mode 100644
index 0000000000..99365ea316
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_function_utils.cpp
@@ -0,0 +1,106 @@
+#include "function/list/functions/list_function_utils.h"
+
+#include "binder/expression/expression_util.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+void ListTypeResolver<ListOp::Append>::anyEmpty(std::vector<common::LogicalType>& types,
+    common::LogicalType& targetType) {
+    targetType = types[1].copy();
+    if (targetType.getLogicalTypeID() == LogicalTypeID::ANY) {
+        targetType = LogicalType(LogicalTypeID::INT64);
+    }
+}
+
+void ListTypeResolver<ListOp::Append>::bothNull(std::vector<common::LogicalType>& types,
+    common::LogicalType& targetType) {
+    (void)types;
+    targetType = LogicalType::INT64();
+}
+
+void ListTypeResolver<ListOp::Append>::leftNull(std::vector<common::LogicalType>& types,
+    common::LogicalType& targetType) {
+    targetType = types[1].copy();
+}
+
+void ListTypeResolver<ListOp::Append>::rightNull(std::vector<common::LogicalType>& types,
+    common::LogicalType& targetType) {
+    targetType = ListType::getChildType(types[0]).copy();
+}
+
+void ListTypeResolver<ListOp::Append>::finalResolver(std::vector<common::LogicalType>& types,
+    common::LogicalType& targetType) {
+    types[0] = LogicalType::LIST(targetType.copy());
+    types[1] = targetType.copy();
+}
+
+void ListTypeResolver<ListOp::Concat>::leftEmpty(std::vector<common::LogicalType>& types,
+    common::LogicalType& targetType) {
+    targetType = types[1].copy();
+}
+void ListTypeResolver<ListOp::Concat>::rightEmpty(std::vector<common::LogicalType>& types,
+    common::LogicalType& targetType) {
+    targetType = types[0].copy();
+}
+void ListTypeResolver<ListOp::Concat>::bothNull(std::vector<common::LogicalType>& types,
+    common::LogicalType& targetType) {
+    (void)types;
+    targetType = LogicalType::LIST(LogicalType::INT64());
+}
+void ListTypeResolver<ListOp::Concat>::finalResolver(std::vector<common::LogicalType>& types,
+    common::LogicalType& targetType) {
+    types[0] = targetType.copy();
+    types[1] = targetType.copy();
+}
+
+void ListFunctionUtils::resolveEmptyList(const ScalarBindFuncInput& input,
+    std::vector<common::LogicalType>& types, type_resolver bothEmpty, type_resolver leftEmpty,
+    type_resolver rightEmpty, type_resolver finalEmptyListResolver) {
+
+    auto isArg0Empty = binder::ExpressionUtil::isEmptyList(*input.arguments[0]);
+    auto isArg1Empty = binder::ExpressionUtil::isEmptyList(*input.arguments[1]);
+    LogicalType targetType;
+    if (isArg0Empty && isArg1Empty) {
+        bothEmpty(types, targetType);
+    } else if (isArg0Empty) {
+        leftEmpty(types, targetType);
+    } else if (isArg1Empty) {
+        rightEmpty(types, targetType);
+    } else {
+        return;
+    }
+    finalEmptyListResolver(types, targetType);
+}
+
+void ListFunctionUtils::resolveNulls(std::vector<common::LogicalType>& types,
+    type_resolver bothNull, type_resolver leftNull, type_resolver rightNull,
+    type_resolver finalNullParamResolver) {
+    auto isArg0AnyType = types[0].getLogicalTypeID() == common::LogicalTypeID::ANY;
+    auto isArg1AnyType = types[1].getLogicalTypeID() == common::LogicalTypeID::ANY;
+
+    common::LogicalType targetType;
+    if (isArg0AnyType && isArg1AnyType) {
+        bothNull(types, targetType);
+    } else if (isArg0AnyType) {
+        leftNull(types, targetType);
+    } else if (isArg1AnyType) {
+        rightNull(types, targetType);
+    } else {
+        return;
+    }
+    finalNullParamResolver(types, targetType);
+}
+
+void ListFunctionUtils::resolveTypes(const ScalarBindFuncInput& input,
+    std::vector<common::LogicalType>& types, type_resolver bothEmpty, type_resolver leftEmpty,
+    type_resolver rightEmpty, type_resolver finalEmptyListResolver, type_resolver bothNull,
+    type_resolver leftNull, type_resolver rightNull, type_resolver finalNullParamResolver) {
+    resolveEmptyList(input, types, bothEmpty, leftEmpty, rightEmpty, finalEmptyListResolver);
+    resolveNulls(types, bothNull, leftNull, rightNull, finalNullParamResolver);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_has_all.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_has_all.cpp
new file mode 100644
index 0000000000..4944264341
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_has_all.cpp
@@ -0,0 +1,68 @@
+#include "common/exception/binder.h"
+#include "common/exception/message.h"
+#include "common/type_utils.h"
+#include "function/list/functions/list_position_function.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct ListHasAll {
+    static void operation(common::list_entry_t& left, common::list_entry_t& right, uint8_t& result,
+        common::ValueVector& leftVector, common::ValueVector& rightVector,
+        common::ValueVector& resultVector) {
+        int64_t pos = 0;
+        auto rightDataVector = ListVector::getDataVector(&rightVector);
+        result = true;
+        for (auto i = 0u; i < right.size; i++) {
+            common::TypeUtils::visit(ListType::getChildType(rightVector.dataType).getPhysicalType(),
+                [&]<typename T>(T) {
+                    if (rightDataVector->isNull(right.offset + i)) {
+                        return;
+                    }
+                    ListPosition::operation(left,
+                        *(T*)ListVector::getListValuesWithOffset(&rightVector, right, i), pos,
+                        leftVector, *ListVector::getDataVector(&rightVector), resultVector);
+                    result = (pos != 0);
+                });
+            if (!result) {
+                return;
+            }
+        }
+    }
+};
+
+std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    std::vector<LogicalType> types;
+    for (auto& arg : input.arguments) {
+        if (arg->dataType == LogicalType::ANY()) {
+            types.push_back(LogicalType::LIST(LogicalType::INT64()));
+        } else {
+            types.push_back(arg->dataType.copy());
+        }
+    }
+    if (types[0] != types[1]) {
+        throw common::BinderException(ExceptionMessage::listFunctionIncompatibleChildrenType(
+            ListHasAllFunction::name, input.arguments[0]->getDataType().toString(),
+            input.arguments[1]->getDataType().toString()));
+    }
+    return std::make_unique<FunctionBindData>(std::move(types), LogicalType::BOOL());
+}
+
+function_set ListHasAllFunction::getFunctionSet() {
+    function_set result;
+    auto execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t,
+        uint8_t, ListHasAll>;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::LIST}, LogicalTypeID::BOOL,
+        execFunc);
+    function->bindFunc = bindFunc;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_none.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_none.cpp
new file mode 100644
index 0000000000..3f138b4b61
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_none.cpp
@@ -0,0 +1,26 @@
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+bool noneHandler(uint64_t numSelectedValues, uint64_t /*originalSize*/) {
+    return numSelectedValues == 0;
+}
+
+function_set ListNoneFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::BOOL,
+        std::bind(execQuantifierFunc, noneHandler, std::placeholders::_1, std::placeholders::_2,
+            std::placeholders::_3, std::placeholders::_4, std::placeholders::_5));
+    function->bindFunc = bindQuantifierFunc;
+    function->isListLambda = true;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_position_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_position_function.cpp
new file mode 100644
index 0000000000..11b0d4f699
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_position_function.cpp
@@ -0,0 +1,32 @@
+#include "function/list/functions/list_position_function.h"
+
+#include "common/type_utils.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    auto scalarFunction = input.definition->ptrCast<ScalarFunction>();
+    TypeUtils::visit(input.arguments[1]->getDataType().getPhysicalType(),
+        [&scalarFunction]<typename T>(T) {
+            scalarFunction->execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, T,
+                int64_t, ListPosition>;
+        });
+    return FunctionBindData::getSimpleBindData(input.arguments, LogicalType::INT64());
+}
+
+function_set ListPositionFunction::getFunctionSet() {
+    function_set result;
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::INT64);
+    func->bindFunc = bindFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_prepend_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_prepend_function.cpp
new file mode 100644
index 0000000000..7b3668d561
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_prepend_function.cpp
@@ -0,0 +1,69 @@
+#include "common/exception/binder.h"
+#include "common/exception/message.h"
+#include "common/type_utils.h"
+#include "common/types/types.h"
+#include "function/list/functions/list_function_utils.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct ListPrepend {
+    template<typename T>
+    static void operation(common::list_entry_t& listEntry, T& value, common::list_entry_t& result,
+        common::ValueVector& listVector, common::ValueVector& valueVector,
+        common::ValueVector& resultVector) {
+        result = common::ListVector::addList(&resultVector, listEntry.size + 1);
+        auto resultDataVector = common::ListVector::getDataVector(&resultVector);
+        resultDataVector->copyFromVectorData(
+            common::ListVector::getListValues(&resultVector, result), &valueVector,
+            reinterpret_cast<uint8_t*>(&value));
+        auto resultPos = result.offset + 1;
+        auto listDataVector = common::ListVector::getDataVector(&listVector);
+        auto listPos = listEntry.offset;
+        for (auto i = 0u; i < listEntry.size; i++) {
+            resultDataVector->copyFromVectorData(resultPos++, listDataVector, listPos++);
+        }
+    }
+};
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+
+    std::vector<LogicalType> types;
+    types.push_back(input.arguments[0]->getDataType().copy());
+    types.push_back(input.arguments[1]->getDataType().copy());
+
+    using resolver = ListTypeResolver<ListOp::Prepend>;
+    ListFunctionUtils::resolveTypes(input, types, resolver::anyEmpty, resolver::anyEmpty,
+        resolver::anyEmpty, resolver::finalResolver, resolver::bothNull, resolver::leftNull,
+        resolver::rightNull, resolver::finalResolver);
+
+    if (types[0].getLogicalTypeID() != LogicalTypeID::ANY &&
+        types[1] != ListType::getChildType(types[0])) {
+        throw BinderException(ExceptionMessage::listFunctionIncompatibleChildrenType(
+            ListAppendFunction::name, types[0].toString(), types[1].toString()));
+    }
+
+    auto scalarFunction = input.definition->ptrCast<ScalarFunction>();
+    TypeUtils::visit(types[1].getPhysicalType(), [&scalarFunction]<typename T>(T) {
+        scalarFunction->execFunc = ScalarFunction::BinaryExecListStructFunction<list_entry_t, T,
+            list_entry_t, ListPrepend>;
+    });
+
+    return std::make_unique<FunctionBindData>(std::move(types), types[0].copy());
+}
+
+function_set ListPrependFunction::getFunctionSet() {
+    function_set result;
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::LIST);
+    func->bindFunc = bindFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_range_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_range_function.cpp
new file mode 100644
index 0000000000..78c874b589
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_range_function.cpp
@@ -0,0 +1,106 @@
+#include "common/exception/runtime.h"
+#include "common/type_utils.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct Range {
+    // range function:
+    // - include end
+    // - when start = end: there is only one element in result list
+    // - when end - start are of opposite sign of step, the result will be empty
+    // - default step = 1
+    template<typename T>
+    static void operation(T& end, list_entry_t& result, ValueVector& endVector,
+        ValueVector& resultVector) {
+        T step = 1;
+        T start = 0;
+        operation(start, end, step, result, endVector, resultVector);
+    }
+
+    template<typename T>
+    static void operation(T& start, T& end, list_entry_t& result, ValueVector& leftVector,
+        ValueVector& /*rightVector*/, ValueVector& resultVector) {
+        T step = 1;
+        operation(start, end, step, result, leftVector, resultVector);
+    }
+
+    template<typename T>
+    static void operation(T& start, T& end, T& step, list_entry_t& result,
+        ValueVector& /*inputVector*/, ValueVector& resultVector) {
+        if (step == 0) {
+            throw RuntimeException("Step of range cannot be 0.");
+        }
+
+        // start, start + step, start + 2step, ..., end
+        T number = start;
+        auto size = ((end - start) * 1.0 / step);
+        size < 0 ? size = 0 : size = (int64_t)(size + 1);
+
+        result = ListVector::addList(&resultVector, (int64_t)size);
+        auto resultDataVector = ListVector::getDataVector(&resultVector);
+        for (auto i = 0u; i < (int64_t)size; i++) {
+            resultDataVector->setValue(result.offset + i, number);
+            number += step;
+        }
+    }
+};
+
+static scalar_func_exec_t getBinaryExecFunc(const LogicalType& type) {
+    scalar_func_exec_t execFunc;
+    TypeUtils::visit(
+        type,
+        [&execFunc]<IntegerTypes T>(T) {
+            execFunc = ScalarFunction::BinaryExecListStructFunction<T, T, list_entry_t, Range>;
+        },
+        [](auto) { KU_UNREACHABLE; });
+    return execFunc;
+}
+
+static scalar_func_exec_t getTernaryExecFunc(const LogicalType& type) {
+    scalar_func_exec_t execFunc;
+    TypeUtils::visit(
+        type,
+        [&execFunc]<IntegerTypes T>(T) {
+            execFunc = ScalarFunction::TernaryExecListStructFunction<T, T, T, list_entry_t, Range>;
+        },
+        [](auto) { KU_UNREACHABLE; });
+    return execFunc;
+}
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    auto type = LogicalType(input.definition->parameterTypeIDs[0]);
+    auto resultType = LogicalType::LIST(type.copy());
+    auto bindData = std::make_unique<FunctionBindData>(std::move(resultType));
+    for (auto& _ : input.arguments) {
+        (void)_;
+        bindData->paramTypes.push_back(type.copy());
+    }
+    return bindData;
+}
+
+function_set ListRangeFunction::getFunctionSet() {
+    function_set result;
+    std::unique_ptr<ScalarFunction> func;
+    for (auto typeID : LogicalTypeUtils::getIntegerTypeIDs()) {
+        // start, end
+        func = std::make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{typeID, typeID},
+            LogicalTypeID::LIST, getBinaryExecFunc(LogicalType{typeID}));
+        func->bindFunc = bindFunc;
+        result.push_back(std::move(func));
+        // start, end, step
+        func = std::make_unique<ScalarFunction>(name,
+            std::vector<LogicalTypeID>{typeID, typeID, typeID}, LogicalTypeID::LIST,
+            getTernaryExecFunc(LogicalType{typeID}));
+        func->bindFunc = bindFunc;
+        result.push_back(std::move(func));
+    }
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_reduce.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_reduce.cpp
new file mode 100644
index 0000000000..a4793d7923
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_reduce.cpp
@@ -0,0 +1,111 @@
+#include "common/exception/binder.h"
+#include "common/exception/runtime.h"
+#include "expression_evaluator/lambda_evaluator.h"
+#include "expression_evaluator/list_slice_info.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    if (input.arguments[1]->expressionType != ExpressionType::LAMBDA) {
+        throw BinderException(stringFormat(
+            "The second argument of LIST_REDUCE should be a lambda expression but got {}.",
+            ExpressionTypeUtil::toString(input.arguments[1]->expressionType)));
+    }
+    std::vector<LogicalType> paramTypes;
+    paramTypes.push_back(input.arguments[0]->getDataType().copy());
+    paramTypes.push_back(input.arguments[1]->getDataType().copy());
+    return std::make_unique<FunctionBindData>(std::move(paramTypes),
+        ListType::getChildType(input.arguments[0]->getDataType()).copy());
+}
+
+static void processDataEntry(offset_t curOffset, sel_t listEntryPos, common::ValueVector& result,
+    const common::ValueVector& inputVector, common::ValueVector& tmpResultVector,
+    const common::SelectionVector& tmpResultVectorSelVector,
+    const std::vector<ValueVector*>& params, const std::vector<common::idx_t>& paramIndices,
+    evaluator::ListLambdaBindData& bindData) {
+    common::ValueVector& inputDataVector = *ListVector::getDataVector(&inputVector);
+    const auto listEntry = inputVector.getValue<list_entry_t>(listEntryPos);
+    KU_ASSERT(listEntry.size > 0);
+    offset_t offsetInList = curOffset - listEntry.offset;
+    if (offsetInList == 0 && listEntry.size == 1) {
+        // if list size is 1 the reduce result is equal to the single value
+        result.copyFromVectorData(listEntryPos, &inputDataVector, listEntry.offset);
+    } else {
+        auto paramPos = params[0]->state->getSelVector()[0];
+        auto tmpResultPos = tmpResultVectorSelVector[0];
+        if (offsetInList < listEntry.size - 1) {
+            // continue reducing
+            for (auto i = 0u; i < params.size(); i++) {
+                if (0u == paramIndices[i] && 0u != offsetInList) {
+                    params[i]->copyFromVectorData(paramPos, &tmpResultVector, tmpResultPos);
+                } else {
+                    params[i]->copyFromVectorData(paramPos, &inputDataVector,
+                        listEntry.offset + offsetInList + paramIndices[i]);
+                }
+                params[i]->state->getSelVectorUnsafe().setSelSize(1);
+            }
+            bindData.rootEvaluator->evaluate();
+        } else {
+            // we are done reducing, copy the result from the intermediate result vector
+            result.copyFromVectorData(listEntryPos, &tmpResultVector, tmpResultPos);
+        }
+    }
+}
+
+static void reduceSlice(evaluator::ListSliceInfo& sliceInfo, common::ValueVector& result,
+    const common::ValueVector& inputVector, common::ValueVector& tmpResultVector,
+    common::SelectionVector& tmpResultVectorSelVector, evaluator::ListLambdaBindData& bindData) {
+    const auto& paramIndices = bindData.paramIndices;
+    std::vector<ValueVector*> params(bindData.lambdaParamEvaluators.size());
+    for (auto i = 0u; i < bindData.lambdaParamEvaluators.size(); i++) {
+        auto param = bindData.lambdaParamEvaluators[i]->resultVector.get();
+        params[i] = param;
+    }
+
+    for (sel_t i = 0; i < sliceInfo.getSliceSize(); ++i) {
+        const auto [listEntryPos, dataOffset] = sliceInfo.getPos(i);
+        processDataEntry(dataOffset, listEntryPos, result, inputVector, tmpResultVector,
+            tmpResultVectorSelVector, params, paramIndices, bindData);
+    }
+}
+
+static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& input,
+    const std::vector<common::SelectionVector*>& inputSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* bindData) {
+    KU_ASSERT(input.size() == 2);
+    auto listLambdaBindData = reinterpret_cast<evaluator::ListLambdaBindData*>(bindData);
+    const auto* inputVector = input[0].get();
+    reduceSlice(*listLambdaBindData->sliceInfo, result, *inputVector, *input[1].get(),
+        *inputSelVectors[1], *listLambdaBindData);
+
+    if (listLambdaBindData->sliceInfo->done()) {
+        for (idx_t i = 0; i < inputSelVectors[0]->getSelSize(); ++i) {
+            const auto pos = (*inputSelVectors[0])[i];
+            const auto resPos = (*resultSelVector)[i];
+            if (inputVector->isNull(pos)) {
+                result.setNull(resPos, true);
+            } else if (inputVector->getValue<list_entry_t>(pos).size == 0) {
+                throw common::RuntimeException{"Cannot execute list_reduce on an empty list."};
+            }
+        }
+    }
+}
+
+function_set ListReduceFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::LIST,
+        execFunc);
+    function->bindFunc = bindFunc;
+    function->isListLambda = true;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_reverse_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_reverse_function.cpp
new file mode 100644
index 0000000000..0a591f0707
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_reverse_function.cpp
@@ -0,0 +1,42 @@
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct ListReverse {
+    static inline void operation(common::list_entry_t& input, common::list_entry_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector) {
+        auto inputDataVector = common::ListVector::getDataVector(&inputVector);
+        ListVector::resizeDataVector(&resultVector, ListVector::getDataVectorSize(&inputVector));
+        auto resultDataVector = common::ListVector::getDataVector(&resultVector);
+        result = input; // reverse does not change
+        for (auto i = 0u; i < input.size; i++) {
+            auto pos = input.offset + i;
+            auto reversePos = input.offset + input.size - 1 - i;
+            resultDataVector->copyFromVectorData(reversePos, inputDataVector, pos);
+        }
+    }
+};
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    auto scalarFunction = ku_dynamic_cast<ScalarFunction*>(input.definition);
+    const auto& resultType = input.arguments[0]->dataType;
+    scalarFunction->execFunc =
+        ScalarFunction::UnaryExecNestedTypeFunction<list_entry_t, list_entry_t, ListReverse>;
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType.copy());
+}
+
+function_set ListReverseFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST}, LogicalTypeID::ANY);
+    function->bindFunc = bindFunc;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_single.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_single.cpp
new file mode 100644
index 0000000000..e9d6c21cd1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_single.cpp
@@ -0,0 +1,26 @@
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+bool singleHandler(uint64_t numSelectedValues, uint64_t /*originalSize*/) {
+    return numSelectedValues == 1;
+}
+
+function_set ListSingleFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::BOOL,
+        std::bind(execQuantifierFunc, singleHandler, std::placeholders::_1, std::placeholders::_2,
+            std::placeholders::_3, std::placeholders::_4, std::placeholders::_5));
+    function->bindFunc = bindQuantifierFunc;
+    function->isListLambda = true;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_slice_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_slice_function.cpp
new file mode 100644
index 0000000000..a39159cf79
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_slice_function.cpp
@@ -0,0 +1,113 @@
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+#include "function/string/functions/substr_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static void normalizeIndices(int64_t& startIdx, int64_t& endIdx, uint64_t size) {
+    if (startIdx < 0) {
+        startIdx = size + startIdx + 1;
+    }
+    if (startIdx <= 0) {
+        startIdx = 1;
+    }
+    if (endIdx < 0) {
+        endIdx = size + endIdx + 1;
+    }
+    if (endIdx > (int64_t)size) {
+        endIdx = size;
+    }
+    if (endIdx < startIdx) {
+        startIdx = 1;
+        endIdx = 0;
+    }
+}
+
+struct ListSlice {
+    // Note: this function takes in a 1-based begin/end index (The index of the first value in the
+    // listEntry is 1).
+    static void operation(list_entry_t& listEntry, int64_t& begin, int64_t& end,
+        list_entry_t& result, ValueVector& listVector, ValueVector& resultVector) {
+        auto startIdx = begin;
+        auto endIdx = end;
+        normalizeIndices(startIdx, endIdx, listEntry.size);
+        result = ListVector::addList(&resultVector, endIdx - startIdx + 1);
+        auto srcDataVector = ListVector::getDataVector(&listVector);
+        auto srcPos = listEntry.offset + startIdx - 1;
+        auto dstDataVector = ListVector::getDataVector(&resultVector);
+        auto dstPos = result.offset;
+        for (; startIdx <= endIdx; startIdx++) {
+            dstDataVector->copyFromVectorData(dstPos++, srcDataVector, srcPos++);
+        }
+    }
+
+    static void operation(ku_string_t& str, int64_t& begin, int64_t& end, ku_string_t& result,
+        ValueVector&, ValueVector& resultValueVector) {
+        auto startIdx = begin;
+        auto endIdx = end;
+        normalizeIndices(startIdx, endIdx, str.len);
+        SubStr::operation(str, startIdx, endIdx - startIdx + 1, result, resultValueVector);
+    }
+};
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    KU_ASSERT(input.arguments.size() == 3);
+    std::vector<LogicalType> paramTypes;
+    auto& arg0Type = input.arguments[0]->getDataType();
+    LogicalType resultType;
+    switch (arg0Type.getLogicalTypeID()) {
+    case LogicalTypeID::ANY: {
+        paramTypes.push_back(LogicalType::STRING());
+        resultType = LogicalType::STRING();
+    } break;
+    case LogicalTypeID::ARRAY: {
+        paramTypes.push_back(arg0Type.copy());
+        resultType = LogicalType::LIST(ArrayType::getChildType(arg0Type).copy());
+    } break;
+    default: {
+        paramTypes.push_back(arg0Type.copy());
+        resultType = arg0Type.copy();
+    }
+    }
+    paramTypes.push_back(LogicalType(input.definition->parameterTypeIDs[1]));
+    paramTypes.push_back(LogicalType(input.definition->parameterTypeIDs[2]));
+    return std::make_unique<FunctionBindData>(std::move(paramTypes), std::move(resultType));
+}
+
+function_set ListSliceFunction::getFunctionSet() {
+    function_set result;
+    std::unique_ptr<ScalarFunction> func;
+    // List slice
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::INT64, LogicalTypeID::INT64},
+        LogicalTypeID::LIST,
+        ScalarFunction::TernaryExecListStructFunction<list_entry_t, int64_t, int64_t, list_entry_t,
+            ListSlice>);
+    func->bindFunc = bindFunc;
+    result.push_back(std::move(func));
+    // Array slice
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ARRAY, LogicalTypeID::INT64,
+            LogicalTypeID::INT64},
+        LogicalTypeID::LIST,
+        ScalarFunction::TernaryExecListStructFunction<list_entry_t, int64_t, int64_t, list_entry_t,
+            ListSlice>);
+    func->bindFunc = bindFunc;
+    result.push_back(std::move(func));
+    // Substr
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64,
+            LogicalTypeID::INT64},
+        LogicalTypeID::STRING,
+        ScalarFunction::TernaryExecListStructFunction<ku_string_t, int64_t, int64_t, ku_string_t,
+            ListSlice>);
+    func->bindFunc = bindFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_sort_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_sort_function.cpp
new file mode 100644
index 0000000000..c0c2b6459f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_sort_function.cpp
@@ -0,0 +1,95 @@
+#include "function/list/functions/list_sort_function.h"
+
+#include "common/exception/binder.h"
+#include "common/exception/runtime.h"
+#include "common/type_utils.h"
+#include "function/list/functions/list_reverse_sort_function.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+template<typename T>
+static scalar_func_exec_t getListSortExecFunction(const binder::expression_vector& arguments) {
+    scalar_func_exec_t func;
+    if (arguments.size() == 1) {
+        func = ScalarFunction::UnaryExecNestedTypeFunction<list_entry_t, list_entry_t, T>;
+    } else if (arguments.size() == 2) {
+        func = ScalarFunction::BinaryExecListStructFunction<list_entry_t, ku_string_t, list_entry_t,
+            T>;
+    } else if (arguments.size() == 3) {
+        func = ScalarFunction::TernaryExecListStructFunction<list_entry_t, ku_string_t, ku_string_t,
+            list_entry_t, T>;
+    } else {
+        throw RuntimeException("Invalid number of arguments");
+    }
+    return func;
+}
+
+static std::unique_ptr<FunctionBindData> ListSortBindFunc(ScalarBindFuncInput input) {
+    auto scalarFunction = input.definition->ptrCast<ScalarFunction>();
+    if (input.arguments[0]->dataType.getLogicalTypeID() == common::LogicalTypeID::ANY) {
+        throw BinderException(stringFormat("Cannot resolve recursive data type for expression {}",
+            input.arguments[0]->toString()));
+    }
+    common::TypeUtils::visit(
+        ListType::getChildType(input.arguments[0]->dataType).getPhysicalType(),
+        [&input, &scalarFunction]<ComparableTypes T>(T) {
+            scalarFunction->execFunc = getListSortExecFunction<ListSort<T>>(input.arguments);
+        },
+        [](auto) { KU_UNREACHABLE; });
+    return FunctionBindData::getSimpleBindData(input.arguments, input.arguments[0]->getDataType());
+}
+
+static std::unique_ptr<FunctionBindData> ListReverseSortBindFunc(const ScalarBindFuncInput& input) {
+    auto scalarFunction = input.definition->ptrCast<ScalarFunction>();
+    common::TypeUtils::visit(
+        ListType::getChildType(input.arguments[0]->dataType).getPhysicalType(),
+        [&input, &scalarFunction]<ComparableTypes T>(T) {
+            scalarFunction->execFunc = getListSortExecFunction<ListReverseSort<T>>(input.arguments);
+        },
+        [](auto) { KU_UNREACHABLE; });
+    return FunctionBindData::getSimpleBindData(input.arguments, input.arguments[0]->getDataType());
+}
+
+function_set ListSortFunction::getFunctionSet() {
+    function_set result;
+    std::unique_ptr<ScalarFunction> func;
+    func = std::make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::LIST},
+        LogicalTypeID::LIST);
+    func->bindFunc = ListSortBindFunc;
+    result.push_back(std::move(func));
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::STRING},
+        LogicalTypeID::LIST);
+    func->bindFunc = ListSortBindFunc;
+    result.push_back(std::move(func));
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::STRING,
+            LogicalTypeID::STRING},
+        LogicalTypeID::LIST);
+    func->bindFunc = ListSortBindFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+function_set ListReverseSortFunction::getFunctionSet() {
+    function_set result;
+    std::unique_ptr<ScalarFunction> func;
+    func = std::make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::LIST},
+        LogicalTypeID::LIST);
+    func->bindFunc = ListReverseSortBindFunc;
+    result.push_back(std::move(func));
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::STRING},
+        LogicalTypeID::LIST);
+    func->bindFunc = ListReverseSortBindFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_to_string_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_to_string_function.cpp
new file mode 100644
index 0000000000..777d7ae76a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_to_string_function.cpp
@@ -0,0 +1,67 @@
+#include "common/type_utils.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct ListToString {
+    static void operation(ku_string_t& delim, list_entry_t& input, common::ku_string_t& result,
+        common::ValueVector& inputVector, common::ValueVector& /*delimVector*/,
+        common::ValueVector& resultVector);
+};
+
+void ListToString::operation(ku_string_t& delim, list_entry_t& input, ku_string_t& result,
+    ValueVector& /*delimVector*/, ValueVector& inputVector, ValueVector& resultVector) {
+    std::string resultStr = "";
+    bool outputDelim = false;
+    if (input.size != 0) {
+        auto dataVector = ListVector::getDataVector(&inputVector);
+        if (!dataVector->isNull(input.offset)) {
+            resultStr += TypeUtils::entryToString(dataVector->dataType,
+                ListVector::getListValuesWithOffset(&inputVector, input, 0 /* offset */),
+                dataVector);
+            outputDelim = true;
+        }
+        for (auto i = 1u; i < input.size; i++) {
+            if (dataVector->isNull(input.offset + i)) {
+                continue;
+            }
+            if (outputDelim) {
+                resultStr += delim.getAsString();
+            }
+            outputDelim = true;
+            resultStr += TypeUtils::entryToString(dataVector->dataType,
+                ListVector::getListValuesWithOffset(&inputVector, input, i), dataVector);
+        }
+    }
+    StringVector::addString(&resultVector, result, resultStr);
+}
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    std::vector<LogicalType> paramTypes;
+    paramTypes.push_back(LogicalType(input.definition->parameterTypeIDs[0]));
+    if (input.arguments[1]->getDataType().getLogicalTypeID() == LogicalTypeID::ANY) {
+        paramTypes.push_back(LogicalType::STRING());
+    } else {
+        paramTypes.push_back(input.arguments[1]->getDataType().copy());
+    }
+    return std::make_unique<FunctionBindData>(std::move(paramTypes), LogicalType::STRING());
+}
+
+function_set ListToStringFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::LIST},
+        LogicalTypeID::STRING,
+        ScalarFunction::BinaryExecListStructFunction<ku_string_t, list_entry_t, ku_string_t,
+            ListToString>);
+    function->bindFunc = bindFunc;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_transform.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_transform.cpp
new file mode 100644
index 0000000000..9fb64ff856
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_transform.cpp
@@ -0,0 +1,90 @@
+#include "common/exception/binder.h"
+#include "expression_evaluator/lambda_evaluator.h"
+#include "expression_evaluator/list_slice_info.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+using namespace common;
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    if (input.arguments[1]->expressionType != ExpressionType::LAMBDA) {
+        throw BinderException(stringFormat(
+            "The second argument of LIST_TRANSFORM should be a lambda expression but got {}.",
+            ExpressionTypeUtil::toString(input.arguments[1]->expressionType)));
+    }
+    std::vector<LogicalType> paramTypes;
+    paramTypes.push_back(input.arguments[0]->getDataType().copy());
+    paramTypes.push_back(input.arguments[1]->getDataType().copy());
+    return std::make_unique<FunctionBindData>(std::move(paramTypes),
+        LogicalType::LIST(input.arguments[1]->getDataType().copy()));
+}
+
+static void copyEvaluatedDataToResult(ValueVector& resultVector,
+    evaluator::ListLambdaBindData* bindData) {
+    auto& sliceInfo = *bindData->sliceInfo;
+    auto dstDataVector = ListVector::getDataVector(&resultVector);
+    auto rootResultVector = bindData->rootEvaluator->resultVector.get();
+    for (sel_t i = 0; i < sliceInfo.getSliceSize(); ++i) {
+        const auto [listEntryPos, dataOffset] = sliceInfo.getPos(i);
+        const auto srcIdx = bindData->lambdaParamEvaluators.empty() ? 0 : i;
+        sel_t srcPos = rootResultVector->state->getSelVector()[srcIdx];
+        dstDataVector->copyFromVectorData(dataOffset, rootResultVector, srcPos);
+        dstDataVector->setNull(dataOffset, rootResultVector->isNull(srcPos));
+    }
+}
+
+static void copyListEntriesToResult(const ValueVector& inputVector,
+    const SelectionVector& inputSelVector, ValueVector& result) {
+    for (uint64_t i = 0; i < inputSelVector.getSelSize(); ++i) {
+        auto pos = inputSelVector[i];
+        result.setNull(pos, inputVector.isNull(pos));
+
+        auto inputList = inputVector.getValue<list_entry_t>(pos);
+        ListVector::addList(&result, inputList.size);
+        result.setValue(pos, inputList);
+    }
+}
+
+static void execFunc(const std::vector<std::shared_ptr<ValueVector>>& input,
+    const std::vector<SelectionVector*>& inputSelVectors, ValueVector& result,
+    SelectionVector* resultSelVector, void* bindData_) {
+    auto bindData = reinterpret_cast<evaluator::ListLambdaBindData*>(bindData_);
+    auto* sliceInfo = bindData->sliceInfo;
+    auto savedParamStates = sliceInfo->overrideAndSaveParamStates(bindData->lambdaParamEvaluators);
+
+    bindData->rootEvaluator->evaluate();
+    copyEvaluatedDataToResult(result, bindData);
+
+    auto& inputVector = *input[0];
+    const auto& inputSelVector = *inputSelVectors[0];
+    KU_ASSERT(input.size() == 2);
+    if (!bindData->lambdaParamEvaluators.empty()) {
+        if (sliceInfo->done()) {
+            ListVector::copyListEntryAndBufferMetaData(result, *resultSelVector, inputVector,
+                inputSelVector);
+        }
+    } else {
+        if (sliceInfo->done()) {
+            copyListEntriesToResult(inputVector, inputSelVector, result);
+        }
+    }
+
+    sliceInfo->restoreParamStates(bindData->lambdaParamEvaluators, std::move(savedParamStates));
+}
+
+function_set ListTransformFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::ANY}, LogicalTypeID::LIST,
+        execFunc);
+    function->bindFunc = bindFunc;
+    function->isListLambda = true;
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_unique_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_unique_function.cpp
new file mode 100644
index 0000000000..a823f9bb13
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/list_unique_function.cpp
@@ -0,0 +1,58 @@
+#include "function/list/functions/list_unique_function.h"
+
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+uint64_t ListUnique::appendListElementsToValueSet(common::list_entry_t& input,
+    common::ValueVector& inputVector, duplicate_value_handler duplicateValHandler,
+    unique_value_handler uniqueValueHandler, null_value_handler nullValueHandler) {
+    ValueSet uniqueKeys;
+    auto dataVector = common::ListVector::getDataVector(&inputVector);
+    auto val = common::Value::createDefaultValue(dataVector->dataType);
+    for (auto i = 0u; i < input.size; i++) {
+        if (dataVector->isNull(input.offset + i)) {
+            if (nullValueHandler != nullptr) {
+                nullValueHandler();
+            }
+            continue;
+        }
+        auto entryVal = common::ListVector::getListValuesWithOffset(&inputVector, input, i);
+        val.copyFromColLayout(entryVal, dataVector);
+        auto uniqueKey = uniqueKeys.insert(val).second;
+        if (duplicateValHandler != nullptr && !uniqueKey) {
+            duplicateValHandler(
+                common::TypeUtils::entryToString(dataVector->dataType, entryVal, dataVector));
+        }
+        if (uniqueValueHandler != nullptr && uniqueKey) {
+            uniqueValueHandler(*dataVector, input.offset + i);
+        }
+    }
+    return uniqueKeys.size();
+}
+
+void ListUnique::operation(common::list_entry_t& input, int64_t& result,
+    common::ValueVector& inputVector, common::ValueVector& /*resultVector*/) {
+    result = appendListElementsToValueSet(input, inputVector);
+}
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    return FunctionBindData::getSimpleBindData(input.arguments, LogicalType::INT64());
+}
+
+function_set ListUniqueFunction::getFunctionSet() {
+    function_set result;
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST}, LogicalTypeID::INT64,
+        ScalarFunction::UnaryExecNestedTypeFunction<list_entry_t, int64_t, ListUnique>);
+    func->bindFunc = bindFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/quantifier_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/quantifier_functions.cpp
new file mode 100644
index 0000000000..549399293c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/quantifier_functions.cpp
@@ -0,0 +1,51 @@
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "expression_evaluator/lambda_evaluator.h"
+#include "function/function.h"
+#include "function/list/vector_list_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+void execQuantifierFunc(quantifier_handler handler,
+    const std::vector<std::shared_ptr<common::ValueVector>>& input,
+    const std::vector<common::SelectionVector*>& inputSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* bindData) {
+    auto listLambdaBindData = reinterpret_cast<evaluator::ListLambdaBindData*>(bindData);
+    auto& inputVector = *input[0];
+    if (!listLambdaBindData->lambdaParamEvaluators.empty()) {
+        auto listSize = ListVector::getDataVectorSize(&inputVector);
+        auto lambdaParamVector = listLambdaBindData->lambdaParamEvaluators[0]->resultVector.get();
+        lambdaParamVector->state->getSelVectorUnsafe().setSelSize(listSize);
+    }
+    auto& filterVector = *input[1];
+    bool isConstantTrueExpr = listLambdaBindData->lambdaParamEvaluators.empty() &&
+                              filterVector.getValue<bool>(filterVector.state->getSelVector()[0]);
+    listLambdaBindData->rootEvaluator->evaluate();
+    KU_ASSERT(input.size() == 2);
+    auto& listInputSelVector = *inputSelVectors[0];
+    uint64_t numSelectedValues = 0;
+    for (auto i = 0u; i < listInputSelVector.getSelSize(); ++i) {
+        numSelectedValues = 0;
+        auto srcListEntry = inputVector.getValue<list_entry_t>(listInputSelVector[i]);
+        for (auto j = 0u; j < srcListEntry.size; j++) {
+            auto pos = srcListEntry.offset + j;
+            if (isConstantTrueExpr || filterVector.getValue<bool>(pos)) {
+                numSelectedValues++;
+            }
+        }
+        result.setValue((*resultSelVector)[i], handler(numSelectedValues, srcListEntry.size));
+    }
+}
+
+std::unique_ptr<FunctionBindData> bindQuantifierFunc(const ScalarBindFuncInput& input) {
+    std::vector<common::LogicalType> paramTypes;
+    paramTypes.push_back(input.arguments[0]->getDataType().copy());
+    paramTypes.push_back(input.arguments[1]->getDataType().copy());
+    return std::make_unique<FunctionBindData>(std::move(paramTypes), common::LogicalType::BOOL());
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/size_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/size_function.cpp
new file mode 100644
index 0000000000..01a77cdd55
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/list/size_function.cpp
@@ -0,0 +1,54 @@
+#include "function/list/functions/list_len_function.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> sizeBindFunc(const ScalarBindFuncInput& input) {
+    auto scalarFunc = input.definition->constPtrCast<ScalarFunction>();
+    auto resultType = LogicalType(scalarFunc->returnTypeID);
+    if (input.definition->parameterTypeIDs[0] == common::LogicalTypeID::STRING) {
+        std::vector<LogicalType> paramTypes;
+        paramTypes.push_back(LogicalType::STRING());
+        return std::make_unique<FunctionBindData>(std::move(paramTypes), resultType.copy());
+    } else {
+        return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+    }
+}
+
+function_set SizeFunction::getFunctionSet() {
+    function_set result;
+    // size(list)
+    auto listFunc = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST}, LogicalTypeID::INT64,
+        ScalarFunction::UnaryExecFunction<list_entry_t, int64_t, ListLen>);
+    listFunc->bindFunc = sizeBindFunc;
+    result.push_back(std::move(listFunc));
+    // size(array)
+    auto arrayFunc = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{
+            LogicalTypeID::ARRAY,
+        },
+        LogicalTypeID::INT64, ScalarFunction::UnaryExecFunction<list_entry_t, int64_t, ListLen>);
+    arrayFunc->bindFunc = sizeBindFunc;
+    result.push_back(std::move(arrayFunc));
+    // size(map)
+    auto mapFunc = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::MAP}, LogicalTypeID::INT64,
+        ScalarFunction::UnaryExecFunction<list_entry_t, int64_t, ListLen>);
+    mapFunc->bindFunc = sizeBindFunc;
+    result.push_back(std::move(mapFunc));
+    // size(string)
+    auto strFunc =
+        std::make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::STRING},
+            LogicalTypeID::INT64, ScalarFunction::UnaryExecFunction<ku_string_t, int64_t, ListLen>);
+    strFunc->bindFunc = sizeBindFunc;
+    result.push_back(std::move(strFunc));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/CMakeLists.txt
new file mode 100644
index 0000000000..3a23f9eed4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/CMakeLists.txt
@@ -0,0 +1,10 @@
+add_library(lbug_function_map
+        OBJECT
+        map_creation_function.cpp
+        map_extract_function.cpp
+        map_keys_function.cpp
+        map_values_function.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_map>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_creation_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_creation_function.cpp
new file mode 100644
index 0000000000..264a778868
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_creation_function.cpp
@@ -0,0 +1,31 @@
+#include "function/map/functions/map_creation_function.h"
+
+#include "function/map/vector_map_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    const auto& keyType = ListType::getChildType(input.arguments[0]->dataType);
+    const auto& valueType = ListType::getChildType(input.arguments[1]->dataType);
+    auto resultType = LogicalType::MAP(keyType.copy(), valueType.copy());
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+}
+
+function_set MapCreationFunctions::getFunctionSet() {
+    auto execFunc = ScalarFunction::BinaryExecWithBindData<list_entry_t, list_entry_t, list_entry_t,
+        MapCreation>;
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::LIST}, LogicalTypeID::MAP,
+        execFunc);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_extract_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_extract_function.cpp
new file mode 100644
index 0000000000..2a406fee74
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_extract_function.cpp
@@ -0,0 +1,42 @@
+#include "function/map/functions/map_extract_function.h"
+
+#include "common/exception/runtime.h"
+#include "common/type_utils.h"
+#include "function/map/vector_map_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static void validateKeyType(const std::shared_ptr<binder::Expression>& mapExpression,
+    const std::shared_ptr<binder::Expression>& extractKeyExpression) {
+    const auto& mapKeyType = MapType::getKeyType(mapExpression->dataType);
+    if (mapKeyType != extractKeyExpression->dataType) {
+        throw RuntimeException("Unmatched map key type and extract key type");
+    }
+}
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    validateKeyType(input.arguments[0], input.arguments[1]);
+    auto scalarFunction = ku_dynamic_cast<ScalarFunction*>(input.definition);
+    TypeUtils::visit(input.arguments[1]->getDataType().getPhysicalType(), [&]<typename T>(T) {
+        scalarFunction->execFunc =
+            ScalarFunction::BinaryExecListStructFunction<list_entry_t, T, list_entry_t, MapExtract>;
+    });
+    auto resultType = LogicalType::LIST(MapType::getValueType(input.arguments[0]->dataType).copy());
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+}
+
+function_set MapExtractFunctions::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::MAP, LogicalTypeID::ANY}, LogicalTypeID::LIST);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_keys_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_keys_function.cpp
new file mode 100644
index 0000000000..7b9bc89857
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_keys_function.cpp
@@ -0,0 +1,28 @@
+#include "function/map/functions/map_keys_function.h"
+
+#include "function/map/vector_map_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    auto resultType = LogicalType::LIST(MapType::getKeyType(input.arguments[0]->dataType).copy());
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+}
+
+function_set MapKeysFunctions::getFunctionSet() {
+    auto execFunc =
+        ScalarFunction::UnaryExecNestedTypeFunction<list_entry_t, list_entry_t, MapKeys>;
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::MAP}, LogicalTypeID::LIST, execFunc);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_values_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_values_function.cpp
new file mode 100644
index 0000000000..19a9960cab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/map/map_values_function.cpp
@@ -0,0 +1,28 @@
+#include "function/map/functions/map_values_function.h"
+
+#include "function/map/vector_map_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    auto resultType = LogicalType::LIST(MapType::getValueType(input.arguments[0]->dataType).copy());
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+}
+
+function_set MapValuesFunctions::getFunctionSet() {
+    auto execFunc =
+        ScalarFunction::UnaryExecNestedTypeFunction<list_entry_t, list_entry_t, MapValues>;
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name, std::vector{LogicalTypeID::MAP},
+        LogicalTypeID::LIST, execFunc);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/CMakeLists.txt
new file mode 100644
index 0000000000..ec3c1af50c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/CMakeLists.txt
@@ -0,0 +1,11 @@
+add_library(lbug_function_path
+        OBJECT
+        length_function.cpp
+        nodes_function.cpp
+        properties_function.cpp
+        rels_function.cpp
+        semantic_function.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_path>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/length_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/length_function.cpp
new file mode 100644
index 0000000000..ad31cbb1da
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/length_function.cpp
@@ -0,0 +1,58 @@
+#include "binder/expression/expression_util.h"
+#include "binder/expression/rel_expression.h"
+#include "binder/expression_binder.h"
+#include "common/types/value/value.h"
+#include "function/arithmetic/vector_arithmetic_functions.h"
+#include "function/path/vector_path_functions.h"
+#include "function/rewrite_function.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::shared_ptr<Expression> rewriteFunc(const RewriteFunctionBindInput& input) {
+    KU_ASSERT(input.arguments.size() == 1);
+    auto param = input.arguments[0].get();
+    auto binder = input.expressionBinder;
+    if (param->expressionType == ExpressionType::PATH) {
+        int64_t numRels = 0u;
+        std::vector<const RelExpression*> recursiveRels;
+        for (auto& child : param->getChildren()) {
+            if (ExpressionUtil::isRelPattern(*child)) {
+                numRels++;
+            } else if (ExpressionUtil::isRecursiveRelPattern(*child)) {
+                recursiveRels.push_back(child->constPtrCast<RelExpression>());
+            }
+        }
+        auto numRelsExpression = binder->createLiteralExpression(Value(numRels));
+        if (recursiveRels.empty()) {
+            return numRelsExpression;
+        }
+        expression_vector children;
+        children.push_back(std::move(numRelsExpression));
+        children.push_back(recursiveRels[0]->getLengthExpression());
+        auto result = binder->bindScalarFunctionExpression(children, AddFunction::name);
+        for (auto i = 1u; i < recursiveRels.size(); ++i) {
+            children[0] = std::move(result);
+            children[1] = recursiveRels[i]->getLengthExpression();
+            result = binder->bindScalarFunctionExpression(children, AddFunction::name);
+        }
+        return result;
+    } else if (ExpressionUtil::isRecursiveRelPattern(*param)) {
+        return param->constPtrCast<RelExpression>()->getLengthExpression();
+    }
+    KU_UNREACHABLE;
+}
+
+function_set LengthFunction::getFunctionSet() {
+    function_set result;
+    auto function = std::make_unique<RewriteFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::RECURSIVE_REL}, rewriteFunc);
+    result.push_back(std::move(function));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/nodes_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/nodes_function.cpp
new file mode 100644
index 0000000000..28391985fb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/nodes_function.cpp
@@ -0,0 +1,32 @@
+#include "binder/expression/expression_util.h"
+#include "function/path/vector_path_functions.h"
+#include "function/scalar_function.h"
+#include "function/struct/vector_struct_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    const auto& structType = input.arguments[0]->getDataType();
+    auto fieldIdx = StructType::getFieldIdx(structType, InternalKeyword::NODES);
+    auto resultType = StructType::getField(structType, fieldIdx).getType().copy();
+    auto bindData = std::make_unique<StructExtractBindData>(std::move(resultType), fieldIdx);
+    bindData->paramTypes = ExpressionUtil::getDataTypes(input.arguments);
+    return bindData;
+}
+
+function_set NodesFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::RECURSIVE_REL}, LogicalTypeID::ANY);
+    function->bindFunc = bindFunc;
+    function->compileFunc = StructExtractFunctions::compileFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/properties_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/properties_function.cpp
new file mode 100644
index 0000000000..6f5933f511
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/properties_function.cpp
@@ -0,0 +1,71 @@
+#include "binder/expression/literal_expression.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "common/vector/value_vector.h"
+#include "function/path/vector_path_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    if (input.arguments[1]->expressionType != ExpressionType::LITERAL) {
+        throw BinderException(stringFormat(
+            "Expected literal input as the second argument for {}().", PropertiesFunction::name));
+    }
+    auto literalExpr = input.arguments[1]->constPtrCast<LiteralExpression>();
+    auto key = literalExpr->getValue().getValue<std::string>();
+    const auto& listType = input.arguments[0]->getDataType();
+    const auto& childType = ListType::getChildType(listType);
+    struct_field_idx_t fieldIdx = 0;
+    if (childType.getLogicalTypeID() == LogicalTypeID::NODE ||
+        childType.getLogicalTypeID() == LogicalTypeID::REL) {
+        fieldIdx = StructType::getFieldIdx(childType, key);
+        if (fieldIdx == INVALID_STRUCT_FIELD_IDX) {
+            throw BinderException(stringFormat("Invalid property name: {}.", key));
+        }
+    } else {
+        throw BinderException(
+            stringFormat("Cannot extract properties from {}.", listType.toString()));
+    }
+    const auto& field = StructType::getField(childType, fieldIdx);
+    auto returnType = LogicalType::LIST(field.getType().copy());
+    auto bindData = std::make_unique<PropertiesBindData>(std::move(returnType), fieldIdx);
+    bindData->paramTypes.push_back(input.arguments[0]->getDataType().copy());
+    bindData->paramTypes.push_back(LogicalType(input.definition->parameterTypeIDs[1]));
+    return bindData;
+}
+
+static void compileFunc(FunctionBindData* bindData,
+    const std::vector<std::shared_ptr<ValueVector>>& parameters,
+    std::shared_ptr<ValueVector>& result) {
+    KU_ASSERT(parameters[0]->dataType.getPhysicalType() == PhysicalTypeID::LIST);
+    auto& propertiesBindData = bindData->cast<PropertiesBindData>();
+    auto fieldVector = StructVector::getFieldVector(ListVector::getDataVector(parameters[0].get()),
+        propertiesBindData.childIdx);
+    ListVector::setDataVector(result.get(), fieldVector);
+}
+
+static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+    const std::vector<common::SelectionVector*>& parameterSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* /*dataPtr*/) {
+    ListVector::copyListEntryAndBufferMetaData(result, *resultSelVector, *parameters[0],
+        *parameterSelVectors[0]);
+}
+
+function_set PropertiesFunction::getFunctionSet() {
+    function_set functions;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::STRING}, LogicalTypeID::ANY,
+        execFunc);
+    function->bindFunc = bindFunc;
+    function->compileFunc = compileFunc;
+    functions.push_back(std::move(function));
+    return functions;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/rels_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/rels_function.cpp
new file mode 100644
index 0000000000..d11e2fd1f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/rels_function.cpp
@@ -0,0 +1,32 @@
+#include "binder/expression/expression_util.h"
+#include "function/path/vector_path_functions.h"
+#include "function/scalar_function.h"
+#include "function/struct/vector_struct_functions.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    const auto& structType = input.arguments[0]->getDataType();
+    auto fieldIdx = StructType::getFieldIdx(structType, InternalKeyword::RELS);
+    auto resultType = StructType::getField(structType, fieldIdx).getType().copy();
+    auto bindData = std::make_unique<StructExtractBindData>(std::move(resultType), fieldIdx);
+    bindData->paramTypes = binder::ExpressionUtil::getDataTypes(input.arguments);
+    return bindData;
+}
+
+function_set RelsFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::RECURSIVE_REL}, LogicalTypeID::ANY);
+    function->bindFunc = bindFunc;
+    function->compileFunc = StructExtractFunctions::compileFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/semantic_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/semantic_function.cpp
new file mode 100644
index 0000000000..2e541cdb66
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/path/semantic_function.cpp
@@ -0,0 +1,59 @@
+#include "common/vector/value_vector.h"
+#include "function/path/path_function_executor.h"
+#include "function/path/vector_path_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    return FunctionBindData::getSimpleBindData(input.arguments, LogicalType::BOOL());
+}
+
+static void IsTrailExecFunc(const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+    const std::vector<common::SelectionVector*>& parameterSelVectors, common::ValueVector& result,
+    common::SelectionVector*, void* /*dataPtr*/) {
+    UnaryPathExecutor::executeRelIDs(*parameters[0], *parameterSelVectors[0], result);
+}
+
+static bool IsTrailSelectFunc(const std::vector<std::shared_ptr<ValueVector>>& parameters,
+    SelectionVector& selectionVector, void* /* dataPtr */) {
+    return UnaryPathExecutor::selectRelIDs(*parameters[0], selectionVector);
+}
+
+function_set IsTrailFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::RECURSIVE_REL}, LogicalTypeID::BOOL,
+        IsTrailExecFunc, IsTrailSelectFunc);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+static void IsACyclicExecFunc(const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+    const std::vector<common::SelectionVector*>& parameterSelVectors, common::ValueVector& result,
+    common::SelectionVector*, void* /*dataPtr*/) {
+    UnaryPathExecutor::executeNodeIDs(*parameters[0], *parameterSelVectors[0], result);
+}
+
+static bool IsACyclicSelectFunc(const std::vector<std::shared_ptr<ValueVector>>& parameters,
+    SelectionVector& selectionVector, void* /* dataPtr */) {
+    return UnaryPathExecutor::selectNodeIDs(*parameters[0], selectionVector);
+}
+
+function_set IsACyclicFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::RECURSIVE_REL}, LogicalTypeID::BOOL,
+        IsACyclicExecFunc, IsACyclicSelectFunc);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/CMakeLists.txt
new file mode 100644
index 0000000000..6710235cb2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/CMakeLists.txt
@@ -0,0 +1,10 @@
+add_library(lbug_function_pattern
+        OBJECT
+        cost_function.cpp
+        id_function.cpp
+        label_function.cpp
+        start_end_node_function.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_pattern>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/cost_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/cost_function.cpp
new file mode 100644
index 0000000000..7bcd53a2f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/cost_function.cpp
@@ -0,0 +1,33 @@
+#include "binder/expression/rel_expression.h"
+#include "common/exception/binder.h"
+#include "function/rewrite_function.h"
+#include "function/schema/vector_node_rel_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+static std::shared_ptr<Expression> rewriteFunc(const RewriteFunctionBindInput& input) {
+    KU_ASSERT(input.arguments.size() == 1);
+    auto param = input.arguments[0].get();
+    KU_ASSERT(param->getDataType().getLogicalTypeID() == LogicalTypeID::RECURSIVE_REL);
+    auto recursiveInfo = param->ptrCast<RelExpression>()->getRecursiveInfo();
+    if (recursiveInfo->bindData->weightOutputExpr == nullptr) {
+        throw BinderException(
+            stringFormat("Cost function is not defined for {}", param->toString()));
+    }
+    return recursiveInfo->bindData->weightOutputExpr;
+}
+
+function_set CostFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<RewriteFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::RECURSIVE_REL}, rewriteFunc);
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/id_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/id_function.cpp
new file mode 100644
index 0000000000..0e3cccd4e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/id_function.cpp
@@ -0,0 +1,45 @@
+#include "binder/expression/expression_util.h"
+#include "binder/expression/node_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "binder/expression_binder.h"
+#include "function/rewrite_function.h"
+#include "function/schema/vector_node_rel_functions.h"
+#include "function/struct/vector_struct_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+static std::shared_ptr<Expression> rewriteFunc(const RewriteFunctionBindInput& input) {
+    KU_ASSERT(input.arguments.size() == 1);
+    auto param = input.arguments[0].get();
+    if (ExpressionUtil::isNodePattern(*param)) {
+        auto node = param->constPtrCast<NodeExpression>();
+        return node->getInternalID();
+    }
+    if (ExpressionUtil::isRelPattern(*param)) {
+        auto rel = param->constPtrCast<RelExpression>();
+        return rel->getPropertyExpression(InternalKeyword::ID);
+    }
+    // Bind as struct_extract(param, "_id")
+    auto extractKey = input.expressionBinder->createLiteralExpression(InternalKeyword::ID);
+    return input.expressionBinder->bindScalarFunctionExpression({input.arguments[0], extractKey},
+        StructExtractFunctions::name);
+}
+
+function_set IDFunction::getFunctionSet() {
+    function_set functionSet;
+    auto inputTypes =
+        std::vector<LogicalTypeID>{LogicalTypeID::NODE, LogicalTypeID::REL, LogicalTypeID::STRUCT};
+    for (auto& inputType : inputTypes) {
+        auto function = std::make_unique<RewriteFunction>(name,
+            std::vector<LogicalTypeID>{inputType}, rewriteFunc);
+        functionSet.push_back(std::move(function));
+    }
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/label_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/label_function.cpp
new file mode 100644
index 0000000000..4bf566fc33
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/label_function.cpp
@@ -0,0 +1,150 @@
+#include "binder/expression/expression_util.h"
+#include "binder/expression/node_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "binder/expression/scalar_function_expression.h"
+#include "binder/expression_binder.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "function/binary_function_executor.h"
+#include "function/list/functions/list_extract_function.h"
+#include "function/rewrite_function.h"
+#include "function/scalar_function.h"
+#include "function/schema/vector_node_rel_functions.h"
+#include "function/struct/vector_struct_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace function {
+
+struct Label {
+    static void operation(internalID_t& left, list_entry_t& right, ku_string_t& result,
+        ValueVector& leftVector, ValueVector& rightVector, ValueVector& resultVector,
+        uint64_t resPos) {
+        KU_ASSERT(left.tableID < right.size);
+        ListExtract::operation(right, left.tableID + 1 /* listExtract requires 1-based index */,
+            result, rightVector, leftVector, resultVector, resPos);
+    }
+};
+
+static void execFunction(const std::vector<std::shared_ptr<ValueVector>>& params,
+    const std::vector<SelectionVector*>& paramSelVectors, ValueVector& result,
+    SelectionVector* resultSelVector, void* dataPtr = nullptr) {
+    KU_ASSERT(params.size() == 2);
+    BinaryFunctionExecutor::executeSwitch<internalID_t, list_entry_t, ku_string_t, Label,
+        BinaryListExtractFunctionWrapper>(*params[0], paramSelVectors[0], *params[1],
+        paramSelVectors[1], result, resultSelVector, dataPtr);
+}
+
+static std::shared_ptr<Expression> getLabelsAsLiteral(
+    std::unordered_map<table_id_t, std::string> map, ExpressionBinder* expressionBinder) {
+    table_id_t maxTableID = 0;
+    for (auto [id, name] : map) {
+        if (id > maxTableID) {
+            maxTableID = id;
+        }
+    }
+    std::vector<std::unique_ptr<Value>> labels;
+    labels.resize(maxTableID + 1);
+    for (auto i = 0u; i < labels.size(); ++i) {
+        if (map.contains(i)) {
+            labels[i] = std::make_unique<Value>(LogicalType::STRING(), map.at(i));
+        } else {
+            labels[i] = std::make_unique<Value>(LogicalType::STRING(), std::string(""));
+        }
+    }
+    auto labelsValue = Value(LogicalType::LIST(LogicalType::STRING()), std::move(labels));
+    return expressionBinder->createLiteralExpression(labelsValue);
+}
+
+static std::unordered_map<table_id_t, std::string> getNodeTableIDToLabel(
+    std::vector<TableCatalogEntry*> entries) {
+    std::unordered_map<table_id_t, std::string> map;
+    for (auto& entry : entries) {
+        map.insert({entry->getTableID(), entry->getName()});
+    }
+    return map;
+}
+
+static std::unordered_map<table_id_t, std::string> getRelTableIDToLabel(
+    std::vector<TableCatalogEntry*> entries) {
+    std::unordered_map<table_id_t, std::string> map;
+    for (auto& entry : entries) {
+        auto& relGroupEntry = entry->constCast<RelGroupCatalogEntry>();
+        for (auto& relEntryInfo : relGroupEntry.getRelEntryInfos()) {
+            map.insert({relEntryInfo.oid, entry->getName()});
+        }
+    }
+    return map;
+}
+
+std::shared_ptr<Expression> LabelFunction::rewriteFunc(const RewriteFunctionBindInput& input) {
+    KU_ASSERT(input.arguments.size() == 1);
+    auto argument = input.arguments[0].get();
+    auto expressionBinder = input.expressionBinder;
+    if (ExpressionUtil::isNullLiteral(*argument)) {
+        return expressionBinder->createNullLiteralExpression();
+    }
+    expression_vector children;
+    if (argument->expressionType == ExpressionType::VARIABLE) {
+        children.push_back(input.arguments[0]);
+        children.push_back(expressionBinder->createLiteralExpression(InternalKeyword::LABEL));
+        return expressionBinder->bindScalarFunctionExpression(children,
+            StructExtractFunctions::name);
+    }
+    auto disableLiteralRewrite = expressionBinder->getConfig().disableLabelFunctionLiteralRewrite;
+    if (ExpressionUtil::isNodePattern(*argument)) {
+        auto& node = argument->constCast<NodeExpression>();
+        if (!disableLiteralRewrite) {
+            if (node.isEmpty()) {
+                return expressionBinder->createLiteralExpression("");
+            }
+            if (!node.isMultiLabeled()) {
+                auto label = node.getEntry(0)->getName();
+                return expressionBinder->createLiteralExpression(label);
+            }
+        }
+        children.push_back(node.getInternalID());
+        auto map = getNodeTableIDToLabel(node.getEntries());
+        children.push_back(getLabelsAsLiteral(map, expressionBinder));
+    } else if (ExpressionUtil::isRelPattern(*argument)) {
+        auto& rel = argument->constCast<RelExpression>();
+        if (!disableLiteralRewrite) {
+            if (rel.isEmpty()) {
+                return expressionBinder->createLiteralExpression("");
+            }
+            if (!rel.isMultiLabeled()) {
+                auto label = rel.getEntry(0)->getName();
+                return expressionBinder->createLiteralExpression(label);
+            }
+        }
+        children.push_back(rel.getInternalID());
+        auto map = getRelTableIDToLabel(rel.getEntries());
+        children.push_back(getLabelsAsLiteral(map, expressionBinder));
+    }
+    KU_ASSERT(children.size() == 2);
+    auto function = std::make_unique<ScalarFunction>(LabelFunction::name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64},
+        LogicalTypeID::STRING, execFunction);
+    auto bindData = std::make_unique<function::FunctionBindData>(LogicalType::STRING());
+    auto uniqueName = ScalarFunctionExpression::getUniqueName(LabelFunction::name, children);
+    return std::make_shared<ScalarFunctionExpression>(ExpressionType::FUNCTION, std::move(function),
+        std::move(bindData), std::move(children), uniqueName);
+}
+
+function_set LabelFunction::getFunctionSet() {
+    function_set set;
+    auto inputTypes =
+        std::vector<LogicalTypeID>{LogicalTypeID::NODE, LogicalTypeID::REL, LogicalTypeID::STRUCT};
+    for (auto& inputType : inputTypes) {
+        auto function = std::make_unique<RewriteFunction>(name,
+            std::vector<LogicalTypeID>{inputType}, rewriteFunc);
+        set.push_back(std::move(function));
+    }
+    return set;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/start_end_node_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/start_end_node_function.cpp
new file mode 100644
index 0000000000..d559668d93
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/pattern/start_end_node_function.cpp
@@ -0,0 +1,53 @@
+#include "binder/expression/expression_util.h"
+#include "binder/expression/rel_expression.h"
+#include "binder/expression_binder.h"
+#include "function/rewrite_function.h"
+#include "function/schema/vector_node_rel_functions.h"
+#include "function/struct/vector_struct_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+static std::shared_ptr<Expression> startRewriteFunc(const RewriteFunctionBindInput& input) {
+    KU_ASSERT(input.arguments.size() == 1);
+    auto param = input.arguments[0].get();
+    if (ExpressionUtil::isRelPattern(*param)) {
+        return param->constCast<RelExpression>().getSrcNode();
+    }
+    auto extractKey = input.expressionBinder->createLiteralExpression(InternalKeyword::SRC);
+    return input.expressionBinder->bindScalarFunctionExpression({input.arguments[0], extractKey},
+        StructExtractFunctions::name);
+}
+
+function_set StartNodeFunction::getFunctionSet() {
+    function_set set;
+    auto function = std::make_unique<RewriteFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::REL}, startRewriteFunc);
+    set.push_back(std::move(function));
+    return set;
+}
+
+static std::shared_ptr<Expression> endRewriteFunc(const RewriteFunctionBindInput& input) {
+    KU_ASSERT(input.arguments.size() == 1);
+    auto param = input.arguments[0].get();
+    if (ExpressionUtil::isRelPattern(*param)) {
+        return param->constCast<RelExpression>().getDstNode();
+    }
+    auto extractKey = input.expressionBinder->createLiteralExpression(InternalKeyword::DST);
+    return input.expressionBinder->bindScalarFunctionExpression({input.arguments[0], extractKey},
+        StructExtractFunctions::name);
+}
+
+function_set EndNodeFunction::getFunctionSet() {
+    function_set set;
+    auto function = std::make_unique<RewriteFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::REL}, endRewriteFunc);
+    set.push_back(std::move(function));
+    return set;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/scalar_macro_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/scalar_macro_function.cpp
new file mode 100644
index 0000000000..69de6a7306
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/scalar_macro_function.cpp
@@ -0,0 +1,72 @@
+#include "function/scalar_macro_function.h"
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+
+using namespace lbug::common;
+using namespace lbug::parser;
+
+namespace lbug {
+namespace function {
+
+macro_parameter_value_map ScalarMacroFunction::getDefaultParameterVals() const {
+    macro_parameter_value_map defaultArgsToReturn;
+    for (auto& defaultArg : defaultArgs) {
+        defaultArgsToReturn.emplace(defaultArg.first, defaultArg.second.get());
+    }
+    return defaultArgsToReturn;
+}
+
+std::unique_ptr<ScalarMacroFunction> ScalarMacroFunction::copy() const {
+    default_macro_args defaultArgsCopy;
+    for (auto& defaultArg : defaultArgs) {
+        defaultArgsCopy.emplace_back(defaultArg.first, defaultArg.second->copy());
+    }
+    return std::make_unique<ScalarMacroFunction>(expression->copy(), positionalArgs,
+        std::move(defaultArgsCopy));
+}
+
+void ScalarMacroFunction::serialize(Serializer& serializer) const {
+    expression->serialize(serializer);
+    serializer.serializeVector(positionalArgs);
+    uint64_t vectorSize = defaultArgs.size();
+    serializer.serializeValue(vectorSize);
+    for (auto& defaultArg : defaultArgs) {
+        serializer.serializeValue(defaultArg.first);
+        defaultArg.second->serialize(serializer);
+    }
+}
+
+std::unique_ptr<ScalarMacroFunction> ScalarMacroFunction::deserialize(Deserializer& deserializer) {
+    auto expression = ParsedExpression::deserialize(deserializer);
+    std::vector<std::string> positionalArgs;
+    deserializer.deserializeVector(positionalArgs);
+    default_macro_args defaultArgs;
+    uint64_t vectorSize = 0;
+    deserializer.deserializeValue(vectorSize);
+    defaultArgs.reserve(vectorSize);
+    for (auto i = 0u; i < vectorSize; i++) {
+        std::string key;
+        deserializer.deserializeValue(key);
+        auto val = ParsedExpression::deserialize(deserializer);
+        defaultArgs.emplace_back(std::move(key), std::move(val));
+    }
+    return std::make_unique<ScalarMacroFunction>(std::move(expression), std::move(positionalArgs),
+        std::move(defaultArgs));
+}
+
+std::string ScalarMacroFunction::toCypher(const std::string& name) const {
+    std::vector<std::string> paramStrings;
+    for (auto& param : positionalArgs) {
+        paramStrings.push_back(param);
+    }
+    for (auto& defaultParam : defaultArgs) {
+        paramStrings.push_back(defaultParam.first + ":=" + defaultParam.second->toString());
+    }
+    return stringFormat("CREATE MACRO `{}` ({}) AS {};", name, StringUtils::join(paramStrings, ","),
+        expression->toString());
+}
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/sequence/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/sequence/CMakeLists.txt
new file mode 100644
index 0000000000..893cf979eb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/sequence/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_function_sequence
+        OBJECT
+        sequence_functions.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_sequence>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/sequence/sequence_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/sequence/sequence_functions.cpp
new file mode 100644
index 0000000000..c63de9d9af
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/sequence/sequence_functions.cpp
@@ -0,0 +1,59 @@
+#include "function/sequence/sequence_functions.h"
+
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "function/scalar_function.h"
+#include "main/client_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct CurrVal {
+    static void operation(ku_string_t& input, ValueVector& result, void* dataPtr) {
+        auto ctx = reinterpret_cast<FunctionBindData*>(dataPtr)->clientContext;
+        auto catalog = catalog::Catalog::Get(*ctx);
+        auto transaction = transaction::Transaction::Get(*ctx);
+        auto sequenceName = input.getAsString();
+        auto sequenceEntry =
+            catalog->getSequenceEntry(transaction, sequenceName, ctx->useInternalCatalogEntry());
+        result.setValue(0, sequenceEntry->currVal());
+    }
+};
+
+struct NextVal {
+    static void operation(ku_string_t& input, ValueVector& result, void* dataPtr) {
+        auto ctx = reinterpret_cast<FunctionBindData*>(dataPtr)->clientContext;
+        auto cnt = reinterpret_cast<FunctionBindData*>(dataPtr)->count;
+        auto catalog = catalog::Catalog::Get(*ctx);
+        auto transaction = transaction::Transaction::Get(*ctx);
+        auto sequenceName = input.getAsString();
+        auto sequenceEntry =
+            catalog->getSequenceEntry(transaction, sequenceName, ctx->useInternalCatalogEntry());
+        sequenceEntry->nextKVal(transaction, cnt, result);
+        result.state->getSelVectorUnsafe().setSelSize(cnt);
+    }
+};
+
+function_set CurrValFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING}, LogicalTypeID::INT64,
+        ScalarFunction::UnarySequenceExecFunction<ku_string_t, ValueVector, CurrVal>));
+    return functionSet;
+}
+
+function_set NextValFunction::getFunctionSet() {
+    function_set functionSet;
+    auto func = make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::STRING},
+        LogicalTypeID::INT64,
+        ScalarFunction::UnarySequenceExecFunction<ku_string_t, ValueVector, NextVal>);
+    func->isReadOnly = false;
+    functionSet.push_back(std::move(func));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/CMakeLists.txt
new file mode 100644
index 0000000000..83357e41d4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/CMakeLists.txt
@@ -0,0 +1,13 @@
+add_library(lbug_string_function
+        OBJECT
+        concat_ws.cpp
+        string_split_function.cpp
+        init_cap_function.cpp
+        levenshtein_function.cpp
+        split_part.cpp
+        regex_full_match_function.cpp
+        regex_replace_function.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_string_function>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/concat_ws.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/concat_ws.cpp
new file mode 100644
index 0000000000..a1f50bfb38
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/concat_ws.cpp
@@ -0,0 +1,111 @@
+#include "common/exception/binder.h"
+#include "function/string/vector_string_functions.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    if (input.arguments.size() < 2) {
+        throw BinderException{stringFormat("concat_ws expects at least two parameters. Got: {}.",
+            input.arguments.size())};
+    }
+    for (auto i = 0u; i < input.arguments.size(); i++) {
+        auto& argument = input.arguments[i];
+        if (argument->getDataType().getLogicalTypeID() == LogicalTypeID::ANY) {
+            argument->cast(LogicalType::STRING());
+        }
+        if (argument->getDataType() != LogicalType::STRING()) {
+            throw BinderException{stringFormat("concat_ws expects all string parameters. Got: {}.",
+                argument->getDataType().toString())};
+        }
+    }
+    return FunctionBindData::getSimpleBindData(input.arguments, LogicalType::STRING());
+}
+
+using handle_separator_func_t = std::function<void()>;
+using handle_element_func_t = std::function<void(const ku_string_t&)>;
+
+static void iterateParams(const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+    const std::vector<common::SelectionVector*>& parameterSelVectors, sel_t pos,
+    handle_separator_func_t handleSeparatorFunc, handle_element_func_t handleElementFunc) {
+    bool isPrevNull = false;
+    for (auto i = 1u; i < parameters.size(); i++) {
+        const auto& parameter = parameters[i];
+        const auto& parameterSelVector = *parameterSelVectors[i];
+        auto paramPos = parameter->state->isFlat() ? parameterSelVector[0] : pos;
+        if (parameter->isNull(paramPos)) {
+            isPrevNull = true;
+            continue;
+        }
+        if (i != 1u && !isPrevNull) {
+            handleSeparatorFunc();
+        }
+        handleElementFunc(parameter->getValue<ku_string_t>(paramPos));
+        isPrevNull = false;
+    }
+}
+
+void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+    const std::vector<common::SelectionVector*>& parameterSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* /*dataPtr*/) {
+    result.resetAuxiliaryBuffer();
+    for (auto selectedPos = 0u; selectedPos < resultSelVector->getSelSize(); ++selectedPos) {
+        auto pos = (*resultSelVector)[selectedPos];
+        auto separatorPos = parameters[0]->state->isFlat() ? (*parameterSelVectors[0])[0] : pos;
+        if (parameters[0]->isNull(separatorPos)) {
+            result.setNull(pos, true /* isNull */);
+            continue;
+        }
+        auto separator = parameters[0]->getValue<ku_string_t>(separatorPos);
+        auto len = 0u;
+        bool isPrevNull = false;
+        iterateParams(
+            parameters, parameterSelVectors, pos, [&]() { len += separator.len; },
+            [&](const ku_string_t& str) { len += str.len; });
+        for (auto i = 1u; i < parameters.size(); i++) {
+            const auto& parameter = parameters[i];
+            const auto& parameterSelVector = *parameterSelVectors[i];
+            auto paramPos = parameter->state->isFlat() ? parameterSelVector[0] : pos;
+            if (parameter->isNull(paramPos)) {
+                isPrevNull = true;
+                continue;
+            }
+            if (i != 1u && !isPrevNull) {}
+
+            isPrevNull = false;
+        }
+        common::ku_string_t resultStr;
+        StringVector::reserveString(&result, resultStr, len);
+        auto resultBuffer = resultStr.getData();
+        iterateParams(
+            parameters, parameterSelVectors, pos,
+            [&]() {
+                memcpy((void*)resultBuffer, (void*)separator.getData(), separator.len);
+                resultBuffer += separator.len;
+            },
+            [&](const ku_string_t& str) {
+                memcpy((void*)resultBuffer, (void*)str.getData(), str.len);
+                resultBuffer += str.len;
+            });
+        memcpy(resultStr.prefix, resultStr.getData(),
+            std::min<uint64_t>(resultStr.len, ku_string_t::PREFIX_LENGTH));
+        KU_ASSERT(resultBuffer - resultStr.getData() == len);
+        result.setNull(pos, false /* isNull */);
+        result.setValue(pos, resultStr);
+    }
+}
+
+function_set ConcatWSFunction::getFunctionSet() {
+    function_set functionSet;
+    auto func = make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::STRING},
+        LogicalTypeID::STRING, execFunc);
+    func->bindFunc = bindFunc;
+    func->isVarLength = true;
+    functionSet.push_back(std::move(func));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/init_cap_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/init_cap_function.cpp
new file mode 100644
index 0000000000..c34e1098b5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/init_cap_function.cpp
@@ -0,0 +1,27 @@
+#include "function/string/vector_string_functions.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+struct InitCap {
+    static void operation(ku_string_t& operand, ku_string_t& result, ValueVector& resultVector) {
+        Lower::operation(operand, result, resultVector);
+        int originalSize = 0, newSize = 0;
+        BaseLowerUpperFunction::convertCharCase(reinterpret_cast<char*>(result.getDataUnsafe()),
+            reinterpret_cast<const char*>(result.getData()), 0 /* charPos */, true /* toUpper */,
+            originalSize, newSize);
+    }
+};
+
+function_set InitCapFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING}, LogicalTypeID::STRING,
+        ScalarFunction::UnaryStringExecFunction<ku_string_t, ku_string_t, InitCap>));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/levenshtein_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/levenshtein_function.cpp
new file mode 100644
index 0000000000..956d370171
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/levenshtein_function.cpp
@@ -0,0 +1,63 @@
+#include "function/string/vector_string_functions.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+struct Levenshtein {
+public:
+    static void operation(common::ku_string_t& left, common::ku_string_t& right, int64_t& result) {
+        // If one string is empty, the distance equals the length of the other string.
+        if (left.len == 0 || right.len == 0) {
+            result = left.len + right.len;
+            return;
+        }
+
+        auto leftStr = left.getData();
+        auto rightStr = right.getData();
+
+        std::vector<uint64_t> distances0(right.len + 1, 0);
+        std::vector<uint64_t> distances1(right.len + 1, 0);
+
+        uint64_t substitutionCost = 0;
+        uint64_t insertionCost = 0;
+        uint64_t deletionCost = 0;
+
+        for (auto i = 0u; i <= right.len; i++) {
+            distances0[i] = i;
+        }
+
+        for (auto i = 0u; i < left.len; i++) {
+            distances1[0] = i + 1;
+            for (auto j = 0u; j < right.len; j++) {
+                deletionCost = distances0[j + 1] + 1;
+                insertionCost = distances1[j] + 1;
+                substitutionCost = distances0[j];
+
+                if (leftStr[i] != rightStr[j]) {
+                    substitutionCost += 1;
+                }
+                distances1[j + 1] =
+                    std::min(deletionCost, std::min(substitutionCost, insertionCost));
+            }
+            // Copy distances1 (current row) to distances0 (previous row) for next iteration
+            // since data in distances1 is always invalidated, a swap without copy is more
+            // efficient.
+            distances0 = distances1;
+        }
+        result = distances0[right.len];
+    }
+};
+
+function_set LevenshteinFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::INT64,
+        ScalarFunction::BinaryExecFunction<ku_string_t, ku_string_t, int64_t, Levenshtein>));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/regex_full_match_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/regex_full_match_function.cpp
new file mode 100644
index 0000000000..3c6b96aeef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/regex_full_match_function.cpp
@@ -0,0 +1,73 @@
+#include "binder/expression/expression_util.h"
+#include "expression_evaluator/expression_evaluator_utils.h"
+#include "function/string/functions/base_regexp_function.h"
+#include "function/string/vector_string_functions.h"
+#include "re2.h"
+
+namespace lbug {
+namespace function {
+
+using namespace common;
+
+struct RegexFullMatchBindData : public FunctionBindData {
+    regex::RE2 pattern;
+
+    explicit RegexFullMatchBindData(common::logical_type_vec_t paramTypes, std::string patternInStr)
+        : FunctionBindData{std::move(paramTypes), common::LogicalType::BOOL()},
+          pattern{patternInStr} {}
+
+    std::unique_ptr<FunctionBindData> copy() const override {
+        return std::make_unique<RegexFullMatchBindData>(copyVector(paramTypes), pattern.pattern());
+    }
+};
+
+struct RegexpFullMatch {
+    static void operation(common::ku_string_t& left, common::ku_string_t& right, uint8_t& result) {
+        result = RE2::FullMatch(left.getAsString(),
+            BaseRegexpOperation::parseCypherPattern(right.getAsString()));
+    }
+};
+
+struct RegexpFullMatchStaticPattern : BaseRegexpOperation {
+    static void operation(common::ku_string_t& left, common::ku_string_t& /*right*/,
+        uint8_t& result, common::ValueVector& /*leftValueVector*/,
+        common::ValueVector& /*rightValueVector*/, common::ValueVector& /*resultValueVector*/,
+        void* dataPtr) {
+        auto regexFullMatchBindData = reinterpret_cast<RegexFullMatchBindData*>(dataPtr);
+        result = RE2::FullMatch(left.getAsString(), regexFullMatchBindData->pattern);
+    }
+};
+
+static std::unique_ptr<FunctionBindData> regexFullMatchBindFunc(const ScalarBindFuncInput& input) {
+    if (input.arguments[1]->expressionType == ExpressionType::LITERAL) {
+        auto value = evaluator::ExpressionEvaluatorUtils::evaluateConstantExpression(
+            input.arguments[1], input.context);
+        input.definition->ptrCast<ScalarFunction>()->execFunc =
+            ScalarFunction::BinaryExecWithBindData<ku_string_t, ku_string_t, uint8_t,
+                RegexpFullMatchStaticPattern>;
+        input.definition->ptrCast<ScalarFunction>()->selectFunc =
+            ScalarFunction::BinarySelectWithBindData<ku_string_t, ku_string_t,
+                RegexpFullMatchStaticPattern>;
+        auto patternInStr = value.getValue<std::string>();
+        return std::make_unique<RegexFullMatchBindData>(
+            binder::ExpressionUtil::getDataTypes(input.arguments),
+            BaseRegexpOperation::parseCypherPattern(patternInStr));
+    } else {
+        return FunctionBindData::getSimpleBindData(input.arguments, LogicalType::BOOL());
+    }
+}
+
+function_set RegexpFullMatchFunction::getFunctionSet() {
+    function_set functionSet;
+    auto scalarFunc = make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::BOOL,
+        ScalarFunction::BinaryExecFunction<ku_string_t, ku_string_t, uint8_t, RegexpFullMatch>,
+        ScalarFunction::BinarySelectFunction<ku_string_t, ku_string_t, RegexpFullMatch>);
+    scalarFunc->bindFunc = regexFullMatchBindFunc;
+    functionSet.emplace_back(std::move(scalarFunc));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/regex_replace_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/regex_replace_function.cpp
new file mode 100644
index 0000000000..70e6103c2d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/regex_replace_function.cpp
@@ -0,0 +1,142 @@
+#include "binder/expression/expression_util.h"
+#include "common/exception/binder.h"
+#include "expression_evaluator/expression_evaluator_utils.h"
+#include "function/string/functions/base_regexp_function.h"
+#include "function/string/vector_string_functions.h"
+#include "re2.h"
+
+namespace lbug {
+namespace function {
+
+using namespace common;
+
+using re2_replace_func_t =
+    std::function<void(std::string* str, const RE2& re, const regex::StringPiece& rewrite)>;
+
+struct RegexReplaceBindData : public FunctionBindData {
+    re2_replace_func_t replaceFunc;
+
+    RegexReplaceBindData(common::logical_type_vec_t paramTypes, re2_replace_func_t replaceFunc)
+        : FunctionBindData{std::move(paramTypes), common::LogicalType::STRING()},
+          replaceFunc{std::move(replaceFunc)} {}
+
+    std::unique_ptr<FunctionBindData> copy() const override {
+        return std::make_unique<RegexReplaceBindData>(copyVector(paramTypes), replaceFunc);
+    }
+};
+
+struct RegexpReplace {
+    static void operation(common::ku_string_t& value, common::ku_string_t& pattern,
+        common::ku_string_t& replacement, common::ku_string_t& result,
+        common::ValueVector& resultValueVector, void* dataPtr) {
+        auto bindData = reinterpret_cast<RegexReplaceBindData*>(dataPtr);
+        std::string resultStr = value.getAsString();
+        RE2 re2Pattern{pattern.getAsString()};
+        bindData->replaceFunc(&resultStr, re2Pattern, replacement.getAsString());
+        BaseRegexpOperation::copyToLbugString(resultStr, result, resultValueVector);
+    }
+};
+
+struct RegexReplaceBindDataStaticPattern : public RegexReplaceBindData {
+    regex::RE2 pattern;
+
+    RegexReplaceBindDataStaticPattern(common::logical_type_vec_t paramTypes,
+        re2_replace_func_t replaceFunc, std::string patternInStr)
+        : RegexReplaceBindData{std::move(paramTypes), std::move(replaceFunc)},
+          pattern{patternInStr} {}
+
+    std::unique_ptr<FunctionBindData> copy() const override {
+        return std::make_unique<RegexReplaceBindDataStaticPattern>(copyVector(paramTypes),
+            replaceFunc, pattern.pattern());
+    }
+};
+
+struct RegexpReplaceStaticPattern {
+    static void operation(common::ku_string_t& value, common::ku_string_t& /*pattern*/,
+        common::ku_string_t& replacement, common::ku_string_t& result,
+        common::ValueVector& resultValueVector, void* dataPtr) {
+        auto bindData = reinterpret_cast<RegexReplaceBindDataStaticPattern*>(dataPtr);
+        auto resultStr = value.getAsString();
+        bindData->replaceFunc(&resultStr, bindData->pattern, replacement.getAsString());
+        BaseRegexpOperation::copyToLbugString(resultStr, result, resultValueVector);
+    }
+};
+
+static re2_replace_func_t bindReplaceFunc(const binder::expression_vector& expr) {
+    re2_replace_func_t result;
+    switch (expr.size()) {
+    case 3: {
+        result = RE2::Replace;
+    } break;
+    case 4: {
+        result = RE2::GlobalReplace;
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return result;
+}
+
+template<typename OP>
+scalar_func_exec_t getExecFunc(const binder::expression_vector& expr) {
+    scalar_func_exec_t execFunc;
+    switch (expr.size()) {
+    case 3: {
+        execFunc = ScalarFunction::TernaryRegexExecFunction<ku_string_t, ku_string_t, ku_string_t,
+            ku_string_t, OP>;
+    } break;
+    case 4: {
+        auto option = expr[3];
+        binder::ExpressionUtil::validateExpressionType(*option, ExpressionType::LITERAL);
+        binder::ExpressionUtil::validateDataType(*option, LogicalType::STRING());
+        auto optionVal = binder::ExpressionUtil::getLiteralValue<std::string>(*option);
+        if (optionVal != RegexpReplaceFunction::GLOBAL_REPLACE_OPTION) {
+            throw common::BinderException{
+                "regex_replace can only support global replace option: g."};
+        }
+        execFunc = ScalarFunction::TernaryRegexExecFunction<ku_string_t, ku_string_t, ku_string_t,
+            ku_string_t, OP>;
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return execFunc;
+}
+
+std::unique_ptr<FunctionBindData> bindFunc(ScalarBindFuncInput input) {
+    auto definition = input.definition->ptrCast<ScalarFunction>();
+    re2_replace_func_t replaceFunc = bindReplaceFunc(input.arguments);
+    if (input.arguments[1]->expressionType == ExpressionType::LITERAL) {
+        definition->execFunc = getExecFunc<RegexpReplaceStaticPattern>(input.arguments);
+        auto value = evaluator::ExpressionEvaluatorUtils::evaluateConstantExpression(
+            input.arguments[1], input.context);
+        return std::make_unique<RegexReplaceBindDataStaticPattern>(
+            binder::ExpressionUtil::getDataTypes(input.arguments), std::move(replaceFunc),
+            BaseRegexpOperation::parseCypherPattern(value.getValue<std::string>()));
+    } else {
+        definition->execFunc = getExecFunc<RegexpReplace>(input.arguments);
+        return std::make_unique<RegexReplaceBindData>(
+            binder::ExpressionUtil::getDataTypes(input.arguments), std::move(replaceFunc));
+    }
+}
+
+function_set RegexpReplaceFunction::getFunctionSet() {
+    function_set functionSet;
+    std::unique_ptr<ScalarFunction> func;
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING,
+            LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::STRING);
+    func->bindFunc = bindFunc;
+    functionSet.emplace_back(std::move(func));
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING,
+            LogicalTypeID::STRING},
+        LogicalTypeID::STRING);
+    func->bindFunc = bindFunc;
+    functionSet.emplace_back(std::move(func));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/split_part.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/split_part.cpp
new file mode 100644
index 0000000000..1ce825a682
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/split_part.cpp
@@ -0,0 +1,37 @@
+#include "common/string_utils.h"
+#include "function/string/vector_string_functions.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+struct SplitPart {
+    static void operation(ku_string_t& strToSplit, ku_string_t& separator, int64_t idx,
+        ku_string_t& result, ValueVector& resultVector) {
+        auto splitStrVec = StringUtils::split(strToSplit.getAsString(), separator.getAsString());
+        bool idxOutOfRange = idx <= 0 || (uint64_t)idx > splitStrVec.size();
+        std::string resultStr = idxOutOfRange ? "" : splitStrVec[idx - 1];
+        StringVector::addString(&resultVector, result, resultStr);
+    }
+};
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    return FunctionBindData::getSimpleBindData(input.arguments, LogicalType::STRING());
+}
+
+function_set SplitPartFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING,
+            LogicalTypeID::INT64},
+        LogicalTypeID::STRING,
+        ScalarFunction::TernaryStringExecFunction<ku_string_t, ku_string_t, int64_t, ku_string_t,
+            SplitPart>);
+    function->bindFunc = bindFunc;
+    functionSet.emplace_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/string_split_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/string_split_function.cpp
new file mode 100644
index 0000000000..0015e28385
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/string/string_split_function.cpp
@@ -0,0 +1,38 @@
+#include "common/string_utils.h"
+#include "function/string/vector_string_functions.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+struct StringSplit {
+    static void operation(ku_string_t& strToSplit, ku_string_t& separator, list_entry_t& result,
+        ValueVector& resultVector) {
+        auto splitStrVec = StringUtils::split(strToSplit.getAsString(), separator.getAsString());
+        result = ListVector::addList(&resultVector, splitStrVec.size());
+        for (auto i = 0u; i < result.size; i++) {
+            ListVector::getDataVector(&resultVector)->setValue(result.offset + i, splitStrVec[i]);
+        }
+    }
+};
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    return FunctionBindData::getSimpleBindData(input.arguments,
+        LogicalType::LIST(LogicalType::STRING()));
+}
+
+function_set StringSplitFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::LIST,
+        ScalarFunction::BinaryStringExecFunction<ku_string_t, ku_string_t, list_entry_t,
+            StringSplit>);
+    function->bindFunc = bindFunc;
+    functionSet.emplace_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/CMakeLists.txt
new file mode 100644
index 0000000000..9d7fc3fc54
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_function_struct
+        OBJECT
+        struct_extract_function.cpp
+        struct_pack_function.cpp
+        keys_function.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_struct>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/keys_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/keys_function.cpp
new file mode 100644
index 0000000000..8a10992012
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/keys_function.cpp
@@ -0,0 +1,53 @@
+#include "binder/expression/expression_util.h"
+#include "binder/expression/literal_expression.h"
+#include "binder/expression/scalar_function_expression.h"
+#include "binder/expression_binder.h"
+#include "function/rewrite_function.h"
+#include "function/struct/vector_struct_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+static std::shared_ptr<Expression> rewriteFunc(const RewriteFunctionBindInput& input) {
+    KU_ASSERT(input.arguments.size() == 1);
+    auto argument = input.arguments[0].get();
+    auto expressionBinder = input.expressionBinder;
+    if (ExpressionUtil::isNullLiteral(*argument)) {
+        return expressionBinder->createNullLiteralExpression();
+    }
+    auto uniqueExpressionName =
+        ScalarFunctionExpression::getUniqueName(KeysFunctions::name, input.arguments);
+    const auto& resultType = LogicalType::LIST(LogicalType::STRING());
+    auto fields = common::StructType::getFieldNames(input.arguments[0]->dataType);
+    std::vector<std::unique_ptr<Value>> children;
+    for (auto field : fields) {
+        if (field == InternalKeyword::ID || field == InternalKeyword::LABEL ||
+            field == InternalKeyword::SRC || field == InternalKeyword::DST) {
+            continue;
+        }
+        children.push_back(std::make_unique<Value>(field));
+    }
+    auto resultExpr = std::make_shared<binder::LiteralExpression>(
+        Value{resultType.copy(), std::move(children)}, std::move(uniqueExpressionName));
+    return resultExpr;
+}
+
+static std::unique_ptr<Function> getKeysFunction(LogicalTypeID logicalTypeID) {
+    return std::make_unique<function::RewriteFunction>(KeysFunctions::name,
+        std::vector<LogicalTypeID>{logicalTypeID}, rewriteFunc);
+}
+
+function_set KeysFunctions::getFunctionSet() {
+    function_set functions;
+    auto inputTypeIDs = std::vector<LogicalTypeID>{LogicalTypeID::NODE, LogicalTypeID::REL};
+    for (auto inputTypeID : inputTypeIDs) {
+        functions.push_back(getKeysFunction(inputTypeID));
+    }
+    return functions;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/struct_extract_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/struct_extract_function.cpp
new file mode 100644
index 0000000000..d834f67765
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/struct_extract_function.cpp
@@ -0,0 +1,61 @@
+#include "binder/expression/expression_util.h"
+#include "binder/expression/literal_expression.h"
+#include "common/exception/binder.h"
+#include "function/scalar_function.h"
+#include "function/struct/vector_struct_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+std::unique_ptr<FunctionBindData> StructExtractFunctions::bindFunc(
+    const ScalarBindFuncInput& input) {
+    const auto& structType = input.arguments[0]->getDataType();
+    if (input.arguments[1]->expressionType != ExpressionType::LITERAL) {
+        throw BinderException("Key name for struct/union extract must be STRING literal.");
+    }
+    auto key =
+        input.arguments[1]->constPtrCast<LiteralExpression>()->getValue().getValue<std::string>();
+    auto fieldIdx = StructType::getFieldIdx(structType, key);
+    if (fieldIdx == INVALID_STRUCT_FIELD_IDX) {
+        throw BinderException(stringFormat("Invalid struct field name: {}.", key));
+    }
+    auto paramTypes = ExpressionUtil::getDataTypes(input.arguments);
+    auto resultType = StructType::getField(structType, fieldIdx).getType().copy();
+    auto bindData = std::make_unique<StructExtractBindData>(std::move(resultType), fieldIdx);
+    bindData->paramTypes.push_back(input.arguments[0]->getDataType().copy());
+    bindData->paramTypes.push_back(LogicalType(input.definition->parameterTypeIDs[1]));
+    return bindData;
+}
+
+void StructExtractFunctions::compileFunc(FunctionBindData* bindData,
+    const std::vector<std::shared_ptr<ValueVector>>& parameters,
+    std::shared_ptr<ValueVector>& result) {
+    KU_ASSERT(parameters[0]->dataType.getPhysicalType() == PhysicalTypeID::STRUCT);
+    auto& structBindData = bindData->cast<StructExtractBindData>();
+    result = StructVector::getFieldVector(parameters[0].get(), structBindData.childIdx);
+    result->state = parameters[0]->state;
+}
+
+static std::unique_ptr<ScalarFunction> getStructExtractFunction(LogicalTypeID logicalTypeID) {
+    auto function = std::make_unique<ScalarFunction>(StructExtractFunctions::name,
+        std::vector<LogicalTypeID>{logicalTypeID, LogicalTypeID::STRING}, LogicalTypeID::ANY);
+    function->bindFunc = StructExtractFunctions::bindFunc;
+    function->compileFunc = StructExtractFunctions::compileFunc;
+    return function;
+}
+
+function_set StructExtractFunctions::getFunctionSet() {
+    function_set functions;
+    auto inputTypeIDs =
+        std::vector<LogicalTypeID>{LogicalTypeID::STRUCT, LogicalTypeID::NODE, LogicalTypeID::REL};
+    for (auto inputTypeID : inputTypeIDs) {
+        functions.push_back(getStructExtractFunction(inputTypeID));
+    }
+    return functions;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/struct_pack_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/struct_pack_function.cpp
new file mode 100644
index 0000000000..bea2928ab1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/struct/struct_pack_function.cpp
@@ -0,0 +1,140 @@
+#include "common/exception/binder.h"
+#include "function/scalar_function.h"
+#include "function/struct/vector_struct_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    std::vector<StructField> fields;
+    if (input.arguments.size() > INVALID_STRUCT_FIELD_IDX - 1) {
+        throw BinderException(stringFormat("Too many fields in STRUCT literal (max {}, got {})",
+            INVALID_STRUCT_FIELD_IDX - 1, input.arguments.size()));
+    }
+    std::unordered_set<std::string> fieldNameSet;
+    for (auto i = 0u; i < input.arguments.size(); i++) {
+        auto& argument = input.arguments[i];
+        if (argument->getDataType().getLogicalTypeID() == LogicalTypeID::ANY) {
+            argument->cast(LogicalType::STRING());
+        }
+        if (i >= input.optionalArguments.size()) {
+            throw BinderException(
+                stringFormat("Cannot infer field name for {}.", argument->toString()));
+        }
+        auto fieldName = input.optionalArguments[i];
+        if (fieldNameSet.contains(fieldName)) {
+            throw BinderException(stringFormat("Found duplicate field {} in STRUCT.", fieldName));
+        } else {
+            fieldNameSet.insert(fieldName);
+        }
+        fields.emplace_back(fieldName, argument->getDataType().copy());
+    }
+    const auto resultType = LogicalType::STRUCT(std::move(fields));
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+}
+
+void StructPackFunctions::compileFunc(FunctionBindData* /*bindData*/,
+    const std::vector<std::shared_ptr<ValueVector>>& parameters,
+    std::shared_ptr<ValueVector>& result) {
+    // Our goal is to make the state of the resultVector consistent with its children vectors.
+    // If the resultVector and inputVector are in different dataChunks, we should create a new
+    // child valueVector, which shares the state with the resultVector, instead of reusing the
+    // inputVector.
+    for (auto i = 0u; i < parameters.size(); i++) {
+        if (parameters[i]->state == result->state) {
+            StructVector::referenceVector(result.get(), i, parameters[i]);
+        }
+    }
+}
+
+void StructPackFunctions::undirectedRelCompileFunc(FunctionBindData*,
+    const std::vector<std::shared_ptr<ValueVector>>& parameters,
+    std::shared_ptr<ValueVector>& result) {
+    // Skip src and dst reference because we may change their state
+    for (auto i = 2u; i < parameters.size(); i++) {
+        if (parameters[i]->state == result->state) {
+            StructVector::referenceVector(result.get(), i, parameters[i]);
+        }
+    }
+}
+
+static void copyParameterValueToStructFieldVector(const ValueVector* parameter,
+    ValueVector* structField, DataChunkState* structVectorState) {
+    // If the parameter is unFlat, then its state must be consistent with the result's state.
+    // Thus, we don't need to copy values to structFieldVector.
+    KU_ASSERT(parameter->state->isFlat());
+    auto paramPos = parameter->state->getSelVector()[0];
+    if (structVectorState->isFlat()) {
+        auto pos = structVectorState->getSelVector()[0];
+        structField->copyFromVectorData(pos, parameter, paramPos);
+    } else {
+        for (auto i = 0u; i < structVectorState->getSelVector().getSelSize(); i++) {
+            auto pos = structVectorState->getSelVector()[i];
+            structField->copyFromVectorData(pos, parameter, paramPos);
+        }
+    }
+}
+
+void StructPackFunctions::execFunc(
+    const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+    const std::vector<common::SelectionVector*>& parameterSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* /*dataPtr*/) {
+    for (auto i = 0u; i < parameters.size(); i++) {
+        auto* parameter = parameters[i].get();
+        auto* parameterSelVector = parameterSelVectors[i];
+        if (parameterSelVector == resultSelVector) {
+            continue;
+        }
+        // If the parameter's state is inconsistent with the result's state, we need to copy the
+        // parameter's value to the corresponding child vector.
+        StructVector::getFieldVector(&result, i)->resetAuxiliaryBuffer();
+        copyParameterValueToStructFieldVector(parameter,
+            StructVector::getFieldVector(&result, i).get(), result.state.get());
+    }
+}
+
+void StructPackFunctions::undirectedRelPackExecFunc(
+    const std::vector<std::shared_ptr<ValueVector>>& parameters, ValueVector& result, void*) {
+    KU_ASSERT(parameters.size() > 1);
+    // Force copy of the src and internal id child vectors because we might modify them later.
+    for (auto i = 0u; i < 2; i++) {
+        auto& parameter = parameters[i];
+        auto fieldVector = StructVector::getFieldVector(&result, i).get();
+        fieldVector->resetAuxiliaryBuffer();
+        if (parameter->state->isFlat()) {
+            copyParameterValueToStructFieldVector(parameter.get(), fieldVector, result.state.get());
+        } else {
+            for (auto j = 0u; j < result.state->getSelVector().getSelSize(); j++) {
+                auto pos = result.state->getSelVector()[j];
+                fieldVector->copyFromVectorData(pos, parameter.get(), pos);
+            }
+        }
+    }
+    for (auto i = 2u; i < parameters.size(); i++) {
+        auto& parameter = parameters[i];
+        if (parameter->state == result.state) {
+            continue;
+        }
+        // If the parameter's state is inconsistent with the result's state, we need to copy the
+        // parameter's value to the corresponding child vector.
+        StructVector::getFieldVector(&result, i)->resetAuxiliaryBuffer();
+        copyParameterValueToStructFieldVector(parameter.get(),
+            StructVector::getFieldVector(&result, i).get(), result.state.get());
+    }
+}
+
+function_set StructPackFunctions::getFunctionSet() {
+    function_set functions;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ANY}, LogicalTypeID::STRUCT, execFunc);
+    function->bindFunc = bindFunc;
+    function->compileFunc = compileFunc;
+    function->isVarLength = true;
+    functions.push_back(std::move(function));
+    return functions;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/CMakeLists.txt
new file mode 100644
index 0000000000..33eb35c4f3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/CMakeLists.txt
@@ -0,0 +1,37 @@
+add_library(lbug_table_function
+        OBJECT
+        bind_data.cpp
+        bind_input.cpp
+        bm_info.cpp
+        cache_column.cpp
+        catalog_version.cpp
+        clear_warnings.cpp
+        current_setting.cpp
+        db_version.cpp
+        drop_project_graph.cpp
+        file_info.cpp
+        free_space_info.cpp
+        project_cypher_graph.cpp
+        project_native_graph.cpp
+        show_attached_databases.cpp
+        show_connection.cpp
+        show_functions.cpp
+        show_indexes.cpp
+        show_loaded_extensions.cpp
+        show_macros.cpp
+        show_official_extensions.cpp
+        show_projected_graphs.cpp
+        show_sequences.cpp
+        show_tables.cpp
+        show_warnings.cpp
+        stats_info.cpp
+        storage_info.cpp
+        simple_table_function.cpp
+        table_function.cpp
+        table_info.cpp
+        projected_graph_info.cpp
+        )
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_table_function>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/bind_data.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/bind_data.cpp
new file mode 100644
index 0000000000..7db0a328bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/bind_data.cpp
@@ -0,0 +1,28 @@
+#include "function/table/bind_data.h"
+
+#include "common/constants.h"
+
+namespace lbug {
+namespace function {
+
+std::vector<bool> TableFuncBindData::getColumnSkips() const {
+    if (columnSkips.empty()) { // If not specified, all columns should be scanned.
+        std::vector<bool> skips;
+        for (auto i = 0u; i < getNumColumns(); ++i) {
+            skips.push_back(false);
+        }
+        return skips;
+    }
+    return columnSkips;
+}
+
+bool TableFuncBindData::getIgnoreErrorsOption() const {
+    return common::CopyConstants::DEFAULT_IGNORE_ERRORS;
+}
+
+std::unique_ptr<TableFuncBindData> TableFuncBindData::copy() const {
+    return std::make_unique<TableFuncBindData>(*this);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/bind_input.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/bind_input.cpp
new file mode 100644
index 0000000000..8e9df821f5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/bind_input.cpp
@@ -0,0 +1,31 @@
+#include "function/table/bind_input.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/expression/literal_expression.h"
+
+namespace lbug {
+namespace function {
+
+void TableFuncBindInput::addLiteralParam(common::Value value) {
+    params.push_back(std::make_shared<binder::LiteralExpression>(std::move(value), ""));
+}
+
+common::Value TableFuncBindInput::getValue(common::idx_t idx) const {
+    binder::ExpressionUtil::validateExpressionType(*params[idx], common::ExpressionType::LITERAL);
+    return params[idx]->constCast<binder::LiteralExpression>().getValue();
+}
+
+template<typename T>
+T TableFuncBindInput::getLiteralVal(common::idx_t idx) const {
+    return getValue(idx).getValue<T>();
+}
+
+template LBUG_API std::string TableFuncBindInput::getLiteralVal<std::string>(
+    common::idx_t idx) const;
+template LBUG_API int64_t TableFuncBindInput::getLiteralVal<int64_t>(common::idx_t idx) const;
+template LBUG_API uint64_t TableFuncBindInput::getLiteralVal<uint64_t>(common::idx_t idx) const;
+template LBUG_API uint32_t TableFuncBindInput::getLiteralVal<uint32_t>(common::idx_t idx) const;
+template LBUG_API uint8_t* TableFuncBindInput::getLiteralVal<uint8_t*>(common::idx_t idx) const;
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/bm_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/bm_info.cpp
new file mode 100644
index 0000000000..262d6a038b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/bm_info.cpp
@@ -0,0 +1,58 @@
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace function {
+
+struct BMInfoBindData final : TableFuncBindData {
+    uint64_t memLimit;
+    uint64_t memUsage;
+
+    BMInfoBindData(uint64_t memLimit, uint64_t memUsage, binder::expression_vector columns)
+        : TableFuncBindData{std::move(columns), 1}, memLimit{memLimit}, memUsage{memUsage} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<BMInfoBindData>(memLimit, memUsage, columns);
+    }
+};
+
+static common::offset_t internalTableFunc(const TableFuncMorsel& /*morsel*/,
+    const TableFuncInput& input, common::DataChunk& output) {
+    KU_ASSERT(output.getNumValueVectors() == 2);
+    auto bmInfoBindData = input.bindData->constPtrCast<BMInfoBindData>();
+    output.getValueVectorMutable(0).setValue<uint64_t>(0, bmInfoBindData->memLimit);
+    output.getValueVectorMutable(1).setValue<uint64_t>(0, bmInfoBindData->memUsage);
+    return 1;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    auto memLimit = storage::MemoryManager::Get(*context)->getBufferManager()->getMemoryLimit();
+    auto memUsage = storage::MemoryManager::Get(*context)->getBufferManager()->getUsedMemory();
+    std::vector<common::LogicalType> returnTypes;
+    returnTypes.emplace_back(common::LogicalType::UINT64());
+    returnTypes.emplace_back(common::LogicalType::UINT64());
+    auto returnColumnNames = std::vector<std::string>{"mem_limit", "mem_usage"};
+    returnColumnNames =
+        TableFunction::extractYieldVariables(returnColumnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(returnColumnNames, returnTypes);
+    return std::make_unique<BMInfoBindData>(memLimit, memUsage, columns);
+}
+
+function_set BMInfoFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<common::LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/cache_column.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/cache_column.cpp
new file mode 100644
index 0000000000..1eb886968f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/cache_column.cpp
@@ -0,0 +1,209 @@
+#include "binder/binder.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "processor/execution_context.h"
+#include "storage/local_cached_column.h"
+#include "storage/storage_manager.h"
+#include "storage/table/list_chunk_data.h"
+#include "storage/table/node_table.h"
+#include "storage/table/table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct CacheArrayColumnBindData final : TableFuncBindData {
+    catalog::TableCatalogEntry* tableEntry;
+    property_id_t propertyID;
+
+    CacheArrayColumnBindData(catalog::TableCatalogEntry* tableEntry, property_id_t propertyID)
+        : tableEntry{tableEntry}, propertyID{propertyID} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<CacheArrayColumnBindData>(tableEntry, propertyID);
+    }
+};
+
+static void validateArrayColumnType(const catalog::TableCatalogEntry* entry,
+    property_id_t propertyID) {
+    auto& type = entry->getProperty(propertyID).getType();
+    if (type.getLogicalTypeID() != LogicalTypeID::ARRAY) {
+        throw BinderException{stringFormat("Column {} is not of the expected type {}.",
+            entry->getProperty(propertyID).getName(),
+            LogicalTypeUtils::toString(LogicalTypeID::ARRAY))};
+    }
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    const auto tableName = input->getLiteralVal<std::string>(0);
+    const auto columnName = input->getLiteralVal<std::string>(1);
+    binder::Binder::validateTableExistence(*context, tableName);
+    const auto tableEntry = catalog::Catalog::Get(*context)->getTableCatalogEntry(
+        transaction::Transaction::Get(*context), tableName);
+    binder::Binder::validateNodeTableType(tableEntry);
+    binder::Binder::validateColumnExistence(tableEntry, columnName);
+    auto propertyID = tableEntry->getPropertyID(columnName);
+    validateArrayColumnType(tableEntry, propertyID);
+    return std::make_unique<CacheArrayColumnBindData>(tableEntry, propertyID);
+}
+
+struct CacheArrayColumnSharedState final : public SimpleTableFuncSharedState {
+    explicit CacheArrayColumnSharedState(storage::NodeTable& table,
+        node_group_idx_t maxNodeGroupIdx, const CacheArrayColumnBindData& bindData)
+        : SimpleTableFuncSharedState{maxNodeGroupIdx, 1 /*maxMorselSize*/}, table{table} {
+        cachedColumn = std::make_unique<storage::CachedColumn>(bindData.tableEntry->getTableID(),
+            bindData.propertyID);
+        cachedColumn->columnChunks.resize(maxNodeGroupIdx + 1);
+    }
+
+    void merge(node_group_idx_t nodeGroupIdx,
+        std::unique_ptr<storage::ColumnChunkData> columnChunkData) {
+        std::unique_lock lck{mtx};
+        KU_ASSERT(cachedColumn->columnChunks.size() > nodeGroupIdx);
+        cachedColumn->columnChunks[nodeGroupIdx] = std::move(columnChunkData);
+        ++numNodeGroupsCached;
+    }
+
+    std::mutex mtx;
+    storage::NodeTable& table;
+    std::unique_ptr<storage::CachedColumn> cachedColumn;
+    std::atomic<node_group_idx_t> numNodeGroupsCached;
+};
+
+static std::unique_ptr<TableFuncSharedState> initSharedState(
+    const TableFuncInitSharedStateInput& input) {
+    const auto bindData = input.bindData->constPtrCast<CacheArrayColumnBindData>();
+    auto& table = storage::StorageManager::Get(*input.context->clientContext)
+                      ->getTable(bindData->tableEntry->getTableID())
+                      ->cast<storage::NodeTable>();
+    return std::make_unique<CacheArrayColumnSharedState>(table, table.getNumCommittedNodeGroups(),
+        *bindData);
+}
+
+struct CacheArrayColumnLocalState final : TableFuncLocalState {
+    CacheArrayColumnLocalState(const main::ClientContext& context, table_id_t tableID,
+        column_id_t columnID)
+        : dataChunk{2, std::make_shared<DataChunkState>()} {
+        auto& table =
+            storage::StorageManager::Get(context)->getTable(tableID)->cast<storage::NodeTable>();
+        dataChunk.insert(0, std::make_shared<ValueVector>(LogicalType::INTERNAL_ID()));
+        dataChunk.insert(1,
+            std::make_shared<ValueVector>(table.getColumn(columnID).getDataType().copy()));
+        std::vector<column_id_t> columnIDs;
+        columnIDs.push_back(columnID);
+        scanState =
+            std::make_unique<storage::NodeTableScanState>(&dataChunk.getValueVectorMutable(0),
+                std::vector{&dataChunk.getValueVectorMutable(1)}, dataChunk.state);
+        scanState->source = storage::TableScanSource::COMMITTED;
+        scanState->setToTable(transaction::Transaction::Get(context), &table, columnIDs, {});
+    }
+
+    DataChunk dataChunk;
+    std::unique_ptr<storage::NodeTableScanState> scanState;
+};
+
+static std::unique_ptr<TableFuncLocalState> initLocalState(
+    const TableFuncInitLocalStateInput& input) {
+    const auto bindData = input.bindData.constPtrCast<CacheArrayColumnBindData>();
+    auto tableID = bindData->tableEntry->getTableID();
+    auto columnID = bindData->tableEntry->getColumnID(bindData->propertyID);
+    return std::make_unique<CacheArrayColumnLocalState>(*input.clientContext, tableID, columnID);
+}
+
+static void scanTableDataToChunk(const node_group_idx_t nodeGroupIdx,
+    storage::NodeTableScanState& scanState, storage::ColumnChunkData* data,
+    transaction::Transaction* transaction, storage::NodeTable& table) {
+    scanState.nodeGroupIdx = nodeGroupIdx;
+    table.initScanState(transaction, scanState);
+
+    // We want to ensure that the offsets in the cached column match the offsets in the
+    // table
+    // To do this we write to the same offsets and set any non-selected (e.g. deleted)
+    // rows to null
+    data->getNullData()->resetToAllNull();
+    while (table.scan(transaction, scanState)) {
+        const auto& selVector = scanState.outState->getSelVector();
+        selVector.forEach([&](auto vectorIdx) {
+            const auto dataOffsetInGroup =
+                scanState.nodeIDVector->getValue<nodeID_t>(vectorIdx).offset -
+                storage::StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx);
+            data->write(scanState.outputVectors[0], vectorIdx, dataOffsetInGroup);
+        });
+    }
+}
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput&) {
+    auto& bindData = input.bindData->cast<CacheArrayColumnBindData>();
+    const auto sharedState = input.sharedState->ptrCast<CacheArrayColumnSharedState>();
+    auto localState = input.localState->ptrCast<CacheArrayColumnLocalState>();
+    const auto morsel = sharedState->getMorsel();
+    if (morsel.isInvalid()) {
+        return 0;
+    }
+    auto context = input.context->clientContext;
+    auto columnType = bindData.tableEntry->getProperty(bindData.propertyID).getType().copy();
+    auto& table = sharedState->table;
+    auto& scanState = *localState->scanState;
+    for (auto i = morsel.startOffset; i < morsel.endOffset; i++) {
+        auto numRows = table.getNumTuplesInNodeGroup(i);
+        auto data = storage::ColumnChunkFactory::createColumnChunkData(
+            *storage::MemoryManager::Get(*context), columnType.copy(), false /*enableCompression*/,
+            numRows, storage::ResidencyState::IN_MEMORY, true /*hasNullData*/,
+            false /*initializeToZero*/);
+        if (columnType.getLogicalTypeID() == LogicalTypeID::ARRAY) {
+            auto arrayTypeInfo = columnType.getExtraTypeInfo()->constPtrCast<ArrayTypeInfo>();
+            data->cast<storage::ListChunkData>().getDataColumnChunk()->resize(
+                numRows * arrayTypeInfo->getNumElements());
+        }
+        scanTableDataToChunk(i, scanState, data.get(), transaction::Transaction::Get(*context),
+            table);
+        sharedState->merge(i, std::move(data));
+    }
+    return morsel.endOffset - morsel.startOffset;
+}
+
+static double progressFunc(TableFuncSharedState* sharedState) {
+    const auto cacheColumnSharedState = sharedState->ptrCast<CacheArrayColumnSharedState>();
+    const auto numNodeGroupsCached = cacheColumnSharedState->numNodeGroupsCached.load();
+    if (cacheColumnSharedState->numRows == 0) {
+        return 1.0;
+    }
+    if (numNodeGroupsCached == 0) {
+        return 0.0;
+    }
+    return static_cast<double>(numNodeGroupsCached) / cacheColumnSharedState->numRows;
+}
+
+static void finalizeFunc(const processor::ExecutionContext* context,
+    TableFuncSharedState* sharedState) {
+    auto transaction = transaction::Transaction::Get(*context->clientContext);
+    auto cacheColumnSharedState = sharedState->ptrCast<CacheArrayColumnSharedState>();
+    auto& localCacheManager = transaction->getLocalCacheManager();
+    localCacheManager.put(std::move(cacheColumnSharedState->cachedColumn));
+}
+
+function_set LocalCacheArrayColumnFunction::getFunctionSet() {
+    function_set functionSet;
+    std::vector inputTypes = {LogicalTypeID::STRING, LogicalTypeID::STRING};
+    auto func = std::make_unique<TableFunction>(name, inputTypes);
+    func->bindFunc = bindFunc;
+    func->initSharedStateFunc = initSharedState;
+    func->initLocalStateFunc = initLocalState;
+    func->tableFunc = tableFunc;
+    func->finalizeFunc = finalizeFunc;
+    func->canParallelFunc = [] { return true; };
+    func->progressFunc = progressFunc;
+    func->isReadOnly = false;
+    functionSet.push_back(std::move(func));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/catalog_version.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/catalog_version.cpp
new file mode 100644
index 0000000000..60fa477a80
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/catalog_version.cpp
@@ -0,0 +1,43 @@
+#include "binder/binder.h"
+#include "catalog/catalog.h"
+#include "function/table/bind_data.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+
+namespace lbug {
+namespace function {
+
+static common::offset_t internalTableFunc(const TableFuncMorsel& /*morsel*/,
+    const TableFuncInput& input, common::DataChunk& output) {
+    auto& outputVector = output.getValueVectorMutable(0);
+    auto pos = outputVector.state->getSelVector()[0];
+    outputVector.setValue(pos, catalog::Catalog::Get(*input.context->clientContext)->getVersion());
+    return 1;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext*,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> returnColumnNames;
+    std::vector<common::LogicalType> returnTypes;
+    returnColumnNames.emplace_back("version");
+    returnTypes.emplace_back(common::LogicalType::INT64());
+    returnColumnNames =
+        TableFunction::extractYieldVariables(returnColumnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(returnColumnNames, returnTypes);
+    return std::make_unique<TableFuncBindData>(std::move(columns), 1 /* one row result */);
+}
+
+function_set CatalogVersionFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<common::LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/clear_warnings.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/clear_warnings.cpp
new file mode 100644
index 0000000000..7615e0126f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/clear_warnings.cpp
@@ -0,0 +1,37 @@
+#include "function/table/bind_data.h"
+#include "function/table/standalone_call_function.h"
+#include "function/table/table_function.h"
+#include "processor/execution_context.h"
+#include "processor/warning_context.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput&) {
+    auto warningContext = processor::WarningContext::Get(*input.context->clientContext);
+    warningContext->clearPopulatedWarnings();
+    return 0;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext*,
+    const TableFuncBindInput*) {
+    return std::make_unique<TableFuncBindData>(0);
+}
+
+function_set ClearWarningsFunction::getFunctionSet() {
+    function_set functionSet;
+    auto func = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    func->tableFunc = tableFunc;
+    func->bindFunc = bindFunc;
+    func->initSharedStateFunc = TableFunction::initEmptySharedState;
+    func->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    func->canParallelFunc = []() { return false; };
+    func->isReadOnly = false;
+    functionSet.push_back(std::move(func));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/current_setting.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/current_setting.cpp
new file mode 100644
index 0000000000..50a137fd6e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/current_setting.cpp
@@ -0,0 +1,58 @@
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+struct CurrentSettingBindData final : TableFuncBindData {
+    std::string result;
+
+    CurrentSettingBindData(std::string result, binder::expression_vector columns,
+        offset_t maxOffset)
+        : TableFuncBindData{std::move(columns), maxOffset}, result{std::move(result)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<CurrentSettingBindData>(result, columns, numRows);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& /*morsel*/, const TableFuncInput& input,
+    common::DataChunk& output) {
+    auto currentSettingBindData = input.bindData->constPtrCast<CurrentSettingBindData>();
+    const auto pos = output.state->getSelVector()[0];
+    output.getValueVectorMutable(0).setValue(pos, currentSettingBindData->result);
+    return 1;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const ClientContext* context,
+    const TableFuncBindInput* input) {
+    auto optionName = input->getLiteralVal<std::string>(0);
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back(optionName);
+    columnTypes.push_back(LogicalType::STRING());
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<CurrentSettingBindData>(
+        context->getCurrentSetting(optionName).toString(), columns, 1 /* one row result */);
+}
+
+function_set CurrentSettingFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/db_version.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/db_version.cpp
new file mode 100644
index 0000000000..1b29c786e3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/db_version.cpp
@@ -0,0 +1,44 @@
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+static offset_t internalTableFunc(const TableFuncMorsel& /*morsel*/,
+    const TableFuncInput& /*input*/, DataChunk& output) {
+    auto& outputVector = output.getValueVectorMutable(0);
+    auto pos = output.state->getSelVector()[0];
+    outputVector.setValue(pos, std::string(LBUG_VERSION));
+    return 1;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const ClientContext*,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> returnColumnNames;
+    std::vector<LogicalType> returnTypes;
+    returnColumnNames.emplace_back("version");
+    returnTypes.emplace_back(LogicalType::STRING());
+    returnColumnNames =
+        TableFunction::extractYieldVariables(returnColumnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(returnColumnNames, returnTypes);
+    return std::make_unique<TableFuncBindData>(std::move(columns), 1 /* one row result */);
+}
+
+function_set DBVersionFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/drop_project_graph.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/drop_project_graph.cpp
new file mode 100644
index 0000000000..f2305afa34
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/drop_project_graph.cpp
@@ -0,0 +1,51 @@
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/standalone_call_function.h"
+#include "function/table/table_function.h"
+#include "graph/graph_entry_set.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct DropProjectedGraphBindData final : TableFuncBindData {
+    std::string graphName;
+
+    explicit DropProjectedGraphBindData(std::string graphName)
+        : TableFuncBindData{0}, graphName{std::move(graphName)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<DropProjectedGraphBindData>(graphName);
+    }
+};
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput&) {
+    const auto bindData = ku_dynamic_cast<DropProjectedGraphBindData*>(input.bindData);
+    auto graphEntrySet = graph::GraphEntrySet::Get(*input.context->clientContext);
+    graphEntrySet->validateGraphExist(bindData->graphName);
+    graphEntrySet->dropGraph(bindData->graphName);
+    return 0;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext*,
+    const TableFuncBindInput* input) {
+    auto graphName = input->getLiteralVal<std::string>(0 /* maxOffset */);
+    return std::make_unique<DropProjectedGraphBindData>(graphName);
+}
+
+function_set DropProjectedGraphFunction::getFunctionSet() {
+    function_set functionSet;
+    auto func = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    func->bindFunc = bindFunc;
+    func->tableFunc = tableFunc;
+    func->initSharedStateFunc = TableFunction::initEmptySharedState;
+    func->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    func->canParallelFunc = []() { return false; };
+    functionSet.push_back(std::move(func));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/file_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/file_info.cpp
new file mode 100644
index 0000000000..13af0d0012
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/file_info.cpp
@@ -0,0 +1,53 @@
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+#include "storage/storage_manager.h"
+
+namespace lbug {
+namespace function {
+
+struct FileInfoBindData final : TableFuncBindData {
+    uint64_t numPages;
+
+    FileInfoBindData(uint64_t numPages, binder::expression_vector columns)
+        : TableFuncBindData{std::move(columns), 1}, numPages(numPages) {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<FileInfoBindData>(numPages, columns);
+    }
+};
+
+static common::offset_t internalTableFunc(const TableFuncMorsel& /*morsel*/,
+    const TableFuncInput& input, common::DataChunk& output) {
+    KU_ASSERT(output.getNumValueVectors() == 1);
+    auto fileInfoBindData = input.bindData->constPtrCast<FileInfoBindData>();
+    output.getValueVectorMutable(0).setValue<uint64_t>(0, fileInfoBindData->numPages);
+    return 1;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    auto numPages = storage::StorageManager::Get(*context)->getDataFH()->getNumPages();
+    std::vector<common::LogicalType> returnTypes;
+    returnTypes.emplace_back(common::LogicalType::UINT64());
+    auto returnColumnNames = std::vector<std::string>{"num_pages"};
+    returnColumnNames =
+        TableFunction::extractYieldVariables(returnColumnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(returnColumnNames, returnTypes);
+    return std::make_unique<FileInfoBindData>(numPages, columns);
+}
+
+function_set FileInfoFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<common::LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/free_space_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/free_space_info.cpp
new file mode 100644
index 0000000000..6c29595594
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/free_space_info.cpp
@@ -0,0 +1,57 @@
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+#include "storage/page_manager.h"
+
+namespace lbug {
+namespace function {
+
+struct FreeSpaceInfoBindData final : TableFuncBindData {
+    const main::ClientContext* ctx;
+    FreeSpaceInfoBindData(binder::expression_vector columns, common::row_idx_t numRows,
+        const main::ClientContext* ctx)
+        : TableFuncBindData{std::move(columns), numRows}, ctx{ctx} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<FreeSpaceInfoBindData>(columns, numRows, ctx);
+    }
+};
+
+static common::offset_t internalTableFunc(const TableFuncMorsel& morsel,
+    const TableFuncInput& input, common::DataChunk& output) {
+    const auto bindData = input.bindData->constPtrCast<FreeSpaceInfoBindData>();
+    const auto entries = storage::PageManager::Get(*bindData->ctx)
+                             ->getFreeEntries(morsel.startOffset, morsel.endOffset);
+    for (common::row_idx_t i = 0; i < entries.size(); ++i) {
+        const auto& freeEntry = entries[i];
+        output.getValueVectorMutable(0).setValue<uint64_t>(i, freeEntry.startPageIdx);
+        output.getValueVectorMutable(1).setValue<uint64_t>(i, freeEntry.numPages);
+    }
+    return entries.size();
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames = {"start_page_idx", "num_pages"};
+    std::vector<common::LogicalType> columnTypes;
+    columnTypes.push_back(common::LogicalType::UINT64());
+    columnTypes.push_back(common::LogicalType::UINT64());
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<FreeSpaceInfoBindData>(columns,
+        storage::PageManager::Get(*context)->getNumFreeEntries(), context);
+}
+
+function_set FreeSpaceInfoFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<common::LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/project_cypher_graph.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/project_cypher_graph.cpp
new file mode 100644
index 0000000000..4e134487d2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/project_cypher_graph.cpp
@@ -0,0 +1,63 @@
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/standalone_call_function.h"
+#include "function/table/table_function.h"
+#include "graph/graph_entry_set.h"
+#include "parser/parser.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::common;
+using namespace lbug::graph;
+
+namespace lbug {
+namespace function {
+
+struct ProjectGraphCypherBindData final : TableFuncBindData {
+    std::string graphName;
+    std::string cypherQuery;
+
+    ProjectGraphCypherBindData(std::string graphName, std::string cypherQuery)
+        : graphName{std::move(graphName)}, cypherQuery{std::move(cypherQuery)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ProjectGraphCypherBindData>(graphName, cypherQuery);
+    }
+};
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput&) {
+    const auto bindData = ku_dynamic_cast<ProjectGraphCypherBindData*>(input.bindData);
+    auto graphEntrySet = GraphEntrySet::Get(*input.context->clientContext);
+    graphEntrySet->validateGraphNotExist(bindData->graphName);
+    // bind graph entry to check if input is valid or not. Ignore bind result.
+    auto parsedStatements = parser::Parser::parseQuery(bindData->cypherQuery);
+    KU_ASSERT(parsedStatements.size() == 1);
+    auto binder = binder::Binder(input.context->clientContext);
+    binder.bind(*parsedStatements[0]);
+    auto entry = std::make_unique<ParsedCypherGraphEntry>(bindData->cypherQuery);
+    graphEntrySet->addGraph(bindData->graphName, std::move(entry));
+    return 0;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext*,
+    const TableFuncBindInput* input) {
+    auto graphName = input->getLiteralVal<std::string>(0);
+    auto cypherQuery = input->getLiteralVal<std::string>(1);
+    return std::make_unique<ProjectGraphCypherBindData>(graphName, cypherQuery);
+}
+
+function_set ProjectGraphCypherFunction::getFunctionSet() {
+    function_set functionSet;
+    auto func = std::make_unique<TableFunction>(name,
+        std::vector{LogicalTypeID::STRING, LogicalTypeID::STRING});
+    func->bindFunc = bindFunc;
+    func->tableFunc = tableFunc;
+    func->initSharedStateFunc = TableFunction::initEmptySharedState;
+    func->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    func->canParallelFunc = []() { return false; };
+    functionSet.push_back(std::move(func));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/project_native_graph.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/project_native_graph.cpp
new file mode 100644
index 0000000000..0aa9705df5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/project_native_graph.cpp
@@ -0,0 +1,98 @@
+#include "common/exception/binder.h"
+#include "common/types/value/nested.h"
+#include "function/gds/gds.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/standalone_call_function.h"
+#include "graph/graph_entry_set.h"
+#include "parser/parser.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::graph;
+
+namespace lbug {
+namespace function {
+
+struct ProjectGraphNativeBindData final : TableFuncBindData {
+    std::string graphName;
+    std::vector<ParsedNativeGraphTableInfo> nodeInfos;
+    std::vector<ParsedNativeGraphTableInfo> relInfos;
+
+    ProjectGraphNativeBindData(std::string graphName,
+        std::vector<ParsedNativeGraphTableInfo> nodeInfos,
+        std::vector<ParsedNativeGraphTableInfo> relInfos)
+        : TableFuncBindData{0}, graphName{std::move(graphName)}, nodeInfos{std::move(nodeInfos)},
+          relInfos{std::move(relInfos)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ProjectGraphNativeBindData>(graphName, nodeInfos, relInfos);
+    }
+};
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput&) {
+    const auto bindData = ku_dynamic_cast<ProjectGraphNativeBindData*>(input.bindData);
+    auto graphEntrySet = GraphEntrySet::Get(*input.context->clientContext);
+    graphEntrySet->validateGraphNotExist(bindData->graphName);
+    auto entry = std::make_unique<ParsedNativeGraphEntry>(bindData->nodeInfos, bindData->relInfos);
+    // bind graph entry to check if input is valid or not. Ignore bind result.
+    GDSFunction::bindGraphEntry(*input.context->clientContext, *entry);
+    graphEntrySet->addGraph(bindData->graphName, std::move(entry));
+    return 0;
+}
+
+static std::string getStringVal(const Value& value) {
+    value.validateType(LogicalTypeID::STRING);
+    return value.getValue<std::string>();
+}
+
+static std::vector<ParsedNativeGraphTableInfo> extractGraphEntryTableInfos(const Value& value) {
+    std::vector<ParsedNativeGraphTableInfo> infos;
+    switch (value.getDataType().getLogicalTypeID()) {
+    case LogicalTypeID::LIST: {
+        for (auto i = 0u; i < NestedVal::getChildrenSize(&value); ++i) {
+            auto tableName = getStringVal(*NestedVal::getChildVal(&value, i));
+            infos.emplace_back(tableName, "" /* empty predicate */);
+        }
+    } break;
+    case LogicalTypeID::STRUCT: {
+        for (auto i = 0u; i < StructType::getNumFields(value.getDataType()); ++i) {
+            auto& field = StructType::getField(value.getDataType(), i);
+            auto tableName = field.getName();
+            auto predicate = getStringVal(*NestedVal::getChildVal(&value, i));
+            infos.emplace_back(tableName, predicate);
+        }
+    } break;
+    default:
+        throw BinderException(
+            stringFormat("Argument {} has data type {}. LIST or STRUCT was expected.",
+                value.toString(), value.getDataType().toString()));
+    }
+    return infos;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext*,
+    const TableFuncBindInput* input) {
+    auto graphName = input->getLiteralVal<std::string>(0);
+    auto nodeInfos = extractGraphEntryTableInfos(input->getValue(1));
+    auto relInfos = extractGraphEntryTableInfos(input->getValue(2));
+    return std::make_unique<ProjectGraphNativeBindData>(graphName, nodeInfos, relInfos);
+}
+
+function_set ProjectGraphNativeFunction::getFunctionSet() {
+    function_set functionSet;
+    auto func = std::make_unique<TableFunction>(name,
+        std::vector{LogicalTypeID::STRING, LogicalTypeID::ANY, LogicalTypeID::ANY});
+    func->bindFunc = bindFunc;
+    func->tableFunc = tableFunc;
+    func->initSharedStateFunc = TableFunction::initEmptySharedState;
+    func->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    func->canParallelFunc = []() { return false; };
+    functionSet.push_back(std::move(func));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/projected_graph_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/projected_graph_info.cpp
new file mode 100644
index 0000000000..d6c356c189
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/projected_graph_info.cpp
@@ -0,0 +1,170 @@
+#include "binder/binder.h"
+#include "common/exception/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "graph/graph_entry_set.h"
+
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+struct ProjectedGraphInfo {
+    virtual ~ProjectedGraphInfo() = default;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+    virtual std::unique_ptr<ProjectedGraphInfo> copy() const = 0;
+};
+
+struct ProjectedTableInfo {
+    std::string tableType;
+    std::string tableName;
+    std::string predicate;
+
+    ProjectedTableInfo(std::string tableType, std::string tableName, std::string predicate)
+        : tableType{std::move(tableType)}, tableName{std::move(tableName)},
+          predicate{std::move(predicate)} {}
+};
+
+struct NativeProjectedGraphInfo final : ProjectedGraphInfo {
+    std::vector<ProjectedTableInfo> tableInfo;
+
+    explicit NativeProjectedGraphInfo(std::vector<ProjectedTableInfo> tableInfo)
+        : tableInfo{std::move(tableInfo)} {}
+
+    std::unique_ptr<ProjectedGraphInfo> copy() const override {
+        return std::make_unique<NativeProjectedGraphInfo>(tableInfo);
+    }
+};
+
+struct CypherProjectedGraphInfo final : ProjectedGraphInfo {
+    std::string cypherQuery;
+
+    explicit CypherProjectedGraphInfo(std::string cypherQuery)
+        : cypherQuery{std::move(cypherQuery)} {}
+
+    std::unique_ptr<ProjectedGraphInfo> copy() const override {
+        return std::make_unique<CypherProjectedGraphInfo>(cypherQuery);
+    }
+};
+
+struct ProjectedGraphInfoBindData final : TableFuncBindData {
+    graph::GraphEntryType type;
+    std::unique_ptr<ProjectedGraphInfo> info;
+
+    ProjectedGraphInfoBindData(binder::expression_vector columns, graph::GraphEntryType type,
+        std::unique_ptr<ProjectedGraphInfo> info)
+        : TableFuncBindData{std::move(columns),
+              type == graph::GraphEntryType::NATIVE ?
+                  info->constCast<NativeProjectedGraphInfo>().tableInfo.size() :
+                  1},
+          type{type}, info{std::move(info)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ProjectedGraphInfoBindData>(columns, type, info->copy());
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    auto projectedGraphData = input.bindData->constPtrCast<ProjectedGraphInfoBindData>();
+    switch (projectedGraphData->type) {
+    case graph::GraphEntryType::NATIVE: {
+        auto morselSize = morsel.getMorselSize();
+        auto nativeProjectedGraphInfo =
+            projectedGraphData->info->constCast<NativeProjectedGraphInfo>();
+        for (auto i = 0u; i < morselSize; i++) {
+            auto& tableInfo = nativeProjectedGraphInfo.tableInfo[i + morsel.startOffset];
+            output.getValueVectorMutable(0).setValue(i, tableInfo.tableType);
+            output.getValueVectorMutable(1).setValue(i, tableInfo.tableName);
+            output.getValueVectorMutable(2).setValue(i, tableInfo.predicate);
+        }
+        return morselSize;
+    }
+    case graph::GraphEntryType::CYPHER: {
+        output.getValueVectorMutable(0).setValue(0,
+            projectedGraphData->info->constCast<CypherProjectedGraphInfo>().cypherQuery);
+        return 1;
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> returnColumnNames;
+    std::vector<LogicalType> returnTypes;
+    auto graphName = input->getValue(0).toString();
+    auto graphEntrySet = graph::GraphEntrySet::Get(*context);
+    if (!graphEntrySet->hasGraph(graphName)) {
+        throw BinderException(stringFormat("Graph {} does not exist.", graphName));
+    }
+    auto graphEntry = graphEntrySet->getEntry(graphName);
+    switch (graphEntry->type) {
+    case graph::GraphEntryType::CYPHER: {
+        returnColumnNames.emplace_back("cypher statement");
+        returnTypes.emplace_back(LogicalType::STRING());
+    } break;
+    case graph::GraphEntryType::NATIVE: {
+        returnColumnNames.emplace_back("table type");
+        returnTypes.emplace_back(LogicalType::STRING());
+        returnColumnNames.emplace_back("table name");
+        returnTypes.emplace_back(LogicalType::STRING());
+        returnColumnNames.emplace_back("predicate");
+        returnTypes.emplace_back(LogicalType::STRING());
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    returnColumnNames =
+        TableFunction::extractYieldVariables(returnColumnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(returnColumnNames, returnTypes);
+    std::unique_ptr<ProjectedGraphInfo> projectedGraphInfo;
+    switch (graphEntry->type) {
+    case graph::GraphEntryType::CYPHER: {
+        auto& cypherGraphEntry = graphEntry->cast<graph::ParsedCypherGraphEntry>();
+        projectedGraphInfo =
+            std::make_unique<CypherProjectedGraphInfo>(cypherGraphEntry.cypherQuery);
+    } break;
+    case graph::GraphEntryType::NATIVE: {
+        auto& nativeGraphEntry = graphEntry->cast<graph::ParsedNativeGraphEntry>();
+        std::vector<ProjectedTableInfo> tableInfo;
+        for (auto& nodeInfo : nativeGraphEntry.nodeInfos) {
+            tableInfo.emplace_back(TableTypeUtils::toString(TableType::NODE), nodeInfo.tableName,
+                nodeInfo.predicate);
+        }
+        for (auto& relInfo : nativeGraphEntry.relInfos) {
+            tableInfo.emplace_back(TableTypeUtils::toString(TableType::REL), relInfo.tableName,
+                relInfo.predicate);
+        }
+        projectedGraphInfo = std::make_unique<NativeProjectedGraphInfo>(std::move(tableInfo));
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return std::make_unique<ProjectedGraphInfoBindData>(std::move(columns), graphEntry->type,
+        std::move(projectedGraphInfo));
+}
+
+function_set ProjectedGraphInfoFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function =
+        std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::STRING});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_attached_databases.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_attached_databases.cpp
new file mode 100644
index 0000000000..22174cb7cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_attached_databases.cpp
@@ -0,0 +1,66 @@
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "main/database_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace function {
+
+struct ShowAttachedDatabasesBindData final : TableFuncBindData {
+    std::vector<main::AttachedDatabase*> attachedDatabases;
+
+    ShowAttachedDatabasesBindData(std::vector<main::AttachedDatabase*> attachedDatabases,
+        binder::expression_vector columns, offset_t maxOffset)
+        : TableFuncBindData{std::move(columns), maxOffset},
+          attachedDatabases{std::move(attachedDatabases)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowAttachedDatabasesBindData>(attachedDatabases, columns, numRows);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    auto& attachedDatabases =
+        input.bindData->constPtrCast<ShowAttachedDatabasesBindData>()->attachedDatabases;
+    auto numDatabasesToOutput = morsel.getMorselSize();
+    for (auto i = 0u; i < numDatabasesToOutput; i++) {
+        const auto attachedDatabase = attachedDatabases[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, attachedDatabase->getDBName());
+        output.getValueVectorMutable(1).setValue(i, attachedDatabase->getDBType());
+    }
+    return numDatabasesToOutput;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("database type");
+    columnTypes.emplace_back(LogicalType::STRING());
+    auto attachedDatabases = main::DatabaseManager::Get(*context)->getAttachedDatabases();
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<ShowAttachedDatabasesBindData>(attachedDatabases, columns,
+        attachedDatabases.size());
+}
+
+function_set ShowAttachedDatabasesFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_connection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_connection.cpp
new file mode 100644
index 0000000000..b98e9d3a4c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_connection.cpp
@@ -0,0 +1,101 @@
+#include "binder/binder.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+struct ShowConnectionBindData final : TableFuncBindData {
+    std::vector<std::pair<NodeTableCatalogEntry*, NodeTableCatalogEntry*>> srcDstEntries;
+
+    ShowConnectionBindData(
+        std::vector<std::pair<NodeTableCatalogEntry*, NodeTableCatalogEntry*>> srcDstEntries,
+        binder::expression_vector columns, offset_t maxOffset)
+        : TableFuncBindData{std::move(columns), maxOffset},
+          srcDstEntries{std::move(srcDstEntries)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowConnectionBindData>(srcDstEntries, columns, numRows);
+    }
+};
+
+static void outputRelTableConnection(DataChunk& outputDataChunk, uint64_t outputPos,
+    const NodeTableCatalogEntry& srcEntry, const NodeTableCatalogEntry& dstEntry) {
+    // Write result to dataChunk
+    outputDataChunk.getValueVectorMutable(0).setValue(outputPos, srcEntry.getName());
+    outputDataChunk.getValueVectorMutable(1).setValue(outputPos, dstEntry.getName());
+    outputDataChunk.getValueVectorMutable(2).setValue(outputPos, srcEntry.getPrimaryKeyName());
+    outputDataChunk.getValueVectorMutable(3).setValue(outputPos, dstEntry.getPrimaryKeyName());
+}
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    const auto bindData = input.bindData->constPtrCast<ShowConnectionBindData>();
+    auto i = 0u;
+    auto size = morsel.getMorselSize();
+    for (; i < size; i++) {
+        auto [srcEntry, dstEntry] = bindData->srcDstEntries[i + morsel.startOffset];
+        outputRelTableConnection(output, i, *srcEntry, *dstEntry);
+    }
+    return i;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("source table name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("destination table name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("source table primary key");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("destination table primary key");
+    columnTypes.emplace_back(LogicalType::STRING());
+    const auto name = input->getLiteralVal<std::string>(0);
+    const auto catalog = Catalog::Get(*context);
+    auto transaction = transaction::Transaction::Get(*context);
+    std::vector<std::pair<NodeTableCatalogEntry*, NodeTableCatalogEntry*>> srcDstEntries;
+    if (catalog->containsTable(transaction, name)) {
+        auto entry = catalog->getTableCatalogEntry(transaction, name);
+        if (entry->getType() != catalog::CatalogEntryType::REL_GROUP_ENTRY) {
+            throw BinderException{"Show connection can only be called on a rel table!"};
+        }
+        for (auto& info : entry->ptrCast<RelGroupCatalogEntry>()->getRelEntryInfos()) {
+            auto srcEntry = catalog->getTableCatalogEntry(transaction, info.nodePair.srcTableID)
+                                ->ptrCast<NodeTableCatalogEntry>();
+            auto dstEntry = catalog->getTableCatalogEntry(transaction, info.nodePair.dstTableID)
+                                ->ptrCast<NodeTableCatalogEntry>();
+            srcDstEntries.emplace_back(srcEntry, dstEntry);
+        }
+    } else {
+        throw BinderException{"Show connection can only be called on a rel table!"};
+    }
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<ShowConnectionBindData>(srcDstEntries, columns, srcDstEntries.size());
+}
+
+function_set ShowConnectionFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_functions.cpp
new file mode 100644
index 0000000000..57b5b75007
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_functions.cpp
@@ -0,0 +1,86 @@
+#include "binder/binder.h"
+#include "catalog/catalog.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace function {
+
+struct FunctionInfo {
+    std::string name;
+    std::string type;
+    std::string signature;
+
+    FunctionInfo(std::string name, std::string type, std::string signature)
+        : name{std::move(name)}, type{std::move(type)}, signature{std::move(signature)} {}
+};
+
+struct ShowFunctionsBindData final : TableFuncBindData {
+    std::vector<FunctionInfo> sequences;
+
+    ShowFunctionsBindData(std::vector<FunctionInfo> sequences, binder::expression_vector columns,
+        offset_t maxOffset)
+        : TableFuncBindData{std::move(columns), maxOffset}, sequences{std::move(sequences)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowFunctionsBindData>(sequences, columns, numRows);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    auto sequences = input.bindData->constPtrCast<ShowFunctionsBindData>()->sequences;
+    auto numSequencesToOutput = morsel.getMorselSize();
+    for (auto i = 0u; i < numSequencesToOutput; i++) {
+        const auto functionInfo = sequences[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, functionInfo.name);
+        output.getValueVectorMutable(1).setValue(i, functionInfo.type);
+        output.getValueVectorMutable(2).setValue(i, functionInfo.signature);
+    }
+    return numSequencesToOutput;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("type");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("signature");
+    columnTypes.emplace_back(LogicalType::STRING());
+    std::vector<FunctionInfo> FunctionInfos;
+    for (const auto& entry :
+        Catalog::Get(*context)->getFunctionEntries(transaction::Transaction::Get(*context))) {
+        const auto& functionSet = entry->getFunctionSet();
+        const auto type = FunctionEntryTypeUtils::toString(entry->getType());
+        for (auto& function : functionSet) {
+            auto signature = function->signatureToString();
+            FunctionInfos.emplace_back(entry->getName(), type, signature);
+        }
+    }
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<ShowFunctionsBindData>(std::move(FunctionInfos), columns,
+        FunctionInfos.size());
+}
+
+function_set ShowFunctionsFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_indexes.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_indexes.cpp
new file mode 100644
index 0000000000..9bbcf4246e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_indexes.cpp
@@ -0,0 +1,127 @@
+#include "binder/binder.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/index_catalog_entry.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+struct IndexInfo {
+    std::string tableName;
+    std::string indexName;
+    std::string indexType;
+    std::vector<std::string> properties;
+    bool dependencyLoaded;
+    std::string indexDefinition;
+
+    IndexInfo(std::string tableName, std::string indexName, std::string indexType,
+        std::vector<std::string> properties, bool dependencyLoaded, std::string indexDefinition)
+        : tableName{std::move(tableName)}, indexName{std::move(indexName)},
+          indexType{std::move(indexType)}, properties{std::move(properties)},
+          dependencyLoaded{dependencyLoaded}, indexDefinition{std::move(indexDefinition)} {}
+};
+
+struct ShowIndexesBindData final : TableFuncBindData {
+    std::vector<IndexInfo> indexesInfo;
+
+    ShowIndexesBindData(std::vector<IndexInfo> indexesInfo, binder::expression_vector columns,
+        offset_t maxOffset)
+        : TableFuncBindData{std::move(columns), maxOffset}, indexesInfo{std::move(indexesInfo)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowIndexesBindData>(*this);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    auto& indexesInfo = input.bindData->constPtrCast<ShowIndexesBindData>()->indexesInfo;
+    auto numTuplesToOutput = morsel.getMorselSize();
+    auto& propertyVector = output.getValueVectorMutable(3);
+    auto propertyDataVec = ListVector::getDataVector(&propertyVector);
+    for (auto i = 0u; i < numTuplesToOutput; i++) {
+        auto indexInfo = indexesInfo[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, indexInfo.tableName);
+        output.getValueVectorMutable(1).setValue(i, indexInfo.indexName);
+        output.getValueVectorMutable(2).setValue(i, indexInfo.indexType);
+        auto listEntry = ListVector::addList(&propertyVector, indexInfo.properties.size());
+        for (auto j = 0u; j < indexInfo.properties.size(); j++) {
+            propertyDataVec->setValue(listEntry.offset + j, indexInfo.properties[j]);
+        }
+        propertyVector.setValue(i, listEntry);
+        output.getValueVectorMutable(4).setValue(i, indexInfo.dependencyLoaded);
+        output.getValueVectorMutable(5).setValue(i, indexInfo.indexDefinition);
+    }
+    return numTuplesToOutput;
+}
+
+static binder::expression_vector bindColumns(const TableFuncBindInput& input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("table_name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("index_name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("index_type");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("property_names");
+    columnTypes.emplace_back(LogicalType::LIST(LogicalType::STRING()));
+    columnNames.emplace_back("extension_loaded");
+    columnTypes.emplace_back(LogicalType::BOOL());
+    columnNames.emplace_back("index_definition");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames = TableFunction::extractYieldVariables(columnNames, input.yieldVariables);
+    return input.binder->createVariables(columnNames, columnTypes);
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<IndexInfo> indexesInfo;
+    auto catalog = Catalog::Get(*context);
+    auto transaction = transaction::Transaction::Get(*context);
+    auto indexEntries = catalog->getIndexEntries(transaction);
+    for (auto indexEntry : indexEntries) {
+        auto tableEntry = catalog->getTableCatalogEntry(transaction, indexEntry->getTableID());
+        auto tableName = tableEntry->getName();
+        auto indexName = indexEntry->getIndexName();
+        auto indexType = indexEntry->getIndexType();
+        auto properties = indexEntry->getPropertyIDs();
+        std::vector<std::string> propertyNames;
+        for (auto& property : properties) {
+            propertyNames.push_back(tableEntry->getProperty(property).getName());
+        }
+        auto dependencyLoaded = indexEntry->isLoaded();
+        std::string indexDefinition;
+        if (dependencyLoaded) {
+            auto& auxInfo = indexEntry->getAuxInfo();
+            common::FileScanInfo exportFileInfo{};
+            IndexToCypherInfo info{context, exportFileInfo};
+            indexDefinition = auxInfo.toCypher(*indexEntry, info);
+        }
+        indexesInfo.emplace_back(std::move(tableName), std::move(indexName), std::move(indexType),
+            std::move(propertyNames), dependencyLoaded, std::move(indexDefinition));
+    }
+    return std::make_unique<ShowIndexesBindData>(indexesInfo, bindColumns(*input),
+        indexesInfo.size());
+}
+
+function_set ShowIndexesFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<common::LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_loaded_extensions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_loaded_extensions.cpp
new file mode 100644
index 0000000000..1d61f26834
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_loaded_extensions.cpp
@@ -0,0 +1,91 @@
+#include "binder/binder.h"
+#include "extension/extension.h"
+#include "extension/extension_manager.h"
+#include "function/table/bind_data.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+struct LoadedExtensionInfo {
+    std::string name;
+    extension::ExtensionSource extensionSource;
+    std::string extensionPath;
+
+    LoadedExtensionInfo(std::string name, extension::ExtensionSource extensionSource,
+        std::string extensionPath)
+        : name{std::move(name)}, extensionSource{extensionSource},
+          extensionPath{std::move(extensionPath)} {}
+};
+
+struct ShowLoadedExtensionsBindData final : TableFuncBindData {
+    std::vector<LoadedExtensionInfo> loadedExtensionInfo;
+
+    ShowLoadedExtensionsBindData(std::vector<LoadedExtensionInfo> loadedExtensionInfo,
+        binder::expression_vector columns, offset_t maxOffset)
+        : TableFuncBindData{std::move(columns), maxOffset},
+          loadedExtensionInfo{std::move(loadedExtensionInfo)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowLoadedExtensionsBindData>(*this);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    auto& loadedExtensions =
+        input.bindData->constPtrCast<ShowLoadedExtensionsBindData>()->loadedExtensionInfo;
+    auto numTuplesToOutput = morsel.getMorselSize();
+    for (auto i = 0u; i < numTuplesToOutput; i++) {
+        auto loadedExtension = loadedExtensions[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, loadedExtension.name);
+        output.getValueVectorMutable(1).setValue(i,
+            extension::ExtensionSourceUtils::toString(loadedExtension.extensionSource));
+        output.getValueVectorMutable(2).setValue(i, loadedExtension.extensionPath);
+    }
+    return numTuplesToOutput;
+}
+
+static binder::expression_vector bindColumns(const TableFuncBindInput& input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("extension name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("extension source");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("extension path");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames = TableFunction::extractYieldVariables(columnNames, input.yieldVariables);
+    return input.binder->createVariables(columnNames, columnTypes);
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    auto loadedExtensions = extension::ExtensionManager::Get(*context)->getLoadedExtensions();
+    std::vector<LoadedExtensionInfo> loadedExtensionInfo;
+    for (auto& loadedExtension : loadedExtensions) {
+        loadedExtensionInfo.emplace_back(loadedExtension.getExtensionName(),
+            loadedExtension.getSource(), loadedExtension.getFullPath());
+    }
+    return std::make_unique<ShowLoadedExtensionsBindData>(loadedExtensionInfo, bindColumns(*input),
+        loadedExtensionInfo.size());
+}
+
+function_set ShowLoadedExtensionsFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<common::LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_macros.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_macros.cpp
new file mode 100644
index 0000000000..2204257c96
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_macros.cpp
@@ -0,0 +1,82 @@
+#include "binder/binder.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/scalar_macro_catalog_entry.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "function/table/bind_data.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace function {
+
+struct MacroInfo {
+    std::string name;
+    std::string definition;
+
+    MacroInfo(std::string name, std::string definition)
+        : name{std::move(name)}, definition(std::move(definition)) {}
+};
+
+struct ShowMacrosBindData final : TableFuncBindData {
+    std::vector<MacroInfo> macros;
+
+    ShowMacrosBindData(std::vector<MacroInfo> macros, binder::expression_vector columns,
+        row_idx_t numRows)
+        : TableFuncBindData{std::move(columns), numRows}, macros{std::move(macros)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowMacrosBindData>(macros, columns, numRows);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    const auto macros = input.bindData->constPtrCast<ShowMacrosBindData>()->macros;
+    const auto numMacrosToOutput = morsel.endOffset - morsel.startOffset;
+    for (auto i = 0u; i < numMacrosToOutput; i++) {
+        const auto tableInfo = macros[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, tableInfo.name);
+        output.getValueVectorMutable(1).setValue(i, tableInfo.definition);
+    }
+    return numMacrosToOutput;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("definition");
+    columnTypes.emplace_back(LogicalType::STRING());
+    std::vector<MacroInfo> macroInfos;
+    auto transaction = transaction::Transaction::Get(*context);
+    auto catalog = Catalog::Get(*context);
+    for (auto& entry : catalog->getMacroEntries(transaction)) {
+        std::string name = entry->getName();
+        auto macroFunction = catalog->getScalarMacroFunction(transaction, name);
+        macroInfos.emplace_back(name, macroFunction->toCypher(name));
+    }
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<ShowMacrosBindData>(std::move(macroInfos), std::move(columns),
+        macroInfos.size());
+}
+
+function_set ShowMacrosFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_official_extensions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_official_extensions.cpp
new file mode 100644
index 0000000000..c0bdc165f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_official_extensions.cpp
@@ -0,0 +1,65 @@
+#include "binder/binder.h"
+#include "extension/extension.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+static constexpr std::pair<std::string_view, std::string_view> extensions[] = {
+    {"ALGO", "Adds support for graph algorithms"},
+    {"AZURE", "Adds support for reading from azure blob storage"},
+    {"DELTA", "Adds support for reading from delta tables"},
+    {"DUCKDB", "Adds support for reading from duckdb tables"},
+    {"FTS", "Adds support for full-text search indexes"},
+    {"HTTPFS", "Adds support for reading and writing files over a HTTP(S)/S3 filesystem"},
+    {"ICEBERG", "Adds support for reading from iceberg tables"},
+    {"JSON", "Adds support for JSON operations"}, {"LLM", "Adds support for LLM operations"},
+    {"NEO4J", "Adds support for migrating nodes and rels from neo4j to lbug"},
+    {"POSTGRES", "Adds support for reading from POSTGRES tables"},
+    {"SQLITE", "Adds support for reading from SQLITE tables"},
+    {"UNITY_CATALOG", "Adds support for scanning delta tables registered in unity catalog"}};
+static constexpr auto officialExtensions = std::to_array(extensions);
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& /*input*/,
+    DataChunk& output) {
+    auto numTuplesToOutput = morsel.getMorselSize();
+    for (auto i = 0u; i < numTuplesToOutput; ++i) {
+        auto& [name, description] = officialExtensions[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, name);
+        output.getValueVectorMutable(1).setValue(i, description);
+    }
+    return numTuplesToOutput;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* /*context*/,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("description");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<TableFuncBindData>(std::move(columns), officialExtensions.size());
+}
+
+function_set ShowOfficialExtensionsFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<common::LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_projected_graphs.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_projected_graphs.cpp
new file mode 100644
index 0000000000..b7f1dedc88
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_projected_graphs.cpp
@@ -0,0 +1,78 @@
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "graph/graph_entry_set.h"
+
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+struct ProjectedGraphData {
+    std::string name;
+    std::string type;
+
+    ProjectedGraphData(std::string name, std::string type)
+        : name{std::move(name)}, type{std::move(type)} {}
+};
+
+struct ShowProjectedGraphBindData : public TableFuncBindData {
+    std::vector<ProjectedGraphData> projectedGraphData;
+
+    ShowProjectedGraphBindData(std::vector<ProjectedGraphData> projectedGraphData,
+        binder::expression_vector columns)
+        : TableFuncBindData{std::move(columns), projectedGraphData.size()},
+          projectedGraphData{std::move(projectedGraphData)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowProjectedGraphBindData>(projectedGraphData, columns);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    auto& projectedGraphData =
+        input.bindData->constPtrCast<ShowProjectedGraphBindData>()->projectedGraphData;
+    auto numTablesToOutput = morsel.endOffset - morsel.startOffset;
+    for (auto i = 0u; i < numTablesToOutput; i++) {
+        auto graphData = projectedGraphData[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, graphData.name);
+        output.getValueVectorMutable(1).setValue(i, graphData.type);
+    }
+    return numTablesToOutput;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> returnColumnNames;
+    std::vector<LogicalType> returnTypes;
+    returnColumnNames.emplace_back("name");
+    returnTypes.emplace_back(LogicalType::STRING());
+    returnColumnNames.emplace_back("type");
+    returnTypes.emplace_back(LogicalType::STRING());
+    returnColumnNames =
+        TableFunction::extractYieldVariables(returnColumnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(returnColumnNames, returnTypes);
+    std::vector<ProjectedGraphData> projectedGraphData;
+    for (auto& [name, entry] : graph::GraphEntrySet::Get(*context)->getNameToEntryMap()) {
+        projectedGraphData.emplace_back(name, graph::GraphEntryTypeUtils::toString(entry->type));
+    }
+    return std::make_unique<ShowProjectedGraphBindData>(std::move(projectedGraphData),
+        std::move(columns));
+}
+
+function_set ShowProjectedGraphsFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_sequences.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_sequences.cpp
new file mode 100644
index 0000000000..fa94887185
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_sequences.cpp
@@ -0,0 +1,120 @@
+#include "binder/binder.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace function {
+
+struct SequenceInfo {
+    std::string name;
+    std::string databaseName;
+    int64_t startValue;
+    int64_t increment;
+    int64_t minValue;
+    int64_t maxValue;
+    bool cycle;
+
+    SequenceInfo(std::string name, std::string databaseName, int64_t startValue, int64_t increment,
+        int64_t minValue, int64_t maxValue, bool cycle)
+        : name{std::move(name)}, databaseName{std::move(databaseName)}, startValue{startValue},
+          increment{increment}, minValue{minValue}, maxValue{maxValue}, cycle{cycle} {}
+};
+
+struct ShowSequencesBindData final : TableFuncBindData {
+    std::vector<SequenceInfo> sequences;
+
+    ShowSequencesBindData(std::vector<SequenceInfo> sequences, binder::expression_vector columns,
+        offset_t maxOffset)
+        : TableFuncBindData{std::move(columns), maxOffset}, sequences{std::move(sequences)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowSequencesBindData>(sequences, columns, numRows);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    const auto sequences = input.bindData->constPtrCast<ShowSequencesBindData>()->sequences;
+    const auto numSequencesToOutput = morsel.endOffset - morsel.startOffset;
+    for (auto i = 0u; i < numSequencesToOutput; i++) {
+        const auto sequenceInfo = sequences[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, sequenceInfo.name);
+        output.getValueVectorMutable(1).setValue(i, sequenceInfo.databaseName);
+        output.getValueVectorMutable(2).setValue(i, sequenceInfo.startValue);
+        output.getValueVectorMutable(3).setValue(i, sequenceInfo.increment);
+        output.getValueVectorMutable(4).setValue(i, sequenceInfo.minValue);
+        output.getValueVectorMutable(5).setValue(i, sequenceInfo.maxValue);
+        output.getValueVectorMutable(6).setValue(i, sequenceInfo.cycle);
+    }
+    return numSequencesToOutput;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("database name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("start value");
+    columnTypes.emplace_back(LogicalType::INT64());
+    columnNames.emplace_back("increment");
+    columnTypes.emplace_back(LogicalType::INT64());
+    columnNames.emplace_back("min value");
+    columnTypes.emplace_back(LogicalType::INT64());
+    columnNames.emplace_back("max value");
+    columnTypes.emplace_back(LogicalType::INT64());
+    columnNames.emplace_back("cycle");
+    columnTypes.emplace_back(LogicalType::BOOL());
+    std::vector<SequenceInfo> sequenceInfos;
+    for (const auto& entry :
+        Catalog::Get(*context)->getSequenceEntries(transaction::Transaction::Get(*context))) {
+        const auto sequenceData = entry->getSequenceData();
+        auto sequenceInfo = SequenceInfo{entry->getName(), LOCAL_DB_NAME, sequenceData.startValue,
+            sequenceData.increment, sequenceData.minValue, sequenceData.maxValue,
+            sequenceData.cycle};
+        sequenceInfos.push_back(std::move(sequenceInfo));
+    }
+
+    // TODO: uncomment this when we can test it
+    // for (auto attachedDatabase : databaseManager->getAttachedDatabases()) {
+    //     auto databaseName = attachedDatabase->getDBName();
+    //     auto databaseType = attachedDatabase->getDBType();
+    //     for (auto& entry : attachedDatabase->getCatalog()->getSequenceEntries(context->getTx()))
+    //     {
+    //         auto sequenceData = entry->getSequenceData();
+    //         auto sequenceInfo =
+    //             SequenceInfo{entry->getName(), stringFormat("{}({})", databaseName,
+    //             databaseType),
+    //                 sequenceData.startValue, sequenceData.increment, sequenceData.minValue,
+    //                 sequenceData.maxValue, sequenceData.cycle};
+    //         sequenceInfos.push_back(std::move(sequenceInfo));
+    //     }
+    // }
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<ShowSequencesBindData>(std::move(sequenceInfos), columns,
+        sequenceInfos.size());
+}
+
+function_set ShowSequencesFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_tables.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_tables.cpp
new file mode 100644
index 0000000000..913a514a33
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_tables.cpp
@@ -0,0 +1,110 @@
+#include "binder/binder.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "function/table/bind_data.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+#include "main/database_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace function {
+
+struct TableInfo {
+    std::string name;
+    table_id_t id;
+    std::string type;
+    std::string databaseName;
+    std::string comment;
+
+    TableInfo(std::string name, table_id_t id, std::string type, std::string databaseName,
+        std::string comment)
+        : name{std::move(name)}, id{id}, type{std::move(type)},
+          databaseName{std::move(databaseName)}, comment{std::move(comment)} {}
+};
+
+struct ShowTablesBindData final : TableFuncBindData {
+    std::vector<TableInfo> tables;
+
+    ShowTablesBindData(std::vector<TableInfo> tables, binder::expression_vector columns,
+        row_idx_t numRows)
+        : TableFuncBindData{std::move(columns), numRows}, tables{std::move(tables)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowTablesBindData>(tables, columns, numRows);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    const auto tables = input.bindData->constPtrCast<ShowTablesBindData>()->tables;
+    const auto numTablesToOutput = morsel.endOffset - morsel.startOffset;
+    for (auto i = 0u; i < numTablesToOutput; i++) {
+        const auto tableInfo = tables[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, tableInfo.id);
+        output.getValueVectorMutable(1).setValue(i, tableInfo.name);
+        output.getValueVectorMutable(2).setValue(i, tableInfo.type);
+        output.getValueVectorMutable(3).setValue(i, tableInfo.databaseName);
+        output.getValueVectorMutable(4).setValue(i, tableInfo.comment);
+    }
+    return numTablesToOutput;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("id");
+    columnTypes.emplace_back(LogicalType::UINT64());
+    columnNames.emplace_back("name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("type");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("database name");
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnNames.emplace_back("comment");
+    columnTypes.emplace_back(LogicalType::STRING());
+    std::vector<TableInfo> tableInfos;
+    auto transaction = transaction::Transaction::Get(*context);
+    if (!context->hasDefaultDatabase()) {
+        auto catalog = Catalog::Get(*context);
+        for (auto& entry :
+            catalog->getTableEntries(transaction, context->useInternalCatalogEntry())) {
+            tableInfos.emplace_back(entry->getName(), entry->getTableID(),
+                TableTypeUtils::toString(entry->getTableType()), LOCAL_DB_NAME,
+                entry->getComment());
+        }
+    }
+
+    for (auto attachedDatabase : main::DatabaseManager::Get(*context)->getAttachedDatabases()) {
+        auto databaseName = attachedDatabase->getDBName();
+        auto databaseType = attachedDatabase->getDBType();
+        for (auto& entry : attachedDatabase->getCatalog()->getTableEntries(transaction,
+                 context->useInternalCatalogEntry())) {
+            auto tableInfo = TableInfo{entry->getName(), entry->getTableID(),
+                TableTypeUtils::toString(entry->getTableType()),
+                stringFormat("{}({})", databaseName, databaseType), entry->getComment()};
+            tableInfos.push_back(std::move(tableInfo));
+        }
+    }
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<ShowTablesBindData>(std::move(tableInfos), std::move(columns),
+        tableInfos.size());
+}
+
+function_set ShowTablesFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_warnings.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_warnings.cpp
new file mode 100644
index 0000000000..978842dddd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/show_warnings.cpp
@@ -0,0 +1,67 @@
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "processor/warning_context.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct ShowWarningsBindData final : TableFuncBindData {
+    std::vector<processor::WarningInfo> warnings;
+
+    ShowWarningsBindData(std::vector<processor::WarningInfo> warnings,
+        binder::expression_vector columns, offset_t maxOffset)
+        : TableFuncBindData{std::move(columns), maxOffset}, warnings{std::move(warnings)} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ShowWarningsBindData>(warnings, columns, numRows);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    const auto warnings = input.bindData->constPtrCast<ShowWarningsBindData>()->warnings;
+    const auto numWarningsToOutput = morsel.endOffset - morsel.startOffset;
+    for (auto i = 0u; i < numWarningsToOutput; i++) {
+        const auto tableInfo = warnings[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, tableInfo.queryID);
+        output.getValueVectorMutable(1).setValue(i, tableInfo.warning.message);
+        output.getValueVectorMutable(2).setValue(i, tableInfo.warning.filePath);
+        output.getValueVectorMutable(3).setValue(i, tableInfo.warning.lineNumber);
+        output.getValueVectorMutable(4).setValue(i, tableInfo.warning.skippedLineOrRecord);
+    }
+    return numWarningsToOutput;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames{WarningConstants::WARNING_TABLE_COLUMN_NAMES.begin(),
+        WarningConstants::WARNING_TABLE_COLUMN_NAMES.end()};
+    std::vector<LogicalType> columnTypes{WarningConstants::WARNING_TABLE_COLUMN_DATA_TYPES.begin(),
+        WarningConstants::WARNING_TABLE_COLUMN_DATA_TYPES.end()};
+    std::vector<processor::WarningInfo> warningInfos;
+    for (const auto& warning : processor::WarningContext::Get(*context)->getPopulatedWarnings()) {
+        warningInfos.emplace_back(warning);
+    }
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<ShowWarningsBindData>(std::move(warningInfos), columns,
+        warningInfos.size());
+}
+
+function_set ShowWarningsFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/simple_table_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/simple_table_function.cpp
new file mode 100644
index 0000000000..18002d280c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/simple_table_function.cpp
@@ -0,0 +1,39 @@
+#include "function/table/simple_table_function.h"
+
+#include "function/table/bind_data.h"
+
+namespace lbug {
+namespace function {
+
+TableFuncMorsel SimpleTableFuncSharedState::getMorsel() {
+    std::lock_guard lck{mtx};
+    KU_ASSERT(curRowIdx <= numRows);
+    if (curRowIdx == numRows) {
+        return TableFuncMorsel::createInvalidMorsel();
+    }
+    const auto numValuesToOutput = std::min(maxMorselSize, numRows - curRowIdx);
+    curRowIdx += numValuesToOutput;
+    return {curRowIdx - numValuesToOutput, curRowIdx};
+}
+
+std::unique_ptr<TableFuncSharedState> SimpleTableFunc::initSharedState(
+    const TableFuncInitSharedStateInput& input) {
+    return std::make_unique<SimpleTableFuncSharedState>(input.bindData->numRows);
+}
+
+common::offset_t tableFunc(simple_internal_table_func internalTableFunc,
+    const TableFuncInput& input, TableFuncOutput& output) {
+    const auto sharedState = input.sharedState->ptrCast<SimpleTableFuncSharedState>();
+    auto morsel = sharedState->getMorsel();
+    if (!morsel.hasMoreToOutput()) {
+        return 0;
+    }
+    return internalTableFunc(morsel, input, output.dataChunk);
+}
+
+table_func_t SimpleTableFunc::getTableFunc(simple_internal_table_func internalTableFunc) {
+    return std::bind(tableFunc, internalTableFunc, std::placeholders::_1, std::placeholders::_2);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/stats_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/stats_info.cpp
new file mode 100644
index 0000000000..ea9ce9464f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/stats_info.cpp
@@ -0,0 +1,93 @@
+#include "binder/binder.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "storage/storage_manager.h"
+#include "storage/table/node_table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+struct StatsInfoBindData final : TableFuncBindData {
+    TableCatalogEntry* tableEntry;
+    storage::Table* table;
+    const ClientContext* context;
+
+    StatsInfoBindData(binder::expression_vector columns, TableCatalogEntry* tableEntry,
+        storage::Table* table, const ClientContext* context)
+        : TableFuncBindData{std::move(columns), 1 /*numRows*/}, tableEntry{tableEntry},
+          table{table}, context{context} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<StatsInfoBindData>(columns, tableEntry, table, context);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& /*morsel*/, const TableFuncInput& input,
+    DataChunk& output) {
+    const auto bindData = input.bindData->constPtrCast<StatsInfoBindData>();
+    const auto table = bindData->table;
+    switch (table->getTableType()) {
+    case TableType::NODE: {
+        const auto& nodeTable = table->cast<storage::NodeTable>();
+        const auto stats = nodeTable.getStats(transaction::Transaction::Get(*bindData->context));
+        output.getValueVectorMutable(0).setValue<cardinality_t>(0, stats.getTableCard());
+        for (auto i = 0u; i < nodeTable.getNumColumns(); ++i) {
+            output.getValueVectorMutable(i + 1).setValue(0, stats.getNumDistinctValues(i));
+        }
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    return 1;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const ClientContext* context,
+    const TableFuncBindInput* input) {
+    const auto tableName = input->getLiteralVal<std::string>(0);
+    const auto catalog = Catalog::Get(*context);
+    if (!catalog->containsTable(transaction::Transaction::Get(*context), tableName)) {
+        throw BinderException{"Table " + tableName + " does not exist!"};
+    }
+    auto tableEntry =
+        catalog->getTableCatalogEntry(transaction::Transaction::Get(*context), tableName);
+    if (tableEntry->getTableType() != TableType::NODE) {
+        throw BinderException{
+            "Stats from a non-node table " + tableName + " is not supported yet!"};
+    }
+
+    std::vector<std::string> columnNames = {"cardinality"};
+    std::vector<LogicalType> columnTypes;
+    columnTypes.push_back(LogicalType::INT64());
+    for (auto& propDef : tableEntry->getProperties()) {
+        columnNames.push_back(propDef.getName() + "_distinct_count");
+        columnTypes.push_back(LogicalType::INT64());
+    }
+    const auto storageManager = storage::StorageManager::Get(*context);
+    auto table = storageManager->getTable(tableEntry->getTableID());
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<StatsInfoBindData>(columns, tableEntry, table, context);
+}
+
+function_set StatsInfoFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/storage_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/storage_info.cpp
new file mode 100644
index 0000000000..deaddb96fb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/storage_info.cpp
@@ -0,0 +1,348 @@
+#include "binder/binder.h"
+#include "common/data_chunk/data_chunk_collection.h"
+#include "common/exception/binder.h"
+#include "common/type_utils.h"
+#include "common/types/interval_t.h"
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "storage/storage_manager.h"
+#include "storage/table/list_chunk_data.h"
+#include "storage/table/list_column.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+#include "storage/table/string_chunk_data.h"
+#include "storage/table/string_column.h"
+#include "storage/table/struct_chunk_data.h"
+#include "storage/table/struct_column.h"
+#include <concepts>
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::storage;
+using namespace lbug::main;
+
+namespace lbug {
+namespace function {
+
+struct StorageInfoLocalState final : TableFuncLocalState {
+    std::unique_ptr<DataChunkCollection> dataChunkCollection;
+    idx_t currChunkIdx;
+
+    explicit StorageInfoLocalState(MemoryManager* mm) : currChunkIdx{0} {
+        dataChunkCollection = std::make_unique<DataChunkCollection>(mm);
+    }
+};
+
+struct StorageInfoBindData final : TableFuncBindData {
+    TableCatalogEntry* tableEntry;
+    const ClientContext* context;
+
+    StorageInfoBindData(binder::expression_vector columns, TableCatalogEntry* tableEntry,
+        const ClientContext* context)
+        : TableFuncBindData{std::move(columns), 1 /*maxOffset*/}, tableEntry{tableEntry},
+          context{context} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<StorageInfoBindData>(columns, tableEntry, context);
+    }
+};
+
+static std::unique_ptr<TableFuncLocalState> initLocalState(
+    const TableFuncInitLocalStateInput& input) {
+    return std::make_unique<StorageInfoLocalState>(MemoryManager::Get(*input.clientContext));
+}
+
+struct StorageInfoOutputData {
+    node_group_idx_t nodeGroupIdx = INVALID_NODE_GROUP_IDX;
+    node_group_idx_t chunkIdx = INVALID_NODE_GROUP_IDX;
+    std::string tableType;
+    uint32_t columnIdx = INVALID_COLUMN_ID;
+    std::vector<const Column*> columns;
+};
+
+static void resetOutputIfNecessary(const StorageInfoLocalState* localState,
+    DataChunk& outputChunk) {
+    if (outputChunk.state->getSelVector().getSelSize() == DEFAULT_VECTOR_CAPACITY) {
+        localState->dataChunkCollection->append(outputChunk);
+        outputChunk.resetAuxiliaryBuffer();
+        outputChunk.state->getSelVectorUnsafe().setSelSize(0);
+    }
+}
+
+static void appendStorageInfoForChunkData(StorageInfoLocalState* localState, DataChunk& outputChunk,
+    StorageInfoOutputData& outputData, const Column& column, const ColumnChunkData& chunkData,
+    bool ignoreNull = false) {
+    resetOutputIfNecessary(localState, outputChunk);
+    auto vectorPos = outputChunk.state->getSelVector().getSelSize();
+    auto residency = chunkData.getResidencyState();
+    ColumnChunkMetadata metadata;
+    switch (residency) {
+    case ResidencyState::IN_MEMORY: {
+        metadata = chunkData.getMetadataToFlush();
+    } break;
+    case ResidencyState::ON_DISK: {
+        metadata = chunkData.getMetadata();
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    auto& columnType = chunkData.getDataType();
+    outputChunk.getValueVectorMutable(0).setValue(vectorPos, outputData.tableType);
+    outputChunk.getValueVectorMutable(1).setValue<uint64_t>(vectorPos, outputData.nodeGroupIdx);
+    outputChunk.getValueVectorMutable(2).setValue<uint64_t>(vectorPos, outputData.chunkIdx);
+    outputChunk.getValueVectorMutable(3).setValue(vectorPos,
+        ResidencyStateUtils::toString(residency));
+    outputChunk.getValueVectorMutable(4).setValue(vectorPos, column.getName());
+    outputChunk.getValueVectorMutable(5).setValue(vectorPos, columnType.toString());
+    outputChunk.getValueVectorMutable(6).setValue<uint64_t>(vectorPos, metadata.getStartPageIdx());
+    outputChunk.getValueVectorMutable(7).setValue<uint64_t>(vectorPos, metadata.getNumPages());
+    outputChunk.getValueVectorMutable(8).setValue<uint64_t>(vectorPos, metadata.numValues);
+
+    auto customToString = [&]<typename T>(T) {
+        outputChunk.getValueVectorMutable(9).setValue(vectorPos,
+            std::to_string(metadata.compMeta.min.get<T>()));
+        outputChunk.getValueVectorMutable(10).setValue(vectorPos,
+            std::to_string(metadata.compMeta.max.get<T>()));
+    };
+    auto physicalType = columnType.getPhysicalType();
+    TypeUtils::visit(
+        physicalType, [&](ku_string_t) { customToString(uint32_t()); },
+        [&](list_entry_t) { customToString(uint64_t()); },
+        [&](internalID_t) { customToString(uint64_t()); },
+        [&]<typename T>(T)
+            requires(std::integral<T> || std::floating_point<T>)
+        {
+            auto min = metadata.compMeta.min.get<T>();
+            auto max = metadata.compMeta.max.get<T>();
+            outputChunk.getValueVectorMutable(9).setValue(vectorPos,
+                TypeUtils::entryToString(columnType, (uint8_t*)&min,
+                    &outputChunk.getValueVectorMutable(9)));
+            outputChunk.getValueVectorMutable(10).setValue(vectorPos,
+                TypeUtils::entryToString(columnType, (uint8_t*)&max,
+                    &outputChunk.getValueVectorMutable(10)));
+        },
+        // Types which don't support statistics.
+        // types not supported by TypeUtils::visit can
+        // also be ignored since we don't track statistics for them
+        [](int128_t) {}, [](struct_entry_t) {}, [](interval_t) {}, [](uint128_t) {});
+    outputChunk.getValueVectorMutable(11).setValue(vectorPos,
+        metadata.compMeta.toString(physicalType));
+    outputChunk.state->getSelVectorUnsafe().incrementSelSize();
+    if (columnType.getPhysicalType() == PhysicalTypeID::INTERNAL_ID) {
+        ignoreNull = true;
+    }
+    if (!ignoreNull && chunkData.hasNullData()) {
+        appendStorageInfoForChunkData(localState, outputChunk, outputData, *column.getNullColumn(),
+            *chunkData.getNullData());
+    }
+    switch (columnType.getPhysicalType()) {
+    case PhysicalTypeID::STRUCT: {
+        auto& structChunk = chunkData.cast<StructChunkData>();
+        const auto& structColumn = ku_dynamic_cast<const StructColumn&>(column);
+        auto numChildren = structChunk.getNumChildren();
+        for (auto i = 0u; i < numChildren; i++) {
+            appendStorageInfoForChunkData(localState, outputChunk, outputData,
+                *structColumn.getChild(i), structChunk.getChild(i));
+        }
+    } break;
+    case PhysicalTypeID::STRING: {
+        auto& stringChunk = chunkData.cast<StringChunkData>();
+        auto& dictionaryChunk = stringChunk.getDictionaryChunk();
+        const auto& stringColumn = ku_dynamic_cast<const StringColumn&>(column);
+        appendStorageInfoForChunkData(localState, outputChunk, outputData,
+            *stringColumn.getIndexColumn(), *stringChunk.getIndexColumnChunk());
+        appendStorageInfoForChunkData(localState, outputChunk, outputData,
+            *stringColumn.getDictionary().getDataColumn(), *dictionaryChunk.getStringDataChunk());
+        appendStorageInfoForChunkData(localState, outputChunk, outputData,
+            *stringColumn.getDictionary().getOffsetColumn(), *dictionaryChunk.getOffsetChunk());
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        auto& listChunk = chunkData.cast<ListChunkData>();
+        const auto& listColumn = ku_dynamic_cast<const ListColumn&>(column);
+        appendStorageInfoForChunkData(localState, outputChunk, outputData,
+            *listColumn.getOffsetColumn(), *listChunk.getOffsetColumnChunk());
+        appendStorageInfoForChunkData(localState, outputChunk, outputData,
+            *listColumn.getSizeColumn(), *listChunk.getSizeColumnChunk());
+        appendStorageInfoForChunkData(localState, outputChunk, outputData,
+            *listColumn.getDataColumn(), *listChunk.getDataColumnChunk());
+    } break;
+    default: {
+        // DO NOTHING.
+    }
+    }
+}
+
+static void appendStorageInfoForChunkedGroup(StorageInfoLocalState* localState,
+    DataChunk& outputChunk, StorageInfoOutputData& outputData, ChunkedNodeGroup* chunkedGroup) {
+    auto numColumns = chunkedGroup->getNumColumns();
+    outputData.columnIdx = 0;
+    for (auto i = 0u; i < numColumns; i++) {
+        for (auto* segment : chunkedGroup->getColumnChunk(i).getSegments()) {
+            appendStorageInfoForChunkData(localState, outputChunk, outputData,
+                *outputData.columns[i], *segment);
+        }
+    }
+    if (chunkedGroup->getFormat() == NodeGroupDataFormat::CSR) {
+        auto& chunkedCSRGroup = chunkedGroup->cast<ChunkedCSRNodeGroup>();
+        for (auto* segment : chunkedCSRGroup.getCSRHeader().offset->getSegments()) {
+            appendStorageInfoForChunkData(localState, outputChunk, outputData,
+                *outputData.columns[numColumns], *segment, true);
+        }
+        for (auto* segment : chunkedCSRGroup.getCSRHeader().length->getSegments()) {
+            appendStorageInfoForChunkData(localState, outputChunk, outputData,
+                *outputData.columns[numColumns + 1], *segment, true);
+        }
+    }
+}
+
+static void appendStorageInfoForNodeGroup(StorageInfoLocalState* localState, DataChunk& outputChunk,
+    StorageInfoOutputData& outputData, NodeGroup* nodeGroup) {
+    auto numChunks = nodeGroup->getNumChunkedGroups();
+    for (auto chunkIdx = 0ul; chunkIdx < numChunks; chunkIdx++) {
+        outputData.chunkIdx = chunkIdx;
+        appendStorageInfoForChunkedGroup(localState, outputChunk, outputData,
+            nodeGroup->getChunkedNodeGroup(chunkIdx));
+    }
+    if (nodeGroup->getFormat() == NodeGroupDataFormat::CSR) {
+        auto& csrNodeGroup = nodeGroup->cast<CSRNodeGroup>();
+        auto persistentChunk = csrNodeGroup.getPersistentChunkedGroup();
+        if (persistentChunk) {
+            outputData.chunkIdx = INVALID_NODE_GROUP_IDX;
+            appendStorageInfoForChunkedGroup(localState, outputChunk, outputData,
+                csrNodeGroup.getPersistentChunkedGroup());
+        }
+    }
+}
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput& output) {
+    auto& dataChunk = output.dataChunk;
+    auto localState = ku_dynamic_cast<StorageInfoLocalState*>(input.localState);
+    KU_ASSERT(dataChunk.state->getSelVector().isUnfiltered());
+    auto storageManager = StorageManager::Get(*input.context->clientContext);
+    while (true) {
+        if (localState->currChunkIdx < localState->dataChunkCollection->getNumChunks()) {
+            // Copy from local state chunk.
+            const auto& chunk =
+                localState->dataChunkCollection->getChunkUnsafe(localState->currChunkIdx);
+            const auto numValuesToOutput = chunk.state->getSelVector().getSelSize();
+            for (auto columnIdx = 0u; columnIdx < dataChunk.getNumValueVectors(); columnIdx++) {
+                const auto& localVector = chunk.getValueVector(columnIdx);
+                auto& outputVector = dataChunk.getValueVectorMutable(columnIdx);
+                for (auto i = 0u; i < numValuesToOutput; i++) {
+                    outputVector.copyFromVectorData(i, &localVector, i);
+                }
+            }
+            dataChunk.state->getSelVectorUnsafe().setToUnfiltered(numValuesToOutput);
+            localState->currChunkIdx++;
+            return numValuesToOutput;
+        }
+        auto morsel = input.sharedState->ptrCast<SimpleTableFuncSharedState>()->getMorsel();
+        if (!morsel.hasMoreToOutput()) {
+            return 0;
+        }
+        const auto bindData = input.bindData->constPtrCast<StorageInfoBindData>();
+        StorageInfoOutputData outputData;
+        node_group_idx_t numNodeGroups = 0;
+        switch (bindData->tableEntry->getTableType()) {
+        case TableType::NODE: {
+            outputData.tableType = "NODE";
+            auto table = storageManager->getTable(bindData->tableEntry->getTableID());
+            auto& nodeTable = table->cast<NodeTable>();
+            std::vector<const Column*> columns;
+            for (auto columnID = 0u; columnID < nodeTable.getNumColumns(); columnID++) {
+                columns.push_back(&nodeTable.getColumn(columnID));
+            }
+            outputData.columns = std::move(columns);
+            numNodeGroups = nodeTable.getNumNodeGroups();
+            for (auto i = 0ul; i < numNodeGroups; i++) {
+                outputData.nodeGroupIdx = i;
+                appendStorageInfoForNodeGroup(localState, dataChunk, outputData,
+                    nodeTable.getNodeGroup(i));
+            }
+        } break;
+        case TableType::REL: {
+            outputData.tableType = "REL";
+            for (auto innerEntryInfo :
+                bindData->tableEntry->cast<RelGroupCatalogEntry>().getRelEntryInfos()) {
+                auto& relTable = storageManager->getTable(innerEntryInfo.oid)->cast<RelTable>();
+                auto appendDirectedStorageInfo = [&](RelDataDirection direction) {
+                    auto directedRelTableData = relTable.getDirectedTableData(direction);
+                    std::vector<const Column*> columns;
+                    for (auto columnID = 0u; columnID < relTable.getNumColumns(); columnID++) {
+                        columns.push_back(directedRelTableData->getColumn(columnID));
+                    }
+                    columns.push_back(directedRelTableData->getCSROffsetColumn());
+                    columns.push_back(directedRelTableData->getCSRLengthColumn());
+                    outputData.columns = std::move(columns);
+                    numNodeGroups = directedRelTableData->getNumNodeGroups();
+                    for (auto i = 0ul; i < numNodeGroups; i++) {
+                        outputData.nodeGroupIdx = i;
+                        appendStorageInfoForNodeGroup(localState, dataChunk, outputData,
+                            directedRelTableData->getNodeGroup(i));
+                    }
+                };
+                for (auto direction : relTable.getStorageDirections()) {
+                    appendDirectedStorageInfo(direction);
+                }
+            }
+        } break;
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+        localState->dataChunkCollection->append(dataChunk);
+        dataChunk.resetAuxiliaryBuffer();
+        dataChunk.state->getSelVectorUnsafe().setSelSize(0);
+    }
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames = {"table_type", "node_group_id", "node_chunk_id",
+        "residency", "column_name", "data_type", "start_page_idx", "num_pages", "num_values", "min",
+        "max", "compression"};
+    std::vector<LogicalType> columnTypes;
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnTypes.emplace_back(LogicalType::INT64());
+    columnTypes.emplace_back(LogicalType::INT64());
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnTypes.emplace_back(LogicalType::INT64());
+    columnTypes.emplace_back(LogicalType::INT64());
+    columnTypes.emplace_back(LogicalType::INT64());
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnTypes.emplace_back(LogicalType::STRING());
+    columnTypes.emplace_back(LogicalType::STRING());
+    auto tableName = input->getLiteralVal<std::string>(0);
+    auto catalog = Catalog::Get(*context);
+    if (!catalog->containsTable(transaction::Transaction::Get(*context), tableName)) {
+        throw BinderException{"Table " + tableName + " does not exist!"};
+    }
+    auto tableEntry =
+        catalog->getTableCatalogEntry(transaction::Transaction::Get(*context), tableName);
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<StorageInfoBindData>(columns, tableEntry, context);
+}
+
+function_set StorageInfoFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    function->tableFunc = tableFunc;
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = initLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/table_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/table_function.cpp
new file mode 100644
index 0000000000..eefe8b5e0a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/table_function.cpp
@@ -0,0 +1,115 @@
+#include "function/table/table_function.h"
+
+#include "common/exception/binder.h"
+#include "parser/query/reading_clause/yield_variable.h"
+#include "planner/operator/logical_table_function_call.h"
+#include "planner/planner.h"
+#include "processor/data_pos.h"
+#include "processor/operator/table_function_call.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace function {
+
+void TableFuncOutput::resetState() {
+    dataChunk.state->getSelVectorUnsafe().setSelSize(0);
+    dataChunk.resetAuxiliaryBuffer();
+    for (auto i = 0u; i < dataChunk.getNumValueVectors(); i++) {
+        dataChunk.getValueVectorMutable(i).setAllNonNull();
+    }
+}
+
+void TableFuncOutput::setOutputSize(offset_t size) const {
+    dataChunk.state->getSelVectorUnsafe().setToUnfiltered(size);
+}
+
+TableFunction::~TableFunction() = default;
+
+std::unique_ptr<TableFuncLocalState> TableFunction::initEmptyLocalState(
+    const TableFuncInitLocalStateInput&) {
+    return std::make_unique<TableFuncLocalState>();
+}
+
+std::unique_ptr<TableFuncSharedState> TableFunction::initEmptySharedState(
+    const TableFuncInitSharedStateInput& /*input*/) {
+    return std::make_unique<TableFuncSharedState>();
+}
+
+std::unique_ptr<TableFuncOutput> TableFunction::initSingleDataChunkScanOutput(
+    const TableFuncInitOutputInput& input) {
+    if (input.outColumnPositions.empty()) {
+        return std::make_unique<TableFuncOutput>(DataChunk{});
+    }
+    auto state = input.resultSet.getDataChunk(input.outColumnPositions[0].dataChunkPos)->state;
+    auto dataChunk = DataChunk(input.outColumnPositions.size(), state);
+    for (auto i = 0u; i < input.outColumnPositions.size(); ++i) {
+        dataChunk.insert(i, input.resultSet.getValueVector(input.outColumnPositions[i]));
+    }
+    return std::make_unique<TableFuncOutput>(std::move(dataChunk));
+}
+
+std::vector<std::string> TableFunction::extractYieldVariables(const std::vector<std::string>& names,
+    const std::vector<parser::YieldVariable>& yieldVariables) {
+    std::vector<std::string> variableNames;
+    if (!yieldVariables.empty()) {
+        if (yieldVariables.size() < names.size()) {
+            throw BinderException{"Output variables must all appear in the yield clause."};
+        }
+        if (yieldVariables.size() > names.size()) {
+            throw BinderException{"The number of variables in the yield clause exceeds the "
+                                  "number of output variables of the table function."};
+        }
+        for (auto i = 0u; i < names.size(); i++) {
+            if (names[i] != yieldVariables[i].name) {
+                throw BinderException{stringFormat(
+                    "Unknown table function output variable name: {}.", yieldVariables[i].name)};
+            }
+            auto variableName =
+                yieldVariables[i].hasAlias() ? yieldVariables[i].alias : yieldVariables[i].name;
+            variableNames.push_back(variableName);
+        }
+    } else {
+        variableNames = names;
+    }
+    return variableNames;
+}
+
+void TableFunction::getLogicalPlan(Planner* planner,
+    const binder::BoundReadingClause& boundReadingClause, binder::expression_vector predicates,
+    LogicalPlan& plan) {
+    auto op = planner->getTableFunctionCall(boundReadingClause);
+    planner->planReadOp(op, predicates, plan);
+}
+
+std::unique_ptr<PhysicalOperator> TableFunction::getPhysicalPlan(PlanMapper* planMapper,
+    const LogicalOperator* logicalOp) {
+    std::vector<DataPos> outPosV;
+    auto& call = logicalOp->constCast<LogicalTableFunctionCall>();
+    auto outSchema = call.getSchema();
+    for (auto& expr : call.getBindData()->columns) {
+        outPosV.emplace_back(planMapper->getDataPos(*expr, *outSchema));
+    }
+    auto info = TableFunctionCallInfo();
+    info.function = call.getTableFunc();
+    info.bindData = call.getBindData()->copy();
+    info.outPosV = outPosV;
+    auto initInput =
+        TableFuncInitSharedStateInput(info.bindData.get(), planMapper->executionContext);
+    auto sharedState = info.function.initSharedStateFunc(initInput);
+    auto printInfo = std::make_unique<TableFunctionCallPrintInfo>(call.getTableFunc().name,
+        call.getBindData()->columns);
+    return std::make_unique<TableFunctionCall>(std::move(info), sharedState,
+        planMapper->getOperatorID(), std::move(printInfo));
+}
+
+offset_t TableFunction::emptyTableFunc(const TableFuncInput&, TableFuncOutput&) {
+    // DO NOTHING.
+    return 0;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/table_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/table_info.cpp
new file mode 100644
index 0000000000..a9425b59c5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/table/table_info.cpp
@@ -0,0 +1,224 @@
+#include "binder/binder.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/enums/extend_direction_util.h"
+#include "common/exception/catalog.h"
+#include "common/string_utils.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/simple_table_function.h"
+#include "main/client_context.h"
+#include "main/database_manager.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct ExtraPropertyInfo {
+    virtual ~ExtraPropertyInfo() = default;
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+    virtual std::unique_ptr<ExtraPropertyInfo> copy() const = 0;
+};
+
+struct ExtraNodePropertyInfo : ExtraPropertyInfo {
+    bool isPrimaryKey;
+
+    explicit ExtraNodePropertyInfo(bool isPrimaryKey) : isPrimaryKey{isPrimaryKey} {}
+
+    std::unique_ptr<ExtraPropertyInfo> copy() const override {
+        return std::make_unique<ExtraNodePropertyInfo>(isPrimaryKey);
+    }
+};
+
+struct ExtraRelPropertyInfo : ExtraPropertyInfo {
+    std::string storageDirection;
+
+    explicit ExtraRelPropertyInfo(std::string storageDirection)
+        : storageDirection{std::move(storageDirection)} {}
+
+    std::unique_ptr<ExtraPropertyInfo> copy() const override {
+        return std::make_unique<ExtraRelPropertyInfo>(storageDirection);
+    }
+};
+
+struct PropertyInfo {
+    column_id_t propertyID = INVALID_COLUMN_ID;
+    std::string name;
+    std::string type;
+    std::string defaultVal;
+    std::unique_ptr<ExtraPropertyInfo> extraInfo = nullptr;
+
+    PropertyInfo() = default;
+    EXPLICIT_COPY_DEFAULT_MOVE(PropertyInfo);
+
+private:
+    PropertyInfo(const PropertyInfo& other)
+        : propertyID{other.propertyID}, name{other.name}, type{other.type},
+          defaultVal{other.defaultVal} {
+        if (other.extraInfo) {
+            extraInfo = other.extraInfo->copy();
+        }
+    }
+};
+
+struct TableInfoBindData final : TableFuncBindData {
+    CatalogEntryType type;
+    std::vector<PropertyInfo> infos;
+
+    TableInfoBindData(CatalogEntryType type, std::vector<PropertyInfo> infos,
+        binder::expression_vector columns)
+        : TableFuncBindData{std::move(columns), infos.size()}, type{type}, infos{std::move(infos)} {
+    }
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<TableInfoBindData>(type, copyVector(infos), columns);
+    }
+};
+
+static offset_t internalTableFunc(const TableFuncMorsel& morsel, const TableFuncInput& input,
+    DataChunk& output) {
+    auto bindData = input.bindData->constPtrCast<TableInfoBindData>();
+    auto i = 0u;
+    auto size = morsel.getMorselSize();
+    for (; i < size; i++) {
+        auto& info = bindData->infos[morsel.startOffset + i];
+        output.getValueVectorMutable(0).setValue(i, info.propertyID);
+        output.getValueVectorMutable(1).setValue(i, info.name);
+        output.getValueVectorMutable(2).setValue(i, info.type);
+        output.getValueVectorMutable(3).setValue(i, info.defaultVal);
+        switch (bindData->type) {
+        case CatalogEntryType::NODE_TABLE_ENTRY: {
+            auto extraInfo = info.extraInfo->ptrCast<ExtraNodePropertyInfo>();
+            output.getValueVectorMutable(4).setValue(i, extraInfo->isPrimaryKey);
+        } break;
+        case CatalogEntryType::REL_GROUP_ENTRY: {
+            auto extraInfo = info.extraInfo->ptrCast<ExtraRelPropertyInfo>();
+            output.getValueVectorMutable(4).setValue(i, extraInfo->storageDirection);
+        } break;
+        default:
+            break;
+        }
+    }
+    return i;
+}
+
+static PropertyInfo getInfo(const binder::PropertyDefinition& def) {
+    auto info = PropertyInfo();
+    info.name = def.getName();
+    info.type = def.getType().toString();
+    info.defaultVal = def.getDefaultExpressionName();
+    return info;
+}
+
+static std::vector<PropertyInfo> getForeignPropertyInfos(TableCatalogEntry* entry) {
+    std::vector<PropertyInfo> infos;
+    for (auto& def : entry->getProperties()) {
+        auto info = getInfo(def);
+        info.propertyID = entry->getPropertyID(def.getName());
+        infos.push_back(std::move(info));
+    }
+    return infos;
+}
+
+static std::vector<PropertyInfo> getNodePropertyInfos(NodeTableCatalogEntry* entry) {
+    std::vector<PropertyInfo> infos;
+    auto primaryKeyName = entry->getPrimaryKeyName();
+    for (auto& def : entry->getProperties()) {
+        auto info = getInfo(def);
+        info.propertyID = entry->getPropertyID(def.getName());
+        info.extraInfo = std::make_unique<ExtraNodePropertyInfo>(primaryKeyName == def.getName());
+        infos.push_back(std::move(info));
+    }
+    return infos;
+}
+
+static std::vector<PropertyInfo> getRelPropertyInfos(RelGroupCatalogEntry* entry) {
+    std::vector<PropertyInfo> infos;
+    for (auto& def : entry->getProperties()) {
+        if (def.getName() == InternalKeyword::ID) {
+            continue;
+        }
+        auto info = getInfo(def);
+        info.propertyID = entry->getPropertyID(def.getName());
+        info.extraInfo = std::make_unique<ExtraRelPropertyInfo>(
+            ExtendDirectionUtil::toString(entry->getStorageDirection()));
+        infos.push_back(std::move(info));
+    }
+    return infos;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(const main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    std::vector<std::string> columnNames;
+    std::vector<LogicalType> columnTypes;
+    columnNames.emplace_back("property id");
+    columnTypes.push_back(LogicalType::INT32());
+    columnNames.emplace_back("name");
+    columnTypes.push_back(LogicalType::STRING());
+    columnNames.emplace_back("type");
+    columnTypes.push_back(LogicalType::STRING());
+    columnNames.emplace_back("default expression");
+    columnTypes.push_back(LogicalType::STRING());
+    auto name = common::StringUtils::split(input->getLiteralVal<std::string>(0), ".");
+
+    std::vector<PropertyInfo> infos;
+    CatalogEntryType type = CatalogEntryType::DUMMY_ENTRY;
+    auto transaction = transaction::Transaction::Get(*context);
+    if (name.size() == 1) {
+        auto tableName = name[0];
+        auto catalog = Catalog::Get(*context);
+        if (catalog->containsTable(transaction, tableName)) {
+            auto entry = catalog->getTableCatalogEntry(transaction, tableName);
+            switch (entry->getType()) {
+            case CatalogEntryType::NODE_TABLE_ENTRY: {
+                columnNames.emplace_back("primary key");
+                columnTypes.push_back(LogicalType::BOOL());
+                infos = getNodePropertyInfos(entry->ptrCast<NodeTableCatalogEntry>());
+                type = CatalogEntryType::NODE_TABLE_ENTRY;
+            } break;
+            case CatalogEntryType::REL_GROUP_ENTRY: {
+                columnNames.emplace_back("storage_direction");
+                columnTypes.push_back(LogicalType::STRING());
+                infos = getRelPropertyInfos(entry->ptrCast<RelGroupCatalogEntry>());
+                type = CatalogEntryType::REL_GROUP_ENTRY;
+            } break;
+            default:
+                KU_UNREACHABLE;
+            }
+        } else {
+            throw CatalogException(stringFormat("{} does not exist in catalog.", tableName));
+        }
+    } else {
+        auto dbName = name[0];
+        auto tableName = name[1];
+        auto db = main::DatabaseManager::Get(*context)->getAttachedDatabase(dbName);
+        auto entry = db->getCatalog()->getTableCatalogEntry(transaction, tableName);
+        infos = getForeignPropertyInfos(entry);
+        type = CatalogEntryType::FOREIGN_TABLE_ENTRY;
+    }
+    columnNames = TableFunction::extractYieldVariables(columnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(columnNames, columnTypes);
+    return std::make_unique<TableInfoBindData>(type, std::move(infos), columns);
+}
+
+function_set TableInfoFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    function->tableFunc = SimpleTableFunc::getTableFunc(internalTableFunc);
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = SimpleTableFunc::initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/timestamp/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/timestamp/CMakeLists.txt
new file mode 100644
index 0000000000..a91398b11b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/timestamp/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_timestamp_function
+        OBJECT
+        to_epoch_ms.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_timestamp_function>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/timestamp/to_epoch_ms.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/timestamp/to_epoch_ms.cpp
new file mode 100644
index 0000000000..b75c0abb4c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/timestamp/to_epoch_ms.cpp
@@ -0,0 +1,26 @@
+#include "function/arithmetic/divide.h"
+#include "function/scalar_function.h"
+#include "function/timestamp/vector_timestamp_functions.h"
+
+namespace lbug {
+namespace function {
+
+using namespace lbug::common;
+
+struct ToEpochMs {
+    static void operation(common::timestamp_t& input, int64_t& result) {
+        function::Divide::operation(input.value, Interval::MICROS_PER_MSEC, result);
+    }
+};
+
+function_set ToEpochMsFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::TIMESTAMP}, LogicalTypeID::INT64,
+        ScalarFunction::UnaryExecFunction<timestamp_t, int64_t, ToEpochMs>);
+    functionSet.emplace_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/CMakeLists.txt
new file mode 100644
index 0000000000..2d54ec741a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_function_union
+        OBJECT
+        union_extract_function.cpp
+        union_tag_function.cpp
+        union_value_function.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_union>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/union_extract_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/union_extract_function.cpp
new file mode 100644
index 0000000000..e52af666fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/union_extract_function.cpp
@@ -0,0 +1,22 @@
+#include "function/scalar_function.h"
+#include "function/struct/vector_struct_functions.h"
+#include "function/union/vector_union_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+function_set UnionExtractFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::UNION, LogicalTypeID::STRING},
+        LogicalTypeID::ANY);
+    function->bindFunc = StructExtractFunctions::bindFunc;
+    function->compileFunc = StructExtractFunctions::compileFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/union_tag_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/union_tag_function.cpp
new file mode 100644
index 0000000000..a624629367
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/union_tag_function.cpp
@@ -0,0 +1,25 @@
+#include "function/scalar_function.h"
+#include "function/union/functions/union_tag.h"
+#include "function/union/vector_union_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    return FunctionBindData::getSimpleBindData(input.arguments, LogicalType::STRING());
+}
+
+function_set UnionTagFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::UNION}, LogicalTypeID::STRING,
+        ScalarFunction::UnaryExecNestedTypeFunction<union_entry_t, ku_string_t, UnionTag>);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/union_value_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/union_value_function.cpp
new file mode 100644
index 0000000000..157420c6b5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/union/union_value_function.cpp
@@ -0,0 +1,46 @@
+#include "function/scalar_function.h"
+#include "function/union/vector_union_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    KU_ASSERT(input.arguments.size() == 1);
+    std::vector<StructField> fields;
+    if (input.arguments[0]->getDataType().getLogicalTypeID() == common::LogicalTypeID::ANY) {
+        input.arguments[0]->cast(LogicalType::STRING());
+    }
+    fields.emplace_back(input.arguments[0]->getAlias(), input.arguments[0]->getDataType().copy());
+    auto resultType = LogicalType::UNION(std::move(fields));
+    return FunctionBindData::getSimpleBindData(input.arguments, resultType);
+}
+
+static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>&,
+    const std::vector<common::SelectionVector*>&, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* /*dataPtr*/) {
+    UnionVector::setTagField(result, *resultSelVector, UnionType::TAG_FIELD_IDX);
+}
+
+static void valueCompileFunc(FunctionBindData* /*bindData*/,
+    const std::vector<std::shared_ptr<ValueVector>>& parameters,
+    std::shared_ptr<ValueVector>& result) {
+    KU_ASSERT(parameters.size() == 1);
+    result->setState(parameters[0]->state);
+    UnionVector::getTagVector(result.get())->setState(parameters[0]->state);
+    UnionVector::referenceVector(result.get(), UnionType::TAG_FIELD_IDX, parameters[0]);
+}
+
+function_set UnionValueFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ANY}, LogicalTypeID::UNION, execFunc);
+    function->bindFunc = bindFunc;
+    function->compileFunc = valueCompileFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/CMakeLists.txt
new file mode 100644
index 0000000000..712f692e34
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/CMakeLists.txt
@@ -0,0 +1,14 @@
+add_library(lbug_utility_function
+        OBJECT
+        coalesce.cpp
+        md5.cpp
+        sha256.cpp
+        constant_or_null.cpp
+        count_if.cpp
+        error.cpp
+        nullif.cpp
+        typeof.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_utility_function>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/coalesce.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/coalesce.cpp
new file mode 100644
index 0000000000..146ca347e7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/coalesce.cpp
@@ -0,0 +1,99 @@
+#include "binder/expression/expression_util.h"
+#include "common/exception/binder.h"
+#include "function/scalar_function.h"
+#include "function/utility/vector_utility_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    if (input.arguments.empty()) {
+        throw BinderException("COALESCE requires at least one argument");
+    }
+    LogicalType resultType(LogicalTypeID::ANY);
+    binder::ExpressionUtil::tryCombineDataType(input.arguments, resultType);
+    if (resultType.getLogicalTypeID() == LogicalTypeID::ANY) {
+        resultType = LogicalType::STRING();
+    }
+    auto bindData = std::make_unique<FunctionBindData>(resultType.copy());
+    for (auto& _ : input.arguments) {
+        (void)_;
+        bindData->paramTypes.push_back(resultType.copy());
+    }
+    return bindData;
+}
+
+static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& params,
+    const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* /*dataPtr*/) {
+    result.resetAuxiliaryBuffer();
+    for (auto i = 0u; i < resultSelVector->getSelSize(); ++i) {
+        auto resultPos = (*resultSelVector)[i];
+        auto isNull = true;
+        for (size_t i = 0; i < params.size(); ++i) {
+            const auto& param = *params[i];
+            const auto& paramSelVector = *paramSelVectors[i];
+            auto paramPos = param.state->isFlat() ? paramSelVector[0] : resultPos;
+            if (!param.isNull(paramPos)) {
+                result.copyFromVectorData(resultPos, &param, paramPos);
+                isNull = false;
+                break;
+            }
+        }
+        result.setNull(resultPos, isNull);
+    }
+}
+
+static bool selectFunc(const std::vector<std::shared_ptr<ValueVector>>& params,
+    SelectionVector& selVector, void* /* dataPtr */) {
+    KU_ASSERT(!params.empty());
+    auto unFlatVectorIdx = 0u;
+    for (auto i = 0u; i < params.size(); ++i) {
+        if (!params[i]->state->isFlat()) {
+            unFlatVectorIdx = i;
+            break;
+        }
+    }
+    auto numSelectedValues = 0u;
+    auto selectedPositionsBuffer = selVector.getMutableBuffer();
+    for (auto i = 0u; i < params[unFlatVectorIdx]->state->getSelVector().getSelSize(); ++i) {
+        auto resultPos = params[unFlatVectorIdx]->state->getSelVector()[i];
+        auto resultValue = false;
+        for (auto& param : params) {
+            auto paramPos = param->state->isFlat() ? param->state->getSelVector()[0] : resultPos;
+            if (!param->isNull(paramPos)) {
+                resultValue = param->getValue<bool>(paramPos);
+                break;
+            }
+        }
+        selectedPositionsBuffer[numSelectedValues] = resultPos;
+        numSelectedValues += resultValue;
+    }
+    selVector.setSelSize(numSelectedValues);
+    return numSelectedValues > 0;
+}
+
+function_set CoalesceFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ANY}, LogicalTypeID::ANY, execFunc, selectFunc);
+    function->bindFunc = bindFunc;
+    function->isVarLength = true;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+function_set IfNullFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ANY, LogicalTypeID::ANY}, LogicalTypeID::ANY,
+        execFunc, selectFunc);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/constant_or_null.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/constant_or_null.cpp
new file mode 100644
index 0000000000..28a4dc8bac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/constant_or_null.cpp
@@ -0,0 +1,81 @@
+#include "function/scalar_function.h"
+#include "function/utility/vector_utility_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    logical_type_vec_t paramTypes;
+    for (auto& argument : input.arguments) {
+        if (argument->getDataType().getLogicalTypeID() == LogicalTypeID::ANY) {
+            paramTypes.push_back(LogicalType::STRING());
+        } else {
+            paramTypes.push_back(argument->getDataType().copy());
+        }
+    }
+    auto bindData = std::make_unique<FunctionBindData>(paramTypes[0].copy());
+    bindData->paramTypes = std::move(paramTypes);
+    return bindData;
+}
+
+static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& params,
+    const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* /*dataPtr*/) {
+    KU_ASSERT(params.size() == 2);
+    result.resetAuxiliaryBuffer();
+    for (auto i = 0u; i < resultSelVector->getSelSize(); ++i) {
+        auto resultPos = (*resultSelVector)[i];
+        auto firstParamPos = params[0]->state->isFlat() ? (*paramSelVectors[0])[0] : resultPos;
+        auto secondParamPos = params[1]->state->isFlat() ? (*paramSelVectors[1])[0] : resultPos;
+        if (params[1]->isNull(secondParamPos) || params[0]->isNull(firstParamPos)) {
+            result.setNull(resultPos, true);
+        } else {
+            result.setNull(resultPos, false);
+            result.copyFromVectorData(resultPos, params[0].get(), firstParamPos);
+        }
+    }
+}
+
+static bool selectFunc(const std::vector<std::shared_ptr<ValueVector>>& params,
+    SelectionVector& selVector, void* /* dataPtr */) {
+    KU_ASSERT(params.size() == 2);
+    auto unFlatVectorIdx = 0u;
+    for (auto i = 0u; i < params.size(); ++i) {
+        if (!params[i]->state->isFlat()) {
+            unFlatVectorIdx = i;
+            break;
+        }
+    }
+    auto numSelectedValues = 0u;
+    auto selectedPositionsBuffer = selVector.getMutableBuffer();
+    for (auto i = 0u; i < params[unFlatVectorIdx]->state->getSelVector().getSelSize(); ++i) {
+        auto resultPos = params[unFlatVectorIdx]->state->getSelVector()[i];
+        auto resultValue = false;
+        auto firstParamPos =
+            params[0]->state->isFlat() ? params[0]->state->getSelVector()[0] : resultPos;
+        auto secondParamPos =
+            params[1]->state->isFlat() ? params[1]->state->getSelVector()[0] : resultPos;
+        if (!params[1]->isNull(secondParamPos) && !params[0]->isNull(firstParamPos)) {
+            resultValue = params[0]->getValue<bool>(firstParamPos);
+        }
+        selectedPositionsBuffer[numSelectedValues] = resultPos;
+        numSelectedValues += resultValue;
+    }
+    selVector.setSelSize(numSelectedValues);
+    return numSelectedValues > 0;
+}
+
+function_set ConstantOrNullFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ANY, LogicalTypeID::ANY}, LogicalTypeID::ANY,
+        execFunc, selectFunc);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/count_if.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/count_if.cpp
new file mode 100644
index 0000000000..22463f95b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/count_if.cpp
@@ -0,0 +1,41 @@
+#include "common/type_utils.h"
+#include "function/scalar_function.h"
+#include "function/utility/vector_utility_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct CountIf {
+    template<class T>
+    static inline void operation(T& input, uint8_t& result) {
+        if (input != 0) {
+            result = 1;
+        } else {
+            result = 0;
+        }
+    }
+};
+
+function_set CountIfFunction::getFunctionSet() {
+    function_set functionSet;
+    auto operandTypeIDs = LogicalTypeUtils::getNumericalLogicalTypeIDs();
+    operandTypeIDs.push_back(LogicalTypeID::BOOL);
+    scalar_func_exec_t execFunc;
+    for (auto operandTypeID : operandTypeIDs) {
+        TypeUtils::visit(
+            LogicalType(operandTypeID),
+            [&execFunc]<NumericTypes T>(
+                T) { execFunc = ScalarFunction::UnaryExecFunction<T, uint8_t, CountIf>; },
+            [&execFunc](
+                bool) { execFunc = ScalarFunction::UnaryExecFunction<bool, uint8_t, CountIf>; },
+            [](auto) { KU_UNREACHABLE; });
+        functionSet.push_back(std::make_unique<ScalarFunction>(name,
+            std::vector<LogicalTypeID>{operandTypeID}, LogicalTypeID::UINT8, execFunc));
+    }
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/error.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/error.cpp
new file mode 100644
index 0000000000..5ac7b6f039
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/error.cpp
@@ -0,0 +1,28 @@
+#include "common/exception/runtime.h"
+#include "function/scalar_function.h"
+#include "function/utility/vector_utility_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct Error {
+    static void operation(ku_string_t& input, int32_t& result) {
+        result = 0;
+        throw RuntimeException(input.getAsString());
+    }
+};
+
+function_set ErrorFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.push_back(
+        std::make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::STRING},
+            LogicalTypeID::INT32, ScalarFunction::UnaryExecFunction<ku_string_t, int32_t, Error>));
+    // int32_t is just a dummy resultType for error(), since this function throws an exception
+    // instead of returns any result
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/md5.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/md5.cpp
new file mode 100644
index 0000000000..7d1c334162
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/md5.cpp
@@ -0,0 +1,28 @@
+#include "common/md5.h"
+
+#include "function/hash/vector_hash_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct MD5Operator {
+    static void operation(ku_string_t& operand, ku_string_t& result, ValueVector& resultVector) {
+        MD5 hasher;
+        hasher.addToMD5(reinterpret_cast<const char*>(operand.getData()), operand.len);
+        StringVector::addString(&resultVector, result, std::string(hasher.finishMD5()));
+    }
+};
+
+function_set MD5Function::getFunctionSet() {
+    function_set functionSet;
+    functionSet.push_back(std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING}, LogicalTypeID::STRING,
+        ScalarFunction::UnaryStringExecFunction<ku_string_t, ku_string_t, MD5Operator>));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/nullif.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/nullif.cpp
new file mode 100644
index 0000000000..8021d7bdda
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/nullif.cpp
@@ -0,0 +1,38 @@
+#include "binder/expression/case_expression.h"
+#include "binder/expression/scalar_function_expression.h"
+#include "binder/expression_binder.h"
+#include "function/rewrite_function.h"
+#include "function/utility/vector_utility_functions.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::shared_ptr<Expression> rewriteFunc(const RewriteFunctionBindInput& input) {
+    KU_ASSERT(input.arguments.size() == 2);
+    auto uniqueExpressionName =
+        ScalarFunctionExpression::getUniqueName(NullIfFunction::name, input.arguments);
+    const auto& resultType = input.arguments[0]->getDataType();
+    auto caseExpression = std::make_shared<CaseExpression>(resultType.copy(), input.arguments[0],
+        uniqueExpressionName);
+    auto binder = input.expressionBinder;
+    auto whenExpression = binder->bindComparisonExpression(ExpressionType::EQUALS, input.arguments);
+    auto thenExpression = binder->createNullLiteralExpression();
+    thenExpression = binder->implicitCastIfNecessary(thenExpression, resultType.copy());
+    caseExpression->addCaseAlternative(whenExpression, thenExpression);
+    return caseExpression;
+}
+
+function_set NullIfFunction::getFunctionSet() {
+    function_set functionSet;
+    for (auto typeID : LogicalTypeUtils::getAllValidLogicTypeIDs()) {
+        functionSet.push_back(std::make_unique<RewriteFunction>(name,
+            std::vector<LogicalTypeID>{typeID, typeID}, rewriteFunc));
+    }
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/sha256.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/sha256.cpp
new file mode 100644
index 0000000000..a5b293a08e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/sha256.cpp
@@ -0,0 +1,32 @@
+#include "common/sha256.h"
+
+#include "function/hash/vector_hash_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct SHA256Operator {
+    static void operation(ku_string_t& operand, ku_string_t& result, ValueVector& resultVector) {
+        StringVector::reserveString(&resultVector, result, SHA256::SHA256_HASH_LENGTH_TEXT);
+        SHA256 hasher;
+        hasher.addString(operand.getAsString());
+        hasher.finishSHA256(reinterpret_cast<char*>(result.getDataUnsafe()));
+        if (!ku_string_t::isShortString(result.len)) {
+            memcpy(result.prefix, result.getData(), ku_string_t::PREFIX_LENGTH);
+        }
+    }
+};
+
+function_set SHA256Function::getFunctionSet() {
+    function_set functionSet;
+    functionSet.push_back(std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING}, LogicalTypeID::STRING,
+        ScalarFunction::UnaryStringExecFunction<ku_string_t, ku_string_t, SHA256Operator>));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/typeof.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/typeof.cpp
new file mode 100644
index 0000000000..a3d7747d84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/utility/typeof.cpp
@@ -0,0 +1,43 @@
+#include "function/scalar_function.h"
+#include "function/utility/function_string_bind_data.h"
+#include "function/utility/vector_utility_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input) {
+    std::unique_ptr<FunctionBindData> bindData;
+    if (input.arguments[0]->getDataType().getLogicalTypeID() == LogicalTypeID::ANY) {
+        bindData = std::make_unique<FunctionStringBindData>("NULL");
+        bindData->paramTypes.push_back(LogicalType::STRING());
+    } else {
+        bindData =
+            std::make_unique<FunctionStringBindData>(input.arguments[0]->getDataType().toString());
+    }
+    return bindData;
+}
+
+static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>&,
+    const std::vector<common::SelectionVector*>&, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* dataPtr) {
+    result.resetAuxiliaryBuffer();
+    auto typeData = reinterpret_cast<FunctionStringBindData*>(dataPtr);
+    for (auto i = 0u; i < resultSelVector->getSelSize(); ++i) {
+        auto resultPos = (*resultSelVector)[i];
+        StringVector::addString(&result, resultPos, typeData->str);
+    }
+}
+
+function_set TypeOfFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ANY}, LogicalTypeID::STRING, execFunc);
+    function->bindFunc = bindFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/uuid/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/function/uuid/CMakeLists.txt
new file mode 100644
index 0000000000..be61343925
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/uuid/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_function_uuid
+        OBJECT
+        gen_random_uuid.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_function_uuid>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/uuid/gen_random_uuid.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/uuid/gen_random_uuid.cpp
new file mode 100644
index 0000000000..2dd0cbb481
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/uuid/gen_random_uuid.cpp
@@ -0,0 +1,15 @@
+#include "function/uuid/functions/gen_random_uuid.h"
+
+#include "common/random_engine.h"
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+void GenRandomUUID::operation(common::ku_uuid_t& input, void* dataPtr) {
+    auto clientContext = static_cast<FunctionBindData*>(dataPtr)->clientContext;
+    input = common::UUID::generateRandomUUID(common::RandomEngine::Get(*clientContext));
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_arithmetic_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_arithmetic_functions.cpp
new file mode 100644
index 0000000000..b5c3b9993e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_arithmetic_functions.cpp
@@ -0,0 +1,875 @@
+#include "function/arithmetic/vector_arithmetic_functions.h"
+
+#include "common/exception/overflow.h"
+#include "common/exception/runtime.h"
+#include "common/type_utils.h"
+#include "common/types/date_t.h"
+#include "common/types/int128_t.h"
+#include "common/types/interval_t.h"
+#include "common/types/timestamp_t.h"
+#include "function/arithmetic/abs.h"
+#include "function/arithmetic/add.h"
+#include "function/arithmetic/arithmetic_functions.h"
+#include "function/arithmetic/divide.h"
+#include "function/arithmetic/modulo.h"
+#include "function/arithmetic/multiply.h"
+#include "function/arithmetic/negate.h"
+#include "function/arithmetic/subtract.h"
+#include "function/cast/functions/numeric_limits.h"
+#include "function/list/functions/list_concat_function.h"
+#include "function/list/vector_list_functions.h"
+#include "function/scalar_function.h"
+#include "function/string/vector_string_functions.h"
+
+using namespace lbug::common;
+using std::max;
+using std::min;
+
+namespace lbug {
+namespace function {
+
+struct DecimalFunction {
+
+    static std::unique_ptr<FunctionBindData> bindAddFunc(ScalarBindFuncInput input);
+
+    static std::unique_ptr<FunctionBindData> bindSubtractFunc(ScalarBindFuncInput input);
+
+    static std::unique_ptr<FunctionBindData> bindMultiplyFunc(ScalarBindFuncInput input);
+
+    static std::unique_ptr<FunctionBindData> bindDivideFunc(ScalarBindFuncInput input);
+
+    static std::unique_ptr<FunctionBindData> bindModuloFunc(ScalarBindFuncInput input);
+
+    static std::unique_ptr<FunctionBindData> bindNegateFunc(ScalarBindFuncInput input);
+
+    static std::unique_ptr<FunctionBindData> bindAbsFunc(ScalarBindFuncInput input);
+
+    static std::unique_ptr<FunctionBindData> bindFloorFunc(ScalarBindFuncInput input);
+
+    static std::unique_ptr<FunctionBindData> bindCeilFunc(ScalarBindFuncInput input);
+};
+
+template<typename FUNC>
+static std::unique_ptr<ScalarFunction> getUnaryFunction(std::string name,
+    LogicalTypeID operandTypeID) {
+    function::scalar_func_exec_t execFunc;
+    common::TypeUtils::visit(
+        LogicalType(operandTypeID),
+        [&]<NumericTypes T>(T) { execFunc = ScalarFunction::UnaryExecFunction<T, T, FUNC>; },
+        [](auto) { KU_UNREACHABLE; });
+    return std::make_unique<ScalarFunction>(std::move(name),
+        std::vector<LogicalTypeID>{operandTypeID}, operandTypeID, execFunc);
+}
+
+template<typename FUNC, typename OPERAND_TYPE, typename RETURN_TYPE = OPERAND_TYPE>
+static std::unique_ptr<ScalarFunction> getUnaryFunction(std::string name,
+    LogicalTypeID operandTypeID, LogicalTypeID resultTypeID) {
+    return std::make_unique<ScalarFunction>(std::move(name),
+        std::vector<LogicalTypeID>{operandTypeID}, resultTypeID,
+        ScalarFunction::UnaryExecFunction<OPERAND_TYPE, RETURN_TYPE, FUNC>);
+}
+
+template<typename FUNC>
+static std::unique_ptr<ScalarFunction> getBinaryFunction(std::string name,
+    common::LogicalTypeID operandTypeID) {
+    function::scalar_func_exec_t execFunc;
+    common::TypeUtils::visit(
+        common::LogicalType(operandTypeID),
+        [&]<common::NumericTypes T>(
+            T) { execFunc = ScalarFunction::BinaryExecFunction<T, T, T, FUNC>; },
+        [](auto) { KU_UNREACHABLE; });
+    return std::make_unique<ScalarFunction>(std::move(name),
+        std::vector<common::LogicalTypeID>{operandTypeID, operandTypeID}, operandTypeID, execFunc);
+}
+
+template<typename FUNC, typename OPERAND_TYPE, typename RETURN_TYPE = OPERAND_TYPE>
+static std::unique_ptr<ScalarFunction> getBinaryFunction(std::string name,
+    LogicalTypeID operandTypeID, LogicalTypeID resultTypeID) {
+    return std::make_unique<ScalarFunction>(std::move(name),
+        std::vector<LogicalTypeID>{operandTypeID, operandTypeID}, resultTypeID,
+        ScalarFunction::BinaryExecFunction<OPERAND_TYPE, OPERAND_TYPE, RETURN_TYPE, FUNC>);
+}
+
+function_set AddFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(getBinaryFunction<Add>(name, typeID));
+    }
+
+    // decimal + decimal -> decimal
+    std::unique_ptr<ScalarFunction> func;
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL, LogicalTypeID::DECIMAL},
+        LogicalTypeID::DECIMAL);
+    func->bindFunc = DecimalFunction::bindAddFunc;
+    result.push_back(std::move(func));
+    // list + list -> list
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::LIST, LogicalTypeID::LIST}, LogicalTypeID::LIST,
+        ScalarFunction::BinaryExecListStructFunction<list_entry_t, list_entry_t, list_entry_t,
+            ListConcat>);
+    func->bindFunc = ListConcatFunction::bindFunc;
+    result.push_back(std::move(func));
+    // string + string -> string
+    result.push_back(std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::STRING, ConcatFunction::execFunc));
+    // interval + interval → interval
+    result.push_back(getBinaryFunction<Add, interval_t, interval_t>(name, LogicalTypeID::INTERVAL,
+        LogicalTypeID::INTERVAL));
+    // date + int → date
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DATE, LogicalTypeID::INT64}, LogicalTypeID::DATE,
+        ScalarFunction::BinaryExecFunction<date_t, int64_t, date_t, Add>));
+    // int + date → date
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::INT64, LogicalTypeID::DATE}, LogicalTypeID::DATE,
+        ScalarFunction::BinaryExecFunction<int64_t, date_t, date_t, Add>));
+    // date + interval → date
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DATE, LogicalTypeID::INTERVAL},
+        LogicalTypeID::DATE, ScalarFunction::BinaryExecFunction<date_t, interval_t, date_t, Add>));
+    // interval + date → date
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::INTERVAL, LogicalTypeID::DATE},
+        LogicalTypeID::DATE, ScalarFunction::BinaryExecFunction<interval_t, date_t, date_t, Add>));
+    // timestamp + interval → timestamp
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::TIMESTAMP, LogicalTypeID::INTERVAL},
+        LogicalTypeID::TIMESTAMP,
+        ScalarFunction::BinaryExecFunction<timestamp_t, interval_t, timestamp_t, Add>));
+    // interval + timestamp → timestamp
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::INTERVAL, LogicalTypeID::TIMESTAMP},
+        LogicalTypeID::TIMESTAMP,
+        ScalarFunction::BinaryExecFunction<interval_t, timestamp_t, timestamp_t, Add>));
+    return result;
+}
+
+function_set SubtractFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(getBinaryFunction<Subtract>(name, typeID));
+    }
+    // decimal - decimal -> decimal
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL, LogicalTypeID::DECIMAL},
+        LogicalTypeID::DECIMAL);
+    func->bindFunc = DecimalFunction::bindSubtractFunc;
+    result.push_back(std::move(func));
+    // date - date → int64
+    result.push_back(getBinaryFunction<Subtract, date_t, int64_t>(name, LogicalTypeID::DATE,
+        LogicalTypeID::INT64));
+    // date - integer → date
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DATE, LogicalTypeID::INT64}, LogicalTypeID::DATE,
+        ScalarFunction::BinaryExecFunction<date_t, int64_t, date_t, Subtract>));
+    // date - interval → date
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DATE, LogicalTypeID::INTERVAL},
+        LogicalTypeID::DATE,
+        ScalarFunction::BinaryExecFunction<date_t, interval_t, date_t, Subtract>));
+    // timestamp - timestamp → interval
+    result.push_back(getBinaryFunction<Subtract, timestamp_t, interval_t>(name,
+        LogicalTypeID::TIMESTAMP, LogicalTypeID::INTERVAL));
+    // timestamp - interval → timestamp
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::TIMESTAMP, LogicalTypeID::INTERVAL},
+        LogicalTypeID::TIMESTAMP,
+        ScalarFunction::BinaryExecFunction<timestamp_t, interval_t, timestamp_t, Subtract>));
+    // interval - interval → interval
+    result.push_back(getBinaryFunction<Subtract, interval_t, interval_t>(name,
+        LogicalTypeID::INTERVAL, LogicalTypeID::INTERVAL));
+    return result;
+}
+
+function_set MultiplyFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(getBinaryFunction<Multiply>(name, typeID));
+    }
+    // decimal * decimal -> decimal
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL, LogicalTypeID::DECIMAL},
+        LogicalTypeID::DECIMAL);
+    func->bindFunc = DecimalFunction::bindMultiplyFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+function_set DivideFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(getBinaryFunction<Divide>(name, typeID));
+    }
+    // interval / int → interval
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::INTERVAL, LogicalTypeID::INT64},
+        LogicalTypeID::INTERVAL,
+        ScalarFunction::BinaryExecFunction<interval_t, int64_t, interval_t, Divide>));
+    // decimal / decimal -> decimal
+    // drop to double division for now
+    // result.push_back(make_unique<ScalarFunction>(name,
+    // std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL, LogicalTypeID::DECIMAL},
+    // LogicalTypeID::DECIMAL, nullptr, nullptr, DecimalFunction::bindDivideFunc));
+    return result;
+}
+
+function_set ModuloFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(getBinaryFunction<Modulo>(name, typeID));
+    }
+    // decimal % decimal -> decimal
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL, LogicalTypeID::DECIMAL},
+        LogicalTypeID::DECIMAL);
+    func->bindFunc = DecimalFunction::bindModuloFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+function_set PowerFunction::getFunctionSet() {
+    function_set result;
+    // double ^ double -> double
+    result.push_back(
+        getBinaryFunction<Power, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set NegateFunction::getFunctionSet() {
+    function_set result;
+    for (auto& typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(getUnaryFunction<Negate>(name, typeID));
+    }
+    // floor(decimal) -> decimal
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL}, LogicalTypeID::DECIMAL);
+    func->bindFunc = DecimalFunction::bindNegateFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+function_set AbsFunction::getFunctionSet() {
+    function_set result;
+    for (auto& typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(getUnaryFunction<Abs>(name, typeID));
+    }
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL}, LogicalTypeID::DECIMAL);
+    func->bindFunc = DecimalFunction::bindAbsFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+function_set FloorFunction::getFunctionSet() {
+    function_set result;
+    for (auto& typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(getUnaryFunction<Floor>(name, typeID));
+    }
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL}, LogicalTypeID::DECIMAL);
+    func->bindFunc = DecimalFunction::bindFloorFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+function_set CeilFunction::getFunctionSet() {
+    function_set result;
+    for (auto& typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(getUnaryFunction<Ceil>(name, typeID));
+    }
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL}, LogicalTypeID::DECIMAL);
+    func->bindFunc = DecimalFunction::bindCeilFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+function_set SinFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Sin, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set CosFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Cos, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set TanFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Tan, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set CotFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Cot, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set AsinFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Asin, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set AcosFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Acos, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set AtanFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Atan, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set FactorialFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::INT64},
+            LogicalTypeID::INT64, ScalarFunction::UnaryExecFunction<int64_t, int64_t, Factorial>));
+    return result;
+}
+
+function_set SqrtFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Sqrt, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set CbrtFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Cbrt, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set GammaFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Gamma, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set LgammaFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Lgamma, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set LnFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Ln, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set LogFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Log, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set Log2Function::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Log2, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set DegreesFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Degrees, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set RadiansFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Radians, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set EvenFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Even, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set SignFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getUnaryFunction<Sign, int64_t>(name, LogicalTypeID::INT64, LogicalTypeID::INT64));
+    result.push_back(
+        getUnaryFunction<Sign, int64_t>(name, LogicalTypeID::DOUBLE, LogicalTypeID::INT64));
+    result.push_back(
+        getUnaryFunction<Sign, int64_t>(name, LogicalTypeID::FLOAT, LogicalTypeID::INT64));
+    return result;
+}
+
+function_set Atan2Function::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getBinaryFunction<Atan2, double>(name, LogicalTypeID::DOUBLE, LogicalTypeID::DOUBLE));
+    return result;
+}
+
+function_set RoundFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DOUBLE, LogicalTypeID::INT64},
+        LogicalTypeID::DOUBLE, ScalarFunction::BinaryExecFunction<double, int64_t, double, Round>));
+    return result;
+}
+
+function_set BitwiseXorFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getBinaryFunction<BitwiseXor, int64_t>(name, LogicalTypeID::INT64, LogicalTypeID::INT64));
+    return result;
+}
+
+function_set BitwiseAndFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getBinaryFunction<BitwiseAnd, int64_t>(name, LogicalTypeID::INT64, LogicalTypeID::INT64));
+    return result;
+}
+
+function_set BitwiseOrFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getBinaryFunction<BitwiseOr, int64_t>(name, LogicalTypeID::INT64, LogicalTypeID::INT64));
+    return result;
+}
+
+function_set BitShiftLeftFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        getBinaryFunction<BitShiftLeft, int64_t>(name, LogicalTypeID::INT64, LogicalTypeID::INT64));
+    return result;
+}
+
+function_set BitShiftRightFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(getBinaryFunction<BitShiftRight, int64_t>(name, LogicalTypeID::INT64,
+        LogicalTypeID::INT64));
+    return result;
+}
+
+function_set PiFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{},
+        LogicalTypeID::DOUBLE, ScalarFunction::NullaryExecFunction<double, Pi>));
+    return result;
+}
+
+using param_get_func_t = std::function<std::pair<int, int>(int, int, int, int)>;
+
+// Following param func rules are from
+// https://learn.microsoft.com/en-us/sql/t-sql/data-types/precision-scale-and-length-transact-sql
+// todo: Figure out which param rules we should use
+
+struct DecimalAdd {
+    static constexpr bool matchToOutputLogicalType = true;
+    // whether or not the input and output logical types
+    // are expected to be equivalent. If so, the bind function
+    // should specify that the input be casted to the output type before execution
+    template<typename A, typename B, typename R>
+    static inline void operation(A& left, B& right, R& result,
+        common::ValueVector& resultValueVector) {
+        constexpr auto pow10s = pow10Sequence<R>();
+        auto precision = DecimalType::getPrecision(resultValueVector.dataType);
+        if ((right > 0 && pow10s[precision] - right <= left) ||
+            (right < 0 && -pow10s[precision] - right >= left)) {
+            throw OverflowException("Decimal Addition result is out of range");
+        }
+        result = left + right;
+    }
+
+    static std::pair<int, int> resultingParams(int p1, int p2, int s1, int s2) {
+        auto p = min(DECIMAL_PRECISION_LIMIT, max(s1, s2) + max(p1 - s1, p2 - s2) + 1);
+        auto s = min(p, max(s1, s2));
+        if (max(p1 - s1, p2 - s2) < min(DECIMAL_PRECISION_LIMIT, p) - s) {
+            s = min(p, DECIMAL_PRECISION_LIMIT) - max(p1 - s1, p2 - s2);
+        }
+        return {p, s};
+    }
+};
+
+struct DecimalSubtract {
+    static constexpr bool matchToOutputLogicalType = true;
+    template<typename A, typename B, typename R>
+    static inline void operation(A& left, B& right, R& result,
+        common::ValueVector& resultValueVector) {
+        constexpr auto pow10s = pow10Sequence<R>();
+        auto precision = DecimalType::getPrecision(resultValueVector.dataType);
+        if ((right > 0 && -pow10s[precision] + right >= left) ||
+            (right < 0 && pow10s[precision] + right <= left)) {
+            throw OverflowException("Decimal Subtraction result is out of range");
+        }
+        result = left - right;
+    }
+
+    static std::pair<int, int> resultingParams(int p1, int p2, int s1, int s2) {
+        auto p = min(DECIMAL_PRECISION_LIMIT, max(s1, s2) + max(p1 - s1, p2 - s2) + 1);
+        auto s = min(p, max(s1, s2));
+        if (max(p1 - s1, p2 - s2) < min(DECIMAL_PRECISION_LIMIT, p) - s) {
+            s = min(p, DECIMAL_PRECISION_LIMIT) - max(p1 - s1, p2 - s2);
+        }
+        return {p, s};
+    }
+};
+
+struct DecimalMultiply {
+    static constexpr bool matchToOutputLogicalType = false;
+    template<typename A, typename B, typename R>
+    static inline void operation(A& left, B& right, R& result,
+        common::ValueVector& resultValueVector) {
+        constexpr auto pow10s = pow10Sequence<R>();
+        auto precision = DecimalType::getPrecision(resultValueVector.dataType);
+        result = (R)left * (R)right;
+        // no need to divide by any scale given resultingParams and matchToOutput
+        if (result <= -pow10s[precision] || result >= pow10s[precision]) {
+            [[unlikely]] throw OverflowException("Decimal Multiplication Result is out of range");
+        }
+    }
+
+    static std::pair<int, int> resultingParams(int p1, int p2, int s1, int s2) {
+        if (p1 + p2 + 1 > DECIMAL_PRECISION_LIMIT) {
+            throw OverflowException(
+                "Resulting precision of decimal multiplication greater than 38");
+        }
+        auto p = p1 + p2 + 1;
+        auto s = s1 + s2;
+        return {p, s};
+    }
+};
+
+struct DecimalDivide {
+    static constexpr bool matchToOutputLogicalType = true;
+    template<typename A, typename B, typename R>
+    static inline void operation(A& left, B& right, R& result,
+        common::ValueVector& resultValueVector) {
+        constexpr auto pow10s = pow10Sequence<R>();
+        auto precision = DecimalType::getPrecision(resultValueVector.dataType);
+        auto scale = DecimalType::getScale(resultValueVector.dataType);
+        if (right == 0) {
+            throw RuntimeException("Divide by zero.");
+        }
+        if (-pow10s[precision - scale] >= left || pow10s[precision - scale] <= left) {
+            throw OverflowException("Overflow encountered when attempting to divide decimals");
+            // happens too often; let's just drop to double division for now, which is in line with
+            // what DuckDB does right now
+        }
+        result = (left * pow10s[scale]) / right;
+    }
+
+    static std::pair<int, int> resultingParams(int p1, int p2, int s1, int s2) {
+        auto p = min(DECIMAL_PRECISION_LIMIT, p1 - s1 + s2 + max(6, s1 + p2 + 1));
+        auto s = min(p, max(6, s1 + p2 + 1)); // todo: complete rules
+        return {p, s};
+    }
+};
+
+struct DecimalModulo {
+    static constexpr bool matchToOutputLogicalType = true;
+    template<typename A, typename B, typename R>
+    static inline void operation(A& left, B& right, R& result, common::ValueVector&) {
+        if (right == 0) {
+            throw RuntimeException("Modulo by zero.");
+        }
+        result = left % right;
+    }
+
+    static std::pair<int, int> resultingParams(int p1, int p2, int s1, int s2) {
+        auto p = min(DECIMAL_PRECISION_LIMIT, min(p1 - s1, p2 - s2) + max(s1, s2));
+        auto s = min(p, max(s1, s2));
+        return {p, s};
+    }
+};
+
+struct DecimalNegate {
+    static constexpr bool matchToOutputLogicalType = true;
+    template<typename A, typename R>
+    static inline void operation(A& input, R& result, common::ValueVector&, common::ValueVector&) {
+        result = -input;
+    }
+
+    static std::pair<int, int> resultingParams(int p, int s) { return {p, s}; }
+};
+
+struct DecimalAbs {
+    static constexpr bool matchToOutputLogicalType = true;
+    template<typename A, typename R>
+    static inline void operation(A& input, R& result, common::ValueVector&, common::ValueVector&) {
+        result = input;
+        if (result < 0) {
+            result = -result;
+        }
+    }
+
+    static std::pair<int, int> resultingParams(int p, int s) { return {p, s}; }
+};
+
+struct DecimalFloor {
+    static constexpr bool matchToOutputLogicalType = false;
+    template<typename A, typename R>
+    static inline void operation(A& input, R& result, common::ValueVector& inputVector,
+        common::ValueVector&) {
+        constexpr auto pow10s = pow10Sequence<R>();
+        auto scale = DecimalType::getScale(inputVector.dataType);
+        if (input < 0) {
+            // round to larger absolute value
+            result = (R)input -
+                     (input % pow10s[scale] == 0 ? 0 : pow10s[scale] + (R)(input % pow10s[scale]));
+        } else {
+            // round to smaller absolute value
+            result = (R)input - (R)(input % pow10s[scale]);
+        }
+        result = result / pow10s[scale];
+    }
+
+    static std::pair<int, int> resultingParams(int p, int) { return {p, 0}; }
+};
+
+struct DecimalCeil {
+    static constexpr bool matchToOutputLogicalType = false;
+    template<typename A, typename R>
+    static inline void operation(A& input, R& result, common::ValueVector& inputVector,
+        common::ValueVector&) {
+        constexpr auto pow10s = pow10Sequence<R>();
+        auto scale = DecimalType::getScale(inputVector.dataType);
+        if (input < 0) {
+            // round to larger absolute value
+            result = (R)input - (R)(input % pow10s[scale]);
+        } else {
+            // round to smaller absolute value
+            result = (R)input +
+                     (input % pow10s[scale] == 0 ? 0 : pow10s[scale] - (R)(input % pow10s[scale]));
+        }
+        result = result / pow10s[scale];
+    }
+
+    static std::pair<int, int> resultingParams(int p, int) { return {p, 0}; }
+};
+
+template<typename FUNC, typename A, typename B>
+static void getBinaryExecutionHelperB(const LogicalType& typeR, scalar_func_exec_t& result) {
+    // here to assist in getting scalar_func_exec_t for genericBinaryArithmeticFunc
+    switch (typeR.getPhysicalType()) {
+    case PhysicalTypeID::INT16:
+        result = ScalarFunction::BinaryStringExecFunction<A, B, int16_t, FUNC>;
+        break;
+    case PhysicalTypeID::INT32:
+        result = ScalarFunction::BinaryStringExecFunction<A, B, int32_t, FUNC>;
+        break;
+    case PhysicalTypeID::INT64:
+        result = ScalarFunction::BinaryStringExecFunction<A, B, int64_t, FUNC>;
+        break;
+    case PhysicalTypeID::INT128:
+        result = ScalarFunction::BinaryStringExecFunction<A, B, int128_t, FUNC>;
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+template<typename FUNC, typename A>
+static void getBinaryExecutionHelperA(const LogicalType& typeB, const LogicalType& typeR,
+    scalar_func_exec_t& result) {
+    // here to assist in getting scalar_func_exec_t for genericBinaryArithmeticFunc
+    switch (typeB.getPhysicalType()) {
+    case PhysicalTypeID::INT16:
+        getBinaryExecutionHelperB<FUNC, A, int16_t>(typeR, result);
+        break;
+    case PhysicalTypeID::INT32:
+        getBinaryExecutionHelperB<FUNC, A, int32_t>(typeR, result);
+        break;
+    case PhysicalTypeID::INT64:
+        getBinaryExecutionHelperB<FUNC, A, int64_t>(typeR, result);
+        break;
+    case PhysicalTypeID::INT128:
+        getBinaryExecutionHelperB<FUNC, A, int128_t>(typeR, result);
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+template<typename FUNC>
+static std::unique_ptr<FunctionBindData> genericBinaryArithmeticFunc(
+    const binder::expression_vector& arguments, Function* func) {
+    auto asScalar = ku_dynamic_cast<ScalarFunction*>(func);
+    KU_ASSERT(asScalar != nullptr);
+    auto argADataType = arguments[0]->getDataType().copy();
+    auto argBDataType = arguments[1]->getDataType().copy();
+    if (argADataType.getLogicalTypeID() != LogicalTypeID::DECIMAL) {
+        argADataType = argBDataType.copy();
+    }
+    if (argBDataType.getLogicalTypeID() != LogicalTypeID::DECIMAL) {
+        argBDataType = argADataType.copy();
+    }
+    auto precision1 = DecimalType::getPrecision(argADataType);
+    auto precision2 = DecimalType::getPrecision(argBDataType);
+    auto scale1 = DecimalType::getScale(argADataType);
+    auto scale2 = DecimalType::getScale(argBDataType);
+    auto params = FUNC::resultingParams(precision1, precision2, scale1, scale2);
+    auto resultingType = LogicalType::DECIMAL(params.first, params.second);
+    auto argumentAType =
+        FUNC::matchToOutputLogicalType ? resultingType.copy() : argADataType.copy();
+    auto argumentBType =
+        FUNC::matchToOutputLogicalType ? resultingType.copy() : argBDataType.copy();
+    if constexpr (FUNC::matchToOutputLogicalType) {
+        common::TypeUtils::visit(
+            resultingType.getPhysicalType(),
+            [&]<IntegerTypes T>(T) {
+                asScalar->execFunc = ScalarFunction::BinaryStringExecFunction<T, T, T, FUNC>;
+            },
+            [](auto) { KU_UNREACHABLE; });
+    } else {
+        common::TypeUtils::visit(
+            argumentAType.getPhysicalType(),
+            [&]<IntegerTypes T>(T) {
+                getBinaryExecutionHelperA<FUNC, T>(argumentBType, resultingType,
+                    asScalar->execFunc);
+            },
+            [](auto) { KU_UNREACHABLE; });
+    }
+    std::vector<LogicalType> resVec;
+    resVec.push_back(std::move(argumentAType));
+    resVec.push_back(std::move(argumentBType));
+    resVec.push_back(resultingType.copy());
+    return std::make_unique<FunctionBindData>(std::move(resVec), std::move(resultingType));
+}
+
+template<typename FUNC, typename ARG>
+static void getUnaryExecutionHelper(const LogicalType& resultType, scalar_func_exec_t& result) {
+    switch (resultType.getPhysicalType()) {
+    case PhysicalTypeID::INT16:
+        result = ScalarFunction::UnaryExecNestedTypeFunction<ARG, int16_t, FUNC>;
+        break;
+    case PhysicalTypeID::INT32:
+        result = ScalarFunction::UnaryExecNestedTypeFunction<ARG, int32_t, FUNC>;
+        break;
+    case PhysicalTypeID::INT64:
+        result = ScalarFunction::UnaryExecNestedTypeFunction<ARG, int64_t, FUNC>;
+        break;
+    case PhysicalTypeID::INT128:
+        result = ScalarFunction::UnaryExecNestedTypeFunction<ARG, int128_t, FUNC>;
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+template<typename FUNC>
+static std::unique_ptr<FunctionBindData> genericUnaryArithmeticFunc(
+    const binder::expression_vector& arguments, Function* func) {
+    auto asScalar = ku_dynamic_cast<ScalarFunction*>(func);
+    KU_ASSERT(asScalar != nullptr);
+    auto argPrecision = DecimalType::getPrecision(arguments[0]->getDataType());
+    auto argScale = DecimalType::getScale(arguments[0]->getDataType());
+    auto params = FUNC::resultingParams(argPrecision, argScale);
+    auto resultingType = LogicalType::DECIMAL(params.first, params.second);
+    auto argumentType =
+        FUNC::matchToOutputLogicalType ? resultingType.copy() : arguments[0]->getDataType().copy();
+    if constexpr (FUNC::matchToOutputLogicalType) {
+        switch (resultingType.getPhysicalType()) {
+        case PhysicalTypeID::INT16:
+            asScalar->execFunc =
+                ScalarFunction::UnaryExecNestedTypeFunction<int16_t, int16_t, FUNC>;
+            break;
+        case PhysicalTypeID::INT32:
+            asScalar->execFunc =
+                ScalarFunction::UnaryExecNestedTypeFunction<int32_t, int32_t, FUNC>;
+            break;
+        case PhysicalTypeID::INT64:
+            asScalar->execFunc =
+                ScalarFunction::UnaryExecNestedTypeFunction<int64_t, int64_t, FUNC>;
+            break;
+        case PhysicalTypeID::INT128:
+            asScalar->execFunc =
+                ScalarFunction::UnaryExecNestedTypeFunction<int128_t, int128_t, FUNC>;
+            break;
+        default:
+            KU_UNREACHABLE;
+        }
+    } else {
+        switch (argumentType.getPhysicalType()) {
+        case PhysicalTypeID::INT16:
+            getUnaryExecutionHelper<FUNC, int16_t>(resultingType, asScalar->execFunc);
+            break;
+        case PhysicalTypeID::INT32:
+            getUnaryExecutionHelper<FUNC, int32_t>(resultingType, asScalar->execFunc);
+            break;
+        case PhysicalTypeID::INT64:
+            getUnaryExecutionHelper<FUNC, int64_t>(resultingType, asScalar->execFunc);
+            break;
+        case PhysicalTypeID::INT128:
+            getUnaryExecutionHelper<FUNC, int128_t>(resultingType, asScalar->execFunc);
+            break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    std::vector<LogicalType> argTypes;
+    argTypes.push_back(std::move(argumentType));
+    return std::make_unique<FunctionBindData>(std::move(argTypes), std::move(resultingType));
+}
+
+std::unique_ptr<FunctionBindData> DecimalFunction::bindAddFunc(ScalarBindFuncInput input) {
+    return genericBinaryArithmeticFunc<DecimalAdd>(input.arguments, input.definition);
+}
+
+std::unique_ptr<FunctionBindData> DecimalFunction::bindSubtractFunc(ScalarBindFuncInput input) {
+    return genericBinaryArithmeticFunc<DecimalSubtract>(input.arguments, input.definition);
+}
+
+std::unique_ptr<FunctionBindData> DecimalFunction::bindMultiplyFunc(ScalarBindFuncInput input) {
+    return genericBinaryArithmeticFunc<DecimalMultiply>(input.arguments, input.definition);
+}
+
+std::unique_ptr<FunctionBindData> DecimalFunction::bindDivideFunc(ScalarBindFuncInput input) {
+    return genericBinaryArithmeticFunc<DecimalDivide>(input.arguments, input.definition);
+}
+
+std::unique_ptr<FunctionBindData> DecimalFunction::bindModuloFunc(ScalarBindFuncInput input) {
+    return genericBinaryArithmeticFunc<DecimalModulo>(input.arguments, input.definition);
+}
+
+std::unique_ptr<FunctionBindData> DecimalFunction::bindNegateFunc(ScalarBindFuncInput input) {
+    return genericUnaryArithmeticFunc<DecimalNegate>(input.arguments, input.definition);
+}
+
+std::unique_ptr<FunctionBindData> DecimalFunction::bindAbsFunc(ScalarBindFuncInput input) {
+    return genericUnaryArithmeticFunc<DecimalAbs>(input.arguments, input.definition);
+}
+
+std::unique_ptr<FunctionBindData> DecimalFunction::bindFloorFunc(ScalarBindFuncInput input) {
+    return genericUnaryArithmeticFunc<DecimalFloor>(input.arguments, input.definition);
+}
+
+std::unique_ptr<FunctionBindData> DecimalFunction::bindCeilFunc(ScalarBindFuncInput input) {
+    return genericUnaryArithmeticFunc<DecimalCeil>(input.arguments, input.definition);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_blob_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_blob_functions.cpp
new file mode 100644
index 0000000000..95aa60258d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_blob_functions.cpp
@@ -0,0 +1,38 @@
+#include "function/blob/vector_blob_functions.h"
+
+#include "function/blob/functions/decode_function.h"
+#include "function/blob/functions/encode_function.h"
+#include "function/blob/functions/octet_length_function.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+function_set OctetLengthFunctions::getFunctionSet() {
+    function_set definitions;
+    definitions.push_back(
+        make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::BLOB},
+            LogicalTypeID::INT64, ScalarFunction::UnaryExecFunction<blob_t, int64_t, OctetLength>));
+    return definitions;
+}
+
+function_set EncodeFunctions::getFunctionSet() {
+    function_set definitions;
+    definitions.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING}, LogicalTypeID::BLOB,
+        ScalarFunction::UnaryStringExecFunction<ku_string_t, blob_t, Encode>));
+    return definitions;
+}
+
+function_set DecodeFunctions::getFunctionSet() {
+    function_set definitions;
+    definitions.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::BLOB}, LogicalTypeID::STRING,
+        ScalarFunction::UnaryStringExecFunction<blob_t, ku_string_t, Decode>));
+    return definitions;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_boolean_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_boolean_functions.cpp
new file mode 100644
index 0000000000..74be067259
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_boolean_functions.cpp
@@ -0,0 +1,124 @@
+#include "function/boolean/vector_boolean_functions.h"
+
+#include "common/exception/runtime.h"
+#include "function/boolean/boolean_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+void VectorBooleanFunction::bindExecFunction(ExpressionType expressionType,
+    const binder::expression_vector& children, scalar_func_exec_t& func) {
+    if (ExpressionTypeUtil::isBinary(expressionType)) {
+        bindBinaryExecFunction(expressionType, children, func);
+    } else {
+        KU_ASSERT(ExpressionTypeUtil::isUnary(expressionType));
+        bindUnaryExecFunction(expressionType, children, func);
+    }
+}
+
+void VectorBooleanFunction::bindSelectFunction(ExpressionType expressionType,
+    const binder::expression_vector& children, scalar_func_select_t& func) {
+    if (ExpressionTypeUtil::isBinary(expressionType)) {
+        bindBinarySelectFunction(expressionType, children, func);
+    } else {
+        KU_ASSERT(ExpressionTypeUtil::isUnary(expressionType));
+        bindUnarySelectFunction(expressionType, children, func);
+    }
+}
+
+void VectorBooleanFunction::bindBinaryExecFunction(ExpressionType expressionType,
+    const binder::expression_vector& children, scalar_func_exec_t& func) {
+    KU_ASSERT(children.size() == 2);
+    const auto& leftType = children[0]->dataType;
+    const auto& rightType = children[1]->dataType;
+    (void)leftType;
+    (void)rightType;
+    KU_ASSERT(leftType.getLogicalTypeID() == LogicalTypeID::BOOL &&
+              rightType.getLogicalTypeID() == LogicalTypeID::BOOL);
+    switch (expressionType) {
+    case ExpressionType::AND: {
+        func = &BinaryBooleanExecFunction<And>;
+        return;
+    }
+    case ExpressionType::OR: {
+        func = &BinaryBooleanExecFunction<Or>;
+        return;
+    }
+    case ExpressionType::XOR: {
+        func = &BinaryBooleanExecFunction<Xor>;
+        return;
+    }
+    default:
+        throw RuntimeException("Invalid expression type " +
+                               ExpressionTypeUtil::toString(expressionType) +
+                               " for VectorBooleanFunctions::bindBinaryExecFunction.");
+    }
+}
+
+void VectorBooleanFunction::bindBinarySelectFunction(ExpressionType expressionType,
+    const binder::expression_vector& children, scalar_func_select_t& func) {
+    KU_ASSERT(children.size() == 2);
+    const auto& leftType = children[0]->dataType;
+    const auto& rightType = children[1]->dataType;
+    (void)leftType;
+    (void)rightType;
+    KU_ASSERT(leftType.getLogicalTypeID() == LogicalTypeID::BOOL &&
+              rightType.getLogicalTypeID() == LogicalTypeID::BOOL);
+    switch (expressionType) {
+    case ExpressionType::AND: {
+        func = &BinaryBooleanSelectFunction<And>;
+        return;
+    }
+    case ExpressionType::OR: {
+        func = &BinaryBooleanSelectFunction<Or>;
+        return;
+    }
+    case ExpressionType::XOR: {
+        func = &BinaryBooleanSelectFunction<Xor>;
+        return;
+    }
+    default:
+        throw RuntimeException("Invalid expression type " +
+                               ExpressionTypeUtil::toString(expressionType) +
+                               " for VectorBooleanFunctions::bindBinarySelectFunction.");
+    }
+}
+
+void VectorBooleanFunction::bindUnaryExecFunction(ExpressionType expressionType,
+    const binder::expression_vector& children, scalar_func_exec_t& func) {
+    KU_ASSERT(
+        children.size() == 1 && children[0]->dataType.getLogicalTypeID() == LogicalTypeID::BOOL);
+    (void)children;
+    switch (expressionType) {
+    case ExpressionType::NOT: {
+        func = &UnaryBooleanExecFunction<Not>;
+        return;
+    }
+    default:
+        throw RuntimeException("Invalid expression type " +
+                               ExpressionTypeUtil::toString(expressionType) +
+                               " for VectorBooleanFunctions::bindUnaryExecFunction.");
+    }
+}
+
+void VectorBooleanFunction::bindUnarySelectFunction(ExpressionType expressionType,
+    const binder::expression_vector& children, scalar_func_select_t& func) {
+    KU_ASSERT(
+        children.size() == 1 && children[0]->dataType.getLogicalTypeID() == LogicalTypeID::BOOL);
+    (void)children;
+    switch (expressionType) {
+    case ExpressionType::NOT: {
+        func = &UnaryBooleanSelectFunction<Not>;
+        return;
+    }
+    default:
+        throw RuntimeException("Invalid expression type " +
+                               ExpressionTypeUtil::toString(expressionType) +
+                               " for VectorBooleanFunctions::bindUnaryExecFunction.");
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_cast_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_cast_functions.cpp
new file mode 100644
index 0000000000..0c388b7325
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_cast_functions.cpp
@@ -0,0 +1,1206 @@
+#include "function/cast/vector_cast_functions.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/expression/literal_expression.h"
+#include "catalog/catalog.h"
+#include "common/exception/binder.h"
+#include "common/exception/conversion.h"
+#include "function/built_in_function_utils.h"
+#include "function/cast/cast_union_bind_data.h"
+#include "function/cast/functions/cast_array.h"
+#include "function/cast/functions/cast_decimal.h"
+#include "function/cast/functions/cast_from_string_functions.h"
+#include "function/cast/functions/cast_functions.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace function {
+
+struct CastChildFunctionExecutor {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC, typename OP_WRAPPER>
+    static void executeSwitch(common::ValueVector& operand, common::SelectionVector*,
+        common::ValueVector& result, common::SelectionVector*, void* dataPtr) {
+        auto& bindData = *reinterpret_cast<CastFunctionBindData*>(dataPtr);
+        for (auto i = 0u; i < bindData.numOfEntries; i++) {
+            result.setNull(i, operand.isNull(i));
+            if (!result.isNull(i)) {
+                OP_WRAPPER::template operation<OPERAND_TYPE, RESULT_TYPE, FUNC>((void*)(&operand),
+                    i, (void*)(&result), i, dataPtr);
+            }
+        }
+    }
+};
+
+static union_field_idx_t findUnionMinCostTag(const LogicalType&, const LogicalType&);
+
+static void resolveNestedVector(std::shared_ptr<ValueVector> inputVector, ValueVector* resultVector,
+    uint64_t numOfEntries, CastFunctionBindData* dataPtr) {
+    const auto* inputType = &inputVector->dataType;
+    const auto* resultType = &resultVector->dataType;
+    while (true) {
+        if ((inputType->getPhysicalType() == PhysicalTypeID::LIST ||
+                inputType->getPhysicalType() == PhysicalTypeID::ARRAY) &&
+            (resultType->getPhysicalType() == PhysicalTypeID::LIST ||
+                resultType->getPhysicalType() == PhysicalTypeID::ARRAY)) {
+            // copy data and nullmask from input
+            memcpy(resultVector->getData(), inputVector->getData(),
+                numOfEntries * resultVector->getNumBytesPerValue());
+            resultVector->setNullFromBits(inputVector->getNullMask().getData(), 0, 0, numOfEntries);
+
+            numOfEntries = ListVector::getDataVectorSize(inputVector.get());
+            ListVector::resizeDataVector(resultVector, numOfEntries);
+
+            inputVector = ListVector::getSharedDataVector(inputVector.get());
+            resultVector = ListVector::getDataVector(resultVector);
+            inputType = &inputVector->dataType;
+            resultType = &resultVector->dataType;
+        } else if ((inputType->getLogicalTypeID() == LogicalTypeID::STRUCT &&
+                       resultType->getLogicalTypeID() == LogicalTypeID::STRUCT) ||
+                   CastArrayHelper::isUnionSpecialCast(*inputType, *resultType)) {
+            // Check if struct type can be cast
+            auto errorMsg = stringFormat("Unsupported casting function from {} to {}.",
+                inputType->toString(), resultType->toString());
+            // Check if two structs have the same number of fields
+            if (StructType::getNumFields(*inputType) != StructType::getNumFields(*resultType)) {
+                throw ConversionException{errorMsg};
+            }
+
+            // Check if two structs have the same field names
+            auto inputTypeNames = StructType::getFieldNames(*inputType);
+            auto resultTypeNames = StructType::getFieldNames(*resultType);
+
+            for (auto i = 0u; i < inputTypeNames.size(); i++) {
+                if (StringUtils::caseInsensitiveEquals(inputTypeNames[i], resultTypeNames[i])) {
+                    continue;
+                }
+                throw ConversionException{errorMsg};
+            }
+
+            // copy data and nullmask from input
+            memcpy(resultVector->getData(), inputVector->getData(),
+                numOfEntries * resultVector->getNumBytesPerValue());
+            resultVector->setNullFromBits(inputVector->getNullMask().getData(), 0, 0, numOfEntries);
+
+            auto inputFieldVectors = StructVector::getFieldVectors(inputVector.get());
+            auto resultFieldVectors = StructVector::getFieldVectors(resultVector);
+            for (auto i = 0u; i < inputFieldVectors.size(); i++) {
+                resolveNestedVector(inputFieldVectors[i], resultFieldVectors[i].get(), numOfEntries,
+                    dataPtr);
+            }
+            return;
+        } else if (resultType->getLogicalTypeID() == LogicalTypeID::UNION) {
+            if (inputType->getLogicalTypeID() == LogicalTypeID::UNION) {
+                auto numFieldsSrc = UnionType::getNumFields(*inputType);
+                std::vector<union_field_idx_t> tagMap(numFieldsSrc);
+                for (auto i = 0u; i < numFieldsSrc; ++i) {
+                    const auto& fieldName = UnionType::getFieldName(*inputType, i);
+                    if (!UnionType::hasField(*resultType, fieldName)) {
+                        throw ConversionException{stringFormat(
+                            "Cannot cast from {} to {}, target type is missing field '{}'.",
+                            inputType->toString(), resultType->toString(), fieldName)};
+                    }
+                    const auto& fieldTypeSrc = UnionType::getFieldType(*inputType, i);
+                    const auto& fieldTypeDst = UnionType::getFieldType(*resultType, fieldName);
+                    if (!CastFunction::hasImplicitCast(fieldTypeSrc, fieldTypeDst)) {
+                        throw ConversionException{
+                            stringFormat("Unsupported casting function from {} to {}.",
+                                fieldTypeSrc.toString(), fieldTypeDst.toString())};
+                    }
+                    auto dstTag = UnionType::getFieldIdx(*resultType, fieldName);
+                    tagMap[i] = dstTag;
+                    auto srcValVector = UnionVector::getSharedValVector(inputVector.get(), i);
+                    auto resValVector = UnionVector::getValVector(resultVector, dstTag);
+                    resolveNestedVector(srcValVector, resValVector, numOfEntries, dataPtr);
+                }
+                auto srcTagVector = UnionVector::getTagVector(inputVector.get());
+                auto resTagVector = UnionVector::getTagVector(resultVector);
+                for (auto i = 0u; i < numOfEntries; ++i) {
+                    auto srcTag = srcTagVector->getValue<union_field_idx_t>(i);
+                    resTagVector->setValue(i, tagMap[srcTag]);
+                }
+                return;
+            } else {
+                auto minCostTag = findUnionMinCostTag(*inputType, *resultType);
+                auto tagVector = UnionVector::getTagVector(resultVector);
+                for (auto i = 0u; i < numOfEntries; ++i) {
+                    tagVector->setValue(i, minCostTag);
+                }
+                resultVector = UnionVector::getValVector(resultVector, minCostTag);
+                resultType = &UnionType::getFieldType(*resultType, minCostTag);
+            }
+        } else {
+            break;
+        }
+    }
+    // non-nested types
+    if (inputType->getLogicalTypeID() != resultType->getLogicalTypeID()) {
+        auto func = CastFunction::bindCastFunction<CastChildFunctionExecutor>("CAST", *inputType,
+            *resultType)
+                        ->execFunc;
+        std::vector<std::shared_ptr<ValueVector>> childParams{inputVector};
+        dataPtr->numOfEntries = numOfEntries;
+        func(childParams, SelectionVector::fromValueVectors(childParams), *resultVector,
+            resultVector->getSelVectorPtr(), (void*)dataPtr);
+    } else {
+        for (auto i = 0u; i < numOfEntries; i++) {
+            resultVector->copyFromVectorData(i, inputVector.get(), i);
+        }
+    }
+}
+
+static void nestedTypesCastExecFunction(
+    const std::vector<std::shared_ptr<common::ValueVector>>& params,
+    const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void*) {
+    KU_ASSERT(params.size() == 1);
+    result.resetAuxiliaryBuffer();
+    const auto& inputVector = params[0];
+    const auto* inputVectorSelVector = paramSelVectors[0];
+
+    // check if all selected list entries have the required fixed list size
+    if (CastArrayHelper::containsListToArray(inputVector->dataType, result.dataType)) {
+        for (auto i = 0u; i < inputVectorSelVector->getSelSize(); i++) {
+            auto pos = (*inputVectorSelVector)[i];
+            CastArrayHelper::validateListEntry(inputVector.get(), result.dataType, pos);
+        }
+    };
+
+    auto& selVector = *inputVectorSelVector;
+    auto bindData = CastFunctionBindData(result.dataType.copy());
+    bindData.numOfEntries = selVector[selVector.getSelSize() - 1] + 1;
+    resolveNestedVector(inputVector, &result, bindData.numOfEntries, &bindData);
+    if (inputVector->state->isFlat()) {
+        resultSelVector->setToFiltered();
+        (*resultSelVector)[0] = (*inputVectorSelVector)[0];
+    }
+}
+
+static bool hasImplicitCastList(const LogicalType& srcType, const LogicalType& dstType) {
+    return CastFunction::hasImplicitCast(ListType::getChildType(srcType),
+        ListType::getChildType(dstType));
+}
+
+static bool hasImplicitCastArray(const LogicalType& srcType, const LogicalType& dstType) {
+    if (ArrayType::getNumElements(srcType) != ArrayType::getNumElements(dstType)) {
+        return false;
+    }
+    return CastFunction::hasImplicitCast(ArrayType::getChildType(srcType),
+        ArrayType::getChildType(dstType));
+}
+
+static bool hasImplicitCastArrayToList(const LogicalType& srcType, const LogicalType& dstType) {
+    return CastFunction::hasImplicitCast(ArrayType::getChildType(srcType),
+        ListType::getChildType(dstType));
+}
+
+static bool hasImplicitCastListToArray(const LogicalType& srcType, const LogicalType& dstType) {
+    return CastFunction::hasImplicitCast(ListType::getChildType(srcType),
+        ArrayType::getChildType(dstType));
+}
+
+static bool hasImplicitCastStruct(const LogicalType& srcType, const LogicalType& dstType) {
+    const auto& srcFields = StructType::getFields(srcType);
+    const auto& dstFields = StructType::getFields(dstType);
+    if (srcFields.size() != dstFields.size()) {
+        return false;
+    }
+    for (auto i = 0u; i < srcFields.size(); i++) {
+        if (srcFields[i].getName() != dstFields[i].getName()) {
+            return false;
+        }
+        if (!CastFunction::hasImplicitCast(srcFields[i].getType(), dstFields[i].getType())) {
+            return false;
+        }
+    }
+    return true;
+}
+
+static bool hasImplicitCastUnion(const LogicalType& srcType, const LogicalType& dstType) {
+    if (srcType.getLogicalTypeID() == LogicalTypeID::UNION) {
+        auto numFieldsSrc = UnionType::getNumFields(srcType);
+        for (auto i = 0u; i < numFieldsSrc; ++i) {
+            const auto& fieldName = UnionType::getFieldName(srcType, i);
+            const auto& fieldType = UnionType::getFieldType(srcType, i);
+            if (!UnionType::hasField(dstType, fieldName) ||
+                !CastFunction::hasImplicitCast(fieldType,
+                    UnionType::getFieldType(dstType, fieldName))) {
+                return false;
+            }
+        }
+        return true;
+    } else {
+        auto numFields = UnionType::getNumFields(dstType);
+        for (auto i = 0u; i < numFields; ++i) {
+            const auto& fieldType = UnionType::getFieldType(dstType, i);
+            if (CastFunction::hasImplicitCast(srcType, fieldType)) {
+                return true;
+            }
+        }
+        return false;
+    }
+}
+
+static bool hasImplicitCastMap(const LogicalType& srcType, const LogicalType& dstType) {
+    const auto& srcKeyType = MapType::getKeyType(srcType);
+    const auto& srcValueType = MapType::getValueType(srcType);
+    const auto& dstKeyType = MapType::getKeyType(dstType);
+    const auto& dstValueType = MapType::getValueType(dstType);
+    return CastFunction::hasImplicitCast(srcKeyType, dstKeyType) &&
+           CastFunction::hasImplicitCast(srcValueType, dstValueType);
+}
+
+bool CastFunction::hasImplicitCast(const LogicalType& srcType, const LogicalType& dstType) {
+    if (LogicalTypeUtils::isNested(srcType) && LogicalTypeUtils::isNested(dstType)) {
+        if (srcType.getLogicalTypeID() == LogicalTypeID::ARRAY &&
+            dstType.getLogicalTypeID() == LogicalTypeID::LIST) {
+            return hasImplicitCastArrayToList(srcType, dstType);
+        }
+        if (srcType.getLogicalTypeID() == LogicalTypeID::LIST &&
+            dstType.getLogicalTypeID() == LogicalTypeID::ARRAY) {
+            return hasImplicitCastListToArray(srcType, dstType);
+        }
+        if (srcType.getLogicalTypeID() != dstType.getLogicalTypeID()) {
+            return false;
+        }
+        switch (srcType.getLogicalTypeID()) {
+        case LogicalTypeID::LIST:
+            return hasImplicitCastList(srcType, dstType);
+        case LogicalTypeID::ARRAY:
+            return hasImplicitCastArray(srcType, dstType);
+        case LogicalTypeID::STRUCT:
+            return hasImplicitCastStruct(srcType, dstType);
+        case LogicalTypeID::UNION:
+            return hasImplicitCastUnion(srcType, dstType);
+        case LogicalTypeID::MAP:
+            return hasImplicitCastMap(srcType, dstType);
+        default:
+            // LCOV_EXCL_START
+            KU_UNREACHABLE;
+            // LCOV_EXCL_END
+        }
+    } else if (dstType.getLogicalTypeID() == LogicalTypeID::UNION) {
+        return hasImplicitCastUnion(srcType, dstType);
+    }
+    if (BuiltInFunctionsUtils::getCastCost(srcType.getLogicalTypeID(),
+            dstType.getLogicalTypeID()) != UNDEFINED_CAST_COST) {
+        return true;
+    }
+    // TODO(Jiamin): there are still other special cases
+    // We allow cast between any numerical types
+    if (LogicalTypeUtils::isNumerical(srcType) && LogicalTypeUtils::isNumerical(dstType)) {
+        return true;
+    }
+    return false;
+}
+
+template<typename EXECUTOR = UnaryFunctionExecutor>
+static std::unique_ptr<ScalarFunction> bindCastFromStringFunction(const std::string& functionName,
+    const LogicalType& targetType) {
+    scalar_func_exec_t execFunc;
+    switch (targetType.getLogicalTypeID()) {
+    case LogicalTypeID::DATE: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, date_t, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, timestamp_sec_t,
+            CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_MS: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, timestamp_ms_t,
+            CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_NS: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, timestamp_ns_t,
+            CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_TZ: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, timestamp_tz_t,
+            CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, timestamp_t, CastString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::INTERVAL: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, interval_t, CastString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::BLOB: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, blob_t, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UUID: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, ku_uuid_t, CastString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::STRING: {
+        execFunc =
+            ScalarFunction::UnaryCastExecFunction<ku_string_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::BOOL: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, bool, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::DOUBLE: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, double, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::FLOAT: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, float, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::DECIMAL: {
+        switch (targetType.getPhysicalType()) {
+        case PhysicalTypeID::INT16:
+            execFunc =
+                ScalarFunction::UnaryExecNestedTypeFunction<ku_string_t, int16_t, CastToDecimal>;
+            break;
+        case PhysicalTypeID::INT32:
+            execFunc =
+                ScalarFunction::UnaryExecNestedTypeFunction<ku_string_t, int32_t, CastToDecimal>;
+            break;
+        case PhysicalTypeID::INT64:
+            execFunc =
+                ScalarFunction::UnaryExecNestedTypeFunction<ku_string_t, int64_t, CastToDecimal>;
+            break;
+        case PhysicalTypeID::INT128:
+            execFunc =
+                ScalarFunction::UnaryExecNestedTypeFunction<ku_string_t, int128_t, CastToDecimal>;
+            break;
+        default:
+            KU_UNREACHABLE;
+        }
+    } break;
+    case LogicalTypeID::INT128: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, int128_t, CastString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT128: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, uint128_t, CastString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, int64_t, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT32: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, int32_t, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT16: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, int16_t, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT8: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, int8_t, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT64: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, uint64_t, CastString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT32: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, uint32_t, CastString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT16: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, uint16_t, CastString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT8: {
+        execFunc =
+            ScalarFunction::UnaryCastStringExecFunction<ku_string_t, uint8_t, CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::LIST: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, list_entry_t,
+            CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::MAP: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, map_entry_t, CastString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::STRUCT: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, struct_entry_t,
+            CastString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UNION: {
+        execFunc = ScalarFunction::UnaryCastStringExecFunction<ku_string_t, union_entry_t,
+            CastString, EXECUTOR>;
+    } break;
+    default:
+        throw ConversionException{
+            stringFormat("Unsupported casting function from STRING to {}.", targetType.toString())};
+    }
+    return std::make_unique<ScalarFunction>(functionName,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING}, targetType.getLogicalTypeID(), execFunc);
+}
+
+template<typename EXECUTOR = UnaryFunctionExecutor>
+static std::unique_ptr<ScalarFunction> bindCastToStringFunction(const std::string& functionName,
+    const LogicalType& sourceType) {
+    scalar_func_exec_t func;
+    switch (sourceType.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL: {
+        func = ScalarFunction::UnaryCastExecFunction<bool, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64: {
+        func = ScalarFunction::UnaryCastExecFunction<int64_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT32: {
+        func = ScalarFunction::UnaryCastExecFunction<int32_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT16: {
+        func = ScalarFunction::UnaryCastExecFunction<int16_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT8: {
+        func = ScalarFunction::UnaryCastExecFunction<int8_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT64: {
+        func = ScalarFunction::UnaryCastExecFunction<uint64_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT32: {
+        func = ScalarFunction::UnaryCastExecFunction<uint32_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT16: {
+        func = ScalarFunction::UnaryCastExecFunction<uint16_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT128: {
+        func = ScalarFunction::UnaryCastExecFunction<int128_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT128: {
+        func =
+            ScalarFunction::UnaryCastExecFunction<uint128_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT8: {
+        func = ScalarFunction::UnaryCastExecFunction<uint8_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::DOUBLE: {
+        func = ScalarFunction::UnaryCastExecFunction<double, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::FLOAT: {
+        func = ScalarFunction::UnaryCastExecFunction<float, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::DECIMAL: {
+        switch (sourceType.getPhysicalType()) {
+        case PhysicalTypeID::INT16:
+            func = ScalarFunction::UnaryExecNestedTypeFunction<int16_t, ku_string_t, CastDecimalTo>;
+            break;
+        case PhysicalTypeID::INT32:
+            func = ScalarFunction::UnaryExecNestedTypeFunction<int32_t, ku_string_t, CastDecimalTo>;
+            break;
+        case PhysicalTypeID::INT64:
+            func = ScalarFunction::UnaryExecNestedTypeFunction<int64_t, ku_string_t, CastDecimalTo>;
+            break;
+        case PhysicalTypeID::INT128:
+            func =
+                ScalarFunction::UnaryExecNestedTypeFunction<int128_t, ku_string_t, CastDecimalTo>;
+            break;
+        default:
+            KU_UNREACHABLE;
+        }
+    } break;
+    case LogicalTypeID::DATE: {
+        func = ScalarFunction::UnaryCastExecFunction<date_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_NS: {
+        func = ScalarFunction::UnaryCastExecFunction<timestamp_ns_t, ku_string_t, CastToString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_MS: {
+        func = ScalarFunction::UnaryCastExecFunction<timestamp_ms_t, ku_string_t, CastToString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        func = ScalarFunction::UnaryCastExecFunction<timestamp_sec_t, ku_string_t, CastToString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_TZ: {
+        func = ScalarFunction::UnaryCastExecFunction<timestamp_tz_t, ku_string_t, CastToString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP: {
+        func =
+            ScalarFunction::UnaryCastExecFunction<timestamp_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INTERVAL: {
+        func =
+            ScalarFunction::UnaryCastExecFunction<interval_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INTERNAL_ID: {
+        func = ScalarFunction::UnaryCastExecFunction<internalID_t, ku_string_t, CastToString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::BLOB: {
+        func = ScalarFunction::UnaryCastExecFunction<blob_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UUID: {
+        func =
+            ScalarFunction::UnaryCastExecFunction<ku_uuid_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::LIST: {
+        func = ScalarFunction::UnaryCastExecFunction<list_entry_t, ku_string_t, CastToString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::MAP: {
+        func =
+            ScalarFunction::UnaryCastExecFunction<map_entry_t, ku_string_t, CastToString, EXECUTOR>;
+    } break;
+    case LogicalTypeID::NODE: {
+        func = ScalarFunction::UnaryCastExecFunction<struct_entry_t, ku_string_t, CastNodeToString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::REL: {
+        func = ScalarFunction::UnaryCastExecFunction<struct_entry_t, ku_string_t, CastRelToString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::STRUCT: {
+        func = ScalarFunction::UnaryCastExecFunction<struct_entry_t, ku_string_t, CastToString,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::UNION: {
+        func = ScalarFunction::UnaryCastExecFunction<union_entry_t, ku_string_t, CastToString,
+            EXECUTOR>;
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return std::make_unique<ScalarFunction>(functionName,
+        std::vector<LogicalTypeID>{sourceType.getLogicalTypeID()}, LogicalTypeID::STRING, func);
+}
+
+template<typename DST_TYPE, CastExecutor EXECUTOR>
+static std::unique_ptr<ScalarFunction> bindCastToDecimalFunction(const std::string& functionName,
+    const LogicalType& sourceType, const LogicalType& targetType) {
+    scalar_func_exec_t func;
+    if (sourceType.getLogicalTypeID() == LogicalTypeID::DECIMAL) {
+        TypeUtils::visit(
+            sourceType,
+            [&]<SignedIntegerTypes T>(T) {
+                func = ScalarFunction::UnaryCastExecFunction<T, DST_TYPE, CastBetweenDecimal,
+                    EXECUTOR>;
+            },
+            [&](auto) { KU_UNREACHABLE; });
+    } else {
+        TypeUtils::visit(
+            sourceType,
+            [&]<NumericTypes T>(T) {
+                func = ScalarFunction::UnaryCastExecFunction<T, DST_TYPE, CastToDecimal, EXECUTOR>;
+            },
+            [&](auto) { KU_UNREACHABLE; });
+    }
+    return std::make_unique<ScalarFunction>(functionName,
+        std::vector<LogicalTypeID>{sourceType.getLogicalTypeID()}, targetType.getLogicalTypeID(),
+        func);
+}
+
+template<typename DST_TYPE, typename OP, typename EXECUTOR = UnaryFunctionExecutor>
+static std::unique_ptr<ScalarFunction> bindCastToNumericFunction(const std::string& functionName,
+    const LogicalType& sourceType, const LogicalType& targetType) {
+    scalar_func_exec_t func;
+    switch (sourceType.getLogicalTypeID()) {
+    case LogicalTypeID::INT8: {
+        func = ScalarFunction::UnaryExecFunction<int8_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT16: {
+        func = ScalarFunction::UnaryExecFunction<int16_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT32: {
+        func = ScalarFunction::UnaryExecFunction<int32_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::INT64: {
+        func = ScalarFunction::UnaryExecFunction<int64_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT8: {
+        func = ScalarFunction::UnaryExecFunction<uint8_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT16: {
+        func = ScalarFunction::UnaryExecFunction<uint16_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT32: {
+        func = ScalarFunction::UnaryExecFunction<uint32_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT64: {
+        func = ScalarFunction::UnaryExecFunction<uint64_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::INT128: {
+        func = ScalarFunction::UnaryExecFunction<int128_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::UINT128: {
+        func = ScalarFunction::UnaryExecFunction<uint128_t, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::FLOAT: {
+        func = ScalarFunction::UnaryExecFunction<float, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::DOUBLE: {
+        func = ScalarFunction::UnaryExecFunction<double, DST_TYPE, OP, EXECUTOR>;
+    } break;
+    case LogicalTypeID::DECIMAL: {
+        switch (sourceType.getPhysicalType()) {
+        // note: this cannot handle decimal -> decimal casting.
+        case PhysicalTypeID::INT16:
+            func = ScalarFunction::UnaryExecNestedTypeFunction<int16_t, DST_TYPE, CastDecimalTo,
+                EXECUTOR>;
+            break;
+        case PhysicalTypeID::INT32:
+            func = ScalarFunction::UnaryExecNestedTypeFunction<int32_t, DST_TYPE, CastDecimalTo,
+                EXECUTOR>;
+            break;
+        case PhysicalTypeID::INT64:
+            func = ScalarFunction::UnaryExecNestedTypeFunction<int64_t, DST_TYPE, CastDecimalTo,
+                EXECUTOR>;
+            break;
+        case PhysicalTypeID::INT128:
+            func = ScalarFunction::UnaryExecNestedTypeFunction<int128_t, DST_TYPE, CastDecimalTo,
+                EXECUTOR>;
+            break;
+        default:
+            KU_UNREACHABLE;
+        }
+    } break;
+    default:
+        throw ConversionException{stringFormat("Unsupported casting function from {} to {}.",
+            sourceType.toString(), targetType.toString())};
+    }
+    return std::make_unique<ScalarFunction>(functionName,
+        std::vector<LogicalTypeID>{sourceType.getLogicalTypeID()}, targetType.getLogicalTypeID(),
+        func);
+}
+
+static union_field_idx_t findUnionMinCostTag(const LogicalType& sourceType,
+    const LogicalType& unionType) {
+    uint32_t minCastCost = UNDEFINED_CAST_COST;
+    union_field_idx_t minCostTag = 0;
+    auto numFields = UnionType::getNumFields(unionType);
+    for (auto i = 0u; i < numFields; ++i) {
+        const auto& fieldType = UnionType::getFieldType(unionType, i);
+        if (CastFunction::hasImplicitCast(sourceType, fieldType)) {
+            uint32_t castCost = BuiltInFunctionsUtils::getCastCost(sourceType.getLogicalTypeID(),
+                fieldType.getLogicalTypeID());
+            if (castCost < minCastCost) {
+                minCastCost = castCost;
+                minCostTag = i;
+            }
+        }
+    }
+    if (minCastCost == UNDEFINED_CAST_COST) {
+        throw ConversionException{
+            stringFormat("Cannot cast from {} to {}, target type has no compatible field.",
+                sourceType.toString(), unionType.toString())};
+    }
+    return minCostTag;
+}
+
+static std::unique_ptr<ScalarFunction> bindCastToUnionFunction(const std::string& functionName,
+    const LogicalType& sourceType, const LogicalType& targetType) {
+    auto minCostTag = findUnionMinCostTag(sourceType, targetType);
+    const auto& innerType = common::UnionType::getFieldType(targetType, minCostTag);
+    CastToUnionBindData::inner_func_t innerFunc;
+    if (sourceType == innerType) {
+        innerFunc = [](ValueVector* inputVector, ValueVector& valVector, SelectionVector*,
+                        uint64_t inputPos, uint64_t resultPos) {
+            valVector.copyFromVectorData(inputPos, inputVector, resultPos);
+        };
+    } else {
+        std::shared_ptr<ScalarFunction> innerCast =
+            CastFunction::bindCastFunction("CAST", sourceType, innerType);
+        innerFunc = [innerCast](ValueVector* inputVector, ValueVector& valVector,
+                        SelectionVector* selVector, uint64_t, uint64_t) {
+            // Can we just use inputPos / resultPos and not the entire sel vector?
+            auto input = std::shared_ptr<ValueVector>(inputVector, [](ValueVector*) {});
+            innerCast->execFunc({input}, {selVector}, valVector, selVector, nullptr /* dataPtr */);
+        };
+    }
+    auto castFunc = std::make_unique<ScalarFunction>(functionName,
+        std::vector<LogicalTypeID>{sourceType.getLogicalTypeID()}, targetType.getLogicalTypeID(),
+        ScalarFunction::UnaryCastExecFunction<void, void, CastToUnion, UnaryFunctionExecutor,
+            UnaryCastUnionFunctionWrapper>);
+    castFunc->bindFunc = [minCostTag, innerFunc, &targetType](const ScalarBindFuncInput&) {
+        return std::make_unique<CastToUnionBindData>(minCostTag, innerFunc, targetType.copy());
+    };
+    return castFunc;
+}
+
+static std::unique_ptr<ScalarFunction> bindCastBetweenNested(const std::string& functionName,
+    const LogicalType& sourceType, const LogicalType& targetType) {
+    // todo: compile time checking of nested types
+    if (CastArrayHelper::checkCompatibleNestedTypes(sourceType.getLogicalTypeID(),
+            targetType.getLogicalTypeID())) {
+        return std::make_unique<ScalarFunction>(functionName,
+            std::vector<LogicalTypeID>{sourceType.getLogicalTypeID()},
+            targetType.getLogicalTypeID(), nestedTypesCastExecFunction);
+    }
+    throw ConversionException{stringFormat("Unsupported casting function from {} to {}.",
+        LogicalTypeUtils::toString(sourceType.getLogicalTypeID()),
+        LogicalTypeUtils::toString(targetType.getLogicalTypeID()))};
+}
+
+template<typename EXECUTOR = UnaryFunctionExecutor, typename DST_TYPE>
+static std::unique_ptr<ScalarFunction> bindCastToDateFunction(const std::string& functionName,
+    const LogicalType& sourceType, const LogicalType& dstType) {
+    scalar_func_exec_t func;
+    switch (sourceType.getLogicalTypeID()) {
+    case LogicalTypeID::TIMESTAMP_MS:
+        func = ScalarFunction::UnaryExecFunction<timestamp_ms_t, DST_TYPE, CastToDate, EXECUTOR>;
+        break;
+    case LogicalTypeID::TIMESTAMP_NS:
+        func = ScalarFunction::UnaryExecFunction<timestamp_ns_t, DST_TYPE, CastToDate, EXECUTOR>;
+        break;
+    case LogicalTypeID::TIMESTAMP_SEC:
+        func = ScalarFunction::UnaryExecFunction<timestamp_sec_t, DST_TYPE, CastToDate, EXECUTOR>;
+        break;
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::TIMESTAMP:
+        func = ScalarFunction::UnaryExecFunction<timestamp_t, DST_TYPE, CastToDate, EXECUTOR>;
+        break;
+    // LCOV_EXCL_START
+    default:
+        throw ConversionException{stringFormat("Unsupported casting function from {} to {}.",
+            sourceType.toString(), dstType.toString())};
+        // LCOV_EXCL_END
+    }
+    return std::make_unique<ScalarFunction>(functionName,
+        std::vector<LogicalTypeID>{sourceType.getLogicalTypeID()}, LogicalTypeID::DATE, func);
+}
+
+template<typename EXECUTOR = UnaryFunctionExecutor, typename DST_TYPE>
+static std::unique_ptr<ScalarFunction> bindCastToTimestampFunction(const std::string& functionName,
+    const LogicalType& sourceType, const LogicalType& dstType) {
+    scalar_func_exec_t func;
+    switch (sourceType.getLogicalTypeID()) {
+    case LogicalTypeID::DATE: {
+        func = ScalarFunction::UnaryExecFunction<date_t, DST_TYPE, CastDateToTimestamp, EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_MS: {
+        func = ScalarFunction::UnaryExecFunction<timestamp_ms_t, DST_TYPE, CastBetweenTimestamp,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_NS: {
+        func = ScalarFunction::UnaryExecFunction<timestamp_ns_t, DST_TYPE, CastBetweenTimestamp,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        func = ScalarFunction::UnaryExecFunction<timestamp_sec_t, DST_TYPE, CastBetweenTimestamp,
+            EXECUTOR>;
+    } break;
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::TIMESTAMP: {
+        func = ScalarFunction::UnaryExecFunction<timestamp_t, DST_TYPE, CastBetweenTimestamp,
+            EXECUTOR>;
+    } break;
+    default:
+        throw ConversionException{stringFormat("Unsupported casting function from {} to {}.",
+            sourceType.toString(), dstType.toString())};
+    }
+    return std::make_unique<ScalarFunction>(functionName,
+        std::vector<LogicalTypeID>{sourceType.getLogicalTypeID()}, LogicalTypeID::TIMESTAMP, func);
+}
+
+template<typename DST_TYPE>
+static std::unique_ptr<ScalarFunction> bindCastBetweenDecimalFunction(
+    const std::string& functionName, const LogicalType& sourceType) {
+    scalar_func_exec_t func;
+    switch (sourceType.getPhysicalType()) {
+    case PhysicalTypeID::INT16:
+        func = ScalarFunction::UnaryExecNestedTypeFunction<int16_t, DST_TYPE, CastBetweenDecimal>;
+        break;
+    case PhysicalTypeID::INT32:
+        func = ScalarFunction::UnaryExecNestedTypeFunction<int32_t, DST_TYPE, CastBetweenDecimal>;
+        break;
+    case PhysicalTypeID::INT64:
+        func = ScalarFunction::UnaryExecNestedTypeFunction<int64_t, DST_TYPE, CastBetweenDecimal>;
+        break;
+    case PhysicalTypeID::INT128:
+        func = ScalarFunction::UnaryExecNestedTypeFunction<int128_t, DST_TYPE, CastBetweenDecimal>;
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return std::make_unique<ScalarFunction>(functionName,
+        std::vector<LogicalTypeID>{LogicalTypeID::DECIMAL}, LogicalTypeID::DECIMAL, func);
+}
+
+template<CastExecutor EXECUTOR>
+std::unique_ptr<ScalarFunction> CastFunction::bindCastFunction(const std::string& functionName,
+    const LogicalType& sourceType, const LogicalType& targetType) {
+    auto sourceTypeID = sourceType.getLogicalTypeID();
+    auto targetTypeID = targetType.getLogicalTypeID();
+    if (sourceTypeID == LogicalTypeID::STRING) {
+        return bindCastFromStringFunction<EXECUTOR>(functionName, targetType);
+    }
+    switch (targetTypeID) {
+    case LogicalTypeID::STRING: {
+        return bindCastToStringFunction<EXECUTOR>(functionName, sourceType);
+    }
+    case LogicalTypeID::DOUBLE: {
+        return bindCastToNumericFunction<double, CastToDouble, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::FLOAT: {
+        return bindCastToNumericFunction<float, CastToFloat, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::DECIMAL: {
+        std::unique_ptr<ScalarFunction> scalarFunc;
+        TypeUtils::visit(
+            targetType.getPhysicalType(),
+            [&]<IntegerTypes T>(T) {
+                scalarFunc =
+                    bindCastToDecimalFunction<T, EXECUTOR>(functionName, sourceType, targetType);
+            },
+            [](auto) { KU_UNREACHABLE; });
+        return scalarFunc;
+    }
+    case LogicalTypeID::INT128: {
+        return bindCastToNumericFunction<int128_t, CastToInt128, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::UINT128: {
+        return bindCastToNumericFunction<uint128_t, CastToUInt128, EXECUTOR>(functionName,
+            sourceType, targetType);
+    }
+    case LogicalTypeID::SERIAL: {
+        return bindCastToNumericFunction<int64_t, CastToSerial, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::INT64: {
+        return bindCastToNumericFunction<int64_t, CastToInt64, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::INT32: {
+        return bindCastToNumericFunction<int32_t, CastToInt32, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::INT16: {
+        return bindCastToNumericFunction<int16_t, CastToInt16, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::INT8: {
+        return bindCastToNumericFunction<int8_t, CastToInt8, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::UINT64: {
+        return bindCastToNumericFunction<uint64_t, CastToUInt64, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::UINT32: {
+        return bindCastToNumericFunction<uint32_t, CastToUInt32, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::UINT16: {
+        return bindCastToNumericFunction<uint16_t, CastToUInt16, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::UINT8: {
+        return bindCastToNumericFunction<uint8_t, CastToUInt8, EXECUTOR>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::DATE: {
+        return bindCastToDateFunction<EXECUTOR, date_t>(functionName, sourceType, targetType);
+    }
+    case LogicalTypeID::TIMESTAMP_NS: {
+        return bindCastToTimestampFunction<EXECUTOR, timestamp_ns_t>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::TIMESTAMP_MS: {
+        return bindCastToTimestampFunction<EXECUTOR, timestamp_ms_t>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::TIMESTAMP_SEC: {
+        return bindCastToTimestampFunction<EXECUTOR, timestamp_sec_t>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::TIMESTAMP: {
+        return bindCastToTimestampFunction<EXECUTOR, timestamp_t>(functionName, sourceType,
+            targetType);
+    }
+    case LogicalTypeID::UNION: {
+        if (sourceType.getLogicalTypeID() != LogicalTypeID::UNION &&
+            !CastArrayHelper::isUnionSpecialCast(sourceType, targetType)) {
+            return bindCastToUnionFunction(functionName, sourceType, targetType);
+        }
+        [[fallthrough]];
+    }
+    case LogicalTypeID::LIST:
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::MAP:
+    case LogicalTypeID::STRUCT: {
+        return bindCastBetweenNested(functionName, sourceType, targetType);
+    }
+    default: {
+        throw ConversionException(stringFormat("Unsupported casting function from {} to {}.",
+            sourceType.toString(), targetType.toString()));
+    }
+    }
+}
+
+function_set CastToDateFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::DATE()));
+    return result;
+}
+
+function_set CastToTimestampFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::TIMESTAMP()));
+    return result;
+}
+
+function_set CastToIntervalFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::INTERVAL()));
+    return result;
+}
+
+static std::unique_ptr<FunctionBindData> toStringBindFunc(ScalarBindFuncInput input) {
+    return FunctionBindData::getSimpleBindData(input.arguments, LogicalType::STRING());
+}
+
+function_set CastToStringFunction::getFunctionSet() {
+    function_set result;
+    result.reserve(LogicalTypeUtils::getAllValidLogicTypes().size());
+    for (auto& type : LogicalTypeUtils::getAllValidLogicTypes()) {
+        auto function = CastFunction::bindCastFunction(name, type, LogicalType::STRING());
+        function->bindFunc = toStringBindFunc;
+        result.push_back(std::move(function));
+    }
+    return result;
+}
+
+function_set CastToBlobFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::BLOB()));
+    return result;
+}
+
+function_set CastToUUIDFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::UUID()));
+    return result;
+}
+
+function_set CastToBoolFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::BOOL()));
+    return result;
+}
+
+function_set CastToDoubleFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::DOUBLE()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::DOUBLE()));
+    return result;
+}
+
+function_set CastToFloatFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::FLOAT()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::FLOAT()));
+    return result;
+}
+
+function_set CastToInt128Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::INT128()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::INT128()));
+    return result;
+}
+
+function_set CastToSerialFunction::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::SERIAL()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::SERIAL()));
+    return result;
+}
+
+function_set CastToInt64Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::INT64()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::INT64()));
+    return result;
+}
+
+function_set CastToInt32Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::INT32()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::INT32()));
+    return result;
+}
+
+function_set CastToInt16Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::INT16()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::INT16()));
+    return result;
+}
+
+function_set CastToInt8Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::INT8()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::INT8()));
+    return result;
+}
+
+function_set CastToUInt128Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::UINT128()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::UINT128()));
+    return result;
+}
+
+function_set CastToUInt64Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::UINT64()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::UINT64()));
+    return result;
+}
+
+function_set CastToUInt32Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::UINT32()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::UINT32()));
+    return result;
+}
+
+function_set CastToUInt16Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::UINT16()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::UINT16()));
+    return result;
+}
+
+function_set CastToUInt8Function::getFunctionSet() {
+    function_set result;
+    for (auto typeID : LogicalTypeUtils::getNumericalLogicalTypeIDs()) {
+        result.push_back(
+            CastFunction::bindCastFunction(name, LogicalType(typeID), LogicalType::UINT8()));
+    }
+    result.push_back(
+        CastFunction::bindCastFunction(name, LogicalType::STRING(), LogicalType::UINT8()));
+    return result;
+}
+
+static std::unique_ptr<FunctionBindData> castBindFunc(ScalarBindFuncInput input) {
+    KU_ASSERT(input.arguments.size() == 2);
+    // Bind target type.
+    if (input.arguments[1]->expressionType != ExpressionType::LITERAL) {
+        throw BinderException(stringFormat("Second parameter of CAST function must be a literal."));
+    }
+    auto literalExpr = input.arguments[1]->constPtrCast<LiteralExpression>();
+    auto targetTypeStr = literalExpr->getValue().getValue<std::string>();
+    auto func = input.definition->ptrCast<ScalarFunction>();
+    func->name = "CAST_TO_" + targetTypeStr;
+    auto targetType = LogicalType::convertFromString(targetTypeStr, input.context);
+    if (!LogicalType::isBuiltInType(targetTypeStr)) {
+        std::vector<LogicalType> typeVec;
+        typeVec.push_back(input.arguments[0]->getDataType().copy());
+        try {
+            auto entry =
+                catalog::Catalog::Get(*input.context)
+                    ->getFunctionEntry(transaction::Transaction::Get(*input.context), func->name);
+            auto match = BuiltInFunctionsUtils::matchFunction(func->name, typeVec,
+                entry->ptrCast<catalog::FunctionCatalogEntry>());
+            func->execFunc = match->constPtrCast<ScalarFunction>()->execFunc;
+            return std::make_unique<function::CastFunctionBindData>(targetType.copy());
+        } catch (...) { // NOLINT
+            // If there's no user defined casting function for the corresponding user defined type,
+            // we use the default casting function.
+        }
+    }
+    // For STRUCT type, we will need to check its field name in later stage
+    // Otherwise, there will be bug for: RETURN cast({'a': 12, 'b': 12} AS struct(c int64, d
+    // int64)); being allowed.
+    if (targetType == input.arguments[0]->getDataType() &&
+        targetType.getLogicalTypeID() != LogicalTypeID::STRUCT) { // No need to cast.
+        return nullptr;
+    }
+    if (ExpressionUtil::canCastStatically(*input.arguments[0], targetType) &&
+        targetType.getLogicalTypeID() != LogicalTypeID::STRUCT) {
+        input.arguments[0]->cast(targetType);
+        return nullptr;
+    }
+    // TODO(Xiyang): Can we unify the binding of casting function with other scalar functions?
+    auto res =
+        CastFunction::bindCastFunction(func->name, input.arguments[0]->getDataType(), targetType);
+    func->execFunc = res->execFunc;
+    if (res->bindFunc) {
+        return res->bindFunc(input);
+    }
+    return std::make_unique<function::CastFunctionBindData>(targetType.copy());
+}
+
+function_set CastAnyFunction::getFunctionSet() {
+    function_set result;
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ANY, LogicalTypeID::STRING}, LogicalTypeID::ANY);
+    func->bindFunc = castBindFunc;
+    result.push_back(std::move(func));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_date_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_date_functions.cpp
new file mode 100644
index 0000000000..998b2ea905
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_date_functions.cpp
@@ -0,0 +1,123 @@
+#include "function/date/vector_date_functions.h"
+
+#include "function/date/date_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+function_set DatePartFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::DATE},
+        LogicalTypeID::INT64,
+        ScalarFunction::BinaryExecFunction<ku_string_t, date_t, int64_t, DatePart>));
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::TIMESTAMP},
+        LogicalTypeID::INT64,
+        ScalarFunction::BinaryExecFunction<ku_string_t, timestamp_t, int64_t, DatePart>));
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INTERVAL},
+        LogicalTypeID::INT64,
+        ScalarFunction::BinaryExecFunction<ku_string_t, interval_t, int64_t, DatePart>));
+    return result;
+}
+
+function_set DateTruncFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::DATE}, LogicalTypeID::DATE,
+        ScalarFunction::BinaryExecFunction<ku_string_t, date_t, date_t, DateTrunc>));
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::TIMESTAMP},
+        LogicalTypeID::TIMESTAMP,
+        ScalarFunction::BinaryExecFunction<ku_string_t, timestamp_t, timestamp_t, DateTrunc>));
+    return result;
+}
+
+function_set DayNameFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DATE}, LogicalTypeID::STRING,
+        ScalarFunction::UnaryExecFunction<date_t, ku_string_t, DayName>));
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::TIMESTAMP}, LogicalTypeID::STRING,
+        ScalarFunction::UnaryExecFunction<timestamp_t, ku_string_t, DayName>));
+    return result;
+}
+
+function_set GreatestFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DATE, LogicalTypeID::DATE}, LogicalTypeID::DATE,
+        ScalarFunction::BinaryExecFunction<date_t, date_t, date_t, Greatest>));
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::TIMESTAMP, LogicalTypeID::TIMESTAMP},
+        LogicalTypeID::TIMESTAMP,
+        ScalarFunction::BinaryExecFunction<timestamp_t, timestamp_t, timestamp_t, Greatest>));
+    return result;
+}
+
+function_set LastDayFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::DATE},
+            LogicalTypeID::DATE, ScalarFunction::UnaryExecFunction<date_t, date_t, LastDay>));
+    result.push_back(
+        make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{LogicalTypeID::TIMESTAMP},
+            LogicalTypeID::DATE, ScalarFunction::UnaryExecFunction<timestamp_t, date_t, LastDay>));
+    return result;
+}
+
+function_set LeastFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DATE, LogicalTypeID::DATE}, LogicalTypeID::DATE,
+        ScalarFunction::BinaryExecFunction<date_t, date_t, date_t, Least>));
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::TIMESTAMP, LogicalTypeID::TIMESTAMP},
+        LogicalTypeID::TIMESTAMP,
+        ScalarFunction::BinaryExecFunction<timestamp_t, timestamp_t, timestamp_t, Least>));
+    return result;
+}
+
+function_set MakeDateFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::INT64, LogicalTypeID::INT64,
+            LogicalTypeID::INT64},
+        LogicalTypeID::DATE,
+        ScalarFunction::TernaryExecFunction<int64_t, int64_t, int64_t, date_t, MakeDate>));
+    return result;
+}
+
+function_set MonthNameFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DATE}, LogicalTypeID::STRING,
+        ScalarFunction::UnaryExecFunction<date_t, ku_string_t, MonthName>));
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::TIMESTAMP}, LogicalTypeID::STRING,
+        ScalarFunction::UnaryExecFunction<timestamp_t, ku_string_t, MonthName>));
+    return result;
+}
+
+function_set CurrentDateFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{},
+        LogicalTypeID::DATE, ScalarFunction::NullaryAuxilaryExecFunction<date_t, CurrentDate>));
+    return result;
+}
+
+function_set CurrentTimestampFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(
+        make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{}, LogicalTypeID::TIMESTAMP,
+            ScalarFunction::NullaryAuxilaryExecFunction<timestamp_tz_t, CurrentTimestamp>));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_hash_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_hash_functions.cpp
new file mode 100644
index 0000000000..2a9eb268b9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_hash_functions.cpp
@@ -0,0 +1,256 @@
+#include "function/hash/vector_hash_functions.h"
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/system_config.h"
+#include "common/type_utils.h"
+#include "function/hash/hash_functions.h"
+#include "function/scalar_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+template<typename OPERAND_TYPE, typename RESULT_TYPE>
+static void executeOnValue(const ValueVector& operand, sel_t operandPos, ValueVector& result,
+    sel_t resultPos) {
+    Hash::operation(operand.getValue<OPERAND_TYPE>(operandPos),
+        result.getValue<RESULT_TYPE>(resultPos));
+}
+
+template<typename OPERAND_TYPE, typename RESULT_TYPE>
+void UnaryHashFunctionExecutor::execute(const ValueVector& operand,
+    const SelectionView& operandSelectVec, ValueVector& result,
+    const SelectionView& resultSelectVec) {
+    auto resultValues = (RESULT_TYPE*)result.getData();
+    if (operand.hasNoNullsGuarantee()) {
+        if (operandSelectVec.isUnfiltered()) {
+            for (auto i = 0u; i < operandSelectVec.getSelSize(); i++) {
+                auto resultPos = resultSelectVec[i];
+                executeOnValue<OPERAND_TYPE, RESULT_TYPE>(operand, i, result, resultPos);
+            }
+        } else {
+            for (auto i = 0u; i < operandSelectVec.getSelSize(); i++) {
+                auto operandPos = operandSelectVec[i];
+                auto resultPos = resultSelectVec[i];
+                Hash::operation(operand.getValue<OPERAND_TYPE>(operandPos),
+                    resultValues[resultPos]);
+            }
+        }
+    } else {
+        if (operandSelectVec.isUnfiltered()) {
+            for (auto i = 0u; i < operandSelectVec.getSelSize(); i++) {
+                auto resultPos = resultSelectVec[i];
+                if (!operand.isNull(i)) {
+                    Hash::operation(operand.getValue<OPERAND_TYPE>(i), resultValues[resultPos]);
+                } else {
+                    result.setValue(resultPos, NULL_HASH);
+                }
+            }
+        } else {
+            for (auto i = 0u; i < operandSelectVec.getSelSize(); i++) {
+                auto operandPos = operandSelectVec[i];
+                auto resultPos = resultSelectVec[i];
+                if (!operand.isNull(operandPos)) {
+                    Hash::operation(operand.getValue<OPERAND_TYPE>(operandPos),
+                        resultValues[resultPos]);
+                } else {
+                    result.setValue(resultPos, NULL_HASH);
+                }
+            }
+        }
+    }
+}
+
+template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+static void executeOnValue(const common::ValueVector& left, common::sel_t leftPos,
+    const common::ValueVector& right, common::sel_t rightPos, common::ValueVector& result,
+    common::sel_t resultPos) {
+    FUNC::operation(left.getValue<LEFT_TYPE>(leftPos), right.getValue<RIGHT_TYPE>(rightPos),
+        result.getValue<RESULT_TYPE>(resultPos));
+}
+
+static void validateSelState(const SelectionView& leftSelVec, const SelectionView& rightSelVec,
+    const SelectionView& resultSelVec) {
+    auto leftSelSize = leftSelVec.getSelSize();
+    auto rightSelSize = rightSelVec.getSelSize();
+    auto resultSelSize = resultSelVec.getSelSize();
+    (void)resultSelSize;
+    if (leftSelSize > 1 && rightSelSize > 1) {
+        KU_ASSERT(leftSelSize == rightSelSize);
+        KU_ASSERT(leftSelSize == resultSelSize);
+    } else if (leftSelSize > 1) {
+        KU_ASSERT(leftSelSize == resultSelSize);
+    } else if (rightSelSize > 1) {
+        KU_ASSERT(rightSelSize == resultSelSize);
+    }
+}
+
+template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+void BinaryHashFunctionExecutor::execute(const common::ValueVector& left,
+    const SelectionView& leftSelVec, const common::ValueVector& right,
+    const SelectionView& rightSelVec, common::ValueVector& result,
+    const SelectionView& resultSelVec) {
+    validateSelState(leftSelVec, rightSelVec, resultSelVec);
+    result.resetAuxiliaryBuffer();
+    if (leftSelVec.getSelSize() != 1 && rightSelVec.getSelSize() != 1) {
+        for (auto i = 0u; i < leftSelVec.getSelSize(); i++) {
+            auto leftPos = leftSelVec[i];
+            auto rightPos = rightSelVec[i];
+            auto resultPos = resultSelVec[i];
+            executeOnValue<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC>(left, leftPos, right, rightPos,
+                result, resultPos);
+        }
+    } else if (leftSelVec.getSelSize() == 1) {
+        auto leftPos = leftSelVec[0];
+        for (auto i = 0u; i < rightSelVec.getSelSize(); i++) {
+            auto rightPos = rightSelVec[i];
+            auto resultPos = resultSelVec[i];
+            executeOnValue<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC>(left, leftPos, right, rightPos,
+                result, resultPos);
+        }
+    } else {
+        auto rightPos = rightSelVec[0];
+        for (auto i = 0u; i < leftSelVec.getSelSize(); i++) {
+            auto leftPos = leftSelVec[i];
+            auto resultPos = resultSelVec[i];
+            executeOnValue<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC>(left, leftPos, right, rightPos,
+                result, resultPos);
+        }
+    }
+}
+
+static std::unique_ptr<ValueVector> computeDataVecHash(const ValueVector& operand) {
+    auto hashVector = std::make_unique<ValueVector>(LogicalType::LIST(LogicalType::HASH()));
+    auto numValuesInDataVec = ListVector::getDataVectorSize(&operand);
+    ListVector::resizeDataVector(hashVector.get(), numValuesInDataVec);
+    // TODO(Ziyi): Allow selection size to be greater than default vector capacity, so we don't have
+    // to chunk the selectionVector.
+    SelectionVector selectionVector{DEFAULT_VECTOR_CAPACITY};
+    selectionVector.setToFiltered();
+    auto numValuesComputed = 0u;
+    uint64_t numValuesToComputeHash = 0;
+    while (numValuesComputed < numValuesInDataVec) {
+        numValuesToComputeHash =
+            std::min(DEFAULT_VECTOR_CAPACITY, numValuesInDataVec - numValuesComputed);
+        for (auto i = 0u; i < numValuesToComputeHash; i++) {
+            selectionVector[i] = numValuesComputed;
+            numValuesComputed++;
+        }
+        selectionVector.setSelSize(numValuesToComputeHash);
+        VectorHashFunction::computeHash(*ListVector::getDataVector(&operand), selectionVector,
+            *ListVector::getDataVector(hashVector.get()), selectionVector);
+    }
+    return hashVector;
+}
+
+static void finalizeDataVecHash(const ValueVector& operand, const SelectionView& operandSelVec,
+    ValueVector& result, const SelectionView& resultSelVec, ValueVector& tmpHashVec) {
+    for (auto i = 0u; i < operandSelVec.getSelSize(); i++) {
+        auto pos = operandSelVec[i];
+        auto resultPos = resultSelVec[i];
+        auto entry = operand.getValue<list_entry_t>(pos);
+        if (operand.isNull(pos)) {
+            result.setValue(resultPos, NULL_HASH);
+        } else {
+            auto hashValue = NULL_HASH;
+            for (auto j = 0u; j < entry.size; j++) {
+                hashValue = combineHashScalar(hashValue,
+                    ListVector::getDataVector(&tmpHashVec)->getValue<hash_t>(entry.offset + j));
+            }
+            result.setValue(resultPos, hashValue);
+        }
+    }
+}
+
+static void computeListVectorHash(const ValueVector& operand, const SelectionView& operandSelectVec,
+    ValueVector& result, const SelectionView& resultSelectVec) {
+    auto dataVecHash = computeDataVecHash(operand);
+    finalizeDataVecHash(operand, operandSelectVec, result, resultSelectVec, *dataVecHash);
+}
+
+static void computeStructVecHash(const ValueVector& operand, const SelectionView& operandSelVec,
+    ValueVector& result, const SelectionView& resultSelVec) {
+    switch (operand.dataType.getLogicalTypeID()) {
+    case LogicalTypeID::NODE: {
+        KU_ASSERT(0 == common::StructType::getFieldIdx(operand.dataType, InternalKeyword::ID));
+        UnaryHashFunctionExecutor::execute<internalID_t, hash_t>(
+            *StructVector::getFieldVector(&operand, 0), operandSelVec, result, resultSelVec);
+    } break;
+    case LogicalTypeID::REL: {
+        KU_ASSERT(3 == StructType::getFieldIdx(operand.dataType, InternalKeyword::ID));
+        UnaryHashFunctionExecutor::execute<internalID_t, hash_t>(
+            *StructVector::getFieldVector(&operand, 3), operandSelVec, result, resultSelVec);
+    } break;
+    case LogicalTypeID::RECURSIVE_REL:
+    case LogicalTypeID::UNION:
+    case LogicalTypeID::STRUCT: {
+        VectorHashFunction::computeHash(*StructVector::getFieldVector(&operand, 0 /* idx */),
+            operandSelVec, result, resultSelVec);
+        auto tmpHashVector = std::make_unique<ValueVector>(LogicalType::HASH());
+        SelectionView tmpSel(resultSelVec.getSelSize());
+        for (auto i = 1u; i < StructType::getNumFields(operand.dataType); i++) {
+            auto fieldVector = StructVector::getFieldVector(&operand, i);
+            VectorHashFunction::computeHash(*fieldVector, operandSelVec, *tmpHashVector, tmpSel);
+            VectorHashFunction::combineHash(*tmpHashVector, tmpSel, result, resultSelVec, result,
+                resultSelVec);
+        }
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void VectorHashFunction::computeHash(const ValueVector& operand,
+    const SelectionView& operandSelectVec, ValueVector& result,
+    const SelectionView& resultSelectVec) {
+    result.state = operand.state;
+    KU_ASSERT(result.dataType.getLogicalTypeID() == LogicalType::HASH().getLogicalTypeID());
+    TypeUtils::visit(
+        operand.dataType.getPhysicalType(),
+        [&]<HashableNonNestedTypes T>(T) {
+            UnaryHashFunctionExecutor::execute<T, hash_t>(operand, operandSelectVec, result,
+                resultSelectVec);
+        },
+        [&](struct_entry_t) {
+            computeStructVecHash(operand, operandSelectVec, result, resultSelectVec);
+        },
+        [&](list_entry_t) {
+            computeListVectorHash(operand, operandSelectVec, result, resultSelectVec);
+        },
+        [&operand](auto) {
+            // LCOV_EXCL_START
+            throw RuntimeException("Cannot hash data type " + operand.dataType.toString());
+            // LCOV_EXCL_STOP
+        });
+}
+
+void VectorHashFunction::combineHash(const ValueVector& left, const SelectionView& leftSelVec,
+    const ValueVector& right, const SelectionView& rightSelVec, ValueVector& result,
+    const SelectionView& resultSelVec) {
+    KU_ASSERT(left.dataType.getLogicalTypeID() == LogicalType::HASH().getLogicalTypeID());
+    KU_ASSERT(left.dataType.getLogicalTypeID() == right.dataType.getLogicalTypeID());
+    KU_ASSERT(left.dataType.getLogicalTypeID() == result.dataType.getLogicalTypeID());
+    BinaryHashFunctionExecutor::execute<hash_t, hash_t, hash_t, CombineHash>(left, leftSelVec,
+        right, rightSelVec, result, resultSelVec);
+}
+
+static void HashExecFunc(const std::vector<std::shared_ptr<common::ValueVector>>& params,
+    const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+    common::SelectionVector*, void* /*dataPtr*/ = nullptr) {
+    KU_ASSERT(params.size() == 1);
+    // TODO(Ziyi): evaluators should resolve the state for result vector.
+    result.state = params[0]->state;
+    VectorHashFunction::computeHash(*params[0], *paramSelVectors[0], result,
+        result.state->getSelVectorUnsafe());
+}
+
+function_set HashFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.push_back(std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::ANY}, LogicalTypeID::UINT64, HashExecFunc));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_node_rel_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_node_rel_functions.cpp
new file mode 100644
index 0000000000..5423f87101
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_node_rel_functions.cpp
@@ -0,0 +1,29 @@
+#include "function/schema/vector_node_rel_functions.h"
+
+#include "common/vector/value_vector.h"
+#include "function/scalar_function.h"
+#include "function/schema/offset_functions.h"
+#include "function/unary_function_executor.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& params,
+    const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* /*dataPtr*/ = nullptr) {
+    KU_ASSERT(params.size() == 1);
+    UnaryFunctionExecutor::execute<internalID_t, int64_t, Offset>(*params[0], paramSelVectors[0],
+        result, resultSelVector);
+}
+
+function_set OffsetFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::INTERNAL_ID}, LogicalTypeID::INT64, execFunc));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_null_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_null_functions.cpp
new file mode 100644
index 0000000000..5ef0d3e71c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_null_functions.cpp
@@ -0,0 +1,50 @@
+#include "function/null/vector_null_functions.h"
+
+#include "common/exception/runtime.h"
+#include "function/null/null_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+void VectorNullFunction::bindExecFunction(ExpressionType expressionType,
+    const binder::expression_vector& /*children*/, scalar_func_exec_t& func) {
+    switch (expressionType) {
+    case ExpressionType::IS_NULL: {
+        func = UnaryNullExecFunction<IsNull>;
+        return;
+    }
+    case ExpressionType::IS_NOT_NULL: {
+        func = UnaryNullExecFunction<IsNotNull>;
+        return;
+    }
+    default:
+        throw RuntimeException("Invalid expression type " +
+                               ExpressionTypeUtil::toString(expressionType) +
+                               "for VectorNullOperations::bindUnaryExecFunction.");
+    }
+}
+
+void VectorNullFunction::bindSelectFunction(ExpressionType expressionType,
+    const binder::expression_vector& children, scalar_func_select_t& func) {
+    KU_ASSERT(children.size() == 1);
+    (void)children;
+    switch (expressionType) {
+    case ExpressionType::IS_NULL: {
+        func = UnaryNullSelectFunction<IsNull>;
+        return;
+    }
+    case ExpressionType::IS_NOT_NULL: {
+        func = UnaryNullSelectFunction<IsNotNull>;
+        return;
+    }
+    default:
+        throw RuntimeException("Invalid expression type " +
+                               ExpressionTypeUtil::toString(expressionType) +
+                               "for VectorNullOperations::bindUnarySelectFunction.");
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_string_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_string_functions.cpp
new file mode 100644
index 0000000000..2643298e07
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_string_functions.cpp
@@ -0,0 +1,304 @@
+#include "function/string/vector_string_functions.h"
+
+#include "function/string/functions/array_extract_function.h"
+#include "function/string/functions/contains_function.h"
+#include "function/string/functions/ends_with_function.h"
+#include "function/string/functions/left_operation.h"
+#include "function/string/functions/lpad_function.h"
+#include "function/string/functions/regexp_extract_all_function.h"
+#include "function/string/functions/regexp_extract_function.h"
+#include "function/string/functions/regexp_matches_function.h"
+#include "function/string/functions/regexp_split_to_array_function.h"
+#include "function/string/functions/repeat_function.h"
+#include "function/string/functions/right_function.h"
+#include "function/string/functions/rpad_function.h"
+#include "function/string/functions/starts_with_function.h"
+#include "function/string/functions/substr_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+void BaseLowerUpperFunction::operation(ku_string_t& input, ku_string_t& result,
+    ValueVector& resultValueVector, bool isUpper) {
+    uint32_t resultLen = getResultLen((char*)input.getData(), input.len, isUpper);
+    result.len = resultLen;
+    if (resultLen <= ku_string_t::SHORT_STR_LENGTH) {
+        convertCase((char*)result.prefix, input.len, (char*)input.getData(), isUpper);
+    } else {
+        StringVector::reserveString(&resultValueVector, result, resultLen);
+        auto buffer = reinterpret_cast<char*>(result.overflowPtr);
+        convertCase(buffer, input.len, (char*)input.getData(), isUpper);
+        memcpy(result.prefix, buffer, ku_string_t::PREFIX_LENGTH);
+    }
+}
+
+void BaseStrOperation::operation(ku_string_t& input, ku_string_t& result,
+    ValueVector& resultValueVector, uint32_t (*strOperation)(char* data, uint32_t len)) {
+    if (input.len <= ku_string_t::SHORT_STR_LENGTH) {
+        memcpy(result.prefix, input.prefix, input.len);
+        result.len = strOperation((char*)result.prefix, input.len);
+    } else {
+        StringVector::reserveString(&resultValueVector, result, input.len);
+        auto buffer = reinterpret_cast<char*>(result.overflowPtr);
+        memcpy(buffer, input.getData(), input.len);
+        result.len = strOperation(buffer, input.len);
+        memcpy(result.prefix, buffer,
+            result.len < ku_string_t::PREFIX_LENGTH ? result.len : ku_string_t::PREFIX_LENGTH);
+    }
+}
+
+void Repeat::operation(ku_string_t& left, int64_t& right, ku_string_t& result,
+    ValueVector& resultValueVector) {
+    result.len = left.len * right;
+    if (result.len <= ku_string_t::SHORT_STR_LENGTH) {
+        repeatStr((char*)result.prefix, left.getAsString(), right);
+    } else {
+        StringVector::reserveString(&resultValueVector, result, result.len);
+        auto buffer = reinterpret_cast<char*>(result.overflowPtr);
+        repeatStr(buffer, left.getAsString(), right);
+        memcpy(result.prefix, buffer, ku_string_t::PREFIX_LENGTH);
+    }
+}
+
+void Reverse::operation(ku_string_t& input, ku_string_t& result, ValueVector& resultValueVector) {
+    bool isAscii = true;
+    std::string inputStr = input.getAsString();
+    for (uint32_t i = 0; i < input.len; i++) {
+        if (inputStr[i] & 0x80) {
+            isAscii = false;
+            break;
+        }
+    }
+    if (isAscii) {
+        BaseStrOperation::operation(input, result, resultValueVector, reverseStr);
+    } else {
+        result.len = input.len;
+        if (result.len > ku_string_t::SHORT_STR_LENGTH) {
+            StringVector::reserveString(&resultValueVector, result, input.len);
+        }
+        auto resultBuffer = result.len <= ku_string_t::SHORT_STR_LENGTH ?
+                                reinterpret_cast<char*>(result.prefix) :
+                                reinterpret_cast<char*>(result.overflowPtr);
+        utf8proc::utf8proc_grapheme_callback(inputStr.c_str(), input.len,
+            [&](size_t start, size_t end) {
+                memcpy(resultBuffer + input.len - end, input.getData() + start, end - start);
+                return true;
+            });
+        if (result.len > ku_string_t::SHORT_STR_LENGTH) {
+            memcpy(result.prefix, resultBuffer, ku_string_t::PREFIX_LENGTH);
+        }
+    }
+}
+
+function_set ArrayExtractFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64},
+        LogicalTypeID::STRING,
+        ScalarFunction::BinaryExecFunction<ku_string_t, int64_t, ku_string_t, ArrayExtract>));
+    return functionSet;
+}
+
+void ConcatFunction::execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+    const std::vector<common::SelectionVector*>& parameterSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* /*dataPtr*/) {
+    result.resetAuxiliaryBuffer();
+    for (auto selectedPos = 0u; selectedPos < resultSelVector->getSelSize(); ++selectedPos) {
+        auto pos = (*resultSelVector)[selectedPos];
+        auto strLen = 0u;
+        for (auto i = 0u; i < parameters.size(); i++) {
+            const auto& parameter = *parameters[i];
+            const auto& parameterSelVector = parameterSelVectors[i];
+            auto paramPos = (*parameterSelVector)[parameter.state->isFlat() ? 0 : selectedPos];
+            if (!parameter.isNull(paramPos)) {
+                strLen += parameter.getValue<ku_string_t>(paramPos).len;
+            }
+        }
+        auto& resultStr = result.getValue<ku_string_t>(pos);
+        StringVector::reserveString(&result, resultStr, strLen);
+        auto dstData = strLen <= ku_string_t::SHORT_STR_LENGTH ?
+                           resultStr.prefix :
+                           reinterpret_cast<uint8_t*>(resultStr.overflowPtr);
+        for (auto i = 0u; i < parameters.size(); i++) {
+            const auto& parameter = *parameters[i];
+            const auto& parameterSelVector = parameterSelVectors[i];
+            auto paramPos = (*parameterSelVector)[parameter.state->isFlat() ? 0 : selectedPos];
+            if (!parameter.isNull(paramPos)) {
+                auto srcStr = parameter.getValue<ku_string_t>(paramPos);
+                memcpy(dstData, srcStr.getData(), srcStr.len);
+                dstData += srcStr.len;
+            }
+        }
+        if (strLen > ku_string_t::SHORT_STR_LENGTH) {
+            memcpy(resultStr.prefix, resultStr.getData(), ku_string_t::PREFIX_LENGTH);
+        }
+    }
+}
+
+function_set ConcatFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING}, LogicalTypeID::STRING, execFunc);
+    function->isVarLength = true;
+    functionSet.emplace_back(std::move(function));
+    return functionSet;
+}
+
+function_set ContainsFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::BOOL,
+        ScalarFunction::BinaryExecFunction<ku_string_t, ku_string_t, uint8_t, Contains>,
+        ScalarFunction::BinarySelectFunction<ku_string_t, ku_string_t, Contains>));
+    return functionSet;
+}
+
+function_set EndsWithFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::BOOL,
+        ScalarFunction::BinaryExecFunction<ku_string_t, ku_string_t, uint8_t, EndsWith>,
+        ScalarFunction::BinarySelectFunction<ku_string_t, ku_string_t, EndsWith>));
+    return functionSet;
+}
+
+function_set LeftFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64},
+        LogicalTypeID::STRING,
+        ScalarFunction::BinaryStringExecFunction<ku_string_t, int64_t, ku_string_t, Left>));
+    return functionSet;
+}
+
+function_set LpadFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64,
+            LogicalTypeID::STRING},
+        LogicalTypeID::STRING,
+        ScalarFunction::TernaryStringExecFunction<ku_string_t, int64_t, ku_string_t, ku_string_t,
+            Lpad>));
+    return functionSet;
+}
+
+function_set RepeatFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64},
+        LogicalTypeID::STRING,
+        ScalarFunction::BinaryStringExecFunction<ku_string_t, int64_t, ku_string_t, Repeat>));
+    return functionSet;
+}
+
+function_set RightFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64},
+        LogicalTypeID::STRING,
+        ScalarFunction::BinaryStringExecFunction<ku_string_t, int64_t, ku_string_t, Right>));
+    return functionSet;
+}
+
+function_set RpadFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64,
+            LogicalTypeID::STRING},
+        LogicalTypeID::STRING,
+        ScalarFunction::TernaryStringExecFunction<ku_string_t, int64_t, ku_string_t, ku_string_t,
+            Rpad>));
+    return functionSet;
+}
+
+function_set StartsWithFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::BOOL,
+        ScalarFunction::BinaryExecFunction<ku_string_t, ku_string_t, uint8_t, StartsWith>,
+        ScalarFunction::BinarySelectFunction<ku_string_t, ku_string_t, StartsWith>));
+    return functionSet;
+}
+
+function_set SubStrFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::INT64,
+            LogicalTypeID::INT64},
+        LogicalTypeID::STRING,
+        ScalarFunction::TernaryStringExecFunction<ku_string_t, int64_t, int64_t, ku_string_t,
+            SubStr>));
+    return functionSet;
+}
+
+function_set RegexpMatchesFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::BOOL,
+        ScalarFunction::BinaryExecFunction<ku_string_t, ku_string_t, uint8_t, RegexpMatches>,
+        ScalarFunction::BinarySelectFunction<ku_string_t, ku_string_t, RegexpMatches>));
+    return functionSet;
+}
+
+function_set RegexpExtractFunction::getFunctionSet() {
+    function_set functionSet;
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::STRING,
+        ScalarFunction::BinaryStringExecFunction<ku_string_t, ku_string_t, ku_string_t,
+            RegexpExtract>));
+    functionSet.emplace_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING,
+            LogicalTypeID::INT64},
+        LogicalTypeID::STRING,
+        ScalarFunction::TernaryStringExecFunction<ku_string_t, ku_string_t, int64_t, ku_string_t,
+            RegexpExtract>));
+    return functionSet;
+}
+
+static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput /* input */
+        &) {
+    return std::make_unique<FunctionBindData>(LogicalType::LIST(LogicalType::STRING()));
+}
+
+function_set RegexpExtractAllFunction::getFunctionSet() {
+    function_set functionSet;
+    std::unique_ptr<ScalarFunction> func;
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::LIST,
+        ScalarFunction::BinaryStringExecFunction<ku_string_t, ku_string_t, list_entry_t,
+            RegexpExtractAll>);
+    func->bindFunc = bindFunc;
+    functionSet.emplace_back(std::move(func));
+    func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING,
+            LogicalTypeID::INT64},
+        LogicalTypeID::LIST,
+        ScalarFunction::TernaryStringExecFunction<ku_string_t, ku_string_t, int64_t, list_entry_t,
+            RegexpExtractAll>);
+    func->bindFunc = bindFunc;
+    functionSet.emplace_back(std::move(func));
+    return functionSet;
+}
+
+function_set RegexpSplitToArrayFunction::getFunctionSet() {
+    function_set functionSet;
+    auto func = std::make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::STRING, LogicalTypeID::STRING},
+        LogicalTypeID::LIST,
+        ScalarFunction::BinaryStringExecFunction<ku_string_t, ku_string_t, list_entry_t,
+            RegexpSplitToArray>);
+    func->bindFunc = bindFunc;
+    functionSet.emplace_back(std::move(func));
+    return functionSet;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_timestamp_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_timestamp_functions.cpp
new file mode 100644
index 0000000000..9935487acf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_timestamp_functions.cpp
@@ -0,0 +1,36 @@
+#include "function/timestamp/vector_timestamp_functions.h"
+
+#include "function/scalar_function.h"
+#include "function/timestamp/timestamp_function.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+function_set CenturyFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::TIMESTAMP}, LogicalTypeID::INT64,
+        ScalarFunction::UnaryExecFunction<timestamp_t, int64_t, Century>));
+    return result;
+}
+
+function_set EpochMsFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::INT64}, LogicalTypeID::TIMESTAMP,
+        ScalarFunction::UnaryExecFunction<int64_t, timestamp_t, EpochMs>));
+    return result;
+}
+
+function_set ToTimestampFunction::getFunctionSet() {
+    function_set result;
+    result.push_back(make_unique<ScalarFunction>(name,
+        std::vector<LogicalTypeID>{LogicalTypeID::DOUBLE}, LogicalTypeID::TIMESTAMP,
+        ScalarFunction::UnaryExecFunction<double, timestamp_t, ToTimestamp>));
+    return result;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_uuid_functions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_uuid_functions.cpp
new file mode 100644
index 0000000000..dd4b6895f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/function/vector_uuid_functions.cpp
@@ -0,0 +1,20 @@
+#include "function/uuid/vector_uuid_functions.h"
+
+#include "function/scalar_function.h"
+#include "function/uuid/functions/gen_random_uuid.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+function_set GenRandomUUIDFunction::getFunctionSet() {
+    function_set definitions;
+    definitions.push_back(
+        make_unique<ScalarFunction>(name, std::vector<LogicalTypeID>{}, LogicalTypeID::UUID,
+            ScalarFunction::NullaryAuxilaryExecFunction<ku_uuid_t, GenRandomUUID>));
+    return definitions;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/graph/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/CMakeLists.txt
new file mode 100644
index 0000000000..4f4341af51
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/CMakeLists.txt
@@ -0,0 +1,11 @@
+add_library(lbug_graph
+        OBJECT
+        graph.cpp
+        graph_entry.cpp
+        graph_entry_set.cpp
+        on_disk_graph.cpp
+        parsed_graph_entry.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_graph>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/graph/graph.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/graph.cpp
new file mode 100644
index 0000000000..081e31f0d4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/graph.cpp
@@ -0,0 +1,18 @@
+#include "graph/graph.h"
+
+#include "common/system_config.h"
+
+namespace lbug::graph {
+NbrScanState::Chunk::Chunk(std::span<const common::nodeID_t> nbrNodes,
+    common::SelectionVector& selVector,
+    std::span<const std::shared_ptr<common::ValueVector>> propertyVectors)
+    : nbrNodes{nbrNodes}, selVector{selVector}, propertyVectors{propertyVectors} {
+    KU_ASSERT(nbrNodes.size() == common::DEFAULT_VECTOR_CAPACITY);
+}
+
+VertexScanState::Chunk::Chunk(std::span<const common::nodeID_t> nodeIDs,
+    std::span<const std::shared_ptr<common::ValueVector>> propertyVectors)
+    : nodeIDs{nodeIDs}, propertyVectors{propertyVectors} {
+    KU_ASSERT(nodeIDs.size() <= common::DEFAULT_VECTOR_CAPACITY);
+}
+} // namespace lbug::graph
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/graph/graph_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/graph_entry.cpp
new file mode 100644
index 0000000000..fc08c58119
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/graph_entry.cpp
@@ -0,0 +1,59 @@
+#include "graph/graph_entry.h"
+
+#include "common/exception/runtime.h"
+
+using namespace lbug::planner;
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace graph {
+
+NativeGraphEntry::NativeGraphEntry(std::vector<TableCatalogEntry*> nodeEntries,
+    std::vector<TableCatalogEntry*> relEntries) {
+    for (auto& entry : nodeEntries) {
+        nodeInfos.emplace_back(entry);
+    }
+    for (auto& entry : relEntries) {
+        relInfos.emplace_back(entry);
+    }
+}
+
+std::vector<table_id_t> NativeGraphEntry::getNodeTableIDs() const {
+    std::vector<table_id_t> result;
+    for (auto& info : nodeInfos) {
+        result.push_back(info.entry->getTableID());
+    }
+    return result;
+}
+
+std::vector<TableCatalogEntry*> NativeGraphEntry::getRelEntries() const {
+    std::vector<TableCatalogEntry*> result;
+    for (auto& info : relInfos) {
+        result.push_back(info.entry);
+    }
+    return result;
+}
+
+std::vector<TableCatalogEntry*> NativeGraphEntry::getNodeEntries() const {
+    std::vector<TableCatalogEntry*> result;
+    for (auto& info : nodeInfos) {
+        result.push_back(info.entry);
+    }
+    return result;
+}
+
+const NativeGraphEntryTableInfo& NativeGraphEntry::getRelInfo(table_id_t tableID) const {
+    for (auto& info : relInfos) {
+        if (info.entry->getTableID() == tableID) {
+            return info;
+        }
+    }
+    // LCOV_EXCL_START
+    throw RuntimeException(stringFormat("Cannot find rel table with id {}", tableID));
+    // LCOV_EXCL_STOP
+}
+
+} // namespace graph
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/graph/graph_entry_set.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/graph_entry_set.cpp
new file mode 100644
index 0000000000..049216647d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/graph_entry_set.cpp
@@ -0,0 +1,29 @@
+#include "graph/graph_entry_set.h"
+
+#include "common/exception/runtime.h"
+#include "common/string_format.h"
+#include "main/client_context.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace graph {
+
+void GraphEntrySet::validateGraphNotExist(const std::string& name) const {
+    if (hasGraph(name)) {
+        throw RuntimeException(stringFormat("Projected graph {} already exists.", name));
+    }
+}
+
+void GraphEntrySet::validateGraphExist(const std::string& name) const {
+    if (!hasGraph(name)) {
+        throw RuntimeException(stringFormat("Projected graph {} does not exists.", name));
+    }
+}
+
+GraphEntrySet* GraphEntrySet::Get(const main::ClientContext& context) {
+    return context.graphEntrySet.get();
+}
+
+} // namespace graph
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/graph/on_disk_graph.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/on_disk_graph.cpp
new file mode 100644
index 0000000000..5ca7f4762c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/on_disk_graph.cpp
@@ -0,0 +1,350 @@
+#include "graph/on_disk_graph.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/expression/property_expression.h"
+#include "binder/expression_visitor.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "common/assert.h"
+#include "common/cast.h"
+#include "common/data_chunk/data_chunk_state.h"
+#include "common/enums/rel_direction.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "expression_evaluator/expression_evaluator.h"
+#include "graph/graph.h"
+#include "planner/operator/schema.h"
+#include "processor/expression_mapper.h"
+#include "storage/local_storage/local_rel_table.h"
+#include "storage/local_storage/local_storage.h"
+#include "storage/storage_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+
+using namespace lbug::catalog;
+using namespace lbug::storage;
+using namespace lbug::main;
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::processor;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace graph {
+
+static std::vector<column_id_t> getColumnIDs(const expression_vector& propertyExprs,
+    const TableCatalogEntry& relEntry, const std::vector<column_id_t>& propertyColumnIDs) {
+    auto columnIDs = std::vector{NBR_ID_COLUMN_ID};
+    for (auto columnID : propertyColumnIDs) {
+        columnIDs.push_back(columnID);
+    }
+    for (const auto& expr : propertyExprs) {
+        auto& property = expr->constCast<PropertyExpression>();
+        if (property.hasProperty(relEntry.getTableID())) {
+            columnIDs.push_back(relEntry.getColumnID(property.getPropertyName()));
+        } else {
+            columnIDs.push_back(INVALID_COLUMN_ID);
+        }
+    }
+    return columnIDs;
+}
+
+static expression_vector getProperties(std::shared_ptr<Expression> expr) {
+    if (expr == nullptr) {
+        return expression_vector{};
+    }
+    auto collector = PropertyExprCollector();
+    collector.visit(std::move(expr));
+    return ExpressionUtil::removeDuplication(collector.getPropertyExprs());
+}
+
+// We generate an empty schema with one group even if exprs is empty because we always need to
+// scan edgeID and nbrNodeID which will need the state of empty data chunk.
+static Schema getSchema(const expression_vector& exprs) {
+    auto schema = Schema();
+    schema.createGroup();
+    for (auto expr : exprs) {
+        schema.insertToGroupAndScope(expr, 0);
+    }
+    return schema;
+}
+
+static ResultSet getResultSet(Schema* schema, MemoryManager* mm) {
+    auto descriptor = ResultSetDescriptor(schema);
+    return ResultSet(&descriptor, mm);
+}
+
+static std::unique_ptr<ValueVector> getValueVector(const LogicalType& type, MemoryManager* mm,
+    std::shared_ptr<DataChunkState> state) {
+    auto vector = std::make_unique<ValueVector>(type.copy(), mm);
+    vector->state = std::move(state);
+    return vector;
+}
+
+OnDiskGraphNbrScanState::OnDiskGraphNbrScanState(ClientContext* context,
+    const TableCatalogEntry& entry, oid_t relTableID, std::shared_ptr<Expression> predicate)
+    : OnDiskGraphNbrScanState{context, entry, relTableID, std::move(predicate), {}} {}
+
+OnDiskGraphNbrScanState::OnDiskGraphNbrScanState(ClientContext* context,
+    const TableCatalogEntry& entry, oid_t relTableID, std::shared_ptr<Expression> predicate,
+    std::vector<std::string> relProperties, bool randomLookup) {
+    auto predicateProps = getProperties(predicate);
+    auto schema = getSchema(predicateProps);
+    auto mm = MemoryManager::Get(*context);
+    auto resultSet = getResultSet(&schema, mm);
+    KU_ASSERT(resultSet.dataChunks.size() == 1);
+    auto state = resultSet.getDataChunk(0)->state;
+    srcNodeIDVector = getValueVector(LogicalType::INTERNAL_ID(), mm, state);
+    srcNodeIDVector->state = DataChunkState::getSingleValueDataChunkState();
+    dstNodeIDVector = getValueVector(LogicalType::INTERNAL_ID(), mm, state);
+    propertyVectors.valueVectors.resize(relProperties.size());
+    // TODO(bmwinger): If there are both a predicate and a custom edgePropertyIndex, they will
+    // currently be scanned twice. The propertyVector could simply be one of the vectors used
+    // for the predicate.
+    std::vector<column_id_t> relPropertyColumnIDs;
+    relPropertyColumnIDs.resize(relProperties.size());
+    for (auto i = 0u; i < relProperties.size(); ++i) {
+        auto propertyName = relProperties[i];
+        auto& property = entry.getProperty(propertyName);
+        relPropertyColumnIDs[i] = entry.getColumnID(propertyName);
+        KU_ASSERT(relPropertyColumnIDs[i] != INVALID_COLUMN_ID);
+        propertyVectors.valueVectors[i] = getValueVector(property.getType(), mm, state);
+    }
+    if (predicate != nullptr) {
+        auto mapper = ExpressionMapper(&schema);
+        relPredicateEvaluator = mapper.getEvaluator(predicate);
+        relPredicateEvaluator->init(resultSet, context);
+    }
+    auto table = StorageManager::Get(*context)->getTable(relTableID)->ptrCast<RelTable>();
+    for (auto dataDirection : entry.constCast<RelGroupCatalogEntry>().getRelDataDirections()) {
+        auto columnIDs = getColumnIDs(predicateProps, entry, relPropertyColumnIDs);
+        std::vector outVectors{dstNodeIDVector.get()};
+        for (auto i = 0u; i < propertyVectors.getNumValueVectors(); i++) {
+            outVectors.push_back(&propertyVectors.getValueVectorMutable(i));
+        }
+        for (auto& property : predicateProps) {
+            auto pos = DataPos(schema.getExpressionPos(*property));
+            outVectors.push_back(resultSet.getValueVector(pos).get());
+        }
+        auto scanState = std::make_unique<RelTableScanState>(*MemoryManager::Get(*context),
+            srcNodeIDVector.get(), outVectors, dstNodeIDVector->state, randomLookup);
+        scanState->setToTable(transaction::Transaction::Get(*context), table, columnIDs, {},
+            dataDirection);
+        directedIterators.emplace_back(context, table, std::move(scanState));
+    }
+}
+
+OnDiskGraph::OnDiskGraph(ClientContext* context, NativeGraphEntry entry)
+    : context{context}, graphEntry{std::move(entry)} {
+    auto storage = StorageManager::Get(*context);
+    for (const auto& nodeInfo : graphEntry.nodeInfos) {
+        auto id = nodeInfo.entry->getTableID();
+        nodeIDToNodeTable.insert({id, storage->getTable(id)->ptrCast<NodeTable>()});
+    }
+    for (auto& relInfo : graphEntry.relInfos) {
+        auto relGroupEntry = relInfo.entry->ptrCast<RelGroupCatalogEntry>();
+        for (auto& relEntryInfo : relGroupEntry->getRelEntryInfos()) {
+            auto srcTableID = relEntryInfo.nodePair.srcTableID;
+            auto dstTableID = relEntryInfo.nodePair.dstTableID;
+            if (!nodeIDToNodeTable.contains(srcTableID)) {
+                continue;
+            }
+            if (!nodeIDToNodeTable.contains(dstTableID)) {
+                continue;
+            }
+            relInfos.emplace_back(srcTableID, dstTableID, relGroupEntry, relEntryInfo.oid);
+        }
+    }
+}
+
+table_id_map_t<offset_t> OnDiskGraph::getMaxOffsetMap(transaction::Transaction* transaction) const {
+    table_id_map_t<offset_t> result;
+    for (auto tableID : getNodeTableIDs()) {
+        result[tableID] = getMaxOffset(transaction, tableID);
+    }
+    return result;
+}
+
+offset_t OnDiskGraph::getMaxOffset(transaction::Transaction* transaction, table_id_t id) const {
+    KU_ASSERT(nodeIDToNodeTable.contains(id));
+    return nodeIDToNodeTable.at(id)->getNumTotalRows(transaction);
+}
+
+offset_t OnDiskGraph::getNumNodes(transaction::Transaction* transaction) const {
+    offset_t numNodes = 0u;
+    for (auto id : getNodeTableIDs()) {
+        if (nodeOffsetMaskMap != nullptr && nodeOffsetMaskMap->containsTableID(id)) {
+            numNodes += nodeOffsetMaskMap->getOffsetMask(id)->getNumMaskedNodes();
+        } else {
+            numNodes += getMaxOffset(transaction, id);
+        }
+    }
+    return numNodes;
+}
+
+std::vector<GraphRelInfo> OnDiskGraph::getRelInfos(table_id_t srcTableID) {
+    std::vector<GraphRelInfo> result;
+    for (auto& info : relInfos) {
+        if (info.srcTableID == srcTableID) {
+            result.push_back(info);
+        }
+    }
+    return result;
+}
+
+// TODO(Xiyang): since now we need to provide nbr info at prepare stage. It no longer make sense to
+// have scanFwd&scanBwd. The direction has already been decided in this function.
+std::unique_ptr<NbrScanState> OnDiskGraph::prepareRelScan(const TableCatalogEntry& entry,
+    oid_t relTableID, table_id_t nbrTableID, std::vector<std::string> relProperties,
+    bool randomLookup) {
+    auto& info = graphEntry.getRelInfo(entry.getTableID());
+    auto state = std::make_unique<OnDiskGraphNbrScanState>(context, entry, relTableID,
+        info.predicate, relProperties, randomLookup);
+    if (nodeOffsetMaskMap != nullptr && nodeOffsetMaskMap->containsTableID(nbrTableID)) {
+        state->nbrNodeMask = nodeOffsetMaskMap->getOffsetMask(nbrTableID);
+    }
+    return state;
+}
+
+Graph::EdgeIterator OnDiskGraph::scanFwd(nodeID_t nodeID, NbrScanState& state) {
+    auto& onDiskScanState = ku_dynamic_cast<OnDiskGraphNbrScanState&>(state);
+    onDiskScanState.srcNodeIDVector->setValue<nodeID_t>(0, nodeID);
+    onDiskScanState.dstNodeIDVector->state->getSelVectorUnsafe().setSelSize(0);
+    onDiskScanState.startScan(RelDataDirection::FWD);
+    return EdgeIterator(&onDiskScanState);
+}
+
+Graph::EdgeIterator OnDiskGraph::scanBwd(nodeID_t nodeID, NbrScanState& state) {
+    auto& onDiskScanState = ku_dynamic_cast<OnDiskGraphNbrScanState&>(state);
+    onDiskScanState.srcNodeIDVector->setValue<nodeID_t>(0, nodeID);
+    onDiskScanState.dstNodeIDVector->state->getSelVectorUnsafe().setSelSize(0);
+    onDiskScanState.startScan(RelDataDirection::BWD);
+    return EdgeIterator(&onDiskScanState);
+}
+
+Graph::VertexIterator OnDiskGraph::scanVertices(offset_t beginOffset, offset_t endOffsetExclusive,
+    VertexScanState& state) {
+    auto& onDiskVertexScanState = ku_dynamic_cast<OnDiskGraphVertexScanState&>(state);
+    onDiskVertexScanState.startScan(beginOffset, endOffsetExclusive);
+    return VertexIterator(&state);
+}
+
+std::unique_ptr<VertexScanState> OnDiskGraph::prepareVertexScan(TableCatalogEntry* tableEntry,
+    const std::vector<std::string>& propertiesToScan) {
+    return std::make_unique<OnDiskGraphVertexScanState>(*context, tableEntry, propertiesToScan);
+}
+
+bool OnDiskGraphNbrScanState::InnerIterator::next(evaluator::ExpressionEvaluator* predicate,
+    SemiMask* nbrNodeMask_) {
+    bool hasAtLeastOneSelectedValue = false;
+    do {
+        restoreSelVector(*tableScanState->outState);
+        if (!relTable->scan(transaction::Transaction::Get(*context), *tableScanState)) {
+            return false;
+        }
+        saveSelVector(*tableScanState->outState);
+        hasAtLeastOneSelectedValue = tableScanState->outState->getSelVector().getSelSize() > 0;
+        if (predicate != nullptr) {
+            hasAtLeastOneSelectedValue =
+                predicate->select(tableScanState->outState->getSelVectorUnsafe(),
+                    !tableScanState->outState->isFlat());
+        }
+        if (nbrNodeMask_ != nullptr) {
+            auto selectedSize = 0u;
+            auto buffer = tableScanState->outState->getSelVectorUnsafe().getMutableBuffer();
+            for (auto i = 0u; i < tableScanState->outState->getSelSize(); ++i) {
+                auto pos = tableScanState->outState->getSelVector()[i];
+                buffer[selectedSize] = pos;
+                auto nbrNodeID = tableScanState->outputVectors[0]->getValue<nodeID_t>(pos);
+                selectedSize += nbrNodeMask_->isMasked(nbrNodeID.offset);
+            }
+            tableScanState->outState->getSelVectorUnsafe().setToFiltered(selectedSize);
+            hasAtLeastOneSelectedValue = selectedSize > 0;
+        }
+    } while (!hasAtLeastOneSelectedValue);
+    return true;
+}
+
+OnDiskGraphNbrScanState::InnerIterator::InnerIterator(const ClientContext* context,
+    RelTable* relTable, std::unique_ptr<RelTableScanState> tableScanState)
+    : context{context}, relTable{relTable}, tableScanState{std::move(tableScanState)} {}
+
+void OnDiskGraphNbrScanState::InnerIterator::initScan() const {
+    relTable->initScanState(transaction::Transaction::Get(*context), *tableScanState);
+}
+
+void OnDiskGraphNbrScanState::startScan(RelDataDirection direction) {
+    auto idx = RelDirectionUtils::relDirectionToKeyIdx(direction);
+    KU_ASSERT(idx < directedIterators.size() && directedIterators[idx].getDirection() == direction);
+    currentIter = &directedIterators[idx];
+    currentIter->initScan();
+}
+
+bool OnDiskGraphNbrScanState::next() {
+    KU_ASSERT(currentIter != nullptr);
+    if (currentIter->next(relPredicateEvaluator.get(), nbrNodeMask)) {
+        return true;
+    }
+    return false;
+}
+
+OnDiskGraphVertexScanState::OnDiskGraphVertexScanState(ClientContext& context,
+    const TableCatalogEntry* tableEntry, const std::vector<std::string>& propertyNames)
+    : context{context}, nodeTable{ku_dynamic_cast<const NodeTable&>(
+                            *StorageManager::Get(context)->getTable(tableEntry->getTableID()))},
+      numNodesToScan{0}, currentOffset{0}, endOffsetExclusive{0} {
+    std::vector<column_id_t> propertyColumnIDs;
+    propertyColumnIDs.reserve(propertyNames.size());
+    std::vector<LogicalType> types;
+    for (const auto& property : propertyNames) {
+        auto columnID = tableEntry->getColumnID(property);
+        propertyColumnIDs.push_back(columnID);
+        types.push_back(tableEntry->getProperty(property).getType().copy());
+    }
+    propertyVectors = Table::constructDataChunk(MemoryManager::Get(context), std::move(types));
+    nodeIDVector = std::make_unique<ValueVector>(LogicalType::INTERNAL_ID(),
+        MemoryManager::Get(context), propertyVectors.state);
+    std::vector<ValueVector*> outVectors;
+    for (auto i = 0u; i < propertyVectors.getNumValueVectors(); i++) {
+        outVectors.push_back(&propertyVectors.getValueVectorMutable(i));
+    }
+    tableScanState =
+        std::make_unique<NodeTableScanState>(nodeIDVector.get(), outVectors, propertyVectors.state);
+    auto table = StorageManager::Get(context)->getTable(tableEntry->getTableID());
+    tableScanState->setToTable(transaction::Transaction::Get(context), table, propertyColumnIDs);
+}
+
+void OnDiskGraphVertexScanState::startScan(offset_t beginOffset, offset_t endOffsetExclusive) {
+    numNodesToScan = 0;
+    this->currentOffset = beginOffset;
+    this->endOffsetExclusive = endOffsetExclusive;
+    tableScanState->nodeIDVector->getSelVectorPtr()->setToUnfiltered(0);
+    for (auto& vector : tableScanState->outputVectors) {
+        vector->resetAuxiliaryBuffer();
+    }
+    nodeTable.initScanState(transaction::Transaction::Get(context), *tableScanState,
+        nodeTable.getTableID(), beginOffset);
+}
+
+bool OnDiskGraphVertexScanState::next() {
+    if (currentOffset >= endOffsetExclusive) {
+        return false;
+    }
+    startScan(currentOffset, endOffsetExclusive);
+
+    auto startOffsetOfNextGroup =
+        StorageUtils::getStartOffsetOfNodeGroup(tableScanState->nodeGroupIdx + 1);
+    auto transaction = transaction::Transaction::Get(context);
+    auto endOffset = std::min(endOffsetExclusive,
+        tableScanState->source == TableScanSource::COMMITTED ?
+            startOffsetOfNextGroup :
+            startOffsetOfNextGroup + transaction->getUncommittedOffset(
+                                         tableScanState->table->getTableID(), currentOffset));
+    numNodesToScan = std::min(endOffset - currentOffset, DEFAULT_VECTOR_CAPACITY);
+    auto result = tableScanState->scanNext(transaction, currentOffset, numNodesToScan);
+    currentOffset += result.numRows;
+    return result != NODE_GROUP_SCAN_EMPTY_RESULT;
+}
+
+} // namespace graph
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/graph/parsed_graph_entry.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/parsed_graph_entry.cpp
new file mode 100644
index 0000000000..a6713393d6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/graph/parsed_graph_entry.cpp
@@ -0,0 +1,20 @@
+#include "graph/parsed_graph_entry.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace graph {
+
+std::string GraphEntryTypeUtils::toString(GraphEntryType type) {
+    switch (type) {
+    case GraphEntryType::NATIVE:
+        return "NATIVE";
+    case GraphEntryType::CYPHER:
+        return "CYPHER";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace graph
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/binder.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/binder.h
new file mode 100644
index 0000000000..0b305c20d3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/binder.h
@@ -0,0 +1,332 @@
+#pragma once
+
+#include "binder/binder_scope.h"
+#include "binder/expression_binder.h"
+#include "binder/query/bound_regular_query.h"
+#include "binder/query/query_graph.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/copier_config/file_scan_info.h"
+#include "parser/ddl/parsed_property_definition.h"
+#include "parser/query/graph_pattern/pattern_element.h"
+
+namespace lbug {
+namespace extension {
+class BinderExtension;
+}
+
+namespace parser {
+class ProjectionBody;
+class ReturnClause;
+class WithClause;
+class UpdatingClause;
+class ReadingClause;
+class QueryPart;
+class SingleQuery;
+struct CreateTableInfo;
+struct BaseScanSource;
+struct JoinHintNode;
+class Statement;
+struct YieldVariable;
+} // namespace parser
+
+namespace catalog {
+class NodeTableCatalogEntry;
+class RelGroupCatalogEntry;
+class Catalog;
+} // namespace catalog
+
+namespace main {
+class ClientContext;
+class Database;
+} // namespace main
+
+namespace function {
+struct TableFunction;
+} // namespace function
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace binder {
+struct BoundBaseScanSource;
+struct BoundCreateTableInfo;
+struct BoundInsertInfo;
+struct BoundSetPropertyInfo;
+struct BoundDeleteInfo;
+class BoundWithClause;
+class BoundReturnClause;
+struct ExportedTableData;
+struct BoundJoinHintNode;
+struct BoundCopyFromInfo;
+struct BoundTableScanInfo;
+
+// BinderScope keeps track of expressions in scope and their aliases. We maintain the order of
+// expressions in
+
+class Binder {
+    friend class ExpressionBinder;
+
+public:
+    explicit Binder(main::ClientContext* clientContext,
+        std::vector<extension::BinderExtension*> binderExtensions = {})
+        : lastExpressionId{0}, scope{}, expressionBinder{this, clientContext},
+          clientContext{clientContext}, binderExtensions{std::move(binderExtensions)} {}
+
+    LBUG_API std::unique_ptr<BoundStatement> bind(const parser::Statement& statement);
+
+    LBUG_API std::shared_ptr<Expression> createVariable(const std::string& name,
+        const common::LogicalType& dataType);
+    LBUG_API std::shared_ptr<Expression> createInvisibleVariable(const std::string& name,
+        const common::LogicalType& dataType) const;
+    LBUG_API expression_vector createVariables(const std::vector<std::string>& names,
+        const std::vector<common::LogicalType>& types);
+    LBUG_API expression_vector createInvisibleVariables(const std::vector<std::string>& names,
+        const std::vector<common::LogicalType>& types) const;
+
+    std::shared_ptr<Expression> bindWhereExpression(
+        const parser::ParsedExpression& parsedExpression);
+
+    std::shared_ptr<Expression> createVariable(std::string_view name, common::LogicalTypeID typeID);
+    std::shared_ptr<Expression> createVariable(const std::string& name,
+        common::LogicalTypeID logicalTypeID);
+
+    /*** bind DDL ***/
+    BoundCreateTableInfo bindCreateTableInfo(const parser::CreateTableInfo* info);
+    BoundCreateTableInfo bindCreateNodeTableInfo(const parser::CreateTableInfo* info);
+    BoundCreateTableInfo bindCreateRelTableGroupInfo(const parser::CreateTableInfo* info);
+    std::unique_ptr<BoundStatement> bindCreateTable(const parser::Statement& statement);
+    std::unique_ptr<BoundStatement> bindCreateTableAs(const parser::Statement& createTable);
+    std::unique_ptr<BoundStatement> bindCreateType(const parser::Statement& statement) const;
+    std::unique_ptr<BoundStatement> bindCreateSequence(const parser::Statement& statement) const;
+
+    static std::unique_ptr<BoundStatement> bindDrop(const parser::Statement& statement);
+    std::unique_ptr<BoundStatement> bindAlter(const parser::Statement& statement);
+    std::unique_ptr<BoundStatement> bindRenameTable(const parser::Statement& statement) const;
+    std::unique_ptr<BoundStatement> bindAddProperty(const parser::Statement& statement);
+    std::unique_ptr<BoundStatement> bindDropProperty(const parser::Statement& statement) const;
+    std::unique_ptr<BoundStatement> bindRenameProperty(const parser::Statement& statement) const;
+    std::unique_ptr<BoundStatement> bindCommentOn(const parser::Statement& statement) const;
+    std::unique_ptr<BoundStatement> bindAlterFromToConnection(
+        const parser::Statement& statement) const;
+
+    std::vector<PropertyDefinition> bindPropertyDefinitions(
+        const std::vector<parser::ParsedPropertyDefinition>& parsedDefinitions,
+        const std::string& tableName);
+
+    std::unique_ptr<parser::ParsedExpression> resolvePropertyDefault(
+        parser::ParsedExpression* parsedDefault, const common::LogicalType& type,
+        const std::string& tableName, const std::string& propertyName);
+
+    /*** bind copy ***/
+    BoundCopyFromInfo bindCopyNodeFromInfo(std::string tableName,
+        const std::vector<PropertyDefinition>& properties, const parser::BaseScanSource* source,
+        const parser::options_t& parsingOptions,
+        const std::vector<std::string>& expectedColumnNames,
+        const std::vector<common::LogicalType>& expectedColumnTypes, bool byColumn);
+    BoundCopyFromInfo bindCopyRelFromInfo(std::string tableName,
+        const std::vector<PropertyDefinition>& properties, const parser::BaseScanSource* source,
+        const parser::options_t& parsingOptions,
+        const std::vector<std::string>& expectedColumnNames,
+        const std::vector<common::LogicalType>& expectedColumnTypes,
+        const catalog::NodeTableCatalogEntry* fromTable,
+        const catalog::NodeTableCatalogEntry* toTable);
+    std::unique_ptr<BoundStatement> bindCopyFromClause(const parser::Statement& statement);
+    std::unique_ptr<BoundStatement> bindCopyNodeFrom(const parser::Statement& statement,
+        catalog::NodeTableCatalogEntry& nodeEntry);
+    std::unique_ptr<BoundStatement> bindCopyRelFrom(const parser::Statement& statement,
+        catalog::RelGroupCatalogEntry& relGroupEntry, const std::string& fromTableName,
+        const std::string& toTableName);
+    std::unique_ptr<BoundStatement> bindLegacyCopyRelGroupFrom(const parser::Statement& copyFrom);
+
+    std::unique_ptr<BoundStatement> bindCopyToClause(const parser::Statement& statement);
+
+    std::unique_ptr<BoundStatement> bindExportDatabaseClause(const parser::Statement& statement);
+    std::unique_ptr<BoundStatement> bindImportDatabaseClause(const parser::Statement& statement);
+
+    static std::unique_ptr<BoundStatement> bindAttachDatabase(const parser::Statement& statement);
+    static std::unique_ptr<BoundStatement> bindDetachDatabase(const parser::Statement& statement);
+    static std::unique_ptr<BoundStatement> bindUseDatabase(const parser::Statement& statement);
+    std::unique_ptr<BoundStatement> bindExtensionClause(const parser::Statement& statement);
+
+    /*** bind scan source ***/
+    std::unique_ptr<BoundBaseScanSource> bindScanSource(const parser::BaseScanSource* source,
+        const parser::options_t& options, const std::vector<std::string>& columnNames,
+        const std::vector<common::LogicalType>& columnTypes);
+    std::unique_ptr<BoundBaseScanSource> bindFileScanSource(
+        const parser::BaseScanSource& scanSource, const parser::options_t& options,
+        const std::vector<std::string>& columnNames,
+        const std::vector<common::LogicalType>& columnTypes);
+    std::unique_ptr<BoundBaseScanSource> bindQueryScanSource(
+        const parser::BaseScanSource& scanSource, const parser::options_t& options,
+        const std::vector<std::string>& columnNames,
+        const std::vector<common::LogicalType>& columnTypes);
+    std::unique_ptr<BoundBaseScanSource> bindObjectScanSource(
+        const parser::BaseScanSource& scanSource, const parser::options_t& options,
+        const std::vector<std::string>& columnNames,
+        const std::vector<common::LogicalType>& columnTypes);
+    std::unique_ptr<BoundBaseScanSource> bindParameterScanSource(
+        const parser::BaseScanSource& scanSource, const parser::options_t& options,
+        const std::vector<std::string>& columnNames,
+        const std::vector<common::LogicalType>& columnTypes);
+    std::unique_ptr<BoundBaseScanSource> bindTableFuncScanSource(
+        const parser::BaseScanSource& scanSource, const parser::options_t& options,
+        const std::vector<std::string>& columnNames,
+        const std::vector<common::LogicalType>& columnTypes);
+
+    common::case_insensitive_map_t<common::Value> bindParsingOptions(
+        const parser::options_t& parsingOptions);
+    common::FileTypeInfo bindFileTypeInfo(const std::vector<std::string>& filePaths) const;
+    std::vector<std::string> bindFilePaths(const std::vector<std::string>& filePaths) const;
+
+    /*** bind query ***/
+    std::unique_ptr<BoundRegularQuery> bindQuery(const parser::Statement& statement);
+    NormalizedSingleQuery bindSingleQuery(const parser::SingleQuery& singleQuery);
+    NormalizedQueryPart bindQueryPart(const parser::QueryPart& queryPart);
+
+    /*** bind standalone call ***/
+    std::unique_ptr<BoundStatement> bindStandaloneCall(const parser::Statement& statement);
+
+    /*** bind standalone call function ***/
+    std::unique_ptr<BoundStatement> bindStandaloneCallFunction(const parser::Statement& statement);
+
+    /*** bind table function ***/
+    BoundTableScanInfo bindTableFunc(const std::string& tableFuncName,
+        const parser::ParsedExpression& expr, std::vector<parser::YieldVariable> yieldVariables);
+
+    /*** bind create macro ***/
+    std::unique_ptr<BoundStatement> bindCreateMacro(const parser::Statement& statement) const;
+
+    /*** bind transaction ***/
+    static std::unique_ptr<BoundStatement> bindTransaction(const parser::Statement& statement);
+
+    /*** bind extension ***/
+    std::unique_ptr<BoundStatement> bindExtension(const parser::Statement& statement);
+
+    /*** bind explain ***/
+    std::unique_ptr<BoundStatement> bindExplain(const parser::Statement& statement);
+
+    /*** bind reading clause ***/
+    std::unique_ptr<BoundReadingClause> bindReadingClause(
+        const parser::ReadingClause& readingClause);
+    std::unique_ptr<BoundReadingClause> bindMatchClause(const parser::ReadingClause& readingClause);
+    std::shared_ptr<BoundJoinHintNode> bindJoinHint(
+        const QueryGraphCollection& queryGraphCollection, const parser::JoinHintNode& joinHintNode);
+    std::shared_ptr<BoundJoinHintNode> bindJoinNode(const parser::JoinHintNode& joinHintNode);
+    void rewriteMatchPattern(BoundGraphPattern& boundGraphPattern);
+    std::unique_ptr<BoundReadingClause> bindUnwindClause(
+        const parser::ReadingClause& readingClause);
+    std::unique_ptr<BoundReadingClause> bindInQueryCall(const parser::ReadingClause& readingClause);
+    std::unique_ptr<BoundReadingClause> bindLoadFrom(const parser::ReadingClause& readingClause);
+
+    /*** bind updating clause ***/
+    std::unique_ptr<BoundUpdatingClause> bindUpdatingClause(
+        const parser::UpdatingClause& updatingClause);
+    std::unique_ptr<BoundUpdatingClause> bindInsertClause(
+        const parser::UpdatingClause& updatingClause);
+    std::unique_ptr<BoundUpdatingClause> bindMergeClause(
+        const parser::UpdatingClause& updatingClause);
+    std::unique_ptr<BoundUpdatingClause> bindSetClause(
+        const parser::UpdatingClause& updatingClause);
+    std::unique_ptr<BoundUpdatingClause> bindDeleteClause(
+        const parser::UpdatingClause& updatingClause);
+
+    std::vector<BoundInsertInfo> bindInsertInfos(QueryGraphCollection& queryGraphCollection,
+        const std::unordered_set<std::string>& patternsInScope_);
+    void bindInsertNode(std::shared_ptr<NodeExpression> node, std::vector<BoundInsertInfo>& infos);
+    void bindInsertRel(std::shared_ptr<RelExpression> rel, std::vector<BoundInsertInfo>& infos);
+    expression_vector bindInsertColumnDataExprs(
+        const common::case_insensitive_map_t<std::shared_ptr<Expression>>& propertyDataExprs,
+        const std::vector<PropertyDefinition>& propertyDefinitions);
+
+    BoundSetPropertyInfo bindSetPropertyInfo(const parser::ParsedExpression* column,
+        const parser::ParsedExpression* columnData);
+    expression_pair bindSetItem(const parser::ParsedExpression* column,
+        const parser::ParsedExpression* columnData);
+
+    /*** bind projection clause ***/
+    BoundWithClause bindWithClause(const parser::WithClause& withClause);
+    BoundReturnClause bindReturnClause(const parser::ReturnClause& returnClause);
+
+    std::pair<expression_vector, std::vector<std::string>> bindProjectionList(
+        const parser::ProjectionBody& projectionBody);
+    BoundProjectionBody bindProjectionBody(const parser::ProjectionBody& projectionBody,
+        const expression_vector& projectionExprs, const std::vector<std::string>& aliases);
+
+    expression_vector bindOrderByExpressions(
+        const std::vector<std::unique_ptr<parser::ParsedExpression>>& parsedExprs);
+    std::shared_ptr<Expression> bindSkipLimitExpression(const parser::ParsedExpression& expression);
+
+    /*** bind graph pattern ***/
+    BoundGraphPattern bindGraphPattern(const std::vector<parser::PatternElement>& graphPattern);
+
+    QueryGraph bindPatternElement(const parser::PatternElement& patternElement);
+    std::shared_ptr<Expression> createPath(const std::string& pathName,
+        const expression_vector& children);
+
+    std::shared_ptr<RelExpression> bindQueryRel(const parser::RelPattern& relPattern,
+        const std::shared_ptr<NodeExpression>& leftNode,
+        const std::shared_ptr<NodeExpression>& rightNode, QueryGraph& queryGraph);
+    std::shared_ptr<RelExpression> createNonRecursiveQueryRel(const std::string& parsedName,
+        const std::vector<catalog::TableCatalogEntry*>& entries,
+        std::shared_ptr<NodeExpression> srcNode, std::shared_ptr<NodeExpression> dstNode,
+        RelDirectionType directionType);
+    std::shared_ptr<RelExpression> createRecursiveQueryRel(const parser::RelPattern& relPattern,
+        const std::vector<catalog::TableCatalogEntry*>& entries,
+        std::shared_ptr<NodeExpression> srcNode, std::shared_ptr<NodeExpression> dstNode,
+        RelDirectionType directionType);
+    expression_vector bindRecursivePatternNodeProjectionList(
+        const parser::RecursiveRelPatternInfo& info, const NodeOrRelExpression& expr);
+    expression_vector bindRecursivePatternRelProjectionList(
+        const parser::RecursiveRelPatternInfo& info, const NodeOrRelExpression& expr);
+    std::pair<uint64_t, uint64_t> bindVariableLengthRelBound(const parser::RelPattern& relPattern);
+
+    std::shared_ptr<NodeExpression> bindQueryNode(const parser::NodePattern& nodePattern,
+        QueryGraph& queryGraph);
+    std::shared_ptr<NodeExpression> createQueryNode(const parser::NodePattern& nodePattern);
+    LBUG_API std::shared_ptr<NodeExpression> createQueryNode(const std::string& parsedName,
+        const std::vector<catalog::TableCatalogEntry*>& entries);
+
+    /*** bind table entries ***/
+    std::vector<catalog::TableCatalogEntry*> bindNodeTableEntries(
+        const std::vector<std::string>& tableNames) const;
+    std::vector<catalog::TableCatalogEntry*> bindRelGroupEntries(
+        const std::vector<std::string>& tableNames) const;
+    catalog::TableCatalogEntry* bindNodeTableEntry(const std::string& name) const;
+    std::vector<PropertyDefinition> bindRelPropertyDefinitions(const parser::CreateTableInfo& info);
+
+    /*** validations ***/
+    LBUG_API static void validateTableExistence(const main::ClientContext& context,
+        const std::string& tableName);
+    LBUG_API static void validateNodeTableType(const catalog::TableCatalogEntry* entry);
+    LBUG_API static void validateColumnExistence(const catalog::TableCatalogEntry* entry,
+        const std::string& columnName);
+
+    /*** helpers ***/
+    std::string getUniqueExpressionName(const std::string& name);
+
+    static bool reservedInColumnName(const std::string& name);
+    static bool reservedInPropertyLookup(const std::string& name);
+
+    void addToScope(const std::vector<std::string>& names, const expression_vector& exprs);
+    LBUG_API void addToScope(const std::string& name, std::shared_ptr<Expression> expr);
+    BinderScope saveScope() const;
+    void restoreScope(BinderScope prevScope);
+    void replaceExpressionInScope(const std::string& oldName, const std::string& newName,
+        std::shared_ptr<Expression> expression);
+
+    function::TableFunction getScanFunction(const common::FileTypeInfo& typeInfo,
+        const common::FileScanInfo& fileScanInfo) const;
+
+    ExpressionBinder* getExpressionBinder() { return &expressionBinder; }
+
+private:
+    common::idx_t lastExpressionId;
+    BinderScope scope;
+    ExpressionBinder expressionBinder;
+    main::ClientContext* clientContext;
+    std::vector<extension::BinderExtension*> binderExtensions;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/binder_scope.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/binder_scope.h
new file mode 100644
index 0000000000..1ad85b5e57
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/binder_scope.h
@@ -0,0 +1,71 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "binder/expression/node_expression.h"
+#include "common/case_insensitive_map.h"
+
+namespace lbug {
+namespace binder {
+
+class BinderScope {
+public:
+    BinderScope() = default;
+    EXPLICIT_COPY_DEFAULT_MOVE(BinderScope);
+
+    bool empty() const { return expressions.empty(); }
+    bool contains(const std::string& varName) const { return nameToExprIdx.contains(varName); }
+    std::shared_ptr<Expression> getExpression(const std::string& varName) const {
+        KU_ASSERT(nameToExprIdx.contains(varName));
+        return expressions[nameToExprIdx.at(varName)];
+    }
+    expression_vector getExpressions() const { return expressions; }
+    void addExpression(const std::string& varName, std::shared_ptr<Expression> expression);
+    void replaceExpression(const std::string& oldName, const std::string& newName,
+        std::shared_ptr<Expression> expression);
+
+    void memorizeTableEntries(const std::string& name,
+        std::vector<catalog::TableCatalogEntry*> entries) {
+        memorizedNodeNameToEntries.insert({name, entries});
+    }
+    bool hasMemorizedTableIDs(const std::string& name) const {
+        return memorizedNodeNameToEntries.contains(name);
+    }
+    std::vector<catalog::TableCatalogEntry*> getMemorizedTableEntries(const std::string& name) {
+        KU_ASSERT(memorizedNodeNameToEntries.contains(name));
+        return memorizedNodeNameToEntries.at(name);
+    }
+
+    void addNodeReplacement(std::shared_ptr<NodeExpression> node) {
+        nodeReplacement.insert({node->getVariableName(), node});
+    }
+    bool hasNodeReplacement(const std::string& name) const {
+        return nodeReplacement.contains(name);
+    }
+    std::shared_ptr<NodeExpression> getNodeReplacement(const std::string& name) const {
+        KU_ASSERT(hasNodeReplacement(name));
+        return nodeReplacement.at(name);
+    }
+
+    void clear();
+
+private:
+    BinderScope(const BinderScope& other)
+        : expressions{other.expressions}, nameToExprIdx{other.nameToExprIdx},
+          memorizedNodeNameToEntries{other.memorizedNodeNameToEntries} {}
+
+private:
+    // Expressions in scope. Order should be preserved.
+    expression_vector expressions;
+    common::case_insensitive_map_t<common::idx_t> nameToExprIdx;
+    // A node might be popped out of scope. But we may need to retain its table ID information.
+    // E.g. MATCH (a:person) WITH collect(a) AS list_a UNWIND list_a AS new_a MATCH (new_a)-[]->()
+    // It will be more performant if we can retain the information that new_a has label person.
+    common::case_insensitive_map_t<std::vector<catalog::TableCatalogEntry*>>
+        memorizedNodeNameToEntries;
+    // A node pattern may not always be bound as a node expression, e.g. in the above query,
+    // (new_a) is bound as a variable rather than node expression.
+    common::case_insensitive_map_t<std::shared_ptr<NodeExpression>> nodeReplacement;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_attach_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_attach_database.h
new file mode 100644
index 0000000000..f09a41c1d7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_attach_database.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "bound_attach_info.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundAttachDatabase final : public BoundStatement {
+public:
+    explicit BoundAttachDatabase(binder::AttachInfo attachInfo)
+        : BoundStatement{common::StatementType::ATTACH_DATABASE,
+              BoundStatementResult::createSingleStringColumnResult()},
+          attachInfo{std::move(attachInfo)} {}
+
+    AttachInfo getAttachInfo() const { return attachInfo; }
+
+private:
+    AttachInfo attachInfo;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_attach_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_attach_info.h
new file mode 100644
index 0000000000..fb565aa7b2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_attach_info.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "common/case_insensitive_map.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace binder {
+
+struct LBUG_API AttachOption {
+    common::case_insensitive_map_t<common::Value> options;
+};
+
+struct LBUG_API AttachInfo {
+    AttachInfo(std::string dbPath, std::string dbAlias, std::string dbType, AttachOption options)
+        : dbPath{std::move(dbPath)}, dbAlias{std::move(dbAlias)}, dbType{std::move(dbType)},
+          options{std::move(options)} {}
+
+    std::string dbPath, dbAlias, dbType;
+    AttachOption options;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_create_macro.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_create_macro.h
new file mode 100644
index 0000000000..8b38f325e6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_create_macro.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "function/scalar_macro_function.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundCreateMacro final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::CREATE_MACRO;
+
+public:
+    explicit BoundCreateMacro(std::string macroName,
+        std::unique_ptr<function::ScalarMacroFunction> macro)
+        : BoundStatement{type_,
+              BoundStatementResult::createSingleStringColumnResult("result" /* columnName */)},
+          macroName{std::move(macroName)}, macro{std::move(macro)} {}
+
+    std::string getMacroName() const { return macroName; }
+
+    std::unique_ptr<function::ScalarMacroFunction> getMacro() const { return macro->copy(); }
+
+private:
+    std::string macroName;
+    std::unique_ptr<function::ScalarMacroFunction> macro;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_database_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_database_statement.h
new file mode 100644
index 0000000000..8801867ab4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_database_statement.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundDatabaseStatement : public BoundStatement {
+public:
+    explicit BoundDatabaseStatement(common::StatementType statementType, std::string dbName)
+        : BoundStatement{statementType, BoundStatementResult::createSingleStringColumnResult()},
+          dbName{std::move(dbName)} {}
+
+    std::string getDBName() const { return dbName; }
+
+private:
+    std::string dbName;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_detach_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_detach_database.h
new file mode 100644
index 0000000000..bbe3b90af1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_detach_database.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "binder/bound_database_statement.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundDetachDatabase final : public BoundDatabaseStatement {
+public:
+    explicit BoundDetachDatabase(std::string dbName)
+        : BoundDatabaseStatement{common::StatementType::DETACH_DATABASE, std::move(dbName)} {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_explain.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_explain.h
new file mode 100644
index 0000000000..eadb4e97e3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_explain.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "common/enums/explain_type.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundExplain final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::EXPLAIN;
+
+public:
+    explicit BoundExplain(std::unique_ptr<BoundStatement> statementToExplain,
+        common::ExplainType explainType)
+        : BoundStatement{type_, BoundStatementResult::createSingleStringColumnResult(
+                                    "explain result" /* columnName */)},
+          statementToExplain{std::move(statementToExplain)}, explainType{explainType} {}
+
+    BoundStatement* getStatementToExplain() const { return statementToExplain.get(); }
+
+    common::ExplainType getExplainType() const { return explainType; }
+
+private:
+    std::unique_ptr<BoundStatement> statementToExplain;
+    common::ExplainType explainType;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_export_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_export_database.h
new file mode 100644
index 0000000000..0711b2fbc4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_export_database.h
@@ -0,0 +1,51 @@
+#pragma once
+#include "binder/binder.h"
+#include "binder/bound_statement.h"
+#include "binder/query/bound_regular_query.h"
+#include "common/copier_config/file_scan_info.h"
+
+namespace lbug {
+namespace binder {
+
+struct ExportedTableData {
+    std::string tableName;
+    std::string fileName;
+    std::unique_ptr<BoundRegularQuery> regularQuery;
+    std::vector<std::string> columnNames;
+    std::vector<common::LogicalType> columnTypes;
+
+    const std::vector<common::LogicalType>& getColumnTypesRef() const { return columnTypes; }
+    const BoundRegularQuery* getRegularQuery() const { return regularQuery.get(); }
+};
+
+class BoundExportDatabase final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::EXPORT_DATABASE;
+
+public:
+    BoundExportDatabase(std::string filePath, common::FileTypeInfo fileTypeInfo,
+        std::vector<ExportedTableData> exportData,
+        common::case_insensitive_map_t<common::Value> csvOption, bool schemaOnly)
+        : BoundStatement{type_, BoundStatementResult::createSingleStringColumnResult()},
+          exportData(std::move(exportData)),
+          boundFileInfo(std::move(fileTypeInfo), std::vector{std::move(filePath)}),
+          schemaOnly{schemaOnly} {
+        boundFileInfo.options = std::move(csvOption);
+    }
+
+    std::string getFilePath() const { return boundFileInfo.filePaths[0]; }
+    common::FileType getFileType() const { return boundFileInfo.fileTypeInfo.fileType; }
+    common::case_insensitive_map_t<common::Value> getExportOptions() const {
+        return boundFileInfo.options;
+    }
+    const common::FileScanInfo* getBoundFileInfo() const { return &boundFileInfo; }
+    const std::vector<ExportedTableData>* getExportData() const { return &exportData; }
+    bool exportSchemaOnly() const { return schemaOnly; }
+
+private:
+    std::vector<ExportedTableData> exportData;
+    common::FileScanInfo boundFileInfo;
+    bool schemaOnly;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_extension_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_extension_statement.h
new file mode 100644
index 0000000000..ad2e58acfd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_extension_statement.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "bound_statement.h"
+#include "extension/extension_action.h"
+
+namespace lbug {
+namespace binder {
+
+using namespace lbug::extension;
+
+class BoundExtensionStatement final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::EXTENSION;
+
+public:
+    explicit BoundExtensionStatement(std::unique_ptr<ExtensionAuxInfo> info)
+        : BoundStatement{type_, BoundStatementResult::createSingleStringColumnResult()},
+          info{std::move(info)} {}
+
+    std::unique_ptr<ExtensionAuxInfo> getAuxInfo() const { return info->copy(); }
+
+private:
+    std::unique_ptr<ExtensionAuxInfo> info;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_import_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_import_database.h
new file mode 100644
index 0000000000..2b23edccea
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_import_database.h
@@ -0,0 +1,29 @@
+#pragma once
+#include "binder/bound_statement.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundImportDatabase final : public BoundStatement {
+public:
+    BoundImportDatabase(std::string filePath, std::string query, std::string indexQuery)
+        : BoundStatement{common::StatementType::IMPORT_DATABASE,
+              BoundStatementResult::createSingleStringColumnResult()},
+          filePath{std::move(filePath)}, query{std::move(query)},
+          indexQuery{std::move(indexQuery)} {}
+
+    std::string getFilePath() const { return filePath; }
+    std::string getQuery() const { return query; }
+    std::string getIndexQuery() const { return indexQuery; }
+
+private:
+    std::string filePath;
+    // We concatenate queries based on the schema.cypher, copy.cypher, and macro.cypher files
+    // generated by exporting the database, resulting in queries such as "create node table xxx;
+    // create rel table xxx; copy from xxxx;".
+    std::string query;
+    std::string indexQuery;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_scan_source.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_scan_source.h
new file mode 100644
index 0000000000..77e00720bd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_scan_source.h
@@ -0,0 +1,85 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "binder/copy/bound_query_scan_info.h"
+#include "bound_table_scan_info.h"
+#include "common/enums/scan_source_type.h"
+#include "function/table/scan_file_function.h"
+
+namespace lbug {
+namespace binder {
+
+struct BoundBaseScanSource {
+    common::ScanSourceType type;
+
+    explicit BoundBaseScanSource(common::ScanSourceType type) : type{type} {}
+    virtual ~BoundBaseScanSource() = default;
+
+    virtual expression_vector getColumns() = 0;
+    virtual expression_vector getWarningColumns() const { return expression_vector{}; };
+    virtual bool getIgnoreErrorsOption() const {
+        return common::CopyConstants::DEFAULT_IGNORE_ERRORS;
+    };
+    virtual common::column_id_t getNumWarningDataColumns() const { return 0; }
+
+    virtual std::unique_ptr<BoundBaseScanSource> copy() const = 0;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+protected:
+    BoundBaseScanSource(const BoundBaseScanSource& other) : type{other.type} {}
+};
+
+struct BoundTableScanSource final : BoundBaseScanSource {
+    BoundTableScanInfo info;
+
+    explicit BoundTableScanSource(common::ScanSourceType type, BoundTableScanInfo info)
+        : BoundBaseScanSource{type}, info{std::move(info)} {}
+    BoundTableScanSource(const BoundTableScanSource& other)
+        : BoundBaseScanSource{other}, info{other.info.copy()} {}
+
+    expression_vector getColumns() override { return info.bindData->columns; }
+    expression_vector getWarningColumns() const override;
+    bool getIgnoreErrorsOption() const override;
+    common::column_id_t getNumWarningDataColumns() const override {
+        switch (type) {
+        case common::ScanSourceType::FILE:
+            return info.bindData->constPtrCast<function::ScanFileBindData>()->numWarningDataColumns;
+        default:
+            return 0;
+        }
+    }
+
+    std::unique_ptr<BoundBaseScanSource> copy() const override {
+        return std::make_unique<BoundTableScanSource>(*this);
+    }
+};
+
+struct BoundQueryScanSource final : BoundBaseScanSource {
+    // Use shared ptr to avoid copy BoundStatement.
+    // We should consider implement a copy constructor though.
+    std::shared_ptr<BoundStatement> statement;
+    BoundQueryScanSourceInfo info;
+
+    explicit BoundQueryScanSource(std::shared_ptr<BoundStatement> statement,
+        BoundQueryScanSourceInfo info)
+        : BoundBaseScanSource{common::ScanSourceType::QUERY}, statement{std::move(statement)},
+          info(std::move(info)) {}
+    BoundQueryScanSource(const BoundQueryScanSource& other) = default;
+
+    bool getIgnoreErrorsOption() const override;
+
+    expression_vector getColumns() override {
+        return statement->getStatementResult()->getColumns();
+    }
+
+    std::unique_ptr<BoundBaseScanSource> copy() const override {
+        return std::make_unique<BoundQueryScanSource>(*this);
+    }
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_standalone_call.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_standalone_call.h
new file mode 100644
index 0000000000..17eccb14fd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_standalone_call.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "binder/expression/expression.h"
+
+namespace lbug {
+namespace main {
+struct Option;
+}
+namespace binder {
+
+class BoundStandaloneCall final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::STANDALONE_CALL;
+
+public:
+    BoundStandaloneCall(const main::Option* option, std::shared_ptr<Expression> optionValue)
+        : BoundStatement{type_, BoundStatementResult::createEmptyResult()}, option{option},
+          optionValue{std::move(optionValue)} {}
+
+    const main::Option* getOption() const { return option; }
+
+    std::shared_ptr<Expression> getOptionValue() const { return optionValue; }
+
+private:
+    const main::Option* option;
+    std::shared_ptr<Expression> optionValue;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_standalone_call_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_standalone_call_function.h
new file mode 100644
index 0000000000..e3344cfc76
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_standalone_call_function.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "bound_table_scan_info.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundStandaloneCallFunction final : public BoundStatement {
+    static constexpr common::StatementType statementType =
+        common::StatementType::STANDALONE_CALL_FUNCTION;
+
+public:
+    explicit BoundStandaloneCallFunction(BoundTableScanInfo info)
+        : BoundStatement{statementType, BoundStatementResult::createEmptyResult()},
+          info{std::move(info)} {}
+
+    const function::TableFunction& getTableFunction() const { return info.func; }
+
+    const function::TableFuncBindData* getBindData() const { return info.bindData.get(); }
+
+private:
+    BoundTableScanInfo info;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement.h
new file mode 100644
index 0000000000..d242e60508
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include "bound_statement_result.h"
+#include "common/copy_constructors.h"
+#include "common/enums/statement_type.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundStatement {
+public:
+    BoundStatement(common::StatementType statementType, BoundStatementResult statementResult)
+        : statementType{statementType}, statementResult{std::move(statementResult)} {}
+    DELETE_COPY_DEFAULT_MOVE(BoundStatement);
+
+    virtual ~BoundStatement() = default;
+
+    common::StatementType getStatementType() const { return statementType; }
+
+    const BoundStatementResult* getStatementResult() const { return &statementResult; }
+    std::shared_ptr<Expression> getSingleColumnExpr() const {
+        return statementResult.getSingleColumnExpr();
+    }
+
+    BoundStatementResult* getStatementResultUnsafe() { return &statementResult; }
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+private:
+    common::StatementType statementType;
+    BoundStatementResult statementResult;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement_result.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement_result.h
new file mode 100644
index 0000000000..4af1dcafd1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement_result.h
@@ -0,0 +1,53 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundStatementResult {
+public:
+    BoundStatementResult() = default;
+    explicit BoundStatementResult(expression_vector columns, std::vector<std::string> columnNames)
+        : columns{std::move(columns)}, columnNames{std::move(columnNames)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundStatementResult);
+
+    static BoundStatementResult createEmptyResult() { return BoundStatementResult(); }
+
+    static BoundStatementResult createSingleStringColumnResult(
+        const std::string& columnName = "result");
+
+    void addColumn(const std::string& columnName, std::shared_ptr<Expression> column) {
+        columns.push_back(std::move(column));
+        columnNames.push_back(columnName);
+    }
+    expression_vector getColumns() const { return columns; }
+    std::vector<std::string> getColumnNames() const { return columnNames; }
+    std::vector<common::LogicalType> getColumnTypes() const {
+        std::vector<common::LogicalType> columnTypes;
+        for (auto& column : columns) {
+            columnTypes.push_back(column->getDataType().copy());
+        }
+        return columnTypes;
+    }
+
+    std::shared_ptr<Expression> getSingleColumnExpr() const {
+        KU_ASSERT(columns.size() == 1);
+        return columns[0];
+    }
+
+private:
+    BoundStatementResult(const BoundStatementResult& other)
+        : columns{other.columns}, columnNames{other.columnNames} {}
+
+private:
+    expression_vector columns;
+    // ColumnNames might be different from column.toString() because the same column might have
+    // different aliases, e.g. RETURN id AS a, id AS b
+    // For both columns we currently refer to the same id expr object so we cannot resolve column
+    // name properly from expression object.
+    std::vector<std::string> columnNames;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement_rewriter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement_rewriter.h
new file mode 100644
index 0000000000..475c66938b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement_rewriter.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "bound_statement.h"
+
+namespace lbug {
+namespace binder {
+
+// Perform semantic rewrite over bound statement.
+class BoundStatementRewriter {
+public:
+    static void rewrite(BoundStatement& boundStatement, main::ClientContext& clientContext);
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement_visitor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement_visitor.h
new file mode 100644
index 0000000000..4fffccec37
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_statement_visitor.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include "binder/query/normalized_single_query.h"
+#include "bound_statement.h"
+
+namespace lbug {
+namespace binder {
+
+class LBUG_API BoundStatementVisitor {
+public:
+    BoundStatementVisitor() = default;
+    virtual ~BoundStatementVisitor() = default;
+
+    void visit(const BoundStatement& statement);
+    // Unsafe visitors are implemented on-demand. We may reuse safe visitor inside unsafe visitor
+    // if no other class need to overwrite an unsafe visitor.
+    void visitUnsafe(BoundStatement& statement);
+
+    virtual void visitSingleQuery(const NormalizedSingleQuery& singleQuery);
+
+protected:
+    virtual void visitCreateSequence(const BoundStatement&) {}
+    virtual void visitCreateTable(const BoundStatement&) {}
+    virtual void visitDrop(const BoundStatement&) {}
+    virtual void visitCreateType(const BoundStatement&) {}
+    virtual void visitAlter(const BoundStatement&) {}
+    virtual void visitCopyFrom(const BoundStatement&);
+    virtual void visitCopyTo(const BoundStatement&);
+    virtual void visitExportDatabase(const BoundStatement&) {}
+    virtual void visitImportDatabase(const BoundStatement&) {}
+    virtual void visitStandaloneCall(const BoundStatement&) {}
+    virtual void visitExplain(const BoundStatement&);
+    virtual void visitCreateMacro(const BoundStatement&) {}
+    virtual void visitTransaction(const BoundStatement&) {}
+    virtual void visitExtension(const BoundStatement&) {}
+
+    virtual void visitRegularQuery(const BoundStatement& statement);
+    virtual void visitRegularQueryUnsafe(BoundStatement& statement);
+    virtual void visitSingleQueryUnsafe(NormalizedSingleQuery& singleQuery);
+    virtual void visitQueryPart(const NormalizedQueryPart& queryPart);
+    virtual void visitQueryPartUnsafe(NormalizedQueryPart& queryPart);
+    void visitReadingClause(const BoundReadingClause& readingClause);
+    void visitReadingClauseUnsafe(BoundReadingClause& readingClause);
+    virtual void visitMatch(const BoundReadingClause&) {}
+    virtual void visitMatchUnsafe(BoundReadingClause&) {}
+    virtual void visitUnwind(const BoundReadingClause& /*readingClause*/) {}
+    virtual void visitTableFunctionCall(const BoundReadingClause&) {}
+    virtual void visitLoadFrom(const BoundReadingClause& /*statement*/) {}
+    void visitUpdatingClause(const BoundUpdatingClause& updatingClause);
+    virtual void visitSet(const BoundUpdatingClause& /*updatingClause*/) {}
+    virtual void visitDelete(const BoundUpdatingClause& /* updatingClause*/) {}
+    virtual void visitInsert(const BoundUpdatingClause& /* updatingClause*/) {}
+    virtual void visitMerge(const BoundUpdatingClause& /* updatingClause*/) {}
+
+    virtual void visitProjectionBody(const BoundProjectionBody& /* projectionBody*/) {}
+    virtual void visitProjectionBodyPredicate(const std::shared_ptr<Expression>& /* predicate*/) {}
+    virtual void visitAttachDatabase(const BoundStatement&) {}
+    virtual void visitDetachDatabase(const BoundStatement&) {}
+    virtual void visitUseDatabase(const BoundStatement&) {}
+    virtual void visitStandaloneCallFunction(const BoundStatement&) {}
+    virtual void visitExtensionClause(const BoundStatement&) {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_table_scan_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_table_scan_info.h
new file mode 100644
index 0000000000..b865f94dea
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_table_scan_info.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "function/table/bind_data.h"
+#include "function/table/table_function.h"
+
+namespace lbug {
+namespace binder {
+
+struct BoundTableScanInfo {
+    function::TableFunction func;
+    std::unique_ptr<function::TableFuncBindData> bindData;
+
+    BoundTableScanInfo(function::TableFunction func,
+        std::unique_ptr<function::TableFuncBindData> bindData)
+        : func{std::move(func)}, bindData{std::move(bindData)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundTableScanInfo);
+
+private:
+    BoundTableScanInfo(const BoundTableScanInfo& other)
+        : func{other.func}, bindData{other.bindData->copy()} {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_transaction_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_transaction_statement.h
new file mode 100644
index 0000000000..376dc53c95
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_transaction_statement.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "bound_statement.h"
+#include "transaction/transaction_action.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundTransactionStatement final : public BoundStatement {
+    static constexpr common::StatementType statementType_ = common::StatementType::TRANSACTION;
+
+public:
+    explicit BoundTransactionStatement(transaction::TransactionAction transactionAction)
+        : BoundStatement{statementType_, BoundStatementResult::createEmptyResult()},
+          transactionAction{transactionAction} {}
+
+    transaction::TransactionAction getTransactionAction() const { return transactionAction; }
+
+private:
+    transaction::TransactionAction transactionAction;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_use_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_use_database.h
new file mode 100644
index 0000000000..ac260172b0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/bound_use_database.h
@@ -0,0 +1,17 @@
+#pragma once
+
+#include "binder/bound_database_statement.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundUseDatabase final : public BoundDatabaseStatement {
+    static constexpr common::StatementType type_ = common::StatementType::USE_DATABASE;
+
+public:
+    explicit BoundUseDatabase(std::string dbName)
+        : BoundDatabaseStatement{type_, std::move(dbName)} {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/bound_copy_from.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/bound_copy_from.h
new file mode 100644
index 0000000000..2e4af22d0e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/bound_copy_from.h
@@ -0,0 +1,101 @@
+#pragma once
+
+#include "binder/bound_scan_source.h"
+#include "binder/expression/expression.h"
+#include "common/enums/column_evaluate_type.h"
+#include "common/enums/table_type.h"
+#include "index_look_up_info.h"
+
+namespace lbug {
+namespace binder {
+
+struct ExtraBoundCopyFromInfo {
+    virtual ~ExtraBoundCopyFromInfo() = default;
+    virtual std::unique_ptr<ExtraBoundCopyFromInfo> copy() const = 0;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+struct LBUG_API BoundCopyFromInfo {
+    // Name of table to copy into.
+    std::string tableName;
+    // Type of table.
+    common::TableType tableType;
+    // Data source.
+    std::unique_ptr<BoundBaseScanSource> source;
+    // Row offset.
+    std::shared_ptr<Expression> offset;
+    expression_vector columnExprs;
+    std::vector<common::ColumnEvaluateType> columnEvaluateTypes;
+    std::unique_ptr<ExtraBoundCopyFromInfo> extraInfo;
+
+    BoundCopyFromInfo(std::string tableName, common::TableType tableType,
+        std::unique_ptr<BoundBaseScanSource> source, std::shared_ptr<Expression> offset,
+        expression_vector columnExprs, std::vector<common::ColumnEvaluateType> columnEvaluateTypes,
+        std::unique_ptr<ExtraBoundCopyFromInfo> extraInfo)
+        : tableName{std::move(tableName)}, tableType{tableType}, source{std::move(source)},
+          offset{std::move(offset)}, columnExprs{std::move(columnExprs)},
+          columnEvaluateTypes{std::move(columnEvaluateTypes)}, extraInfo{std::move(extraInfo)} {}
+
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundCopyFromInfo);
+
+    expression_vector getSourceColumns() const {
+        return source ? source->getColumns() : expression_vector{};
+    }
+    expression_vector getWarningColumns() const {
+        return offset ? source->getWarningColumns() : expression_vector{};
+    }
+
+    bool getIgnoreErrorsOption() const { return source ? source->getIgnoreErrorsOption() : false; }
+
+private:
+    BoundCopyFromInfo(const BoundCopyFromInfo& other)
+        : tableName{other.tableName}, tableType{other.tableType}, offset{other.offset},
+          columnExprs{other.columnExprs}, columnEvaluateTypes{other.columnEvaluateTypes} {
+        source = other.source ? other.source->copy() : nullptr;
+        if (other.extraInfo) {
+            extraInfo = other.extraInfo->copy();
+        }
+    }
+};
+
+struct ExtraBoundCopyRelInfo final : ExtraBoundCopyFromInfo {
+    std::string fromTableName;
+    std::string toTableName;
+    // We process internal ID column as offset (INT64) column until partitioner. In partitioner,
+    // we need to manually change offset(INT64) type to internal ID type.
+    std::vector<common::idx_t> internalIDColumnIndices;
+    std::vector<IndexLookupInfo> infos;
+
+    ExtraBoundCopyRelInfo(std::string fromTableName, std::string toTableName,
+        std::vector<common::idx_t> internalIDColumnIndices, std::vector<IndexLookupInfo> infos)
+        : fromTableName{std::move(fromTableName)}, toTableName{std::move(toTableName)},
+          internalIDColumnIndices{std::move(internalIDColumnIndices)}, infos{std::move(infos)} {}
+    ExtraBoundCopyRelInfo(const ExtraBoundCopyRelInfo& other)
+        : fromTableName{other.fromTableName}, toTableName{other.toTableName},
+          internalIDColumnIndices{other.internalIDColumnIndices}, infos{other.infos} {}
+
+    std::unique_ptr<ExtraBoundCopyFromInfo> copy() const override {
+        return std::make_unique<ExtraBoundCopyRelInfo>(*this);
+    }
+};
+
+class BoundCopyFrom final : public BoundStatement {
+    static constexpr common::StatementType statementType_ = common::StatementType::COPY_FROM;
+
+public:
+    explicit BoundCopyFrom(BoundCopyFromInfo info)
+        : BoundStatement{statementType_, BoundStatementResult::createSingleStringColumnResult()},
+          info{std::move(info)} {}
+
+    const BoundCopyFromInfo* getInfo() const { return &info; }
+
+private:
+    BoundCopyFromInfo info;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/bound_copy_to.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/bound_copy_to.h
new file mode 100644
index 0000000000..2e1a0058dd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/bound_copy_to.h
@@ -0,0 +1,32 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "function/export/export_function.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundCopyTo final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::COPY_TO;
+
+public:
+    BoundCopyTo(std::unique_ptr<function::ExportFuncBindData> bindData,
+        function::ExportFunction exportFunc, std::unique_ptr<BoundStatement> query)
+        : BoundStatement{type_, BoundStatementResult::createEmptyResult()},
+          bindData{std::move(bindData)}, exportFunc{std::move(exportFunc)},
+          query{std::move(query)} {}
+
+    std::unique_ptr<function::ExportFuncBindData> getBindData() const { return bindData->copy(); }
+
+    function::ExportFunction getExportFunc() const { return exportFunc; }
+
+    const BoundStatement* getRegularQuery() const { return query.get(); }
+
+private:
+    std::unique_ptr<function::ExportFuncBindData> bindData;
+    function::ExportFunction exportFunc;
+    std::unique_ptr<BoundStatement> query;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/bound_query_scan_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/bound_query_scan_info.h
new file mode 100644
index 0000000000..23dc9c1cf6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/bound_query_scan_info.h
@@ -0,0 +1,16 @@
+#pragma once
+
+#include "common/case_insensitive_map.h"
+#include "common/types/value/value.h"
+namespace lbug {
+namespace binder {
+
+struct BoundQueryScanSourceInfo {
+    common::case_insensitive_map_t<common::Value> options;
+
+    explicit BoundQueryScanSourceInfo(common::case_insensitive_map_t<common::Value> options)
+        : options{std::move(options)} {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/index_look_up_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/index_look_up_info.h
new file mode 100644
index 0000000000..bcb0e3701c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/copy/index_look_up_info.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+
+namespace lbug {
+namespace binder {
+
+struct IndexLookupInfo {
+    common::table_id_t nodeTableID;
+    std::shared_ptr<Expression> offset; // output
+    std::shared_ptr<Expression> key;    // input
+    expression_vector warningExprs;
+
+    IndexLookupInfo(common::table_id_t nodeTableID, std::shared_ptr<Expression> offset,
+        std::shared_ptr<Expression> key, expression_vector warningExprs = {})
+        : nodeTableID{nodeTableID}, offset{std::move(offset)}, key{std::move(key)},
+          warningExprs(std::move(warningExprs)) {}
+    IndexLookupInfo(const IndexLookupInfo& other) = default;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_alter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_alter.h
new file mode 100644
index 0000000000..ecc1753702
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_alter.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "bound_alter_info.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundAlter final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::ALTER;
+
+public:
+    explicit BoundAlter(BoundAlterInfo info)
+        : BoundStatement{type_, BoundStatementResult::createSingleStringColumnResult()},
+          info{std::move(info)} {}
+
+    const BoundAlterInfo& getInfo() const { return info; }
+
+private:
+    BoundAlterInfo info;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_alter_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_alter_info.h
new file mode 100644
index 0000000000..88a41a54a9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_alter_info.h
@@ -0,0 +1,125 @@
+#pragma once
+
+#include "binder/ddl/property_definition.h"
+#include "binder/expression/expression.h"
+#include "common/enums/alter_type.h"
+#include "common/enums/conflict_action.h"
+
+namespace lbug {
+namespace binder {
+
+struct BoundExtraAlterInfo {
+    virtual ~BoundExtraAlterInfo() = default;
+
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+    virtual std::unique_ptr<BoundExtraAlterInfo> copy() const = 0;
+};
+
+struct BoundAlterInfo {
+    common::AlterType alterType;
+    std::string tableName;
+    std::unique_ptr<BoundExtraAlterInfo> extraInfo;
+    common::ConflictAction onConflict;
+
+    BoundAlterInfo(common::AlterType alterType, std::string tableName,
+        std::unique_ptr<BoundExtraAlterInfo> extraInfo,
+        common::ConflictAction onConflict = common::ConflictAction::ON_CONFLICT_THROW)
+        : alterType{alterType}, tableName{std::move(tableName)}, extraInfo{std::move(extraInfo)},
+          onConflict{onConflict} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundAlterInfo);
+
+    std::string toString() const;
+
+private:
+    BoundAlterInfo(const BoundAlterInfo& other)
+        : alterType{other.alterType}, tableName{other.tableName},
+          extraInfo{other.extraInfo->copy()}, onConflict{other.onConflict} {}
+};
+
+struct BoundExtraRenameTableInfo final : BoundExtraAlterInfo {
+    std::string newName;
+
+    explicit BoundExtraRenameTableInfo(std::string newName) : newName{std::move(newName)} {}
+    BoundExtraRenameTableInfo(const BoundExtraRenameTableInfo& other) : newName{other.newName} {}
+
+    std::unique_ptr<BoundExtraAlterInfo> copy() const override {
+        return std::make_unique<BoundExtraRenameTableInfo>(*this);
+    }
+};
+
+struct BoundExtraAddPropertyInfo final : BoundExtraAlterInfo {
+    PropertyDefinition propertyDefinition;
+    std::shared_ptr<Expression> boundDefault;
+
+    BoundExtraAddPropertyInfo(const PropertyDefinition& definition,
+        std::shared_ptr<Expression> boundDefault)
+        : propertyDefinition{definition.copy()}, boundDefault{std::move(boundDefault)} {}
+    BoundExtraAddPropertyInfo(const BoundExtraAddPropertyInfo& other)
+        : propertyDefinition{other.propertyDefinition.copy()}, boundDefault{other.boundDefault} {}
+
+    std::unique_ptr<BoundExtraAlterInfo> copy() const override {
+        return std::make_unique<BoundExtraAddPropertyInfo>(*this);
+    }
+};
+
+struct BoundExtraDropPropertyInfo final : BoundExtraAlterInfo {
+    std::string propertyName;
+
+    explicit BoundExtraDropPropertyInfo(std::string propertyName)
+        : propertyName{std::move(propertyName)} {}
+    BoundExtraDropPropertyInfo(const BoundExtraDropPropertyInfo& other)
+        : propertyName{other.propertyName} {}
+
+    std::unique_ptr<BoundExtraAlterInfo> copy() const override {
+        return std::make_unique<BoundExtraDropPropertyInfo>(*this);
+    }
+};
+
+struct BoundExtraRenamePropertyInfo final : BoundExtraAlterInfo {
+    std::string newName;
+    std::string oldName;
+
+    BoundExtraRenamePropertyInfo(std::string newName, std::string oldName)
+        : newName{std::move(newName)}, oldName{std::move(oldName)} {}
+    BoundExtraRenamePropertyInfo(const BoundExtraRenamePropertyInfo& other)
+        : newName{other.newName}, oldName{other.oldName} {}
+    std::unique_ptr<BoundExtraAlterInfo> copy() const override {
+        return std::make_unique<BoundExtraRenamePropertyInfo>(*this);
+    }
+};
+
+struct BoundExtraCommentInfo final : BoundExtraAlterInfo {
+    std::string comment;
+
+    explicit BoundExtraCommentInfo(std::string comment) : comment{std::move(comment)} {}
+    BoundExtraCommentInfo(const BoundExtraCommentInfo& other) : comment{other.comment} {}
+    std::unique_ptr<BoundExtraAlterInfo> copy() const override {
+        return std::make_unique<BoundExtraCommentInfo>(*this);
+    }
+};
+
+struct BoundExtraAlterFromToConnection final : BoundExtraAlterInfo {
+    common::table_id_t fromTableID;
+    common::table_id_t toTableID;
+
+    BoundExtraAlterFromToConnection(common::table_id_t fromTableID, common::table_id_t toTableID)
+        : fromTableID{fromTableID}, toTableID{toTableID} {}
+    std::unique_ptr<BoundExtraAlterInfo> copy() const override {
+        return std::make_unique<BoundExtraAlterFromToConnection>(*this);
+    }
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_sequence.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_sequence.h
new file mode 100644
index 0000000000..3cad5467a2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_sequence.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "bound_create_sequence_info.h"
+namespace lbug {
+namespace binder {
+
+class BoundCreateSequence final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::CREATE_SEQUENCE;
+
+public:
+    explicit BoundCreateSequence(BoundCreateSequenceInfo info)
+        : BoundStatement{type_, BoundStatementResult::createSingleStringColumnResult()},
+          info{std::move(info)} {}
+
+    const BoundCreateSequenceInfo& getInfo() const { return info; }
+
+private:
+    BoundCreateSequenceInfo info;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_sequence_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_sequence_info.h
new file mode 100644
index 0000000000..a1e9ca2664
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_sequence_info.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include <string>
+
+#include "common/copy_constructors.h"
+#include "common/enums/conflict_action.h"
+
+namespace lbug {
+namespace binder {
+
+struct BoundCreateSequenceInfo {
+    std::string sequenceName;
+    int64_t startWith;
+    int64_t increment;
+    int64_t minValue;
+    int64_t maxValue;
+    bool cycle;
+    common::ConflictAction onConflict;
+    bool hasParent = false;
+    bool isInternal;
+
+    BoundCreateSequenceInfo(std::string sequenceName, int64_t startWith, int64_t increment,
+        int64_t minValue, int64_t maxValue, bool cycle, common::ConflictAction onConflict,
+        bool isInternal)
+        : sequenceName{std::move(sequenceName)}, startWith{startWith}, increment{increment},
+          minValue{minValue}, maxValue{maxValue}, cycle{cycle}, onConflict{onConflict},
+          isInternal{isInternal} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundCreateSequenceInfo);
+
+private:
+    BoundCreateSequenceInfo(const BoundCreateSequenceInfo& other)
+        : sequenceName{other.sequenceName}, startWith{other.startWith}, increment{other.increment},
+          minValue{other.minValue}, maxValue{other.maxValue}, cycle{other.cycle},
+          onConflict{other.onConflict}, hasParent{other.hasParent}, isInternal{other.isInternal} {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_table.h
new file mode 100644
index 0000000000..e279b1d1d6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_table.h
@@ -0,0 +1,32 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "binder/copy/bound_copy_from.h"
+#include "bound_create_table_info.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundCreateTable final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::CREATE_TABLE;
+
+public:
+    explicit BoundCreateTable(BoundCreateTableInfo info, BoundStatementResult result)
+        : BoundStatement{type_, std::move(result)}, info{std::move(info)} {}
+
+    const BoundCreateTableInfo& getInfo() const { return info; }
+
+    void setCopyInfo(BoundCopyFromInfo copyInfo_) { copyInfo = std::move(copyInfo_); }
+    bool hasCopyInfo() const { return copyInfo.has_value(); }
+    const BoundCopyFromInfo& getCopyInfo() const {
+        KU_ASSERT(copyInfo.has_value());
+        return copyInfo.value();
+    }
+
+private:
+    BoundCreateTableInfo info;
+    std::optional<BoundCopyFromInfo> copyInfo;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_table_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_table_info.h
new file mode 100644
index 0000000000..03a86d911d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_table_info.h
@@ -0,0 +1,112 @@
+#pragma once
+
+#include "catalog/catalog_entry/catalog_entry_type.h"
+#include "catalog/catalog_entry/node_table_id_pair.h"
+#include "common/enums/conflict_action.h"
+#include "common/enums/extend_direction.h"
+#include "common/enums/rel_multiplicity.h"
+#include "property_definition.h"
+
+namespace lbug {
+namespace common {
+enum class RelMultiplicity : uint8_t;
+}
+namespace binder {
+struct BoundExtraCreateCatalogEntryInfo {
+    virtual ~BoundExtraCreateCatalogEntryInfo() = default;
+
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+    virtual inline std::unique_ptr<BoundExtraCreateCatalogEntryInfo> copy() const = 0;
+};
+
+struct BoundCreateTableInfo {
+    catalog::CatalogEntryType type = catalog::CatalogEntryType::DUMMY_ENTRY;
+    std::string tableName;
+    common::ConflictAction onConflict = common::ConflictAction::INVALID;
+    std::unique_ptr<BoundExtraCreateCatalogEntryInfo> extraInfo;
+    bool isInternal = false;
+    bool hasParent = false;
+
+    BoundCreateTableInfo() = default;
+    BoundCreateTableInfo(catalog::CatalogEntryType type, std::string tableName,
+        common::ConflictAction onConflict,
+        std::unique_ptr<BoundExtraCreateCatalogEntryInfo> extraInfo, bool isInternal,
+        bool hasParent = false)
+        : type{type}, tableName{std::move(tableName)}, onConflict{onConflict},
+          extraInfo{std::move(extraInfo)}, isInternal{isInternal}, hasParent{hasParent} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundCreateTableInfo);
+
+    std::string toString() const;
+
+private:
+    BoundCreateTableInfo(const BoundCreateTableInfo& other)
+        : type{other.type}, tableName{other.tableName}, onConflict{other.onConflict},
+          extraInfo{other.extraInfo->copy()}, isInternal{other.isInternal},
+          hasParent{other.hasParent} {}
+};
+
+struct LBUG_API BoundExtraCreateTableInfo : BoundExtraCreateCatalogEntryInfo {
+    std::vector<PropertyDefinition> propertyDefinitions;
+
+    explicit BoundExtraCreateTableInfo(std::vector<PropertyDefinition> propertyDefinitions)
+        : propertyDefinitions{std::move(propertyDefinitions)} {}
+
+    BoundExtraCreateTableInfo(const BoundExtraCreateTableInfo& other)
+        : BoundExtraCreateTableInfo{copyVector(other.propertyDefinitions)} {}
+    BoundExtraCreateTableInfo& operator=(const BoundExtraCreateTableInfo&) = delete;
+
+    std::unique_ptr<BoundExtraCreateCatalogEntryInfo> copy() const override {
+        return std::make_unique<BoundExtraCreateTableInfo>(*this);
+    }
+};
+
+struct BoundExtraCreateNodeTableInfo final : BoundExtraCreateTableInfo {
+    std::string primaryKeyName;
+
+    BoundExtraCreateNodeTableInfo(std::string primaryKeyName,
+        std::vector<PropertyDefinition> definitions)
+        : BoundExtraCreateTableInfo{std::move(definitions)},
+          primaryKeyName{std::move(primaryKeyName)} {}
+    BoundExtraCreateNodeTableInfo(const BoundExtraCreateNodeTableInfo& other)
+        : BoundExtraCreateTableInfo{copyVector(other.propertyDefinitions)},
+          primaryKeyName{other.primaryKeyName} {}
+
+    std::unique_ptr<BoundExtraCreateCatalogEntryInfo> copy() const override {
+        return std::make_unique<BoundExtraCreateNodeTableInfo>(*this);
+    }
+};
+
+struct BoundExtraCreateRelTableGroupInfo final : BoundExtraCreateTableInfo {
+    common::RelMultiplicity srcMultiplicity;
+    common::RelMultiplicity dstMultiplicity;
+    common::ExtendDirection storageDirection;
+    std::vector<catalog::NodeTableIDPair> nodePairs;
+
+    explicit BoundExtraCreateRelTableGroupInfo(std::vector<PropertyDefinition> definitions,
+        common::RelMultiplicity srcMultiplicity, common::RelMultiplicity dstMultiplicity,
+        common::ExtendDirection storageDirection, std::vector<catalog::NodeTableIDPair> nodePairs)
+        : BoundExtraCreateTableInfo{std::move(definitions)}, srcMultiplicity{srcMultiplicity},
+          dstMultiplicity{dstMultiplicity}, storageDirection{storageDirection},
+          nodePairs{std::move(nodePairs)} {}
+
+    BoundExtraCreateRelTableGroupInfo(const BoundExtraCreateRelTableGroupInfo& other)
+        : BoundExtraCreateTableInfo{copyVector(other.propertyDefinitions)},
+          srcMultiplicity{other.srcMultiplicity}, dstMultiplicity{other.dstMultiplicity},
+          storageDirection{other.storageDirection}, nodePairs{other.nodePairs} {}
+
+    std::unique_ptr<BoundExtraCreateCatalogEntryInfo> copy() const override {
+        return std::make_unique<BoundExtraCreateRelTableGroupInfo>(*this);
+    }
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_type.h
new file mode 100644
index 0000000000..7bf1cc5561
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_create_type.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundCreateType final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::CREATE_TYPE;
+
+public:
+    explicit BoundCreateType(std::string name, common::LogicalType type)
+        : BoundStatement{type_, BoundStatementResult::createSingleStringColumnResult()},
+          name{std::move(name)}, type{std::move(type)} {}
+
+    std::string getName() const { return name; };
+
+    const common::LogicalType& getType() const { return type; }
+
+private:
+    std::string name;
+    common::LogicalType type;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_drop.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_drop.h
new file mode 100644
index 0000000000..b6bde72f35
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/bound_drop.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "parser/ddl/drop_info.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundDrop final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::DROP;
+
+public:
+    explicit BoundDrop(parser::DropInfo dropInfo)
+        : BoundStatement{type_, BoundStatementResult::createSingleStringColumnResult()},
+          dropInfo{std::move(dropInfo)} {}
+
+    const parser::DropInfo& getDropInfo() const { return dropInfo; };
+
+private:
+    parser::DropInfo dropInfo;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/property_definition.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/property_definition.h
new file mode 100644
index 0000000000..154fac041f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/ddl/property_definition.h
@@ -0,0 +1,47 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "parser/expression/parsed_expression.h"
+
+namespace lbug {
+namespace binder {
+
+struct LBUG_API ColumnDefinition {
+    std::string name;
+    common::LogicalType type;
+
+    ColumnDefinition() = default;
+    ColumnDefinition(std::string name, common::LogicalType type)
+        : name{std::move(name)}, type{std::move(type)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ColumnDefinition);
+
+private:
+    ColumnDefinition(const ColumnDefinition& other) : name{other.name}, type{other.type.copy()} {}
+};
+
+struct LBUG_API PropertyDefinition {
+    ColumnDefinition columnDefinition;
+    std::unique_ptr<parser::ParsedExpression> defaultExpr;
+
+    PropertyDefinition() = default;
+    explicit PropertyDefinition(ColumnDefinition columnDefinition);
+    PropertyDefinition(ColumnDefinition columnDefinition,
+        std::unique_ptr<parser::ParsedExpression> defaultExpr)
+        : columnDefinition{std::move(columnDefinition)}, defaultExpr{std::move(defaultExpr)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(PropertyDefinition);
+
+    std::string getName() const { return columnDefinition.name; }
+    const common::LogicalType& getType() const { return columnDefinition.type; }
+    std::string getDefaultExpressionName() const { return defaultExpr->getRawName(); }
+    void rename(const std::string& newName) { columnDefinition.name = newName; }
+
+    void serialize(common::Serializer& serializer) const;
+    static PropertyDefinition deserialize(common::Deserializer& deserializer);
+
+private:
+    PropertyDefinition(const PropertyDefinition& other)
+        : columnDefinition{other.columnDefinition.copy()}, defaultExpr{other.defaultExpr->copy()} {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/aggregate_function_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/aggregate_function_expression.h
new file mode 100644
index 0000000000..a8331988b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/aggregate_function_expression.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include "expression.h"
+#include "function/aggregate_function.h"
+
+namespace lbug {
+namespace binder {
+
+class AggregateFunctionExpression final : public Expression {
+    static constexpr common::ExpressionType expressionType_ =
+        common::ExpressionType::AGGREGATE_FUNCTION;
+
+public:
+    AggregateFunctionExpression(function::AggregateFunction function,
+        std::unique_ptr<function::FunctionBindData> bindData, expression_vector children,
+        std::string uniqueName)
+        : Expression{expressionType_, bindData->resultType.copy(), std::move(children),
+              std::move(uniqueName)},
+          function{std::move(function)}, bindData{std::move(bindData)} {}
+
+    const function::AggregateFunction& getFunction() const { return function; }
+    function::FunctionBindData* getBindData() const { return bindData.get(); }
+    bool isDistinct() const { return function.isDistinct; }
+
+    std::string toStringInternal() const override;
+
+    static std::string getUniqueName(const std::string& functionName,
+        const expression_vector& children, bool isDistinct);
+
+private:
+    function::AggregateFunction function;
+    std::unique_ptr<function::FunctionBindData> bindData;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/case_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/case_expression.h
new file mode 100644
index 0000000000..aa00cba841
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/case_expression.h
@@ -0,0 +1,44 @@
+#pragma once
+
+#include "expression.h"
+
+namespace lbug {
+namespace binder {
+
+struct CaseAlternative {
+    std::shared_ptr<Expression> whenExpression;
+    std::shared_ptr<Expression> thenExpression;
+
+    CaseAlternative(std::shared_ptr<Expression> whenExpression,
+        std::shared_ptr<Expression> thenExpression)
+        : whenExpression{std::move(whenExpression)}, thenExpression{std::move(thenExpression)} {}
+};
+
+class CaseExpression final : public Expression {
+    static constexpr common::ExpressionType expressionType_ = common::ExpressionType::CASE_ELSE;
+
+public:
+    CaseExpression(common::LogicalType dataType, std::shared_ptr<Expression> elseExpression,
+        const std::string& name)
+        : Expression{expressionType_, std::move(dataType), name},
+          elseExpression{std::move(elseExpression)} {}
+
+    void addCaseAlternative(std::shared_ptr<Expression> when, std::shared_ptr<Expression> then) {
+        caseAlternatives.push_back(make_unique<CaseAlternative>(std::move(when), std::move(then)));
+    }
+    common::idx_t getNumCaseAlternatives() const { return caseAlternatives.size(); }
+    CaseAlternative* getCaseAlternative(common::idx_t idx) const {
+        return caseAlternatives[idx].get();
+    }
+
+    std::shared_ptr<Expression> getElseExpression() const { return elseExpression; }
+
+    std::string toStringInternal() const override;
+
+private:
+    std::vector<std::unique_ptr<CaseAlternative>> caseAlternatives;
+    std::shared_ptr<Expression> elseExpression;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/expression.h
new file mode 100644
index 0000000000..968cc1a627
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/expression.h
@@ -0,0 +1,132 @@
+#pragma once
+
+#include <functional>
+#include <memory>
+#include <unordered_map>
+#include <unordered_set>
+#include <vector>
+
+#include "common/assert.h"
+#include "common/cast.h"
+#include "common/copy_constructors.h"
+#include "common/enums/expression_type.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace binder {
+
+class Expression;
+using expression_vector = std::vector<std::shared_ptr<Expression>>;
+using expression_pair = std::pair<std::shared_ptr<Expression>, std::shared_ptr<Expression>>;
+
+struct ExpressionHasher;
+struct ExpressionEquality;
+using expression_set =
+    std::unordered_set<std::shared_ptr<Expression>, ExpressionHasher, ExpressionEquality>;
+template<typename T>
+using expression_map =
+    std::unordered_map<std::shared_ptr<Expression>, T, ExpressionHasher, ExpressionEquality>;
+
+class LBUG_API Expression : public std::enable_shared_from_this<Expression> {
+    friend class ExpressionChildrenCollector;
+
+public:
+    Expression(common::ExpressionType expressionType, common::LogicalType dataType,
+        expression_vector children, std::string uniqueName)
+        : expressionType{expressionType}, dataType{std::move(dataType)},
+          uniqueName{std::move(uniqueName)}, children{std::move(children)} {}
+    // Create binary expression.
+    Expression(common::ExpressionType expressionType, common::LogicalType dataType,
+        const std::shared_ptr<Expression>& left, const std::shared_ptr<Expression>& right,
+        std::string uniqueName)
+        : Expression{expressionType, std::move(dataType), expression_vector{left, right},
+              std::move(uniqueName)} {}
+    // Create unary expression.
+    Expression(common::ExpressionType expressionType, common::LogicalType dataType,
+        const std::shared_ptr<Expression>& child, std::string uniqueName)
+        : Expression{expressionType, std::move(dataType), expression_vector{child},
+              std::move(uniqueName)} {}
+    // Create leaf expression
+    Expression(common::ExpressionType expressionType, common::LogicalType dataType,
+        std::string uniqueName)
+        : Expression{expressionType, std::move(dataType), expression_vector{},
+              std::move(uniqueName)} {}
+    DELETE_COPY_DEFAULT_MOVE(Expression);
+    virtual ~Expression();
+
+    void setUniqueName(const std::string& name) { uniqueName = name; }
+    std::string getUniqueName() const {
+        KU_ASSERT(!uniqueName.empty());
+        return uniqueName;
+    }
+
+    virtual void cast(const common::LogicalType& type);
+    const common::LogicalType& getDataType() const { return dataType; }
+
+    void setAlias(const std::string& newAlias) { alias = newAlias; }
+    bool hasAlias() const { return !alias.empty(); }
+    std::string getAlias() const { return alias; }
+
+    common::idx_t getNumChildren() const { return children.size(); }
+    std::shared_ptr<Expression> getChild(common::idx_t idx) const {
+        KU_ASSERT(idx < children.size());
+        return children[idx];
+    }
+    expression_vector getChildren() const { return children; }
+    void setChild(common::idx_t idx, std::shared_ptr<Expression> child) {
+        KU_ASSERT(idx < children.size());
+        children[idx] = std::move(child);
+    }
+
+    expression_vector splitOnAND();
+
+    bool operator==(const Expression& rhs) const { return uniqueName == rhs.uniqueName; }
+
+    std::string toString() const { return hasAlias() ? alias : toStringInternal(); }
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+
+protected:
+    virtual std::string toStringInternal() const = 0;
+
+public:
+    common::ExpressionType expressionType;
+    common::LogicalType dataType;
+
+protected:
+    // Name that serves as the unique identifier.
+    std::string uniqueName;
+    std::string alias;
+    expression_vector children;
+};
+
+struct ExpressionHasher {
+    std::size_t operator()(const std::shared_ptr<Expression>& expression) const {
+        return std::hash<std::string>{}(expression->getUniqueName());
+    }
+};
+
+struct ExpressionEquality {
+    bool operator()(const std::shared_ptr<Expression>& left,
+        const std::shared_ptr<Expression>& right) const {
+        return left->getUniqueName() == right->getUniqueName();
+    }
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/expression_util.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/expression_util.h
new file mode 100644
index 0000000000..4766215eee
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/expression_util.h
@@ -0,0 +1,84 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "common/types/value/value.h"
+#include "expression.h"
+
+namespace lbug {
+namespace binder {
+
+struct LBUG_API ExpressionUtil {
+    static expression_vector getExpressionsWithDataType(const expression_vector& expressions,
+        common::LogicalTypeID dataTypeID);
+
+    static uint32_t find(const Expression* target, const expression_vector& expressions);
+
+    // Print as a1,a2,a3,...
+    static std::string toString(const expression_vector& expressions);
+    static std::string toStringOrdered(const expression_vector& expressions);
+    // Print as a1=a2, a3=a4,...
+    static std::string toString(const std::vector<expression_pair>& expressionPairs);
+    // Print as a1=a2
+    static std::string toString(const expression_pair& expressionPair);
+    static std::string getUniqueName(const expression_vector& expressions);
+
+    static expression_vector excludeExpression(const expression_vector& exprs,
+        const Expression& exprToExclude);
+    static expression_vector excludeExpressions(const expression_vector& expressions,
+        const expression_vector& expressionsToExclude);
+
+    static common::logical_type_vec_t getDataTypes(const expression_vector& expressions);
+
+    static expression_vector removeDuplication(const expression_vector& expressions);
+
+    static bool isEmptyPattern(const Expression& expression);
+    static bool isNodePattern(const Expression& expression);
+    static bool isRelPattern(const Expression& expression);
+    static bool isRecursiveRelPattern(const Expression& expression);
+    static bool isNullLiteral(const Expression& expression);
+    static bool isBoolLiteral(const Expression& expression);
+    static bool isFalseLiteral(const Expression& expression);
+    static bool isEmptyList(const Expression& expression);
+
+    static void validateExpressionType(const Expression& expr, common::ExpressionType expectedType);
+    static void validateExpressionType(const Expression& expr,
+        std::vector<common::ExpressionType> expectedType);
+
+    // Validate data type.
+    static void validateDataType(const Expression& expr, const common::LogicalType& expectedType);
+    // Validate recursive data type top level (used when child type is unknown).
+    static void validateDataType(const Expression& expr, common::LogicalTypeID expectedTypeID);
+    static void validateDataType(const Expression& expr,
+        const std::vector<common::LogicalTypeID>& expectedTypeIDs);
+    template<typename T>
+    static T getLiteralValue(const Expression& expr);
+
+    static bool tryCombineDataType(const expression_vector& expressions,
+        common::LogicalType& result);
+
+    // Check If we can directly assign a new data type to an expression.
+    // This mostly happen when a literal is an empty list. By default, we assign its data type to
+    // INT64[] but it can be cast to any other list type at compile time.
+    static bool canCastStatically(const Expression& expr, const common::LogicalType& targetType);
+
+    static bool canEvaluateAsLiteral(const Expression& expr);
+    static common::Value evaluateAsLiteralValue(const Expression& expr);
+    static uint64_t evaluateAsSkipLimit(const Expression& expr);
+
+    template<typename T>
+    using validate_param_func = void (*)(T);
+
+    template<typename T>
+    static T getExpressionVal(const Expression& expr, const common::Value& value,
+        const common::LogicalType& targetType, validate_param_func<T> validateParamFunc = nullptr);
+
+    template<typename T>
+    static T evaluateLiteral(main::ClientContext* context, std::shared_ptr<Expression> expression,
+        const common::LogicalType& type, validate_param_func<T> validateParamFunc = nullptr);
+
+    static std::shared_ptr<Expression> applyImplicitCastingIfNecessary(main::ClientContext* context,
+        std::shared_ptr<Expression> expr, common::LogicalType targetType);
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/lambda_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/lambda_expression.h
new file mode 100644
index 0000000000..7fb344d2c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/lambda_expression.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include "expression.h"
+#include "parser/expression/parsed_expression.h"
+
+namespace lbug {
+namespace binder {
+
+class LambdaExpression final : public Expression {
+    static constexpr common::ExpressionType type_ = common::ExpressionType::LAMBDA;
+
+public:
+    LambdaExpression(std::unique_ptr<parser::ParsedExpression> parsedLambdaExpr,
+        std::string uniqueName)
+        : Expression{type_, common::LogicalType::ANY(), std::move(uniqueName)},
+          parsedLambdaExpr{std::move(parsedLambdaExpr)} {}
+
+    void cast(const common::LogicalType& type_) override {
+        KU_ASSERT(dataType.getLogicalTypeID() == common::LogicalTypeID::ANY);
+        dataType = type_.copy();
+    }
+
+    parser::ParsedExpression* getParsedLambdaExpr() const { return parsedLambdaExpr.get(); }
+
+    void setFunctionExpr(std::shared_ptr<Expression> expr) { functionExpr = std::move(expr); }
+    std::shared_ptr<Expression> getFunctionExpr() const { return functionExpr; }
+
+    std::string toStringInternal() const override { return parsedLambdaExpr->toString(); }
+
+private:
+    std::unique_ptr<parser::ParsedExpression> parsedLambdaExpr;
+    std::shared_ptr<Expression> functionExpr;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/literal_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/literal_expression.h
new file mode 100644
index 0000000000..abad7511da
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/literal_expression.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "common/types/value/value.h"
+#include "expression.h"
+
+namespace lbug {
+namespace binder {
+
+class LBUG_API LiteralExpression final : public Expression {
+    static constexpr common::ExpressionType type_ = common::ExpressionType::LITERAL;
+
+public:
+    LiteralExpression(common::Value value, const std::string& uniqueName)
+        : Expression{type_, value.getDataType().copy(), uniqueName}, value{std::move(value)} {}
+
+    bool isNull() const { return value.isNull(); }
+
+    void cast(const common::LogicalType& type) override;
+
+    common::Value getValue() const { return value; }
+
+    std::string toStringInternal() const override { return value.toString(); }
+
+public:
+    common::Value value;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/node_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/node_expression.h
new file mode 100644
index 0000000000..8269468fc3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/node_expression.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "node_rel_expression.h"
+
+namespace lbug {
+namespace binder {
+
+class LBUG_API NodeExpression final : public NodeOrRelExpression {
+public:
+    NodeExpression(common::LogicalType dataType, std::string uniqueName, std::string variableName,
+        std::vector<catalog::TableCatalogEntry*> entries)
+        : NodeOrRelExpression{std::move(dataType), std::move(uniqueName), std::move(variableName),
+              std::move(entries)} {}
+
+    ~NodeExpression() override;
+
+    bool isMultiLabeled() const override { return entries.size() > 1; }
+
+    void setInternalID(std::shared_ptr<PropertyExpression> expr) { internalID = std::move(expr); }
+    std::shared_ptr<PropertyExpression> getInternalID() const override {
+        KU_ASSERT(internalID != nullptr);
+        return internalID;
+    }
+
+    // Get the primary key property expression for a given table ID.
+    std::shared_ptr<Expression> getPrimaryKey(common::table_id_t tableID) const;
+
+private:
+    std::shared_ptr<PropertyExpression> internalID;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/node_rel_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/node_rel_expression.h
new file mode 100644
index 0000000000..74e9c54c4a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/node_rel_expression.h
@@ -0,0 +1,95 @@
+#pragma once
+
+#include "common/case_insensitive_map.h"
+#include "expression.h"
+#include "property_expression.h"
+
+namespace lbug {
+namespace catalog {
+class TableCatalogEntry;
+}
+namespace binder {
+
+class LBUG_API NodeOrRelExpression : public Expression {
+    static constexpr common::ExpressionType expressionType_ = common::ExpressionType::PATTERN;
+
+public:
+    NodeOrRelExpression(common::LogicalType dataType, std::string uniqueName,
+        std::string variableName, std::vector<catalog::TableCatalogEntry*> entries)
+        : Expression{expressionType_, std::move(dataType), std::move(uniqueName)},
+          variableName(std::move(variableName)), entries{std::move(entries)} {}
+
+    void setDataType(common::LogicalType dataType) { this->dataType = std::move(dataType); }
+
+    std::string getVariableName() const { return variableName; }
+
+    bool isEmpty() const { return entries.empty(); }
+    virtual bool isMultiLabeled() const = 0;
+
+    common::table_id_vector_t getTableIDs() const;
+    common::table_id_set_t getTableIDsSet() const;
+
+    // Table entries
+    common::idx_t getNumEntries() const { return entries.size(); }
+    const std::vector<catalog::TableCatalogEntry*>& getEntries() const { return entries; }
+    catalog::TableCatalogEntry* getEntry(common::idx_t idx) const { return entries[idx]; }
+    void setEntries(std::vector<catalog::TableCatalogEntry*> entries_) {
+        entries = std::move(entries_);
+    }
+    void addEntries(const std::vector<catalog::TableCatalogEntry*>& entries_);
+
+    // Property expressions
+    void addPropertyExpression(std::shared_ptr<PropertyExpression> property);
+    bool hasPropertyExpression(const std::string& propertyName) const {
+        return propertyNameToIdx.contains(propertyName);
+    }
+    std::vector<std::shared_ptr<PropertyExpression>> getPropertyExpressions() const {
+        return propertyExprs;
+    }
+    std::shared_ptr<PropertyExpression> getPropertyExpression(
+        const std::string& propertyName) const {
+        KU_ASSERT(propertyNameToIdx.contains(propertyName));
+        return propertyExprs[propertyNameToIdx.at(propertyName)];
+    }
+    virtual std::shared_ptr<PropertyExpression> getInternalID() const = 0;
+
+    // Label expression
+    void setLabelExpression(std::shared_ptr<Expression> expression) {
+        labelExpression = std::move(expression);
+    }
+    std::shared_ptr<Expression> getLabelExpression() const { return labelExpression; }
+
+    // Property data expressions
+    void addPropertyDataExpr(std::string propertyName, std::shared_ptr<Expression> expr) {
+        propertyDataExprs.insert({propertyName, expr});
+    }
+    const common::case_insensitive_map_t<std::shared_ptr<Expression>>&
+    getPropertyDataExprRef() const {
+        return propertyDataExprs;
+    }
+    bool hasPropertyDataExpr(const std::string& propertyName) const {
+        return propertyDataExprs.contains(propertyName);
+    }
+    std::shared_ptr<Expression> getPropertyDataExpr(const std::string& propertyName) const {
+        KU_ASSERT(propertyDataExprs.contains(propertyName));
+        return propertyDataExprs.at(propertyName);
+    }
+
+    std::string toStringInternal() const final { return variableName; }
+
+protected:
+    std::string variableName;
+    // A pattern may bind to multiple tables.
+    std::vector<catalog::TableCatalogEntry*> entries;
+    // Index over propertyExprs on property name.
+    common::case_insensitive_map_t<common::idx_t> propertyNameToIdx;
+    // Property expressions with order (aligned with catalog).
+    std::vector<std::shared_ptr<PropertyExpression>> propertyExprs;
+    // Label expression
+    std::shared_ptr<Expression> labelExpression;
+    // Property data expressions specified by user in the form of "{propertyName : data}"
+    common::case_insensitive_map_t<std::shared_ptr<Expression>> propertyDataExprs;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/parameter_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/parameter_expression.h
new file mode 100644
index 0000000000..87eaa9660a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/parameter_expression.h
@@ -0,0 +1,31 @@
+#pragma once
+
+#include "common/types/value/value.h"
+#include "expression.h"
+
+namespace lbug {
+namespace binder {
+
+class LBUG_API ParameterExpression final : public Expression {
+    static constexpr common::ExpressionType expressionType = common::ExpressionType::PARAMETER;
+
+public:
+    explicit ParameterExpression(const std::string& parameterName, common::Value value)
+        : Expression{expressionType, value.getDataType().copy(), createUniqueName(parameterName)},
+          parameterName(parameterName), value{std::move(value)} {}
+
+    void cast(const common::LogicalType& type) override;
+
+    common::Value getValue() const { return value; }
+
+private:
+    std::string toStringInternal() const override { return "$" + parameterName; }
+    static std::string createUniqueName(const std::string& input) { return "$" + input; }
+
+private:
+    std::string parameterName;
+    common::Value value;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/path_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/path_expression.h
new file mode 100644
index 0000000000..55c940e0fc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/path_expression.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+
+namespace lbug {
+namespace binder {
+
+class PathExpression final : public Expression {
+public:
+    PathExpression(common::LogicalType dataType, std::string uniqueName, std::string variableName,
+        common::LogicalType nodeType, common::LogicalType relType, expression_vector children)
+        : Expression{common::ExpressionType::PATH, std::move(dataType), std::move(children),
+              std::move(uniqueName)},
+          variableName{std::move(variableName)}, nodeType{std::move(nodeType)},
+          relType{std::move(relType)} {}
+
+    std::string getVariableName() const { return variableName; }
+    const common::LogicalType& getNodeType() const { return nodeType; }
+    const common::LogicalType& getRelType() const { return relType; }
+
+    std::string toStringInternal() const override { return variableName; }
+
+private:
+    std::string variableName;
+    common::LogicalType nodeType;
+    common::LogicalType relType;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/property_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/property_expression.h
new file mode 100644
index 0000000000..9671dd57b2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/property_expression.h
@@ -0,0 +1,76 @@
+#pragma once
+
+#include "common/constants.h"
+#include "expression.h"
+
+namespace lbug {
+namespace catalog {
+class TableCatalogEntry;
+}
+namespace binder {
+
+struct SingleLabelPropertyInfo {
+    bool exists;
+    bool isPrimaryKey;
+
+    explicit SingleLabelPropertyInfo(bool exists, bool isPrimaryKey)
+        : exists{exists}, isPrimaryKey{isPrimaryKey} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(SingleLabelPropertyInfo);
+
+private:
+    SingleLabelPropertyInfo(const SingleLabelPropertyInfo& other)
+        : exists{other.exists}, isPrimaryKey{other.isPrimaryKey} {}
+};
+
+class LBUG_API PropertyExpression final : public Expression {
+    static constexpr common::ExpressionType expressionType_ = common::ExpressionType::PROPERTY;
+
+public:
+    PropertyExpression(common::LogicalType dataType, std::string propertyName,
+        std::string uniqueVarName, std::string rawVariableName,
+        common::table_id_map_t<SingleLabelPropertyInfo> infos)
+        : Expression{expressionType_, std::move(dataType), uniqueVarName + "." + propertyName},
+          propertyName{std::move(propertyName)}, uniqueVarName{std::move(uniqueVarName)},
+          rawVariableName{std::move(rawVariableName)}, infos{std::move(infos)} {}
+
+    PropertyExpression(const PropertyExpression& other)
+        : Expression{expressionType_, other.dataType.copy(), other.uniqueName},
+          propertyName{other.propertyName}, uniqueVarName{other.uniqueVarName},
+          rawVariableName{other.rawVariableName}, infos{copyUnorderedMap(other.infos)} {}
+
+    // If this property is primary key on all tables.
+    bool isPrimaryKey() const;
+    // If this property is primary key for given table.
+    bool isPrimaryKey(common::table_id_t tableID) const;
+
+    std::string getPropertyName() const { return propertyName; }
+    std::string getVariableName() const { return uniqueVarName; }
+    std::string getRawVariableName() const { return rawVariableName; }
+
+    // If this property exists for given table.
+    bool hasProperty(common::table_id_t tableID) const;
+
+    // common::column_id_t getColumnID(const catalog::TableCatalogEntry& entry) const;
+    bool isSingleLabel() const { return infos.size() == 1; }
+    common::table_id_t getSingleTableID() const { return infos.begin()->first; }
+
+    bool isInternalID() const { return getPropertyName() == common::InternalKeyword::ID; }
+
+    std::string toStringInternal() const override { return rawVariableName + "." + propertyName; }
+
+    std::unique_ptr<PropertyExpression> copy() const {
+        return std::make_unique<PropertyExpression>(*this);
+    }
+
+private:
+    std::string propertyName;
+    // unique identifier references to a node/rel table.
+    std::string uniqueVarName;
+    // printable identifier references to a node/rel table.
+    std::string rawVariableName;
+    // The same property name may have different info on each table.
+    common::table_id_map_t<SingleLabelPropertyInfo> infos;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/rel_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/rel_expression.h
new file mode 100644
index 0000000000..788aa0dbf7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/rel_expression.h
@@ -0,0 +1,123 @@
+#pragma once
+
+#include "common/constants.h"
+#include "common/enums/extend_direction.h"
+#include "common/enums/query_rel_type.h"
+#include "function/gds/rec_joins.h"
+#include "node_expression.h"
+
+namespace lbug {
+namespace binder {
+
+enum class RelDirectionType : uint8_t {
+    SINGLE = 0,
+    BOTH = 1,
+    UNKNOWN = 2,
+};
+
+class RelExpression;
+
+struct RecursiveInfo {
+    /*
+     * E.g. [e*1..2 (r, n) | WHERE n.age > 10 AND r.year = 2012 ]
+     * node = n
+     * nodeCopy = n (see comment below)
+     * rel = r
+     * predicates = [n.age > 10, r.year = 2012]
+     * */
+    std::shared_ptr<NodeExpression> node = nullptr;
+    // NodeCopy has the same fields as node but a different unique name.
+    // We use nodeCopy to plan recursive plan because boundNode&nbrNode cannot be the same.
+    std::shared_ptr<NodeExpression> nodeCopy = nullptr;
+    std::shared_ptr<RelExpression> rel = nullptr;
+    // Predicates
+    std::shared_ptr<Expression> nodePredicate = nullptr;
+    std::shared_ptr<Expression> relPredicate = nullptr;
+    // Projection list
+    expression_vector nodeProjectionList;
+    expression_vector relProjectionList;
+    // Function information
+    std::unique_ptr<function::RJAlgorithm> function;
+    std::unique_ptr<function::RJBindData> bindData;
+};
+
+class LBUG_API RelExpression final : public NodeOrRelExpression {
+public:
+    RelExpression(common::LogicalType dataType, std::string uniqueName, std::string variableName,
+        std::vector<catalog::TableCatalogEntry*> entries, std::shared_ptr<NodeExpression> srcNode,
+        std::shared_ptr<NodeExpression> dstNode, RelDirectionType directionType,
+        common::QueryRelType relType)
+        : NodeOrRelExpression{std::move(dataType), std::move(uniqueName), std::move(variableName),
+              std::move(entries)},
+          srcNode{std::move(srcNode)}, dstNode{std::move(dstNode)}, directionType{directionType},
+          relType{relType} {}
+
+    bool isRecursive() const {
+        return dataType.getLogicalTypeID() == common::LogicalTypeID::RECURSIVE_REL;
+    }
+
+    bool isMultiLabeled() const override;
+    bool isBoundByMultiLabeledNode() const {
+        return srcNode->isMultiLabeled() || dstNode->isMultiLabeled();
+    }
+
+    std::shared_ptr<NodeExpression> getSrcNode() const { return srcNode; }
+    std::string getSrcNodeName() const { return srcNode->getUniqueName(); }
+    void setDstNode(std::shared_ptr<NodeExpression> node) { dstNode = std::move(node); }
+    std::shared_ptr<NodeExpression> getDstNode() const { return dstNode; }
+    std::string getDstNodeName() const { return dstNode->getUniqueName(); }
+
+    void setLeftNode(std::shared_ptr<NodeExpression> node) { leftNode = std::move(node); }
+    std::shared_ptr<NodeExpression> getLeftNode() const { return leftNode; }
+    void setRightNode(std::shared_ptr<NodeExpression> node) { rightNode = std::move(node); }
+    std::shared_ptr<NodeExpression> getRightNode() const { return rightNode; }
+
+    common::QueryRelType getRelType() const { return relType; }
+
+    void setDirectionExpr(std::shared_ptr<Expression> expr) { directionExpr = std::move(expr); }
+    bool hasDirectionExpr() const { return directionExpr != nullptr; }
+    std::shared_ptr<Expression> getDirectionExpr() const { return directionExpr; }
+    RelDirectionType getDirectionType() const { return directionType; }
+
+    std::shared_ptr<PropertyExpression> getInternalID() const override {
+        return getPropertyExpression(common::InternalKeyword::ID);
+    }
+
+    void setRecursiveInfo(std::unique_ptr<RecursiveInfo> recursiveInfo_) {
+        recursiveInfo = std::move(recursiveInfo_);
+    }
+    const RecursiveInfo* getRecursiveInfo() const { return recursiveInfo.get(); }
+    std::shared_ptr<Expression> getLengthExpression() const {
+        KU_ASSERT(recursiveInfo != nullptr);
+        return recursiveInfo->bindData->lengthExpr;
+    }
+
+    bool isSelfLoop() const { return *srcNode == *dstNode; }
+
+    std::string detailsToString() const;
+
+    // if multiple tables match the pattern
+    // returns the intersection of available extend directions for all matched tables
+    std::vector<common::ExtendDirection> getExtendDirections() const;
+
+    std::vector<common::table_id_t> getInnerRelTableIDs() const;
+
+private:
+    // Start node if a directed arrow is given. Left node otherwise.
+    std::shared_ptr<NodeExpression> srcNode;
+    // End node if a directed arrow is given. Right node otherwise.
+    std::shared_ptr<NodeExpression> dstNode;
+    std::shared_ptr<NodeExpression> leftNode;
+    std::shared_ptr<NodeExpression> rightNode;
+    // Whether relationship is directed.
+    RelDirectionType directionType;
+    // Direction expr is nullptr when direction type is SINGLE
+    std::shared_ptr<Expression> directionExpr;
+    // Whether relationship type is recursive.
+    common::QueryRelType relType;
+    // Null if relationship type is non-recursive.
+    std::unique_ptr<RecursiveInfo> recursiveInfo;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/scalar_function_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/scalar_function_expression.h
new file mode 100644
index 0000000000..c714831355
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/scalar_function_expression.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "expression.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace binder {
+
+class ScalarFunctionExpression final : public Expression {
+public:
+    ScalarFunctionExpression(common::ExpressionType expressionType,
+        std::unique_ptr<function::ScalarFunction> function,
+        std::unique_ptr<function::FunctionBindData> bindData, expression_vector children,
+        std::string uniqueName)
+        : Expression{expressionType, bindData->resultType.copy(), std::move(children),
+              std::move(uniqueName)},
+          function{std::move(function)}, bindData{std::move(bindData)} {}
+
+    const function::ScalarFunction& getFunction() const { return *function; }
+    function::FunctionBindData* getBindData() const { return bindData.get(); }
+
+    std::string toStringInternal() const override;
+
+    static std::string getUniqueName(const std::string& functionName,
+        const expression_vector& children);
+
+private:
+    std::unique_ptr<function::ScalarFunction> function;
+    std::unique_ptr<function::FunctionBindData> bindData;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/subquery_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/subquery_expression.h
new file mode 100644
index 0000000000..28d1c2a157
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/subquery_expression.h
@@ -0,0 +1,55 @@
+#pragma once
+
+#include "binder/query/query_graph.h"
+#include "binder/query/reading_clause/bound_join_hint.h"
+#include "common/enums/subquery_type.h"
+#include "expression.h"
+
+namespace lbug {
+namespace binder {
+
+class SubqueryExpression final : public Expression {
+    static constexpr common::ExpressionType expressionType_ = common::ExpressionType::SUBQUERY;
+
+public:
+    SubqueryExpression(common::SubqueryType subqueryType, common::LogicalType dataType,
+        QueryGraphCollection queryGraphCollection, std::string uniqueName, std::string rawName)
+        : Expression{expressionType_, std::move(dataType), std::move(uniqueName)},
+          subqueryType{subqueryType}, queryGraphCollection{std::move(queryGraphCollection)},
+          rawName{std::move(rawName)} {}
+
+    common::SubqueryType getSubqueryType() const { return subqueryType; }
+
+    const QueryGraphCollection* getQueryGraphCollection() const { return &queryGraphCollection; }
+
+    void setWhereExpression(std::shared_ptr<Expression> expression) {
+        whereExpression = std::move(expression);
+    }
+    bool hasWhereExpression() const { return whereExpression != nullptr; }
+    std::shared_ptr<Expression> getWhereExpression() const { return whereExpression; }
+    expression_vector getPredicatesSplitOnAnd() const {
+        return hasWhereExpression() ? whereExpression->splitOnAND() : expression_vector{};
+    }
+
+    void setCountStarExpr(std::shared_ptr<Expression> expr) { countStarExpr = std::move(expr); }
+    std::shared_ptr<Expression> getCountStarExpr() const { return countStarExpr; }
+    void setProjectionExpr(std::shared_ptr<Expression> expr) { projectionExpr = std::move(expr); }
+    std::shared_ptr<Expression> getProjectionExpr() const { return projectionExpr; }
+
+    void setHint(std::shared_ptr<BoundJoinHintNode> root) { hintRoot = std::move(root); }
+    std::shared_ptr<BoundJoinHintNode> getHint() const { return hintRoot; }
+
+    std::string toStringInternal() const override { return rawName; }
+
+private:
+    common::SubqueryType subqueryType;
+    QueryGraphCollection queryGraphCollection;
+    std::shared_ptr<Expression> whereExpression;
+    std::shared_ptr<Expression> countStarExpr;
+    std::shared_ptr<Expression> projectionExpr;
+    std::shared_ptr<BoundJoinHintNode> hintRoot;
+    std::string rawName;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/variable_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/variable_expression.h
new file mode 100644
index 0000000000..7c56b26273
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression/variable_expression.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "expression.h"
+
+namespace lbug {
+namespace binder {
+
+class VariableExpression final : public Expression {
+    static constexpr common::ExpressionType expressionType_ = common::ExpressionType::VARIABLE;
+
+public:
+    VariableExpression(common::LogicalType dataType, std::string uniqueName,
+        std::string variableName)
+        : Expression{expressionType_, std::move(dataType), std::move(uniqueName)},
+          variableName{std::move(variableName)} {}
+
+    std::string getVariableName() const { return variableName; }
+
+    void cast(const common::LogicalType& type) override;
+
+    std::string toStringInternal() const override { return variableName; }
+
+private:
+    std::string variableName;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression_binder.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression_binder.h
new file mode 100644
index 0000000000..1f41266696
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression_binder.h
@@ -0,0 +1,155 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/types/value/value.h"
+#include "parser/expression/parsed_expression.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+
+namespace function {
+struct Function;
+}
+
+namespace binder {
+
+class Binder;
+struct CaseAlternative;
+
+struct ExpressionBinderConfig {
+    // If a property is not in projection list but required in order by after aggregation,
+    // we need to bind it as struct extraction because node/rel must have been evaluated as
+    // struct during aggregate
+    // e.g. RETURN a, COUNT(*) ORDER BY a.ID
+    bool bindOrderByAfterAggregate = false;
+    // If a node is single labeled, we rewrite its label function as string literal. This however,
+    // should be applied to recursive pattern predicate because if path is of length <= 1, there
+    // is no intermediate node and thus the predicate should be a noop. If we try to evaluate, it
+    // may lead to empty result.
+    // e.g. [* (r, n | WHERE label(n)='dummy') ]
+    bool disableLabelFunctionLiteralRewrite = false;
+};
+
+class ExpressionBinder {
+    friend class Binder;
+
+public:
+    ExpressionBinder(Binder* queryBinder, main::ClientContext* context)
+        : binder{queryBinder}, context{context} {}
+
+    std::shared_ptr<Expression> bindExpression(const parser::ParsedExpression& parsedExpression);
+
+    // TODO(Xiyang): move to an expression rewriter
+    LBUG_API std::shared_ptr<Expression> foldExpression(
+        const std::shared_ptr<Expression>& expression) const;
+
+    // Boolean expressions.
+    std::shared_ptr<Expression> bindBooleanExpression(
+        const parser::ParsedExpression& parsedExpression);
+    std::shared_ptr<Expression> bindBooleanExpression(common::ExpressionType expressionType,
+        const expression_vector& children);
+
+    std::shared_ptr<Expression> combineBooleanExpressions(common::ExpressionType expressionType,
+        std::shared_ptr<Expression> left, std::shared_ptr<Expression> right);
+    // Comparison expressions.
+    std::shared_ptr<Expression> bindComparisonExpression(
+        const parser::ParsedExpression& parsedExpression);
+    std::shared_ptr<Expression> bindComparisonExpression(common::ExpressionType expressionType,
+        const expression_vector& children);
+    std::shared_ptr<Expression> createEqualityComparisonExpression(std::shared_ptr<Expression> left,
+        std::shared_ptr<Expression> right);
+    // Null operator expressions.
+    std::shared_ptr<Expression> bindNullOperatorExpression(
+        const parser::ParsedExpression& parsedExpression);
+    std::shared_ptr<Expression> bindNullOperatorExpression(common::ExpressionType expressionType,
+        const expression_vector& children);
+
+    // Property expressions.
+    expression_vector bindPropertyStarExpression(const parser::ParsedExpression& parsedExpression);
+    static expression_vector bindNodeOrRelPropertyStarExpression(const Expression& child);
+    expression_vector bindStructPropertyStarExpression(const std::shared_ptr<Expression>& child);
+    std::shared_ptr<Expression> bindPropertyExpression(
+        const parser::ParsedExpression& parsedExpression);
+    static std::shared_ptr<Expression> bindNodeOrRelPropertyExpression(const Expression& child,
+        const std::string& propertyName);
+    std::shared_ptr<Expression> bindStructPropertyExpression(std::shared_ptr<Expression> child,
+        const std::string& propertyName);
+    // Function expressions.
+    std::shared_ptr<Expression> bindFunctionExpression(const parser::ParsedExpression& expr);
+    void bindLambdaExpression(const Expression& lambdaInput, Expression& lambdaExpr) const;
+    std::shared_ptr<Expression> bindLambdaExpression(
+        const parser::ParsedExpression& parsedExpr) const;
+
+    std::shared_ptr<Expression> bindScalarFunctionExpression(
+        const parser::ParsedExpression& parsedExpression, const std::string& functionName);
+    std::shared_ptr<Expression> bindScalarFunctionExpression(const expression_vector& children,
+        const std::string& functionName,
+        std::vector<std::string> optionalArguments = std::vector<std::string>{});
+    std::shared_ptr<Expression> bindRewriteFunctionExpression(const parser::ParsedExpression& expr);
+    std::shared_ptr<Expression> bindAggregateFunctionExpression(
+        const parser::ParsedExpression& parsedExpression, const std::string& functionName,
+        bool isDistinct);
+    std::shared_ptr<Expression> bindMacroExpression(
+        const parser::ParsedExpression& parsedExpression, const std::string& macroName);
+
+    // Parameter expressions.
+    std::shared_ptr<Expression> bindParameterExpression(
+        const parser::ParsedExpression& parsedExpression);
+    // Literal expressions.
+    std::shared_ptr<Expression> bindLiteralExpression(
+        const parser::ParsedExpression& parsedExpression) const;
+    std::shared_ptr<Expression> createLiteralExpression(const common::Value& value) const;
+    std::shared_ptr<Expression> createLiteralExpression(const std::string& strVal) const;
+    std::shared_ptr<Expression> createNullLiteralExpression() const;
+    std::shared_ptr<Expression> createNullLiteralExpression(const common::Value& value) const;
+    // Variable expressions.
+    std::shared_ptr<Expression> bindVariableExpression(
+        const parser::ParsedExpression& parsedExpression) const;
+    std::shared_ptr<Expression> bindVariableExpression(const std::string& varName) const;
+    std::shared_ptr<Expression> createVariableExpression(common::LogicalType logicalType,
+        std::string_view name) const;
+    std::shared_ptr<Expression> createVariableExpression(common::LogicalType logicalType,
+        std::string name) const;
+    // Subquery expressions.
+    std::shared_ptr<Expression> bindSubqueryExpression(const parser::ParsedExpression& parsedExpr);
+    // Case expressions.
+    std::shared_ptr<Expression> bindCaseExpression(
+        const parser::ParsedExpression& parsedExpression);
+
+    /****** cast *****/
+    LBUG_API std::shared_ptr<Expression> implicitCastIfNecessary(
+        const std::shared_ptr<Expression>& expression, const common::LogicalType& targetType);
+    // Use implicitCast to cast to types you have obtained through known implicit casting rules.
+    // Use forceCast to cast to types you have obtained through other means, for example,
+    // through a maxLogicalType function
+    std::shared_ptr<Expression> implicitCast(const std::shared_ptr<Expression>& expression,
+        const common::LogicalType& targetType);
+    std::shared_ptr<Expression> forceCast(const std::shared_ptr<Expression>& expression,
+        const common::LogicalType& targetType);
+
+    // Parameter
+    void addParameter(const std::string& name, std::shared_ptr<common::Value> value);
+    const std::unordered_set<std::string>& getUnknownParameters() const {
+        return unknownParameters;
+    }
+    const std::unordered_map<std::string, std::shared_ptr<common::Value>>&
+    getKnownParameters() const {
+        return knownParameters;
+    }
+
+    std::string getUniqueName(const std::string& name) const;
+
+    const ExpressionBinderConfig& getConfig() { return config; }
+
+private:
+    Binder* binder;
+    main::ClientContext* context;
+    std::unordered_set<std::string> unknownParameters;
+    std::unordered_map<std::string, std::shared_ptr<common::Value>> knownParameters;
+    ExpressionBinderConfig config;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression_visitor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression_visitor.h
new file mode 100644
index 0000000000..6be80adc1a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/expression_visitor.h
@@ -0,0 +1,101 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+
+namespace lbug {
+namespace binder {
+
+class ExpressionChildrenCollector {
+public:
+    static expression_vector collectChildren(const Expression& expression);
+
+private:
+    static expression_vector collectCaseChildren(const Expression& expression);
+
+    static expression_vector collectSubqueryChildren(const Expression& expression);
+
+    static expression_vector collectNodeChildren(const Expression& expression);
+
+    static expression_vector collectRelChildren(const Expression& expression);
+};
+
+class ExpressionVisitor {
+public:
+    virtual ~ExpressionVisitor() = default;
+
+    void visit(std::shared_ptr<Expression> expr);
+
+    static bool isRandom(const Expression& expression);
+
+protected:
+    void visitSwitch(std::shared_ptr<Expression> expr);
+    virtual void visitFunctionExpr(std::shared_ptr<Expression>) {}
+    virtual void visitAggFunctionExpr(std::shared_ptr<Expression>) {}
+    virtual void visitPropertyExpr(std::shared_ptr<Expression>) {}
+    virtual void visitLiteralExpr(std::shared_ptr<Expression>) {}
+    virtual void visitVariableExpr(std::shared_ptr<Expression>) {}
+    virtual void visitPathExpr(std::shared_ptr<Expression>) {}
+    virtual void visitNodeRelExpr(std::shared_ptr<Expression>) {}
+    virtual void visitParamExpr(std::shared_ptr<Expression>) {}
+    virtual void visitSubqueryExpr(std::shared_ptr<Expression>) {}
+    virtual void visitCaseExpr(std::shared_ptr<Expression>) {}
+    virtual void visitGraphExpr(std::shared_ptr<Expression>) {}
+    virtual void visitLambdaExpr(std::shared_ptr<Expression>) {}
+
+    virtual void visitChildren(const Expression& expr);
+    void visitCaseExprChildren(const Expression& expr);
+};
+
+// Do not collect subquery expression recursively. Caller should handle recursive subquery instead.
+class SubqueryExprCollector final : public ExpressionVisitor {
+public:
+    bool hasSubquery() const { return !exprs.empty(); }
+    expression_vector getSubqueryExprs() const { return exprs; }
+
+protected:
+    void visitSubqueryExpr(std::shared_ptr<Expression> expr) override { exprs.push_back(expr); }
+
+private:
+    expression_vector exprs;
+};
+
+class DependentVarNameCollector final : public ExpressionVisitor {
+public:
+    std::unordered_set<std::string> getVarNames() const { return varNames; }
+
+protected:
+    void visitSubqueryExpr(std::shared_ptr<Expression> expr) override;
+    void visitPropertyExpr(std::shared_ptr<Expression> expr) override;
+    void visitNodeRelExpr(std::shared_ptr<Expression> expr) override;
+    void visitVariableExpr(std::shared_ptr<Expression> expr) override;
+
+private:
+    std::unordered_set<std::string> varNames;
+};
+
+class PropertyExprCollector final : public ExpressionVisitor {
+public:
+    expression_vector getPropertyExprs() const { return expressions; }
+
+protected:
+    void visitSubqueryExpr(std::shared_ptr<Expression> expr) override;
+    void visitPropertyExpr(std::shared_ptr<Expression> expr) override;
+    void visitNodeRelExpr(std::shared_ptr<Expression> expr) override;
+
+private:
+    expression_vector expressions;
+};
+
+class ConstantExpressionVisitor {
+public:
+    static bool needFold(const Expression& expr);
+    static bool isConstant(const Expression& expr);
+
+private:
+    static bool visitFunction(const Expression& expr);
+    static bool visitCase(const Expression& expr);
+    static bool visitChildren(const Expression& expr);
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/bound_regular_query.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/bound_regular_query.h
new file mode 100644
index 0000000000..d5293ff505
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/bound_regular_query.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "normalized_single_query.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundRegularQuery final : public BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::QUERY;
+
+public:
+    explicit BoundRegularQuery(std::vector<bool> isUnionAll, BoundStatementResult statementResult)
+        : BoundStatement{type_, std::move(statementResult)}, isUnionAll{std::move(isUnionAll)} {}
+
+    void addSingleQuery(NormalizedSingleQuery singleQuery) {
+        singleQueries.push_back(std::move(singleQuery));
+    }
+    common::idx_t getNumSingleQueries() const { return singleQueries.size(); }
+    NormalizedSingleQuery* getSingleQueryUnsafe(common::idx_t idx) { return &singleQueries[idx]; }
+    const NormalizedSingleQuery* getSingleQuery(common::idx_t idx) const {
+        return &singleQueries[idx];
+    }
+
+    bool getIsUnionAll(common::idx_t idx) const { return isUnionAll[idx]; }
+
+private:
+    std::vector<NormalizedSingleQuery> singleQueries;
+    std::vector<bool> isUnionAll;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/normalized_query_part.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/normalized_query_part.h
new file mode 100644
index 0000000000..62c912242d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/normalized_query_part.h
@@ -0,0 +1,64 @@
+#pragma once
+
+#include <optional>
+
+#include "binder/query/reading_clause/bound_reading_clause.h"
+#include "binder/query/return_with_clause/bound_projection_body.h"
+#include "binder/query/updating_clause/bound_updating_clause.h"
+
+namespace lbug {
+namespace binder {
+
+class NormalizedQueryPart {
+    friend class NormalizedQueryPartMatchRewriter;
+
+public:
+    NormalizedQueryPart() = default;
+    DELETE_COPY_DEFAULT_MOVE(NormalizedQueryPart);
+
+    void addReadingClause(std::unique_ptr<BoundReadingClause> boundReadingClause) {
+        readingClauses.push_back(std::move(boundReadingClause));
+    }
+    bool hasReadingClause() const { return !readingClauses.empty(); }
+    uint32_t getNumReadingClause() const { return readingClauses.size(); }
+    BoundReadingClause* getReadingClause(uint32_t idx) const { return readingClauses[idx].get(); }
+
+    void addUpdatingClause(std::unique_ptr<BoundUpdatingClause> boundUpdatingClause) {
+        updatingClauses.push_back(std::move(boundUpdatingClause));
+    }
+    bool hasUpdatingClause() const { return !updatingClauses.empty(); }
+    uint32_t getNumUpdatingClause() const { return updatingClauses.size(); }
+    BoundUpdatingClause* getUpdatingClause(uint32_t idx) const {
+        return updatingClauses[idx].get();
+    }
+
+    void setProjectionBody(BoundProjectionBody boundProjectionBody) {
+        projectionBody = std::move(boundProjectionBody);
+    }
+    bool hasProjectionBody() const { return projectionBody.has_value(); }
+    BoundProjectionBody* getProjectionBodyUnsafe() {
+        KU_ASSERT(projectionBody.has_value());
+        return &projectionBody.value();
+    }
+    const BoundProjectionBody* getProjectionBody() const {
+        KU_ASSERT(projectionBody.has_value());
+        return &projectionBody.value();
+    }
+
+    bool hasProjectionBodyPredicate() const { return projectionBodyPredicate != nullptr; }
+    std::shared_ptr<Expression> getProjectionBodyPredicate() const {
+        return projectionBodyPredicate;
+    }
+    void setProjectionBodyPredicate(const std::shared_ptr<Expression>& predicate) {
+        projectionBodyPredicate = predicate;
+    }
+
+private:
+    std::vector<std::unique_ptr<BoundReadingClause>> readingClauses;
+    std::vector<std::unique_ptr<BoundUpdatingClause>> updatingClauses;
+    std::optional<BoundProjectionBody> projectionBody;
+    std::shared_ptr<Expression> projectionBodyPredicate;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/normalized_single_query.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/normalized_single_query.h
new file mode 100644
index 0000000000..e0d09cfa54
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/normalized_single_query.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "binder/bound_statement_result.h"
+#include "normalized_query_part.h"
+
+namespace lbug {
+namespace binder {
+
+class NormalizedSingleQuery {
+public:
+    NormalizedSingleQuery() = default;
+    DELETE_COPY_DEFAULT_MOVE(NormalizedSingleQuery);
+
+    void appendQueryPart(NormalizedQueryPart queryPart) {
+        queryParts.push_back(std::move(queryPart));
+    }
+    common::idx_t getNumQueryParts() const { return queryParts.size(); }
+    NormalizedQueryPart* getQueryPartUnsafe(common::idx_t idx) { return &queryParts[idx]; }
+    const NormalizedQueryPart* getQueryPart(common::idx_t idx) const { return &queryParts[idx]; }
+
+    void setStatementResult(BoundStatementResult result) { statementResult = std::move(result); }
+    const BoundStatementResult* getStatementResult() const { return &statementResult; }
+
+private:
+    std::vector<NormalizedQueryPart> queryParts;
+    BoundStatementResult statementResult;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/query_graph.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/query_graph.h
new file mode 100644
index 0000000000..38937c7849
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/query_graph.h
@@ -0,0 +1,178 @@
+#pragma once
+
+#include <bitset>
+#include <unordered_map>
+
+#include "binder/expression/rel_expression.h"
+
+namespace lbug {
+namespace binder {
+
+constexpr static uint8_t MAX_NUM_QUERY_VARIABLES = 64;
+
+class QueryGraph;
+struct SubqueryGraph;
+struct SubqueryGraphHasher;
+using subquery_graph_set_t = std::unordered_set<SubqueryGraph, SubqueryGraphHasher>;
+template<typename T>
+using subquery_graph_V_map_t = std::unordered_map<SubqueryGraph, T, SubqueryGraphHasher>;
+
+// hash on node bitset if subgraph has no rel
+struct SubqueryGraphHasher {
+    std::size_t operator()(const SubqueryGraph& key) const;
+};
+
+struct SubqueryGraph {
+    const QueryGraph& queryGraph;
+    std::bitset<MAX_NUM_QUERY_VARIABLES> queryNodesSelector;
+    std::bitset<MAX_NUM_QUERY_VARIABLES> queryRelsSelector;
+
+    explicit SubqueryGraph(const QueryGraph& queryGraph) : queryGraph{queryGraph} {}
+
+    void addQueryNode(common::idx_t nodePos) { queryNodesSelector[nodePos] = true; }
+    void addQueryRel(common::idx_t relPos) { queryRelsSelector[relPos] = true; }
+    void addSubqueryGraph(const SubqueryGraph& other) {
+        queryRelsSelector |= other.queryRelsSelector;
+        queryNodesSelector |= other.queryNodesSelector;
+    }
+
+    common::idx_t getNumQueryRels() const { return queryRelsSelector.count(); }
+    common::idx_t getTotalNumVariables() const {
+        return queryNodesSelector.count() + queryRelsSelector.count();
+    }
+    bool isSingleRel() const {
+        return queryRelsSelector.count() == 1 && queryNodesSelector.count() == 0;
+    }
+
+    bool containAllVariables(const std::unordered_set<std::string>& variables) const;
+
+    std::unordered_set<common::idx_t> getNodeNbrPositions() const;
+    std::unordered_set<common::idx_t> getRelNbrPositions() const;
+    subquery_graph_set_t getNbrSubgraphs(uint32_t size) const;
+    std::vector<uint32_t> getConnectedNodePos(const SubqueryGraph& nbr) const;
+
+    // E.g. query graph (a)-[e1]->(b) and subgraph (a)-[e1], although (b) is not in subgraph, we
+    // return both (a) and (b) regardless of node selector. See needPruneJoin() in
+    // join_order_enumerator.cpp for its use case.
+    std::unordered_set<common::idx_t> getNodePositionsIgnoringNodeSelector() const;
+
+    std::vector<common::idx_t> getNbrNodeIndices() const;
+
+    bool operator==(const SubqueryGraph& other) const {
+        return queryRelsSelector == other.queryRelsSelector &&
+               queryNodesSelector == other.queryNodesSelector;
+    }
+
+private:
+    subquery_graph_set_t getBaseNbrSubgraph() const;
+    subquery_graph_set_t getNextNbrSubgraphs(const SubqueryGraph& prevNbr) const;
+};
+
+// QueryGraph represents a connected pattern specified in MATCH clause.
+class QueryGraph {
+public:
+    QueryGraph() = default;
+    QueryGraph(const QueryGraph& other)
+        : queryNodeNameToPosMap{other.queryNodeNameToPosMap},
+          queryRelNameToPosMap{other.queryRelNameToPosMap}, queryNodes{other.queryNodes},
+          queryRels{other.queryRels} {}
+
+    EXPLICIT_COPY_DEFAULT_MOVE(QueryGraph);
+
+    bool isEmpty() const;
+
+    std::vector<std::shared_ptr<NodeOrRelExpression>> getAllPatterns() const;
+
+    common::idx_t getNumQueryNodes() const { return queryNodes.size(); }
+    bool containsQueryNode(const std::string& queryNodeName) const {
+        return queryNodeNameToPosMap.contains(queryNodeName);
+    }
+    std::vector<std::shared_ptr<NodeExpression>> getQueryNodes() const { return queryNodes; }
+    std::shared_ptr<NodeExpression> getQueryNode(const std::string& queryNodeName) const {
+        return queryNodes[getQueryNodeIdx(queryNodeName)];
+    }
+    std::vector<std::shared_ptr<NodeExpression>> getQueryNodes(
+        const std::vector<common::idx_t>& nodePoses) const {
+        std::vector<std::shared_ptr<NodeExpression>> result;
+        result.reserve(nodePoses.size());
+        for (auto nodePos : nodePoses) {
+            result.push_back(queryNodes[nodePos]);
+        }
+        return result;
+    }
+    std::shared_ptr<NodeExpression> getQueryNode(common::idx_t nodePos) const {
+        return queryNodes[nodePos];
+    }
+    common::idx_t getQueryNodeIdx(const NodeExpression& node) const {
+        return getQueryNodeIdx(node.getUniqueName());
+    }
+    common::idx_t getQueryNodeIdx(const std::string& queryNodeName) const {
+        return queryNodeNameToPosMap.at(queryNodeName);
+    }
+    void addQueryNode(std::shared_ptr<NodeExpression> queryNode);
+
+    common::idx_t getNumQueryRels() const { return queryRels.size(); }
+    bool containsQueryRel(const std::string& queryRelName) const {
+        return queryRelNameToPosMap.contains(queryRelName);
+    }
+    std::vector<std::shared_ptr<RelExpression>> getQueryRels() const { return queryRels; }
+    std::shared_ptr<RelExpression> getQueryRel(const std::string& queryRelName) const {
+        return queryRels.at(queryRelNameToPosMap.at(queryRelName));
+    }
+    std::shared_ptr<RelExpression> getQueryRel(common::idx_t relPos) const {
+        return queryRels[relPos];
+    }
+    common::idx_t getQueryRelIdx(const std::string& queryRelName) const {
+        return queryRelNameToPosMap.at(queryRelName);
+    }
+    void addQueryRel(std::shared_ptr<RelExpression> queryRel);
+
+    bool canProjectExpression(const std::shared_ptr<Expression>& expression) const;
+
+    bool isConnected(const QueryGraph& other) const;
+
+    void merge(const QueryGraph& other);
+
+private:
+    std::unordered_map<std::string, uint32_t> queryNodeNameToPosMap;
+    std::unordered_map<std::string, uint32_t> queryRelNameToPosMap;
+    std::vector<std::shared_ptr<NodeExpression>> queryNodes;
+    std::vector<std::shared_ptr<RelExpression>> queryRels;
+};
+
+// QueryGraphCollection represents a pattern (a set of connected components) specified in MATCH
+// clause.
+class QueryGraphCollection {
+public:
+    QueryGraphCollection() = default;
+    DELETE_COPY_DEFAULT_MOVE(QueryGraphCollection);
+
+    void merge(const QueryGraphCollection& other);
+    void addAndMergeQueryGraphIfConnected(QueryGraph queryGraphToAdd);
+    void finalize();
+
+    common::idx_t getNumQueryGraphs() const { return queryGraphs.size(); }
+    QueryGraph* getQueryGraphUnsafe(common::idx_t idx) { return &queryGraphs[idx]; }
+    const QueryGraph* getQueryGraph(common::idx_t idx) const { return &queryGraphs[idx]; }
+
+    bool contains(const std::string& name) const;
+    LBUG_API std::vector<std::shared_ptr<NodeExpression>> getQueryNodes() const;
+    LBUG_API std::vector<std::shared_ptr<RelExpression>> getQueryRels() const;
+
+private:
+    std::vector<QueryGraph> mergeGraphs(common::idx_t baseGraphIdx);
+
+private:
+    std::vector<QueryGraph> queryGraphs;
+};
+
+struct BoundGraphPattern {
+    QueryGraphCollection queryGraphCollection;
+    std::shared_ptr<Expression> where;
+
+    BoundGraphPattern() = default;
+    DELETE_COPY_DEFAULT_MOVE(BoundGraphPattern);
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/query_graph_label_analyzer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/query_graph_label_analyzer.h
new file mode 100644
index 0000000000..ed665d02bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/query_graph_label_analyzer.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "query_graph.h"
+
+namespace lbug {
+namespace binder {
+
+class QueryGraphLabelAnalyzer {
+public:
+    explicit QueryGraphLabelAnalyzer(const main::ClientContext& clientContext, bool throwOnViolate)
+        : throwOnViolate{throwOnViolate}, clientContext{clientContext} {}
+
+    void pruneLabel(QueryGraph& graph) const;
+
+private:
+    void pruneNode(const QueryGraph& graph, NodeExpression& node) const;
+    void pruneRel(RelExpression& rel) const;
+
+private:
+    bool throwOnViolate;
+    const main::ClientContext& clientContext;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_join_hint.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_join_hint.h
new file mode 100644
index 0000000000..f1be0a416e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_join_hint.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+
+namespace lbug {
+namespace binder {
+
+struct BoundJoinHintNode {
+    std::shared_ptr<Expression> nodeOrRel;
+    std::vector<std::shared_ptr<BoundJoinHintNode>> children;
+
+    BoundJoinHintNode() = default;
+    explicit BoundJoinHintNode(std::shared_ptr<Expression> nodeOrRel)
+        : nodeOrRel{std::move(nodeOrRel)} {}
+
+    void addChild(std::shared_ptr<BoundJoinHintNode> child) {
+        children.push_back(std::move(child));
+    }
+
+    bool isLeaf() const { return children.empty(); }
+    bool isBinary() const { return children.size() == 2; }
+    bool isMultiWay() const { return children.size() > 2; }
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_load_from.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_load_from.h
new file mode 100644
index 0000000000..2a8c3522a4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_load_from.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "binder/bound_table_scan_info.h"
+#include "bound_reading_clause.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundLoadFrom final : public BoundReadingClause {
+    static constexpr common::ClauseType clauseType_ = common::ClauseType::LOAD_FROM;
+
+public:
+    explicit BoundLoadFrom(BoundTableScanInfo info)
+        : BoundReadingClause{clauseType_}, info{std::move(info)} {}
+
+    const BoundTableScanInfo* getInfo() const { return &info; }
+
+private:
+    BoundTableScanInfo info;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_match_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_match_clause.h
new file mode 100644
index 0000000000..a785148dbe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_match_clause.h
@@ -0,0 +1,34 @@
+#pragma once
+
+#include "binder/query/query_graph.h"
+#include "bound_join_hint.h"
+#include "bound_reading_clause.h"
+
+namespace lbug {
+namespace binder {
+
+class LBUG_API BoundMatchClause final : public BoundReadingClause {
+    static constexpr common::ClauseType clauseType_ = common::ClauseType::MATCH;
+
+public:
+    BoundMatchClause(QueryGraphCollection collection, common::MatchClauseType matchClauseType)
+        : BoundReadingClause{clauseType_}, collection{std::move(collection)},
+          matchClauseType{matchClauseType} {}
+
+    QueryGraphCollection* getQueryGraphCollectionUnsafe() { return &collection; }
+    const QueryGraphCollection* getQueryGraphCollection() const { return &collection; }
+
+    common::MatchClauseType getMatchClauseType() const { return matchClauseType; }
+
+    void setHint(std::shared_ptr<BoundJoinHintNode> root) { hintRoot = std::move(root); }
+    bool hasHint() const { return hintRoot != nullptr; }
+    std::shared_ptr<BoundJoinHintNode> getHint() const { return hintRoot; }
+
+private:
+    QueryGraphCollection collection;
+    common::MatchClauseType matchClauseType;
+    std::shared_ptr<BoundJoinHintNode> hintRoot;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_reading_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_reading_clause.h
new file mode 100644
index 0000000000..407c000431
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_reading_clause.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/enums/clause_type.h"
+
+namespace lbug {
+namespace binder {
+
+class LBUG_API BoundReadingClause {
+public:
+    explicit BoundReadingClause(common::ClauseType clauseType) : clauseType{clauseType} {}
+    DELETE_COPY_DEFAULT_MOVE(BoundReadingClause);
+    virtual ~BoundReadingClause() = default;
+
+    common::ClauseType getClauseType() const { return clauseType; }
+
+    void setPredicate(std::shared_ptr<Expression> predicate_) { predicate = std::move(predicate_); }
+    bool hasPredicate() const { return predicate != nullptr; }
+    std::shared_ptr<Expression> getPredicate() const { return predicate; }
+    expression_vector getConjunctivePredicates() const {
+        return hasPredicate() ? predicate->splitOnAND() : expression_vector{};
+    }
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET* ptrCast() const {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+
+private:
+    common::ClauseType clauseType;
+    // Predicate in WHERE clause
+    std::shared_ptr<Expression> predicate;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_table_function_call.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_table_function_call.h
new file mode 100644
index 0000000000..7e6d6bfb82
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_table_function_call.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "binder/bound_table_scan_info.h"
+#include "binder/query/reading_clause/bound_reading_clause.h"
+#include "function/table/table_function.h"
+
+namespace lbug {
+namespace binder {
+
+class LBUG_API BoundTableFunctionCall : public BoundReadingClause {
+    static constexpr common::ClauseType clauseType_ = common::ClauseType::TABLE_FUNCTION_CALL;
+
+public:
+    explicit BoundTableFunctionCall(BoundTableScanInfo info)
+        : BoundReadingClause{clauseType_}, info{std::move(info)} {}
+
+    const function::TableFunction& getTableFunc() const { return info.func; }
+    const function::TableFuncBindData* getBindData() const { return info.bindData.get(); }
+
+private:
+    BoundTableScanInfo info;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_unwind_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_unwind_clause.h
new file mode 100644
index 0000000000..ee94daa258
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/reading_clause/bound_unwind_clause.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "bound_reading_clause.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundUnwindClause final : public BoundReadingClause {
+public:
+    BoundUnwindClause(std::shared_ptr<Expression> inExpr, std::shared_ptr<Expression> outExpr,
+        std::shared_ptr<Expression> idExpr)
+        : BoundReadingClause{common::ClauseType::UNWIND}, inExpr{std::move(inExpr)},
+          outExpr{std::move(outExpr)}, idExpr{std::move(idExpr)} {}
+
+    std::shared_ptr<Expression> getInExpr() const { return inExpr; }
+    std::shared_ptr<Expression> getOutExpr() const { return outExpr; }
+    std::shared_ptr<Expression> getIDExpr() const { return idExpr; }
+
+private:
+    std::shared_ptr<Expression> inExpr;
+    std::shared_ptr<Expression> outExpr;
+    std::shared_ptr<Expression> idExpr;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/return_with_clause/bound_projection_body.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/return_with_clause/bound_projection_body.h
new file mode 100644
index 0000000000..49cdece68f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/return_with_clause/bound_projection_body.h
@@ -0,0 +1,72 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundProjectionBody {
+    static constexpr uint64_t INVALID_NUMBER = UINT64_MAX;
+
+public:
+    explicit BoundProjectionBody(bool distinct)
+        : distinct{distinct}, skipNumber{nullptr}, limitNumber{nullptr} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundProjectionBody);
+
+    bool isDistinct() const { return distinct; }
+
+    void setProjectionExpressions(expression_vector expressions) {
+        projectionExpressions = std::move(expressions);
+    }
+    expression_vector getProjectionExpressions() const { return projectionExpressions; }
+
+    void setGroupByExpressions(expression_vector expressions) {
+        groupByExpressions = std::move(expressions);
+    }
+    expression_vector getGroupByExpressions() const { return groupByExpressions; }
+
+    void setAggregateExpressions(expression_vector expressions) {
+        aggregateExpressions = std::move(expressions);
+    }
+    bool hasAggregateExpressions() const { return !aggregateExpressions.empty(); }
+    expression_vector getAggregateExpressions() const { return aggregateExpressions; }
+
+    void setOrderByExpressions(expression_vector expressions, std::vector<bool> sortOrders) {
+        orderByExpressions = std::move(expressions);
+        isAscOrders = std::move(sortOrders);
+    }
+    bool hasOrderByExpressions() const { return !orderByExpressions.empty(); }
+    const expression_vector& getOrderByExpressions() const { return orderByExpressions; }
+    const std::vector<bool>& getSortingOrders() const { return isAscOrders; }
+
+    void setSkipNumber(std::shared_ptr<Expression> number) { skipNumber = std::move(number); }
+    bool hasSkip() const { return skipNumber != nullptr; }
+    std::shared_ptr<Expression> getSkipNumber() const { return skipNumber; }
+
+    void setLimitNumber(std::shared_ptr<Expression> number) { limitNumber = std::move(number); }
+    bool hasLimit() const { return limitNumber != nullptr; }
+    std::shared_ptr<Expression> getLimitNumber() const { return limitNumber; }
+
+    bool hasSkipOrLimit() const { return hasSkip() || hasLimit(); }
+
+private:
+    BoundProjectionBody(const BoundProjectionBody& other)
+        : distinct{other.distinct}, projectionExpressions{other.projectionExpressions},
+          groupByExpressions{other.groupByExpressions},
+          aggregateExpressions{other.aggregateExpressions},
+          orderByExpressions{other.orderByExpressions}, isAscOrders{other.isAscOrders},
+          skipNumber{other.skipNumber}, limitNumber{other.limitNumber} {}
+
+private:
+    bool distinct;
+    expression_vector projectionExpressions;
+    expression_vector groupByExpressions;
+    expression_vector aggregateExpressions;
+    expression_vector orderByExpressions;
+    std::vector<bool> isAscOrders;
+    std::shared_ptr<Expression> skipNumber;
+    std::shared_ptr<Expression> limitNumber;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/return_with_clause/bound_return_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/return_with_clause/bound_return_clause.h
new file mode 100644
index 0000000000..8e6c1a7300
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/return_with_clause/bound_return_clause.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "binder/bound_statement_result.h"
+#include "bound_projection_body.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundReturnClause {
+public:
+    explicit BoundReturnClause(BoundProjectionBody projectionBody)
+        : projectionBody{std::move(projectionBody)} {}
+    BoundReturnClause(BoundProjectionBody projectionBody, BoundStatementResult statementResult)
+        : projectionBody{std::move(projectionBody)}, statementResult{std::move(statementResult)} {}
+    DELETE_COPY_DEFAULT_MOVE(BoundReturnClause);
+    virtual ~BoundReturnClause() = default;
+
+    inline const BoundProjectionBody* getProjectionBody() const { return &projectionBody; }
+
+    inline const BoundStatementResult* getStatementResult() const { return &statementResult; }
+
+protected:
+    BoundProjectionBody projectionBody;
+    BoundStatementResult statementResult;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/return_with_clause/bound_with_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/return_with_clause/bound_with_clause.h
new file mode 100644
index 0000000000..f361c4952b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/return_with_clause/bound_with_clause.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "bound_return_clause.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundWithClause final : public BoundReturnClause {
+public:
+    explicit BoundWithClause(BoundProjectionBody projectionBody)
+        : BoundReturnClause{std::move(projectionBody)} {}
+
+    void setWhereExpression(std::shared_ptr<Expression> expression) {
+        whereExpression = std::move(expression);
+    }
+    bool hasWhereExpression() const { return whereExpression != nullptr; }
+    std::shared_ptr<Expression> getWhereExpression() const { return whereExpression; }
+
+private:
+    std::shared_ptr<Expression> whereExpression;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_delete_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_delete_clause.h
new file mode 100644
index 0000000000..36ade5a9ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_delete_clause.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include "bound_delete_info.h"
+#include "bound_updating_clause.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundDeleteClause final : public BoundUpdatingClause {
+public:
+    BoundDeleteClause() : BoundUpdatingClause{common::ClauseType::DELETE_} {};
+
+    void addInfo(BoundDeleteInfo info) { infos.push_back(std::move(info)); }
+
+    bool hasNodeInfo() const {
+        return hasInfo(
+            [](const BoundDeleteInfo& info) { return info.tableType == common::TableType::NODE; });
+    }
+    std::vector<BoundDeleteInfo> getNodeInfos() const {
+        return getInfos(
+            [](const BoundDeleteInfo& info) { return info.tableType == common::TableType::NODE; });
+    }
+    bool hasRelInfo() const {
+        return hasInfo(
+            [](const BoundDeleteInfo& info) { return info.tableType == common::TableType::REL; });
+    }
+    std::vector<BoundDeleteInfo> getRelInfos() const {
+        return getInfos(
+            [](const BoundDeleteInfo& info) { return info.tableType == common::TableType::REL; });
+    }
+
+private:
+    bool hasInfo(const std::function<bool(const BoundDeleteInfo& info)>& check) const;
+    std::vector<BoundDeleteInfo> getInfos(
+        const std::function<bool(const BoundDeleteInfo& info)>& check) const;
+
+private:
+    std::vector<BoundDeleteInfo> infos;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_delete_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_delete_info.h
new file mode 100644
index 0000000000..e554448f53
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_delete_info.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/enums/delete_type.h"
+#include "common/enums/table_type.h"
+
+namespace lbug {
+namespace binder {
+
+struct BoundDeleteInfo {
+    common::DeleteNodeType deleteType;
+    common::TableType tableType;
+    std::shared_ptr<Expression> pattern;
+
+    BoundDeleteInfo(common::DeleteNodeType deleteType, common::TableType tableType,
+        std::shared_ptr<Expression> pattern)
+        : deleteType{deleteType}, tableType{tableType}, pattern{std::move(pattern)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundDeleteInfo);
+
+    std::string toString() const { return "Delete " + pattern->toString(); }
+
+private:
+    BoundDeleteInfo(const BoundDeleteInfo& other)
+        : deleteType{other.deleteType}, tableType{other.tableType}, pattern{other.pattern} {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_insert_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_insert_clause.h
new file mode 100644
index 0000000000..186a5c5675
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_insert_clause.h
@@ -0,0 +1,43 @@
+#pragma once
+
+#include "bound_insert_info.h"
+#include "bound_updating_clause.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundInsertClause final : public BoundUpdatingClause {
+public:
+    explicit BoundInsertClause(std::vector<BoundInsertInfo> infos)
+        : BoundUpdatingClause{common::ClauseType::INSERT}, infos{std::move(infos)} {}
+
+    const std::vector<BoundInsertInfo>& getInfos() const { return infos; }
+
+    bool hasNodeInfo() const {
+        return hasInfo(
+            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::NODE; });
+    }
+    std::vector<const BoundInsertInfo*> getNodeInfos() const {
+        return getInfos(
+            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::NODE; });
+    }
+    bool hasRelInfo() const {
+        return hasInfo(
+            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::REL; });
+    }
+    std::vector<const BoundInsertInfo*> getRelInfos() const {
+        return getInfos(
+            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::REL; });
+    }
+
+private:
+    bool hasInfo(const std::function<bool(const BoundInsertInfo& info)>& check) const;
+    std::vector<const BoundInsertInfo*> getInfos(
+        const std::function<bool(const BoundInsertInfo& info)>& check) const;
+
+private:
+    std::vector<BoundInsertInfo> infos;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_insert_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_insert_info.h
new file mode 100644
index 0000000000..97e2f23d68
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_insert_info.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/enums/conflict_action.h"
+#include "common/enums/table_type.h"
+
+namespace lbug {
+namespace binder {
+
+struct BoundInsertInfo {
+    common::TableType tableType;
+    std::shared_ptr<Expression> pattern;
+    expression_vector columnExprs;
+    expression_vector columnDataExprs;
+    common::ConflictAction conflictAction;
+
+    BoundInsertInfo(common::TableType tableType, std::shared_ptr<Expression> pattern)
+        : tableType{tableType}, pattern{std::move(pattern)},
+          conflictAction{common::ConflictAction::ON_CONFLICT_THROW} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundInsertInfo);
+
+private:
+    BoundInsertInfo(const BoundInsertInfo& other)
+        : tableType{other.tableType}, pattern{other.pattern}, columnExprs{other.columnExprs},
+          columnDataExprs{other.columnDataExprs}, conflictAction{other.conflictAction} {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_merge_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_merge_clause.h
new file mode 100644
index 0000000000..c0d930bb64
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_merge_clause.h
@@ -0,0 +1,141 @@
+#pragma once
+
+#include "binder/query/query_graph.h"
+#include "bound_insert_info.h"
+#include "bound_set_info.h"
+#include "bound_updating_clause.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundMergeClause final : public BoundUpdatingClause {
+    static constexpr common::ClauseType type_ = common::ClauseType::MERGE;
+
+public:
+    BoundMergeClause(expression_vector columnDataExprs, std::shared_ptr<Expression> existenceMark,
+        std::shared_ptr<Expression> distinctMark, QueryGraphCollection queryGraphCollection,
+        std::shared_ptr<Expression> predicate, std::vector<BoundInsertInfo> insertInfos)
+        : BoundUpdatingClause{type_}, columnDataExprs{std::move(columnDataExprs)},
+          existenceMark{std::move(existenceMark)}, distinctMark{std::move(distinctMark)},
+          queryGraphCollection{std::move(queryGraphCollection)}, predicate{std::move(predicate)},
+          insertInfos{std::move(insertInfos)} {}
+
+    expression_vector getColumnDataExprs() const { return columnDataExprs; }
+
+    std::shared_ptr<Expression> getExistenceMark() const { return existenceMark; }
+    std::shared_ptr<Expression> getDistinctMark() const { return distinctMark; }
+
+    const QueryGraphCollection* getQueryGraphCollection() const { return &queryGraphCollection; }
+    bool hasPredicate() const { return predicate != nullptr; }
+    std::shared_ptr<Expression> getPredicate() const { return predicate; }
+
+    const std::vector<BoundInsertInfo>& getInsertInfosRef() const { return insertInfos; }
+    const std::vector<BoundSetPropertyInfo>& getOnMatchSetInfosRef() const {
+        return onMatchSetPropertyInfos;
+    }
+    const std::vector<BoundSetPropertyInfo>& getOnCreateSetInfosRef() const {
+        return onCreateSetPropertyInfos;
+    }
+
+    bool hasInsertNodeInfo() const {
+        return hasInsertInfo(
+            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::NODE; });
+    }
+    std::vector<const BoundInsertInfo*> getInsertNodeInfos() const {
+        return getInsertInfos(
+            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::NODE; });
+    }
+    bool hasInsertRelInfo() const {
+        return hasInsertInfo(
+            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::REL; });
+    }
+    std::vector<const BoundInsertInfo*> getInsertRelInfos() const {
+        return getInsertInfos(
+            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::REL; });
+    }
+
+    bool hasOnMatchSetNodeInfo() const {
+        return hasOnMatchSetInfo([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::NODE;
+        });
+    }
+    std::vector<BoundSetPropertyInfo> getOnMatchSetNodeInfos() const {
+        return getOnMatchSetInfos([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::NODE;
+        });
+    }
+    bool hasOnMatchSetRelInfo() const {
+        return hasOnMatchSetInfo([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::REL;
+        });
+    }
+    std::vector<BoundSetPropertyInfo> getOnMatchSetRelInfos() const {
+        return getOnMatchSetInfos([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::REL;
+        });
+    }
+
+    bool hasOnCreateSetNodeInfo() const {
+        return hasOnCreateSetInfo([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::NODE;
+        });
+    }
+    std::vector<BoundSetPropertyInfo> getOnCreateSetNodeInfos() const {
+        return getOnCreateSetInfos([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::NODE;
+        });
+    }
+    bool hasOnCreateSetRelInfo() const {
+        return hasOnCreateSetInfo([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::REL;
+        });
+    }
+    std::vector<BoundSetPropertyInfo> getOnCreateSetRelInfos() const {
+        return getOnCreateSetInfos([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::REL;
+        });
+    }
+
+    void addOnMatchSetPropertyInfo(BoundSetPropertyInfo setPropertyInfo) {
+        onMatchSetPropertyInfos.push_back(std::move(setPropertyInfo));
+    }
+    void addOnCreateSetPropertyInfo(BoundSetPropertyInfo setPropertyInfo) {
+        onCreateSetPropertyInfos.push_back(std::move(setPropertyInfo));
+    }
+
+private:
+    bool hasInsertInfo(const std::function<bool(const BoundInsertInfo& info)>& check) const;
+    std::vector<const BoundInsertInfo*> getInsertInfos(
+        const std::function<bool(const BoundInsertInfo& info)>& check) const;
+
+    bool hasOnMatchSetInfo(
+        const std::function<bool(const BoundSetPropertyInfo& info)>& check) const;
+    std::vector<BoundSetPropertyInfo> getOnMatchSetInfos(
+        const std::function<bool(const BoundSetPropertyInfo& info)>& check) const;
+
+    bool hasOnCreateSetInfo(
+        const std::function<bool(const BoundSetPropertyInfo& info)>& check) const;
+    std::vector<BoundSetPropertyInfo> getOnCreateSetInfos(
+        const std::function<bool(const BoundSetPropertyInfo& info)>& check) const;
+
+private:
+    // Capture user input column (right-hand-side) values in MERGE clause
+    // E.g. UNWIND [1,2,3] AS x MERGE (a {id:2, rank:x})
+    // this field should be {2, x}
+    expression_vector columnDataExprs;
+    // Internal marks
+    std::shared_ptr<Expression> existenceMark;
+    std::shared_ptr<Expression> distinctMark;
+    // Pattern to match.
+    QueryGraphCollection queryGraphCollection;
+    std::shared_ptr<Expression> predicate;
+    // Pattern to create on match failure.
+    std::vector<BoundInsertInfo> insertInfos;
+    // Update on match
+    std::vector<BoundSetPropertyInfo> onMatchSetPropertyInfos;
+    // Update on create
+    std::vector<BoundSetPropertyInfo> onCreateSetPropertyInfos;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_set_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_set_clause.h
new file mode 100644
index 0000000000..a24b503079
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_set_clause.h
@@ -0,0 +1,47 @@
+#pragma once
+
+#include "bound_set_info.h"
+#include "bound_updating_clause.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundSetClause final : public BoundUpdatingClause {
+public:
+    BoundSetClause() : BoundUpdatingClause{common::ClauseType::SET} {}
+
+    void addInfo(BoundSetPropertyInfo info) { infos.push_back(std::move(info)); }
+    const std::vector<BoundSetPropertyInfo>& getInfos() const { return infos; }
+
+    bool hasNodeInfo() const {
+        return hasInfo([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::NODE;
+        });
+    }
+    std::vector<BoundSetPropertyInfo> getNodeInfos() const {
+        return getInfos([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::NODE;
+        });
+    }
+    bool hasRelInfo() const {
+        return hasInfo([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::REL;
+        });
+    }
+    std::vector<BoundSetPropertyInfo> getRelInfos() const {
+        return getInfos([](const BoundSetPropertyInfo& info) {
+            return info.tableType == common::TableType::REL;
+        });
+    }
+
+private:
+    bool hasInfo(const std::function<bool(const BoundSetPropertyInfo& info)>& check) const;
+    std::vector<BoundSetPropertyInfo> getInfos(
+        const std::function<bool(const BoundSetPropertyInfo& info)>& check) const;
+
+private:
+    std::vector<BoundSetPropertyInfo> infos;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_set_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_set_info.h
new file mode 100644
index 0000000000..32f948b9d0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_set_info.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/enums/table_type.h"
+
+namespace lbug {
+namespace binder {
+
+struct BoundSetPropertyInfo {
+    common::TableType tableType;
+    std::shared_ptr<Expression> pattern;
+    std::shared_ptr<Expression> column;
+    std::shared_ptr<Expression> columnData;
+
+    BoundSetPropertyInfo(common::TableType tableType, std::shared_ptr<Expression> pattern,
+        std::shared_ptr<Expression> column, std::shared_ptr<Expression> columnData)
+        : tableType{tableType}, pattern{std::move(pattern)}, column{std::move(column)},
+          columnData{std::move(columnData)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(BoundSetPropertyInfo);
+
+private:
+    BoundSetPropertyInfo(const BoundSetPropertyInfo& other)
+        : tableType{other.tableType}, pattern{other.pattern}, column{other.column},
+          columnData{other.columnData} {}
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_updating_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_updating_clause.h
new file mode 100644
index 0000000000..cedf6c0ba9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/query/updating_clause/bound_updating_clause.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "common/cast.h"
+#include "common/enums/clause_type.h"
+
+namespace lbug {
+namespace binder {
+
+class BoundUpdatingClause {
+public:
+    explicit BoundUpdatingClause(common::ClauseType clauseType) : clauseType{clauseType} {}
+    virtual ~BoundUpdatingClause() = default;
+
+    common::ClauseType getClauseType() const { return clauseType; }
+
+    template<class TARGET>
+    TARGET& cast() const {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+private:
+    common::ClauseType clauseType;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/rewriter/match_clause_pattern_label_rewriter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/rewriter/match_clause_pattern_label_rewriter.h
new file mode 100644
index 0000000000..4f2ba424c1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/rewriter/match_clause_pattern_label_rewriter.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "binder/bound_statement_visitor.h"
+#include "binder/query/query_graph_label_analyzer.h"
+
+namespace lbug {
+namespace binder {
+
+class MatchClausePatternLabelRewriter final : public BoundStatementVisitor {
+public:
+    explicit MatchClausePatternLabelRewriter(const main::ClientContext& clientContext)
+        : analyzer{clientContext, false /* throwOnViolate */} {}
+
+    void visitMatchUnsafe(BoundReadingClause& readingClause) override;
+
+private:
+    QueryGraphLabelAnalyzer analyzer;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/rewriter/normalized_query_part_match_rewriter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/rewriter/normalized_query_part_match_rewriter.h
new file mode 100644
index 0000000000..4d42d95bd6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/rewriter/normalized_query_part_match_rewriter.h
@@ -0,0 +1,31 @@
+#pragma once
+
+#include "binder/bound_statement_visitor.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace binder {
+
+// Merge consecutive match pattern in a query part. E.g.
+// MATCH (a) WHERE a.ID = 0
+// MATCH (b) WHERE b.ID = 1
+// MATCH (a)-[]->(b)
+// will be rewritten as
+// MATCH (a)-[]->(b) WHERE a.ID = 0 AND b.ID = 1
+// This rewrite does not apply to MATCH with HINT or OPTIONAL MATCH
+class NormalizedQueryPartMatchRewriter final : public BoundStatementVisitor {
+public:
+    explicit NormalizedQueryPartMatchRewriter(main::ClientContext* clientContext)
+        : clientContext{clientContext} {}
+
+private:
+    void visitQueryPartUnsafe(NormalizedQueryPart& queryPart) override;
+
+private:
+    main::ClientContext* clientContext;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/rewriter/with_clause_projection_rewriter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/rewriter/with_clause_projection_rewriter.h
new file mode 100644
index 0000000000..3ef6ad1999
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/rewriter/with_clause_projection_rewriter.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include "binder/bound_statement_visitor.h"
+
+namespace lbug {
+namespace binder {
+
+// WithClauseProjectionRewriter first analyze the properties need to be scanned for each query. And
+// then rewrite node/rel expression in WITH clause as their properties. So We avoid eagerly evaluate
+// node/rel in WITH clause projection. E.g.
+// MATCH (a) WITH a MATCH (a)->(b);
+// will be rewritten as
+// MATCH (a) WITH a._id MATCH (a)->(b);
+class WithClauseProjectionRewriter final : public BoundStatementVisitor {
+public:
+    void visitSingleQueryUnsafe(NormalizedSingleQuery& singleQuery) override;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/visitor/confidential_statement_analyzer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/visitor/confidential_statement_analyzer.h
new file mode 100644
index 0000000000..d0a19f6ebc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/visitor/confidential_statement_analyzer.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include "binder/bound_statement_visitor.h"
+
+namespace lbug {
+namespace binder {
+
+class ConfidentialStatementAnalyzer final : public BoundStatementVisitor {
+public:
+    bool isConfidential() const { return confidentialStatement; }
+
+private:
+    void visitStandaloneCall(const BoundStatement& boundStatement) override;
+
+private:
+    bool confidentialStatement = false;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/visitor/default_type_solver.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/visitor/default_type_solver.h
new file mode 100644
index 0000000000..381dd181bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/visitor/default_type_solver.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "binder/bound_statement_visitor.h"
+
+namespace lbug {
+namespace binder {
+
+// Assign a default data type (STRING) for expressions with ANY data type for a given statement.
+// E.g. RETURN NULL; Expression NULL can be resolved as any type based on semantic.
+// We don't iterate all expressions because
+// - predicates must have been resolved to BOOL type
+// - lhs expressions for update must have been resolved to column type
+// So we only need to resolve for expressions appear in the projection clause. This assumption might
+// change as we add more features.
+class DefaultTypeSolver final : public BoundStatementVisitor {
+private:
+    void visitProjectionBody(const BoundProjectionBody& projectionBody) override;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/visitor/property_collector.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/visitor/property_collector.h
new file mode 100644
index 0000000000..d9a52f3621
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/binder/visitor/property_collector.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include "binder/bound_statement_visitor.h"
+
+namespace lbug {
+namespace binder {
+
+// Collect all property expressions for a given statement.
+class LBUG_API PropertyCollector final : public BoundStatementVisitor {
+public:
+    expression_vector getProperties() const;
+
+    // Skip collecting node/rel properties if they are in WITH projection list.
+    // See with_clause_projection_rewriter for more details.
+    void visitSingleQuerySkipNodeRel(const NormalizedSingleQuery& singleQuery);
+
+private:
+    void visitQueryPartSkipNodeRel(const NormalizedQueryPart& queryPart);
+
+    void visitMatch(const BoundReadingClause& readingClause) override;
+    void visitUnwind(const BoundReadingClause& readingClause) override;
+    void visitLoadFrom(const BoundReadingClause& readingClause) override;
+    void visitTableFunctionCall(const BoundReadingClause&) override;
+
+    void visitSet(const BoundUpdatingClause& updatingClause) override;
+    void visitDelete(const BoundUpdatingClause& updatingClause) override;
+    void visitInsert(const BoundUpdatingClause& updatingClause) override;
+    void visitMerge(const BoundUpdatingClause& updatingClause) override;
+
+    void visitProjectionBodySkipNodeRel(const BoundProjectionBody& projectionBody);
+    void visitProjectionBody(const BoundProjectionBody& projectionBody) override;
+    void visitProjectionBodyPredicate(const std::shared_ptr<Expression>& predicate) override;
+
+    void collectProperties(const std::shared_ptr<Expression>& expression);
+    void collectPropertiesSkipNodeRel(const std::shared_ptr<Expression>& expression);
+
+private:
+    expression_set properties;
+};
+
+} // namespace binder
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/c_api/helpers.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/c_api/helpers.h
new file mode 100644
index 0000000000..21b386ab45
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/c_api/helpers.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+#ifdef _WIN32
+#include <time.h>
+
+#include <windows.h>
+
+time_t convertTmToTime(struct tm tm);
+
+int32_t convertTimeToTm(time_t time, struct tm* out_tm);
+#endif
+
+char* convertToOwnedCString(const std::string& str);
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/c_api/lbug.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/c_api/lbug.h
new file mode 100644
index 0000000000..c5d6cbac10
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/c_api/lbug.h
@@ -0,0 +1,1588 @@
+#pragma once
+#include <stdbool.h>
+#include <stdint.h>
+#include <time.h>
+#ifdef _WIN32
+#include <windows.h>
+#endif
+
+/* Export header from common/api.h */
+// Helpers
+#if defined _WIN32 || defined __CYGWIN__
+#define LBUG_HELPER_DLL_IMPORT __declspec(dllimport)
+#define LBUG_HELPER_DLL_EXPORT __declspec(dllexport)
+#define LBUG_HELPER_DLL_LOCAL
+#define LBUG_HELPER_DEPRECATED __declspec(deprecated)
+#else
+#define LBUG_HELPER_DLL_IMPORT __attribute__((visibility("default")))
+#define LBUG_HELPER_DLL_EXPORT __attribute__((visibility("default")))
+#define LBUG_HELPER_DLL_LOCAL __attribute__((visibility("hidden")))
+#define LBUG_HELPER_DEPRECATED __attribute__((__deprecated__))
+#endif
+
+#ifdef LBUG_STATIC_DEFINE
+#define LBUG_API
+#define LBUG_NO_EXPORT
+#else
+#ifndef LBUG_API
+#ifdef LBUG_EXPORTS
+/* We are building this library */
+#define LBUG_API LBUG_HELPER_DLL_EXPORT
+#else
+/* We are using this library */
+#define LBUG_API LBUG_HELPER_DLL_IMPORT
+#endif
+#endif
+
+#endif
+
+#ifndef LBUG_DEPRECATED
+#define LBUG_DEPRECATED LBUG_HELPER_DEPRECATED
+#endif
+
+#ifndef LBUG_DEPRECATED_EXPORT
+#define LBUG_DEPRECATED_EXPORT LBUG_API LBUG_DEPRECATED
+#endif
+/* end export header */
+
+// The Arrow C data interface.
+// https://arrow.apache.org/docs/format/CDataInterface.html
+
+#include <stdint.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#ifndef ARROW_C_DATA_INTERFACE
+#define ARROW_C_DATA_INTERFACE
+
+#define ARROW_FLAG_DICTIONARY_ORDERED 1
+#define ARROW_FLAG_NULLABLE 2
+#define ARROW_FLAG_MAP_KEYS_SORTED 4
+
+struct ArrowSchema {
+    // Array type description
+    const char* format;
+    const char* name;
+    const char* metadata;
+    int64_t flags;
+    int64_t n_children;
+    struct ArrowSchema** children;
+    struct ArrowSchema* dictionary;
+
+    // Release callback
+    void (*release)(struct ArrowSchema*);
+    // Opaque producer-specific data
+    void* private_data;
+};
+
+struct ArrowArray {
+    // Array data description
+    int64_t length;
+    int64_t null_count;
+    int64_t offset;
+    int64_t n_buffers;
+    int64_t n_children;
+    const void** buffers;
+    struct ArrowArray** children;
+    struct ArrowArray* dictionary;
+
+    // Release callback
+    void (*release)(struct ArrowArray*);
+    // Opaque producer-specific data
+    void* private_data;
+};
+
+#endif // ARROW_C_DATA_INTERFACE
+
+#ifdef __cplusplus
+}
+#endif
+
+#ifdef __cplusplus
+#define LBUG_C_API extern "C" LBUG_API
+#else
+#define LBUG_C_API LBUG_API
+#endif
+
+/**
+ * @brief Stores runtime configuration for creating or opening a Database
+ */
+typedef struct {
+    // bufferPoolSize Max size of the buffer pool in bytes.
+    // The larger the buffer pool, the more data from the database files is kept in memory,
+    // reducing the amount of File I/O
+    uint64_t buffer_pool_size;
+    // The maximum number of threads to use during query execution
+    uint64_t max_num_threads;
+    // Whether or not to compress data on-disk for supported types
+    bool enable_compression;
+    // If true, open the database in read-only mode. No write transaction is allowed on the Database
+    // object. If false, open the database read-write.
+    bool read_only;
+    //  The maximum size of the database in bytes. Note that this is introduced temporarily for now
+    //  to get around with the default 8TB mmap address space limit under some environment. This
+    //  will be removed once we implemente a better solution later. The value is default to 1 << 43
+    //  (8TB) under 64-bit environment and 1GB under 32-bit one (see `DEFAULT_VM_REGION_MAX_SIZE`).
+    uint64_t max_db_size;
+    // If true, the database will automatically checkpoint when the size of
+    // the WAL file exceeds the checkpoint threshold.
+    bool auto_checkpoint;
+    // The threshold of the WAL file size in bytes. When the size of the
+    // WAL file exceeds this threshold, the database will checkpoint if auto_checkpoint is true.
+    uint64_t checkpoint_threshold;
+
+#if defined(__APPLE__)
+    // The thread quality of service (QoS) for the worker threads.
+    // This works for Swift bindings on Apple platforms only.
+    uint32_t thread_qos;
+#endif
+} lbug_system_config;
+
+/**
+ * @brief lbug_database manages all database components.
+ */
+typedef struct {
+    void* _database;
+} lbug_database;
+
+/**
+ * @brief lbug_connection is used to interact with a Database instance. Each connection is
+ * thread-safe. Multiple connections can connect to the same Database instance in a multi-threaded
+ * environment.
+ */
+typedef struct {
+    void* _connection;
+} lbug_connection;
+
+/**
+ * @brief lbug_prepared_statement is a parameterized query which can avoid planning the same query
+ * for repeated execution.
+ */
+typedef struct {
+    void* _prepared_statement;
+    void* _bound_values;
+} lbug_prepared_statement;
+
+/**
+ * @brief lbug_query_result stores the result of a query.
+ */
+typedef struct {
+    void* _query_result;
+    bool _is_owned_by_cpp;
+} lbug_query_result;
+
+/**
+ * @brief lbug_flat_tuple stores a vector of values.
+ */
+typedef struct {
+    void* _flat_tuple;
+    bool _is_owned_by_cpp;
+} lbug_flat_tuple;
+
+/**
+ * @brief lbug_logical_type is the lbug internal representation of data types.
+ */
+typedef struct {
+    void* _data_type;
+} lbug_logical_type;
+
+/**
+ * @brief lbug_value is used to represent a value with any lbug internal dataType.
+ */
+typedef struct {
+    void* _value;
+    bool _is_owned_by_cpp;
+} lbug_value;
+
+/**
+ * @brief lbug internal internal_id type which stores the table_id and offset of a node/rel.
+ */
+typedef struct {
+    uint64_t table_id;
+    uint64_t offset;
+} lbug_internal_id_t;
+
+/**
+ * @brief lbug internal date type which stores the number of days since 1970-01-01 00:00:00 UTC.
+ */
+typedef struct {
+    // Days since 1970-01-01 00:00:00 UTC.
+    int32_t days;
+} lbug_date_t;
+
+/**
+ * @brief lbug internal timestamp_ns type which stores the number of nanoseconds since 1970-01-01
+ * 00:00:00 UTC.
+ */
+typedef struct {
+    // Nanoseconds since 1970-01-01 00:00:00 UTC.
+    int64_t value;
+} lbug_timestamp_ns_t;
+
+/**
+ * @brief lbug internal timestamp_ms type which stores the number of milliseconds since 1970-01-01
+ * 00:00:00 UTC.
+ */
+typedef struct {
+    // Milliseconds since 1970-01-01 00:00:00 UTC.
+    int64_t value;
+} lbug_timestamp_ms_t;
+
+/**
+ * @brief lbug internal timestamp_sec_t type which stores the number of seconds since 1970-01-01
+ * 00:00:00 UTC.
+ */
+typedef struct {
+    // Seconds since 1970-01-01 00:00:00 UTC.
+    int64_t value;
+} lbug_timestamp_sec_t;
+
+/**
+ * @brief lbug internal timestamp_tz type which stores the number of microseconds since 1970-01-01
+ * with timezone 00:00:00 UTC.
+ */
+typedef struct {
+    // Microseconds since 1970-01-01 00:00:00 UTC.
+    int64_t value;
+} lbug_timestamp_tz_t;
+
+/**
+ * @brief lbug internal timestamp type which stores the number of microseconds since 1970-01-01
+ * 00:00:00 UTC.
+ */
+typedef struct {
+    // Microseconds since 1970-01-01 00:00:00 UTC.
+    int64_t value;
+} lbug_timestamp_t;
+
+/**
+ * @brief lbug internal interval type which stores the months, days and microseconds.
+ */
+typedef struct {
+    int32_t months;
+    int32_t days;
+    int64_t micros;
+} lbug_interval_t;
+
+/**
+ * @brief lbug_query_summary stores the execution time, plan, compiling time and query options of a
+ * query.
+ */
+typedef struct {
+    void* _query_summary;
+} lbug_query_summary;
+
+typedef struct {
+    uint64_t low;
+    int64_t high;
+} lbug_int128_t;
+
+/**
+ * @brief enum class for lbug internal dataTypes.
+ */
+typedef enum {
+    LBUG_ANY = 0,
+    LBUG_NODE = 10,
+    LBUG_REL = 11,
+    LBUG_RECURSIVE_REL = 12,
+    // SERIAL is a special data type that is used to represent a sequence of INT64 values that are
+    // incremented by 1 starting from 0.
+    LBUG_SERIAL = 13,
+    // fixed size types
+    LBUG_BOOL = 22,
+    LBUG_INT64 = 23,
+    LBUG_INT32 = 24,
+    LBUG_INT16 = 25,
+    LBUG_INT8 = 26,
+    LBUG_UINT64 = 27,
+    LBUG_UINT32 = 28,
+    LBUG_UINT16 = 29,
+    LBUG_UINT8 = 30,
+    LBUG_INT128 = 31,
+    LBUG_DOUBLE = 32,
+    LBUG_FLOAT = 33,
+    LBUG_DATE = 34,
+    LBUG_TIMESTAMP = 35,
+    LBUG_TIMESTAMP_SEC = 36,
+    LBUG_TIMESTAMP_MS = 37,
+    LBUG_TIMESTAMP_NS = 38,
+    LBUG_TIMESTAMP_TZ = 39,
+    LBUG_INTERVAL = 40,
+    LBUG_DECIMAL = 41,
+    LBUG_INTERNAL_ID = 42,
+    // variable size types
+    LBUG_STRING = 50,
+    LBUG_BLOB = 51,
+    LBUG_LIST = 52,
+    LBUG_ARRAY = 53,
+    LBUG_STRUCT = 54,
+    LBUG_MAP = 55,
+    LBUG_UNION = 56,
+    LBUG_POINTER = 58,
+    LBUG_UUID = 59
+} lbug_data_type_id;
+
+/**
+ * @brief enum class for lbug function return state.
+ */
+typedef enum { LbugSuccess = 0, LbugError = 1 } lbug_state;
+
+// Database
+/**
+ * @brief Allocates memory and creates a lbug database instance at database_path with
+ * bufferPoolSize=buffer_pool_size. Caller is responsible for calling lbug_database_destroy() to
+ * release the allocated memory.
+ * @param database_path The path to the database.
+ * @param system_config The runtime configuration for creating or opening the database.
+ * @param[out] out_database The output parameter that will hold the database instance.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_database_init(const char* database_path,
+    lbug_system_config system_config, lbug_database* out_database);
+/**
+ * @brief Destroys the lbug database instance and frees the allocated memory.
+ * @param database The database instance to destroy.
+ */
+LBUG_C_API void lbug_database_destroy(lbug_database* database);
+
+LBUG_C_API lbug_system_config lbug_default_system_config();
+
+// Connection
+/**
+ * @brief Allocates memory and creates a connection to the database. Caller is responsible for
+ * calling lbug_connection_destroy() to release the allocated memory.
+ * @param database The database instance to connect to.
+ * @param[out] out_connection The output parameter that will hold the connection instance.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_connection_init(lbug_database* database,
+    lbug_connection* out_connection);
+/**
+ * @brief Destroys the connection instance and frees the allocated memory.
+ * @param connection The connection instance to destroy.
+ */
+LBUG_C_API void lbug_connection_destroy(lbug_connection* connection);
+/**
+ * @brief Sets the maximum number of threads to use for executing queries.
+ * @param connection The connection instance to set max number of threads for execution.
+ * @param num_threads The maximum number of threads to use for executing queries.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_connection_set_max_num_thread_for_exec(lbug_connection* connection,
+    uint64_t num_threads);
+
+/**
+ * @brief Returns the maximum number of threads of the connection to use for executing queries.
+ * @param connection The connection instance to return max number of threads for execution.
+ * @param[out] out_result The output parameter that will hold the maximum number of threads to use
+ * for executing queries.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_connection_get_max_num_thread_for_exec(lbug_connection* connection,
+    uint64_t* out_result);
+/**
+ * @brief Executes the given query and returns the result.
+ * @param connection The connection instance to execute the query.
+ * @param query The query to execute.
+ * @param[out] out_query_result The output parameter that will hold the result of the query.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_connection_query(lbug_connection* connection, const char* query,
+    lbug_query_result* out_query_result);
+/**
+ * @brief Prepares the given query and returns the prepared statement.
+ * @param connection The connection instance to prepare the query.
+ * @param query The query to prepare.
+ * @param[out] out_prepared_statement The output parameter that will hold the prepared statement.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_connection_prepare(lbug_connection* connection, const char* query,
+    lbug_prepared_statement* out_prepared_statement);
+/**
+ * @brief Executes the prepared_statement using connection.
+ * @param connection The connection instance to execute the prepared_statement.
+ * @param prepared_statement The prepared statement to execute.
+ * @param[out] out_query_result The output parameter that will hold the result of the query.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_connection_execute(lbug_connection* connection,
+    lbug_prepared_statement* prepared_statement, lbug_query_result* out_query_result);
+/**
+ * @brief Interrupts the current query execution in the connection.
+ * @param connection The connection instance to interrupt.
+ */
+LBUG_C_API void lbug_connection_interrupt(lbug_connection* connection);
+/**
+ * @brief Sets query timeout value in milliseconds for the connection.
+ * @param connection The connection instance to set query timeout value.
+ * @param timeout_in_ms The timeout value in milliseconds.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_connection_set_query_timeout(lbug_connection* connection,
+    uint64_t timeout_in_ms);
+
+// PreparedStatement
+/**
+ * @brief Destroys the prepared statement instance and frees the allocated memory.
+ * @param prepared_statement The prepared statement instance to destroy.
+ */
+LBUG_C_API void lbug_prepared_statement_destroy(lbug_prepared_statement* prepared_statement);
+/**
+ * @return the query is prepared successfully or not.
+ */
+LBUG_C_API bool lbug_prepared_statement_is_success(lbug_prepared_statement* prepared_statement);
+/**
+ * @brief Returns the error message if the prepared statement is not prepared successfully.
+ * The caller is responsible for freeing the returned string with `lbug_destroy_string`.
+ * @param prepared_statement The prepared statement instance.
+ * @return the error message if the statement is not prepared successfully or null
+ * if the statement is prepared successfully.
+ */
+LBUG_C_API char* lbug_prepared_statement_get_error_message(
+    lbug_prepared_statement* prepared_statement);
+/**
+ * @brief Binds the given boolean value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The boolean value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_bool(lbug_prepared_statement* prepared_statement,
+    const char* param_name, bool value);
+/**
+ * @brief Binds the given int64_t value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The int64_t value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_int64(
+    lbug_prepared_statement* prepared_statement, const char* param_name, int64_t value);
+/**
+ * @brief Binds the given int32_t value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The int32_t value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_int32(
+    lbug_prepared_statement* prepared_statement, const char* param_name, int32_t value);
+/**
+ * @brief Binds the given int16_t value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The int16_t value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_int16(
+    lbug_prepared_statement* prepared_statement, const char* param_name, int16_t value);
+/**
+ * @brief Binds the given int8_t value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The int8_t value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_int8(lbug_prepared_statement* prepared_statement,
+    const char* param_name, int8_t value);
+/**
+ * @brief Binds the given uint64_t value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The uint64_t value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_uint64(
+    lbug_prepared_statement* prepared_statement, const char* param_name, uint64_t value);
+/**
+ * @brief Binds the given uint32_t value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The uint32_t value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_uint32(
+    lbug_prepared_statement* prepared_statement, const char* param_name, uint32_t value);
+/**
+ * @brief Binds the given uint16_t value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The uint16_t value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_uint16(
+    lbug_prepared_statement* prepared_statement, const char* param_name, uint16_t value);
+/**
+ * @brief Binds the given int8_t value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The int8_t value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_uint8(
+    lbug_prepared_statement* prepared_statement, const char* param_name, uint8_t value);
+
+/**
+ * @brief Binds the given double value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The double value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_double(
+    lbug_prepared_statement* prepared_statement, const char* param_name, double value);
+/**
+ * @brief Binds the given float value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The float value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_float(
+    lbug_prepared_statement* prepared_statement, const char* param_name, float value);
+/**
+ * @brief Binds the given date value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The date value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_date(lbug_prepared_statement* prepared_statement,
+    const char* param_name, lbug_date_t value);
+/**
+ * @brief Binds the given timestamp_ns value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The timestamp_ns value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_timestamp_ns(
+    lbug_prepared_statement* prepared_statement, const char* param_name, lbug_timestamp_ns_t value);
+/**
+ * @brief Binds the given timestamp_sec value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The timestamp_sec value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_timestamp_sec(
+    lbug_prepared_statement* prepared_statement, const char* param_name,
+    lbug_timestamp_sec_t value);
+/**
+ * @brief Binds the given timestamp_tz value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The timestamp_tz value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_timestamp_tz(
+    lbug_prepared_statement* prepared_statement, const char* param_name, lbug_timestamp_tz_t value);
+/**
+ * @brief Binds the given timestamp_ms value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The timestamp_ms value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_timestamp_ms(
+    lbug_prepared_statement* prepared_statement, const char* param_name, lbug_timestamp_ms_t value);
+/**
+ * @brief Binds the given timestamp value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The timestamp value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_timestamp(
+    lbug_prepared_statement* prepared_statement, const char* param_name, lbug_timestamp_t value);
+/**
+ * @brief Binds the given interval value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The interval value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_interval(
+    lbug_prepared_statement* prepared_statement, const char* param_name, lbug_interval_t value);
+/**
+ * @brief Binds the given string value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The string value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_string(
+    lbug_prepared_statement* prepared_statement, const char* param_name, const char* value);
+/**
+ * @brief Binds the given lbug value to the given parameter name in the prepared statement.
+ * @param prepared_statement The prepared statement instance to bind the value.
+ * @param param_name The parameter name to bind the value.
+ * @param value The lbug value to bind.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_prepared_statement_bind_value(
+    lbug_prepared_statement* prepared_statement, const char* param_name, lbug_value* value);
+
+// QueryResult
+/**
+ * @brief Destroys the given query result instance.
+ * @param query_result The query result instance to destroy.
+ */
+LBUG_C_API void lbug_query_result_destroy(lbug_query_result* query_result);
+/**
+ * @brief Returns true if the query is executed successful, false otherwise.
+ * @param query_result The query result instance to check.
+ */
+LBUG_C_API bool lbug_query_result_is_success(lbug_query_result* query_result);
+/**
+ * @brief Returns the error message if the query is failed.
+ * The caller is responsible for freeing the returned string with `lbug_destroy_string`.
+ * @param query_result The query result instance to check and return error message.
+ * @return The error message if the query has failed, or null if the query is successful.
+ */
+LBUG_C_API char* lbug_query_result_get_error_message(lbug_query_result* query_result);
+/**
+ * @brief Returns the number of columns in the query result.
+ * @param query_result The query result instance to return.
+ */
+LBUG_C_API uint64_t lbug_query_result_get_num_columns(lbug_query_result* query_result);
+/**
+ * @brief Returns the column name at the given index.
+ * @param query_result The query result instance to return.
+ * @param index The index of the column to return name.
+ * @param[out] out_column_name The output parameter that will hold the column name.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_query_result_get_column_name(lbug_query_result* query_result,
+    uint64_t index, char** out_column_name);
+/**
+ * @brief Returns the data type of the column at the given index.
+ * @param query_result The query result instance to return.
+ * @param index The index of the column to return data type.
+ * @param[out] out_column_data_type The output parameter that will hold the column data type.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_query_result_get_column_data_type(lbug_query_result* query_result,
+    uint64_t index, lbug_logical_type* out_column_data_type);
+/**
+ * @brief Returns the number of tuples in the query result.
+ * @param query_result The query result instance to return.
+ */
+LBUG_C_API uint64_t lbug_query_result_get_num_tuples(lbug_query_result* query_result);
+/**
+ * @brief Returns the query summary of the query result.
+ * @param query_result The query result instance to return.
+ * @param[out] out_query_summary The output parameter that will hold the query summary.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_query_result_get_query_summary(lbug_query_result* query_result,
+    lbug_query_summary* out_query_summary);
+/**
+ * @brief Returns true if we have not consumed all tuples in the query result, false otherwise.
+ * @param query_result The query result instance to check.
+ */
+LBUG_C_API bool lbug_query_result_has_next(lbug_query_result* query_result);
+/**
+ * @brief Returns the next tuple in the query result. Throws an exception if there is no more tuple.
+ * Note that to reduce resource allocation, all calls to lbug_query_result_get_next() reuse the same
+ * FlatTuple object. Since its contents will be overwritten, please complete processing a FlatTuple
+ * or make a copy of its data before calling lbug_query_result_get_next() again.
+ * @param query_result The query result instance to return.
+ * @param[out] out_flat_tuple The output parameter that will hold the next tuple.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_query_result_get_next(lbug_query_result* query_result,
+    lbug_flat_tuple* out_flat_tuple);
+/**
+ * @brief Returns true if we have not consumed all query results, false otherwise. Use this function
+ * for loop results of multiple query statements
+ * @param query_result The query result instance to check.
+ */
+LBUG_C_API bool lbug_query_result_has_next_query_result(lbug_query_result* query_result);
+/**
+ * @brief Returns the next query result. Use this function to loop multiple query statements'
+ * results.
+ * @param query_result The query result instance to return.
+ * @param[out] out_next_query_result The output parameter that will hold the next query result.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_query_result_get_next_query_result(lbug_query_result* query_result,
+    lbug_query_result* out_next_query_result);
+
+/**
+ * @brief Returns the query result as a string.
+ * @param query_result The query result instance to return.
+ * @return The query result as a string.
+ */
+LBUG_C_API char* lbug_query_result_to_string(lbug_query_result* query_result);
+/**
+ * @brief Resets the iterator of the query result to the beginning of the query result.
+ * @param query_result The query result instance to reset iterator.
+ */
+LBUG_C_API void lbug_query_result_reset_iterator(lbug_query_result* query_result);
+
+/**
+ * @brief Returns the query result's schema as ArrowSchema.
+ * @param query_result The query result instance to return.
+ * @param[out] out_schema The output parameter that will hold the datatypes of the columns as an
+ * arrow schema.
+ * @return The state indicating the success or failure of the operation.
+ *
+ * It is the caller's responsibility to call the release function to release the underlying data
+ */
+LBUG_C_API lbug_state lbug_query_result_get_arrow_schema(lbug_query_result* query_result,
+    struct ArrowSchema* out_schema);
+
+/**
+ * @brief Returns the next chunk of the query result as ArrowArray.
+ * @param query_result The query result instance to return.
+ * @param chunk_size The number of tuples to return in the chunk.
+ * @param[out] out_arrow_array The output parameter that will hold the arrow array representation of
+ * the query result. The arrow array internally stores an arrow struct with fields for each of the
+ * columns.
+ * @return The state indicating the success or failure of the operation.
+ *
+ * It is the caller's responsibility to call the release function to release the underlying data
+ */
+LBUG_C_API lbug_state lbug_query_result_get_next_arrow_chunk(lbug_query_result* query_result,
+    int64_t chunk_size, struct ArrowArray* out_arrow_array);
+
+// FlatTuple
+/**
+ * @brief Destroys the given flat tuple instance.
+ * @param flat_tuple The flat tuple instance to destroy.
+ */
+LBUG_C_API void lbug_flat_tuple_destroy(lbug_flat_tuple* flat_tuple);
+/**
+ * @brief Returns the value at index of the flat tuple.
+ * @param flat_tuple The flat tuple instance to return.
+ * @param index The index of the value to return.
+ * @param[out] out_value The output parameter that will hold the value at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_flat_tuple_get_value(lbug_flat_tuple* flat_tuple, uint64_t index,
+    lbug_value* out_value);
+/**
+ * @brief Converts the flat tuple to a string.
+ * @param flat_tuple The flat tuple instance to convert.
+ * @return The flat tuple as a string.
+ */
+LBUG_C_API char* lbug_flat_tuple_to_string(lbug_flat_tuple* flat_tuple);
+
+// DataType
+// TODO(Chang): Refactor the datatype constructor to follow the cpp way of creating dataTypes.
+/**
+ * @brief Creates a data type instance with the given id, childType and num_elements_in_array.
+ * Caller is responsible for destroying the returned data type instance.
+ * @param id The enum type id of the datatype to create.
+ * @param child_type The child type of the datatype to create(only used for nested dataTypes).
+ * @param num_elements_in_array The number of elements in the array(only used for ARRAY).
+ * @param[out] out_type The output parameter that will hold the data type instance.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API void lbug_data_type_create(lbug_data_type_id id, lbug_logical_type* child_type,
+    uint64_t num_elements_in_array, lbug_logical_type* out_type);
+/**
+ * @brief Creates a new data type instance by cloning the given data type instance.
+ * @param data_type The data type instance to clone.
+ * @param[out] out_type The output parameter that will hold the cloned data type instance.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API void lbug_data_type_clone(lbug_logical_type* data_type, lbug_logical_type* out_type);
+/**
+ * @brief Destroys the given data type instance.
+ * @param data_type The data type instance to destroy.
+ */
+LBUG_C_API void lbug_data_type_destroy(lbug_logical_type* data_type);
+/**
+ * @brief Returns true if the given data type is equal to the other data type, false otherwise.
+ * @param data_type1 The first data type instance to compare.
+ * @param data_type2 The second data type instance to compare.
+ */
+LBUG_C_API bool lbug_data_type_equals(lbug_logical_type* data_type1, lbug_logical_type* data_type2);
+/**
+ * @brief Returns the enum type id of the given data type.
+ * @param data_type The data type instance to return.
+ */
+LBUG_C_API lbug_data_type_id lbug_data_type_get_id(lbug_logical_type* data_type);
+/**
+ * @brief Returns the number of elements for array.
+ * @param data_type The data type instance to return.
+ * @param[out] out_result The output parameter that will hold the number of elements in the array.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_data_type_get_num_elements_in_array(lbug_logical_type* data_type,
+    uint64_t* out_result);
+
+// Value
+/**
+ * @brief Creates a NULL value of ANY type. Caller is responsible for destroying the returned value.
+ */
+LBUG_C_API lbug_value* lbug_value_create_null();
+/**
+ * @brief Creates a value of the given data type. Caller is responsible for destroying the
+ * returned value.
+ * @param data_type The data type of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_null_with_data_type(lbug_logical_type* data_type);
+/**
+ * @brief Returns true if the given value is NULL, false otherwise.
+ * @param value The value instance to check.
+ */
+LBUG_C_API bool lbug_value_is_null(lbug_value* value);
+/**
+ * @brief Sets the given value to NULL or not.
+ * @param value The value instance to set.
+ * @param is_null True if sets the value to NULL, false otherwise.
+ */
+LBUG_C_API void lbug_value_set_null(lbug_value* value, bool is_null);
+/**
+ * @brief Creates a value of the given data type with default non-NULL value. Caller is responsible
+ * for destroying the returned value.
+ * @param data_type The data type of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_default(lbug_logical_type* data_type);
+/**
+ * @brief Creates a value with boolean type and the given bool value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The bool value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_bool(bool val_);
+/**
+ * @brief Creates a value with int8 type and the given int8 value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The int8 value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_int8(int8_t val_);
+/**
+ * @brief Creates a value with int16 type and the given int16 value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The int16 value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_int16(int16_t val_);
+/**
+ * @brief Creates a value with int32 type and the given int32 value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The int32 value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_int32(int32_t val_);
+/**
+ * @brief Creates a value with int64 type and the given int64 value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The int64 value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_int64(int64_t val_);
+/**
+ * @brief Creates a value with uint8 type and the given uint8 value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The uint8 value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_uint8(uint8_t val_);
+/**
+ * @brief Creates a value with uint16 type and the given uint16 value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The uint16 value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_uint16(uint16_t val_);
+/**
+ * @brief Creates a value with uint32 type and the given uint32 value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The uint32 value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_uint32(uint32_t val_);
+/**
+ * @brief Creates a value with uint64 type and the given uint64 value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The uint64 value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_uint64(uint64_t val_);
+/**
+ * @brief Creates a value with int128 type and the given int128 value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The int128 value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_int128(lbug_int128_t val_);
+/**
+ * @brief Creates a value with float type and the given float value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The float value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_float(float val_);
+/**
+ * @brief Creates a value with double type and the given double value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The double value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_double(double val_);
+/**
+ * @brief Creates a value with internal_id type and the given internal_id value. Caller is
+ * responsible for destroying the returned value.
+ * @param val_ The internal_id value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_internal_id(lbug_internal_id_t val_);
+/**
+ * @brief Creates a value with date type and the given date value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The date value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_date(lbug_date_t val_);
+/**
+ * @brief Creates a value with timestamp_ns type and the given timestamp value. Caller is
+ * responsible for destroying the returned value.
+ * @param val_ The timestamp_ns value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_timestamp_ns(lbug_timestamp_ns_t val_);
+/**
+ * @brief Creates a value with timestamp_ms type and the given timestamp value. Caller is
+ * responsible for destroying the returned value.
+ * @param val_ The timestamp_ms value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_timestamp_ms(lbug_timestamp_ms_t val_);
+/**
+ * @brief Creates a value with timestamp_sec type and the given timestamp value. Caller is
+ * responsible for destroying the returned value.
+ * @param val_ The timestamp_sec value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_timestamp_sec(lbug_timestamp_sec_t val_);
+/**
+ * @brief Creates a value with timestamp_tz type and the given timestamp value. Caller is
+ * responsible for destroying the returned value.
+ * @param val_ The timestamp_tz value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_timestamp_tz(lbug_timestamp_tz_t val_);
+/**
+ * @brief Creates a value with timestamp type and the given timestamp value. Caller is responsible
+ * for destroying the returned value.
+ * @param val_ The timestamp value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_timestamp(lbug_timestamp_t val_);
+/**
+ * @brief Creates a value with interval type and the given interval value. Caller is responsible
+ * for destroying the returned value.
+ * @param val_ The interval value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_interval(lbug_interval_t val_);
+/**
+ * @brief Creates a value with string type and the given string value. Caller is responsible for
+ * destroying the returned value.
+ * @param val_ The string value of the value to create.
+ */
+LBUG_C_API lbug_value* lbug_value_create_string(const char* val_);
+/**
+ * @brief Creates a list value with the given number of elements and the given elements.
+ * The caller needs to make sure that all elements have the same type.
+ * The elements are copied into the list value, so destroying the elements after creating the list
+ * value is safe.
+ * Caller is responsible for destroying the returned value.
+ * @param num_elements The number of elements in the list.
+ * @param elements The elements of the list.
+ * @param[out] out_value The output parameter that will hold a pointer to the created list value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_create_list(uint64_t num_elements, lbug_value** elements,
+    lbug_value** out_value);
+/**
+ * @brief Creates a struct value with the given number of fields and the given field names and
+ * values. The caller needs to make sure that all field names are unique.
+ * The field names and values are copied into the struct value, so destroying the field names and
+ * values after creating the struct value is safe.
+ * Caller is responsible for destroying the returned value.
+ * @param num_fields The number of fields in the struct.
+ * @param field_names The field names of the struct.
+ * @param field_values The field values of the struct.
+ * @param[out] out_value The output parameter that will hold a pointer to the created struct value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_create_struct(uint64_t num_fields, const char** field_names,
+    lbug_value** field_values, lbug_value** out_value);
+/**
+ * @brief Creates a map value with the given number of fields and the given keys and values. The
+ * caller needs to make sure that all keys are unique, and all keys and values have the same type.
+ * The keys and values are copied into the map value, so destroying the keys and values after
+ * creating the map value is safe.
+ * Caller is responsible for destroying the returned value.
+ * @param num_fields The number of fields in the map.
+ * @param keys The keys of the map.
+ * @param values The values of the map.
+ * @param[out] out_value The output parameter that will hold a pointer to the created map value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_create_map(uint64_t num_fields, lbug_value** keys,
+    lbug_value** values, lbug_value** out_value);
+/**
+ * @brief Creates a new value based on the given value. Caller is responsible for destroying the
+ * returned value.
+ * @param value The value to create from.
+ */
+LBUG_C_API lbug_value* lbug_value_clone(lbug_value* value);
+/**
+ * @brief Copies the other value to the value.
+ * @param value The value to copy to.
+ * @param other The value to copy from.
+ */
+LBUG_C_API void lbug_value_copy(lbug_value* value, lbug_value* other);
+/**
+ * @brief Destroys the value.
+ * @param value The value to destroy.
+ */
+LBUG_C_API void lbug_value_destroy(lbug_value* value);
+/**
+ * @brief Returns the number of elements per list of the given value. The value must be of type
+ * ARRAY.
+ * @param value The ARRAY value to get list size.
+ * @param[out] out_result The output parameter that will hold the number of elements per list.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_list_size(lbug_value* value, uint64_t* out_result);
+/**
+ * @brief Returns the element at index of the given value. The value must be of type LIST.
+ * @param value The LIST value to return.
+ * @param index The index of the element to return.
+ * @param[out] out_value The output parameter that will hold the element at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_list_element(lbug_value* value, uint64_t index,
+    lbug_value* out_value);
+/**
+ * @brief Returns the number of fields of the given struct value. The value must be of type STRUCT.
+ * @param value The STRUCT value to get number of fields.
+ * @param[out] out_result The output parameter that will hold the number of fields.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_struct_num_fields(lbug_value* value, uint64_t* out_result);
+/**
+ * @brief Returns the field name at index of the given struct value. The value must be of physical
+ * type STRUCT (STRUCT, NODE, REL, RECURSIVE_REL, UNION).
+ * @param value The STRUCT value to get field name.
+ * @param index The index of the field name to return.
+ * @param[out] out_result The output parameter that will hold the field name at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_struct_field_name(lbug_value* value, uint64_t index,
+    char** out_result);
+/**
+ * @brief Returns the field value at index of the given struct value. The value must be of physical
+ * type STRUCT (STRUCT, NODE, REL, RECURSIVE_REL, UNION).
+ * @param value The STRUCT value to get field value.
+ * @param index The index of the field value to return.
+ * @param[out] out_value The output parameter that will hold the field value at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_struct_field_value(lbug_value* value, uint64_t index,
+    lbug_value* out_value);
+
+/**
+ * @brief Returns the size of the given map value. The value must be of type MAP.
+ * @param value The MAP value to get size.
+ * @param[out] out_result The output parameter that will hold the size of the map.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_map_size(lbug_value* value, uint64_t* out_result);
+/**
+ * @brief Returns the key at index of the given map value. The value must be of physical
+ * type MAP.
+ * @param value The MAP value to get key.
+ * @param index The index of the field name to return.
+ * @param[out] out_key The output parameter that will hold the key at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_map_key(lbug_value* value, uint64_t index,
+    lbug_value* out_key);
+/**
+ * @brief Returns the field value at index of the given map value. The value must be of physical
+ * type MAP.
+ * @param value The MAP value to get field value.
+ * @param index The index of the field value to return.
+ * @param[out] out_value The output parameter that will hold the field value at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_map_value(lbug_value* value, uint64_t index,
+    lbug_value* out_value);
+/**
+ * @brief Returns the list of nodes for recursive rel value. The value must be of type
+ * RECURSIVE_REL.
+ * @param value The RECURSIVE_REL value to return.
+ * @param[out] out_value The output parameter that will hold the list of nodes.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_recursive_rel_node_list(lbug_value* value,
+    lbug_value* out_value);
+
+/**
+ * @brief Returns the list of rels for recursive rel value. The value must be of type RECURSIVE_REL.
+ * @param value The RECURSIVE_REL value to return.
+ * @param[out] out_value The output parameter that will hold the list of rels.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_recursive_rel_rel_list(lbug_value* value,
+    lbug_value* out_value);
+/**
+ * @brief Returns internal type of the given value.
+ * @param value The value to return.
+ * @param[out] out_type The output parameter that will hold the internal type of the value.
+ */
+LBUG_C_API void lbug_value_get_data_type(lbug_value* value, lbug_logical_type* out_type);
+/**
+ * @brief Returns the boolean value of the given value. The value must be of type BOOL.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the boolean value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_bool(lbug_value* value, bool* out_result);
+/**
+ * @brief Returns the int8 value of the given value. The value must be of type INT8.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the int8 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_int8(lbug_value* value, int8_t* out_result);
+/**
+ * @brief Returns the int16 value of the given value. The value must be of type INT16.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the int16 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_int16(lbug_value* value, int16_t* out_result);
+/**
+ * @brief Returns the int32 value of the given value. The value must be of type INT32.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the int32 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_int32(lbug_value* value, int32_t* out_result);
+/**
+ * @brief Returns the int64 value of the given value. The value must be of type INT64 or SERIAL.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the int64 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_int64(lbug_value* value, int64_t* out_result);
+/**
+ * @brief Returns the uint8 value of the given value. The value must be of type UINT8.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the uint8 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_uint8(lbug_value* value, uint8_t* out_result);
+/**
+ * @brief Returns the uint16 value of the given value. The value must be of type UINT16.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the uint16 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_uint16(lbug_value* value, uint16_t* out_result);
+/**
+ * @brief Returns the uint32 value of the given value. The value must be of type UINT32.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the uint32 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_uint32(lbug_value* value, uint32_t* out_result);
+/**
+ * @brief Returns the uint64 value of the given value. The value must be of type UINT64.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the uint64 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_uint64(lbug_value* value, uint64_t* out_result);
+/**
+ * @brief Returns the int128 value of the given value. The value must be of type INT128.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the int128 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_int128(lbug_value* value, lbug_int128_t* out_result);
+/**
+ * @brief convert a string to int128 value.
+ * @param str The string to convert.
+ * @param[out] out_result The output parameter that will hold the int128 value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_int128_t_from_string(const char* str, lbug_int128_t* out_result);
+/**
+ * @brief convert int128 to corresponding string.
+ * @param val The int128 value to convert.
+ * @param[out] out_result The output parameter that will hold the string value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_int128_t_to_string(lbug_int128_t val, char** out_result);
+/**
+ * @brief Returns the float value of the given value. The value must be of type FLOAT.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the float value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_float(lbug_value* value, float* out_result);
+/**
+ * @brief Returns the double value of the given value. The value must be of type DOUBLE.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the double value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_double(lbug_value* value, double* out_result);
+/**
+ * @brief Returns the internal id value of the given value. The value must be of type INTERNAL_ID.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the internal id value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_internal_id(lbug_value* value, lbug_internal_id_t* out_result);
+/**
+ * @brief Returns the date value of the given value. The value must be of type DATE.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the date value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_date(lbug_value* value, lbug_date_t* out_result);
+/**
+ * @brief Returns the timestamp value of the given value. The value must be of type TIMESTAMP.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the timestamp value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_timestamp(lbug_value* value, lbug_timestamp_t* out_result);
+/**
+ * @brief Returns the timestamp_ns value of the given value. The value must be of type TIMESTAMP_NS.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the timestamp_ns value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_timestamp_ns(lbug_value* value,
+    lbug_timestamp_ns_t* out_result);
+/**
+ * @brief Returns the timestamp_ms value of the given value. The value must be of type TIMESTAMP_MS.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the timestamp_ms value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_timestamp_ms(lbug_value* value,
+    lbug_timestamp_ms_t* out_result);
+/**
+ * @brief Returns the timestamp_sec value of the given value. The value must be of type
+ * TIMESTAMP_SEC.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the timestamp_sec value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_timestamp_sec(lbug_value* value,
+    lbug_timestamp_sec_t* out_result);
+/**
+ * @brief Returns the timestamp_tz value of the given value. The value must be of type TIMESTAMP_TZ.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the timestamp_tz value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_timestamp_tz(lbug_value* value,
+    lbug_timestamp_tz_t* out_result);
+/**
+ * @brief Returns the interval value of the given value. The value must be of type INTERVAL.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the interval value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_interval(lbug_value* value, lbug_interval_t* out_result);
+/**
+ * @brief Returns the decimal value of the given value as a string. The value must be of type
+ * DECIMAL.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the decimal value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_decimal_as_string(lbug_value* value, char** out_result);
+/**
+ * @brief Returns the string value of the given value. The value must be of type STRING.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the string value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_string(lbug_value* value, char** out_result);
+/**
+ * @brief Returns the blob value of the given value. The value must be of type BLOB.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the blob value.
+ * @param[out] out_length The output parameter that will hold the length of the blob.
+ * @return The state indicating the success or failure of the operation.
+ * @note The caller is responsible for freeing the returned memory using `lbug_destroy_blob`.
+ */
+LBUG_C_API lbug_state lbug_value_get_blob(lbug_value* value, uint8_t** out_result,
+    uint64_t* out_length);
+/**
+ * @brief Returns the uuid value of the given value.
+ * to a string. The value must be of type UUID.
+ * @param value The value to return.
+ * @param[out] out_result The output parameter that will hold the uuid value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_value_get_uuid(lbug_value* value, char** out_result);
+/**
+ * @brief Converts the given value to string.
+ * @param value The value to convert.
+ * @return The value as a string.
+ */
+LBUG_C_API char* lbug_value_to_string(lbug_value* value);
+/**
+ * @brief Returns the internal id value of the given node value as a lbug value.
+ * @param node_val The node value to return.
+ * @param[out] out_value The output parameter that will hold the internal id value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_node_val_get_id_val(lbug_value* node_val, lbug_value* out_value);
+/**
+ * @brief Returns the label value of the given node value as a label value.
+ * @param node_val The node value to return.
+ * @param[out] out_value The output parameter that will hold the label value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_node_val_get_label_val(lbug_value* node_val, lbug_value* out_value);
+/**
+ * @brief Returns the number of properties of the given node value.
+ * @param node_val The node value to return.
+ * @param[out] out_value The output parameter that will hold the number of properties.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_node_val_get_property_size(lbug_value* node_val, uint64_t* out_value);
+/**
+ * @brief Returns the property name of the given node value at the given index.
+ * @param node_val The node value to return.
+ * @param index The index of the property.
+ * @param[out] out_result The output parameter that will hold the property name at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_node_val_get_property_name_at(lbug_value* node_val, uint64_t index,
+    char** out_result);
+/**
+ * @brief Returns the property value of the given node value at the given index.
+ * @param node_val The node value to return.
+ * @param index The index of the property.
+ * @param[out] out_value The output parameter that will hold the property value at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_node_val_get_property_value_at(lbug_value* node_val, uint64_t index,
+    lbug_value* out_value);
+/**
+ * @brief Converts the given node value to string.
+ * @param node_val The node value to convert.
+ * @param[out] out_result The output parameter that will hold the node value as a string.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_node_val_to_string(lbug_value* node_val, char** out_result);
+/**
+ * @brief Returns the internal id value of the rel value as a lbug value.
+ * @param rel_val The rel value to return.
+ * @param[out] out_value The output parameter that will hold the internal id value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_rel_val_get_id_val(lbug_value* rel_val, lbug_value* out_value);
+/**
+ * @brief Returns the internal id value of the source node of the given rel value as a lbug value.
+ * @param rel_val The rel value to return.
+ * @param[out] out_value The output parameter that will hold the internal id value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_rel_val_get_src_id_val(lbug_value* rel_val, lbug_value* out_value);
+/**
+ * @brief Returns the internal id value of the destination node of the given rel value as a lbug
+ * value.
+ * @param rel_val The rel value to return.
+ * @param[out] out_value The output parameter that will hold the internal id value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_rel_val_get_dst_id_val(lbug_value* rel_val, lbug_value* out_value);
+/**
+ * @brief Returns the label value of the given rel value.
+ * @param rel_val The rel value to return.
+ * @param[out] out_value The output parameter that will hold the label value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_rel_val_get_label_val(lbug_value* rel_val, lbug_value* out_value);
+/**
+ * @brief Returns the number of properties of the given rel value.
+ * @param rel_val The rel value to return.
+ * @param[out] out_value The output parameter that will hold the number of properties.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_rel_val_get_property_size(lbug_value* rel_val, uint64_t* out_value);
+/**
+ * @brief Returns the property name of the given rel value at the given index.
+ * @param rel_val The rel value to return.
+ * @param index The index of the property.
+ * @param[out] out_result The output parameter that will hold the property name at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_rel_val_get_property_name_at(lbug_value* rel_val, uint64_t index,
+    char** out_result);
+/**
+ * @brief Returns the property of the given rel value at the given index as lbug value.
+ * @param rel_val The rel value to return.
+ * @param index The index of the property.
+ * @param[out] out_value The output parameter that will hold the property value at index.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_rel_val_get_property_value_at(lbug_value* rel_val, uint64_t index,
+    lbug_value* out_value);
+/**
+ * @brief Converts the given rel value to string.
+ * @param rel_val The rel value to convert.
+ * @param[out] out_result The output parameter that will hold the rel value as a string.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_rel_val_to_string(lbug_value* rel_val, char** out_result);
+/**
+ * @brief Destroys any string created by the Lbug C API, including both the error message and the
+ * values returned by the API functions. This function is provided to avoid the inconsistency
+ * between the memory allocation and deallocation across different libraries and is preferred over
+ * using the standard C free function.
+ * @param str The string to destroy.
+ */
+LBUG_C_API void lbug_destroy_string(char* str);
+/**
+ * @brief Destroys any blob created by the Lbug C API. This function is provided to avoid the
+ * inconsistency between the memory allocation and deallocation across different libraries and
+ * is preferred over using the standard C free function.
+ * @param blob The blob to destroy.
+ */
+LBUG_C_API void lbug_destroy_blob(uint8_t* blob);
+
+// QuerySummary
+/**
+ * @brief Destroys the given query summary.
+ * @param query_summary The query summary to destroy.
+ */
+LBUG_C_API void lbug_query_summary_destroy(lbug_query_summary* query_summary);
+/**
+ * @brief Returns the compilation time of the given query summary in milliseconds.
+ * @param query_summary The query summary to get compilation time.
+ */
+LBUG_C_API double lbug_query_summary_get_compiling_time(lbug_query_summary* query_summary);
+/**
+ * @brief Returns the execution time of the given query summary in milliseconds.
+ * @param query_summary The query summary to get execution time.
+ */
+LBUG_C_API double lbug_query_summary_get_execution_time(lbug_query_summary* query_summary);
+
+// Utility functions
+/**
+ * @brief Convert timestamp_ns to corresponding tm struct.
+ * @param timestamp The timestamp_ns value to convert.
+ * @param[out] out_result The output parameter that will hold the tm struct.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_ns_to_tm(lbug_timestamp_ns_t timestamp, struct tm* out_result);
+/**
+ * @brief Convert timestamp_ms to corresponding tm struct.
+ * @param timestamp The timestamp_ms value to convert.
+ * @param[out] out_result The output parameter that will hold the tm struct.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_ms_to_tm(lbug_timestamp_ms_t timestamp, struct tm* out_result);
+/**
+ * @brief Convert timestamp_sec to corresponding tm struct.
+ * @param timestamp The timestamp_sec value to convert.
+ * @param[out] out_result The output parameter that will hold the tm struct.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_sec_to_tm(lbug_timestamp_sec_t timestamp,
+    struct tm* out_result);
+/**
+ * @brief Convert timestamp_tz to corresponding tm struct.
+ * @param timestamp The timestamp_tz value to convert.
+ * @param[out] out_result The output parameter that will hold the tm struct.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_tz_to_tm(lbug_timestamp_tz_t timestamp, struct tm* out_result);
+/**
+ * @brief Convert timestamp to corresponding tm struct.
+ * @param timestamp The timestamp value to convert.
+ * @param[out] out_result The output parameter that will hold the tm struct.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_to_tm(lbug_timestamp_t timestamp, struct tm* out_result);
+/**
+ * @brief Convert tm struct to timestamp_ns value.
+ * @param tm The tm struct to convert.
+ * @param[out] out_result The output parameter that will hold the timestamp_ns value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_ns_from_tm(struct tm tm, lbug_timestamp_ns_t* out_result);
+/**
+ * @brief Convert tm struct to timestamp_ms value.
+ * @param tm The tm struct to convert.
+ * @param[out] out_result The output parameter that will hold the timestamp_ms value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_ms_from_tm(struct tm tm, lbug_timestamp_ms_t* out_result);
+/**
+ * @brief Convert tm struct to timestamp_sec value.
+ * @param tm The tm struct to convert.
+ * @param[out] out_result The output parameter that will hold the timestamp_sec value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_sec_from_tm(struct tm tm, lbug_timestamp_sec_t* out_result);
+/**
+ * @brief Convert tm struct to timestamp_tz value.
+ * @param tm The tm struct to convert.
+ * @param[out] out_result The output parameter that will hold the timestamp_tz value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_tz_from_tm(struct tm tm, lbug_timestamp_tz_t* out_result);
+/**
+ * @brief Convert timestamp_ns to corresponding string.
+ * @param timestamp The timestamp_ns value to convert.
+ * @param[out] out_result The output parameter that will hold the string value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_timestamp_from_tm(struct tm tm, lbug_timestamp_t* out_result);
+/**
+ * @brief Convert date to corresponding string.
+ * @param date The date value to convert.
+ * @param[out] out_result The output parameter that will hold the string value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_date_to_string(lbug_date_t date, char** out_result);
+/**
+ * @brief Convert a string to date value.
+ * @param str The string to convert.
+ * @param[out] out_result The output parameter that will hold the date value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_date_from_string(const char* str, lbug_date_t* out_result);
+/**
+ * @brief Convert date to corresponding tm struct.
+ * @param date The date value to convert.
+ * @param[out] out_result The output parameter that will hold the tm struct.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_date_to_tm(lbug_date_t date, struct tm* out_result);
+/**
+ * @brief Convert tm struct to date value.
+ * @param tm The tm struct to convert.
+ * @param[out] out_result The output parameter that will hold the date value.
+ * @return The state indicating the success or failure of the operation.
+ */
+LBUG_C_API lbug_state lbug_date_from_tm(struct tm tm, lbug_date_t* out_result);
+/**
+ * @brief Convert interval to corresponding difftime value in seconds.
+ * @param interval The interval value to convert.
+ * @param[out] out_result The output parameter that will hold the difftime value.
+ */
+LBUG_C_API void lbug_interval_to_difftime(lbug_interval_t interval, double* out_result);
+/**
+ * @brief Convert difftime value in seconds to interval.
+ * @param difftime The difftime value to convert.
+ * @param[out] out_result The output parameter that will hold the interval value.
+ */
+LBUG_C_API void lbug_interval_from_difftime(double difftime, lbug_interval_t* out_result);
+
+// Version
+/**
+ * @brief Returns the version of the Lbug library.
+ */
+LBUG_C_API char* lbug_get_version();
+
+/**
+ * @brief Returns the storage version of the Lbug library.
+ */
+LBUG_C_API uint64_t lbug_get_storage_version();
+#undef LBUG_C_API
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog.h
new file mode 100644
index 0000000000..dd29b83f6c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog.h
@@ -0,0 +1,250 @@
+#pragma once
+
+#include "catalog/catalog_entry/function_catalog_entry.h"
+#include "catalog/catalog_entry/scalar_macro_catalog_entry.h"
+#include "catalog/catalog_set.h"
+#include "common/cast.h"
+#include "function/function.h"
+
+namespace lbug::main {
+struct DBConfig;
+} // namespace lbug::main
+
+namespace lbug {
+namespace main {
+class AttachedLbugDatabase;
+} // namespace main
+
+namespace binder {
+struct BoundAlterInfo;
+struct BoundCreateTableInfo;
+struct BoundCreateSequenceInfo;
+} // namespace binder
+
+namespace common {
+class VirtualFileSystem;
+} // namespace common
+
+namespace function {
+struct ScalarMacroFunction;
+} // namespace function
+
+namespace storage {
+class WAL;
+} // namespace storage
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace catalog {
+class TableCatalogEntry;
+class NodeTableCatalogEntry;
+class RelGroupCatalogEntry;
+class FunctionCatalogEntry;
+class SequenceCatalogEntry;
+class IndexCatalogEntry;
+
+template<typename T>
+concept TableCatalogEntryType =
+    std::is_same_v<T, NodeTableCatalogEntry> || std::is_same_v<T, RelGroupCatalogEntry>;
+
+class LBUG_API Catalog {
+    friend class main::AttachedLbugDatabase;
+
+public:
+    Catalog();
+    virtual ~Catalog() = default;
+
+    static Catalog* Get(const main::ClientContext& context);
+
+    // ----------------------------- Tables ----------------------------
+
+    // Check if table entry exists.
+    bool containsTable(const transaction::Transaction* transaction, const std::string& tableName,
+        bool useInternal = true) const;
+    bool containsTable(const transaction::Transaction* transaction, common::table_id_t tableID,
+        bool useInternal = true) const;
+    // Get table entry with name.
+    TableCatalogEntry* getTableCatalogEntry(const transaction::Transaction* transaction,
+        const std::string& tableName, bool useInternal = true) const;
+    // Get table entry with id.
+    TableCatalogEntry* getTableCatalogEntry(const transaction::Transaction* transaction,
+        common::table_id_t tableID) const;
+    // Get all node table entries.
+    std::vector<NodeTableCatalogEntry*> getNodeTableEntries(
+        const transaction::Transaction* transaction, bool useInternal = true) const;
+    // Get all rel table entries.
+    std::vector<RelGroupCatalogEntry*> getRelGroupEntries(
+        const transaction::Transaction* transaction, bool useInternal = true) const;
+    // Get all table entries.
+    std::vector<TableCatalogEntry*> getTableEntries(const transaction::Transaction* transaction,
+        bool useInternal = true) const;
+
+    // Create table catalog entry.
+    CatalogEntry* createTableEntry(transaction::Transaction* transaction,
+        const binder::BoundCreateTableInfo& info);
+    // Drop table entry and all indices within the table.
+    void dropTableEntryAndIndex(transaction::Transaction* transaction, const std::string& name);
+    // Drop table entry with id.
+    void dropTableEntry(transaction::Transaction* transaction, common::table_id_t tableID);
+    // Drop table entry.
+    void dropTableEntry(transaction::Transaction* transaction, const TableCatalogEntry* entry);
+    // Alter table entry.
+    void alterTableEntry(transaction::Transaction* transaction, const binder::BoundAlterInfo& info);
+
+    // ----------------------------- Sequences ----------------------------
+
+    // Check if sequence entry exists.
+    bool containsSequence(const transaction::Transaction* transaction,
+        const std::string& name) const;
+    // Get sequence entry with name.
+    SequenceCatalogEntry* getSequenceEntry(const transaction::Transaction* transaction,
+        const std::string& sequenceName, bool useInternalSeq = true) const;
+    // Get sequence entry with id.
+    SequenceCatalogEntry* getSequenceEntry(const transaction::Transaction* transaction,
+        common::sequence_id_t sequenceID) const;
+    // Get all sequence entries.
+    std::vector<SequenceCatalogEntry*> getSequenceEntries(
+        const transaction::Transaction* transaction) const;
+
+    // Create sequence entry.
+    common::sequence_id_t createSequence(transaction::Transaction* transaction,
+        const binder::BoundCreateSequenceInfo& info);
+    // Drop sequence entry with name.
+    void dropSequence(transaction::Transaction* transaction, const std::string& name);
+    // Drop sequence entry with id.
+    void dropSequence(transaction::Transaction* transaction, common::sequence_id_t sequenceID);
+
+    // ----------------------------- Types ----------------------------
+
+    // Check if type entry exists.
+    bool containsType(const transaction::Transaction* transaction, const std::string& name) const;
+    // Get type entry with name.
+    common::LogicalType getType(const transaction::Transaction*, const std::string& name) const;
+
+    // Create type entry.
+    void createType(transaction::Transaction* transaction, std::string name,
+        common::LogicalType type);
+
+    // ----------------------------- Indexes ----------------------------
+
+    // Check if index exists for given table and name
+    bool containsIndex(const transaction::Transaction* transaction, common::table_id_t tableID,
+        const std::string& indexName) const;
+    // Check if index exists for given table and property
+    bool containsIndex(const transaction::Transaction* transaction, common::table_id_t tableID,
+        common::property_id_t propertyID) const;
+    // Check if there is any unloaded index for given table and property
+    bool containsUnloadedIndex(const transaction::Transaction* transaction,
+        common::table_id_t tableID, common::property_id_t propertyID) const;
+    // Get index entry with name.
+    IndexCatalogEntry* getIndex(const transaction::Transaction* transaction,
+        common::table_id_t tableID, const std::string& indexName) const;
+    // Get all index entries.
+    std::vector<IndexCatalogEntry*> getIndexEntries(
+        const transaction::Transaction* transaction) const;
+    // Get all index entries for given table
+    std::vector<IndexCatalogEntry*> getIndexEntries(const transaction::Transaction* transaction,
+        common::table_id_t tableID) const;
+
+    // Create index entry.
+    void createIndex(transaction::Transaction* transaction,
+        std::unique_ptr<CatalogEntry> indexCatalogEntry);
+    // Drop all index entries within a table.
+    void dropAllIndexes(transaction::Transaction* transaction, common::table_id_t tableID);
+    // Drop index entry with name.
+    void dropIndex(transaction::Transaction* transaction, common::table_id_t tableID,
+        const std::string& indexName) const;
+    void dropIndex(transaction::Transaction* transaction, common::oid_t indexOID);
+
+    // ----------------------------- Functions ----------------------------
+
+    // Check if function exists.
+    bool containsFunction(const transaction::Transaction* transaction, const std::string& name,
+        bool useInternal = false) const;
+    // Get function entry by name.
+    // Note we cannot cast to FunctionEntry here because result could also be a MacroEntry.
+    CatalogEntry* getFunctionEntry(const transaction::Transaction* transaction,
+        const std::string& name, bool useInternal = false) const;
+    // Get all function entries.
+    std::vector<FunctionCatalogEntry*> getFunctionEntries(
+        const transaction::Transaction* transaction) const;
+
+    // Get all macro entries.
+    std::vector<ScalarMacroCatalogEntry*> getMacroEntries(
+        const transaction::Transaction* transaction) const;
+
+    // Add function with name.
+    void addFunction(transaction::Transaction* transaction, CatalogEntryType entryType,
+        std::string name, function::function_set functionSet, bool isInternal = false);
+    // Drop function with name.
+    void dropFunction(transaction::Transaction* transaction, const std::string& name);
+
+    // ----------------------------- Macro ----------------------------
+
+    // Check if macro entry exists.
+    bool containsMacro(const transaction::Transaction* transaction,
+        const std::string& macroName) const;
+    void addScalarMacroFunction(transaction::Transaction* transaction, std::string name,
+        std::unique_ptr<function::ScalarMacroFunction> macro);
+    ScalarMacroCatalogEntry* getScalarMacroCatalogEntry(const transaction::Transaction* transaction,
+        lbug::common::oid_t MacroID) const;
+    void dropMacroEntry(transaction::Transaction* transaction, const lbug::common::oid_t macroID);
+    void dropMacroEntry(transaction::Transaction* transaction,
+        const ScalarMacroCatalogEntry* entry);
+    function::ScalarMacroFunction* getScalarMacroFunction(
+        const transaction::Transaction* transaction, const std::string& name) const;
+    std::vector<std::string> getMacroNames(const transaction::Transaction* transaction) const;
+    void dropMacro(transaction::Transaction* transaction, std::string& name);
+
+    void incrementVersion() { version++; }
+    uint64_t getVersion() const { return version; }
+    bool changedSinceLastCheckpoint() const { return version != 0; }
+    void resetVersion() { version = 0; }
+
+    void serialize(common::Serializer& ser) const;
+    void deserialize(common::Deserializer& deSer);
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+private:
+    void initCatalogSets();
+    void registerBuiltInFunctions();
+
+    CatalogEntry* createNodeTableEntry(transaction::Transaction* transaction,
+        const binder::BoundCreateTableInfo& info);
+    CatalogEntry* createRelGroupEntry(transaction::Transaction* transaction,
+        const binder::BoundCreateTableInfo& info);
+
+    void createSerialSequence(transaction::Transaction* transaction, const TableCatalogEntry* entry,
+        bool isInternal);
+    void dropSerialSequence(transaction::Transaction* transaction, const TableCatalogEntry* entry);
+
+    template<TableCatalogEntryType T>
+    std::vector<T*> getTableEntries(const transaction::Transaction* transaction, bool useInternal,
+        CatalogEntryType entryType) const;
+
+protected:
+    std::unique_ptr<CatalogSet> tables;
+
+private:
+    std::unique_ptr<CatalogSet> sequences;
+    std::unique_ptr<CatalogSet> functions;
+    std::unique_ptr<CatalogSet> types;
+    std::unique_ptr<CatalogSet> indexes;
+    std::unique_ptr<CatalogSet> macros;
+    std::unique_ptr<CatalogSet> internalTables;
+    std::unique_ptr<CatalogSet> internalSequences;
+    std::unique_ptr<CatalogSet> internalFunctions;
+
+    // incremented whenever a change is made to the catalog
+    // reset to 0 at the end of each checkpoint
+    uint64_t version;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/catalog_entry.h
new file mode 100644
index 0000000000..248c90373a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/catalog_entry.h
@@ -0,0 +1,114 @@
+#pragma once
+
+#include <string>
+
+#include "catalog_entry_type.h"
+#include "common/assert.h"
+#include "common/copy_constructors.h"
+#include "common/serializer/serializer.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+} // namespace main
+
+namespace catalog {
+
+struct LBUG_API ToCypherInfo {
+    virtual ~ToCypherInfo() = default;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+class LBUG_API CatalogEntry {
+public:
+    //===--------------------------------------------------------------------===//
+    // constructor & destructor
+    //===--------------------------------------------------------------------===//
+    CatalogEntry() : CatalogEntry{CatalogEntryType::DUMMY_ENTRY, ""} {}
+    CatalogEntry(CatalogEntryType type, std::string name)
+        : type{type}, name{std::move(name)}, oid{common::INVALID_OID},
+          timestamp{common::INVALID_TRANSACTION} {}
+    DELETE_COPY_DEFAULT_MOVE(CatalogEntry);
+    virtual ~CatalogEntry() = default;
+
+    //===--------------------------------------------------------------------===//
+    // getter & setter
+    //===--------------------------------------------------------------------===//
+    CatalogEntryType getType() const { return type; }
+    void rename(std::string name_) { this->name = std::move(name_); }
+    std::string getName() const { return name; }
+    common::transaction_t getTimestamp() const { return timestamp; }
+    void setTimestamp(common::transaction_t timestamp_) { this->timestamp = timestamp_; }
+    bool isDeleted() const { return deleted; }
+    void setDeleted(bool deleted_) { this->deleted = deleted_; }
+    bool hasParent() const { return hasParent_; }
+    void setHasParent(bool hasParent) { hasParent_ = hasParent; }
+    void setOID(common::oid_t oid) { this->oid = oid; }
+    common::oid_t getOID() const { return oid; }
+    CatalogEntry* getPrev() const {
+        KU_ASSERT(prev);
+        return prev.get();
+    }
+    std::unique_ptr<CatalogEntry> movePrev() {
+        if (this->prev) {
+            this->prev->setNext(nullptr);
+        }
+        return std::move(prev);
+    }
+    void setPrev(std::unique_ptr<CatalogEntry> prev_) {
+        this->prev = std::move(prev_);
+        if (this->prev) {
+            this->prev->setNext(this);
+        }
+    }
+    CatalogEntry* getNext() const { return next; }
+    void setNext(CatalogEntry* next_) { this->next = next_; }
+
+    //===--------------------------------------------------------------------===//
+    // serialization & deserialization
+    //===--------------------------------------------------------------------===//
+    virtual void serialize(common::Serializer& serializer) const;
+    static std::unique_ptr<CatalogEntry> deserialize(common::Deserializer& deserializer);
+
+    virtual std::string toCypher(const ToCypherInfo& /*info*/) const { KU_UNREACHABLE; }
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+protected:
+    virtual void copyFrom(const CatalogEntry& other);
+
+protected:
+    CatalogEntryType type;
+    std::string name;
+    common::oid_t oid;
+    common::transaction_t timestamp;
+    bool deleted = false;
+    bool hasParent_ = false;
+    // Older versions.
+    std::unique_ptr<CatalogEntry> prev;
+    // Newer versions.
+    CatalogEntry* next = nullptr;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/catalog_entry_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/catalog_entry_type.h
new file mode 100644
index 0000000000..8ad76675cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/catalog_entry_type.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+namespace lbug {
+namespace catalog {
+
+enum class CatalogEntryType : uint8_t {
+    // Table entries
+    NODE_TABLE_ENTRY = 0,
+    REL_GROUP_ENTRY = 2,
+    FOREIGN_TABLE_ENTRY = 4,
+    // Macro entries
+    SCALAR_MACRO_ENTRY = 10,
+    // Function entries
+    AGGREGATE_FUNCTION_ENTRY = 20,
+    SCALAR_FUNCTION_ENTRY = 21,
+    REWRITE_FUNCTION_ENTRY = 22,
+    TABLE_FUNCTION_ENTRY = 23,
+    COPY_FUNCTION_ENTRY = 25,
+    STANDALONE_TABLE_FUNCTION_ENTRY = 26,
+    // Sequence entries
+    SEQUENCE_ENTRY = 40,
+    // UDT entries
+    TYPE_ENTRY = 41,
+    // Index entries
+    INDEX_ENTRY = 42,
+    // Dummy entry
+    DUMMY_ENTRY = 100,
+};
+
+struct CatalogEntryTypeUtils {
+    static std::string toString(CatalogEntryType type);
+};
+
+struct FunctionEntryTypeUtils {
+    static std::string toString(CatalogEntryType type);
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/dummy_catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/dummy_catalog_entry.h
new file mode 100644
index 0000000000..3b2d1aac9d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/dummy_catalog_entry.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "catalog/catalog_entry/catalog_entry.h"
+
+namespace lbug {
+namespace catalog {
+
+class DummyCatalogEntry final : public CatalogEntry {
+public:
+    explicit DummyCatalogEntry(std::string name, common::oid_t oid)
+        : CatalogEntry{CatalogEntryType::DUMMY_ENTRY, std::move(name)} {
+        setDeleted(true);
+        setTimestamp(0);
+        setOID(oid);
+    }
+
+    void serialize(common::Serializer& /*serializer*/) const override { KU_UNREACHABLE; }
+    std::string toCypher(const ToCypherInfo& /*info*/) const override { KU_UNREACHABLE; }
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/function_catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/function_catalog_entry.h
new file mode 100644
index 0000000000..1bd5ed85ef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/function_catalog_entry.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include "catalog_entry.h"
+#include "function/function.h"
+
+namespace lbug {
+namespace catalog {
+
+class LBUG_API FunctionCatalogEntry : public CatalogEntry {
+public:
+    //===--------------------------------------------------------------------===//
+    // constructors
+    //===--------------------------------------------------------------------===//
+    FunctionCatalogEntry() = default;
+    FunctionCatalogEntry(CatalogEntryType entryType, std::string name,
+        function::function_set functionSet);
+
+    //===--------------------------------------------------------------------===//
+    // getters & setters
+    //===--------------------------------------------------------------------===//
+    const function::function_set& getFunctionSet() const { return functionSet; }
+
+    //===--------------------------------------------------------------------===//
+    // serialization & deserialization
+    //===--------------------------------------------------------------------===//
+    // We always register functions while initializing the catalog, so we don't have to
+    // serialize functions.
+    void serialize(common::Serializer& /*serializer*/) const override { KU_UNREACHABLE; }
+
+protected:
+    function::function_set functionSet;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/index_catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/index_catalog_entry.h
new file mode 100644
index 0000000000..0781680190
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/index_catalog_entry.h
@@ -0,0 +1,116 @@
+#pragma once
+
+#include "catalog_entry.h"
+#include "common/copier_config/file_scan_info.h"
+#include "common/serializer/buffer_reader.h"
+#include "common/serializer/deserializer.h"
+#include "table_catalog_entry.h"
+
+namespace lbug::common {
+struct BufferReader;
+}
+namespace lbug::common {
+class BufferWriter;
+}
+namespace lbug {
+namespace catalog {
+
+struct LBUG_API IndexToCypherInfo : ToCypherInfo {
+    const main::ClientContext* context;
+    const common::FileScanInfo& exportFileInfo;
+
+    IndexToCypherInfo(const main::ClientContext* context,
+        const common::FileScanInfo& exportFileInfo)
+        : context{context}, exportFileInfo{exportFileInfo} {}
+};
+
+class IndexCatalogEntry;
+struct LBUG_API IndexAuxInfo {
+    virtual ~IndexAuxInfo() = default;
+    virtual std::shared_ptr<common::BufferWriter> serialize() const;
+
+    virtual std::unique_ptr<IndexAuxInfo> copy() = 0;
+
+    template<typename TARGET>
+    TARGET& cast() {
+        return dynamic_cast<TARGET&>(*this);
+    }
+    template<typename TARGET>
+    const TARGET& cast() const {
+        return dynamic_cast<const TARGET&>(*this);
+    }
+
+    virtual std::string toCypher(const IndexCatalogEntry& indexEntry,
+        const ToCypherInfo& info) const = 0;
+
+    virtual TableCatalogEntry* getTableEntryToExport(const main::ClientContext* /*context*/) const {
+        return nullptr;
+    }
+};
+
+class LBUG_API IndexCatalogEntry final : public CatalogEntry {
+public:
+    static std::string getInternalIndexName(common::table_id_t tableID, std::string indexName) {
+        return common::stringFormat("{}_{}", tableID, std::move(indexName));
+    }
+
+    IndexCatalogEntry(std::string type, common::table_id_t tableID, std::string indexName,
+        std::vector<common::property_id_t> properties, std::unique_ptr<IndexAuxInfo> auxInfo)
+        : CatalogEntry{CatalogEntryType::INDEX_ENTRY,
+              common::stringFormat("{}_{}", tableID, indexName)},
+          type{std::move(type)}, tableID{tableID}, indexName{std::move(indexName)},
+          propertyIDs{std::move(properties)}, auxInfo{std::move(auxInfo)} {}
+
+    std::string getIndexType() const { return type; }
+
+    common::table_id_t getTableID() const { return tableID; }
+
+    std::string getIndexName() const { return indexName; }
+
+    std::vector<common::property_id_t> getPropertyIDs() const { return propertyIDs; }
+    bool containsPropertyID(common::property_id_t propertyID) const;
+
+    // When serializing index entries to disk, we first write the fields of the base class,
+    // followed by the size (in bytes) of the auxiliary data and its content.
+    void serialize(common::Serializer& serializer) const override;
+    // During deserialization of index entries from disk, we first read the base class
+    // (IndexCatalogEntry). The auxiliary data is stored in auxBuffer, with its size in
+    // auxBufferSize. Once the extension is loaded, the corresponding indexes are reconstructed
+    // using the auxBuffer.
+    static std::unique_ptr<IndexCatalogEntry> deserialize(common::Deserializer& deserializer);
+
+    std::string toCypher(const ToCypherInfo& info) const override {
+        return isLoaded() ? auxInfo->toCypher(*this, info) : "";
+    }
+
+    void copyFrom(const CatalogEntry& other) override;
+
+    std::unique_ptr<common::BufferReader> getAuxBufferReader() const;
+
+    void setAuxInfo(std::unique_ptr<IndexAuxInfo> auxInfo_);
+    const IndexAuxInfo& getAuxInfo() const { return *auxInfo; }
+    IndexAuxInfo& getAuxInfoUnsafe() { return *auxInfo; }
+
+    bool isLoaded() const { return auxBuffer == nullptr; }
+
+    TableCatalogEntry* getTableEntryToExport(main::ClientContext* context) const {
+        return isLoaded() ? auxInfo->getTableEntryToExport(context) : nullptr;
+    }
+
+    std::unique_ptr<IndexCatalogEntry> copy() const {
+        return std::make_unique<IndexCatalogEntry>(type, tableID, indexName, propertyIDs,
+            auxInfo->copy());
+    }
+
+protected:
+    std::string type;
+    common::table_id_t tableID = common::INVALID_TABLE_ID;
+    std::string indexName;
+    std::vector<common::property_id_t> propertyIDs;
+    std::unique_ptr<uint8_t[]> auxBuffer = nullptr;
+    std::unique_ptr<IndexAuxInfo> auxInfo;
+    uint64_t auxBufferSize = 0;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/node_table_catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/node_table_catalog_entry.h
new file mode 100644
index 0000000000..c7de5bac40
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/node_table_catalog_entry.h
@@ -0,0 +1,50 @@
+#pragma once
+
+#include "table_catalog_entry.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace catalog {
+
+class Catalog;
+class LBUG_API NodeTableCatalogEntry final : public TableCatalogEntry {
+    static constexpr CatalogEntryType entryType_ = CatalogEntryType::NODE_TABLE_ENTRY;
+
+public:
+    NodeTableCatalogEntry() = default;
+    NodeTableCatalogEntry(std::string name, std::string primaryKeyName)
+        : TableCatalogEntry{entryType_, std::move(name)},
+          primaryKeyName{std::move(primaryKeyName)} {}
+
+    bool isParent(common::table_id_t /*tableID*/) override { return false; }
+    common::TableType getTableType() const override { return common::TableType::NODE; }
+
+    std::string getPrimaryKeyName() const { return primaryKeyName; }
+    common::property_id_t getPrimaryKeyID() const {
+        return propertyCollection.getPropertyID(primaryKeyName);
+    }
+    const binder::PropertyDefinition& getPrimaryKeyDefinition() const {
+        return getProperty(primaryKeyName);
+    }
+
+    void renameProperty(const std::string& propertyName, const std::string& newName) override;
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<NodeTableCatalogEntry> deserialize(common::Deserializer& deserializer);
+
+    std::unique_ptr<TableCatalogEntry> copy() const override;
+    std::string toCypher(const ToCypherInfo& info) const override;
+
+private:
+    std::unique_ptr<binder::BoundExtraCreateCatalogEntryInfo> getBoundExtraCreateInfo(
+        transaction::Transaction* transaction) const override;
+
+private:
+    std::string primaryKeyName;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/node_table_id_pair.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/node_table_id_pair.h
new file mode 100644
index 0000000000..d006cd53f1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/node_table_id_pair.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include "common/types/types.h"
+
+namespace lbug {
+namespace catalog {
+
+struct NodeTableIDPair {
+    common::table_id_t srcTableID = common::INVALID_TABLE_ID;
+    common::table_id_t dstTableID = common::INVALID_TABLE_ID;
+
+    NodeTableIDPair() = default;
+    NodeTableIDPair(common::table_id_t srcTableID, common::table_id_t dstTableID)
+        : srcTableID{srcTableID}, dstTableID{dstTableID} {}
+
+    void serialize(common::Serializer& serializer) const;
+    static NodeTableIDPair deserialize(common::Deserializer& deser);
+};
+
+struct NodeTableIDPairHash {
+    std::size_t operator()(const NodeTableIDPair& np) const {
+        std::size_t h1 = std::hash<common::table_id_t>{}(np.srcTableID);
+        std::size_t h2 = std::hash<common::table_id_t>{}(np.dstTableID);
+        return h1 ^ (h2 << 1);
+    }
+};
+
+struct NodeTableIDPairEqual {
+    bool operator()(const NodeTableIDPair& lhs, const NodeTableIDPair& rhs) const {
+        return lhs.srcTableID == rhs.srcTableID && lhs.dstTableID == rhs.dstTableID;
+    }
+};
+
+using node_table_id_pair_set_t =
+    std::unordered_set<NodeTableIDPair, NodeTableIDPairHash, NodeTableIDPairEqual>;
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/rel_group_catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/rel_group_catalog_entry.h
new file mode 100644
index 0000000000..4349bf8884
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/rel_group_catalog_entry.h
@@ -0,0 +1,103 @@
+#pragma once
+
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/enums/extend_direction.h"
+#include "common/enums/rel_direction.h"
+#include "common/enums/rel_multiplicity.h"
+#include "node_table_id_pair.h"
+
+namespace lbug {
+namespace catalog {
+
+struct RelGroupToCypherInfo final : ToCypherInfo {
+    const main::ClientContext* context;
+
+    explicit RelGroupToCypherInfo(const main::ClientContext* context) : context{context} {}
+};
+
+struct RelTableCatalogInfo {
+    NodeTableIDPair nodePair;
+    common::oid_t oid = common::INVALID_OID;
+
+    RelTableCatalogInfo() = default;
+    RelTableCatalogInfo(NodeTableIDPair nodePair, common::oid_t oid)
+        : nodePair{nodePair}, oid{oid} {}
+
+    void serialize(common::Serializer& ser) const;
+    static RelTableCatalogInfo deserialize(common::Deserializer& deser);
+};
+
+class LBUG_API RelGroupCatalogEntry final : public TableCatalogEntry {
+    static constexpr CatalogEntryType type_ = CatalogEntryType::REL_GROUP_ENTRY;
+
+public:
+    RelGroupCatalogEntry() = default;
+    RelGroupCatalogEntry(std::string tableName, common::RelMultiplicity srcMultiplicity,
+        common::RelMultiplicity dstMultiplicity, common::ExtendDirection storageDirection,
+        std::vector<RelTableCatalogInfo> relTableInfos)
+        : TableCatalogEntry{type_, std::move(tableName)}, srcMultiplicity{srcMultiplicity},
+          dstMultiplicity{dstMultiplicity}, storageDirection{storageDirection},
+          relTableInfos{std::move(relTableInfos)} {
+        propertyCollection =
+            PropertyDefinitionCollection{1}; // Skip NBR_NODE_ID column as the first one.
+    }
+
+    bool isParent(common::table_id_t tableID) override;
+    common::TableType getTableType() const override { return common::TableType::REL; }
+
+    common::RelMultiplicity getMultiplicity(common::RelDataDirection direction) const {
+        return direction == common::RelDataDirection::FWD ? dstMultiplicity : srcMultiplicity;
+    }
+    bool isSingleMultiplicity(common::RelDataDirection direction) const {
+        return getMultiplicity(direction) == common::RelMultiplicity::ONE;
+    }
+
+    common::ExtendDirection getStorageDirection() const { return storageDirection; }
+
+    common::idx_t getNumRelTables() const { return relTableInfos.size(); }
+    const std::vector<RelTableCatalogInfo>& getRelEntryInfos() const { return relTableInfos; }
+    const RelTableCatalogInfo& getSingleRelEntryInfo() const;
+    bool hasRelEntryInfo(common::table_id_t srcTableID, common::table_id_t dstTableID) const {
+        return getRelEntryInfo(srcTableID, dstTableID) != nullptr;
+    }
+    const RelTableCatalogInfo* getRelEntryInfo(common::table_id_t srcTableID,
+        common::table_id_t dstTableID) const;
+
+    std::unordered_set<common::table_id_t> getSrcNodeTableIDSet() const;
+    std::unordered_set<common::table_id_t> getDstNodeTableIDSet() const;
+    std::unordered_set<common::table_id_t> getBoundNodeTableIDSet(
+        common::RelDataDirection direction) const {
+        return direction == common::RelDataDirection::FWD ? getSrcNodeTableIDSet() :
+                                                            getDstNodeTableIDSet();
+    }
+    std::unordered_set<common::table_id_t> getNbrNodeTableIDSet(
+        common::RelDataDirection direction) const {
+        return direction == common::RelDataDirection::FWD ? getDstNodeTableIDSet() :
+                                                            getSrcNodeTableIDSet();
+    }
+
+    std::vector<common::RelDataDirection> getRelDataDirections() const;
+
+    void addFromToConnection(common::table_id_t srcTableID, common::table_id_t dstTableID,
+        common::oid_t oid);
+    void dropFromToConnection(common::table_id_t srcTableID, common::table_id_t dstTableID);
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<RelGroupCatalogEntry> deserialize(common::Deserializer& deserializer);
+    std::string toCypher(const ToCypherInfo& info) const override;
+
+    std::unique_ptr<TableCatalogEntry> copy() const override;
+
+protected:
+    std::unique_ptr<binder::BoundExtraCreateCatalogEntryInfo> getBoundExtraCreateInfo(
+        transaction::Transaction*) const override;
+
+private:
+    common::RelMultiplicity srcMultiplicity = common::RelMultiplicity::MANY;
+    common::RelMultiplicity dstMultiplicity = common::RelMultiplicity::MANY;
+    // TODO(Guodong): Avoid using extend direction for storage direction
+    common::ExtendDirection storageDirection = common::ExtendDirection::BOTH;
+    std::vector<RelTableCatalogInfo> relTableInfos;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/scalar_macro_catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/scalar_macro_catalog_entry.h
new file mode 100644
index 0000000000..1fdd9c2c9c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/scalar_macro_catalog_entry.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include "catalog_entry.h"
+#include "function/scalar_macro_function.h"
+
+namespace lbug {
+namespace catalog {
+
+class ScalarMacroCatalogEntry final : public CatalogEntry {
+public:
+    //===--------------------------------------------------------------------===//
+    // constructors
+    //===--------------------------------------------------------------------===//
+    ScalarMacroCatalogEntry() = default;
+    ScalarMacroCatalogEntry(std::string name,
+        std::unique_ptr<function::ScalarMacroFunction> macroFunction);
+
+    //===--------------------------------------------------------------------===//
+    // getter & setter
+    //===--------------------------------------------------------------------===//
+    function::ScalarMacroFunction* getMacroFunction() const { return macroFunction.get(); }
+
+    //===--------------------------------------------------------------------===//
+    // serialization & deserialization
+    //===--------------------------------------------------------------------===//
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<ScalarMacroCatalogEntry> deserialize(common::Deserializer& deserializer);
+    std::string toCypher(const ToCypherInfo& info) const override;
+
+private:
+    std::unique_ptr<function::ScalarMacroFunction> macroFunction;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/sequence_catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/sequence_catalog_entry.h
new file mode 100644
index 0000000000..337aaeaa61
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/sequence_catalog_entry.h
@@ -0,0 +1,95 @@
+#pragma once
+
+#include <mutex>
+
+#include "binder/ddl/bound_create_sequence_info.h"
+#include "catalog_entry.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace common {
+class ValueVector;
+}
+
+namespace binder {
+struct BoundExtraCreateCatalogEntryInfo;
+struct BoundAlterInfo;
+} // namespace binder
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace catalog {
+
+struct SequenceRollbackData {
+    uint64_t usageCount;
+    int64_t currVal;
+};
+
+struct SequenceData {
+    SequenceData() = default;
+    explicit SequenceData(const binder::BoundCreateSequenceInfo& info)
+        : usageCount{0}, currVal{info.startWith}, increment{info.increment},
+          startValue{info.startWith}, minValue{info.minValue}, maxValue{info.maxValue},
+          cycle{info.cycle} {}
+
+    uint64_t usageCount;
+    int64_t currVal;
+    int64_t increment;
+    int64_t startValue;
+    int64_t minValue;
+    int64_t maxValue;
+    bool cycle;
+};
+
+class CatalogSet;
+class LBUG_API SequenceCatalogEntry final : public CatalogEntry {
+public:
+    //===--------------------------------------------------------------------===//
+    // constructors
+    //===--------------------------------------------------------------------===//
+    SequenceCatalogEntry() : sequenceData{} {}
+    explicit SequenceCatalogEntry(const binder::BoundCreateSequenceInfo& sequenceInfo)
+        : CatalogEntry{CatalogEntryType::SEQUENCE_ENTRY, sequenceInfo.sequenceName},
+          sequenceData{SequenceData(sequenceInfo)} {}
+
+    //===--------------------------------------------------------------------===//
+    // getter & setter
+    //===--------------------------------------------------------------------===//
+    SequenceData getSequenceData();
+
+    //===--------------------------------------------------------------------===//
+    // sequence functions
+    //===--------------------------------------------------------------------===//
+    int64_t currVal();
+    void nextKVal(transaction::Transaction* transaction, const uint64_t& count);
+    void nextKVal(transaction::Transaction* transaction, const uint64_t& count,
+        common::ValueVector& resultVector);
+    void rollbackVal(const uint64_t& usageCount, const int64_t& currVal);
+
+    //===--------------------------------------------------------------------===//
+    // serialization & deserialization
+    //===--------------------------------------------------------------------===//
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<SequenceCatalogEntry> deserialize(common::Deserializer& deserializer);
+
+    std::string toCypher(const ToCypherInfo& info) const override;
+
+    binder::BoundCreateSequenceInfo getBoundCreateSequenceInfo(bool isInternal) const;
+
+    static std::string getSerialName(const std::string& tableName,
+        const std::string& propertyName) {
+        return std::string(tableName).append("_").append(propertyName).append("_").append("serial");
+    }
+
+private:
+    void nextValNoLock();
+
+private:
+    std::mutex mtx;
+    SequenceData sequenceData;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/table_catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/table_catalog_entry.h
new file mode 100644
index 0000000000..797bbf39fc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/table_catalog_entry.h
@@ -0,0 +1,96 @@
+#pragma once
+
+#include <vector>
+
+#include "binder/ddl/bound_alter_info.h"
+#include "binder/ddl/bound_create_table_info.h"
+#include "catalog/catalog_entry/catalog_entry.h"
+#include "catalog/property_definition_collection.h"
+#include "common/enums/table_type.h"
+#include "common/types/types.h"
+#include "function/table/table_function.h"
+
+namespace lbug {
+namespace binder {
+struct BoundExtraCreateCatalogEntryInfo;
+} // namespace binder
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace catalog {
+
+class CatalogSet;
+class Catalog;
+class LBUG_API TableCatalogEntry : public CatalogEntry {
+public:
+    TableCatalogEntry() = default;
+    TableCatalogEntry(CatalogEntryType catalogType, std::string name)
+        : CatalogEntry{catalogType, std::move(name)} {}
+    TableCatalogEntry& operator=(const TableCatalogEntry&) = delete;
+
+    common::table_id_t getTableID() const { return oid; }
+
+    virtual std::unique_ptr<TableCatalogEntry> alter(common::transaction_t timestamp,
+        const binder::BoundAlterInfo& alterInfo, CatalogSet* tables) const;
+
+    virtual bool isParent(common::table_id_t /*tableID*/) { return false; };
+    virtual common::TableType getTableType() const = 0;
+
+    std::string getComment() const { return comment; }
+    void setComment(std::string newComment) { comment = std::move(newComment); }
+
+    virtual function::TableFunction getScanFunction() { KU_UNREACHABLE; }
+
+    common::column_id_t getMaxColumnID() const;
+    void vacuumColumnIDs(common::column_id_t nextColumnID);
+    std::vector<binder::PropertyDefinition> getProperties() const {
+        return propertyCollection.getDefinitions();
+    }
+    common::idx_t getNumProperties() const { return propertyCollection.size(); }
+    bool containsProperty(const std::string& propertyName) const;
+    common::property_id_t getPropertyID(const std::string& propertyName) const;
+    const binder::PropertyDefinition& getProperty(const std::string& propertyName) const;
+    const binder::PropertyDefinition& getProperty(common::idx_t idx) const;
+    virtual common::column_id_t getColumnID(const std::string& propertyName) const;
+    common::column_id_t getColumnID(common::idx_t idx) const;
+    void addProperty(const binder::PropertyDefinition& propertyDefinition);
+    void dropProperty(const std::string& propertyName);
+    virtual void renameProperty(const std::string& propertyName, const std::string& newName);
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<TableCatalogEntry> deserialize(common::Deserializer& deserializer,
+        CatalogEntryType type);
+    virtual std::unique_ptr<TableCatalogEntry> copy() const = 0;
+
+    binder::BoundCreateTableInfo getBoundCreateTableInfo(transaction::Transaction* transaction,
+        bool isInternal) const;
+
+protected:
+    void copyFrom(const CatalogEntry& other) override;
+    virtual std::unique_ptr<binder::BoundExtraCreateCatalogEntryInfo> getBoundExtraCreateInfo(
+        transaction::Transaction* transaction) const = 0;
+
+protected:
+    std::string comment;
+    PropertyDefinitionCollection propertyCollection;
+};
+
+struct TableCatalogEntryHasher {
+    std::size_t operator()(TableCatalogEntry* entry) const {
+        return std::hash<common::table_id_t>{}(entry->getTableID());
+    }
+};
+
+struct TableCatalogEntryEquality {
+    bool operator()(TableCatalogEntry* left, TableCatalogEntry* right) const {
+        return left->getTableID() == right->getTableID();
+    }
+};
+
+using table_catalog_entry_set_t =
+    std::unordered_set<TableCatalogEntry*, TableCatalogEntryHasher, TableCatalogEntryEquality>;
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/type_catalog_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/type_catalog_entry.h
new file mode 100644
index 0000000000..6cd347e80d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_entry/type_catalog_entry.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "catalog_entry.h"
+
+namespace lbug {
+namespace catalog {
+
+class TypeCatalogEntry : public CatalogEntry {
+public:
+    //===--------------------------------------------------------------------===//
+    // constructors
+    //===--------------------------------------------------------------------===//
+    TypeCatalogEntry() = default;
+    TypeCatalogEntry(std::string name, common::LogicalType type)
+        : CatalogEntry{CatalogEntryType::TYPE_ENTRY, std::move(name)}, type{std::move(type)} {}
+
+    //===--------------------------------------------------------------------===//
+    // getter & setter
+    //===--------------------------------------------------------------------===//
+    const common::LogicalType& getLogicalType() const { return type; }
+
+    //===--------------------------------------------------------------------===//
+    // serialization & deserialization
+    //===--------------------------------------------------------------------===//
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<TypeCatalogEntry> deserialize(common::Deserializer& deserializer);
+
+private:
+    common::LogicalType type;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_set.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_set.h
new file mode 100644
index 0000000000..431d4664f0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/catalog_set.h
@@ -0,0 +1,92 @@
+#pragma once
+
+#include <mutex>
+#include <shared_mutex>
+
+#include "catalog_entry/catalog_entry.h"
+#include "common/case_insensitive_map.h"
+
+namespace lbug {
+namespace binder {
+struct BoundAlterInfo;
+} // namespace binder
+
+namespace storage {
+class UndoBuffer;
+} // namespace storage
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+using CatalogEntrySet = common::case_insensitive_map_t<catalog::CatalogEntry*>;
+
+namespace catalog {
+class LBUG_API CatalogSet {
+    friend class storage::UndoBuffer;
+
+public:
+    CatalogSet() = default;
+    explicit CatalogSet(bool isInternal);
+    bool containsEntry(const transaction::Transaction* transaction, const std::string& name);
+    CatalogEntry* getEntry(const transaction::Transaction* transaction, const std::string& name);
+    common::oid_t createEntry(transaction::Transaction* transaction,
+        std::unique_ptr<CatalogEntry> entry);
+    void dropEntry(transaction::Transaction* transaction, const std::string& name,
+        common::oid_t oid);
+
+    void alterTableEntry(transaction::Transaction* transaction,
+        const binder::BoundAlterInfo& alterInfo);
+
+    CatalogEntrySet getEntries(const transaction::Transaction* transaction);
+    CatalogEntry* getEntryOfOID(const transaction::Transaction* transaction, common::oid_t oid);
+
+    void serialize(common::Serializer serializer) const;
+    static std::unique_ptr<CatalogSet> deserialize(common::Deserializer& deserializer);
+
+    common::oid_t getNextOID() {
+        std::unique_lock lck{mtx};
+        return nextOID++;
+    }
+
+    common::oid_t getNextOIDNoLock() { return nextOID++; }
+
+private:
+    bool containsEntryNoLock(const transaction::Transaction* transaction,
+        const std::string& name) const;
+    CatalogEntry* getEntryNoLock(const transaction::Transaction* transaction,
+        const std::string& name) const;
+    CatalogEntry* createEntryNoLock(const transaction::Transaction* transaction,
+        std::unique_ptr<CatalogEntry> entry);
+    CatalogEntry* dropEntryNoLock(const transaction::Transaction* transaction,
+        const std::string& name, common::oid_t oid);
+
+    void validateExistNoLock(const transaction::Transaction* transaction,
+        const std::string& name) const;
+    void validateNotExistNoLock(const transaction::Transaction* transaction,
+        const std::string& name) const;
+
+    void emplaceNoLock(std::unique_ptr<CatalogEntry> entry);
+    void eraseNoLock(const std::string& name);
+
+    static std::unique_ptr<CatalogEntry> createDummyEntryNoLock(std::string name,
+        common::oid_t oid);
+
+    static CatalogEntry* traverseVersionChainsForTransactionNoLock(
+        const transaction::Transaction* transaction, CatalogEntry* currentEntry);
+    static CatalogEntry* getCommittedEntryNoLock(CatalogEntry* entry);
+    bool isInternal() const { return nextOID >= INTERNAL_CATALOG_SET_START_OID; }
+
+public:
+    // To ensure the uniqueness of the OID and avoid conflict with user tables/sequence, we make the
+    // start OID of the internal catalog set to be 2^63.
+    static constexpr common::oid_t INTERNAL_CATALOG_SET_START_OID = 1LL << 63;
+
+private:
+    std::shared_mutex mtx;
+    common::oid_t nextOID = 0;
+    common::case_insensitive_map_t<std::unique_ptr<CatalogEntry>> entries;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/property_definition_collection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/property_definition_collection.h
new file mode 100644
index 0000000000..d2f836659f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/catalog/property_definition_collection.h
@@ -0,0 +1,53 @@
+#pragma once
+
+#include "binder/ddl/property_definition.h"
+#include "common/case_insensitive_map.h"
+
+namespace lbug {
+namespace catalog {
+
+class LBUG_API PropertyDefinitionCollection {
+public:
+    PropertyDefinitionCollection() : nextColumnID{0}, nextPropertyID{0} {}
+    explicit PropertyDefinitionCollection(common::column_id_t nextColumnID)
+        : nextColumnID{nextColumnID}, nextPropertyID{0} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(PropertyDefinitionCollection);
+
+    common::idx_t size() const { return definitions.size(); }
+
+    bool contains(const std::string& name) const { return nameToPropertyIDMap.contains(name); }
+
+    std::vector<binder::PropertyDefinition> getDefinitions() const;
+    const binder::PropertyDefinition& getDefinition(const std::string& name) const;
+    const binder::PropertyDefinition& getDefinition(common::idx_t idx) const;
+    common::column_id_t getMaxColumnID() const;
+    common::column_id_t getColumnID(const std::string& name) const;
+    common::column_id_t getColumnID(common::property_id_t propertyID) const;
+    common::property_id_t getPropertyID(const std::string& name) const;
+    void vacuumColumnIDs(common::column_id_t nextColumnID);
+
+    void add(const binder::PropertyDefinition& definition);
+    void drop(const std::string& name);
+    void rename(const std::string& name, const std::string& newName);
+
+    std::string toCypher() const;
+
+    void serialize(common::Serializer& serializer) const;
+    static PropertyDefinitionCollection deserialize(common::Deserializer& deserializer);
+
+private:
+    PropertyDefinitionCollection(const PropertyDefinitionCollection& other)
+        : nextColumnID{other.nextColumnID}, nextPropertyID{other.nextPropertyID},
+          definitions{copyMap(other.definitions)}, columnIDs{other.columnIDs},
+          nameToPropertyIDMap{other.nameToPropertyIDMap} {}
+
+private:
+    common::column_id_t nextColumnID;
+    common::property_id_t nextPropertyID;
+    std::map<common::property_id_t, binder::PropertyDefinition> definitions;
+    std::unordered_map<common::property_id_t, common::column_id_t> columnIDs;
+    common::case_insensitive_map_t<common::property_id_t> nameToPropertyIDMap;
+};
+
+} // namespace catalog
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/api.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/api.h
new file mode 100644
index 0000000000..1ad3e3d3a7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/api.h
@@ -0,0 +1,36 @@
+#pragma once
+
+// Helpers
+#if defined _WIN32 || defined __CYGWIN__
+#define LBUG_HELPER_DLL_IMPORT __declspec(dllimport)
+#define LBUG_HELPER_DLL_EXPORT __declspec(dllexport)
+#define LBUG_HELPER_DLL_LOCAL
+#define LBUG_HELPER_DEPRECATED __declspec(deprecated)
+#else
+#define LBUG_HELPER_DLL_IMPORT __attribute__((visibility("default")))
+#define LBUG_HELPER_DLL_EXPORT __attribute__((visibility("default")))
+#define LBUG_HELPER_DLL_LOCAL __attribute__((visibility("hidden")))
+#define LBUG_HELPER_DEPRECATED __attribute__((__deprecated__))
+#endif
+
+#ifdef LBUG_STATIC_DEFINE
+#define LBUG_API
+#else
+#ifndef LBUG_API
+#ifdef LBUG_EXPORTS
+/* We are building this library */
+#define LBUG_API LBUG_HELPER_DLL_EXPORT
+#else
+/* We are using this library */
+#define LBUG_API LBUG_HELPER_DLL_IMPORT
+#endif
+#endif
+#endif
+
+#ifndef LBUG_DEPRECATED
+#define LBUG_DEPRECATED LBUG_HELPER_DEPRECATED
+#endif
+
+#ifndef LBUG_DEPRECATED_EXPORT
+#define LBUG_DEPRECATED_EXPORT LBUG_API LBUG_DEPRECATED
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/array_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/array_utils.h
new file mode 100644
index 0000000000..c2c3498f45
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/array_utils.h
@@ -0,0 +1,16 @@
+#pragma once
+
+#include <algorithm>
+#include <array>
+#include <cstddef>
+
+namespace lbug::common {
+template<typename T, size_t N1, size_t N2>
+constexpr std::array<T, N1 + N2> arrayConcat(const std::array<T, N1>& arr1,
+    const std::array<T, N2>& arr2) {
+    std::array<T, N1 + N2> ret{};
+    std::copy_n(arr1.cbegin(), arr1.size(), ret.begin());
+    std::copy_n(arr2.cbegin(), arr2.size(), ret.begin() + arr1.size());
+    return ret;
+}
+} // namespace lbug::common
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow.h
new file mode 100644
index 0000000000..40d9917628
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow.h
@@ -0,0 +1,74 @@
+#pragma once
+
+// The Arrow C data interface.
+// https://arrow.apache.org/docs/format/CDataInterface.html
+
+#include <stdint.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#ifndef ARROW_C_DATA_INTERFACE
+#define ARROW_C_DATA_INTERFACE
+
+#define ARROW_FLAG_DICTIONARY_ORDERED 1
+#define ARROW_FLAG_NULLABLE 2
+#define ARROW_FLAG_MAP_KEYS_SORTED 4
+
+struct ArrowSchema {
+    // Array type description
+    const char* format;
+    const char* name;
+    const char* metadata;
+    int64_t flags;
+    int64_t n_children;
+    struct ArrowSchema** children;
+    struct ArrowSchema* dictionary;
+
+    // Release callback
+    void (*release)(struct ArrowSchema*);
+    // Opaque producer-specific data
+    void* private_data;
+};
+
+struct ArrowArray {
+    // Array data description
+    int64_t length;
+    int64_t null_count;
+    int64_t offset;
+    int64_t n_buffers;
+    int64_t n_children;
+    const void** buffers;
+    struct ArrowArray** children;
+    struct ArrowArray* dictionary;
+
+    // Release callback
+    void (*release)(struct ArrowArray*);
+    // Opaque producer-specific data
+    void* private_data;
+};
+
+#endif // ARROW_C_DATA_INTERFACE
+
+#ifdef __cplusplus
+}
+#endif
+
+struct ArrowSchemaWrapper : public ArrowSchema {
+    ArrowSchemaWrapper() : ArrowSchema{} { release = nullptr; }
+    ~ArrowSchemaWrapper() {
+        if (release) {
+            release(this);
+        }
+    }
+};
+
+struct ArrowArrayWrapper : public ArrowArray {
+    ArrowArrayWrapper() : ArrowArray{} { release = nullptr; }
+    ~ArrowArrayWrapper() {
+        if (release) {
+            release(this);
+        }
+    }
+};
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_buffer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_buffer.h
new file mode 100644
index 0000000000..9a3ac8300f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_buffer.h
@@ -0,0 +1,83 @@
+#pragma once
+
+#include "common/utils.h"
+
+struct ArrowSchema;
+
+namespace lbug {
+namespace common {
+
+struct ArrowBuffer {
+    ArrowBuffer() : dataptr(nullptr), count(0), capacity(0) {}
+    ~ArrowBuffer() {
+        if (!dataptr) {
+            return;
+        }
+        free(dataptr);
+        dataptr = nullptr;
+        count = 0;
+        capacity = 0;
+    }
+    // disable copy constructors
+    ArrowBuffer(const ArrowBuffer& other) = delete;
+    ArrowBuffer& operator=(const ArrowBuffer&) = delete;
+    //! enable move constructors
+    ArrowBuffer(ArrowBuffer&& other) noexcept {
+        std::swap(dataptr, other.dataptr);
+        std::swap(count, other.count);
+        std::swap(capacity, other.capacity);
+    }
+    ArrowBuffer& operator=(ArrowBuffer&& other) noexcept {
+        std::swap(dataptr, other.dataptr);
+        std::swap(count, other.count);
+        std::swap(capacity, other.capacity);
+        return *this;
+    }
+
+    void reserve(uint64_t bytes) { // NOLINT
+        auto new_capacity = nextPowerOfTwo(bytes);
+        if (new_capacity <= capacity) {
+            return;
+        }
+        reserveInternal(new_capacity);
+    }
+
+    void resize(uint64_t bytes) { // NOLINT
+        reserve(bytes);
+        count = bytes;
+    }
+
+    void resize(uint64_t bytes, uint8_t value) { // NOLINT
+        reserve(bytes);
+        for (uint64_t i = count; i < bytes; i++) {
+            dataptr[i] = value;
+        }
+        count = bytes;
+    }
+
+    uint64_t size() { // NOLINT
+        return count;
+    }
+
+    uint8_t* data() { // NOLINT
+        return dataptr;
+    }
+
+private:
+    void reserveInternal(uint64_t bytes) {
+        if (dataptr) {
+            dataptr = (uint8_t*)realloc(dataptr, bytes);
+        } else {
+            dataptr = (uint8_t*)malloc(bytes);
+        }
+        capacity = bytes;
+    }
+
+private:
+    uint8_t* dataptr = nullptr;
+    uint64_t count = 0;
+    uint64_t capacity = 0;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_converter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_converter.h
new file mode 100644
index 0000000000..f35e638a67
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_converter.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include <string>
+#include <vector>
+
+#include "common/arrow/arrow.h"
+#include "common/arrow/arrow_nullmask_tree.h"
+
+struct ArrowSchema;
+
+namespace lbug {
+namespace common {
+
+struct ArrowSchemaHolder {
+    std::vector<ArrowSchema> children;
+    std::vector<ArrowSchema*> childrenPtrs;
+    std::vector<std::vector<ArrowSchema>> nestedChildren;
+    std::vector<std::vector<ArrowSchema*>> nestedChildrenPtr;
+    std::vector<std::unique_ptr<char[]>> ownedTypeNames;
+    std::vector<std::unique_ptr<char[]>> ownedMetadatas;
+};
+
+class ArrowConverter {
+public:
+    static std::unique_ptr<ArrowSchema> toArrowSchema(const std::vector<LogicalType>& dataTypes,
+        const std::vector<std::string>& columnNames, bool fallbackExtensionTypes);
+
+    static LogicalType fromArrowSchema(const ArrowSchema* schema);
+    static void fromArrowArray(const ArrowSchema* schema, const ArrowArray* array,
+        ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
+        uint64_t count);
+    static void fromArrowArray(const ArrowSchema* schema, const ArrowArray* array,
+        ValueVector& outputVector);
+
+private:
+    static void initializeChild(ArrowSchema& child, const std::string& name = "");
+    static void setArrowFormatForStruct(ArrowSchemaHolder& rootHolder, ArrowSchema& child,
+        const LogicalType& dataType, bool fallbackExtensionTypes);
+    static void setArrowFormatForUnion(ArrowSchemaHolder& rootHolder, ArrowSchema& child,
+        const LogicalType& dataType, bool fallbackExtensionTypes);
+    static void setArrowFormatForInternalID(ArrowSchemaHolder& rootHolder, ArrowSchema& child,
+        const LogicalType& dataType, bool fallbackExtensionTypes);
+    static void setArrowFormat(ArrowSchemaHolder& rootHolder, ArrowSchema& child,
+        const LogicalType& dataType, bool fallbackExtensionTypes);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_nullmask_tree.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_nullmask_tree.h
new file mode 100644
index 0000000000..85f0ade76b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_nullmask_tree.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include "common/arrow/arrow.h"
+#include "common/null_mask.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace common {
+
+class ArrowNullMaskTree {
+public:
+    ArrowNullMaskTree(const ArrowSchema* schema, const ArrowArray* array, uint64_t srcOffset,
+        uint64_t count, const NullMask* parentMask = nullptr);
+
+    void copyToValueVector(ValueVector* vec, uint64_t dstOffset, uint64_t count);
+    bool isNull(int64_t idx) { return mask->isNull(idx + offset); }
+    ArrowNullMaskTree* getChild(int idx) { return &(*children)[idx]; }
+    ArrowNullMaskTree* getDictionary() { return dictionary.get(); }
+    ArrowNullMaskTree offsetBy(int64_t offset);
+
+private:
+    bool copyFromBuffer(const void* buffer, uint64_t srcOffset, uint64_t count);
+    bool applyParentBitmap(const NullMask* buffer);
+
+    template<typename offsetsT>
+    void scanListPushDown(const ArrowSchema* schema, const ArrowArray* array, uint64_t srcOffset,
+        uint64_t count);
+
+    void scanArrayPushDown(const ArrowSchema* schema, const ArrowArray* array, uint64_t srcOffset,
+        uint64_t count);
+
+    void scanStructPushDown(const ArrowSchema* schema, const ArrowArray* array, uint64_t srcOffset,
+        uint64_t count);
+
+    int64_t offset;
+    std::shared_ptr<NullMask> mask;
+    std::shared_ptr<std::vector<ArrowNullMaskTree>> children;
+    std::shared_ptr<ArrowNullMaskTree> dictionary;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_result_config.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_result_config.h
new file mode 100644
index 0000000000..b101ec6eae
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_result_config.h
@@ -0,0 +1,19 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+struct ArrowResultConfig {
+    int64_t chunkSize;
+
+    ArrowResultConfig() : chunkSize(DEFAULT_CHUNK_SIZE) {}
+    explicit ArrowResultConfig(int64_t chunkSize) : chunkSize(chunkSize) {}
+
+private:
+    static constexpr int64_t DEFAULT_CHUNK_SIZE = 1000;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_row_batch.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_row_batch.h
new file mode 100644
index 0000000000..195232bec0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/arrow/arrow_row_batch.h
@@ -0,0 +1,90 @@
+#pragma once
+
+#include <array>
+#include <vector>
+
+#include "common/arrow/arrow.h"
+#include "common/arrow/arrow_buffer.h"
+#include "common/types/types.h"
+
+struct ArrowSchema;
+
+namespace lbug {
+namespace processor {
+class FlatTuple;
+}
+
+namespace common {
+class Value;
+
+// An Arrow Vector(i.e., Array) is defined by a few pieces of metadata and data:
+//  1) a logical data type;
+//  2) a sequence of buffers: validity bitmaps, data buffer, overflow(optional), children(optional).
+//  3) a length as a 64-bit signed integer;
+//  4) a null count as a 64-bit signed integer;
+//  5) an optional dictionary for dictionary-encoded arrays.
+// See https://arrow.apache.org/docs/format/Columnar.html for more details.
+
+static inline uint64_t getNumBytesForBits(uint64_t numBits) {
+    return (numBits + 7) / 8;
+}
+
+struct ArrowVector {
+    ArrowBuffer data;
+    ArrowBuffer validity;
+    ArrowBuffer overflow;
+
+    int64_t numValues = 0;
+    int64_t capacity = 0;
+    int64_t numNulls = 0;
+
+    std::vector<std::unique_ptr<ArrowVector>> childData;
+
+    // The arrow array C API data, only set after Finalize
+    std::unique_ptr<ArrowArray> array;
+    std::array<const void*, 3> buffers = {{nullptr, nullptr, nullptr}};
+    std::vector<ArrowArray*> childPointers;
+};
+
+// An arrow data chunk consisting of N rows in columnar format.
+class ArrowRowBatch {
+public:
+    ArrowRowBatch(const std::vector<LogicalType>& types, std::int64_t capacity,
+        bool fallbackExtensionTypes);
+
+    void append(const processor::FlatTuple& tuple);
+    std::int64_t size() const { return numTuples; }
+    ArrowArray toArray(const std::vector<LogicalType>& types);
+
+private:
+    static void appendValue(ArrowVector* vector, const Value& value, bool fallbackExtensionTypes);
+
+    static ArrowArray* convertVectorToArray(ArrowVector& vector, const LogicalType& type,
+        bool fallbackExtensionTypes);
+    static ArrowArray* convertStructVectorToArray(ArrowVector& vector, const LogicalType& type,
+        bool fallbackExtensionTypes);
+    static ArrowArray* convertInternalIDVectorToArray(ArrowVector& vector, const LogicalType& type,
+        bool fallbackExtensionTypes);
+
+    static void copyNonNullValue(ArrowVector* vector, const Value& value, std::int64_t pos,
+        bool fallbackExtensionTypes);
+    static void copyNullValue(ArrowVector* vector, const Value& value, std::int64_t pos);
+
+    template<LogicalTypeID DT>
+    static void templateCopyNonNullValue(ArrowVector* vector, const Value& value, std::int64_t pos,
+        bool fallbackExtensionTypes);
+    template<LogicalTypeID DT>
+    static void templateCopyNullValue(ArrowVector* vector, std::int64_t pos);
+    static void copyNullValueUnion(ArrowVector* vector, const Value& value, std::int64_t pos);
+    template<LogicalTypeID DT>
+    static ArrowArray* templateCreateArray(ArrowVector& vector, const LogicalType& type,
+        bool fallbackExtensionTypes);
+
+private:
+    std::vector<std::unique_ptr<ArrowVector>> vectors;
+    std::int64_t numTuples;
+    bool fallbackExtensionTypes = false;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/assert.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/assert.h
new file mode 100644
index 0000000000..4cf26fd8a1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/assert.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include "common/exception/internal.h"
+#include "common/string_format.h"
+
+namespace lbug {
+namespace common {
+
+[[noreturn]] inline void kuAssertFailureInternal(const char* condition_name, const char* file,
+    int linenr) {
+    // LCOV_EXCL_START
+    throw InternalException(stringFormat("Assertion failed in file \"{}\" on line {}: {}", file,
+        linenr, condition_name));
+    // LCOV_EXCL_STOP
+}
+
+#define KU_ASSERT_UNCONDITIONAL(condition)                                                         \
+    static_cast<bool>(condition) ?                                                                 \
+        void(0) :                                                                                  \
+        lbug::common::kuAssertFailureInternal(#condition, __FILE__, __LINE__)
+
+#if defined(LBUG_RUNTIME_CHECKS) || !defined(NDEBUG)
+#define RUNTIME_CHECK(code) code
+#define KU_ASSERT(condition) KU_ASSERT_UNCONDITIONAL(condition)
+#else
+#define KU_ASSERT(condition) void(0)
+#define RUNTIME_CHECK(code) void(0)
+#endif
+
+#define KU_UNREACHABLE                                                                             \
+    /* LCOV_EXCL_START */ [[unlikely]] lbug::common::kuAssertFailureInternal("KU_UNREACHABLE",     \
+        __FILE__, __LINE__) /* LCOV_EXCL_STOP */
+#define KU_UNUSED(expr) (void)(expr)
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/case_insensitive_map.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/case_insensitive_map.h
new file mode 100644
index 0000000000..6406fc2cc8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/case_insensitive_map.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+#include <unordered_map>
+#include <unordered_set>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+struct CaseInsensitiveStringHashFunction {
+    LBUG_API uint64_t operator()(const std::string& str) const;
+};
+
+struct CaseInsensitiveStringEquality {
+    LBUG_API bool operator()(const std::string& lhs, const std::string& rhs) const;
+};
+
+template<typename T>
+using case_insensitive_map_t = std::unordered_map<std::string, T, CaseInsensitiveStringHashFunction,
+    CaseInsensitiveStringEquality>;
+
+using case_insensitve_set_t = std::unordered_set<std::string, CaseInsensitiveStringHashFunction,
+    CaseInsensitiveStringEquality>;
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/cast.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/cast.h
new file mode 100644
index 0000000000..b92a991f2a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/cast.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include <typeinfo>
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace common {
+
+template<typename TO, typename FROM>
+TO ku_dynamic_cast(FROM* old) {
+#if defined(LBUG_RUNTIME_CHECKS) || !defined(NDEBUG)
+    static_assert(std::is_pointer<TO>());
+    TO newVal = dynamic_cast<TO>(old);
+    KU_ASSERT(newVal != nullptr);
+    return newVal;
+#else
+    return reinterpret_cast<TO>(old);
+#endif
+}
+
+template<typename TO, typename FROM>
+TO ku_dynamic_cast(FROM& old) {
+#if defined(LBUG_RUNTIME_CHECKS) || !defined(NDEBUG)
+    static_assert(std::is_reference<TO>());
+    try {
+        TO newVal = dynamic_cast<TO>(old);
+        return newVal;
+    } catch (std::bad_cast& e) {
+        KU_ASSERT(false);
+    }
+#else
+    return reinterpret_cast<TO>(old);
+#endif
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/checksum.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/checksum.h
new file mode 100644
index 0000000000..bd59326f17
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/checksum.h
@@ -0,0 +1,10 @@
+#pragma once
+
+#include <cstddef>
+#include <cstdint>
+namespace lbug::common {
+
+//! Compute a checksum over a buffer of size size
+uint64_t checksum(uint8_t* buffer, size_t size);
+
+} // namespace lbug::common
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/concurrent_vector.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/concurrent_vector.h
new file mode 100644
index 0000000000..e61dd6f08b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/concurrent_vector.h
@@ -0,0 +1,108 @@
+#pragma once
+
+#include <array>
+#include <cstdint>
+#include <memory>
+#include <vector>
+
+#include "common/assert.h"
+#include "common/system_config.h"
+
+namespace lbug {
+namespace common {
+
+template<typename T, uint64_t BLOCK_SIZE = DEFAULT_VECTOR_CAPACITY,
+    uint64_t INDEX_SIZE = BLOCK_SIZE>
+// Vector which doesn't move when resizing
+// The initial size is fixed, and new elements are added in fixed sized blocks which are indexed and
+// the indices are chained in a linked list. Currently only one thread can write concurrently, but
+// any number of threads can read, even when the vector is being written to.
+//
+// Accessing elements which existed when the vector was created is as fast as possible, requiring
+// just one comparison and one pointer reads, and accessing new elements is still reasonably fast,
+// usually requiring reading just two pointers, with a small amount of arithmetic, or maybe more if
+// an extremely large number of elements has been added
+// (access cost increases every BLOCK_SIZE * INDEX_SIZE elements).
+class ConcurrentVector {
+public:
+    explicit ConcurrentVector(uint64_t initialNumElements, uint64_t initialBlockSize)
+        : numElements{initialNumElements}, initialBlock{std::make_unique<T[]>(initialBlockSize)},
+          initialBlockSize{initialBlockSize}, firstIndex{nullptr} {}
+    // resize never deallocates memory
+    // Not thread-safe
+    // It could be made to be thread-safe by storing the size atomically and doing compare and swap
+    // when adding new indices and blocks
+    void resize(uint64_t newSize) {
+        while (newSize > initialBlockSize + blocks.size() * BLOCK_SIZE) {
+            auto newBlock = std::make_unique<Block>();
+            if (indices.empty()) {
+                auto index = std::make_unique<BlockIndex>();
+                index->blocks[0] = newBlock.get();
+                index->numBlocks = 1;
+                firstIndex = index.get();
+                indices.push_back(std::move(index));
+            } else if (indices.back()->numBlocks < INDEX_SIZE) {
+                auto& index = indices.back();
+                index->blocks[index->numBlocks] = newBlock.get();
+                index->numBlocks++;
+            } else {
+                KU_ASSERT(indices.back()->numBlocks == INDEX_SIZE);
+                auto index = std::make_unique<BlockIndex>();
+                index->blocks[0] = newBlock.get();
+                index->numBlocks = 1;
+                indices.back()->nextIndex = index.get();
+                indices.push_back(std::move(index));
+            }
+            blocks.push_back(std::move(newBlock));
+        }
+        numElements = newSize;
+    }
+
+    void push_back(T&& value) {
+        auto index = numElements;
+        resize(numElements + 1);
+        (*this)[index] = std::move(value);
+    }
+
+    T& operator[](uint64_t elemPos) {
+        if (elemPos < initialBlockSize) {
+            KU_ASSERT(initialBlock);
+            return initialBlock[elemPos];
+        } else {
+            auto blockNum = (elemPos - initialBlockSize) / BLOCK_SIZE;
+            auto posInBlock = (elemPos - initialBlockSize) % BLOCK_SIZE;
+            auto indexNum = blockNum / INDEX_SIZE;
+            BlockIndex* index = firstIndex;
+            KU_ASSERT(index != nullptr);
+            while (indexNum > 0) {
+                KU_ASSERT(index->nextIndex != nullptr);
+                index = index->nextIndex;
+                indexNum--;
+            }
+            KU_ASSERT(index->blocks[blockNum % INDEX_SIZE] != nullptr);
+            return index->blocks[blockNum % INDEX_SIZE]->data[posInBlock];
+        }
+    }
+
+    uint64_t size() { return numElements; }
+
+private:
+    uint64_t numElements;
+    std::unique_ptr<T[]> initialBlock;
+    uint64_t initialBlockSize;
+    struct Block {
+        std::array<T, BLOCK_SIZE> data;
+    };
+    struct BlockIndex {
+        BlockIndex() : nextIndex{nullptr}, blocks{}, numBlocks{0} {}
+        BlockIndex* nextIndex;
+        std::array<Block*, INDEX_SIZE> blocks;
+        uint64_t numBlocks;
+    };
+    BlockIndex* firstIndex;
+    std::vector<std::unique_ptr<Block>> blocks;
+    std::vector<std::unique_ptr<BlockIndex>> indices;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/constants.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/constants.h
new file mode 100644
index 0000000000..d9b3d58757
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/constants.h
@@ -0,0 +1,223 @@
+#pragma once
+
+#include <array>
+#include <cstdint>
+#include <string_view>
+
+#include "common/array_utils.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace common {
+
+extern const char* LBUG_VERSION;
+
+constexpr double DEFAULT_HT_LOAD_FACTOR = 1.5;
+
+// This is the default thread sleep time we use when a thread,
+// e.g., a worker thread is in TaskScheduler, needs to block.
+constexpr uint64_t THREAD_SLEEP_TIME_WHEN_WAITING_IN_MICROS = 500;
+
+constexpr uint64_t DEFAULT_CHECKPOINT_WAIT_TIMEOUT_IN_MICROS = 5000000;
+
+// Note that some places use std::bit_ceil to calculate resizes,
+// which won't work for values other than 2. If this is changed, those will need to be updated
+constexpr uint64_t CHUNK_RESIZE_RATIO = 2;
+
+struct InternalKeyword {
+    static constexpr char ANONYMOUS[] = "";
+    static constexpr char ID[] = "_ID";
+    static constexpr char LABEL[] = "_LABEL";
+    static constexpr char SRC[] = "_SRC";
+    static constexpr char DST[] = "_DST";
+    static constexpr char DIRECTION[] = "_DIRECTION";
+    static constexpr char LENGTH[] = "_LENGTH";
+    static constexpr char NODES[] = "_NODES";
+    static constexpr char RELS[] = "_RELS";
+    static constexpr char STAR[] = "*";
+    static constexpr char PLACE_HOLDER[] = "_PLACE_HOLDER";
+    static constexpr char MAP_KEY[] = "KEY";
+    static constexpr char MAP_VALUE[] = "VALUE";
+
+    static constexpr std::string_view ROW_OFFSET = "_row_offset";
+    static constexpr std::string_view SRC_OFFSET = "_src_offset";
+    static constexpr std::string_view DST_OFFSET = "_dst_offset";
+};
+
+enum PageSizeClass : uint8_t {
+    REGULAR_PAGE = 0,
+    TEMP_PAGE = 1,
+};
+
+struct BufferPoolConstants {
+    // If a user does not specify a max size for BM, we by default set the max size of BM to
+    // maxPhyMemSize * DEFAULT_PHY_MEM_SIZE_RATIO_FOR_BM.
+    static constexpr double DEFAULT_PHY_MEM_SIZE_RATIO_FOR_BM = 0.8;
+// The default max size for a VMRegion.
+#ifdef __32BIT__
+    static constexpr uint64_t DEFAULT_VM_REGION_MAX_SIZE = (uint64_t)1 << 30; // (1GB)
+#elif defined(__ANDROID__)
+    static constexpr uint64_t DEFAULT_VM_REGION_MAX_SIZE = (uint64_t)1 << 38; // (256GB)
+#else
+    static constexpr uint64_t DEFAULT_VM_REGION_MAX_SIZE = static_cast<uint64_t>(1) << 43; // (8TB)
+#endif
+};
+
+struct StorageConstants {
+    static constexpr page_idx_t DB_HEADER_PAGE_IDX = 0;
+    static constexpr char WAL_FILE_SUFFIX[] = "wal";
+    static constexpr char SHADOWING_SUFFIX[] = "shadow";
+    static constexpr char TEMP_FILE_SUFFIX[] = "tmp";
+
+    // The number of pages that we add at one time when we need to grow a file.
+    static constexpr uint64_t PAGE_GROUP_SIZE_LOG2 = 10;
+    static constexpr uint64_t PAGE_GROUP_SIZE = static_cast<uint64_t>(1) << PAGE_GROUP_SIZE_LOG2;
+    static constexpr uint64_t PAGE_IDX_IN_GROUP_MASK =
+        (static_cast<uint64_t>(1) << PAGE_GROUP_SIZE_LOG2) - 1;
+
+    static constexpr double PACKED_CSR_DENSITY = 0.8;
+    static constexpr double LEAF_HIGH_CSR_DENSITY = 1.0;
+
+    static constexpr uint64_t MAX_NUM_ROWS_IN_TABLE = static_cast<uint64_t>(1) << 62;
+};
+
+struct TableOptionConstants {
+    static constexpr char REL_STORAGE_DIRECTION_OPTION[] = "STORAGE_DIRECTION";
+};
+
+// Hash Index Configurations
+struct HashIndexConstants {
+    static constexpr uint16_t SLOT_CAPACITY_BYTES = 256;
+    static constexpr uint64_t NUM_HASH_INDEXES_LOG2 = 8;
+    static constexpr uint64_t NUM_HASH_INDEXES = 1 << NUM_HASH_INDEXES_LOG2;
+};
+
+struct CopyConstants {
+    // Initial size of buffer for CSV Reader.
+    static constexpr uint64_t INITIAL_BUFFER_SIZE = 16384;
+    // This means that we will usually read the entirety of the contents of the file we need for a
+    // block in one read request. It is also very small, which means we can parallelize small files
+    // efficiently.
+    static constexpr uint64_t PARALLEL_BLOCK_SIZE = INITIAL_BUFFER_SIZE / 2;
+
+    static constexpr const char* IGNORE_ERRORS_OPTION_NAME = "IGNORE_ERRORS";
+
+    static constexpr const char* FROM_OPTION_NAME = "FROM";
+    static constexpr const char* TO_OPTION_NAME = "TO";
+
+    static constexpr const char* BOOL_CSV_PARSING_OPTIONS[] = {"HEADER", "PARALLEL",
+        "LIST_UNBRACED", "AUTODETECT", "AUTO_DETECT", CopyConstants::IGNORE_ERRORS_OPTION_NAME};
+    static constexpr bool DEFAULT_CSV_HAS_HEADER = false;
+    static constexpr bool DEFAULT_CSV_PARALLEL = true;
+
+    // Default configuration for csv file parsing
+    static constexpr const char* STRING_CSV_PARSING_OPTIONS[] = {"ESCAPE", "DELIM", "DELIMITER",
+        "QUOTE"};
+    static constexpr char DEFAULT_CSV_ESCAPE_CHAR = '"';
+    static constexpr char DEFAULT_CSV_DELIMITER = ',';
+    static constexpr bool DEFAULT_CSV_ALLOW_UNBRACED_LIST = false;
+    static constexpr char DEFAULT_CSV_QUOTE_CHAR = '"';
+    static constexpr char DEFAULT_CSV_LIST_BEGIN_CHAR = '[';
+    static constexpr char DEFAULT_CSV_LIST_END_CHAR = ']';
+    static constexpr bool DEFAULT_IGNORE_ERRORS = false;
+    static constexpr bool DEFAULT_CSV_AUTO_DETECT = true;
+    static constexpr bool DEFAULT_CSV_SET_DIALECT = false;
+    static constexpr std::array DEFAULT_CSV_DELIMITER_SEARCH_SPACE = {',', ';', '\t', '|'};
+    static constexpr std::array DEFAULT_CSV_QUOTE_SEARCH_SPACE = {'"', '\''};
+    static constexpr std::array DEFAULT_CSV_ESCAPE_SEARCH_SPACE = {'"', '\\', '\''};
+    static constexpr std::array DEFAULT_CSV_NULL_STRINGS = {""};
+
+    static constexpr const char* INT_CSV_PARSING_OPTIONS[] = {"SKIP", "SAMPLE_SIZE"};
+    static constexpr uint64_t DEFAULT_CSV_SKIP_NUM = 0;
+    static constexpr uint64_t DEFAULT_CSV_TYPE_DEDUCTION_SAMPLE_SIZE = 256;
+
+    static constexpr const char* LIST_CSV_PARSING_OPTIONS[] = {"NULL_STRINGS"};
+
+    // metadata columns used to populate CSV warnings
+    static constexpr std::array SHARED_WARNING_DATA_COLUMN_NAMES = {"blockIdx", "offsetInBlock",
+        "startByteOffset", "endByteOffset"};
+    static constexpr std::array SHARED_WARNING_DATA_COLUMN_TYPES = {LogicalTypeID::UINT64,
+        LogicalTypeID::UINT32, LogicalTypeID::UINT64, LogicalTypeID::UINT64};
+    static constexpr column_id_t SHARED_WARNING_DATA_NUM_COLUMNS =
+        SHARED_WARNING_DATA_COLUMN_NAMES.size();
+
+    static constexpr std::array CSV_SPECIFIC_WARNING_DATA_COLUMN_NAMES = {"fileIdx"};
+    static constexpr std::array CSV_SPECIFIC_WARNING_DATA_COLUMN_TYPES = {LogicalTypeID::UINT32};
+
+    static constexpr std::array CSV_WARNING_DATA_COLUMN_NAMES =
+        arrayConcat(SHARED_WARNING_DATA_COLUMN_NAMES, CSV_SPECIFIC_WARNING_DATA_COLUMN_NAMES);
+    static constexpr std::array CSV_WARNING_DATA_COLUMN_TYPES =
+        arrayConcat(SHARED_WARNING_DATA_COLUMN_TYPES, CSV_SPECIFIC_WARNING_DATA_COLUMN_TYPES);
+    static constexpr column_id_t CSV_WARNING_DATA_NUM_COLUMNS =
+        CSV_WARNING_DATA_COLUMN_NAMES.size();
+    static_assert(CSV_WARNING_DATA_NUM_COLUMNS == CSV_WARNING_DATA_COLUMN_TYPES.size());
+
+    static constexpr column_id_t MAX_NUM_WARNING_DATA_COLUMNS = CSV_WARNING_DATA_NUM_COLUMNS;
+};
+
+struct PlannerKnobs {
+    static constexpr double NON_EQUALITY_PREDICATE_SELECTIVITY = 0.1;
+    static constexpr double EQUALITY_PREDICATE_SELECTIVITY = 0.01;
+    static constexpr uint64_t BUILD_PENALTY = 2;
+    // Avoid doing probe to build SIP if we have to accumulate a probe side that is much bigger than
+    // build side. Also avoid doing build to probe SIP if probe side is not much bigger than build.
+    static constexpr uint64_t SIP_RATIO = 5;
+};
+
+struct OrderByConstants {
+    static constexpr uint64_t NUM_BYTES_FOR_PAYLOAD_IDX = 8;
+    static constexpr uint64_t MIN_LIMIT_RATIO_TO_REDUCE = 2;
+};
+
+struct ParquetConstants {
+    static constexpr uint64_t PARQUET_DEFINE_VALID = 65535;
+    static constexpr const char* PARQUET_MAGIC_WORDS = "PAR1";
+    // We limit the uncompressed page size to 100MB.
+    // The max size in Parquet is 2GB, but we choose a more conservative limit.
+    static constexpr uint64_t MAX_UNCOMPRESSED_PAGE_SIZE = 100000000;
+    // Dictionary pages must be below 2GB. Unlike data pages, there's only one dictionary page.
+    // For this reason we go with a much higher, but still a conservative upper bound of 1GB.
+    static constexpr uint64_t MAX_UNCOMPRESSED_DICT_PAGE_SIZE = 1e9;
+    // The maximum size a key entry in an RLE page takes.
+    static constexpr uint64_t MAX_DICTIONARY_KEY_SIZE = sizeof(uint32_t);
+    // The size of encoding the string length.
+    static constexpr uint64_t STRING_LENGTH_SIZE = sizeof(uint32_t);
+    static constexpr uint64_t MAX_STRING_STATISTICS_SIZE = 10000;
+    static constexpr uint64_t PARQUET_INTERVAL_SIZE = 12;
+    static constexpr uint64_t PARQUET_UUID_SIZE = 16;
+};
+
+struct ExportCSVConstants {
+    static constexpr const char* DEFAULT_CSV_NEWLINE = "\n\r";
+    static constexpr const char* DEFAULT_NULL_STR = "";
+    static constexpr bool DEFAULT_FORCE_QUOTE = false;
+    static constexpr uint64_t DEFAULT_CSV_FLUSH_SIZE = 4096 * 8;
+};
+
+struct PortDBConstants {
+    static constexpr char INDEX_FILE_NAME[] = "index.cypher";
+    static constexpr char SCHEMA_FILE_NAME[] = "schema.cypher";
+    static constexpr char COPY_FILE_NAME[] = "copy.cypher";
+    static constexpr const char* SCHEMA_ONLY_OPTION = "SCHEMA_ONLY";
+    static constexpr const char* EXPORT_FORMAT_OPTION = "FORMAT";
+    static constexpr const char* DEFAULT_EXPORT_FORMAT_OPTION = "PARQUET";
+};
+
+struct WarningConstants {
+    static constexpr std::array WARNING_TABLE_COLUMN_NAMES{"query_id", "message", "file_path",
+        "line_number", "skipped_line_or_record"};
+    static constexpr std::array WARNING_TABLE_COLUMN_DATA_TYPES{LogicalTypeID::UINT64,
+        LogicalTypeID::STRING, LogicalTypeID::STRING, LogicalTypeID::UINT64, LogicalTypeID::STRING};
+    static constexpr uint64_t WARNING_TABLE_NUM_COLUMNS = WARNING_TABLE_COLUMN_NAMES.size();
+
+    static_assert(WARNING_TABLE_COLUMN_DATA_TYPES.size() == WARNING_TABLE_NUM_COLUMNS);
+};
+
+static constexpr char ATTACHED_LBUG_DB_TYPE[] = "LBUG";
+
+static constexpr char LOCAL_DB_NAME[] = "local(lbug)";
+
+constexpr auto DECIMAL_PRECISION_LIMIT = 38;
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/copier_config/csv_reader_config.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/copier_config/csv_reader_config.h
new file mode 100644
index 0000000000..5f80780367
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/copier_config/csv_reader_config.h
@@ -0,0 +1,112 @@
+#pragma once
+
+#include "common/case_insensitive_map.h"
+#include "common/constants.h"
+#include "common/copy_constructors.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace common {
+
+struct CSVOption {
+    // TODO(Xiyang): Add newline character option and delimiter can be a string.
+    char escapeChar;
+    char delimiter;
+    char quoteChar;
+    bool hasHeader;
+    uint64_t skipNum;
+    uint64_t sampleSize;
+    bool allowUnbracedList;
+    bool ignoreErrors;
+
+    bool autoDetection;
+    // These fields aim to identify whether the options are set by user, or set by default.
+    bool setEscape;
+    bool setDelim;
+    bool setQuote;
+    bool setHeader;
+    std::vector<std::string> nullStrings;
+
+    CSVOption()
+        : escapeChar{CopyConstants::DEFAULT_CSV_ESCAPE_CHAR},
+          delimiter{CopyConstants::DEFAULT_CSV_DELIMITER},
+          quoteChar{CopyConstants::DEFAULT_CSV_QUOTE_CHAR},
+          hasHeader{CopyConstants::DEFAULT_CSV_HAS_HEADER},
+          skipNum{CopyConstants::DEFAULT_CSV_SKIP_NUM},
+          sampleSize{CopyConstants::DEFAULT_CSV_TYPE_DEDUCTION_SAMPLE_SIZE},
+          allowUnbracedList{CopyConstants::DEFAULT_CSV_ALLOW_UNBRACED_LIST},
+          ignoreErrors(CopyConstants::DEFAULT_IGNORE_ERRORS),
+          autoDetection{CopyConstants::DEFAULT_CSV_AUTO_DETECT},
+          setEscape{CopyConstants::DEFAULT_CSV_SET_DIALECT},
+          setDelim{CopyConstants::DEFAULT_CSV_SET_DIALECT},
+          setQuote{CopyConstants::DEFAULT_CSV_SET_DIALECT},
+          setHeader{CopyConstants::DEFAULT_CSV_SET_DIALECT},
+          nullStrings{CopyConstants::DEFAULT_CSV_NULL_STRINGS[0]} {}
+
+    EXPLICIT_COPY_DEFAULT_MOVE(CSVOption);
+
+    // TODO: COPY FROM and COPY TO should support transform special options, like '\'.
+    std::unordered_map<std::string, std::string> toOptionsMap(const bool& parallel) const {
+        std::unordered_map<std::string, std::string> result;
+        result["parallel"] = parallel ? "true" : "false";
+        if (setHeader) {
+            result["header"] = hasHeader ? "true" : "false";
+        }
+        if (setEscape) {
+            result["escape"] = stringFormat("'\\{}'", escapeChar);
+        }
+        if (setDelim) {
+            result["delim"] = stringFormat("'{}'", delimiter);
+        }
+        if (setQuote) {
+            result["quote"] = stringFormat("'\\{}'", quoteChar);
+        }
+        if (autoDetection != CopyConstants::DEFAULT_CSV_AUTO_DETECT) {
+            result["auto_detect"] = autoDetection ? "true" : "false";
+        }
+        return result;
+    }
+
+    static std::string toCypher(const std::unordered_map<std::string, std::string>& options) {
+        if (options.empty()) {
+            return "";
+        }
+        std::string result = "";
+        for (const auto& [key, value] : options) {
+            if (!result.empty()) {
+                result += ", ";
+            }
+            result += key + "=" + value;
+        }
+        return "(" + result + ")";
+    }
+
+    // Explicit copy constructor
+    CSVOption(const CSVOption& other)
+        : escapeChar{other.escapeChar}, delimiter{other.delimiter}, quoteChar{other.quoteChar},
+          hasHeader{other.hasHeader}, skipNum{other.skipNum},
+          sampleSize{other.sampleSize == 0 ?
+                         CopyConstants::DEFAULT_CSV_TYPE_DEDUCTION_SAMPLE_SIZE :
+                         other.sampleSize}, // Set to DEFAULT_CSV_TYPE_DEDUCTION_SAMPLE_SIZE if
+                                            // sampleSize is 0
+          allowUnbracedList{other.allowUnbracedList}, ignoreErrors{other.ignoreErrors},
+          autoDetection{other.autoDetection}, setEscape{other.setEscape}, setDelim{other.setDelim},
+          setQuote{other.setQuote}, setHeader{other.setHeader}, nullStrings{other.nullStrings} {}
+};
+
+struct CSVReaderConfig {
+    CSVOption option;
+    bool parallel;
+
+    CSVReaderConfig() : option{}, parallel{CopyConstants::DEFAULT_CSV_PARALLEL} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(CSVReaderConfig);
+
+    static CSVReaderConfig construct(const case_insensitive_map_t<Value>& options);
+
+private:
+    CSVReaderConfig(const CSVReaderConfig& other)
+        : option{other.option.copy()}, parallel{other.parallel} {}
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/copier_config/file_scan_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/copier_config/file_scan_info.h
new file mode 100644
index 0000000000..5f4790b0e4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/copier_config/file_scan_info.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include <string>
+#include <vector>
+
+#include "common/case_insensitive_map.h"
+#include "common/copy_constructors.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace common {
+
+enum class FileType : uint8_t {
+    UNKNOWN = 0,
+    CSV = 1,
+    PARQUET = 2,
+    NPY = 3,
+};
+
+struct FileTypeInfo {
+    FileType fileType = FileType::UNKNOWN;
+    std::string fileTypeStr;
+};
+
+struct FileTypeUtils {
+    static FileType getFileTypeFromExtension(std::string_view extension);
+    static std::string toString(FileType fileType);
+    static FileType fromString(std::string fileType);
+};
+
+struct FileScanInfo {
+    static constexpr const char* FILE_FORMAT_OPTION_NAME = "FILE_FORMAT";
+
+    FileTypeInfo fileTypeInfo;
+    std::vector<std::string> filePaths;
+    case_insensitive_map_t<Value> options;
+
+    FileScanInfo() : fileTypeInfo{FileType::UNKNOWN, ""} {}
+    FileScanInfo(FileTypeInfo fileTypeInfo, std::vector<std::string> filePaths)
+        : fileTypeInfo{std::move(fileTypeInfo)}, filePaths{std::move(filePaths)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(FileScanInfo);
+
+    uint32_t getNumFiles() const { return filePaths.size(); }
+    std::string getFilePath(idx_t fileIdx) const {
+        KU_ASSERT(fileIdx < getNumFiles());
+        return filePaths[fileIdx];
+    }
+
+    template<typename T>
+    T getOption(std::string optionName, T defaultValue) const {
+        const auto optionIt = options.find(optionName);
+        if (optionIt != options.end()) {
+            return optionIt->second.getValue<T>();
+        } else {
+            return defaultValue;
+        }
+    }
+
+private:
+    FileScanInfo(const FileScanInfo& other)
+        : fileTypeInfo{other.fileTypeInfo}, filePaths{other.filePaths}, options{other.options} {}
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/copy_constructors.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/copy_constructors.h
new file mode 100644
index 0000000000..98d93c98e8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/copy_constructors.h
@@ -0,0 +1,117 @@
+#pragma once
+#include <map>
+#include <memory>
+#include <unordered_map>
+#include <vector>
+// This file defines many macros for controlling copy constructors and move constructors on classes.
+
+// NOLINTBEGIN(bugprone-macro-parentheses): Although this is a good check in general, here, we
+// cannot add parantheses around the arguments, for it would be invalid syntax.
+#define DELETE_COPY_CONSTRUCT(Object) Object(const Object& other) = delete
+#define DELETE_COPY_ASSN(Object) Object& operator=(const Object& other) = delete
+
+#define DELETE_MOVE_CONSTRUCT(Object) Object(Object&& other) = delete
+#define DELETE_MOVE_ASSN(Object) Object& operator=(Object&& other) = delete
+
+#define DELETE_BOTH_COPY(Object)                                                                   \
+    DELETE_COPY_CONSTRUCT(Object);                                                                 \
+    DELETE_COPY_ASSN(Object)
+
+#define DELETE_BOTH_MOVE(Object)                                                                   \
+    DELETE_MOVE_CONSTRUCT(Object);                                                                 \
+    DELETE_MOVE_ASSN(Object)
+
+#define DEFAULT_MOVE_CONSTRUCT(Object) Object(Object&& other) = default
+#define DEFAULT_MOVE_ASSN(Object) Object& operator=(Object&& other) = default
+
+#define DEFAULT_BOTH_MOVE(Object)                                                                  \
+    DEFAULT_MOVE_CONSTRUCT(Object);                                                                \
+    DEFAULT_MOVE_ASSN(Object)
+
+#define EXPLICIT_COPY_METHOD(Object)                                                               \
+    Object copy() const {                                                                          \
+        return *this;                                                                              \
+    }
+
+// EXPLICIT_COPY_DEFAULT_MOVE should be the default choice. It expects a PRIVATE copy constructor to
+// be defined, which will be used by an explicit `copy()` method. For instance:
+//
+//   private:
+//     MyClass(const MyClass& other) : field(other.field.copy()) {}
+//
+//   public:
+//     EXPLICIT_COPY_DEFAULT_MOVE(MyClass);
+//
+// Now:
+//
+// MyClass o1;
+// MyClass o2 = o1; // Compile error, copy assignment deleted.
+// MyClass o2 = o1.copy(); // OK.
+// MyClass o2(o1); // Compile error, copy constructor is private.
+#define EXPLICIT_COPY_DEFAULT_MOVE(Object)                                                         \
+    DELETE_COPY_ASSN(Object);                                                                      \
+    DEFAULT_BOTH_MOVE(Object);                                                                     \
+    EXPLICIT_COPY_METHOD(Object)
+
+// NO_COPY should be used for objects that for whatever reason, should never be copied, but can be
+// moved.
+#define DELETE_COPY_DEFAULT_MOVE(Object)                                                           \
+    DELETE_BOTH_COPY(Object);                                                                      \
+    DEFAULT_BOTH_MOVE(Object)
+
+// NO_MOVE_OR_COPY exists solely for explicitness, when an object cannot be moved nor copied. Any
+// object containing a lock cannot be moved or copied.
+#define DELETE_COPY_AND_MOVE(Object)                                                               \
+    DELETE_BOTH_COPY(Object);                                                                      \
+    DELETE_BOTH_MOVE(Object)
+// NOLINTEND(bugprone-macro-parentheses):
+
+template<typename T>
+static std::vector<T> copyVector(const std::vector<T>& objects) {
+    std::vector<T> result;
+    result.reserve(objects.size());
+    for (auto& object : objects) {
+        result.push_back(object.copy());
+    }
+    return result;
+}
+
+template<typename T>
+static std::vector<std::shared_ptr<T>> copyVector(const std::vector<std::shared_ptr<T>>& objects) {
+    std::vector<std::shared_ptr<T>> result;
+    result.reserve(objects.size());
+    for (auto& object : objects) {
+        T& ob = *object;
+        result.push_back(ob.copy());
+    }
+    return result;
+}
+
+template<typename T>
+static std::vector<std::unique_ptr<T>> copyVector(const std::vector<std::unique_ptr<T>>& objects) {
+    std::vector<std::unique_ptr<T>> result;
+    result.reserve(objects.size());
+    for (auto& object : objects) {
+        T& ob = *object;
+        result.push_back(ob.copy());
+    }
+    return result;
+}
+
+template<typename K, typename V>
+static std::unordered_map<K, V> copyUnorderedMap(const std::unordered_map<K, V>& objects) {
+    std::unordered_map<K, V> result;
+    for (auto& [k, v] : objects) {
+        result.insert({k, v.copy()});
+    }
+    return result;
+}
+
+template<typename K, typename V>
+static std::map<K, V> copyMap(const std::map<K, V>& objects) {
+    std::map<K, V> result;
+    for (auto& [k, v] : objects) {
+        result.insert({k, v.copy()});
+    }
+    return result;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/counter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/counter.h
new file mode 100644
index 0000000000..50f35dde84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/counter.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include <atomic>
+
+#include "types/types.h"
+
+namespace lbug {
+namespace common {
+
+class LimitCounter {
+public:
+    explicit LimitCounter(common::offset_t limitNumber) : limitNumber{limitNumber} {
+        counter.store(0);
+    }
+
+    void increase(common::offset_t number) { counter.fetch_add(number); }
+
+    bool exceedLimit() const { return counter.load() >= limitNumber; }
+
+private:
+    common::offset_t limitNumber;
+    std::atomic<common::offset_t> counter;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/data_chunk.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/data_chunk.h
new file mode 100644
index 0000000000..9d0423191b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/data_chunk.h
@@ -0,0 +1,49 @@
+#pragma once
+
+#include <memory>
+#include <vector>
+
+#include "common/copy_constructors.h"
+#include "common/data_chunk/data_chunk_state.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace common {
+
+// A DataChunk represents tuples as a set of value vectors and a selector array.
+// The data chunk represents a subset of a relation i.e., a set of tuples as
+// lists of the same length. It is appended into DataChunks and passed as intermediate
+// representations between operators.
+// A data chunk further contains a DataChunkState, which keeps the data chunk's size, selector, and
+// currIdx (used when flattening and implies the value vector only contains the elements at currIdx
+// of each value vector).
+class LBUG_API DataChunk {
+public:
+    DataChunk() : DataChunk{0} {}
+    explicit DataChunk(uint32_t numValueVectors)
+        : DataChunk(numValueVectors, std::make_shared<DataChunkState>()){};
+
+    DataChunk(uint32_t numValueVectors, const std::shared_ptr<DataChunkState>& state)
+        : valueVectors(numValueVectors), state{state} {};
+    DELETE_COPY_DEFAULT_MOVE(DataChunk);
+
+    void insert(uint32_t pos, std::shared_ptr<ValueVector> valueVector);
+
+    void resetAuxiliaryBuffer();
+
+    uint32_t getNumValueVectors() const { return valueVectors.size(); }
+
+    const ValueVector& getValueVector(uint64_t valueVectorPos) const {
+        return *valueVectors[valueVectorPos];
+    }
+    ValueVector& getValueVectorMutable(uint64_t valueVectorPos) const {
+        return *valueVectors[valueVectorPos];
+    }
+
+public:
+    std::vector<std::shared_ptr<ValueVector>> valueVectors;
+    std::shared_ptr<DataChunkState> state;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/data_chunk_collection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/data_chunk_collection.h
new file mode 100644
index 0000000000..fde1db8e4a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/data_chunk_collection.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include "common/data_chunk/data_chunk.h"
+
+namespace lbug {
+namespace common {
+
+// TODO(Guodong): Should rework this to use ColumnChunk.
+class DataChunkCollection {
+public:
+    explicit DataChunkCollection(storage::MemoryManager* mm);
+    DELETE_COPY_DEFAULT_MOVE(DataChunkCollection);
+
+    void append(DataChunk& chunk);
+    const std::vector<DataChunk>& getChunks() const { return chunks; }
+    std::vector<DataChunk>& getChunksUnsafe() { return chunks; }
+    uint64_t getNumChunks() const { return chunks.size(); }
+    const DataChunk& getChunk(uint64_t idx) const {
+        KU_ASSERT(idx < chunks.size());
+        return chunks[idx];
+    }
+    DataChunk& getChunkUnsafe(uint64_t idx) {
+        KU_ASSERT(idx < chunks.size());
+        return chunks[idx];
+    }
+
+private:
+    void allocateChunk(const DataChunk& chunk);
+
+    void initTypes(const DataChunk& chunk);
+
+private:
+    storage::MemoryManager* mm;
+    std::vector<LogicalType> types;
+    std::vector<DataChunk> chunks;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/data_chunk_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/data_chunk_state.h
new file mode 100644
index 0000000000..cbc6b5ea9a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/data_chunk_state.h
@@ -0,0 +1,44 @@
+#pragma once
+
+#include "common/data_chunk/sel_vector.h"
+
+namespace lbug {
+namespace common {
+
+// F stands for Factorization
+enum class FStateType : uint8_t {
+    FLAT = 0,
+    UNFLAT = 1,
+};
+
+class LBUG_API DataChunkState {
+public:
+    DataChunkState();
+    explicit DataChunkState(sel_t capacity) : fStateType{FStateType::UNFLAT} {
+        selVector = std::make_shared<SelectionVector>(capacity);
+    }
+
+    // returns a dataChunkState for vectors holding a single value.
+    static std::shared_ptr<DataChunkState> getSingleValueDataChunkState();
+
+    void initOriginalAndSelectedSize(uint64_t size) { selVector->setSelSize(size); }
+    bool isFlat() const { return fStateType == FStateType::FLAT; }
+    void setToFlat() { fStateType = FStateType::FLAT; }
+    void setToUnflat() { fStateType = FStateType::UNFLAT; }
+
+    const SelectionVector& getSelVector() const { return *selVector; }
+    sel_t getSelSize() const { return selVector->getSelSize(); }
+    SelectionVector& getSelVectorUnsafe() { return *selVector; }
+    std::shared_ptr<SelectionVector> getSelVectorShared() { return selVector; }
+    void setSelVector(std::shared_ptr<SelectionVector> selVector_) {
+        this->selVector = std::move(selVector_);
+    }
+
+private:
+    std::shared_ptr<SelectionVector> selVector;
+    // TODO: We should get rid of `fStateType` and merge DataChunkState with SelectionVector.
+    FStateType fStateType;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/sel_vector.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/sel_vector.h
new file mode 100644
index 0000000000..411e0d8844
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/data_chunk/sel_vector.h
@@ -0,0 +1,174 @@
+#pragma once
+
+#include <string.h>
+
+#include <memory>
+
+#include "common/types/types.h"
+#include <span>
+
+namespace lbug {
+namespace common {
+
+class ValueVector;
+
+// A lightweight, immutable view over a SelectionVector, or a subsequence of a selection vector
+// SelectionVectors are also SelectionViews so that you can pass a SelectionVector to functions
+// which take a SelectionView&
+class SelectionView {
+protected:
+    // In DYNAMIC mode, selectedPositions points to a mutable buffer that can be modified through
+    // getMutableBuffer In STATIC mode, selectedPositions points to somewhere in
+    // INCREMENTAL_SELECTED_POS
+    // Note that the vector is considered unfiltered only if it is both STATIC and the first
+    // selected position is 0
+    enum class State {
+        DYNAMIC,
+        STATIC,
+    };
+
+public:
+    // STATIC selectionView over 0..selectedSize
+    explicit SelectionView(sel_t selectedSize);
+
+    template<class Func>
+    void forEach(Func&& func) const {
+        if (state == State::DYNAMIC) {
+            for (size_t i = 0; i < selectedSize; i++) {
+                func(selectedPositions[i]);
+            }
+        } else {
+            const auto start = selectedPositions[0];
+            for (size_t i = start; i < start + selectedSize; i++) {
+                func(i);
+            }
+        }
+    }
+
+    template<class Func>
+    void forEachBreakWhenFalse(Func&& func) const {
+        if (state == State::DYNAMIC) {
+            for (size_t i = 0; i < selectedSize; i++) {
+                if (!func(selectedPositions[i])) {
+                    break;
+                }
+            }
+        } else {
+            const auto start = selectedPositions[0];
+            for (size_t i = start; i < start + selectedSize; i++) {
+                if (!func(i)) {
+                    break;
+                }
+            }
+        }
+    }
+
+    sel_t getSelSize() const { return selectedSize; }
+
+    sel_t operator[](sel_t index) const {
+        KU_ASSERT(index < selectedSize);
+        return selectedPositions[index];
+    }
+
+    bool isUnfiltered() const { return state == State::STATIC && selectedPositions[0] == 0; }
+    bool isStatic() const { return state == State::STATIC; }
+
+    std::span<const sel_t> getSelectedPositions() const {
+        return std::span<const sel_t>(selectedPositions, selectedSize);
+    }
+
+protected:
+    static SelectionView slice(std::span<const sel_t> selectedPositions, State state) {
+        return SelectionView(selectedPositions, state);
+    }
+
+    // Intended to be used only as a subsequence of a SelectionVector in SelectionVector::slice
+    explicit SelectionView(std::span<const sel_t> selectedPositions, State state)
+        : selectedPositions{selectedPositions.data()}, selectedSize{selectedPositions.size()},
+          state{state} {}
+
+protected:
+    const sel_t* selectedPositions;
+    sel_t selectedSize;
+    State state;
+};
+
+class SelectionVector : public SelectionView {
+public:
+    explicit SelectionVector(sel_t capacity)
+        : SelectionView{std::span<const sel_t>(), State::STATIC},
+          selectedPositionsBuffer{std::make_unique<sel_t[]>(capacity)}, capacity{capacity} {
+        setToUnfiltered();
+    }
+
+    // This View should be considered invalid if the SelectionVector it was created from has been
+    // modified
+    SelectionView slice(sel_t startIndex, sel_t selectedSize) const {
+        return SelectionView::slice(getSelectedPositions().subspan(startIndex, selectedSize),
+            state);
+    }
+
+    SelectionVector();
+
+    LBUG_API void setToUnfiltered();
+    LBUG_API void setToUnfiltered(sel_t size);
+    void setRange(sel_t startPos, sel_t size) {
+        KU_ASSERT(startPos + size <= capacity);
+        selectedPositions = selectedPositionsBuffer.get();
+        for (auto i = 0u; i < size; ++i) {
+            selectedPositionsBuffer[i] = startPos + i;
+        }
+        selectedSize = size;
+        state = State::DYNAMIC;
+    }
+
+    // Set to filtered is not very accurate. It sets selectedPositions to a mutable array.
+    void setToFiltered() {
+        selectedPositions = selectedPositionsBuffer.get();
+        state = State::DYNAMIC;
+    }
+    void setToFiltered(sel_t size) {
+        KU_ASSERT(size <= capacity && selectedPositionsBuffer);
+        setToFiltered();
+        selectedSize = size;
+    }
+
+    // Copies the data in selectedPositions into selectedPositionsBuffer
+    void makeDynamic() {
+        memcpy(selectedPositionsBuffer.get(), selectedPositions, selectedSize * sizeof(sel_t));
+        state = State::DYNAMIC;
+        selectedPositions = selectedPositionsBuffer.get();
+    }
+
+    std::span<sel_t> getMutableBuffer() const {
+        return std::span<sel_t>(selectedPositionsBuffer.get(), capacity);
+    }
+
+    void setSelSize(sel_t size) {
+        KU_ASSERT(size <= capacity);
+        selectedSize = size;
+    }
+    void incrementSelSize(sel_t increment = 1) {
+        KU_ASSERT(selectedSize < capacity);
+        selectedSize += increment;
+    }
+
+    sel_t operator[](sel_t index) const {
+        KU_ASSERT(index < capacity);
+        return const_cast<sel_t&>(selectedPositions[index]);
+    }
+    sel_t& operator[](sel_t index) {
+        KU_ASSERT(index < capacity);
+        return const_cast<sel_t&>(selectedPositions[index]);
+    }
+
+    static std::vector<SelectionVector*> fromValueVectors(
+        const std::vector<std::shared_ptr<common::ValueVector>>& vec);
+
+private:
+    std::unique_ptr<sel_t[]> selectedPositionsBuffer;
+    sel_t capacity;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/database_lifecycle_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/database_lifecycle_manager.h
new file mode 100644
index 0000000000..a57f6020a6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/database_lifecycle_manager.h
@@ -0,0 +1,10 @@
+#pragma once
+
+namespace lbug {
+namespace common {
+struct DatabaseLifeCycleManager {
+    bool isDatabaseClosed = false;
+    void checkDatabaseClosedOrThrow() const;
+};
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/accumulate_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/accumulate_type.h
new file mode 100644
index 0000000000..5bff679c1c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/accumulate_type.h
@@ -0,0 +1,19 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+namespace lbug {
+namespace common {
+
+enum class AccumulateType : uint8_t {
+    REGULAR = 0,
+    OPTIONAL_ = 1,
+};
+
+struct AccumulateTypeUtil {
+    static std::string toString(AccumulateType type);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/alter_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/alter_type.h
new file mode 100644
index 0000000000..7f9c3d9623
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/alter_type.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class AlterType : uint8_t {
+    RENAME = 0,
+
+    ADD_PROPERTY = 10,
+    DROP_PROPERTY = 11,
+    RENAME_PROPERTY = 12,
+    ADD_FROM_TO_CONNECTION = 13,
+    DROP_FROM_TO_CONNECTION = 14,
+
+    COMMENT = 201,
+    INVALID = 255
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/clause_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/clause_type.h
new file mode 100644
index 0000000000..87e4bf8349
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/clause_type.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class ClauseType : uint8_t {
+    // updating clause
+    SET = 0,
+    DELETE_ = 1, // winnt.h defines DELETE as a macro, so we use DELETE_ instead of DELETE.
+    INSERT = 2,
+    MERGE = 3,
+
+    // reading clause
+    MATCH = 10,
+    UNWIND = 11,
+    IN_QUERY_CALL = 12,
+    TABLE_FUNCTION_CALL = 13,
+    GDS_CALL = 14,
+    LOAD_FROM = 15,
+};
+
+enum class MatchClauseType : uint8_t {
+    MATCH = 0,
+    OPTIONAL_MATCH = 1,
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/column_evaluate_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/column_evaluate_type.h
new file mode 100644
index 0000000000..e39a17f318
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/column_evaluate_type.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class ColumnEvaluateType : uint8_t {
+    REFERENCE = 0,
+    DEFAULT = 1,
+    CAST = 2,
+};
+
+}
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/conflict_action.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/conflict_action.h
new file mode 100644
index 0000000000..ca0ef6b6a3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/conflict_action.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+namespace lbug {
+namespace common {
+
+enum class ConflictAction : uint8_t {
+    ON_CONFLICT_THROW = 0,
+    ON_CONFLICT_DO_NOTHING = 1,
+    INVALID = 255,
+};
+
+struct ConflictActionUtil {
+    static std::string toString(ConflictAction conflictAction);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/delete_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/delete_type.h
new file mode 100644
index 0000000000..e0f160eda6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/delete_type.h
@@ -0,0 +1,14 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class DeleteNodeType : uint8_t {
+    DELETE = 0,
+    DETACH_DELETE = 1,
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/drop_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/drop_type.h
new file mode 100644
index 0000000000..2998ef4ce4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/drop_type.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+namespace lbug {
+namespace common {
+
+enum class DropType : uint8_t {
+    TABLE = 0,
+    SEQUENCE = 1,
+    MACRO = 2,
+};
+
+struct DropTypeUtils {
+    static std::string toString(DropType type);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/explain_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/explain_type.h
new file mode 100644
index 0000000000..726deeb0d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/explain_type.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class ExplainType : uint8_t {
+    PROFILE = 0,
+    LOGICAL_PLAN = 1,
+    PHYSICAL_PLAN = 2,
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/expression_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/expression_type.h
new file mode 100644
index 0000000000..0997abce47
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/expression_type.h
@@ -0,0 +1,74 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+enum class ExpressionType : uint8_t {
+    // Boolean Connection Expressions
+    OR = 0,
+    XOR = 1,
+    AND = 2,
+    NOT = 3,
+
+    // Comparison Expressions
+    EQUALS = 10,
+    NOT_EQUALS = 11,
+    GREATER_THAN = 12,
+    GREATER_THAN_EQUALS = 13,
+    LESS_THAN = 14,
+    LESS_THAN_EQUALS = 15,
+
+    // Null Operator Expressions
+    IS_NULL = 50,
+    IS_NOT_NULL = 51,
+
+    PROPERTY = 60,
+
+    LITERAL = 70,
+
+    STAR = 80,
+
+    VARIABLE = 90,
+    PATH = 91,
+    PATTERN = 92, // Node & Rel pattern
+
+    PARAMETER = 100,
+
+    // At parsing stage, both aggregate and scalar functions have type FUNCTION.
+    // After binding, only scalar function have type FUNCTION.
+    FUNCTION = 110,
+
+    AGGREGATE_FUNCTION = 130,
+
+    SUBQUERY = 190,
+
+    CASE_ELSE = 200,
+
+    GRAPH = 210,
+
+    LAMBDA = 220,
+
+    // NOTE: this enum has type uint8_t so don't assign over 255.
+    INVALID = 255,
+};
+
+struct ExpressionTypeUtil {
+    static bool isUnary(ExpressionType type);
+    static bool isBinary(ExpressionType type);
+    static bool isBoolean(ExpressionType type);
+    static bool isComparison(ExpressionType type);
+    static bool isNullOperator(ExpressionType type);
+
+    static ExpressionType reverseComparisonDirection(ExpressionType type);
+
+    static LBUG_API std::string toString(ExpressionType type);
+    static std::string toParsableString(ExpressionType type);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/extend_direction.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/extend_direction.h
new file mode 100644
index 0000000000..ee8ab2127e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/extend_direction.h
@@ -0,0 +1,11 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class ExtendDirection : uint8_t { FWD = 0, BWD = 1, BOTH = 2 };
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/extend_direction_util.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/extend_direction_util.h
new file mode 100644
index 0000000000..69df2093d3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/extend_direction_util.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "common/assert.h"
+#include "common/enums/extend_direction.h"
+#include "common/enums/rel_direction.h"
+
+namespace lbug {
+namespace common {
+
+class ExtendDirectionUtil {
+public:
+    static RelDataDirection getRelDataDirection(ExtendDirection direction) {
+        KU_ASSERT(direction != ExtendDirection::BOTH);
+        return direction == ExtendDirection::FWD ? RelDataDirection::FWD : RelDataDirection::BWD;
+    }
+
+    static ExtendDirection fromString(const std::string& str);
+    static std::string toString(ExtendDirection direction);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/join_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/join_type.h
new file mode 100644
index 0000000000..4751925c53
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/join_type.h
@@ -0,0 +1,16 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class JoinType : uint8_t {
+    INNER = 0,
+    LEFT = 1,
+    MARK = 2,
+    COUNT = 3,
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/path_semantic.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/path_semantic.h
new file mode 100644
index 0000000000..803a337a13
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/path_semantic.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+namespace lbug {
+namespace common {
+
+enum class PathSemantic : uint8_t {
+    WALK = 0,
+    TRAIL = 1,
+    ACYCLIC = 2,
+};
+
+struct PathSemanticUtils {
+    static PathSemantic fromString(const std::string& str);
+    static std::string toString(PathSemantic semantic);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/query_rel_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/query_rel_type.h
new file mode 100644
index 0000000000..ed1d5f1723
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/query_rel_type.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include <cstdint>
+#include <memory>
+
+#include "path_semantic.h"
+
+namespace lbug {
+namespace function {
+class RJAlgorithm;
+}
+
+namespace common {
+
+enum class QueryRelType : uint8_t {
+    NON_RECURSIVE = 0,
+    VARIABLE_LENGTH_WALK = 1,
+    VARIABLE_LENGTH_TRAIL = 2,
+    VARIABLE_LENGTH_ACYCLIC = 3,
+    SHORTEST = 4,
+    ALL_SHORTEST = 5,
+    WEIGHTED_SHORTEST = 6,
+    ALL_WEIGHTED_SHORTEST = 7,
+};
+
+struct QueryRelTypeUtils {
+    static bool isRecursive(QueryRelType type) { return type != QueryRelType::NON_RECURSIVE; }
+
+    static bool isWeighted(QueryRelType type) {
+        return type == QueryRelType::WEIGHTED_SHORTEST ||
+               type == QueryRelType::ALL_WEIGHTED_SHORTEST;
+    }
+
+    static PathSemantic getPathSemantic(QueryRelType queryRelType);
+
+    static std::unique_ptr<function::RJAlgorithm> getFunction(QueryRelType type);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/rel_direction.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/rel_direction.h
new file mode 100644
index 0000000000..064d809cc7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/rel_direction.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+#include "common/types/types.h"
+
+namespace lbug {
+namespace common {
+
+enum class RelDataDirection : uint8_t { FWD = 0, BWD = 1, INVALID = 255 };
+static constexpr idx_t NUM_REL_DIRECTIONS = 2;
+
+struct RelDirectionUtils {
+    static RelDataDirection getOppositeDirection(RelDataDirection direction);
+
+    static std::string relDirectionToString(RelDataDirection direction);
+    static idx_t relDirectionToKeyIdx(RelDataDirection direction);
+    static table_id_t getNbrTableID(RelDataDirection direction, table_id_t srcTableID,
+        table_id_t dstTableID);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/rel_multiplicity.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/rel_multiplicity.h
new file mode 100644
index 0000000000..dc3bcdd684
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/rel_multiplicity.h
@@ -0,0 +1,18 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+namespace lbug {
+namespace common {
+
+enum class RelMultiplicity : uint8_t { MANY, ONE };
+
+struct RelMultiplicityUtils {
+    static RelMultiplicity getFwd(const std::string& str);
+    static RelMultiplicity getBwd(const std::string& str);
+    static std::string toString(RelMultiplicity multiplicity);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/scan_source_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/scan_source_type.h
new file mode 100644
index 0000000000..43958cca61
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/scan_source_type.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+namespace lbug {
+namespace common {
+
+enum class ScanSourceType : uint8_t {
+    EMPTY = 0,
+    FILE = 1,
+    OBJECT = 2,
+    QUERY = 3,
+    TABLE_FUNC = 4,
+    PARAM = 5,
+};
+
+class ScanSourceTypeUtils {
+public:
+    static std::string toString(ScanSourceType type);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/statement_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/statement_type.h
new file mode 100644
index 0000000000..038c8a4b1d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/statement_type.h
@@ -0,0 +1,32 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class StatementType : uint8_t {
+    QUERY = 0,
+    CREATE_TABLE = 1,
+    DROP = 2,
+    ALTER = 3,
+    COPY_TO = 19,
+    COPY_FROM = 20,
+    STANDALONE_CALL = 21,
+    STANDALONE_CALL_FUNCTION = 22,
+    EXPLAIN = 23,
+    CREATE_MACRO = 24,
+    TRANSACTION = 30,
+    EXTENSION = 31,
+    EXPORT_DATABASE = 32,
+    IMPORT_DATABASE = 33,
+    ATTACH_DATABASE = 34,
+    DETACH_DATABASE = 35,
+    USE_DATABASE = 36,
+    CREATE_SEQUENCE = 37,
+    CREATE_TYPE = 39,
+    EXTENSION_CLAUSE = 40,
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/subquery_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/subquery_type.h
new file mode 100644
index 0000000000..81f1bdda3c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/subquery_type.h
@@ -0,0 +1,14 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class SubqueryType : uint8_t {
+    COUNT = 1,
+    EXISTS = 2,
+};
+
+}
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/table_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/table_type.h
new file mode 100644
index 0000000000..c1aaae971b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/table_type.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+enum class TableType : uint8_t {
+    UNKNOWN = 0,
+    NODE = 1,
+    REL = 2,
+    FOREIGN = 5,
+};
+
+struct LBUG_API TableTypeUtils {
+    static std::string toString(TableType tableType);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/zone_map_check_result.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/zone_map_check_result.h
new file mode 100644
index 0000000000..647e5e9dd7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/enums/zone_map_check_result.h
@@ -0,0 +1,14 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+enum class ZoneMapCheckResult : uint8_t {
+    ALWAYS_SCAN = 0,
+    SKIP_SCAN = 1,
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/binder.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/binder.h
new file mode 100644
index 0000000000..161d0cef3f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/binder.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API BinderException : public Exception {
+public:
+    explicit BinderException(const std::string& msg) : Exception("Binder exception: " + msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/buffer_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/buffer_manager.h
new file mode 100644
index 0000000000..007ee300e4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/buffer_manager.h
@@ -0,0 +1,16 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API BufferManagerException : public Exception {
+public:
+    explicit BufferManagerException(const std::string& msg)
+        : Exception("Buffer manager exception: " + msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/catalog.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/catalog.h
new file mode 100644
index 0000000000..e83ee694d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/catalog.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API CatalogException : public Exception {
+public:
+    explicit CatalogException(const std::string& msg) : Exception("Catalog exception: " + msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/checkpoint.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/checkpoint.h
new file mode 100644
index 0000000000..6603c2d77a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/checkpoint.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API CheckpointException : public Exception {
+public:
+    explicit CheckpointException(const std::exception& e) : Exception(e.what()){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/connection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/connection.h
new file mode 100644
index 0000000000..afc92beb41
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/connection.h
@@ -0,0 +1,16 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API ConnectionException : public Exception {
+public:
+    explicit ConnectionException(const std::string& msg)
+        : Exception("Connection exception: " + msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/conversion.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/conversion.h
new file mode 100644
index 0000000000..d857e39a1d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/conversion.h
@@ -0,0 +1,16 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API ConversionException : public Exception {
+public:
+    explicit ConversionException(const std::string& msg)
+        : Exception("Conversion exception: " + msg) {}
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/copy.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/copy.h
new file mode 100644
index 0000000000..1756690da8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/copy.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API CopyException : public Exception {
+public:
+    explicit CopyException(const std::string& msg) : Exception("Copy exception: " + msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/exception.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/exception.h
new file mode 100644
index 0000000000..2e49d6c7e0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/exception.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include <exception>
+#include <string>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API Exception : public std::exception {
+public:
+    explicit Exception(std::string msg);
+
+public:
+    const char* what() const noexcept override { return exception_message_.c_str(); }
+
+private:
+    std::string exception_message_;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/extension.h
new file mode 100644
index 0000000000..52b187b983
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/extension.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API ExtensionException : public Exception {
+public:
+    explicit ExtensionException(const std::string& msg)
+        : Exception("Extension exception: " + msg) {}
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/internal.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/internal.h
new file mode 100644
index 0000000000..acf5b6fdf1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/internal.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API InternalException : public Exception {
+public:
+    explicit InternalException(const std::string& msg) : Exception(msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/interrupt.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/interrupt.h
new file mode 100644
index 0000000000..7df12870fb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/interrupt.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API InterruptException : public Exception {
+public:
+    explicit InterruptException() : Exception("Interrupted."){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/io.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/io.h
new file mode 100644
index 0000000000..6795882363
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/io.h
@@ -0,0 +1,14 @@
+#pragma once
+
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API IOException : public Exception {
+public:
+    explicit IOException(const std::string& msg) : Exception("IO exception: " + msg) {}
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/message.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/message.h
new file mode 100644
index 0000000000..dd00120252
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/message.h
@@ -0,0 +1,34 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+namespace lbug {
+namespace common {
+
+// Add exception only if you need to throw it in multiple places.
+struct ExceptionMessage {
+    // Primary key.
+    static std::string duplicatePKException(const std::string& pkString);
+    static std::string nonExistentPKException(const std::string& pkString);
+    static std::string invalidPKType(const std::string& type);
+    static std::string nullPKException();
+    // Long string.
+    static std::string overLargeStringPKValueException(uint64_t length);
+    static std::string overLargeStringValueException(uint64_t length);
+    // Foreign key.
+    static std::string violateDeleteNodeWithConnectedEdgesConstraint(const std::string& tableName,
+        const std::string& offset, const std::string& direction);
+    static std::string violateRelMultiplicityConstraint(const std::string& tableName,
+        const std::string& offset, const std::string& direction);
+    // Binding exception
+    static std::string variableNotInScope(const std::string& varName);
+    static std::string listFunctionIncompatibleChildrenType(const std::string& functionName,
+        const std::string& leftType, const std::string& rightType);
+    // Skip limit exception
+    static std::string invalidSkipLimitParam(const std::string& exprName,
+        const std::string& skipOrLimit);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/not_implemented.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/not_implemented.h
new file mode 100644
index 0000000000..793edba30e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/not_implemented.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API NotImplementedException : public Exception {
+public:
+    explicit NotImplementedException(const std::string& msg) : Exception(msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/overflow.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/overflow.h
new file mode 100644
index 0000000000..1ff0b9fd63
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/overflow.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API OverflowException : public Exception {
+public:
+    explicit OverflowException(const std::string& msg) : Exception("Overflow exception: " + msg) {}
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/parser.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/parser.h
new file mode 100644
index 0000000000..8a6c0ed0b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/parser.h
@@ -0,0 +1,17 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API ParserException : public Exception {
+public:
+    static constexpr const char* ERROR_PREFIX = "Parser exception: ";
+
+    explicit ParserException(const std::string& msg) : Exception(ERROR_PREFIX + msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/runtime.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/runtime.h
new file mode 100644
index 0000000000..fcb2530599
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/runtime.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API RuntimeException : public Exception {
+public:
+    explicit RuntimeException(const std::string& msg) : Exception("Runtime exception: " + msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/storage.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/storage.h
new file mode 100644
index 0000000000..eafedc76cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/storage.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API StorageException : public Exception {
+public:
+    explicit StorageException(const std::string& msg) : Exception("Storage exception: " + msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/test.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/test.h
new file mode 100644
index 0000000000..046413a8bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/test.h
@@ -0,0 +1,14 @@
+#pragma once
+
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class TestException : public Exception {
+public:
+    explicit TestException(const std::string& msg) : Exception("Test exception: " + msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/transaction_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/transaction_manager.h
new file mode 100644
index 0000000000..4496c2535e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/exception/transaction_manager.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/api.h"
+#include "exception.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API TransactionManagerException : public Exception {
+public:
+    explicit TransactionManagerException(const std::string& msg) : Exception(msg){};
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/compressed_file_system.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/compressed_file_system.h
new file mode 100644
index 0000000000..204b1738ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/compressed_file_system.h
@@ -0,0 +1,84 @@
+#pragma once
+
+#include "common/file_system/file_system.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace common {
+
+struct StreamData {
+    bool refresh = false;
+    std::unique_ptr<uint8_t[]> inputBuf;
+    std::unique_ptr<uint8_t[]> outputBuf;
+    uint8_t* inputBufStart = nullptr;
+    uint8_t* inputBufEnd = nullptr;
+    uint8_t* outputBufStart = nullptr;
+    uint8_t* outputBufEnd = nullptr;
+    common::idx_t inputBufSize = 0;
+    common::idx_t outputBufSize = 0;
+};
+
+struct CompressedFileInfo;
+
+struct StreamWrapper {
+    virtual ~StreamWrapper() = default;
+    virtual void initialize(CompressedFileInfo& file) = 0;
+    virtual bool read(StreamData& stream_data) = 0;
+    virtual void close() = 0;
+};
+
+class CompressedFileSystem : public FileSystem {
+public:
+    virtual std::unique_ptr<FileInfo> openCompressedFile(std::unique_ptr<FileInfo> fileInfo) = 0;
+    virtual std::unique_ptr<StreamWrapper> createStream() = 0;
+    virtual idx_t getInputBufSize() = 0;
+    virtual idx_t getOutputBufSize() = 0;
+
+    bool canPerformSeek() const override { return false; }
+
+protected:
+    std::vector<std::string> glob(main::ClientContext* /*context*/,
+        const std::string& /*path*/) const override {
+        KU_UNREACHABLE;
+    }
+
+    void readFromFile(FileInfo& /*fileInfo*/, void* /*buffer*/, uint64_t /*numBytes*/,
+        uint64_t /*position*/) const override;
+
+    int64_t readFile(FileInfo& fileInfo, void* buf, size_t numBytes) const override;
+
+    void writeFile(FileInfo& /*fileInfo*/, const uint8_t* /*buffer*/, uint64_t /*numBytes*/,
+        uint64_t /*offset*/) const override {
+        KU_UNREACHABLE;
+    }
+
+    void reset(FileInfo& fileInfo) override;
+
+    int64_t seek(FileInfo& /*fileInfo*/, uint64_t /*offset*/, int /*whence*/) const override {
+        KU_UNREACHABLE;
+    }
+
+    uint64_t getFileSize(const FileInfo& fileInfo) const override;
+
+    void syncFile(const FileInfo& fileInfo) const override;
+};
+
+struct CompressedFileInfo : public FileInfo {
+    CompressedFileSystem& compressedFS;
+    std::unique_ptr<FileInfo> childFileInfo;
+    StreamData streamData;
+    idx_t currentPos = 0;
+    std::unique_ptr<StreamWrapper> stream_wrapper;
+
+    CompressedFileInfo(CompressedFileSystem& compressedFS, std::unique_ptr<FileInfo> childFileInfo)
+        : FileInfo{childFileInfo->path, &compressedFS}, compressedFS{compressedFS},
+          childFileInfo{std::move(childFileInfo)} {}
+    ~CompressedFileInfo() override { close(); }
+
+    void initialize();
+    int64_t readData(void* buffer, size_t numBytes);
+    void close();
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/file_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/file_info.h
new file mode 100644
index 0000000000..8c3926f1a8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/file_info.h
@@ -0,0 +1,67 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+#include "common/api.h"
+#include "common/cast.h"
+#include "function/table/table_function.h"
+
+namespace lbug {
+namespace common {
+
+class FileSystem;
+
+struct LBUG_API FileInfo {
+    FileInfo(std::string path, FileSystem* fileSystem)
+        : path{std::move(path)}, fileSystem{fileSystem} {}
+
+    virtual ~FileInfo() = default;
+
+    uint64_t getFileSize() const;
+
+    void readFromFile(void* buffer, uint64_t numBytes, uint64_t position);
+
+    int64_t readFile(void* buf, size_t nbyte);
+
+    void writeFile(const uint8_t* buffer, uint64_t numBytes, uint64_t offset);
+
+    void syncFile() const;
+
+    int64_t seek(uint64_t offset, int whence);
+
+    void reset();
+
+    void truncate(uint64_t size);
+
+    bool canPerformSeek() const;
+
+    virtual function::TableFunction getHandleFunction() const { KU_UNREACHABLE; }
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+    const std::string path;
+
+    FileSystem* fileSystem;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/file_system.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/file_system.h
new file mode 100644
index 0000000000..6a83bb88a1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/file_system.h
@@ -0,0 +1,134 @@
+#pragma once
+
+#include <filesystem>
+#include <vector>
+
+#include "common/assert.h"
+#include "common/cast.h"
+#include "file_info.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+} // namespace main
+
+namespace common {
+
+enum class FileLockType : uint8_t { NO_LOCK = 0, READ_LOCK = 1, WRITE_LOCK = 2 };
+
+enum class FileCompressionType : uint8_t { AUTO_DETECT = 0, UNCOMPRESSED = 1, GZIP = 2, ZSTD = 3 };
+
+struct FileFlags {
+    static constexpr uint8_t READ_ONLY = 1 << 0;
+    static constexpr uint8_t WRITE = 1 << 1;
+    // Create file if not exists, can only be used together with WRITE
+    static constexpr uint8_t CREATE_IF_NOT_EXISTS = 1 << 3;
+    // Always create a new file. If a file exists, the file is truncated. Cannot be used together
+    // with CREATE_IF_NOT_EXISTS.
+    static constexpr uint8_t CREATE_AND_TRUNCATE_IF_EXISTS = 1 << 4;
+    // Temporary file that is not persisted to disk.
+    static constexpr uint8_t TEMPORARY = 1 << 5;
+#ifdef _WIN32
+    // Only used in windows to open files in binary mode.
+    static constexpr uint8_t BINARY = 1 << 5;
+#endif
+};
+
+struct FileOpenFlags {
+    int flags;
+    FileLockType lockType = FileLockType::NO_LOCK;
+    FileCompressionType compressionType = FileCompressionType::AUTO_DETECT;
+
+    explicit FileOpenFlags(int flags) : flags{flags} {}
+    explicit FileOpenFlags(int flags, FileLockType lockType) : flags{flags}, lockType{lockType} {}
+};
+
+class LBUG_API FileSystem {
+    friend struct FileInfo;
+
+public:
+    FileSystem() = default;
+
+    explicit FileSystem(std::string homeDir) : dbPath(std::move(homeDir)) {}
+
+    virtual ~FileSystem() = default;
+
+    virtual std::unique_ptr<FileInfo> openFile(const std::string& /*path*/, FileOpenFlags /*flags*/,
+        main::ClientContext* /*context*/ = nullptr) {
+        KU_UNREACHABLE;
+    }
+
+    virtual std::vector<std::string> glob(main::ClientContext* /*context*/,
+        const std::string& /*path*/) const {
+        KU_UNREACHABLE;
+    }
+
+    virtual void overwriteFile(const std::string& from, const std::string& to);
+
+    virtual void copyFile(const std::string& from, const std::string& to);
+
+    virtual void createDir(const std::string& dir) const;
+
+    virtual void removeFileIfExists(const std::string& path,
+        const main::ClientContext* context = nullptr);
+
+    virtual bool fileOrPathExists(const std::string& path, main::ClientContext* context = nullptr);
+
+    virtual std::string expandPath(main::ClientContext* context, const std::string& path) const;
+
+    static std::string joinPath(const std::string& base, const std::string& part);
+
+    static std::string getFileExtension(const std::filesystem::path& path);
+
+    static bool isCompressedFile(const std::filesystem::path& path);
+
+    static std::string getFileName(const std::filesystem::path& path);
+
+    virtual bool canHandleFile(const std::string_view /*path*/) const { KU_UNREACHABLE; }
+
+    virtual void syncFile(const FileInfo& fileInfo) const = 0;
+
+    virtual bool canPerformSeek() const { return true; }
+
+    virtual bool handleFileViaFunction(const std::string& /*path*/) const { return false; }
+
+    virtual function::TableFunction getHandleFunction(const std::string& /*path*/) const {
+        KU_UNREACHABLE;
+    }
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+
+    virtual void cleanUP(main::ClientContext* /*context*/) {}
+
+protected:
+    virtual void readFromFile(FileInfo& fileInfo, void* buffer, uint64_t numBytes,
+        uint64_t position) const = 0;
+
+    virtual int64_t readFile(FileInfo& fileInfo, void* buf, size_t numBytes) const = 0;
+
+    virtual void writeFile(FileInfo& fileInfo, const uint8_t* buffer, uint64_t numBytes,
+        uint64_t offset) const;
+
+    virtual int64_t seek(FileInfo& fileInfo, uint64_t offset, int whence) const = 0;
+
+    virtual void reset(FileInfo& fileInfo);
+
+    virtual void truncate(FileInfo& fileInfo, uint64_t size) const;
+
+    virtual uint64_t getFileSize(const FileInfo& fileInfo) const = 0;
+
+    static bool isGZIPCompressed(const std::filesystem::path& path);
+
+    std::string dbPath;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/gzip_file_system.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/gzip_file_system.h
new file mode 100644
index 0000000000..5e402a2198
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/gzip_file_system.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include "compressed_file_system.h"
+
+namespace lbug {
+namespace common {
+
+class GZipFileSystem : public CompressedFileSystem {
+public:
+    static constexpr const idx_t BUFFER_SIZE = 1u << 15; // 32 KB
+    static constexpr const uint8_t GZIP_COMPRESSION_DEFLATE = 0x08;
+    static constexpr const uint8_t GZIP_FLAG_ASCII = 0x1;
+    static constexpr const uint8_t GZIP_FLAG_MULTIPART = 0x2;
+    static constexpr const uint8_t GZIP_FLAG_EXTRA = 0x4;
+    static constexpr const uint8_t GZIP_FLAG_NAME = 0x8;
+    static constexpr const uint8_t GZIP_FLAG_COMMENT = 0x10;
+    static constexpr const uint8_t GZIP_FLAG_ENCRYPT = 0x20;
+    static constexpr const uint8_t GZIP_HEADER_MINSIZE = 10;
+    static constexpr const idx_t GZIP_HEADER_MAXSIZE = 1u << 15;
+    static constexpr const uint8_t GZIP_FOOTER_SIZE = 8;
+    static constexpr const unsigned char GZIP_FLAG_UNSUPPORTED =
+        GZIP_FLAG_ASCII | GZIP_FLAG_MULTIPART | GZIP_FLAG_COMMENT | GZIP_FLAG_ENCRYPT;
+
+public:
+    std::unique_ptr<FileInfo> openCompressedFile(std::unique_ptr<FileInfo> fileInfo) override;
+
+    std::unique_ptr<StreamWrapper> createStream() override;
+    idx_t getInputBufSize() override { return BUFFER_SIZE; }
+    idx_t getOutputBufSize() override { return BUFFER_SIZE; }
+};
+
+struct GZIPFileInfo : public CompressedFileInfo {
+    GZIPFileInfo(CompressedFileSystem& compressedFS, std::unique_ptr<FileInfo> childFileInfo)
+        : CompressedFileInfo{compressedFS, std::move(childFileInfo)} {
+        initialize();
+    }
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/local_file_system.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/local_file_system.h
new file mode 100644
index 0000000000..62f37d505a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/local_file_system.h
@@ -0,0 +1,74 @@
+#pragma once
+
+#include <vector>
+
+#include "file_system.h"
+
+namespace lbug {
+namespace common {
+
+struct LocalFileInfo final : FileInfo {
+#ifdef _WIN32
+    LocalFileInfo(std::string path, const void* handle, FileSystem* fileSystem)
+        : FileInfo{std::move(path), fileSystem}, handle{handle} {}
+#else
+    LocalFileInfo(std::string path, const int fd, FileSystem* fileSystem)
+        : FileInfo{std::move(path), fileSystem}, fd{fd} {}
+#endif
+
+    ~LocalFileInfo() override;
+
+#ifdef _WIN32
+    const void* handle;
+#else
+    const int fd;
+#endif
+};
+
+class LBUG_API LocalFileSystem final : public FileSystem {
+public:
+    explicit LocalFileSystem(std::string homeDir) : FileSystem(std::move(homeDir)) {}
+
+    std::unique_ptr<FileInfo> openFile(const std::string& path, FileOpenFlags flags,
+        main::ClientContext* context = nullptr) override;
+
+    std::vector<std::string> glob(main::ClientContext* context,
+        const std::string& path) const override;
+
+    void overwriteFile(const std::string& from, const std::string& to) override;
+
+    void copyFile(const std::string& from, const std::string& to) override;
+
+    void createDir(const std::string& dir) const override;
+
+    void removeFileIfExists(const std::string& path,
+        const main::ClientContext* context = nullptr) override;
+
+    bool fileOrPathExists(const std::string& path, main::ClientContext* context = nullptr) override;
+
+    std::string expandPath(main::ClientContext* context, const std::string& path) const override;
+
+    void syncFile(const FileInfo& fileInfo) const override;
+
+    static bool isLocalPath(const std::string& path);
+
+    static bool fileExists(const std::string& filename);
+
+protected:
+    void readFromFile(FileInfo& fileInfo, void* buffer, uint64_t numBytes,
+        uint64_t position) const override;
+
+    int64_t readFile(FileInfo& fileInfo, void* buf, size_t nbyte) const override;
+
+    void writeFile(FileInfo& fileInfo, const uint8_t* buffer, uint64_t numBytes,
+        uint64_t offset) const override;
+
+    int64_t seek(FileInfo& fileInfo, uint64_t offset, int whence) const override;
+
+    void truncate(FileInfo& fileInfo, uint64_t size) const override;
+
+    uint64_t getFileSize(const FileInfo& fileInfo) const override;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/virtual_file_system.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/virtual_file_system.h
new file mode 100644
index 0000000000..97aa5df540
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/file_system/virtual_file_system.h
@@ -0,0 +1,86 @@
+#pragma once
+
+#include <memory>
+#include <unordered_map>
+#include <vector>
+
+#include "compressed_file_system.h"
+#include "file_system.h"
+
+namespace lbug {
+namespace main {
+class Database;
+}
+
+namespace storage {
+class BufferManager;
+};
+namespace common {
+
+class LBUG_API VirtualFileSystem final : public FileSystem {
+    friend class storage::BufferManager;
+
+public:
+    VirtualFileSystem();
+    explicit VirtualFileSystem(std::string homeDir);
+
+    ~VirtualFileSystem() override;
+
+    void registerFileSystem(std::unique_ptr<FileSystem> fileSystem);
+
+    std::unique_ptr<FileInfo> openFile(const std::string& path, FileOpenFlags flags,
+        main::ClientContext* context = nullptr) override;
+
+    std::vector<std::string> glob(main::ClientContext* context,
+        const std::string& path) const override;
+
+    void overwriteFile(const std::string& from, const std::string& to) override;
+
+    void createDir(const std::string& dir) const override;
+
+    void removeFileIfExists(const std::string& path,
+        const main::ClientContext* context = nullptr) override;
+
+    bool fileOrPathExists(const std::string& path, main::ClientContext* context = nullptr) override;
+
+    std::string expandPath(main::ClientContext* context, const std::string& path) const override;
+
+    void syncFile(const FileInfo& fileInfo) const override;
+
+    void cleanUP(main::ClientContext* context) override;
+
+    bool handleFileViaFunction(const std::string& path) const override;
+
+    function::TableFunction getHandleFunction(const std::string& path) const override;
+
+    static VirtualFileSystem* GetUnsafe(const main::ClientContext& context);
+
+protected:
+    void readFromFile(FileInfo& fileInfo, void* buffer, uint64_t numBytes,
+        uint64_t position) const override;
+
+    int64_t readFile(FileInfo& fileInfo, void* buf, size_t nbyte) const override;
+
+    void writeFile(FileInfo& fileInfo, const uint8_t* buffer, uint64_t numBytes,
+        uint64_t offset) const override;
+
+    int64_t seek(FileInfo& fileInfo, uint64_t offset, int whence) const override;
+
+    void truncate(FileInfo& fileInfo, uint64_t size) const override;
+
+    uint64_t getFileSize(const FileInfo& fileInfo) const override;
+
+private:
+    FileSystem* findFileSystem(const std::string& path) const;
+
+    static FileCompressionType autoDetectCompressionType(const std::string& path);
+
+private:
+    std::vector<std::unique_ptr<FileSystem>> subSystems;
+    std::unique_ptr<FileSystem> defaultFS;
+    std::unordered_map<FileCompressionType, std::unique_ptr<CompressedFileSystem>>
+        compressedFileSystem;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/finally_wrapper.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/finally_wrapper.h
new file mode 100644
index 0000000000..3136a32583
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/finally_wrapper.h
@@ -0,0 +1,14 @@
+#pragma once
+
+#include <concepts>
+
+namespace lbug::common {
+// RAII wrapper that calls an enclosed function when this class goes out of scope
+// Should be used for any cleanup code that must be executed even if exceptions occur
+template<std::invocable Func>
+struct FinallyWrapper {
+    explicit FinallyWrapper(Func&& func) : func(func) {}
+    ~FinallyWrapper() { func(); }
+    Func func;
+};
+} // namespace lbug::common
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/in_mem_overflow_buffer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/in_mem_overflow_buffer.h
new file mode 100644
index 0000000000..8fa2c8e526
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/in_mem_overflow_buffer.h
@@ -0,0 +1,78 @@
+#pragma once
+
+#include <iterator>
+#include <memory>
+#include <vector>
+
+#include "common/api.h"
+#include "common/copy_constructors.h"
+
+namespace lbug {
+namespace storage {
+class MemoryBuffer;
+class MemoryManager;
+} // namespace storage
+
+namespace common {
+
+struct LBUG_API BufferBlock {
+public:
+    explicit BufferBlock(std::unique_ptr<storage::MemoryBuffer> block);
+    ~BufferBlock();
+
+    uint64_t size() const;
+    uint8_t* data() const;
+
+public:
+    uint64_t currentOffset;
+    std::unique_ptr<storage::MemoryBuffer> block;
+
+    void resetCurrentOffset() { currentOffset = 0; }
+};
+
+class LBUG_API InMemOverflowBuffer {
+
+public:
+    explicit InMemOverflowBuffer(storage::MemoryManager* memoryManager)
+        : memoryManager{memoryManager} {};
+
+    DEFAULT_BOTH_MOVE(InMemOverflowBuffer);
+
+    uint8_t* allocateSpace(uint64_t size);
+
+    void merge(InMemOverflowBuffer& other) {
+        move(begin(other.blocks), end(other.blocks), back_inserter(blocks));
+        // We clear the other InMemOverflowBuffer's block because when it is deconstructed,
+        // InMemOverflowBuffer's deconstructed tries to free these pages by calling
+        // memoryManager->freeBlock, but it should not because this InMemOverflowBuffer still
+        // needs them.
+        other.blocks.clear();
+    }
+
+    // Releases all memory accumulated for string overflows so far and re-initializes its state to
+    // an empty buffer. If there is a large string that used point to any of these overflow buffers
+    // they will error.
+    void resetBuffer();
+
+    // Manually set the underlying memory buffer to evicted to avoid double free
+    void preventDestruction();
+
+    storage::MemoryManager* getMemoryManager() { return memoryManager; }
+
+private:
+    bool requireNewBlock(uint64_t sizeToAllocate) {
+        return blocks.empty() ||
+               (currentBlock()->currentOffset + sizeToAllocate) > currentBlock()->size();
+    }
+
+    void allocateNewBlock(uint64_t size);
+
+    BufferBlock* currentBlock() { return blocks.back().get(); }
+
+private:
+    std::vector<std::unique_ptr<BufferBlock>> blocks;
+    storage::MemoryManager* memoryManager;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/mask.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/mask.h
new file mode 100644
index 0000000000..3c4855019d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/mask.h
@@ -0,0 +1,91 @@
+#pragma once
+
+#include "common/types/types.h"
+
+namespace lbug {
+namespace common {
+
+// Note that this class is NOT thread-safe.
+class SemiMask {
+public:
+    explicit SemiMask(offset_t maxOffset) : maxOffset{maxOffset}, enabled{false} {}
+
+    virtual ~SemiMask() = default;
+
+    virtual void mask(offset_t nodeOffset) = 0;
+    virtual void maskRange(offset_t startNodeOffset, offset_t endNodeOffset) = 0;
+
+    virtual bool isMasked(offset_t startNodeOffset) = 0;
+
+    // include&exclude
+    virtual offset_vec_t range(uint32_t start, uint32_t end) = 0;
+
+    virtual uint64_t getNumMaskedNodes() const = 0;
+
+    virtual offset_vec_t collectMaskedNodes(uint64_t size) const = 0;
+
+    offset_t getMaxOffset() const { return maxOffset; }
+
+    bool isEnabled() const { return enabled; }
+    void enable() { enabled = true; }
+
+private:
+    offset_t maxOffset;
+    bool enabled;
+};
+
+struct SemiMaskUtil {
+    LBUG_API static std::unique_ptr<SemiMask> createMask(offset_t maxOffset);
+};
+
+class NodeOffsetMaskMap {
+public:
+    NodeOffsetMaskMap() = default;
+
+    offset_t getNumMaskedNode() const;
+
+    void addMask(table_id_t tableID, std::unique_ptr<SemiMask> mask) {
+        KU_ASSERT(!maskMap.contains(tableID));
+        maskMap.insert({tableID, std::move(mask)});
+    }
+
+    table_id_map_t<SemiMask*> getMasks() const {
+        table_id_map_t<SemiMask*> result;
+        for (auto& [tableID, mask] : maskMap) {
+            result.emplace(tableID, mask.get());
+        }
+        return result;
+    }
+
+    bool containsTableID(table_id_t tableID) const { return maskMap.contains(tableID); }
+    SemiMask* getOffsetMask(table_id_t tableID) const {
+        KU_ASSERT(containsTableID(tableID));
+        return maskMap.at(tableID).get();
+    }
+
+    void pin(table_id_t tableID) {
+        if (maskMap.contains(tableID)) {
+            pinnedMask = maskMap.at(tableID).get();
+        } else {
+            pinnedMask = nullptr;
+        }
+    }
+    bool hasPinnedMask() const { return pinnedMask != nullptr; }
+    SemiMask* getPinnedMask() const { return pinnedMask; }
+
+    bool valid(offset_t offset) const {
+        KU_ASSERT(pinnedMask != nullptr);
+        return pinnedMask->isMasked(offset);
+    }
+    bool valid(nodeID_t nodeID) const {
+        KU_ASSERT(maskMap.contains(nodeID.tableID));
+        return maskMap.at(nodeID.tableID)->isMasked(nodeID.offset);
+    }
+
+private:
+    table_id_map_t<std::unique_ptr<SemiMask>> maskMap;
+    SemiMask* pinnedMask = nullptr;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/md5.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/md5.h
new file mode 100644
index 0000000000..858a3da11c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/md5.h
@@ -0,0 +1,97 @@
+#pragma once
+
+/*
+** This code taken from the SQLite test library (can be found at
+** https://www.sqlite.org/sqllogictest/doc/trunk/about.wiki).
+** Originally found on the internet. The original header comment follows this comment.
+** The code has been refactored, but the algorithm stays the same.
+*/
+/*
+ * This code implements the MD5 message-digest algorithm.
+ * The algorithm is due to Ron Rivest.  This code was
+ * written by Colin Plumb in 1993, no copyright is claimed.
+ * This code is in the public domain; do with it what you wish.
+ *
+ * Equivalent code is available from RSA Data Security, Inc.
+ * This code has been tested against that, and is equivalent,
+ * except that you don't need to include two pages of legalese
+ * with every copy.
+ *
+ * To compute the message digest of a chunk of bytes, declare an
+ * MD5Context structure, pass it to MD5Init, call MD5Update as
+ * needed on buffers full of bytes, and then call MD5Final, which
+ * will fill a supplied 16-byte array with the digest.
+ */
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+class MD5 {
+    struct Context {
+        int isInit;
+        uint32_t buf[4];
+        uint32_t bits[2];
+        unsigned char in[64];
+    };
+    typedef struct Context MD5Context;
+
+    // Status of an MD5 hash. - changed from static global variables to private members
+    MD5Context ctx{};
+    int isInit = 0;
+    char zResult[34] = "";
+
+    // Note: this code is harmless on little-endian machines.
+    void byteReverse(unsigned char* buf, unsigned longs);
+
+    // The core of the MD5 algorithm, this alters an existing MD5 hash to
+    // reflect the addition of 16 longwords of new data.  MD5Update blocks
+    // the data and converts bytes into longwords for this routine.
+    void MD5Transform(uint32_t buf[4], const uint32_t in[16]);
+
+    // Start MD5 accumulation.  Set bit count to 0 and buffer to mysterious
+    // initialization constants.
+    void MD5Init();
+
+    // Update context to reflect the concatenation of another buffer full
+    // of bytes.
+    void MD5Update(const unsigned char* buf, unsigned int len);
+
+    // Final wrapup - pad to 64-byte boundary with the bit pattern
+    // 1 0* (64-bit count of bits processed, MSB-first)
+    void MD5Final(unsigned char digest[16]);
+
+    // Convert a digest into base-16.  digest should be declared as
+    // "unsigned char digest[16]" in the calling function.  The MD5
+    // digest is stored in the first 16 bytes.  zBuf should
+    // be "char zBuf[33]".
+    static void DigestToBase16(const unsigned char* digest, char* zBuf);
+
+public:
+    // Add additional text to the current MD5 hash.
+    // note: original name changed from md5_add
+    void addToMD5(const char* z, uint32_t len) {
+        if (!isInit) {
+            MD5Init();
+            isInit = 1;
+        }
+        MD5Update((unsigned char*)z, len);
+    }
+
+    // Compute the final signature.  Reset the hash generator in preparation
+    // for the next round.
+    // note: original name changed from md5_finish
+    const char* finishMD5() {
+        if (isInit) {
+            unsigned char digest[16];
+            MD5Final(digest);
+            isInit = 0;
+            DigestToBase16(digest, zResult);
+        }
+        return zResult;
+    }
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/metric.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/metric.h
new file mode 100644
index 0000000000..d7e78366d2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/metric.h
@@ -0,0 +1,52 @@
+#pragma once
+
+#include "common/timer.h"
+
+namespace lbug {
+namespace common {
+
+/**
+ * Note that metrics are not thread safe.
+ */
+class Metric {
+
+public:
+    explicit Metric(bool enabled) : enabled{enabled} {}
+
+    virtual ~Metric() = default;
+
+public:
+    bool enabled;
+};
+
+class TimeMetric : public Metric {
+
+public:
+    explicit TimeMetric(bool enable);
+
+    void start();
+    void stop();
+
+    double getElapsedTimeMS() const;
+
+public:
+    double accumulatedTime;
+    bool isStarted;
+    Timer timer;
+};
+
+class NumericMetric : public Metric {
+
+public:
+    explicit NumericMetric(bool enable);
+
+    void increase(uint64_t value);
+
+    void incrementByOne();
+
+public:
+    uint64_t accumulatedValue;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/mpsc_queue.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/mpsc_queue.h
new file mode 100644
index 0000000000..8c8957977c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/mpsc_queue.h
@@ -0,0 +1,107 @@
+#pragma once
+
+// Based on the following design:
+// https://www.1024cores.net/home/lock-free-algorithms/queues/non-intrusive-mpsc-node-based-queue
+
+#include <atomic>
+
+#include "common/assert.h"
+#include "common/copy_constructors.h"
+
+namespace lbug {
+namespace common {
+
+// Producers are completely wait-free.
+template<typename T>
+class MPSCQueue {
+    struct Node {
+        T data;
+        std::atomic<Node*> next;
+
+        explicit Node(T data) : data(std::move(data)), next(nullptr) {}
+    };
+
+public:
+    MPSCQueue() : head(nullptr), tail(nullptr), _approxSize(0) {
+        // Allocate a dummy element.
+        Node* stub = new Node(T());
+        head = stub;
+
+        // Ordering doesn't matter.
+        tail.store(stub, std::memory_order_relaxed);
+    }
+    DELETE_BOTH_COPY(MPSCQueue);
+    MPSCQueue(MPSCQueue&& other)
+        : head(other.head), tail(other.tail.exchange(nullptr, std::memory_order_relaxed)),
+          _approxSize(other._approxSize.load(std::memory_order_relaxed)) {
+        other.head = nullptr;
+    }
+    // If this method existed, it wouldn't be atomic, and so would be rather error-prone. Maybe
+    // there's a valid future use case.
+    DELETE_MOVE_ASSN(MPSCQueue);
+
+    // NOTE: It is NOT guaranteed that the result of a push() is accessible to a thread that calls
+    // pop() after the push(), because of implementation details. See the body of the function for
+    // details.
+    void push(T elem) {
+        Node* node = new Node(std::move(elem));
+        _approxSize.fetch_add(1, std::memory_order_relaxed);
+        // ORDERING: must acquire any updates to prev before modifying it, and release our updates
+        // to node for other producers.
+        Node* prev = tail.exchange(node, std::memory_order_acq_rel);
+        // NOTE: If the thread is suspended here, then ALL FUTURE push() calls will be INACCESSIBLE
+        // by pop() calls until the next line runs. In order to guarantee that a push() is visible
+        // to a thread that calls pop(), ALL push() calls must have completed.
+        // ORDERING: must make updates visible to consumers.
+        prev->next.store(node, std::memory_order_release);
+    }
+
+    // NOTE: It is NOT safe to call pop() from multiple threads without synchronization.
+    bool pop(T& elem) {
+        // ORDERING: Acquire any updates made by producers.
+        // Note that head is accessed only by the single consumer, so accesses to it need not be
+        // synchronized.
+        Node* next = head->next.load(std::memory_order_acquire);
+        if (next == nullptr) {
+            return false;
+        }
+        // Free the old element.
+        delete head;
+        head = next;
+        elem = std::move(head->data);
+        _approxSize.fetch_sub(1, std::memory_order_relaxed);
+        // Now the current head has dummy data in it again (i.e., whatever was leftover after the
+        // move()).
+        return true;
+    }
+
+    // Return an approximation of the number of elements in the queue.
+    // Due to implementation details, this number must not be relied on. However, it can be used to
+    // get a rough estimate for the size of the queue.
+    size_t approxSize() const { return _approxSize.load(std::memory_order_relaxed); }
+
+    // Drain the queue. All operations on the queue MUST have finished. I.e., there must be NO
+    // push() or pop() operations in progress of any kind.
+    ~MPSCQueue() {
+        // If we were moved out of, return.
+        if (!head) {
+            return;
+        }
+
+        T dummy;
+        while (pop(dummy)) {}
+        KU_ASSERT(head == tail.load(std::memory_order_relaxed));
+        delete head;
+    }
+
+private:
+    // Head is always present, but always has dummy data. This ensures that it is always easy to
+    // append to the list, without branching in the methods.
+    Node* head;
+    std::atomic<Node*> tail;
+
+    std::atomic<size_t> _approxSize;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/mutex.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/mutex.h
new file mode 100644
index 0000000000..b5ede2b97e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/mutex.h
@@ -0,0 +1,61 @@
+#pragma once
+
+#include <mutex>
+#include <optional>
+
+#include "common/copy_constructors.h"
+
+namespace lbug {
+namespace common {
+
+template<typename T>
+class MutexGuard {
+    template<typename T2>
+    friend class Mutex;
+    MutexGuard(T& data, std::unique_lock<std::mutex> lck) : data(&data), lck(std::move(lck)) {}
+
+public:
+    DELETE_COPY_DEFAULT_MOVE(MutexGuard);
+
+    T* operator->() & { return data; }
+    T& operator*() & { return *data; }
+    T* get() & { return data; }
+
+    // Must not call these operators on a temporary MutexGuard!
+    // Guards _must_ be held while accessing the inner data.
+    T* operator->() && = delete;
+    T& operator*() && = delete;
+    T* get() && = delete;
+
+private:
+    T* data;
+    std::unique_lock<std::mutex> lck;
+};
+
+template<typename T>
+class Mutex {
+public:
+    Mutex() : data() {}
+    explicit Mutex(T data) : data(std::move(data)) {}
+    DELETE_COPY_AND_MOVE(Mutex);
+
+    MutexGuard<T> lock() {
+        std::unique_lock lck{mtx};
+        return MutexGuard(data, std::move(lck));
+    }
+
+    std::optional<MutexGuard<T>> try_lock() {
+        if (!mtx.try_lock()) {
+            return std::nullopt;
+        }
+        std::unique_lock lck{mtx, std::adopt_lock};
+        return MutexGuard(data, std::move(lck));
+    }
+
+private:
+    T data;
+    std::mutex mtx;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/null_buffer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/null_buffer.h
new file mode 100644
index 0000000000..cb82ddc5b3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/null_buffer.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include <cstdint>
+#include <cstring>
+
+namespace lbug {
+namespace common {
+
+class NullBuffer {
+
+public:
+    constexpr static const uint64_t NUM_NULL_MASKS_PER_BYTE = 8;
+
+    static inline bool isNull(const uint8_t* nullBytes, uint64_t valueIdx) {
+        return nullBytes[valueIdx / NUM_NULL_MASKS_PER_BYTE] &
+               (1 << (valueIdx % NUM_NULL_MASKS_PER_BYTE));
+    }
+
+    static inline void setNull(uint8_t* nullBytes, uint64_t valueIdx) {
+        nullBytes[valueIdx / NUM_NULL_MASKS_PER_BYTE] |=
+            (1 << (valueIdx % NUM_NULL_MASKS_PER_BYTE));
+    }
+
+    static inline void setNoNull(uint8_t* nullBytes, uint64_t valueIdx) {
+        nullBytes[valueIdx / NUM_NULL_MASKS_PER_BYTE] &=
+            ~(1 << (valueIdx % NUM_NULL_MASKS_PER_BYTE));
+    }
+
+    static inline uint64_t getNumBytesForNullValues(uint64_t numValues) {
+        return (numValues + NUM_NULL_MASKS_PER_BYTE - 1) / NUM_NULL_MASKS_PER_BYTE;
+    }
+
+    static inline void initNullBytes(uint8_t* nullBytes, uint64_t numValues) {
+        memset(nullBytes, 0 /* value */, getNumBytesForNullValues(numValues));
+    }
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/null_mask.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/null_mask.h
new file mode 100644
index 0000000000..5395e47089
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/null_mask.h
@@ -0,0 +1,194 @@
+#pragma once
+
+#include <cstdint>
+#include <memory>
+
+#include "common/assert.h"
+#include <span>
+
+namespace lbug {
+namespace common {
+
+class ArrowNullMaskTree;
+class Serializer;
+class Deserializer;
+
+constexpr uint64_t NULL_BITMASKS_WITH_SINGLE_ONE[64] = {0x1, 0x2, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80,
+    0x100, 0x200, 0x400, 0x800, 0x1000, 0x2000, 0x4000, 0x8000, 0x10000, 0x20000, 0x40000, 0x80000,
+    0x100000, 0x200000, 0x400000, 0x800000, 0x1000000, 0x2000000, 0x4000000, 0x8000000, 0x10000000,
+    0x20000000, 0x40000000, 0x80000000, 0x100000000, 0x200000000, 0x400000000, 0x800000000,
+    0x1000000000, 0x2000000000, 0x4000000000, 0x8000000000, 0x10000000000, 0x20000000000,
+    0x40000000000, 0x80000000000, 0x100000000000, 0x200000000000, 0x400000000000, 0x800000000000,
+    0x1000000000000, 0x2000000000000, 0x4000000000000, 0x8000000000000, 0x10000000000000,
+    0x20000000000000, 0x40000000000000, 0x80000000000000, 0x100000000000000, 0x200000000000000,
+    0x400000000000000, 0x800000000000000, 0x1000000000000000, 0x2000000000000000,
+    0x4000000000000000, 0x8000000000000000};
+constexpr uint64_t NULL_BITMASKS_WITH_SINGLE_ZERO[64] = {0xfffffffffffffffe, 0xfffffffffffffffd,
+    0xfffffffffffffffb, 0xfffffffffffffff7, 0xffffffffffffffef, 0xffffffffffffffdf,
+    0xffffffffffffffbf, 0xffffffffffffff7f, 0xfffffffffffffeff, 0xfffffffffffffdff,
+    0xfffffffffffffbff, 0xfffffffffffff7ff, 0xffffffffffffefff, 0xffffffffffffdfff,
+    0xffffffffffffbfff, 0xffffffffffff7fff, 0xfffffffffffeffff, 0xfffffffffffdffff,
+    0xfffffffffffbffff, 0xfffffffffff7ffff, 0xffffffffffefffff, 0xffffffffffdfffff,
+    0xffffffffffbfffff, 0xffffffffff7fffff, 0xfffffffffeffffff, 0xfffffffffdffffff,
+    0xfffffffffbffffff, 0xfffffffff7ffffff, 0xffffffffefffffff, 0xffffffffdfffffff,
+    0xffffffffbfffffff, 0xffffffff7fffffff, 0xfffffffeffffffff, 0xfffffffdffffffff,
+    0xfffffffbffffffff, 0xfffffff7ffffffff, 0xffffffefffffffff, 0xffffffdfffffffff,
+    0xffffffbfffffffff, 0xffffff7fffffffff, 0xfffffeffffffffff, 0xfffffdffffffffff,
+    0xfffffbffffffffff, 0xfffff7ffffffffff, 0xffffefffffffffff, 0xffffdfffffffffff,
+    0xffffbfffffffffff, 0xffff7fffffffffff, 0xfffeffffffffffff, 0xfffdffffffffffff,
+    0xfffbffffffffffff, 0xfff7ffffffffffff, 0xffefffffffffffff, 0xffdfffffffffffff,
+    0xffbfffffffffffff, 0xff7fffffffffffff, 0xfeffffffffffffff, 0xfdffffffffffffff,
+    0xfbffffffffffffff, 0xf7ffffffffffffff, 0xefffffffffffffff, 0xdfffffffffffffff,
+    0xbfffffffffffffff, 0x7fffffffffffffff};
+
+const uint64_t NULL_LOWER_MASKS[65] = {0x0, 0x1, 0x3, 0x7, 0xf, 0x1f, 0x3f, 0x7f, 0xff, 0x1ff,
+    0x3ff, 0x7ff, 0xfff, 0x1fff, 0x3fff, 0x7fff, 0xffff, 0x1ffff, 0x3ffff, 0x7ffff, 0xfffff,
+    0x1fffff, 0x3fffff, 0x7fffff, 0xffffff, 0x1ffffff, 0x3ffffff, 0x7ffffff, 0xfffffff, 0x1fffffff,
+    0x3fffffff, 0x7fffffff, 0xffffffff, 0x1ffffffff, 0x3ffffffff, 0x7ffffffff, 0xfffffffff,
+    0x1fffffffff, 0x3fffffffff, 0x7fffffffff, 0xffffffffff, 0x1ffffffffff, 0x3ffffffffff,
+    0x7ffffffffff, 0xfffffffffff, 0x1fffffffffff, 0x3fffffffffff, 0x7fffffffffff, 0xffffffffffff,
+    0x1ffffffffffff, 0x3ffffffffffff, 0x7ffffffffffff, 0xfffffffffffff, 0x1fffffffffffff,
+    0x3fffffffffffff, 0x7fffffffffffff, 0xffffffffffffff, 0x1ffffffffffffff, 0x3ffffffffffffff,
+    0x7ffffffffffffff, 0xfffffffffffffff, 0x1fffffffffffffff, 0x3fffffffffffffff,
+    0x7fffffffffffffff, 0xffffffffffffffff};
+const uint64_t NULL_HIGH_MASKS[65] = {0x0, 0x8000000000000000, 0xc000000000000000,
+    0xe000000000000000, 0xf000000000000000, 0xf800000000000000, 0xfc00000000000000,
+    0xfe00000000000000, 0xff00000000000000, 0xff80000000000000, 0xffc0000000000000,
+    0xffe0000000000000, 0xfff0000000000000, 0xfff8000000000000, 0xfffc000000000000,
+    0xfffe000000000000, 0xffff000000000000, 0xffff800000000000, 0xffffc00000000000,
+    0xffffe00000000000, 0xfffff00000000000, 0xfffff80000000000, 0xfffffc0000000000,
+    0xfffffe0000000000, 0xffffff0000000000, 0xffffff8000000000, 0xffffffc000000000,
+    0xffffffe000000000, 0xfffffff000000000, 0xfffffff800000000, 0xfffffffc00000000,
+    0xfffffffe00000000, 0xffffffff00000000, 0xffffffff80000000, 0xffffffffc0000000,
+    0xffffffffe0000000, 0xfffffffff0000000, 0xfffffffff8000000, 0xfffffffffc000000,
+    0xfffffffffe000000, 0xffffffffff000000, 0xffffffffff800000, 0xffffffffffc00000,
+    0xffffffffffe00000, 0xfffffffffff00000, 0xfffffffffff80000, 0xfffffffffffc0000,
+    0xfffffffffffe0000, 0xffffffffffff0000, 0xffffffffffff8000, 0xffffffffffffc000,
+    0xffffffffffffe000, 0xfffffffffffff000, 0xfffffffffffff800, 0xfffffffffffffc00,
+    0xfffffffffffffe00, 0xffffffffffffff00, 0xffffffffffffff80, 0xffffffffffffffc0,
+    0xffffffffffffffe0, 0xfffffffffffffff0, 0xfffffffffffffff8, 0xfffffffffffffffc,
+    0xfffffffffffffffe, 0xffffffffffffffff};
+
+class LBUG_API NullMask {
+public:
+    static constexpr uint64_t NO_NULL_ENTRY = 0;
+    static constexpr uint64_t ALL_NULL_ENTRY = ~uint64_t(NO_NULL_ENTRY);
+    static constexpr uint64_t NUM_BITS_PER_NULL_ENTRY_LOG2 = 6;
+    static constexpr uint64_t NUM_BITS_PER_NULL_ENTRY = (uint64_t)1 << NUM_BITS_PER_NULL_ENTRY_LOG2;
+    static constexpr uint64_t NUM_BYTES_PER_NULL_ENTRY = NUM_BITS_PER_NULL_ENTRY >> 3;
+
+    // For creating a managed null mask
+    explicit NullMask(uint64_t capacity) : mayContainNulls{false} {
+        auto numNullEntries = (capacity + NUM_BITS_PER_NULL_ENTRY - 1) / NUM_BITS_PER_NULL_ENTRY;
+        buffer = std::make_unique<uint64_t[]>(numNullEntries);
+        data = std::span(buffer.get(), numNullEntries);
+        std::fill(data.begin(), data.end(), NO_NULL_ENTRY);
+    }
+
+    // For creating a null mask using existing data
+    explicit NullMask(std::span<uint64_t> nullData, bool mayContainNulls)
+        : data{nullData}, buffer{}, mayContainNulls{mayContainNulls} {}
+
+    inline void setAllNonNull() {
+        if (!mayContainNulls) {
+            return;
+        }
+        std::fill(data.begin(), data.end(), NO_NULL_ENTRY);
+        mayContainNulls = false;
+    }
+    inline void setAllNull() {
+        std::fill(data.begin(), data.end(), ALL_NULL_ENTRY);
+        mayContainNulls = true;
+    }
+
+    inline bool hasNoNullsGuarantee() const { return !mayContainNulls; }
+    uint64_t countNulls() const;
+
+    static void setNull(uint64_t* nullEntries, uint32_t pos, bool isNull);
+    inline void setNull(uint32_t pos, bool isNull) {
+        KU_ASSERT(pos < getNumNullBits(data));
+        setNull(data.data(), pos, isNull);
+        if (isNull) {
+            mayContainNulls = true;
+        }
+    }
+
+    static inline bool isNull(const uint64_t* nullEntries, uint32_t pos) {
+        auto [entryPos, bitPosInEntry] = getNullEntryAndBitPos(pos);
+        return nullEntries[entryPos] & NULL_BITMASKS_WITH_SINGLE_ONE[bitPosInEntry];
+    }
+
+    static uint64_t getNumNullBits(std::span<uint64_t> data) {
+        return data.size() * NullMask::NUM_BITS_PER_NULL_ENTRY;
+    }
+
+    inline bool isNull(uint32_t pos) const {
+        KU_ASSERT(pos < getNumNullBits(data));
+        return isNull(data.data(), pos);
+    }
+
+    // const because updates to the data must set mayContainNulls if any value
+    // becomes non-null
+    // Modifying the underlying data should be done with setNull or copyFromNullData
+    inline const uint64_t* getData() const { return data.data(); }
+
+    static inline uint64_t getNumNullEntries(uint64_t numNullBits) {
+        return (numNullBits >> NUM_BITS_PER_NULL_ENTRY_LOG2) +
+               ((numNullBits - (numNullBits << NUM_BITS_PER_NULL_ENTRY_LOG2)) == 0 ? 0 : 1);
+    }
+
+    // Copies bitpacked null flags from one buffer to another, starting at an arbitrary bit
+    // offset and preserving adjacent bits.
+    //
+    // returns true if we have copied a nullBit with value 1 (indicates a null value) to
+    // dstNullEntries.
+    static bool copyNullMask(const uint64_t* srcNullEntries, uint64_t srcOffset,
+        uint64_t* dstNullEntries, uint64_t dstOffset, uint64_t numBitsToCopy, bool invert = false);
+
+    inline bool copyFrom(const NullMask& nullMask, uint64_t srcOffset, uint64_t dstOffset,
+        uint64_t numBitsToCopy, bool invert = false) {
+        if (nullMask.hasNoNullsGuarantee()) {
+            setNullFromRange(dstOffset, numBitsToCopy, invert);
+            return invert;
+        } else {
+            return copyFromNullBits(nullMask.getData(), srcOffset, dstOffset, numBitsToCopy,
+                invert);
+        }
+    }
+    bool copyFromNullBits(const uint64_t* srcNullEntries, uint64_t srcOffset, uint64_t dstOffset,
+        uint64_t numBitsToCopy, bool invert = false);
+
+    // Sets the given number of bits to null (if isNull is true) or non-null (if isNull is false),
+    // starting at the offset
+    static void setNullRange(uint64_t* nullEntries, uint64_t offset, uint64_t numBitsToSet,
+        bool isNull);
+
+    void setNullFromRange(uint64_t offset, uint64_t numBitsToSet, bool isNull);
+
+    void resize(uint64_t capacity);
+
+    void operator|=(const NullMask& other);
+
+    // Fast calculation of the minimum and maximum null values
+    // (essentially just three states, all null, all non-null and some null)
+    static std::pair<bool, bool> getMinMax(const uint64_t* nullEntries, uint64_t offset,
+        uint64_t numValues);
+
+private:
+    static inline std::pair<uint64_t, uint64_t> getNullEntryAndBitPos(uint64_t pos) {
+        auto nullEntryPos = pos >> NUM_BITS_PER_NULL_ENTRY_LOG2;
+        return std::make_pair(nullEntryPos,
+            pos - (nullEntryPos << NullMask::NUM_BITS_PER_NULL_ENTRY_LOG2));
+    }
+
+    static bool copyUnaligned(const uint64_t* srcNullEntries, uint64_t srcOffset,
+        uint64_t* dstNullEntries, uint64_t dstOffset, uint64_t numBitsToCopy, bool invert = false);
+
+private:
+    std::span<uint64_t> data;
+    std::unique_ptr<uint64_t[]> buffer;
+    bool mayContainNulls;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/numeric_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/numeric_utils.h
new file mode 100644
index 0000000000..60dbc1a5ba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/numeric_utils.h
@@ -0,0 +1,75 @@
+#pragma once
+
+#include <type_traits>
+
+#include "common/types/int128_t.h"
+#include "common/types/types.h"
+#include <bit>
+#include <concepts>
+
+namespace lbug {
+namespace common {
+namespace numeric_utils {
+
+template<typename T>
+concept IsIntegral = std::integral<T> || std::same_as<std::remove_cvref_t<T>, int128_t>;
+
+template<typename T>
+concept IsSigned = std::same_as<T, int128_t> || std::numeric_limits<T>::is_signed;
+
+template<typename T>
+concept IsUnSigned = std::numeric_limits<T>::is_unsigned;
+
+template<typename T>
+struct MakeSigned {
+    using type = std::make_signed_t<T>;
+};
+
+template<>
+struct MakeSigned<int128_t> {
+    using type = int128_t;
+};
+
+template<typename T>
+using MakeSignedT = typename MakeSigned<T>::type;
+
+template<typename T>
+struct MakeUnSigned {
+    using type = std::make_unsigned_t<T>;
+};
+
+template<>
+struct MakeUnSigned<int128_t> {
+    // currently evaluates to int128_t as we don't have an uint128_t type
+    using type = int128_t;
+};
+
+template<typename T>
+using MakeUnSignedT = typename MakeUnSigned<T>::type;
+
+template<typename T>
+decltype(auto) makeValueSigned(T value) {
+    return static_cast<MakeSignedT<T>>(value);
+}
+
+template<typename T>
+decltype(auto) makeValueUnSigned(T value) {
+    return static_cast<MakeUnSignedT<T>>(value);
+}
+
+template<typename T>
+constexpr int bitWidth(T x) {
+    return std::bit_width(x);
+}
+
+template<>
+constexpr int bitWidth<int128_t>(int128_t x) {
+    if (x.high != 0) {
+        constexpr size_t BITS_PER_BYTE = 8;
+        return sizeof(x.low) * BITS_PER_BYTE + std::bit_width(makeValueUnSigned(x.high));
+    }
+    return std::bit_width(x.low);
+}
+} // namespace numeric_utils
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/profiler.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/profiler.h
new file mode 100644
index 0000000000..5688d39a44
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/profiler.h
@@ -0,0 +1,34 @@
+#pragma once
+
+#include <memory>
+#include <mutex>
+#include <unordered_map>
+#include <vector>
+
+#include "common/metric.h"
+
+namespace lbug {
+namespace common {
+
+class Profiler {
+
+public:
+    TimeMetric* registerTimeMetric(const std::string& key);
+
+    NumericMetric* registerNumericMetric(const std::string& key);
+
+    double sumAllTimeMetricsWithKey(const std::string& key);
+
+    uint64_t sumAllNumericMetricsWithKey(const std::string& key);
+
+private:
+    void addMetric(const std::string& key, std::unique_ptr<Metric> metric);
+
+public:
+    std::mutex mtx;
+    bool enabled = false;
+    std::unordered_map<std::string, std::vector<std::unique_ptr<Metric>>> metrics;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/random_engine.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/random_engine.h
new file mode 100644
index 0000000000..3cccbba931
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/random_engine.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include <mutex>
+
+#include "common/api.h"
+#include "pcg_random.hpp"
+
+namespace lbug {
+
+namespace main {
+class ClientContext;
+}
+
+namespace common {
+
+struct RandomState {
+    pcg32 pcg;
+
+    RandomState() {}
+};
+
+class LBUG_API RandomEngine {
+public:
+    RandomEngine();
+    RandomEngine(uint64_t seed, uint64_t stream);
+
+    void setSeed(uint64_t seed);
+
+    uint32_t nextRandomInteger();
+    uint32_t nextRandomInteger(uint32_t upper);
+
+    static RandomEngine* Get(const main::ClientContext& context);
+
+private:
+    std::mutex mtx;
+    RandomState randomState;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/roaring_mask.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/roaring_mask.h
new file mode 100644
index 0000000000..c4b367d402
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/roaring_mask.h
@@ -0,0 +1,54 @@
+#pragma once
+
+#include "common/mask.h"
+#include "roaring.hh"
+
+namespace lbug {
+namespace common {
+
+class Roaring32BitmapSemiMask final : public SemiMask {
+public:
+    explicit Roaring32BitmapSemiMask(offset_t maxOffset)
+        : SemiMask(maxOffset), roaring(std::make_shared<roaring::Roaring>()) {}
+
+    void mask(offset_t nodeOffset) override { roaring->add(nodeOffset); }
+    void maskRange(offset_t startNodeOffset, offset_t endNodeOffset) override {
+        roaring->addRange(startNodeOffset, endNodeOffset);
+    }
+
+    bool isMasked(offset_t startNodeOffset) override { return roaring->contains(startNodeOffset); }
+
+    uint64_t getNumMaskedNodes() const override { return roaring->cardinality(); }
+
+    offset_vec_t collectMaskedNodes(uint64_t size) const override;
+
+    // include&exclude
+    offset_vec_t range(uint32_t start, uint32_t end) override;
+
+    std::shared_ptr<roaring::Roaring> roaring;
+};
+
+class Roaring64BitmapSemiMask final : public SemiMask {
+public:
+    explicit Roaring64BitmapSemiMask(offset_t maxOffset)
+        : SemiMask(maxOffset), roaring(std::make_shared<roaring::Roaring64Map>()) {}
+
+    void mask(offset_t nodeOffset) override { roaring->add(nodeOffset); }
+    void maskRange(offset_t startNodeOffset, offset_t endNodeOffset) override {
+        roaring->addRange(startNodeOffset, endNodeOffset);
+    }
+
+    bool isMasked(offset_t startNodeOffset) override { return roaring->contains(startNodeOffset); }
+
+    uint64_t getNumMaskedNodes() const override { return roaring->cardinality(); }
+
+    offset_vec_t collectMaskedNodes(uint64_t size) const override;
+
+    // include&exclude
+    offset_vec_t range(uint32_t start, uint32_t end) override;
+
+    std::shared_ptr<roaring::Roaring64Map> roaring;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/buffer_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/buffer_reader.h
new file mode 100644
index 0000000000..d6b73aef0c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/buffer_reader.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include <cstring>
+
+#include "common/serializer/reader.h"
+
+namespace lbug {
+namespace common {
+
+struct BufferReader final : Reader {
+    BufferReader(uint8_t* data, size_t dataSize) : data(data), dataSize(dataSize), readSize(0) {}
+
+    void read(uint8_t* outputData, uint64_t size) override {
+        memcpy(outputData, data + readSize, size);
+        readSize += size;
+    }
+
+    bool finished() override { return readSize >= dataSize; }
+
+    uint8_t* data;
+    size_t dataSize;
+    size_t readSize;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/buffer_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/buffer_writer.h
new file mode 100644
index 0000000000..794b9d8905
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/buffer_writer.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include <memory>
+#include <string>
+
+#include "common/api.h"
+#include "common/serializer/writer.h"
+
+namespace lbug {
+namespace common {
+
+static constexpr uint64_t SERIALIZER_DEFAULT_SIZE = 1024;
+
+struct BinaryData {
+    std::unique_ptr<uint8_t[]> data;
+    uint64_t size = 0;
+};
+
+class LBUG_API BufferWriter : public Writer {
+public:
+    // Serializes to a buffer allocated by the serializer, will expand when
+    // writing past the initial threshold.
+    explicit BufferWriter(uint64_t maximumSize = SERIALIZER_DEFAULT_SIZE);
+
+    // Retrieves the data after the writing has been completed.
+    BinaryData getData() { return std::move(blob); }
+
+    uint64_t getSize() const override { return blob.size; }
+
+    uint8_t* getBlobData() const { return blob.data.get(); }
+
+    void clear() override { blob.size = 0; }
+    void flush() override {
+        // DO NOTHING: BufferedWriter does not need to flush.
+    }
+    void sync() override {
+        // DO NOTHING: BufferedWriter does not need to sync.
+    }
+
+    template<class T>
+    void write(T element) {
+        static_assert(std::is_trivially_destructible<T>(),
+            "Write element must be trivially destructible");
+        write(reinterpret_cast<const uint8_t*>(&element), sizeof(T));
+    }
+
+    void write(const uint8_t* buffer, uint64_t len) final;
+
+    void writeBufferData(const std::string& str) {
+        write(reinterpret_cast<const uint8_t*>(str.c_str()), str.size());
+    }
+
+    void writeBufferData(const char& ch) {
+        write(reinterpret_cast<const uint8_t*>(&ch), sizeof(char));
+    }
+
+private:
+    uint64_t maximumSize;
+    uint8_t* data;
+
+    BinaryData blob;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/buffered_file.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/buffered_file.h
new file mode 100644
index 0000000000..c1cf0a8c12
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/buffered_file.h
@@ -0,0 +1,70 @@
+#pragma once
+
+#include <memory>
+
+#include "common/serializer/reader.h"
+#include "common/serializer/writer.h"
+
+namespace lbug {
+namespace common {
+
+struct FileInfo;
+
+class BufferedFileWriter final : public Writer {
+public:
+    explicit BufferedFileWriter(FileInfo& fileInfo);
+    ~BufferedFileWriter() override;
+
+    void write(const uint8_t* data, uint64_t size) override;
+
+    void clear() override;
+    void flush() override;
+    void sync() override;
+
+    // Note: this function resets the next file offset to be written. Make sure the buffer is empty.
+    void setFileOffset(uint64_t fileOffset) { this->fileOffset = fileOffset; }
+    uint64_t getFileOffset() const { return fileOffset; }
+    void resetOffsets() {
+        fileOffset = 0;
+        bufferOffset = 0;
+    }
+
+    uint64_t getSize() const override;
+
+protected:
+    std::unique_ptr<uint8_t[]> buffer;
+    uint64_t fileOffset, bufferOffset;
+    FileInfo& fileInfo;
+};
+
+class BufferedFileReader final : public Reader {
+public:
+    explicit BufferedFileReader(FileInfo& fileInfo);
+
+    // Note: this function resets the next file offset to read.
+    void resetReadOffset(uint64_t fileOffset) {
+        this->fileOffset = fileOffset;
+        bufferOffset = 0;
+        bufferSize = 0;
+    }
+
+    void read(uint8_t* data, uint64_t size) override;
+
+    bool finished() override;
+
+    uint64_t getReadOffset() const { return fileOffset - bufferSize + bufferOffset; }
+    FileInfo* getFileInfo() const { return &fileInfo; }
+
+private:
+    void readNextPage();
+
+private:
+    std::unique_ptr<uint8_t[]> buffer;
+    uint64_t fileOffset, bufferOffset;
+    FileInfo& fileInfo;
+    uint64_t fileSize;
+    uint64_t bufferSize;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/deserializer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/deserializer.h
new file mode 100644
index 0000000000..07283a2634
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/deserializer.h
@@ -0,0 +1,148 @@
+#pragma once
+
+#include <functional>
+#include <map>
+#include <memory>
+#include <string>
+#include <unordered_map>
+#include <unordered_set>
+#include <vector>
+
+#include "common/assert.h"
+#include "common/serializer/reader.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API Deserializer {
+public:
+    explicit Deserializer(std::unique_ptr<Reader> reader) : reader(std::move(reader)) {}
+
+    bool finished() const { return reader->finished(); }
+
+    template<typename T>
+        requires std::is_trivially_destructible_v<T> || std::is_same_v<std::string, T>
+    void deserializeValue(T& value) {
+        reader->read(reinterpret_cast<uint8_t*>(&value), sizeof(T));
+    }
+
+    void read(uint8_t* data, uint64_t size) const { reader->read(data, size); }
+
+    Reader* getReader() const { return reader.get(); }
+
+    void validateDebuggingInfo(std::string& value, const std::string& expectedVal);
+
+    template<typename T>
+    void deserializeOptionalValue(std::unique_ptr<T>& value) {
+        bool isNull = false;
+        deserializeValue(isNull);
+        if (!isNull) {
+            value = T::deserialize(*this);
+        }
+    }
+
+    template<typename T1, typename T2>
+    void deserializeMap(std::map<T1, T2>& values) {
+        uint64_t mapSize = 0;
+        deserializeValue<uint64_t>(mapSize);
+        for (auto i = 0u; i < mapSize; i++) {
+            T1 key;
+            deserializeValue<T1>(key);
+            auto val = T2::deserialize(*this);
+            values.emplace(key, std::move(val));
+        }
+    }
+
+    template<typename T1, typename T2>
+    void deserializeUnorderedMap(std::unordered_map<T1, T2>& values) {
+        uint64_t mapSize = 0;
+        deserializeValue<uint64_t>(mapSize);
+        for (auto i = 0u; i < mapSize; i++) {
+            T1 key;
+            deserializeValue<T1>(key);
+            T2 val;
+            deserializeValue(val);
+            values.emplace(key, std::move(val));
+        }
+    }
+
+    template<typename T1, typename T2>
+    void deserializeUnorderedMapOfPtrs(std::unordered_map<T1, std::unique_ptr<T2>>& values) {
+        uint64_t mapSize = 0;
+        deserializeValue<uint64_t>(mapSize);
+        values.reserve(mapSize);
+        for (auto i = 0u; i < mapSize; i++) {
+            T1 key;
+            deserializeValue<T1>(key);
+            auto val = T2::deserialize(*this);
+            values.emplace(key, std::move(val));
+        }
+    }
+
+    template<typename T>
+    void deserializeVector(std::vector<T>& values) {
+        uint64_t vectorSize = 0;
+        deserializeValue(vectorSize);
+        values.resize(vectorSize);
+        for (auto& value : values) {
+            if constexpr (requires(Deserializer& deser) { T::deserialize(deser); }) {
+                value = T::deserialize(*this);
+            } else {
+                deserializeValue(value);
+            }
+        }
+    }
+
+    template<typename T, uint64_t ARRAY_SIZE>
+    void deserializeArray(std::array<T, ARRAY_SIZE>& values) {
+        KU_ASSERT(values.size() == ARRAY_SIZE);
+        for (auto& value : values) {
+            if constexpr (requires(Deserializer& deser) { T::deserialize(deser); }) {
+                value = T::deserialize(*this);
+            } else {
+                deserializeValue(value);
+            }
+        }
+    }
+
+    template<typename T>
+    void deserializeVectorOfPtrs(std::vector<std::unique_ptr<T>>& values) {
+        uint64_t vectorSize = 0;
+        deserializeValue(vectorSize);
+        values.resize(vectorSize);
+        for (auto i = 0u; i < vectorSize; i++) {
+            values[i] = T::deserialize(*this);
+        }
+    }
+
+    template<typename T>
+    void deserializeVectorOfPtrs(std::vector<std::unique_ptr<T>>& values,
+        std::function<std::unique_ptr<T>(Deserializer&)> deserializeFunc) {
+        uint64_t vectorSize = 0;
+        deserializeValue(vectorSize);
+        values.resize(vectorSize);
+        for (auto i = 0u; i < vectorSize; i++) {
+            values[i] = deserializeFunc(*this);
+        }
+    }
+
+    template<typename T>
+    void deserializeUnorderedSet(std::unordered_set<T>& values) {
+        uint64_t setSize = 0;
+        deserializeValue(setSize);
+        for (auto i = 0u; i < setSize; i++) {
+            T value;
+            deserializeValue<T>(value);
+            values.insert(value);
+        }
+    }
+
+private:
+    std::unique_ptr<Reader> reader;
+};
+
+template<>
+void Deserializer::deserializeValue(std::string& value);
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/in_mem_file_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/in_mem_file_writer.h
new file mode 100644
index 0000000000..617d987655
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/in_mem_file_writer.h
@@ -0,0 +1,66 @@
+#pragma once
+
+#include <vector>
+
+#include "common/serializer/writer.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug::storage {
+struct PageRange;
+class ShadowFile;
+class PageAllocator;
+} // namespace lbug::storage
+
+namespace lbug {
+namespace common {
+class BufferedFileWriter;
+
+class InMemFileWriter final : public Writer {
+public:
+    explicit InMemFileWriter(storage::MemoryManager& mm);
+
+    void write(const uint8_t* data, uint64_t size) override;
+
+    std::span<uint8_t> getPage(page_idx_t pageIdx) const {
+        KU_ASSERT(pageIdx < pages.size());
+        return pages[pageIdx]->getBuffer();
+    }
+
+    storage::PageRange flush(storage::PageAllocator& pageAllocator,
+        storage::ShadowFile& shadowFile) const;
+    void flush(storage::PageRange allocatedPages, storage::FileHandle* fileHandle,
+        storage::ShadowFile& shadowFile) const;
+
+    page_idx_t getNumPagesToFlush() const { return pages.size(); }
+
+    static uint64_t getPageSize();
+    void flush(Writer& writer) const;
+
+    uint64_t getSize() const override {
+        uint64_t size = pages.size() > 1 ? LBUG_PAGE_SIZE * (pages.size() - 1) : 0;
+        return size + pageOffset;
+    }
+
+    void clear() override {
+        pages.clear();
+        pageOffset = 0;
+    }
+
+    void flush() override {
+        // DO NOTHING: InMemWriter does not need to flush.
+    }
+    void sync() override {
+        // DO NOTHING: InMemWriter does not need to sync.
+    }
+
+private:
+    bool needNewBuffer(uint64_t size) const;
+
+private:
+    std::vector<std::unique_ptr<storage::MemoryBuffer>> pages;
+    storage::MemoryManager& mm;
+    uint64_t pageOffset;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/reader.h
new file mode 100644
index 0000000000..a6d91a76ec
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/reader.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include <cstdint>
+
+#include "common/cast.h"
+
+namespace lbug {
+namespace common {
+
+class Reader {
+public:
+    virtual void read(uint8_t* data, uint64_t size) = 0;
+    virtual ~Reader() = default;
+
+    virtual bool finished() = 0;
+    virtual void onObjectBegin() {};
+    virtual void onObjectEnd() {};
+
+    template<typename TARGET>
+    TARGET* cast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/serializer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/serializer.h
new file mode 100644
index 0000000000..c9d4f5f83e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/serializer.h
@@ -0,0 +1,126 @@
+#pragma once
+
+#include <map>
+#include <memory>
+#include <string>
+#include <unordered_map>
+#include <unordered_set>
+#include <vector>
+
+#include "common/api.h"
+#include "common/serializer/writer.h"
+
+namespace lbug {
+namespace common {
+
+class LBUG_API Serializer {
+public:
+    explicit Serializer(std::shared_ptr<Writer> writer) : writer(std::move(writer)) {}
+
+    template<typename T>
+        requires std::is_trivially_destructible_v<T> || std::is_same_v<std::string, T>
+    void serializeValue(const T& value) {
+        writer->write(reinterpret_cast<const uint8_t*>(&value), sizeof(T));
+    }
+
+    // Alias for serializeValue
+    template<typename T>
+    void write(const T& value) {
+        serializeValue(value);
+    }
+
+    void writeDebuggingInfo(const std::string& value);
+
+    void write(const uint8_t* value, uint64_t len) { writer->write(value, len); }
+
+    template<typename T>
+    void serializeOptionalValue(const std::unique_ptr<T>& value) {
+        serializeValue(value == nullptr);
+        if (value != nullptr) {
+            value->serialize(*this);
+        }
+    }
+
+    template<typename T1, typename T2>
+    void serializeMap(const std::map<T1, T2>& values) {
+        uint64_t mapSize = values.size();
+        serializeValue(mapSize);
+        for (auto& value : values) {
+            serializeValue(value.first);
+            value.second.serialize(*this);
+        }
+    }
+
+    template<typename T1, typename T2>
+    void serializeUnorderedMap(const std::unordered_map<T1, T2>& values) {
+        uint64_t mapSize = values.size();
+        serializeValue(mapSize);
+        for (auto& value : values) {
+            serializeValue(value.first);
+            serializeValue<T2>(value.second);
+        }
+    }
+
+    template<typename T1, typename T2>
+    void serializeUnorderedMapOfPtrs(const std::unordered_map<T1, std::unique_ptr<T2>>& values) {
+        uint64_t mapSize = values.size();
+        serializeValue(mapSize);
+        for (auto& value : values) {
+            serializeValue(value.first);
+            value.second->serialize(*this);
+        }
+    }
+
+    template<typename T>
+    void serializeVector(const std::vector<T>& values) {
+        uint64_t vectorSize = values.size();
+        serializeValue<uint64_t>(vectorSize);
+        for (auto& value : values) {
+            if constexpr (requires(Serializer& ser) { value.serialize(ser); }) {
+                value.serialize(*this);
+            } else {
+                serializeValue<T>(value);
+            }
+        }
+    }
+
+    template<typename T, uint64_t ARRAY_SIZE>
+    void serializeArray(const std::array<T, ARRAY_SIZE>& values) {
+        for (auto& value : values) {
+            if constexpr (requires(Serializer& ser) { value.serialize(ser); }) {
+                value.serialize(*this);
+            } else {
+                serializeValue<T>(value);
+            }
+        }
+    }
+
+    template<typename T>
+    void serializeVectorOfPtrs(const std::vector<std::unique_ptr<T>>& values) {
+        uint64_t vectorSize = values.size();
+        serializeValue<uint64_t>(vectorSize);
+        for (auto& value : values) {
+            value->serialize(*this);
+        }
+    }
+
+    template<typename T>
+    void serializeUnorderedSet(const std::unordered_set<T>& values) {
+        uint64_t setSize = values.size();
+        serializeValue(setSize);
+        for (const auto& value : values) {
+            serializeValue(value);
+        }
+    }
+
+    Writer* getWriter() const { return writer.get(); }
+
+private:
+    std::shared_ptr<Writer> writer;
+};
+
+template<>
+void Serializer::serializeValue(const std::string& value);
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/writer.h
new file mode 100644
index 0000000000..2c6014d550
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/serializer/writer.h
@@ -0,0 +1,32 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace common {
+
+class Writer {
+public:
+    virtual void write(const uint8_t* data, uint64_t size) = 0;
+    virtual ~Writer() = default;
+
+    virtual uint64_t getSize() const = 0;
+
+    virtual void clear() = 0;
+    virtual void flush() = 0;
+    virtual void sync() = 0;
+    virtual void onObjectBegin() {};
+    virtual void onObjectEnd() {};
+
+    template<class TARGET>
+    const TARGET& cast() const {
+        return dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET& cast() {
+        return dynamic_cast<TARGET&>(*this);
+    }
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/sha256.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/sha256.h
new file mode 100644
index 0000000000..f1e2bbaa39
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/sha256.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include <string>
+
+#include "mbedtls/sha256.h"
+
+namespace lbug {
+namespace common {
+
+class SHA256 {
+public:
+    static constexpr size_t SHA256_HASH_LENGTH_BYTES = 32;
+    static constexpr size_t SHA256_HASH_LENGTH_TEXT = 64;
+
+public:
+    SHA256();
+    ~SHA256();
+    void addString(const std::string& str);
+    void finishSHA256(char* out);
+    static void toBase16(const char* in, char* out, size_t len);
+
+private:
+    typedef mbedtls_sha256_context SHA256Context;
+
+    SHA256Context shaContext;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/static_vector.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/static_vector.h
new file mode 100644
index 0000000000..a83a0a5b94
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/static_vector.h
@@ -0,0 +1,88 @@
+#pragma once
+
+#include <cstring>
+#include <memory>
+#include <utility>
+
+#include "common/assert.h"
+#include "common/copy_constructors.h"
+
+namespace lbug {
+namespace common {
+
+template<typename T>
+class MaybeUninit {
+public:
+    T& assumeInit() { return *ptr(); }
+    const T& assumeInit() const { return *ptr(); }
+    T* ptr() { return reinterpret_cast<T*>(&data); }
+    const T* ptr() const { return reinterpret_cast<const T*>(&data); }
+
+private:
+    alignas(T) std::byte data[sizeof(T)];
+};
+
+template<typename T, size_t N>
+class StaticVector {
+    StaticVector(const StaticVector& other) : len(other.len) {
+        std::uninitialized_copy(other.begin(), other.end(), begin());
+    }
+
+public:
+    StaticVector() : len(0){};
+    StaticVector(StaticVector&& other) : len(other.len) {
+        std::uninitialized_move(other.begin(), other.end(), begin());
+        other.len = 0;
+    }
+    DELETE_COPY_ASSN(StaticVector);
+    EXPLICIT_COPY_METHOD(StaticVector);
+    StaticVector& operator=(StaticVector&& other) {
+        if (&other != this) {
+            clear();
+            len = other.len;
+            std::uninitialized_move(other.begin(), other.end(), begin());
+            other.len = 0;
+        }
+        return *this;
+    }
+    ~StaticVector() { clear(); }
+
+    T& operator[](size_t i) {
+        KU_ASSERT(i < len);
+        return items[i].assumeInit();
+    }
+    const T& operator[](size_t i) const {
+        KU_ASSERT(i < len);
+        return items[i].assumeInit();
+    }
+    void push_back(T elem) {
+        KU_ASSERT(len < N);
+        new (items[len].ptr()) T(std::move(elem));
+        len++;
+    }
+    T pop_back() {
+        KU_ASSERT(len > 0);
+        len--;
+        return std::move(items[len].assumeInit());
+    }
+    T* begin() { return items[0].ptr(); }
+    const T* begin() const { return items[0].ptr(); }
+    T* end() { return items[len].ptr(); }
+    const T* end() const { return items[len].ptr(); }
+
+    void clear() {
+        std::destroy(begin(), end());
+        len = 0;
+    }
+
+    bool empty() const { return len == 0; }
+    bool full() const { return len == N; }
+    size_t size() const { return len; }
+
+private:
+    MaybeUninit<T> items[N];
+    size_t len;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/string_format.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/string_format.h
new file mode 100644
index 0000000000..f6d8ca2686
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/string_format.h
@@ -0,0 +1,120 @@
+#pragma once
+
+#include <string>
+#include <string_view>
+#if USE_STD_FORMAT
+#include <format>
+#else
+#include "common/exception/internal.h"
+#endif
+
+namespace lbug {
+namespace common {
+
+#if USE_STD_FORMAT
+
+template<typename... Args>
+inline std::string stringFormat(std::format_string<Args...> format, Args&&... args) {
+    return std::format(format, std::forward<Args>(args)...);
+}
+
+#else
+
+namespace string_format_detail {
+#define MAP_STD_TO_STRING(typ)                                                                     \
+    inline std::string map(typ v) {                                                                \
+        return std::to_string(v);                                                                  \
+    }
+
+MAP_STD_TO_STRING(short)
+MAP_STD_TO_STRING(unsigned short)
+MAP_STD_TO_STRING(int)
+MAP_STD_TO_STRING(unsigned int)
+MAP_STD_TO_STRING(long)
+MAP_STD_TO_STRING(unsigned long)
+MAP_STD_TO_STRING(long long)
+MAP_STD_TO_STRING(unsigned long long)
+MAP_STD_TO_STRING(float)
+MAP_STD_TO_STRING(double)
+#undef MAP_STD_TO_STRING
+
+#define MAP_SELF(typ)                                                                              \
+    inline typ map(typ v) {                                                                        \
+        return v;                                                                                  \
+    }
+MAP_SELF(const char*);
+// Also covers std::string
+MAP_SELF(std::string_view)
+
+// Chars are mapped to themselves, but signed char and unsigned char (which are used for int8_t and
+// uint8_t respectively), need to be cast to be properly output as integers. This is consistent with
+// fmt's behavior.
+MAP_SELF(char)
+inline std::string map(signed char v) {
+    return std::to_string(int(v));
+}
+inline std::string map(unsigned char v) {
+    return std::to_string(unsigned(v));
+}
+#undef MAP_SELF
+
+template<typename... Args>
+inline void stringFormatHelper(std::string& ret, std::string_view format, Args&&... args) {
+    size_t bracket = format.find('{');
+    if (bracket == std::string_view::npos) {
+        ret += format;
+        return;
+    }
+    ret += format.substr(0, bracket);
+    if (format.substr(bracket, 4) == "{{}}") {
+        // Escaped {}.
+        ret += "{}";
+        return stringFormatHelper(ret, format.substr(bracket + 4), std::forward<Args>(args)...);
+    } else if (format.substr(bracket, 2) == "{}") {
+        // Formatted {}.
+        throw InternalException("Not enough values for string_format.");
+    }
+    // Something else.
+    ret.push_back('{');
+    return stringFormatHelper(ret, format.substr(bracket + 1), std::forward<Args>(args)...);
+}
+
+template<typename Arg, typename... Args>
+inline void stringFormatHelper(std::string& ret, std::string_view format, Arg&& arg,
+    Args&&... args) {
+    size_t bracket = format.find('{');
+    if (bracket == std::string_view::npos) {
+        throw InternalException("Too many values for string_format.");
+    }
+    ret += format.substr(0, bracket);
+    if (format.substr(bracket, 4) == "{{}}") {
+        // Escaped {}.
+        ret += "{}";
+        return stringFormatHelper(ret, format.substr(bracket + 4), std::forward<Arg>(arg),
+            std::forward<Args>(args)...);
+    } else if (format.substr(bracket, 2) == "{}") {
+        // Formatted {}.
+        ret += map(arg);
+        return stringFormatHelper(ret, format.substr(bracket + 2), std::forward<Args>(args)...);
+    }
+    // Something else.
+    ret.push_back('{');
+    return stringFormatHelper(ret, format.substr(bracket + 1), std::forward<Arg>(arg),
+        std::forward<Args>(args)...);
+}
+} // namespace string_format_detail
+
+// Formats `args` according to `format`. Accepts {} for formatting the argument and {{}} for
+// a literal {}. Formatting is done with std::ostream::operator<<.
+template<typename... Args>
+inline std::string stringFormat(std::string_view format, Args&&... args) {
+    std::string ret;
+    ret.reserve(32); // Optimistic pre-allocation.
+    string_format_detail::stringFormatHelper(ret, format, std::forward<Args>(args)...);
+    return ret;
+}
+
+#endif
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/string_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/string_utils.h
new file mode 100644
index 0000000000..2e14a5a53c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/string_utils.h
@@ -0,0 +1,125 @@
+#pragma once
+
+#include <regex>
+#include <string>
+#include <vector>
+
+#include "common/api.h"
+#include "function/cast/functions/numeric_limits.h"
+#include <span>
+
+namespace lbug {
+namespace common {
+
+class LBUG_API StringUtils {
+public:
+    static std::vector<std::string> splitComma(const std::string& input);
+
+    // Does not split within [], {}, or ().
+    // can specify maximum number of elements to split
+    static std::vector<std::string_view> smartSplit(std::string_view input, char splitChar,
+        uint64_t maxNumEle = function::NumericLimits<uint64_t>::maximum());
+
+    static std::vector<std::string> split(const std::string& input, const std::string& delimiter,
+        bool ignoreEmptyStringParts = true);
+    static std::vector<std::string> splitBySpace(const std::string& input);
+
+    static std::string getUpper(const std::string& input);
+    static std::string getUpper(const std::string_view& input);
+    static std::string getLower(const std::string& input);
+    static void toLower(std::string& input);
+    static void toUpper(std::string& input);
+
+    static bool isSpace(char c) {
+        return c == ' ' || c == '\t' || c == '\n' || c == '\v' || c == '\f' || c == '\r';
+    }
+    static bool characterIsNewLine(char c) { return c == '\n' || c == '\r'; }
+    static bool CharacterIsDigit(char c) { return c >= '0' && c <= '9'; }
+
+    static std::string ltrim(const std::string& input) {
+        auto s = input;
+        s.erase(s.begin(),
+            find_if(s.begin(), s.end(), [](unsigned char ch) { return !isspace(ch); }));
+        return s;
+    }
+    static std::string_view ltrim(std::string_view input) {
+        auto begin = 0u;
+        while (begin < input.size() && isspace(input[begin])) {
+            begin++;
+        }
+        return input.substr(begin);
+    }
+    static std::string rtrim(const std::string& input) {
+        auto s = input;
+        s.erase(find_if(s.rbegin(), s.rend(), [](unsigned char ch) { return !isspace(ch); }).base(),
+            s.end());
+        return s;
+    }
+    static std::string_view rtrim(std::string_view input) {
+        auto end = input.size();
+        while (end > 0 && isSpace(input[end - 1])) {
+            end--;
+        }
+        return input.substr(0, end);
+    }
+    static std::string ltrimNewlines(const std::string& input);
+    static std::string rtrimNewlines(const std::string& input);
+
+    static void removeWhiteSpaces(std::string& str) {
+        std::regex whiteSpacePattern{"\\s"};
+        str = std::regex_replace(str, whiteSpacePattern, "");
+    }
+
+    static void removeCStringWhiteSpaces(const char*& input, uint64_t& len);
+
+    static void replaceAll(std::string& str, const std::string& search,
+        const std::string& replacement);
+
+    static std::string extractStringBetween(const std::string& input, char delimiterStart,
+        char delimiterEnd, bool includeDelimiter = false);
+
+    static uint64_t caseInsensitiveHash(const std::string& str);
+
+    static bool caseInsensitiveEquals(std::string_view left, std::string_view right);
+
+    // join multiple strings into one string. Components are concatenated by the given separator
+    static std::string join(const std::vector<std::string>& input, const std::string& separator);
+    static std::string join(const std::span<const std::string_view> input,
+        const std::string& separator);
+
+    // join multiple items of container with given size, transformed to string
+    // using function, into one string using the given separator
+    template<typename C, typename S, typename Func>
+    static std::string join(const C& input, S count, const std::string& separator, Func f);
+
+    static constexpr uint8_t asciiToLowerCaseMap[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+        14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36,
+        37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+        60, 61, 62, 63, 64, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111,
+        112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+        100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117,
+        118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135,
+        136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153,
+        154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171,
+        172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189,
+        190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207,
+        208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225,
+        226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243,
+        244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255};
+
+    static std::string encodeURL(const std::string& input, bool encodeSlash = false);
+
+    // container hash function for strings which lets you hash both string_view and string
+    // references
+    struct string_hash {
+        using hash_type = std::hash<std::string_view>;
+        using is_transparent = void;
+
+        std::size_t operator()(const char* str) const { return hash_type{}(str); }
+        std::size_t operator()(std::string_view str) const { return hash_type{}(str); }
+        std::size_t operator()(std::string const& str) const { return hash_type{}(str); }
+    };
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/system_message.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/system_message.h
new file mode 100644
index 0000000000..bed980f433
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/system_message.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include <cerrno>
+#include <string>
+#include <system_error>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+inline std::string systemErrMessage(int code) {
+    // System errors are unexpected. For anything expected, we should catch it explicitly and
+    // provide a better error message to the user.
+    // LCOV_EXCL_START
+    return std::system_category().message(code);
+    // LCOV_EXCL_STOP
+}
+
+inline std::string posixErrMessage() {
+    // LCOV_EXCL_START
+    return systemErrMessage(errno);
+    // LCOV_EXCL_STOP
+}
+
+LBUG_API std::string dlErrMessage();
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/progress_bar.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/progress_bar.h
new file mode 100644
index 0000000000..7e5e37fd3f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/progress_bar.h
@@ -0,0 +1,61 @@
+#pragma once
+
+#include <memory>
+#include <mutex>
+
+#include "common/api.h"
+#include "progress_bar_display.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace common {
+
+typedef std::unique_ptr<ProgressBarDisplay> (*progress_bar_display_create_func_t)();
+
+/**
+ * @brief Progress bar for tracking the progress of a pipeline. Prints the progress of each query
+ * pipeline and the overall progress.
+ */
+class ProgressBar {
+public:
+    explicit ProgressBar(bool enableProgressBar);
+
+    static std::shared_ptr<ProgressBarDisplay> DefaultProgressBarDisplay();
+
+    void addPipeline();
+
+    void finishPipeline(uint64_t queryID);
+
+    void endProgress(uint64_t queryID);
+
+    void startProgress(uint64_t queryID);
+
+    void toggleProgressBarPrinting(bool enable);
+
+    LBUG_API void updateProgress(uint64_t queryID, double curPipelineProgress);
+
+    void setDisplay(std::shared_ptr<ProgressBarDisplay> progressBarDipslay);
+
+    std::shared_ptr<ProgressBarDisplay> getDisplay() { return display; }
+
+    bool getProgressBarPrinting() const { return trackProgress; }
+
+    LBUG_API static ProgressBar* Get(const main::ClientContext& context);
+
+private:
+    void resetProgressBar(uint64_t queryID);
+
+    void updateDisplay(uint64_t queryID, double curPipelineProgress);
+
+private:
+    uint32_t numPipelines;
+    uint32_t numPipelinesFinished;
+    std::mutex progressBarLock;
+    bool trackProgress;
+    std::shared_ptr<ProgressBarDisplay> display;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/progress_bar_display.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/progress_bar_display.h
new file mode 100644
index 0000000000..fbe202950c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/progress_bar_display.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include <stdint.h>
+
+#include <atomic>
+
+namespace lbug {
+namespace common {
+
+/**
+ * @brief Interface for displaying progress of a pipeline and a query.
+ */
+class ProgressBarDisplay {
+public:
+    ProgressBarDisplay() : pipelineProgress{0}, numPipelines{0}, numPipelinesFinished{0} {};
+
+    virtual ~ProgressBarDisplay() = default;
+
+    // Update the progress of the pipeline and the number of finished pipelines. queryID is used to
+    // identify the query when we track progress of multiple queries asynchronously
+    // This function should work even if called concurrently by multiple threads
+    virtual void updateProgress(uint64_t queryID, double newPipelineProgress,
+        uint32_t newNumPipelinesFinished) = 0;
+
+    // Finish the progress display. queryID is used to identify the query when we track progress of
+    // multiple queries asynchronously
+    virtual void finishProgress(uint64_t queryID) = 0;
+
+    void setNumPipelines(uint32_t newNumPipelines) { numPipelines = newNumPipelines; };
+
+protected:
+    std::atomic<double> pipelineProgress;
+    uint32_t numPipelines;
+    std::atomic<uint32_t> numPipelinesFinished;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/task.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/task.h
new file mode 100644
index 0000000000..fd6c37edbc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/task.h
@@ -0,0 +1,107 @@
+#pragma once
+
+#include <condition_variable>
+#include <mutex>
+#include <vector>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+using lock_t = std::unique_lock<std::mutex>;
+
+/**
+ * Task represents a task that can be executed by multiple threads in the TaskScheduler. Task is a
+ * virtual class. Users of TaskScheduler need to extend the Task class and implement at
+ * least a virtual run() function. Users can assume that before T.run() is called, a worker thread W
+ * has grabbed task T from the TaskScheduler's queue and registered itself to T. They can also
+ * assume that after run() is called W will deregister itself from T. When deregistering, if W is
+ * the last worker to finish on T, i.e., once W finishes, T will be completed, the
+ * finalize() will be called. So the run() and finalize() calls are separate
+ * calls and if there is some state from the run() function execution that will be needed by
+ * finalize, users should save it somewhere that can be accessed in
+ * finalize(). See ProcessorTask for an example of this.
+ */
+class LBUG_API Task {
+    friend class TaskScheduler;
+
+public:
+    explicit Task(uint64_t maxNumThreads)
+        : parent{nullptr}, maxNumThreads{maxNumThreads}, numThreadsFinished{0},
+          numThreadsRegistered{0}, exceptionsPtr{nullptr}, ID{UINT64_MAX} {}
+
+    virtual ~Task() = default;
+    virtual void run() = 0;
+    // This function is called from inside deRegisterThreadAndFinalizeTaskIfNecessary() only
+    // once by the last registered worker that is completing this task. So the task lock is
+    // already acquired. So do not attempt to acquire the task lock inside. If needed we can
+    // make the deregister function release the lock before calling finalize and
+    // drop this assumption.
+    virtual void finalize() {}
+    // If task should terminate all subsequent tasks.
+    virtual bool terminate() { return false; }
+
+    void addChildTask(std::unique_ptr<Task> child) {
+        child->parent = this;
+        children.push_back(std::move(child));
+    }
+
+    bool isCompletedSuccessfully() {
+        lock_t lck{taskMtx};
+        return isCompletedNoLock() && !hasExceptionNoLock();
+    }
+
+    bool isCompletedNoLock() const {
+        return numThreadsRegistered > 0 && numThreadsFinished == numThreadsRegistered;
+    }
+
+    void setSingleThreadedTask() { maxNumThreads = 1; }
+
+    bool registerThread();
+
+    void deRegisterThreadAndFinalizeTask();
+
+    void setException(const std::exception_ptr& exceptionPtr) {
+        lock_t lck{taskMtx};
+        setExceptionNoLock(exceptionPtr);
+    }
+
+    bool hasException() {
+        lock_t lck{taskMtx};
+        return exceptionsPtr != nullptr;
+    }
+
+    std::exception_ptr getExceptionPtr() {
+        lock_t lck{taskMtx};
+        return exceptionsPtr;
+    }
+
+private:
+    bool canRegisterNoLock() const {
+        return 0 == numThreadsFinished && maxNumThreads > numThreadsRegistered;
+    }
+
+    bool hasExceptionNoLock() const { return exceptionsPtr != nullptr; }
+
+    void setExceptionNoLock(const std::exception_ptr& exceptionPtr) {
+        if (exceptionsPtr == nullptr) {
+            exceptionsPtr = exceptionPtr;
+        }
+    }
+
+public:
+    Task* parent;
+    std::vector<std::shared_ptr<Task>>
+        children; // Dependency tasks that needs to be executed first.
+
+protected:
+    std::mutex taskMtx;
+    std::condition_variable cv;
+    uint64_t maxNumThreads, numThreadsFinished, numThreadsRegistered;
+    std::exception_ptr exceptionsPtr;
+    uint64_t ID;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/task_scheduler.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/task_scheduler.h
new file mode 100644
index 0000000000..8b8fbd6ee8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/task_scheduler.h
@@ -0,0 +1,112 @@
+#pragma once
+#include <deque>
+
+#ifndef __SINGLE_THREADED__
+#include <condition_variable>
+#include <thread>
+#endif
+
+#include "common/task_system/task.h"
+#include "processor/execution_context.h"
+
+namespace lbug {
+namespace common {
+
+struct ScheduledTask {
+    ScheduledTask(std::shared_ptr<Task> task, uint64_t ID) : task{std::move(task)}, ID{ID} {};
+    std::shared_ptr<Task> task;
+    uint64_t ID;
+};
+
+/**
+ * TaskScheduler is a library that manages a set of worker threads that can execute tasks that are
+ * put into a task queue. Each task accepts a maximum number of threads. Users of TaskScheduler
+ * schedule tasks to be executed by calling schedule functions, e.g., pushTaskIntoQueue or
+ * scheduleTaskAndWaitOrError. New tasks are put at the end of the queue. Workers grab the first
+ * task from the beginning of the queue that they can register themselves to work on. Any task that
+ * is completed is removed automatically from the queue. If there is a task that raises an
+ * exception, the worker threads catch it and store it with the tasks. The user thread that is
+ * waiting on the completion of the task (or tasks) will throw the exception (the user thread could
+ * be waiting on a tasks through a function that waits, e.g., scheduleTaskAndWaitOrError.
+ *
+ * Currently there is one way the TaskScheduler can be used:
+ * Schedule one task T and wait for T to finish or error if there was an exception raised by
+ * one of the threads working on T that errored. This is simply done by the call:
+ *      scheduleTaskAndWaitOrError(T);
+ *
+ * TaskScheduler guarantees that workers will register themselves to tasks in FIFO order. However
+ * this does not guarantee that the tasks will be completed in FIFO order: a long running task
+ * that is not accepting more registration can stay in the queue for an unlimited time until
+ * completion.
+ */
+#ifndef __SINGLE_THREADED__
+class LBUG_API TaskScheduler {
+public:
+#if defined(__APPLE__)
+    explicit TaskScheduler(uint64_t numWorkerThreads, uint32_t threadQos);
+#else
+    explicit TaskScheduler(uint64_t numWorkerThreads);
+#endif
+    ~TaskScheduler();
+
+    // Schedules the dependencies of the given task and finally the task one after another (so
+    // not concurrently), and throws an exception if any of the tasks errors. Regardless of
+    // whether or not the given task or one of its dependencies errors, when this function
+    // returns, no task related to the given task will be in the task queue. Further no worker
+    // thread will be working on the given task.
+    void scheduleTaskAndWaitOrError(const std::shared_ptr<Task>& task,
+        processor::ExecutionContext* context, bool launchNewWorkerThread = false);
+
+    static TaskScheduler* Get(const main::ClientContext& context);
+
+private:
+    // Functions to launch worker threads and for the worker threads to use to grab task from queue.
+    void runWorkerThread();
+
+    std::shared_ptr<ScheduledTask> pushTaskIntoQueue(const std::shared_ptr<Task>& task);
+
+    void removeErroringTask(uint64_t scheduledTaskID);
+
+    std::shared_ptr<ScheduledTask> getTaskAndRegister();
+    static void runTask(Task* task);
+
+private:
+    std::deque<std::shared_ptr<ScheduledTask>> taskQueue;
+    bool stopWorkerThreads;
+    std::vector<std::thread> workerThreads;
+    std::mutex taskSchedulerMtx;
+    std::condition_variable cv;
+    uint64_t nextScheduledTaskID;
+#if defined(__APPLE__)
+    uint32_t threadQos; // Thread quality of service for worker threads.
+#endif
+};
+#else
+// Single-threaded version of TaskScheduler
+class TaskScheduler {
+public:
+    explicit TaskScheduler(uint64_t numWorkerThreads);
+    ~TaskScheduler();
+
+    void scheduleTaskAndWaitOrError(const std::shared_ptr<Task>& task,
+        processor::ExecutionContext* context, bool launchNewWorkerThread = false);
+
+    static TaskScheduler* Get(const main::ClientContext& context);
+
+private:
+    std::shared_ptr<ScheduledTask> pushTaskIntoQueue(const std::shared_ptr<Task>& task);
+
+    void removeErroringTask(uint64_t scheduledTaskID);
+
+    std::shared_ptr<ScheduledTask> getTaskAndRegister();
+    static void runTask(Task* task);
+
+private:
+    std::deque<std::shared_ptr<ScheduledTask>> taskQueue;
+    bool stopWorkerThreads;
+    std::mutex taskSchedulerMtx;
+    uint64_t nextScheduledTaskID;
+};
+#endif
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/terminal_progress_bar_display.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/terminal_progress_bar_display.h
new file mode 100644
index 0000000000..7cd2387c65
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/task_system/terminal_progress_bar_display.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include <iostream>
+
+#include "progress_bar_display.h"
+
+namespace lbug {
+namespace common {
+
+/**
+ * @brief A class that displays a progress bar in the terminal.
+ */
+class TerminalProgressBarDisplay final : public ProgressBarDisplay {
+public:
+    void updateProgress(uint64_t queryID, double newPipelineProgress,
+        uint32_t newNumPipelinesFinished) override;
+
+    void finishProgress(uint64_t queryID) override;
+
+private:
+    void setGreenFont() const { std::cerr << "\033[1;32m"; }
+
+    void setDefaultFont() const { std::cerr << "\033[0m"; }
+
+    void printProgressBar();
+
+private:
+    bool printing = false;
+    std::atomic<bool> currentlyPrintingProgress;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/timer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/timer.h
new file mode 100644
index 0000000000..7f609d9186
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/timer.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include <chrono>
+#include <string>
+
+#include "common/assert.h"
+#include "exception/exception.h"
+
+namespace lbug {
+namespace common {
+
+class Timer {
+
+public:
+    void start() {
+        finished = false;
+        startTime = std::chrono::high_resolution_clock::now();
+    }
+
+    void stop() {
+        stopTime = std::chrono::high_resolution_clock::now();
+        finished = true;
+    }
+
+    double getDuration() const {
+        if (finished) {
+            auto duration = stopTime - startTime;
+            return (double)std::chrono::duration_cast<std::chrono::microseconds>(duration).count();
+        }
+        throw Exception("Timer is still running.");
+    }
+
+    uint64_t getElapsedTimeInMS() const {
+        auto now = std::chrono::high_resolution_clock::now();
+        auto duration = now - startTime;
+        auto count = std::chrono::duration_cast<std::chrono::milliseconds>(duration).count();
+        KU_ASSERT(count >= 0);
+        return count;
+    }
+
+private:
+    std::chrono::time_point<std::chrono::high_resolution_clock> startTime;
+    std::chrono::time_point<std::chrono::high_resolution_clock> stopTime;
+    bool finished = false;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/type_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/type_utils.h
new file mode 100644
index 0000000000..f5574f5997
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/type_utils.h
@@ -0,0 +1,333 @@
+#pragma once
+
+#include <type_traits>
+
+#include "common/assert.h"
+#include "common/types/blob.h"
+#include "common/types/date_t.h"
+#include "common/types/int128_t.h"
+#include "common/types/interval_t.h"
+#include "common/types/ku_string.h"
+#include "common/types/timestamp_t.h"
+#include "common/types/types.h"
+#include "common/types/uint128_t.h"
+#include "common/types/uuid.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace common {
+
+class ValueVector;
+
+template<class... Funcs>
+struct overload : Funcs... {
+    explicit overload(Funcs... funcs) : Funcs(funcs)... {}
+    using Funcs::operator()...;
+};
+
+class TypeUtils {
+public:
+    template<typename Func, typename... Types, size_t... indices>
+    static void paramPackForEachHelper(const Func& func, std::index_sequence<indices...>,
+        Types&&... values) {
+        ((func(indices, values)), ...);
+    }
+
+    template<typename Func, typename... Types>
+    static void paramPackForEach(const Func& func, Types&&... values) {
+        paramPackForEachHelper(func, std::index_sequence_for<Types...>(),
+            std::forward<Types>(values)...);
+    }
+
+    static std::string entryToString(const LogicalType& dataType, const uint8_t* value,
+        ValueVector* vector);
+
+    template<typename T>
+    static inline std::string toString(const T& val, void* /*valueVector*/ = nullptr) {
+        if constexpr (std::is_same_v<T, std::string>) {
+            return val;
+        } else if constexpr (std::is_same_v<T, ku_string_t>) {
+            return val.getAsString();
+        } else {
+            static_assert(std::is_same<T, int64_t>::value || std::is_same<T, int32_t>::value ||
+                          std::is_same<T, int16_t>::value || std::is_same<T, int8_t>::value ||
+                          std::is_same<T, uint64_t>::value || std::is_same<T, uint32_t>::value ||
+                          std::is_same<T, uint16_t>::value || std::is_same<T, uint8_t>::value ||
+                          std::is_same<T, double>::value || std::is_same<T, float>::value);
+            return std::to_string(val);
+        }
+    }
+    static std::string nodeToString(const struct_entry_t& val, ValueVector* vector);
+    static std::string relToString(const struct_entry_t& val, ValueVector* vector);
+
+    static inline void encodeOverflowPtr(uint64_t& overflowPtr, page_idx_t pageIdx,
+        uint32_t pageOffset) {
+        memcpy(&overflowPtr, &pageIdx, 4);
+        memcpy(((uint8_t*)&overflowPtr) + 4, &pageOffset, 4);
+    }
+    static inline void decodeOverflowPtr(uint64_t overflowPtr, page_idx_t& pageIdx,
+        uint32_t& pageOffset) {
+        pageIdx = 0;
+        memcpy(&pageIdx, &overflowPtr, 4);
+        memcpy(&pageOffset, ((uint8_t*)&overflowPtr) + 4, 4);
+    }
+
+    template<typename T>
+    static inline constexpr common::PhysicalTypeID getPhysicalTypeIDForType() {
+        if constexpr (std::is_same_v<T, int64_t>) {
+            return common::PhysicalTypeID::INT64;
+        } else if constexpr (std::is_same_v<T, int32_t>) {
+            return common::PhysicalTypeID::INT32;
+        } else if constexpr (std::is_same_v<T, int16_t>) {
+            return common::PhysicalTypeID::INT16;
+        } else if constexpr (std::is_same_v<T, int8_t>) {
+            return common::PhysicalTypeID::INT8;
+        } else if constexpr (std::is_same_v<T, uint64_t>) {
+            return common::PhysicalTypeID::UINT64;
+        } else if constexpr (std::is_same_v<T, uint32_t>) {
+            return common::PhysicalTypeID::UINT32;
+        } else if constexpr (std::is_same_v<T, uint16_t>) {
+            return common::PhysicalTypeID::UINT16;
+        } else if constexpr (std::is_same_v<T, uint8_t>) {
+            return common::PhysicalTypeID::UINT8;
+        } else if constexpr (std::is_same_v<T, float>) {
+            return common::PhysicalTypeID::FLOAT;
+        } else if constexpr (std::is_same_v<T, double>) {
+            return common::PhysicalTypeID::DOUBLE;
+        } else if constexpr (std::is_same_v<T, int128_t>) {
+            return common::PhysicalTypeID::INT128;
+        } else if constexpr (std::is_same_v<T, interval_t>) {
+            return common::PhysicalTypeID::INTERVAL;
+        } else if constexpr (std::is_same_v<T, uint128_t>) {
+            return common::PhysicalTypeID::UINT128;
+        } else if constexpr (std::same_as<T, ku_string_t> || std::same_as<T, std::string> ||
+                             std::same_as<T, std::string_view>) {
+            return common::PhysicalTypeID::STRING;
+        } else {
+            KU_UNREACHABLE;
+        }
+    }
+
+    /*
+     * TypeUtils::visit can be used to call generic code on all or some Logical and Physical type
+     * variants with access to type information.
+     *
+     * E.g.
+     *
+     *  std::string result;
+     *  visit(dataType, [&]<typename T>(T) {
+     *      if constexpr(std::is_same_v<T, ku_string_t>()) {
+     *          result = vector->getValue<ku_string_t>(0).getAsString();
+     *      } else if (std::integral<T>) {
+     *          result = std::to_string(vector->getValue<T>(0));
+     *      } else {
+     *          KU_UNREACHABLE;
+     *      }
+     *  });
+     *
+     * or
+     *  std::string result;
+     *  visit(dataType,
+     *      [&](ku_string_t) {
+     *          result = vector->getValue<ku_string_t>(0);
+     *      },
+     *      [&]<std::integral T>(T) {
+     *          result = std::to_string(vector->getValue<T>(0));
+     *      },
+     *      [](auto) { KU_UNREACHABLE; }
+     *  );
+     *
+     * Note that when multiple functions are provided, at least one function must match all data
+     * types.
+     *
+     * Also note that implicit conversions may occur with the multi-function variant
+     * if you don't include a generic auto function to cover types which aren't explicitly included.
+     * See https://en.cppreference.com/w/cpp/utility/variant/visit
+     */
+    template<typename... Fs>
+    static inline auto visit(const LogicalType& dataType, Fs... funcs) {
+        // Note: arguments are used only for type deduction and have no meaningful value.
+        // They should be optimized out by the compiler
+        auto func = overload(funcs...);
+        switch (dataType.getLogicalTypeID()) {
+        /* NOLINTBEGIN(bugprone-branch-clone)*/
+        case LogicalTypeID::INT8:
+            return func(int8_t());
+        case LogicalTypeID::UINT8:
+            return func(uint8_t());
+        case LogicalTypeID::INT16:
+            return func(int16_t());
+        case LogicalTypeID::UINT16:
+            return func(uint16_t());
+        case LogicalTypeID::INT32:
+            return func(int32_t());
+        case LogicalTypeID::UINT32:
+            return func(uint32_t());
+        case LogicalTypeID::SERIAL:
+        case LogicalTypeID::INT64:
+            return func(int64_t());
+        case LogicalTypeID::UINT64:
+            return func(uint64_t());
+        case LogicalTypeID::BOOL:
+            return func(bool());
+        case LogicalTypeID::INT128:
+            return func(int128_t());
+        case LogicalTypeID::DOUBLE:
+            return func(double());
+        case LogicalTypeID::FLOAT:
+            return func(float());
+        case LogicalTypeID::DECIMAL:
+            switch (dataType.getPhysicalType()) {
+            case PhysicalTypeID::INT16:
+                return func(int16_t());
+            case PhysicalTypeID::INT32:
+                return func(int32_t());
+            case PhysicalTypeID::INT64:
+                return func(int64_t());
+            case PhysicalTypeID::INT128:
+                return func(int128_t());
+            default:
+                KU_UNREACHABLE;
+            }
+        case LogicalTypeID::INTERVAL:
+            return func(interval_t());
+        case LogicalTypeID::INTERNAL_ID:
+            return func(internalID_t());
+        case LogicalTypeID::UINT128:
+            return func(uint128_t());
+        case LogicalTypeID::STRING:
+            return func(ku_string_t());
+        case LogicalTypeID::DATE:
+            return func(date_t());
+        case LogicalTypeID::TIMESTAMP_NS:
+            return func(timestamp_ns_t());
+        case LogicalTypeID::TIMESTAMP_MS:
+            return func(timestamp_ms_t());
+        case LogicalTypeID::TIMESTAMP_SEC:
+            return func(timestamp_sec_t());
+        case LogicalTypeID::TIMESTAMP_TZ:
+            return func(timestamp_tz_t());
+        case LogicalTypeID::TIMESTAMP:
+            return func(timestamp_t());
+        case LogicalTypeID::BLOB:
+            return func(blob_t());
+        case LogicalTypeID::UUID:
+            return func(ku_uuid_t());
+        case LogicalTypeID::ARRAY:
+        case LogicalTypeID::LIST:
+            return func(list_entry_t());
+        case LogicalTypeID::MAP:
+            return func(map_entry_t());
+        case LogicalTypeID::NODE:
+        case LogicalTypeID::REL:
+        case LogicalTypeID::RECURSIVE_REL:
+        case LogicalTypeID::STRUCT:
+            return func(struct_entry_t());
+        case LogicalTypeID::UNION:
+            return func(union_entry_t());
+        /* NOLINTEND(bugprone-branch-clone)*/
+        default:
+            // Unsupported type
+            KU_UNREACHABLE;
+        }
+    }
+
+    template<typename... Fs>
+    static inline auto visit(PhysicalTypeID dataType, Fs&&... funcs) {
+        // Note: arguments are used only for type deduction and have no meaningful value.
+        // They should be optimized out by the compiler
+        auto func = overload(funcs...);
+        switch (dataType) {
+        /* NOLINTBEGIN(bugprone-branch-clone)*/
+        case PhysicalTypeID::INT8:
+            return func(int8_t());
+        case PhysicalTypeID::UINT8:
+            return func(uint8_t());
+        case PhysicalTypeID::INT16:
+            return func(int16_t());
+        case PhysicalTypeID::UINT16:
+            return func(uint16_t());
+        case PhysicalTypeID::INT32:
+            return func(int32_t());
+        case PhysicalTypeID::UINT32:
+            return func(uint32_t());
+        case PhysicalTypeID::INT64:
+            return func(int64_t());
+        case PhysicalTypeID::UINT64:
+            return func(uint64_t());
+        case PhysicalTypeID::BOOL:
+            return func(bool());
+        case PhysicalTypeID::INT128:
+            return func(int128_t());
+        case PhysicalTypeID::DOUBLE:
+            return func(double());
+        case PhysicalTypeID::FLOAT:
+            return func(float());
+        case PhysicalTypeID::INTERVAL:
+            return func(interval_t());
+        case PhysicalTypeID::INTERNAL_ID:
+            return func(internalID_t());
+        case PhysicalTypeID::UINT128:
+            return func(uint128_t());
+        case PhysicalTypeID::STRING:
+            return func(ku_string_t());
+        case PhysicalTypeID::ARRAY:
+        case PhysicalTypeID::LIST:
+            return func(list_entry_t());
+        case PhysicalTypeID::STRUCT:
+            return func(struct_entry_t());
+        /* NOLINTEND(bugprone-branch-clone)*/
+        case PhysicalTypeID::ANY:
+        case PhysicalTypeID::POINTER:
+        case PhysicalTypeID::ALP_EXCEPTION_DOUBLE:
+        case PhysicalTypeID::ALP_EXCEPTION_FLOAT:
+            // Unsupported type
+            KU_UNREACHABLE;
+            // Needed for return type deduction to work
+            return func(uint8_t());
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+};
+
+// Forward declaration of template specializations.
+template<>
+std::string TypeUtils::toString(const int128_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const uint128_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const bool& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const internalID_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const date_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const timestamp_ns_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const timestamp_ms_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const timestamp_sec_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const timestamp_tz_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const timestamp_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const interval_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const ku_string_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const blob_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const ku_uuid_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const list_entry_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const map_entry_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const struct_entry_t& val, void* valueVector);
+template<>
+std::string TypeUtils::toString(const union_entry_t& val, void* valueVector);
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/blob.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/blob.h
new file mode 100644
index 0000000000..9bbb6cc899
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/blob.h
@@ -0,0 +1,52 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace common {
+
+struct blob_t {
+    ku_string_t value;
+};
+
+struct HexFormatConstants {
+    // map of integer -> hex value.
+    static constexpr const char* HEX_TABLE = "0123456789ABCDEF";
+    // reverse map of byte -> integer value, or -1 for invalid hex values.
+    static const int HEX_MAP[256];
+    static constexpr const uint64_t NUM_BYTES_TO_SHIFT_FOR_FIRST_BYTE = 4;
+    static constexpr const uint64_t SECOND_BYTE_MASK = 0x0F;
+    static constexpr const char PREFIX[] = "\\x";
+    static constexpr const uint64_t PREFIX_LENGTH = 2;
+    static constexpr const uint64_t FIRST_BYTE_POS = PREFIX_LENGTH;
+    static constexpr const uint64_t SECOND_BYTES_POS = PREFIX_LENGTH + 1;
+    static constexpr const uint64_t LENGTH = 4;
+};
+
+struct Blob {
+    static std::string toString(const uint8_t* value, uint64_t len);
+
+    static inline std::string toString(const blob_t& blob) {
+        return toString(blob.value.getData(), blob.value.len);
+    }
+
+    static uint64_t getBlobSize(const ku_string_t& blob);
+
+    static uint64_t fromString(const char* str, uint64_t length, uint8_t* resultBuffer);
+
+    template<typename T>
+    static inline T getValue(const blob_t& data) {
+        return *reinterpret_cast<const T*>(data.value.getData());
+    }
+    template<typename T>
+    // NOLINTNEXTLINE(readability-non-const-parameter): Would cast away qualifiers.
+    static inline T getValue(char* data) {
+        return *reinterpret_cast<T*>(data);
+    }
+
+private:
+    static void validateHexCode(const uint8_t* blobStr, uint64_t length, uint64_t curPos);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/cast_helpers.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/cast_helpers.h
new file mode 100644
index 0000000000..0f4c5454ec
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/cast_helpers.h
@@ -0,0 +1,297 @@
+#pragma once
+
+#include <cstring>
+
+#include "common/types/date_t.h"
+#include "interval_t.h"
+
+namespace lbug {
+namespace common {
+
+// This is copied from third_party/fmt/include/fmt/format.h and format-inl.h.
+static const char digits[] = "0001020304050607080910111213141516171819"
+                             "2021222324252627282930313233343536373839"
+                             "4041424344454647484950515253545556575859"
+                             "6061626364656667686970717273747576777879"
+                             "8081828384858687888990919293949596979899";
+
+//! NumericHelper is a static class that holds helper functions for integers/doubles
+class NumericHelper {
+public:
+    // Formats value in reverse and returns a pointer to the beginning.
+    template<class T>
+    static char* FormatUnsigned(T value, char* ptr) {
+        while (value >= 100) {
+            // Integer division is slow so do it for a group of two digits instead
+            // of for every digit. The idea comes from the talk by Alexandrescu
+            // "Three Optimization Tips for C++".
+            auto index = static_cast<unsigned>((value % 100) * 2);
+            value /= 100;
+            *--ptr = digits[index + 1];
+            *--ptr = digits[index];
+        }
+        if (value < 10) {
+            *--ptr = static_cast<char>('0' + value);
+            return ptr;
+        }
+        auto index = static_cast<unsigned>(value * 2);
+        *--ptr = digits[index + 1];
+        *--ptr = digits[index];
+        return ptr;
+    }
+    static int getUnsignedInt64Length(uint64_t value) {
+        if (value >= 10000000000ULL) {
+            if (value >= 1000000000000000ULL) {
+                int length = 16;
+                length += value >= 10000000000000000ULL;
+                length += value >= 100000000000000000ULL;
+                length += value >= 1000000000000000000ULL;
+                length += value >= 10000000000000000000ULL;
+                return length;
+            } else {
+                int length = 11;
+                length += value >= 100000000000ULL;
+                length += value >= 1000000000000ULL;
+                length += value >= 10000000000000ULL;
+                length += value >= 100000000000000ULL;
+                return length;
+            }
+        } else {
+            if (value >= 100000ULL) {
+                int length = 6;
+                length += value >= 1000000ULL;
+                length += value >= 10000000ULL;
+                length += value >= 100000000ULL;
+                length += value >= 1000000000ULL;
+                return length;
+            } else {
+                int length = 1;
+                length += value >= 10ULL;
+                length += value >= 100ULL;
+                length += value >= 1000ULL;
+                length += value >= 10000ULL;
+                return length;
+            }
+        }
+    }
+};
+
+struct DateToStringCast {
+    static uint64_t Length(int32_t date[], uint64_t& yearLength, bool& addBC) {
+        // format is YYYY-MM-DD with optional (BC) at the end
+        // regular length is 10
+        uint64_t length = 6;
+        yearLength = 4;
+        addBC = false;
+        if (date[0] <= 0) {
+            // add (BC) suffix
+            length += strlen(Date::BC_SUFFIX);
+            date[0] = -date[0] + 1;
+            addBC = true;
+        }
+
+        // potentially add extra characters depending on length of year
+        yearLength += date[0] >= 10000;
+        yearLength += date[0] >= 100000;
+        yearLength += date[0] >= 1000000;
+        yearLength += date[0] >= 10000000;
+        length += yearLength;
+        return length;
+    }
+
+    static void Format(char* data, int32_t date[], uint64_t yearLen, bool addBC) {
+        // now we write the string, first write the year
+        auto endptr = data + yearLen;
+        endptr = NumericHelper::FormatUnsigned(date[0], endptr);
+        // add optional leading zeros
+        while (endptr > data) {
+            *--endptr = '0';
+        }
+        // now write the month and day
+        auto ptr = data + yearLen;
+        for (int i = 1; i <= 2; i++) {
+            ptr[0] = '-';
+            if (date[i] < 10) {
+                ptr[1] = '0';
+                ptr[2] = '0' + date[i];
+            } else {
+                auto index = static_cast<unsigned>(date[i] * 2);
+                ptr[1] = digits[index];
+                ptr[2] = digits[index + 1];
+            }
+            ptr += 3;
+        }
+        // optionally add BC to the end of the date
+        if (addBC) {
+            memcpy(ptr, Date::BC_SUFFIX, // NOLINT(bugprone-not-null-terminated-result): no need to
+                                         // put null terminator
+                strlen(Date::BC_SUFFIX));
+        }
+    }
+};
+
+struct TimeToStringCast {
+    // Format microseconds to a buffer of length 6. Returns the number of trailing zeros
+    static int32_t FormatMicros(uint32_t microseconds, char micro_buffer[]) {
+        char* endptr = micro_buffer + 6;
+        endptr = NumericHelper::FormatUnsigned<uint32_t>(microseconds, endptr);
+        while (endptr > micro_buffer) {
+            *--endptr = '0';
+        }
+        uint64_t trailing_zeros = 0;
+        for (uint64_t i = 5; i > 0; i--) {
+            if (micro_buffer[i] != '0') {
+                break;
+            }
+            trailing_zeros++;
+        }
+        return trailing_zeros;
+    }
+
+    static uint64_t Length(int32_t time[], char micro_buffer[]) {
+        // format is HH:MM:DD.MS
+        // microseconds come after the time with a period separator
+        uint64_t length = 0;
+        if (time[3] == 0) {
+            // no microseconds
+            // format is HH:MM:DD
+            length = 8;
+        } else {
+            length = 15;
+            // for microseconds, we truncate any trailing zeros (i.e. "90000" becomes ".9")
+            // first write the microseconds to the microsecond buffer
+            // we write backwards and pad with zeros to the left
+            // now we figure out how many digits we need to include by looking backwards
+            // and checking how many zeros we encounter
+            length -= FormatMicros(time[3], micro_buffer);
+        }
+        return length;
+    }
+
+    static void FormatTwoDigits(char* ptr, int32_t value) {
+        if (value < 10) {
+            ptr[0] = '0';
+            ptr[1] = '0' + value;
+        } else {
+            auto index = static_cast<unsigned>(value * 2);
+            ptr[0] = digits[index];
+            ptr[1] = digits[index + 1];
+        }
+    }
+
+    static void Format(char* data, uint64_t length, int32_t time[], char micro_buffer[]) {
+        // first write hour, month and day
+        auto ptr = data;
+        ptr[2] = ':';
+        ptr[5] = ':';
+        for (int i = 0; i <= 2; i++) {
+            FormatTwoDigits(ptr, time[i]);
+            ptr += 3;
+        }
+        if (length > 8) {
+            // write the micro seconds at the end
+            data[8] = '.';
+            memcpy(data + 9, micro_buffer, length - 9);
+        }
+    }
+};
+
+struct IntervalToStringCast {
+    static void FormatSignedNumber(int64_t value, char buffer[], uint64_t& length) {
+        int sign = -(value < 0);
+        uint64_t unsigned_value = (value ^ sign) - sign;
+        length += NumericHelper::getUnsignedInt64Length(unsigned_value) - sign;
+        auto endptr = buffer + length;
+        endptr = NumericHelper::FormatUnsigned<uint64_t>(unsigned_value, endptr);
+        if (sign) {
+            *--endptr = '-';
+        }
+    }
+
+    static void FormatTwoDigits(int64_t value, char buffer[], uint64_t& length) {
+        TimeToStringCast::FormatTwoDigits(buffer + length, value);
+        length += 2;
+    }
+
+    static void FormatIntervalValue(int32_t value, char buffer[], uint64_t& length,
+        const char* name, uint64_t name_len) {
+        if (value == 0) {
+            return;
+        }
+        if (length != 0) {
+            // space if there is already something in the buffer
+            buffer[length++] = ' ';
+        }
+        FormatSignedNumber(value, buffer, length);
+        // append the name together with a potential "s" (for plurals)
+        memcpy(buffer + length, name, name_len);
+        length += name_len;
+        if (value != 1) {
+            buffer[length++] = 's';
+        }
+    }
+
+    //! Formats an interval to a buffer, the buffer should be >=70 characters
+    //! years: 17 characters (max value: "-2147483647 years")
+    //! months: 9 (max value: "12 months")
+    //! days: 16 characters (max value: "-2147483647 days")
+    //! time: 24 characters (max value: -2562047788:00:00.123456)
+    //! spaces between all characters (+3 characters)
+    //! Total: 70 characters
+    //! Returns the length of the interval
+    static uint64_t Format(interval_t interval, char buffer[]) {
+        uint64_t length = 0;
+        if (interval.months != 0) {
+            int32_t years = interval.months / 12;
+            int32_t months = interval.months - years * 12;
+            // format the years and months
+            FormatIntervalValue(years, buffer, length, " year", 5);
+            FormatIntervalValue(months, buffer, length, " month", 6);
+        }
+        if (interval.days != 0) {
+            // format the days
+            FormatIntervalValue(interval.days, buffer, length, " day", 4);
+        }
+        if (interval.micros != 0) {
+            if (length != 0) {
+                // space if there is already something in the buffer
+                buffer[length++] = ' ';
+            }
+            int64_t micros = interval.micros;
+            if (micros < 0) {
+                // negative time: append negative sign
+                buffer[length++] = '-';
+                micros = -micros;
+            }
+            int64_t hour = micros / Interval::MICROS_PER_HOUR;
+            micros -= hour * Interval::MICROS_PER_HOUR;
+            int64_t min = micros / Interval::MICROS_PER_MINUTE;
+            micros -= min * Interval::MICROS_PER_MINUTE;
+            int64_t sec = micros / Interval::MICROS_PER_SEC;
+            micros -= sec * Interval::MICROS_PER_SEC;
+
+            if (hour < 10) {
+                buffer[length++] = '0';
+            }
+            FormatSignedNumber(hour, buffer, length);
+            buffer[length++] = ':';
+            FormatTwoDigits(min, buffer, length);
+            buffer[length++] = ':';
+            FormatTwoDigits(sec, buffer, length);
+            if (micros != 0) {
+                buffer[length++] = '.';
+                auto trailing_zeros = TimeToStringCast::FormatMicros(micros, buffer + length);
+                length += 6 - trailing_zeros;
+            }
+        } else if (length == 0) {
+            // empty interval: default to 00:00:00
+            strcpy(buffer, "00:00:00"); // NOLINT(clang-analyzer-security.insecureAPI.strcpy):
+                                        // safety guaranteed by Length().
+            return 8;
+        }
+        return length;
+    }
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/date_t.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/date_t.h
new file mode 100644
index 0000000000..bbdd1d049e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/date_t.h
@@ -0,0 +1,121 @@
+#pragma once
+
+#include "interval_t.h"
+
+namespace lbug {
+
+namespace regex {
+class RE2;
+}
+
+namespace common {
+
+struct timestamp_t;
+
+// System representation of dates as the number of days since 1970-01-01.
+struct LBUG_API date_t {
+    int32_t days;
+
+    date_t();
+    explicit date_t(int32_t days_p);
+
+    // Comparison operators with date_t.
+    bool operator==(const date_t& rhs) const;
+    bool operator!=(const date_t& rhs) const;
+    bool operator<=(const date_t& rhs) const;
+    bool operator<(const date_t& rhs) const;
+    bool operator>(const date_t& rhs) const;
+    bool operator>=(const date_t& rhs) const;
+
+    // Comparison operators with timestamp_t.
+    bool operator==(const timestamp_t& rhs) const;
+    bool operator!=(const timestamp_t& rhs) const;
+    bool operator<(const timestamp_t& rhs) const;
+    bool operator<=(const timestamp_t& rhs) const;
+    bool operator>(const timestamp_t& rhs) const;
+    bool operator>=(const timestamp_t& rhs) const;
+
+    // arithmetic operators
+    date_t operator+(const int32_t& day) const;
+    date_t operator-(const int32_t& day) const;
+
+    date_t operator+(const interval_t& interval) const;
+    date_t operator-(const interval_t& interval) const;
+
+    int64_t operator-(const date_t& rhs) const;
+};
+
+inline date_t operator+(int64_t i, const date_t date) {
+    return date + i;
+}
+
+// Note: Aside from some minor changes, this implementation is copied from DuckDB's source code:
+// https://github.com/duckdb/duckdb/blob/master/src/include/duckdb/common/types/date.hpp.
+// https://github.com/duckdb/duckdb/blob/master/src/common/types/date.cpp.
+// For example, instead of using their idx_t type to refer to indices, we directly use uint64_t,
+// which is the actual type of idx_t (so we say uint64_t len instead of idx_t len). When more
+// functionality is needed, we should first consult these DuckDB links.
+class Date {
+public:
+    LBUG_API static const int32_t NORMAL_DAYS[13];
+    LBUG_API static const int32_t CUMULATIVE_DAYS[13];
+    LBUG_API static const int32_t LEAP_DAYS[13];
+    LBUG_API static const int32_t CUMULATIVE_LEAP_DAYS[13];
+    LBUG_API static const int32_t CUMULATIVE_YEAR_DAYS[401];
+    LBUG_API static const int8_t MONTH_PER_DAY_OF_YEAR[365];
+    LBUG_API static const int8_t LEAP_MONTH_PER_DAY_OF_YEAR[366];
+
+    LBUG_API constexpr static const int32_t MIN_YEAR = -290307;
+    LBUG_API constexpr static const int32_t MAX_YEAR = 294247;
+    LBUG_API constexpr static const int32_t EPOCH_YEAR = 1970;
+
+    LBUG_API constexpr static const int32_t YEAR_INTERVAL = 400;
+    LBUG_API constexpr static const int32_t DAYS_PER_YEAR_INTERVAL = 146097;
+    constexpr static const char* BC_SUFFIX = " (BC)";
+
+    // Convert a string in the format "YYYY-MM-DD" to a date object
+    LBUG_API static date_t fromCString(const char* str, uint64_t len);
+    // Convert a date object to a string in the format "YYYY-MM-DD"
+    LBUG_API static std::string toString(date_t date);
+    // Try to convert text in a buffer to a date; returns true if parsing was successful
+    LBUG_API static bool tryConvertDate(const char* buf, uint64_t len, uint64_t& pos,
+        date_t& result, bool allowTrailing = false);
+
+    // private:
+    // Returns true if (year) is a leap year, and false otherwise
+    LBUG_API static bool isLeapYear(int32_t year);
+    // Returns true if the specified (year, month, day) combination is a valid
+    // date
+    LBUG_API static bool isValid(int32_t year, int32_t month, int32_t day);
+    // Extract the year, month and day from a given date object
+    LBUG_API static void convert(date_t date, int32_t& out_year, int32_t& out_month,
+        int32_t& out_day);
+    // Create a Date object from a specified (year, month, day) combination
+    LBUG_API static date_t fromDate(int32_t year, int32_t month, int32_t day);
+
+    // Helper function to parse two digits from a string (e.g. "30" -> 30, "03" -> 3, "3" -> 3)
+    LBUG_API static bool parseDoubleDigit(const char* buf, uint64_t len, uint64_t& pos,
+        int32_t& result);
+
+    LBUG_API static int32_t monthDays(int32_t year, int32_t month);
+
+    LBUG_API static std::string getDayName(date_t date);
+
+    LBUG_API static std::string getMonthName(date_t date);
+
+    LBUG_API static date_t getLastDay(date_t date);
+
+    LBUG_API static int32_t getDatePart(DatePartSpecifier specifier, date_t date);
+
+    LBUG_API static date_t trunc(DatePartSpecifier specifier, date_t date);
+
+    LBUG_API static int64_t getEpochNanoSeconds(const date_t& date);
+
+    LBUG_API static const regex::RE2& regexPattern();
+
+private:
+    static void extractYearOffset(int32_t& n, int32_t& year, int32_t& year_offset);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/dtime_t.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/dtime_t.h
new file mode 100644
index 0000000000..524f72f412
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/dtime_t.h
@@ -0,0 +1,67 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+// Type used to represent time (microseconds)
+struct LBUG_API dtime_t {
+    int64_t micros;
+
+    dtime_t();
+    explicit dtime_t(int64_t micros_p);
+    dtime_t& operator=(int64_t micros_p);
+
+    // explicit conversion
+    explicit operator int64_t() const;
+    explicit operator double() const;
+
+    // comparison operators
+    bool operator==(const dtime_t& rhs) const;
+    bool operator!=(const dtime_t& rhs) const;
+    bool operator<=(const dtime_t& rhs) const;
+    bool operator<(const dtime_t& rhs) const;
+    bool operator>(const dtime_t& rhs) const;
+    bool operator>=(const dtime_t& rhs) const;
+};
+
+// Note: Aside from some minor changes, this implementation is copied from DuckDB's source code:
+// https://github.com/duckdb/duckdb/blob/master/src/include/duckdb/common/types/time.hpp.
+// https://github.com/duckdb/duckdb/blob/master/src/common/types/time.cpp.
+// For example, instead of using their idx_t type to refer to indices, we directly use uint64_t,
+// which is the actual type of idx_t (so we say uint64_t len instead of idx_t len). When more
+// functionality is needed, we should first consult these DuckDB links.
+class Time {
+public:
+    // Convert a string in the format "hh:mm:ss" to a time object
+    LBUG_API static dtime_t fromCString(const char* buf, uint64_t len);
+    LBUG_API static bool tryConvertInterval(const char* buf, uint64_t len, uint64_t& pos,
+        dtime_t& result);
+    LBUG_API static bool tryConvertTime(const char* buf, uint64_t len, uint64_t& pos,
+        dtime_t& result);
+
+    // Convert a time object to a string in the format "hh:mm:ss"
+    LBUG_API static std::string toString(dtime_t time);
+
+    LBUG_API static dtime_t fromTime(int32_t hour, int32_t minute, int32_t second,
+        int32_t microseconds = 0);
+
+    // Extract the time from a given timestamp object
+    LBUG_API static void convert(dtime_t time, int32_t& out_hour, int32_t& out_min,
+        int32_t& out_sec, int32_t& out_micros);
+
+    LBUG_API static bool isValid(int32_t hour, int32_t minute, int32_t second,
+        int32_t milliseconds);
+
+private:
+    static bool tryConvertInternal(const char* buf, uint64_t len, uint64_t& pos, dtime_t& result);
+    static dtime_t fromTimeInternal(int32_t hour, int32_t minute, int32_t second,
+        int32_t microseconds = 0);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/int128_t.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/int128_t.h
new file mode 100644
index 0000000000..d64a8d4f4d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/int128_t.h
@@ -0,0 +1,230 @@
+// =========================================================================================
+// This int128 implementtaion got
+
+// =========================================================================================
+#pragma once
+
+#include <cstdint>
+#include <functional>
+#include <string>
+
+#include "common/api.h"
+#include "common/exception/overflow.h"
+
+namespace lbug {
+namespace common {
+
+struct LBUG_API int128_t;
+struct uint128_t;
+
+// System representation for int128_t.
+struct LBUG_API int128_t {
+    uint64_t low;
+    int64_t high;
+
+    int128_t() noexcept = default;
+    int128_t(int64_t value);  // NOLINT: Allow implicit conversion from numeric values
+    int128_t(int32_t value);  // NOLINT: Allow implicit conversion from numeric values
+    int128_t(int16_t value);  // NOLINT: Allow implicit conversion from numeric values
+    int128_t(int8_t value);   // NOLINT: Allow implicit conversion from numeric values
+    int128_t(uint64_t value); // NOLINT: Allow implicit conversion from numeric values
+    int128_t(uint32_t value); // NOLINT: Allow implicit conversion from numeric values
+    int128_t(uint16_t value); // NOLINT: Allow implicit conversion from numeric values
+    int128_t(uint8_t value);  // NOLINT: Allow implicit conversion from numeric values
+    int128_t(double value);   // NOLINT: Allow implicit conversion from numeric values
+    int128_t(float value);    // NOLINT: Allow implicit conversion from numeric values
+
+    constexpr int128_t(uint64_t low, int64_t high) noexcept : low(low), high(high) {}
+
+    constexpr int128_t(const int128_t&) noexcept = default;
+    constexpr int128_t(int128_t&&) noexcept = default;
+    int128_t& operator=(const int128_t&) noexcept = default;
+    int128_t& operator=(int128_t&&) noexcept = default;
+
+    int128_t operator-() const;
+
+    // inplace arithmetic operators
+    int128_t& operator+=(const int128_t& rhs);
+    int128_t& operator*=(const int128_t& rhs);
+    int128_t& operator|=(const int128_t& rhs);
+    int128_t& operator&=(const int128_t& rhs);
+
+    // cast operators
+    explicit operator int64_t() const;
+    explicit operator int32_t() const;
+    explicit operator int16_t() const;
+    explicit operator int8_t() const;
+    explicit operator uint64_t() const;
+    explicit operator uint32_t() const;
+    explicit operator uint16_t() const;
+    explicit operator uint8_t() const;
+    explicit operator double() const;
+    explicit operator float() const;
+
+    explicit operator uint128_t() const;
+};
+
+// arithmetic operators
+LBUG_API int128_t operator+(const int128_t& lhs, const int128_t& rhs);
+LBUG_API int128_t operator-(const int128_t& lhs, const int128_t& rhs);
+LBUG_API int128_t operator*(const int128_t& lhs, const int128_t& rhs);
+LBUG_API int128_t operator/(const int128_t& lhs, const int128_t& rhs);
+LBUG_API int128_t operator%(const int128_t& lhs, const int128_t& rhs);
+LBUG_API int128_t operator^(const int128_t& lhs, const int128_t& rhs);
+LBUG_API int128_t operator&(const int128_t& lhs, const int128_t& rhs);
+LBUG_API int128_t operator~(const int128_t& val);
+LBUG_API int128_t operator|(const int128_t& lhs, const int128_t& rhs);
+LBUG_API int128_t operator<<(const int128_t& lhs, int amount);
+LBUG_API int128_t operator>>(const int128_t& lhs, int amount);
+
+// comparison operators
+LBUG_API bool operator==(const int128_t& lhs, const int128_t& rhs);
+LBUG_API bool operator!=(const int128_t& lhs, const int128_t& rhs);
+LBUG_API bool operator>(const int128_t& lhs, const int128_t& rhs);
+LBUG_API bool operator>=(const int128_t& lhs, const int128_t& rhs);
+LBUG_API bool operator<(const int128_t& lhs, const int128_t& rhs);
+LBUG_API bool operator<=(const int128_t& lhs, const int128_t& rhs);
+
+class Int128_t {
+public:
+    static std::string toString(int128_t input);
+
+    template<class T>
+    static bool tryCast(int128_t input, T& result);
+
+    template<class T>
+    static T cast(int128_t input) {
+        T result;
+        tryCast(input, result);
+        return result;
+    }
+
+    template<class T>
+    static bool tryCastTo(T value, int128_t& result);
+
+    template<class T>
+    static int128_t castTo(T value) {
+        int128_t result{};
+        if (!tryCastTo(value, result)) {
+            throw common::OverflowException("INT128 is out of range");
+        }
+        return result;
+    }
+
+    // negate
+    static void negateInPlace(int128_t& input) {
+        if (input.high == INT64_MIN && input.low == 0) {
+            throw common::OverflowException("INT128 is out of range: cannot negate INT128_MIN");
+        }
+        input.low = UINT64_MAX + 1 - input.low;
+        input.high = -input.high - 1 + (input.low == 0);
+    }
+
+    static int128_t negate(int128_t input) {
+        negateInPlace(input);
+        return input;
+    }
+
+    static bool tryMultiply(int128_t lhs, int128_t rhs, int128_t& result);
+
+    static int128_t Add(int128_t lhs, int128_t rhs);
+    static int128_t Sub(int128_t lhs, int128_t rhs);
+    static int128_t Mul(int128_t lhs, int128_t rhs);
+    static int128_t Div(int128_t lhs, int128_t rhs);
+    static int128_t Mod(int128_t lhs, int128_t rhs);
+    static int128_t Xor(int128_t lhs, int128_t rhs);
+    static int128_t LeftShift(int128_t lhs, int amount);
+    static int128_t RightShift(int128_t lhs, int amount);
+    static int128_t BinaryAnd(int128_t lhs, int128_t rhs);
+    static int128_t BinaryOr(int128_t lhs, int128_t rhs);
+    static int128_t BinaryNot(int128_t val);
+
+    static int128_t divMod(int128_t lhs, int128_t rhs, int128_t& remainder);
+    static int128_t divModPositive(int128_t lhs, uint64_t rhs, uint64_t& remainder);
+
+    static bool addInPlace(int128_t& lhs, int128_t rhs);
+    static bool subInPlace(int128_t& lhs, int128_t rhs);
+
+    // comparison operators
+    static bool equals(int128_t lhs, int128_t rhs) {
+        return lhs.low == rhs.low && lhs.high == rhs.high;
+    }
+
+    static bool notEquals(int128_t lhs, int128_t rhs) {
+        return lhs.low != rhs.low || lhs.high != rhs.high;
+    }
+
+    static bool greaterThan(int128_t lhs, int128_t rhs) {
+        return (lhs.high > rhs.high) || (lhs.high == rhs.high && lhs.low > rhs.low);
+    }
+
+    static bool greaterThanOrEquals(int128_t lhs, int128_t rhs) {
+        return (lhs.high > rhs.high) || (lhs.high == rhs.high && lhs.low >= rhs.low);
+    }
+
+    static bool lessThan(int128_t lhs, int128_t rhs) {
+        return (lhs.high < rhs.high) || (lhs.high == rhs.high && lhs.low < rhs.low);
+    }
+
+    static bool lessThanOrEquals(int128_t lhs, int128_t rhs) {
+        return (lhs.high < rhs.high) || (lhs.high == rhs.high && lhs.low <= rhs.low);
+    }
+};
+
+template<>
+bool Int128_t::tryCast(int128_t input, int8_t& result);
+template<>
+bool Int128_t::tryCast(int128_t input, int16_t& result);
+template<>
+bool Int128_t::tryCast(int128_t input, int32_t& result);
+template<>
+bool Int128_t::tryCast(int128_t input, int64_t& result);
+template<>
+bool Int128_t::tryCast(int128_t input, uint8_t& result);
+template<>
+bool Int128_t::tryCast(int128_t input, uint16_t& result);
+template<>
+bool Int128_t::tryCast(int128_t input, uint32_t& result);
+template<>
+bool Int128_t::tryCast(int128_t input, uint64_t& result);
+template<>
+bool Int128_t::tryCast(int128_t input, uint128_t& result); // signed to unsigned
+template<>
+bool Int128_t::tryCast(int128_t input, float& result);
+template<>
+bool Int128_t::tryCast(int128_t input, double& result);
+template<>
+bool Int128_t::tryCast(int128_t input, long double& result);
+
+template<>
+bool Int128_t::tryCastTo(int8_t value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(int16_t value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(int32_t value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(int64_t value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(uint8_t value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(uint16_t value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(uint32_t value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(uint64_t value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(int128_t value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(float value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(double value, int128_t& result);
+template<>
+bool Int128_t::tryCastTo(long double value, int128_t& result);
+
+} // namespace common
+} // namespace lbug
+
+template<>
+struct std::hash<lbug::common::int128_t> {
+    std::size_t operator()(const lbug::common::int128_t& v) const noexcept;
+};
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/internal_id_util.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/internal_id_util.h
new file mode 100644
index 0000000000..bbb197afa3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/internal_id_util.h
@@ -0,0 +1,18 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "function/hash/hash_functions.h"
+
+namespace lbug {
+namespace common {
+
+using internal_id_set_t = std::unordered_set<internalID_t, function::InternalIDHasher>;
+using node_id_set_t = internal_id_set_t;
+using rel_id_set_t = internal_id_set_t;
+template<typename T>
+using internal_id_map_t = std::unordered_map<internalID_t, T, function::InternalIDHasher>;
+template<typename T>
+using node_id_map_t = internal_id_map_t<T>;
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/interval_t.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/interval_t.h
new file mode 100644
index 0000000000..3ee8c7de77
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/interval_t.h
@@ -0,0 +1,116 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+#include "common/api.h"
+
+namespace lbug {
+
+namespace regex {
+class RE2;
+}
+
+namespace common {
+
+struct timestamp_t;
+struct date_t;
+
+enum class DatePartSpecifier : uint8_t {
+    YEAR,
+    MONTH,
+    DAY,
+    DECADE,
+    CENTURY,
+    MILLENNIUM,
+    QUARTER,
+    MICROSECOND,
+    MILLISECOND,
+    SECOND,
+    MINUTE,
+    HOUR,
+    WEEK,
+};
+
+struct LBUG_API interval_t {
+    int32_t months = 0;
+    int32_t days = 0;
+    int64_t micros = 0;
+
+    interval_t();
+    interval_t(int32_t months_p, int32_t days_p, int64_t micros_p);
+
+    // comparator operators
+    bool operator==(const interval_t& rhs) const;
+    bool operator!=(const interval_t& rhs) const;
+
+    bool operator>(const interval_t& rhs) const;
+    bool operator<=(const interval_t& rhs) const;
+    bool operator<(const interval_t& rhs) const;
+    bool operator>=(const interval_t& rhs) const;
+
+    // arithmetic operators
+    interval_t operator+(const interval_t& rhs) const;
+    timestamp_t operator+(const timestamp_t& rhs) const;
+    date_t operator+(const date_t& rhs) const;
+    interval_t operator-(const interval_t& rhs) const;
+
+    interval_t operator/(const uint64_t& rhs) const;
+};
+
+// Note: Aside from some minor changes, this implementation is copied from DuckDB's source code:
+// https://github.com/duckdb/duckdb/blob/master/src/include/duckdb/common/types/interval.hpp.
+// https://github.com/duckdb/duckdb/blob/master/src/common/types/interval.cpp.
+// When more functionality is needed, we should first consult these DuckDB links.
+// The Interval class is a static class that holds helper functions for the Interval type.
+class Interval {
+public:
+    static constexpr const int32_t MONTHS_PER_MILLENIUM = 12000;
+    static constexpr const int32_t MONTHS_PER_CENTURY = 1200;
+    static constexpr const int32_t MONTHS_PER_DECADE = 120;
+    static constexpr const int32_t MONTHS_PER_YEAR = 12;
+    static constexpr const int32_t MONTHS_PER_QUARTER = 3;
+    static constexpr const int32_t DAYS_PER_WEEK = 7;
+    //! only used for interval comparison/ordering purposes, in which case a month counts as 30 days
+    static constexpr const int64_t DAYS_PER_MONTH = 30;
+    static constexpr const int64_t DAYS_PER_YEAR = 365;
+    static constexpr const int64_t MSECS_PER_SEC = 1000;
+    static constexpr const int32_t SECS_PER_MINUTE = 60;
+    static constexpr const int32_t MINS_PER_HOUR = 60;
+    static constexpr const int32_t HOURS_PER_DAY = 24;
+    static constexpr const int32_t SECS_PER_HOUR = SECS_PER_MINUTE * MINS_PER_HOUR;
+    static constexpr const int32_t SECS_PER_DAY = SECS_PER_HOUR * HOURS_PER_DAY;
+    static constexpr const int32_t SECS_PER_WEEK = SECS_PER_DAY * DAYS_PER_WEEK;
+
+    static constexpr const int64_t MICROS_PER_MSEC = 1000;
+    static constexpr const int64_t MICROS_PER_SEC = MICROS_PER_MSEC * MSECS_PER_SEC;
+    static constexpr const int64_t MICROS_PER_MINUTE = MICROS_PER_SEC * SECS_PER_MINUTE;
+    static constexpr const int64_t MICROS_PER_HOUR = MICROS_PER_MINUTE * MINS_PER_HOUR;
+    static constexpr const int64_t MICROS_PER_DAY = MICROS_PER_HOUR * HOURS_PER_DAY;
+    static constexpr const int64_t MICROS_PER_WEEK = MICROS_PER_DAY * DAYS_PER_WEEK;
+    static constexpr const int64_t MICROS_PER_MONTH = MICROS_PER_DAY * DAYS_PER_MONTH;
+
+    static constexpr const int64_t NANOS_PER_MICRO = 1000;
+    static constexpr const int64_t NANOS_PER_MSEC = NANOS_PER_MICRO * MICROS_PER_MSEC;
+    static constexpr const int64_t NANOS_PER_SEC = NANOS_PER_MSEC * MSECS_PER_SEC;
+    static constexpr const int64_t NANOS_PER_MINUTE = NANOS_PER_SEC * SECS_PER_MINUTE;
+    static constexpr const int64_t NANOS_PER_HOUR = NANOS_PER_MINUTE * MINS_PER_HOUR;
+    static constexpr const int64_t NANOS_PER_DAY = NANOS_PER_HOUR * HOURS_PER_DAY;
+    static constexpr const int64_t NANOS_PER_WEEK = NANOS_PER_DAY * DAYS_PER_WEEK;
+
+    LBUG_API static void addition(interval_t& result, uint64_t number, std::string specifierStr);
+    LBUG_API static interval_t fromCString(const char* str, uint64_t len);
+    LBUG_API static std::string toString(interval_t interval);
+    LBUG_API static bool greaterThan(const interval_t& left, const interval_t& right);
+    LBUG_API static void normalizeIntervalEntries(interval_t input, int64_t& months, int64_t& days,
+        int64_t& micros);
+    LBUG_API static void tryGetDatePartSpecifier(std::string specifier, DatePartSpecifier& result);
+    LBUG_API static int32_t getIntervalPart(DatePartSpecifier specifier, interval_t timestamp);
+    LBUG_API static int64_t getMicro(const interval_t& val);
+    LBUG_API static int64_t getNanoseconds(const interval_t& val);
+    LBUG_API static const regex::RE2& regexPattern1();
+    LBUG_API static const regex::RE2& regexPattern2();
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/ku_list.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/ku_list.h
new file mode 100644
index 0000000000..249d7eb4b3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/ku_list.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "types.h"
+
+namespace lbug {
+namespace common {
+
+struct ku_list_t {
+    ku_list_t() : size{0}, overflowPtr{0} {}
+    ku_list_t(uint64_t size, uint64_t overflowPtr) : size{size}, overflowPtr{overflowPtr} {}
+
+    void set(const uint8_t* values, const LogicalType& dataType) const;
+
+private:
+    void set(const std::vector<uint8_t*>& parameters, LogicalTypeID childTypeId);
+
+public:
+    uint64_t size;
+    uint64_t overflowPtr;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/ku_string.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/ku_string.h
new file mode 100644
index 0000000000..6d067d7cfa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/ku_string.h
@@ -0,0 +1,91 @@
+#pragma once
+
+#include <cstdint>
+#include <cstring>
+#include <string>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+struct LBUG_API ku_string_t {
+
+    static constexpr uint64_t PREFIX_LENGTH = 4;
+    static constexpr uint64_t INLINED_SUFFIX_LENGTH = 8;
+    static constexpr uint64_t SHORT_STR_LENGTH = PREFIX_LENGTH + INLINED_SUFFIX_LENGTH;
+
+    uint32_t len;
+    uint8_t prefix[PREFIX_LENGTH];
+    union {
+        uint8_t data[INLINED_SUFFIX_LENGTH];
+        uint64_t overflowPtr;
+    };
+
+    ku_string_t() : len{0}, prefix{}, overflowPtr{0} {}
+    ku_string_t(const char* value, uint64_t length);
+
+    static bool isShortString(uint32_t len) { return len <= SHORT_STR_LENGTH; }
+
+    const uint8_t* getData() const {
+        return isShortString(len) ? prefix : reinterpret_cast<uint8_t*>(overflowPtr);
+    }
+
+    uint8_t* getDataUnsafe() {
+        return isShortString(len) ? prefix : reinterpret_cast<uint8_t*>(overflowPtr);
+    }
+
+    // These functions do *NOT* allocate/resize the overflow buffer, it only copies the content and
+    // set the length.
+    void set(const std::string& value);
+    void set(const char* value, uint64_t length);
+    void set(const ku_string_t& value);
+    void setShortString(const char* value, uint64_t length) {
+        this->len = length;
+        memcpy(prefix, value, length);
+    }
+    void setLongString(const char* value, uint64_t length) {
+        this->len = length;
+        memcpy(prefix, value, PREFIX_LENGTH);
+        memcpy(reinterpret_cast<char*>(overflowPtr), value, length);
+    }
+    void setShortString(const ku_string_t& value) {
+        this->len = value.len;
+        memcpy(prefix, value.prefix, value.len);
+    }
+    void setLongString(const ku_string_t& value) {
+        this->len = value.len;
+        memcpy(prefix, value.prefix, PREFIX_LENGTH);
+        memcpy(reinterpret_cast<char*>(overflowPtr), reinterpret_cast<char*>(value.overflowPtr),
+            value.len);
+    }
+
+    void setFromRawStr(const char* value, uint64_t length) {
+        this->len = length;
+        if (isShortString(length)) {
+            setShortString(value, length);
+        } else {
+            memcpy(prefix, value, PREFIX_LENGTH);
+            overflowPtr = reinterpret_cast<uint64_t>(value);
+        }
+    }
+
+    std::string getAsShortString() const;
+    std::string getAsString() const;
+    std::string_view getAsStringView() const;
+
+    bool operator==(const ku_string_t& rhs) const;
+
+    inline bool operator!=(const ku_string_t& rhs) const { return !(*this == rhs); }
+
+    bool operator>(const ku_string_t& rhs) const;
+
+    inline bool operator>=(const ku_string_t& rhs) const { return (*this > rhs) || (*this == rhs); }
+
+    inline bool operator<(const ku_string_t& rhs) const { return !(*this >= rhs); }
+
+    inline bool operator<=(const ku_string_t& rhs) const { return !(*this > rhs); }
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/timestamp_t.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/timestamp_t.h
new file mode 100644
index 0000000000..10af1e191c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/timestamp_t.h
@@ -0,0 +1,125 @@
+#pragma once
+
+#include "date_t.h"
+#include "dtime_t.h"
+
+namespace lbug {
+namespace common {
+
+// Type used to represent timestamps (value is in microseconds since 1970-01-01)
+struct LBUG_API timestamp_t {
+    int64_t value = 0;
+
+    timestamp_t();
+    explicit timestamp_t(int64_t value_p);
+    timestamp_t& operator=(int64_t value_p);
+
+    // explicit conversion
+    explicit operator int64_t() const;
+
+    // Comparison operators with timestamp_t.
+    bool operator==(const timestamp_t& rhs) const;
+    bool operator!=(const timestamp_t& rhs) const;
+    bool operator<=(const timestamp_t& rhs) const;
+    bool operator<(const timestamp_t& rhs) const;
+    bool operator>(const timestamp_t& rhs) const;
+    bool operator>=(const timestamp_t& rhs) const;
+
+    // Comparison operators with date_t.
+    bool operator==(const date_t& rhs) const;
+    bool operator!=(const date_t& rhs) const;
+    bool operator<(const date_t& rhs) const;
+    bool operator<=(const date_t& rhs) const;
+    bool operator>(const date_t& rhs) const;
+    bool operator>=(const date_t& rhs) const;
+
+    // arithmetic operator
+    timestamp_t operator+(const interval_t& interval) const;
+    timestamp_t operator-(const interval_t& interval) const;
+
+    interval_t operator-(const timestamp_t& rhs) const;
+};
+
+struct timestamp_tz_t : public timestamp_t { // NO LINT
+    using timestamp_t::timestamp_t;
+};
+struct timestamp_ns_t : public timestamp_t { // NO LINT
+    using timestamp_t::timestamp_t;
+};
+struct timestamp_ms_t : public timestamp_t { // NO LINT
+    using timestamp_t::timestamp_t;
+};
+struct timestamp_sec_t : public timestamp_t { // NO LINT
+    using timestamp_t::timestamp_t;
+};
+
+// Note: Aside from some minor changes, this implementation is copied from DuckDB's source code:
+// https://github.com/duckdb/duckdb/blob/master/src/include/duckdb/common/types/timestamp.hpp.
+// https://github.com/duckdb/duckdb/blob/master/src/common/types/timestamp.cpp.
+// For example, instead of using their idx_t type to refer to indices, we directly use uint64_t,
+// which is the actual type of idx_t (so we say uint64_t len instead of idx_t len). When more
+// functionality is needed, we should first consult these DuckDB links.
+
+// The Timestamp class is a static class that holds helper functions for the Timestamp type.
+// timestamp/datetime uses 64 bits, high 32 bits for date and low 32 bits for time
+class Timestamp {
+public:
+    LBUG_API static timestamp_t fromCString(const char* str, uint64_t len);
+
+    // Convert a timestamp object to a std::string in the format "YYYY-MM-DD hh:mm:ss".
+    LBUG_API static std::string toString(timestamp_t timestamp);
+
+    // Date header is in the format: %Y%m%d.
+    LBUG_API static std::string getDateHeader(const timestamp_t& timestamp);
+
+    // Timestamp header is in the format: %Y%m%dT%H%M%SZ.
+    LBUG_API static std::string getDateTimeHeader(const timestamp_t& timestamp);
+
+    LBUG_API static date_t getDate(timestamp_t timestamp);
+
+    LBUG_API static dtime_t getTime(timestamp_t timestamp);
+
+    // Create a Timestamp object from a specified (date, time) combination.
+    LBUG_API static timestamp_t fromDateTime(date_t date, dtime_t time);
+
+    LBUG_API static bool tryConvertTimestamp(const char* str, uint64_t len, timestamp_t& result);
+
+    // Extract the date and time from a given timestamp object.
+    LBUG_API static void convert(timestamp_t timestamp, date_t& out_date, dtime_t& out_time);
+
+    // Create a Timestamp object from the specified epochMs.
+    LBUG_API static timestamp_t fromEpochMicroSeconds(int64_t epochMs);
+
+    // Create a Timestamp object from the specified epochMs.
+    LBUG_API static timestamp_t fromEpochMilliSeconds(int64_t ms);
+
+    // Create a Timestamp object from the specified epochSec.
+    LBUG_API static timestamp_t fromEpochSeconds(int64_t sec);
+
+    // Create a Timestamp object from the specified epochNs.
+    LBUG_API static timestamp_t fromEpochNanoSeconds(int64_t ns);
+
+    LBUG_API static int32_t getTimestampPart(DatePartSpecifier specifier, timestamp_t timestamp);
+
+    LBUG_API static timestamp_t trunc(DatePartSpecifier specifier, timestamp_t date);
+
+    LBUG_API static int64_t getEpochNanoSeconds(const timestamp_t& timestamp);
+
+    LBUG_API static int64_t getEpochMilliSeconds(const timestamp_t& timestamp);
+
+    LBUG_API static int64_t getEpochSeconds(const timestamp_t& timestamp);
+
+    LBUG_API static bool tryParseUTCOffset(const char* str, uint64_t& pos, uint64_t len,
+        int& hour_offset, int& minute_offset);
+
+    static std::string getTimestampConversionExceptionMsg(const char* str, uint64_t len,
+        const std::string& typeID = "TIMESTAMP") {
+        return "Error occurred during parsing " + typeID + ". Given: \"" + std::string(str, len) +
+               "\". Expected format: (YYYY-MM-DD hh:mm:ss[.zzzzzz][+-TT[:tt]])";
+    }
+
+    LBUG_API static timestamp_t getCurrentTimestamp();
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/types.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/types.h
new file mode 100644
index 0000000000..03e9f47cf7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/types.h
@@ -0,0 +1,677 @@
+#pragma once
+
+#include <memory>
+#include <string>
+#include <unordered_map>
+#include <unordered_set>
+#include <vector>
+
+#include "common/api.h"
+#include "common/cast.h"
+#include "common/copy_constructors.h"
+#include "common/types/interval_t.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace processor {
+class ParquetReader;
+}
+namespace catalog {
+class NodeTableCatalogEntry;
+}
+namespace common {
+
+class Serializer;
+class Deserializer;
+struct FileInfo;
+
+using sel_t = uint64_t;
+constexpr sel_t INVALID_SEL = UINT64_MAX;
+using hash_t = uint64_t;
+using page_idx_t = uint32_t;
+using frame_idx_t = page_idx_t;
+using page_offset_t = uint32_t;
+constexpr page_idx_t INVALID_PAGE_IDX = UINT32_MAX;
+using file_idx_t = uint32_t;
+constexpr file_idx_t INVALID_FILE_IDX = UINT32_MAX;
+using page_group_idx_t = uint32_t;
+using frame_group_idx_t = page_group_idx_t;
+using column_id_t = uint32_t;
+using property_id_t = uint32_t;
+constexpr column_id_t INVALID_COLUMN_ID = UINT32_MAX;
+constexpr column_id_t ROW_IDX_COLUMN_ID = INVALID_COLUMN_ID - 1;
+using idx_t = uint32_t;
+constexpr idx_t INVALID_IDX = UINT32_MAX;
+using block_idx_t = uint64_t;
+constexpr block_idx_t INVALID_BLOCK_IDX = UINT64_MAX;
+using struct_field_idx_t = uint16_t;
+using union_field_idx_t = struct_field_idx_t;
+constexpr struct_field_idx_t INVALID_STRUCT_FIELD_IDX = UINT16_MAX;
+using row_idx_t = uint64_t;
+constexpr row_idx_t INVALID_ROW_IDX = UINT64_MAX;
+constexpr uint32_t UNDEFINED_CAST_COST = UINT32_MAX;
+using node_group_idx_t = uint64_t;
+constexpr node_group_idx_t INVALID_NODE_GROUP_IDX = UINT64_MAX;
+using partition_idx_t = uint64_t;
+constexpr partition_idx_t INVALID_PARTITION_IDX = UINT64_MAX;
+using length_t = uint64_t;
+constexpr length_t INVALID_LENGTH = UINT64_MAX;
+using list_size_t = uint32_t;
+using sequence_id_t = uint64_t;
+using oid_t = uint64_t;
+constexpr oid_t INVALID_OID = UINT64_MAX;
+
+using transaction_t = uint64_t;
+constexpr transaction_t INVALID_TRANSACTION = UINT64_MAX;
+using executor_id_t = uint64_t;
+using executor_info = std::unordered_map<executor_id_t, uint64_t>;
+
+// table id type alias
+using table_id_t = oid_t;
+using table_id_vector_t = std::vector<table_id_t>;
+using table_id_set_t = std::unordered_set<table_id_t>;
+template<typename T>
+using table_id_map_t = std::unordered_map<table_id_t, T>;
+constexpr table_id_t INVALID_TABLE_ID = INVALID_OID;
+// offset type alias
+using offset_t = uint64_t;
+constexpr offset_t INVALID_OFFSET = UINT64_MAX;
+// internal id type alias
+struct internalID_t;
+using nodeID_t = internalID_t;
+using relID_t = internalID_t;
+
+using cardinality_t = uint64_t;
+constexpr offset_t INVALID_LIMIT = UINT64_MAX;
+using offset_vec_t = std::vector<offset_t>;
+// System representation for internalID.
+struct LBUG_API internalID_t {
+    offset_t offset;
+    table_id_t tableID;
+
+    internalID_t();
+    internalID_t(offset_t offset, table_id_t tableID);
+
+    // comparison operators
+    bool operator==(const internalID_t& rhs) const;
+    bool operator!=(const internalID_t& rhs) const;
+    bool operator>(const internalID_t& rhs) const;
+    bool operator>=(const internalID_t& rhs) const;
+    bool operator<(const internalID_t& rhs) const;
+    bool operator<=(const internalID_t& rhs) const;
+};
+
+// System representation for a variable-sized overflow value.
+struct overflow_value_t {
+    // the size of the overflow buffer can be calculated as:
+    // numElements * sizeof(Element) + nullMap(4 bytes alignment)
+    uint64_t numElements = 0;
+    uint8_t* value = nullptr;
+};
+
+struct list_entry_t {
+    offset_t offset;
+    list_size_t size;
+
+    constexpr list_entry_t() : offset{INVALID_OFFSET}, size{UINT32_MAX} {}
+    constexpr list_entry_t(offset_t offset, list_size_t size) : offset{offset}, size{size} {}
+};
+
+struct struct_entry_t {
+    int64_t pos;
+};
+
+struct map_entry_t {
+    list_entry_t entry;
+};
+
+struct union_entry_t {
+    struct_entry_t entry;
+};
+
+struct int128_t;
+struct uint128_t;
+struct ku_string_t;
+
+template<typename T>
+concept SignedIntegerTypes =
+    std::is_same_v<T, int8_t> || std::is_same_v<T, int16_t> || std::is_same_v<T, int32_t> ||
+    std::is_same_v<T, int64_t> || std::is_same_v<T, int128_t>;
+
+template<typename T>
+concept UnsignedIntegerTypes =
+    std::is_same_v<T, uint8_t> || std::is_same_v<T, uint16_t> || std::is_same_v<T, uint32_t> ||
+    std::is_same_v<T, uint64_t> || std::is_same_v<T, uint128_t>;
+
+template<typename T>
+concept IntegerTypes = SignedIntegerTypes<T> || UnsignedIntegerTypes<T>;
+
+template<typename T>
+concept FloatingPointTypes = std::is_same_v<T, float> || std::is_same_v<T, double>;
+
+template<typename T>
+concept NumericTypes = IntegerTypes<T> || std::floating_point<T>;
+
+template<typename T>
+concept ComparableTypes = NumericTypes<T> || std::is_same_v<T, ku_string_t> ||
+                          std::is_same_v<T, interval_t> || std::is_same_v<T, bool>;
+
+template<typename T>
+concept HashablePrimitive =
+    ((std::integral<T> && !std::is_same_v<T, bool>) || std::floating_point<T> ||
+        std::is_same_v<T, int128_t> || std::is_same_v<T, uint128_t>);
+template<typename T>
+concept IndexHashable = ((std::integral<T> && !std::is_same_v<T, bool>) || std::floating_point<T> ||
+                         std::is_same_v<T, int128_t> || std::is_same_v<T, uint128_t> ||
+                         std::is_same_v<T, ku_string_t> || std::is_same_v<T, std::string_view> ||
+                         std::same_as<T, std::string>);
+
+template<typename T>
+concept HashableNonNestedTypes =
+    (std::integral<T> || std::floating_point<T> || std::is_same_v<T, int128_t> ||
+        std::is_same_v<T, uint128_t> || std::is_same_v<T, internalID_t> ||
+        std::is_same_v<T, interval_t> || std::is_same_v<T, ku_string_t>);
+
+template<typename T>
+concept HashableNestedTypes =
+    (std::is_same_v<T, list_entry_t> || std::is_same_v<T, struct_entry_t>);
+
+template<typename T>
+concept HashableTypes = (HashableNestedTypes<T> || HashableNonNestedTypes<T>);
+
+enum class LogicalTypeID : uint8_t {
+    ANY = 0,
+    NODE = 10,
+    REL = 11,
+    RECURSIVE_REL = 12,
+    // SERIAL is a special data type that is used to represent a sequence of INT64 values that are
+    // incremented by 1 starting from 0.
+    SERIAL = 13,
+
+    BOOL = 22,
+    INT64 = 23,
+    INT32 = 24,
+    INT16 = 25,
+    INT8 = 26,
+    UINT64 = 27,
+    UINT32 = 28,
+    UINT16 = 29,
+    UINT8 = 30,
+    INT128 = 31,
+    DOUBLE = 32,
+    FLOAT = 33,
+    DATE = 34,
+    TIMESTAMP = 35,
+    TIMESTAMP_SEC = 36,
+    TIMESTAMP_MS = 37,
+    TIMESTAMP_NS = 38,
+    TIMESTAMP_TZ = 39,
+    INTERVAL = 40,
+    DECIMAL = 41,
+    INTERNAL_ID = 42,
+    UINT128 = 43,
+
+    STRING = 50,
+    BLOB = 51,
+
+    LIST = 52,
+    ARRAY = 53,
+    STRUCT = 54,
+    MAP = 55,
+    UNION = 56,
+    POINTER = 58,
+
+    UUID = 59,
+
+};
+
+enum class PhysicalTypeID : uint8_t {
+    // Fixed size types.
+    ANY = 0,
+    BOOL = 1,
+    INT64 = 2,
+    INT32 = 3,
+    INT16 = 4,
+    INT8 = 5,
+    UINT64 = 6,
+    UINT32 = 7,
+    UINT16 = 8,
+    UINT8 = 9,
+    INT128 = 10,
+    DOUBLE = 11,
+    FLOAT = 12,
+    INTERVAL = 13,
+    INTERNAL_ID = 14,
+    ALP_EXCEPTION_FLOAT = 15,
+    ALP_EXCEPTION_DOUBLE = 16,
+    UINT128 = 17,
+
+    // Variable size types.
+    STRING = 20,
+    LIST = 22,
+    ARRAY = 23,
+    STRUCT = 24,
+    POINTER = 25,
+};
+
+class ExtraTypeInfo;
+class StructField;
+class StructTypeInfo;
+
+enum class TypeCategory : uint8_t { INTERNAL = 0, UDT = 1 };
+
+class LogicalType {
+    friend struct LogicalTypeUtils;
+    friend struct DecimalType;
+    friend struct StructType;
+    friend struct ListType;
+    friend struct ArrayType;
+
+    LBUG_API LogicalType(const LogicalType& other);
+
+public:
+    LogicalType() : typeID{LogicalTypeID::ANY}, extraTypeInfo{nullptr} {
+        physicalType = getPhysicalType(this->typeID);
+    };
+    explicit LBUG_API LogicalType(LogicalTypeID typeID, TypeCategory info = TypeCategory::INTERNAL);
+    EXPLICIT_COPY_DEFAULT_MOVE(LogicalType);
+
+    LBUG_API bool operator==(const LogicalType& other) const;
+    LBUG_API bool operator!=(const LogicalType& other) const;
+
+    LBUG_API std::string toString() const;
+    static bool isBuiltInType(const std::string& str);
+    static LogicalType convertFromString(const std::string& str, main::ClientContext* context);
+
+    LogicalTypeID getLogicalTypeID() const { return typeID; }
+    bool containsAny() const;
+    bool isInternalType() const { return category == TypeCategory::INTERNAL; }
+
+    PhysicalTypeID getPhysicalType() const { return physicalType; }
+    LBUG_API static PhysicalTypeID getPhysicalType(LogicalTypeID logicalType,
+        const std::unique_ptr<ExtraTypeInfo>& extraTypeInfo = nullptr);
+
+    void setExtraTypeInfo(std::unique_ptr<ExtraTypeInfo> typeInfo) {
+        extraTypeInfo = std::move(typeInfo);
+    }
+
+    const ExtraTypeInfo* getExtraTypeInfo() const { return extraTypeInfo.get(); }
+
+    void serialize(Serializer& serializer) const;
+
+    static LogicalType deserialize(Deserializer& deserializer);
+
+    LBUG_API static std::vector<LogicalType> copy(const std::vector<LogicalType>& types);
+    LBUG_API static std::vector<LogicalType> copy(const std::vector<LogicalType*>& types);
+
+    static LogicalType ANY() { return LogicalType(LogicalTypeID::ANY); }
+
+    // NOTE: avoid using this if possible, this is a temporary hack for passing internal types
+    // TODO(Royi) remove this when float compression no longer relies on this or ColumnChunkData
+    // takes physical types instead of logical types
+    static LogicalType ANY(PhysicalTypeID physicalType) {
+        auto ret = LogicalType(LogicalTypeID::ANY);
+        ret.physicalType = physicalType;
+        return ret;
+    }
+
+    static LogicalType BOOL() { return LogicalType(LogicalTypeID::BOOL); }
+    static LogicalType HASH() { return LogicalType(LogicalTypeID::UINT64); }
+    static LogicalType INT64() { return LogicalType(LogicalTypeID::INT64); }
+    static LogicalType INT32() { return LogicalType(LogicalTypeID::INT32); }
+    static LogicalType INT16() { return LogicalType(LogicalTypeID::INT16); }
+    static LogicalType INT8() { return LogicalType(LogicalTypeID::INT8); }
+    static LogicalType UINT64() { return LogicalType(LogicalTypeID::UINT64); }
+    static LogicalType UINT32() { return LogicalType(LogicalTypeID::UINT32); }
+    static LogicalType UINT16() { return LogicalType(LogicalTypeID::UINT16); }
+    static LogicalType UINT8() { return LogicalType(LogicalTypeID::UINT8); }
+    static LogicalType INT128() { return LogicalType(LogicalTypeID::INT128); }
+    static LogicalType DOUBLE() { return LogicalType(LogicalTypeID::DOUBLE); }
+    static LogicalType FLOAT() { return LogicalType(LogicalTypeID::FLOAT); }
+    static LogicalType DATE() { return LogicalType(LogicalTypeID::DATE); }
+    static LogicalType TIMESTAMP_NS() { return LogicalType(LogicalTypeID::TIMESTAMP_NS); }
+    static LogicalType TIMESTAMP_MS() { return LogicalType(LogicalTypeID::TIMESTAMP_MS); }
+    static LogicalType TIMESTAMP_SEC() { return LogicalType(LogicalTypeID::TIMESTAMP_SEC); }
+    static LogicalType TIMESTAMP_TZ() { return LogicalType(LogicalTypeID::TIMESTAMP_TZ); }
+    static LogicalType TIMESTAMP() { return LogicalType(LogicalTypeID::TIMESTAMP); }
+    static LogicalType INTERVAL() { return LogicalType(LogicalTypeID::INTERVAL); }
+    static LBUG_API LogicalType DECIMAL(uint32_t precision, uint32_t scale);
+    static LogicalType INTERNAL_ID() { return LogicalType(LogicalTypeID::INTERNAL_ID); }
+    static LogicalType UINT128() { return LogicalType(LogicalTypeID::UINT128); };
+    static LogicalType SERIAL() { return LogicalType(LogicalTypeID::SERIAL); }
+    static LogicalType STRING() { return LogicalType(LogicalTypeID::STRING); }
+    static LogicalType BLOB() { return LogicalType(LogicalTypeID::BLOB); }
+    static LogicalType UUID() { return LogicalType(LogicalTypeID::UUID); }
+    static LogicalType POINTER() { return LogicalType(LogicalTypeID::POINTER); }
+    static LBUG_API LogicalType STRUCT(std::vector<StructField>&& fields);
+
+    static LBUG_API LogicalType RECURSIVE_REL(std::vector<StructField>&& fields);
+
+    static LBUG_API LogicalType NODE(std::vector<StructField>&& fields);
+
+    static LBUG_API LogicalType REL(std::vector<StructField>&& fields);
+
+    static LBUG_API LogicalType UNION(std::vector<StructField>&& fields);
+
+    static LBUG_API LogicalType LIST(LogicalType childType);
+    template<class T>
+    static inline LogicalType LIST(T&& childType) {
+        return LogicalType::LIST(LogicalType(std::forward<T>(childType)));
+    }
+
+    static LBUG_API LogicalType MAP(LogicalType keyType, LogicalType valueType);
+    template<class T>
+    static LogicalType MAP(T&& keyType, T&& valueType) {
+        return LogicalType::MAP(LogicalType(std::forward<T>(keyType)),
+            LogicalType(std::forward<T>(valueType)));
+    }
+
+    static LBUG_API LogicalType ARRAY(LogicalType childType, uint64_t numElements);
+    template<class T>
+    static LogicalType ARRAY(T&& childType, uint64_t numElements) {
+        return LogicalType::ARRAY(LogicalType(std::forward<T>(childType)), numElements);
+    }
+
+private:
+    friend struct CAPIHelper;
+    friend struct JavaAPIHelper;
+    friend class lbug::processor::ParquetReader;
+    explicit LogicalType(LogicalTypeID typeID, std::unique_ptr<ExtraTypeInfo> extraTypeInfo);
+
+private:
+    LogicalTypeID typeID;
+    PhysicalTypeID physicalType;
+    std::unique_ptr<ExtraTypeInfo> extraTypeInfo;
+    TypeCategory category = TypeCategory::INTERNAL;
+};
+
+class LBUG_API ExtraTypeInfo {
+public:
+    virtual ~ExtraTypeInfo() = default;
+
+    void serialize(Serializer& serializer) const { serializeInternal(serializer); }
+
+    virtual bool containsAny() const = 0;
+
+    virtual bool operator==(const ExtraTypeInfo& other) const = 0;
+
+    virtual std::unique_ptr<ExtraTypeInfo> copy() const = 0;
+
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+
+protected:
+    virtual void serializeInternal(Serializer& serializer) const = 0;
+};
+
+class LBUG_API UDTTypeInfo : public ExtraTypeInfo {
+public:
+    explicit UDTTypeInfo(std::string typeName) : typeName{std::move(typeName)} {}
+
+    std::string getTypeName() const { return typeName; }
+
+    bool containsAny() const override { return false; }
+
+    bool operator==(const ExtraTypeInfo& other) const override;
+
+    std::unique_ptr<ExtraTypeInfo> copy() const override;
+
+    static std::unique_ptr<ExtraTypeInfo> deserialize(Deserializer& deserializer);
+
+private:
+    void serializeInternal(Serializer& serializer) const override;
+
+private:
+    std::string typeName;
+};
+
+class DecimalTypeInfo final : public ExtraTypeInfo {
+public:
+    explicit DecimalTypeInfo(uint32_t precision = 18, uint32_t scale = 3)
+        : precision(precision), scale(scale) {}
+
+    uint32_t getPrecision() const { return precision; }
+    uint32_t getScale() const { return scale; }
+
+    bool containsAny() const override { return false; }
+
+    bool operator==(const ExtraTypeInfo& other) const override;
+
+    std::unique_ptr<ExtraTypeInfo> copy() const override;
+
+    static std::unique_ptr<ExtraTypeInfo> deserialize(Deserializer& deserializer);
+
+protected:
+    void serializeInternal(Serializer& serializer) const override;
+
+    uint32_t precision, scale;
+};
+
+class LBUG_API ListTypeInfo : public ExtraTypeInfo {
+public:
+    ListTypeInfo() = default;
+    explicit ListTypeInfo(LogicalType childType) : childType{std::move(childType)} {}
+
+    const LogicalType& getChildType() const { return childType; }
+
+    bool containsAny() const override;
+
+    bool operator==(const ExtraTypeInfo& other) const override;
+
+    std::unique_ptr<ExtraTypeInfo> copy() const override;
+
+    static std::unique_ptr<ExtraTypeInfo> deserialize(Deserializer& deserializer);
+
+protected:
+    void serializeInternal(Serializer& serializer) const override;
+
+protected:
+    LogicalType childType;
+};
+
+class LBUG_API ArrayTypeInfo final : public ListTypeInfo {
+public:
+    ArrayTypeInfo() : numElements{0} {};
+    explicit ArrayTypeInfo(LogicalType childType, uint64_t numElements)
+        : ListTypeInfo{std::move(childType)}, numElements{numElements} {}
+
+    uint64_t getNumElements() const { return numElements; }
+
+    bool operator==(const ExtraTypeInfo& other) const override;
+
+    static std::unique_ptr<ExtraTypeInfo> deserialize(Deserializer& deserializer);
+
+    std::unique_ptr<ExtraTypeInfo> copy() const override;
+
+private:
+    void serializeInternal(Serializer& serializer) const override;
+
+private:
+    uint64_t numElements;
+};
+
+class StructField {
+public:
+    StructField() : type{LogicalType()} {}
+    StructField(std::string name, LogicalType type)
+        : name{std::move(name)}, type{std::move(type)} {};
+
+    DELETE_COPY_DEFAULT_MOVE(StructField);
+
+    std::string getName() const { return name; }
+
+    const LogicalType& getType() const { return type; }
+
+    bool containsAny() const;
+
+    bool operator==(const StructField& other) const;
+    bool operator!=(const StructField& other) const { return !(*this == other); }
+
+    void serialize(Serializer& serializer) const;
+
+    static StructField deserialize(Deserializer& deserializer);
+
+    StructField copy() const;
+
+private:
+    std::string name;
+    LogicalType type;
+};
+
+class StructTypeInfo final : public ExtraTypeInfo {
+public:
+    StructTypeInfo() = default;
+    explicit StructTypeInfo(std::vector<StructField>&& fields);
+    StructTypeInfo(const std::vector<std::string>& fieldNames,
+        const std::vector<LogicalType>& fieldTypes);
+
+    bool hasField(const std::string& fieldName) const;
+    struct_field_idx_t getStructFieldIdx(std::string fieldName) const;
+    const StructField& getStructField(struct_field_idx_t idx) const;
+    const StructField& getStructField(const std::string& fieldName) const;
+    const std::vector<StructField>& getStructFields() const;
+
+    const LogicalType& getChildType(struct_field_idx_t idx) const;
+    std::vector<const LogicalType*> getChildrenTypes() const;
+    // can't be a vector of refs since that can't be for-each looped through
+    std::vector<std::string> getChildrenNames() const;
+
+    bool containsAny() const override;
+
+    bool operator==(const ExtraTypeInfo& other) const override;
+
+    static std::unique_ptr<ExtraTypeInfo> deserialize(Deserializer& deserializer);
+    std::unique_ptr<ExtraTypeInfo> copy() const override;
+
+private:
+    void serializeInternal(Serializer& serializer) const override;
+
+private:
+    std::vector<StructField> fields;
+    std::unordered_map<std::string, struct_field_idx_t> fieldNameToIdxMap;
+};
+
+using logical_type_vec_t = std::vector<LogicalType>;
+
+struct LBUG_API DecimalType {
+    static uint32_t getPrecision(const LogicalType& type);
+    static uint32_t getScale(const LogicalType& type);
+    static std::string insertDecimalPoint(const std::string& value, uint32_t posFromEnd);
+};
+
+struct LBUG_API ListType {
+    static const LogicalType& getChildType(const LogicalType& type);
+};
+
+struct LBUG_API ArrayType {
+    static const LogicalType& getChildType(const LogicalType& type);
+    static uint64_t getNumElements(const LogicalType& type);
+};
+
+struct LBUG_API StructType {
+    static std::vector<const LogicalType*> getFieldTypes(const LogicalType& type);
+    // since the field types isn't stored as a vector of LogicalTypes, we can't return vector<>&
+
+    static const LogicalType& getFieldType(const LogicalType& type, struct_field_idx_t idx);
+
+    static const LogicalType& getFieldType(const LogicalType& type, const std::string& key);
+
+    static std::vector<std::string> getFieldNames(const LogicalType& type);
+
+    static uint64_t getNumFields(const LogicalType& type);
+
+    static const std::vector<StructField>& getFields(const LogicalType& type);
+
+    static bool hasField(const LogicalType& type, const std::string& key);
+
+    static const StructField& getField(const LogicalType& type, struct_field_idx_t idx);
+
+    static const StructField& getField(const LogicalType& type, const std::string& key);
+
+    static struct_field_idx_t getFieldIdx(const LogicalType& type, const std::string& key);
+};
+
+struct LBUG_API MapType {
+    static const LogicalType& getKeyType(const LogicalType& type);
+
+    static const LogicalType& getValueType(const LogicalType& type);
+};
+
+struct LBUG_API UnionType {
+    static constexpr union_field_idx_t TAG_FIELD_IDX = 0;
+
+    static constexpr auto TAG_FIELD_TYPE = LogicalTypeID::UINT16;
+
+    static constexpr char TAG_FIELD_NAME[] = "tag";
+
+    static union_field_idx_t getInternalFieldIdx(union_field_idx_t idx);
+
+    static std::string getFieldName(const LogicalType& type, union_field_idx_t idx);
+
+    static const LogicalType& getFieldType(const LogicalType& type, union_field_idx_t idx);
+
+    static const LogicalType& getFieldType(const LogicalType& type, const std::string& key);
+
+    static uint64_t getNumFields(const LogicalType& type);
+
+    static bool hasField(const LogicalType& type, const std::string& key);
+
+    static union_field_idx_t getFieldIdx(const LogicalType& type, const std::string& key);
+};
+
+struct PhysicalTypeUtils {
+    static std::string toString(PhysicalTypeID physicalType);
+    static uint32_t getFixedTypeSize(PhysicalTypeID physicalType);
+};
+
+struct LBUG_API LogicalTypeUtils {
+    static std::string toString(LogicalTypeID dataTypeID);
+    static std::string toString(const std::vector<LogicalType>& dataTypes);
+    static std::string toString(const std::vector<LogicalTypeID>& dataTypeIDs);
+    static uint32_t getRowLayoutSize(const LogicalType& logicalType);
+    static bool isDate(const LogicalType& dataType);
+    static bool isDate(const LogicalTypeID& dataType);
+    static bool isTimestamp(const LogicalType& dataType);
+    static bool isTimestamp(const LogicalTypeID& dataType);
+    static bool isUnsigned(const LogicalType& dataType);
+    static bool isUnsigned(const LogicalTypeID& dataType);
+    static bool isIntegral(const LogicalType& dataType);
+    static bool isIntegral(const LogicalTypeID& dataType);
+    static bool isNumerical(const LogicalType& dataType);
+    static bool isNumerical(const LogicalTypeID& dataType);
+    static bool isFloatingPoint(const LogicalTypeID& dataType);
+    static bool isNested(const LogicalType& dataType);
+    static bool isNested(LogicalTypeID logicalTypeID);
+    static std::vector<LogicalTypeID> getAllValidComparableLogicalTypes();
+    static std::vector<LogicalTypeID> getNumericalLogicalTypeIDs();
+    static std::vector<LogicalTypeID> getIntegerTypeIDs();
+    static std::vector<LogicalTypeID> getFloatingPointTypeIDs();
+    static std::vector<LogicalTypeID> getAllValidLogicTypeIDs();
+    static std::vector<LogicalType> getAllValidLogicTypes();
+    static bool tryGetMaxLogicalType(const LogicalType& left, const LogicalType& right,
+        LogicalType& result);
+    static bool tryGetMaxLogicalType(const std::vector<LogicalType>& types, LogicalType& result);
+
+    // Differs from tryGetMaxLogicalType because it treats string as a maximal type, instead of a
+    // minimal type. as such, it will always succeed.
+    // Also combines structs by the union of their fields. As such, currently, it is not guaranteed
+    // for casting to work from input types to resulting types. Ideally this changes
+    static LogicalType combineTypes(const LogicalType& left, const LogicalType& right);
+    static LogicalType combineTypes(const std::vector<LogicalType>& types);
+
+    // makes a copy of the type with any occurences of ANY replaced with replacement
+    static LogicalType purgeAny(const LogicalType& type, const LogicalType& replacement);
+
+private:
+    static bool tryGetMaxLogicalTypeID(const LogicalTypeID& left, const LogicalTypeID& right,
+        LogicalTypeID& result);
+};
+
+enum class FileVersionType : uint8_t { ORIGINAL = 0, WAL_VERSION = 1 };
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/uint128_t.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/uint128_t.h
new file mode 100644
index 0000000000..6b5eeea36f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/uint128_t.h
@@ -0,0 +1,221 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+#include "common/api.h"
+#include "common/exception/overflow.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace common {
+
+struct int128_t;
+
+struct LBUG_API uint128_t {
+    uint64_t low;
+    uint64_t high;
+
+    uint128_t() noexcept = default;
+    uint128_t(int64_t value);  // NOLINT: Allow implicit conversion from numeric values
+    uint128_t(int32_t value);  // NOLINT: Allow implicit conversion from numeric values
+    uint128_t(int16_t value);  // NOLINT: Allow implicit conversion from numeric values
+    uint128_t(int8_t value);   // NOLINT: Allow implicit conversion from numeric values
+    uint128_t(uint64_t value); // NOLINT: Allow implicit conversion from numeric values
+    uint128_t(uint32_t value); // NOLINT: Allow implicit conversion from numeric values
+    uint128_t(uint16_t value); // NOLINT: Allow implicit conversion from numeric values
+    uint128_t(uint8_t value);  // NOLINT: Allow implicit conversion from numeric values
+    uint128_t(double value);   // NOLINT: Allow implicit conversion from numeric values
+    uint128_t(float value);    // NOLINT: Allow implicit conversion from numeric values
+
+    constexpr uint128_t(uint64_t low, uint64_t high) noexcept : low(low), high(high) {}
+
+    constexpr uint128_t(const uint128_t&) noexcept = default;
+    constexpr uint128_t(uint128_t&&) noexcept = default;
+    uint128_t& operator=(const uint128_t&) noexcept = default;
+    uint128_t& operator=(uint128_t&&) noexcept = default;
+
+    uint128_t operator-() const;
+
+    // inplace arithmetic operators
+    uint128_t& operator+=(const uint128_t& rhs);
+    uint128_t& operator*=(const uint128_t& rhs);
+    uint128_t& operator|=(const uint128_t& rhs);
+    uint128_t& operator&=(const uint128_t& rhs);
+
+    // cast operators
+    explicit operator int64_t() const;
+    explicit operator int32_t() const;
+    explicit operator int16_t() const;
+    explicit operator int8_t() const;
+    explicit operator uint64_t() const;
+    explicit operator uint32_t() const;
+    explicit operator uint16_t() const;
+    explicit operator uint8_t() const;
+    explicit operator double() const;
+    explicit operator float() const;
+
+    operator int128_t() const; // NOLINT: Allow implicit conversion from uint128 to int128
+};
+
+// arithmetic operators
+LBUG_API uint128_t operator+(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API uint128_t operator-(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API uint128_t operator*(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API uint128_t operator/(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API uint128_t operator%(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API uint128_t operator^(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API uint128_t operator&(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API uint128_t operator~(const uint128_t& val);
+LBUG_API uint128_t operator|(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API uint128_t operator<<(const uint128_t& lhs, int amount);
+LBUG_API uint128_t operator>>(const uint128_t& lhs, int amount);
+
+// comparison operators
+LBUG_API bool operator==(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API bool operator!=(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API bool operator>(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API bool operator>=(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API bool operator<(const uint128_t& lhs, const uint128_t& rhs);
+LBUG_API bool operator<=(const uint128_t& lhs, const uint128_t& rhs);
+
+class UInt128_t {
+public:
+    static std::string toString(uint128_t input);
+
+    template<class T>
+    static bool tryCast(uint128_t input, T& result);
+
+    template<class T>
+    static T cast(uint128_t input) {
+        T result;
+        tryCast(input, result);
+        return result;
+    }
+
+    template<class T>
+    static bool tryCastTo(T value, uint128_t& result);
+
+    template<class T>
+    static uint128_t castTo(T value) {
+        uint128_t result{};
+        if (!tryCastTo(value, result)) {
+            throw common::OverflowException("UINT128 is out of range");
+        }
+        return result;
+    }
+
+    // negate (required by function/arithmetic/negate.h)
+    static void negateInPlace(uint128_t& input) {
+        input.low = UINT64_MAX + 1 - input.low;
+        input.high = -input.high - 1 + (input.low == 0);
+    }
+
+    static uint128_t negate(uint128_t input) {
+        negateInPlace(input);
+        return input;
+    }
+
+    static bool tryMultiply(uint128_t lhs, uint128_t rhs, uint128_t& result);
+
+    static uint128_t Add(uint128_t lhs, uint128_t rhs);
+    static uint128_t Sub(uint128_t lhs, uint128_t rhs);
+    static uint128_t Mul(uint128_t lhs, uint128_t rhs);
+    static uint128_t Div(uint128_t lhs, uint128_t rhs);
+    static uint128_t Mod(uint128_t lhs, uint128_t rhs);
+    static uint128_t Xor(uint128_t lhs, uint128_t rhs);
+    static uint128_t LeftShift(uint128_t lhs, int amount);
+    static uint128_t RightShift(uint128_t lhs, int amount);
+    static uint128_t BinaryAnd(uint128_t lhs, uint128_t rhs);
+    static uint128_t BinaryOr(uint128_t lhs, uint128_t rhs);
+    static uint128_t BinaryNot(uint128_t val);
+
+    static uint128_t divMod(uint128_t lhs, uint128_t rhs, uint128_t& remainder);
+    static uint128_t divModPositive(uint128_t lhs, uint64_t rhs, uint64_t& remainder);
+
+    static bool addInPlace(uint128_t& lhs, uint128_t rhs);
+    static bool subInPlace(uint128_t& lhs, uint128_t rhs);
+
+    // comparison operators
+    static bool equals(uint128_t lhs, uint128_t rhs) {
+        return lhs.low == rhs.low && lhs.high == rhs.high;
+    }
+
+    static bool notEquals(uint128_t lhs, uint128_t rhs) {
+        return lhs.low != rhs.low || lhs.high != rhs.high;
+    }
+
+    static bool greaterThan(uint128_t lhs, uint128_t rhs) {
+        return (lhs.high > rhs.high) || (lhs.high == rhs.high && lhs.low > rhs.low);
+    }
+
+    static bool greaterThanOrEquals(uint128_t lhs, uint128_t rhs) {
+        return (lhs.high > rhs.high) || (lhs.high == rhs.high && lhs.low >= rhs.low);
+    }
+
+    static bool lessThan(uint128_t lhs, uint128_t rhs) {
+        return (lhs.high < rhs.high) || (lhs.high == rhs.high && lhs.low < rhs.low);
+    }
+
+    static bool lessThanOrEquals(uint128_t lhs, uint128_t rhs) {
+        return (lhs.high < rhs.high) || (lhs.high == rhs.high && lhs.low <= rhs.low);
+    }
+};
+
+template<>
+bool UInt128_t::tryCast(uint128_t input, int8_t& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, int16_t& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, int32_t& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, int64_t& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, uint8_t& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, uint16_t& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, uint32_t& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, uint64_t& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, int128_t& result); // unsigned to signed
+template<>
+bool UInt128_t::tryCast(uint128_t input, float& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, double& result);
+template<>
+bool UInt128_t::tryCast(uint128_t input, long double& result);
+
+template<>
+bool UInt128_t::tryCastTo(int8_t value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(int16_t value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(int32_t value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(int64_t value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(uint8_t value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(uint16_t value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(uint32_t value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(uint64_t value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(uint128_t value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(float value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(double value, uint128_t& result);
+template<>
+bool UInt128_t::tryCastTo(long double value, uint128_t& result);
+
+} // namespace common
+} // namespace lbug
+
+template<>
+struct std::hash<lbug::common::uint128_t> {
+    std::size_t operator()(const lbug::common::uint128_t& v) const noexcept;
+};
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/uuid.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/uuid.h
new file mode 100644
index 0000000000..7c46731a9d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/uuid.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include "int128_t.h"
+
+namespace lbug {
+
+namespace regex {
+class RE2;
+}
+
+namespace common {
+
+class RandomEngine;
+
+// Note: uuid_t is a reserved keyword in MSVC, we have to use ku_uuid_t instead.
+struct ku_uuid_t {
+    int128_t value;
+};
+
+struct UUID {
+    static constexpr const uint8_t UUID_STRING_LENGTH = 36;
+    static constexpr const char HEX_DIGITS[] = "0123456789abcdef";
+    static void byteToHex(char byteVal, char* buf, uint64_t& pos);
+    static unsigned char hex2Char(char ch);
+    static bool isHex(char ch);
+    static bool fromString(std::string str, int128_t& result);
+
+    static int128_t fromString(std::string str);
+    static int128_t fromCString(const char* str, uint64_t len);
+    static void toString(int128_t input, char* buf);
+    static std::string toString(int128_t input);
+    static std::string toString(ku_uuid_t val);
+
+    static ku_uuid_t generateRandomUUID(RandomEngine* engine);
+
+    static const regex::RE2& regexPattern();
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/nested.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/nested.h
new file mode 100644
index 0000000000..fbafce903e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/nested.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include <cstdint>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+class Value;
+
+class NestedVal {
+public:
+    LBUG_API static uint32_t getChildrenSize(const Value* val);
+
+    LBUG_API static Value* getChildVal(const Value* val, uint32_t idx);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/node.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/node.h
new file mode 100644
index 0000000000..f3abccad12
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/node.h
@@ -0,0 +1,63 @@
+#pragma once
+
+#include <cstdint>
+#include <memory>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+class Value;
+
+/**
+ * @brief NodeVal represents a node in the graph and stores the nodeID, label and properties of that
+ * node.
+ */
+class NodeVal {
+public:
+    /**
+     * @return all properties of the NodeVal.
+     * @note this function copies all the properties into a vector, which is not efficient. use
+     * `getPropertyName` and `getPropertyVal` instead if possible.
+     */
+    LBUG_API static std::vector<std::pair<std::string, std::unique_ptr<Value>>> getProperties(
+        const Value* val);
+    /**
+     * @return number of properties of the RelVal.
+     */
+    LBUG_API static uint64_t getNumProperties(const Value* val);
+
+    /**
+     * @return the name of the property at the given index.
+     */
+    LBUG_API static std::string getPropertyName(const Value* val, uint64_t index);
+
+    /**
+     * @return the value of the property at the given index.
+     */
+    LBUG_API static Value* getPropertyVal(const Value* val, uint64_t index);
+    /**
+     * @return the nodeID as a Value.
+     */
+    LBUG_API static Value* getNodeIDVal(const Value* val);
+    /**
+     * @return the name of the node as a Value.
+     */
+    LBUG_API static Value* getLabelVal(const Value* val);
+    /**
+     * @return the current node values in string format.
+     */
+    LBUG_API static std::string toString(const Value* val);
+
+private:
+    static void throwIfNotNode(const Value* val);
+    // 2 offsets for id and label.
+    static constexpr uint64_t OFFSET = 2;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/recursive_rel.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/recursive_rel.h
new file mode 100644
index 0000000000..0fb913902f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/recursive_rel.h
@@ -0,0 +1,31 @@
+#pragma once
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+class Value;
+
+/**
+ * @brief RecursiveRelVal represents a path in the graph and stores the corresponding rels and nodes
+ * of that path.
+ */
+class RecursiveRelVal {
+public:
+    /**
+     * @return the list of nodes in the recursive rel as a Value.
+     */
+    LBUG_API static Value* getNodes(const Value* val);
+
+    /**
+     * @return the list of rels in the recursive rel as a Value.
+     */
+    LBUG_API static Value* getRels(const Value* val);
+
+private:
+    static void throwIfNotRecursiveRel(const Value* val);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/rel.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/rel.h
new file mode 100644
index 0000000000..9aadf767ca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/rel.h
@@ -0,0 +1,69 @@
+#pragma once
+
+#include <cstdint>
+#include <memory>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+
+class Value;
+
+/**
+ * @brief RelVal represents a rel in the graph and stores the relID, src/dst nodes and properties of
+ * that rel.
+ */
+class RelVal {
+public:
+    /**
+     * @return all properties of the RelVal.
+     * @note this function copies all the properties into a vector, which is not efficient. use
+     * `getPropertyName` and `getPropertyVal` instead if possible.
+     */
+    LBUG_API static std::vector<std::pair<std::string, std::unique_ptr<Value>>> getProperties(
+        const Value* val);
+    /**
+     * @return number of properties of the RelVal.
+     */
+    LBUG_API static uint64_t getNumProperties(const Value* val);
+    /**
+     * @return the name of the property at the given index.
+     */
+    LBUG_API static std::string getPropertyName(const Value* val, uint64_t index);
+    /**
+     * @return the value of the property at the given index.
+     */
+    LBUG_API static Value* getPropertyVal(const Value* val, uint64_t index);
+    /**
+     * @return the src nodeID value of the RelVal in Value.
+     */
+    LBUG_API static Value* getSrcNodeIDVal(const Value* val);
+    /**
+     * @return the dst nodeID value of the RelVal in Value.
+     */
+    LBUG_API static Value* getDstNodeIDVal(const Value* val);
+    /**
+     * @return the internal ID value of the RelVal in Value.
+     */
+    LBUG_API static Value* getIDVal(const Value* val);
+    /**
+     * @return the label value of the RelVal.
+     */
+    LBUG_API static Value* getLabelVal(const Value* val);
+    /**
+     * @return the value of the RelVal in string format.
+     */
+    LBUG_API static std::string toString(const Value* val);
+
+private:
+    static void throwIfNotRel(const Value* val);
+    // 4 offset for id, label, src, dst.
+    static constexpr uint64_t OFFSET = 4;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/value.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/value.h
new file mode 100644
index 0000000000..393d4c83bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/types/value/value.h
@@ -0,0 +1,899 @@
+#pragma once
+
+#include <stdexcept>
+#include <utility>
+
+#include "common/api.h"
+#include "common/types/date_t.h"
+#include "common/types/int128_t.h"
+#include "common/types/interval_t.h"
+#include "common/types/ku_list.h"
+#include "common/types/timestamp_t.h"
+#include "common/types/uint128_t.h"
+#include "common/types/uuid.h"
+
+namespace lbug {
+namespace common {
+
+class NodeVal;
+class RelVal;
+struct FileInfo;
+class NestedVal;
+class RecursiveRelVal;
+class ArrowRowBatch;
+class ValueVector;
+class Serializer;
+class Deserializer;
+
+class Value {
+    friend class NodeVal;
+    friend class RelVal;
+    friend class NestedVal;
+    friend class RecursiveRelVal;
+    friend class ArrowRowBatch;
+    friend class ValueVector;
+
+public:
+    /**
+     * @return a NULL value of ANY type.
+     */
+    LBUG_API static Value createNullValue();
+    /**
+     * @param dataType the type of the NULL value.
+     * @return a NULL value of the given type.
+     */
+    LBUG_API static Value createNullValue(const LogicalType& dataType);
+    /**
+     * @param dataType the type of the non-NULL value.
+     * @return a default non-NULL value of the given type.
+     */
+    LBUG_API static Value createDefaultValue(const LogicalType& dataType);
+    /**
+     * @param val_ the boolean value to set.
+     */
+    LBUG_API explicit Value(bool val_);
+    /**
+     * @param val_ the int8_t value to set.
+     */
+    LBUG_API explicit Value(int8_t val_);
+    /**
+     * @param val_ the int16_t value to set.
+     */
+    LBUG_API explicit Value(int16_t val_);
+    /**
+     * @param val_ the int32_t value to set.
+     */
+    LBUG_API explicit Value(int32_t val_);
+    /**
+     * @param val_ the int64_t value to set.
+     */
+    LBUG_API explicit Value(int64_t val_);
+    /**
+     * @param val_ the uint8_t value to set.
+     */
+    LBUG_API explicit Value(uint8_t val_);
+    /**
+     * @param val_ the uint16_t value to set.
+     */
+    LBUG_API explicit Value(uint16_t val_);
+    /**
+     * @param val_ the uint32_t value to set.
+     */
+    LBUG_API explicit Value(uint32_t val_);
+    /**
+     * @param val_ the uint64_t value to set.
+     */
+    LBUG_API explicit Value(uint64_t val_);
+    /**
+     * @param val_ the int128_t value to set.
+     */
+    LBUG_API explicit Value(int128_t val_);
+    /**
+     * @param val_ the UUID value to set.
+     */
+    LBUG_API explicit Value(ku_uuid_t val_);
+    /**
+     * @param val_ the double value to set.
+     */
+    LBUG_API explicit Value(double val_);
+    /**
+     * @param val_ the float value to set.
+     */
+    LBUG_API explicit Value(float val_);
+    /**
+     * @param val_ the date value to set.
+     */
+    LBUG_API explicit Value(date_t val_);
+    /**
+     * @param val_ the timestamp_ns value to set.
+     */
+    LBUG_API explicit Value(timestamp_ns_t val_);
+    /**
+     * @param val_ the timestamp_ms value to set.
+     */
+    LBUG_API explicit Value(timestamp_ms_t val_);
+    /**
+     * @param val_ the timestamp_sec value to set.
+     */
+    LBUG_API explicit Value(timestamp_sec_t val_);
+    /**
+     * @param val_ the timestamp_tz value to set.
+     */
+    LBUG_API explicit Value(timestamp_tz_t val_);
+    /**
+     * @param val_ the timestamp value to set.
+     */
+    LBUG_API explicit Value(timestamp_t val_);
+    /**
+     * @param val_ the interval value to set.
+     */
+    LBUG_API explicit Value(interval_t val_);
+    /**
+     * @param val_ the internalID value to set.
+     */
+    LBUG_API explicit Value(internalID_t val_);
+    /**
+     * @param val_ the uint128_t value to set.
+     */
+    LBUG_API explicit Value(uint128_t val_);
+    /**
+     * @param val_ the string value to set.
+     */
+    LBUG_API explicit Value(const char* val_);
+    /**
+     * @param val_ the string value to set.
+     */
+    LBUG_API explicit Value(const std::string& val_);
+    /**
+     * @param val_ the uint8_t* value to set.
+     */
+    LBUG_API explicit Value(uint8_t* val_);
+    /**
+     * @param type the logical type of the value.
+     * @param val_ the string value to set.
+     */
+    LBUG_API explicit Value(LogicalType type, std::string val_);
+    /**
+     * @param dataType the logical type of the value.
+     * @param children a vector of children values.
+     */
+    LBUG_API explicit Value(LogicalType dataType, std::vector<std::unique_ptr<Value>> children);
+    /**
+     * @param other the value to copy from.
+     */
+    LBUG_API Value(const Value& other);
+
+    /**
+     * @param other the value to move from.
+     */
+    LBUG_API Value(Value&& other) = default;
+    LBUG_API Value& operator=(Value&& other) = default;
+    LBUG_API bool operator==(const Value& rhs) const;
+
+    /**
+     * @brief Sets the data type of the Value.
+     * @param dataType_ the data type to set to.
+     */
+    LBUG_API void setDataType(const LogicalType& dataType_);
+    /**
+     * @return the dataType of the value.
+     */
+    LBUG_API const LogicalType& getDataType() const;
+    /**
+     * @brief Sets the null flag of the Value.
+     * @param flag null value flag to set.
+     */
+    LBUG_API void setNull(bool flag);
+    /**
+     * @brief Sets the null flag of the Value to true.
+     */
+    LBUG_API void setNull();
+    /**
+     * @return whether the Value is null or not.
+     */
+    LBUG_API bool isNull() const;
+    /**
+     * @brief Copies from the row layout value.
+     * @param value value to copy from.
+     */
+    LBUG_API void copyFromRowLayout(const uint8_t* value);
+    /**
+     * @brief Copies from the col layout value.
+     * @param value value to copy from.
+     */
+    LBUG_API void copyFromColLayout(const uint8_t* value, ValueVector* vec = nullptr);
+    /**
+     * @brief Copies from the other.
+     * @param other value to copy from.
+     */
+    LBUG_API void copyValueFrom(const Value& other);
+    /**
+     * @return the value of the given type.
+     */
+    template<class T>
+    T getValue() const {
+        throw std::runtime_error("Unimplemented template for Value::getValue()");
+    }
+    /**
+     * @return a reference to the value of the given type.
+     */
+    template<class T>
+    T& getValueReference() {
+        throw std::runtime_error("Unimplemented template for Value::getValueReference()");
+    }
+    /**
+     * @return a Value object based on value.
+     */
+    template<class T>
+    static Value createValue(T /*value*/) {
+        throw std::runtime_error("Unimplemented template for Value::createValue()");
+    }
+
+    /**
+     * @return a copy of the current value.
+     */
+    LBUG_API std::unique_ptr<Value> copy() const;
+    /**
+     * @return the current value in string format.
+     */
+    LBUG_API std::string toString() const;
+
+    LBUG_API void serialize(Serializer& serializer) const;
+
+    LBUG_API static std::unique_ptr<Value> deserialize(Deserializer& deserializer);
+
+    LBUG_API void validateType(common::LogicalTypeID targetTypeID) const;
+
+    bool hasNoneNullChildren() const;
+    bool allowTypeChange() const;
+
+    uint64_t computeHash() const;
+
+    uint32_t getChildrenSize() const { return childrenSize; }
+
+private:
+    Value();
+    explicit Value(const LogicalType& dataType);
+
+    void resizeChildrenVector(uint64_t size, const LogicalType& childType);
+    void copyFromRowLayoutList(const ku_list_t& list, const LogicalType& childType);
+    void copyFromColLayoutList(const list_entry_t& list, ValueVector* vec);
+    void copyFromRowLayoutStruct(const uint8_t* kuStruct);
+    void copyFromColLayoutStruct(const struct_entry_t& structEntry, ValueVector* vec);
+    void copyFromUnion(const uint8_t* kuUnion);
+
+    std::string mapToString() const;
+    std::string listToString() const;
+    std::string structToString() const;
+    std::string nodeToString() const;
+    std::string relToString() const;
+    std::string decimalToString() const;
+
+public:
+    union Val {
+        constexpr Val() : booleanVal{false} {}
+        bool booleanVal;
+        int128_t int128Val;
+        int64_t int64Val;
+        int32_t int32Val;
+        int16_t int16Val;
+        int8_t int8Val;
+        uint64_t uint64Val;
+        uint32_t uint32Val;
+        uint16_t uint16Val;
+        uint8_t uint8Val;
+        double doubleVal;
+        float floatVal;
+        // TODO(Ziyi): Should we remove the val suffix from all values in Val? Looks redundant.
+        uint8_t* pointer;
+        interval_t intervalVal;
+        internalID_t internalIDVal;
+        uint128_t uint128Val;
+    } val;
+    std::string strVal;
+
+private:
+    LogicalType dataType;
+    bool isNull_;
+
+    // Note: ALWAYS use childrenSize over children.size(). We do NOT resize children when
+    // iterating with nested value. So children.size() reflects the capacity() rather the actual
+    // size.
+    std::vector<std::unique_ptr<Value>> children;
+    uint32_t childrenSize;
+};
+
+/**
+ * @return boolean value.
+ */
+template<>
+inline bool Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::BOOL);
+    return val.booleanVal;
+}
+
+/**
+ * @return int8 value.
+ */
+template<>
+inline int8_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT8);
+    return val.int8Val;
+}
+
+/**
+ * @return int16 value.
+ */
+template<>
+inline int16_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT16);
+    return val.int16Val;
+}
+
+/**
+ * @return int32 value.
+ */
+template<>
+inline int32_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT32);
+    return val.int32Val;
+}
+
+/**
+ * @return int64 value.
+ */
+template<>
+inline int64_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT64);
+    return val.int64Val;
+}
+
+/**
+ * @return uint64 value.
+ */
+template<>
+inline uint64_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT64);
+    return val.uint64Val;
+}
+
+/**
+ * @return uint32 value.
+ */
+template<>
+inline uint32_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT32);
+    return val.uint32Val;
+}
+
+/**
+ * @return uint16 value.
+ */
+template<>
+inline uint16_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT16);
+    return val.uint16Val;
+}
+
+/**
+ * @return uint8 value.
+ */
+template<>
+inline uint8_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT8);
+    return val.uint8Val;
+}
+
+/**
+ * @return int128 value.
+ */
+template<>
+inline int128_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT128);
+    return val.int128Val;
+}
+
+/**
+ * @return float value.
+ */
+template<>
+inline float Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::FLOAT);
+    return val.floatVal;
+}
+
+/**
+ * @return double value.
+ */
+template<>
+inline double Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::DOUBLE);
+    return val.doubleVal;
+}
+
+/**
+ * @return date_t value.
+ */
+template<>
+inline date_t Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::DATE);
+    return date_t{val.int32Val};
+}
+
+/**
+ * @return timestamp_t value.
+ */
+template<>
+inline timestamp_t Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP);
+    return timestamp_t{val.int64Val};
+}
+
+/**
+ * @return timestamp_ns_t value.
+ */
+template<>
+inline timestamp_ns_t Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP_NS);
+    return timestamp_ns_t{val.int64Val};
+}
+
+/**
+ * @return timestamp_ms_t value.
+ */
+template<>
+inline timestamp_ms_t Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP_MS);
+    return timestamp_ms_t{val.int64Val};
+}
+
+/**
+ * @return timestamp_sec_t value.
+ */
+template<>
+inline timestamp_sec_t Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP_SEC);
+    return timestamp_sec_t{val.int64Val};
+}
+
+/**
+ * @return timestamp_tz_t value.
+ */
+template<>
+inline timestamp_tz_t Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP_TZ);
+    return timestamp_tz_t{val.int64Val};
+}
+
+/**
+ * @return interval_t value.
+ */
+template<>
+inline interval_t Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::INTERVAL);
+    return val.intervalVal;
+}
+
+/**
+ * @return internal_t value.
+ */
+template<>
+inline internalID_t Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::INTERNAL_ID);
+    return val.internalIDVal;
+}
+
+/**
+ * @return uint128 value.
+ */
+template<>
+inline uint128_t Value::getValue() const {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT128);
+    return val.uint128Val;
+}
+
+/**
+ * @return string value.
+ */
+template<>
+inline std::string Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::STRING ||
+              dataType.getLogicalTypeID() == LogicalTypeID::BLOB ||
+              dataType.getLogicalTypeID() == LogicalTypeID::UUID);
+    return strVal;
+}
+
+/**
+ * @return uint8_t* value.
+ */
+template<>
+inline uint8_t* Value::getValue() const {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::POINTER);
+    return val.pointer;
+}
+
+/**
+ * @return the reference to the boolean value.
+ */
+template<>
+inline bool& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::BOOL);
+    return val.booleanVal;
+}
+
+/**
+ * @return the reference to the int8 value.
+ */
+template<>
+inline int8_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT8);
+    return val.int8Val;
+}
+
+/**
+ * @return the reference to the int16 value.
+ */
+template<>
+inline int16_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT16);
+    return val.int16Val;
+}
+
+/**
+ * @return the reference to the int32 value.
+ */
+template<>
+inline int32_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT32);
+    return val.int32Val;
+}
+
+/**
+ * @return the reference to the int64 value.
+ */
+template<>
+inline int64_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT64);
+    return val.int64Val;
+}
+
+/**
+ * @return the reference to the uint8 value.
+ */
+template<>
+inline uint8_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT8);
+    return val.uint8Val;
+}
+
+/**
+ * @return the reference to the uint16 value.
+ */
+template<>
+inline uint16_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT16);
+    return val.uint16Val;
+}
+
+/**
+ * @return the reference to the uint32 value.
+ */
+template<>
+inline uint32_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT32);
+    return val.uint32Val;
+}
+
+/**
+ * @return the reference to the uint64 value.
+ */
+template<>
+inline uint64_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT64);
+    return val.uint64Val;
+}
+
+/**
+ * @return the reference to the int128 value.
+ */
+template<>
+inline int128_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::INT128);
+    return val.int128Val;
+}
+
+/**
+ * @return the reference to the float value.
+ */
+template<>
+inline float& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::FLOAT);
+    return val.floatVal;
+}
+
+/**
+ * @return the reference to the double value.
+ */
+template<>
+inline double& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::DOUBLE);
+    return val.doubleVal;
+}
+
+/**
+ * @return the reference to the date value.
+ */
+template<>
+inline date_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::DATE);
+    return *reinterpret_cast<date_t*>(&val.int32Val);
+}
+
+/**
+ * @return the reference to the timestamp value.
+ */
+template<>
+inline timestamp_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP);
+    return *reinterpret_cast<timestamp_t*>(&val.int64Val);
+}
+
+/**
+ * @return the reference to the timestamp_ms value.
+ */
+template<>
+inline timestamp_ms_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP_MS);
+    return *reinterpret_cast<timestamp_ms_t*>(&val.int64Val);
+}
+
+/**
+ * @return the reference to the timestamp_ns value.
+ */
+template<>
+inline timestamp_ns_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP_NS);
+    return *reinterpret_cast<timestamp_ns_t*>(&val.int64Val);
+}
+
+/**
+ * @return the reference to the timestamp_sec value.
+ */
+template<>
+inline timestamp_sec_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP_SEC);
+    return *reinterpret_cast<timestamp_sec_t*>(&val.int64Val);
+}
+
+/**
+ * @return the reference to the timestamp_tz value.
+ */
+template<>
+inline timestamp_tz_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::TIMESTAMP_TZ);
+    return *reinterpret_cast<timestamp_tz_t*>(&val.int64Val);
+}
+
+/**
+ * @return the reference to the interval value.
+ */
+template<>
+inline interval_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::INTERVAL);
+    return val.intervalVal;
+}
+
+/**
+ * @return the reference to the uint128 value.
+ */
+template<>
+inline uint128_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getPhysicalType() == PhysicalTypeID::UINT128);
+    return val.uint128Val;
+}
+
+/**
+ * @return the reference to the internal_id value.
+ */
+template<>
+inline nodeID_t& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::INTERNAL_ID);
+    return val.internalIDVal;
+}
+
+/**
+ * @return the reference to the string value.
+ */
+template<>
+inline std::string& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::STRING);
+    return strVal;
+}
+
+/**
+ * @return the reference to the uint8_t* value.
+ */
+template<>
+inline uint8_t*& Value::getValueReference() {
+    KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::POINTER);
+    return val.pointer;
+}
+
+/**
+ * @param val the boolean value
+ * @return a Value with BOOL type and val value.
+ */
+template<>
+inline Value Value::createValue(bool val) {
+    return Value(val);
+}
+
+template<>
+inline Value Value::createValue(int8_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the int16 value
+ * @return a Value with INT16 type and val value.
+ */
+template<>
+inline Value Value::createValue(int16_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the int32 value
+ * @return a Value with INT32 type and val value.
+ */
+template<>
+inline Value Value::createValue(int32_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the int64 value
+ * @return a Value with INT64 type and val value.
+ */
+template<>
+inline Value Value::createValue(int64_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the uint8 value
+ * @return a Value with UINT8 type and val value.
+ */
+template<>
+inline Value Value::createValue(uint8_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the uint16 value
+ * @return a Value with UINT16 type and val value.
+ */
+template<>
+inline Value Value::createValue(uint16_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the uint32 value
+ * @return a Value with UINT32 type and val value.
+ */
+template<>
+inline Value Value::createValue(uint32_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the uint64 value
+ * @return a Value with UINT64 type and val value.
+ */
+template<>
+inline Value Value::createValue(uint64_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the int128_t value
+ * @return a Value with INT128 type and val value.
+ */
+template<>
+inline Value Value::createValue(int128_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the double value
+ * @return a Value with DOUBLE type and val value.
+ */
+template<>
+inline Value Value::createValue(double val) {
+    return Value(val);
+}
+
+/**
+ * @param val the date_t value
+ * @return a Value with DATE type and val value.
+ */
+template<>
+inline Value Value::createValue(date_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the timestamp_t value
+ * @return a Value with TIMESTAMP type and val value.
+ */
+template<>
+inline Value Value::createValue(timestamp_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the interval_t value
+ * @return a Value with INTERVAL type and val value.
+ */
+template<>
+inline Value Value::createValue(interval_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the uint128_t value
+ * @return a Value with UINT128 type and val value.
+ */
+template<>
+inline Value Value::createValue(uint128_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the nodeID_t value
+ * @return a Value with NODE_ID type and val value.
+ */
+template<>
+inline Value Value::createValue(nodeID_t val) {
+    return Value(val);
+}
+
+/**
+ * @param val the string value
+ * @return a Value with type and val value.
+ */
+template<>
+inline Value Value::createValue(std::string val) {
+    return Value(LogicalType::STRING(), std::move(val));
+}
+
+/**
+ * @param value the string value
+ * @return a Value with STRING type and val value.
+ */
+template<>
+inline Value Value::createValue(const char* value) {
+    return Value(LogicalType::STRING(), std::string(value));
+}
+
+/**
+ * @param val the uint8_t* val
+ * @return a Value with POINTER type and val val.
+ */
+template<>
+inline Value Value::createValue(uint8_t* val) {
+    return Value(val);
+}
+
+/**
+ * @param val the uuid_t* val
+ * @return a Value with UUID type and val val.
+ */
+template<>
+inline Value Value::createValue(ku_uuid_t val) {
+    return Value(val);
+}
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/uniq_lock.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/uniq_lock.h
new file mode 100644
index 0000000000..38974b1fa2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/uniq_lock.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include <mutex>
+
+namespace lbug {
+namespace common {
+
+struct UniqLock {
+    UniqLock() {}
+    explicit UniqLock(std::mutex& mtx) : lck{mtx} {}
+
+    UniqLock(const UniqLock&) = delete;
+    UniqLock& operator=(const UniqLock&) = delete;
+
+    UniqLock(UniqLock&& other) noexcept { std::swap(lck, other.lck); }
+    UniqLock& operator=(UniqLock&& other) noexcept {
+        std::swap(lck, other.lck);
+        return *this;
+    }
+    bool isLocked() const { return lck.owns_lock(); }
+
+private:
+    std::unique_lock<std::mutex> lck;
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/utils.h
new file mode 100644
index 0000000000..022d1dd6d8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/utils.h
@@ -0,0 +1,103 @@
+#pragma once
+
+#include <algorithm>
+#include <cstdint>
+#include <limits>
+
+#include "common/assert.h"
+#include "common/numeric_utils.h"
+#include "common/types/int128_t.h"
+#include <bit>
+
+namespace lbug {
+namespace common {
+
+class BitmaskUtils {
+public:
+    template<typename T>
+        requires std::integral<T>
+    static T all1sMaskForLeastSignificantBits(uint32_t numBits) {
+        KU_ASSERT(numBits <= 64);
+        using U = numeric_utils::MakeUnSignedT<T>;
+        return (T)(numBits == (sizeof(U) * 8) ? std::numeric_limits<U>::max() :
+                                                static_cast<U>(((U)1 << numBits) - 1));
+    }
+
+    // constructs all 1s mask while avoiding overflow/underflow for int128
+    template<typename T>
+        requires std::same_as<std::remove_cvref_t<T>, int128_t>
+    static T all1sMaskForLeastSignificantBits(uint32_t numBits) {
+        static constexpr uint8_t numBitsInT = sizeof(T) * 8;
+
+        // use ~T(1) instead of ~T(0) to avoid sign-bit filling
+        const T fullMask = ~(T(1) << (numBitsInT - 1));
+
+        const size_t numBitsToDiscard = (numBitsInT - 1 - numBits);
+        return (fullMask >> numBitsToDiscard);
+    }
+};
+
+uint64_t nextPowerOfTwo(uint64_t v);
+uint64_t prevPowerOfTwo(uint64_t v);
+
+bool isLittleEndian();
+
+template<numeric_utils::IsIntegral T>
+constexpr T ceilDiv(T a, T b) {
+    return (a / b) + (a % b != 0);
+}
+
+template<std::integral To, std::integral From>
+constexpr To safeIntegerConversion(From val) {
+    KU_ASSERT(static_cast<To>(val) == val);
+    return val;
+}
+
+template<typename T, typename Container>
+bool containsValue(const Container& container, const T& value) {
+    return std::find(container.begin(), container.end(), value) != container.end();
+}
+
+template<std::integral T>
+constexpr T countBits(T) {
+    constexpr T bitsPerByte = 8;
+    return sizeof(T) * bitsPerByte;
+}
+
+template<numeric_utils::IsIntegral T>
+struct CountZeros {
+    static constexpr idx_t Leading(T value_in) { return std::countl_zero(value_in); }
+    static constexpr idx_t Trailing(T value_in) { return std::countr_zero(value_in); }
+};
+
+template<>
+struct CountZeros<int128_t> {
+    static constexpr idx_t Leading(int128_t value) {
+        const uint64_t upper = static_cast<uint64_t>(value.high);
+        const uint64_t lower = value.low;
+
+        if (upper) {
+            return CountZeros<uint64_t>::Leading(upper);
+        }
+        if (lower) {
+            return 64 + CountZeros<uint64_t>::Leading(lower);
+        }
+        return 128;
+    }
+
+    static constexpr idx_t Trailing(int128_t value) {
+        const uint64_t upper = static_cast<uint64_t>(value.high);
+        const uint64_t lower = value.low;
+
+        if (lower) {
+            return CountZeros<uint64_t>::Trailing(lower);
+        }
+        if (upper) {
+            return 64 + CountZeros<uint64_t>::Trailing(upper);
+        }
+        return 128;
+    }
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/vector/auxiliary_buffer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/vector/auxiliary_buffer.h
new file mode 100644
index 0000000000..f1c7859007
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/vector/auxiliary_buffer.h
@@ -0,0 +1,105 @@
+#pragma once
+
+#include "common/api.h"
+#include "common/in_mem_overflow_buffer.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace common {
+
+class ValueVector;
+
+// AuxiliaryBuffer holds data which is only used by the targeting dataType.
+class LBUG_API AuxiliaryBuffer {
+public:
+    virtual ~AuxiliaryBuffer() = default;
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+class StringAuxiliaryBuffer : public AuxiliaryBuffer {
+public:
+    explicit StringAuxiliaryBuffer(storage::MemoryManager* memoryManager) {
+        inMemOverflowBuffer = std::make_unique<InMemOverflowBuffer>(memoryManager);
+    }
+
+    InMemOverflowBuffer* getOverflowBuffer() const { return inMemOverflowBuffer.get(); }
+    uint8_t* allocateOverflow(uint64_t size) { return inMemOverflowBuffer->allocateSpace(size); }
+    void resetOverflowBuffer() const { inMemOverflowBuffer->resetBuffer(); }
+
+private:
+    std::unique_ptr<InMemOverflowBuffer> inMemOverflowBuffer;
+};
+
+class LBUG_API StructAuxiliaryBuffer : public AuxiliaryBuffer {
+public:
+    StructAuxiliaryBuffer(const LogicalType& type, storage::MemoryManager* memoryManager);
+
+    void referenceChildVector(idx_t idx, std::shared_ptr<ValueVector> vectorToReference) {
+        childrenVectors[idx] = std::move(vectorToReference);
+    }
+    const std::vector<std::shared_ptr<ValueVector>>& getFieldVectors() const {
+        return childrenVectors;
+    }
+    std::shared_ptr<ValueVector> getFieldVectorShared(idx_t idx) const {
+        return childrenVectors[idx];
+    }
+    ValueVector* getFieldVectorPtr(idx_t idx) const { return childrenVectors[idx].get(); }
+
+private:
+    std::vector<std::shared_ptr<ValueVector>> childrenVectors;
+};
+
+// ListVector layout:
+// To store a list value in the valueVector, we could use two separate vectors.
+// 1. A vector(called offset vector) for the list offsets and length(called list_entry_t): This
+// vector contains the starting indices and length for each list within the data vector.
+// 2. A data vector(called dataVector) to store the actual list elements: This vector holds the
+// actual elements of the lists in a flat, continuous storage. Each list would be represented as a
+// contiguous subsequence of elements in this vector.
+class LBUG_API ListAuxiliaryBuffer : public AuxiliaryBuffer {
+    friend class ListVector;
+
+public:
+    ListAuxiliaryBuffer(const LogicalType& dataVectorType, storage::MemoryManager* memoryManager);
+
+    void setDataVector(std::shared_ptr<ValueVector> vector) { dataVector = std::move(vector); }
+    ValueVector* getDataVector() const { return dataVector.get(); }
+    std::shared_ptr<ValueVector> getSharedDataVector() const { return dataVector; }
+
+    list_entry_t addList(list_size_t listSize);
+
+    uint64_t getSize() const { return size; }
+
+    void resetSize() { size = 0; }
+
+    void resize(uint64_t numValues);
+
+private:
+    void resizeDataVector(ValueVector* dataVector);
+
+    void resizeStructDataVector(ValueVector* dataVector);
+
+private:
+    uint64_t capacity;
+    uint64_t size;
+
+    std::shared_ptr<ValueVector> dataVector;
+};
+
+class AuxiliaryBufferFactory {
+public:
+    static std::unique_ptr<AuxiliaryBuffer> getAuxiliaryBuffer(LogicalType& type,
+        storage::MemoryManager* memoryManager);
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/vector/value_vector.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/vector/value_vector.h
new file mode 100644
index 0000000000..fc695d0027
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/vector/value_vector.h
@@ -0,0 +1,352 @@
+#pragma once
+
+#include <optional>
+#include <utility>
+
+#include "common/assert.h"
+#include "common/cast.h"
+#include "common/copy_constructors.h"
+#include "common/data_chunk/data_chunk_state.h"
+#include "common/null_mask.h"
+#include "common/types/ku_string.h"
+#include "common/vector/auxiliary_buffer.h"
+
+namespace lbug {
+namespace common {
+
+class Value;
+
+//! A Vector represents values of the same data type.
+//! The capacity of a ValueVector is either 1 (sequence) or DEFAULT_VECTOR_CAPACITY.
+class LBUG_API ValueVector {
+    friend class ListVector;
+    friend class ListAuxiliaryBuffer;
+    friend class StructVector;
+    friend class StringVector;
+    friend class ArrowColumnVector;
+
+public:
+    explicit ValueVector(LogicalType dataType, storage::MemoryManager* memoryManager = nullptr,
+        std::shared_ptr<DataChunkState> dataChunkState = nullptr);
+    explicit ValueVector(LogicalTypeID dataTypeID, storage::MemoryManager* memoryManager = nullptr)
+        : ValueVector(LogicalType(dataTypeID), memoryManager) {
+        KU_ASSERT(dataTypeID != LogicalTypeID::LIST);
+    }
+
+    DELETE_COPY_AND_MOVE(ValueVector);
+    ~ValueVector() = default;
+
+    template<typename T>
+    std::optional<T> firstNonNull() const {
+        sel_t selectedSize = state->getSelSize();
+        if (selectedSize == 0) {
+            return std::nullopt;
+        }
+        if (hasNoNullsGuarantee()) {
+            return getValue<T>(state->getSelVector()[0]);
+        } else {
+            for (size_t i = 0; i < selectedSize; i++) {
+                auto pos = state->getSelVector()[i];
+                if (!isNull(pos)) {
+                    return std::make_optional(getValue<T>(pos));
+                }
+            }
+        }
+        return std::nullopt;
+    }
+
+    template<class Func>
+    void forEachNonNull(Func&& func) const {
+        if (hasNoNullsGuarantee()) {
+            state->getSelVector().forEach(func);
+        } else {
+            state->getSelVector().forEach([&](auto i) {
+                if (!isNull(i)) {
+                    func(i);
+                }
+            });
+        }
+    }
+
+    uint32_t countNonNull() const;
+
+    void setState(const std::shared_ptr<DataChunkState>& state_);
+
+    void setAllNull() { nullMask.setAllNull(); }
+    void setAllNonNull() { nullMask.setAllNonNull(); }
+    // On return true, there are no null. On return false, there may or may not be nulls.
+    bool hasNoNullsGuarantee() const { return nullMask.hasNoNullsGuarantee(); }
+    void setNullRange(uint32_t startPos, uint32_t len, bool value) {
+        nullMask.setNullFromRange(startPos, len, value);
+    }
+    const NullMask& getNullMask() const { return nullMask; }
+    void setNull(uint32_t pos, bool isNull);
+    uint8_t isNull(uint32_t pos) const { return nullMask.isNull(pos); }
+    void setAsSingleNullEntry() {
+        state->getSelVectorUnsafe().setSelSize(1);
+        setNull(state->getSelVector()[0], true);
+    }
+
+    bool setNullFromBits(const uint64_t* srcNullEntries, uint64_t srcOffset, uint64_t dstOffset,
+        uint64_t numBitsToCopy, bool invert = false);
+
+    uint32_t getNumBytesPerValue() const { return numBytesPerValue; }
+
+    // TODO(Guodong): Rename this to getValueRef
+    template<typename T>
+    const T& getValue(uint32_t pos) const {
+        return ((T*)valueBuffer.get())[pos];
+    }
+    template<typename T>
+    T& getValue(uint32_t pos) {
+        return ((T*)valueBuffer.get())[pos];
+    }
+    template<typename T>
+    void setValue(uint32_t pos, T val);
+    // copyFromRowData assumes rowData is non-NULL.
+    void copyFromRowData(uint32_t pos, const uint8_t* rowData);
+    // copyToRowData assumes srcVectorData is non-NULL.
+    void copyToRowData(uint32_t pos, uint8_t* rowData,
+        InMemOverflowBuffer* rowOverflowBuffer) const;
+    // copyFromVectorData assumes srcVectorData is non-NULL.
+    void copyFromVectorData(uint8_t* dstData, const ValueVector* srcVector,
+        const uint8_t* srcVectorData);
+    void copyFromVectorData(uint64_t dstPos, const ValueVector* srcVector, uint64_t srcPos);
+    void copyFromValue(uint64_t pos, const Value& value);
+
+    std::unique_ptr<Value> getAsValue(uint64_t pos) const;
+
+    uint8_t* getData() const { return valueBuffer.get(); }
+
+    offset_t readNodeOffset(uint32_t pos) const {
+        KU_ASSERT(dataType.getLogicalTypeID() == LogicalTypeID::INTERNAL_ID);
+        return getValue<nodeID_t>(pos).offset;
+    }
+
+    void resetAuxiliaryBuffer();
+
+    // If there is still non-null values after discarding, return true. Otherwise, return false.
+    // For an unflat vector, its selection vector is also updated to the resultSelVector.
+    static bool discardNull(ValueVector& vector);
+
+    void serialize(Serializer& ser) const;
+    static std::unique_ptr<ValueVector> deSerialize(Deserializer& deSer, storage::MemoryManager* mm,
+        std::shared_ptr<DataChunkState> dataChunkState);
+
+    SelectionVector* getSelVectorPtr() const {
+        return state ? &state->getSelVectorUnsafe() : nullptr;
+    }
+
+private:
+    uint32_t getDataTypeSize(const LogicalType& type);
+    void initializeValueBuffer();
+
+public:
+    LogicalType dataType;
+    std::shared_ptr<DataChunkState> state;
+
+private:
+    std::unique_ptr<uint8_t[]> valueBuffer;
+    NullMask nullMask;
+    uint32_t numBytesPerValue;
+    std::unique_ptr<AuxiliaryBuffer> auxiliaryBuffer;
+};
+
+class LBUG_API StringVector {
+public:
+    static inline InMemOverflowBuffer* getInMemOverflowBuffer(ValueVector* vector) {
+        KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+        return ku_dynamic_cast<StringAuxiliaryBuffer*>(vector->auxiliaryBuffer.get())
+            ->getOverflowBuffer();
+    }
+
+    static void addString(ValueVector* vector, uint32_t vectorPos, ku_string_t& srcStr);
+    static void addString(ValueVector* vector, uint32_t vectorPos, const char* srcStr,
+        uint64_t length);
+    static void addString(ValueVector* vector, uint32_t vectorPos, std::string_view srcStr);
+    // Add empty string with space reserved for the provided size
+    // Returned value can be modified to set the string contents
+    static ku_string_t& reserveString(ValueVector* vector, uint32_t vectorPos, uint64_t length);
+    static void reserveString(ValueVector* vector, ku_string_t& dstStr, uint64_t length);
+    static void addString(ValueVector* vector, ku_string_t& dstStr, ku_string_t& srcStr);
+    static void addString(ValueVector* vector, ku_string_t& dstStr, const char* srcStr,
+        uint64_t length);
+    static void addString(lbug::common::ValueVector* vector, ku_string_t& dstStr,
+        const std::string& srcStr);
+    static void copyToRowData(const ValueVector* vector, uint32_t pos, uint8_t* rowData,
+        InMemOverflowBuffer* rowOverflowBuffer);
+};
+
+struct LBUG_API BlobVector {
+    static void addBlob(ValueVector* vector, uint32_t pos, const char* data, uint32_t length) {
+        StringVector::addString(vector, pos, data, length);
+    } // namespace common
+    static void addBlob(ValueVector* vector, uint32_t pos, const uint8_t* data, uint64_t length) {
+        StringVector::addString(vector, pos, reinterpret_cast<const char*>(data), length);
+    }
+}; // namespace lbug
+
+// ListVector is used for both LIST and ARRAY physical type
+class LBUG_API ListVector {
+public:
+    static const ListAuxiliaryBuffer& getAuxBuffer(const ValueVector& vector) {
+        return vector.auxiliaryBuffer->constCast<ListAuxiliaryBuffer>();
+    }
+    static ListAuxiliaryBuffer& getAuxBufferUnsafe(const ValueVector& vector) {
+        return vector.auxiliaryBuffer->cast<ListAuxiliaryBuffer>();
+    }
+    // If you call setDataVector during initialize, there must be a followed up
+    // copyListEntryAndBufferMetaData at runtime.
+    // TODO(Xiyang): try to merge setDataVector & copyListEntryAndBufferMetaData
+    static void setDataVector(const ValueVector* vector, std::shared_ptr<ValueVector> dataVector) {
+        KU_ASSERT(validateType(*vector));
+        auto& listBuffer = getAuxBufferUnsafe(*vector);
+        listBuffer.setDataVector(std::move(dataVector));
+    }
+    static void copyListEntryAndBufferMetaData(ValueVector& vector,
+        const SelectionVector& selVector, const ValueVector& other,
+        const SelectionVector& otherSelVector);
+    static ValueVector* getDataVector(const ValueVector* vector) {
+        KU_ASSERT(validateType(*vector));
+        return getAuxBuffer(*vector).getDataVector();
+    }
+    static std::shared_ptr<ValueVector> getSharedDataVector(const ValueVector* vector) {
+        KU_ASSERT(validateType(*vector));
+        return getAuxBuffer(*vector).getSharedDataVector();
+    }
+    static uint64_t getDataVectorSize(const ValueVector* vector) {
+        KU_ASSERT(validateType(*vector));
+        return getAuxBuffer(*vector).getSize();
+    }
+    static uint8_t* getListValues(const ValueVector* vector, const list_entry_t& listEntry) {
+        KU_ASSERT(validateType(*vector));
+        auto dataVector = getDataVector(vector);
+        return dataVector->getData() + dataVector->getNumBytesPerValue() * listEntry.offset;
+    }
+    static uint8_t* getListValuesWithOffset(const ValueVector* vector,
+        const list_entry_t& listEntry, offset_t elementOffsetInList) {
+        KU_ASSERT(validateType(*vector));
+        return getListValues(vector, listEntry) +
+               elementOffsetInList * getDataVector(vector)->getNumBytesPerValue();
+    }
+    static list_entry_t addList(ValueVector* vector, uint64_t listSize) {
+        KU_ASSERT(validateType(*vector));
+        return getAuxBufferUnsafe(*vector).addList(listSize);
+    }
+    static void resizeDataVector(ValueVector* vector, uint64_t numValues) {
+        KU_ASSERT(validateType(*vector));
+        getAuxBufferUnsafe(*vector).resize(numValues);
+    }
+
+    static void copyFromRowData(ValueVector* vector, uint32_t pos, const uint8_t* rowData);
+    static void copyToRowData(const ValueVector* vector, uint32_t pos, uint8_t* rowData,
+        InMemOverflowBuffer* rowOverflowBuffer);
+    static void copyFromVectorData(ValueVector* dstVector, uint8_t* dstData,
+        const ValueVector* srcVector, const uint8_t* srcData);
+    static void appendDataVector(ValueVector* dstVector, ValueVector* srcDataVector,
+        uint64_t numValuesToAppend);
+    static void sliceDataVector(ValueVector* vectorToSlice, uint64_t offset, uint64_t numValues);
+
+private:
+    static bool validateType(const ValueVector& vector) {
+        switch (vector.dataType.getPhysicalType()) {
+        case PhysicalTypeID::LIST:
+        case PhysicalTypeID::ARRAY:
+            return true;
+        default:
+            return false;
+        }
+    }
+};
+
+class StructVector {
+public:
+    static const std::vector<std::shared_ptr<ValueVector>>& getFieldVectors(
+        const ValueVector* vector) {
+        return ku_dynamic_cast<StructAuxiliaryBuffer*>(vector->auxiliaryBuffer.get())
+            ->getFieldVectors();
+    }
+
+    static std::shared_ptr<ValueVector> getFieldVector(const ValueVector* vector,
+        struct_field_idx_t idx) {
+        return ku_dynamic_cast<StructAuxiliaryBuffer*>(vector->auxiliaryBuffer.get())
+            ->getFieldVectorShared(idx);
+    }
+
+    static ValueVector* getFieldVectorRaw(const ValueVector& vector, const std::string& fieldName) {
+        auto idx = StructType::getFieldIdx(vector.dataType, fieldName);
+        return ku_dynamic_cast<StructAuxiliaryBuffer*>(vector.auxiliaryBuffer.get())
+            ->getFieldVectorPtr(idx);
+    }
+
+    static void referenceVector(ValueVector* vector, struct_field_idx_t idx,
+        std::shared_ptr<ValueVector> vectorToReference) {
+        ku_dynamic_cast<StructAuxiliaryBuffer*>(vector->auxiliaryBuffer.get())
+            ->referenceChildVector(idx, std::move(vectorToReference));
+    }
+
+    static void copyFromRowData(ValueVector* vector, uint32_t pos, const uint8_t* rowData);
+    static void copyToRowData(const ValueVector* vector, uint32_t pos, uint8_t* rowData,
+        InMemOverflowBuffer* rowOverflowBuffer);
+    static void copyFromVectorData(ValueVector* dstVector, const uint8_t* dstData,
+        const ValueVector* srcVector, const uint8_t* srcData);
+};
+
+class UnionVector {
+public:
+    static inline ValueVector* getTagVector(const ValueVector* vector) {
+        KU_ASSERT(vector->dataType.getLogicalTypeID() == LogicalTypeID::UNION);
+        return StructVector::getFieldVector(vector, UnionType::TAG_FIELD_IDX).get();
+    }
+
+    static inline ValueVector* getValVector(const ValueVector* vector, union_field_idx_t fieldIdx) {
+        KU_ASSERT(vector->dataType.getLogicalTypeID() == LogicalTypeID::UNION);
+        return StructVector::getFieldVector(vector, UnionType::getInternalFieldIdx(fieldIdx)).get();
+    }
+
+    static inline std::shared_ptr<ValueVector> getSharedValVector(const ValueVector* vector,
+        union_field_idx_t fieldIdx) {
+        KU_ASSERT(vector->dataType.getLogicalTypeID() == LogicalTypeID::UNION);
+        return StructVector::getFieldVector(vector, UnionType::getInternalFieldIdx(fieldIdx));
+    }
+
+    static inline void referenceVector(ValueVector* vector, union_field_idx_t fieldIdx,
+        std::shared_ptr<ValueVector> vectorToReference) {
+        StructVector::referenceVector(vector, UnionType::getInternalFieldIdx(fieldIdx),
+            std::move(vectorToReference));
+    }
+
+    static inline void setTagField(ValueVector& vector, SelectionVector& sel,
+        union_field_idx_t tag) {
+        KU_ASSERT(vector.dataType.getLogicalTypeID() == LogicalTypeID::UNION);
+        for (auto i = 0u; i < sel.getSelSize(); i++) {
+            vector.setValue<struct_field_idx_t>(sel[i], tag);
+        }
+    }
+};
+
+class MapVector {
+public:
+    static inline ValueVector* getKeyVector(const ValueVector* vector) {
+        return StructVector::getFieldVector(ListVector::getDataVector(vector), 0 /* keyVectorPos */)
+            .get();
+    }
+
+    static inline ValueVector* getValueVector(const ValueVector* vector) {
+        return StructVector::getFieldVector(ListVector::getDataVector(vector), 1 /* valVectorPos */)
+            .get();
+    }
+
+    static inline uint8_t* getMapKeys(const ValueVector* vector, const list_entry_t& listEntry) {
+        auto keyVector = getKeyVector(vector);
+        return keyVector->getData() + keyVector->getNumBytesPerValue() * listEntry.offset;
+    }
+
+    static inline uint8_t* getMapValues(const ValueVector* vector, const list_entry_t& listEntry) {
+        auto valueVector = getValueVector(vector);
+        return valueVector->getData() + valueVector->getNumBytesPerValue() * listEntry.offset;
+    }
+};
+
+} // namespace common
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/windows_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/windows_utils.h
new file mode 100644
index 0000000000..bf2466d707
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/common/windows_utils.h
@@ -0,0 +1,18 @@
+#pragma once
+
+#if defined(_WIN32)
+#include <string>
+
+#include "windows.h"
+
+namespace lbug {
+namespace common {
+
+struct WindowsUtils {
+    static std::wstring utf8ToUnicode(const char* input);
+    static std::string unicodeToUTF8(LPCWSTR input);
+};
+
+} // namespace common
+} // namespace lbug
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/case_evaluator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/case_evaluator.h
new file mode 100644
index 0000000000..90b2b27fcd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/case_evaluator.h
@@ -0,0 +1,79 @@
+#pragma once
+
+#include <bitset>
+
+#include "binder/expression/expression.h"
+#include "common/system_config.h"
+#include "expression_evaluator.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+
+namespace evaluator {
+
+struct CaseAlternativeEvaluator {
+    std::unique_ptr<ExpressionEvaluator> whenEvaluator;
+    std::unique_ptr<ExpressionEvaluator> thenEvaluator;
+    std::unique_ptr<common::SelectionVector> whenSelVector;
+
+    CaseAlternativeEvaluator(std::unique_ptr<ExpressionEvaluator> whenEvaluator,
+        std::unique_ptr<ExpressionEvaluator> thenEvaluator)
+        : whenEvaluator{std::move(whenEvaluator)}, thenEvaluator{std::move(thenEvaluator)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(CaseAlternativeEvaluator);
+
+    void init(const processor::ResultSet& resultSet, main::ClientContext* clientContext);
+
+private:
+    CaseAlternativeEvaluator(const CaseAlternativeEvaluator& other)
+        : whenEvaluator{other.whenEvaluator->copy()}, thenEvaluator{other.thenEvaluator->copy()} {}
+};
+
+class CaseExpressionEvaluator : public ExpressionEvaluator {
+    static constexpr EvaluatorType type_ = EvaluatorType::CASE_ELSE;
+
+public:
+    CaseExpressionEvaluator(std::shared_ptr<binder::Expression> expression,
+        std::vector<CaseAlternativeEvaluator> alternativeEvaluators,
+        std::unique_ptr<ExpressionEvaluator> elseEvaluator)
+        : ExpressionEvaluator{type_, std::move(expression)},
+          alternativeEvaluators{std::move(alternativeEvaluators)},
+          elseEvaluator{std::move(elseEvaluator)} {}
+
+    const std::vector<CaseAlternativeEvaluator>& getAlternativeEvaluators() const {
+        return alternativeEvaluators;
+    }
+    ExpressionEvaluator* getElseEvaluator() const { return elseEvaluator.get(); }
+
+    void init(const processor::ResultSet& resultSet, main::ClientContext* clientContext) override;
+
+    void evaluate() override;
+
+    bool selectInternal(common::SelectionVector& selVector) override;
+
+    std::unique_ptr<ExpressionEvaluator> copy() override {
+        return std::make_unique<CaseExpressionEvaluator>(expression,
+            copyVector(alternativeEvaluators), elseEvaluator->copy());
+    }
+
+protected:
+    void resolveResultVector(const processor::ResultSet& resultSet,
+        storage::MemoryManager* memoryManager) override;
+
+private:
+    void fillSelected(const common::SelectionVector& selVector, common::ValueVector* srcVector);
+
+    void fillAll(common::ValueVector* srcVector);
+
+    void fillEntry(common::sel_t resultPos, common::ValueVector* srcVector);
+
+private:
+    std::vector<CaseAlternativeEvaluator> alternativeEvaluators;
+    std::unique_ptr<ExpressionEvaluator> elseEvaluator;
+
+    std::bitset<common::DEFAULT_VECTOR_CAPACITY> filledMask;
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/expression_evaluator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/expression_evaluator.h
new file mode 100644
index 0000000000..a538035ef6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/expression_evaluator.h
@@ -0,0 +1,121 @@
+#pragma once
+
+#include "processor/result/result_set.h"
+
+namespace lbug {
+namespace binder {
+class Expression;
+}
+namespace evaluator {
+
+struct EvaluatorLocalState {
+    main::ClientContext* clientContext = nullptr;
+};
+
+enum class EvaluatorType : uint8_t {
+    CASE_ELSE = 0,
+    FUNCTION = 1,
+    LAMBDA_PARAM = 2,
+    LIST_LAMBDA = 3,
+    LITERAL = 4,
+    PATH = 5,
+    NODE_REL = 6,
+    REFERENCE = 8,
+};
+
+class ExpressionEvaluator;
+using evaluator_vector_t = std::vector<std::unique_ptr<ExpressionEvaluator>>;
+
+class ExpressionEvaluator {
+public:
+    explicit ExpressionEvaluator(EvaluatorType type, std::shared_ptr<binder::Expression> expression)
+        : type{type}, expression{std::move(expression)} {};
+    ExpressionEvaluator(EvaluatorType type, std::shared_ptr<binder::Expression> expression,
+        bool isResultFlat)
+        : type{type}, expression{std::move(expression)}, isResultFlat_{isResultFlat} {}
+    ExpressionEvaluator(EvaluatorType type, std::shared_ptr<binder::Expression> expression,
+        evaluator_vector_t children)
+        : type{type}, expression{std::move(expression)}, children{std::move(children)} {}
+    ExpressionEvaluator(const ExpressionEvaluator& other)
+        : type{other.type}, expression{other.expression}, isResultFlat_{other.isResultFlat_},
+          children{copyVector(other.children)} {}
+    virtual ~ExpressionEvaluator() = default;
+
+    EvaluatorType getEvaluatorType() const { return type; }
+
+    std::shared_ptr<binder::Expression> getExpression() const { return expression; }
+    bool isResultFlat() const { return isResultFlat_; }
+
+    const evaluator_vector_t& getChildren() const { return children; }
+
+    virtual void init(const processor::ResultSet& resultSet, main::ClientContext* clientContext);
+
+    virtual void evaluate() = 0;
+    // Evaluate and duplicate result for count times. This is a fast path we implemented for
+    // bulk-insert when evaluate default values. A default value should be
+    // - a constant (after folding); or
+    // - a nextVal() function for serial column
+    virtual void evaluate(common::sel_t count);
+
+    bool select(common::SelectionVector& selVector, bool shouldSetSelVectorToFiltered);
+
+    virtual std::unique_ptr<ExpressionEvaluator> copy() = 0;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+protected:
+    virtual void resolveResultVector(const processor::ResultSet& resultSet,
+        storage::MemoryManager* memoryManager) = 0;
+
+    void resolveResultStateFromChildren(const std::vector<ExpressionEvaluator*>& inputEvaluators);
+
+    virtual bool selectInternal(common::SelectionVector& selVector) = 0;
+
+    bool updateSelectedPos(common::SelectionVector& selVector) const {
+        auto& resultSelVector = resultVector->state->getSelVector();
+        if (resultSelVector.getSelSize() > 1) {
+            auto numSelectedValues = 0u;
+            for (auto i = 0u; i < resultSelVector.getSelSize(); ++i) {
+                auto pos = resultSelVector[i];
+                auto selectedPosBuffer = selVector.getMutableBuffer();
+                selectedPosBuffer[numSelectedValues] = pos;
+                numSelectedValues +=
+                    resultVector->isNull(pos) ? 0 : resultVector->getValue<bool>(pos);
+            }
+            selVector.setSelSize(numSelectedValues);
+            return numSelectedValues > 0;
+        } else {
+            // If result state is flat (i.e. all children are flat), we shouldn't try to update
+            // selectedPos because we don't know which one is leading, i.e. the one being selected
+            // by filter.
+            // So we forget about selectedPos and directly return true/false. This doesn't change
+            // the correctness, because when all children are flat the check is done on tuple.
+            auto pos = resultVector->state->getSelVector()[0];
+            return resultVector->isNull(pos) ? 0 : resultVector->getValue<bool>(pos);
+        }
+    }
+
+public:
+    std::shared_ptr<common::ValueVector> resultVector;
+
+protected:
+    EvaluatorType type;
+    std::shared_ptr<binder::Expression> expression;
+    bool isResultFlat_ = true;
+    evaluator_vector_t children;
+    EvaluatorLocalState localState;
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/expression_evaluator_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/expression_evaluator_utils.h
new file mode 100644
index 0000000000..8916428228
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/expression_evaluator_utils.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace evaluator {
+
+struct ExpressionEvaluatorUtils {
+    static LBUG_API common::Value evaluateConstantExpression(
+        std::shared_ptr<binder::Expression> expression, main::ClientContext* clientContext);
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/expression_evaluator_visitor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/expression_evaluator_visitor.h
new file mode 100644
index 0000000000..67f6d9fecc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/expression_evaluator_visitor.h
@@ -0,0 +1,43 @@
+#pragma once
+
+#include "expression_evaluator.h"
+
+namespace lbug {
+namespace evaluator {
+
+class ExpressionEvaluatorVisitor {
+public:
+    virtual ~ExpressionEvaluatorVisitor() = default;
+
+protected:
+    void visitSwitch(ExpressionEvaluator* evaluator);
+
+    virtual void visitCase(ExpressionEvaluator*) {}
+    virtual void visitFunction(ExpressionEvaluator*) {}
+    virtual void visitLambdaParam(ExpressionEvaluator*) {}
+    virtual void visitListLambda(ExpressionEvaluator*) {}
+    virtual void visitLiteral(ExpressionEvaluator*) {}
+    virtual void visitPath(ExpressionEvaluator*) {}
+    virtual void visitReference(ExpressionEvaluator*) {}
+    // NOTE: If one decides to overwrite pattern evaluator visitor, make sure we differentiate
+    // pattern evaluator and undirected rel evaluator.
+    void visitPattern(ExpressionEvaluator*) {}
+};
+
+class LambdaParamEvaluatorCollector final : public ExpressionEvaluatorVisitor {
+public:
+    void visit(ExpressionEvaluator* evaluator);
+
+    std::vector<ExpressionEvaluator*> getEvaluators() const { return evaluators; }
+
+protected:
+    void visitLambdaParam(ExpressionEvaluator* evaluator) override {
+        evaluators.push_back(evaluator);
+    }
+
+private:
+    std::vector<ExpressionEvaluator*> evaluators;
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/function_evaluator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/function_evaluator.h
new file mode 100644
index 0000000000..371b5b3911
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/function_evaluator.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include "expression_evaluator.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace evaluator {
+
+class FunctionExpressionEvaluator : public ExpressionEvaluator {
+    static constexpr EvaluatorType type_ = EvaluatorType::FUNCTION;
+
+public:
+    FunctionExpressionEvaluator(std::shared_ptr<binder::Expression> expression,
+        std::vector<std::unique_ptr<ExpressionEvaluator>> children);
+
+    void evaluate() override;
+    void evaluate(common::sel_t count) override;
+
+    bool selectInternal(common::SelectionVector& selVector) override;
+
+    std::unique_ptr<ExpressionEvaluator> copy() override {
+        return std::make_unique<FunctionExpressionEvaluator>(expression, copyVector(children));
+    }
+
+protected:
+    void resolveResultVector(const processor::ResultSet& resultSet,
+        storage::MemoryManager* memoryManager) override;
+
+    void runExecFunc(void* dataPtr = nullptr);
+
+private:
+    std::vector<std::shared_ptr<common::ValueVector>> parameters;
+    std::unique_ptr<function::ScalarFunction> function;
+    std::unique_ptr<function::FunctionBindData> bindData;
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/lambda_evaluator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/lambda_evaluator.h
new file mode 100644
index 0000000000..7750b0648d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/lambda_evaluator.h
@@ -0,0 +1,101 @@
+#pragma once
+
+#include "binder/expression/scalar_function_expression.h"
+#include "expression_evaluator.h"
+
+namespace lbug {
+namespace evaluator {
+
+class ListSliceInfo;
+class ListEntryTracker;
+
+enum class ListLambdaType : uint8_t {
+    LIST_TRANSFORM = 0,
+    LIST_FILTER = 1,
+    LIST_REDUCE = 2,
+    DEFAULT = 3
+};
+
+class LambdaParamEvaluator : public ExpressionEvaluator {
+    static constexpr EvaluatorType type_ = EvaluatorType::LAMBDA_PARAM;
+
+public:
+    explicit LambdaParamEvaluator(std::shared_ptr<binder::Expression> expression)
+        : ExpressionEvaluator{type_, std::move(expression), false /* isResultFlat */} {}
+
+    void evaluate() override {}
+
+    bool selectInternal(common::SelectionVector&) override { KU_UNREACHABLE; }
+
+    std::unique_ptr<ExpressionEvaluator> copy() override {
+        return std::make_unique<LambdaParamEvaluator>(expression);
+    }
+
+    std::string getVarName() { return this->getExpression()->toString(); }
+
+protected:
+    void resolveResultVector(const processor::ResultSet&, storage::MemoryManager*) override {}
+};
+
+struct ListLambdaBindData {
+    std::vector<LambdaParamEvaluator*> lambdaParamEvaluators;
+    std::vector<common::idx_t> paramIndices;
+    ExpressionEvaluator* rootEvaluator = nullptr;
+    ListSliceInfo* sliceInfo = nullptr;
+};
+
+// E.g. for function list_transform([0,1,2], x->x+1)
+// ListLambdaEvaluator has one child that is the evaluator of [0,1,2]
+// lambdaRootEvaluator is the evaluator of x+1
+// lambdaParamEvaluator is the evaluator of x
+class ListLambdaEvaluator : public ExpressionEvaluator {
+    static constexpr EvaluatorType type_ = EvaluatorType::LIST_LAMBDA;
+    static ListLambdaType checkListLambdaTypeWithFunctionName(std::string functionName);
+
+public:
+    ListLambdaEvaluator(std::shared_ptr<binder::Expression> expression, evaluator_vector_t children)
+        : ExpressionEvaluator{type_, expression, std::move(children)}, memoryManager(nullptr) {
+        execFunc = expression->constCast<binder::ScalarFunctionExpression>().getFunction().execFunc;
+        listLambdaType = checkListLambdaTypeWithFunctionName(
+            expression->constCast<binder::ScalarFunctionExpression>().getFunction().name);
+    }
+
+    void setLambdaRootEvaluator(std::unique_ptr<ExpressionEvaluator> evaluator) {
+        lambdaRootEvaluator = std::move(evaluator);
+    }
+
+    void init(const processor::ResultSet& resultSet, main::ClientContext* clientContext) override;
+
+    void evaluate() override;
+
+    bool selectInternal(common::SelectionVector& selVector) override;
+
+    std::unique_ptr<ExpressionEvaluator> copy() override {
+        auto result = std::make_unique<ListLambdaEvaluator>(expression, copyVector(children));
+        result->setLambdaRootEvaluator(lambdaRootEvaluator->copy());
+        return result;
+    }
+
+    std::vector<common::idx_t> getParamIndices();
+
+protected:
+    void resolveResultVector(const processor::ResultSet& resultSet,
+        storage::MemoryManager* memoryManager) override;
+
+private:
+    void evaluateInternal();
+
+    function::scalar_func_exec_t execFunc;
+    ListLambdaBindData bindData;
+
+private:
+    std::unique_ptr<ExpressionEvaluator> lambdaRootEvaluator;
+    std::vector<LambdaParamEvaluator*> lambdaParamEvaluators;
+    std::vector<std::shared_ptr<common::ValueVector>> params;
+    ListLambdaType listLambdaType;
+
+    storage::MemoryManager* memoryManager;
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/list_slice_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/list_slice_info.h
new file mode 100644
index 0000000000..62ac1b5bd4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/list_slice_info.h
@@ -0,0 +1,111 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug::evaluator {
+
+class LambdaParamEvaluator;
+
+class ListEntryTracker {
+public:
+    explicit ListEntryTracker(common::ValueVector* listVector);
+
+    common::offset_t getCurDataOffset() const { return getCurListEntry().offset + offsetInList; }
+    common::offset_t getNextDataOffset();
+    common::list_entry_t getCurListEntry() const {
+        return listVector->getValue<common::list_entry_t>(getListEntryPos());
+    }
+    common::idx_t getListEntryPos() const { return listEntries[listEntryIdx]; }
+
+    bool done() const { return listEntryIdx >= listEntries.size(); }
+
+private:
+    void updateListEntry();
+
+    common::ValueVector* listVector;
+    common::idx_t listEntryIdx;
+    common::offset_t offsetInList;
+
+    // selected pos of each list entry
+    std::vector<common::sel_t> listEntries;
+};
+
+/**
+ * List data vectors can their number of elements exceed DEFAULT_VECTOR_CAPACITY
+ * However, most expression evaluators can only process elements in batches of size
+ * DEFAULT_VECTOR_CAPACITY
+ * This means that in order for lambda evaluators to work it must pass in its data in slices of size
+ * DEFAULT_VECTOR_CAPACITY for processing by child evaluators
+ *
+ * A consequence of this is that some lists may have their data vectors split into different slices
+ * and thus it is unreasonable to have execFuncs operate on a list-by-list basis. Instead, they
+ * should operate on each data vector entry individually.
+ *
+ * Instead, any lambda execFunc should follow this pattern using the ListSliceInfo struct
+ * void execFunc(...) {
+ *   auto& sliceInfo = *listLambdaBindData->sliceInfo;
+ *   // loop through each data vector entry in the slice
+ *   for (sel_t i = 0; i < sliceInfo.getSliceSize(); ++i) {
+ *       // dataOffset: the offset of the current entry in the input data vector
+ *       // listEntryPos: the pos of the list entry containing to the data entry in the list vector
+ *       const auto [listEntryPos, dataOffset] = sliceInfo.getPos(i);
+ *       doSomething(listEntryPos, dataOffset);
+ *   }
+ *
+ *   // do any final processing required on each list entry vector
+ *   // only do this once for all slices
+ *   if (sliceInfo.done()) {
+ *       for (uint64_t i = 0; i < inputSelVector.getSelSize(); ++i) {
+ *           auto pos = inputSelVector[i];
+ *           doSomething(inputVector, pos);
+ *       }
+ *   }
+ */
+class ListSliceInfo {
+public:
+    explicit ListSliceInfo(common::ValueVector* listVector)
+        : resultSliceOffset(0), listEntryTracker(listVector),
+          sliceDataState(std::make_shared<common::DataChunkState>()),
+          sliceListEntryState(std::make_shared<common::DataChunkState>()) {
+        sliceDataState->setToUnflat();
+        sliceDataState->getSelVectorUnsafe().setToFiltered();
+        sliceListEntryState->setToUnflat();
+        sliceListEntryState->getSelVectorUnsafe().setToFiltered();
+    }
+
+    void nextSlice();
+
+    std::vector<std::shared_ptr<common::DataChunkState>> overrideAndSaveParamStates(
+        std::span<LambdaParamEvaluator*> lambdaParamEvaluators);
+    static void restoreParamStates(std::span<LambdaParamEvaluator*> lambdaParamEvaluators,
+        std::vector<std::shared_ptr<common::DataChunkState>> savedStates);
+
+    // use in cases (like list filter) where the output data offset may not correspond to the input
+    // data offset
+    common::offset_t& getResultSliceOffset() { return resultSliceOffset; }
+
+    bool done() const;
+
+    common::sel_t getSliceSize() const {
+        KU_ASSERT(sliceDataState->getSelSize() == sliceListEntryState->getSelSize());
+        return sliceDataState->getSelSize();
+    }
+
+    // returns {list entry pos, data pos}
+    std::pair<common::sel_t, common::sel_t> getPos(common::idx_t i) const {
+        return {sliceListEntryState->getSelVector()[i], sliceDataState->getSelVector()[i]};
+    }
+
+private:
+    void updateSelVector();
+
+    // offset/size refer to the data vector
+    common::offset_t resultSliceOffset;
+
+    ListEntryTracker listEntryTracker;
+
+    std::shared_ptr<common::DataChunkState> sliceDataState;
+    std::shared_ptr<common::DataChunkState> sliceListEntryState;
+};
+
+} // namespace lbug::evaluator
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/literal_evaluator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/literal_evaluator.h
new file mode 100644
index 0000000000..7fd5740166
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/literal_evaluator.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include "common/types/value/value.h"
+#include "expression_evaluator.h"
+
+namespace lbug {
+namespace evaluator {
+
+class LiteralExpressionEvaluator : public ExpressionEvaluator {
+    static constexpr EvaluatorType type_ = EvaluatorType::LITERAL;
+
+public:
+    LiteralExpressionEvaluator(std::shared_ptr<binder::Expression> expression, common::Value value)
+        : ExpressionEvaluator{type_, std::move(expression), true /* isResultFlat */},
+          value{std::move(value)} {}
+
+    void evaluate() override;
+
+    void evaluate(common::sel_t count) override;
+
+    bool selectInternal(common::SelectionVector& selVector) override;
+
+    std::unique_ptr<ExpressionEvaluator> copy() override {
+        return std::make_unique<LiteralExpressionEvaluator>(expression, value);
+    }
+
+protected:
+    void resolveResultVector(const processor::ResultSet& resultSet,
+        storage::MemoryManager* memoryManager) override;
+
+private:
+    common::Value value;
+    std::shared_ptr<common::DataChunkState> flatState;
+    std::shared_ptr<common::DataChunkState> unFlatState;
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/path_evaluator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/path_evaluator.h
new file mode 100644
index 0000000000..0ab902e704
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/path_evaluator.h
@@ -0,0 +1,69 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "expression_evaluator.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+
+namespace evaluator {
+
+class PathExpressionEvaluator final : public ExpressionEvaluator {
+    static constexpr EvaluatorType type_ = EvaluatorType::PATH;
+
+public:
+    PathExpressionEvaluator(std::shared_ptr<binder::Expression> expression,
+        evaluator_vector_t children)
+        : ExpressionEvaluator{type_, std::move(expression), std::move(children)},
+          resultNodesVector(nullptr), resultRelsVector(nullptr) {}
+
+    void init(const processor::ResultSet& resultSet, main::ClientContext* clientContext) override;
+
+    void evaluate() override;
+
+    bool selectInternal(common::SelectionVector& /*selVector*/) override { KU_UNREACHABLE; }
+
+    std::unique_ptr<ExpressionEvaluator> copy() override {
+        return make_unique<PathExpressionEvaluator>(expression, copyVector(children));
+    }
+
+private:
+    struct InputVectors {
+        // input can either be NODE, REL or RECURSIVE_REL
+        common::ValueVector* input = nullptr;
+        // nodesInput is LIST[NODE] for RECURSIVE_REL input and nullptr otherwise
+        common::ValueVector* nodesInput = nullptr;
+        // nodesDataInput is NODE for RECURSIVE_REL and nullptr otherwise
+        common::ValueVector* nodesDataInput = nullptr;
+        // relsInput is LIST[REL] for RECURSIVE_REL input and nullptr otherwise
+        common::ValueVector* relsInput = nullptr;
+        // relsDataInput is REL for RECURSIVE_REL input and nullptr otherwise
+        common::ValueVector* relsDataInput = nullptr;
+
+        std::vector<common::ValueVector*> nodeFieldVectors;
+        std::vector<common::ValueVector*> relFieldVectors;
+    };
+
+    void resolveResultVector(const processor::ResultSet& resultSet,
+        storage::MemoryManager* memoryManager) override;
+
+    void copyNodes(common::sel_t resultPos, bool isEmptyRels);
+    uint64_t copyRels(common::sel_t resultPos);
+
+    void copyFieldVectors(common::offset_t inputVectorPos,
+        const std::vector<common::ValueVector*>& inputFieldVectors,
+        common::offset_t& resultVectorPos,
+        const std::vector<common::ValueVector*>& resultFieldVectors);
+
+private:
+    std::vector<std::unique_ptr<InputVectors>> inputVectorsPerChild;
+    common::ValueVector* resultNodesVector; // LIST[NODE]
+    common::ValueVector* resultRelsVector;  // LIST[REL]
+    std::vector<common::ValueVector*> resultNodesFieldVectors;
+    std::vector<common::ValueVector*> resultRelsFieldVectors;
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/pattern_evaluator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/pattern_evaluator.h
new file mode 100644
index 0000000000..e4d5ed3ff3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/pattern_evaluator.h
@@ -0,0 +1,61 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "expression_evaluator.h"
+
+namespace lbug {
+namespace evaluator {
+
+class PatternExpressionEvaluator : public ExpressionEvaluator {
+    static constexpr EvaluatorType type_ = EvaluatorType::NODE_REL;
+
+public:
+    PatternExpressionEvaluator(std::shared_ptr<binder::Expression> pattern,
+        evaluator_vector_t children)
+        : ExpressionEvaluator{type_, std::move(pattern), std::move(children)}, idVector{nullptr} {}
+
+    void evaluate() override;
+
+    bool selectInternal(common::SelectionVector&) override { KU_UNREACHABLE; }
+
+    std::unique_ptr<ExpressionEvaluator> copy() override {
+        return std::make_unique<PatternExpressionEvaluator>(expression, copyVector(children));
+    }
+
+protected:
+    void resolveResultVector(const processor::ResultSet& resultSet,
+        storage::MemoryManager* memoryManager) override;
+
+    virtual void initFurther(const processor::ResultSet& resultSet);
+
+protected:
+    common::ValueVector* idVector;
+    std::vector<std::shared_ptr<common::ValueVector>> parameters;
+};
+
+class UndirectedRelExpressionEvaluator final : public PatternExpressionEvaluator {
+public:
+    UndirectedRelExpressionEvaluator(std::shared_ptr<binder::Expression> pattern,
+        evaluator_vector_t children, std::unique_ptr<ExpressionEvaluator> directionEvaluator)
+        : PatternExpressionEvaluator{std::move(pattern), std::move(children)}, srcIDVector{nullptr},
+          dstIDVector{nullptr}, directionVector{nullptr},
+          directionEvaluator{std::move(directionEvaluator)} {}
+
+    void evaluate() override;
+
+    void initFurther(const processor::ResultSet& resultSet) override;
+
+    std::unique_ptr<ExpressionEvaluator> copy() override {
+        return std::make_unique<UndirectedRelExpressionEvaluator>(expression, copyVector(children),
+            directionEvaluator->copy());
+    }
+
+private:
+    common::ValueVector* srcIDVector;
+    common::ValueVector* dstIDVector;
+    common::ValueVector* directionVector;
+    std::unique_ptr<ExpressionEvaluator> directionEvaluator;
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/reference_evaluator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/reference_evaluator.h
new file mode 100644
index 0000000000..57ce5b2bf2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/expression_evaluator/reference_evaluator.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include "expression_evaluator.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+
+namespace evaluator {
+
+class ReferenceExpressionEvaluator : public ExpressionEvaluator {
+    static constexpr EvaluatorType type_ = EvaluatorType::REFERENCE;
+
+public:
+    ReferenceExpressionEvaluator(std::shared_ptr<binder::Expression> expression, bool isResultFlat,
+        const processor::DataPos& dataPos)
+        : ExpressionEvaluator{type_, std::move(expression), isResultFlat}, dataPos{dataPos} {}
+
+    void evaluate() override {}
+
+    bool selectInternal(common::SelectionVector& selVector) override;
+
+    std::unique_ptr<ExpressionEvaluator> copy() override {
+        return std::make_unique<ReferenceExpressionEvaluator>(expression, isResultFlat_, dataPos);
+    }
+
+protected:
+    void resolveResultVector(const processor::ResultSet& resultSet,
+        storage::MemoryManager*) override {
+        resultVector = resultSet.getValueVector(dataPos);
+    }
+
+private:
+    processor::DataPos dataPos;
+};
+
+} // namespace evaluator
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/binder_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/binder_extension.h
new file mode 100644
index 0000000000..ea06223f45
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/binder_extension.h
@@ -0,0 +1,19 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace extension {
+
+class LBUG_API BinderExtension {
+public:
+    BinderExtension() {}
+
+    virtual ~BinderExtension() = default;
+
+    virtual std::unique_ptr<binder::BoundStatement> bind(const parser::Statement& statement) = 0;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/bound_extension_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/bound_extension_clause.h
new file mode 100644
index 0000000000..8d38366673
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/bound_extension_clause.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+
+namespace lbug {
+namespace extension {
+
+class BoundExtensionClause : public binder::BoundStatement {
+    static constexpr common::StatementType type_ = common::StatementType::EXTENSION_CLAUSE;
+
+public:
+    explicit BoundExtensionClause(std::string statementName)
+        : BoundStatement{type_, binder::BoundStatementResult::createSingleStringColumnResult(
+                                    "result" /* columnName */)},
+          statementName{std::move(statementName)} {}
+
+    std::string getStatementName() const { return statementName; }
+
+private:
+    std::string statementName;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/catalog_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/catalog_extension.h
new file mode 100644
index 0000000000..6ec87b03b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/catalog_extension.h
@@ -0,0 +1,18 @@
+#pragma once
+
+#include "catalog/catalog.h"
+
+namespace lbug {
+namespace extension {
+
+class LBUG_API CatalogExtension : public catalog::Catalog {
+public:
+    CatalogExtension() : Catalog() {}
+
+    virtual void init() = 0;
+
+    void invalidateCache();
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension.h
new file mode 100644
index 0000000000..aac882de25
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension.h
@@ -0,0 +1,196 @@
+#pragma once
+
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/catalog_entry_type.h"
+#include "common/api.h"
+#include "main/database.h"
+#include "transaction/transaction.h"
+
+#define ADD_EXTENSION_OPTION(OPTION)                                                               \
+    db->addExtensionOption(OPTION::NAME, OPTION::TYPE, OPTION::getDefaultValue())
+
+#define ADD_CONFIDENTIAL_EXTENSION_OPTION(OPTION)                                                  \
+    db->addExtensionOption(OPTION::NAME, OPTION::TYPE, OPTION::getDefaultValue(), true)
+
+namespace lbug::storage {
+struct IndexType;
+}
+namespace lbug {
+namespace function {
+struct TableFunction;
+} // namespace function
+
+namespace extension {
+
+typedef void (*ext_init_func_t)(main::ClientContext*);
+typedef const char* (*ext_name_func_t)();
+using ext_load_func_t = ext_init_func_t;
+typedef void (*ext_install_func_t)(const std::string&, main::ClientContext&);
+
+std::string getPlatform();
+
+class LBUG_API Extension {
+public:
+    virtual ~Extension() = default;
+};
+
+struct ExtensionRepoInfo {
+    std::string hostPath;
+    std::string hostURL;
+    std::string repoURL;
+};
+
+enum class ExtensionSource : uint8_t { OFFICIAL, USER, STATIC_LINKED };
+
+struct ExtensionSourceUtils {
+    static std::string toString(ExtensionSource source);
+};
+
+template<typename T>
+void addFunc(main::Database& database, std::string name, catalog::CatalogEntryType functionType,
+    bool isInternal = false) {
+    auto catalog = database.getCatalog();
+    if (catalog->containsFunction(&transaction::DUMMY_TRANSACTION, name, isInternal)) {
+        return;
+    }
+    catalog->addFunction(&transaction::DUMMY_TRANSACTION, functionType, std::move(name),
+        T::getFunctionSet(), isInternal);
+}
+
+struct LBUG_API ExtensionUtils {
+    static constexpr const char* OFFICIAL_EXTENSION_REPO = "http://extension.ladybugdb.com/";
+    static constexpr const char* EXTENSION_FILE_SUFFIX = "lbug_extension";
+
+    static constexpr const char* EXTENSION_FILE_REPO_PATH = "{}v{}/{}/{}/{}";
+
+    static constexpr const char* SHARED_LIB_REPO = "{}v{}/{}/common/{}";
+
+    static constexpr const char* EXTENSION_FILE_NAME = "lib{}.{}";
+
+    static constexpr const char* OFFICIAL_EXTENSION[] = {"HTTPFS", "POSTGRES", "DUCKDB", "JSON",
+        "SQLITE", "FTS", "DELTA", "ICEBERG", "AZURE", "UNITY_CATALOG", "VECTOR", "NEO4J", "ALGO",
+        "LLM"};
+
+    static constexpr const char* EXTENSION_LOADER_SUFFIX = "_loader";
+
+    static constexpr const char* EXTENSION_INSTALLER_SUFFIX = "_installer";
+
+    static ExtensionRepoInfo getExtensionLibRepoInfo(const std::string& extensionName,
+        const std::string& extensionRepo);
+
+    static ExtensionRepoInfo getExtensionLoaderRepoInfo(const std::string& extensionName,
+        const std::string& extensionRepo);
+
+    static ExtensionRepoInfo getExtensionInstallerRepoInfo(const std::string& extensionName,
+        const std::string& extensionRepo);
+
+    static ExtensionRepoInfo getSharedLibRepoInfo(const std::string& fileName,
+        const std::string& extensionRepo);
+
+    static std::string getExtensionFileName(const std::string& name);
+
+    static std::string getLocalPathForExtensionLib(main::ClientContext* context,
+        const std::string& extensionName);
+
+    static std::string getLocalPathForExtensionLoader(main::ClientContext* context,
+        const std::string& extensionName);
+
+    static std::string getLocalPathForExtensionInstaller(main::ClientContext* context,
+        const std::string& extensionName);
+
+    static std::string getLocalDirForExtension(main::ClientContext* context,
+        const std::string& extensionName);
+
+    static std::string appendLibSuffix(const std::string& libName);
+
+    static std::string getLocalPathForSharedLib(main::ClientContext* context,
+        const std::string& libName);
+
+    static std::string getLocalPathForSharedLib(main::ClientContext* context);
+
+    static bool isOfficialExtension(const std::string& extension);
+
+    template<typename T>
+    static void addTableFunc(main::Database& database) {
+        addFunc<T>(database, T::name, catalog::CatalogEntryType::TABLE_FUNCTION_ENTRY);
+    }
+
+    template<typename T>
+    static void addTableFuncAlias(main::Database& database) {
+        addFunc<typename T::alias>(database, T::name,
+            catalog::CatalogEntryType::TABLE_FUNCTION_ENTRY);
+    }
+
+    template<typename T>
+    static void addStandaloneTableFunc(main::Database& database) {
+        addFunc<T>(database, T::name, catalog::CatalogEntryType::STANDALONE_TABLE_FUNCTION_ENTRY,
+            false /* isInternal */);
+    }
+    template<typename T>
+    static void addInternalStandaloneTableFunc(main::Database& database) {
+        addFunc<T>(database, T::name, catalog::CatalogEntryType::STANDALONE_TABLE_FUNCTION_ENTRY,
+            true /* isInternal */);
+    }
+
+    template<typename T>
+    static void addScalarFunc(main::Database& database) {
+        addFunc<T>(database, T::name, catalog::CatalogEntryType::SCALAR_FUNCTION_ENTRY);
+    }
+
+    template<typename T>
+    static void addScalarFuncAlias(main::Database& database) {
+        addFunc<typename T::alias>(database, T::name,
+            catalog::CatalogEntryType::SCALAR_FUNCTION_ENTRY);
+    }
+
+    template<typename T>
+    static void addExportFunc(main::Database& database) {
+        addFunc<T>(database, T::name, catalog::CatalogEntryType::COPY_FUNCTION_ENTRY);
+    }
+
+    static void registerIndexType(main::Database& database, storage::IndexType type);
+};
+
+class LBUG_API ExtensionLibLoader {
+public:
+    static constexpr const char* EXTENSION_LOAD_FUNC_NAME = "load";
+
+    static constexpr const char* EXTENSION_INIT_FUNC_NAME = "init";
+
+    static constexpr const char* EXTENSION_NAME_FUNC_NAME = "name";
+
+    static constexpr const char* EXTENSION_INSTALL_FUNC_NAME = "install";
+
+public:
+    ExtensionLibLoader(const std::string& extensionName, const std::string& path);
+
+    ext_load_func_t getLoadFunc();
+
+    ext_init_func_t getInitFunc();
+
+    ext_name_func_t getNameFunc();
+
+    ext_install_func_t getInstallFunc();
+
+    void unload();
+
+private:
+    void* getDynamicLibFunc(const std::string& funcName);
+
+private:
+    std::string extensionName;
+    void* libHdl;
+};
+
+#ifdef _WIN32
+std::wstring utf8ToUnicode(const char* input);
+
+void* dlopen(const char* file, int /*mode*/);
+
+void* dlsym(void* handle, const char* name);
+
+void dlclose(void* handle);
+#endif
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_action.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_action.h
new file mode 100644
index 0000000000..ec29750bcf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_action.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include <cstdint>
+#include <memory>
+
+namespace lbug {
+namespace extension {
+
+enum class ExtensionAction : uint8_t {
+    INSTALL = 0,
+    LOAD = 1,
+    UNINSTALL = 2,
+};
+
+struct ExtensionAuxInfo {
+    ExtensionAction action;
+    std::string path;
+
+    ExtensionAuxInfo(ExtensionAction action, std::string path)
+        : action{action}, path{std::move(path)} {}
+
+    virtual ~ExtensionAuxInfo() = default;
+
+    template<typename TARGET>
+    const TARGET& contCast() const {
+        return dynamic_cast<const TARGET&>(*this);
+    }
+
+    virtual std::unique_ptr<ExtensionAuxInfo> copy() {
+        return std::make_unique<ExtensionAuxInfo>(*this);
+    }
+};
+
+struct InstallExtensionAuxInfo : public ExtensionAuxInfo {
+    std::string extensionRepo;
+    bool forceInstall;
+
+    explicit InstallExtensionAuxInfo(std::string extensionRepo, std::string path, bool forceInstall)
+        : ExtensionAuxInfo{ExtensionAction::INSTALL, std::move(path)},
+          extensionRepo{std::move(extensionRepo)}, forceInstall{forceInstall} {}
+
+    std::unique_ptr<ExtensionAuxInfo> copy() override {
+        return std::make_unique<InstallExtensionAuxInfo>(*this);
+    }
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_installer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_installer.h
new file mode 100644
index 0000000000..c7610f70a3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_installer.h
@@ -0,0 +1,45 @@
+#pragma once
+
+#include <string>
+
+#include "common/api.h"
+#include "extension.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace extension {
+
+struct InstallExtensionInfo {
+    std::string name;
+    std::string repo;
+    bool forceInstall;
+
+    InstallExtensionInfo(std::string name, std::string repo, bool forceInstall)
+        : name{std::move(name)}, repo{std::move(repo)}, forceInstall{forceInstall} {}
+};
+
+class LBUG_API ExtensionInstaller {
+public:
+    ExtensionInstaller(const InstallExtensionInfo& info, main::ClientContext& context)
+        : info{info}, context{context} {}
+
+    virtual ~ExtensionInstaller() = default;
+
+    virtual bool install();
+
+protected:
+    void tryDownloadExtensionFile(const ExtensionRepoInfo& info, const std::string& localFilePath);
+
+private:
+    bool installExtension();
+    void installDependencies();
+
+protected:
+    const InstallExtensionInfo& info;
+    main::ClientContext& context;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_loader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_loader.h
new file mode 100644
index 0000000000..14f72f5cf2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_loader.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include <string>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace extension {
+
+class LBUG_API ExtensionLoader {
+public:
+    explicit ExtensionLoader(std::string extensionName) : extensionName{std::move(extensionName)} {}
+
+    virtual ~ExtensionLoader() = default;
+
+    virtual void loadDependency(main::ClientContext* context) = 0;
+
+protected:
+    std::string extensionName;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_manager.h
new file mode 100644
index 0000000000..4bee80cd5f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_manager.h
@@ -0,0 +1,50 @@
+#pragma once
+
+#include "loaded_extension.h"
+#include "storage/storage_extension.h"
+
+namespace lbug {
+namespace main {}
+namespace extension {
+
+struct ExtensionEntry {
+    const char* name;
+    const char* extensionName;
+};
+
+class ExtensionManager {
+public:
+    void loadExtension(const std::string& path, main::ClientContext* context);
+
+    LBUG_API std::string toCypher();
+
+    LBUG_API void addExtensionOption(std::string name, common::LogicalTypeID type,
+        common::Value defaultValue, bool isConfidential);
+
+    const main::ExtensionOption* getExtensionOption(std::string name) const;
+
+    LBUG_API void registerStorageExtension(std::string name,
+        std::unique_ptr<storage::StorageExtension> storageExtension);
+
+    std::vector<storage::StorageExtension*> getStorageExtensions();
+
+    LBUG_API const std::vector<LoadedExtension>& getLoadedExtensions() const {
+        return loadedExtensions;
+    }
+
+    static std::optional<ExtensionEntry> lookupExtensionsByFunctionName(
+        std::string_view functionName);
+    static std::optional<ExtensionEntry> lookupExtensionsByTypeName(std::string_view typeName);
+
+    void autoLoadLinkedExtensions(main::ClientContext* context);
+
+    LBUG_API static ExtensionManager* Get(const main::ClientContext& context);
+
+private:
+    std::vector<LoadedExtension> loadedExtensions;
+    std::unordered_map<std::string, main::ExtensionOption> extensionOptions;
+    common::case_insensitive_map_t<std::unique_ptr<storage::StorageExtension>> storageExtensions;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_statement.h
new file mode 100644
index 0000000000..6f8b42737e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/extension_statement.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "parser/statement.h"
+
+namespace lbug {
+namespace extension {
+
+class ExtensionStatement : public parser::Statement {
+    static constexpr common::StatementType type_ = common::StatementType::EXTENSION_CLAUSE;
+
+public:
+    explicit ExtensionStatement(std::string statementName)
+        : parser::Statement{type_}, statementName{std::move(statementName)} {}
+
+    std::string getStatementName() const { return statementName; }
+
+private:
+    std::string statementName;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/loaded_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/loaded_extension.h
new file mode 100644
index 0000000000..c4508e7433
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/loaded_extension.h
@@ -0,0 +1,31 @@
+#pragma once
+
+#include <string>
+
+#include "extension.h"
+
+namespace lbug {
+namespace extension {
+
+class LoadedExtension {
+
+public:
+    LoadedExtension(std::string extensionName, std::string fullPath, ExtensionSource source)
+        : extensionName{std::move(extensionName)}, fullPath{std::move(fullPath)}, source{source} {}
+
+    std::string getExtensionName() const { return extensionName; }
+
+    std::string getFullPath() const { return fullPath; }
+
+    ExtensionSource getSource() const { return source; }
+
+    std::string toCypher();
+
+private:
+    std::string extensionName;
+    std::string fullPath;
+    ExtensionSource source;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/logical_extension_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/logical_extension_clause.h
new file mode 100644
index 0000000000..3210c08b2e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/logical_extension_clause.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "planner/operator/simple/logical_simple.h"
+
+namespace lbug {
+namespace extension {
+
+class LogicalExtensionClause : public planner::LogicalSimple {
+    static constexpr planner::LogicalOperatorType type_ =
+        planner::LogicalOperatorType::EXTENSION_CLAUSE;
+
+public:
+    explicit LogicalExtensionClause(std::string statementName)
+        : LogicalSimple{type_}, statementName{std::move(statementName)} {}
+
+    void computeFactorizedSchema() override { createEmptySchema(); }
+    void computeFlatSchema() override { createEmptySchema(); }
+
+    std::string getStatementName() const { return statementName; }
+
+private:
+    std::string statementName;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/mapper_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/mapper_extension.h
new file mode 100644
index 0000000000..86cf925456
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/mapper_extension.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace extension {
+
+class LBUG_API MapperExtension {
+public:
+    MapperExtension() {}
+
+    virtual ~MapperExtension() = default;
+
+    virtual std::unique_ptr<processor::PhysicalOperator> map(
+        const planner::LogicalOperator* logicalOperator, main::ClientContext* context,
+        uint32_t operatorID) = 0;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/planner_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/planner_extension.h
new file mode 100644
index 0000000000..50e447c47a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/planner_extension.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "planner/planner.h"
+
+namespace lbug {
+namespace extension {
+
+class PlannerExtension {
+
+public:
+    PlannerExtension() {}
+
+    virtual ~PlannerExtension() = default;
+
+    virtual std::shared_ptr<planner::LogicalOperator> plan(
+        const binder::BoundStatement& boundStatement) = 0;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/transformer_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/transformer_extension.h
new file mode 100644
index 0000000000..2d839c90ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/extension/transformer_extension.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include <memory>
+
+#include "parser/statement.h"
+
+namespace antlr4 {
+class ParserRuleContext;
+}
+
+namespace lbug {
+namespace extension {
+
+class LBUG_API TransformerExtension {
+public:
+    TransformerExtension() {}
+
+    virtual ~TransformerExtension() = default;
+
+    virtual std::unique_ptr<parser::Statement> transform(antlr4::ParserRuleContext* context) = 0;
+};
+
+} // namespace extension
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/avg.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/avg.h
new file mode 100644
index 0000000000..80b476b82c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/avg.h
@@ -0,0 +1,101 @@
+#pragma once
+
+#include "common/in_mem_overflow_buffer.h"
+#include "common/types/int128_t.h"
+#include "common/types/uint128_t.h"
+#include "function/aggregate_function.h"
+#include "function/arithmetic/add.h"
+
+namespace lbug {
+namespace function {
+
+template<typename T>
+struct AvgState : public AggregateStateWithNull {
+    uint32_t getStateSize() const override { return sizeof(*this); }
+    void writeToVector(common::ValueVector* outputVector, uint64_t pos) override {
+        outputVector->setValue(pos, avg);
+    }
+
+    void finalize()
+        requires common::IntegerTypes<T>
+    {
+        using ResultType = std::conditional<common::SignedIntegerTypes<T>, common::Int128_t,
+            common::UInt128_t>::type;
+        if (!isNull) {
+            avg = ResultType::template cast<long double>(sum) /
+                  ResultType::template cast<long double>(count);
+        }
+    }
+
+    void finalize()
+        requires common::FloatingPointTypes<T>
+    {
+        if (!isNull) {
+            avg = sum / count;
+        }
+    }
+
+    T sum{};
+    uint64_t count = 0;
+    double avg = 0;
+};
+
+template<typename INPUT_TYPE, typename RESULT_TYPE>
+struct AvgFunction {
+
+    static std::unique_ptr<AggregateState> initialize() {
+        return std::make_unique<AvgState<RESULT_TYPE>>();
+    }
+
+    static void updateAll(uint8_t* state_, common::ValueVector* input, uint64_t multiplicity,
+        common::InMemOverflowBuffer* /*overflowBuffer*/) {
+        auto* state = reinterpret_cast<AvgState<RESULT_TYPE>*>(state_);
+        KU_ASSERT(!input->state->isFlat());
+        input->forEachNonNull(
+            [&](auto pos) { updateSingleValue(state, input, pos, multiplicity); });
+    }
+
+    static void updatePos(uint8_t* state_, common::ValueVector* input, uint64_t multiplicity,
+        uint32_t pos, common::InMemOverflowBuffer* /*overflowBuffer*/) {
+        updateSingleValue(reinterpret_cast<AvgState<RESULT_TYPE>*>(state_), input, pos,
+            multiplicity);
+    }
+
+    static void updateSingleValue(AvgState<RESULT_TYPE>* state, common::ValueVector* input,
+        uint32_t pos, uint64_t multiplicity) {
+        INPUT_TYPE val = input->getValue<INPUT_TYPE>(pos);
+        for (auto i = 0u; i < multiplicity; ++i) {
+            if (state->isNull) {
+                state->sum = (RESULT_TYPE)val;
+                state->isNull = false;
+            } else {
+                Add::operation(state->sum, val, state->sum);
+            }
+        }
+        state->count += multiplicity;
+    }
+
+    static void combine(uint8_t* state_, uint8_t* otherState_,
+        common::InMemOverflowBuffer* /*overflowBuffer*/) {
+        auto* otherState = reinterpret_cast<AvgState<RESULT_TYPE>*>(otherState_);
+        if (otherState->isNull) {
+            return;
+        }
+        auto* state = reinterpret_cast<AvgState<RESULT_TYPE>*>(state_);
+        if (state->isNull) {
+            state->sum = otherState->sum;
+            state->isNull = false;
+        } else {
+            Add::operation(state->sum, otherState->sum, state->sum);
+        }
+        state->count = state->count + otherState->count;
+    }
+
+    static void finalize(uint8_t* state_) {
+        auto* state = reinterpret_cast<AvgState<RESULT_TYPE>*>(state_);
+        state->finalize();
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/base_count.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/base_count.h
new file mode 100644
index 0000000000..0cf99be70e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/base_count.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include "function/aggregate_function.h"
+
+namespace lbug {
+namespace function {
+
+struct BaseCountFunction {
+
+    struct CountState : public AggregateState {
+        inline uint32_t getStateSize() const override { return sizeof(*this); }
+        inline void writeToVector(common::ValueVector* outputVector, uint64_t pos) override {
+            memcpy(outputVector->getData() + pos * outputVector->getNumBytesPerValue(),
+                reinterpret_cast<uint8_t*>(&count), outputVector->getNumBytesPerValue());
+        }
+
+        uint64_t count = 0;
+    };
+
+    static std::unique_ptr<AggregateState> initialize() {
+        auto state = std::make_unique<CountState>();
+        return state;
+    }
+
+    static void combine(uint8_t* state_, uint8_t* otherState_,
+        common::InMemOverflowBuffer* /*overflowBuffer*/) {
+        auto state = reinterpret_cast<CountState*>(state_);
+        auto otherState = reinterpret_cast<CountState*>(otherState_);
+        state->count += otherState->count;
+    }
+
+    static void finalize(uint8_t* /*state_*/) {}
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/count.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/count.h
new file mode 100644
index 0000000000..b65d80ba4d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/count.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "base_count.h"
+
+namespace lbug {
+namespace function {
+
+struct CountFunction : public BaseCountFunction {
+    static constexpr const char* name = "COUNT";
+
+    static void updateAll(uint8_t* state_, common::ValueVector* input, uint64_t multiplicity,
+        common::InMemOverflowBuffer* overflowBuffer);
+
+    // NOLINTNEXTLINE(readability-non-const-parameter): Would cast away qualifiers.
+    static inline void updatePos(uint8_t* state_, common::ValueVector* /*input*/,
+        uint64_t multiplicity, uint32_t /*pos*/, common::InMemOverflowBuffer* /*overflowBuffer*/) {
+        reinterpret_cast<CountState*>(state_)->count += multiplicity;
+    }
+
+    static void paramRewriteFunc(binder::expression_vector& arguments);
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/count_star.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/count_star.h
new file mode 100644
index 0000000000..194800d6be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/count_star.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "base_count.h"
+
+namespace lbug {
+namespace function {
+
+struct CountStarFunction : public BaseCountFunction {
+    static constexpr const char* name = "COUNT_STAR";
+
+    static void updateAll(uint8_t* state_, common::ValueVector* input, uint64_t multiplicity,
+        common::InMemOverflowBuffer* /*overflowBuffer*/);
+
+    static void updatePos(uint8_t* state_, common::ValueVector* input, uint64_t multiplicity,
+        uint32_t /*pos*/, common::InMemOverflowBuffer* /*overflowBuffer*/);
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/min_max.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/min_max.h
new file mode 100644
index 0000000000..2b4315c4e7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/min_max.h
@@ -0,0 +1,92 @@
+#pragma once
+
+#include "common/in_mem_overflow_buffer.h"
+#include "function/aggregate_function.h"
+
+namespace lbug {
+namespace function {
+
+template<typename T>
+struct MinMaxFunction {
+
+    struct MinMaxState : public AggregateStateWithNull {
+        uint32_t getStateSize() const override { return sizeof(*this); }
+        void writeToVector(common::ValueVector* outputVector, uint64_t pos) override {
+            outputVector->setValue(pos, val);
+        }
+        void setVal(const T& val_, common::InMemOverflowBuffer* /*overflowBuffer*/) { val = val_; }
+
+        T val{};
+    };
+
+    static std::unique_ptr<AggregateState> initialize() { return std::make_unique<MinMaxState>(); }
+
+    template<class OP>
+    static void updateAll(uint8_t* state_, common::ValueVector* input, uint64_t /*multiplicity*/,
+        common::InMemOverflowBuffer* overflowBuffer) {
+        KU_ASSERT(!input->state->isFlat());
+        auto* state = reinterpret_cast<MinMaxState*>(state_);
+        input->forEachNonNull(
+            [&](auto pos) { updateSingleValue<OP>(state, input, pos, overflowBuffer); });
+    }
+
+    template<class OP>
+    static inline void updatePos(uint8_t* state_, common::ValueVector* input,
+        uint64_t /*multiplicity*/, uint32_t pos, common::InMemOverflowBuffer* overflowBuffer) {
+        updateSingleValue<OP>(reinterpret_cast<MinMaxState*>(state_), input, pos, overflowBuffer);
+    }
+
+    template<class OP>
+    static void updateSingleValue(MinMaxState* state, common::ValueVector* input, uint32_t pos,
+        common::InMemOverflowBuffer* overflowBuffer) {
+        T val = input->getValue<T>(pos);
+        if (state->isNull) {
+            state->setVal(val, overflowBuffer);
+            state->isNull = false;
+        } else {
+            uint8_t compare_result = 0;
+            OP::template operation<T, T>(val, state->val, compare_result, nullptr /* leftVector */,
+                nullptr /* rightVector */);
+            if (compare_result) {
+                state->setVal(val, overflowBuffer);
+            }
+        }
+    }
+
+    template<class OP>
+    static void combine(uint8_t* state_, uint8_t* otherState_,
+        common::InMemOverflowBuffer* overflowBuffer) {
+        auto* otherState = reinterpret_cast<MinMaxState*>(otherState_);
+        if (otherState->isNull) {
+            return;
+        }
+        auto* state = reinterpret_cast<MinMaxState*>(state_);
+        if (state->isNull) {
+            state->setVal(otherState->val, overflowBuffer);
+            state->isNull = false;
+        } else {
+            uint8_t compareResult = 0;
+            OP::template operation<T, T>(otherState->val, state->val, compareResult,
+                nullptr /* leftVector */, nullptr /* rightVector */);
+            if (compareResult) {
+                state->setVal(otherState->val, overflowBuffer);
+            }
+        }
+    }
+
+    static void finalize(uint8_t* /*state_*/) {}
+};
+
+template<>
+void MinMaxFunction<common::ku_string_t>::MinMaxState::setVal(const common::ku_string_t& val_,
+    common::InMemOverflowBuffer* overflowBuffer) {
+    // We only need to allocate memory if the new val_ is a long string and is longer
+    // than the current val.
+    if (val_.len > common::ku_string_t::SHORT_STR_LENGTH && val_.len > val.len) {
+        val.overflowPtr = reinterpret_cast<uint64_t>(overflowBuffer->allocateSpace(val_.len));
+    }
+    val.set(val_);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/sum.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/sum.h
new file mode 100644
index 0000000000..a0e1694ab5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate/sum.h
@@ -0,0 +1,71 @@
+#pragma once
+
+#include "function/aggregate_function.h"
+#include "function/arithmetic/add.h"
+
+namespace lbug {
+namespace function {
+
+template<typename RESULT_TYPE>
+struct SumState : public AggregateStateWithNull {
+    uint32_t getStateSize() const override { return sizeof(*this); }
+    void writeToVector(common::ValueVector* outputVector, uint64_t pos) override {
+        outputVector->setValue(pos, sum);
+    }
+
+    RESULT_TYPE sum{};
+};
+
+template<typename INPUT_TYPE, typename RESULT_TYPE>
+struct SumFunction {
+    static std::unique_ptr<AggregateState> initialize() {
+        return std::make_unique<SumState<RESULT_TYPE>>();
+    }
+
+    static void updateAll(uint8_t* state_, common::ValueVector* input, uint64_t multiplicity,
+        common::InMemOverflowBuffer* /*overflowBuffer*/) {
+        KU_ASSERT(!input->state->isFlat());
+        auto* state = reinterpret_cast<SumState<RESULT_TYPE>*>(state_);
+        input->forEachNonNull(
+            [&](auto pos) { updateSingleValue(state, input, pos, multiplicity); });
+    }
+
+    static void updatePos(uint8_t* state_, common::ValueVector* input, uint64_t multiplicity,
+        uint32_t pos, common::InMemOverflowBuffer* /*overflowBuffer*/) {
+        auto* state = reinterpret_cast<SumState<RESULT_TYPE>*>(state_);
+        updateSingleValue(state, input, pos, multiplicity);
+    }
+
+    static void updateSingleValue(SumState<RESULT_TYPE>* state, common::ValueVector* input,
+        uint32_t pos, uint64_t multiplicity) {
+        INPUT_TYPE val = input->getValue<INPUT_TYPE>(pos);
+        for (auto j = 0u; j < multiplicity; ++j) {
+            if (state->isNull) {
+                state->sum = val;
+                state->isNull = false;
+            } else {
+                Add::operation(state->sum, val, state->sum);
+            }
+        }
+    }
+
+    static void combine(uint8_t* state_, uint8_t* otherState_,
+        common::InMemOverflowBuffer* /*overflowBuffer*/) {
+        auto* otherState = reinterpret_cast<SumState<RESULT_TYPE>*>(otherState_);
+        if (otherState->isNull) {
+            return;
+        }
+        auto* state = reinterpret_cast<SumState<RESULT_TYPE>*>(state_);
+        if (state->isNull) {
+            state->sum = otherState->sum;
+            state->isNull = false;
+        } else {
+            Add::operation(state->sum, otherState->sum, state->sum);
+        }
+    }
+
+    static void finalize(uint8_t* /*state_*/) {}
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate_function.h
new file mode 100644
index 0000000000..5479240a26
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/aggregate_function.h
@@ -0,0 +1,146 @@
+#pragma once
+
+#include <functional>
+#include <utility>
+
+#include "common/in_mem_overflow_buffer.h"
+#include "common/vector/value_vector.h"
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct AggregateState {
+    virtual uint32_t getStateSize() const = 0;
+    virtual void writeToVector(common::ValueVector* outputVector, uint64_t pos) = 0;
+    virtual ~AggregateState() = default;
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+struct AggregateStateWithNull : public AggregateState {
+    bool isNull = true;
+};
+
+using param_rewrite_function_t = std::function<void(binder::expression_vector&)>;
+using aggr_initialize_function_t = std::function<std::unique_ptr<AggregateState>()>;
+using aggr_update_all_function_t = std::function<void(uint8_t* state, common::ValueVector* input,
+    uint64_t multiplicity, common::InMemOverflowBuffer* overflowBuffer)>;
+using aggr_update_pos_function_t = std::function<void(uint8_t* state, common::ValueVector* input,
+    uint64_t multiplicity, uint32_t pos, common::InMemOverflowBuffer* overflowBuffer)>;
+using aggr_combine_function_t = std::function<void(uint8_t* state, uint8_t* otherState,
+    common::InMemOverflowBuffer* overflowBuffer)>;
+using aggr_finalize_function_t = std::function<void(uint8_t* state)>;
+
+struct AggregateFunction final : public ScalarOrAggregateFunction {
+    bool isDistinct;
+    bool needToHandleNulls = false;
+    aggr_initialize_function_t initializeFunc;
+    aggr_update_all_function_t updateAllFunc;
+    aggr_update_pos_function_t updatePosFunc;
+    aggr_combine_function_t combineFunc;
+    aggr_finalize_function_t finalizeFunc;
+    std::unique_ptr<AggregateState> initialNullAggregateState;
+    // Rewrite aggregate on NODE/REL, e.g. COUNT(a) -> COUNT(a._id)
+    param_rewrite_function_t paramRewriteFunc;
+
+    AggregateFunction(std::string name, std::vector<common::LogicalTypeID> parameterTypeIDs,
+        common::LogicalTypeID returnTypeID, aggr_initialize_function_t initializeFunc,
+        aggr_update_all_function_t updateAllFunc, aggr_update_pos_function_t updatePosFunc,
+        aggr_combine_function_t combineFunc, aggr_finalize_function_t finalizeFunc, bool isDistinct,
+        scalar_bind_func bindFunc = nullptr, param_rewrite_function_t paramRewriteFunc = nullptr)
+        : ScalarOrAggregateFunction{std::move(name), std::move(parameterTypeIDs), returnTypeID,
+              std::move(bindFunc)},
+          isDistinct{isDistinct}, initializeFunc{std::move(initializeFunc)},
+          updateAllFunc{std::move(updateAllFunc)}, updatePosFunc{std::move(updatePosFunc)},
+          combineFunc{std::move(combineFunc)}, finalizeFunc{std::move(finalizeFunc)},
+          paramRewriteFunc{std::move(paramRewriteFunc)} {
+        initialNullAggregateState = createInitialNullAggregateState();
+    }
+
+    EXPLICIT_COPY_DEFAULT_MOVE(AggregateFunction);
+
+    common::idx_t getAggregateStateSize() const {
+        return initialNullAggregateState->getStateSize();
+    }
+
+    // NOLINTNEXTLINE(readability-make-member-function-const): Returns a non-const pointer.
+    AggregateState* getInitialNullAggregateState() { return initialNullAggregateState.get(); }
+
+    std::unique_ptr<AggregateState> createInitialNullAggregateState() const {
+        return initializeFunc();
+    }
+
+    void updateAllState(uint8_t* state, common::ValueVector* input, uint64_t multiplicity,
+        common::InMemOverflowBuffer* overflowBuffer) const {
+        return updateAllFunc(state, input, multiplicity, overflowBuffer);
+    }
+
+    void updatePosState(uint8_t* state, common::ValueVector* input, uint64_t multiplicity,
+        uint32_t pos, common::InMemOverflowBuffer* overflowBuffer) const {
+        return updatePosFunc(state, input, multiplicity, pos, overflowBuffer);
+    }
+
+    void combineState(uint8_t* state, uint8_t* otherState,
+        common::InMemOverflowBuffer* overflowBuffer) const {
+        return combineFunc(state, otherState, overflowBuffer);
+    }
+
+    void finalizeState(uint8_t* state) const { return finalizeFunc(state); }
+
+    bool isFunctionDistinct() const { return isDistinct; }
+
+private:
+    AggregateFunction(const AggregateFunction& other);
+};
+
+struct AggregateFunctionUtils {
+    template<typename T>
+    static std::unique_ptr<AggregateFunction> getAggFunc(std::string name,
+        common::LogicalTypeID inputType, common::LogicalTypeID resultType, bool isDistinct,
+        param_rewrite_function_t paramRewriteFunc = nullptr) {
+        return std::make_unique<AggregateFunction>(std::move(name),
+            std::vector<common::LogicalTypeID>{inputType}, resultType, T::initialize, T::updateAll,
+            T::updatePos, T::combine, T::finalize, isDistinct, nullptr /* bindFunc */,
+            paramRewriteFunc);
+    }
+
+    template<template<typename, typename> class FunctionType>
+    static void appendSumOrAvgFuncs(std::string name, common::LogicalTypeID inputType,
+        function_set& result);
+};
+
+struct AggregateSumFunction {
+    static constexpr const char* name = "SUM";
+
+    static function_set getFunctionSet();
+};
+
+struct AggregateAvgFunction {
+    static constexpr const char* name = "AVG";
+
+    static function_set getFunctionSet();
+};
+
+struct AggregateMinFunction {
+    static constexpr const char* name = "MIN";
+
+    static function_set getFunctionSet();
+};
+
+struct AggregateMaxFunction {
+    static constexpr const char* name = "MAX";
+
+    static function_set getFunctionSet();
+};
+
+struct CollectFunction {
+    static constexpr const char* name = "COLLECT";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/abs.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/abs.h
new file mode 100644
index 0000000000..8f3aef62bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/abs.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include <cstdint>
+
+#include "common/types/int128_t.h"
+#include "common/types/types.h"
+#include "common/types/uint128_t.h"
+
+namespace lbug {
+namespace function {
+
+struct Abs {
+    template<class T>
+    static inline void operation(T& input, T& result) {
+        if constexpr (common::UnsignedIntegerTypes<T>) {
+            result = input;
+        } else {
+            result = std::abs(input);
+        }
+    }
+};
+
+template<>
+void Abs::operation(int8_t& input, int8_t& result);
+
+template<>
+void Abs::operation(int16_t& input, int16_t& result);
+
+template<>
+void Abs::operation(int32_t& input, int32_t& result);
+
+template<>
+void Abs::operation(int64_t& input, int64_t& result);
+
+template<>
+void Abs::operation(common::int128_t& input, common::int128_t& result);
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/add.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/add.h
new file mode 100644
index 0000000000..51300ebb7f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/add.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace function {
+
+struct Add {
+    template<class A, class B, class R>
+    static inline void operation(A& left, B& right, R& result) {
+        result = left + right;
+    }
+};
+
+template<>
+void Add::operation(uint8_t& left, uint8_t& right, uint8_t& result);
+
+template<>
+void Add::operation(uint16_t& left, uint16_t& right, uint16_t& result);
+
+template<>
+void Add::operation(uint32_t& left, uint32_t& right, uint32_t& result);
+
+template<>
+void Add::operation(uint64_t& left, uint64_t& right, uint64_t& result);
+
+template<>
+void Add::operation(int8_t& left, int8_t& right, int8_t& result);
+
+template<>
+void Add::operation(int16_t& left, int16_t& right, int16_t& result);
+
+template<>
+void Add::operation(int32_t& left, int32_t& right, int32_t& result);
+
+template<>
+void Add::operation(int64_t& left, int64_t& right, int64_t& result);
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/arithmetic_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/arithmetic_functions.h
new file mode 100644
index 0000000000..47301ea7cc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/arithmetic_functions.h
@@ -0,0 +1,245 @@
+#pragma once
+
+#include <cmath>
+
+#include "common/types/int128_t.h"
+#include "common/types/uint128_t.h"
+
+namespace lbug {
+namespace function {
+
+struct Power {
+    template<class A, class B, class R>
+    static inline void operation(A& left, B& right, R& result) {
+        result = pow(left, right);
+    }
+};
+
+struct Floor {
+    template<class T>
+    static inline void operation(T& input, T& result) {
+        result = floor(input);
+    }
+};
+
+template<>
+inline void Floor::operation(common::int128_t& input, common::int128_t& result) {
+    result = input;
+}
+
+template<>
+inline void Floor::operation(common::uint128_t& input, common::uint128_t& result) {
+    result = input;
+}
+
+struct Ceil {
+    template<class T>
+    static inline void operation(T& input, T& result) {
+        result = ceil(input);
+    }
+};
+
+template<>
+inline void Ceil::operation(common::int128_t& input, common::int128_t& result) {
+    result = input;
+}
+
+template<>
+inline void Ceil::operation(common::uint128_t& input, common::uint128_t& result) {
+    result = input;
+}
+
+struct Sin {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = sin(input);
+    }
+};
+
+struct Cos {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = cos(input);
+    }
+};
+
+struct Tan {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = tan(input);
+    }
+};
+
+struct Cot {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        double tanValue = 0;
+        Tan::operation(input, tanValue);
+        result = 1 / tanValue;
+    }
+};
+
+struct Asin {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = asin(input);
+    }
+};
+
+struct Acos {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = acos(input);
+    }
+};
+
+struct Atan {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = atan(input);
+    }
+};
+
+struct Even {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = input >= 0 ? ceil(input) : floor(input);
+        // Note: c++ doesn't support double % integer, so we have to use the following code to check
+        // whether result is odd or even.
+        if (std::floor(result / 2) * 2 != result) {
+            result += (input >= 0 ? 1 : -1);
+        }
+    }
+};
+
+struct Factorial {
+    static inline void operation(int64_t& input, int64_t& result) {
+        result = 1;
+        for (int64_t i = 2; i <= input; i++) {
+            result *= i;
+        }
+    }
+};
+
+struct Sign {
+    template<class T>
+    static inline void operation(T& input, int64_t& result) {
+        result = (input > 0) - (input < 0);
+    }
+};
+
+struct Sqrt {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = sqrt(input);
+    }
+};
+
+struct Cbrt {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = cbrt(input);
+    }
+};
+
+struct Gamma {
+    template<class T>
+    static inline void operation(T& input, T& result) {
+        result = tgamma(input);
+    }
+};
+
+struct Lgamma {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result =
+            lgamma(input); // NOLINT(concurrency-mt-unsafe): We don't use the thread-unsafe signgam.
+    }
+};
+
+struct Ln {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = log(input);
+    }
+};
+
+struct Log {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = log10(input);
+    }
+};
+
+struct Log2 {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = log2(input);
+    }
+};
+
+struct Degrees {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = input * 180 / M_PI;
+    }
+};
+
+struct Radians {
+    template<class T>
+    static inline void operation(T& input, double& result) {
+        result = input * M_PI / 180;
+    }
+};
+
+struct Atan2 {
+    template<class A, class B>
+    static inline void operation(A& left, B& right, double& result) {
+        result = atan2(left, right);
+    }
+};
+
+struct Round {
+    template<class A, class B>
+    static inline void operation(A& left, B& right, double& result) {
+        auto multiplier = pow(10, right);
+        result = round(left * multiplier) / multiplier;
+    }
+};
+
+struct BitwiseXor {
+    static inline void operation(int64_t& left, int64_t& right, int64_t& result) {
+        result = left ^ right;
+    }
+};
+
+struct BitwiseAnd {
+    static inline void operation(int64_t& left, int64_t& right, int64_t& result) {
+        result = left & right;
+    }
+};
+
+struct BitwiseOr {
+    static inline void operation(int64_t& left, int64_t& right, int64_t& result) {
+        result = left | right;
+    }
+};
+
+struct BitShiftLeft {
+    static inline void operation(int64_t& left, int64_t& right, int64_t& result) {
+        result = left << right;
+    }
+};
+
+struct BitShiftRight {
+    static inline void operation(int64_t& left, int64_t& right, int64_t& result) {
+        result = left >> right;
+    }
+};
+
+struct Pi {
+    static inline void operation(double& result) { result = M_PI; }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/divide.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/divide.h
new file mode 100644
index 0000000000..19111004f8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/divide.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace function {
+
+struct Divide {
+    template<class A, class B, class R>
+    static inline void operation(A& left, B& right, R& result) {
+        result = left / right;
+    }
+};
+
+template<>
+void Divide::operation(uint8_t& left, uint8_t& right, uint8_t& result);
+
+template<>
+void Divide::operation(uint16_t& left, uint16_t& right, uint16_t& result);
+
+template<>
+void Divide::operation(uint32_t& left, uint32_t& right, uint32_t& result);
+
+template<>
+void Divide::operation(uint64_t& left, uint64_t& right, uint64_t& result);
+
+template<>
+void Divide::operation(int8_t& left, int8_t& right, int8_t& result);
+
+template<>
+void Divide::operation(int16_t& left, int16_t& right, int16_t& result);
+
+template<>
+void Divide::operation(int32_t& left, int32_t& right, int32_t& result);
+
+template<>
+void Divide::operation(int64_t& left, int64_t& right, int64_t& result);
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/modulo.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/modulo.h
new file mode 100644
index 0000000000..0595c9304d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/modulo.h
@@ -0,0 +1,50 @@
+#pragma once
+
+#include <cstdint>
+
+#include "common/types/int128_t.h"
+#include "common/types/uint128_t.h"
+
+namespace lbug {
+namespace function {
+
+struct Modulo {
+    template<class A, class B, class R>
+    static inline void operation(A& left, B& right, R& result) {
+        result = fmod(left, right);
+    }
+};
+
+template<>
+void Modulo::operation(uint8_t& left, uint8_t& right, uint8_t& result);
+
+template<>
+void Modulo::operation(uint16_t& left, uint16_t& right, uint16_t& result);
+
+template<>
+void Modulo::operation(uint32_t& left, uint32_t& right, uint32_t& result);
+
+template<>
+void Modulo::operation(uint64_t& left, uint64_t& right, uint64_t& result);
+
+template<>
+void Modulo::operation(int8_t& left, int8_t& right, int8_t& result);
+
+template<>
+void Modulo::operation(int16_t& left, int16_t& right, int16_t& result);
+
+template<>
+void Modulo::operation(int32_t& left, int32_t& right, int32_t& result);
+
+template<>
+void Modulo::operation(int64_t& left, int64_t& right, int64_t& result);
+
+template<>
+void Modulo::operation(common::int128_t& left, common::int128_t& right, common::int128_t& result);
+
+template<>
+void Modulo::operation(common::uint128_t& left, common::uint128_t& right,
+    common::uint128_t& result);
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/multiply.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/multiply.h
new file mode 100644
index 0000000000..4062be69d3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/multiply.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace function {
+
+struct Multiply {
+    template<class A, class B, class R>
+    static inline void operation(A& left, B& right, R& result) {
+        result = left * right;
+    }
+};
+
+template<>
+void Multiply::operation(uint8_t& left, uint8_t& right, uint8_t& result);
+
+template<>
+void Multiply::operation(uint16_t& left, uint16_t& right, uint16_t& result);
+
+template<>
+void Multiply::operation(uint32_t& left, uint32_t& right, uint32_t& result);
+
+template<>
+void Multiply::operation(uint64_t& left, uint64_t& right, uint64_t& result);
+
+template<>
+void Multiply::operation(int8_t& left, int8_t& right, int8_t& result);
+
+template<>
+void Multiply::operation(int16_t& left, int16_t& right, int16_t& result);
+
+template<>
+void Multiply::operation(int32_t& left, int32_t& right, int32_t& result);
+
+template<>
+void Multiply::operation(int64_t& left, int64_t& right, int64_t& result);
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/negate.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/negate.h
new file mode 100644
index 0000000000..cc2d55cc7b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/negate.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace function {
+
+struct Negate {
+    template<class T>
+    static inline void operation(T& input, T& result) {
+        result = -input;
+    }
+};
+
+template<>
+void Negate::operation(int8_t& input, int8_t& result);
+
+template<>
+void Negate::operation(int16_t& input, int16_t& result);
+
+template<>
+void Negate::operation(int32_t& input, int32_t& result);
+
+template<>
+void Negate::operation(int64_t& input, int64_t& result);
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/subtract.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/subtract.h
new file mode 100644
index 0000000000..1fff6a2197
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/subtract.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace function {
+
+struct Subtract {
+    template<class A, class B, class R>
+    static inline void operation(A& left, B& right, R& result) {
+        result = left - right;
+    }
+};
+
+template<>
+void Subtract::operation(uint8_t& left, uint8_t& right, uint8_t& result);
+
+template<>
+void Subtract::operation(uint16_t& left, uint16_t& right, uint16_t& result);
+
+template<>
+void Subtract::operation(uint32_t& left, uint32_t& right, uint32_t& result);
+
+template<>
+void Subtract::operation(uint64_t& left, uint64_t& right, uint64_t& result);
+
+template<>
+void Subtract::operation(int8_t& left, int8_t& right, int8_t& result);
+
+template<>
+void Subtract::operation(int16_t& left, int16_t& right, int16_t& result);
+
+template<>
+void Subtract::operation(int32_t& left, int32_t& right, int32_t& result);
+
+template<>
+void Subtract::operation(int64_t& left, int64_t& right, int64_t& result);
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/vector_arithmetic_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/vector_arithmetic_functions.h
new file mode 100644
index 0000000000..3a7d2f1d8c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/arithmetic/vector_arithmetic_functions.h
@@ -0,0 +1,263 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct AddFunction {
+    static constexpr const char* name = "+";
+
+    static function_set getFunctionSet();
+};
+
+struct SubtractFunction {
+    static constexpr const char* name = "-";
+
+    static function_set getFunctionSet();
+};
+
+struct MultiplyFunction {
+    static constexpr const char* name = "*";
+
+    static function_set getFunctionSet();
+};
+
+struct DivideFunction {
+    static constexpr const char* name = "/";
+
+    static function_set getFunctionSet();
+};
+
+struct ModuloFunction {
+    static constexpr const char* name = "%";
+
+    static function_set getFunctionSet();
+};
+
+struct PowerFunction {
+    static constexpr const char* name = "^";
+
+    static function_set getFunctionSet();
+};
+
+struct PowFunction {
+    using alias = PowerFunction;
+
+    static constexpr const char* name = "POW";
+};
+
+struct AbsFunction {
+    static constexpr const char* name = "ABS";
+
+    static function_set getFunctionSet();
+};
+
+struct AcosFunction {
+    static constexpr const char* name = "ACOS";
+
+    static function_set getFunctionSet();
+};
+
+struct AsinFunction {
+    static constexpr const char* name = "ASIN";
+
+    static function_set getFunctionSet();
+};
+
+struct AtanFunction {
+    static constexpr const char* name = "ATAN";
+
+    static function_set getFunctionSet();
+};
+
+struct Atan2Function {
+    static constexpr const char* name = "ATAN2";
+
+    static function_set getFunctionSet();
+};
+
+struct BitwiseXorFunction {
+    static constexpr const char* name = "BITWISE_XOR";
+
+    static function_set getFunctionSet();
+};
+
+struct BitwiseAndFunction {
+    static constexpr const char* name = "BITWISE_AND";
+
+    static function_set getFunctionSet();
+};
+
+struct BitwiseOrFunction {
+    static constexpr const char* name = "BITWISE_OR";
+
+    static function_set getFunctionSet();
+};
+
+struct BitShiftLeftFunction {
+    static constexpr const char* name = "BITSHIFT_LEFT";
+
+    static function_set getFunctionSet();
+};
+
+struct BitShiftRightFunction {
+    static constexpr const char* name = "BITSHIFT_RIGHT";
+
+    static function_set getFunctionSet();
+};
+
+struct CbrtFunction {
+    static constexpr const char* name = "CBRT";
+
+    static function_set getFunctionSet();
+};
+
+struct CeilFunction {
+    static constexpr const char* name = "CEIL";
+
+    static function_set getFunctionSet();
+};
+
+struct CeilingFunction {
+    using alias = CeilFunction;
+
+    static constexpr const char* name = "CEILING";
+};
+
+struct CosFunction {
+    static constexpr const char* name = "COS";
+
+    static function_set getFunctionSet();
+};
+
+struct CotFunction {
+    static constexpr const char* name = "COT";
+
+    static function_set getFunctionSet();
+};
+
+struct DegreesFunction {
+    static constexpr const char* name = "DEGREES";
+
+    static function_set getFunctionSet();
+};
+
+struct EvenFunction {
+    static constexpr const char* name = "EVEN";
+
+    static function_set getFunctionSet();
+};
+
+struct FactorialFunction {
+    static constexpr const char* name = "FACTORIAL";
+
+    static function_set getFunctionSet();
+};
+
+struct FloorFunction {
+    static constexpr const char* name = "FLOOR";
+
+    static function_set getFunctionSet();
+};
+
+struct GammaFunction {
+    static constexpr const char* name = "GAMMA";
+
+    static function_set getFunctionSet();
+};
+
+struct LgammaFunction {
+    static constexpr const char* name = "LGAMMA";
+
+    static function_set getFunctionSet();
+};
+
+struct LnFunction {
+    static constexpr const char* name = "LN";
+
+    static function_set getFunctionSet();
+};
+
+struct LogFunction {
+    static constexpr const char* name = "LOG";
+
+    static constexpr const char* alias = "LOG10";
+
+    static function_set getFunctionSet();
+};
+
+struct Log10Function {
+    using alias = LogFunction;
+
+    static constexpr const char* name = "LOG10";
+};
+
+struct Log2Function {
+    static constexpr const char* name = "LOG2";
+
+    static function_set getFunctionSet();
+};
+
+struct NegateFunction {
+    static constexpr const char* name = "NEGATE";
+
+    static function_set getFunctionSet();
+};
+
+struct PiFunction {
+    static constexpr const char* name = "PI";
+
+    static function_set getFunctionSet();
+};
+
+struct RandFunction {
+    static constexpr const char* name = "RANDOM";
+
+    static function_set getFunctionSet();
+};
+
+struct SetSeedFunction {
+    static constexpr const char* name = "SETSEED";
+
+    static function_set getFunctionSet();
+};
+
+struct RadiansFunction {
+    static constexpr const char* name = "RADIANS";
+
+    static function_set getFunctionSet();
+};
+
+struct RoundFunction {
+    static constexpr const char* name = "ROUND";
+
+    static function_set getFunctionSet();
+};
+
+struct SinFunction {
+    static constexpr const char* name = "SIN";
+
+    static function_set getFunctionSet();
+};
+
+struct SignFunction {
+    static constexpr const char* name = "SIGN";
+
+    static function_set getFunctionSet();
+};
+
+struct SqrtFunction {
+    static constexpr const char* name = "SQRT";
+
+    static function_set getFunctionSet();
+};
+
+struct TanFunction {
+    static constexpr const char* name = "TAN";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_cosine_similarity.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_cosine_similarity.h
new file mode 100644
index 0000000000..849546efdc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_cosine_similarity.h
@@ -0,0 +1,31 @@
+#pragma once
+
+#include "math.h"
+
+#include "common/vector/value_vector.h"
+#include <simsimd.h>
+
+namespace lbug {
+namespace function {
+
+struct ArrayCosineSimilarity {
+    template<std::floating_point T>
+    static inline void operation(common::list_entry_t& left, common::list_entry_t& right, T& result,
+        common::ValueVector& leftVector, common::ValueVector& rightVector,
+        common::ValueVector& /*resultVector*/) {
+        auto leftElements = (T*)common::ListVector::getListValues(&leftVector, left);
+        auto rightElements = (T*)common::ListVector::getListValues(&rightVector, right);
+        KU_ASSERT(left.size == right.size);
+        simsimd_distance_t tmpResult = 0.0;
+        static_assert(std::is_same_v<T, float> || std::is_same_v<T, double>);
+        if constexpr (std::is_same_v<T, float>) {
+            simsimd_cos_f32(leftElements, rightElements, left.size, &tmpResult);
+        } else {
+            simsimd_cos_f64(leftElements, rightElements, left.size, &tmpResult);
+        }
+        result = 1.0 - tmpResult;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_cross_product.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_cross_product.h
new file mode 100644
index 0000000000..7536ebc6d4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_cross_product.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+template<typename T>
+struct ArrayCrossProduct {
+    static inline void operation(common::list_entry_t& left, common::list_entry_t& right,
+        common::list_entry_t& result, common::ValueVector& leftVector,
+        common::ValueVector& rightVector, common::ValueVector& resultVector) {
+        auto leftElements = (T*)common::ListVector::getListValues(&leftVector, left);
+        auto rightElements = (T*)common::ListVector::getListValues(&rightVector, right);
+        result = common::ListVector::addList(&resultVector, left.size);
+        auto resultElements = (T*)common::ListVector::getListValues(&resultVector, result);
+        resultElements[0] = leftElements[1] * rightElements[2] - leftElements[2] * rightElements[1];
+        resultElements[1] = leftElements[2] * rightElements[0] - leftElements[0] * rightElements[2];
+        resultElements[2] = leftElements[0] * rightElements[1] - leftElements[1] * rightElements[0];
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_distance.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_distance.h
new file mode 100644
index 0000000000..88af4c5722
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_distance.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "math.h"
+
+#include "common/vector/value_vector.h"
+#include "function/array/functions/array_squared_distance.h"
+
+namespace lbug {
+namespace function {
+
+// Euclidean distance between two arrays.
+struct ArrayDistance {
+    template<std::floating_point T>
+    static inline void operation(common::list_entry_t& left, common::list_entry_t& right, T& result,
+        common::ValueVector& leftVector, common::ValueVector& rightVector,
+        common::ValueVector& resultVector) {
+        ArraySquaredDistance::operation(left, right, result, leftVector, rightVector, resultVector);
+        result = std::sqrt(result);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_inner_product.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_inner_product.h
new file mode 100644
index 0000000000..0649320f23
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_inner_product.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+#include <simsimd.h>
+
+namespace lbug {
+namespace function {
+
+struct ArrayInnerProduct {
+    template<std::floating_point T>
+    static inline void operation(common::list_entry_t& left, common::list_entry_t& right, T& result,
+        common::ValueVector& leftVector, common::ValueVector& rightVector,
+        common::ValueVector& /*resultVector*/) {
+        auto leftElements = (T*)common::ListVector::getListValues(&leftVector, left);
+        auto rightElements = (T*)common::ListVector::getListValues(&rightVector, right);
+        KU_ASSERT(left.size == right.size);
+        simsimd_distance_t tmpResult = 0.0;
+        static_assert(std::is_same_v<T, float> || std::is_same_v<T, double>);
+        if constexpr (std::is_same_v<T, float>) {
+            simsimd_dot_f32(leftElements, rightElements, left.size, &tmpResult);
+        } else {
+            simsimd_dot_f64(leftElements, rightElements, left.size, &tmpResult);
+        }
+        result = tmpResult;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_squared_distance.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_squared_distance.h
new file mode 100644
index 0000000000..c4afd310bc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/functions/array_squared_distance.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+#include <simsimd.h>
+
+namespace lbug {
+namespace function {
+
+struct ArraySquaredDistance {
+    template<std::floating_point T>
+    static inline void operation(common::list_entry_t& left, common::list_entry_t& right, T& result,
+        common::ValueVector& leftVector, common::ValueVector& rightVector,
+        common::ValueVector& /*resultVector*/) {
+        auto leftElements = (T*)common::ListVector::getListValues(&leftVector, left);
+        auto rightElements = (T*)common::ListVector::getListValues(&rightVector, right);
+        KU_ASSERT(left.size == right.size);
+        simsimd_distance_t tmpResult = 0.0;
+        static_assert(std::is_same_v<T, float> || std::is_same_v<T, double>);
+        if constexpr (std::is_same_v<T, float>) {
+            simsimd_l2sq_f32(leftElements, rightElements, left.size, &tmpResult);
+        } else {
+            simsimd_l2sq_f64(leftElements, rightElements, left.size, &tmpResult);
+        }
+        result = tmpResult;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/vector_array_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/vector_array_functions.h
new file mode 100644
index 0000000000..5e8aa1b8d0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/array/vector_array_functions.h
@@ -0,0 +1,106 @@
+#pragma once
+
+#include "function/function.h"
+#include "function/list/vector_list_functions.h"
+
+namespace lbug {
+namespace function {
+
+struct ArrayValueFunction {
+    static constexpr const char* name = "ARRAY_VALUE";
+
+    static function_set getFunctionSet();
+};
+
+struct ArrayCrossProductFunction {
+    static constexpr const char* name = "ARRAY_CROSS_PRODUCT";
+
+    static function_set getFunctionSet();
+};
+
+struct ArrayCosineSimilarityFunction {
+    static constexpr const char* name = "ARRAY_COSINE_SIMILARITY";
+
+    static function_set getFunctionSet();
+};
+
+struct ArrayDistanceFunction {
+    static constexpr const char* name = "ARRAY_DISTANCE";
+
+    static function_set getFunctionSet();
+};
+
+struct ArraySquaredDistanceFunction {
+    static constexpr const char* name = "ARRAY_SQUARED_DISTANCE";
+
+    static function_set getFunctionSet();
+};
+
+struct ArrayInnerProductFunction {
+    static constexpr const char* name = "ARRAY_INNER_PRODUCT";
+
+    static function_set getFunctionSet();
+};
+
+struct ArrayDotProductFunction {
+    static constexpr const char* name = "ARRAY_DOT_PRODUCT";
+
+    static function_set getFunctionSet();
+};
+
+struct ArrayConcatFunction : public ListConcatFunction {
+    static constexpr const char* name = "ARRAY_CONCAT";
+};
+
+struct ArrayCatFunction {
+    using alias = ArrayConcatFunction;
+
+    static constexpr const char* name = "ARRAY_CAT";
+};
+
+struct ArrayAppendFunction : public ListAppendFunction {
+    static constexpr const char* name = "ARRAY_APPEND";
+};
+
+struct ArrayPushBackFunction {
+    using alias = ArrayAppendFunction;
+
+    static constexpr const char* name = "ARRAY_PUSH_BACK";
+};
+
+struct ArrayPrependFunction : public ListPrependFunction {
+    static constexpr const char* name = "ARRAY_PREPEND";
+};
+
+struct ArrayPushFrontFunction {
+    using alias = ArrayPrependFunction;
+
+    static constexpr const char* name = "ARRAY_PUSH_FRONT";
+};
+
+struct ArrayPositionFunction : public ListPositionFunction {
+    static constexpr const char* name = "ARRAY_POSITION";
+};
+
+struct ArrayIndexOfFunction {
+    using alias = ArrayPositionFunction;
+
+    static constexpr const char* name = "ARRAY_INDEXOF";
+};
+
+struct ArrayContainsFunction : public ListContainsFunction {
+    static constexpr const char* name = "ARRAY_CONTAINS";
+};
+
+struct ArrayHasFunction {
+    using alias = ArrayContainsFunction;
+
+    static constexpr const char* name = "ARRAY_HAS";
+};
+
+struct ArraySliceFunction : public ListSliceFunction {
+    static constexpr const char* name = "ARRAY_SLICE";
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/binary_function_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/binary_function_executor.h
new file mode 100644
index 0000000000..6a63ce7e88
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/binary_function_executor.h
@@ -0,0 +1,329 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+/**
+ * Binary operator assumes function with null returns null. This does NOT applies to binary boolean
+ * operations (e.g. AND, OR, XOR).
+ */
+
+struct BinaryFunctionWrapper {
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(LEFT_TYPE& left, RIGHT_TYPE& right, RESULT_TYPE& result,
+        common::ValueVector* /*leftValueVector*/, common::ValueVector* /*rightValueVector*/,
+        common::ValueVector* /*resultValueVector*/, uint64_t /*resultPos*/, void* /*dataPtr*/) {
+        OP::operation(left, right, result);
+    }
+};
+
+struct BinaryListStructFunctionWrapper {
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename OP>
+    static void operation(LEFT_TYPE& left, RIGHT_TYPE& right, RESULT_TYPE& result,
+        common::ValueVector* leftValueVector, common::ValueVector* rightValueVector,
+        common::ValueVector* resultValueVector, uint64_t /*resultPos*/, void* /*dataPtr*/) {
+        OP::operation(left, right, result, *leftValueVector, *rightValueVector, *resultValueVector);
+    }
+};
+
+struct BinaryMapCreationFunctionWrapper {
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename OP>
+    static void operation(LEFT_TYPE& left, RIGHT_TYPE& right, RESULT_TYPE& result,
+        common::ValueVector* leftValueVector, common::ValueVector* rightValueVector,
+        common::ValueVector* resultValueVector, uint64_t /*resultPos*/, void* dataPtr) {
+        OP::operation(left, right, result, *leftValueVector, *rightValueVector, *resultValueVector,
+            dataPtr);
+    }
+};
+
+struct BinaryListExtractFunctionWrapper {
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(LEFT_TYPE& left, RIGHT_TYPE& right, RESULT_TYPE& result,
+        common::ValueVector* leftValueVector, common::ValueVector* rightValueVector,
+        common::ValueVector* resultValueVector, uint64_t resultPos, void* /*dataPtr*/) {
+        OP::operation(left, right, result, *leftValueVector, *rightValueVector, *resultValueVector,
+            resultPos);
+    }
+};
+
+struct BinaryStringFunctionWrapper {
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(LEFT_TYPE& left, RIGHT_TYPE& right, RESULT_TYPE& result,
+        common::ValueVector* /*leftValueVector*/, common::ValueVector* /*rightValueVector*/,
+        common::ValueVector* resultValueVector, uint64_t /*resultPos*/, void* /*dataPtr*/) {
+        OP::operation(left, right, result, *resultValueVector);
+    }
+};
+
+struct BinaryComparisonFunctionWrapper {
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(LEFT_TYPE& left, RIGHT_TYPE& right, RESULT_TYPE& result,
+        common::ValueVector* leftValueVector, common::ValueVector* rightValueVector,
+        common::ValueVector* /*resultValueVector*/, uint64_t /*resultPos*/, void* /*dataPtr*/) {
+        OP::operation(left, right, result, leftValueVector, rightValueVector);
+    }
+};
+
+struct BinaryUDFFunctionWrapper {
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(LEFT_TYPE& left, RIGHT_TYPE& right, RESULT_TYPE& result,
+        common::ValueVector* /*leftValueVector*/, common::ValueVector* /*rightValueVector*/,
+        common::ValueVector* /*resultValueVector*/, uint64_t /*resultPos*/, void* dataPtr) {
+        OP::operation(left, right, result, dataPtr);
+    }
+};
+
+struct BinarySelectWithBindDataWrapper {
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename OP>
+    static void operation(LEFT_TYPE& left, RIGHT_TYPE& right, uint8_t& result,
+        common::ValueVector* leftValueVector, common::ValueVector* rightValueVector,
+        void* dataPtr) {
+        OP::operation(left, right, result, *leftValueVector, *rightValueVector, *leftValueVector,
+            dataPtr);
+    }
+};
+
+struct BinaryFunctionExecutor {
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static inline void executeOnValue(common::ValueVector& left, common::ValueVector& right,
+        common::ValueVector& resultValueVector, uint64_t lPos, uint64_t rPos, uint64_t resPos,
+        void* dataPtr) {
+        OP_WRAPPER::template operation<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC>(
+            ((LEFT_TYPE*)left.getData())[lPos], ((RIGHT_TYPE*)right.getData())[rPos],
+            ((RESULT_TYPE*)resultValueVector.getData())[resPos], &left, &right, &resultValueVector,
+            resPos, dataPtr);
+    }
+
+    static inline std::tuple<common::sel_t, common::sel_t, common::sel_t> getSelectedPositions(
+        common::SelectionVector* leftSelVector, common::SelectionVector* rightSelVector,
+        common::SelectionVector* resultSelVector, common::sel_t selPos, bool leftFlat,
+        bool rightFlat) {
+        common::sel_t lPos = (*leftSelVector)[leftFlat ? 0 : selPos];
+        common::sel_t rPos = (*rightSelVector)[rightFlat ? 0 : selPos];
+        common::sel_t resPos = (*resultSelVector)[leftFlat && rightFlat ? 0 : selPos];
+        return {lPos, rPos, resPos};
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeOnSelectedValues(common::ValueVector& left,
+        common::SelectionVector* leftSelVector, common::ValueVector& right,
+        common::SelectionVector* rightSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        const bool leftFlat = left.state->isFlat();
+        const bool rightFlat = right.state->isFlat();
+
+        const bool allNullsGuaranteed = (rightFlat && right.isNull((*rightSelVector)[0])) ||
+                                        (leftFlat && left.isNull((*leftSelVector)[0]));
+        if (allNullsGuaranteed) {
+            result.setAllNull();
+        } else {
+            const bool noNullsGuaranteed = (leftFlat || left.hasNoNullsGuarantee()) &&
+                                           (rightFlat || right.hasNoNullsGuarantee());
+            if (noNullsGuaranteed) {
+                result.setAllNonNull();
+            }
+
+            const auto numSelectedValues =
+                leftFlat ? rightSelVector->getSelSize() : leftSelVector->getSelSize();
+            for (common::sel_t selPos = 0; selPos < numSelectedValues; ++selPos) {
+                auto [lPos, rPos, resPos] = getSelectedPositions(leftSelVector, rightSelVector,
+                    resultSelVector, selPos, leftFlat, rightFlat);
+                if (noNullsGuaranteed) {
+                    executeOnValue<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(left,
+                        right, result, lPos, rPos, resPos, dataPtr);
+                } else {
+                    result.setNull(resPos, left.isNull(lPos) || right.isNull(rPos));
+                    if (!result.isNull(resPos)) {
+                        executeOnValue<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(left,
+                            right, result, lPos, rPos, resPos, dataPtr);
+                    }
+                }
+            }
+        }
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeSwitch(common::ValueVector& left, common::SelectionVector* leftSelVector,
+        common::ValueVector& right, common::SelectionVector* rightSelVector,
+        common::ValueVector& result, common::SelectionVector* resultSelVector, void* dataPtr) {
+        result.resetAuxiliaryBuffer();
+        executeOnSelectedValues<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(left,
+            leftSelVector, right, rightSelVector, result, resultSelVector, dataPtr);
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void execute(common::ValueVector& left, common::SelectionVector* leftSelVector,
+        common::ValueVector& right, common::SelectionVector* rightSelVector,
+        common::ValueVector& result, common::SelectionVector* resultSelVector) {
+        executeSwitch<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC, BinaryFunctionWrapper>(left,
+            leftSelVector, right, rightSelVector, result, resultSelVector, nullptr /* dataPtr */);
+    }
+
+    struct BinarySelectWrapper {
+        template<typename LEFT_TYPE, typename RIGHT_TYPE, typename OP>
+        static inline void operation(LEFT_TYPE& left, RIGHT_TYPE& right, uint8_t& result,
+            common::ValueVector* /*leftValueVector*/, common::ValueVector* /*rightValueVector*/,
+            void* /*dataPtr*/) {
+            OP::operation(left, right, result);
+        }
+    };
+
+    struct BinaryComparisonSelectWrapper {
+        template<typename LEFT_TYPE, typename RIGHT_TYPE, typename OP>
+        static inline void operation(LEFT_TYPE& left, RIGHT_TYPE& right, uint8_t& result,
+            common::ValueVector* leftValueVector, common::ValueVector* rightValueVector,
+            void* /*dataPtr*/) {
+            OP::operation(left, right, result, leftValueVector, rightValueVector);
+        }
+    };
+
+    template<class LEFT_TYPE, class RIGHT_TYPE, class FUNC, typename SELECT_WRAPPER>
+    static void selectOnValue(common::ValueVector& left, common::ValueVector& right, uint64_t lPos,
+        uint64_t rPos, uint64_t resPos, uint64_t& numSelectedValues,
+        std::span<common::sel_t> selectedPositionsBuffer, void* dataPtr) {
+        uint8_t resultValue = 0;
+        SELECT_WRAPPER::template operation<LEFT_TYPE, RIGHT_TYPE, FUNC>(
+            ((LEFT_TYPE*)left.getData())[lPos], ((RIGHT_TYPE*)right.getData())[rPos], resultValue,
+            &left, &right, dataPtr);
+        selectedPositionsBuffer[numSelectedValues] = resPos;
+        numSelectedValues += (resultValue == true);
+    }
+
+    template<class LEFT_TYPE, class RIGHT_TYPE, class FUNC, typename SELECT_WRAPPER>
+    static uint64_t selectBothFlat(common::ValueVector& left, common::ValueVector& right,
+        void* dataPtr) {
+        auto lPos = left.state->getSelVector()[0];
+        auto rPos = right.state->getSelVector()[0];
+        uint8_t resultValue = 0;
+        if (!left.isNull(lPos) && !right.isNull(rPos)) {
+            SELECT_WRAPPER::template operation<LEFT_TYPE, RIGHT_TYPE, FUNC>(
+                ((LEFT_TYPE*)left.getData())[lPos], ((RIGHT_TYPE*)right.getData())[rPos],
+                resultValue, &left, &right, dataPtr);
+        }
+        return resultValue == true;
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename FUNC, typename SELECT_WRAPPER>
+    static bool selectFlatUnFlat(common::ValueVector& left, common::ValueVector& right,
+        common::SelectionVector& selVector, void* dataPtr) {
+        auto lPos = left.state->getSelVector()[0];
+        uint64_t numSelectedValues = 0;
+        auto selectedPositionsBuffer = selVector.getMutableBuffer();
+        auto& rightSelVector = right.state->getSelVector();
+        if (left.isNull(lPos)) {
+            return numSelectedValues;
+        } else if (right.hasNoNullsGuarantee()) {
+            rightSelVector.forEach([&](auto i) {
+                selectOnValue<LEFT_TYPE, RIGHT_TYPE, FUNC, SELECT_WRAPPER>(left, right, lPos, i, i,
+                    numSelectedValues, selectedPositionsBuffer, dataPtr);
+            });
+        } else {
+            rightSelVector.forEach([&](auto i) {
+                if (!right.isNull(i)) {
+                    selectOnValue<LEFT_TYPE, RIGHT_TYPE, FUNC, SELECT_WRAPPER>(left, right, lPos, i,
+                        i, numSelectedValues, selectedPositionsBuffer, dataPtr);
+                }
+            });
+        }
+        selVector.setSelSize(numSelectedValues);
+        return numSelectedValues > 0;
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename FUNC, typename SELECT_WRAPPER>
+    static bool selectUnFlatFlat(common::ValueVector& left, common::ValueVector& right,
+        common::SelectionVector& selVector, void* dataPtr) {
+        auto rPos = right.state->getSelVector()[0];
+        uint64_t numSelectedValues = 0;
+        auto selectedPositionsBuffer = selVector.getMutableBuffer();
+        auto& leftSelVector = left.state->getSelVector();
+        if (right.isNull(rPos)) {
+            return numSelectedValues;
+        } else if (left.hasNoNullsGuarantee()) {
+            leftSelVector.forEach([&](auto i) {
+                selectOnValue<LEFT_TYPE, RIGHT_TYPE, FUNC, SELECT_WRAPPER>(left, right, i, rPos, i,
+                    numSelectedValues, selectedPositionsBuffer, dataPtr);
+            });
+        } else {
+            leftSelVector.forEach([&](auto i) {
+                if (!left.isNull(i)) {
+                    selectOnValue<LEFT_TYPE, RIGHT_TYPE, FUNC, SELECT_WRAPPER>(left, right, i, rPos,
+                        i, numSelectedValues, selectedPositionsBuffer, dataPtr);
+                }
+            });
+        }
+        selVector.setSelSize(numSelectedValues);
+        return numSelectedValues > 0;
+    }
+
+    // Right, left, and result vectors share the same selectedPositions.
+    template<class LEFT_TYPE, class RIGHT_TYPE, class FUNC, typename SELECT_WRAPPER>
+    static bool selectBothUnFlat(common::ValueVector& left, common::ValueVector& right,
+        common::SelectionVector& selVector, void* dataPtr) {
+        uint64_t numSelectedValues = 0;
+        auto selectedPositionsBuffer = selVector.getMutableBuffer();
+        auto& leftSelVector = left.state->getSelVector();
+        if (left.hasNoNullsGuarantee() && right.hasNoNullsGuarantee()) {
+            leftSelVector.forEach([&](auto i) {
+                selectOnValue<LEFT_TYPE, RIGHT_TYPE, FUNC, SELECT_WRAPPER>(left, right, i, i, i,
+                    numSelectedValues, selectedPositionsBuffer, dataPtr);
+            });
+        } else {
+            leftSelVector.forEach([&](auto i) {
+                auto isNull = left.isNull(i) || right.isNull(i);
+                if (!isNull) {
+                    selectOnValue<LEFT_TYPE, RIGHT_TYPE, FUNC, SELECT_WRAPPER>(left, right, i, i, i,
+                        numSelectedValues, selectedPositionsBuffer, dataPtr);
+                }
+            });
+        }
+        selVector.setSelSize(numSelectedValues);
+        return numSelectedValues > 0;
+    }
+
+    // BOOLEAN (AND, OR, XOR)
+    template<class LEFT_TYPE, class RIGHT_TYPE, class FUNC,
+        typename OP_WRAPPER = BinarySelectWrapper>
+    static bool select(common::ValueVector& left, common::ValueVector& right,
+        common::SelectionVector& selVector, void* dataPtr) {
+        if (left.state->isFlat() && right.state->isFlat()) {
+            return selectBothFlat<LEFT_TYPE, RIGHT_TYPE, FUNC, OP_WRAPPER>(left, right, dataPtr);
+        } else if (left.state->isFlat() && !right.state->isFlat()) {
+            return selectFlatUnFlat<LEFT_TYPE, RIGHT_TYPE, FUNC, OP_WRAPPER>(left, right, selVector,
+                dataPtr);
+        } else if (!left.state->isFlat() && right.state->isFlat()) {
+            return selectUnFlatFlat<LEFT_TYPE, RIGHT_TYPE, FUNC, OP_WRAPPER>(left, right, selVector,
+                dataPtr);
+        } else {
+            return selectBothUnFlat<LEFT_TYPE, RIGHT_TYPE, FUNC, OP_WRAPPER>(left, right, selVector,
+                dataPtr);
+        }
+    }
+
+    // COMPARISON (GT, GTE, LT, LTE, EQ, NEQ)
+    template<class LEFT_TYPE, class RIGHT_TYPE, class FUNC>
+    static bool selectComparison(common::ValueVector& left, common::ValueVector& right,
+        common::SelectionVector& selVector, void* dataPtr) {
+        if (left.state->isFlat() && right.state->isFlat()) {
+            return selectBothFlat<LEFT_TYPE, RIGHT_TYPE, FUNC, BinaryComparisonSelectWrapper>(left,
+                right, dataPtr);
+        } else if (left.state->isFlat() && !right.state->isFlat()) {
+            return selectFlatUnFlat<LEFT_TYPE, RIGHT_TYPE, FUNC, BinaryComparisonSelectWrapper>(
+                left, right, selVector, dataPtr);
+        } else if (!left.state->isFlat() && right.state->isFlat()) {
+            return selectUnFlatFlat<LEFT_TYPE, RIGHT_TYPE, FUNC, BinaryComparisonSelectWrapper>(
+                left, right, selVector, dataPtr);
+        } else {
+            return selectBothUnFlat<LEFT_TYPE, RIGHT_TYPE, FUNC, BinaryComparisonSelectWrapper>(
+                left, right, selVector, dataPtr);
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/functions/decode_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/functions/decode_function.h
new file mode 100644
index 0000000000..db8599afc3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/functions/decode_function.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "common/exception/runtime.h"
+#include "common/types/blob.h"
+#include "common/vector/value_vector.h"
+#include "utf8proc_wrapper.h"
+
+namespace lbug {
+namespace function {
+
+struct Decode {
+    static inline void operation(common::blob_t& input, common::ku_string_t& result,
+        common::ValueVector& resultVector) {
+        if (utf8proc::Utf8Proc::analyze(reinterpret_cast<const char*>(input.value.getData()),
+                input.value.len) == utf8proc::UnicodeType::INVALID) {
+            throw common::RuntimeException(
+                "Failure in decode: could not convert blob to UTF8 string, "
+                "the blob contained invalid UTF8 characters");
+        }
+        common::StringVector::addString(&resultVector, result, input.value);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/functions/encode_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/functions/encode_function.h
new file mode 100644
index 0000000000..206513ee91
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/functions/encode_function.h
@@ -0,0 +1,17 @@
+#pragma once
+
+#include "common/types/blob.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct Encode {
+    static inline void operation(common::ku_string_t& input, common::blob_t& result,
+        common::ValueVector& resultVector) {
+        common::StringVector::addString(&resultVector, result.value, input);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/functions/octet_length_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/functions/octet_length_function.h
new file mode 100644
index 0000000000..d98d45230f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/functions/octet_length_function.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "common/types/blob.h"
+
+namespace lbug {
+namespace function {
+
+struct OctetLength {
+    static inline void operation(common::blob_t& input, int64_t& result) {
+        result = input.value.len;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/vector_blob_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/vector_blob_functions.h
new file mode 100644
index 0000000000..501e056684
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/blob/vector_blob_functions.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct OctetLengthFunctions {
+    static constexpr const char* name = "OCTET_LENGTH";
+
+    static function_set getFunctionSet();
+};
+
+struct EncodeFunctions {
+    static constexpr const char* name = "ENCODE";
+
+    static function_set getFunctionSet();
+};
+
+struct DecodeFunctions {
+    static constexpr const char* name = "DECODE";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/boolean/boolean_function_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/boolean/boolean_function_executor.h
new file mode 100644
index 0000000000..39bd8e0cf2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/boolean/boolean_function_executor.h
@@ -0,0 +1,342 @@
+#pragma once
+
+#include "boolean_functions.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+/**
+ * Binary boolean function requires special executor implementation because it's truth table
+ * handles null differently (e.g. NULL OR TRUE = TRUE). Note that unary boolean operation (currently
+ * only NOT) does not require special implementation because NOT NULL = NULL.
+ */
+struct BinaryBooleanFunctionExecutor {
+
+    template<typename FUNC>
+    static inline void executeOnValueNoNull(common::ValueVector& left, common::ValueVector& right,
+        common::ValueVector& result, uint64_t lPos, uint64_t rPos, uint64_t resPos) {
+        auto resValues = (uint8_t*)result.getData();
+        FUNC::operation(left.getValue<uint8_t>(lPos), right.getValue<uint8_t>(rPos),
+            resValues[resPos], false /* isLeftNull */, false /* isRightNull */);
+        result.setNull(resPos, false /* isNull */);
+    }
+
+    template<typename FUNC>
+    static inline void executeOnValue(common::ValueVector& left, common::ValueVector& right,
+        common::ValueVector& result, uint64_t lPos, uint64_t rPos, uint64_t resPos) {
+        auto resValues = (uint8_t*)result.getData();
+        FUNC::operation(left.getValue<uint8_t>(lPos), right.getValue<uint8_t>(rPos),
+            resValues[resPos], left.isNull(lPos), right.isNull(rPos));
+        result.setNull(resPos, result.getValue<uint8_t>(resPos) == NULL_BOOL);
+    }
+
+    template<typename FUNC>
+    static inline void executeBothFlat(common::ValueVector& left,
+        common::SelectionVector* leftSelVector, common::ValueVector& right,
+        common::SelectionVector* rightSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector) {
+        auto lPos = (*leftSelVector)[0];
+        auto rPos = (*rightSelVector)[0];
+        auto resPos = (*resultSelVector)[0];
+        executeOnValue<FUNC>(left, right, result, lPos, rPos, resPos);
+    }
+
+    template<typename FUNC>
+    static void executeFlatUnFlat(common::ValueVector& left, common::SelectionVector* leftSelVector,
+        common::ValueVector& right, common::SelectionVector* rightSelVector,
+        common::ValueVector& result, common::SelectionVector*) {
+        auto lPos = (*leftSelVector)[0];
+        if (rightSelVector->isUnfiltered()) {
+            if (right.hasNoNullsGuarantee() && !left.isNull(lPos)) {
+                for (auto i = 0u; i < rightSelVector->getSelSize(); ++i) {
+                    executeOnValueNoNull<FUNC>(left, right, result, lPos, i, i);
+                }
+            } else {
+                for (auto i = 0u; i < rightSelVector->getSelSize(); ++i) {
+                    executeOnValue<FUNC>(left, right, result, lPos, i, i);
+                }
+            }
+        } else {
+            if (right.hasNoNullsGuarantee() && !left.isNull(lPos)) {
+                for (auto i = 0u; i < rightSelVector->getSelSize(); ++i) {
+                    auto rPos = (*rightSelVector)[i];
+                    executeOnValueNoNull<FUNC>(left, right, result, lPos, rPos, rPos);
+                }
+            } else {
+                for (auto i = 0u; i < rightSelVector->getSelSize(); ++i) {
+                    auto rPos = (*rightSelVector)[i];
+                    executeOnValue<FUNC>(left, right, result, lPos, rPos, rPos);
+                }
+            }
+        }
+    }
+
+    template<typename FUNC>
+    static void executeUnFlatFlat(common::ValueVector& left, common::SelectionVector* leftSelVector,
+        common::ValueVector& right, common::SelectionVector* rightSelVector,
+        common::ValueVector& result, common::SelectionVector*) {
+        auto rPos = (*rightSelVector)[0];
+        if (leftSelVector->isUnfiltered()) {
+            if (left.hasNoNullsGuarantee() && !right.isNull(rPos)) {
+                for (auto i = 0u; i < leftSelVector->getSelSize(); ++i) {
+                    executeOnValueNoNull<FUNC>(left, right, result, i, rPos, i);
+                }
+            } else {
+                for (auto i = 0u; i < leftSelVector->getSelSize(); ++i) {
+                    executeOnValue<FUNC>(left, right, result, i, rPos, i);
+                }
+            }
+        } else {
+            if (left.hasNoNullsGuarantee() && !right.isNull(rPos)) {
+                for (auto i = 0u; i < leftSelVector->getSelSize(); ++i) {
+                    auto lPos = (*leftSelVector)[i];
+                    executeOnValueNoNull<FUNC>(left, right, result, lPos, rPos, lPos);
+                }
+            } else {
+                for (auto i = 0u; i < leftSelVector->getSelSize(); ++i) {
+                    auto lPos = (*leftSelVector)[i];
+                    executeOnValue<FUNC>(left, right, result, lPos, rPos, lPos);
+                }
+            }
+        }
+    }
+
+    template<typename FUNC>
+    static void executeBothUnFlat(common::ValueVector& left, common::SelectionVector* leftSelVector,
+        common::ValueVector& right, [[maybe_unused]] common::SelectionVector* rightSelVector,
+        common::ValueVector& result, common::SelectionVector*) {
+        KU_ASSERT(leftSelVector == rightSelVector);
+        if (leftSelVector->isUnfiltered()) {
+            if (left.hasNoNullsGuarantee() && right.hasNoNullsGuarantee()) {
+                for (auto i = 0u; i < leftSelVector->getSelSize(); ++i) {
+                    executeOnValueNoNull<FUNC>(left, right, result, i, i, i);
+                }
+            } else {
+                for (auto i = 0u; i < leftSelVector->getSelSize(); ++i) {
+                    executeOnValue<FUNC>(left, right, result, i, i, i);
+                }
+            }
+        } else {
+            if (left.hasNoNullsGuarantee() && right.hasNoNullsGuarantee()) {
+                for (auto i = 0u; i < leftSelVector->getSelSize(); ++i) {
+                    auto pos = (*leftSelVector)[i];
+                    executeOnValueNoNull<FUNC>(left, right, result, pos, pos, pos);
+                }
+            } else {
+                for (auto i = 0u; i < leftSelVector->getSelSize(); ++i) {
+                    auto pos = (*leftSelVector)[i];
+                    executeOnValue<FUNC>(left, right, result, pos, pos, pos);
+                }
+            }
+        }
+    }
+
+    template<typename FUNC>
+    static void execute(common::ValueVector& left, common::SelectionVector* leftSelVector,
+        common::ValueVector& right, common::SelectionVector* rightSelVector,
+        common::ValueVector& result, common::SelectionVector* resultSelVector) {
+        KU_ASSERT(left.dataType.getLogicalTypeID() == common::LogicalTypeID::BOOL &&
+                  right.dataType.getLogicalTypeID() == common::LogicalTypeID::BOOL &&
+                  result.dataType.getLogicalTypeID() == common::LogicalTypeID::BOOL);
+        if (left.state->isFlat() && right.state->isFlat()) {
+            executeBothFlat<FUNC>(left, leftSelVector, right, rightSelVector, result,
+                resultSelVector);
+        } else if (left.state->isFlat() && !right.state->isFlat()) {
+            executeFlatUnFlat<FUNC>(left, leftSelVector, right, rightSelVector, result,
+                resultSelVector);
+        } else if (!left.state->isFlat() && right.state->isFlat()) {
+            executeUnFlatFlat<FUNC>(left, leftSelVector, right, rightSelVector, result,
+                resultSelVector);
+        } else {
+            executeBothUnFlat<FUNC>(left, leftSelVector, right, rightSelVector, result,
+                resultSelVector);
+        }
+    }
+
+    template<class FUNC>
+    static void selectOnValue(common::ValueVector& left, common::ValueVector& right, uint64_t lPos,
+        uint64_t rPos, uint64_t resPos, uint64_t& numSelectedValues,
+        std::span<common::sel_t> selectedPositionsBuffer) {
+        uint8_t resultValue = 0;
+        FUNC::operation(left.getValue<uint8_t>(lPos), right.getValue<uint8_t>(rPos), resultValue,
+            left.isNull(lPos), right.isNull(rPos));
+        selectedPositionsBuffer[numSelectedValues] = resPos;
+        numSelectedValues += (resultValue == true);
+    }
+
+    template<typename FUNC>
+    static bool selectBothFlat(common::ValueVector& left, common::ValueVector& right) {
+        auto lPos = left.state->getSelVector()[0];
+        auto rPos = right.state->getSelVector()[0];
+        uint8_t resultValue = 0;
+        FUNC::operation(left.getValue<bool>(lPos), right.getValue<bool>(rPos), resultValue,
+            (bool)left.isNull(lPos), (bool)right.isNull(rPos));
+        return resultValue == true;
+    }
+
+    template<typename FUNC>
+    static bool selectFlatUnFlat(common::ValueVector& left, common::ValueVector& right,
+        common::SelectionVector& selVector) {
+        auto lPos = left.state->getSelVector()[0];
+        uint64_t numSelectedValues = 0;
+        auto selectedPositionsBuffer = selVector.getMutableBuffer();
+        auto& rightSelVector = right.state->getSelVector();
+        if (rightSelVector.isUnfiltered()) {
+            for (auto i = 0u; i < rightSelVector.getSelSize(); ++i) {
+                selectOnValue<FUNC>(left, right, lPos, i, i, numSelectedValues,
+                    selectedPositionsBuffer);
+            }
+        } else {
+            for (auto i = 0u; i < rightSelVector.getSelSize(); ++i) {
+                auto rPos = right.state->getSelVector()[i];
+                selectOnValue<FUNC>(left, right, lPos, rPos, rPos, numSelectedValues,
+                    selectedPositionsBuffer);
+            }
+        }
+        selVector.setSelSize(numSelectedValues);
+        return numSelectedValues > 0;
+    }
+
+    template<typename FUNC>
+    static bool selectUnFlatFlat(common::ValueVector& left, common::ValueVector& right,
+        common::SelectionVector& selVector) {
+        auto rPos = right.state->getSelVector()[0];
+        uint64_t numSelectedValues = 0;
+        auto selectedPositionsBuffer = selVector.getMutableBuffer();
+        auto& leftSelVector = left.state->getSelVector();
+        if (leftSelVector.isUnfiltered()) {
+            for (auto i = 0u; i < leftSelVector.getSelSize(); ++i) {
+                selectOnValue<FUNC>(left, right, i, rPos, i, numSelectedValues,
+                    selectedPositionsBuffer);
+            }
+        } else {
+            for (auto i = 0u; i < leftSelVector.getSelSize(); ++i) {
+                auto lPos = left.state->getSelVector()[i];
+                selectOnValue<FUNC>(left, right, lPos, rPos, lPos, numSelectedValues,
+                    selectedPositionsBuffer);
+            }
+        }
+        selVector.setSelSize(numSelectedValues);
+        return numSelectedValues > 0;
+    }
+
+    template<typename FUNC>
+    static bool selectBothUnFlat(common::ValueVector& left, common::ValueVector& right,
+        common::SelectionVector& selVector) {
+        uint64_t numSelectedValues = 0;
+        auto selectedPositionsBuffer = selVector.getMutableBuffer();
+        auto& leftSelVector = left.state->getSelVector();
+        if (leftSelVector.isUnfiltered()) {
+            for (auto i = 0u; i < leftSelVector.getSelSize(); ++i) {
+                selectOnValue<FUNC>(left, right, i, i, i, numSelectedValues,
+                    selectedPositionsBuffer);
+            }
+        } else {
+            for (auto i = 0u; i < leftSelVector.getSelSize(); ++i) {
+                auto pos = left.state->getSelVector()[i];
+                selectOnValue<FUNC>(left, right, pos, pos, pos, numSelectedValues,
+                    selectedPositionsBuffer);
+            }
+        }
+        selVector.setSelSize(numSelectedValues);
+        return numSelectedValues > 0;
+    }
+
+    template<typename FUNC>
+    static bool select(common::ValueVector& left, common::ValueVector& right,
+        common::SelectionVector& selVector) {
+        KU_ASSERT(left.dataType.getLogicalTypeID() == common::LogicalTypeID::BOOL &&
+                  right.dataType.getLogicalTypeID() == common::LogicalTypeID::BOOL);
+        if (left.state->isFlat() && right.state->isFlat()) {
+            return selectBothFlat<FUNC>(left, right);
+        } else if (left.state->isFlat() && !right.state->isFlat()) {
+            return selectFlatUnFlat<FUNC>(left, right, selVector);
+        } else if (!left.state->isFlat() && right.state->isFlat()) {
+            return selectUnFlatFlat<FUNC>(left, right, selVector);
+        } else {
+            return selectBothUnFlat<FUNC>(left, right, selVector);
+        }
+    }
+};
+
+struct UnaryBooleanOperationExecutor {
+
+    template<typename FUNC>
+    static inline void executeOnValue(common::ValueVector& operand, uint64_t operandPos,
+        common::ValueVector& result, uint64_t resultPos) {
+        auto resultValues = (uint8_t*)result.getData();
+        FUNC::operation(operand.getValue<uint8_t>(operandPos), operand.isNull(operandPos),
+            resultValues[resultPos]);
+        result.setNull(resultPos, result.getValue<uint8_t>(resultPos) == NULL_BOOL);
+    }
+
+    template<typename FUNC>
+    static void executeSwitch(common::ValueVector& operand,
+        common::SelectionVector* operandSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector) {
+        result.resetAuxiliaryBuffer();
+        if (operand.state->isFlat()) {
+            auto pos = (*operandSelVector)[0];
+            auto resultPos = (*resultSelVector)[0];
+            executeOnValue<FUNC>(operand, pos, result, resultPos);
+        } else {
+            if (operandSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < operandSelVector->getSelSize(); i++) {
+                    executeOnValue<FUNC>(operand, i, result, i);
+                }
+            } else {
+                for (auto i = 0u; i < operandSelVector->getSelSize(); i++) {
+                    auto pos = (*operandSelVector)[i];
+                    executeOnValue<FUNC>(operand, pos, result, pos);
+                }
+            }
+        }
+    }
+
+    template<typename FUNC>
+    static inline void execute(common::ValueVector& operand,
+        common::SelectionVector* operandSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector) {
+        executeSwitch<FUNC>(operand, operandSelVector, result, resultSelVector);
+    }
+
+    template<typename FUNC>
+    static inline void selectOnValue(common::ValueVector& operand, uint64_t operandPos,
+        uint64_t& numSelectedValues, std::span<common::sel_t> selectedPositionsBuffer) {
+        uint8_t resultValue = 0;
+        FUNC::operation(operand.getValue<uint8_t>(operandPos), operand.isNull(operandPos),
+            resultValue);
+        selectedPositionsBuffer[numSelectedValues] = operandPos;
+        numSelectedValues += resultValue == true;
+    }
+
+    template<typename FUNC>
+    static bool select(common::ValueVector& operand, common::SelectionVector& selVector) {
+        if (operand.state->isFlat()) {
+            auto pos = operand.state->getSelVector()[0];
+            uint8_t resultValue = 0;
+            FUNC::operation(operand.getValue<uint8_t>(pos), operand.isNull(pos), resultValue);
+            return resultValue == true;
+        } else {
+            auto& operandSelVector = operand.state->getSelVector();
+            uint64_t numSelectedValues = 0;
+            auto selectedPositionBuffer = selVector.getMutableBuffer();
+            if (operandSelVector.isUnfiltered()) {
+                for (auto i = 0ul; i < operandSelVector.getSelSize(); i++) {
+                    selectOnValue<FUNC>(operand, i, numSelectedValues, selectedPositionBuffer);
+                }
+            } else {
+                for (auto i = 0ul; i < operandSelVector.getSelSize(); i++) {
+                    auto pos = operand.state->getSelVector()[i];
+                    selectOnValue<FUNC>(operand, pos, numSelectedValues, selectedPositionBuffer);
+                }
+            }
+            selVector.setSelSize(numSelectedValues);
+            return numSelectedValues > 0;
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/boolean/boolean_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/boolean/boolean_functions.h
new file mode 100644
index 0000000000..73d637832e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/boolean/boolean_functions.h
@@ -0,0 +1,121 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace function {
+
+/**
+ * The boolean operators (AND, OR, XOR, NOT) works a little differently from other operators. While
+ * other operators can operate on only non null operands, boolean operators can operate even with
+ * null operands in certain cases, for instance, Null OR True = True. Hence, the result value of
+ * the boolean operator can be True, False or Null. To accommodate for this, the dataType of
+ * result is uint8_t (that can have more than 2 values) rather than bool. In case, the result is
+ * computed to be Null based on the operands, we set result = NULL_BOOL, which should rightly be
+ * interpreted by operator executors as NULL and not as True.
+ * */
+
+/**
+ * IMPORTANT: Not to be used outside the context of boolean operators.
+ * */
+const uint8_t NULL_BOOL = 2;
+
+/**
+ * AND operator Truth table:
+ *
+ *    left      isLeftNull       right       isRightNull        result
+ *   ------    ------------     -------     -------------      --------
+ *     T            F              T              F               1
+ *     T            F              F              F               0
+ *     F            F              T              F               0
+ *     F            F              F              F               0
+ *     -            T              T              F               2
+ *     -            T              F              F               0
+ *     T            F              -              T               2
+ *     F            F              -              T               0
+ *     -            T              -              T               2
+ * */
+struct And {
+    static inline void operation(bool left, bool right, uint8_t& result, bool isLeftNull,
+        bool isRightNull) {
+        if ((!left && !isLeftNull) || (!right && !isRightNull)) {
+            result = false;
+        } else if (isLeftNull || isRightNull) {
+            result = NULL_BOOL;
+        } else {
+            result = true;
+        }
+    }
+};
+
+/**
+ * OR operator Truth table:
+ *
+ *    left      isLeftNull       right       isRightNull        result
+ *   ------    ------------     -------     -------------      --------
+ *     T            F              T              F               1
+ *     T            F              F              F               1
+ *     F            F              T              F               1
+ *     F            F              F              F               0
+ *     -            T              T              F               1
+ *     -            T              F              F               2
+ *     T            F              -              T               1
+ *     F            F              -              T               2
+ *     -            T              -              T               2
+ * */
+struct Or {
+    static inline void operation(bool left, bool right, uint8_t& result, bool isLeftNull,
+        bool isRightNull) {
+        if ((left && !isLeftNull) || (right && !isRightNull)) {
+            result = true;
+        } else if (isLeftNull || isRightNull) {
+            result = NULL_BOOL;
+        } else {
+            result = false;
+        }
+    }
+};
+
+/**
+ * XOR operator Truth table:
+ *
+ *    left      isLeftNull       right       isRightNull        result
+ *   ------    ------------     -------     -------------      --------
+ *     T            F              T              F               0
+ *     T            F              F              F               1
+ *     F            F              T              F               1
+ *     F            F              F              F               0
+ *     -            T              T              F               2
+ *     -            T              F              F               2
+ *     T            F              -              T               2
+ *     F            F              -              T               2
+ *     -            T              -              T               2
+ * */
+struct Xor {
+    static inline void operation(bool left, bool right, uint8_t& result, bool isLeftNull,
+        bool isRightNull) {
+        if (isLeftNull || isRightNull) {
+            result = NULL_BOOL;
+        } else {
+            result = left ^ right;
+        }
+    }
+};
+
+/**
+ * NOT operator Truth table:
+ *
+ *    operand         isNull        right
+ *   ---------    ------------     -------
+ *       T            F              0
+ *       F            F              1
+ *       -            T              2
+ * */
+struct Not {
+    static inline void operation(bool operand, bool isNull, uint8_t& result) {
+        result = isNull ? NULL_BOOL : !operand;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/boolean/vector_boolean_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/boolean/vector_boolean_functions.h
new file mode 100644
index 0000000000..b27592b7b9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/boolean/vector_boolean_functions.h
@@ -0,0 +1,68 @@
+#pragma once
+
+#include "boolean_function_executor.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+class VectorBooleanFunction {
+public:
+    static void bindExecFunction(common::ExpressionType expressionType,
+        const binder::expression_vector& children, scalar_func_exec_t& func);
+
+    static void bindSelectFunction(common::ExpressionType expressionType,
+        const binder::expression_vector& children, scalar_func_select_t& func);
+
+private:
+    template<typename FUNC>
+    static void BinaryBooleanExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* /*dataPtr*/ = nullptr) {
+        KU_ASSERT(params.size() == 2);
+        BinaryBooleanFunctionExecutor::execute<FUNC>(*params[0], paramSelVectors[0], *params[1],
+            paramSelVectors[1], result, resultSelVector);
+    }
+
+    template<typename FUNC>
+    static bool BinaryBooleanSelectFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        common::SelectionVector& selVector, void* /*dataPtr*/) {
+        KU_ASSERT(params.size() == 2);
+        return BinaryBooleanFunctionExecutor::select<FUNC>(*params[0], *params[1], selVector);
+    }
+
+    template<typename FUNC>
+    static void UnaryBooleanExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* /*dataPtr*/ = nullptr) {
+        KU_ASSERT(params.size() == 1);
+        UnaryBooleanOperationExecutor::execute<FUNC>(*params[0], paramSelVectors[0], result,
+            resultSelVector);
+    }
+
+    template<typename FUNC>
+    static bool UnaryBooleanSelectFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        common::SelectionVector& selVector, void* /*dataPtr*/) {
+        KU_ASSERT(params.size() == 1);
+        return UnaryBooleanOperationExecutor::select<FUNC>(*params[0], selVector);
+    }
+
+    static void bindBinaryExecFunction(common::ExpressionType expressionType,
+        const binder::expression_vector& children, scalar_func_exec_t& func);
+
+    static void bindBinarySelectFunction(common::ExpressionType expressionType,
+        const binder::expression_vector& children, scalar_func_select_t& func);
+
+    static void bindUnaryExecFunction(common::ExpressionType expressionType,
+        const binder::expression_vector& children, scalar_func_exec_t& func);
+
+    static void bindUnarySelectFunction(common::ExpressionType expressionType,
+        const binder::expression_vector& children, scalar_func_select_t& func);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/built_in_function_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/built_in_function_utils.h
new file mode 100644
index 0000000000..2b41914dd8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/built_in_function_utils.h
@@ -0,0 +1,100 @@
+#pragma once
+
+#include "aggregate_function.h"
+#include "catalog/catalog_entry/catalog_entry_type.h"
+#include "function.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace catalog {
+class FunctionCatalogEntry;
+} // namespace catalog
+
+namespace function {
+
+class BuiltInFunctionsUtils {
+public:
+    // TODO(Ziyi): We should have a unified interface for matching table, aggregate and scalar
+    // functions.
+    static LBUG_API Function* matchFunction(const std::string& name,
+        const catalog::FunctionCatalogEntry* catalogEntry) {
+        return matchFunction(name, {}, catalogEntry);
+    }
+    static LBUG_API Function* matchFunction(const std::string& name,
+        const std::vector<common::LogicalType>& inputTypes,
+        const catalog::FunctionCatalogEntry* functionEntry);
+
+    static AggregateFunction* matchAggregateFunction(const std::string& name,
+        const std::vector<common::LogicalType>& inputTypes, bool isDistinct,
+        const catalog::FunctionCatalogEntry* functionEntry);
+
+    static LBUG_API uint32_t getCastCost(common::LogicalTypeID inputTypeID,
+        common::LogicalTypeID targetTypeID);
+
+    static LBUG_API std::string getFunctionMatchFailureMsg(const std::string name,
+        const std::vector<common::LogicalType>& inputTypes, const std::string& supportedInputs,
+        bool isDistinct = false);
+
+private:
+    // TODO(Xiyang): move casting cost related functions to binder.
+    static uint32_t getTargetTypeCost(common::LogicalTypeID typeID);
+
+    static uint32_t castInt64(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castInt32(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castInt16(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castInt8(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castUInt64(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castUInt32(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castUInt16(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castUInt8(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castInt128(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castDouble(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castFloat(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castDecimal(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castDate(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castSerial(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castTimestamp(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castFromString(common::LogicalTypeID inputTypeID);
+
+    static uint32_t castUUID(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castList(common::LogicalTypeID targetTypeID);
+
+    static uint32_t castArray(common::LogicalTypeID targetTypeID);
+
+    static Function* getBestMatch(std::vector<Function*>& functions);
+
+    static uint32_t getFunctionCost(const std::vector<common::LogicalType>& inputTypes,
+        Function* function, catalog::CatalogEntryType type);
+    static uint32_t matchParameters(const std::vector<common::LogicalType>& inputTypes,
+        const std::vector<common::LogicalTypeID>& targetTypeIDs);
+    static uint32_t matchVarLengthParameters(const std::vector<common::LogicalType>& inputTypes,
+        common::LogicalTypeID targetTypeID);
+    static uint32_t getAggregateFunctionCost(const std::vector<common::LogicalType>& inputTypes,
+        bool isDistinct, AggregateFunction* function);
+
+    static void validateSpecialCases(std::vector<Function*>& candidateFunctions,
+        const std::string& name, const std::vector<common::LogicalType>& inputTypes,
+        const function::function_set& set);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/cast_function_bind_data.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/cast_function_bind_data.h
new file mode 100644
index 0000000000..58e9d93703
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/cast_function_bind_data.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "common/copier_config/csv_reader_config.h"
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct CastFunctionBindData : public FunctionBindData {
+    // We don't allow configuring delimiters, ... in CAST function.
+    // For performance purpose, we generate a default option object during binding time.
+    common::CSVOption option;
+    // TODO(Mahn): the following field should be removed once we refactor fixed list.
+    uint64_t numOfEntries;
+
+    explicit CastFunctionBindData(common::LogicalType dataType)
+        : FunctionBindData{std::move(dataType)}, numOfEntries{0} {}
+
+    inline std::unique_ptr<FunctionBindData> copy() const override {
+        auto result = std::make_unique<CastFunctionBindData>(resultType.copy());
+        result->numOfEntries = numOfEntries;
+        result->option = option.copy();
+        return result;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/cast_union_bind_data.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/cast_union_bind_data.h
new file mode 100644
index 0000000000..4fce9f2217
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/cast_union_bind_data.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/types/types.h"
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct CastToUnionBindData : public FunctionBindData {
+    using inner_func_t = std::function<void(common::ValueVector*, common::ValueVector&,
+        common::SelectionVector*, uint64_t inputPos, uint64_t resultPos)>;
+
+    common::union_field_idx_t targetTag;
+    inner_func_t innerFunc;
+
+    CastToUnionBindData(common::union_field_idx_t targetTag, inner_func_t innerFunc,
+        common::LogicalType dataType)
+        : FunctionBindData{std::move(dataType)}, targetTag{targetTag},
+          innerFunc{std::move(innerFunc)} {}
+
+    std::unique_ptr<FunctionBindData> copy() const override {
+        return std::make_unique<CastToUnionBindData>(targetTag, innerFunc, resultType.copy());
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_array.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_array.h
new file mode 100644
index 0000000000..ca547678da
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_array.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct CastArrayHelper {
+    static bool checkCompatibleNestedTypes(LogicalTypeID sourceTypeID, LogicalTypeID targetTypeID);
+
+    static bool isUnionSpecialCast(const LogicalType& srcType, const LogicalType& dstType);
+
+    static bool containsListToArray(const LogicalType& srcType, const LogicalType& dstType);
+
+    static void validateListEntry(ValueVector* inputVector, const LogicalType& resultType,
+        uint64_t pos);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_decimal.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_decimal.h
new file mode 100644
index 0000000000..52de3b6ff4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_decimal.h
@@ -0,0 +1,155 @@
+#pragma once
+
+#include <string>
+#include <type_traits>
+
+#include "common/exception/overflow.h"
+#include "common/string_format.h"
+#include "common/type_utils.h"
+#include "common/types/int128_t.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "function/cast/functions/cast_string_non_nested_functions.h"
+#include "function/cast/functions/numeric_limits.h"
+
+namespace lbug {
+namespace function {
+
+template<typename A, typename B>
+struct pickDecimalPhysicalType {
+    static constexpr bool AISFLOAT = std::is_floating_point<A>::value;
+    static constexpr bool BISFLOAT = std::is_floating_point<B>::value;
+    using RES =
+        typename std::conditional<(AISFLOAT ? false : (BISFLOAT ? true : sizeof(A) > sizeof(B))), A,
+            B>::type;
+};
+
+struct CastDecimalTo {
+    template<typename SRC, typename DST>
+    static void operation(SRC& input, DST& output, const ValueVector& inputVec,
+        ValueVector& outputVec) {
+        using T = typename pickDecimalPhysicalType<SRC, DST>::RES;
+        constexpr auto pow10s = pow10Sequence<T>();
+        auto scale = DecimalType::getScale(inputVec.dataType);
+        if constexpr (std::is_floating_point<DST>::value) {
+            output = (DST)input / (DST)pow10s[scale];
+        } else {
+            auto roundconst = (input < 0 ? -5 : 5);
+            auto tmp = ((scale > 0 ? pow10s[scale - 1] * roundconst : 0) + input) / pow10s[scale];
+            if (tmp < NumericLimits<DST>::minimum() || tmp > NumericLimits<DST>::maximum()) {
+                throw OverflowException(stringFormat("Cast Failed: {} is not in {} range",
+                    DecimalType::insertDecimalPoint(TypeUtils::toString(input), scale),
+                    outputVec.dataType.toString()));
+            }
+            output = (DST)tmp;
+        }
+    }
+};
+
+struct CastToDecimal {
+    template<typename SRC, typename DST>
+    static void operation(SRC& input, DST& output, const ValueVector&,
+        const ValueVector& outputVec) {
+        constexpr auto pow10s = pow10Sequence<DST>();
+        auto precision = DecimalType::getPrecision(outputVec.dataType);
+        auto scale = DecimalType::getScale(outputVec.dataType);
+        if constexpr (std::is_floating_point<SRC>::value) {
+            auto roundconst = (input < 0 ? -0.5 : 0.5);
+            output = (DST)((double)pow10s[scale] * input + roundconst);
+        } else {
+            output = (DST)(pow10s[scale] * input);
+        }
+        if (output <= -pow10s[precision] || output >= pow10s[precision]) {
+            throw OverflowException(stringFormat("To Decimal Cast Failed: {} is not in {} range",
+                TypeUtils::toString(input), outputVec.dataType.toString()));
+        }
+    }
+};
+
+struct CastBetweenDecimal {
+    template<typename SRC, typename DST>
+    static void operation(SRC& input, DST& output, const ValueVector& inputVec,
+        const ValueVector& outputVec) {
+        using T = typename pickDecimalPhysicalType<SRC, DST>::RES;
+        constexpr auto pow10s = pow10Sequence<T>();
+        auto outputPrecision = DecimalType::getPrecision(outputVec.dataType);
+        auto inputScale = DecimalType::getScale(inputVec.dataType);
+        auto outputScale = DecimalType::getScale(outputVec.dataType);
+        if (inputScale == outputScale) {
+            output = (DST)input;
+        } else if (inputScale < outputScale) {
+            output = (DST)(pow10s[outputScale - inputScale] * input);
+        } else {
+            auto roundconst = (input < 0 ? -5 : 5);
+            output = (DST)((pow10s[inputScale - outputScale - 1] * roundconst + input) /
+                           pow10s[inputScale - outputScale]);
+        }
+        if (pow10s[outputPrecision] <= output || -pow10s[outputPrecision] >= output) {
+            throw OverflowException(stringFormat(
+                "Decimal Cast Failed: input {} is not in range of {}",
+                DecimalType::insertDecimalPoint(TypeUtils::toString(input, nullptr), inputScale),
+                outputVec.dataType.toString()));
+        }
+    }
+};
+
+// DECIMAL TO STRING SPECIALIZATION
+template<>
+inline void CastDecimalTo::operation(int16_t& input, ku_string_t& output,
+    const ValueVector& inputVec, ValueVector& resultVector) {
+    auto scale = DecimalType::getScale(inputVec.dataType);
+    auto str = DecimalType::insertDecimalPoint(std::to_string(input), scale);
+    common::StringVector::addString(&resultVector, output, str);
+}
+
+template<>
+inline void CastDecimalTo::operation(int32_t& input, ku_string_t& output,
+    const ValueVector& inputVec, ValueVector& resultVector) {
+    auto scale = DecimalType::getScale(inputVec.dataType);
+    auto str = DecimalType::insertDecimalPoint(std::to_string(input), scale);
+    common::StringVector::addString(&resultVector, output, str);
+}
+
+template<>
+inline void CastDecimalTo::operation(int64_t& input, ku_string_t& output,
+    const ValueVector& inputVec, ValueVector& resultVector) {
+    auto scale = DecimalType::getScale(inputVec.dataType);
+    auto str = DecimalType::insertDecimalPoint(std::to_string(input), scale);
+    common::StringVector::addString(&resultVector, output, str);
+}
+
+template<>
+inline void CastDecimalTo::operation(common::int128_t& input, ku_string_t& output,
+    const ValueVector& inputVec, ValueVector& resultVector) {
+    auto scale = DecimalType::getScale(inputVec.dataType);
+    auto str = DecimalType::insertDecimalPoint(common::Int128_t::toString(input), scale);
+    common::StringVector::addString(&resultVector, output, str);
+}
+
+// STRING TO DECIMAL SPECIALIZATION
+template<>
+inline void CastToDecimal::operation(ku_string_t& input, int16_t& output, const ValueVector&,
+    const ValueVector& outputVec) {
+    decimalCast((const char*)input.getData(), input.len, output, outputVec.dataType);
+}
+
+template<>
+inline void CastToDecimal::operation(ku_string_t& input, int32_t& output, const ValueVector&,
+    const ValueVector& outputVec) {
+    decimalCast((const char*)input.getData(), input.len, output, outputVec.dataType);
+}
+
+template<>
+inline void CastToDecimal::operation(ku_string_t& input, int64_t& output, const ValueVector&,
+    const ValueVector& outputVec) {
+    decimalCast((const char*)input.getData(), input.len, output, outputVec.dataType);
+}
+
+template<>
+inline void CastToDecimal::operation(ku_string_t& input, common::int128_t& output,
+    const ValueVector&, const ValueVector& outputVec) {
+    decimalCast((const char*)input.getData(), input.len, output, outputVec.dataType);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_from_string_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_from_string_functions.h
new file mode 100644
index 0000000000..e9ee1350de
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_from_string_functions.h
@@ -0,0 +1,190 @@
+#pragma once
+
+#include "cast_string_non_nested_functions.h"
+#include "common/copier_config/csv_reader_config.h"
+#include "common/type_utils.h"
+#include "common/types/blob.h"
+#include "common/types/uuid.h"
+#include "common/vector/value_vector.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+struct LBUG_API CastString {
+    static void copyStringToVector(ValueVector* vector, uint64_t vectorPos, std::string_view strVal,
+        const CSVOption* option);
+
+    template<typename T>
+    static inline bool tryCast(const ku_string_t& input, T& result) {
+        // try cast for signed integer types (not including int128)
+        return trySimpleIntegerCast<T, true>(reinterpret_cast<const char*>(input.getData()),
+            input.len, result);
+    }
+
+    template<typename T>
+    static inline void operation(const ku_string_t& input, T& result,
+        ValueVector* /*resultVector*/ = nullptr, uint64_t /*rowToAdd*/ = 0,
+        const CSVOption* /*option*/ = nullptr) {
+        // base case: int64
+        simpleIntegerCast<T, true>(reinterpret_cast<const char*>(input.getData()), input.len,
+            result, LogicalTypeID::INT64);
+    }
+};
+
+template<>
+inline void CastString::operation(const ku_string_t& input, int128_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<int128_t>(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        LogicalTypeID::INT128);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, uint128_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint128_t, false>(reinterpret_cast<const char*>(input.getData()), input.len,
+        result, LogicalTypeID::UINT128);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, int32_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<int32_t>(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        LogicalTypeID::INT32);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, int16_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<int16_t>(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        LogicalTypeID::INT16);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, int8_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<int8_t>(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        LogicalTypeID::INT8);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, uint64_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint64_t, false>(reinterpret_cast<const char*>(input.getData()), input.len,
+        result, LogicalTypeID::UINT64);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, uint32_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint32_t, false>(reinterpret_cast<const char*>(input.getData()), input.len,
+        result, LogicalTypeID::UINT32);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, uint16_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint16_t, false>(reinterpret_cast<const char*>(input.getData()), input.len,
+        result, LogicalTypeID::UINT16);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, uint8_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    simpleIntegerCast<uint8_t, false>(reinterpret_cast<const char*>(input.getData()), input.len,
+        result, LogicalTypeID::UINT8);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, float& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    doubleCast<float>(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        LogicalTypeID::FLOAT);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, double& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    doubleCast<double>(reinterpret_cast<const char*>(input.getData()), input.len, result,
+        LogicalTypeID::DOUBLE);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, date_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    result = Date::fromCString((const char*)input.getData(), input.len);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, timestamp_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    result = Timestamp::fromCString((const char*)input.getData(), input.len);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, timestamp_ns_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    TryCastStringToTimestamp::cast<timestamp_ns_t>((const char*)input.getData(), input.len, result,
+        LogicalTypeID::TIMESTAMP_NS);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, timestamp_ms_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    TryCastStringToTimestamp::cast<timestamp_ms_t>((const char*)input.getData(), input.len, result,
+        LogicalTypeID::TIMESTAMP_MS);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, timestamp_sec_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    TryCastStringToTimestamp::cast<timestamp_sec_t>((const char*)input.getData(), input.len, result,
+        LogicalTypeID::TIMESTAMP_SEC);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, timestamp_tz_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    TryCastStringToTimestamp::cast<timestamp_tz_t>((const char*)input.getData(), input.len, result,
+        LogicalTypeID::TIMESTAMP_TZ);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, interval_t& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    result = Interval::fromCString((const char*)input.getData(), input.len);
+}
+
+template<>
+inline void CastString::operation(const ku_string_t& input, bool& result,
+    ValueVector* /*resultVector*/, uint64_t /*rowToAdd*/, const CSVOption* /*option*/) {
+    castStringToBool(reinterpret_cast<const char*>(input.getData()), input.len, result);
+}
+
+template<>
+void CastString::operation(const ku_string_t& input, blob_t& result, ValueVector* resultVector,
+    uint64_t rowToAdd, const CSVOption* option);
+
+template<>
+void CastString::operation(const ku_string_t& input, ku_uuid_t& result, ValueVector* result_vector,
+    uint64_t rowToAdd, const CSVOption* option);
+
+template<>
+void CastString::operation(const ku_string_t& input, list_entry_t& result,
+    ValueVector* resultVector, uint64_t rowToAdd, const CSVOption* option);
+
+template<>
+void CastString::operation(const ku_string_t& input, map_entry_t& result, ValueVector* resultVector,
+    uint64_t rowToAdd, const CSVOption* option);
+
+template<>
+void CastString::operation(const ku_string_t& input, struct_entry_t& result,
+    ValueVector* resultVector, uint64_t rowToAdd, const CSVOption* option);
+
+template<>
+void CastString::operation(const ku_string_t& input, union_entry_t& result,
+    ValueVector* resultVector, uint64_t rowToAdd, const CSVOption* option);
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_functions.h
new file mode 100644
index 0000000000..da3564908b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_functions.h
@@ -0,0 +1,415 @@
+#pragma once
+
+#include "common/exception/overflow.h"
+#include "common/string_format.h"
+#include "common/type_utils.h"
+#include "common/types/int128_t.h"
+#include "common/types/uint128_t.h"
+#include "common/vector/value_vector.h"
+#include "function/cast/cast_union_bind_data.h"
+#include "function/cast/functions/numeric_cast.h"
+
+namespace lbug {
+namespace function {
+
+struct CastToString {
+    template<typename T>
+    static inline void operation(T& input, common::ku_string_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector) {
+        auto str = common::TypeUtils::toString(input, (void*)&inputVector);
+        common::StringVector::addString(&resultVector, result, str);
+    }
+};
+
+struct CastNodeToString {
+    static inline void operation(common::struct_entry_t& input, common::ku_string_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector) {
+        auto str = common::TypeUtils::nodeToString(input, &inputVector);
+        common::StringVector::addString(&resultVector, result, str);
+    }
+};
+
+struct CastRelToString {
+    static inline void operation(common::struct_entry_t& input, common::ku_string_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector) {
+        auto str = common::TypeUtils::relToString(input, &inputVector);
+        common::StringVector::addString(&resultVector, result, str);
+    }
+};
+
+struct CastToUnion {
+    static inline void operation(common::ValueVector& inputVector,
+        common::ValueVector& resultVector, uint64_t inputPos, uint64_t resultPos, void* dataPtr) {
+        const auto& bindData = *reinterpret_cast<CastToUnionBindData*>(dataPtr);
+        auto& tagVector = *common::UnionVector::getTagVector(&resultVector);
+        auto& valVector = *common::UnionVector::getValVector(&resultVector, bindData.targetTag);
+        tagVector.setValue<common::union_field_idx_t>(resultPos, bindData.targetTag);
+        bindData.innerFunc(&inputVector, valVector, inputVector.getSelVectorPtr(), inputPos,
+            resultPos);
+    }
+};
+
+struct CastDateToTimestamp {
+    template<typename T>
+    static inline void operation(common::date_t& input, T& result) {
+        // base case: timestamp
+        result = common::Timestamp::fromDateTime(input, common::dtime_t{});
+    }
+};
+
+template<>
+inline void CastDateToTimestamp::operation(common::date_t& input, common::timestamp_ns_t& result) {
+    operation<common::timestamp_t>(input, result);
+    result = common::timestamp_ns_t{common::Timestamp::getEpochNanoSeconds(result)};
+}
+
+template<>
+inline void CastDateToTimestamp::operation(common::date_t& input, common::timestamp_ms_t& result) {
+    operation<common::timestamp_t>(input, result);
+    result.value /= common::Interval::MICROS_PER_MSEC;
+}
+
+template<>
+inline void CastDateToTimestamp::operation(common::date_t& input, common::timestamp_sec_t& result) {
+    operation<common::timestamp_t>(input, result);
+    result.value /= common::Interval::MICROS_PER_SEC;
+}
+
+struct CastToDate {
+    template<typename T>
+    static inline void operation(T& input, common::date_t& result);
+};
+
+template<>
+inline void CastToDate::operation(common::timestamp_t& input, common::date_t& result) {
+    result = common::Timestamp::getDate(input);
+}
+
+template<>
+inline void CastToDate::operation(common::timestamp_ns_t& input, common::date_t& result) {
+    auto tmp = common::Timestamp::fromEpochNanoSeconds(input.value);
+    operation<common::timestamp_t>(tmp, result);
+}
+
+template<>
+inline void CastToDate::operation(common::timestamp_ms_t& input, common::date_t& result) {
+    auto tmp = common::Timestamp::fromEpochMilliSeconds(input.value);
+    operation<common::timestamp_t>(tmp, result);
+}
+
+template<>
+inline void CastToDate::operation(common::timestamp_sec_t& input, common::date_t& result) {
+    auto tmp = common::Timestamp::fromEpochSeconds(input.value);
+    operation<common::timestamp_t>(tmp, result);
+}
+
+struct CastToDouble {
+    template<typename T>
+    static inline void operation(T& input, double& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within DOUBLE range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToDouble::operation(common::int128_t& input, double& result) {
+    if (!common::Int128_t::tryCast(input, result)) { // LCOV_EXCL_START
+        throw common::OverflowException{common::stringFormat("Value {} is not within DOUBLE range",
+            common::TypeUtils::toString(input))};
+    } // LCOV_EXCL_STOP
+}
+
+struct CastToFloat {
+    template<typename T>
+    static inline void operation(T& input, float& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within FLOAT range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToFloat::operation(common::int128_t& input, float& result) {
+    if (!common::Int128_t::tryCast(input, result)) { // LCOV_EXCL_START
+        throw common::OverflowException{common::stringFormat("Value {} is not within FLOAT range",
+            common::TypeUtils::toString(input))};
+    }; // LCOV_EXCL_STOP
+}
+
+struct CastToInt128 {
+    template<typename T>
+    static inline void operation(T& input, common::int128_t& result) {
+        common::Int128_t::tryCastTo(input, result);
+    }
+};
+
+struct CastToUInt128 {
+    template<typename T>
+    static inline void operation(T& input, common::uint128_t& result) {
+        common::UInt128_t::tryCastTo(input, result);
+    }
+};
+
+template<>
+inline void CastToInt128::operation(common::uint128_t& input, common::int128_t& result) {
+    result = (common::int128_t)input;
+}
+
+template<>
+inline void CastToUInt128::operation(common::int128_t& input, common::uint128_t& result) {
+    result = (common::uint128_t)input;
+}
+
+struct CastToInt64 {
+    template<typename T>
+    static inline void operation(T& input, int64_t& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within INT64 range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToInt64::operation(common::int128_t& input, int64_t& result) {
+    if (!common::Int128_t::tryCast(input, result)) {
+        throw common::OverflowException{common::stringFormat("Value {} is not within INT64 range",
+            common::TypeUtils::toString(input))};
+    };
+}
+
+struct CastToSerial {
+    template<typename T>
+    static inline void operation(T& input, int64_t& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within INT64 range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToSerial::operation(common::int128_t& input, int64_t& result) {
+    if (!common::Int128_t::tryCast(input, result)) {
+        throw common::OverflowException{common::stringFormat("Value {} is not within INT64 range",
+            common::TypeUtils::toString(input))};
+    };
+}
+
+struct CastToInt32 {
+    template<typename T>
+    static inline void operation(T& input, int32_t& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within INT32 range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToInt32::operation(common::int128_t& input, int32_t& result) {
+    if (!common::Int128_t::tryCast(input, result)) {
+        throw common::OverflowException{common::stringFormat("Value {} is not within INT32 range",
+            common::TypeUtils::toString(input))};
+    };
+}
+
+struct CastToInt16 {
+    template<typename T>
+    static inline void operation(T& input, int16_t& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within INT16 range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToInt16::operation(common::int128_t& input, int16_t& result) {
+    if (!common::Int128_t::tryCast(input, result)) {
+        throw common::OverflowException{common::stringFormat("Value {} is not within INT16 range",
+            common::TypeUtils::toString(input))};
+    };
+}
+
+struct CastToInt8 {
+    template<typename T>
+    static inline void operation(T& input, int8_t& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within INT8 range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToInt8::operation(common::int128_t& input, int8_t& result) {
+    if (!common::Int128_t::tryCast(input, result)) {
+        throw common::OverflowException{common::stringFormat("Value {} is not within INT8 range",
+            common::TypeUtils::toString(input))};
+    };
+}
+
+struct CastToUInt64 {
+    template<typename T>
+    static inline void operation(T& input, uint64_t& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within UINT64 range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToUInt64::operation(common::int128_t& input, uint64_t& result) {
+    if (!common::Int128_t::tryCast(input, result)) {
+        throw common::OverflowException{common::stringFormat("Value {} is not within UINT64 range",
+            common::TypeUtils::toString(input))};
+    };
+}
+
+struct CastToUInt32 {
+    template<typename T>
+    static inline void operation(T& input, uint32_t& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within UINT32 range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToUInt32::operation(common::int128_t& input, uint32_t& result) {
+    if (!common::Int128_t::tryCast(input, result)) {
+        throw common::OverflowException{common::stringFormat("Value {} is not within UINT32 range",
+            common::TypeUtils::toString(input))};
+    };
+}
+
+struct CastToUInt16 {
+    template<typename T>
+    static inline void operation(T& input, uint16_t& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within UINT16 range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToUInt16::operation(common::int128_t& input, uint16_t& result) {
+    if (!common::Int128_t::tryCast(input, result)) {
+        throw common::OverflowException{common::stringFormat("Value {} is not within UINT16 range",
+            common::TypeUtils::toString(input))};
+    };
+}
+
+struct CastToUInt8 {
+    template<typename T>
+    static inline void operation(T& input, uint8_t& result) {
+        if (!tryCastWithOverflowCheck(input, result)) {
+            throw common::OverflowException{common::stringFormat(
+                "Value {} is not within UINT8 range", common::TypeUtils::toString(input))};
+        }
+    }
+};
+
+template<>
+inline void CastToUInt8::operation(common::int128_t& input, uint8_t& result) {
+    if (!common::Int128_t::tryCast(input, result)) {
+        throw common::OverflowException{common::stringFormat("Value {} is not within UINT8 range",
+            common::TypeUtils::toString(input))};
+    };
+}
+
+struct CastBetweenTimestamp {
+    template<typename SRC_TYPE, typename DST_TYPE>
+    static void operation(const SRC_TYPE& input, DST_TYPE& result) {
+        // base case: same type
+        result.value = input.value;
+    }
+};
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_t& input,
+    common::timestamp_ns_t& output) {
+    output.value = common::Timestamp::getEpochNanoSeconds(input);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_t& input,
+    common::timestamp_ms_t& output) {
+    output.value = common::Timestamp::getEpochMilliSeconds(input);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_t& input,
+    common::timestamp_sec_t& output) {
+    output.value = common::Timestamp::getEpochSeconds(input);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_ms_t& input,
+    common::timestamp_t& output) {
+    output = common::Timestamp::fromEpochMilliSeconds(input.value);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_ms_t& input,
+    common::timestamp_ns_t& output) {
+    operation<common::timestamp_ms_t, common::timestamp_t>(input, output);
+    operation<common::timestamp_t, common::timestamp_ns_t>(output, output);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_ms_t& input,
+    common::timestamp_sec_t& output) {
+    operation<common::timestamp_ms_t, common::timestamp_t>(input, output);
+    operation<common::timestamp_t, common::timestamp_sec_t>(output, output);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_ns_t& input,
+    common::timestamp_t& output) {
+    output = common::Timestamp::fromEpochNanoSeconds(input.value);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_ns_t& input,
+    common::timestamp_ms_t& output) {
+    operation<common::timestamp_ns_t, common::timestamp_t>(input, output);
+    operation<common::timestamp_t, common::timestamp_ms_t>(output, output);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_ns_t& input,
+    common::timestamp_sec_t& output) {
+    operation<common::timestamp_ns_t, common::timestamp_t>(input, output);
+    operation<common::timestamp_t, common::timestamp_sec_t>(output, output);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_sec_t& input,
+    common::timestamp_t& output) {
+    output = common::Timestamp::fromEpochSeconds(input.value);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_sec_t& input,
+    common::timestamp_ns_t& output) {
+    operation<common::timestamp_sec_t, common::timestamp_t>(input, output);
+    operation<common::timestamp_t, common::timestamp_ns_t>(output, output);
+}
+
+template<>
+inline void CastBetweenTimestamp::operation(const common::timestamp_sec_t& input,
+    common::timestamp_ms_t& output) {
+    operation<common::timestamp_sec_t, common::timestamp_t>(input, output);
+    operation<common::timestamp_t, common::timestamp_ms_t>(output, output);
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_string_non_nested_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_string_non_nested_functions.h
new file mode 100644
index 0000000000..70900bc0e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/cast_string_non_nested_functions.h
@@ -0,0 +1,400 @@
+#pragma once
+
+#include "common/constants.h"
+#include "common/exception/conversion.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+#include "common/types/int128_t.h"
+#include "common/types/timestamp_t.h"
+#include "common/types/types.h"
+#include "common/types/uint128_t.h"
+#include "fast_float.h"
+#include "function/cast/functions/numeric_limits.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace function {
+
+bool isAnyType(std::string_view cpy);
+
+LogicalType LBUG_API inferMinimalTypeFromString(const std::string& str);
+LogicalType LBUG_API inferMinimalTypeFromString(std::string_view str);
+// Infer the type that the string represents.
+// Note: minimal integer width is int64
+// Used for sniffing
+
+// cast string to numerical
+template<class T>
+struct IntegerCastData {};
+
+template<std::integral T>
+struct IntegerCastData<T> {
+    using Result = T;
+    Result result;
+};
+
+template<>
+struct IntegerCastData<int128_t> {
+    int128_t result = 0;
+    int64_t intermediate = 0;
+    uint8_t digits = 0;
+    bool decimal = false;
+
+    bool flush() {
+        if (digits == 0 && intermediate == 0) {
+            return true;
+        }
+        if (result.low != 0 || result.high != 0) {
+            if (digits > DECIMAL_PRECISION_LIMIT) {
+                return false;
+            }
+            if (!Int128_t::tryMultiply(result, function::pow10Sequence<int128_t>()[digits],
+                    result)) {
+                return false;
+            }
+        }
+        if (!Int128_t::addInPlace(result, int128_t(intermediate))) {
+            return false;
+        }
+        digits = 0;
+        intermediate = 0;
+        return true;
+    }
+};
+
+template<>
+struct IntegerCastData<uint128_t> {
+    uint128_t result = 0;
+    uint64_t intermediate = 0;
+    uint8_t digits = 0;
+    bool decimal = false;
+
+    bool flush() {
+        if (digits == 0 && intermediate == 0) {
+            return true;
+        }
+        if (result.low != 0 || result.high != 0) {
+            if (digits > DECIMAL_PRECISION_LIMIT) {
+                return false;
+            }
+            if (!UInt128_t::tryMultiply(result, function::pow10Sequence<uint128_t>()[digits],
+                    result)) {
+                return false;
+            }
+        }
+        if (!UInt128_t::addInPlace(result, uint128_t(intermediate))) {
+            return false;
+        }
+        digits = 0;
+        intermediate = 0;
+        return true;
+    }
+};
+
+template<class T>
+struct IntegerCastOperation {};
+
+template<std::integral T>
+struct IntegerCastOperation<T> {
+    using CastData = IntegerCastData<T>;
+
+    template<bool NEGATIVE>
+    static bool handleDigit(CastData& state, uint8_t digit) {
+        using result_t = typename CastData::Result;
+        if constexpr (NEGATIVE) {
+            if (state.result < ((std::numeric_limits<result_t>::min() + digit) / 10)) {
+                return false;
+            }
+            state.result = state.result * 10 - digit;
+        } else {
+            if (state.result > ((std::numeric_limits<result_t>::max() - digit) / 10)) {
+                return false;
+            }
+            state.result = state.result * 10 + digit;
+        }
+        return true;
+    }
+
+    // TODO(Kebing): handle decimals
+    static bool finalize(CastData& /*state*/) { return true; }
+};
+
+// cast string to bool
+bool tryCastToBool(const char* input, uint64_t len, bool& result);
+void LBUG_API castStringToBool(const char* input, uint64_t len, bool& result);
+
+template<>
+struct IntegerCastOperation<int128_t> {
+    using CastData = IntegerCastData<int128_t>;
+
+    template<bool NEGATIVE>
+    static bool handleDigit(CastData& result, uint8_t digit) {
+        if constexpr (NEGATIVE) {
+            if (result.intermediate < (NumericLimits<int64_t>::minimum() + digit) / 10) {
+                if (!result.flush()) {
+                    return false;
+                }
+            }
+            result.intermediate *= 10;
+            result.intermediate -= digit;
+        } else {
+            if (result.intermediate > (std::numeric_limits<int64_t>::max() - digit) / 10) {
+                if (!result.flush()) {
+                    return false;
+                }
+            }
+            result.intermediate *= 10;
+            result.intermediate += digit;
+        }
+        result.digits++;
+        return true;
+    }
+
+    static bool finalize(CastData& result) { return result.flush(); }
+};
+
+template<>
+struct IntegerCastOperation<uint128_t> {
+    using CastData = IntegerCastData<uint128_t>;
+
+    template<bool NEGATIVE>
+    static bool handleDigit(CastData& result, uint8_t digit) {
+        if constexpr (NEGATIVE) {
+            if (result.intermediate < digit / 10) {
+                if (!result.flush()) {
+                    return false;
+                }
+            }
+            result.intermediate *= 10;
+            result.intermediate -= digit;
+        } else {
+            if (result.intermediate > (std::numeric_limits<uint64_t>::max() - digit) / 10) {
+                if (!result.flush()) {
+                    return false;
+                }
+            }
+            result.intermediate *= 10;
+            result.intermediate += digit;
+        }
+        result.digits++;
+        return true;
+    }
+
+    static bool finalize(CastData& result) { return result.flush(); }
+};
+
+// cast string to bool
+bool tryCastToBool(const char* input, uint64_t len, bool& result);
+void LBUG_API castStringToBool(const char* input, uint64_t len, bool& result);
+
+// cast to numerical values
+// TODO(Kebing): support exponent + decimal
+template<typename T, bool NEGATIVE>
+inline bool integerCastLoop(const char* input, uint64_t len, IntegerCastData<T>& result) {
+    using OP = IntegerCastOperation<T>;
+    auto start_pos = 0u;
+    if (NEGATIVE) {
+        start_pos = 1;
+    }
+    auto pos = start_pos;
+    while (pos < len) {
+        if (!StringUtils::CharacterIsDigit(input[pos])) {
+            return false;
+        }
+        uint8_t digit = input[pos++] - '0';
+        if (!OP::template handleDigit<NEGATIVE>(result, digit)) {
+            return false;
+        }
+    } // append all digits to result
+    if (!OP::finalize(result)) {
+        return false;
+    }
+    return pos > start_pos; // false if no digits "" or "-"
+}
+
+template<typename T, bool IS_SIGNED = true>
+inline bool tryIntegerCast(const char* input, uint64_t& len, IntegerCastData<T>& result) {
+    StringUtils::removeCStringWhiteSpaces(input, len);
+    if (len == 0) {
+        return false;
+    }
+
+    // negative
+    if (*input == '-') {
+        if constexpr (!IS_SIGNED) { // unsigned if not -0
+            uint64_t pos = 1;
+            while (pos < len) {
+                if (input[pos++] != '0') {
+                    return false;
+                }
+            }
+        }
+        // decimal separator is default to "."
+        return integerCastLoop<T, true>(input, len, result);
+    }
+
+    // not allow leading 0
+    if (len > 1 && *input == '0') {
+        return false;
+    }
+    return integerCastLoop<T, false>(input, len, result);
+}
+
+template<typename T, bool IS_SIGNED = true>
+inline bool trySimpleIntegerCast(const char* input, uint64_t len, T& result) {
+    IntegerCastData<T> data{};
+    data.result = 0;
+    if (tryIntegerCast<T, IS_SIGNED>(input, len, data)) {
+        result = data.result;
+        return true;
+    }
+    return false;
+}
+
+template<class T, bool IS_SIGNED = true>
+inline void simpleIntegerCast(const char* input, uint64_t len, T& result, LogicalTypeID typeID) {
+    if (!trySimpleIntegerCast<T, IS_SIGNED>(input, len, result)) {
+        throw ConversionException(stringFormat("Cast failed. Could not convert \"{}\" to {}.",
+            std::string{input, (size_t)len}, LogicalTypeUtils::toString(typeID)));
+    }
+}
+
+template<class T>
+inline bool tryDoubleCast(const char* input, uint64_t len, T& result) {
+    StringUtils::removeCStringWhiteSpaces(input, len);
+    if (len == 0) {
+        return false;
+    }
+    // not allow leading 0
+    if (len > 1 && *input == '0') {
+        if (StringUtils::CharacterIsDigit(input[1])) {
+            return false;
+        }
+    }
+    auto end = input + len;
+    auto parse_result = lbug_fast_float::from_chars(input, end, result);
+    if (parse_result.ec != std::errc()) {
+        return false;
+    }
+    return parse_result.ptr == end;
+}
+
+template<class T>
+inline void doubleCast(const char* input, uint64_t len, T& result,
+    LogicalTypeID typeID = LogicalTypeID::ANY) {
+    if (!tryDoubleCast<T>(input, len, result)) {
+        throw ConversionException(stringFormat("Cast failed. {} is not in {} range.",
+            std::string{input, (size_t)len}, LogicalTypeUtils::toString(typeID)));
+    }
+}
+
+// ---------------------- try cast String to Timestamp -------------------- //
+struct TryCastStringToTimestamp {
+    template<typename T>
+    static bool tryCast(const char* input, uint64_t len, timestamp_t& result);
+
+    template<typename T>
+    static void cast(const char* input, uint64_t len, timestamp_t& result, LogicalTypeID typeID) {
+        if (!tryCast<T>(input, len, result)) {
+            throw ConversionException(Timestamp::getTimestampConversionExceptionMsg(input, len,
+                LogicalTypeUtils::toString(typeID)));
+        }
+    }
+};
+
+template<>
+bool TryCastStringToTimestamp::tryCast<timestamp_ns_t>(const char* input, uint64_t len,
+    timestamp_t& result);
+
+template<>
+bool TryCastStringToTimestamp::tryCast<timestamp_ms_t>(const char* input, uint64_t len,
+    timestamp_t& result);
+
+template<>
+bool TryCastStringToTimestamp::tryCast<timestamp_sec_t>(const char* input, uint64_t len,
+    timestamp_t& result);
+
+template<>
+bool inline TryCastStringToTimestamp::tryCast<timestamp_tz_t>(const char* input, uint64_t len,
+    timestamp_t& result) {
+    return Timestamp::tryConvertTimestamp(input, len, result);
+}
+
+// ---------------------- cast String to Decimal -------------------- //
+
+template<typename T>
+bool tryDecimalCast(const char* input, uint64_t len, T& result, uint32_t precision,
+    uint32_t scale) {
+    constexpr auto pow10s = pow10Sequence<T>();
+    using CAST_OP = IntegerCastOperation<T>;
+    using CAST_DATA = IntegerCastData<T>;
+    StringUtils::removeCStringWhiteSpaces(input, len);
+    if (len == 0) {
+        return false;
+    }
+
+    bool negativeFlag = input[0] == '-';
+    if (negativeFlag) {
+        input++;
+        len -= 1;
+    }
+
+    CAST_DATA res;
+    res.result = 0;
+    auto pos = 0u;
+    auto periodPos = len - 1u;
+    while (pos < len) {
+        auto chr = input[pos];
+        if (input[pos] == '.') {
+            periodPos = pos;
+        } else if (pos > periodPos && pos - periodPos > scale) {
+            // we've parsed the digit limit
+            break;
+        } else if (!StringUtils::CharacterIsDigit(chr) ||
+                   !CAST_OP::template handleDigit<false>(res, chr - '0')) {
+            return false;
+        }
+        pos++;
+    }
+    if (pos < len) {
+        // then we parsed the digit limit, so round the final digit
+        if (!StringUtils::CharacterIsDigit(input[pos])) {
+            return false;
+        }
+        if (!CAST_OP::finalize(res)) {
+            return false;
+        }
+        // then determine rounding
+        if (input[pos] >= '5') {
+            res.result += 1;
+        }
+    }
+    while (pos - periodPos < scale + 1) {
+        // trailing 0's
+        if (!CAST_OP::template handleDigit<false>(res, 0)) {
+            return false;
+        }
+        pos++;
+    }
+    if (!CAST_OP::finalize(res)) {
+        return false;
+    }
+    if (res.result >= pow10s[precision]) {
+        return false;
+    }
+    result = negativeFlag ? -res.result : res.result;
+    return true;
+}
+
+template<typename T>
+void decimalCast(const char* input, uint64_t len, T& result, const LogicalType& type) {
+    if (!tryDecimalCast(input, len, result, DecimalType::getPrecision(type),
+            DecimalType::getScale(type))) {
+        throw ConversionException(stringFormat("Cast failed. {} is not in {} range.",
+            std::string{input, (size_t)len}, type.toString()));
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/numeric_cast.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/numeric_cast.h
new file mode 100644
index 0000000000..b7bddc6d5e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/numeric_cast.h
@@ -0,0 +1,164 @@
+#pragma once
+
+#include <cmath>
+#include <cstdint>
+
+#include "numeric_limits.h"
+
+namespace lbug {
+namespace function {
+
+template<class SRC, class DST>
+inline bool tryCastWithOverflowCheck(SRC value, DST& result) {
+    if (NumericLimits<SRC>::isSigned() != NumericLimits<DST>::isSigned()) {
+        if (NumericLimits<SRC>::isSigned()) {
+            if (NumericLimits<SRC>::maxNumDigits() > NumericLimits<DST>::maxNumDigits()) {
+                if (value < 0 || value > (SRC)NumericLimits<DST>::maximum()) {
+                    return false;
+                }
+            } else {
+                if (value < 0) {
+                    return false;
+                }
+            }
+            result = (DST)value;
+            return true;
+        } else {
+            // unsigned to signed conversion
+            if (NumericLimits<SRC>::maxNumDigits() >= NumericLimits<DST>::maxNumDigits()) {
+                if (value <= (SRC)NumericLimits<DST>::maximum()) {
+                    result = (DST)value;
+                    return true;
+                }
+                return false;
+            } else {
+                result = (DST)value;
+                return true;
+            }
+        }
+    } else {
+        // same sign conversion
+        if (NumericLimits<DST>::maxNumDigits() >= NumericLimits<SRC>::maxNumDigits()) {
+            result = (DST)value;
+            return true;
+        } else {
+            if (value < SRC(NumericLimits<DST>::minimum()) ||
+                value > SRC(NumericLimits<DST>::maximum())) {
+                return false;
+            }
+            result = (DST)value;
+            return true;
+        }
+    }
+}
+
+template<class SRC, class T>
+inline bool tryCastWithOverflowCheckFloat(SRC value, T& result, SRC min, SRC max) {
+    if (!(value >= min && value < max)) {
+        return false;
+    }
+    // PG FLOAT => INT casts use statistical rounding.
+    result = std::nearbyint(value);
+    return true;
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(float value, int8_t& result) {
+    return tryCastWithOverflowCheckFloat<float, int8_t>(value, result, -128.0f, 128.0f);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(float value, int16_t& result) {
+    return tryCastWithOverflowCheckFloat<float, int16_t>(value, result, -32768.0f, 32768.0f);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(float value, int32_t& result) {
+    return tryCastWithOverflowCheckFloat<float, int32_t>(value, result, -2147483648.0f,
+        2147483648.0f);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(float value, int64_t& result) {
+    return tryCastWithOverflowCheckFloat<float, int64_t>(value, result, -9223372036854775808.0f,
+        9223372036854775808.0f);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(float value, uint8_t& result) {
+    return tryCastWithOverflowCheckFloat<float, uint8_t>(value, result, 0.0f, 256.0f);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(float value, uint16_t& result) {
+    return tryCastWithOverflowCheckFloat<float, uint16_t>(value, result, 0.0f, 65536.0f);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(float value, uint32_t& result) {
+    return tryCastWithOverflowCheckFloat<float, uint32_t>(value, result, 0.0f, 4294967296.0f);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(float value, uint64_t& result) {
+    return tryCastWithOverflowCheckFloat<float, uint64_t>(value, result, 0.0f,
+        18446744073709551616.0f);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(double value, int8_t& result) {
+    return tryCastWithOverflowCheckFloat<double, int8_t>(value, result, -128.0, 128.0);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(double value, int16_t& result) {
+    return tryCastWithOverflowCheckFloat<double, int16_t>(value, result, -32768.0, 32768.0);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(double value, int32_t& result) {
+    return tryCastWithOverflowCheckFloat<double, int32_t>(value, result, -2147483648.0,
+        2147483648.0);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(double value, int64_t& result) {
+    return tryCastWithOverflowCheckFloat<double, int64_t>(value, result, -9223372036854775808.0,
+        9223372036854775808.0);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(double value, uint8_t& result) {
+    return tryCastWithOverflowCheckFloat<double, uint8_t>(value, result, 0.0, 256.0);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(double value, uint16_t& result) {
+    return tryCastWithOverflowCheckFloat<double, uint16_t>(value, result, 0.0, 65536.0);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(double value, uint32_t& result) {
+    return tryCastWithOverflowCheckFloat<double, uint32_t>(value, result, 0.0, 4294967296.0);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(double value, uint64_t& result) {
+    return tryCastWithOverflowCheckFloat<double, uint64_t>(value, result, 0.0,
+        18446744073709551615.0);
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(float input, double& result) {
+    result = double(input);
+    return true;
+}
+
+template<>
+inline bool tryCastWithOverflowCheck(double input, float& result) {
+    result = float(input);
+    return true;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/numeric_limits.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/numeric_limits.h
new file mode 100644
index 0000000000..c2ef07c2e0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/functions/numeric_limits.h
@@ -0,0 +1,208 @@
+#pragma once
+
+#include <array>
+#include <cstdint>
+#include <limits>
+
+#include "common/types/int128_t.h"
+#include "common/types/uint128_t.h"
+
+namespace lbug {
+namespace function {
+
+template<class T>
+struct NumericLimits {
+    static constexpr T minimum() { return std::numeric_limits<T>::lowest(); }
+    static constexpr T maximum() { return std::numeric_limits<T>::max(); }
+    static constexpr bool isSigned() { return std::is_signed<T>::value; }
+    template<typename V>
+    static bool isInBounds(V val) {
+        return minimum() <= val && val <= maximum();
+    }
+    static constexpr uint64_t maxNumDigits();
+};
+
+template<>
+struct NumericLimits<common::int128_t> {
+    static constexpr common::int128_t minimum() {
+        return {0, std::numeric_limits<int64_t>::lowest()};
+    }
+    static constexpr common::int128_t maximum() {
+        return {std::numeric_limits<uint64_t>::max(), std::numeric_limits<int64_t>::max()};
+    }
+    template<typename V>
+    static bool isInBounds(V val) {
+        return minimum() <= val && val <= maximum();
+    }
+    static constexpr bool isSigned() { return true; }
+    static constexpr uint64_t maxNumDigits() { return 39; }
+};
+
+template<>
+struct NumericLimits<common::uint128_t> {
+    static constexpr common::uint128_t minimum() { return {0, 0}; }
+    static constexpr common::uint128_t maximum() {
+        return {std::numeric_limits<uint64_t>::max(), std::numeric_limits<uint64_t>::max()};
+    }
+    template<typename V>
+    static bool isInBounds(V val) {
+        return minimum() <= val && val <= maximum();
+    }
+    static constexpr bool isSigned() { return false; }
+    static constexpr uint64_t maxNumDigits() { return 39; }
+};
+
+template<>
+constexpr uint64_t NumericLimits<int8_t>::maxNumDigits() {
+    return 3;
+}
+
+template<>
+constexpr uint64_t NumericLimits<int16_t>::maxNumDigits() {
+    return 5;
+}
+
+template<>
+constexpr uint64_t NumericLimits<int32_t>::maxNumDigits() {
+    return 10;
+}
+
+template<>
+constexpr uint64_t NumericLimits<int64_t>::maxNumDigits() {
+    return 19;
+}
+
+template<>
+constexpr uint64_t NumericLimits<uint8_t>::maxNumDigits() {
+    return 3;
+}
+
+template<>
+constexpr uint64_t NumericLimits<uint16_t>::maxNumDigits() {
+    return 5;
+}
+
+template<>
+constexpr uint64_t NumericLimits<uint32_t>::maxNumDigits() {
+    return 10;
+}
+
+template<>
+constexpr uint64_t NumericLimits<uint64_t>::maxNumDigits() {
+    return 20;
+}
+
+template<>
+constexpr uint64_t NumericLimits<float>::maxNumDigits() {
+    return 127;
+}
+
+template<>
+constexpr uint64_t NumericLimits<double>::maxNumDigits() {
+    return 250;
+}
+
+template<typename T>
+static constexpr std::array<T, NumericLimits<T>::maxNumDigits()> pow10Sequence() {
+    std::array<T, NumericLimits<T>::maxNumDigits()> retval{};
+    retval[0] = 1;
+    for (auto i = 1u; i < NumericLimits<T>::maxNumDigits(); i++) {
+        retval[i] = retval[i - 1] * 10;
+    }
+    return retval;
+}
+
+template<>
+constexpr std::array<common::int128_t, NumericLimits<common::int128_t>::maxNumDigits()>
+pow10Sequence() {
+    return {
+        common::int128_t(1UL, 0LL),
+        common::int128_t(10UL, 0LL),
+        common::int128_t(100UL, 0LL),
+        common::int128_t(1000UL, 0LL),
+        common::int128_t(10000UL, 0LL),
+        common::int128_t(100000UL, 0LL),
+        common::int128_t(1000000UL, 0LL),
+        common::int128_t(10000000UL, 0LL),
+        common::int128_t(100000000UL, 0LL),
+        common::int128_t(1000000000UL, 0LL),
+        common::int128_t(10000000000UL, 0LL),
+        common::int128_t(100000000000UL, 0LL),
+        common::int128_t(1000000000000UL, 0LL),
+        common::int128_t(10000000000000UL, 0LL),
+        common::int128_t(100000000000000UL, 0LL),
+        common::int128_t(1000000000000000UL, 0LL),
+        common::int128_t(10000000000000000UL, 0LL),
+        common::int128_t(100000000000000000UL, 0LL),
+        common::int128_t(1000000000000000000UL, 0LL),
+        common::int128_t(10000000000000000000UL, 0LL),
+        common::int128_t(7766279631452241920UL, 5LL),
+        common::int128_t(3875820019684212736UL, 54LL),
+        common::int128_t(1864712049423024128UL, 542LL),
+        common::int128_t(200376420520689664UL, 5421LL),
+        common::int128_t(2003764205206896640UL, 54210LL),
+        common::int128_t(1590897978359414784UL, 542101LL),
+        common::int128_t(15908979783594147840UL, 5421010LL),
+        common::int128_t(11515845246265065472UL, 54210108LL),
+        common::int128_t(4477988020393345024UL, 542101086LL),
+        common::int128_t(7886392056514347008UL, 5421010862LL),
+        common::int128_t(5076944270305263616UL, 54210108624LL),
+        common::int128_t(13875954555633532928UL, 542101086242LL),
+        common::int128_t(9632337040368467968UL, 5421010862427LL),
+        common::int128_t(4089650035136921600UL, 54210108624275LL),
+        common::int128_t(4003012203950112768UL, 542101086242752LL),
+        common::int128_t(3136633892082024448UL, 5421010862427522LL),
+        common::int128_t(12919594847110692864UL, 54210108624275221LL),
+        common::int128_t(68739955140067328UL, 542101086242752217LL),
+        common::int128_t(687399551400673280UL, 5421010862427522170LL),
+    }; // Couldn't find a clean way to do this
+}
+
+template<>
+constexpr std::array<common::uint128_t, NumericLimits<common::uint128_t>::maxNumDigits()>
+pow10Sequence() {
+    return {
+        common::uint128_t(1UL, 0UL),
+        common::uint128_t(10UL, 0UL),
+        common::uint128_t(100UL, 0UL),
+        common::uint128_t(1000UL, 0UL),
+        common::uint128_t(10000UL, 0UL),
+        common::uint128_t(100000UL, 0UL),
+        common::uint128_t(1000000UL, 0UL),
+        common::uint128_t(10000000UL, 0UL),
+        common::uint128_t(100000000UL, 0UL),
+        common::uint128_t(1000000000UL, 0UL),
+        common::uint128_t(10000000000UL, 0UL),
+        common::uint128_t(100000000000UL, 0UL),
+        common::uint128_t(1000000000000UL, 0UL),
+        common::uint128_t(10000000000000UL, 0UL),
+        common::uint128_t(100000000000000UL, 0UL),
+        common::uint128_t(1000000000000000UL, 0UL),
+        common::uint128_t(10000000000000000UL, 0UL),
+        common::uint128_t(100000000000000000UL, 0UL),
+        common::uint128_t(1000000000000000000UL, 0UL),
+        common::uint128_t(10000000000000000000UL, 0UL),
+        common::uint128_t(7766279631452241920UL, 5UL),
+        common::uint128_t(3875820019684212736UL, 54UL),
+        common::uint128_t(1864712049423024128UL, 542UL),
+        common::uint128_t(200376420520689664UL, 5421UL),
+        common::uint128_t(2003764205206896640UL, 54210UL),
+        common::uint128_t(1590897978359414784UL, 542101UL),
+        common::uint128_t(15908979783594147840UL, 5421010UL),
+        common::uint128_t(11515845246265065472UL, 54210108UL),
+        common::uint128_t(4477988020393345024UL, 542101086UL),
+        common::uint128_t(7886392056514347008UL, 5421010862UL),
+        common::uint128_t(5076944270305263616UL, 54210108624UL),
+        common::uint128_t(13875954555633532928UL, 542101086242UL),
+        common::uint128_t(9632337040368467968UL, 5421010862427UL),
+        common::uint128_t(4089650035136921600UL, 54210108624275UL),
+        common::uint128_t(4003012203950112768UL, 542101086242752UL),
+        common::uint128_t(3136633892082024448UL, 5421010862427522UL),
+        common::uint128_t(12919594847110692864UL, 54210108624275221UL),
+        common::uint128_t(68739955140067328UL, 542101086242752217UL),
+        common::uint128_t(687399551400673280UL, 5421010862427522170UL),
+    };
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/vector_cast_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/vector_cast_functions.h
new file mode 100644
index 0000000000..c2dac1caa5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/cast/vector_cast_functions.h
@@ -0,0 +1,194 @@
+#pragma once
+
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+/**
+ *  In the system we define explicit cast and implicit cast.
+ *  Explicit casts are performed from user function calls, e.g. date(), string().
+ *  Implicit casts are added internally.
+ */
+
+struct CastChildFunctionExecutor;
+
+template<typename T>
+concept CastExecutor =
+    std::is_same_v<T, UnaryFunctionExecutor> || std::is_same_v<T, CastChildFunctionExecutor>;
+
+struct CastFunction {
+    // This function is only used by expression binder when implicit cast is needed.
+    // The expression binder should consider reusing the existing matchFunction() API.
+    static bool hasImplicitCast(const common::LogicalType& srcType,
+        const common::LogicalType& dstType);
+
+    template<CastExecutor EXECUTOR = UnaryFunctionExecutor>
+    static std::unique_ptr<ScalarFunction> bindCastFunction(const std::string& functionName,
+        const common::LogicalType& sourceType, const common::LogicalType& targetType);
+};
+
+struct CastToDateFunction {
+    static constexpr const char* name = "TO_DATE";
+
+    static function_set getFunctionSet();
+};
+
+struct DateFunction {
+    using alias = CastToDateFunction;
+
+    static constexpr const char* name = "DATE";
+};
+
+struct CastToTimestampFunction {
+    static constexpr const char* name = "TIMESTAMP";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToIntervalFunction {
+    static constexpr const char* name = "TO_INTERVAL";
+
+    static function_set getFunctionSet();
+};
+
+struct IntervalFunctionAlias {
+    using alias = CastToIntervalFunction;
+
+    static constexpr const char* name = "INTERVAL";
+};
+
+struct DurationFunction {
+    using alias = CastToIntervalFunction;
+
+    static constexpr const char* name = "DURATION";
+};
+
+struct CastToStringFunction {
+    static constexpr const char* name = "TO_STRING";
+
+    static function_set getFunctionSet();
+};
+
+struct StringFunction {
+    using alias = CastToStringFunction;
+
+    static constexpr const char* name = "STRING";
+};
+
+struct CastToBlobFunction {
+    static constexpr const char* name = "TO_BLOB";
+
+    static function_set getFunctionSet();
+};
+
+struct BlobFunction {
+    using alias = CastToBlobFunction;
+
+    static constexpr const char* name = "BLOB";
+};
+
+struct CastToUUIDFunction {
+    static constexpr const char* name = "TO_UUID";
+
+    static function_set getFunctionSet();
+};
+
+struct UUIDFunction {
+    using alias = CastToUUIDFunction;
+
+    static constexpr const char* name = "UUID";
+};
+
+struct CastToBoolFunction {
+    static constexpr const char* name = "TO_BOOL";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToDoubleFunction {
+    static constexpr const char* name = "TO_DOUBLE";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToFloatFunction {
+    static constexpr const char* name = "TO_FLOAT";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToSerialFunction {
+    static constexpr const char* name = "TO_SERIAL";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToInt128Function {
+    static constexpr const char* name = "TO_INT128";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToInt64Function {
+    static constexpr const char* name = "TO_INT64";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToInt32Function {
+    static constexpr const char* name = "TO_INT32";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToInt16Function {
+    static constexpr const char* name = "TO_INT16";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToInt8Function {
+    static constexpr const char* name = "TO_INT8";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToUInt128Function {
+    static constexpr const char* name = "TO_UINT128";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToUInt64Function {
+    static constexpr const char* name = "TO_UINT64";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToUInt32Function {
+    static constexpr const char* name = "TO_UINT32";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToUInt16Function {
+    static constexpr const char* name = "TO_UINT16";
+
+    static function_set getFunctionSet();
+};
+
+struct CastToUInt8Function {
+    static constexpr const char* name = "TO_UINT8";
+
+    static function_set getFunctionSet();
+};
+
+struct CastAnyFunction {
+    static constexpr const char* name = "CAST";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/comparison/comparison_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/comparison/comparison_functions.h
new file mode 100644
index 0000000000..ec6a4df4ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/comparison/comparison_functions.h
@@ -0,0 +1,120 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct Equals {
+    template<class A, class B>
+    static inline void operation(const A& left, const B& right, uint8_t& result,
+        common::ValueVector* /*leftVector*/, common::ValueVector* /*rightVector*/) {
+        result = left == right;
+    }
+
+    template<class T>
+    static bool operation(const T& left, const T& right) {
+        uint8_t result = 0;
+        operation<T>(left, right, result, nullptr, nullptr);
+        return result;
+    }
+};
+
+struct NotEquals {
+    template<class A, class B>
+    static inline void operation(const A& left, const B& right, uint8_t& result,
+        common::ValueVector* leftVector, common::ValueVector* rightVector) {
+        Equals::operation(left, right, result, leftVector, rightVector);
+        result = !result;
+    }
+
+    template<class T>
+    static bool operation(const T& left, const T& right) {
+        uint8_t result = 0;
+        operation<T>(left, right, result, nullptr, nullptr);
+        return result;
+    }
+};
+
+struct GreaterThan {
+    template<class A, class B>
+    static inline void operation(const A& left, const B& right, uint8_t& result,
+        common::ValueVector* /*leftVector*/, common::ValueVector* /*rightVector*/) {
+        result = left > right;
+    }
+
+    template<class T>
+    static bool operation(const T& left, const T& right) {
+        uint8_t result = 0;
+        operation<T>(left, right, result, nullptr, nullptr);
+        return result;
+    }
+};
+
+struct GreaterThanEquals {
+    template<class A, class B>
+    static inline void operation(const A& left, const B& right, uint8_t& result,
+        common::ValueVector* leftVector, common::ValueVector* rightVector) {
+        uint8_t isGreater = 0;
+        uint8_t isEqual = 0;
+        GreaterThan::operation(left, right, isGreater, leftVector, rightVector);
+        Equals::operation(left, right, isEqual, leftVector, rightVector);
+        result = isGreater || isEqual;
+    }
+
+    template<class T>
+    static bool operation(const T& left, const T& right) {
+        uint8_t result = 0;
+        operation<T>(left, right, result, nullptr, nullptr);
+        return result;
+    }
+};
+
+struct LessThan {
+    template<class A, class B>
+    static inline void operation(const A& left, const B& right, uint8_t& result,
+        common::ValueVector* leftVector, common::ValueVector* rightVector) {
+        GreaterThanEquals::operation(left, right, result, leftVector, rightVector);
+        result = !result;
+    }
+
+    template<class T>
+    static bool operation(const T& left, const T& right) {
+        uint8_t result = 0;
+        operation<T>(left, right, result, nullptr, nullptr);
+        return result;
+    }
+};
+
+struct LessThanEquals {
+    template<class A, class B>
+    static inline void operation(const A& left, const B& right, uint8_t& result,
+        common::ValueVector* leftVector, common::ValueVector* rightVector) {
+        GreaterThan::operation(left, right, result, leftVector, rightVector);
+        result = !result;
+    }
+
+    template<class T>
+    static bool operation(const T& left, const T& right) {
+        uint8_t result = 0;
+        operation<T>(left, right, result, nullptr, nullptr);
+        return result;
+    }
+};
+
+// specialization for equal and greater than.
+template<>
+void Equals::operation(const common::list_entry_t& left, const common::list_entry_t& right,
+    uint8_t& result, common::ValueVector* leftVector, common::ValueVector* rightVector);
+template<>
+void Equals::operation(const common::struct_entry_t& left, const common::struct_entry_t& right,
+    uint8_t& result, common::ValueVector* leftVector, common::ValueVector* rightVector);
+template<>
+void GreaterThan::operation(const common::list_entry_t& left, const common::list_entry_t& right,
+    uint8_t& result, common::ValueVector* leftVector, common::ValueVector* rightVector);
+template<>
+void GreaterThan::operation(const common::struct_entry_t& left, const common::struct_entry_t& right,
+    uint8_t& result, common::ValueVector* leftVector, common::ValueVector* rightVector);
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/comparison/vector_comparison_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/comparison/vector_comparison_functions.h
new file mode 100644
index 0000000000..54024f1d48
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/comparison/vector_comparison_functions.h
@@ -0,0 +1,272 @@
+#pragma once
+
+#include "common/exception/runtime.h"
+#include "common/types/int128_t.h"
+#include "common/types/interval_t.h"
+#include "common/types/uint128_t.h"
+#include "comparison_functions.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+struct ComparisonFunction {
+    template<typename OP>
+    static function_set getFunctionSet(const std::string& name) {
+        function_set functionSet;
+        for (auto& comparableType : common::LogicalTypeUtils::getAllValidLogicTypeIDs()) {
+            functionSet.push_back(getFunction<OP>(name, comparableType, comparableType));
+        }
+        functionSet.push_back(getDecimalCompare<OP>(name));
+        return functionSet;
+    }
+
+private:
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void BinaryComparisonExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr = nullptr) {
+        KU_ASSERT(params.size() == 2);
+        BinaryFunctionExecutor::executeSwitch<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC,
+            BinaryComparisonFunctionWrapper>(*params[0], paramSelVectors[0], *params[1],
+            paramSelVectors[1], result, resultSelVector, dataPtr);
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename FUNC>
+    static bool BinaryComparisonSelectFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        common::SelectionVector& selVector, void* dataPtr = nullptr) {
+        KU_ASSERT(params.size() == 2);
+        return BinaryFunctionExecutor::selectComparison<LEFT_TYPE, RIGHT_TYPE, FUNC>(*params[0],
+            *params[1], selVector, dataPtr);
+    }
+
+    template<typename FUNC>
+    static std::unique_ptr<ScalarFunction> getFunction(const std::string& name,
+        common::LogicalTypeID leftType, common::LogicalTypeID rightType) {
+        auto leftPhysical = common::LogicalType::getPhysicalType(leftType);
+        auto rightPhysical = common::LogicalType::getPhysicalType(rightType);
+        scalar_func_exec_t execFunc;
+        getExecFunc<FUNC>(leftPhysical, rightPhysical, execFunc);
+        scalar_func_select_t selectFunc;
+        getSelectFunc<FUNC>(leftPhysical, rightPhysical, selectFunc);
+        return std::make_unique<ScalarFunction>(name,
+            std::vector<common::LogicalTypeID>{leftType, rightType}, common::LogicalTypeID::BOOL,
+            execFunc, selectFunc);
+    }
+
+    template<typename FUNC>
+    static std::unique_ptr<FunctionBindData> bindDecimalCompare(ScalarBindFuncInput bindInput) {
+        auto func = bindInput.definition->ptrCast<ScalarFunction>();
+        // assumes input types are identical
+        auto physicalType = bindInput.arguments[0]->dataType.getPhysicalType();
+        getExecFunc<FUNC>(physicalType, physicalType, func->execFunc);
+        getSelectFunc<FUNC>(physicalType, physicalType, func->selectFunc);
+        return nullptr;
+    }
+
+    template<typename FUNC>
+    static std::unique_ptr<ScalarFunction> getDecimalCompare(const std::string& name) {
+        scalar_bind_func bindFunc = bindDecimalCompare<FUNC>;
+        auto func = std::make_unique<ScalarFunction>(name,
+            std::vector<common::LogicalTypeID>{common::LogicalTypeID::DECIMAL,
+                common::LogicalTypeID::DECIMAL},
+            common::LogicalTypeID::BOOL); // necessary because decimal physical type is not known
+                                          // from the ID
+        func->bindFunc = bindFunc;
+        return func;
+    }
+
+    // When comparing two values, we guarantee that they must have the same dataType. So we only
+    // need to switch the physical type to get the corresponding exec function.
+    template<typename FUNC>
+    static void getExecFunc(common::PhysicalTypeID leftType, common::PhysicalTypeID rightType,
+        scalar_func_exec_t& func) {
+        switch (leftType) {
+        case common::PhysicalTypeID::INT64: {
+            func = BinaryComparisonExecFunction<int64_t, int64_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INT32: {
+            func = BinaryComparisonExecFunction<int32_t, int32_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INT16: {
+            func = BinaryComparisonExecFunction<int16_t, int16_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INT8: {
+            func = BinaryComparisonExecFunction<int8_t, int8_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT64: {
+            func = BinaryComparisonExecFunction<uint64_t, uint64_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT32: {
+            func = BinaryComparisonExecFunction<uint32_t, uint32_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT16: {
+            func = BinaryComparisonExecFunction<uint16_t, uint16_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT8: {
+            func = BinaryComparisonExecFunction<uint8_t, uint8_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INT128: {
+            func = BinaryComparisonExecFunction<common::int128_t, common::int128_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::DOUBLE: {
+            func = BinaryComparisonExecFunction<double, double, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::FLOAT: {
+            func = BinaryComparisonExecFunction<float, float, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::BOOL: {
+            func = BinaryComparisonExecFunction<uint8_t, uint8_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::STRING: {
+            func = BinaryComparisonExecFunction<common::ku_string_t, common::ku_string_t, uint8_t,
+                FUNC>;
+        } break;
+        case common::PhysicalTypeID::INTERNAL_ID: {
+            func = BinaryComparisonExecFunction<common::nodeID_t, common::nodeID_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT128: {
+            func =
+                BinaryComparisonExecFunction<common::uint128_t, common::uint128_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INTERVAL: {
+            func =
+                BinaryComparisonExecFunction<common::interval_t, common::interval_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::ARRAY:
+        case common::PhysicalTypeID::LIST: {
+            func = BinaryComparisonExecFunction<common::list_entry_t, common::list_entry_t, uint8_t,
+                FUNC>;
+        } break;
+        case common::PhysicalTypeID::STRUCT: {
+            func = BinaryComparisonExecFunction<common::struct_entry_t, common::struct_entry_t,
+                uint8_t, FUNC>;
+        } break;
+        default:
+            throw common::RuntimeException(
+                "Invalid input data types(" + common::PhysicalTypeUtils::toString(leftType) + "," +
+                common::PhysicalTypeUtils::toString(rightType) + ") for getExecFunc.");
+        }
+    }
+
+    template<typename FUNC>
+    static void getSelectFunc(common::PhysicalTypeID leftTypeID, common::PhysicalTypeID rightTypeID,
+        scalar_func_select_t& func) {
+        KU_ASSERT(leftTypeID == rightTypeID);
+        switch (leftTypeID) {
+        case common::PhysicalTypeID::INT64: {
+            func = BinaryComparisonSelectFunction<int64_t, int64_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INT32: {
+            func = BinaryComparisonSelectFunction<int32_t, int32_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INT16: {
+            func = BinaryComparisonSelectFunction<int16_t, int16_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INT8: {
+            func = BinaryComparisonSelectFunction<int8_t, int8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT64: {
+            func = BinaryComparisonSelectFunction<uint64_t, uint64_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT32: {
+            func = BinaryComparisonSelectFunction<uint32_t, uint32_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT16: {
+            func = BinaryComparisonSelectFunction<uint16_t, uint16_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT8: {
+            func = BinaryComparisonSelectFunction<uint8_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INT128: {
+            func = BinaryComparisonSelectFunction<common::int128_t, common::int128_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::DOUBLE: {
+            func = BinaryComparisonSelectFunction<double, double, FUNC>;
+        } break;
+        case common::PhysicalTypeID::FLOAT: {
+            func = BinaryComparisonSelectFunction<float, float, FUNC>;
+        } break;
+        case common::PhysicalTypeID::BOOL: {
+            func = BinaryComparisonSelectFunction<uint8_t, uint8_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::STRING: {
+            func = BinaryComparisonSelectFunction<common::ku_string_t, common::ku_string_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INTERNAL_ID: {
+            func = BinaryComparisonSelectFunction<common::nodeID_t, common::nodeID_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::UINT128: {
+            func = BinaryComparisonSelectFunction<common::uint128_t, common::uint128_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::INTERVAL: {
+            func = BinaryComparisonSelectFunction<common::interval_t, common::interval_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::ARRAY:
+        case common::PhysicalTypeID::LIST: {
+            func = BinaryComparisonSelectFunction<common::list_entry_t, common::list_entry_t, FUNC>;
+        } break;
+        case common::PhysicalTypeID::STRUCT: {
+            func = BinaryComparisonSelectFunction<common::struct_entry_t, common::struct_entry_t,
+                FUNC>;
+        } break;
+        default:
+            throw common::RuntimeException(
+                "Invalid input data types(" + common::PhysicalTypeUtils::toString(leftTypeID) +
+                "," + common::PhysicalTypeUtils::toString(rightTypeID) + ") for getSelectFunc.");
+        }
+    }
+};
+
+struct EqualsFunction {
+    static constexpr const char* name = "EQUALS";
+
+    static function_set getFunctionSet() {
+        return ComparisonFunction::getFunctionSet<Equals>(name);
+    }
+};
+
+struct NotEqualsFunction {
+    static constexpr const char* name = "NOT_EQUALS";
+
+    static function_set getFunctionSet() {
+        return ComparisonFunction::getFunctionSet<NotEquals>(name);
+    }
+};
+
+struct GreaterThanFunction {
+    static constexpr const char* name = "GREATER_THAN";
+
+    static function_set getFunctionSet() {
+        return ComparisonFunction::getFunctionSet<GreaterThan>(name);
+    }
+};
+
+struct GreaterThanEqualsFunction {
+    static constexpr const char* name = "GREATER_THAN_EQUALS";
+
+    static function_set getFunctionSet() {
+        return ComparisonFunction::getFunctionSet<GreaterThanEquals>(name);
+    }
+};
+
+struct LessThanFunction {
+    static constexpr const char* name = "LESS_THAN";
+
+    static function_set getFunctionSet() {
+        return ComparisonFunction::getFunctionSet<LessThan>(name);
+    }
+};
+
+struct LessThanEqualsFunction {
+    static constexpr const char* name = "LESS_THAN_EQUALS";
+
+    static function_set getFunctionSet() {
+        return ComparisonFunction::getFunctionSet<LessThanEquals>(name);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/const_function_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/const_function_executor.h
new file mode 100644
index 0000000000..25e04f415e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/const_function_executor.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct ConstFunctionExecutor {
+
+    template<typename RESULT_TYPE, typename OP>
+    static void execute(common::ValueVector& result, common::SelectionVector& sel) {
+        KU_ASSERT(result.state->isFlat());
+        auto resultValues = (RESULT_TYPE*)result.getData();
+        auto idx = sel[0];
+        KU_ASSERT(idx == 0);
+        OP::operation(resultValues[idx]);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/date/date_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/date/date_functions.h
new file mode 100644
index 0000000000..62689f6ad5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/date/date_functions.h
@@ -0,0 +1,162 @@
+#pragma once
+
+#include "common/assert.h"
+#include "common/types/date_t.h"
+#include "common/types/ku_string.h"
+#include "common/types/timestamp_t.h"
+
+namespace lbug {
+namespace function {
+
+struct DayName {
+    template<class T>
+    static inline void operation(T& /*input*/, common::ku_string_t& /*result*/) {
+        KU_UNREACHABLE;
+    }
+};
+
+template<>
+inline void DayName::operation(common::date_t& input, common::ku_string_t& result) {
+    std::string dayName = common::Date::getDayName(input);
+    result.set(dayName);
+}
+
+template<>
+inline void DayName::operation(common::timestamp_t& input, common::ku_string_t& result) {
+    common::dtime_t time{};
+    common::date_t date{};
+    common::Timestamp::convert(input, date, time);
+    std::string dayName = common::Date::getDayName(date);
+    result.set(dayName);
+}
+
+struct MonthName {
+    template<class T>
+    static inline void operation(T& /*input*/, common::ku_string_t& /*result*/) {
+        KU_UNREACHABLE;
+    }
+};
+
+template<>
+inline void MonthName::operation(common::date_t& input, common::ku_string_t& result) {
+    std::string monthName = common::Date::getMonthName(input);
+    result.set(monthName);
+}
+
+template<>
+inline void MonthName::operation(common::timestamp_t& input, common::ku_string_t& result) {
+    common::dtime_t time{};
+    common::date_t date{};
+    common::Timestamp::convert(input, date, time);
+    std::string monthName = common::Date::getMonthName(date);
+    result.set(monthName);
+}
+
+struct LastDay {
+    template<class T>
+
+    static inline void operation(T& /*input*/, common::date_t& /*result*/) {
+        KU_UNREACHABLE;
+    }
+};
+
+template<>
+inline void LastDay::operation(common::date_t& input, common::date_t& result) {
+    result = common::Date::getLastDay(input);
+}
+
+template<>
+inline void LastDay::operation(common::timestamp_t& input, common::date_t& result) {
+    common::date_t date{};
+    common::dtime_t time{};
+    common::Timestamp::convert(input, date, time);
+    result = common::Date::getLastDay(date);
+}
+
+struct DatePart {
+    template<class LEFT_TYPE, class RIGHT_TYPE>
+    static inline void operation(LEFT_TYPE& /*partSpecifier*/, RIGHT_TYPE& /*input*/,
+        int64_t& /*result*/) {
+        KU_UNREACHABLE;
+    }
+};
+
+template<>
+inline void DatePart::operation(common::ku_string_t& partSpecifier, common::date_t& input,
+    int64_t& result) {
+    common::DatePartSpecifier specifier{};
+    common::Interval::tryGetDatePartSpecifier(partSpecifier.getAsString(), specifier);
+    result = common::Date::getDatePart(specifier, input);
+}
+
+template<>
+inline void DatePart::operation(common::ku_string_t& partSpecifier, common::timestamp_t& input,
+    int64_t& result) {
+    common::DatePartSpecifier specifier{};
+    common::Interval::tryGetDatePartSpecifier(partSpecifier.getAsString(), specifier);
+    result = common::Timestamp::getTimestampPart(specifier, input);
+}
+
+template<>
+inline void DatePart::operation(common::ku_string_t& partSpecifier, common::interval_t& input,
+    int64_t& result) {
+    common::DatePartSpecifier specifier{};
+    common::Interval::tryGetDatePartSpecifier(partSpecifier.getAsString(), specifier);
+    result = common::Interval::getIntervalPart(specifier, input);
+}
+
+struct DateTrunc {
+    template<class LEFT_TYPE, class RIGHT_TYPE>
+    static inline void operation(LEFT_TYPE& /*partSpecifier*/, RIGHT_TYPE& /*input*/,
+        RIGHT_TYPE& /*result*/) {
+        KU_UNREACHABLE;
+    }
+};
+
+template<>
+inline void DateTrunc::operation(common::ku_string_t& partSpecifier, common::date_t& input,
+    common::date_t& result) {
+    common::DatePartSpecifier specifier{};
+    common::Interval::tryGetDatePartSpecifier(partSpecifier.getAsString(), specifier);
+    result = common::Date::trunc(specifier, input);
+}
+
+template<>
+inline void DateTrunc::operation(common::ku_string_t& partSpecifier, common::timestamp_t& input,
+    common::timestamp_t& result) {
+    common::DatePartSpecifier specifier{};
+    common::Interval::tryGetDatePartSpecifier(partSpecifier.getAsString(), specifier);
+    result = common::Timestamp::trunc(specifier, input);
+}
+
+struct Greatest {
+    template<class T>
+    static inline void operation(T& left, T& right, T& result) {
+        result = left > right ? left : right;
+    }
+};
+
+struct Least {
+    template<class T>
+    static inline void operation(T& left, T& right, T& result) {
+        result = left > right ? right : left;
+    }
+};
+
+struct MakeDate {
+    static inline void operation(int64_t& year, int64_t& month, int64_t& day,
+        common::date_t& result) {
+        result = common::Date::fromDate(year, month, day);
+    }
+};
+
+struct CurrentDate {
+    static void operation(common::date_t& result, void* dataPtr);
+};
+
+struct CurrentTimestamp {
+    static void operation(common::timestamp_tz_t& result, void* dataPtr);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/date/vector_date_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/date/vector_date_functions.h
new file mode 100644
index 0000000000..292257b1d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/date/vector_date_functions.h
@@ -0,0 +1,81 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct DatePartFunction {
+    static constexpr const char* name = "DATE_PART";
+
+    static function_set getFunctionSet();
+};
+
+struct DatePartFunctionAlias {
+    using alias = DatePartFunction;
+
+    static constexpr const char* name = "DATEPART";
+};
+
+struct DateTruncFunction {
+    static constexpr const char* name = "DATE_TRUNC";
+
+    static function_set getFunctionSet();
+};
+
+struct DateTruncFunctionAlias {
+    using alias = DateTruncFunction;
+
+    static constexpr const char* name = "DATETRUNC";
+};
+
+struct DayNameFunction {
+    static constexpr const char* name = "DAYNAME";
+
+    static function_set getFunctionSet();
+};
+
+struct GreatestFunction {
+    static constexpr const char* name = "GREATEST";
+
+    static function_set getFunctionSet();
+};
+
+struct LastDayFunction {
+    static constexpr const char* name = "LAST_DAY";
+
+    static function_set getFunctionSet();
+};
+
+struct LeastFunction {
+    static constexpr const char* name = "LEAST";
+
+    static function_set getFunctionSet();
+};
+
+struct MakeDateFunction {
+    static constexpr const char* name = "MAKE_DATE";
+
+    static function_set getFunctionSet();
+};
+
+struct MonthNameFunction {
+    static constexpr const char* name = "MONTHNAME";
+
+    static function_set getFunctionSet();
+};
+
+struct CurrentDateFunction {
+    static constexpr const char* name = "CURRENT_DATE";
+
+    static function_set getFunctionSet();
+};
+
+struct CurrentTimestampFunction {
+    static constexpr const char* name = "CURRENT_TIMESTAMP";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/export/export_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/export/export_function.h
new file mode 100644
index 0000000000..7099d82bef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/export/export_function.h
@@ -0,0 +1,108 @@
+#pragma once
+
+#include <atomic>
+
+#include "common/case_insensitive_map.h"
+#include "common/types/value/value.h"
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct ExportFuncLocalState {
+    virtual ~ExportFuncLocalState() = default;
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+};
+
+struct ExportFuncBindData;
+
+struct ExportFuncSharedState {
+    virtual ~ExportFuncSharedState() = default;
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+    virtual void init(main::ClientContext& context, const ExportFuncBindData& bindData) = 0;
+
+    std::atomic<bool> parallelFlag = true;
+};
+
+struct ExportFuncBindData {
+    std::vector<std::string> columnNames;
+    std::vector<common::LogicalType> types;
+    std::string fileName;
+
+    ExportFuncBindData(std::vector<std::string> columnNames, std::string fileName)
+        : columnNames{std::move(columnNames)}, fileName{std::move(fileName)} {}
+
+    virtual ~ExportFuncBindData() = default;
+
+    void setDataType(std::vector<common::LogicalType> types_) { types = std::move(types_); }
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+    virtual std::unique_ptr<ExportFuncBindData> copy() const = 0;
+};
+
+struct ExportFuncBindInput {
+    std::vector<std::string> columnNames;
+    std::string filePath;
+    common::case_insensitive_map_t<common::Value> parsingOptions;
+};
+
+using export_bind_t =
+    std::function<std::unique_ptr<ExportFuncBindData>(function::ExportFuncBindInput& bindInput)>;
+using export_init_local_t = std::function<std::unique_ptr<ExportFuncLocalState>(
+    main::ClientContext&, const ExportFuncBindData&, std::vector<bool>)>;
+using export_create_shared_t = std::function<std::shared_ptr<ExportFuncSharedState>()>;
+using export_init_shared_t =
+    std::function<void(ExportFuncSharedState&, main::ClientContext&, ExportFuncBindData&)>;
+using export_sink_t = std::function<void(ExportFuncSharedState&, ExportFuncLocalState&,
+    const ExportFuncBindData&, std::vector<std::shared_ptr<common::ValueVector>>)>;
+using export_combine_t = std::function<void(ExportFuncSharedState&, ExportFuncLocalState&)>;
+using export_finalize_t = std::function<void(ExportFuncSharedState&)>;
+
+struct LBUG_API ExportFunction : public Function {
+    ExportFunction() = default;
+    explicit ExportFunction(std::string name) : Function{std::move(name), {}} {}
+
+    ExportFunction(std::string name, export_init_local_t initLocal,
+        export_create_shared_t createShared, export_init_shared_t initShared,
+        export_sink_t copyToSink, export_combine_t copyToCombine, export_finalize_t copyToFinalize)
+        : Function{std::move(name), {}}, initLocalState{std::move(initLocal)},
+          createSharedState{std::move(createShared)}, initSharedState{std::move(initShared)},
+          sink{std::move(copyToSink)}, combine{std::move(copyToCombine)},
+          finalize{std::move(copyToFinalize)} {}
+
+    export_bind_t bind;
+    export_init_local_t initLocalState;
+    export_create_shared_t createSharedState;
+    export_init_shared_t initSharedState;
+    export_sink_t sink;
+    export_combine_t combine;
+    export_finalize_t finalize;
+};
+
+struct ExportCSVFunction : public ExportFunction {
+    static constexpr const char* name = "COPY_CSV";
+
+    static function_set getFunctionSet();
+};
+
+struct ExportParquetFunction : public ExportFunction {
+    static constexpr const char* name = "COPY_PARQUET";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/function.h
new file mode 100644
index 0000000000..0c25a21a59
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/function.h
@@ -0,0 +1,108 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/api.h"
+
+namespace lbug {
+
+namespace main {
+class ClientContext;
+}
+
+namespace function {
+
+struct LBUG_API FunctionBindData {
+    std::vector<common::LogicalType> paramTypes;
+    common::LogicalType resultType;
+    // TODO: the following two fields should be moved to FunctionLocalState.
+    main::ClientContext* clientContext;
+    int64_t count;
+
+    explicit FunctionBindData(common::LogicalType dataType)
+        : resultType{std::move(dataType)}, clientContext{nullptr}, count{1} {}
+    FunctionBindData(std::vector<common::LogicalType> paramTypes, common::LogicalType resultType)
+        : paramTypes{std::move(paramTypes)}, resultType{std::move(resultType)},
+          clientContext{nullptr}, count{1} {}
+    DELETE_COPY_AND_MOVE(FunctionBindData);
+    virtual ~FunctionBindData() = default;
+
+    static std::unique_ptr<FunctionBindData> getSimpleBindData(
+        const binder::expression_vector& params, const common::LogicalType& resultType);
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+    virtual std::unique_ptr<FunctionBindData> copy() const {
+        return std::make_unique<FunctionBindData>(common::LogicalType::copy(paramTypes),
+            resultType.copy());
+    }
+};
+
+struct Function;
+using function_set = std::vector<std::unique_ptr<Function>>;
+
+struct ScalarBindFuncInput {
+    const binder::expression_vector& arguments;
+    Function* definition;
+    main::ClientContext* context;
+    std::vector<std::string> optionalArguments;
+
+    ScalarBindFuncInput(const binder::expression_vector& arguments, Function* definition,
+        main::ClientContext* context, std::vector<std::string> optionalArguments)
+        : arguments{arguments}, definition{definition}, context{context},
+          optionalArguments{std::move(optionalArguments)} {}
+};
+
+using scalar_bind_func =
+    std::function<std::unique_ptr<FunctionBindData>(const ScalarBindFuncInput& bindInput)>;
+
+struct LBUG_API Function {
+    std::string name;
+    std::vector<common::LogicalTypeID> parameterTypeIDs;
+    bool isReadOnly = true;
+
+    Function() : isReadOnly{true} {};
+    Function(std::string name, std::vector<common::LogicalTypeID> parameterTypeIDs)
+        : name{std::move(name)}, parameterTypeIDs{std::move(parameterTypeIDs)} {}
+    Function(const Function&) = default;
+
+    virtual ~Function() = default;
+
+    virtual std::string signatureToString() const {
+        return common::LogicalTypeUtils::toString(parameterTypeIDs);
+    }
+
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+};
+
+struct ScalarOrAggregateFunction : Function {
+    common::LogicalTypeID returnTypeID = common::LogicalTypeID::ANY;
+    scalar_bind_func bindFunc = nullptr;
+
+    ScalarOrAggregateFunction() : Function{} {}
+    ScalarOrAggregateFunction(std::string name, std::vector<common::LogicalTypeID> parameterTypeIDs,
+        common::LogicalTypeID returnTypeID)
+        : Function{std::move(name), std::move(parameterTypeIDs)}, returnTypeID{returnTypeID} {}
+    ScalarOrAggregateFunction(std::string name, std::vector<common::LogicalTypeID> parameterTypeIDs,
+        common::LogicalTypeID returnTypeID, scalar_bind_func bindFunc)
+        : Function{std::move(name), std::move(parameterTypeIDs)}, returnTypeID{returnTypeID},
+          bindFunc{std::move(bindFunc)} {}
+
+    std::string signatureToString() const override {
+        auto result = Function::signatureToString();
+        result += " -> " + common::LogicalTypeUtils::toString(returnTypeID);
+        return result;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/function_collection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/function_collection.h
new file mode 100644
index 0000000000..0f82645a47
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/function_collection.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "catalog/catalog_entry/catalog_entry_type.h"
+#include "function.h"
+
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace function {
+
+using get_function_set_fun = std::function<function_set()>;
+
+struct FunctionCollection {
+    get_function_set_fun getFunctionSetFunc;
+
+    const char* name;
+
+    CatalogEntryType catalogEntryType;
+
+    static FunctionCollection* getFunctions();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/auxiliary_state/gds_auxilary_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/auxiliary_state/gds_auxilary_state.h
new file mode 100644
index 0000000000..da3894d480
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/auxiliary_state/gds_auxilary_state.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include "common/cast.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace graph {
+class Graph;
+}
+
+namespace processor {
+struct ExecutionContext;
+}
+
+namespace function {
+
+// Maintain algorithm specific data structures
+class GDSAuxiliaryState {
+public:
+    GDSAuxiliaryState() = default;
+    virtual ~GDSAuxiliaryState() = default;
+
+    // Initialize state for source node.
+    virtual void initSource(common::nodeID_t) {}
+    // Initialize state before extending from `fromTable` to `toTable`.
+    // Normally you want to pin data structures on `toTableID`.
+    virtual void beginFrontierCompute(common::table_id_t fromTableID,
+        common::table_id_t toTableID) = 0;
+
+    virtual void switchToDense(processor::ExecutionContext* context, graph::Graph* graph) = 0;
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+};
+
+class EmptyGDSAuxiliaryState : public GDSAuxiliaryState {
+public:
+    EmptyGDSAuxiliaryState() = default;
+
+    void beginFrontierCompute(common::table_id_t, common::table_id_t) override {}
+
+    void switchToDense(processor::ExecutionContext*, graph::Graph*) override {}
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/auxiliary_state/path_auxiliary_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/auxiliary_state/path_auxiliary_state.h
new file mode 100644
index 0000000000..f5e38fa30a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/auxiliary_state/path_auxiliary_state.h
@@ -0,0 +1,55 @@
+#pragma once
+
+#include "function/gds/bfs_graph.h"
+#include "gds_auxilary_state.h"
+
+namespace lbug {
+namespace function {
+
+class PathAuxiliaryState : public GDSAuxiliaryState {
+public:
+    explicit PathAuxiliaryState(std::unique_ptr<BFSGraphManager> bfsGraphManager)
+        : bfsGraphManager{std::move(bfsGraphManager)} {}
+
+    BFSGraphManager* getBFSGraphManager() { return bfsGraphManager.get(); }
+
+    void beginFrontierCompute(common::table_id_t, common::table_id_t toTableID) override {
+        bfsGraphManager->getCurrentGraph()->pinTableID(toTableID);
+    }
+
+    void switchToDense(processor::ExecutionContext* context, graph::Graph* graph) override {
+        bfsGraphManager->switchToDense(context, graph);
+    }
+
+private:
+    std::unique_ptr<BFSGraphManager> bfsGraphManager;
+};
+
+class WSPPathsAuxiliaryState : public GDSAuxiliaryState {
+public:
+    explicit WSPPathsAuxiliaryState(std::unique_ptr<BFSGraphManager> bfsGraphManager)
+        : bfsGraphManager{std::move(bfsGraphManager)} {}
+
+    BFSGraphManager* getBFSGraphManager() { return bfsGraphManager.get(); }
+
+    void initSource(common::nodeID_t sourceNodeID) override {
+        sourceParent.setCost(0);
+        bfsGraphManager->getCurrentGraph()->pinTableID(sourceNodeID.tableID);
+        bfsGraphManager->getCurrentGraph()->setParentList(sourceNodeID.offset, &sourceParent);
+    }
+
+    void beginFrontierCompute(common::table_id_t, common::table_id_t toTableID) override {
+        bfsGraphManager->getCurrentGraph()->pinTableID(toTableID);
+    }
+
+    void switchToDense(processor::ExecutionContext* context, graph::Graph* graph) override {
+        bfsGraphManager->switchToDense(context, graph);
+    }
+
+private:
+    std::unique_ptr<BFSGraphManager> bfsGraphManager;
+    ParentList sourceParent;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/bfs_graph.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/bfs_graph.h
new file mode 100644
index 0000000000..ca51f2a306
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/bfs_graph.h
@@ -0,0 +1,183 @@
+#pragma once
+
+#include "density_state.h"
+#include "gds_object_manager.h"
+#include "graph/graph.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+}
+namespace processor {
+struct ExecutionContext;
+}
+namespace function {
+
+// TODO(Xiyang): optimize if edgeID is not needed.
+class ParentList {
+public:
+    void setNbrInfo(common::nodeID_t nodeID_, common::relID_t edgeID_, bool isFwd_) {
+        nodeID = nodeID_;
+        edgeID = edgeID_;
+        isFwd = isFwd_;
+    }
+    common::nodeID_t getNodeID() const { return nodeID; }
+    common::relID_t getEdgeID() const { return edgeID; }
+    bool isFwdEdge() const { return isFwd; }
+
+    void setNextPtr(ParentList* ptr) { next.store(ptr, std::memory_order_relaxed); }
+    ParentList* getNextPtr() { return next.load(std::memory_order_relaxed); }
+
+    void setIter(uint16_t iter_) { iter = iter_; }
+    uint16_t getIter() const { return iter; }
+
+    void setCost(double cost_) { cost = cost_; }
+    double getCost() const { return cost; }
+
+private:
+    common::nodeID_t nodeID;
+    common::relID_t edgeID;
+    bool isFwd = true;
+
+    uint16_t iter = UINT16_MAX;
+    double cost = std::numeric_limits<double>::max();
+    // Next pointer
+    std::atomic<ParentList*> next;
+};
+
+class BaseBFSGraph {
+    friend class BFSGraphManager;
+
+public:
+    explicit BaseBFSGraph(storage::MemoryManager* mm) : mm{mm} {}
+    virtual ~BaseBFSGraph() = default;
+
+    // This function should be called by a worker thread Ti to grab a block of memory that
+    // Ti owns and writes to.
+    ObjectBlock<ParentList>* addNewBlock();
+
+    virtual void pinTableID(common::table_id_t tableID) = 0;
+
+    // Used to track path for all shortest path & variable length path.
+    virtual void addParent(uint16_t iter, common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, ObjectBlock<ParentList>* block) = 0;
+    // Used to track path for single shortest path. Assume each offset has at most one parent.
+    virtual void addSingleParent(uint16_t iter, common::nodeID_t boundNodeID,
+        common::relID_t edgeID, common::nodeID_t nbrNodeID, bool fwdEdge,
+        ObjectBlock<ParentList>* block) = 0;
+    // Used to track path for all weighted shortest path.
+    virtual bool tryAddParentWithWeight(common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, double weight,
+        ObjectBlock<ParentList>* block) = 0;
+    // Used to track path for single weighted shortest path. Assume each offset has at most one
+    // parent.
+    virtual bool tryAddSingleParentWithWeight(common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, double weight,
+        ObjectBlock<ParentList>* block) = 0;
+
+    virtual ParentList* getParentListHead(common::offset_t offset) = 0;
+    virtual ParentList* getParentListHead(common::nodeID_t nodeID) = 0;
+
+    virtual void setParentList(common::offset_t offset, ParentList* parentList) = 0;
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+protected:
+    std::mutex mtx;
+    storage::MemoryManager* mm;
+    std::vector<std::unique_ptr<ObjectBlock<ParentList>>> blocks;
+};
+
+class DenseBFSGraph : public BaseBFSGraph {
+    friend class BFSGraphManager;
+    friend class BFSGraphInitVertexCompute;
+
+public:
+    DenseBFSGraph(storage::MemoryManager* mm, common::table_id_map_t<common::offset_t> maxOffsetMap)
+        : BaseBFSGraph{mm}, maxOffsetMap{std::move(maxOffsetMap)} {}
+
+    void init(processor::ExecutionContext* context, graph::Graph* graph);
+
+    void pinTableID(common::table_id_t tableID) override;
+
+    void addParent(uint16_t iter, common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, ObjectBlock<ParentList>* block) override;
+    void addSingleParent(uint16_t iter, common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, ObjectBlock<ParentList>* block) override;
+    bool tryAddParentWithWeight(common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, double weight,
+        ObjectBlock<ParentList>* block) override;
+    bool tryAddSingleParentWithWeight(common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, double weight,
+        ObjectBlock<ParentList>* block) override;
+
+    ParentList* getParentListHead(common::offset_t offset) override;
+    ParentList* getParentListHead(common::nodeID_t nodeID) override;
+
+    void setParentList(common::offset_t offset, ParentList* parentList) override;
+
+private:
+    common::table_id_map_t<common::offset_t> maxOffsetMap;
+    GDSDenseObjectManager<std::atomic<ParentList*>> denseObjects;
+    std::atomic<ParentList*>* curData = nullptr;
+};
+
+class SparseBFSGraph : public BaseBFSGraph {
+    friend class BFSGraphManager;
+
+public:
+    explicit SparseBFSGraph(storage::MemoryManager* mm,
+        common::table_id_map_t<common::offset_t> maxOffsetMap)
+        : BaseBFSGraph{mm}, sparseObjects{maxOffsetMap} {}
+
+    void pinTableID(common::table_id_t tableID) override;
+
+    void addParent(uint16_t iter, common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, ObjectBlock<ParentList>* block) override;
+    void addSingleParent(uint16_t iter, common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, ObjectBlock<ParentList>* block) override;
+    bool tryAddParentWithWeight(common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, double weight,
+        ObjectBlock<ParentList>* block) override;
+    bool tryAddSingleParentWithWeight(common::nodeID_t boundNodeID, common::relID_t edgeID,
+        common::nodeID_t nbrNodeID, bool fwdEdge, double weight,
+        ObjectBlock<ParentList>* block) override;
+
+    ParentList* getParentListHead(common::offset_t offset) override;
+    ParentList* getParentListHead(common::nodeID_t nodeID) override;
+
+    void setParentList(common::offset_t offset, ParentList* parentList) override;
+
+    const std::unordered_map<common::offset_t, ParentList*>& getCurrentData() const {
+        return *curData;
+    }
+
+private:
+    GDSSpareObjectManager<ParentList*> sparseObjects;
+    std::unordered_map<common::offset_t, ParentList*>* curData = nullptr;
+};
+
+class BFSGraphManager {
+public:
+    BFSGraphManager(common::table_id_map_t<common::offset_t> maxOffsetMap,
+        storage::MemoryManager* mm);
+
+    BaseBFSGraph* getCurrentGraph() const {
+        KU_ASSERT(curGraph);
+        return curGraph;
+    }
+
+    void switchToDense(processor::ExecutionContext* context, graph::Graph* graph);
+
+private:
+    GDSDensityState state = GDSDensityState::SPARSE;
+    std::unique_ptr<DenseBFSGraph> denseBFSGraph;
+    std::unique_ptr<SparseBFSGraph> sparseBFSGraph;
+    BaseBFSGraph* curGraph = nullptr;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/compute.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/compute.h
new file mode 100644
index 0000000000..41a00a85e4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/compute.h
@@ -0,0 +1,61 @@
+#pragma once
+
+#include "common/mask.h"
+#include "common/types/types.h"
+#include "graph/graph.h"
+
+namespace lbug {
+namespace function {
+
+/**
+ * Base interface for algorithms that can be implemented in Pregel-like vertex-centric manner or
+ * more specifically Ligra's edgeCompute (called edgeUpdate in Ligra paper) function. Intended to be
+ * passed to the helper functions in GDSUtils that parallelize such Pregel-like computations.
+ */
+class EdgeCompute {
+public:
+    virtual ~EdgeCompute() = default;
+
+    // Does any work that is needed while extending the (boundNodeID, nbrNodeID, edgeID) edge.
+    // boundNodeID is the nodeID that is in the current frontier and currently executing.
+    // Returns a list of neighbors which should be put in the next frontier.
+    // So if the implementing class has access to the next frontier as a field,
+    // **do not** call setActive. Helper functions in GDSUtils will do that work.
+    virtual std::vector<common::nodeID_t> edgeCompute(common::nodeID_t boundNodeID,
+        graph::NbrScanState::Chunk& results, bool fwdEdge) = 0;
+
+    virtual void resetSingleThreadState() {}
+
+    virtual bool terminate(common::NodeOffsetMaskMap&) { return false; }
+
+    virtual std::unique_ptr<EdgeCompute> copy() = 0;
+};
+
+class VertexCompute {
+public:
+    virtual ~VertexCompute() = default;
+
+    // This function is called once on the "main" copy of VertexCompute in the
+    // GDSUtils::runVertexCompute function. runVertexCompute loops through
+    // each node table T on the graph on which vertexCompute should run and then before
+    // parallelizing the computation on T calls this function.
+    virtual bool beginOnTable(common::table_id_t) { return true; }
+
+    // This function is called by each worker thread T on each node in the morsel that T grabs.
+    // Does any vertex-centric work that is needed while running on the curNodeID. This function
+    // should itself do the work of checking if any work should be done on the vertex or not. Note
+    // that this contrasts with how EdgeCompute::edgeCompute() should be implemented, where the
+    // GDSUtils helper functions call isActive on nodes to check if any work should be done for
+    // the edges of a node. Instead, here GDSUtils helper functions for VertexCompute blindly run
+    // the function on each node in a graph.
+    virtual void vertexCompute(const graph::VertexScanState::Chunk&) {}
+    virtual void vertexCompute(common::offset_t, common::offset_t, common::table_id_t) {}
+    // This function assumes the number of nodes is small (sparse) and morsel driven parallelism
+    // is not necessary. It should not be used in parallel computations.
+    virtual void vertexCompute(common::table_id_t) {}
+
+    virtual std::unique_ptr<VertexCompute> copy() = 0;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/density_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/density_state.h
new file mode 100644
index 0000000000..7b6be23279
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/density_state.h
@@ -0,0 +1,14 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace function {
+
+enum class GDSDensityState : uint8_t {
+    SPARSE = 0,
+    DENSE = 1,
+};
+
+}
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/frontier_morsel.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/frontier_morsel.h
new file mode 100644
index 0000000000..a1c43fa8dc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/frontier_morsel.h
@@ -0,0 +1,49 @@
+#pragma once
+
+#include <atomic>
+
+#include "common/types/types.h"
+
+namespace lbug {
+namespace function {
+
+class FrontierMorsel {
+public:
+    FrontierMorsel() = default;
+
+    common::offset_t getBeginOffset() const { return beginOffset; }
+    common::offset_t getEndOffset() const { return endOffset; }
+
+    void init(common::offset_t beginOffset_, common::offset_t endOffset_) {
+        beginOffset = beginOffset_;
+        endOffset = endOffset_;
+    }
+
+private:
+    common::offset_t beginOffset = common::INVALID_OFFSET;
+    common::offset_t endOffset = common::INVALID_OFFSET;
+};
+
+class LBUG_API FrontierMorselDispatcher {
+    static constexpr uint64_t MIN_FRONTIER_MORSEL_SIZE = 512;
+    // Note: MIN_NUMBER_OF_FRONTIER_MORSELS is the minimum number of morsels we aim to have but we
+    // can have fewer than this. See the beginFrontierComputeBetweenTables to see the actual
+    // morselSize computation for details.
+    static constexpr uint64_t MIN_NUMBER_OF_FRONTIER_MORSELS = 128;
+
+public:
+    explicit FrontierMorselDispatcher(uint64_t maxThreads);
+
+    void init(common::offset_t _maxOffset);
+
+    bool getNextRangeMorsel(FrontierMorsel& frontierMorsel);
+
+private:
+    common::offset_t maxOffset;
+    std::atomic<common::offset_t> nextOffset;
+    uint64_t maxThreads;
+    uint64_t morselSize;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds.h
new file mode 100644
index 0000000000..5db219bace
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds.h
@@ -0,0 +1,104 @@
+#pragma once
+
+#include "binder/expression/node_expression.h"
+#include "common/mask.h"
+#include "function/table/bind_data.h"
+#include "graph/graph.h"
+#include "graph/graph_entry.h"
+#include "graph/parsed_graph_entry.h"
+#include "processor/result/factorized_table_pool.h"
+
+namespace lbug {
+
+namespace main {
+class ClientContext;
+}
+
+namespace function {
+
+struct LBUG_API GDSConfig {
+    virtual ~GDSConfig() = default;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return *common::ku_dynamic_cast<const TARGET*>(this);
+    }
+};
+
+struct LBUG_API GDSBindData : public TableFuncBindData {
+    graph::NativeGraphEntry graphEntry;
+    binder::expression_vector output;
+
+    GDSBindData(binder::expression_vector columns, graph::NativeGraphEntry graphEntry,
+        binder::expression_vector output)
+        : TableFuncBindData{std::move(columns)}, graphEntry{graphEntry.copy()},
+          output{std::move(output)} {}
+
+    GDSBindData(const GDSBindData& other)
+        : TableFuncBindData{other}, graphEntry{other.graphEntry.copy()}, output{other.output},
+          resultTable{other.resultTable} {}
+
+    void setResultFTable(std::shared_ptr<processor::FactorizedTable> table) {
+        resultTable = std::move(table);
+    }
+    std::shared_ptr<processor::FactorizedTable> getResultTable() const { return resultTable; }
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<GDSBindData>(*this);
+    }
+
+private:
+    std::shared_ptr<processor::FactorizedTable> resultTable;
+};
+
+struct LBUG_API GDSFuncSharedState : public TableFuncSharedState {
+    std::unique_ptr<graph::Graph> graph;
+
+    GDSFuncSharedState(std::shared_ptr<processor::FactorizedTable> fTable,
+        std::unique_ptr<graph::Graph> graph)
+        : TableFuncSharedState{}, graph{std::move(graph)}, factorizedTablePool{std::move(fTable)} {}
+
+    void setGraphNodeMask(std::unique_ptr<common::NodeOffsetMaskMap> maskMap);
+    common::NodeOffsetMaskMap* getGraphNodeMaskMap() const { return graphNodeMask.get(); }
+
+public:
+    processor::FactorizedTablePool factorizedTablePool;
+
+private:
+    std::unique_ptr<common::NodeOffsetMaskMap> graphNodeMask = nullptr;
+};
+
+// Base class for every graph data science algorithm.
+class LBUG_API GDSFunction {
+    static constexpr char NODE_COLUMN_NAME[] = "node";
+    static constexpr char REL_COLUMN_NAME[] = "rel";
+
+public:
+    static graph::NativeGraphEntry bindGraphEntry(main::ClientContext& context,
+        const std::string& name);
+    static graph::NativeGraphEntry bindGraphEntry(main::ClientContext& context,
+        const graph::ParsedNativeGraphEntry& parsedGraphEntry);
+    static std::shared_ptr<binder::Expression> bindRelOutput(const TableFuncBindInput& bindInput,
+        const std::vector<catalog::TableCatalogEntry*>& relEntries,
+        std::shared_ptr<binder::NodeExpression> srcNode,
+        std::shared_ptr<binder::NodeExpression> dstNode,
+        const std::optional<std::string>& name = std::nullopt,
+        const std::optional<uint64_t>& yieldVariableIdx = std::nullopt);
+    static std::shared_ptr<binder::Expression> bindNodeOutput(const TableFuncBindInput& bindInput,
+        const std::vector<catalog::TableCatalogEntry*>& nodeEntries,
+        const std::optional<std::string>& name = std::nullopt,
+        const std::optional<uint64_t>& yieldVariableIdx = std::nullopt);
+    static std::string bindColumnName(const parser::YieldVariable& yieldVariable,
+        std::string expressionName);
+
+    static std::unique_ptr<TableFuncSharedState> initSharedState(
+        const TableFuncInitSharedStateInput& input);
+    static void getLogicalPlan(planner::Planner* planner,
+        const binder::BoundReadingClause& readingClause, binder::expression_vector predicates,
+        planner::LogicalPlan& plan);
+    static std::unique_ptr<processor::PhysicalOperator> getPhysicalPlan(
+        processor::PlanMapper* planMapper, const planner::LogicalOperator* logicalOp);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_frontier.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_frontier.h
new file mode 100644
index 0000000000..3ad85187f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_frontier.h
@@ -0,0 +1,317 @@
+#pragma once
+
+#include <atomic>
+#include <mutex>
+
+#include "compute.h"
+#include "density_state.h"
+#include "gds_object_manager.h"
+
+namespace lbug {
+namespace processor {
+struct ExecutionContext;
+}
+namespace function {
+
+using iteration_t = uint16_t;
+static constexpr iteration_t FRONTIER_UNVISITED = UINT16_MAX;
+static constexpr iteration_t FRONTIER_INITIAL_VISITED = 0;
+
+// Base frontier implementation.
+// A frontier keeps track of the existence of node. Instead of using boolean, we assign an iteration
+// number to each node. A node with iteration number "i", meaning it is visited in the i-th
+// iteration.
+class LBUG_API Frontier {
+public:
+    virtual ~Frontier() = default;
+
+    virtual void pinTableID(common::table_id_t tableID) = 0;
+
+    virtual void addNode(common::nodeID_t nodeID, iteration_t iter) = 0;
+    virtual void addNode(common::offset_t offset, iteration_t iter) = 0;
+    virtual void addNodes(const std::vector<common::nodeID_t>& nodeIDs, iteration_t iter) = 0;
+
+    virtual iteration_t getIteration(common::offset_t offset) const = 0;
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+};
+
+// Sparse frontier implementation assuming the number of nodes is small.
+// Use an STL hash map to maintain node offset-> iteration number
+class LBUG_API SparseFrontier : public Frontier {
+    friend class SparseFrontierReference;
+    friend class SPFrontierPair;
+    friend class DenseSparseDynamicFrontierPair;
+
+public:
+    explicit SparseFrontier(const common::table_id_map_t<common::offset_t>& nodeMaxOffsetMap)
+        : sparseObjects{nodeMaxOffsetMap} {}
+
+    void pinTableID(common::table_id_t tableID) override;
+
+    void addNode(common::nodeID_t nodeID, iteration_t iter) override;
+    void addNode(common::offset_t offset, iteration_t iter) override;
+    void addNodes(const std::vector<common::nodeID_t>& nodeIDs, iteration_t iter) override;
+
+    iteration_t getIteration(common::offset_t offset) const override;
+
+    uint64_t size() const { return sparseObjects.size(); }
+
+    const std::unordered_map<common::offset_t, iteration_t>& getCurrentData() const {
+        return *curData;
+    }
+
+private:
+    GDSSpareObjectManager<iteration_t> sparseObjects;
+    std::unordered_map<common::offset_t, iteration_t>* curData = nullptr;
+};
+
+// Sparse frontier implementation that refers to the data owned by another sparse frontier.
+// This should be used only for shortest-path type of algorithms where a node is guaranteed
+// to be visited only once. See SPFrontierPair for its usage.
+class SparseFrontierReference : public Frontier {
+public:
+    explicit SparseFrontierReference(SparseFrontier& frontier)
+        : sparseObjects{frontier.sparseObjects} {}
+
+    void pinTableID(common::table_id_t tableID) override;
+
+    void addNode(common::nodeID_t nodeID, iteration_t iter) override;
+    void addNode(common::offset_t offset, iteration_t iter) override;
+    void addNodes(const std::vector<common::nodeID_t>& nodeIDs, iteration_t iter) override;
+
+    iteration_t getIteration(common::offset_t offset) const override;
+
+    const std::unordered_map<common::offset_t, iteration_t>& getCurrentData() const {
+        return *curData;
+    }
+
+private:
+    GDSSpareObjectManager<iteration_t>& sparseObjects;
+    std::unordered_map<common::offset_t, iteration_t>* curData = nullptr;
+};
+
+// Dense frontier implementation assuming the number of nodes is large.
+// Use an array of iteration number. The array is allocated to max offset
+class LBUG_API DenseFrontier : public Frontier {
+    friend class SparseFrontier;
+    friend class DenseFrontierReference;
+    friend class SPFrontierPair;
+    friend class DenseSparseDynamicFrontierPair;
+
+public:
+    explicit DenseFrontier(const common::table_id_map_t<common::offset_t>& nodeMaxOffsetMap)
+        : nodeMaxOffsetMap{nodeMaxOffsetMap} {}
+    DenseFrontier(const DenseFrontier& other) = delete;
+    DenseFrontier(const DenseFrontier&& other) = delete;
+
+    // Allocate memory and initialize.
+    void init(processor::ExecutionContext* context, graph::Graph* graph, iteration_t val);
+    void resetValue(processor::ExecutionContext* context, graph::Graph* graph, iteration_t val);
+
+    void pinTableID(common::table_id_t tableID) override;
+
+    void addNode(common::nodeID_t nodeID, iteration_t iter) override;
+    void addNode(common::offset_t offset, iteration_t iter) override;
+    void addNodes(const std::vector<common::nodeID_t>& nodeIDs, iteration_t iter) override;
+
+    iteration_t getIteration(common::offset_t offset) const override;
+
+    // Get frontier without initialization.
+    static std::unique_ptr<DenseFrontier> getUninitializedFrontier(
+        processor::ExecutionContext* context, graph::Graph* graph);
+    // Get frontier initialized to UNVISITED.
+    static std::unique_ptr<DenseFrontier> getUnvisitedFrontier(processor::ExecutionContext* context,
+        graph::Graph* graph);
+    // Get frontier initialized to INITIAL_VISITED.
+    static std::unique_ptr<DenseFrontier> getVisitedFrontier(processor::ExecutionContext* context,
+        graph::Graph* graph);
+    // Init frontier to 0 according to mask
+    static std::unique_ptr<DenseFrontier> getVisitedFrontier(processor::ExecutionContext* context,
+        graph::Graph* graph, common::NodeOffsetMaskMap* maskMap);
+
+private:
+    common::table_id_map_t<common::offset_t> nodeMaxOffsetMap;
+    GDSDenseObjectManager<std::atomic<iteration_t>> denseObjects;
+    std::atomic<iteration_t>* curData = nullptr;
+};
+
+// Dense frontier implementation that refers to the data owned by another dense frontier.
+// Should be used in the same case as SparseFrontierReference
+class DenseFrontierReference : public Frontier {
+    friend class SPFrontierPair;
+
+public:
+    explicit DenseFrontierReference(const DenseFrontier& denseFrontier)
+        : denseObjects{denseFrontier.denseObjects} {}
+
+    void pinTableID(common::table_id_t tableID) override;
+
+    void addNode(common::nodeID_t nodeID, iteration_t iter) override;
+    void addNode(common::offset_t offset, iteration_t iter) override;
+    void addNodes(const std::vector<common::nodeID_t>& nodeIDs, iteration_t iter) override;
+
+    iteration_t getIteration(common::offset_t offset) const override;
+
+private:
+    const GDSDenseObjectManager<std::atomic<iteration_t>>& denseObjects;
+    std::atomic<iteration_t>* curData = nullptr;
+};
+
+class LBUG_API FrontierPair {
+public:
+    FrontierPair() { hasActiveNodesForNextIter_.store(false); }
+    virtual ~FrontierPair() = default;
+
+    void resetCurrentIter() { curIter = 0; }
+    iteration_t getCurrentIter() const { return curIter; }
+
+    void setActiveNodesForNextIter() { hasActiveNodesForNextIter_.store(true); }
+
+    bool continueNextIter(uint16_t maxIter) {
+        return hasActiveNodesForNextIter_.load(std::memory_order_relaxed) &&
+               getCurrentIter() < maxIter;
+    }
+
+    // Initialize state for new iteration.
+    void beginNewIteration();
+    void pinCurrentFrontier(common::table_id_t tableID);
+    void pinNextFrontier(common::table_id_t tableID);
+    // Pin current & next frontier
+    void beginFrontierComputeBetweenTables(common::table_id_t curTableID,
+        common::table_id_t nextTableID);
+
+    // Write to next frontier
+    void addNodeToNextFrontier(common::nodeID_t nodeID);
+    void addNodeToNextFrontier(common::offset_t offset);
+    void addNodesToNextFrontier(const std::vector<common::nodeID_t>& nodeIDs);
+
+    iteration_t getNextFrontierValue(common::offset_t offset);
+    bool isActiveOnCurrentFrontier(common::offset_t offset);
+    virtual std::unordered_set<common::offset_t> getActiveNodesOnCurrentFrontier() = 0;
+
+    virtual GDSDensityState getState() const = 0;
+    virtual bool needSwitchToDense(uint64_t threshold) const = 0;
+    virtual void switchToDense(processor::ExecutionContext* context, graph::Graph* graph) = 0;
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+protected:
+    virtual void beginNewIterationInternalNoLock() = 0;
+
+protected:
+    std::mutex mtx;
+    // curIter is the iteration number of the algorithm and starts from 0.
+    iteration_t curIter = 0;
+    std::atomic<bool> hasActiveNodesForNextIter_;
+    Frontier* currentFrontier = nullptr;
+    Frontier* nextFrontier = nullptr;
+};
+
+// Shortest path (excluding weighted shortest path )frontier implementation. Different from other
+// recursive algorithms, shortest path has the guarantee that a node will not be visited repeatedly
+// in different iteration. So we make current/next frontier reference writes to the same frontier.
+class SPFrontierPair : public FrontierPair {
+public:
+    explicit SPFrontierPair(std::unique_ptr<DenseFrontier> denseFrontier);
+
+    // Get sparse or dense frontier based on state.
+    // No need to specify current or next because there is only one frontier.
+    Frontier* getFrontier();
+
+    void beginNewIterationInternalNoLock() override;
+
+    // Get number of active nodes in current frontier. Used for shortest path early termination.
+    common::offset_t getNumActiveNodesInCurrentFrontier(common::NodeOffsetMaskMap& mask);
+
+    std::unordered_set<common::offset_t> getActiveNodesOnCurrentFrontier() override;
+
+    GDSDensityState getState() const override { return state; }
+    bool needSwitchToDense(uint64_t threshold) const override {
+        return state == GDSDensityState::SPARSE && sparseFrontier->size() > threshold;
+    }
+    void switchToDense(processor::ExecutionContext* context, graph::Graph* graph) override;
+
+private:
+    GDSDensityState state;
+    std::unique_ptr<DenseFrontier> denseFrontier;
+    std::unique_ptr<DenseFrontierReference> curDenseFrontier = nullptr;
+    std::unique_ptr<DenseFrontierReference> nextDenseFrontier = nullptr;
+    std::unique_ptr<SparseFrontier> sparseFrontier;
+    std::unique_ptr<SparseFrontierReference> curSparseFrontier = nullptr;
+    std::unique_ptr<SparseFrontierReference> nextSparseFrontier = nullptr;
+};
+
+// Frontier pair implementation that switches from sparse to dense adaptively.
+class LBUG_API DenseSparseDynamicFrontierPair : public FrontierPair {
+public:
+    DenseSparseDynamicFrontierPair(std::unique_ptr<DenseFrontier> curDenseFrontier,
+        std::unique_ptr<DenseFrontier> nextDenseFrontier);
+
+    void beginNewIterationInternalNoLock() override;
+
+    std::unordered_set<common::offset_t> getActiveNodesOnCurrentFrontier() override;
+
+    GDSDensityState getState() const override { return state; }
+    bool needSwitchToDense(uint64_t threshold) const override {
+        return state == GDSDensityState::SPARSE && nextSparseFrontier->size() > threshold;
+    }
+    void switchToDense(processor::ExecutionContext* context, graph::Graph* graph) override;
+
+private:
+    GDSDensityState state;
+    std::unique_ptr<DenseFrontier> curDenseFrontier = nullptr;
+    std::unique_ptr<DenseFrontier> nextDenseFrontier = nullptr;
+    std::unique_ptr<SparseFrontier> curSparseFrontier = nullptr;
+    std::unique_ptr<SparseFrontier> nextSparseFrontier = nullptr;
+};
+
+// Frontier pair implementation that only uses dense frontier. This is mostly used in
+// algorithms like wcc, scc where algorithms touch all nodes in the graph.
+class LBUG_API DenseFrontierPair : public FrontierPair {
+public:
+    DenseFrontierPair(std::unique_ptr<DenseFrontier> curDenseFrontier,
+        std::unique_ptr<DenseFrontier> nextDenseFrontier);
+
+    void beginNewIterationInternalNoLock() override;
+
+    std::unordered_set<common::offset_t> getActiveNodesOnCurrentFrontier() override {
+        KU_UNREACHABLE;
+    }
+
+    void resetValue(processor::ExecutionContext* context, graph::Graph* graph, iteration_t val);
+
+    GDSDensityState getState() const override { return GDSDensityState::DENSE; }
+    bool needSwitchToDense(uint64_t) const override { return false; }
+    void switchToDense(processor::ExecutionContext*, graph::Graph*) override {
+        // Do nothing.
+    }
+
+private:
+    std::shared_ptr<DenseFrontier> curDenseFrontier;
+    std::shared_ptr<DenseFrontier> nextDenseFrontier;
+};
+
+class SPEdgeCompute : public EdgeCompute {
+public:
+    explicit SPEdgeCompute(SPFrontierPair* frontierPair)
+        : frontierPair{frontierPair}, numNodesReached{0} {}
+
+    void resetSingleThreadState() override { numNodesReached = 0; }
+
+    bool terminate(common::NodeOffsetMaskMap& maskMap) override;
+
+protected:
+    SPFrontierPair* frontierPair;
+    // States that should be only modified with single thread
+    common::offset_t numNodesReached;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_function_collection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_function_collection.h
new file mode 100644
index 0000000000..d443cb73b2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_function_collection.h
@@ -0,0 +1,57 @@
+#pragma once
+
+#include "function/gds/rec_joins.h"
+
+namespace lbug {
+namespace function {
+
+struct VarLenJoinsFunction {
+    static constexpr const char* name = "VAR_LEN_JOINS";
+
+    static std::unique_ptr<RJAlgorithm> getAlgorithm();
+};
+
+struct AllSPDestinationsFunction {
+    static constexpr const char* name = "ALL_SP_DESTINATIONS";
+
+    static std::unique_ptr<RJAlgorithm> getAlgorithm();
+};
+
+struct AllSPPathsFunction {
+    static constexpr const char* name = "ALL_SP_PATHS";
+
+    static std::unique_ptr<RJAlgorithm> getAlgorithm();
+};
+
+struct SingleSPDestinationsFunction {
+    static constexpr const char* name = "SINGLE_SP_DESTINATIONS";
+
+    static std::unique_ptr<RJAlgorithm> getAlgorithm();
+};
+
+struct SingleSPPathsFunction {
+    static constexpr const char* name = "SINGLE_SP_PATHS";
+
+    static std::unique_ptr<RJAlgorithm> getAlgorithm();
+};
+
+struct WeightedSPDestinationsFunction {
+    static constexpr const char* name = "WEIGHTED_SP_DESTINATIONS";
+
+    static std::unique_ptr<RJAlgorithm> getAlgorithm();
+};
+
+struct WeightedSPPathsFunction {
+    static constexpr const char* name = "WEIGHTED_SP_PATHS";
+
+    static std::unique_ptr<RJAlgorithm> getAlgorithm();
+};
+
+struct AllWeightedSPPathsFunction {
+    static constexpr const char* name = "ALL_WEIGHTED_SP_PATHS";
+
+    static std::unique_ptr<RJAlgorithm> getAlgorithm();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_object_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_object_manager.h
new file mode 100644
index 0000000000..744e866483
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_object_manager.h
@@ -0,0 +1,250 @@
+#pragma once
+
+#include <atomic>
+#include <vector>
+
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/buffer_manager/mm_allocator.h"
+
+namespace lbug {
+namespace function {
+
+// ObjectBlock represents a pre-allocated amount of memory that can hold up to maxElements objects
+// ObjectBlock should be accessed by a single thread.
+template<typename T>
+class ObjectBlock {
+public:
+    ObjectBlock(std::unique_ptr<storage::MemoryBuffer> block, uint64_t sizeInBytes)
+        : block{std::move(block)} {
+        maxElements.store(sizeInBytes / (sizeof(T)), std::memory_order_relaxed);
+        nextPosToWrite.store(0, std::memory_order_relaxed);
+    }
+
+    T* reserveNext() { return getData() + nextPosToWrite.fetch_add(1, std::memory_order_relaxed); }
+    void revertLast() { nextPosToWrite.fetch_sub(1, std::memory_order_relaxed); }
+
+    bool hasSpace() const {
+        return nextPosToWrite.load(std::memory_order_relaxed) <
+               maxElements.load(std::memory_order_relaxed);
+    }
+
+private:
+    T* getData() const { return reinterpret_cast<T*>(block->getData()); }
+
+private:
+    std::unique_ptr<storage::MemoryBuffer> block;
+    std::atomic<uint64_t> maxElements;
+    std::atomic<uint64_t> nextPosToWrite;
+};
+
+// Pre-allocated array of objects.
+template<typename T>
+class ObjectArray {
+public:
+    ObjectArray() : size{0} {}
+    ObjectArray(const common::offset_t size, storage::MemoryManager* mm,
+        bool initializeToZero = false)
+        : size{size}, mm{mm} {
+        allocate(size, mm, initializeToZero);
+    }
+
+    void allocate(const common::offset_t size, storage::MemoryManager* mm, bool initializeToZero) {
+        allocation = mm->allocateBuffer(initializeToZero, size * sizeof(T));
+        data = std::span<T>(reinterpret_cast<T*>(allocation->getData()), size);
+        this->size = size;
+    }
+
+    common::offset_t getSize() const { return size; }
+
+    void reallocate(const common::offset_t newSize, storage::MemoryManager* mm) {
+        if (newSize > size) {
+            allocate(newSize, mm, false /* initializeToZero */);
+        }
+    }
+
+    void set(const common::offset_t pos, const T value) {
+        KU_ASSERT_UNCONDITIONAL(pos < size);
+        data[pos] = value;
+    }
+
+    const T& get(const common::offset_t pos) const {
+        KU_ASSERT_UNCONDITIONAL(pos < size);
+        return data[pos];
+    }
+
+    T& getUnsafe(const common::offset_t pos) {
+        KU_ASSERT_UNCONDITIONAL(pos < size);
+        return data[pos];
+    }
+
+private:
+    template<typename U>
+    friend class AtomicObjectArray;
+    common::offset_t size;
+    std::span<T> data;
+    std::unique_ptr<storage::MemoryBuffer> allocation;
+    storage::MemoryManager* mm = nullptr;
+};
+
+// Pre-allocated array of atomic objects.
+template<typename T>
+class AtomicObjectArray {
+public:
+    AtomicObjectArray() = default;
+    AtomicObjectArray(const common::offset_t size, storage::MemoryManager* mm,
+        bool initializeToZero = false)
+        : array{ObjectArray<std::atomic<T>>(size, mm, initializeToZero)} {}
+
+    common::offset_t getSize() const { return array.size; }
+
+    void reallocate(const common::offset_t newSize, storage::MemoryManager* mm) {
+        array.reallocate(newSize, mm);
+    }
+
+    void set(common::offset_t pos, const T& value,
+        std::memory_order order = std::memory_order_seq_cst) {
+        KU_ASSERT_UNCONDITIONAL(pos < array.size);
+        array.data[pos].store(value, order);
+    }
+
+    T get(const common::offset_t pos, std::memory_order order = std::memory_order_seq_cst) {
+        KU_ASSERT_UNCONDITIONAL(pos < array.size);
+        return array.data[pos].load(order);
+    }
+
+    void fetchAdd(common::offset_t pos, const T& value,
+        std::memory_order order = std::memory_order_seq_cst) {
+        KU_ASSERT_UNCONDITIONAL(pos < array.size);
+        array.data[pos].fetch_add(value, order);
+    }
+
+    bool compareExchangeMax(const common::offset_t src, const common::offset_t dest,
+        std::memory_order order = std::memory_order_seq_cst) {
+        auto srcValue = get(src, order);
+        auto dstValue = get(dest, order);
+        // From https://en.cppreference.com/w/cpp/std::atomic/std::atomic/compare_exchange:
+        // When a compare-and-exchange is in a loop, the weak version will yield better performance
+        // on some platforms.
+        while (dstValue < srcValue) {
+            if (array.data[dest].compare_exchange_weak(dstValue, srcValue)) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+private:
+    ObjectArray<std::atomic<T>> array;
+};
+
+template<typename T>
+class ku_vector_t {
+public:
+    explicit ku_vector_t(storage::MemoryManager* mm) : vec(storage::MmAllocator<T>(mm)) {}
+    ku_vector_t(storage::MemoryManager* mm, std::size_t size)
+        : vec(size, storage::MmAllocator<T>(mm)) {}
+
+    void reserve(std::size_t size) { vec.reserve(size); }
+
+    void resize(std::size_t size) { vec.resize(size); }
+
+    void push_back(const T& value) { vec.push_back(value); }
+
+    void push_back(T&& value) { vec.push_back(std::move(value)); }
+
+    bool empty() { return vec.empty(); }
+
+    auto begin() { return vec.begin(); }
+
+    auto end() { return vec.end(); }
+
+    auto begin() const { return vec.begin(); }
+
+    auto end() const { return vec.end(); }
+
+    template<typename... Args>
+    void emplace_back(Args&&... args) {
+        vec.emplace_back(std::forward<Args>(args)...);
+    }
+
+    void pop_back() { vec.pop_back(); }
+
+    void clear() { vec.clear(); }
+
+    std::size_t size() const { return vec.size(); }
+
+    T& operator[](std::size_t index) { return vec[index]; }
+    const T& operator[](std::size_t index) const { return vec[index]; }
+
+    T& at(std::size_t index) { return vec.at(index); }
+    const T& at(std::size_t index) const { return vec.at(index); }
+
+private:
+    std::vector<T, storage::MmAllocator<T>> vec;
+};
+
+// ObjectArraysMap represents a pre-allocated amount of object per tableID.
+template<typename T>
+class GDSDenseObjectManager {
+public:
+    void allocate(common::table_id_t tableID, common::offset_t maxOffset,
+        storage::MemoryManager* mm) {
+        auto buffer = mm->allocateBuffer(false, maxOffset * sizeof(T));
+        bufferPerTable.insert({tableID, std::move(buffer)});
+    }
+
+    T* getData(common::table_id_t tableID) const {
+        KU_ASSERT(bufferPerTable.contains(tableID));
+        return reinterpret_cast<T*>(bufferPerTable.at(tableID)->getData());
+    }
+
+private:
+    common::table_id_map_t<std::unique_ptr<storage::MemoryBuffer>> bufferPerTable;
+};
+
+template<typename T>
+class GDSSpareObjectManager {
+public:
+    explicit GDSSpareObjectManager(
+        const common::table_id_map_t<common::offset_t>& nodeMaxOffsetMap) {
+        for (auto& [tableID, _] : nodeMaxOffsetMap) {
+            allocate(tableID);
+        }
+    }
+
+    void allocate(common::table_id_t tableID) {
+        KU_ASSERT(!mapPerTable.contains(tableID));
+        mapPerTable.insert({tableID, {}});
+    }
+
+    const common::table_id_map_t<std::unordered_map<common::offset_t, T>>& getData() {
+        return mapPerTable;
+    }
+
+    std::unordered_map<common::offset_t, T>* getMap(common::table_id_t tableID) {
+        KU_ASSERT(mapPerTable.contains(tableID));
+        return &mapPerTable.at(tableID);
+    }
+
+    std::unordered_map<common::offset_t, T>* getData(common::table_id_t tableID) {
+        if (!mapPerTable.contains(tableID)) {
+            mapPerTable.insert({tableID, {}});
+        }
+        KU_ASSERT(mapPerTable.contains(tableID));
+        return &mapPerTable.at(tableID);
+    }
+
+    uint64_t size() const {
+        uint64_t result = 0;
+        for (auto [_, map] : mapPerTable) {
+            result += map.size();
+        }
+        return result;
+    }
+
+private:
+    common::table_id_map_t<std::unordered_map<common::offset_t, T>> mapPerTable;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_state.h
new file mode 100644
index 0000000000..1d536dbdc1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_state.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "auxiliary_state/gds_auxilary_state.h"
+#include "gds_frontier.h"
+
+namespace lbug {
+namespace function {
+
+struct GDSComputeState {
+    std::shared_ptr<FrontierPair> frontierPair = nullptr;
+    std::unique_ptr<EdgeCompute> edgeCompute = nullptr;
+    std::unique_ptr<GDSAuxiliaryState> auxiliaryState = nullptr;
+
+    GDSComputeState(std::shared_ptr<FrontierPair> frontierPair,
+        std::unique_ptr<EdgeCompute> edgeCompute, std::unique_ptr<GDSAuxiliaryState> auxiliaryState)
+        : frontierPair{std::move(frontierPair)}, edgeCompute{std::move(edgeCompute)},
+          auxiliaryState{std::move(auxiliaryState)} {}
+
+    void initSource(common::nodeID_t sourceNodeID) const;
+    // When performing computations on multi-label graphs, it is beneficial to fix a single
+    // node table of nodes in the current frontier and a single node table of nodes for the next
+    // frontier. That is because algorithms will perform extensions using a single relationship
+    // table at a time, and each relationship table R is between a single source node table S and
+    // a single destination node table T. Therefore, during execution the algorithm will need to
+    // check only the active S nodes in current frontier and update the active statuses of only the
+    // T nodes in the next frontier. The information that the algorithm is beginning and S-to-T
+    // extensions are be given to the data structures of the computation, e.g., FrontierPairs and
+    // RJOutputs, to possibly avoid them doing lookups of S and T-related data structures,
+    // e.g., maps, internally.
+    void beginFrontierCompute(common::table_id_t currTableID, common::table_id_t nextTableID) const;
+
+    // Switch all data structures (frontierPair & auxiliaryState) to dense version.
+    void switchToDense(processor::ExecutionContext* context, graph::Graph* graph) const;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_task.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_task.h
new file mode 100644
index 0000000000..bc947eda52
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_task.h
@@ -0,0 +1,106 @@
+#pragma once
+
+#include <utility>
+
+#include "common/enums/extend_direction.h"
+#include "common/task_system/task.h"
+#include "frontier_morsel.h"
+#include "function/gds/gds_frontier.h"
+#include "graph/graph.h"
+
+namespace lbug {
+namespace function {
+
+struct FrontierTaskInfo {
+    common::table_id_t srcTableID;
+    common::table_id_t dstTableID;
+    catalog::TableCatalogEntry* relGroupEntry = nullptr;
+    graph::Graph* graph;
+    common::ExtendDirection direction;
+    EdgeCompute& edgeCompute;
+    std::vector<std::string> propertiesToScan;
+
+    FrontierTaskInfo(common::table_id_t srcTableID, common::table_id_t dstTableID,
+        catalog::TableCatalogEntry* relGroupEntry, graph::Graph* graph,
+        common::ExtendDirection direction, EdgeCompute& edgeCompute,
+        std::vector<std::string> propertiesToScan)
+        : srcTableID{srcTableID}, dstTableID{dstTableID}, relGroupEntry{relGroupEntry},
+          graph{graph}, direction{direction}, edgeCompute{edgeCompute},
+          propertiesToScan{std::move(propertiesToScan)} {}
+    FrontierTaskInfo(const FrontierTaskInfo& other)
+        : srcTableID{other.srcTableID}, dstTableID{other.dstTableID},
+          relGroupEntry{other.relGroupEntry}, graph{other.graph}, direction{other.direction},
+          edgeCompute{other.edgeCompute}, propertiesToScan{other.propertiesToScan} {}
+
+    common::table_id_t getBoundTableID() const;
+    common::table_id_t getNbrTableID() const;
+    common::oid_t getRelTableID() const;
+};
+
+struct FrontierTaskSharedState {
+    FrontierMorselDispatcher morselDispatcher;
+    FrontierPair& frontierPair;
+
+    FrontierTaskSharedState(uint64_t maxNumThreads, FrontierPair& frontierPair)
+        : morselDispatcher{maxNumThreads}, frontierPair{frontierPair} {}
+    DELETE_COPY_AND_MOVE(FrontierTaskSharedState);
+};
+
+class FrontierTask : public common::Task {
+public:
+    FrontierTask(uint64_t maxNumThreads, const FrontierTaskInfo& info,
+        std::shared_ptr<FrontierTaskSharedState> sharedState)
+        : Task{maxNumThreads}, info{info}, sharedState{std::move(sharedState)} {}
+
+    void run() override;
+
+    void runSparse();
+
+private:
+    FrontierTaskInfo info;
+    std::shared_ptr<FrontierTaskSharedState> sharedState;
+};
+
+struct VertexComputeTaskSharedState {
+    FrontierMorselDispatcher morselDispatcher;
+
+    explicit VertexComputeTaskSharedState(uint64_t maxNumThreads)
+        : morselDispatcher{maxNumThreads} {}
+};
+
+struct VertexComputeTaskInfo {
+    VertexCompute& vc;
+    graph::Graph* graph;
+    catalog::TableCatalogEntry* tableEntry;
+    std::vector<std::string> propertiesToScan;
+
+    VertexComputeTaskInfo(VertexCompute& vc, graph::Graph* graph,
+        catalog::TableCatalogEntry* tableEntry, std::vector<std::string> propertiesToScan)
+        : vc{vc}, graph{graph}, tableEntry{tableEntry},
+          propertiesToScan{std::move(propertiesToScan)} {}
+    VertexComputeTaskInfo(const VertexComputeTaskInfo& other)
+        : vc{other.vc}, graph{other.graph}, tableEntry{other.tableEntry},
+          propertiesToScan{other.propertiesToScan} {}
+
+    bool hasPropertiesToScan() const { return !propertiesToScan.empty(); }
+};
+
+class VertexComputeTask : public common::Task {
+public:
+    VertexComputeTask(uint64_t maxNumThreads, const VertexComputeTaskInfo& info,
+        std::shared_ptr<VertexComputeTaskSharedState> sharedState)
+        : common::Task{maxNumThreads}, info{info}, sharedState{std::move(sharedState)} {};
+
+    VertexComputeTaskSharedState* getSharedState() const { return sharedState.get(); }
+
+    void run() override;
+
+    void runSparse();
+
+private:
+    VertexComputeTaskInfo info;
+    std::shared_ptr<VertexComputeTaskSharedState> sharedState;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_utils.h
new file mode 100644
index 0000000000..b6a3eecf1f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_utils.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/enums/extend_direction.h"
+#include "gds_state.h"
+
+namespace lbug {
+namespace function {
+
+class LBUG_API GDSUtils {
+public:
+    // Run edge compute for graph algorithms
+    static void runAlgorithmEdgeCompute(processor::ExecutionContext* context,
+        GDSComputeState& compState, graph::Graph* graph, common::ExtendDirection extendDirection,
+        uint64_t maxIteration);
+    // Run edge compute for full text search
+    static void runFTSEdgeCompute(processor::ExecutionContext* context, GDSComputeState& compState,
+        graph::Graph* graph, common::ExtendDirection extendDirection,
+        const std::vector<std::string>& propertiesToScan);
+    // Run edge compute for recursive join.
+    static void runRecursiveJoinEdgeCompute(processor::ExecutionContext* context,
+        GDSComputeState& compState, graph::Graph* graph, common::ExtendDirection extendDirection,
+        uint64_t maxIteration, common::NodeOffsetMaskMap* outputNodeMask,
+        const std::vector<std::string>& propertiesToScan);
+
+    // Run vertex compute without property scan
+    static void runVertexCompute(processor::ExecutionContext* context, GDSDensityState densityState,
+        graph::Graph* graph, VertexCompute& vc);
+    // Run vertex compute with property scan
+    static void runVertexCompute(processor::ExecutionContext* context, GDSDensityState densityState,
+        graph::Graph* graph, VertexCompute& vc, const std::vector<std::string>& propertiesToScan);
+    // Run vertex compute on specific table with property scan
+    static void runVertexCompute(processor::ExecutionContext* context, GDSDensityState densityState,
+        graph::Graph* graph, VertexCompute& vc, catalog::TableCatalogEntry* entry,
+        const std::vector<std::string>& propertiesToScan);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_vertex_compute.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_vertex_compute.h
new file mode 100644
index 0000000000..2a45fbac23
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/gds_vertex_compute.h
@@ -0,0 +1,61 @@
+#pragma once
+
+#include "function/gds/compute.h"
+#include "function/gds/gds.h"
+
+namespace lbug {
+namespace function {
+
+class GDSVertexCompute : public VertexCompute {
+public:
+    explicit GDSVertexCompute(common::NodeOffsetMaskMap* nodeMask) : nodeMask{nodeMask} {}
+
+    bool beginOnTable(common::table_id_t tableID) override {
+        if (nodeMask != nullptr) {
+            nodeMask->pin(tableID);
+        }
+        beginOnTableInternal(tableID);
+        return true;
+    }
+
+protected:
+    bool skip(common::offset_t offset) {
+        if (nodeMask != nullptr && nodeMask->hasPinnedMask()) {
+            return !nodeMask->valid(offset);
+        }
+        return false;
+    }
+
+    virtual void beginOnTableInternal(common::table_id_t tableID) = 0;
+
+protected:
+    common::NodeOffsetMaskMap* nodeMask;
+};
+
+class GDSResultVertexCompute : public GDSVertexCompute {
+public:
+    GDSResultVertexCompute(storage::MemoryManager* mm, GDSFuncSharedState* sharedState)
+        : GDSVertexCompute{sharedState->getGraphNodeMaskMap()}, sharedState{sharedState}, mm{mm} {
+        localFT = sharedState->factorizedTablePool.claimLocalTable(mm);
+    }
+    ~GDSResultVertexCompute() override {
+        sharedState->factorizedTablePool.returnLocalTable(localFT);
+    }
+
+protected:
+    std::unique_ptr<common::ValueVector> createVector(const common::LogicalType& type) {
+        auto vector = std::make_unique<common::ValueVector>(type.copy(), mm);
+        vector->state = common::DataChunkState::getSingleValueDataChunkState();
+        vectors.push_back(vector.get());
+        return vector;
+    }
+
+protected:
+    GDSFuncSharedState* sharedState;
+    storage::MemoryManager* mm;
+    processor::FactorizedTable* localFT = nullptr;
+    std::vector<common::ValueVector*> vectors;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/rec_joins.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/rec_joins.h
new file mode 100644
index 0000000000..3ce606dffb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/rec_joins.h
@@ -0,0 +1,61 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/enums/extend_direction.h"
+#include "common/enums/path_semantic.h"
+#include "function/gds/gds_state.h"
+#include "graph/graph_entry.h"
+#include "processor/operator/recursive_extend_shared_state.h"
+#include "rj_output_writer.h"
+
+namespace lbug {
+namespace function {
+
+struct RJBindData {
+    graph::NativeGraphEntry graphEntry;
+
+    std::shared_ptr<binder::Expression> nodeInput = nullptr;
+    std::shared_ptr<binder::Expression> nodeOutput = nullptr;
+    // For any form of shortest path lower bound must always be 1.
+    // If lowerBound equals to 0, an empty path with source node only will be returned.
+    uint16_t lowerBound = 0;
+    uint16_t upperBound = 0;
+    common::PathSemantic semantic = common::PathSemantic::WALK;
+
+    common::ExtendDirection extendDirection = common::ExtendDirection::FWD;
+
+    bool flipPath = false; // See PathsOutputWriterInfo::flipPath for comments.
+    bool writePath = true;
+
+    std::shared_ptr<binder::Expression> directionExpr = nullptr;
+    std::shared_ptr<binder::Expression> lengthExpr = nullptr;
+    std::shared_ptr<binder::Expression> pathNodeIDsExpr = nullptr;
+    std::shared_ptr<binder::Expression> pathEdgeIDsExpr = nullptr;
+
+    std::shared_ptr<binder::Expression> weightPropertyExpr = nullptr;
+    std::shared_ptr<binder::Expression> weightOutputExpr = nullptr;
+
+    explicit RJBindData(graph::NativeGraphEntry graphEntry) : graphEntry{std::move(graphEntry)} {}
+    RJBindData(const RJBindData& other);
+
+    PathsOutputWriterInfo getPathWriterInfo() const;
+};
+
+class RJAlgorithm {
+public:
+    virtual ~RJAlgorithm() = default;
+
+    virtual std::string getFunctionName() const = 0;
+    virtual binder::expression_vector getResultColumns(const RJBindData& bindData) const = 0;
+
+    virtual std::unique_ptr<GDSComputeState> getComputeState(processor::ExecutionContext* context,
+        const RJBindData& bindData, processor::RecursiveExtendSharedState* sharedState) = 0;
+    virtual std::unique_ptr<RJOutputWriter> getOutputWriter(processor::ExecutionContext* context,
+        const RJBindData& bindData, GDSComputeState& computeState, common::nodeID_t sourceNodeID,
+        processor::RecursiveExtendSharedState* sharedState) = 0;
+
+    virtual std::unique_ptr<RJAlgorithm> copy() const = 0;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/rj_output_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/rj_output_writer.h
new file mode 100644
index 0000000000..0aba7834ff
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/rj_output_writer.h
@@ -0,0 +1,135 @@
+#pragma once
+
+#include "bfs_graph.h"
+#include "common/counter.h"
+#include "common/enums/path_semantic.h"
+#include "common/mask.h"
+#include "common/types/types.h"
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace function {
+
+class RJOutputWriter {
+public:
+    RJOutputWriter(main::ClientContext* context, common::NodeOffsetMaskMap* outputNodeMask,
+        common::nodeID_t sourceNodeID);
+    virtual ~RJOutputWriter() = default;
+
+    void beginWriting(common::table_id_t tableID) {
+        pinOutputNodeMask(tableID);
+        beginWritingInternal(tableID);
+    }
+    virtual void beginWritingInternal(common::table_id_t tableID) = 0;
+    // Write
+    virtual void write(processor::FactorizedTable& fTable, common::table_id_t tableID,
+        common::LimitCounter* counter) = 0;
+    virtual void write(processor::FactorizedTable& fTable, common::nodeID_t dstNodeID,
+        common::LimitCounter* counter) = 0;
+
+    bool inOutputNodeMask(common::offset_t offset);
+
+    virtual std::unique_ptr<RJOutputWriter> copy() = 0;
+
+protected:
+    std::unique_ptr<common::ValueVector> createVector(const common::LogicalType& type);
+
+    void pinOutputNodeMask(common::table_id_t tableID);
+
+protected:
+    main::ClientContext* context;
+    common::NodeOffsetMaskMap* outputNodeMask;
+    common::nodeID_t sourceNodeID_;
+
+    std::vector<common::ValueVector*> vectors;
+    std::unique_ptr<common::ValueVector> srcNodeIDVector;
+    std::unique_ptr<common::ValueVector> dstNodeIDVector;
+};
+
+struct PathsOutputWriterInfo {
+    // Semantic
+    common::PathSemantic semantic = common::PathSemantic::WALK;
+    // Range
+    uint16_t lowerBound = 0;
+    // Direction
+    bool flipPath = false;
+    bool writeEdgeDirection = false;
+    bool writePath = false;
+    // Node predicate mask
+    common::NodeOffsetMaskMap* pathNodeMask = nullptr;
+
+    bool hasNodeMask() const { return pathNodeMask != nullptr; }
+};
+
+class PathsOutputWriter : public RJOutputWriter {
+public:
+    PathsOutputWriter(main::ClientContext* context, common::NodeOffsetMaskMap* outputNodeMask,
+        common::nodeID_t sourceNodeID, PathsOutputWriterInfo info, BaseBFSGraph& bfsGraph);
+
+    void beginWritingInternal(common::table_id_t tableID) override { bfsGraph.pinTableID(tableID); }
+
+    void write(processor::FactorizedTable& fTable, common::table_id_t tableID,
+        common::LimitCounter* counter) override;
+    void write(processor::FactorizedTable& fTable, common::nodeID_t dstNodeID,
+        common::LimitCounter* counter) override;
+
+protected:
+    virtual void writeInternal(processor::FactorizedTable& fTable, common::nodeID_t dstNodeID,
+        common::LimitCounter* counter) = 0;
+    // Fast path when there is no node predicate or semantic check
+    void dfsFast(ParentList* firstParent, processor::FactorizedTable& fTable,
+        common::LimitCounter* counter);
+    // Slow path to check node predicate or semantic.
+    void dfsSlow(ParentList* firstParent, processor::FactorizedTable& fTable,
+        common::LimitCounter* counter);
+
+    bool updateCounterAndTerminate(common::LimitCounter* counter);
+
+    ParentList* findFirstParent(common::offset_t dstOffset) const;
+
+    bool checkPathNodeMask(ParentList* element) const;
+    // Check semantics
+    bool checkAppendSemantic(const std::vector<ParentList*>& path, ParentList* candidate) const;
+    bool checkReplaceTopSemantic(const std::vector<ParentList*>& path, ParentList* candidate) const;
+    bool isAppendTrail(const std::vector<ParentList*>& path, ParentList* candidate) const;
+    bool isAppendAcyclic(const std::vector<ParentList*>& path, ParentList* candidate) const;
+    bool isReplaceTopTrail(const std::vector<ParentList*>& path, ParentList* candidate) const;
+    bool isReplaceTopAcyclic(const std::vector<ParentList*>& path, ParentList* candidate) const;
+
+    bool isNextViable(ParentList* next, const std::vector<ParentList*>& path) const;
+
+    void beginWritePath(common::idx_t length) const;
+    void writePath(const std::vector<ParentList*>& path) const;
+    void writePathFwd(const std::vector<ParentList*>& path) const;
+    void writePathBwd(const std::vector<ParentList*>& path) const;
+
+    void addEdge(common::relID_t edgeID, bool fwdEdge, common::sel_t pos) const;
+    void addNode(common::nodeID_t nodeID, common::sel_t pos) const;
+
+protected:
+    PathsOutputWriterInfo info;
+    BaseBFSGraph& bfsGraph;
+
+    std::unique_ptr<common::ValueVector> directionVector = nullptr;
+    std::unique_ptr<common::ValueVector> lengthVector = nullptr;
+    std::unique_ptr<common::ValueVector> pathNodeIDsVector = nullptr;
+    std::unique_ptr<common::ValueVector> pathEdgeIDsVector = nullptr;
+};
+
+class SPPathsOutputWriter : public PathsOutputWriter {
+public:
+    SPPathsOutputWriter(main::ClientContext* context, common::NodeOffsetMaskMap* outputNodeMask,
+        common::nodeID_t sourceNodeID, PathsOutputWriterInfo info, BaseBFSGraph& bfsGraph)
+        : PathsOutputWriter{context, outputNodeMask, sourceNodeID, info, bfsGraph} {}
+
+    void writeInternal(processor::FactorizedTable& fTable, common::nodeID_t dstNodeID,
+        common::LimitCounter* counter) override;
+
+    std::unique_ptr<RJOutputWriter> copy() override {
+        return std::make_unique<SPPathsOutputWriter>(context, outputNodeMask, sourceNodeID_, info,
+            bfsGraph);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/weight_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/weight_utils.h
new file mode 100644
index 0000000000..90856ece6c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/gds/weight_utils.h
@@ -0,0 +1,101 @@
+#pragma once
+
+#include "common/exception/runtime.h"
+#include "common/type_utils.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace function {
+
+struct WeightUtils {
+    template<typename... Fs>
+    static auto visit(const std::string& fcn, const common::LogicalType& dataType, Fs... funcs);
+
+    template<typename... Fs>
+    static auto visit(const std::string& fcn, const common::LogicalTypeID& dataType, Fs... funcs);
+
+    template<typename T>
+    static void checkWeight(const std::string& fcn, T weight);
+};
+
+template<typename... Fs>
+auto WeightUtils::visit(const std::string& fcn, const common::LogicalType& dataType, Fs... funcs) {
+    auto func = common::overload(funcs...);
+    switch (dataType.getLogicalTypeID()) {
+    /* NOLINTBEGIN(bugprone-branch-clone)*/
+    case common::LogicalTypeID::INT8:
+        return func(int8_t());
+    case common::LogicalTypeID::UINT8:
+        return func(uint8_t());
+    case common::LogicalTypeID::INT16:
+        return func(int16_t());
+    case common::LogicalTypeID::UINT16:
+        return func(uint16_t());
+    case common::LogicalTypeID::INT32:
+        return func(int32_t());
+    case common::LogicalTypeID::UINT32:
+        return func(uint32_t());
+    case common::LogicalTypeID::INT64:
+        return func(int64_t());
+    case common::LogicalTypeID::UINT64:
+        return func(uint64_t());
+    case common::LogicalTypeID::DOUBLE:
+        return func(double());
+    case common::LogicalTypeID::FLOAT:
+        return func(float());
+    /* NOLINTEND(bugprone-branch-clone)*/
+    default:
+        break;
+    }
+    // LCOV_EXCL_START
+    throw common::RuntimeException(
+        common::stringFormat("{} weight type is not supported for {}.", dataType.toString(), fcn));
+    // LCOV_EXCL_STOP
+}
+
+template<typename... Fs>
+auto WeightUtils::visit(const std::string& fcn, const common::LogicalTypeID& dataType,
+    Fs... funcs) {
+    auto func = common::overload(funcs...);
+    switch (dataType) {
+    /* NOLINTBEGIN(bugprone-branch-clone)*/
+    case common::LogicalTypeID::INT8:
+        return func(int8_t());
+    case common::LogicalTypeID::UINT8:
+        return func(uint8_t());
+    case common::LogicalTypeID::INT16:
+        return func(int16_t());
+    case common::LogicalTypeID::UINT16:
+        return func(uint16_t());
+    case common::LogicalTypeID::INT32:
+        return func(int32_t());
+    case common::LogicalTypeID::UINT32:
+        return func(uint32_t());
+    case common::LogicalTypeID::INT64:
+        return func(int64_t());
+    case common::LogicalTypeID::UINT64:
+        return func(uint64_t());
+    case common::LogicalTypeID::DOUBLE:
+        return func(double());
+    case common::LogicalTypeID::FLOAT:
+        return func(float());
+    /* NOLINTEND(bugprone-branch-clone)*/
+    default:
+        break;
+    }
+    // LCOV_EXCL_START
+    throw common::RuntimeException(common::stringFormat("{} weight type is not supported for {}.",
+        common::LogicalType(dataType).toString(), fcn));
+    // LCOV_EXCL_STOP
+}
+
+template<typename T>
+void WeightUtils::checkWeight(const std::string& fcn, T weight) {
+    if (weight < 0) {
+        [[unlikely]] throw common::RuntimeException(common::stringFormat(
+            "Found negative weight {}. This is not a supported weight for {}", weight, fcn));
+    }
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/hash/hash_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/hash/hash_functions.h
new file mode 100644
index 0000000000..d2fb586658
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/hash/hash_functions.h
@@ -0,0 +1,187 @@
+#pragma once
+
+#include <cstdint>
+#include <functional>
+#include <unordered_set>
+
+#include "common/exception/runtime.h"
+#include "common/types/int128_t.h"
+#include "common/types/interval_t.h"
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "common/types/uint128_t.h"
+
+namespace lbug {
+namespace function {
+
+constexpr const uint64_t NULL_HASH = UINT64_MAX;
+
+inline common::hash_t murmurhash64(uint64_t x) {
+    // taken from https://nullprogram.com/blog/2018/07/31.
+    x ^= x >> 32;
+    x *= 0xd6e8feb86659fd93U;
+    x ^= x >> 32;
+    x *= 0xd6e8feb86659fd93U;
+    x ^= x >> 32;
+    return x;
+}
+
+inline common::hash_t combineHashScalar(const common::hash_t a, const common::hash_t b) {
+    return (a * UINT64_C(0xbf58476d1ce4e5b9)) ^ b;
+}
+
+struct Hash {
+    template<class T>
+    static void operation(const T& /*key*/, common::hash_t& /*result*/) {
+        // LCOV_EXCL_START
+        throw common::RuntimeException(
+            "Hash type: " + std::string(typeid(T).name()) + " is not supported.");
+        // LCOV_EXCL_STOP
+    }
+
+    template<class T>
+    static void operation(const T& key, bool isNull, common::hash_t& result) {
+        if (isNull) {
+            result = NULL_HASH;
+            return;
+        }
+        operation(key, result);
+    }
+};
+
+struct CombineHash {
+    static inline void operation(const common::hash_t& left, const common::hash_t& right,
+        common::hash_t& result) {
+        result = combineHashScalar(left, right);
+    }
+};
+
+template<>
+inline void Hash::operation(const common::internalID_t& key, common::hash_t& result) {
+    result = murmurhash64(key.offset) ^ murmurhash64(key.tableID);
+}
+
+template<>
+inline void Hash::operation(const bool& key, common::hash_t& result) {
+    result = murmurhash64(key);
+}
+
+template<>
+inline void Hash::operation(const uint8_t& key, common::hash_t& result) {
+    result = murmurhash64(key);
+}
+
+template<>
+inline void Hash::operation(const uint16_t& key, common::hash_t& result) {
+    result = murmurhash64(key);
+}
+
+template<>
+inline void Hash::operation(const uint32_t& key, common::hash_t& result) {
+    result = murmurhash64(key);
+}
+
+template<>
+inline void Hash::operation(const uint64_t& key, common::hash_t& result) {
+    result = murmurhash64(key);
+}
+
+template<>
+inline void Hash::operation(const int64_t& key, common::hash_t& result) {
+    result = murmurhash64(key);
+}
+
+template<>
+inline void Hash::operation(const int32_t& key, common::hash_t& result) {
+    result = murmurhash64(key);
+}
+
+template<>
+inline void Hash::operation(const int16_t& key, common::hash_t& result) {
+    result = murmurhash64(key);
+}
+
+template<>
+inline void Hash::operation(const int8_t& key, common::hash_t& result) {
+    result = murmurhash64(key);
+}
+
+template<>
+inline void Hash::operation(const common::int128_t& key, common::hash_t& result) {
+    result = murmurhash64(key.low) ^ murmurhash64(key.high);
+}
+
+template<>
+inline void Hash::operation(const common::uint128_t& key, common::hash_t& result) {
+    result = murmurhash64(key.low) ^ murmurhash64(key.high);
+}
+
+template<>
+inline void Hash::operation(const double& key, common::hash_t& result) {
+    // 0 and -0 are not byte-equivalent, but should have the same hash
+    if (key == 0) {
+        result = murmurhash64(0);
+    } else {
+        result = murmurhash64(*reinterpret_cast<const uint64_t*>(&key));
+    }
+}
+
+template<>
+inline void Hash::operation(const float& key, common::hash_t& result) {
+    // 0 and -0 are not byte-equivalent, but should have the same hash
+    if (key == 0) {
+        result = murmurhash64(0);
+    } else {
+        result = murmurhash64(*reinterpret_cast<const uint32_t*>(&key));
+    }
+}
+
+template<>
+inline void Hash::operation(const std::string_view& key, common::hash_t& result) {
+    common::hash_t hashValue = 0;
+    auto data64 = reinterpret_cast<const uint64_t*>(key.data());
+    for (size_t i = 0u; i < key.size() / 8; i++) {
+        auto blockHash = lbug::function::murmurhash64(*(data64 + i));
+        hashValue = lbug::function::combineHashScalar(hashValue, blockHash);
+    }
+    uint64_t last = 0;
+    for (size_t i = 0u; i < key.size() % 8; i++) {
+        last |= static_cast<uint64_t>(key[key.size() / 8 * 8 + i]) << i * 8;
+    }
+    hashValue = lbug::function::combineHashScalar(hashValue, lbug::function::murmurhash64(last));
+    result = hashValue;
+}
+
+template<>
+inline void Hash::operation(const std::string& key, common::hash_t& result) {
+    Hash::operation(std::string_view(key), result);
+}
+
+template<>
+inline void Hash::operation(const common::ku_string_t& key, common::hash_t& result) {
+    Hash::operation(key.getAsStringView(), result);
+}
+
+template<>
+inline void Hash::operation(const common::interval_t& key, common::hash_t& result) {
+    result = combineHashScalar(murmurhash64(key.months),
+        combineHashScalar(murmurhash64(key.days), murmurhash64(key.micros)));
+}
+
+template<>
+inline void Hash::operation(const std::unordered_set<std::string>& key, common::hash_t& result) {
+    for (auto&& s : key) {
+        result ^= std::hash<std::string>()(s);
+    }
+}
+
+struct InternalIDHasher {
+    std::size_t operator()(const common::internalID_t& internalID) const {
+        common::hash_t result = 0;
+        function::Hash::operation<common::internalID_t>(internalID, result);
+        return result;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/hash/vector_hash_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/hash/vector_hash_functions.h
new file mode 100644
index 0000000000..f8c2b5788e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/hash/vector_hash_functions.h
@@ -0,0 +1,53 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct UnaryHashFunctionExecutor {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE>
+    static void execute(const common::ValueVector& operand,
+        const common::SelectionView& operandSelectVec, common::ValueVector& result,
+        const common::SelectionView& resultSelectVec);
+};
+
+struct BinaryHashFunctionExecutor {
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void execute(const common::ValueVector& left, const common::SelectionView& leftSelVec,
+        const common::ValueVector& right, const common::SelectionView& rightSelVec,
+        common::ValueVector& result, const common::SelectionView& resultSelVec);
+};
+
+struct VectorHashFunction {
+    static void computeHash(const common::ValueVector& operand,
+        const common::SelectionView& operandSelectVec, common::ValueVector& result,
+        const common::SelectionView& resultSelectVec);
+
+    static void combineHash(const common::ValueVector& left,
+        const common::SelectionView& leftSelVec, const common::ValueVector& right,
+        const common::SelectionView& rightSelVec, common::ValueVector& result,
+        const common::SelectionView& resultSelVec);
+};
+
+struct MD5Function {
+    static constexpr const char* name = "MD5";
+
+    static function_set getFunctionSet();
+};
+
+struct SHA256Function {
+    static constexpr const char* name = "SHA256";
+
+    static function_set getFunctionSet();
+};
+
+struct HashFunction {
+    static constexpr const char* name = "HASH";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/internal_id/vector_internal_id_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/internal_id/vector_internal_id_functions.h
new file mode 100644
index 0000000000..e4d01c5988
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/internal_id/vector_internal_id_functions.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct InternalIDCreationFunction {
+    static constexpr const char* name = "internal_id";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/interval/interval_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/interval/interval_functions.h
new file mode 100644
index 0000000000..673b8e41c7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/interval/interval_functions.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include "common/types/interval_t.h"
+
+namespace lbug {
+namespace function {
+
+struct ToYears {
+    static inline void operation(int64_t& input, common::interval_t& result) {
+        result.days = result.micros = 0;
+        result.months = input * common::Interval::MONTHS_PER_YEAR;
+    }
+};
+
+struct ToMonths {
+    static inline void operation(int64_t& input, common::interval_t& result) {
+        result.days = result.micros = 0;
+        result.months = input;
+    }
+};
+
+struct ToDays {
+    static inline void operation(int64_t& input, common::interval_t& result) {
+        result.micros = result.months = 0;
+        result.days = input;
+    }
+};
+
+struct ToHours {
+    static inline void operation(int64_t& input, common::interval_t& result) {
+        result.months = result.days = 0;
+        result.micros = input * common::Interval::MICROS_PER_HOUR;
+    }
+};
+
+struct ToMinutes {
+    static inline void operation(int64_t& input, common::interval_t& result) {
+        result.months = result.days = 0;
+        result.micros = input * common::Interval::MICROS_PER_MINUTE;
+    }
+};
+
+struct ToSeconds {
+    static inline void operation(int64_t& input, common::interval_t& result) {
+        result.months = result.days = 0;
+        result.micros = input * common::Interval::MICROS_PER_SEC;
+    }
+};
+
+struct ToMilliseconds {
+    static inline void operation(int64_t& input, common::interval_t& result) {
+        result.months = result.days = 0;
+        result.micros = input * common::Interval::MICROS_PER_MSEC;
+    }
+};
+
+struct ToMicroseconds {
+    static inline void operation(int64_t& input, common::interval_t& result) {
+        result.months = result.days = 0;
+        result.micros = input;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/interval/vector_interval_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/interval/vector_interval_functions.h
new file mode 100644
index 0000000000..0c74e17bc0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/interval/vector_interval_functions.h
@@ -0,0 +1,87 @@
+#pragma once
+
+#include "function/scalar_function.h"
+#include "interval_functions.h"
+
+namespace lbug {
+namespace function {
+
+struct IntervalFunction {
+public:
+    template<class OPERATION>
+    static function_set getUnaryIntervalFunction(std::string funcName) {
+        function_set result;
+        result.push_back(std::make_unique<ScalarFunction>(funcName,
+            std::vector<common::LogicalTypeID>{common::LogicalTypeID::INT64},
+            common::LogicalTypeID::INTERVAL,
+            ScalarFunction::UnaryExecFunction<int64_t, common::interval_t, OPERATION>));
+        return result;
+    }
+};
+
+struct ToYearsFunction {
+    static constexpr const char* name = "TO_YEARS";
+
+    static function_set getFunctionSet() {
+        return IntervalFunction::getUnaryIntervalFunction<ToYears>(name);
+    }
+};
+
+struct ToMonthsFunction {
+    static constexpr const char* name = "TO_MONTHS";
+
+    static function_set getFunctionSet() {
+        return IntervalFunction::getUnaryIntervalFunction<ToMonths>(name);
+    }
+};
+
+struct ToDaysFunction {
+    static constexpr const char* name = "TO_DAYS";
+
+    static function_set getFunctionSet() {
+        return IntervalFunction::getUnaryIntervalFunction<ToDays>(name);
+    }
+};
+
+struct ToHoursFunction {
+    static constexpr const char* name = "TO_HOURS";
+
+    static function_set getFunctionSet() {
+        return IntervalFunction::getUnaryIntervalFunction<ToHours>(name);
+    }
+};
+
+struct ToMinutesFunction {
+    static constexpr const char* name = "TO_MINUTES";
+
+    static function_set getFunctionSet() {
+        return IntervalFunction::getUnaryIntervalFunction<ToMinutes>(name);
+    }
+};
+
+struct ToSecondsFunction {
+    static constexpr const char* name = "TO_SECONDS";
+
+    static function_set getFunctionSet() {
+        return IntervalFunction::getUnaryIntervalFunction<ToSeconds>(name);
+    }
+};
+
+struct ToMillisecondsFunction {
+    static constexpr const char* name = "TO_MILLISECONDS";
+
+    static function_set getFunctionSet() {
+        return IntervalFunction::getUnaryIntervalFunction<ToMilliseconds>(name);
+    }
+};
+
+struct ToMicrosecondsFunction {
+    static constexpr const char* name = "TO_MICROSECONDS";
+
+    static function_set getFunctionSet() {
+        return IntervalFunction::getUnaryIntervalFunction<ToMicroseconds>(name);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/base_list_sort_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/base_list_sort_function.h
new file mode 100644
index 0000000000..45cfb2cf57
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/base_list_sort_function.h
@@ -0,0 +1,103 @@
+#pragma once
+
+#include "common/exception/runtime.h"
+#include "common/string_utils.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct BaseListSortOperation {
+public:
+    static inline bool isAscOrder(const std::string& sortOrder) {
+        std::string upperSortOrder = common::StringUtils::getUpper(sortOrder);
+        if (upperSortOrder == "ASC") {
+            return true;
+        } else if (upperSortOrder == "DESC") {
+            return false;
+        } else {
+            throw common::RuntimeException("Invalid sortOrder");
+        }
+    }
+
+    static inline bool isNullFirst(const std::string& nullOrder) {
+        std::string upperNullOrder = common::StringUtils::getUpper(nullOrder);
+        if (upperNullOrder == "NULLS FIRST") {
+            return true;
+        } else if (upperNullOrder == "NULLS LAST") {
+            return false;
+        } else {
+            throw common::RuntimeException("Invalid nullOrder");
+        }
+    }
+
+    template<typename T>
+    static void sortValues(common::list_entry_t& input, common::list_entry_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector, bool ascOrder,
+        bool nullFirst) {
+        // TODO(Ziyi) - Replace this sort implementation with radix_sort implementation:
+        //  https://github.com/kuzudb/kuzu/issues/1536.
+        auto inputDataVector = common::ListVector::getDataVector(&inputVector);
+        auto inputPos = input.offset;
+
+        // Calculate null count.
+        auto nullCount = 0;
+        for (auto i = 0u; i < input.size; i++) {
+            if (inputDataVector->isNull(input.offset + i)) {
+                nullCount += 1;
+            }
+        }
+
+        result = common::ListVector::addList(&resultVector, input.size);
+        auto resultDataVector = common::ListVector::getDataVector(&resultVector);
+        auto resultPos = result.offset;
+
+        // Add nulls first.
+        if (nullFirst) {
+            setVectorRangeToNull(*resultDataVector, result.offset, 0, nullCount);
+            resultPos += nullCount;
+        }
+
+        // Add actual data.
+        for (auto i = 0u; i < input.size; i++) {
+            if (inputDataVector->isNull(inputPos)) {
+                inputPos++;
+                continue;
+            }
+            resultDataVector->copyFromVectorData(resultPos++, inputDataVector, inputPos++);
+        }
+
+        // Add nulls in the end.
+        if (!nullFirst) {
+            setVectorRangeToNull(*resultDataVector, result.offset, input.size - nullCount,
+                input.size);
+        }
+
+        // Determine the starting and ending position of the data to be sorted.
+        auto sortStart = nullCount;
+        auto sortEnd = input.size;
+        if (!nullFirst) {
+            sortStart = 0;
+            sortEnd = input.size - nullCount;
+        }
+
+        // Sort the data based on order.
+        auto sortingValues =
+            reinterpret_cast<T*>(common::ListVector::getListValues(&resultVector, result));
+        if (ascOrder) {
+            std::sort(sortingValues + sortStart, sortingValues + sortEnd, std::less{});
+        } else {
+            std::sort(sortingValues + sortStart, sortingValues + sortEnd, std::greater{});
+        }
+    }
+
+    static void setVectorRangeToNull(common::ValueVector& vector, uint64_t offset,
+        uint64_t startPos, uint64_t endPos) {
+        for (auto i = startPos; i < endPos; i++) {
+            vector.setNull(offset + i, true);
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_concat_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_concat_function.h
new file mode 100644
index 0000000000..4a6992d8f3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_concat_function.h
@@ -0,0 +1,17 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct ListConcat {
+public:
+    static void operation(common::list_entry_t& left, common::list_entry_t& right,
+        common::list_entry_t& result, common::ValueVector& leftVector,
+        common::ValueVector& rightVector, common::ValueVector& resultVector);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_extract_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_extract_function.h
new file mode 100644
index 0000000000..862f98c867
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_extract_function.h
@@ -0,0 +1,54 @@
+#pragma once
+
+#include "common/exception/runtime.h"
+#include "common/type_utils.h"
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+#include "function/string/functions/array_extract_function.h"
+
+namespace lbug {
+namespace function {
+
+struct ListExtract {
+public:
+    // Note: this function takes in a 1-based position (The index of the first value in the list
+    // is 1).
+    template<typename T>
+    static inline void operation(common::list_entry_t& listEntry, int64_t pos, T& result,
+        common::ValueVector& listVector, common::ValueVector& /*posVector*/,
+        common::ValueVector& resultVector, uint64_t resPos) {
+        if (pos == 0) {
+            throw common::RuntimeException("List extract takes 1-based position.");
+        }
+        if ((pos > 0 && pos > listEntry.size) || (pos < 0 && pos < -(int64_t)listEntry.size)) {
+            throw common::RuntimeException(
+                common::stringFormat("list_extract(list, index): index={} is out of range.",
+                    common::TypeUtils::toString(pos)));
+        }
+        if (pos > 0) {
+            pos--;
+        } else {
+            pos = listEntry.size + pos;
+        }
+        auto listDataVector = common::ListVector::getDataVector(&listVector);
+        resultVector.setNull(resPos, listDataVector->isNull(listEntry.offset + pos));
+        if (!resultVector.isNull(resPos)) {
+            auto listValues =
+                common::ListVector::getListValuesWithOffset(&listVector, listEntry, pos);
+            resultVector.copyFromVectorData(reinterpret_cast<uint8_t*>(&result), listDataVector,
+                listValues);
+        }
+    }
+
+    static inline void operation(common::ku_string_t& str, int64_t& idx,
+        common::ku_string_t& result) {
+        if (str.len < idx) {
+            result.set("", 0);
+        } else {
+            ArrayExtract::operation(str, idx, result);
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_function_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_function_utils.h
new file mode 100644
index 0000000000..2230d4c454
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_function_utils.h
@@ -0,0 +1,58 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+enum class ListOp { Append, Prepend, Concat };
+
+template<ListOp op>
+struct ListTypeResolver;
+
+template<>
+struct ListTypeResolver<ListOp::Append> {
+    static void anyEmpty(std::vector<common::LogicalType>& types, common::LogicalType& targetType);
+    static void bothNull(std::vector<common::LogicalType>& types, common::LogicalType& targetType);
+    static void leftNull(std::vector<common::LogicalType>& types, common::LogicalType& targetType);
+    static void rightNull(std::vector<common::LogicalType>& types, common::LogicalType& targetType);
+    static void finalResolver(std::vector<common::LogicalType>& types,
+        common::LogicalType& targetType);
+};
+
+template<>
+struct ListTypeResolver<ListOp::Prepend>
+    : ListTypeResolver<ListOp::Append> { /*Prepend empty list resolution follows the same logic as
+                                            the Append operation*/
+};
+
+template<>
+struct ListTypeResolver<ListOp::Concat> {
+    static void leftEmpty(std::vector<common::LogicalType>& types, common::LogicalType& targetType);
+    static void rightEmpty(std::vector<common::LogicalType>& types,
+        common::LogicalType& targetType);
+    static void bothNull(std::vector<common::LogicalType>& types, common::LogicalType& targetType);
+    static void finalResolver(std::vector<common::LogicalType>& types,
+        common::LogicalType& targetType);
+};
+
+struct ListFunctionUtils {
+public:
+    using type_resolver = std::function<void(std::vector<common::LogicalType>& types,
+        common::LogicalType& targetType)>;
+
+    static void resolveEmptyList(const ScalarBindFuncInput& input,
+        std::vector<common::LogicalType>& types, type_resolver bothEmpty, type_resolver leftEmpty,
+        type_resolver rightEmpty, type_resolver finalEmptyListResolver);
+
+    static void resolveNulls(std::vector<common::LogicalType>& types, type_resolver bothNull,
+        type_resolver leftNull, type_resolver rightNull, type_resolver finalNullParamResolver);
+
+    static void resolveTypes(const ScalarBindFuncInput& input,
+        std::vector<common::LogicalType>& types, type_resolver bothEmpty, type_resolver leftEmpty,
+        type_resolver rightEmpty, type_resolver finalEmptyListResolver, type_resolver bothNull,
+        type_resolver leftNull, type_resolver rightNull, type_resolver finalNullParamResolver);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_len_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_len_function.h
new file mode 100644
index 0000000000..c94be3accf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_len_function.h
@@ -0,0 +1,41 @@
+#pragma once
+
+#include <cstring>
+
+#include "common/types/ku_string.h"
+#include "utf8proc.h"
+
+namespace lbug {
+namespace function {
+
+struct ListLen {
+public:
+    template<typename T>
+    static void operation(T& input, int64_t& result) {
+        result = input.size;
+    }
+};
+
+template<>
+inline void ListLen::operation(common::ku_string_t& input, int64_t& result) {
+    auto totalByteLength = input.len;
+    auto inputString = input.getAsString();
+    for (auto i = 0u; i < totalByteLength; i++) {
+        if (inputString[i] & 0x80) {
+            int64_t length = 0;
+            // Use grapheme iterator to identify bytes of utf8 char and increment once for each
+            // char.
+            utf8proc::utf8proc_grapheme_callback(inputString.c_str(), totalByteLength,
+                [&](size_t /*start*/, size_t /*end*/) {
+                    length++;
+                    return true;
+                });
+            result = length;
+            return;
+        }
+    }
+    result = totalByteLength;
+}
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_position_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_position_function.h
new file mode 100644
index 0000000000..34c3feab91
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_position_function.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+#include "function/comparison/comparison_functions.h"
+
+namespace lbug {
+namespace function {
+
+struct ListPosition {
+    // Note: this function takes in a 1-based element (The index of the first element in the list
+    // is 1).
+    template<typename T>
+    static void operation(common::list_entry_t& list, T& element, int64_t& result,
+        common::ValueVector& listVector, common::ValueVector& elementVector,
+        common::ValueVector& /*resultVector*/) {
+        if (common::ListType::getChildType(listVector.dataType) != elementVector.dataType) {
+            result = 0;
+            return;
+        }
+        auto listElements =
+            reinterpret_cast<T*>(common::ListVector::getListValues(&listVector, list));
+        uint8_t comparisonResult = 0;
+        for (auto i = 0u; i < list.size; i++) {
+            Equals::operation(listElements[i], element, comparisonResult,
+                common::ListVector::getDataVector(&listVector), &elementVector);
+            if (comparisonResult) {
+                result = i + 1;
+                return;
+            }
+        }
+        result = 0;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_reverse_sort_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_reverse_sort_function.h
new file mode 100644
index 0000000000..88c63c2689
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_reverse_sort_function.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "base_list_sort_function.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+template<typename T>
+struct ListReverseSort : BaseListSortOperation {
+    static inline void operation(common::list_entry_t& input, common::list_entry_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector) {
+        sortValues<T>(input, result, inputVector, resultVector, false /* ascOrder */,
+            true /* nullFirst */);
+    }
+
+    static inline void operation(common::list_entry_t& input, common::ku_string_t& nullOrder,
+        common::list_entry_t& result, common::ValueVector& inputVector,
+        common::ValueVector& /*valueVector*/, common::ValueVector& resultVector) {
+        sortValues<T>(input, result, inputVector, resultVector, false /* ascOrder */,
+            isNullFirst(nullOrder.getAsString()) /* nullFirst */);
+    }
+
+    static inline void operation(common::list_entry_t& /*input*/,
+        common::ku_string_t& /*sortOrder*/, common::ku_string_t& /*nullOrder*/,
+        common::list_entry_t& /*result*/, common::ValueVector& /*inputVector*/,
+        common::ValueVector& /*resultVector*/) {
+        throw common::RuntimeException("Invalid number of arguments");
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_sort_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_sort_function.h
new file mode 100644
index 0000000000..1cebd3d6d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_sort_function.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "base_list_sort_function.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+template<typename T>
+struct ListSort : BaseListSortOperation {
+    static void operation(common::list_entry_t& input, common::list_entry_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector) {
+        sortValues<T>(input, result, inputVector, resultVector, true /* ascOrder */,
+            true /* nullFirst */);
+    }
+
+    static void operation(common::list_entry_t& input, common::ku_string_t& sortOrder,
+        common::list_entry_t& result, common::ValueVector& inputVector,
+        common::ValueVector& /*valueVector*/, common::ValueVector& resultVector) {
+        sortValues<T>(input, result, inputVector, resultVector, isAscOrder(sortOrder.getAsString()),
+            true /* nullFirst */);
+    }
+
+    static void operation(common::list_entry_t& input, common::ku_string_t& sortOrder,
+        common::ku_string_t& nullOrder, common::list_entry_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector) {
+        sortValues<T>(input, result, inputVector, resultVector, isAscOrder(sortOrder.getAsString()),
+            isNullFirst(nullOrder.getAsString()));
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_unique_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_unique_function.h
new file mode 100644
index 0000000000..02e057e5ca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/functions/list_unique_function.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include "common/type_utils.h"
+#include "common/types/value/value.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct ValueHashFunction {
+    uint64_t operator()(const common::Value& value) const { return (uint64_t)value.computeHash(); }
+};
+
+struct ValueEquality {
+    bool operator()(const common::Value& a, const common::Value& b) const { return a == b; }
+};
+
+using ValueSet = std::unordered_set<common::Value, ValueHashFunction, ValueEquality>;
+
+using duplicate_value_handler = std::function<void(const std::string&)>;
+using unique_value_handler = std::function<void(common::ValueVector& dataVector, uint64_t pos)>;
+using null_value_handler = std::function<void()>;
+
+struct ListUnique {
+    static uint64_t appendListElementsToValueSet(common::list_entry_t& input,
+        common::ValueVector& inputVector, duplicate_value_handler duplicateValHandler = nullptr,
+        unique_value_handler uniqueValueHandler = nullptr,
+        null_value_handler nullValueHandler = nullptr);
+
+    static void operation(common::list_entry_t& input, int64_t& result,
+        common::ValueVector& inputVector, common::ValueVector& resultVector);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/vector_list_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/vector_list_functions.h
new file mode 100644
index 0000000000..54ecc6cdf7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/list/vector_list_functions.h
@@ -0,0 +1,216 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct ListCreationFunction {
+    static constexpr const char* name = "LIST_CREATION";
+
+    static function_set getFunctionSet();
+    static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+        const std::vector<common::SelectionVector*>& parameterSelVectors,
+        common::ValueVector& result, common::SelectionVector* resultSelVector,
+        void* /*dataPtr*/ = nullptr);
+};
+
+struct ListRangeFunction {
+    static constexpr const char* name = "RANGE";
+
+    static function_set getFunctionSet();
+};
+
+struct SizeFunction {
+    static constexpr const char* name = "SIZE";
+
+    static function_set getFunctionSet();
+};
+
+struct CardinalityFunction {
+    using alias = SizeFunction;
+
+    static constexpr const char* name = "CARDINALITY";
+};
+
+struct ListExtractFunction {
+    static constexpr const char* name = "LIST_EXTRACT";
+
+    static function_set getFunctionSet();
+};
+
+struct ListElementFunction {
+    using alias = ListExtractFunction;
+
+    static constexpr const char* name = "LIST_ELEMENT";
+};
+
+struct ListConcatFunction {
+    static constexpr const char* name = "LIST_CONCAT";
+
+    static function_set getFunctionSet();
+    static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input);
+};
+
+struct ListCatFunction {
+    using alias = ListConcatFunction;
+
+    static constexpr const char* name = "LIST_CAT";
+};
+
+struct ListAppendFunction {
+    static constexpr const char* name = "LIST_APPEND";
+
+    static function_set getFunctionSet();
+};
+
+struct ListPrependFunction {
+    static constexpr const char* name = "LIST_PREPEND";
+
+    static function_set getFunctionSet();
+};
+
+struct ListPositionFunction {
+    static constexpr const char* name = "LIST_POSITION";
+
+    static function_set getFunctionSet();
+};
+
+struct ListIndexOfFunction {
+    using alias = ListPositionFunction;
+
+    static constexpr const char* name = "LIST_INDEXOF";
+};
+
+struct ListContainsFunction {
+    static constexpr const char* name = "LIST_CONTAINS";
+
+    static function_set getFunctionSet();
+};
+
+struct ListHasFunction {
+    using alias = ListContainsFunction;
+
+    static constexpr const char* name = "LIST_HAS";
+};
+
+struct ListSliceFunction {
+    static constexpr const char* name = "LIST_SLICE";
+
+    static function_set getFunctionSet();
+};
+
+struct ListSortFunction {
+    static constexpr const char* name = "LIST_SORT";
+
+    static function_set getFunctionSet();
+};
+
+struct ListReverseSortFunction {
+    static constexpr const char* name = "LIST_REVERSE_SORT";
+
+    static function_set getFunctionSet();
+};
+
+struct ListSumFunction {
+    static constexpr const char* name = "LIST_SUM";
+
+    static function_set getFunctionSet();
+};
+
+struct ListProductFunction {
+    static constexpr const char* name = "LIST_PRODUCT";
+
+    static function_set getFunctionSet();
+};
+
+struct ListDistinctFunction {
+    static constexpr const char* name = "LIST_DISTINCT";
+
+    static function_set getFunctionSet();
+};
+
+struct ListUniqueFunction {
+    static constexpr const char* name = "LIST_UNIQUE";
+
+    static function_set getFunctionSet();
+};
+
+struct ListAnyValueFunction {
+    static constexpr const char* name = "LIST_ANY_VALUE";
+
+    static function_set getFunctionSet();
+};
+
+struct ListReverseFunction {
+    static constexpr const char* name = "LIST_REVERSE";
+
+    static function_set getFunctionSet();
+};
+
+struct ListToStringFunction {
+    static constexpr const char* name = "LIST_TO_STRING";
+
+    static function_set getFunctionSet();
+};
+
+struct ListTransformFunction {
+    static constexpr const char* name = "LIST_TRANSFORM";
+
+    static function_set getFunctionSet();
+};
+
+struct ListFilterFunction {
+    static constexpr const char* name = "LIST_FILTER";
+
+    static function_set getFunctionSet();
+};
+
+struct ListReduceFunction {
+    static constexpr const char* name = "LIST_REDUCE";
+
+    static function_set getFunctionSet();
+};
+
+using quantifier_handler = std::function<bool(uint64_t numSelectedValues, uint64_t originalSize)>;
+
+void execQuantifierFunc(quantifier_handler handler,
+    const std::vector<std::shared_ptr<common::ValueVector>>& input,
+    const std::vector<common::SelectionVector*>& inputSelVectors, common::ValueVector& result,
+    common::SelectionVector* resultSelVector, void* bindData);
+
+std::unique_ptr<FunctionBindData> bindQuantifierFunc(const ScalarBindFuncInput& input);
+
+struct ListAnyFunction {
+    static constexpr const char* name = "ANY";
+
+    static function_set getFunctionSet();
+};
+
+struct ListAllFunction {
+    static constexpr const char* name = "ALL";
+
+    static function_set getFunctionSet();
+};
+
+struct ListNoneFunction {
+    static constexpr const char* name = "None";
+
+    static function_set getFunctionSet();
+};
+
+struct ListSingleFunction {
+    static constexpr const char* name = "Single";
+
+    static function_set getFunctionSet();
+};
+
+struct ListHasAllFunction {
+    static constexpr const char* name = "LIST_HAS_ALL";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/base_map_extract_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/base_map_extract_function.h
new file mode 100644
index 0000000000..99a8cb9286
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/base_map_extract_function.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct BaseMapExtract {
+    static void operation(common::list_entry_t& resultEntry, common::ValueVector& resultVector,
+        uint8_t* srcValues, common::ValueVector* srcVector, uint64_t numValuesToCopy) {
+        resultEntry = common::ListVector::addList(&resultVector, numValuesToCopy);
+        auto dstValues = common::ListVector::getListValues(&resultVector, resultEntry);
+        auto dstDataVector = common::ListVector::getDataVector(&resultVector);
+        for (auto i = 0u; i < numValuesToCopy; i++) {
+            dstDataVector->copyFromVectorData(dstValues, srcVector, srcValues);
+            dstValues += dstDataVector->getNumBytesPerValue();
+            srcValues += srcVector->getNumBytesPerValue();
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_creation_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_creation_function.h
new file mode 100644
index 0000000000..2875264653
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_creation_function.h
@@ -0,0 +1,58 @@
+#pragma once
+
+#include "common/exception/runtime.h"
+#include "common/vector/value_vector.h"
+#include "function/list/functions/list_unique_function.h"
+#include "main/client_context.h"
+
+namespace lbug {
+namespace function {
+
+static void duplicateValueHandler(const std::string& key) {
+    throw common::RuntimeException{common::stringFormat("Found duplicate key: {} in map.", key)};
+}
+
+static void nullValueHandler() {
+    throw common::RuntimeException("Null value key is not allowed in map.");
+}
+
+static void validateKeys(common::list_entry_t& keyEntry, common::ValueVector& keyVector) {
+    ListUnique::appendListElementsToValueSet(keyEntry, keyVector, duplicateValueHandler,
+        nullptr /* uniqueValueHandler */, nullValueHandler);
+}
+
+struct MapCreation {
+    static void operation(common::list_entry_t& keyEntry, common::list_entry_t& valueEntry,
+        common::list_entry_t& resultEntry, common::ValueVector& keyVector,
+        common::ValueVector& valueVector, common::ValueVector& resultVector, void* dataPtr) {
+        if (keyEntry.size != valueEntry.size) {
+            throw common::RuntimeException{"Unaligned key list and value list."};
+        }
+        if (!reinterpret_cast<FunctionBindData*>(dataPtr)
+                 ->clientContext->getClientConfig()
+                 ->disableMapKeyCheck) {
+            validateKeys(keyEntry, keyVector);
+        }
+        resultEntry = common::ListVector::addList(&resultVector, keyEntry.size);
+        auto resultStructVector = common::ListVector::getDataVector(&resultVector);
+        copyListEntry(resultEntry,
+            common::StructVector::getFieldVector(resultStructVector, 0 /* keyVector */).get(),
+            keyEntry, &keyVector);
+        copyListEntry(resultEntry,
+            common::StructVector::getFieldVector(resultStructVector, 1 /* valueVector */).get(),
+            valueEntry, &valueVector);
+    }
+
+    static void copyListEntry(common::list_entry_t& resultEntry, common::ValueVector* resultVector,
+        common::list_entry_t& srcEntry, common::ValueVector* srcVector) {
+        auto resultPos = resultEntry.offset;
+        auto srcDataVector = common::ListVector::getDataVector(srcVector);
+        auto srcPos = srcEntry.offset;
+        for (auto i = 0u; i < srcEntry.size; i++) {
+            resultVector->copyFromVectorData(resultPos++, srcDataVector, srcPos++);
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_extract_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_extract_function.h
new file mode 100644
index 0000000000..b59cd3520a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_extract_function.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+#include "function/comparison/comparison_functions.h"
+
+namespace lbug {
+namespace function {
+
+struct MapExtract {
+    template<typename T>
+    static void operation(common::list_entry_t& listEntry, T& key,
+        common::list_entry_t& resultEntry, common::ValueVector& listVector,
+        common::ValueVector& keyVector, common::ValueVector& resultVector) {
+        auto mapKeyVector = common::MapVector::getKeyVector(&listVector);
+        auto mapKeyValues = common::MapVector::getMapKeys(&listVector, listEntry);
+        auto mapValVector = common::MapVector::getValueVector(&listVector);
+        auto mapValPos = listEntry.offset;
+        common::offset_vec_t mapValPoses;
+        uint8_t comparisonResult = 0;
+        for (auto i = 0u; i < listEntry.size; i++) {
+            Equals::operation(*reinterpret_cast<T*>(mapKeyValues), key, comparisonResult,
+                mapKeyVector, &keyVector);
+            if (comparisonResult) {
+                mapValPoses.push_back(mapValPos);
+            }
+            mapKeyValues += mapKeyVector->getNumBytesPerValue();
+            mapValPos++;
+        }
+        resultEntry = common::ListVector::addList(&resultVector, mapValPoses.size());
+        auto resultOffset = resultEntry.offset;
+        for (auto& valPos : mapValPoses) {
+            common::ListVector::getDataVector(&resultVector)
+                ->copyFromVectorData(resultOffset++, mapValVector, valPos);
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_keys_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_keys_function.h
new file mode 100644
index 0000000000..11c4101df3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_keys_function.h
@@ -0,0 +1,19 @@
+#pragma once
+
+#include "function/map/functions/base_map_extract_function.h"
+
+namespace lbug {
+namespace function {
+
+struct MapKeys : public BaseMapExtract {
+    static void operation(common::list_entry_t& listEntry, common::list_entry_t& resultEntry,
+        common::ValueVector& listVector, common::ValueVector& resultVector) {
+        auto mapKeyVector = common::MapVector::getKeyVector(&listVector);
+        auto mapKeyValues = common::MapVector::getMapKeys(&listVector, listEntry);
+        BaseMapExtract::operation(resultEntry, resultVector, mapKeyValues, mapKeyVector,
+            listEntry.size);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_values_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_values_function.h
new file mode 100644
index 0000000000..0d5f3f0a79
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/functions/map_values_function.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+#include "function/map/functions/base_map_extract_function.h"
+
+namespace lbug {
+namespace function {
+
+struct MapValues : public BaseMapExtract {
+    static void operation(common::list_entry_t& listEntry, common::list_entry_t& resultEntry,
+        common::ValueVector& listVector, common::ValueVector& resultVector) {
+        auto mapValueVector = common::MapVector::getValueVector(&listVector);
+        auto mapValueValues = common::MapVector::getMapValues(&listVector, listEntry);
+        BaseMapExtract::operation(resultEntry, resultVector, mapValueValues, mapValueVector,
+            listEntry.size);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/vector_map_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/vector_map_functions.h
new file mode 100644
index 0000000000..54b3f9c678
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/map/vector_map_functions.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct MapCreationFunctions {
+    static constexpr const char* name = "MAP";
+
+    static function_set getFunctionSet();
+};
+
+struct MapExtractFunctions {
+    static constexpr const char* name = "MAP_EXTRACT";
+
+    static function_set getFunctionSet();
+};
+
+struct ElementAtFunctions {
+    using alias = MapExtractFunctions;
+
+    static constexpr const char* name = "ELEMENT_AT";
+};
+
+struct MapKeysFunctions {
+    static constexpr const char* name = "MAP_KEYS";
+
+    static function_set getFunctionSet();
+};
+
+struct MapValuesFunctions {
+    static constexpr const char* name = "MAP_VALUES";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/null/null_function_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/null/null_function_executor.h
new file mode 100644
index 0000000000..8e2ef81087
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/null/null_function_executor.h
@@ -0,0 +1,69 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct NullOperationExecutor {
+
+    template<typename FUNC>
+    static void execute(common::ValueVector& operand, common::SelectionVector& operandSelVector,
+        common::ValueVector& result) {
+        KU_ASSERT(result.dataType.getLogicalTypeID() == common::LogicalTypeID::BOOL);
+        auto resultValues = (uint8_t*)result.getData();
+        if (operand.state->isFlat()) {
+            auto pos = operandSelVector[0];
+            auto resultPos = result.state->getSelVector()[0];
+            FUNC::operation(operand.getValue<uint8_t>(pos), (bool)operand.isNull(pos),
+                resultValues[resultPos]);
+        } else {
+            if (operandSelVector.isUnfiltered()) {
+                for (auto i = 0u; i < operandSelVector.getSelSize(); i++) {
+                    FUNC::operation(operand.getValue<uint8_t>(i), (bool)operand.isNull(i),
+                        resultValues[i]);
+                }
+            } else {
+                for (auto i = 0u; i < operandSelVector.getSelSize(); i++) {
+                    auto pos = operandSelVector[i];
+                    FUNC::operation(operand.getValue<uint8_t>(pos), (bool)operand.isNull(pos),
+                        resultValues[pos]);
+                }
+            }
+        }
+    }
+
+    template<typename FUNC>
+    static bool select(common::ValueVector& operand, common::SelectionVector& selVector,
+        void* /*dataPtr*/) {
+        auto& operandSelVector = operand.state->getSelVector();
+        if (operand.state->isFlat()) {
+            auto pos = operandSelVector[0];
+            uint8_t resultValue = 0;
+            FUNC::operation(operand.getValue<uint8_t>(pos), operand.isNull(pos), resultValue);
+            return resultValue == true;
+        } else {
+            uint64_t numSelectedValues = 0;
+            auto buffer = selVector.getMutableBuffer();
+            for (auto i = 0ul; i < operandSelVector.getSelSize(); i++) {
+                auto pos = operandSelVector[i];
+                selectOnValue<FUNC>(operand, pos, numSelectedValues, buffer);
+            }
+            selVector.setSelSize(numSelectedValues);
+            return numSelectedValues > 0;
+        }
+    }
+
+    template<typename FUNC>
+    static void selectOnValue(common::ValueVector& operand, uint64_t operandPos,
+        uint64_t& numSelectedValues, std::span<common::sel_t> selectedPositionsBuffer) {
+        uint8_t resultValue = 0;
+        FUNC::operation(operand.getValue<uint8_t>(operandPos), operand.isNull(operandPos),
+            resultValue);
+        selectedPositionsBuffer[numSelectedValues] = operandPos;
+        numSelectedValues += resultValue == true;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/null/null_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/null/null_functions.h
new file mode 100644
index 0000000000..94efa83689
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/null/null_functions.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace function {
+
+struct IsNull {
+    template<class T>
+    static inline void operation(T /*value*/, bool isNull, uint8_t& result) {
+        result = isNull;
+    }
+};
+
+struct IsNotNull {
+    template<class T>
+    static inline void operation(T /*value*/, bool isNull, uint8_t& result) {
+        result = !isNull;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/null/vector_null_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/null/vector_null_functions.h
new file mode 100644
index 0000000000..9347d54414
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/null/vector_null_functions.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "function/scalar_function.h"
+#include "null_function_executor.h"
+
+namespace lbug {
+namespace function {
+
+class VectorNullFunction {
+public:
+    static void bindExecFunction(common::ExpressionType expressionType,
+        const binder::expression_vector& children, scalar_func_exec_t& func);
+
+    static void bindSelectFunction(common::ExpressionType expressionType,
+        const binder::expression_vector& children, scalar_func_select_t& func);
+
+private:
+    template<typename FUNC>
+    static void UnaryNullExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector*, void* /*dataPtr*/ = nullptr) {
+        KU_ASSERT(params.size() == 1);
+        NullOperationExecutor::execute<FUNC>(*params[0], *paramSelVectors[0], result);
+    }
+
+    template<typename FUNC>
+    static bool UnaryNullSelectFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        common::SelectionVector& selVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 1);
+        return NullOperationExecutor::select<FUNC>(*params[0], selVector, dataPtr);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/path/path_function_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/path/path_function_executor.h
new file mode 100644
index 0000000000..f47cecf34a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/path/path_function_executor.h
@@ -0,0 +1,132 @@
+#pragma once
+
+#include "common/constants.h"
+#include "common/vector/value_vector.h"
+#include "function/hash/hash_functions.h"
+
+namespace lbug {
+namespace function {
+
+static bool isAllInternalIDDistinct(common::ValueVector* dataVector, common::offset_t startOffset,
+    uint64_t size, std::unordered_set<common::internalID_t, InternalIDHasher>& internalIDSet) {
+    internalIDSet.clear();
+    for (auto i = 0u; i < size; ++i) {
+        auto& internalID = dataVector->getValue<common::internalID_t>(startOffset + i);
+        if (internalIDSet.contains(internalID)) {
+            return false;
+        }
+        internalIDSet.insert(internalID);
+    }
+    return true;
+}
+
+// Note: this executor is only used for isTrail and isAcyclic. So we add some ad-hoc optimization
+// into executor, e.g. internalIDSet. A more general implementation can be done once needed. But
+// pay attention to the performance drop. Depends on how bad it becomes, we may want to implement
+// customized executors.
+struct UnaryPathExecutor {
+    static void executeNodeIDs(common::ValueVector& input, common::SelectionVector& inputSelVector,
+        common::ValueVector& result) {
+        auto nodesFieldIdx = 0;
+        KU_ASSERT(nodesFieldIdx ==
+                  common::StructType::getFieldIdx(input.dataType, common::InternalKeyword::NODES));
+        auto nodesVector = common::StructVector::getFieldVector(&input, nodesFieldIdx).get();
+        auto internalIDFieldIdx = 0;
+        execute(inputSelVector, *nodesVector, internalIDFieldIdx, result);
+    }
+
+    static void executeRelIDs(common::ValueVector& input, common::SelectionVector& inputSelVector,
+        common::ValueVector& result) {
+        auto relsFieldIdx = 1;
+        KU_ASSERT(relsFieldIdx ==
+                  common::StructType::getFieldIdx(input.dataType, common::InternalKeyword::RELS));
+        auto relsVector = common::StructVector::getFieldVector(&input, relsFieldIdx).get();
+        auto internalIDFieldIdx = 3;
+        execute(inputSelVector, *relsVector, internalIDFieldIdx, result);
+    }
+
+    static bool selectNodeIDs(common::ValueVector& input,
+        common::SelectionVector& selectionVector) {
+        auto nodesFieldIdx = 0;
+        KU_ASSERT(nodesFieldIdx ==
+                  common::StructType::getFieldIdx(input.dataType, common::InternalKeyword::NODES));
+        auto nodesVector = common::StructVector::getFieldVector(&input, nodesFieldIdx).get();
+        auto internalIDFieldIdx = 0;
+        return select(input.state->getSelVector(), *nodesVector, internalIDFieldIdx,
+            selectionVector);
+    }
+
+    static bool selectRelIDs(common::ValueVector& input, common::SelectionVector& selectionVector) {
+        auto relsFieldIdx = 1;
+        KU_ASSERT(relsFieldIdx ==
+                  common::StructType::getFieldIdx(input.dataType, common::InternalKeyword::RELS));
+        auto relsVector = common::StructVector::getFieldVector(&input, relsFieldIdx).get();
+        auto internalIDFieldIdx = 3;
+        return select(input.state->getSelVector(), *relsVector, internalIDFieldIdx,
+            selectionVector);
+    }
+
+private:
+    static void execute(const common::SelectionVector& inputSelVector,
+        common::ValueVector& listVector, common::struct_field_idx_t fieldIdx,
+        common::ValueVector& result) {
+        auto listDataVector = common::ListVector::getDataVector(&listVector);
+        KU_ASSERT(fieldIdx == common::StructType::getFieldIdx(listDataVector->dataType,
+                                  common::InternalKeyword::ID));
+        auto internalIDsVector =
+            common::StructVector::getFieldVector(listDataVector, fieldIdx).get();
+        std::unordered_set<common::nodeID_t, InternalIDHasher> internalIDSet;
+        if (inputSelVector.isUnfiltered()) {
+            for (auto i = 0u; i < inputSelVector.getSelSize(); ++i) {
+                auto& listEntry = listVector.getValue<common::list_entry_t>(i);
+                bool isTrail = isAllInternalIDDistinct(internalIDsVector, listEntry.offset,
+                    listEntry.size, internalIDSet);
+                result.setValue<bool>(i, isTrail);
+            }
+        } else {
+            for (auto i = 0u; i < inputSelVector.getSelSize(); ++i) {
+                auto pos = inputSelVector[i];
+                auto& listEntry = listVector.getValue<common::list_entry_t>(pos);
+                bool isTrail = isAllInternalIDDistinct(internalIDsVector, listEntry.offset,
+                    listEntry.size, internalIDSet);
+                result.setValue<bool>(pos, isTrail);
+            }
+        }
+    }
+
+    static bool select(const common::SelectionVector& inputSelVector,
+        common::ValueVector& listVector, common::struct_field_idx_t fieldIdx,
+        common::SelectionVector& selectionVector) {
+        auto listDataVector = common::ListVector::getDataVector(&listVector);
+        KU_ASSERT(fieldIdx == common::StructType::getFieldIdx(listDataVector->dataType,
+                                  common::InternalKeyword::ID));
+        auto internalIDsVector =
+            common::StructVector::getFieldVector(listDataVector, fieldIdx).get();
+        std::unordered_set<common::nodeID_t, InternalIDHasher> internalIDSet;
+        auto numSelectedValues = 0u;
+        auto buffer = selectionVector.getMutableBuffer();
+        if (inputSelVector.isUnfiltered()) {
+            for (auto i = 0u; i < inputSelVector.getSelSize(); ++i) {
+                auto& listEntry = listVector.getValue<common::list_entry_t>(i);
+                bool isTrail = isAllInternalIDDistinct(internalIDsVector, listEntry.offset,
+                    listEntry.size, internalIDSet);
+                buffer[numSelectedValues] = i;
+                numSelectedValues += isTrail;
+            }
+        } else {
+            for (auto i = 0u; i < inputSelVector.getSelSize(); ++i) {
+                auto pos = inputSelVector[i];
+                auto& listEntry = listVector.getValue<common::list_entry_t>(pos);
+                bool isTrail = isAllInternalIDDistinct(internalIDsVector, listEntry.offset,
+                    listEntry.size, internalIDSet);
+                buffer[numSelectedValues] = pos;
+                numSelectedValues += isTrail;
+            }
+        }
+        selectionVector.setSelSize(numSelectedValues);
+        return numSelectedValues > 0;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/path/vector_path_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/path/vector_path_functions.h
new file mode 100644
index 0000000000..f7faf1b038
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/path/vector_path_functions.h
@@ -0,0 +1,62 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct NodesFunction {
+    static constexpr const char* name = "NODES";
+
+    static function_set getFunctionSet();
+};
+
+struct RelsFunction {
+    static constexpr const char* name = "RELS";
+
+    static function_set getFunctionSet();
+};
+
+struct RelationshipsFunction {
+    using alias = RelsFunction;
+
+    static constexpr const char* name = "RELATIONSHIPS";
+};
+
+struct PropertiesBindData : public FunctionBindData {
+    common::idx_t childIdx;
+
+    PropertiesBindData(common::LogicalType dataType, common::idx_t childIdx)
+        : FunctionBindData{std::move(dataType)}, childIdx{childIdx} {}
+
+    inline std::unique_ptr<FunctionBindData> copy() const override {
+        return std::make_unique<PropertiesBindData>(resultType.copy(), childIdx);
+    }
+};
+
+struct PropertiesFunction {
+    static constexpr const char* name = "PROPERTIES";
+
+    static function_set getFunctionSet();
+};
+
+struct IsTrailFunction {
+    static constexpr const char* name = "IS_TRAIL";
+
+    static function_set getFunctionSet();
+};
+
+struct IsACyclicFunction {
+    static constexpr const char* name = "IS_ACYCLIC";
+
+    static function_set getFunctionSet();
+};
+
+struct LengthFunction {
+    static constexpr const char* name = "LENGTH";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/pointer_function_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/pointer_function_executor.h
new file mode 100644
index 0000000000..c295dc3fbe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/pointer_function_executor.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct PointerFunctionExecutor {
+    template<typename RESULT_TYPE, typename OP>
+    static void execute(common::ValueVector& result, common::SelectionVector& sel, void* dataPtr) {
+        if (sel.isUnfiltered()) {
+            for (auto i = 0u; i < sel.getSelSize(); i++) {
+                OP::operation(result.getValue<RESULT_TYPE>(i), dataPtr);
+            }
+        } else {
+            for (auto i = 0u; i < sel.getSelSize(); i++) {
+                auto pos = sel[i];
+                OP::operation(result.getValue<RESULT_TYPE>(pos), dataPtr);
+            }
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/rewrite_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/rewrite_function.h
new file mode 100644
index 0000000000..7753b893b3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/rewrite_function.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include "function.h"
+
+namespace lbug {
+namespace binder {
+class ExpressionBinder;
+}
+namespace function {
+
+struct RewriteFunctionBindInput {
+    main::ClientContext* context;
+    binder::ExpressionBinder* expressionBinder;
+    binder::expression_vector arguments;
+
+    RewriteFunctionBindInput(main::ClientContext* context,
+        binder::ExpressionBinder* expressionBinder, binder::expression_vector arguments)
+        : context{context}, expressionBinder{expressionBinder}, arguments{std::move(arguments)} {}
+};
+
+// Rewrite function to a different expression, e.g. id(n) -> n._id.
+using rewrite_func_rewrite_t =
+    std::function<std::shared_ptr<binder::Expression>(const RewriteFunctionBindInput&)>;
+
+// We write for the following functions
+// ID(n) -> n._id
+struct RewriteFunction final : Function {
+    rewrite_func_rewrite_t rewriteFunc;
+
+    RewriteFunction(std::string name, std::vector<common::LogicalTypeID> parameterTypeIDs,
+        rewrite_func_rewrite_t rewriteFunc)
+        : Function{std::move(name), std::move(parameterTypeIDs)},
+          rewriteFunc{std::move(rewriteFunc)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(RewriteFunction)
+
+private:
+    RewriteFunction(const RewriteFunction& other)
+        : Function{other}, rewriteFunc{other.rewriteFunc} {}
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/scalar_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/scalar_function.h
new file mode 100644
index 0000000000..e910c78ad4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/scalar_function.h
@@ -0,0 +1,251 @@
+#pragma once
+
+#include "binary_function_executor.h"
+#include "const_function_executor.h"
+#include "function.h"
+#include "pointer_function_executor.h"
+#include "ternary_function_executor.h"
+#include "unary_function_executor.h"
+
+namespace lbug {
+namespace function {
+
+// Evaluate function at compile time, e.g. struct_extraction.
+using scalar_func_compile_exec_t =
+    std::function<void(FunctionBindData*, const std::vector<std::shared_ptr<common::ValueVector>>&,
+        std::shared_ptr<common::ValueVector>&)>;
+// Execute function.
+using scalar_func_exec_t =
+    std::function<void(const std::vector<std::shared_ptr<common::ValueVector>>&,
+        const std::vector<common::SelectionVector*>&, common::ValueVector&,
+        common::SelectionVector*, void*)>;
+// Execute boolean function and write result to selection vector. Fast path for filter.
+using scalar_func_select_t = std::function<bool(
+    const std::vector<std::shared_ptr<common::ValueVector>>&, common::SelectionVector&, void*)>;
+
+struct LBUG_API ScalarFunction : public ScalarOrAggregateFunction {
+    scalar_func_exec_t execFunc = nullptr;
+    scalar_func_select_t selectFunc = nullptr;
+    scalar_func_compile_exec_t compileFunc = nullptr;
+    bool isListLambda = false;
+    bool isVarLength = false;
+
+    ScalarFunction() = default;
+    ScalarFunction(std::string name, std::vector<common::LogicalTypeID> parameterTypeIDs,
+        common::LogicalTypeID returnTypeID)
+        : ScalarOrAggregateFunction{std::move(name), std::move(parameterTypeIDs), returnTypeID} {}
+    ScalarFunction(std::string name, std::vector<common::LogicalTypeID> parameterTypeIDs,
+        common::LogicalTypeID returnTypeID, scalar_func_exec_t execFunc)
+        : ScalarOrAggregateFunction{std::move(name), std::move(parameterTypeIDs), returnTypeID},
+          execFunc{std::move(execFunc)} {}
+    ScalarFunction(std::string name, std::vector<common::LogicalTypeID> parameterTypeIDs,
+        common::LogicalTypeID returnTypeID, scalar_func_exec_t execFunc,
+        scalar_func_select_t selectFunc)
+        : ScalarOrAggregateFunction{std::move(name), std::move(parameterTypeIDs), returnTypeID},
+          execFunc{std::move(execFunc)}, selectFunc{std::move(selectFunc)} {}
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void TernaryExecFunction(const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr = nullptr) {
+        KU_ASSERT(params.size() == 3);
+        TernaryFunctionExecutor::executeSwitch<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC,
+            TernaryFunctionWrapper>(*params[0], paramSelVectors[0], *params[1], paramSelVectors[1],
+            *params[2], paramSelVectors[2], result, resultSelVector, dataPtr);
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void TernaryStringExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr = nullptr) {
+        KU_ASSERT(params.size() == 3);
+        TernaryFunctionExecutor::executeSwitch<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC,
+            TernaryStringFunctionWrapper>(*params[0], paramSelVectors[0], *params[1],
+            paramSelVectors[1], *params[2], paramSelVectors[2], result, resultSelVector, dataPtr);
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void TernaryRegexExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        TernaryFunctionExecutor::executeSwitch<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC,
+            TernaryRegexFunctionWrapper>(*params[0], paramSelVectors[0], *params[1],
+            paramSelVectors[1], *params[2], paramSelVectors[2], result, resultSelVector, dataPtr);
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void TernaryExecListStructFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr = nullptr) {
+        KU_ASSERT(params.size() == 3);
+        TernaryFunctionExecutor::executeSwitch<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC,
+            TernaryListFunctionWrapper>(*params[0], paramSelVectors[0], *params[1],
+            paramSelVectors[1], *params[2], paramSelVectors[2], result, resultSelVector, dataPtr);
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void BinaryExecFunction(const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* /*dataPtr*/ = nullptr) {
+        KU_ASSERT(params.size() == 2);
+        BinaryFunctionExecutor::execute<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC>(*params[0],
+            paramSelVectors[0], *params[1], paramSelVectors[1], result, resultSelVector);
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void BinaryStringExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr = nullptr) {
+        KU_ASSERT(params.size() == 2);
+        BinaryFunctionExecutor::executeSwitch<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC,
+            BinaryStringFunctionWrapper>(*params[0], paramSelVectors[0], *params[1],
+            paramSelVectors[1], result, resultSelVector, dataPtr);
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void BinaryExecListStructFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr = nullptr) {
+        KU_ASSERT(params.size() == 2);
+        BinaryFunctionExecutor::executeSwitch<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC,
+            BinaryListStructFunctionWrapper>(*params[0], paramSelVectors[0], *params[1],
+            paramSelVectors[1], result, resultSelVector, dataPtr);
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void BinaryExecWithBindData(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 2);
+        BinaryFunctionExecutor::executeSwitch<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE, FUNC,
+            BinaryMapCreationFunctionWrapper>(*params[0], paramSelVectors[0], *params[1],
+            paramSelVectors[1], result, resultSelVector, dataPtr);
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename FUNC>
+    static bool BinarySelectFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        common::SelectionVector& selVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 2);
+        return BinaryFunctionExecutor::select<LEFT_TYPE, RIGHT_TYPE, FUNC>(*params[0], *params[1],
+            selVector, dataPtr);
+    }
+
+    template<typename LEFT_TYPE, typename RIGHT_TYPE, typename FUNC>
+    static bool BinarySelectWithBindData(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        common::SelectionVector& selVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 2);
+        return BinaryFunctionExecutor::select<LEFT_TYPE, RIGHT_TYPE, FUNC,
+            BinarySelectWithBindDataWrapper>(*params[0], *params[1], selVector, dataPtr);
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename EXECUTOR = UnaryFunctionExecutor>
+    static void UnaryExecFunction(const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 1);
+        EXECUTOR::template executeSwitch<OPERAND_TYPE, RESULT_TYPE, FUNC, UnaryFunctionWrapper>(
+            *params[0], paramSelVectors[0], result, resultSelVector, dataPtr);
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void UnarySequenceExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 1);
+        UnaryFunctionExecutor::executeSequence<OPERAND_TYPE, RESULT_TYPE, FUNC>(*params[0],
+            paramSelVectors[0], result, resultSelVector, dataPtr);
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void UnaryStringExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* /*dataPtr*/ = nullptr) {
+        KU_ASSERT(params.size() == 1);
+        UnaryFunctionExecutor::executeSwitch<OPERAND_TYPE, RESULT_TYPE, FUNC,
+            UnaryStringFunctionWrapper>(*params[0], paramSelVectors[0], result, resultSelVector,
+            nullptr /* dataPtr */);
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename EXECUTOR = UnaryFunctionExecutor>
+    static void UnaryCastStringExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 1);
+        EXECUTOR::template executeSwitch<OPERAND_TYPE, RESULT_TYPE, FUNC,
+            UnaryCastStringFunctionWrapper>(*params[0], paramSelVectors[0], result, resultSelVector,
+            dataPtr);
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename EXECUTOR = UnaryFunctionExecutor, typename WRAPPER = UnaryCastFunctionWrapper>
+    static void UnaryCastExecFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 1);
+        EXECUTOR::template executeSwitch<OPERAND_TYPE, RESULT_TYPE, FUNC, WRAPPER>(*params[0],
+            paramSelVectors[0], result, resultSelVector, dataPtr);
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename EXECUTOR = UnaryFunctionExecutor>
+    static void UnaryExecNestedTypeFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 1);
+        EXECUTOR::template executeSwitch<OPERAND_TYPE, RESULT_TYPE, FUNC,
+            UnaryNestedTypeFunctionWrapper>(*params[0], paramSelVectors[0], result, resultSelVector,
+            dataPtr);
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename EXECUTOR = UnaryFunctionExecutor>
+    static void UnarySetSeedFunction(
+        const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        const std::vector<common::SelectionVector*>& paramSelVectors, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(params.size() == 1);
+        EXECUTOR::template executeSwitch<OPERAND_TYPE, RESULT_TYPE, FUNC, SetSeedFunctionWrapper>(
+            *params[0], paramSelVectors[0], result, resultSelVector, dataPtr);
+    }
+
+    template<typename RESULT_TYPE, typename FUNC>
+    static void NullaryExecFunction(
+        [[maybe_unused]] const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        [[maybe_unused]] const std::vector<common::SelectionVector*>& paramSelVectors,
+        common::ValueVector& result, common::SelectionVector* resultSelVector,
+        void* /*dataPtr*/ = nullptr) {
+        KU_ASSERT(params.empty() && paramSelVectors.empty());
+        ConstFunctionExecutor::execute<RESULT_TYPE, FUNC>(result, *resultSelVector);
+    }
+
+    template<typename RESULT_TYPE, typename FUNC>
+    static void NullaryAuxilaryExecFunction(
+        [[maybe_unused]] const std::vector<std::shared_ptr<common::ValueVector>>& params,
+        [[maybe_unused]] const std::vector<common::SelectionVector*>& paramSelVectors,
+        common::ValueVector& result, common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(params.empty() && paramSelVectors.empty());
+        PointerFunctionExecutor::execute<RESULT_TYPE, FUNC>(result, *resultSelVector, dataPtr);
+    }
+
+    virtual std::unique_ptr<ScalarFunction> copy() const {
+        return std::make_unique<ScalarFunction>(*this);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/scalar_macro_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/scalar_macro_function.h
new file mode 100644
index 0000000000..9a8394ead2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/scalar_macro_function.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include <unordered_map>
+
+#include "parser/create_macro.h"
+
+namespace lbug {
+namespace function {
+
+using macro_parameter_value_map = std::unordered_map<std::string, parser::ParsedExpression*>;
+
+struct ScalarMacroFunction {
+    std::unique_ptr<parser::ParsedExpression> expression;
+    std::vector<std::string> positionalArgs;
+    parser::default_macro_args defaultArgs;
+
+    ScalarMacroFunction() = default;
+
+    ScalarMacroFunction(std::unique_ptr<parser::ParsedExpression> expression,
+        std::vector<std::string> positionalArgs, parser::default_macro_args defaultArgs)
+        : expression{std::move(expression)}, positionalArgs{std::move(positionalArgs)},
+          defaultArgs{std::move(defaultArgs)} {}
+
+    std::string getDefaultParameterName(uint64_t idx) const { return defaultArgs[idx].first; }
+
+    uint64_t getNumArgs() const { return positionalArgs.size() + defaultArgs.size(); }
+
+    std::vector<std::string> getPositionalArgs() const { return positionalArgs; }
+
+    macro_parameter_value_map getDefaultParameterVals() const;
+
+    std::unique_ptr<ScalarMacroFunction> copy() const;
+
+    void serialize(common::Serializer& serializer) const;
+
+    std::string toCypher(const std::string& name) const;
+
+    static std::unique_ptr<ScalarMacroFunction> deserialize(common::Deserializer& deserializer);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/schema/offset_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/schema/offset_functions.h
new file mode 100644
index 0000000000..ba41162f01
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/schema/offset_functions.h
@@ -0,0 +1,14 @@
+#pragma once
+
+#include "common/types/types.h"
+
+namespace lbug {
+namespace function {
+
+struct Offset {
+
+    static void operation(common::internalID_t& input, int64_t& result) { result = input.offset; }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/schema/vector_node_rel_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/schema/vector_node_rel_functions.h
new file mode 100644
index 0000000000..c917d95a71
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/schema/vector_node_rel_functions.h
@@ -0,0 +1,54 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct RewriteFunctionBindInput;
+
+struct OffsetFunction {
+    static constexpr const char* name = "OFFSET";
+
+    static function_set getFunctionSet();
+};
+
+struct IDFunction {
+    static constexpr const char* name = "ID";
+
+    static function_set getFunctionSet();
+};
+
+struct StartNodeFunction {
+    static constexpr const char* name = "START_NODE";
+
+    static function_set getFunctionSet();
+};
+
+struct EndNodeFunction {
+    static constexpr const char* name = "END_NODE";
+
+    static function_set getFunctionSet();
+};
+
+struct LabelFunction {
+    static constexpr const char* name = "LABEL";
+
+    static function_set getFunctionSet();
+    static std::shared_ptr<binder::Expression> rewriteFunc(const RewriteFunctionBindInput& input);
+};
+
+struct LabelsFunction {
+    using alias = LabelFunction;
+
+    static constexpr const char* name = "LABELS";
+};
+
+struct CostFunction {
+    static constexpr const char* name = "COST";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/sequence/sequence_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/sequence/sequence_functions.h
new file mode 100644
index 0000000000..31e82dfc81
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/sequence/sequence_functions.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct CurrValFunction {
+    static constexpr const char* name = "CURRVAL";
+
+    static function_set getFunctionSet();
+};
+
+struct NextValFunction {
+    static constexpr const char* name = "NEXTVAL";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/array_extract_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/array_extract_function.h
new file mode 100644
index 0000000000..2d8766bf9b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/array_extract_function.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include <cstring>
+
+#include "common/types/ku_string.h"
+#include "function/list/functions/list_len_function.h"
+
+namespace lbug {
+namespace function {
+
+struct ArrayExtract {
+    static inline void operation(common::ku_string_t& str, int64_t& idx,
+        common::ku_string_t& result) {
+        if (idx == 0) {
+            result.len = 0;
+            return;
+        }
+        auto stringVal = str.getAsString();
+        int64_t strLen = 0;
+        ListLen::operation(str, strLen);
+        auto idxPos = idx > 0 ? std::min(idx, strLen) : std::max(strLen + idx, (int64_t)0) + 1;
+        auto startPos = idxPos - 1;
+        auto endPos = startPos + 1;
+        bool isAscii = true;
+        for (auto i = 0u; i < std::min((size_t)idxPos + 1, stringVal.size()); i++) {
+            if (stringVal[i] & 0x80) {
+                isAscii = false;
+                break;
+            }
+        }
+        if (isAscii) {
+            copySubstr(str, idxPos, 1 /* length */, result, isAscii);
+        } else {
+            int64_t characterCount = 0, startBytePos = 0, endBytePos = 0;
+            lbug::utf8proc::utf8proc_grapheme_callback(stringVal.c_str(), stringVal.size(),
+                [&](int64_t gstart, int64_t /*gend*/) {
+                    if (characterCount == startPos) {
+                        startBytePos = gstart;
+                    } else if (characterCount == endPos) {
+                        endBytePos = gstart;
+                        return false;
+                    }
+                    characterCount++;
+                    return true;
+                });
+            if (endBytePos == 0) {
+                endBytePos = str.len;
+            }
+            copySubstr(str, startBytePos, endBytePos - startBytePos, result, isAscii);
+        }
+    }
+
+    static inline void copySubstr(common::ku_string_t& src, int64_t start, int64_t len,
+        common::ku_string_t& result, bool isAscii) {
+        result.len = std::min(len, src.len - start + 1);
+        if (isAscii) {
+            memcpy((uint8_t*)result.getData(), src.getData() + start - 1, result.len);
+        } else {
+            memcpy((uint8_t*)result.getData(), src.getData() + start, result.len);
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_lower_upper_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_lower_upper_function.h
new file mode 100644
index 0000000000..7e6ed7a2f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_lower_upper_function.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "common/api.h"
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct BaseLowerUpperFunction {
+
+    LBUG_API static void operation(common::ku_string_t& input, common::ku_string_t& result,
+        common::ValueVector& resultValueVector, bool isUpper);
+
+    static void convertCharCase(char* result, const char* input, int32_t charPos, bool toUpper,
+        int& originalSize, int& newSize);
+    static void convertCase(char* result, uint32_t len, char* input, bool toUpper);
+    static uint32_t getResultLen(char* inputStr, uint32_t inputLen, bool isUpper);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_pad_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_pad_function.h
new file mode 100644
index 0000000000..e48f1d66cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_pad_function.h
@@ -0,0 +1,59 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+#include "utf8proc.h"
+
+namespace lbug {
+namespace function {
+
+// Padding logic has been taken from DuckDB:
+// https://github.com/duckdb/duckdb/blob/master/src/function/scalar/string/pad.cpp
+struct BasePadOperation {
+public:
+    static inline void operation(common::ku_string_t& src, int64_t count,
+        common::ku_string_t& characterToPad, common::ku_string_t& result,
+        common::ValueVector& resultValueVector,
+        void (*padOperation)(common::ku_string_t& src, int64_t count,
+            common::ku_string_t& characterToPad, std::string& paddedResult)) {
+        if (count < 0) {
+            count = 0;
+        }
+        std::string paddedResult;
+        padOperation(src, count, characterToPad, paddedResult);
+        common::StringVector::addString(&resultValueVector, result, paddedResult.data(),
+            paddedResult.size());
+    }
+
+    static std::pair<uint32_t, uint32_t> padCountChars(const uint32_t count, const char* data,
+        const uint32_t size) {
+        auto str = reinterpret_cast<const utf8proc::utf8proc_uint8_t*>(data);
+        uint32_t byteCount = 0, charCount = 0;
+        for (; charCount < count && byteCount < size; charCount++) {
+            utf8proc::utf8proc_int32_t codepoint = 0;
+            auto bytes = utf8proc::utf8proc_iterate(str + byteCount, size - byteCount, &codepoint);
+            byteCount += bytes;
+        }
+        return {byteCount, charCount};
+    }
+
+    static void insertPadding(uint32_t charCount, common::ku_string_t pad, std::string& result) {
+        auto padData = pad.getData();
+        auto padSize = pad.len;
+        uint32_t padByteCount = 0;
+        for (auto i = 0u; i < charCount; i++) {
+            if (padByteCount >= padSize) {
+                result.insert(result.end(), (char*)padData, (char*)(padData + padByteCount));
+                padByteCount = 0;
+            }
+            utf8proc::utf8proc_int32_t codepoint = 0;
+            auto bytes = utf8proc::utf8proc_iterate(padData + padByteCount, padSize - padByteCount,
+                &codepoint);
+            padByteCount += bytes;
+        }
+        result.insert(result.end(), (char*)padData, (char*)(padData + padByteCount));
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_regexp_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_regexp_function.h
new file mode 100644
index 0000000000..5a5bcaf1e3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_regexp_function.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include <regex>
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct BaseRegexpOperation {
+    static inline std::string parseCypherPattern(const std::string& pattern) {
+        // Cypher parses escape characters with 2 backslash eg. for expressing '.' requires '\\.'
+        // Since Regular Expression requires only 1 backslash '\.' we need to replace double slash
+        // with single
+        return std::regex_replace(pattern, std::regex(R"(\\\\)"), "\\");
+    }
+
+    static inline void copyToLbugString(const std::string& value, common::ku_string_t& kuString,
+        common::ValueVector& valueVector) {
+        common::StringVector::addString(&valueVector, kuString, value.data(), value.length());
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_str_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_str_function.h
new file mode 100644
index 0000000000..e248aff604
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/base_str_function.h
@@ -0,0 +1,17 @@
+#pragma once
+
+#include "common/api.h"
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct BaseStrOperation {
+public:
+    LBUG_API static void operation(common::ku_string_t& input, common::ku_string_t& result,
+        common::ValueVector& resultValueVector, uint32_t (*strOperation)(char* data, uint32_t len));
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/contains_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/contains_function.h
new file mode 100644
index 0000000000..17f686e289
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/contains_function.h
@@ -0,0 +1,19 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+#include "function/string/functions/find_function.h"
+
+namespace lbug {
+namespace function {
+
+struct Contains {
+    static inline void operation(common::ku_string_t& left, common::ku_string_t& right,
+        uint8_t& result) {
+        int64_t pos = 0;
+        Find::operation(left, right, pos);
+        result = (pos != 0);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/ends_with_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/ends_with_function.h
new file mode 100644
index 0000000000..98c5c763d7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/ends_with_function.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace function {
+
+struct EndsWith {
+    static inline void operation(common::ku_string_t& left, common::ku_string_t& right,
+        uint8_t& result) {
+        if (right.len > left.len) {
+            result = 0;
+            return;
+        }
+        auto lenDiff = left.len - right.len;
+        auto lData = left.getData();
+        auto rData = right.getData();
+        for (auto i = 0u; i < right.len; i++) {
+            if (rData[i] != lData[lenDiff + i]) {
+                result = 0;
+                return;
+            }
+        }
+        result = 1;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/find_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/find_function.h
new file mode 100644
index 0000000000..383a190432
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/find_function.h
@@ -0,0 +1,41 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace function {
+
+// The string find algorithm is copied from duckdb. Source code:
+// https://github.com/duckdb/duckdb/blob/master/src/function/scalar/string/contains.cpp
+
+struct Find {
+    static inline void operation(common::ku_string_t& left, common::ku_string_t& right,
+        int64_t& result) {
+        if (right.len == 0) {
+            result = 1;
+        } else if (right.len > left.len) {
+            result = 0;
+        }
+        result = Find::find(left.getData(), left.len, right.getData(), right.len) + 1;
+    }
+
+private:
+    template<class UNSIGNED>
+    static int64_t unalignedNeedleSizeFind(const uint8_t* haystack, uint32_t haystackLen,
+        const uint8_t* needle, uint32_t needleLen, uint32_t firstMatchCharOffset);
+
+    template<class UNSIGNED>
+    static int64_t alignedNeedleSizeFind(const uint8_t* haystack, uint32_t haystackLen,
+        const uint8_t* needle, uint32_t firstMatchCharOffset);
+
+    static int64_t genericFind(const uint8_t* haystack, uint32_t haystackLen, const uint8_t* needle,
+        uint32_t needLen, uint32_t firstMatchCharOffset);
+
+    // Returns the position of the first occurrence of needle in the haystack. If haystack doesn't
+    // contain needle, it returns -1.
+    static int64_t find(const uint8_t* haystack, uint32_t haystackLen, const uint8_t* needle,
+        uint32_t needleLen);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/left_operation.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/left_operation.h
new file mode 100644
index 0000000000..5adb7ec6cd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/left_operation.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+#include "function/list/functions/list_len_function.h"
+#include "substr_function.h"
+
+namespace lbug {
+namespace function {
+
+struct Left {
+public:
+    static inline void operation(common::ku_string_t& left, int64_t& right,
+        common::ku_string_t& result, common::ValueVector& resultValueVector) {
+        int64_t leftLen = 0;
+        ListLen::operation(left, leftLen);
+        int64_t len =
+            (right > -1) ? std::min(leftLen, right) : std::max(leftLen + right, (int64_t)0);
+        SubStr::operation(left, 1, len, result, resultValueVector);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/lower_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/lower_function.h
new file mode 100644
index 0000000000..5e73877176
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/lower_function.h
@@ -0,0 +1,18 @@
+#pragma once
+
+#include "base_lower_upper_function.h"
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace function {
+
+struct Lower {
+public:
+    static inline void operation(common::ku_string_t& input, common::ku_string_t& result,
+        common::ValueVector& resultValueVector) {
+        BaseLowerUpperFunction::operation(input, result, resultValueVector, false /* isUpper */);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/lpad_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/lpad_function.h
new file mode 100644
index 0000000000..f2325c204e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/lpad_function.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "base_pad_function.h"
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace function {
+
+struct Lpad : BasePadOperation {
+public:
+    static inline void operation(common::ku_string_t& src, int64_t count,
+        common::ku_string_t& characterToPad, common::ku_string_t& result,
+        common::ValueVector& resultValueVector) {
+        BasePadOperation::operation(src, count, characterToPad, result, resultValueVector,
+            lpadOperation);
+    }
+
+    static void lpadOperation(common::ku_string_t& src, int64_t count,
+        common::ku_string_t& characterToPad, std::string& paddedResult) {
+        auto srcPadInfo =
+            BasePadOperation::padCountChars(count, (const char*)src.getData(), src.len);
+        auto srcData = (const char*)src.getData();
+        BasePadOperation::insertPadding(count - srcPadInfo.second, characterToPad, paddedResult);
+        paddedResult.insert(paddedResult.end(), srcData, srcData + srcPadInfo.first);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/ltrim_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/ltrim_function.h
new file mode 100644
index 0000000000..92ca1ba870
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/ltrim_function.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "base_str_function.h"
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace function {
+
+struct Ltrim {
+    static inline void operation(common::ku_string_t& input, common::ku_string_t& result,
+        common::ValueVector& resultValueVector) {
+        BaseStrOperation::operation(input, result, resultValueVector, ltrim);
+    }
+
+    static uint32_t ltrim(char* data, uint32_t len) {
+        auto counter = 0u;
+        for (; counter < len; counter++) {
+            if (!isspace(data[counter])) {
+                break;
+            }
+        }
+        for (uint32_t i = 0; i < len - counter; i++) {
+            data[i] = data[i + counter];
+        }
+        return len - counter;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/pad_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/pad_function.h
new file mode 100644
index 0000000000..2af4c9844a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/pad_function.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "common/assert.h"
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct PadOperation {
+public:
+    static inline void operation(common::ku_string_t& src, int64_t count,
+        common::ku_string_t& characterToPad, common::ku_string_t& result,
+        common::ValueVector& resultValueVector,
+        void (*padOperation)(common::ku_string_t& result, common::ku_string_t& src,
+            common::ku_string_t& characterToPad)) {
+        if (count <= 0) {
+            result.set("", 0);
+            return;
+        }
+        KU_ASSERT(characterToPad.len == 1);
+        padOperation(result, src, characterToPad);
+        common::StringVector::addString(&resultValueVector, result, (const char*)result.getData(),
+            count);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_extract_all_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_extract_all_function.h
new file mode 100644
index 0000000000..92a3a3255d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_extract_all_function.h
@@ -0,0 +1,76 @@
+#pragma once
+
+#include "base_regexp_function.h"
+#include "common/exception/runtime.h"
+#include "common/vector/value_vector.h"
+#include "re2.h"
+
+namespace lbug {
+namespace function {
+
+struct RegexpExtractAll : BaseRegexpOperation {
+    static inline void operation(common::ku_string_t& value, common::ku_string_t& pattern,
+        std::int64_t& group, common::list_entry_t& result, common::ValueVector& resultVector) {
+        std::vector<std::string> matches =
+            regexExtractAll(value.getAsString(), pattern.getAsString(), group);
+        result = common::ListVector::addList(&resultVector, matches.size());
+        auto resultValues = common::ListVector::getListValues(&resultVector, result);
+        auto resultDataVector = common::ListVector::getDataVector(&resultVector);
+        auto numBytesPerValue = resultDataVector->getNumBytesPerValue();
+        for (const auto& match : matches) {
+            common::ku_string_t kuString;
+            copyToLbugString(match, kuString, *resultDataVector);
+            resultDataVector->copyFromVectorData(resultValues, resultDataVector,
+                reinterpret_cast<uint8_t*>(&kuString));
+            resultValues += numBytesPerValue;
+        }
+    }
+
+    static inline void operation(common::ku_string_t& value, common::ku_string_t& pattern,
+        common::list_entry_t& result, common::ValueVector& resultVector) {
+        int64_t defaultGroup = 0;
+        operation(value, pattern, defaultGroup, result, resultVector);
+    }
+
+    static std::vector<std::string> regexExtractAll(const std::string& value,
+        const std::string& pattern, std::int64_t& group) {
+        RE2 regex(parseCypherPattern(pattern));
+        auto submatchCount = regex.NumberOfCapturingGroups() + 1;
+        if (group >= submatchCount) {
+            throw common::RuntimeException("Regex match group index is out of range");
+        }
+
+        regex::StringPiece input(value);
+        std::vector<regex::StringPiece> targetSubMatches;
+        targetSubMatches.resize(submatchCount);
+        uint64_t startPos = 0;
+
+        std::vector<std::string> matches;
+        while (regex.Match(input, startPos, input.length(), RE2::UNANCHORED,
+            targetSubMatches.data(), submatchCount)) {
+            uint64_t consumed =
+                static_cast<size_t>(targetSubMatches[0].end() - (input.begin() + startPos));
+            if (!consumed) {
+                // Empty match found, increment the position manually
+                consumed++;
+                while (startPos + consumed < input.length() &&
+                       !IsCharacter(input[startPos + consumed])) {
+                    consumed++;
+                }
+            }
+            startPos += consumed;
+            matches.emplace_back(targetSubMatches[group]);
+        }
+
+        return matches;
+    }
+
+    static inline bool IsCharacter(char c) {
+        // Check if this character is not the middle of utf-8 character i.e. it shouldn't begin with
+        // 10 XX XX XX
+        return (c & 0xc0) != 0x80;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_extract_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_extract_function.h
new file mode 100644
index 0000000000..feaabe3fec
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_extract_function.h
@@ -0,0 +1,46 @@
+#pragma once
+
+#include "common/exception/runtime.h"
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+#include "function/string/functions/base_regexp_function.h"
+#include "re2.h"
+
+namespace lbug {
+namespace function {
+
+struct RegexpExtract : BaseRegexpOperation {
+    static inline void operation(common::ku_string_t& value, common::ku_string_t& pattern,
+        std::int64_t& group, common::ku_string_t& result, common::ValueVector& resultValueVector) {
+        regexExtract(value.getAsString(), pattern.getAsString(), group, result, resultValueVector);
+    }
+
+    static inline void operation(common::ku_string_t& value, common::ku_string_t& pattern,
+        common::ku_string_t& result, common::ValueVector& resultValueVector) {
+        int64_t defaultGroup = 0;
+        regexExtract(value.getAsString(), pattern.getAsString(), defaultGroup, result,
+            resultValueVector);
+    }
+
+    static void regexExtract(const std::string& input, const std::string& pattern,
+        std::int64_t& group, common::ku_string_t& result, common::ValueVector& resultValueVector) {
+        RE2 regex(parseCypherPattern(pattern));
+        auto submatchCount = regex.NumberOfCapturingGroups() + 1;
+        if (group >= submatchCount) {
+            throw common::RuntimeException("Regex match group index is out of range");
+        }
+
+        std::vector<regex::StringPiece> targetSubMatches;
+        targetSubMatches.resize(submatchCount);
+
+        if (!regex.Match(regex::StringPiece(input), 0, input.length(), RE2::UNANCHORED,
+                targetSubMatches.data(), submatchCount)) {
+            return;
+        }
+
+        copyToLbugString(targetSubMatches[group].ToString(), result, resultValueVector);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_matches_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_matches_function.h
new file mode 100644
index 0000000000..5bc3a97fea
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_matches_function.h
@@ -0,0 +1,18 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+#include "function/string/functions/base_regexp_function.h"
+#include "re2.h"
+
+namespace lbug {
+namespace function {
+
+struct RegexpMatches : BaseRegexpOperation {
+    static inline void operation(common::ku_string_t& left, common::ku_string_t& right,
+        uint8_t& result) {
+        result = RE2::PartialMatch(left.getAsString(), parseCypherPattern(right.getAsString()));
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_split_to_array_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_split_to_array_function.h
new file mode 100644
index 0000000000..1a9f96948d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/regexp_split_to_array_function.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include "base_regexp_function.h"
+#include "common/vector/value_vector.h"
+#include "re2.h"
+
+namespace lbug {
+namespace function {
+
+struct RegexpSplitToArray : BaseRegexpOperation {
+    static void operation(common::ku_string_t& value, common::ku_string_t& regex,
+        common::list_entry_t& result, common::ValueVector& resultVector) {
+        std::vector<std::string> matches =
+            regexExtractAll(value.getAsString(), regex.getAsString());
+        result = common::ListVector::addList(&resultVector, matches.size());
+        auto resultValues = common::ListVector::getListValues(&resultVector, result);
+        auto resultDataVector = common::ListVector::getDataVector(&resultVector);
+        auto numBytesPerValue = resultDataVector->getNumBytesPerValue();
+        common::ku_string_t kuString;
+        for (const auto& match : matches) {
+            copyToLbugString(match, kuString, *resultDataVector);
+            resultDataVector->copyFromVectorData(resultValues, resultDataVector,
+                reinterpret_cast<uint8_t*>(&kuString));
+            resultValues += numBytesPerValue;
+        }
+    }
+
+    static std::vector<std::string> regexExtractAll(const std::string& value,
+        const std::string& pattern) {
+        RE2 regex(parseCypherPattern(pattern));
+
+        regex::StringPiece input(value);
+        regex::StringPiece match;
+        uint64_t startPos = 0;
+
+        std::vector<std::string> splitParts;
+        while (startPos < input.length()) {
+            if (regex.Match(input, startPos, input.length(), RE2::UNANCHORED, &match, 1)) {
+                uint64_t matchStart = match.data() - input.data();
+                uint64_t matchEnd = matchStart + match.size();
+
+                if (startPos < matchStart) {
+                    splitParts.emplace_back(value.substr(startPos, matchStart - startPos));
+                }
+
+                startPos = matchEnd;
+
+                if (match.size() == 0) {
+                    // Match size is 0.
+                    startPos++;
+                }
+            } else {
+                // No more regexp matches.
+                if (startPos < input.length()) {
+                    splitParts.emplace_back(value.substr(startPos));
+                }
+                break;
+            }
+        }
+        return splitParts;
+    }
+};
+
+} // namespace function
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/repeat_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/repeat_function.h
new file mode 100644
index 0000000000..c073519fb6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/repeat_function.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include <cstring>
+
+#include "common/api.h"
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct Repeat {
+public:
+    LBUG_API static void operation(common::ku_string_t& left, int64_t& right,
+        common::ku_string_t& result, common::ValueVector& resultValueVector);
+
+private:
+    static void repeatStr(char* data, const std::string& pattern, uint64_t count) {
+        for (auto i = 0u; i < count; i++) {
+            memcpy(data + i * pattern.length(), pattern.c_str(), pattern.length());
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/reverse_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/reverse_function.h
new file mode 100644
index 0000000000..9ecff898fb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/reverse_function.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "common/api.h"
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct Reverse {
+public:
+    LBUG_API static void operation(common::ku_string_t& input, common::ku_string_t& result,
+        common::ValueVector& resultValueVector);
+
+private:
+    static uint32_t reverseStr(char* data, uint32_t len) {
+        for (auto i = 0u; i < len / 2; i++) {
+            std::swap(data[i], data[len - i - 1]);
+        }
+        return len;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/right_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/right_function.h
new file mode 100644
index 0000000000..36ea35cae5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/right_function.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+#include "function/list/functions/list_len_function.h"
+#include "substr_function.h"
+
+namespace lbug {
+namespace function {
+
+struct Right {
+public:
+    static inline void operation(common::ku_string_t& left, int64_t& right,
+        common::ku_string_t& result, common::ValueVector& resultValueVector) {
+        int64_t leftLen = 0;
+        ListLen::operation(left, leftLen);
+        int64_t len =
+            (right > -1) ? std::min(leftLen, right) : std::max(leftLen + right, (int64_t)0);
+        SubStr::operation(left, leftLen - len + 1, len, result, resultValueVector);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/rpad_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/rpad_function.h
new file mode 100644
index 0000000000..9eaa14740c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/rpad_function.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "base_pad_function.h"
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace function {
+
+struct Rpad : BasePadOperation {
+public:
+    static inline void operation(common::ku_string_t& src, int64_t count,
+        common::ku_string_t& characterToPad, common::ku_string_t& result,
+        common::ValueVector& resultValueVector) {
+        BasePadOperation::operation(src, count, characterToPad, result, resultValueVector,
+            rpadOperation);
+    }
+
+    static void rpadOperation(common::ku_string_t& src, int64_t count,
+        common::ku_string_t& characterToPad, std::string& paddedResult) {
+        auto srcPadInfo =
+            BasePadOperation::padCountChars(count, (const char*)src.getData(), src.len);
+        auto srcData = (const char*)src.getData();
+        paddedResult.insert(paddedResult.end(), srcData, srcData + srcPadInfo.first);
+        BasePadOperation::insertPadding(count - srcPadInfo.second, characterToPad, paddedResult);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/rtrim_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/rtrim_function.h
new file mode 100644
index 0000000000..a05454a30a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/rtrim_function.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include "base_str_function.h"
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace function {
+
+struct Rtrim {
+    static inline void operation(common::ku_string_t& input, common::ku_string_t& result,
+        common::ValueVector& resultValueVector) {
+        BaseStrOperation::operation(input, result, resultValueVector, rtrim);
+    }
+
+    static uint32_t rtrim(char* data, uint32_t len) {
+        int32_t counter = len - 1;
+        for (; counter >= 0; counter--) {
+            if (!isspace(data[counter])) {
+                break;
+            }
+        }
+        return counter + 1;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/starts_with_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/starts_with_function.h
new file mode 100644
index 0000000000..c25ec3c142
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/starts_with_function.h
@@ -0,0 +1,18 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+
+namespace lbug {
+namespace function {
+
+struct StartsWith {
+    static inline void operation(common::ku_string_t& left, common::ku_string_t& right,
+        uint8_t& result) {
+        auto lStr = left.getAsString();
+        auto rStr = right.getAsString();
+        result = lStr.starts_with(rStr);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/substr_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/substr_function.h
new file mode 100644
index 0000000000..861f3fcc72
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/substr_function.h
@@ -0,0 +1,73 @@
+#pragma once
+
+#include <cstring>
+
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+#include "utf8proc.h"
+
+namespace lbug {
+namespace function {
+
+struct SubStr {
+public:
+    static inline void operation(common::ku_string_t& src, int64_t start, int64_t len,
+        common::ku_string_t& result, common::ValueVector& resultValueVector) {
+        std::string srcStr = src.getAsString();
+        bool isAscii = true;
+        int64_t startPos = start - 1;
+        int64_t endPos = std::min(srcStr.size(), (size_t)(startPos + len));
+        if (startPos >= endPos || startPos < 0 || startPos >= (int64_t)srcStr.size()) {
+            result.len = 0;
+            return;
+        }
+        // 1 character more than length has to be scanned for diatrics case: y + ˘ = ў.
+        for (auto i = 0u; i < std::min<int64_t>(srcStr.size(), endPos + 1); i++) {
+            // UTF-8 character encountered.
+            if (srcStr[i] & 0x80) {
+                isAscii = false;
+                break;
+            }
+        }
+        if (isAscii) {
+            copySubstr(src, start, len, result, resultValueVector, true /* isAscii */);
+        } else {
+            int64_t characterCount = 0, startBytePos = 0, endBytePos = 0;
+            lbug::utf8proc::utf8proc_grapheme_callback(srcStr.c_str(), srcStr.size(),
+                [&](int64_t gstart, int64_t /*gend*/) {
+                    if (characterCount == startPos) {
+                        startBytePos = gstart;
+                    } else if (characterCount == endPos) {
+                        endBytePos = gstart;
+                        return false;
+                    }
+                    characterCount++;
+                    return true;
+                });
+            if (endBytePos == 0 && len != 0) {
+                endBytePos = src.len;
+            }
+            // In this case, the function gets the EXACT byte location to start copying from.
+            copySubstr(src, startBytePos, endBytePos - startBytePos, result, resultValueVector,
+                false /* isAscii */);
+        }
+    }
+
+    static inline void copySubstr(common::ku_string_t& src, int64_t start, int64_t len,
+        common::ku_string_t& result, common::ValueVector& resultValueVector, bool isAscii) {
+        auto length = std::min(len, src.len - start + 1);
+        if (isAscii) {
+            // For normal ASCII char case, we get to the proper byte position to copy from by doing
+            // a -1 (since it is guaranteed each char is 1 byte).
+            common::StringVector::addString(&resultValueVector, result,
+                (const char*)(src.getData() + start - 1), length);
+        } else {
+            // For utf8 char copy, the function gets the exact starting byte position to copy from.
+            common::StringVector::addString(&resultValueVector, result,
+                (const char*)(src.getData() + start), length);
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/trim_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/trim_function.h
new file mode 100644
index 0000000000..52a9ed4def
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/trim_function.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+#include "ltrim_function.h"
+#include "rtrim_function.h"
+
+namespace lbug {
+namespace function {
+
+struct Trim : BaseStrOperation {
+public:
+    static inline void operation(common::ku_string_t& input, common::ku_string_t& result,
+        common::ValueVector& resultValueVector) {
+        BaseStrOperation::operation(input, result, resultValueVector, trim);
+    }
+
+private:
+    static uint32_t trim(char* data, uint32_t len) {
+        return Rtrim::rtrim(data, Ltrim::ltrim(data, len));
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/upper_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/upper_function.h
new file mode 100644
index 0000000000..cd315f38e2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/functions/upper_function.h
@@ -0,0 +1,19 @@
+#pragma once
+
+#include "common/types/ku_string.h"
+#include "common/vector/value_vector.h"
+#include "function/string/functions/base_lower_upper_function.h"
+
+namespace lbug {
+namespace function {
+
+struct Upper {
+public:
+    static inline void operation(common::ku_string_t& input, common::ku_string_t& result,
+        common::ValueVector& resultValueVector) {
+        BaseLowerUpperFunction::operation(input, result, resultValueVector, true /* isUpper */);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/vector_string_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/vector_string_functions.h
new file mode 100644
index 0000000000..0b756d67dc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/string/vector_string_functions.h
@@ -0,0 +1,255 @@
+#pragma once
+
+#include "function/scalar_function.h"
+#include "function/string/functions/lower_function.h"
+#include "function/string/functions/ltrim_function.h"
+#include "function/string/functions/reverse_function.h"
+#include "function/string/functions/rtrim_function.h"
+#include "function/string/functions/trim_function.h"
+#include "function/string/functions/upper_function.h"
+
+namespace lbug {
+namespace function {
+
+struct VectorStringFunction {
+    template<class OPERATION>
+    static inline function_set getUnaryStrFunction(std::string funcName) {
+        function_set functionSet;
+        functionSet.emplace_back(std::make_unique<ScalarFunction>(funcName,
+            std::vector<common::LogicalTypeID>{common::LogicalTypeID::STRING},
+            common::LogicalTypeID::STRING,
+            ScalarFunction::UnaryStringExecFunction<common::ku_string_t, common::ku_string_t,
+                OPERATION>));
+        return functionSet;
+    }
+};
+
+struct ArrayExtractFunction {
+    static constexpr const char* name = "ARRAY_EXTRACT";
+
+    static function_set getFunctionSet();
+};
+
+struct ConcatFunction : public VectorStringFunction {
+    static constexpr const char* name = "CONCAT";
+
+    static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+        const std::vector<common::SelectionVector*>& parameterSelVectors,
+        common::ValueVector& result, common::SelectionVector* resultSelVector, void* /*dataPtr*/);
+
+    static function_set getFunctionSet();
+};
+
+struct ContainsFunction : public VectorStringFunction {
+    static constexpr const char* name = "CONTAINS";
+
+    static function_set getFunctionSet();
+};
+
+struct EndsWithFunction : public VectorStringFunction {
+    static constexpr const char* name = "ENDS_WITH";
+
+    static function_set getFunctionSet();
+};
+
+struct SuffixFunction {
+    using alias = EndsWithFunction;
+
+    static constexpr const char* name = "SUFFIX";
+};
+
+struct LeftFunction : public VectorStringFunction {
+    static constexpr const char* name = "LEFT";
+
+    static function_set getFunctionSet();
+};
+
+struct LowerFunction : public VectorStringFunction {
+    static constexpr const char* name = "LOWER";
+
+    static function_set getFunctionSet() { return getUnaryStrFunction<Lower>(name); }
+};
+
+struct ToLowerFunction : public VectorStringFunction {
+    using alias = LowerFunction;
+
+    static constexpr const char* name = "TOLOWER";
+};
+
+struct LcaseFunction {
+    using alias = LowerFunction;
+
+    static constexpr const char* name = "LCASE";
+};
+
+struct LpadFunction : public VectorStringFunction {
+    static constexpr const char* name = "LPAD";
+
+    static function_set getFunctionSet();
+};
+
+struct LtrimFunction : public VectorStringFunction {
+    static constexpr const char* name = "LTRIM";
+
+    static inline function_set getFunctionSet() { return getUnaryStrFunction<Ltrim>(name); }
+};
+
+struct RepeatFunction : public VectorStringFunction {
+    static constexpr const char* name = "REPEAT";
+
+    static function_set getFunctionSet();
+};
+
+struct ReverseFunction : public VectorStringFunction {
+    static constexpr const char* name = "REVERSE";
+
+    static inline function_set getFunctionSet() { return getUnaryStrFunction<Reverse>(name); }
+};
+
+struct RightFunction : public VectorStringFunction {
+    static constexpr const char* name = "RIGHT";
+
+    static function_set getFunctionSet();
+};
+
+struct RpadFunction : public VectorStringFunction {
+    static constexpr const char* name = "RPAD";
+
+    static function_set getFunctionSet();
+};
+
+struct RtrimFunction : public VectorStringFunction {
+    static constexpr const char* name = "RTRIM";
+
+    static inline function_set getFunctionSet() { return getUnaryStrFunction<Rtrim>(name); }
+};
+
+struct StartsWithFunction : public VectorStringFunction {
+    static constexpr const char* name = "STARTS_WITH";
+
+    static function_set getFunctionSet();
+};
+
+struct PrefixFunction {
+    using alias = StartsWithFunction;
+
+    static constexpr const char* name = "PREFIX";
+};
+
+struct SubStrFunction : public VectorStringFunction {
+    static constexpr const char* name = "SUBSTR";
+
+    static function_set getFunctionSet();
+};
+
+struct SubstringFunction {
+    using alias = SubStrFunction;
+
+    static constexpr const char* name = "SUBSTRING";
+};
+
+struct TrimFunction : public VectorStringFunction {
+    static constexpr const char* name = "TRIM";
+
+    static function_set getFunctionSet() { return getUnaryStrFunction<Trim>(name); }
+};
+
+struct UpperFunction : public VectorStringFunction {
+    static constexpr const char* name = "UPPER";
+
+    static function_set getFunctionSet() { return getUnaryStrFunction<Upper>(name); }
+};
+
+struct ToUpperFunction : public VectorStringFunction {
+    using alias = UpperFunction;
+
+    static constexpr const char* name = "TOUPPER";
+};
+
+struct UCaseFunction {
+    using alias = UpperFunction;
+
+    static constexpr const char* name = "UCASE";
+};
+
+struct RegexpFullMatchFunction : public VectorStringFunction {
+    static constexpr const char* name = "REGEXP_FULL_MATCH";
+
+    static function_set getFunctionSet();
+};
+
+struct RegexpMatchesFunction : public VectorStringFunction {
+    static constexpr const char* name = "REGEXP_MATCHES";
+
+    static function_set getFunctionSet();
+};
+
+struct RegexpReplaceFunction : public VectorStringFunction {
+    static constexpr const char* name = "REGEXP_REPLACE";
+    static constexpr const char* GLOBAL_REPLACE_OPTION = "g";
+
+    static function_set getFunctionSet();
+};
+
+struct RegexpExtractFunction : public VectorStringFunction {
+    static constexpr const char* name = "REGEXP_EXTRACT";
+
+    static function_set getFunctionSet();
+};
+
+struct RegexpExtractAllFunction : public VectorStringFunction {
+    static constexpr const char* name = "REGEXP_EXTRACT_ALL";
+
+    static function_set getFunctionSet();
+};
+
+struct RegexpSplitToArrayFunction : public VectorStringFunction {
+    static constexpr const char* name = "REGEXP_SPLIT_TO_ARRAY";
+
+    static function_set getFunctionSet();
+};
+
+struct LevenshteinFunction : public VectorStringFunction {
+    static constexpr const char* name = "LEVENSHTEIN";
+
+    static function_set getFunctionSet();
+};
+
+struct InitCapFunction : public VectorStringFunction {
+    static constexpr const char* name = "INITCAP";
+
+    static function_set getFunctionSet();
+};
+
+struct StringSplitFunction {
+    static constexpr const char* name = "STRING_SPLIT";
+
+    static function_set getFunctionSet();
+};
+
+struct StrSplitFunction {
+    using alias = StringSplitFunction;
+
+    static constexpr const char* name = "STR_SPLIT";
+};
+
+struct StringToArrayFunction {
+    using alias = StringSplitFunction;
+
+    static constexpr const char* name = "STRING_TO_ARRAY";
+};
+
+struct SplitPartFunction {
+    static constexpr const char* name = "SPLIT_PART";
+
+    static function_set getFunctionSet();
+};
+
+struct ConcatWSFunction {
+    static constexpr const char* name = "CONCAT_WS";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/struct/vector_struct_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/struct/vector_struct_functions.h
new file mode 100644
index 0000000000..bf148fec86
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/struct/vector_struct_functions.h
@@ -0,0 +1,59 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct StructPackFunctions {
+    static constexpr const char* name = "STRUCT_PACK";
+
+    static function_set getFunctionSet();
+
+    static void execFunc(const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+        const std::vector<common::SelectionVector*>& parameterSelVectors,
+        common::ValueVector& result, common::SelectionVector* resultSelVector,
+        void* /*dataPtr*/ = nullptr);
+    static void undirectedRelPackExecFunc(
+        const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+        common::ValueVector& result, void* /*dataPtr*/ = nullptr);
+    static void compileFunc(FunctionBindData* bindData,
+        const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+        std::shared_ptr<common::ValueVector>& result);
+    static void undirectedRelCompileFunc(FunctionBindData* bindData,
+        const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+        std::shared_ptr<common::ValueVector>& result);
+};
+
+struct StructExtractBindData : public FunctionBindData {
+    common::idx_t childIdx;
+
+    StructExtractBindData(common::LogicalType dataType, common::idx_t childIdx)
+        : FunctionBindData{std::move(dataType)}, childIdx{childIdx} {}
+
+    std::unique_ptr<FunctionBindData> copy() const override {
+        return std::make_unique<StructExtractBindData>(resultType.copy(), childIdx);
+    }
+};
+
+struct StructExtractFunctions {
+    static constexpr const char* name = "STRUCT_EXTRACT";
+
+    static function_set getFunctionSet();
+
+    static std::unique_ptr<FunctionBindData> bindFunc(const ScalarBindFuncInput& input);
+
+    static void compileFunc(FunctionBindData* bindData,
+        const std::vector<std::shared_ptr<common::ValueVector>>& parameters,
+        std::shared_ptr<common::ValueVector>& result);
+};
+
+struct KeysFunctions {
+    static constexpr const char* name = "KEYS";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/bind_data.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/bind_data.h
new file mode 100644
index 0000000000..d6625c84c8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/bind_data.h
@@ -0,0 +1,69 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "optional_params.h"
+#include "storage/predicate/column_predicate.h"
+
+namespace lbug {
+namespace common {
+class FileSystem;
+}
+
+namespace function {
+
+struct LBUG_API TableFuncBindData {
+    binder::expression_vector columns;
+    common::row_idx_t numRows;
+    std::unique_ptr<OptionalParams> optionalParams = nullptr;
+
+    TableFuncBindData() : numRows{0} {}
+    explicit TableFuncBindData(common::row_idx_t numRows) : numRows{numRows} {}
+    explicit TableFuncBindData(binder::expression_vector columns)
+        : columns{std::move(columns)}, numRows{0} {}
+    TableFuncBindData(binder::expression_vector columns, common::row_idx_t numRows)
+        : columns{std::move(columns)}, numRows{numRows} {}
+    TableFuncBindData(const TableFuncBindData& other)
+        : columns{other.columns}, numRows{other.numRows},
+          optionalParams{other.optionalParams == nullptr ? nullptr : other.optionalParams->copy()},
+          columnSkips{other.columnSkips}, columnPredicates{copyVector(other.columnPredicates)} {}
+    TableFuncBindData& operator=(const TableFuncBindData& other) = delete;
+    virtual ~TableFuncBindData() = default;
+
+    void evaluateParams(main::ClientContext* context) const {
+        if (!optionalParams) {
+            return;
+        }
+        optionalParams->evaluateParams(context);
+    }
+    common::idx_t getNumColumns() const { return columns.size(); }
+    void setColumnSkips(std::vector<bool> skips) { columnSkips = std::move(skips); }
+    std::vector<bool> getColumnSkips() const;
+
+    void setColumnPredicates(std::vector<storage::ColumnPredicateSet> predicates) {
+        columnPredicates = std::move(predicates);
+    }
+    const std::vector<storage::ColumnPredicateSet>& getColumnPredicates() const {
+        return columnPredicates;
+    }
+
+    virtual bool getIgnoreErrorsOption() const;
+
+    virtual std::unique_ptr<TableFuncBindData> copy() const;
+
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+
+    template<class TARGET>
+    TARGET& cast() {
+        return *common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+protected:
+    std::vector<bool> columnSkips;
+    std::vector<storage::ColumnPredicateSet> columnPredicates;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/bind_input.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/bind_input.h
new file mode 100644
index 0000000000..b64445f0c4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/bind_input.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include <vector>
+
+#include "binder/expression/expression.h"
+#include "common/case_insensitive_map.h"
+#include "common/copier_config/file_scan_info.h"
+#include "common/types/value/value.h"
+#include "parser/query/reading_clause/yield_variable.h"
+
+namespace lbug {
+namespace binder {
+class LiteralExpression;
+class Binder;
+} // namespace binder
+namespace main {
+class ClientContext;
+}
+
+namespace common {
+class Value;
+}
+
+namespace function {
+
+using optional_params_t = common::case_insensitive_map_t<common::Value>;
+
+struct TableFunction;
+
+struct ExtraTableFuncBindInput {
+    virtual ~ExtraTableFuncBindInput() = default;
+
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+};
+
+struct LBUG_API TableFuncBindInput {
+    binder::expression_vector params;
+    optional_params_t optionalParams;
+    binder::expression_vector optionalParamsLegacy;
+    std::unique_ptr<ExtraTableFuncBindInput> extraInput = nullptr;
+    binder::Binder* binder = nullptr;
+    std::vector<parser::YieldVariable> yieldVariables;
+
+    TableFuncBindInput() = default;
+
+    void addLiteralParam(common::Value value);
+
+    std::shared_ptr<binder::Expression> getParam(common::idx_t idx) const { return params[idx]; }
+    common::Value getValue(common::idx_t idx) const;
+    template<typename T>
+    T getLiteralVal(common::idx_t idx) const;
+};
+
+struct LBUG_API ExtraScanTableFuncBindInput : ExtraTableFuncBindInput {
+    common::FileScanInfo fileScanInfo;
+    std::vector<std::string> expectedColumnNames;
+    std::vector<common::LogicalType> expectedColumnTypes;
+    TableFunction* tableFunction = nullptr;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/optional_params.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/optional_params.h
new file mode 100644
index 0000000000..03c12920fd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/optional_params.h
@@ -0,0 +1,76 @@
+#pragma once
+
+#include "binder/expression/expression_util.h"
+
+namespace lbug {
+namespace function {
+
+template<common::LogicalTypeID ID>
+struct LogicalTypeMapping;
+
+template<>
+struct LogicalTypeMapping<common::LogicalTypeID::DOUBLE> {
+    using type = double;
+};
+template<>
+struct LogicalTypeMapping<common::LogicalTypeID::BOOL> {
+    using type = bool;
+};
+template<>
+struct LogicalTypeMapping<common::LogicalTypeID::UINT64> {
+    using type = uint64_t;
+};
+template<>
+struct LogicalTypeMapping<common::LogicalTypeID::INT64> {
+    using type = int64_t;
+};
+
+template<>
+struct LogicalTypeMapping<common::LogicalTypeID::STRING> {
+    using type = std::string;
+};
+
+template<typename PARAM>
+struct OptionalParam {
+    using T = typename LogicalTypeMapping<PARAM::TYPE>::type;
+    std::shared_ptr<binder::Expression> param = nullptr;
+    T paramVal = PARAM::DEFAULT_VALUE;
+
+    OptionalParam() {}
+
+    explicit OptionalParam(std::shared_ptr<binder::Expression> param) : param{std::move(param)} {}
+
+    void evaluateParam(main::ClientContext* context) {
+        if (!param) {
+            paramVal = PARAM::DEFAULT_VALUE;
+            return;
+        }
+        if constexpr (requires { PARAM::validate; }) {
+            paramVal = binder::ExpressionUtil::evaluateLiteral<T>(context, param,
+                common::LogicalType{PARAM::TYPE}, PARAM::validate);
+        } else {
+            paramVal = binder::ExpressionUtil::evaluateLiteral<T>(context, param,
+                common::LogicalType{PARAM::TYPE}, nullptr /* validateFunc */);
+        }
+    }
+
+    bool isSet() const { return param != nullptr; }
+
+    T getParamVal() const { return paramVal; }
+};
+
+struct OptionalParams {
+    virtual ~OptionalParams() = default;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+    virtual void evaluateParams(main::ClientContext* /*context*/) = 0;
+
+    virtual std::unique_ptr<OptionalParams> copy() = 0;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/scan_file_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/scan_file_function.h
new file mode 100644
index 0000000000..2d158987f5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/scan_file_function.h
@@ -0,0 +1,73 @@
+#pragma once
+
+#include <atomic>
+#include <mutex>
+
+#include "common/constants.h"
+#include "common/copier_config/file_scan_info.h"
+#include "function/table/bind_data.h"
+#include "function/table/table_function.h"
+
+namespace lbug {
+namespace common {
+class FileSystem;
+}
+
+namespace function {
+
+struct ScanFileSharedState : public TableFuncSharedState {
+    const common::FileScanInfo fileScanInfo;
+    std::atomic<uint64_t> fileIdx;
+    std::atomic<uint64_t> blockIdx;
+
+    ScanFileSharedState(common::FileScanInfo fileScanInfo, uint64_t numRows)
+        : TableFuncSharedState{numRows}, fileScanInfo{std::move(fileScanInfo)}, fileIdx{0},
+          blockIdx{0} {}
+
+    std::pair<uint64_t, uint64_t> getNext() {
+        std::lock_guard guard{mtx};
+        return fileIdx >= fileScanInfo.getNumFiles() ? std::make_pair(UINT64_MAX, UINT64_MAX) :
+                                                       std::make_pair(fileIdx.load(), blockIdx++);
+    }
+};
+
+struct ScanFileWithProgressSharedState : ScanFileSharedState {
+    main::ClientContext* context;
+    uint64_t totalSize; // TODO(Mattias): I think we should unify the design on how we calculate the
+                        // progress bar for scanning. Can we simply rely on a numRowsScaned stored
+                        // in the TableFuncSharedState to determine the progress.
+    ScanFileWithProgressSharedState(common::FileScanInfo fileScanInfo, uint64_t numRows,
+        main::ClientContext* context)
+        : ScanFileSharedState{std::move(fileScanInfo), numRows}, context{context}, totalSize{0} {}
+};
+
+struct LBUG_API ScanFileBindData : public TableFuncBindData {
+    common::FileScanInfo fileScanInfo;
+    main::ClientContext* context;
+    common::column_id_t numWarningDataColumns = 0;
+
+    ScanFileBindData(binder::expression_vector columns, uint64_t numRows,
+        common::FileScanInfo fileScanInfo, main::ClientContext* context)
+        : TableFuncBindData{std::move(columns), numRows}, fileScanInfo{std::move(fileScanInfo)},
+          context{context} {}
+    ScanFileBindData(binder::expression_vector columns, uint64_t numRows,
+        common::FileScanInfo fileScanInfo, main::ClientContext* context,
+        common::column_id_t numWarningDataColumns)
+        : TableFuncBindData{std::move(columns), numRows}, fileScanInfo{std::move(fileScanInfo)},
+          context{context}, numWarningDataColumns{numWarningDataColumns} {}
+    ScanFileBindData(const ScanFileBindData& other)
+        : TableFuncBindData{other}, fileScanInfo{other.fileScanInfo.copy()}, context{other.context},
+          numWarningDataColumns{other.numWarningDataColumns} {}
+
+    bool getIgnoreErrorsOption() const override {
+        return fileScanInfo.getOption(common::CopyConstants::IGNORE_ERRORS_OPTION_NAME,
+            common::CopyConstants::DEFAULT_IGNORE_ERRORS);
+    }
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<ScanFileBindData>(*this);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/scan_replacement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/scan_replacement.h
new file mode 100644
index 0000000000..249adf51be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/scan_replacement.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "function/table/bind_input.h"
+#include "function/table/table_function.h"
+
+namespace lbug {
+namespace function {
+
+struct ScanReplacementData {
+    TableFunction func;
+    TableFuncBindInput bindInput;
+};
+
+using scan_replace_handle_t = uint8_t*;
+using handle_lookup_func_t = std::function<std::vector<scan_replace_handle_t>(const std::string&)>;
+using scan_replace_func_t =
+    std::function<std::unique_ptr<ScanReplacementData>(std::span<scan_replace_handle_t>)>;
+
+struct ScanReplacement {
+    explicit ScanReplacement(handle_lookup_func_t lookupFunc, scan_replace_func_t replaceFunc)
+        : lookupFunc(std::move(lookupFunc)), replaceFunc{std::move(replaceFunc)} {}
+
+    handle_lookup_func_t lookupFunc;
+    scan_replace_func_t replaceFunc;
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/simple_table_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/simple_table_function.h
new file mode 100644
index 0000000000..76a1e9a0ea
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/simple_table_function.h
@@ -0,0 +1,188 @@
+#pragma once
+
+#include "common/system_config.h"
+#include "function/table/table_function.h"
+
+namespace lbug {
+namespace function {
+
+struct TableFuncMorsel {
+    common::offset_t startOffset;
+    common::offset_t endOffset;
+
+    TableFuncMorsel(common::offset_t startOffset, common::offset_t endOffset)
+        : startOffset{startOffset}, endOffset{endOffset} {}
+
+    bool hasMoreToOutput() const { return startOffset != common::INVALID_OFFSET; }
+
+    static TableFuncMorsel createInvalidMorsel() {
+        return {common::INVALID_OFFSET, common::INVALID_OFFSET};
+    }
+
+    uint64_t getMorselSize() const { return endOffset - startOffset; }
+
+    bool isInvalid() const {
+        return startOffset == common::INVALID_OFFSET && endOffset == common::INVALID_OFFSET;
+    }
+};
+
+using simple_internal_table_func = std::function<common::offset_t(const TableFuncMorsel&,
+    const TableFuncInput&, common::DataChunk& output)>;
+
+class LBUG_API SimpleTableFuncSharedState : public TableFuncSharedState {
+public:
+    SimpleTableFuncSharedState() = default;
+
+    explicit SimpleTableFuncSharedState(common::row_idx_t numRows,
+        common::offset_t maxMorselSize = common::DEFAULT_VECTOR_CAPACITY)
+        : TableFuncSharedState{numRows}, maxMorselSize{maxMorselSize} {}
+
+    virtual TableFuncMorsel getMorsel();
+
+    common::row_idx_t curRowIdx = 0;
+    common::offset_t maxMorselSize = common::DEFAULT_VECTOR_CAPACITY;
+};
+
+struct LBUG_API SimpleTableFunc {
+    static std::unique_ptr<TableFuncSharedState> initSharedState(
+        const TableFuncInitSharedStateInput& input);
+
+    static table_func_t getTableFunc(simple_internal_table_func internalTableFunc);
+};
+
+struct CurrentSettingFunction final {
+    static constexpr const char* name = "CURRENT_SETTING";
+
+    static function_set getFunctionSet();
+};
+
+struct CatalogVersionFunction final {
+    static constexpr const char* name = "CATALOG_VERSION";
+
+    static function_set getFunctionSet();
+};
+
+struct DBVersionFunction final {
+    static constexpr const char* name = "DB_VERSION";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowTablesFunction final {
+    static constexpr const char* name = "SHOW_TABLES";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowWarningsFunction final {
+    static constexpr const char* name = "SHOW_WARNINGS";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowMacrosFunction final {
+    static constexpr const char* name = "SHOW_MACROS";
+
+    static function_set getFunctionSet();
+};
+
+struct TableInfoFunction final {
+    static constexpr const char* name = "TABLE_INFO";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowSequencesFunction final {
+    static constexpr const char* name = "SHOW_SEQUENCES";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowConnectionFunction final {
+    static constexpr const char* name = "SHOW_CONNECTION";
+
+    static function_set getFunctionSet();
+};
+
+struct StorageInfoFunction final {
+    static constexpr const char* name = "STORAGE_INFO";
+
+    static function_set getFunctionSet();
+};
+
+struct StatsInfoFunction final {
+    static constexpr const char* name = "STATS_INFO";
+
+    static function_set getFunctionSet();
+};
+
+struct FreeSpaceInfoFunction final {
+    static constexpr const char* name = "FSM_INFO";
+
+    static function_set getFunctionSet();
+};
+
+struct BMInfoFunction final {
+    static constexpr const char* name = "BM_INFO";
+
+    static function_set getFunctionSet();
+};
+
+struct FileInfoFunction final {
+    static constexpr const char* name = "FILE_INFO";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowAttachedDatabasesFunction final {
+    static constexpr const char* name = "SHOW_ATTACHED_DATABASES";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowFunctionsFunction final {
+    static constexpr const char* name = "SHOW_FUNCTIONS";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowLoadedExtensionsFunction final {
+    static constexpr const char* name = "SHOW_LOADED_EXTENSIONS";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowOfficialExtensionsFunction final {
+    static constexpr const char* name = "SHOW_OFFICIAL_EXTENSIONS";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowIndexesFunction final {
+    static constexpr const char* name = "SHOW_INDEXES";
+
+    static function_set getFunctionSet();
+};
+
+struct ShowProjectedGraphsFunction final {
+    static constexpr const char* name = "SHOW_PROJECTED_GRAPHS";
+
+    static function_set getFunctionSet();
+};
+
+struct ProjectedGraphInfoFunction final {
+    static constexpr const char* name = "PROJECTED_GRAPH_INFO";
+
+    static function_set getFunctionSet();
+};
+
+// Cache a table column to the transaction local cache.
+// Note this is only used for internal purpose, and only supports node tables for now.
+struct LocalCacheArrayColumnFunction final {
+    static constexpr const char* name = "_CACHE_ARRAY_COLUMN_LOCALLY";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/standalone_call_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/standalone_call_function.h
new file mode 100644
index 0000000000..4ee96a7cc3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/standalone_call_function.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct ClearWarningsFunction {
+    static constexpr const char* name = "CLEAR_WARNINGS";
+
+    static function_set getFunctionSet();
+};
+
+struct ProjectGraphNativeFunction {
+    static constexpr const char* name = "PROJECT_GRAPH";
+
+    static function_set getFunctionSet();
+};
+
+struct ProjectGraphCypherFunction {
+    static constexpr const char* name = "PROJECT_GRAPH_CYPHER";
+
+    static function_set getFunctionSet();
+};
+
+struct DropProjectedGraphFunction {
+    static constexpr const char* name = "DROP_PROJECTED_GRAPH";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/table_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/table_function.h
new file mode 100644
index 0000000000..6eb6103176
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/table/table_function.h
@@ -0,0 +1,201 @@
+#pragma once
+
+#include <mutex>
+
+#include "common/data_chunk/data_chunk.h"
+#include "common/mask.h"
+#include "function/function.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace binder {
+class BoundReadingClause;
+}
+namespace parser {
+struct YieldVariable;
+class ParsedExpression;
+} // namespace parser
+
+namespace planner {
+class LogicalOperator;
+class LogicalPlan;
+class Planner;
+} // namespace planner
+
+namespace processor {
+struct ExecutionContext;
+class PlanMapper;
+} // namespace processor
+
+namespace function {
+
+struct TableFuncBindInput;
+struct TableFuncBindData;
+
+// Shared state
+struct LBUG_API TableFuncSharedState {
+    common::row_idx_t numRows = 0;
+    // This for now is only used for QueryHNSWIndex.
+    // TODO(Guodong): This is not a good way to pass semiMasks to QueryHNSWIndex function.
+    // However, to avoid function specific logic when we handle semi mask in mapper, so we can move
+    // HNSW into an extension, we have to let semiMasks be owned by a base class.
+    common::NodeOffsetMaskMap semiMasks;
+    std::mutex mtx;
+
+    explicit TableFuncSharedState() = default;
+    explicit TableFuncSharedState(common::row_idx_t numRows) : numRows{numRows} {}
+    virtual ~TableFuncSharedState() = default;
+    virtual uint64_t getNumRows() const { return numRows; }
+
+    common::table_id_map_t<common::SemiMask*> getSemiMasks() const { return semiMasks.getMasks(); }
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+};
+
+// Local state
+struct TableFuncLocalState {
+    virtual ~TableFuncLocalState() = default;
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+};
+
+// Execution input
+struct TableFuncInput {
+    TableFuncBindData* bindData;
+    TableFuncLocalState* localState;
+    TableFuncSharedState* sharedState;
+    processor::ExecutionContext* context;
+
+    TableFuncInput() = default;
+    TableFuncInput(TableFuncBindData* bindData, TableFuncLocalState* localState,
+        TableFuncSharedState* sharedState, processor::ExecutionContext* context)
+        : bindData{bindData}, localState{localState}, sharedState{sharedState}, context{context} {}
+    DELETE_COPY_DEFAULT_MOVE(TableFuncInput);
+};
+
+// Execution output.
+// We might want to merge this with TableFuncLocalState. Also not all table function output vectors
+// in a single dataChunk, e.g. FTableScan. In future, if we have more cases, we should consider
+// make TableFuncOutput pure virtual.
+struct TableFuncOutput {
+    common::DataChunk dataChunk;
+
+    explicit TableFuncOutput(common::DataChunk dataChunk) : dataChunk{std::move(dataChunk)} {}
+    virtual ~TableFuncOutput() = default;
+
+    void resetState();
+    void setOutputSize(common::offset_t size) const;
+};
+
+struct LBUG_API TableFuncInitSharedStateInput final {
+    TableFuncBindData* bindData;
+    processor::ExecutionContext* context;
+
+    TableFuncInitSharedStateInput(TableFuncBindData* bindData, processor::ExecutionContext* context)
+        : bindData{bindData}, context{context} {}
+};
+
+// Init local state
+struct TableFuncInitLocalStateInput {
+    TableFuncSharedState& sharedState;
+    TableFuncBindData& bindData;
+    main::ClientContext* clientContext;
+
+    TableFuncInitLocalStateInput(TableFuncSharedState& sharedState, TableFuncBindData& bindData,
+        main::ClientContext* clientContext)
+        : sharedState{sharedState}, bindData{bindData}, clientContext{clientContext} {}
+};
+
+// Init output
+struct TableFuncInitOutputInput {
+    std::vector<processor::DataPos> outColumnPositions;
+    processor::ResultSet& resultSet;
+
+    TableFuncInitOutputInput(std::vector<processor::DataPos> outColumnPositions,
+        processor::ResultSet& resultSet)
+        : outColumnPositions{std::move(outColumnPositions)}, resultSet{resultSet} {}
+};
+
+using table_func_bind_t = std::function<std::unique_ptr<TableFuncBindData>(main::ClientContext*,
+    const TableFuncBindInput*)>;
+using table_func_t =
+    std::function<common::offset_t(const TableFuncInput&, TableFuncOutput& output)>;
+using table_func_init_shared_t =
+    std::function<std::shared_ptr<TableFuncSharedState>(const TableFuncInitSharedStateInput&)>;
+using table_func_init_local_t =
+    std::function<std::unique_ptr<TableFuncLocalState>(const TableFuncInitLocalStateInput&)>;
+using table_func_init_output_t =
+    std::function<std::unique_ptr<TableFuncOutput>(const TableFuncInitOutputInput&)>;
+using table_func_can_parallel_t = std::function<bool()>;
+using table_func_progress_t = std::function<double(TableFuncSharedState* sharedState)>;
+using table_func_finalize_t =
+    std::function<void(const processor::ExecutionContext*, TableFuncSharedState*)>;
+using table_func_rewrite_t =
+    std::function<std::string(main::ClientContext&, const TableFuncBindData& bindData)>;
+using table_func_get_logical_plan_t =
+    std::function<void(planner::Planner*, const binder::BoundReadingClause&,
+        std::vector<std::shared_ptr<binder::Expression>>, planner::LogicalPlan&)>;
+using table_func_get_physical_plan_t = std::function<std::unique_ptr<processor::PhysicalOperator>(
+    processor::PlanMapper*, const planner::LogicalOperator*)>;
+using table_func_infer_input_types =
+    std::function<std::vector<common::LogicalType>(const binder::expression_vector&)>;
+
+struct LBUG_API TableFunction final : Function {
+    table_func_t tableFunc = nullptr;
+    table_func_bind_t bindFunc = nullptr;
+    table_func_init_shared_t initSharedStateFunc = nullptr;
+    table_func_init_local_t initLocalStateFunc = nullptr;
+    table_func_init_output_t initOutputFunc = nullptr;
+    table_func_can_parallel_t canParallelFunc = [] { return true; };
+    table_func_progress_t progressFunc = [](TableFuncSharedState*) { return 0.0; };
+    table_func_finalize_t finalizeFunc = [](auto, auto) {};
+    table_func_rewrite_t rewriteFunc = nullptr;
+    table_func_get_logical_plan_t getLogicalPlanFunc = getLogicalPlan;
+    table_func_get_physical_plan_t getPhysicalPlanFunc = getPhysicalPlan;
+    table_func_infer_input_types inferInputTypes = nullptr;
+
+    TableFunction() {}
+    TableFunction(std::string name, std::vector<common::LogicalTypeID> inputTypes)
+        : Function{std::move(name), std::move(inputTypes)} {}
+    ~TableFunction() override;
+    TableFunction(const TableFunction&) = default;
+    TableFunction& operator=(const TableFunction& other) = default;
+    DEFAULT_BOTH_MOVE(TableFunction);
+
+    std::string signatureToString() const override {
+        return common::LogicalTypeUtils::toString(parameterTypeIDs);
+    }
+
+    std::unique_ptr<TableFunction> copy() const { return std::make_unique<TableFunction>(*this); }
+
+    // Init local state func
+    static std::unique_ptr<TableFuncLocalState> initEmptyLocalState(
+        const TableFuncInitLocalStateInput& input);
+    // Init shared state func
+    static std::unique_ptr<TableFuncSharedState> initEmptySharedState(
+        const TableFuncInitSharedStateInput& input);
+    // Init output func
+    static std::unique_ptr<TableFuncOutput> initSingleDataChunkScanOutput(
+        const TableFuncInitOutputInput& input);
+    // Utility functions
+    static std::vector<std::string> extractYieldVariables(const std::vector<std::string>& names,
+        const std::vector<parser::YieldVariable>& yieldVariables);
+    // Get logical plan func
+    static void getLogicalPlan(planner::Planner* planner,
+        const binder::BoundReadingClause& boundReadingClause, binder::expression_vector predicates,
+        planner::LogicalPlan& plan);
+    // Get physical plan func
+    static std::unique_ptr<processor::PhysicalOperator> getPhysicalPlan(
+        processor::PlanMapper* planMapper, const planner::LogicalOperator* logicalOp);
+    // Table func
+    static common::offset_t emptyTableFunc(const TableFuncInput& input, TableFuncOutput& output);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/ternary_function_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/ternary_function_executor.h
new file mode 100644
index 0000000000..ff31e7badb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/ternary_function_executor.h
@@ -0,0 +1,455 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct TernaryFunctionWrapper {
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(A_TYPE& a, B_TYPE& b, C_TYPE& c, RESULT_TYPE& result,
+        void* /*aValueVector*/, void* /*resultValueVector*/, void* /*dataPtr*/) {
+        OP::operation(a, b, c, result);
+    }
+};
+
+struct TernaryStringFunctionWrapper {
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(A_TYPE& a, B_TYPE& b, C_TYPE& c, RESULT_TYPE& result,
+        void* /*aValueVector*/, void* resultValueVector, void* /*dataPtr*/) {
+        OP::operation(a, b, c, result, *(common::ValueVector*)resultValueVector);
+    }
+};
+
+struct TernaryRegexFunctionWrapper {
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(A_TYPE& a, B_TYPE& b, C_TYPE& c, RESULT_TYPE& result,
+        void* /*aValueVector*/, void* resultValueVector, void* dataPtr) {
+        OP::operation(a, b, c, result, *(common::ValueVector*)resultValueVector, dataPtr);
+    }
+};
+
+struct TernaryListFunctionWrapper {
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(A_TYPE& a, B_TYPE& b, C_TYPE& c, RESULT_TYPE& result,
+        void* aValueVector, void* resultValueVector, void* /*dataPtr*/) {
+        OP::operation(a, b, c, result, *(common::ValueVector*)aValueVector,
+            *(common::ValueVector*)resultValueVector);
+    }
+};
+
+struct TernaryUDFFunctionWrapper {
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename OP>
+    static inline void operation(A_TYPE& a, B_TYPE& b, C_TYPE& c, RESULT_TYPE& result,
+        void* /*aValueVector*/, void* /*resultValueVector*/, void* dataPtr) {
+        OP::operation(a, b, c, result, dataPtr);
+    }
+};
+
+struct TernaryFunctionExecutor {
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeOnValue(common::ValueVector& a, common::ValueVector& b,
+        common::ValueVector& c, common::ValueVector& result, uint64_t aPos, uint64_t bPos,
+        uint64_t cPos, uint64_t resPos, void* dataPtr) {
+        auto resValues = (RESULT_TYPE*)result.getData();
+        OP_WRAPPER::template operation<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC>(
+            ((A_TYPE*)a.getData())[aPos], ((B_TYPE*)b.getData())[bPos],
+            ((C_TYPE*)c.getData())[cPos], resValues[resPos], (void*)&a, (void*)&result, dataPtr);
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeAllFlat(common::ValueVector& a, common::SelectionVector* aSelVector,
+        common::ValueVector& b, common::SelectionVector* bSelVector, common::ValueVector& c,
+        common::SelectionVector* cSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        auto aPos = (*aSelVector)[0];
+        auto bPos = (*bSelVector)[0];
+        auto cPos = (*cSelVector)[0];
+        auto resPos = (*resultSelVector)[0];
+        result.setNull(resPos, a.isNull(aPos) || b.isNull(bPos) || c.isNull(cPos));
+        if (!result.isNull(resPos)) {
+            executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c, result,
+                aPos, bPos, cPos, resPos, dataPtr);
+        }
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeFlatFlatUnflat(common::ValueVector& a, common::SelectionVector* aSelVector,
+        common::ValueVector& b, common::SelectionVector* bSelVector, common::ValueVector& c,
+        common::SelectionVector* cSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        auto aPos = (*aSelVector)[0];
+        auto bPos = (*bSelVector)[0];
+        if (a.isNull(aPos) || b.isNull(bPos)) {
+            result.setAllNull();
+        } else if (c.hasNoNullsGuarantee()) {
+            if (cSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < cSelVector->getSelSize(); ++i) {
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, aPos, bPos, i, rPos, dataPtr);
+                }
+            } else {
+                for (auto i = 0u; i < cSelVector->getSelSize(); ++i) {
+                    auto pos = (*cSelVector)[i];
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, aPos, bPos, pos, rPos, dataPtr);
+                }
+            }
+        } else {
+            if (cSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < cSelVector->getSelSize(); ++i) {
+                    result.setNull(i, c.isNull(i));
+                    if (!result.isNull(i)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, aPos, bPos, i, rPos, dataPtr);
+                    }
+                }
+            } else {
+                for (auto i = 0u; i < cSelVector->getSelSize(); ++i) {
+                    auto pos = (*cSelVector)[i];
+                    result.setNull(pos, c.isNull(pos));
+                    if (!result.isNull(pos)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, aPos, bPos, pos, rPos, dataPtr);
+                    }
+                }
+            }
+        }
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeFlatUnflatUnflat(common::ValueVector& a, common::SelectionVector* aSelVector,
+        common::ValueVector& b, common::SelectionVector* bSelVector, common::ValueVector& c,
+        [[maybe_unused]] common::SelectionVector* cSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(bSelVector == cSelVector);
+        auto aPos = (*aSelVector)[0];
+        if (a.isNull(aPos)) {
+            result.setAllNull();
+        } else if (b.hasNoNullsGuarantee() && c.hasNoNullsGuarantee()) {
+            if (bSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < bSelVector->getSelSize(); ++i) {
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, aPos, i, i, i, dataPtr);
+                }
+            } else {
+                for (auto i = 0u; i < bSelVector->getSelSize(); ++i) {
+                    auto pos = (*bSelVector)[i];
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, aPos, pos, pos, rPos, dataPtr);
+                }
+            }
+        } else {
+            if (bSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < bSelVector->getSelSize(); ++i) {
+                    result.setNull(i, b.isNull(i) || c.isNull(i));
+                    if (!result.isNull(i)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, aPos, i, i, rPos, dataPtr);
+                    }
+                }
+            } else {
+                for (auto i = 0u; i < bSelVector->getSelSize(); ++i) {
+                    auto pos = (*bSelVector)[i];
+                    result.setNull(pos, b.isNull(pos) || c.isNull(pos));
+                    if (!result.isNull(pos)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, aPos, pos, pos, rPos, dataPtr);
+                    }
+                }
+            }
+        }
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeFlatUnflatFlat(common::ValueVector& a, common::SelectionVector* aSelVector,
+        common::ValueVector& b, common::SelectionVector* bSelVector, common::ValueVector& c,
+        common::SelectionVector* cSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        auto aPos = (*aSelVector)[0];
+        auto cPos = (*cSelVector)[0];
+        if (a.isNull(aPos) || c.isNull(cPos)) {
+            result.setAllNull();
+        } else if (b.hasNoNullsGuarantee()) {
+            if (bSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < bSelVector->getSelSize(); ++i) {
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, aPos, i, cPos, rPos, dataPtr);
+                }
+            } else {
+                for (auto i = 0u; i < bSelVector->getSelSize(); ++i) {
+                    auto pos = (*bSelVector)[i];
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, aPos, pos, cPos, rPos, dataPtr);
+                }
+            }
+        } else {
+            if (bSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < bSelVector->getSelSize(); ++i) {
+                    result.setNull(i, b.isNull(i));
+                    if (!result.isNull(i)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, aPos, i, cPos, rPos, dataPtr);
+                    }
+                }
+            } else {
+                for (auto i = 0u; i < bSelVector->getSelSize(); ++i) {
+                    auto pos = (*bSelVector)[i];
+                    result.setNull(pos, b.isNull(pos));
+                    if (!result.isNull(pos)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, aPos, pos, cPos, rPos, dataPtr);
+                    }
+                }
+            }
+        }
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeAllUnFlat(common::ValueVector& a, common::SelectionVector* aSelVector,
+        common::ValueVector& b, [[maybe_unused]] common::SelectionVector* bSelVector,
+        common::ValueVector& c, [[maybe_unused]] common::SelectionVector* cSelVector,
+        common::ValueVector& result, common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(aSelVector == bSelVector && bSelVector == cSelVector);
+        if (a.hasNoNullsGuarantee() && b.hasNoNullsGuarantee() && c.hasNoNullsGuarantee()) {
+            if (aSelVector->isUnfiltered()) {
+                for (uint64_t i = 0; i < aSelVector->getSelSize(); i++) {
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, i, i, i, rPos, dataPtr);
+                }
+            } else {
+                for (uint64_t i = 0; i < aSelVector->getSelSize(); i++) {
+                    auto pos = (*aSelVector)[i];
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, pos, pos, pos, rPos, dataPtr);
+                }
+            }
+        } else {
+            if (aSelVector->isUnfiltered()) {
+                for (uint64_t i = 0; i < aSelVector->getSelSize(); i++) {
+                    result.setNull(i, a.isNull(i) || b.isNull(i) || c.isNull(i));
+                    if (!result.isNull(i)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, i, i, i, rPos, dataPtr);
+                    }
+                }
+            } else {
+                for (uint64_t i = 0; i < aSelVector->getSelSize(); i++) {
+                    auto pos = (*aSelVector)[i];
+                    result.setNull(pos, a.isNull(pos) || b.isNull(pos) || c.isNull(pos));
+                    if (!result.isNull(pos)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, pos, pos, pos, rPos, dataPtr);
+                    }
+                }
+            }
+        }
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeUnflatFlatFlat(common::ValueVector& a, common::SelectionVector* aSelVector,
+        common::ValueVector& b, common::SelectionVector* bSelVector, common::ValueVector& c,
+        common::SelectionVector* cSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        auto bPos = (*bSelVector)[0];
+        auto cPos = (*cSelVector)[0];
+        if (b.isNull(bPos) || c.isNull(cPos)) {
+            result.setAllNull();
+        } else if (a.hasNoNullsGuarantee()) {
+            if (aSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, i, bPos, cPos, rPos, dataPtr);
+                }
+            } else {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    auto pos = (*aSelVector)[i];
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, pos, bPos, cPos, rPos, dataPtr);
+                }
+            }
+        } else {
+            if (aSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    result.setNull(i, a.isNull(i));
+                    if (!result.isNull(i)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, i, bPos, cPos, rPos, dataPtr);
+                    }
+                }
+            } else {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    auto pos = (*aSelVector)[i];
+                    result.setNull(pos, a.isNull(pos));
+                    if (!result.isNull(pos)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, pos, bPos, cPos, rPos, dataPtr);
+                    }
+                }
+            }
+        }
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeUnflatFlatUnflat(common::ValueVector& a, common::SelectionVector* aSelVector,
+        common::ValueVector& b, common::SelectionVector* bSelVector, common::ValueVector& c,
+        [[maybe_unused]] common::SelectionVector* cSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(aSelVector == cSelVector);
+        auto bPos = (*bSelVector)[0];
+        if (b.isNull(bPos)) {
+            result.setAllNull();
+        } else if (a.hasNoNullsGuarantee() && c.hasNoNullsGuarantee()) {
+            if (aSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, i, bPos, i, rPos, dataPtr);
+                }
+            } else {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    auto pos = (*aSelVector)[i];
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, pos, bPos, pos, rPos, dataPtr);
+                }
+            }
+        } else {
+            if (aSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    result.setNull(i, a.isNull(i) || c.isNull(i));
+                    if (!result.isNull(i)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, i, bPos, i, rPos, dataPtr);
+                    }
+                }
+            } else {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    auto pos = (*bSelVector)[i];
+                    result.setNull(pos, a.isNull(pos) || c.isNull(pos));
+                    if (!result.isNull(pos)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, pos, bPos, pos, rPos, dataPtr);
+                    }
+                }
+            }
+        }
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeUnflatUnFlatFlat(common::ValueVector& a, common::SelectionVector* aSelVector,
+        common::ValueVector& b, [[maybe_unused]] common::SelectionVector* bSelVector,
+        common::ValueVector& c, common::SelectionVector* cSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        KU_ASSERT(aSelVector == bSelVector);
+        auto cPos = (*cSelVector)[0];
+        if (c.isNull(cPos)) {
+            result.setAllNull();
+        } else if (a.hasNoNullsGuarantee() && b.hasNoNullsGuarantee()) {
+            if (aSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, i, i, cPos, rPos, dataPtr);
+                }
+            } else {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    auto pos = (*aSelVector)[i];
+                    auto rPos = (*resultSelVector)[i];
+                    executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b, c,
+                        result, pos, pos, cPos, rPos, dataPtr);
+                }
+            }
+        } else {
+            if (aSelVector->isUnfiltered()) {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    result.setNull(i, a.isNull(i) || b.isNull(i));
+                    if (!result.isNull(i)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, i, i, cPos, rPos, dataPtr);
+                    }
+                }
+            } else {
+                for (auto i = 0u; i < aSelVector->getSelSize(); ++i) {
+                    auto pos = (*aSelVector)[i];
+                    result.setNull(pos, a.isNull(pos) || b.isNull(pos));
+                    if (!result.isNull(pos)) {
+                        auto rPos = (*resultSelVector)[i];
+                        executeOnValue<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, b,
+                            c, result, pos, pos, cPos, rPos, dataPtr);
+                    }
+                }
+            }
+        }
+    }
+
+    template<typename A_TYPE, typename B_TYPE, typename C_TYPE, typename RESULT_TYPE, typename FUNC,
+        typename OP_WRAPPER>
+    static void executeSwitch(common::ValueVector& a, common::SelectionVector* aSelVector,
+        common::ValueVector& b, common::SelectionVector* bSelVector, common::ValueVector& c,
+        common::SelectionVector* cSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        result.resetAuxiliaryBuffer();
+        if (a.state->isFlat() && b.state->isFlat() && c.state->isFlat()) {
+            executeAllFlat<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, aSelVector, b,
+                bSelVector, c, cSelVector, result, resultSelVector, dataPtr);
+        } else if (a.state->isFlat() && b.state->isFlat() && !c.state->isFlat()) {
+            executeFlatFlatUnflat<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a,
+                aSelVector, b, bSelVector, c, cSelVector, result, resultSelVector, dataPtr);
+        } else if (a.state->isFlat() && !b.state->isFlat() && !c.state->isFlat()) {
+            executeFlatUnflatUnflat<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a,
+                aSelVector, b, bSelVector, c, cSelVector, result, resultSelVector, dataPtr);
+        } else if (a.state->isFlat() && !b.state->isFlat() && c.state->isFlat()) {
+            executeFlatUnflatFlat<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a,
+                aSelVector, b, bSelVector, c, cSelVector, result, resultSelVector, dataPtr);
+        } else if (!a.state->isFlat() && !b.state->isFlat() && !c.state->isFlat()) {
+            executeAllUnFlat<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a, aSelVector,
+                b, bSelVector, c, cSelVector, result, resultSelVector, dataPtr);
+        } else if (!a.state->isFlat() && !b.state->isFlat() && c.state->isFlat()) {
+            executeUnflatUnFlatFlat<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a,
+                aSelVector, b, bSelVector, c, cSelVector, result, resultSelVector, dataPtr);
+        } else if (!a.state->isFlat() && b.state->isFlat() && c.state->isFlat()) {
+            executeUnflatFlatFlat<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a,
+                aSelVector, b, bSelVector, c, cSelVector, result, resultSelVector, dataPtr);
+        } else if (!a.state->isFlat() && b.state->isFlat() && !c.state->isFlat()) {
+            executeUnflatFlatUnflat<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(a,
+                aSelVector, b, bSelVector, c, cSelVector, result, resultSelVector, dataPtr);
+        } else {
+            KU_ASSERT(false);
+        }
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/timestamp/timestamp_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/timestamp/timestamp_function.h
new file mode 100644
index 0000000000..d7aafa4dd7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/timestamp/timestamp_function.h
@@ -0,0 +1,34 @@
+#pragma once
+
+#include "common/exception/conversion.h"
+#include "common/types/interval_t.h"
+#include "common/types/timestamp_t.h"
+#include "function/cast/functions/numeric_cast.h"
+
+namespace lbug {
+namespace function {
+
+struct Century {
+    static inline void operation(common::timestamp_t& timestamp, int64_t& result) {
+        result = common::Timestamp::getTimestampPart(common::DatePartSpecifier::CENTURY, timestamp);
+    }
+};
+
+struct EpochMs {
+    static inline void operation(int64_t& ms, common::timestamp_t& result) {
+        result = common::Timestamp::fromEpochMilliSeconds(ms);
+    }
+};
+
+struct ToTimestamp {
+    static inline void operation(double& sec, common::timestamp_t& result) {
+        int64_t ms = 0;
+        if (!tryCastWithOverflowCheck(sec * common::Interval::MICROS_PER_SEC, ms)) {
+            throw common::ConversionException("Could not convert epoch seconds to TIMESTAMP");
+        }
+        result = common::timestamp_t(ms);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/timestamp/vector_timestamp_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/timestamp/vector_timestamp_functions.h
new file mode 100644
index 0000000000..6b9568b635
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/timestamp/vector_timestamp_functions.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct CenturyFunction {
+    static constexpr const char* name = "CENTURY";
+
+    static function_set getFunctionSet();
+};
+
+struct EpochMsFunction {
+    static constexpr const char* name = "EPOCH_MS";
+
+    static function_set getFunctionSet();
+};
+
+struct ToTimestampFunction {
+    static constexpr const char* name = "TO_TIMESTAMP";
+
+    static function_set getFunctionSet();
+};
+
+struct ToEpochMsFunction {
+    static constexpr const char* name = "TO_EPOCH_MS";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/udf_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/udf_function.h
new file mode 100644
index 0000000000..414f949d8e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/udf_function.h
@@ -0,0 +1,283 @@
+#pragma once
+
+#include "common/exception/binder.h"
+#include "common/exception/catalog.h"
+#include "common/type_utils.h"
+#include "common/types/ku_string.h"
+#include "function/scalar_function.h"
+
+namespace lbug {
+namespace function {
+
+struct UnaryUDFExecutor {
+    template<class OPERAND_TYPE, class RESULT_TYPE>
+    static inline void operation(OPERAND_TYPE& input, RESULT_TYPE& result, void* udfFunc) {
+        typedef RESULT_TYPE (*unary_udf_func)(OPERAND_TYPE);
+        auto unaryUDFFunc = (unary_udf_func)udfFunc;
+        result = unaryUDFFunc(input);
+    }
+};
+
+struct BinaryUDFExecutor {
+    template<class LEFT_TYPE, class RIGHT_TYPE, class RESULT_TYPE>
+    static inline void operation(LEFT_TYPE& left, RIGHT_TYPE& right, RESULT_TYPE& result,
+        void* udfFunc) {
+        typedef RESULT_TYPE (*binary_udf_func)(LEFT_TYPE, RIGHT_TYPE);
+        auto binaryUDFFunc = (binary_udf_func)udfFunc;
+        result = binaryUDFFunc(left, right);
+    }
+};
+
+struct TernaryUDFExecutor {
+    template<class A_TYPE, class B_TYPE, class C_TYPE, class RESULT_TYPE>
+    static inline void operation(A_TYPE& a, B_TYPE& b, C_TYPE& c, RESULT_TYPE& result,
+        void* udfFunc) {
+        typedef RESULT_TYPE (*ternary_udf_func)(A_TYPE, B_TYPE, C_TYPE);
+        auto ternaryUDFFunc = (ternary_udf_func)udfFunc;
+        result = ternaryUDFFunc(a, b, c);
+    }
+};
+
+struct UDF {
+    template<typename T>
+    static bool templateValidateType(const common::LogicalTypeID& type) {
+        auto logicalType = common::LogicalType{type};
+        auto physicalType = logicalType.getPhysicalType();
+        auto physicalTypeMatch = common::TypeUtils::visit(physicalType,
+            []<typename T1>(T1) { return std::is_same<T, T1>::value; });
+        auto logicalTypeMatch = common::TypeUtils::visit(logicalType,
+            []<typename T1>(T1) { return std::is_same<T, T1>::value; });
+        return logicalTypeMatch || physicalTypeMatch;
+    }
+
+    template<typename T>
+    static void validateType(const common::LogicalTypeID& type) {
+        if (!templateValidateType<T>(type)) {
+            throw common::CatalogException{
+                "Incompatible udf parameter/return type and templated type."};
+        }
+    }
+
+    template<typename RESULT_TYPE, typename... Args>
+    static function::scalar_func_exec_t createEmptyParameterExecFunc(RESULT_TYPE (*)(Args...),
+        const std::vector<common::LogicalTypeID>&) {
+        KU_UNREACHABLE;
+    }
+
+    template<typename RESULT_TYPE>
+    static function::scalar_func_exec_t createEmptyParameterExecFunc(RESULT_TYPE (*udfFunc)(),
+        const std::vector<common::LogicalTypeID>&) {
+        KU_UNUSED(udfFunc); // Disable compiler warnings.
+        return [udfFunc](
+                   [[maybe_unused]] const std::vector<std::shared_ptr<common::ValueVector>>& params,
+                   [[maybe_unused]] const std::vector<common::SelectionVector*>& paramSelVectors,
+                   common::ValueVector& result, common::SelectionVector* resultSelVector,
+                   void* /*dataPtr*/ = nullptr) -> void {
+            KU_ASSERT(params.empty() && paramSelVectors.empty());
+            for (auto i = 0u; i < resultSelVector->getSelSize(); ++i) {
+                auto resultPos = (*resultSelVector)[i];
+                result.copyFromValue(resultPos, common::Value(udfFunc()));
+            }
+        };
+    }
+
+    template<typename RESULT_TYPE, typename... Args>
+    static function::scalar_func_exec_t createUnaryExecFunc(RESULT_TYPE (* /*udfFunc*/)(Args...),
+        const std::vector<common::LogicalTypeID>& /*parameterTypes*/) {
+        KU_UNREACHABLE;
+    }
+
+    template<typename RESULT_TYPE, typename OPERAND_TYPE>
+    static function::scalar_func_exec_t createUnaryExecFunc(RESULT_TYPE (*udfFunc)(OPERAND_TYPE),
+        const std::vector<common::LogicalTypeID>& parameterTypes) {
+        if (parameterTypes.size() != 1) {
+            throw common::CatalogException{
+                "Expected exactly one parameter type for unary udf. Got: " +
+                std::to_string(parameterTypes.size()) + "."};
+        }
+        validateType<OPERAND_TYPE>(parameterTypes[0]);
+        function::scalar_func_exec_t execFunc =
+            [udfFunc](const std::vector<std::shared_ptr<common::ValueVector>>& params,
+                const std::vector<common::SelectionVector*>& paramSelVectors,
+                common::ValueVector& result, common::SelectionVector* resultSelVector,
+                void* /*dataPtr*/ = nullptr) -> void {
+            KU_ASSERT(params.size() == 1);
+            UnaryFunctionExecutor::executeSwitch<OPERAND_TYPE, RESULT_TYPE, UnaryUDFExecutor,
+                UnaryUDFFunctionWrapper>(*params[0], paramSelVectors[0], result, resultSelVector,
+                (void*)udfFunc);
+        };
+        return execFunc;
+    }
+
+    template<typename RESULT_TYPE, typename... Args>
+    static function::scalar_func_exec_t createBinaryExecFunc(RESULT_TYPE (* /*udfFunc*/)(Args...),
+        const std::vector<common::LogicalTypeID>& /*parameterTypes*/) {
+        KU_UNREACHABLE;
+    }
+
+    template<typename RESULT_TYPE, typename LEFT_TYPE, typename RIGHT_TYPE>
+    static function::scalar_func_exec_t createBinaryExecFunc(
+        RESULT_TYPE (*udfFunc)(LEFT_TYPE, RIGHT_TYPE),
+        const std::vector<common::LogicalTypeID>& parameterTypes) {
+        if (parameterTypes.size() != 2) {
+            throw common::CatalogException{
+                "Expected exactly two parameter types for binary udf. Got: " +
+                std::to_string(parameterTypes.size()) + "."};
+        }
+        validateType<LEFT_TYPE>(parameterTypes[0]);
+        validateType<RIGHT_TYPE>(parameterTypes[1]);
+        function::scalar_func_exec_t execFunc =
+            [udfFunc](const std::vector<std::shared_ptr<common::ValueVector>>& params,
+                const std::vector<common::SelectionVector*>& paramSelVectors,
+                common::ValueVector& result, common::SelectionVector* resultSelVector,
+                void* /*dataPtr*/ = nullptr) -> void {
+            KU_ASSERT(params.size() == 2);
+            BinaryFunctionExecutor::executeSwitch<LEFT_TYPE, RIGHT_TYPE, RESULT_TYPE,
+                BinaryUDFExecutor, BinaryUDFFunctionWrapper>(*params[0], paramSelVectors[0],
+                *params[1], paramSelVectors[1], result, resultSelVector, (void*)udfFunc);
+        };
+        return execFunc;
+    }
+
+    template<typename RESULT_TYPE, typename... Args>
+    static function::scalar_func_exec_t createTernaryExecFunc(RESULT_TYPE (* /*udfFunc*/)(Args...),
+        const std::vector<common::LogicalTypeID>& /*parameterTypes*/) {
+        KU_UNREACHABLE;
+    }
+
+    template<typename RESULT_TYPE, typename A_TYPE, typename B_TYPE, typename C_TYPE>
+    static function::scalar_func_exec_t createTernaryExecFunc(
+        RESULT_TYPE (*udfFunc)(A_TYPE, B_TYPE, C_TYPE),
+        std::vector<common::LogicalTypeID> parameterTypes) {
+        if (parameterTypes.size() != 3) {
+            throw common::CatalogException{
+                "Expected exactly three parameter types for ternary udf. Got: " +
+                std::to_string(parameterTypes.size()) + "."};
+        }
+        validateType<A_TYPE>(parameterTypes[0]);
+        validateType<B_TYPE>(parameterTypes[1]);
+        validateType<C_TYPE>(parameterTypes[2]);
+        function::scalar_func_exec_t execFunc =
+            [udfFunc](const std::vector<std::shared_ptr<common::ValueVector>>& params,
+                const std::vector<common::SelectionVector*>& paramSelVectors,
+                common::ValueVector& result, common::SelectionVector* resultSelVector,
+                void* /*dataPtr*/ = nullptr) -> void {
+            KU_ASSERT(params.size() == 3);
+            TernaryFunctionExecutor::executeSwitch<A_TYPE, B_TYPE, C_TYPE, RESULT_TYPE,
+                TernaryUDFExecutor, TernaryUDFFunctionWrapper>(*params[0], paramSelVectors[0],
+                *params[1], paramSelVectors[1], *params[2], paramSelVectors[2], result,
+                resultSelVector, (void*)udfFunc);
+        };
+        return execFunc;
+    }
+
+    template<typename TR, typename... Args>
+    static scalar_func_exec_t getScalarExecFunc(TR (*udfFunc)(Args...),
+        std::vector<common::LogicalTypeID> parameterTypes) {
+        constexpr auto numArgs = sizeof...(Args);
+        switch (numArgs) {
+        case 0:
+            return createEmptyParameterExecFunc<TR, Args...>(udfFunc, std::move(parameterTypes));
+        case 1:
+            return createUnaryExecFunc<TR, Args...>(udfFunc, std::move(parameterTypes));
+        case 2:
+            return createBinaryExecFunc<TR, Args...>(udfFunc, std::move(parameterTypes));
+        case 3:
+            return createTernaryExecFunc<TR, Args...>(udfFunc, std::move(parameterTypes));
+        default:
+            throw common::BinderException("UDF function only supported until ternary!");
+        }
+    }
+
+    template<typename T>
+    static common::LogicalTypeID getParameterType() {
+        if (std::is_same<T, bool>()) {
+            return common::LogicalTypeID::BOOL;
+        } else if (std::is_same<T, int8_t>()) {
+            return common::LogicalTypeID::INT8;
+        } else if (std::is_same<T, int16_t>()) {
+            return common::LogicalTypeID::INT16;
+        } else if (std::is_same<T, int32_t>()) {
+            return common::LogicalTypeID::INT32;
+        } else if (std::is_same<T, int64_t>()) {
+            return common::LogicalTypeID::INT64;
+        } else if (std::is_same<T, common::int128_t>()) {
+            return common::LogicalTypeID::INT128;
+        } else if (std::is_same<T, uint8_t>()) {
+            return common::LogicalTypeID::UINT8;
+        } else if (std::is_same<T, uint16_t>()) {
+            return common::LogicalTypeID::UINT16;
+        } else if (std::is_same<T, uint32_t>()) {
+            return common::LogicalTypeID::UINT32;
+        } else if (std::is_same<T, uint64_t>()) {
+            return common::LogicalTypeID::UINT64;
+        } else if (std::is_same<T, float>()) {
+            return common::LogicalTypeID::FLOAT;
+        } else if (std::is_same<T, double>()) {
+            return common::LogicalTypeID::DOUBLE;
+        } else if (std::is_same<T, common::ku_string_t>()) {
+            return common::LogicalTypeID::STRING;
+        } else {
+            KU_UNREACHABLE;
+        }
+    }
+
+    template<typename TA>
+    static void getParameterTypesRecursive(std::vector<common::LogicalTypeID>& arguments) {
+        arguments.push_back(getParameterType<TA>());
+    }
+
+    template<typename TA, typename TB, typename... Args>
+    static void getParameterTypesRecursive(std::vector<common::LogicalTypeID>& arguments) {
+        arguments.push_back(getParameterType<TA>());
+        getParameterTypesRecursive<TB, Args...>(arguments);
+    }
+
+    template<typename... Args>
+    static std::vector<common::LogicalTypeID> getParameterTypes() {
+        std::vector<common::LogicalTypeID> parameterTypes;
+        if constexpr (sizeof...(Args) > 0) {
+            getParameterTypesRecursive<Args...>(parameterTypes);
+        }
+        return parameterTypes;
+    }
+
+    template<typename TR, typename... Args>
+    static function_set getFunction(std::string name, TR (*udfFunc)(Args...),
+        std::vector<common::LogicalTypeID> parameterTypes, common::LogicalTypeID returnType) {
+        function_set definitions;
+        if (returnType == common::LogicalTypeID::STRING) {
+            KU_UNREACHABLE;
+        }
+        validateType<TR>(returnType);
+        scalar_func_exec_t scalarExecFunc = getScalarExecFunc<TR, Args...>(udfFunc, parameterTypes);
+        definitions.push_back(std::make_unique<function::ScalarFunction>(std::move(name),
+            std::move(parameterTypes), returnType, std::move(scalarExecFunc)));
+        return definitions;
+    }
+
+    template<typename TR, typename... Args>
+    static function_set getFunction(std::string name, TR (*udfFunc)(Args...)) {
+        return getFunction<TR, Args...>(std::move(name), udfFunc, getParameterTypes<Args...>(),
+            getParameterType<TR>());
+    }
+
+    template<typename TR, typename... Args>
+    static function_set getVectorizedFunction(std::string name, scalar_func_exec_t execFunc) {
+        function_set definitions;
+        definitions.push_back(std::make_unique<function::ScalarFunction>(std::move(name),
+            getParameterTypes<Args...>(), getParameterType<TR>(), std::move(execFunc)));
+        return definitions;
+    }
+
+    static function_set getVectorizedFunction(std::string name, scalar_func_exec_t execFunc,
+        std::vector<common::LogicalTypeID> parameterTypes, common::LogicalTypeID returnType) {
+        function_set definitions;
+        definitions.push_back(std::make_unique<function::ScalarFunction>(std::move(name),
+            std::move(parameterTypes), returnType, std::move(execFunc)));
+        return definitions;
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/unary_function_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/unary_function_executor.h
new file mode 100644
index 0000000000..94dc372f25
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/unary_function_executor.h
@@ -0,0 +1,198 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+#include "function/cast/cast_function_bind_data.h"
+
+namespace lbug {
+namespace function {
+
+/**
+ * Unary operator assumes operation with null returns null. This does NOT applies to IS_NULL and
+ * IS_NOT_NULL operation.
+ */
+
+struct UnaryFunctionWrapper {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static inline void operation(void* inputVector, uint64_t inputPos, void* resultVector,
+        uint64_t resultPos, void* /*dataPtr*/) {
+        auto& inputVector_ = *(common::ValueVector*)inputVector;
+        auto& resultVector_ = *(common::ValueVector*)resultVector;
+        FUNC::operation(inputVector_.getValue<OPERAND_TYPE>(inputPos),
+            resultVector_.getValue<RESULT_TYPE>(resultPos));
+    }
+};
+
+struct UnarySequenceFunctionWrapper {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static inline void operation(void* inputVector, uint64_t inputPos, void* resultVector,
+        uint64_t /* resultPos */, void* dataPtr) {
+        auto& inputVector_ = *(common::ValueVector*)inputVector;
+        auto& resultVector_ = *(common::ValueVector*)resultVector;
+        FUNC::operation(inputVector_.getValue<OPERAND_TYPE>(inputPos), resultVector_, dataPtr);
+    }
+};
+
+struct UnaryStringFunctionWrapper {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void operation(void* inputVector, uint64_t inputPos, void* resultVector,
+        uint64_t resultPos, void* /*dataPtr*/) {
+        auto& inputVector_ = *(common::ValueVector*)inputVector;
+        auto& resultVector_ = *(common::ValueVector*)resultVector;
+        FUNC::operation(inputVector_.getValue<OPERAND_TYPE>(inputPos),
+            resultVector_.getValue<RESULT_TYPE>(resultPos), resultVector_);
+    }
+};
+
+struct UnaryCastStringFunctionWrapper {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void operation(void* inputVector, uint64_t inputPos, void* resultVector,
+        uint64_t resultPos, void* dataPtr) {
+        auto& inputVector_ = *(common::ValueVector*)inputVector;
+        auto resultVector_ = (common::ValueVector*)resultVector;
+        // TODO(Ziyi): the reinterpret_cast is not safe since we don't always pass
+        // CastFunctionBindData
+        FUNC::operation(inputVector_.getValue<OPERAND_TYPE>(inputPos),
+            resultVector_->getValue<RESULT_TYPE>(resultPos), resultVector_, inputPos,
+            &reinterpret_cast<CastFunctionBindData*>(dataPtr)->option);
+    }
+};
+
+struct UnaryNestedTypeFunctionWrapper {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static inline void operation(void* inputVector, uint64_t inputPos, void* resultVector,
+        uint64_t resultPos, void* /*dataPtr*/) {
+        auto& inputVector_ = *(common::ValueVector*)inputVector;
+        auto& resultVector_ = *(common::ValueVector*)resultVector;
+        FUNC::operation(inputVector_.getValue<OPERAND_TYPE>(inputPos),
+            resultVector_.getValue<RESULT_TYPE>(resultPos), inputVector_, resultVector_);
+    }
+};
+
+struct SetSeedFunctionWrapper {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static inline void operation(void* inputVector, uint64_t inputPos, void* resultVector,
+        uint64_t resultPos, void* dataPtr) {
+        auto& inputVector_ = *(common::ValueVector*)inputVector;
+        auto& resultVector_ = *(common::ValueVector*)resultVector;
+        resultVector_.setNull(resultPos, true /* isNull */);
+        FUNC::operation(inputVector_.getValue<OPERAND_TYPE>(inputPos), dataPtr);
+    }
+};
+
+struct UnaryCastFunctionWrapper {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void operation(void* inputVector, uint64_t inputPos, void* resultVector,
+        uint64_t resultPos, void* /*dataPtr*/) {
+        auto& inputVector_ = *(common::ValueVector*)inputVector;
+        auto& resultVector_ = *(common::ValueVector*)resultVector;
+        FUNC::operation(inputVector_.getValue<OPERAND_TYPE>(inputPos),
+            resultVector_.getValue<RESULT_TYPE>(resultPos), inputVector_, resultVector_);
+    }
+};
+
+struct UnaryCastUnionFunctionWrapper {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void operation(void* inputVector, uint64_t inputPos, void* resultVector,
+        uint64_t resultPos, void* dataPtr) {
+        auto& inputVector_ = *(common::ValueVector*)inputVector;
+        auto& resultVector_ = *(common::ValueVector*)resultVector;
+        FUNC::operation(inputVector_, resultVector_, inputPos, resultPos, dataPtr);
+    }
+};
+
+struct UnaryUDFFunctionWrapper {
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static inline void operation(void* inputVector, uint64_t inputPos, void* resultVector,
+        uint64_t resultPos, void* dataPtr) {
+        auto& inputVector_ = *(common::ValueVector*)inputVector;
+        auto& resultVector_ = *(common::ValueVector*)resultVector;
+        FUNC::operation(inputVector_.getValue<OPERAND_TYPE>(inputPos),
+            resultVector_.getValue<RESULT_TYPE>(resultPos), dataPtr);
+    }
+};
+
+struct UnaryFunctionExecutor {
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC, typename OP_WRAPPER>
+    static void executeOnValue(common::ValueVector& inputVector, uint64_t inputPos,
+        common::ValueVector& resultVector, uint64_t resultPos, void* dataPtr) {
+        OP_WRAPPER::template operation<OPERAND_TYPE, RESULT_TYPE, FUNC>((void*)&inputVector,
+            inputPos, (void*)&resultVector, resultPos, dataPtr);
+    }
+
+    static std::pair<common::sel_t, common::sel_t> getSelectedPos(common::idx_t selIdx,
+        common::SelectionVector* operandSelVector, common::SelectionVector* resultSelVector,
+        bool operandIsUnfiltered, bool resultIsUnfiltered) {
+        common::sel_t operandPos = operandIsUnfiltered ? selIdx : (*operandSelVector)[selIdx];
+        common::sel_t resultPos = resultIsUnfiltered ? selIdx : (*resultSelVector)[selIdx];
+        return {operandPos, resultPos};
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC, typename OP_WRAPPER>
+    static void executeOnSelectedValues(common::ValueVector& operand,
+        common::SelectionVector* operandSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        const bool noNullsGuaranteed = operand.hasNoNullsGuarantee();
+        if (noNullsGuaranteed) {
+            result.setAllNonNull();
+        }
+
+        const bool operandIsUnfiltered = operandSelVector->isUnfiltered();
+        const bool resultIsUnfiltered = resultSelVector->isUnfiltered();
+
+        for (auto i = 0u; i < operandSelVector->getSelSize(); i++) {
+            const auto [operandPos, resultPos] = getSelectedPos(i, operandSelVector,
+                resultSelVector, operandIsUnfiltered, resultIsUnfiltered);
+            if (noNullsGuaranteed) {
+                executeOnValue<OPERAND_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(operand, operandPos,
+                    result, resultPos, dataPtr);
+            } else {
+                result.setNull(resultPos, operand.isNull(operandPos));
+                if (!result.isNull(resultPos)) {
+                    executeOnValue<OPERAND_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(operand, operandPos,
+                        result, resultPos, dataPtr);
+                }
+            }
+        }
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC, typename OP_WRAPPER>
+    static void executeSwitch(common::ValueVector& operand,
+        common::SelectionVector* operandSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        result.resetAuxiliaryBuffer();
+        if (operand.state->isFlat()) {
+            auto inputPos = (*operandSelVector)[0];
+            auto resultPos = (*resultSelVector)[0];
+            result.setNull(resultPos, operand.isNull(inputPos));
+            if (!result.isNull(resultPos)) {
+                executeOnValue<OPERAND_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(operand, inputPos,
+                    result, resultPos, dataPtr);
+            }
+        } else {
+            executeOnSelectedValues<OPERAND_TYPE, RESULT_TYPE, FUNC, OP_WRAPPER>(operand,
+                operandSelVector, result, resultSelVector, dataPtr);
+        }
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void execute(common::ValueVector& operand, common::SelectionVector* operandSelVector,
+        common::ValueVector& result, common::SelectionVector* resultSelVector) {
+        executeSwitch<OPERAND_TYPE, RESULT_TYPE, FUNC, UnaryFunctionWrapper>(operand,
+            operandSelVector, result, resultSelVector, nullptr /* dataPtr */);
+    }
+
+    template<typename OPERAND_TYPE, typename RESULT_TYPE, typename FUNC>
+    static void executeSequence(common::ValueVector& operand,
+        common::SelectionVector* operandSelVector, common::ValueVector& result,
+        common::SelectionVector* resultSelVector, void* dataPtr) {
+        result.resetAuxiliaryBuffer();
+        auto inputPos = (*operandSelVector)[0];
+        auto resultPos = (*resultSelVector)[0];
+        executeOnValue<OPERAND_TYPE, RESULT_TYPE, FUNC, UnarySequenceFunctionWrapper>(operand,
+            inputPos, result, resultPos, dataPtr);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/union/functions/union_tag.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/union/functions/union_tag.h
new file mode 100644
index 0000000000..cf242ac9bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/union/functions/union_tag.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace function {
+
+struct UnionTag {
+    static void operation(common::union_entry_t& unionValue, common::ku_string_t& tag,
+        common::ValueVector& unionVector, common::ValueVector& tagVector) {
+        auto tagIdxVector = common::UnionVector::getTagVector(&unionVector);
+        auto tagIdx = tagIdxVector->getValue<common::union_field_idx_t>(unionValue.entry.pos);
+        auto tagName = common::UnionType::getFieldName(unionVector.dataType, tagIdx);
+        if (tagName.length() > common::ku_string_t::SHORT_STR_LENGTH) {
+            tag.overflowPtr =
+                reinterpret_cast<uint64_t>(common::StringVector::getInMemOverflowBuffer(&tagVector)
+                                               ->allocateSpace(tagName.length()));
+            memcpy(reinterpret_cast<char*>(tag.overflowPtr), tagName.c_str(), tagName.length());
+            memcpy(tag.prefix, tagName.c_str(), common::ku_string_t::PREFIX_LENGTH);
+        } else {
+            memcpy(tag.prefix, tagName.c_str(), tagName.length());
+        }
+        tag.len = tagName.length();
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/union/vector_union_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/union/vector_union_functions.h
new file mode 100644
index 0000000000..450cf0dc48
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/union/vector_union_functions.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct UnionValueFunction {
+    static constexpr const char* name = "UNION_VALUE";
+
+    static function_set getFunctionSet();
+};
+
+struct UnionTagFunction {
+    static constexpr const char* name = "UNION_TAG";
+
+    static function_set getFunctionSet();
+};
+
+struct UnionExtractFunction {
+    static constexpr const char* name = "UNION_EXTRACT";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/utility/function_string_bind_data.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/utility/function_string_bind_data.h
new file mode 100644
index 0000000000..f77f0e5517
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/utility/function_string_bind_data.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct FunctionStringBindData : public FunctionBindData {
+    explicit FunctionStringBindData(std::string str)
+        : FunctionBindData{common::LogicalType::STRING()}, str{std::move(str)} {}
+
+    std::string str;
+
+    inline std::unique_ptr<FunctionBindData> copy() const override {
+        return std::make_unique<FunctionStringBindData>(str);
+    }
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/utility/vector_utility_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/utility/vector_utility_functions.h
new file mode 100644
index 0000000000..137803eed5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/utility/vector_utility_functions.h
@@ -0,0 +1,51 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct CoalesceFunction {
+    static constexpr const char* name = "COALESCE";
+
+    static function_set getFunctionSet();
+};
+
+struct IfNullFunction {
+    static constexpr const char* name = "IFNULL";
+
+    static function_set getFunctionSet();
+};
+
+struct ConstantOrNullFunction {
+    static constexpr const char* name = "CONSTANT_OR_NULL";
+
+    static function_set getFunctionSet();
+};
+
+struct CountIfFunction {
+    static constexpr const char* name = "COUNT_IF";
+
+    static function_set getFunctionSet();
+};
+
+struct ErrorFunction {
+    static constexpr const char* name = "ERROR";
+
+    static function_set getFunctionSet();
+};
+
+struct NullIfFunction {
+    static constexpr const char* name = "NULLIF";
+
+    static function_set getFunctionSet();
+};
+
+struct TypeOfFunction {
+    static constexpr const char* name = "TYPEOF";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/uuid/functions/gen_random_uuid.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/uuid/functions/gen_random_uuid.h
new file mode 100644
index 0000000000..e7e8410fab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/uuid/functions/gen_random_uuid.h
@@ -0,0 +1,13 @@
+#pragma once
+
+#include "common/types/uuid.h"
+
+namespace lbug {
+namespace function {
+
+struct GenRandomUUID {
+    static void operation(common::ku_uuid_t& input, void* dataPtr);
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/uuid/vector_uuid_functions.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/uuid/vector_uuid_functions.h
new file mode 100644
index 0000000000..fb0e13d0ae
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/function/uuid/vector_uuid_functions.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "function/function.h"
+
+namespace lbug {
+namespace function {
+
+struct GenRandomUUIDFunction {
+    static constexpr const char* name = "GEN_RANDOM_UUID";
+
+    static function_set getFunctionSet();
+};
+
+} // namespace function
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/graph.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/graph.h
new file mode 100644
index 0000000000..faafef0c57
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/graph.h
@@ -0,0 +1,255 @@
+#pragma once
+
+#include <iterator>
+#include <memory>
+
+#include "common/copy_constructors.h"
+#include "common/data_chunk/sel_vector.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include <span>
+
+namespace lbug {
+namespace catalog {
+class TableCatalogEntry;
+} // namespace catalog
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace graph {
+struct NativeGraphEntry;
+
+struct GraphRelInfo {
+    common::table_id_t srcTableID;
+    common::table_id_t dstTableID;
+    catalog::TableCatalogEntry* relGroupEntry;
+    common::oid_t relTableID;
+
+    GraphRelInfo(common::table_id_t srcTableID, common::table_id_t dstTableID,
+        catalog::TableCatalogEntry* relGroupEntry, common::oid_t relTableID)
+        : srcTableID{srcTableID}, dstTableID{dstTableID}, relGroupEntry{relGroupEntry},
+          relTableID{relTableID} {}
+};
+
+class LBUG_API NbrScanState {
+public:
+    struct Chunk {
+        friend class NbrScanState;
+
+        EXPLICIT_COPY_METHOD(Chunk);
+        // Any neighbour for which the given function returns false
+        // will be omitted from future iterations
+        // Used in GDSTask/EdgeCompute for updating the frontier
+        template<class Func>
+        void forEach(Func&& func) const {
+            selVector.forEach([&](auto i) { func(nbrNodes, propertyVectors, i); });
+        }
+        template<class Func>
+        void forEachBreakWhenFalse(Func&& func) const {
+            selVector.forEachBreakWhenFalse([&](auto i) -> bool { return func(nbrNodes, i); });
+        }
+
+        uint64_t size() const { return selVector.getSelSize(); }
+
+    private:
+        Chunk(std::span<const common::nodeID_t> nbrNodes, common::SelectionVector& selVector,
+            std::span<const std::shared_ptr<common::ValueVector>> propertyVectors);
+
+        Chunk(const Chunk& other) noexcept
+            : nbrNodes{other.nbrNodes}, selVector{other.selVector},
+              propertyVectors{other.propertyVectors} {}
+
+    private:
+        std::span<const common::nodeID_t> nbrNodes;
+        // this reference can be modified, but the underlying data will be reset the next time next
+        // is called
+        common::SelectionVector& selVector;
+        std::span<const std::shared_ptr<common::ValueVector>> propertyVectors;
+    };
+
+    virtual ~NbrScanState() = default;
+    virtual Chunk getChunk() = 0;
+
+    // Returns true if there are more values after the current batch
+    virtual bool next() = 0;
+
+protected:
+    static Chunk createChunk(std::span<const common::nodeID_t> nbrNodes,
+        common::SelectionVector& selVector,
+        std::span<const std::shared_ptr<common::ValueVector>> propertyVectors) {
+        return Chunk{nbrNodes, selVector, propertyVectors};
+    }
+};
+
+class VertexScanState {
+public:
+    struct Chunk {
+        friend class VertexScanState;
+
+        size_t size() const { return nodeIDs.size(); }
+        std::span<const common::nodeID_t> getNodeIDs() const { return nodeIDs; }
+        template<typename T>
+        std::span<const T> getProperties(size_t propertyIndex) const {
+            return std::span(reinterpret_cast<const T*>(propertyVectors[propertyIndex]->getData()),
+                nodeIDs.size());
+        }
+
+    private:
+        LBUG_API Chunk(std::span<const common::nodeID_t> nodeIDs,
+            std::span<const std::shared_ptr<common::ValueVector>> propertyVectors);
+
+    private:
+        std::span<const common::nodeID_t> nodeIDs;
+        std::span<const std::shared_ptr<common::ValueVector>> propertyVectors;
+    };
+    virtual Chunk getChunk() = 0;
+
+    // Returns true if there are more values after the current batch
+    virtual bool next() = 0;
+
+    virtual ~VertexScanState() = default;
+
+protected:
+    static Chunk createChunk(std::span<const common::nodeID_t> nodeIDs,
+        std::span<const std::shared_ptr<common::ValueVector>> propertyVectors) {
+        return Chunk{nodeIDs, propertyVectors};
+    }
+};
+
+/**
+ * Graph interface to be use by GDS algorithms to get neighbors of nodes.
+ *
+ * Instances of Graph are not expected to be thread-safe. Therefore, if Graph is intended to be used
+ * in a parallel manner, the user should first copy() an instance and give each thread a separate
+ * copy. It is the responsibility of the implementing Graph class that the copy() is a lightweight
+ * operation that does not copy large amounts of data between instances.
+ */
+class Graph {
+public:
+    class EdgeIterator {
+    public:
+        explicit constexpr EdgeIterator(NbrScanState* scanState) : scanState{scanState} {}
+        DEFAULT_BOTH_MOVE(EdgeIterator);
+        EdgeIterator(const EdgeIterator& other) = default;
+        EdgeIterator() : scanState{nullptr} {}
+        using difference_type = std::ptrdiff_t;
+        using value_type = NbrScanState::Chunk;
+
+        value_type operator*() const { return scanState->getChunk(); }
+        EdgeIterator& operator++() {
+            if (!scanState->next()) {
+                scanState = nullptr;
+            }
+            return *this;
+        }
+        void operator++(int) { ++*this; }
+        bool operator==(const EdgeIterator& other) const {
+            // Only needed for comparing to the end, so they are equal if and only if both are null
+            return scanState == nullptr && other.scanState == nullptr;
+        }
+        // Counts and consumes the iterator
+        uint64_t count() const {
+            // TODO(bmwinger): avoid scanning if all that's necessary is to count the results
+            uint64_t result = 0;
+            do {
+                result += scanState->getChunk().size();
+            } while (scanState->next());
+            return result;
+        }
+
+        std::vector<common::nodeID_t> collectNbrNodes() {
+            std::vector<common::nodeID_t> nbrNodes;
+            for (const auto chunk : *this) {
+                nbrNodes.reserve(nbrNodes.size() + chunk.size());
+                chunk.forEach(
+                    [&](auto neighbors, auto, auto i) { nbrNodes.push_back(neighbors[i]); });
+            }
+            return nbrNodes;
+        }
+
+        EdgeIterator& begin() noexcept { return *this; }
+        static constexpr EdgeIterator end() noexcept { return EdgeIterator(nullptr); }
+
+    private:
+        NbrScanState* scanState;
+    };
+    static_assert(std::input_iterator<EdgeIterator>);
+
+    Graph() = default;
+    virtual ~Graph() = default;
+
+    virtual NativeGraphEntry* getGraphEntry() = 0;
+
+    // Get id for all node tables.
+    virtual std::vector<common::table_id_t> getNodeTableIDs() const = 0;
+
+    // Get max offset of each table as a map.
+    virtual common::table_id_map_t<common::offset_t> getMaxOffsetMap(
+        transaction::Transaction* transaction) const = 0;
+
+    // Get max offset of given table.
+    virtual common::offset_t getMaxOffset(transaction::Transaction* transaction,
+        common::table_id_t id) const = 0;
+
+    // Get num nodes for all node tables.
+    virtual common::offset_t getNumNodes(transaction::Transaction* transaction) const = 0;
+
+    // Get all possible (srcTable, dstTable, relTable)s.
+    virtual std::vector<GraphRelInfo> getRelInfos(common::table_id_t srcTableID) = 0;
+
+    // Prepares scan on the specified relationship table (works for backwards and forwards scans)
+    virtual std::unique_ptr<NbrScanState> prepareRelScan(const catalog::TableCatalogEntry& entry,
+        common::oid_t relTableID, common::table_id_t nbrTableID,
+        std::vector<std::string> relProperties, bool randomLookup = true) = 0;
+
+    // Get dst nodeIDs for given src nodeID using forward adjList.
+    virtual EdgeIterator scanFwd(common::nodeID_t nodeID, NbrScanState& state) = 0;
+
+    // Get dst nodeIDs for given src nodeID tables using backward adjList.
+    virtual EdgeIterator scanBwd(common::nodeID_t nodeID, NbrScanState& state) = 0;
+
+    class VertexIterator {
+    public:
+        explicit constexpr VertexIterator(VertexScanState* scanState) : scanState{scanState} {}
+        DEFAULT_BOTH_MOVE(VertexIterator);
+        VertexIterator(const VertexIterator& other) = default;
+        VertexIterator() : scanState{nullptr} {}
+        using difference_type = std::ptrdiff_t;
+        using value_type = VertexScanState::Chunk;
+
+        value_type operator*() const { return scanState->getChunk(); }
+        VertexIterator& operator++() {
+            if (!scanState->next()) {
+                scanState = nullptr;
+            }
+            return *this;
+        }
+        void operator++(int) { ++*this; }
+        bool operator==(const VertexIterator& other) const {
+            // Only needed for comparing to the end, so they are equal if and only if both are null
+            return scanState == nullptr && other.scanState == nullptr;
+        }
+
+        VertexIterator& begin() noexcept { return *this; }
+        static constexpr VertexIterator end() noexcept { return VertexIterator(nullptr); }
+
+    private:
+        VertexScanState* scanState;
+    };
+    static_assert(std::input_iterator<EdgeIterator>);
+
+    virtual std::unique_ptr<VertexScanState> prepareVertexScan(
+        catalog::TableCatalogEntry* tableEntry, const std::vector<std::string>& properties) = 0;
+
+    virtual VertexIterator scanVertices(common::offset_t startNodeOffset,
+        common::offset_t endNodeOffsetExclusive, VertexScanState& scanState) = 0;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+} // namespace graph
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/graph_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/graph_entry.h
new file mode 100644
index 0000000000..05b51713b0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/graph_entry.h
@@ -0,0 +1,50 @@
+#pragma once
+
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/copy_constructors.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace graph {
+
+struct NativeGraphEntryTableInfo {
+    catalog::TableCatalogEntry* entry;
+
+    std::shared_ptr<binder::Expression> nodeOrRel;
+    std::shared_ptr<binder::Expression> predicate;
+
+    explicit NativeGraphEntryTableInfo(catalog::TableCatalogEntry* entry) : entry{entry} {}
+    NativeGraphEntryTableInfo(catalog::TableCatalogEntry* entry,
+        std::shared_ptr<binder::Expression> nodeOrRel,
+        std::shared_ptr<binder::Expression> predicate)
+        : entry{entry}, nodeOrRel{std::move(nodeOrRel)}, predicate{std::move(predicate)} {}
+};
+
+// Organize projected graph similar to CatalogEntry. When we want to share projected graph across
+// statements, we need to migrate this class to catalog (or client context).
+struct LBUG_API NativeGraphEntry {
+    std::vector<NativeGraphEntryTableInfo> nodeInfos;
+    std::vector<NativeGraphEntryTableInfo> relInfos;
+
+    NativeGraphEntry() = default;
+    NativeGraphEntry(std::vector<catalog::TableCatalogEntry*> nodeEntries,
+        std::vector<catalog::TableCatalogEntry*> relEntries);
+    EXPLICIT_COPY_DEFAULT_MOVE(NativeGraphEntry);
+
+    bool isEmpty() const { return nodeInfos.empty() && relInfos.empty(); }
+
+    std::vector<common::table_id_t> getNodeTableIDs() const;
+    std::vector<catalog::TableCatalogEntry*> getRelEntries() const;
+    std::vector<catalog::TableCatalogEntry*> getNodeEntries() const;
+
+    const NativeGraphEntryTableInfo& getRelInfo(common::table_id_t tableID) const;
+
+    void setRelPredicate(std::shared_ptr<binder::Expression> predicate);
+
+private:
+    NativeGraphEntry(const NativeGraphEntry& other)
+        : nodeInfos{other.nodeInfos}, relInfos{other.relInfos} {}
+};
+
+} // namespace graph
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/graph_entry_set.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/graph_entry_set.h
new file mode 100644
index 0000000000..660f809b06
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/graph_entry_set.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include <memory>
+#include <unordered_map>
+
+#include "common/assert.h"
+#include "parsed_graph_entry.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace graph {
+
+class GraphEntrySet {
+public:
+    void validateGraphNotExist(const std::string& name) const;
+    void validateGraphExist(const std::string& name) const;
+
+    bool hasGraph(const std::string& name) const { return nameToEntry.contains(name); }
+    ParsedGraphEntry* getEntry(const std::string& name) const {
+        KU_ASSERT(hasGraph(name));
+        return nameToEntry.at(name).get();
+    }
+    void addGraph(const std::string& name, std::unique_ptr<ParsedGraphEntry> entry) {
+        nameToEntry.insert({name, std::move(entry)});
+    }
+    void dropGraph(const std::string& name) { nameToEntry.erase(name); }
+
+    const std::unordered_map<std::string, std::unique_ptr<ParsedGraphEntry>>&
+    getNameToEntryMap() const {
+        return nameToEntry;
+    }
+
+    LBUG_API static GraphEntrySet* Get(const main::ClientContext& context);
+
+private:
+    std::unordered_map<std::string, std::unique_ptr<ParsedGraphEntry>> nameToEntry;
+};
+
+} // namespace graph
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/on_disk_graph.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/on_disk_graph.h
new file mode 100644
index 0000000000..8225c949f3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/on_disk_graph.h
@@ -0,0 +1,163 @@
+#pragma once
+
+#include <cstddef>
+
+#include "common/assert.h"
+#include "common/copy_constructors.h"
+#include "common/data_chunk/sel_vector.h"
+#include "common/enums/rel_direction.h"
+#include "common/mask.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "graph.h"
+#include "graph_entry.h"
+#include "processor/operator/filtering_operator.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+}
+
+namespace graph {
+
+class OnDiskGraphNbrScanState : public NbrScanState {
+    friend class OnDiskGraph;
+
+public:
+    OnDiskGraphNbrScanState(main::ClientContext* context, const catalog::TableCatalogEntry& entry,
+        common::oid_t relTableID, std::shared_ptr<binder::Expression> predicate);
+    OnDiskGraphNbrScanState(main::ClientContext* context, const catalog::TableCatalogEntry& entry,
+        common::oid_t relTableID, std::shared_ptr<binder::Expression> predicate,
+        std::vector<std::string> relProperties, bool randomLookup = false);
+
+    Chunk getChunk() override {
+        return createChunk(currentIter->getNbrNodes(), currentIter->getSelVectorUnsafe(),
+            std::span(propertyVectors.valueVectors));
+    }
+    bool next() override;
+
+    void startScan(common::RelDataDirection direction);
+
+    class InnerIterator : public processor::SelVectorOverWriter {
+    public:
+        InnerIterator(const main::ClientContext* context, storage::RelTable* relTable,
+            std::unique_ptr<storage::RelTableScanState> tableScanState);
+
+        DELETE_COPY_DEFAULT_MOVE(InnerIterator);
+
+        std::span<const common::nodeID_t> getNbrNodes() const {
+            RUNTIME_CHECK(for (size_t i = 0; i < getSelVector().getSelSize(); i++) {
+                KU_ASSERT(
+                    getSelVector().getSelectedPositions()[i] < common::DEFAULT_VECTOR_CAPACITY);
+            });
+            return std::span(&dstVector().getValue<const common::nodeID_t>(0),
+                common::DEFAULT_VECTOR_CAPACITY);
+        }
+
+        common::SelectionVector& getSelVectorUnsafe() {
+            return tableScanState->outState->getSelVectorUnsafe();
+        }
+
+        const common::SelectionVector& getSelVector() const {
+            return tableScanState->outState->getSelVector();
+        }
+
+        bool next(evaluator::ExpressionEvaluator* predicate, common::SemiMask* nbrNodeMask);
+        void initScan() const;
+
+        common::RelDataDirection getDirection() const { return tableScanState->direction; }
+
+    private:
+        common::ValueVector& dstVector() const { return *tableScanState->outputVectors[0]; }
+
+        const main::ClientContext* context;
+        storage::RelTable* relTable;
+        std::unique_ptr<storage::RelTableScanState> tableScanState;
+    };
+
+private:
+    std::unique_ptr<common::ValueVector> srcNodeIDVector;
+    std::unique_ptr<common::ValueVector> dstNodeIDVector;
+    common::DataChunk propertyVectors;
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> relPredicateEvaluator;
+    common::SemiMask* nbrNodeMask = nullptr;
+
+    std::vector<InnerIterator> directedIterators;
+    InnerIterator* currentIter = nullptr;
+};
+
+class OnDiskGraphVertexScanState final : public VertexScanState {
+public:
+    OnDiskGraphVertexScanState(main::ClientContext& context,
+        const catalog::TableCatalogEntry* tableEntry,
+        const std::vector<std::string>& propertyNames);
+
+    void startScan(common::offset_t beginOffset, common::offset_t endOffsetExclusive);
+
+    bool next() override;
+    Chunk getChunk() override {
+        return createChunk(std::span(&nodeIDVector->getValue<common::nodeID_t>(0),
+                               nodeIDVector->getSelVectorPtr()->getSelSize()),
+            std::span(propertyVectors.valueVectors));
+    }
+
+private:
+    const main::ClientContext& context;
+    const storage::NodeTable& nodeTable;
+
+    common::DataChunk propertyVectors;
+    std::unique_ptr<common::ValueVector> nodeIDVector;
+    std::unique_ptr<storage::NodeTableScanState> tableScanState;
+
+    common::offset_t numNodesToScan;
+    common::offset_t currentOffset;
+    common::offset_t endOffsetExclusive;
+};
+
+class LBUG_API OnDiskGraph final : public Graph {
+public:
+    OnDiskGraph(main::ClientContext* context, NativeGraphEntry entry);
+
+    NativeGraphEntry* getGraphEntry() override { return &graphEntry; }
+
+    void setNodeOffsetMask(common::NodeOffsetMaskMap* maskMap) { nodeOffsetMaskMap = maskMap; }
+
+    std::vector<common::table_id_t> getNodeTableIDs() const override {
+        return graphEntry.getNodeTableIDs();
+    }
+
+    common::table_id_map_t<common::offset_t> getMaxOffsetMap(
+        transaction::Transaction* transaction) const override;
+
+    common::offset_t getMaxOffset(transaction::Transaction* transaction,
+        common::table_id_t id) const override;
+
+    common::offset_t getNumNodes(transaction::Transaction* transaction) const override;
+
+    std::vector<GraphRelInfo> getRelInfos(common::table_id_t srcTableID) override;
+
+    std::unique_ptr<NbrScanState> prepareRelScan(const catalog::TableCatalogEntry& entry,
+        common::oid_t relTableID, common::table_id_t nbrTableID,
+        std::vector<std::string> relProperties, bool randomLookUp = true) override;
+
+    EdgeIterator scanFwd(common::nodeID_t nodeID, NbrScanState& state) override;
+    EdgeIterator scanBwd(common::nodeID_t nodeID, NbrScanState& state) override;
+
+    std::unique_ptr<VertexScanState> prepareVertexScan(catalog::TableCatalogEntry* tableEntry,
+        const std::vector<std::string>& propertiesToScan) override;
+    VertexIterator scanVertices(common::offset_t beginOffset, common::offset_t endOffsetExclusive,
+        VertexScanState& state) override;
+
+private:
+    main::ClientContext* context;
+    NativeGraphEntry graphEntry;
+    common::NodeOffsetMaskMap* nodeOffsetMaskMap = nullptr;
+    common::table_id_map_t<storage::NodeTable*> nodeIDToNodeTable;
+    std::vector<GraphRelInfo> relInfos;
+};
+
+} // namespace graph
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/parsed_graph_entry.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/parsed_graph_entry.h
new file mode 100644
index 0000000000..c4915909bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/graph/parsed_graph_entry.h
@@ -0,0 +1,59 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+#include <vector>
+
+#include "common/cast.h"
+
+namespace lbug {
+namespace graph {
+
+enum class GraphEntryType : uint8_t {
+    NATIVE = 0,
+    CYPHER = 1,
+};
+
+struct GraphEntryTypeUtils {
+    static std::string toString(GraphEntryType type);
+};
+
+struct LBUG_API ParsedGraphEntry {
+    GraphEntryType type;
+
+    explicit ParsedGraphEntry(GraphEntryType type) : type{type} {}
+    virtual ~ParsedGraphEntry() = default;
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+};
+
+struct ParsedNativeGraphTableInfo {
+    std::string tableName;
+    std::string predicate;
+
+    ParsedNativeGraphTableInfo(std::string tableName, std::string predicate)
+        : tableName{std::move(tableName)}, predicate{std::move(predicate)} {}
+};
+
+struct LBUG_API ParsedNativeGraphEntry : ParsedGraphEntry {
+    std::vector<ParsedNativeGraphTableInfo> nodeInfos;
+    std::vector<ParsedNativeGraphTableInfo> relInfos;
+
+    ParsedNativeGraphEntry(std::vector<ParsedNativeGraphTableInfo> nodeInfos,
+        std::vector<ParsedNativeGraphTableInfo> relInfos)
+        : ParsedGraphEntry{GraphEntryType::NATIVE}, nodeInfos{std::move(nodeInfos)},
+          relInfos{std::move(relInfos)} {}
+};
+
+struct LBUG_API ParsedCypherGraphEntry : ParsedGraphEntry {
+    std::string cypherQuery;
+
+    explicit ParsedCypherGraphEntry(std::string cypherQuery)
+        : ParsedGraphEntry{GraphEntryType::CYPHER}, cypherQuery{std::move(cypherQuery)} {}
+};
+
+} // namespace graph
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/attached_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/attached_database.h
new file mode 100644
index 0000000000..d6e64f871f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/attached_database.h
@@ -0,0 +1,64 @@
+#pragma once
+
+#include <memory>
+#include <string>
+
+#include "extension/catalog_extension.h"
+#include "transaction/transaction_manager.h"
+
+namespace duckdb {
+class MaterializedQueryResult;
+}
+
+namespace lbug {
+namespace storage {
+class StorageManager;
+} // namespace storage
+
+namespace main {
+
+class AttachedDatabase {
+public:
+    AttachedDatabase(std::string dbName, std::string dbType,
+        std::unique_ptr<extension::CatalogExtension> catalog)
+        : dbName{std::move(dbName)}, dbType{std::move(dbType)}, catalog{std::move(catalog)} {}
+
+    virtual ~AttachedDatabase() = default;
+
+    std::string getDBName() const { return dbName; }
+
+    std::string getDBType() const { return dbType; }
+
+    catalog::Catalog* getCatalog() { return catalog.get(); }
+
+    std::unique_ptr<duckdb::MaterializedQueryResult> executeQuery(const std::string& query);
+
+    void invalidateCache();
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+protected:
+    std::string dbName;
+    std::string dbType;
+    std::unique_ptr<catalog::Catalog> catalog;
+};
+
+class AttachedLbugDatabase final : public AttachedDatabase {
+public:
+    AttachedLbugDatabase(std::string dbPath, std::string dbName, std::string dbType,
+        ClientContext* clientContext);
+
+    storage::StorageManager* getStorageManager() { return storageManager.get(); }
+
+    transaction::TransactionManager* getTransactionManager() { return transactionManager.get(); }
+
+private:
+    std::unique_ptr<storage::StorageManager> storageManager;
+    std::unique_ptr<transaction::TransactionManager> transactionManager;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/client_config.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/client_config.h
new file mode 100644
index 0000000000..1fedc75eca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/client_config.h
@@ -0,0 +1,63 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+#include "common/enums/path_semantic.h"
+
+namespace lbug {
+namespace main {
+
+struct ClientConfigDefault {
+    // 0 means timeout is disabled by default.
+    static constexpr uint64_t TIMEOUT_IN_MS = 0;
+    static constexpr uint32_t VAR_LENGTH_MAX_DEPTH = 30;
+    static constexpr uint64_t SPARSE_FRONTIER_THRESHOLD = 1000;
+    static constexpr bool ENABLE_SEMI_MASK = true;
+    static constexpr bool ENABLE_ZONE_MAP = true;
+    static constexpr bool ENABLE_PROGRESS_BAR = false;
+    static constexpr uint64_t SHOW_PROGRESS_AFTER = 1000;
+    static constexpr common::PathSemantic RECURSIVE_PATTERN_SEMANTIC = common::PathSemantic::WALK;
+    static constexpr uint32_t RECURSIVE_PATTERN_FACTOR = 100;
+    static constexpr bool DISABLE_MAP_KEY_CHECK = true;
+    static constexpr uint64_t WARNING_LIMIT = 8 * 1024;
+    static constexpr bool ENABLE_PLAN_OPTIMIZER = true;
+    static constexpr bool ENABLE_INTERNAL_CATALOG = false;
+};
+
+struct ClientConfig {
+    // System home directory.
+    std::string homeDirectory;
+    // File search path.
+    std::string fileSearchPath;
+    // If using semi mask in join.
+    bool enableSemiMask = ClientConfigDefault::ENABLE_SEMI_MASK;
+    // If using zone map in scan.
+    bool enableZoneMap = ClientConfigDefault::ENABLE_ZONE_MAP;
+    // Number of threads for execution.
+    uint64_t numThreads = 1;
+    // Timeout (milliseconds).
+    uint64_t timeoutInMS = ClientConfigDefault::TIMEOUT_IN_MS;
+    // Variable length maximum depth.
+    uint32_t varLengthMaxDepth = ClientConfigDefault::VAR_LENGTH_MAX_DEPTH;
+    // Threshold determines when to switch from sparse frontier to dense frontier
+    uint64_t sparseFrontierThreshold = ClientConfigDefault::SPARSE_FRONTIER_THRESHOLD;
+    // If using progress bar.
+    bool enableProgressBar = ClientConfigDefault::ENABLE_PROGRESS_BAR;
+    // time before displaying progress bar
+    uint64_t showProgressAfter = ClientConfigDefault::SHOW_PROGRESS_AFTER;
+    // Semantic for recursive pattern, can be either WALK, TRAIL, ACYCLIC
+    common::PathSemantic recursivePatternSemantic = ClientConfigDefault::RECURSIVE_PATTERN_SEMANTIC;
+    // Scale factor for recursive pattern cardinality estimation.
+    uint32_t recursivePatternCardinalityScaleFactor = ClientConfigDefault::RECURSIVE_PATTERN_FACTOR;
+    // Maximum number of cached warnings
+    uint64_t warningLimit = ClientConfigDefault::WARNING_LIMIT;
+    bool disableMapKeyCheck = ClientConfigDefault::DISABLE_MAP_KEY_CHECK;
+    // If enable plan optimizer
+    bool enablePlanOptimizer = ClientConfigDefault::ENABLE_PLAN_OPTIMIZER;
+    // If use internal catalog during binding
+    bool enableInternalCatalog = ClientConfigDefault::ENABLE_INTERNAL_CATALOG;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/client_context.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/client_context.h
new file mode 100644
index 0000000000..044f7c485f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/client_context.h
@@ -0,0 +1,256 @@
+#pragma once
+
+#include <atomic>
+#include <memory>
+#include <mutex>
+#include <optional>
+
+#include "common/arrow/arrow_result_config.h"
+#include "common/timer.h"
+#include "common/types/value/value.h"
+#include "function/table/scan_replacement.h"
+#include "main/client_config.h"
+#include "main/prepared_statement_manager.h"
+#include "main/query_result.h"
+#include "prepared_statement.h"
+
+namespace lbug {
+namespace common {
+class RandomEngine;
+class TaskScheduler;
+class ProgressBar;
+class VirtualFileSystem;
+} // namespace common
+
+namespace catalog {
+class Catalog;
+}
+
+namespace extension {
+class ExtensionManager;
+} // namespace extension
+
+namespace graph {
+class GraphEntrySet;
+}
+
+namespace storage {
+class StorageManager;
+}
+
+namespace processor {
+class ImportDB;
+class WarningContext;
+} // namespace processor
+
+namespace transaction {
+class TransactionContext;
+class Transaction;
+} // namespace transaction
+
+namespace main {
+struct DBConfig;
+class Database;
+class DatabaseManager;
+class AttachedLbugDatabase;
+struct SpillToDiskSetting;
+struct ExtensionOption;
+class EmbeddedShell;
+
+struct ActiveQuery {
+    explicit ActiveQuery();
+    std::atomic<bool> interrupted;
+    common::Timer timer;
+
+    void reset();
+};
+
+/**
+ * @brief Contain client side configuration. We make profiler associated per query, so the profiler
+ * is not maintained in the client context.
+ */
+class LBUG_API ClientContext {
+    friend class Connection;
+    friend class EmbeddedShell;
+    friend struct SpillToDiskSetting;
+    friend class processor::ImportDB;
+    friend class processor::WarningContext;
+    friend class transaction::TransactionContext;
+    friend class common::RandomEngine;
+    friend class common::ProgressBar;
+    friend class graph::GraphEntrySet;
+
+public:
+    explicit ClientContext(Database* database);
+    ~ClientContext();
+
+    // Client config
+    const ClientConfig* getClientConfig() const { return &clientConfig; }
+    ClientConfig* getClientConfigUnsafe() { return &clientConfig; }
+
+    // Database config
+    const DBConfig* getDBConfig() const;
+    DBConfig* getDBConfigUnsafe() const;
+    common::Value getCurrentSetting(const std::string& optionName) const;
+
+    // Timer and timeout
+    void interrupt() { activeQuery.interrupted = true; }
+    bool interrupted() const { return activeQuery.interrupted; }
+    bool hasTimeout() const { return clientConfig.timeoutInMS != 0; }
+    void setQueryTimeOut(uint64_t timeoutInMS);
+    uint64_t getQueryTimeOut() const;
+    void startTimer();
+    uint64_t getTimeoutRemainingInMS() const;
+    void resetActiveQuery() { activeQuery.reset(); }
+
+    // Parallelism
+    void setMaxNumThreadForExec(uint64_t numThreads);
+    uint64_t getMaxNumThreadForExec() const;
+
+    // Replace function.
+    void addScanReplace(function::ScanReplacement scanReplacement);
+    std::unique_ptr<function::ScanReplacementData> tryReplaceByName(
+        const std::string& objectName) const;
+    std::unique_ptr<function::ScanReplacementData> tryReplaceByHandle(
+        function::scan_replace_handle_t handle) const;
+
+    // Extension
+    void setExtensionOption(std::string name, common::Value value);
+    const ExtensionOption* getExtensionOption(std::string optionName) const;
+    std::string getExtensionDir() const;
+
+    // Getters.
+    std::string getDatabasePath() const;
+    Database* getDatabase() const;
+    AttachedLbugDatabase* getAttachedDatabase() const;
+
+    const CachedPreparedStatementManager& getCachedPreparedStatementManager() const {
+        return cachedPreparedStatementManager;
+    }
+
+    bool isInMemory() const;
+
+    static std::string getEnvVariable(const std::string& name);
+    static std::string getUserHomeDir();
+
+    void setDefaultDatabase(AttachedLbugDatabase* defaultDatabase_);
+    bool hasDefaultDatabase() const;
+    void setUseInternalCatalogEntry(bool useInternalCatalogEntry) {
+        this->useInternalCatalogEntry_ = useInternalCatalogEntry;
+    }
+    bool useInternalCatalogEntry() const {
+        return clientConfig.enableInternalCatalog ? true : useInternalCatalogEntry_;
+    }
+
+    void addScalarFunction(std::string name, function::function_set definitions);
+    void removeScalarFunction(const std::string& name);
+
+    void cleanUp();
+
+    struct QueryConfig {
+        QueryResultType resultType;
+        common::ArrowResultConfig arrowConfig;
+
+        QueryConfig() : resultType{QueryResultType::FTABLE}, arrowConfig{} {}
+        QueryConfig(QueryResultType resultType, common::ArrowResultConfig arrowConfig)
+            : resultType{resultType}, arrowConfig{arrowConfig} {}
+    };
+
+    std::unique_ptr<QueryResult> query(std::string_view queryStatement,
+        std::optional<uint64_t> queryID = std::nullopt, QueryConfig config = {});
+    std::unique_ptr<PreparedStatement> prepareWithParams(std::string_view query,
+        std::unordered_map<std::string, std::unique_ptr<common::Value>> inputParams = {});
+    std::unique_ptr<QueryResult> executeWithParams(PreparedStatement* preparedStatement,
+        std::unordered_map<std::string, std::unique_ptr<common::Value>> inputParams,
+        std::optional<uint64_t> queryID = std::nullopt);
+
+    struct TransactionHelper {
+        enum class TransactionCommitAction : uint8_t {
+            COMMIT_IF_NEW,
+            COMMIT_IF_AUTO,
+            COMMIT_NEW_OR_AUTO,
+            NOT_COMMIT
+        };
+        static bool commitIfNew(TransactionCommitAction action) {
+            return action == TransactionCommitAction::COMMIT_IF_NEW ||
+                   action == TransactionCommitAction::COMMIT_NEW_OR_AUTO;
+        }
+        static bool commitIfAuto(TransactionCommitAction action) {
+            return action == TransactionCommitAction::COMMIT_IF_AUTO ||
+                   action == TransactionCommitAction::COMMIT_NEW_OR_AUTO;
+        }
+        static TransactionCommitAction getAction(bool commitIfNew, bool commitIfAuto);
+        static void runFuncInTransaction(transaction::TransactionContext& context,
+            const std::function<void()>& fun, bool readOnlyStatement, bool isTransactionStatement,
+            TransactionCommitAction action);
+    };
+
+private:
+    void validateTransaction(bool readOnly, bool requireTransaction) const;
+
+    std::vector<std::shared_ptr<parser::Statement>> parseQuery(std::string_view query);
+
+    struct PrepareResult {
+        std::unique_ptr<PreparedStatement> preparedStatement;
+        std::unique_ptr<CachedPreparedStatement> cachedPreparedStatement;
+    };
+
+    PrepareResult prepareNoLock(std::shared_ptr<parser::Statement> parsedStatement,
+        bool shouldCommitNewTransaction,
+        std::unordered_map<std::string, std::shared_ptr<common::Value>> inputParams = {});
+
+    template<typename T, typename... Args>
+    std::unique_ptr<QueryResult> executeWithParams(PreparedStatement* preparedStatement,
+        std::unordered_map<std::string, std::unique_ptr<common::Value>> params,
+        std::pair<std::string, T> arg, std::pair<std::string, Args>... args) {
+        auto name = arg.first;
+        auto val = std::make_unique<common::Value>((T)arg.second);
+        params.insert({name, std::move(val)});
+        return executeWithParams(preparedStatement, std::move(params), args...);
+    }
+
+    std::unique_ptr<QueryResult> executeNoLock(PreparedStatement* preparedStatement,
+        CachedPreparedStatement* cachedPreparedStatement,
+        std::optional<uint64_t> queryID = std::nullopt, QueryConfig config = {});
+    std::unique_ptr<QueryResult> queryNoLock(std::string_view query,
+        std::optional<uint64_t> queryID = std::nullopt, QueryConfig config = {});
+
+    bool canExecuteWriteQuery() const;
+
+    std::unique_ptr<QueryResult> handleFailedExecution(std::optional<uint64_t> queryID,
+        const std::exception& e) const;
+
+    std::mutex mtx;
+    // Client side configurable settings.
+    ClientConfig clientConfig;
+    // Current query.
+    ActiveQuery activeQuery;
+    // Cache prepare statement.
+    CachedPreparedStatementManager cachedPreparedStatementManager;
+    // Transaction context.
+    std::unique_ptr<transaction::TransactionContext> transactionContext;
+    // Replace external object as pointer Value;
+    std::vector<function::ScanReplacement> scanReplacements;
+    // Extension configurable settings.
+    std::unordered_map<std::string, common::Value> extensionOptionValues;
+    // Random generator for UUID.
+    std::unique_ptr<common::RandomEngine> randomEngine;
+    // Local database.
+    Database* localDatabase;
+    // Remote database.
+    AttachedLbugDatabase* remoteDatabase;
+    // Progress bar.
+    std::unique_ptr<common::ProgressBar> progressBar;
+    // Warning information
+    std::unique_ptr<processor::WarningContext> warningContext;
+    // Graph entries
+    std::unique_ptr<graph::GraphEntrySet> graphEntrySet;
+    // Whether the query can access internal tables/sequences or not.
+    bool useInternalCatalogEntry_ = false;
+    // Whether the transaction should be rolled back on destruction. If the parent database is
+    // closed, the rollback should be prevented or it will SEGFAULT.
+    bool preventTransactionRollbackOnDestruction = false;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/connection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/connection.h
new file mode 100644
index 0000000000..fac31a45a3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/connection.h
@@ -0,0 +1,161 @@
+#pragma once
+
+#include "client_context.h"
+#include "database.h"
+#include "function/udf_function.h"
+
+namespace lbug {
+namespace main {
+
+/**
+ * @brief Connection is used to interact with a Database instance. Each Connection is thread-safe.
+ * Multiple connections can connect to the same Database instance in a multi-threaded environment.
+ */
+class Connection {
+    friend class testing::BaseGraphTest;
+    friend class testing::PrivateGraphTest;
+    friend class testing::TestHelper;
+    friend class benchmark::Benchmark;
+    friend class ConnectionExecuteAsyncWorker;
+    friend class ConnectionQueryAsyncWorker;
+
+public:
+    /**
+     * @brief Creates a connection to the database.
+     * @param database A pointer to the database instance that this connection will be connected to.
+     */
+    LBUG_API explicit Connection(Database* database);
+    /**
+     * @brief Destructs the connection.
+     */
+    LBUG_API ~Connection();
+    /**
+     * @brief Sets the maximum number of threads to use for execution in the current connection.
+     * @param numThreads The number of threads to use for execution in the current connection.
+     */
+    LBUG_API void setMaxNumThreadForExec(uint64_t numThreads);
+    /**
+     * @brief Returns the maximum number of threads to use for execution in the current connection.
+     * @return the maximum number of threads to use for execution in the current connection.
+     */
+    LBUG_API uint64_t getMaxNumThreadForExec();
+
+    /**
+     * @brief Executes the given query and returns the result.
+     * @param query The query to execute.
+     * @return the result of the query.
+     */
+    LBUG_API std::unique_ptr<QueryResult> query(std::string_view query);
+
+    LBUG_API std::unique_ptr<QueryResult> queryAsArrow(std::string_view query, int64_t chunkSize);
+
+    /**
+     * @brief Prepares the given query and returns the prepared statement.
+     * @param query The query to prepare.
+     * @return the prepared statement.
+     */
+    LBUG_API std::unique_ptr<PreparedStatement> prepare(std::string_view query);
+
+    /**
+     * @brief Prepares the given query and returns the prepared statement.
+     * @param query The query to prepare.
+     * @param inputParams The parameter pack where each arg is a pair with the first element
+     * being parameter name and second element being parameter value. The only parameters that are
+     * relevant during prepare are ones that will be substituted with a scan source. Any other
+     * parameters will either be ignored or will cause an error to be thrown.
+     * @return the prepared statement.
+     */
+    LBUG_API std::unique_ptr<PreparedStatement> prepareWithParams(std::string_view query,
+        std::unordered_map<std::string, std::unique_ptr<common::Value>> inputParams);
+
+    /**
+     * @brief Executes the given prepared statement with args and returns the result.
+     * @param preparedStatement The prepared statement to execute.
+     * @param args The parameter pack where each arg is a std::pair with the first element being
+     * parameter name and second element being parameter value.
+     * @return the result of the query.
+     */
+    template<typename... Args>
+    inline std::unique_ptr<QueryResult> execute(PreparedStatement* preparedStatement,
+        std::pair<std::string, Args>... args) {
+        std::unordered_map<std::string, std::unique_ptr<common::Value>> inputParameters;
+        return executeWithParams(preparedStatement, std::move(inputParameters), args...);
+    }
+    /**
+     * @brief Executes the given prepared statement with inputParams and returns the result.
+     * @param preparedStatement The prepared statement to execute.
+     * @param inputParams The parameter pack where each arg is a std::pair with the first element
+     * being parameter name and second element being parameter value.
+     * @return the result of the query.
+     */
+    LBUG_API std::unique_ptr<QueryResult> executeWithParams(PreparedStatement* preparedStatement,
+        std::unordered_map<std::string, std::unique_ptr<common::Value>> inputParams);
+    /**
+     * @brief interrupts all queries currently executing within this connection.
+     */
+    LBUG_API void interrupt();
+
+    /**
+     * @brief sets the query timeout value of the current connection. A value of zero (the default)
+     * disables the timeout.
+     */
+    LBUG_API void setQueryTimeOut(uint64_t timeoutInMS);
+
+    template<typename TR, typename... Args>
+    void createScalarFunction(std::string name, TR (*udfFunc)(Args...)) {
+        addScalarFunction(name, function::UDF::getFunction<TR, Args...>(name, udfFunc));
+    }
+
+    template<typename TR, typename... Args>
+    void createScalarFunction(std::string name, std::vector<common::LogicalTypeID> parameterTypes,
+        common::LogicalTypeID returnType, TR (*udfFunc)(Args...)) {
+        addScalarFunction(name, function::UDF::getFunction<TR, Args...>(name, udfFunc,
+                                    std::move(parameterTypes), returnType));
+    }
+
+    void addUDFFunctionSet(std::string name, function::function_set func) {
+        addScalarFunction(name, std::move(func));
+    }
+
+    void removeUDFFunction(std::string name) { removeScalarFunction(name); }
+
+    template<typename TR, typename... Args>
+    void createVectorizedFunction(std::string name, function::scalar_func_exec_t scalarFunc) {
+        addScalarFunction(name,
+            function::UDF::getVectorizedFunction<TR, Args...>(name, std::move(scalarFunc)));
+    }
+
+    void createVectorizedFunction(std::string name,
+        std::vector<common::LogicalTypeID> parameterTypes, common::LogicalTypeID returnType,
+        function::scalar_func_exec_t scalarFunc) {
+        addScalarFunction(name, function::UDF::getVectorizedFunction(name, std::move(scalarFunc),
+                                    std::move(parameterTypes), returnType));
+    }
+
+    ClientContext* getClientContext() { return clientContext.get(); };
+
+private:
+    template<typename T, typename... Args>
+    std::unique_ptr<QueryResult> executeWithParams(PreparedStatement* preparedStatement,
+        std::unordered_map<std::string, std::unique_ptr<common::Value>> params,
+        std::pair<std::string, T> arg, std::pair<std::string, Args>... args) {
+        return clientContext->executeWithParams(preparedStatement, std::move(params), arg, args...);
+    }
+
+    LBUG_API void addScalarFunction(std::string name, function::function_set definitions);
+    LBUG_API void removeScalarFunction(std::string name);
+
+    std::unique_ptr<QueryResult> queryWithID(std::string_view query, uint64_t queryID);
+
+    std::unique_ptr<QueryResult> executeWithParamsWithID(PreparedStatement* preparedStatement,
+        std::unordered_map<std::string, std::unique_ptr<common::Value>> inputParams,
+        uint64_t queryID);
+
+private:
+    Database* database;
+    std::unique_ptr<ClientContext> clientContext;
+    std::shared_ptr<common::DatabaseLifeCycleManager> dbLifeCycleManager;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/database.h
new file mode 100644
index 0000000000..63a4c75c7b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/database.h
@@ -0,0 +1,204 @@
+#pragma once
+
+#include <memory>
+#include <mutex>
+#include <vector>
+
+#if defined(__APPLE__)
+#include <pthread/qos.h>
+#endif
+
+#include "common/api.h"
+#include "common/database_lifecycle_manager.h"
+#include "lbug_fwd.h"
+#include "main/db_config.h"
+
+namespace lbug {
+namespace common {
+class FileSystem;
+} // namespace common
+
+namespace extension {
+class ExtensionManager;
+class TransformerExtension;
+class BinderExtension;
+class PlannerExtension;
+class MapperExtension;
+} // namespace extension
+
+namespace storage {
+class StorageExtension;
+} // namespace storage
+
+namespace main {
+class DatabaseManager;
+/**
+ * @brief Stores runtime configuration for creating or opening a Database
+ */
+struct LBUG_API SystemConfig {
+    /**
+     * @brief Creates a SystemConfig object.
+     * @param bufferPoolSize Max size of the buffer pool in bytes.
+     *        The larger the buffer pool, the more data from the database files is kept in memory,
+     *        reducing the amount of File I/O
+     * @param maxNumThreads The maximum number of threads to use during query execution
+     * @param enableCompression Whether or not to compress data on-disk for supported types
+     * @param readOnly If true, the database is opened read-only. No write transaction is
+     * allowed on the `Database` object. Multiple read-only `Database` objects can be created with
+     * the same database path. If false, the database is opened read-write. Under this mode,
+     * there must not be multiple `Database` objects created with the same database path.
+     * @param maxDBSize The maximum size of the database in bytes. Note that this is introduced
+     * temporarily for now to get around with the default 8TB mmap address space limit some
+     * environment. This will be removed once we implemente a better solution later. The value is
+     * default to 1 << 43 (8TB) under 64-bit environment and 1GB under 32-bit one (see
+     * `DEFAULT_VM_REGION_MAX_SIZE`).
+     * @param autoCheckpoint If true, the database will automatically checkpoint when the size of
+     * the WAL file exceeds the checkpoint threshold.
+     * @param checkpointThreshold The threshold of the WAL file size in bytes. When the size of the
+     * WAL file exceeds this threshold, the database will checkpoint if autoCheckpoint is true.
+     * @param forceCheckpointOnClose If true, the database will force checkpoint when closing.
+     * @param throwOnWalReplayFailure If true, any WAL replaying failure when loading the database
+     * will throw an error. Otherwise, Lbug will silently ignore the failure and replay up to where
+     * the error occured.
+     * @param enableChecksums If true, the database will use checksums to detect corruption in the
+     * WAL file.
+     */
+    explicit SystemConfig(uint64_t bufferPoolSize = -1u, uint64_t maxNumThreads = 0,
+        bool enableCompression = true, bool readOnly = false, uint64_t maxDBSize = -1u,
+        bool autoCheckpoint = true, uint64_t checkpointThreshold = 16777216 /* 16MB */,
+        bool forceCheckpointOnClose = true, bool throwOnWalReplayFailure = true,
+        bool enableChecksums = true
+#if defined(__APPLE__)
+        ,
+        uint32_t threadQos = QOS_CLASS_DEFAULT
+#endif
+    );
+
+    uint64_t bufferPoolSize;
+    uint64_t maxNumThreads;
+    bool enableCompression;
+    bool readOnly;
+    uint64_t maxDBSize;
+    bool autoCheckpoint;
+    uint64_t checkpointThreshold;
+    bool forceCheckpointOnClose;
+    bool throwOnWalReplayFailure;
+    bool enableChecksums;
+#if defined(__APPLE__)
+    uint32_t threadQos;
+#endif
+};
+
+/**
+ * @brief Database class is the main class of Lbug. It manages all database components.
+ */
+class Database {
+    friend class EmbeddedShell;
+    friend class ClientContext;
+    friend class Connection;
+    friend class testing::BaseGraphTest;
+
+public:
+    /**
+     * @brief Creates a database object.
+     * @param databasePath Database path. If left empty, or :memory: is specified, this will create
+     *        an in-memory database.
+     * @param systemConfig System configurations (buffer pool size and max num threads).
+     */
+    LBUG_API explicit Database(std::string_view databasePath,
+        SystemConfig systemConfig = SystemConfig());
+    /**
+     * @brief Destructs the database object.
+     */
+    LBUG_API ~Database();
+
+    LBUG_API void registerFileSystem(std::unique_ptr<common::FileSystem> fs);
+
+    LBUG_API void registerStorageExtension(std::string name,
+        std::unique_ptr<storage::StorageExtension> storageExtension);
+
+    LBUG_API void addExtensionOption(std::string name, common::LogicalTypeID type,
+        common::Value defaultValue, bool isConfidential = false);
+
+    LBUG_API void addTransformerExtension(
+        std::unique_ptr<extension::TransformerExtension> transformerExtension);
+
+    std::vector<extension::TransformerExtension*> getTransformerExtensions();
+
+    LBUG_API void addBinderExtension(
+        std::unique_ptr<extension::BinderExtension> transformerExtension);
+
+    std::vector<extension::BinderExtension*> getBinderExtensions();
+
+    LBUG_API void addPlannerExtension(
+        std::unique_ptr<extension::PlannerExtension> plannerExtension);
+
+    std::vector<extension::PlannerExtension*> getPlannerExtensions();
+
+    LBUG_API void addMapperExtension(std::unique_ptr<extension::MapperExtension> mapperExtension);
+
+    std::vector<extension::MapperExtension*> getMapperExtensions();
+
+    catalog::Catalog* getCatalog() { return catalog.get(); }
+
+    const DBConfig& getConfig() const { return dbConfig; }
+
+    std::vector<storage::StorageExtension*> getStorageExtensions();
+
+    uint64_t getNextQueryID();
+
+    storage::StorageManager* getStorageManager() { return storageManager.get(); }
+
+    transaction::TransactionManager* getTransactionManager() { return transactionManager.get(); }
+
+    DatabaseManager* getDatabaseManager() { return databaseManager.get(); }
+
+    storage::MemoryManager* getMemoryManager() { return memoryManager.get(); }
+
+    processor::QueryProcessor* getQueryProcessor() { return queryProcessor.get(); }
+
+    extension::ExtensionManager* getExtensionManager() { return extensionManager.get(); }
+
+    common::VirtualFileSystem* getVFS() { return vfs.get(); }
+
+private:
+    using construct_bm_func_t =
+        std::function<std::unique_ptr<storage::BufferManager>(const Database&)>;
+
+    struct QueryIDGenerator {
+        uint64_t queryID = 0;
+        std::mutex queryIDLock;
+    };
+
+    static std::unique_ptr<storage::BufferManager> initBufferManager(const Database& db);
+    void initMembers(std::string_view dbPath, construct_bm_func_t initBmFunc);
+
+    // factory method only to be used for tests
+    Database(std::string_view databasePath, SystemConfig systemConfig,
+        construct_bm_func_t constructBMFunc);
+
+    void validatePathInReadOnly() const;
+
+private:
+    std::string databasePath;
+    DBConfig dbConfig;
+    std::unique_ptr<common::VirtualFileSystem> vfs;
+    std::unique_ptr<storage::BufferManager> bufferManager;
+    std::unique_ptr<storage::MemoryManager> memoryManager;
+    std::unique_ptr<processor::QueryProcessor> queryProcessor;
+    std::unique_ptr<catalog::Catalog> catalog;
+    std::unique_ptr<storage::StorageManager> storageManager;
+    std::unique_ptr<transaction::TransactionManager> transactionManager;
+    std::unique_ptr<common::FileInfo> lockFile;
+    std::unique_ptr<DatabaseManager> databaseManager;
+    std::unique_ptr<extension::ExtensionManager> extensionManager;
+    QueryIDGenerator queryIDGenerator;
+    std::shared_ptr<common::DatabaseLifeCycleManager> dbLifeCycleManager;
+    std::vector<std::unique_ptr<extension::TransformerExtension>> transformerExtensions;
+    std::vector<std::unique_ptr<extension::BinderExtension>> binderExtensions;
+    std::vector<std::unique_ptr<extension::PlannerExtension>> plannerExtensions;
+    std::vector<std::unique_ptr<extension::MapperExtension>> mapperExtensions;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/database_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/database_manager.h
new file mode 100644
index 0000000000..98b728fa82
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/database_manager.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "attached_database.h"
+
+namespace lbug {
+namespace main {
+
+class DatabaseManager {
+public:
+    DatabaseManager();
+
+    void registerAttachedDatabase(std::unique_ptr<AttachedDatabase> attachedDatabase);
+    bool hasAttachedDatabase(const std::string& name);
+    LBUG_API AttachedDatabase* getAttachedDatabase(const std::string& name);
+    void detachDatabase(const std::string& databaseName);
+    std::string getDefaultDatabase() const { return defaultDatabase; }
+    bool hasDefaultDatabase() const { return defaultDatabase != ""; }
+    void setDefaultDatabase(const std::string& databaseName);
+    std::vector<AttachedDatabase*> getAttachedDatabases() const;
+    LBUG_API void invalidateCache();
+
+    LBUG_API static DatabaseManager* Get(const ClientContext& context);
+
+private:
+    std::vector<std::unique_ptr<AttachedDatabase>> attachedDatabases;
+    std::string defaultDatabase;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/db_config.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/db_config.h
new file mode 100644
index 0000000000..366c4b0c8b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/db_config.h
@@ -0,0 +1,80 @@
+#pragma once
+
+#include <string>
+
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace common {
+enum class LogicalTypeID : uint8_t;
+} // namespace common
+
+namespace main {
+
+class ClientContext;
+struct SystemConfig;
+
+typedef void (*set_context)(ClientContext* context, const common::Value& parameter);
+typedef common::Value (*get_setting)(const ClientContext* context);
+
+enum class OptionType : uint8_t { CONFIGURATION = 0, EXTENSION = 1 };
+
+struct Option {
+    std::string name;
+    common::LogicalTypeID parameterType;
+    OptionType optionType;
+    bool isConfidential;
+
+    Option(std::string name, common::LogicalTypeID parameterType, OptionType optionType,
+        bool isConfidential)
+        : name{std::move(name)}, parameterType{parameterType}, optionType{optionType},
+          isConfidential{isConfidential} {}
+
+    virtual ~Option() = default;
+};
+
+struct ConfigurationOption final : Option {
+    set_context setContext;
+    get_setting getSetting;
+
+    ConfigurationOption(std::string name, common::LogicalTypeID parameterType,
+        set_context setContext, get_setting getSetting)
+        : Option{std::move(name), parameterType, OptionType::CONFIGURATION,
+              false /* isConfidential */},
+          setContext{setContext}, getSetting{getSetting} {}
+};
+
+struct ExtensionOption final : Option {
+    common::Value defaultValue;
+
+    ExtensionOption(std::string name, common::LogicalTypeID parameterType,
+        common::Value defaultValue, bool isConfidential)
+        : Option{std::move(name), parameterType, OptionType::EXTENSION, isConfidential},
+          defaultValue{std::move(defaultValue)} {}
+};
+
+struct DBConfig {
+    uint64_t bufferPoolSize;
+    uint64_t maxNumThreads;
+    bool enableCompression;
+    bool readOnly;
+    uint64_t maxDBSize;
+    bool enableMultiWrites;
+    bool autoCheckpoint;
+    uint64_t checkpointThreshold;
+    bool forceCheckpointOnClose;
+    bool throwOnWalReplayFailure;
+    bool enableChecksums;
+    bool enableSpillingToDisk;
+#if defined(__APPLE__)
+    uint32_t threadQos;
+#endif
+
+    explicit DBConfig(const SystemConfig& systemConfig);
+
+    static ConfigurationOption* getOptionByName(const std::string& optionName);
+    LBUG_API static bool isDBPathInMemory(const std::string& dbPath);
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/lbug.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/lbug.h
new file mode 100644
index 0000000000..3b67c12e1c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/lbug.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "common/types/date_t.h"              // IWYU pragma: export
+#include "common/types/dtime_t.h"             // IWYU pragma: export
+#include "common/types/int128_t.h"            // IWYU pragma: export
+#include "common/types/interval_t.h"          // IWYU pragma: export
+#include "common/types/timestamp_t.h"         // IWYU pragma: export
+#include "common/types/types.h"               // IWYU pragma: export
+#include "common/types/value/nested.h"        // IWYU pragma: export
+#include "common/types/value/node.h"          // IWYU pragma: export
+#include "common/types/value/recursive_rel.h" // IWYU pragma: export
+#include "common/types/value/rel.h"           // IWYU pragma: export
+#include "common/types/value/value.h"         // IWYU pragma: export
+#include "main/connection.h"                  // IWYU pragma: export
+#include "main/database.h"                    // IWYU pragma: export
+#include "main/prepared_statement.h"          // IWYU pragma: export
+#include "main/query_result.h"                // IWYU pragma: export
+#include "main/query_summary.h"               // IWYU pragma: export
+#include "main/storage_driver.h"              // IWYU pragma: export
+#include "main/version.h"                     // IWYU pragma: export
+#include "processor/result/flat_tuple.h"      // IWYU pragma: export
+#include "storage/storage_version_info.h"     // IWYU pragma: export
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/lbug_fwd.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/lbug_fwd.h
new file mode 100644
index 0000000000..f366429dd9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/lbug_fwd.h
@@ -0,0 +1,62 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+
+namespace testing {
+class BaseGraphTest;
+class PrivateGraphTest;
+class TestHelper;
+class TestRunner;
+} // namespace testing
+
+namespace benchmark {
+class Benchmark;
+} // namespace benchmark
+
+namespace binder {
+class Expression;
+class BoundStatementResult;
+class PropertyExpression;
+} // namespace binder
+
+namespace catalog {
+class Catalog;
+} // namespace catalog
+
+namespace common {
+enum class StatementType : uint8_t;
+class Value;
+struct FileInfo;
+class VirtualFileSystem;
+} // namespace common
+
+namespace storage {
+class MemoryManager;
+class BufferManager;
+class StorageManager;
+class WAL;
+enum class WALReplayMode : uint8_t;
+} // namespace storage
+
+namespace planner {
+class LogicalOperator;
+class LogicalPlan;
+} // namespace planner
+
+namespace processor {
+class QueryProcessor;
+class FactorizedTable;
+class FlatTupleIterator;
+class PhysicalOperator;
+class PhysicalPlan;
+} // namespace processor
+
+namespace transaction {
+class Transaction;
+class TransactionManager;
+class TransactionContext;
+} // namespace transaction
+
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/plan_printer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/plan_printer.h
new file mode 100644
index 0000000000..cd39efb92e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/plan_printer.h
@@ -0,0 +1,120 @@
+#pragma once
+
+#include <sstream>
+#include <string>
+
+#include "common/assert.h"
+#include "common/profiler.h"
+#include "json_fwd.hpp"
+#include "lbug_fwd.h"
+
+namespace lbug {
+namespace main {
+
+class OpProfileBox {
+public:
+    OpProfileBox(std::string opName, const std::string& paramsName,
+        std::vector<std::string> attributes);
+
+    inline std::string getOpName() const { return opName; }
+
+    inline uint32_t getNumParams() const { return paramsNames.size(); }
+
+    std::string getParamsName(uint32_t idx) const;
+
+    std::string getAttribute(uint32_t idx) const;
+
+    inline uint32_t getNumAttributes() const { return attributes.size(); }
+
+    uint32_t getAttributeMaxLen() const;
+
+private:
+    std::string opName;
+    std::vector<std::string> paramsNames;
+    std::vector<std::string> attributes;
+};
+
+class OpProfileTree {
+public:
+    OpProfileTree(const processor::PhysicalOperator* op, common::Profiler& profiler);
+
+    explicit OpProfileTree(const planner::LogicalOperator* op);
+
+    std::ostringstream printPlanToOstream() const;
+
+    std::ostringstream printLogicalPlanToOstream() const;
+
+private:
+    static void calculateNumRowsAndColsForOp(const processor::PhysicalOperator* op,
+        uint32_t& numRows, uint32_t& numCols);
+
+    static void calculateNumRowsAndColsForOp(const planner::LogicalOperator* op, uint32_t& numRows,
+        uint32_t& numCols);
+
+    uint32_t fillOpProfileBoxes(const processor::PhysicalOperator* op, uint32_t rowIdx,
+        uint32_t colIdx, uint32_t& maxFieldWidth, common::Profiler& profiler);
+
+    uint32_t fillOpProfileBoxes(const planner::LogicalOperator* op, uint32_t rowIdx,
+        uint32_t colIdx, uint32_t& maxFieldWidth);
+
+    void printOpProfileBoxUpperFrame(uint32_t rowIdx, std::ostringstream& oss) const;
+
+    void printOpProfileBoxes(uint32_t rowIdx, std::ostringstream& oss) const;
+
+    void printOpProfileBoxLowerFrame(uint32_t rowIdx, std::ostringstream& oss) const;
+
+    void prettyPrintPlanTitle(std::ostringstream& oss, std::string title) const;
+
+    static std::string genHorizLine(uint32_t len);
+
+    inline void validateRowIdxAndColIdx(uint32_t rowIdx, uint32_t colIdx) const {
+        KU_ASSERT(rowIdx < opProfileBoxes.size() && colIdx < opProfileBoxes[rowIdx].size());
+        (void)rowIdx;
+        (void)colIdx;
+    }
+
+    void insertOpProfileBox(uint32_t rowIdx, uint32_t colIdx,
+        std::unique_ptr<OpProfileBox> opProfileBox);
+
+    OpProfileBox* getOpProfileBox(uint32_t rowIdx, uint32_t colIdx) const;
+
+    bool hasOpProfileBox(uint32_t rowIdx, uint32_t colIdx) const {
+        return rowIdx < opProfileBoxes.size() && colIdx < opProfileBoxes[rowIdx].size() &&
+               getOpProfileBox(rowIdx, colIdx);
+    }
+
+    //! Returns true if there is a valid OpProfileBox on the upper left side of the OpProfileBox
+    //! located at (rowIdx, colIdx).
+    bool hasOpProfileBoxOnUpperLeft(uint32_t rowIdx, uint32_t colIdx) const;
+
+    uint32_t calculateRowHeight(uint32_t rowIdx) const;
+
+private:
+    std::vector<std::vector<std::unique_ptr<OpProfileBox>>> opProfileBoxes;
+    uint32_t opProfileBoxWidth;
+    static constexpr uint32_t INDENT_WIDTH = 3u;
+    static constexpr uint32_t BOX_FRAME_WIDTH = 1u;
+    static constexpr uint32_t MIN_LOGICAL_BOX_WIDTH = 22u;
+};
+
+struct PlanPrinter {
+    static nlohmann::json printPlanToJson(const processor::PhysicalPlan* physicalPlan,
+        common::Profiler* profiler);
+    static std::ostringstream printPlanToOstream(const processor::PhysicalPlan* physicalPlan,
+        common::Profiler* profiler);
+    static std::string getOperatorName(const processor::PhysicalOperator* physicalOperator);
+    static std::string getOperatorParams(const processor::PhysicalOperator* physicalOperator);
+
+    static nlohmann::json printPlanToJson(const planner::LogicalPlan* logicalPlan);
+    static std::ostringstream printPlanToOstream(const planner::LogicalPlan* logicalPlan);
+    static std::string getOperatorName(const planner::LogicalOperator* logicalOperator);
+    static std::string getOperatorParams(const planner::LogicalOperator* logicalOperator);
+
+private:
+    static nlohmann::json toJson(const processor::PhysicalOperator* physicalOperator,
+        common::Profiler& profiler_);
+    static nlohmann::json toJson(const planner::LogicalOperator* logicalOperator);
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/prepared_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/prepared_statement.h
new file mode 100644
index 0000000000..d166ebc6b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/prepared_statement.h
@@ -0,0 +1,90 @@
+#pragma once
+
+#include <memory>
+#include <string>
+#include <unordered_map>
+#include <vector>
+
+#include "common/api.h"
+#include "common/types/value/value.h"
+#include "query_summary.h"
+
+namespace lbug {
+namespace common {
+class LogicalType;
+}
+namespace parser {
+class Statement;
+}
+namespace binder {
+class Expression;
+}
+namespace planner {
+class LogicalPlan;
+}
+
+namespace main {
+
+// Prepared statement cached in client context and NEVER serialized to client side.
+struct CachedPreparedStatement {
+    bool useInternalCatalogEntry = false;
+    std::shared_ptr<parser::Statement> parsedStatement;
+    std::unique_ptr<planner::LogicalPlan> logicalPlan;
+    std::vector<std::shared_ptr<binder::Expression>> columns;
+
+    CachedPreparedStatement();
+    ~CachedPreparedStatement();
+
+    std::vector<std::string> getColumnNames() const;
+    std::vector<common::LogicalType> getColumnTypes() const;
+};
+
+/**
+ * @brief A prepared statement is a parameterized query which can avoid planning the same query for
+ * repeated execution.
+ */
+class PreparedStatement {
+    friend class Connection;
+    friend class ClientContext;
+
+public:
+    LBUG_API ~PreparedStatement();
+    /**
+     * @return the query is prepared successfully or not.
+     */
+    LBUG_API bool isSuccess() const;
+    /**
+     * @return the error message if the query is not prepared successfully.
+     */
+    LBUG_API std::string getErrorMessage() const;
+    /**
+     * @return the prepared statement is read-only or not.
+     */
+    LBUG_API bool isReadOnly() const;
+
+    const std::unordered_set<std::string>& getUnknownParameters() const {
+        return unknownParameters;
+    }
+    std::unordered_set<std::string> getKnownParameters();
+    void updateParameter(const std::string& name, common::Value* value);
+    void addParameter(const std::string& name, common::Value* value);
+
+    std::string getName() const { return cachedPreparedStatementName; }
+
+    common::StatementType getStatementType() const;
+
+    static std::unique_ptr<PreparedStatement> getPreparedStatementWithError(
+        const std::string& errorMessage);
+
+private:
+    bool success = true;
+    bool readOnly = true;
+    std::string errMsg;
+    PreparedSummary preparedSummary;
+    std::string cachedPreparedStatementName;
+    std::unordered_set<std::string> unknownParameters;
+    std::unordered_map<std::string, std::shared_ptr<common::Value>> parameterMap;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/prepared_statement_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/prepared_statement_manager.h
new file mode 100644
index 0000000000..30f3149694
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/prepared_statement_manager.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include <memory>
+#include <mutex>
+#include <unordered_map>
+
+namespace lbug {
+namespace main {
+
+struct CachedPreparedStatement;
+
+class CachedPreparedStatementManager {
+public:
+    CachedPreparedStatementManager();
+    ~CachedPreparedStatementManager();
+
+    std::string addStatement(std::unique_ptr<CachedPreparedStatement> statement);
+
+    bool containsStatement(const std::string& name) const { return statementMap.contains(name); }
+
+    CachedPreparedStatement* getCachedStatement(const std::string& name) const;
+
+private:
+    std::mutex mtx;
+    uint32_t currentIdx = 0;
+    std::unordered_map<std::string, std::unique_ptr<CachedPreparedStatement>> statementMap;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_result.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_result.h
new file mode 100644
index 0000000000..5c6ddef465
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_result.h
@@ -0,0 +1,194 @@
+#pragma once
+
+#include <string>
+
+#include "common/api.h"
+#include "common/arrow/arrow.h"
+#include "common/database_lifecycle_manager.h"
+#include "common/types/types.h"
+#include "query_summary.h"
+
+namespace lbug {
+namespace processor {
+class FlatTuple;
+}
+namespace main {
+
+enum class QueryResultType {
+    FTABLE = 0,
+    ARROW = 1,
+};
+
+/**
+ * @brief QueryResult stores the result of a query execution.
+ */
+class QueryResult {
+public:
+    /**
+     * @brief Used to create a QueryResult object for the failing query.
+     */
+    LBUG_API QueryResult();
+    explicit QueryResult(QueryResultType type);
+    QueryResult(QueryResultType type, std::vector<std::string> columnNames,
+        std::vector<common::LogicalType> columnTypes);
+
+    /**
+     * @brief Deconstructs the QueryResult object.
+     */
+    LBUG_API virtual ~QueryResult() = 0;
+    /**
+     * @return if the query is executed successfully or not.
+     */
+    LBUG_API bool isSuccess() const;
+    /**
+     * @return error message of the query execution if the query fails.
+     */
+    LBUG_API std::string getErrorMessage() const;
+    /**
+     * @return number of columns in query result.
+     */
+    LBUG_API size_t getNumColumns() const;
+    /**
+     * @return name of each column in the query result.
+     */
+    LBUG_API std::vector<std::string> getColumnNames() const;
+    /**
+     * @return dataType of each column in the query result.
+     */
+    LBUG_API std::vector<common::LogicalType> getColumnDataTypes() const;
+    /**
+     * @return query summary which stores the execution time, compiling time, plan and query
+     * options.
+     */
+    LBUG_API QuerySummary* getQuerySummary() const;
+    QuerySummary* getQuerySummaryUnsafe();
+    /**
+     * @return whether there are more query results to read.
+     */
+    LBUG_API bool hasNextQueryResult() const;
+    /**
+     * @return get the next query result to read (for multiple query statements).
+     */
+    LBUG_API QueryResult* getNextQueryResult();
+    /**
+     * @return num of tuples in query result.
+     */
+    LBUG_API virtual uint64_t getNumTuples() const = 0;
+    /**
+     * @return whether there are more tuples to read.
+     */
+    LBUG_API virtual bool hasNext() const = 0;
+    /**
+     * @return next flat tuple in the query result. Note that to reduce resource allocation, all
+     * calls to getNext() reuse the same FlatTuple object. Since its contents will be overwritten,
+     * please complete processing a FlatTuple or make a copy of its data before calling getNext()
+     * again.
+     */
+    LBUG_API virtual std::shared_ptr<processor::FlatTuple> getNext() = 0;
+    /**
+     * @brief Resets the result tuple iterator.
+     */
+    LBUG_API virtual void resetIterator() = 0;
+    /**
+     * @return string of first query result.
+     */
+    LBUG_API virtual std::string toString() const = 0;
+    /**
+     * @brief Returns the arrow schema of the query result.
+     * @return datatypes of the columns as an arrow schema
+     *
+     * It is the caller's responsibility to call the release function to release the underlying data
+     * If converting to another arrow type, this is usually handled automatically.
+     */
+    LBUG_API std::unique_ptr<ArrowSchema> getArrowSchema() const;
+    /**
+     * @return whether there are more arrow chunk to read.
+     */
+    LBUG_API virtual bool hasNextArrowChunk() = 0;
+    /**
+     * @brief Returns the next chunk of the query result as an arrow array.
+     * @param chunkSize number of tuples to return in the chunk.
+     * @return An arrow array representation of the next chunkSize tuples of the query result.
+     *
+     * The ArrowArray internally stores an arrow struct with fields for each of the columns.
+     * This can be converted to a RecordBatch with arrow's ImportRecordBatch function
+     *
+     * It is the caller's responsibility to call the release function to release the underlying data
+     * If converting to another arrow type, this is usually handled automatically.
+     */
+    LBUG_API virtual std::unique_ptr<ArrowArray> getNextArrowChunk(int64_t chunkSize) = 0;
+
+    QueryResultType getType() const { return type; }
+
+    void setColumnNames(std::vector<std::string> columnNames);
+    void setColumnTypes(std::vector<common::LogicalType> columnTypes);
+
+    void addNextResult(std::unique_ptr<QueryResult> next_);
+    std::unique_ptr<QueryResult> moveNextResult();
+
+    void setQuerySummary(std::unique_ptr<QuerySummary> summary);
+
+    void setDBLifeCycleManager(
+        std::shared_ptr<common::DatabaseLifeCycleManager> dbLifeCycleManager);
+
+    static std::unique_ptr<QueryResult> getQueryResultWithError(const std::string& errorMessage);
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+protected:
+    void validateQuerySucceed() const;
+    void checkDatabaseClosedOrThrow() const;
+
+protected:
+    class QueryResultIterator {
+    public:
+        QueryResultIterator() = default;
+
+        explicit QueryResultIterator(QueryResult* startResult) : current(startResult) {}
+
+        void operator++() {
+            if (current) {
+                current = current->nextQueryResult.get();
+            }
+        }
+
+        bool isEnd() const { return current == nullptr; }
+
+        bool hasNextQueryResult() const { return current->nextQueryResult != nullptr; }
+
+        QueryResult* getCurrentResult() const { return current; }
+
+    private:
+        QueryResult* current;
+    };
+
+    QueryResultType type;
+
+    bool success = true;
+
+    std::string errMsg;
+
+    std::vector<std::string> columnNames;
+
+    std::vector<common::LogicalType> columnTypes;
+
+    std::shared_ptr<processor::FlatTuple> tuple;
+
+    std::unique_ptr<QuerySummary> querySummary;
+
+    std::unique_ptr<QueryResult> nextQueryResult;
+
+    QueryResultIterator queryResultIterator;
+
+    std::shared_ptr<common::DatabaseLifeCycleManager> dbLifeCycleManager;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_result/arrow_query_result.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_result/arrow_query_result.h
new file mode 100644
index 0000000000..0f63fec48a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_result/arrow_query_result.h
@@ -0,0 +1,43 @@
+#pragma once
+
+#include "main/query_result.h"
+#include "materialized_query_result.h"
+
+namespace lbug {
+namespace main {
+
+class ArrowQueryResult : public QueryResult {
+    static constexpr QueryResultType type_ = QueryResultType::ARROW;
+
+public:
+    ArrowQueryResult(std::vector<ArrowArray> arrays, int64_t chunkSize);
+    ArrowQueryResult(std::vector<std::string> columnNames,
+        std::vector<common::LogicalType> columnTypes, processor::FactorizedTable& table,
+        int64_t chunkSize);
+
+    uint64_t getNumTuples() const override;
+
+    bool hasNext() const override;
+
+    std::shared_ptr<processor::FlatTuple> getNext() override;
+
+    void resetIterator() override;
+
+    std::string toString() const override;
+
+    bool hasNextArrowChunk() override;
+
+    std::unique_ptr<ArrowArray> getNextArrowChunk(int64_t chunkSize) override;
+
+private:
+    ArrowArray getArray(processor::FactorizedTableIterator& iterator, int64_t chunkSize);
+
+private:
+    std::vector<ArrowArray> arrays;
+    int64_t chunkSize_;
+    uint64_t numTuples = 0;
+    uint64_t cursor = 0;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_result/materialized_query_result.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_result/materialized_query_result.h
new file mode 100644
index 0000000000..122c3cd12c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_result/materialized_query_result.h
@@ -0,0 +1,46 @@
+#pragma once
+
+#include "main/query_result.h"
+
+namespace lbug {
+namespace processor {
+class FactorizedTable;
+class FactorizedTableIterator;
+} // namespace processor
+
+namespace main {
+
+class MaterializedQueryResult : public QueryResult {
+    static constexpr QueryResultType type_ = QueryResultType::FTABLE;
+
+public:
+    MaterializedQueryResult();
+    LBUG_API explicit MaterializedQueryResult(std::shared_ptr<processor::FactorizedTable> table);
+    MaterializedQueryResult(std::vector<std::string> columnNames,
+        std::vector<common::LogicalType> columnTypes,
+        std::shared_ptr<processor::FactorizedTable> table);
+    ~MaterializedQueryResult() override;
+
+    uint64_t getNumTuples() const override;
+
+    bool hasNext() const override;
+
+    std::shared_ptr<processor::FlatTuple> getNext() override;
+
+    void resetIterator() override;
+
+    std::string toString() const override;
+
+    bool hasNextArrowChunk() override;
+
+    std::unique_ptr<ArrowArray> getNextArrowChunk(int64_t chunkSize) override;
+
+    const processor::FactorizedTable& getFactorizedTable() const { return *table; }
+
+private:
+    std::shared_ptr<processor::FactorizedTable> table;
+    std::unique_ptr<processor::FactorizedTableIterator> iterator;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_summary.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_summary.h
new file mode 100644
index 0000000000..bdf51d214e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/query_summary.h
@@ -0,0 +1,62 @@
+#pragma once
+
+#include <cstdint>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace common {
+enum class StatementType : uint8_t;
+}
+
+namespace main {
+
+/**
+ * @brief PreparedSummary stores the compiling time and query options of a query.
+ */
+struct PreparedSummary { // NOLINT(*-pro-type-member-init)
+    double compilingTime = 0;
+    common::StatementType statementType;
+};
+
+/**
+ * @brief QuerySummary stores the execution time, plan, compiling time and query options of a query.
+ */
+class QuerySummary {
+
+public:
+    QuerySummary() = default;
+    explicit QuerySummary(const PreparedSummary& preparedSummary)
+        : preparedSummary{preparedSummary} {}
+    /**
+     * @return query compiling time in milliseconds.
+     */
+    LBUG_API double getCompilingTime() const;
+    /**
+     * @return query execution time in milliseconds.
+     */
+    LBUG_API double getExecutionTime() const;
+
+    void setExecutionTime(double time);
+
+    void incrementCompilingTime(double increment);
+
+    void incrementExecutionTime(double increment);
+
+    /**
+     * @return true if the query is executed with EXPLAIN.
+     */
+    bool isExplain() const;
+
+    /**
+     * @return the statement type of the query.
+     */
+    common::StatementType getStatementType() const;
+
+private:
+    double executionTime = 0;
+    PreparedSummary preparedSummary;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/settings.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/settings.h
new file mode 100644
index 0000000000..46a30ac4b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/settings.h
@@ -0,0 +1,149 @@
+#pragma once
+
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace main {
+
+struct ThreadsSetting {
+    static constexpr auto name = "threads";
+    static constexpr auto inputType = common::LogicalTypeID::UINT64;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct WarningLimitSetting {
+    static constexpr auto name = "warning_limit";
+    static constexpr auto inputType = common::LogicalTypeID::UINT64;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct TimeoutSetting {
+    static constexpr auto name = "timeout";
+    static constexpr auto inputType = common::LogicalTypeID::UINT64;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct ProgressBarSetting {
+    static constexpr auto name = "progress_bar";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct VarLengthExtendMaxDepthSetting {
+    static constexpr auto name = "var_length_extend_max_depth";
+    static constexpr auto inputType = common::LogicalTypeID::INT64;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct SparseFrontierThresholdSetting {
+    static constexpr auto name = "sparse_frontier_threshold";
+    static constexpr auto inputType = common::LogicalTypeID::INT64;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct EnableSemiMaskSetting {
+    static constexpr auto name = "enable_semi_mask";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct DisableMapKeyCheck {
+    static constexpr auto name = "disable_map_key_check";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct EnableZoneMapSetting {
+    static constexpr auto name = "enable_zone_map";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct HomeDirectorySetting {
+    static constexpr auto name = "home_directory";
+    static constexpr auto inputType = common::LogicalTypeID::STRING;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct FileSearchPathSetting {
+    static constexpr auto name = "file_search_path";
+    static constexpr auto inputType = common::LogicalTypeID::STRING;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct RecursivePatternSemanticSetting {
+    static constexpr auto name = "recursive_pattern_semantic";
+    static constexpr auto inputType = common::LogicalTypeID::STRING;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct RecursivePatternFactorSetting {
+    static constexpr auto name = "recursive_pattern_factor";
+    static constexpr auto inputType = common::LogicalTypeID::INT64;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct EnableMVCCSetting {
+    static constexpr auto name = "debug_enable_multi_writes";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct CheckpointThresholdSetting {
+    static constexpr auto name = "checkpoint_threshold";
+    static constexpr auto inputType = common::LogicalTypeID::INT64;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct AutoCheckpointSetting {
+    static constexpr auto name = "auto_checkpoint";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct ForceCheckpointClosingDBSetting {
+    static constexpr auto name = "force_checkpoint_on_close";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct SpillToDiskSetting {
+    static constexpr auto name = "spill_to_disk";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct EnableOptimizerSetting {
+    static constexpr auto name = "enable_plan_optimizer";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+struct EnableInternalCatalogSetting {
+    static constexpr auto name = "enable_internal_catalog";
+    static constexpr auto inputType = common::LogicalTypeID::BOOL;
+    static void setContext(ClientContext* context, const common::Value& parameter);
+    static common::Value getSetting(const ClientContext* context);
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/storage_driver.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/storage_driver.h
new file mode 100644
index 0000000000..cd4cbc9409
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/storage_driver.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include "database.h"
+
+namespace lbug {
+namespace storage {
+class Table;
+}
+
+namespace main {
+
+class ClientContext;
+class LBUG_API StorageDriver {
+public:
+    explicit StorageDriver(Database* database);
+
+    ~StorageDriver();
+
+    void scan(const std::string& nodeName, const std::string& propertyName,
+        common::offset_t* offsets, size_t numOffsets, uint8_t* result, size_t numThreads);
+
+    // TODO: Should merge following two functions into a single one.
+    uint64_t getNumNodes(const std::string& nodeName) const;
+    uint64_t getNumRels(const std::string& relName) const;
+
+private:
+    void scanColumn(storage::Table* table, common::column_id_t columnID,
+        const common::offset_t* offsets, size_t size, uint8_t* result) const;
+
+private:
+    std::unique_ptr<ClientContext> clientContext;
+};
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/version.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/version.h
new file mode 100644
index 0000000000..6b16c21dc7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/main/version.h
@@ -0,0 +1,23 @@
+#pragma once
+#include <cstdint>
+
+#include "common/api.h"
+namespace lbug {
+namespace main {
+
+struct Version {
+public:
+    /**
+     * @brief Get the version of the Lbug library.
+     * @return const char* The version of the Lbug library.
+     */
+    LBUG_API static const char* getVersion();
+
+    /**
+     * @brief Get the storage version of the Lbug library.
+     * @return uint64_t The storage version of the Lbug library.
+     */
+    LBUG_API static uint64_t getStorageVersion();
+};
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/acc_hash_join_optimizer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/acc_hash_join_optimizer.h
new file mode 100644
index 0000000000..c408a59fb3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/acc_hash_join_optimizer.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "logical_operator_visitor.h"
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace optimizer {
+
+// This optimizer enables the Accumulated hash join algorithm as introduced in paper "Lbug Graph
+// Database Management System".
+class HashJoinSIPOptimizer final : public LogicalOperatorVisitor {
+public:
+    void rewrite(const planner::LogicalPlan* plan);
+
+private:
+    void visitOperator(planner::LogicalOperator* op);
+
+    void visitHashJoin(planner::LogicalOperator* op) override;
+
+    void visitIntersect(planner::LogicalOperator* op) override;
+
+    void visitPathPropertyProbe(planner::LogicalOperator* op) override;
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/agg_key_dependency_optimizer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/agg_key_dependency_optimizer.h
new file mode 100644
index 0000000000..211484c495
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/agg_key_dependency_optimizer.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "logical_operator_visitor.h"
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace optimizer {
+
+// This optimizer analyzes the dependency between group by keys. If key2 depends on key1 (e.g. key1
+// is a primary key column) we only hash on key1 and saves key2 as a payload.
+class AggKeyDependencyOptimizer : public LogicalOperatorVisitor {
+public:
+    void rewrite(planner::LogicalPlan* plan);
+
+private:
+    void visitOperator(planner::LogicalOperator* op);
+
+    void visitAggregate(planner::LogicalOperator* op) override;
+    void visitDistinct(planner::LogicalOperator* op) override;
+
+    std::pair<binder::expression_vector, binder::expression_vector> resolveKeysAndDependentKeys(
+        const binder::expression_vector& keys);
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/cardinality_updater.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/cardinality_updater.h
new file mode 100644
index 0000000000..ac79b0eb07
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/cardinality_updater.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include "optimizer/logical_operator_visitor.h"
+namespace lbug {
+namespace planner {
+class LogicalPlan;
+class CardinalityEstimator;
+} // namespace planner
+
+namespace transaction {
+class Transaction;
+}
+
+namespace optimizer {
+class CardinalityUpdater : public LogicalOperatorVisitor {
+public:
+    explicit CardinalityUpdater(const planner::CardinalityEstimator& cardinalityEstimator,
+        const transaction::Transaction* transaction)
+        : cardinalityEstimator(cardinalityEstimator), transaction(transaction) {}
+
+    void rewrite(planner::LogicalPlan* plan);
+
+private:
+    void visitOperator(planner::LogicalOperator* op);
+    void visitOperatorSwitchWithDefault(planner::LogicalOperator* op);
+
+    void visitOperatorDefault(planner::LogicalOperator* op);
+    void visitScanNodeTable(planner::LogicalOperator* op) override;
+    void visitExtend(planner::LogicalOperator* op) override;
+    void visitHashJoin(planner::LogicalOperator* op) override;
+    void visitCrossProduct(planner::LogicalOperator* op) override;
+    void visitIntersect(planner::LogicalOperator* op) override;
+    void visitFlatten(planner::LogicalOperator* op) override;
+    void visitFilter(planner::LogicalOperator* op) override;
+    void visitAggregate(planner::LogicalOperator* op) override;
+    void visitLimit(planner::LogicalOperator* op) override;
+
+    const planner::CardinalityEstimator& cardinalityEstimator;
+    const transaction::Transaction* transaction;
+};
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/correlated_subquery_unnest_solver.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/correlated_subquery_unnest_solver.h
new file mode 100644
index 0000000000..e2fd1b4e5f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/correlated_subquery_unnest_solver.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "logical_operator_visitor.h"
+
+namespace lbug {
+namespace optimizer {
+
+class CorrelatedSubqueryUnnestSolver : public LogicalOperatorVisitor {
+public:
+    explicit CorrelatedSubqueryUnnestSolver(planner::LogicalOperator* accumulateOp)
+        : accumulateOp{accumulateOp} {}
+    void solve(planner::LogicalOperator* root_);
+
+private:
+    void visitOperator(planner::LogicalOperator* op);
+    void visitExpressionsScan(planner::LogicalOperator* op) final;
+
+    void solveAccHashJoin(planner::LogicalOperator* op) const;
+
+private:
+    planner::LogicalOperator* accumulateOp;
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/factorization_rewriter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/factorization_rewriter.h
new file mode 100644
index 0000000000..9af07fe1de
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/factorization_rewriter.h
@@ -0,0 +1,41 @@
+#pragma once
+
+#include "logical_operator_visitor.h"
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace optimizer {
+
+class FactorizationRewriter final : public LogicalOperatorVisitor {
+public:
+    void rewrite(planner::LogicalPlan* plan);
+
+    void visitOperator(planner::LogicalOperator* op);
+
+private:
+    void visitHashJoin(planner::LogicalOperator* op) override;
+    void visitIntersect(planner::LogicalOperator* op) override;
+    void visitProjection(planner::LogicalOperator* op) override;
+    void visitAccumulate(planner::LogicalOperator* op) override;
+    void visitAggregate(planner::LogicalOperator* op) override;
+    void visitOrderBy(planner::LogicalOperator* op) override;
+    void visitLimit(planner::LogicalOperator* op) override;
+    void visitDistinct(planner::LogicalOperator* op) override;
+    void visitUnwind(planner::LogicalOperator* op) override;
+    void visitUnion(planner::LogicalOperator* op) override;
+    void visitFilter(planner::LogicalOperator* op) override;
+    void visitSetProperty(planner::LogicalOperator* op) override;
+    void visitDelete(planner::LogicalOperator* op) override;
+    void visitInsert(planner::LogicalOperator* op) override;
+    void visitMerge(planner::LogicalOperator* op) override;
+    void visitCopyTo(planner::LogicalOperator* op) override;
+
+    std::shared_ptr<planner::LogicalOperator> appendFlattens(
+        std::shared_ptr<planner::LogicalOperator> op,
+        const std::unordered_set<planner::f_group_pos>& groupsPos);
+    std::shared_ptr<planner::LogicalOperator> appendFlattenIfNecessary(
+        std::shared_ptr<planner::LogicalOperator> op, planner::f_group_pos groupPos);
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/filter_push_down_optimizer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/filter_push_down_optimizer.h
new file mode 100644
index 0000000000..98b69f4b87
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/filter_push_down_optimizer.h
@@ -0,0 +1,93 @@
+#pragma once
+
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace optimizer {
+
+struct PredicateSet {
+    binder::expression_vector equalityPredicates;
+    binder::expression_vector nonEqualityPredicates;
+
+    PredicateSet() = default;
+    EXPLICIT_COPY_DEFAULT_MOVE(PredicateSet);
+
+    bool isEmpty() const { return equalityPredicates.empty() && nonEqualityPredicates.empty(); }
+    void clear() {
+        equalityPredicates.clear();
+        nonEqualityPredicates.clear();
+    }
+
+    void addPredicate(std::shared_ptr<binder::Expression> predicate);
+    std::shared_ptr<binder::Expression> popNodePKEqualityComparison(
+        const binder::Expression& nodeID);
+    binder::expression_vector getAllPredicates();
+
+private:
+    PredicateSet(const PredicateSet& other)
+        : equalityPredicates{other.equalityPredicates},
+          nonEqualityPredicates{other.nonEqualityPredicates} {}
+};
+
+class FilterPushDownOptimizer {
+public:
+    explicit FilterPushDownOptimizer(main::ClientContext* context) : context{context} {
+        predicateSet = PredicateSet();
+    }
+    explicit FilterPushDownOptimizer(main::ClientContext* context, PredicateSet predicateSet)
+        : predicateSet{std::move(predicateSet)}, context{context} {}
+
+    void rewrite(planner::LogicalPlan* plan);
+
+private:
+    std::shared_ptr<planner::LogicalOperator> visitOperator(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+    // Collect predicates in FILTER
+    std::shared_ptr<planner::LogicalOperator> visitFilterReplace(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+    // Push primary key lookup into CROSS_PRODUCT
+    // E.g.
+    //      Filter(a.ID=b.ID)
+    //      CrossProduct                   to                  HashJoin
+    //   S(a)           S(b)                            S(a)             S(b)
+    std::shared_ptr<planner::LogicalOperator> visitCrossProductReplace(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+
+    // Push FILTER into SCAN_NODE_TABLE, and turn index lookup into INDEX_SCAN.
+    std::shared_ptr<planner::LogicalOperator> visitScanNodeTableReplace(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+    // Push Filter into EXTEND.
+    std::shared_ptr<planner::LogicalOperator> visitExtendReplace(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+    // Push Filter into TABLE_FUNCTION_CALL
+    std::shared_ptr<planner::LogicalOperator> visitTableFunctionCallReplace(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+
+    // Finish the current push down optimization by apply remaining predicates as a single filter.
+    // And heuristically reorder equality predicates first in the filter.
+    std::shared_ptr<planner::LogicalOperator> finishPushDown(
+        std::shared_ptr<planner::LogicalOperator> op);
+    std::shared_ptr<planner::LogicalOperator> appendFilters(
+        const binder::expression_vector& predicates,
+        std::shared_ptr<planner::LogicalOperator> child);
+
+    std::shared_ptr<planner::LogicalOperator> appendScanNodeTable(
+        std::shared_ptr<binder::Expression> nodeID, std::vector<common::table_id_t> nodeTableIDs,
+        binder::expression_vector properties, std::shared_ptr<planner::LogicalOperator> child);
+    std::shared_ptr<planner::LogicalOperator> appendFilter(
+        std::shared_ptr<binder::Expression> predicate,
+        std::shared_ptr<planner::LogicalOperator> child);
+
+    std::shared_ptr<planner::LogicalOperator> visitChildren(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+
+private:
+    PredicateSet predicateSet;
+    main::ClientContext* context;
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/limit_push_down_optimizer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/limit_push_down_optimizer.h
new file mode 100644
index 0000000000..64d7b9e7be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/limit_push_down_optimizer.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace optimizer {
+
+class LimitPushDownOptimizer {
+public:
+    LimitPushDownOptimizer() : skipNumber{0}, limitNumber{common::INVALID_LIMIT} {}
+
+    void rewrite(planner::LogicalPlan* plan);
+
+private:
+    void visitOperator(planner::LogicalOperator* op);
+
+private:
+    common::offset_t skipNumber;
+    common::offset_t limitNumber;
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/logical_operator_collector.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/logical_operator_collector.h
new file mode 100644
index 0000000000..610a74a041
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/logical_operator_collector.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include "logical_operator_visitor.h"
+
+namespace lbug {
+namespace optimizer {
+
+class LogicalOperatorCollector : public LogicalOperatorVisitor {
+public:
+    ~LogicalOperatorCollector() override = default;
+
+    void collect(planner::LogicalOperator* op);
+
+    bool hasOperators() const { return !ops.empty(); }
+    const std::vector<planner::LogicalOperator*>& getOperators() const { return ops; }
+
+protected:
+    std::vector<planner::LogicalOperator*> ops;
+};
+
+class LogicalFlattenCollector final : public LogicalOperatorCollector {
+protected:
+    void visitFlatten(planner::LogicalOperator* op) override { ops.push_back(op); }
+};
+
+class LogicalFilterCollector final : public LogicalOperatorCollector {
+protected:
+    void visitFilter(planner::LogicalOperator* op) override { ops.push_back(op); }
+};
+
+class LogicalScanNodeTableCollector final : public LogicalOperatorCollector {
+protected:
+    void visitScanNodeTable(planner::LogicalOperator* op) override { ops.push_back(op); }
+};
+
+// TODO(Xiyang): Rename me.
+class LogicalIndexScanNodeCollector final : public LogicalOperatorCollector {
+protected:
+    void visitScanNodeTable(planner::LogicalOperator* op) override;
+};
+
+class LogicalRecursiveExtendCollector final : public LogicalOperatorCollector {
+protected:
+    void visitRecursiveExtend(planner::LogicalOperator* op) override { ops.push_back(op); }
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/logical_operator_visitor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/logical_operator_visitor.h
new file mode 100644
index 0000000000..355f147c6b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/logical_operator_visitor.h
@@ -0,0 +1,182 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace optimizer {
+
+class LogicalOperatorVisitor {
+public:
+    LogicalOperatorVisitor() = default;
+    virtual ~LogicalOperatorVisitor() = default;
+
+protected:
+    void visitOperatorSwitch(planner::LogicalOperator* op);
+    std::shared_ptr<planner::LogicalOperator> visitOperatorReplaceSwitch(
+        std::shared_ptr<planner::LogicalOperator> op);
+
+    virtual void visitAccumulate(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitAccumulateReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitAggregate(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitAggregateReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitCopyFrom(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitCopyFromReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitCopyTo(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitCopyToReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitDelete(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitDeleteReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitDistinct(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitDistinctReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitEmptyResult(planner::LogicalOperator*) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitEmptyResultReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitExpressionsScan(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitExpressionsScanReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitExtend(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitExtendReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitFilter(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitFilterReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitFlatten(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitFlattenReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitHashJoin(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitHashJoinReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitIntersect(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitIntersectReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitInsert(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitInsertReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitLimit(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitLimitReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitMerge(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitMergeReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitNodeLabelFilter(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitNodeLabelFilterReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitOrderBy(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitOrderByReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitPathPropertyProbe(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitPathPropertyProbeReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitProjection(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitProjectionReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitRecursiveExtend(planner::LogicalOperator*) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitRecursiveExtendReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitScanNodeTable(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitScanNodeTableReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitSetProperty(planner::LogicalOperator*) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitSetPropertyReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitTableFunctionCall(planner::LogicalOperator*) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitTableFunctionCallReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitUnion(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitUnionReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitUnwind(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitUnwindReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+
+    virtual void visitCrossProduct(planner::LogicalOperator* /*op*/) {}
+    virtual std::shared_ptr<planner::LogicalOperator> visitCrossProductReplace(
+        std::shared_ptr<planner::LogicalOperator> op) {
+        return op;
+    }
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/optimizer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/optimizer.h
new file mode 100644
index 0000000000..967f32102f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/optimizer.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+
+namespace planner {
+class CardinalityEstimator;
+}
+
+namespace optimizer {
+
+class Optimizer {
+public:
+    static void optimize(planner::LogicalPlan* plan, main::ClientContext* context,
+        const planner::CardinalityEstimator& cardinalityEstimator);
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/projection_push_down_optimizer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/projection_push_down_optimizer.h
new file mode 100644
index 0000000000..4a33d9ebe6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/projection_push_down_optimizer.h
@@ -0,0 +1,68 @@
+#pragma once
+
+#include "common/enums/path_semantic.h"
+#include "logical_operator_visitor.h"
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace binder {
+struct BoundSetPropertyInfo;
+}
+namespace planner {
+struct LogicalInsertInfo;
+}
+namespace optimizer {
+
+// ProjectionPushDownOptimizer implements the logic to avoid materializing unnecessary properties
+// for hash join build.
+// Note the optimization is for properties & variables only but not for general expressions. This is
+// because it's hard to figure out what expression is in-use, e.g. COUNT(a.age) + 1, it could be
+// either the whole expression was evaluated in a WITH clause or only COUNT(a.age) was evaluated or
+// only a.age is evaluate. For simplicity, we only consider the push down for property.
+class ProjectionPushDownOptimizer : public LogicalOperatorVisitor {
+public:
+    void rewrite(planner::LogicalPlan* plan);
+    explicit ProjectionPushDownOptimizer(common::PathSemantic semantic) : semantic(semantic){};
+
+private:
+    void visitOperator(planner::LogicalOperator* op);
+
+    void visitPathPropertyProbe(planner::LogicalOperator* op) override;
+    void visitExtend(planner::LogicalOperator* op) override;
+    void visitAccumulate(planner::LogicalOperator* op) override;
+    void visitFilter(planner::LogicalOperator* op) override;
+    void visitNodeLabelFilter(planner::LogicalOperator* op) override;
+    void visitHashJoin(planner::LogicalOperator* op) override;
+    void visitIntersect(planner::LogicalOperator* op) override;
+    void visitProjection(planner::LogicalOperator* op) override;
+    void visitOrderBy(planner::LogicalOperator* op) override;
+    void visitUnwind(planner::LogicalOperator* op) override;
+    void visitSetProperty(planner::LogicalOperator* op) override;
+    void visitInsert(planner::LogicalOperator* op) override;
+    void visitDelete(planner::LogicalOperator* op) override;
+    void visitMerge(planner::LogicalOperator* op) override;
+    void visitCopyFrom(planner::LogicalOperator* op) override;
+    void visitTableFunctionCall(planner::LogicalOperator*) override;
+
+    void visitSetInfo(const binder::BoundSetPropertyInfo& info);
+    void visitInsertInfo(const planner::LogicalInsertInfo& info);
+
+    void collectExpressionsInUse(std::shared_ptr<binder::Expression> expression);
+
+    binder::expression_vector pruneExpressions(const binder::expression_vector& expressions);
+
+    void preAppendProjection(planner::LogicalOperator* op, common::idx_t childIdx,
+        binder::expression_vector expressions);
+
+private:
+    binder::expression_set propertiesInUse;
+    binder::expression_set variablesInUse;
+    binder::expression_set nodeOrRelInUse;
+    common::PathSemantic semantic;
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/remove_factorization_rewriter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/remove_factorization_rewriter.h
new file mode 100644
index 0000000000..2bd51e8426
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/remove_factorization_rewriter.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "logical_operator_visitor.h"
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace optimizer {
+
+class RemoveFactorizationRewriter : public LogicalOperatorVisitor {
+public:
+    void rewrite(planner::LogicalPlan* plan);
+
+    std::shared_ptr<planner::LogicalOperator> visitOperator(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+
+private:
+    std::shared_ptr<planner::LogicalOperator> visitFlattenReplace(
+        std::shared_ptr<planner::LogicalOperator> op) override;
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/remove_unnecessary_join_optimizer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/remove_unnecessary_join_optimizer.h
new file mode 100644
index 0000000000..25509ef882
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/remove_unnecessary_join_optimizer.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "logical_operator_visitor.h"
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace optimizer {
+
+/* Due to the nature of graph pattern, a (node)-[rel]-(node) is always interpreted as two joins.
+ * However, in many cases, a single join is sufficient.
+ * E.g. MATCH (a)-[e]->(b) RETURN e.date
+ * Our planner will generate a plan where the HJ is redundant.
+ *      HJ
+ *     /  \
+ *   E(e) S(b)
+ *    |
+ *   S(a)
+ * This optimizer prunes such redundant joins.
+ */
+class RemoveUnnecessaryJoinOptimizer : public LogicalOperatorVisitor {
+public:
+    void rewrite(planner::LogicalPlan* plan);
+
+private:
+    std::shared_ptr<planner::LogicalOperator> visitOperator(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+
+    std::shared_ptr<planner::LogicalOperator> visitHashJoinReplace(
+        std::shared_ptr<planner::LogicalOperator> op) override;
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/schema_populator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/schema_populator.h
new file mode 100644
index 0000000000..c2e5347cf8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/schema_populator.h
@@ -0,0 +1,12 @@
+#pragma once
+
+#include "optimizer/logical_operator_visitor.h"
+#include "planner/operator/logical_plan.h"
+namespace lbug {
+namespace optimizer {
+class SchemaPopulator : public LogicalOperatorVisitor {
+public:
+    void rewrite(planner::LogicalPlan* plan);
+};
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/top_k_optimizer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/top_k_optimizer.h
new file mode 100644
index 0000000000..4a549f29f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/optimizer/top_k_optimizer.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "logical_operator_visitor.h"
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace optimizer {
+
+class TopKOptimizer : public LogicalOperatorVisitor {
+public:
+    void rewrite(planner::LogicalPlan* plan);
+
+    std::shared_ptr<planner::LogicalOperator> visitOperator(
+        const std::shared_ptr<planner::LogicalOperator>& op);
+
+private:
+    std::shared_ptr<planner::LogicalOperator> visitLimitReplace(
+        std::shared_ptr<planner::LogicalOperator> op) override;
+};
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/antlr_parser/lbug_cypher_parser.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/antlr_parser/lbug_cypher_parser.h
new file mode 100644
index 0000000000..754d53f358
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/antlr_parser/lbug_cypher_parser.h
@@ -0,0 +1,32 @@
+#pragma once
+
+// ANTLR4 generates code with unused parameters.
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wunused-parameter"
+#include "cypher_parser.h"
+#pragma GCC diagnostic pop
+
+namespace lbug {
+namespace parser {
+
+class LbugCypherParser : public CypherParser {
+
+public:
+    explicit LbugCypherParser(antlr4::TokenStream* input) : CypherParser(input) {}
+
+    void notifyQueryNotConcludeWithReturn(antlr4::Token* startToken) override;
+
+    void notifyNodePatternWithoutParentheses(std::string nodeName,
+        antlr4::Token* startToken) override;
+
+    void notifyInvalidNotEqualOperator(antlr4::Token* startToken) override;
+
+    void notifyEmptyToken(antlr4::Token* startToken) override;
+
+    void notifyReturnNotAtEnd(antlr4::Token* startToken) override;
+
+    void notifyNonBinaryComparison(antlr4::Token* startToken) override;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/antlr_parser/parser_error_listener.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/antlr_parser/parser_error_listener.h
new file mode 100644
index 0000000000..f9738384a2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/antlr_parser/parser_error_listener.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include <string>
+
+#include "antlr4-runtime.h" // IWYU pragma: keep. This is the public header.
+
+namespace lbug {
+namespace parser {
+
+class ParserErrorListener : public antlr4::BaseErrorListener {
+
+public:
+    void syntaxError(antlr4::Recognizer* recognizer, antlr4::Token* offendingSymbol, size_t line,
+        size_t charPositionInLine, const std::string& msg, std::exception_ptr e) override;
+
+private:
+    std::string formatUnderLineError(antlr4::Recognizer& recognizer,
+        const antlr4::Token& offendingToken, size_t line, size_t charPositionInLine);
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/antlr_parser/parser_error_strategy.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/antlr_parser/parser_error_strategy.h
new file mode 100644
index 0000000000..2e219c95f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/antlr_parser/parser_error_strategy.h
@@ -0,0 +1,16 @@
+#pragma once
+
+#include "antlr4-runtime.h" // IWYU pragma: keep; this is the public header.
+
+namespace lbug {
+namespace parser {
+
+class ParserErrorStrategy : public antlr4::DefaultErrorStrategy {
+
+protected:
+    void reportNoViableAlternative(antlr4::Parser* recognizer,
+        const antlr4::NoViableAltException& e) override;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/attach_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/attach_database.h
new file mode 100644
index 0000000000..641b9d7474
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/attach_database.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "parsed_data/attach_info.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class AttachDatabase final : public Statement {
+public:
+    explicit AttachDatabase(AttachInfo attachInfo)
+        : Statement{common::StatementType::ATTACH_DATABASE}, attachInfo{std::move(attachInfo)} {}
+
+    const AttachInfo& getAttachInfo() const { return attachInfo; }
+
+private:
+    AttachInfo attachInfo;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/copy.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/copy.h
new file mode 100644
index 0000000000..cdfb6dac64
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/copy.h
@@ -0,0 +1,70 @@
+#pragma once
+
+#include <vector>
+
+#include "parser/expression/parsed_expression.h"
+#include "parser/scan_source.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class Copy : public Statement {
+public:
+    explicit Copy(common::StatementType type) : Statement{type} {}
+
+    void setParsingOption(options_t options) { parsingOptions = std::move(options); }
+    const options_t& getParsingOptions() const { return parsingOptions; }
+
+protected:
+    options_t parsingOptions;
+};
+
+struct CopyFromColumnInfo {
+    bool inputColumnOrder = false;
+    std::vector<std::string> columnNames;
+
+    CopyFromColumnInfo() = default;
+    CopyFromColumnInfo(bool inputColumnOrder, std::vector<std::string> columnNames)
+        : inputColumnOrder{inputColumnOrder}, columnNames{std::move(columnNames)} {}
+};
+
+class CopyFrom : public Copy {
+public:
+    CopyFrom(std::unique_ptr<BaseScanSource> source, std::string tableName)
+        : Copy{common::StatementType::COPY_FROM}, byColumn_{false}, source{std::move(source)},
+          tableName{std::move(tableName)} {}
+
+    void setByColumn() { byColumn_ = true; }
+    bool byColumn() const { return byColumn_; }
+
+    BaseScanSource* getSource() const { return source.get(); }
+
+    std::string getTableName() const { return tableName; }
+
+    void setColumnInfo(CopyFromColumnInfo columnInfo_) { columnInfo = std::move(columnInfo_); }
+    CopyFromColumnInfo getCopyColumnInfo() const { return columnInfo; }
+
+private:
+    bool byColumn_;
+    std::unique_ptr<BaseScanSource> source;
+    std::string tableName;
+    CopyFromColumnInfo columnInfo;
+};
+
+class CopyTo : public Copy {
+public:
+    CopyTo(std::string filePath, std::unique_ptr<Statement> statement)
+        : Copy{common::StatementType::COPY_TO}, filePath{std::move(filePath)},
+          statement{std::move(statement)} {}
+
+    std::string getFilePath() const { return filePath; }
+    const Statement* getStatement() const { return statement.get(); }
+
+private:
+    std::string filePath;
+    std::unique_ptr<Statement> statement;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/create_macro.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/create_macro.h
new file mode 100644
index 0000000000..d55a76bfc4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/create_macro.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "parser/expression/parsed_expression.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+using default_macro_args = std::vector<std::pair<std::string, std::unique_ptr<ParsedExpression>>>;
+
+class CreateMacro final : public Statement {
+    static constexpr common::StatementType type_ = common::StatementType::CREATE_MACRO;
+
+public:
+    CreateMacro(std::string macroName, std::unique_ptr<ParsedExpression> macroExpression,
+        std::vector<std::string> positionalArgs, default_macro_args defaultArgs)
+        : Statement{type_}, macroName{std::move(macroName)},
+          macroExpression{std::move(macroExpression)}, positionalArgs{std::move(positionalArgs)},
+          defaultArgs{std::move(defaultArgs)} {}
+
+    std::string getMacroName() const { return macroName; }
+
+    ParsedExpression* getMacroExpression() const { return macroExpression.get(); }
+
+    std::vector<std::string> getPositionalArgs() const { return positionalArgs; }
+
+    std::vector<std::pair<std::string, ParsedExpression*>> getDefaultArgs() const;
+
+public:
+    std::string macroName;
+    std::unique_ptr<ParsedExpression> macroExpression;
+    std::vector<std::string> positionalArgs;
+    default_macro_args defaultArgs;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/database_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/database_statement.h
new file mode 100644
index 0000000000..0d199c837b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/database_statement.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include <string>
+
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class DatabaseStatement : public Statement {
+public:
+    explicit DatabaseStatement(common::StatementType type, std::string dbName)
+        : Statement{type}, dbName{std::move(dbName)} {}
+
+    std::string getDBName() const { return dbName; }
+
+private:
+    std::string dbName;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/alter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/alter.h
new file mode 100644
index 0000000000..e6003dcdc4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/alter.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "alter_info.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class Alter : public Statement {
+    static constexpr common::StatementType type_ = common::StatementType::ALTER;
+
+public:
+    explicit Alter(AlterInfo info) : Statement{type_}, info{std::move(info)} {}
+
+    const AlterInfo* getInfo() const { return &info; }
+
+private:
+    AlterInfo info;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/alter_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/alter_info.h
new file mode 100644
index 0000000000..c4c9fd7809
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/alter_info.h
@@ -0,0 +1,87 @@
+#pragma once
+
+#include <string>
+
+#include "common/copy_constructors.h"
+#include "common/enums/alter_type.h"
+#include "common/enums/conflict_action.h"
+#include "parser/expression/parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+struct ExtraAlterInfo {
+    virtual ~ExtraAlterInfo() = default;
+
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+};
+
+struct AlterInfo {
+    common::AlterType type;
+    std::string tableName;
+    std::unique_ptr<ExtraAlterInfo> extraInfo;
+    common::ConflictAction onConflict;
+
+    AlterInfo(common::AlterType type, std::string tableName,
+        std::unique_ptr<ExtraAlterInfo> extraInfo,
+        common::ConflictAction onConflict = common::ConflictAction::ON_CONFLICT_THROW)
+        : type{type}, tableName{std::move(tableName)}, extraInfo{std::move(extraInfo)},
+          onConflict{onConflict} {}
+    DELETE_COPY_DEFAULT_MOVE(AlterInfo);
+};
+
+struct ExtraRenameTableInfo : public ExtraAlterInfo {
+    std::string newName;
+
+    explicit ExtraRenameTableInfo(std::string newName) : newName{std::move(newName)} {}
+};
+
+struct ExtraAddFromToConnection : public ExtraAlterInfo {
+    std::string srcTableName;
+    std::string dstTableName;
+
+    explicit ExtraAddFromToConnection(std::string srcTableName, std::string dstTableName)
+        : srcTableName{std::move(srcTableName)}, dstTableName{std::move(dstTableName)} {}
+};
+
+struct ExtraAddPropertyInfo : public ExtraAlterInfo {
+    std::string propertyName;
+    std::string dataType;
+    std::unique_ptr<ParsedExpression> defaultValue;
+
+    ExtraAddPropertyInfo(std::string propertyName, std::string dataType,
+        std::unique_ptr<ParsedExpression> defaultValue)
+        : propertyName{std::move(propertyName)}, dataType{std::move(dataType)},
+          defaultValue{std::move(defaultValue)} {}
+};
+
+struct ExtraDropPropertyInfo : public ExtraAlterInfo {
+    std::string propertyName;
+
+    explicit ExtraDropPropertyInfo(std::string propertyName)
+        : propertyName{std::move(propertyName)} {}
+};
+
+struct ExtraRenamePropertyInfo : public ExtraAlterInfo {
+    std::string propertyName;
+    std::string newName;
+
+    ExtraRenamePropertyInfo(std::string propertyName, std::string newName)
+        : propertyName{std::move(propertyName)}, newName{std::move(newName)} {}
+};
+
+struct ExtraCommentInfo : public ExtraAlterInfo {
+    std::string comment;
+
+    explicit ExtraCommentInfo(std::string comment) : comment{std::move(comment)} {}
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_sequence.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_sequence.h
new file mode 100644
index 0000000000..1710001de2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_sequence.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "create_sequence_info.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class CreateSequence final : public Statement {
+    static constexpr common::StatementType type_ = common::StatementType::CREATE_SEQUENCE;
+
+public:
+    explicit CreateSequence(CreateSequenceInfo info) : Statement{type_}, info{std::move(info)} {}
+
+    CreateSequenceInfo getInfo() const { return info.copy(); }
+
+private:
+    CreateSequenceInfo info;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_sequence_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_sequence_info.h
new file mode 100644
index 0000000000..ac8c4c9b90
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_sequence_info.h
@@ -0,0 +1,41 @@
+#pragma once
+
+#include <string>
+
+#include "common/copy_constructors.h"
+#include "common/enums/conflict_action.h"
+
+namespace lbug {
+namespace parser {
+
+enum class SequenceInfoType {
+    START,
+    INCREMENT,
+    MINVALUE,
+    MAXVALUE,
+    CYCLE,
+    INVALID,
+};
+
+struct CreateSequenceInfo {
+    std::string sequenceName;
+    std::string startWith = "";
+    std::string increment = "1";
+    std::string minValue = "";
+    std::string maxValue = "";
+    bool cycle = false;
+    common::ConflictAction onConflict;
+
+    explicit CreateSequenceInfo(std::string sequenceName, common::ConflictAction onConflict)
+        : sequenceName{std::move(sequenceName)}, onConflict{onConflict} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(CreateSequenceInfo);
+
+private:
+    CreateSequenceInfo(const CreateSequenceInfo& other)
+        : sequenceName{other.sequenceName}, startWith{other.startWith}, increment{other.increment},
+          minValue{other.minValue}, maxValue{other.maxValue}, cycle{other.cycle},
+          onConflict{other.onConflict} {}
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_table.h
new file mode 100644
index 0000000000..a1c160c36a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_table.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "create_table_info.h"
+#include "parser/scan_source.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class CreateTable final : public Statement {
+    static constexpr common::StatementType type_ = common::StatementType::CREATE_TABLE;
+
+public:
+    explicit CreateTable(CreateTableInfo info) : Statement{type_}, info{std::move(info)} {}
+
+    CreateTable(CreateTableInfo info, std::unique_ptr<QueryScanSource>&& source)
+        : Statement{type_}, info{std::move(info)}, source{std::move(source)} {}
+
+    const CreateTableInfo* getInfo() const { return &info; }
+    const QueryScanSource* getSource() const { return source.get(); }
+
+private:
+    CreateTableInfo info;
+    std::unique_ptr<QueryScanSource> source;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_table_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_table_info.h
new file mode 100644
index 0000000000..b9fa5265f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_table_info.h
@@ -0,0 +1,55 @@
+#pragma once
+
+#include <memory>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "common/enums/conflict_action.h"
+#include "common/enums/table_type.h"
+#include "parsed_property_definition.h"
+
+namespace lbug {
+namespace parser {
+
+struct ExtraCreateTableInfo {
+    virtual ~ExtraCreateTableInfo() = default;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+struct CreateTableInfo {
+    common::TableType type;
+    std::string tableName;
+    std::vector<ParsedPropertyDefinition> propertyDefinitions;
+    std::unique_ptr<ExtraCreateTableInfo> extraInfo;
+    common::ConflictAction onConflict;
+
+    CreateTableInfo(common::TableType type, std::string tableName,
+        common::ConflictAction onConflict)
+        : type{type}, tableName{std::move(tableName)}, extraInfo{nullptr}, onConflict{onConflict} {}
+    DELETE_COPY_DEFAULT_MOVE(CreateTableInfo);
+};
+
+struct ExtraCreateNodeTableInfo final : ExtraCreateTableInfo {
+    std::string pKName;
+
+    explicit ExtraCreateNodeTableInfo(std::string pKName) : pKName{std::move(pKName)} {}
+};
+
+struct ExtraCreateRelTableGroupInfo final : ExtraCreateTableInfo {
+    std::string relMultiplicity;
+    std::vector<std::pair<std::string, std::string>> srcDstTablePairs;
+    options_t options;
+
+    ExtraCreateRelTableGroupInfo(std::string relMultiplicity,
+        std::vector<std::pair<std::string, std::string>> srcDstTablePairs, options_t options)
+        : relMultiplicity{std::move(relMultiplicity)},
+          srcDstTablePairs{std::move(srcDstTablePairs)}, options{std::move(options)} {}
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_type.h
new file mode 100644
index 0000000000..806831355a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/create_type.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class CreateType final : public Statement {
+    static constexpr common::StatementType type_ = common::StatementType::CREATE_TYPE;
+
+public:
+    CreateType(std::string name, std::string dataType)
+        : Statement{type_}, name{std::move(name)}, dataType{std::move(dataType)} {}
+
+    std::string getName() const { return name; }
+
+    std::string getDataType() const { return dataType; }
+
+private:
+    std::string name;
+    std::string dataType;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/drop.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/drop.h
new file mode 100644
index 0000000000..89d7656ba0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/drop.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "drop_info.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class Drop : public Statement {
+    static constexpr common::StatementType type_ = common::StatementType::DROP;
+
+public:
+    explicit Drop(DropInfo dropInfo) : Statement{type_}, dropInfo{std::move(dropInfo)} {}
+
+    const DropInfo& getDropInfo() const { return dropInfo; }
+
+private:
+    DropInfo dropInfo;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/drop_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/drop_info.h
new file mode 100644
index 0000000000..87bf438fd2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/drop_info.h
@@ -0,0 +1,17 @@
+#pragma once
+#include <string>
+
+#include "common/enums/conflict_action.h"
+#include "common/enums/drop_type.h"
+
+namespace lbug {
+namespace parser {
+
+struct DropInfo {
+    std::string name;
+    common::DropType dropType;
+    common::ConflictAction conflictAction;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/parsed_property_definition.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/parsed_property_definition.h
new file mode 100644
index 0000000000..510197952e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/ddl/parsed_property_definition.h
@@ -0,0 +1,43 @@
+#pragma once
+
+#include "parser/expression/parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+struct ParsedColumnDefinition {
+    std::string name;
+    std::string type;
+
+    ParsedColumnDefinition(std::string name, std::string type)
+        : name{std::move(name)}, type{std::move(type)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ParsedColumnDefinition);
+
+private:
+    ParsedColumnDefinition(const ParsedColumnDefinition& other)
+        : name{other.name}, type{other.type} {}
+};
+
+struct ParsedPropertyDefinition {
+    ParsedColumnDefinition columnDefinition;
+    std::unique_ptr<ParsedExpression> defaultExpr;
+
+    ParsedPropertyDefinition(ParsedColumnDefinition columnDefinition,
+        std::unique_ptr<ParsedExpression> defaultExpr)
+        : columnDefinition{std::move(columnDefinition)}, defaultExpr{std::move(defaultExpr)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ParsedPropertyDefinition);
+
+    std::string getName() const { return columnDefinition.name; }
+    std::string getType() const { return columnDefinition.type; }
+
+private:
+    ParsedPropertyDefinition(const ParsedPropertyDefinition& other)
+        : columnDefinition{other.columnDefinition.copy()} {
+        if (other.defaultExpr) {
+            defaultExpr = other.defaultExpr->copy();
+        }
+    }
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/detach_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/detach_database.h
new file mode 100644
index 0000000000..dd5a917d2f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/detach_database.h
@@ -0,0 +1,18 @@
+#pragma once
+
+#include <string>
+
+#include "parser/database_statement.h"
+
+namespace lbug {
+namespace parser {
+
+class DetachDatabase final : public DatabaseStatement {
+    static constexpr common::StatementType type_ = common::StatementType::DETACH_DATABASE;
+
+public:
+    explicit DetachDatabase(std::string dbName) : DatabaseStatement{type_, std::move(dbName)} {}
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/explain_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/explain_statement.h
new file mode 100644
index 0000000000..939b870694
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/explain_statement.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include <memory>
+
+#include "common/enums/explain_type.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class ExplainStatement : public Statement {
+public:
+    ExplainStatement(std::unique_ptr<Statement> statementToExplain, common::ExplainType explainType)
+        : Statement{common::StatementType::EXPLAIN},
+          statementToExplain{std::move(statementToExplain)}, explainType{explainType} {}
+
+    inline Statement* getStatementToExplain() const { return statementToExplain.get(); }
+
+    inline common::ExplainType getExplainType() const { return explainType; }
+
+private:
+    std::unique_ptr<Statement> statementToExplain;
+    common::ExplainType explainType;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_case_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_case_expression.h
new file mode 100644
index 0000000000..ba2ca09dd6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_case_expression.h
@@ -0,0 +1,93 @@
+#pragma once
+
+#include "common/copy_constructors.h"
+#include "parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+struct ParsedCaseAlternative {
+    std::unique_ptr<ParsedExpression> whenExpression;
+    std::unique_ptr<ParsedExpression> thenExpression;
+
+    ParsedCaseAlternative() = default;
+    ParsedCaseAlternative(std::unique_ptr<ParsedExpression> whenExpression,
+        std::unique_ptr<ParsedExpression> thenExpression)
+        : whenExpression{std::move(whenExpression)}, thenExpression{std::move(thenExpression)} {}
+    ParsedCaseAlternative(const ParsedCaseAlternative& other)
+        : whenExpression{other.whenExpression->copy()},
+          thenExpression{other.thenExpression->copy()} {}
+    DEFAULT_BOTH_MOVE(ParsedCaseAlternative);
+
+    void serialize(common::Serializer& serializer) const;
+    static ParsedCaseAlternative deserialize(common::Deserializer& deserializer);
+};
+
+// Cypher supports 2 types of CaseExpression
+// 1. CASE a.age
+//    WHEN 20 THEN ...
+// 2. CASE
+//    WHEN a.age = 20 THEN ...
+class ParsedCaseExpression final : public ParsedExpression {
+    friend class ParsedExpressionChildrenVisitor;
+
+public:
+    explicit ParsedCaseExpression(std::string raw)
+        : ParsedExpression{common::ExpressionType::CASE_ELSE, std::move(raw)} {};
+
+    ParsedCaseExpression(std::string alias, std::string rawName, parsed_expr_vector children,
+        std::unique_ptr<ParsedExpression> caseExpression,
+        std::vector<ParsedCaseAlternative> caseAlternatives,
+        std::unique_ptr<ParsedExpression> elseExpression)
+        : ParsedExpression{common::ExpressionType::CASE_ELSE, std::move(alias), std::move(rawName),
+              std::move(children)},
+          caseExpression{std::move(caseExpression)}, caseAlternatives{std::move(caseAlternatives)},
+          elseExpression{std::move(elseExpression)} {}
+
+    ParsedCaseExpression(std::unique_ptr<ParsedExpression> caseExpression,
+        std::vector<ParsedCaseAlternative> caseAlternatives,
+        std::unique_ptr<ParsedExpression> elseExpression)
+        : ParsedExpression{common::ExpressionType::CASE_ELSE},
+          caseExpression{std::move(caseExpression)}, caseAlternatives{std::move(caseAlternatives)},
+          elseExpression{std::move(elseExpression)} {}
+
+    inline void setCaseExpression(std::unique_ptr<ParsedExpression> expression) {
+        caseExpression = std::move(expression);
+    }
+    inline bool hasCaseExpression() const { return caseExpression != nullptr; }
+    inline ParsedExpression* getCaseExpression() const { return caseExpression.get(); }
+
+    inline void addCaseAlternative(ParsedCaseAlternative caseAlternative) {
+        caseAlternatives.push_back(std::move(caseAlternative));
+    }
+    inline uint32_t getNumCaseAlternative() const { return caseAlternatives.size(); }
+    inline ParsedCaseAlternative* getCaseAlternativeUnsafe(uint32_t idx) {
+        return &caseAlternatives[idx];
+    }
+    inline const ParsedCaseAlternative* getCaseAlternative(uint32_t idx) const {
+        return &caseAlternatives[idx];
+    }
+
+    inline void setElseExpression(std::unique_ptr<ParsedExpression> expression) {
+        elseExpression = std::move(expression);
+    }
+    inline bool hasElseExpression() const { return elseExpression != nullptr; }
+    inline ParsedExpression* getElseExpression() const { return elseExpression.get(); }
+
+    static std::unique_ptr<ParsedCaseExpression> deserialize(common::Deserializer& deserializer);
+
+    std::unique_ptr<ParsedExpression> copy() const override;
+
+private:
+    void serializeInternal(common::Serializer& serializer) const override;
+
+private:
+    // Optional. If not specified, directly check next whenExpression
+    std::unique_ptr<ParsedExpression> caseExpression;
+    std::vector<ParsedCaseAlternative> caseAlternatives;
+    // Optional. If not specified, evaluate as null
+    std::unique_ptr<ParsedExpression> elseExpression;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_expression.h
new file mode 100644
index 0000000000..94db81061f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_expression.h
@@ -0,0 +1,100 @@
+#pragma once
+
+#include <memory>
+#include <string>
+#include <unordered_map>
+#include <vector>
+
+#include "common/cast.h"
+#include "common/copy_constructors.h"
+#include "common/enums/expression_type.h"
+#include "common/types/types.h"
+
+namespace lbug {
+
+namespace common {
+struct FileInfo;
+class Serializer;
+class Deserializer;
+} // namespace common
+
+namespace parser {
+
+class ParsedExpression;
+class ParsedExpressionChildrenVisitor;
+using parsed_expr_vector = std::vector<std::unique_ptr<ParsedExpression>>;
+using parsed_expr_pair =
+    std::pair<std::unique_ptr<ParsedExpression>, std::unique_ptr<ParsedExpression>>;
+using s_parsed_expr_pair = std::pair<std::string, std::unique_ptr<ParsedExpression>>;
+
+class LBUG_API ParsedExpression {
+    friend class ParsedExpressionChildrenVisitor;
+
+public:
+    ParsedExpression(common::ExpressionType type, std::unique_ptr<ParsedExpression> child,
+        std::string rawName);
+    ParsedExpression(common::ExpressionType type, std::unique_ptr<ParsedExpression> left,
+        std::unique_ptr<ParsedExpression> right, std::string rawName);
+    ParsedExpression(common::ExpressionType type, std::string rawName)
+        : type{type}, rawName{std::move(rawName)} {}
+    explicit ParsedExpression(common::ExpressionType type) : type{type} {}
+
+    ParsedExpression(common::ExpressionType type, std::string alias, std::string rawName,
+        parsed_expr_vector children)
+        : type{type}, alias{std::move(alias)}, rawName{std::move(rawName)},
+          children{std::move(children)} {}
+    DELETE_COPY_DEFAULT_MOVE(ParsedExpression);
+    virtual ~ParsedExpression() = default;
+
+    common::ExpressionType getExpressionType() const { return type; }
+
+    void setAlias(std::string name) { alias = std::move(name); }
+    bool hasAlias() const { return !alias.empty(); }
+    std::string getAlias() const { return alias; }
+
+    std::string getRawName() const { return rawName; }
+
+    common::idx_t getNumChildren() const { return children.size(); }
+    ParsedExpression* getChild(common::idx_t idx) const { return children[idx].get(); }
+    void setChild(common::idx_t idx, std::unique_ptr<ParsedExpression> child) {
+        KU_ASSERT(idx < children.size());
+        children[idx] = std::move(child);
+    }
+
+    std::string toString() const { return rawName; }
+
+    virtual std::unique_ptr<ParsedExpression> copy() const {
+        return std::make_unique<ParsedExpression>(type, alias, rawName, copyVector(children));
+    }
+
+    void serialize(common::Serializer& serializer) const;
+
+    static std::unique_ptr<ParsedExpression> deserialize(common::Deserializer& deserializer);
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+
+private:
+    virtual void serializeInternal(common::Serializer&) const {}
+
+protected:
+    common::ExpressionType type;
+    std::string alias;
+    std::string rawName;
+    parsed_expr_vector children;
+};
+
+using options_t = std::unordered_map<std::string, std::unique_ptr<parser::ParsedExpression>>;
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_expression_visitor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_expression_visitor.h
new file mode 100644
index 0000000000..7aa5edfe75
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_expression_visitor.h
@@ -0,0 +1,80 @@
+#pragma once
+
+#include "parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class ParsedExpressionVisitor {
+public:
+    virtual ~ParsedExpressionVisitor() = default;
+
+    void visit(const ParsedExpression* expr);
+    void visitUnsafe(ParsedExpression* expr);
+
+    virtual void visitSwitch(const ParsedExpression* expr);
+    virtual void visitFunctionExpr(const ParsedExpression*) {}
+    virtual void visitAggFunctionExpr(const ParsedExpression*) {}
+    virtual void visitPropertyExpr(const ParsedExpression*) {}
+    virtual void visitLiteralExpr(const ParsedExpression*) {}
+    virtual void visitVariableExpr(const ParsedExpression*) {}
+    virtual void visitPathExpr(const ParsedExpression*) {}
+    virtual void visitNodeRelExpr(const ParsedExpression*) {}
+    virtual void visitParamExpr(const ParsedExpression*) {}
+    virtual void visitSubqueryExpr(const ParsedExpression*) {}
+    virtual void visitCaseExpr(const ParsedExpression*) {}
+    virtual void visitGraphExpr(const ParsedExpression*) {}
+    virtual void visitLambdaExpr(const ParsedExpression*) {}
+    virtual void visitStar(const ParsedExpression*) {}
+
+    void visitChildren(const ParsedExpression& expr);
+    void visitCaseChildren(const ParsedExpression& expr);
+
+    virtual void visitSwitchUnsafe(ParsedExpression*) {}
+    virtual void visitChildrenUnsafe(ParsedExpression& expr);
+    virtual void visitCaseChildrenUnsafe(ParsedExpression& expr);
+};
+
+class ParsedParamExprCollector : public ParsedExpressionVisitor {
+public:
+    std::vector<const ParsedExpression*> getParamExprs() const { return paramExprs; }
+    bool hasParamExprs() const { return !paramExprs.empty(); }
+
+    void visitParamExpr(const ParsedExpression* expr) override { paramExprs.push_back(expr); }
+
+private:
+    std::vector<const ParsedExpression*> paramExprs;
+};
+
+class ReadWriteExprAnalyzer : public ParsedExpressionVisitor {
+public:
+    explicit ReadWriteExprAnalyzer(main::ClientContext* context)
+        : ParsedExpressionVisitor{}, context{context} {}
+
+    bool isReadOnly() const { return readOnly; }
+    void visitFunctionExpr(const ParsedExpression* expr) override;
+
+private:
+    main::ClientContext* context;
+    bool readOnly = true;
+};
+
+class MacroParameterReplacer : public ParsedExpressionVisitor {
+public:
+    explicit MacroParameterReplacer(
+        const std::unordered_map<std::string, ParsedExpression*>& nameToExpr)
+        : nameToExpr{nameToExpr} {}
+
+    std::unique_ptr<ParsedExpression> replace(std::unique_ptr<ParsedExpression> input);
+
+private:
+    void visitSwitchUnsafe(ParsedExpression* expr) override;
+
+    std::unique_ptr<ParsedExpression> getReplace(const std::string& name);
+
+private:
+    const std::unordered_map<std::string, ParsedExpression*>& nameToExpr;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_function_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_function_expression.h
new file mode 100644
index 0000000000..8d5efbae36
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_function_expression.h
@@ -0,0 +1,77 @@
+#pragma once
+
+#include "common/string_utils.h"
+#include "parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class ParsedFunctionExpression : public ParsedExpression {
+    static constexpr common::ExpressionType expressionType_ = common::ExpressionType::FUNCTION;
+
+public:
+    ParsedFunctionExpression(std::string functionName, std::string rawName, bool isDistinct = false)
+        : ParsedExpression{expressionType_, std::move(rawName)}, isDistinct{isDistinct},
+          functionName{std::move(functionName)} {}
+
+    ParsedFunctionExpression(std::string functionName, std::unique_ptr<ParsedExpression> child,
+        std::string rawName, bool isDistinct = false)
+        : ParsedExpression{expressionType_, std::move(child), std::move(rawName)},
+          isDistinct{isDistinct}, functionName{std::move(functionName)} {}
+
+    ParsedFunctionExpression(std::string functionName, std::unique_ptr<ParsedExpression> left,
+        std::unique_ptr<ParsedExpression> right, std::string rawName, bool isDistinct = false)
+        : ParsedExpression{expressionType_, std::move(left), std::move(right), std::move(rawName)},
+          isDistinct{isDistinct}, functionName{std::move(functionName)} {}
+
+    ParsedFunctionExpression(std::string alias, std::string rawName, parsed_expr_vector children,
+        std::string functionName, bool isDistinct, std::vector<std::string> optionalArguments)
+        : ParsedExpression{expressionType_, std::move(alias), std::move(rawName),
+              std::move(children)},
+          isDistinct{isDistinct}, functionName{std::move(functionName)},
+          optionalArguments{std::move(optionalArguments)} {}
+
+    ParsedFunctionExpression(std::string functionName, bool isDistinct)
+        : ParsedExpression{expressionType_}, isDistinct{isDistinct},
+          functionName{std::move(functionName)} {}
+
+    bool getIsDistinct() const { return isDistinct; }
+
+    std::string getFunctionName() const { return functionName; }
+    std::string getNormalizedFunctionName() const {
+        return common::StringUtils::getUpper(functionName);
+    }
+
+    void addChild(std::unique_ptr<ParsedExpression> child) { children.push_back(std::move(child)); }
+
+    void setOptionalArguments(std::vector<std::string> optionalArguments) {
+        this->optionalArguments = std::move(optionalArguments);
+    }
+    void addOptionalParams(std::string name, std::unique_ptr<ParsedExpression> child) {
+        optionalArguments.push_back(std::move(name));
+        children.push_back(std::move(child));
+    }
+
+    const std::vector<std::string>& getOptionalArguments() const { return optionalArguments; }
+
+    static std::unique_ptr<ParsedFunctionExpression> deserialize(
+        common::Deserializer& deserializer);
+
+    std::unique_ptr<ParsedExpression> copy() const override {
+        return std::make_unique<ParsedFunctionExpression>(alias, rawName, copyVector(children),
+            functionName, isDistinct, optionalArguments);
+    }
+
+private:
+    void serializeInternal(common::Serializer& serializer) const override;
+
+private:
+    bool isDistinct;
+    std::string functionName;
+    // In Lbug, function arguments must be either all required or all optional - mixing required and
+    // optional parameters in the same function is not allowed.
+    std::vector<std::string> optionalArguments;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_lambda_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_lambda_expression.h
new file mode 100644
index 0000000000..cf24ce77f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_lambda_expression.h
@@ -0,0 +1,32 @@
+#pragma once
+
+#include "common/enums/expression_type.h"
+#include "parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class ParsedLambdaExpression : public ParsedExpression {
+    static constexpr const common::ExpressionType type_ = common::ExpressionType::LAMBDA;
+
+public:
+    ParsedLambdaExpression(std::vector<std::string> varNames,
+        std::unique_ptr<ParsedExpression> expr, std::string rawName)
+        : ParsedExpression{type_, rawName}, varNames{std::move(varNames)},
+          functionExpr{std::move(expr)} {}
+
+    std::vector<std::string> getVarNames() const { return varNames; }
+
+    ParsedExpression* getFunctionExpr() const { return functionExpr.get(); }
+
+    std::unique_ptr<ParsedExpression> copy() const override {
+        return std::make_unique<ParsedLambdaExpression>(varNames, functionExpr->copy(), rawName);
+    }
+
+private:
+    std::vector<std::string> varNames;
+    std::unique_ptr<ParsedExpression> functionExpr;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_literal_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_literal_expression.h
new file mode 100644
index 0000000000..ce364fafa4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_literal_expression.h
@@ -0,0 +1,47 @@
+#pragma once
+
+#include "common/types/value/value.h"
+#include "parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class ParsedLiteralExpression : public ParsedExpression {
+    static constexpr common::ExpressionType expressionType = common::ExpressionType::LITERAL;
+
+public:
+    ParsedLiteralExpression(common::Value value, std::string raw)
+        : ParsedExpression{expressionType, std::move(raw)}, value{std::move(value)} {}
+
+    ParsedLiteralExpression(std::string alias, std::string rawName, parsed_expr_vector children,
+        common::Value value)
+        : ParsedExpression{expressionType, std::move(alias), std::move(rawName),
+              std::move(children)},
+          value{std::move(value)} {}
+
+    explicit ParsedLiteralExpression(common::Value value)
+        : ParsedExpression{expressionType}, value{std::move(value)} {}
+
+    common::Value getValue() const { return value; }
+
+    static std::unique_ptr<ParsedLiteralExpression> deserialize(
+        common::Deserializer& deserializer) {
+        return std::make_unique<ParsedLiteralExpression>(*common::Value::deserialize(deserializer));
+    }
+
+    std::unique_ptr<ParsedExpression> copy() const override {
+        return std::make_unique<ParsedLiteralExpression>(alias, rawName, copyVector(children),
+            value);
+    }
+
+private:
+    void serializeInternal(common::Serializer& serializer) const override {
+        value.serialize(serializer);
+    }
+
+private:
+    common::Value value;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_parameter_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_parameter_expression.h
new file mode 100644
index 0000000000..03372957bd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_parameter_expression.h
@@ -0,0 +1,31 @@
+#pragma once
+
+#include "common/assert.h"
+#include "parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class ParsedParameterExpression : public ParsedExpression {
+public:
+    explicit ParsedParameterExpression(std::string parameterName, std::string raw)
+        : ParsedExpression{common::ExpressionType::PARAMETER, std::move(raw)},
+          parameterName{std::move(parameterName)} {}
+
+    inline std::string getParameterName() const { return parameterName; }
+
+    static std::unique_ptr<ParsedParameterExpression> deserialize(common::Deserializer&) {
+        KU_UNREACHABLE;
+    }
+
+    inline std::unique_ptr<ParsedExpression> copy() const override { KU_UNREACHABLE; }
+
+private:
+    void serializeInternal(common::Serializer&) const override { KU_UNREACHABLE; }
+
+private:
+    std::string parameterName;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_property_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_property_expression.h
new file mode 100644
index 0000000000..bb9c6e552d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_property_expression.h
@@ -0,0 +1,49 @@
+#pragma once
+
+#include "common/constants.h"
+#include "common/serializer/serializer.h"
+#include "parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class ParsedPropertyExpression : public ParsedExpression {
+    static constexpr common::ExpressionType expressionType_ = common::ExpressionType::PROPERTY;
+
+public:
+    ParsedPropertyExpression(std::string propertyName, std::unique_ptr<ParsedExpression> child,
+        std::string raw)
+        : ParsedExpression{expressionType_, std::move(child), std::move(raw)},
+          propertyName{std::move(propertyName)} {}
+
+    ParsedPropertyExpression(std::string alias, std::string rawName, parsed_expr_vector children,
+        std::string propertyName)
+        : ParsedExpression{expressionType_, std::move(alias), std::move(rawName),
+              std::move(children)},
+          propertyName{std::move(propertyName)} {}
+
+    explicit ParsedPropertyExpression(std::string propertyName)
+        : ParsedExpression{expressionType_}, propertyName{std::move(propertyName)} {}
+
+    std::string getPropertyName() const { return propertyName; }
+    bool isStar() const { return propertyName == common::InternalKeyword::STAR; }
+
+    static std::unique_ptr<ParsedPropertyExpression> deserialize(
+        common::Deserializer& deserializer);
+
+    std::unique_ptr<ParsedExpression> copy() const override {
+        return std::make_unique<ParsedPropertyExpression>(alias, rawName, copyVector(children),
+            propertyName);
+    }
+
+private:
+    void serializeInternal(common::Serializer& serializer) const override {
+        serializer.serializeValue(propertyName);
+    }
+
+private:
+    std::string propertyName;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_subquery_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_subquery_expression.h
new file mode 100644
index 0000000000..53a32bbed8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_subquery_expression.h
@@ -0,0 +1,56 @@
+#pragma once
+
+#include "common/assert.h"
+#include "common/enums/subquery_type.h"
+#include "parsed_expression.h"
+#include "parser/query/graph_pattern/pattern_element.h"
+#include "parser/query/reading_clause/join_hint.h"
+
+namespace lbug {
+namespace parser {
+
+class ParsedSubqueryExpression : public ParsedExpression {
+    static constexpr common::ExpressionType type_ = common::ExpressionType::SUBQUERY;
+
+public:
+    ParsedSubqueryExpression(common::SubqueryType subqueryType, std::string rawName)
+        : ParsedExpression{type_, std::move(rawName)}, subqueryType{subqueryType} {}
+
+    common::SubqueryType getSubqueryType() const { return subqueryType; }
+
+    void addPatternElement(PatternElement element) {
+        patternElements.push_back(std::move(element));
+    }
+    void setPatternElements(std::vector<PatternElement> elements) {
+        patternElements = std::move(elements);
+    }
+    const std::vector<PatternElement>& getPatternElements() const { return patternElements; }
+
+    void setWhereClause(std::unique_ptr<ParsedExpression> expression) {
+        whereClause = std::move(expression);
+    }
+    bool hasWhereClause() const { return whereClause != nullptr; }
+    const ParsedExpression* getWhereClause() const { return whereClause.get(); }
+
+    void setHint(std::shared_ptr<JoinHintNode> root) { hintRoot = std::move(root); }
+    bool hasHint() const { return hintRoot != nullptr; }
+    std::shared_ptr<JoinHintNode> getHint() const { return hintRoot; }
+
+    static std::unique_ptr<ParsedSubqueryExpression> deserialize(common::Deserializer&) {
+        KU_UNREACHABLE;
+    }
+
+    std::unique_ptr<ParsedExpression> copy() const override { KU_UNREACHABLE; }
+
+private:
+    void serializeInternal(common::Serializer&) const override { KU_UNREACHABLE; }
+
+private:
+    common::SubqueryType subqueryType;
+    std::vector<PatternElement> patternElements;
+    std::unique_ptr<ParsedExpression> whereClause;
+    std::shared_ptr<JoinHintNode> hintRoot = nullptr;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_variable_expression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_variable_expression.h
new file mode 100644
index 0000000000..9fad8f019b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/expression/parsed_variable_expression.h
@@ -0,0 +1,46 @@
+#pragma once
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class ParsedVariableExpression : public ParsedExpression {
+public:
+    ParsedVariableExpression(std::string variableName, std::string raw)
+        : ParsedExpression{common::ExpressionType::VARIABLE, std::move(raw)},
+          variableName{std::move(variableName)} {}
+
+    ParsedVariableExpression(std::string alias, std::string rawName, parsed_expr_vector children,
+        std::string variableName)
+        : ParsedExpression{common::ExpressionType::VARIABLE, std::move(alias), std::move(rawName),
+              std::move(children)},
+          variableName{std::move(variableName)} {}
+
+    explicit ParsedVariableExpression(std::string variableName)
+        : ParsedExpression{common::ExpressionType::VARIABLE},
+          variableName{std::move(variableName)} {}
+
+    inline std::string getVariableName() const { return variableName; }
+
+    static std::unique_ptr<ParsedVariableExpression> deserialize(
+        common::Deserializer& deserializer);
+
+    inline std::unique_ptr<ParsedExpression> copy() const override {
+        return std::make_unique<ParsedVariableExpression>(alias, rawName, copyVector(children),
+            variableName);
+    }
+
+private:
+    inline void serializeInternal(common::Serializer& serializer) const override {
+        serializer.serializeValue(variableName);
+    }
+
+private:
+    std::string variableName;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/extension_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/extension_statement.h
new file mode 100644
index 0000000000..6b99c8c1bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/extension_statement.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "extension/extension_action.h"
+#include "statement.h"
+
+namespace lbug {
+namespace parser {
+
+using namespace lbug::extension;
+
+class ExtensionStatement final : public Statement {
+public:
+    explicit ExtensionStatement(std::unique_ptr<ExtensionAuxInfo> info)
+        : Statement{common::StatementType::EXTENSION}, info{std::move(info)} {}
+
+    std::unique_ptr<ExtensionAuxInfo> getAuxInfo() const { return info->copy(); }
+
+private:
+    std::unique_ptr<ExtensionAuxInfo> info;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/parsed_data/attach_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/parsed_data/attach_info.h
new file mode 100644
index 0000000000..305b84b393
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/parsed_data/attach_info.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include <string>
+
+#include "parser/expression/parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+struct AttachInfo {
+    AttachInfo(std::string dbPath, std::string dbAlias, std::string dbType, options_t options)
+        : dbPath{std::move(dbPath)}, dbAlias{std::move(dbAlias)}, dbType{std::move(dbType)},
+          options{std::move(options)} {}
+
+    std::string dbPath, dbAlias, dbType;
+    options_t options;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/parsed_statement_visitor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/parsed_statement_visitor.h
new file mode 100644
index 0000000000..701e5635a2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/parsed_statement_visitor.h
@@ -0,0 +1,66 @@
+#pragma once
+
+#include "statement.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace parser {
+
+class SingleQuery;
+class QueryPart;
+class ReadingClause;
+class UpdatingClause;
+class WithClause;
+class ReturnClause;
+
+class StatementVisitor {
+public:
+    StatementVisitor() = default;
+    virtual ~StatementVisitor() = default;
+
+    void visit(const Statement& statement);
+
+private:
+    // LCOV_EXCL_START
+    virtual void visitQuery(const Statement& statement);
+    virtual void visitSingleQuery(const SingleQuery* singleQuery);
+    virtual void visitQueryPart(const QueryPart* queryPart);
+    virtual void visitReadingClause(const ReadingClause* readingClause);
+    virtual void visitMatch(const ReadingClause* /*readingClause*/) {}
+    virtual void visitUnwind(const ReadingClause* /*readingClause*/) {}
+    virtual void visitInQueryCall(const ReadingClause* /*readingClause*/) {}
+    virtual void visitLoadFrom(const ReadingClause* /*readingClause*/) {}
+    virtual void visitUpdatingClause(const UpdatingClause* /*updatingClause*/);
+    virtual void visitSet(const UpdatingClause* /*updatingClause*/) {}
+    virtual void visitDelete(const UpdatingClause* /*updatingClause*/) {}
+    virtual void visitInsert(const UpdatingClause* /*updatingClause*/) {}
+    virtual void visitMerge(const UpdatingClause* /*updatingClause*/) {}
+    virtual void visitWithClause(const WithClause* /*withClause*/) {}
+    virtual void visitReturnClause(const ReturnClause* /*returnClause*/) {}
+
+    virtual void visitCreateSequence(const Statement& /*statement*/) {}
+    virtual void visitDrop(const Statement& /*statement*/) {}
+    virtual void visitCreateTable(const Statement& /*statement*/) {}
+    virtual void visitCreateType(const Statement& /*statement*/) {}
+    virtual void visitAlter(const Statement& /*statement*/) {}
+    virtual void visitCopyFrom(const Statement& /*statement*/) {}
+    virtual void visitCopyTo(const Statement& /*statement*/) {}
+    virtual void visitStandaloneCall(const Statement& /*statement*/) {}
+    virtual void visitExplain(const Statement& /*statement*/);
+    virtual void visitCreateMacro(const Statement& /*statement*/) {}
+    virtual void visitTransaction(const Statement& /*statement*/) {}
+    virtual void visitExtension(const Statement& /*statement*/) {}
+    virtual void visitExportDatabase(const Statement& /*statement*/) {}
+    virtual void visitImportDatabase(const Statement& /*statement*/) {}
+    virtual void visitAttachDatabase(const Statement& /*statement*/) {}
+    virtual void visitDetachDatabase(const Statement& /*statement*/) {}
+    virtual void visitUseDatabase(const Statement& /*statement*/) {}
+    virtual void visitStandaloneCallFunction(const Statement& /*statement*/) {}
+    virtual void visitExtensionClause(const Statement& /*statement*/) {}
+    // LCOV_EXCL_STOP
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/parser.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/parser.h
new file mode 100644
index 0000000000..1fc75d2085
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/parser.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include <memory>
+#include <string_view>
+#include <vector>
+
+#include "extension/transformer_extension.h"
+#include "statement.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace parser {
+
+class Parser {
+
+public:
+    LBUG_API static std::vector<std::shared_ptr<Statement>> parseQuery(std::string_view query,
+        std::vector<extension::TransformerExtension*> transformerExtensions = {});
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/port_db.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/port_db.h
new file mode 100644
index 0000000000..5a4f13f32a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/port_db.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include "parser/expression/parsed_expression.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class ExportDB : public Statement {
+public:
+    explicit ExportDB(std::string filePath)
+        : Statement{common::StatementType::EXPORT_DATABASE}, filePath{std::move(filePath)} {}
+
+    inline void setParsingOption(options_t options) { parsingOptions = std::move(options); }
+    inline const options_t& getParsingOptionsRef() const { return parsingOptions; }
+    inline std::string getFilePath() const { return filePath; }
+
+private:
+    options_t parsingOptions;
+    std::string filePath;
+};
+
+class ImportDB : public Statement {
+public:
+    explicit ImportDB(std::string filePath)
+        : Statement{common::StatementType::IMPORT_DATABASE}, filePath{std::move(filePath)} {}
+
+    inline std::string getFilePath() const { return filePath; }
+
+private:
+    std::string filePath;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/node_pattern.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/node_pattern.h
new file mode 100644
index 0000000000..e88a85d6f1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/node_pattern.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include <string>
+
+#include "parser/expression/parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class NodePattern {
+public:
+    NodePattern(std::string name, std::vector<std::string> tableNames,
+        std::vector<s_parsed_expr_pair> propertyKeyVals)
+        : variableName{std::move(name)}, tableNames{std::move(tableNames)},
+          propertyKeyVals{std::move(propertyKeyVals)} {}
+    DELETE_COPY_DEFAULT_MOVE(NodePattern);
+
+    virtual ~NodePattern() = default;
+
+    inline std::string getVariableName() const { return variableName; }
+
+    inline std::vector<std::string> getTableNames() const { return tableNames; }
+
+    inline const std::vector<s_parsed_expr_pair>& getPropertyKeyVals() const {
+        return propertyKeyVals;
+    }
+
+protected:
+    std::string variableName;
+    std::vector<std::string> tableNames;
+    std::vector<s_parsed_expr_pair> propertyKeyVals;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/pattern_element.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/pattern_element.h
new file mode 100644
index 0000000000..8006a5ed37
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/pattern_element.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include <vector>
+
+#include "pattern_element_chain.h"
+
+namespace lbug {
+namespace parser {
+
+class PatternElement {
+public:
+    explicit PatternElement(NodePattern nodePattern) : nodePattern{std::move(nodePattern)} {}
+    DELETE_COPY_DEFAULT_MOVE(PatternElement);
+
+    inline void setPathName(std::string name) { pathName = std::move(name); }
+    inline bool hasPathName() const { return !pathName.empty(); }
+    inline std::string getPathName() const { return pathName; }
+
+    inline const NodePattern* getFirstNodePattern() const { return &nodePattern; }
+
+    inline void addPatternElementChain(PatternElementChain chain) {
+        patternElementChains.push_back(std::move(chain));
+    }
+    inline uint32_t getNumPatternElementChains() const { return patternElementChains.size(); }
+    inline const PatternElementChain* getPatternElementChain(uint32_t idx) const {
+        return &patternElementChains[idx];
+    }
+
+private:
+    std::string pathName;
+    NodePattern nodePattern;
+    std::vector<PatternElementChain> patternElementChains;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/pattern_element_chain.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/pattern_element_chain.h
new file mode 100644
index 0000000000..2815a62399
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/pattern_element_chain.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "rel_pattern.h"
+
+namespace lbug {
+namespace parser {
+
+class PatternElementChain {
+public:
+    PatternElementChain(RelPattern relPattern, NodePattern nodePattern)
+        : relPattern{std::move(relPattern)}, nodePattern{std::move(nodePattern)} {}
+    DELETE_COPY_DEFAULT_MOVE(PatternElementChain);
+
+    inline const RelPattern* getRelPattern() const { return &relPattern; }
+
+    inline const NodePattern* getNodePattern() const { return &nodePattern; }
+
+private:
+    RelPattern relPattern;
+    NodePattern nodePattern;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/rel_pattern.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/rel_pattern.h
new file mode 100644
index 0000000000..17151fab33
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/graph_pattern/rel_pattern.h
@@ -0,0 +1,50 @@
+#pragma once
+
+#include "common/copy_constructors.h"
+#include "common/enums/query_rel_type.h"
+#include "node_pattern.h"
+
+namespace lbug {
+namespace parser {
+
+enum class ArrowDirection : uint8_t { LEFT = 0, RIGHT = 1, BOTH = 2 };
+
+struct RecursiveRelPatternInfo {
+    std::string lowerBound;
+    std::string upperBound;
+    std::string weightPropertyName;
+    std::string relName;
+    std::string nodeName;
+    std::unique_ptr<ParsedExpression> whereExpression = nullptr;
+    bool hasProjection = false;
+    parsed_expr_vector relProjectionList;
+    parsed_expr_vector nodeProjectionList;
+
+    RecursiveRelPatternInfo() = default;
+    DELETE_COPY_DEFAULT_MOVE(RecursiveRelPatternInfo);
+};
+
+class RelPattern : public NodePattern {
+public:
+    RelPattern(std::string name, std::vector<std::string> tableNames, common::QueryRelType relType,
+        ArrowDirection arrowDirection, std::vector<s_parsed_expr_pair> propertyKeyValPairs,
+        RecursiveRelPatternInfo recursiveInfo)
+        : NodePattern{std::move(name), std::move(tableNames), std::move(propertyKeyValPairs)},
+          relType{relType}, arrowDirection{arrowDirection},
+          recursiveInfo{std::move(recursiveInfo)} {}
+    DELETE_COPY_DEFAULT_MOVE(RelPattern);
+
+    common::QueryRelType getRelType() const { return relType; }
+
+    ArrowDirection getDirection() const { return arrowDirection; }
+
+    const RecursiveRelPatternInfo* getRecursiveInfo() const { return &recursiveInfo; }
+
+private:
+    common::QueryRelType relType;
+    ArrowDirection arrowDirection;
+    RecursiveRelPatternInfo recursiveInfo;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/query_part.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/query_part.h
new file mode 100644
index 0000000000..9c4404d473
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/query_part.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "parser/query/reading_clause/reading_clause.h"
+#include "parser/query/return_with_clause/with_clause.h"
+#include "parser/query/updating_clause/updating_clause.h"
+
+namespace lbug {
+namespace parser {
+
+class QueryPart {
+public:
+    explicit QueryPart(WithClause withClause) : withClause{std::move(withClause)} {}
+
+    inline uint32_t getNumUpdatingClauses() const { return updatingClauses.size(); }
+    inline UpdatingClause* getUpdatingClause(uint32_t idx) const {
+        return updatingClauses[idx].get();
+    }
+    inline void addUpdatingClause(std::unique_ptr<UpdatingClause> updatingClause) {
+        updatingClauses.push_back(std::move(updatingClause));
+    }
+
+    inline uint32_t getNumReadingClauses() const { return readingClauses.size(); }
+    inline ReadingClause* getReadingClause(uint32_t idx) const { return readingClauses[idx].get(); }
+    inline void addReadingClause(std::unique_ptr<ReadingClause> readingClause) {
+        readingClauses.push_back(std::move(readingClause));
+    }
+
+    inline const WithClause* getWithClause() const { return &withClause; }
+
+private:
+    std::vector<std::unique_ptr<ReadingClause>> readingClauses;
+    std::vector<std::unique_ptr<UpdatingClause>> updatingClauses;
+    WithClause withClause;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/in_query_call_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/in_query_call_clause.h
new file mode 100644
index 0000000000..1f1236cbad
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/in_query_call_clause.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "parser/query/reading_clause/reading_clause.h"
+#include "yield_variable.h"
+
+namespace lbug {
+namespace parser {
+
+class InQueryCallClause final : public ReadingClause {
+    static constexpr common::ClauseType clauseType_ = common::ClauseType::IN_QUERY_CALL;
+
+public:
+    InQueryCallClause(std::unique_ptr<ParsedExpression> functionExpression,
+        std::vector<YieldVariable> yieldClause)
+        : ReadingClause{clauseType_}, functionExpression{std::move(functionExpression)},
+          yieldVariables{std::move(yieldClause)} {}
+
+    const ParsedExpression* getFunctionExpression() const { return functionExpression.get(); }
+
+    const std::vector<YieldVariable>& getYieldVariables() const { return yieldVariables; }
+
+private:
+    std::unique_ptr<ParsedExpression> functionExpression;
+    std::vector<YieldVariable> yieldVariables;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/join_hint.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/join_hint.h
new file mode 100644
index 0000000000..06909ae62e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/join_hint.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include <memory>
+#include <vector>
+
+namespace lbug {
+namespace parser {
+
+struct JoinHintNode {
+    std::string variableName;
+    std::vector<std::shared_ptr<JoinHintNode>> children;
+
+    JoinHintNode() = default;
+    explicit JoinHintNode(std::string name) : variableName{std::move(name)} {}
+    void addChild(std::shared_ptr<JoinHintNode> child) { children.push_back(std::move(child)); }
+    bool isLeaf() const { return children.empty(); }
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/load_from.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/load_from.h
new file mode 100644
index 0000000000..1716d83517
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/load_from.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "parser/ddl/parsed_property_definition.h"
+#include "parser/expression/parsed_expression.h"
+#include "parser/scan_source.h"
+#include "reading_clause.h"
+
+namespace lbug {
+namespace parser {
+
+class LoadFrom : public ReadingClause {
+    static constexpr common::ClauseType clauseType_ = common::ClauseType::LOAD_FROM;
+
+public:
+    explicit LoadFrom(std::unique_ptr<BaseScanSource> source)
+        : ReadingClause{clauseType_}, source{std::move(source)} {}
+
+    BaseScanSource* getSource() const { return source.get(); }
+
+    void setParingOptions(options_t options) { parsingOptions = std::move(options); }
+    const options_t& getParsingOptions() const { return parsingOptions; }
+
+    void setPropertyDefinitions(std::vector<ParsedColumnDefinition> definitions) {
+        columnDefinitions = std::move(definitions);
+    }
+    const std::vector<ParsedColumnDefinition>& getColumnDefinitions() const {
+        return columnDefinitions;
+    }
+
+private:
+    std::unique_ptr<BaseScanSource> source;
+    std::vector<ParsedColumnDefinition> columnDefinitions;
+    options_t parsingOptions;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/match_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/match_clause.h
new file mode 100644
index 0000000000..e86558665e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/match_clause.h
@@ -0,0 +1,34 @@
+#pragma once
+
+#include "join_hint.h"
+#include "parser/query/graph_pattern/pattern_element.h"
+#include "reading_clause.h"
+
+namespace lbug {
+namespace parser {
+
+class MatchClause : public ReadingClause {
+    static constexpr common::ClauseType clauseType_ = common::ClauseType::MATCH;
+
+public:
+    MatchClause(std::vector<PatternElement> patternElements,
+        common::MatchClauseType matchClauseType)
+        : ReadingClause{clauseType_}, patternElements{std::move(patternElements)},
+          matchClauseType{matchClauseType} {}
+
+    const std::vector<PatternElement>& getPatternElementsRef() const { return patternElements; }
+
+    common::MatchClauseType getMatchClauseType() const { return matchClauseType; }
+
+    void setHint(std::shared_ptr<JoinHintNode> root) { hintRoot = std::move(root); }
+    bool hasHint() const { return hintRoot != nullptr; }
+    std::shared_ptr<JoinHintNode> getHint() const { return hintRoot; }
+
+private:
+    std::vector<PatternElement> patternElements;
+    common::MatchClauseType matchClauseType;
+    std::shared_ptr<JoinHintNode> hintRoot = nullptr;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/reading_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/reading_clause.h
new file mode 100644
index 0000000000..ad050115e3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/reading_clause.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "common/cast.h"
+#include "common/enums/clause_type.h"
+#include "parser/expression/parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class ReadingClause {
+public:
+    explicit ReadingClause(common::ClauseType clauseType) : clauseType{clauseType} {};
+    virtual ~ReadingClause() = default;
+
+    common::ClauseType getClauseType() const { return clauseType; }
+
+    void setWherePredicate(std::unique_ptr<ParsedExpression> expression) {
+        wherePredicate = std::move(expression);
+    }
+    bool hasWherePredicate() const { return wherePredicate != nullptr; }
+    const ParsedExpression* getWherePredicate() const { return wherePredicate.get(); }
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+private:
+    common::ClauseType clauseType;
+    std::unique_ptr<ParsedExpression> wherePredicate;
+};
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/unwind_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/unwind_clause.h
new file mode 100644
index 0000000000..e731d693a2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/unwind_clause.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include "parser/expression/parsed_expression.h"
+#include "reading_clause.h"
+
+namespace lbug {
+namespace parser {
+
+class UnwindClause : public ReadingClause {
+    static constexpr common::ClauseType clauseType_ = common::ClauseType::UNWIND;
+
+public:
+    UnwindClause(std::unique_ptr<ParsedExpression> expression, std::string listAlias)
+        : ReadingClause{clauseType_}, expression{std::move(expression)},
+          alias{std::move(listAlias)} {}
+
+    const ParsedExpression* getExpression() const { return expression.get(); }
+
+    std::string getAlias() const { return alias; }
+
+private:
+    std::unique_ptr<ParsedExpression> expression;
+    std::string alias;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/yield_variable.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/yield_variable.h
new file mode 100644
index 0000000000..9e49fa1082
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/reading_clause/yield_variable.h
@@ -0,0 +1,17 @@
+#pragma once
+#include <string>
+
+namespace lbug {
+namespace parser {
+
+struct YieldVariable {
+    std::string name;
+    std::string alias;
+
+    YieldVariable(std::string name, std::string alias)
+        : name{std::move(name)}, alias{std::move(alias)} {}
+    bool hasAlias() const { return alias != ""; }
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/regular_query.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/regular_query.h
new file mode 100644
index 0000000000..f76922dbe1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/regular_query.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "parser/statement.h"
+#include "single_query.h"
+
+namespace lbug {
+namespace parser {
+
+class RegularQuery : public Statement {
+    static constexpr common::StatementType type_ = common::StatementType::QUERY;
+
+public:
+    explicit RegularQuery(SingleQuery singleQuery) : Statement{type_} {
+        singleQueries.push_back(std::move(singleQuery));
+    }
+
+    void addSingleQuery(SingleQuery singleQuery, bool isUnionAllQuery) {
+        singleQueries.push_back(std::move(singleQuery));
+        isUnionAll.push_back(isUnionAllQuery);
+    }
+
+    common::idx_t getNumSingleQueries() const { return singleQueries.size(); }
+
+    const SingleQuery* getSingleQuery(common::idx_t singleQueryIdx) const {
+        return &singleQueries[singleQueryIdx];
+    }
+
+    std::vector<bool> getIsUnionAll() const { return isUnionAll; }
+
+private:
+    std::vector<SingleQuery> singleQueries;
+    std::vector<bool> isUnionAll;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/return_with_clause/projection_body.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/return_with_clause/projection_body.h
new file mode 100644
index 0000000000..66d573c25f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/return_with_clause/projection_body.h
@@ -0,0 +1,56 @@
+#pragma once
+
+#include "common/copy_constructors.h"
+#include "parser/expression/parsed_expression.h"
+
+namespace lbug {
+namespace parser {
+
+class ProjectionBody {
+public:
+    ProjectionBody(bool isDistinct,
+        std::vector<std::unique_ptr<ParsedExpression>> projectionExpressions)
+        : isDistinct{isDistinct}, projectionExpressions{std::move(projectionExpressions)} {}
+    DELETE_COPY_DEFAULT_MOVE(ProjectionBody);
+
+    inline bool getIsDistinct() const { return isDistinct; }
+
+    inline const std::vector<std::unique_ptr<ParsedExpression>>& getProjectionExpressions() const {
+        return projectionExpressions;
+    }
+
+    inline void setOrderByExpressions(std::vector<std::unique_ptr<ParsedExpression>> expressions,
+        std::vector<bool> sortOrders) {
+        orderByExpressions = std::move(expressions);
+        isAscOrders = std::move(sortOrders);
+    }
+    inline bool hasOrderByExpressions() const { return !orderByExpressions.empty(); }
+    inline const std::vector<std::unique_ptr<ParsedExpression>>& getOrderByExpressions() const {
+        return orderByExpressions;
+    }
+
+    inline std::vector<bool> getSortOrders() const { return isAscOrders; }
+
+    inline void setSkipExpression(std::unique_ptr<ParsedExpression> expression) {
+        skipExpression = std::move(expression);
+    }
+    inline bool hasSkipExpression() const { return skipExpression != nullptr; }
+    inline ParsedExpression* getSkipExpression() const { return skipExpression.get(); }
+
+    inline void setLimitExpression(std::unique_ptr<ParsedExpression> expression) {
+        limitExpression = std::move(expression);
+    }
+    inline bool hasLimitExpression() const { return limitExpression != nullptr; }
+    inline ParsedExpression* getLimitExpression() const { return limitExpression.get(); }
+
+private:
+    bool isDistinct;
+    std::vector<std::unique_ptr<ParsedExpression>> projectionExpressions;
+    std::vector<std::unique_ptr<ParsedExpression>> orderByExpressions;
+    std::vector<bool> isAscOrders;
+    std::unique_ptr<ParsedExpression> skipExpression;
+    std::unique_ptr<ParsedExpression> limitExpression;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/return_with_clause/return_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/return_with_clause/return_clause.h
new file mode 100644
index 0000000000..3e05fae542
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/return_with_clause/return_clause.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "projection_body.h"
+
+namespace lbug {
+namespace parser {
+
+class ReturnClause {
+public:
+    explicit ReturnClause(ProjectionBody projectionBody)
+        : projectionBody{std::move(projectionBody)} {}
+    DELETE_COPY_DEFAULT_MOVE(ReturnClause);
+
+    virtual ~ReturnClause() = default;
+
+    inline const ProjectionBody* getProjectionBody() const { return &projectionBody; }
+
+private:
+    ProjectionBody projectionBody;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/return_with_clause/with_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/return_with_clause/with_clause.h
new file mode 100644
index 0000000000..0d611aefca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/return_with_clause/with_clause.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "return_clause.h"
+
+namespace lbug {
+namespace parser {
+
+class WithClause : public ReturnClause {
+public:
+    explicit WithClause(ProjectionBody projectionBody) : ReturnClause{std::move(projectionBody)} {}
+    DELETE_COPY_DEFAULT_MOVE(WithClause);
+
+    inline void setWhereExpression(std::unique_ptr<ParsedExpression> expression) {
+        whereExpression = std::move(expression);
+    }
+
+    inline bool hasWhereExpression() const { return whereExpression != nullptr; }
+
+    inline ParsedExpression* getWhereExpression() const { return whereExpression.get(); }
+
+private:
+    std::unique_ptr<ParsedExpression> whereExpression;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/single_query.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/single_query.h
new file mode 100644
index 0000000000..a16225c8cc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/single_query.h
@@ -0,0 +1,50 @@
+#pragma once
+
+#include <optional>
+
+#include "common/assert.h"
+#include "common/copy_constructors.h"
+#include "query_part.h"
+
+namespace lbug {
+namespace parser {
+
+class SingleQuery {
+public:
+    SingleQuery() = default;
+    DELETE_COPY_DEFAULT_MOVE(SingleQuery);
+
+    inline void addQueryPart(QueryPart queryPart) { queryParts.push_back(std::move(queryPart)); }
+    inline uint32_t getNumQueryParts() const { return queryParts.size(); }
+    inline const QueryPart* getQueryPart(uint32_t idx) const { return &queryParts[idx]; }
+
+    inline uint32_t getNumUpdatingClauses() const { return updatingClauses.size(); }
+    inline UpdatingClause* getUpdatingClause(uint32_t idx) const {
+        return updatingClauses[idx].get();
+    }
+    inline void addUpdatingClause(std::unique_ptr<UpdatingClause> updatingClause) {
+        updatingClauses.push_back(std::move(updatingClause));
+    }
+
+    inline uint32_t getNumReadingClauses() const { return readingClauses.size(); }
+    inline ReadingClause* getReadingClause(uint32_t idx) const { return readingClauses[idx].get(); }
+    inline void addReadingClause(std::unique_ptr<ReadingClause> readingClause) {
+        readingClauses.push_back(std::move(readingClause));
+    }
+
+    inline void setReturnClause(ReturnClause clause) { returnClause = std::move(clause); }
+    inline bool hasReturnClause() const { return returnClause.has_value(); }
+    inline const ReturnClause* getReturnClause() const {
+        KU_ASSERT(returnClause.has_value());
+        return &returnClause.value();
+    }
+
+private:
+    std::vector<QueryPart> queryParts;
+    std::vector<std::unique_ptr<ReadingClause>> readingClauses;
+    std::vector<std::unique_ptr<UpdatingClause>> updatingClauses;
+    std::optional<ReturnClause> returnClause;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/delete_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/delete_clause.h
new file mode 100644
index 0000000000..7fca67dffa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/delete_clause.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "common/enums/delete_type.h"
+#include "parser/expression/parsed_expression.h"
+#include "updating_clause.h"
+
+namespace lbug {
+namespace parser {
+
+class DeleteClause final : public UpdatingClause {
+public:
+    explicit DeleteClause(common::DeleteNodeType deleteType)
+        : UpdatingClause{common::ClauseType::DELETE_}, deleteType{deleteType} {};
+
+    void addExpression(std::unique_ptr<ParsedExpression> expression) {
+        expressions.push_back(std::move(expression));
+    }
+    common::DeleteNodeType getDeleteClauseType() const { return deleteType; }
+    uint32_t getNumExpressions() const { return expressions.size(); }
+    ParsedExpression* getExpression(uint32_t idx) const { return expressions[idx].get(); }
+
+private:
+    common::DeleteNodeType deleteType;
+    parsed_expr_vector expressions;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/insert_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/insert_clause.h
new file mode 100644
index 0000000000..0ed44ed946
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/insert_clause.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "parser/query/graph_pattern/pattern_element.h"
+#include "updating_clause.h"
+
+namespace lbug {
+namespace parser {
+
+class InsertClause final : public UpdatingClause {
+public:
+    explicit InsertClause(std::vector<PatternElement> patternElements)
+        : UpdatingClause{common::ClauseType::INSERT},
+          patternElements{std::move(patternElements)} {};
+
+    inline const std::vector<PatternElement>& getPatternElementsRef() const {
+        return patternElements;
+    }
+
+private:
+    std::vector<PatternElement> patternElements;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/merge_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/merge_clause.h
new file mode 100644
index 0000000000..fd76143e8d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/merge_clause.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include "parser/query/graph_pattern/pattern_element.h"
+#include "updating_clause.h"
+
+namespace lbug {
+namespace parser {
+
+class MergeClause final : public UpdatingClause {
+public:
+    explicit MergeClause(std::vector<PatternElement> patternElements)
+        : UpdatingClause{common::ClauseType::MERGE}, patternElements{std::move(patternElements)} {}
+
+    inline const std::vector<PatternElement>& getPatternElementsRef() const {
+        return patternElements;
+    }
+    inline void addOnMatchSetItems(parsed_expr_pair setItem) {
+        onMatchSetItems.push_back(std::move(setItem));
+    }
+    inline bool hasOnMatchSetItems() const { return !onMatchSetItems.empty(); }
+    inline const std::vector<parsed_expr_pair>& getOnMatchSetItemsRef() const {
+        return onMatchSetItems;
+    }
+
+    inline void addOnCreateSetItems(parsed_expr_pair setItem) {
+        onCreateSetItems.push_back(std::move(setItem));
+    }
+    inline bool hasOnCreateSetItems() const { return !onCreateSetItems.empty(); }
+    inline const std::vector<parsed_expr_pair>& getOnCreateSetItemsRef() const {
+        return onCreateSetItems;
+    }
+
+private:
+    std::vector<PatternElement> patternElements;
+    std::vector<parsed_expr_pair> onMatchSetItems;
+    std::vector<parsed_expr_pair> onCreateSetItems;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/set_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/set_clause.h
new file mode 100644
index 0000000000..97abdad3aa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/set_clause.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "parser/expression/parsed_expression.h"
+#include "updating_clause.h"
+
+namespace lbug {
+namespace parser {
+
+class SetClause final : public UpdatingClause {
+public:
+    SetClause() : UpdatingClause{common::ClauseType::SET} {};
+
+    inline void addSetItem(parsed_expr_pair setItem) { setItems.push_back(std::move(setItem)); }
+    inline const std::vector<parsed_expr_pair>& getSetItemsRef() const { return setItems; }
+
+private:
+    std::vector<parsed_expr_pair> setItems;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/updating_clause.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/updating_clause.h
new file mode 100644
index 0000000000..67b25f90af
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/query/updating_clause/updating_clause.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "common/cast.h"
+#include "common/enums/clause_type.h"
+
+namespace lbug {
+namespace parser {
+
+class UpdatingClause {
+public:
+    explicit UpdatingClause(common::ClauseType clauseType) : clauseType{clauseType} {};
+    virtual ~UpdatingClause() = default;
+
+    common::ClauseType getClauseType() const { return clauseType; }
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+private:
+    common::ClauseType clauseType;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/scan_source.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/scan_source.h
new file mode 100644
index 0000000000..cd3c688380
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/scan_source.h
@@ -0,0 +1,72 @@
+#pragma once
+
+#include <memory>
+#include <string>
+#include <vector>
+
+#include "common/copy_constructors.h"
+#include "common/enums/scan_source_type.h"
+#include "expression/parsed_expression.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+struct BaseScanSource {
+    common::ScanSourceType type;
+
+    explicit BaseScanSource(common::ScanSourceType type) : type{type} {}
+    virtual ~BaseScanSource() = default;
+    DELETE_COPY_AND_MOVE(BaseScanSource);
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+};
+
+struct ParameterScanSource : public BaseScanSource {
+    std::unique_ptr<ParsedExpression> paramExpression;
+
+    explicit ParameterScanSource(std::unique_ptr<ParsedExpression> paramExpression)
+        : BaseScanSource{common::ScanSourceType::PARAM},
+          paramExpression{std::move(paramExpression)} {}
+};
+
+struct FileScanSource : public BaseScanSource {
+    std::vector<std::string> filePaths;
+
+    explicit FileScanSource(std::vector<std::string> paths)
+        : BaseScanSource{common::ScanSourceType::FILE}, filePaths{std::move(paths)} {}
+};
+
+struct ObjectScanSource : public BaseScanSource {
+    // If multiple object presents, assuming they have a nested structure.
+    // E.g. for postgres.person, objectNames should be [postgres, person]
+    std::vector<std::string> objectNames;
+
+    explicit ObjectScanSource(std::vector<std::string> objectNames)
+        : BaseScanSource{common::ScanSourceType::OBJECT}, objectNames{std::move(objectNames)} {}
+};
+
+struct QueryScanSource : public BaseScanSource {
+    std::unique_ptr<Statement> statement;
+
+    explicit QueryScanSource(std::unique_ptr<Statement> statement)
+        : BaseScanSource{common::ScanSourceType::QUERY}, statement{std::move(statement)} {}
+};
+
+struct TableFuncScanSource : public BaseScanSource {
+    std::unique_ptr<ParsedExpression> functionExpression = nullptr;
+
+    explicit TableFuncScanSource(std::unique_ptr<ParsedExpression> functionExpression)
+        : BaseScanSource{common::ScanSourceType::TABLE_FUNC},
+          functionExpression{std::move(functionExpression)} {}
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/standalone_call.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/standalone_call.h
new file mode 100644
index 0000000000..03e635716f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/standalone_call.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "parser/expression/parsed_expression.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class StandaloneCall : public Statement {
+public:
+    explicit StandaloneCall(std::string optionName, std::unique_ptr<ParsedExpression> optionValue)
+        : Statement{common::StatementType::STANDALONE_CALL}, optionName{std::move(optionName)},
+          optionValue{std::move(optionValue)} {}
+
+    std::string getOptionName() const { return optionName; }
+
+    ParsedExpression* getOptionValue() const { return optionValue.get(); }
+
+private:
+    std::string optionName;
+    std::unique_ptr<ParsedExpression> optionValue;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/standalone_call_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/standalone_call_function.h
new file mode 100644
index 0000000000..372dd7c79a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/standalone_call_function.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "parser/expression/parsed_expression.h"
+#include "parser/statement.h"
+
+namespace lbug {
+namespace parser {
+
+class StandaloneCallFunction : public Statement {
+public:
+    explicit StandaloneCallFunction(std::unique_ptr<ParsedExpression> functionExpression)
+        : Statement{common::StatementType::STANDALONE_CALL_FUNCTION},
+          functionExpression{std::move(functionExpression)} {}
+
+    const ParsedExpression* getFunctionExpression() const { return functionExpression.get(); }
+
+private:
+    std::unique_ptr<ParsedExpression> functionExpression;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/statement.h
new file mode 100644
index 0000000000..8e63760a4e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/statement.h
@@ -0,0 +1,55 @@
+#pragma once
+
+#include "common/cast.h"
+#include "common/enums/statement_type.h"
+
+namespace lbug {
+namespace parser {
+
+class Statement {
+public:
+    explicit Statement(common::StatementType statementType)
+        : parsingTime{0}, statementType{statementType}, internal{false} {}
+
+    virtual ~Statement() = default;
+
+    common::StatementType getStatementType() const { return statementType; }
+    void setToInternal() { internal = true; }
+    bool isInternal() const { return internal; }
+    void setParsingTime(double time) { parsingTime = time; }
+    double getParsingTime() const { return parsingTime; }
+
+    bool requireTransaction() const {
+        switch (statementType) {
+        case common::StatementType::TRANSACTION:
+            return false;
+        default:
+            return true;
+        }
+    }
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+
+private:
+    double parsingTime;
+    common::StatementType statementType;
+    // By setting the statement to internal, we still execute the statement, but will not return the
+    // executio result as part of the query result returned to users.
+    // The use case for this is when a query internally generates other queries to finish first,
+    // e.g., `TableFunction::rewriteFunc`.
+    bool internal;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/transaction_statement.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/transaction_statement.h
new file mode 100644
index 0000000000..f12c69c8ef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/transaction_statement.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include "statement.h"
+#include "transaction/transaction_action.h"
+
+namespace lbug {
+namespace parser {
+
+class TransactionStatement : public Statement {
+    static constexpr common::StatementType statementType_ = common::StatementType::TRANSACTION;
+
+public:
+    explicit TransactionStatement(transaction::TransactionAction transactionAction)
+        : Statement{statementType_}, transactionAction{transactionAction} {}
+
+    transaction::TransactionAction getTransactionAction() const { return transactionAction; }
+
+private:
+    transaction::TransactionAction transactionAction;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/transformer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/transformer.h
new file mode 100644
index 0000000000..2919148b8a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/transformer.h
@@ -0,0 +1,261 @@
+#pragma once
+
+// ANTLR4 generates code with unused parameters.
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wunused-parameter"
+#include "cypher_parser.h"
+#pragma GCC diagnostic pop
+
+#include "common/enums/conflict_action.h"
+#include "extension/transformer_extension.h"
+#include "parser/ddl/parsed_property_definition.h"
+#include "statement.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace parser {
+
+class RegularQuery;
+class SingleQuery;
+class QueryPart;
+class UpdatingClause;
+class ReadingClause;
+class WithClause;
+class ReturnClause;
+class ProjectionBody;
+class PatternElement;
+class NodePattern;
+class PatternElementChain;
+class RelPattern;
+struct ParsedCaseAlternative;
+struct BaseScanSource;
+struct JoinHintNode;
+struct YieldVariable;
+
+class Transformer {
+public:
+    Transformer(CypherParser::Ku_StatementsContext& root,
+        std::vector<extension::TransformerExtension*> transformerExtensions)
+        : root{root}, transformerExtensions{std::move(transformerExtensions)} {}
+
+    std::vector<std::shared_ptr<Statement>> transform();
+
+    void registerTransformExtension(
+        std::unique_ptr<extension::TransformerExtension> transformerExtension);
+
+    std::unique_ptr<Statement> transformStatement(CypherParser::OC_StatementContext& ctx);
+
+    std::unique_ptr<ParsedExpression> transformWhere(CypherParser::OC_WhereContext& ctx);
+
+    static std::string transformVariable(CypherParser::OC_VariableContext& ctx);
+    std::string transformSchemaName(CypherParser::OC_SchemaNameContext& ctx);
+    static std::string transformSymbolicName(CypherParser::OC_SymbolicNameContext& ctx);
+    static std::string transformStringLiteral(antlr4::tree::TerminalNode& stringLiteral);
+    static common::ConflictAction transformConflictAction(CypherParser::KU_IfNotExistsContext* ctx);
+
+    // Transform copy statement.
+    std::unique_ptr<Statement> transformCopyTo(CypherParser::KU_CopyTOContext& ctx);
+    std::unique_ptr<Statement> transformCopyFrom(CypherParser::KU_CopyFromContext& ctx);
+    std::unique_ptr<Statement> transformCopyFromByColumn(
+        CypherParser::KU_CopyFromByColumnContext& ctx);
+    std::vector<std::string> transformColumnNames(CypherParser::KU_ColumnNamesContext& ctx);
+    std::vector<std::string> transformFilePaths(
+        const std::vector<antlr4::tree::TerminalNode*>& stringLiteral);
+    std::unique_ptr<BaseScanSource> transformScanSource(CypherParser::KU_ScanSourceContext& ctx);
+    options_t transformOptions(CypherParser::KU_OptionsContext& ctx);
+
+    std::unique_ptr<Statement> transformExportDatabase(CypherParser::KU_ExportDatabaseContext& ctx);
+    std::unique_ptr<Statement> transformImportDatabase(CypherParser::KU_ImportDatabaseContext& ctx);
+
+    // Transform query statement.
+    std::unique_ptr<Statement> transformQuery(CypherParser::OC_QueryContext& ctx);
+    std::unique_ptr<Statement> transformRegularQuery(CypherParser::OC_RegularQueryContext& ctx);
+    SingleQuery transformSingleQuery(CypherParser::OC_SingleQueryContext& ctx);
+    SingleQuery transformSinglePartQuery(CypherParser::OC_SinglePartQueryContext& ctx);
+    QueryPart transformQueryPart(CypherParser::KU_QueryPartContext& ctx);
+
+    // Transform updating.
+    std::unique_ptr<UpdatingClause> transformUpdatingClause(
+        CypherParser::OC_UpdatingClauseContext& ctx);
+    std::unique_ptr<UpdatingClause> transformCreate(CypherParser::OC_CreateContext& ctx);
+    std::unique_ptr<UpdatingClause> transformMerge(CypherParser::OC_MergeContext& ctx);
+    std::unique_ptr<UpdatingClause> transformSet(CypherParser::OC_SetContext& ctx);
+    parsed_expr_pair transformSetItem(CypherParser::OC_SetItemContext& ctx);
+    std::unique_ptr<UpdatingClause> transformDelete(CypherParser::OC_DeleteContext& ctx);
+
+    // Transform reading.
+    std::unique_ptr<ReadingClause> transformReadingClause(
+        CypherParser::OC_ReadingClauseContext& ctx);
+    std::unique_ptr<ReadingClause> transformMatch(CypherParser::OC_MatchContext& ctx);
+    std::unique_ptr<ReadingClause> transformUnwind(CypherParser::OC_UnwindContext& ctx);
+    std::vector<YieldVariable> transformYieldVariables(CypherParser::OC_YieldItemsContext& ctx);
+    std::unique_ptr<ReadingClause> transformInQueryCall(CypherParser::KU_InQueryCallContext& ctx);
+    std::unique_ptr<ReadingClause> transformLoadFrom(CypherParser::KU_LoadFromContext& ctx);
+    std::shared_ptr<JoinHintNode> transformJoinHint(CypherParser::KU_JoinNodeContext& ctx);
+
+    // Transform projection.
+    WithClause transformWith(CypherParser::OC_WithContext& ctx);
+    ReturnClause transformReturn(CypherParser::OC_ReturnContext& ctx);
+    ProjectionBody transformProjectionBody(CypherParser::OC_ProjectionBodyContext& ctx);
+    std::vector<std::unique_ptr<ParsedExpression>> transformProjectionItems(
+        CypherParser::OC_ProjectionItemsContext& ctx);
+    std::unique_ptr<ParsedExpression> transformProjectionItem(
+        CypherParser::OC_ProjectionItemContext& ctx);
+
+    // Transform graph pattern.
+    std::vector<PatternElement> transformPattern(CypherParser::OC_PatternContext& ctx);
+    PatternElement transformPatternPart(CypherParser::OC_PatternPartContext& ctx);
+    PatternElement transformAnonymousPatternPart(CypherParser::OC_AnonymousPatternPartContext& ctx);
+    PatternElement transformPatternElement(CypherParser::OC_PatternElementContext& ctx);
+    NodePattern transformNodePattern(CypherParser::OC_NodePatternContext& ctx);
+    PatternElementChain transformPatternElementChain(
+        CypherParser::OC_PatternElementChainContext& ctx);
+    RelPattern transformRelationshipPattern(CypherParser::OC_RelationshipPatternContext& ctx);
+    std::vector<s_parsed_expr_pair> transformProperties(CypherParser::KU_PropertiesContext& ctx);
+    std::vector<std::string> transformRelTypes(CypherParser::OC_RelationshipTypesContext& ctx);
+    std::vector<std::string> transformNodeLabels(CypherParser::OC_NodeLabelsContext& ctx);
+    std::string transformLabelName(CypherParser::OC_LabelNameContext& ctx);
+    std::string transformRelTypeName(CypherParser::OC_RelTypeNameContext& ctx);
+
+    // Transform expression.
+    std::unique_ptr<ParsedExpression> transformExpression(CypherParser::OC_ExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformOrExpression(
+        CypherParser::OC_OrExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformXorExpression(
+        CypherParser::OC_XorExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformAndExpression(
+        CypherParser::OC_AndExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformNotExpression(
+        CypherParser::OC_NotExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformComparisonExpression(
+        CypherParser::OC_ComparisonExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformBitwiseOrOperatorExpression(
+        CypherParser::KU_BitwiseOrOperatorExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformBitwiseAndOperatorExpression(
+        CypherParser::KU_BitwiseAndOperatorExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformBitShiftOperatorExpression(
+        CypherParser::KU_BitShiftOperatorExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformAddOrSubtractExpression(
+        CypherParser::OC_AddOrSubtractExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformMultiplyDivideModuloExpression(
+        CypherParser::OC_MultiplyDivideModuloExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformPowerOfExpression(
+        CypherParser::OC_PowerOfExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformUnaryAddSubtractOrFactorialExpression(
+        CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformStringListNullOperatorExpression(
+        CypherParser::OC_StringListNullOperatorExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformStringOperatorExpression(
+        CypherParser::OC_StringOperatorExpressionContext& ctx,
+        std::unique_ptr<ParsedExpression> propertyExpression);
+    std::unique_ptr<ParsedExpression> transformListOperatorExpression(
+        CypherParser::OC_ListOperatorExpressionContext& ctx,
+        std::unique_ptr<ParsedExpression> childExpression);
+    std::unique_ptr<ParsedExpression> transformNullOperatorExpression(
+        CypherParser::OC_NullOperatorExpressionContext& ctx,
+        std::unique_ptr<ParsedExpression> propertyExpression);
+    std::unique_ptr<ParsedExpression> transformPropertyOrLabelsExpression(
+        CypherParser::OC_PropertyOrLabelsExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformAtom(CypherParser::OC_AtomContext& ctx);
+    std::unique_ptr<ParsedExpression> transformLiteral(CypherParser::OC_LiteralContext& ctx);
+    std::unique_ptr<ParsedExpression> transformBooleanLiteral(
+        CypherParser::OC_BooleanLiteralContext& ctx);
+    std::unique_ptr<ParsedExpression> transformListLiteral(
+        CypherParser::OC_ListLiteralContext& ctx);
+    std::unique_ptr<ParsedExpression> transformStructLiteral(
+        CypherParser::KU_StructLiteralContext& ctx);
+    std::unique_ptr<ParsedExpression> transformParameterExpression(
+        CypherParser::OC_ParameterContext& ctx);
+    std::unique_ptr<ParsedExpression> transformParenthesizedExpression(
+        CypherParser::OC_ParenthesizedExpressionContext& ctx);
+    std::unique_ptr<ParsedExpression> transformFunctionInvocation(
+        CypherParser::OC_FunctionInvocationContext& ctx);
+    std::string transformFunctionName(CypherParser::OC_FunctionNameContext& ctx);
+    std::vector<std::string> transformLambdaVariables(CypherParser::KU_LambdaVarsContext& ctx);
+    std::unique_ptr<ParsedExpression> transformLambdaParameter(
+        CypherParser::KU_LambdaParameterContext& ctx);
+    std::unique_ptr<ParsedExpression> transformFunctionParameterExpression(
+        CypherParser::KU_FunctionParameterContext& ctx);
+    std::unique_ptr<ParsedExpression> transformPathPattern(
+        CypherParser::OC_PathPatternsContext& ctx);
+    std::unique_ptr<ParsedExpression> transformExistCountSubquery(
+        CypherParser::OC_ExistCountSubqueryContext& ctx);
+    std::unique_ptr<ParsedExpression> transformOcQuantifier(
+        CypherParser::OC_QuantifierContext& ctx);
+    std::unique_ptr<ParsedExpression> createPropertyExpression(
+        CypherParser::OC_PropertyKeyNameContext& ctx, std::unique_ptr<ParsedExpression> child);
+    std::unique_ptr<ParsedExpression> createPropertyExpression(
+        CypherParser::OC_PropertyLookupContext& ctx, std::unique_ptr<ParsedExpression> child);
+    std::unique_ptr<ParsedExpression> transformCaseExpression(
+        CypherParser::OC_CaseExpressionContext& ctx);
+    ParsedCaseAlternative transformCaseAlternative(CypherParser::OC_CaseAlternativeContext& ctx);
+    std::unique_ptr<ParsedExpression> transformNumberLiteral(
+        CypherParser::OC_NumberLiteralContext& ctx, bool negative);
+    std::unique_ptr<ParsedExpression> transformProperty(
+        CypherParser::OC_PropertyExpressionContext& ctx);
+    std::string transformPropertyKeyName(CypherParser::OC_PropertyKeyNameContext& ctx);
+    std::unique_ptr<ParsedExpression> transformIntegerLiteral(
+        CypherParser::OC_IntegerLiteralContext& ctx, bool negative);
+    std::unique_ptr<ParsedExpression> transformDoubleLiteral(
+        CypherParser::OC_DoubleLiteralContext& ctx, bool negative);
+
+    // Transform ddl.
+    std::unique_ptr<Statement> transformAlterTable(CypherParser::KU_AlterTableContext& ctx);
+    std::unique_ptr<Statement> transformCreateNodeTable(
+        CypherParser::KU_CreateNodeTableContext& ctx);
+    std::unique_ptr<Statement> transformCreateRelGroup(CypherParser::KU_CreateRelTableContext& ctx);
+    std::unique_ptr<Statement> transformCreateSequence(CypherParser::KU_CreateSequenceContext& ctx);
+    std::unique_ptr<Statement> transformCreateType(CypherParser::KU_CreateTypeContext& ctx);
+    std::unique_ptr<Statement> transformDrop(CypherParser::KU_DropContext& ctx);
+    std::unique_ptr<Statement> transformRenameTable(CypherParser::KU_AlterTableContext& ctx);
+    std::unique_ptr<Statement> transformAddFromToConnection(
+        CypherParser::KU_AlterTableContext& ctx);
+    std::unique_ptr<Statement> transformDropFromToConnection(
+        CypherParser::KU_AlterTableContext& ctx);
+    std::unique_ptr<Statement> transformAddProperty(CypherParser::KU_AlterTableContext& ctx);
+    std::unique_ptr<Statement> transformDropProperty(CypherParser::KU_AlterTableContext& ctx);
+    std::unique_ptr<Statement> transformRenameProperty(CypherParser::KU_AlterTableContext& ctx);
+    std::unique_ptr<Statement> transformCommentOn(CypherParser::KU_CommentOnContext& ctx);
+    std::string transformUnionType(CypherParser::KU_UnionTypeContext& ctx);
+    std::string transformStructType(CypherParser::KU_StructTypeContext& ctx);
+    std::string transformMapType(CypherParser::KU_MapTypeContext& ctx);
+    std::string transformDecimalType(CypherParser::KU_DecimalTypeContext& ctx);
+    std::string transformDataType(CypherParser::KU_DataTypeContext& ctx);
+    std::string getPKName(CypherParser::KU_CreateNodeTableContext& ctx);
+    std::string transformPrimaryKey(CypherParser::KU_CreateNodeConstraintContext& ctx);
+    std::string transformPrimaryKey(CypherParser::KU_ColumnDefinitionContext& ctx);
+    std::vector<ParsedColumnDefinition> transformColumnDefinitions(
+        CypherParser::KU_ColumnDefinitionsContext& ctx);
+    ParsedColumnDefinition transformColumnDefinition(CypherParser::KU_ColumnDefinitionContext& ctx);
+    std::vector<ParsedPropertyDefinition> transformPropertyDefinitions(
+        CypherParser::KU_PropertyDefinitionsContext& ctx);
+
+    // Transform standalone call.
+    std::unique_ptr<Statement> transformStandaloneCall(CypherParser::KU_StandaloneCallContext& ctx);
+
+    // Transform create macro.
+    std::unique_ptr<Statement> transformCreateMacro(CypherParser::KU_CreateMacroContext& ctx);
+    std::vector<std::string> transformPositionalArgs(CypherParser::KU_PositionalArgsContext& ctx);
+
+    // Transform transaction.
+    std::unique_ptr<Statement> transformTransaction(CypherParser::KU_TransactionContext& ctx);
+
+    // Transform extension.
+    std::unique_ptr<Statement> transformExtension(CypherParser::KU_ExtensionContext& ctx);
+
+    // Transform attach/detach/use database.
+    std::unique_ptr<Statement> transformAttachDatabase(CypherParser::KU_AttachDatabaseContext& ctx);
+    std::unique_ptr<Statement> transformDetachDatabase(CypherParser::KU_DetachDatabaseContext& ctx);
+    std::unique_ptr<Statement> transformUseDatabase(CypherParser::KU_UseDatabaseContext& ctx);
+
+    std::unique_ptr<Statement> transformExtensionStatement(antlr4::ParserRuleContext* ctx);
+
+private:
+    CypherParser::Ku_StatementsContext& root;
+    std::vector<extension::TransformerExtension*> transformerExtensions;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/use_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/use_database.h
new file mode 100644
index 0000000000..01c751c706
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/use_database.h
@@ -0,0 +1,15 @@
+#pragma once
+
+#include "parser/database_statement.h"
+
+namespace lbug {
+namespace parser {
+
+class UseDatabase final : public DatabaseStatement {
+public:
+    explicit UseDatabase(std::string dbName)
+        : DatabaseStatement{common::StatementType::USE_DATABASE, std::move(dbName)} {}
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/visitor/standalone_call_rewriter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/visitor/standalone_call_rewriter.h
new file mode 100644
index 0000000000..138ce15212
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/visitor/standalone_call_rewriter.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "parser/parsed_statement_visitor.h"
+
+namespace lbug {
+namespace parser {
+
+class StandaloneCallRewriter final : public StatementVisitor {
+public:
+    explicit StandaloneCallRewriter(main::ClientContext* context, bool allowRewrite)
+        : StatementVisitor{}, rewriteQuery{}, context{context}, singleStatement{allowRewrite} {}
+
+    std::string getRewriteQuery(const Statement& statement);
+
+private:
+    void visitStandaloneCallFunction(const Statement& statement) override;
+
+private:
+    std::string rewriteQuery;
+    main::ClientContext* context;
+    bool singleStatement;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/visitor/statement_read_write_analyzer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/visitor/statement_read_write_analyzer.h
new file mode 100644
index 0000000000..f7f14e2f11
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/parser/visitor/statement_read_write_analyzer.h
@@ -0,0 +1,46 @@
+#pragma once
+
+#include "parser/expression/parsed_expression.h"
+#include "parser/parsed_statement_visitor.h"
+
+namespace lbug {
+namespace parser {
+
+class StatementReadWriteAnalyzer final : public StatementVisitor {
+public:
+    explicit StatementReadWriteAnalyzer(main::ClientContext* context)
+        : StatementVisitor{}, readOnly{true}, context{context} {}
+
+    bool isReadOnly() const { return readOnly; }
+
+private:
+    void visitCreateSequence(const Statement& /*statement*/) override { readOnly = false; }
+    void visitDrop(const Statement& /*statement*/) override { readOnly = false; }
+    void visitCreateTable(const Statement& /*statement*/) override { readOnly = false; }
+    void visitCreateType(const Statement& /*statement*/) override { readOnly = false; }
+    void visitAlter(const Statement& /*statement*/) override { readOnly = false; }
+    void visitCopyFrom(const Statement& /*statement*/) override { readOnly = false; }
+    void visitStandaloneCall(const Statement& /*statement*/) override { readOnly = true; }
+    void visitStandaloneCallFunction(const Statement& /*statement*/) override { readOnly = false; }
+    void visitCreateMacro(const Statement& /*statement*/) override { readOnly = false; }
+    void visitExtension(const Statement& /*statement*/) override;
+
+    void visitReadingClause(const ReadingClause* readingClause) override;
+    void visitWithClause(const WithClause* withClause) override;
+    void visitReturnClause(const ReturnClause* returnClause) override;
+
+    void visitUpdatingClause(const UpdatingClause* /*updatingClause*/) override {
+        readOnly = false;
+    }
+
+    void visitExtensionClause(const Statement& /* statement*/) override { readOnly = false; }
+
+    bool isExprReadOnly(const ParsedExpression* expr);
+
+private:
+    bool readOnly;
+    main::ClientContext* context;
+};
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/cardinality_estimator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/cardinality_estimator.h
new file mode 100644
index 0000000000..b7e7729afc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/cardinality_estimator.h
@@ -0,0 +1,63 @@
+#pragma once
+
+#include "binder/query/query_graph.h"
+#include "planner/operator/logical_plan.h"
+#include "storage/stats/table_stats.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+} // namespace main
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace planner {
+
+class LogicalAggregate;
+
+class CardinalityEstimator {
+public:
+    explicit CardinalityEstimator(main::ClientContext* context) : context{context} {}
+    DELETE_COPY_DEFAULT_MOVE(CardinalityEstimator);
+
+    void init(const binder::QueryGraph& queryGraph);
+    LBUG_API void init(const binder::NodeExpression& node);
+
+    void rectifyCardinality(const binder::Expression& nodeID, cardinality_t card);
+
+    cardinality_t estimateScanNode(const LogicalOperator& op) const;
+    cardinality_t estimateHashJoin(const std::vector<binder::expression_pair>& joinConditions,
+        const LogicalOperator& probeOp, const LogicalOperator& buildOp) const;
+    cardinality_t estimateCrossProduct(const LogicalOperator& probeOp,
+        const LogicalOperator& buildOp) const;
+    cardinality_t estimateIntersect(const binder::expression_vector& joinNodeIDs,
+        const LogicalOperator& probeOp, const std::vector<LogicalOperator*>& buildOps) const;
+    cardinality_t estimateFlatten(const LogicalOperator& childOp,
+        f_group_pos groupPosToFlatten) const;
+    cardinality_t estimateFilter(const LogicalOperator& childOp,
+        const binder::Expression& predicate) const;
+    cardinality_t estimateAggregate(const LogicalAggregate& op) const;
+
+    double getExtensionRate(const binder::RelExpression& rel,
+        const binder::NodeExpression& boundNode, const transaction::Transaction* transaction) const;
+    cardinality_t multiply(double extensionRate, cardinality_t card) const;
+
+private:
+    cardinality_t getNodeIDDom(const std::string& nodeIDName) const;
+    cardinality_t getNumNodes(const transaction::Transaction* transaction,
+        const std::vector<common::table_id_t>& tableIDs) const;
+    cardinality_t getNumRels(const transaction::Transaction* transaction,
+        const std::vector<common::table_id_t>& tableIDs) const;
+
+private:
+    main::ClientContext* context;
+    // TODO(Guodong): Extend this to cover rel tables.
+    std::unordered_map<common::table_id_t, storage::TableStats> nodeTableStats;
+    // The domain of nodeID is defined as the number of unique value of nodeID, i.e. num nodes.
+    std::unordered_map<std::string, cardinality_t> nodeIDName2dom;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/cost_model.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/cost_model.h
new file mode 100644
index 0000000000..493d566452
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/cost_model.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace planner {
+
+class CostModel {
+public:
+    static uint64_t computeExtendCost(const LogicalPlan& childPlan);
+    static uint64_t computeHashJoinCost(const std::vector<binder::expression_pair>& joinConditions,
+        const LogicalPlan& probe, const LogicalPlan& build);
+    static uint64_t computeHashJoinCost(const binder::expression_vector& joinNodeIDs,
+        const LogicalPlan& probe, const LogicalPlan& build);
+    static uint64_t computeMarkJoinCost(const std::vector<binder::expression_pair>& joinConditions,
+        const LogicalPlan& probe, const LogicalPlan& build);
+    static uint64_t computeMarkJoinCost(const binder::expression_vector& joinNodeIDs,
+        const LogicalPlan& probe, const LogicalPlan& build);
+    static uint64_t computeIntersectCost(const LogicalPlan& probePlan,
+        const std::vector<LogicalPlan>& buildPlans);
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_order_util.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_order_util.h
new file mode 100644
index 0000000000..f7e8cd3340
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_order_util.h
@@ -0,0 +1,16 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct JoinOrderUtil {
+    // Although we do not flatten join key in Build operator computation. We still need to perform
+    // cardinality and cost estimation based on their flat cardinality.
+    static uint64_t getJoinKeysFlatCardinality(const binder::expression_vector& joinNodeIDs,
+        const LogicalOperator& buildOp);
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_plan_solver.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_plan_solver.h
new file mode 100644
index 0000000000..99fc9b36e3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_plan_solver.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "join_tree.h"
+#include "planner/planner.h"
+
+namespace lbug {
+namespace planner {
+
+class JoinPlanSolver {
+public:
+    explicit JoinPlanSolver(Planner* planner) : planner{planner} {}
+
+    LogicalPlan solve(const JoinTree& joinTree);
+
+private:
+    LogicalPlan solveTreeNode(const JoinTreeNode& current, const JoinTreeNode* parent);
+
+    LogicalPlan solveNodeScanTreeNode(const JoinTreeNode& treeNode);
+    LogicalPlan solveRelScanTreeNode(const JoinTreeNode& treeNode, const JoinTreeNode& parent);
+    LogicalPlan solveBinaryJoinTreeNode(const JoinTreeNode& treeNode);
+    LogicalPlan solveMultiwayJoinTreeNode(const JoinTreeNode& treeNode);
+
+private:
+    Planner* planner;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_tree.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_tree.h
new file mode 100644
index 0000000000..a2d1efaa4e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_tree.h
@@ -0,0 +1,99 @@
+#pragma once
+
+#include "binder/expression/node_expression.h"
+
+namespace lbug {
+namespace planner {
+
+enum class TreeNodeType : uint8_t {
+    NODE_SCAN = 0,
+    REL_SCAN = 1,
+    BINARY_JOIN = 5,
+    MULTIWAY_JOIN = 6,
+};
+
+struct TreeNodeTypeUtils {
+    static std::string toString(TreeNodeType type);
+};
+
+struct ExtraTreeNodeInfo {
+    virtual ~ExtraTreeNodeInfo() = default;
+
+    virtual std::unique_ptr<ExtraTreeNodeInfo> copy() const = 0;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+};
+
+struct ExtraJoinTreeNodeInfo : ExtraTreeNodeInfo {
+    std::vector<std::shared_ptr<binder::NodeExpression>> joinNodes;
+    binder::expression_vector predicates;
+
+    explicit ExtraJoinTreeNodeInfo(std::shared_ptr<binder::NodeExpression> joinNode) {
+        joinNodes.push_back(std::move(joinNode));
+    }
+    explicit ExtraJoinTreeNodeInfo(std::vector<std::shared_ptr<binder::NodeExpression>> joinNodes)
+        : joinNodes{std::move(joinNodes)} {}
+    ExtraJoinTreeNodeInfo(const ExtraJoinTreeNodeInfo& other)
+        : joinNodes{other.joinNodes}, predicates{other.predicates} {}
+
+    std::unique_ptr<ExtraTreeNodeInfo> copy() const override {
+        return std::make_unique<ExtraJoinTreeNodeInfo>(*this);
+    }
+};
+
+struct NodeRelScanInfo {
+    std::shared_ptr<binder::Expression> nodeOrRel;
+    binder::expression_vector properties;
+    binder::expression_vector predicates;
+
+    NodeRelScanInfo(std::shared_ptr<binder::Expression> nodeOrRel,
+        binder::expression_vector properties)
+        : nodeOrRel{std::move(nodeOrRel)}, properties{std::move(properties)} {}
+};
+
+struct ExtraScanTreeNodeInfo : ExtraTreeNodeInfo {
+    std::unique_ptr<NodeRelScanInfo> nodeInfo;
+    std::vector<NodeRelScanInfo> relInfos;
+    binder::expression_vector predicates;
+
+    ExtraScanTreeNodeInfo() = default;
+    ExtraScanTreeNodeInfo(const ExtraScanTreeNodeInfo& other)
+        : nodeInfo{std::make_unique<NodeRelScanInfo>(*other.nodeInfo)}, relInfos{other.relInfos} {}
+
+    void merge(const ExtraScanTreeNodeInfo& other);
+
+    std::unique_ptr<ExtraTreeNodeInfo> copy() const override {
+        return std::make_unique<ExtraScanTreeNodeInfo>(*this);
+    }
+};
+
+struct JoinTreeNode {
+    TreeNodeType type;
+    std::unique_ptr<ExtraTreeNodeInfo> extraInfo;
+    std::vector<std::shared_ptr<JoinTreeNode>> children;
+
+    JoinTreeNode(TreeNodeType type, std::unique_ptr<ExtraTreeNodeInfo> extraInfo)
+        : type{type}, extraInfo{std::move(extraInfo)} {}
+    DELETE_COPY_DEFAULT_MOVE(JoinTreeNode);
+
+    std::string toString() const;
+
+    void addChild(std::shared_ptr<JoinTreeNode> child) { children.push_back(std::move(child)); }
+};
+
+struct JoinTree {
+    std::shared_ptr<JoinTreeNode> root;
+    explicit JoinTree(std::shared_ptr<JoinTreeNode> root) : root{std::move(root)} {}
+
+    JoinTree(const JoinTree& other) : root{other.root} {}
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_tree_constructor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_tree_constructor.h
new file mode 100644
index 0000000000..6f7f09b714
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order/join_tree_constructor.h
@@ -0,0 +1,44 @@
+#pragma once
+
+#include "join_tree.h"
+#include "planner/planner.h"
+
+namespace lbug {
+namespace planner {
+
+class PropertyExprCollection;
+
+class JoinTreeConstructor {
+public:
+    JoinTreeConstructor(const binder::QueryGraph& queryGraph,
+        const PropertyExprCollection& propertyCollection, binder::expression_vector predicates,
+        const QueryGraphPlanningInfo& planningInfo)
+        : queryGraph{queryGraph}, propertyCollection{propertyCollection},
+          queryGraphPredicates{std::move(predicates)}, planningInfo{planningInfo} {}
+
+    JoinTree construct(std::shared_ptr<binder::BoundJoinHintNode> root);
+
+private:
+    struct IntermediateResult {
+        std::shared_ptr<JoinTreeNode> treeNode = nullptr;
+        binder::SubqueryGraph subqueryGraph;
+    };
+
+    IntermediateResult constructTreeNode(std::shared_ptr<binder::BoundJoinHintNode> hintNode);
+    IntermediateResult constructNodeScan(std::shared_ptr<binder::Expression> expr);
+    IntermediateResult constructRelScan(std::shared_ptr<binder::Expression> expr);
+
+    std::shared_ptr<JoinTreeNode> tryConstructNestedLoopJoin(
+        std::vector<std::shared_ptr<binder::NodeExpression>> joinNodes,
+        const JoinTreeNode& leftRoot, const JoinTreeNode& rightRoot,
+        const binder::expression_vector& predicates);
+
+private:
+    const binder::QueryGraph& queryGraph;
+    const PropertyExprCollection& propertyCollection;
+    binder::expression_vector queryGraphPredicates;
+    const QueryGraphPlanningInfo& planningInfo;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order_enumerator_context.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order_enumerator_context.h
new file mode 100644
index 0000000000..77988383d7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/join_order_enumerator_context.h
@@ -0,0 +1,52 @@
+#pragma once
+
+#include "planner/operator/logical_plan.h"
+#include "planner/subplans_table.h"
+
+namespace lbug {
+namespace planner {
+
+class JoinOrderEnumeratorContext {
+    friend class Planner;
+
+public:
+    JoinOrderEnumeratorContext()
+        : currentLevel{0}, maxLevel{0}, subPlansTable{std::make_unique<SubPlansTable>()},
+          queryGraph{nullptr} {}
+    DELETE_COPY_DEFAULT_MOVE(JoinOrderEnumeratorContext);
+
+    void init(const binder::QueryGraph* queryGraph, const binder::expression_vector& predicates);
+
+    binder::expression_vector getWhereExpressions() { return whereExpressionsSplitOnAND; }
+
+    bool containPlans(const binder::SubqueryGraph& subqueryGraph) const {
+        return subPlansTable->containSubgraphPlans(subqueryGraph);
+    }
+    const std::vector<LogicalPlan>& getPlans(const binder::SubqueryGraph& subqueryGraph) const {
+        return subPlansTable->getSubgraphPlans(subqueryGraph);
+    }
+    void addPlan(const binder::SubqueryGraph& subqueryGraph, LogicalPlan plan) {
+        subPlansTable->addPlan(subqueryGraph, std::move(plan));
+    }
+
+    binder::SubqueryGraph getEmptySubqueryGraph() const {
+        return binder::SubqueryGraph(*queryGraph);
+    }
+    binder::SubqueryGraph getFullyMatchedSubqueryGraph() const;
+
+    const binder::QueryGraph* getQueryGraph() { return queryGraph; }
+
+    void resetState();
+
+private:
+    binder::expression_vector whereExpressionsSplitOnAND;
+
+    uint32_t currentLevel;
+    uint32_t maxLevel;
+
+    std::unique_ptr<SubPlansTable> subPlansTable;
+    const binder::QueryGraph* queryGraph;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_alter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_alter.h
new file mode 100644
index 0000000000..19e3d41063
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_alter.h
@@ -0,0 +1,47 @@
+#pragma once
+
+#include "binder/ddl/bound_alter_info.h"
+#include "planner/operator/simple/logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalAlterPrintInfo final : OPPrintInfo {
+    binder::BoundAlterInfo info;
+
+    explicit LogicalAlterPrintInfo(binder::BoundAlterInfo info) : info{std::move(info)} {}
+
+    std::string toString() const override { return info.toString(); }
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LogicalAlterPrintInfo>(new LogicalAlterPrintInfo(*this));
+    }
+
+    LogicalAlterPrintInfo(const LogicalAlterPrintInfo& other) : info{other.info.copy()} {}
+};
+
+class LogicalAlter final : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::ALTER;
+
+public:
+    explicit LogicalAlter(binder::BoundAlterInfo info)
+        : LogicalSimple{type_}, info{std::move(info)} {}
+
+    std::string getExpressionsForPrinting() const override { return info.tableName; }
+
+    const binder::BoundAlterInfo* getInfo() const { return &info; }
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalAlterPrintInfo>(info.copy());
+    }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalAlter>(info.copy());
+    }
+
+private:
+    binder::BoundAlterInfo info;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_create_sequence.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_create_sequence.h
new file mode 100644
index 0000000000..04859ed899
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_create_sequence.h
@@ -0,0 +1,51 @@
+#pragma once
+
+#include "binder/ddl/bound_create_sequence_info.h"
+#include "planner/operator/simple/logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalCreateSequencePrintInfo final : OPPrintInfo {
+    std::string sequenceName;
+
+    explicit LogicalCreateSequencePrintInfo(std::string sequenceName)
+        : sequenceName(std::move(sequenceName)) {}
+
+    std::string toString() const override { return "Sequence: " + sequenceName; };
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LogicalCreateSequencePrintInfo>(
+            new LogicalCreateSequencePrintInfo(*this));
+    }
+
+private:
+    LogicalCreateSequencePrintInfo(const LogicalCreateSequencePrintInfo& other)
+        : OPPrintInfo(other), sequenceName(other.sequenceName) {}
+};
+
+class LogicalCreateSequence : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::CREATE_SEQUENCE;
+
+public:
+    explicit LogicalCreateSequence(binder::BoundCreateSequenceInfo info)
+        : LogicalSimple{type_}, info{std::move(info)} {}
+
+    std::string getExpressionsForPrinting() const override { return info.sequenceName; }
+
+    binder::BoundCreateSequenceInfo getInfo() const { return info.copy(); }
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalCreateSequencePrintInfo>(info.sequenceName);
+    }
+
+    std::unique_ptr<LogicalOperator> copy() final {
+        return std::make_unique<LogicalCreateSequence>(info.copy());
+    }
+
+private:
+    binder::BoundCreateSequenceInfo info;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_create_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_create_table.h
new file mode 100644
index 0000000000..8a93c9a4f0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_create_table.h
@@ -0,0 +1,49 @@
+#pragma once
+
+#include "binder/ddl/bound_create_table_info.h"
+#include "planner/operator/simple/logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalCreateTablePrintInfo final : OPPrintInfo {
+    binder::BoundCreateTableInfo info;
+
+    explicit LogicalCreateTablePrintInfo(binder::BoundCreateTableInfo info)
+        : info{std::move(info)} {}
+
+    std::string toString() const override { return info.toString(); }
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::make_unique<LogicalCreateTablePrintInfo>(*this);
+    }
+
+    LogicalCreateTablePrintInfo(const LogicalCreateTablePrintInfo& other)
+        : info{other.info.copy()} {}
+};
+
+class LogicalCreateTable final : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::CREATE_TABLE;
+
+public:
+    explicit LogicalCreateTable(binder::BoundCreateTableInfo info)
+        : LogicalSimple{type_}, info{std::move(info)} {}
+
+    std::string getExpressionsForPrinting() const override { return info.tableName; }
+
+    const binder::BoundCreateTableInfo* getInfo() const { return &info; }
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalCreateTablePrintInfo>(info.copy());
+    }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalCreateTable>(info.copy());
+    }
+
+private:
+    binder::BoundCreateTableInfo info;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_create_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_create_type.h
new file mode 100644
index 0000000000..a2a1f0c7e9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_create_type.h
@@ -0,0 +1,51 @@
+#pragma once
+
+#include "planner/operator/simple/logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalCreateTypePrintInfo final : OPPrintInfo {
+    std::string typeName;
+    std::string type;
+
+    LogicalCreateTypePrintInfo(std::string typeName, std::string type)
+        : typeName(std::move(typeName)), type(std::move(type)) {}
+
+    std::string toString() const override { return typeName + " As " + type; };
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LogicalCreateTypePrintInfo>(new LogicalCreateTypePrintInfo(*this));
+    }
+
+private:
+    LogicalCreateTypePrintInfo(const LogicalCreateTypePrintInfo& other)
+        : OPPrintInfo(other), typeName(other.typeName), type(other.type) {}
+};
+
+class LogicalCreateType : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::CREATE_TYPE;
+
+public:
+    LogicalCreateType(std::string typeName, common::LogicalType type)
+        : LogicalSimple{type_}, typeName{std::move(typeName)}, type{std::move(type)} {}
+
+    std::string getExpressionsForPrinting() const override { return typeName; }
+
+    const common::LogicalType& getType() const { return type; }
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalCreateTypePrintInfo>(typeName, type.toString());
+    }
+
+    std::unique_ptr<LogicalOperator> copy() final {
+        return std::make_unique<LogicalCreateType>(typeName, type.copy());
+    }
+
+private:
+    std::string typeName;
+    common::LogicalType type;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_drop.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_drop.h
new file mode 100644
index 0000000000..0fdf1224c7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/ddl/logical_drop.h
@@ -0,0 +1,41 @@
+#pragma once
+
+#include "parser/ddl/drop_info.h"
+#include "planner/operator/simple/logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalDropPrintInfo : OPPrintInfo {
+    std::string name;
+
+    explicit LogicalDropPrintInfo(std::string name) : name{std::move(name)} {}
+
+    std::string toString() const override { return name; }
+};
+
+class LogicalDrop : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::DROP;
+
+public:
+    explicit LogicalDrop(parser::DropInfo dropInfo)
+        : LogicalSimple{type_}, dropInfo{std::move(dropInfo)} {}
+
+    std::string getExpressionsForPrinting() const override { return dropInfo.name; }
+
+    const parser::DropInfo& getDropInfo() const { return dropInfo; }
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalDropPrintInfo>(dropInfo.name);
+    }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalDrop>(dropInfo);
+    }
+
+private:
+    parser::DropInfo dropInfo;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/base_logical_extend.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/base_logical_extend.h
new file mode 100644
index 0000000000..f2ae3cb874
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/base_logical_extend.h
@@ -0,0 +1,85 @@
+#pragma once
+
+#include "binder/expression/rel_expression.h"
+#include "common/enums/extend_direction.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct BaseLogicalExtendPrintInfo : OPPrintInfo {
+    // Start node of extension.
+    std::shared_ptr<binder::NodeExpression> boundNode;
+    // End node of extension.
+    std::shared_ptr<binder::NodeExpression> nbrNode;
+    std::shared_ptr<binder::RelExpression> rel;
+    common::ExtendDirection direction;
+
+    BaseLogicalExtendPrintInfo(std::shared_ptr<binder::NodeExpression> boundNode,
+        std::shared_ptr<binder::NodeExpression> nbrNode, std::shared_ptr<binder::RelExpression> rel,
+        common::ExtendDirection direction)
+        : boundNode{std::move(boundNode)}, nbrNode{std::move(nbrNode)}, rel{std::move(rel)},
+          direction{direction} {}
+
+    std::string toString() const override {
+        switch (direction) {
+        case common::ExtendDirection::FWD: {
+            return "(" + boundNode->toString() + ")-[" + rel->toString() + "]->(" +
+                   nbrNode->toString() + ")";
+        }
+        case common::ExtendDirection::BWD: {
+            return "(" + nbrNode->toString() + ")-[" + rel->toString() + "]->(" +
+                   boundNode->toString() + ")";
+        }
+        case common::ExtendDirection::BOTH: {
+            return "(" + boundNode->toString() + ")-[" + rel->toString() + "]-(" +
+                   nbrNode->toString() + ")";
+        }
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+    }
+};
+
+class BaseLogicalExtend : public LogicalOperator {
+public:
+    BaseLogicalExtend(LogicalOperatorType operatorType,
+        std::shared_ptr<binder::NodeExpression> boundNode,
+        std::shared_ptr<binder::NodeExpression> nbrNode, std::shared_ptr<binder::RelExpression> rel,
+        common::ExtendDirection direction, bool extendFromSource_,
+        std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{operatorType, std::move(child)}, boundNode{std::move(boundNode)},
+          nbrNode{std::move(nbrNode)}, rel{std::move(rel)}, direction{direction},
+          extendFromSource_{extendFromSource_} {}
+
+    std::shared_ptr<binder::NodeExpression> getBoundNode() const { return boundNode; }
+    std::shared_ptr<binder::NodeExpression> getNbrNode() const { return nbrNode; }
+    std::shared_ptr<binder::RelExpression> getRel() const { return rel; }
+    bool isRecursive() const { return rel->isRecursive(); }
+    common::ExtendDirection getDirection() const { return direction; }
+
+    bool extendFromSourceNode() const { return extendFromSource_; }
+
+    virtual f_group_pos_set getGroupsPosToFlatten() = 0;
+
+    std::string getExpressionsForPrinting() const override;
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<BaseLogicalExtendPrintInfo>(boundNode, nbrNode, rel, direction);
+    }
+
+protected:
+    // Start node of extension.
+    std::shared_ptr<binder::NodeExpression> boundNode;
+    // End node of extension.
+    std::shared_ptr<binder::NodeExpression> nbrNode;
+    std::shared_ptr<binder::RelExpression> rel;
+    common::ExtendDirection direction;
+    // Ideally we should check this by *boundNode == *rel->getSrcNode()
+    // This is currently not doable due to recursive plan not setting src node correctly.
+    bool extendFromSource_;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/logical_extend.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/logical_extend.h
new file mode 100644
index 0000000000..fcb995d7ad
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/logical_extend.h
@@ -0,0 +1,47 @@
+#pragma once
+
+#include "planner/operator/extend/base_logical_extend.h"
+#include "storage/predicate/column_predicate.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalExtend final : public BaseLogicalExtend {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::EXTEND;
+
+public:
+    LogicalExtend(std::shared_ptr<binder::NodeExpression> boundNode,
+        std::shared_ptr<binder::NodeExpression> nbrNode, std::shared_ptr<binder::RelExpression> rel,
+        common::ExtendDirection direction, bool extendFromSource,
+        binder::expression_vector properties, std::shared_ptr<LogicalOperator> child,
+        common::cardinality_t cardinality = 0)
+        : BaseLogicalExtend{type_, std::move(boundNode), std::move(nbrNode), std::move(rel),
+              direction, extendFromSource, std::move(child)},
+          scanNbrID{true}, properties{std::move(properties)} {
+        this->cardinality = cardinality;
+    }
+
+    f_group_pos_set getGroupsPosToFlatten() override { return f_group_pos_set{}; }
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    binder::expression_vector getProperties() const { return properties; }
+    void setPropertyPredicates(std::vector<storage::ColumnPredicateSet> predicates) {
+        propertyPredicates = std::move(predicates);
+    }
+    const std::vector<storage::ColumnPredicateSet>& getPropertyPredicates() const {
+        return propertyPredicates;
+    }
+    void setScanNbrID(bool scanNbrID_) { scanNbrID = scanNbrID_; }
+    bool shouldScanNbrID() const { return scanNbrID; }
+
+    std::unique_ptr<LogicalOperator> copy() override;
+
+private:
+    bool scanNbrID;
+    binder::expression_vector properties;
+    std::vector<storage::ColumnPredicateSet> propertyPredicates;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/logical_recursive_extend.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/logical_recursive_extend.h
new file mode 100644
index 0000000000..7669e4fa04
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/logical_recursive_extend.h
@@ -0,0 +1,64 @@
+#pragma once
+
+#include "function/gds/rec_joins.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalRecursiveExtend final : public LogicalOperator {
+    static constexpr LogicalOperatorType operatorType_ = LogicalOperatorType::RECURSIVE_EXTEND;
+
+public:
+    LogicalRecursiveExtend(std::unique_ptr<function::RJAlgorithm> function,
+        const function::RJBindData& bindData, binder::expression_vector resultColumns)
+        : LogicalOperator{operatorType_}, function{std::move(function)}, bindData{bindData},
+          resultColumns{std::move(resultColumns)}, limitNum{common::INVALID_LIMIT} {}
+
+    void computeFlatSchema() override;
+    void computeFactorizedSchema() override;
+
+    void setFunction(std::unique_ptr<function::RJAlgorithm> func) { function = std::move(func); }
+    const function::RJAlgorithm& getFunction() const { return *function; }
+
+    const function::RJBindData& getBindData() const { return bindData; }
+    function::RJBindData& getBindDataUnsafe() { return bindData; }
+
+    void setResultColumns(binder::expression_vector exprs) { resultColumns = std::move(exprs); }
+    binder::expression_vector getResultColumns() const { return resultColumns; }
+
+    void setLimitNum(common::offset_t num) { limitNum = num; }
+    common::offset_t getLimitNum() const { return limitNum; }
+
+    bool hasInputNodeMask() const { return hasInputNodeMask_; }
+    void setInputNodeMask() { hasInputNodeMask_ = true; }
+
+    bool hasOutputNodeMask() const { return hasOutputNodeMask_; }
+    void setOutputNodeMask() { hasOutputNodeMask_ = true; }
+
+    bool hasNodePredicate() const { return !children.empty(); }
+
+    std::string getExpressionsForPrinting() const override { return function->getFunctionName(); }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        auto result =
+            std::make_unique<LogicalRecursiveExtend>(function->copy(), bindData, resultColumns);
+        result->limitNum = limitNum;
+        result->hasInputNodeMask_ = hasInputNodeMask_;
+        result->hasOutputNodeMask_ = hasOutputNodeMask_;
+        return result;
+    }
+
+private:
+    std::unique_ptr<function::RJAlgorithm> function;
+    function::RJBindData bindData;
+    binder::expression_vector resultColumns;
+
+    common::offset_t limitNum; // TODO: remove this once recursive extend is pipelined.
+
+    bool hasInputNodeMask_ = false;
+    bool hasOutputNodeMask_ = false;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/recursive_join_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/recursive_join_type.h
new file mode 100644
index 0000000000..83c7c46172
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/extend/recursive_join_type.h
@@ -0,0 +1,14 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace planner {
+
+enum class RecursiveJoinType : uint8_t {
+    TRACK_NONE = 0,
+    TRACK_PATH = 1,
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/factorization/flatten_resolver.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/factorization/flatten_resolver.h
new file mode 100644
index 0000000000..f7d301a9ac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/factorization/flatten_resolver.h
@@ -0,0 +1,60 @@
+#pragma once
+
+#include "planner/operator/schema.h"
+
+namespace lbug {
+namespace planner {
+
+class GroupDependencyAnalyzer;
+
+struct FlattenAllButOne {
+    static std::pair<f_group_pos, f_group_pos_set> getGroupsPosToFlatten(
+        const binder::expression_vector& exprs, const Schema& schema);
+    static f_group_pos_set getGroupsPosToFlatten(std::shared_ptr<binder::Expression> expr,
+        const Schema& schema);
+    // Assume no requiredFlatGroups
+    static f_group_pos_set getGroupsPosToFlatten(
+        const std::unordered_set<f_group_pos>& dependentGroups, const Schema& schema);
+};
+
+struct FlattenAll {
+    static f_group_pos_set getGroupsPosToFlatten(const binder::expression_vector& exprs,
+        const Schema& schema);
+    static f_group_pos_set getGroupsPosToFlatten(std::shared_ptr<binder::Expression> expr,
+        const Schema& schema);
+    static f_group_pos_set getGroupsPosToFlatten(
+        const std::unordered_set<f_group_pos>& dependentGroups, const Schema& schema);
+};
+
+class GroupDependencyAnalyzer {
+public:
+    GroupDependencyAnalyzer(bool collectDependentExpr, const Schema& schema)
+        : collectDependentExpr{collectDependentExpr}, schema{schema} {}
+
+    binder::expression_vector getDependentExprs() const {
+        return binder::expression_vector{dependentExprs.begin(), dependentExprs.end()};
+    }
+    std::unordered_set<f_group_pos> getDependentGroups() const { return dependentGroups; }
+    std::unordered_set<f_group_pos> getRequiredFlatGroups() const { return requiredFlatGroups; }
+
+    void visit(std::shared_ptr<binder::Expression> expr);
+
+private:
+    void visitFunction(std::shared_ptr<binder::Expression> expr);
+
+    void visitCase(std::shared_ptr<binder::Expression> expr);
+
+    void visitNodeOrRel(std::shared_ptr<binder::Expression> expr);
+
+    void visitSubquery(std::shared_ptr<binder::Expression> expr);
+
+private:
+    bool collectDependentExpr;
+    const Schema& schema;
+    std::unordered_set<f_group_pos> dependentGroups;
+    std::unordered_set<f_group_pos> requiredFlatGroups;
+    binder::expression_set dependentExprs;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/factorization/sink_util.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/factorization/sink_util.h
new file mode 100644
index 0000000000..f8b121fdda
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/factorization/sink_util.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "planner/operator/schema.h"
+
+namespace lbug {
+namespace planner {
+
+// This class contains the logic for re-computing factorization structure after sinking
+class SinkOperatorUtil {
+public:
+    static void mergeSchema(const Schema& inputSchema,
+        const binder::expression_vector& expressionsToMerge, Schema& resultSchema);
+
+    static void recomputeSchema(const Schema& inputSchema,
+        const binder::expression_vector& expressionsToMerge, Schema& resultSchema);
+
+private:
+    static std::unordered_map<f_group_pos, binder::expression_vector> getUnFlatPayloadsPerGroup(
+        const Schema& schema, const binder::expression_vector& payloads);
+
+    static binder::expression_vector getFlatPayloads(const Schema& schema,
+        const binder::expression_vector& payloads);
+
+    static uint32_t appendPayloadsToNewGroup(Schema& schema, binder::expression_vector& payloads);
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_accumulate.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_accumulate.h
new file mode 100644
index 0000000000..60c2e25adc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_accumulate.h
@@ -0,0 +1,45 @@
+#pragma once
+
+#include "common/enums/accumulate_type.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalAccumulate final : public LogicalOperator {
+    static constexpr LogicalOperatorType type = LogicalOperatorType::ACCUMULATE;
+
+public:
+    LogicalAccumulate(common::AccumulateType accumulateType, binder::expression_vector flatExprs,
+        std::shared_ptr<binder::Expression> mark, std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type, std::move(child)}, accumulateType{accumulateType},
+          flatExprs{std::move(flatExprs)}, mark{std::move(mark)} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    f_group_pos_set getGroupPositionsToFlatten() const;
+
+    std::string getExpressionsForPrinting() const override { return {}; }
+
+    common::AccumulateType getAccumulateType() const { return accumulateType; }
+    binder::expression_vector getPayloads() const {
+        return children[0]->getSchema()->getExpressionsInScope();
+    }
+    bool hasMark() const { return mark != nullptr; }
+    std::shared_ptr<binder::Expression> getMark() const { return mark; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalAccumulate>(accumulateType, flatExprs, mark, children[0]->copy());
+    }
+
+private:
+    common::AccumulateType accumulateType;
+    binder::expression_vector flatExprs;
+    // Accumulate may be used for optional match, e.g. OPTIONAL MATCH (a). In such case, we use
+    // mark to determine if at least one pattern is found.
+    std::shared_ptr<binder::Expression> mark;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_aggregate.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_aggregate.h
new file mode 100644
index 0000000000..c8c45571b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_aggregate.h
@@ -0,0 +1,79 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalAggregatePrintInfo final : OPPrintInfo {
+    binder::expression_vector keys;
+    binder::expression_vector aggregates;
+
+    LogicalAggregatePrintInfo(binder::expression_vector keys, binder::expression_vector aggregates)
+        : keys(std::move(keys)), aggregates(std::move(aggregates)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LogicalAggregatePrintInfo>(new LogicalAggregatePrintInfo(*this));
+    }
+
+private:
+    LogicalAggregatePrintInfo(const LogicalAggregatePrintInfo& other)
+        : OPPrintInfo(other), keys(other.keys), aggregates(other.aggregates) {}
+};
+
+class LogicalAggregate final : public LogicalOperator {
+    static constexpr LogicalOperatorType operatorType_ = LogicalOperatorType::AGGREGATE;
+
+public:
+    LogicalAggregate(binder::expression_vector keys, binder::expression_vector aggregates,
+        std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{operatorType_, std::move(child)}, keys{std::move(keys)},
+          aggregates{std::move(aggregates)} {}
+    LogicalAggregate(binder::expression_vector keys, binder::expression_vector dependentKeys,
+        binder::expression_vector aggregates, std::shared_ptr<LogicalOperator> child,
+        common::cardinality_t cardinality)
+        : LogicalOperator{operatorType_, std::move(child), cardinality}, keys{std::move(keys)},
+          dependentKeys{std::move(dependentKeys)}, aggregates{std::move(aggregates)} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    f_group_pos_set getGroupsPosToFlatten();
+
+    std::string getExpressionsForPrinting() const override;
+
+    bool hasKeys() const { return !keys.empty(); }
+    binder::expression_vector getKeys() const { return keys; }
+    void setKeys(binder::expression_vector expressions) { keys = std::move(expressions); }
+    binder::expression_vector getDependentKeys() const { return dependentKeys; }
+    void setDependentKeys(binder::expression_vector expressions) {
+        dependentKeys = std::move(expressions);
+    }
+    binder::expression_vector getAllKeys() const {
+        binder::expression_vector result;
+        result.insert(result.end(), keys.begin(), keys.end());
+        result.insert(result.end(), dependentKeys.begin(), dependentKeys.end());
+        return result;
+    }
+    binder::expression_vector getAggregates() const { return aggregates; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalAggregate>(keys, dependentKeys, aggregates, children[0]->copy(),
+            cardinality);
+    }
+
+private:
+    void insertAllExpressionsToGroupAndScope(f_group_pos groupPos);
+
+private:
+    binder::expression_vector keys;
+    // A dependentKeyExpression depend on a keyExpression (e.g. a.age depends on a.ID) and will not
+    // be treated as a hash key during hash aggregation.
+    binder::expression_vector dependentKeys;
+    binder::expression_vector aggregates;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_create_macro.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_create_macro.h
new file mode 100644
index 0000000000..3d4e0a715e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_create_macro.h
@@ -0,0 +1,51 @@
+#pragma once
+
+#include "function/scalar_macro_function.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalCreateMacroPrintInfo final : OPPrintInfo {
+    std::string macroName;
+
+    explicit LogicalCreateMacroPrintInfo(std::string macroName) : macroName(std::move(macroName)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LogicalCreateMacroPrintInfo>(new LogicalCreateMacroPrintInfo(*this));
+    }
+
+private:
+    LogicalCreateMacroPrintInfo(const LogicalCreateMacroPrintInfo& other)
+        : OPPrintInfo(other), macroName(other.macroName) {}
+};
+
+class LogicalCreateMacro final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::CREATE_MACRO;
+
+public:
+    LogicalCreateMacro(std::string macroName, std::unique_ptr<function::ScalarMacroFunction> macro)
+        : LogicalOperator{type_}, macroName{std::move(macroName)}, macro{std::move(macro)} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getMacroName() const { return macroName; }
+
+    std::unique_ptr<function::ScalarMacroFunction> getMacro() const { return macro->copy(); }
+
+    std::string getExpressionsForPrinting() const override { return macroName; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalCreateMacro>(macroName, macro->copy());
+    }
+
+private:
+    std::string macroName;
+    std::shared_ptr<function::ScalarMacroFunction> macro;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_cross_product.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_cross_product.h
new file mode 100644
index 0000000000..383ce1a7a8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_cross_product.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include "common/enums/accumulate_type.h"
+#include "planner/operator/logical_operator.h"
+#include "planner/operator/sip/side_way_info_passing.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalCrossProduct final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::CROSS_PRODUCT;
+
+public:
+    LogicalCrossProduct(common::AccumulateType accumulateType,
+        std::shared_ptr<binder::Expression> mark, std::shared_ptr<LogicalOperator> probeChild,
+        std::shared_ptr<LogicalOperator> buildChild, common::cardinality_t cardinality)
+        : LogicalOperator{type_, std::move(probeChild), std::move(buildChild)},
+          accumulateType{accumulateType}, mark{std::move(mark)} {
+        this->cardinality = cardinality;
+    }
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override { return std::string(); }
+
+    common::AccumulateType getAccumulateType() const { return accumulateType; }
+    bool hasMark() const { return mark != nullptr; }
+    std::shared_ptr<binder::Expression> getMark() const { return mark; }
+
+    SIPInfo& getSIPInfoUnsafe() { return sipInfo; }
+    SIPInfo getSIPInfo() const { return sipInfo; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        auto op = make_unique<LogicalCrossProduct>(accumulateType, mark, children[0]->copy(),
+            children[1]->copy(), cardinality);
+        op->sipInfo = sipInfo;
+        return op;
+    }
+
+private:
+    common::AccumulateType accumulateType;
+    std::shared_ptr<binder::Expression> mark;
+    SIPInfo sipInfo;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_distinct.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_distinct.h
new file mode 100644
index 0000000000..5760a35415
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_distinct.h
@@ -0,0 +1,55 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalDistinct final : public LogicalOperator {
+public:
+    LogicalDistinct(binder::expression_vector keys, std::shared_ptr<LogicalOperator> child)
+        : LogicalDistinct{LogicalOperatorType::DISTINCT, keys, binder::expression_vector{},
+              std::move(child)} {}
+    LogicalDistinct(LogicalOperatorType type, binder::expression_vector keys,
+        binder::expression_vector payloads, std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type, std::move(child)}, keys{std::move(keys)},
+          payloads{std::move(payloads)}, skipNum{UINT64_MAX}, limitNum{UINT64_MAX} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    virtual f_group_pos_set getGroupsPosToFlatten();
+
+    std::string getExpressionsForPrinting() const override;
+
+    binder::expression_vector getKeys() const { return keys; }
+    void setKeys(binder::expression_vector expressions) { keys = std::move(expressions); }
+    binder::expression_vector getPayloads() const { return payloads; }
+    void setPayloads(binder::expression_vector expressions) { payloads = std::move(expressions); }
+
+    void setSkipNum(common::offset_t num) { skipNum = num; }
+    bool hasSkipNum() const { return skipNum != common::INVALID_LIMIT; }
+    common::offset_t getSkipNum() const { return skipNum; }
+    void setLimitNum(common::offset_t num) { limitNum = num; }
+    bool hasLimitNum() const { return limitNum != common::INVALID_LIMIT; }
+    common::offset_t getLimitNum() const { return limitNum; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalDistinct>(operatorType, keys, payloads, children[0]->copy());
+    }
+
+protected:
+    binder::expression_vector getKeysAndPayloads() const;
+
+protected:
+    binder::expression_vector keys;
+    // Payloads meaning additional keys that are functional dependent on the keys above.
+    binder::expression_vector payloads;
+
+private:
+    common::offset_t skipNum;
+    common::offset_t limitNum;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_dummy_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_dummy_sink.h
new file mode 100644
index 0000000000..5b1d292a72
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_dummy_sink.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalDummySink final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::DUMMY_SINK;
+
+public:
+    explicit LogicalDummySink(std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, {std::move(child)}} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override { return ""; }
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalDummySink>(children[0]->copy());
+    }
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_empty_result.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_empty_result.h
new file mode 100644
index 0000000000..8916c0d00d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_empty_result.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include "logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalEmptyResult final : public LogicalOperator {
+public:
+    explicit LogicalEmptyResult(const Schema& schema)
+        : LogicalOperator{LogicalOperatorType::EMPTY_RESULT}, originalSchema{schema.copy()} {
+        this->schema = schema.copy();
+    }
+
+    void computeFactorizedSchema() override { schema = originalSchema->copy(); }
+    void computeFlatSchema() override {
+        createEmptySchema();
+        schema->createGroup();
+        for (auto& e : originalSchema->getExpressionsInScope()) {
+            schema->insertToGroupAndScope(e, 0);
+        }
+    }
+
+    std::string getExpressionsForPrinting() const override { return std::string{}; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalEmptyResult>(*originalSchema);
+    }
+
+private:
+    // The original schema of the plan that generates empty result.
+    std::unique_ptr<Schema> originalSchema;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_explain.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_explain.h
new file mode 100644
index 0000000000..b9a146844a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_explain.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include <utility>
+
+#include "common/enums/explain_type.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalExplain final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::EXPLAIN;
+
+public:
+    LogicalExplain(std::shared_ptr<LogicalOperator> child, common::ExplainType explainType,
+        binder::expression_vector innerResultColumns)
+        : LogicalOperator{type_, std::move(child)}, explainType{explainType},
+          innerResultColumns{std::move(innerResultColumns)} {}
+
+    void computeSchema();
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override { return ""; }
+
+    common::ExplainType getExplainType() const { return explainType; }
+
+    binder::expression_vector getInnerResultColumns() const { return innerResultColumns; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalExplain>(children[0], explainType, innerResultColumns);
+    }
+
+private:
+    common::ExplainType explainType;
+    binder::expression_vector innerResultColumns;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_filter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_filter.h
new file mode 100644
index 0000000000..3a31c7af31
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_filter.h
@@ -0,0 +1,47 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalFilterPrintInfo final : OPPrintInfo {
+    std::shared_ptr<binder::Expression> expression;
+    explicit LogicalFilterPrintInfo(std::shared_ptr<binder::Expression> expression)
+        : expression{std::move(expression)} {}
+    std::string toString() const override { return expression->toString(); }
+};
+
+class LogicalFilter final : public LogicalOperator {
+public:
+    LogicalFilter(std::shared_ptr<binder::Expression> expression,
+        std::shared_ptr<LogicalOperator> child, common::cardinality_t cardinality = 0)
+        : LogicalOperator{LogicalOperatorType::FILTER, std::move(child), cardinality},
+          expression{std::move(expression)} {}
+
+    inline void computeFactorizedSchema() override { copyChildSchema(0); }
+    inline void computeFlatSchema() override { copyChildSchema(0); }
+
+    f_group_pos_set getGroupsPosToFlatten();
+
+    inline std::string getExpressionsForPrinting() const override { return expression->toString(); }
+
+    inline std::shared_ptr<binder::Expression> getPredicate() const { return expression; }
+
+    f_group_pos getGroupPosToSelect() const;
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalFilterPrintInfo>(expression);
+    }
+
+    inline std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalFilter>(expression, children[0]->copy(), cardinality);
+    }
+
+private:
+    std::shared_ptr<binder::Expression> expression;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_flatten.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_flatten.h
new file mode 100644
index 0000000000..65d27233bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_flatten.h
@@ -0,0 +1,31 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalFlatten final : public LogicalOperator {
+public:
+    LogicalFlatten(f_group_pos groupPos, std::shared_ptr<LogicalOperator> child,
+        common::cardinality_t cardinality)
+        : LogicalOperator{LogicalOperatorType::FLATTEN, std::move(child), cardinality},
+          groupPos{groupPos} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    inline std::string getExpressionsForPrinting() const override { return std::string{}; }
+
+    inline f_group_pos getGroupPos() const { return groupPos; }
+
+    inline std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalFlatten>(groupPos, children[0]->copy(), cardinality);
+    }
+
+private:
+    f_group_pos groupPos;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_hash_join.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_hash_join.h
new file mode 100644
index 0000000000..f6274073f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_hash_join.h
@@ -0,0 +1,69 @@
+#pragma once
+
+#include "common/enums/join_type.h"
+#include "logical_operator.h"
+#include "planner/operator/sip/side_way_info_passing.h"
+
+namespace lbug {
+namespace planner {
+
+// We only support equality comparison as join condition
+using join_condition_t = binder::expression_pair;
+
+// Probe side on left, i.e. children[0]. Build side on right, i.e. children[1].
+class LBUG_API LogicalHashJoin final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::HASH_JOIN;
+
+public:
+    LogicalHashJoin(std::vector<join_condition_t> joinConditions, common::JoinType joinType,
+        std::shared_ptr<binder::Expression> mark, std::shared_ptr<LogicalOperator> probeChild,
+        std::shared_ptr<LogicalOperator> buildChild, common::cardinality_t cardinality = 0)
+        : LogicalOperator{type_, std::move(probeChild), std::move(buildChild)},
+          joinConditions(std::move(joinConditions)), joinType{joinType}, mark{std::move(mark)} {
+        this->cardinality = cardinality;
+    }
+
+    f_group_pos_set getGroupsPosToFlattenOnProbeSide();
+    f_group_pos_set getGroupsPosToFlattenOnBuildSide();
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override;
+
+    binder::expression_vector getExpressionsToMaterialize() const;
+
+    binder::expression_vector getJoinNodeIDs() const;
+    static binder::expression_vector getJoinNodeIDs(
+        const std::vector<join_condition_t>& joinConditions);
+
+    std::vector<join_condition_t> getJoinConditions() const { return joinConditions; }
+    common::JoinType getJoinType() const { return joinType; }
+    bool hasMark() const { return mark != nullptr; }
+    std::shared_ptr<binder::Expression> getMark() const { return mark; }
+
+    SIPInfo& getSIPInfoUnsafe() { return sipInfo; }
+    SIPInfo getSIPInfo() const { return sipInfo; }
+
+    std::unique_ptr<LogicalOperator> copy() override;
+
+    // Flat probe side key group in either of the following two cases:
+    // 1. there are multiple join nodes;
+    // 2. if the build side contains more than one group or the build side has projected out data
+    // chunks, which may increase the multiplicity of data chunks in the build side. The key is to
+    // keep probe side key unflat only when we know that there is only 0 or 1 match for each key.
+    // TODO(Guodong): when the build side has only flat payloads, we should consider getting rid of
+    // flattening probe key, instead duplicating keys as in vectorized processing if necessary.
+    bool requireFlatProbeKeys() const;
+
+    static bool isNodeIDOnlyJoin(const std::vector<join_condition_t>& joinConditions);
+
+private:
+    std::vector<join_condition_t> joinConditions;
+    common::JoinType joinType;
+    std::shared_ptr<binder::Expression> mark; // when joinType is Mark or Left
+    SIPInfo sipInfo;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_intersect.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_intersect.h
new file mode 100644
index 0000000000..b3264a0796
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_intersect.h
@@ -0,0 +1,50 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+#include "planner/operator/sip/side_way_info_passing.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalIntersect final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::INTERSECT;
+
+public:
+    LogicalIntersect(std::shared_ptr<binder::Expression> intersectNodeID,
+        binder::expression_vector keyNodeIDs, std::shared_ptr<LogicalOperator> probeChild,
+        std::vector<std::shared_ptr<LogicalOperator>> buildChildren,
+        common::cardinality_t cardinality = 0)
+        : LogicalOperator{type_, std::move(probeChild)},
+          intersectNodeID{std::move(intersectNodeID)}, keyNodeIDs{std::move(keyNodeIDs)} {
+        for (auto& child : buildChildren) {
+            children.push_back(std::move(child));
+        }
+        this->cardinality = cardinality;
+    }
+
+    f_group_pos_set getGroupsPosToFlattenOnProbeSide();
+    f_group_pos_set getGroupsPosToFlattenOnBuildSide(uint32_t buildIdx);
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override { return intersectNodeID->toString(); }
+
+    std::shared_ptr<binder::Expression> getIntersectNodeID() const { return intersectNodeID; }
+    uint32_t getNumBuilds() const { return keyNodeIDs.size(); }
+    binder::expression_vector getKeyNodeIDs() const { return keyNodeIDs; }
+    std::shared_ptr<binder::Expression> getKeyNodeID(uint32_t idx) const { return keyNodeIDs[idx]; }
+
+    SIPInfo& getSIPInfoUnsafe() { return sipInfo; }
+    SIPInfo getSIPInfo() const { return sipInfo; }
+
+    std::unique_ptr<LogicalOperator> copy() override;
+
+private:
+    std::shared_ptr<binder::Expression> intersectNodeID;
+    binder::expression_vector keyNodeIDs;
+    SIPInfo sipInfo;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_limit.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_limit.h
new file mode 100644
index 0000000000..7169fa3cf6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_limit.h
@@ -0,0 +1,46 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalLimit final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::LIMIT;
+
+public:
+    LogicalLimit(std::shared_ptr<binder::Expression> skipNum,
+        std::shared_ptr<binder::Expression> limitNum, std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, std::move(child)}, skipNum{std::move(skipNum)},
+          limitNum{std::move(limitNum)} {}
+
+    f_group_pos_set getGroupsPosToFlatten();
+
+    void computeFactorizedSchema() override { copyChildSchema(0); }
+    void computeFlatSchema() override { copyChildSchema(0); }
+
+    std::string getExpressionsForPrinting() const override;
+
+    bool hasSkipNum() const { return skipNum != nullptr; }
+    std::shared_ptr<binder::Expression> getSkipNum() const { return skipNum; }
+
+    bool hasLimitNum() const { return limitNum != nullptr; }
+    std::shared_ptr<binder::Expression> getLimitNum() const { return limitNum; }
+
+    f_group_pos getGroupPosToSelect() const;
+
+    std::unordered_set<f_group_pos> getGroupsPosToLimit() const {
+        return schema->getGroupsPosInScope();
+    }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalLimit>(skipNum, limitNum, children[0]->copy());
+    }
+
+private:
+    std::shared_ptr<binder::Expression> skipNum;
+    std::shared_ptr<binder::Expression> limitNum;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_multiplcity_reducer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_multiplcity_reducer.h
new file mode 100644
index 0000000000..4af60eaa56
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_multiplcity_reducer.h
@@ -0,0 +1,24 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalMultiplicityReducer final : public LogicalOperator {
+public:
+    explicit LogicalMultiplicityReducer(std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator(LogicalOperatorType::MULTIPLICITY_REDUCER, std::move(child)) {}
+
+    inline void computeFactorizedSchema() override { copyChildSchema(0); }
+    inline void computeFlatSchema() override { copyChildSchema(0); }
+
+    inline std::string getExpressionsForPrinting() const override { return std::string(); }
+
+    inline std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalMultiplicityReducer>(children[0]->copy());
+    }
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_node_label_filter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_node_label_filter.h
new file mode 100644
index 0000000000..58440a1802
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_node_label_filter.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalNodeLabelFilter final : public LogicalOperator {
+public:
+    LogicalNodeLabelFilter(std::shared_ptr<binder::Expression> nodeID,
+        std::unordered_set<common::table_id_t> tableIDSet, std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{LogicalOperatorType::NODE_LABEL_FILTER, std::move(child)},
+          nodeID{std::move(nodeID)}, tableIDSet{std::move(tableIDSet)} {}
+
+    inline void computeFactorizedSchema() override { copyChildSchema(0); }
+    inline void computeFlatSchema() override { copyChildSchema(0); }
+
+    inline std::string getExpressionsForPrinting() const override { return nodeID->toString(); }
+
+    inline std::shared_ptr<binder::Expression> getNodeID() const { return nodeID; }
+    inline std::unordered_set<common::table_id_t> getTableIDSet() const { return tableIDSet; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalNodeLabelFilter>(nodeID, tableIDSet, children[0]->copy());
+    }
+
+private:
+    std::shared_ptr<binder::Expression> nodeID;
+    std::unordered_set<common::table_id_t> tableIDSet;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_noop.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_noop.h
new file mode 100644
index 0000000000..fbc67396bc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_noop.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+// Serve as a dummy parent (usually root) for a set of children that doesn't have a well-defined
+// parent. E.g. CREATE TABLE AS, create table & copy.
+class LogicalNoop : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::NOOP;
+
+public:
+    explicit LogicalNoop(common::idx_t messageChildIdx,
+        std::vector<std::shared_ptr<LogicalOperator>> children)
+        : LogicalOperator{type_, {std::move(children)}}, messageChildIdx{messageChildIdx} {}
+
+    void computeFactorizedSchema() override { createEmptySchema(); }
+    void computeFlatSchema() override { createEmptySchema(); }
+
+    common::idx_t getMessageChildIdx() const { return messageChildIdx; }
+
+    std::string getExpressionsForPrinting() const override { return ""; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalNoop>(messageChildIdx, copyVector(children));
+    }
+
+private:
+    // For create table as. Dummy sink is the last operator and should propagate return message.
+    common::idx_t messageChildIdx;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_operator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_operator.h
new file mode 100644
index 0000000000..3be8831209
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_operator.h
@@ -0,0 +1,149 @@
+#pragma once
+
+#include <optional>
+
+#include "common/cast.h"
+#include "planner/operator/operator_print_info.h"
+#include "planner/operator/schema.h"
+
+namespace lbug {
+namespace planner {
+
+// This ENUM is sorted by alphabetical order.
+enum class LogicalOperatorType : uint8_t {
+    ACCUMULATE,
+    AGGREGATE,
+    ALTER,
+    ATTACH_DATABASE,
+    COPY_FROM,
+    COPY_TO,
+    CREATE_MACRO,
+    CREATE_SEQUENCE,
+    CREATE_TABLE,
+    CREATE_TYPE,
+    CROSS_PRODUCT,
+    DELETE,
+    DETACH_DATABASE,
+    DISTINCT,
+    DROP,
+    DUMMY_SCAN,
+    DUMMY_SINK,
+    EMPTY_RESULT,
+    EXPLAIN,
+    EXPRESSIONS_SCAN,
+    EXTEND,
+    EXTENSION,
+    EXPORT_DATABASE,
+    FILTER,
+    FLATTEN,
+    HASH_JOIN,
+    IMPORT_DATABASE,
+    INDEX_LOOK_UP,
+    INTERSECT,
+    INSERT,
+    LIMIT,
+    MERGE,
+    MULTIPLICITY_REDUCER,
+    NODE_LABEL_FILTER,
+    NOOP,
+    ORDER_BY,
+    PARTITIONER,
+    PATH_PROPERTY_PROBE,
+    PROJECTION,
+    RECURSIVE_EXTEND,
+    SCAN_NODE_TABLE,
+    SEMI_MASKER,
+    SET_PROPERTY,
+    STANDALONE_CALL,
+    TABLE_FUNCTION_CALL,
+    TRANSACTION,
+    UNION_ALL,
+    UNWIND,
+    USE_DATABASE,
+    EXTENSION_CLAUSE,
+};
+
+class LogicalOperator;
+using logical_op_vector_t = std::vector<std::shared_ptr<LogicalOperator>>;
+
+struct LogicalOperatorUtils {
+    static std::string logicalOperatorTypeToString(LogicalOperatorType type);
+    static bool isUpdate(LogicalOperatorType type);
+    static bool isAccHashJoin(const LogicalOperator& op);
+};
+
+class LBUG_API LogicalOperator {
+public:
+    explicit LogicalOperator(LogicalOperatorType operatorType)
+        : operatorType{operatorType}, cardinality{1} {}
+    explicit LogicalOperator(LogicalOperatorType operatorType,
+        std::shared_ptr<LogicalOperator> child,
+        std::optional<common::cardinality_t> cardinality = {});
+    explicit LogicalOperator(LogicalOperatorType operatorType,
+        std::shared_ptr<LogicalOperator> left, std::shared_ptr<LogicalOperator> right);
+    explicit LogicalOperator(LogicalOperatorType operatorType, const logical_op_vector_t& children);
+
+    virtual ~LogicalOperator() = default;
+
+    uint32_t getNumChildren() const { return children.size(); }
+    std::shared_ptr<LogicalOperator> getChild(uint64_t idx) const { return children[idx]; }
+    std::vector<std::shared_ptr<LogicalOperator>> getChildren() const { return children; }
+    void setChild(uint64_t idx, std::shared_ptr<LogicalOperator> child) {
+        children[idx] = std::move(child);
+    }
+    void addChild(std::shared_ptr<LogicalOperator> child) { children.push_back(std::move(child)); }
+    void setCardinality(common::cardinality_t cardinality_) { this->cardinality = cardinality_; }
+
+    // Operator type.
+    LogicalOperatorType getOperatorType() const { return operatorType; }
+    bool hasUpdateRecursive();
+
+    // Schema
+    Schema* getSchema() const { return schema.get(); }
+    virtual void computeFactorizedSchema() = 0;
+    virtual void computeFlatSchema() = 0;
+
+    // Printing.
+    virtual std::string getExpressionsForPrinting() const = 0;
+    // Print the sub-plan rooted at this operator.
+    virtual std::string toString(uint64_t depth = 0) const;
+
+    virtual std::unique_ptr<OPPrintInfo> getPrintInfo() const {
+        return std::make_unique<OPPrintInfo>();
+    }
+    common::cardinality_t getCardinality() const { return cardinality; }
+
+    // TODO: remove this function once planner do not share operator across plans
+    virtual std::unique_ptr<LogicalOperator> copy() = 0;
+    static logical_op_vector_t copy(const logical_op_vector_t& ops);
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET* constPtrCast() const {
+        return common::ku_dynamic_cast<const TARGET*>(this);
+    }
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+protected:
+    void createEmptySchema() { schema = std::make_unique<Schema>(); }
+    void copyChildSchema(uint32_t idx) { schema = children[idx]->getSchema()->copy(); }
+
+protected:
+    LogicalOperatorType operatorType;
+    std::unique_ptr<Schema> schema;
+    logical_op_vector_t children;
+    common::cardinality_t cardinality;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_order_by.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_order_by.h
new file mode 100644
index 0000000000..1513205dd9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_order_by.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalOrderBy final : public LogicalOperator {
+public:
+    LogicalOrderBy(binder::expression_vector expressionsToOrderBy, std::vector<bool> sortOrders,
+        std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{LogicalOperatorType::ORDER_BY, std::move(child)},
+          expressionsToOrderBy{std::move(expressionsToOrderBy)},
+          isAscOrders{std::move(sortOrders)} {}
+
+    f_group_pos_set getGroupsPosToFlatten();
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override;
+
+    binder::expression_vector getExpressionsToOrderBy() const { return expressionsToOrderBy; }
+    std::vector<bool> getIsAscOrders() const { return isAscOrders; }
+
+    bool isTopK() const { return hasLimitNum(); }
+
+    void setSkipNum(std::shared_ptr<binder::Expression> num) { skipNum = std::move(num); }
+    bool hasSkipNum() const { return skipNum != nullptr; }
+    std::shared_ptr<binder::Expression> getSkipNum() const { return skipNum; }
+
+    void setLimitNum(std::shared_ptr<binder::Expression> num) { limitNum = std::move(num); }
+    bool hasLimitNum() const { return limitNum != nullptr; }
+    std::shared_ptr<binder::Expression> getLimitNum() const { return limitNum; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalOrderBy>(expressionsToOrderBy, isAscOrders, children[0]->copy());
+    }
+
+private:
+    binder::expression_vector expressionsToOrderBy;
+    std::vector<bool> isAscOrders;
+    std::shared_ptr<binder::Expression> skipNum = nullptr;
+    std::shared_ptr<binder::Expression> limitNum = nullptr;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_partitioner.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_partitioner.h
new file mode 100644
index 0000000000..9dd5a88ae7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_partitioner.h
@@ -0,0 +1,73 @@
+#pragma once
+
+#include "binder/copy/bound_copy_from.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalPartitioningInfo {
+    common::idx_t keyIdx;
+
+    explicit LogicalPartitioningInfo(common::idx_t keyIdx) : keyIdx{keyIdx} {}
+    LogicalPartitioningInfo(const LogicalPartitioningInfo& other) : keyIdx{other.keyIdx} {}
+
+    EXPLICIT_COPY_DEFAULT_MOVE(LogicalPartitioningInfo);
+};
+
+struct LogicalPartitionerInfo {
+    std::shared_ptr<binder::Expression> offset;
+    std::vector<LogicalPartitioningInfo> partitioningInfos;
+
+    explicit LogicalPartitionerInfo(std::shared_ptr<binder::Expression> offset)
+        : offset{std::move(offset)} {}
+    LogicalPartitionerInfo(const LogicalPartitionerInfo& other) : offset{other.offset} {
+        for (auto& partitioningInfo : other.partitioningInfos) {
+            partitioningInfos.push_back(partitioningInfo.copy());
+        }
+    }
+
+    EXPLICIT_COPY_DEFAULT_MOVE(LogicalPartitionerInfo);
+
+    common::idx_t getNumInfos() const { return partitioningInfos.size(); }
+    LogicalPartitioningInfo& getInfo(common::idx_t idx) {
+        KU_ASSERT(idx < partitioningInfos.size());
+        return partitioningInfos[idx];
+    }
+    const LogicalPartitioningInfo& getInfo(common::idx_t idx) const {
+        KU_ASSERT(idx < partitioningInfos.size());
+        return partitioningInfos[idx];
+    }
+};
+
+class LogicalPartitioner final : public LogicalOperator {
+    static constexpr LogicalOperatorType type = LogicalOperatorType::PARTITIONER;
+
+public:
+    LogicalPartitioner(LogicalPartitionerInfo info, binder::BoundCopyFromInfo copyFromInfo,
+        std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type, std::move(child)}, info{std::move(info)},
+          copyFromInfo{std::move(copyFromInfo)} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override;
+
+    LogicalPartitionerInfo& getInfo() { return info; }
+    const LogicalPartitionerInfo& getInfo() const { return info; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalPartitioner>(info.copy(), copyFromInfo.copy(),
+            children[0]->copy());
+    }
+
+private:
+    LogicalPartitionerInfo info;
+
+public:
+    binder::BoundCopyFromInfo copyFromInfo;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_path_property_probe.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_path_property_probe.h
new file mode 100644
index 0000000000..ee109987a2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_path_property_probe.h
@@ -0,0 +1,56 @@
+#pragma once
+
+#include "binder/expression/rel_expression.h"
+#include "planner/operator/extend/recursive_join_type.h"
+#include "planner/operator/logical_operator.h"
+#include "planner/operator/sip/side_way_info_passing.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalPathPropertyProbe : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::PATH_PROPERTY_PROBE;
+
+public:
+    LogicalPathPropertyProbe(std::shared_ptr<binder::RelExpression> rel,
+        std::shared_ptr<LogicalOperator> probeChild, std::shared_ptr<LogicalOperator> nodeChild,
+        std::shared_ptr<LogicalOperator> relChild, RecursiveJoinType joinType)
+        : LogicalOperator{type_, std::move(probeChild)}, recursiveRel{std::move(rel)},
+          nodeChild{std::move(nodeChild)}, relChild{std::move(relChild)}, joinType{joinType} {}
+
+    void computeFactorizedSchema() final;
+    void computeFlatSchema() final;
+
+    std::string getExpressionsForPrinting() const override { return recursiveRel->toString(); }
+
+    std::shared_ptr<binder::RelExpression> getRel() const { return recursiveRel; }
+    std::shared_ptr<binder::Expression> getPathNodeIDs() const { return pathNodeIDs; }
+    std::shared_ptr<binder::Expression> getPathEdgeIDs() const { return pathEdgeIDs; }
+
+    void setJoinType(RecursiveJoinType joinType_) { joinType = joinType_; }
+    RecursiveJoinType getJoinType() const { return joinType; }
+
+    std::shared_ptr<LogicalOperator> getNodeChild() const { return nodeChild; }
+    std::shared_ptr<LogicalOperator> getRelChild() const { return relChild; }
+
+    SIPInfo& getSIPInfoUnsafe() { return sipInfo; }
+    SIPInfo getSIPInfo() const { return sipInfo; }
+
+    std::unique_ptr<LogicalOperator> copy() override;
+
+private:
+    std::shared_ptr<binder::RelExpression> recursiveRel;
+    std::shared_ptr<LogicalOperator> nodeChild;
+    std::shared_ptr<LogicalOperator> relChild;
+    RecursiveJoinType joinType;
+    SIPInfo sipInfo;
+
+public:
+    common::ExtendDirection direction = common::ExtendDirection::FWD;
+    bool extendFromLeft = true;
+    std::shared_ptr<binder::Expression> pathNodeIDs;
+    std::shared_ptr<binder::Expression> pathEdgeIDs;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_plan.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_plan.h
new file mode 100644
index 0000000000..80df03118f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_plan.h
@@ -0,0 +1,49 @@
+#pragma once
+
+#include "logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+using cardinality_t = uint64_t;
+
+class LBUG_API LogicalPlan {
+    friend class CardinalityEstimator;
+    friend class CostModel;
+
+public:
+    LogicalPlan() : cost{0} {}
+    LogicalPlan(const LogicalPlan& other) : lastOperator{other.lastOperator}, cost{other.cost} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(LogicalPlan);
+
+    void setLastOperator(std::shared_ptr<LogicalOperator> op) { lastOperator = std::move(op); }
+
+    bool isEmpty() const { return lastOperator == nullptr; }
+
+    std::shared_ptr<LogicalOperator> getLastOperator() const { return lastOperator; }
+    LogicalOperator& getLastOperatorRef() const {
+        KU_ASSERT(lastOperator);
+        return *lastOperator;
+    }
+    Schema* getSchema() const { return lastOperator->getSchema(); }
+
+    cardinality_t getCardinality() const {
+        KU_ASSERT(lastOperator);
+        return lastOperator->getCardinality();
+    }
+
+    void setCost(uint64_t cost_) { cost = cost_; }
+    uint64_t getCost() const { return cost; }
+
+    std::string toString() const { return lastOperator->toString(); }
+
+    bool isProfile() const;
+    bool hasUpdate() const;
+
+private:
+    std::shared_ptr<LogicalOperator> lastOperator;
+    uint64_t cost;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_plan_util.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_plan_util.h
new file mode 100644
index 0000000000..eab7ec5d19
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_plan_util.h
@@ -0,0 +1,26 @@
+#pragma once
+
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalPlanUtil {
+public:
+    static std::string encodeJoin(LogicalPlan& logicalPlan);
+
+private:
+    static std::string encode(LogicalOperator* logicalOperator);
+    static void encodeRecursive(LogicalOperator* logicalOperator, std::string& encodeString);
+    // Encode joins
+    static void encodeCrossProduct(LogicalOperator* logicalOperator, std::string& encodeString);
+    static void encodeIntersect(LogicalOperator* logicalOperator, std::string& encodeString);
+    static void encodeHashJoin(LogicalOperator* logicalOperator, std::string& encodeString);
+    static void encodeExtend(LogicalOperator* logicalOperator, std::string& encodeString);
+    static void encodeScanNodeTable(LogicalOperator* logicalOperator, std::string& encodeString);
+    // Encode filter
+    static void encodeFilter(LogicalOperator* logicalOperator, std::string& encodedString);
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_projection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_projection.h
new file mode 100644
index 0000000000..f2a52c7cee
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_projection.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "binder/expression/expression_util.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LBUG_API LogicalProjection : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::PROJECTION;
+
+public:
+    LogicalProjection(binder::expression_vector expressions, std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, std::move(child)}, expressions{std::move(expressions)} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override {
+        return binder::ExpressionUtil::toString(expressions);
+    }
+
+    binder::expression_vector getExpressionsToProject() const { return expressions; }
+    void setExpressionsToProject(const binder::expression_vector& expressions) {
+        this->expressions = expressions;
+    }
+
+    std::unordered_set<uint32_t> getDiscardedGroupsPos() const;
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalProjection>(expressions, children[0]->copy());
+    }
+
+private:
+    binder::expression_vector expressions;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_standalone_call.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_standalone_call.h
new file mode 100644
index 0000000000..0913309c52
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_standalone_call.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace main {
+struct Option;
+}
+namespace planner {
+
+class LogicalStandaloneCall final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::STANDALONE_CALL;
+
+public:
+    LogicalStandaloneCall(const main::Option* option,
+        std::shared_ptr<binder::Expression> optionValue)
+        : LogicalOperator{type_}, option{option}, optionValue{std::move(optionValue)} {}
+
+    const main::Option* getOption() const { return option; }
+    std::shared_ptr<binder::Expression> getOptionValue() const { return optionValue; }
+
+    std::string getExpressionsForPrinting() const override;
+
+    void computeFlatSchema() override { createEmptySchema(); }
+
+    void computeFactorizedSchema() override { createEmptySchema(); }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalStandaloneCall>(option, optionValue);
+    }
+
+protected:
+    const main::Option* option;
+    std::shared_ptr<binder::Expression> optionValue;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_table_function_call.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_table_function_call.h
new file mode 100644
index 0000000000..93dd979352
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_table_function_call.h
@@ -0,0 +1,46 @@
+#pragma once
+
+#include "function/table/bind_data.h"
+#include "function/table/table_function.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LBUG_API LogicalTableFunctionCall final : public LogicalOperator {
+    static constexpr LogicalOperatorType operatorType_ = LogicalOperatorType::TABLE_FUNCTION_CALL;
+
+public:
+    LogicalTableFunctionCall(function::TableFunction tableFunc,
+        std::unique_ptr<function::TableFuncBindData> bindData)
+        : LogicalOperator{operatorType_}, tableFunc{std::move(tableFunc)},
+          bindData{std::move(bindData)} {
+        setCardinality(this->bindData->numRows);
+    }
+
+    const function::TableFunction& getTableFunc() const { return tableFunc; }
+    const function::TableFuncBindData* getBindData() const { return bindData.get(); }
+
+    void setColumnSkips(std::vector<bool> columnSkips) {
+        bindData->setColumnSkips(std::move(columnSkips));
+    }
+    void setColumnPredicates(std::vector<storage::ColumnPredicateSet> predicates) {
+        bindData->setColumnPredicates(std::move(predicates));
+    }
+
+    void computeFlatSchema() override;
+    void computeFactorizedSchema() override;
+
+    std::string getExpressionsForPrinting() const override { return tableFunc.name; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalTableFunctionCall>(tableFunc, bindData->copy());
+    }
+
+private:
+    function::TableFunction tableFunc;
+    std::unique_ptr<function::TableFuncBindData> bindData;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_transaction.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_transaction.h
new file mode 100644
index 0000000000..7c32201d84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_transaction.h
@@ -0,0 +1,32 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+#include "transaction/transaction_action.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalTransaction : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::TRANSACTION;
+
+public:
+    explicit LogicalTransaction(transaction::TransactionAction transactionAction)
+        : LogicalOperator{type_}, transactionAction{transactionAction} {}
+
+    std::string getExpressionsForPrinting() const final { return std::string(); }
+
+    void computeFlatSchema() final { createEmptySchema(); }
+    void computeFactorizedSchema() final { createEmptySchema(); }
+
+    transaction::TransactionAction getTransactionAction() const { return transactionAction; }
+
+    std::unique_ptr<LogicalOperator> copy() final {
+        return std::make_unique<LogicalTransaction>(transactionAction);
+    }
+
+private:
+    transaction::TransactionAction transactionAction;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_union.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_union.h
new file mode 100644
index 0000000000..914c4428d0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_union.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include "logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalUnion : public LogicalOperator {
+public:
+    LogicalUnion(binder::expression_vector expressions,
+        const std::vector<std::shared_ptr<LogicalOperator>>& children)
+        : LogicalOperator{LogicalOperatorType::UNION_ALL, children},
+          expressionsToUnion{std::move(expressions)} {}
+
+    f_group_pos_set getGroupsPosToFlatten(uint32_t childIdx);
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override { return std::string{}; }
+
+    binder::expression_vector getExpressionsToUnion() const { return expressionsToUnion; }
+
+    Schema* getSchemaBeforeUnion(uint32_t idx) const { return children[idx]->getSchema(); }
+
+    std::unique_ptr<LogicalOperator> copy() override;
+
+private:
+    // If an expression to union has different flat/unflat state in different child, we
+    // need to flatten that expression in all the single queries.
+    bool requireFlatExpression(uint32_t expressionIdx);
+
+private:
+    binder::expression_vector expressionsToUnion;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_unwind.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_unwind.h
new file mode 100644
index 0000000000..3d510c65f6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/logical_unwind.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalUnwind : public LogicalOperator {
+public:
+    LogicalUnwind(std::shared_ptr<binder::Expression> inExpr,
+        std::shared_ptr<binder::Expression> outExpr, std::shared_ptr<binder::Expression> idExpr,
+        std::shared_ptr<LogicalOperator> childOperator)
+        : LogicalOperator{LogicalOperatorType::UNWIND, std::move(childOperator)},
+          inExpr{std::move(inExpr)}, outExpr{std::move(outExpr)}, idExpr{std::move(idExpr)} {}
+
+    f_group_pos_set getGroupsPosToFlatten();
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::shared_ptr<binder::Expression> getInExpr() const { return inExpr; }
+    std::shared_ptr<binder::Expression> getOutExpr() const { return outExpr; }
+    bool hasIDExpr() const { return idExpr != nullptr; }
+    std::shared_ptr<binder::Expression> getIDExpr() const { return idExpr; }
+
+    std::string getExpressionsForPrinting() const override { return inExpr->toString(); }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalUnwind>(inExpr, outExpr, idExpr, children[0]->copy());
+    }
+
+private:
+    std::shared_ptr<binder::Expression> inExpr;
+    std::shared_ptr<binder::Expression> outExpr;
+    std::shared_ptr<binder::Expression> idExpr;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/operator_print_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/operator_print_info.h
new file mode 100644
index 0000000000..253cbf83f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/operator_print_info.h
@@ -0,0 +1,19 @@
+#pragma once
+
+#include <memory>
+#include <string>
+
+namespace lbug {
+
+struct OPPrintInfo {
+    OPPrintInfo() {}
+    virtual ~OPPrintInfo() = default;
+
+    virtual std::string toString() const { return std::string(); }
+
+    virtual std::unique_ptr<OPPrintInfo> copy() const { return std::make_unique<OPPrintInfo>(); }
+
+    static std::unique_ptr<OPPrintInfo> EmptyInfo() { return std::make_unique<OPPrintInfo>(); }
+};
+
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_copy_from.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_copy_from.h
new file mode 100644
index 0000000000..7530c6e687
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_copy_from.h
@@ -0,0 +1,55 @@
+#pragma once
+
+#include "binder/copy/bound_copy_from.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalCopyFromPrintInfo final : OPPrintInfo {
+    std::string tableName;
+
+    explicit LogicalCopyFromPrintInfo(std::string tableName) : tableName(std::move(tableName)) {}
+
+    std::string toString() const override { return "Table name: " + tableName; };
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LogicalCopyFromPrintInfo>(new LogicalCopyFromPrintInfo(*this));
+    }
+
+private:
+    LogicalCopyFromPrintInfo(const LogicalCopyFromPrintInfo& other)
+        : OPPrintInfo(other), tableName(other.tableName) {}
+};
+
+class LogicalCopyFrom final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::COPY_FROM;
+
+public:
+    LogicalCopyFrom(binder::BoundCopyFromInfo info, std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, std::move(child), std::optional<common::cardinality_t>(0)},
+          info{std::move(info)} {}
+    LogicalCopyFrom(binder::BoundCopyFromInfo info, const logical_op_vector_t& children)
+        : LogicalOperator{type_, children}, info{std::move(info)} {}
+
+    std::string getExpressionsForPrinting() const override { return info.tableName; }
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    const binder::BoundCopyFromInfo* getInfo() const { return &info; }
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalCopyFromPrintInfo>(info.tableName);
+    }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalCopyFrom>(info.copy(), LogicalOperator::copy(children));
+    }
+
+private:
+    binder::BoundCopyFromInfo info;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_copy_to.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_copy_to.h
new file mode 100644
index 0000000000..3ccff5a878
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_copy_to.h
@@ -0,0 +1,59 @@
+#pragma once
+
+#include "function/export/export_function.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalCopyToPrintInfo final : OPPrintInfo {
+    std::vector<std::string> columnNames;
+    std::string fileName;
+
+    LogicalCopyToPrintInfo(std::vector<std::string> columnNames, std::string fileName)
+        : columnNames(std::move(columnNames)), fileName(std::move(fileName)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LogicalCopyToPrintInfo>(new LogicalCopyToPrintInfo(*this));
+    }
+
+private:
+    LogicalCopyToPrintInfo(const LogicalCopyToPrintInfo& other)
+        : OPPrintInfo(other), columnNames(other.columnNames), fileName(other.fileName) {}
+};
+
+class LogicalCopyTo final : public LogicalOperator {
+public:
+    LogicalCopyTo(std::unique_ptr<function::ExportFuncBindData> bindData,
+        function::ExportFunction exportFunc, std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{LogicalOperatorType::COPY_TO, std::move(child),
+              std::optional<common::cardinality_t>(0)},
+          bindData{std::move(bindData)}, exportFunc{std::move(exportFunc)} {}
+
+    f_group_pos_set getGroupsPosToFlatten();
+
+    std::string getExpressionsForPrinting() const override { return std::string{}; }
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::unique_ptr<function::ExportFuncBindData> getBindData() const { return bindData->copy(); }
+    function::ExportFunction getExportFunc() const { return exportFunc; };
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalCopyToPrintInfo>(bindData->columnNames, bindData->fileName);
+    }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalCopyTo>(bindData->copy(), exportFunc, children[0]->copy());
+    }
+
+private:
+    std::unique_ptr<function::ExportFuncBindData> bindData;
+    function::ExportFunction exportFunc;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_delete.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_delete.h
new file mode 100644
index 0000000000..c7b9e42606
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_delete.h
@@ -0,0 +1,58 @@
+#pragma once
+
+#include "binder/query/updating_clause/bound_delete_info.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalDeletePrintInfo final : OPPrintInfo {
+    std::vector<binder::BoundDeleteInfo> infos;
+
+    explicit LogicalDeletePrintInfo(std::vector<binder::BoundDeleteInfo> infos)
+        : infos{std::move(infos)} {}
+
+    std::string toString() const override {
+        std::string result = "";
+        for (auto& info : infos) {
+            result += info.toString();
+        }
+        return result;
+    }
+};
+
+class LogicalDelete final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::DELETE;
+
+public:
+    LogicalDelete(std::vector<binder::BoundDeleteInfo> infos,
+        std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, std::move(child)}, infos{std::move(infos)} {}
+
+    common::TableType getTableType() const {
+        KU_ASSERT(!infos.empty());
+        return infos[0].tableType;
+    }
+    const std::vector<binder::BoundDeleteInfo>& getInfos() const { return infos; }
+
+    void computeFactorizedSchema() override { copyChildSchema(0); }
+    void computeFlatSchema() override { copyChildSchema(0); }
+
+    std::string getExpressionsForPrinting() const override;
+
+    f_group_pos_set getGroupsPosToFlatten() const;
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalDeletePrintInfo>(copyVector(infos));
+    }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalDelete>(copyVector(infos), children[0]->copy());
+    }
+
+private:
+    std::vector<binder::BoundDeleteInfo> infos;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_insert.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_insert.h
new file mode 100644
index 0000000000..3a195cda46
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_insert.h
@@ -0,0 +1,57 @@
+#pragma once
+
+#include "common/enums/conflict_action.h"
+#include "common/enums/table_type.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalInsertInfo {
+    common::TableType tableType;
+    std::shared_ptr<binder::Expression> pattern;
+    binder::expression_vector columnExprs;
+    binder::expression_vector columnDataExprs;
+    std::vector<bool> isReturnColumnExprs;
+    common::ConflictAction conflictAction;
+
+    LogicalInsertInfo(common::TableType tableType, std::shared_ptr<binder::Expression> pattern,
+        binder::expression_vector columnExprs, binder::expression_vector columnDataExprs,
+        common::ConflictAction conflictAction)
+        : tableType{tableType}, pattern{std::move(pattern)}, columnExprs{std::move(columnExprs)},
+          columnDataExprs{std::move(columnDataExprs)}, conflictAction{conflictAction} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(LogicalInsertInfo);
+
+private:
+    LogicalInsertInfo(const LogicalInsertInfo& other)
+        : tableType{other.tableType}, pattern{other.pattern}, columnExprs{other.columnExprs},
+          columnDataExprs{other.columnDataExprs}, isReturnColumnExprs{other.isReturnColumnExprs},
+          conflictAction{other.conflictAction} {}
+};
+
+class LogicalInsert final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::INSERT;
+
+public:
+    LogicalInsert(std::vector<LogicalInsertInfo> infos, std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, std::move(child)}, infos{std::move(infos)} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const final;
+
+    f_group_pos_set getGroupsPosToFlatten();
+
+    const std::vector<LogicalInsertInfo>& getInfos() const { return infos; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalInsert>(copyVector(infos), children[0]->copy());
+    }
+
+private:
+    std::vector<LogicalInsertInfo> infos;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_merge.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_merge.h
new file mode 100644
index 0000000000..bd9c2d1856
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_merge.h
@@ -0,0 +1,85 @@
+#pragma once
+
+#include "binder/query/updating_clause/bound_set_info.h"
+#include "planner/operator/logical_operator.h"
+#include "planner/operator/persistent/logical_insert.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalMerge final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::MERGE;
+
+public:
+    LogicalMerge(std::shared_ptr<binder::Expression> existenceMark, binder::expression_vector keys,
+        std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, std::move(child)}, existenceMark{std::move(existenceMark)},
+          keys{std::move(keys)} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override { return {}; }
+
+    f_group_pos_set getGroupsPosToFlatten();
+
+    std::shared_ptr<binder::Expression> getExistenceMark() const { return existenceMark; }
+
+    void addInsertNodeInfo(LogicalInsertInfo info) { insertNodeInfos.push_back(std::move(info)); }
+    const std::vector<LogicalInsertInfo>& getInsertNodeInfos() const { return insertNodeInfos; }
+
+    void addInsertRelInfo(LogicalInsertInfo info) { insertRelInfos.push_back(std::move(info)); }
+    const std::vector<LogicalInsertInfo>& getInsertRelInfos() const { return insertRelInfos; }
+
+    void addOnCreateSetNodeInfo(binder::BoundSetPropertyInfo info) {
+        onCreateSetNodeInfos.push_back(std::move(info));
+    }
+    const std::vector<binder::BoundSetPropertyInfo>& getOnCreateSetNodeInfos() const {
+        return onCreateSetNodeInfos;
+    }
+
+    void addOnCreateSetRelInfo(binder::BoundSetPropertyInfo info) {
+        onCreateSetRelInfos.push_back(std::move(info));
+    }
+    const std::vector<binder::BoundSetPropertyInfo>& getOnCreateSetRelInfos() const {
+        return onCreateSetRelInfos;
+    }
+
+    void addOnMatchSetNodeInfo(binder::BoundSetPropertyInfo info) {
+        onMatchSetNodeInfos.push_back(std::move(info));
+    }
+    const std::vector<binder::BoundSetPropertyInfo>& getOnMatchSetNodeInfos() const {
+        return onMatchSetNodeInfos;
+    }
+
+    void addOnMatchSetRelInfo(binder::BoundSetPropertyInfo info) {
+        onMatchSetRelInfos.push_back(std::move(info));
+    }
+    const std::vector<binder::BoundSetPropertyInfo>& getOnMatchSetRelInfos() const {
+        return onMatchSetRelInfos;
+    }
+    const binder::expression_vector& getKeys() const { return keys; }
+
+    std::unique_ptr<LogicalOperator> copy() override;
+
+private:
+    std::shared_ptr<binder::Expression> existenceMark;
+    // Create infos
+    std::vector<LogicalInsertInfo> insertNodeInfos;
+    std::vector<LogicalInsertInfo> insertRelInfos;
+    // On Create infos
+    std::vector<binder::BoundSetPropertyInfo> onCreateSetNodeInfos;
+    std::vector<binder::BoundSetPropertyInfo> onCreateSetRelInfos;
+    // On Match infos
+    std::vector<binder::BoundSetPropertyInfo> onMatchSetNodeInfos;
+    std::vector<binder::BoundSetPropertyInfo> onMatchSetRelInfos;
+    // Key expressions used in merge hash table.
+    // If a merge clause is taking input from previous query parts
+    // E.g. UNWIND [1,1,3] AS x MERGE (n:N{id:x})
+    // Since we don't re-evaluate the existence of n for each x, we need to create n only for
+    // distinct x, i.e. 1 & 3. So there is a notion of key in MERGE.
+    binder::expression_vector keys;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_set.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_set.h
new file mode 100644
index 0000000000..560a30ea5f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/persistent/logical_set.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "binder/query/updating_clause/bound_set_info.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalSetProperty final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::SET_PROPERTY;
+
+public:
+    LogicalSetProperty(std::vector<binder::BoundSetPropertyInfo> infos,
+        std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, std::move(child)}, infos{std::move(infos)} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    f_group_pos_set getGroupsPosToFlatten(uint32_t idx) const;
+
+    std::string getExpressionsForPrinting() const override;
+
+    common::TableType getTableType() const;
+    const std::vector<binder::BoundSetPropertyInfo>& getInfos() const { return infos; }
+    const binder::BoundSetPropertyInfo& getInfo(uint32_t idx) const { return infos[idx]; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalSetProperty>(copyVector(infos), children[0]->copy());
+    }
+
+private:
+    std::vector<binder::BoundSetPropertyInfo> infos;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_dummy_scan.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_dummy_scan.h
new file mode 100644
index 0000000000..2bea164f3e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_dummy_scan.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalDummyScan final : public LogicalOperator {
+public:
+    explicit LogicalDummyScan() : LogicalOperator{LogicalOperatorType::DUMMY_SCAN} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    inline std::string getExpressionsForPrinting() const override { return std::string(); }
+
+    static std::shared_ptr<binder::Expression> getDummyExpression();
+
+    inline std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalDummyScan>();
+    }
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_expressions_scan.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_expressions_scan.h
new file mode 100644
index 0000000000..a0f1ba7681
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_expressions_scan.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include "binder/expression/expression_util.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+// LogicalExpressionsScan scans from an outer factorize table
+class LogicalExpressionsScan final : public LogicalOperator {
+public:
+    explicit LogicalExpressionsScan(binder::expression_vector expressions)
+        : LogicalOperator{LogicalOperatorType::EXPRESSIONS_SCAN},
+          expressions{std::move(expressions)}, outerAccumulate{nullptr} {}
+
+    inline void computeFactorizedSchema() override { computeSchema(); }
+    inline void computeFlatSchema() override { computeSchema(); }
+
+    inline std::string getExpressionsForPrinting() const override {
+        return binder::ExpressionUtil::toString(expressions);
+    }
+
+    inline binder::expression_vector getExpressions() const { return expressions; }
+    inline void setOuterAccumulate(LogicalOperator* op) { outerAccumulate = op; }
+    inline LogicalOperator* getOuterAccumulate() const { return outerAccumulate; }
+
+    inline std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalExpressionsScan>(expressions);
+    }
+
+private:
+    void computeSchema();
+
+private:
+    binder::expression_vector expressions;
+    LogicalOperator* outerAccumulate;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_index_look_up.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_index_look_up.h
new file mode 100644
index 0000000000..e0485e2100
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_index_look_up.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "binder/copy/index_look_up_info.h"
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+// This operator is specifically used to transform primary key to offset during relationship copy.
+// So it is not a source operator. I would suggest move this logic into rel copy instead of
+// maintaining an operator.
+class LogicalPrimaryKeyLookup final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::INDEX_LOOK_UP;
+
+public:
+    LogicalPrimaryKeyLookup(std::vector<binder::IndexLookupInfo> infos,
+        std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, std::move(child)}, infos{std::move(infos)} {}
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override;
+
+    uint32_t getNumInfos() const { return infos.size(); }
+    const binder::IndexLookupInfo& getInfo(uint32_t idx) const { return infos[idx]; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalPrimaryKeyLookup>(infos, children[0]->copy());
+    }
+
+private:
+    std::vector<binder::IndexLookupInfo> infos;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_scan_node_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_scan_node_table.h
new file mode 100644
index 0000000000..e363c69934
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/scan/logical_scan_node_table.h
@@ -0,0 +1,111 @@
+#pragma once
+
+#include "binder/expression/expression_util.h"
+#include "planner/operator/logical_operator.h"
+#include "storage/predicate/column_predicate.h"
+
+namespace lbug {
+namespace planner {
+
+enum class LogicalScanNodeTableType : uint8_t {
+    SCAN = 0,
+    PRIMARY_KEY_SCAN = 1,
+};
+
+struct ExtraScanNodeTableInfo {
+    virtual ~ExtraScanNodeTableInfo() = default;
+    virtual std::unique_ptr<ExtraScanNodeTableInfo> copy() const = 0;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+struct PrimaryKeyScanInfo final : ExtraScanNodeTableInfo {
+    std::shared_ptr<binder::Expression> key;
+
+    explicit PrimaryKeyScanInfo(std::shared_ptr<binder::Expression> key) : key{std::move(key)} {}
+
+    std::unique_ptr<ExtraScanNodeTableInfo> copy() const override {
+        return std::make_unique<PrimaryKeyScanInfo>(key);
+    }
+};
+
+struct LogicalScanNodeTablePrintInfo final : OPPrintInfo {
+    std::shared_ptr<binder::Expression> nodeID;
+    binder::expression_vector properties;
+
+    LogicalScanNodeTablePrintInfo(std::shared_ptr<binder::Expression> nodeID,
+        binder::expression_vector properties)
+        : nodeID{std::move(nodeID)}, properties{std::move(properties)} {}
+
+    std::string toString() const override {
+        auto result = "Tables: " + nodeID->toString();
+        if (nodeID->hasAlias()) {
+            result += "Alias: " + nodeID->getAlias();
+        }
+        result += ",Properties :" + binder::ExpressionUtil::toString(properties);
+        return result;
+    }
+};
+
+class LogicalScanNodeTable final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::SCAN_NODE_TABLE;
+    static constexpr LogicalScanNodeTableType defaultScanType = LogicalScanNodeTableType::SCAN;
+
+public:
+    LogicalScanNodeTable(std::shared_ptr<binder::Expression> nodeID,
+        std::vector<common::table_id_t> nodeTableIDs, binder::expression_vector properties,
+        common::cardinality_t cardinality = 0)
+        : LogicalOperator{type_}, scanType{defaultScanType}, nodeID{std::move(nodeID)},
+          nodeTableIDs{std::move(nodeTableIDs)}, properties{std::move(properties)} {
+        this->cardinality = cardinality;
+    }
+    LogicalScanNodeTable(const LogicalScanNodeTable& other);
+
+    void computeFactorizedSchema() override;
+    void computeFlatSchema() override;
+
+    std::string getExpressionsForPrinting() const override {
+        return nodeID->toString() + " " + binder::ExpressionUtil::toString(properties);
+    }
+
+    LogicalScanNodeTableType getScanType() const { return scanType; }
+    void setScanType(LogicalScanNodeTableType scanType_) { scanType = scanType_; }
+
+    std::shared_ptr<binder::Expression> getNodeID() const { return nodeID; }
+    std::vector<common::table_id_t> getTableIDs() const { return nodeTableIDs; }
+
+    binder::expression_vector getProperties() const { return properties; }
+    void addProperty(std::shared_ptr<binder::Expression> expr) {
+        properties.push_back(std::move(expr));
+    }
+    void setPropertyPredicates(std::vector<storage::ColumnPredicateSet> predicates) {
+        propertyPredicates = std::move(predicates);
+    }
+    const std::vector<storage::ColumnPredicateSet>& getPropertyPredicates() const {
+        return propertyPredicates;
+    }
+
+    void setExtraInfo(std::unique_ptr<ExtraScanNodeTableInfo> info) { extraInfo = std::move(info); }
+
+    ExtraScanNodeTableInfo* getExtraInfo() const { return extraInfo.get(); }
+
+    std::unique_ptr<OPPrintInfo> getPrintInfo() const override {
+        return std::make_unique<LogicalScanNodeTablePrintInfo>(nodeID, properties);
+    }
+
+    std::unique_ptr<LogicalOperator> copy() override;
+
+private:
+    LogicalScanNodeTableType scanType;
+    std::shared_ptr<binder::Expression> nodeID;
+    std::vector<common::table_id_t> nodeTableIDs;
+    binder::expression_vector properties;
+    std::vector<storage::ColumnPredicateSet> propertyPredicates;
+    std::unique_ptr<ExtraScanNodeTableInfo> extraInfo;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/schema.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/schema.h
new file mode 100644
index 0000000000..e82a6d63b9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/schema.h
@@ -0,0 +1,147 @@
+#pragma once
+
+#include <unordered_map>
+
+#include "binder/expression/expression.h"
+
+namespace lbug {
+namespace planner {
+
+using f_group_pos = uint32_t;
+using f_group_pos_set = std::unordered_set<f_group_pos>;
+constexpr f_group_pos INVALID_F_GROUP_POS = UINT32_MAX;
+
+class FactorizationGroup {
+    friend class Schema;
+    friend class CardinalityEstimator;
+
+public:
+    FactorizationGroup() : flat{false}, singleState{false}, cardinalityMultiplier{1} {}
+    FactorizationGroup(const FactorizationGroup& other)
+        : flat{other.flat}, singleState{other.singleState},
+          cardinalityMultiplier{other.cardinalityMultiplier}, expressions{other.expressions},
+          expressionNameToPos{other.expressionNameToPos} {}
+
+    void setFlat() {
+        KU_ASSERT(!flat);
+        flat = true;
+    }
+    bool isFlat() const { return flat; }
+    void setSingleState() {
+        KU_ASSERT(!singleState);
+        singleState = true;
+        setFlat();
+    }
+    bool isSingleState() const { return singleState; }
+
+    void setMultiplier(double multiplier) { cardinalityMultiplier = multiplier; }
+    double getMultiplier() const { return cardinalityMultiplier; }
+
+    void insertExpression(const std::shared_ptr<binder::Expression>& expression) {
+        KU_ASSERT(!expressionNameToPos.contains(expression->getUniqueName()));
+        expressionNameToPos.insert({expression->getUniqueName(), expressions.size()});
+        expressions.push_back(expression);
+    }
+    binder::expression_vector getExpressions() const { return expressions; }
+    uint32_t getExpressionPos(const binder::Expression& expression) const {
+        KU_ASSERT(expressionNameToPos.contains(expression.getUniqueName()));
+        return expressionNameToPos.at(expression.getUniqueName());
+    }
+
+private:
+    bool flat;
+    bool singleState;
+    double cardinalityMultiplier;
+    binder::expression_vector expressions;
+    std::unordered_map<std::string, uint32_t> expressionNameToPos;
+};
+
+class Schema {
+public:
+    common::idx_t getNumGroups() const { return groups.size(); }
+
+    FactorizationGroup* getGroup(const std::shared_ptr<binder::Expression>& expression) const {
+        return getGroup(getGroupPos(expression->getUniqueName()));
+    }
+
+    FactorizationGroup* getGroup(const std::string& expressionName) const {
+        return getGroup(getGroupPos(expressionName));
+    }
+
+    FactorizationGroup* getGroup(uint32_t pos) const { return groups[pos].get(); }
+
+    f_group_pos createGroup();
+
+    void insertToScope(const std::shared_ptr<binder::Expression>& expression, uint32_t groupPos);
+    void insertToGroupAndScope(const std::shared_ptr<binder::Expression>& expression,
+        uint32_t groupPos);
+    // Use these unsafe insert functions only if the operator may work with duplicate expressions.
+    // E.g. group by a.age, a.age
+    void insertToScopeMayRepeat(const std::shared_ptr<binder::Expression>& expression,
+        uint32_t groupPos);
+    void insertToGroupAndScopeMayRepeat(const std::shared_ptr<binder::Expression>& expression,
+        uint32_t groupPos);
+
+    void insertToGroupAndScope(const binder::expression_vector& expressions, uint32_t groupPos);
+
+    f_group_pos getGroupPos(const binder::Expression& expression) const {
+        return getGroupPos(expression.getUniqueName());
+    }
+
+    f_group_pos getGroupPos(const std::string& expressionName) const;
+
+    std::pair<f_group_pos, uint32_t> getExpressionPos(const binder::Expression& expression) const {
+        auto groupPos = getGroupPos(expression);
+        return std::make_pair(groupPos, groups[groupPos]->getExpressionPos(expression));
+    }
+
+    void flattenGroup(f_group_pos pos) { groups[pos]->setFlat(); }
+    void setGroupAsSingleState(f_group_pos pos) { groups[pos]->setSingleState(); }
+
+    bool isExpressionInScope(const binder::Expression& expression) const;
+
+    binder::expression_vector getExpressionsInScope() const { return expressionsInScope; }
+
+    binder::expression_vector getExpressionsInScope(f_group_pos pos) const;
+
+    bool evaluable(const binder::Expression& expression) const;
+
+    void clearExpressionsInScope() {
+        expressionNameToGroupPos.clear();
+        expressionsInScope.clear();
+    }
+
+    // Get the group positions containing at least one expression in scope.
+    f_group_pos_set getGroupsPosInScope() const;
+
+    LBUG_API std::unique_ptr<Schema> copy() const;
+
+    void clear();
+
+private:
+    size_t getNumGroups(bool isFlat) const;
+
+private:
+    std::vector<std::unique_ptr<FactorizationGroup>> groups;
+    std::unordered_map<std::string, uint32_t> expressionNameToGroupPos;
+    // Our projection doesn't explicitly remove expressions. Instead, we keep track of what
+    // expressions are in scope (i.e. being projected).
+    binder::expression_vector expressionsInScope;
+};
+
+class SchemaUtils {
+public:
+    // Given a set of factorization group, a leading group is selected as the unFlat group (caller
+    // should ensure at most one unFlat group which is our general assumption of factorization). If
+    // all groups are flat, we select any (the first) group as leading group.
+    static f_group_pos getLeadingGroupPos(const std::unordered_set<f_group_pos>& groupPositions,
+        const Schema& schema);
+
+    static void validateAtMostOneUnFlatGroup(const std::unordered_set<f_group_pos>& groupPositions,
+        const Schema& schema);
+    static void validateNoUnFlatGroup(const std::unordered_set<f_group_pos>& groupPositions,
+        const Schema& schema);
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_attach_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_attach_database.h
new file mode 100644
index 0000000000..ee88ac9ce9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_attach_database.h
@@ -0,0 +1,46 @@
+#pragma once
+
+#include "binder/bound_attach_info.h"
+#include "logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+struct LogicalAttachDatabasePrintInfo final : OPPrintInfo {
+    std::string dbName;
+
+    explicit LogicalAttachDatabasePrintInfo(std::string dbName) : dbName(std::move(dbName)) {}
+
+    std::string toString() const override { return "Database: " + dbName; };
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LogicalAttachDatabasePrintInfo>(
+            new LogicalAttachDatabasePrintInfo(*this));
+    }
+
+private:
+    LogicalAttachDatabasePrintInfo(const LogicalAttachDatabasePrintInfo& other)
+        : OPPrintInfo(other), dbName(other.dbName) {}
+};
+
+class LogicalAttachDatabase final : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::ATTACH_DATABASE;
+
+public:
+    explicit LogicalAttachDatabase(binder::AttachInfo attachInfo)
+        : LogicalSimple{type_}, attachInfo{std::move(attachInfo)} {}
+
+    binder::AttachInfo getAttachInfo() const { return attachInfo; }
+
+    std::string getExpressionsForPrinting() const override { return attachInfo.dbPath; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalAttachDatabase>(attachInfo);
+    }
+
+private:
+    binder::AttachInfo attachInfo;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_detach_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_detach_database.h
new file mode 100644
index 0000000000..776e4c1fb3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_detach_database.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalDetachDatabase final : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::DETACH_DATABASE;
+
+public:
+    explicit LogicalDetachDatabase(std::string dbName)
+        : LogicalSimple{type_}, dbName{std::move(dbName)} {}
+
+    std::string getDBName() const { return dbName; }
+
+    std::string getExpressionsForPrinting() const override { return dbName; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalDetachDatabase>(dbName);
+    }
+
+private:
+    std::string dbName;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_export_db.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_export_db.h
new file mode 100644
index 0000000000..56806da756
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_export_db.h
@@ -0,0 +1,41 @@
+#pragma once
+
+#include "common/copier_config/csv_reader_config.h"
+#include "common/copier_config/file_scan_info.h"
+#include "logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalExportDatabase final : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::EXPORT_DATABASE;
+
+public:
+    LogicalExportDatabase(common::FileScanInfo boundFileInfo,
+        const std::vector<std::shared_ptr<LogicalOperator>>& plans, bool exportSchemaOnly)
+        : LogicalSimple{type_, plans}, boundFileInfo{std::move(boundFileInfo)},
+          schemaOnly{exportSchemaOnly} {}
+
+    std::string getFilePath() const { return boundFileInfo.filePaths[0]; }
+    common::FileType getFileType() const { return boundFileInfo.fileTypeInfo.fileType; }
+    common::CSVOption getCopyOption() const {
+        auto csvConfig = common::CSVReaderConfig::construct(boundFileInfo.options);
+        return csvConfig.option.copy();
+    }
+    const common::FileScanInfo* getBoundFileInfo() const { return &boundFileInfo; }
+    std::string getExpressionsForPrinting() const override { return std::string{}; }
+
+    bool isSchemaOnly() const { return schemaOnly; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalExportDatabase>(boundFileInfo.copy(), copyVector(children),
+            schemaOnly);
+    }
+
+private:
+    common::FileScanInfo boundFileInfo;
+    bool schemaOnly;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_extension.h
new file mode 100644
index 0000000000..6852ee82e2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_extension.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "extension/extension_action.h"
+#include "logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalExtension final : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::EXTENSION;
+
+public:
+    explicit LogicalExtension(std::unique_ptr<extension::ExtensionAuxInfo> auxInfo)
+        : LogicalSimple{type_}, auxInfo{std::move(auxInfo)} {}
+
+    std::string getExpressionsForPrinting() const override { return path; }
+
+    const extension::ExtensionAuxInfo& getAuxInfo() const { return *auxInfo; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalExtension>(auxInfo->copy());
+    }
+
+private:
+    std::unique_ptr<extension::ExtensionAuxInfo> auxInfo;
+    std::string path;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_import_db.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_import_db.h
new file mode 100644
index 0000000000..b5cd5241aa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_import_db.h
@@ -0,0 +1,32 @@
+#pragma once
+
+#include "logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalImportDatabase : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::IMPORT_DATABASE;
+
+public:
+    LogicalImportDatabase(std::string query, std::string indexQuery)
+        : LogicalSimple{type_}, query{std::move(query)}, indexQuery{std::move(indexQuery)} {}
+
+    std::string getQuery() const { return query; }
+
+    std::string getIndexQuery() const { return indexQuery; }
+
+    std::string getExpressionsForPrinting() const override { return std::string{}; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return make_unique<LogicalImportDatabase>(query, indexQuery);
+    }
+
+private:
+    // see comment in BoundImportDatabase
+    std::string query;
+    std::string indexQuery;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_simple.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_simple.h
new file mode 100644
index 0000000000..ada03ee2c0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_simple.h
@@ -0,0 +1,21 @@
+#pragma once
+
+#include "planner/operator/logical_operator.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalSimple : public LogicalOperator {
+public:
+    explicit LogicalSimple(LogicalOperatorType operatorType) : LogicalOperator{operatorType} {}
+    LogicalSimple(LogicalOperatorType operatorType,
+        const std::vector<std::shared_ptr<LogicalOperator>>& plans)
+        : LogicalOperator{operatorType, plans} {}
+
+    void computeFactorizedSchema() override;
+
+    void computeFlatSchema() override;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_use_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_use_database.h
new file mode 100644
index 0000000000..d7914e34dd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/simple/logical_use_database.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+class LogicalUseDatabase final : public LogicalSimple {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::USE_DATABASE;
+
+public:
+    explicit LogicalUseDatabase(std::string dbName)
+        : LogicalSimple{type_}, dbName{std::move(dbName)} {}
+
+    std::string getDBName() const { return dbName; }
+
+    std::string getExpressionsForPrinting() const override { return dbName; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        return std::make_unique<LogicalUseDatabase>(dbName);
+    }
+
+private:
+    std::string dbName;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/sip/logical_semi_masker.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/sip/logical_semi_masker.h
new file mode 100644
index 0000000000..32f4c40d45
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/sip/logical_semi_masker.h
@@ -0,0 +1,117 @@
+#pragma once
+
+#include "common/enums/extend_direction.h"
+#include "common/exception/runtime.h"
+#include "planner/operator/logical_operator.h"
+#include "semi_mask_target_type.h"
+
+namespace lbug {
+namespace planner {
+
+/*
+ * NODE
+ * offsets are collected from value vector of type NODE_ID (INTERNAL_ID)
+ *
+ * PATH
+ * offsets are collected from value vector of type PATH (LIST[INTERNAL_ID]). This is a fast-path
+ * code used when scanning properties along the path.
+ *
+ * */
+enum class SemiMaskKeyType : uint8_t {
+    NODE = 0,
+    PATH = 1,
+    NODE_ID_LIST = 2,
+};
+
+struct ExtraKeyInfo {
+    virtual ~ExtraKeyInfo() = default;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+    virtual std::unique_ptr<ExtraKeyInfo> copy() const = 0;
+};
+
+struct ExtraPathKeyInfo final : ExtraKeyInfo {
+    common::ExtendDirection direction;
+
+    explicit ExtraPathKeyInfo(common::ExtendDirection direction) : direction{direction} {}
+
+    std::unique_ptr<ExtraKeyInfo> copy() const override {
+        return std::make_unique<ExtraPathKeyInfo>(direction);
+    }
+};
+
+struct ExtraNodeIDListKeyInfo final : ExtraKeyInfo {
+    std::shared_ptr<binder::Expression> srcNodeID;
+    std::shared_ptr<binder::Expression> dstNodeID;
+
+    ExtraNodeIDListKeyInfo(std::shared_ptr<binder::Expression> srcNodeID,
+        std::shared_ptr<binder::Expression> dstNodeID)
+        : srcNodeID{std::move(srcNodeID)}, dstNodeID{std::move(dstNodeID)} {}
+
+    std::unique_ptr<ExtraKeyInfo> copy() const override {
+        return std::make_unique<ExtraNodeIDListKeyInfo>(srcNodeID, dstNodeID);
+    }
+};
+
+class LBUG_API LogicalSemiMasker final : public LogicalOperator {
+    static constexpr LogicalOperatorType type_ = LogicalOperatorType::SEMI_MASKER;
+
+public:
+    LogicalSemiMasker(SemiMaskKeyType keyType, SemiMaskTargetType targetType,
+        std::shared_ptr<binder::Expression> key, std::vector<common::table_id_t> nodeTableIDs,
+        std::shared_ptr<LogicalOperator> child)
+        : LogicalOperator{type_, std::move(child)}, keyType{keyType}, targetType{targetType},
+          key{std::move(key)}, nodeTableIDs{std::move(nodeTableIDs)} {}
+
+    ~LogicalSemiMasker() override;
+
+    void computeFactorizedSchema() override { copyChildSchema(0); }
+    void computeFlatSchema() override { copyChildSchema(0); }
+
+    std::string getExpressionsForPrinting() const override { return key->toString(); }
+
+    SemiMaskKeyType getKeyType() const { return keyType; }
+
+    SemiMaskTargetType getTargetType() const { return targetType; }
+
+    std::shared_ptr<binder::Expression> getKey() const { return key; }
+    void setExtraKeyInfo(std::unique_ptr<ExtraKeyInfo> extraInfo) {
+        extraKeyInfo = std::move(extraInfo);
+    }
+    ExtraKeyInfo* getExtraKeyInfo() const { return extraKeyInfo.get(); }
+
+    std::vector<common::table_id_t> getNodeTableIDs() const { return nodeTableIDs; }
+
+    void addTarget(const LogicalOperator* op) { targetOps.push_back(op); }
+    std::vector<const LogicalOperator*> getTargetOperators() const { return targetOps; }
+
+    std::unique_ptr<LogicalOperator> copy() override {
+        if (!targetOps.empty()) {
+            throw common::RuntimeException(
+                "LogicalSemiMasker::copy() should not be called when ops "
+                "is not empty. Raw pointers will be point to corrupted object after copy.");
+        }
+        auto result = std::make_unique<LogicalSemiMasker>(keyType, targetType, key, nodeTableIDs,
+            children[0]->copy());
+        if (extraKeyInfo != nullptr) {
+            result->setExtraKeyInfo(extraKeyInfo->copy());
+        }
+        return result;
+    }
+
+private:
+    SemiMaskKeyType keyType;
+    SemiMaskTargetType targetType;
+    std::shared_ptr<binder::Expression> key;
+    std::unique_ptr<ExtraKeyInfo> extraKeyInfo = nullptr;
+    std::vector<common::table_id_t> nodeTableIDs;
+    // Operators accepting semi masker
+    std::vector<const LogicalOperator*> targetOps;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/sip/semi_mask_target_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/sip/semi_mask_target_type.h
new file mode 100644
index 0000000000..7602278d7f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/sip/semi_mask_target_type.h
@@ -0,0 +1,17 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace planner {
+
+enum class SemiMaskTargetType : uint8_t {
+    SCAN_NODE = 0,
+    RECURSIVE_EXTEND_INPUT_NODE = 2,
+    RECURSIVE_EXTEND_OUTPUT_NODE = 3,
+    RECURSIVE_EXTEND_PATH_NODE = 4,
+    GDS_GRAPH_NODE = 5,
+};
+
+}
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/sip/side_way_info_passing.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/sip/side_way_info_passing.h
new file mode 100644
index 0000000000..6d73d726b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/operator/sip/side_way_info_passing.h
@@ -0,0 +1,79 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace planner {
+
+enum class SemiMaskPosition : uint8_t {
+    NONE = 0,
+    ON_BUILD = 1,
+    ON_PROBE = 2,
+    PROHIBIT_PROBE_TO_BUILD = 3,
+    PROHIBIT = 4,
+};
+
+/*
+ * If semi mask is present, scan pipelines needs to be constructed before semi mask pipelines.
+ * SIPDependency instructs whether probe or build should be constructed first.
+ */
+enum class SIPDependency : uint8_t {
+    NONE = 0,
+    PROBE_DEPENDS_ON_BUILD = 1,
+    BUILD_DEPENDS_ON_PROBE = 2,
+};
+
+/*
+ * Direction of side way information passing. If direction is probe to build, then probe side
+ * must have been materialized, and we need to construct a new pipeline to scan materialized result.
+ * We use SIPDirection in the mapper to create pipelines.
+ * */
+enum class SIPDirection {
+    NONE = 0,
+    PROBE_TO_BUILD = 1,
+    BUILD_TO_PROBE = 2,
+    // TODO(Xiyang/Guodong): Temp hack to allow vector index search to pass semi mask.
+    FORCE_BUILD_TO_PROBE = 3,
+};
+
+/*
+ *
+ * We perform side way information passing in the following cases
+ * 1. Inner hash join
+ *
+ * If we add semi mask on build side, position is ON_BUILD, direction is BUILD_TO_PROBE and
+ * dependency is PROBE_DEPENDS_ON_BUILD (because scan need to be generated before semi masker).
+ *
+ * If we add semi mask on probe side, position is ON_PROBE, direction is PROBE_TO_BUILD
+ * and dependency is BUILD_DEPENDS_ON_PROBE.
+ *
+ * 2. Unnesting correlated subquery
+ *
+ * When unnesting a correlated subquery, we first accumulate the probe plan and pass information to
+ * the build side. Semi mask position is NONE, direction is PROBE_TO_BUILD and dependency is
+ * PROBE_DEPENDS_ON_BUILD.
+ *
+ * 3. Optional match after update
+ *
+ * When performing optional match update, since we only have left join operator, update pipeline
+ * is placed on the probe side. However, by semantic, optional match should scan updated result.
+ * So we accumulate the probe side and make it the right-most pipeline to make sure update pipeline
+ * is executed before optional match pipeline.
+ *
+ * TODO(Xiyang): it worth thinking if we should simply put outer plan always on the build side.
+ *
+ * We disable semi-mask-based sip in the following cases
+ *
+ * During join order enumeration, we might disable semi mask if probe side cardinality is large to
+ * avoid large materialization probe side intermediate result.
+ *
+ * During filter push down, we disable semi mask if join condition is not id-based
+ * */
+struct SIPInfo {
+    SemiMaskPosition position = SemiMaskPosition::NONE;
+    SIPDependency dependency = SIPDependency::NONE;
+    SIPDirection direction = SIPDirection::NONE;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/planner.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/planner.h
new file mode 100644
index 0000000000..fd3e5fea16
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/planner.h
@@ -0,0 +1,352 @@
+#pragma once
+
+#include "binder/bound_statement.h"
+#include "binder/query/query_graph.h"
+#include "common/enums/accumulate_type.h"
+#include "common/enums/extend_direction.h"
+#include "common/enums/join_type.h"
+#include "planner/join_order/cardinality_estimator.h"
+#include "planner/join_order_enumerator_context.h"
+#include "planner/operator/logical_plan.h"
+#include "planner/operator/sip/semi_mask_target_type.h"
+
+namespace lbug {
+namespace extension {
+class PlannerExtension;
+}
+namespace binder {
+struct BoundTableScanInfo;
+struct BoundCopyFromInfo;
+struct BoundInsertInfo;
+struct BoundSetPropertyInfo;
+struct BoundDeleteInfo;
+struct BoundJoinHintNode;
+class NormalizedSingleQuery;
+class NormalizedQueryPart;
+class BoundReadingClause;
+class BoundUpdatingClause;
+class BoundProjectionBody;
+} // namespace binder
+namespace planner {
+
+struct LogicalInsertInfo;
+
+enum class SubqueryPlanningType : uint8_t {
+    NONE = 0,
+    UNNEST_CORRELATED = 1,
+    CORRELATED = 2,
+};
+
+struct QueryGraphPlanningInfo {
+    // Predicate info.
+    binder::expression_vector predicates;
+    // Subquery info.
+    SubqueryPlanningType subqueryType = SubqueryPlanningType::NONE;
+    binder::expression_vector corrExprs;
+    cardinality_t corrExprsCard = 0;
+    // Join hint info.
+    std::shared_ptr<binder::BoundJoinHintNode> hint = nullptr;
+
+    bool containsCorrExpr(const binder::Expression& expr) const;
+};
+
+// Group property expressions based on node/relationship.
+class PropertyExprCollection {
+public:
+    void addProperties(const std::string& patternName,
+        std::shared_ptr<binder::Expression> property);
+    binder::expression_vector getProperties(const binder::Expression& pattern) const;
+    binder::expression_vector getProperties() const;
+
+    void clear();
+
+private:
+    std::unordered_map<std::string, binder::expression_vector> patternNameToProperties;
+};
+
+class LBUG_API Planner {
+public:
+    explicit Planner(main::ClientContext* clientContext);
+    DELETE_COPY_AND_MOVE(Planner);
+
+    LogicalPlan planStatement(const binder::BoundStatement& statement);
+
+    // Plan simple statement.
+    LogicalPlan planCreateTable(const binder::BoundStatement& statement);
+    LogicalPlan planCreateType(const binder::BoundStatement& statement);
+    LogicalPlan planCreateSequence(const binder::BoundStatement& statement);
+    LogicalPlan planCreateMacro(const binder::BoundStatement& statement);
+    LogicalPlan planDrop(const binder::BoundStatement& statement);
+    LogicalPlan planAlter(const binder::BoundStatement& statement);
+    LogicalPlan planStandaloneCall(const binder::BoundStatement& statement);
+    LogicalPlan planStandaloneCallFunction(const binder::BoundStatement& statement);
+    LogicalPlan planExplain(const binder::BoundStatement& statement);
+    LogicalPlan planTransaction(const binder::BoundStatement& statement);
+    LogicalPlan planExtension(const binder::BoundStatement& statement);
+    LogicalPlan planAttachDatabase(const binder::BoundStatement& statement);
+    LogicalPlan planDetachDatabase(const binder::BoundStatement& statement);
+    LogicalPlan planUseDatabase(const binder::BoundStatement& statement);
+    LogicalPlan planExtensionClause(const binder::BoundStatement& statement);
+
+    // Plan copy.
+    LogicalPlan planCopyTo(const binder::BoundStatement& statement);
+    LogicalPlan planCopyFrom(const binder::BoundStatement& statement);
+    LogicalPlan planCopyNodeFrom(const binder::BoundCopyFromInfo* info);
+    LogicalPlan planCopyRelFrom(const binder::BoundCopyFromInfo* info);
+
+    // Plan export/import database
+    std::vector<std::shared_ptr<LogicalOperator>> planExportTableData(
+        const binder::BoundStatement& boundExportDatabase);
+    LogicalPlan planExportDatabase(const binder::BoundStatement& statement);
+    LogicalPlan planImportDatabase(const binder::BoundStatement& statement);
+
+    // Plan query.
+    LogicalPlan planQuery(const binder::BoundStatement& boundStatement);
+    LogicalPlan planSingleQuery(const binder::NormalizedSingleQuery& singleQuery);
+    void planQueryPart(const binder::NormalizedQueryPart& queryPart, LogicalPlan& prevPlan);
+
+    // Plan read.
+    void planReadingClause(const binder::BoundReadingClause& readingClause, LogicalPlan& plan);
+    void planMatchClause(const binder::BoundReadingClause& readingClause, LogicalPlan& plan);
+    void planUnwindClause(const binder::BoundReadingClause& readingClause, LogicalPlan& plan);
+    void planTableFunctionCall(const binder::BoundReadingClause& readingClause, LogicalPlan& plan);
+
+    void planReadOp(std::shared_ptr<LogicalOperator> op,
+        const binder::expression_vector& predicates, LogicalPlan& plan);
+    void planLoadFrom(const binder::BoundReadingClause& readingClause, LogicalPlan& plan);
+
+    // Plan updating
+    void planUpdatingClause(const binder::BoundUpdatingClause& updatingClause, LogicalPlan& plan);
+    void planInsertClause(const binder::BoundUpdatingClause& updatingClause, LogicalPlan& plan);
+    void planMergeClause(const binder::BoundUpdatingClause& updatingClause, LogicalPlan& plan);
+    void planSetClause(const binder::BoundUpdatingClause& updatingClause, LogicalPlan& plan);
+    void planDeleteClause(const binder::BoundUpdatingClause& updatingClause, LogicalPlan& plan);
+
+    // Plan projection
+    void planProjectionBody(const binder::BoundProjectionBody* projectionBody, LogicalPlan& plan);
+    void planAggregate(const binder::expression_vector& expressionsToAggregate,
+        const binder::expression_vector& expressionsToGroupBy, LogicalPlan& plan);
+    void planOrderBy(const binder::expression_vector& expressionsToProject,
+        const binder::expression_vector& expressionsToOrderBy, const std::vector<bool>& isAscOrders,
+        LogicalPlan& plan);
+
+    // Plan subquery
+    void planOptionalMatch(const binder::QueryGraphCollection& queryGraphCollection,
+        const binder::expression_vector& predicates, LogicalPlan& leftPlan,
+        std::shared_ptr<binder::BoundJoinHintNode> hint);
+    // Write whether optional match succeed or not to mark.
+    void planOptionalMatch(const binder::QueryGraphCollection& queryGraphCollection,
+        const binder::expression_vector& predicates, std::shared_ptr<binder::Expression> mark,
+        LogicalPlan& leftPlan, std::shared_ptr<binder::BoundJoinHintNode> hint);
+    void planRegularMatch(const binder::QueryGraphCollection& queryGraphCollection,
+        const binder::expression_vector& predicates, LogicalPlan& leftPlan,
+        std::shared_ptr<binder::BoundJoinHintNode> hint);
+    void planSubquery(const std::shared_ptr<binder::Expression>& subquery, LogicalPlan& outerPlan);
+    void planSubqueryIfNecessary(std::shared_ptr<binder::Expression> expression, LogicalPlan& plan);
+
+    static binder::expression_vector getCorrelatedExprs(
+        const binder::QueryGraphCollection& collection, const binder::expression_vector& predicates,
+        Schema* outerSchema);
+
+    // Plan query graphs
+    LogicalPlan planQueryGraphCollectionInNewContext(
+        const binder::QueryGraphCollection& queryGraphCollection,
+        const QueryGraphPlanningInfo& info);
+    LogicalPlan planQueryGraphCollection(const binder::QueryGraphCollection& queryGraphCollection,
+        const QueryGraphPlanningInfo& info);
+    LogicalPlan planQueryGraph(const binder::QueryGraph& queryGraph,
+        const QueryGraphPlanningInfo& info);
+
+    // Plan node/rel table scan
+    void planBaseTableScans(const QueryGraphPlanningInfo& info);
+    void planCorrelatedExpressionsScan(const QueryGraphPlanningInfo& info);
+    void planNodeScan(uint32_t nodePos);
+    void planNodeIDScan(uint32_t nodePos);
+    void planRelScan(uint32_t relPos);
+    void appendExtend(std::shared_ptr<binder::NodeExpression> boundNode,
+        std::shared_ptr<binder::NodeExpression> nbrNode, std::shared_ptr<binder::RelExpression> rel,
+        common::ExtendDirection direction, const binder::expression_vector& properties,
+        LogicalPlan& plan);
+
+    // Plan dp level
+    void planLevel(uint32_t level);
+    void planLevelExactly(uint32_t level);
+    void planLevelApproximately(uint32_t level);
+
+    // Plan worst case optimal join
+    void planWCOJoin(uint32_t leftLevel, uint32_t rightLevel);
+    void planWCOJoin(const binder::SubqueryGraph& subgraph,
+        const std::vector<std::shared_ptr<binder::RelExpression>>& rels,
+        const std::shared_ptr<binder::NodeExpression>& intersectNode);
+
+    // Plan index-nested-loop join / hash join
+    void planInnerJoin(uint32_t leftLevel, uint32_t rightLevel);
+    bool tryPlanINLJoin(const binder::SubqueryGraph& subgraph,
+        const binder::SubqueryGraph& otherSubgraph,
+        const std::vector<std::shared_ptr<binder::NodeExpression>>& joinNodes);
+    void planInnerHashJoin(const binder::SubqueryGraph& subgraph,
+        const binder::SubqueryGraph& otherSubgraph,
+        const std::vector<std::shared_ptr<binder::NodeExpression>>& joinNodes, bool flipPlan);
+
+    // Plan semi mask
+    void appendNodeSemiMask(SemiMaskTargetType targetType, const binder::NodeExpression& node,
+        LogicalPlan& plan);
+    LogicalPlan getNodeSemiMaskPlan(SemiMaskTargetType targetType,
+        const binder::NodeExpression& node, std::shared_ptr<binder::Expression> nodePredicate);
+
+    // This is mostly used when we try to reinterpret function output as node and read its
+    // properties, e.g. query_vector_index, gds algorithms ...
+    LogicalPlan getNodePropertyScanPlan(const binder::NodeExpression& node);
+
+    // Append dummy sink
+    void appendDummySink(LogicalPlan& plan);
+
+    // Append empty result
+    void appendEmptyResult(LogicalPlan& plan);
+
+    // Append updating operators
+    void appendInsertNode(const std::vector<const binder::BoundInsertInfo*>& boundInsertInfos,
+        LogicalPlan& plan);
+    void appendInsertRel(const std::vector<const binder::BoundInsertInfo*>& boundInsertInfos,
+        LogicalPlan& plan);
+
+    void appendSetProperty(const std::vector<binder::BoundSetPropertyInfo>& infos,
+        LogicalPlan& plan);
+    void appendDelete(const std::vector<binder::BoundDeleteInfo>& infos, LogicalPlan& plan);
+    std::unique_ptr<LogicalInsertInfo> createLogicalInsertInfo(
+        const binder::BoundInsertInfo* info) const;
+
+    // Append projection operators
+    void appendProjection(const binder::expression_vector& expressionsToProject, LogicalPlan& plan);
+    void appendAggregate(const binder::expression_vector& expressionsToGroupBy,
+        const binder::expression_vector& expressionsToAggregate, LogicalPlan& plan);
+    void appendOrderBy(const binder::expression_vector& expressions,
+        const std::vector<bool>& isAscOrders, LogicalPlan& plan);
+    void appendMultiplicityReducer(LogicalPlan& plan);
+    void appendLimit(std::shared_ptr<binder::Expression> skipNum,
+        std::shared_ptr<binder::Expression> limitNum, LogicalPlan& plan);
+
+    // Append scan operators
+    void appendExpressionsScan(const binder::expression_vector& expressions, LogicalPlan& plan);
+    void appendScanNodeTable(std::shared_ptr<binder::Expression> nodeID,
+        std::vector<common::table_id_t> tableIDs, const binder::expression_vector& properties,
+        LogicalPlan& plan);
+
+    // Append extend operators
+    void appendNonRecursiveExtend(const std::shared_ptr<binder::NodeExpression>& boundNode,
+        const std::shared_ptr<binder::NodeExpression>& nbrNode,
+        const std::shared_ptr<binder::RelExpression>& rel, common::ExtendDirection direction,
+        bool extendFromSource, const binder::expression_vector& properties, LogicalPlan& plan);
+    void appendRecursiveExtend(const std::shared_ptr<binder::NodeExpression>& boundNode,
+        const std::shared_ptr<binder::NodeExpression>& nbrNode,
+        const std::shared_ptr<binder::RelExpression>& rel, common::ExtendDirection direction,
+        LogicalPlan& plan);
+    void createPathNodePropertyScanPlan(const std::shared_ptr<binder::NodeExpression>& node,
+        const binder::expression_vector& properties, LogicalPlan& plan);
+    void createPathRelPropertyScanPlan(const std::shared_ptr<binder::NodeExpression>& boundNode,
+        const std::shared_ptr<binder::NodeExpression>& nbrNode,
+        const std::shared_ptr<binder::RelExpression>& recursiveRel,
+        common::ExtendDirection direction, bool extendFromSource,
+        const binder::expression_vector& properties, LogicalPlan& plan);
+    void appendNodeLabelFilter(std::shared_ptr<binder::Expression> nodeID,
+        std::unordered_set<common::table_id_t> tableIDSet, LogicalPlan& plan);
+
+    // Append Join operators
+    void appendHashJoin(const binder::expression_vector& joinNodeIDs, common::JoinType joinType,
+        LogicalPlan& probePlan, LogicalPlan& buildPlan, LogicalPlan& resultPlan);
+    void appendHashJoin(const binder::expression_vector& joinNodeIDs, common::JoinType joinType,
+        std::shared_ptr<binder::Expression> mark, LogicalPlan& probePlan, LogicalPlan& buildPlan,
+        LogicalPlan& resultPlan);
+    void appendHashJoin(const std::vector<binder::expression_pair>& joinConditions,
+        common::JoinType joinType, std::shared_ptr<binder::Expression> mark, LogicalPlan& probePlan,
+        LogicalPlan& buildPlan, LogicalPlan& resultPlan);
+    void appendAccHashJoin(const std::vector<binder::expression_pair>& joinConditions,
+        common::JoinType joinType, std::shared_ptr<binder::Expression> mark, LogicalPlan& probePlan,
+        LogicalPlan& buildPlan, LogicalPlan& resultPlan);
+    void appendMarkJoin(const binder::expression_vector& joinNodeIDs,
+        const std::shared_ptr<binder::Expression>& mark, LogicalPlan& probePlan,
+        LogicalPlan& buildPlan, LogicalPlan& resultPlan);
+    void appendMarkJoin(const std::vector<binder::expression_pair>& joinConditions,
+        const std::shared_ptr<binder::Expression>& mark, LogicalPlan& probePlan,
+        LogicalPlan& buildPlan, LogicalPlan& resultPlan);
+    void appendIntersect(const std::shared_ptr<binder::Expression>& intersectNodeID,
+        binder::expression_vector& boundNodeIDs, LogicalPlan& probePlan,
+        std::vector<LogicalPlan>& buildPlans);
+
+    void appendCrossProduct(const LogicalPlan& probePlan, const LogicalPlan& buildPlan,
+        LogicalPlan& resultPlan);
+    // Optional cross product produce at least one tuple for each probe tuple
+    void appendOptionalCrossProduct(std::shared_ptr<binder::Expression> mark,
+        const LogicalPlan& probePlan, const LogicalPlan& buildPlan, LogicalPlan& resultPlan);
+    void appendAccOptionalCrossProduct(std::shared_ptr<binder::Expression> mark,
+        LogicalPlan& probePlan, const LogicalPlan& buildPlan, LogicalPlan& resultPlan);
+    void appendCrossProduct(common::AccumulateType accumulateType,
+        std::shared_ptr<binder::Expression> mark, const LogicalPlan& probePlan,
+        const LogicalPlan& buildPlan, LogicalPlan& resultPlan);
+
+    // Append accumulate operators
+    // Skip if plan has been accumulated.
+    void tryAppendAccumulate(LogicalPlan& plan);
+    // Accumulate everything.
+    void appendAccumulate(LogicalPlan& plan);
+    // Accumulate everything. Append mark.
+    void appendOptionalAccumulate(std::shared_ptr<binder::Expression> mark, LogicalPlan& plan);
+    // Append accumulate with a set of expressions being flattened first.
+    void appendAccumulate(const binder::expression_vector& flatExprs, LogicalPlan& plan);
+    // Append accumulate with a set of expressions being flattened first. Append mark.
+    void appendAccumulate(common::AccumulateType accumulateType,
+        const binder::expression_vector& flatExprs, std::shared_ptr<binder::Expression> mark,
+        LogicalPlan& plan);
+
+    void appendDummyScan(LogicalPlan& plan);
+
+    void appendUnwind(const binder::BoundReadingClause& boundReadingClause, LogicalPlan& plan);
+
+    void appendFlattens(const f_group_pos_set& groupsPos, LogicalPlan& plan);
+    void appendFlattenIfNecessary(f_group_pos groupPos, LogicalPlan& plan);
+
+    void appendFilters(const binder::expression_vector& predicates, LogicalPlan& plan);
+    void appendFilter(const std::shared_ptr<binder::Expression>& predicate, LogicalPlan& plan);
+
+    void appendTableFunctionCall(const binder::BoundTableScanInfo& info, LogicalPlan& plan);
+
+    void appendDistinct(const binder::expression_vector& keys, LogicalPlan& plan);
+
+    const CardinalityEstimator& getCardinalityEstimator() const { return cardinalityEstimator; }
+    CardinalityEstimator& getCardinliatyEstimatorUnsafe() { return cardinalityEstimator; }
+
+    // Get operators
+    static std::shared_ptr<LogicalOperator> getTableFunctionCall(
+        const binder::BoundTableScanInfo& info);
+    static std::shared_ptr<LogicalOperator> getTableFunctionCall(
+        const binder::BoundReadingClause& readingClause);
+
+    LogicalPlan createUnionPlan(std::vector<LogicalPlan>& childrenPlans,
+        const binder::expression_vector& expressions, bool isUnionAll);
+
+    binder::expression_vector getProperties(const binder::Expression& pattern) const;
+
+    JoinOrderEnumeratorContext enterNewContext();
+    void exitContext(JoinOrderEnumeratorContext prevContext);
+    PropertyExprCollection enterNewPropertyExprCollection();
+    void exitPropertyExprCollection(PropertyExprCollection collection);
+
+    static binder::expression_vector getNewlyMatchedExprs(
+        const std::vector<binder::SubqueryGraph>& prevs, const binder::SubqueryGraph& new_,
+        const binder::expression_vector& exprs);
+    static binder::expression_vector getNewlyMatchedExprs(const binder::SubqueryGraph& prev,
+        const binder::SubqueryGraph& new_, const binder::expression_vector& exprs);
+    static binder::expression_vector getNewlyMatchedExprs(const binder::SubqueryGraph& leftPrev,
+        const binder::SubqueryGraph& rightPrev, const binder::SubqueryGraph& new_,
+        const binder::expression_vector& exprs);
+
+private:
+    main::ClientContext* clientContext;
+    PropertyExprCollection propertyExprCollection;
+    CardinalityEstimator cardinalityEstimator;
+    JoinOrderEnumeratorContext context;
+    std::vector<extension::PlannerExtension*> plannerExtensions;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/subplans_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/subplans_table.h
new file mode 100644
index 0000000000..fc2b3219ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/planner/subplans_table.h
@@ -0,0 +1,105 @@
+#pragma once
+
+#include <unordered_map>
+
+#include "binder/query/query_graph.h"
+#include "planner/operator/logical_plan.h"
+
+namespace lbug {
+namespace planner {
+
+const uint64_t MAX_LEVEL_TO_PLAN_EXACTLY = 7;
+
+// Different from vanilla dp algorithm where one optimal plan is kept per subgraph, we keep multiple
+// plans each with a different factorization structure. The following example will explain our
+// rationale.
+// Given a triangle with an outgoing edge
+// MATCH (a)->(b)->(c), (a)->(c), (c)->(d)
+// At level 3 (assume level is based on num of nodes) for subgraph "abc", if we ignore factorization
+// structure, the 3 plans that intersects on "a", "b", or "c" are considered homogenous and one of
+// them will be picked.
+// Then at level 4 for subgraph "abcd", we know the plan that intersect on "c" will be worse because
+// we need to further flatten it and extend to "d".
+// Therefore, we try to be factorization aware when keeping optimal plans.
+class SubgraphPlans {
+public:
+    explicit SubgraphPlans(const binder::SubqueryGraph& subqueryGraph);
+
+    uint64_t getMaxCost() const { return maxCost; }
+
+    void addPlan(LogicalPlan plan);
+
+    const std::vector<LogicalPlan>& getPlans() const { return plans; }
+
+private:
+    // To balance computation time, we encode plan by only considering the flat information of the
+    // nodes that are involved in current subgraph.
+    std::bitset<binder::MAX_NUM_QUERY_VARIABLES> encodePlan(const LogicalPlan& plan);
+
+private:
+    constexpr static uint32_t MAX_NUM_PLANS = 10;
+
+private:
+    uint64_t maxCost = UINT64_MAX;
+    binder::expression_vector nodeIDsToEncode;
+    std::vector<LogicalPlan> plans;
+    std::unordered_map<std::bitset<binder::MAX_NUM_QUERY_VARIABLES>, common::idx_t>
+        encodedPlan2PlanIdx;
+};
+
+// A DPLevel is a collection of plans per subgraph. All subgraph should have the same number of
+// variables.
+class DPLevel {
+public:
+    bool contains(const binder::SubqueryGraph& subqueryGraph) const {
+        return subgraph2Plans.contains(subqueryGraph);
+    }
+
+    const SubgraphPlans& getSubgraphPlans(const binder::SubqueryGraph& subqueryGraph) const {
+        return subgraph2Plans.at(subqueryGraph);
+    }
+
+    std::vector<binder::SubqueryGraph> getSubqueryGraphs();
+
+    void addPlan(const binder::SubqueryGraph& subqueryGraph, LogicalPlan plan);
+
+    void clear() { subgraph2Plans.clear(); }
+
+private:
+    constexpr static uint32_t MAX_NUM_SUBGRAPH = 50;
+
+private:
+    binder::subquery_graph_V_map_t<SubgraphPlans> subgraph2Plans;
+};
+
+class SubPlansTable {
+public:
+    void resize(uint32_t newSize);
+
+    uint64_t getMaxCost(const binder::SubqueryGraph& subqueryGraph) const;
+
+    bool containSubgraphPlans(const binder::SubqueryGraph& subqueryGraph) const;
+
+    const std::vector<LogicalPlan>& getSubgraphPlans(
+        const binder::SubqueryGraph& subqueryGraph) const;
+
+    std::vector<binder::SubqueryGraph> getSubqueryGraphs(uint32_t level);
+
+    void addPlan(const binder::SubqueryGraph& subqueryGraph, LogicalPlan plan);
+
+    void clear();
+
+private:
+    const DPLevel& getDPLevel(const binder::SubqueryGraph& subqueryGraph) const {
+        return dpLevels[subqueryGraph.getTotalNumVariables()];
+    }
+    DPLevel& getDPLevelUnsafe(const binder::SubqueryGraph& subqueryGraph) {
+        return dpLevels[subqueryGraph.getTotalNumVariables()];
+    }
+
+private:
+    std::vector<DPLevel> dpLevels;
+};
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/data_pos.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/data_pos.h
new file mode 100644
index 0000000000..5b44d8bf25
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/data_pos.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include <utility>
+
+#include "common/types/types.h"
+
+namespace lbug {
+namespace processor {
+
+using data_chunk_pos_t = common::idx_t;
+constexpr data_chunk_pos_t INVALID_DATA_CHUNK_POS = common::INVALID_IDX;
+using value_vector_pos_t = common::idx_t;
+constexpr value_vector_pos_t INVALID_VALUE_VECTOR_POS = common::INVALID_IDX;
+
+struct DataPos {
+    data_chunk_pos_t dataChunkPos;
+    value_vector_pos_t valueVectorPos;
+
+    DataPos() : dataChunkPos{INVALID_DATA_CHUNK_POS}, valueVectorPos{INVALID_VALUE_VECTOR_POS} {}
+    explicit DataPos(data_chunk_pos_t dataChunkPos, value_vector_pos_t valueVectorPos)
+        : dataChunkPos{dataChunkPos}, valueVectorPos{valueVectorPos} {}
+    explicit DataPos(std::pair<data_chunk_pos_t, value_vector_pos_t> pos)
+        : dataChunkPos{pos.first}, valueVectorPos{pos.second} {}
+
+    static DataPos getInvalidPos() { return DataPos(); }
+    bool isValid() const {
+        return dataChunkPos != INVALID_DATA_CHUNK_POS && valueVectorPos != INVALID_VALUE_VECTOR_POS;
+    }
+
+    inline bool operator==(const DataPos& rhs) const {
+        return (dataChunkPos == rhs.dataChunkPos) && (valueVectorPos == rhs.valueVectorPos);
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/execution_context.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/execution_context.h
new file mode 100644
index 0000000000..5197b8e26d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/execution_context.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "common/profiler.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace processor {
+
+struct LBUG_API ExecutionContext {
+    uint64_t queryID;
+    common::Profiler* profiler;
+    main::ClientContext* clientContext;
+
+    ExecutionContext(common::Profiler* profiler, main::ClientContext* clientContext,
+        uint64_t queryID)
+        : queryID{queryID}, profiler{profiler}, clientContext{clientContext} {}
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/expression_mapper.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/expression_mapper.h
new file mode 100644
index 0000000000..1fec111536
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/expression_mapper.h
@@ -0,0 +1,60 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/result/result_set_descriptor.h"
+
+namespace lbug {
+namespace processor {
+
+class ExpressionMapper {
+public:
+    ExpressionMapper() = default;
+    explicit ExpressionMapper(const planner::Schema* schema) : schema{schema} {}
+    ExpressionMapper(const planner::Schema* schema, evaluator::ExpressionEvaluator* parent)
+        : schema{schema}, parentEvaluator{parent} {}
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> getEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+    std::unique_ptr<evaluator::ExpressionEvaluator> getConstantEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+
+private:
+    static std::unique_ptr<evaluator::ExpressionEvaluator> getLiteralEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+
+    static std::unique_ptr<evaluator::ExpressionEvaluator> getParameterEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> getReferenceEvaluator(
+        std::shared_ptr<binder::Expression> expression) const;
+
+    static std::unique_ptr<evaluator::ExpressionEvaluator> getLambdaParamEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> getCaseEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> getFunctionEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> getNodeEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> getRelEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> getPathEvaluator(
+        std::shared_ptr<binder::Expression> expression);
+
+    std::vector<std::unique_ptr<evaluator::ExpressionEvaluator>> getEvaluators(
+        const binder::expression_vector& expressions);
+
+private:
+    const planner::Schema* schema = nullptr;
+    // TODO: comment
+    evaluator::ExpressionEvaluator* parentEvaluator = nullptr;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/aggregate_hash_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/aggregate_hash_table.h
new file mode 100644
index 0000000000..0d7b5a232e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/aggregate_hash_table.h
@@ -0,0 +1,342 @@
+#pragma once
+
+#include <cstdint>
+
+#include "aggregate_input.h"
+#include "common/copy_constructors.h"
+#include "common/data_chunk/data_chunk_state.h"
+#include "common/null_mask.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "function/aggregate_function.h"
+#include "processor/result/base_hash_table.h"
+#include "processor/result/factorized_table.h"
+#include "processor/result/factorized_table_schema.h"
+
+namespace lbug {
+namespace common {
+class InMemOverflowBuffer;
+}
+namespace storage {
+class MemoryManager;
+}
+namespace processor {
+
+class HashSlot {
+    // upper 7 bits are for the fingerprint, the remaining 57 bits are for the pointer.
+    // The largest pointer size seems to be 57 bytes for intel's 5-level paging
+    static constexpr size_t FINGERPRINT_BITS = 7;
+    static constexpr size_t POINTER_BITS = 57;
+
+public:
+    HashSlot(common::hash_t hash, const uint8_t* entry)
+        : entry(reinterpret_cast<uint64_t>(entry) |
+                (hash & common::NULL_HIGH_MASKS[FINGERPRINT_BITS])) {}
+
+    bool checkFingerprint(common::hash_t hash) const {
+        return (entry >> POINTER_BITS) == (hash >> POINTER_BITS);
+    }
+
+    // pointer to the factorizedTable entry which stores [groupKey1, ...
+    // groupKeyN, aggregateState1, ..., aggregateStateN, hashValue].
+    uint8_t* getEntry() const {
+        return reinterpret_cast<uint8_t*>(entry & common::NULL_LOWER_MASKS[POINTER_BITS]);
+    }
+
+private:
+    uint64_t entry;
+};
+
+enum class HashTableType : uint8_t { AGGREGATE_HASH_TABLE = 0, MARK_HASH_TABLE = 1 };
+
+/**
+ * AggregateHashTable Design
+ *
+ * 1. Payload
+ * Entry layout: [groupKey1, ... groupKeyN, aggregateState1, ..., aggregateStateN, hashValue]
+ * Payload is stored in the factorizedTable.
+ *
+ * 2. Hash slot
+ * Layout : see HashSlot struct
+ * If the entry is a nullptr, then the current hashSlot is unused.
+ *
+ * 3. Collision handling
+ * Linear probing. When collision happens, we find the next hash slot whose entry is a
+ * nullptr.
+ *
+ */
+class AggregateHashTable;
+using update_agg_function_t = std::function<void(AggregateHashTable*,
+    const std::vector<common::ValueVector*>&, const std::vector<common::ValueVector*>&,
+    function::AggregateFunction&, common::ValueVector*, uint64_t, uint32_t, uint32_t)>;
+
+class AggregateHashTable : public BaseHashTable {
+public:
+    AggregateHashTable(storage::MemoryManager& memoryManager,
+        const std::vector<common::LogicalType>& keyTypes,
+        const std::vector<common::LogicalType>& payloadTypes, uint64_t numEntriesToAllocate,
+        FactorizedTableSchema tableSchema)
+        : AggregateHashTable(memoryManager, common::LogicalType::copy(keyTypes),
+              common::LogicalType::copy(payloadTypes),
+              std::vector<function::AggregateFunction>{} /* empty aggregates */,
+              std::vector<common::LogicalType>{} /* empty distinct agg key*/, numEntriesToAllocate,
+              std::move(tableSchema)) {}
+
+    AggregateHashTable(storage::MemoryManager& memoryManager,
+        std::vector<common::LogicalType> keyTypes, std::vector<common::LogicalType> payloadTypes,
+        const std::vector<function::AggregateFunction>& aggregateFunctions,
+        const std::vector<common::LogicalType>& distinctAggKeyTypes, uint64_t numEntriesToAllocate,
+        FactorizedTableSchema tableSchema);
+
+    //! merge aggregate hash table by combining aggregate states under the same key
+    void merge(FactorizedTable&& other);
+    void merge(AggregateHashTable&& other) { merge(std::move(*other.factorizedTable)); }
+    // Must be called after merging hash tables with distinct functions, but only when the
+    // merged distinct tuples match the merged non-distinct tuples
+    void mergeDistinctAggregateInfo();
+
+    void finalizeAggregateStates();
+
+    void resize(uint64_t newSize);
+    void clear();
+    void resizeHashTableIfNecessary(uint32_t maxNumDistinctHashKeys);
+
+    AggregateHashTable createEmptyCopy() const { return AggregateHashTable(*this); }
+
+    DEFAULT_BOTH_MOVE(AggregateHashTable);
+    AggregateHashTable* getDistinctHashTable(uint64_t aggregateFunctionIdx) const {
+        return distinctHashTables[aggregateFunctionIdx].get();
+    }
+
+    void appendDistinct(const std::vector<common::ValueVector*>& keyVectors,
+        common::ValueVector* aggregateVector, const common::DataChunkState* leadingState);
+
+protected:
+    virtual uint64_t append(const std::vector<common::ValueVector*>& keyVectors,
+        const common::DataChunkState* leadingState,
+        const std::vector<AggregateInput>& aggregateInputs, uint64_t resultSetMultiplicity) {
+        return append(keyVectors, std::vector<common::ValueVector*>{} /*dependentKeyVectors*/,
+            leadingState, aggregateInputs, resultSetMultiplicity);
+    }
+
+    virtual uint64_t append(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<common::ValueVector*>& dependentKeyVectors,
+        const common::DataChunkState* leadingState,
+        const std::vector<AggregateInput>& aggregateInputs, uint64_t resultSetMultiplicity);
+
+    virtual uint64_t matchFTEntries(std::span<const common::ValueVector*> keyVectors,
+        uint64_t numMayMatches, uint64_t numNoMatches);
+
+    uint64_t matchFTEntries(const FactorizedTable& srcTable, uint64_t startOffset,
+        uint64_t numMayMatches, uint64_t numNoMatches);
+
+    void initializeFTEntries(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<common::ValueVector*>& dependentKeyVectors,
+        uint64_t numFTEntriesToInitialize);
+    void initializeFTEntries(const FactorizedTable& sourceTable, uint64_t sourceStartOffset,
+        uint64_t numFTEntriesToInitialize);
+
+    uint64_t matchUnFlatVecWithFTColumn(const common::ValueVector* vector, uint64_t numMayMatches,
+        uint64_t& numNoMatches, uint32_t colIdx);
+
+    uint64_t matchFlatVecWithFTColumn(const common::ValueVector* vector, uint64_t numMayMatches,
+        uint64_t& numNoMatches, uint32_t colIdx);
+
+    void findHashSlots(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<common::ValueVector*>& dependentKeyVectors,
+        const common::DataChunkState* leadingState);
+
+    void findHashSlots(const FactorizedTable& data, uint64_t startOffset, uint64_t numTuples);
+
+protected:
+    void initializeFT(const std::vector<function::AggregateFunction>& aggregateFunctions,
+        FactorizedTableSchema&& tableSchema);
+
+    void initializeHashTable(uint64_t numEntriesToAllocate);
+
+    void initializeTmpVectors();
+
+    // ! This function will only be used by distinct aggregate, which assumes that all
+    // groupByKeys are flat.
+    uint8_t* findEntryInDistinctHT(const std::vector<common::ValueVector*>& groupByKeyVectors,
+        common::hash_t hash);
+
+    void initializeFTEntryWithFlatVec(common::ValueVector* flatVector,
+        uint64_t numEntriesToInitialize, uint32_t colIdx);
+
+    void initializeFTEntryWithUnFlatVec(common::ValueVector* unFlatVector,
+        uint64_t numEntriesToInitialize, uint32_t colIdx);
+
+    uint8_t* createEntryInDistinctHT(const std::vector<common::ValueVector*>& groupByHashKeyVectors,
+        common::hash_t hash);
+
+    void increaseSlotIdx(uint64_t& slotIdx) const;
+
+    void initTmpHashSlotsAndIdxes();
+    void initTmpHashSlotsAndIdxes(const FactorizedTable& sourceTable, uint64_t startOffset,
+        uint64_t numTuples);
+
+    void increaseHashSlotIdxes(uint64_t numNoMatches);
+
+    void updateAggState(const std::vector<common::ValueVector*>& keyVectors,
+        function::AggregateFunction& aggregateFunction, common::ValueVector* aggVector,
+        uint64_t multiplicity, uint32_t aggStateOffset,
+        const common::DataChunkState* firstUnFlatState);
+
+    void updateAggStates(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<AggregateInput>& aggregateInputs, uint64_t resultSetMultiplicity,
+        const common::DataChunkState* firstUnFlatState);
+
+    void fillEntryWithInitialNullAggregateState(FactorizedTable& table, uint8_t* entry);
+
+    //! find an uninitialized hash slot for given hash and fill hash slot with block id and
+    //! offset
+    void fillHashSlot(common::hash_t hash, uint8_t* groupByKeysAndAggregateStateBuffer);
+
+    inline HashSlot* getHashSlot(uint64_t slotIdx) {
+        KU_ASSERT(slotIdx < maxNumHashSlots);
+        // If the slotIdx is smaller than the numHashSlotsPerBlock, then the hashSlot must be
+        // in the first hashSlotsBlock. We don't need to compute the blockIdx and blockOffset.
+        return slotIdx < ((uint64_t)1 << numSlotsPerBlockLog2) ?
+                   (HashSlot*)(hashSlotsBlocks[0]->getData() + slotIdx * sizeof(HashSlot)) :
+                   (HashSlot*)(hashSlotsBlocks[slotIdx >> numSlotsPerBlockLog2]->getData() +
+                               (slotIdx & slotIdxInBlockMask) * sizeof(HashSlot));
+    }
+
+    void addDataBlocksIfNecessary(uint64_t maxNumHashSlots);
+
+    void updateNullAggVectorState(const common::DataChunkState& keyState,
+        function::AggregateFunction& aggregateFunction, uint64_t multiplicity,
+        uint32_t aggStateOffset);
+
+    void updateBothFlatAggVectorState(function::AggregateFunction& aggregateFunction,
+        common::ValueVector* aggVector, uint64_t multiplicity, uint32_t aggStateOffset);
+
+    void updateFlatUnFlatKeyFlatAggVectorState(const common::DataChunkState& unFlatKeyState,
+        function::AggregateFunction& aggregateFunction, common::ValueVector* aggVector,
+        uint64_t multiplicity, uint32_t aggStateOffset);
+
+    void updateFlatKeyUnFlatAggVectorState(const std::vector<common::ValueVector*>& flatKeyVectors,
+        function::AggregateFunction& aggregateFunction, common::ValueVector* aggVector,
+        uint64_t multiplicity, uint32_t aggStateOffset);
+
+    void updateBothUnFlatSameDCAggVectorState(function::AggregateFunction& aggregateFunction,
+        common::ValueVector* aggVector, uint64_t multiplicity, uint32_t aggStateOffset);
+
+    void updateBothUnFlatDifferentDCAggVectorState(const common::DataChunkState& unFlatKeyState,
+        function::AggregateFunction& aggregateFunction, common::ValueVector* aggVector,
+        uint64_t multiplicity, uint32_t aggStateOffset);
+
+    static std::vector<common::LogicalType> getDistinctAggKeyTypes(
+        const AggregateHashTable& hashTable) {
+        std::vector<common::LogicalType> distinctAggKeyTypes(hashTable.distinctHashTables.size());
+        std::transform(hashTable.distinctHashTables.begin(), hashTable.distinctHashTables.end(),
+            distinctAggKeyTypes.begin(), [&](const auto& distinctHashTable) {
+                if (distinctHashTable) {
+                    return distinctHashTable->keyTypes.back().copy();
+                } else {
+                    return common::LogicalType();
+                }
+            });
+        return distinctAggKeyTypes;
+    }
+
+    template<class Func>
+    uint8_t* findEntry(common::hash_t hash, Func compareKeys) {
+        auto slotIdx = getSlotIdxForHash(hash);
+        while (true) {
+            auto slot = (HashSlot*)getHashSlot(slotIdx);
+            if (slot->getEntry() == nullptr) {
+                return nullptr;
+            } else if (slot->checkFingerprint(hash) && compareKeys(slot->getEntry())) {
+                return slot->getEntry();
+            }
+            increaseSlotIdx(slotIdx);
+        }
+    }
+
+private:
+    // Does not copy the contents of the hash table and is provided as a convenient way of
+    // constructing more hash tables without having to hold on to or expose the construction
+    // arguments via createEmptyCopy
+    AggregateHashTable(const AggregateHashTable& other)
+        : AggregateHashTable(*other.memoryManager, common::LogicalType::copy(other.keyTypes),
+              common::LogicalType::copy(other.payloadTypes), other.aggregateFunctions,
+              getDistinctAggKeyTypes(other), 0, other.getTableSchema()->copy()) {}
+
+protected:
+    uint32_t hashColIdxInFT{};
+    std::unique_ptr<uint64_t[]> mayMatchIdxes;
+    std::unique_ptr<uint64_t[]> noMatchIdxes;
+    std::unique_ptr<uint64_t[]> entryIdxesToInitialize;
+    std::unique_ptr<HashSlot*[]> hashSlotsToUpdateAggState;
+
+    std::vector<common::LogicalType> payloadTypes;
+    std::vector<function::AggregateFunction> aggregateFunctions;
+
+    //! special handling of distinct aggregate
+    std::vector<std::unique_ptr<AggregateHashTable>> distinctHashTables;
+    std::vector<uint64_t> distinctHashEntriesProcessed;
+    uint32_t hashColOffsetInFT{};
+    uint32_t aggStateColOffsetInFT{};
+    uint32_t aggStateColIdxInFT{};
+    uint32_t numBytesForKeys = 0;
+    uint32_t numBytesForDependentKeys = 0;
+    std::vector<update_agg_function_t> updateAggFuncs;
+    // Temporary arrays to hold intermediate results.
+    std::unique_ptr<uint64_t[]> tmpValueIdxes;
+    std::unique_ptr<uint64_t[]> tmpSlotIdxes;
+};
+
+struct AggregateHashTableUtils {
+    static std::unique_ptr<AggregateHashTable> createDistinctHashTable(
+        storage::MemoryManager& memoryManager,
+        const std::vector<common::LogicalType>& groupByKeyTypes,
+        const common::LogicalType& distinctKeyType);
+
+    static FactorizedTableSchema getTableSchemaForKeys(
+        const std::vector<common::LogicalType>& groupByKeyTypes,
+        const common::LogicalType& distinctKeyType);
+};
+
+// Separate class since the SimpleAggregate has multiple different top-level destinations for
+// partitioning
+class AggregatePartitioningData {
+public:
+    virtual ~AggregatePartitioningData() = default;
+    virtual void appendTuples(const FactorizedTable& table, ft_col_offset_t hashOffset) = 0;
+    virtual void appendDistinctTuple(size_t /*distinctFuncIndex*/, std::span<uint8_t> /*tuple*/,
+        common::hash_t /*hash*/) = 0;
+    virtual void appendOverflow(common::InMemOverflowBuffer&& overflowBuffer) = 0;
+};
+
+// Fixed-sized Aggregate hash table that flushes tuples into partitions in the
+// HashAggregateSharedState when full
+class PartitioningAggregateHashTable final : public AggregateHashTable {
+public:
+    PartitioningAggregateHashTable(AggregatePartitioningData* partitioningData,
+        storage::MemoryManager& memoryManager, std::vector<common::LogicalType> keyTypes,
+        std::vector<common::LogicalType> payloadTypes,
+        const std::vector<function::AggregateFunction>& aggregateFunctions,
+        const std::vector<common::LogicalType>& distinctAggKeyTypes,
+        FactorizedTableSchema tableSchema)
+        : AggregateHashTable(memoryManager, std::move(keyTypes), std::move(payloadTypes),
+              aggregateFunctions, distinctAggKeyTypes,
+              common::DEFAULT_VECTOR_CAPACITY /*minimum size*/, tableSchema.copy()),
+          tableSchema{std::move(tableSchema)}, partitioningData{partitioningData} {}
+
+    uint64_t append(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<common::ValueVector*>& dependentKeyVectors,
+        const common::DataChunkState* leadingState,
+        const std::vector<AggregateInput>& aggregateInputs,
+        uint64_t resultSetMultiplicity) override;
+
+    void mergeIfFull(uint64_t tuplesToAdd, bool mergeAll = false);
+
+private:
+    FactorizedTableSchema tableSchema;
+    AggregatePartitioningData* partitioningData;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/aggregate_input.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/aggregate_input.h
new file mode 100644
index 0000000000..f2d1db3ff4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/aggregate_input.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include "common/data_chunk/data_chunk.h"
+#include "processor/data_pos.h"
+
+namespace lbug {
+namespace processor {
+
+struct AggregateInfo {
+    DataPos aggVectorPos;
+    std::vector<data_chunk_pos_t> multiplicityChunksPos;
+    common::LogicalType distinctAggKeyType;
+
+    AggregateInfo(const DataPos& aggVectorPos, std::vector<data_chunk_pos_t> multiplicityChunksPos,
+        common::LogicalType distinctAggKeyType)
+        : aggVectorPos{aggVectorPos}, multiplicityChunksPos{std::move(multiplicityChunksPos)},
+          distinctAggKeyType{std::move(distinctAggKeyType)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(AggregateInfo);
+
+private:
+    AggregateInfo(const AggregateInfo& other)
+        : aggVectorPos{other.aggVectorPos}, multiplicityChunksPos{other.multiplicityChunksPos},
+          distinctAggKeyType{other.distinctAggKeyType.copy()} {}
+};
+
+struct AggregateInput {
+    common::ValueVector* aggregateVector;
+    std::vector<common::DataChunk*> multiplicityChunks;
+
+    AggregateInput() : aggregateVector{nullptr} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(AggregateInput);
+
+private:
+    AggregateInput(const AggregateInput& other)
+        : aggregateVector{other.aggregateVector}, multiplicityChunks{other.multiplicityChunks} {}
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/base_aggregate.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/base_aggregate.h
new file mode 100644
index 0000000000..d64c58a991
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/base_aggregate.h
@@ -0,0 +1,147 @@
+#pragma once
+
+#include <mutex>
+
+#include "aggregate_input.h"
+#include "common/mpsc_queue.h"
+#include "function/aggregate_function.h"
+#include "processor/operator/sink.h"
+#include "processor/result/factorized_table.h"
+#include "processor/result/factorized_table_schema.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+namespace processor {
+class AggregateHashTable;
+
+size_t getNumPartitionsForParallelism(main::ClientContext* context);
+
+class BaseAggregateSharedState {
+    friend class BaseAggregate;
+
+public:
+    template<typename Partition, typename Func>
+    void finalizePartitions(std::vector<Partition>& globalPartitions, Func finalizeFunc) {
+        for (auto& partition : globalPartitions) {
+            if (!partition.finalized && partition.mtx.try_lock()) {
+                if (partition.finalized) {
+                    // If there was a data race in the above && a thread may get through after
+                    // another thread has finalized this partition Ignore coverage since we can't
+                    // reliably test this data race
+                    // LCOV_EXCL_START
+                    partition.mtx.unlock();
+                    continue;
+                    // LCOV_EXCL_END
+                }
+                finalizeFunc(partition);
+                partition.finalized = true;
+                partition.mtx.unlock();
+            }
+        }
+    }
+
+    bool isReadyForFinalization() const { return readyForFinalization; }
+
+protected:
+    explicit BaseAggregateSharedState(
+        const std::vector<function::AggregateFunction>& aggregateFunctions, size_t numPartitions);
+
+    virtual std::pair<uint64_t, uint64_t> getNextRangeToRead() = 0;
+
+    ~BaseAggregateSharedState() = default;
+
+    void finalizeAggregateHashTable(const AggregateHashTable& localHashTable);
+
+    class HashTableQueue {
+    public:
+        HashTableQueue(storage::MemoryManager* memoryManager, FactorizedTableSchema tableSchema);
+
+        std::unique_ptr<HashTableQueue> copy() const {
+            return std::make_unique<HashTableQueue>(headBlock.load()->table.getMemoryManager(),
+                headBlock.load()->table.getTableSchema()->copy());
+        }
+        ~HashTableQueue();
+
+        void appendTuple(std::span<uint8_t> tuple);
+
+        void mergeInto(AggregateHashTable& hashTable);
+
+        bool empty() const {
+            auto headBlock = this->headBlock.load();
+            return (headBlock == nullptr || headBlock->numTuplesReserved == 0) &&
+                   queuedTuples.approxSize() == 0;
+        }
+
+        struct TupleBlock {
+            TupleBlock(storage::MemoryManager* memoryManager, FactorizedTableSchema tableSchema)
+                : numTuplesReserved{0}, numTuplesWritten{0},
+                  table{memoryManager, std::move(tableSchema)} {
+                // Start at a fixed capacity of one full block (so that concurrent writes are safe).
+                // If it is not filled, we resize it to the actual capacity before writing it to the
+                // hashTable
+                table.resize(table.getNumTuplesPerBlock());
+            }
+            // numTuplesReserved may be greater than the capacity of the factorizedTable
+            // if threads try to write to it while a new block is being allocated
+            // So it should not be relied on for anything other than reserving tuples
+            std::atomic<uint64_t> numTuplesReserved;
+            // Set after the tuple has been written to the block.
+            // Once numTuplesWritten == factorizedTable.getNumTuplesPerBlock() all writes have
+            // finished
+            std::atomic<uint64_t> numTuplesWritten;
+            FactorizedTable table;
+        };
+        common::MPSCQueue<TupleBlock*> queuedTuples;
+        // When queueing tuples, they are always added to the headBlock until the headBlock is full
+        // (numTuplesReserved >= factorizedTable.getNumTuplesPerBlock()), then pushed into the
+        // queuedTuples (at which point, the numTuplesReserved may not be equal to the
+        // numTuplesWritten)
+        std::atomic<TupleBlock*> headBlock;
+        uint64_t numTuplesPerBlock;
+    };
+
+protected:
+    std::mutex mtx;
+    std::atomic<uint64_t> currentOffset;
+    std::vector<function::AggregateFunction> aggregateFunctions;
+    std::atomic<size_t> numThreadsFinishedProducing;
+    std::atomic<size_t> numThreads;
+    common::MPSCQueue<std::unique_ptr<common::InMemOverflowBuffer>> overflow;
+    uint8_t shiftForPartitioning;
+    bool readyForFinalization;
+};
+
+class BaseAggregate : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::AGGREGATE;
+
+protected:
+    BaseAggregate(std::shared_ptr<BaseAggregateSharedState> sharedState,
+        std::vector<function::AggregateFunction> aggregateFunctions,
+        std::vector<AggregateInfo> aggInfos, std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, std::move(child), id, std::move(printInfo)},
+          aggregateFunctions{std::move(aggregateFunctions)}, aggInfos{std::move(aggInfos)},
+          sharedState{std::move(sharedState)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool containDistinctAggregate() const;
+
+    void finalizeInternal(ExecutionContext* /*context*/) override {
+        // Delegated to HashAggregateFinalize so it can be parallelized
+        sharedState->readyForFinalization = true;
+    }
+
+    std::unique_ptr<PhysicalOperator> copy() override = 0;
+
+protected:
+    std::vector<function::AggregateFunction> aggregateFunctions;
+    std::vector<AggregateInfo> aggInfos;
+    std::vector<AggregateInput> aggInputs;
+    std::shared_ptr<BaseAggregateSharedState> sharedState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/base_aggregate_scan.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/base_aggregate_scan.h
new file mode 100644
index 0000000000..e3edbbf63c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/base_aggregate_scan.h
@@ -0,0 +1,44 @@
+#pragma once
+
+#include "function/aggregate_function.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+using move_agg_result_to_vector_func = std::function<void(common::ValueVector& vector, uint64_t pos,
+    function::AggregateState* aggregateState)>;
+
+struct AggregateScanInfo {
+    std::vector<DataPos> aggregatesPos;
+    std::vector<move_agg_result_to_vector_func> moveAggResultToVectorFuncs;
+};
+
+class BaseAggregateScan : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::AGGREGATE_SCAN;
+
+public:
+    BaseAggregateScan(AggregateScanInfo scanInfo, std::unique_ptr<PhysicalOperator> child,
+        uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          scanInfo{std::move(scanInfo)} {}
+
+    BaseAggregateScan(AggregateScanInfo scanInfo, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, id, std::move(printInfo)}, scanInfo{std::move(scanInfo)} {}
+
+    bool isSource() const override { return true; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override = 0;
+
+    std::unique_ptr<PhysicalOperator> copy() override = 0;
+
+protected:
+    AggregateScanInfo scanInfo;
+    std::vector<std::shared_ptr<common::ValueVector>> aggregateVectors;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/hash_aggregate.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/hash_aggregate.h
new file mode 100644
index 0000000000..a5204c2180
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/hash_aggregate.h
@@ -0,0 +1,205 @@
+#pragma once
+
+#include <sys/types.h>
+
+#include <cstdint>
+#include <memory>
+#include <vector>
+
+#include "aggregate_hash_table.h"
+#include "common/cast.h"
+#include "common/copy_constructors.h"
+#include "common/data_chunk/data_chunk_state.h"
+#include "common/in_mem_overflow_buffer.h"
+#include "common/mpsc_queue.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "processor/operator/aggregate/aggregate_input.h"
+#include "processor/operator/aggregate/base_aggregate.h"
+#include "processor/operator/physical_operator.h"
+#include "processor/result/factorized_table.h"
+#include "processor/result/factorized_table_schema.h"
+
+namespace lbug {
+namespace processor {
+
+struct HashAggregateInfo {
+    std::vector<DataPos> flatKeysPos;
+    std::vector<DataPos> unFlatKeysPos;
+    std::vector<DataPos> dependentKeysPos;
+    FactorizedTableSchema tableSchema;
+
+    HashAggregateInfo(std::vector<DataPos> flatKeysPos, std::vector<DataPos> unFlatKeysPos,
+        std::vector<DataPos> dependentKeysPos, FactorizedTableSchema tableSchema);
+    EXPLICIT_COPY_DEFAULT_MOVE(HashAggregateInfo);
+
+private:
+    HashAggregateInfo(const HashAggregateInfo& other);
+};
+
+// NOLINTNEXTLINE(cppcoreguidelines-virtual-class-destructor): This is a final class.
+class HashAggregateSharedState final : public BaseAggregateSharedState,
+                                       public AggregatePartitioningData {
+
+public:
+    explicit HashAggregateSharedState(main::ClientContext* context, HashAggregateInfo hashAggInfo,
+        const std::vector<function::AggregateFunction>& aggregateFunctions,
+        std::span<AggregateInfo> aggregateInfos, std::vector<common::LogicalType> keyTypes,
+        std::vector<common::LogicalType> payloadTypes);
+
+    void appendTuples(const FactorizedTable& factorizedTable, ft_col_offset_t hashOffset) override {
+        auto numBytesPerTuple = factorizedTable.getTableSchema()->getNumBytesPerTuple();
+        for (ft_tuple_idx_t tupleIdx = 0; tupleIdx < factorizedTable.getNumTuples(); tupleIdx++) {
+            auto tuple = factorizedTable.getTuple(tupleIdx);
+            auto hash = *reinterpret_cast<common::hash_t*>(tuple + hashOffset);
+            auto& partition =
+                globalPartitions[(hash >> shiftForPartitioning) % globalPartitions.size()];
+            partition.queue->appendTuple(std::span(tuple, numBytesPerTuple));
+        }
+    }
+
+    void appendDistinctTuple(size_t distinctFuncIndex, std::span<uint8_t> tuple,
+        common::hash_t hash) override {
+        auto& partition =
+            globalPartitions[(hash >> shiftForPartitioning) % globalPartitions.size()];
+        partition.distinctTableQueues[distinctFuncIndex]->appendTuple(tuple);
+    }
+
+    void appendOverflow(common::InMemOverflowBuffer&& overflowBuffer) override {
+        overflow.push(std::make_unique<common::InMemOverflowBuffer>(std::move(overflowBuffer)));
+    }
+
+    void finalizePartitions();
+
+    std::pair<uint64_t, uint64_t> getNextRangeToRead() override;
+
+    void scan(std::span<uint8_t*> entries, std::vector<common::ValueVector*>& keyVectors,
+        common::offset_t startOffset, common::offset_t numRowsToScan,
+        std::vector<uint32_t>& columnIndices);
+
+    uint64_t getNumTuples() const;
+
+    uint64_t getCurrentOffset() const { return currentOffset; }
+
+    void setLimitNumber(uint64_t num) { limitNumber = num; }
+    uint64_t getLimitNumber() const { return limitNumber; }
+
+    const FactorizedTableSchema* getTableSchema() const {
+        return globalPartitions[0].hashTable->getTableSchema();
+    }
+
+    const HashAggregateInfo& getAggregateInfo() const { return aggInfo; }
+
+    void assertFinalized() const;
+
+protected:
+    std::tuple<const FactorizedTable*, common::offset_t> getPartitionForOffset(
+        common::offset_t offset) const;
+
+    struct Partition {
+        std::unique_ptr<AggregateHashTable> hashTable;
+        std::mutex mtx;
+        std::unique_ptr<HashTableQueue> queue;
+        // The tables storing the distinct values for distinct aggregate functions all get merged in
+        // the same way as the main table
+        std::vector<std::unique_ptr<HashTableQueue>> distinctTableQueues;
+        std::atomic<bool> finalized = false;
+    };
+
+public:
+    HashAggregateInfo aggInfo;
+    uint64_t limitNumber;
+    storage::MemoryManager* memoryManager;
+    std::vector<Partition> globalPartitions;
+};
+
+struct HashAggregateLocalState {
+    std::vector<common::ValueVector*> keyVectors;
+    std::vector<common::ValueVector*> dependentKeyVectors;
+    common::DataChunkState* leadingState = nullptr;
+    std::unique_ptr<PartitioningAggregateHashTable> aggregateHashTable;
+
+    void init(HashAggregateSharedState* sharedState, ResultSet& resultSet,
+        main::ClientContext* context, std::vector<function::AggregateFunction>& aggregateFunctions,
+        std::vector<common::LogicalType> types);
+    uint64_t append(const std::vector<AggregateInput>& aggregateInputs,
+        uint64_t multiplicity) const;
+};
+
+struct HashAggregatePrintInfo final : OPPrintInfo {
+    binder::expression_vector keys;
+    binder::expression_vector aggregates;
+    uint64_t limitNum;
+
+    HashAggregatePrintInfo(binder::expression_vector keys, binder::expression_vector aggregates)
+        : keys{std::move(keys)}, aggregates{std::move(aggregates)}, limitNum{UINT64_MAX} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<HashAggregatePrintInfo>(new HashAggregatePrintInfo(*this));
+    }
+
+private:
+    HashAggregatePrintInfo(const HashAggregatePrintInfo& other)
+        : OPPrintInfo{other}, keys{other.keys}, aggregates{other.aggregates},
+          limitNum{other.limitNum} {}
+};
+
+class HashAggregate final : public BaseAggregate {
+public:
+    HashAggregate(std::shared_ptr<BaseAggregateSharedState> sharedState,
+        std::vector<function::AggregateFunction> aggregateFunctions,
+        std::vector<AggregateInfo> aggInfos, std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : BaseAggregate{std::move(sharedState), std::move(aggregateFunctions), std::move(aggInfos),
+              std::move(child), id, std::move(printInfo)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<HashAggregate>(sharedState, copyVector(aggregateFunctions),
+            copyVector(aggInfos), children[0]->copy(), id, printInfo->copy());
+    }
+
+    const HashAggregateSharedState& getSharedStateReference() const {
+        return common::ku_dynamic_cast<const HashAggregateSharedState&>(*sharedState);
+    }
+    std::shared_ptr<HashAggregateSharedState> getSharedState() const {
+        return std::reinterpret_pointer_cast<HashAggregateSharedState>(sharedState);
+    }
+
+private:
+    HashAggregateLocalState localState;
+};
+
+class HashAggregateFinalize final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::AGGREGATE_FINALIZE;
+
+public:
+    HashAggregateFinalize(std::shared_ptr<HashAggregateSharedState> sharedState, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, id, std::move(printInfo)}, sharedState{std::move(sharedState)} {}
+
+    bool isSource() const override { return true; }
+
+    void executeInternal(ExecutionContext* /*context*/) override {
+        KU_ASSERT(sharedState->isReadyForFinalization());
+        sharedState->finalizePartitions();
+    }
+    void finalizeInternal(ExecutionContext* /*context*/) override {
+        sharedState->assertFinalized();
+    }
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<HashAggregateFinalize>(sharedState, id, printInfo->copy());
+    }
+
+private:
+    std::shared_ptr<HashAggregateSharedState> sharedState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/hash_aggregate_scan.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/hash_aggregate_scan.h
new file mode 100644
index 0000000000..140d0c9acc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/hash_aggregate_scan.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include "processor/operator/aggregate/base_aggregate_scan.h"
+#include "processor/operator/aggregate/hash_aggregate.h"
+
+namespace lbug {
+namespace processor {
+
+class HashAggregateScan final : public BaseAggregateScan {
+public:
+    HashAggregateScan(std::shared_ptr<HashAggregateSharedState> sharedState,
+        std::vector<DataPos> groupByKeyVectorsPos, AggregateScanInfo scanInfo, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : BaseAggregateScan{std::move(scanInfo), id, std::move(printInfo)},
+          groupByKeyVectorsPos{std::move(groupByKeyVectorsPos)},
+          sharedState{std::move(sharedState)} {}
+
+    std::shared_ptr<HashAggregateSharedState> getSharedState() const { return sharedState; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<HashAggregateScan>(sharedState, groupByKeyVectorsPos, scanInfo, id,
+            printInfo->copy());
+    }
+
+    double getProgress(ExecutionContext* context) const override;
+
+private:
+    std::vector<DataPos> groupByKeyVectorsPos;
+    std::vector<common::ValueVector*> groupByKeyVectors;
+    std::shared_ptr<HashAggregateSharedState> sharedState;
+    std::vector<uint32_t> groupByKeyVectorsColIdxes;
+    std::vector<uint8_t*> entries;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/simple_aggregate.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/simple_aggregate.h
new file mode 100644
index 0000000000..a07cc55a0b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/simple_aggregate.h
@@ -0,0 +1,156 @@
+#pragma once
+
+#include <memory>
+
+#include "common/cast.h"
+#include "common/copy_constructors.h"
+#include "common/in_mem_overflow_buffer.h"
+#include "processor/operator/aggregate/aggregate_hash_table.h"
+#include "processor/operator/aggregate/base_aggregate.h"
+
+namespace lbug {
+namespace processor {
+
+// NOLINTNEXTLINE(cppcoreguidelines-virtual-class-destructor): This is a final class.
+class SimpleAggregateSharedState final : public BaseAggregateSharedState {
+    friend class SimpleAggregate;
+
+public:
+    explicit SimpleAggregateSharedState(main::ClientContext* clientContext,
+        const std::vector<function::AggregateFunction>& aggregateFunctions,
+        const std::vector<AggregateInfo>& aggInfos);
+
+    // The partitioningData objects need a stable pointer to this shared state
+    DELETE_COPY_AND_MOVE(SimpleAggregateSharedState);
+
+    void combineAggregateStates(
+        const std::vector<std::unique_ptr<function::AggregateState>>& localAggregateStates,
+        common::InMemOverflowBuffer&& localOverflowBuffer);
+
+    void finalizeAggregateStates();
+
+    std::pair<uint64_t, uint64_t> getNextRangeToRead() override;
+
+    function::AggregateState* getAggregateState(uint64_t idx) {
+        return globalAggregateStates[idx].get();
+    }
+
+    // Merges data from the queues into the distinct hash tables
+    // Can be run concurrently (but only after all data has been written into the queues)
+    void finalizePartitions(storage::MemoryManager* memoryManager,
+        const std::vector<AggregateInfo>& aggInfos);
+
+    bool isReadyForFinalization() const { return readyForFinalization; }
+
+protected:
+    struct Partition {
+        struct DistinctData {
+            std::unique_ptr<AggregateHashTable> hashTable;
+            std::unique_ptr<HashTableQueue> queue;
+            std::unique_ptr<function::AggregateState> state;
+        };
+        std::mutex mtx;
+        std::vector<DistinctData> distinctTables;
+        std::atomic<bool> finalized = false;
+    };
+
+    class SimpleAggregatePartitioningData : public AggregatePartitioningData {
+    public:
+        SimpleAggregatePartitioningData(SimpleAggregateSharedState* sharedState, size_t functionIdx)
+            : sharedState{sharedState}, functionIdx{functionIdx} {}
+
+        void appendTuples(const FactorizedTable& factorizedTable,
+            ft_col_offset_t hashOffset) override;
+        void appendDistinctTuple(size_t, std::span<uint8_t>, common::hash_t) override;
+        void appendOverflow(common::InMemOverflowBuffer&& overflowBuffer) override;
+
+    private:
+        SimpleAggregateSharedState* sharedState;
+        size_t functionIdx;
+    };
+
+private:
+    bool hasDistinct;
+    std::vector<Partition> globalPartitions;
+    std::vector<SimpleAggregatePartitioningData> partitioningData;
+    common::InMemOverflowBuffer aggregateOverflowBuffer;
+    std::vector<std::unique_ptr<function::AggregateState>> globalAggregateStates;
+};
+
+struct SimpleAggregatePrintInfo final : OPPrintInfo {
+    binder::expression_vector aggregates;
+
+    explicit SimpleAggregatePrintInfo(binder::expression_vector aggregates)
+        : aggregates{std::move(aggregates)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<SimpleAggregatePrintInfo>(new SimpleAggregatePrintInfo(*this));
+    }
+
+private:
+    SimpleAggregatePrintInfo(const SimpleAggregatePrintInfo& other)
+        : OPPrintInfo{other}, aggregates{other.aggregates} {}
+};
+
+class SimpleAggregate final : public BaseAggregate {
+public:
+    SimpleAggregate(std::shared_ptr<BaseAggregateSharedState> sharedState,
+        std::vector<function::AggregateFunction> aggregateFunctions,
+        std::vector<AggregateInfo> aggInfos, std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : BaseAggregate{std::move(sharedState), std::move(aggregateFunctions), std::move(aggInfos),
+              std::move(child), id, std::move(printInfo)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<SimpleAggregate>(sharedState, copyVector(aggregateFunctions),
+            copyVector(aggInfos), children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    void computeAggregate(function::AggregateFunction* function, AggregateInput* input,
+        function::AggregateState* state, common::InMemOverflowBuffer& overflowBuffer);
+
+    SimpleAggregateSharedState& getSharedState() {
+        return common::ku_dynamic_cast<SimpleAggregateSharedState&>(*sharedState.get());
+    }
+
+private:
+    std::vector<std::unique_ptr<function::AggregateState>> localAggregateStates;
+    std::vector<std::unique_ptr<PartitioningAggregateHashTable>> distinctHashTables;
+};
+
+class SimpleAggregateFinalize final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::AGGREGATE_FINALIZE;
+
+public:
+    SimpleAggregateFinalize(std::shared_ptr<SimpleAggregateSharedState> sharedState,
+        std::vector<AggregateInfo> aggInfos, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, id, std::move(printInfo)}, sharedState{std::move(sharedState)},
+          aggInfos{std::move(aggInfos)} {}
+
+    bool isSource() const override { return true; }
+
+    void executeInternal(ExecutionContext* context) override;
+
+    void finalizeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<SimpleAggregateFinalize>(sharedState, copyVector(aggInfos), id,
+            printInfo->copy());
+    }
+
+private:
+    std::shared_ptr<SimpleAggregateSharedState> sharedState;
+    std::vector<AggregateInfo> aggInfos;
+    std::vector<std::unique_ptr<function::AggregateState>> globalAggregateStates;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/simple_aggregate_scan.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/simple_aggregate_scan.h
new file mode 100644
index 0000000000..e0ca717fbb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/aggregate/simple_aggregate_scan.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "processor/operator/aggregate/base_aggregate_scan.h"
+#include "processor/operator/aggregate/simple_aggregate.h"
+
+namespace lbug {
+namespace processor {
+
+class SimpleAggregateScan final : public BaseAggregateScan {
+public:
+    SimpleAggregateScan(std::shared_ptr<SimpleAggregateSharedState> sharedState,
+        AggregateScanInfo scanInfo, uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+        : BaseAggregateScan{std::move(scanInfo), id, std::move(printInfo)},
+          sharedState{std::move(sharedState)}, outDataChunk{nullptr} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<SimpleAggregateScan>(sharedState, scanInfo, id, printInfo->copy());
+    }
+
+private:
+    std::shared_ptr<SimpleAggregateSharedState> sharedState;
+    common::DataChunk* outDataChunk;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/arrow_result_collector.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/arrow_result_collector.h
new file mode 100644
index 0000000000..83482c5539
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/arrow_result_collector.h
@@ -0,0 +1,87 @@
+#pragma once
+
+#include <mutex>
+
+#include "common/arrow/arrow.h"
+#include "processor/operator/sink.h"
+#include "processor/result/flat_tuple.h"
+
+namespace lbug {
+namespace processor {
+
+class ArrowResultCollectorSharedState {
+public:
+    std::vector<ArrowArray> arrays;
+
+    void merge(const std::vector<ArrowArray>& localArrays);
+
+private:
+    std::mutex mutex;
+};
+
+struct ArrowResultCollectorLocalState {
+    std::vector<ArrowArray> arrays;
+    std::vector<common::ValueVector*> vectors;
+    std::vector<std::reference_wrapper<common::sel_t>> vectorsSelPos;
+    std::vector<common::DataChunk*> chunks;
+    std::vector<common::sel_t> chunkCursors;
+    std::unique_ptr<FlatTuple> tuple;
+
+    // Advance cursor.
+    bool advance();
+    // Scan from vector to tuple based on cursor.
+    void fillTuple();
+
+    void resetCursor();
+};
+
+struct ArrowResultCollectorInfo {
+    int64_t chunkSize;
+    std::vector<DataPos> payloadPositions;
+    std::vector<common::LogicalType> columnTypes;
+
+    ArrowResultCollectorInfo(int64_t chunkSize, std::vector<DataPos> payloadPositions,
+        std::vector<common::LogicalType> columnTypes)
+        : chunkSize{chunkSize}, payloadPositions{std::move(payloadPositions)},
+          columnTypes{std::move(columnTypes)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ArrowResultCollectorInfo);
+
+private:
+    ArrowResultCollectorInfo(const ArrowResultCollectorInfo& other)
+        : chunkSize{other.chunkSize}, payloadPositions{other.payloadPositions},
+          columnTypes{copyVector(other.columnTypes)} {}
+};
+
+class ArrowResultCollector final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::RESULT_COLLECTOR;
+
+public:
+    ArrowResultCollector(std::shared_ptr<ArrowResultCollectorSharedState> sharedState,
+        ArrowResultCollectorInfo info, std::unique_ptr<PhysicalOperator> child, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, std::move(child), id, std::move(printInfo)},
+          sharedState{std::move(sharedState)}, info{std::move(info)} {}
+
+    std::unique_ptr<main::QueryResult> getQueryResult() const override;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<ArrowResultCollector>(sharedState, info.copy(), children[0]->copy(),
+            id, printInfo->copy());
+    }
+
+private:
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext*) override;
+
+    void iterateResultSet(common::ArrowRowBatch* inputBatch);
+    bool fillRowBatch(common::ArrowRowBatch& rowBatch);
+
+private:
+    std::shared_ptr<ArrowResultCollectorSharedState> sharedState;
+    ArrowResultCollectorInfo info;
+    ArrowResultCollectorLocalState localState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/base_partitioner_shared_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/base_partitioner_shared_state.h
new file mode 100644
index 0000000000..d63837f60a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/base_partitioner_shared_state.h
@@ -0,0 +1,61 @@
+#pragma once
+
+#include <array>
+#include <atomic>
+
+#include "common/api.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace storage {
+class NodeTable;
+class RelTable;
+} // namespace storage
+namespace main {
+class ClientContext;
+}
+namespace processor {
+
+struct LBUG_API PartitionerSharedState {
+    storage::NodeTable* srcNodeTable;
+    storage::NodeTable* dstNodeTable;
+    storage::RelTable* relTable;
+
+    static constexpr size_t DIRECTIONS = 2;
+    std::array<common::offset_t, DIRECTIONS> numNodes;
+    std::array<common::partition_idx_t, DIRECTIONS>
+        numPartitions; // num of partitions in each direction.
+    std::atomic<common::partition_idx_t> nextPartitionIdx;
+
+    PartitionerSharedState()
+        : srcNodeTable{nullptr}, dstNodeTable{nullptr}, relTable(nullptr), numNodes{0, 0},
+          numPartitions{0, 0}, nextPartitionIdx{0} {}
+    virtual ~PartitionerSharedState() = default;
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+    virtual void initialize(const common::logical_type_vec_t& columnTypes,
+        common::idx_t numPartitioners, const main::ClientContext* clientContext);
+
+    common::partition_idx_t getNextPartition(common::idx_t partitioningIdx);
+
+    common::partition_idx_t getNumPartitions(common::idx_t partitioningIdx) const {
+        return numPartitions[partitioningIdx];
+    }
+    common::offset_t getNumNodes(common::idx_t partitioningIdx) const {
+        return numNodes[partitioningIdx];
+    }
+
+    virtual void resetState(common::idx_t partitioningIdx);
+
+    static common::partition_idx_t getNumPartitionsFromRows(common::offset_t numRows);
+};
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/cross_product.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/cross_product.h
new file mode 100644
index 0000000000..2c82af1555
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/cross_product.h
@@ -0,0 +1,64 @@
+#pragma once
+
+#include "processor/operator/physical_operator.h"
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct CrossProductLocalState {
+    std::shared_ptr<FactorizedTable> table;
+    uint64_t maxMorselSize;
+    uint64_t startIdx = 0u;
+
+    CrossProductLocalState(std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize)
+        : table{std::move(table)}, maxMorselSize{maxMorselSize}, startIdx{0} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(CrossProductLocalState);
+
+    void init() { startIdx = table->getNumTuples(); }
+
+private:
+    CrossProductLocalState(const CrossProductLocalState& other)
+        : table{other.table}, maxMorselSize{other.maxMorselSize}, startIdx{other.startIdx} {}
+};
+
+struct CrossProductInfo {
+    std::vector<DataPos> outVecPos;
+    std::vector<ft_col_idx_t> colIndicesToScan;
+
+    CrossProductInfo(std::vector<DataPos> outVecPos, std::vector<ft_col_idx_t> colIndicesToScan)
+        : outVecPos{std::move(outVecPos)}, colIndicesToScan{std::move(colIndicesToScan)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(CrossProductInfo);
+
+private:
+    CrossProductInfo(const CrossProductInfo& other)
+        : outVecPos{other.outVecPos}, colIndicesToScan{other.colIndicesToScan} {}
+};
+
+class CrossProduct final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::CROSS_PRODUCT;
+
+public:
+    CrossProduct(CrossProductInfo info, CrossProductLocalState localState,
+        std::unique_ptr<PhysicalOperator> child, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          info{std::move(info)}, localState{std::move(localState)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<CrossProduct>(info.copy(), localState.copy(), children[0]->copy(),
+            id, printInfo->copy());
+    }
+
+private:
+    CrossProductInfo info;
+    CrossProductLocalState localState;
+    std::vector<common::ValueVector*> vectorsToScan;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/alter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/alter.h
new file mode 100644
index 0000000000..f01a6b3ca5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/alter.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include "binder/ddl/bound_alter_info.h"
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace catalog {
+class TableCatalogEntry;
+class RelGroupCatalogEntry;
+} // namespace catalog
+
+namespace processor {
+
+struct AlterPrintInfo final : OPPrintInfo {
+    common::AlterType alterType;
+    std::string tableName;
+    binder::BoundAlterInfo info;
+
+    AlterPrintInfo(common::AlterType alterType, std::string tableName, binder::BoundAlterInfo info)
+        : alterType{alterType}, tableName{std::move(tableName)}, info{std::move(info)} {}
+
+    std::string toString() const override { return info.toString(); }
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<AlterPrintInfo>(new AlterPrintInfo(*this));
+    }
+
+private:
+    AlterPrintInfo(const AlterPrintInfo& other)
+        : OPPrintInfo{other}, alterType{other.alterType}, tableName{other.tableName},
+          info{other.info.copy()} {}
+};
+
+class Alter final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::ALTER;
+
+public:
+    Alter(binder::BoundAlterInfo info,
+        std::unique_ptr<evaluator::ExpressionEvaluator> defaultValueEvaluator,
+        std::shared_ptr<FactorizedTable> messageTable, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          info{std::move(info)}, defaultValueEvaluator{std::move(defaultValueEvaluator)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<Alter>(info.copy(),
+            defaultValueEvaluator == nullptr ? nullptr : defaultValueEvaluator->copy(),
+            messageTable, id, printInfo->copy());
+    }
+
+private:
+    void alterTable(main::ClientContext* clientContext, const catalog::TableCatalogEntry& entry,
+        const binder::BoundAlterInfo& alterInfo);
+
+    binder::BoundAlterInfo info;
+    std::unique_ptr<evaluator::ExpressionEvaluator> defaultValueEvaluator;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/create_sequence.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/create_sequence.h
new file mode 100644
index 0000000000..fcd8d47810
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/create_sequence.h
@@ -0,0 +1,46 @@
+#pragma once
+
+#include "binder/ddl/bound_create_sequence_info.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct CreateSequencePrintInfo final : OPPrintInfo {
+    std::string seqName;
+
+    explicit CreateSequencePrintInfo(std::string seqName) : seqName{std::move(seqName)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<CreateSequencePrintInfo>(new CreateSequencePrintInfo(*this));
+    }
+
+private:
+    CreateSequencePrintInfo(const CreateSequencePrintInfo& other)
+        : OPPrintInfo{other}, seqName{other.seqName} {}
+};
+
+class CreateSequence final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::CREATE_SEQUENCE;
+
+public:
+    CreateSequence(binder::BoundCreateSequenceInfo info,
+        std::shared_ptr<FactorizedTable> messageTable, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          info{std::move(info)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<CreateSequence>(info.copy(), messageTable, id, printInfo->copy());
+    }
+
+private:
+    binder::BoundCreateSequenceInfo info;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/create_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/create_table.h
new file mode 100644
index 0000000000..27ad081678
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/create_table.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include "binder/ddl/bound_create_table_info.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct CreateTableSharedState {
+    bool tableCreated = false;
+};
+
+class CreateTable final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::CREATE_TABLE;
+
+public:
+    CreateTable(binder::BoundCreateTableInfo info, std::shared_ptr<FactorizedTable> messageTable,
+        std::shared_ptr<CreateTableSharedState> sharedState, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          info{std::move(info)}, sharedState{std::move(sharedState)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    bool terminate() const override {
+        // If table is not created, meaning table already exists. Then subsequent copy tasks should
+        // not be executed.
+        return !sharedState->tableCreated;
+    }
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<CreateTable>(info.copy(), messageTable, sharedState, id,
+            printInfo->copy());
+    }
+
+private:
+    binder::BoundCreateTableInfo info;
+    std::shared_ptr<CreateTableSharedState> sharedState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/create_type.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/create_type.h
new file mode 100644
index 0000000000..2d935e7422
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/create_type.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct CreateTypePrintInfo final : OPPrintInfo {
+    std::string typeName;
+    std::string type;
+
+    CreateTypePrintInfo(std::string typeName, std::string type)
+        : typeName{std::move(typeName)}, type{std::move(type)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<CreateTypePrintInfo>(new CreateTypePrintInfo(*this));
+    }
+
+private:
+    CreateTypePrintInfo(const CreateTypePrintInfo& other)
+        : OPPrintInfo{other}, typeName{other.typeName}, type{other.type} {}
+};
+
+class CreateType final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::CREATE_TYPE;
+
+public:
+    CreateType(std::string name, common::LogicalType type,
+        std::shared_ptr<FactorizedTable> messageTable, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          name{std::move(name)}, type{std::move(type)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<CreateType>(name, type.copy(), messageTable, id, printInfo->copy());
+    }
+
+private:
+    std::string name;
+    common::LogicalType type;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/drop.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/drop.h
new file mode 100644
index 0000000000..b11e8cdfc3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/ddl/drop.h
@@ -0,0 +1,51 @@
+#pragma once
+
+#include "parser/ddl/drop_info.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct DropPrintInfo final : OPPrintInfo {
+    std::string name;
+
+    explicit DropPrintInfo(std::string name) : name{std::move(name)} {}
+
+    std::string toString() const override { return name; }
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<DropPrintInfo>(new DropPrintInfo(*this));
+    }
+
+private:
+    DropPrintInfo(const DropPrintInfo& other) : OPPrintInfo{other}, name{other.name} {}
+};
+
+class Drop final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::DROP;
+
+public:
+    Drop(parser::DropInfo dropInfo, std::shared_ptr<FactorizedTable> messageTable,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          dropInfo{std::move(dropInfo)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<Drop>(dropInfo, messageTable, id, printInfo->copy());
+    }
+
+private:
+    void dropSequence(const main::ClientContext* context);
+    void dropTable(const main::ClientContext* context);
+    void dropMacro(const main::ClientContext* context);
+    void handleMacroExistence(const main::ClientContext* context);
+    void dropRelGroup(const main::ClientContext* context);
+
+private:
+    parser::DropInfo dropInfo;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/empty_result.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/empty_result.h
new file mode 100644
index 0000000000..3c5731b83e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/empty_result.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+class EmptyResult final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::EMPTY_RESULT;
+
+public:
+    EmptyResult(physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, id, std::move(printInfo)} {}
+
+    bool isSource() const override { return true; }
+
+    bool getNextTuplesInternal(ExecutionContext*) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<EmptyResult>(id, printInfo->copy());
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/filter.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/filter.h
new file mode 100644
index 0000000000..15e1a24288
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/filter.h
@@ -0,0 +1,93 @@
+#pragma once
+
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/operator/filtering_operator.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct FilterPrintInfo final : OPPrintInfo {
+    std::shared_ptr<binder::Expression> expression;
+
+    explicit FilterPrintInfo(std::shared_ptr<binder::Expression> expression)
+        : expression{std::move(expression)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<FilterPrintInfo>(new FilterPrintInfo(*this));
+    }
+
+private:
+    FilterPrintInfo(const FilterPrintInfo& other)
+        : OPPrintInfo{other}, expression{other.expression} {}
+};
+
+class Filter final : public PhysicalOperator, public SelVectorOverWriter {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::FILTER;
+
+public:
+    Filter(std::unique_ptr<evaluator::ExpressionEvaluator> expressionEvaluator,
+        uint32_t dataChunkToSelectPos, std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          expressionEvaluator{std::move(expressionEvaluator)},
+          dataChunkToSelectPos(dataChunkToSelectPos) {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<Filter>(expressionEvaluator->copy(), dataChunkToSelectPos,
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    std::unique_ptr<evaluator::ExpressionEvaluator> expressionEvaluator;
+    uint32_t dataChunkToSelectPos;
+    std::shared_ptr<common::DataChunkState> state;
+};
+
+struct NodeLabelFilterInfo {
+    DataPos nodeVectorPos;
+    std::unordered_set<common::table_id_t> nodeLabelSet;
+
+    NodeLabelFilterInfo(const DataPos& nodeVectorPos,
+        std::unordered_set<common::table_id_t> nodeLabelSet)
+        : nodeVectorPos{nodeVectorPos}, nodeLabelSet{std::move(nodeLabelSet)} {}
+    NodeLabelFilterInfo(const NodeLabelFilterInfo& other)
+        : nodeVectorPos{other.nodeVectorPos}, nodeLabelSet{other.nodeLabelSet} {}
+
+    std::unique_ptr<NodeLabelFilterInfo> copy() const {
+        return std::make_unique<NodeLabelFilterInfo>(*this);
+    }
+};
+
+class NodeLabelFiler final : public PhysicalOperator, public SelVectorOverWriter {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::FILTER;
+
+public:
+    NodeLabelFiler(std::unique_ptr<NodeLabelFilterInfo> info,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          info{std::move(info)}, nodeIDVector{nullptr} {}
+
+    void initLocalStateInternal(ResultSet* resultSet_, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() final {
+        return std::make_unique<NodeLabelFiler>(info->copy(), children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    std::unique_ptr<NodeLabelFilterInfo> info;
+    common::ValueVector* nodeIDVector;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/filtering_operator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/filtering_operator.h
new file mode 100644
index 0000000000..a27b9a8075
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/filtering_operator.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "common/data_chunk/sel_vector.h"
+
+namespace lbug {
+namespace common {
+class DataChunkState;
+} // namespace common
+
+namespace processor {
+
+class SelVectorOverWriter {
+public:
+    SelVectorOverWriter();
+    virtual ~SelVectorOverWriter() = default;
+
+protected:
+    void restoreSelVector(common::DataChunkState& dataChunkState) const;
+
+    void saveSelVector(common::DataChunkState& dataChunkState);
+
+private:
+    virtual void resetCurrentSelVector(const common::SelectionVector& selVector);
+
+protected:
+    std::shared_ptr<common::SelectionVector> prevSelVector;
+    std::shared_ptr<common::SelectionVector> currentSelVector;
+};
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/flatten.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/flatten.h
new file mode 100644
index 0000000000..37842ef2a9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/flatten.h
@@ -0,0 +1,42 @@
+#pragma once
+
+#include "processor/operator/filtering_operator.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct FlattenLocalState {
+    uint64_t currentIdx = 0;
+    uint64_t sizeToFlatten = 0;
+};
+
+class Flatten final : public PhysicalOperator, SelVectorOverWriter {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::FLATTEN;
+
+public:
+    Flatten(data_chunk_pos_t dataChunkToFlattenPos, std::unique_ptr<PhysicalOperator> child,
+        uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          dataChunkToFlattenPos{dataChunkToFlattenPos}, dataChunkState{nullptr} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<Flatten>(dataChunkToFlattenPos, children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    void resetCurrentSelVector(const common::SelectionVector& selVector) override;
+
+private:
+    data_chunk_pos_t dataChunkToFlattenPos;
+    common::DataChunkState* dataChunkState;
+    std::unique_ptr<FlattenLocalState> localState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/hash_join/hash_join_build.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/hash_join/hash_join_build.h
new file mode 100644
index 0000000000..41747b79ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/hash_join/hash_join_build.h
@@ -0,0 +1,118 @@
+#pragma once
+
+#include <mutex>
+
+#include "binder/expression/expression.h"
+#include "join_hash_table.h"
+#include "processor/operator/physical_operator.h"
+#include "processor/operator/sink.h"
+#include "processor/result/factorized_table.h"
+#include "processor/result/result_set.h"
+
+namespace lbug {
+namespace processor {
+
+struct HashJoinBuildPrintInfo final : OPPrintInfo {
+    binder::expression_vector keys;
+    binder::expression_vector payloads;
+
+    HashJoinBuildPrintInfo(binder::expression_vector keys, binder::expression_vector payloads)
+        : keys{std::move(keys)}, payloads(std::move(payloads)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<HashJoinBuildPrintInfo>(new HashJoinBuildPrintInfo(*this));
+    }
+
+private:
+    HashJoinBuildPrintInfo(const HashJoinBuildPrintInfo& other)
+        : OPPrintInfo{other}, keys{other.keys}, payloads{other.payloads} {}
+};
+
+class HashJoinBuild;
+
+// This is a shared state between HashJoinBuild and HashJoinProbe operators.
+// Each clone of these two operators will share the same state.
+// Inside the state, we keep the materialized tuples in factorizedTable, which are merged by each
+// HashJoinBuild thread when they finished materializing thread-local tuples. Also, the state holds
+// a global htDirectory, which will be updated by the last thread in the hash join build side
+// task/pipeline, and probed by the HashJoinProbe operators.
+class HashJoinSharedState {
+public:
+    explicit HashJoinSharedState(std::unique_ptr<JoinHashTable> hashTable)
+        : hashTable{std::move(hashTable)} {};
+
+    void mergeLocalHashTable(JoinHashTable& localHashTable);
+
+    JoinHashTable* getHashTable() { return hashTable.get(); }
+
+protected:
+    std::mutex mtx;
+    std::unique_ptr<JoinHashTable> hashTable;
+};
+
+struct HashJoinBuildInfo {
+    std::vector<DataPos> keysPos;
+    std::vector<common::FStateType> fStateTypes;
+    std::vector<DataPos> payloadsPos;
+    FactorizedTableSchema tableSchema;
+
+    HashJoinBuildInfo(std::vector<DataPos> keysPos, std::vector<common::FStateType> fStateTypes,
+        std::vector<DataPos> payloadsPos, FactorizedTableSchema tableSchema)
+        : keysPos{std::move(keysPos)}, fStateTypes{std::move(fStateTypes)},
+          payloadsPos{std::move(payloadsPos)}, tableSchema{std::move(tableSchema)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(HashJoinBuildInfo);
+
+    common::idx_t getNumKeys() const { return keysPos.size(); }
+
+private:
+    HashJoinBuildInfo(const HashJoinBuildInfo& other)
+        : keysPos{other.keysPos}, fStateTypes{other.fStateTypes}, payloadsPos{other.payloadsPos},
+          tableSchema{other.tableSchema.copy()} {}
+};
+
+class HashJoinBuild : public Sink {
+public:
+    HashJoinBuild(PhysicalOperatorType operatorType,
+        std::shared_ptr<HashJoinSharedState> sharedState, HashJoinBuildInfo info,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{operatorType, std::move(child), id, std::move(printInfo)},
+          sharedState{std::move(sharedState)}, info{std::move(info)} {}
+
+    std::shared_ptr<HashJoinSharedState> getSharedState() const { return sharedState; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    void finalizeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<HashJoinBuild>(operatorType, sharedState, info.copy(),
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+protected:
+    virtual uint64_t appendVectors() {
+        return hashTable->appendVectors(keyVectors, payloadVectors, keyState);
+    }
+
+private:
+    void setKeyState(common::DataChunkState* state);
+
+protected:
+    std::shared_ptr<HashJoinSharedState> sharedState;
+    HashJoinBuildInfo info;
+
+    std::vector<common::ValueVector*> keyVectors;
+    // State of unFlat key(s). If all keys are flat, it points to any flat key state.
+    common::DataChunkState* keyState = nullptr;
+    std::vector<common::ValueVector*> payloadVectors;
+
+    std::unique_ptr<JoinHashTable> hashTable; // local state
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/hash_join/hash_join_probe.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/hash_join/hash_join_probe.h
new file mode 100644
index 0000000000..78ca3d78eb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/hash_join/hash_join_probe.h
@@ -0,0 +1,123 @@
+#pragma once
+
+#include "common/enums/join_type.h"
+#include "processor/operator/filtering_operator.h"
+#include "processor/operator/hash_join/hash_join_build.h"
+#include "processor/operator/physical_operator.h"
+#include "processor/result/result_set.h"
+
+namespace lbug {
+namespace processor {
+
+struct ProbeState {
+    explicit ProbeState()
+        : matchedSelVector{common::DEFAULT_VECTOR_CAPACITY}, nextMatchedTupleIdx{0} {
+        matchedTuples = std::make_unique<uint8_t*[]>(common::DEFAULT_VECTOR_CAPACITY);
+        probedTuples = std::make_unique<uint8_t*[]>(common::DEFAULT_VECTOR_CAPACITY);
+        matchedSelVector.setToFiltered();
+    }
+
+    // Each key corresponds to a pointer with the same hash value from the ht directory.
+    std::unique_ptr<uint8_t*[]> probedTuples;
+    // Pointers to tuples in ht that actually matched.
+    std::unique_ptr<uint8_t*[]> matchedTuples;
+    // Selective index mapping each probed tuple to its probe side key vector.
+    common::SelectionVector matchedSelVector;
+    common::sel_t nextMatchedTupleIdx;
+};
+
+struct ProbeDataInfo {
+public:
+    ProbeDataInfo(std::vector<DataPos> keysDataPos, std::vector<DataPos> payloadsOutPos)
+        : keysDataPos{std::move(keysDataPos)}, payloadsOutPos{std::move(payloadsOutPos)},
+          markDataPos{UINT32_MAX, UINT32_MAX} {}
+
+    ProbeDataInfo(const ProbeDataInfo& other)
+        : ProbeDataInfo{other.keysDataPos, other.payloadsOutPos} {
+        markDataPos = other.markDataPos;
+    }
+
+    inline uint32_t getNumPayloads() const { return payloadsOutPos.size(); }
+
+public:
+    std::vector<DataPos> keysDataPos;
+    std::vector<DataPos> payloadsOutPos;
+    DataPos markDataPos;
+};
+
+struct HashJoinProbePrintInfo final : OPPrintInfo {
+    binder::expression_vector keys;
+
+    explicit HashJoinProbePrintInfo(binder::expression_vector keys) : keys{std::move(keys)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<HashJoinProbePrintInfo>(new HashJoinProbePrintInfo(*this));
+    }
+
+private:
+    HashJoinProbePrintInfo(const HashJoinProbePrintInfo& other)
+        : OPPrintInfo{other}, keys{other.keys} {}
+};
+
+// Probe side on left, i.e. children[0] and build side on right, i.e. children[1]
+class HashJoinProbe : public PhysicalOperator, public SelVectorOverWriter {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::HASH_JOIN_PROBE;
+
+public:
+    HashJoinProbe(std::shared_ptr<HashJoinSharedState> sharedState, common::JoinType joinType,
+        bool flatProbe, const ProbeDataInfo& probeDataInfo,
+        std::unique_ptr<PhysicalOperator> probeChild, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(probeChild), id, std::move(printInfo)},
+          sharedState{std::move(sharedState)}, joinType{joinType}, flatProbe{flatProbe},
+          probeDataInfo{probeDataInfo}, markVector(nullptr) {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<HashJoinProbe>(sharedState, joinType, flatProbe, probeDataInfo,
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    bool getMatchedTuples(ExecutionContext* context) {
+        return flatProbe ? getMatchedTuplesForFlatKey(context) :
+                           getMatchedTuplesForUnFlatKey(context);
+    }
+    bool getMatchedTuplesForFlatKey(ExecutionContext* context);
+    // We can probe a batch of input tuples if we know they have at most one match.
+    bool getMatchedTuplesForUnFlatKey(ExecutionContext* context);
+
+    uint64_t getInnerJoinResult() {
+        return flatProbe ? getInnerJoinResultForFlatKey() : getInnerJoinResultForUnFlatKey();
+    }
+    uint64_t getInnerJoinResultForFlatKey();
+    uint64_t getInnerJoinResultForUnFlatKey();
+    uint64_t getLeftJoinResult();
+    uint64_t getMarkJoinResult();
+    uint64_t getCountJoinResult();
+    uint64_t getJoinResult();
+
+private:
+    std::shared_ptr<HashJoinSharedState> sharedState;
+    common::JoinType joinType;
+    bool flatProbe;
+
+    ProbeDataInfo probeDataInfo;
+    std::vector<common::ValueVector*> vectorsToReadInto;
+    std::vector<uint32_t> columnIdxsToReadFrom;
+    std::vector<common::ValueVector*> keyVectors;
+    common::ValueVector* markVector;
+    std::unique_ptr<ProbeState> probeState;
+
+    std::unique_ptr<common::ValueVector> hashVector;
+    std::unique_ptr<common::ValueVector> tmpHashVector;
+    common::SelectionVector hashSelVec;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/hash_join/join_hash_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/hash_join/join_hash_table.h
new file mode 100644
index 0000000000..427ed60b55
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/hash_join/join_hash_table.h
@@ -0,0 +1,73 @@
+#pragma once
+
+#include "processor/result/base_hash_table.h"
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+}
+namespace processor {
+
+class JoinHashTable : public BaseHashTable {
+public:
+    JoinHashTable(storage::MemoryManager& memoryManager, common::logical_type_vec_t keyTypes,
+        FactorizedTableSchema tableSchema);
+
+    uint64_t appendVectors(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<common::ValueVector*>& payloadVectors, common::DataChunkState* keyState);
+    void appendVector(common::ValueVector* vector,
+        const std::vector<BlockAppendingInfo>& appendInfos, ft_col_idx_t colIdx);
+
+    // Used in worst-case optimal join
+    uint64_t appendVectorWithSorting(common::ValueVector* keyVector,
+        std::vector<common::ValueVector*> payloadVectors);
+
+    void allocateHashSlots(uint64_t numTuples);
+    void buildHashSlots();
+
+    // The tmpHashResultVector may be null if there is only one keyVector
+    void probe(const std::vector<common::ValueVector*>& keyVectors, common::ValueVector& hashVector,
+        common::SelectionVector& hashSelVec, common::ValueVector* tmpHashResultVector,
+        uint8_t** probedTuples);
+    // All key vectors must be flat. Thus input is a tuple, multiple matches can be found for the
+    // given key tuple.
+    common::sel_t matchFlatKeys(const std::vector<common::ValueVector*>& keyVectors,
+        uint8_t** probedTuples, uint8_t** matchedTuples);
+    // Input is multiple tuples, at most one match exist for each key.
+    common::sel_t matchUnFlatKey(common::ValueVector* keyVector, uint8_t** probedTuples,
+        uint8_t** matchedTuples, common::SelectionVector& matchedTuplesSelVector);
+
+    void lookup(std::vector<common::ValueVector*>& vectors, std::vector<uint32_t>& colIdxesToScan,
+        uint8_t** tuplesToRead, uint64_t startPos, uint64_t numTuplesToRead) {
+        factorizedTable->lookup(vectors, colIdxesToScan, tuplesToRead, startPos, numTuplesToRead);
+    }
+    void merge(JoinHashTable& other) { factorizedTable->merge(*other.factorizedTable); }
+    uint8_t** getPrevTuple(const uint8_t* tuple) const {
+        return (uint8_t**)(tuple + prevPtrColOffset);
+    }
+    uint8_t* getTupleForHash(common::hash_t hash) {
+        auto slotIdx = getSlotIdxForHash(hash);
+        KU_ASSERT(slotIdx < maxNumHashSlots);
+        return ((uint8_t**)(hashSlotsBlocks[slotIdx >> numSlotsPerBlockLog2]
+                                ->getData()))[slotIdx & slotIdxInBlockMask];
+    }
+
+private:
+    uint8_t** findHashSlot(const uint8_t* tuple) const;
+    // This function returns the pointer that previously stored in the same slot.
+    uint8_t* insertEntry(uint8_t* tuple) const;
+
+    // Join hash table assumes all keys to be flat.
+    void computeVectorHashes(std::vector<common::ValueVector*> keyVectors);
+
+    common::offset_t getHashValueColOffset() const;
+
+private:
+    static constexpr uint64_t PREV_PTR_COL_IDX = 1;
+    static constexpr uint64_t HASH_COL_IDX = 2;
+    uint64_t prevPtrColOffset;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/index_lookup.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/index_lookup.h
new file mode 100644
index 0000000000..a2a67b6ff0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/index_lookup.h
@@ -0,0 +1,89 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/operator/persistent/batch_insert_error_handler.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+}
+namespace storage {
+class NodeTable;
+} // namespace storage
+namespace processor {
+
+struct BatchInsertSharedState;
+struct IndexLookupInfo {
+    storage::NodeTable* nodeTable;
+    std::unique_ptr<evaluator::ExpressionEvaluator> keyEvaluator;
+    DataPos resultVectorPos;
+
+    IndexLookupInfo(storage::NodeTable* nodeTable,
+        std::unique_ptr<evaluator::ExpressionEvaluator> keyEvaluator,
+        const DataPos& resultVectorPos)
+        : nodeTable{nodeTable}, keyEvaluator{std::move(keyEvaluator)},
+          resultVectorPos{resultVectorPos} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(IndexLookupInfo);
+
+private:
+    IndexLookupInfo(const IndexLookupInfo& other)
+        : nodeTable{other.nodeTable}, keyEvaluator{other.keyEvaluator->copy()},
+          resultVectorPos{other.resultVectorPos} {}
+};
+
+struct IndexLookupPrintInfo final : OPPrintInfo {
+    binder::expression_vector expressions;
+    explicit IndexLookupPrintInfo(binder::expression_vector expressions)
+        : expressions{std::move(expressions)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<IndexLookupPrintInfo>(new IndexLookupPrintInfo(*this));
+    }
+
+private:
+    IndexLookupPrintInfo(const IndexLookupPrintInfo& other)
+        : OPPrintInfo{other}, expressions{other.expressions} {}
+};
+
+struct IndexLookupLocalState {
+    explicit IndexLookupLocalState(std::unique_ptr<BatchInsertErrorHandler> errorHandler)
+        : errorHandler(std::move(errorHandler)) {}
+
+    std::unique_ptr<BatchInsertErrorHandler> errorHandler;
+    std::vector<common::ValueVector*> warningDataVectors;
+};
+
+class IndexLookup final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::INDEX_LOOKUP;
+
+public:
+    IndexLookup(std::vector<IndexLookupInfo> infos, std::vector<DataPos> warningDataVectorPos,
+        std::unique_ptr<PhysicalOperator> child, common::idx_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          infos{std::move(infos)}, warningDataVectorPos{std::move(warningDataVectorPos)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) final;
+
+    std::unique_ptr<PhysicalOperator> copy() final {
+        return std::make_unique<IndexLookup>(copyVector(infos), warningDataVectorPos,
+            children[0]->copy(), getOperatorID(), printInfo->copy());
+    }
+
+private:
+    void lookup(transaction::Transaction* transaction, const IndexLookupInfo& info);
+
+private:
+    std::vector<IndexLookupInfo> infos;
+    std::vector<DataPos> warningDataVectorPos;
+    std::unique_ptr<IndexLookupLocalState> localState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/intersect/intersect.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/intersect/intersect.h
new file mode 100644
index 0000000000..7fed640670
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/intersect/intersect.h
@@ -0,0 +1,86 @@
+#pragma once
+
+#include "processor/operator/hash_join/hash_join_build.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct IntersectDataInfo {
+    DataPos keyDataPos;
+    // TODO(Xiyang): payload is not an accurate name for intersect.
+    std::vector<DataPos> payloadsDataPos;
+};
+
+struct IntersectPrintInfo final : OPPrintInfo {
+    std::shared_ptr<binder::Expression> key;
+
+    explicit IntersectPrintInfo(std::shared_ptr<binder::Expression> key) : key{std::move(key)} {}
+
+    std::string toString() const override;
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<IntersectPrintInfo>(new IntersectPrintInfo(*this));
+    }
+
+private:
+    IntersectPrintInfo(const IntersectPrintInfo& other) : OPPrintInfo{other}, key{other.key} {}
+};
+
+class Intersect : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::INTERSECT;
+
+public:
+    Intersect(const DataPos& outputDataPos, std::vector<IntersectDataInfo> intersectDataInfos,
+        std::vector<std::shared_ptr<HashJoinSharedState>> sharedHTs,
+        std::unique_ptr<PhysicalOperator> probeChild, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(probeChild), id, std::move(printInfo)},
+          outputDataPos{outputDataPos}, intersectDataInfos{std::move(intersectDataInfos)},
+          sharedHTs{std::move(sharedHTs)} {
+        tupleIdxPerBuildSide.resize(this->sharedHTs.size(), 0);
+        carryBuildSideIdx = -1u;
+        probedFlatTuples.resize(this->sharedHTs.size());
+    }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<Intersect>(outputDataPos, intersectDataInfos, sharedHTs,
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    // For each build side, probe its HT and return a vector of matched flat tuples.
+    void probeHTs();
+    // Left is always the one with less num of values.
+    static void twoWayIntersect(common::nodeID_t* leftNodeIDs, common::SelectionVector& lSelVector,
+        common::nodeID_t* rightNodeIDs, common::SelectionVector& rSelVector);
+    void intersectLists(const std::vector<common::overflow_value_t>& listsToIntersect);
+    void populatePayloads(const std::vector<uint8_t*>& tuples,
+        const std::vector<uint32_t>& listIdxes);
+    bool hasNextTuplesToIntersect();
+
+    uint32_t getNumBuilds() { return sharedHTs.size(); }
+
+private:
+    DataPos outputDataPos;
+    std::vector<IntersectDataInfo> intersectDataInfos;
+    // payloadColumnIdxesToScanFrom and payloadVectorsToScanInto are organized by each build child.
+    std::vector<std::vector<uint32_t>> payloadColumnIdxesToScanFrom;
+    std::vector<std::vector<common::ValueVector*>> payloadVectorsToScanInto;
+    std::shared_ptr<common::ValueVector> outKeyVector;
+    std::vector<std::shared_ptr<common::ValueVector>> probeKeyVectors;
+    std::vector<std::unique_ptr<common::SelectionVector>> intersectSelVectors;
+    std::vector<std::shared_ptr<HashJoinSharedState>> sharedHTs;
+    std::vector<bool> isIntersectListAFlatValue;
+    std::vector<std::vector<uint8_t*>> probedFlatTuples;
+    // Keep track of the tuple to intersect for each build side.
+    std::vector<uint32_t> tupleIdxPerBuildSide;
+    // This is used to indicate which build side to increment the tuple idx for.
+    uint32_t carryBuildSideIdx;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/intersect/intersect_build.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/intersect/intersect_build.h
new file mode 100644
index 0000000000..382c2a707b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/intersect/intersect_build.h
@@ -0,0 +1,57 @@
+#pragma once
+
+#include "binder/expression/expression_util.h"
+#include "processor/operator/hash_join/hash_join_build.h"
+
+namespace lbug {
+namespace processor {
+
+struct IntersectBuildPrintInfo final : OPPrintInfo {
+    binder::expression_vector keys;
+    binder::expression_vector payloads;
+
+    IntersectBuildPrintInfo(binder::expression_vector keys, binder::expression_vector payloads)
+        : keys{std::move(keys)}, payloads(std::move(payloads)) {}
+
+    std::string toString() const override {
+        std::string result = "Keys: ";
+        result += binder::ExpressionUtil::toString(keys);
+        if (!payloads.empty()) {
+            result += ", Payloads: ";
+            result += binder::ExpressionUtil::toString(payloads);
+        }
+        return result;
+    }
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<IntersectBuildPrintInfo>(new IntersectBuildPrintInfo(*this));
+    }
+
+private:
+    IntersectBuildPrintInfo(const IntersectBuildPrintInfo& other)
+        : OPPrintInfo{other}, keys{other.keys}, payloads{other.payloads} {}
+};
+
+class IntersectBuild final : public HashJoinBuild {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::INTERSECT_BUILD;
+
+public:
+    IntersectBuild(std::shared_ptr<HashJoinSharedState> sharedState, HashJoinBuildInfo info,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : HashJoinBuild{type_, std::move(sharedState), std::move(info), std::move(child), id,
+              std::move(printInfo)} {}
+
+    uint64_t appendVectors() final {
+        KU_ASSERT(keyVectors.size() == 1);
+        return hashTable->appendVectorWithSorting(keyVectors[0], payloadVectors);
+    }
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<IntersectBuild>(sharedState, info.copy(), children[0]->copy(), id,
+            printInfo->copy());
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/limit.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/limit.h
new file mode 100644
index 0000000000..38077d7147
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/limit.h
@@ -0,0 +1,53 @@
+#pragma once
+
+#include <atomic>
+
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct LimitPrintInfo final : OPPrintInfo {
+    uint64_t limitNum;
+
+    explicit LimitPrintInfo(uint64_t limitNum) : limitNum{limitNum} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LimitPrintInfo>(new LimitPrintInfo(*this));
+    }
+
+private:
+    LimitPrintInfo(const LimitPrintInfo& other) : OPPrintInfo{other}, limitNum{other.limitNum} {}
+};
+
+class Limit final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::LIMIT;
+
+public:
+    Limit(uint64_t limitNumber, std::shared_ptr<std::atomic_uint64_t> counter,
+        uint32_t dataChunkToSelectPos, std::unordered_set<uint32_t> dataChunksPosInScope,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          limitNumber{limitNumber}, counter{std::move(counter)},
+          dataChunkToSelectPos{dataChunkToSelectPos},
+          dataChunksPosInScope(std::move(dataChunksPosInScope)) {}
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<Limit>(limitNumber, counter, dataChunkToSelectPos, dataChunksPosInScope,
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    uint64_t limitNumber;
+    std::shared_ptr<std::atomic_uint64_t> counter;
+    uint32_t dataChunkToSelectPos;
+    std::unordered_set<uint32_t> dataChunksPosInScope;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/macro/create_macro.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/macro/create_macro.h
new file mode 100644
index 0000000000..2dc19c09db
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/macro/create_macro.h
@@ -0,0 +1,59 @@
+#pragma once
+
+#include "catalog/catalog.h"
+#include "function/scalar_macro_function.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct CreateMacroInfo {
+    std::string macroName;
+    std::unique_ptr<function::ScalarMacroFunction> macro;
+
+    CreateMacroInfo(std::string macroName, std::unique_ptr<function::ScalarMacroFunction> macro)
+        : macroName{std::move(macroName)}, macro{std::move(macro)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(CreateMacroInfo);
+
+private:
+    CreateMacroInfo(const CreateMacroInfo& other)
+        : macroName{other.macroName}, macro{other.macro->copy()} {}
+};
+
+struct CreateMacroPrintInfo final : OPPrintInfo {
+    std::string macroName;
+
+    explicit CreateMacroPrintInfo(std::string macroName) : macroName{std::move(macroName)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<CreateMacroPrintInfo>(new CreateMacroPrintInfo(*this));
+    }
+
+private:
+    CreateMacroPrintInfo(const CreateMacroPrintInfo& other)
+        : OPPrintInfo{other}, macroName{other.macroName} {}
+};
+
+class CreateMacro final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::CREATE_MACRO;
+
+public:
+    CreateMacro(CreateMacroInfo info, std::shared_ptr<FactorizedTable> messageTable,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          info{std::move(info)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<CreateMacro>(info.copy(), messageTable, id, printInfo->copy());
+    }
+
+private:
+    CreateMacroInfo info;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/multiplicity_reducer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/multiplicity_reducer.h
new file mode 100644
index 0000000000..cd1c0c0e72
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/multiplicity_reducer.h
@@ -0,0 +1,34 @@
+#pragma once
+
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+class MultiplicityReducer final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::MULTIPLICITY_REDUCER;
+
+public:
+    MultiplicityReducer(std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)}, prevMultiplicity{1},
+          numRepeat{0} {}
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<MultiplicityReducer>(children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    void restoreMultiplicity() { resultSet->multiplicity = prevMultiplicity; }
+
+    void saveMultiplicity() { prevMultiplicity = resultSet->multiplicity; }
+
+private:
+    uint64_t prevMultiplicity;
+    uint64_t numRepeat;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/key_block_merger.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/key_block_merger.h
new file mode 100644
index 0000000000..b46619ff5c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/key_block_merger.h
@@ -0,0 +1,203 @@
+#pragma once
+
+#include <mutex>
+#include <queue>
+
+#include "processor/operator/order_by/order_by_key_encoder.h"
+
+namespace lbug {
+namespace processor {
+
+struct KeyBlockMergeMorsel;
+
+// This struct stores the string key column information. We can utilize the
+// pre-computed indexes and offsets to expedite the tuple comparison in merge sort.
+struct StrKeyColInfo {
+    StrKeyColInfo(uint32_t colOffsetInFT, uint32_t colOffsetInEncodedKeyBlock, bool isAscOrder)
+        : colOffsetInFT{colOffsetInFT}, colOffsetInEncodedKeyBlock{colOffsetInEncodedKeyBlock},
+          isAscOrder{isAscOrder} {}
+
+    inline uint32_t getEncodingSize() const {
+        return OrderByKeyEncoder::getEncodingSize(
+            common::LogicalType(common::LogicalTypeID::STRING));
+    }
+
+    uint32_t colOffsetInFT;
+    uint32_t colOffsetInEncodedKeyBlock;
+    bool isAscOrder;
+};
+
+class MergedKeyBlocks {
+public:
+    MergedKeyBlocks(uint32_t numBytesPerTuple, uint64_t numTuples,
+        storage::MemoryManager* memoryManager);
+
+    // This constructor is used to convert a dataBlock to a MergedKeyBlocks.
+    MergedKeyBlocks(uint32_t numBytesPerTuple, std::shared_ptr<DataBlock> keyBlock);
+
+    inline uint8_t* getTuple(uint64_t tupleIdx) const {
+        KU_ASSERT(tupleIdx < numTuples);
+        return keyBlocks[tupleIdx / numTuplesPerBlock]->getData() +
+               numBytesPerTuple * (tupleIdx % numTuplesPerBlock);
+    }
+
+    inline uint64_t getNumTuples() const { return numTuples; }
+
+    inline uint32_t getNumBytesPerTuple() const { return numBytesPerTuple; }
+
+    inline uint32_t getNumTuplesPerBlock() const { return numTuplesPerBlock; }
+
+    inline uint8_t* getKeyBlockBuffer(uint32_t idx) const {
+        KU_ASSERT(idx < keyBlocks.size());
+        return keyBlocks[idx]->getData();
+    }
+
+    uint8_t* getBlockEndTuplePtr(uint32_t blockIdx, uint64_t endTupleIdx,
+        uint32_t endTupleBlockIdx) const;
+
+private:
+    uint32_t numBytesPerTuple;
+    uint32_t numTuplesPerBlock;
+    uint64_t numTuples;
+    std::vector<std::shared_ptr<DataBlock>> keyBlocks;
+    uint32_t endTupleOffset;
+};
+
+struct BlockPtrInfo {
+    BlockPtrInfo(uint64_t startTupleIdx, uint64_t endTupleIdx, MergedKeyBlocks* keyBlocks);
+
+    inline bool hasMoreTuplesToRead() const { return curTuplePtr != endTuplePtr; }
+
+    inline uint64_t getNumBytesLeftInCurBlock() const { return curBlockEndTuplePtr - curTuplePtr; }
+
+    inline uint64_t getNumTuplesLeftInCurBlock() const {
+        return getNumBytesLeftInCurBlock() / keyBlocks->getNumBytesPerTuple();
+    }
+
+    void updateTuplePtrIfNecessary();
+
+    MergedKeyBlocks* keyBlocks;
+    uint8_t* curTuplePtr;
+    uint64_t curBlockIdx;
+    uint64_t endBlockIdx;
+    uint8_t* curBlockEndTuplePtr;
+    uint8_t* endTuplePtr;
+    uint64_t endTupleIdx;
+};
+
+class KeyBlockMerger {
+public:
+    explicit KeyBlockMerger(std::vector<FactorizedTable*> factorizedTables,
+        std::vector<StrKeyColInfo>& strKeyColsInfo, uint32_t numBytesPerTuple)
+        : factorizedTables{std::move(factorizedTables)}, strKeyColsInfo{strKeyColsInfo},
+          numBytesPerTuple{numBytesPerTuple}, numBytesToCompare{numBytesPerTuple - 8},
+          hasStringCol{!strKeyColsInfo.empty()} {}
+
+    void mergeKeyBlocks(KeyBlockMergeMorsel& keyBlockMergeMorsel) const;
+
+    inline bool compareTuplePtr(uint8_t* leftTuplePtr, uint8_t* rightTuplePtr) const {
+        return hasStringCol ? compareTuplePtrWithStringCol(leftTuplePtr, rightTuplePtr) :
+                              memcmp(leftTuplePtr, rightTuplePtr, numBytesToCompare) > 0;
+    }
+
+    bool compareTuplePtrWithStringCol(uint8_t* leftTuplePtr, uint8_t* rightTuplePtr) const;
+
+private:
+    void copyRemainingBlockDataToResult(BlockPtrInfo& blockToCopy, BlockPtrInfo& resultBlock) const;
+
+private:
+    // FactorizedTables[i] stores all order_by columns encoded and sorted by the ith thread.
+    // MergeSort uses factorizedTable to access the full contents of the string key columns
+    // when resolving ties.
+    std::vector<FactorizedTable*> factorizedTables;
+    // We also store the colIdxInFactorizedTable, colOffsetInEncodedKeyBlock, isAscOrder, isStrCol
+    // for each string column. So, we don't need to compute them again during merge sort.
+    std::vector<StrKeyColInfo>& strKeyColsInfo;
+    uint32_t numBytesPerTuple;
+    uint32_t numBytesToCompare;
+    bool hasStringCol;
+};
+
+class KeyBlockMergeTask {
+public:
+    KeyBlockMergeTask(std::shared_ptr<MergedKeyBlocks> leftKeyBlock,
+        std::shared_ptr<MergedKeyBlocks> rightKeyBlock,
+        std::shared_ptr<MergedKeyBlocks> resultKeyBlock, KeyBlockMerger& keyBlockMerger)
+        : leftKeyBlock{std::move(leftKeyBlock)}, rightKeyBlock{std::move(rightKeyBlock)},
+          resultKeyBlock{std::move(resultKeyBlock)}, leftKeyBlockNextIdx{0},
+          rightKeyBlockNextIdx{0}, activeMorsels{0}, keyBlockMerger{keyBlockMerger} {}
+
+    std::unique_ptr<KeyBlockMergeMorsel> getMorsel();
+
+    inline bool hasMorselLeft() const {
+        // Returns true if there are still morsels left in the current task.
+        return leftKeyBlockNextIdx < leftKeyBlock->getNumTuples() ||
+               rightKeyBlockNextIdx < rightKeyBlock->getNumTuples();
+    }
+
+private:
+    uint64_t findRightKeyBlockIdx(uint8_t* leftEndTuplePtr) const;
+
+public:
+    static const uint32_t batch_size = 10000;
+
+    std::shared_ptr<MergedKeyBlocks> leftKeyBlock;
+    std::shared_ptr<MergedKeyBlocks> rightKeyBlock;
+    std::shared_ptr<MergedKeyBlocks> resultKeyBlock;
+    uint64_t leftKeyBlockNextIdx;
+    uint64_t rightKeyBlockNextIdx;
+    // The counter is used to keep track of the number of morsels given to thread.
+    // If the counter is 0 and there is no morsel left in the current task, we can
+    // put the resultKeyBlock back to the keyBlock list.
+    uint64_t activeMorsels;
+    // KeyBlockMerger is used to compare the values of two tuples during the binary search.
+    KeyBlockMerger& keyBlockMerger;
+};
+
+struct KeyBlockMergeMorsel {
+    explicit KeyBlockMergeMorsel(uint64_t leftKeyBlockStartIdx, uint64_t leftKeyBlockEndIdx,
+        uint64_t rightKeyBlockStartIdx, uint64_t rightKeyBlockEndIdx)
+        : leftKeyBlockStartIdx{leftKeyBlockStartIdx}, leftKeyBlockEndIdx{leftKeyBlockEndIdx},
+          rightKeyBlockStartIdx{rightKeyBlockStartIdx}, rightKeyBlockEndIdx{rightKeyBlockEndIdx} {}
+
+    std::shared_ptr<KeyBlockMergeTask> keyBlockMergeTask;
+    uint64_t leftKeyBlockStartIdx;
+    uint64_t leftKeyBlockEndIdx;
+    uint64_t rightKeyBlockStartIdx;
+    uint64_t rightKeyBlockEndIdx;
+};
+
+// A dispatcher class used to assign KeyBlockMergeMorsel to threads.
+// All functions are guaranteed to be thread-safe, so callers don't need to
+// acquire a lock before calling these functions.
+class KeyBlockMergeTaskDispatcher {
+public:
+    inline bool isDoneMerge() {
+        std::lock_guard<std::mutex> keyBlockMergeDispatcherLock{mtx};
+        // Returns true if there are no more merge task to do or the sortedKeyBlocks is empty
+        // (meaning that the resultSet is empty).
+        return sortedKeyBlocks->size() <= 1 && activeKeyBlockMergeTasks.empty();
+    }
+
+    std::unique_ptr<KeyBlockMergeMorsel> getMorsel();
+
+    void doneMorsel(std::unique_ptr<KeyBlockMergeMorsel> morsel);
+
+    // This function is used to initialize the columns of keyBlockMergeTaskDispatcher based on
+    // sharedFactorizedTablesAndSortedKeyBlocks.
+    void init(storage::MemoryManager* memoryManager,
+        std::queue<std::shared_ptr<MergedKeyBlocks>>* sortedKeyBlocks,
+        std::vector<FactorizedTable*> factorizedTables, std::vector<StrKeyColInfo>& strKeyColsInfo,
+        uint64_t numBytesPerTuple);
+
+private:
+    std::mutex mtx;
+
+    storage::MemoryManager* memoryManager = nullptr;
+    std::queue<std::shared_ptr<MergedKeyBlocks>>* sortedKeyBlocks = nullptr;
+    std::vector<std::shared_ptr<KeyBlockMergeTask>> activeKeyBlockMergeTasks;
+    std::unique_ptr<KeyBlockMerger> keyBlockMerger;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by.h
new file mode 100644
index 0000000000..88f95ab6e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by.h
@@ -0,0 +1,68 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "processor/operator/sink.h"
+#include "processor/result/result_set.h"
+#include "sort_state.h"
+
+namespace lbug {
+namespace processor {
+
+struct OrderByPrintInfo final : OPPrintInfo {
+    binder::expression_vector keys;
+    binder::expression_vector payloads;
+
+    OrderByPrintInfo(binder::expression_vector keys, binder::expression_vector payloads)
+        : keys(std::move(keys)), payloads(std::move(payloads)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<OrderByPrintInfo>(new OrderByPrintInfo(*this));
+    }
+
+private:
+    OrderByPrintInfo(const OrderByPrintInfo& other)
+        : OPPrintInfo(other), keys(other.keys), payloads(other.payloads) {}
+};
+
+class OrderBy final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::ORDER_BY;
+
+public:
+    OrderBy(OrderByDataInfo info, std::shared_ptr<SortSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, std::move(child), id, std::move(printInfo)}, info{std::move(info)},
+          sharedState{std::move(sharedState)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) final;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    void finalize(ExecutionContext* /*context*/) override {
+        // TODO(Ziyi): we always call lookup function on the first factorizedTable in sharedState
+        // and that lookup function may read tuples in other factorizedTable, So we need to combine
+        // hasNoNullGuarantee with other factorizedTables. This is not a good way to solve this
+        // problem, and should be changed later.
+        sharedState->combineFTHasNoNullGuarantee();
+    }
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<OrderBy>(info.copy(), sharedState, children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    void initGlobalStateInternal(ExecutionContext* context) override;
+
+private:
+    OrderByDataInfo info;
+    SortLocalState localState;
+    std::shared_ptr<SortSharedState> sharedState;
+    std::vector<common::ValueVector*> orderByVectors;
+    std::vector<common::ValueVector*> payloadVectors;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_data_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_data_info.h
new file mode 100644
index 0000000000..424a0a3b31
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_data_info.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include "processor/data_pos.h"
+#include "processor/result/factorized_table_schema.h"
+
+namespace lbug {
+namespace processor {
+
+struct OrderByDataInfo {
+    std::vector<DataPos> keysPos;
+    std::vector<DataPos> payloadsPos;
+    std::vector<common::LogicalType> keyTypes;
+    std::vector<common::LogicalType> payloadTypes;
+    std::vector<bool> isAscOrder;
+    FactorizedTableSchema payloadTableSchema;
+    std::vector<uint32_t> keyInPayloadPos;
+
+    OrderByDataInfo(std::vector<DataPos> keysPos, std::vector<DataPos> payloadsPos,
+        std::vector<common::LogicalType> keyTypes, std::vector<common::LogicalType> payloadTypes,
+        std::vector<bool> isAscOrder, FactorizedTableSchema payloadTableSchema,
+        std::vector<uint32_t> keyInPayloadPos)
+        : keysPos{std::move(keysPos)}, payloadsPos{std::move(payloadsPos)},
+          keyTypes{std::move(keyTypes)}, payloadTypes{std::move(payloadTypes)},
+          isAscOrder{std::move(isAscOrder)}, payloadTableSchema{std::move(payloadTableSchema)},
+          keyInPayloadPos{std::move(keyInPayloadPos)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(OrderByDataInfo);
+
+private:
+    OrderByDataInfo(const OrderByDataInfo& other)
+        : keysPos{other.keysPos}, payloadsPos{other.payloadsPos},
+          keyTypes{common::LogicalType::copy(other.keyTypes)},
+          payloadTypes{common::LogicalType::copy(other.payloadTypes)}, isAscOrder{other.isAscOrder},
+          payloadTableSchema{other.payloadTableSchema.copy()},
+          keyInPayloadPos{other.keyInPayloadPos} {}
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_key_encoder.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_key_encoder.h
new file mode 100644
index 0000000000..ef70d5092b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_key_encoder.h
@@ -0,0 +1,134 @@
+#pragma once
+
+#include <functional>
+#include <vector>
+
+#include "common/vector/value_vector.h"
+#include "order_by_data_info.h"
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace processor {
+
+#define BSWAP64(x)                                                                                 \
+    ((uint64_t)((((uint64_t)(x) & 0xff00000000000000ull) >> 56) |                                  \
+                (((uint64_t)(x) & 0x00ff000000000000ull) >> 40) |                                  \
+                (((uint64_t)(x) & 0x0000ff0000000000ull) >> 24) |                                  \
+                (((uint64_t)(x) & 0x000000ff00000000ull) >> 8) |                                   \
+                (((uint64_t)(x) & 0x00000000ff000000ull) << 8) |                                   \
+                (((uint64_t)(x) & 0x0000000000ff0000ull) << 24) |                                  \
+                (((uint64_t)(x) & 0x000000000000ff00ull) << 40) |                                  \
+                (((uint64_t)(x) & 0x00000000000000ffull) << 56)))
+
+#define BSWAP32(x)                                                                                 \
+    ((uint32_t)((((uint32_t)(x) & 0xff000000) >> 24) | (((uint32_t)(x) & 0x00ff0000) >> 8) |       \
+                (((uint32_t)(x) & 0x0000ff00) << 8) | (((uint32_t)(x) & 0x000000ff) << 24)))
+
+#define BSWAP16(x) ((uint16_t)((((uint16_t)(x) & 0xff00) >> 8) | (((uint16_t)(x) & 0x00ff) << 8)))
+
+// The OrderByKeyEncoder encodes all columns in the ORDER BY clause into a single binary sequence
+// that, when compared using memcmp will yield the correct overall sorting order. On little-endian
+// hardware, the least-significant byte is stored at the smallest address. To encode the sorting
+// order, we need the big-endian representation for values. For example: we want to encode 73(INT64)
+// and 38(INT64) as an 8-byte binary string The encoding in little-endian hardware is:
+// 73=0x4900000000000000 38=0x2600000000000000, which doesn't preserve the order. The encoding in
+// big-endian hardware is: 73=0x0000000000000049 38=0x0000000000000026, which can easily be compared
+// using memcmp. In addition, The first bit is also flipped to preserve ordering between positive
+// and negative numbers. So the final encoding for 73(INT64) and 38(INT64) as an 8-byte binary
+// string is: 73=0x8000000000000049 38=0x8000000000000026. To handle the null in comparison, we
+// add an extra byte(called the NULL flag) to represent whether this value is null or not.
+
+using encode_function_t = std::function<void(const uint8_t*, uint8_t*, bool)>;
+
+class OrderByKeyEncoder {
+public:
+    OrderByKeyEncoder(const OrderByDataInfo& orderByDataInfo, storage::MemoryManager* memoryManager,
+        uint8_t ftIdx, uint32_t numTuplesPerBlockInFT, uint32_t numBytesPerTuple);
+
+    inline std::vector<std::shared_ptr<DataBlock>>& getKeyBlocks() { return keyBlocks; }
+
+    inline uint32_t getNumBytesPerTuple() const { return numBytesPerTuple; }
+
+    inline uint32_t getNumTuplesInCurBlock() const { return keyBlocks.back()->numTuples; }
+
+    static uint32_t getNumBytesPerTuple(const std::vector<common::ValueVector*>& keyVectors);
+
+    static inline uint32_t getEncodedFTBlockIdx(const uint8_t* tupleInfoPtr) {
+        return *(uint32_t*)tupleInfoPtr;
+    }
+
+    // Note: We only encode 3 bytes for ftBlockOffset, but we are reading 4 bytes from tupleInfoPtr.
+    // We need to do a bit mask to set the most significant byte to 0x00.
+    static inline uint32_t getEncodedFTBlockOffset(const uint8_t* tupleInfoPtr) {
+        return (*(uint32_t*)(tupleInfoPtr + 4) & 0x00FFFFFF);
+    }
+
+    static inline uint8_t getEncodedFTIdx(const uint8_t* tupleInfoPtr) {
+        return *(tupleInfoPtr + 7);
+    }
+
+    static inline bool isNullVal(const uint8_t* nullBytePtr, bool isAscOrder) {
+        return *(nullBytePtr) == (isAscOrder ? UINT8_MAX : 0);
+    }
+
+    static inline bool isLongStr(const uint8_t* strBuffer, bool isAsc) {
+        return *(strBuffer + 13) == (isAsc ? UINT8_MAX : 0);
+    }
+
+    static uint32_t getEncodingSize(const common::LogicalType& dataType);
+
+    void encodeKeys(const std::vector<common::ValueVector*>& orderByKeys);
+
+    inline void clear() { keyBlocks.clear(); }
+
+private:
+    template<typename type>
+    static inline void encodeTemplate(const uint8_t* data, uint8_t* resultPtr, bool swapBytes) {
+        OrderByKeyEncoder::encodeData(*(type*)data, resultPtr, swapBytes);
+    }
+
+    template<typename type>
+    static void encodeData(type /*data*/, uint8_t* /*resultPtr*/, bool /*swapBytes*/) {
+        KU_UNREACHABLE;
+    }
+
+    static inline uint8_t flipSign(uint8_t key_byte) { return key_byte ^ 128; }
+
+    void flipBytesIfNecessary(uint32_t keyColIdx, uint8_t* tuplePtr, uint32_t numEntriesToEncode,
+        common::LogicalType& type);
+
+    void encodeFlatVector(common::ValueVector* vector, uint8_t* tuplePtr, uint32_t keyColIdx);
+
+    void encodeUnflatVector(common ::ValueVector* vector, uint8_t* tuplePtr, uint32_t encodedTuples,
+        uint32_t numEntriesToEncode, uint32_t keyColIdx);
+
+    void encodeVector(common::ValueVector* vector, uint8_t* tuplePtr, uint32_t encodedTuples,
+        uint32_t numEntriesToEncode, uint32_t keyColIdx);
+
+    void encodeFTIdx(uint32_t numEntriesToEncode, uint8_t* tupleInfoPtr);
+
+    void allocateMemoryIfFull();
+
+    static void getEncodingFunction(common::PhysicalTypeID physicalType, encode_function_t& func);
+
+private:
+    storage::MemoryManager* memoryManager;
+    std::vector<std::shared_ptr<DataBlock>> keyBlocks;
+    std::vector<bool> isAscOrder;
+    uint32_t numBytesPerTuple;
+    uint32_t maxNumTuplesPerBlock;
+    uint32_t ftBlockIdx = 0;
+    // Since we encode 3 bytes for ftBlockOffset, the maxFTBlockOffset is 2^24 - 1.
+    static const uint32_t MAX_FT_BLOCK_OFFSET = (1ul << 24) - 1;
+    uint32_t ftBlockOffset = 0;
+    // We only encode 1 byte for ftIndex, this limits the maximum number of threads of our system to
+    // 256.
+    uint8_t ftIdx;
+    uint32_t numTuplesPerBlockInFT;
+    // We need to swap the encoded binary strings if we are using little endian hardware.
+    bool swapBytes;
+    std::vector<encode_function_t> encodeFunctions;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_merge.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_merge.h
new file mode 100644
index 0000000000..1c8acf174f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_merge.h
@@ -0,0 +1,41 @@
+#pragma once
+
+#include "processor/operator/order_by/sort_state.h"
+#include "processor/operator/physical_operator.h"
+#include "processor/operator/sink.h"
+#include "processor/result/result_set.h"
+
+namespace lbug {
+namespace processor {
+
+class OrderByMerge final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::ORDER_BY_MERGE;
+
+public:
+    OrderByMerge(std::shared_ptr<SortSharedState> sharedState,
+        std::shared_ptr<KeyBlockMergeTaskDispatcher> sharedDispatcher, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, id, printInfo->copy()}, sharedState{std::move(sharedState)},
+          sharedDispatcher{std::move(sharedDispatcher)} {}
+
+    bool isSource() const override { return true; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<OrderByMerge>(sharedState, sharedDispatcher, id, printInfo->copy());
+    }
+
+private:
+    void initGlobalStateInternal(ExecutionContext* context) override;
+
+private:
+    std::shared_ptr<SortSharedState> sharedState;
+    std::unique_ptr<KeyBlockMerger> localMerger;
+    std::shared_ptr<KeyBlockMergeTaskDispatcher> sharedDispatcher;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_scan.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_scan.h
new file mode 100644
index 0000000000..5ed037ff9c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/order_by_scan.h
@@ -0,0 +1,59 @@
+#pragma once
+
+#include "processor/operator/order_by/sort_state.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct OrderByScanLocalState {
+    std::vector<common::ValueVector*> vectorsToRead;
+    std::unique_ptr<PayloadScanner> payloadScanner;
+    uint64_t numTuples = 0;
+    uint64_t numTuplesRead = 0;
+
+    void init(std::vector<DataPos>& outVectorPos, SortSharedState& sharedState,
+        ResultSet& resultSet);
+
+    // NOLINTNEXTLINE(readability-make-member-function-const): Updates vectorsToRead.
+    uint64_t scan() {
+        uint64_t tuplesRead = payloadScanner->scan(vectorsToRead);
+        numTuplesRead += tuplesRead;
+        return tuplesRead;
+    }
+};
+
+// To preserve the ordering of tuples, the orderByScan operator will only
+// be executed in single-thread mode.
+class OrderByScan final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::ORDER_BY_SCAN;
+
+public:
+    OrderByScan(std::vector<DataPos> outVectorPos, std::shared_ptr<SortSharedState> sharedState,
+        uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, id, std::move(printInfo)}, outVectorPos{std::move(outVectorPos)},
+          localState{std::make_unique<OrderByScanLocalState>()},
+          sharedState{std::move(sharedState)} {}
+
+    bool isSource() const override { return true; }
+    // Ordered table should be scanned in single-thread mode.
+    bool isParallel() const override { return false; }
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<OrderByScan>(outVectorPos, sharedState, id, printInfo->copy());
+    }
+
+    double getProgress(ExecutionContext* context) const override;
+
+private:
+    std::vector<DataPos> outVectorPos;
+    std::unique_ptr<OrderByScanLocalState> localState;
+    std::shared_ptr<SortSharedState> sharedState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/radix_sort.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/radix_sort.h
new file mode 100644
index 0000000000..3ca6cf6a76
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/radix_sort.h
@@ -0,0 +1,73 @@
+#pragma once
+
+#include <queue>
+
+#include "processor/operator/order_by/key_block_merger.h"
+#include "processor/operator/order_by/order_by_key_encoder.h"
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct TieRange {
+public:
+    uint32_t startingTupleIdx;
+    uint32_t endingTupleIdx;
+    inline uint32_t getNumTuples() const { return endingTupleIdx - startingTupleIdx + 1; }
+    explicit TieRange(uint32_t startingTupleIdx, uint32_t endingTupleIdx)
+        : startingTupleIdx{startingTupleIdx}, endingTupleIdx{endingTupleIdx} {}
+};
+
+// RadixSort sorts a block of binary strings using the radixSort and quickSort (only for comparing
+// string overflow pointers). The algorithm loops through each column of the orderByVectors. If it
+// sees a column with string, which is variable length, it will call radixSort to sort the columns
+// seen so far. If there are tie tuples, it will compare the overflow ptr of strings. For subsequent
+// columns, the algorithm only calls radixSort on tie tuples.
+class RadixSort {
+public:
+    RadixSort(storage::MemoryManager* memoryManager, FactorizedTable& factorizedTable,
+        OrderByKeyEncoder& orderByKeyEncoder, std::vector<StrKeyColInfo> strKeyColsInfo);
+
+    void sortSingleKeyBlock(const DataBlock& keyBlock);
+
+private:
+    void radixSort(uint8_t* keyBlockPtr, uint32_t numTuplesToSort, uint32_t numBytesSorted,
+        uint32_t numBytesToSort);
+
+    std::vector<TieRange> findTies(uint8_t* keyBlockPtr, uint32_t numTuplesToFindTies,
+        uint32_t numBytesToSort, uint32_t baseTupleIdx) const;
+
+    void fillTmpTuplePtrSortingBlock(TieRange& keyBlockTie, uint8_t* keyBlockPtr);
+
+    void reOrderKeyBlock(TieRange& keyBlockTie, uint8_t* keyBlockPtr);
+
+    // Some ties can't be solved in quicksort, just add them to ties.
+    template<typename TYPE>
+    void findStringTies(TieRange& keyBlockTie, uint8_t* keyBlockPtr, std::queue<TieRange>& ties,
+        StrKeyColInfo& keyColInfo);
+
+    void solveStringTies(TieRange& keyBlockTie, uint8_t* keyBlockPtr, std::queue<TieRange>& ties,
+        StrKeyColInfo& keyColInfo);
+
+private:
+    std::unique_ptr<DataBlock> tmpSortingResultBlock;
+    // Since we do radix sort on each dataBlock at a time, the maxNumber of tuples in the dataBlock
+    // is: LARGE_PAGE_SIZE / numBytesPerTuple.
+    // The size of tmpTuplePtrSortingBlock should be larger than:
+    // sizeof(uint8_t*) * MaxNumOfTuplePointers=(LARGE_PAGE_SIZE / numBytesPerTuple).
+    // Since we know: numBytesPerTuple >= sizeof(uint8_t*) (note: we put the
+    // tupleIdx/FactorizedTableIdx at the end of each row in dataBlock), sizeof(uint8_t*) *
+    // MaxNumOfTuplePointers=(LARGE_PAGE_SIZE / numBytesPerTuple) <= LARGE_PAGE_SIZE. As a result,
+    // we only need one dataBlock to store the tuplePointers while solving the string ties.
+    std::unique_ptr<DataBlock> tmpTuplePtrSortingBlock;
+    // FactorizedTable stores all columns in the tuples that will be sorted, including the order by
+    // key columns. RadixSort uses factorizedTable to access the full contents of the string columns
+    // when resolving ties.
+    FactorizedTable& factorizedTable;
+    std::vector<StrKeyColInfo> strKeyColsInfo;
+    uint32_t numBytesPerTuple;
+    uint32_t numBytesToRadixSort;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/sort_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/sort_state.h
new file mode 100644
index 0000000000..aa86a28b60
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/sort_state.h
@@ -0,0 +1,92 @@
+#pragma once
+
+#include <queue>
+
+#include "processor/operator/order_by/radix_sort.h"
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace processor {
+
+class SortSharedState {
+public:
+    SortSharedState() : nextTableIdx{0}, numBytesPerTuple{0} {
+        sortedKeyBlocks = std::make_unique<std::queue<std::shared_ptr<MergedKeyBlocks>>>();
+    }
+
+    inline uint64_t getNumBytesPerTuple() const { return numBytesPerTuple; }
+
+    inline std::vector<StrKeyColInfo>& getStrKeyColInfo() { return strKeyColsInfo; }
+
+    inline std::queue<std::shared_ptr<MergedKeyBlocks>>* getSortedKeyBlocks() {
+        return sortedKeyBlocks.get();
+    }
+
+    void init(const OrderByDataInfo& orderByDataInfo);
+
+    std::pair<uint64_t, FactorizedTable*> getLocalPayloadTable(
+        storage::MemoryManager& memoryManager, const FactorizedTableSchema& payloadTableSchema);
+
+    void appendLocalSortedKeyBlock(const std::shared_ptr<MergedKeyBlocks>& mergedDataBlocks);
+
+    void combineFTHasNoNullGuarantee();
+
+    std::vector<FactorizedTable*> getPayloadTables() const;
+
+    inline MergedKeyBlocks* getMergedKeyBlock() const {
+        return sortedKeyBlocks->empty() ? nullptr : sortedKeyBlocks->front().get();
+    }
+
+private:
+    std::mutex mtx;
+    std::vector<std::unique_ptr<FactorizedTable>> payloadTables;
+    uint8_t nextTableIdx;
+    std::unique_ptr<std::queue<std::shared_ptr<MergedKeyBlocks>>> sortedKeyBlocks;
+    uint32_t numBytesPerTuple;
+    std::vector<StrKeyColInfo> strKeyColsInfo;
+};
+
+class SortLocalState {
+public:
+    void init(const OrderByDataInfo& orderByDataInfo, SortSharedState& sharedState,
+        storage::MemoryManager* memoryManager);
+
+    void append(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<common::ValueVector*>& payloadVectors);
+
+    void finalize(SortSharedState& sharedState);
+
+private:
+    std::unique_ptr<OrderByKeyEncoder> orderByKeyEncoder;
+    std::unique_ptr<RadixSort> radixSorter;
+    uint64_t globalIdx = UINT64_MAX;
+    FactorizedTable* payloadTable = nullptr;
+};
+
+class PayloadScanner {
+public:
+    PayloadScanner(MergedKeyBlocks* keyBlockToScan, std::vector<FactorizedTable*> payloadTables,
+        uint64_t skipNumber = UINT64_MAX, uint64_t limitNumber = UINT64_MAX);
+
+    uint64_t scan(std::vector<common::ValueVector*> vectorsToRead);
+
+private:
+    bool scanSingleTuple(std::vector<common::ValueVector*> vectorsToRead) const;
+
+    void applyLimitOnResultVectors(std::vector<common::ValueVector*> vectorsToRead);
+
+private:
+    bool hasUnflatColInPayload;
+    uint32_t payloadIdxOffset;
+    std::vector<uint32_t> colsToScan;
+    std::unique_ptr<uint8_t*[]> tuplesToRead;
+    std::unique_ptr<BlockPtrInfo> blockPtrInfo;
+    MergedKeyBlocks* keyBlockToScan;
+    uint32_t nextTupleIdxToReadInMergedKeyBlock;
+    uint64_t endTuplesIdxToReadInMergedKeyBlock;
+    std::vector<FactorizedTable*> payloadTables;
+    uint64_t limitNumber;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/top_k.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/top_k.h
new file mode 100644
index 0000000000..f5485e0778
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/top_k.h
@@ -0,0 +1,203 @@
+#pragma once
+
+#include <mutex>
+
+#include "binder/expression/expression.h"
+#include "processor/operator/sink.h"
+#include "sort_state.h"
+
+namespace lbug {
+namespace processor {
+
+struct TopKPrintInfo final : OPPrintInfo {
+    binder::expression_vector keys;
+    binder::expression_vector payloads;
+    uint64_t skipNum;
+    uint64_t limitNum;
+
+    TopKPrintInfo(binder::expression_vector keys, binder::expression_vector payloads,
+        uint64_t skipNum, uint64_t limitNum)
+        : keys(std::move(keys)), payloads(std::move(payloads)), skipNum(skipNum),
+          limitNum(limitNum) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<TopKPrintInfo>(new TopKPrintInfo(*this));
+    }
+
+private:
+    TopKPrintInfo(const TopKPrintInfo& other)
+        : OPPrintInfo(other), keys(other.keys), payloads(other.payloads), skipNum(other.skipNum),
+          limitNum(other.limitNum) {}
+};
+
+class TopKSortState {
+public:
+    TopKSortState();
+
+    void init(const OrderByDataInfo& orderByDataInfo, storage::MemoryManager* memoryManager);
+
+    void append(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<common::ValueVector*>& payloadVectors);
+
+    void finalize();
+
+    inline uint64_t getNumTuples() const { return numTuples; }
+
+    inline SortSharedState* getSharedState() { return orderBySharedState.get(); }
+
+    std::unique_ptr<PayloadScanner> getScanner(uint64_t skip, uint64_t limit) const {
+        return std::make_unique<PayloadScanner>(orderBySharedState->getMergedKeyBlock(),
+            orderBySharedState->getPayloadTables(), skip, limit);
+    }
+
+private:
+    std::unique_ptr<SortLocalState> orderByLocalState;
+    std::unique_ptr<SortSharedState> orderBySharedState;
+
+    uint64_t numTuples;
+    storage::MemoryManager* memoryManager;
+};
+
+class TopKBuffer {
+    using vector_select_comparison_func = std::function<bool(common::ValueVector&,
+        common::ValueVector&, common::SelectionVector&, void* dataPtr)>;
+
+public:
+    explicit TopKBuffer(const OrderByDataInfo& orderByDataInfo)
+        : orderByDataInfo{&orderByDataInfo}, skip{0}, limit{0}, memoryManager{nullptr},
+          hasBoundaryValue{false} {
+        sortState = std::make_unique<TopKSortState>();
+    }
+
+    void init(storage::MemoryManager* memoryManager, uint64_t skipNumber, uint64_t limitNumber);
+
+    void append(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<common::ValueVector*>& payloadVectors);
+
+    void reduce();
+
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    inline void finalize() { sortState->finalize(); }
+
+    void merge(TopKBuffer* other);
+
+    inline std::unique_ptr<PayloadScanner> getScanner() const {
+        return sortState->getScanner(skip, limit);
+    }
+
+private:
+    void initVectors();
+
+    template<typename FUNC>
+    void getSelectComparisonFunction(common::PhysicalTypeID typeID,
+        vector_select_comparison_func& selectFunc);
+
+    void initCompareFuncs();
+
+    void setBoundaryValue();
+
+    bool compareBoundaryValue(const std::vector<common::ValueVector*>& keyVectors);
+
+    bool compareFlatKeys(common::idx_t vectorIdxToCompare,
+        const std::vector<common::ValueVector*> keyVectors);
+
+    void compareUnflatKeys(common::idx_t vectorIdxToCompare,
+        const std::vector<common::ValueVector*> keyVectors);
+
+    static void appendSelState(common::SelectionVector* selVector,
+        common::SelectionVector* selVectorToAppend);
+
+public:
+    const OrderByDataInfo* orderByDataInfo;
+    std::unique_ptr<TopKSortState> sortState;
+    uint64_t skip;
+    uint64_t limit;
+    storage::MemoryManager* memoryManager;
+    std::vector<vector_select_comparison_func> compareFuncs;
+    std::vector<vector_select_comparison_func> equalsFuncs;
+    bool hasBoundaryValue;
+
+private:
+    // Holds the ownership of all temp vectors.
+    std::vector<std::unique_ptr<common::ValueVector>> tmpVectors;
+    std::vector<std::unique_ptr<common::ValueVector>> boundaryVecs;
+
+    std::vector<common::ValueVector*> payloadVecsToScan;
+    std::vector<common::ValueVector*> keyVecsToScan;
+    std::vector<common::ValueVector*> lastPayloadVecsToScan;
+    std::vector<common::ValueVector*> lastKeyVecsToScan;
+};
+
+class TopKLocalState {
+public:
+    void init(const OrderByDataInfo& orderByDataInfo, storage::MemoryManager* memoryManager,
+        ResultSet& resultSet, uint64_t skipNumber, uint64_t limitNumber);
+
+    void append(const std::vector<common::ValueVector*>& keyVectors,
+        const std::vector<common::ValueVector*>& payloadVectors);
+
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    inline void finalize() { buffer->finalize(); }
+
+    std::unique_ptr<TopKBuffer> buffer;
+};
+
+class TopKSharedState {
+public:
+    void init(const OrderByDataInfo& orderByDataInfo, storage::MemoryManager* memoryManager,
+        uint64_t skipNumber, uint64_t limitNumber) {
+        buffer = std::make_unique<TopKBuffer>(orderByDataInfo);
+        buffer->init(memoryManager, skipNumber, limitNumber);
+    }
+
+    void mergeLocalState(TopKLocalState* localState) {
+        std::unique_lock lck{mtx};
+        buffer->merge(localState->buffer.get());
+    }
+
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    inline void finalize() { buffer->finalize(); }
+
+    std::unique_ptr<TopKBuffer> buffer;
+
+private:
+    std::mutex mtx;
+};
+
+class TopK final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::TOP_K;
+
+public:
+    TopK(OrderByDataInfo info, std::shared_ptr<TopKSharedState> sharedState, uint64_t skipNumber,
+        uint64_t limitNumber, std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, std::move(child), id, std::move(printInfo)}, info(std::move(info)),
+          sharedState{std::move(sharedState)}, skipNumber{skipNumber}, limitNumber{limitNumber} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void initGlobalStateInternal(ExecutionContext* context) override;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    void finalize(ExecutionContext* /*context*/) override { sharedState->finalize(); }
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<TopK>(info.copy(), sharedState, skipNumber, limitNumber,
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    OrderByDataInfo info;
+    TopKLocalState localState;
+    std::shared_ptr<TopKSharedState> sharedState;
+    uint64_t skipNumber;
+    uint64_t limitNumber;
+    std::vector<common::ValueVector*> orderByVectors;
+    std::vector<common::ValueVector*> payloadVectors;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/top_k_scanner.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/top_k_scanner.h
new file mode 100644
index 0000000000..7e70f7bfbd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/order_by/top_k_scanner.h
@@ -0,0 +1,47 @@
+#pragma once
+
+#include "top_k.h"
+
+namespace lbug {
+namespace processor {
+
+struct TopKLocalScanState {
+    std::vector<common::ValueVector*> vectorsToScan;
+    std::unique_ptr<PayloadScanner> payloadScanner;
+
+    void init(std::vector<DataPos>& outVectorPos, TopKSharedState& sharedState,
+        ResultSet& resultSet);
+
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    inline uint64_t scan() { return payloadScanner->scan(vectorsToScan); }
+};
+
+class TopKScan final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::TOP_K_SCAN;
+
+public:
+    TopKScan(std::vector<DataPos> outVectorPos, std::shared_ptr<TopKSharedState> sharedState,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, id, std::move(printInfo)}, outVectorPos{std::move(outVectorPos)},
+          localState{std::make_unique<TopKLocalScanState>()}, sharedState{std::move(sharedState)} {}
+
+    bool isSource() const override { return true; }
+    // Ordered table should be scanned in single-thread mode.
+    bool isParallel() const override { return false; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<TopKScan>(outVectorPos, sharedState, id, printInfo->copy());
+    }
+
+private:
+    std::vector<DataPos> outVectorPos;
+    std::unique_ptr<TopKLocalScanState> localState;
+    std::shared_ptr<TopKSharedState> sharedState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/partitioner.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/partitioner.h
new file mode 100644
index 0000000000..0c138f29b2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/partitioner.h
@@ -0,0 +1,200 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/enums/column_evaluate_type.h"
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/operator/base_partitioner_shared_state.h"
+#include "processor/operator/sink.h"
+#include "storage/table/in_mem_chunked_node_group_collection.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+} // namespace storage
+namespace transaction {
+class Transaction;
+}
+namespace processor {
+
+using partitioner_func_t =
+    std::function<void(common::ValueVector* key, common::ValueVector* result)>;
+
+struct PartitionerFunctions {
+    static void partitionRelData(common::ValueVector* key, common::ValueVector* partitionIdxes);
+};
+
+// Partitioner operator can duplicate and partition the same data chunk from child with multiple
+// partitioning methods. For example, copy of rel tables require partitioning on both FWD and BWD
+// direction. Each partitioning method corresponds to a PartitioningState.
+struct PartitioningBuffer {
+    std::vector<std::unique_ptr<storage::InMemChunkedNodeGroupCollection>> partitions;
+
+    void merge(const PartitioningBuffer& localPartitioningState) const;
+};
+
+// NOTE: Currently, Partitioner is tightly coupled with RelBatchInsert. We should generalize it
+// later when necessary. Here, each partition is essentially a node group.
+struct BatchInsertSharedState;
+struct PartitioningInfo;
+struct PartitionerDataInfo;
+struct PartitionerInfo;
+struct RelBatchInsertProgressSharedState;
+
+struct CopyPartitionerSharedState : public PartitionerSharedState {
+    std::mutex mtx;
+    storage::MemoryManager& mm;
+
+    explicit CopyPartitionerSharedState(storage::MemoryManager& mm) : mm{mm} {}
+
+    std::vector<std::unique_ptr<PartitioningBuffer>> partitioningBuffers;
+
+    void initialize(const common::logical_type_vec_t& columnTypes, common::idx_t numPartitioners,
+        const main::ClientContext* clientContext) override;
+
+    void resetState(common::idx_t partitioningIdx) override;
+    void merge(const std::vector<std::unique_ptr<PartitioningBuffer>>& localPartitioningStates);
+
+    // Must only be called once for any given parameters.
+    // The data gets moved out of the shared state since some of it may be spilled to disk and will
+    // need to be freed after its processed.
+    std::unique_ptr<storage::InMemChunkedNodeGroupCollection> getPartitionBuffer(
+        common::idx_t partitioningIdx, common::partition_idx_t partitionIdx) const {
+        KU_ASSERT(partitioningIdx < partitioningBuffers.size());
+        KU_ASSERT(partitionIdx < partitioningBuffers[partitioningIdx]->partitions.size());
+
+        KU_ASSERT(partitioningBuffers[partitioningIdx]->partitions[partitionIdx].get());
+        auto partitioningBuffer =
+            std::move(partitioningBuffers[partitioningIdx]->partitions[partitionIdx]);
+        // This may still run out of memory if there isn't enough space for one partitioningBuffer
+        // per thread
+        partitioningBuffer->loadFromDisk(mm);
+        return partitioningBuffer;
+    }
+};
+
+struct PartitionerLocalState {
+    std::vector<std::unique_ptr<PartitioningBuffer>> partitioningBuffers;
+
+    PartitioningBuffer* getPartitioningBuffer(common::partition_idx_t partitioningIdx) const {
+        KU_ASSERT(partitioningIdx < partitioningBuffers.size());
+        return partitioningBuffers[partitioningIdx].get();
+    }
+};
+
+struct PartitioningInfo {
+    common::idx_t keyIdx;
+    partitioner_func_t partitionerFunc;
+
+    PartitioningInfo(common::idx_t keyIdx, partitioner_func_t partitionerFunc)
+        : keyIdx{keyIdx}, partitionerFunc{std::move(partitionerFunc)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(PartitioningInfo);
+
+private:
+    PartitioningInfo(const PartitioningInfo& other)
+        : keyIdx{other.keyIdx}, partitionerFunc{other.partitionerFunc} {}
+};
+
+struct PartitionerDataInfo {
+    std::string tableName;
+    std::string fromTableName;
+    std::string toTableName;
+    std::vector<common::LogicalType> columnTypes;
+    evaluator::evaluator_vector_t columnEvaluators;
+    std::vector<common::ColumnEvaluateType> evaluateTypes;
+
+    PartitionerDataInfo(std::string tableName, std::string fromTableName, std::string toTableName,
+        std::vector<common::LogicalType> columnTypes,
+        std::vector<std::unique_ptr<evaluator::ExpressionEvaluator>> columnEvaluators,
+        std::vector<common::ColumnEvaluateType> evaluateTypes)
+        : tableName{std::move(tableName)}, fromTableName{std::move(fromTableName)},
+          toTableName{std::move(toTableName)}, columnTypes{std::move(columnTypes)},
+          columnEvaluators{std::move(columnEvaluators)}, evaluateTypes{std::move(evaluateTypes)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(PartitionerDataInfo);
+
+private:
+    PartitionerDataInfo(const PartitionerDataInfo& other)
+        : tableName{other.tableName}, fromTableName{other.fromTableName},
+          toTableName{other.toTableName}, columnTypes{common::LogicalType::copy(other.columnTypes)},
+          columnEvaluators{copyVector(other.columnEvaluators)}, evaluateTypes{other.evaluateTypes} {
+    }
+};
+
+struct PartitionerInfo {
+    DataPos relOffsetDataPos;
+    std::vector<PartitioningInfo> infos;
+
+    PartitionerInfo() {}
+    PartitionerInfo(const PartitionerInfo& other) : relOffsetDataPos{other.relOffsetDataPos} {
+        infos.reserve(other.infos.size());
+        for (auto& otherInfo : other.infos) {
+            infos.push_back(otherInfo.copy());
+        }
+    }
+
+    EXPLICIT_COPY_DEFAULT_MOVE(PartitionerInfo);
+};
+
+struct PartitionerPrintInfo final : OPPrintInfo {
+    binder::expression_vector expressions;
+
+    explicit PartitionerPrintInfo(binder::expression_vector expressions)
+        : expressions{std::move(expressions)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<PartitionerPrintInfo>(new PartitionerPrintInfo(*this));
+    }
+
+private:
+    PartitionerPrintInfo(const PartitionerPrintInfo& other)
+        : OPPrintInfo{other}, expressions{other.expressions} {}
+};
+
+class Partitioner final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::PARTITIONER;
+
+public:
+    Partitioner(PartitionerInfo info, PartitionerDataInfo dataInfo,
+        std::shared_ptr<CopyPartitionerSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo);
+
+    void initGlobalStateInternal(ExecutionContext* context) override;
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+    void executeInternal(ExecutionContext* context) override;
+
+    std::shared_ptr<CopyPartitionerSharedState> getSharedState() { return sharedState; }
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<Partitioner>(info.copy(), dataInfo.copy(), sharedState,
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+    static void initializePartitioningStates(const common::logical_type_vec_t& columnTypes,
+        std::vector<std::unique_ptr<PartitioningBuffer>>& partitioningBuffers,
+        const std::array<common::partition_idx_t, CopyPartitionerSharedState::DIRECTIONS>&
+            numPartitions,
+        common::idx_t numPartitioners);
+
+private:
+    void evaluateExpressions(uint64_t numRels) const;
+    common::DataChunk constructDataChunk(
+        const std::shared_ptr<common::DataChunkState>& state) const;
+    // TODO: For now, RelBatchInsert will guarantee all data are inside one data chunk. Should be
+    //  generalized to resultSet later if needed.
+    void copyDataToPartitions(storage::MemoryManager& memoryManager,
+        common::partition_idx_t partitioningIdx, const common::DataChunk& chunkToCopyFrom) const;
+
+private:
+    PartitionerDataInfo dataInfo;
+    PartitionerInfo info;
+    std::shared_ptr<CopyPartitionerSharedState> sharedState;
+    std::unique_ptr<PartitionerLocalState> localState;
+
+    // Intermediate temp value vector.
+    std::unique_ptr<common::ValueVector> partitionIdxes;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/path_property_probe.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/path_property_probe.h
new file mode 100644
index 0000000000..5d8dba65c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/path_property_probe.h
@@ -0,0 +1,122 @@
+#pragma once
+
+#include "common/enums/extend_direction.h"
+#include "processor/operator/hash_join/hash_join_build.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct PathPropertyProbeSharedState {
+    std::shared_ptr<HashJoinSharedState> nodeHashTableState;
+    std::shared_ptr<HashJoinSharedState> relHashTableState;
+
+    PathPropertyProbeSharedState(std::shared_ptr<HashJoinSharedState> nodeHashTableState,
+        std::shared_ptr<HashJoinSharedState> relHashTableState)
+        : nodeHashTableState{std::move(nodeHashTableState)},
+          relHashTableState{std::move(relHashTableState)} {}
+};
+
+struct PathPropertyProbeLocalState {
+    std::unique_ptr<common::hash_t[]> hashes;
+    std::unique_ptr<uint8_t*[]> probedTuples;
+    std::unique_ptr<uint8_t*[]> matchedTuples;
+
+    PathPropertyProbeLocalState() {
+        hashes = std::make_unique<common::hash_t[]>(common::DEFAULT_VECTOR_CAPACITY);
+        probedTuples = std::make_unique<uint8_t*[]>(common::DEFAULT_VECTOR_CAPACITY);
+        matchedTuples = std::make_unique<uint8_t*[]>(common::DEFAULT_VECTOR_CAPACITY);
+    }
+};
+
+struct PathPropertyProbeInfo {
+    DataPos pathPos = DataPos();
+
+    DataPos leftNodeIDPos = DataPos();
+    DataPos rightNodeIDPos = DataPos();
+    DataPos inputNodeIDsPos = DataPos();
+    DataPos inputEdgeIDsPos = DataPos();
+    DataPos directionPos = DataPos();
+
+    std::unordered_map<common::table_id_t, std::string> tableIDToName;
+
+    std::vector<common::struct_field_idx_t> nodeFieldIndices;
+    std::vector<common::struct_field_idx_t> relFieldIndices;
+    std::vector<ft_col_idx_t> nodeTableColumnIndices;
+    std::vector<ft_col_idx_t> relTableColumnIndices;
+
+    common::ExtendDirection extendDirection = common::ExtendDirection::FWD;
+    bool extendFromLeft = false;
+
+    PathPropertyProbeInfo() = default;
+    EXPLICIT_COPY_DEFAULT_MOVE(PathPropertyProbeInfo);
+
+private:
+    PathPropertyProbeInfo(const PathPropertyProbeInfo& other) {
+        pathPos = other.pathPos;
+        leftNodeIDPos = other.leftNodeIDPos;
+        rightNodeIDPos = other.rightNodeIDPos;
+        inputNodeIDsPos = other.inputNodeIDsPos;
+        inputEdgeIDsPos = other.inputEdgeIDsPos;
+        directionPos = other.directionPos;
+        tableIDToName = other.tableIDToName;
+        nodeFieldIndices = other.nodeFieldIndices;
+        relFieldIndices = other.relFieldIndices;
+        nodeTableColumnIndices = other.nodeTableColumnIndices;
+        relTableColumnIndices = other.relTableColumnIndices;
+        extendDirection = other.extendDirection;
+        extendFromLeft = other.extendFromLeft;
+    }
+};
+
+class PathPropertyProbe : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::PATH_PROPERTY_PROBE;
+
+public:
+    PathPropertyProbe(PathPropertyProbeInfo info,
+        std::shared_ptr<PathPropertyProbeSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> probeChild, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(probeChild), id, std::move(printInfo)},
+          info{std::move(info)}, sharedState{std::move(sharedState)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet_, ExecutionContext* context) final;
+
+    bool getNextTuplesInternal(ExecutionContext* context) final;
+
+    std::unique_ptr<PhysicalOperator> copy() final {
+        return std::make_unique<PathPropertyProbe>(info.copy(), sharedState, children[0]->copy(),
+            id, printInfo->copy());
+    }
+
+private:
+    void probe(JoinHashTable* hashTable, uint64_t sizeProbed, uint64_t sizeToProbe,
+        common::ValueVector* idVector, const std::vector<common::ValueVector*>& propertyVectors,
+        const std::vector<ft_col_idx_t>& colIndicesToScan) const;
+
+private:
+    PathPropertyProbeInfo info;
+    std::shared_ptr<PathPropertyProbeSharedState> sharedState;
+    PathPropertyProbeLocalState localState;
+
+    common::ValueVector* pathNodesVector = nullptr;
+    common::ValueVector* pathRelsVector = nullptr;
+    common::ValueVector* pathNodeIDsDataVector = nullptr;
+    common::ValueVector* pathNodeLabelsDataVector = nullptr;
+    common::ValueVector* pathRelIDsDataVector = nullptr;
+    common::ValueVector* pathRelLabelsDataVector = nullptr;
+    common::ValueVector* pathSrcNodeIDsDataVector = nullptr;
+    common::ValueVector* pathDstNodeIDsDataVector = nullptr;
+
+    std::vector<common::ValueVector*> pathNodesPropertyDataVectors;
+    std::vector<common::ValueVector*> pathRelsPropertyDataVectors;
+
+    common::ValueVector* inputLeftNodeIDVector = nullptr;
+    common::ValueVector* inputRightNodeIDVector = nullptr;
+    common::ValueVector* inputNodeIDsVector = nullptr;
+    common::ValueVector* inputRelIDsVector = nullptr;
+    common::ValueVector* inputDirectionVector = nullptr;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/batch_insert.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/batch_insert.h
new file mode 100644
index 0000000000..9d14fa3eaf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/batch_insert.h
@@ -0,0 +1,121 @@
+#pragma once
+
+#include "main/query_result/materialized_query_result.h"
+#include "processor/operator/sink.h"
+#include "processor/result/factorized_table.h"
+#include "storage/page_allocator.h"
+#include "storage/table/table.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+class ChunkedNodeGroup;
+} // namespace storage
+namespace processor {
+
+struct BatchInsertInfo {
+    std::string tableName;
+    bool compressionEnabled = true;
+
+    std::vector<common::LogicalType> warningColumnTypes;
+    // column types include property and warning
+    std::vector<common::LogicalType> columnTypes;
+    std::vector<common::column_id_t> insertColumnIDs;
+    std::vector<common::column_id_t> outputDataColumns;
+    std::vector<common::column_id_t> warningDataColumns;
+
+    BatchInsertInfo(std::string tableName, std::vector<common::LogicalType> warningColumnTypes)
+        : tableName{std::move(tableName)}, warningColumnTypes{std::move(warningColumnTypes)} {}
+    BatchInsertInfo(const BatchInsertInfo& other)
+        : tableName{other.tableName}, compressionEnabled{other.compressionEnabled},
+          warningColumnTypes{copyVector(other.warningColumnTypes)},
+          columnTypes{copyVector(other.columnTypes)}, insertColumnIDs{other.insertColumnIDs},
+          outputDataColumns{other.outputDataColumns}, warningDataColumns{other.warningDataColumns} {
+    }
+    DELETE_COPY_ASSN(BatchInsertInfo);
+    virtual ~BatchInsertInfo() = default;
+
+    virtual std::unique_ptr<BatchInsertInfo> copy() const = 0;
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+};
+
+struct LBUG_API BatchInsertSharedState {
+    std::mutex mtx;
+    std::atomic<common::row_idx_t> numRows;
+
+    // Use a separate mutex for numErroredRows to avoid double-locking in local error handlers
+    // As access to numErroredRows is independent of access to other shared state
+    std::mutex erroredRowMutex;
+    std::shared_ptr<common::row_idx_t> numErroredRows;
+
+    storage::Table* table;
+    std::shared_ptr<FactorizedTable> fTable;
+
+    explicit BatchInsertSharedState(std::shared_ptr<FactorizedTable> fTable)
+        : numRows{0}, numErroredRows(std::make_shared<common::row_idx_t>(0)), table{nullptr},
+          fTable{std::move(fTable)} {};
+    BatchInsertSharedState(const BatchInsertSharedState& other) = delete;
+
+    virtual ~BatchInsertSharedState() = default;
+
+    void incrementNumRows(common::row_idx_t numRowsToIncrement) {
+        numRows.fetch_add(numRowsToIncrement);
+    }
+    common::row_idx_t getNumRows() const { return numRows.load(); }
+    common::row_idx_t getNumErroredRows() {
+        common::UniqLock lockGuard{erroredRowMutex};
+        return *numErroredRows;
+    }
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+};
+
+struct BatchInsertLocalState {
+    std::unique_ptr<storage::InMemChunkedNodeGroup> chunkedGroup;
+    storage::PageAllocator* optimisticAllocator = nullptr;
+
+    virtual ~BatchInsertLocalState() = default;
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+};
+
+class LBUG_API BatchInsert : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::BATCH_INSERT;
+
+public:
+    BatchInsert(std::unique_ptr<BatchInsertInfo> info,
+        std::shared_ptr<BatchInsertSharedState> sharedState, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, id, std::move(printInfo)}, info{std::move(info)},
+          sharedState{std::move(sharedState)} {}
+
+    ~BatchInsert() override = default;
+
+    std::shared_ptr<FactorizedTable> getResultFTable() const override {
+        return sharedState->fTable;
+    }
+
+    std::unique_ptr<main::QueryResult> getQueryResult() const override {
+        return std::make_unique<main::MaterializedQueryResult>(sharedState->fTable);
+    }
+
+    std::unique_ptr<PhysicalOperator> copy() override = 0;
+
+protected:
+    std::unique_ptr<BatchInsertInfo> info;
+    std::shared_ptr<BatchInsertSharedState> sharedState;
+    std::unique_ptr<BatchInsertLocalState> localState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/batch_insert_error_handler.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/batch_insert_error_handler.h
new file mode 100644
index 0000000000..90dfef69d6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/batch_insert_error_handler.h
@@ -0,0 +1,53 @@
+#pragma once
+
+#include <optional>
+
+#include "common/types/types.h"
+#include "processor/execution_context.h"
+#include "processor/operator/persistent/reader/copy_from_error.h"
+
+namespace lbug {
+namespace processor {
+struct BatchInsertCachedError {
+    explicit BatchInsertCachedError(std::string message,
+        const std::optional<WarningSourceData>& warningData = {});
+    BatchInsertCachedError() = default;
+
+    std::string message;
+
+    // CSV Reader data
+    std::optional<WarningSourceData> warningData;
+};
+
+class BatchInsertErrorHandler {
+public:
+    BatchInsertErrorHandler(ExecutionContext* context, bool ignoreErrors,
+        std::shared_ptr<common::row_idx_t> sharedErrorCounter = nullptr,
+        std::mutex* sharedErrorCounterMtx = nullptr);
+
+    void handleError(std::string message, const std::optional<WarningSourceData>& warningData = {});
+
+    void handleError(BatchInsertCachedError error);
+
+    void flushStoredErrors();
+    bool getIgnoreErrors() const;
+
+private:
+    common::row_idx_t getNumErrors() const;
+    void addNewVectorsIfNeeded();
+    void clearErrors();
+
+    static constexpr uint64_t LOCAL_WARNING_LIMIT = 1024;
+
+    bool ignoreErrors;
+    uint64_t warningLimit;
+    ExecutionContext* context;
+    uint64_t currentInsertIdx;
+
+    std::mutex* sharedErrorCounterMtx;
+    std::shared_ptr<common::row_idx_t> sharedErrorCounter;
+
+    std::vector<BatchInsertCachedError> cachedErrors;
+};
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/copy_rel_batch_insert.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/copy_rel_batch_insert.h
new file mode 100644
index 0000000000..d931cdd229
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/copy_rel_batch_insert.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include "processor/operator/persistent/rel_batch_insert.h"
+
+namespace lbug {
+namespace storage {
+class CSRNodeGroup;
+struct InMemChunkedCSRHeader;
+} // namespace storage
+
+namespace processor {
+
+struct CopyRelBatchInsertExecutionState : RelBatchInsertExecutionState {
+    std::unique_ptr<storage::InMemChunkedNodeGroupCollection> partitioningBuffer;
+};
+
+class CopyRelBatchInsert final : public RelBatchInsertImpl {
+public:
+    std::unique_ptr<RelBatchInsertImpl> copy() override {
+        return std::make_unique<CopyRelBatchInsert>(*this);
+    }
+
+    std::unique_ptr<RelBatchInsertExecutionState> initExecutionState(
+        const PartitionerSharedState& partitionerSharedState, const RelBatchInsertInfo& relInfo,
+        common::node_group_idx_t nodeGroupIdx) override;
+
+    void populateCSRLengths(RelBatchInsertExecutionState& executionState,
+        storage::InMemChunkedCSRHeader& csrHeader, common::offset_t numNodes,
+        const RelBatchInsertInfo& relInfo) override;
+
+    void finalizeStartCSROffsets(RelBatchInsertExecutionState& executionState,
+        storage::InMemChunkedCSRHeader& csrHeader, const RelBatchInsertInfo& relInfo) override;
+
+    void writeToTable(RelBatchInsertExecutionState& executionState,
+        const storage::InMemChunkedCSRHeader& csrHeader, const RelBatchInsertLocalState& localState,
+        BatchInsertSharedState& sharedState, const RelBatchInsertInfo& relInfo) override;
+
+private:
+    static void setRowIdxFromCSROffsets(storage::ColumnChunkData& rowIdxChunk,
+        storage::ColumnChunkData& csrOffsetChunk);
+
+    static void populateCSRLengthsInternal(const storage::InMemChunkedCSRHeader& csrHeader,
+        common::offset_t numNodes, storage::InMemChunkedNodeGroupCollection& partition,
+        common::column_id_t boundNodeOffsetColumn);
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/copy_to.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/copy_to.h
new file mode 100644
index 0000000000..2619147067
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/copy_to.h
@@ -0,0 +1,87 @@
+#pragma once
+
+#include <filesystem>
+
+#include "function/export/export_function.h"
+#include "processor/operator/sink.h"
+#include "processor/result/result_set.h"
+
+namespace lbug {
+namespace processor {
+
+struct CopyToInfo {
+    function::ExportFunction exportFunc;
+    std::unique_ptr<function::ExportFuncBindData> bindData;
+    std::vector<DataPos> inputVectorPoses;
+    std::vector<bool> isFlatVec;
+
+    CopyToInfo(function::ExportFunction exportFunc,
+        std::unique_ptr<function::ExportFuncBindData> bindData,
+        std::vector<DataPos> inputVectorPoses, std::vector<bool> isFlatVec)
+        : exportFunc{std::move(exportFunc)}, bindData{std::move(bindData)},
+          inputVectorPoses{std::move(inputVectorPoses)}, isFlatVec{std::move(isFlatVec)} {}
+
+    CopyToInfo copy() const {
+        return CopyToInfo{exportFunc, bindData->copy(), inputVectorPoses, isFlatVec};
+    }
+};
+
+struct CopyToLocalState {
+    std::unique_ptr<function::ExportFuncLocalState> exportFuncLocalState;
+    std::vector<std::shared_ptr<common::ValueVector>> inputVectors;
+};
+
+struct CopyToPrintInfo final : OPPrintInfo {
+    std::vector<std::string> columnNames;
+    std::string fileName;
+
+    CopyToPrintInfo(std::vector<std::string> columnNames, std::string fileName)
+        : columnNames{std::move(columnNames)}, fileName{std::move(fileName)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<CopyToPrintInfo>(new CopyToPrintInfo(*this));
+    }
+
+private:
+    CopyToPrintInfo(const CopyToPrintInfo& other)
+        : OPPrintInfo{other}, columnNames{other.columnNames}, fileName{other.fileName} {}
+};
+
+class CopyTo final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::COPY_TO;
+
+public:
+    CopyTo(CopyToInfo info, std::shared_ptr<function::ExportFuncSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, std::move(child), id, std::move(printInfo)}, info{std::move(info)},
+          sharedState{std::move(sharedState)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void initGlobalStateInternal(ExecutionContext* context) override;
+
+    void finalize(ExecutionContext* context) override;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::pair<std::string, std::atomic<bool>&> getParallelFlag() {
+        return {std::filesystem::path(info.bindData->fileName).filename().string(),
+            sharedState->parallelFlag};
+    }
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<CopyTo>(info.copy(), sharedState, children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    CopyToInfo info;
+    CopyToLocalState localState;
+    std::shared_ptr<function::ExportFuncSharedState> sharedState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/delete.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/delete.h
new file mode 100644
index 0000000000..664a250008
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/delete.h
@@ -0,0 +1,95 @@
+#pragma once
+
+#include "delete_executor.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct DeleteNodePrintInfo final : OPPrintInfo {
+    binder::expression_vector expressions;
+    common::DeleteNodeType deleteType;
+
+    DeleteNodePrintInfo(binder::expression_vector expressions, common::DeleteNodeType deleteType)
+        : expressions{std::move(expressions)}, deleteType{deleteType} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<DeleteNodePrintInfo>(new DeleteNodePrintInfo(*this));
+    }
+
+private:
+    DeleteNodePrintInfo(const DeleteNodePrintInfo& other)
+        : OPPrintInfo{other}, expressions{other.expressions}, deleteType{other.deleteType} {}
+};
+
+class DeleteNode final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::DELETE_;
+
+public:
+    DeleteNode(std::vector<std::unique_ptr<NodeDeleteExecutor>> executors,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          executors{std::move(executors)} {}
+
+    bool isParallel() const override { return false; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<DeleteNode>(copyVector(executors), children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    std::vector<std::unique_ptr<NodeDeleteExecutor>> executors;
+};
+
+struct DeleteRelPrintInfo final : OPPrintInfo {
+    binder::expression_vector expressions;
+
+    explicit DeleteRelPrintInfo(binder::expression_vector expressions)
+        : expressions{std::move(expressions)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<DeleteRelPrintInfo>(new DeleteRelPrintInfo(*this));
+    }
+
+private:
+    DeleteRelPrintInfo(const DeleteRelPrintInfo& other)
+        : OPPrintInfo{other}, expressions{other.expressions} {}
+};
+
+class DeleteRel final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::DELETE_;
+
+public:
+    DeleteRel(std::vector<std::unique_ptr<RelDeleteExecutor>> executors,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          executors{std::move(executors)} {}
+
+    bool isParallel() const override { return false; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<DeleteRel>(copyVector(executors), children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    std::vector<std::unique_ptr<RelDeleteExecutor>> executors;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/delete_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/delete_executor.h
new file mode 100644
index 0000000000..4319c53f43
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/delete_executor.h
@@ -0,0 +1,220 @@
+#pragma once
+
+#include <memory>
+#include <utility>
+
+#include "common/enums/delete_type.h"
+#include "common/vector/value_vector.h"
+#include "processor/result/result_set.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct NodeDeleteInfo {
+    common::DeleteNodeType deleteType;
+    DataPos nodeIDPos;
+
+    common::ValueVector* nodeIDVector = nullptr;
+
+    NodeDeleteInfo(common::DeleteNodeType deleteType, const DataPos& nodeIDPos)
+        : deleteType{deleteType}, nodeIDPos{nodeIDPos} {};
+    EXPLICIT_COPY_DEFAULT_MOVE(NodeDeleteInfo);
+
+    void init(const ResultSet& resultSet);
+
+private:
+    NodeDeleteInfo(const NodeDeleteInfo& other)
+        : deleteType{other.deleteType}, nodeIDPos{other.nodeIDPos} {}
+};
+
+struct NodeTableDeleteInfo {
+    storage::NodeTable* table;
+    std::unordered_set<storage::RelTable*> fwdRelTables;
+    std::unordered_set<storage::RelTable*> bwdRelTables;
+    DataPos pkPos;
+
+    common::ValueVector* pkVector;
+
+    NodeTableDeleteInfo(storage::NodeTable* table,
+        std::unordered_set<storage::RelTable*> fwdRelTables,
+        std::unordered_set<storage::RelTable*> bwdRelTables, const DataPos& pkPos)
+        : table{table}, fwdRelTables{std::move(fwdRelTables)},
+          bwdRelTables{std::move(bwdRelTables)}, pkPos{pkPos}, pkVector{nullptr} {};
+    EXPLICIT_COPY_DEFAULT_MOVE(NodeTableDeleteInfo);
+
+    void init(const ResultSet& resultSet);
+
+    void deleteFromRelTable(transaction::Transaction* transaction,
+        common::ValueVector* nodeIDVector) const;
+    void detachDeleteFromRelTable(transaction::Transaction* transaction,
+        storage::RelTableDeleteState* detachDeleteState) const;
+
+private:
+    NodeTableDeleteInfo(const NodeTableDeleteInfo& other)
+        : table{other.table}, fwdRelTables{other.fwdRelTables}, bwdRelTables{other.bwdRelTables},
+          pkPos{other.pkPos}, pkVector{nullptr} {}
+};
+
+class NodeDeleteExecutor {
+public:
+    explicit NodeDeleteExecutor(NodeDeleteInfo info) : info{std::move(info)} {}
+    NodeDeleteExecutor(const NodeDeleteExecutor& other) : info{other.info.copy()} {}
+    virtual ~NodeDeleteExecutor() = default;
+
+    virtual void init(ResultSet* resultSet, ExecutionContext* context);
+
+    virtual void delete_(ExecutionContext* context) = 0;
+
+    virtual std::unique_ptr<NodeDeleteExecutor> copy() const = 0;
+
+protected:
+    NodeDeleteInfo info;
+    std::unique_ptr<common::ValueVector> dstNodeIDVector;
+    std::unique_ptr<common::ValueVector> relIDVector;
+    std::unique_ptr<storage::RelTableDeleteState> detachDeleteState;
+};
+
+// Handle MATCH (n) (DETACH)? DELETE n
+class EmptyNodeDeleteExecutor final : public NodeDeleteExecutor {
+public:
+    explicit EmptyNodeDeleteExecutor(NodeDeleteInfo info) : NodeDeleteExecutor{std::move(info)} {}
+    EmptyNodeDeleteExecutor(const EmptyNodeDeleteExecutor& other) : NodeDeleteExecutor{other} {}
+
+    void delete_(ExecutionContext*) override {}
+
+    std::unique_ptr<NodeDeleteExecutor> copy() const override {
+        return std::make_unique<EmptyNodeDeleteExecutor>(*this);
+    }
+};
+
+class SingleLabelNodeDeleteExecutor final : public NodeDeleteExecutor {
+public:
+    SingleLabelNodeDeleteExecutor(NodeDeleteInfo info, NodeTableDeleteInfo tableInfo)
+        : NodeDeleteExecutor(std::move(info)), tableInfo{std::move(tableInfo)} {}
+    SingleLabelNodeDeleteExecutor(const SingleLabelNodeDeleteExecutor& other)
+        : NodeDeleteExecutor(other), tableInfo{other.tableInfo.copy()} {}
+
+    void init(ResultSet* resultSet, ExecutionContext*) override;
+    void delete_(ExecutionContext* context) override;
+
+    std::unique_ptr<NodeDeleteExecutor> copy() const override {
+        return std::make_unique<SingleLabelNodeDeleteExecutor>(*this);
+    }
+
+private:
+    NodeTableDeleteInfo tableInfo;
+};
+
+class MultiLabelNodeDeleteExecutor final : public NodeDeleteExecutor {
+public:
+    MultiLabelNodeDeleteExecutor(NodeDeleteInfo info,
+        common::table_id_map_t<NodeTableDeleteInfo> tableInfos)
+        : NodeDeleteExecutor(std::move(info)), tableInfos{std::move(tableInfos)} {}
+    MultiLabelNodeDeleteExecutor(const MultiLabelNodeDeleteExecutor& other)
+        : NodeDeleteExecutor(other), tableInfos{copyUnorderedMap(other.tableInfos)} {}
+
+    void init(ResultSet* resultSet, ExecutionContext*) override;
+    void delete_(ExecutionContext* context) override;
+
+    std::unique_ptr<NodeDeleteExecutor> copy() const override {
+        return std::make_unique<MultiLabelNodeDeleteExecutor>(*this);
+    }
+
+private:
+    common::table_id_map_t<NodeTableDeleteInfo> tableInfos;
+};
+
+struct RelDeleteInfo {
+    DataPos srcNodeIDPos;
+    DataPos dstNodeIDPos;
+    DataPos relIDPos;
+
+    common::ValueVector* srcNodeIDVector = nullptr;
+    common::ValueVector* dstNodeIDVector = nullptr;
+    common::ValueVector* relIDVector = nullptr;
+
+    RelDeleteInfo()
+        : srcNodeIDPos{INVALID_DATA_CHUNK_POS, INVALID_VALUE_VECTOR_POS},
+          dstNodeIDPos{INVALID_DATA_CHUNK_POS, INVALID_VALUE_VECTOR_POS},
+          relIDPos{INVALID_DATA_CHUNK_POS, INVALID_VALUE_VECTOR_POS} {}
+    RelDeleteInfo(DataPos srcNodeIDPos, DataPos dstNodeIDPos, DataPos relIDPos)
+        : srcNodeIDPos{srcNodeIDPos}, dstNodeIDPos{dstNodeIDPos}, relIDPos{relIDPos} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(RelDeleteInfo);
+
+    void init(const ResultSet& resultSet);
+
+private:
+    RelDeleteInfo(const RelDeleteInfo& other)
+        : srcNodeIDPos{other.srcNodeIDPos}, dstNodeIDPos{other.dstNodeIDPos},
+          relIDPos{other.relIDPos} {}
+};
+
+class RelDeleteExecutor {
+public:
+    explicit RelDeleteExecutor(RelDeleteInfo info) : info{std::move(info)} {}
+    RelDeleteExecutor(const RelDeleteExecutor& other) : info{other.info.copy()} {}
+    virtual ~RelDeleteExecutor() = default;
+
+    virtual void init(ResultSet* resultSet, ExecutionContext* context);
+
+    virtual void delete_(ExecutionContext* context) = 0;
+
+    virtual std::unique_ptr<RelDeleteExecutor> copy() const = 0;
+
+protected:
+    RelDeleteInfo info;
+};
+
+class EmptyRelDeleteExecutor final : public RelDeleteExecutor {
+public:
+    explicit EmptyRelDeleteExecutor() : RelDeleteExecutor{RelDeleteInfo{}} {}
+    EmptyRelDeleteExecutor(const EmptyRelDeleteExecutor& other) : RelDeleteExecutor{other} {}
+
+    void init(ResultSet*, ExecutionContext*) override {}
+
+    void delete_(ExecutionContext*) override {}
+
+    std::unique_ptr<RelDeleteExecutor> copy() const override {
+        return std::make_unique<EmptyRelDeleteExecutor>(*this);
+    }
+};
+
+class SingleLabelRelDeleteExecutor final : public RelDeleteExecutor {
+public:
+    SingleLabelRelDeleteExecutor(storage::RelTable* table, RelDeleteInfo info)
+        : RelDeleteExecutor(std::move(info)), table{table} {}
+    SingleLabelRelDeleteExecutor(const SingleLabelRelDeleteExecutor& other)
+        : RelDeleteExecutor{other}, table{other.table} {}
+
+    void delete_(ExecutionContext* context) override;
+
+    std::unique_ptr<RelDeleteExecutor> copy() const override {
+        return std::make_unique<SingleLabelRelDeleteExecutor>(*this);
+    }
+
+private:
+    storage::RelTable* table;
+};
+
+class MultiLabelRelDeleteExecutor final : public RelDeleteExecutor {
+public:
+    MultiLabelRelDeleteExecutor(common::table_id_map_t<storage::RelTable*> tableIDToTableMap,
+        RelDeleteInfo info)
+        : RelDeleteExecutor(std::move(info)), tableIDToTableMap{std::move(tableIDToTableMap)} {}
+    MultiLabelRelDeleteExecutor(const MultiLabelRelDeleteExecutor& other)
+        : RelDeleteExecutor{other}, tableIDToTableMap{other.tableIDToTableMap} {}
+
+    void delete_(ExecutionContext* context) override;
+
+    std::unique_ptr<RelDeleteExecutor> copy() const override {
+        return std::make_unique<MultiLabelRelDeleteExecutor>(*this);
+    }
+
+private:
+    common::table_id_map_t<storage::RelTable*> tableIDToTableMap;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/index_builder.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/index_builder.h
new file mode 100644
index 0000000000..b1286dc5c0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/index_builder.h
@@ -0,0 +1,210 @@
+#pragma once
+
+#include <array>
+#include <variant>
+
+#include "common/copy_constructors.h"
+#include "common/mpsc_queue.h"
+#include "common/static_vector.h"
+#include "common/types/int128_t.h"
+#include "common/types/types.h"
+#include "common/types/uint128_t.h"
+#include "processor/operator/persistent/node_batch_insert_error_handler.h"
+#include "storage/index/hash_index.h"
+#include "storage/index/hash_index_utils.h"
+#include "storage/table/column_chunk_data.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+};
+namespace storage {
+class NodeTable;
+};
+namespace processor {
+
+constexpr size_t SHOULD_FLUSH_QUEUE_SIZE = 32;
+
+constexpr size_t WARNING_DATA_BUFFER_SIZE = 64;
+using OptionalWarningDataBuffer =
+    std::unique_ptr<common::StaticVector<WarningSourceData, WARNING_DATA_BUFFER_SIZE>>;
+
+using OptionalWarningSourceData = std::optional<WarningSourceData>;
+
+template<typename T>
+struct IndexBufferWithWarningData {
+    storage::IndexBuffer<T> indexBuffer;
+    OptionalWarningDataBuffer warningDataBuffer;
+
+    bool full() const;
+    void append(T key, common::offset_t value, OptionalWarningSourceData&& warningData);
+};
+
+class IndexBuilderGlobalQueues {
+public:
+    explicit IndexBuilderGlobalQueues(transaction::Transaction* transaction,
+        storage::NodeTable* nodeTable);
+
+    template<typename T>
+    void insert(size_t index, IndexBufferWithWarningData<T> elem,
+        NodeBatchInsertErrorHandler& errorHandler) {
+        auto& typedQueues = std::get<Queue<T>>(queues).array;
+        typedQueues[index].push(std::move(elem));
+        if (typedQueues[index].approxSize() < SHOULD_FLUSH_QUEUE_SIZE) {
+            return;
+        }
+        maybeConsumeIndex(index, errorHandler);
+    }
+
+    void consume(NodeBatchInsertErrorHandler& errorHandler);
+
+    common::PhysicalTypeID pkTypeID() const;
+
+private:
+    void maybeConsumeIndex(size_t index, NodeBatchInsertErrorHandler& errorHandler);
+
+    storage::NodeTable* nodeTable;
+
+    template<typename T>
+    // NOLINTNEXTLINE (cppcoreguidelines-pro-type-member-init)
+    struct Queue {
+        std::array<common::MPSCQueue<IndexBufferWithWarningData<T>>, storage::NUM_HASH_INDEXES>
+            array;
+        // Type information to help std::visit. Value is not used
+        T type;
+    };
+
+    // Queues for distributing primary keys.
+    std::variant<Queue<std::string>, Queue<int64_t>, Queue<int32_t>, Queue<int16_t>, Queue<int8_t>,
+        Queue<uint64_t>, Queue<uint32_t>, Queue<uint16_t>, Queue<uint8_t>, Queue<common::int128_t>,
+        Queue<common::uint128_t>, Queue<float>, Queue<double>>
+        queues;
+    transaction::Transaction* transaction;
+};
+
+class IndexBuilderLocalBuffers {
+public:
+    explicit IndexBuilderLocalBuffers(IndexBuilderGlobalQueues& globalQueues);
+
+    void insert(std::string key, common::offset_t value, OptionalWarningSourceData&& warningData,
+        NodeBatchInsertErrorHandler& errorHandler) {
+        auto indexPos = storage::HashIndexUtils::getHashIndexPosition(std::string_view(key));
+        auto& stringBuffer = (*std::get<UniqueBuffers<std::string>>(buffers))[indexPos];
+
+        if (stringBuffer.full()) {
+            // StaticVector's move constructor leaves the original vector valid and empty
+            globalQueues->insert(indexPos, std::move(stringBuffer), errorHandler);
+        }
+
+        // moving the buffer clears it which is the expected behaviour
+        // NOLINTNEXTLINE (bugprone-use-after-move)
+        stringBuffer.append(std::move(key), value, std::move(warningData));
+    }
+
+    template<common::HashablePrimitive T>
+    void insert(T key, common::offset_t value, OptionalWarningSourceData&& warningData,
+        NodeBatchInsertErrorHandler& errorHandler) {
+        auto indexPos = storage::HashIndexUtils::getHashIndexPosition(key);
+        auto& buffer = (*std::get<UniqueBuffers<T>>(buffers))[indexPos];
+
+        if (buffer.full()) {
+            globalQueues->insert(indexPos, std::move(buffer), errorHandler);
+        }
+
+        // moving the buffer clears it which is the expected behaviour
+        // NOLINTNEXTLINE (bugprone-use-after-move)
+        buffer.append(key, value, std::move(warningData));
+    }
+
+    void flush(NodeBatchInsertErrorHandler& errorHandler);
+
+private:
+    IndexBuilderGlobalQueues* globalQueues;
+
+    // These arrays are much too large to be inline.
+    template<typename T>
+    using Buffers = std::array<IndexBufferWithWarningData<T>, storage::NUM_HASH_INDEXES>;
+    template<typename T>
+    using UniqueBuffers = std::unique_ptr<Buffers<T>>;
+    std::variant<UniqueBuffers<std::string>, UniqueBuffers<int64_t>, UniqueBuffers<int32_t>,
+        UniqueBuffers<int16_t>, UniqueBuffers<int8_t>, UniqueBuffers<uint64_t>,
+        UniqueBuffers<uint32_t>, UniqueBuffers<uint16_t>, UniqueBuffers<uint8_t>,
+        UniqueBuffers<common::int128_t>, UniqueBuffers<common::uint128_t>, UniqueBuffers<float>,
+        UniqueBuffers<double>>
+        buffers;
+};
+
+class IndexBuilderSharedState {
+    friend class IndexBuilder;
+
+public:
+    explicit IndexBuilderSharedState(transaction::Transaction* transaction,
+        storage::NodeTable* nodeTable)
+        : globalQueues{transaction, nodeTable}, nodeTable(nodeTable) {}
+    void consume(NodeBatchInsertErrorHandler& errorHandler) {
+        return globalQueues.consume(errorHandler);
+    }
+
+    void addProducer() { producers.fetch_add(1, std::memory_order_relaxed); }
+    void quitProducer();
+    bool isDone() const { return done.load(std::memory_order_relaxed); }
+
+private:
+    IndexBuilderGlobalQueues globalQueues;
+    storage::NodeTable* nodeTable;
+
+    std::atomic<size_t> producers;
+    std::atomic<bool> done;
+};
+
+// RAII for producer counting.
+class ProducerToken {
+public:
+    explicit ProducerToken(std::shared_ptr<IndexBuilderSharedState> sharedState)
+        : sharedState(std::move(sharedState)) {
+        this->sharedState->addProducer();
+    }
+    DELETE_COPY_DEFAULT_MOVE(ProducerToken);
+
+    void quit() {
+        sharedState->quitProducer();
+        sharedState.reset();
+    }
+    ~ProducerToken() {
+        if (sharedState) {
+            quit();
+        }
+    }
+
+private:
+    std::shared_ptr<IndexBuilderSharedState> sharedState;
+};
+
+class IndexBuilder {
+
+public:
+    DELETE_COPY_DEFAULT_MOVE(IndexBuilder);
+    explicit IndexBuilder(std::shared_ptr<IndexBuilderSharedState> sharedState);
+
+    IndexBuilder clone() { return IndexBuilder(sharedState); }
+
+    void insert(const storage::ColumnChunkData& chunk,
+        const std::vector<storage::ColumnChunkData*>& warningData, common::offset_t nodeOffset,
+        common::offset_t numNodes, NodeBatchInsertErrorHandler& errorHandler);
+
+    ProducerToken getProducerToken() const { return ProducerToken(sharedState); }
+
+    void finishedProducing(NodeBatchInsertErrorHandler& errorHandler);
+    void finalize(ExecutionContext* context, NodeBatchInsertErrorHandler& errorHandler);
+
+private:
+    bool checkNonNullConstraint(const storage::ColumnChunkData& chunk,
+        const std::vector<storage::ColumnChunkData*>& warningData, common::offset_t nodeOffset,
+        common::offset_t chunkOffset, NodeBatchInsertErrorHandler& errorHandler);
+    std::shared_ptr<IndexBuilderSharedState> sharedState;
+
+    IndexBuilderLocalBuffers localBuffers;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/insert.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/insert.h
new file mode 100644
index 0000000000..475eac12bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/insert.h
@@ -0,0 +1,53 @@
+#pragma once
+
+#include "insert_executor.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct InsertPrintInfo final : OPPrintInfo {
+    binder::expression_vector expressions;
+    common::ConflictAction action;
+
+    InsertPrintInfo(binder::expression_vector expressions, common::ConflictAction action)
+        : expressions(std::move(expressions)), action(action) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<InsertPrintInfo>(new InsertPrintInfo(*this));
+    }
+
+private:
+    InsertPrintInfo(const InsertPrintInfo& other)
+        : OPPrintInfo(other), expressions(other.expressions), action(other.action) {}
+};
+
+class Insert final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::INSERT;
+
+public:
+    Insert(std::vector<NodeInsertExecutor> nodeExecutors,
+        std::vector<RelInsertExecutor> relExecutors, std::unique_ptr<PhysicalOperator> child,
+        uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          nodeExecutors{std::move(nodeExecutors)}, relExecutors{std::move(relExecutors)} {}
+
+    bool isParallel() const override { return false; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<Insert>(copyVector(nodeExecutors), copyVector(relExecutors),
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    std::vector<NodeInsertExecutor> nodeExecutors;
+    std::vector<RelInsertExecutor> relExecutors;
+};
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/insert_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/insert_executor.h
new file mode 100644
index 0000000000..3b351ba1a0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/insert_executor.h
@@ -0,0 +1,148 @@
+#pragma once
+
+#include "common/enums/conflict_action.h"
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/execution_context.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+
+namespace lbug {
+namespace processor {
+
+// Operator level info
+struct NodeInsertInfo {
+    DataPos nodeIDPos;
+    // Column vector pos is invalid if it doesn't need to be projected.
+    std::vector<DataPos> columnsPos;
+    common::ConflictAction conflictAction;
+
+    common::ValueVector* nodeIDVector = nullptr;
+    std::vector<common::ValueVector*> columnVectors;
+
+    NodeInsertInfo(DataPos nodeIDPos, std::vector<DataPos> columnsPos,
+        common::ConflictAction conflictAction)
+        : nodeIDPos{nodeIDPos}, columnsPos{std::move(columnsPos)}, conflictAction{conflictAction} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(NodeInsertInfo);
+
+    void init(const ResultSet& resultSet);
+
+    void updateNodeID(common::nodeID_t nodeID) const;
+    common::nodeID_t getNodeID() const;
+
+private:
+    NodeInsertInfo(const NodeInsertInfo& other)
+        : nodeIDPos{other.nodeIDPos}, columnsPos{other.columnsPos},
+          conflictAction{other.conflictAction} {}
+};
+
+// Table level info
+struct NodeTableInsertInfo {
+    storage::NodeTable* table;
+    evaluator::evaluator_vector_t columnDataEvaluators;
+
+    common::ValueVector* pkVector;
+    std::vector<common::ValueVector*> columnDataVectors;
+
+    NodeTableInsertInfo(storage::NodeTable* table,
+        evaluator::evaluator_vector_t columnDataEvaluators)
+        : table{table}, columnDataEvaluators{std::move(columnDataEvaluators)}, pkVector{nullptr} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(NodeTableInsertInfo);
+
+    void init(const ResultSet& resultSet, main::ClientContext* context);
+
+private:
+    NodeTableInsertInfo(const NodeTableInsertInfo& other)
+        : table{other.table}, columnDataEvaluators{copyVector(other.columnDataEvaluators)},
+          pkVector{nullptr} {}
+};
+
+class NodeInsertExecutor {
+public:
+    NodeInsertExecutor(NodeInsertInfo info, NodeTableInsertInfo tableInfo)
+        : info{std::move(info)}, tableInfo{std::move(tableInfo)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(NodeInsertExecutor);
+
+    void init(ResultSet* resultSet, const ExecutionContext* context);
+
+    void setNodeIDVectorToNonNull() const;
+    common::nodeID_t insert(main::ClientContext* context);
+
+    // For MERGE, we might need to skip the insert for duplicate input. But still, we need to write
+    // the output vector for later usage.
+    void skipInsert() const;
+
+private:
+    NodeInsertExecutor(const NodeInsertExecutor& other)
+        : info{other.info.copy()}, tableInfo{other.tableInfo.copy()} {}
+
+    bool checkConflict(const transaction::Transaction* transaction) const;
+
+private:
+    NodeInsertInfo info;
+    NodeTableInsertInfo tableInfo;
+};
+
+struct RelInsertInfo {
+    DataPos srcNodeIDPos;
+    DataPos dstNodeIDPos;
+    std::vector<DataPos> columnsPos;
+
+    common::ValueVector* srcNodeIDVector;
+    common::ValueVector* dstNodeIDVector;
+    std::vector<common::ValueVector*> columnVectors;
+
+    RelInsertInfo(DataPos srcNodeIDPos, DataPos dstNodeIDPos, std::vector<DataPos> columnsPos)
+        : srcNodeIDPos{srcNodeIDPos}, dstNodeIDPos{dstNodeIDPos}, columnsPos{std::move(columnsPos)},
+          srcNodeIDVector{nullptr}, dstNodeIDVector{nullptr} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(RelInsertInfo);
+
+    void init(const ResultSet& resultSet);
+
+private:
+    RelInsertInfo(const RelInsertInfo& other)
+        : srcNodeIDPos{other.srcNodeIDPos}, dstNodeIDPos{other.dstNodeIDPos},
+          columnsPos{other.columnsPos}, srcNodeIDVector{nullptr}, dstNodeIDVector{nullptr} {}
+};
+
+struct RelTableInsertInfo {
+    storage::RelTable* table;
+    evaluator::evaluator_vector_t columnDataEvaluators;
+
+    std::vector<common::ValueVector*> columnDataVectors;
+
+    RelTableInsertInfo(storage::RelTable* table, evaluator::evaluator_vector_t evaluators)
+        : table{table}, columnDataEvaluators{std::move(evaluators)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(RelTableInsertInfo);
+
+    void init(const ResultSet& resultSet, main::ClientContext* context);
+    common::internalID_t getRelID() const;
+
+private:
+    RelTableInsertInfo(const RelTableInsertInfo& other)
+        : table{other.table}, columnDataEvaluators(copyVector(other.columnDataEvaluators)) {}
+};
+
+class RelInsertExecutor {
+public:
+    RelInsertExecutor(RelInsertInfo info, RelTableInsertInfo tableInfo)
+        : info{std::move(info)}, tableInfo{std::move(tableInfo)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(RelInsertExecutor);
+
+    void init(ResultSet* resultSet, const ExecutionContext* context);
+
+    common::internalID_t insert(main::ClientContext* context);
+
+    // See comment in NodeInsertExecutor.
+    void skipInsert() const;
+
+private:
+    RelInsertExecutor(const RelInsertExecutor& other)
+        : info{other.info.copy()}, tableInfo{other.tableInfo.copy()} {}
+
+private:
+    RelInsertInfo info;
+    RelTableInsertInfo tableInfo;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/merge.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/merge.h
new file mode 100644
index 0000000000..7ff8d5d2fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/merge.h
@@ -0,0 +1,123 @@
+#pragma once
+
+#include "insert_executor.h"
+#include "processor/operator/physical_operator.h"
+#include "processor/result/pattern_creation_info_table.h"
+#include "set_executor.h"
+
+namespace lbug {
+namespace processor {
+
+struct MergeInfo {
+    std::vector<std::unique_ptr<evaluator::ExpressionEvaluator>> keyEvaluators;
+    FactorizedTableSchema tableSchema;
+    common::executor_info executorInfo;
+    DataPos existenceMark;
+
+    MergeInfo(std::vector<std::unique_ptr<evaluator::ExpressionEvaluator>> keyEvaluators,
+        FactorizedTableSchema tableSchema, common::executor_info executorInfo,
+        DataPos existenceMark)
+        : keyEvaluators{std::move(keyEvaluators)}, tableSchema{std::move(tableSchema)},
+          executorInfo{std::move(executorInfo)}, existenceMark{existenceMark} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(MergeInfo);
+
+private:
+    MergeInfo(const MergeInfo& other)
+        : keyEvaluators{copyVector(other.keyEvaluators)}, tableSchema{other.tableSchema.copy()},
+          executorInfo{other.executorInfo}, existenceMark{other.existenceMark} {}
+};
+
+struct MergePrintInfo final : OPPrintInfo {
+    binder::expression_vector pattern;
+    std::vector<binder::expression_pair> onCreate;
+    std::vector<binder::expression_pair> onMatch;
+
+    MergePrintInfo(binder::expression_vector pattern, std::vector<binder::expression_pair> onCreate,
+        std::vector<binder::expression_pair> onMatch)
+        : pattern(std::move(pattern)), onCreate(std::move(onCreate)), onMatch(std::move(onMatch)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<MergePrintInfo>(new MergePrintInfo(*this));
+    }
+
+private:
+    MergePrintInfo(const MergePrintInfo& other)
+        : OPPrintInfo(other), pattern(other.pattern), onCreate(other.onCreate),
+          onMatch(other.onMatch) {}
+};
+
+struct MergeLocalState {
+    std::vector<common::ValueVector*> keyVectors;
+    std::unique_ptr<PatternCreationInfoTable> hashTable;
+    common::ValueVector* existenceVector = nullptr;
+
+    void init(ResultSet& resultSet, main::ClientContext* context, MergeInfo& info);
+
+    bool patternExists() const;
+
+    PatternCreationInfo getPatternCreationInfo() const {
+        return hashTable->getPatternCreationInfo(keyVectors);
+    }
+};
+
+class Merge final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::MERGE;
+
+public:
+    Merge(std::vector<NodeInsertExecutor> nodeInsertExecutors,
+        std::vector<RelInsertExecutor> relInsertExecutors,
+        std::vector<std::unique_ptr<NodeSetExecutor>> onCreateNodeSetExecutors,
+        std::vector<std::unique_ptr<RelSetExecutor>> onCreateRelSetExecutors,
+        std::vector<std::unique_ptr<NodeSetExecutor>> onMatchNodeSetExecutors,
+        std::vector<std::unique_ptr<RelSetExecutor>> onMatchRelSetExecutors, MergeInfo info,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          nodeInsertExecutors{std::move(nodeInsertExecutors)},
+          relInsertExecutors{std::move(relInsertExecutors)},
+          onCreateNodeSetExecutors{std::move(onCreateNodeSetExecutors)},
+          onCreateRelSetExecutors{std::move(onCreateRelSetExecutors)},
+          onMatchNodeSetExecutors{std::move(onMatchNodeSetExecutors)},
+          onMatchRelSetExecutors{std::move(onMatchRelSetExecutors)}, info{std::move(info)} {}
+
+    bool isParallel() const override { return false; }
+
+    void initLocalStateInternal(ResultSet* resultSet_, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<Merge>(copyVector(nodeInsertExecutors),
+            copyVector(relInsertExecutors), copyVector(onCreateNodeSetExecutors),
+            copyVector(onCreateRelSetExecutors), copyVector(onMatchNodeSetExecutors),
+            copyVector(onMatchRelSetExecutors), info.copy(), children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    void executeOnMatch(ExecutionContext* context);
+
+    void executeOnCreatedPattern(PatternCreationInfo& info, ExecutionContext* context);
+
+    void executeOnNewPattern(PatternCreationInfo& info, ExecutionContext* context);
+
+    void executeNoMatch(ExecutionContext* context);
+
+private:
+    std::vector<NodeInsertExecutor> nodeInsertExecutors;
+    std::vector<RelInsertExecutor> relInsertExecutors;
+
+    std::vector<std::unique_ptr<NodeSetExecutor>> onCreateNodeSetExecutors;
+    std::vector<std::unique_ptr<RelSetExecutor>> onCreateRelSetExecutors;
+
+    std::vector<std::unique_ptr<NodeSetExecutor>> onMatchNodeSetExecutors;
+    std::vector<std::unique_ptr<RelSetExecutor>> onMatchRelSetExecutors;
+
+    MergeInfo info;
+    MergeLocalState localState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/node_batch_insert.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/node_batch_insert.h
new file mode 100644
index 0000000000..45ad93c37c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/node_batch_insert.h
@@ -0,0 +1,144 @@
+#pragma once
+
+#include "common/enums/column_evaluate_type.h"
+#include "common/types/types.h"
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/operator/persistent/batch_insert.h"
+#include "processor/operator/persistent/index_builder.h"
+#include "storage/stats/table_stats.h"
+#include "storage/table/chunked_node_group.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+}
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace processor {
+struct ExecutionContext;
+
+struct NodeBatchInsertPrintInfo final : OPPrintInfo {
+    std::string tableName;
+
+    explicit NodeBatchInsertPrintInfo(std::string tableName) : tableName(std::move(tableName)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<NodeBatchInsertPrintInfo>(new NodeBatchInsertPrintInfo(*this));
+    }
+
+private:
+    NodeBatchInsertPrintInfo(const NodeBatchInsertPrintInfo& other)
+        : OPPrintInfo(other), tableName(other.tableName) {}
+};
+
+struct NodeBatchInsertInfo final : BatchInsertInfo {
+    evaluator::evaluator_vector_t columnEvaluators;
+    std::vector<common::ColumnEvaluateType> evaluateTypes;
+
+    NodeBatchInsertInfo(std::string tableName, std::vector<common::LogicalType> warningColumnTypes,
+        std::vector<std::unique_ptr<evaluator::ExpressionEvaluator>> columnEvaluators,
+        std::vector<common::ColumnEvaluateType> evaluateTypes)
+        : BatchInsertInfo{std::move(tableName), std::move(warningColumnTypes)},
+          columnEvaluators{std::move(columnEvaluators)}, evaluateTypes{std::move(evaluateTypes)} {}
+
+    NodeBatchInsertInfo(const NodeBatchInsertInfo& other)
+        : BatchInsertInfo{other}, columnEvaluators{copyVector(other.columnEvaluators)},
+          evaluateTypes{other.evaluateTypes} {}
+
+    std::unique_ptr<BatchInsertInfo> copy() const override {
+        return std::make_unique<NodeBatchInsertInfo>(*this);
+    }
+};
+
+struct NodeBatchInsertSharedState final : BatchInsertSharedState {
+    // Primary key info
+    common::column_id_t pkColumnID;
+    common::LogicalType pkType;
+    std::optional<IndexBuilder> globalIndexBuilder;
+
+    function::TableFuncSharedState* tableFuncSharedState;
+
+    std::vector<common::column_id_t> mainDataColumns;
+
+    // The sharedNodeGroup is to accumulate left data within local node groups in NodeBatchInsert
+    // ops.
+    std::unique_ptr<storage::InMemChunkedNodeGroup> sharedNodeGroup;
+
+    explicit NodeBatchInsertSharedState(std::shared_ptr<FactorizedTable> fTable)
+        : BatchInsertSharedState{std::move(fTable)}, pkColumnID{0},
+          globalIndexBuilder(std::nullopt), tableFuncSharedState{nullptr},
+          sharedNodeGroup{nullptr} {}
+
+    void initPKIndex(const ExecutionContext* context);
+};
+
+struct NodeBatchInsertLocalState final : BatchInsertLocalState {
+    std::optional<NodeBatchInsertErrorHandler> errorHandler;
+
+    std::optional<IndexBuilder> localIndexBuilder;
+
+    std::shared_ptr<common::DataChunkState> columnState;
+    std::vector<common::ValueVector*> columnVectors;
+
+    storage::TableStats stats;
+
+    explicit NodeBatchInsertLocalState(std::span<common::LogicalType> outputDataTypes)
+        : stats{outputDataTypes} {}
+};
+
+class NodeBatchInsert final : public BatchInsert {
+public:
+    NodeBatchInsert(std::unique_ptr<BatchInsertInfo> info,
+        std::shared_ptr<BatchInsertSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : BatchInsert{std::move(info), std::move(sharedState), id, std::move(printInfo)} {
+        children.push_back(std::move(child));
+    }
+
+    void initGlobalStateInternal(ExecutionContext* context) override;
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void executeInternal(ExecutionContext* context) override;
+
+    void finalize(ExecutionContext* context) override;
+    void finalizeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<NodeBatchInsert>(info->copy(), sharedState, children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+    // The node group will be reset so that the only values remaining are the ones which were
+    // not written
+    void writeAndResetNodeGroup(transaction::Transaction* transaction,
+        std::unique_ptr<storage::InMemChunkedNodeGroup>& nodeGroup,
+        std::optional<IndexBuilder>& indexBuilder, storage::MemoryManager* mm,
+        storage::PageAllocator& pageAllocator) const;
+
+private:
+    void evaluateExpressions(uint64_t numTuples) const;
+    void appendIncompleteNodeGroup(transaction::Transaction* transaction,
+        std::unique_ptr<storage::InMemChunkedNodeGroup> localNodeGroup,
+        std::optional<IndexBuilder>& indexBuilder, storage::MemoryManager* mm) const;
+    void clearToIndex(storage::MemoryManager* mm,
+        std::unique_ptr<storage::InMemChunkedNodeGroup>& nodeGroup,
+        common::offset_t startIndexInGroup) const;
+
+    void copyToNodeGroup(transaction::Transaction* transaction, storage::MemoryManager* mm) const;
+
+    NodeBatchInsertErrorHandler createErrorHandler(ExecutionContext* context) const;
+
+    void writeAndResetNodeGroup(transaction::Transaction* transaction,
+        std::unique_ptr<storage::InMemChunkedNodeGroup>& nodeGroup,
+        std::optional<IndexBuilder>& indexBuilder, storage::MemoryManager* mm,
+        NodeBatchInsertErrorHandler& errorHandler, storage::PageAllocator& pageAllocator) const;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/node_batch_insert_error_handler.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/node_batch_insert_error_handler.h
new file mode 100644
index 0000000000..d54a411e3b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/node_batch_insert_error_handler.h
@@ -0,0 +1,61 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "processor/execution_context.h"
+#include "processor/operator/persistent/batch_insert_error_handler.h"
+
+namespace lbug {
+namespace storage {
+class NodeTable;
+}
+
+namespace processor {
+template<typename T>
+struct IndexBuilderError {
+    std::string message;
+    T key;
+    common::nodeID_t nodeID;
+
+    // CSV Reader data
+    std::optional<WarningSourceData> warningData;
+};
+
+class NodeBatchInsertErrorHandler {
+public:
+    NodeBatchInsertErrorHandler(ExecutionContext* context, common::LogicalTypeID pkType,
+        storage::NodeTable* nodeTable, bool ignoreErrors,
+        std::shared_ptr<common::row_idx_t> sharedErrorCounter, std::mutex* sharedErrorCounterMtx);
+
+    template<typename T>
+    void handleError(IndexBuilderError<T> error) {
+        baseErrorHandler.handleError(std::move(error.message), std::move(error.warningData));
+
+        setCurrentErroneousRow(error.key, error.nodeID);
+        deleteCurrentErroneousRow();
+    }
+
+    void flushStoredErrors();
+
+private:
+    template<typename T>
+    void setCurrentErroneousRow(const T& key, common::nodeID_t nodeID) {
+        keyVector->setValue<T>(0, key);
+        offsetVector->setValue(0, nodeID);
+    }
+
+    void deleteCurrentErroneousRow();
+
+    static constexpr common::idx_t DELETE_VECTOR_SIZE = 1;
+
+    storage::NodeTable* nodeTable;
+    ExecutionContext* context;
+
+    // vectors that are reused by each deletion
+    std::shared_ptr<common::ValueVector> keyVector;
+    std::shared_ptr<common::ValueVector> offsetVector;
+
+    BatchInsertErrorHandler baseErrorHandler;
+};
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/copy_from_error.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/copy_from_error.h
new file mode 100644
index 0000000000..0ea3a51369
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/copy_from_error.h
@@ -0,0 +1,115 @@
+#pragma once
+
+#include <string>
+#include <variant>
+#include <vector>
+
+#include "common/api.h"
+#include "common/constants.h"
+#include "common/type_utils.h"
+#include "common/types/types.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace common {
+class ValueVector;
+}
+namespace storage {
+class ColumnChunkData;
+}
+
+namespace processor {
+
+template<typename T>
+concept DataSource =
+    std::same_as<storage::ColumnChunkData, T> || std::same_as<common::ValueVector, T>;
+
+struct LBUG_API WarningSourceData {
+    // we should stick to integral types here as each value essentially adds a column to the output
+    // when reading from a file
+    using DataType = std::variant<uint64_t, uint32_t>;
+
+    static constexpr size_t BLOCK_IDX_IDX = 0;
+    static constexpr size_t OFFSET_IN_BLOCK_IDX = 1;
+    static constexpr size_t NUM_BLOCK_VALUES = 2;
+
+    WarningSourceData() : WarningSourceData(0) {}
+    explicit WarningSourceData(uint64_t numSourceSpecificValues);
+
+    template<std::integral... Types>
+    void dumpTo(uint64_t& blockIdx, uint32_t& offsetInBlock, Types&... vars) const;
+
+    template<std::integral... Types>
+    static WarningSourceData constructFrom(uint64_t blockIdx, uint32_t offsetInBlock,
+        Types... newValues);
+
+    uint64_t getBlockIdx() const;
+    uint32_t getOffsetInBlock() const;
+
+    template<DataSource T>
+    static WarningSourceData constructFromData(const std::vector<T*>& chunks, common::idx_t pos);
+
+    std::array<DataType, common::CopyConstants::MAX_NUM_WARNING_DATA_COLUMNS> values;
+    uint64_t numValues;
+};
+
+struct LineContext {
+    uint64_t startByteOffset;
+    uint64_t endByteOffset;
+
+    bool isCompleteLine;
+
+    void setNewLine(uint64_t start);
+    void setEndOfLine(uint64_t end);
+};
+
+// If parsing in parallel during parsing we may not be able to determine line numbers
+// Thus we have additional fields that can be used to determine line numbers + reconstruct lines
+// After parsing this will be used to populate a PopulatedCopyFromError instance
+struct LBUG_API CopyFromFileError {
+    CopyFromFileError(std::string message, WarningSourceData warningData, bool completedLine = true,
+        bool mustThrow = false);
+
+    std::string message;
+    bool completedLine;
+    WarningSourceData warningData;
+
+    bool mustThrow;
+
+    bool operator<(const CopyFromFileError& o) const;
+};
+
+struct PopulatedCopyFromError {
+    std::string message;
+    std::string filePath;
+    std::string skippedLineOrRecord;
+    uint64_t lineNumber;
+};
+
+template<std::integral... Types>
+void WarningSourceData::dumpTo(uint64_t& blockIdx, uint32_t& offsetInBlock, Types&... vars) const {
+    static_assert(sizeof...(Types) + NUM_BLOCK_VALUES <= std::tuple_size_v<decltype(values)>);
+    KU_ASSERT(sizeof...(Types) + NUM_BLOCK_VALUES == numValues);
+    common::TypeUtils::paramPackForEach(
+        [this](auto idx, auto& value) {
+            value = std::get<std::decay_t<decltype(value)>>(values[idx]);
+        },
+        blockIdx, offsetInBlock, vars...);
+}
+
+template<std::integral... Types>
+WarningSourceData WarningSourceData::constructFrom(uint64_t blockIdx, uint32_t offsetInBlock,
+    Types... newValues) {
+    static_assert(sizeof...(Types) + NUM_BLOCK_VALUES <= std::tuple_size_v<decltype(values)>,
+        "For performance reasons the number of warning metadata columns has a "
+        "statically-defined limit, modify "
+        "'common::CopyConstants::WARNING_DATA_MAX_NUM_COLUMNS' if you wish to increase it.");
+
+    WarningSourceData ret{sizeof...(Types) + NUM_BLOCK_VALUES};
+    common::TypeUtils::paramPackForEach([&ret](auto idx, auto value) { ret.values[idx] = value; },
+        blockIdx, offsetInBlock, newValues...);
+    return ret;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/base_csv_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/base_csv_reader.h
new file mode 100644
index 0000000000..57e63753c5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/base_csv_reader.h
@@ -0,0 +1,154 @@
+#pragma once
+
+#include <atomic>
+#include <cstdint>
+#include <string>
+#include <string_view>
+
+#include "common/copier_config/csv_reader_config.h"
+#include "common/data_chunk/data_chunk.h"
+#include "common/file_system/file_info.h"
+#include "common/types/types.h"
+#include "processor/operator/persistent/reader/copy_from_error.h"
+
+namespace lbug {
+namespace common {
+struct FileScanInfo;
+}
+namespace main {
+class ClientContext;
+}
+
+namespace processor {
+class LocalFileErrorHandler;
+class SharedFileErrorHandler;
+
+struct CSVColumnInfo {
+    uint64_t numColumns;
+    std::vector<bool> columnSkips;
+    common::column_id_t numWarningDataColumns;
+
+    CSVColumnInfo(uint64_t numColumns, std::vector<bool> columnSkips,
+        common::column_id_t numWarningDataColumns)
+        : numColumns{numColumns}, columnSkips{std::move(columnSkips)},
+          numWarningDataColumns(numWarningDataColumns) {}
+    EXPLICIT_COPY_DEFAULT_MOVE(CSVColumnInfo);
+
+private:
+    CSVColumnInfo(const CSVColumnInfo& other)
+        : numColumns{other.numColumns}, columnSkips{other.columnSkips},
+          numWarningDataColumns(other.numWarningDataColumns) {}
+};
+
+class BaseCSVReader {
+    friend class ParsingDriver;
+    friend class SniffCSVNameAndTypeDriver;
+
+public:
+    // 1st element is number of successfully parsed rows
+    // 2nd element is number of failed to parse rows
+    using parse_result_t = std::pair<uint64_t, uint64_t>;
+
+    BaseCSVReader(const std::string& filePath, common::idx_t fileIdx, common::CSVOption option,
+        CSVColumnInfo columnInfo, main::ClientContext* context,
+        LocalFileErrorHandler* errorHandler);
+
+    virtual ~BaseCSVReader() = default;
+
+    virtual uint64_t parseBlock(common::block_idx_t blockIdx, common::DataChunk& resultChunk) = 0;
+
+    main::ClientContext* getClientContext() const { return context; }
+    const common::CSVOption& getCSVOption() const { return option; }
+
+    uint64_t getNumColumns() const { return columnInfo.numColumns; }
+    bool skipColumn(common::idx_t idx) const {
+        KU_ASSERT(idx < columnInfo.columnSkips.size());
+        return columnInfo.columnSkips[idx];
+    }
+    bool isEOF() const;
+    uint64_t getFileSize();
+    // Get the file offset of the current buffer position.
+    uint64_t getFileOffset() const;
+
+    std::string reconstructLine(uint64_t startPosition, uint64_t endPosition, bool completedLine);
+
+    static common::column_id_t appendWarningDataColumns(std::vector<std::string>& resultColumnNames,
+        std::vector<common::LogicalType>& resultColumnTypes,
+        const common::FileScanInfo& fileScanInfo);
+
+    static PopulatedCopyFromError basePopulateErrorFunc(CopyFromFileError error,
+        const SharedFileErrorHandler* sharedErrorHandler, BaseCSVReader* reader,
+        std::string filePath);
+
+    static common::idx_t getFileIdxFunc(const CopyFromFileError& error);
+
+protected:
+    template<typename Driver>
+    bool addValue(Driver&, uint64_t rowNum, common::column_id_t columnIdx, std::string_view strVal,
+        std::vector<uint64_t>& escapePositions);
+
+    //! Read BOM and header.
+    parse_result_t handleFirstBlock();
+
+    //! If this finds a BOM, it advances `position`.
+    void readBOM();
+    parse_result_t readHeader();
+    //! Reads a new buffer from the CSV file.
+    //! Uses the start value to ensure the current value stays within the buffer.
+    //! Modifies the start value to point to the new start of the current value.
+    //! If start is NULL, none of the buffer is kept.
+    //! Returns false if the file has been exhausted.
+    bool readBuffer(uint64_t* start);
+
+    //! Like ReadBuffer, but only reads if position >= bufferSize.
+    //! If this returns true, buffer[position] is a valid character that we can read.
+    inline bool maybeReadBuffer(uint64_t* start) {
+        return position < bufferSize || readBuffer(start);
+    }
+
+    void handleCopyException(const std::string& message, bool mustThrow = false);
+
+    template<typename Driver>
+    parse_result_t parseCSV(Driver&);
+
+    inline bool isNewLine(char c) { return c == '\n' || c == '\r'; }
+
+protected:
+    virtual bool handleQuotedNewline() = 0;
+
+    void skipCurrentLine();
+
+    void resetNumRowsInCurrentBlock();
+    void increaseNumRowsInCurrentBlock(uint64_t numRows, uint64_t numErrors);
+    uint64_t getNumRowsInCurrentBlock() const;
+    uint32_t getRowOffsetInCurrentBlock() const;
+
+    WarningSourceData getWarningSourceData() const;
+
+protected:
+    main::ClientContext* context;
+    common::CSVOption option;
+    CSVColumnInfo columnInfo;
+    std::unique_ptr<common::FileInfo> fileInfo;
+
+    common::block_idx_t currentBlockIdx;
+    uint64_t numRowsInCurrentBlock;
+
+    uint64_t curRowIdx;
+    uint64_t numErrors;
+
+    std::unique_ptr<char[]> buffer;
+    uint64_t bufferIdx;
+    std::atomic<uint64_t> bufferSize;
+    std::atomic<uint64_t> position;
+    LineContext lineContext;
+    std::atomic<uint64_t> osFileOffset;
+    common::idx_t fileIdx;
+
+    LocalFileErrorHandler* errorHandler;
+
+    bool rowEmpty = false;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/dialect_detection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/dialect_detection.h
new file mode 100644
index 0000000000..bf325b5c97
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/dialect_detection.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include <vector>
+
+#include "common/copier_config/csv_reader_config.h"
+
+namespace lbug {
+namespace processor {
+
+struct DialectOption {
+    char delimiter = ',';
+    char quoteChar = '"';
+    char escapeChar = '"';
+    bool everQuoted = false;
+    bool everEscaped = false;
+    bool doDialectDetection = true;
+
+    DialectOption() = default;
+    DialectOption(char delim, char quote, char escape)
+        : delimiter(delim), quoteChar(quote), escapeChar(escape), everQuoted(false),
+          everEscaped(false), doDialectDetection(true) {}
+};
+
+std::vector<DialectOption> generateDialectOptions(const common::CSVOption& option);
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/driver.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/driver.h
new file mode 100644
index 0000000000..133eb02afb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/driver.h
@@ -0,0 +1,157 @@
+#pragma once
+
+#include <cstdint>
+#include <optional>
+
+#include "common/data_chunk/data_chunk.h"
+#include "function/table/bind_input.h"
+#include "processor/operator/persistent/reader/copy_from_error.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+
+namespace processor {
+
+// TODO(Keenan): Split up this file.
+class BaseCSVReader;
+
+// Driver type identifications.
+enum class DriverType {
+    PARSING,
+    PARALLEL,
+    SERIAL,
+    SNIFF_CSV_DIALECT,
+    SNIFF_CSV_NAME_AND_TYPE,
+    SNIFF_CSV_HEADER,
+    HEADER,
+    SKIP_ROW
+};
+
+struct WarningDataWithColumnInfo {
+    WarningDataWithColumnInfo(const WarningSourceData& warningSourceData,
+        uint64_t warningDataStartColumnIdx)
+        : warningDataStartColumnIdx(warningDataStartColumnIdx), data(warningSourceData) {}
+
+    uint64_t warningDataStartColumnIdx;
+    WarningSourceData data;
+};
+
+class ParsingDriver {
+public:
+    explicit ParsingDriver(common::DataChunk& chunk, DriverType type = DriverType::PARSING);
+    virtual ~ParsingDriver() = default;
+
+    bool done(uint64_t rowNum);
+    virtual bool addValue(uint64_t rowNum, common::column_id_t columnIdx, std::string_view value);
+    virtual bool addRow(uint64_t rowNum, common::column_id_t columnCount,
+        std::optional<WarningDataWithColumnInfo> warningData);
+
+public:
+    const DriverType driverType;
+
+private:
+    virtual bool doneEarly() = 0;
+    virtual BaseCSVReader* getReader() = 0;
+
+private:
+    common::DataChunk& chunk;
+
+protected:
+    bool rowEmpty;
+};
+
+class ParallelCSVReader;
+
+class ParallelParsingDriver : public ParsingDriver {
+public:
+    ParallelParsingDriver(common::DataChunk& chunk, ParallelCSVReader* reader);
+    bool doneEarly() override;
+
+private:
+    BaseCSVReader* getReader() override;
+
+private:
+    ParallelCSVReader* reader;
+};
+
+class SerialCSVReader;
+
+class SerialParsingDriver : public ParsingDriver {
+public:
+    SerialParsingDriver(common::DataChunk& chunk, SerialCSVReader* reader,
+        DriverType type = DriverType::SERIAL);
+    bool doneEarly() override;
+
+private:
+    BaseCSVReader* getReader() override;
+
+protected:
+    SerialCSVReader* reader;
+};
+
+class SniffCSVDialectDriver : public SerialParsingDriver {
+public:
+    explicit SniffCSVDialectDriver(SerialCSVReader* reader);
+
+    bool done(uint64_t rowNum) const;
+    bool addValue(uint64_t rowNum, common::column_id_t columnIdx, std::string_view value) override;
+    bool addRow(uint64_t rowNum, common::column_id_t columnCount,
+        std::optional<WarningDataWithColumnInfo> warningData) override;
+    void reset();
+
+    void setEverQuoted() { everQuoted = true; }
+    void setEverEscaped() { everEscaped = true; }
+    void setError() { error = true; }
+
+    bool getEverQuoted() const { return everQuoted; }
+    bool getEverEscaped() const { return everEscaped; }
+    bool getError() const { return error; }
+    common::idx_t getResultPosition() const { return resultPosition; }
+    common::idx_t getColumnCount(common::idx_t index) const { return columnCounts[index]; }
+
+private:
+    std::vector<common::idx_t> columnCounts;
+    common::idx_t currentColumnCount = 0;
+    bool error = false;
+    common::idx_t resultPosition = 0;
+    bool everQuoted = false;
+    bool everEscaped = false;
+};
+
+class SniffCSVNameAndTypeDriver : public SerialParsingDriver {
+public:
+    SniffCSVNameAndTypeDriver(SerialCSVReader* reader,
+        const function::ExtraScanTableFuncBindInput* bindInput);
+
+    bool done(uint64_t rowNum);
+    bool addValue(uint64_t rowNum, common::column_id_t columnIdx, std::string_view value) override;
+
+public:
+    std::vector<std::string> firstRow;
+    std::vector<std::pair<std::string, common::LogicalType>> columns;
+    std::vector<bool> sniffType;
+    // if the type isn't declared in the header, sniff it
+};
+
+class SniffCSVHeaderDriver : public SerialParsingDriver {
+public:
+    SniffCSVHeaderDriver(SerialCSVReader* reader,
+        const std::vector<std::pair<std::string, common::LogicalType>>& TypeDetected);
+
+    bool done(uint64_t rowNum) const {
+        // Only read the first line.
+        return (0 < rowNum);
+    };
+
+    bool addValue(uint64_t rowNum, common::column_id_t columnIdx, std::string_view value) override;
+
+public:
+    std::vector<std::pair<std::string, common::LogicalType>> columns;
+    std::vector<std::pair<std::string, common::LogicalType>> header;
+    bool detectedHeader = false;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/parallel_csv_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/parallel_csv_reader.h
new file mode 100644
index 0000000000..0fceb09ab4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/parallel_csv_reader.h
@@ -0,0 +1,64 @@
+#pragma once
+
+#include "base_csv_reader.h"
+#include "common/types/types.h"
+#include "function/function.h"
+#include "function/table/bind_input.h"
+#include "function/table/scan_file_function.h"
+#include "function/table/table_function.h"
+#include "processor/operator/persistent/reader/file_error_handler.h"
+
+namespace lbug {
+namespace processor {
+
+//! ParallelCSVReader is a class that reads values from a stream in parallel.
+class ParallelCSVReader final : public BaseCSVReader {
+    friend class ParallelParsingDriver;
+
+public:
+    ParallelCSVReader(const std::string& filePath, common::idx_t fileIdx, common::CSVOption option,
+        CSVColumnInfo columnInfo, main::ClientContext* context,
+        LocalFileErrorHandler* errorHandler);
+
+    bool hasMoreToRead() const;
+    uint64_t parseBlock(common::block_idx_t blockIdx, common::DataChunk& resultChunk) override;
+    uint64_t continueBlock(common::DataChunk& resultChunk);
+
+    void reportFinishedBlock();
+
+protected:
+    bool handleQuotedNewline() override;
+
+private:
+    bool finishedBlock() const;
+    void seekToBlockStart();
+};
+
+struct ParallelCSVLocalState final : public function::TableFuncLocalState {
+    std::unique_ptr<ParallelCSVReader> reader;
+    std::unique_ptr<LocalFileErrorHandler> errorHandler;
+    common::idx_t fileIdx = common::INVALID_IDX;
+};
+
+struct ParallelCSVScanSharedState final : public function::ScanFileWithProgressSharedState {
+    common::CSVOption csvOption;
+    CSVColumnInfo columnInfo;
+    std::atomic<uint64_t> numBlocksReadByFiles = 0;
+    std::vector<SharedFileErrorHandler> errorHandlers;
+    populate_func_t populateErrorFunc;
+
+    ParallelCSVScanSharedState(common::FileScanInfo fileScanInfo, uint64_t numRows,
+        main::ClientContext* context, common::CSVOption csvOption, CSVColumnInfo columnInfo);
+
+    void setFileComplete(uint64_t completedFileIdx);
+    populate_func_t constructPopulateFunc();
+};
+
+struct ParallelCSVScan {
+    static constexpr const char* name = "READ_CSV_PARALLEL";
+
+    static function::function_set getFunctionSet();
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/serial_csv_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/serial_csv_reader.h
new file mode 100644
index 0000000000..9ee1a9b25a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/csv/serial_csv_reader.h
@@ -0,0 +1,67 @@
+#pragma once
+
+#include "base_csv_reader.h"
+#include "function/function.h"
+#include "function/table/bind_input.h"
+#include "function/table/scan_file_function.h"
+#include "processor/operator/persistent/reader/csv/dialect_detection.h"
+#include "processor/operator/persistent/reader/file_error_handler.h"
+
+namespace lbug {
+namespace processor {
+
+//! Serial CSV reader is a class that reads values from a stream in a single thread.
+class SerialCSVReader final : public BaseCSVReader {
+public:
+    SerialCSVReader(const std::string& filePath, common::idx_t fileIdx, common::CSVOption option,
+        CSVColumnInfo columnInfo, main::ClientContext* context, LocalFileErrorHandler* errorHandler,
+        const function::ExtraScanTableFuncBindInput* bindInput = nullptr);
+
+    //! Sniffs CSV dialect and determines skip rows, header row, column types and column names
+    std::vector<std::pair<std::string, common::LogicalType>> sniffCSV(
+        DialectOption& detectedDialect, bool& detectedHeader);
+    uint64_t parseBlock(common::block_idx_t blockIdx, common::DataChunk& resultChunk) override;
+
+protected:
+    bool handleQuotedNewline() override { return true; }
+
+private:
+    const function::ExtraScanTableFuncBindInput* bindInput;
+    void resetReaderState();
+    DialectOption detectDialect();
+    bool detectHeader(std::vector<std::pair<std::string, common::LogicalType>>& detectedTypes);
+};
+
+struct SerialCSVScanSharedState final : public function::ScanFileWithProgressSharedState {
+    std::unique_ptr<SerialCSVReader> reader;
+    common::CSVOption csvOption;
+    CSVColumnInfo columnInfo;
+    uint64_t totalReadSizeByFile;
+    std::unique_ptr<SharedFileErrorHandler> sharedErrorHandler;
+    std::unique_ptr<LocalFileErrorHandler> localErrorHandler;
+    uint64_t queryID;
+    populate_func_t populateErrorFunc;
+
+    SerialCSVScanSharedState(common::FileScanInfo fileScanInfo, uint64_t numRows,
+        main::ClientContext* context, common::CSVOption csvOption, CSVColumnInfo columnInfo,
+        uint64_t queryID);
+
+    void read(common::DataChunk& outputChunk);
+
+    void initReader(main::ClientContext* context);
+    void finalizeReader(main::ClientContext* context) const;
+
+    populate_func_t constructPopulateFunc() const;
+};
+
+struct SerialCSVScan {
+    static constexpr const char* name = "READ_CSV_SERIAL";
+
+    static function::function_set getFunctionSet();
+    static void bindColumns(const function::ExtraScanTableFuncBindInput* bindInput,
+        std::vector<std::string>& columnNames, std::vector<common::LogicalType>& columnTypes,
+        DialectOption& detectedDialect, bool& detectedHeader, main::ClientContext* context);
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/file_error_handler.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/file_error_handler.h
new file mode 100644
index 0000000000..4673b6c984
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/file_error_handler.h
@@ -0,0 +1,88 @@
+#pragma once
+
+#include <map>
+#include <string>
+#include <vector>
+
+#include "common/uniq_lock.h"
+#include "processor/operator/persistent/reader/copy_from_error.h"
+#include "processor/warning_context.h"
+
+namespace lbug::processor {
+
+class BaseCSVReader;
+class SerialCSVReader;
+
+struct LinesPerBlock {
+    uint64_t numLines;
+    bool doneParsingBlock;
+};
+
+class SharedFileErrorHandler;
+
+class LBUG_API SharedFileErrorHandler {
+public:
+    explicit SharedFileErrorHandler(common::idx_t fileIdx, std::mutex* sharedMtx,
+        populate_func_t populateErrorFunc = {});
+
+    void handleError(CopyFromFileError error);
+    void throwCachedErrorsIfNeeded();
+
+    void setHeaderNumRows(uint64_t numRows);
+
+    void updateLineNumberInfo(const std::map<uint64_t, LinesPerBlock>& linesPerBlock,
+        bool canThrowCachedError);
+    uint64_t getNumCachedErrors();
+    uint64_t getLineNumber(uint64_t blockIdx, uint64_t numRowsReadInBlock) const;
+
+    void setPopulateErrorFunc(populate_func_t newPopulateErrorFunc);
+
+private:
+    // this number can be small as we only cache errors if we wish to throw them later
+    static constexpr uint64_t MAX_CACHED_ERROR_COUNT = 64;
+
+    common::UniqLock lock();
+    void tryThrowFirstCachedError();
+
+    std::string getErrorMessage(PopulatedCopyFromError populatedError) const;
+    void throwError(CopyFromFileError error) const;
+    bool canGetLineNumber(uint64_t blockIdx) const;
+    void tryCacheError(CopyFromFileError error, const common::UniqLock&);
+
+    std::mutex* mtx; // can be nullptr, in which case mutual exclusion is guaranteed by the caller
+    common::idx_t fileIdx;
+    std::vector<LinesPerBlock> linesPerBlock;
+    std::vector<CopyFromFileError> cachedErrors;
+    populate_func_t populateErrorFunc;
+
+    uint64_t headerNumRows;
+};
+
+class LBUG_API LocalFileErrorHandler {
+public:
+    ~LocalFileErrorHandler();
+
+    LocalFileErrorHandler(SharedFileErrorHandler* sharedErrorHandler, bool ignoreErrors,
+        main::ClientContext* context, bool cacheIgnoredErrors = true);
+
+    void handleError(CopyFromFileError error);
+    void reportFinishedBlock(uint64_t blockIdx, uint64_t numRowsRead);
+    void setHeaderNumRows(uint64_t numRows);
+    void finalize(bool canThrowCachedError = true);
+    bool getIgnoreErrorsOption() const { return ignoreErrors; }
+
+private:
+    static constexpr uint64_t LOCAL_WARNING_LIMIT = 256;
+    void flushCachedErrors(bool canThrowCachedError = true);
+
+    std::map<uint64_t, LinesPerBlock> linesPerBlock;
+    std::vector<CopyFromFileError> cachedErrors;
+    SharedFileErrorHandler* sharedErrorHandler;
+    main::ClientContext* context;
+
+    uint64_t maxCachedErrorCount;
+    bool ignoreErrors;
+    bool cacheIgnoredErrors;
+};
+
+} // namespace lbug::processor
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/npy/npy_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/npy/npy_reader.h
new file mode 100644
index 0000000000..19d1685c3a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/npy/npy_reader.h
@@ -0,0 +1,71 @@
+#pragma once
+
+#include <string>
+#include <vector>
+
+#include "common/data_chunk/data_chunk.h"
+#include "common/types/types.h"
+#include "function/function.h"
+#include "function/table/scan_file_function.h"
+
+namespace lbug {
+namespace processor {
+
+class NpyReader {
+public:
+    explicit NpyReader(const std::string& filePath);
+
+    ~NpyReader();
+
+    size_t getNumElementsPerRow() const;
+
+    uint8_t* getPointerToRow(size_t row) const;
+
+    inline size_t getNumRows() const { return shape[0]; }
+
+    void readBlock(common::block_idx_t blockIdx, common::ValueVector* vectorToRead) const;
+
+    // Used in tests only.
+    inline common::LogicalTypeID getType() const { return type; }
+    inline std::vector<size_t> getShape() const { return shape; }
+
+    void validate(const common::LogicalType& type_, common::offset_t numRows);
+
+private:
+    void parseHeader();
+    void parseType(std::string descr);
+
+private:
+    std::string filePath;
+    int fd;
+    size_t fileSize;
+    void* mmapRegion;
+    size_t dataOffset;
+    std::vector<size_t> shape;
+    common::LogicalTypeID type;
+};
+
+class NpyMultiFileReader {
+public:
+    explicit NpyMultiFileReader(const std::vector<std::string>& filePaths);
+
+    void readBlock(common::block_idx_t blockIdx, common::DataChunk& dataChunkToRead) const;
+
+private:
+    std::vector<std::unique_ptr<NpyReader>> fileReaders;
+};
+
+struct NpyScanSharedState final : public function::ScanFileSharedState {
+    explicit NpyScanSharedState(const common::FileScanInfo fileScanInfo, uint64_t numRows);
+
+    std::unique_ptr<NpyMultiFileReader> npyMultiFileReader;
+};
+
+struct NpyScanFunction {
+    static constexpr const char* name = "READ_NPY";
+
+    static function::function_set getFunctionSet();
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/boolean_column_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/boolean_column_reader.h
new file mode 100644
index 0000000000..0bee024172
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/boolean_column_reader.h
@@ -0,0 +1,45 @@
+#pragma once
+
+#include "column_reader.h"
+#include "templated_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+struct BooleanParquetValueConversion;
+
+class BooleanColumnReader : public TemplatedColumnReader<bool, BooleanParquetValueConversion> {
+public:
+    static constexpr const common::PhysicalTypeID TYPE = common::PhysicalTypeID::BOOL;
+
+public:
+    BooleanColumnReader(ParquetReader& reader, common::LogicalType type,
+        const lbug_parquet::format::SchemaElement& schema, uint64_t schemaIdx, uint64_t maxDefine,
+        uint64_t maxRepeat)
+        : TemplatedColumnReader<bool, BooleanParquetValueConversion>(reader, std::move(type),
+              schema, schemaIdx, maxDefine, maxRepeat),
+          bytePos(0){};
+
+    uint8_t bytePos;
+
+    void initializeRead(uint64_t rowGroupIdx,
+        const std::vector<lbug_parquet::format::ColumnChunk>& columns,
+        lbug_apache::thrift::protocol::TProtocol& protocol) override;
+
+    inline void resetPage() override { bytePos = 0; }
+};
+
+struct BooleanParquetValueConversion {
+    static bool dictRead(ByteBuffer& /*dict*/, uint32_t& /*offset*/, ColumnReader& /*reader*/) {
+        throw common::CopyException{"Dicts for booleans make no sense"};
+    }
+
+    static bool plainRead(ByteBuffer& plainData, ColumnReader& reader);
+
+    static inline void plainSkip(ByteBuffer& plainData, ColumnReader& reader) {
+        plainRead(plainData, reader);
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/callback_column_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/callback_column_reader.h
new file mode 100644
index 0000000000..29e034c088
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/callback_column_reader.h
@@ -0,0 +1,41 @@
+#pragma once
+
+#include "column_reader.h"
+#include "parquet_reader.h"
+#include "templated_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+template<class PARQUET_PHYSICAL_TYPE, class KU_PHYSICAL_TYPE,
+    KU_PHYSICAL_TYPE (*FUNC)(const PARQUET_PHYSICAL_TYPE& input)>
+class CallbackColumnReader
+    : public TemplatedColumnReader<KU_PHYSICAL_TYPE,
+          CallbackParquetValueConversion<PARQUET_PHYSICAL_TYPE, KU_PHYSICAL_TYPE, FUNC>> {
+    using BaseType = TemplatedColumnReader<KU_PHYSICAL_TYPE,
+        CallbackParquetValueConversion<PARQUET_PHYSICAL_TYPE, KU_PHYSICAL_TYPE, FUNC>>;
+
+public:
+    static constexpr const common::PhysicalTypeID TYPE = common::PhysicalTypeID::ANY;
+
+public:
+    CallbackColumnReader(ParquetReader& reader, common::LogicalType type_p,
+        const lbug_parquet::format::SchemaElement& schema_p, uint64_t file_idx_p,
+        uint64_t max_define_p, uint64_t max_repeat_p)
+        : TemplatedColumnReader<KU_PHYSICAL_TYPE,
+              CallbackParquetValueConversion<PARQUET_PHYSICAL_TYPE, KU_PHYSICAL_TYPE, FUNC>>(reader,
+              std::move(type_p), schema_p, file_idx_p, max_define_p, max_repeat_p) {}
+
+protected:
+    void dictionary(const std::shared_ptr<ResizeableBuffer>& dictionaryData,
+        uint64_t numEntries) override {
+        BaseType::allocateDict(numEntries * sizeof(KU_PHYSICAL_TYPE));
+        auto dictPtr = (KU_PHYSICAL_TYPE*)this->dict->ptr;
+        for (auto i = 0u; i < numEntries; i++) {
+            dictPtr[i] = FUNC(dictionaryData->read<PARQUET_PHYSICAL_TYPE>());
+        }
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/column_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/column_reader.h
new file mode 100644
index 0000000000..2934ddfb43
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/column_reader.h
@@ -0,0 +1,126 @@
+#pragma once
+
+#include <bitset>
+
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "parquet_dbp_decoder.h"
+#include "parquet_rle_bp_decoder.h"
+#include "parquet_types.h"
+#include "resizable_buffer.h"
+#include "thrift_tools.h"
+
+namespace lbug {
+namespace processor {
+class ParquetReader;
+
+typedef std::bitset<common::DEFAULT_VECTOR_CAPACITY> parquet_filter_t;
+
+class ColumnReader {
+public:
+    ColumnReader(ParquetReader& reader, common::LogicalType type,
+        const lbug_parquet::format::SchemaElement& schema, common::idx_t fileIdx,
+        uint64_t maxDefinition, uint64_t maxRepeat);
+    virtual ~ColumnReader() = default;
+    const common::LogicalType& getDataType() const { return type; }
+    bool hasDefines() const { return maxDefine > 0; }
+    bool hasRepeats() const { return maxRepeat > 0; }
+    virtual void skip(uint64_t numValues) { pendingSkips += numValues; }
+    virtual void dictionary(const std::shared_ptr<ResizeableBuffer>& /*data*/,
+        uint64_t /*num_entries*/) {
+        KU_UNREACHABLE;
+    }
+    virtual void offsets(uint32_t* /*offsets*/, uint8_t* /*defines*/, uint64_t /*numValues*/,
+        parquet_filter_t& /*filter*/, uint64_t /*resultOffset*/, common::ValueVector* /*result*/) {
+        KU_UNREACHABLE;
+    }
+    virtual void plain(const std::shared_ptr<ByteBuffer>& /*plainData*/, uint8_t* /*defines*/,
+        uint64_t /*numValues*/, parquet_filter_t& /*filter*/, uint64_t /*resultOffset*/,
+        common::ValueVector* /*result*/) {
+        KU_UNREACHABLE;
+    }
+    virtual void resetPage() {}
+    virtual uint64_t getGroupRowsAvailable() { return groupRowsAvailable; }
+    virtual void initializeRead(uint64_t rowGroupIdx,
+        const std::vector<lbug_parquet::format::ColumnChunk>& columns,
+        lbug_apache::thrift::protocol::TProtocol& protocol);
+    virtual uint64_t getTotalCompressedSize();
+    virtual void registerPrefetch(ThriftFileTransport& transport, bool allowMerge);
+    virtual uint64_t fileOffset() const;
+    virtual void applyPendingSkips(uint64_t numValues);
+    virtual uint64_t read(uint64_t numValues, parquet_filter_t& filter, uint8_t* defineOut,
+        uint8_t* repeatOut, common::ValueVector* resultOut);
+    static std::unique_ptr<ColumnReader> createReader(ParquetReader& reader,
+        common::LogicalType type, const lbug_parquet::format::SchemaElement& schema,
+        uint64_t fileIdx, uint64_t maxDefine, uint64_t maxRepeat);
+    void prepareRead(parquet_filter_t& filter);
+    void allocateBlock(uint64_t size);
+    void allocateCompressed(uint64_t size);
+    void decompressInternal(lbug_parquet::format::CompressionCodec::type codec, const uint8_t* src,
+        uint64_t srcSize, uint8_t* dst, uint64_t dstSize);
+    void preparePageV2(lbug_parquet::format::PageHeader& pageHdr);
+    void preparePage(lbug_parquet::format::PageHeader& pageHdr);
+    void prepareDataPage(lbug_parquet::format::PageHeader& pageHdr);
+    template<class VALUE_TYPE, class CONVERSION>
+    void plainTemplated(const std::shared_ptr<ByteBuffer>& plainData, const uint8_t* defines,
+        uint64_t numValues, parquet_filter_t& filter, uint64_t resultOffset,
+        common::ValueVector* result) {
+        for (auto i = 0u; i < numValues; i++) {
+            if (hasDefines() && defines[i + resultOffset] != maxDefine) {
+                result->setNull(i + resultOffset, true);
+                continue;
+            }
+            result->setNull(i + resultOffset, false);
+            if (filter[i + resultOffset]) {
+                VALUE_TYPE val = CONVERSION::plainRead(*plainData, *this);
+                result->setValue(i + resultOffset, val);
+            } else { // there is still some data there that we have to skip over
+                CONVERSION::plainSkip(*plainData, *this);
+            }
+        }
+    }
+
+private:
+    static std::unique_ptr<ColumnReader> createTimestampReader(ParquetReader& reader,
+        common::LogicalType type, const lbug_parquet::format::SchemaElement& schema,
+        uint64_t fileIdx, uint64_t maxDefine, uint64_t maxRepeat);
+
+protected:
+    const lbug_parquet::format::SchemaElement& schema;
+
+    uint64_t fileIdx;
+    uint64_t maxDefine;
+    uint64_t maxRepeat;
+
+    ParquetReader& reader;
+    common::LogicalType type;
+
+    uint64_t pendingSkips = 0;
+
+    const lbug_parquet::format::ColumnChunk* chunk = nullptr;
+
+    lbug_apache::thrift::protocol::TProtocol* protocol;
+    uint64_t pageRowsAvailable;
+    uint64_t groupRowsAvailable;
+    uint64_t chunkReadOffset;
+
+    std::shared_ptr<ResizeableBuffer> block;
+
+    ResizeableBuffer compressedBuffer;
+    ResizeableBuffer offsetBuffer;
+
+    std::unique_ptr<RleBpDecoder> dictDecoder;
+    std::unique_ptr<RleBpDecoder> defineDecoder;
+    std::unique_ptr<RleBpDecoder> repeatedDecoder;
+    std::unique_ptr<DbpDecoder> dbpDecoder;
+    std::unique_ptr<RleBpDecoder> rleDecoder;
+
+    // dummies for Skip()
+    parquet_filter_t noneFilter;
+    ResizeableBuffer dummyDefine;
+    ResizeableBuffer dummyRepeat;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/decode_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/decode_utils.h
new file mode 100644
index 0000000000..a0cc653611
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/decode_utils.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include "common/exception/copy.h"
+#include "common/string_format.h"
+#include "resizable_buffer.h"
+
+namespace lbug {
+namespace processor {
+class ParquetDecodeUtils {
+
+public:
+    template<class T>
+    static T ZigzagToInt(const T n) {
+        return (n >> 1) ^ -(n & 1);
+    }
+
+    static const uint64_t BITPACK_MASKS[];
+    static const uint64_t BITPACK_MASKS_SIZE;
+    static const uint8_t BITPACK_DLEN;
+
+    template<typename T>
+    static uint32_t BitUnpack(ByteBuffer& buffer, uint8_t& bitpack_pos, T* dest, uint32_t count,
+        uint8_t width) {
+        if (width >= ParquetDecodeUtils::BITPACK_MASKS_SIZE) {
+            throw common::CopyException(common::stringFormat(
+                "The width ({}) of the bitpacked data exceeds the supported max width ({}), "
+                "the file might be corrupted.",
+                width, ParquetDecodeUtils::BITPACK_MASKS_SIZE));
+        }
+        auto mask = BITPACK_MASKS[width];
+
+        for (uint32_t i = 0; i < count; i++) {
+            T val = (buffer.get<uint8_t>() >> bitpack_pos) & mask;
+            bitpack_pos += width;
+            while (bitpack_pos > BITPACK_DLEN) {
+                buffer.inc(1);
+                val |= (T(buffer.get<uint8_t>()) << T(BITPACK_DLEN - (bitpack_pos - width))) & mask;
+                bitpack_pos -= BITPACK_DLEN;
+            }
+            dest[i] = val;
+        }
+        return count;
+    }
+
+    template<class T>
+    static T VarintDecode(ByteBuffer& buf) {
+        T result = 0;
+        uint8_t shift = 0;
+        while (true) {
+            auto byte = buf.read<uint8_t>();
+            result |= T(byte & 127) << shift;
+            if ((byte & 128) == 0) {
+                break;
+            }
+            shift += 7;
+            if (shift > sizeof(T) * 8) {
+                throw std::runtime_error("Varint-decoding found too large number");
+            }
+        }
+        return result;
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/interval_column_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/interval_column_reader.h
new file mode 100644
index 0000000000..d1841212b5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/interval_column_reader.h
@@ -0,0 +1,41 @@
+#pragma once
+
+#include "common/constants.h"
+#include "common/types/interval_t.h"
+#include "templated_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+struct IntervalValueConversion {
+    static inline common::interval_t dictRead(ByteBuffer& dict, uint32_t& offset,
+        ColumnReader& /*reader*/) {
+        return (reinterpret_cast<common::interval_t*>(dict.ptr))[offset];
+    }
+
+    static common::interval_t readParquetInterval(const char* input);
+
+    static common::interval_t plainRead(ByteBuffer& plainData, ColumnReader& reader);
+
+    static inline void plainSkip(ByteBuffer& plain_data, ColumnReader& /*reader*/) {
+        plain_data.inc(common::ParquetConstants::PARQUET_INTERVAL_SIZE);
+    }
+};
+
+class IntervalColumnReader
+    : public TemplatedColumnReader<common::interval_t, IntervalValueConversion> {
+
+public:
+    IntervalColumnReader(ParquetReader& reader, common::LogicalType type,
+        const lbug_parquet::format::SchemaElement& schema, uint64_t fileIdx, uint64_t maxDefine,
+        uint64_t maxRepeat)
+        : TemplatedColumnReader<common::interval_t, IntervalValueConversion>(reader,
+              std::move(type), schema, fileIdx, maxDefine, maxRepeat){};
+
+protected:
+    void dictionary(const std::shared_ptr<ResizeableBuffer>& dictionaryData,
+        uint64_t numEntries) override;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/list_column_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/list_column_reader.h
new file mode 100644
index 0000000000..e03bb59864
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/list_column_reader.h
@@ -0,0 +1,54 @@
+#pragma once
+
+#include "column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+class ListColumnReader : public ColumnReader {
+public:
+    static constexpr const common::PhysicalTypeID TYPE = common::PhysicalTypeID::LIST;
+
+public:
+    ListColumnReader(ParquetReader& reader, common::LogicalType type,
+        const lbug_parquet::format::SchemaElement& schema, uint64_t schemaIdx, uint64_t maxDefine,
+        uint64_t maxRepeat, std::unique_ptr<ColumnReader> childColumnReader,
+        storage::MemoryManager* memoryManager);
+
+    inline void initializeRead(uint64_t rowGroupIdx,
+        const std::vector<lbug_parquet::format::ColumnChunk>& columns,
+        lbug_apache::thrift::protocol::TProtocol& protocol) override {
+        childColumnReader->initializeRead(rowGroupIdx, columns, protocol);
+    }
+
+    uint64_t read(uint64_t numValues, parquet_filter_t& filter, uint8_t* defineOut,
+        uint8_t* repeatOut, common::ValueVector* resultOut) override;
+
+    void applyPendingSkips(uint64_t numValues) override;
+
+private:
+    inline uint64_t getGroupRowsAvailable() override {
+        return childColumnReader->getGroupRowsAvailable() + overflowChildCount;
+    }
+
+    inline uint64_t getTotalCompressedSize() override {
+        return childColumnReader->getTotalCompressedSize();
+    }
+
+    inline void registerPrefetch(ThriftFileTransport& transport, bool allow_merge) override {
+        childColumnReader->registerPrefetch(transport, allow_merge);
+    }
+
+private:
+    std::unique_ptr<ColumnReader> childColumnReader;
+    ResizeableBuffer childDefines;
+    ResizeableBuffer childRepeats;
+    uint8_t* childDefinesPtr;
+    uint8_t* childRepeatsPtr;
+    parquet_filter_t childFilter;
+    uint64_t overflowChildCount;
+    std::unique_ptr<common::ValueVector> vectorToRead;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_dbp_decoder.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_dbp_decoder.h
new file mode 100644
index 0000000000..c35506c961
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_dbp_decoder.h
@@ -0,0 +1,115 @@
+#pragma once
+
+#include "decode_utils.h"
+
+namespace lbug {
+namespace processor {
+
+class DbpDecoder {
+public:
+    DbpDecoder(uint8_t* buffer, uint32_t buffer_len) : buffer_(buffer, buffer_len) {
+        //<block size in values> <number of miniblocks in a block> <total value count> <first value>
+        // overall header
+        block_value_count = ParquetDecodeUtils::VarintDecode<uint64_t>(buffer_);
+        miniblocks_per_block = ParquetDecodeUtils::VarintDecode<uint64_t>(buffer_);
+        total_value_count = ParquetDecodeUtils::VarintDecode<uint64_t>(buffer_);
+        start_value =
+            ParquetDecodeUtils::ZigzagToInt(ParquetDecodeUtils::VarintDecode<int64_t>(buffer_));
+
+        // some derivatives
+        KU_ASSERT(miniblocks_per_block > 0);
+        values_per_miniblock = block_value_count / miniblocks_per_block;
+        miniblock_bit_widths = std::unique_ptr<uint8_t[]>(new uint8_t[miniblocks_per_block]);
+
+        // init state to something sane
+        values_left_in_block = 0;
+        values_left_in_miniblock = 0;
+        miniblock_offset = 0;
+        min_delta = 0;
+        bitpack_pos = 0;
+        is_first_value = true;
+    };
+
+    template<typename T>
+    void GetBatch(uint8_t* values_target_ptr, uint32_t batch_size) {
+        auto* values = reinterpret_cast<T*>(values_target_ptr);
+
+        if (batch_size == 0) {
+            return;
+        }
+        uint64_t value_offset = 0;
+
+        if (is_first_value) {
+            values[0] = start_value;
+            value_offset++;
+            is_first_value = false;
+        }
+
+        if (total_value_count == 1) { // I guess it's a special case
+            if (batch_size > 1) {
+                throw std::runtime_error("DBP decode did not find enough values (have 1)");
+            }
+            return;
+        }
+
+        while (value_offset < batch_size) {
+            if (values_left_in_block == 0) { // need to open new block
+                if (bitpack_pos > 0) {       // have to eat the leftovers if any
+                    buffer_.inc(1);
+                }
+                min_delta = ParquetDecodeUtils::ZigzagToInt(
+                    ParquetDecodeUtils::VarintDecode<uint64_t>(buffer_));
+                for (auto miniblock_idx = 0u; miniblock_idx < miniblocks_per_block;
+                     miniblock_idx++) {
+                    miniblock_bit_widths[miniblock_idx] = buffer_.read<uint8_t>();
+                    // TODO what happens if width is 0?
+                }
+                values_left_in_block = block_value_count;
+                miniblock_offset = 0;
+                bitpack_pos = 0;
+                values_left_in_miniblock = values_per_miniblock;
+            }
+            if (values_left_in_miniblock == 0) {
+                miniblock_offset++;
+                values_left_in_miniblock = values_per_miniblock;
+            }
+
+            auto read_now =
+                std::min<uint64_t>(values_left_in_miniblock, (uint64_t)batch_size - value_offset);
+            ParquetDecodeUtils::BitUnpack<T>(buffer_, bitpack_pos, &values[value_offset], read_now,
+                miniblock_bit_widths[miniblock_offset]);
+            for (auto i = value_offset; i < value_offset + read_now; i++) {
+                values[i] = ((i == 0) ? start_value : values[i - 1]) + min_delta + values[i];
+            }
+            value_offset += read_now;
+            values_left_in_miniblock -= read_now;
+            values_left_in_block -= read_now;
+        }
+
+        if (value_offset != batch_size) {
+            throw std::runtime_error("DBP decode did not find enough values");
+        }
+        start_value = values[batch_size - 1];
+    }
+
+private:
+    ByteBuffer buffer_;
+    uint64_t block_value_count;
+    uint64_t miniblocks_per_block;
+    uint64_t total_value_count;
+    int64_t start_value;
+    uint64_t values_per_miniblock;
+
+    std::unique_ptr<uint8_t[]> miniblock_bit_widths;
+    uint64_t values_left_in_block;
+    uint64_t values_left_in_miniblock;
+    uint64_t miniblock_offset;
+    int64_t min_delta;
+
+    bool is_first_value;
+
+    uint8_t bitpack_pos;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_reader.h
new file mode 100644
index 0000000000..f674c31a50
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_reader.h
@@ -0,0 +1,120 @@
+#pragma once
+
+#include "column_reader.h"
+#include "common/data_chunk/data_chunk.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/types/types.h"
+#include "function/function.h"
+#include "function/table/scan_file_function.h"
+#include "parquet_types.h"
+#include "protocol/TCompactProtocol.h"
+#include "resizable_buffer.h"
+
+namespace lbug {
+namespace processor {
+
+struct ParquetReaderPrefetchConfig {
+    // Percentage of data in a row group span that should be scanned for enabling whole group
+    // prefetch
+    static constexpr double WHOLE_GROUP_PREFETCH_MINIMUM_SCAN = 0.95;
+};
+
+struct ParquetReaderScanState {
+    std::vector<uint64_t> groupIdxList;
+    int64_t currentGroup = -1;
+    uint64_t groupOffset = UINT64_MAX;
+    std::unique_ptr<common::FileInfo> fileInfo;
+    std::unique_ptr<ColumnReader> rootReader;
+    std::unique_ptr<lbug_apache::thrift::protocol::TProtocol> thriftFileProto;
+
+    bool finished = false;
+
+    ResizeableBuffer defineBuf;
+    ResizeableBuffer repeatBuf;
+
+    // TODO(Ziyi): We currently only support reading from local file system, thus the prefetch
+    // mode is disabled by default. Add this back when we support remote file system.
+    bool prefetchMode = false;
+    bool currentGroupPrefetched = false;
+};
+
+class ParquetReader {
+public:
+    ParquetReader(std::string filePath, std::vector<bool> columnSkips,
+        main::ClientContext* context);
+    ~ParquetReader() = default;
+
+    void initializeScan(ParquetReaderScanState& state, std::vector<uint64_t> groups_to_read,
+        common::VirtualFileSystem* vfs);
+    bool scanInternal(ParquetReaderScanState& state, common::DataChunk& result);
+    void scan(ParquetReaderScanState& state, common::DataChunk& result);
+    uint64_t getNumRowsGroups() { return metadata->row_groups.size(); }
+
+    uint32_t getNumColumns() const { return columnNames.size(); }
+    std::string getColumnName(uint32_t idx) const { return columnNames[idx]; }
+    const common::LogicalType& getColumnType(uint32_t idx) const { return columnTypes[idx]; }
+
+    lbug_parquet::format::FileMetaData* getMetadata() const { return metadata.get(); }
+
+private:
+    std::unique_ptr<lbug_apache::thrift::protocol::TProtocol> createThriftProtocol(
+        common::FileInfo* fileInfo_, bool prefetch_mode) {
+        return std::make_unique<
+            lbug_apache::thrift::protocol::TCompactProtocolT<ThriftFileTransport>>(
+            std::make_shared<ThriftFileTransport>(fileInfo_, prefetch_mode));
+    }
+    const lbug_parquet::format::RowGroup& getGroup(ParquetReaderScanState& state) {
+        KU_ASSERT(
+            state.currentGroup >= 0 && (uint64_t)state.currentGroup < state.groupIdxList.size());
+        KU_ASSERT(state.groupIdxList[state.currentGroup] < metadata->row_groups.size());
+        return metadata->row_groups[state.groupIdxList[state.currentGroup]];
+    }
+    static common::LogicalType deriveLogicalType(const lbug_parquet::format::SchemaElement& s_ele);
+    void initMetadata();
+    std::unique_ptr<ColumnReader> createReader();
+    std::unique_ptr<ColumnReader> createReaderRecursive(uint64_t depth, uint64_t maxDefine,
+        uint64_t maxRepeat, uint64_t& nextSchemaIdx, uint64_t& nextFileIdx);
+    void prepareRowGroupBuffer(ParquetReaderScanState& state, uint64_t colIdx);
+    // Group span is the distance between the min page offset and the max page offset plus the max
+    // page compressed size
+    uint64_t getGroupSpan(ParquetReaderScanState& state);
+    uint64_t getGroupCompressedSize(ParquetReaderScanState& state);
+    uint64_t getGroupOffset(ParquetReaderScanState& state);
+
+private:
+    std::string filePath;
+    std::vector<bool> columnSkips;
+    std::vector<std::string> columnNames;
+    std::vector<common::LogicalType> columnTypes;
+
+    std::unique_ptr<lbug_parquet::format::FileMetaData> metadata;
+    main::ClientContext* context;
+};
+
+struct ParquetScanSharedState final : function::ScanFileWithProgressSharedState {
+    explicit ParquetScanSharedState(common::FileScanInfo fileScanInfo, uint64_t numRows,
+        main::ClientContext* context, std::vector<bool> columnSkips);
+
+    std::vector<std::unique_ptr<ParquetReader>> readers;
+    std::vector<bool> columnSkips;
+    uint64_t totalRowsGroups;
+    std::atomic<uint64_t> numBlocksReadByFiles;
+};
+
+struct ParquetScanLocalState final : function::TableFuncLocalState {
+    ParquetScanLocalState() : reader(nullptr) {
+        state = std::make_unique<ParquetReaderScanState>();
+    }
+
+    ParquetReader* reader;
+    std::unique_ptr<ParquetReaderScanState> state;
+};
+
+struct ParquetScanFunction {
+    static constexpr const char* name = "READ_PARQUET";
+
+    static function::function_set getFunctionSet();
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_rle_bp_decoder.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_rle_bp_decoder.h
new file mode 100644
index 0000000000..759a9e5712
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_rle_bp_decoder.h
@@ -0,0 +1,118 @@
+#pragma once
+
+#include "decode_utils.h"
+#include "resizable_buffer.h"
+
+namespace lbug {
+namespace processor {
+
+class RleBpDecoder {
+public:
+    /// Create a decoder object. buffer/buffer_len is the decoded data.
+    /// bit_width is the width of each value (before encoding).
+    RleBpDecoder(uint8_t* buffer, uint32_t buffer_len, uint32_t bit_width)
+        : buffer_(buffer, buffer_len), bit_width_(bit_width), current_value_(0), repeat_count_(0),
+          literal_count_(0) {
+        if (bit_width >= 64) {
+            throw std::runtime_error("Decode bit width too large");
+        }
+        byte_encoded_len = ((bit_width_ + 7) / 8);
+        max_val = (uint64_t(1) << bit_width_) - 1;
+    }
+
+    template<typename T>
+    void GetBatch(uint8_t* values_target_ptr, uint32_t batch_size) {
+        auto* values = reinterpret_cast<T*>(values_target_ptr);
+        uint32_t values_read = 0;
+
+        while (values_read < batch_size) {
+            if (repeat_count_ > 0) {
+                int repeat_batch = std::min<uint32_t>(batch_size - values_read,
+                    static_cast<uint32_t>(repeat_count_));
+                std::fill(values + values_read, values + values_read + repeat_batch,
+                    static_cast<T>(current_value_));
+                repeat_count_ -= repeat_batch;
+                values_read += repeat_batch;
+            } else if (literal_count_ > 0) {
+                uint32_t literal_batch = std::min<uint32_t>(batch_size - values_read,
+                    static_cast<uint32_t>(literal_count_));
+                uint32_t actual_read = ParquetDecodeUtils::BitUnpack<T>(buffer_, bitpack_pos,
+                    values + values_read, literal_batch, bit_width_);
+                if (literal_batch != actual_read) {
+                    throw std::runtime_error("Did not find enough values");
+                }
+                literal_count_ -= literal_batch;
+                values_read += literal_batch;
+            } else {
+                if (!NextCounts<T>()) {
+                    if (values_read != batch_size) {
+                        throw std::runtime_error("RLE decode did not find enough values");
+                    }
+                    return;
+                }
+            }
+        }
+        if (values_read != batch_size) {
+            throw std::runtime_error("RLE decode did not find enough values");
+        }
+    }
+
+    static uint8_t ComputeBitWidth(uint64_t val) {
+        if (val == 0) {
+            return 0;
+        }
+        uint8_t ret = 1;
+        while (((uint64_t)(1u << ret) - 1) < val) {
+            ret++;
+        }
+        return ret;
+    }
+
+private:
+    ByteBuffer buffer_;
+
+    /// Number of bits needed to encode the value. Must be between 0 and 64.
+    uint32_t bit_width_;
+    uint64_t current_value_;
+    uint32_t repeat_count_;
+    uint32_t literal_count_;
+    uint8_t byte_encoded_len;
+    uint64_t max_val;
+
+    uint8_t bitpack_pos = 0;
+
+    /// Fills literal_count_ and repeat_count_ with next values. Returns false if there
+    /// are no more.
+    template<typename T>
+    bool NextCounts() {
+        // Read the next run's indicator int, it could be a literal or repeated run.
+        // The int is encoded as a vlq-encoded value.
+        if (bitpack_pos != 0) {
+            buffer_.inc(1);
+            bitpack_pos = 0;
+        }
+        auto indicator_value = ParquetDecodeUtils::VarintDecode<uint32_t>(buffer_);
+
+        // lsb indicates if it is a literal run or repeated run
+        bool is_literal = indicator_value & 1;
+        if (is_literal) {
+            literal_count_ = (indicator_value >> 1) * 8;
+        } else {
+            repeat_count_ = indicator_value >> 1;
+            // (ARROW-4018) this is not big-endian compatible, lol
+            current_value_ = 0;
+            for (auto i = 0; i < byte_encoded_len; i++) {
+                current_value_ |= (buffer_.read<uint8_t>() << (i * 8));
+            }
+            // sanity check
+            if (repeat_count_ > 0 && current_value_ > max_val) {
+                throw std::runtime_error("Payload value bigger than allowed. Corrupted file?");
+            }
+        }
+        // TODO complain if we run out of buffer
+        return true;
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_timestamp.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_timestamp.h
new file mode 100644
index 0000000000..c168b776e0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/parquet_timestamp.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include "common/types/timestamp_t.h"
+
+namespace lbug {
+namespace processor {
+
+struct Int96 {
+    uint32_t value[3];
+};
+
+struct ParquetTimeStampUtils {
+    static constexpr int64_t JULIAN_TO_UNIX_EPOCH_DAYS = 2440588LL;
+    static constexpr int64_t MILLISECONDS_PER_DAY = 86400000LL;
+    static constexpr int64_t MICROSECONDS_PER_DAY = MILLISECONDS_PER_DAY * 1000LL;
+    static constexpr int64_t NANOSECONDS_PER_MICRO = 1000LL;
+
+    static common::timestamp_t impalaTimestampToTimestamp(const Int96& rawTS);
+    static common::timestamp_t parquetTimestampMicrosToTimestamp(const int64_t& rawTS);
+    static common::timestamp_t parquetTimestampMsToTimestamp(const int64_t& rawTS);
+    static common::timestamp_t parquetTimestampNsToTimestamp(const int64_t& rawTS);
+    static int64_t impalaTimestampToMicroseconds(const Int96& impalaTimestamp);
+    static common::date_t parquetIntToDate(const int32_t& raw_date);
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/resizable_buffer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/resizable_buffer.h
new file mode 100644
index 0000000000..2086b1e0f0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/resizable_buffer.h
@@ -0,0 +1,85 @@
+#pragma once
+
+#include <cstring>
+#include <memory>
+#include <stdexcept>
+
+#include "common/utils.h"
+
+namespace lbug {
+namespace processor {
+
+class ByteBuffer { // on to the 10 thousandth impl
+public:
+    ByteBuffer() = default;
+    ByteBuffer(uint8_t* ptr, uint64_t len) : ptr{ptr}, len{len} {};
+
+    uint8_t* ptr = nullptr;
+    uint64_t len = 0;
+
+public:
+    void inc(uint64_t increment) {
+        available(increment);
+        len -= increment;
+        ptr += increment;
+    }
+
+    template<class T>
+    T read() {
+        T val = get<T>();
+        inc(sizeof(T));
+        return val;
+    }
+
+    template<typename T>
+    T Load(const uint8_t* ptr) {
+        T ret{};
+        memcpy(&ret, ptr, sizeof(ret));
+        return ret;
+    }
+
+    template<class T>
+    T get() {
+        available(sizeof(T));
+        T val = Load<T>(ptr);
+        return val;
+    }
+
+    void copyTo(char* dest, uint64_t len) const {
+        available(len);
+        std::memcpy(dest, ptr, len);
+    }
+
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    void zero() { std::memset(ptr, 0, len); }
+
+    void available(uint64_t req_len) const {
+        if (req_len > len) {
+            throw std::runtime_error("Out of buffer");
+        }
+    }
+};
+
+class ResizeableBuffer : public ByteBuffer {
+public:
+    ResizeableBuffer() = default;
+    explicit ResizeableBuffer(uint64_t new_size) { resize(new_size); }
+    void resize(uint64_t new_size) {
+        len = new_size;
+        if (new_size == 0) {
+            return;
+        }
+        if (new_size > allocLen) {
+            allocLen = common::nextPowerOfTwo(new_size);
+            allocatedData = std::make_unique<uint8_t[]>(allocLen);
+            ptr = allocatedData.get();
+        }
+    }
+
+private:
+    std::unique_ptr<uint8_t[]> allocatedData;
+    uint64_t allocLen = 0;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/string_column_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/string_column_reader.h
new file mode 100644
index 0000000000..f8036fb6f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/string_column_reader.h
@@ -0,0 +1,38 @@
+#pragma once
+
+#include "column_reader.h"
+#include "processor/operator/persistent/reader/parquet/templated_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+struct StringParquetValueConversion {
+    static common::ku_string_t dictRead(ByteBuffer& dict, uint32_t& offset, ColumnReader& reader);
+
+    static common::ku_string_t plainRead(ByteBuffer& plainData, ColumnReader& reader);
+
+    static void plainSkip(ByteBuffer& plainData, ColumnReader& reader);
+};
+
+class StringColumnReader
+    : public TemplatedColumnReader<common::ku_string_t, StringParquetValueConversion> {
+public:
+    static constexpr const common::PhysicalTypeID TYPE = common::PhysicalTypeID::STRING;
+
+public:
+    StringColumnReader(ParquetReader& reader, common::LogicalType type,
+        const lbug_parquet::format::SchemaElement& schema, uint64_t schemaIdx, uint64_t maxDefine,
+        uint64_t maxRepeat);
+
+    std::unique_ptr<common::ku_string_t[]> dictStrs;
+    uint64_t fixedWidthStringLength;
+
+public:
+    void dictionary(const std::shared_ptr<ResizeableBuffer>& dictionary_data,
+        uint64_t numEntries) override;
+    static uint32_t verifyString(const char* strData, uint32_t strLen, const bool isVarchar);
+    uint32_t verifyString(const char* strData, uint32_t strLen);
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/struct_column_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/struct_column_reader.h
new file mode 100644
index 0000000000..e15c4b526e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/struct_column_reader.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include "column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+class StructColumnReader : public ColumnReader {
+public:
+    static constexpr const common::PhysicalTypeID TYPE = common::PhysicalTypeID::STRUCT;
+
+public:
+    StructColumnReader(ParquetReader& reader, common::LogicalType type,
+        const lbug_parquet::format::SchemaElement& schema, uint64_t schemaIdx, uint64_t maxDefine,
+        uint64_t maxRepeat, std::vector<std::unique_ptr<ColumnReader>> childReaders);
+
+    void initializeRead(uint64_t rowGroupIdx,
+        const std::vector<lbug_parquet::format::ColumnChunk>& columns,
+        lbug_apache::thrift::protocol::TProtocol& protocol) override;
+    uint64_t read(uint64_t num_values, parquet_filter_t& filter, uint8_t* define_out,
+        uint8_t* repeat_out, common::ValueVector* result) override;
+    ColumnReader* getChildReader(uint64_t childIdx);
+
+private:
+    uint64_t getTotalCompressedSize() override;
+    void registerPrefetch(ThriftFileTransport& transport, bool allow_merge) override;
+    void skip(uint64_t num_values) override;
+    uint64_t getGroupRowsAvailable() override;
+
+private:
+    std::vector<std::unique_ptr<ColumnReader>> childReaders;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/templated_column_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/templated_column_reader.h
new file mode 100644
index 0000000000..ed9ea1231c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/templated_column_reader.h
@@ -0,0 +1,95 @@
+#pragma once
+
+#include "column_reader.h"
+#include "resizable_buffer.h"
+
+namespace lbug {
+namespace processor {
+
+template<class VALUE_TYPE>
+struct TemplatedParquetValueConversion {
+    static VALUE_TYPE dictRead(ByteBuffer& dict, uint32_t& offset, ColumnReader& /*reader*/) {
+        KU_ASSERT(offset < dict.len / sizeof(VALUE_TYPE));
+        return ((VALUE_TYPE*)dict.ptr)[offset];
+    }
+
+    static VALUE_TYPE plainRead(ByteBuffer& plainData, ColumnReader& /*reader*/) {
+        return plainData.read<VALUE_TYPE>();
+    }
+
+    static void plainSkip(ByteBuffer& plainData, ColumnReader& /*reader*/) {
+        plainData.inc(sizeof(VALUE_TYPE));
+    }
+};
+
+template<class VALUE_TYPE, class VALUE_CONVERSION>
+class TemplatedColumnReader : public ColumnReader {
+public:
+    static constexpr const common::PhysicalTypeID TYPE = common::PhysicalTypeID::ANY;
+
+public:
+    TemplatedColumnReader(ParquetReader& reader, common::LogicalType type,
+        const lbug_parquet::format::SchemaElement& schema, uint64_t schemaIdx, uint64_t maxDefine,
+        uint64_t maxRepeat)
+        : ColumnReader(reader, std::move(type), schema, schemaIdx, maxDefine, maxRepeat){};
+
+    std::shared_ptr<ResizeableBuffer> dict;
+
+public:
+    void allocateDict(uint64_t size) {
+        if (!dict) {
+            dict = std::make_shared<ResizeableBuffer>(size);
+        } else {
+            dict->resize(size);
+        }
+    }
+
+    void offsets(uint32_t* offsets, uint8_t* defines, uint64_t numValues, parquet_filter_t& filter,
+        uint64_t resultOffset, common::ValueVector* result) override {
+        uint64_t offsetIdx = 0;
+        for (auto rowIdx = 0u; rowIdx < numValues; rowIdx++) {
+            if (hasDefines() && defines[rowIdx + resultOffset] != maxDefine) {
+                result->setNull(rowIdx + resultOffset, true);
+                continue;
+            }
+            result->setNull(rowIdx + resultOffset, false);
+            if (filter[rowIdx + resultOffset]) {
+                VALUE_TYPE val = VALUE_CONVERSION::dictRead(*dict, offsets[offsetIdx++], *this);
+                result->setValue(rowIdx + resultOffset, val);
+            } else {
+                offsetIdx++;
+            }
+        }
+    }
+
+    void plain(const std::shared_ptr<ByteBuffer>& plainData, uint8_t* defines, uint64_t numValues,
+        parquet_filter_t& filter, uint64_t resultOffset, common::ValueVector* result) override {
+        plainTemplated<VALUE_TYPE, VALUE_CONVERSION>(plainData, defines, numValues, filter,
+            resultOffset, result);
+    }
+
+    void dictionary(const std::shared_ptr<ResizeableBuffer>& data,
+        uint64_t /*num_entries*/) override {
+        dict = data;
+    }
+};
+
+template<class PARQUET_PHYSICAL_TYPE, class DUCKDB_PHYSICAL_TYPE,
+    DUCKDB_PHYSICAL_TYPE (*FUNC)(const PARQUET_PHYSICAL_TYPE& input)>
+struct CallbackParquetValueConversion {
+    static DUCKDB_PHYSICAL_TYPE dictRead(ByteBuffer& dict, uint32_t& offset, ColumnReader& reader) {
+        return TemplatedParquetValueConversion<DUCKDB_PHYSICAL_TYPE>::dictRead(dict, offset,
+            reader);
+    }
+
+    static DUCKDB_PHYSICAL_TYPE plainRead(ByteBuffer& plainData, ColumnReader& /*reader*/) {
+        return FUNC(plainData.read<PARQUET_PHYSICAL_TYPE>());
+    }
+
+    static void plainSkip(ByteBuffer& plainData, ColumnReader& /*reader*/) {
+        plainData.inc(sizeof(PARQUET_PHYSICAL_TYPE));
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/thrift_tools.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/thrift_tools.h
new file mode 100644
index 0000000000..f4b7b38035
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/thrift_tools.h
@@ -0,0 +1,198 @@
+#pragma once
+
+#include <cstring>
+#include <list>
+
+#include "common/assert.h"
+#include "common/file_system/file_info.h"
+#include "transport/TVirtualTransport.h"
+
+namespace lbug {
+namespace processor {
+
+// A ReadHead for prefetching data in a specific range
+struct ReadHead {
+    ReadHead(uint64_t location, uint64_t size) : location(location), size(size){};
+    // Hint info
+    uint64_t location;
+    uint64_t size;
+
+    // Current info
+    std::unique_ptr<uint8_t[]> data;
+    bool data_isset = false;
+
+    uint64_t GetEnd() const { return size + location; }
+
+    void Allocate() { data = std::make_unique<uint8_t[]>(size); }
+};
+
+// Comparator for ReadHeads that are either overlapping, adjacent, or within ALLOW_GAP bytes from
+// each other
+struct ReadHeadComparator {
+    static constexpr uint64_t ALLOW_GAP = 1 << 14; // 16 KiB
+    bool operator()(const ReadHead* a, const ReadHead* b) const {
+        auto a_start = a->location;
+        auto a_end = a->location + a->size;
+        auto b_start = b->location;
+
+        if (a_end <= UINT64_MAX - ALLOW_GAP) {
+            a_end += ALLOW_GAP;
+        }
+
+        return a_start < b_start && a_end < b_start;
+    }
+};
+
+// Two-step read ahead buffer
+// 1: register all ranges that will be read, merging ranges that are consecutive
+// 2: prefetch all registered ranges
+struct ReadAheadBuffer {
+    explicit ReadAheadBuffer(common::FileInfo* handle) : handle(handle) {}
+
+    // The list of read heads
+    std::list<ReadHead> read_heads;
+    // Set for merging consecutive ranges
+    std::set<ReadHead*, ReadHeadComparator> merge_set;
+
+    common::FileInfo* handle;
+
+    uint64_t total_size = 0;
+
+    // Add a read head to the prefetching list
+    void AddReadHead(uint64_t pos, uint64_t len, bool merge_buffers = true) {
+        // Attempt to merge with existing
+        if (merge_buffers) {
+            ReadHead new_read_head{pos, len};
+            auto lookup_set = merge_set.find(&new_read_head);
+            if (lookup_set != merge_set.end()) {
+                auto existing_head = *lookup_set;
+                auto new_start =
+                    std::min<uint64_t>(existing_head->location, new_read_head.location);
+                auto new_length =
+                    std::min<uint64_t>(existing_head->GetEnd(), new_read_head.GetEnd()) - new_start;
+                existing_head->location = new_start;
+                existing_head->size = new_length;
+                return;
+            }
+        }
+
+        read_heads.emplace_front(ReadHead(pos, len));
+        total_size += len;
+        auto& read_head = read_heads.front();
+
+        if (merge_buffers) {
+            merge_set.insert(&read_head);
+        }
+
+        if (read_head.GetEnd() > handle->getFileSize()) {
+            throw std::runtime_error("Prefetch registered for bytes outside file");
+        }
+    }
+
+    // Returns the relevant read head
+    ReadHead* GetReadHead(uint64_t pos) {
+        for (auto& read_head : read_heads) {
+            if (pos >= read_head.location && pos < read_head.GetEnd()) {
+                return &read_head;
+            }
+        }
+        return nullptr;
+    }
+
+    // Prefetch all read heads
+    void Prefetch() {
+        for (auto& read_head : read_heads) {
+            read_head.Allocate();
+
+            if (read_head.GetEnd() > handle->getFileSize()) {
+                throw std::runtime_error("Prefetch registered requested for bytes outside file");
+            }
+            handle->readFromFile(read_head.data.get(), read_head.size, read_head.location);
+            read_head.data_isset = true;
+        }
+    }
+};
+
+class ThriftFileTransport
+    : public lbug_apache::thrift::transport::TVirtualTransport<ThriftFileTransport> {
+public:
+    static constexpr uint64_t PREFETCH_FALLBACK_BUFFERSIZE = 1000000;
+
+    ThriftFileTransport(common::FileInfo* handle_p, bool prefetch_mode_p)
+        : handle(handle_p), location(0), ra_buffer(ReadAheadBuffer(handle_p)),
+          prefetch_mode(prefetch_mode_p) {}
+
+    uint32_t read(uint8_t* buf, uint32_t len) {
+        auto prefetch_buffer = ra_buffer.GetReadHead(location);
+        if (prefetch_buffer != nullptr &&
+            location - prefetch_buffer->location + len <= prefetch_buffer->size) {
+            KU_ASSERT(location - prefetch_buffer->location + len <= prefetch_buffer->size);
+
+            if (!prefetch_buffer->data_isset) {
+                prefetch_buffer->Allocate();
+                handle->readFromFile(prefetch_buffer->data.get(), prefetch_buffer->size,
+                    prefetch_buffer->location);
+                prefetch_buffer->data_isset = true;
+            }
+            memcpy(buf, prefetch_buffer->data.get() + location - prefetch_buffer->location, len);
+        } else {
+            if (prefetch_mode && len < PREFETCH_FALLBACK_BUFFERSIZE && len > 0) {
+                Prefetch(location, std::min<uint64_t>(PREFETCH_FALLBACK_BUFFERSIZE,
+                                       handle->getFileSize() - location));
+                auto prefetch_buffer_fallback = ra_buffer.GetReadHead(location);
+                KU_ASSERT(location - prefetch_buffer_fallback->location + len <=
+                          prefetch_buffer_fallback->size);
+                memcpy(buf,
+                    prefetch_buffer_fallback->data.get() + location -
+                        prefetch_buffer_fallback->location,
+                    len);
+            } else {
+                handle->readFromFile(buf, len, location);
+            }
+        }
+        location += len;
+        return len;
+    }
+
+    // Prefetch a single buffer
+    void Prefetch(uint64_t pos, uint64_t len) {
+        RegisterPrefetch(pos, len, false);
+        FinalizeRegistration();
+        PrefetchRegistered();
+    }
+
+    // Register a buffer for prefixing
+    void RegisterPrefetch(uint64_t pos, uint64_t len, bool can_merge = true) {
+        ra_buffer.AddReadHead(pos, len, can_merge);
+    }
+
+    // Prevents any further merges, should be called before PrefetchRegistered
+    void FinalizeRegistration() { ra_buffer.merge_set.clear(); }
+
+    // Prefetch all previously registered ranges
+    void PrefetchRegistered() { ra_buffer.Prefetch(); }
+
+    void ClearPrefetch() {
+        ra_buffer.read_heads.clear();
+        ra_buffer.merge_set.clear();
+    }
+
+    void SetLocation(uint64_t location_p) { location = location_p; }
+
+    uint64_t GetLocation() const { return location; }
+    uint64_t GetSize() { return handle->getFileSize(); }
+
+private:
+    common::FileInfo* handle;
+    uint64_t location;
+
+    // Multi-buffer prefetch
+    ReadAheadBuffer ra_buffer;
+
+    // Whether the prefetch mode is enabled. In this mode the DirectIO flag of the handle will be
+    // set and the parquet reader will manage the read buffering.
+    bool prefetch_mode;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/uuid_column_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/uuid_column_reader.h
new file mode 100644
index 0000000000..c9e517784e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/parquet/uuid_column_reader.h
@@ -0,0 +1,39 @@
+#pragma once
+
+#include "common/types/uuid.h"
+#include "processor/operator/persistent/reader/parquet/resizable_buffer.h"
+#include "templated_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+struct UUIDValueConversion {
+    static common::ku_uuid_t dictRead(ByteBuffer& dict, uint32_t& offset,
+        ColumnReader& /*reader*/) {
+        return reinterpret_cast<common::ku_uuid_t*>(dict.ptr)[offset];
+    }
+
+    static common::ku_uuid_t ReadParquetUUID(const uint8_t* input);
+
+    static common::ku_uuid_t plainRead(ByteBuffer& bufferData, ColumnReader& /*reader*/);
+
+    static void plainSkip(ByteBuffer& plain_data, ColumnReader& /*reader*/) {
+        plain_data.inc(sizeof(common::ku_uuid_t));
+    }
+};
+
+class UUIDColumnReader : public TemplatedColumnReader<common::ku_uuid_t, UUIDValueConversion> {
+public:
+    UUIDColumnReader(ParquetReader& reader, common::LogicalType dataType,
+        const lbug_parquet::format::SchemaElement& schema_p, uint64_t file_idx_p,
+        uint64_t maxDefine, uint64_t maxRepeat)
+        : TemplatedColumnReader<common::ku_uuid_t, UUIDValueConversion>(reader, std::move(dataType),
+              schema_p, file_idx_p, maxDefine, maxRepeat){};
+
+protected:
+    void dictionary(const std::shared_ptr<ResizeableBuffer>& dictionaryData,
+        uint64_t numEntries) override;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/reader_bind_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/reader_bind_utils.h
new file mode 100644
index 0000000000..c337baf435
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/reader/reader_bind_utils.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "common/types/types.h"
+
+namespace lbug {
+namespace processor {
+
+struct ReaderBindUtils {
+    static void validateNumColumns(uint32_t expectedNumber, uint32_t detectedNumber);
+    static void validateColumnTypes(const std::vector<std::string>& columnNames,
+        const std::vector<common::LogicalType>& expectedColumnTypes,
+        const std::vector<common::LogicalType>& detectedColumnTypes);
+    static void resolveColumns(const std::vector<std::string>& expectedColumnNames,
+        const std::vector<std::string>& detectedColumnNames,
+        std::vector<std::string>& resultColumnNames,
+        const std::vector<common::LogicalType>& expectedColumnTypes,
+        const std::vector<common::LogicalType>& detectedColumnTypes,
+        std::vector<common::LogicalType>& resultColumnTypes);
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/rel_batch_insert.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/rel_batch_insert.h
new file mode 100644
index 0000000000..3893cd3b42
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/rel_batch_insert.h
@@ -0,0 +1,171 @@
+#pragma once
+
+#include "common/enums/rel_direction.h"
+#include "processor/operator/partitioner.h"
+#include "processor/operator/persistent/batch_insert.h"
+
+namespace lbug {
+namespace catalog {
+class RelGroupCatalogEntry;
+} // namespace catalog
+
+namespace storage {
+class CSRNodeGroup;
+struct InMemChunkedCSRHeader;
+} // namespace storage
+
+namespace processor {
+
+struct LBUG_API RelBatchInsertPrintInfo final : OPPrintInfo {
+    std::string tableName;
+
+    explicit RelBatchInsertPrintInfo(std::string tableName) : tableName(std::move(tableName)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<RelBatchInsertPrintInfo>(new RelBatchInsertPrintInfo(*this));
+    }
+
+private:
+    RelBatchInsertPrintInfo(const RelBatchInsertPrintInfo& other)
+        : OPPrintInfo(other), tableName(other.tableName) {}
+};
+
+struct LBUG_API RelBatchInsertProgressSharedState {
+    std::atomic<uint64_t> partitionsDone;
+    uint64_t partitionsTotal;
+
+    RelBatchInsertProgressSharedState() : partitionsDone{0}, partitionsTotal{0} {};
+};
+
+struct LBUG_API RelBatchInsertInfo final : BatchInsertInfo {
+    common::RelDataDirection direction;
+    common::table_id_t fromTableID, toTableID;
+    uint64_t partitioningIdx = UINT64_MAX;
+    common::column_id_t boundNodeOffsetColumnID = common::INVALID_COLUMN_ID;
+
+    RelBatchInsertInfo(std::string tableName, std::vector<common::LogicalType> warningColumnTypes,
+        common::table_id_t fromTableID, common::table_id_t toTableID,
+        common::RelDataDirection direction)
+        : BatchInsertInfo{std::move(tableName), std::move(warningColumnTypes)},
+          direction{direction}, fromTableID{fromTableID}, toTableID{toTableID} {}
+    RelBatchInsertInfo(const RelBatchInsertInfo& other)
+        : BatchInsertInfo{other}, direction{other.direction}, fromTableID{other.fromTableID},
+          toTableID{other.toTableID}, partitioningIdx{other.partitioningIdx},
+          boundNodeOffsetColumnID{other.boundNodeOffsetColumnID} {}
+
+    std::unique_ptr<BatchInsertInfo> copy() const override {
+        return std::make_unique<RelBatchInsertInfo>(*this);
+    }
+};
+
+struct LBUG_API RelBatchInsertLocalState final : BatchInsertLocalState {
+    common::partition_idx_t nodeGroupIdx = common::INVALID_NODE_GROUP_IDX;
+    std::unique_ptr<common::DataChunk> dummyAllNullDataChunk;
+};
+
+struct LBUG_API RelBatchInsertExecutionState {
+    virtual ~RelBatchInsertExecutionState() = default;
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+/**
+ * Abstract RelBatchInsert class
+ * When performing rel batch insert, we typically take some source data and use it to construct the
+ * CSR header as well as a chunked node group that actually contains the rel properties
+ * Child classes can customize how data is copied from the source into the CSR chunked node group
+ * (which is the format in which the rels are actually stored)
+ *
+ * The following interfaces can be overriden:
+ * - initExecutionState(): The execution state contains any extra local state needed during the
+ * insertion of a single CSR node group. This reset by calling initExecutionState() before the
+ * insertion of each node group so make sure that the lifetime of any stored state doesn't exceed
+ * this.
+ * - populateCSRLengths(): Populates the length chunk in the CSR header. The offsets are directly
+ * calculated from the lengths and thus calculating the offsets doesn't need to be customized
+ * - finalizeStartCSROffsets(): The CSR offsets are initially calculated as start offsets. The
+ * default behaviour of this function is to convert the start offsets to end offsets. However, if
+ * any extra logic is required during this conversion, this function can be overriden.
+ * - writeToTable(): Writes property data to the local chunked node group. This function is also
+ * responsible for ensuring that the data is written in a way such that the copied data is in
+ * agreement with the CSR header
+ *
+ * Generally, the source data to be copied from should be contained in the partitionerSharedState,
+ * which can also be overridden.
+ */
+class LBUG_API RelBatchInsertImpl {
+public:
+    virtual ~RelBatchInsertImpl() = default;
+    virtual std::unique_ptr<RelBatchInsertImpl> copy() = 0;
+    virtual std::unique_ptr<RelBatchInsertExecutionState> initExecutionState(
+        const PartitionerSharedState& partitionerSharedState, const RelBatchInsertInfo& relInfo,
+        common::node_group_idx_t nodeGroupIdx) = 0;
+    virtual void populateCSRLengths(RelBatchInsertExecutionState& executionState,
+        storage::InMemChunkedCSRHeader& csrHeader, common::offset_t numNodes,
+        const RelBatchInsertInfo& relInfo) = 0;
+    virtual void finalizeStartCSROffsets(RelBatchInsertExecutionState& executionState,
+        storage::InMemChunkedCSRHeader& csrHeader, const RelBatchInsertInfo& relInfo);
+    virtual void writeToTable(RelBatchInsertExecutionState& executionState,
+        const storage::InMemChunkedCSRHeader& csrHeader, const RelBatchInsertLocalState& localState,
+        BatchInsertSharedState& sharedState, const RelBatchInsertInfo& relInfo) = 0;
+};
+
+class LBUG_API RelBatchInsert : public BatchInsert {
+public:
+    RelBatchInsert(std::unique_ptr<BatchInsertInfo> info,
+        std::shared_ptr<PartitionerSharedState> partitionerSharedState,
+        std::shared_ptr<BatchInsertSharedState> sharedState, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo,
+        std::shared_ptr<RelBatchInsertProgressSharedState> progressSharedState,
+        std::unique_ptr<RelBatchInsertImpl> impl)
+        : BatchInsert{std::move(info), std::move(sharedState), id, std::move(printInfo)},
+          partitionerSharedState{std::move(partitionerSharedState)},
+          progressSharedState{std::move(progressSharedState)}, impl(std::move(impl)) {}
+
+    bool isSource() const override { return true; }
+
+    void initGlobalStateInternal(ExecutionContext* context) override;
+    void initLocalStateInternal(ResultSet* resultSet_, ExecutionContext* context) override;
+
+    void executeInternal(ExecutionContext* context) override;
+    void finalizeInternal(ExecutionContext* context) override;
+
+    void updateProgress(const ExecutionContext* context) const;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<RelBatchInsert>(info->copy(), partitionerSharedState, sharedState,
+            id, printInfo->copy(), progressSharedState, impl->copy());
+    }
+
+private:
+    void appendNodeGroup(const catalog::RelGroupCatalogEntry& relGroupEntry,
+        storage::MemoryManager& mm, transaction::Transaction* transaction,
+        storage::CSRNodeGroup& nodeGroup, const RelBatchInsertInfo& relInfo,
+        const RelBatchInsertLocalState& localState);
+
+    void populateCSRHeader(const catalog::RelGroupCatalogEntry& relGroupEntry,
+        RelBatchInsertExecutionState& executionState, common::offset_t startNodeOffset,
+        const RelBatchInsertInfo& relInfo, const RelBatchInsertLocalState& localState,
+        common::offset_t numNodes, bool leaveGaps);
+
+    static void checkRelMultiplicityConstraint(const catalog::RelGroupCatalogEntry& relGroupEntry,
+        const storage::InMemChunkedCSRHeader& csrHeader, common::offset_t startNodeOffset,
+        const RelBatchInsertInfo& relInfo);
+
+protected:
+    std::shared_ptr<PartitionerSharedState> partitionerSharedState;
+    std::shared_ptr<RelBatchInsertProgressSharedState> progressSharedState;
+    std::unique_ptr<RelBatchInsertImpl> impl;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/set.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/set.h
new file mode 100644
index 0000000000..c6dca2a70a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/set.h
@@ -0,0 +1,77 @@
+#pragma once
+
+#include "processor/operator/physical_operator.h"
+#include "set_executor.h"
+
+namespace lbug {
+namespace processor {
+
+struct SetPropertyPrintInfo final : OPPrintInfo {
+    std::vector<binder::expression_pair> expressions;
+
+    explicit SetPropertyPrintInfo(std::vector<binder::expression_pair> expressions)
+        : expressions(std::move(expressions)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<SetPropertyPrintInfo>(new SetPropertyPrintInfo(*this));
+    }
+
+private:
+    SetPropertyPrintInfo(const SetPropertyPrintInfo& other)
+        : OPPrintInfo(other), expressions(other.expressions) {}
+};
+
+class SetNodeProperty final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::SET_PROPERTY;
+
+public:
+    SetNodeProperty(std::vector<std::unique_ptr<NodeSetExecutor>> executors,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          executors{std::move(executors)} {}
+
+    bool isParallel() const override { return false; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<SetNodeProperty>(copyVector(executors), children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    std::vector<std::unique_ptr<NodeSetExecutor>> executors;
+};
+
+class SetRelProperty final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::SET_PROPERTY;
+
+public:
+    SetRelProperty(std::vector<std::unique_ptr<RelSetExecutor>> executors,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          executors{std::move(executors)} {}
+
+    bool isParallel() const override { return false; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<SetRelProperty>(copyVector(executors), children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    std::vector<std::unique_ptr<RelSetExecutor>> executors;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/set_executor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/set_executor.h
new file mode 100644
index 0000000000..b4c0323d89
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/set_executor.h
@@ -0,0 +1,193 @@
+#pragma once
+
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/execution_context.h"
+#include "processor/result/result_set.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct NodeSetInfo {
+    DataPos nodeIDPos;
+    DataPos columnVectorPos;
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> evaluator;
+
+    common::ValueVector* nodeIDVector = nullptr;
+    common::ValueVector* columnVector = nullptr;
+    common::ValueVector* columnDataVector = nullptr;
+
+    NodeSetInfo(DataPos nodeIDPos, DataPos columnVectorPos,
+        std::unique_ptr<evaluator::ExpressionEvaluator> evaluator)
+        : nodeIDPos{nodeIDPos}, columnVectorPos{columnVectorPos}, evaluator{std::move(evaluator)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(NodeSetInfo);
+
+    void init(const ResultSet& resultSet, main::ClientContext* context);
+
+private:
+    NodeSetInfo(const NodeSetInfo& other)
+        : nodeIDPos{other.nodeIDPos}, columnVectorPos{other.columnVectorPos},
+          evaluator{other.evaluator->copy()} {}
+};
+
+struct NodeTableSetInfo {
+    storage::NodeTable* table;
+    common::column_id_t columnID;
+
+    NodeTableSetInfo(storage::NodeTable* table, common::column_id_t columnID)
+        : table{table}, columnID{columnID} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(NodeTableSetInfo);
+
+private:
+    NodeTableSetInfo(const NodeTableSetInfo& other)
+        : table{other.table}, columnID{other.columnID} {}
+};
+
+class NodeSetExecutor {
+public:
+    explicit NodeSetExecutor(NodeSetInfo info) : info{std::move(info)} {}
+    NodeSetExecutor(const NodeSetExecutor& other) : info{other.info.copy()} {}
+    virtual ~NodeSetExecutor() = default;
+
+    virtual void init(ResultSet* resultSet, ExecutionContext* context);
+
+    void setNodeID(common::nodeID_t nodeID) const;
+
+    virtual void set(ExecutionContext* context) = 0;
+
+    virtual std::unique_ptr<NodeSetExecutor> copy() const = 0;
+
+protected:
+    NodeSetInfo info;
+};
+
+class SingleLabelNodeSetExecutor final : public NodeSetExecutor {
+public:
+    SingleLabelNodeSetExecutor(NodeSetInfo info, NodeTableSetInfo tableInfo)
+        : NodeSetExecutor{std::move(info)}, tableInfo{std::move(tableInfo)} {}
+    SingleLabelNodeSetExecutor(const SingleLabelNodeSetExecutor& other)
+        : NodeSetExecutor{other}, tableInfo(other.tableInfo.copy()) {}
+
+    void set(ExecutionContext* context) override;
+
+    std::unique_ptr<NodeSetExecutor> copy() const override {
+        return std::make_unique<SingleLabelNodeSetExecutor>(*this);
+    }
+
+private:
+    NodeTableSetInfo tableInfo;
+};
+
+class MultiLabelNodeSetExecutor final : public NodeSetExecutor {
+public:
+    MultiLabelNodeSetExecutor(NodeSetInfo info, common::table_id_map_t<NodeTableSetInfo> tableInfos)
+        : NodeSetExecutor{std::move(info)}, tableInfos{std::move(tableInfos)} {}
+    MultiLabelNodeSetExecutor(const MultiLabelNodeSetExecutor& other)
+        : NodeSetExecutor{other}, tableInfos{copyUnorderedMap(other.tableInfos)} {}
+
+    void set(ExecutionContext* context) override;
+
+    std::unique_ptr<NodeSetExecutor> copy() const override {
+        return std::make_unique<MultiLabelNodeSetExecutor>(*this);
+    }
+
+private:
+    common::table_id_map_t<NodeTableSetInfo> tableInfos;
+};
+
+struct RelSetInfo {
+    DataPos srcNodeIDPos;
+    DataPos dstNodeIDPos;
+    DataPos relIDPos;
+    DataPos columnVectorPos;
+    std::unique_ptr<evaluator::ExpressionEvaluator> evaluator;
+
+    common::ValueVector* srcNodeIDVector = nullptr;
+    common::ValueVector* dstNodeIDVector = nullptr;
+    common::ValueVector* relIDVector = nullptr;
+    common::ValueVector* columnVector = nullptr;
+    common::ValueVector* columnDataVector = nullptr;
+
+    RelSetInfo(DataPos srcNodeIDPos, DataPos dstNodeIDPos, DataPos relIDPos,
+        DataPos columnVectorPos, std::unique_ptr<evaluator::ExpressionEvaluator> evaluator)
+        : srcNodeIDPos{srcNodeIDPos}, dstNodeIDPos{dstNodeIDPos}, relIDPos{relIDPos},
+          columnVectorPos{columnVectorPos}, evaluator{std::move(evaluator)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(RelSetInfo);
+
+    void init(const ResultSet& resultSet, main::ClientContext* context);
+
+private:
+    RelSetInfo(const RelSetInfo& other)
+        : srcNodeIDPos{other.srcNodeIDPos}, dstNodeIDPos{other.dstNodeIDPos},
+          relIDPos{other.relIDPos}, columnVectorPos{other.columnVectorPos},
+          evaluator{other.evaluator->copy()} {}
+};
+
+struct RelTableSetInfo {
+    storage::RelTable* table;
+    common::column_id_t columnID;
+
+    RelTableSetInfo(storage::RelTable* table, common::column_id_t columnID)
+        : table{table}, columnID{columnID} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(RelTableSetInfo);
+
+private:
+    RelTableSetInfo(const RelTableSetInfo& other) : table{other.table}, columnID{other.columnID} {}
+};
+
+class RelSetExecutor {
+public:
+    explicit RelSetExecutor(RelSetInfo info) : info{std::move(info)} {}
+    RelSetExecutor(const RelSetExecutor& other) : info{other.info.copy()} {}
+    virtual ~RelSetExecutor() = default;
+
+    void init(ResultSet* resultSet, ExecutionContext* context);
+
+    void setRelID(common::nodeID_t relID) const;
+
+    virtual void set(ExecutionContext* context) = 0;
+
+    virtual std::unique_ptr<RelSetExecutor> copy() const = 0;
+
+protected:
+    RelSetInfo info;
+};
+
+class SingleLabelRelSetExecutor final : public RelSetExecutor {
+public:
+    SingleLabelRelSetExecutor(RelSetInfo info, RelTableSetInfo tableInfo)
+        : RelSetExecutor{std::move(info)}, tableInfo{std::move(tableInfo)} {}
+    SingleLabelRelSetExecutor(const SingleLabelRelSetExecutor& other)
+        : RelSetExecutor{other}, tableInfo{other.tableInfo.copy()} {}
+
+    void set(ExecutionContext* context) override;
+
+    std::unique_ptr<RelSetExecutor> copy() const override {
+        return std::make_unique<SingleLabelRelSetExecutor>(*this);
+    }
+
+private:
+    RelTableSetInfo tableInfo;
+};
+
+class MultiLabelRelSetExecutor final : public RelSetExecutor {
+public:
+    MultiLabelRelSetExecutor(RelSetInfo info, common::table_id_map_t<RelTableSetInfo> tableInfos)
+        : RelSetExecutor{std::move(info)}, tableInfos{std::move(tableInfos)} {}
+    MultiLabelRelSetExecutor(const MultiLabelRelSetExecutor& other)
+        : RelSetExecutor{other}, tableInfos{copyUnorderedMap(other.tableInfos)} {}
+
+    void set(ExecutionContext* context) override;
+
+    std::unique_ptr<RelSetExecutor> copy() const override {
+        return std::make_unique<MultiLabelRelSetExecutor>(*this);
+    }
+
+private:
+    common::table_id_map_t<RelTableSetInfo> tableInfos;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/basic_column_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/basic_column_writer.h
new file mode 100644
index 0000000000..8ff7018bac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/basic_column_writer.h
@@ -0,0 +1,93 @@
+#pragma once
+
+#include "parquet_types.h"
+#include "processor/operator/persistent/writer/parquet/column_writer.h"
+
+namespace lbug {
+namespace processor {
+
+class BasicColumnWriterState : public ColumnWriterState {
+public:
+    BasicColumnWriterState(lbug_parquet::format::RowGroup& rowGroup, uint64_t colIdx)
+        : rowGroup{rowGroup}, colIdx{colIdx} {
+        pageInfo.emplace_back();
+    }
+
+    lbug_parquet::format::RowGroup& rowGroup;
+    uint64_t colIdx;
+    std::vector<PageInformation> pageInfo;
+    std::vector<PageWriteInformation> writeInfo;
+    std::unique_ptr<ColumnWriterStatistics> statsState;
+    uint64_t currentPage = 0;
+};
+
+class BasicColumnWriter : public ColumnWriter {
+public:
+    BasicColumnWriter(ParquetWriter& writer, uint64_t schemaIdx,
+        std::vector<std::string> schemaPath, uint64_t maxRepeat, uint64_t maxDefine,
+        bool canHaveNulls)
+        : ColumnWriter(writer, schemaIdx, std::move(schemaPath), maxRepeat, maxDefine,
+              canHaveNulls) {}
+
+public:
+    std::unique_ptr<ColumnWriterState> initializeWriteState(
+        lbug_parquet::format::RowGroup& rowGroup) override;
+    void prepare(ColumnWriterState& state, ColumnWriterState* parent, common::ValueVector* vector,
+        uint64_t count) override;
+    void beginWrite(ColumnWriterState& state) override;
+    void write(ColumnWriterState& state, common::ValueVector* vector, uint64_t count) override;
+    void finalizeWrite(ColumnWriterState& state) override;
+
+protected:
+    void writeLevels(common::Serializer& bufferedSerializer, const std::vector<uint16_t>& levels,
+        uint64_t maxValue, uint64_t startOffset, uint64_t count);
+
+    virtual lbug_parquet::format::Encoding::type getEncoding(BasicColumnWriterState& /*state*/) {
+        return lbug_parquet::format::Encoding::PLAIN;
+    }
+
+    void nextPage(BasicColumnWriterState& state);
+    void flushPage(BasicColumnWriterState& state);
+
+    // Initializes the state used to track statistics during writing. Only used for scalar types.
+    virtual std::unique_ptr<ColumnWriterStatistics> initializeStatsState() {
+        return std::make_unique<ColumnWriterStatistics>();
+    }
+
+    // Initialize the writer for a specific page. Only used for scalar types.
+    virtual std::unique_ptr<ColumnWriterPageState> initializePageState(
+        BasicColumnWriterState& /*state*/) {
+        return nullptr;
+    }
+
+    // Flushes the writer for a specific page. Only used for scalar types.
+    virtual void flushPageState(common::Serializer& /*bufferedSerializer*/,
+        ColumnWriterPageState* /*state*/) {}
+
+    // Retrieves the row size of a vector at the specified location. Only used for scalar types.
+    virtual uint64_t getRowSize(common::ValueVector* /*vector*/, uint64_t /*index*/,
+        BasicColumnWriterState& /*state*/) {
+        KU_UNREACHABLE;
+    }
+    // Writes a (subset of a) vector to the specified serializer. Only used for scalar types.
+    virtual void writeVector(common::Serializer& bufferedSerializer, ColumnWriterStatistics* stats,
+        ColumnWriterPageState* pageState, common::ValueVector* vector, uint64_t chunkStart,
+        uint64_t chunkEnd) = 0;
+
+    virtual bool hasDictionary(BasicColumnWriterState& /*writerState*/) { return false; }
+    // The number of elements in the dictionary.
+    virtual uint64_t dictionarySize(BasicColumnWriterState& /*writerState*/) { KU_UNREACHABLE; }
+    void writeDictionary(BasicColumnWriterState& state,
+        std::unique_ptr<common::BufferWriter> bufferedSerializer, uint64_t rowCount);
+    virtual void flushDictionary(BasicColumnWriterState& /*state*/,
+        ColumnWriterStatistics* /*stats*/) {
+        KU_UNREACHABLE;
+    }
+
+    void setParquetStatistics(BasicColumnWriterState& state,
+        lbug_parquet::format::ColumnChunk& column);
+    void registerToRowGroup(lbug_parquet::format::RowGroup& rowGroup);
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/boolean_column_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/boolean_column_writer.h
new file mode 100644
index 0000000000..43d7a6534f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/boolean_column_writer.h
@@ -0,0 +1,67 @@
+#pragma once
+
+#include "processor/operator/persistent/writer/parquet/basic_column_writer.h"
+
+namespace lbug {
+namespace processor {
+
+class BooleanStatisticsState : public ColumnWriterStatistics {
+public:
+    BooleanStatisticsState() : min{true}, max{false} {}
+
+    bool min;
+    bool max;
+
+public:
+    bool hasStats() const { return !(min && !max); }
+
+    std::string getMin() override { return getMinValue(); }
+    std::string getMax() override { return getMaxValue(); }
+    std::string getMinValue() override {
+        return hasStats() ? std::string(reinterpret_cast<const char*>(&min), sizeof(bool)) :
+                            std::string();
+    }
+    std::string getMaxValue() override {
+        return hasStats() ? std::string(reinterpret_cast<const char*>(&max), sizeof(bool)) :
+                            std::string();
+    }
+};
+
+class BooleanWriterPageState : public ColumnWriterPageState {
+public:
+    uint8_t byte = 0;
+    uint8_t bytePos = 0;
+};
+
+class BooleanColumnWriter : public BasicColumnWriter {
+public:
+    BooleanColumnWriter(ParquetWriter& writer, uint64_t schemaIdx,
+        std::vector<std::string> schemaPath, uint64_t maxRepeat, uint64_t maxDefine,
+        bool canHaveNulls)
+        : BasicColumnWriter(writer, schemaIdx, std::move(schemaPath), maxRepeat, maxDefine,
+              canHaveNulls) {}
+
+    inline std::unique_ptr<ColumnWriterStatistics> initializeStatsState() override {
+        return std::make_unique<BooleanStatisticsState>();
+    }
+
+    inline uint64_t getRowSize(common::ValueVector* /*vector*/, uint64_t /*index*/,
+        BasicColumnWriterState& /*state*/) override {
+        return sizeof(bool);
+    }
+
+    inline std::unique_ptr<ColumnWriterPageState> initializePageState(
+        BasicColumnWriterState& /*state*/) override {
+        return std::make_unique<BooleanWriterPageState>();
+    }
+
+    void writeVector(common::Serializer& bufferedSerializer,
+        ColumnWriterStatistics* writerStatistics, ColumnWriterPageState* writerPageState,
+        common::ValueVector* vector, uint64_t chunkStart, uint64_t chunkEnd) override;
+
+    void flushPageState(common::Serializer& temp_writer,
+        ColumnWriterPageState* writerPageState) override;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/column_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/column_writer.h
new file mode 100644
index 0000000000..b9983d3ad2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/column_writer.h
@@ -0,0 +1,109 @@
+#pragma once
+
+#include "common/serializer/buffer_writer.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "parquet_types.h"
+
+namespace lbug {
+namespace processor {
+class ParquetWriter;
+
+struct PageInformation {
+    uint64_t offset = 0;
+    uint64_t rowCount = 0;
+    uint64_t emptyCount = 0;
+    uint64_t estimatedPageSize = 0;
+};
+
+class ColumnWriterPageState {
+public:
+    virtual ~ColumnWriterPageState() = default;
+};
+
+struct PageWriteInformation {
+    lbug_parquet::format::PageHeader pageHeader;
+    std::shared_ptr<common::BufferWriter> bufferWriter;
+    std::unique_ptr<common::Serializer> writer;
+    std::unique_ptr<ColumnWriterPageState> pageState;
+    uint64_t writePageIdx = 0;
+    uint64_t writeCount = 0;
+    uint64_t maxWriteCount = 0;
+    size_t compressedSize = 0;
+    uint8_t* compressedData = nullptr;
+    std::unique_ptr<uint8_t[]> compressedBuf;
+};
+
+class ColumnWriterState {
+public:
+    virtual ~ColumnWriterState() = default;
+
+    std::vector<uint16_t> definitionLevels;
+    std::vector<uint16_t> repetitionLevels;
+    std::vector<bool> isEmpty;
+};
+
+class ColumnWriterStatistics {
+public:
+    virtual ~ColumnWriterStatistics() = default;
+
+    virtual std::string getMin() { return {}; }
+    virtual std::string getMax() { return {}; }
+    virtual std::string getMinValue() { return {}; }
+    virtual std::string getMaxValue() { return {}; }
+};
+
+class ColumnWriter {
+public:
+    ColumnWriter(ParquetWriter& writer, uint64_t schemaIdx, std::vector<std::string> schemaPath,
+        uint64_t maxRepeat, uint64_t maxDefine, bool canHaveNulls);
+    virtual ~ColumnWriter() = default;
+
+    // Create the column writer for a specific type recursively.
+    // TODO(Ziyi): We currently don't have statistics to indicate whether a column
+    // has null value or not. So canHaveNullsToCreate is always true.
+    static std::unique_ptr<ColumnWriter> createWriterRecursive(
+        std::vector<lbug_parquet::format::SchemaElement>& schemas, ParquetWriter& writer,
+        const common::LogicalType& type, const std::string& name,
+        std::vector<std::string> schemaPathToCreate, storage::MemoryManager* mm,
+        uint64_t maxRepeatToCreate = 0, uint64_t maxDefineToCreate = 1,
+        bool canHaveNullsToCreate = true);
+
+    virtual std::unique_ptr<ColumnWriterState> initializeWriteState(
+        lbug_parquet::format::RowGroup& rowGroup) = 0;
+    // Indicates whether the write need to analyse the data before preparing it.
+    virtual bool hasAnalyze() { return false; }
+    virtual void analyze(ColumnWriterState& /*state*/, ColumnWriterState* /*parent*/,
+        common::ValueVector* /*vector*/, uint64_t /*count*/) {
+        KU_UNREACHABLE;
+    }
+    // Called after all data has been passed to Analyze.
+    virtual void finalizeAnalyze(ColumnWriterState& /*state*/) { KU_UNREACHABLE; }
+    virtual void prepare(ColumnWriterState& state, ColumnWriterState* parent,
+        common::ValueVector* vector, uint64_t count) = 0;
+    virtual void beginWrite(ColumnWriterState& state) = 0;
+    virtual void write(ColumnWriterState& state, common::ValueVector* vector, uint64_t count) = 0;
+    virtual void finalizeWrite(ColumnWriterState& state) = 0;
+    inline uint64_t getVectorPos(common::ValueVector* vector, uint64_t idx) {
+        return (vector->state == nullptr || !vector->state->isFlat()) ? idx : 0;
+    }
+
+    ParquetWriter& writer;
+    uint64_t schemaIdx;
+    std::vector<std::string> schemaPath;
+    uint64_t maxRepeat;
+    uint64_t maxDefine;
+    bool canHaveNulls;
+    // collected stats
+    uint64_t nullCount;
+
+protected:
+    void handleDefineLevels(ColumnWriterState& state, ColumnWriterState* parent,
+        common::ValueVector* vector, uint64_t count, uint16_t defineValue, uint16_t nullValue);
+    void handleRepeatLevels(ColumnWriterState& stateToHandle, ColumnWriterState* parent);
+    void compressPage(common::BufferWriter& bufferedSerializer, size_t& compressedSize,
+        uint8_t*& compressedData, std::unique_ptr<uint8_t[]>& compressedBuf);
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/interval_column_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/interval_column_writer.h
new file mode 100644
index 0000000000..9e041850fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/interval_column_writer.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "basic_column_writer.h"
+#include "common/constants.h"
+#include "common/types/interval_t.h"
+
+namespace lbug {
+namespace processor {
+
+class IntervalColumnWriter : public BasicColumnWriter {
+
+public:
+    IntervalColumnWriter(ParquetWriter& writer, uint64_t schemaIdx,
+        std::vector<std::string> schemaPath, uint64_t maxRepeat, uint64_t maxDefine,
+        bool canHaveNulls)
+        : BasicColumnWriter(writer, schemaIdx, std::move(schemaPath), maxRepeat, maxDefine,
+              canHaveNulls) {}
+
+public:
+    static void writeParquetInterval(common::interval_t input, uint8_t* result);
+
+    void writeVector(common::Serializer& bufferedSerializer, ColumnWriterStatistics* state,
+        ColumnWriterPageState* pageState, common::ValueVector* vector, uint64_t chunkStart,
+        uint64_t chunkEnd) override;
+
+    uint64_t getRowSize(common::ValueVector* /*vector*/, uint64_t /*index*/,
+        BasicColumnWriterState& /*state*/) override {
+        return common::ParquetConstants::PARQUET_INTERVAL_SIZE;
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/list_column_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/list_column_writer.h
new file mode 100644
index 0000000000..5d9dc38b2a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/list_column_writer.h
@@ -0,0 +1,45 @@
+#pragma once
+
+#include "processor/operator/persistent/writer/parquet/column_writer.h"
+
+namespace lbug {
+namespace processor {
+
+class ListColumnWriter : public ColumnWriter {
+public:
+    ListColumnWriter(ParquetWriter& writer, uint64_t schemaIdx, std::vector<std::string> schema,
+        uint64_t maxRepeat, uint64_t maxDefine, std::unique_ptr<ColumnWriter> childWriter,
+        bool canHaveNulls)
+        : ColumnWriter(writer, schemaIdx, std::move(schema), maxRepeat, maxDefine, canHaveNulls),
+          childWriter(std::move(childWriter)) {}
+
+    std::unique_ptr<ColumnWriterState> initializeWriteState(
+        lbug_parquet::format::RowGroup& rowGroup) override;
+    bool hasAnalyze() override;
+    void analyze(ColumnWriterState& writerState, ColumnWriterState* parent,
+        common::ValueVector* vector, uint64_t count) override;
+    void finalizeAnalyze(ColumnWriterState& writerState) override;
+    void prepare(ColumnWriterState& writerState, ColumnWriterState* parent,
+        common::ValueVector* vector, uint64_t count) override;
+    void beginWrite(ColumnWriterState& state) override;
+    void write(ColumnWriterState& writerState, common::ValueVector* vector,
+        uint64_t count) override;
+    void finalizeWrite(ColumnWriterState& writerState) override;
+
+private:
+    std::unique_ptr<ColumnWriter> childWriter;
+};
+
+class ListColumnWriterState : public ColumnWriterState {
+public:
+    ListColumnWriterState(lbug_parquet::format::RowGroup& rowGroup, uint64_t colIdx)
+        : rowGroup{rowGroup}, colIdx{colIdx} {}
+
+    lbug_parquet::format::RowGroup& rowGroup;
+    uint64_t colIdx;
+    std::unique_ptr<ColumnWriterState> childState;
+    uint64_t parentIdx = 0;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/parquet_rle_bp_encoder.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/parquet_rle_bp_encoder.h
new file mode 100644
index 0000000000..bae2a35098
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/parquet_rle_bp_encoder.h
@@ -0,0 +1,43 @@
+#pragma once
+
+#include "common/serializer/serializer.h"
+
+namespace lbug {
+namespace processor {
+
+class RleBpEncoder {
+public:
+    explicit RleBpEncoder(uint32_t bitWidth);
+
+public:
+    // NOTE: Prepare is only required if a byte count is required BEFORE writing
+    // This is the case with e.g. writing repetition/definition levels
+    // If GetByteCount() is not required, prepare can be safely skipped.
+    void beginPrepare(uint32_t firstValue);
+    void prepareValue(uint32_t value);
+    void finishPrepare();
+
+    void beginWrite(uint32_t first_value);
+    void writeValue(common::Serializer& writer, uint32_t value);
+    void finishWrite(common::Serializer& writer);
+
+    uint64_t getByteCount() const;
+
+    static uint8_t getVarintSize(uint32_t val);
+
+private:
+    //! meta information
+    uint32_t byteWidth;
+    //! RLE run information
+    uint64_t byteCount;
+    uint64_t runCount;
+    uint64_t currentRunCount;
+    uint32_t lastValue;
+
+private:
+    void finishRun();
+    void writeRun(common::Serializer& bufferedSerializer);
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/parquet_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/parquet_writer.h
new file mode 100644
index 0000000000..172e2d781f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/parquet_writer.h
@@ -0,0 +1,94 @@
+#pragma once
+
+#include <mutex>
+
+#include "common/data_chunk/data_chunk.h"
+#include "common/file_system/file_info.h"
+#include "common/types/types.h"
+#include "parquet_types.h"
+#include "processor/operator/persistent/writer/parquet/column_writer.h"
+#include "processor/result/factorized_table.h"
+#include "protocol/TProtocol.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+
+namespace processor {
+
+class ParquetWriterTransport : public lbug_apache::thrift::protocol::TTransport {
+public:
+    explicit ParquetWriterTransport(common::FileInfo* fileInfo, common::offset_t& offset)
+        : fileInfo{fileInfo}, offset{offset} {}
+
+    inline bool isOpen() const override { return true; }
+
+    void open() override {}
+
+    void close() override {}
+
+    inline void write_virt(const uint8_t* buf, uint32_t len) override {
+        fileInfo->writeFile(buf, len, offset);
+        offset += len;
+    }
+
+private:
+    common::FileInfo* fileInfo;
+    common::offset_t& offset;
+};
+
+struct PreparedRowGroup {
+    lbug_parquet::format::RowGroup rowGroup;
+    std::vector<std::unique_ptr<ColumnWriterState>> states;
+};
+
+class ParquetWriter {
+public:
+    ParquetWriter(std::string fileName, std::vector<common::LogicalType> types,
+        std::vector<std::string> names, lbug_parquet::format::CompressionCodec::type codec,
+        main::ClientContext* context);
+
+    inline common::offset_t getOffset() const { return fileOffset; }
+    inline void write(const uint8_t* buf, uint32_t len) {
+        fileInfo->writeFile(buf, len, fileOffset);
+        fileOffset += len;
+    }
+    inline lbug_parquet::format::CompressionCodec::type getCodec() { return codec; }
+    inline lbug_apache::thrift::protocol::TProtocol* getProtocol() { return protocol.get(); }
+    inline lbug_parquet::format::Type::type getParquetType(uint64_t schemaIdx) {
+        return fileMetaData.schema[schemaIdx].type;
+    }
+    void flush(FactorizedTable& ft);
+    void finalize();
+    static lbug_parquet::format::Type::type convertToParquetType(const common::LogicalType& type);
+    static void setSchemaProperties(const common::LogicalType& type,
+        lbug_parquet::format::SchemaElement& schemaElement);
+
+private:
+    void prepareRowGroup(FactorizedTable& ft, PreparedRowGroup& result);
+    void flushRowGroup(PreparedRowGroup& rowGroup);
+    void readFromFT(FactorizedTable& ft, std::vector<common::ValueVector*> vectorsToRead,
+        uint64_t& numTuplesRead);
+    inline uint64_t getNumTuples(common::DataChunk* unflatChunk) {
+        return unflatChunk->getNumValueVectors() != 0 ?
+                   unflatChunk->state->getSelVector().getSelSize() :
+                   1;
+    }
+
+private:
+    std::string fileName;
+    std::vector<common::LogicalType> types;
+    std::vector<std::string> columnNames;
+    lbug_parquet::format::CompressionCodec::type codec;
+    std::unique_ptr<common::FileInfo> fileInfo;
+    std::shared_ptr<lbug_apache::thrift::protocol::TProtocol> protocol;
+    lbug_parquet::format::FileMetaData fileMetaData;
+    std::mutex lock;
+    std::vector<std::unique_ptr<ColumnWriter>> columnWriters;
+    common::offset_t fileOffset;
+    storage::MemoryManager* mm;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/standard_column_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/standard_column_writer.h
new file mode 100644
index 0000000000..53372dcac8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/standard_column_writer.h
@@ -0,0 +1,105 @@
+#pragma once
+
+#include "basic_column_writer.h"
+#include "common/serializer/serializer.h"
+#include "function/cast/functions/numeric_limits.h"
+#include "function/comparison/comparison_functions.h"
+
+namespace lbug {
+namespace processor {
+
+template<class SRC, class T, class OP>
+class NumericStatisticsState : public ColumnWriterStatistics {
+public:
+    NumericStatisticsState()
+        : min(function::NumericLimits<T>::maximum()), max(function::NumericLimits<T>::minimum()) {}
+
+    T min;
+    T max;
+
+public:
+    bool hasStats() { return min <= max; }
+
+    std::string getMin() override {
+        return function::NumericLimits<SRC>::isSigned() ? getMinValue() : std::string();
+    }
+    std::string getMax() override {
+        return function::NumericLimits<SRC>::isSigned() ? getMaxValue() : std::string();
+    }
+    std::string getMinValue() override {
+        return hasStats() ? std::string((char*)&min, sizeof(T)) : std::string();
+    }
+    std::string getMaxValue() override {
+        return hasStats() ? std::string((char*)&max, sizeof(T)) : std::string();
+    }
+};
+
+struct BaseParquetOperator {
+    template<class SRC, class TGT>
+    inline static std::unique_ptr<ColumnWriterStatistics> initializeStats() {
+        return std::make_unique<NumericStatisticsState<SRC, TGT, BaseParquetOperator>>();
+    }
+
+    template<class SRC, class TGT>
+    static void handleStats(ColumnWriterStatistics* stats, SRC /*sourceValue*/, TGT targetValue) {
+        auto& numericStats = (NumericStatisticsState<SRC, TGT, BaseParquetOperator>&)*stats;
+        uint8_t result = 0;
+        function::LessThan::operation(targetValue, numericStats.min, result,
+            nullptr /* leftVector */, nullptr /* rightVector */);
+        if (result != 0) {
+            numericStats.min = targetValue;
+        }
+        function::GreaterThan::operation(targetValue, numericStats.max, result,
+            nullptr /* leftVector */, nullptr /* rightVector */);
+        if (result != 0) {
+            numericStats.max = targetValue;
+        }
+    }
+};
+
+struct ParquetCastOperator : public BaseParquetOperator {
+    template<class SRC, class TGT>
+    static TGT Operation(SRC input) {
+        return TGT(input);
+    }
+};
+
+template<class SRC, class TGT, class OP = ParquetCastOperator>
+class StandardColumnWriter : public BasicColumnWriter {
+public:
+    StandardColumnWriter(ParquetWriter& writer, uint64_t schemaIdx,
+        std::vector<std::string> schemaPath, uint64_t maxRepeat, uint64_t maxDefine,
+        bool canHaveNulls)
+        : BasicColumnWriter(writer, schemaIdx, std::move(schemaPath), maxRepeat, maxDefine,
+              canHaveNulls) {}
+
+    std::unique_ptr<ColumnWriterStatistics> initializeStatsState() override {
+        return OP::template initializeStats<SRC, TGT>();
+    }
+
+    void templatedWritePlain(common::ValueVector* vector, ColumnWriterStatistics* stats,
+        uint64_t chunkStart, uint64_t chunkEnd, common::Serializer& ser) {
+        for (auto r = chunkStart; r < chunkEnd; r++) {
+            auto pos = getVectorPos(vector, r);
+            if (!vector->isNull(pos)) {
+                TGT targetValue = OP::template Operation<SRC, TGT>(vector->getValue<SRC>(pos));
+                OP::template handleStats<SRC, TGT>(stats, vector->getValue<SRC>(pos), targetValue);
+                ser.write<TGT>(targetValue);
+            }
+        }
+    }
+
+    void writeVector(common::Serializer& bufferedSerializer, ColumnWriterStatistics* stats,
+        ColumnWriterPageState* /*pageState*/, common::ValueVector* vector, uint64_t chunkStart,
+        uint64_t chunkEnd) override {
+        templatedWritePlain(vector, stats, chunkStart, chunkEnd, bufferedSerializer);
+    }
+
+    uint64_t getRowSize(common::ValueVector* /*vector*/, uint64_t /*index*/,
+        BasicColumnWriterState& /*state*/) override {
+        return sizeof(TGT);
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/string_column_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/string_column_writer.h
new file mode 100644
index 0000000000..be001181f3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/string_column_writer.h
@@ -0,0 +1,142 @@
+#pragma once
+
+#include "parquet_rle_bp_encoder.h"
+#include "parquet_types.h"
+#include "processor/operator/persistent/writer/parquet/basic_column_writer.h"
+
+namespace lbug {
+namespace processor {
+
+struct StringHash {
+    std::size_t operator()(const common::ku_string_t& k) const;
+};
+
+struct StringEquality {
+    bool operator()(const common::ku_string_t& a, const common::ku_string_t& b) const;
+};
+
+template<typename T>
+using string_map_t = std::unordered_map<common::ku_string_t, T, StringHash, StringEquality>;
+
+class StringStatisticsState : public ColumnWriterStatistics {
+public:
+    bool hasStats = false;
+    bool valuesTooBig = false;
+    std::string min;
+    std::string max;
+
+public:
+    bool hasValidStats() const { return hasStats; }
+
+    void update(const common::ku_string_t& val);
+
+    std::string getMin() override { return getMinValue(); }
+    std::string getMax() override { return getMaxValue(); }
+    std::string getMinValue() override { return hasValidStats() ? min : std::string(); }
+    std::string getMaxValue() override { return hasValidStats() ? max : std::string(); }
+};
+
+class StringColumnWriterState : public BasicColumnWriterState {
+public:
+    StringColumnWriterState(lbug_parquet::format::RowGroup& rowGroup, uint64_t colIdx,
+        storage::MemoryManager* mm)
+        : BasicColumnWriterState{rowGroup, colIdx}, estimatedDictPageSize{0},
+          estimatedRlePagesSize{0}, estimatedPlainSize{0},
+          overflowBuffer{std::make_unique<common::InMemOverflowBuffer>(mm)}, keyBitWidth{0} {}
+
+    // Analysis state.
+    uint64_t estimatedDictPageSize;
+    uint64_t estimatedRlePagesSize;
+    uint64_t estimatedPlainSize;
+
+    // Dictionary and accompanying string heap.
+    string_map_t<uint32_t> dictionary;
+    std::unique_ptr<common::InMemOverflowBuffer> overflowBuffer;
+    // key_bit_width== 0 signifies the chunk is written in plain encoding
+    uint32_t keyBitWidth;
+
+    bool isDictionaryEncoded() const { return keyBitWidth != 0; }
+};
+
+class StringWriterPageState : public ColumnWriterPageState {
+public:
+    explicit StringWriterPageState(uint32_t bitWidth, const string_map_t<uint32_t>& values)
+        : bitWidth(bitWidth), dictionary(values), encoder(bitWidth), writtenValue(false) {
+        KU_ASSERT(isDictionaryEncoded() || (bitWidth == 0 && dictionary.empty()));
+    }
+
+    inline bool isDictionaryEncoded() const { return bitWidth != 0; }
+    // If 0, we're writing a plain page.
+    uint32_t bitWidth;
+    const string_map_t<uint32_t>& dictionary;
+    RleBpEncoder encoder;
+    bool writtenValue;
+};
+
+class StringColumnWriter : public BasicColumnWriter {
+public:
+    StringColumnWriter(ParquetWriter& writer, uint64_t schemaIdx,
+        std::vector<std::string> schemaPath, uint64_t maxRepeat, uint64_t maxDefine,
+        bool canHaveNulls, storage::MemoryManager* mm)
+        : BasicColumnWriter(writer, schemaIdx, std::move(schemaPath), maxRepeat, maxDefine,
+              canHaveNulls),
+          mm{mm} {}
+
+public:
+    inline std::unique_ptr<ColumnWriterStatistics> initializeStatsState() override {
+        return std::make_unique<StringStatisticsState>();
+    }
+
+    std::unique_ptr<ColumnWriterState> initializeWriteState(
+        lbug_parquet::format::RowGroup& rowGroup) override;
+
+    inline bool hasAnalyze() override { return true; }
+
+    inline std::unique_ptr<ColumnWriterPageState> initializePageState(
+        BasicColumnWriterState& state_p) override {
+        auto& state = reinterpret_cast<StringColumnWriterState&>(state_p);
+        return std::make_unique<StringWriterPageState>(state.keyBitWidth, state.dictionary);
+    }
+
+    inline lbug_parquet::format::Encoding::type getEncoding(
+        BasicColumnWriterState& writerState) override {
+        auto& state = reinterpret_cast<StringColumnWriterState&>(writerState);
+        return state.isDictionaryEncoded() ? lbug_parquet::format::Encoding::RLE_DICTIONARY :
+                                             lbug_parquet::format::Encoding::PLAIN;
+    }
+
+    inline bool hasDictionary(BasicColumnWriterState& writerState) override {
+        auto& state = reinterpret_cast<StringColumnWriterState&>(writerState);
+        return state.isDictionaryEncoded();
+    }
+
+    inline uint64_t dictionarySize(BasicColumnWriterState& writerState) override {
+        auto& state = reinterpret_cast<StringColumnWriterState&>(writerState);
+        KU_ASSERT(state.isDictionaryEncoded());
+        return state.dictionary.size();
+    }
+
+    void analyze(ColumnWriterState& writerState, ColumnWriterState* parent,
+        common::ValueVector* vector, uint64_t count) override;
+
+    void finalizeAnalyze(ColumnWriterState& writerState) override;
+
+    void writeVector(common::Serializer& bufferedSerializer, ColumnWriterStatistics* statsToWrite,
+        ColumnWriterPageState* writerPageState, common::ValueVector* vector, uint64_t chunkStart,
+        uint64_t chunkEnd) override;
+
+    void flushPageState(common::Serializer& bufferedSerializer,
+        ColumnWriterPageState* writerPageState) override;
+
+    void flushDictionary(BasicColumnWriterState& writerState,
+        ColumnWriterStatistics* writerStats) override;
+
+    uint64_t getRowSize(common::ValueVector* vector, uint64_t index,
+        BasicColumnWriterState& writerState) override;
+
+private:
+    storage::MemoryManager* mm;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/struct_column_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/struct_column_writer.h
new file mode 100644
index 0000000000..97bafd0737
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/struct_column_writer.h
@@ -0,0 +1,44 @@
+#pragma once
+
+#include "processor/operator/persistent/writer/parquet/column_writer.h"
+
+namespace lbug {
+namespace processor {
+
+class StructColumnWriter : public ColumnWriter {
+public:
+    StructColumnWriter(ParquetWriter& writer, uint64_t schemaIdx, std::vector<std::string> schema,
+        uint64_t maxRepeat, uint64_t maxDefine,
+        std::vector<std::unique_ptr<ColumnWriter>> childWriter, bool canHaveNull)
+        : ColumnWriter{writer, schemaIdx, std::move(schema), maxRepeat, maxDefine, canHaveNull},
+          childWriters{std::move(childWriter)} {}
+
+    std::vector<std::unique_ptr<ColumnWriter>> childWriters;
+
+public:
+    std::unique_ptr<ColumnWriterState> initializeWriteState(
+        lbug_parquet::format::RowGroup& rowGroup) override;
+    bool hasAnalyze() override;
+    void analyze(ColumnWriterState& state, ColumnWriterState* parent, common::ValueVector* vector,
+        uint64_t count) override;
+    void finalizeAnalyze(ColumnWriterState& state) override;
+    void prepare(ColumnWriterState& state, ColumnWriterState* parent, common::ValueVector* vector,
+        uint64_t count) override;
+
+    void beginWrite(ColumnWriterState& state) override;
+    void write(ColumnWriterState& state, common::ValueVector* vector, uint64_t count) override;
+    void finalizeWrite(ColumnWriterState& state) override;
+};
+
+class StructColumnWriterState : public ColumnWriterState {
+public:
+    StructColumnWriterState(lbug_parquet::format::RowGroup& rowGroup, uint64_t colIdx)
+        : rowGroup(rowGroup), colIdx(colIdx) {}
+
+    lbug_parquet::format::RowGroup& rowGroup;
+    uint64_t colIdx;
+    std::vector<std::unique_ptr<ColumnWriterState>> childStates;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/uuid_column_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/uuid_column_writer.h
new file mode 100644
index 0000000000..87ea2406b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/persistent/writer/parquet/uuid_column_writer.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "basic_column_writer.h"
+#include "common/constants.h"
+
+namespace lbug {
+namespace processor {
+
+class UUIDColumnWriter : public BasicColumnWriter {
+public:
+    UUIDColumnWriter(ParquetWriter& writer, uint64_t schemaIdx, std::vector<std::string> schemaPath,
+        uint64_t maxRepeat, uint64_t maxDefine, bool canHaveNulls)
+        : BasicColumnWriter(writer, schemaIdx, std::move(schemaPath), maxRepeat, maxDefine,
+              canHaveNulls) {}
+
+public:
+    void writeVector(common::Serializer& bufferedSerializer, ColumnWriterStatistics* state,
+        ColumnWriterPageState* pageState, common::ValueVector* vector, uint64_t chunkStart,
+        uint64_t chunkEnd) override;
+
+    uint64_t getRowSize(common::ValueVector* /*vector*/, uint64_t /*index*/,
+        BasicColumnWriterState& /*state*/) override {
+        return common::ParquetConstants::PARQUET_UUID_SIZE;
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/physical_operator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/physical_operator.h
new file mode 100644
index 0000000000..795693987b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/physical_operator.h
@@ -0,0 +1,180 @@
+#pragma once
+
+#include "planner/operator/operator_print_info.h"
+#include "processor/result/result_set.h"
+
+namespace lbug::common {
+class Profiler;
+class NumericMetric;
+class TimeMetric;
+} // namespace lbug::common
+namespace lbug {
+namespace processor {
+struct ExecutionContext;
+
+using physical_op_id = uint32_t;
+
+enum class PhysicalOperatorType : uint8_t {
+    ALTER,
+    AGGREGATE,
+    AGGREGATE_FINALIZE,
+    AGGREGATE_SCAN,
+    ATTACH_DATABASE,
+    BATCH_INSERT,
+    COPY_TO,
+    CREATE_MACRO,
+    CREATE_SEQUENCE,
+    CREATE_TABLE,
+    CREATE_TYPE,
+    CROSS_PRODUCT,
+    DETACH_DATABASE,
+    DELETE_,
+    DROP,
+    DUMMY_SINK,
+    DUMMY_SIMPLE_SINK,
+    EMPTY_RESULT,
+    EXPORT_DATABASE,
+    EXTENSION_CLAUSE,
+    FILTER,
+    FLATTEN,
+    HASH_JOIN_BUILD,
+    HASH_JOIN_PROBE,
+    IMPORT_DATABASE,
+    INDEX_LOOKUP,
+    INSERT,
+    INTERSECT_BUILD,
+    INTERSECT,
+    INSTALL_EXTENSION,
+    LIMIT,
+    LOAD_EXTENSION,
+    MERGE,
+    MULTIPLICITY_REDUCER,
+    PARTITIONER,
+    PATH_PROPERTY_PROBE,
+    PRIMARY_KEY_SCAN_NODE_TABLE,
+    PROJECTION,
+    PROFILE,
+    RECURSIVE_EXTEND,
+    RESULT_COLLECTOR,
+    SCAN_NODE_TABLE,
+    SCAN_REL_TABLE,
+    SEMI_MASKER,
+    SET_PROPERTY,
+    SKIP,
+    STANDALONE_CALL,
+    TABLE_FUNCTION_CALL,
+    TOP_K,
+    TOP_K_SCAN,
+    TRANSACTION,
+    ORDER_BY,
+    ORDER_BY_MERGE,
+    ORDER_BY_SCAN,
+    UNION_ALL_SCAN,
+    UNWIND,
+    USE_DATABASE,
+    UNINSTALL_EXTENSION,
+};
+
+class PhysicalOperator;
+struct PhysicalOperatorUtils {
+    static std::string operatorToString(const PhysicalOperator* physicalOp);
+    LBUG_API static std::string operatorTypeToString(PhysicalOperatorType operatorType);
+};
+
+struct OperatorMetrics {
+    common::TimeMetric& executionTime;
+    common::NumericMetric& numOutputTuple;
+
+    OperatorMetrics(common::TimeMetric& executionTime, common::NumericMetric& numOutputTuple)
+        : executionTime{executionTime}, numOutputTuple{numOutputTuple} {}
+};
+
+using physical_op_vector_t = std::vector<std::unique_ptr<PhysicalOperator>>;
+
+class LBUG_API PhysicalOperator {
+public:
+    // Leaf operator
+    PhysicalOperator(PhysicalOperatorType operatorType, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : id{id}, operatorType{operatorType}, resultSet(nullptr), printInfo{std::move(printInfo)} {}
+    // Unary operator
+    PhysicalOperator(PhysicalOperatorType operatorType, std::unique_ptr<PhysicalOperator> child,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo);
+    // Binary operator
+    PhysicalOperator(PhysicalOperatorType operatorType, std::unique_ptr<PhysicalOperator> left,
+        std::unique_ptr<PhysicalOperator> right, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo);
+    PhysicalOperator(PhysicalOperatorType operatorType, physical_op_vector_t children,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo);
+
+    virtual ~PhysicalOperator() = default;
+
+    physical_op_id getOperatorID() const { return id; }
+
+    PhysicalOperatorType getOperatorType() const { return operatorType; }
+
+    virtual bool isSource() const { return false; }
+    virtual bool isSink() const { return false; }
+    virtual bool isParallel() const { return true; }
+
+    void addChild(std::unique_ptr<PhysicalOperator> op) { children.push_back(std::move(op)); }
+    PhysicalOperator* getChild(common::idx_t idx) const { return children[idx].get(); }
+    common::idx_t getNumChildren() const { return children.size(); }
+    std::unique_ptr<PhysicalOperator> moveUnaryChild();
+
+    // Global state is initialized once.
+    void initGlobalState(ExecutionContext* context);
+    // Local state is initialized for each thread.
+    void initLocalState(ResultSet* resultSet, ExecutionContext* context);
+
+    bool getNextTuple(ExecutionContext* context);
+
+    virtual void finalize(ExecutionContext* context);
+
+    std::unordered_map<std::string, std::string> getProfilerKeyValAttributes(
+        common::Profiler& profiler) const;
+    std::vector<std::string> getProfilerAttributes(common::Profiler& profiler) const;
+
+    const OPPrintInfo* getPrintInfo() const { return printInfo.get(); }
+
+    virtual std::unique_ptr<PhysicalOperator> copy() = 0;
+
+    virtual double getProgress(ExecutionContext* context) const;
+
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+protected:
+    virtual void initGlobalStateInternal(ExecutionContext* /*context*/) {}
+    virtual void initLocalStateInternal(ResultSet* /*resultSet_*/, ExecutionContext* /*context*/) {}
+    // Return false if no more tuples to pull, otherwise return true
+    virtual bool getNextTuplesInternal(ExecutionContext* context) = 0;
+
+    std::string getTimeMetricKey() const { return "time-" + std::to_string(id); }
+    std::string getNumTupleMetricKey() const { return "numTuple-" + std::to_string(id); }
+
+    void registerProfilingMetrics(common::Profiler* profiler);
+
+    double getExecutionTime(common::Profiler& profiler) const;
+    uint64_t getNumOutputTuples(common::Profiler& profiler) const;
+
+    virtual void finalizeInternal(ExecutionContext* /*context*/) {}
+
+protected:
+    physical_op_id id;
+    std::unique_ptr<OperatorMetrics> metrics;
+    PhysicalOperatorType operatorType;
+
+    physical_op_vector_t children;
+    ResultSet* resultSet;
+    std::unique_ptr<OPPrintInfo> printInfo;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/profile.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/profile.h
new file mode 100644
index 0000000000..0151387d84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/profile.h
@@ -0,0 +1,34 @@
+#pragma once
+
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+class PhysicalPlan;
+
+struct ProfileInfo {
+    PhysicalPlan* physicalPlan = nullptr;
+};
+
+class Profile final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::PROFILE;
+
+public:
+    Profile(ProfileInfo info, std::shared_ptr<FactorizedTable> messageTable, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)}, info{info} {}
+
+    void setPhysicalPlan(PhysicalPlan* physicalPlan) { info.physicalPlan = physicalPlan; }
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<Profile>(info, messageTable, id, printInfo->copy());
+    }
+
+private:
+    ProfileInfo info;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/projection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/projection.h
new file mode 100644
index 0000000000..7f23a5219f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/projection.h
@@ -0,0 +1,79 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct ProjectionPrintInfo final : OPPrintInfo {
+    binder::expression_vector expressions;
+
+    explicit ProjectionPrintInfo(binder::expression_vector expressions)
+        : expressions{std::move(expressions)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<ProjectionPrintInfo>(new ProjectionPrintInfo(*this));
+    }
+
+private:
+    ProjectionPrintInfo(const ProjectionPrintInfo& other)
+        : OPPrintInfo{other}, expressions{other.expressions} {}
+};
+
+struct ProjectionInfo {
+    std::vector<std::unique_ptr<evaluator::ExpressionEvaluator>> evaluators;
+    std::vector<DataPos> exprsOutputPos;
+    std::unordered_set<common::idx_t> activeChunkIndices;
+    std::unordered_set<common::idx_t> discardedChunkIndices;
+
+    ProjectionInfo() = default;
+    EXPLICIT_COPY_DEFAULT_MOVE(ProjectionInfo);
+
+    void addEvaluator(std::unique_ptr<evaluator::ExpressionEvaluator> evaluator,
+        const DataPos& outputPos) {
+        evaluators.push_back(std::move(evaluator));
+        exprsOutputPos.push_back(outputPos);
+        activeChunkIndices.insert(outputPos.dataChunkPos);
+    }
+
+private:
+    ProjectionInfo(const ProjectionInfo& other)
+        : evaluators{copyVector(other.evaluators)}, exprsOutputPos{other.exprsOutputPos},
+          activeChunkIndices{other.activeChunkIndices},
+          discardedChunkIndices{other.discardedChunkIndices} {}
+};
+
+class Projection final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::PROJECTION;
+
+public:
+    Projection(ProjectionInfo info, std::unique_ptr<PhysicalOperator> child, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator(type_, std::move(child), id, std::move(printInfo)),
+          info{std::move(info)}, prevMultiplicity{1} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<Projection>(info.copy(), children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    void saveMultiplicity() { prevMultiplicity = resultSet->multiplicity; }
+
+    void restoreMultiplicity() { resultSet->multiplicity = prevMultiplicity; }
+
+private:
+    ProjectionInfo info;
+    uint64_t prevMultiplicity;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/recursive_extend.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/recursive_extend.h
new file mode 100644
index 0000000000..b877c0df7d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/recursive_extend.h
@@ -0,0 +1,55 @@
+#pragma once
+
+#include "function/gds/rec_joins.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct RecursiveExtendPrintInfo final : OPPrintInfo {
+    std::string funcName;
+
+    explicit RecursiveExtendPrintInfo(std::string funcName) : funcName{std::move(funcName)} {}
+
+    std::string toString() const override { return funcName; }
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<RecursiveExtendPrintInfo>(new RecursiveExtendPrintInfo(*this));
+    }
+
+private:
+    RecursiveExtendPrintInfo(const RecursiveExtendPrintInfo& other)
+        : OPPrintInfo{other}, funcName{other.funcName} {}
+};
+
+class RecursiveExtend : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::RECURSIVE_EXTEND;
+
+public:
+    RecursiveExtend(std::unique_ptr<function::RJAlgorithm> function, function::RJBindData bindData,
+        std::shared_ptr<RecursiveExtendSharedState> sharedState, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, id, std::move(printInfo)}, function{std::move(function)}, bindData{bindData},
+          sharedState{std::move(sharedState)} {}
+
+    std::shared_ptr<RecursiveExtendSharedState> getSharedState() const { return sharedState; }
+
+    bool isSource() const override { return true; }
+
+    bool isParallel() const override { return false; }
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<RecursiveExtend>(function->copy(), bindData, sharedState, id,
+            printInfo->copy());
+    }
+
+private:
+    std::unique_ptr<function::RJAlgorithm> function;
+    function::RJBindData bindData;
+    std::shared_ptr<RecursiveExtendSharedState> sharedState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/recursive_extend_shared_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/recursive_extend_shared_state.h
new file mode 100644
index 0000000000..bd2a200ac2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/recursive_extend_shared_state.h
@@ -0,0 +1,50 @@
+#pragma once
+
+#include "common/counter.h"
+#include "common/mask.h"
+#include "graph/graph.h"
+#include "processor/result/factorized_table_pool.h"
+
+namespace lbug {
+namespace processor {
+
+struct RecursiveExtendSharedState {
+    std::unique_ptr<graph::Graph> graph;
+    std::unique_ptr<common::LimitCounter> counter = nullptr;
+
+    RecursiveExtendSharedState(std::shared_ptr<FactorizedTable> fTable,
+        std::unique_ptr<graph::Graph> graph, common::offset_t limitNumber)
+        : graph{std::move(graph)}, factorizedTablePool{std::move(fTable)} {
+        if (limitNumber != common::INVALID_LIMIT) {
+            counter = std::make_unique<common::LimitCounter>(limitNumber);
+        }
+    }
+
+    void setInputNodeMask(std::unique_ptr<common::NodeOffsetMaskMap> maskMap) {
+        inputNodeMask = std::move(maskMap);
+    }
+    common::NodeOffsetMaskMap* getInputNodeMaskMap() const { return inputNodeMask.get(); }
+
+    void setOutputNodeMask(std::unique_ptr<common::NodeOffsetMaskMap> maskMap) {
+        outputNodeMask = std::move(maskMap);
+    }
+    common::NodeOffsetMaskMap* getOutputNodeMaskMap() const { return outputNodeMask.get(); }
+
+    void setPathNodeMask(std::unique_ptr<common::NodeOffsetMaskMap> maskMap) {
+        pathNodeMask = std::move(maskMap);
+    }
+    common::NodeOffsetMaskMap* getPathNodeMaskMap() const { return pathNodeMask.get(); }
+
+    bool exceedLimit() const { return !(counter == nullptr) && counter->exceedLimit(); }
+
+public:
+    FactorizedTablePool factorizedTablePool;
+
+private:
+    std::unique_ptr<common::NodeOffsetMaskMap> inputNodeMask = nullptr;
+    std::unique_ptr<common::NodeOffsetMaskMap> outputNodeMask = nullptr;
+    std::unique_ptr<common::NodeOffsetMaskMap> pathNodeMask = nullptr;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/result_collector.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/result_collector.h
new file mode 100644
index 0000000000..4c91b83655
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/result_collector.h
@@ -0,0 +1,107 @@
+#pragma once
+
+#include <mutex>
+
+#include "binder/expression/expression.h"
+#include "common/enums/accumulate_type.h"
+#include "processor/operator/sink.h"
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace processor {
+
+class ResultCollectorSharedState {
+public:
+    explicit ResultCollectorSharedState(std::shared_ptr<FactorizedTable> table)
+        : table{std::move(table)} {}
+
+    void mergeLocalTable(FactorizedTable& localTable) {
+        std::unique_lock lck{mtx};
+        table->merge(localTable);
+    }
+
+    std::shared_ptr<FactorizedTable> getTable() { return table; }
+
+private:
+    std::mutex mtx;
+    std::shared_ptr<FactorizedTable> table;
+};
+
+struct ResultCollectorInfo {
+    common::AccumulateType accumulateType;
+    FactorizedTableSchema tableSchema;
+    std::vector<DataPos> payloadPositions;
+
+    ResultCollectorInfo(common::AccumulateType accumulateType, FactorizedTableSchema tableSchema,
+        std::vector<DataPos> payloadPositions)
+        : accumulateType{accumulateType}, tableSchema{std::move(tableSchema)},
+          payloadPositions{std::move(payloadPositions)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ResultCollectorInfo);
+
+private:
+    ResultCollectorInfo(const ResultCollectorInfo& other)
+        : accumulateType{other.accumulateType}, tableSchema{other.tableSchema.copy()},
+          payloadPositions{other.payloadPositions} {}
+};
+
+struct ResultCollectorPrintInfo final : OPPrintInfo {
+    binder::expression_vector expressions;
+    common::AccumulateType accumulateType;
+
+    ResultCollectorPrintInfo(binder::expression_vector expressions,
+        common::AccumulateType accumulateType)
+        : expressions{std::move(expressions)}, accumulateType{accumulateType} {}
+    ResultCollectorPrintInfo(const ResultCollectorPrintInfo& other)
+        : OPPrintInfo{other}, expressions{other.expressions}, accumulateType{other.accumulateType} {
+    }
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::make_unique<ResultCollectorPrintInfo>(*this);
+    }
+};
+
+class ResultCollector final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::RESULT_COLLECTOR;
+
+public:
+    ResultCollector(ResultCollectorInfo info,
+        std::shared_ptr<ResultCollectorSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{type_, std::move(child), id, std::move(printInfo)}, info{std::move(info)},
+          sharedState{std::move(sharedState)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    void finalizeInternal(ExecutionContext* context) override;
+
+    std::shared_ptr<FactorizedTable> getResultFTable() const override {
+        return sharedState->getTable();
+    }
+
+    std::unique_ptr<main::QueryResult> getQueryResult() const override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<ResultCollector>(info.copy(), sharedState, children[0]->copy(), id,
+            printInfo->copy());
+    }
+
+private:
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void initNecessaryLocalState(ResultSet* resultSet, ExecutionContext* context);
+
+private:
+    ResultCollectorInfo info;
+    std::shared_ptr<ResultCollectorSharedState> sharedState;
+    std::vector<common::ValueVector*> payloadVectors;
+    std::vector<common::ValueVector*> payloadAndMarkVectors;
+
+    std::unique_ptr<common::ValueVector> markVector;
+    std::unique_ptr<FactorizedTable> localTable;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/primary_key_scan_node_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/primary_key_scan_node_table.h
new file mode 100644
index 0000000000..a27d1c48f6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/primary_key_scan_node_table.h
@@ -0,0 +1,73 @@
+#pragma once
+
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/operator/scan/scan_node_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct PrimaryKeyScanPrintInfo final : OPPrintInfo {
+    binder::expression_vector expressions;
+    std::string key;
+    std::string alias;
+
+    PrimaryKeyScanPrintInfo(binder::expression_vector expressions, std::string key,
+        std::string alias)
+        : expressions(std::move(expressions)), key(std::move(key)), alias{std::move(alias)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<PrimaryKeyScanPrintInfo>(new PrimaryKeyScanPrintInfo(*this));
+    }
+
+private:
+    PrimaryKeyScanPrintInfo(const PrimaryKeyScanPrintInfo& other)
+        : OPPrintInfo(other), expressions(other.expressions), alias(other.alias) {}
+};
+
+struct PrimaryKeyScanSharedState {
+    std::mutex mtx;
+
+    common::idx_t numTables;
+    common::idx_t cursor;
+
+    explicit PrimaryKeyScanSharedState(common::idx_t numTables) : numTables{numTables}, cursor{0} {}
+
+    common::idx_t getTableIdx();
+};
+
+class PrimaryKeyScanNodeTable : public ScanTable {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::PRIMARY_KEY_SCAN_NODE_TABLE;
+
+public:
+    PrimaryKeyScanNodeTable(ScanOpInfo opInfo, std::vector<ScanNodeTableInfo> tableInfos,
+        std::unique_ptr<evaluator::ExpressionEvaluator> indexEvaluator,
+        std::shared_ptr<PrimaryKeyScanSharedState> sharedState, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : ScanTable{type_, std::move(opInfo), id, std::move(printInfo)}, scanState{nullptr},
+          tableInfos{std::move(tableInfos)}, indexEvaluator{std::move(indexEvaluator)},
+          sharedState{std::move(sharedState)} {}
+
+    bool isSource() const override { return true; }
+
+    void initLocalStateInternal(ResultSet*, ExecutionContext*) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    bool isParallel() const override { return false; }
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<PrimaryKeyScanNodeTable>(opInfo.copy(), copyVector(tableInfos),
+            indexEvaluator->copy(), sharedState, id, printInfo->copy());
+    }
+
+private:
+    std::unique_ptr<storage::NodeTableScanState> scanState;
+    std::vector<ScanNodeTableInfo> tableInfos;
+    std::unique_ptr<evaluator::ExpressionEvaluator> indexEvaluator;
+    std::shared_ptr<PrimaryKeyScanSharedState> sharedState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_multi_rel_tables.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_multi_rel_tables.h
new file mode 100644
index 0000000000..4cf70685e7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_multi_rel_tables.h
@@ -0,0 +1,93 @@
+#pragma once
+
+#include "processor/operator/scan/scan_rel_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct DirectionInfo {
+    bool extendFromSource;
+    DataPos directionPos;
+
+    DirectionInfo() : extendFromSource{false}, directionPos{DataPos::getInvalidPos()} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(DirectionInfo);
+
+    bool needFlip(common::RelDataDirection relDataDirection) const;
+
+private:
+    DirectionInfo(const DirectionInfo& other)
+        : extendFromSource{other.extendFromSource}, directionPos{other.directionPos} {}
+};
+
+class RelTableCollectionScanner {
+    friend class ScanMultiRelTable;
+
+public:
+    explicit RelTableCollectionScanner(std::vector<ScanRelTableInfo> relInfos)
+        : relInfos{std::move(relInfos)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(RelTableCollectionScanner);
+
+    bool empty() const { return relInfos.empty(); }
+
+    void resetState() {
+        currentTableIdx = 0;
+        nextTableIdx = 0;
+    }
+
+    void addRelInfos(std::vector<ScanRelTableInfo> relInfos_) {
+        for (auto& relInfo : relInfos_) {
+            relInfos.push_back(std::move(relInfo));
+        }
+    }
+
+    bool scan(main::ClientContext* context, storage::RelTableScanState& scanState,
+        const std::vector<common::ValueVector*>& outVectors);
+
+private:
+    RelTableCollectionScanner(const RelTableCollectionScanner& other)
+        : relInfos{copyVector(other.relInfos)} {}
+
+private:
+    std::vector<ScanRelTableInfo> relInfos;
+    std::vector<bool> directionValues;
+    common::ValueVector* directionVector = nullptr;
+    common::idx_t currentTableIdx = common::INVALID_IDX;
+    uint32_t nextTableIdx = 0;
+};
+
+class ScanMultiRelTable final : public ScanTable {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::SCAN_REL_TABLE;
+
+public:
+    ScanMultiRelTable(ScanOpInfo info, DirectionInfo directionInfo,
+        common::table_id_map_t<RelTableCollectionScanner> scanners,
+        std::unique_ptr<PhysicalOperator> child, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : ScanTable{type_, std::move(info), std::move(child), id, std::move(printInfo)},
+          directionInfo{std::move(directionInfo)}, scanState{nullptr}, boundNodeIDVector{nullptr},
+          scanners{std::move(scanners)}, currentScanner{nullptr} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<ScanMultiRelTable>(opInfo.copy(), directionInfo.copy(),
+            copyUnorderedMap(scanners), children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    void resetState();
+    void initCurrentScanner(const common::nodeID_t& nodeID);
+
+private:
+    DirectionInfo directionInfo;
+    std::unique_ptr<storage::RelTableScanState> scanState;
+
+    common::ValueVector* boundNodeIDVector;
+    common::table_id_map_t<RelTableCollectionScanner> scanners;
+    RelTableCollectionScanner* currentScanner;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_node_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_node_table.h
new file mode 100644
index 0000000000..0ca38bd6c8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_node_table.h
@@ -0,0 +1,126 @@
+#pragma once
+
+#include "processor/operator/scan/scan_table.h"
+#include "storage/predicate/column_predicate.h"
+#include "storage/table/node_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct ScanNodeTableProgressSharedState {
+    std::atomic<common::node_group_idx_t> numGroupsScanned;
+    common::node_group_idx_t numGroups;
+
+    ScanNodeTableProgressSharedState() : numGroupsScanned{0}, numGroups{0} {};
+};
+
+class ScanNodeTableSharedState {
+public:
+    explicit ScanNodeTableSharedState(std::unique_ptr<common::SemiMask> semiMask)
+        : table{nullptr}, currentCommittedGroupIdx{common::INVALID_NODE_GROUP_IDX},
+          currentUnCommittedGroupIdx{common::INVALID_NODE_GROUP_IDX}, numCommittedNodeGroups{0},
+          numUnCommittedNodeGroups{0}, semiMask{std::move(semiMask)} {};
+
+    void initialize(const transaction::Transaction* transaction, storage::NodeTable* table,
+        ScanNodeTableProgressSharedState& progressSharedState);
+
+    void nextMorsel(storage::NodeTableScanState& scanState,
+        ScanNodeTableProgressSharedState& progressSharedState);
+
+    common::SemiMask* getSemiMask() const { return semiMask.get(); }
+
+private:
+    std::mutex mtx;
+    storage::NodeTable* table;
+    common::node_group_idx_t currentCommittedGroupIdx;
+    common::node_group_idx_t currentUnCommittedGroupIdx;
+    common::node_group_idx_t numCommittedNodeGroups;
+    common::node_group_idx_t numUnCommittedNodeGroups;
+    std::unique_ptr<common::SemiMask> semiMask;
+};
+
+struct ScanNodeTablePrintInfo final : OPPrintInfo {
+    std::vector<std::string> tableNames;
+    std::string alias;
+    binder::expression_vector properties;
+
+    ScanNodeTablePrintInfo(std::vector<std::string> tableNames, std::string alias,
+        binder::expression_vector properties)
+        : tableNames{std::move(tableNames)}, alias{std::move(alias)},
+          properties{std::move(properties)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<ScanNodeTablePrintInfo>(new ScanNodeTablePrintInfo(*this));
+    }
+
+private:
+    ScanNodeTablePrintInfo(const ScanNodeTablePrintInfo& other)
+        : OPPrintInfo{other}, tableNames{other.tableNames}, alias{other.alias},
+          properties{other.properties} {}
+};
+
+struct ScanNodeTableInfo : ScanTableInfo {
+    ScanNodeTableInfo(storage::Table* table,
+        std::vector<storage::ColumnPredicateSet> columnPredicates)
+        : ScanTableInfo{table, std::move(columnPredicates)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ScanNodeTableInfo);
+
+    void initScanState(storage::TableScanState& scanState,
+        const std::vector<common::ValueVector*>& outVectors, main::ClientContext* context) override;
+
+private:
+    ScanNodeTableInfo(const ScanNodeTableInfo& other) : ScanTableInfo{other} {}
+};
+
+class ScanNodeTable final : public ScanTable {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::SCAN_NODE_TABLE;
+
+public:
+    ScanNodeTable(ScanOpInfo opInfo, std::vector<ScanNodeTableInfo> tableInfos,
+        std::vector<std::shared_ptr<ScanNodeTableSharedState>> sharedStates, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo,
+        std::shared_ptr<ScanNodeTableProgressSharedState> progressSharedState)
+        : ScanTable{type_, std::move(opInfo), id, std::move(printInfo)}, currentTableIdx{0},
+          scanState{nullptr}, tableInfos{std::move(tableInfos)},
+          sharedStates{std::move(sharedStates)},
+          progressSharedState{std::move(progressSharedState)} {
+        KU_ASSERT(this->tableInfos.size() == this->sharedStates.size());
+    }
+
+    common::table_id_map_t<common::SemiMask*> getSemiMasks() const;
+
+    bool isSource() const override { return true; }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    const ScanNodeTableSharedState& getSharedState(common::idx_t idx) const {
+        KU_ASSERT(idx < sharedStates.size());
+        return *sharedStates[idx];
+    }
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<ScanNodeTable>(opInfo.copy(), copyVector(tableInfos), sharedStates,
+            id, printInfo->copy(), progressSharedState);
+    }
+
+    double getProgress(ExecutionContext* context) const override;
+
+private:
+    void initGlobalStateInternal(ExecutionContext* context) override;
+
+    void initCurrentTable(ExecutionContext* context);
+
+private:
+    common::idx_t currentTableIdx;
+    std::unique_ptr<storage::NodeTableScanState> scanState;
+    std::vector<ScanNodeTableInfo> tableInfos;
+    std::vector<std::shared_ptr<ScanNodeTableSharedState>> sharedStates;
+    std::shared_ptr<ScanNodeTableProgressSharedState> progressSharedState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_rel_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_rel_table.h
new file mode 100644
index 0000000000..004d6db60e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_rel_table.h
@@ -0,0 +1,87 @@
+#pragma once
+
+#include "binder/expression/rel_expression.h"
+#include "common/enums/extend_direction.h"
+#include "processor/operator/scan/scan_table.h"
+#include "storage/predicate/column_predicate.h"
+#include "storage/table/rel_table.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+}
+namespace processor {
+
+struct ScanRelTableInfo : ScanTableInfo {
+    common::RelDataDirection direction;
+
+    ScanRelTableInfo(storage::Table* table,
+        std::vector<storage::ColumnPredicateSet> columnPredicates,
+        common::RelDataDirection direction)
+        : ScanTableInfo{table, std::move(columnPredicates)}, direction{direction} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ScanRelTableInfo);
+
+    void initScanState(storage::TableScanState& scanState,
+        const std::vector<common::ValueVector*>& outVectors, main::ClientContext* context) override;
+
+private:
+    ScanRelTableInfo(const ScanRelTableInfo& other)
+        : ScanTableInfo{other}, direction{other.direction} {}
+};
+
+struct ScanRelTablePrintInfo final : OPPrintInfo {
+    std::vector<std::string> tableNames;
+    binder::expression_vector properties;
+    std::shared_ptr<binder::NodeExpression> boundNode;
+    std::shared_ptr<binder::RelExpression> rel;
+    std::shared_ptr<binder::NodeExpression> nbrNode;
+    common::ExtendDirection direction;
+    std::string alias;
+
+    ScanRelTablePrintInfo(std::vector<std::string> tableNames, binder::expression_vector properties,
+        std::shared_ptr<binder::NodeExpression> boundNode,
+        std::shared_ptr<binder::RelExpression> rel, std::shared_ptr<binder::NodeExpression> nbrNode,
+        common::ExtendDirection direction, std::string alias)
+        : tableNames{std::move(tableNames)}, properties{std::move(properties)},
+          boundNode{std::move(boundNode)}, rel{std::move(rel)}, nbrNode{std::move(nbrNode)},
+          direction{direction}, alias{std::move(alias)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<ScanRelTablePrintInfo>(new ScanRelTablePrintInfo(*this));
+    }
+
+private:
+    ScanRelTablePrintInfo(const ScanRelTablePrintInfo& other)
+        : OPPrintInfo{other}, tableNames{other.tableNames}, properties{other.properties},
+          boundNode{other.boundNode}, rel{other.rel}, nbrNode{other.nbrNode},
+          direction{other.direction}, alias{other.alias} {}
+};
+
+class ScanRelTable final : public ScanTable {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::SCAN_REL_TABLE;
+
+public:
+    ScanRelTable(ScanOpInfo info, ScanRelTableInfo tableInfo,
+        std::unique_ptr<PhysicalOperator> child, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : ScanTable{type_, std::move(info), std::move(child), id, std::move(printInfo)},
+          tableInfo{std::move(tableInfo)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<ScanRelTable>(opInfo.copy(), tableInfo.copy(), children[0]->copy(),
+            id, printInfo->copy());
+    }
+
+protected:
+    ScanRelTableInfo tableInfo;
+    std::unique_ptr<storage::RelTableScanState> scanState;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_table.h
new file mode 100644
index 0000000000..28e7c696da
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/scan/scan_table.h
@@ -0,0 +1,112 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "processor/operator/physical_operator.h"
+#include "storage/table/table.h"
+
+namespace lbug {
+namespace processor {
+
+struct ScanOpInfo {
+    // Node ID vector position.
+    DataPos nodeIDPos;
+    // Output vector (properties or CSRs) positions
+    std::vector<DataPos> outVectorsPos;
+
+    ScanOpInfo(DataPos nodeIDPos, std::vector<DataPos> outVectorsPos)
+        : nodeIDPos{nodeIDPos}, outVectorsPos{std::move(outVectorsPos)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ScanOpInfo);
+
+private:
+    ScanOpInfo(const ScanOpInfo& other)
+        : nodeIDPos{other.nodeIDPos}, outVectorsPos{other.outVectorsPos} {}
+};
+
+// For multi-table scan, a column with the same name could be of different types. In such case,
+// we scan the original type from storage and then cast at operator level
+class ColumnCaster {
+public:
+    explicit ColumnCaster(common::LogicalType columnType) : columnType{std::move(columnType)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ColumnCaster);
+
+    void setCastExpr(std::shared_ptr<binder::Expression> expr) { castExpr = std::move(expr); }
+    bool hasCast() const { return castExpr != nullptr; }
+
+    // Generate temporary vectors for scanning
+    void init(common::ValueVector* vectorAfterCasting, storage::MemoryManager* memoryManager);
+    // Get temporary vector for scanning. This vector has the same data type as column.
+    common::ValueVector* getVectorBeforeCasting() const { return vectorBeforeCasting.get(); }
+
+    void cast();
+
+private:
+    ColumnCaster(const ColumnCaster& other)
+        : columnType{other.columnType.copy()}, castExpr{other.castExpr} {}
+
+    common::LogicalType columnType;
+    std::shared_ptr<binder::Expression> castExpr;
+
+    // vector for scanning; same data type as column
+    std::shared_ptr<common::ValueVector> vectorBeforeCasting = nullptr;
+    // vector after casting. This should be the vector in result set so we don't manage its life
+    // cycle
+    common::ValueVector* vectorAfterCasting = nullptr;
+
+    std::vector<std::shared_ptr<common::ValueVector>> funcInputVectors;
+    std::vector<common::SelectionVector*> funcInputSelVectors;
+};
+
+struct ScanTableInfo {
+    storage::Table* table;
+
+    ScanTableInfo(storage::Table* table, std::vector<storage::ColumnPredicateSet> columnPredicates)
+        : table{table}, columnPredicates{std::move(columnPredicates)} {}
+    virtual ~ScanTableInfo() = default;
+
+    void addColumnInfo(common::column_id_t columnID, ColumnCaster caster);
+
+    virtual void initScanState(storage::TableScanState& scanState,
+        const std::vector<common::ValueVector*>& outVectors, main::ClientContext* context) = 0;
+
+    void castColumns();
+
+protected:
+    ScanTableInfo(const ScanTableInfo& other)
+        : table{other.table}, columnIDs{other.columnIDs},
+          columnPredicates{copyVector(other.columnPredicates)},
+          columnCasters{copyVector(other.columnCasters)}, hasColumnCaster{other.hasColumnCaster} {}
+
+    void initScanStateVectors(storage::TableScanState& scanState,
+        const std::vector<common::ValueVector*>& outVectors, storage::MemoryManager* memoryManager);
+
+    // Column ids to scan
+    std::vector<common::column_id_t> columnIDs;
+    // Column predicates for zone map
+    std::vector<storage::ColumnPredicateSet> columnPredicates;
+    // Column cast handler for multi table scan of the same column name but different type
+    std::vector<ColumnCaster> columnCasters;
+    bool hasColumnCaster = false;
+};
+
+class ScanTable : public PhysicalOperator {
+public:
+    ScanTable(PhysicalOperatorType operatorType, ScanOpInfo info,
+        std::unique_ptr<PhysicalOperator> child, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{operatorType, std::move(child), id, std::move(printInfo)},
+          opInfo{std::move(info)} {}
+
+    ScanTable(PhysicalOperatorType operatorType, ScanOpInfo info, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{operatorType, id, std::move(printInfo)}, opInfo{std::move(info)} {}
+
+protected:
+    void initLocalStateInternal(ResultSet*, ExecutionContext*) override;
+
+protected:
+    ScanOpInfo opInfo;
+    std::vector<common::ValueVector*> outVectors;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/semi_masker.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/semi_masker.h
new file mode 100644
index 0000000000..f008ae5556
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/semi_masker.h
@@ -0,0 +1,213 @@
+#pragma once
+
+#include <mutex>
+
+#include "common/enums/extend_direction.h"
+#include "common/mask.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+class BaseSemiMasker;
+
+struct SemiMaskerLocalState {
+    common::table_id_map_t<std::unique_ptr<common::SemiMask>> localMasksPerTable;
+    common::SemiMask* singleTableRef = nullptr;
+
+    void maskSingleTable(common::offset_t offset) const { singleTableRef->mask(offset); }
+    void maskMultiTable(common::nodeID_t nodeID) const {
+        KU_ASSERT(localMasksPerTable.contains(nodeID.tableID));
+        localMasksPerTable.at(nodeID.tableID)->mask(nodeID.offset);
+    }
+};
+
+class SemiMaskerSharedState {
+public:
+    explicit SemiMaskerSharedState(
+        common::table_id_map_t<std::vector<common::SemiMask*>> masksPerTable)
+        : masksPerTable{std::move(masksPerTable)} {}
+
+    SemiMaskerLocalState* appendLocalState();
+
+    void mergeToGlobal();
+
+private:
+    common::table_id_map_t<std::vector<common::SemiMask*>> masksPerTable;
+    std::vector<std::shared_ptr<SemiMaskerLocalState>> localInfos;
+    std::mutex mtx;
+};
+
+struct SemiMaskerPrintInfo final : OPPrintInfo {
+    std::vector<std::string> operatorNames;
+
+    explicit SemiMaskerPrintInfo(std::vector<std::string> operatorNames)
+        : operatorNames{std::move(operatorNames)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<SemiMaskerPrintInfo>(new SemiMaskerPrintInfo(*this));
+    }
+
+private:
+    SemiMaskerPrintInfo(const SemiMaskerPrintInfo& other)
+        : OPPrintInfo{other}, operatorNames{other.operatorNames} {}
+};
+
+class BaseSemiMasker : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::SEMI_MASKER;
+
+protected:
+    BaseSemiMasker(DataPos keyPos, std::shared_ptr<SemiMaskerSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)}, keyPos{keyPos},
+          keyVector{nullptr}, sharedState{std::move(sharedState)}, localState{nullptr} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    void finalizeInternal(ExecutionContext* context) final;
+
+protected:
+    DataPos keyPos;
+    common::ValueVector* keyVector;
+    std::shared_ptr<SemiMaskerSharedState> sharedState;
+    SemiMaskerLocalState* localState;
+};
+
+class SingleTableSemiMasker final : public BaseSemiMasker {
+public:
+    SingleTableSemiMasker(DataPos keyPos, std::shared_ptr<SemiMaskerSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : BaseSemiMasker{keyPos, std::move(sharedState), std::move(child), id,
+              std::move(printInfo)} {}
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<SingleTableSemiMasker>(keyPos, sharedState, children[0]->copy(), id,
+            printInfo->copy());
+    }
+};
+
+class MultiTableSemiMasker final : public BaseSemiMasker {
+public:
+    MultiTableSemiMasker(DataPos keyPos, std::shared_ptr<SemiMaskerSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : BaseSemiMasker{keyPos, std::move(sharedState), std::move(child), id,
+              std::move(printInfo)} {}
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<MultiTableSemiMasker>(keyPos, sharedState, children[0]->copy(), id,
+            printInfo->copy());
+    }
+};
+
+class NodeIDsSemiMask : public BaseSemiMasker {
+protected:
+    NodeIDsSemiMask(DataPos keyPos, DataPos srcNodeIDPos, DataPos dstNodeIDPos,
+        std::shared_ptr<SemiMaskerSharedState> sharedState, std::unique_ptr<PhysicalOperator> child,
+        uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+        : BaseSemiMasker{keyPos, std::move(sharedState), std::move(child), id,
+              std::move(printInfo)},
+          srcNodeIDPos{srcNodeIDPos}, dstNodeIDPos{dstNodeIDPos} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) final;
+
+protected:
+    DataPos srcNodeIDPos;
+    DataPos dstNodeIDPos;
+
+    common::ValueVector* srcNodeIDVector = nullptr;
+    common::ValueVector* dstNodeIDVector = nullptr;
+};
+
+class NodeIDsSingleTableSemiMasker final : public NodeIDsSemiMask {
+public:
+    NodeIDsSingleTableSemiMasker(DataPos keyPos, DataPos srcNodeIDPos, DataPos dstNodeIDPos,
+        std::shared_ptr<SemiMaskerSharedState> sharedState, std::unique_ptr<PhysicalOperator> child,
+        uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+        : NodeIDsSemiMask{keyPos, srcNodeIDPos, dstNodeIDPos, std::move(sharedState),
+              std::move(child), id, std::move(printInfo)} {}
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<NodeIDsSingleTableSemiMasker>(keyPos, srcNodeIDPos, dstNodeIDPos,
+            sharedState, children[0]->copy(), id, printInfo->copy());
+    }
+};
+
+class NodeIDsMultipleTableSemiMasker final : public NodeIDsSemiMask {
+public:
+    NodeIDsMultipleTableSemiMasker(DataPos keyPos, DataPos srcNodeIDPos, DataPos dstNodeIDPos,
+        std::shared_ptr<SemiMaskerSharedState> sharedState, std::unique_ptr<PhysicalOperator> child,
+        uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+        : NodeIDsSemiMask{keyPos, srcNodeIDPos, dstNodeIDPos, std::move(sharedState),
+              std::move(child), id, std::move(printInfo)} {}
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<NodeIDsMultipleTableSemiMasker>(keyPos, srcNodeIDPos, dstNodeIDPos,
+            sharedState, children[0]->copy(), id, printInfo->copy());
+    }
+};
+
+class PathSemiMasker : public BaseSemiMasker {
+protected:
+    PathSemiMasker(DataPos keyPos, std::shared_ptr<SemiMaskerSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo, common::ExtendDirection direction)
+        : BaseSemiMasker{keyPos, std::move(sharedState), std::move(child), id,
+              std::move(printInfo)},
+          direction{direction} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) final;
+
+protected:
+    common::ValueVector* pathRelsVector = nullptr;
+    common::ValueVector* pathRelsSrcIDDataVector = nullptr;
+    common::ValueVector* pathRelsDstIDDataVector = nullptr;
+    common::ExtendDirection direction;
+};
+
+class PathSingleTableSemiMasker final : public PathSemiMasker {
+public:
+    PathSingleTableSemiMasker(DataPos keyPos, std::shared_ptr<SemiMaskerSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo, common::ExtendDirection direction)
+        : PathSemiMasker{keyPos, std::move(sharedState), std::move(child), id, std::move(printInfo),
+              direction} {}
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<PathSingleTableSemiMasker>(keyPos, sharedState, children[0]->copy(),
+            id, printInfo->copy(), direction);
+    }
+};
+
+class PathMultipleTableSemiMasker final : public PathSemiMasker {
+public:
+    PathMultipleTableSemiMasker(DataPos keyPos, std::shared_ptr<SemiMaskerSharedState> sharedState,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo, common::ExtendDirection direction)
+        : PathSemiMasker{keyPos, std::move(sharedState), std::move(child), id, std::move(printInfo),
+              direction} {}
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<PathMultipleTableSemiMasker>(keyPos, sharedState,
+            children[0]->copy(), id, printInfo->copy(), direction);
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/attach_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/attach_database.h
new file mode 100644
index 0000000000..e510bd3e64
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/attach_database.h
@@ -0,0 +1,47 @@
+#pragma once
+
+#include "binder/bound_attach_info.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct AttachDatabasePrintInfo final : OPPrintInfo {
+    std::string dbName;
+    std::string dbPath;
+
+    AttachDatabasePrintInfo(std::string dbName, std::string dbPath)
+        : dbName{std::move(dbName)}, dbPath{std::move(dbPath)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<AttachDatabasePrintInfo>(new AttachDatabasePrintInfo(*this));
+    }
+
+private:
+    AttachDatabasePrintInfo(const AttachDatabasePrintInfo& other)
+        : OPPrintInfo{other}, dbName{other.dbName}, dbPath{other.dbPath} {}
+};
+
+class AttachDatabase final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::ATTACH_DATABASE;
+
+public:
+    AttachDatabase(binder::AttachInfo attachInfo, std::shared_ptr<FactorizedTable> messageTable,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          attachInfo{std::move(attachInfo)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<AttachDatabase>(attachInfo, messageTable, id, printInfo->copy());
+    }
+
+private:
+    binder::AttachInfo attachInfo;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/detach_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/detach_database.h
new file mode 100644
index 0000000000..d145b884a0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/detach_database.h
@@ -0,0 +1,44 @@
+#pragma once
+
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct DetatchDatabasePrintInfo final : OPPrintInfo {
+    std::string name;
+
+    explicit DetatchDatabasePrintInfo(std::string name) : name{std::move(name)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<DetatchDatabasePrintInfo>(new DetatchDatabasePrintInfo(*this));
+    }
+
+private:
+    DetatchDatabasePrintInfo(const DetatchDatabasePrintInfo& other)
+        : OPPrintInfo{other}, name{other.name} {}
+};
+
+class DetachDatabase final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::DETACH_DATABASE;
+
+public:
+    DetachDatabase(std::string dbName, std::shared_ptr<FactorizedTable> messageTable,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          dbName{std::move(dbName)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<DetachDatabase>(dbName, messageTable, id, printInfo->copy());
+    }
+
+private:
+    std::string dbName;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/export_db.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/export_db.h
new file mode 100644
index 0000000000..d6d1a4fa9b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/export_db.h
@@ -0,0 +1,60 @@
+#pragma once
+
+#include "common/copier_config/file_scan_info.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct ExportDBSharedState final {
+    std::unordered_map<std::string, const std::atomic<bool>*> canUseParallelReader;
+};
+
+struct ExportDBPrintInfo final : OPPrintInfo {
+    std::string filePath;
+    common::case_insensitive_map_t<common::Value> options;
+
+    ExportDBPrintInfo(std::string filePath, common::case_insensitive_map_t<common::Value> options)
+        : filePath{std::move(filePath)}, options{std::move(options)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<ExportDBPrintInfo>(new ExportDBPrintInfo(*this));
+    }
+
+private:
+    ExportDBPrintInfo(const ExportDBPrintInfo& other)
+        : OPPrintInfo{other}, filePath{other.filePath}, options{other.options} {}
+};
+
+class ExportDB final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::EXPORT_DATABASE;
+
+public:
+    ExportDB(common::FileScanInfo boundFileInfo, bool schemaOnly,
+        std::shared_ptr<FactorizedTable> messageTable, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo,
+        std::shared_ptr<ExportDBSharedState> sharedState = std::make_shared<ExportDBSharedState>())
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          boundFileInfo{std::move(boundFileInfo)}, schemaOnly{schemaOnly},
+          sharedState{std::move(sharedState)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<ExportDB>(boundFileInfo.copy(), schemaOnly, messageTable, id,
+            printInfo->copy(), sharedState);
+    }
+
+    void addToParallelReaderMap(const std::string& file, const std::atomic<bool>& parallelFlag) {
+        sharedState->canUseParallelReader.insert({file, &parallelFlag});
+    }
+
+private:
+    common::FileScanInfo boundFileInfo;
+    bool schemaOnly;
+    std::shared_ptr<ExportDBSharedState> sharedState = nullptr;
+};
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/extension_print_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/extension_print_info.h
new file mode 100644
index 0000000000..00cf3bf4bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/extension_print_info.h
@@ -0,0 +1,16 @@
+#pragma once
+
+#include "planner/operator/operator_print_info.h"
+
+namespace lbug {
+namespace processor {
+
+struct ExtensionPrintInfo : OPPrintInfo {
+    std::string extensionName;
+
+    explicit ExtensionPrintInfo(std::string extensionName)
+        : extensionName{std::move(extensionName)} {}
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/import_db.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/import_db.h
new file mode 100644
index 0000000000..0cf5785c17
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/import_db.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+class ImportDB final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::IMPORT_DATABASE;
+
+public:
+    ImportDB(std::string query, std::string indexQuery,
+        std::shared_ptr<FactorizedTable> messageTable, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          query{std::move(query)}, indexQuery{std::move(indexQuery)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<ImportDB>(query, indexQuery, messageTable, id, printInfo->copy());
+    }
+
+private:
+    std::string query;
+    std::string indexQuery;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/install_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/install_extension.h
new file mode 100644
index 0000000000..19f319868d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/install_extension.h
@@ -0,0 +1,45 @@
+#pragma once
+
+#include "extension/extension_installer.h"
+#include "extension_print_info.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct InstallExtensionPrintInfo final : public ExtensionPrintInfo {
+    explicit InstallExtensionPrintInfo(std::string extensionName)
+        : ExtensionPrintInfo{std::move(extensionName)} {}
+
+    std::string toString() const override { return "Install " + extensionName; }
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::make_unique<InstallExtensionPrintInfo>(*this);
+    }
+};
+
+class InstallExtension final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::INSTALL_EXTENSION;
+
+public:
+    InstallExtension(extension::InstallExtensionInfo info,
+        std::shared_ptr<FactorizedTable> messageTable, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          info{std::move(info)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<InstallExtension>(info, messageTable, id, printInfo->copy());
+    }
+
+private:
+    void setOutputMessage(bool installed, storage::MemoryManager* memoryManager);
+
+private:
+    extension::InstallExtensionInfo info;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/load_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/load_extension.h
new file mode 100644
index 0000000000..899bf01461
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/load_extension.h
@@ -0,0 +1,45 @@
+#pragma once
+
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct LoadExtensionPrintInfo final : OPPrintInfo {
+    std::string extensionName;
+
+    explicit LoadExtensionPrintInfo(std::string extensionName)
+        : extensionName{std::move(extensionName)} {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<LoadExtensionPrintInfo>(new LoadExtensionPrintInfo(*this));
+    }
+
+private:
+    LoadExtensionPrintInfo(const LoadExtensionPrintInfo& other)
+        : OPPrintInfo{other}, extensionName{other.extensionName} {}
+};
+
+class LoadExtension final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::LOAD_EXTENSION;
+
+public:
+    LoadExtension(std::string path, std::shared_ptr<FactorizedTable> messageTable,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          path{std::move(path)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<LoadExtension>(path, messageTable, id, printInfo->copy());
+    }
+
+private:
+    std::string path;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/uninstall_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/uninstall_extension.h
new file mode 100644
index 0000000000..3283d2bd4b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/uninstall_extension.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include "extension_print_info.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct UninstallExtensionPrintInfo final : public ExtensionPrintInfo {
+    explicit UninstallExtensionPrintInfo(std::string extensionName)
+        : ExtensionPrintInfo{std::move(extensionName)} {}
+
+    std::string toString() const override { return "Uninstall " + extensionName; }
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::make_unique<UninstallExtensionPrintInfo>(*this);
+    }
+};
+
+class UninstallExtension final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::UNINSTALL_EXTENSION;
+
+public:
+    UninstallExtension(std::string path, std::shared_ptr<FactorizedTable> messageTable,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          path{std::move(path)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<UninstallExtension>(path, messageTable, id, printInfo->copy());
+    }
+
+private:
+    std::string path;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/use_database.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/use_database.h
new file mode 100644
index 0000000000..773bd72bb3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/simple/use_database.h
@@ -0,0 +1,44 @@
+#pragma once
+
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+struct UseDatabasePrintInfo final : OPPrintInfo {
+    std::string dbName;
+
+    explicit UseDatabasePrintInfo(std::string dbName) : dbName(std::move(dbName)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<UseDatabasePrintInfo>(new UseDatabasePrintInfo(*this));
+    }
+
+private:
+    UseDatabasePrintInfo(const UseDatabasePrintInfo& other)
+        : OPPrintInfo(other), dbName(other.dbName) {}
+};
+
+class UseDatabase final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::USE_DATABASE;
+
+public:
+    UseDatabase(std::string dbName, std::shared_ptr<FactorizedTable> messageTable,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : SimpleSink{type_, std::move(messageTable), id, std::move(printInfo)},
+          dbName{std::move(dbName)} {}
+
+    void executeInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<UseDatabase>(dbName, messageTable, id, printInfo->copy());
+    }
+
+private:
+    std::string dbName;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/sink.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/sink.h
new file mode 100644
index 0000000000..bd9d9182bb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/sink.h
@@ -0,0 +1,123 @@
+#pragma once
+
+#include "common/exception/internal.h"
+#include "common/metric.h"
+#include "processor/operator/physical_operator.h"
+#include "processor/result/factorized_table.h"
+#include "processor/result/result_set_descriptor.h"
+
+namespace lbug {
+namespace main {
+class QueryResult;
+}
+namespace processor {
+
+class LBUG_API Sink : public PhysicalOperator {
+public:
+    Sink(PhysicalOperatorType operatorType, physical_op_id id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{operatorType, id, std::move(printInfo)} {}
+    Sink(PhysicalOperatorType operatorType, std::unique_ptr<PhysicalOperator> child,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{operatorType, std::move(child), id, std::move(printInfo)} {}
+
+    bool isSink() const override { return true; }
+
+    void setDescriptor(std::unique_ptr<ResultSetDescriptor> descriptor) {
+        KU_ASSERT(resultSetDescriptor == nullptr);
+        resultSetDescriptor = std::move(descriptor);
+    }
+    std::unique_ptr<ResultSet> getResultSet(storage::MemoryManager* memoryManager);
+
+    void execute(ResultSet* resultSet, ExecutionContext* context) {
+        initLocalState(resultSet, context);
+        metrics->executionTime.start();
+        executeInternal(context);
+        metrics->executionTime.stop();
+    }
+
+    virtual std::unique_ptr<main::QueryResult> getQueryResult() const {
+        throw common::InternalException(
+            common::stringFormat("{} operator does not implement getQueryResult.",
+                PhysicalOperatorUtils::operatorTypeToString(operatorType)));
+    }
+
+    virtual std::shared_ptr<FactorizedTable> getResultFTable() const {
+        throw common::InternalException(common::stringFormat(
+            "Trying to get result table from {} operator which doesn't have one.",
+            PhysicalOperatorUtils::operatorTypeToString(operatorType)));
+    }
+
+    virtual bool terminate() const { return false; }
+
+    std::unique_ptr<PhysicalOperator> copy() override = 0;
+
+protected:
+    virtual void executeInternal(ExecutionContext* context) = 0;
+
+    bool getNextTuplesInternal(ExecutionContext* /*context*/) final {
+        throw common::InternalException(
+            "getNextTupleInternal() should not be called on sink operator.");
+    }
+
+protected:
+    std::unique_ptr<ResultSetDescriptor> resultSetDescriptor;
+};
+
+class LBUG_API DummySink final : public Sink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::DUMMY_SINK;
+
+public:
+    DummySink(std::unique_ptr<PhysicalOperator> child, uint32_t id)
+        : Sink{type_, std::move(child), id, OPPrintInfo::EmptyInfo()} {}
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<DummySink>(children[0]->copy(), id);
+    }
+
+protected:
+    void executeInternal(ExecutionContext* context) override {
+        while (children[0]->getNextTuple(context)) {
+            // DO NOTHING.
+        }
+    }
+};
+
+class SimpleSink : public Sink {
+public:
+    SimpleSink(PhysicalOperatorType operatorType, std::shared_ptr<FactorizedTable> messageTable,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : Sink{operatorType, id, std::move(printInfo)}, messageTable{std::move(messageTable)} {}
+
+    bool isSource() const final { return true; }
+    bool isParallel() const final { return false; }
+
+    std::unique_ptr<main::QueryResult> getQueryResult() const override;
+
+    std::shared_ptr<FactorizedTable> getResultFTable() const override { return messageTable; }
+
+protected:
+    void appendMessage(const std::string& msg, storage::MemoryManager* memoryManager);
+
+protected:
+    std::shared_ptr<FactorizedTable> messageTable;
+};
+
+// For cases like Export. We need a parent for ExportDB and multiple CopyTo. This parent does not
+// have any logic other than propagating the result fTable.
+class DummySimpleSink final : public SimpleSink {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::DUMMY_SIMPLE_SINK;
+
+public:
+    DummySimpleSink(std::shared_ptr<FactorizedTable> messageTable, physical_op_id id)
+        : SimpleSink{type_, std::move(messageTable), id, OPPrintInfo::EmptyInfo()} {}
+
+    void executeInternal(ExecutionContext*) override {}
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<DummySimpleSink>(messageTable, id);
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/skip.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/skip.h
new file mode 100644
index 0000000000..a83c0e3471
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/skip.h
@@ -0,0 +1,56 @@
+#pragma once
+
+#include <atomic>
+
+#include "processor/operator/filtering_operator.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct SkipPrintInfo final : OPPrintInfo {
+    uint64_t number;
+
+    explicit SkipPrintInfo(std::int64_t number) : number(number) {}
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<SkipPrintInfo>(new SkipPrintInfo(*this));
+    }
+
+private:
+    SkipPrintInfo(const SkipPrintInfo& other) : OPPrintInfo(other), number(other.number) {}
+};
+
+class Skip final : public PhysicalOperator, public SelVectorOverWriter {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::SKIP;
+
+public:
+    Skip(uint64_t skipNumber, std::shared_ptr<std::atomic_uint64_t> counter,
+        uint32_t dataChunkToSelectPos, std::unordered_set<uint32_t> dataChunksPosInScope,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          skipNumber{skipNumber}, counter{std::move(counter)},
+          dataChunkToSelectPos{dataChunkToSelectPos},
+          dataChunksPosInScope{std::move(dataChunksPosInScope)} {}
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<Skip>(skipNumber, counter, dataChunkToSelectPos, dataChunksPosInScope,
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    uint64_t skipNumber;
+    std::shared_ptr<std::atomic_uint64_t> counter;
+    uint32_t dataChunkToSelectPos;
+    std::shared_ptr<common::DataChunk> dataChunkToSelect;
+    std::unordered_set<uint32_t> dataChunksPosInScope;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/standalone_call.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/standalone_call.h
new file mode 100644
index 0000000000..7495f0a845
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/standalone_call.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include "common/types/value/value.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace main {
+struct Option;
+}
+namespace processor {
+
+struct StandaloneCallPrintInfo final : OPPrintInfo {
+    std::string functionName;
+
+    explicit StandaloneCallPrintInfo(std::string functionName)
+        : functionName(std::move(functionName)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<StandaloneCallPrintInfo>(new StandaloneCallPrintInfo(*this));
+    }
+
+private:
+    StandaloneCallPrintInfo(const StandaloneCallPrintInfo& other)
+        : OPPrintInfo(other), functionName(other.functionName) {}
+};
+
+struct StandaloneCallInfo {
+    const main::Option* option;
+    common::Value optionValue;
+    // TODO: we should remove this.
+    bool hasExecuted = false;
+
+    StandaloneCallInfo(const main::Option* option, common::Value optionValue)
+        : option{option}, optionValue{std::move(optionValue)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(StandaloneCallInfo);
+
+private:
+    StandaloneCallInfo(const StandaloneCallInfo& other)
+        : option{other.option}, optionValue{other.optionValue} {}
+};
+
+class StandaloneCall final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::STANDALONE_CALL;
+
+public:
+    StandaloneCall(StandaloneCallInfo info, uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, id, std::move(printInfo)}, standaloneCallInfo{std::move(info)} {}
+
+    bool isSource() const override { return true; }
+    bool isParallel() const override { return false; }
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<StandaloneCall>(standaloneCallInfo.copy(), id, printInfo->copy());
+    }
+
+private:
+    StandaloneCallInfo standaloneCallInfo;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/table_function_call.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/table_function_call.h
new file mode 100644
index 0000000000..cffdb62c82
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/table_function_call.h
@@ -0,0 +1,82 @@
+#pragma once
+
+#include "function/table/bind_data.h"
+#include "function/table/table_function.h"
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+struct TableFunctionCallInfo {
+    function::TableFunction function{};
+    std::unique_ptr<function::TableFuncBindData> bindData;
+    std::vector<DataPos> outPosV;
+
+    TableFunctionCallInfo() = default;
+    EXPLICIT_COPY_DEFAULT_MOVE(TableFunctionCallInfo);
+
+private:
+    TableFunctionCallInfo(const TableFunctionCallInfo& other) {
+        function = other.function;
+        bindData = other.bindData->copy();
+        outPosV = other.outPosV;
+    }
+};
+
+struct TableFunctionCallPrintInfo final : OPPrintInfo {
+    std::string funcName;
+    binder::expression_vector exprs;
+
+    explicit TableFunctionCallPrintInfo(std::string funcName, binder::expression_vector exprs)
+        : funcName(std::move(funcName)), exprs(std::move(exprs)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<TableFunctionCallPrintInfo>(new TableFunctionCallPrintInfo(*this));
+    }
+
+private:
+    TableFunctionCallPrintInfo(const TableFunctionCallPrintInfo& other)
+        : OPPrintInfo(other), funcName(other.funcName), exprs(other.exprs) {}
+};
+
+class LBUG_API TableFunctionCall final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::TABLE_FUNCTION_CALL;
+
+public:
+    TableFunctionCall(TableFunctionCallInfo info,
+        std::shared_ptr<function::TableFuncSharedState> sharedState, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, id, std::move(printInfo)}, info{std::move(info)},
+          sharedState{std::move(sharedState)} {}
+
+    const TableFunctionCallInfo& getInfo() const { return info; }
+    std::shared_ptr<function::TableFuncSharedState> getSharedState() const { return sharedState; }
+
+    bool isSource() const override { return true; }
+
+    bool isParallel() const override { return info.function.canParallelFunc(); }
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    void finalizeInternal(ExecutionContext* context) override;
+
+    double getProgress(ExecutionContext* context) const override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<TableFunctionCall>(info.copy(), sharedState, id, printInfo->copy());
+    }
+
+private:
+    TableFunctionCallInfo info;
+    std::shared_ptr<function::TableFuncSharedState> sharedState;
+    std::unique_ptr<function::TableFuncLocalState> localState = nullptr;
+    std::unique_ptr<function::TableFuncInput> funcInput = nullptr;
+    std::unique_ptr<function::TableFuncOutput> funcOutput = nullptr;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/table_scan/ftable_scan_function.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/table_scan/ftable_scan_function.h
new file mode 100644
index 0000000000..d8ed0ae8c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/table_scan/ftable_scan_function.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include "function/table/bind_data.h"
+#include "function/table/table_function.h"
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct FTableScanBindData : public function::TableFuncBindData {
+    std::shared_ptr<FactorizedTable> table;
+    std::vector<ft_col_idx_t> columnIndices;
+    uint64_t morselSize;
+
+    FTableScanBindData(std::shared_ptr<FactorizedTable> table,
+        std::vector<ft_col_idx_t> columnIndices, uint64_t morselSize)
+        : table{std::move(table)}, columnIndices{std::move(columnIndices)}, morselSize{morselSize} {
+    }
+    FTableScanBindData(const FTableScanBindData& other)
+        : function::TableFuncBindData{other}, table{other.table},
+          columnIndices{other.columnIndices}, morselSize{other.morselSize} {}
+
+    std::unique_ptr<TableFuncBindData> copy() const override {
+        return std::make_unique<FTableScanBindData>(*this);
+    }
+};
+
+struct FTableScan {
+    static constexpr const char* name = "READ_FTABLE";
+
+    static std::unique_ptr<function::TableFunction> getFunction();
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/table_scan/union_all_scan.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/table_scan/union_all_scan.h
new file mode 100644
index 0000000000..518954d5bd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/table_scan/union_all_scan.h
@@ -0,0 +1,97 @@
+#pragma once
+
+#include <mutex>
+
+#include "binder/expression/expression.h"
+#include "processor/operator/physical_operator.h"
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct UnionAllScanPrintInfo final : OPPrintInfo {
+    binder::expression_vector expressions;
+
+    explicit UnionAllScanPrintInfo(binder::expression_vector expressions)
+        : expressions(std::move(expressions)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<UnionAllScanPrintInfo>(new UnionAllScanPrintInfo(*this));
+    }
+
+private:
+    UnionAllScanPrintInfo(const UnionAllScanPrintInfo& other)
+        : OPPrintInfo(other), expressions(other.expressions) {}
+};
+
+struct UnionAllScanInfo {
+    std::vector<DataPos> outputPositions;
+    std::vector<ft_col_idx_t> columnIndices;
+
+    UnionAllScanInfo(std::vector<DataPos> outputPositions, std::vector<ft_col_idx_t> columnIndices)
+        : outputPositions{std::move(outputPositions)}, columnIndices{std::move(columnIndices)} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(UnionAllScanInfo);
+
+private:
+    UnionAllScanInfo(const UnionAllScanInfo& other)
+        : outputPositions{other.outputPositions}, columnIndices{other.columnIndices} {}
+};
+
+struct UnionAllScanMorsel {
+    FactorizedTable* table;
+    uint64_t startTupleIdx;
+    uint64_t numTuples;
+
+    UnionAllScanMorsel(FactorizedTable* table, uint64_t startTupleIdx, uint64_t numTuples)
+        : table{table}, startTupleIdx{startTupleIdx}, numTuples{numTuples} {}
+};
+
+class UnionAllScanSharedState {
+public:
+    UnionAllScanSharedState(std::vector<std::shared_ptr<FactorizedTable>> tables,
+        uint64_t maxMorselSize)
+        : tables{std::move(tables)}, maxMorselSize{maxMorselSize}, tableIdx{0},
+          nextTupleIdxToScan{0} {}
+
+    std::unique_ptr<UnionAllScanMorsel> getMorsel();
+
+private:
+    std::unique_ptr<UnionAllScanMorsel> getMorselNoLock(FactorizedTable* table);
+
+private:
+    std::mutex mtx;
+    std::vector<std::shared_ptr<FactorizedTable>> tables;
+    uint64_t maxMorselSize;
+    uint64_t tableIdx;
+    uint64_t nextTupleIdxToScan;
+};
+
+class UnionAllScan : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::UNION_ALL_SCAN;
+
+public:
+    UnionAllScan(UnionAllScanInfo info, std::shared_ptr<UnionAllScanSharedState> sharedState,
+        physical_op_id id, std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, id, std::move(printInfo)}, info{std::move(info)},
+          sharedState{std::move(sharedState)} {}
+
+    bool isSource() const final { return true; }
+
+    void initLocalStateInternal(ResultSet* resultSet_, ExecutionContext* context) final;
+
+    bool getNextTuplesInternal(ExecutionContext* context) final;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<UnionAllScan>(info.copy(), sharedState, id, printInfo->copy());
+    }
+
+private:
+    UnionAllScanInfo info;
+    std::shared_ptr<UnionAllScanSharedState> sharedState;
+    std::vector<common::ValueVector*> vectors;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/transaction.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/transaction.h
new file mode 100644
index 0000000000..0ca31f2e70
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/transaction.h
@@ -0,0 +1,60 @@
+#pragma once
+
+#include "processor/operator/physical_operator.h"
+#include "transaction/transaction_action.h"
+
+namespace lbug {
+namespace transaction {
+class TransactionContext;
+} // namespace transaction
+
+namespace processor {
+
+struct TransactionPrintInfo final : OPPrintInfo {
+    transaction::TransactionAction action;
+
+    explicit TransactionPrintInfo(transaction::TransactionAction action) : action(action) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<TransactionPrintInfo>(new TransactionPrintInfo(*this));
+    }
+
+private:
+    TransactionPrintInfo(const TransactionPrintInfo& other)
+        : OPPrintInfo(other), action(other.action) {}
+};
+
+class Transaction final : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::TRANSACTION;
+
+public:
+    Transaction(transaction::TransactionAction transactionAction, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, id, std::move(printInfo)}, transactionAction{transactionAction},
+          hasExecuted{false} {}
+
+    bool isSource() const final { return true; }
+    bool isParallel() const final { return false; }
+
+    void initLocalStateInternal(ResultSet* /*resultSet_*/, ExecutionContext* /*context*/) final {
+        hasExecuted = false;
+    }
+
+    bool getNextTuplesInternal(ExecutionContext* context) final;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return std::make_unique<Transaction>(transactionAction, id, printInfo->copy());
+    }
+
+private:
+    void validateActiveTransaction(const transaction::TransactionContext& context) const;
+
+private:
+    transaction::TransactionAction transactionAction;
+    bool hasExecuted;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/unwind.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/unwind.h
new file mode 100644
index 0000000000..72b12db443
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/operator/unwind.h
@@ -0,0 +1,66 @@
+#pragma once
+
+#include "expression_evaluator/expression_evaluator.h"
+#include "processor/operator/physical_operator.h"
+#include "processor/result/result_set.h"
+
+namespace lbug {
+namespace processor {
+
+struct UnwindPrintInfo final : OPPrintInfo {
+    std::shared_ptr<binder::Expression> inExpression;
+    std::shared_ptr<binder::Expression> outExpression;
+
+    UnwindPrintInfo(std::shared_ptr<binder::Expression> inExpression,
+        std::shared_ptr<binder::Expression> outExpression)
+        : inExpression(std::move(inExpression)), outExpression(std::move(outExpression)) {}
+
+    std::string toString() const override;
+
+    std::unique_ptr<OPPrintInfo> copy() const override {
+        return std::unique_ptr<UnwindPrintInfo>(new UnwindPrintInfo(*this));
+    }
+
+private:
+    UnwindPrintInfo(const UnwindPrintInfo& other)
+        : OPPrintInfo(other), inExpression(other.inExpression), outExpression(other.outExpression) {
+    }
+};
+
+class Unwind : public PhysicalOperator {
+    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::UNWIND;
+
+public:
+    Unwind(DataPos outDataPos, DataPos idPos,
+        std::unique_ptr<evaluator::ExpressionEvaluator> expressionEvaluator,
+        std::unique_ptr<PhysicalOperator> child, uint32_t id,
+        std::unique_ptr<OPPrintInfo> printInfo)
+        : PhysicalOperator{type_, std::move(child), id, std::move(printInfo)},
+          outDataPos{outDataPos}, idPos(idPos), expressionEvaluator{std::move(expressionEvaluator)},
+          startIndex{0u} {}
+
+    bool getNextTuplesInternal(ExecutionContext* context) override;
+
+    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;
+
+    std::unique_ptr<PhysicalOperator> copy() override {
+        return make_unique<Unwind>(outDataPos, idPos, expressionEvaluator->copy(),
+            children[0]->copy(), id, printInfo->copy());
+    }
+
+private:
+    bool hasMoreToRead() const;
+    void copyTuplesToOutVector(uint64_t startPos, uint64_t endPos) const;
+
+    DataPos outDataPos;
+    DataPos idPos;
+
+    std::unique_ptr<evaluator::ExpressionEvaluator> expressionEvaluator;
+    std::shared_ptr<common::ValueVector> outValueVector;
+    common::ValueVector* idVector = nullptr;
+    uint32_t startIndex;
+    common::list_entry_t listEntry;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/physical_plan.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/physical_plan.h
new file mode 100644
index 0000000000..c4faa87997
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/physical_plan.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include <memory>
+
+#include "processor/operator/physical_operator.h"
+
+namespace lbug {
+namespace processor {
+
+class PhysicalPlan {
+public:
+    explicit PhysicalPlan(std::unique_ptr<PhysicalOperator> lastOperator)
+        : lastOperator{std::move(lastOperator)} {}
+
+public:
+    std::unique_ptr<PhysicalOperator> lastOperator;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/plan_mapper.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/plan_mapper.h
new file mode 100644
index 0000000000..3f907facf7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/plan_mapper.h
@@ -0,0 +1,258 @@
+#pragma once
+
+#include "common/arrow/arrow_result_config.h"
+#include "main/query_result.h"
+#include "planner/operator/logical_operator.h"
+#include "processor/execution_context.h"
+#include "processor/operator/result_collector.h"
+#include "processor/physical_plan.h"
+
+namespace lbug {
+namespace common {
+enum class RelDataDirection : uint8_t;
+class SemiMask;
+class NodeOffsetMaskMap;
+class SemiMask;
+} // namespace common
+namespace main {
+class ClientContext;
+}
+namespace extension {
+class MapperExtension;
+}
+
+namespace binder {
+struct BoundCopyFromInfo;
+struct BoundDeleteInfo;
+struct BoundSetPropertyInfo;
+} // namespace binder
+
+namespace catalog {
+class TableCatalogEntry;
+}
+
+namespace planner {
+class LogicalSemiMasker;
+struct LogicalInsertInfo;
+class LogicalCopyFrom;
+class LogicalPlan;
+} // namespace planner
+
+namespace processor {
+
+struct HashJoinBuildInfo;
+struct AggregateInfo;
+class NodeInsertExecutor;
+class RelInsertExecutor;
+class NodeSetExecutor;
+class RelSetExecutor;
+class NodeDeleteExecutor;
+class RelDeleteExecutor;
+struct NodeTableDeleteInfo;
+struct NodeTableSetInfo;
+struct RelTableSetInfo;
+struct BatchInsertSharedState;
+struct PartitionerSharedState;
+class RelBatchInsertImpl;
+class ArrowResultCollector;
+
+class PlanMapper {
+public:
+    explicit PlanMapper(ExecutionContext* executionContext);
+
+    std::unique_ptr<PhysicalPlan> getPhysicalPlan(const planner::LogicalPlan* logicalPlan,
+        const binder::expression_vector& expressions, main::QueryResultType resultType,
+        common::ArrowResultConfig arrowConfig);
+
+    uint32_t getOperatorID() { return physicalOperatorID++; }
+
+    static DataPos getDataPos(const binder::Expression& expression, const planner::Schema& schema) {
+        return DataPos(schema.getExpressionPos(expression));
+    }
+
+    // Assume scans all columns of table in the same order as given expressions.
+    LBUG_API std::unique_ptr<PhysicalOperator> createFTableScanAligned(
+        const binder::expression_vector& exprs, const planner::Schema* schema,
+        std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize,
+        physical_op_vector_t children);
+
+    LBUG_API std::unique_ptr<PhysicalOperator> mapOperator(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapAccumulate(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapAggregate(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapAlter(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapAttachDatabase(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapCopyFrom(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapCopyNodeFrom(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapCopyRelFrom(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapCopyTo(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapCreateMacro(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapCreateSequence(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapCreateTable(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapCreateType(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapCrossProduct(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapDelete(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapDeleteNode(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapDeleteRel(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapDetachDatabase(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapDistinct(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapDrop(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapDummyScan(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapDummySink(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapEmptyResult(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapExplain(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapExpressionsScan(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapExtend(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapExtension(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapExportDatabase(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapFilter(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapFlatten(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapHashJoin(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapImportDatabase(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapIndexLookup(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapIntersect(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapInsert(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapLimit(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapMerge(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapMultiplicityReducer(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapNodeLabelFilter(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapNoop(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapOrderBy(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapPartitioner(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapPathPropertyProbe(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapProjection(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapRecursiveExtend(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapScanNodeTable(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapSemiMasker(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapSetProperty(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapSetNodeProperty(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapSetRelProperty(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapStandaloneCall(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapTableFunctionCall(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapTransaction(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapUnionAll(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapUnwind(const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapUseDatabase(
+        const planner::LogicalOperator* logicalOperator);
+    std::unique_ptr<PhysicalOperator> mapExtensionClause(
+        const planner::LogicalOperator* logicalOperator);
+
+    std::unique_ptr<ResultCollector> createResultCollector(common::AccumulateType accumulateType,
+        const binder::expression_vector& expressions, planner::Schema* schema,
+        std::unique_ptr<PhysicalOperator> prevOperator);
+    std::unique_ptr<PhysicalOperator> createArrowResultCollector(
+        common::ArrowResultConfig arrowConfig, const binder::expression_vector& expressions,
+        planner::Schema* schema, std::unique_ptr<PhysicalOperator> prevOperator);
+
+    // Scan fTable
+    std::unique_ptr<PhysicalOperator> createFTableScan(const binder::expression_vector& exprs,
+        std::vector<ft_col_idx_t> colIndices, const planner::Schema* schema,
+        std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize,
+        physical_op_vector_t children);
+    // Scan is the leaf operator of physical plan.
+    std::unique_ptr<PhysicalOperator> createFTableScan(const binder::expression_vector& exprs,
+        const std::vector<ft_col_idx_t>& colIndices, const planner::Schema* schema,
+        std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize);
+    // Do not scan anything from table. Serves as a control logic of pull model.
+    std::unique_ptr<PhysicalOperator> createEmptyFTableScan(std::shared_ptr<FactorizedTable> table,
+        uint64_t maxMorselSize, physical_op_vector_t children);
+    std::unique_ptr<PhysicalOperator> createEmptyFTableScan(std::shared_ptr<FactorizedTable> table,
+        uint64_t maxMorselSize, std::unique_ptr<PhysicalOperator> child);
+    // Do not scan anything from table. Serves as a control logic of pull model.
+    // Scan is the leaf operator of physical plan.
+    std::unique_ptr<PhysicalOperator> createEmptyFTableScan(std::shared_ptr<FactorizedTable> table,
+        uint64_t maxMorselSize);
+    // Assume scans all columns of table in the same order as given expressions.
+    // Scan fTable without row offset.
+    // Scan is the leaf operator of physical plan.
+    std::unique_ptr<PhysicalOperator> createFTableScanAligned(
+        const binder::expression_vector& exprs, const planner::Schema* schema,
+        std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize);
+
+    static HashJoinBuildInfo createHashBuildInfo(const planner::Schema& buildSideSchema,
+        const binder::expression_vector& keys, const binder::expression_vector& payloads);
+
+    std::unique_ptr<PhysicalOperator> createDistinctHashAggregate(
+        const binder::expression_vector& keys, const binder::expression_vector& payloads,
+        planner::Schema* inSchema, planner::Schema* outSchema,
+        std::unique_ptr<PhysicalOperator> prevOperator);
+    std::unique_ptr<PhysicalOperator> createHashAggregate(const binder::expression_vector& keys,
+        const binder::expression_vector& payloads, const binder::expression_vector& aggregates,
+        planner::Schema* inSchema, planner::Schema* outSchema,
+        std::unique_ptr<PhysicalOperator> prevOperator);
+
+    NodeInsertExecutor getNodeInsertExecutor(const planner::LogicalInsertInfo* boundInfo,
+        const planner::Schema& inSchema, const planner::Schema& outSchema) const;
+    RelInsertExecutor getRelInsertExecutor(const planner::LogicalInsertInfo* boundInfo,
+        const planner::Schema& inSchema, const planner::Schema& outSchema) const;
+    std::unique_ptr<NodeSetExecutor> getNodeSetExecutor(
+        const binder::BoundSetPropertyInfo& boundInfo, const planner::Schema& schema) const;
+    std::unique_ptr<RelSetExecutor> getRelSetExecutor(const binder::BoundSetPropertyInfo& boundInfo,
+        const planner::Schema& schema) const;
+    std::unique_ptr<NodeDeleteExecutor> getNodeDeleteExecutor(
+        const binder::BoundDeleteInfo& boundInfo, const planner::Schema& schema) const;
+    std::unique_ptr<RelDeleteExecutor> getRelDeleteExecutor(
+        const binder::BoundDeleteInfo& boundInfo, const planner::Schema& schema) const;
+    NodeTableDeleteInfo getNodeTableDeleteInfo(const catalog::TableCatalogEntry& entry,
+        DataPos pkPos) const;
+
+    static void mapSIPJoin(PhysicalOperator* joinRoot);
+
+    static std::vector<DataPos> getDataPos(const binder::expression_vector& expressions,
+        const planner::Schema& schema);
+    static FactorizedTableSchema createFlatFTableSchema(
+        const binder::expression_vector& expressions, const planner::Schema& schema);
+    std::unique_ptr<common::SemiMask> createSemiMask(common::table_id_t tableID) const;
+
+    void addOperatorMapping(const planner::LogicalOperator* logicalOp,
+        PhysicalOperator* physicalOp) {
+        KU_ASSERT(!logicalOpToPhysicalOpMap.contains(logicalOp));
+        logicalOpToPhysicalOpMap.insert({logicalOp, physicalOp});
+    }
+    void eraseOperatorMapping(const planner::LogicalOperator* logicalOp) {
+        KU_ASSERT(logicalOpToPhysicalOpMap.contains(logicalOp));
+        logicalOpToPhysicalOpMap.erase(logicalOp);
+    }
+
+public:
+    ExecutionContext* executionContext;
+    main::ClientContext* clientContext;
+
+private:
+    std::unordered_map<const planner::LogicalOperator*, PhysicalOperator*> logicalOpToPhysicalOpMap;
+    physical_op_id physicalOperatorID;
+    std::vector<extension::MapperExtension*> mapperExtensions;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/processor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/processor.h
new file mode 100644
index 0000000000..6db96b29d6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/processor.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "common/task_system/task_scheduler.h"
+
+namespace lbug {
+namespace main {
+class QueryResult;
+}
+namespace processor {
+class FactorizedTable;
+class PhysicalPlan;
+class PhysicalOperator;
+class QueryProcessor {
+
+public:
+#if defined(__APPLE__)
+    explicit QueryProcessor(uint64_t numThreads, uint32_t threadQos);
+#else
+    explicit QueryProcessor(uint64_t numThreads);
+#endif
+
+    common::TaskScheduler* getTaskScheduler() { return taskScheduler.get(); }
+
+    std::unique_ptr<main::QueryResult> execute(PhysicalPlan* physicalPlan,
+        ExecutionContext* context);
+
+private:
+    void decomposePlanIntoTask(PhysicalOperator* op, common::Task* task, ExecutionContext* context);
+
+    void initTask(common::Task* task);
+
+private:
+    std::unique_ptr<common::TaskScheduler> taskScheduler;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/processor_task.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/processor_task.h
new file mode 100644
index 0000000000..5d2247df62
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/processor_task.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "common/task_system/task.h"
+#include "processor/operator/sink.h"
+
+namespace lbug {
+namespace processor {
+
+class ProcessorTask : public common::Task {
+    friend class QueryProcessor;
+
+public:
+    ProcessorTask(Sink* sink, ExecutionContext* executionContext);
+
+    void run() override;
+
+    void finalize() override;
+
+    bool terminate() override;
+
+private:
+    bool sharedStateInitialized;
+    Sink* sink;
+    ExecutionContext* executionContext;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/base_hash_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/base_hash_table.h
new file mode 100644
index 0000000000..a6f6812993
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/base_hash_table.h
@@ -0,0 +1,80 @@
+#pragma once
+
+#include <functional>
+
+#include "common/copy_constructors.h"
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "processor/result/factorized_table.h"
+#include "processor/result/factorized_table_schema.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+}
+namespace processor {
+
+using compare_function_t =
+    std::function<bool(const common::ValueVector*, uint32_t, const uint8_t*)>;
+using ft_compare_function_t =
+    std::function<bool(const uint8_t*, const uint8_t*, const common::LogicalType& type)>;
+
+class BaseHashTable {
+public:
+    BaseHashTable(storage::MemoryManager& memoryManager, common::logical_type_vec_t keyTypes);
+
+    virtual ~BaseHashTable() = default;
+
+    DELETE_COPY_DEFAULT_MOVE(BaseHashTable);
+
+    const FactorizedTableSchema* getTableSchema() const {
+        return factorizedTable->getTableSchema();
+    }
+    uint64_t getNumEntries() const { return factorizedTable->getNumTuples(); }
+    uint64_t getCapacity() const { return maxNumHashSlots; }
+    const FactorizedTable* getFactorizedTable() const { return factorizedTable.get(); }
+
+protected:
+    static constexpr uint64_t HASH_BLOCK_SIZE = common::TEMP_PAGE_SIZE;
+
+    uint64_t getSlotIdxForHash(common::hash_t hash) const { return hash % maxNumHashSlots; }
+    void setMaxNumHashSlots(uint64_t newSize);
+
+    void computeVectorHashes(const std::vector<common::ValueVector*>& flatKeyVectors) {
+        computeVectorHashes(constSpan(flatKeyVectors));
+    }
+    void computeVectorHashes(std::span<const common::ValueVector*> flatKeyVectors);
+    void initSlotConstant(uint64_t numSlotsPerBlock);
+    bool matchFlatVecWithEntry(const std::vector<common::ValueVector*>& keyVectors,
+        const uint8_t* entry);
+
+    template<typename T>
+    std::span<const T*> constSpan(const std::vector<T*>& vector) {
+        return std::span(const_cast<const T**>(vector.data()), vector.size());
+    }
+
+private:
+    void initCompareFuncs();
+    void initTmpHashVector();
+
+protected:
+    uint64_t maxNumHashSlots;
+    uint64_t numSlotsPerBlockLog2;
+    uint64_t slotIdxInBlockMask;
+    std::vector<std::unique_ptr<DataBlock>> hashSlotsBlocks;
+    storage::MemoryManager* memoryManager;
+    std::unique_ptr<FactorizedTable> factorizedTable;
+    std::vector<compare_function_t> compareEntryFuncs;
+    std::vector<ft_compare_function_t> ftCompareEntryFuncs;
+    std::vector<common::LogicalType> keyTypes;
+    // Temporary arrays to hold intermediate results for appending.
+    std::shared_ptr<common::DataChunkState> hashState;
+    std::unique_ptr<common::ValueVector> hashVector;
+    common::SelectionVector hashSelVec;
+    std::unique_ptr<common::ValueVector> tmpHashResultVector;
+    std::unique_ptr<common::ValueVector> tmpHashCombineResultVector;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table.h
new file mode 100644
index 0000000000..d39a2e9418
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table.h
@@ -0,0 +1,322 @@
+#pragma once
+
+#include <algorithm>
+#include <numeric>
+
+#include "common/in_mem_overflow_buffer.h"
+#include "common/types/value/value.h"
+#include "common/vector/value_vector.h"
+#include "factorized_table_schema.h"
+#include "flat_tuple.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+}
+namespace processor {
+
+struct BlockAppendingInfo {
+    BlockAppendingInfo(uint8_t* data, uint64_t numTuplesToAppend)
+        : data{data}, numTuplesToAppend{numTuplesToAppend} {}
+
+    uint8_t* data;
+    uint64_t numTuplesToAppend;
+};
+
+// This struct allocates and holds one bmBackedBlock when constructed. The bmBackedBlock will be
+// released when this struct goes out of scope.
+class DataBlock {
+public:
+    DataBlock(storage::MemoryManager* mm, uint64_t size);
+    ~DataBlock();
+
+    uint8_t* getData() const;
+    std::span<uint8_t> getSizedData() const;
+    uint8_t* getWritableData() const;
+    void resetNumTuplesAndFreeSize();
+    void resetToZero();
+
+    // Manually set the underlying memory buffer to evicted to avoid double free
+    void preventDestruction();
+
+    static void copyTuples(DataBlock* blockToCopyFrom, ft_tuple_idx_t tupleIdxToCopyFrom,
+        DataBlock* blockToCopyInto, ft_tuple_idx_t tupleIdxToCopyTo, uint32_t numTuplesToCopy,
+        uint32_t numBytesPerTuple);
+
+public:
+    uint32_t numTuples;
+    uint64_t freeSize;
+
+private:
+    std::unique_ptr<storage::MemoryBuffer> block;
+};
+
+class DataBlockCollection {
+public:
+    // This interface is used for unFlat tuple blocks, for which numBytesPerTuple and
+    // numTuplesPerBlock are useless.
+    DataBlockCollection() : numBytesPerTuple{UINT32_MAX}, numTuplesPerBlock{UINT32_MAX} {}
+    DataBlockCollection(uint32_t numBytesPerTuple, uint32_t numTuplesPerBlock)
+        : numBytesPerTuple{numBytesPerTuple}, numTuplesPerBlock{numTuplesPerBlock} {}
+
+    void append(std::unique_ptr<DataBlock> otherBlock) { blocks.push_back(std::move(otherBlock)); }
+    void append(std::vector<std::unique_ptr<DataBlock>> otherBlocks) {
+        std::move(begin(otherBlocks), end(otherBlocks), back_inserter(blocks));
+    }
+    void append(std::unique_ptr<DataBlockCollection> other) { append(std::move(other->blocks)); }
+    bool needAllocation(uint64_t size) const { return isEmpty() || blocks.back()->freeSize < size; }
+
+    bool isEmpty() const { return blocks.empty(); }
+    const std::vector<std::unique_ptr<DataBlock>>& getBlocks() const { return blocks; }
+    DataBlock* getBlock(ft_block_idx_t blockIdx) { return blocks[blockIdx].get(); }
+    DataBlock* getLastBlock() { return blocks.back().get(); }
+
+    void merge(DataBlockCollection& other);
+    void preventDestruction() const {
+        for (auto& block : blocks) {
+            block->preventDestruction();
+        }
+    }
+
+private:
+    uint32_t numBytesPerTuple;
+    uint32_t numTuplesPerBlock;
+    std::vector<std::unique_ptr<DataBlock>> blocks;
+};
+
+class FlatTupleIterator;
+
+class LBUG_API FactorizedTable {
+    friend FlatTupleIterator;
+    friend class JoinHashTable;
+    friend class PathPropertyProbe;
+
+public:
+    FactorizedTable(storage::MemoryManager* memoryManager, FactorizedTableSchema tableSchema);
+    ~FactorizedTable();
+    void append(const std::vector<common::ValueVector*>& vectors);
+
+    //! This function appends an empty tuple to the factorizedTable and returns a pointer to that
+    //! tuple.
+    uint8_t* appendEmptyTuple();
+
+    // This function scans numTuplesToScan of rows to vectors starting at tupleIdx. Callers are
+    // responsible for making sure all the parameters are valid.
+    void scan(std::span<common::ValueVector*> vectors, ft_tuple_idx_t tupleIdx,
+        uint64_t numTuplesToScan) const {
+        std::vector<uint32_t> colIdxes(tableSchema.getNumColumns());
+        iota(colIdxes.begin(), colIdxes.end(), 0);
+        scan(vectors, tupleIdx, numTuplesToScan, colIdxes);
+    }
+    bool isEmpty() const { return getNumTuples() == 0; }
+    void scan(std::span<common::ValueVector*> vectors, ft_tuple_idx_t tupleIdx,
+        uint64_t numTuplesToScan, std::span<uint32_t> colIdxToScan) const;
+    // TODO(Guodong): Unify these two interfaces along with `readUnflatCol`.
+    // startPos is the starting position in the tuplesToRead, not the starting position in the
+    // factorizedTable
+    void lookup(std::span<common::ValueVector*> vectors, std::span<uint32_t> colIdxesToScan,
+        uint8_t** tuplesToRead, uint64_t startPos, uint64_t numTuplesToRead) const;
+    void lookup(std::vector<common::ValueVector*>& vectors,
+        const common::SelectionVector* selVector, std::vector<uint32_t>& colIdxesToScan,
+        uint8_t* tupleToRead) const;
+    void lookup(std::vector<common::ValueVector*>& vectors, std::vector<uint32_t>& colIdxesToScan,
+        std::vector<ft_tuple_idx_t>& tupleIdxesToRead, uint64_t startPos,
+        uint64_t numTuplesToRead) const;
+
+    // When we merge two factorizedTables, we need to update the hasNoNullGuarantee based on
+    // other factorizedTable.
+    void mergeMayContainNulls(FactorizedTable& other);
+    void merge(FactorizedTable& other);
+
+    common::InMemOverflowBuffer* getInMemOverflowBuffer() const {
+        return inMemOverflowBuffer.get();
+    }
+
+    bool hasUnflatCol() const;
+    bool hasUnflatCol(std::vector<ft_col_idx_t>& colIdxes) const {
+        return std::any_of(colIdxes.begin(), colIdxes.end(),
+            [this](ft_col_idx_t colIdx) { return !tableSchema.getColumn(colIdx)->isFlat(); });
+    }
+
+    uint64_t getNumTuples() const { return numTuples; }
+    uint64_t getTotalNumFlatTuples() const;
+    uint64_t getNumFlatTuples(ft_tuple_idx_t tupleIdx) const;
+
+    const std::vector<std::unique_ptr<DataBlock>>& getTupleDataBlocks() {
+        return flatTupleBlockCollection->getBlocks();
+    }
+    const FactorizedTableSchema* getTableSchema() const { return &tableSchema; }
+
+    template<typename TYPE>
+    TYPE getData(ft_block_idx_t blockIdx, ft_block_offset_t blockOffset,
+        ft_col_offset_t colOffset) const {
+        return *((TYPE*)getCell(blockIdx, blockOffset, colOffset));
+    }
+
+    uint8_t* getTuple(ft_tuple_idx_t tupleIdx) const;
+
+    void updateFlatCell(uint8_t* tuplePtr, ft_col_idx_t colIdx, common::ValueVector* valueVector,
+        uint32_t pos);
+    void updateFlatCellNoNull(uint8_t* ftTuplePtr, ft_col_idx_t colIdx, void* dataBuf) {
+        memcpy(ftTuplePtr + tableSchema.getColOffset(colIdx), dataBuf,
+            tableSchema.getColumn(colIdx)->getNumBytes());
+    }
+
+    uint64_t getNumTuplesPerBlock() const { return numFlatTuplesPerBlock; }
+
+    bool hasNoNullGuarantee(ft_col_idx_t colIdx) const {
+        return tableSchema.getColumn(colIdx)->hasNoNullGuarantee();
+    }
+
+    bool isOverflowColNull(const uint8_t* nullBuffer, ft_tuple_idx_t tupleIdx,
+        ft_col_idx_t colIdx) const;
+    bool isNonOverflowColNull(const uint8_t* nullBuffer, ft_col_idx_t colIdx) const;
+    bool isNonOverflowColNull(ft_tuple_idx_t tupleIdx, ft_col_idx_t colIdx) const;
+    void setNonOverflowColNull(uint8_t* nullBuffer, ft_col_idx_t colIdx);
+    void clear();
+
+    storage::MemoryManager* getMemoryManager() { return memoryManager; }
+
+    void resize(uint64_t numTuples);
+
+    template<typename Func>
+    void forEach(Func func) {
+        for (auto& tupleBlock : flatTupleBlockCollection->getBlocks()) {
+            uint8_t* tuple = tupleBlock->getData();
+            for (auto i = 0u; i < tupleBlock->numTuples; i++) {
+                func(tuple);
+                tuple += getTableSchema()->getNumBytesPerTuple();
+            }
+        }
+    }
+
+    static std::shared_ptr<FactorizedTable> EmptyTable(storage::MemoryManager* mm) {
+        return std::make_shared<FactorizedTable>(mm, FactorizedTableSchema());
+    }
+
+    void setPreventDestruction(bool preventDestruction) {
+        this->preventDestruction = preventDestruction;
+    }
+
+private:
+    void setOverflowColNull(uint8_t* nullBuffer, ft_col_idx_t colIdx, ft_tuple_idx_t tupleIdx);
+
+    uint64_t computeNumTuplesToAppend(
+        const std::vector<common::ValueVector*>& vectorsToAppend) const;
+
+    uint8_t* getCell(ft_block_idx_t blockIdx, ft_block_offset_t blockOffset,
+        ft_col_offset_t colOffset) const {
+        return flatTupleBlockCollection->getBlock(blockIdx)->getData() +
+               blockOffset * tableSchema.getNumBytesPerTuple() + colOffset;
+    }
+    std::pair<ft_block_idx_t, ft_block_offset_t> getBlockIdxAndTupleIdxInBlock(
+        uint64_t tupleIdx) const {
+        return std::make_pair(tupleIdx / numFlatTuplesPerBlock, tupleIdx % numFlatTuplesPerBlock);
+    }
+
+    std::vector<BlockAppendingInfo> allocateFlatTupleBlocks(uint64_t numTuplesToAppend);
+    uint8_t* allocateUnflatTupleBlock(uint32_t numBytes);
+    void copyFlatVectorToFlatColumn(const common::ValueVector& vector,
+        const BlockAppendingInfo& blockAppendInfo, ft_col_idx_t colIdx);
+    void copyUnflatVectorToFlatColumn(const common::ValueVector& vector,
+        const BlockAppendingInfo& blockAppendInfo, uint64_t numAppendedTuples, ft_col_idx_t colIdx);
+    void copyVectorToFlatColumn(const common::ValueVector& vector,
+        const BlockAppendingInfo& blockAppendInfo, uint64_t numAppendedTuples,
+        ft_col_idx_t colIdx) {
+        vector.state->isFlat() ?
+            copyFlatVectorToFlatColumn(vector, blockAppendInfo, colIdx) :
+            copyUnflatVectorToFlatColumn(vector, blockAppendInfo, numAppendedTuples, colIdx);
+    }
+    void copyVectorToUnflatColumn(const common::ValueVector& vector,
+        const BlockAppendingInfo& blockAppendInfo, ft_col_idx_t colIdx);
+    void copyVectorToColumn(const common::ValueVector& vector,
+        const BlockAppendingInfo& blockAppendInfo, uint64_t numAppendedTuples, ft_col_idx_t colIdx);
+    common::overflow_value_t appendVectorToUnflatTupleBlocks(const common::ValueVector& vector,
+        ft_col_idx_t colIdx);
+
+    // TODO(Guodong): Unify these two `readUnflatCol()` with a (possibly templated) copy executor.
+    void readUnflatCol(uint8_t** tuplesToRead, ft_col_idx_t colIdx,
+        common::ValueVector& vector) const;
+    void readUnflatCol(const uint8_t* tupleToRead, const common::SelectionVector& selVector,
+        ft_col_idx_t colIdx, common::ValueVector& vector) const;
+    void readFlatColToFlatVector(uint8_t* tupleToRead, ft_col_idx_t colIdx,
+        common::ValueVector& vector, common::sel_t pos) const;
+    void readFlatColToUnflatVector(uint8_t** tuplesToRead, ft_col_idx_t colIdx,
+        common::ValueVector& vector, uint64_t numTuplesToRead) const;
+    void readFlatCol(uint8_t** tuplesToRead, ft_col_idx_t colIdx, common::ValueVector& vector,
+        uint64_t numTuplesToRead) const;
+
+private:
+    storage::MemoryManager* memoryManager;
+    // Table Schema. Keeping track of factorization structure.
+    FactorizedTableSchema tableSchema;
+    // Number of rows in table.
+    uint64_t numTuples;
+    // Radix sort requires there is a fixed number of tuple in a block.
+    uint64_t flatTupleBlockSize;
+    uint32_t numFlatTuplesPerBlock;
+    // Data blocks for flat tuples.
+    std::unique_ptr<DataBlockCollection> flatTupleBlockCollection;
+    // Data blocks for unFlat tuples.
+    std::unique_ptr<DataBlockCollection> unFlatTupleBlockCollection;
+    // Overflow buffer storing variable size part of an entry.
+    std::unique_ptr<common::InMemOverflowBuffer> inMemOverflowBuffer;
+    // Prevent destruction of the underlying data structures when the factorized table is
+    // destructed. If the parent database is closed, the underlying data structures is already
+    // destructed, so destruction will cause double free.
+    bool preventDestruction = false;
+};
+
+class FactorizedTableIterator {
+public:
+    explicit FactorizedTableIterator(FactorizedTable& factorizedTable);
+
+    bool hasNext() {
+        return nextTupleIdx < factorizedTable.getNumTuples() || nextFlatTupleIdx < numFlatTuples;
+    }
+
+    void getNext(FlatTuple& tuple);
+
+    void resetState();
+
+private:
+    // The dataChunkPos may be not consecutive, which means some entries in the
+    // flatTuplePositionsInDataChunk is invalid. We put pair(UINT64_MAX, UINT64_MAX) in the
+    // invalid entries.
+    bool isValidDataChunkPos(uint32_t dataChunkPos) const {
+        return flatTuplePositionsInDataChunk[dataChunkPos].first != UINT64_MAX;
+    }
+
+    void readUnflatColToFlatTuple(ft_col_idx_t colIdx, uint8_t* valueBuffer, FlatTuple& tuple);
+
+    void readFlatColToFlatTuple(ft_col_idx_t colIdx, uint8_t* valueBuffer, FlatTuple& tuple);
+
+    // We put pair(UINT64_MAX, UINT64_MAX) in all invalid entries in
+    // FlatTuplePositionsInDataChunk.
+    void updateInvalidEntriesInFlatTuplePositionsInDataChunk();
+
+    // This function is used to update the number of elements in the dataChunk when we want
+    // to iterate a new tuple.
+    void updateNumElementsInDataChunk();
+
+    // This function updates the flatTuplePositionsInDataChunk, so that getNextFlatTuple() can
+    // correctly outputs the next flat tuple in the current tuple. For example, we want to read
+    // two unFlat columns, which are on different dataChunks A,B and both have 100 columns. The
+    // flatTuplePositionsInDataChunk after the first call to getNextFlatTuple() looks like:
+    // {dataChunkA : [0, 100]}, {dataChunkB : [0, 100]} This function updates the
+    // flatTuplePositionsInDataChunk to: {dataChunkA: [1, 100]}, {dataChunkB: [0, 100]}. Meaning
+    // that the getNextFlatTuple() should read the second element in the first unflat column and
+    // the first element in the second unflat column.
+    void updateFlatTuplePositionsInDataChunk();
+
+    const FactorizedTable& factorizedTable;
+    uint8_t* currentTupleBuffer;
+    uint64_t numFlatTuples;
+    ft_tuple_idx_t nextFlatTupleIdx;
+    ft_tuple_idx_t nextTupleIdx;
+    // This field stores the (nextIdxToReadInDataChunk, numElementsInDataChunk) of each dataChunk.
+    std::vector<std::pair<uint64_t, uint64_t>> flatTuplePositionsInDataChunk;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table_pool.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table_pool.h
new file mode 100644
index 0000000000..3e05db6dff
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table_pool.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include <mutex>
+#include <stack>
+
+#include "processor/result/factorized_table.h"
+
+namespace lbug {
+namespace processor {
+
+// We implement a local ftable pool to avoid generate many small ftables when running GDS.
+// Alternative solutions are directly writing to global ftable with partition so conflict is
+// minimized. Or we optimize ftable to be more memory efficient when number of tuples is small.
+class LBUG_API FactorizedTablePool {
+public:
+    explicit FactorizedTablePool(std::shared_ptr<FactorizedTable> globalTable)
+        : globalTable{std::move(globalTable)} {}
+    DELETE_COPY_AND_MOVE(FactorizedTablePool);
+
+    FactorizedTable* claimLocalTable(storage::MemoryManager* mm);
+
+    void returnLocalTable(FactorizedTable* table);
+
+    void mergeLocalTables();
+
+    std::shared_ptr<FactorizedTable> getGlobalTable() const { return globalTable; }
+
+private:
+    std::mutex mtx;
+    std::shared_ptr<FactorizedTable> globalTable;
+    std::stack<FactorizedTable*> availableLocalTables;
+    std::vector<std::shared_ptr<FactorizedTable>> localTables;
+};
+
+} // namespace processor
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table_schema.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table_schema.h
new file mode 100644
index 0000000000..8909da5ed5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table_schema.h
@@ -0,0 +1,97 @@
+#pragma once
+
+#include "common/assert.h"
+#include "common/copy_constructors.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace processor {
+
+// TODO(Guodong/Ziyi): Move these typedef to common and unify them with the ones without `ft_`.
+typedef uint64_t ft_tuple_idx_t;
+typedef uint32_t ft_col_idx_t;
+typedef uint32_t ft_col_offset_t;
+typedef uint32_t ft_block_idx_t;
+typedef uint32_t ft_block_offset_t;
+
+class ColumnSchema {
+public:
+    ColumnSchema(bool isUnFlat, common::idx_t groupID, uint32_t numBytes)
+        : isUnFlat{isUnFlat}, groupID{groupID}, numBytes{numBytes}, mayContainNulls{false} {}
+    EXPLICIT_COPY_DEFAULT_MOVE(ColumnSchema);
+
+    bool isFlat() const { return !isUnFlat; }
+
+    common::idx_t getGroupID() const { return groupID; }
+
+    uint32_t getNumBytes() const { return numBytes; }
+
+    bool operator==(const ColumnSchema& other) const {
+        return isUnFlat == other.isUnFlat && groupID == other.groupID && numBytes == other.numBytes;
+    }
+    bool operator!=(const ColumnSchema& other) const { return !(*this == other); }
+
+    void setMayContainsNullsToTrue() { mayContainNulls = true; }
+
+    bool hasNoNullGuarantee() const { return !mayContainNulls; }
+
+private:
+    ColumnSchema(const ColumnSchema& other);
+
+private:
+    // This following two information can alternatively be maintained at table schema
+    // level as a column group information.
+    // Whether column is unFlat.
+    bool isUnFlat;
+    // Group id.
+    common::idx_t groupID;
+    // Num bytes of the column.
+    uint32_t numBytes;
+    // Whether column may contain nulls.
+    // If this field is true, the column can still be all non-null.
+    bool mayContainNulls;
+};
+
+class LBUG_API FactorizedTableSchema {
+public:
+    FactorizedTableSchema() = default;
+    EXPLICIT_COPY_DEFAULT_MOVE(FactorizedTableSchema);
+
+    void appendColumn(ColumnSchema column);
+
+    const ColumnSchema* getColumn(ft_col_idx_t idx) const { return &columns[idx]; }
+
+    uint32_t getNumColumns() const { return columns.size(); }
+
+    ft_col_offset_t getNullMapOffset() const { return numBytesForDataPerTuple; }
+
+    uint32_t getNumBytesPerTuple() const { return numBytesPerTuple; }
+
+    ft_col_offset_t getColOffset(ft_col_idx_t idx) const { return colOffsets[idx]; }
+
+    void setMayContainsNullsToTrue(ft_col_idx_t idx) {
+        KU_ASSERT(idx < columns.size());
+        columns[idx].setMayContainsNullsToTrue();
+    }
+
+    bool isEmpty() const { return columns.empty(); }
+
+    bool operator==(const FactorizedTableSchema& other) const;
+    bool operator!=(const FactorizedTableSchema& other) const { return !(*this == other); }
+
+    uint64_t getNumFlatColumns() const;
+    uint64_t getNumUnFlatColumns() const;
+
+private:
+    FactorizedTableSchema(const FactorizedTableSchema& other);
+
+private:
+    std::vector<ColumnSchema> columns;
+    uint32_t numBytesForDataPerTuple = 0;
+    uint32_t numBytesForNullMapPerTuple = 0;
+    uint32_t numBytesPerTuple = 0;
+    std::vector<ft_col_offset_t> colOffsets;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table_util.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table_util.h
new file mode 100644
index 0000000000..e6e5b02b57
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/factorized_table_util.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "factorized_table.h"
+#include "planner/operator/schema.h"
+
+namespace lbug {
+namespace processor {
+
+class FactorizedTableUtils {
+public:
+    static FactorizedTableSchema createFTableSchema(const binder::expression_vector& exprs,
+        const planner::Schema& schema);
+    static FactorizedTableSchema createFlatTableSchema(
+        std::vector<common::LogicalType> columnTypes);
+
+    // TODO(Ziyi): These two functions are used to store the copy message in a factorizedTable
+    // because the current QueryProcessor::execute requires the last operator in the physical plan
+    // must be ResultCollector. We should remove this class after we remove the assumption that the
+    // last operator in the pipeline must be resultCollector.
+    static void appendStringToTable(FactorizedTable* factorizedTable, const std::string& outputMsg,
+        storage::MemoryManager* memoryManager);
+    static std::shared_ptr<FactorizedTable> getFactorizedTableForOutputMsg(
+        const std::string& outputMsg, storage::MemoryManager* memoryManager);
+    static LBUG_API std::shared_ptr<FactorizedTable> getSingleStringColumnFTable(
+        storage::MemoryManager* mm);
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/flat_tuple.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/flat_tuple.h
new file mode 100644
index 0000000000..a3e6a378a0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/flat_tuple.h
@@ -0,0 +1,68 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+#include <vector>
+
+#include "common/api.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace processor {
+
+/**
+ * @brief Stores a vector of Values.
+ */
+class FlatTuple {
+public:
+    explicit FlatTuple(const std::vector<common::LogicalType>& types);
+
+    DELETE_COPY_AND_MOVE(FlatTuple);
+
+    /**
+     * @return number of values in the FlatTuple.
+     */
+    LBUG_API common::idx_t len() const;
+    /**
+     * @brief Get a pointer to the value at the specified index.
+     * @param idx The index of the value to retrieve.
+     * @return A pointer to the Value at the specified index.
+     */
+    LBUG_API common::Value* getValue(common::idx_t idx);
+
+    /**
+     * @brief Access the value at the specified index by reference.
+     * @param idx The index of the value to access.
+     * @return A reference to the Value at the specified index.
+     */
+    LBUG_API common::Value& operator[](common::idx_t idx);
+
+    /**
+     * @brief Access the value at the specified index by const reference.
+     * @param idx The index of the value to access.
+     * @return A const reference to the Value at the specified index.
+     */
+    LBUG_API const common::Value& operator[](common::idx_t idx) const;
+
+    /**
+     * @brief Convert the FlatTuple to a string representation.
+     * @return A string representation of all values in the FlatTuple.
+     */
+    LBUG_API std::string toString() const;
+
+    /**
+     * @param colsWidth The length of each column
+     * @param delimiter The delimiter to separate each value.
+     * @param maxWidth The maximum length of each column. Only the first maxWidth number of
+     * characters of each column will be displayed.
+     * @return all values in string format.
+     */
+    LBUG_API std::string toString(const std::vector<uint32_t>& colsWidth,
+        const std::string& delimiter = "|", uint32_t maxWidth = -1);
+
+private:
+    std::vector<common::Value> values;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/pattern_creation_info_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/pattern_creation_info_table.h
new file mode 100644
index 0000000000..90259bc6c0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/pattern_creation_info_table.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include "processor/operator/aggregate/aggregate_hash_table.h"
+
+namespace lbug {
+namespace processor {
+
+struct PatternCreationInfo {
+    uint8_t* tuple;
+    bool hasCreated;
+
+    common::nodeID_t getPatternID(common::executor_id_t matchExecutorID) const {
+        auto ftColIndex = matchExecutorID;
+        return *(common::nodeID_t*)(tuple + ftColIndex * sizeof(common::nodeID_t));
+    }
+
+    void updateID(common::executor_id_t executorID, common::executor_info executorInfo,
+        common::nodeID_t nodeID) const;
+};
+
+class PatternCreationInfoTable : public AggregateHashTable {
+public:
+    PatternCreationInfoTable(storage::MemoryManager& memoryManager,
+        std::vector<common::LogicalType> keyTypes, FactorizedTableSchema tableSchema);
+
+    PatternCreationInfo getPatternCreationInfo(const std::vector<common::ValueVector*>& keyVectors);
+
+    uint64_t matchFTEntries(std::span<const common::ValueVector*> keyVectors,
+        uint64_t numMayMatches, uint64_t numNoMatches) override;
+
+private:
+    uint8_t* tuple;
+    ft_col_offset_t idColOffset;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/result_set.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/result_set.h
new file mode 100644
index 0000000000..b89512bfc8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/result_set.h
@@ -0,0 +1,45 @@
+#pragma once
+
+#include <unordered_set>
+
+#include "common/data_chunk/data_chunk.h"
+#include "processor/data_pos.h"
+#include "result_set_descriptor.h"
+
+namespace lbug {
+namespace processor {
+
+class ResultSet {
+public:
+    ResultSet() : ResultSet(0) {}
+    explicit ResultSet(common::idx_t numDataChunks) : multiplicity{1}, dataChunks(numDataChunks) {}
+    ResultSet(ResultSetDescriptor* resultSetDescriptor, storage::MemoryManager* memoryManager);
+
+    void insert(common::idx_t pos, std::shared_ptr<common::DataChunk> dataChunk) {
+        KU_ASSERT(dataChunks.size() > pos);
+        dataChunks[pos] = std::move(dataChunk);
+    }
+
+    std::shared_ptr<common::DataChunk> getDataChunk(data_chunk_pos_t dataChunkPos) {
+        return dataChunks[dataChunkPos];
+    }
+    std::shared_ptr<common::ValueVector> getValueVector(const DataPos& dataPos) const {
+        return dataChunks[dataPos.dataChunkPos]->valueVectors[dataPos.valueVectorPos];
+    }
+
+    // Our projection does NOT explicitly remove dataChunk from resultSet. Therefore, caller should
+    // always provide a set of positions when reading from multiple dataChunks.
+    uint64_t getNumTuples(const std::unordered_set<uint32_t>& dataChunksPosInScope) {
+        return getNumTuplesWithoutMultiplicity(dataChunksPosInScope) * multiplicity;
+    }
+
+    uint64_t getNumTuplesWithoutMultiplicity(
+        const std::unordered_set<uint32_t>& dataChunksPosInScope);
+
+public:
+    uint64_t multiplicity;
+    std::vector<std::shared_ptr<common::DataChunk>> dataChunks;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/result_set_descriptor.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/result_set_descriptor.h
new file mode 100644
index 0000000000..0256327ba4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/result/result_set_descriptor.h
@@ -0,0 +1,44 @@
+#pragma once
+
+#include "common/types/types.h"
+
+namespace lbug {
+namespace planner {
+class Schema;
+} // namespace planner
+
+namespace processor {
+
+struct DataChunkDescriptor {
+    bool isSingleState;
+    std::vector<common::LogicalType> logicalTypes;
+
+    explicit DataChunkDescriptor(bool isSingleState) : isSingleState{isSingleState} {}
+    DataChunkDescriptor(const DataChunkDescriptor& other)
+        : isSingleState{other.isSingleState},
+          logicalTypes(common::LogicalType::copy(other.logicalTypes)) {}
+
+    inline std::unique_ptr<DataChunkDescriptor> copy() const {
+        return std::make_unique<DataChunkDescriptor>(*this);
+    }
+};
+
+struct LBUG_API ResultSetDescriptor {
+    std::vector<std::unique_ptr<DataChunkDescriptor>> dataChunkDescriptors;
+
+    ResultSetDescriptor() = default;
+    explicit ResultSetDescriptor(
+        std::vector<std::unique_ptr<DataChunkDescriptor>> dataChunkDescriptors)
+        : dataChunkDescriptors{std::move(dataChunkDescriptors)} {}
+    explicit ResultSetDescriptor(planner::Schema* schema);
+    DELETE_BOTH_COPY(ResultSetDescriptor);
+
+    std::unique_ptr<ResultSetDescriptor> copy() const;
+
+    static std::unique_ptr<ResultSetDescriptor> EmptyDescriptor() {
+        return std::make_unique<ResultSetDescriptor>();
+    }
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/warning_context.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/warning_context.h
new file mode 100644
index 0000000000..dbac96ab51
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/processor/warning_context.h
@@ -0,0 +1,68 @@
+#pragma once
+
+#include <functional>
+#include <mutex>
+#include <vector>
+
+#include "common/api.h"
+#include "common/types/types.h"
+#include "processor/operator/persistent/reader/copy_from_error.h"
+
+namespace lbug {
+namespace common {
+class ValueVector;
+}
+namespace storage {
+class ColumnChunkData;
+}
+namespace main {
+struct ClientConfig;
+}
+namespace processor {
+
+class SerialCSVReader;
+
+struct WarningInfo {
+    uint64_t queryID;
+    PopulatedCopyFromError warning;
+
+    WarningInfo(PopulatedCopyFromError warning, uint64_t queryID)
+        : queryID(queryID), warning(std::move(warning)) {}
+};
+
+using populate_func_t = std::function<PopulatedCopyFromError(CopyFromFileError, common::idx_t)>;
+using get_file_idx_func_t = std::function<common::idx_t(const CopyFromFileError&)>;
+
+class LBUG_API WarningContext {
+public:
+    explicit WarningContext(main::ClientConfig* clientConfig);
+
+    void appendWarningMessages(const std::vector<CopyFromFileError>& messages);
+
+    void populateWarnings(uint64_t queryID, populate_func_t populateFunc = {},
+        get_file_idx_func_t getFileIdxFunc = {});
+    void defaultPopulateAllWarnings(uint64_t queryID);
+
+    const std::vector<WarningInfo>& getPopulatedWarnings() const;
+    uint64_t getWarningCount(uint64_t queryID);
+    void clearPopulatedWarnings();
+
+    void setIgnoreErrorsForCurrentQuery(bool ignoreErrors);
+    // NOTE: this function only works if the logical operator is COPY FROM
+    // for other operators setIgnoreErrorsForCurrentQuery() is not called
+    bool getIgnoreErrorsOption() const;
+
+    static WarningContext* Get(const main::ClientContext& context);
+
+private:
+    std::mutex mtx;
+    main::ClientConfig* clientConfig;
+    std::vector<CopyFromFileError> unpopulatedWarnings;
+    std::vector<WarningInfo> populatedWarnings;
+    uint64_t queryWarningCount;
+    uint64_t numStoredWarnings;
+    bool ignoreErrorsOption;
+};
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/buffer_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/buffer_manager.h
new file mode 100644
index 0000000000..5d51ab0491
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/buffer_manager.h
@@ -0,0 +1,298 @@
+#pragma once
+
+#include <atomic>
+#include <cstdint>
+#include <functional>
+#include <memory>
+#include <vector>
+
+#include "common/types/types.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/buffer_manager/page_state.h"
+#include "storage/enums/page_read_policy.h"
+#include "storage/file_handle.h"
+
+namespace lbug {
+namespace main {
+struct DBConfig;
+};
+namespace common {
+class VirtualFileSystem;
+};
+namespace testing {
+class FlakyBufferManager;
+class BufferManagerTest;
+class CopyTestHelper;
+}; // namespace testing
+namespace storage {
+class ChunkedNodeGroup;
+class Spiller;
+
+// This class keeps state info for pages potentially can be evicted.
+// The page state of a candidate is set to be MARKED when it is first enqueued. After enqueued, if
+// the candidate was recently accessed, it is no longer immediately evictable. See the state
+// transition diagram above `BufferManager` class declaration for more details.
+struct EvictionCandidate {
+    friend class EvictionQueue;
+
+    // If the candidate is MARKED, it is evictable.
+    static bool isEvictable(uint64_t currPageStateAndVersion) {
+        return PageState::getState(currPageStateAndVersion) == PageState::MARKED;
+    }
+    // If the candidate was recently read optimistically, it is second chance evictable.
+    static bool isSecondChanceEvictable(uint64_t currPageStateAndVersion) {
+        return PageState::getState(currPageStateAndVersion) == PageState::UNLOCKED;
+    }
+
+    bool operator==(const EvictionCandidate& other) const {
+        return fileIdx == other.fileIdx && pageIdx == other.pageIdx;
+    }
+
+    // Returns false if the candidate was not empty, or if another thread set the value first
+    bool set(const EvictionCandidate& newCandidate);
+
+    uint32_t fileIdx = UINT32_MAX;
+    common::page_idx_t pageIdx = common::INVALID_PAGE_IDX;
+};
+
+// A circular buffer queue storing eviction candidates
+// One candidate should be stored for each page currently in memory
+class EvictionQueue {
+public:
+    static constexpr auto EMPTY = EvictionCandidate{UINT32_MAX, common::INVALID_PAGE_IDX};
+    static constexpr size_t BATCH_SIZE = 64;
+    explicit EvictionQueue(uint64_t capacity)
+        // Capacity needs to be a multiple of the batch size
+        : insertCursor{0}, evictionCursor{0}, size{0},
+          capacity{capacity + (BATCH_SIZE - capacity % BATCH_SIZE)},
+          data{std::make_unique<std::atomic<EvictionCandidate>[]>(this->capacity)} {}
+
+    bool insert(uint32_t fileIndex, common::page_idx_t pageIndex);
+
+    // Produces the next non-empty candidate to be tried for eviction.
+    // Note that it is still possible (though unlikely) for another thread to evict this candidate,
+    // so it is not guaranteed to be empty.
+    // The PageState should be locked, and then the atomic checked against the version used when
+    // locking the page state to make sure there wasn't a data race
+    std::span<std::atomic<EvictionCandidate>, BATCH_SIZE> next();
+    void clear(std::atomic<EvictionCandidate>& candidate);
+
+    uint64_t getSize() const { return size; }
+    uint64_t getEvictionCursor() const { return evictionCursor; }
+    uint64_t getCapacity() const { return capacity; }
+
+private:
+    std::atomic<uint64_t> insertCursor;
+    std::atomic<uint64_t> evictionCursor;
+    std::atomic<uint64_t> size;
+    const uint64_t capacity;
+    std::unique_ptr<std::atomic<EvictionCandidate>[]> data;
+};
+
+/**
+ * The Buffer Manager (BM) is a centralized manager of database memory resources.
+ * It provides two main functionalities:
+ * 1) it provides the high-level functionality to pin() and unpin() the pages of the database files
+ * used by storage structures, such as the Column, Lists, or HashIndex in the storage layer, and
+ * operates via their FileHandle to read/write the page data into/out of one of the frames.
+ * 2) it provides optimistic read of pages, which optimistically read unlocked or marked pages
+ * without acquiring locks.
+ * 3) it supports the MemoryManager (MM) to allocate memory buffers that are not
+ * backed by any disk files. Similar to disk files, MM provides in-mem file handles to the BM to
+ * pin/unpin pages. Pin happens when MM tries to allocate a new memory buffer, and unpin happens
+ * when MM tries to reclaim a memory buffer.
+ *
+ * Specifically, in BM's context, page is the basic management unit of data in a file. The file can
+ * be a disk file, such as a column file, or an in-mem file, such as an temp in-memory file kept by
+ * the MM. Frame is the basic management unit of data resides in a VMRegion, namely in a virtual
+ * memory space. Each page is uniquely mapped to a frame, and it can be cached into or evicted from
+ * the frame. See `VMRegion` for more details.
+ *
+ * When users unpin their pages, the BM might spill them to disk. The behavior of what is guaranteed
+ * to be kept in frame and what can be spilled to disk is directly determined by the pin/unpin
+ * calls of the users.
+ *
+ * Also, BM provides some specialized functionalities for WAL files:
+ * 1) it supports the caller to set pinned pages as dirty, which will be safely written back to disk
+ * when the pages are evicted;
+ * 2) it supports the caller to flush or remove pages from the BM;
+ * 3) it supports the caller to directly update the content of a frame.
+ *
+ * All accesses to the BM are through a FileHandle. This design is to decentralize the management
+ * of page states from the BM to each file handle itself. Thus, each on-disk file should have a
+ * unique FileHandle, and MM also holds a unique FileHandle, which is backed by a temp in-mem
+ * file, for all memory buffer allocations
+ *
+ * To start a Database, users need to specify the max size of the memory usage (`maxSize`) in BM.
+ * If users don't specify the value, the system will set maxSize to available physical mem *
+ * DEFAULT_PHY_MEM_SIZE_RATIO_FOR_BM (defined in constants.h).
+ * The BM relies on virtual memory regions mapped through `mmap` to anonymous address spaces.
+ * 1) For disk pages, BM allocates a virtual memory region of DEFAULT_VM_REGION_MAX_SIZE (defined in
+ * constants.h), which is usually much larger than `maxSize`, and is expected to be large enough to
+ * contain all disk pages. Each disk page in database files is directly mapped to a unique
+ * PAGE_SIZE frame in the region.
+ * 2) For each FileHandle backed by a temp in-mem file in MM, BM allocates a virtual memory region
+ * of `maxSize` for it. Each memory buffer is mapped to a unique TEMP_PAGE_SIZE frame in that
+ * region. Both disk pages and memory buffers are all managed by the BM to make sure that actually
+ * used physical memory doesn't go beyond max size specified by users. Currently, the BM uses a
+ * queue based replacement policy and the MADV_DONTNEED hint to explicitly control evictions. See
+ * comments above `claimAFrame()` for more details.
+ *
+ * Page states in BM:
+ * A page can be in one of the four states: a) LOCKED, b) UNLOCKED, c) MARKED, d) EVICTED.
+ * Every page is initialized as in the EVICTED state.
+ * The state transition diagram of page X is as follows (oRead refers to optimisticRead):
+ * Note: optimistic reads on UNLOCKED pages don't make any changes to pages' states. oRead on
+ * UNLOCKED is omitted in the diagram.
+ *
+ *       7.2. pin(pY): evict pX.                       7.1. pin(pY): tryLock(pX)
+ *    |<-------------------------|<------------------------------------------------------------|
+ *    |                          |                           4. pin(pX)                        |
+ *    |                          |<------------------------------------------------------------|
+ *    |         1. pin(pX)       |        5. pin(pX)         6. pin(pY): 2nd chance eviction   |
+ * EVICTED ------------------> LOCKED <-------------UNLOCKED ------------------------------> MARKED
+ *                               |                      |             3. oRead(pX)             |
+ *                               |                      <--------------------------------------|
+ *                               |        2. unpin(pX): enqueue pX & increment version         |
+ *                               ------------------------------------------------------------->
+ *
+ * 1. When page pX at EVICTED state, and it is pinned, it transits to the Locked state. `pin` will
+ * first acquire the exclusive lock on the page, then read the page from the disk into its frame.
+ * The caller can safely make changes to the page.
+ * 2. When the caller finishes changes to the page, it calls `unpin`, which releases the lock on the
+ * page, puts the page into the eviction queue, and increments its version. The page now transits to
+ * the MARKED state. Note that currently the page is still cached, but it is ready to be evicted.
+ * The page version number is used to identify any potential writing on the page. Each time a page
+ * transits from LOCKED to MARKED state, we will increment its version. This happens when a page is
+ * pinned, then unpinned. During the pin and unpin, we assume the page's content in its
+ * corresponding frame might have changed, thus, we increment the version number to forbid stale
+ * reads on it;
+ * 3. The MARKED page can be optimistically read by the caller, setting the page's state to
+ * UNLOCKED. For evicted pages, optimistic reads will trigger pin and unpin to read pages from disk
+ * into frames.
+ * 4. The MARKED page can be pinned again by the caller, setting the page's state to LOCKED.
+ * 5. The UNLOCKED page can also be pinned again by the caller, setting the page's state to LOCKED.
+ * 6. During eviction, UNLOCKED pages will be checked if they are second chance evictable. If so,
+ * they will be set to MARKED, and their eviction candidates will be moved back to the eviction
+ * queue.
+ * 7. During eviction, if the page is in the MARKED state, it will be LOCKED first (7.1), then
+ * removed from its frame, and set to EVICTED (7.2).
+ *
+ * The design is inspired by vmcache in the paper "Virtual-Memory Assisted Buffer Management"
+ * (https://www.cs.cit.tum.de/fileadmin/w00cfj/dis/_my_direct_uploads/vmcache.pdf).
+ * We would also like to thank Fadhil Abubaker for doing the initial research and prototyping of
+ * Umbra's design in his CS 848 course project:
+ * https://github.com/fabubaker/lbug/blob/umbra-bm/final_project_report.pdf.
+ */
+class BufferManager {
+    friend class testing::FlakyBufferManager;
+    friend class testing::BufferManagerTest;
+    friend class testing::CopyTestHelper;
+
+    friend class FileHandle;
+    friend class MemoryManager;
+
+public:
+    BufferManager(const std::string& databasePath, const std::string& spillToDiskPath,
+        uint64_t bufferPoolSize, uint64_t maxDBSize, common::VirtualFileSystem* vfs, bool readOnly);
+    virtual ~BufferManager();
+
+    // Currently, these functions are specifically used only for WAL files.
+    void removeFilePagesFromFrames(FileHandle& fileHandle);
+    void updateFrameIfPageIsInFrameWithoutLock(common::file_idx_t fileIdx, const uint8_t* newPage,
+        common::page_idx_t pageIdx);
+
+    // For files that are managed by BM, their FileHandles should be created through this function.
+    FileHandle* getFileHandle(const std::string& filePath, uint8_t flags,
+        common::VirtualFileSystem* vfs, main::ClientContext* context) {
+        fileHandles.emplace_back(
+            std::make_unique<FileHandle>(filePath, flags, this, fileHandles.size(), vfs, context));
+        return fileHandles.back().get();
+    }
+
+    uint64_t getMemoryLimit() const { return bufferPoolSize; }
+    uint64_t getUsedMemory() const { return usedMemory; }
+
+    void getSpillerOrSkip(std::function<void(Spiller&)> func) {
+        if (spiller) {
+            return func(*spiller);
+        }
+    }
+
+    void resetSpiller(std::string spillPath);
+
+    // This function only works when run in a single-threaded context
+    // Iterates through the eviction queue and removes any elements that have already been evicted
+    // (due to some external intervention)
+    void removeEvictedCandidates();
+
+protected:
+    // Reclaims used memory until the given size to reserve is available.
+    // The specified amount of memory will be recorded as being used
+    virtual bool reserve(uint64_t sizeToReserve);
+
+private:
+    uint8_t* pin(FileHandle& fileHandle, common::page_idx_t pageIdx,
+        PageReadPolicy pageReadPolicy = PageReadPolicy::READ_PAGE);
+    void optimisticRead(FileHandle& fileHandle, common::page_idx_t pageIdx,
+        const std::function<void(uint8_t*)>& func);
+    // The function assumes that the requested page is already pinned.
+    void unpin(FileHandle& fileHandle, common::page_idx_t pageIdx);
+    uint8_t* getFrame(FileHandle& fileHandle, common::page_idx_t pageIdx) const {
+#if BM_MALLOC
+        return fileHandle.getPageState(pageIdx)->getPage();
+#else
+        return vmRegions[fileHandle.getPageSizeClass()]->getFrame(fileHandle.getFrameIdx(pageIdx));
+#endif
+    }
+    common::frame_group_idx_t addNewFrameGroup(
+        common::PageSizeClass pageSizeClass [[maybe_unused]]) {
+#if BM_MALLOC
+        return 0;
+#else
+        return vmRegions[pageSizeClass]->addNewFrameGroup();
+#endif
+    }
+    void removePageFromFrameIfNecessary(FileHandle& fileHandle, common::page_idx_t pageIdx);
+
+    static void verifySizeParams(uint64_t bufferPoolSize, uint64_t maxDBSize);
+
+    bool claimAFrame(FileHandle& fileHandle, common::page_idx_t pageIdx,
+        PageReadPolicy pageReadPolicy);
+    // Return number of bytes freed.
+    uint64_t tryEvictPage(std::atomic<EvictionCandidate>& candidate);
+
+    void cachePageIntoFrame(FileHandle& fileHandle, common::page_idx_t pageIdx,
+        PageReadPolicy pageReadPolicy);
+    void removePageFromFrame(FileHandle& fileHandle, common::page_idx_t pageIdx, bool shouldFlush);
+
+    uint64_t freeUsedMemory(uint64_t size);
+
+    void releaseFrameForPage(FileHandle& fileHandle [[maybe_unused]],
+        common::page_idx_t pageIdx [[maybe_unused]]) {
+#if BM_MALLOC
+        // Page is freed instead in PageState::resetToEvicted
+#else
+        vmRegions[fileHandle.getPageSizeClass()]->releaseFrame(fileHandle.getFrameIdx(pageIdx));
+#endif
+    }
+
+    uint64_t evictPages();
+
+private:
+    std::atomic<uint64_t> bufferPoolSize;
+    EvictionQueue evictionQueue;
+    // Total memory used
+    std::atomic<uint64_t> usedMemory;
+    // Amount of memory used, which cannot be evicted
+    std::atomic<uint64_t> nonEvictableMemory;
+    // Each VMRegion corresponds to a virtual memory region of a specific page size. Currently, we
+    // hold two sizes of REGULAR_PAGE and TEMP_PAGE.
+    std::array<std::unique_ptr<VMRegion>, 2> vmRegions;
+    std::vector<std::unique_ptr<FileHandle>> fileHandles;
+    std::unique_ptr<Spiller> spiller;
+    common::VirtualFileSystem* vfs;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/memory_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/memory_manager.h
new file mode 100644
index 0000000000..3915e899d4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/memory_manager.h
@@ -0,0 +1,110 @@
+#pragma once
+
+#include <cstdint>
+#include <memory>
+#include <mutex>
+#include <stack>
+
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/spill_result.h"
+#include <span>
+
+namespace lbug {
+
+namespace common {
+class VirtualFileSystem;
+}
+
+namespace storage {
+
+class MemoryManager;
+class FileHandle;
+class BufferManager;
+class ChunkedNodeGroup;
+template<class T>
+class MmAllocator;
+
+class MemoryBuffer {
+    friend class Spiller;
+
+public:
+    LBUG_API MemoryBuffer(MemoryManager* mm, common::page_idx_t blockIdx, uint8_t* buffer,
+        uint64_t size = common::TEMP_PAGE_SIZE);
+    LBUG_API ~MemoryBuffer();
+    DELETE_COPY_AND_MOVE(MemoryBuffer);
+
+    std::span<uint8_t> getBuffer() const {
+        KU_ASSERT(!evicted);
+        return buffer;
+    }
+    uint8_t* getData() const { return getBuffer().data(); }
+
+    MemoryManager* getMemoryManager() const { return mm; }
+
+    // Manually set the evicted state of the buffer to avoid double free.
+    void preventDestruction() { evicted = true; }
+
+private:
+    // Can be called multiple times safely
+    void prepareLoadFromDisk();
+
+    // Must only be called once before loading from disk
+    SpillResult setSpilledToDisk(uint64_t filePosition);
+
+private:
+    std::span<uint8_t> buffer;
+    uint64_t filePosition = UINT64_MAX;
+    MemoryManager* mm;
+    common::page_idx_t pageIdx;
+    bool evicted;
+};
+
+/*
+ * The Memory Manager (MM) is used for allocating/reclaiming intermediate memory blocks.
+ * It can allocate a memory buffer of size PAGE_256KB from the buffer manager backed by a
+ * BMFileHandle with temp in-mem file.
+ *
+ * The MemoryManager holds a BMFileHandle backed by
+ * a temp in-mem file, and is responsible for allocating/reclaiming memory buffers of its size class
+ * from the buffer manager. The MemoryManager keeps track of free pages in the BMFileHandle, so
+ * that it can reuse those freed pages without allocating new pages. The MemoryManager is
+ * thread-safe, so that multiple threads can allocate/reclaim memory blocks with the same size class
+ * at the same time.
+ *
+ * MM will return a MemoryBuffer to the caller, which is a wrapper of the allocated memory block,
+ * and it will automatically call its allocator to reclaim the memory block when it is destroyed.
+ */
+class LBUG_API MemoryManager {
+    friend class MemoryBuffer;
+    template<class T>
+    friend class MmAllocator;
+
+public:
+    MemoryManager(BufferManager* bm, common::VirtualFileSystem* vfs);
+
+    ~MemoryManager() = default;
+
+    std::unique_ptr<MemoryBuffer> allocateBuffer(bool initializeToZero = false,
+        uint64_t size = common::TEMP_PAGE_SIZE);
+    common::page_offset_t getPageSize() const { return pageSize; }
+
+    BufferManager* getBufferManager() const { return bm; }
+
+    static MemoryManager* Get(const main::ClientContext& context);
+
+private:
+    void freeBlock(common::page_idx_t pageIdx, std::span<uint8_t> buffer);
+    void updateUsedMemoryForFreedBlock(common::page_idx_t pageIdx, std::span<uint8_t> buffer);
+    std::span<uint8_t> mallocBuffer(bool initializeToZero, uint64_t size);
+
+private:
+    FileHandle* fh;
+    BufferManager* bm;
+    common::page_offset_t pageSize;
+    std::stack<common::page_idx_t> freePages;
+    std::mutex allocatorLock;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/mm_allocator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/mm_allocator.h
new file mode 100644
index 0000000000..570c2f7579
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/mm_allocator.h
@@ -0,0 +1,54 @@
+#pragma once
+
+#include "memory_manager.h"
+
+namespace lbug {
+namespace storage {
+
+template<class T>
+class MmAllocator {
+public:
+    using value_type = T;
+
+    explicit MmAllocator(MemoryManager* mm) : mm{mm} {}
+
+    MmAllocator(const MmAllocator& other) : mm{other.mm} {}
+    MmAllocator& operator=(const MmAllocator& other) = default;
+    DELETE_BOTH_MOVE(MmAllocator);
+
+    [[nodiscard]] T* allocate(const std::size_t size) {
+        KU_ASSERT_UNCONDITIONAL(mm != nullptr);
+        KU_ASSERT_UNCONDITIONAL(size > 0);
+        KU_ASSERT_UNCONDITIONAL(size <= std::numeric_limits<std::size_t>::max() / sizeof(T));
+
+        auto buffer = mm->mallocBuffer(false, size * sizeof(T));
+        auto p = reinterpret_cast<T*>(buffer.data());
+
+        // Ensure proper alignment
+        KU_ASSERT_UNCONDITIONAL(reinterpret_cast<std::uintptr_t>(p) % alignof(T) == 0);
+
+        return p;
+    }
+
+    void deallocate(T* p, const std::size_t size) noexcept {
+        KU_ASSERT_UNCONDITIONAL(mm != nullptr);
+        KU_ASSERT_UNCONDITIONAL(p != nullptr);
+        KU_ASSERT_UNCONDITIONAL(size > 0);
+
+        const auto buffer = std::span(reinterpret_cast<uint8_t*>(p), size * sizeof(T));
+        if (buffer.data() != nullptr) {
+            mm->freeBlock(common::INVALID_PAGE_IDX, buffer);
+        }
+    }
+
+private:
+    MemoryManager* mm;
+};
+
+template<class T, class U>
+bool operator==(const MmAllocator<T>& a, const MmAllocator<U>& b) {
+    return a.mm == b.mm;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/page_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/page_state.h
new file mode 100644
index 0000000000..8d504b0eb0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/page_state.h
@@ -0,0 +1,117 @@
+#pragma once
+
+#include <atomic>
+
+#include "common/assert.h"
+
+// Alternative variant of the buffer manager which doesn't rely on MADV_DONTNEED (on Unix) for
+// evicting pages (which is unavailable in Webassembly runtimes)
+#if BM_MALLOC
+#include <memory>
+#endif
+
+namespace lbug {
+namespace storage {
+
+// Keeps the state information of a page in a file.
+class PageState {
+    static constexpr uint64_t DIRTY_MASK = 0x0080000000000000;
+    static constexpr uint64_t STATE_MASK = 0xFF00000000000000;
+    static constexpr uint64_t VERSION_MASK = 0x00FFFFFFFFFFFFFF;
+    static constexpr uint64_t NUM_BITS_TO_SHIFT_FOR_STATE = 56;
+
+public:
+    static constexpr uint64_t UNLOCKED = 0;
+    static constexpr uint64_t LOCKED = 1;
+    static constexpr uint64_t MARKED = 2;
+    static constexpr uint64_t EVICTED = 3;
+
+    PageState() { stateAndVersion.store(EVICTED << NUM_BITS_TO_SHIFT_FOR_STATE); }
+
+    uint64_t getState() const { return getState(stateAndVersion.load()); }
+    static uint64_t getState(uint64_t stateAndVersion) {
+        return (stateAndVersion & STATE_MASK) >> NUM_BITS_TO_SHIFT_FOR_STATE;
+    }
+    static uint64_t getVersion(uint64_t stateAndVersion) { return stateAndVersion & VERSION_MASK; }
+    static uint64_t updateStateWithSameVersion(uint64_t oldStateAndVersion, uint64_t newState) {
+        return ((oldStateAndVersion << 8) >> 8) | (newState << NUM_BITS_TO_SHIFT_FOR_STATE);
+    }
+    static uint64_t updateStateAndIncrementVersion(uint64_t oldStateAndVersion, uint64_t newState) {
+        return (((oldStateAndVersion << 8) >> 8) + 1) | (newState << NUM_BITS_TO_SHIFT_FOR_STATE);
+    }
+    void spinLock(uint64_t oldStateAndVersion) {
+        while (true) {
+            if (tryLock(oldStateAndVersion)) {
+                return;
+            }
+        }
+    }
+    bool tryLock(uint64_t oldStateAndVersion) {
+        return stateAndVersion.compare_exchange_strong(oldStateAndVersion,
+            updateStateWithSameVersion(oldStateAndVersion, LOCKED));
+    }
+    void unlock() {
+        // TODO(Keenan / Guodong): Track down this rare bug and re-enable the assert. Ref #2289.
+        // KU_ASSERT(getState(stateAndVersion.load()) == LOCKED);
+        stateAndVersion.store(updateStateAndIncrementVersion(stateAndVersion.load(), UNLOCKED));
+    }
+    void unlockUnchanged() {
+        // TODO(Keenan / Guodong): Track down this rare bug and re-enable the assert. Ref #2289.
+        // KU_ASSERT(getState(stateAndVersion.load()) == LOCKED);
+        stateAndVersion.store(updateStateWithSameVersion(stateAndVersion.load(), UNLOCKED));
+    }
+    // Change page state from Mark to Unlocked.
+    bool tryClearMark(uint64_t oldStateAndVersion) {
+        KU_ASSERT(getState(oldStateAndVersion) == MARKED);
+        return stateAndVersion.compare_exchange_strong(oldStateAndVersion,
+            updateStateWithSameVersion(oldStateAndVersion, UNLOCKED));
+    }
+    bool tryMark(uint64_t oldStateAndVersion) {
+        return stateAndVersion.compare_exchange_strong(oldStateAndVersion,
+            updateStateWithSameVersion(oldStateAndVersion, MARKED));
+    }
+
+    void setDirty() {
+        KU_ASSERT(getState(stateAndVersion.load()) == LOCKED);
+        stateAndVersion |= DIRTY_MASK;
+    }
+    void clearDirty() {
+        KU_ASSERT(getState(stateAndVersion.load()) == LOCKED);
+        stateAndVersion &= ~DIRTY_MASK;
+    }
+    // Meant to be used when flushing in a single thread.
+    // Should not be used if other threads are modifying the page state
+    void clearDirtyWithoutLock() { stateAndVersion &= ~DIRTY_MASK; }
+    bool isDirty() const { return stateAndVersion & DIRTY_MASK; }
+    uint64_t getStateAndVersion() const { return stateAndVersion.load(); }
+
+    void resetToEvicted() {
+        stateAndVersion.store(EVICTED << NUM_BITS_TO_SHIFT_FOR_STATE);
+#if BM_MALLOC
+        page.reset();
+#endif
+    }
+
+#if BM_MALLOC
+    uint8_t* getPage() const { return page.get(); }
+    uint8_t* allocatePage(uint64_t pageSize) {
+        page = std::make_unique<uint8_t[]>(pageSize);
+        return page.get();
+    }
+    uint16_t getReaderCount() const { return readerCount; }
+    void addReader() { readerCount++; }
+    void removeReader() { readerCount--; }
+#endif
+
+private:
+    // Highest 1 bit is dirty bit, and the rest are page state and version bits.
+    // In the rest bits, the lowest 1 byte is state, and the rest are version.
+    std::atomic<uint64_t> stateAndVersion;
+#if BM_MALLOC
+    std::unique_ptr<uint8_t[]> page;
+    std::atomic<uint16_t> readerCount;
+#endif
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/spill_result.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/spill_result.h
new file mode 100644
index 0000000000..45907925cf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/spill_result.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace storage {
+
+struct SpillResult {
+    uint64_t memoryFreed = 0;
+    uint64_t memoryNowEvictable = 0;
+
+    SpillResult& operator+=(const SpillResult& other) {
+        memoryFreed += other.memoryFreed;
+        memoryNowEvictable += other.memoryNowEvictable;
+        return *this;
+    }
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/spiller.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/spiller.h
new file mode 100644
index 0000000000..fe04968546
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/spiller.h
@@ -0,0 +1,47 @@
+#pragma once
+
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/file_handle.h"
+
+namespace lbug {
+namespace common {
+class VirtualFileSystem;
+};
+namespace storage {
+class InMemChunkedNodeGroup;
+
+class BufferManager;
+class ColumnChunkData;
+
+// This should only be used with a LocalFileSystem
+class Spiller {
+public:
+    Spiller(std::string tmpFilePath, BufferManager& bufferManager, common::VirtualFileSystem* vfs);
+    void addUnusedChunk(InMemChunkedNodeGroup* nodeGroup);
+    void clearUnusedChunk(InMemChunkedNodeGroup* nodeGroup);
+    SpillResult spillToDisk(ColumnChunkData& chunk) const;
+    void loadFromDisk(ColumnChunkData& chunk) const;
+    // reclaims memory from the next full partitioner group in the set
+    // and returns the amount of memory reclaimed
+    // If the set is empty, returns zero
+    SpillResult claimNextGroup();
+    // Must only be used once all chunks have been loaded from disk.
+    void clearFile();
+    ~Spiller();
+
+private:
+    FileHandle* getOrCreateDataFH() const;
+    FileHandle* getDataFH() const;
+
+private:
+    std::string tmpFilePath;
+    BufferManager& bufferManager;
+    common::VirtualFileSystem* vfs;
+    std::unordered_set<InMemChunkedNodeGroup*> fullPartitionerGroups;
+    std::atomic<FileHandle*> dataFH;
+    std::mutex partitionerGroupsMtx;
+    mutable std::mutex fileCreationMutex;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/vm_region.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/vm_region.h
new file mode 100644
index 0000000000..1bf70837a7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/buffer_manager/vm_region.h
@@ -0,0 +1,50 @@
+#pragma once
+
+#include <mutex>
+
+#include "common/constants.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace storage {
+
+// A VMRegion holds a virtual memory region of a certain size allocated through mmap.
+// The region is divided into frame groups, each of which is a group of frames of the same size.
+// Each FileHandle should grab a frame group each time when they add a new file page group (see
+// `FileHandle::addNewPageGroupWithoutLock`). In this way, each file page group uniquely
+// corresponds to a frame group, thus, a page also uniquely corresponds to a frame in a VMRegion.
+class VMRegion {
+    friend class BufferManager;
+
+public:
+    explicit VMRegion(common::PageSizeClass pageSizeClass, uint64_t maxRegionSize);
+    ~VMRegion();
+
+    common::frame_group_idx_t addNewFrameGroup();
+
+    // Use `MADV_DONTNEED` to release physical memory associated with this frame.
+    void releaseFrame(common::frame_idx_t frameIdx) const;
+
+    // Returns true if the memory address is within the reserved virtual memory region
+    bool contains(const uint8_t* address) const {
+        return address >= region && address < region + getMaxRegionSize();
+    }
+    inline uint8_t* getFrame(common::frame_idx_t frameIdx) const {
+        return region + (static_cast<std::uint64_t>(frameIdx) * frameSize);
+    }
+
+private:
+    inline uint64_t getMaxRegionSize() const {
+        return maxNumFrameGroups * frameSize * common::StorageConstants::PAGE_GROUP_SIZE;
+    }
+
+private:
+    std::mutex mtx;
+    uint8_t* region;
+    uint32_t frameSize;
+    uint64_t numFrameGroups;
+    uint64_t maxNumFrameGroups;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/checkpointer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/checkpointer.h
new file mode 100644
index 0000000000..1497ccb07b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/checkpointer.h
@@ -0,0 +1,62 @@
+#pragma once
+
+#include "storage/database_header.h"
+#include "storage/page_range.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+}
+namespace catalog {
+class Catalog;
+}
+namespace common {
+class VirtualFileSystem;
+} // namespace common
+namespace testing {
+struct FSMLeakChecker;
+}
+namespace main {
+class AttachedLbugDatabase;
+} // namespace main
+
+namespace storage {
+class StorageManager;
+
+class Checkpointer {
+    friend class main::AttachedLbugDatabase;
+    friend struct testing::FSMLeakChecker;
+
+public:
+    explicit Checkpointer(main::ClientContext& clientContext);
+    virtual ~Checkpointer();
+
+    void writeCheckpoint();
+    void rollback();
+
+    void readCheckpoint();
+
+    static bool canAutoCheckpoint(const main::ClientContext& clientContext,
+        const transaction::Transaction& transaction);
+
+protected:
+    virtual bool checkpointStorage();
+    virtual void serializeCatalogAndMetadata(DatabaseHeader& databaseHeader,
+        bool hasStorageChanges);
+    virtual void writeDatabaseHeader(const DatabaseHeader& header);
+    virtual void logCheckpointAndApplyShadowPages();
+
+private:
+    static void readCheckpoint(main::ClientContext* context, catalog::Catalog* catalog,
+        StorageManager* storageManager);
+
+    PageRange serializeCatalog(const catalog::Catalog& catalog, StorageManager& storageManager);
+    PageRange serializeMetadata(const catalog::Catalog& catalog, StorageManager& storageManager);
+
+protected:
+    main::ClientContext& clientContext;
+    bool isInMemory;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/bitpacking_int128.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/bitpacking_int128.h
new file mode 100644
index 0000000000..a21f8b7b1f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/bitpacking_int128.h
@@ -0,0 +1,17 @@
+// Adapted from
+// https://github.com/duckdb/duckdb/blob/main/src/include/duckdb/common/bitpacking.hpp
+
+#pragma once
+
+#include "common/types/int128_t.h"
+
+namespace lbug::storage {
+
+struct Int128Packer {
+    static void pack(const common::int128_t* __restrict in, uint32_t* __restrict out,
+        uint8_t width);
+    static void unpack(const uint32_t* __restrict in, common::int128_t* __restrict out,
+        uint8_t width);
+};
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/bitpacking_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/bitpacking_utils.h
new file mode 100644
index 0000000000..f7671de291
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/bitpacking_utils.h
@@ -0,0 +1,23 @@
+// Adapted from
+// https://github.com/duckdb/duckdb/blob/main/src/include/duckdb/common/bitpacking.hpp
+
+#pragma once
+
+#include "storage/compression/compression.h"
+
+namespace lbug::storage {
+
+template<IntegerBitpackingType UncompressedType>
+struct BitpackingUtils {
+    using CompressedType =
+        std::conditional_t<sizeof(UncompressedType) >= sizeof(uint32_t), uint32_t, uint8_t>;
+    static constexpr size_t sizeOfCompressedTypeBits = sizeof(CompressedType) * 8;
+
+    static void unpackSingle(const uint8_t* __restrict src, UncompressedType* __restrict dst,
+        uint16_t bitWidth, size_t srcOffset);
+
+    static void packSingle(const UncompressedType src, uint8_t* __restrict dstCursor,
+        uint16_t bitWidth, size_t dstOffset);
+};
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/compression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/compression.h
new file mode 100644
index 0000000000..0319afc228
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/compression.h
@@ -0,0 +1,498 @@
+#pragma once
+
+#include <cstdint>
+#include <cstring>
+#include <limits>
+#include <optional>
+#include <type_traits>
+
+#include "alp/state.hpp"
+#include "common/assert.h"
+#include "common/null_mask.h"
+#include "common/numeric_utils.h"
+#include "common/types/types.h"
+#include <span>
+
+namespace lbug {
+namespace common {
+class ValueVector;
+class NullMask;
+} // namespace common
+
+namespace storage {
+class ColumnChunkData;
+
+struct PageCursor;
+
+template<typename T>
+concept StorageValueType = (common::numeric_utils::IsIntegral<T> || std::floating_point<T>);
+// Type storing values in the column chunk statistics
+// Only supports integers (up to 128bit), floats and bools
+union StorageValue {
+    int64_t signedInt;
+    uint64_t unsignedInt;
+    double floatVal;
+    common::int128_t signedInt128;
+
+    StorageValue() = default;
+    template<typename T>
+        requires std::same_as<std::remove_cvref_t<T>, common::int128_t>
+    explicit StorageValue(T value) : signedInt128(value) {}
+
+    template<typename T>
+        requires std::integral<T> && std::numeric_limits<T>::is_signed
+    // zero-initialize union padding
+    explicit StorageValue(T value) : StorageValue(common::int128_t(0)) {
+        signedInt = value;
+    }
+
+    template<typename T>
+        requires std::integral<T> && (!std::numeric_limits<T>::is_signed)
+    explicit StorageValue(T value) : StorageValue(common::int128_t(0)) {
+        unsignedInt = value;
+    }
+
+    template<typename T>
+        requires std::is_floating_point_v<T>
+    explicit StorageValue(T value) : StorageValue(common::int128_t(0)) {
+        floatVal = value;
+    }
+
+    bool operator==(const StorageValue& other) const {
+        // We zero-initialize any padding bits, so we can compare values to check equality
+        return this->signedInt128 == other.signedInt128;
+    }
+
+    template<StorageValueType T>
+    StorageValue& operator=(const T& val) {
+        return *this = StorageValue(val);
+    }
+
+    template<StorageValueType T>
+    T get() const {
+        if constexpr (std::same_as<std::remove_cvref_t<T>, common::int128_t>) {
+            return signedInt128;
+        } else if constexpr (std::integral<T>) {
+            if constexpr (std::numeric_limits<T>::is_signed) {
+                return static_cast<T>(signedInt);
+            } else {
+                return static_cast<T>(unsignedInt);
+            }
+        } else if constexpr (std::is_floating_point<T>()) {
+            return floatVal;
+        } else {
+            KU_UNREACHABLE;
+        }
+    }
+
+    bool gt(const StorageValue& other, common::PhysicalTypeID type) const;
+
+    // If the type cannot be stored in the statistics, readFromVector will return nullopt
+    static std::optional<StorageValue> readFromVector(const common::ValueVector& vector,
+        common::offset_t posInVector);
+};
+static_assert(std::is_trivial_v<StorageValue>);
+
+std::pair<std::optional<StorageValue>, std::optional<StorageValue>> getMinMaxStorageValue(
+    const ColumnChunkData& data, uint64_t offset, uint64_t numValues,
+    common::PhysicalTypeID physicalType, bool valueRequiredIfUnsupported = false);
+
+// Expects bools to be one bool per bit (like ColumnChunkData, not like ValueVector)
+std::pair<std::optional<StorageValue>, std::optional<StorageValue>> getMinMaxStorageValue(
+    const uint8_t* data, uint64_t offset, uint64_t numValues, common::PhysicalTypeID physicalType,
+    const common::NullMask* nullMask, bool valueRequiredIfUnsupported = false);
+
+std::pair<std::optional<StorageValue>, std::optional<StorageValue>> getMinMaxStorageValue(
+    const common::ValueVector& data, uint64_t offset, uint64_t numValues,
+    common::PhysicalTypeID physicalType, bool valueRequiredIfUnsupported = false);
+
+// Returns the size of the data type in bytes
+uint32_t getDataTypeSizeInChunk(const common::LogicalType& dataType);
+uint32_t getDataTypeSizeInChunk(const common::PhysicalTypeID& dataType);
+
+// Compression type is written to the data header both so we can usually catch issues when we
+// decompress uncompressed data by mistake, and to allow for runtime-configurable compression.
+enum class CompressionType : uint8_t {
+    UNCOMPRESSED = 0,
+    INTEGER_BITPACKING = 1,
+    BOOLEAN_BITPACKING = 2,
+    CONSTANT = 3,
+    ALP = 4,
+};
+
+struct ExtraMetadata {
+    virtual ~ExtraMetadata() = default;
+    virtual std::unique_ptr<ExtraMetadata> copy() = 0;
+};
+
+// used only for compressing floats/doubles
+struct ALPMetadata : ExtraMetadata {
+    ALPMetadata() : exp(0), fac(0), exceptionCount(0), exceptionCapacity(0) {}
+    explicit ALPMetadata(const alp::state& alpState, common::PhysicalTypeID physicalType);
+
+    uint8_t exp;
+    uint8_t fac;
+    uint32_t exceptionCount;
+    uint32_t exceptionCapacity;
+
+    void serialize(common::Serializer& serializer) const;
+    static ALPMetadata deserialize(common::Deserializer& deserializer);
+
+    std::unique_ptr<ExtraMetadata> copy() override;
+};
+
+struct InPlaceUpdateLocalState {
+    struct FloatState {
+        size_t newExceptionCount;
+    } floatState;
+};
+
+// Data statistics used for determining how to handle compressed data
+struct LBUG_API CompressionMetadata {
+
+    // Minimum and maximum are upper and lower bounds for the data.
+    // Updates and deletions may cause them to no longer be the exact minimums and maximums,
+    // but no value will be larger than the maximum or smaller than the minimum
+    StorageValue min;
+    StorageValue max;
+
+    CompressionType compression;
+
+    std::optional<std::unique_ptr<ExtraMetadata>> extraMetadata;
+
+    std::vector<CompressionMetadata> children;
+
+    CompressionMetadata(StorageValue min, StorageValue max, CompressionType compression)
+        : min(min), max(max), compression(compression), extraMetadata() {}
+
+    // constructor for float metadata
+    CompressionMetadata(StorageValue min, StorageValue max, CompressionType compression,
+        const alp::state& state, StorageValue minEncoded, StorageValue maxEncoded,
+        common::PhysicalTypeID physicalType);
+
+    CompressionMetadata(const CompressionMetadata&);
+    CompressionMetadata& operator=(const CompressionMetadata&);
+
+    static size_t getChildCount(CompressionType compressionType);
+
+    inline bool isConstant() const { return compression == CompressionType::CONSTANT; }
+    const CompressionMetadata& getChild(common::offset_t idx) const;
+
+    // accessors for additionalMetadata
+    inline const ExtraMetadata* getExtraMetadata() const {
+        KU_ASSERT(extraMetadata.has_value());
+        return extraMetadata.value().get();
+    }
+    inline ExtraMetadata* getExtraMetadata() {
+        KU_ASSERT(extraMetadata.has_value());
+        return extraMetadata.value().get();
+    }
+    inline const ALPMetadata* floatMetadata() const {
+        return common::ku_dynamic_cast<const ALPMetadata*>(getExtraMetadata());
+    }
+    inline ALPMetadata* floatMetadata() {
+        return common::ku_dynamic_cast<ALPMetadata*>(getExtraMetadata());
+    }
+
+    void serialize(common::Serializer& serializer) const;
+    static CompressionMetadata deserialize(common::Deserializer& deserializer);
+
+    // Returns the number of values which will be stored in the given data size
+    // This must be consistent with the compression implementation for the given size
+    uint64_t numValues(uint64_t dataSize, common::PhysicalTypeID dataType) const;
+    uint64_t numValues(uint64_t dataSize, const common::LogicalType& dataType) const;
+    // Returns true if and only if the provided value within the vector can be updated
+    // in this chunk in-place.
+    bool canUpdateInPlace(const uint8_t* data, uint32_t pos, uint64_t numValues,
+        common::PhysicalTypeID physicalType, InPlaceUpdateLocalState& localUpdateState,
+        const std::optional<common::NullMask>& nullMask = std::nullopt) const;
+    bool canAlwaysUpdateInPlace() const;
+
+    std::string toString(const common::PhysicalTypeID physicalType) const;
+};
+
+class CompressionAlg {
+public:
+    virtual ~CompressionAlg() = default;
+
+    // Takes a single uncompressed value from the srcBuffer and compresses it into the dstBuffer
+    // Offsets refer to value offsets, not byte offsets
+    //
+    // nullMask may be null if no mask is available (all values are non-null)
+    // Storage of null values is handled by the implementation and decompression of null values
+    // does not have to produce the original value passed to this function.
+    virtual void setValuesFromUncompressed(const uint8_t* srcBuffer, common::offset_t srcOffset,
+        uint8_t* dstBuffer, common::offset_t dstOffset, common::offset_t numValues,
+        const CompressionMetadata& metadata, const common::NullMask* nullMask) const = 0;
+
+    // Takes uncompressed data from the srcBuffer and compresses it into the dstBuffer
+    //
+    // stores only as much data in dstBuffer as will fit, and advances the srcBuffer pointer
+    // to the beginning of the next value to store.
+    // (This means that we can't start the next page on an unaligned value.
+    // Maybe instead we could use value offsets, but the compression algorithms
+    // usually work on aligned chunks anyway)
+    //
+    // dstBufferSize is the size in bytes
+    // numValuesRemaining is the number of values remaining in the srcBuffer to be compressed.
+    //      compressNextPage must store the least of either the number of values per page
+    //      (as calculated by CompressionMetadata::numValues), or the remaining number of values.
+    //
+    // returns the size in bytes of the compressed data within the page (rounded up to the nearest
+    // byte)
+    virtual uint64_t compressNextPage(const uint8_t*& srcBuffer, uint64_t numValuesRemaining,
+        uint8_t* dstBuffer, uint64_t dstBufferSize,
+        const struct CompressionMetadata& metadata) const = 0;
+
+    // Takes compressed data from the srcBuffer and decompresses it into the dstBuffer
+    // Offsets refer to value offsets, not byte offsets
+    // srcBuffer points to the beginning of a page
+    virtual void decompressFromPage(const uint8_t* srcBuffer, uint64_t srcOffset,
+        uint8_t* dstBuffer, uint64_t dstOffset, uint64_t numValues,
+        const CompressionMetadata& metadata) const = 0;
+
+    virtual CompressionType getCompressionType() const = 0;
+};
+
+class ConstantCompression final : public CompressionAlg {
+public:
+    explicit ConstantCompression(const common::LogicalType& logicalType)
+        : numBytesPerValue{static_cast<uint8_t>(getDataTypeSizeInChunk(logicalType))},
+          dataType{logicalType.getPhysicalType()} {}
+    static std::optional<CompressionMetadata> analyze(const ColumnChunkData& chunk);
+
+    // Shouldn't be used, there's a special case when compressing which ends early for constant
+    // compression
+    uint64_t compressNextPage(const uint8_t*&, uint64_t, uint8_t*, uint64_t,
+        const struct CompressionMetadata&) const override {
+        return 0;
+    };
+
+    static void decompressValues(uint8_t* dstBuffer, uint64_t dstOffset, uint64_t numValues,
+        common::PhysicalTypeID physicalType, uint32_t numBytesPerValue,
+        const CompressionMetadata& metadata);
+
+    void decompressFromPage(const uint8_t* /*srcBuffer*/, uint64_t /*srcOffset*/,
+        uint8_t* dstBuffer, uint64_t dstOffset, uint64_t numValues,
+        const CompressionMetadata& metadata) const override;
+
+    void copyFromPage(const uint8_t* /*srcBuffer*/, uint64_t /*srcOffset*/, uint8_t* dstBuffer,
+        uint64_t dstOffset, uint64_t numValues, const CompressionMetadata& metadata) const;
+
+    // Nothing to do; constant compressed data is only updated if the update is to the same value
+    void setValuesFromUncompressed(const uint8_t*, common::offset_t, uint8_t*, common::offset_t,
+        common::offset_t, const CompressionMetadata&,
+        const common::NullMask* /*nullMask*/) const override {}
+
+    CompressionType getCompressionType() const override { return CompressionType::CONSTANT; }
+
+private:
+    uint8_t numBytesPerValue;
+    common::PhysicalTypeID dataType;
+};
+
+// Compression alg which does not compress values and instead just copies them.
+class Uncompressed : public CompressionAlg {
+public:
+    explicit Uncompressed(common::PhysicalTypeID physicalType)
+        : numBytesPerValue{getDataTypeSizeInChunk(physicalType)} {}
+    explicit Uncompressed(const common::LogicalType& logicalType)
+        : Uncompressed(logicalType.getPhysicalType()) {}
+    explicit Uncompressed(uint8_t numBytesPerValue) : numBytesPerValue{numBytesPerValue} {}
+
+    Uncompressed(const Uncompressed&) = default;
+
+    inline void setValuesFromUncompressed(const uint8_t* srcBuffer, common::offset_t srcOffset,
+        uint8_t* dstBuffer, common::offset_t dstOffset, common::offset_t numValues,
+        const CompressionMetadata& /*metadata*/, const common::NullMask* /*nullMask*/) const final {
+        memcpy(dstBuffer + dstOffset * numBytesPerValue, srcBuffer + srcOffset * numBytesPerValue,
+            numBytesPerValue * numValues);
+    }
+
+    static uint64_t numValues(uint64_t dataSize, common::PhysicalTypeID physicalType);
+    static uint64_t numValues(uint64_t dataSize, const common::LogicalType& logicalType);
+
+    inline uint64_t compressNextPage(const uint8_t*& srcBuffer, uint64_t numValuesRemaining,
+        uint8_t* dstBuffer, uint64_t dstBufferSize,
+        const struct CompressionMetadata& /*metadata*/) const override {
+        if (numBytesPerValue == 0) {
+            return 0;
+        }
+        uint64_t numValues = std::min(numValuesRemaining, dstBufferSize / numBytesPerValue);
+        uint64_t sizeToCopy = numValues * numBytesPerValue;
+        KU_ASSERT(sizeToCopy <= dstBufferSize);
+        std::memcpy(dstBuffer, srcBuffer, sizeToCopy);
+        srcBuffer += sizeToCopy;
+        return sizeToCopy;
+    }
+
+    inline void decompressFromPage(const uint8_t* srcBuffer, uint64_t srcOffset, uint8_t* dstBuffer,
+        uint64_t dstOffset, uint64_t numValues,
+        const CompressionMetadata& /*metadata*/) const override {
+        std::memcpy(dstBuffer + dstOffset * numBytesPerValue,
+            srcBuffer + srcOffset * numBytesPerValue, numValues * numBytesPerValue);
+    }
+
+    CompressionType getCompressionType() const override { return CompressionType::UNCOMPRESSED; }
+
+protected:
+    const uint32_t numBytesPerValue;
+};
+
+template<typename T>
+struct BitpackInfo {
+    uint8_t bitWidth;
+    bool hasNegative;
+    T offset;
+};
+
+template<typename T>
+concept IntegerBitpackingType = (common::numeric_utils::IsIntegral<T> && !std::same_as<T, bool>);
+
+// Augmented with Frame of Reference encoding using an offset stored in the compression metadata
+template<IntegerBitpackingType T>
+class IntegerBitpacking : public CompressionAlg {
+    using U = common::numeric_utils::MakeUnSignedT<T>;
+
+public:
+    // This is an implementation detail of the fastpfor bitpacking algorithm
+    static constexpr uint64_t CHUNK_SIZE = 32;
+
+public:
+    IntegerBitpacking() = default;
+    IntegerBitpacking(const IntegerBitpacking&) = default;
+
+    void setValuesFromUncompressed(const uint8_t* srcBuffer, common::offset_t srcOffset,
+        uint8_t* dstBuffer, common::offset_t dstOffset, common::offset_t numValues,
+        const CompressionMetadata& metadata, const common::NullMask* nullMask) const final;
+
+    static BitpackInfo<T> getPackingInfo(const CompressionMetadata& metadata);
+
+    static inline uint64_t numValues(uint64_t dataSize, const BitpackInfo<T>& info) {
+        if (info.bitWidth == 0) {
+            return UINT64_MAX;
+        }
+        auto numValues = dataSize * 8 / info.bitWidth;
+        return numValues;
+    }
+
+    static inline uint64_t numValues(uint64_t dataSize, const CompressionMetadata& metadata) {
+        auto info = getPackingInfo(metadata);
+        return numValues(dataSize, info);
+    }
+
+    uint64_t compressNextPage(const uint8_t*& srcBuffer, uint64_t numValuesRemaining,
+        uint8_t* dstBuffer, uint64_t dstBufferSize,
+        const struct CompressionMetadata& metadata) const final;
+
+    void decompressFromPage(const uint8_t* srcBuffer, uint64_t srcOffset, uint8_t* dstBuffer,
+        uint64_t dstOffset, uint64_t numValues,
+        const struct CompressionMetadata& metadata) const final;
+
+    static bool canUpdateInPlace(std::span<const T> value, const CompressionMetadata& metadata,
+        const std::optional<common::NullMask>& nullMask = std::nullopt,
+        uint64_t nullMaskOffset = 0);
+
+    CompressionType getCompressionType() const override {
+        return CompressionType::INTEGER_BITPACKING;
+    }
+
+protected:
+    // Read multiple values from within a chunk. Cannot span multiple chunks.
+    void getValues(const uint8_t* chunkStart, uint8_t pos, uint8_t* dst, uint8_t numValuesToRead,
+        const BitpackInfo<T>& header) const;
+
+    inline const uint8_t* getChunkStart(const uint8_t* buffer, uint64_t pos,
+        uint8_t bitWidth) const {
+        // Order of operations is important so that pos is rounded down to a multiple of
+        // CHUNK_SIZE
+        return buffer + (pos / CHUNK_SIZE) * bitWidth * CHUNK_SIZE / 8;
+    }
+
+    void packPartialChunk(const U* srcBuffer, uint8_t* dstBuffer, size_t posInDst,
+        BitpackInfo<T> info, size_t remainingValues) const;
+
+    void copyValuesToTempChunkWithOffset(const U* srcBuffer, U* tmpBuffer, BitpackInfo<T> info,
+        size_t numValuesToCopy) const;
+
+    void setPartialChunkInPlace(const uint8_t* srcBuffer, common::offset_t posInSrc,
+        uint8_t* dstBuffer, common::offset_t posInDst, common::offset_t numValues,
+        const BitpackInfo<T>& header) const;
+};
+
+class BooleanBitpacking : public CompressionAlg {
+public:
+    BooleanBitpacking() = default;
+    BooleanBitpacking(const BooleanBitpacking&) = default;
+
+    void setValuesFromUncompressed(const uint8_t* srcBuffer, common::offset_t srcOffset,
+        uint8_t* dstBuffer, common::offset_t dstOffset, common::offset_t numValues,
+        const CompressionMetadata& metadata, const common::NullMask* nullMask) const final;
+
+    static inline uint64_t numValues(uint64_t dataSize) { return dataSize * 8; }
+
+    uint64_t compressNextPage(const uint8_t*& srcBuffer, uint64_t numValuesRemaining,
+        uint8_t* dstBuffer, uint64_t dstBufferSize,
+        const struct CompressionMetadata& metadata) const final;
+
+    void decompressFromPage(const uint8_t* srcBuffer, uint64_t srcOffset, uint8_t* dstBuffer,
+        uint64_t dstOffset, uint64_t numValues, const CompressionMetadata& metadata) const final;
+
+    void copyFromPage(const uint8_t* srcBuffer, uint64_t srcOffset, uint8_t* dstBuffer,
+        uint64_t dstOffset, uint64_t numValues, const CompressionMetadata& metadata) const;
+
+    CompressionType getCompressionType() const override {
+        return CompressionType::BOOLEAN_BITPACKING;
+    }
+};
+
+class CompressedFunctor {
+public:
+    CompressedFunctor(const CompressedFunctor&) = default;
+
+protected:
+    explicit CompressedFunctor(const common::LogicalType& logicalType)
+        : constant{logicalType}, uncompressed{logicalType},
+          physicalType{logicalType.getPhysicalType()} {}
+    const ConstantCompression constant;
+    const Uncompressed uncompressed;
+    const BooleanBitpacking booleanBitpacking;
+    const common::PhysicalTypeID physicalType;
+};
+
+class ReadCompressedValuesFromPageToVector : public CompressedFunctor {
+public:
+    explicit ReadCompressedValuesFromPageToVector(const common::LogicalType& logicalType)
+        : CompressedFunctor(logicalType) {}
+    ReadCompressedValuesFromPageToVector(const ReadCompressedValuesFromPageToVector&) = default;
+
+    void operator()(const uint8_t* frame, PageCursor& pageCursor, common::ValueVector* resultVector,
+        uint32_t posInVector, uint64_t numValuesToRead, const CompressionMetadata& metadata);
+};
+
+class ReadCompressedValuesFromPage : public CompressedFunctor {
+public:
+    explicit ReadCompressedValuesFromPage(const common::LogicalType& logicalType)
+        : CompressedFunctor(logicalType) {}
+    ReadCompressedValuesFromPage(const ReadCompressedValuesFromPage&) = default;
+
+    void operator()(const uint8_t* frame, PageCursor& pageCursor, uint8_t* result,
+        uint32_t startPosInResult, uint64_t numValuesToRead, const CompressionMetadata& metadata);
+};
+
+class WriteCompressedValuesToPage : public CompressedFunctor {
+public:
+    explicit WriteCompressedValuesToPage(const common::LogicalType& logicalType)
+        : CompressedFunctor(logicalType) {}
+    WriteCompressedValuesToPage(const WriteCompressedValuesToPage&) = default;
+
+    void operator()(uint8_t* frame, uint16_t posInFrame, const uint8_t* data,
+        common::offset_t dataOffset, common::offset_t numValues,
+        const CompressionMetadata& metadata, const common::NullMask* nullMask = nullptr);
+
+    void operator()(uint8_t* frame, uint16_t posInFrame, common::ValueVector* vector,
+        uint32_t posInVector, common::offset_t numValues, const CompressionMetadata& metadata);
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/float_compression.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/float_compression.h
new file mode 100644
index 0000000000..3f8e3f7c3e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/float_compression.h
@@ -0,0 +1,95 @@
+#pragma once
+
+#include <type_traits>
+
+#include "storage/compression/compression.h"
+#include <concepts>
+
+namespace lbug {
+namespace common {
+class ValueVector;
+class NullMask;
+} // namespace common
+
+namespace storage {
+class ColumnChunkData;
+
+struct PageCursor;
+
+template<std::floating_point T>
+struct EncodeException {
+    T value;
+    uint32_t posInChunk;
+
+    static constexpr size_t sizeInBytes() { return sizeof(value) + sizeof(posInChunk); }
+
+    static size_t numPagesFromExceptions(size_t exceptionCount);
+
+    static size_t exceptionBytesPerPage();
+
+    bool operator<(const EncodeException<T>& o) const;
+};
+
+template<std::floating_point T>
+struct EncodeExceptionView {
+    // Used to access ALP exceptions that are stored in buffers
+    // We don't use the EncodeException struct directly since we don't want to copy struct padding
+    explicit EncodeExceptionView(std::byte* val) { bytes = val; }
+
+    EncodeException<T> getValue(common::offset_t elementOffset = 0) const;
+    void setValue(EncodeException<T> exception, common::offset_t elementOffset = 0);
+    std::byte* bytes;
+};
+
+template<std::floating_point T>
+class FloatCompression final : public CompressionAlg {
+public:
+    using EncodedType = std::conditional_t<std::is_same_v<T, double>, int64_t, int32_t>;
+    static constexpr size_t MAX_EXCEPTION_FACTOR = 4;
+
+public:
+    FloatCompression();
+
+    void setValuesFromUncompressed(const uint8_t* srcBuffer, common::offset_t srcOffset,
+        uint8_t* dstBuffer, common::offset_t dstOffset, common::offset_t numValues,
+        const CompressionMetadata& metadata, const common::NullMask* nullMask) const override;
+
+    static uint64_t numValues(uint64_t dataSize, const CompressionMetadata& metadata);
+
+    // this is included to satisfy the CompressionAlg interface but we don't actually use it
+    uint64_t compressNextPage(const uint8_t*& srcBuffer, uint64_t numValuesRemaining,
+        uint8_t* dstBuffer, uint64_t dstBufferSize,
+        const CompressionMetadata& metadata) const override;
+
+    uint64_t compressNextPageWithExceptions(const uint8_t*& srcBuffer, uint64_t srcOffset,
+        uint64_t numValuesRemaining, uint8_t* dstBuffer, uint64_t dstBufferSize,
+        EncodeExceptionView<T> exceptionBuffer, uint64_t exceptionBufferSize,
+        uint64_t& exceptionCount, const CompressionMetadata& metadata) const;
+
+    // does not patch exceptions (this is handled by the column reader)
+    void decompressFromPage(const uint8_t* srcBuffer, uint64_t srcOffset, uint8_t* dstBuffer,
+        uint64_t dstOffset, uint64_t numValues, const CompressionMetadata& metadata) const override;
+
+    static bool canUpdateInPlace(std::span<const T> value, const CompressionMetadata& metadata,
+        InPlaceUpdateLocalState& localUpdateState,
+        const std::optional<common::NullMask>& nullMask = std::nullopt,
+        uint64_t nullMaskOffset = 0);
+
+    CompressionType getCompressionType() const override { return CompressionType::ALP; }
+
+    static BitpackInfo<EncodedType> getBitpackInfo(const CompressionMetadata& metadata);
+
+    // Returns number of pages for storing bitpacked ALP values (excluding pages reserved for
+    // exceptions)
+    static common::page_idx_t getNumDataPages(common::page_idx_t numTotalPages,
+        const CompressionMetadata& compMeta);
+
+private:
+    const CompressionAlg& getEncodedFloatBitpacker(const CompressionMetadata& metadata) const;
+
+    ConstantCompression constantEncodedFloatBitpacker;
+    IntegerBitpacking<EncodedType> encodedFloatBitpacker;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/sign_extend.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/sign_extend.h
new file mode 100644
index 0000000000..e86eb1dc13
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/compression/sign_extend.h
@@ -0,0 +1,56 @@
+#pragma once
+
+/* Adapted from
+ * https://github.com/duckdb/duckdb/blob/312b9954507386305544a42c4f43c2bd410a64cb/src/include/duckdb/common/bitpacking.hpp#L190-L199
+ *
+ * Copyright 2018-2023 Stichting DuckDB Foundation
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
+ * associated documentation files (the "Software"), to deal in the Software without restriction,
+ * including without limitation the rights to use, copy, modify, merge, publish, distribute,
+ * sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all copies or
+ * substantial portions of the Software.
+ */
+
+#include <string.h>
+
+#include <cstdint>
+
+#include "common/assert.h"
+#include "common/numeric_utils.h"
+#include "common/utils.h"
+
+namespace lbug {
+namespace storage {
+
+template<typename T>
+void Store(const T& val, uint8_t* ptr) {
+    memcpy(ptr, (void*)&val, sizeof(val));
+}
+
+template<typename T>
+T Load(const uint8_t* ptr) {
+    T ret{};
+    memcpy(&ret, ptr, sizeof(ret));
+    return ret;
+}
+
+// Sign bit extension
+template<class T, class T_U = typename common::numeric_utils::MakeUnSignedT<T>, uint64_t CHUNK_SIZE>
+static void SignExtend(uint8_t* dst, uint8_t width) {
+    KU_ASSERT(width < sizeof(T) * 8);
+    T const mask = T_U(1) << (width - 1);
+    for (uint64_t i = 0; i < CHUNK_SIZE; ++i) {
+        T value = Load<T>(dst + i * sizeof(T));
+        const T_U andMask = common::BitmaskUtils::all1sMaskForLeastSignificantBits<T_U>(width);
+        value = value & andMask;
+        T result = (value ^ mask) - mask;
+        Store(result, dst + i * sizeof(T));
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/database_header.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/database_header.h
new file mode 100644
index 0000000000..2df60b0f86
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/database_header.h
@@ -0,0 +1,32 @@
+#pragma once
+
+#include <optional>
+
+#include "common/types/uuid.h"
+#include "storage/page_range.h"
+
+namespace lbug {
+namespace storage {
+class PageManager;
+
+struct DatabaseHeader {
+    PageRange catalogPageRange;
+    PageRange metadataPageRange;
+
+    // An ID that is unique between lbug databases
+    // Used to ensure that files such as the WAL match the current database
+    common::ku_uuid_t databaseID{0};
+
+    void updateCatalogPageRange(PageManager& pageManager, PageRange newPageRange);
+    void freeMetadataPageRange(PageManager& pageManager) const;
+    void serialize(common::Serializer& ser) const;
+
+    static DatabaseHeader deserialize(common::Deserializer& deSer);
+    static DatabaseHeader createInitialHeader(common::RandomEngine* randomEngine);
+
+    // If we haven't written a header to the database file yet (e.g. if the file is empty) this
+    // function will return a nullopt
+    static std::optional<DatabaseHeader> readDatabaseHeader(common::FileInfo& dataFileInfo);
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/disk_array.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/disk_array.h
new file mode 100644
index 0000000000..ece4e68025
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/disk_array.h
@@ -0,0 +1,411 @@
+#pragma once
+
+#include <cstdint>
+#include <cstring>
+#include <mutex>
+#include <optional>
+#include <shared_mutex>
+
+#include "common/copy_constructors.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/shadow_utils.h"
+#include "storage/storage_utils.h"
+#include "transaction/transaction.h"
+#include <bit>
+#include <span>
+
+namespace lbug {
+namespace storage {
+class PageAllocator;
+class FileHandle;
+class BufferManager;
+
+static constexpr uint64_t NUM_PAGE_IDXS_PER_PIP =
+    (common::LBUG_PAGE_SIZE - sizeof(common::page_idx_t)) / sizeof(common::page_idx_t);
+
+struct DiskArrayHeader {
+    DiskArrayHeader() : numElements{0}, firstPIPPageIdx{common::INVALID_PAGE_IDX} {}
+    bool operator==(const DiskArrayHeader& other) const = default;
+
+    uint64_t numElements;
+    common::page_idx_t firstPIPPageIdx;
+    uint32_t _padding{};
+};
+static_assert(std::has_unique_object_representations_v<DiskArrayHeader>);
+
+/**
+ * Data for page-based storage helper functions
+ */
+struct PageStorageInfo {
+    explicit PageStorageInfo(uint64_t elementSize);
+
+    uint64_t alignedElementSize;
+    uint64_t numElementsPerPage;
+};
+
+// TODO(bmwinger): this should use the memoryManager
+struct PIP {
+    PIP() : nextPipPageIdx{ShadowUtils::NULL_PAGE_IDX}, pageIdxs{} {
+        for (auto& pageIdx : pageIdxs) {
+            pageIdx = ShadowUtils::NULL_PAGE_IDX;
+        }
+    }
+
+    common::page_idx_t nextPipPageIdx;
+    common::page_idx_t pageIdxs[NUM_PAGE_IDXS_PER_PIP];
+};
+static_assert(sizeof(PIP) == common::LBUG_PAGE_SIZE);
+
+struct PIPWrapper {
+    PIPWrapper(const FileHandle& fileHandle, common::page_idx_t pipPageIdx);
+
+    explicit PIPWrapper(common::page_idx_t pipPageIdx) : pipPageIdx(pipPageIdx) {}
+
+    common::page_idx_t pipPageIdx;
+    PIP pipContents;
+};
+
+struct PIPUpdates {
+    // Since PIPs are only appended to, the only existing PIP which may be modified is the last one
+    // This gets tracked separately to make indexing into newPIPs simpler.
+    std::optional<PIPWrapper> updatedLastPIP;
+    std::vector<PIPWrapper> newPIPs;
+
+    void clear() {
+        updatedLastPIP.reset();
+        newPIPs.clear();
+    }
+};
+
+/**
+ * DiskArray stores a disk-based array in a file. The array is broken down into a predefined and
+ * stable header page, i.e., the header page of the array is always in a pre-allocated page in the
+ * file. The header page contains the pointer to the first ``page indices page'' (pip). Each pip
+ * stores a list of page indices that store the ``array pages''. Each PIP also stores the pageIdx of
+ * the next PIP if one exists (or we use StorageConstants::NULL_PAGE_IDX as null). Array pages store
+ * the actual data in the array.
+ *
+ * Storage structures can use multiple disk arrays in a single file by giving each one a different
+ * pre-allocated stable header pageIdxs.
+ *
+ * We clarify the following abbreviations and conventions in the variables used in these files:
+ * <ul>
+ *   <li> pip: Page Indices Page
+ *   <li> pipIdx: logical index of a PIP in DiskArray. For example a variable pipIdx we use with
+ * value 5 indicates the 5th PIP,  not the physical disk pageIdx of where that PIP is stored.
+ *   <li> pipPageIdx: the physical disk pageIdx of some PIP
+ *   <li> AP: Array Page
+ *   <li> apIdx: logical index of the array page in DiskArray. For example a variable apIdx with
+ * value 5 indicates the 5th array page of the Disk Array (i.e., the physical offset of this would
+ * correspond to the 5 element in the first PIP) not the physical disk pageIdx of an array page. <li
+ *   <li> apPageIdx: the physical disk pageIdx of some PIP.
+ * </ul>
+ */
+class DiskArrayInternal {
+public:
+    // Used when loading from file
+    DiskArrayInternal(FileHandle& fileHandle, const DiskArrayHeader& headerForReadTrx,
+        DiskArrayHeader& headerForWriteTrx, ShadowFile* shadowFile, uint64_t elementSize,
+        bool bypassShadowing = false);
+
+    uint64_t getNumElements(
+        transaction::TransactionType trxType = transaction::TransactionType::READ_ONLY);
+
+    void get(uint64_t idx, const transaction::Transaction* transaction, std::span<std::byte> val);
+
+    // Note: This function is to be used only by the WRITE trx.
+    void update(const transaction::Transaction* transaction, uint64_t idx,
+        std::span<std::byte> val);
+
+    // Note: Currently, this function doesn't support shrinking the size of the array.
+    uint64_t resize(PageAllocator& pageAllocator, const transaction::Transaction* transaction,
+        uint64_t newNumElements, std::span<std::byte> defaultVal);
+
+    void checkpointInMemoryIfNecessary() {
+        std::unique_lock xlock{this->diskArraySharedMtx};
+        checkpointOrRollbackInMemoryIfNecessaryNoLock(true /* is checkpoint */);
+    }
+    void rollbackInMemoryIfNecessary() {
+        std::unique_lock xlock{this->diskArraySharedMtx};
+        checkpointOrRollbackInMemoryIfNecessaryNoLock(false /* is rollback */);
+    }
+
+    void checkpoint();
+
+    void reclaimStorage(PageAllocator& pageAllocator) const;
+
+    // Write WriteIterator for making fast bulk changes to the disk array
+    // The pages are cached while the elements are stored on the same page
+    // Designed for sequential writes, but supports random writes too (at the cost that the page
+    // caching is only beneficial when seeking from one element to another on the same page)
+    //
+    // The iterator is not locked, allowing multiple to be used at the same time, but access to
+    // individual pages is locked through the FileHandle. It will hang if you seek/pushback on the
+    // same page as another iterator in an overlapping scope.
+    struct WriteIterator {
+        DiskArrayInternal& diskArray;
+        PageCursor apCursor;
+        uint32_t valueSize;
+        // TODO(bmwinger): Instead of pinning the page and updating in-place, it might be better to
+        // read and cache the page, then write the page to the WAL if it's ever modified. However
+        // when doing bulk hashindex inserts, there's a high likelihood that every page accessed
+        // will be modified, so it may be faster this way.
+        ShadowPageAndFrame shadowPageAndFrame;
+        static const transaction::TransactionType TRX_TYPE =
+            transaction::TransactionType::CHECKPOINT;
+        uint64_t idx;
+        DEFAULT_MOVE_CONSTRUCT(WriteIterator);
+
+        // Constructs WriteIterator in an invalid state. Seek must be called before accessing data
+        WriteIterator(uint32_t valueSize, DiskArrayInternal& diskArray)
+            : diskArray(diskArray), apCursor(), valueSize(valueSize),
+              shadowPageAndFrame{common::INVALID_PAGE_IDX, common::INVALID_PAGE_IDX, nullptr},
+              idx(0) {
+            diskArray.hasTransactionalUpdates = true;
+        }
+
+        WriteIterator& seek(size_t newIdx);
+        // Adds a new element to the disk array and seeks to the new element
+        void pushBack(PageAllocator& pageAllocator, const transaction::Transaction* transaction,
+            std::span<std::byte> val);
+
+        inline WriteIterator& operator+=(size_t increment) { return seek(idx + increment); }
+
+        ~WriteIterator() { unpin(); }
+
+        std::span<uint8_t> operator*() const {
+            KU_ASSERT(idx < diskArray.headerForWriteTrx.numElements);
+            KU_ASSERT(shadowPageAndFrame.originalPage != common::INVALID_PAGE_IDX);
+            return std::span(shadowPageAndFrame.frame + apCursor.elemPosInPage, valueSize);
+        }
+
+        uint64_t size() const { return diskArray.headerForWriteTrx.numElements; }
+
+    private:
+        void unpin();
+        void getPage(common::page_idx_t newPageIdx, bool isNewlyAdded);
+    };
+
+    WriteIterator iter_mut(uint64_t valueSize);
+
+    inline common::page_idx_t getAPIdx(uint64_t idx) const;
+
+protected:
+    // Updates to new pages (new to this transaction) bypass the wal file.
+    void updatePage(uint64_t pageIdx, bool isNewPage, std::function<void(uint8_t*)> updateOp);
+
+    void updateLastPageOnDisk();
+
+    uint64_t getNumElementsNoLock(transaction::TransactionType trxType) const {
+        return getDiskArrayHeader(trxType).numElements;
+    }
+
+    uint64_t getNumAPs(const DiskArrayHeader& header) const {
+        return (header.numElements + storageInfo.numElementsPerPage - 1) /
+               storageInfo.numElementsPerPage;
+    }
+
+    void setNextPIPPageIDxOfPIPNoLock(uint64_t pipIdxOfPreviousPIP,
+        common::page_idx_t nextPIPPageIdx);
+
+    // This function does division and mod and should not be used in performance critical code.
+    common::page_idx_t getAPPageIdxNoLock(common::page_idx_t apIdx,
+        transaction::TransactionType trxType = transaction::TransactionType::READ_ONLY);
+
+    // pipIdx is the idx of the PIP,  and not the physical pageIdx. This function assumes
+    // that the caller has called hasPIPUpdatesNoLock and received true.
+    common::page_idx_t getUpdatedPageIdxOfPipNoLock(uint64_t pipIdx);
+
+    void clearWALPageVersionAndRemovePageFromFrameIfNecessary(common::page_idx_t pageIdx);
+
+    void checkpointOrRollbackInMemoryIfNecessaryNoLock(bool isCheckpoint);
+
+private:
+    bool checkOutOfBoundAccess(transaction::TransactionType trxType, uint64_t idx) const;
+    bool hasPIPUpdatesNoLock(uint64_t pipIdx) const;
+
+    const DiskArrayHeader& getDiskArrayHeader(transaction::TransactionType trxType) const {
+        if (trxType == transaction::TransactionType::CHECKPOINT) {
+            return headerForWriteTrx;
+        }
+        return header;
+    }
+
+    // Returns the apPageIdx of the AP with idx apIdx and a bool indicating whether the apPageIdx is
+    // a newly inserted page.
+    std::pair<common::page_idx_t, bool> getAPPageIdxAndAddAPToPIPIfNecessaryForWriteTrxNoLock(
+        PageAllocator& pageAllocator, const transaction::Transaction* transaction,
+        common::page_idx_t apIdx);
+
+protected:
+    PageStorageInfo storageInfo;
+    FileHandle& fileHandle;
+    const DiskArrayHeader& header;
+    DiskArrayHeader& headerForWriteTrx;
+    bool hasTransactionalUpdates;
+    ShadowFile* shadowFile;
+    std::vector<PIPWrapper> pips;
+    PIPUpdates pipUpdates;
+    std::shared_mutex diskArraySharedMtx;
+    // For write transactions only
+    common::page_idx_t lastAPPageIdx;
+    common::page_idx_t lastPageOnDisk;
+};
+
+template<typename U>
+inline std::span<std::byte> getSpan(U& val) {
+    return std::span(reinterpret_cast<std::byte*>(&val), sizeof(U));
+}
+
+template<typename U>
+class DiskArray {
+    static_assert(sizeof(U) <= common::LBUG_PAGE_SIZE);
+
+public:
+    // If bypassWAL is set, the buffer manager is used to pages new to this transaction to the
+    // original file, but does not handle flushing them. BufferManager::flushAllDirtyPagesInFrames
+    // should be called on this file handle exactly once during prepare commit.
+    DiskArray(FileHandle& fileHandle, const DiskArrayHeader& headerForReadTrx,
+        DiskArrayHeader& headerForWriteTrx, ShadowFile* shadowFile, bool bypassWAL = false)
+        : diskArray(fileHandle, headerForReadTrx, headerForWriteTrx, shadowFile, sizeof(U),
+              bypassWAL) {}
+
+    // Note: This function is to be used only by the WRITE trx.
+    inline void update(const transaction::Transaction* transaction, uint64_t idx, U val) {
+        diskArray.update(transaction, idx, getSpan(val));
+    }
+
+    inline U get(uint64_t idx, const transaction::Transaction* transaction) {
+        U val;
+        diskArray.get(idx, transaction, getSpan(val));
+        return val;
+    }
+
+    // Note: Currently, this function doesn't support shrinking the size of the array.
+    inline uint64_t resize(PageAllocator& pageAllocator,
+        const transaction::Transaction* transaction, uint64_t newNumElements) {
+        U defaultVal;
+        return diskArray.resize(pageAllocator, transaction, newNumElements, getSpan(defaultVal));
+    }
+
+    inline uint64_t getNumElements(
+        transaction::TransactionType trxType = transaction::TransactionType::READ_ONLY) {
+        return diskArray.getNumElements(trxType);
+    }
+
+    inline void checkpointInMemoryIfNecessary() { diskArray.checkpointInMemoryIfNecessary(); }
+    inline void rollbackInMemoryIfNecessary() { diskArray.rollbackInMemoryIfNecessary(); }
+    inline void checkpoint() { diskArray.checkpoint(); }
+    inline void reclaimStorage(PageAllocator& pageAllocator) const {
+        diskArray.reclaimStorage(pageAllocator);
+    }
+
+    class WriteIterator {
+    public:
+        explicit WriteIterator(DiskArrayInternal::WriteIterator&& iter) : iter(std::move(iter)) {}
+        inline U& operator*() { return *reinterpret_cast<U*>((*iter).data()); }
+        DELETE_COPY_DEFAULT_MOVE(WriteIterator);
+
+        inline WriteIterator& operator+=(size_t dist) {
+            iter += dist;
+            return *this;
+        }
+
+        inline WriteIterator& seek(size_t idx) {
+            iter.seek(idx);
+            return *this;
+        }
+
+        inline uint64_t idx() const { return iter.idx; }
+        inline uint64_t getAPIdx() const { return iter.apCursor.pageIdx; }
+
+        inline WriteIterator& pushBack(PageAllocator& pageAllocator,
+            const transaction::Transaction* transaction, U val) {
+            iter.pushBack(pageAllocator, transaction, getSpan(val));
+            return *this;
+        }
+
+        inline uint64_t size() const { return iter.size(); }
+
+    private:
+        DiskArrayInternal::WriteIterator iter;
+    };
+
+    inline WriteIterator iter_mut() { return WriteIterator{diskArray.iter_mut(sizeof(U))}; }
+    inline uint64_t getAPIdx(uint64_t idx) const { return diskArray.getAPIdx(idx); }
+    static constexpr uint32_t getAlignedElementSize() { return std::bit_ceil(sizeof(U)); }
+
+private:
+    DiskArrayInternal diskArray;
+};
+
+class BlockVectorInternal {
+public:
+    using element_construct_func_t = std::function<void(uint8_t*)>;
+
+    explicit BlockVectorInternal(MemoryManager& memoryManager, size_t elementSize)
+        : storageInfo{elementSize}, numElements{0}, memoryManager{memoryManager} {}
+
+    // This function is designed to be used during building of a disk array, i.e., during loading.
+    // In particular, it changes the needed capacity non-transactionally, i.e., without writing
+    // anything to the wal.
+    void resize(uint64_t newNumElements, const element_construct_func_t& defaultConstructor);
+
+    inline uint64_t size() const { return numElements; }
+
+    // [] operator can be used to update elements, e.g., diskArray[5] = 4, when building an
+    // InMemDiskArrayBuilder without transactional updates. This changes the contents directly in
+    // memory and not on disk (nor on the wal).
+    uint8_t* operator[](uint64_t idx) const;
+
+private:
+    inline uint64_t getNumArrayPagesNeededForElements(uint64_t numElements) const {
+        return (numElements + this->storageInfo.numElementsPerPage - 1) /
+               this->storageInfo.numElementsPerPage;
+    }
+
+protected:
+    std::vector<std::unique_ptr<MemoryBuffer>> inMemArrayPages;
+    PageStorageInfo storageInfo;
+    uint64_t numElements;
+    MemoryManager& memoryManager;
+};
+
+template<typename U>
+class BlockVector {
+public:
+    explicit BlockVector(MemoryManager& memoryManager, uint64_t numElements = 0)
+        : vector(memoryManager, sizeof(U)) {
+        resize(numElements);
+    }
+
+    ~BlockVector() {
+        for (uint64_t i = 0; i < size(); ++i) {
+            operator[](i).~U();
+        }
+    }
+
+    inline U& operator[](uint64_t idx) { return *(U*)vector[idx]; }
+
+    inline void resize(uint64_t newNumElements) {
+        // NOLINTNEXTLINE(readability-non-const-parameter) placement-new requires non-const ptr
+        static constexpr auto defaultConstructor = [](uint8_t* data) {
+            [[maybe_unused]] auto* p = new (data) U();
+            KU_ASSERT(p);
+        };
+        vector.resize(newNumElements, defaultConstructor);
+    }
+
+    inline uint64_t size() const { return vector.size(); }
+
+    static constexpr uint32_t getAlignedElementSize() {
+        return DiskArray<U>::getAlignedElementSize();
+    }
+
+private:
+    BlockVectorInternal vector;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/disk_array_collection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/disk_array_collection.h
new file mode 100644
index 0000000000..80f429c4cd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/disk_array_collection.h
@@ -0,0 +1,78 @@
+#pragma once
+
+#include <cstdint>
+
+#include "common/types/types.h"
+#include "disk_array.h"
+
+namespace lbug {
+namespace storage {
+
+class FileHandle;
+
+class DiskArrayCollection {
+    struct HeaderPage {
+        explicit HeaderPage(uint32_t numHeaders = 0)
+            : nextHeaderPage{common::INVALID_PAGE_IDX}, numHeaders{numHeaders} {}
+        static constexpr size_t NUM_HEADERS_PER_PAGE =
+            (common::LBUG_PAGE_SIZE - sizeof(common::page_idx_t) - sizeof(uint32_t)) /
+            sizeof(DiskArrayHeader);
+
+        bool operator==(const HeaderPage&) const = default;
+
+        std::array<DiskArrayHeader, NUM_HEADERS_PER_PAGE> headers;
+        common::page_idx_t nextHeaderPage;
+        uint32_t numHeaders;
+    };
+    static_assert(std::has_unique_object_representations_v<HeaderPage>);
+
+public:
+    DiskArrayCollection(FileHandle& fileHandle, ShadowFile& shadowFile,
+        bool bypassShadowing = false);
+    DiskArrayCollection(FileHandle& fileHandle, ShadowFile& shadowFile,
+        common::page_idx_t firstHeaderPage, bool bypassShadowing = false);
+
+    void checkpoint(common::page_idx_t firstHeaderPage, PageAllocator& pageAllocator);
+
+    void checkpointInMemory() {
+        for (size_t i = 0; i < headersForWriteTrx.size(); i++) {
+            *headersForReadTrx[i] = *headersForWriteTrx[i];
+        }
+        headerPagesOnDisk = headersForReadTrx.size();
+    }
+
+    void rollbackCheckpoint() {
+        for (size_t i = 0; i < headersForWriteTrx.size(); i++) {
+            *headersForWriteTrx[i] = *headersForReadTrx[i];
+        }
+    }
+
+    void reclaimStorage(PageAllocator& pageAllocator, common::page_idx_t firstHeaderPage) const;
+
+    template<typename T>
+    std::unique_ptr<DiskArray<T>> getDiskArray(uint32_t idx) {
+        KU_ASSERT(idx < numHeaders);
+        auto& readHeader = headersForReadTrx[idx / HeaderPage::NUM_HEADERS_PER_PAGE]
+                               ->headers[idx % HeaderPage::NUM_HEADERS_PER_PAGE];
+        auto& writeHeader = headersForWriteTrx[idx / HeaderPage::NUM_HEADERS_PER_PAGE]
+                                ->headers[idx % HeaderPage::NUM_HEADERS_PER_PAGE];
+        return std::make_unique<DiskArray<T>>(fileHandle, readHeader, writeHeader, &shadowFile,
+            bypassShadowing);
+    }
+
+    size_t addDiskArray();
+
+    void populateNextHeaderPage(PageAllocator& pageAllocator, common::page_idx_t indexInMemory);
+
+private:
+    FileHandle& fileHandle;
+    ShadowFile& shadowFile;
+    bool bypassShadowing;
+    common::page_idx_t headerPagesOnDisk;
+    std::vector<std::unique_ptr<HeaderPage>> headersForReadTrx;
+    std::vector<std::unique_ptr<HeaderPage>> headersForWriteTrx;
+    uint64_t numHeaders;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/enums/csr_node_group_scan_source.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/enums/csr_node_group_scan_source.h
new file mode 100644
index 0000000000..0a2061281f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/enums/csr_node_group_scan_source.h
@@ -0,0 +1,12 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug::storage {
+enum class CSRNodeGroupScanSource : uint8_t {
+    COMMITTED_PERSISTENT = 0,
+    COMMITTED_IN_MEMORY = 1,
+    UNCOMMITTED = 2,
+    NONE = 10
+};
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/enums/page_read_policy.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/enums/page_read_policy.h
new file mode 100644
index 0000000000..222382ca18
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/enums/page_read_policy.h
@@ -0,0 +1,11 @@
+#pragma once
+
+#include <cstdint>
+
+namespace lbug {
+namespace storage {
+
+enum class PageReadPolicy : uint8_t { READ_PAGE = 0, DONT_READ_PAGE = 1 };
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/enums/residency_state.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/enums/residency_state.h
new file mode 100644
index 0000000000..5eaf4dddd4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/enums/residency_state.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace storage {
+
+enum class ResidencyState : uint8_t { IN_MEMORY = 0, ON_DISK = 1 };
+
+struct ResidencyStateUtils {
+    static std::string toString(ResidencyState residencyState) {
+        switch (residencyState) {
+        case ResidencyState::IN_MEMORY: {
+            return "IN_MEMORY";
+        }
+        case ResidencyState::ON_DISK: {
+            return "ON_DISK";
+        }
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+    }
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/file_db_id_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/file_db_id_utils.h
new file mode 100644
index 0000000000..4c3d50dfeb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/file_db_id_utils.h
@@ -0,0 +1,18 @@
+#pragma once
+
+#include "common/file_system/file_info.h"
+#include "common/serializer/serializer.h"
+#include "common/types/uuid.h"
+namespace lbug {
+namespace storage {
+struct FileDBIDUtils {
+    // For some temporary DB files such as the WAL and shadow file
+    // We want to verify that they actually match the current database before replaying
+    // We do this by adding a unique UUID to the header of the data.kz file
+    // And making sure they match the IDs of the temporary files
+    static void verifyDatabaseID(const common::FileInfo& fileInfo,
+        common::ku_uuid_t expectedDatabaseID, common::ku_uuid_t databaseID);
+    static void writeDatabaseID(common::Serializer& ser, common::ku_uuid_t databaseID);
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/file_handle.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/file_handle.h
new file mode 100644
index 0000000000..d1629284e2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/file_handle.h
@@ -0,0 +1,172 @@
+#pragma once
+
+#include <cmath>
+#include <cstdint>
+#include <cstring>
+#include <functional>
+#include <memory>
+#include <shared_mutex>
+
+#include "common/assert.h"
+#include "common/concurrent_vector.h"
+#include "common/constants.h"
+#include "common/copy_constructors.h"
+#include "common/file_system/file_info.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/page_state.h"
+#include "storage/buffer_manager/vm_region.h"
+#include "storage/enums/page_read_policy.h"
+#include "storage/page_manager.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+}
+
+namespace common {
+class VirtualFileSystem;
+}
+
+namespace storage {
+// FileHandle serves several purposes:
+// 1) holds basic state information of a file, including FileInfo, flags, pageSize,
+// numPages, and pageCapacity.
+// 2) provides utility methods to read/write pages from/to the file.
+// 3) holds the state of each page in the file in buffer manager. File Handle is the bridge between
+// a data structure and the Buffer Manager that abstracts the file in which that data structure is
+// stored.
+
+class ShadowFile;
+class BufferManager;
+class FileHandle {
+public:
+    friend class BufferManager;
+    friend class ShadowFile;
+
+    constexpr static uint8_t isLargePagedMask{0b0000'0001}; // represents 1st least sig. bit (LSB)
+    constexpr static uint8_t isNewInMemoryTmpFileMask{0b0000'0010}; // represents 2nd LSB
+    // createIfNotExistsMask only applies to existing db files; tmp i-memory files are not created
+    constexpr static uint8_t createIfNotExistsMask{0b0000'0100}; // represents 3rd LSB
+    constexpr static uint8_t isReadOnlyMask{0b0000'1000};        // represents 4th LSB
+    constexpr static uint8_t isLockRequiredMask{0b1000'0000};    // represents 8th LSB
+
+    // READ_ONLY subsumes DEFAULT_PAGED, PERSISTENT, and NO_CREATE.
+    constexpr static uint8_t O_PERSISTENT_FILE_READ_ONLY{0b0000'1000};
+    constexpr static uint8_t O_PERSISTENT_FILE_CREATE_NOT_EXISTS{0b0000'0100};
+    constexpr static uint8_t O_IN_MEM_TEMP_FILE{0b0000'0011};
+    constexpr static uint8_t O_PERSISTENT_FILE_IN_MEM{0b0000'0010};
+    constexpr static uint8_t O_LOCKED_PERSISTENT_FILE{0b1000'0000};
+
+    FileHandle(const std::string& path, uint8_t fhFlags, BufferManager* bm, uint32_t fileIndex,
+        common::VirtualFileSystem* vfs, main::ClientContext* context);
+    // File handles are registered with the buffer manager and must not be moved or copied
+    DELETE_COPY_AND_MOVE(FileHandle);
+
+    uint8_t* pinPage(common::page_idx_t pageIdx, PageReadPolicy readPolicy);
+    void optimisticReadPage(common::page_idx_t pageIdx,
+        const std::function<void(uint8_t*)>& readOp);
+    // The function assumes that the requested page is already pinned.
+    void unpinPage(common::page_idx_t pageIdx);
+
+    // This function assumes the page is already LOCKED.
+    void setLockedPageDirty(common::page_idx_t pageIdx) {
+        KU_ASSERT(pageIdx < numPages);
+        pageStates[pageIdx].setDirty();
+    }
+
+    common::file_idx_t getFileIndex() const { return fileIndex; }
+    uint8_t* getFrame(common::page_idx_t pageIdx);
+    PageState* getPageState(common::page_idx_t pageIdx) { return &pageStates[pageIdx]; }
+
+    // Pages added through these APIs are not tracked by the FSM
+    // If allocating pages from the data.kz file it's recommended to do so using the PageManager
+    common::page_idx_t addNewPage();
+    common::page_idx_t addNewPages(common::page_idx_t numNewPages);
+
+    void removePageIdxAndTruncateIfNecessary(common::page_idx_t pageIdx);
+    void removePageFromFrameIfNecessary(common::page_idx_t pageIdx);
+    void flushAllDirtyPagesInFrames();
+
+    void readPageFromDisk(uint8_t* frame, common::page_idx_t pageIdx) const {
+        KU_ASSERT(!isInMemoryMode());
+        KU_ASSERT(pageIdx < numPages);
+        fileInfo->readFromFile(frame, getPageSize(), pageIdx * getPageSize());
+    }
+    void writePageToFile(const uint8_t* buffer, common::page_idx_t pageIdx) {
+        KU_ASSERT(pageIdx < numPages);
+        writePagesToFile(buffer, getPageSize(), pageIdx);
+    }
+    void writePagesToFile(const uint8_t* buffer, uint64_t size, common::page_idx_t startPageIdx);
+
+    bool isInMemoryMode() const { return !isLargePaged() && isNewTmpFile(); }
+
+    common::page_idx_t getNumPages() const { return numPages; }
+    common::FileInfo* getFileInfo() const { return fileInfo.get(); }
+    void resetFileInfo() { fileInfo.reset(); }
+
+    uint64_t getPageSize() const {
+        return isLargePaged() ? common::TEMP_PAGE_SIZE : common::LBUG_PAGE_SIZE;
+    }
+
+    PageManager* getPageManager() { return pageManager.get(); }
+
+private:
+    bool isLargePaged() const { return fhFlags & isLargePagedMask; }
+    bool isNewTmpFile() const { return fhFlags & isNewInMemoryTmpFileMask; }
+    bool isReadOnlyFile() const { return fhFlags & isReadOnlyMask; }
+    bool createFileIfNotExists() const { return fhFlags & createIfNotExistsMask; }
+    bool isLockRequired() const { return fhFlags & isLockRequiredMask; }
+
+    common::page_idx_t addNewPageWithoutLock();
+    void constructPersistentFileHandle(const std::string& path, common::VirtualFileSystem* vfs,
+        main::ClientContext* context);
+    void constructTmpFileHandle(const std::string& path);
+    common::frame_idx_t getFrameIdx(common::page_idx_t pageIdx) {
+        KU_ASSERT(pageIdx < pageCapacity);
+        return (frameGroupIdxes[pageIdx >> common::StorageConstants::PAGE_GROUP_SIZE_LOG2]
+                   << common::StorageConstants::PAGE_GROUP_SIZE_LOG2) |
+               (pageIdx & common::StorageConstants::PAGE_IDX_IN_GROUP_MASK);
+    }
+    common::PageSizeClass getPageSizeClass() const { return pageSizeClass; }
+
+    void addNewPageGroupWithoutLock();
+    common::page_group_idx_t getNumPageGroups() const {
+        return ceil(static_cast<double>(numPages) / common::StorageConstants::PAGE_GROUP_SIZE);
+    }
+    // This function is intended to be used after a fileInfo is created and we want the file
+    // to have no pages and page locks. Should be called after ensuring that the buffer manager
+    // does not hold any of the pages of the file.
+    void resetToZeroPagesAndPageCapacity();
+    void flushPageIfDirtyWithoutLock(common::page_idx_t pageIdx);
+
+private:
+    // Intended to be used to coordinate calls to functions that change in the internal data
+    // structures of the file handle.
+    std::shared_mutex fhSharedMutex;
+
+    uint8_t fhFlags;
+    std::unique_ptr<common::FileInfo> fileInfo;
+    common::file_idx_t fileIndex;
+    // Actually allocated/used number of pages in the file.
+    std::atomic<uint32_t> numPages;
+    // This is the maximum number of pages the filehandle can currently support.
+    uint32_t pageCapacity;
+
+    BufferManager* bm;
+    common::PageSizeClass pageSizeClass;
+    // With a page group size of 2^10 and an 256KB index size, the access cost increases
+    // only with each 128GB added to the file
+    common::ConcurrentVector<PageState, common::StorageConstants::PAGE_GROUP_SIZE,
+        common::TEMP_PAGE_SIZE / sizeof(void*)>
+        pageStates;
+    // Each file page group corresponds to a frame group in the VMRegion.
+    // Just one frame group for each page group, so performance is less sensitive than pageStates
+    // and left at the default which won't increase access cost for the frame groups until 16TB of
+    // data has been written
+    common::ConcurrentVector<common::page_group_idx_t> frameGroupIdxes;
+
+    std::unique_ptr<PageManager> pageManager;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/free_space_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/free_space_manager.h
new file mode 100644
index 0000000000..3fb61b822d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/free_space_manager.h
@@ -0,0 +1,94 @@
+/**
+ * We would like to thank Mingkun Ni and Mayank Jasoria for doing the initial research and
+ * prototyping for the FreeSpaceManager in their CS 848 course project:
+ * https://github.com/ericpolo/lbug_cs848
+ */
+
+#pragma once
+
+#include <optional>
+#include <set>
+
+#include "common/types/types.h"
+namespace lbug::storage {
+
+class BufferManager;
+struct PageRange;
+struct FreeEntryIterator;
+class FileHandle;
+
+class FreeSpaceManager {
+public:
+    static bool entryCmp(const PageRange& a, const PageRange& b);
+    using sorted_free_list_t = std::set<PageRange, decltype(&entryCmp)>;
+    using free_list_t = std::vector<PageRange>;
+
+    FreeSpaceManager();
+
+    void addFreePages(PageRange entry);
+    void evictAndAddFreePages(FileHandle* fileHandle, PageRange entry);
+    std::optional<PageRange> popFreePages(common::page_idx_t numPages);
+
+    // These pages are not reusable until the end of the next checkpoint
+    void addUncheckpointedFreePages(PageRange entry);
+    void rollbackCheckpoint();
+
+    common::page_idx_t getMaxNumPagesForSerialization() const;
+    void serialize(common::Serializer& serializer) const;
+    void deserialize(common::Deserializer& deSer);
+    void finalizeCheckpoint(FileHandle* fileHandle);
+
+    common::row_idx_t getNumEntries() const;
+    std::vector<PageRange> getEntries(common::row_idx_t startOffset,
+        common::row_idx_t endOffset) const;
+
+    // When a page is freed by the FSM, it evicts it from the BM. However, if the page is freed,
+    // then reused over and over, it can be appended to the eviction queue multiple times. To
+    // prevent multiple entries of the same page from existing in the eviction queue, at the end of
+    // each checkpoint we remove any already-evicted pages.
+    void clearEvictedBufferManagerEntriesIfNeeded(BufferManager* bufferManager);
+
+private:
+    PageRange splitPageRange(PageRange chunk, common::page_idx_t numRequiredPages);
+    void mergePageRanges(free_list_t newInitialEntries, FileHandle* fileHandle);
+    void handleLastPageRange(PageRange pageRange, FileHandle* fileHandle);
+    void resetFreeLists();
+    static common::idx_t getLevel(common::page_idx_t numPages);
+    void evictPages(FileHandle* fileHandle, const PageRange& entry);
+
+    template<typename ValueProcessor>
+    void serializeInternal(ValueProcessor& serializer) const;
+
+    std::vector<sorted_free_list_t> freeLists;
+    free_list_t uncheckpointedFreePageRanges;
+    common::row_idx_t numEntries;
+    bool needClearEvictedEntries;
+};
+
+/**
+ * Used for iterating over all entries in the FreeSpaceManager
+ * Note that the iterator may become invalidated in the FSM is modified
+ */
+struct FreeEntryIterator {
+    explicit FreeEntryIterator(const std::vector<FreeSpaceManager::sorted_free_list_t>& freeLists)
+        : FreeEntryIterator(freeLists, 0) {}
+
+    FreeEntryIterator(const std::vector<FreeSpaceManager::sorted_free_list_t>& freeLists,
+        common::idx_t freeListIdx_)
+        : freeLists(freeLists), freeListIdx(freeListIdx_) {
+        advanceFreeListIdx();
+    }
+
+    void advance(common::row_idx_t numEntries);
+    void operator++();
+    PageRange operator*() const;
+    bool done() const;
+
+    void advanceFreeListIdx();
+
+    const std::vector<FreeSpaceManager::sorted_free_list_t>& freeLists;
+    common::idx_t freeListIdx;
+    FreeSpaceManager::sorted_free_list_t::const_iterator freeListIt;
+};
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index.h
new file mode 100644
index 0000000000..276932ff93
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index.h
@@ -0,0 +1,508 @@
+#pragma once
+
+#include <algorithm>
+#include <string_view>
+#include <type_traits>
+
+#include "common/cast.h"
+#include "common/serializer/buffer_reader.h"
+#include "common/serializer/serializer.h"
+#include "common/type_utils.h"
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "hash_index_header.h"
+#include "hash_index_slot.h"
+#include "index.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/disk_array_collection.h"
+#include "storage/index/hash_index_utils.h"
+#include "storage/index/in_mem_hash_index.h"
+#include "storage/local_storage/local_hash_index.h"
+
+namespace lbug {
+namespace common {
+class VirtualFileSystem;
+}
+namespace transaction {
+class Transaction;
+enum class TransactionType : uint8_t;
+} // namespace transaction
+namespace storage {
+
+class FileHandle;
+class BufferManager;
+class OverflowFileHandle;
+template<typename T>
+class DiskArray;
+class PageManager;
+
+class OnDiskHashIndex {
+public:
+    virtual ~OnDiskHashIndex() = default;
+    virtual bool checkpoint(PageAllocator& pageAllocator) = 0;
+    virtual bool checkpointInMemory() = 0;
+    virtual bool rollbackInMemory() = 0;
+    virtual void rollbackCheckpoint() = 0;
+    virtual void bulkReserve(uint64_t numValuesToAppend) = 0;
+    virtual void reclaimStorage(PageAllocator& pageAllocator) = 0;
+    virtual bool tryLock() = 0;
+    virtual std::unique_lock<std::shared_mutex> adoptLock() = 0;
+};
+
+// HashIndex is the entrance to handle all updates and lookups into the index after building from
+// scratch through InMemHashIndex.
+// The index consists of two parts, one is the persistent storage (from the persistent index file),
+// and the other is the local storage. All lookups/deletions/insertions go through local storage,
+// and then the persistent storage if necessary.
+//
+// Key interfaces:
+// - lookup(): Given a key, find its result. Return true if the key is found, else, return false.
+//   Lookups go through the local storage first, check if the key is marked as deleted or not, then
+//   check whether it can be found inside local insertions or not. If the key is neither marked as
+//   deleted nor found in local insertions, we proceed to lookups in the persistent store.
+// - delete(): Delete the given key.
+//   Deletions are directly marked in the local storage.
+// - insert(): Insert the given key and value. Return true if the given key doesn't exist in the
+// index before insertion, otherwise, return false.
+//   First check if the key to be inserted already exists in local insertions or the persistent
+//   store. If the key doesn't exist yet, append it to local insertions, and also remove it from
+//   local deletions if it was marked as deleted.
+//
+// T is the key type used to access values
+// S is the stored type, which is usually the same as T, with the exception of strings
+template<typename T>
+class HashIndex final : public OnDiskHashIndex {
+public:
+    HashIndex(MemoryManager& memoryManager, OverflowFileHandle* overflowFileHandle,
+        DiskArrayCollection& diskArrays, uint64_t indexPos, ShadowFile* shadowFile,
+        const HashIndexHeader& indexHeaderForReadTrx, HashIndexHeader& indexHeaderForWriteTrx);
+
+    ~HashIndex() override;
+
+public:
+    using OnDiskSlotType = Slot<T>;
+    static constexpr auto PERSISTENT_SLOT_CAPACITY = getSlotCapacity<T>();
+
+    static_assert(DiskArray<OnDiskSlotType>::getAlignedElementSize() <=
+                  common::HashIndexConstants::SLOT_CAPACITY_BYTES);
+    static_assert(DiskArray<OnDiskSlotType>::getAlignedElementSize() >
+                  common::HashIndexConstants::SLOT_CAPACITY_BYTES / 2);
+
+    using Key =
+        typename std::conditional<std::same_as<T, common::ku_string_t>, std::string_view, T>::type;
+    // For read transactions, local storage is skipped, lookups are performed on the persistent
+    // storage. For write transactions, lookups are performed in the local storage first, then in
+    // the persistent storage if necessary. In details, there are three cases for the local storage
+    // lookup:
+    // - the key is found in the local storage, directly return true;
+    // - the key has been marked as deleted in the local storage, return false;
+    // - the key is neither deleted nor found in the local storage, lookup in the persistent
+    // storage.
+    bool lookupInternal(const transaction::Transaction* transaction, Key key,
+        common::offset_t& result, visible_func isVisible) {
+        auto localLookupState = localStorage->lookup(key, result, isVisible);
+        if (localLookupState == HashIndexLocalLookupState::KEY_DELETED) {
+            return false;
+        }
+        if (localLookupState == HashIndexLocalLookupState::KEY_FOUND) {
+            return true;
+        }
+        KU_ASSERT(localLookupState == HashIndexLocalLookupState::KEY_NOT_EXIST);
+        return lookupInPersistentIndex(transaction, key, result, isVisible);
+    }
+
+    // For deletions, we don't check if the deleted keys exist or not. Thus, we don't need to check
+    // in the persistent storage and directly delete keys in the local storage.
+    void deleteInternal(Key key) const { localStorage->deleteKey(key); }
+    // Discards from local storage, but will not insert a deletion (used for rollbacks)
+    bool discardLocal(Key key) const { return localStorage->discard(key); }
+
+    // For insertions, we first check in the local storage. There are three cases:
+    // - the key is found in the local storage, return false;
+    // - the key is marked as deleted in the local storage, insert the key to the local storage;
+    // - the key doesn't exist in the local storage, check if the key exists in the persistent
+    // index, if
+    //   so, return false, else insert the key to the local storage.
+    using InsertType = InMemHashIndex<T>::OwnedType;
+    bool insertInternal(const transaction::Transaction* transaction, InsertType&& key,
+        common::offset_t value, visible_func isVisible) {
+        common::offset_t tmpResult = 0;
+        auto localLookupState = localStorage->lookup(key, tmpResult, isVisible);
+        if (localLookupState == HashIndexLocalLookupState::KEY_FOUND) {
+            return false;
+        }
+        if (localLookupState != HashIndexLocalLookupState::KEY_DELETED) {
+            if (lookupInPersistentIndex(transaction, key, tmpResult, isVisible)) {
+                return false;
+            }
+        }
+        return localStorage->insert(std::move(key), value, isVisible);
+    }
+
+    using BufferKeyType =
+        typename std::conditional<std::same_as<T, common::ku_string_t>, std::string, T>::type;
+    // Appends the buffer to the index. Returns the number of values successfully inserted
+    // Note that this function does not acquire locks internally, as the caller is expected to hold
+    // the lock already.
+    size_t appendNoLock(const transaction::Transaction* transaction,
+        IndexBuffer<BufferKeyType>& buffer, uint64_t bufferOffset, visible_func isVisible) {
+        // Check if values already exist in persistent storage
+        if (indexHeaderForWriteTrx.numEntries > 0) {
+            localStorage->reserveSpaceForAppendNoLock(buffer.size() - bufferOffset);
+            size_t numValuesInserted = 0;
+            common::offset_t result = 0;
+            for (size_t i = bufferOffset; i < buffer.size(); i++) {
+                auto& [key, value] = buffer[i];
+                if (lookupInPersistentIndex(transaction, key, result, isVisible)) {
+                    return i - bufferOffset;
+                } else {
+                    numValuesInserted +=
+                        localStorage->appendNoLock(std::move(key), value, isVisible);
+                }
+            }
+            return numValuesInserted;
+        } else {
+            return localStorage->appendNoLock(buffer, bufferOffset, isVisible);
+        }
+    }
+
+    bool tryLock() override { return localStorage->tryLock(); }
+    std::unique_lock<std::shared_mutex> adoptLock() override { return localStorage->adoptLock(); }
+
+    bool checkpoint(PageAllocator& pageAllocator) override;
+    bool checkpointInMemory() override;
+    bool rollbackInMemory() override;
+    void rollbackCheckpoint() override;
+    void reclaimStorage(PageAllocator& pageAllocator) override;
+
+private:
+    bool lookupInPersistentIndex(const transaction::Transaction* transaction, Key key,
+        common::offset_t& result, visible_func isVisible) {
+        auto& header = transaction->getType() == transaction::TransactionType::CHECKPOINT ?
+                           this->indexHeaderForWriteTrx :
+                           this->indexHeaderForReadTrx;
+        // There may not be any primary key slots if we try to lookup on an empty index
+        if (header.numEntries == 0) {
+            return false;
+        }
+        auto hashValue = HashIndexUtils::hash(key);
+        auto fingerprint = HashIndexUtils::getFingerprintForHash(hashValue);
+        auto iter = getSlotIterator(HashIndexUtils::getPrimarySlotIdForHash(header, hashValue),
+            transaction);
+        do {
+            auto entryPos =
+                findMatchedEntryInSlot(transaction, iter.slot, key, fingerprint, isVisible);
+            if (entryPos != SlotHeader::INVALID_ENTRY_POS) {
+                result = iter.slot.entries[entryPos].value;
+                return true;
+            }
+        } while (nextChainedSlot(transaction, iter));
+        return false;
+    }
+    void deleteFromPersistentIndex(const transaction::Transaction* transaction, Key key,
+        visible_func isVisible);
+
+    entry_pos_t findMatchedEntryInSlot(const transaction::Transaction* transaction,
+        const OnDiskSlotType& slot, Key key, uint8_t fingerprint,
+        const visible_func& isVisible) const {
+        for (auto entryPos = 0u; entryPos < PERSISTENT_SLOT_CAPACITY; entryPos++) {
+            if (slot.header.isEntryValid(entryPos) &&
+                slot.header.fingerprints[entryPos] == fingerprint &&
+                equals(transaction, key, slot.entries[entryPos].key) &&
+                isVisible(slot.entries[entryPos].value)) {
+                return entryPos;
+            }
+        }
+        return SlotHeader::INVALID_ENTRY_POS;
+    }
+
+    inline void updateSlot(const transaction::Transaction* transaction, const SlotInfo& slotInfo,
+        const OnDiskSlotType& slot) {
+        slotInfo.slotType == SlotType::PRIMARY ?
+            pSlots->update(transaction, slotInfo.slotId, slot) :
+            oSlots->update(transaction, slotInfo.slotId, slot);
+    }
+
+    inline OnDiskSlotType getSlot(const transaction::Transaction* transaction,
+        const SlotInfo& slotInfo) const {
+        return slotInfo.slotType == SlotType::PRIMARY ? pSlots->get(slotInfo.slotId, transaction) :
+                                                        oSlots->get(slotInfo.slotId, transaction);
+    }
+
+    void splitSlots(PageAllocator& pageAllocator, const transaction::Transaction* transaction,
+        HashIndexHeader& header, slot_id_t numSlotsToSplit);
+
+    // Resizes the local storage to support the given number of new entries
+    void bulkReserve(uint64_t newEntries) override;
+    // Resizes the on-disk index to support the given number of new entries
+    void reserve(PageAllocator& pageAllocator, const transaction::Transaction* transaction,
+        uint64_t newEntries);
+
+    struct HashIndexEntryView {
+        slot_id_t diskSlotId;
+        uint8_t fingerprint;
+        const SlotEntry<typename InMemHashIndex<T>::OwnedType>* entry;
+    };
+
+    void sortEntries(const transaction::Transaction* transaction,
+        const InMemHashIndex<T>& insertLocalStorage,
+        typename InMemHashIndex<T>::SlotIterator& slotToMerge,
+        std::vector<HashIndexEntryView>& entries);
+    void mergeBulkInserts(PageAllocator& pageAllocator, const transaction::Transaction* transaction,
+        const InMemHashIndex<T>& insertLocalStorage);
+    // Returns the number of elements merged which matched the given slot id
+    size_t mergeSlot(PageAllocator& pageAllocator, const transaction::Transaction* transaction,
+        const std::vector<HashIndexEntryView>& slotToMerge,
+        typename DiskArray<OnDiskSlotType>::WriteIterator& diskSlotIterator,
+        typename DiskArray<OnDiskSlotType>::WriteIterator& diskOverflowSlotIterator,
+        slot_id_t diskSlotId);
+
+    inline bool equals(const transaction::Transaction* /*transaction*/, Key keyToLookup,
+        const T& keyInEntry) const {
+        return keyToLookup == keyInEntry;
+    }
+
+    inline common::hash_t hashStored(const transaction::Transaction* /*transaction*/,
+        const T& key) const {
+        return HashIndexUtils::hash(key);
+    }
+
+    inline common::hash_t hashStored(const transaction::Transaction* /*transaction*/,
+        std::string_view key) const {
+        return HashIndexUtils::hash(key);
+    }
+
+    struct SlotIterator {
+        SlotInfo slotInfo;
+        OnDiskSlotType slot;
+    };
+
+    SlotIterator getSlotIterator(slot_id_t slotId, const transaction::Transaction* transaction) {
+        return SlotIterator{SlotInfo{slotId, SlotType::PRIMARY},
+            getSlot(transaction, SlotInfo{slotId, SlotType::PRIMARY})};
+    }
+
+    bool nextChainedSlot(const transaction::Transaction* transaction, SlotIterator& iter) const {
+        KU_ASSERT(iter.slotInfo.slotType == SlotType::PRIMARY ||
+                  iter.slotInfo.slotId != iter.slot.header.nextOvfSlotId);
+        if (iter.slot.header.nextOvfSlotId != SlotHeader::INVALID_OVERFLOW_SLOT_ID) {
+            iter.slotInfo.slotId = iter.slot.header.nextOvfSlotId;
+            iter.slotInfo.slotType = SlotType::OVF;
+            iter.slot = getSlot(transaction, iter.slotInfo);
+            return true;
+        }
+        return false;
+    }
+
+    std::vector<std::pair<SlotInfo, OnDiskSlotType>> getChainedSlots(
+        const transaction::Transaction* transaction, slot_id_t pSlotId);
+
+private:
+    ShadowFile* shadowFile;
+    uint64_t headerPageIdx;
+    std::unique_ptr<DiskArray<OnDiskSlotType>> pSlots;
+    std::unique_ptr<DiskArray<OnDiskSlotType>> oSlots;
+    OverflowFileHandle* overflowFileHandle;
+    std::unique_ptr<HashIndexLocalStorage<T>> localStorage;
+    const HashIndexHeader& indexHeaderForReadTrx;
+    HashIndexHeader& indexHeaderForWriteTrx;
+    MemoryManager& memoryManager;
+};
+
+template<>
+common::hash_t HashIndex<common::ku_string_t>::hashStored(
+    const transaction::Transaction* transaction, const common::ku_string_t& key) const;
+
+template<>
+bool HashIndex<common::ku_string_t>::equals(const transaction::Transaction* transaction,
+    std::string_view keyToLookup, const common::ku_string_t& keyInEntry) const;
+
+struct PrimaryKeyIndexStorageInfo final : IndexStorageInfo {
+    common::page_idx_t firstHeaderPage;
+    common::page_idx_t overflowHeaderPage;
+
+    PrimaryKeyIndexStorageInfo()
+        : firstHeaderPage{common::INVALID_PAGE_IDX}, overflowHeaderPage{common::INVALID_PAGE_IDX} {}
+    PrimaryKeyIndexStorageInfo(common::page_idx_t firstHeaderPage,
+        common::page_idx_t overflowHeaderPage)
+        : firstHeaderPage{firstHeaderPage}, overflowHeaderPage{overflowHeaderPage} {}
+
+    DELETE_COPY_DEFAULT_MOVE(PrimaryKeyIndexStorageInfo);
+
+    std::shared_ptr<common::BufferWriter> serialize() const override {
+        auto bufferWriter = std::make_shared<common::BufferWriter>();
+        auto serializer = common::Serializer(bufferWriter);
+        serializer.write<common::page_idx_t>(firstHeaderPage);
+        serializer.write<common::page_idx_t>(overflowHeaderPage);
+        return bufferWriter;
+    }
+
+    static std::unique_ptr<IndexStorageInfo> deserialize(
+        std::unique_ptr<common::BufferReader> reader);
+};
+
+class PrimaryKeyIndex final : public Index {
+public:
+    static constexpr const char* DEFAULT_NAME = "_PK";
+
+    struct InsertState final : Index::InsertState {
+        visible_func isVisible; // Function to check visibility of the inserted key
+
+        explicit InsertState(visible_func isVisible_) : isVisible{std::move(isVisible_)} {}
+    };
+
+    // Construct an existing index
+    PrimaryKeyIndex(IndexInfo indexInfo, std::unique_ptr<IndexStorageInfo> storageInfo,
+        bool inMemMode, MemoryManager& memoryManager, PageAllocator& pageAllocator,
+        ShadowFile* shadowFile);
+    ~PrimaryKeyIndex() override;
+
+    static std::unique_ptr<PrimaryKeyIndex> createNewIndex(IndexInfo indexInfo, bool inMemMode,
+        MemoryManager& memoryManager, PageAllocator& pageAllocator, ShadowFile* shadowFile);
+
+    template<typename T>
+    inline HashIndex<HashIndexType<T>>* getTypedHashIndex(T key) {
+        return common::ku_dynamic_cast<HashIndex<HashIndexType<T>>*>(
+            hashIndices[HashIndexUtils::getHashIndexPosition(key)].get());
+    }
+    template<common::IndexHashable T>
+    inline HashIndex<T>* getTypedHashIndexByPos(uint64_t indexPos) {
+        return common::ku_dynamic_cast<HashIndex<HashIndexType<T>>*>(hashIndices[indexPos].get());
+    }
+
+    bool tryLockTypedIndex(uint64_t indexPos) { return hashIndices[indexPos]->tryLock(); }
+    std::unique_lock<std::shared_mutex> adoptLockOfTypedIndex(uint64_t indexPos) {
+        return hashIndices[indexPos]->adoptLock();
+    }
+
+    bool lookup(const transaction::Transaction* trx, common::ku_string_t key,
+        common::offset_t& result, visible_func isVisible) {
+        return lookup(trx, key.getAsStringView(), result, isVisible);
+    }
+    template<common::IndexHashable T>
+    inline bool lookup(const transaction::Transaction* trx, T key, common::offset_t& result,
+        visible_func isVisible) {
+        KU_ASSERT(indexInfo.keyDataTypes[0] == common::TypeUtils::getPhysicalTypeIDForType<T>());
+        return getTypedHashIndex(key)->lookupInternal(trx, key, result, isVisible);
+    }
+
+    bool lookup(const transaction::Transaction* trx, common::ValueVector* keyVector,
+        uint64_t vectorPos, common::offset_t& result, visible_func isVisible);
+
+    std::unique_ptr<Index::InsertState> initInsertState(main::ClientContext*,
+        visible_func isVisible) override {
+        return std::make_unique<InsertState>(isVisible);
+    }
+    void insert(transaction::Transaction*, const common::ValueVector&,
+        const std::vector<common::ValueVector*>&, Index::InsertState&) override {
+        // DO NOTHING.
+        // For hash index, we don't need to do anything here because the insertions are handled when
+        // the transaction commits.
+    }
+    bool insert(const transaction::Transaction* transaction, common::ku_string_t key,
+        common::offset_t value, visible_func isVisible) {
+        return insert(transaction, key.getAsString(), value, isVisible);
+    }
+    template<common::IndexHashable T>
+    inline bool insert(const transaction::Transaction* transaction, T key, common::offset_t value,
+        visible_func isVisible) {
+        KU_ASSERT(indexInfo.keyDataTypes[0] == common::TypeUtils::getPhysicalTypeIDForType<T>());
+        return getTypedHashIndex(key)->insertInternal(transaction, std::move(key), value,
+            isVisible);
+    }
+    bool insert(const transaction::Transaction* transaction, const common::ValueVector* keyVector,
+        uint64_t vectorPos, common::offset_t value, visible_func isVisible);
+    bool needCommitInsert() const override { return true; }
+    void commitInsert(transaction::Transaction* transaction,
+        const common::ValueVector& nodeIDVector,
+        const std::vector<common::ValueVector*>& indexVectors,
+        Index::InsertState& insertState) override;
+
+    // Appends the buffer to the index. Returns the number of values successfully inserted.
+    // If a key fails to insert, it immediately returns without inserting any more values,
+    // and the returned value is also the index of the key which failed to insert.
+    template<common::IndexHashable T>
+    size_t appendWithIndexPosNoLock(const transaction::Transaction* transaction,
+        IndexBuffer<T>& buffer, uint64_t bufferOffset, uint64_t indexPos, visible_func isVisible) {
+        KU_ASSERT(indexInfo.keyDataTypes[0] == common::TypeUtils::getPhysicalTypeIDForType<T>());
+        KU_ASSERT(std::all_of(buffer.begin(), buffer.end(), [&](auto& elem) {
+            return HashIndexUtils::getHashIndexPosition(elem.first) == indexPos;
+        }));
+        return getTypedHashIndexByPos<HashIndexType<T>>(indexPos)->appendNoLock(transaction, buffer,
+            bufferOffset, isVisible);
+    }
+
+    void bulkReserve(uint64_t numValuesToAppend) {
+        uint32_t eachSize = numValuesToAppend / NUM_HASH_INDEXES + 1;
+        for (auto i = 0u; i < NUM_HASH_INDEXES; i++) {
+            hashIndices[i]->bulkReserve(eachSize);
+        }
+    }
+
+    void delete_(common::ku_string_t key) { return delete_(key.getAsStringView()); }
+    std::unique_ptr<DeleteState> initDeleteState(const transaction::Transaction* /*transaction*/,
+        MemoryManager* /*mm*/, visible_func /*isVisible*/) override {
+        return std::make_unique<DeleteState>();
+    }
+    void delete_(transaction::Transaction* /*transaction*/,
+        const common::ValueVector& /*nodeIDVector*/, DeleteState& /*deleteState*/) override {
+        // DO NOTHING.
+    }
+    template<common::IndexHashable T>
+    inline void delete_(T key) {
+        KU_ASSERT(indexInfo.keyDataTypes[0] == common::TypeUtils::getPhysicalTypeIDForType<T>());
+        return getTypedHashIndex(key)->deleteInternal(key);
+    }
+
+    bool discardLocal(common::ku_string_t key) { return discardLocal(key.getAsStringView()); }
+    template<common::IndexHashable T>
+    inline bool discardLocal(T key) {
+        KU_ASSERT(indexInfo.keyDataTypes[0] == common::TypeUtils::getPhysicalTypeIDForType<T>());
+        return getTypedHashIndex(key)->discardLocal(key);
+    }
+
+    void delete_(common::ValueVector* keyVector);
+
+    void checkpointInMemory() override;
+    void checkpoint(main::ClientContext*, storage::PageAllocator& pageAllocator) override;
+    OverflowFile* getOverflowFile() const { return overflowFile.get(); }
+
+    void rollbackCheckpoint() override;
+
+    common::PhysicalTypeID keyTypeID() const {
+        KU_ASSERT(indexInfo.keyDataTypes.size() == 1);
+        return indexInfo.keyDataTypes[0];
+    }
+    void reclaimStorage(PageAllocator& pageAllocator) const;
+
+    static LBUG_API std::unique_ptr<Index> load(main::ClientContext* context,
+        StorageManager* storageManager, IndexInfo indexInfo, std::span<uint8_t> storageInfoBuffer);
+
+    static IndexType getIndexType() {
+        static const IndexType HASH_INDEX_TYPE{"HASH", IndexConstraintType::PRIMARY,
+            IndexDefinitionType::BUILTIN, load};
+        return HASH_INDEX_TYPE;
+    }
+
+private:
+    void writeHeaders(PageAllocator& pageAllocator) const;
+
+    void initOverflowAndSubIndices(bool inMemMode, MemoryManager& mm, PageAllocator& pageAllocator,
+        PrimaryKeyIndexStorageInfo& storageInfo);
+
+    common::page_idx_t getFirstHeaderPage() const;
+
+    common::page_idx_t getDiskArrayFirstHeaderPage() const;
+
+private:
+    std::unique_ptr<OverflowFile> overflowFile;
+    std::vector<std::unique_ptr<OnDiskHashIndex>> hashIndices;
+    std::vector<HashIndexHeader> hashIndexHeadersForReadTrx;
+    std::vector<HashIndexHeader> hashIndexHeadersForWriteTrx;
+    ShadowFile& shadowFile;
+    // Stores both primary and overflow slots
+    std::unique_ptr<DiskArrayCollection> hashIndexDiskArrays;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index_header.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index_header.h
new file mode 100644
index 0000000000..3e5e776e8b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index_header.h
@@ -0,0 +1,68 @@
+#pragma once
+
+#include "hash_index_slot.h"
+
+namespace lbug {
+namespace storage {
+
+struct HashIndexHeaderOnDisk {
+    explicit HashIndexHeaderOnDisk()
+        : nextSplitSlotId{0}, numEntries{0},
+          firstFreeOverflowSlotId{SlotHeader::INVALID_OVERFLOW_SLOT_ID}, currentLevel{0} {}
+    slot_id_t nextSplitSlotId;
+    uint64_t numEntries;
+    slot_id_t firstFreeOverflowSlotId;
+    uint8_t currentLevel;
+    uint8_t _padding[7]{};
+};
+static_assert(std::has_unique_object_representations_v<HashIndexHeaderOnDisk>);
+
+class HashIndexHeader {
+public:
+    explicit HashIndexHeader()
+        : currentLevel{1}, levelHashMask{1}, higherLevelHashMask{3}, nextSplitSlotId{0},
+          numEntries{0}, firstFreeOverflowSlotId{SlotHeader::INVALID_OVERFLOW_SLOT_ID} {}
+
+    explicit HashIndexHeader(const HashIndexHeaderOnDisk& onDiskHeader)
+        : currentLevel{onDiskHeader.currentLevel}, levelHashMask{(1ull << this->currentLevel) - 1},
+          higherLevelHashMask{(1ull << (this->currentLevel + 1)) - 1},
+          nextSplitSlotId{onDiskHeader.nextSplitSlotId}, numEntries{onDiskHeader.numEntries},
+          firstFreeOverflowSlotId{onDiskHeader.firstFreeOverflowSlotId} {}
+
+    inline void incrementLevel() {
+        currentLevel++;
+        nextSplitSlotId = 0;
+        levelHashMask = (1 << currentLevel) - 1;
+        higherLevelHashMask = (1 << (currentLevel + 1)) - 1;
+    }
+    inline void incrementNextSplitSlotId() {
+        if (nextSplitSlotId < (1ull << currentLevel) - 1) {
+            nextSplitSlotId++;
+        } else {
+            incrementLevel();
+        }
+    }
+
+    inline void write(HashIndexHeaderOnDisk& onDiskHeader) const {
+        onDiskHeader.currentLevel = currentLevel;
+        onDiskHeader.nextSplitSlotId = nextSplitSlotId;
+        onDiskHeader.numEntries = numEntries;
+        onDiskHeader.firstFreeOverflowSlotId = firstFreeOverflowSlotId;
+    }
+
+public:
+    uint64_t currentLevel;
+    uint64_t levelHashMask;
+    uint64_t higherLevelHashMask;
+    // Id of the next slot to split when resizing the hash index
+    slot_id_t nextSplitSlotId;
+    uint64_t numEntries;
+    // Id of the first in a chain of empty overflow slots which have been reclaimed during slot
+    // splitting. The nextOvfSlotId field in the slot's header indicates the next slot in the chain.
+    // These slots should be used first when allocating new overflow slots
+    // TODO(bmwinger): Make use of this in the on-disk hash index
+    slot_id_t firstFreeOverflowSlotId;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index_slot.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index_slot.h
new file mode 100644
index 0000000000..89313fc1c4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index_slot.h
@@ -0,0 +1,88 @@
+#pragma once
+
+#include <array>
+#include <cstdint>
+#include <cstring>
+#include <type_traits>
+
+#include "common/assert.h"
+#include "common/constants.h"
+#include "common/types/types.h"
+#include <bit>
+
+namespace lbug {
+namespace storage {
+
+using entry_pos_t = uint8_t;
+using slot_id_t = uint64_t;
+
+class SlotHeader {
+public:
+    static const entry_pos_t INVALID_ENTRY_POS = UINT8_MAX;
+    static const slot_id_t INVALID_OVERFLOW_SLOT_ID = UINT64_MAX;
+    // For a header of 32 bytes.
+    // This is smaller than the possible number of entries with an 1-byte key like uint8_t,
+    // but the additional size would limit the number of entries for 8-byte keys, so we
+    // instead restrict the capacity to 20
+    static constexpr uint8_t FINGERPRINT_CAPACITY = 20;
+
+    SlotHeader() : fingerprints{}, validityMask{0}, nextOvfSlotId{INVALID_OVERFLOW_SLOT_ID} {}
+
+    void reset() {
+        validityMask = 0;
+        nextOvfSlotId = INVALID_OVERFLOW_SLOT_ID;
+    }
+
+    inline bool isEntryValid(uint32_t entryPos) const {
+        return validityMask & ((uint32_t)1 << entryPos);
+    }
+    inline void setEntryValid(entry_pos_t entryPos, uint8_t fingerprint) {
+        validityMask |= ((uint32_t)1 << entryPos);
+        fingerprints[entryPos] = fingerprint;
+    }
+    inline void setEntryInvalid(entry_pos_t entryPos) {
+        validityMask &= ~((uint32_t)1 << entryPos);
+    }
+
+    inline entry_pos_t numEntries() const { return std::popcount(validityMask); }
+
+public:
+    std::array<uint8_t, FINGERPRINT_CAPACITY> fingerprints;
+    uint32_t validityMask;
+    slot_id_t nextOvfSlotId;
+};
+static_assert(std::has_unique_object_representations_v<SlotHeader>);
+
+template<typename T>
+struct SlotEntry {
+    SlotEntry(T _key, common::offset_t _value) : key{std::move(_key)}, value{_value} {
+        // Zero padding, if any
+        if constexpr (sizeof(T) + sizeof(common::offset_t) < sizeof(SlotEntry<T>)) {
+            auto padding = sizeof(SlotEntry<T>) - sizeof(T) - sizeof(common::offset_t);
+            memset(reinterpret_cast<uint8_t*>(&key) + sizeof(T), 0, padding);
+            // Assumes that all the padding follows the key
+            KU_ASSERT((std::byte*)&key + sizeof(key) + padding == (std::byte*)&value);
+        }
+    }
+    SlotEntry() : SlotEntry(T{}, 0) {}
+
+    T key;
+    common::offset_t value;
+};
+
+template<typename T>
+static constexpr uint8_t getSlotCapacity() {
+    return std::min((common::HashIndexConstants::SLOT_CAPACITY_BYTES - sizeof(SlotHeader)) /
+                        sizeof(SlotEntry<T>),
+        static_cast<size_t>(SlotHeader::FINGERPRINT_CAPACITY));
+}
+
+template<typename T>
+struct Slot {
+    Slot() : header{}, entries{} {}
+    SlotHeader header;
+    std::array<SlotEntry<T>, getSlotCapacity<T>()> entries;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index_utils.h
new file mode 100644
index 0000000000..4900e21e85
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/hash_index_utils.h
@@ -0,0 +1,86 @@
+#pragma once
+
+#include <cmath>
+#include <cstdint>
+
+#include "common/constants.h"
+#include "common/system_config.h"
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "function/hash/hash_functions.h"
+#include "storage/index/hash_index_header.h"
+
+namespace lbug {
+namespace storage {
+
+static constexpr uint64_t NUM_HASH_INDEXES = common::HashIndexConstants::NUM_HASH_INDEXES;
+static constexpr uint64_t NUM_HASH_INDEXES_LOG2 = common::HashIndexConstants::NUM_HASH_INDEXES_LOG2;
+
+static constexpr common::page_idx_t INDEX_HEADER_PAGES = 2;
+static constexpr uint64_t INDEX_HEADERS_PER_PAGE =
+    common::LBUG_PAGE_SIZE / sizeof(HashIndexHeaderOnDisk);
+
+static constexpr common::page_idx_t P_SLOTS_HEADER_PAGE_IDX = 0;
+static constexpr common::page_idx_t O_SLOTS_HEADER_PAGE_IDX = 1;
+static constexpr common::page_idx_t NUM_HEADER_PAGES = 2;
+static constexpr uint64_t INDEX_HEADER_IDX_IN_ARRAY = 0;
+
+// so that all 256 hash indexes can be stored in two pages, the HashIndexHeaderOnDisk must be
+// smaller than 32 bytes
+static_assert(NUM_HASH_INDEXES * sizeof(HashIndexHeaderOnDisk) <=
+              common::LBUG_PAGE_SIZE * INDEX_HEADER_PAGES);
+
+enum class SlotType : uint8_t { PRIMARY = 0, OVF = 1 };
+
+struct SlotInfo {
+    slot_id_t slotId{UINT64_MAX};
+    SlotType slotType{SlotType::PRIMARY};
+
+    bool operator==(const SlotInfo&) const = default;
+};
+
+class HashIndexUtils {
+
+public:
+    static constexpr auto INVALID_OVF_INFO =
+        SlotInfo{SlotHeader::INVALID_OVERFLOW_SLOT_ID, SlotType::OVF};
+
+    static bool areStringPrefixAndLenEqual(std::string_view keyToLookup,
+        const common::ku_string_t& keyInEntry) {
+        auto prefixLen =
+            std::min(static_cast<uint64_t>(keyInEntry.len), common::ku_string_t::PREFIX_LENGTH);
+        return keyToLookup.length() == keyInEntry.len &&
+               memcmp(keyToLookup.data(), keyInEntry.prefix, prefixLen) == 0;
+    }
+
+    template<typename T>
+    static common::hash_t hash(const T& key) {
+        common::hash_t hash = 0;
+        function::Hash::operation(key, hash);
+        return hash;
+    }
+
+    static uint8_t getFingerprintForHash(common::hash_t hash) {
+        // Last 8 bits before the bits used to calculate the hash index position is the fingerprint
+        return (hash >> (64 - NUM_HASH_INDEXES_LOG2 - 8)) & 255;
+    }
+
+    static slot_id_t getPrimarySlotIdForHash(const HashIndexHeader& indexHeader,
+        common::hash_t hash) {
+        auto slotId = hash & indexHeader.levelHashMask;
+        if (slotId < indexHeader.nextSplitSlotId) {
+            slotId = hash & indexHeader.higherLevelHashMask;
+        }
+        return slotId;
+    }
+
+    static uint64_t getHashIndexPosition(common::IndexHashable auto key) {
+        return (HashIndexUtils::hash(key) >> (64 - NUM_HASH_INDEXES_LOG2)) & (NUM_HASH_INDEXES - 1);
+    }
+
+    static uint64_t getNumRequiredEntries(uint64_t numEntries) {
+        return ceil(static_cast<double>(numEntries) * common::DEFAULT_HT_LOAD_FACTOR);
+    }
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/in_mem_hash_index.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/in_mem_hash_index.h
new file mode 100644
index 0000000000..9047d1ac52
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/in_mem_hash_index.h
@@ -0,0 +1,316 @@
+#pragma once
+
+#include <memory>
+
+#include "common/static_vector.h"
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/disk_array.h"
+#include "storage/index/hash_index_header.h"
+#include "storage/index/hash_index_slot.h"
+#include "storage/index/hash_index_utils.h"
+#include "storage/overflow_file.h"
+
+namespace lbug {
+namespace storage {
+
+using visible_func = std::function<bool(common::offset_t)>;
+
+constexpr size_t INDEX_BUFFER_SIZE = 1024;
+template<typename T>
+using IndexBuffer = common::StaticVector<std::pair<T, common::offset_t>, INDEX_BUFFER_SIZE>;
+
+template<typename T>
+using HashIndexType =
+    std::conditional_t<std::same_as<T, std::string_view> || std::same_as<T, std::string>,
+        common::ku_string_t, T>;
+
+/**
+ * Basic index file consists of three disk arrays: indexHeader, primary slots (pSlots), and overflow
+ * slots (oSlots).
+ *
+ * 1. HashIndexHeader contains the current state of the hash tables (level and split information:
+ * currentLevel, levelHashMask, higherLevelHashMask, nextSplitSlotId;  key data type).
+ *
+ * 2. Given a key, it is mapped to one of the pSlots based on its hash value and the level and
+ * splitting info. The actual key and value are either stored in the pSlot, or in a chained overflow
+ * slots (oSlots) of the pSlot.
+ *
+ * The slot data structure:
+ * Each slot (p/oSlot) consists of a slot header and several entries. The max number of entries in
+ * slot is given by HashIndexConstants::SLOT_CAPACITY. The size of the slot is given by
+ * (sizeof(SlotHeader) + (SLOT_CAPACITY * sizeof(Entry)).
+ *
+ * SlotHeader: [numEntries, validityMask, nextOvfSlotId]
+ * Entry: [key (fixed sized part), node_offset]
+ *
+ * 3. oSlots are used to store entries that comes to the designated primary slot that has already
+ * been filled to the capacity. Several overflow slots can be chained after the single primary slot
+ * as a singly linked link-list. Each slot's SlotHeader has information about the next overflow slot
+ * in the chain and also the number of filled entries in that slot.
+ *
+ *  */
+
+// T is the key type stored in the slots.
+// For strings this is different than the type used when inserting/searching
+// (see BufferKeyType and Key)
+template<typename T>
+class InMemHashIndex final {
+public:
+    using OwnedType = std::conditional_t<std::is_same_v<T, common::ku_string_t>, std::string, T>;
+    using KeyType = std::conditional_t<std::is_same_v<T, common::ku_string_t>, std::string_view, T>;
+    static_assert(std::is_constructible_v<OwnedType, KeyType>);
+    static_assert(std::is_constructible_v<KeyType, OwnedType>);
+
+    static constexpr auto SLOT_CAPACITY = getSlotCapacity<OwnedType>();
+    using InMemSlotType = Slot<OwnedType>;
+
+    // Size of the validity mask
+    static_assert(SLOT_CAPACITY <= sizeof(SlotHeader().validityMask) * 8);
+    static_assert(SLOT_CAPACITY <= std::numeric_limits<entry_pos_t>::max() + 1);
+
+    // sanity check to make sure we aren't accidentally making slots for some types larger than 256
+    // bytes.
+    static_assert(DiskArray<InMemSlotType>::getAlignedElementSize() <=
+                  common::HashIndexConstants::SLOT_CAPACITY_BYTES);
+
+    // the size of Slot depends on the size of T and should always be close to the
+    // SLOT_CAPACITY_BYTES
+    static_assert(DiskArray<InMemSlotType>::getAlignedElementSize() >
+                  common::HashIndexConstants::SLOT_CAPACITY_BYTES / 2);
+
+public:
+    explicit InMemHashIndex(MemoryManager& memoryManager, OverflowFileHandle* overflowFileHandle);
+
+    // Reserves space for at least the specified number of elements.
+    // This reserves space for numEntries in total, regardless of existing entries in the builder
+    void reserve(uint32_t numEntries);
+    // Allocates the given number of new slots, ignoo
+    void allocateSlots(uint32_t numSlots);
+
+    void reserveSpaceForAppend(uint32_t numNewEntries) {
+        reserve(indexHeader.numEntries + numNewEntries);
+    }
+
+    // Appends the buffer to the index. Returns the number of values successfully inserted.
+    // I.e. if a key fails to insert, its index will be the return value
+    size_t append(IndexBuffer<OwnedType>& buffer, uint64_t bufferOffset, visible_func isVisible) {
+        reserve(indexHeader.numEntries + buffer.size() - bufferOffset);
+        common::hash_t hashes[INDEX_BUFFER_SIZE];
+        for (size_t i = bufferOffset; i < buffer.size(); i++) {
+            hashes[i] = HashIndexUtils::hash(buffer[i].first);
+            auto& [key, value] = buffer[i];
+            if (!appendInternal(std::move(key), value, hashes[i], isVisible)) {
+                return i - bufferOffset;
+            }
+        }
+        return buffer.size() - bufferOffset;
+    }
+
+    bool append(OwnedType&& key, common::offset_t value, visible_func isVisible) {
+        reserve(indexHeader.numEntries + 1);
+        return appendInternal(std::move(key), value, HashIndexUtils::hash(key), isVisible);
+    }
+    bool lookup(KeyType key, common::offset_t& result, visible_func isVisible) {
+        // This needs to be fast if the builder is empty since this function is always tried
+        // when looking up in the persistent hash index
+        if (this->indexHeader.numEntries == 0) {
+            return false;
+        }
+        auto hashValue = HashIndexUtils::hash(key);
+        auto fingerprint = HashIndexUtils::getFingerprintForHash(hashValue);
+        auto slotId = HashIndexUtils::getPrimarySlotIdForHash(this->indexHeader, hashValue);
+        SlotIterator iter(slotId, this);
+        auto entryPos = findEntry(iter, key, fingerprint, isVisible);
+        if (entryPos != SlotHeader::INVALID_ENTRY_POS) {
+            result = iter.slot->entries[entryPos].value;
+            return true;
+        }
+        return false;
+    }
+
+    uint64_t size() const { return this->indexHeader.numEntries; }
+    bool empty() const { return size() == 0; }
+
+    void clear();
+
+    struct SlotIterator {
+        explicit SlotIterator(slot_id_t newSlotId, const InMemHashIndex* builder)
+            : slotInfo{newSlotId, SlotType::PRIMARY}, slot(builder->getSlot(slotInfo)) {}
+        explicit SlotIterator(SlotInfo slotInfo, const InMemHashIndex* builder)
+            : slotInfo{slotInfo}, slot(builder->getSlot(slotInfo)) {}
+        SlotInfo slotInfo;
+        InMemSlotType* slot;
+    };
+
+    // Leaves the slot pointer pointing at the last slot to make it easier to add a new one
+    bool nextChainedSlot(SlotIterator& iter) const {
+        KU_ASSERT(iter.slotInfo.slotType == SlotType::PRIMARY ||
+                  iter.slotInfo.slotId != iter.slot->header.nextOvfSlotId);
+        if (iter.slot->header.nextOvfSlotId != SlotHeader::INVALID_OVERFLOW_SLOT_ID) {
+            iter.slotInfo.slotId = iter.slot->header.nextOvfSlotId;
+            iter.slotInfo.slotType = SlotType::OVF;
+            iter.slot = getSlot(iter.slotInfo);
+            return true;
+        }
+        return false;
+    }
+
+    uint64_t numPrimarySlots() const { return pSlots->size(); }
+    uint64_t numOverflowSlots() const { return oSlots->size(); }
+
+    const HashIndexHeader& getIndexHeader() const { return indexHeader; }
+
+    // Deletes key, maintaining gapless structure by replacing it with the last entry in the
+    // slot
+    bool deleteKey(KeyType key) {
+        if (this->indexHeader.numEntries == 0) {
+            return false;
+        }
+        auto hashValue = HashIndexUtils::hash(key);
+        auto fingerprint = HashIndexUtils::getFingerprintForHash(hashValue);
+        auto slotId = HashIndexUtils::getPrimarySlotIdForHash(this->indexHeader, hashValue);
+        SlotIterator iter(slotId, this);
+        std::optional<entry_pos_t> deletedPos;
+        do {
+            for (auto entryPos = 0u; entryPos < SLOT_CAPACITY; entryPos++) {
+                if (iter.slot->header.isEntryValid(entryPos) &&
+                    iter.slot->header.fingerprints[entryPos] == fingerprint &&
+                    equals(key, iter.slot->entries[entryPos].key)) {
+                    deletedPos = entryPos;
+                    break;
+                }
+            }
+            if (deletedPos.has_value()) {
+                break;
+            }
+        } while (nextChainedSlot(iter));
+
+        if (deletedPos.has_value()) {
+            // Find the last valid entry and move it into the deleted position
+            auto newIter = iter;
+            while (nextChainedSlot(newIter)) {}
+            if (newIter.slotInfo != iter.slotInfo ||
+                *deletedPos != newIter.slot->header.numEntries() - 1) {
+                KU_ASSERT(newIter.slot->header.numEntries() > 0);
+                auto lastEntryPos = newIter.slot->header.numEntries() - 1;
+                iter.slot->entries[*deletedPos] = newIter.slot->entries[lastEntryPos];
+                iter.slot->header.setEntryValid(*deletedPos,
+                    newIter.slot->header.fingerprints[lastEntryPos]);
+                newIter.slot->header.setEntryInvalid(lastEntryPos);
+            } else {
+                iter.slot->header.setEntryInvalid(*deletedPos);
+            }
+
+            if (newIter.slot->header.numEntries() == 0) {
+                reclaimOverflowSlots(SlotIterator(slotId, this));
+            }
+
+            return true;
+        }
+        return false;
+    }
+
+private:
+    // Assumes that space has already been allocated for the entry
+    bool appendInternal(OwnedType&& key, common::offset_t value, common::hash_t hash,
+        visible_func isVisible) {
+        auto fingerprint = HashIndexUtils::getFingerprintForHash(hash);
+        auto slotID = HashIndexUtils::getPrimarySlotIdForHash(this->indexHeader, hash);
+        SlotIterator iter(slotID, this);
+        // The builder never keeps holes and doesn't support deletions
+        // Check the valid entries, then insert at the end if we don't find one which matches
+        auto entryPos = findEntry(iter, key, fingerprint, isVisible);
+        auto numEntries = iter.slot->header.numEntries();
+        if (entryPos != SlotHeader::INVALID_ENTRY_POS) {
+            // The key already exists
+            return false;
+        } else if (numEntries < SLOT_CAPACITY) [[likely]] {
+            // The key does not exist and the last slot has free space
+            insert(std::move(key), iter.slot, numEntries, value, fingerprint);
+            this->indexHeader.numEntries++;
+            return true;
+        }
+        // The last slot is full. Insert a new one
+        insertToNewOvfSlot(std::move(key), iter.slot, value, fingerprint);
+        this->indexHeader.numEntries++;
+        return true;
+    }
+    InMemSlotType* getSlot(const SlotInfo& slotInfo) const;
+
+    uint32_t allocatePSlots(uint32_t numSlotsToAllocate);
+    uint32_t allocateAOSlot();
+    /*
+     * When a slot is split, we add a new slot, which ends up with an
+     * id equal to the slot to split's ID + (1 << header.currentLevel).
+     * Values are then rehashed using a hash index which is one bit wider than before,
+     * meaning they either stay in the existing slot, or move into the new one.
+     */
+    void splitSlot();
+    // Reclaims empty overflow slots to be re-used, starting from the given slot iterator
+    void reclaimOverflowSlots(SlotIterator iter);
+    void addFreeOverflowSlot(InMemSlotType& overflowSlot, SlotInfo slotInfo);
+    uint64_t countSlots(SlotIterator iter) const;
+    // Make sure that the free overflow slot chain is at least as long as the totalSlotsRequired
+    void reserveOverflowSlots(uint64_t totalSlotsRequired);
+
+    bool equals(KeyType keyToLookup, const OwnedType& keyInEntry) const {
+        return keyToLookup == keyInEntry;
+    }
+
+    void insert(OwnedType&& key, InMemSlotType* slot, uint8_t entryPos, common::offset_t value,
+        uint8_t fingerprint) {
+        KU_ASSERT(HashIndexUtils::getFingerprintForHash(HashIndexUtils::hash(key)) == fingerprint);
+        auto& entry = slot->entries[entryPos];
+        entry = SlotEntry<OwnedType>(std::move(key), value);
+        slot->header.setEntryValid(entryPos, fingerprint);
+    }
+
+    void insertToNewOvfSlot(OwnedType&& key, InMemSlotType* previousSlot, common::offset_t offset,
+        uint8_t fingerprint) {
+        auto newSlotId = allocateAOSlot();
+        previousSlot->header.nextOvfSlotId = newSlotId;
+        auto newSlot = getSlot(SlotInfo{newSlotId, SlotType::OVF});
+        auto entryPos = 0u; // Always insert to the first entry when there is a new slot.
+        insert(std::move(key), newSlot, entryPos, offset, fingerprint);
+    }
+
+    common::hash_t hashStored(const OwnedType& key) const;
+    InMemSlotType* clearNextOverflowAndAdvanceIter(SlotIterator& iter);
+
+    // Finds the entry matching the given key. The iterator will be advanced and will either point
+    // to the slot containing the matching entry, or the last slot available
+    entry_pos_t findEntry(SlotIterator& iter, KeyType key, uint8_t fingerprint,
+        visible_func isVisible) {
+        do {
+            auto numEntries = iter.slot->header.numEntries();
+            KU_ASSERT(numEntries == std::countr_one(iter.slot->header.validityMask));
+            for (auto entryPos = 0u; entryPos < numEntries; entryPos++) {
+                if (iter.slot->header.fingerprints[entryPos] == fingerprint &&
+                    equals(key, iter.slot->entries[entryPos].key) &&
+                    isVisible(iter.slot->entries[entryPos].value)) [[unlikely]] {
+                    // Value already exists
+                    return entryPos;
+                }
+            }
+            if (numEntries < SLOT_CAPACITY) {
+                return SlotHeader::INVALID_ENTRY_POS;
+            }
+        } while (nextChainedSlot(iter));
+        return SlotHeader::INVALID_ENTRY_POS;
+    }
+
+private:
+    // TODO: might be more efficient to use a vector for each slot since this is now only needed
+    // in-memory and it would remove the need to handle overflow slots.
+    OverflowFileHandle* overflowFileHandle;
+    std::unique_ptr<BlockVector<InMemSlotType>> pSlots;
+    std::unique_ptr<BlockVector<InMemSlotType>> oSlots;
+    HashIndexHeader indexHeader;
+    MemoryManager& memoryManager;
+    uint64_t numFreeSlots;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/index.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/index.h
new file mode 100644
index 0000000000..f1fb5c46f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/index/index.h
@@ -0,0 +1,239 @@
+#pragma once
+
+#include <functional>
+
+#include "common/serializer/buffer_writer.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "in_mem_hash_index.h"
+#include <span>
+
+namespace lbug::storage {
+class StorageManager;
+}
+namespace lbug {
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace storage {
+
+enum class IndexConstraintType : uint8_t {
+    PRIMARY = 0,              // Primary key index
+    SECONDARY_NON_UNIQUE = 1, // Secondary index that is not unique
+};
+
+enum class IndexDefinitionType : uint8_t {
+    BUILTIN = 0,
+    EXTENSION = 1,
+};
+
+class Index;
+struct IndexInfo;
+using index_load_func_t = std::function<std::unique_ptr<Index>(main::ClientContext* context,
+    StorageManager* storageManager, IndexInfo, std::span<uint8_t>)>;
+
+struct LBUG_API IndexType {
+    std::string typeName;
+    IndexConstraintType constraintType;
+    IndexDefinitionType definitionType;
+    index_load_func_t loadFunc;
+
+    IndexType(std::string typeName, IndexConstraintType constraintType,
+        IndexDefinitionType definitionType, index_load_func_t loadFunc)
+        : typeName{std::move(typeName)}, constraintType{constraintType},
+          definitionType{definitionType}, loadFunc{std::move(loadFunc)} {}
+};
+
+struct LBUG_API IndexInfo {
+    std::string name;
+    std::string indexType;
+    common::table_id_t tableID;
+    std::vector<common::column_id_t> columnIDs;
+    std::vector<common::PhysicalTypeID> keyDataTypes;
+    bool isPrimary;
+    bool isBuiltin;
+
+    IndexInfo(std::string name, std::string indexType, common::table_id_t tableID,
+        std::vector<common::column_id_t> columnIDs,
+        std::vector<common::PhysicalTypeID> keyDataTypes, bool isPrimary, bool isBuiltin)
+        : name{std::move(name)}, indexType{std::move(indexType)}, tableID{tableID},
+          columnIDs{std::move(columnIDs)}, keyDataTypes{std::move(keyDataTypes)},
+          isPrimary{isPrimary}, isBuiltin{isBuiltin} {}
+
+    void serialize(common::Serializer& ser) const;
+    static IndexInfo deserialize(common::Deserializer& deSer);
+};
+
+struct LBUG_API IndexStorageInfo {
+    IndexStorageInfo() {}
+    virtual ~IndexStorageInfo();
+    DELETE_COPY_DEFAULT_MOVE(IndexStorageInfo);
+
+    virtual std::shared_ptr<common::BufferWriter> serialize() const;
+
+    template<typename TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+    template<typename TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+class LBUG_API Index {
+public:
+    struct InsertState {
+        virtual ~InsertState();
+        template<typename TARGET>
+        TARGET& cast() {
+            return common::ku_dynamic_cast<TARGET&>(*this);
+        }
+    };
+
+    struct DeleteState {
+        virtual ~DeleteState();
+        template<typename TARGET>
+        TARGET& cast() {
+            return common::ku_dynamic_cast<TARGET&>(*this);
+        }
+    };
+
+    struct UpdateState {
+        virtual ~UpdateState();
+        template<typename TARGET>
+        TARGET& cast() {
+            return common::ku_dynamic_cast<TARGET&>(*this);
+        }
+    };
+
+    Index(IndexInfo indexInfo, std::unique_ptr<IndexStorageInfo> storageInfo)
+        : indexInfo{std::move(indexInfo)}, storageInfo{std::move(storageInfo)},
+          storageInfoBuffer{nullptr}, storageInfoBufferSize{0}, loaded{true} {}
+    Index(IndexInfo indexInfo, std::unique_ptr<uint8_t[]> storageBuffer, uint32_t storageBufferSize)
+        : indexInfo{std::move(indexInfo)}, storageInfo{nullptr},
+          storageInfoBuffer{std::move(storageBuffer)}, storageInfoBufferSize{storageBufferSize},
+          loaded{false} {}
+    virtual ~Index();
+
+    DELETE_COPY_AND_MOVE(Index);
+
+    bool isPrimary() const { return indexInfo.isPrimary; }
+    bool isExtension() const { return indexInfo.isBuiltin; }
+    bool isLoaded() const { return loaded; }
+    std::string getName() const { return indexInfo.name; }
+    IndexInfo getIndexInfo() const { return indexInfo; }
+
+    virtual std::unique_ptr<InsertState> initInsertState(main::ClientContext* context,
+        visible_func isVisible) = 0;
+    virtual void insert(transaction::Transaction*, const common::ValueVector&,
+        const std::vector<common::ValueVector*>&, InsertState&) {
+        // DO NOTHING.
+    }
+    virtual std::unique_ptr<UpdateState> initUpdateState(main::ClientContext* /*context*/,
+        common::column_id_t /*columnID*/, visible_func /*isVisible*/) {
+        KU_UNREACHABLE;
+    }
+    virtual void update(transaction::Transaction* /*transaction*/,
+        const common::ValueVector& /*nodeIDVector*/, common::ValueVector& /*propertyVector*/,
+        UpdateState& /*updateState*/) {
+        KU_UNREACHABLE;
+    }
+    virtual std::unique_ptr<DeleteState> initDeleteState(
+        const transaction::Transaction* transaction, MemoryManager* mm, visible_func isVisible) = 0;
+    virtual void delete_(transaction::Transaction* transaction,
+        const common::ValueVector& nodeIDVector, DeleteState& deleteState) = 0;
+    virtual bool needCommitInsert() const { return false; }
+    virtual void commitInsert(transaction::Transaction*, const common::ValueVector&,
+        const std::vector<common::ValueVector*>&, InsertState&) {
+        // DO NOTHING.
+    }
+
+    virtual void checkpointInMemory() {
+        // DO NOTHING.
+    };
+    virtual void checkpoint(main::ClientContext*, PageAllocator&) {
+        // DO NOTHING.
+    }
+    virtual void rollbackCheckpoint() {
+        // DO NOTHING.
+    }
+    virtual void finalize(main::ClientContext*) {
+        // DO NOTHING.
+    }
+
+    std::span<uint8_t> getStorageBuffer() const {
+        KU_ASSERT(!loaded);
+        return std::span(storageInfoBuffer.get(), storageInfoBufferSize);
+    }
+    const IndexStorageInfo& getStorageInfo() const { return *storageInfo; }
+    bool isBuiltOnColumn(common::column_id_t columnID) const;
+
+    virtual void serialize(common::Serializer& ser) const;
+
+    template<typename TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+protected:
+    IndexInfo indexInfo;
+    std::unique_ptr<IndexStorageInfo> storageInfo;
+    std::unique_ptr<uint8_t[]> storageInfoBuffer;
+    uint64_t storageInfoBufferSize;
+    bool loaded;
+};
+
+class IndexHolder {
+public:
+    explicit IndexHolder(std::unique_ptr<Index> loadedIndex);
+    IndexHolder(IndexInfo indexInfo, std::unique_ptr<uint8_t[]> storageInfoBuffer,
+        uint32_t storageInfoBufferSize);
+
+    std::string getName() const { return indexInfo.name; }
+    bool isLoaded() const { return loaded; }
+
+    void serialize(common::Serializer& ser) const;
+    LBUG_API void load(main::ClientContext* context, StorageManager* storageManager);
+    bool needCommitInsert() const { return index->needCommitInsert(); }
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    void checkpoint(main::ClientContext* context, PageAllocator& pageAllocator) {
+        if (loaded) {
+            KU_ASSERT(index);
+            index->checkpoint(context, pageAllocator);
+        }
+    }
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    void rollbackCheckpoint() {
+        if (loaded) {
+            KU_ASSERT(index);
+            index->rollbackCheckpoint();
+        }
+    }
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    void finalize(main::ClientContext* context) {
+        if (loaded) {
+            KU_ASSERT(index);
+            index->finalize(context);
+        }
+    }
+
+    Index* getIndex() const {
+        KU_ASSERT(index);
+        return index.get();
+    }
+
+private:
+    IndexInfo indexInfo;
+    std::unique_ptr<uint8_t[]> storageInfoBuffer;
+    uint64_t storageInfoBufferSize;
+    bool loaded;
+
+    // Loaded index structure.
+    std::unique_ptr<Index> index;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_cached_column.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_cached_column.h
new file mode 100644
index 0000000000..fa273717dc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_cached_column.h
@@ -0,0 +1,22 @@
+#pragma once
+
+#include "storage/table/column_chunk_data.h"
+#include "transaction/transaction.h"
+
+namespace lbug {
+namespace storage {
+
+class LBUG_API CachedColumn : public transaction::LocalCacheObject {
+public:
+    static std::string getKey(common::table_id_t tableID, common::property_id_t propertyID) {
+        return common::stringFormat("{}-{}", tableID, propertyID);
+    }
+    explicit CachedColumn(common::table_id_t tableID, common::property_id_t propertyID)
+        : LocalCacheObject{getKey(tableID, propertyID)}, columnChunks{} {}
+    DELETE_BOTH_COPY(CachedColumn);
+
+    std::vector<std::unique_ptr<ColumnChunkData>> columnChunks;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_hash_index.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_hash_index.h
new file mode 100644
index 0000000000..cc216accf1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_hash_index.h
@@ -0,0 +1,234 @@
+#pragma once
+
+#include "common/string_utils.h"
+#include "common/type_utils.h"
+#include "storage/index/in_mem_hash_index.h"
+
+namespace lbug {
+namespace storage {
+
+// NOTE: This is a dummy base class to hide the templation from LocalHashIndex, while allows casting
+// to templated HashIndexLocalStorage. Same for OnDiskHashIndex.
+class BaseHashIndexLocalStorage {
+public:
+    virtual ~BaseHashIndexLocalStorage() = default;
+};
+
+enum class HashIndexLocalLookupState : uint8_t { KEY_FOUND, KEY_DELETED, KEY_NOT_EXIST };
+
+// Local storage consists of two in memory indexes. One (localInsertionIndex) is to keep track of
+// all newly inserted entries, and the other (localDeletionIndex) is to keep track of newly deleted
+// entries (not available in localInsertionIndex). We assume that in a transaction, the insertions
+// and deletions are very small, thus they can be kept in memory.
+template<typename T>
+class HashIndexLocalStorage final : public BaseHashIndexLocalStorage {
+public:
+    using OwnedType = InMemHashIndex<T>::OwnedType;
+    using KeyType = InMemHashIndex<T>::KeyType;
+
+    explicit HashIndexLocalStorage(MemoryManager& memoryManager, OverflowFileHandle* handle)
+        : localDeletions{}, localInsertions{memoryManager, handle} {}
+    HashIndexLocalLookupState lookup(KeyType key, common::offset_t& result,
+        visible_func isVisible) {
+        std::shared_lock sLock{mtx};
+        if (localDeletions.contains(key)) {
+            return HashIndexLocalLookupState::KEY_DELETED;
+        }
+        if (localInsertions.lookup(key, result, isVisible)) {
+            return HashIndexLocalLookupState::KEY_FOUND;
+        }
+        return HashIndexLocalLookupState::KEY_NOT_EXIST;
+    }
+
+    void deleteKey(KeyType key) {
+        std::unique_lock xLock{mtx};
+        if (!localInsertions.deleteKey(key)) {
+            localDeletions.insert(static_cast<OwnedType>(key));
+        }
+    }
+
+    bool discard(KeyType key) {
+        std::unique_lock xLock{mtx};
+        return localInsertions.deleteKey(key);
+    }
+
+    bool insert(OwnedType&& key, common::offset_t value, visible_func isVisible) {
+        std::unique_lock xLock{mtx};
+        auto iter = localDeletions.find(key);
+        if (iter != localDeletions.end()) {
+            localDeletions.erase(iter);
+        }
+        return localInsertions.append(std::move(key), value, isVisible);
+    }
+
+    void reserveSpaceForAppend(uint32_t numNewEntries) {
+        std::unique_lock xLock{mtx};
+        reserveSpaceForAppendNoLock(numNewEntries);
+    }
+
+    void reserveSpaceForAppendNoLock(uint32_t numNewEntries) {
+        localInsertions.reserveSpaceForAppend(numNewEntries);
+    }
+
+    bool append(OwnedType&& key, common::offset_t value, visible_func isVisible) {
+        std::unique_lock xLock{mtx};
+        return appendNoLock(std::move(key), value, isVisible);
+    }
+
+    bool appendNoLock(OwnedType&& key, common::offset_t value, visible_func isVisible) {
+        return localInsertions.append(std::move(key), value, isVisible);
+    }
+
+    size_t append(IndexBuffer<OwnedType>& buffer, uint64_t bufferOffset, visible_func isVisible) {
+        std::unique_lock xLock{mtx};
+        return appendNoLock(buffer, bufferOffset, isVisible);
+    }
+
+    size_t appendNoLock(IndexBuffer<OwnedType>& buffer, uint64_t bufferOffset,
+        visible_func isVisible) {
+        return localInsertions.append(buffer, bufferOffset, isVisible);
+    }
+
+    bool hasUpdates() {
+        std::shared_lock sLock{mtx};
+        return !(localInsertions.empty() && localDeletions.empty());
+    }
+
+    int64_t getNetInserts() {
+        std::shared_lock sLock{mtx};
+        return static_cast<int64_t>(localInsertions.size()) - localDeletions.size();
+    }
+
+    void clear() {
+        std::unique_lock xLock{mtx};
+        localInsertions.clear();
+        localDeletions.clear();
+    }
+
+    void applyLocalChanges(const std::function<void(KeyType)>& deleteOp,
+        const std::function<void(const InMemHashIndex<T>&)>& insertOp) {
+        std::shared_lock sLock{mtx};
+        for (auto& key : localDeletions) {
+            deleteOp(key);
+        }
+        insertOp(localInsertions);
+    }
+
+    void reserveInserts(uint64_t newEntries) {
+        std::unique_lock xLock{mtx};
+        localInsertions.reserve(newEntries);
+    }
+
+    bool tryLock() { return mtx.try_lock(); }
+    std::unique_lock<std::shared_mutex> adoptLock() {
+        return std::unique_lock{mtx, std::adopt_lock};
+    }
+
+private:
+    // When the storage type is string, allow the key type to be string_view with a custom hash
+    // function
+    using hash_function = std::conditional_t<std::is_same_v<OwnedType, std::string>,
+        common::StringUtils::string_hash, std::hash<T>>;
+    std::shared_mutex mtx;
+    std::unordered_set<OwnedType, hash_function, std::equal_to<>> localDeletions;
+    InMemHashIndex<T> localInsertions;
+};
+
+class LocalHashIndex {
+public:
+    explicit LocalHashIndex(MemoryManager& memoryManager, common::PhysicalTypeID keyDataTypeID,
+        OverflowFileHandle* overflowFileHandle)
+        : keyDataTypeID{keyDataTypeID} {
+        common::TypeUtils::visit(
+            keyDataTypeID,
+            [&](common::ku_string_t) {
+                localIndex = std::make_unique<HashIndexLocalStorage<common::ku_string_t>>(
+                    memoryManager, overflowFileHandle);
+            },
+            [&]<common::HashablePrimitive T>(T) {
+                localIndex = std::make_unique<HashIndexLocalStorage<T>>(memoryManager, nullptr);
+            },
+            [&](auto) { KU_UNREACHABLE; });
+    }
+
+    common::offset_t lookup(const common::ValueVector& keyVector, common::sel_t pos,
+        visible_func isVisible) {
+        common::offset_t result = common::INVALID_OFFSET;
+        common::TypeUtils::visit(
+            keyDataTypeID,
+            [&]<common::IndexHashable T>(
+                T) { result = lookup(keyVector.getValue<T>(pos), isVisible); },
+            [](auto) { KU_UNREACHABLE; });
+        return result;
+    }
+
+    common::offset_t lookup(const common::ValueVector& keyVector, visible_func isVisible) {
+        KU_ASSERT(keyVector.state->getSelVector().getSelSize() == 1);
+        auto pos = keyVector.state->getSelVector().getSelectedPositions()[0];
+        return lookup(keyVector, pos, isVisible);
+    }
+
+    common::offset_t lookup(const common::ku_string_t key, visible_func isVisible) {
+        return lookup(key.getAsStringView(), isVisible);
+    }
+    template<common::IndexHashable T>
+    common::offset_t lookup(T key, visible_func isVisible) {
+        common::offset_t result = common::INVALID_OFFSET;
+        common::ku_dynamic_cast<HashIndexLocalStorage<HashIndexType<T>>*>(localIndex.get())
+            ->lookup(key, result, isVisible);
+        return result;
+    }
+
+    bool insert(const common::ValueVector& keyVector, common::offset_t startNodeOffset,
+        visible_func isVisible) {
+        common::length_t numInserted = 0;
+        common::TypeUtils::visit(
+            keyDataTypeID,
+            [&]<common::IndexHashable T>(T) {
+                for (auto i = 0u; i < keyVector.state->getSelVector().getSelSize(); i++) {
+                    const auto pos = keyVector.state->getSelVector().getSelectedPositions()[i];
+                    numInserted +=
+                        insert(keyVector.getValue<T>(pos), startNodeOffset + i, isVisible);
+                }
+            },
+            [](auto) { KU_UNREACHABLE; });
+        return numInserted == keyVector.state->getSelVector().getSelSize();
+    }
+
+    bool insert(const common::ku_string_t key, common::offset_t value, visible_func isVisible) {
+        return insert(key.getAsString(), value, isVisible);
+    }
+    template<common::IndexHashable T>
+    bool insert(T key, common::offset_t value, visible_func isVisible) {
+        KU_ASSERT(keyDataTypeID == common::TypeUtils::getPhysicalTypeIDForType<T>());
+        return common::ku_dynamic_cast<HashIndexLocalStorage<HashIndexType<T>>*>(localIndex.get())
+            ->insert(std::move(key), value, isVisible);
+    }
+
+    void delete_(const common::ValueVector& keyVector) {
+        common::TypeUtils::visit(
+            keyDataTypeID,
+            [&]<common::IndexHashable T>(T) {
+                for (auto i = 0u; i < keyVector.state->getSelVector().getSelSize(); i++) {
+                    const auto pos = keyVector.state->getSelVector().getSelectedPositions()[i];
+                    delete_(keyVector.getValue<T>(pos));
+                }
+            },
+            [](auto) { KU_UNREACHABLE; });
+    }
+
+    void delete_(const common::ku_string_t key) { delete_(key.getAsStringView()); }
+    template<common::IndexHashable T>
+    void delete_(T key) {
+        KU_ASSERT(keyDataTypeID == common::TypeUtils::getPhysicalTypeIDForType<T>());
+        common::ku_dynamic_cast<HashIndexLocalStorage<HashIndexType<T>>*>(localIndex.get())
+            ->deleteKey(key);
+    }
+
+private:
+    common::PhysicalTypeID keyDataTypeID;
+    std::unique_ptr<BaseHashIndexLocalStorage> localIndex;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_node_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_node_table.h
new file mode 100644
index 0000000000..5767cd6fb0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_node_table.h
@@ -0,0 +1,63 @@
+#pragma once
+
+#include "common/copy_constructors.h"
+#include "storage/local_storage/local_hash_index.h"
+#include "storage/local_storage/local_table.h"
+#include "storage/table/node_group_collection.h"
+
+namespace lbug {
+namespace storage {
+
+struct TableScanState;
+class MemoryManager;
+
+class LocalNodeTable final : public LocalTable {
+public:
+    LocalNodeTable(const catalog::TableCatalogEntry* tableEntry, Table& table, MemoryManager& mm);
+    DELETE_COPY_AND_MOVE(LocalNodeTable);
+
+    bool insert(transaction::Transaction* transaction, TableInsertState& insertState) override;
+    bool update(transaction::Transaction* transaction, TableUpdateState& updateState) override;
+    bool delete_(transaction::Transaction* transaction, TableDeleteState& deleteState) override;
+    bool addColumn(TableAddColumnState& addColumnState) override;
+
+    common::offset_t validateUniquenessConstraint(const transaction::Transaction* transaction,
+        const common::ValueVector& pkVector) const;
+
+    common::TableType getTableType() const override { return common::TableType::NODE; }
+
+    void clear(MemoryManager& mm) override;
+
+    common::row_idx_t getNumTotalRows() override { return nodeGroups.getNumTotalRows(); }
+    common::node_group_idx_t getNumNodeGroups() const { return nodeGroups.getNumNodeGroups(); }
+
+    NodeGroup* getNodeGroup(common::node_group_idx_t nodeGroupIdx) const {
+        return nodeGroups.getNodeGroup(nodeGroupIdx);
+    }
+    NodeGroupCollection& getNodeGroups() { return nodeGroups; }
+
+    bool lookupPK(const transaction::Transaction* transaction, const common::ValueVector* keyVector,
+        common::sel_t pos, common::offset_t& result) const;
+
+    TableStats getStats() const { return nodeGroups.getStats(); }
+    common::offset_t getStartOffset() const { return startOffset; }
+
+    static std::vector<common::LogicalType> getNodeTableColumnTypes(
+        const catalog::TableCatalogEntry& table);
+
+private:
+    void initLocalHashIndex(MemoryManager& mm);
+    bool isVisible(const transaction::Transaction* transaction, common::offset_t offset) const;
+
+private:
+    // This is equivalent to the num of committed nodes in the table.
+    common::offset_t startOffset;
+    PageCursor overflowCursor;
+    std::unique_ptr<OverflowFile> overflowFile;
+    OverflowFileHandle* overflowFileHandle;
+    std::unique_ptr<LocalHashIndex> hashIndex;
+    NodeGroupCollection nodeGroups;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_rel_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_rel_table.h
new file mode 100644
index 0000000000..e4bd066c3e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_rel_table.h
@@ -0,0 +1,97 @@
+#pragma once
+
+#include <map>
+
+#include "common/enums/rel_direction.h"
+#include "storage/local_storage/local_table.h"
+#include "storage/table/csr_node_group.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+
+static constexpr common::column_id_t LOCAL_BOUND_NODE_ID_COLUMN_ID = 0;
+static constexpr common::column_id_t LOCAL_NBR_NODE_ID_COLUMN_ID = 1;
+static constexpr common::column_id_t LOCAL_REL_ID_COLUMN_ID = 2;
+
+class RelTable;
+struct TableScanState;
+struct RelTableUpdateState;
+
+struct DirectedCSRIndex {
+    using index_t = std::map<common::offset_t, row_idx_vec_t>;
+
+    explicit DirectedCSRIndex(common::RelDataDirection direction) : direction(direction) {}
+
+    bool isEmpty() const { return index.empty(); }
+    void clear() { index.clear(); }
+
+    common::RelDataDirection direction;
+    index_t index;
+};
+
+class LocalRelTable final : public LocalTable {
+public:
+    LocalRelTable(const catalog::TableCatalogEntry* tableEntry, const Table& table,
+        MemoryManager& mm);
+    DELETE_COPY_AND_MOVE(LocalRelTable);
+
+    bool insert(transaction::Transaction* transaction, TableInsertState& state) override;
+    bool update(transaction::Transaction* transaction, TableUpdateState& state) override;
+    bool delete_(transaction::Transaction* transaction, TableDeleteState& state) override;
+    bool addColumn(TableAddColumnState& addColumnState) override;
+
+    bool checkIfNodeHasRels(common::ValueVector* srcNodeIDVector,
+        common::RelDataDirection direction) const;
+
+    common::TableType getTableType() const override { return common::TableType::REL; }
+
+    static void initializeScan(TableScanState& state);
+    bool scan(const transaction::Transaction* transaction, TableScanState& state) const;
+
+    void clear(MemoryManager&) override {
+        localNodeGroup.reset();
+        for (auto& index : directedIndices) {
+            index.clear();
+        }
+    }
+    bool isEmpty() const {
+        KU_ASSERT(directedIndices.size() >= 1);
+        RUNTIME_CHECK(for (const auto& index
+                           : directedIndices) {
+            KU_ASSERT(index.index.empty() == directedIndices[0].index.empty());
+        });
+        return directedIndices[0].isEmpty();
+    }
+
+    common::column_id_t getNumColumns() const { return localNodeGroup->getDataTypes().size(); }
+    common::row_idx_t getNumTotalRows() override { return localNodeGroup->getNumRows(); }
+
+    DirectedCSRIndex::index_t& getCSRIndex(common::RelDataDirection direction) {
+        const auto directionIdx = common::RelDirectionUtils::relDirectionToKeyIdx(direction);
+        KU_ASSERT(directionIdx < directedIndices.size());
+        return directedIndices[directionIdx].index;
+    }
+    NodeGroup& getLocalNodeGroup() const { return *localNodeGroup; }
+
+    static std::vector<common::column_id_t> rewriteLocalColumnIDs(
+        common::RelDataDirection direction, const std::vector<common::column_id_t>& columnIDs);
+    static common::column_id_t rewriteLocalColumnID(common::RelDataDirection direction,
+        common::column_id_t columnID);
+
+private:
+    common::row_idx_t findMatchingRow(const transaction::Transaction* transaction,
+        const std::vector<row_idx_vec_t*>& rowIndicesToCheck, common::offset_t relOffset) const;
+
+private:
+    // We don't duplicate local rel tuples. Tuples are stored same as node tuples.
+    // Chunks stored in local rel table are organized as follows:
+    // [srcNodeID, dstNodeID, relID, property1, property2, ...]
+    // All local rel tuples are stored in a single node group, and they are indexed by src/dst
+    // NodeID.
+    std::vector<DirectedCSRIndex> directedIndices;
+    std::unique_ptr<NodeGroup> localNodeGroup;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_storage.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_storage.h
new file mode 100644
index 0000000000..fcd6f2b429
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_storage.h
@@ -0,0 +1,43 @@
+#pragma once
+
+#include <unordered_map>
+
+#include "common/copy_constructors.h"
+#include "storage/local_storage/local_table.h"
+#include "storage/optimistic_allocator.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+} // namespace main
+namespace storage {
+// Data structures in LocalStorage are not thread-safe.
+// For now, we only support single thread insertions and updates. Once we optimize them with
+// multiple threads, LocalStorage and its related data structures should be reworked to be
+// thread-safe.
+class LocalStorage {
+public:
+    explicit LocalStorage(main::ClientContext& clientContext) : clientContext{clientContext} {}
+    DELETE_COPY_AND_MOVE(LocalStorage);
+
+    // Do nothing if the table already exists, otherwise create a new local table.
+    LocalTable* getOrCreateLocalTable(Table& table);
+    // Return nullptr if no local table exists.
+    LocalTable* getLocalTable(common::table_id_t tableID) const;
+
+    PageAllocator* addOptimisticAllocator();
+
+    void commit();
+    void rollback();
+
+private:
+    main::ClientContext& clientContext;
+    std::unordered_map<common::table_id_t, std::unique_ptr<LocalTable>> tables;
+
+    // The mutex is only needed when working with the optimistic allocators
+    std::mutex mtx;
+    std::vector<std::unique_ptr<OptimisticAllocator>> optimisticAllocators;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_table.h
new file mode 100644
index 0000000000..28b3252293
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/local_storage/local_table.h
@@ -0,0 +1,57 @@
+#pragma once
+
+#include "common/enums/table_type.h"
+#include "storage/table/table.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace storage {
+class MemoryManager;
+
+struct TableAddColumnState;
+struct TableInsertState;
+struct TableUpdateState;
+struct TableDeleteState;
+class LocalTable {
+public:
+    virtual ~LocalTable() = default;
+
+    virtual bool insert(transaction::Transaction* transaction, TableInsertState& insertState) = 0;
+    virtual bool update(transaction::Transaction* transaction, TableUpdateState& updateState) = 0;
+    virtual bool delete_(transaction::Transaction* transaction, TableDeleteState& deleteState) = 0;
+    virtual bool addColumn(TableAddColumnState& addColumnState) = 0;
+    virtual void clear(MemoryManager& mm) = 0;
+    virtual common::TableType getTableType() const = 0;
+    virtual common::row_idx_t getNumTotalRows() = 0;
+
+    template<class TARGET>
+    const TARGET& constCast() {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+    template<class TARGET>
+    const TARGET* ptrCast() const {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+protected:
+    // TODO(Guodong): Revisit this interface. We don't need to pass in Table here, instead should
+    // pass in a struct that describes Table, e.g., TableInfo.
+    explicit LocalTable(const Table& table) : table{table} {}
+
+protected:
+    const Table& table;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/optimistic_allocator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/optimistic_allocator.h
new file mode 100644
index 0000000000..6b56097a83
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/optimistic_allocator.h
@@ -0,0 +1,31 @@
+#pragma once
+
+#include "storage/page_allocator.h"
+
+namespace lbug {
+namespace storage {
+
+class PageManager;
+
+/**
+ * Manages any optimistically allocated pages (e.g. during COPY) so that they can be freed if a
+ * rollback occurs.
+ * This class is designed to be thread-local so accesses are not guaranteed to be thread-safe.
+ */
+class OptimisticAllocator : public PageAllocator {
+public:
+    explicit OptimisticAllocator(PageManager& pageManager);
+
+    PageRange allocatePageRange(common::page_idx_t numPages) override;
+
+    void freePageRange(PageRange block) override;
+
+    void rollback();
+    void commit();
+
+private:
+    PageManager& pageManager;
+    std::vector<PageRange> optimisticallyAllocatedPages;
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/overflow_file.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/overflow_file.h
new file mode 100644
index 0000000000..5b1841eaa3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/overflow_file.h
@@ -0,0 +1,156 @@
+#pragma once
+
+#include <functional>
+#include <memory>
+#include <string_view>
+#include <vector>
+
+#include "common/types/types.h"
+#include "storage//file_handle.h"
+#include "storage/index/hash_index_utils.h"
+#include "storage/storage_utils.h"
+
+namespace lbug {
+namespace storage {
+
+class OverflowFile;
+
+// Stores the current state of the overflow file
+// The cursors in use are stored here so that we can write new pages directly
+// to the overflow file, and in the case of an interruption and rollback the header will
+// still record the correct place in the file to allocate new pages
+//
+// The first page managed by each handle is also stored for cases where we wish to iterate through
+// all the managed pages (e.g. when reclaiming pages)
+struct StringOverflowFileHeader {
+    struct Entry {
+        common::page_idx_t startPageIdx{common::INVALID_PAGE_IDX};
+        PageCursor cursor;
+    } entries[NUM_HASH_INDEXES];
+
+    // pages starts at one to reserve space for this header
+    StringOverflowFileHeader() : entries{} {}
+};
+static_assert(std::has_unique_object_representations_v<StringOverflowFileHeader>);
+
+class OverflowFileHandle {
+
+public:
+    OverflowFileHandle(OverflowFile& overflowFile, StringOverflowFileHeader::Entry& entry)
+        : startPageIdx(entry.startPageIdx), nextPosToWriteTo(entry.cursor),
+          overflowFile{overflowFile} {}
+    // The OverflowFile stores the handles and returns pointers to them.
+    // Moving the handle would invalidate those pointers
+    OverflowFileHandle(OverflowFileHandle&& other) = delete;
+
+    std::string readString(transaction::TransactionType trxType,
+        const common::ku_string_t& str) const;
+
+    bool equals(transaction::TransactionType trxType, std::string_view keyToLookup,
+        const common::ku_string_t& keyInEntry) const;
+
+    common::ku_string_t writeString(PageAllocator* pageAllocator, std::string_view rawString);
+    common::ku_string_t writeString(PageAllocator* pageAllocator, const char* rawString) {
+        return writeString(pageAllocator, std::string_view(rawString));
+    }
+
+    void checkpoint();
+    void checkpointInMemory() { pageWriteCache.clear(); }
+    void rollbackInMemory(PageCursor nextPosToWriteTo_) {
+        pageWriteCache.clear();
+        this->nextPosToWriteTo = nextPosToWriteTo_;
+    }
+    void reclaimStorage(PageAllocator& pageAllocator);
+
+private:
+    uint8_t* addANewPage(PageAllocator* pageAllocator);
+    void setStringOverflow(PageAllocator* pageAllocator, const char* inMemSrcStr, uint64_t len,
+        common::ku_string_t& diskDstString);
+
+    void read(transaction::TransactionType trxType, common::page_idx_t pageIdx,
+        const std::function<void(uint8_t*)>& func) const;
+
+private:
+    static constexpr common::page_idx_t END_OF_PAGE =
+        common::LBUG_PAGE_SIZE - sizeof(common::page_idx_t);
+    // Index of the first page managed by this handle
+    common::page_idx_t& startPageIdx;
+    // This is the index of the last free byte to which we can write.
+    PageCursor& nextPosToWriteTo;
+    OverflowFile& overflowFile;
+
+    struct CachedPage {
+        std::unique_ptr<MemoryBuffer> buffer;
+        bool newPage = false;
+    };
+
+    // Cached pages which have been written in the current transaction
+    std::unordered_map<common::page_idx_t, CachedPage> pageWriteCache;
+};
+
+class ShadowFile;
+class OverflowFile {
+    friend class OverflowFileHandle;
+
+public:
+    // For reading an existing overflow file
+    OverflowFile(FileHandle* fileHandle, MemoryManager& memoryManager, ShadowFile* shadowFile,
+        common::page_idx_t headerPageIdx);
+
+    virtual ~OverflowFile() = default;
+
+    // Handles contain a reference to the overflow file
+    OverflowFile(OverflowFile&& other) = delete;
+
+    void rollbackInMemory();
+    void checkpoint(PageAllocator& pageAllocator);
+    void checkpointInMemory();
+
+    void reclaimStorage(PageAllocator& pageAllocator) const;
+
+    common::page_idx_t getHeaderPageIdx() const { return headerPageIdx; }
+
+    OverflowFileHandle* addHandle() {
+        KU_ASSERT(handles.size() < NUM_HASH_INDEXES);
+        handles.emplace_back(
+            std::make_unique<OverflowFileHandle>(*this, header.entries[handles.size()]));
+        return handles.back().get();
+    }
+
+    FileHandle* getFileHandle() const {
+        KU_ASSERT(fileHandle);
+        return fileHandle;
+    }
+
+protected:
+    explicit OverflowFile(MemoryManager& memoryManager);
+
+    common::page_idx_t getNewPageIdx(PageAllocator* pageAllocator);
+
+private:
+    void readFromDisk(transaction::TransactionType trxType, common::page_idx_t pageIdx,
+        const std::function<void(uint8_t*)>& func) const;
+
+    // Writes new pages directly to the file and existing pages to the WAL
+    void writePageToDisk(common::page_idx_t pageIdx, uint8_t* data, bool newPage) const;
+
+protected:
+    static constexpr uint64_t HEADER_PAGE_IDX = 0;
+
+    std::vector<std::unique_ptr<OverflowFileHandle>> handles;
+    StringOverflowFileHeader header;
+    FileHandle* fileHandle;
+    ShadowFile* shadowFile;
+    MemoryManager& memoryManager;
+    std::atomic<common::page_idx_t> pageCounter;
+    std::atomic<bool> headerChanged;
+    common::page_idx_t headerPageIdx;
+};
+
+class InMemOverflowFile final : public OverflowFile {
+public:
+    explicit InMemOverflowFile(MemoryManager& memoryManager) : OverflowFile{memoryManager} {}
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/page_allocator.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/page_allocator.h
new file mode 100644
index 0000000000..f4f748f6cd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/page_allocator.h
@@ -0,0 +1,28 @@
+#pragma once
+
+#include "storage/page_range.h"
+
+namespace lbug {
+namespace storage {
+
+class FileHandle;
+
+class PageAllocator {
+public:
+    explicit PageAllocator(FileHandle* fileHandle) : dataFH(fileHandle) {}
+    virtual ~PageAllocator() = default;
+
+    virtual PageRange allocatePageRange(common::page_idx_t numPages) = 0;
+    common::page_idx_t allocatePage() { return allocatePageRange(1).startPageIdx; }
+
+    // Only used during checkpoint
+    virtual void freePageRange(PageRange block) = 0;
+    void freePage(common::page_idx_t pageIdx) { freePageRange(PageRange(pageIdx, 1)); }
+
+    FileHandle* getDataFH() const { return dataFH; }
+
+private:
+    FileHandle* dataFH;
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/page_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/page_manager.h
new file mode 100644
index 0000000000..76edd3c109
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/page_manager.h
@@ -0,0 +1,60 @@
+#pragma once
+
+#include <mutex>
+
+#include "common/types/types.h"
+#include "storage/free_space_manager.h"
+#include "storage/page_allocator.h"
+#include "storage/page_range.h"
+
+namespace lbug {
+namespace transaction {
+enum class TransactionType : uint8_t;
+}
+namespace storage {
+struct PageCursor;
+struct DBFileID;
+class PageManager;
+class FileHandle;
+
+class PageManager : public PageAllocator {
+public:
+    explicit PageManager(FileHandle* fileHandle)
+        : PageAllocator(fileHandle), freeSpaceManager(std::make_unique<FreeSpaceManager>()),
+          fileHandle(fileHandle), version(0) {}
+
+    uint64_t getVersion() const { return version; }
+    bool changedSinceLastCheckpoint() const { return version != 0; }
+    void resetVersion() { version = 0; }
+
+    PageRange allocatePageRange(common::page_idx_t numPages) override;
+    void freePageRange(PageRange block) override;
+    void freeImmediatelyRewritablePageRange(FileHandle* fileHandle, PageRange block);
+
+    // The page manager must first allocate space for itself so that its serialized version also
+    // tracks the pages allocated itself
+    // Thus this function also allocates and returns the space for the serialized storage maanger
+    common::page_idx_t estimatePagesNeededForSerialize();
+    void serialize(common::Serializer& serializer);
+    void deserialize(common::Deserializer& deSer);
+    void finalizeCheckpoint();
+    void rollbackCheckpoint() { freeSpaceManager->rollbackCheckpoint(); }
+
+    common::row_idx_t getNumFreeEntries() const { return freeSpaceManager->getNumEntries(); }
+    std::vector<PageRange> getFreeEntries(common::row_idx_t startOffset,
+        common::row_idx_t endOffset) const {
+        return freeSpaceManager->getEntries(startOffset, endOffset);
+    }
+
+    void clearEvictedBMEntriesIfNeeded(BufferManager* bufferManager);
+
+    static PageManager* Get(const main::ClientContext& context);
+
+private:
+    std::unique_ptr<FreeSpaceManager> freeSpaceManager;
+    std::mutex mtx;
+    FileHandle* fileHandle;
+    uint64_t version;
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/page_range.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/page_range.h
new file mode 100644
index 0000000000..45e54961c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/page_range.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include "common/types/types.h"
+
+namespace lbug::storage {
+
+struct PageRange {
+    PageRange() : startPageIdx(common::INVALID_PAGE_IDX), numPages(0){};
+    PageRange(common::page_idx_t startPageIdx, common::page_idx_t numPages)
+        : startPageIdx(startPageIdx), numPages(numPages) {}
+
+    PageRange subrange(common::page_idx_t newStartPage) const {
+        KU_ASSERT(newStartPage <= numPages);
+        return {startPageIdx + newStartPage, numPages - newStartPage};
+    }
+
+    common::page_idx_t startPageIdx;
+    common::page_idx_t numPages;
+};
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/predicate/column_predicate.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/predicate/column_predicate.h
new file mode 100644
index 0000000000..5692e76428
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/predicate/column_predicate.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include "binder/expression/expression.h"
+#include "common/cast.h"
+#include "common/enums/zone_map_check_result.h"
+
+namespace lbug {
+namespace storage {
+
+struct MergedColumnChunkStats;
+
+class ColumnPredicate;
+class LBUG_API ColumnPredicateSet {
+public:
+    ColumnPredicateSet() = default;
+    EXPLICIT_COPY_DEFAULT_MOVE(ColumnPredicateSet);
+
+    void addPredicate(std::unique_ptr<ColumnPredicate> predicate) {
+        predicates.push_back(std::move(predicate));
+    }
+    void tryAddPredicate(const binder::Expression& column, const binder::Expression& predicate);
+    bool isEmpty() const { return predicates.empty(); }
+
+    common::ZoneMapCheckResult checkZoneMap(const MergedColumnChunkStats& stats) const;
+
+    std::string toString() const;
+
+private:
+    ColumnPredicateSet(const ColumnPredicateSet& other)
+        : predicates{copyVector(other.predicates)} {}
+
+private:
+    std::vector<std::unique_ptr<ColumnPredicate>> predicates;
+};
+
+class LBUG_API ColumnPredicate {
+public:
+    ColumnPredicate(std::string columnName, common::ExpressionType expressionType)
+        : columnName{std::move(columnName)}, expressionType(expressionType) {}
+
+    virtual ~ColumnPredicate() = default;
+
+    virtual common::ZoneMapCheckResult checkZoneMap(const MergedColumnChunkStats& stats) const = 0;
+
+    virtual std::string toString();
+
+    virtual std::unique_ptr<ColumnPredicate> copy() const = 0;
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+protected:
+    std::string columnName;
+    common::ExpressionType expressionType;
+};
+
+struct LBUG_API ColumnPredicateUtil {
+    static std::unique_ptr<ColumnPredicate> tryConvert(const binder::Expression& column,
+        const binder::Expression& predicate);
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/predicate/constant_predicate.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/predicate/constant_predicate.h
new file mode 100644
index 0000000000..1fca555239
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/predicate/constant_predicate.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "column_predicate.h"
+#include "common/enums/expression_type.h"
+#include "common/types/value/value.h"
+
+namespace lbug {
+namespace storage {
+
+class ColumnConstantPredicate : public ColumnPredicate {
+public:
+    ColumnConstantPredicate(std::string columnName, common::ExpressionType expressionType,
+        common::Value value)
+        : ColumnPredicate{std::move(columnName), expressionType}, value{std::move(value)} {}
+
+    common::ZoneMapCheckResult checkZoneMap(const MergedColumnChunkStats& stats) const override;
+
+    std::string toString() override;
+
+    std::unique_ptr<ColumnPredicate> copy() const override {
+        return std::make_unique<ColumnConstantPredicate>(columnName, expressionType, value);
+    }
+
+private:
+    common::Value value;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/predicate/null_predicate.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/predicate/null_predicate.h
new file mode 100644
index 0000000000..bb1683011f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/predicate/null_predicate.h
@@ -0,0 +1,25 @@
+#pragma once
+
+#include "column_predicate.h"
+#include "common/enums/expression_type.h"
+
+namespace lbug {
+namespace storage {
+
+class ColumnNullPredicate : public ColumnPredicate {
+public:
+    explicit ColumnNullPredicate(std::string columnName, common::ExpressionType type)
+        : ColumnPredicate{std::move(columnName), type} {
+        KU_ASSERT(
+            type == common::ExpressionType::IS_NULL || type == common::ExpressionType::IS_NOT_NULL);
+    }
+
+    common::ZoneMapCheckResult checkZoneMap(const MergedColumnChunkStats& stats) const override;
+
+    std::unique_ptr<ColumnPredicate> copy() const override {
+        return std::make_unique<ColumnNullPredicate>(columnName, expressionType);
+    }
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/shadow_file.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/shadow_file.h
new file mode 100644
index 0000000000..ec6b692890
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/shadow_file.h
@@ -0,0 +1,72 @@
+#pragma once
+
+#include "common/types/uuid.h"
+#include "storage/file_handle.h"
+
+namespace lbug {
+namespace storage {
+
+struct ShadowPageRecord {
+    common::file_idx_t originalFileIdx = common::INVALID_PAGE_IDX;
+    common::page_idx_t originalPageIdx = common::INVALID_PAGE_IDX;
+
+    void serialize(common::Serializer& serializer) const;
+    static ShadowPageRecord deserialize(common::Deserializer& deserializer);
+};
+
+struct ShadowFileHeader {
+    common::ku_uuid_t databaseID{0};
+    common::page_idx_t numShadowPages = 0;
+};
+static_assert(std::is_trivially_copyable_v<ShadowFileHeader>);
+
+class BufferManager;
+// NOTE: This class is NOT thread-safe for now, as we are not checkpointing in parallel yet.
+class ShadowFile {
+public:
+    ShadowFile(BufferManager& bm, common::VirtualFileSystem* vfs, const std::string& databasePath);
+
+    // TODO(Guodong): Remove originalFile param.
+    bool hasShadowPage(common::file_idx_t originalFile, common::page_idx_t originalPage) const {
+        return shadowPagesMap.contains(originalFile) &&
+               shadowPagesMap.at(originalFile).contains(originalPage);
+    }
+    void clearShadowPage(common::file_idx_t originalFile, common::page_idx_t originalPage);
+    common::page_idx_t getShadowPage(common::file_idx_t originalFile,
+        common::page_idx_t originalPage) const;
+    common::page_idx_t getOrCreateShadowPage(common::file_idx_t originalFile,
+        common::page_idx_t originalPage);
+
+    FileHandle& getShadowingFH() const { return *shadowingFH; }
+
+    void applyShadowPages(main::ClientContext& context) const;
+
+    void flushAll(main::ClientContext& context) const;
+    // Clear any buffer in the WAL writer. Also truncate the WAL file to 0 bytes.
+    void clear(BufferManager& bm);
+    // Reset the WAL writer to nullptr, and remove the WAL file if it exists.
+    void reset();
+
+    // Replay shadow page records from the shadow file to the original data file. This is used
+    // during recovery.
+    static void replayShadowPageRecords(main::ClientContext& context);
+
+private:
+    FileHandle* getOrCreateShadowingFH();
+
+private:
+    BufferManager& bm;
+    std::string shadowFilePath;
+    common::VirtualFileSystem* vfs;
+    // This is the file handle for the shadow file. It is created lazily when the first shadow page
+    // is created.
+    FileHandle* shadowingFH;
+    // The map caches shadow page idxes for pages in original files.
+    std::unordered_map<common::file_idx_t,
+        std::unordered_map<common::page_idx_t, common::page_idx_t>>
+        shadowPagesMap;
+    std::vector<ShadowPageRecord> shadowPageRecords;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/shadow_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/shadow_utils.h
new file mode 100644
index 0000000000..749b732480
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/shadow_utils.h
@@ -0,0 +1,57 @@
+#pragma once
+
+#include <functional>
+
+#include "common/copy_constructors.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace transaction {
+enum class TransactionType : uint8_t;
+} // namespace transaction
+
+namespace storage {
+
+struct DBFileID;
+class FileHandle;
+class BufferManager;
+class ShadowFile;
+
+struct ShadowPageAndFrame {
+    ShadowPageAndFrame(common::page_idx_t originalPageIdx, common::page_idx_t pageIdxInShadow,
+        uint8_t* frame)
+        : originalPage{originalPageIdx}, shadowPage{pageIdxInShadow}, frame{frame} {}
+
+    DELETE_COPY_DEFAULT_MOVE(ShadowPageAndFrame);
+
+    common::page_idx_t originalPage;
+    common::page_idx_t shadowPage;
+    uint8_t* frame;
+};
+
+class ShadowUtils {
+public:
+    constexpr static common::page_idx_t NULL_PAGE_IDX = common::INVALID_PAGE_IDX;
+
+    // Where possible, updatePage/insertNewPage should be used instead
+    static ShadowPageAndFrame createShadowVersionIfNecessaryAndPinPage(
+        common::page_idx_t originalPage, bool skipReadingOriginalPage, FileHandle& fileHandle,
+        ShadowFile& shadowFile);
+
+    static std::pair<FileHandle*, common::page_idx_t> getFileHandleAndPhysicalPageIdxToPin(
+        FileHandle& fileHandle, common::page_idx_t pageIdx, const ShadowFile& shadowFile,
+        transaction::TransactionType trxType);
+
+    static void readShadowVersionOfPage(const FileHandle& fileHandle,
+        common::page_idx_t originalPageIdx, const ShadowFile& shadowFile,
+        const std::function<void(uint8_t*)>& readOp);
+
+    // Note: This function updates a page "transactionally", i.e., creates the WAL version of the
+    // page if it doesn't exist. For the original page to be updated, the current WRITE trx needs to
+    // commit and checkpoint.
+    static void updatePage(FileHandle& fileHandle, common::page_idx_t originalPageIdx,
+        bool skipReadingOriginalPage, ShadowFile& shadowFile,
+        const std::function<void(uint8_t*)>& updateOp);
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/stats/column_stats.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/stats/column_stats.h
new file mode 100644
index 0000000000..8df6da8c14
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/stats/column_stats.h
@@ -0,0 +1,62 @@
+#pragma once
+
+#include <optional>
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/vector/value_vector.h"
+#include "storage/stats/hyperloglog.h"
+
+namespace lbug {
+namespace storage {
+
+class ColumnStats {
+public:
+    ColumnStats() = default;
+    explicit ColumnStats(const common::LogicalType& dataType);
+    EXPLICIT_COPY_DEFAULT_MOVE(ColumnStats);
+
+    common::cardinality_t getNumDistinctValues() const { return hll ? hll->count() : 0; }
+
+    void update(const common::ValueVector* vector);
+
+    void merge(const ColumnStats& other) {
+        if (hll) {
+            KU_ASSERT(other.hll);
+            hll->merge(*other.hll);
+        };
+    }
+
+    void serialize(common::Serializer& serializer) const {
+        serializer.writeDebuggingInfo("has_hll");
+        serializer.serializeValue(hll.has_value());
+        if (hll) {
+            serializer.writeDebuggingInfo("hll");
+            hll->serialize(serializer);
+        }
+    }
+
+    static ColumnStats deserialize(common::Deserializer& deserializer) {
+        ColumnStats columnStats;
+        std::string info;
+        deserializer.validateDebuggingInfo(info, "has_hll");
+        bool hasHll = false;
+        deserializer.deserializeValue(hasHll);
+        if (hasHll) {
+            deserializer.validateDebuggingInfo(info, "hll");
+            columnStats.hll = HyperLogLog::deserialize(deserializer);
+        }
+        return columnStats;
+    }
+
+private:
+    ColumnStats(const ColumnStats& other) : hll{other.hll}, hashes{nullptr} {}
+
+private:
+    std::optional<HyperLogLog> hll;
+    // Preallocated vector for hash values.
+    std::unique_ptr<common::ValueVector> hashes;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/stats/hyperloglog.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/stats/hyperloglog.h
new file mode 100644
index 0000000000..624c91e33b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/stats/hyperloglog.h
@@ -0,0 +1,55 @@
+// This HyperLogLog implementation is taken from duckdb.
+// Source code:
+// https://github.com/duckdb/duckdb/blob/main/src/include/duckdb/common/types/hyperloglog.hpp
+
+#pragma once
+
+#include <array>
+
+#include "common/utils.h"
+
+namespace lbug {
+namespace storage {
+
+class HyperLogLog {
+public:
+    static constexpr common::cardinality_t P = 6;
+    static constexpr common::cardinality_t Q = 64 - P;
+    static constexpr common::cardinality_t M = 1 << P;
+    static constexpr double ALPHA = 0.721347520444481703680; // 1 / (2 log(2))
+
+public:
+    HyperLogLog() : k{} {} // NOLINT(*-pro-type-member-init)
+
+    //! Algorithm 1
+    void insertElement(common::hash_t h) {
+        const auto i = h & ((1 << P) - 1);
+        h >>= P;
+        h |= static_cast<common::hash_t>(1) << Q;
+        const uint8_t z = static_cast<uint8_t>(common::CountZeros<common::hash_t>::Trailing(h) + 1);
+        update(i, z);
+    }
+
+    void update(const common::idx_t& i, const uint8_t& z) { k[i] = std::max<uint8_t>(k[i], z); }
+
+    uint8_t getRegister(const common::idx_t& i) const { return k[i]; }
+
+    common::cardinality_t count() const;
+
+    //! Algorithm 2
+    void merge(const HyperLogLog& other);
+
+    void serialize(common::Serializer& serializer) const;
+    static HyperLogLog deserialize(common::Deserializer& deserializer);
+
+    //! Algorithm 4
+    void extractCounts(uint32_t* c) const;
+    //! Algorithm 6
+    static int64_t estimateCardinality(const uint32_t* c);
+
+private:
+    std::array<uint8_t, M> k;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/stats/table_stats.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/stats/table_stats.h
new file mode 100644
index 0000000000..50caad9fab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/stats/table_stats.h
@@ -0,0 +1,69 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "storage/stats/column_stats.h"
+
+namespace lbug::common {
+class LogicalType;
+}
+namespace lbug {
+namespace storage {
+
+class TableStats {
+public:
+    explicit TableStats(std::span<const common::LogicalType> dataTypes);
+
+    EXPLICIT_COPY_DEFAULT_MOVE(TableStats);
+
+    void incrementCardinality(common::cardinality_t increment) { cardinality += increment; }
+
+    void merge(const TableStats& other) {
+        std::vector<common::column_id_t> columnIDs;
+        for (auto i = 0u; i < columnStats.size(); i++) {
+            columnIDs.push_back(i);
+        }
+        merge(columnIDs, other);
+    }
+
+    void merge(const std::vector<common::column_id_t>& columnIDs, const TableStats& other) {
+        cardinality += other.cardinality;
+        KU_ASSERT(columnIDs.size() == other.columnStats.size());
+        for (auto i = 0u; i < columnIDs.size(); ++i) {
+            auto columnID = columnIDs[i];
+            KU_ASSERT(columnID < columnStats.size());
+            columnStats[columnID].merge(other.columnStats[i]);
+        }
+    }
+
+    common::cardinality_t getTableCard() const { return cardinality; }
+
+    common::cardinality_t getNumDistinctValues(common::column_id_t columnID) const {
+        KU_ASSERT(columnID < columnStats.size());
+        return columnStats[columnID].getNumDistinctValues();
+    }
+
+    void update(const std::vector<common::ValueVector*>& vectors,
+        size_t numColumns = std::numeric_limits<size_t>::max());
+    void update(const std::vector<common::column_id_t>& columnIDs,
+        const std::vector<common::ValueVector*>& vectors,
+        size_t numColumns = std::numeric_limits<size_t>::max());
+
+    ColumnStats& addNewColumn(const common::LogicalType& dataType) {
+        columnStats.emplace_back(dataType);
+        return columnStats.back();
+    }
+
+    void serialize(common::Serializer& serializer) const;
+    TableStats deserialize(common::Deserializer& deserializer);
+
+private:
+    TableStats(const TableStats& other);
+
+private:
+    // Note: cardinality is the estimated number of rows in the table. It is not always up-to-date.
+    common::cardinality_t cardinality;
+    std::vector<ColumnStats> columnStats;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_extension.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_extension.h
new file mode 100644
index 0000000000..63afc86679
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_extension.h
@@ -0,0 +1,33 @@
+#pragma once
+
+#include "main/attached_database.h"
+
+namespace lbug {
+namespace binder {
+struct AttachOption;
+}
+
+namespace storage {
+
+using attach_function_t = std::unique_ptr<main::AttachedDatabase> (*)(std::string dbPath,
+    std::string dbName, main::ClientContext* clientContext,
+    const binder::AttachOption& attachOption);
+
+class StorageExtension {
+public:
+    explicit StorageExtension(attach_function_t attachFunction) : attachFunction{attachFunction} {}
+    virtual bool canHandleDB(std::string /*dbType*/) const { return false; }
+
+    std::unique_ptr<main::AttachedDatabase> attach(std::string dbName, std::string dbPath,
+        main::ClientContext* clientContext, const binder::AttachOption& attachOption) const {
+        return attachFunction(std::move(dbName), std::move(dbPath), clientContext, attachOption);
+    }
+
+    virtual ~StorageExtension() = default;
+
+private:
+    attach_function_t attachFunction;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_manager.h
new file mode 100644
index 0000000000..fb68c657e0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_manager.h
@@ -0,0 +1,103 @@
+#pragma once
+
+#include <mutex>
+
+#include "catalog/catalog.h"
+#include "shadow_file.h"
+#include "storage/index/index.h"
+#include "storage/wal/wal.h"
+
+namespace lbug {
+namespace main {
+class Database;
+} // namespace main
+
+namespace catalog {
+class CatalogEntry;
+class NodeTableCatalogEntry;
+class RelGroupCatalogEntry;
+struct RelTableCatalogInfo;
+} // namespace catalog
+
+namespace storage {
+class Table;
+class NodeTable;
+class RelTable;
+class DiskArrayCollection;
+struct DatabaseHeader;
+
+class LBUG_API StorageManager {
+public:
+    StorageManager(const std::string& databasePath, bool readOnly, bool enableChecksums,
+        MemoryManager& memoryManager, bool enableCompression, common::VirtualFileSystem* vfs);
+    ~StorageManager();
+
+    Table* getTable(common::table_id_t tableID);
+
+    static void recover(main::ClientContext& clientContext, bool throwOnWalReplayFailure,
+        bool enableChecksums);
+
+    void createTable(catalog::TableCatalogEntry* entry);
+    void addRelTable(catalog::RelGroupCatalogEntry* entry,
+        const catalog::RelTableCatalogInfo& info);
+
+    bool checkpoint(main::ClientContext* context, PageAllocator& pageAllocator);
+    void finalizeCheckpoint();
+    void rollbackCheckpoint(const catalog::Catalog& catalog);
+
+    WAL& getWAL() const;
+    ShadowFile& getShadowFile() const;
+    FileHandle* getDataFH() const { return dataFH; }
+    std::string getDatabasePath() const { return databasePath; }
+    bool isReadOnly() const { return readOnly; }
+    bool compressionEnabled() const { return enableCompression; }
+    bool isInMemory() const { return inMemory; }
+
+    void registerIndexType(IndexType indexType) {
+        registeredIndexTypes.push_back(std::move(indexType));
+    }
+    std::optional<std::reference_wrapper<const IndexType>> getIndexType(
+        const std::string& typeName) const;
+
+    void serialize(const catalog::Catalog& catalog, common::Serializer& ser);
+    // We need to pass in the catalog and storageManager explicitly as they can be from
+    // attachedDatabase.
+    void deserialize(main::ClientContext* context, const catalog::Catalog* catalog,
+        common::Deserializer& deSer);
+
+    void initDataFileHandle(common::VirtualFileSystem* vfs, main::ClientContext* context);
+
+    // If the database header hasn't been created yet, calling these methods will create + return
+    // the header
+    common::ku_uuid_t getOrInitDatabaseID(const main::ClientContext& clientContext);
+    const storage::DatabaseHeader* getOrInitDatabaseHeader(
+        const main::ClientContext& clientContext);
+
+    void setDatabaseHeader(std::unique_ptr<storage::DatabaseHeader> header);
+
+    static StorageManager* Get(const main::ClientContext& context);
+
+private:
+    void createNodeTable(catalog::NodeTableCatalogEntry* entry);
+
+    void createRelTableGroup(catalog::RelGroupCatalogEntry* entry);
+
+    void reclaimDroppedTables(const catalog::Catalog& catalog);
+
+private:
+    std::mutex mtx;
+    std::string databasePath;
+    std::unique_ptr<storage::DatabaseHeader> databaseHeader;
+    bool readOnly;
+    FileHandle* dataFH;
+    std::unordered_map<common::table_id_t, std::unique_ptr<Table>> tables;
+    MemoryManager& memoryManager;
+    std::unique_ptr<WAL> wal;
+    std::unique_ptr<ShadowFile> shadowFile;
+    bool enableCompression;
+    bool inMemory;
+    std::vector<IndexType> registeredIndexTypes;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_utils.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_utils.h
new file mode 100644
index 0000000000..dee8b66e8f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_utils.h
@@ -0,0 +1,91 @@
+#pragma once
+
+#include <cmath>
+#include <string>
+#include <type_traits>
+
+#include "common/constants.h"
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include <concepts>
+
+namespace lbug {
+namespace storage {
+
+struct PageCursor {
+    PageCursor() : PageCursor{UINT32_MAX, UINT16_MAX} {};
+    PageCursor(common::page_idx_t pageIdx, uint32_t posInPage)
+        : pageIdx{pageIdx}, elemPosInPage{posInPage} {};
+
+    void nextPage() {
+        pageIdx++;
+        elemPosInPage = 0;
+    }
+
+    common::page_idx_t pageIdx;
+    // Larger than necessary, but PageCursor is directly written to disk
+    // and adding an explicit padding field messes with structured bindings
+    uint32_t elemPosInPage;
+};
+static_assert(std::has_unique_object_representations_v<PageCursor>);
+
+template<typename T>
+concept NumericType = std::is_integral_v<T> || std::floating_point<T>;
+
+class StorageUtils {
+public:
+    enum class ColumnType {
+        DEFAULT = 0,
+        INDEX = 1,  // This is used for index columns in STRING columns.
+        OFFSET = 2, // This is used for offset columns in LIST and STRING columns.
+        DATA = 3,   // This is used for data columns in LIST and STRING columns.
+        CSR_OFFSET = 4,
+        CSR_LENGTH = 5,
+        STRUCT_CHILD = 6,
+        NULL_MASK = 7,
+    };
+
+    template<NumericType T1, NumericType T2>
+    static uint64_t divideAndRoundUpTo(T1 v1, T2 v2) {
+        return std::ceil(static_cast<double>(v1) / static_cast<double>(v2));
+    }
+
+    static std::string getColumnName(const std::string& propertyName, ColumnType type,
+        const std::string& prefix);
+
+    static common::offset_t getStartOffsetOfNodeGroup(common::node_group_idx_t nodeGroupIdx) {
+        return nodeGroupIdx << common::StorageConfig::NODE_GROUP_SIZE_LOG2;
+    }
+    static common::node_group_idx_t getNodeGroupIdx(common::offset_t nodeOffset) {
+        return nodeOffset >> common::StorageConfig::NODE_GROUP_SIZE_LOG2;
+    }
+    static std::pair<common::node_group_idx_t, common::offset_t> getNodeGroupIdxAndOffsetInChunk(
+        common::offset_t nodeOffset) {
+        auto nodeGroupIdx = getNodeGroupIdx(nodeOffset);
+        auto offsetInChunk = nodeOffset - getStartOffsetOfNodeGroup(nodeGroupIdx);
+        return std::make_pair(nodeGroupIdx, offsetInChunk);
+    }
+
+    static std::string getWALFilePath(const std::string& path) {
+        return common::stringFormat("{}.{}", path, common::StorageConstants::WAL_FILE_SUFFIX);
+    }
+    static std::string getShadowFilePath(const std::string& path) {
+        return common::stringFormat("{}.{}", path, common::StorageConstants::SHADOWING_SUFFIX);
+    }
+    static std::string getTmpFilePath(const std::string& path) {
+        return common::stringFormat("{}.{}", path, common::StorageConstants::TEMP_FILE_SUFFIX);
+    }
+
+    static std::string expandPath(const main::ClientContext* context, const std::string& path);
+
+    // Note: This is a relatively slow function because of division and mod and making std::pair.
+    // It is not meant to be used in performance critical code path.
+    static std::pair<uint64_t, uint64_t> getQuotientRemainder(uint64_t i, uint64_t divisor) {
+        return std::make_pair(i / divisor, i % divisor);
+    }
+
+    static uint32_t getDataTypeSize(const common::LogicalType& type);
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_version_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_version_info.h
new file mode 100644
index 0000000000..5ba0601bb7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/storage_version_info.h
@@ -0,0 +1,31 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+#include <unordered_map>
+
+#include "common/api.h"
+
+namespace lbug {
+namespace storage {
+
+using storage_version_t = uint64_t;
+
+struct StorageVersionInfo {
+    static std::unordered_map<std::string, storage_version_t> getStorageVersionInfo() {
+        return {{"0.11.1", 39}, {"0.11.0", 39}, {"0.10.0", 38}, {"0.9.0", 37}, {"0.8.0", 36},
+            {"0.7.1.1", 35}, {"0.7.0", 34}, {"0.6.0.6", 33}, {"0.6.0.5", 32}, {"0.6.0.2", 31},
+            {"0.6.0.1", 31}, {"0.6.0", 28}, {"0.5.0", 28}, {"0.4.2", 27}, {"0.4.1", 27},
+            {"0.4.0", 27}, {"0.3.2", 26}, {"0.3.1", 26}, {"0.3.0", 26}, {"0.2.1", 25},
+            {"0.2.0", 25}, {"0.1.0", 24}, {"0.0.12.3", 24}, {"0.0.12.2", 24}, {"0.0.12.1", 24},
+            {"0.0.12", 23}, {"0.0.11", 23}, {"0.0.10", 23}, {"0.0.9", 23}, {"0.0.8", 17},
+            {"0.0.7", 15}, {"0.0.6", 9}, {"0.0.5", 8}, {"0.0.4", 7}, {"0.0.3", 1}};
+    }
+
+    static LBUG_API storage_version_t getStorageVersion();
+
+    static constexpr const char* MAGIC_BYTES = "LBUG";
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/chunked_node_group.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/chunked_node_group.h
new file mode 100644
index 0000000000..1e461c6f09
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/chunked_node_group.h
@@ -0,0 +1,260 @@
+#pragma once
+
+#include <atomic>
+#include <cstdint>
+#include <memory>
+#include <mutex>
+
+#include "common/enums/rel_multiplicity.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/buffer_manager/spill_result.h"
+#include "storage/enums/residency_state.h"
+#include "storage/table/column_chunk.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/version_info.h"
+
+namespace lbug {
+namespace common {
+class SelectionVector;
+} // namespace common
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace storage {
+class MemoryManager;
+
+class Column;
+struct TableScanState;
+struct TableAddColumnState;
+struct NodeGroupScanState;
+class ColumnStats;
+class FileHandle;
+class PageAllocator;
+
+enum class NodeGroupDataFormat : uint8_t { REGULAR = 0, CSR = 1 };
+
+class LBUG_API InMemChunkedNodeGroup {
+    friend class ChunkedNodeGroup;
+
+public:
+    virtual ~InMemChunkedNodeGroup() = default;
+    InMemChunkedNodeGroup(MemoryManager& mm, const std::vector<common::LogicalType>& columnTypes,
+        bool enableCompression, uint64_t capacity, common::row_idx_t startRowIdx);
+    InMemChunkedNodeGroup(std::vector<std::unique_ptr<ColumnChunkData>>&& chunks,
+        common::row_idx_t startRowIdx);
+    // Moves the specified columns out of base
+    InMemChunkedNodeGroup(InMemChunkedNodeGroup& base,
+        const std::vector<common::column_id_t>& selectedColumns);
+
+    // Also marks the chunks as in-use
+    // I.e. if you want to be able to spill to disk again you must call setUnused first
+    void loadFromDisk(const MemoryManager& mm);
+    // returns the amount of space reclaimed in bytes
+    SpillResult spillToDisk();
+    void setUnused(const MemoryManager& mm);
+
+    bool isFull() const { return numRows == capacity; }
+    common::idx_t getNumColumns() const { return chunks.size(); }
+    common::row_idx_t getStartRowIdx() const { return startRowIdx; }
+    common::row_idx_t getNumRows() const { return numRows; }
+    common::row_idx_t getCapacity() const { return capacity; }
+    void setNumRows(common::offset_t numRows_);
+
+    ColumnChunkData& getColumnChunk(const common::column_id_t columnID) {
+        KU_ASSERT(columnID < chunks.size());
+        return *chunks[columnID];
+    }
+
+    const ColumnChunkData& getColumnChunk(const common::column_id_t columnID) const {
+        KU_ASSERT(columnID < chunks.size());
+        return *chunks[columnID];
+    }
+
+    uint64_t append(const std::vector<common::ValueVector*>& columnVectors,
+        common::row_idx_t startRowInVectors, uint64_t numValuesToAppend);
+
+    // Appends up to numValuesToAppend from the other chunked node group, returning the actual
+    // number of values appended.
+    common::offset_t append(const InMemChunkedNodeGroup& other,
+        common::offset_t offsetInOtherNodeGroup, common::offset_t numRowsToAppend);
+
+    void resizeChunks(uint64_t newSize);
+    void resetToEmpty();
+    void resetToAllNull() const;
+
+    // Moves the specified columns out of base
+    void merge(InMemChunkedNodeGroup& base,
+        const std::vector<common::column_id_t>& columnsToMergeInto);
+
+    void write(const InMemChunkedNodeGroup& data, common::column_id_t offsetColumnID);
+    virtual void writeToColumnChunk(common::idx_t chunkIdx, common::idx_t vectorIdx,
+        const std::vector<std::unique_ptr<ColumnChunkData>>& data, ColumnChunkData& offsetChunk) {
+        chunks[chunkIdx]->write(data[vectorIdx].get(), &offsetChunk, common::RelMultiplicity::ONE);
+    }
+
+    std::unique_ptr<ColumnChunkData> moveColumnChunk(const common::column_id_t columnID) {
+        KU_ASSERT(columnID < chunks.size());
+        return std::move(chunks[columnID]);
+    }
+
+    virtual std::unique_ptr<ChunkedNodeGroup> flush(transaction::Transaction* transaction,
+        PageAllocator& pageAllocator);
+
+protected:
+    std::unique_ptr<ColumnChunk> flushInternal(ColumnChunkData& chunk,
+        PageAllocator& pageAllocator);
+
+protected:
+    common::row_idx_t startRowIdx;
+    std::atomic<common::row_idx_t> numRows;
+    uint64_t capacity;
+    std::vector<std::unique_ptr<ColumnChunkData>> chunks;
+    std::mutex spillToDiskMutex;
+    // Used to track if the group may be in use and to verify that spillToDisk is only called when
+    // it is safe to do so. If false, it is safe to spill the data to disk.
+    bool dataInUse;
+};
+
+// Collection of ColumnChunks for each column in a particular Node Group
+class ChunkedNodeGroup {
+    friend class InMemChunkedNodeGroup;
+
+public:
+    ChunkedNodeGroup(std::vector<std::unique_ptr<ColumnChunk>> chunks,
+        common::row_idx_t startRowIdx, NodeGroupDataFormat format = NodeGroupDataFormat::REGULAR);
+    // Moves the specified columns out of base
+    ChunkedNodeGroup(InMemChunkedNodeGroup& base,
+        const std::vector<common::column_id_t>& selectedColumns,
+        NodeGroupDataFormat format = NodeGroupDataFormat::REGULAR);
+    ChunkedNodeGroup(ChunkedNodeGroup& base,
+        const std::vector<common::column_id_t>& selectedColumns);
+    ChunkedNodeGroup(MemoryManager& mm, ChunkedNodeGroup& base,
+        std::span<const common::LogicalType> columnTypes,
+        std::span<const common::column_id_t> baseColumnIDs);
+    ChunkedNodeGroup(MemoryManager& mm, const std::vector<common::LogicalType>& columnTypes,
+        bool enableCompression, uint64_t capacity, common::row_idx_t startRowIdx,
+        ResidencyState residencyState, NodeGroupDataFormat format = NodeGroupDataFormat::REGULAR);
+    virtual ~ChunkedNodeGroup() = default;
+
+    common::idx_t getNumColumns() const { return chunks.size(); }
+    common::row_idx_t getStartRowIdx() const { return startRowIdx; }
+    common::row_idx_t getNumRows() const { return numRows; }
+    const ColumnChunk& getColumnChunk(const common::column_id_t columnID) const {
+        KU_ASSERT(columnID < chunks.size());
+        return *chunks[columnID];
+    }
+    ColumnChunk& getColumnChunk(const common::column_id_t columnID) {
+        KU_ASSERT(columnID < chunks.size());
+        return *chunks[columnID];
+    }
+    std::unique_ptr<ColumnChunk> moveColumnChunk(const common::column_id_t columnID) {
+        KU_ASSERT(columnID < chunks.size());
+        return std::move(chunks[columnID]);
+    }
+    bool isFullOrOnDisk() const {
+        return numRows == capacity || residencyState == ResidencyState::ON_DISK;
+    }
+    ResidencyState getResidencyState() const { return residencyState; }
+    NodeGroupDataFormat getFormat() const { return format; }
+
+    void resetNumRowsFromChunks();
+    void truncate(common::offset_t numRows);
+    void setVersionInfo(std::unique_ptr<VersionInfo> versionInfo) {
+        this->versionInfo = std::move(versionInfo);
+    }
+    void resetVersionAndUpdateInfo();
+
+    uint64_t append(const transaction::Transaction* transaction,
+        const std::vector<common::ValueVector*>& columnVectors, common::row_idx_t startRowInVectors,
+        uint64_t numValuesToAppend);
+    common::offset_t append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, const ChunkedNodeGroup& other,
+        common::offset_t offsetInOtherNodeGroup, common::offset_t numRowsToAppend);
+    common::offset_t append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, const InMemChunkedNodeGroup& other,
+        common::offset_t offsetInOtherNodeGroup, common::offset_t numRowsToAppend);
+    common::offset_t append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, std::span<const ColumnChunk*> other,
+        common::offset_t offsetInOtherNodeGroup, common::offset_t numRowsToAppend);
+    common::offset_t append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, std::span<const ColumnChunkData*> other,
+        common::offset_t offsetInOtherNodeGroup, common::offset_t numRowsToAppend);
+
+    void scan(const transaction::Transaction* transaction, const TableScanState& scanState,
+        const NodeGroupScanState& nodeGroupScanState, common::offset_t rowIdxInGroup,
+        common::length_t numRowsToScan) const;
+
+    template<ResidencyState SCAN_RESIDENCY_STATE>
+    void scanCommitted(transaction::Transaction* transaction, TableScanState& scanState,
+        InMemChunkedNodeGroup& output) const;
+
+    bool hasUpdates() const;
+    bool hasDeletions(const transaction::Transaction* transaction) const;
+    common::row_idx_t getNumUpdatedRows(const transaction::Transaction* transaction,
+        common::column_id_t columnID);
+
+    bool lookup(const transaction::Transaction* transaction, const TableScanState& state,
+        const NodeGroupScanState& nodeGroupScanState, common::offset_t rowIdxInChunk,
+        common::sel_t posInOutput) const;
+
+    void update(const transaction::Transaction* transaction, common::row_idx_t rowIdxInChunk,
+        common::column_id_t columnID, const common::ValueVector& propertyVector);
+
+    bool delete_(const transaction::Transaction* transaction, common::row_idx_t rowIdxInChunk);
+
+    void addColumn(MemoryManager& mm, const TableAddColumnState& addColumnState,
+        bool enableCompression, PageAllocator* pageAllocator, ColumnStats* newColumnStats);
+
+    bool isDeleted(const transaction::Transaction* transaction, common::row_idx_t rowInChunk) const;
+    bool isInserted(const transaction::Transaction* transaction,
+        common::row_idx_t rowInChunk) const;
+    bool hasAnyUpdates(const transaction::Transaction* transaction, common::column_id_t columnID,
+        common::row_idx_t startRow, common::length_t numRowsToCheck) const;
+    common::row_idx_t getNumDeletions(const transaction::Transaction* transaction,
+        common::row_idx_t startRow, common::length_t numRowsToCheck) const;
+    bool hasVersionInfo() const { return versionInfo != nullptr; }
+
+    static std::unique_ptr<ChunkedNodeGroup> flushEmpty(MemoryManager& mm,
+        const std::vector<common::LogicalType>& columnTypes, bool enableCompression,
+        uint64_t capacity, common::row_idx_t startRowIdx, PageAllocator& pageAllocator);
+
+    void commitInsert(common::row_idx_t startRow, common::row_idx_t numRowsToCommit,
+        common::transaction_t commitTS);
+    void rollbackInsert(common::row_idx_t startRow, common::row_idx_t numRows_,
+        common::transaction_t commitTS);
+    void commitDelete(common::row_idx_t startRow, common::row_idx_t numRows_,
+        common::transaction_t commitTS);
+    void rollbackDelete(common::row_idx_t startRow, common::row_idx_t numRows_,
+        common::transaction_t commitTS);
+    virtual void reclaimStorage(PageAllocator& pageAllocator) const;
+
+    uint64_t getEstimatedMemoryUsage() const;
+
+    virtual void serialize(common::Serializer& serializer) const;
+    static std::unique_ptr<ChunkedNodeGroup> deserialize(MemoryManager& memoryManager,
+        common::Deserializer& deSer);
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& cast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+protected:
+    NodeGroupDataFormat format;
+    ResidencyState residencyState;
+    common::row_idx_t startRowIdx;
+    uint64_t capacity;
+    std::atomic<common::row_idx_t> numRows;
+    std::vector<std::unique_ptr<ColumnChunk>> chunks;
+    std::unique_ptr<VersionInfo> versionInfo;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column.h
new file mode 100644
index 0000000000..b1f3873cb3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column.h
@@ -0,0 +1,203 @@
+#pragma once
+
+#include "common/null_mask.h"
+#include "common/types/types.h"
+#include "storage/table/column_reader_writer.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+
+class NullColumn;
+class StructColumn;
+class RelTableData;
+struct ColumnCheckpointState;
+class PageAllocator;
+struct ChunkState;
+
+class ColumnChunk;
+class Column {
+    friend class StringColumn;
+    friend class StructColumn;
+    friend class ListColumn;
+    friend class RelTableData;
+
+public:
+    Column(std::string name, common::LogicalType dataType, FileHandle* dataFH, MemoryManager* mm,
+        ShadowFile* shadowFile, bool enableCompression, bool requireNullColumn = true);
+    Column(std::string name, common::PhysicalTypeID physicalType, FileHandle* dataFH,
+        MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression,
+        bool requireNullColumn = true);
+
+    virtual ~Column();
+
+    void populateExtraChunkState(SegmentState& state) const;
+
+    static std::unique_ptr<ColumnChunkData> flushChunkData(const ColumnChunkData& chunkData,
+        PageAllocator& pageAllocator);
+    static std::unique_ptr<ColumnChunkData> flushNonNestedChunkData(
+        const ColumnChunkData& chunkData, PageAllocator& pageAllocator);
+    static ColumnChunkMetadata flushData(const ColumnChunkData& chunkData,
+        PageAllocator& pageAllocator);
+
+    // Use lookupInternal to specialize
+    void lookupValue(const ChunkState& state, common::offset_t nodeOffset,
+        common::ValueVector* resultVector, uint32_t posInVector) const;
+
+    // Scan from [offsetInChunk, offsetInChunk + length) (use scanInternal to specialize).
+    //
+    // The selectionVector in the resultVector's dataState should only select positions up to the
+    // length parameter (E.g. if you want to scan just position 2047 you have to pass a length of
+    // 2048; that is, like an unfiltered scan of 0-2047 but filtering everything but the value at
+    // index 2047).
+    // Primitive columns may scan more than the filtered values
+    virtual void scan(const ChunkState& state, common::offset_t startOffsetInGroup,
+        common::offset_t length, common::ValueVector* resultVector, uint64_t offsetInVector) const;
+    // Scan from [offsetInChunk, offsetInChunk + length) (use scanInternal to specialize).
+    // Appends to the end of the columnChunk
+    void scan(const ChunkState& state, ColumnChunkData* columnChunk,
+        common::offset_t offsetInChunk = 0, common::offset_t numValues = UINT64_MAX) const;
+    // Scan from [offsetInChunk, offsetInChunk + length) (use scanInternal to specialize).
+    // Appends to the end of the columnChunk
+    virtual void scanSegment(const SegmentState& state, ColumnChunkData* columnChunk,
+        common::offset_t offsetInSegment, common::offset_t numValue) const;
+    // Scan to raw data (does not scan any nested data and should only be used on primitive columns)
+    void scanSegment(const SegmentState& state, common::offset_t startOffsetInSegment,
+        common::offset_t length, uint8_t* result) const;
+
+    common::LogicalType& getDataType() { return dataType; }
+    const common::LogicalType& getDataType() const { return dataType; }
+
+    Column* getNullColumn() const;
+
+    std::string_view getName() const { return name; }
+
+    // Batch write to a set of sequential pages.
+    void write(ColumnChunkData& persistentChunk, ChunkState& state, common::offset_t dstOffset,
+        const ColumnChunkData& data, common::offset_t srcOffset, common::length_t numValues) const;
+
+    virtual void writeSegment(ColumnChunkData& persistentChunk, SegmentState& state,
+        common::offset_t dstOffsetInSegment, const ColumnChunkData& data,
+        common::offset_t srcOffset, common::length_t numValues) const;
+
+    // Append values to the end of the node group, resizing it if necessary
+    // Expects bools to be one bool per bit (like ColumnChunkData)
+    common::offset_t appendValues(ColumnChunkData& persistentChunk, SegmentState& state,
+        const uint8_t* data, const common::NullMask* nullChunkData,
+        common::offset_t numValues) const;
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& cast() const {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+
+    // Return value is the new segments if segment splitting occurs during an out of place
+    // checkpoint
+    virtual std::vector<std::unique_ptr<ColumnChunkData>> checkpointSegment(
+        ColumnCheckpointState&& checkpointState, PageAllocator& pageAllocator,
+        bool canSplitSegment = true) const;
+
+protected:
+    // For a scan that includes a selectionVector, the startOffsetInVector should be considered to
+    // be an offset for the selected positions within the selectionVector The offset of a given pos
+    // from the selectionVector within the segment is equal to:
+    //      startOffsetInSegment + pos - startOffsetInVector
+    // Note that the positions in the selectionVector may not be in the range covered by the segment
+    // Out of range positions should be ignored
+    virtual void scanSegment(const SegmentState& state, common::offset_t startOffsetInSegment,
+        common::row_idx_t numValuesToScan, common::ValueVector* resultVector,
+        common::offset_t startOffsetInVector) const;
+
+    virtual void lookupInternal(const SegmentState& state, common::offset_t offsetInSegment,
+        common::ValueVector* resultVector, uint32_t posInVector) const;
+
+    void writeValues(ChunkState& state, common::offset_t dstOffset, const uint8_t* data,
+        const common::NullMask* nullChunkData, common::offset_t srcOffset = 0,
+        common::offset_t numValues = 1) const;
+
+    void writeValuesInternal(SegmentState& state, common::offset_t dstOffsetInSegment,
+        const uint8_t* data, const common::NullMask* nullChunkData, common::offset_t srcOffset = 0,
+        common::offset_t numValues = 1) const;
+
+    void updateStatistics(ColumnChunkMetadata& metadata, common::offset_t maxIndex,
+        const std::optional<StorageValue>& min, const std::optional<StorageValue>& max) const;
+
+protected:
+    bool isEndOffsetOutOfPagesCapacity(const ColumnChunkMetadata& metadata,
+        common::offset_t endOffset) const;
+
+    virtual bool canCheckpointInPlace(const SegmentState& state,
+        const ColumnCheckpointState& checkpointState) const;
+
+    void checkpointColumnChunkInPlace(SegmentState& state,
+        const ColumnCheckpointState& checkpointState, PageAllocator& pageAllocator) const;
+
+    void checkpointNullData(const ColumnCheckpointState& checkpointState,
+        PageAllocator& pageAllocator) const;
+
+    std::vector<std::unique_ptr<ColumnChunkData>> checkpointColumnChunkOutOfPlace(
+        const SegmentState& state, const ColumnCheckpointState& checkpointState,
+        PageAllocator& pageAllocator, bool canSplitSegment) const;
+
+    // check if val is in range [start, end)
+    static bool isInRange(uint64_t val, uint64_t start, uint64_t end) {
+        return val >= start && val < end;
+    }
+
+protected:
+    std::string name;
+    common::LogicalType dataType;
+    MemoryManager* mm;
+    FileHandle* dataFH;
+    ShadowFile* shadowFile;
+    std::unique_ptr<NullColumn> nullColumn;
+    read_values_to_vector_func_t readToVectorFunc;
+    write_values_func_t writeFunc;
+    read_values_to_page_func_t readToPageFunc;
+    bool enableCompression;
+
+    std::unique_ptr<ColumnReadWriter> columnReadWriter;
+};
+
+class InternalIDColumn final : public Column {
+public:
+    InternalIDColumn(std::string name, FileHandle* dataFH, MemoryManager* mm,
+        ShadowFile* shadowFile, bool enableCompression);
+
+    void scan(const ChunkState& state, common::offset_t startOffsetInGroup, common::offset_t length,
+        common::ValueVector* resultVector, uint64_t offsetInVector) const override {
+        Column::scan(state, startOffsetInGroup, length, resultVector, offsetInVector);
+        populateCommonTableID(resultVector);
+    }
+
+    void lookupInternal(const SegmentState& state, common::offset_t offsetInSegment,
+        common::ValueVector* resultVector, uint32_t posInVector) const override {
+        Column::lookupInternal(state, offsetInSegment, resultVector, posInVector);
+        populateCommonTableID(resultVector);
+    }
+
+    common::table_id_t getCommonTableID() const { return commonTableID; }
+    // TODO(Guodong): This function should be removed through rewriting INTERNAL_ID as STRUCT.
+    void setCommonTableID(common::table_id_t tableID) { commonTableID = tableID; }
+
+private:
+    void populateCommonTableID(const common::ValueVector* resultVector) const;
+
+private:
+    common::table_id_t commonTableID;
+};
+
+struct ColumnFactory {
+    static std::unique_ptr<Column> createColumn(std::string name, common::LogicalType dataType,
+        FileHandle* dataFH, MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression);
+    static std::unique_ptr<Column> createColumn(std::string name,
+        common::PhysicalTypeID physicalType, FileHandle* dataFH, MemoryManager* mm,
+        ShadowFile* shadowFile, bool enableCompression);
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk.h
new file mode 100644
index 0000000000..61dc765a52
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk.h
@@ -0,0 +1,336 @@
+#pragma once
+
+#include <cstddef>
+#include <cstdint>
+
+#include "common/assert.h"
+#include "common/cast.h"
+#include "common/types/types.h"
+#include "storage/enums/residency_state.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/update_info.h"
+
+namespace lbug {
+namespace storage {
+class PageAllocator;
+class MemoryManager;
+class Column;
+struct ColumnChunkScanner;
+
+struct ChunkCheckpointState {
+    std::unique_ptr<ColumnChunkData> chunkData;
+    // Start offset in the column chunk of the beginning of the chunk data
+    common::row_idx_t startRow;
+    common::length_t numRows;
+
+    ChunkCheckpointState(std::unique_ptr<ColumnChunkData> chunkData, common::row_idx_t startRow,
+        common::length_t numRows)
+        : chunkData{std::move(chunkData)}, startRow{startRow}, numRows{numRows} {}
+};
+
+struct SegmentCheckpointState {
+    const ColumnChunkData& chunkData;
+    common::row_idx_t startRowInData;
+    common::row_idx_t offsetInSegment;
+    common::row_idx_t numRows;
+};
+
+template<class SegmentView>
+std::pair<typename std::span<SegmentView>::iterator, common::offset_t> genericFindSegment(
+    std::span<SegmentView> segments, common::offset_t offsetInChunk) {
+    auto offsetInSegment = offsetInChunk;
+    auto segment = segments.begin();
+    while (segment != segments.end()) {
+        if (offsetInSegment < (**segment).getNumValues()) {
+            return std::make_pair(segment, offsetInSegment);
+        }
+        offsetInSegment -= (**segment).getNumValues();
+        segment++;
+    }
+    return std::make_pair(segments.end(), 0);
+}
+
+template<class SegmentView,
+    std::invocable<SegmentView&, common::offset_t /*offsetInSegment*/,
+        common::offset_t /*lengthInSegment*/, common::offset_t /*dstOffset*/>
+        Func>
+common::offset_t genericRangeSegments(std::span<SegmentView> segments,
+    common::offset_t offsetInChunk, common::length_t length, Func func) {
+    // TODO(bmwinger): try binary search (might only make a difference for a very large number
+    // of segments)
+    auto [segment, offsetInSegment] = genericFindSegment(segments, offsetInChunk);
+    return genericRangeSegmentsFromIt(segments, segment, offsetInSegment, length, std::move(func));
+}
+
+// dstOffset starts from 0 and is the offset in the output data for a given segment
+//  (it increases by lengthInSegment for each segment)
+// Returns the total number of values scanned (input length can be longer than the available
+// values)
+template<class SegmentView,
+    std::invocable<SegmentView&, common::offset_t /*offsetInSegment*/,
+        common::offset_t /*lengthInSegment*/, common::offset_t /*dstOffset*/>
+        Func>
+common::offset_t genericRangeSegmentsFromIt(std::span<SegmentView> segments,
+    typename std::span<SegmentView>::iterator segment, common::offset_t offsetInSegment,
+    common::length_t length, Func func) {
+    common::offset_t lengthScanned = 0;
+    while (lengthScanned < length && segment != segments.end()) {
+        KU_ASSERT((**segment).getNumValues() > offsetInSegment);
+        auto lengthInSegment =
+            std::min(length - lengthScanned, (**segment).getNumValues() - offsetInSegment);
+        func(*segment, offsetInSegment, lengthInSegment, lengthScanned);
+        lengthScanned += lengthInSegment;
+        segment++;
+        offsetInSegment = 0;
+    }
+    return lengthScanned;
+}
+
+class ColumnChunk;
+struct ColumnCheckpointState {
+    ColumnChunkData& persistentData;
+    std::vector<SegmentCheckpointState> segmentCheckpointStates;
+    common::row_idx_t endRowIdxToWrite;
+
+    ColumnCheckpointState(ColumnChunkData& persistentData,
+        std::vector<SegmentCheckpointState> segmentCheckpointStates)
+        : persistentData{persistentData},
+          segmentCheckpointStates{std::move(segmentCheckpointStates)}, endRowIdxToWrite{0} {
+        for (const auto& chunkCheckpointState : this->segmentCheckpointStates) {
+            const auto endRowIdx =
+                chunkCheckpointState.offsetInSegment + chunkCheckpointState.numRows;
+            if (endRowIdx > endRowIdxToWrite) {
+                endRowIdxToWrite = endRowIdx;
+            }
+        }
+    }
+};
+
+struct ChunkState {
+    const Column* column = nullptr;
+    std::vector<SegmentState> segmentStates;
+
+    void reclaimAllocatedPages(PageAllocator& pageAllocator) const;
+
+    std::pair<const SegmentState*, common::offset_t> findSegment(
+        common::offset_t offsetInChunk) const;
+
+    // dstOffset starts from 0 and is the offset in the output data for a given segment
+    //  (it increases by lengthInSegment for each segment)
+    // Returns the total number of values scanned (input length can be longer than the available
+    // values)
+    template<std::invocable<SegmentState&, common::offset_t /*offsetInSegment*/,
+        common::offset_t /*lengthInSegment*/, common::offset_t /*dstOffset*/>
+            Func>
+    common::offset_t rangeSegments(common::offset_t offsetInChunk, common::length_t length,
+        Func func) {
+        return genericRangeSegments(std::span(segmentStates), offsetInChunk, length, func);
+    }
+
+    // TODO(bmwinger): the above function should be const and only isn't because of ALP exception
+    // chunk modifications. The SegmentState& should also be const for the same reason
+    template<std::invocable<SegmentState&, common::offset_t /*offsetInSegment*/,
+        common::offset_t /*lengthInSegment*/, common::offset_t /*dstOffset*/>
+            Func>
+    common::offset_t rangeSegments(common::offset_t offsetInChunk, common::length_t length,
+        Func func) const {
+        return const_cast<ChunkState*>(this)->rangeSegments(offsetInChunk, length, func);
+    }
+};
+
+class ColumnChunk {
+public:
+    ColumnChunk(MemoryManager& mm, common::LogicalType&& dataType, uint64_t capacity,
+        bool enableCompression, ResidencyState residencyState, bool initializeToZero = true);
+    ColumnChunk(MemoryManager& mm, common::LogicalType&& dataType, bool enableCompression,
+        ColumnChunkMetadata metadata);
+    ColumnChunk(bool enableCompression, std::unique_ptr<ColumnChunkData> data);
+    ColumnChunk(bool enableCompression, std::vector<std::unique_ptr<ColumnChunkData>> segments);
+
+    void initializeScanState(ChunkState& state, const Column* column) const;
+    void scan(const transaction::Transaction* transaction, const ChunkState& state,
+        common::ValueVector& output, common::offset_t offsetInChunk, common::length_t length) const;
+    template<ResidencyState SCAN_RESIDENCY_STATE>
+    void scanCommitted(const transaction::Transaction* transaction, ChunkState& chunkState,
+        ColumnChunkScanner& output, common::row_idx_t startRow = 0,
+        common::row_idx_t numRows = common::INVALID_ROW_IDX) const;
+    template<ResidencyState SCAN_RESIDENCY_STATE>
+    void scanCommitted(const transaction::Transaction* transaction, ChunkState& chunkState,
+        ColumnChunkData& output, common::row_idx_t startRow = 0,
+        common::row_idx_t numRows = common::INVALID_ROW_IDX) const;
+    void lookup(const transaction::Transaction* transaction, const ChunkState& state,
+        common::offset_t rowInChunk, common::ValueVector& output,
+        common::sel_t posInOutputVector) const;
+    void update(const transaction::Transaction* transaction, common::offset_t offsetInChunk,
+        const common::ValueVector& values);
+
+    uint64_t getEstimatedMemoryUsage() const {
+        if (getResidencyState() == ResidencyState::ON_DISK) {
+            return 0;
+        }
+        uint64_t memUsage = 0;
+        for (auto& segment : data) {
+            memUsage += segment->getEstimatedMemoryUsage();
+        }
+        return memUsage;
+    }
+    void serialize(common::Serializer& serializer) const;
+    static std::unique_ptr<ColumnChunk> deserialize(MemoryManager& mm, common::Deserializer& deSer);
+
+    uint64_t getNumValues() const {
+        uint64_t numValues = 0;
+        for (const auto& chunk : data) {
+            numValues += chunk->getNumValues();
+        }
+        return numValues;
+    }
+    uint64_t getCapacity() const {
+        uint64_t capacity = 0;
+        for (const auto& chunk : data) {
+            capacity += chunk->getCapacity();
+        }
+        return capacity;
+    }
+    void truncate(uint64_t numValues) {
+        uint64_t seenValues = 0;
+        uint64_t seenSegments = 0;
+        for (auto& segment : data) {
+            seenSegments++;
+            if (seenValues + segment->getNumValues() < numValues) {
+                seenValues += segment->getNumValues();
+            } else {
+                segment->setNumValues(numValues - seenValues);
+                break;
+            }
+        }
+        data.resize(seenSegments);
+    }
+
+    common::row_idx_t getNumUpdatedRows(const transaction::Transaction* transaction) const;
+
+    // TODO(bmwinger): Segments could probably share a single datatype
+    const common::LogicalType& getDataType() const { return data.front()->getDataType(); }
+    bool isCompressionEnabled() const { return enableCompression; }
+
+    ResidencyState getResidencyState() const {
+        auto state = data.front()->getResidencyState();
+        RUNTIME_CHECK(for (auto& chunk : data) { KU_ASSERT(chunk->getResidencyState() == state); });
+        return state;
+    }
+    bool hasUpdates() const { return updateInfo.isSet(); }
+    bool hasUpdates(const transaction::Transaction* transaction, common::row_idx_t startRow,
+        common::length_t numRows) const;
+    void resetUpdateInfo() { updateInfo.reset(); }
+
+    MergedColumnChunkStats getMergedColumnChunkStats() const;
+
+    void reclaimStorage(PageAllocator& pageAllocator) const;
+
+    void append(common::ValueVector* vector, const common::SelectionView& selView);
+    void append(const ColumnChunk* other, common::offset_t startPosInOtherChunk,
+        uint32_t numValuesToAppend);
+
+    void append(const ColumnChunkData* other, common::offset_t startPosInOtherChunk,
+        uint32_t numValuesToAppend);
+
+    template<typename T, std::invocable<T&, uint64_t> Func>
+    void mapValues(Func func, uint64_t startOffset = 0, uint64_t endOffset = UINT64_MAX) {
+        rangeSegments(startOffset, endOffset == UINT64_MAX ? UINT64_MAX : endOffset - startOffset,
+            [&](auto& segment, auto offsetInSegment, auto lengthInSegment, auto dstOffset) {
+                KU_ASSERT(segment->getResidencyState() == ResidencyState::IN_MEMORY);
+                auto* segmentData = segment->template getData<T>();
+                for (size_t i = offsetInSegment; i < lengthInSegment; i++) {
+                    func(segmentData[i], dstOffset + i - offsetInSegment);
+                }
+            });
+    }
+
+    template<typename T>
+    T getValue(common::offset_t pos) const {
+        KU_ASSERT(pos < getCapacity());
+        auto [segment, offsetInSegment] = genericFindSegment(std::span(data), pos);
+        KU_ASSERT(segment->get() != nullptr);
+        KU_ASSERT((*segment)->getResidencyState() == ResidencyState::IN_MEMORY);
+        return (*segment)->template getValue<T>(offsetInSegment);
+    }
+
+    template<typename T>
+    void setValue(T val, common::offset_t pos) const {
+        KU_ASSERT(pos < getCapacity());
+        auto [segment, offsetInSegment] = genericFindSegment(std::span(data), pos);
+        KU_ASSERT(segment->get() != nullptr);
+        KU_ASSERT((*segment)->getResidencyState() == ResidencyState::IN_MEMORY);
+        (*segment)->template setValue<T>(val, pos);
+    }
+
+    void flush(PageAllocator& pageAllocator) {
+        for (auto& segment : data) {
+            KU_ASSERT(segment->getResidencyState() == ResidencyState::IN_MEMORY);
+            segment->flush(pageAllocator);
+        }
+    }
+
+    void populateWithDefaultVal(evaluator::ExpressionEvaluator& defaultEvaluator,
+        uint64_t& numValues_, ColumnStats* newColumnStats) {
+        KU_ASSERT(data.size() == 1 && data.back()->getNumValues() == 0);
+        data.back()->populateWithDefaultVal(defaultEvaluator, numValues_, newColumnStats);
+    }
+
+    void finalize() {
+        for (auto& segment : data) {
+            KU_ASSERT(segment->getResidencyState() == ResidencyState::IN_MEMORY);
+            segment->finalize();
+        }
+    }
+
+    // TODO(bmwinger): This is not ideal; it's just a workaround for storage_info
+    // We should either provide a way for ColumnChunk to provide its own details about the
+    // storage structure, or maybe change the type of data to allow us to directly return a
+    // std::span<const ColumnChunkData> to get read-only info about the segments efficiently
+    std::vector<const ColumnChunkData*> getSegments() const {
+        std::vector<const ColumnChunkData*> segments;
+        for (const auto& segment : data) {
+            segments.push_back(segment.get());
+        }
+        return segments;
+    }
+
+    void checkpoint(Column& column, std::vector<ChunkCheckpointState>&& chunkCheckpointStates,
+        PageAllocator& pageAllocator);
+
+    void write(Column& column, ChunkState& state, common::offset_t dstOffset,
+        const ColumnChunkData& dataToWrite, common::offset_t srcOffset, common::length_t numValues);
+
+    void syncNumValues() {
+        for (auto& segment : data) {
+            segment->syncNumValues();
+        }
+    }
+
+    void setTableID(common::table_id_t tableID) {
+        for (const auto& segment : data) {
+            auto internalIDSegment = common::ku_dynamic_cast<InternalIDChunkData*>(segment.get());
+            internalIDSegment->setTableID(tableID);
+        }
+    }
+
+private:
+    template<typename Func>
+    void rangeSegments(common::offset_t offsetInChunk, common::length_t length, Func func) const {
+        genericRangeSegments(std::span(data), offsetInChunk, length, func);
+    }
+
+    void scanInMemSegments(ColumnChunkScanner& output, common::offset_t startRow,
+        common::offset_t numRows) const;
+
+private:
+    // TODO(Guodong): This field should be removed. Ideally it shouldn't be cached anywhere in
+    // storage structures, instead should be fed into functions needed from ClientContext
+    // dbConfig.
+    bool enableCompression;
+    std::vector<std::unique_ptr<ColumnChunkData>> data;
+    UpdateInfo updateInfo;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_data.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_data.h
new file mode 100644
index 0000000000..20f2b00f6f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_data.h
@@ -0,0 +1,509 @@
+#pragma once
+
+#include <cstdint>
+#include <functional>
+#include <optional>
+#include <variant>
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/enums/rel_multiplicity.h"
+#include "common/null_mask.h"
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/compression/compression.h"
+#include "storage/enums/residency_state.h"
+#include "storage/table/column_chunk_metadata.h"
+#include "storage/table/column_chunk_stats.h"
+#include "storage/table/in_memory_exception_chunk.h"
+
+namespace lbug::storage {
+class PageManager;
+}
+namespace lbug {
+namespace evaluator {
+class ExpressionEvaluator;
+} // namespace evaluator
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace storage {
+
+class Column;
+class NullChunkData;
+class ColumnStats;
+class PageAllocator;
+class FileHandle;
+
+// TODO(bmwinger): Hide access to variables.
+struct SegmentState {
+    const Column* column;
+    ColumnChunkMetadata metadata;
+    uint64_t numValuesPerPage = UINT64_MAX;
+    std::unique_ptr<SegmentState> nullState;
+
+    // Used for struct/list/string columns.
+    std::vector<SegmentState> childrenStates;
+
+    // Used for floating point columns
+    std::variant<std::unique_ptr<InMemoryExceptionChunk<double>>,
+        std::unique_ptr<InMemoryExceptionChunk<float>>>
+        alpExceptionChunk;
+
+    explicit SegmentState(bool hasNull = true) : column{nullptr} {
+        if (hasNull) {
+            nullState = std::make_unique<SegmentState>(false /*hasNull*/);
+        }
+    }
+    SegmentState(ColumnChunkMetadata metadata, uint64_t numValuesPerPage)
+        : column{nullptr}, metadata{std::move(metadata)}, numValuesPerPage{numValuesPerPage} {
+        nullState = std::make_unique<SegmentState>(false /*hasNull*/);
+    }
+
+    SegmentState& getChildState(common::idx_t childIdx) {
+        KU_ASSERT(childIdx < childrenStates.size());
+        return childrenStates[childIdx];
+    }
+    const SegmentState& getChildState(common::idx_t childIdx) const {
+        KU_ASSERT(childIdx < childrenStates.size());
+        return childrenStates[childIdx];
+    }
+
+    template<std::floating_point T>
+    InMemoryExceptionChunk<T>* getExceptionChunk() {
+        using GetType = std::unique_ptr<InMemoryExceptionChunk<T>>;
+        KU_ASSERT(std::holds_alternative<GetType>(alpExceptionChunk));
+        return std::get<GetType>(alpExceptionChunk).get();
+    }
+
+    template<std::floating_point T>
+    const InMemoryExceptionChunk<T>* getExceptionChunkConst() const {
+        using GetType = std::unique_ptr<InMemoryExceptionChunk<T>>;
+        KU_ASSERT(std::holds_alternative<GetType>(alpExceptionChunk));
+        return std::get<GetType>(alpExceptionChunk).get();
+    }
+
+    void reclaimAllocatedPages(PageAllocator& pageAllocator) const;
+
+    // Used by rangeSegments in column_chunk.h to provide the same interface as the segments stored
+    // in ColumnChunk inside unique_ptr
+    SegmentState& operator*() { return *this; }
+    const SegmentState& operator*() const { return *this; }
+    uint64_t getNumValues() const { return metadata.numValues; }
+};
+
+class Spiller;
+// Base data segment covers all fixed-sized data types.
+class LBUG_API ColumnChunkData {
+public:
+    friend struct ColumnChunkFactory;
+    // For spilling to disk, we need access to the underlying buffer
+    friend class Spiller;
+
+    ColumnChunkData(MemoryManager& mm, common::LogicalType dataType, uint64_t capacity,
+        bool enableCompression, ResidencyState residencyState, bool hasNullData,
+        bool initializeToZero = true);
+    ColumnChunkData(MemoryManager& mm, common::LogicalType dataType, bool enableCompression,
+        const ColumnChunkMetadata& metadata, bool hasNullData, bool initializeToZero = true);
+    ColumnChunkData(MemoryManager& mm, common::PhysicalTypeID physicalType, bool enableCompression,
+        const ColumnChunkMetadata& metadata, bool hasNullData, bool initializeToZero = true);
+    virtual ~ColumnChunkData();
+
+    template<typename T>
+    T getValue(common::offset_t pos) const {
+        KU_ASSERT(pos < numValues);
+        KU_ASSERT(residencyState != ResidencyState::ON_DISK);
+        return getData<T>()[pos];
+    }
+    template<typename T>
+    void setValue(T val, common::offset_t pos) {
+        KU_ASSERT(pos < capacity);
+        KU_ASSERT(residencyState != ResidencyState::ON_DISK);
+        getData<T>()[pos] = val;
+        if (pos >= numValues) {
+            numValues = pos + 1;
+        }
+        if constexpr (StorageValueType<T>) {
+            inMemoryStats.update(StorageValue{val}, dataType.getPhysicalType());
+        }
+    }
+
+    virtual bool isNull(common::offset_t pos) const;
+    void setNullData(std::unique_ptr<NullChunkData> nullData_) { nullData = std::move(nullData_); }
+    bool hasNullData() const { return nullData != nullptr; }
+    NullChunkData* getNullData() { return nullData.get(); }
+    const NullChunkData* getNullData() const { return nullData.get(); }
+    std::optional<common::NullMask> getNullMask() const;
+    std::unique_ptr<NullChunkData> moveNullData() { return std::move(nullData); }
+
+    common::LogicalType& getDataType() { return dataType; }
+    const common::LogicalType& getDataType() const { return dataType; }
+    ResidencyState getResidencyState() const { return residencyState; }
+    bool isCompressionEnabled() const { return enableCompression; }
+    ColumnChunkMetadata& getMetadata() {
+        KU_ASSERT(residencyState == ResidencyState::ON_DISK);
+        return metadata;
+    }
+    const ColumnChunkMetadata& getMetadata() const {
+        KU_ASSERT(residencyState == ResidencyState::ON_DISK);
+        return metadata;
+    }
+    void setMetadata(const ColumnChunkMetadata& metadata_) {
+        KU_ASSERT(residencyState == ResidencyState::ON_DISK);
+        metadata = metadata_;
+    }
+
+    // Only have side effects on in-memory or temporary chunks.
+    virtual void resetToAllNull();
+    virtual void resetToEmpty();
+
+    // Note that the startPageIdx is not known, so it will always be common::INVALID_PAGE_IDX
+    virtual ColumnChunkMetadata getMetadataToFlush() const;
+
+    virtual void append(common::ValueVector* vector, const common::SelectionView& selView);
+    virtual void append(const ColumnChunkData* other, common::offset_t startPosInOtherChunk,
+        uint32_t numValuesToAppend);
+
+    virtual void flush(PageAllocator& pageAllocator);
+
+    ColumnChunkMetadata flushBuffer(PageAllocator& pageAllocator, const PageRange& entry,
+        const ColumnChunkMetadata& metadata) const;
+
+    static common::page_idx_t getNumPagesForBytes(uint64_t numBytes) {
+        return (numBytes + common::LBUG_PAGE_SIZE - 1) / common::LBUG_PAGE_SIZE;
+    }
+
+    uint64_t getNumBytesPerValue() const { return numBytesPerValue; }
+    uint8_t* getData() const;
+    template<typename T>
+    T* getData() const {
+        return reinterpret_cast<T*>(getData());
+    }
+    uint64_t getBufferSize() const;
+
+    virtual void initializeScanState(SegmentState& state, const Column* column) const;
+    virtual void scan(common::ValueVector& output, common::offset_t offset, common::length_t length,
+        common::sel_t posInOutputVector = 0) const;
+    virtual void lookup(common::offset_t offsetInChunk, common::ValueVector& output,
+        common::sel_t posInOutputVector) const;
+
+    // TODO(Guodong): In general, this is not a good interface. Instead of passing in
+    // `offsetInVector`, we should flatten the vector to pos at `offsetInVector`.
+    virtual void write(const common::ValueVector* vector, common::offset_t offsetInVector,
+        common::offset_t offsetInChunk);
+    virtual void write(ColumnChunkData* chunk, ColumnChunkData* offsetsInChunk,
+        common::RelMultiplicity multiplicity);
+    virtual void write(const ColumnChunkData* srcChunk, common::offset_t srcOffsetInChunk,
+        common::offset_t dstOffsetInChunk, common::offset_t numValuesToCopy);
+
+    virtual void setToInMemory();
+    // numValues must be at least the number of values the ColumnChunk was first initialized
+    // with
+    // reverse data and zero the part exceeding the original size
+    virtual void resize(uint64_t newCapacity);
+    // the opposite of the resize method, just simple resize
+    virtual void resizeWithoutPreserve(uint64_t newCapacity);
+
+    void populateWithDefaultVal(evaluator::ExpressionEvaluator& defaultEvaluator,
+        uint64_t& numValues_, ColumnStats* newColumnStats);
+    virtual void finalize() {
+        KU_ASSERT(residencyState != ResidencyState::ON_DISK);
+        // DO NOTHING.
+    }
+
+    uint64_t getCapacity() const { return capacity; }
+    uint64_t getNumValues() const { return numValues; }
+    // TODO(Guodong): Alternatively, we can let `getNumValues` read from metadata when ON_DISK.
+    virtual void resetNumValuesFromMetadata();
+    virtual void setNumValues(uint64_t numValues_);
+    // Just to provide the same interface for handleAppendException
+    inline void truncate(uint64_t numValues_) { setNumValues(numValues_); }
+    virtual void syncNumValues() {}
+    virtual bool numValuesSanityCheck() const;
+
+    virtual bool sanityCheck() const;
+
+    virtual uint64_t getEstimatedMemoryUsage() const;
+    bool shouldSplit() const {
+        // TODO(bmwinger): this should use the inMemoryStats to avoid scanning the data, however not
+        // all functions update them
+        return numValues > 1 && getSizeOnDisk() > std::max(getMinimumSizeOnDisk(),
+                                                      common::StorageConfig::MAX_SEGMENT_SIZE);
+    }
+    const ColumnChunkStats& getInMemoryStats() const;
+
+    // The minimum size is a function of the type's complexity and the page size
+    // If the page size is large, or the type is very complex, this could be larger than the max
+    // segment size (in which case we will treat the minimum size as the max segment size) E.g. if
+    // LBUG_PAGE_SIZE == MAX_SEGMENT_SIZE, even a normal column with non-constant-compressed nulls
+    // would have two pages and be detected as needing to split, even if the pages are nowhere near
+    // full.
+    //
+    // TODO(bmwinger): This was added to work around the issue of complex nested types having a
+    // larger initial size than the max segment size
+    // It should ideally be removed
+    virtual uint64_t getMinimumSizeOnDisk() const;
+    virtual uint64_t getSizeOnDisk() const;
+    // Not guaranteed to be accurate; not all functions keep the in memory statistics up to date!
+    virtual uint64_t getSizeOnDiskInMemoryStats() const;
+
+    virtual void serialize(common::Serializer& serializer) const;
+    static std::unique_ptr<ColumnChunkData> deserialize(MemoryManager& mm,
+        common::Deserializer& deSer);
+
+    template<typename TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<typename TARGET>
+    const TARGET& cast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    MemoryManager& getMemoryManager() const;
+
+    void loadFromDisk();
+    SpillResult spillToDisk();
+
+    MergedColumnChunkStats getMergedColumnChunkStats() const;
+
+    void updateStats(const common::ValueVector* vector, const common::SelectionView& selVector);
+
+    virtual void reclaimStorage(PageAllocator& pageAllocator);
+
+    std::vector<std::unique_ptr<ColumnChunkData>> split(bool targetMaxSize = false) const;
+
+protected:
+    // Initializes the data buffer and functions. They are (and should be) only called in
+    // constructor.
+    void initializeBuffer(common::PhysicalTypeID physicalType, MemoryManager& mm,
+        bool initializeToZero);
+    void initializeFunction();
+
+    // Note: This function is not setting child/null chunk data recursively.
+    void setToOnDisk(const ColumnChunkMetadata& metadata);
+
+    virtual void copyVectorToBuffer(common::ValueVector* vector, common::offset_t startPosInChunk,
+        const common::SelectionView& selView);
+
+    void resetInMemoryStats();
+
+private:
+    using flush_buffer_func_t = std::function<ColumnChunkMetadata(const std::span<uint8_t>,
+        FileHandle*, const PageRange&, const ColumnChunkMetadata&)>;
+    flush_buffer_func_t initializeFlushBufferFunction(
+        std::shared_ptr<CompressionAlg> compression) const;
+    uint64_t getBufferSize(uint64_t capacity_) const;
+
+protected:
+    using get_metadata_func_t = std::function<ColumnChunkMetadata(const std::span<uint8_t>,
+        uint64_t, StorageValue, StorageValue)>;
+    using get_min_max_func_t =
+        std::function<std::pair<StorageValue, StorageValue>(const uint8_t*, uint64_t)>;
+
+    ResidencyState residencyState;
+    common::LogicalType dataType;
+    bool enableCompression;
+    uint32_t numBytesPerValue;
+    uint64_t capacity;
+    std::unique_ptr<MemoryBuffer> buffer;
+    std::unique_ptr<NullChunkData> nullData;
+    uint64_t numValues;
+    flush_buffer_func_t flushBufferFunction;
+    get_metadata_func_t getMetadataFunction;
+
+    // On-disk metadata for column chunk.
+    ColumnChunkMetadata metadata;
+
+    // Stats for any in-memory updates applied to the column chunk
+    // This will be merged with the on-disk metadata to get the overall stats
+    ColumnChunkStats inMemoryStats;
+};
+
+template<>
+inline void ColumnChunkData::setValue(bool val, common::offset_t pos) {
+    KU_ASSERT(pos < capacity);
+    KU_ASSERT(residencyState != ResidencyState::ON_DISK);
+    // Buffer is rounded up to the nearest 8 bytes so that this cast is safe
+    common::NullMask::setNull(getData<uint64_t>(), pos, val);
+    if (pos >= numValues) {
+        numValues = pos + 1;
+    }
+    inMemoryStats.update(StorageValue{val}, dataType.getPhysicalType());
+}
+
+template<>
+inline bool ColumnChunkData::getValue(common::offset_t pos) const {
+    // Buffer is rounded up to the nearest 8 bytes so that this cast is safe
+    return common::NullMask::isNull(getData<uint64_t>(), pos);
+}
+
+// Stored as bitpacked booleans in-memory and on-disk
+class BoolChunkData : public ColumnChunkData {
+public:
+    BoolChunkData(MemoryManager& mm, uint64_t capacity, bool enableCompression, ResidencyState type,
+        bool hasNullChunk)
+        : ColumnChunkData(mm, common::LogicalType::BOOL(), capacity,
+              // Booleans are always bitpacked, but this can also enable constant compression
+              enableCompression, type, hasNullChunk, true) {}
+    BoolChunkData(MemoryManager& mm, bool enableCompression, const ColumnChunkMetadata& metadata,
+        bool hasNullData)
+        : ColumnChunkData{mm, common::LogicalType::BOOL(), enableCompression, metadata, hasNullData,
+              true} {}
+
+    void append(common::ValueVector* vector, const common::SelectionView& sel) final;
+    void append(const ColumnChunkData* other, common::offset_t startPosInOtherChunk,
+        uint32_t numValuesToAppend) override;
+
+    void scan(common::ValueVector& output, common::offset_t offset, common::length_t length,
+        common::sel_t posInOutputVector = 0) const override;
+    void lookup(common::offset_t offsetInChunk, common::ValueVector& output,
+        common::sel_t posInOutputVector) const override;
+
+    void write(const common::ValueVector* vector, common::offset_t offsetInVector,
+        common::offset_t offsetInChunk) override;
+    void write(ColumnChunkData* chunk, ColumnChunkData* dstOffsets,
+        common::RelMultiplicity multiplicity) final;
+    void write(const ColumnChunkData* srcChunk, common::offset_t srcOffsetInChunk,
+        common::offset_t dstOffsetInChunk, common::offset_t numValuesToCopy) override;
+};
+
+class NullChunkData final : public BoolChunkData {
+public:
+    NullChunkData(MemoryManager& mm, uint64_t capacity, bool enableCompression, ResidencyState type)
+        : BoolChunkData(mm, capacity, enableCompression, type, false /*hasNullData*/) {}
+    NullChunkData(MemoryManager& mm, bool enableCompression, const ColumnChunkMetadata& metadata)
+        : BoolChunkData{mm, enableCompression, metadata, false /*hasNullData*/} {}
+
+    // Maybe this should be combined with BoolChunkData if the only difference is these
+    // functions?
+    bool isNull(common::offset_t pos) const override { return getValue<bool>(pos); }
+    void setNull(common::offset_t pos, bool isNull);
+
+    bool noNullsGuaranteedInMem() const {
+        return !inMemoryStats.max || !inMemoryStats.max->get<bool>();
+    }
+    bool allNullsGuaranteedInMem() const {
+        return !inMemoryStats.min || inMemoryStats.min->get<bool>();
+    }
+    bool haveNoNullsGuaranteed() const;
+    bool haveAllNullsGuaranteed() const;
+
+    void resetToEmpty() override {
+        memset(getData(), 0 /* non null */, getBufferSize());
+        numValues = 0;
+        inMemoryStats.min = inMemoryStats.max = std::nullopt;
+    }
+    void resetToNoNull() {
+        memset(getData(), 0 /* non null */, getBufferSize());
+        inMemoryStats.min = inMemoryStats.max = false;
+    }
+    void resetToAllNull() override {
+        memset(getData(), 0xFF /* null */, getBufferSize());
+        inMemoryStats.min = inMemoryStats.max = true;
+    }
+
+    void copyFromBuffer(const uint64_t* srcBuffer, uint64_t srcOffset, uint64_t dstOffset,
+        uint64_t numBits) {
+        KU_ASSERT(numBits > 0);
+        common::NullMask::copyNullMask(srcBuffer, srcOffset, getData<uint64_t>(), dstOffset,
+            numBits);
+        auto [min, max] = common::NullMask::getMinMax(srcBuffer, srcOffset, numBits);
+        if (!inMemoryStats.min.has_value() || min < inMemoryStats.min->get<bool>()) {
+            inMemoryStats.min = min;
+        }
+        if (!inMemoryStats.max.has_value() || max > inMemoryStats.max->get<bool>()) {
+            inMemoryStats.max = max;
+        }
+        if ((dstOffset + numBits) >= numValues) {
+            numValues = dstOffset + numBits;
+        }
+    }
+
+    // Appends the null data from the vector's null mask
+    void appendNulls(const common::ValueVector* vector, const common::SelectionView& selView,
+        common::offset_t startPosInChunk);
+
+    // NullChunkData::scan updates the null mask of output vector
+    void scan(common::ValueVector& output, common::offset_t offset, common::length_t length,
+        common::sel_t posInOutputVector = 0) const override;
+
+    void append(const ColumnChunkData* other, common::offset_t startPosInOtherChunk,
+        uint32_t numValuesToAppend) override;
+
+    void write(const common::ValueVector* vector, common::offset_t offsetInVector,
+        common::offset_t offsetInChunk) override;
+    void write(const ColumnChunkData* srcChunk, common::offset_t srcOffsetInChunk,
+        common::offset_t dstOffsetInChunk, common::offset_t numValuesToCopy) override;
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<NullChunkData> deserialize(MemoryManager& mm,
+        common::Deserializer& deSer);
+
+    common::NullMask getNullMask() const;
+};
+
+class LBUG_API InternalIDChunkData final : public ColumnChunkData {
+public:
+    // TODO(Guodong): Should make InternalIDChunkData has no NULL.
+    // Physically, we only materialize offset of INTERNAL_ID, which is same as UINT64,
+    InternalIDChunkData(MemoryManager& mm, uint64_t capacity, bool enableCompression,
+        ResidencyState residencyState)
+        : ColumnChunkData(mm, common::LogicalType::INTERNAL_ID(), capacity, enableCompression,
+              residencyState, false /*hasNullData*/),
+          commonTableID{common::INVALID_TABLE_ID} {}
+    InternalIDChunkData(MemoryManager& mm, bool enableCompression,
+        const ColumnChunkMetadata& metadata)
+        : ColumnChunkData{mm, common::LogicalType::INTERNAL_ID(), enableCompression, metadata,
+              false /*hasNullData*/},
+          commonTableID{common::INVALID_TABLE_ID} {}
+
+    void append(common::ValueVector* vector, const common::SelectionView& selView) override;
+
+    void copyVectorToBuffer(common::ValueVector* vector, common::offset_t startPosInChunk,
+        const common::SelectionView& selView) override;
+
+    void copyInt64VectorToBuffer(common::ValueVector* vector, common::offset_t startPosInChunk,
+        const common::SelectionView& selView) const;
+
+    void scan(common::ValueVector& output, common::offset_t offset, common::length_t length,
+        common::sel_t posInOutputVector = 0) const override;
+    void lookup(common::offset_t offsetInChunk, common::ValueVector& output,
+        common::sel_t posInOutputVector) const override;
+
+    void write(const common::ValueVector* vector, common::offset_t offsetInVector,
+        common::offset_t offsetInChunk) override;
+
+    void append(const ColumnChunkData* other, common::offset_t startPosInOtherChunk,
+        uint32_t numValuesToAppend) override;
+
+    void setTableID(common::table_id_t tableID) { commonTableID = tableID; }
+    common::table_id_t getTableID() const { return commonTableID; }
+
+    common::offset_t operator[](common::offset_t pos) const {
+        return getValue<common::offset_t>(pos);
+    }
+    common::offset_t& operator[](common::offset_t pos) { return getData<common::offset_t>()[pos]; }
+
+private:
+    common::table_id_t commonTableID;
+};
+
+struct ColumnChunkFactory {
+    static std::unique_ptr<ColumnChunkData> createColumnChunkData(MemoryManager& mm,
+        common::LogicalType dataType, bool enableCompression, uint64_t capacity,
+        ResidencyState residencyState, bool hasNullData = true, bool initializeToZero = true);
+    static std::unique_ptr<ColumnChunkData> createColumnChunkData(MemoryManager& mm,
+        common::LogicalType dataType, bool enableCompression, ColumnChunkMetadata& metadata,
+        bool hasNullData, bool initializeToZero);
+
+    static std::unique_ptr<ColumnChunkData> createNullChunkData(MemoryManager& mm,
+        bool enableCompression, uint64_t capacity, ResidencyState type) {
+        return std::make_unique<NullChunkData>(mm, capacity, enableCompression, type);
+    }
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_metadata.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_metadata.h
new file mode 100644
index 0000000000..e2dc38441c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_metadata.h
@@ -0,0 +1,81 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "storage/compression/compression.h"
+#include "storage/page_range.h"
+
+namespace lbug::storage {
+struct ColumnChunkMetadata {
+    PageRange pageRange;
+    uint64_t numValues;
+    CompressionMetadata compMeta;
+
+    common::page_idx_t getStartPageIdx() const { return pageRange.startPageIdx; }
+    common::page_idx_t getNumPages() const { return pageRange.numPages; }
+
+    // Returns the number of pages used to store data
+    // In the case of ALP compression, this does not include the number of pages used to store
+    // exceptions
+    common::page_idx_t getNumDataPages(common::PhysicalTypeID dataType) const;
+
+    void serialize(common::Serializer& serializer) const;
+    static ColumnChunkMetadata deserialize(common::Deserializer& deserializer);
+
+    // TODO(Guodong): Delete copy constructor.
+    ColumnChunkMetadata()
+        : pageRange(common::INVALID_PAGE_IDX, 0), numValues{0},
+          compMeta(StorageValue(), StorageValue(), CompressionType::CONSTANT) {}
+    ColumnChunkMetadata(common::page_idx_t pageIdx, common::page_idx_t numPages, uint64_t numValues,
+        const CompressionMetadata& compMeta)
+        : pageRange(pageIdx, numPages), numValues(numValues), compMeta(compMeta) {}
+};
+
+class GetCompressionMetadata {
+    std::shared_ptr<CompressionAlg> alg;
+    const common::LogicalType& dataType;
+
+public:
+    GetCompressionMetadata(std::shared_ptr<CompressionAlg> alg, const common::LogicalType& dataType)
+        : alg{std::move(alg)}, dataType{dataType} {}
+
+    GetCompressionMetadata(const GetCompressionMetadata& other) = default;
+
+    ColumnChunkMetadata operator()(std::span<const uint8_t> buffer, uint64_t numValues,
+        StorageValue min, StorageValue max) const;
+};
+
+class GetBitpackingMetadata {
+    std::shared_ptr<CompressionAlg> alg;
+    const common::LogicalType& dataType;
+
+public:
+    GetBitpackingMetadata(std::shared_ptr<CompressionAlg> alg, const common::LogicalType& dataType)
+        : alg{std::move(alg)}, dataType{dataType} {}
+
+    GetBitpackingMetadata(const GetBitpackingMetadata& other) = default;
+
+    ColumnChunkMetadata operator()(std::span<const uint8_t> buffer, uint64_t numValues,
+        StorageValue min, StorageValue max);
+};
+
+template<std::floating_point T>
+class GetFloatCompressionMetadata {
+    std::shared_ptr<CompressionAlg> alg;
+    const common::LogicalType& dataType;
+
+public:
+    GetFloatCompressionMetadata(std::shared_ptr<CompressionAlg> alg,
+        const common::LogicalType& dataType)
+        : alg{std::move(alg)}, dataType{dataType} {}
+
+    GetFloatCompressionMetadata(const GetFloatCompressionMetadata& other) = default;
+
+    ColumnChunkMetadata operator()(std::span<const uint8_t> buffer, uint64_t numValues,
+        StorageValue min, StorageValue max);
+};
+
+ColumnChunkMetadata uncompressedGetMetadata(common::PhysicalTypeID dataType, uint64_t numValues,
+    StorageValue min, StorageValue max);
+
+ColumnChunkMetadata booleanGetMetadata(uint64_t numValues, StorageValue min, StorageValue max);
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_scanner.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_scanner.h
new file mode 100644
index 0000000000..d4a04a077f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_scanner.h
@@ -0,0 +1,27 @@
+#pragma once
+
+#include <functional>
+
+#include "common/types/types.h"
+namespace lbug {
+namespace transaction {
+class Transaction;
+}
+namespace storage {
+class ColumnChunkData;
+class UpdateInfo;
+
+struct ColumnChunkScanner {
+    using scan_func_t = std::function<void(ColumnChunkData& /*outputChunk*/,
+        common::offset_t /*offsetInSegment*/, common::offset_t /*length*/)>;
+
+    virtual ~ColumnChunkScanner(){};
+    virtual void scanSegment(common::offset_t offsetInSegment, common::offset_t segmentLength,
+        scan_func_t scanFunc) = 0;
+    virtual void applyCommittedUpdates(const UpdateInfo& updateInfo,
+        const transaction::Transaction* transaction, common::offset_t startRow,
+        common::offset_t numRows) = 0;
+    virtual uint64_t getNumValues() = 0;
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_stats.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_stats.h
new file mode 100644
index 0000000000..0fb5cfc65c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_chunk_stats.h
@@ -0,0 +1,36 @@
+#pragma once
+
+#include "storage/compression/compression.h"
+namespace common {
+class ValueVector;
+}
+namespace lbug::storage {
+class ColumnChunkData;
+
+struct LBUG_API ColumnChunkStats {
+    std::optional<StorageValue> max;
+    std::optional<StorageValue> min;
+
+    void update(std::optional<StorageValue> min, std::optional<StorageValue> max,
+        common::PhysicalTypeID dataType);
+    void update(StorageValue val, common::PhysicalTypeID dataType);
+    void update(const common::ValueVector& valueVector, uint64_t offset, uint64_t numValues,
+        common::PhysicalTypeID physicalType);
+    void update(const ColumnChunkData& data, uint64_t offset, uint64_t numValues,
+        common::PhysicalTypeID physicalType);
+    void reset();
+};
+
+struct MergedColumnChunkStats {
+    MergedColumnChunkStats(ColumnChunkStats stats, bool guaranteedNoNulls, bool guaranteedAllNulls)
+        : stats(stats), guaranteedNoNulls(guaranteedNoNulls),
+          guaranteedAllNulls(guaranteedAllNulls) {}
+
+    ColumnChunkStats stats;
+    bool guaranteedNoNulls;
+    bool guaranteedAllNulls;
+
+    void merge(const MergedColumnChunkStats& o, common::PhysicalTypeID dataType);
+};
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_reader_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_reader_writer.h
new file mode 100644
index 0000000000..74f3fceb56
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/column_reader_writer.h
@@ -0,0 +1,91 @@
+#pragma once
+
+#include "storage/compression/float_compression.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+}
+namespace storage {
+
+class FileHandle;
+class ColumnReadWriter;
+class ShadowFile;
+struct ColumnChunkMetadata;
+struct SegmentState;
+
+template<typename OutputType>
+using read_value_from_page_func_t = std::function<void(uint8_t*, PageCursor&, OutputType, uint32_t,
+    uint64_t, const CompressionMetadata&)>;
+
+template<typename OutputType>
+using read_values_from_page_func_t = std::function<void(uint8_t*, PageCursor&, OutputType, uint32_t,
+    uint64_t, const CompressionMetadata&)>;
+
+using read_values_to_vector_func_t = read_values_from_page_func_t<common::ValueVector*>;
+using read_values_to_page_func_t = read_values_from_page_func_t<uint8_t*>;
+
+template<typename InputType, typename... AdditionalArgs>
+using write_values_to_page_func_t = std::function<void(uint8_t*, uint16_t, InputType, uint32_t,
+    common::offset_t, const CompressionMetadata&, AdditionalArgs...)>;
+
+using write_values_from_vector_func_t = write_values_to_page_func_t<common::ValueVector*>;
+
+using write_values_func_t = write_values_to_page_func_t<const uint8_t*, const common::NullMask*>;
+
+using filter_func_t = std::function<bool(common::offset_t, common::offset_t)>;
+
+struct ColumnReadWriterFactory {
+    static std::unique_ptr<ColumnReadWriter> createColumnReadWriter(common::PhysicalTypeID dataType,
+        FileHandle* dataFH, ShadowFile* shadowFile);
+};
+
+class ColumnReadWriter {
+public:
+    ColumnReadWriter(FileHandle* dataFH, ShadowFile* shadowFile);
+
+    virtual ~ColumnReadWriter() = default;
+
+    virtual void readCompressedValueToPage(const SegmentState& state, common::offset_t nodeOffset,
+        uint8_t* result, uint32_t offsetInResult,
+        const read_value_from_page_func_t<uint8_t*>& readFunc) = 0;
+
+    virtual void readCompressedValueToVector(const SegmentState& state, common::offset_t nodeOffset,
+        common::ValueVector* result, uint32_t offsetInResult,
+        const read_value_from_page_func_t<common::ValueVector*>& readFunc) = 0;
+
+    virtual uint64_t readCompressedValuesToPage(const SegmentState& state, uint8_t* result,
+        uint32_t startOffsetInResult, uint64_t startOffsetInSegment, uint64_t length,
+        const read_values_from_page_func_t<uint8_t*>& readFunc,
+        const std::optional<filter_func_t>& filterFunc = {}) = 0;
+
+    virtual uint64_t readCompressedValuesToVector(const SegmentState& state,
+        common::ValueVector* result, uint32_t startOffsetInResult, uint64_t startOffsetInSegment,
+        uint64_t length, const read_values_from_page_func_t<common::ValueVector*>& readFunc,
+        const std::optional<filter_func_t>& filterFunc = {}) = 0;
+
+    virtual void writeValueToPageFromVector(SegmentState& state, common::offset_t offsetInChunk,
+        common::ValueVector* vectorToWriteFrom, uint32_t posInVectorToWriteFrom,
+        const write_values_from_vector_func_t& writeFromVectorFunc) = 0;
+
+    virtual void writeValuesToPageFromBuffer(SegmentState& state, common::offset_t dstOffset,
+        const uint8_t* data, const common::NullMask* nullChunkData, common::offset_t srcOffset,
+        common::offset_t numValues, const write_values_func_t& writeFunc) = 0;
+
+    void readFromPage(common::page_idx_t pageIdx,
+        const std::function<void(uint8_t*)>& readFunc) const;
+
+    void updatePageWithCursor(PageCursor cursor,
+        const std::function<void(uint8_t*, common::offset_t)>& writeOp) const;
+
+protected:
+    static PageCursor getPageCursorForOffsetInGroup(common::offset_t offsetInChunk,
+        common::page_idx_t groupPageIdx, uint64_t numValuesPerPage);
+
+private:
+    FileHandle* dataFH;
+    ShadowFile* shadowFile;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/combined_chunk_scanner.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/combined_chunk_scanner.h
new file mode 100644
index 0000000000..1fe48f08cf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/combined_chunk_scanner.h
@@ -0,0 +1,30 @@
+#pragma once
+
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/column_chunk_scanner.h"
+#include "storage/table/update_info.h"
+namespace lbug {
+namespace storage {
+// Scans all the segments into a single output chunk
+struct CombinedChunkScanner : public ColumnChunkScanner {
+    explicit CombinedChunkScanner(ColumnChunkData& output)
+        : output(output), numValuesBeforeScan(output.getNumValues()) {}
+
+    void scanSegment(common::offset_t offsetInSegment, common::offset_t length,
+        scan_func_t scanFunc) override {
+        scanFunc(output, offsetInSegment, length);
+    }
+
+    void applyCommittedUpdates(const UpdateInfo& updateInfo,
+        const transaction::Transaction* transaction, common::offset_t startRow,
+        common::offset_t numRows) override {
+        updateInfo.scanCommitted(transaction, output, numValuesBeforeScan, startRow, numRows);
+    }
+
+    uint64_t getNumValues() override { return output.getNumValues(); }
+
+    ColumnChunkData& output;
+    common::offset_t numValuesBeforeScan;
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/compression_flush_buffer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/compression_flush_buffer.h
new file mode 100644
index 0000000000..126991c9b8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/compression_flush_buffer.h
@@ -0,0 +1,45 @@
+#pragma once
+
+#include "storage/compression/compression.h"
+#include "storage/table/column_chunk_metadata.h"
+
+namespace lbug::storage {
+class FileHandle;
+
+class CompressedFlushBuffer {
+    std::shared_ptr<CompressionAlg> alg;
+    common::PhysicalTypeID dataType;
+
+public:
+    CompressedFlushBuffer(std::shared_ptr<CompressionAlg> alg, common::PhysicalTypeID dataType)
+        : alg{std::move(alg)}, dataType{dataType} {}
+    CompressedFlushBuffer(std::shared_ptr<CompressionAlg> alg, const common::LogicalType& dataType)
+        : CompressedFlushBuffer(std::move(alg), dataType.getPhysicalType()) {}
+
+    CompressedFlushBuffer(const CompressedFlushBuffer& other) = default;
+
+    ColumnChunkMetadata operator()(std::span<const uint8_t> buffer, FileHandle* dataFH,
+        const PageRange& entry, const ColumnChunkMetadata& metadata) const;
+};
+
+template<std::floating_point T>
+class CompressedFloatFlushBuffer {
+    std::shared_ptr<CompressionAlg> alg;
+    common::PhysicalTypeID dataType;
+
+public:
+    CompressedFloatFlushBuffer(std::shared_ptr<CompressionAlg> alg,
+        common::PhysicalTypeID dataType);
+    CompressedFloatFlushBuffer(std::shared_ptr<CompressionAlg> alg,
+        const common::LogicalType& dataType);
+
+    CompressedFloatFlushBuffer(const CompressedFloatFlushBuffer& other) = default;
+
+    ColumnChunkMetadata operator()(std::span<const uint8_t> buffer, FileHandle* dataFH,
+        const PageRange& entry, const ColumnChunkMetadata& metadata) const;
+};
+
+ColumnChunkMetadata uncompressedFlushBuffer(std::span<const uint8_t> buffer, FileHandle* dataFH,
+    const PageRange& entry, const ColumnChunkMetadata& metadata);
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/csr_chunked_node_group.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/csr_chunked_node_group.h
new file mode 100644
index 0000000000..c750ad4af5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/csr_chunked_node_group.h
@@ -0,0 +1,215 @@
+#pragma once
+
+#include <algorithm>
+
+#include "storage/enums/residency_state.h"
+#include "storage/table/chunked_node_group.h"
+#include "storage/table/column_chunk.h"
+
+namespace lbug {
+namespace storage {
+class PageAllocator;
+class MemoryManager;
+
+struct CSRRegion {
+    common::idx_t regionIdx = common::INVALID_IDX;
+    common::idx_t level = common::INVALID_IDX;
+    common::offset_t leftNodeOffset = common::INVALID_OFFSET;
+    common::offset_t rightNodeOffset = common::INVALID_OFFSET;
+    int64_t sizeChange = 0;
+    // Track if there is any updates to persistent data in this region per column in table.
+    // Note: should be accessed with columnID.
+    std::vector<bool> hasUpdates;
+    // Note: `sizeChange` equal to 0 is not enough to indicate the region has no insert or
+    // delete. It might just be num of insertions are equal to num of deletions.
+    // hasInsertions is true if there are insertions that are not deleted yet in this region.
+    bool hasInsertions = false;
+    bool hasPersistentDeletions = false;
+
+    CSRRegion(common::idx_t regionIdx, common::idx_t level);
+
+    bool needCheckpoint() const {
+        return hasInsertions || hasPersistentDeletions ||
+               std::any_of(hasUpdates.begin(), hasUpdates.end(),
+                   [](bool hasUpdate) { return hasUpdate; });
+    }
+    bool needCheckpointColumn(common::column_id_t columnID) const {
+        KU_ASSERT(columnID < hasUpdates.size());
+        return hasInsertions || hasPersistentDeletions || hasUpdates[columnID];
+    }
+    bool hasDeletionsOrInsertions() const { return hasInsertions || hasPersistentDeletions; }
+    common::idx_t getLeftLeafRegionIdx() const { return regionIdx << level; }
+    common::idx_t getRightLeafRegionIdx() const {
+        const auto rightRegionIdx =
+            getLeftLeafRegionIdx() + (static_cast<common::idx_t>(1) << level) - 1;
+        constexpr auto maxNumRegions =
+            common::StorageConfig::NODE_GROUP_SIZE / common::StorageConfig::CSR_LEAF_REGION_SIZE;
+        if (rightRegionIdx >= maxNumRegions) {
+            return maxNumRegions - 1;
+        }
+        return rightRegionIdx;
+    }
+    // Return true if other is within the realm of this region.
+    bool isWithin(const CSRRegion& other) const;
+
+    static CSRRegion upgradeLevel(const std::vector<CSRRegion>& leafRegions,
+        const CSRRegion& region);
+};
+
+struct LBUG_API InMemChunkedCSRHeader {
+    std::unique_ptr<ColumnChunkData> offset;
+    std::unique_ptr<ColumnChunkData> length;
+    bool randomLookup = false;
+
+    InMemChunkedCSRHeader(MemoryManager& memoryManager, bool enableCompression, uint64_t capacity);
+    InMemChunkedCSRHeader(std::unique_ptr<ColumnChunkData> offset,
+        std::unique_ptr<ColumnChunkData> length)
+        : offset{std::move(offset)}, length{std::move(length)} {
+        KU_ASSERT(this->offset && this->length);
+    }
+
+    common::offset_t getStartCSROffset(common::offset_t nodeOffset) const;
+    common::offset_t getEndCSROffset(common::offset_t nodeOffset) const;
+    common::length_t getCSRLength(common::offset_t nodeOffset) const;
+    common::length_t getGapSize(common::length_t length) const;
+
+    bool sanityCheck() const;
+    void copyFrom(const InMemChunkedCSRHeader& other) const;
+    void fillDefaultValues(common::offset_t newNumValues) const;
+    void setNumValues(const common::offset_t numValues) const {
+        offset->setNumValues(numValues);
+        length->setNumValues(numValues);
+    }
+
+    // Return a vector of CSR offsets for the end of each CSR region.
+    common::offset_vec_t populateStartCSROffsetsFromLength(bool leaveGaps) const;
+    void populateEndCSROffsetFromStartAndLength() const;
+    void finalizeCSRRegionEndOffsets(const common::offset_vec_t& rightCSROffsetOfRegions) const;
+    void populateRegionCSROffsets(const CSRRegion& region,
+        const InMemChunkedCSRHeader& oldHeader) const;
+    void populateEndCSROffsets(const common::offset_vec_t& gaps) const;
+    common::idx_t getNumRegions() const;
+
+private:
+    static common::length_t computeGapFromLength(common::length_t length);
+};
+
+struct ChunkedCSRHeader {
+    std::unique_ptr<ColumnChunk> offset;
+    std::unique_ptr<ColumnChunk> length;
+    bool randomLookup = false;
+
+    ChunkedCSRHeader(MemoryManager& memoryManager, bool enableCompression, uint64_t capacity,
+        ResidencyState residencyState);
+    ChunkedCSRHeader(bool enableCompression, InMemChunkedCSRHeader&& other)
+        : offset{std::make_unique<ColumnChunk>(enableCompression, std::move(other.offset))},
+          length{std::make_unique<ColumnChunk>(enableCompression, std::move(other.length))},
+          randomLookup{other.randomLookup} {}
+    ChunkedCSRHeader(std::unique_ptr<ColumnChunk> offset, std::unique_ptr<ColumnChunk> length)
+        : offset{std::move(offset)}, length{std::move(length)} {
+        KU_ASSERT(this->offset && this->length);
+    }
+
+    common::offset_t getStartCSROffset(common::offset_t nodeOffset) const;
+    common::offset_t getEndCSROffset(common::offset_t nodeOffset) const;
+    common::length_t getCSRLength(common::offset_t nodeOffset) const;
+    common::length_t getGapSize(common::length_t length) const;
+
+    bool sanityCheck() const;
+
+    // Return a vector of CSR offsets for the end of each CSR region.
+    common::offset_vec_t populateStartCSROffsetsFromLength(bool leaveGaps) const;
+    void populateEndCSROffsetFromStartAndLength() const;
+    void finalizeCSRRegionEndOffsets(const common::offset_vec_t& rightCSROffsetOfRegions) const;
+    void populateRegionCSROffsets(const CSRRegion& region, const ChunkedCSRHeader& oldHeader) const;
+    void populateEndCSROffsets(const common::offset_vec_t& gaps) const;
+    common::idx_t getNumRegions() const;
+
+private:
+    static common::length_t computeGapFromLength(common::length_t length);
+};
+
+class InMemChunkedCSRNodeGroup;
+
+struct CSRNodeGroupCheckpointState;
+class ChunkedCSRNodeGroup final : public ChunkedNodeGroup {
+    friend class InMemChunkedCSRNodeGroup;
+
+public:
+    ChunkedCSRNodeGroup(MemoryManager& mm, const std::vector<common::LogicalType>& columnTypes,
+        bool enableCompression, uint64_t capacity, common::offset_t startOffset,
+        ResidencyState residencyState)
+        : ChunkedNodeGroup{mm, columnTypes, enableCompression, capacity, startOffset,
+              residencyState, NodeGroupDataFormat::CSR},
+          csrHeader{mm, enableCompression, common::StorageConfig::NODE_GROUP_SIZE, residencyState} {
+    }
+    ChunkedCSRNodeGroup(InMemChunkedCSRNodeGroup& base,
+        const std::vector<common::column_id_t>& selectedColumns);
+    ChunkedCSRNodeGroup(ChunkedCSRNodeGroup& base,
+        const std::vector<common::column_id_t>& selectedColumns)
+        : ChunkedNodeGroup{base, selectedColumns}, csrHeader{std::move(base.csrHeader)} {}
+    ChunkedCSRNodeGroup(MemoryManager& mm, ChunkedCSRNodeGroup& base,
+        std::span<const common::LogicalType> columnTypes,
+        std::span<const common::column_id_t> baseColumnIDs)
+        : ChunkedNodeGroup(mm, base, columnTypes, baseColumnIDs),
+          csrHeader(std::move(base.csrHeader)) {}
+    ChunkedCSRNodeGroup(ChunkedCSRHeader csrHeader,
+        std::vector<std::unique_ptr<ColumnChunk>> chunks, common::row_idx_t startRowIdx)
+        : ChunkedNodeGroup{std::move(chunks), startRowIdx, NodeGroupDataFormat::CSR},
+          csrHeader{std::move(csrHeader)} {}
+
+    ChunkedCSRHeader& getCSRHeader() { return csrHeader; }
+    const ChunkedCSRHeader& getCSRHeader() const { return csrHeader; }
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<ChunkedCSRNodeGroup> deserialize(MemoryManager& memoryManager,
+        common::Deserializer& deSer);
+
+    void scanCSRHeader(MemoryManager& memoryManager, CSRNodeGroupCheckpointState& csrState) const;
+
+    void reclaimStorage(PageAllocator& pageAllocator) const override;
+
+private:
+    ChunkedCSRHeader csrHeader;
+};
+
+class InMemChunkedCSRNodeGroup final : public InMemChunkedNodeGroup {
+    friend class ChunkedCSRNodeGroup;
+
+public:
+    InMemChunkedCSRNodeGroup(MemoryManager& mm, const std::vector<common::LogicalType>& columnTypes,
+        bool enableCompression, uint64_t capacity, common::offset_t startOffset)
+        : InMemChunkedNodeGroup{mm, columnTypes, enableCompression, capacity, startOffset},
+          csrHeader{mm, enableCompression, common::StorageConfig::NODE_GROUP_SIZE} {}
+
+    InMemChunkedCSRNodeGroup(InMemChunkedCSRNodeGroup& base,
+        const std::vector<common::column_id_t>& selectedColumns)
+        : InMemChunkedNodeGroup{base, selectedColumns}, csrHeader{std::move(base.csrHeader)} {}
+
+    InMemChunkedCSRHeader& getCSRHeader() { return csrHeader; }
+    const InMemChunkedCSRHeader& getCSRHeader() const { return csrHeader; }
+
+    // this does not override ChunkedNodeGroup::merge() since clang-tidy analyzer
+    // seems to struggle with detecting the std::move of the header unless this is inlined
+    void mergeChunkedCSRGroup(InMemChunkedCSRNodeGroup& base,
+        const std::vector<common::column_id_t>& columnsToMergeInto) {
+        InMemChunkedNodeGroup::merge(base, columnsToMergeInto);
+        csrHeader = InMemChunkedCSRHeader(std::move(base.csrHeader.offset),
+            std::move(base.csrHeader.length));
+    }
+
+    void writeToColumnChunk(common::idx_t chunkIdx, common::idx_t vectorIdx,
+        const std::vector<std::unique_ptr<ColumnChunkData>>& data,
+        ColumnChunkData& offsetChunk) override {
+        chunks[chunkIdx]->write(data[vectorIdx].get(), &offsetChunk, common::RelMultiplicity::MANY);
+    }
+
+    std::unique_ptr<ChunkedNodeGroup> flush(transaction::Transaction* transaction,
+        PageAllocator& pageAllocator) override;
+
+private:
+    InMemChunkedCSRHeader csrHeader;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/csr_node_group.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/csr_node_group.h
new file mode 100644
index 0000000000..c797779b8f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/csr_node_group.h
@@ -0,0 +1,291 @@
+#pragma once
+
+#include <array>
+#include <bitset>
+
+#include "common/constants.h"
+#include "common/system_config.h"
+#include "storage/enums/csr_node_group_scan_source.h"
+#include "storage/table/csr_chunked_node_group.h"
+#include "storage/table/node_group.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+}
+namespace storage {
+class MemoryManager;
+
+using row_idx_vec_t = std::vector<common::row_idx_t>;
+
+struct csr_list_t {
+    common::row_idx_t startRow = common::INVALID_ROW_IDX;
+    common::length_t length = 0;
+};
+
+// Store rows of a CSR list.
+// If rows of the CSR list are stored in a sequential order, then `isSequential` is set to true.
+// rowIndices consists of startRowIdx and length.
+// Otherwise, rowIndices records the row indices of each row in the CSR list.
+struct NodeCSRIndex {
+    // TODO(Guodong): Should seperate `isSequential` and `rowIndices` to two different data
+    // structures. so the struct can be more space efficient.
+    bool isSequential = false;
+    row_idx_vec_t rowIndices; // TODO(Guodong): Should optimze the vector to a more space-efficient
+                              // data structure.
+
+    bool isEmpty() const { return getNumRows() == 0; }
+    common::row_idx_t getNumRows() const {
+        if (isSequential) {
+            return rowIndices[1];
+        }
+        return rowIndices.size();
+    }
+    row_idx_vec_t getRows() const {
+        if (isSequential) {
+            row_idx_vec_t result;
+            result.reserve(rowIndices[1]);
+            for (common::row_idx_t i = 0u; i < rowIndices[1]; ++i) {
+                result.push_back(i + rowIndices[0]);
+            }
+            return result;
+        }
+        return rowIndices;
+    }
+
+    void clear() {
+        isSequential = false;
+        rowIndices.clear();
+    }
+
+    void turnToNonSequential() {
+        if (isSequential) {
+            row_idx_vec_t newIndices;
+            newIndices.reserve(rowIndices[1]);
+            for (common::row_idx_t i = 0u; i < rowIndices[1]; ++i) {
+                newIndices.push_back(i + rowIndices[0]);
+            }
+            rowIndices = std::move(newIndices);
+            isSequential = false;
+        }
+    }
+    void setInvalid(common::idx_t idx) {
+        KU_ASSERT(!isSequential);
+        KU_ASSERT(idx < rowIndices.size());
+        rowIndices[idx] = common::INVALID_ROW_IDX;
+    }
+};
+
+// TODO(Guodong): Split CSRIndex into two levels: one level per csr leaf region, another per node
+// under the leaf region. This should be more space efficient.
+struct CSRIndex {
+    std::array<NodeCSRIndex, common::StorageConfig::NODE_GROUP_SIZE> indices;
+
+    common::row_idx_t getNumRows(common::offset_t offset) const {
+        return indices[offset].getNumRows();
+    }
+
+    common::offset_t getMaxOffsetWithRels() const {
+        common::offset_t maxOffset = 0;
+        for (auto i = 0u; i < indices.size(); i++) {
+            if (!indices[i].isEmpty()) {
+                maxOffset = i;
+            }
+        }
+        return maxOffset;
+    }
+};
+
+// TODO(Guodong): Serialize the info to disk. This should be a config per node group.
+struct PackedCSRInfo {
+    static_assert(common::StorageConfig::NODE_GROUP_SIZE_LOG2 >
+                  common::StorageConfig::CSR_LEAF_REGION_SIZE_LOG2);
+    uint64_t calibratorTreeHeight = common::StorageConfig::NODE_GROUP_SIZE_LOG2 -
+                                    common::StorageConfig::CSR_LEAF_REGION_SIZE_LOG2;
+    double highDensityStep = (common::StorageConstants::LEAF_HIGH_CSR_DENSITY -
+                                 common::StorageConstants::PACKED_CSR_DENSITY) /
+                             static_cast<double>(calibratorTreeHeight);
+
+    constexpr PackedCSRInfo() noexcept = default;
+};
+
+class CSRNodeGroup;
+struct RelTableScanState;
+struct CSRNodeGroupScanState final : NodeGroupScanState {
+    // Cached offsets and lengths for a sequence of CSR lists within the current vector of
+    // boundNodes.
+    std::unique_ptr<InMemChunkedCSRHeader> header;
+
+    std::optional<std::bitset<common::DEFAULT_VECTOR_CAPACITY>> cachedScannedVectorsSelBitset;
+    // The total number of rows (i.e., rels) in the current node group.
+    common::row_idx_t numTotalRows;
+    // The number of rows (i.e., rels) that have been scanned so far in current node group.
+    common::row_idx_t numCachedRows;
+    common::row_idx_t nextCachedRowToScan;
+
+    // States at the csr list level. Cached during scan over a single csr list.
+    NodeCSRIndex inMemCSRList;
+
+    CSRNodeGroupScanSource source;
+
+    // This is for local scan state where we don't need `header`.
+    explicit CSRNodeGroupScanState()
+        : header{nullptr}, numTotalRows{0}, numCachedRows{0}, nextCachedRowToScan{0},
+          source{CSRNodeGroupScanSource::COMMITTED_PERSISTENT} {}
+    explicit CSRNodeGroupScanState(common::idx_t numChunks)
+        : NodeGroupScanState{numChunks}, header{nullptr}, numTotalRows{0}, numCachedRows{0},
+          nextCachedRowToScan{0}, source{CSRNodeGroupScanSource::COMMITTED_PERSISTENT} {}
+    explicit CSRNodeGroupScanState(MemoryManager& mm, bool randomLookup = false)
+        : numTotalRows{0}, numCachedRows{0}, nextCachedRowToScan{0},
+          source{CSRNodeGroupScanSource::COMMITTED_PERSISTENT} {
+        header = std::make_unique<InMemChunkedCSRHeader>(mm, false,
+            randomLookup ? 1 : common::StorageConfig::NODE_GROUP_SIZE);
+    }
+
+    bool tryScanCachedTuples(RelTableScanState& tableScanState);
+};
+
+struct CSRNodeGroupCheckpointState final : NodeGroupCheckpointState {
+    Column* csrOffsetColumn;
+    Column* csrLengthColumn;
+
+    std::unique_ptr<InMemChunkedCSRHeader> oldHeader;
+    std::unique_ptr<InMemChunkedCSRHeader> newHeader;
+
+    CSRNodeGroupCheckpointState(std::vector<common::column_id_t> columnIDs,
+        std::vector<Column*> columns, PageAllocator& pageAllocator, MemoryManager* mm,
+        Column* csrOffsetCol, Column* csrLengthCol)
+        : NodeGroupCheckpointState{std::move(columnIDs), std::move(columns), pageAllocator, mm},
+          csrOffsetColumn{csrOffsetCol}, csrLengthColumn{csrLengthCol} {}
+};
+
+static constexpr common::column_id_t NBR_ID_COLUMN_ID = 0;
+static constexpr common::column_id_t REL_ID_COLUMN_ID = 1;
+
+// Data in a CSRNodeGroup is organized as follows:
+// - persistent data: checkpointed data or flushed data from batch insert. `persistentChunkGroup`.
+// - transient data: data that is being committed but kept in memory. `chunkedGroups`.
+// Persistent data are organized in CSR format.
+// Transient data are organized similar to normal node groups. Tuples are always appended to the end
+// of `chunkedGroups`. We keep an extra csrIndex to track the vector of row indices for each bound
+// node.
+class CSRNodeGroup final : public NodeGroup {
+public:
+    static constexpr PackedCSRInfo DEFAULT_PACKED_CSR_INFO{};
+
+    CSRNodeGroup(MemoryManager& mm, const common::node_group_idx_t nodeGroupIdx,
+        const bool enableCompression, std::vector<common::LogicalType> dataTypes)
+        : NodeGroup{mm, nodeGroupIdx, enableCompression, std::move(dataTypes),
+              common::INVALID_OFFSET, NodeGroupDataFormat::CSR} {}
+    CSRNodeGroup(MemoryManager& mm, const common::node_group_idx_t nodeGroupIdx,
+        const bool enableCompression, std::unique_ptr<ChunkedNodeGroup> chunkedNodeGroup)
+        : NodeGroup{mm, nodeGroupIdx, enableCompression, common::INVALID_OFFSET,
+              NodeGroupDataFormat::CSR},
+          persistentChunkGroup{std::move(chunkedNodeGroup)} {
+        for (auto i = 0u; i < persistentChunkGroup->getNumColumns(); i++) {
+            dataTypes.push_back(persistentChunkGroup->getColumnChunk(i).getDataType().copy());
+        }
+    }
+
+    void initializeScanState(const transaction::Transaction* transaction,
+        TableScanState& state) const override;
+    NodeGroupScanResult scan(const transaction::Transaction* transaction,
+        TableScanState& state) const override;
+
+    void appendChunkedCSRGroup(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, InMemChunkedCSRNodeGroup& chunkedGroup);
+    void append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, common::offset_t boundOffsetInGroup,
+        std::span<const ColumnChunk*> chunks, common::row_idx_t startRowInChunks,
+        common::row_idx_t numRows);
+
+    void update(const transaction::Transaction* transaction, CSRNodeGroupScanSource source,
+        common::row_idx_t rowIdxInGroup, common::column_id_t columnID,
+        const common::ValueVector& propertyVector);
+    bool delete_(const transaction::Transaction* transaction, CSRNodeGroupScanSource source,
+        common::row_idx_t rowIdxInGroup);
+
+    void addColumn(TableAddColumnState& addColumnState, PageAllocator* pageAllocator,
+        ColumnStats* newColumnStats) override;
+
+    void checkpoint(MemoryManager& memoryManager, NodeGroupCheckpointState& state) override;
+    void reclaimStorage(PageAllocator& pageAllocator, const common::UniqLock& lock) const override;
+
+    bool isEmpty() const override { return !persistentChunkGroup && NodeGroup::isEmpty(); }
+
+    ChunkedNodeGroup* getPersistentChunkedGroup() const { return persistentChunkGroup.get(); }
+    void setPersistentChunkedGroup(std::unique_ptr<ChunkedNodeGroup> chunkedNodeGroup) {
+        KU_ASSERT(chunkedNodeGroup->getFormat() == NodeGroupDataFormat::CSR);
+        persistentChunkGroup = std::move(chunkedNodeGroup);
+    }
+
+    void serialize(common::Serializer& serializer) override;
+
+private:
+    void initScanForCommittedPersistent(const transaction::Transaction* transaction,
+        RelTableScanState& relScanState, CSRNodeGroupScanState& nodeGroupScanState) const;
+    static void initScanForCommittedInMem(RelTableScanState& relScanState,
+        CSRNodeGroupScanState& nodeGroupScanState);
+
+    void updateCSRIndex(common::offset_t boundNodeOffsetInGroup, common::row_idx_t startRow,
+        common::length_t length) const;
+
+    NodeGroupScanResult scanCommittedPersistent(const transaction::Transaction* transaction,
+        RelTableScanState& tableState, CSRNodeGroupScanState& nodeGroupScanState) const;
+    NodeGroupScanResult scanCommittedPersistentWithCache(
+        const transaction::Transaction* transaction, RelTableScanState& tableState,
+        CSRNodeGroupScanState& nodeGroupScanState) const;
+    NodeGroupScanResult scanCommittedPersistentWithoutCache(
+        const transaction::Transaction* transaction, RelTableScanState& tableState,
+        CSRNodeGroupScanState& nodeGroupScanState) const;
+
+    NodeGroupScanResult scanCommittedInMem(const transaction::Transaction* transaction,
+        RelTableScanState& tableState, CSRNodeGroupScanState& nodeGroupScanState) const;
+    NodeGroupScanResult scanCommittedInMemSequential(const transaction::Transaction* transaction,
+        const RelTableScanState& tableState, CSRNodeGroupScanState& nodeGroupScanState) const;
+    NodeGroupScanResult scanCommittedInMemRandom(const transaction::Transaction* transaction,
+        const RelTableScanState& tableState, CSRNodeGroupScanState& nodeGroupScanState) const;
+
+    void checkpointInMemOnly(const common::UniqLock& lock, NodeGroupCheckpointState& state);
+    void checkpointInMemAndOnDisk(const common::UniqLock& lock, NodeGroupCheckpointState& state);
+
+    void populateCSRLengthInMemOnly(const common::UniqLock& lock, common::offset_t numNodes,
+        const CSRNodeGroupCheckpointState& csrState);
+
+    void collectRegionChangesAndUpdateHeaderLength(const common::UniqLock& lock, CSRRegion& region,
+        const CSRNodeGroupCheckpointState& csrState) const;
+    void collectInMemRegionChangesAndUpdateHeaderLength(const common::UniqLock& lock,
+        CSRRegion& region, const CSRNodeGroupCheckpointState& csrState) const;
+    void collectOnDiskRegionChangesAndUpdateHeaderLength(const common::UniqLock& lock,
+        CSRRegion& region, const CSRNodeGroupCheckpointState& csrState) const;
+
+    std::vector<CSRRegion> collectLeafRegionsAndCSRLength(const common::UniqLock& lock,
+        const CSRNodeGroupCheckpointState& csrState) const;
+    void collectPersistentUpdatesInRegion(CSRRegion& region,
+        const CSRNodeGroupCheckpointState& csrState) const;
+
+    common::row_idx_t getNumDeletionsForNodeInPersistentData(common::offset_t nodeOffset,
+        const CSRNodeGroupCheckpointState& csrState) const;
+
+    static void redistributeCSRRegions(const CSRNodeGroupCheckpointState& csrState,
+        const std::vector<CSRRegion>& leafRegions);
+    static std::vector<CSRRegion> mergeRegionsToCheckpoint(
+        const CSRNodeGroupCheckpointState& csrState, const std::vector<CSRRegion>& leafRegions);
+    static bool isWithinDensityBound(const InMemChunkedCSRHeader& header,
+        const std::vector<CSRRegion>& leafRegions, const CSRRegion& region);
+
+    void checkpointColumn(const common::UniqLock& lock, common::column_id_t columnID,
+        const CSRNodeGroupCheckpointState& csrState, const std::vector<CSRRegion>& regions) const;
+    std::vector<ChunkCheckpointState> checkpointColumnInRegion(const common::UniqLock& lock,
+        common::column_id_t columnID, const CSRNodeGroupCheckpointState& csrState,
+        const CSRRegion& region) const;
+    void checkpointCSRHeaderColumns(const CSRNodeGroupCheckpointState& csrState) const;
+    void finalizeCheckpoint(const common::UniqLock& lock);
+
+private:
+    std::unique_ptr<ChunkedNodeGroup> persistentChunkGroup;
+    std::unique_ptr<CSRIndex> csrIndex;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/dictionary_chunk.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/dictionary_chunk.h
new file mode 100644
index 0000000000..271e069165
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/dictionary_chunk.h
@@ -0,0 +1,93 @@
+#pragma once
+
+#include "storage/enums/residency_state.h"
+#include "storage/table/column_chunk_data.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+
+class DictionaryChunk {
+public:
+    using string_offset_t = uint64_t;
+    using string_index_t = uint32_t;
+
+    DictionaryChunk(MemoryManager& mm, uint64_t capacity, bool enableCompression,
+        ResidencyState residencyState);
+    // A pointer to the dictionary chunk is stored in the StringOps for the indexTable
+    // and can't be modified easily. Moving would invalidate that pointer
+    DictionaryChunk(DictionaryChunk&& other) = delete;
+
+    void setToInMemory() {
+        stringDataChunk->setToInMemory();
+        offsetChunk->setToInMemory();
+        indexTable.clear();
+    }
+    void resetToEmpty();
+
+    uint64_t getStringLength(string_index_t index) const;
+
+    string_index_t appendString(std::string_view val);
+
+    std::string_view getString(string_index_t index) const;
+
+    ColumnChunkData* getStringDataChunk() const { return stringDataChunk.get(); }
+    ColumnChunkData* getOffsetChunk() const { return offsetChunk.get(); }
+    void setOffsetChunk(std::unique_ptr<ColumnChunkData> chunk) { offsetChunk = std::move(chunk); }
+    void setStringDataChunk(std::unique_ptr<ColumnChunkData> chunk) {
+        stringDataChunk = std::move(chunk);
+    }
+
+    void resetNumValuesFromMetadata();
+
+    bool sanityCheck() const;
+
+    uint64_t getEstimatedMemoryUsage() const;
+
+    void serialize(common::Serializer& serializer) const;
+    static std::unique_ptr<DictionaryChunk> deserialize(MemoryManager& memoryManager,
+        common::Deserializer& deSer);
+
+    void flush(PageAllocator& pageAllocator);
+
+private:
+    bool enableCompression;
+    // String data is stored as a UINT8 chunk, using the numValues in the chunk to track the number
+    // of characters stored.
+    std::unique_ptr<ColumnChunkData> stringDataChunk;
+    std::unique_ptr<ColumnChunkData> offsetChunk;
+
+    struct DictionaryEntry {
+        string_index_t index;
+
+        std::string_view get(const DictionaryChunk& dict) const { return dict.getString(index); }
+    };
+
+    struct StringOps {
+        explicit StringOps(const DictionaryChunk* dict) : dict(dict) {}
+        const DictionaryChunk* dict;
+        using hash_type = std::hash<std::string_view>;
+        using is_transparent = void;
+
+        std::size_t operator()(const DictionaryEntry& entry) const {
+            return std::hash<std::string_view>()(entry.get(*dict));
+        }
+        std::size_t operator()(const char* str) const { return hash_type{}(str); }
+        std::size_t operator()(std::string_view str) const { return hash_type{}(str); }
+        std::size_t operator()(std::string const& str) const { return hash_type{}(str); }
+
+        bool operator()(const DictionaryEntry& lhs, const DictionaryEntry& rhs) const {
+            return lhs.get(*dict) == rhs.get(*dict);
+        }
+        bool operator()(const DictionaryEntry& lhs, std::string_view rhs) const {
+            return lhs.get(*dict) == rhs;
+        }
+        bool operator()(std::string_view lhs, const DictionaryEntry& rhs) const {
+            return lhs == rhs.get(*dict);
+        }
+    };
+
+    std::unordered_set<DictionaryEntry, StringOps /*hash*/, StringOps /*equals*/> indexTable;
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/dictionary_column.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/dictionary_column.h
new file mode 100644
index 0000000000..ad2f8110eb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/dictionary_column.h
@@ -0,0 +1,56 @@
+#pragma once
+
+#include "dictionary_chunk.h"
+#include "storage/table/column.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/string_chunk_data.h"
+
+namespace lbug {
+namespace storage {
+
+class DictionaryColumn {
+public:
+    DictionaryColumn(const std::string& name, FileHandle* dataFH, MemoryManager* mm,
+        ShadowFile* shadowFile, bool enableCompression);
+
+    void scan(const SegmentState& state, DictionaryChunk& dictChunk) const;
+    // Offsets to scan should be a sorted list of pairs mapping the index of the entry in the string
+    // dictionary (as read from the index column) to the output index in the result vector to store
+    // the string.
+    template<class Result>
+    void scan(const SegmentState& offsetState, const SegmentState& dataState,
+        std::vector<std::pair<DictionaryChunk::string_index_t, uint64_t>>& offsetsToScan,
+        Result* result, const ColumnChunkMetadata& indexMeta) const;
+
+    DictionaryChunk::string_index_t append(const DictionaryChunk& dictChunk, SegmentState& state,
+        std::string_view val) const;
+
+    bool canCommitInPlace(const SegmentState& state, uint64_t numNewStrings,
+        uint64_t totalStringLengthToAdd) const;
+
+    Column* getDataColumn() const { return dataColumn.get(); }
+    Column* getOffsetColumn() const { return offsetColumn.get(); }
+
+private:
+    void scanOffsets(const SegmentState& state, DictionaryChunk::string_offset_t* offsets,
+        uint64_t index, uint64_t numValues, uint64_t dataSize) const;
+    void scanValue(const SegmentState& dataState, uint64_t startOffset, uint64_t endOffset,
+        StringChunkData* result, uint64_t offsetInVector) const;
+    void scanValue(const SegmentState& dataState, uint64_t startOffset, uint64_t endOffset,
+        common::ValueVector* resultVector, uint64_t offsetInVector) const;
+
+    static bool canDataCommitInPlace(const SegmentState& dataState,
+        uint64_t totalStringLengthToAdd);
+    bool canOffsetCommitInPlace(const SegmentState& offsetState, const SegmentState& dataState,
+        uint64_t numNewStrings, uint64_t totalStringLengthToAdd) const;
+
+private:
+    // The offset column stores the offsets for each index, and the data column stores the data in
+    // order. Values are never removed from the dictionary during in-place updates, only appended to
+    // the end.
+    std::unique_ptr<Column> dataColumn;
+    std::unique_ptr<Column> offsetColumn;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/group_collection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/group_collection.h
new file mode 100644
index 0000000000..d9d5db35ed
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/group_collection.h
@@ -0,0 +1,139 @@
+#pragma once
+
+#include <algorithm>
+#include <vector>
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/types/types.h"
+#include "common/uniq_lock.h"
+#include "common/utils.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+
+template<class T>
+class GroupCollection {
+public:
+    GroupCollection() {}
+
+    common::UniqLock lock() const { return common::UniqLock{mtx}; }
+
+    void deserializeGroups(MemoryManager& memoryManager, common::Deserializer& deSer,
+        const std::vector<common::LogicalType>& columnTypes) {
+        auto lockGuard = lock();
+        deSer.deserializeVectorOfPtrs<T>(groups, [&](common::Deserializer& deser) {
+            return T::deserialize(memoryManager, deser, columnTypes);
+        });
+    }
+
+    void removeTrailingGroups([[maybe_unused]] const common::UniqLock& lock,
+        common::idx_t numGroupsToRemove) {
+        KU_ASSERT(lock.isLocked());
+        KU_ASSERT(numGroupsToRemove <= groups.size());
+        groups.erase(groups.end() - numGroupsToRemove, groups.end());
+    }
+
+    void serializeGroups(common::Serializer& ser) {
+        auto lockGuard = lock();
+        ser.serializeVectorOfPtrs<T>(groups);
+    }
+
+    void appendGroup(const common::UniqLock& lock, std::unique_ptr<T> group) {
+        KU_ASSERT(group);
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        groups.push_back(std::move(group));
+    }
+    T* getGroup(const common::UniqLock& lock, common::idx_t groupIdx) const {
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        KU_ASSERT(groupIdx < groups.size());
+        return groups[groupIdx].get();
+    }
+    T* getGroupNoLock(common::idx_t groupIdx) const {
+        KU_ASSERT(groupIdx < groups.size());
+        return groups[groupIdx].get();
+    }
+    void replaceGroup(const common::UniqLock& lock, common::idx_t groupIdx,
+        std::unique_ptr<T> group) {
+        KU_ASSERT(group);
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        if (groupIdx >= groups.size()) {
+            groups.resize(groupIdx + 1);
+        }
+        groups[groupIdx] = std::move(group);
+    }
+
+    void resize(const common::UniqLock& lock, common::idx_t newSize) {
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        if (newSize <= groups.size()) {
+            return;
+        }
+        groups.resize(newSize);
+    }
+
+    bool isEmpty(const common::UniqLock& lock) const {
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        return groups.empty();
+    }
+    common::idx_t getNumGroups(const common::UniqLock& lock) const {
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        return groups.size();
+    }
+    common::idx_t getNumGroupsNoLock() const { return groups.size(); }
+
+    const std::vector<std::unique_ptr<T>>& getAllGroups(const common::UniqLock& lock) const {
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        return groups;
+    }
+    T* getFirstGroup(const common::UniqLock& lock) const {
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        if (groups.empty()) {
+            return nullptr;
+        }
+        return groups.front().get();
+    }
+    T* getFirstGroupNoLock() const {
+        if (groups.empty()) {
+            return nullptr;
+        }
+        return groups.front().get();
+    }
+    T* getLastGroup(const common::UniqLock& lock) const {
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        if (groups.empty()) {
+            return nullptr;
+        }
+        return groups.back().get();
+    }
+
+    void clear(const common::UniqLock& lock) {
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        groups.clear();
+    }
+
+    common::idx_t getNumEmptyTrailingGroups(const common::UniqLock& lock) {
+        const auto& groupsVector = getAllGroups(lock);
+        return common::safeIntegerConversion<common::idx_t>(
+            std::find_if(groupsVector.rbegin(), groupsVector.rend(),
+                [](const auto& group) { return (group->getNumRows() != 0); }) -
+            groupsVector.rbegin());
+    }
+
+private:
+    mutable std::mutex mtx;
+    std::vector<std::unique_ptr<T>> groups;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/in_mem_chunked_node_group_collection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/in_mem_chunked_node_group_collection.h
new file mode 100644
index 0000000000..bbb5772940
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/in_mem_chunked_node_group_collection.h
@@ -0,0 +1,55 @@
+#pragma once
+
+#include "storage/table/chunked_node_group.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace storage {
+
+class LBUG_API InMemChunkedNodeGroupCollection {
+public:
+    explicit InMemChunkedNodeGroupCollection(std::vector<common::LogicalType> types)
+        : types{std::move(types)} {}
+    DELETE_BOTH_COPY(InMemChunkedNodeGroupCollection);
+
+    static std::pair<uint64_t, common::offset_t> getChunkIdxAndOffsetInChunk(
+        common::row_idx_t rowIdx) {
+        return std::make_pair(rowIdx / common::StorageConfig::CHUNKED_NODE_GROUP_CAPACITY,
+            rowIdx % common::StorageConfig::CHUNKED_NODE_GROUP_CAPACITY);
+    }
+
+    const std::vector<std::unique_ptr<InMemChunkedNodeGroup>>& getChunkedGroups() {
+        return chunkedGroups;
+    }
+    InMemChunkedNodeGroup& getChunkedGroup(common::node_group_idx_t groupIdx) const {
+        KU_ASSERT(groupIdx < chunkedGroups.size());
+        return *chunkedGroups[groupIdx];
+    }
+
+    // Return num of rows before append.
+    void append(MemoryManager& memoryManager, const std::vector<common::ValueVector*>& vectors,
+        common::row_idx_t startRowInVectors, common::row_idx_t numRowsToAppend);
+
+    // `merge` are directly moving the chunkedGroup to the collection.
+    void merge(std::unique_ptr<InMemChunkedNodeGroup> chunkedGroup);
+    void merge(InMemChunkedNodeGroupCollection& other);
+
+    uint64_t getNumChunkedGroups() const { return chunkedGroups.size(); }
+    void clear() { chunkedGroups.clear(); }
+
+    void loadFromDisk(MemoryManager& memoryManager) {
+        for (auto& group : chunkedGroups) {
+            group->loadFromDisk(memoryManager);
+        }
+    }
+
+private:
+    std::vector<common::LogicalType> types;
+    std::vector<std::unique_ptr<InMemChunkedNodeGroup>> chunkedGroups;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/in_memory_exception_chunk.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/in_memory_exception_chunk.h
new file mode 100644
index 0000000000..ba37534741
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/in_memory_exception_chunk.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include "storage/compression/float_compression.h"
+#include "storage/table/column_reader_writer.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+}
+namespace storage {
+
+class Column;
+class MemoryManager;
+class ColumnReadWriter;
+struct ColumnChunkMetadata;
+struct ChunkState;
+
+// In memory representation of ALP exception chunk
+// NOTE: read and write operations on this chunk cannot both be performed on this
+// Additionally, each exceptionIdx can be updated at most once before finalizing
+// After such operations are performed, you must call finalizeAndFlushToDisk() before reading again
+template<std::floating_point T>
+class LBUG_API InMemoryExceptionChunk {
+public:
+    InMemoryExceptionChunk(const SegmentState& state, FileHandle* dataFH,
+        MemoryManager* memoryManager, ShadowFile* shadowFile);
+    ~InMemoryExceptionChunk();
+
+    void finalizeAndFlushToDisk(SegmentState& state);
+
+    void addException(EncodeException<T> exception);
+
+    void removeExceptionAt(size_t exceptionIdx);
+
+    EncodeException<T> getExceptionAt(size_t exceptionIdx) const;
+
+    common::offset_t findFirstExceptionAtOrPastOffset(common::offset_t offsetInChunk) const;
+
+    size_t getExceptionCount() const;
+
+    void writeException(EncodeException<T> exception, size_t exceptionIdx);
+
+private:
+    static PageCursor getExceptionPageCursor(const ColumnChunkMetadata& metadata,
+        PageCursor pageBaseCursor, size_t exceptionCapacity);
+
+    void finalize(SegmentState& state);
+
+    static constexpr common::PhysicalTypeID physicalType =
+        std::is_same_v<T, float> ? common::PhysicalTypeID::ALP_EXCEPTION_FLOAT :
+                                   common::PhysicalTypeID::ALP_EXCEPTION_DOUBLE;
+
+    size_t exceptionCount;
+    size_t finalizedExceptionCount;
+    size_t exceptionCapacity;
+
+    common::NullMask emptyMask;
+
+    std::unique_ptr<Column> column;
+    std::unique_ptr<ColumnChunkData> chunkData;
+    std::unique_ptr<SegmentState> chunkState;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/lazy_segment_scanner.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/lazy_segment_scanner.h
new file mode 100644
index 0000000000..1e39880466
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/lazy_segment_scanner.h
@@ -0,0 +1,86 @@
+#pragma once
+
+#include "storage/table/column_chunk.h"
+#include "storage/table/column_chunk_scanner.h"
+namespace lbug {
+namespace storage {
+struct LazySegmentData {
+    std::unique_ptr<ColumnChunkData> segmentData;
+    common::offset_t startOffsetInSegment;
+    common::offset_t length;
+    ColumnChunkScanner::scan_func_t scanFunc;
+
+    // Used for genericRangeSegments()
+    const LazySegmentData& operator*() const { return *this; }
+    common::offset_t getNumValues() const { return length; }
+};
+
+// Separately scans each segment in a column chunk
+// Avoids scanning a segment unless a call to updateScannedValue() is made for the current segment
+class LazySegmentScanner : public ColumnChunkScanner {
+public:
+    LazySegmentScanner(MemoryManager& mm, common::LogicalType columnType, bool enableCompression)
+        : numValues(0), mm(mm), columnType(std::move(columnType)),
+          enableCompression(enableCompression) {}
+
+    struct Iterator {
+        common::offset_t segmentIdx;
+        common::offset_t offsetInSegment;
+        LazySegmentScanner& segmentScanner;
+
+        void advance(common::offset_t n);
+        void operator++() { advance(1); }
+        LazySegmentData& operator*() const;
+        LazySegmentData* operator->() const { return &*(*this); }
+    };
+
+    Iterator begin() { return Iterator{0, 0, *this}; }
+
+    // Since we lazily scan segments
+    // This actually only adds the information needed to scan the segment
+    // Either updateScannedValue() or scanSegmentIfNeeded must be called to actually scan
+    void scanSegment(common::offset_t offsetInSegment, common::offset_t segmentLength,
+        scan_func_t newScanFunc) override;
+
+    void applyCommittedUpdates(const UpdateInfo& updateInfo,
+        const transaction::Transaction* transaction, common::offset_t startRow,
+        common::offset_t numRows) override;
+
+    uint64_t getNumValues() override { return numValues; }
+
+    void scanSegmentIfNeeded(LazySegmentData& segment);
+    void scanSegmentIfNeeded(common::idx_t segmentIdx) {
+        scanSegmentIfNeeded(segments[segmentIdx]);
+    }
+
+    template<std::invocable<LazySegmentData&, common::offset_t /*offsetInSegment*/,
+        common::offset_t /*lengthInSegment*/, common::offset_t /*dstOffset*/>
+            Func>
+    void rangeSegments(Iterator startIt, common::length_t length, Func func);
+
+private:
+    std::vector<LazySegmentData> segments;
+
+    uint64_t numValues;
+
+    MemoryManager& mm;
+    common::LogicalType columnType;
+    bool enableCompression;
+};
+
+inline LazySegmentData& LazySegmentScanner::Iterator::operator*() const {
+    KU_ASSERT(segmentIdx < segmentScanner.segments.size() &&
+              offsetInSegment < segmentScanner.segments[segmentIdx].length);
+    return segmentScanner.segments[segmentIdx];
+}
+
+template<
+    std::invocable<LazySegmentData&, common::offset_t, common::offset_t, common::offset_t> Func>
+void LazySegmentScanner::rangeSegments(Iterator startIt, common::length_t length, Func func) {
+    auto segmentSpan = std::span(segments);
+    genericRangeSegmentsFromIt(segmentSpan, segmentSpan.begin() + startIt.segmentIdx,
+        startIt.offsetInSegment, length, func);
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/list_chunk_data.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/list_chunk_data.h
new file mode 100644
index 0000000000..748d643922
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/list_chunk_data.h
@@ -0,0 +1,135 @@
+#pragma once
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/types/types.h"
+#include "storage/table/column_chunk_data.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+
+class LBUG_API ListChunkData final : public ColumnChunkData {
+public:
+    static constexpr common::idx_t SIZE_COLUMN_CHILD_READ_STATE_IDX = 0;
+    static constexpr common::idx_t DATA_COLUMN_CHILD_READ_STATE_IDX = 1;
+    static constexpr common::idx_t OFFSET_COLUMN_CHILD_READ_STATE_IDX = 2;
+    static constexpr size_t CHILD_COLUMN_COUNT = 3;
+
+    ListChunkData(MemoryManager& mm, common::LogicalType dataType, uint64_t capacity,
+        bool enableCompression, ResidencyState residencyState);
+    ListChunkData(MemoryManager& mm, common::LogicalType dataType, bool enableCompression,
+        const ColumnChunkMetadata& metadata);
+
+    ColumnChunkData* getOffsetColumnChunk() const { return offsetColumnChunk.get(); }
+
+    ColumnChunkData* getDataColumnChunk() const { return dataColumnChunk.get(); }
+    std::unique_ptr<ColumnChunkData> moveDataColumnChunk() { return std::move(dataColumnChunk); }
+
+    ColumnChunkData* getSizeColumnChunk() const { return sizeColumnChunk.get(); }
+    std::unique_ptr<ColumnChunkData> moveSizeColumnChunk() { return std::move(sizeColumnChunk); }
+
+    void setOffsetColumnChunk(std::unique_ptr<ColumnChunkData> offsetColumnChunk_) {
+        offsetColumnChunk = std::move(offsetColumnChunk_);
+    }
+    void setDataColumnChunk(std::unique_ptr<ColumnChunkData> dataColumnChunk_) {
+        dataColumnChunk = std::move(dataColumnChunk_);
+    }
+    void setSizeColumnChunk(std::unique_ptr<ColumnChunkData> sizeColumnChunk_) {
+        sizeColumnChunk = std::move(sizeColumnChunk_);
+    }
+
+    void resetToEmpty() override;
+
+    void setNumValues(uint64_t numValues_) override {
+        ColumnChunkData::setNumValues(numValues_);
+        sizeColumnChunk->setNumValues(numValues_);
+        offsetColumnChunk->setNumValues(numValues_);
+    }
+
+    void resetNumValuesFromMetadata() override;
+    void syncNumValues() override {
+        numValues = offsetColumnChunk->getNumValues();
+        metadata.numValues = numValues;
+    }
+
+    void append(common::ValueVector* vector, const common::SelectionView& selVector) override;
+
+    void initializeScanState(SegmentState& state, const Column* column) const override;
+    void scan(common::ValueVector& output, common::offset_t offset, common::length_t length,
+        common::sel_t posInOutputVector) const override;
+    void lookup(common::offset_t offsetInChunk, common::ValueVector& output,
+        common::sel_t posInOutputVector) const override;
+
+    // Note: `write` assumes that no `append` will be called afterward.
+    void write(const common::ValueVector* vector, common::offset_t offsetInVector,
+        common::offset_t offsetInChunk) override;
+    void write(ColumnChunkData* chunk, ColumnChunkData* dstOffsets,
+        common::RelMultiplicity multiplicity) override;
+    void write(const ColumnChunkData* srcChunk, common::offset_t srcOffsetInChunk,
+        common::offset_t dstOffsetInChunk, common::offset_t numValuesToCopy) override;
+
+    void resizeDataColumnChunk(uint64_t numValues) const { dataColumnChunk->resize(numValues); }
+
+    void setToInMemory() override {
+        ColumnChunkData::setToInMemory();
+        sizeColumnChunk->setToInMemory();
+        offsetColumnChunk->setToInMemory();
+        dataColumnChunk->setToInMemory();
+        KU_ASSERT(offsetColumnChunk->getNumValues() == numValues);
+    }
+    void resize(uint64_t newCapacity) override {
+        ColumnChunkData::resize(newCapacity);
+        sizeColumnChunk->resize(newCapacity);
+        offsetColumnChunk->resize(newCapacity);
+    }
+
+    void resizeWithoutPreserve(uint64_t newCapacity) override {
+        ColumnChunkData::resizeWithoutPreserve(newCapacity);
+        sizeColumnChunk->resizeWithoutPreserve(newCapacity);
+        offsetColumnChunk->resizeWithoutPreserve(newCapacity);
+    }
+
+    common::offset_t getListStartOffset(common::offset_t offset) const;
+
+    common::offset_t getListEndOffset(common::offset_t offset) const;
+
+    common::list_size_t getListSize(common::offset_t offset) const;
+
+    void resetOffset();
+    void resetFromOtherChunk(ListChunkData* other);
+    void finalize() override;
+    bool isOffsetsConsecutiveAndSortedAscending(uint64_t startPos, uint64_t endPos) const;
+    bool sanityCheck() const override;
+
+    uint64_t getEstimatedMemoryUsage() const override;
+
+    void serialize(common::Serializer& serializer) const override;
+    static void deserialize(common::Deserializer& deSer, ColumnChunkData& chunkData);
+
+    void flush(PageAllocator& pageAllocator) override;
+    uint64_t getMinimumSizeOnDisk() const override;
+    uint64_t getSizeOnDisk() const override;
+    uint64_t getSizeOnDiskInMemoryStats() const override;
+    void reclaimStorage(PageAllocator& pageAllocator) override;
+
+protected:
+    void copyListValues(const common::list_entry_t& entry, common::ValueVector* dataVector);
+
+private:
+    void append(const ColumnChunkData* other, common::offset_t startPosInOtherChunk,
+        uint32_t numValuesToAppend) override;
+
+    void appendNullList();
+
+    void setOffsetChunkValue(common::offset_t val, common::offset_t pos);
+
+protected:
+    std::unique_ptr<ColumnChunkData> offsetColumnChunk;
+    std::unique_ptr<ColumnChunkData> sizeColumnChunk;
+    std::unique_ptr<ColumnChunkData> dataColumnChunk;
+    // we use checkOffsetSortedAsc flag to indicate that we do not trigger random write
+    bool checkOffsetSortedAsc;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/list_column.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/list_column.h
new file mode 100644
index 0000000000..91d06b84c3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/list_column.h
@@ -0,0 +1,105 @@
+#pragma once
+
+#include <cstddef>
+
+#include "column.h"
+#include "common/types/types.h"
+
+// List is a nested data type which is stored as three chunks:
+// 1. Offset column (type: INT64). Using offset to partition the data column into multiple lists.
+// 2. Size column. Stores the size of each list.
+// 3. Data column. Stores the actual data of the list.
+// Similar to other data types, nulls are stored in the null column.
+// Example layout for list of INT64:
+// Four lists: [4,7,8,12], null, [2, 3], []
+// Offset column: [4, 4, 6, 6]
+// Size column: [4, 0, 2, 0]
+// data column: [4, 7, 8, 12, 2, 3]
+// When updating the data, we first append the data to the data column, and then update the offset
+// and size accordingly. Besides offset column, we introduce an extra size column here to enable
+// in-place updates of a list column. In a list column chunk, offsets of lists are not always sorted
+// after updates. This is good for writes, but it introduces extra overheads for scans, as lists can
+// be scattered, and scans have to be broken into multiple small reads. To achieve a balance between
+// reads and writes, during updates, we rewrite the whole list column chunk in ascending order
+// when the offsets are not sorted in ascending order and the size of data column chunk is larger
+// than half of its capacity.
+
+namespace lbug {
+namespace storage {
+
+struct ListOffsetSizeInfo {
+    common::offset_t numTotal;
+    std::unique_ptr<ColumnChunkData> offsetColumnChunk;
+    std::unique_ptr<ColumnChunkData> sizeColumnChunk;
+
+    ListOffsetSizeInfo(common::offset_t numTotal,
+        std::unique_ptr<ColumnChunkData> offsetColumnChunk,
+        std::unique_ptr<ColumnChunkData> sizeColumnChunk)
+        : numTotal{numTotal}, offsetColumnChunk{std::move(offsetColumnChunk)},
+          sizeColumnChunk{std::move(sizeColumnChunk)} {}
+
+    common::list_size_t getListSize(uint64_t pos) const;
+    common::offset_t getListEndOffset(uint64_t pos) const;
+    common::offset_t getListStartOffset(uint64_t pos) const;
+
+    bool isOffsetSortedAscending(uint64_t startPos, uint64_t endPos) const;
+};
+
+class ListColumn final : public Column {
+    static constexpr common::idx_t SIZE_COLUMN_CHILD_READ_STATE_IDX = 0;
+    static constexpr common::idx_t DATA_COLUMN_CHILD_READ_STATE_IDX = 1;
+    static constexpr common::idx_t OFFSET_COLUMN_CHILD_READ_STATE_IDX = 2;
+    static constexpr size_t CHILD_COLUMN_COUNT = 3;
+
+public:
+    ListColumn(std::string name, common::LogicalType dataType, FileHandle* dataFH,
+        MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression);
+
+    static bool disableCompressionOnData(const common::LogicalType& dataType);
+
+    static std::unique_ptr<ColumnChunkData> flushChunkData(const ColumnChunkData& chunk,
+        PageAllocator& pageAllocator);
+
+    Column* getOffsetColumn() const { return offsetColumn.get(); }
+    Column* getSizeColumn() const { return sizeColumn.get(); }
+    Column* getDataColumn() const { return dataColumn.get(); }
+
+    std::vector<std::unique_ptr<ColumnChunkData>> checkpointSegment(
+        ColumnCheckpointState&& checkpointState, PageAllocator& pageAllocator,
+        bool canSplitSegment = true) const override;
+
+protected:
+    void scanSegment(const SegmentState& state, common::offset_t startOffsetInChunk,
+        common::row_idx_t numValuesToScan, common::ValueVector* resultVector,
+        common::offset_t offsetInResult) const override;
+
+    void scanSegment(const SegmentState& state, ColumnChunkData* resultChunk,
+        common::offset_t startOffsetInSegment, common::row_idx_t numValuesToScan) const override;
+
+    void lookupInternal(const SegmentState& state, common::offset_t nodeOffset,
+        common::ValueVector* resultVector, uint32_t posInVector) const override;
+
+private:
+    void scanUnfiltered(const SegmentState& state, common::ValueVector* resultVector,
+        uint64_t numValuesToScan, const ListOffsetSizeInfo& listOffsetInfoInStorage,
+        common::offset_t offsetInResult) const;
+    void scanFiltered(const SegmentState& state, common::offset_t startOffsetInChunk,
+        common::ValueVector* offsetVector, const ListOffsetSizeInfo& listOffsetInfoInStorage,
+        common::offset_t offsetInResult) const;
+
+    common::offset_t readOffset(const SegmentState& state,
+        common::offset_t offsetInNodeGroup) const;
+    common::list_size_t readSize(const SegmentState& state,
+        common::offset_t offsetInNodeGroup) const;
+
+    ListOffsetSizeInfo getListOffsetSizeInfo(const SegmentState& state,
+        common::offset_t startOffsetInSegment, common::offset_t numOffsetsToRead) const;
+
+private:
+    std::unique_ptr<Column> offsetColumn;
+    std::unique_ptr<Column> sizeColumn;
+    std::unique_ptr<Column> dataColumn;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/node_group.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/node_group.h
new file mode 100644
index 0000000000..f52518fd84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/node_group.h
@@ -0,0 +1,269 @@
+#pragma once
+
+#include <cstdint>
+
+#include "common/uniq_lock.h"
+#include "storage/enums/residency_state.h"
+#include "storage/table/chunked_node_group.h"
+#include "storage/table/group_collection.h"
+#include "storage/table/version_record_handler.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace storage {
+class MemoryManager;
+
+class ColumnStats;
+struct TableAddColumnState;
+class NodeGroup;
+
+struct NodeGroupScanState {
+    // Index of committed but not yet checkpointed chunked group to scan.
+    common::idx_t chunkedGroupIdx = 0;
+    common::row_idx_t nextRowToScan = 0;
+    // State of each chunk in the checkpointed chunked group.
+    std::vector<ChunkState> chunkStates;
+
+    explicit NodeGroupScanState() {}
+    explicit NodeGroupScanState(common::idx_t numChunks) { chunkStates.resize(numChunks); }
+
+    virtual ~NodeGroupScanState() = default;
+    DELETE_COPY_DEFAULT_MOVE(NodeGroupScanState);
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& constCast() {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+struct NodeGroupCheckpointState {
+    std::vector<common::column_id_t> columnIDs;
+    std::vector<Column*> columns;
+    PageAllocator& pageAllocator;
+    MemoryManager* mm;
+
+    NodeGroupCheckpointState(std::vector<common::column_id_t> columnIDs,
+        std::vector<Column*> columns, PageAllocator& pageAllocator, MemoryManager* mm)
+        : columnIDs{std::move(columnIDs)}, columns{std::move(columns)},
+          pageAllocator{pageAllocator}, mm{mm} {}
+    virtual ~NodeGroupCheckpointState() = default;
+
+    template<typename T>
+    const T& cast() const {
+        return common::ku_dynamic_cast<const T&>(*this);
+    }
+    template<typename T>
+    T& cast() {
+        return common::ku_dynamic_cast<T&>(*this);
+    }
+};
+
+struct NodeGroupScanResult {
+
+    common::row_idx_t startRow = common::INVALID_ROW_IDX;
+    common::row_idx_t numRows = 0;
+
+    constexpr NodeGroupScanResult() noexcept = default;
+    constexpr NodeGroupScanResult(common::row_idx_t startRow, common::row_idx_t numRows) noexcept
+        : startRow{startRow}, numRows{numRows} {}
+
+    bool operator==(const NodeGroupScanResult& other) const {
+        return startRow == other.startRow && numRows == other.numRows;
+    }
+};
+
+static auto NODE_GROUP_SCAN_EMPTY_RESULT = NodeGroupScanResult{};
+
+struct TableScanState;
+class NodeGroup {
+public:
+    NodeGroup(MemoryManager& mm, const common::node_group_idx_t nodeGroupIdx,
+        const bool enableCompression, std::vector<common::LogicalType> dataTypes,
+        common::row_idx_t capacity = common::StorageConfig::NODE_GROUP_SIZE,
+        NodeGroupDataFormat format = NodeGroupDataFormat::REGULAR)
+        : mm{mm}, nodeGroupIdx{nodeGroupIdx}, format{format}, enableCompression{enableCompression},
+          numRows{0}, nextRowToAppend{0}, capacity{capacity}, dataTypes{std::move(dataTypes)} {}
+    NodeGroup(MemoryManager& mm, const common::node_group_idx_t nodeGroupIdx,
+        const bool enableCompression, std::unique_ptr<ChunkedNodeGroup> chunkedNodeGroup,
+        common::row_idx_t capacity = common::StorageConfig::NODE_GROUP_SIZE,
+        NodeGroupDataFormat format = NodeGroupDataFormat::REGULAR)
+        : mm{mm}, nodeGroupIdx{nodeGroupIdx}, format{format}, enableCompression{enableCompression},
+          numRows{chunkedNodeGroup->getStartRowIdx() + chunkedNodeGroup->getNumRows()},
+          nextRowToAppend{numRows}, capacity{capacity} {
+        for (auto i = 0u; i < chunkedNodeGroup->getNumColumns(); i++) {
+            dataTypes.push_back(chunkedNodeGroup->getColumnChunk(i).getDataType().copy());
+        }
+        const auto lock = chunkedGroups.lock();
+        chunkedGroups.appendGroup(lock, std::move(chunkedNodeGroup));
+    }
+    NodeGroup(MemoryManager& mm, const common::node_group_idx_t nodeGroupIdx,
+        const bool enableCompression, common::row_idx_t capacity, NodeGroupDataFormat format)
+        : mm{mm}, nodeGroupIdx{nodeGroupIdx}, format{format}, enableCompression{enableCompression},
+          numRows{0}, nextRowToAppend{0}, capacity{capacity} {}
+    virtual ~NodeGroup() = default;
+
+    virtual bool isEmpty() const { return numRows.load() == 0; }
+    virtual common::row_idx_t getNumRows() const { return numRows.load(); }
+    void moveNextRowToAppend(common::row_idx_t numRowsToAppend) {
+        nextRowToAppend += numRowsToAppend;
+    }
+    common::row_idx_t getNumRowsLeftToAppend() const { return capacity - nextRowToAppend; }
+    bool isFull() const { return numRows.load() == capacity; }
+    const std::vector<common::LogicalType>& getDataTypes() const { return dataTypes; }
+    NodeGroupDataFormat getFormat() const { return format; }
+    common::row_idx_t append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, ChunkedNodeGroup& chunkedGroup,
+        common::row_idx_t startRowIdx, common::row_idx_t numRowsToAppend);
+    common::row_idx_t append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, InMemChunkedNodeGroup& chunkedGroup,
+        common::row_idx_t startRowIdx, common::row_idx_t numRowsToAppend);
+    common::row_idx_t append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs,
+        std::span<const ColumnChunkData*> chunkedGroup, common::row_idx_t startRowIdx,
+        common::row_idx_t numRowsToAppend);
+    common::row_idx_t append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs,
+        std::span<const ColumnChunk*> chunkedGroup, common::row_idx_t startRowIdx,
+        common::row_idx_t numRowsToAppend);
+    void append(const transaction::Transaction* transaction,
+        const std::vector<common::ValueVector*>& vectors, common::row_idx_t startRowIdx,
+        common::row_idx_t numRowsToAppend);
+
+    void merge(transaction::Transaction* transaction,
+        std::unique_ptr<ChunkedNodeGroup> chunkedGroup);
+
+    virtual void initializeScanState(const transaction::Transaction* transaction,
+        TableScanState& state) const;
+    void initializeScanState(const transaction::Transaction* transaction,
+        const common::UniqLock& lock, TableScanState& state) const;
+    virtual NodeGroupScanResult scan(const transaction::Transaction* transaction,
+        TableScanState& state) const;
+
+    virtual NodeGroupScanResult scan(transaction::Transaction* transaction, TableScanState& state,
+        common::offset_t startOffsetInGroup, common::offset_t numRowsToScan) const;
+
+    bool lookup(const transaction::Transaction* transaction, const TableScanState& state,
+        common::sel_t posInSel = 0) const;
+    bool lookupNoLock(const transaction::Transaction* transaction, const TableScanState& state,
+        common::sel_t posInSel = 0) const;
+    // TODO(Guodong): These should be merged together with `lookup`.
+    bool lookupMultiple(const common::UniqLock& lock, const transaction::Transaction* transaction,
+        const TableScanState& state) const;
+    bool lookupMultiple(const transaction::Transaction* transaction,
+        const TableScanState& state) const;
+
+    void update(const transaction::Transaction* transaction, common::row_idx_t rowIdxInGroup,
+        common::column_id_t columnID, const common::ValueVector& propertyVector);
+    bool delete_(const transaction::Transaction* transaction, common::row_idx_t rowIdxInGroup);
+
+    bool hasDeletions(const transaction::Transaction* transaction) const;
+    virtual void addColumn(TableAddColumnState& addColumnState, PageAllocator* pageAllocator,
+        ColumnStats* newColumnStats);
+
+    void applyFuncToChunkedGroups(version_record_handler_op_t func, common::row_idx_t startRow,
+        common::row_idx_t numRows, common::transaction_t commitTS) const;
+    void rollbackInsert(common::row_idx_t startRow);
+    void reclaimStorage(PageAllocator& pageAllocator) const;
+    virtual void reclaimStorage(PageAllocator& pageAllocator, const common::UniqLock& lock) const;
+
+    virtual void checkpoint(MemoryManager& memoryManager, NodeGroupCheckpointState& state);
+
+    uint64_t getEstimatedMemoryUsage() const;
+
+    virtual void serialize(common::Serializer& serializer);
+    static std::unique_ptr<NodeGroup> deserialize(MemoryManager& mm, common::Deserializer& deSer,
+        const std::vector<common::LogicalType>& columnTypes);
+
+    common::node_group_idx_t getNumChunkedGroups() const {
+        const auto lock = chunkedGroups.lock();
+        return chunkedGroups.getNumGroups(lock);
+    }
+    ChunkedNodeGroup* getChunkedNodeGroup(common::node_group_idx_t groupIdx) const {
+        const auto lock = chunkedGroups.lock();
+        return chunkedGroups.getGroup(lock, groupIdx);
+    }
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& cast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+
+    bool isVisible(const transaction::Transaction* transaction,
+        common::row_idx_t rowIdxInGroup) const;
+    bool isVisibleNoLock(const transaction::Transaction* transaction,
+        common::row_idx_t rowIdxInGroup) const;
+    bool isDeleted(const transaction::Transaction* transaction,
+        common::offset_t offsetInGroup) const;
+    bool isInserted(const transaction::Transaction* transaction,
+        common::offset_t offsetInGroup) const;
+
+    common::node_group_idx_t getNodeGroupIdx() const { return nodeGroupIdx; }
+
+protected:
+    static constexpr auto INVALID_CHUNKED_GROUP_IDX = UINT32_MAX;
+    static constexpr auto INVALID_START_ROW_IDX = UINT64_MAX;
+
+protected:
+    void checkpointDataTypesNoLock(const NodeGroupCheckpointState& state);
+
+private:
+    std::pair<common::idx_t, common::row_idx_t> findChunkedGroupIdxFromRowIdxNoLock(
+        common::row_idx_t rowIdx) const;
+    ChunkedNodeGroup* findChunkedGroupFromRowIdx(const common::UniqLock& lock,
+        common::row_idx_t rowIdx) const;
+    ChunkedNodeGroup* findChunkedGroupFromRowIdxNoLock(common::row_idx_t rowIdx) const;
+
+    std::unique_ptr<ChunkedNodeGroup> checkpointInMemOnly(MemoryManager& memoryManager,
+        const common::UniqLock& lock, const NodeGroupCheckpointState& state) const;
+    std::unique_ptr<ChunkedNodeGroup> checkpointInMemAndOnDisk(MemoryManager& memoryManager,
+        const common::UniqLock& lock, NodeGroupCheckpointState& state) const;
+    std::unique_ptr<VersionInfo> checkpointVersionInfo(const common::UniqLock& lock,
+        const transaction::Transaction* transaction) const;
+
+    template<ResidencyState SCAN_RESIDENCY_STATE>
+    common::row_idx_t getNumResidentRows(const common::UniqLock& lock) const;
+    template<ResidencyState SCAN_RESIDENCY_STATE>
+    std::unique_ptr<InMemChunkedNodeGroup> scanAllInsertedAndVersions(MemoryManager& memoryManager,
+        const common::UniqLock& lock, const std::vector<common::column_id_t>& columnIDs,
+        const std::vector<const Column*>& columns) const;
+
+    virtual NodeGroupScanResult scanInternal(const common::UniqLock& lock,
+        transaction::Transaction* transaction, TableScanState& state,
+        common::offset_t startOffsetInGroup, common::offset_t numRowsToScan) const;
+
+    common::row_idx_t getStartRowIdxInGroupNoLock() const;
+    common::row_idx_t getStartRowIdxInGroup(const common::UniqLock& lock) const;
+
+    void scanCommittedUpdatesForColumn(std::vector<ChunkCheckpointState>& chunkCheckpointStates,
+        MemoryManager& memoryManager, const common::UniqLock& lock, common::column_id_t columnID,
+        const Column* column) const;
+
+protected:
+    MemoryManager& mm;
+    common::node_group_idx_t nodeGroupIdx;
+    NodeGroupDataFormat format;
+    bool enableCompression;
+    std::atomic<common::row_idx_t> numRows;
+    // `nextRowToAppend` is a cursor to allow us to pre-reserve a set of rows to append before
+    // acutally appending data. This is an optimization to reduce lock-contention when appending in
+    // parallel.
+    // TODO(Guodong): Remove this field.
+    common::row_idx_t nextRowToAppend;
+    common::row_idx_t capacity;
+    std::vector<common::LogicalType> dataTypes;
+    GroupCollection<ChunkedNodeGroup> chunkedGroups;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/node_group_collection.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/node_group_collection.h
new file mode 100644
index 0000000000..7696e2473e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/node_group_collection.h
@@ -0,0 +1,125 @@
+#pragma once
+
+#include "storage/stats/table_stats.h"
+#include "storage/table/group_collection.h"
+#include "storage/table/node_group.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+}
+namespace storage {
+class MemoryManager;
+
+class NodeGroupCollection {
+public:
+    NodeGroupCollection(MemoryManager& mm, const std::vector<common::LogicalType>& types,
+        bool enableCompression, ResidencyState residency = ResidencyState::IN_MEMORY,
+        const VersionRecordHandler* versionRecordHandler = nullptr);
+
+    void append(const transaction::Transaction* transaction,
+        const std::vector<common::ValueVector*>& vectors);
+    void append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, const NodeGroupCollection& other);
+    void append(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, const NodeGroup& nodeGroup);
+
+    // This function only tries to append data into the last node group, and if the last node group
+    // is not enough to hold all the data, it will append partially and return the number of rows
+    // appended.
+    // The returned values are the startOffset and numValuesAppended.
+    // NOTE: This is specially coded to only be used by NodeBatchInsert for now.
+    std::pair<common::offset_t, common::offset_t> appendToLastNodeGroupAndFlushWhenFull(
+        transaction::Transaction* transaction, const std::vector<common::column_id_t>& columnIDs,
+        InMemChunkedNodeGroup& chunkedGroup, PageAllocator& pageAllocator);
+
+    common::row_idx_t getNumTotalRows() const;
+    common::node_group_idx_t getNumNodeGroups() const {
+        const auto lock = nodeGroups.lock();
+        return nodeGroups.getNumGroups(lock);
+    }
+    common::node_group_idx_t getNumNodeGroupsNoLock() const {
+        return nodeGroups.getNumGroupsNoLock();
+    }
+    NodeGroup* getNodeGroupNoLock(const common::node_group_idx_t groupIdx) const {
+        KU_ASSERT(nodeGroups.getGroupNoLock(groupIdx)->getNodeGroupIdx() == groupIdx);
+        return nodeGroups.getGroupNoLock(groupIdx);
+    }
+    NodeGroup* getNodeGroup(const common::node_group_idx_t groupIdx,
+        bool mayOutOfBound = false) const {
+        const auto lock = nodeGroups.lock();
+        if (mayOutOfBound && groupIdx >= nodeGroups.getNumGroups(lock)) {
+            return nullptr;
+        }
+        KU_ASSERT(nodeGroups.getGroupNoLock(groupIdx)->getNodeGroupIdx() == groupIdx);
+        return nodeGroups.getGroup(lock, groupIdx);
+    }
+    NodeGroup* getOrCreateNodeGroup(const transaction::Transaction* transaction,
+        common::node_group_idx_t groupIdx, NodeGroupDataFormat format);
+
+    void setNodeGroup(const common::node_group_idx_t nodeGroupIdx,
+        std::unique_ptr<NodeGroup> group) {
+        const auto lock = nodeGroups.lock();
+        nodeGroups.replaceGroup(lock, nodeGroupIdx, std::move(group));
+    }
+
+    void rollbackInsert(common::row_idx_t numRows_, bool updateNumRows = true);
+
+    void clear() {
+        const auto lock = nodeGroups.lock();
+        nodeGroups.clear(lock);
+    }
+
+    common::column_id_t getNumColumns() const { return types.size(); }
+
+    void addColumn(TableAddColumnState& addColumnState, PageAllocator* pageAllocator = nullptr);
+
+    uint64_t getEstimatedMemoryUsage() const;
+
+    void checkpoint(MemoryManager& memoryManager, NodeGroupCheckpointState& state);
+    void reclaimStorage(PageAllocator& pageAllocator) const;
+
+    TableStats getStats() const {
+        auto lock = nodeGroups.lock();
+        return stats.copy();
+    }
+    TableStats getStats(const common::UniqLock& lock) const {
+        KU_ASSERT(lock.isLocked());
+        KU_UNUSED(lock);
+        return stats.copy();
+    }
+    void mergeStats(const TableStats& stats) {
+        auto lock = nodeGroups.lock();
+        this->stats.merge(stats);
+    }
+    void mergeStats(const std::vector<common::column_id_t>& columnIDs, const TableStats& stats) {
+        auto lock = nodeGroups.lock();
+        this->stats.merge(columnIDs, stats);
+    }
+
+    void serialize(common::Serializer& ser);
+    void deserialize(common::Deserializer& deSer, MemoryManager& memoryManager);
+
+    void pushInsertInfo(const transaction::Transaction* transaction,
+        common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+        common::row_idx_t numRows, const VersionRecordHandler* versionRecordHandler,
+        bool incrementNumRows);
+
+private:
+    void pushInsertInfo(const transaction::Transaction* transaction, const NodeGroup* nodeGroup,
+        common::row_idx_t numRows);
+
+private:
+    MemoryManager& mm;
+    bool enableCompression;
+    // Num rows in the collection regardless of deletions.
+    std::atomic<common::row_idx_t> numTotalRows;
+    std::vector<common::LogicalType> types;
+    GroupCollection<NodeGroup> nodeGroups;
+    ResidencyState residency;
+    TableStats stats;
+    const VersionRecordHandler* versionRecordHandler;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/node_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/node_table.h
new file mode 100644
index 0000000000..18ba1f59d4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/node_table.h
@@ -0,0 +1,230 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "storage/index/hash_index.h"
+#include "storage/table/node_group_collection.h"
+#include "storage/table/table.h"
+
+namespace lbug {
+namespace evaluator {
+class ExpressionEvaluator;
+} // namespace evaluator
+
+namespace catalog {
+class NodeTableCatalogEntry;
+} // namespace catalog
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace storage {
+
+struct LBUG_API NodeTableScanState : TableScanState {
+    NodeTableScanState(common::ValueVector* nodeIDVector,
+        std::vector<common::ValueVector*> outputVectors,
+        std::shared_ptr<common::DataChunkState> outChunkState)
+        : TableScanState{nodeIDVector, std::move(outputVectors), std::move(outChunkState)} {
+        nodeGroupScanState = std::make_unique<NodeGroupScanState>(this->columnIDs.size());
+    }
+
+    void setToTable(const transaction::Transaction* transaction, Table* table_,
+        std::vector<common::column_id_t> columnIDs_,
+        std::vector<ColumnPredicateSet> columnPredicateSets_ = {},
+        common::RelDataDirection direction = common::RelDataDirection::INVALID) override;
+
+    bool scanNext(transaction::Transaction* transaction) override;
+
+    NodeGroupScanResult scanNext(transaction::Transaction* transaction,
+        common::offset_t startOffset, common::offset_t numNodes);
+};
+
+// There is a vtable bug related to the Apple clang v15.0.0+. Adding the `FINAL` specifier to
+// derived class causes casting failures in Apple platform.
+struct LBUG_API NodeTableInsertState : TableInsertState {
+    common::ValueVector& nodeIDVector;
+    const common::ValueVector& pkVector;
+    std::vector<std::unique_ptr<Index::InsertState>> indexInsertStates;
+
+    NodeTableInsertState(common::ValueVector& nodeIDVector, const common::ValueVector& pkVector,
+        std::vector<common::ValueVector*> propertyVectors)
+        : TableInsertState{std::move(propertyVectors)}, nodeIDVector{nodeIDVector},
+          pkVector{pkVector} {}
+
+    NodeTableInsertState(const NodeTableInsertState&) = delete;
+};
+
+struct LBUG_API NodeTableUpdateState : TableUpdateState {
+    common::ValueVector& nodeIDVector;
+    std::vector<std::unique_ptr<Index::UpdateState>> indexUpdateState;
+
+    NodeTableUpdateState(common::column_id_t columnID, common::ValueVector& nodeIDVector,
+        common::ValueVector& propertyVector)
+        : TableUpdateState{columnID, propertyVector}, nodeIDVector{nodeIDVector} {}
+
+    NodeTableUpdateState(const NodeTableUpdateState&) = delete;
+
+    bool needToUpdateIndex(common::idx_t idx) const {
+        return idx < indexUpdateState.size() && indexUpdateState[idx] != nullptr;
+    }
+};
+
+struct LBUG_API NodeTableDeleteState : TableDeleteState {
+    common::ValueVector& nodeIDVector;
+    common::ValueVector& pkVector;
+
+    explicit NodeTableDeleteState(common::ValueVector& nodeIDVector, common::ValueVector& pkVector)
+        : nodeIDVector{nodeIDVector}, pkVector{pkVector} {}
+};
+
+class NodeTable;
+struct IndexScanHelper {
+    explicit IndexScanHelper(NodeTable* table, Index* index) : table{table}, index(index) {}
+    virtual ~IndexScanHelper() = default;
+
+    virtual std::unique_ptr<NodeTableScanState> initScanState(
+        const transaction::Transaction* transaction, common::DataChunk& dataChunk);
+    virtual bool processScanOutput(main::ClientContext* context, NodeGroupScanResult scanResult,
+        const std::vector<common::ValueVector*>& scannedVectors) = 0;
+
+    NodeTable* table;
+    Index* index;
+};
+
+class NodeTableVersionRecordHandler final : public VersionRecordHandler {
+public:
+    explicit NodeTableVersionRecordHandler(NodeTable* table);
+
+    void applyFuncToChunkedGroups(version_record_handler_op_t func,
+        common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+        common::row_idx_t numRows, common::transaction_t commitTS) const override;
+    void rollbackInsert(main::ClientContext* context, common::node_group_idx_t nodeGroupIdx,
+        common::row_idx_t startRow, common::row_idx_t numRows) const override;
+
+private:
+    NodeTable* table;
+};
+
+class StorageManager;
+
+class LBUG_API NodeTable final : public Table {
+public:
+    NodeTable(const StorageManager* storageManager,
+        const catalog::NodeTableCatalogEntry* nodeTableEntry, MemoryManager* mm);
+
+    common::row_idx_t getNumTotalRows(const transaction::Transaction* transaction) override;
+
+    void initScanState(transaction::Transaction* transaction, TableScanState& scanState,
+        bool resetCachedBoundNodeIDs = true) const override;
+    void initScanState(transaction::Transaction* transaction, TableScanState& scanState,
+        common::table_id_t tableID, common::offset_t startOffset) const;
+
+    bool scanInternal(transaction::Transaction* transaction, TableScanState& scanState) override;
+    template<bool lock = true>
+    bool lookup(const transaction::Transaction* transaction, const TableScanState& scanState) const;
+    // TODO(Guodong): This should be merged together with `lookup`.
+    template<bool lock = true>
+    bool lookupMultiple(transaction::Transaction* transaction, TableScanState& scanState) const;
+
+    // Return the max node offset during insertions.
+    common::offset_t validateUniquenessConstraint(const transaction::Transaction* transaction,
+        const std::vector<common::ValueVector*>& propertyVectors) const;
+
+    void initInsertState(main::ClientContext* context, TableInsertState& insertState) override;
+    void insert(transaction::Transaction* transaction, TableInsertState& insertState) override;
+    void initUpdateState(main::ClientContext* context, TableUpdateState& updateState) const;
+    void update(transaction::Transaction* transaction, TableUpdateState& updateState) override;
+    bool delete_(transaction::Transaction* transaction, TableDeleteState& deleteState) override;
+
+    void addColumn(transaction::Transaction* transaction, TableAddColumnState& addColumnState,
+        PageAllocator& pageAllocator) override;
+    bool isVisible(const transaction::Transaction* transaction, common::offset_t offset) const;
+    bool isVisibleNoLock(const transaction::Transaction* transaction,
+        common::offset_t offset) const;
+
+    bool lookupPK(const transaction::Transaction* transaction, common::ValueVector* keyVector,
+        uint64_t vectorPos, common::offset_t& result) const;
+
+    void addIndex(std::unique_ptr<Index> index);
+    void dropIndex(const std::string& name);
+
+    common::column_id_t getPKColumnID() const { return pkColumnID; }
+    PrimaryKeyIndex* getPKIndex() const {
+        const auto index = getIndex(PrimaryKeyIndex::DEFAULT_NAME);
+        KU_ASSERT(index.has_value());
+        return &index.value()->cast<PrimaryKeyIndex>();
+    }
+    std::optional<std::reference_wrapper<IndexHolder>> getIndexHolder(const std::string& name);
+    std::optional<Index*> getIndex(const std::string& name) const;
+    std::vector<IndexHolder>& getIndexes() { return indexes; }
+
+    common::column_id_t getNumColumns() const { return columns.size(); }
+    Column& getColumn(common::column_id_t columnID) {
+        KU_ASSERT(columnID < columns.size());
+        return *columns[columnID];
+    }
+    const Column& getColumn(common::column_id_t columnID) const {
+        KU_ASSERT(columnID < columns.size());
+        return *columns[columnID];
+    }
+
+    std::pair<common::offset_t, common::offset_t> appendToLastNodeGroup(
+        transaction::Transaction* transaction, const std::vector<common::column_id_t>& columnIDs,
+        InMemChunkedNodeGroup& chunkedGroup, PageAllocator& pageAllocator);
+
+    void commit(main::ClientContext* context, catalog::TableCatalogEntry* tableEntry,
+        LocalTable* localTable) override;
+    bool checkpoint(main::ClientContext* context, catalog::TableCatalogEntry* tableEntry,
+        PageAllocator& pageAllocator) override;
+    void rollbackCheckpoint() override;
+    void reclaimStorage(PageAllocator& pageAllocator) const override;
+
+    void rollbackPKIndexInsert(main::ClientContext* context, common::row_idx_t startRow,
+        common::row_idx_t numRows_, common::node_group_idx_t nodeGroupIdx_);
+    void rollbackGroupCollectionInsert(common::row_idx_t numRows_);
+
+    common::node_group_idx_t getNumCommittedNodeGroups() const {
+        return nodeGroups->getNumNodeGroups();
+    }
+
+    common::node_group_idx_t getNumNodeGroups() const { return nodeGroups->getNumNodeGroups(); }
+    common::offset_t getNumTuplesInNodeGroup(common::node_group_idx_t nodeGroupIdx) const {
+        return nodeGroups->getNodeGroup(nodeGroupIdx)->getNumRows();
+    }
+    NodeGroup* getNodeGroup(common::node_group_idx_t nodeGroupIdx) const {
+        return nodeGroups->getNodeGroup(nodeGroupIdx);
+    }
+    NodeGroup* getNodeGroupNoLock(common::node_group_idx_t nodeGroupIdx) const {
+        return nodeGroups->getNodeGroupNoLock(nodeGroupIdx);
+    }
+
+    TableStats getStats(const transaction::Transaction* transaction) const;
+    // NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+    void mergeStats(const std::vector<common::column_id_t>& columnIDs, const TableStats& stats) {
+        nodeGroups->mergeStats(columnIDs, stats);
+    }
+
+    void serialize(common::Serializer& serializer) const override;
+    void deserialize(main::ClientContext* context, StorageManager* storageManager,
+        common::Deserializer& deSer) override;
+
+private:
+    void validatePkNotExists(const transaction::Transaction* transaction,
+        common::ValueVector* pkVector) const;
+
+    visible_func getVisibleFunc(const transaction::Transaction* transaction) const;
+    common::DataChunk constructDataChunkForColumns(
+        const std::vector<common::column_id_t>& columnIDs) const;
+    void scanIndexColumns(main::ClientContext* context, IndexScanHelper& scanHelper,
+        const NodeGroupCollection& nodeGroups_) const;
+
+private:
+    std::vector<std::unique_ptr<Column>> columns;
+    std::unique_ptr<NodeGroupCollection> nodeGroups;
+    common::column_id_t pkColumnID;
+    std::vector<IndexHolder> indexes;
+    NodeTableVersionRecordHandler versionRecordHandler;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/null_column.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/null_column.h
new file mode 100644
index 0000000000..5284a51cff
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/null_column.h
@@ -0,0 +1,20 @@
+#pragma once
+
+#include "common/system_config.h"
+#include "storage/table/column.h"
+
+namespace lbug {
+namespace storage {
+
+// Page size must be aligned to 8 byte chunks for the 64-bit NullMask algorithms to work
+// without the possibility of memory errors from reading/writing off the end of a page.
+static_assert(common::LBUG_PAGE_SIZE % 8 == 0);
+
+class NullColumn final : public Column {
+public:
+    NullColumn(const std::string& name, FileHandle* dataFH, MemoryManager* mm,
+        ShadowFile* shadowFile, bool enableCompression);
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/rel_table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/rel_table.h
new file mode 100644
index 0000000000..17a6d95f87
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/rel_table.h
@@ -0,0 +1,255 @@
+#pragma once
+
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "storage/table/rel_table_data.h"
+#include "storage/table/table.h"
+
+namespace lbug {
+namespace evaluator {
+class ExpressionEvaluator;
+} // namespace evaluator
+namespace transaction {
+class Transaction;
+}
+namespace storage {
+class MemoryManager;
+
+struct LocalRelTableScanState;
+struct RelTableScanState : TableScanState {
+    common::RelDataDirection direction;
+    common::sel_t currBoundNodeIdx;
+    Column* csrOffsetColumn;
+    Column* csrLengthColumn;
+    bool randomLookup;
+
+    // This is a reference of the original selVector of the input boundNodeIDVector.
+    common::SelectionVector cachedBoundNodeSelVector;
+
+    std::unique_ptr<LocalRelTableScanState> localTableScanState;
+
+    RelTableScanState(MemoryManager& mm, common::ValueVector* nodeIDVector,
+        std::vector<common::ValueVector*> outputVectors,
+        std::shared_ptr<common::DataChunkState> outChunkState, bool randomLookup = false)
+        : TableScanState{nodeIDVector, std::move(outputVectors), std::move(outChunkState)},
+          direction{common::RelDataDirection::INVALID}, currBoundNodeIdx{0},
+          csrOffsetColumn{nullptr}, csrLengthColumn{nullptr}, randomLookup{randomLookup},
+          localTableScanState{nullptr} {
+        nodeGroupScanState = std::make_unique<CSRNodeGroupScanState>(mm, randomLookup);
+    }
+
+    // This is for local table scan state.
+    RelTableScanState(common::ValueVector* nodeIDVector,
+        std::vector<common::ValueVector*> outputVectors,
+        std::shared_ptr<common::DataChunkState> outChunkState)
+        : TableScanState{nodeIDVector, std::move(outputVectors), std::move(outChunkState)},
+          direction{common::RelDataDirection::INVALID}, currBoundNodeIdx{0},
+          csrOffsetColumn{nullptr}, csrLengthColumn{nullptr}, randomLookup{false},
+          localTableScanState{nullptr} {
+        nodeGroupScanState = std::make_unique<CSRNodeGroupScanState>();
+    }
+
+    void setToTable(const transaction::Transaction* transaction, Table* table_,
+        std::vector<common::column_id_t> columnIDs_,
+        std::vector<ColumnPredicateSet> columnPredicateSets_,
+        common::RelDataDirection direction_) override;
+
+    void initState(transaction::Transaction* transaction, NodeGroup* nodeGroup,
+        bool resetCachedBoundNodeIDs = true) override;
+
+    bool scanNext(transaction::Transaction* transaction) override;
+
+    void setNodeIDVectorToFlat(common::sel_t selPos) const;
+
+private:
+    bool hasUnCommittedData() const;
+
+    void initCachedBoundNodeIDSelVector();
+    void initStateForCommitted(const transaction::Transaction* transaction);
+    void initStateForUncommitted();
+};
+
+class LocalRelTable;
+struct LocalRelTableScanState final : RelTableScanState {
+    LocalRelTable* localRelTable;
+    // TODO(Guodong): Copy of rowIndices here is only to simplify the implementation. We can always
+    // go to the fwdIndex/bwdIndex inside LocalRelTable to find the row indices. We can revisit this
+    // if the copy of rowIndices from fwdIndex/bwdIndex becomes a problem.
+    row_idx_vec_t rowIndices;
+    common::row_idx_t nextRowToScan = 0;
+
+    LocalRelTableScanState(const RelTableScanState& baseScanState, LocalRelTable* localRelTable,
+        std::vector<common::column_id_t> columnIDs)
+        : RelTableScanState{baseScanState.nodeIDVector, baseScanState.outputVectors,
+              baseScanState.outState},
+          localRelTable{localRelTable} {
+        this->columnIDs = std::move(columnIDs);
+        this->direction = baseScanState.direction;
+        // Setting source to UNCOMMITTED is not necessary but just to keep it semantically
+        // consistent.
+        this->source = TableScanSource::UNCOMMITTED;
+        this->nodeGroupScanState->chunkStates.resize(this->columnIDs.size());
+    }
+};
+
+struct LBUG_API RelTableInsertState : TableInsertState {
+    common::ValueVector& srcNodeIDVector;
+    common::ValueVector& dstNodeIDVector;
+
+    common::ValueVector& getBoundNodeIDVector(common::RelDataDirection direction) const {
+        return direction == common::RelDataDirection::FWD ? srcNodeIDVector : dstNodeIDVector;
+    }
+
+    RelTableInsertState(common::ValueVector& srcNodeIDVector, common::ValueVector& dstNodeIDVector,
+        std::vector<common::ValueVector*> propertyVectors)
+        : TableInsertState{std::move(propertyVectors)}, srcNodeIDVector{srcNodeIDVector},
+          dstNodeIDVector{dstNodeIDVector} {}
+};
+
+struct RelTableUpdateState final : TableUpdateState {
+    common::ValueVector& srcNodeIDVector;
+    common::ValueVector& dstNodeIDVector;
+    common::ValueVector& relIDVector;
+
+    common::ValueVector& getBoundNodeIDVector(common::RelDataDirection direction) const {
+        return direction == common::RelDataDirection::FWD ? srcNodeIDVector : dstNodeIDVector;
+    }
+
+    RelTableUpdateState(common::column_id_t columnID, common::ValueVector& srcNodeIDVector,
+        common::ValueVector& dstNodeIDVector, common::ValueVector& relIDVector,
+        common::ValueVector& propertyVector)
+        : TableUpdateState{columnID, propertyVector}, srcNodeIDVector{srcNodeIDVector},
+          dstNodeIDVector{dstNodeIDVector}, relIDVector{relIDVector} {}
+};
+
+struct LBUG_API RelTableDeleteState final : TableDeleteState {
+    common::ValueVector& srcNodeIDVector;
+    common::ValueVector& dstNodeIDVector;
+    common::ValueVector& relIDVector;
+    common::RelDataDirection detachDeleteDirection;
+
+    common::ValueVector& getBoundNodeIDVector(common::RelDataDirection direction) const {
+        return direction == common::RelDataDirection::FWD ? srcNodeIDVector : dstNodeIDVector;
+    }
+
+    RelTableDeleteState(common::ValueVector& srcNodeIDVector, common::ValueVector& dstNodeIDVector,
+        common::ValueVector& relIDVector,
+        common::RelDataDirection detachDeleteDirection = common::RelDataDirection::FWD)
+        : srcNodeIDVector{srcNodeIDVector}, dstNodeIDVector{dstNodeIDVector},
+          relIDVector{relIDVector}, detachDeleteDirection{detachDeleteDirection} {}
+};
+
+class LBUG_API RelTable final : public Table {
+public:
+    using rel_multiplicity_constraint_throw_func_t =
+        std::function<void(const std::string&, common::offset_t, common::RelDataDirection)>;
+
+    RelTable(catalog::RelGroupCatalogEntry* relGroupEntry, common::table_id_t fromTableID,
+        common::table_id_t toTableID, const StorageManager* storageManager,
+        MemoryManager* memoryManager);
+
+    common::table_id_t getFromNodeTableID() const { return fromNodeTableID; }
+    common::table_id_t getToNodeTableID() const { return toNodeTableID; }
+
+    void initScanState(transaction::Transaction* transaction, TableScanState& scanState,
+        bool resetCachedBoundNodeSelVec = true) const override;
+
+    bool scanInternal(transaction::Transaction* transaction, TableScanState& scanState) override;
+
+    void initInsertState(main::ClientContext*, TableInsertState&) override {
+        // DO NOTHING.
+    }
+    void insert(transaction::Transaction* transaction, TableInsertState& insertState) override;
+    void update(transaction::Transaction* transaction, TableUpdateState& updateState) override;
+    bool delete_(transaction::Transaction* transaction, TableDeleteState& deleteState) override;
+
+    // Deletes all edges attached to the node(s) specified in the deleteState
+    // Currently only supports deleting from a single src node
+    // Note that since the rel table doesn't store nodes this doesn't delete the node itself
+    void detachDelete(transaction::Transaction* transaction, RelTableDeleteState* deleteState);
+    bool checkIfNodeHasRels(transaction::Transaction* transaction,
+        common::RelDataDirection direction, common::ValueVector* srcNodeIDVector) const;
+    void throwIfNodeHasRels(transaction::Transaction* transaction,
+        common::RelDataDirection direction, common::ValueVector* srcNodeIDVector,
+        const rel_multiplicity_constraint_throw_func_t& throwFunc) const;
+
+    void addColumn(transaction::Transaction* transaction, TableAddColumnState& addColumnState,
+        PageAllocator& pageAllocator) override;
+    Column* getCSROffsetColumn(common::RelDataDirection direction) const {
+        return getDirectedTableData(direction)->getCSROffsetColumn();
+    }
+    Column* getCSRLengthColumn(common::RelDataDirection direction) const {
+        return getDirectedTableData(direction)->getCSRLengthColumn();
+    }
+    common::column_id_t getNumColumns() const {
+        KU_ASSERT(directedRelData.size() >= 1);
+        RUNTIME_CHECK(for (const auto& relData
+                           : directedRelData) {
+            KU_ASSERT(relData->getNumColumns() == directedRelData[0]->getNumColumns());
+        });
+        return directedRelData[0]->getNumColumns();
+    }
+    Column* getColumn(common::column_id_t columnID, common::RelDataDirection direction) const {
+        return getDirectedTableData(direction)->getColumn(columnID);
+    }
+
+    NodeGroup* getOrCreateNodeGroup(const transaction::Transaction* transaction,
+        common::node_group_idx_t nodeGroupIdx, common::RelDataDirection direction) const;
+
+    void commit(main::ClientContext* context, catalog::TableCatalogEntry* tableEntry,
+        LocalTable* localTable) override;
+    bool checkpoint(main::ClientContext*, catalog::TableCatalogEntry* tableEntry,
+        PageAllocator& pageAllocator) override;
+    void rollbackCheckpoint() override {};
+    void reclaimStorage(PageAllocator& pageAllocator) const override;
+
+    common::row_idx_t getNumTotalRows(const transaction::Transaction* transaction) override;
+
+    RelTableData* getDirectedTableData(common::RelDataDirection direction) const;
+
+    common::offset_t reserveRelOffsets(common::offset_t numRels) {
+        std::unique_lock xLck{relOffsetMtx};
+        const auto currentRelOffset = nextRelOffset;
+        nextRelOffset += numRels;
+        return currentRelOffset;
+    }
+
+    void pushInsertInfo(const transaction::Transaction* transaction,
+        common::RelDataDirection direction, const CSRNodeGroup& nodeGroup,
+        common::row_idx_t numRows_, CSRNodeGroupScanSource source) const;
+
+    std::vector<common::RelDataDirection> getStorageDirections() const;
+    common::table_id_t getRelGroupID() const { return relGroupID; }
+
+    void serialize(common::Serializer& ser) const override;
+    void deserialize(main::ClientContext* context, StorageManager* storageManager,
+        common::Deserializer& deSer) override;
+
+private:
+    static void prepareCommitForNodeGroup(const transaction::Transaction* transaction,
+        const std::vector<common::column_id_t>& columnIDs, const NodeGroup& localNodeGroup,
+        CSRNodeGroup& csrNodeGroup, common::offset_t boundOffsetInGroup,
+        const row_idx_vec_t& rowIndices, common::column_id_t skippedColumn);
+
+    void updateRelOffsets(const LocalRelTable& localRelTable);
+
+    static common::offset_t getCommittedOffset(common::offset_t uncommittedOffset,
+        common::offset_t maxCommittedOffset);
+
+    void detachDeleteForCSRRels(transaction::Transaction* transaction, RelTableData* tableData,
+        RelTableData* reverseTableData, RelTableScanState* relDataReadState,
+        RelTableDeleteState* deleteState);
+
+    void checkRelMultiplicityConstraint(transaction::Transaction* transaction,
+        const TableInsertState& state) const;
+
+private:
+    common::table_id_t relGroupID;
+    common::table_id_t fromNodeTableID;
+    common::table_id_t toNodeTableID;
+    std::mutex relOffsetMtx;
+    common::offset_t nextRelOffset;
+    std::vector<std::unique_ptr<RelTableData>> directedRelData;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/rel_table_data.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/rel_table_data.h
new file mode 100644
index 0000000000..ca0a3675b4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/rel_table_data.h
@@ -0,0 +1,167 @@
+#pragma once
+
+#include <cmath>
+
+#include "common/enums/rel_direction.h"
+#include "common/enums/rel_multiplicity.h"
+#include "storage/table/column.h"
+#include "storage/table/csr_node_group.h"
+#include "storage/table/node_group_collection.h"
+
+namespace lbug {
+namespace catalog {
+class RelGroupCatalogEntry;
+}
+namespace transaction {
+class Transaction;
+}
+namespace storage {
+class Table;
+class MemoryManager;
+class RelTableData;
+
+struct CSRHeaderColumns {
+    std::unique_ptr<Column> offset;
+    std::unique_ptr<Column> length;
+};
+
+class PersistentVersionRecordHandler final : public VersionRecordHandler {
+public:
+    explicit PersistentVersionRecordHandler(RelTableData* relTableData);
+
+    void applyFuncToChunkedGroups(version_record_handler_op_t func,
+        common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+        common::row_idx_t numRows, common::transaction_t commitTS) const override;
+    void rollbackInsert(main::ClientContext* context, common::node_group_idx_t nodeGroupIdx,
+        common::row_idx_t startRow, common::row_idx_t numRows) const override;
+
+private:
+    RelTableData* relTableData;
+};
+
+class InMemoryVersionRecordHandler final : public VersionRecordHandler {
+public:
+    explicit InMemoryVersionRecordHandler(RelTableData* relTableData);
+
+    void applyFuncToChunkedGroups(version_record_handler_op_t func,
+        common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+        common::row_idx_t numRows, common::transaction_t commitTS) const override;
+    void rollbackInsert(main::ClientContext* context, common::node_group_idx_t nodeGroupIdx,
+        common::row_idx_t startRow, common::row_idx_t numRows) const override;
+
+private:
+    RelTableData* relTableData;
+};
+
+class RelTableData {
+public:
+    RelTableData(FileHandle* dataFH, MemoryManager* mm, ShadowFile* shadowFile,
+        const catalog::RelGroupCatalogEntry& relGroupEntry, Table& table,
+        common::RelDataDirection direction, common::table_id_t nbrTableID, bool enableCompression);
+
+    bool update(transaction::Transaction* transaction, common::ValueVector& boundNodeIDVector,
+        const common::ValueVector& relIDVector, common::column_id_t columnID,
+        const common::ValueVector& dataVector) const;
+    bool delete_(transaction::Transaction* transaction, common::ValueVector& boundNodeIDVector,
+        const common::ValueVector& relIDVector);
+    void addColumn(TableAddColumnState& addColumnState, PageAllocator& pageAllocator);
+
+    bool checkIfNodeHasRels(transaction::Transaction* transaction,
+        common::ValueVector* srcNodeIDVector) const;
+
+    Column* getNbrIDColumn() const { return columns[NBR_ID_COLUMN_ID].get(); }
+    Column* getCSROffsetColumn() const { return csrHeaderColumns.offset.get(); }
+    Column* getCSRLengthColumn() const { return csrHeaderColumns.length.get(); }
+    common::column_id_t getNumColumns() const { return columns.size(); }
+    Column* getColumn(common::column_id_t columnID) const { return columns[columnID].get(); }
+    std::vector<const Column*> getColumns() const {
+        std::vector<const Column*> result;
+        result.reserve(columns.size());
+        for (const auto& column : columns) {
+            result.push_back(column.get());
+        }
+        return result;
+    }
+    common::node_group_idx_t getNumNodeGroups() const { return nodeGroups->getNumNodeGroups(); }
+    NodeGroup* getNodeGroup(common::node_group_idx_t nodeGroupIdx) const {
+        return nodeGroups->getNodeGroup(nodeGroupIdx, true /*mayOutOfBound*/);
+    }
+    NodeGroup* getOrCreateNodeGroup(const transaction::Transaction* transaction,
+        common::node_group_idx_t nodeGroupIdx) const {
+        return nodeGroups->getOrCreateNodeGroup(transaction, nodeGroupIdx,
+            NodeGroupDataFormat::CSR);
+    }
+
+    common::RelMultiplicity getMultiplicity() const { return multiplicity; }
+
+    TableStats getStats() const { return nodeGroups->getStats(); }
+
+    void reclaimStorage(PageAllocator& pageAllocator) const;
+    void checkpoint(const std::vector<common::column_id_t>& columnIDs,
+        PageAllocator& pageAllocator);
+
+    void pushInsertInfo(const transaction::Transaction* transaction, const CSRNodeGroup& nodeGroup,
+        common::row_idx_t numRows_, CSRNodeGroupScanSource source);
+
+    void serialize(common::Serializer& serializer) const;
+    void deserialize(common::Deserializer& deSerializer, MemoryManager& memoryManager);
+
+    NodeGroup* getNodeGroupNoLock(common::node_group_idx_t nodeGroupIdx) const {
+        return nodeGroups->getNodeGroupNoLock(nodeGroupIdx);
+    }
+
+    void rollbackGroupCollectionInsert(common::row_idx_t numRows_, bool isPersistent);
+
+    common::RelDataDirection getDirection() const { return direction; }
+
+private:
+    void initCSRHeaderColumns(FileHandle* dataFH);
+    void initPropertyColumns(const catalog::RelGroupCatalogEntry& relGroupEntry,
+        common::table_id_t nbrTableID, FileHandle* dataFH);
+
+    std::pair<CSRNodeGroupScanSource, common::row_idx_t> findMatchingRow(
+        transaction::Transaction* transaction, common::ValueVector& boundNodeIDVector,
+        const common::ValueVector& relIDVector) const;
+
+    template<typename T1, typename T2>
+    static double divideNoRoundUp(T1 v1, T2 v2) {
+        static_assert(std::is_arithmetic_v<T1> && std::is_arithmetic_v<T2>);
+        return static_cast<double>(v1) / static_cast<double>(v2);
+    }
+    template<typename T1, typename T2>
+    static uint64_t multiplyAndRoundUpTo(T1 v1, T2 v2) {
+        static_assert(std::is_arithmetic_v<T1> && std::is_arithmetic_v<T2>);
+        return std::ceil(static_cast<double>(v1) * static_cast<double>(v2));
+    }
+
+    std::vector<common::LogicalType> getColumnTypes() const {
+        std::vector<common::LogicalType> types;
+        types.reserve(columns.size());
+        for (const auto& column : columns) {
+            types.push_back(column->getDataType().copy());
+        }
+        return types;
+    }
+
+    const VersionRecordHandler* getVersionRecordHandler(CSRNodeGroupScanSource source) const;
+
+private:
+    Table& table;
+    MemoryManager* mm;
+    ShadowFile* shadowFile;
+    bool enableCompression;
+    PackedCSRInfo packedCSRInfo;
+    common::RelDataDirection direction;
+    common::RelMultiplicity multiplicity;
+
+    std::unique_ptr<NodeGroupCollection> nodeGroups;
+
+    CSRHeaderColumns csrHeaderColumns;
+    std::vector<std::unique_ptr<Column>> columns;
+
+    PersistentVersionRecordHandler persistentVersionRecordHandler;
+    InMemoryVersionRecordHandler inMemoryVersionRecordHandler;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/string_chunk_data.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/string_chunk_data.h
new file mode 100644
index 0000000000..8d0d45f94a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/string_chunk_data.h
@@ -0,0 +1,111 @@
+#pragma once
+
+#include "common/assert.h"
+#include "common/data_chunk/sel_vector.h"
+#include "common/types/types.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/dictionary_chunk.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+
+class StringChunkData final : public ColumnChunkData {
+public:
+    static constexpr common::idx_t DATA_COLUMN_CHILD_READ_STATE_IDX = 0;
+    static constexpr common::idx_t OFFSET_COLUMN_CHILD_READ_STATE_IDX = 1;
+    static constexpr common::idx_t INDEX_COLUMN_CHILD_READ_STATE_IDX = 2;
+    static constexpr common::idx_t CHILD_COLUMN_COUNT = 3;
+
+    StringChunkData(MemoryManager& mm, common::LogicalType dataType, uint64_t capacity,
+        bool enableCompression, ResidencyState residencyState);
+    StringChunkData(MemoryManager& mm, bool enableCompression, const ColumnChunkMetadata& metadata);
+    void resetToEmpty() override;
+
+    void append(common::ValueVector* vector, const common::SelectionView& selView) override;
+    void append(const ColumnChunkData* other, common::offset_t startPosInOtherChunk,
+        uint32_t numValuesToAppend) override;
+    ColumnChunkData* getIndexColumnChunk();
+    const ColumnChunkData* getIndexColumnChunk() const;
+
+    void initializeScanState(SegmentState& state, const Column* column) const override;
+    void scan(common::ValueVector& output, common::offset_t offset, common::length_t length,
+        common::sel_t posInOutputVector = 0) const override;
+    void lookup(common::offset_t offsetInChunk, common::ValueVector& output,
+        common::sel_t posInOutputVector) const override;
+
+    void write(const common::ValueVector* vector, common::offset_t offsetInVector,
+        common::offset_t offsetInChunk) override;
+    void write(ColumnChunkData* chunk, ColumnChunkData* dstOffsets,
+        common::RelMultiplicity multiplicity) override;
+    void write(const ColumnChunkData* srcChunk, common::offset_t srcOffsetInChunk,
+        common::offset_t dstOffsetInChunk, common::offset_t numValuesToCopy) override;
+
+    template<typename T>
+    T getValue(common::offset_t /*pos*/) const {
+        KU_UNREACHABLE;
+    }
+
+    uint64_t getStringLength(common::offset_t pos) const {
+        const auto index = indexColumnChunk->getValue<DictionaryChunk::string_index_t>(pos);
+        return dictionaryChunk->getStringLength(index);
+    }
+
+    void setIndexChunk(std::unique_ptr<ColumnChunkData> indexChunk) {
+        indexColumnChunk = std::move(indexChunk);
+    }
+    DictionaryChunk& getDictionaryChunk() { return *dictionaryChunk; }
+    const DictionaryChunk& getDictionaryChunk() const { return *dictionaryChunk; }
+
+    void finalize() override;
+
+    void flush(PageAllocator& pageAllocator) override;
+    uint64_t getSizeOnDisk() const override;
+    uint64_t getMinimumSizeOnDisk() const override;
+    uint64_t getSizeOnDiskInMemoryStats() const override;
+    void reclaimStorage(PageAllocator& pageAllocator) override;
+
+    void resetNumValuesFromMetadata() override;
+    void syncNumValues() override {
+        numValues = indexColumnChunk->getNumValues();
+        metadata.numValues = numValues;
+    }
+
+    void setToInMemory() override;
+    void resize(uint64_t newCapacity) override;
+    void resizeWithoutPreserve(uint64_t newCapacity) override;
+    uint64_t getEstimatedMemoryUsage() const override;
+
+    void serialize(common::Serializer& serializer) const override;
+    static void deserialize(common::Deserializer& deSer, ColumnChunkData& chunkData);
+
+private:
+    void appendStringColumnChunk(const StringChunkData* other,
+        common::offset_t startPosInOtherChunk, uint32_t numValuesToAppend);
+
+    void setValueFromString(std::string_view value, uint64_t pos);
+
+    void updateNumValues(size_t newValue);
+
+    void setNumValues(uint64_t numValues) override {
+        ColumnChunkData::setNumValues(numValues);
+        indexColumnChunk->setNumValues(numValues);
+        needFinalize = true;
+    }
+
+private:
+    std::unique_ptr<ColumnChunkData> indexColumnChunk;
+
+    std::unique_ptr<DictionaryChunk> dictionaryChunk;
+    // If we never update a value, we don't need to prune unused strings in finalize
+    bool needFinalize;
+};
+
+// STRING
+template<>
+std::string StringChunkData::getValue<std::string>(common::offset_t pos) const;
+template<>
+std::string_view StringChunkData::getValue<std::string_view>(common::offset_t pos) const;
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/string_column.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/string_column.h
new file mode 100644
index 0000000000..fc2a548294
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/string_column.h
@@ -0,0 +1,67 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/table/dictionary_column.h"
+
+namespace lbug {
+namespace storage {
+
+class StringColumn final : public Column {
+public:
+    enum class ChildStateIndex : common::idx_t { DATA = 0, OFFSET = 1, INDEX = 2 };
+    static constexpr size_t CHILD_STATE_COUNT = 3;
+
+    StringColumn(std::string name, common::LogicalType dataType, FileHandle* dataFH,
+        MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression);
+
+    static std::unique_ptr<ColumnChunkData> flushChunkData(const ColumnChunkData& chunkData,
+        PageAllocator& pageAllocator);
+
+    void writeSegment(ColumnChunkData& persistentChunk, SegmentState& state,
+        common::offset_t dstOffsetInSegment, const ColumnChunkData& data,
+        common::offset_t srcOffset, common::length_t numValues) const override;
+
+    std::vector<std::unique_ptr<ColumnChunkData>> checkpointSegment(
+        ColumnCheckpointState&& checkpointState, PageAllocator& pageAllocator,
+        bool canSplitSegment = true) const override;
+
+    const DictionaryColumn& getDictionary() const { return dictionary; }
+    const Column* getIndexColumn() const { return indexColumn.get(); }
+
+    static SegmentState& getChildState(SegmentState& state, ChildStateIndex child);
+    static const SegmentState& getChildState(const SegmentState& state, ChildStateIndex child);
+
+protected:
+    void scanSegment(const SegmentState& state, common::offset_t startOffsetInChunk,
+        common::row_idx_t numValuesToScan, common::ValueVector* resultVector,
+        common::offset_t offsetInResult) const override;
+
+    void scanSegment(const SegmentState& state, ColumnChunkData* resultChunk,
+        common::offset_t startOffsetInSegment, common::row_idx_t numValuesToScan) const override;
+
+    void scanUnfiltered(const SegmentState& state, common::offset_t startOffsetInChunk,
+        common::offset_t numValuesToRead, common::ValueVector* resultVector,
+        common::sel_t startPosInVector = 0) const;
+    void scanFiltered(const SegmentState& state, common::offset_t startOffsetInChunk,
+        common::ValueVector* resultVector, common::sel_t startPosInVector) const;
+
+    void lookupInternal(const SegmentState& state, common::offset_t nodeOffset,
+        common::ValueVector* resultVector, uint32_t posInVector) const override;
+
+private:
+    bool canCheckpointInPlace(const SegmentState& state,
+        const ColumnCheckpointState& checkpointState) const override;
+
+    bool canIndexCommitInPlace(const SegmentState& state, uint64_t numStrings,
+        common::offset_t maxOffset) const;
+
+private:
+    // Main column stores indices of values in the dictionary
+    DictionaryColumn dictionary;
+
+    std::unique_ptr<Column> indexColumn;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/struct_chunk_data.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/struct_chunk_data.h
new file mode 100644
index 0000000000..27ad6061ac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/struct_chunk_data.h
@@ -0,0 +1,96 @@
+#pragma once
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/types/types.h"
+#include "storage/table/column_chunk_data.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+
+class StructChunkData final : public ColumnChunkData {
+public:
+    StructChunkData(MemoryManager& mm, common::LogicalType dataType, uint64_t capacity,
+        bool enableCompression, ResidencyState residencyState);
+    StructChunkData(MemoryManager& mm, common::LogicalType dataType, bool enableCompression,
+        const ColumnChunkMetadata& metadata);
+
+    ColumnChunkData* getChild(common::idx_t childIdx) {
+        KU_ASSERT(childIdx < childChunks.size());
+        return childChunks[childIdx].get();
+    }
+    std::unique_ptr<ColumnChunkData> moveChild(common::idx_t childIdx) {
+        KU_ASSERT(childIdx < childChunks.size());
+        return std::move(childChunks[childIdx]);
+    }
+
+    void finalize() override;
+
+    uint64_t getEstimatedMemoryUsage() const override;
+
+    void resetNumValuesFromMetadata() override;
+    void syncNumValues() override {
+        KU_ASSERT(!childChunks.empty());
+        numValues = childChunks[0]->getNumValues();
+        metadata.numValues = numValues;
+    }
+
+    void serialize(common::Serializer& serializer) const override;
+    static void deserialize(common::Deserializer& deSer, ColumnChunkData& chunkData);
+
+    common::idx_t getNumChildren() const { return childChunks.size(); }
+    const ColumnChunkData& getChild(common::idx_t childIdx) const {
+        KU_ASSERT(childIdx < childChunks.size());
+        return *childChunks[childIdx];
+    }
+    void setChild(common::idx_t childIdx, std::unique_ptr<ColumnChunkData> childChunk) {
+        KU_ASSERT(childIdx < childChunks.size());
+        childChunks[childIdx] = std::move(childChunk);
+    }
+
+    void flush(PageAllocator& pageAllocator) override;
+    uint64_t getSizeOnDisk() const override;
+    uint64_t getMinimumSizeOnDisk() const override;
+    uint64_t getSizeOnDiskInMemoryStats() const override;
+    void reclaimStorage(PageAllocator& pageAllocator) override;
+
+protected:
+    void append(const ColumnChunkData* other, common::offset_t startPosInOtherChunk,
+        uint32_t numValuesToAppend) override;
+    void append(common::ValueVector* vector, const common::SelectionView& selView) override;
+
+    void scan(common::ValueVector& output, common::offset_t offset, common::length_t length,
+        common::sel_t posInOutputVector = 0) const override;
+    void lookup(common::offset_t offsetInChunk, common::ValueVector& output,
+        common::sel_t posInOutputVector) const override;
+    void initializeScanState(SegmentState& state, const Column* column) const override;
+
+    void write(const common::ValueVector* vector, common::offset_t offsetInVector,
+        common::offset_t offsetInChunk) override;
+    void write(ColumnChunkData* chunk, ColumnChunkData* dstOffsets,
+        common::RelMultiplicity multiplicity) override;
+    void write(const ColumnChunkData* srcChunk, common::offset_t srcOffsetInChunk,
+        common::offset_t dstOffsetInChunk, common::offset_t numValuesToCopy) override;
+
+    void setToInMemory() override;
+    void resize(uint64_t newCapacity) override;
+    void resizeWithoutPreserve(uint64_t newCapacity) override;
+
+    void resetToEmpty() override;
+    void resetToAllNull() override;
+
+    bool numValuesSanityCheck() const override;
+
+    void setNumValues(uint64_t numValues) override {
+        ColumnChunkData::setNumValues(numValues);
+        for (auto& childChunk : childChunks) {
+            childChunk->setNumValues(numValues);
+        }
+    }
+
+private:
+    std::vector<std::unique_ptr<ColumnChunkData>> childChunks;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/struct_column.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/struct_column.h
new file mode 100644
index 0000000000..2584ef2112
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/struct_column.h
@@ -0,0 +1,48 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "storage/table/column.h"
+
+namespace lbug {
+namespace storage {
+class MemoryManager;
+
+class StructColumn final : public Column {
+public:
+    StructColumn(std::string name, common::LogicalType dataType, FileHandle* dataFH,
+        MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression);
+
+    static std::unique_ptr<ColumnChunkData> flushChunkData(const ColumnChunkData& chunk,
+        PageAllocator& pageAllocator);
+
+    Column* getChild(common::idx_t childIdx) const {
+        KU_ASSERT(childIdx < childColumns.size());
+        return childColumns[childIdx].get();
+    }
+    void writeSegment(ColumnChunkData& persistentChunk, SegmentState& state,
+        common::offset_t offsetInSegment, const ColumnChunkData& data, common::offset_t dataOffset,
+        common::length_t numValues) const override;
+
+    std::vector<std::unique_ptr<ColumnChunkData>> checkpointSegment(
+        ColumnCheckpointState&& checkpointState, PageAllocator& pageAllocator,
+        bool canSplitSegment = true) const override;
+
+protected:
+    void scanSegment(const SegmentState& state, ColumnChunkData* resultChunk,
+        common::offset_t startOffsetInSegment, common::row_idx_t numValuesToScan) const override;
+    void scanSegment(const SegmentState& state, common::offset_t startOffsetInSegment,
+        common::row_idx_t numValuesToScan, common::ValueVector* resultVector,
+        common::offset_t offsetInResult) const override;
+
+    void lookupInternal(const SegmentState& state, common::offset_t offsetInSegment,
+        common::ValueVector* resultVector, uint32_t posInVector) const override;
+
+    bool canCheckpointInPlace(const SegmentState& state,
+        const ColumnCheckpointState& checkpointState) const override;
+
+private:
+    std::vector<std::unique_ptr<Column>> childColumns;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/table.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/table.h
new file mode 100644
index 0000000000..60f32a1a25
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/table.h
@@ -0,0 +1,221 @@
+#pragma once
+
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/enums/rel_direction.h"
+#include "common/mask.h"
+#include "storage/predicate/column_predicate.h"
+#include "storage/table/column.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/node_group.h"
+
+namespace lbug {
+namespace evaluator {
+class ExpressionEvaluator;
+} // namespace evaluator
+namespace storage {
+class MemoryManager;
+class Table;
+
+enum class TableScanSource : uint8_t { COMMITTED = 0, UNCOMMITTED = 1, NONE = UINT8_MAX };
+
+struct LBUG_API TableScanState {
+    Table* table;
+    std::unique_ptr<common::ValueVector> rowIdxVector;
+    // Node/Rel ID vector. We assume all output vectors are within the same DataChunk as this one.
+    common::ValueVector* nodeIDVector;
+    std::vector<common::ValueVector*> outputVectors;
+    std::shared_ptr<common::DataChunkState> outState;
+    std::vector<common::column_id_t> columnIDs;
+    common::SemiMask* semiMask;
+
+    // Only used when scan from persistent data.
+    std::vector<const Column*> columns;
+
+    TableScanSource source;
+    common::node_group_idx_t nodeGroupIdx;
+    NodeGroup* nodeGroup = nullptr;
+    std::unique_ptr<NodeGroupScanState> nodeGroupScanState;
+
+    std::vector<ColumnPredicateSet> columnPredicateSets;
+
+    TableScanState(common::ValueVector* nodeIDVector,
+        std::vector<common::ValueVector*> outputVectors,
+        std::shared_ptr<common::DataChunkState> outChunkState)
+        : table{nullptr}, nodeIDVector(nodeIDVector), outputVectors{std::move(outputVectors)},
+          outState{std::move(outChunkState)}, semiMask{nullptr}, source{TableScanSource::NONE},
+          nodeGroupIdx{common::INVALID_NODE_GROUP_IDX} {
+        rowIdxVector = std::make_unique<common::ValueVector>(common::LogicalType::INT64());
+        rowIdxVector->state = outState;
+    }
+
+    TableScanState(std::vector<common::column_id_t> columnIDs, std::vector<const Column*> columns)
+        : table{nullptr}, nodeIDVector(nullptr), outState{nullptr}, columnIDs{std::move(columnIDs)},
+          semiMask{nullptr}, columns{std::move(columns)}, source{TableScanSource::NONE},
+          nodeGroupIdx{common::INVALID_NODE_GROUP_IDX} {}
+
+    virtual ~TableScanState();
+    DELETE_COPY_DEFAULT_MOVE(TableScanState);
+
+    virtual void setToTable(const transaction::Transaction* transaction, Table* table_,
+        std::vector<common::column_id_t> columnIDs_,
+        std::vector<ColumnPredicateSet> columnPredicateSets_,
+        common::RelDataDirection direction = common::RelDataDirection::INVALID);
+
+    // Note that `resetCachedBoundNodeSelVec` is only applicable to RelTable for now.
+    virtual void initState(transaction::Transaction* transaction, NodeGroup* nodeGroup,
+        bool /*resetCachedBoundNodeSelVev*/ = true) {
+        KU_ASSERT(nodeGroup);
+        this->nodeGroup = nodeGroup;
+        this->nodeGroup->initializeScanState(transaction, *this);
+    }
+
+    virtual bool scanNext(transaction::Transaction*) { KU_UNREACHABLE; }
+
+    void resetOutVectors();
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& cast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+};
+
+struct LBUG_API TableInsertState {
+    std::vector<common::ValueVector*> propertyVectors;
+    // TODO(Guodong): Remove this when we have a better way to skip WAL logging for FTS.
+    bool logToWAL;
+
+    explicit TableInsertState(std::vector<common::ValueVector*> propertyVectors);
+    virtual ~TableInsertState();
+
+    template<typename T>
+    const T& constCast() const {
+        return common::ku_dynamic_cast<const T&>(*this);
+    }
+    template<typename T>
+    T& cast() {
+        return common::ku_dynamic_cast<T&>(*this);
+    }
+};
+
+struct LBUG_API TableUpdateState {
+    common::column_id_t columnID;
+    common::ValueVector& propertyVector;
+    // TODO(Guodong): Remove this when we have a better way to skip WAL logging for FTS.
+    bool logToWAL;
+
+    TableUpdateState(common::column_id_t columnID, common::ValueVector& propertyVector);
+    virtual ~TableUpdateState();
+
+    template<typename T>
+    const T& constCast() const {
+        return common::ku_dynamic_cast<const T&>(*this);
+    }
+    template<typename T>
+    T& cast() {
+        return common::ku_dynamic_cast<T&>(*this);
+    }
+};
+
+struct LBUG_API TableDeleteState {
+    bool logToWAL;
+
+    TableDeleteState();
+
+    virtual ~TableDeleteState();
+
+    template<typename T>
+    const T& constCast() const {
+        return common::ku_dynamic_cast<const T&>(*this);
+    }
+    template<typename T>
+    T& cast() {
+        return common::ku_dynamic_cast<T&>(*this);
+    }
+};
+
+struct TableAddColumnState final {
+    const binder::PropertyDefinition& propertyDefinition;
+    evaluator::ExpressionEvaluator& defaultEvaluator;
+
+    TableAddColumnState(const binder::PropertyDefinition& propertyDefinition,
+        evaluator::ExpressionEvaluator& defaultEvaluator)
+        : propertyDefinition{propertyDefinition}, defaultEvaluator{defaultEvaluator} {}
+    ~TableAddColumnState() = default;
+};
+
+class LocalTable;
+class StorageManager;
+class LBUG_API Table {
+public:
+    Table(const catalog::TableCatalogEntry* tableEntry, const StorageManager* storageManager,
+        MemoryManager* memoryManager);
+    virtual ~Table();
+
+    common::TableType getTableType() const { return tableType; }
+    common::table_id_t getTableID() const { return tableID; }
+    std::string getTableName() const { return tableName; }
+
+    // Note that `resetCachedBoundNodeIDs` is only applicable to RelTable for now.
+    virtual void initScanState(transaction::Transaction* transaction, TableScanState& readState,
+        bool resetCachedBoundNodeSelVec = true) const = 0;
+    bool scan(transaction::Transaction* transaction, TableScanState& scanState);
+
+    virtual void initInsertState(main::ClientContext* context, TableInsertState& insertState) = 0;
+    virtual void insert(transaction::Transaction* transaction, TableInsertState& insertState) = 0;
+    virtual void update(transaction::Transaction* transaction, TableUpdateState& updateState) = 0;
+    virtual bool delete_(transaction::Transaction* transaction, TableDeleteState& deleteState) = 0;
+
+    virtual void addColumn(transaction::Transaction* transaction,
+        TableAddColumnState& addColumnState, PageAllocator& pageAllocator) = 0;
+    void dropColumn() { setHasChanges(); }
+
+    virtual void commit(main::ClientContext* context, catalog::TableCatalogEntry* tableEntry,
+        LocalTable* localTable) = 0;
+    virtual bool checkpoint(main::ClientContext* context, catalog::TableCatalogEntry* tableEntry,
+        PageAllocator& pageAllocator) = 0;
+    virtual void rollbackCheckpoint() = 0;
+    virtual void reclaimStorage(PageAllocator& pageAllocator) const = 0;
+
+    virtual common::row_idx_t getNumTotalRows(const transaction::Transaction* transaction) = 0;
+
+    void setHasChanges() { hasChanges = true; }
+
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+    template<class TARGET>
+    const TARGET& cast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET* ptrCast() {
+        return common::ku_dynamic_cast<TARGET*>(this);
+    }
+
+    static common::DataChunk constructDataChunk(MemoryManager* mm,
+        std::vector<common::LogicalType> types);
+
+    virtual void serialize(common::Serializer& serializer) const = 0;
+    virtual void deserialize(main::ClientContext* context, StorageManager* storageManager,
+        common::Deserializer& deSer) = 0;
+
+protected:
+    virtual bool scanInternal(transaction::Transaction* transaction, TableScanState& scanState) = 0;
+
+protected:
+    common::TableType tableType;
+    common::table_id_t tableID;
+    std::string tableName;
+    bool enableCompression;
+    MemoryManager* memoryManager;
+    ShadowFile* shadowFile;
+    std::atomic<bool> hasChanges;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/update_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/update_info.h
new file mode 100644
index 0000000000..b6caf7b3fb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/update_info.h
@@ -0,0 +1,132 @@
+#pragma once
+
+#include <array>
+#include <shared_mutex>
+
+#include "column_chunk_data.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace common {
+class ValueVector;
+} // namespace common
+
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace storage {
+class MemoryManager;
+
+class ColumnChunkData;
+struct VectorUpdateInfo {
+    common::transaction_t version;
+    std::array<common::sel_t, common::DEFAULT_VECTOR_CAPACITY> rowsInVector;
+    common::sel_t numRowsUpdated;
+    // Older versions.
+    std::unique_ptr<VectorUpdateInfo> prev;
+    // Newer versions.
+    VectorUpdateInfo* next;
+
+    std::unique_ptr<ColumnChunkData> data;
+
+    VectorUpdateInfo()
+        : version{common::INVALID_TRANSACTION}, rowsInVector{}, numRowsUpdated(0), prev(nullptr),
+          next{nullptr}, data{nullptr} {}
+    VectorUpdateInfo(MemoryManager& memoryManager, const common::transaction_t transactionID,
+        common::LogicalType dataType)
+        : version{transactionID}, rowsInVector{}, numRowsUpdated{0}, prev{nullptr}, next{nullptr} {
+        data = ColumnChunkFactory::createColumnChunkData(memoryManager, std::move(dataType), false,
+            common::DEFAULT_VECTOR_CAPACITY, ResidencyState::IN_MEMORY);
+    }
+
+    std::unique_ptr<VectorUpdateInfo> movePrev() { return std::move(prev); }
+    void setPrev(std::unique_ptr<VectorUpdateInfo> prev_) { this->prev = std::move(prev_); }
+    VectorUpdateInfo* getPrev() const { return prev.get(); }
+    void setNext(VectorUpdateInfo* next_) { this->next = next_; }
+    VectorUpdateInfo* getNext() const { return next; }
+};
+
+struct UpdateNode {
+    mutable std::shared_mutex mtx;
+    std::unique_ptr<VectorUpdateInfo> info;
+
+    UpdateNode() : info{nullptr} {}
+    UpdateNode(UpdateNode&& other) noexcept : info{std::move(other.info)} {}
+    UpdateNode(const UpdateNode& other) = delete;
+
+    bool isEmpty() const {
+        std::shared_lock lock{mtx};
+        return info != nullptr;
+    }
+    void clear() {
+        std::unique_lock lock{mtx};
+        info = nullptr;
+    }
+};
+
+class UpdateInfo {
+public:
+    using iterate_read_from_row_func_t =
+        std::function<void(const VectorUpdateInfo&, uint64_t, uint64_t)>;
+
+    UpdateInfo() {}
+
+    VectorUpdateInfo& update(MemoryManager& memoryManager,
+        const transaction::Transaction* transaction, common::idx_t vectorIdx,
+        common::sel_t rowIdxInVector, const common::ValueVector& values);
+
+    void clearVectorInfo(common::idx_t vectorIdx) {
+        std::unique_lock lock{mtx};
+        updates[vectorIdx]->clear();
+    }
+
+    common::idx_t getNumVectors() const {
+        std::shared_lock lock{mtx};
+        return updates.size();
+    }
+
+    void scan(const transaction::Transaction* transaction, common::ValueVector& output,
+        common::offset_t offsetInChunk, common::length_t length) const;
+    void lookup(const transaction::Transaction* transaction, common::offset_t rowInChunk,
+        common::ValueVector& output, common::sel_t posInOutputVector) const;
+
+    void scanCommitted(const transaction::Transaction* transaction, ColumnChunkData& output,
+        common::offset_t startOffsetInOutput, common::row_idx_t startRowScanned,
+        common::row_idx_t numRows) const;
+
+    void iterateVectorInfo(const transaction::Transaction* transaction, common::idx_t idx,
+        const std::function<void(const VectorUpdateInfo&)>& func) const;
+
+    void commit(common::idx_t vectorIdx, VectorUpdateInfo* info, common::transaction_t commitTS);
+    void rollback(common::idx_t vectorIdx, common::transaction_t version);
+
+    common::row_idx_t getNumUpdatedRows(const transaction::Transaction* transaction) const;
+
+    bool hasUpdates(const transaction::Transaction* transaction, common::row_idx_t startRow,
+        common::length_t numRows) const;
+
+    bool isSet() const {
+        std::shared_lock lock{mtx};
+        return !updates.empty();
+    }
+    void reset() {
+        std::unique_lock lock{mtx};
+        updates.clear();
+    }
+
+    void iterateScan(const transaction::Transaction* transaction, uint64_t startOffsetToScan,
+        uint64_t numRowsToScan, uint64_t startPosInOutput,
+        const iterate_read_from_row_func_t& readFromRowFunc) const;
+
+private:
+    UpdateNode& getUpdateNode(common::idx_t vectorIdx);
+    UpdateNode& getOrCreateUpdateNode(common::idx_t vectorIdx);
+
+private:
+    mutable std::shared_mutex mtx;
+    std::vector<std::unique_ptr<UpdateNode>> updates;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/version_info.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/version_info.h
new file mode 100644
index 0000000000..b13738f0c2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/version_info.h
@@ -0,0 +1,65 @@
+#pragma once
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace transaction {
+class Transaction;
+} // namespace transaction
+
+namespace storage {
+
+class ChunkedNodeGroup;
+struct VectorVersionInfo;
+
+class LBUG_API VersionInfo {
+public:
+    VersionInfo();
+    ~VersionInfo();
+    DELETE_BOTH_COPY(VersionInfo);
+
+    void append(common::transaction_t transactionID, common::row_idx_t startRow,
+        common::row_idx_t numRows);
+    bool delete_(common::transaction_t transactionID, common::row_idx_t rowIdx);
+
+    bool isSelected(common::transaction_t startTS, common::transaction_t transactionID,
+        common::row_idx_t rowIdx) const;
+    void getSelVectorToScan(common::transaction_t startTS, common::transaction_t transactionID,
+        common::SelectionVector& selVector, common::row_idx_t startRow,
+        common::row_idx_t numRows) const;
+
+    void clearVectorInfo(common::idx_t vectorIdx);
+
+    bool hasDeletions() const;
+    common::row_idx_t getNumDeletions(const transaction::Transaction* transaction,
+        common::row_idx_t startRow, common::length_t numRows) const;
+    bool hasInsertions() const;
+    bool isDeleted(const transaction::Transaction* transaction, common::row_idx_t rowInChunk) const;
+    bool isInserted(const transaction::Transaction* transaction,
+        common::row_idx_t rowInChunk) const;
+
+    bool hasDeletions(const transaction::Transaction* transaction) const;
+
+    common::idx_t getNumVectors() const { return vectorsInfo.size(); }
+
+    void commitInsert(common::row_idx_t startRow, common::row_idx_t numRows,
+        common::transaction_t commitTS);
+    void rollbackInsert(common::row_idx_t startRow, common::row_idx_t numRows);
+    void commitDelete(common::row_idx_t startRow, common::row_idx_t numRows,
+        common::transaction_t commitTS);
+    void rollbackDelete(common::row_idx_t startRow, common::row_idx_t numRows);
+
+    void serialize(common::Serializer& serializer) const;
+    static std::unique_ptr<VersionInfo> deserialize(common::Deserializer& deSer);
+
+private:
+    // Return nullptr when vectorIdx is out of range or when the vector is not created.
+    VectorVersionInfo* getVectorVersionInfo(common::idx_t vectorIdx) const;
+    VectorVersionInfo& getOrCreateVersionInfo(common::idx_t vectorIdx);
+
+    std::vector<std::unique_ptr<VectorVersionInfo>> vectorsInfo;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/version_record_handler.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/version_record_handler.h
new file mode 100644
index 0000000000..aca176e222
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/table/version_record_handler.h
@@ -0,0 +1,29 @@
+#pragma once
+
+#include "common/types/types.h"
+#include "transaction/transaction.h"
+
+namespace lbug {
+
+namespace storage {
+
+class ChunkedNodeGroup;
+
+using version_record_handler_op_t = void (
+    ChunkedNodeGroup::*)(common::row_idx_t, common::row_idx_t, common::transaction_t);
+
+// Note: these handlers are not safe to use in multi-threaded contexts without external locking
+class VersionRecordHandler {
+public:
+    virtual ~VersionRecordHandler() = default;
+
+    virtual void applyFuncToChunkedGroups(version_record_handler_op_t func,
+        common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+        common::row_idx_t numRows, common::transaction_t commitTS) const = 0;
+
+    virtual void rollbackInsert(main::ClientContext* context, common::node_group_idx_t nodeGroupIdx,
+        common::row_idx_t startRow, common::row_idx_t numRows) const;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/undo_buffer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/undo_buffer.h
new file mode 100644
index 0000000000..6c806a3634
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/undo_buffer.h
@@ -0,0 +1,129 @@
+#pragma once
+
+#include <mutex>
+
+#include "buffer_manager/memory_manager.h"
+#include "common/types/types.h"
+
+namespace lbug {
+namespace catalog {
+class CatalogEntry;
+class CatalogSet;
+class SequenceCatalogEntry;
+struct SequenceRollbackData;
+} // namespace catalog
+namespace transaction {
+class Transaction;
+}
+
+namespace main {
+class ClientContext;
+}
+namespace storage {
+class VersionRecordHandler;
+
+class UndoMemoryBuffer {
+public:
+    static constexpr uint64_t UNDO_MEMORY_BUFFER_INIT_CAPACITY = common::LBUG_PAGE_SIZE;
+
+    explicit UndoMemoryBuffer(std::unique_ptr<MemoryBuffer> buffer, uint64_t capacity)
+        : buffer{std::move(buffer)}, capacity{capacity} {
+        currentPosition = 0;
+    }
+
+    uint8_t* getDataUnsafe() const { return buffer->getData(); }
+    uint8_t const* getData() const { return buffer->getData(); }
+    uint64_t getSize() const { return capacity; }
+    uint64_t getCurrentPosition() const { return currentPosition; }
+    void moveCurrentPosition(uint64_t offset) {
+        KU_ASSERT(currentPosition + offset <= capacity);
+        currentPosition += offset;
+    }
+    bool canFit(uint64_t size_) const { return currentPosition + size_ <= this->capacity; }
+
+private:
+    std::unique_ptr<MemoryBuffer> buffer;
+    uint64_t capacity;
+    uint64_t currentPosition;
+};
+
+class UndoBuffer;
+class UndoBufferIterator {
+public:
+    explicit UndoBufferIterator(const UndoBuffer& undoBuffer) : undoBuffer{undoBuffer} {}
+
+    template<typename F>
+    void iterate(F&& callback);
+    template<typename F>
+    void reverseIterate(F&& callback);
+
+private:
+    const UndoBuffer& undoBuffer;
+};
+
+class UpdateInfo;
+class VersionInfo;
+struct VectorUpdateInfo;
+class WAL;
+// This class is not thread safe, as it is supposed to be accessed by a single thread.
+class UndoBuffer {
+    friend class UndoBufferIterator;
+
+public:
+    enum class UndoRecordType : uint16_t {
+        CATALOG_ENTRY = 0,
+        SEQUENCE_ENTRY = 1,
+        UPDATE_INFO = 6,
+        INSERT_INFO = 7,
+        DELETE_INFO = 8,
+    };
+
+    explicit UndoBuffer(MemoryManager* mm) : mm{mm} {}
+
+    void createCatalogEntry(catalog::CatalogSet& catalogSet, catalog::CatalogEntry& catalogEntry);
+    void createSequenceChange(catalog::SequenceCatalogEntry& sequenceEntry,
+        const catalog::SequenceRollbackData& data);
+    void createInsertInfo(common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+        common::row_idx_t numRows, const VersionRecordHandler* versionRecordHandler);
+    void createDeleteInfo(common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+        common::row_idx_t numRows, const VersionRecordHandler* versionRecordHandler);
+    void createVectorUpdateInfo(UpdateInfo* updateInfo, common::idx_t vectorIdx,
+        VectorUpdateInfo* vectorUpdateInfo, common::transaction_t version);
+
+    void commit(common::transaction_t commitTS) const;
+    void rollback(main::ClientContext* context) const;
+
+private:
+    uint8_t* createUndoRecord(uint64_t size);
+
+    void createVersionInfo(UndoRecordType recordType, common::row_idx_t startRow,
+        common::row_idx_t numRows, const VersionRecordHandler* versionRecordHandler,
+        common::node_group_idx_t nodeGroupIdx = 0);
+
+    static void commitRecord(UndoRecordType recordType, const uint8_t* record,
+        common::transaction_t commitTS);
+    static void rollbackRecord(main::ClientContext* context, UndoRecordType recordType,
+        const uint8_t* record);
+
+    static void commitCatalogEntryRecord(const uint8_t* record, common::transaction_t commitTS);
+    static void rollbackCatalogEntryRecord(const uint8_t* record);
+
+    static void commitSequenceEntry(uint8_t const* entry, common::transaction_t commitTS);
+    static void rollbackSequenceEntry(uint8_t const* entry);
+
+    static void commitVersionInfo(UndoRecordType recordType, const uint8_t* record,
+        common::transaction_t commitTS);
+    static void rollbackVersionInfo(main::ClientContext* context, UndoRecordType recordType,
+        const uint8_t* record);
+
+    static void commitVectorUpdateInfo(const uint8_t* record, common::transaction_t commitTS);
+    static void rollbackVectorUpdateInfo(const uint8_t* record);
+
+private:
+    std::mutex mtx;
+    MemoryManager* mm;
+    std::vector<UndoMemoryBuffer> memoryBuffers;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/checksum_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/checksum_reader.h
new file mode 100644
index 0000000000..dcf6a165a9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/checksum_reader.h
@@ -0,0 +1,37 @@
+#pragma once
+
+#include <memory>
+#include <optional>
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/reader.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace storage {
+class ChecksumReader : public common::Reader {
+public:
+    explicit ChecksumReader(common::FileInfo& fileInfo, MemoryManager& memoryManager,
+        std::string_view checksumMismatchMessage);
+
+    void read(uint8_t* data, uint64_t size) override;
+    bool finished() override;
+
+    void onObjectBegin() override;
+    // Reads the stored checksum
+    // Also computes + verifies the checksum for the entry that has just been read against the
+    // stored value
+    void onObjectEnd() override;
+
+    uint64_t getReadOffset() const;
+
+private:
+    common::Deserializer deserializer;
+
+    std::optional<uint64_t> currentEntrySize;
+    std::unique_ptr<MemoryBuffer> entryBuffer;
+
+    std::string_view checksumMismatchMessage;
+};
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/checksum_writer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/checksum_writer.h
new file mode 100644
index 0000000000..6e13bbcfbe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/checksum_writer.h
@@ -0,0 +1,40 @@
+#pragma once
+
+#include <memory>
+#include <optional>
+
+#include "common/serializer/serializer.h"
+#include "common/serializer/writer.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace storage {
+class ChecksumWriter;
+
+// A wrapper on top of another Writer that accumulates serialized data
+// Then flushes that data (along with a computed checksum) when the data has completed serializing
+class ChecksumWriter : public common::Writer {
+public:
+    explicit ChecksumWriter(std::shared_ptr<common::Writer> outputWriter,
+        MemoryManager& memoryManager);
+
+    void write(const uint8_t* data, uint64_t size) override;
+    uint64_t getSize() const override;
+
+    void clear() override;
+    void sync() override;
+
+    void flush() override;
+
+    void onObjectBegin() override;
+    // Calculate checksum + write the checksum + serialized contents to underlying writer
+    void onObjectEnd() override;
+
+private:
+    common::Serializer outputSerializer;
+    std::optional<uint64_t> currentEntrySize;
+    std::unique_ptr<MemoryBuffer> entryBuffer;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/local_wal.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/local_wal.h
new file mode 100644
index 0000000000..8129a584f8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/local_wal.h
@@ -0,0 +1,62 @@
+#pragma once
+
+#include "storage/wal/wal_record.h"
+
+namespace lbug {
+namespace binder {
+struct BoundAlterInfo;
+} // namespace binder
+namespace common {
+class InMemFileWriter;
+class ValueVector;
+} // namespace common
+namespace catalog {
+class CatalogEntry;
+} // namespace catalog
+
+namespace storage {
+class WAL;
+class LocalWAL {
+    friend class WAL;
+
+public:
+    explicit LocalWAL(MemoryManager& mm, bool enableChecksums);
+
+    void logCreateCatalogEntryRecord(catalog::CatalogEntry* catalogEntry, bool isInternal);
+    void logDropCatalogEntryRecord(uint64_t tableID, catalog::CatalogEntryType type);
+    void logAlterCatalogEntryRecord(const binder::BoundAlterInfo* alterInfo);
+    void logUpdateSequenceRecord(common::sequence_id_t sequenceID, uint64_t kCount);
+
+    void logTableInsertion(common::table_id_t tableID, common::TableType tableType,
+        common::row_idx_t numRows, const std::vector<common::ValueVector*>& vectors);
+    void logNodeDeletion(common::table_id_t tableID, common::offset_t nodeOffset,
+        common::ValueVector* pkVector);
+    void logNodeUpdate(common::table_id_t tableID, common::column_id_t columnID,
+        common::offset_t nodeOffset, common::ValueVector* propertyVector);
+    void logRelDelete(common::table_id_t tableID, common::ValueVector* srcNodeVector,
+        common::ValueVector* dstNodeVector, common::ValueVector* relIDVector);
+    void logRelDetachDelete(common::table_id_t tableID, common::RelDataDirection direction,
+        common::ValueVector* srcNodeVector);
+    void logRelUpdate(common::table_id_t tableID, common::column_id_t columnID,
+        common::ValueVector* srcNodeVector, common::ValueVector* dstNodeVector,
+        common::ValueVector* relIDVector, common::ValueVector* propertyVector);
+
+    void logLoadExtension(std::string path);
+
+    void logBeginTransaction();
+    void logCommit();
+
+    void clear();
+    uint64_t getSize();
+
+private:
+    void addNewWALRecord(const WALRecord& walRecord);
+
+private:
+    std::mutex mtx;
+    std::shared_ptr<common::InMemFileWriter> inMemWriter;
+    common::Serializer serializer;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/wal.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/wal.h
new file mode 100644
index 0000000000..0389d5a907
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/wal.h
@@ -0,0 +1,53 @@
+#pragma once
+
+#include "storage/wal/wal_record.h"
+
+namespace lbug {
+namespace common {
+class BufferedFileWriter;
+class VirtualFileSystem;
+} // namespace common
+
+namespace storage {
+class LocalWAL;
+class WAL {
+public:
+    WAL(const std::string& dbPath, bool readOnly, bool enableChecksums,
+        common::VirtualFileSystem* vfs);
+    ~WAL();
+
+    void logCommittedWAL(LocalWAL& localWAL, main::ClientContext* context);
+    void logAndFlushCheckpoint(main::ClientContext* context);
+
+    // Clear any buffer in the WAL writer. Also truncate the WAL file to 0 bytes.
+    void clear();
+    // Reset the WAL writer to nullptr, and remove the WAL file if it exists.
+    void reset();
+
+    uint64_t getFileSize();
+
+    static WAL* Get(const main::ClientContext& context);
+
+private:
+    void initWriter(main::ClientContext* context);
+    void addNewWALRecordNoLock(const WALRecord& walRecord);
+    void flushAndSyncNoLock();
+    void writeHeader(main::ClientContext& context);
+
+private:
+    std::mutex mtx;
+    std::string walPath;
+    bool inMemory;
+    [[maybe_unused]] bool readOnly;
+    common::VirtualFileSystem* vfs;
+    std::unique_ptr<common::FileInfo> fileInfo;
+
+    // Since most writes to the shared WAL will be flushing local WAL (which has its own checksums),
+    // these writes can go through the normal writer. We do still need a checksum writer though for
+    // writing COMMIT/CHECKPOINT records
+    std::unique_ptr<common::Serializer> serializer;
+    bool enableChecksums;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/wal_record.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/wal_record.h
new file mode 100644
index 0000000000..c8c6c40e6e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/wal_record.h
@@ -0,0 +1,341 @@
+#pragma once
+
+#include <cstdint>
+
+#include "binder/ddl/bound_alter_info.h"
+#include "catalog/catalog_entry/catalog_entry.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "common/enums/rel_direction.h"
+#include "common/enums/table_type.h"
+#include "common/types/uuid.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace common {
+class Serializer;
+class Deserializer;
+} // namespace common
+
+namespace storage {
+
+enum class WALRecordType : uint8_t {
+    INVALID_RECORD = 0, // This is not used for any record. 0 is reserved to detect cases where we
+                        // accidentally read from an empty buffer.
+    BEGIN_TRANSACTION_RECORD = 1,
+    COMMIT_RECORD = 2,
+
+    COPY_TABLE_RECORD = 13,
+    CREATE_CATALOG_ENTRY_RECORD = 14,
+    DROP_CATALOG_ENTRY_RECORD = 16,
+    ALTER_TABLE_ENTRY_RECORD = 17,
+    UPDATE_SEQUENCE_RECORD = 18,
+    TABLE_INSERTION_RECORD = 30,
+    NODE_DELETION_RECORD = 31,
+    NODE_UPDATE_RECORD = 32,
+    REL_DELETION_RECORD = 33,
+    REL_DETACH_DELETE_RECORD = 34,
+    REL_UPDATE_RECORD = 35,
+
+    LOAD_EXTENSION_RECORD = 100,
+
+    CHECKPOINT_RECORD = 254,
+};
+
+struct WALHeader {
+    common::ku_uuid_t databaseID;
+    bool enableChecksums;
+};
+
+struct WALRecord {
+    WALRecordType type = WALRecordType::INVALID_RECORD;
+
+    WALRecord() = default;
+    explicit WALRecord(WALRecordType type) : type{type} {}
+    virtual ~WALRecord() = default;
+    DELETE_COPY_DEFAULT_MOVE(WALRecord);
+
+    virtual void serialize(common::Serializer& serializer) const;
+    static std::unique_ptr<WALRecord> deserialize(common::Deserializer& deserializer,
+        const main::ClientContext& clientContext);
+
+    template<class TARGET>
+    const TARGET& constCast() const {
+        return common::ku_dynamic_cast<const TARGET&>(*this);
+    }
+    template<class TARGET>
+    TARGET& cast() {
+        return common::ku_dynamic_cast<TARGET&>(*this);
+    }
+};
+
+struct BeginTransactionRecord final : WALRecord {
+    BeginTransactionRecord() : WALRecord{WALRecordType::BEGIN_TRANSACTION_RECORD} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<BeginTransactionRecord> deserialize(common::Deserializer& deserializer);
+};
+
+struct CommitRecord final : WALRecord {
+    CommitRecord() : WALRecord{WALRecordType::COMMIT_RECORD} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<CommitRecord> deserialize(common::Deserializer& deserializer);
+};
+
+struct CheckpointRecord final : WALRecord {
+    CheckpointRecord() : WALRecord{WALRecordType::CHECKPOINT_RECORD} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<CheckpointRecord> deserialize(common::Deserializer& deserializer);
+};
+
+struct CreateCatalogEntryRecord final : WALRecord {
+    catalog::CatalogEntry* catalogEntry;
+    std::unique_ptr<catalog::CatalogEntry> ownedCatalogEntry;
+    bool isInternal = false;
+
+    CreateCatalogEntryRecord()
+        : WALRecord{WALRecordType::CREATE_CATALOG_ENTRY_RECORD}, catalogEntry{nullptr} {}
+    CreateCatalogEntryRecord(catalog::CatalogEntry* catalogEntry, bool isInternal)
+        : WALRecord{WALRecordType::CREATE_CATALOG_ENTRY_RECORD}, catalogEntry{catalogEntry},
+          isInternal{isInternal} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<CreateCatalogEntryRecord> deserialize(
+        common::Deserializer& deserializer);
+};
+
+struct CopyTableRecord final : WALRecord {
+    common::table_id_t tableID;
+
+    CopyTableRecord()
+        : WALRecord{WALRecordType::COPY_TABLE_RECORD}, tableID{common::INVALID_TABLE_ID} {}
+    explicit CopyTableRecord(common::table_id_t tableID)
+        : WALRecord{WALRecordType::COPY_TABLE_RECORD}, tableID{tableID} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<CopyTableRecord> deserialize(common::Deserializer& deserializer);
+};
+
+struct DropCatalogEntryRecord final : WALRecord {
+    common::oid_t entryID;
+    catalog::CatalogEntryType entryType;
+
+    DropCatalogEntryRecord()
+        : WALRecord{WALRecordType::DROP_CATALOG_ENTRY_RECORD}, entryID{common::INVALID_OID},
+          entryType{} {}
+    DropCatalogEntryRecord(common::table_id_t entryID, catalog::CatalogEntryType entryType)
+        : WALRecord{WALRecordType::DROP_CATALOG_ENTRY_RECORD}, entryID{entryID},
+          entryType{entryType} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<DropCatalogEntryRecord> deserialize(common::Deserializer& deserializer);
+};
+
+struct AlterTableEntryRecord final : WALRecord {
+    const binder::BoundAlterInfo* alterInfo;
+    std::unique_ptr<binder::BoundAlterInfo> ownedAlterInfo;
+
+    AlterTableEntryRecord()
+        : WALRecord{WALRecordType::ALTER_TABLE_ENTRY_RECORD}, alterInfo{nullptr} {}
+    explicit AlterTableEntryRecord(const binder::BoundAlterInfo* alterInfo)
+        : WALRecord{WALRecordType::ALTER_TABLE_ENTRY_RECORD}, alterInfo{alterInfo} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<AlterTableEntryRecord> deserialize(common::Deserializer& deserializer);
+};
+
+struct UpdateSequenceRecord final : WALRecord {
+    common::sequence_id_t sequenceID;
+    uint64_t kCount;
+
+    UpdateSequenceRecord()
+        : WALRecord{WALRecordType::UPDATE_SEQUENCE_RECORD}, sequenceID{0}, kCount{0} {}
+    UpdateSequenceRecord(common::sequence_id_t sequenceID, uint64_t kCount)
+        : WALRecord{WALRecordType::UPDATE_SEQUENCE_RECORD}, sequenceID{sequenceID}, kCount{kCount} {
+    }
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<UpdateSequenceRecord> deserialize(common::Deserializer& deserializer);
+};
+
+struct TableInsertionRecord final : WALRecord {
+    common::table_id_t tableID;
+    common::TableType tableType;
+    common::row_idx_t numRows;
+    std::vector<common::ValueVector*> vectors;
+    std::vector<std::unique_ptr<common::ValueVector>> ownedVectors;
+
+    TableInsertionRecord()
+        : WALRecord{WALRecordType::TABLE_INSERTION_RECORD}, tableID{common::INVALID_TABLE_ID},
+          tableType{common::TableType::UNKNOWN}, numRows{0} {}
+    TableInsertionRecord(common::table_id_t tableID, common::TableType tableType,
+        common::row_idx_t numRows, const std::vector<common::ValueVector*>& vectors)
+        : WALRecord{WALRecordType::TABLE_INSERTION_RECORD}, tableID{tableID}, tableType{tableType},
+          numRows{numRows}, vectors{vectors} {}
+    TableInsertionRecord(common::table_id_t tableID, common::TableType tableType,
+        common::row_idx_t numRows, std::vector<std::unique_ptr<common::ValueVector>> vectors)
+        : WALRecord{WALRecordType::TABLE_INSERTION_RECORD}, tableID{tableID}, tableType{tableType},
+          numRows{numRows}, ownedVectors{std::move(vectors)} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<TableInsertionRecord> deserialize(common::Deserializer& deserializer,
+        const main::ClientContext& clientContext);
+};
+
+struct NodeDeletionRecord final : WALRecord {
+    common::table_id_t tableID;
+    common::offset_t nodeOffset;
+    common::ValueVector* pkVector;
+    std::unique_ptr<common::ValueVector> ownedPKVector;
+
+    NodeDeletionRecord()
+        : WALRecord{WALRecordType::NODE_DELETION_RECORD}, tableID{common::INVALID_TABLE_ID},
+          nodeOffset{common::INVALID_OFFSET}, pkVector{nullptr} {}
+    NodeDeletionRecord(common::table_id_t tableID, common::offset_t nodeOffset,
+        common::ValueVector* pkVector)
+        : WALRecord{WALRecordType::NODE_DELETION_RECORD}, tableID{tableID}, nodeOffset{nodeOffset},
+          pkVector{pkVector} {}
+    NodeDeletionRecord(common::table_id_t tableID, common::offset_t nodeOffset,
+        std::unique_ptr<common::ValueVector> pkVector)
+        : WALRecord{WALRecordType::NODE_DELETION_RECORD}, tableID{tableID}, nodeOffset{nodeOffset},
+          pkVector{nullptr}, ownedPKVector{std::move(pkVector)} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<NodeDeletionRecord> deserialize(common::Deserializer& deserializer,
+        const main::ClientContext& clientContext);
+};
+
+struct NodeUpdateRecord final : WALRecord {
+    common::table_id_t tableID;
+    common::column_id_t columnID;
+    common::offset_t nodeOffset;
+    common::ValueVector* propertyVector;
+    std::unique_ptr<common::ValueVector> ownedPropertyVector;
+
+    NodeUpdateRecord()
+        : WALRecord{WALRecordType::NODE_UPDATE_RECORD}, tableID{common::INVALID_TABLE_ID},
+          columnID{common::INVALID_COLUMN_ID}, nodeOffset{common::INVALID_OFFSET},
+          propertyVector{nullptr} {}
+    NodeUpdateRecord(common::table_id_t tableID, common::column_id_t columnID,
+        common::offset_t nodeOffset, common::ValueVector* propertyVector)
+        : WALRecord{WALRecordType::NODE_UPDATE_RECORD}, tableID{tableID}, columnID{columnID},
+          nodeOffset{nodeOffset}, propertyVector{propertyVector} {}
+    NodeUpdateRecord(common::table_id_t tableID, common::column_id_t columnID,
+        common::offset_t nodeOffset, std::unique_ptr<common::ValueVector> propertyVector)
+        : WALRecord{WALRecordType::NODE_UPDATE_RECORD}, tableID{tableID}, columnID{columnID},
+          nodeOffset{nodeOffset}, propertyVector{nullptr},
+          ownedPropertyVector{std::move(propertyVector)} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<NodeUpdateRecord> deserialize(common::Deserializer& deserializer,
+        const main::ClientContext& clientContext);
+};
+
+struct RelDeletionRecord final : WALRecord {
+    common::table_id_t tableID;
+    common::ValueVector* srcNodeIDVector;
+    common::ValueVector* dstNodeIDVector;
+    common::ValueVector* relIDVector;
+    std::unique_ptr<common::ValueVector> ownedSrcNodeIDVector;
+    std::unique_ptr<common::ValueVector> ownedDstNodeIDVector;
+    std::unique_ptr<common::ValueVector> ownedRelIDVector;
+
+    RelDeletionRecord()
+        : WALRecord{WALRecordType::REL_DELETION_RECORD}, tableID{common::INVALID_TABLE_ID},
+          srcNodeIDVector{nullptr}, dstNodeIDVector{nullptr}, relIDVector{nullptr} {}
+    RelDeletionRecord(common::table_id_t tableID, common::ValueVector* srcNodeIDVector,
+        common::ValueVector* dstNodeIDVector, common::ValueVector* relIDVector)
+        : WALRecord{WALRecordType::REL_DELETION_RECORD}, tableID{tableID},
+          srcNodeIDVector{srcNodeIDVector}, dstNodeIDVector{dstNodeIDVector},
+          relIDVector{relIDVector} {}
+    RelDeletionRecord(common::table_id_t tableID,
+        std::unique_ptr<common::ValueVector> srcNodeIDVector,
+        std::unique_ptr<common::ValueVector> dstNodeIDVector,
+        std::unique_ptr<common::ValueVector> relIDVector)
+        : WALRecord{WALRecordType::REL_DELETION_RECORD}, tableID{tableID}, srcNodeIDVector{nullptr},
+          dstNodeIDVector{nullptr}, relIDVector{nullptr},
+          ownedSrcNodeIDVector{std::move(srcNodeIDVector)},
+          ownedDstNodeIDVector{std::move(dstNodeIDVector)},
+          ownedRelIDVector{std::move(relIDVector)} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<RelDeletionRecord> deserialize(common::Deserializer& deserializer,
+        const main::ClientContext& clientContext);
+};
+
+struct RelDetachDeleteRecord final : WALRecord {
+    common::table_id_t tableID;
+    common::RelDataDirection direction;
+    common::ValueVector* srcNodeIDVector;
+    std::unique_ptr<common::ValueVector> ownedSrcNodeIDVector;
+
+    RelDetachDeleteRecord()
+        : WALRecord{WALRecordType::REL_DETACH_DELETE_RECORD}, tableID{common::INVALID_TABLE_ID},
+          direction{common::RelDataDirection::FWD}, srcNodeIDVector{nullptr} {}
+    RelDetachDeleteRecord(common::table_id_t tableID, common::RelDataDirection direction,
+        common::ValueVector* srcNodeIDVector)
+        : WALRecord{WALRecordType::REL_DETACH_DELETE_RECORD}, tableID{tableID},
+          direction{direction}, srcNodeIDVector{srcNodeIDVector} {}
+    RelDetachDeleteRecord(common::table_id_t tableID, common::RelDataDirection direction,
+        std::unique_ptr<common::ValueVector> srcNodeIDVector)
+        : WALRecord{WALRecordType::REL_DETACH_DELETE_RECORD}, tableID{tableID},
+          direction{direction}, srcNodeIDVector{nullptr},
+          ownedSrcNodeIDVector{std::move(srcNodeIDVector)} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<RelDetachDeleteRecord> deserialize(common::Deserializer& deserializer,
+        const main::ClientContext& clientContext);
+};
+
+struct RelUpdateRecord final : WALRecord {
+    common::table_id_t tableID;
+    common::column_id_t columnID;
+    common::ValueVector* srcNodeIDVector;
+    common::ValueVector* dstNodeIDVector;
+    common::ValueVector* relIDVector;
+    common::ValueVector* propertyVector;
+    std::unique_ptr<common::ValueVector> ownedSrcNodeIDVector;
+    std::unique_ptr<common::ValueVector> ownedDstNodeIDVector;
+    std::unique_ptr<common::ValueVector> ownedRelIDVector;
+    std::unique_ptr<common::ValueVector> ownedPropertyVector;
+
+    RelUpdateRecord()
+        : WALRecord{WALRecordType::REL_UPDATE_RECORD}, tableID{common::INVALID_TABLE_ID},
+          columnID{common::INVALID_COLUMN_ID}, srcNodeIDVector{nullptr}, dstNodeIDVector{nullptr},
+          relIDVector{nullptr}, propertyVector{nullptr} {}
+    RelUpdateRecord(common::table_id_t tableID, common::column_id_t columnID,
+        common::ValueVector* srcNodeIDVector, common::ValueVector* dstNodeIDVector,
+        common::ValueVector* relIDVector, common::ValueVector* propertyVector)
+        : WALRecord{WALRecordType::REL_UPDATE_RECORD}, tableID{tableID}, columnID{columnID},
+          srcNodeIDVector{srcNodeIDVector}, dstNodeIDVector{dstNodeIDVector},
+          relIDVector{relIDVector}, propertyVector{propertyVector} {}
+    RelUpdateRecord(common::table_id_t tableID, common::column_id_t columnID,
+        std::unique_ptr<common::ValueVector> srcNodeIDVector,
+        std::unique_ptr<common::ValueVector> dstNodeIDVector,
+        std::unique_ptr<common::ValueVector> relIDVector,
+        std::unique_ptr<common::ValueVector> propertyVector)
+        : WALRecord{WALRecordType::REL_UPDATE_RECORD}, tableID{tableID}, columnID{columnID},
+          srcNodeIDVector{nullptr}, dstNodeIDVector{nullptr}, relIDVector{nullptr},
+          propertyVector{nullptr}, ownedSrcNodeIDVector{std::move(srcNodeIDVector)},
+          ownedDstNodeIDVector{std::move(dstNodeIDVector)},
+          ownedRelIDVector{std::move(relIDVector)}, ownedPropertyVector{std::move(propertyVector)} {
+    }
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<RelUpdateRecord> deserialize(common::Deserializer& deserializer,
+        const main::ClientContext& clientContext);
+};
+
+struct LoadExtensionRecord final : WALRecord {
+    std::string path;
+
+    explicit LoadExtensionRecord(std::string path)
+        : WALRecord{WALRecordType::LOAD_EXTENSION_RECORD}, path{std::move(path)} {}
+
+    void serialize(common::Serializer& serializer) const override;
+    static std::unique_ptr<LoadExtensionRecord> deserialize(common::Deserializer& deserializer);
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/wal_replayer.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/wal_replayer.h
new file mode 100644
index 0000000000..58f79130f5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/storage/wal/wal_replayer.h
@@ -0,0 +1,60 @@
+#pragma once
+
+#include "storage/wal/wal_record.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+} // namespace main
+
+namespace storage {
+class WALReplayer {
+public:
+    explicit WALReplayer(main::ClientContext& clientContext);
+
+    void replay(bool throwOnWalReplayFailure, bool enableChecksums) const;
+
+private:
+    struct WALReplayInfo {
+        uint64_t offsetDeserialized = 0;
+        bool isLastRecordCheckpoint = false;
+    };
+
+    void replayWALRecord(WALRecord& walRecord) const;
+    void replayCreateCatalogEntryRecord(WALRecord& walRecord) const;
+    void replayDropCatalogEntryRecord(const WALRecord& walRecord) const;
+    void replayAlterTableEntryRecord(const WALRecord& walRecord) const;
+    void replayTableInsertionRecord(const WALRecord& walRecord) const;
+    void replayNodeDeletionRecord(const WALRecord& walRecord) const;
+    void replayNodeUpdateRecord(const WALRecord& walRecord) const;
+    void replayRelDeletionRecord(const WALRecord& walRecord) const;
+    void replayRelDetachDeletionRecord(const WALRecord& walRecord) const;
+    void replayRelUpdateRecord(const WALRecord& walRecord) const;
+    void replayCopyTableRecord(const WALRecord& walRecord) const;
+    void replayUpdateSequenceRecord(const WALRecord& walRecord) const;
+
+    void replayNodeTableInsertRecord(const WALRecord& walRecord) const;
+    void replayRelTableInsertRecord(const WALRecord& walRecord) const;
+
+    void replayLoadExtensionRecord(const WALRecord& walRecord) const;
+
+    // This function is used to deserialize the WAL records without actually applying them to the
+    // storage.
+    WALReplayInfo dryReplay(common::FileInfo& fileInfo, bool throwOnWalReplayFailure,
+        bool enableChecksums) const;
+
+    void removeWALAndShadowFiles() const;
+    void removeFileIfExists(const std::string& path) const;
+
+    std::unique_ptr<common::FileInfo> openWALFile() const;
+    void syncWALFile(const common::FileInfo& fileInfo) const;
+    void truncateWALFile(common::FileInfo& fileInfo, uint64_t size) const;
+
+private:
+    main::ClientContext& clientContext;
+    std::string walPath;
+    std::string shadowFilePath;
+};
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction.h
new file mode 100644
index 0000000000..7bbaf4207e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction.h
@@ -0,0 +1,171 @@
+#pragma once
+
+#include <atomic>
+#include <mutex>
+
+#include "common/types/types.h"
+
+namespace lbug {
+namespace binder {
+struct BoundAlterInfo;
+}
+namespace catalog {
+class CatalogEntry;
+class CatalogSet;
+class SequenceCatalogEntry;
+struct SequenceRollbackData;
+} // namespace catalog
+namespace main {
+class ClientContext;
+} // namespace main
+namespace storage {
+class LocalWAL;
+class LocalStorage;
+class UndoBuffer;
+class WAL;
+class VersionInfo;
+class UpdateInfo;
+struct VectorUpdateInfo;
+class ChunkedNodeGroup;
+class VersionRecordHandler;
+} // namespace storage
+namespace transaction {
+class TransactionManager;
+
+enum class TransactionType : uint8_t { READ_ONLY, WRITE, CHECKPOINT, DUMMY, RECOVERY };
+
+class LocalCacheManager;
+class LBUG_API LocalCacheObject {
+public:
+    explicit LocalCacheObject(std::string key) : key{std::move(key)} {}
+
+    virtual ~LocalCacheObject() = default;
+
+    std::string getKey() const { return key; }
+
+    template<typename T>
+    T* cast() {
+        return common::ku_dynamic_cast<T*>(this);
+    }
+
+private:
+    std::string key;
+};
+
+class LocalCacheManager {
+public:
+    bool contains(const std::string& key) {
+        std::unique_lock lck{mtx};
+        return cachedObjects.contains(key);
+    }
+    LocalCacheObject& at(const std::string& key) {
+        std::unique_lock lck{mtx};
+        return *cachedObjects.at(key);
+    }
+    bool put(std::unique_ptr<LocalCacheObject> object);
+
+    void remove(const std::string& key) {
+        std::unique_lock lck{mtx};
+        cachedObjects.erase(key);
+    }
+
+private:
+    std::unordered_map<std::string, std::unique_ptr<LocalCacheObject>> cachedObjects;
+    std::mutex mtx;
+};
+
+class LBUG_API Transaction {
+    friend class TransactionManager;
+
+public:
+    static constexpr common::transaction_t DUMMY_TRANSACTION_ID = 0;
+    static constexpr common::transaction_t DUMMY_START_TIMESTAMP = 0;
+    static constexpr common::transaction_t START_TRANSACTION_ID =
+        static_cast<common::transaction_t>(1) << 63;
+
+    Transaction(main::ClientContext& clientContext, TransactionType transactionType,
+        common::transaction_t transactionID, common::transaction_t startTS);
+
+    explicit Transaction(TransactionType transactionType) noexcept;
+    Transaction(TransactionType transactionType, common::transaction_t ID,
+        common::transaction_t startTS) noexcept;
+
+    ~Transaction();
+
+    TransactionType getType() const { return type; }
+    bool isReadOnly() const { return TransactionType::READ_ONLY == type; }
+    bool isWriteTransaction() const { return TransactionType::WRITE == type; }
+    bool isDummy() const { return TransactionType::DUMMY == type; }
+    bool isRecovery() const { return TransactionType::RECOVERY == type; }
+    common::transaction_t getID() const { return ID; }
+    common::transaction_t getStartTS() const { return startTS; }
+    common::transaction_t getCommitTS() const { return commitTS; }
+    int64_t getCurrentTS() const { return currentTS; }
+
+    void setForceCheckpoint() { forceCheckpoint = true; }
+    bool shouldAppendToUndoBuffer() const {
+        // Only write transactions and recovery transactions should append to the undo buffer.
+        return isWriteTransaction() || isRecovery();
+    }
+    bool shouldLogToWAL() const;
+    storage::LocalWAL& getLocalWAL() const {
+        KU_ASSERT(localWAL);
+        return *localWAL;
+    }
+
+    bool shouldForceCheckpoint() const;
+
+    void commit(storage::WAL* wal);
+    void rollback(storage::WAL* wal);
+
+    storage::LocalStorage* getLocalStorage() const { return localStorage.get(); }
+    LocalCacheManager& getLocalCacheManager() { return localCacheManager; }
+    bool isUnCommitted(common::table_id_t tableID, common::offset_t nodeOffset) const;
+    common::row_idx_t getLocalRowIdx(common::table_id_t tableID,
+        common::offset_t nodeOffset) const {
+        return nodeOffset - getMinUncommittedNodeOffset(tableID);
+    }
+    common::offset_t getUncommittedOffset(common::table_id_t tableID,
+        common::row_idx_t localRowIdx) const {
+        return getMinUncommittedNodeOffset(tableID) + localRowIdx;
+    }
+
+    void pushCreateDropCatalogEntry(catalog::CatalogSet& catalogSet,
+        catalog::CatalogEntry& catalogEntry, bool isInternal, bool skipLoggingToWAL = false);
+    void pushAlterCatalogEntry(catalog::CatalogSet& catalogSet, catalog::CatalogEntry& catalogEntry,
+        const binder::BoundAlterInfo& alterInfo);
+    void pushSequenceChange(catalog::SequenceCatalogEntry* sequenceEntry, int64_t kCount,
+        const catalog::SequenceRollbackData& data);
+    void pushInsertInfo(common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+        common::row_idx_t numRows, const storage::VersionRecordHandler* versionRecordHandler) const;
+    void pushDeleteInfo(common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+        common::row_idx_t numRows, const storage::VersionRecordHandler* versionRecordHandler) const;
+    void pushVectorUpdateInfo(storage::UpdateInfo& updateInfo, common::idx_t vectorIdx,
+        storage::VectorUpdateInfo& vectorUpdateInfo, common::transaction_t version) const;
+
+    static Transaction* Get(const main::ClientContext& context);
+
+private:
+    common::offset_t getMinUncommittedNodeOffset(common::table_id_t tableID) const;
+
+private:
+    TransactionType type;
+    common::transaction_t ID;
+    common::transaction_t startTS;
+    common::transaction_t commitTS;
+    int64_t currentTS;
+    main::ClientContext* clientContext;
+    std::unique_ptr<storage::LocalStorage> localStorage;
+    std::unique_ptr<storage::UndoBuffer> undoBuffer;
+    std::unique_ptr<storage::LocalWAL> localWAL;
+    LocalCacheManager localCacheManager;
+    bool forceCheckpoint;
+    std::atomic<bool> hasCatalogChanges;
+};
+
+// TODO(bmwinger): These shouldn't need to be exported
+extern LBUG_API Transaction DUMMY_TRANSACTION;
+extern LBUG_API Transaction DUMMY_CHECKPOINT_TRANSACTION;
+
+} // namespace transaction
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction_action.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction_action.h
new file mode 100644
index 0000000000..25fb64c9b2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction_action.h
@@ -0,0 +1,23 @@
+#pragma once
+
+#include <cstdint>
+#include <string>
+
+namespace lbug {
+namespace transaction {
+
+enum class TransactionAction : uint8_t {
+    BEGIN_READ = 0,
+    BEGIN_WRITE = 1,
+    COMMIT = 10,
+    ROLLBACK = 20,
+    CHECKPOINT = 30,
+};
+
+class TransactionActionUtils {
+public:
+    static std::string toString(TransactionAction action);
+};
+
+} // namespace transaction
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction_context.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction_context.h
new file mode 100644
index 0000000000..9f69fab5e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction_context.h
@@ -0,0 +1,68 @@
+#pragma once
+
+#include <mutex>
+
+#include "transaction.h"
+
+namespace lbug {
+
+namespace main {
+class ClientContext;
+}
+
+namespace transaction {
+
+/**
+ * If the connection is in AUTO_COMMIT mode, any query over the connection will be wrapped around
+ * a transaction and committed (even if the query is READ_ONLY).
+ * If the connection is in MANUAL transaction mode, which happens only if an application
+ * manually begins a transaction (see below), then an application has to manually commit or
+ * rollback the transaction by calling commit() or rollback().
+ *
+ * AUTO_COMMIT is the default mode when a Connection is created. If an application calls
+ * begin[ReadOnly/Write]Transaction at any point, the mode switches to MANUAL. This creates
+ * an "active transaction" in the connection. When a connection is in MANUAL mode and the
+ * active transaction is rolled back or committed, then the active transaction is removed (so
+ * the connection no longer has an active transaction), and the mode automatically switches
+ * back to AUTO_COMMIT.
+ * Note: When a Connection object is deconstructed, if the connection has an active (manual)
+ * transaction, then the active transaction is rolled back.
+ */
+enum class TransactionMode : uint8_t { AUTO = 0, MANUAL = 1 };
+
+class LBUG_API TransactionContext {
+public:
+    explicit TransactionContext(main::ClientContext& clientContext);
+    ~TransactionContext();
+
+    bool isAutoTransaction() const { return mode == TransactionMode::AUTO; }
+
+    void beginReadTransaction();
+    void beginWriteTransaction();
+    void beginAutoTransaction(bool readOnlyStatement);
+    void beginRecoveryTransaction();
+    void validateManualTransaction(bool readOnlyStatement) const;
+
+    void commit();
+    void rollback();
+
+    TransactionMode getTransactionMode() const { return mode; }
+    bool hasActiveTransaction() const { return activeTransaction != nullptr; }
+    Transaction* getActiveTransaction() const { return activeTransaction; }
+
+    void clearTransaction();
+
+    static TransactionContext* Get(const main::ClientContext& context);
+
+private:
+    void beginTransactionInternal(TransactionType transactionType);
+
+private:
+    std::mutex mtx;
+    main::ClientContext& clientContext;
+    TransactionMode mode;
+    Transaction* activeTransaction;
+};
+
+} // namespace transaction
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction_manager.h b/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction_manager.h
new file mode 100644
index 0000000000..17c3733b89
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/include/transaction/transaction_manager.h
@@ -0,0 +1,82 @@
+#pragma once
+
+#include <memory>
+#include <mutex>
+
+#include "common/constants.h"
+#include "common/uniq_lock.h"
+#include "storage/checkpointer.h"
+#include "storage/wal/wal.h"
+#include "transaction/transaction.h"
+
+namespace lbug {
+namespace main {
+class ClientContext;
+} // namespace main
+
+namespace testing {
+class DBTest;
+class FlakyBufferManager;
+class FlakyCheckpointer;
+} // namespace testing
+
+namespace transaction {
+
+class TransactionManager {
+    friend class testing::DBTest;
+    friend class testing::FlakyBufferManager;
+    friend class testing::FlakyCheckpointer;
+
+    using init_checkpointer_func_t =
+        std::function<std::unique_ptr<storage::Checkpointer>(main::ClientContext&)>;
+    static std::unique_ptr<storage::Checkpointer> initCheckpointer(
+        main::ClientContext& clientContext);
+
+public:
+    // Timestamp starts from 1. 0 is reserved for the dummy system transaction.
+    explicit TransactionManager(storage::WAL& wal)
+        : wal{wal}, lastTransactionID{Transaction::START_TRANSACTION_ID}, lastTimestamp{1} {
+        initCheckpointerFunc = initCheckpointer;
+    }
+
+    Transaction* beginTransaction(main::ClientContext& clientContext, TransactionType type);
+
+    void commit(main::ClientContext& clientContext, Transaction* transaction);
+    void rollback(main::ClientContext& clientContext, Transaction* transaction);
+
+    void checkpoint(main::ClientContext& clientContext);
+
+    static TransactionManager* Get(const main::ClientContext& context);
+
+private:
+    bool hasNoActiveTransactions() const;
+    void checkpointNoLock(main::ClientContext& clientContext);
+
+    // This functions locks the mutex to start new transactions.
+    common::UniqLock stopNewTransactionsAndWaitUntilAllTransactionsLeave();
+
+    bool hasActiveWriteTransactionNoLock() const;
+
+    // Note: Used by DBTest::createDB only.
+    void setCheckPointWaitTimeoutForTransactionsToLeaveInMicros(uint64_t waitTimeInMicros) {
+        checkpointWaitTimeoutInMicros = waitTimeInMicros;
+    }
+
+    void clearTransactionNoLock(common::transaction_t transactionID);
+
+private:
+    storage::WAL& wal;
+    std::vector<std::unique_ptr<Transaction>> activeTransactions;
+    common::transaction_t lastTransactionID;
+    common::transaction_t lastTimestamp;
+    // This mutex is used to ensure thread safety and letting only one public function to be called
+    // at any time except the stopNewTransactionsAndWaitUntilAllReadTransactionsLeave
+    // function, which needs to let calls to coming and rollback.
+    std::mutex mtxForSerializingPublicFunctionCalls;
+    std::mutex mtxForStartingNewTransactions;
+    uint64_t checkpointWaitTimeoutInMicros = common::DEFAULT_CHECKPOINT_WAIT_TIMEOUT_IN_MICROS;
+
+    init_checkpointer_func_t initCheckpointerFunc;
+};
+} // namespace transaction
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/main/CMakeLists.txt
new file mode 100644
index 0000000000..eccee7adc6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/CMakeLists.txt
@@ -0,0 +1,22 @@
+add_subdirectory(query_result)
+
+add_library(lbug_main
+        OBJECT
+        attached_database.cpp
+        client_context.cpp
+        connection.cpp
+        database.cpp
+        database_manager.cpp
+        plan_printer.cpp
+        prepared_statement.cpp
+        prepared_statement_manager.cpp
+        query_result.cpp
+        query_summary.cpp
+        storage_driver.cpp
+        version.cpp
+        db_config.cpp
+        settings.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_main>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/attached_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/attached_database.cpp
new file mode 100644
index 0000000000..5d19be963a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/attached_database.cpp
@@ -0,0 +1,68 @@
+#include "main/attached_database.h"
+
+#include "common/exception/runtime.h"
+#include "common/file_system/virtual_file_system.h"
+#include "main/client_context.h"
+#include "main/db_config.h"
+#include "storage/checkpointer.h"
+#include "storage/storage_manager.h"
+#include "storage/storage_utils.h"
+#include "transaction/transaction_manager.h"
+
+namespace lbug {
+namespace main {
+
+void AttachedDatabase::invalidateCache() {
+    if (dbType != common::ATTACHED_LBUG_DB_TYPE) {
+        auto catalogExtension = catalog->ptrCast<extension::CatalogExtension>();
+        catalogExtension->invalidateCache();
+    }
+}
+
+static void validateEmptyWAL(const std::string& path, ClientContext* context) {
+    auto vfs = common::VirtualFileSystem::GetUnsafe(*context);
+    auto walFilePath = storage::StorageUtils::getWALFilePath(path);
+    if (vfs->fileOrPathExists(walFilePath, context)) {
+        auto walFile = vfs->openFile(walFilePath,
+            common::FileOpenFlags(common::FileFlags::READ_ONLY), context);
+        if (walFile->getFileSize() > 0) {
+            throw common::RuntimeException(common::stringFormat(
+                "Cannot attach an external Lbug database with non-empty wal file. Try manually "
+                "checkpointing the external database (i.e., run \"CHECKPOINT;\")."));
+        }
+    }
+}
+
+AttachedLbugDatabase::AttachedLbugDatabase(std::string dbPath, std::string dbName,
+    std::string dbType, ClientContext* clientContext)
+    : AttachedDatabase{std::move(dbName), std::move(dbType), nullptr /* catalog */} {
+    auto vfs = common::VirtualFileSystem::GetUnsafe(*clientContext);
+    if (DBConfig::isDBPathInMemory(dbPath)) {
+        throw common::RuntimeException("Cannot attach an in-memory Lbug database. Please give a "
+                                       "path to an on-disk Lbug database directory.");
+    }
+    auto path = vfs->expandPath(clientContext, dbPath);
+    // Note: S3 directory path may end with a '/'.
+    if (path.ends_with('/')) {
+        path = path.substr(0, path.size() - 1);
+    }
+    if (!vfs->fileOrPathExists(path, clientContext)) {
+        throw common::RuntimeException(common::stringFormat(
+            "Cannot attach a remote Lbug database due to invalid path: {}.", path));
+    }
+    catalog = std::make_unique<catalog::Catalog>();
+    validateEmptyWAL(path, clientContext);
+    storageManager = std::make_unique<storage::StorageManager>(path, true /* isReadOnly */,
+        clientContext->getDBConfig()->enableChecksums, *storage::MemoryManager::Get(*clientContext),
+        clientContext->getDBConfig()->enableCompression, vfs);
+    transactionManager =
+        std::make_unique<transaction::TransactionManager>(storageManager->getWAL());
+
+    storageManager->initDataFileHandle(vfs, clientContext);
+    if (storageManager->getDataFH()->getNumPages() > 0) {
+        storage::Checkpointer::readCheckpoint(clientContext, catalog.get(), storageManager.get());
+    }
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/client_context.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/client_context.cpp
new file mode 100644
index 0000000000..3c8a2888c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/client_context.cpp
@@ -0,0 +1,613 @@
+#include "main/client_context.h"
+
+#include "binder/binder.h"
+#include "common/exception/checkpoint.h"
+#include "common/exception/connection.h"
+#include "common/exception/runtime.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/random_engine.h"
+#include "common/string_utils.h"
+#include "common/task_system/progress_bar.h"
+#include "extension/extension.h"
+#include "extension/extension_manager.h"
+#include "graph/graph_entry_set.h"
+#include "main/attached_database.h"
+#include "main/database.h"
+#include "main/database_manager.h"
+#include "main/db_config.h"
+#include "optimizer/optimizer.h"
+#include "parser/parser.h"
+#include "parser/visitor/standalone_call_rewriter.h"
+#include "parser/visitor/statement_read_write_analyzer.h"
+#include "planner/planner.h"
+#include "processor/plan_mapper.h"
+#include "processor/processor.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/buffer_manager/spiller.h"
+#include "storage/storage_manager.h"
+#include "transaction/transaction_context.h"
+#include <processor/warning_context.h>
+
+#if defined(_WIN32)
+#include "common/windows_utils.h"
+#endif
+
+using namespace lbug::parser;
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::planner;
+using namespace lbug::processor;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace main {
+
+ActiveQuery::ActiveQuery() : interrupted{false} {}
+
+void ActiveQuery::reset() {
+    interrupted = false;
+    timer = Timer();
+}
+
+ClientContext::ClientContext(Database* database) : localDatabase{database} {
+    transactionContext = std::make_unique<TransactionContext>(*this);
+    randomEngine = std::make_unique<RandomEngine>();
+    remoteDatabase = nullptr;
+    graphEntrySet = std::make_unique<graph::GraphEntrySet>();
+    clientConfig.homeDirectory = getUserHomeDir();
+    clientConfig.fileSearchPath = "";
+    clientConfig.enableSemiMask = ClientConfigDefault::ENABLE_SEMI_MASK;
+    clientConfig.enableZoneMap = ClientConfigDefault::ENABLE_ZONE_MAP;
+    clientConfig.numThreads = database->dbConfig.maxNumThreads;
+    clientConfig.timeoutInMS = ClientConfigDefault::TIMEOUT_IN_MS;
+    clientConfig.varLengthMaxDepth = ClientConfigDefault::VAR_LENGTH_MAX_DEPTH;
+    clientConfig.enableProgressBar = ClientConfigDefault::ENABLE_PROGRESS_BAR;
+    clientConfig.showProgressAfter = ClientConfigDefault::SHOW_PROGRESS_AFTER;
+    clientConfig.recursivePatternSemantic = ClientConfigDefault::RECURSIVE_PATTERN_SEMANTIC;
+    clientConfig.recursivePatternCardinalityScaleFactor =
+        ClientConfigDefault::RECURSIVE_PATTERN_FACTOR;
+    clientConfig.disableMapKeyCheck = ClientConfigDefault::DISABLE_MAP_KEY_CHECK;
+    clientConfig.warningLimit = ClientConfigDefault::WARNING_LIMIT;
+    progressBar = std::make_unique<ProgressBar>(clientConfig.enableProgressBar);
+    warningContext = std::make_unique<WarningContext>(&clientConfig);
+}
+
+ClientContext::~ClientContext() {
+    if (preventTransactionRollbackOnDestruction) {
+        return;
+    }
+    if (Transaction::Get(*this)) {
+        getDatabase()->transactionManager->rollback(*this, Transaction::Get(*this));
+    }
+}
+
+const DBConfig* ClientContext::getDBConfig() const {
+    return &getDatabase()->dbConfig;
+}
+
+DBConfig* ClientContext::getDBConfigUnsafe() const {
+    return &getDatabase()->dbConfig;
+}
+
+uint64_t ClientContext::getTimeoutRemainingInMS() const {
+    KU_ASSERT(hasTimeout());
+    const auto elapsed = activeQuery.timer.getElapsedTimeInMS();
+    return elapsed >= clientConfig.timeoutInMS ? 0 : clientConfig.timeoutInMS - elapsed;
+}
+
+void ClientContext::startTimer() {
+    if (hasTimeout()) {
+        activeQuery.timer.start();
+    }
+}
+
+void ClientContext::setQueryTimeOut(uint64_t timeoutInMS) {
+    lock_t lck{mtx};
+    clientConfig.timeoutInMS = timeoutInMS;
+}
+
+uint64_t ClientContext::getQueryTimeOut() const {
+    return clientConfig.timeoutInMS;
+}
+
+void ClientContext::setMaxNumThreadForExec(uint64_t numThreads) {
+    lock_t lck{mtx};
+    if (numThreads == 0) {
+        numThreads = localDatabase->dbConfig.maxNumThreads;
+    }
+    clientConfig.numThreads = numThreads;
+}
+
+uint64_t ClientContext::getMaxNumThreadForExec() const {
+    return clientConfig.numThreads;
+}
+
+Value ClientContext::getCurrentSetting(const std::string& optionName) const {
+    auto lowerCaseOptionName = optionName;
+    StringUtils::toLower(lowerCaseOptionName);
+    // Firstly, try to find in built-in options.
+    const auto option = DBConfig::getOptionByName(lowerCaseOptionName);
+    if (option != nullptr) {
+        return option->getSetting(this);
+    }
+    // Secondly, try to find in current client session.
+    if (extensionOptionValues.contains(lowerCaseOptionName)) {
+        return extensionOptionValues.at(lowerCaseOptionName);
+    }
+    // Lastly, find the default value in db clientConfig.
+    const auto defaultOption = getExtensionOption(lowerCaseOptionName);
+    if (defaultOption != nullptr) {
+        return defaultOption->defaultValue;
+    }
+    throw RuntimeException{"Invalid option name: " + lowerCaseOptionName + "."};
+}
+
+void ClientContext::addScanReplace(function::ScanReplacement scanReplacement) {
+    scanReplacements.push_back(std::move(scanReplacement));
+}
+
+std::unique_ptr<function::ScanReplacementData> ClientContext::tryReplaceByName(
+    const std::string& objectName) const {
+    for (auto& scanReplacement : scanReplacements) {
+        auto replaceHandles = scanReplacement.lookupFunc(objectName);
+        if (replaceHandles.empty()) {
+            continue; // Fail to replace.
+        }
+        return scanReplacement.replaceFunc(std::span(replaceHandles.begin(), replaceHandles.end()));
+    }
+    return {};
+}
+
+std::unique_ptr<function::ScanReplacementData> ClientContext::tryReplaceByHandle(
+    function::scan_replace_handle_t handle) const {
+    auto handleSpan = std::span{&handle, 1};
+    for (auto& scanReplacement : scanReplacements) {
+        auto replaceData = scanReplacement.replaceFunc(handleSpan);
+        if (replaceData == nullptr) {
+            continue; // Fail to replace.
+        }
+        return replaceData;
+    }
+    return nullptr;
+}
+
+void ClientContext::setExtensionOption(std::string name, Value value) {
+    StringUtils::toLower(name);
+    extensionOptionValues.insert_or_assign(name, std::move(value));
+}
+
+const main::ExtensionOption* ClientContext::getExtensionOption(std::string optionName) const {
+    return localDatabase->extensionManager->getExtensionOption(optionName);
+}
+
+std::string ClientContext::getExtensionDir() const {
+    return stringFormat("{}/.lbug/extension/{}/{}/", clientConfig.homeDirectory,
+        LBUG_EXTENSION_VERSION, extension::getPlatform());
+}
+
+std::string ClientContext::getDatabasePath() const {
+    return localDatabase->databasePath;
+}
+
+Database* ClientContext::getDatabase() const {
+    return localDatabase;
+}
+
+AttachedLbugDatabase* ClientContext::getAttachedDatabase() const {
+    return remoteDatabase;
+}
+
+bool ClientContext::isInMemory() const {
+    if (remoteDatabase != nullptr) {
+        // If we are connected to a remote database, we assume it is not in memory.
+        return false;
+    }
+    return localDatabase->storageManager->isInMemory();
+}
+
+std::string ClientContext::getEnvVariable(const std::string& name) {
+#if defined(_WIN32)
+    auto envValue = WindowsUtils::utf8ToUnicode(name.c_str());
+    auto result = _wgetenv(envValue.c_str());
+    if (!result) {
+        return std::string();
+    }
+    return WindowsUtils::unicodeToUTF8(result);
+#else
+    const char* env = getenv(name.c_str()); // NOLINT(*-mt-unsafe)
+    if (!env) {
+        return std::string();
+    }
+    return env;
+#endif
+}
+
+std::string ClientContext::getUserHomeDir() {
+#if defined(_WIN32)
+    return getEnvVariable("USERPROFILE");
+#else
+    return getEnvVariable("HOME");
+#endif
+}
+
+void ClientContext::setDefaultDatabase(AttachedLbugDatabase* defaultDatabase_) {
+    remoteDatabase = defaultDatabase_;
+}
+
+bool ClientContext::hasDefaultDatabase() const {
+    return remoteDatabase != nullptr;
+}
+
+void ClientContext::addScalarFunction(std::string name, function::function_set definitions) {
+    TransactionHelper::runFuncInTransaction(
+        *transactionContext,
+        [&]() {
+            localDatabase->catalog->addFunction(Transaction::Get(*this),
+                CatalogEntryType::SCALAR_FUNCTION_ENTRY, std::move(name), std::move(definitions));
+        },
+        false /*readOnlyStatement*/, false /*isTransactionStatement*/,
+        TransactionHelper::TransactionCommitAction::COMMIT_IF_NEW);
+}
+
+void ClientContext::removeScalarFunction(const std::string& name) {
+    TransactionHelper::runFuncInTransaction(
+        *transactionContext,
+        [&]() { localDatabase->catalog->dropFunction(Transaction::Get(*this), name); },
+        false /*readOnlyStatement*/, false /*isTransactionStatement*/,
+        TransactionHelper::TransactionCommitAction::COMMIT_IF_NEW);
+}
+
+void ClientContext::cleanUp() {
+    VirtualFileSystem::GetUnsafe(*this)->cleanUP(this);
+}
+
+std::unique_ptr<PreparedStatement> ClientContext::prepareWithParams(std::string_view query,
+    std::unordered_map<std::string, std::unique_ptr<Value>> inputParams) {
+    std::unique_lock lck{mtx};
+    auto parsedStatements = std::vector<std::shared_ptr<Statement>>();
+    try {
+        parsedStatements = parseQuery(query);
+    } catch (std::exception& exception) {
+        return PreparedStatement::getPreparedStatementWithError(exception.what());
+    }
+    if (parsedStatements.size() > 1) {
+        return PreparedStatement::getPreparedStatementWithError(
+            "Connection Exception: We do not support prepare multiple statements.");
+    }
+
+    // The binder deals with the parameter values as shared ptrs
+    // Copy the params to a new map that matches the format that the binder expects
+    std::unordered_map<std::string, std::shared_ptr<Value>> inputParamsTmp;
+    for (auto& [key, value] : inputParams) {
+        inputParamsTmp.insert(std::make_pair(key, std::make_shared<Value>(*value)));
+    }
+    auto [preparedStatement, cachedStatement] = prepareNoLock(parsedStatements[0],
+        true /*shouldCommitNewTransaction*/, std::move(inputParamsTmp));
+    preparedStatement->cachedPreparedStatementName =
+        cachedPreparedStatementManager.addStatement(std::move(cachedStatement));
+    useInternalCatalogEntry_ = false;
+    return std::move(preparedStatement);
+}
+
+static void bindParametersNoLock(PreparedStatement& preparedStatement,
+    const std::unordered_map<std::string, std::unique_ptr<Value>>& inputParams) {
+    for (auto& key : preparedStatement.getKnownParameters()) {
+        if (inputParams.contains(key)) {
+            // Found input. Update parameter map.
+            preparedStatement.updateParameter(key, inputParams.at(key).get());
+        }
+    }
+    for (auto& key : preparedStatement.getUnknownParameters()) {
+        if (!inputParams.contains(key)) {
+            throw Exception("Parameter " + key + " not found.");
+        }
+        preparedStatement.addParameter(key, inputParams.at(key).get());
+    }
+}
+
+std::unique_ptr<QueryResult> ClientContext::executeWithParams(PreparedStatement* preparedStatement,
+    std::unordered_map<std::string, std::unique_ptr<Value>> inputParams,
+    std::optional<uint64_t> queryID) { // NOLINT(performance-unnecessary-value-param): It doesn't
+    // make sense to pass the map as a const reference.
+    lock_t lck{mtx};
+    if (!preparedStatement->isSuccess()) {
+        return QueryResult::getQueryResultWithError(preparedStatement->errMsg);
+    }
+    try {
+        bindParametersNoLock(*preparedStatement, inputParams);
+    } catch (std::exception& e) {
+        return QueryResult::getQueryResultWithError(e.what());
+    }
+    auto name = preparedStatement->getName();
+    // LCOV_EXCL_START
+    // The following should never happen. But we still throw just in case.
+    if (!cachedPreparedStatementManager.containsStatement(name)) {
+        return QueryResult::getQueryResultWithError(
+            stringFormat("Cannot find prepared statement with name {}.", name));
+    }
+    // LCOV_EXCL_STOP
+    auto cachedStatement = cachedPreparedStatementManager.getCachedStatement(name);
+    // rebind
+    auto [newPreparedStatement, newCachedStatement] =
+        prepareNoLock(cachedStatement->parsedStatement, false /*shouldCommitNewTransaction*/,
+            preparedStatement->parameterMap);
+    useInternalCatalogEntry_ = false;
+    return executeNoLock(newPreparedStatement.get(), newCachedStatement.get(), queryID);
+}
+
+std::unique_ptr<QueryResult> ClientContext::query(std::string_view query,
+    std::optional<uint64_t> queryID, QueryConfig config) {
+    lock_t lck{mtx};
+    return queryNoLock(query, queryID, config);
+}
+
+std::unique_ptr<QueryResult> ClientContext::queryNoLock(std::string_view query,
+    std::optional<uint64_t> queryID, QueryConfig config) {
+    auto parsedStatements = std::vector<std::shared_ptr<Statement>>();
+    try {
+        parsedStatements = parseQuery(query);
+    } catch (std::exception& exception) {
+        return QueryResult::getQueryResultWithError(exception.what());
+    }
+    std::unique_ptr<QueryResult> queryResult;
+    QueryResult* lastResult = nullptr;
+    double internalCompilingTime = 0.0, internalExecutionTime = 0.0;
+    for (const auto& statement : parsedStatements) {
+        auto [preparedStatement, cachedStatement] =
+            prepareNoLock(statement, false /*shouldCommitNewTransaction*/);
+        auto currentQueryResult =
+            executeNoLock(preparedStatement.get(), cachedStatement.get(), queryID, config);
+        if (!currentQueryResult->isSuccess()) {
+            if (!lastResult) {
+                queryResult = std::move(currentQueryResult);
+            } else {
+                queryResult->addNextResult(std::move(currentQueryResult));
+            }
+            break;
+        }
+        auto currentQuerySummary = currentQueryResult->getQuerySummary();
+        if (statement->isInternal()) {
+            // The result of internal statements should be invisible to end users. Skip chaining the
+            // result of internal statements to the final result to end users.
+            internalCompilingTime += currentQuerySummary->getCompilingTime();
+            internalExecutionTime += currentQuerySummary->getExecutionTime();
+            continue;
+        }
+        currentQuerySummary->incrementCompilingTime(internalCompilingTime);
+        currentQuerySummary->incrementExecutionTime(internalExecutionTime);
+        if (!lastResult) {
+            // first result of the query
+            queryResult = std::move(currentQueryResult);
+            lastResult = queryResult.get();
+        } else {
+            auto current = currentQueryResult.get();
+            lastResult->addNextResult(std::move(currentQueryResult));
+            lastResult = current;
+        }
+    }
+    useInternalCatalogEntry_ = false;
+    return queryResult;
+}
+
+std::vector<std::shared_ptr<Statement>> ClientContext::parseQuery(std::string_view query) {
+    if (query.empty()) {
+        throw ConnectionException("Query is empty.");
+    }
+    std::vector<std::shared_ptr<Statement>> statements;
+    auto parserTimer = TimeMetric(true /*enable*/);
+    parserTimer.start();
+    auto parsedStatements = Parser::parseQuery(query, localDatabase->getTransformerExtensions());
+    parserTimer.stop();
+    const auto avgParsingTime = parserTimer.getElapsedTimeMS() / parsedStatements.size() / 1.0;
+    StandaloneCallRewriter standaloneCallAnalyzer{this, parsedStatements.size() == 1};
+    for (auto i = 0u; i < parsedStatements.size(); i++) {
+        auto rewriteQuery = standaloneCallAnalyzer.getRewriteQuery(*parsedStatements[i]);
+        if (rewriteQuery.empty()) {
+            parsedStatements[i]->setParsingTime(avgParsingTime);
+            statements.push_back(std::move(parsedStatements[i]));
+        } else {
+            parserTimer.start();
+            auto rewrittenStatements =
+                Parser::parseQuery(rewriteQuery, localDatabase->getTransformerExtensions());
+            parserTimer.stop();
+            const auto avgRewriteParsingTime =
+                parserTimer.getElapsedTimeMS() / rewrittenStatements.size() / 1.0;
+            KU_ASSERT(rewrittenStatements.size() >= 1);
+            for (auto j = 0u; j < rewrittenStatements.size() - 1; j++) {
+                rewrittenStatements[j]->setParsingTime(avgParsingTime + avgRewriteParsingTime);
+                rewrittenStatements[j]->setToInternal();
+                statements.push_back(std::move(rewrittenStatements[j]));
+            }
+            auto lastRewrittenStatement = rewrittenStatements.back();
+            lastRewrittenStatement->setParsingTime(avgParsingTime + avgRewriteParsingTime);
+            statements.push_back(std::move(lastRewrittenStatement));
+        }
+    }
+    return statements;
+}
+
+void ClientContext::validateTransaction(bool readOnly, bool requireTransaction) const {
+    if (!canExecuteWriteQuery() && !readOnly) {
+        throw ConnectionException("Cannot execute write operations in a read-only database!");
+    }
+    if (requireTransaction && transactionContext->hasActiveTransaction()) {
+        KU_ASSERT(!transactionContext->isAutoTransaction());
+        transactionContext->validateManualTransaction(readOnly);
+    }
+}
+
+ClientContext::PrepareResult ClientContext::prepareNoLock(
+    std::shared_ptr<Statement> parsedStatement, bool shouldCommitNewTransaction,
+    std::unordered_map<std::string, std::shared_ptr<Value>> inputParams) {
+    auto preparedStatement = std::make_unique<PreparedStatement>();
+    auto cachedStatement = std::make_unique<CachedPreparedStatement>();
+    cachedStatement->parsedStatement = parsedStatement;
+    cachedStatement->useInternalCatalogEntry = useInternalCatalogEntry_;
+    auto prepareTimer = TimeMetric(true /* enable */);
+    prepareTimer.start();
+    try {
+        preparedStatement->preparedSummary.statementType = parsedStatement->getStatementType();
+        auto readWriteAnalyzer = StatementReadWriteAnalyzer(this);
+        TransactionHelper::runFuncInTransaction(
+            *transactionContext, [&]() -> void { readWriteAnalyzer.visit(*parsedStatement); },
+            true /* readOnly */, false /* */,
+            TransactionHelper::TransactionCommitAction::COMMIT_IF_NEW);
+        preparedStatement->readOnly = readWriteAnalyzer.isReadOnly();
+        validateTransaction(preparedStatement->readOnly, parsedStatement->requireTransaction());
+        TransactionHelper::runFuncInTransaction(
+            *transactionContext,
+            [&]() -> void {
+                auto binder = Binder(this, localDatabase->getBinderExtensions());
+                auto expressionBinder = binder.getExpressionBinder();
+                for (auto& [name, value] : inputParams) {
+                    expressionBinder->addParameter(name, value);
+                }
+                const auto boundStatement = binder.bind(*parsedStatement);
+                preparedStatement->unknownParameters = expressionBinder->getUnknownParameters();
+                preparedStatement->parameterMap = expressionBinder->getKnownParameters();
+                cachedStatement->columns = boundStatement->getStatementResult()->getColumns();
+                auto planner = Planner(this);
+                auto bestPlan = planner.planStatement(*boundStatement);
+                optimizer::Optimizer::optimize(&bestPlan, this, planner.getCardinalityEstimator());
+                cachedStatement->logicalPlan = std::make_unique<LogicalPlan>(std::move(bestPlan));
+            },
+            preparedStatement->isReadOnly(),
+            preparedStatement->getStatementType() == StatementType::TRANSACTION,
+            TransactionHelper::getAction(shouldCommitNewTransaction,
+                false /*shouldCommitAutoTransaction*/));
+    } catch (std::exception& exception) {
+        preparedStatement->success = false;
+        preparedStatement->errMsg = exception.what();
+    }
+    prepareTimer.stop();
+    preparedStatement->preparedSummary.compilingTime =
+        parsedStatement->getParsingTime() + prepareTimer.getElapsedTimeMS();
+    return {std::move(preparedStatement), std::move(cachedStatement)};
+}
+
+std::unique_ptr<QueryResult> ClientContext::executeNoLock(PreparedStatement* preparedStatement,
+    CachedPreparedStatement* cachedStatement, std::optional<uint64_t> queryID,
+    QueryConfig queryConfig) {
+    if (!preparedStatement->isSuccess()) {
+        return QueryResult::getQueryResultWithError(preparedStatement->errMsg);
+    }
+    useInternalCatalogEntry_ = cachedStatement->useInternalCatalogEntry;
+    this->resetActiveQuery();
+    this->startTimer();
+    auto executingTimer = TimeMetric(true /* enable */);
+    executingTimer.start();
+    std::unique_ptr<QueryResult> result;
+    try {
+        bool isTransactionStatement =
+            preparedStatement->getStatementType() == StatementType::TRANSACTION;
+        TransactionHelper::runFuncInTransaction(
+            *transactionContext,
+            [&]() -> void {
+                const auto profiler = std::make_unique<Profiler>();
+                profiler->enabled = cachedStatement->logicalPlan->isProfile();
+                if (!queryID) {
+                    queryID = localDatabase->getNextQueryID();
+                }
+                const auto executionContext =
+                    std::make_unique<ExecutionContext>(profiler.get(), this, *queryID);
+                auto mapper = PlanMapper(executionContext.get());
+                const auto physicalPlan = mapper.getPhysicalPlan(cachedStatement->logicalPlan.get(),
+                    cachedStatement->columns, queryConfig.resultType, queryConfig.arrowConfig);
+                if (isTransactionStatement) {
+                    result = localDatabase->queryProcessor->execute(physicalPlan.get(),
+                        executionContext.get());
+                } else {
+                    if (preparedStatement->getStatementType() == StatementType::COPY_FROM) {
+                        // Note: We always force checkpoint for COPY_FROM statement.
+                        Transaction::Get(*this)->setForceCheckpoint();
+                    }
+                    result = localDatabase->queryProcessor->execute(physicalPlan.get(),
+                        executionContext.get());
+                }
+            },
+            preparedStatement->isReadOnly(), isTransactionStatement,
+            TransactionHelper::getAction(true /*shouldCommitNewTransaction*/,
+                !isTransactionStatement /*shouldCommitAutoTransaction*/));
+    } catch (std::exception& e) {
+        useInternalCatalogEntry_ = false;
+        return handleFailedExecution(queryID, e);
+    }
+    const auto memoryManager = storage::MemoryManager::Get(*this);
+    memoryManager->getBufferManager()->getSpillerOrSkip([](auto& spiller) { spiller.clearFile(); });
+    executingTimer.stop();
+    result->setColumnNames(cachedStatement->getColumnNames());
+    result->setColumnTypes(cachedStatement->getColumnTypes());
+    auto summary = std::make_unique<QuerySummary>(preparedStatement->preparedSummary);
+    summary->setExecutionTime(executingTimer.getElapsedTimeMS());
+    result->setQuerySummary(std::move(summary));
+    return result;
+}
+
+std::unique_ptr<QueryResult> ClientContext::handleFailedExecution(std::optional<uint64_t> queryID,
+    const std::exception& e) const {
+    const auto memoryManager = storage::MemoryManager::Get(*this);
+    memoryManager->getBufferManager()->getSpillerOrSkip([](auto& spiller) { spiller.clearFile(); });
+    if (queryID.has_value()) {
+        progressBar->endProgress(queryID.value());
+    }
+    return QueryResult::getQueryResultWithError(e.what());
+}
+
+ClientContext::TransactionHelper::TransactionCommitAction
+ClientContext::TransactionHelper::getAction(bool commitIfNew, bool commitIfAuto) {
+    if (commitIfNew && commitIfAuto) {
+        return TransactionCommitAction::COMMIT_NEW_OR_AUTO;
+    }
+    if (commitIfNew) {
+        return TransactionCommitAction::COMMIT_IF_NEW;
+    }
+    if (commitIfAuto) {
+        return TransactionCommitAction::COMMIT_IF_AUTO;
+    }
+    return TransactionCommitAction::NOT_COMMIT;
+}
+
+// If there is an active transaction in the context, we execute the function in the current active
+// transaction. If there is no active transaction, we start an auto commit transaction.
+void ClientContext::TransactionHelper::runFuncInTransaction(TransactionContext& context,
+    const std::function<void()>& fun, bool readOnlyStatement, bool isTransactionStatement,
+    TransactionCommitAction action) {
+    KU_ASSERT(context.isAutoTransaction() || context.hasActiveTransaction());
+    const bool requireNewTransaction =
+        context.isAutoTransaction() && !context.hasActiveTransaction() && !isTransactionStatement;
+    if (requireNewTransaction) {
+        context.beginAutoTransaction(readOnlyStatement);
+    }
+    try {
+        fun();
+        if ((requireNewTransaction && commitIfNew(action)) ||
+            (context.isAutoTransaction() && commitIfAuto(action))) {
+            context.commit();
+        }
+    } catch (CheckpointException&) {
+        context.clearTransaction();
+        throw;
+    } catch (std::exception&) {
+        context.rollback();
+        throw;
+    }
+}
+
+bool ClientContext::canExecuteWriteQuery() const {
+    if (getDBConfig()->readOnly) {
+        return false;
+    }
+    // Note: we can only attach a remote lbug database in read-only mode and only one
+    // remote lbug database can be attached.
+    const auto dbManager = DatabaseManager::Get(*this);
+    for (const auto& attachedDB : dbManager->getAttachedDatabases()) {
+        if (attachedDB->getDBType() == ATTACHED_LBUG_DB_TYPE) {
+            return false;
+        }
+    }
+    return true;
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/connection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/connection.cpp
new file mode 100644
index 0000000000..2a663100cd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/connection.cpp
@@ -0,0 +1,111 @@
+#include "main/connection.h"
+
+#include <utility>
+
+#include "common/random_engine.h"
+
+using namespace lbug::parser;
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::processor;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace main {
+
+Connection::Connection(Database* database) {
+    KU_ASSERT(database != nullptr);
+    this->database = database;
+    this->dbLifeCycleManager = database->dbLifeCycleManager;
+    clientContext = std::make_unique<ClientContext>(database);
+}
+
+Connection::~Connection() {
+    clientContext->preventTransactionRollbackOnDestruction = dbLifeCycleManager->isDatabaseClosed;
+}
+
+void Connection::setMaxNumThreadForExec(uint64_t numThreads) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    clientContext->setMaxNumThreadForExec(numThreads);
+}
+
+uint64_t Connection::getMaxNumThreadForExec() {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    return clientContext->getMaxNumThreadForExec();
+}
+
+std::unique_ptr<PreparedStatement> Connection::prepare(std::string_view query) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    return clientContext->prepareWithParams(query);
+}
+
+std::unique_ptr<PreparedStatement> Connection::prepareWithParams(std::string_view query,
+    std::unordered_map<std::string, std::unique_ptr<common::Value>> inputParams) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    return clientContext->prepareWithParams(query, std::move(inputParams));
+}
+
+std::unique_ptr<QueryResult> Connection::query(std::string_view queryStatement) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    auto queryResult = clientContext->query(queryStatement);
+    queryResult->setDBLifeCycleManager(dbLifeCycleManager);
+    return queryResult;
+}
+
+std::unique_ptr<QueryResult> Connection::queryAsArrow(std::string_view query, int64_t chunkSize) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    auto queryResult = clientContext->query(query, std::nullopt,
+        {QueryResultType::ARROW, ArrowResultConfig{chunkSize}});
+    queryResult->setDBLifeCycleManager(dbLifeCycleManager);
+    return queryResult;
+}
+
+std::unique_ptr<QueryResult> Connection::queryWithID(std::string_view queryStatement,
+    uint64_t queryID) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    auto queryResult = clientContext->query(queryStatement, queryID);
+    queryResult->setDBLifeCycleManager(dbLifeCycleManager);
+    return queryResult;
+}
+
+void Connection::interrupt() {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    clientContext->interrupt();
+}
+
+void Connection::setQueryTimeOut(uint64_t timeoutInMS) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    clientContext->setQueryTimeOut(timeoutInMS);
+}
+
+std::unique_ptr<QueryResult> Connection::executeWithParams(PreparedStatement* preparedStatement,
+    std::unordered_map<std::string, std::unique_ptr<Value>> inputParams) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    auto queryResult = clientContext->executeWithParams(preparedStatement, std::move(inputParams));
+    queryResult->setDBLifeCycleManager(dbLifeCycleManager);
+    return queryResult;
+}
+
+std::unique_ptr<QueryResult> Connection::executeWithParamsWithID(
+    PreparedStatement* preparedStatement,
+    std::unordered_map<std::string, std::unique_ptr<Value>> inputParams, uint64_t queryID) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    auto queryResult =
+        clientContext->executeWithParams(preparedStatement, std::move(inputParams), queryID);
+    queryResult->setDBLifeCycleManager(dbLifeCycleManager);
+    return queryResult;
+}
+
+void Connection::addScalarFunction(std::string name, function::function_set definitions) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    clientContext->addScalarFunction(name, std::move(definitions));
+}
+
+void Connection::removeScalarFunction(std::string name) {
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+    clientContext->removeScalarFunction(name);
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/database.cpp
new file mode 100644
index 0000000000..24eba72f1a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/database.cpp
@@ -0,0 +1,239 @@
+#include "main/database.h"
+
+#include "extension/binder_extension.h"
+#include "extension/extension_manager.h"
+#include "extension/mapper_extension.h"
+#include "extension/planner_extension.h"
+#include "extension/transformer_extension.h"
+#include "main/client_context.h"
+#include "main/database_manager.h"
+#include "storage/buffer_manager/buffer_manager.h"
+
+#if defined(_WIN32)
+#include <windows.h>
+#else
+#include <unistd.h>
+#endif
+
+#include "common/exception/exception.h"
+#include "common/file_system/virtual_file_system.h"
+#include "main/db_config.h"
+#include "processor/processor.h"
+#include "storage/storage_extension.h"
+#include "storage/storage_manager.h"
+#include "storage/storage_utils.h"
+#include "transaction/transaction_manager.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace main {
+
+SystemConfig::SystemConfig(uint64_t bufferPoolSize_, uint64_t maxNumThreads, bool enableCompression,
+    bool readOnly, uint64_t maxDBSize, bool autoCheckpoint, uint64_t checkpointThreshold,
+    bool forceCheckpointOnClose, bool throwOnWalReplayFailure, bool enableChecksums
+#if defined(__APPLE__)
+    ,
+    uint32_t threadQos
+#endif
+    )
+    : maxNumThreads{maxNumThreads}, enableCompression{enableCompression}, readOnly{readOnly},
+      autoCheckpoint{autoCheckpoint}, checkpointThreshold{checkpointThreshold},
+      forceCheckpointOnClose{forceCheckpointOnClose},
+      throwOnWalReplayFailure(throwOnWalReplayFailure), enableChecksums(enableChecksums) {
+#if defined(__APPLE__)
+    this->threadQos = threadQos;
+#endif
+    if (bufferPoolSize_ == -1u || bufferPoolSize_ == 0) {
+#if defined(_WIN32)
+        MEMORYSTATUSEX status;
+        status.dwLength = sizeof(status);
+        GlobalMemoryStatusEx(&status);
+        auto systemMemSize = (std::uint64_t)status.ullTotalPhys;
+#else
+        auto systemMemSize = static_cast<std::uint64_t>(sysconf(_SC_PHYS_PAGES)) *
+                             static_cast<std::uint64_t>(sysconf(_SC_PAGESIZE));
+#endif
+        bufferPoolSize_ = static_cast<uint64_t>(
+            BufferPoolConstants::DEFAULT_PHY_MEM_SIZE_RATIO_FOR_BM *
+            static_cast<double>(std::min(systemMemSize, static_cast<uint64_t>(UINTPTR_MAX))));
+        // On 32-bit systems or systems with extremely large memory, the buffer pool size may
+        // exceed the maximum size of a VMRegion. In this case, we set the buffer pool size to
+        // 80% of the maximum size of a VMRegion.
+        bufferPoolSize_ = static_cast<uint64_t>(std::min(static_cast<double>(bufferPoolSize_),
+            BufferPoolConstants::DEFAULT_VM_REGION_MAX_SIZE *
+                BufferPoolConstants::DEFAULT_PHY_MEM_SIZE_RATIO_FOR_BM));
+    }
+    bufferPoolSize = bufferPoolSize_;
+#ifndef __SINGLE_THREADED__
+    if (maxNumThreads == 0) {
+        this->maxNumThreads = std::thread::hardware_concurrency();
+    }
+#else
+    // In single-threaded mode, even if the user specifies a number of threads,
+    // it will be ignored and set to 0.
+    this->maxNumThreads = 1;
+#endif
+    if (maxDBSize == -1u) {
+        maxDBSize = BufferPoolConstants::DEFAULT_VM_REGION_MAX_SIZE;
+    }
+    this->maxDBSize = maxDBSize;
+}
+
+Database::Database(std::string_view databasePath, SystemConfig systemConfig)
+    : Database(databasePath, systemConfig, initBufferManager) {}
+
+Database::Database(std::string_view databasePath, SystemConfig systemConfig,
+    construct_bm_func_t constructBMFunc)
+    : dbConfig(systemConfig) {
+    initMembers(databasePath, constructBMFunc);
+}
+
+std::unique_ptr<BufferManager> Database::initBufferManager(const Database& db) {
+    return std::make_unique<BufferManager>(db.databasePath,
+        StorageUtils::getTmpFilePath(db.databasePath), db.dbConfig.bufferPoolSize,
+        db.dbConfig.maxDBSize, db.vfs.get(), db.dbConfig.readOnly);
+}
+
+void Database::initMembers(std::string_view dbPath, construct_bm_func_t initBmFunc) {
+    // To expand a path with home directory(~), we have to pass in a dummy clientContext which
+    // handles the home directory expansion.
+    const auto dbPathStr = std::string(dbPath);
+    auto clientContext = ClientContext(this);
+    databasePath = StorageUtils::expandPath(&clientContext, dbPathStr);
+
+    if (std::filesystem::is_directory(databasePath)) {
+        throw RuntimeException("Database path cannot be a directory: " + databasePath);
+    }
+    vfs = std::make_unique<VirtualFileSystem>(databasePath);
+    validatePathInReadOnly();
+
+    bufferManager = initBmFunc(*this);
+    memoryManager = std::make_unique<MemoryManager>(bufferManager.get(), vfs.get());
+#if defined(__APPLE__)
+    queryProcessor =
+        std::make_unique<processor::QueryProcessor>(dbConfig.maxNumThreads, dbConfig.threadQos);
+#else
+    queryProcessor = std::make_unique<processor::QueryProcessor>(dbConfig.maxNumThreads);
+#endif
+
+    catalog = std::make_unique<Catalog>();
+    storageManager = std::make_unique<StorageManager>(databasePath, dbConfig.readOnly,
+        dbConfig.enableChecksums, *memoryManager, dbConfig.enableCompression, vfs.get());
+    transactionManager = std::make_unique<TransactionManager>(storageManager->getWAL());
+    databaseManager = std::make_unique<DatabaseManager>();
+
+    extensionManager = std::make_unique<extension::ExtensionManager>();
+    dbLifeCycleManager = std::make_shared<DatabaseLifeCycleManager>();
+    if (clientContext.isInMemory()) {
+        storageManager->initDataFileHandle(vfs.get(), &clientContext);
+        extensionManager->autoLoadLinkedExtensions(&clientContext);
+        return;
+    }
+    StorageManager::recover(clientContext, dbConfig.throwOnWalReplayFailure,
+        dbConfig.enableChecksums);
+}
+
+Database::~Database() {
+    if (!dbConfig.readOnly && dbConfig.forceCheckpointOnClose) {
+        try {
+            ClientContext clientContext(this);
+            transactionManager->checkpoint(clientContext);
+        } catch (...) {} // NOLINT
+    }
+    dbLifeCycleManager->isDatabaseClosed = true;
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const function.
+void Database::registerFileSystem(std::unique_ptr<FileSystem> fs) {
+    vfs->registerFileSystem(std::move(fs));
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const function.
+void Database::registerStorageExtension(std::string name,
+    std::unique_ptr<StorageExtension> storageExtension) {
+    extensionManager->registerStorageExtension(std::move(name), std::move(storageExtension));
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const function.
+void Database::addExtensionOption(std::string name, LogicalTypeID type, Value defaultValue,
+    bool isConfidential) {
+    extensionManager->addExtensionOption(std::move(name), type, std::move(defaultValue),
+        isConfidential);
+}
+
+void Database::addTransformerExtension(
+    std::unique_ptr<extension::TransformerExtension> transformerExtension) {
+    transformerExtensions.push_back(std::move(transformerExtension));
+}
+
+std::vector<extension::TransformerExtension*> Database::getTransformerExtensions() {
+    std::vector<extension::TransformerExtension*> transformers;
+    for (auto& transformerExtension : transformerExtensions) {
+        transformers.push_back(transformerExtension.get());
+    }
+    return transformers;
+}
+
+void Database::addBinderExtension(
+    std::unique_ptr<extension::BinderExtension> transformerExtension) {
+    binderExtensions.push_back(std::move(transformerExtension));
+}
+
+std::vector<extension::BinderExtension*> Database::getBinderExtensions() {
+    std::vector<extension::BinderExtension*> binders;
+    for (auto& binderExtension : binderExtensions) {
+        binders.push_back(binderExtension.get());
+    }
+    return binders;
+}
+
+void Database::addPlannerExtension(std::unique_ptr<extension::PlannerExtension> plannerExtension) {
+    plannerExtensions.push_back(std::move(plannerExtension));
+}
+
+std::vector<extension::PlannerExtension*> Database::getPlannerExtensions() {
+    std::vector<extension::PlannerExtension*> planners;
+    for (auto& plannerExtension : plannerExtensions) {
+        planners.push_back(plannerExtension.get());
+    }
+    return planners;
+}
+
+void Database::addMapperExtension(std::unique_ptr<extension::MapperExtension> mapperExtension) {
+    mapperExtensions.push_back(std::move(mapperExtension));
+}
+
+std::vector<extension::MapperExtension*> Database::getMapperExtensions() {
+    std::vector<extension::MapperExtension*> mappers;
+    for (auto& mapperExtension : mapperExtensions) {
+        mappers.push_back(mapperExtension.get());
+    }
+    return mappers;
+}
+
+std::vector<StorageExtension*> Database::getStorageExtensions() {
+    return extensionManager->getStorageExtensions();
+}
+
+void Database::validatePathInReadOnly() const {
+    if (dbConfig.readOnly) {
+        if (DBConfig::isDBPathInMemory(databasePath)) {
+            throw Exception("Cannot open an in-memory database under READ ONLY mode.");
+        }
+        if (!vfs->fileOrPathExists(databasePath)) {
+            throw Exception("Cannot create an empty database under READ ONLY mode.");
+        }
+    }
+}
+
+uint64_t Database::getNextQueryID() {
+    std::unique_lock lock(queryIDGenerator.queryIDLock);
+    return queryIDGenerator.queryID++;
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/database_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/database_manager.cpp
new file mode 100644
index 0000000000..0b7de4a3fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/database_manager.cpp
@@ -0,0 +1,88 @@
+#include "main/database_manager.h"
+
+#include "common/exception/runtime.h"
+#include "common/string_utils.h"
+#include "main/client_context.h"
+#include "main/database.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace main {
+
+DatabaseManager::DatabaseManager() : defaultDatabase{""} {}
+
+void DatabaseManager::registerAttachedDatabase(std::unique_ptr<AttachedDatabase> attachedDatabase) {
+    if (defaultDatabase == "") {
+        defaultDatabase = attachedDatabase->getDBName();
+    }
+    if (hasAttachedDatabase(attachedDatabase->getDBName())) {
+        throw RuntimeException{stringFormat(
+            "Duplicate attached database name: {}. Attached database name must be unique.",
+            attachedDatabase->getDBName())};
+    }
+    attachedDatabases.push_back(std::move(attachedDatabase));
+}
+
+bool DatabaseManager::hasAttachedDatabase(const std::string& name) {
+    auto upperCaseName = StringUtils::getUpper(name);
+    for (auto& attachedDatabase : attachedDatabases) {
+        auto attachedDBName = StringUtils::getUpper(attachedDatabase->getDBName());
+        if (attachedDBName == upperCaseName) {
+            return true;
+        }
+    }
+    return false;
+}
+
+AttachedDatabase* DatabaseManager::getAttachedDatabase(const std::string& name) {
+    auto upperCaseName = StringUtils::getUpper(name);
+    for (auto& attachedDatabase : attachedDatabases) {
+        auto attachedDBName = StringUtils::getUpper(attachedDatabase->getDBName());
+        if (attachedDBName == upperCaseName) {
+            return attachedDatabase.get();
+        }
+    }
+    throw RuntimeException{stringFormat("No database named {}.", name)};
+}
+
+void DatabaseManager::detachDatabase(const std::string& databaseName) {
+    auto upperCaseName = StringUtils::getUpper(databaseName);
+    for (auto it = attachedDatabases.begin(); it != attachedDatabases.end(); ++it) {
+        auto attachedDBName = (*it)->getDBName();
+        StringUtils::toUpper(attachedDBName);
+        if (attachedDBName == upperCaseName) {
+            attachedDatabases.erase(it);
+            return;
+        }
+    }
+    throw RuntimeException{stringFormat("Database: {} doesn't exist.", databaseName)};
+}
+
+void DatabaseManager::setDefaultDatabase(const std::string& databaseName) {
+    if (getAttachedDatabase(databaseName) == nullptr) {
+        throw RuntimeException{stringFormat("No database named {}.", databaseName)};
+    }
+    defaultDatabase = databaseName;
+}
+
+std::vector<AttachedDatabase*> DatabaseManager::getAttachedDatabases() const {
+    std::vector<AttachedDatabase*> attachedDatabasesPtr;
+    for (auto& attachedDatabase : attachedDatabases) {
+        attachedDatabasesPtr.push_back(attachedDatabase.get());
+    }
+    return attachedDatabasesPtr;
+}
+
+void DatabaseManager::invalidateCache() {
+    for (auto& attachedDatabase : attachedDatabases) {
+        attachedDatabase->invalidateCache();
+    }
+}
+
+DatabaseManager* DatabaseManager::Get(const ClientContext& context) {
+    return context.getDatabase()->getDatabaseManager();
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/db_config.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/db_config.cpp
new file mode 100644
index 0000000000..b835ba0d75
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/db_config.cpp
@@ -0,0 +1,57 @@
+#include "main/db_config.h"
+
+#include "common/string_utils.h"
+#include "main/database.h"
+#include "main/settings.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace main {
+
+#define GET_CONFIGURATION(_PARAM)                                                                  \
+    { _PARAM::name, _PARAM::inputType, _PARAM::setContext, _PARAM::getSetting }
+
+static ConfigurationOption options[] = { // NOLINT(cert-err58-cpp):
+    GET_CONFIGURATION(ThreadsSetting), GET_CONFIGURATION(TimeoutSetting),
+    GET_CONFIGURATION(WarningLimitSetting), GET_CONFIGURATION(VarLengthExtendMaxDepthSetting),
+    GET_CONFIGURATION(SparseFrontierThresholdSetting), GET_CONFIGURATION(EnableSemiMaskSetting),
+    GET_CONFIGURATION(DisableMapKeyCheck), GET_CONFIGURATION(EnableZoneMapSetting),
+    GET_CONFIGURATION(HomeDirectorySetting), GET_CONFIGURATION(FileSearchPathSetting),
+    GET_CONFIGURATION(ProgressBarSetting), GET_CONFIGURATION(RecursivePatternSemanticSetting),
+    GET_CONFIGURATION(RecursivePatternFactorSetting), GET_CONFIGURATION(EnableMVCCSetting),
+    GET_CONFIGURATION(CheckpointThresholdSetting), GET_CONFIGURATION(AutoCheckpointSetting),
+    GET_CONFIGURATION(ForceCheckpointClosingDBSetting), GET_CONFIGURATION(SpillToDiskSetting),
+    GET_CONFIGURATION(EnableOptimizerSetting), GET_CONFIGURATION(EnableInternalCatalogSetting)};
+
+DBConfig::DBConfig(const SystemConfig& systemConfig)
+    : bufferPoolSize{systemConfig.bufferPoolSize}, maxNumThreads{systemConfig.maxNumThreads},
+      enableCompression{systemConfig.enableCompression}, readOnly{systemConfig.readOnly},
+      maxDBSize{systemConfig.maxDBSize}, enableMultiWrites{false},
+      autoCheckpoint{systemConfig.autoCheckpoint},
+      checkpointThreshold{systemConfig.checkpointThreshold},
+      forceCheckpointOnClose{systemConfig.forceCheckpointOnClose},
+      throwOnWalReplayFailure(systemConfig.throwOnWalReplayFailure),
+      enableChecksums(systemConfig.enableChecksums), enableSpillingToDisk{true} {
+#if defined(__APPLE__)
+    this->threadQos = systemConfig.threadQos;
+#endif
+}
+
+ConfigurationOption* DBConfig::getOptionByName(const std::string& optionName) {
+    auto lOptionName = optionName;
+    StringUtils::toLower(lOptionName);
+    for (auto& internalOption : options) {
+        if (internalOption.name == lOptionName) {
+            return &internalOption;
+        }
+    }
+    return nullptr;
+}
+
+bool DBConfig::isDBPathInMemory(const std::string& dbPath) {
+    return dbPath.empty() || dbPath == ":memory:";
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/plan_printer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/plan_printer.cpp
new file mode 100644
index 0000000000..ed18126bab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/plan_printer.cpp
@@ -0,0 +1,445 @@
+#include "main/plan_printer.h"
+
+#include <sstream>
+
+#include "json.hpp"
+#include "planner/operator/logical_plan.h"
+#include "processor/physical_plan.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace main {
+
+OpProfileBox::OpProfileBox(std::string opName, const std::string& paramsName,
+    std::vector<std::string> attributes)
+    : opName{std::move(opName)}, attributes{std::move(attributes)} {
+    std::stringstream paramsStream{paramsName};
+    std::string paramStr = "";
+    std::string subStr;
+    bool subParam = false;
+    // This loop splits the parameters by commas, while not
+    // splitting up parameters that are operators.
+    while (paramsStream.good()) {
+        getline(paramsStream, subStr, ',');
+        if (subStr.find('(') != std::string::npos && subStr.find(')') == std::string::npos) {
+            paramStr = subStr;
+            subParam = true;
+            continue;
+        }
+        if (subParam && subStr.find(')') == std::string::npos) {
+            paramStr += "," + subStr;
+            continue;
+        }
+        if (subParam) {
+            subStr = paramStr + ")";
+            paramStr = "";
+            subParam = false;
+        }
+        // This if statement discards any strings that are completely whitespace.
+        if (subStr.find_first_not_of(" \t\n\v\f\r") != std::string::npos) {
+            paramsNames.push_back(subStr);
+        }
+    }
+}
+
+uint32_t OpProfileBox::getAttributeMaxLen() const {
+    auto maxAttributeLen = opName.length();
+    for (auto& param : paramsNames) {
+        maxAttributeLen = std::max(param.length(), maxAttributeLen);
+    }
+    for (auto& attribute : attributes) {
+        maxAttributeLen = std::max(attribute.length(), maxAttributeLen);
+    }
+    return maxAttributeLen;
+}
+
+std::string OpProfileBox::getParamsName(uint32_t idx) const {
+    KU_ASSERT(idx < paramsNames.size());
+    return paramsNames[idx];
+}
+
+std::string OpProfileBox::getAttribute(uint32_t idx) const {
+    KU_ASSERT(idx < attributes.size());
+    return attributes[idx];
+}
+
+OpProfileTree::OpProfileTree(const PhysicalOperator* op, Profiler& profiler) {
+    auto numRows = 0u, numCols = 0u;
+    calculateNumRowsAndColsForOp(op, numRows, numCols);
+    opProfileBoxes.resize(numRows);
+    for_each(opProfileBoxes.begin(), opProfileBoxes.end(),
+        [numCols](std::vector<std::unique_ptr<OpProfileBox>>& profileBoxes) {
+            profileBoxes.resize(numCols);
+        });
+    auto maxFieldWidth = 0u;
+    fillOpProfileBoxes(op, 0 /* rowIdx */, 0 /* colIdx */, maxFieldWidth, profiler);
+    // The width of each profileBox = fieldWidth + leftIndentWidth + boxLeftFrameWidth +
+    // rightIndentWidth + boxRightFrameWidth;
+    this->opProfileBoxWidth = maxFieldWidth + 2 * (INDENT_WIDTH + BOX_FRAME_WIDTH);
+}
+
+OpProfileTree::OpProfileTree(const LogicalOperator* op) {
+    auto numRows = 0u, numCols = 0u;
+    calculateNumRowsAndColsForOp(op, numRows, numCols);
+    opProfileBoxes.resize(numRows);
+    for_each(opProfileBoxes.begin(), opProfileBoxes.end(),
+        [numCols](std::vector<std::unique_ptr<OpProfileBox>>& profileBoxes) {
+            profileBoxes.resize(numCols);
+        });
+    auto maxFieldWidth = 0u;
+    fillOpProfileBoxes(op, 0 /* rowIdx */, 0 /* colIdx */, maxFieldWidth);
+    // The width of each profileBox = fieldWidth + leftIndentWidth + boxLeftFrameWidth +
+    // rightIndentWidth + boxRightFrameWidth;
+    this->opProfileBoxWidth = std::max<uint32_t>(
+        maxFieldWidth + 2 * (INDENT_WIDTH + BOX_FRAME_WIDTH), MIN_LOGICAL_BOX_WIDTH);
+}
+
+void printSpaceIfNecessary(uint32_t idx, std::ostringstream& oss) {
+    if (idx > 0) {
+        oss << " ";
+    }
+}
+
+std::ostringstream OpProfileTree::printPlanToOstream() const {
+    std::ostringstream oss;
+    prettyPrintPlanTitle(oss, "Physical Plan");
+    for (auto i = 0u; i < opProfileBoxes.size(); i++) {
+        printOpProfileBoxUpperFrame(i, oss);
+        printOpProfileBoxes(i, oss);
+        printOpProfileBoxLowerFrame(i, oss);
+    }
+    return oss;
+}
+
+std::ostringstream OpProfileTree::printLogicalPlanToOstream() const {
+    std::ostringstream oss;
+    prettyPrintPlanTitle(oss, "Logical Plan");
+    for (auto i = 0u; i < opProfileBoxes.size(); i++) {
+        printOpProfileBoxUpperFrame(i, oss);
+        printOpProfileBoxes(i, oss);
+        printOpProfileBoxLowerFrame(i, oss);
+    }
+    return oss;
+}
+
+void OpProfileTree::calculateNumRowsAndColsForOp(const PhysicalOperator* op, uint32_t& numRows,
+    uint32_t& numCols) {
+    if (!op->getNumChildren()) {
+        numRows = 1;
+        numCols = 1;
+        return;
+    }
+
+    for (auto i = 0u; i < op->getNumChildren(); i++) {
+        auto numRowsInChild = 0u, numColsInChild = 0u;
+        calculateNumRowsAndColsForOp(op->getChild(i), numRowsInChild, numColsInChild);
+        numCols += numColsInChild;
+        numRows = std::max(numRowsInChild, numRows);
+    }
+    numRows++;
+}
+
+void OpProfileTree::calculateNumRowsAndColsForOp(const LogicalOperator* op, uint32_t& numRows,
+    uint32_t& numCols) {
+    if (!op->getNumChildren()) {
+        numRows = 1;
+        numCols = 1;
+        return;
+    }
+
+    for (auto i = 0u; i < op->getNumChildren(); i++) {
+        auto numRowsInChild = 0u, numColsInChild = 0u;
+        calculateNumRowsAndColsForOp(op->getChild(i).get(), numRowsInChild, numColsInChild);
+        numCols += numColsInChild;
+        numRows = std::max(numRowsInChild, numRows);
+    }
+    numRows++;
+}
+
+uint32_t OpProfileTree::fillOpProfileBoxes(const PhysicalOperator* op, uint32_t rowIdx,
+    uint32_t colIdx, uint32_t& maxFieldWidth, Profiler& profiler) {
+    auto opProfileBox = std::make_unique<OpProfileBox>(PlanPrinter::getOperatorName(op),
+        PlanPrinter::getOperatorParams(op), op->getProfilerAttributes(profiler));
+    maxFieldWidth = std::max(opProfileBox->getAttributeMaxLen(), maxFieldWidth);
+    insertOpProfileBox(rowIdx, colIdx, std::move(opProfileBox));
+    if (!op->getNumChildren()) {
+        return 1;
+    }
+
+    uint32_t colOffset = 0;
+    for (auto i = 0u; i < op->getNumChildren(); i++) {
+        colOffset += fillOpProfileBoxes(op->getChild(i), rowIdx + 1, colIdx + colOffset,
+            maxFieldWidth, profiler);
+    }
+    return colOffset;
+}
+
+uint32_t OpProfileTree::fillOpProfileBoxes(const LogicalOperator* op, uint32_t rowIdx,
+    uint32_t colIdx, uint32_t& maxFieldWidth) {
+    auto opProfileBox = std::make_unique<OpProfileBox>(PlanPrinter::getOperatorName(op),
+        PlanPrinter::getOperatorParams(op),
+        std::vector<std::string>{"Cardinality: " + std::to_string(op->getCardinality())});
+    maxFieldWidth = std::max(opProfileBox->getAttributeMaxLen(), maxFieldWidth);
+    insertOpProfileBox(rowIdx, colIdx, std::move(opProfileBox));
+    if (!op->getNumChildren()) {
+        return 1;
+    }
+
+    uint32_t colOffset = 0;
+    for (auto i = 0u; i < op->getNumChildren(); i++) {
+        colOffset += fillOpProfileBoxes(op->getChild(i).get(), rowIdx + 1, colIdx + colOffset,
+            maxFieldWidth);
+    }
+    return colOffset;
+}
+
+void OpProfileTree::printOpProfileBoxUpperFrame(uint32_t rowIdx, std::ostringstream& oss) const {
+    for (auto i = 0u; i < opProfileBoxes[rowIdx].size(); i++) {
+        printSpaceIfNecessary(i, oss);
+        if (getOpProfileBox(rowIdx, i)) {
+            // If the current box has a parent, we need to put a "┴" in the  box upper frame to
+            // connect to its parent.
+            if (hasOpProfileBoxOnUpperLeft(rowIdx, i)) {
+                auto leftFrameLength = (opProfileBoxWidth - 2 * BOX_FRAME_WIDTH - 1) / 2;
+                oss << "┌" << genHorizLine(leftFrameLength) << "┴"
+                    << genHorizLine(opProfileBoxWidth - 2 * BOX_FRAME_WIDTH - 1 - leftFrameLength)
+                    << "┐";
+            } else {
+                oss << "┌" << genHorizLine(opProfileBoxWidth - 2 * BOX_FRAME_WIDTH) << "┐";
+            }
+        } else {
+            oss << std::string(opProfileBoxWidth, ' ');
+        }
+    }
+    oss << '\n';
+}
+
+static std::string dashedLineAccountingForIndex(uint32_t width, uint32_t indent) {
+    return std::string(width - (1 + indent) * 2, '-');
+}
+
+void OpProfileTree::printOpProfileBoxes(uint32_t rowIdx, std::ostringstream& oss) const {
+    auto height = calculateRowHeight(rowIdx);
+    auto halfWayPoint = height / 2;
+    uint32_t offset = 0;
+    for (auto i = 0u; i < height; i++) {
+        for (auto j = 0u; j < opProfileBoxes[rowIdx].size(); j++) {
+            auto opProfileBox = getOpProfileBox(rowIdx, j);
+            if (opProfileBox &&
+                i < 2 * (opProfileBox->getNumAttributes() + 1) + opProfileBox->getNumParams()) {
+                printSpaceIfNecessary(j, oss);
+                std::string textToPrint;
+                unsigned int numParams = opProfileBox->getNumParams();
+                if (i == 0) {
+                    textToPrint = opProfileBox->getOpName();
+                } else if (i == 1) { // NOLINT(bugprone-branch-clone): Merging these branches is a
+                                     // logical error, and this conditional chain is pleasant.
+                    textToPrint = dashedLineAccountingForIndex(opProfileBoxWidth, INDENT_WIDTH);
+                } else if (i <= numParams + 1) {
+                    textToPrint = opProfileBox->getParamsName(i - 2);
+                } else if ((i - numParams - 1) % 2) {
+                    textToPrint = dashedLineAccountingForIndex(opProfileBoxWidth, INDENT_WIDTH);
+                } else {
+                    textToPrint = opProfileBox->getAttribute((i - numParams - 1) / 2 - 1);
+                }
+                auto numLeftSpaces =
+                    (opProfileBoxWidth - (1 + INDENT_WIDTH) * 2 - textToPrint.length()) / 2;
+                auto numRightSpace = opProfileBoxWidth - (1 + INDENT_WIDTH) * 2 -
+                                     textToPrint.length() - numLeftSpaces;
+                oss << "│" << std::string(INDENT_WIDTH + numLeftSpaces, ' ') << textToPrint
+                    << std::string(INDENT_WIDTH + numRightSpace, ' ') << "│";
+            } else if (opProfileBox) {
+                // If we have printed out all the attributes in the current opProfileBox, print
+                // empty spaces as placeholders.
+                printSpaceIfNecessary(j, oss);
+                oss << "│" << std::string(opProfileBoxWidth - 2, ' ') << "│";
+            } else {
+                if (hasOpProfileBox(rowIdx + 1, j) && i >= halfWayPoint) {
+                    auto leftHorizLineSize = (opProfileBoxWidth - 1) / 2;
+                    if (i == halfWayPoint) {
+                        oss << genHorizLine(leftHorizLineSize + 1);
+                        if (hasOpProfileBox(rowIdx + 1, j + 4) && !hasOpProfileBox(rowIdx, j + 1)) {
+                            oss << "┬" << genHorizLine(opProfileBoxWidth - 1 - leftHorizLineSize);
+                        } else {
+                            if ((hasOpProfileBox(rowIdx + 1, j + 1) &&
+                                    !hasOpProfileBox(rowIdx, j) &&
+                                    !hasOpProfileBox(rowIdx, j + 1)) ||
+                                (hasOpProfileBox(rowIdx + 1, j + 2) &&
+                                    !hasOpProfileBox(rowIdx, j + 1))) {
+                                oss << "┬" << genHorizLine(opProfileBoxWidth / 2);
+                            } else {
+                                oss << "┐"
+                                    << std::string(opProfileBoxWidth - 1 - leftHorizLineSize, ' ');
+                            }
+                        }
+                    } else if (i > halfWayPoint) {
+                        printSpaceIfNecessary(j, oss);
+                        oss << std::string(leftHorizLineSize, ' ') << "│"
+                            << std::string(opProfileBoxWidth - 1 - leftHorizLineSize, ' ');
+                    }
+                } else if (((hasOpProfileBox(rowIdx + 1, j + 1) &&
+                                !hasOpProfileBox(rowIdx, j + 1)) ||
+                               (hasOpProfileBox(rowIdx + 1, j + 3) &&
+                                   !hasOpProfileBox(rowIdx, j + 3) &&
+                                   !hasOpProfileBox(rowIdx, j + 1) &&
+                                   !hasOpProfileBox(rowIdx, j + 2)) ||
+                               (hasOpProfileBox(rowIdx + 1, j - 2) &&
+                                   !hasOpProfileBox(rowIdx, j - 2) &&
+                                   hasOpProfileBox(rowIdx + 1, j + 3))) &&
+                           i == halfWayPoint && !hasOpProfileBox(rowIdx, j + 2)) {
+                    oss << genHorizLine(opProfileBoxWidth + 1);
+                    offset = offset == 0 ? 1 : 0;
+                } else {
+                    printSpaceIfNecessary(j, oss);
+                    oss << std::string(opProfileBoxWidth, ' ');
+                }
+            }
+        }
+        oss << '\n';
+    }
+}
+
+void OpProfileTree::printOpProfileBoxLowerFrame(uint32_t rowIdx, std::ostringstream& oss) const {
+    for (auto i = 0u; i < opProfileBoxes[rowIdx].size(); i++) {
+        if (getOpProfileBox(rowIdx, i)) {
+            printSpaceIfNecessary(i, oss);
+            // If the current opProfileBox has a child, we need to print out a connector to it.
+            if (hasOpProfileBox(rowIdx + 1, i)) {
+                auto leftFrameLength = (opProfileBoxWidth - 2 * BOX_FRAME_WIDTH - 1) / 2;
+                oss << "└" << genHorizLine(leftFrameLength) << "┬"
+                    << genHorizLine(opProfileBoxWidth - 2 * BOX_FRAME_WIDTH - 1 - leftFrameLength)
+                    << "┘";
+            } else {
+                oss << "└" << genHorizLine(opProfileBoxWidth - 2) << "┘";
+            }
+        } else if (hasOpProfileBox(rowIdx + 1, i)) {
+            // If there is a opProfileBox at the bottom, we need to print out a vertical line to
+            // connect it.
+            auto leftFrameLength = (opProfileBoxWidth - 1) / 2;
+            printSpaceIfNecessary(i, oss);
+            oss << std::string(leftFrameLength, ' ') << "│"
+                << std::string(opProfileBoxWidth - leftFrameLength - 1, ' ');
+        } else {
+            printSpaceIfNecessary(i, oss);
+            oss << std::string(opProfileBoxWidth, ' ');
+        }
+    }
+    oss << '\n';
+}
+
+void OpProfileTree::prettyPrintPlanTitle(std::ostringstream& oss, std::string title) const {
+    const std::string plan = title;
+    oss << "┌" << genHorizLine(opProfileBoxWidth - 2) << "┐" << '\n';
+    oss << "│┌" << genHorizLine(opProfileBoxWidth - 4) << "┐│" << '\n';
+    auto numLeftSpaces = (opProfileBoxWidth - plan.length() - 2 * (2 + INDENT_WIDTH)) / 2;
+    auto numRightSpaces =
+        opProfileBoxWidth - plan.length() - 2 * (2 + INDENT_WIDTH) - numLeftSpaces;
+    oss << "││" << std::string(INDENT_WIDTH + numLeftSpaces, ' ') << plan
+        << std::string(INDENT_WIDTH + numRightSpaces, ' ') << "││" << '\n';
+    oss << "│└" << genHorizLine(opProfileBoxWidth - 4) << "┘│" << '\n';
+    oss << "└" << genHorizLine(opProfileBoxWidth - 2) << "┘" << '\n';
+}
+
+std::string OpProfileTree::genHorizLine(uint32_t len) {
+    std::ostringstream tableFrame;
+    for (auto i = 0u; i < len; i++) {
+        tableFrame << "─";
+    }
+    return tableFrame.str();
+}
+
+void OpProfileTree::insertOpProfileBox(uint32_t rowIdx, uint32_t colIdx,
+    std::unique_ptr<OpProfileBox> opProfileBox) {
+    validateRowIdxAndColIdx(rowIdx, colIdx);
+    opProfileBoxes[rowIdx][colIdx] = std::move(opProfileBox);
+}
+
+OpProfileBox* OpProfileTree::getOpProfileBox(uint32_t rowIdx, uint32_t colIdx) const {
+    validateRowIdxAndColIdx(rowIdx, colIdx);
+    return opProfileBoxes[rowIdx][colIdx].get();
+}
+
+bool OpProfileTree::hasOpProfileBoxOnUpperLeft(uint32_t rowIdx, uint32_t colIdx) const {
+    validateRowIdxAndColIdx(rowIdx, colIdx);
+    for (auto i = 0u; i <= colIdx; i++) {
+        if (hasOpProfileBox(rowIdx - 1, i)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+uint32_t OpProfileTree::calculateRowHeight(uint32_t rowIdx) const {
+    validateRowIdxAndColIdx(rowIdx, 0 /* colIdx */);
+    auto height = 0u;
+    for (auto i = 0u; i < opProfileBoxes[rowIdx].size(); i++) {
+        auto opProfileBox = getOpProfileBox(rowIdx, i);
+        if (opProfileBox) {
+            height = std::max(height,
+                2 * opProfileBox->getNumAttributes() + opProfileBox->getNumParams());
+        }
+    }
+    return height + 2;
+}
+
+nlohmann::json PlanPrinter::printPlanToJson(const PhysicalPlan* physicalPlan, Profiler* profiler) {
+    return toJson(physicalPlan->lastOperator.get(), *profiler);
+}
+
+std::ostringstream PlanPrinter::printPlanToOstream(const PhysicalPlan* physicalPlan,
+    Profiler* profiler) {
+    return OpProfileTree(physicalPlan->lastOperator.get(), *profiler).printPlanToOstream();
+}
+
+nlohmann::json PlanPrinter::printPlanToJson(const LogicalPlan* logicalPlan) {
+    return toJson(logicalPlan->getLastOperator().get());
+}
+
+std::ostringstream PlanPrinter::printPlanToOstream(const LogicalPlan* logicalPlan) {
+    return OpProfileTree(logicalPlan->getLastOperator().get()).printLogicalPlanToOstream();
+}
+
+std::string PlanPrinter::getOperatorName(const PhysicalOperator* physicalOperator) {
+    return PhysicalOperatorUtils::operatorToString(physicalOperator);
+}
+
+std::string PlanPrinter::getOperatorParams(const PhysicalOperator* physicalOperator) {
+    return physicalOperator->getPrintInfo()->toString();
+}
+
+std::string PlanPrinter::getOperatorName(const LogicalOperator* logicalOperator) {
+    return LogicalOperatorUtils::logicalOperatorTypeToString(logicalOperator->getOperatorType());
+}
+
+std::string PlanPrinter::getOperatorParams(const LogicalOperator* logicalOperator) {
+    return logicalOperator->getPrintInfo()->toString();
+}
+
+nlohmann::json PlanPrinter::toJson(const PhysicalOperator* physicalOperator, Profiler& profiler_) {
+    auto json = nlohmann::json();
+    json["Name"] = getOperatorName(physicalOperator);
+    if (profiler_.enabled) {
+        for (auto& [key, val] : physicalOperator->getProfilerKeyValAttributes(profiler_)) {
+            json[key] = val;
+        }
+    }
+    for (auto i = 0u; i < physicalOperator->getNumChildren(); ++i) {
+        json["Child" + std::to_string(i)] = toJson(physicalOperator->getChild(i), profiler_);
+    }
+    return json;
+}
+
+nlohmann::json PlanPrinter::toJson(const LogicalOperator* logicalOperator) {
+    auto json = nlohmann::json();
+    json["Name"] = getOperatorName(logicalOperator);
+    for (auto i = 0u; i < logicalOperator->getNumChildren(); ++i) {
+        json["Child" + std::to_string(i)] = toJson(logicalOperator->getChild(i).get());
+    }
+    return json;
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/prepared_statement.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/prepared_statement.cpp
new file mode 100644
index 0000000000..23ed9f646f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/prepared_statement.cpp
@@ -0,0 +1,89 @@
+#include "main/prepared_statement.h"
+
+#include "binder/expression/expression.h" // IWYU pragma: keep
+#include "common/exception/binder.h"
+#include "common/types/value/value.h"
+#include "planner/operator/logical_plan.h" // IWYU pragma: keep
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace main {
+
+CachedPreparedStatement::CachedPreparedStatement() = default;
+CachedPreparedStatement::~CachedPreparedStatement() = default;
+
+std::vector<std::string> CachedPreparedStatement::getColumnNames() const {
+    std::vector<std::string> names;
+    for (auto& column : columns) {
+        names.push_back(column->toString());
+    }
+    return names;
+}
+
+std::vector<LogicalType> CachedPreparedStatement::getColumnTypes() const {
+    std::vector<LogicalType> types;
+    for (auto& column : columns) {
+        types.push_back(column->getDataType().copy());
+    }
+    return types;
+}
+
+bool PreparedStatement::isSuccess() const {
+    return success;
+}
+
+std::string PreparedStatement::getErrorMessage() const {
+    return errMsg;
+}
+
+bool PreparedStatement::isReadOnly() const {
+    return readOnly;
+}
+
+StatementType PreparedStatement::getStatementType() const {
+    return preparedSummary.statementType;
+}
+
+static void validateParam(const std::string& paramName, Value* newVal, Value* oldVal) {
+    if (newVal->getDataType().getLogicalTypeID() == LogicalTypeID::POINTER &&
+        newVal->getValue<uint8_t*>() != oldVal->getValue<uint8_t*>()) {
+        throw BinderException(stringFormat(
+            "When preparing the current statement the dataframe passed into parameter "
+            "'{}' was different from the one provided during prepare. Dataframes parameters "
+            "are only used during prepare; please make sure that they are either not passed into "
+            "execute or they match the one passed during prepare.",
+            paramName));
+    }
+}
+
+std::unordered_set<std::string> PreparedStatement::getKnownParameters() {
+    std::unordered_set<std::string> result;
+    for (auto& [k, _] : parameterMap) {
+        result.insert(k);
+    }
+    return result;
+}
+
+void PreparedStatement::updateParameter(const std::string& name, Value* value) {
+    KU_ASSERT(parameterMap.contains(name));
+    validateParam(name, value, parameterMap.at(name).get());
+    *parameterMap.at(name) = std::move(*value);
+}
+
+void PreparedStatement::addParameter(const std::string& name, Value* value) {
+    parameterMap.insert({name, std::make_shared<Value>(*value)});
+}
+
+PreparedStatement::~PreparedStatement() = default;
+
+std::unique_ptr<PreparedStatement> PreparedStatement::getPreparedStatementWithError(
+    const std::string& errorMessage) {
+    auto preparedStatement = std::make_unique<PreparedStatement>();
+    preparedStatement->success = false;
+    preparedStatement->errMsg = errorMessage;
+    return preparedStatement;
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/prepared_statement_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/prepared_statement_manager.cpp
new file mode 100644
index 0000000000..62c21b3a84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/prepared_statement_manager.cpp
@@ -0,0 +1,29 @@
+#include "main/prepared_statement_manager.h"
+
+#include "common/assert.h"
+#include "main/prepared_statement.h"
+
+namespace lbug {
+namespace main {
+
+CachedPreparedStatementManager::CachedPreparedStatementManager() = default;
+
+CachedPreparedStatementManager::~CachedPreparedStatementManager() = default;
+
+std::string CachedPreparedStatementManager::addStatement(
+    std::unique_ptr<CachedPreparedStatement> statement) {
+    std::unique_lock lck{mtx};
+    auto idx = std::to_string(currentIdx);
+    currentIdx++;
+    statementMap.insert({idx, std::move(statement)});
+    return idx;
+}
+
+CachedPreparedStatement* CachedPreparedStatementManager::getCachedStatement(
+    const std::string& name) const {
+    KU_ASSERT(containsStatement(name));
+    return statementMap.at(name).get();
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result.cpp
new file mode 100644
index 0000000000..1432e9b4b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result.cpp
@@ -0,0 +1,132 @@
+#include "main/query_result.h"
+
+#include "common/arrow/arrow_converter.h"
+#include "main/query_result/materialized_query_result.h"
+#include "processor/result/flat_tuple.h"
+
+using namespace lbug::common;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace main {
+
+QueryResult::QueryResult()
+    : type{QueryResultType::FTABLE}, nextQueryResult{nullptr}, queryResultIterator{this},
+      dbLifeCycleManager{nullptr} {}
+
+QueryResult::QueryResult(QueryResultType type)
+    : type{type}, nextQueryResult{nullptr}, queryResultIterator{this}, dbLifeCycleManager{nullptr} {
+
+}
+
+QueryResult::QueryResult(QueryResultType type, std::vector<std::string> columnNames,
+    std::vector<LogicalType> columnTypes)
+    : type{type}, columnNames{std::move(columnNames)}, columnTypes{std::move(columnTypes)},
+      nextQueryResult{nullptr}, queryResultIterator{this}, dbLifeCycleManager{nullptr} {
+    tuple = std::make_shared<FlatTuple>(this->columnTypes);
+}
+
+QueryResult::~QueryResult() = default;
+
+bool QueryResult::isSuccess() const {
+    return success;
+}
+
+std::string QueryResult::getErrorMessage() const {
+    return errMsg;
+}
+
+size_t QueryResult::getNumColumns() const {
+    return columnTypes.size();
+}
+
+std::vector<std::string> QueryResult::getColumnNames() const {
+    return columnNames;
+}
+
+std::vector<LogicalType> QueryResult::getColumnDataTypes() const {
+    return LogicalType::copy(columnTypes);
+}
+
+QuerySummary* QueryResult::getQuerySummary() const {
+    return querySummary.get();
+}
+
+QuerySummary* QueryResult::getQuerySummaryUnsafe() {
+    return querySummary.get();
+}
+
+void QueryResult::checkDatabaseClosedOrThrow() const {
+    if (!dbLifeCycleManager) {
+        return;
+    }
+    dbLifeCycleManager->checkDatabaseClosedOrThrow();
+}
+
+bool QueryResult::hasNextQueryResult() const {
+    checkDatabaseClosedOrThrow();
+    return queryResultIterator.hasNextQueryResult();
+}
+
+QueryResult* QueryResult::getNextQueryResult() {
+    checkDatabaseClosedOrThrow();
+    if (hasNextQueryResult()) {
+        ++queryResultIterator;
+        return queryResultIterator.getCurrentResult();
+    }
+    return nullptr;
+}
+
+std::unique_ptr<ArrowSchema> QueryResult::getArrowSchema() const {
+    checkDatabaseClosedOrThrow();
+    return ArrowConverter::toArrowSchema(getColumnDataTypes(), getColumnNames(),
+        false /* fallbackExtensionTypes */);
+}
+
+void QueryResult::validateQuerySucceed() const {
+    if (!success) {
+        throw Exception(errMsg);
+    }
+}
+
+void QueryResult::setColumnNames(std::vector<std::string> columnNames) {
+    this->columnNames = std::move(columnNames);
+}
+
+void QueryResult::setColumnTypes(std::vector<LogicalType> columnTypes) {
+    this->columnTypes = std::move(columnTypes);
+    tuple = std::make_shared<FlatTuple>(this->columnTypes);
+}
+
+void QueryResult::addNextResult(std::unique_ptr<QueryResult> next_) {
+    nextQueryResult = std::move(next_);
+}
+
+std::unique_ptr<QueryResult> QueryResult::moveNextResult() {
+    return std::move(nextQueryResult);
+}
+
+void QueryResult::setQuerySummary(std::unique_ptr<QuerySummary> summary) {
+    querySummary = std::move(summary);
+}
+
+void QueryResult::setDBLifeCycleManager(
+    std::shared_ptr<DatabaseLifeCycleManager> dbLifeCycleManager) {
+    this->dbLifeCycleManager = dbLifeCycleManager;
+    if (nextQueryResult) {
+        nextQueryResult->setDBLifeCycleManager(dbLifeCycleManager);
+    }
+}
+
+std::unique_ptr<QueryResult> QueryResult::getQueryResultWithError(const std::string& errorMessage) {
+    // TODO(Xiyang): consider introduce error query result class.
+    auto queryResult = std::make_unique<MaterializedQueryResult>();
+    queryResult->success = false;
+    queryResult->errMsg = errorMessage;
+    queryResult->nextQueryResult = nullptr;
+    queryResult->queryResultIterator = QueryResultIterator{queryResult.get()};
+    return queryResult;
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result/CMakeLists.txt
new file mode 100644
index 0000000000..71ac782bb3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result/CMakeLists.txt
@@ -0,0 +1,8 @@
+add_library(lbug_main_query_result
+        OBJECT
+        arrow_query_result.cpp
+        materialized_query_result.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_main_query_result>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result/arrow_query_result.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result/arrow_query_result.cpp
new file mode 100644
index 0000000000..9b7e224e38
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result/arrow_query_result.cpp
@@ -0,0 +1,81 @@
+#include "main/query_result/arrow_query_result.h"
+
+#include "common/arrow/arrow_row_batch.h"
+#include "common/exception/not_implemented.h"
+#include "common/exception/runtime.h"
+#include "processor/result/factorized_table.h"
+
+using namespace lbug::common;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace main {
+
+ArrowQueryResult::ArrowQueryResult(std::vector<ArrowArray> arrays, int64_t chunkSize)
+    : QueryResult{type_}, arrays{std::move(arrays)}, chunkSize_{chunkSize} {
+    for (auto& array : this->arrays) {
+        numTuples += array.length;
+    }
+}
+
+ArrowQueryResult::ArrowQueryResult(std::vector<std::string> columnNames,
+    std::vector<LogicalType> columnTypes, FactorizedTable& table, int64_t chunkSize)
+    : QueryResult{type_, std::move(columnNames), std::move(columnTypes)}, chunkSize_{chunkSize} {
+    auto iterator = FactorizedTableIterator(table);
+    while (iterator.hasNext()) {
+        arrays.push_back(getArray(iterator, chunkSize));
+    }
+}
+
+uint64_t ArrowQueryResult::getNumTuples() const {
+    return numTuples;
+}
+
+ArrowArray ArrowQueryResult::getArray(FactorizedTableIterator& iterator, int64_t chunkSize) {
+    auto rowBatch = ArrowRowBatch(columnTypes, chunkSize, false /* fallbackExtensionTypes */);
+    auto rowBatchSize = 0u;
+    while (rowBatchSize < chunkSize) {
+        if (!iterator.hasNext()) {
+            break;
+        }
+        (void)iterator.getNext(*tuple);
+        rowBatch.append(*tuple);
+        rowBatchSize++;
+        numTuples++;
+    }
+    return rowBatch.toArray(columnTypes);
+}
+
+bool ArrowQueryResult::hasNext() const {
+    throw NotImplementedException(
+        "ArrowQueryResult does not implement hasNext. Use MaterializedQueryResult instead.");
+}
+
+std::shared_ptr<FlatTuple> ArrowQueryResult::getNext() {
+    throw NotImplementedException(
+        "ArrowQueryResult does not implement getNext. Use MaterializedQueryResult instead.");
+}
+
+void ArrowQueryResult::resetIterator() {
+    cursor = 0u;
+}
+
+std::string ArrowQueryResult::toString() const {
+    throw NotImplementedException(
+        "ArrowQueryResult does not implement toString. Use MaterializedQueryResult instead.");
+}
+
+bool ArrowQueryResult::hasNextArrowChunk() {
+    return cursor < arrays.size();
+}
+
+std::unique_ptr<ArrowArray> ArrowQueryResult::getNextArrowChunk(int64_t chunkSize) {
+    if (chunkSize != chunkSize_) {
+        throw RuntimeException(
+            stringFormat("Chunk size does not match expected value {}.", chunkSize_));
+    }
+    return std::make_unique<ArrowArray>(arrays[cursor++]);
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result/materialized_query_result.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result/materialized_query_result.cpp
new file mode 100644
index 0000000000..9dc67235f8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_result/materialized_query_result.cpp
@@ -0,0 +1,110 @@
+#include "main/query_result/materialized_query_result.h"
+
+#include "common/arrow/arrow_row_batch.h"
+#include "common/exception/runtime.h"
+#include "processor/result/factorized_table.h"
+#include "processor/result/flat_tuple.h"
+
+using namespace lbug::common;
+using namespace lbug::processor;
+
+namespace lbug {
+namespace main {
+
+MaterializedQueryResult::MaterializedQueryResult() = default;
+
+MaterializedQueryResult::MaterializedQueryResult(std::shared_ptr<FactorizedTable> table)
+    : QueryResult{type_}, table{std::move(table)} {
+    iterator = std::make_unique<FactorizedTableIterator>(*this->table);
+}
+
+MaterializedQueryResult::MaterializedQueryResult(std::vector<std::string> columnNames,
+    std::vector<LogicalType> columnTypes, std::shared_ptr<FactorizedTable> table)
+    : QueryResult{type_, std::move(columnNames), std::move(columnTypes)}, table{std::move(table)} {
+    iterator = std::make_unique<FactorizedTableIterator>(*this->table);
+}
+
+MaterializedQueryResult::~MaterializedQueryResult() {
+    if (!dbLifeCycleManager) {
+        return;
+    }
+    if (!table) {
+        return;
+    }
+    table->setPreventDestruction(dbLifeCycleManager->isDatabaseClosed);
+}
+
+uint64_t MaterializedQueryResult::getNumTuples() const {
+    checkDatabaseClosedOrThrow();
+    validateQuerySucceed();
+    return table->getTotalNumFlatTuples();
+}
+
+bool MaterializedQueryResult::hasNext() const {
+    checkDatabaseClosedOrThrow();
+    validateQuerySucceed();
+    return iterator->hasNext();
+}
+
+std::shared_ptr<FlatTuple> MaterializedQueryResult::getNext() {
+    checkDatabaseClosedOrThrow();
+    validateQuerySucceed();
+    if (!hasNext()) {
+        throw RuntimeException(
+            "No more tuples in QueryResult, Please check hasNext() before calling getNext().");
+    }
+    iterator->getNext(*tuple);
+    return tuple;
+}
+
+void MaterializedQueryResult::resetIterator() {
+    checkDatabaseClosedOrThrow();
+    validateQuerySucceed();
+    iterator->resetState();
+}
+
+std::string MaterializedQueryResult::toString() const {
+    checkDatabaseClosedOrThrow();
+    if (!isSuccess()) {
+        return errMsg;
+    }
+    std::string result;
+    // print header
+    for (auto i = 0u; i < columnNames.size(); ++i) {
+        if (i != 0) {
+            result += "|";
+        }
+        result += columnNames[i];
+    }
+    result += "\n";
+    auto tuple_ = FlatTuple(this->columnTypes);
+    auto iterator_ = FactorizedTableIterator(*table);
+    while (iterator->hasNext()) {
+        iterator->getNext(tuple_);
+        result += tuple_.toString();
+    }
+    return result;
+}
+
+bool MaterializedQueryResult::hasNextArrowChunk() {
+    return hasNext();
+}
+
+std::unique_ptr<ArrowArray> MaterializedQueryResult::getNextArrowChunk(int64_t chunkSize) {
+    checkDatabaseClosedOrThrow();
+    auto rowBatch =
+        std::make_unique<ArrowRowBatch>(columnTypes, chunkSize, false /* fallbackExtensionTypes */);
+    auto rowBatchSize = 0u;
+    while (rowBatchSize < chunkSize) {
+        if (!iterator->hasNext()) {
+            break;
+        }
+        (void)iterator->getNext(*tuple);
+        rowBatch->append(*tuple);
+        rowBatchSize++;
+    }
+    return std::make_unique<ArrowArray>(rowBatch->toArray(columnTypes));
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_summary.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_summary.cpp
new file mode 100644
index 0000000000..2f079e7747
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/query_summary.cpp
@@ -0,0 +1,39 @@
+#include "main/query_summary.h"
+
+#include "common/enums/statement_type.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace main {
+
+double QuerySummary::getCompilingTime() const {
+    return preparedSummary.compilingTime;
+}
+
+double QuerySummary::getExecutionTime() const {
+    return executionTime;
+}
+
+void QuerySummary::setExecutionTime(double time) {
+    executionTime = time;
+}
+
+void QuerySummary::incrementCompilingTime(double increment) {
+    preparedSummary.compilingTime += increment;
+}
+
+void QuerySummary::incrementExecutionTime(double increment) {
+    executionTime += increment;
+}
+
+bool QuerySummary::isExplain() const {
+    return preparedSummary.statementType == StatementType::EXPLAIN;
+}
+
+StatementType QuerySummary::getStatementType() const {
+    return preparedSummary.statementType;
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/settings.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/settings.cpp
new file mode 100644
index 0000000000..c7e6950d91
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/settings.cpp
@@ -0,0 +1,227 @@
+#include "main/settings.h"
+
+#include "common/exception/runtime.h"
+#include "common/task_system/progress_bar.h"
+#include "main/client_context.h"
+#include "main/db_config.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/storage_utils.h"
+
+namespace lbug {
+namespace main {
+
+void ThreadsSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->numThreads = parameter.getValue<uint64_t>();
+}
+
+common::Value ThreadsSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getClientConfig()->numThreads);
+}
+
+void WarningLimitSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->warningLimit = parameter.getValue<uint64_t>();
+}
+
+common::Value WarningLimitSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getClientConfig()->warningLimit);
+}
+
+void TimeoutSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->timeoutInMS = parameter.getValue<uint64_t>();
+}
+
+common::Value TimeoutSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getClientConfig()->timeoutInMS);
+}
+
+void ProgressBarSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->enableProgressBar = parameter.getValue<bool>();
+    common::ProgressBar::Get(*context)->toggleProgressBarPrinting(parameter.getValue<bool>());
+}
+
+common::Value ProgressBarSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getClientConfig()->enableProgressBar);
+}
+
+void VarLengthExtendMaxDepthSetting::setContext(ClientContext* context,
+    const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->varLengthMaxDepth = parameter.getValue<int64_t>();
+}
+
+common::Value VarLengthExtendMaxDepthSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getClientConfig()->varLengthMaxDepth);
+}
+
+void SparseFrontierThresholdSetting::setContext(ClientContext* context,
+    const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->sparseFrontierThreshold = parameter.getValue<int64_t>();
+}
+
+common::Value SparseFrontierThresholdSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getClientConfig()->sparseFrontierThreshold);
+}
+
+void EnableSemiMaskSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->enableSemiMask = parameter.getValue<bool>();
+}
+
+common::Value EnableSemiMaskSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getClientConfig()->enableSemiMask);
+}
+
+void DisableMapKeyCheck::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->disableMapKeyCheck = parameter.getValue<bool>();
+}
+
+common::Value DisableMapKeyCheck::getSetting(const ClientContext* context) {
+    return common::Value(context->getClientConfig()->disableMapKeyCheck);
+}
+
+void EnableZoneMapSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->enableZoneMap = parameter.getValue<bool>();
+}
+
+common::Value EnableZoneMapSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getClientConfig()->enableZoneMap);
+}
+
+void HomeDirectorySetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->homeDirectory = parameter.getValue<std::string>();
+}
+
+common::Value HomeDirectorySetting::getSetting(const ClientContext* context) {
+    return common::Value::createValue(context->getClientConfig()->homeDirectory);
+}
+
+void FileSearchPathSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->fileSearchPath = parameter.getValue<std::string>();
+}
+
+common::Value FileSearchPathSetting::getSetting(const ClientContext* context) {
+    return common::Value::createValue(context->getClientConfig()->fileSearchPath);
+}
+
+void RecursivePatternSemanticSetting::setContext(ClientContext* context,
+    const common::Value& parameter) {
+    parameter.validateType(inputType);
+    const auto input = parameter.getValue<std::string>();
+    context->getClientConfigUnsafe()->recursivePatternSemantic =
+        common::PathSemanticUtils::fromString(input);
+}
+
+common::Value RecursivePatternSemanticSetting::getSetting(const ClientContext* context) {
+    const auto result =
+        common::PathSemanticUtils::toString(context->getClientConfig()->recursivePatternSemantic);
+    return common::Value::createValue(result);
+}
+
+void RecursivePatternFactorSetting::setContext(ClientContext* context,
+    const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->recursivePatternCardinalityScaleFactor =
+        parameter.getValue<std::int64_t>();
+}
+
+common::Value RecursivePatternFactorSetting::getSetting(const ClientContext* context) {
+    return common::Value::createValue(
+        context->getClientConfig()->recursivePatternCardinalityScaleFactor);
+}
+
+void EnableMVCCSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    KU_ASSERT(parameter.getDataType().getLogicalTypeID() == common::LogicalTypeID::BOOL);
+    // TODO: This is a temporary solution to make tests of multiple write transactions easier.
+    context->getDBConfigUnsafe()->enableMultiWrites = parameter.getValue<bool>();
+}
+
+common::Value EnableMVCCSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getDBConfig()->enableMultiWrites);
+}
+
+void CheckpointThresholdSetting::setContext(ClientContext* context,
+    const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getDBConfigUnsafe()->checkpointThreshold = parameter.getValue<int64_t>();
+}
+
+common::Value CheckpointThresholdSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getDBConfig()->checkpointThreshold);
+}
+
+void AutoCheckpointSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getDBConfigUnsafe()->autoCheckpoint = parameter.getValue<bool>();
+}
+
+common::Value AutoCheckpointSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getDBConfig()->autoCheckpoint);
+}
+
+void ForceCheckpointClosingDBSetting::setContext(ClientContext* context,
+    const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getDBConfigUnsafe()->forceCheckpointOnClose = parameter.getValue<bool>();
+}
+
+common::Value ForceCheckpointClosingDBSetting::getSetting(const ClientContext* context) {
+    return common::Value(context->getDBConfig()->forceCheckpointOnClose);
+}
+
+void EnableOptimizerSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->enablePlanOptimizer = parameter.getValue<bool>();
+}
+
+common::Value EnableOptimizerSetting::getSetting(const ClientContext* context) {
+    return common::Value::createValue(context->getClientConfig()->enablePlanOptimizer);
+}
+
+void EnableInternalCatalogSetting::setContext(ClientContext* context,
+    const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getClientConfigUnsafe()->enableInternalCatalog = parameter.getValue<bool>();
+}
+
+common::Value EnableInternalCatalogSetting::getSetting(const ClientContext* context) {
+    return common::Value::createValue(context->getClientConfig()->enableInternalCatalog);
+}
+
+void SpillToDiskSetting::setContext(ClientContext* context, const common::Value& parameter) {
+    parameter.validateType(inputType);
+    context->getDBConfigUnsafe()->enableSpillingToDisk = parameter.getValue<bool>();
+    const auto& dbConfig = *context->getDBConfig();
+    std::string spillPath;
+    if (dbConfig.enableSpillingToDisk) {
+        if (context->isInMemory()) {
+            throw common::RuntimeException(
+                "Cannot set spill_to_disk to true for an in-memory database!");
+        }
+        if (!context->canExecuteWriteQuery()) {
+            throw common::RuntimeException(
+                "Cannot set spill_to_disk to true for a read only database!");
+        }
+        spillPath = storage::StorageUtils::getTmpFilePath(context->getDatabasePath());
+    } else {
+        // Set path to empty will disable spiller.
+        spillPath = "";
+    }
+    storage::MemoryManager::Get(*context)->getBufferManager()->resetSpiller(spillPath);
+}
+
+common::Value SpillToDiskSetting::getSetting(const ClientContext* context) {
+    return common::Value::createValue(context->getDBConfig()->enableSpillingToDisk);
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/storage_driver.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/storage_driver.cpp
new file mode 100644
index 0000000000..167fe46163
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/storage_driver.cpp
@@ -0,0 +1,180 @@
+#include "main/storage_driver.h"
+
+#include <thread>
+
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "main/client_context.h"
+#include "storage/storage_manager.h"
+#include "storage/table/node_table.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+using namespace lbug::storage;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace main {
+
+StorageDriver::StorageDriver(Database* database) {
+    clientContext = std::make_unique<ClientContext>(database);
+}
+
+StorageDriver::~StorageDriver() = default;
+
+static TableCatalogEntry* getEntry(const ClientContext& context, const std::string& tableName) {
+    return Catalog::Get(context)->getTableCatalogEntry(Transaction::Get(context), tableName);
+}
+
+static Table* getTable(const ClientContext& context, const std::string& tableName) {
+    return StorageManager::Get(context)->getTable(getEntry(context, tableName)->getTableID());
+}
+
+static bool validateNumericalType(const LogicalType& type) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::INT8:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::FLOAT:
+        return true;
+    default:
+        return false;
+    }
+}
+
+static std::string getUnsupportedTypeErrMsg(const LogicalType& type) {
+    return stringFormat("Unsupported data type {}.", type.toString());
+}
+
+static uint32_t getElementSize(const LogicalType& type) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL:
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::INT8:
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::DOUBLE:
+    case LogicalTypeID::FLOAT:
+        return PhysicalTypeUtils::getFixedTypeSize(type.getPhysicalType());
+    case LogicalTypeID::ARRAY: {
+        auto& childType = ArrayType::getChildType(type);
+        if (!validateNumericalType(childType)) {
+            throw RuntimeException(getUnsupportedTypeErrMsg(type));
+        }
+        auto numElements = ArrayType::getNumElements(type);
+        return numElements * PhysicalTypeUtils::getFixedTypeSize(childType.getPhysicalType());
+    }
+    default:
+        throw RuntimeException(getUnsupportedTypeErrMsg(type));
+    }
+}
+
+void StorageDriver::scan(const std::string& nodeName, const std::string& propertyName,
+    common::offset_t* offsets, size_t numOffsets, uint8_t* result, size_t numThreads) {
+    clientContext->query("BEGIN TRANSACTION READ ONLY;");
+    auto entry = getEntry(*clientContext, nodeName);
+    auto columnID = entry->getColumnID(propertyName);
+    auto table = getTable(*clientContext, nodeName);
+    auto& dataType = table->ptrCast<NodeTable>()->getColumn(columnID).getDataType();
+    auto elementSize = getElementSize(dataType);
+    auto numOffsetsPerThread = numOffsets / numThreads + 1;
+    auto remainingNumOffsets = numOffsets;
+    auto current_buffer = result;
+    std::vector<std::thread> threads;
+    while (remainingNumOffsets > 0) {
+        auto numOffsetsToScan = std::min(numOffsetsPerThread, remainingNumOffsets);
+        threads.emplace_back(&StorageDriver::scanColumn, this, table, columnID, offsets,
+            numOffsetsToScan, current_buffer);
+        offsets += numOffsetsToScan;
+        current_buffer += numOffsetsToScan * elementSize;
+        remainingNumOffsets -= numOffsetsToScan;
+    }
+    for (auto& thread : threads) {
+        thread.join();
+    }
+    clientContext->query("COMMIT");
+}
+
+uint64_t StorageDriver::getNumNodes(const std::string& nodeName) const {
+    clientContext->query("BEGIN TRANSACTION READ ONLY;");
+    auto transaction = Transaction::Get(*clientContext);
+    auto result = getTable(*clientContext, nodeName)->getNumTotalRows(transaction);
+    clientContext->query("COMMIT");
+    return result;
+}
+
+uint64_t StorageDriver::getNumRels(const std::string& relName) const {
+    clientContext->query("BEGIN TRANSACTION READ ONLY;");
+    auto transaction = Transaction::Get(*clientContext);
+    auto result = getTable(*clientContext, relName)->getNumTotalRows(transaction);
+    clientContext->query("COMMIT");
+    return result;
+}
+
+void StorageDriver::scanColumn(Table* table, column_id_t columnID, const offset_t* offsets,
+    size_t size, uint8_t* result) const {
+    // Create scan state.
+    auto nodeTable = table->ptrCast<NodeTable>();
+    auto column = &nodeTable->getColumn(columnID);
+    // Create value vectors
+    auto idVector = std::make_unique<ValueVector>(LogicalType::INTERNAL_ID());
+    auto columnVector = std::make_unique<ValueVector>(column->getDataType().copy(),
+        MemoryManager::Get(*clientContext));
+    auto vectorState = DataChunkState::getSingleValueDataChunkState();
+    idVector->state = vectorState;
+    columnVector->state = vectorState;
+    auto scanState = std::make_unique<NodeTableScanState>(idVector.get(),
+        std::vector{columnVector.get()}, vectorState);
+    auto transaction = Transaction::Get(*clientContext);
+    switch (auto physicalType = column->getDataType().getPhysicalType()) {
+    case PhysicalTypeID::BOOL:
+    case PhysicalTypeID::INT128:
+    case PhysicalTypeID::INT64:
+    case PhysicalTypeID::INT32:
+    case PhysicalTypeID::INT16:
+    case PhysicalTypeID::INT8:
+    case PhysicalTypeID::UINT64:
+    case PhysicalTypeID::UINT32:
+    case PhysicalTypeID::UINT16:
+    case PhysicalTypeID::UINT8:
+    case PhysicalTypeID::DOUBLE:
+    case PhysicalTypeID::FLOAT: {
+        for (auto i = 0u; i < size; ++i) {
+            idVector->setValue(0, nodeID_t{offsets[i], table->getTableID()});
+            [[maybe_unused]] auto res = nodeTable->lookup(transaction, *scanState);
+            memcpy(result, columnVector->getData(),
+                PhysicalTypeUtils::getFixedTypeSize(physicalType));
+        }
+    } break;
+    case PhysicalTypeID::ARRAY: {
+        auto& childType = ArrayType::getChildType(column->getDataType());
+        auto elementSize = PhysicalTypeUtils::getFixedTypeSize(childType.getPhysicalType());
+        auto numElements = ArrayType::getNumElements(column->getDataType());
+        auto arraySize = elementSize * numElements;
+        for (auto i = 0u; i < size; ++i) {
+            idVector->setValue(0, nodeID_t{offsets[i], table->getTableID()});
+            [[maybe_unused]] auto res = nodeTable->lookup(transaction, *scanState);
+            auto dataVector = ListVector::getDataVector(columnVector.get());
+            memcpy(result, dataVector->getData() + i * arraySize, arraySize);
+        }
+    } break;
+    default:
+        throw RuntimeException(stringFormat("Not supported data type in StorageDriver::scanColumn",
+            PhysicalTypeUtils::toString(physicalType)));
+    }
+}
+
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/main/version.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/main/version.cpp
new file mode 100644
index 0000000000..253bd7452f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/main/version.cpp
@@ -0,0 +1,15 @@
+#include "main/version.h"
+
+#include "storage/storage_version_info.h"
+
+namespace lbug {
+namespace main {
+const char* Version::getVersion() {
+    return LBUG_CMAKE_VERSION;
+}
+
+uint64_t Version::getStorageVersion() {
+    return storage::StorageVersionInfo::getStorageVersion();
+}
+} // namespace main
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/CMakeLists.txt
new file mode 100644
index 0000000000..7ba4d4ed2b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/CMakeLists.txt
@@ -0,0 +1,21 @@
+add_library(lbug_optimizer
+        OBJECT
+        acc_hash_join_optimizer.cpp
+        agg_key_dependency_optimizer.cpp
+        cardinality_updater.cpp
+        correlated_subquery_unnest_solver.cpp
+        factorization_rewriter.cpp
+        filter_push_down_optimizer.cpp
+        logical_operator_collector.cpp
+        logical_operator_visitor.cpp
+        optimizer.cpp
+        projection_push_down_optimizer.cpp
+        schema_populator.cpp
+        remove_factorization_rewriter.cpp
+        remove_unnecessary_join_optimizer.cpp
+        top_k_optimizer.cpp
+        limit_push_down_optimizer.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_optimizer>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/acc_hash_join_optimizer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/acc_hash_join_optimizer.cpp
new file mode 100644
index 0000000000..d15f1de604
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/acc_hash_join_optimizer.cpp
@@ -0,0 +1,412 @@
+#include "optimizer/acc_hash_join_optimizer.h"
+
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "optimizer/logical_operator_collector.h"
+#include "planner/operator/extend/logical_recursive_extend.h"
+#include "planner/operator/logical_accumulate.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/logical_intersect.h"
+#include "planner/operator/logical_path_property_probe.h"
+#include "planner/operator/scan/logical_scan_node_table.h"
+#include "planner/operator/sip/logical_semi_masker.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+using namespace lbug::planner;
+using namespace lbug::function;
+
+namespace lbug {
+namespace optimizer {
+
+static std::shared_ptr<LogicalOperator> appendAccumulate(std::shared_ptr<LogicalOperator> child) {
+    auto accumulate = std::make_shared<LogicalAccumulate>(AccumulateType::REGULAR,
+        expression_vector{}, nullptr /* mark */, std::move(child));
+    accumulate->computeFlatSchema();
+    return accumulate;
+}
+
+static table_id_vector_t getTableIDs(const std::vector<catalog::TableCatalogEntry*>& entries) {
+    table_id_vector_t result;
+    for (auto& entry : entries) {
+        result.push_back(entry->getTableID());
+    }
+    return result;
+}
+
+static std::vector<table_id_t> getTableIDs(const LogicalOperator* op,
+    SemiMaskTargetType targetType) {
+    switch (op->getOperatorType()) {
+    case LogicalOperatorType::SCAN_NODE_TABLE: {
+        return op->constCast<LogicalScanNodeTable>().getTableIDs();
+    }
+    case LogicalOperatorType::RECURSIVE_EXTEND: {
+        auto& bindData = op->constCast<LogicalRecursiveExtend>().getBindData();
+        switch (targetType) {
+        case SemiMaskTargetType::RECURSIVE_EXTEND_INPUT_NODE: {
+            auto& node = bindData.nodeInput->constCast<NodeExpression>();
+            return getTableIDs(node.getEntries());
+        }
+        case SemiMaskTargetType::RECURSIVE_EXTEND_OUTPUT_NODE: {
+            auto& node = bindData.nodeOutput->constCast<NodeExpression>();
+            return getTableIDs(node.getEntries());
+        }
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static bool sameTableIDs(const std::unordered_set<table_id_t>& set,
+    const std::vector<table_id_t>& ids) {
+    if (set.size() != ids.size()) {
+        return false;
+    }
+    for (auto id : ids) {
+        if (!set.contains(id)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+static bool haveSameTableIDs(const std::vector<LogicalOperator*>& ops,
+    SemiMaskTargetType targetType) {
+    std::unordered_set<table_id_t> tableIDSet;
+    for (auto id : getTableIDs(ops[0], targetType)) {
+        tableIDSet.insert(id);
+    }
+    for (auto i = 0u; i < ops.size(); ++i) {
+        if (!sameTableIDs(tableIDSet, getTableIDs(ops[i], targetType))) {
+            return false;
+        }
+    }
+    return true;
+}
+
+static bool haveSameType(const std::vector<LogicalOperator*>& ops) {
+    for (auto i = 0u; i < ops.size(); ++i) {
+        if (ops[i]->getOperatorType() != ops[0]->getOperatorType()) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool sanityCheckCandidates(const std::vector<LogicalOperator*>& ops,
+    SemiMaskTargetType targetType) {
+    KU_ASSERT(!ops.empty());
+    if (!haveSameType(ops)) {
+        return false;
+    }
+    if (!haveSameTableIDs(ops, targetType)) {
+        return false;
+    }
+    return true;
+}
+
+static std::shared_ptr<LogicalSemiMasker> appendSemiMasker(SemiMaskKeyType keyType,
+    SemiMaskTargetType targetType, std::shared_ptr<Expression> key,
+    std::vector<LogicalOperator*> candidates, std::shared_ptr<LogicalOperator> child) {
+    auto tableIDs = getTableIDs(candidates[0], targetType);
+    auto semiMasker =
+        std::make_shared<LogicalSemiMasker>(keyType, targetType, key, tableIDs, child);
+    for (auto candidate : candidates) {
+        semiMasker->addTarget(candidate);
+    }
+    semiMasker->computeFlatSchema();
+    return semiMasker;
+}
+
+void HashJoinSIPOptimizer::rewrite(const LogicalPlan* plan) {
+    visitOperator(plan->getLastOperator().get());
+}
+
+void HashJoinSIPOptimizer::visitOperator(LogicalOperator* op) {
+    // bottom up traversal
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        visitOperator(op->getChild(i).get());
+    }
+    visitOperatorSwitch(op);
+}
+
+static bool subPlanContainsFilter(LogicalOperator* root) {
+    auto filterCollector = LogicalFilterCollector();
+    filterCollector.collect(root);
+    auto indexScanNodeCollector = LogicalIndexScanNodeCollector();
+    indexScanNodeCollector.collect(root);
+    if (!filterCollector.hasOperators() && !indexScanNodeCollector.hasOperators()) {
+        return false;
+    }
+    return true;
+}
+
+// Probe side is qualified if it is selective.
+static bool isProbeSideQualified(LogicalOperator* probeRoot) {
+    if (probeRoot->getOperatorType() == LogicalOperatorType::ACCUMULATE) {
+        // No Acc hash join if probe side has already been accumulated. This can be solved.
+        return false;
+    }
+    // Probe side is not selective. So we don't apply acc hash join.
+    return subPlanContainsFilter(probeRoot);
+}
+
+// Find all ScanNodeIDs under root which scans parameter nodeID. Note that there might be
+// multiple ScanNodeIDs matches because both node and rel table scans will trigger scanNodeIDs.
+static std::vector<LogicalOperator*> getScanNodeCandidates(const Expression& nodeID,
+    LogicalOperator* root) {
+    std::vector<LogicalOperator*> result;
+    auto collector = LogicalScanNodeTableCollector();
+    collector.collect(root);
+    for (auto& op : collector.getOperators()) {
+        auto& scan = op->constCast<LogicalScanNodeTable>();
+        if (scan.getScanType() != LogicalScanNodeTableType::SCAN) {
+            // Do not apply semi mask to index scan.
+            continue;
+        }
+        if (nodeID.getUniqueName() == scan.getNodeID()->getUniqueName()) {
+            result.push_back(op);
+        }
+    }
+    return result;
+}
+
+static std::vector<LogicalOperator*> getRecursiveExtendInputNodeCandidates(const Expression& nodeID,
+    LogicalOperator* root) {
+    std::vector<LogicalOperator*> result;
+    auto collector = LogicalRecursiveExtendCollector();
+    collector.collect(root);
+    for (auto& op : collector.getOperators()) {
+        auto& recursiveExtend = op->constCast<LogicalRecursiveExtend>();
+        auto& bindData = recursiveExtend.getBindData();
+        if (nodeID == *bindData.nodeInput->constCast<NodeExpression>().getInternalID()) {
+            result.push_back(op);
+        }
+    }
+    return result;
+}
+
+static std::vector<LogicalOperator*> getRecursiveExtendOutputNodeCandidates(
+    const Expression& nodeID, LogicalOperator* root) {
+    std::vector<LogicalOperator*> result;
+    auto collector = LogicalRecursiveExtendCollector();
+    collector.collect(root);
+    for (auto op : collector.getOperators()) {
+        auto& recursiveExtend = op->constCast<LogicalRecursiveExtend>();
+        auto& bindData = recursiveExtend.getBindData();
+        if (nodeID == *bindData.nodeOutput->constCast<NodeExpression>().getInternalID()) {
+            result.push_back(op);
+        }
+    }
+    return result;
+}
+
+static std::shared_ptr<LogicalOperator> tryApplySemiMask(std::shared_ptr<Expression> nodeID,
+    std::shared_ptr<LogicalOperator> fromRoot, LogicalOperator* toRoot) {
+    // TODO(Xiyang): Check if a semi mask can/need to be applied to ScanNodeTable, RecursiveJoin &
+    // GDS at the same time
+    auto recursiveExtendInputNodeCandidates =
+        getRecursiveExtendInputNodeCandidates(*nodeID, toRoot);
+    if (!recursiveExtendInputNodeCandidates.empty()) {
+        for (auto& op : recursiveExtendInputNodeCandidates) {
+            op->cast<LogicalRecursiveExtend>().setInputNodeMask();
+        }
+        auto targetType = SemiMaskTargetType::RECURSIVE_EXTEND_INPUT_NODE;
+        KU_ASSERT(sanityCheckCandidates(recursiveExtendInputNodeCandidates, targetType));
+        return appendSemiMasker(SemiMaskKeyType::NODE, targetType, std::move(nodeID),
+            recursiveExtendInputNodeCandidates, std::move(fromRoot));
+    }
+    auto recursiveExtendNodeCandidates = getRecursiveExtendOutputNodeCandidates(*nodeID, toRoot);
+    if (!recursiveExtendNodeCandidates.empty()) {
+        for (auto& op : recursiveExtendNodeCandidates) {
+            op->cast<LogicalRecursiveExtend>().setOutputNodeMask();
+        }
+        auto targetType = SemiMaskTargetType::RECURSIVE_EXTEND_OUTPUT_NODE;
+        KU_ASSERT(sanityCheckCandidates(recursiveExtendNodeCandidates, targetType));
+        return appendSemiMasker(SemiMaskKeyType::NODE, targetType, std::move(nodeID),
+            recursiveExtendNodeCandidates, std::move(fromRoot));
+    }
+    auto scanNodeCandidates = getScanNodeCandidates(*nodeID, toRoot);
+    if (!scanNodeCandidates.empty()) {
+        return appendSemiMasker(SemiMaskKeyType::NODE, SemiMaskTargetType::SCAN_NODE,
+            std::move(nodeID), scanNodeCandidates, std::move(fromRoot));
+    }
+    return nullptr;
+}
+
+static bool tryProbeToBuildHJSIP(LogicalOperator* op) {
+    auto& hashJoin = op->cast<LogicalHashJoin>();
+    if (!isProbeSideQualified(op->getChild(0).get())) {
+        return false;
+    }
+    auto probeRoot = hashJoin.getChild(0);
+    auto buildRoot = hashJoin.getChild(1);
+    auto hasSemiMaskApplied = false;
+    for (auto& nodeID : hashJoin.getJoinNodeIDs()) {
+        auto newProbeRoot = tryApplySemiMask(nodeID, probeRoot, buildRoot.get());
+        if (newProbeRoot != nullptr) {
+            probeRoot = newProbeRoot;
+            hasSemiMaskApplied = true;
+        }
+    }
+    if (!hasSemiMaskApplied) {
+        return false;
+    }
+    auto& sipInfo = hashJoin.getSIPInfoUnsafe();
+    sipInfo.position = SemiMaskPosition::ON_PROBE;
+    sipInfo.dependency = SIPDependency::PROBE_DEPENDS_ON_BUILD;
+    sipInfo.direction = SIPDirection::PROBE_TO_BUILD;
+    hashJoin.setChild(0, appendAccumulate(probeRoot));
+    return true;
+}
+
+static bool isBuildSideQualified(LogicalOperator* buildRoot) {
+    if (subPlanContainsFilter(buildRoot)) {
+        return true;
+    }
+    // TODO(Xiyang): this may not be the best solution. Most of the time we will pass a semi mask
+    // to GDS (recursive join) operator and make it generate small result. Though there are also
+    // exceptions. In such case we will pay a bit overhead.
+    auto op = buildRoot;
+    while (op->getNumChildren() == 1) {
+        op = op->getChild(0).get();
+    }
+    return op->getOperatorType() == LogicalOperatorType::RECURSIVE_EXTEND;
+}
+
+static bool tryBuildToProbeHJSIP(LogicalOperator* op) {
+    auto& hashJoin = op->cast<LogicalHashJoin>();
+    if (hashJoin.getJoinType() != JoinType::INNER) {
+        return false;
+    }
+    if (hashJoin.getSIPInfo().direction != SIPDirection::FORCE_BUILD_TO_PROBE &&
+        !isBuildSideQualified(op->getChild(1).get())) {
+        return false;
+    }
+    auto probeRoot = hashJoin.getChild(0);
+    auto buildRoot = hashJoin.getChild(1);
+    auto hasSemiMaskApplied = false;
+    for (auto& nodeID : hashJoin.getJoinNodeIDs()) {
+        auto newBuildRoot = tryApplySemiMask(nodeID, buildRoot, probeRoot.get());
+        if (newBuildRoot != nullptr) {
+            buildRoot = newBuildRoot;
+            hasSemiMaskApplied = true;
+        }
+    }
+    if (!hasSemiMaskApplied) {
+        return false;
+    }
+    auto& sipInfo = hashJoin.getSIPInfoUnsafe();
+    sipInfo.position = SemiMaskPosition::ON_BUILD;
+    sipInfo.dependency = SIPDependency::BUILD_DEPENDS_ON_PROBE;
+    sipInfo.direction = SIPDirection::BUILD_TO_PROBE;
+    hashJoin.setChild(1, buildRoot);
+    return true;
+}
+
+void HashJoinSIPOptimizer::visitHashJoin(LogicalOperator* op) {
+    auto& hashJoin = op->cast<LogicalHashJoin>();
+    if (LogicalOperatorUtils::isAccHashJoin(hashJoin)) {
+        return;
+    }
+    if (hashJoin.getSIPInfo().position == SemiMaskPosition::PROHIBIT) {
+        return;
+    }
+    if (tryBuildToProbeHJSIP(op)) { // Try build to probe SIP first.
+        return;
+    }
+    if (hashJoin.getSIPInfo().position == SemiMaskPosition::PROHIBIT_PROBE_TO_BUILD) {
+        return;
+    }
+    tryProbeToBuildHJSIP(op);
+}
+
+// TODO(Xiyang): we don't apply SIP from build to probe.
+void HashJoinSIPOptimizer::visitIntersect(LogicalOperator* op) {
+    auto& intersect = op->cast<LogicalIntersect>();
+    switch (intersect.getSIPInfo().position) {
+    case SemiMaskPosition::PROHIBIT_PROBE_TO_BUILD:
+    case SemiMaskPosition::PROHIBIT:
+        return;
+    default:
+        break;
+    }
+    if (!isProbeSideQualified(op->getChild(0).get())) {
+        return;
+    }
+    auto probeRoot = intersect.getChild(0);
+    auto hasSemiMaskApplied = false;
+    for (auto& nodeID : intersect.getKeyNodeIDs()) {
+        std::vector<LogicalOperator*> ops;
+        for (auto i = 1u; i < intersect.getNumChildren(); ++i) {
+            auto buildRoot = intersect.getChild(i);
+            for (auto& op_ : getScanNodeCandidates(*nodeID, buildRoot.get())) {
+                ops.push_back(op_);
+            }
+        }
+        if (!ops.empty()) {
+            probeRoot = appendSemiMasker(SemiMaskKeyType::NODE, SemiMaskTargetType::SCAN_NODE,
+                nodeID, ops, probeRoot);
+            hasSemiMaskApplied = true;
+        }
+    }
+    if (!hasSemiMaskApplied) {
+        return;
+    }
+    auto& sipInfo = intersect.getSIPInfoUnsafe();
+    sipInfo.position = SemiMaskPosition::ON_PROBE;
+    sipInfo.dependency = SIPDependency::PROBE_DEPENDS_ON_BUILD;
+    sipInfo.direction = SIPDirection::PROBE_TO_BUILD;
+    intersect.setChild(0, appendAccumulate(probeRoot));
+}
+
+void HashJoinSIPOptimizer::visitPathPropertyProbe(LogicalOperator* op) {
+    auto& pathPropertyProbe = op->cast<LogicalPathPropertyProbe>();
+    switch (pathPropertyProbe.getSIPInfo().position) {
+    case SemiMaskPosition::PROHIBIT_PROBE_TO_BUILD:
+    case SemiMaskPosition::PROHIBIT:
+        return;
+    default:
+        break;
+    }
+    if (pathPropertyProbe.getJoinType() == RecursiveJoinType::TRACK_NONE) {
+        return;
+    }
+    auto recursiveRel = pathPropertyProbe.getRel();
+    auto nodeID = recursiveRel->getRecursiveInfo()->node->getInternalID();
+    std::vector<LogicalOperator*> opsToApplySemiMask;
+    if (pathPropertyProbe.getNodeChild() != nullptr) {
+        auto child = pathPropertyProbe.getNodeChild().get();
+        for (auto op_ : getScanNodeCandidates(*nodeID, child)) {
+            opsToApplySemiMask.push_back(op_);
+        }
+    }
+    if (pathPropertyProbe.getRelChild() != nullptr) {
+        auto child = pathPropertyProbe.getRelChild().get();
+        for (auto op_ : getScanNodeCandidates(*nodeID, child)) {
+            opsToApplySemiMask.push_back(op_);
+        }
+    }
+    if (opsToApplySemiMask.empty()) {
+        return;
+    }
+    KU_ASSERT(
+        pathPropertyProbe.getChild(0)->getOperatorType() == LogicalOperatorType::RECURSIVE_EXTEND);
+    auto semiMasker = appendSemiMasker(SemiMaskKeyType::NODE_ID_LIST, SemiMaskTargetType::SCAN_NODE,
+        recursiveRel->getRecursiveInfo()->bindData->pathNodeIDsExpr, opsToApplySemiMask,
+        pathPropertyProbe.getChild(0));
+    auto srcNodeID = recursiveRel->getSrcNode()->getInternalID();
+    auto dstNodeID = recursiveRel->getDstNode()->getInternalID();
+    semiMasker->setExtraKeyInfo(std::make_unique<ExtraNodeIDListKeyInfo>(srcNodeID, dstNodeID));
+    pathPropertyProbe.setChild(0, semiMasker);
+
+    auto& sipInfo = pathPropertyProbe.getSIPInfoUnsafe();
+    sipInfo.position = SemiMaskPosition::ON_PROBE;
+    sipInfo.dependency = SIPDependency::PROBE_DEPENDS_ON_BUILD;
+    sipInfo.direction = SIPDirection::PROBE_TO_BUILD;
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/agg_key_dependency_optimizer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/agg_key_dependency_optimizer.cpp
new file mode 100644
index 0000000000..91334eaba3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/agg_key_dependency_optimizer.cpp
@@ -0,0 +1,91 @@
+#include "optimizer/agg_key_dependency_optimizer.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/expression/property_expression.h"
+#include "planner/operator/logical_aggregate.h"
+#include "planner/operator/logical_distinct.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace optimizer {
+
+void AggKeyDependencyOptimizer::rewrite(planner::LogicalPlan* plan) {
+    visitOperator(plan->getLastOperator().get());
+}
+
+void AggKeyDependencyOptimizer::visitOperator(planner::LogicalOperator* op) {
+    // bottom up traversal
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        visitOperator(op->getChild(i).get());
+    }
+    visitOperatorSwitch(op);
+}
+
+void AggKeyDependencyOptimizer::visitAggregate(planner::LogicalOperator* op) {
+    auto agg = (LogicalAggregate*)op;
+    auto [keys, dependentKeys] = resolveKeysAndDependentKeys(agg->getKeys());
+    agg->setKeys(keys);
+    agg->setDependentKeys(dependentKeys);
+}
+
+void AggKeyDependencyOptimizer::visitDistinct(planner::LogicalOperator* op) {
+    auto distinct = (LogicalDistinct*)op;
+    auto [keys, dependentKeys] = resolveKeysAndDependentKeys(distinct->getKeys());
+    distinct->setKeys(keys);
+    distinct->setPayloads(dependentKeys);
+}
+
+std::pair<binder::expression_vector, binder::expression_vector>
+AggKeyDependencyOptimizer::resolveKeysAndDependentKeys(const expression_vector& inputKeys) {
+    // Consider example RETURN a.ID, a.age, COUNT(*).
+    // We first collect a.ID into primaryKeys. Then collect "a" into primaryVarNames.
+    // Finally, we loop through all group by keys to put non-primary key properties under name "a"
+    // into dependentKeyExpressions.
+
+    // Collect primary variables from keys.
+    std::unordered_set<std::string> primaryVarNames;
+    for (auto& key : inputKeys) {
+        if (key->expressionType == ExpressionType::PROPERTY) {
+            auto property = (PropertyExpression*)key.get();
+            if (property->isPrimaryKey() || property->isInternalID()) {
+                primaryVarNames.insert(property->getVariableName());
+            }
+        }
+    }
+    // Resolve key dependency.
+    binder::expression_vector keys;
+    binder::expression_vector dependentKeys;
+    for (auto& key : inputKeys) {
+        if (key->expressionType == ExpressionType::PROPERTY) {
+            auto property = (PropertyExpression*)key.get();
+            if (property->isPrimaryKey() ||
+                property->isInternalID()) { // NOLINT(bugprone-branch-clone): Collapsing
+                                            // is a logical error.
+                // Primary properties are always keys.
+                keys.push_back(key);
+            } else if (primaryVarNames.contains(property->getVariableName())) {
+                // Properties depend on any primary property are dependent keys.
+                // e.g. a.age depends on a._id
+                dependentKeys.push_back(key);
+            } else {
+                keys.push_back(key);
+            }
+        } else if (ExpressionUtil::isNodePattern(*key) || ExpressionUtil::isRelPattern(*key)) {
+            if (primaryVarNames.contains(key->getUniqueName())) {
+                // e.g. a depends on a._id
+                dependentKeys.push_back(key);
+            } else {
+                keys.push_back(key);
+            }
+        } else {
+            keys.push_back(key);
+        }
+    }
+    return std::make_pair(std::move(keys), std::move(dependentKeys));
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/cardinality_updater.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/cardinality_updater.cpp
new file mode 100644
index 0000000000..a0b0f9f068
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/cardinality_updater.cpp
@@ -0,0 +1,137 @@
+#include "optimizer/cardinality_updater.h"
+
+#include "binder/expression/expression_util.h"
+#include "planner/join_order/cardinality_estimator.h"
+#include "planner/operator/extend/logical_extend.h"
+#include "planner/operator/logical_aggregate.h"
+#include "planner/operator/logical_filter.h"
+#include "planner/operator/logical_flatten.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/logical_intersect.h"
+#include "planner/operator/logical_limit.h"
+#include "planner/operator/logical_plan.h"
+
+namespace lbug::optimizer {
+void CardinalityUpdater::rewrite(planner::LogicalPlan* plan) {
+    visitOperator(plan->getLastOperator().get());
+}
+
+void CardinalityUpdater::visitOperator(planner::LogicalOperator* op) {
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        visitOperator(op->getChild(i).get());
+    }
+    visitOperatorSwitchWithDefault(op);
+}
+
+void CardinalityUpdater::visitOperatorSwitchWithDefault(planner::LogicalOperator* op) {
+    switch (op->getOperatorType()) {
+    case planner::LogicalOperatorType::SCAN_NODE_TABLE: {
+        visitScanNodeTable(op);
+        break;
+    }
+    case planner::LogicalOperatorType::EXTEND: {
+        visitExtend(op);
+        break;
+    }
+    case planner::LogicalOperatorType::HASH_JOIN: {
+        visitHashJoin(op);
+        break;
+    }
+    case planner::LogicalOperatorType::CROSS_PRODUCT: {
+        visitCrossProduct(op);
+        break;
+    }
+    case planner::LogicalOperatorType::INTERSECT: {
+        visitIntersect(op);
+        break;
+    }
+    case planner::LogicalOperatorType::FLATTEN: {
+        visitFlatten(op);
+        break;
+    }
+    case planner::LogicalOperatorType::FILTER: {
+        visitFilter(op);
+        break;
+    }
+    case planner::LogicalOperatorType::LIMIT: {
+        visitLimit(op);
+        break;
+    }
+    case planner::LogicalOperatorType::AGGREGATE: {
+        visitAggregate(op);
+        break;
+    }
+    default: {
+        visitOperatorDefault(op);
+        break;
+    }
+    }
+}
+
+void CardinalityUpdater::visitOperatorDefault(planner::LogicalOperator* op) {
+    if (op->getNumChildren() == 1) {
+        op->setCardinality(op->getChild(0)->getCardinality());
+    }
+}
+
+void CardinalityUpdater::visitScanNodeTable(planner::LogicalOperator* op) {
+    op->setCardinality(cardinalityEstimator.estimateScanNode(*op));
+}
+
+void CardinalityUpdater::visitExtend(planner::LogicalOperator* op) {
+    KU_ASSERT(transaction);
+    auto& extend = op->cast<planner::LogicalExtend&>();
+    const auto extensionRate = cardinalityEstimator.getExtensionRate(*extend.getRel(),
+        *extend.getBoundNode(), transaction);
+    extend.setCardinality(
+        cardinalityEstimator.multiply(extensionRate, op->getChild(0)->getCardinality()));
+}
+
+void CardinalityUpdater::visitHashJoin(planner::LogicalOperator* op) {
+    auto& hashJoin = op->cast<planner::LogicalHashJoin&>();
+    KU_ASSERT(hashJoin.getNumChildren() >= 2);
+    hashJoin.setCardinality(cardinalityEstimator.estimateHashJoin(hashJoin.getJoinConditions(),
+        *hashJoin.getChild(0), *hashJoin.getChild(1)));
+}
+
+void CardinalityUpdater::visitCrossProduct(planner::LogicalOperator* op) {
+    op->setCardinality(
+        cardinalityEstimator.estimateCrossProduct(*op->getChild(0), *op->getChild(1)));
+}
+
+void CardinalityUpdater::visitIntersect(planner::LogicalOperator* op) {
+    auto& intersect = op->cast<planner::LogicalIntersect&>();
+    KU_ASSERT(intersect.getNumChildren() >= 2);
+    std::vector<planner::LogicalOperator*> buildOps;
+    for (uint32_t i = 1; i < intersect.getNumChildren(); ++i) {
+        buildOps.push_back(intersect.getChild(i).get());
+    }
+    intersect.setCardinality(cardinalityEstimator.estimateIntersect(intersect.getKeyNodeIDs(),
+        *intersect.getChild(0), buildOps));
+}
+
+void CardinalityUpdater::visitFlatten(planner::LogicalOperator* op) {
+    auto& flatten = op->cast<planner::LogicalFlatten&>();
+    flatten.setCardinality(
+        cardinalityEstimator.estimateFlatten(*flatten.getChild(0), flatten.getGroupPos()));
+}
+
+void CardinalityUpdater::visitFilter(planner::LogicalOperator* op) {
+    auto& filter = op->cast<planner::LogicalFilter&>();
+    filter.setCardinality(
+        cardinalityEstimator.estimateFilter(*filter.getChild(0), *filter.getPredicate()));
+}
+
+void CardinalityUpdater::visitLimit(planner::LogicalOperator* op) {
+    auto& limit = op->cast<planner::LogicalLimit&>();
+    if (limit.hasLimitNum() && binder::ExpressionUtil::canEvaluateAsLiteral(*limit.getLimitNum())) {
+        limit.setCardinality(binder::ExpressionUtil::evaluateAsSkipLimit(*limit.getLimitNum()));
+    }
+}
+
+void CardinalityUpdater::visitAggregate(planner::LogicalOperator* op) {
+    auto& aggregate = op->cast<planner::LogicalAggregate&>();
+    aggregate.setCardinality(cardinalityEstimator.estimateAggregate(aggregate));
+}
+
+} // namespace lbug::optimizer
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/correlated_subquery_unnest_solver.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/correlated_subquery_unnest_solver.cpp
new file mode 100644
index 0000000000..823102899a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/correlated_subquery_unnest_solver.cpp
@@ -0,0 +1,51 @@
+#include "optimizer/correlated_subquery_unnest_solver.h"
+
+#include "common/exception/internal.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/scan/logical_expressions_scan.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace optimizer {
+
+void CorrelatedSubqueryUnnestSolver::solve(planner::LogicalOperator* root_) {
+    visitOperator(root_);
+}
+
+void CorrelatedSubqueryUnnestSolver::visitOperator(LogicalOperator* op) {
+    visitOperatorSwitch(op);
+    if (LogicalOperatorUtils::isAccHashJoin(*op)) {
+        solveAccHashJoin(op);
+        return;
+    }
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        visitOperator(op->getChild(i).get());
+    }
+}
+
+void CorrelatedSubqueryUnnestSolver::solveAccHashJoin(LogicalOperator* op) const {
+    auto& hashJoin = op->cast<LogicalHashJoin>();
+    auto& sipInfo = hashJoin.getSIPInfoUnsafe();
+    sipInfo.dependency = SIPDependency::BUILD_DEPENDS_ON_PROBE;
+    sipInfo.direction = SIPDirection::PROBE_TO_BUILD;
+    auto acc = op->getChild(0).get();
+    auto rightSolver = std::make_unique<CorrelatedSubqueryUnnestSolver>(acc);
+    rightSolver->solve(hashJoin.getChild(1).get());
+    auto leftSolver = std::make_unique<CorrelatedSubqueryUnnestSolver>(accumulateOp);
+    leftSolver->solve(acc->getChild(0).get());
+}
+
+void CorrelatedSubqueryUnnestSolver::visitExpressionsScan(LogicalOperator* op) {
+    auto expressionsScan = op->ptrCast<LogicalExpressionsScan>();
+    // LCOV_EXCL_START
+    if (accumulateOp == nullptr) {
+        throw common::InternalException(
+            "Failed to execute CorrelatedSubqueryUnnestSolver. This should not happen.");
+    }
+    // LCOV_EXCL_STOP
+    expressionsScan->setOuterAccumulate(accumulateOp);
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/factorization_rewriter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/factorization_rewriter.cpp
new file mode 100644
index 0000000000..332fb285b8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/factorization_rewriter.cpp
@@ -0,0 +1,191 @@
+#include "optimizer/factorization_rewriter.h"
+
+#include "binder/expression_visitor.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+#include "planner/operator/logical_accumulate.h"
+#include "planner/operator/logical_aggregate.h"
+#include "planner/operator/logical_distinct.h"
+#include "planner/operator/logical_filter.h"
+#include "planner/operator/logical_flatten.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/logical_intersect.h"
+#include "planner/operator/logical_limit.h"
+#include "planner/operator/logical_order_by.h"
+#include "planner/operator/logical_projection.h"
+#include "planner/operator/logical_union.h"
+#include "planner/operator/logical_unwind.h"
+#include "planner/operator/persistent/logical_copy_to.h"
+#include "planner/operator/persistent/logical_delete.h"
+#include "planner/operator/persistent/logical_insert.h"
+#include "planner/operator/persistent/logical_merge.h"
+#include "planner/operator/persistent/logical_set.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace optimizer {
+
+void FactorizationRewriter::rewrite(planner::LogicalPlan* plan) {
+    visitOperator(plan->getLastOperator().get());
+}
+
+void FactorizationRewriter::visitOperator(planner::LogicalOperator* op) {
+    // bottom-up traversal
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        visitOperator(op->getChild(i).get());
+    }
+    visitOperatorSwitch(op);
+    op->computeFactorizedSchema();
+}
+
+void FactorizationRewriter::visitHashJoin(planner::LogicalOperator* op) {
+    // TODO(Royi) correctly set the cardinality here
+    auto& hashJoin = op->cast<LogicalHashJoin>();
+    auto groupsPosToFlattenOnProbeSide = hashJoin.getGroupsPosToFlattenOnProbeSide();
+    hashJoin.setChild(0, appendFlattens(hashJoin.getChild(0), groupsPosToFlattenOnProbeSide));
+    auto groupsPosToFlattenOnBuildSide = hashJoin.getGroupsPosToFlattenOnBuildSide();
+    hashJoin.setChild(1, appendFlattens(hashJoin.getChild(1), groupsPosToFlattenOnBuildSide));
+}
+
+void FactorizationRewriter::visitIntersect(planner::LogicalOperator* op) {
+    auto& intersect = op->cast<LogicalIntersect>();
+    auto groupsPosToFlattenOnProbeSide = intersect.getGroupsPosToFlattenOnProbeSide();
+    intersect.setChild(0, appendFlattens(intersect.getChild(0), groupsPosToFlattenOnProbeSide));
+    for (auto i = 0u; i < intersect.getNumBuilds(); ++i) {
+        auto groupPosToFlatten = intersect.getGroupsPosToFlattenOnBuildSide(i);
+        auto childIdx = i + 1; // skip probe
+        intersect.setChild(childIdx,
+            appendFlattens(intersect.getChild(childIdx), groupPosToFlatten));
+    }
+}
+
+void FactorizationRewriter::visitProjection(planner::LogicalOperator* op) {
+    auto& projection = op->cast<LogicalProjection>();
+    bool hasRandomFunction = false;
+    for (auto& expr : projection.getExpressionsToProject()) {
+        if (ExpressionVisitor::isRandom(*expr)) {
+            hasRandomFunction = true;
+        }
+    }
+    if (hasRandomFunction) {
+        // Fall back to tuple-at-a-time evaluation.
+        auto groupsPos = op->getChild(0)->getSchema()->getGroupsPosInScope();
+        auto groupsPosToFlatten =
+            FlattenAll::getGroupsPosToFlatten(groupsPos, *op->getChild(0)->getSchema());
+        projection.setChild(0, appendFlattens(projection.getChild(0), groupsPosToFlatten));
+    } else {
+        for (auto& expression : projection.getExpressionsToProject()) {
+            auto groupsPosToFlatten =
+                FlattenAllButOne::getGroupsPosToFlatten(expression, *op->getChild(0)->getSchema());
+            projection.setChild(0, appendFlattens(projection.getChild(0), groupsPosToFlatten));
+        }
+    }
+}
+
+void FactorizationRewriter::visitAccumulate(planner::LogicalOperator* op) {
+    auto& accumulate = op->cast<LogicalAccumulate>();
+    auto groupsPosToFlatten = accumulate.getGroupPositionsToFlatten();
+    accumulate.setChild(0, appendFlattens(accumulate.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitAggregate(planner::LogicalOperator* op) {
+    auto& aggregate = op->cast<LogicalAggregate>();
+    auto groupsPosToFlatten = aggregate.getGroupsPosToFlatten();
+    aggregate.setChild(0, appendFlattens(aggregate.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitOrderBy(planner::LogicalOperator* op) {
+    auto& orderBy = op->cast<LogicalOrderBy>();
+    auto groupsPosToFlatten = orderBy.getGroupsPosToFlatten();
+    orderBy.setChild(0, appendFlattens(orderBy.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitLimit(planner::LogicalOperator* op) {
+    auto& limit = op->cast<LogicalLimit>();
+    auto groupsPosToFlatten = limit.getGroupsPosToFlatten();
+    limit.setChild(0, appendFlattens(limit.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitDistinct(planner::LogicalOperator* op) {
+    auto& distinct = op->cast<LogicalDistinct>();
+    auto groupsPosToFlatten = distinct.getGroupsPosToFlatten();
+    distinct.setChild(0, appendFlattens(distinct.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitUnwind(planner::LogicalOperator* op) {
+    auto& unwind = op->cast<LogicalUnwind>();
+    auto groupsPosToFlatten = unwind.getGroupsPosToFlatten();
+    unwind.setChild(0, appendFlattens(unwind.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitUnion(planner::LogicalOperator* op) {
+    auto& union_ = op->cast<LogicalUnion>();
+    for (auto i = 0u; i < union_.getNumChildren(); ++i) {
+        auto groupsPosToFlatten = union_.getGroupsPosToFlatten(i);
+        union_.setChild(i, appendFlattens(union_.getChild(i), groupsPosToFlatten));
+    }
+}
+
+void FactorizationRewriter::visitFilter(planner::LogicalOperator* op) {
+    auto& filter = op->cast<LogicalFilter>();
+    auto groupsPosToFlatten = filter.getGroupsPosToFlatten();
+    filter.setChild(0, appendFlattens(filter.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitSetProperty(planner::LogicalOperator* op) {
+    auto& set = op->cast<LogicalSetProperty>();
+    for (auto i = 0u; i < set.getInfos().size(); ++i) {
+        auto groupsPos = set.getGroupsPosToFlatten(i);
+        set.setChild(0, appendFlattens(set.getChild(0), groupsPos));
+    }
+}
+
+void FactorizationRewriter::visitDelete(planner::LogicalOperator* op) {
+    auto& delete_ = op->cast<LogicalDelete>();
+    auto groupsPosToFlatten = delete_.getGroupsPosToFlatten();
+    delete_.setChild(0, appendFlattens(delete_.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitInsert(planner::LogicalOperator* op) {
+    auto& insert = op->cast<LogicalInsert>();
+    auto groupsPosToFlatten = insert.getGroupsPosToFlatten();
+    insert.setChild(0, appendFlattens(insert.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitMerge(planner::LogicalOperator* op) {
+    auto& merge = op->cast<LogicalMerge>();
+    auto groupsPosToFlatten = merge.getGroupsPosToFlatten();
+    merge.setChild(0, appendFlattens(merge.getChild(0), groupsPosToFlatten));
+}
+
+void FactorizationRewriter::visitCopyTo(planner::LogicalOperator* op) {
+    auto& copyTo = op->cast<LogicalCopyTo>();
+    auto groupsPosToFlatten = copyTo.getGroupsPosToFlatten();
+    copyTo.setChild(0, appendFlattens(copyTo.getChild(0), groupsPosToFlatten));
+}
+
+std::shared_ptr<planner::LogicalOperator> FactorizationRewriter::appendFlattens(
+    std::shared_ptr<planner::LogicalOperator> op,
+    const std::unordered_set<f_group_pos>& groupsPos) {
+    auto currentChild = std::move(op);
+    for (auto groupPos : groupsPos) {
+        currentChild = appendFlattenIfNecessary(std::move(currentChild), groupPos);
+    }
+    return currentChild;
+}
+
+std::shared_ptr<planner::LogicalOperator> FactorizationRewriter::appendFlattenIfNecessary(
+    std::shared_ptr<planner::LogicalOperator> op, planner::f_group_pos groupPos) {
+    if (op->getSchema()->getGroup(groupPos)->isFlat()) {
+        return op;
+    }
+    // we set the cardinalities in a separate pass
+    auto flatten = std::make_shared<LogicalFlatten>(groupPos, std::move(op), 0 /* cardinality */);
+    flatten->computeFactorizedSchema();
+    return flatten;
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/filter_push_down_optimizer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/filter_push_down_optimizer.cpp
new file mode 100644
index 0000000000..05c6036ba9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/filter_push_down_optimizer.cpp
@@ -0,0 +1,332 @@
+#include "optimizer/filter_push_down_optimizer.h"
+
+#include "binder/expression/literal_expression.h"
+#include "binder/expression/property_expression.h"
+#include "binder/expression/scalar_function_expression.h"
+#include "main/client_context.h"
+#include "planner/operator/extend/logical_extend.h"
+#include "planner/operator/logical_empty_result.h"
+#include "planner/operator/logical_filter.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/logical_table_function_call.h"
+#include "planner/operator/scan/logical_scan_node_table.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace optimizer {
+
+void FilterPushDownOptimizer::rewrite(LogicalPlan* plan) {
+    visitOperator(plan->getLastOperator());
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::visitOperator(
+    const std::shared_ptr<LogicalOperator>& op) {
+    switch (op->getOperatorType()) {
+    case LogicalOperatorType::FILTER: {
+        return visitFilterReplace(op);
+    }
+    case LogicalOperatorType::CROSS_PRODUCT: {
+        return visitCrossProductReplace(op);
+    }
+    case LogicalOperatorType::EXTEND: {
+        return visitExtendReplace(op);
+    }
+    case LogicalOperatorType::SCAN_NODE_TABLE: {
+        return visitScanNodeTableReplace(op);
+    }
+    case LogicalOperatorType::TABLE_FUNCTION_CALL: {
+        return visitTableFunctionCallReplace(op);
+    }
+    default: { // Stop current push down for unhandled operator.
+        return visitChildren(op);
+    }
+    }
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::visitChildren(
+    const std::shared_ptr<LogicalOperator>& op) {
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        // Start new push down for child.
+        auto optimizer = FilterPushDownOptimizer(context);
+        op->setChild(i, optimizer.visitOperator(op->getChild(i)));
+    }
+    op->computeFlatSchema();
+    return finishPushDown(op);
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::visitFilterReplace(
+    const std::shared_ptr<LogicalOperator>& op) {
+    auto& filter = op->constCast<LogicalFilter>();
+    auto predicate = filter.getPredicate();
+    if (predicate->expressionType == ExpressionType::LITERAL) {
+        // Avoid executing child plan if literal is Null or False.
+        auto& literalExpr = predicate->constCast<LiteralExpression>();
+        if (literalExpr.isNull() || !literalExpr.getValue().getValue<bool>()) {
+            return std::make_shared<LogicalEmptyResult>(*op->getSchema());
+        }
+        // Ignore if literal is True.
+    } else {
+        predicateSet.addPredicate(predicate);
+    }
+    return visitOperator(filter.getChild(0));
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::visitCrossProductReplace(
+    const std::shared_ptr<LogicalOperator>& op) {
+    auto remainingPSet = PredicateSet();
+    auto probePSet = PredicateSet();
+    auto buildPSet = PredicateSet();
+    for (auto& p : predicateSet.getAllPredicates()) {
+        auto inProbe = op->getChild(0)->getSchema()->evaluable(*p);
+        auto inBuild = op->getChild(1)->getSchema()->evaluable(*p);
+        if (inProbe && !inBuild) {
+            probePSet.addPredicate(p);
+        } else if (!inProbe && inBuild) {
+            buildPSet.addPredicate(p);
+        } else {
+            remainingPSet.addPredicate(p);
+        }
+    }
+    KU_ASSERT(op->getNumChildren() == 2);
+    // Push probe side
+    auto probeOptimizer = FilterPushDownOptimizer(context, std::move(probePSet));
+    op->setChild(0, probeOptimizer.visitOperator(op->getChild(0)));
+    // Push build side
+    auto buildOptimizer = FilterPushDownOptimizer(context, std::move(buildPSet));
+    op->setChild(1, buildOptimizer.visitOperator(op->getChild(1)));
+
+    auto probeSchema = op->getChild(0)->getSchema();
+    auto buildSchema = op->getChild(1)->getSchema();
+    expression_vector predicates;
+    std::vector<join_condition_t> joinConditions;
+    for (auto& predicate : remainingPSet.equalityPredicates) {
+        auto left = predicate->getChild(0);
+        auto right = predicate->getChild(1);
+        // TODO(Xiyang): this can only rewrite left = right, we should also be able to do
+        // expr(left), expr(right)
+        if (probeSchema->isExpressionInScope(*left) && buildSchema->isExpressionInScope(*right)) {
+            joinConditions.emplace_back(left, right);
+        } else if (probeSchema->isExpressionInScope(*right) &&
+                   buildSchema->isExpressionInScope(*left)) {
+            joinConditions.emplace_back(right, left);
+        } else {
+            // Collect predicates that cannot be rewritten as join conditions.
+            predicates.push_back(predicate);
+        }
+    }
+    if (joinConditions.empty()) { // Nothing to push down. Terminate.
+        return finishPushDown(op);
+    }
+    auto hashJoin = std::make_shared<LogicalHashJoin>(joinConditions, JoinType::INNER,
+        nullptr /* mark */, op->getChild(0), op->getChild(1), 0 /* cardinality */);
+    // For non-id based joins, we disable side way information passing.
+    hashJoin->getSIPInfoUnsafe().position = SemiMaskPosition::PROHIBIT;
+    hashJoin->computeFlatSchema();
+    // Apply remaining predicates.
+    predicates.insert(predicates.end(), remainingPSet.nonEqualityPredicates.begin(),
+        remainingPSet.nonEqualityPredicates.end());
+    if (predicates.empty()) {
+        return hashJoin;
+    }
+    return appendFilters(predicates, hashJoin);
+}
+
+static ColumnPredicateSet getPredicateSet(const Expression& column,
+    const binder::expression_vector& predicates) {
+    auto predicateSet = ColumnPredicateSet();
+    for (auto& predicate : predicates) {
+        auto columnPredicate = ColumnPredicateUtil::tryConvert(column, *predicate);
+        if (columnPredicate == nullptr) {
+            continue;
+        }
+        predicateSet.addPredicate(std::move(columnPredicate));
+    }
+    return predicateSet;
+}
+
+static std::vector<ColumnPredicateSet> getColumnPredicateSets(const expression_vector& columns,
+    const expression_vector& predicates) {
+    std::vector<ColumnPredicateSet> predicateSets;
+    for (auto& column : columns) {
+        predicateSets.push_back(getPredicateSet(*column, predicates));
+    }
+    return predicateSets;
+}
+
+static bool isConstantExpression(const std::shared_ptr<Expression> expression) {
+    switch (expression->expressionType) {
+    case ExpressionType::LITERAL:
+    case ExpressionType::PARAMETER: {
+        return true;
+    }
+    // TODO(Xiyang): fold parameter expression in binder.
+    case ExpressionType::FUNCTION: {
+        auto& func = expression->constCast<ScalarFunctionExpression>();
+        if (func.getFunction().name == "CAST") {
+            return isConstantExpression(func.getChild(0));
+        } else {
+            return false;
+        }
+    }
+    default:
+        return false;
+    }
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::visitScanNodeTableReplace(
+    const std::shared_ptr<LogicalOperator>& op) {
+    auto& scan = op->cast<LogicalScanNodeTable>();
+    auto nodeID = scan.getNodeID();
+    // Apply column predicates.
+    if (context->getClientConfig()->enableZoneMap) {
+        scan.setPropertyPredicates(
+            getColumnPredicateSets(scan.getProperties(), predicateSet.getAllPredicates()));
+    }
+    // Apply index scan
+    auto tableIDs = scan.getTableIDs();
+    std::shared_ptr<Expression> primaryKeyEqualityComparison = nullptr;
+    if (tableIDs.size() == 1) {
+        primaryKeyEqualityComparison = predicateSet.popNodePKEqualityComparison(*nodeID);
+    }
+    if (primaryKeyEqualityComparison != nullptr) { // Try rewrite index scan
+        auto rhs = primaryKeyEqualityComparison->getChild(1);
+        if (isConstantExpression(rhs)) {
+            auto extraInfo = std::make_unique<PrimaryKeyScanInfo>(rhs);
+            scan.setScanType(LogicalScanNodeTableType::PRIMARY_KEY_SCAN);
+            scan.setExtraInfo(std::move(extraInfo));
+            scan.computeFlatSchema();
+        } else {
+            // Cannot rewrite and add predicate back.
+            predicateSet.addPredicate(primaryKeyEqualityComparison);
+        }
+    }
+    return finishPushDown(op);
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::visitTableFunctionCallReplace(
+    const std::shared_ptr<LogicalOperator>& op) {
+    auto& tableFunctionCall = op->cast<LogicalTableFunctionCall>();
+    auto columnPredicates = getColumnPredicateSets(tableFunctionCall.getBindData()->columns,
+        predicateSet.getAllPredicates());
+    tableFunctionCall.setColumnPredicates(std::move(columnPredicates));
+    return finishPushDown(op);
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::visitExtendReplace(
+    const std::shared_ptr<LogicalOperator>& op) {
+    if (op->ptrCast<BaseLogicalExtend>()->isRecursive() ||
+        !context->getClientConfig()->enableZoneMap) {
+        return visitChildren(op);
+    }
+    auto& extend = op->cast<LogicalExtend>();
+    // Apply column predicates.
+    auto columnPredicates =
+        getColumnPredicateSets(extend.getProperties(), predicateSet.getAllPredicates());
+    extend.setPropertyPredicates(std::move(columnPredicates));
+    return visitChildren(op);
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::finishPushDown(
+    std::shared_ptr<LogicalOperator> op) {
+    if (predicateSet.isEmpty()) {
+        return op;
+    }
+    auto predicates = predicateSet.getAllPredicates();
+    auto root = appendFilters(predicates, op);
+    predicateSet.clear();
+    return root;
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::appendScanNodeTable(
+    std::shared_ptr<binder::Expression> nodeID, std::vector<common::table_id_t> nodeTableIDs,
+    binder::expression_vector properties, std::shared_ptr<planner::LogicalOperator> child) {
+    if (properties.empty()) {
+        return child;
+    }
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    auto scanNodeTable = std::make_shared<LogicalScanNodeTable>(std::move(nodeID),
+        std::move(nodeTableIDs), std::move(properties));
+    scanNodeTable->computeFlatSchema();
+    return scanNodeTable;
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::appendFilters(
+    const expression_vector& predicates, std::shared_ptr<LogicalOperator> child) {
+    if (predicates.empty()) {
+        return child;
+    }
+    auto root = child;
+    for (auto& p : predicates) {
+        root = appendFilter(p, root);
+    }
+    return root;
+}
+
+std::shared_ptr<LogicalOperator> FilterPushDownOptimizer::appendFilter(
+    std::shared_ptr<Expression> predicate, std::shared_ptr<LogicalOperator> child) {
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    auto filter = std::make_shared<LogicalFilter>(std::move(predicate), std::move(child));
+    filter->computeFlatSchema();
+    return filter;
+}
+
+void PredicateSet::addPredicate(std::shared_ptr<Expression> predicate) {
+    if (predicate->expressionType == ExpressionType::EQUALS) {
+        equalityPredicates.push_back(std::move(predicate));
+    } else {
+        nonEqualityPredicates.push_back(std::move(predicate));
+    }
+}
+
+static bool isNodePrimaryKey(const Expression& expression, const Expression& nodeID) {
+    if (expression.expressionType != ExpressionType::PROPERTY) {
+        // not property
+        return false;
+    }
+    auto& property = expression.constCast<PropertyExpression>();
+    if (property.getVariableName() != nodeID.constCast<PropertyExpression>().getVariableName()) {
+        // not property for node
+        return false;
+    }
+    return property.isPrimaryKey();
+}
+
+std::shared_ptr<Expression> PredicateSet::popNodePKEqualityComparison(const Expression& nodeID) {
+    // We pop when the first primary key equality comparison is found.
+    auto resultPredicateIdx = INVALID_IDX;
+    for (auto i = 0u; i < equalityPredicates.size(); ++i) {
+        auto predicate = equalityPredicates[i];
+        if (isNodePrimaryKey(*predicate->getChild(0), nodeID)) {
+            resultPredicateIdx = i;
+            break;
+        } else if (isNodePrimaryKey(*predicate->getChild(1), nodeID)) {
+            // Normalize primary key to LHS.
+            auto leftChild = predicate->getChild(0);
+            auto rightChild = predicate->getChild(1);
+            predicate->setChild(1, leftChild);
+            predicate->setChild(0, rightChild);
+            resultPredicateIdx = i;
+            break;
+        }
+    }
+    if (resultPredicateIdx != INVALID_IDX) {
+        auto result = equalityPredicates[resultPredicateIdx];
+        equalityPredicates.erase(equalityPredicates.begin() + resultPredicateIdx);
+        return result;
+    }
+    return nullptr;
+}
+
+expression_vector PredicateSet::getAllPredicates() {
+    expression_vector result;
+    result.insert(result.end(), equalityPredicates.begin(), equalityPredicates.end());
+    result.insert(result.end(), nonEqualityPredicates.begin(), nonEqualityPredicates.end());
+    return result;
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/limit_push_down_optimizer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/limit_push_down_optimizer.cpp
new file mode 100644
index 0000000000..5f929a905d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/limit_push_down_optimizer.cpp
@@ -0,0 +1,85 @@
+#include "optimizer/limit_push_down_optimizer.h"
+
+#include "binder/expression/expression_util.h"
+#include "common/exception/runtime.h"
+#include "planner/operator/extend/logical_recursive_extend.h"
+#include "planner/operator/logical_distinct.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/logical_limit.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace optimizer {
+
+void LimitPushDownOptimizer::rewrite(LogicalPlan* plan) {
+    visitOperator(plan->getLastOperator().get());
+}
+
+void LimitPushDownOptimizer::visitOperator(planner::LogicalOperator* op) {
+    switch (op->getOperatorType()) {
+    case LogicalOperatorType::LIMIT: {
+        auto& limit = op->constCast<LogicalLimit>();
+        if (limit.hasSkipNum() && ExpressionUtil::canEvaluateAsLiteral(*limit.getSkipNum())) {
+            skipNumber = ExpressionUtil::evaluateAsSkipLimit(*limit.getSkipNum());
+        }
+        if (limit.hasLimitNum() && ExpressionUtil::canEvaluateAsLiteral(*limit.getLimitNum())) {
+            limitNumber = ExpressionUtil::evaluateAsSkipLimit(*limit.getLimitNum());
+        }
+        visitOperator(limit.getChild(0).get());
+        return;
+    }
+    case LogicalOperatorType::MULTIPLICITY_REDUCER:
+    case LogicalOperatorType::EXPLAIN:
+    case LogicalOperatorType::ACCUMULATE:
+    case LogicalOperatorType::PROJECTION: {
+        visitOperator(op->getChild(0).get());
+        return;
+    }
+    case LogicalOperatorType::DISTINCT: {
+        if (limitNumber == INVALID_LIMIT && skipNumber == 0) {
+            return;
+        }
+        auto& distinctOp = op->cast<LogicalDistinct>();
+        distinctOp.setLimitNum(limitNumber);
+        distinctOp.setSkipNum(skipNumber);
+        return;
+    }
+    case LogicalOperatorType::HASH_JOIN: {
+        if (limitNumber == INVALID_LIMIT && skipNumber == 0) {
+            return;
+        }
+        if (op->getChild(0)->getOperatorType() == LogicalOperatorType::HASH_JOIN) {
+            op->ptrCast<LogicalHashJoin>()->getSIPInfoUnsafe().position = SemiMaskPosition::NONE;
+            // OP is the hash join reading destination node property. Continue push limit down.
+            op = op->getChild(0).get();
+        }
+        if (op->getChild(0)->getOperatorType() == LogicalOperatorType::PATH_PROPERTY_PROBE) {
+            // LCOV_EXCL_START
+            if (op->getChild(0)->getChild(0)->getOperatorType() !=
+                LogicalOperatorType::RECURSIVE_EXTEND) {
+                throw RuntimeException("Trying to push limit to a non RECURSIVE_EXTEND operator. "
+                                       "This should never happen.");
+            }
+            // LCOV_EXCL_STOP
+            auto& extend = op->getChild(0)->getChild(0)->cast<LogicalRecursiveExtend>();
+            extend.setLimitNum(skipNumber + limitNumber);
+        }
+        return;
+    }
+    case LogicalOperatorType::UNION_ALL: {
+        for (auto i = 0u; i < op->getNumChildren(); ++i) {
+            auto optimizer = LimitPushDownOptimizer();
+            optimizer.visitOperator(op->getChild(i).get());
+        }
+        return;
+    }
+    default:
+        return;
+    }
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/logical_operator_collector.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/logical_operator_collector.cpp
new file mode 100644
index 0000000000..a17f6f0e32
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/logical_operator_collector.cpp
@@ -0,0 +1,23 @@
+#include "optimizer/logical_operator_collector.h"
+
+#include "planner/operator/scan/logical_scan_node_table.h"
+
+namespace lbug {
+namespace optimizer {
+
+void LogicalOperatorCollector::collect(planner::LogicalOperator* op) {
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        collect(op->getChild(i).get());
+    }
+    visitOperatorSwitch(op);
+}
+
+void LogicalIndexScanNodeCollector::visitScanNodeTable(planner::LogicalOperator* op) {
+    auto scan = op->constCast<planner::LogicalScanNodeTable>();
+    if (scan.getScanType() == planner::LogicalScanNodeTableType::PRIMARY_KEY_SCAN) {
+        ops.push_back(op);
+    }
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/logical_operator_visitor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/logical_operator_visitor.cpp
new file mode 100644
index 0000000000..89d454ce5f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/logical_operator_visitor.cpp
@@ -0,0 +1,186 @@
+#include "optimizer/logical_operator_visitor.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace optimizer {
+
+void LogicalOperatorVisitor::visitOperatorSwitch(LogicalOperator* op) {
+    switch (op->getOperatorType()) {
+    case LogicalOperatorType::ACCUMULATE: {
+        visitAccumulate(op);
+    } break;
+    case LogicalOperatorType::AGGREGATE: {
+        visitAggregate(op);
+    } break;
+    case LogicalOperatorType::COPY_FROM: {
+        visitCopyFrom(op);
+    } break;
+    case LogicalOperatorType::COPY_TO: {
+        visitCopyTo(op);
+    } break;
+    case LogicalOperatorType::DELETE: {
+        visitDelete(op);
+    } break;
+    case LogicalOperatorType::DISTINCT: {
+        visitDistinct(op);
+    } break;
+    case LogicalOperatorType::EMPTY_RESULT: {
+        visitEmptyResult(op);
+    } break;
+    case LogicalOperatorType::EXPRESSIONS_SCAN: {
+        visitExpressionsScan(op);
+    } break;
+    case LogicalOperatorType::EXTEND: {
+        visitExtend(op);
+    } break;
+    case LogicalOperatorType::FILTER: {
+        visitFilter(op);
+    } break;
+    case LogicalOperatorType::FLATTEN: {
+        visitFlatten(op);
+    } break;
+    case LogicalOperatorType::HASH_JOIN: {
+        visitHashJoin(op);
+    } break;
+    case LogicalOperatorType::INTERSECT: {
+        visitIntersect(op);
+    } break;
+    case LogicalOperatorType::INSERT: {
+        visitInsert(op);
+    } break;
+    case LogicalOperatorType::LIMIT: {
+        visitLimit(op);
+    } break;
+    case LogicalOperatorType::MERGE: {
+        visitMerge(op);
+    } break;
+    case LogicalOperatorType::NODE_LABEL_FILTER: {
+        visitNodeLabelFilter(op);
+    } break;
+    case LogicalOperatorType::ORDER_BY: {
+        visitOrderBy(op);
+    } break;
+    case LogicalOperatorType::PATH_PROPERTY_PROBE: {
+        visitPathPropertyProbe(op);
+    } break;
+    case LogicalOperatorType::PROJECTION: {
+        visitProjection(op);
+    } break;
+    case LogicalOperatorType::RECURSIVE_EXTEND: {
+        visitRecursiveExtend(op);
+    } break;
+    case LogicalOperatorType::SCAN_NODE_TABLE: {
+        visitScanNodeTable(op);
+    } break;
+    case LogicalOperatorType::SET_PROPERTY: {
+        visitSetProperty(op);
+    } break;
+    case LogicalOperatorType::TABLE_FUNCTION_CALL: {
+        visitTableFunctionCall(op);
+    } break;
+    case LogicalOperatorType::UNION_ALL: {
+        visitUnion(op);
+    } break;
+    case LogicalOperatorType::UNWIND: {
+        visitUnwind(op);
+    } break;
+    case LogicalOperatorType::CROSS_PRODUCT: {
+        visitCrossProduct(op);
+    }
+    default:
+        return;
+    }
+}
+
+std::shared_ptr<LogicalOperator> LogicalOperatorVisitor::visitOperatorReplaceSwitch(
+    std::shared_ptr<LogicalOperator> op) {
+    switch (op->getOperatorType()) {
+    case LogicalOperatorType::ACCUMULATE: {
+        return visitAccumulateReplace(op);
+    }
+    case LogicalOperatorType::AGGREGATE: {
+        return visitAggregateReplace(op);
+    }
+    case LogicalOperatorType::COPY_FROM: {
+        return visitCopyFromReplace(op);
+    }
+    case LogicalOperatorType::COPY_TO: {
+        return visitCopyToReplace(op);
+    }
+    case LogicalOperatorType::DELETE: {
+        return visitDeleteReplace(op);
+    }
+    case LogicalOperatorType::DISTINCT: {
+        return visitDistinctReplace(op);
+    }
+    case LogicalOperatorType::EMPTY_RESULT: {
+        return visitEmptyResultReplace(op);
+    }
+    case LogicalOperatorType::EXPRESSIONS_SCAN: {
+        return visitExpressionsScanReplace(op);
+    }
+    case LogicalOperatorType::EXTEND: {
+        return visitExtendReplace(op);
+    }
+    case LogicalOperatorType::FILTER: {
+        return visitFilterReplace(op);
+    }
+    case LogicalOperatorType::FLATTEN: {
+        return visitFlattenReplace(op);
+    }
+    case LogicalOperatorType::HASH_JOIN: {
+        return visitHashJoinReplace(op);
+    }
+    case LogicalOperatorType::INTERSECT: {
+        return visitIntersectReplace(op);
+    }
+    case LogicalOperatorType::INSERT: {
+        return visitInsertReplace(op);
+    }
+    case LogicalOperatorType::LIMIT: {
+        return visitLimitReplace(op);
+    }
+    case LogicalOperatorType::MERGE: {
+        return visitMergeReplace(op);
+    }
+    case LogicalOperatorType::NODE_LABEL_FILTER: {
+        return visitNodeLabelFilterReplace(op);
+    }
+    case LogicalOperatorType::ORDER_BY: {
+        return visitOrderByReplace(op);
+    }
+    case LogicalOperatorType::PATH_PROPERTY_PROBE: {
+        return visitPathPropertyProbeReplace(op);
+    }
+    case LogicalOperatorType::PROJECTION: {
+        return visitProjectionReplace(op);
+    }
+    case LogicalOperatorType::RECURSIVE_EXTEND: {
+        return visitRecursiveExtendReplace(op);
+    }
+    case LogicalOperatorType::SCAN_NODE_TABLE: {
+        return visitScanNodeTableReplace(op);
+    }
+    case LogicalOperatorType::SET_PROPERTY: {
+        return visitSetPropertyReplace(op);
+    }
+    case LogicalOperatorType::TABLE_FUNCTION_CALL: {
+        return visitTableFunctionCallReplace(op);
+    }
+    case LogicalOperatorType::UNION_ALL: {
+        return visitUnionReplace(op);
+    }
+    case LogicalOperatorType::UNWIND: {
+        return visitUnwindReplace(op);
+    }
+    case LogicalOperatorType::CROSS_PRODUCT: {
+        return visitCrossProductReplace(op);
+    }
+    default:
+        return op;
+    }
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/optimizer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/optimizer.cpp
new file mode 100644
index 0000000000..e7f6f04283
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/optimizer.cpp
@@ -0,0 +1,81 @@
+#include "optimizer/optimizer.h"
+
+#include "main/client_context.h"
+#include "optimizer/acc_hash_join_optimizer.h"
+#include "optimizer/agg_key_dependency_optimizer.h"
+#include "optimizer/cardinality_updater.h"
+#include "optimizer/correlated_subquery_unnest_solver.h"
+#include "optimizer/factorization_rewriter.h"
+#include "optimizer/filter_push_down_optimizer.h"
+#include "optimizer/limit_push_down_optimizer.h"
+#include "optimizer/projection_push_down_optimizer.h"
+#include "optimizer/remove_factorization_rewriter.h"
+#include "optimizer/remove_unnecessary_join_optimizer.h"
+#include "optimizer/schema_populator.h"
+#include "optimizer/top_k_optimizer.h"
+#include "planner/operator/logical_explain.h"
+#include "transaction/transaction.h"
+
+namespace lbug {
+namespace optimizer {
+
+void Optimizer::optimize(planner::LogicalPlan* plan, main::ClientContext* context,
+    const planner::CardinalityEstimator& cardinalityEstimator) {
+    if (context->getClientConfig()->enablePlanOptimizer) {
+        // Factorization structure should be removed before further optimization can be applied.
+        auto removeFactorizationRewriter = RemoveFactorizationRewriter();
+        removeFactorizationRewriter.rewrite(plan);
+
+        auto correlatedSubqueryUnnestSolver = CorrelatedSubqueryUnnestSolver(nullptr);
+        correlatedSubqueryUnnestSolver.solve(plan->getLastOperator().get());
+
+        auto removeUnnecessaryJoinOptimizer = RemoveUnnecessaryJoinOptimizer();
+        removeUnnecessaryJoinOptimizer.rewrite(plan);
+
+        auto filterPushDownOptimizer = FilterPushDownOptimizer(context);
+        filterPushDownOptimizer.rewrite(plan);
+
+        auto projectionPushDownOptimizer =
+            ProjectionPushDownOptimizer(context->getClientConfig()->recursivePatternSemantic);
+        projectionPushDownOptimizer.rewrite(plan);
+
+        auto limitPushDownOptimizer = LimitPushDownOptimizer();
+        limitPushDownOptimizer.rewrite(plan);
+
+        if (context->getClientConfig()->enableSemiMask) {
+            // HashJoinSIPOptimizer should be applied after optimizers that manipulate hash join.
+            auto hashJoinSIPOptimizer = HashJoinSIPOptimizer();
+            hashJoinSIPOptimizer.rewrite(plan);
+        }
+
+        auto topKOptimizer = TopKOptimizer();
+        topKOptimizer.rewrite(plan);
+
+        auto factorizationRewriter = FactorizationRewriter();
+        factorizationRewriter.rewrite(plan);
+
+        // AggKeyDependencyOptimizer doesn't change factorization structure and thus can be put
+        // after FactorizationRewriter.
+        auto aggKeyDependencyOptimizer = AggKeyDependencyOptimizer();
+        aggKeyDependencyOptimizer.rewrite(plan);
+
+        // for EXPLAIN LOGICAL we need to update the cardinalities for the optimized plan
+        // we don't need to do this otherwise as we don't use the cardinalities after planning
+        if (plan->getLastOperatorRef().getOperatorType() == planner::LogicalOperatorType::EXPLAIN) {
+            const auto& explain = plan->getLastOperatorRef().cast<planner::LogicalExplain>();
+            if (explain.getExplainType() == common::ExplainType::LOGICAL_PLAN) {
+                auto cardinalityUpdater = CardinalityUpdater(cardinalityEstimator,
+                    transaction::Transaction::Get(*context));
+                cardinalityUpdater.rewrite(plan);
+            }
+        }
+    } else {
+        // we still need to compute the schema for each operator even if we have optimizations
+        // disabled
+        auto schemaPopulator = SchemaPopulator{};
+        schemaPopulator.rewrite(plan);
+    }
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/projection_push_down_optimizer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/projection_push_down_optimizer.cpp
new file mode 100644
index 0000000000..59c642f936
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/projection_push_down_optimizer.cpp
@@ -0,0 +1,368 @@
+#include "optimizer/projection_push_down_optimizer.h"
+
+#include "binder/expression_visitor.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/rec_joins.h"
+#include "planner/operator/extend/logical_extend.h"
+#include "planner/operator/extend/logical_recursive_extend.h"
+#include "planner/operator/logical_accumulate.h"
+#include "planner/operator/logical_filter.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/logical_intersect.h"
+#include "planner/operator/logical_node_label_filter.h"
+#include "planner/operator/logical_order_by.h"
+#include "planner/operator/logical_path_property_probe.h"
+#include "planner/operator/logical_projection.h"
+#include "planner/operator/logical_table_function_call.h"
+#include "planner/operator/logical_unwind.h"
+#include "planner/operator/persistent/logical_copy_from.h"
+#include "planner/operator/persistent/logical_delete.h"
+#include "planner/operator/persistent/logical_insert.h"
+#include "planner/operator/persistent/logical_merge.h"
+#include "planner/operator/persistent/logical_set.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::binder;
+using namespace lbug::function;
+
+namespace lbug {
+namespace optimizer {
+
+void ProjectionPushDownOptimizer::rewrite(LogicalPlan* plan) {
+    visitOperator(plan->getLastOperator().get());
+}
+
+void ProjectionPushDownOptimizer::visitOperator(LogicalOperator* op) {
+    visitOperatorSwitch(op);
+    if (op->getOperatorType() == LogicalOperatorType::PROJECTION) {
+        // We will start a new optimizer once a projection is encountered.
+        return;
+    }
+    // top-down traversal
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        visitOperator(op->getChild(i).get());
+    }
+    op->computeFlatSchema();
+}
+
+void ProjectionPushDownOptimizer::visitPathPropertyProbe(LogicalOperator* op) {
+    auto& pathPropertyProbe = op->cast<LogicalPathPropertyProbe>();
+    auto child = pathPropertyProbe.getChild(0);
+    KU_ASSERT(child->getOperatorType() == LogicalOperatorType::RECURSIVE_EXTEND);
+    if (nodeOrRelInUse.contains(pathPropertyProbe.getRel())) {
+        return; // Path is needed
+    }
+    // Path is not needed
+    pathPropertyProbe.setJoinType(planner::RecursiveJoinType::TRACK_NONE);
+    auto extend = child->ptrCast<LogicalRecursiveExtend>();
+    auto functionName = extend->getFunction().getFunctionName();
+    if (functionName == VarLenJoinsFunction::name) {
+        extend->getBindDataUnsafe().writePath = false;
+    } else if (functionName == SingleSPPathsFunction::name) {
+        extend->setFunction(SingleSPDestinationsFunction::getAlgorithm());
+    } else if (functionName == AllSPPathsFunction::name) {
+        extend->setFunction(AllSPDestinationsFunction::getAlgorithm());
+    } else if (functionName == WeightedSPPathsFunction::name) {
+        extend->setFunction(WeightedSPDestinationsFunction::getAlgorithm());
+    }
+    extend->setResultColumns(extend->getFunction().getResultColumns(extend->getBindData()));
+}
+
+void ProjectionPushDownOptimizer::visitExtend(LogicalOperator* op) {
+    auto& extend = op->cast<LogicalExtend>();
+    const auto boundNodeID = extend.getBoundNode()->getInternalID();
+    collectExpressionsInUse(boundNodeID);
+    const auto nbrNodeID = extend.getNbrNode()->getInternalID();
+    extend.setScanNbrID(propertiesInUse.contains(nbrNodeID));
+}
+
+void ProjectionPushDownOptimizer::visitAccumulate(LogicalOperator* op) {
+    auto& accumulate = op->constCast<LogicalAccumulate>();
+    if (accumulate.getAccumulateType() != AccumulateType::REGULAR) {
+        return;
+    }
+    auto expressionsBeforePruning = accumulate.getPayloads();
+    auto expressionsAfterPruning = pruneExpressions(expressionsBeforePruning);
+    if (expressionsBeforePruning.size() == expressionsAfterPruning.size()) {
+        return;
+    }
+    preAppendProjection(op, 0, expressionsAfterPruning);
+}
+
+void ProjectionPushDownOptimizer::visitFilter(LogicalOperator* op) {
+    auto& filter = op->constCast<LogicalFilter>();
+    collectExpressionsInUse(filter.getPredicate());
+}
+
+void ProjectionPushDownOptimizer::visitNodeLabelFilter(LogicalOperator* op) {
+    auto& filter = op->constCast<LogicalNodeLabelFilter>();
+    collectExpressionsInUse(filter.getNodeID());
+}
+
+void ProjectionPushDownOptimizer::visitHashJoin(LogicalOperator* op) {
+    auto& hashJoin = op->constCast<LogicalHashJoin>();
+    for (auto& [probeJoinKey, buildJoinKey] : hashJoin.getJoinConditions()) {
+        collectExpressionsInUse(probeJoinKey);
+        collectExpressionsInUse(buildJoinKey);
+    }
+    if (hashJoin.getJoinType() == JoinType::MARK) { // no need to perform push down for mark join.
+        return;
+    }
+    auto expressionsBeforePruning = hashJoin.getExpressionsToMaterialize();
+    auto expressionsAfterPruning = pruneExpressions(expressionsBeforePruning);
+    if (expressionsBeforePruning.size() == expressionsAfterPruning.size()) {
+        // TODO(Xiyang): replace this with a separate optimizer.
+        return;
+    }
+    preAppendProjection(op, 1, expressionsAfterPruning);
+}
+
+void ProjectionPushDownOptimizer::visitIntersect(LogicalOperator* op) {
+    auto& intersect = op->constCast<LogicalIntersect>();
+    collectExpressionsInUse(intersect.getIntersectNodeID());
+    for (auto i = 0u; i < intersect.getNumBuilds(); ++i) {
+        auto childIdx = i + 1; // skip probe
+        auto keyNodeID = intersect.getKeyNodeID(i);
+        collectExpressionsInUse(keyNodeID);
+        // Note: we have a potential bug under intersect.cpp. The following code ensures build key
+        // and intersect key always appear as the first and second column. Should be removed once
+        // the bug is fixed.
+        expression_vector expressionsBeforePruning;
+        expression_vector expressionsAfterPruning;
+        for (auto& expression :
+            intersect.getChild(childIdx)->getSchema()->getExpressionsInScope()) {
+            if (expression->getUniqueName() == intersect.getIntersectNodeID()->getUniqueName() ||
+                expression->getUniqueName() == keyNodeID->getUniqueName()) {
+                continue;
+            }
+            expressionsBeforePruning.push_back(expression);
+        }
+        expressionsAfterPruning.push_back(keyNodeID);
+        expressionsAfterPruning.push_back(intersect.getIntersectNodeID());
+        for (auto& expression : pruneExpressions(expressionsBeforePruning)) {
+            expressionsAfterPruning.push_back(expression);
+        }
+        if (expressionsBeforePruning.size() == expressionsAfterPruning.size()) {
+            return;
+        }
+
+        preAppendProjection(op, childIdx, expressionsAfterPruning);
+    }
+}
+
+void ProjectionPushDownOptimizer::visitProjection(LogicalOperator* op) {
+    // Projection operator defines the start of a projection push down until the next projection
+    // operator is seen.
+    ProjectionPushDownOptimizer optimizer(this->semantic);
+    auto& projection = op->constCast<LogicalProjection>();
+    for (auto& expression : projection.getExpressionsToProject()) {
+        optimizer.collectExpressionsInUse(expression);
+    }
+    optimizer.visitOperator(op->getChild(0).get());
+}
+
+void ProjectionPushDownOptimizer::visitOrderBy(LogicalOperator* op) {
+    auto& orderBy = op->constCast<LogicalOrderBy>();
+    for (auto& expression : orderBy.getExpressionsToOrderBy()) {
+        collectExpressionsInUse(expression);
+    }
+    auto expressionsBeforePruning = orderBy.getChild(0)->getSchema()->getExpressionsInScope();
+    auto expressionsAfterPruning = pruneExpressions(expressionsBeforePruning);
+    if (expressionsBeforePruning.size() == expressionsAfterPruning.size()) {
+        return;
+    }
+    preAppendProjection(op, 0, expressionsAfterPruning);
+}
+
+void ProjectionPushDownOptimizer::visitUnwind(LogicalOperator* op) {
+    auto& unwind = op->constCast<LogicalUnwind>();
+    collectExpressionsInUse(unwind.getInExpr());
+}
+
+void ProjectionPushDownOptimizer::visitInsert(LogicalOperator* op) {
+    auto& insert = op->constCast<LogicalInsert>();
+    for (auto& info : insert.getInfos()) {
+        visitInsertInfo(info);
+    }
+}
+
+void ProjectionPushDownOptimizer::visitDelete(LogicalOperator* op) {
+    auto& delete_ = op->constCast<LogicalDelete>();
+    auto& infos = delete_.getInfos();
+    KU_ASSERT(!infos.empty());
+    switch (infos[0].tableType) {
+    case TableType::NODE: {
+        for (auto& info : infos) {
+            auto& node = info.pattern->constCast<NodeExpression>();
+            collectExpressionsInUse(node.getInternalID());
+            for (auto entry : node.getEntries()) {
+                collectExpressionsInUse(node.getPrimaryKey(entry->getTableID()));
+            }
+        }
+    } break;
+    case TableType::REL: {
+        for (auto& info : infos) {
+            auto& rel = info.pattern->constCast<RelExpression>();
+            collectExpressionsInUse(rel.getSrcNode()->getInternalID());
+            collectExpressionsInUse(rel.getDstNode()->getInternalID());
+            KU_ASSERT(rel.getRelType() == QueryRelType::NON_RECURSIVE);
+            if (!rel.isEmpty()) {
+                collectExpressionsInUse(rel.getInternalID());
+            }
+        }
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void ProjectionPushDownOptimizer::visitMerge(LogicalOperator* op) {
+    auto& merge = op->constCast<LogicalMerge>();
+    collectExpressionsInUse(merge.getExistenceMark());
+    for (auto& info : merge.getInsertNodeInfos()) {
+        visitInsertInfo(info);
+    }
+    for (auto& info : merge.getInsertRelInfos()) {
+        visitInsertInfo(info);
+    }
+    for (auto& info : merge.getOnCreateSetNodeInfos()) {
+        visitSetInfo(info);
+    }
+    for (auto& info : merge.getOnMatchSetNodeInfos()) {
+        visitSetInfo(info);
+    }
+    for (auto& info : merge.getOnCreateSetRelInfos()) {
+        visitSetInfo(info);
+    }
+    for (auto& info : merge.getOnMatchSetRelInfos()) {
+        visitSetInfo(info);
+    }
+}
+
+void ProjectionPushDownOptimizer::visitSetProperty(LogicalOperator* op) {
+    auto& set = op->constCast<LogicalSetProperty>();
+    for (auto& info : set.getInfos()) {
+        visitSetInfo(info);
+    }
+}
+
+void ProjectionPushDownOptimizer::visitCopyFrom(LogicalOperator* op) {
+    auto& copyFrom = op->constCast<LogicalCopyFrom>();
+    for (auto& expr : copyFrom.getInfo()->getSourceColumns()) {
+        collectExpressionsInUse(expr);
+    }
+    if (copyFrom.getInfo()->offset) {
+        collectExpressionsInUse(copyFrom.getInfo()->offset);
+    }
+}
+
+void ProjectionPushDownOptimizer::visitTableFunctionCall(LogicalOperator* op) {
+    auto& tableFunctionCall = op->cast<LogicalTableFunctionCall>();
+    std::vector<bool> columnSkips;
+    for (auto& column : tableFunctionCall.getBindData()->columns) {
+        columnSkips.push_back(!variablesInUse.contains(column));
+    }
+    tableFunctionCall.setColumnSkips(std::move(columnSkips));
+}
+
+void ProjectionPushDownOptimizer::visitSetInfo(const binder::BoundSetPropertyInfo& info) {
+    switch (info.tableType) {
+    case TableType::NODE: {
+        auto& node = info.pattern->constCast<NodeExpression>();
+        collectExpressionsInUse(node.getInternalID());
+    } break;
+    case TableType::REL: {
+        auto& rel = info.pattern->constCast<RelExpression>();
+        collectExpressionsInUse(rel.getSrcNode()->getInternalID());
+        collectExpressionsInUse(rel.getDstNode()->getInternalID());
+        collectExpressionsInUse(rel.getInternalID());
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    collectExpressionsInUse(info.columnData);
+}
+
+void ProjectionPushDownOptimizer::visitInsertInfo(const LogicalInsertInfo& info) {
+    if (info.tableType == TableType::REL) {
+        auto& rel = info.pattern->constCast<RelExpression>();
+        collectExpressionsInUse(rel.getSrcNode()->getInternalID());
+        collectExpressionsInUse(rel.getDstNode()->getInternalID());
+        collectExpressionsInUse(rel.getInternalID());
+    }
+    for (auto i = 0u; i < info.columnExprs.size(); ++i) {
+        if (info.isReturnColumnExprs[i]) {
+            collectExpressionsInUse(info.columnExprs[i]);
+        }
+        collectExpressionsInUse(info.columnDataExprs[i]);
+    }
+}
+
+// See comments above this class for how to collect expressions in use.
+void ProjectionPushDownOptimizer::collectExpressionsInUse(
+    std::shared_ptr<binder::Expression> expression) {
+    switch (expression->expressionType) {
+    case ExpressionType::PROPERTY: {
+        propertiesInUse.insert(expression);
+        return;
+    }
+    case ExpressionType::VARIABLE: {
+        variablesInUse.insert(expression);
+        return;
+    }
+    case ExpressionType::PATTERN: {
+        nodeOrRelInUse.insert(expression);
+        for (auto& child : ExpressionChildrenCollector::collectChildren(*expression)) {
+            collectExpressionsInUse(child);
+        }
+        return;
+    }
+    default:
+        for (auto& child : ExpressionChildrenCollector::collectChildren(*expression)) {
+            collectExpressionsInUse(child);
+        }
+    }
+}
+
+binder::expression_vector ProjectionPushDownOptimizer::pruneExpressions(
+    const binder::expression_vector& expressions) {
+    expression_set expressionsAfterPruning;
+    for (auto& expression : expressions) {
+        switch (expression->expressionType) {
+        case ExpressionType::PROPERTY: {
+            if (propertiesInUse.contains(expression)) {
+                expressionsAfterPruning.insert(expression);
+            }
+        } break;
+        case ExpressionType::VARIABLE: {
+            if (variablesInUse.contains(expression)) {
+                expressionsAfterPruning.insert(expression);
+            }
+        } break;
+        case ExpressionType::PATTERN: {
+            if (nodeOrRelInUse.contains(expression)) {
+                expressionsAfterPruning.insert(expression);
+            }
+        } break;
+        default: // We don't track other expression types so always assume they will be in use.
+            expressionsAfterPruning.insert(expression);
+        }
+    }
+    return expression_vector{expressionsAfterPruning.begin(), expressionsAfterPruning.end()};
+}
+
+void ProjectionPushDownOptimizer::preAppendProjection(LogicalOperator* op, idx_t childIdx,
+    binder::expression_vector expressions) {
+    if (expressions.empty()) {
+        // We don't have a way to handle
+        return;
+    }
+    auto projection =
+        std::make_shared<LogicalProjection>(std::move(expressions), op->getChild(childIdx));
+    projection->computeFlatSchema();
+    op->setChild(childIdx, std::move(projection));
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/remove_factorization_rewriter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/remove_factorization_rewriter.cpp
new file mode 100644
index 0000000000..4b54b07556
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/remove_factorization_rewriter.cpp
@@ -0,0 +1,39 @@
+#include "optimizer/remove_factorization_rewriter.h"
+
+#include "common/exception/internal.h"
+#include "optimizer/logical_operator_collector.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace optimizer {
+
+void RemoveFactorizationRewriter::rewrite(planner::LogicalPlan* plan) {
+    auto root = plan->getLastOperator();
+    visitOperator(root);
+    auto collector = LogicalFlattenCollector();
+    collector.collect(root.get());
+    if (collector.hasOperators()) {
+        throw InternalException("Remove factorization rewriter failed.");
+    }
+}
+
+std::shared_ptr<planner::LogicalOperator> RemoveFactorizationRewriter::visitOperator(
+    const std::shared_ptr<planner::LogicalOperator>& op) {
+    // bottom-up traversal
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        op->setChild(i, visitOperator(op->getChild(i)));
+    }
+    auto result = visitOperatorReplaceSwitch(op);
+    result->computeFlatSchema();
+    return result;
+}
+
+std::shared_ptr<planner::LogicalOperator> RemoveFactorizationRewriter::visitFlattenReplace(
+    std::shared_ptr<planner::LogicalOperator> op) {
+    return op->getChild(0);
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/remove_unnecessary_join_optimizer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/remove_unnecessary_join_optimizer.cpp
new file mode 100644
index 0000000000..c307ff7ef2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/remove_unnecessary_join_optimizer.cpp
@@ -0,0 +1,58 @@
+#include "optimizer/remove_unnecessary_join_optimizer.h"
+
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/scan/logical_scan_node_table.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace optimizer {
+
+void RemoveUnnecessaryJoinOptimizer::rewrite(LogicalPlan* plan) {
+    visitOperator(plan->getLastOperator());
+}
+
+std::shared_ptr<LogicalOperator> RemoveUnnecessaryJoinOptimizer::visitOperator(
+    const std::shared_ptr<LogicalOperator>& op) {
+    // bottom-up traversal
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        op->setChild(i, visitOperator(op->getChild(i)));
+    }
+    auto result = visitOperatorReplaceSwitch(op);
+    result->computeFlatSchema();
+    return result;
+}
+
+std::shared_ptr<LogicalOperator> RemoveUnnecessaryJoinOptimizer::visitHashJoinReplace(
+    std::shared_ptr<LogicalOperator> op) {
+    auto hashJoin = (LogicalHashJoin*)op.get();
+    switch (hashJoin->getJoinType()) {
+    case JoinType::MARK:
+    case JoinType::LEFT: {
+        // Do not prune no-trivial join type
+        return op;
+    }
+    default:
+        break;
+    }
+    // TODO(Xiyang): Double check on these changes here.
+    if (op->getChild(1)->getOperatorType() == LogicalOperatorType::SCAN_NODE_TABLE) {
+        const auto scanNode = ku_dynamic_cast<LogicalScanNodeTable*>(op->getChild(1).get());
+        if (scanNode->getProperties().empty()) {
+            // Build side is trivial. Prune build side.
+            return op->getChild(0);
+        }
+    }
+    if (op->getChild(0)->getOperatorType() == LogicalOperatorType::SCAN_NODE_TABLE) {
+        const auto scanNode = ku_dynamic_cast<LogicalScanNodeTable*>(op->getChild(0).get());
+        if (scanNode->getProperties().empty()) {
+            // Probe side is trivial. Prune probe side.
+            return op->getChild(1);
+        }
+    }
+    return op;
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/schema_populator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/schema_populator.cpp
new file mode 100644
index 0000000000..fd7447329a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/schema_populator.cpp
@@ -0,0 +1,15 @@
+#include "optimizer/schema_populator.h"
+
+namespace lbug::optimizer {
+
+static void populateSchemaRecursive(planner::LogicalOperator* op) {
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        populateSchemaRecursive(op->getChild(i).get());
+    }
+    op->computeFactorizedSchema();
+}
+
+void SchemaPopulator::rewrite(planner::LogicalPlan* plan) {
+    populateSchemaRecursive(plan->getLastOperator().get());
+}
+} // namespace lbug::optimizer
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/top_k_optimizer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/top_k_optimizer.cpp
new file mode 100644
index 0000000000..4cbae4be32
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/optimizer/top_k_optimizer.cpp
@@ -0,0 +1,63 @@
+#include "optimizer/top_k_optimizer.h"
+
+#include "planner/operator/logical_limit.h"
+#include "planner/operator/logical_order_by.h"
+
+using namespace lbug::planner;
+using namespace lbug::common;
+
+namespace lbug {
+namespace optimizer {
+
+void TopKOptimizer::rewrite(planner::LogicalPlan* plan) {
+    plan->setLastOperator(visitOperator(plan->getLastOperator()));
+}
+
+std::shared_ptr<LogicalOperator> TopKOptimizer::visitOperator(
+    const std::shared_ptr<LogicalOperator>& op) {
+    // bottom-up traversal
+    for (auto i = 0u; i < op->getNumChildren(); ++i) {
+        op->setChild(i, visitOperator(op->getChild(i)));
+    }
+    auto result = visitOperatorReplaceSwitch(op);
+    result->computeFlatSchema();
+    return result;
+}
+
+// TODO(Xiyang): we should probably remove the projection between ORDER BY and MULTIPLICITY REDUCER
+// We search for pattern
+// ORDER BY -> PROJECTION -> MULTIPLICITY REDUCER -> LIMIT
+// ORDER BY -> MULTIPLICITY REDUCER -> LIMIT
+// and rewrite as TOP_K
+std::shared_ptr<LogicalOperator> TopKOptimizer::visitLimitReplace(
+    std::shared_ptr<LogicalOperator> op) {
+    auto limit = op->ptrCast<LogicalLimit>();
+    if (!limit->hasLimitNum()) {
+        return op; // only skip no limit. No need to rewrite
+    }
+    auto multiplicityReducer = limit->getChild(0);
+    KU_ASSERT(multiplicityReducer->getOperatorType() == LogicalOperatorType::MULTIPLICITY_REDUCER);
+    auto projectionOrOrderBy = multiplicityReducer->getChild(0);
+    std::shared_ptr<LogicalOrderBy> orderBy;
+    if (projectionOrOrderBy->getOperatorType() == LogicalOperatorType::PROJECTION) {
+        if (projectionOrOrderBy->getChild(0)->getOperatorType() != LogicalOperatorType::ORDER_BY) {
+            return op;
+        }
+        orderBy = std::static_pointer_cast<LogicalOrderBy>(projectionOrOrderBy->getChild(0));
+    } else if (projectionOrOrderBy->getOperatorType() == LogicalOperatorType::ORDER_BY) {
+        orderBy = std::static_pointer_cast<LogicalOrderBy>(projectionOrOrderBy);
+    } else {
+        return op;
+    }
+    KU_ASSERT(orderBy != nullptr);
+    if (limit->hasLimitNum()) {
+        orderBy->setLimitNum(limit->getLimitNum());
+    }
+    if (limit->hasSkipNum()) {
+        orderBy->setSkipNum(limit->getSkipNum());
+    }
+    return projectionOrOrderBy;
+}
+
+} // namespace optimizer
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/CMakeLists.txt
new file mode 100644
index 0000000000..46bd1217f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/CMakeLists.txt
@@ -0,0 +1,15 @@
+add_subdirectory(antlr_parser)
+add_subdirectory(expression)
+add_subdirectory(transform)
+add_subdirectory(visitor)
+
+add_library(lbug_parser
+        OBJECT
+        create_macro.cpp
+        parser.cpp
+        parsed_statement_visitor.cpp
+        transformer.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_parser>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/CMakeLists.txt
new file mode 100644
index 0000000000..4c1121ff05
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_parser_antlr_parser
+        OBJECT
+        lbug_cypher_parser.cpp
+        parser_error_listener.cpp
+        parser_error_strategy.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_parser_antlr_parser>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/lbug_cypher_parser.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/lbug_cypher_parser.cpp
new file mode 100644
index 0000000000..08b3da6427
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/lbug_cypher_parser.cpp
@@ -0,0 +1,43 @@
+#include "parser/antlr_parser/lbug_cypher_parser.h"
+
+#include <string>
+
+namespace lbug {
+namespace parser {
+
+void LbugCypherParser::notifyQueryNotConcludeWithReturn(antlr4::Token* startToken) {
+    auto errorMsg = "Query must conclude with RETURN clause";
+    notifyErrorListeners(startToken, errorMsg, nullptr);
+}
+
+void LbugCypherParser::notifyNodePatternWithoutParentheses(std::string nodeName,
+    antlr4::Token* startToken) {
+    auto errorMsg =
+        "Parentheses are required to identify nodes in patterns, i.e. (" + nodeName + ")";
+    notifyErrorListeners(startToken, errorMsg, nullptr);
+}
+
+void LbugCypherParser::notifyInvalidNotEqualOperator(antlr4::Token* startToken) {
+    auto errorMsg = "Unknown operation '!=' (you probably meant to use '<>', which is the operator "
+                    "for inequality testing.)";
+    notifyErrorListeners(startToken, errorMsg, nullptr);
+}
+
+void LbugCypherParser::notifyEmptyToken(antlr4::Token* startToken) {
+    auto errorMsg =
+        "'' is not a valid token name. Token names cannot be empty or contain any null-bytes";
+    notifyErrorListeners(startToken, errorMsg, nullptr);
+}
+
+void LbugCypherParser::notifyReturnNotAtEnd(antlr4::Token* startToken) {
+    auto errorMsg = "RETURN can only be used at the end of the query";
+    notifyErrorListeners(startToken, errorMsg, nullptr);
+}
+
+void LbugCypherParser::notifyNonBinaryComparison(antlr4::Token* startToken) {
+    auto errorMsg = "Non-binary comparison (e.g. a=b=c) is not supported";
+    notifyErrorListeners(startToken, errorMsg, nullptr);
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/parser_error_listener.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/parser_error_listener.cpp
new file mode 100644
index 0000000000..ef265ed665
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/parser_error_listener.cpp
@@ -0,0 +1,36 @@
+#include "parser/antlr_parser/parser_error_listener.h"
+
+#include "common/exception/parser.h"
+#include "common/string_utils.h"
+
+using namespace antlr4;
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+void ParserErrorListener::syntaxError(Recognizer* recognizer, Token* offendingSymbol, size_t line,
+    size_t charPositionInLine, const std::string& msg, std::exception_ptr /*e*/) {
+    auto finalError = msg + " (line: " + std::to_string(line) +
+                      ", offset: " + std::to_string(charPositionInLine) + ")\n" +
+                      formatUnderLineError(*recognizer, *offendingSymbol, line, charPositionInLine);
+    throw ParserException(finalError);
+}
+
+std::string ParserErrorListener::formatUnderLineError(Recognizer& recognizer,
+    const Token& offendingToken, size_t line, size_t charPositionInLine) {
+    auto tokens = (CommonTokenStream*)recognizer.getInputStream();
+    auto input = tokens->getTokenSource()->getInputStream()->toString();
+    auto errorLine = StringUtils::split(input, "\n", false)[line - 1];
+    auto underLine = std::string(" ");
+    for (auto i = 0u; i < charPositionInLine; ++i) {
+        underLine += " ";
+    }
+    for (auto i = offendingToken.getStartIndex(); i <= offendingToken.getStopIndex(); ++i) {
+        underLine += "^";
+    }
+    return "\"" + errorLine + "\"\n" + underLine;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/parser_error_strategy.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/parser_error_strategy.cpp
new file mode 100644
index 0000000000..e88c900777
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/antlr_parser/parser_error_strategy.cpp
@@ -0,0 +1,21 @@
+#include "parser/antlr_parser/parser_error_strategy.h"
+
+namespace lbug {
+namespace parser {
+
+void ParserErrorStrategy::reportNoViableAlternative(antlr4::Parser* recognizer,
+    const antlr4::NoViableAltException& e) {
+    auto tokens = recognizer->getTokenStream();
+    auto errorMsg =
+        tokens ?
+            antlr4::Token::EOF == e.getStartToken()->getType() ?
+            "Unexpected end of input" :
+            "Invalid input <" + tokens->getText(e.getStartToken(), e.getOffendingToken()) + ">" :
+            "Unknown input";
+    auto expectedRuleName = recognizer->getRuleNames()[recognizer->getContext()->getRuleIndex()];
+    errorMsg += ": expected rule " + expectedRuleName;
+    recognizer->notifyErrorListeners(e.getOffendingToken(), errorMsg, make_exception_ptr(e));
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/create_macro.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/create_macro.cpp
new file mode 100644
index 0000000000..2035738a3e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/create_macro.cpp
@@ -0,0 +1,15 @@
+#include "parser/create_macro.h"
+
+namespace lbug {
+namespace parser {
+
+std::vector<std::pair<std::string, ParsedExpression*>> CreateMacro::getDefaultArgs() const {
+    std::vector<std::pair<std::string, ParsedExpression*>> defaultArgsToReturn;
+    for (auto& defaultArg : defaultArgs) {
+        defaultArgsToReturn.emplace_back(defaultArg.first, defaultArg.second.get());
+    }
+    return defaultArgsToReturn;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/CMakeLists.txt
new file mode 100644
index 0000000000..c17a8ea8aa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/CMakeLists.txt
@@ -0,0 +1,12 @@
+add_library(lbug_parser_expression
+        OBJECT
+        parsed_case_expression.cpp
+        parsed_expression.cpp
+        parsed_expression_visitor.cpp
+        parsed_function_expression.cpp
+        parsed_property_expression.cpp
+        parsed_variable_expression.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_parser_expression>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_case_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_case_expression.cpp
new file mode 100644
index 0000000000..e3ea092ca7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_case_expression.cpp
@@ -0,0 +1,52 @@
+#include "parser/expression/parsed_case_expression.h"
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+void ParsedCaseAlternative::serialize(Serializer& serializer) const {
+    whenExpression->serialize(serializer);
+    thenExpression->serialize(serializer);
+}
+
+ParsedCaseAlternative ParsedCaseAlternative::deserialize(Deserializer& deserializer) {
+    auto whenExpression = ParsedExpression::deserialize(deserializer);
+    auto thenExpression = ParsedExpression::deserialize(deserializer);
+    return ParsedCaseAlternative(std::move(whenExpression), std::move(thenExpression));
+}
+
+std::unique_ptr<ParsedCaseExpression> ParsedCaseExpression::deserialize(
+    Deserializer& deserializer) {
+    std::unique_ptr<ParsedExpression> caseExpression;
+    deserializer.deserializeOptionalValue(caseExpression);
+    std::vector<ParsedCaseAlternative> caseAlternatives;
+    deserializer.deserializeVector<ParsedCaseAlternative>(caseAlternatives);
+    std::unique_ptr<ParsedExpression> elseExpression;
+    deserializer.deserializeOptionalValue(elseExpression);
+    return std::make_unique<ParsedCaseExpression>(std::move(caseExpression),
+        std::move(caseAlternatives), std::move(elseExpression));
+}
+
+std::unique_ptr<ParsedExpression> ParsedCaseExpression::copy() const {
+    std::vector<ParsedCaseAlternative> caseAlternativesCopy;
+    caseAlternativesCopy.reserve(caseAlternatives.size());
+    for (auto& caseAlternative : caseAlternatives) {
+        caseAlternativesCopy.push_back(caseAlternative);
+    }
+    return std::make_unique<ParsedCaseExpression>(alias, rawName, copyVector(children),
+        caseExpression ? caseExpression->copy() : nullptr, std::move(caseAlternativesCopy),
+        elseExpression ? elseExpression->copy() : nullptr);
+}
+
+void ParsedCaseExpression::serializeInternal(Serializer& serializer) const {
+    serializer.serializeOptionalValue(caseExpression);
+    serializer.serializeVector(caseAlternatives);
+    serializer.serializeOptionalValue(elseExpression);
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_expression.cpp
new file mode 100644
index 0000000000..5fbdd7fe77
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_expression.cpp
@@ -0,0 +1,82 @@
+#include "parser/expression/parsed_expression.h"
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "parser/expression/parsed_case_expression.h"
+#include "parser/expression/parsed_function_expression.h"
+#include "parser/expression/parsed_literal_expression.h"
+#include "parser/expression/parsed_parameter_expression.h"
+#include "parser/expression/parsed_property_expression.h"
+#include "parser/expression/parsed_subquery_expression.h"
+#include "parser/expression/parsed_variable_expression.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+ParsedExpression::ParsedExpression(ExpressionType type, std::unique_ptr<ParsedExpression> child,
+    std::string rawName)
+    : type{type}, rawName{std::move(rawName)} {
+    children.push_back(std::move(child));
+}
+
+ParsedExpression::ParsedExpression(ExpressionType type, std::unique_ptr<ParsedExpression> left,
+    std::unique_ptr<ParsedExpression> right, std::string rawName)
+    : type{type}, rawName{std::move(rawName)} {
+    children.push_back(std::move(left));
+    children.push_back(std::move(right));
+}
+
+void ParsedExpression::serialize(Serializer& serializer) const {
+    serializer.serializeValue(type);
+    serializer.serializeValue(alias);
+    serializer.serializeValue(rawName);
+    serializer.serializeVectorOfPtrs(children);
+    serializeInternal(serializer);
+}
+
+std::unique_ptr<ParsedExpression> ParsedExpression::deserialize(Deserializer& deserializer) {
+    auto type = ExpressionType::INVALID;
+    std::string alias;
+    std::string rawName;
+    parsed_expr_vector children;
+    deserializer.deserializeValue(type);
+    deserializer.deserializeValue(alias);
+    deserializer.deserializeValue(rawName);
+    deserializer.deserializeVectorOfPtrs(children);
+    std::unique_ptr<ParsedExpression> parsedExpression;
+    switch (type) {
+    case ExpressionType::CASE_ELSE: {
+        parsedExpression = ParsedCaseExpression::deserialize(deserializer);
+    } break;
+    case ExpressionType::FUNCTION: {
+        parsedExpression = ParsedFunctionExpression::deserialize(deserializer);
+    } break;
+    case ExpressionType::LITERAL: {
+        parsedExpression = ParsedLiteralExpression::deserialize(deserializer);
+    } break;
+    case ExpressionType::PARAMETER: {
+        parsedExpression = ParsedParameterExpression::deserialize(deserializer);
+    } break;
+    case ExpressionType::PROPERTY: {
+        parsedExpression = ParsedPropertyExpression::deserialize(deserializer);
+    } break;
+    case ExpressionType::SUBQUERY: {
+        parsedExpression = ParsedSubqueryExpression::deserialize(deserializer);
+    } break;
+    case ExpressionType::VARIABLE: {
+        parsedExpression = ParsedVariableExpression::deserialize(deserializer);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    parsedExpression->alias = std::move(alias);
+    parsedExpression->rawName = std::move(rawName);
+    parsedExpression->children = std::move(children);
+    return parsedExpression;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_expression_visitor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_expression_visitor.cpp
new file mode 100644
index 0000000000..81fa4cefc2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_expression_visitor.cpp
@@ -0,0 +1,229 @@
+#include "parser/expression/parsed_expression_visitor.h"
+
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/function_catalog_entry.h"
+#include "common/exception/not_implemented.h"
+#include "parser/expression/parsed_case_expression.h"
+#include "parser/expression/parsed_function_expression.h"
+#include "parser/expression/parsed_lambda_expression.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace parser {
+
+void ParsedExpressionVisitor::visit(const ParsedExpression* expr) {
+    visitChildren(*expr);
+    visitSwitch(expr);
+}
+
+void ParsedExpressionVisitor::visitUnsafe(ParsedExpression* expr) {
+    visitChildrenUnsafe(*expr);
+    visitSwitchUnsafe(expr);
+}
+
+void ParsedExpressionVisitor::visitSwitch(const ParsedExpression* expr) {
+    switch (expr->getExpressionType()) {
+    case ExpressionType::OR:
+    case ExpressionType::XOR:
+    case ExpressionType::AND:
+    case ExpressionType::NOT:
+    case ExpressionType::EQUALS:
+    case ExpressionType::NOT_EQUALS:
+    case ExpressionType::GREATER_THAN:
+    case ExpressionType::GREATER_THAN_EQUALS:
+    case ExpressionType::LESS_THAN:
+    case ExpressionType::LESS_THAN_EQUALS:
+    case ExpressionType::IS_NULL:
+    case ExpressionType::IS_NOT_NULL:
+    case ExpressionType::FUNCTION: {
+        visitFunctionExpr(expr);
+    } break;
+    case ExpressionType::AGGREGATE_FUNCTION: {
+        visitAggFunctionExpr(expr);
+    } break;
+    case ExpressionType::PROPERTY: {
+        visitPropertyExpr(expr);
+    } break;
+    case ExpressionType::LITERAL: {
+        visitLiteralExpr(expr);
+    } break;
+    case ExpressionType::VARIABLE: {
+        visitVariableExpr(expr);
+    } break;
+    case ExpressionType::PATH: {
+        visitPathExpr(expr);
+    } break;
+    case ExpressionType::PATTERN: {
+        visitNodeRelExpr(expr);
+    } break;
+    case ExpressionType::PARAMETER: {
+        visitParamExpr(expr);
+    } break;
+    case ExpressionType::SUBQUERY: {
+        visitSubqueryExpr(expr);
+    } break;
+    case ExpressionType::CASE_ELSE: {
+        visitCaseExpr(expr);
+    } break;
+    case ExpressionType::GRAPH: {
+        visitGraphExpr(expr);
+    } break;
+    case ExpressionType::LAMBDA: {
+        visitLambdaExpr(expr);
+    } break;
+    case ExpressionType::STAR: {
+        visitStar(expr);
+    } break;
+        // LCOV_EXCL_START
+    default:
+        throw NotImplementedException("ExpressionVisitor::visitSwitch");
+        // LCOV_EXCL_STOP
+    }
+}
+
+void ParsedExpressionVisitor::visitChildren(const ParsedExpression& expr) {
+    switch (expr.getExpressionType()) {
+    case ExpressionType::CASE_ELSE: {
+        visitCaseChildren(expr);
+    } break;
+    case ExpressionType::LAMBDA: {
+        auto& lambda = expr.constCast<ParsedLambdaExpression>();
+        visit(lambda.getFunctionExpr());
+    } break;
+    default: {
+        for (auto i = 0u; i < expr.getNumChildren(); ++i) {
+            visit(expr.getChild(i));
+        }
+    }
+    }
+}
+
+void ParsedExpressionVisitor::visitChildrenUnsafe(ParsedExpression& expr) {
+    switch (expr.getExpressionType()) {
+    case ExpressionType::CASE_ELSE: {
+        visitCaseChildrenUnsafe(expr);
+    } break;
+    default: {
+        for (auto i = 0u; i < expr.getNumChildren(); ++i) {
+            visitUnsafe(expr.getChild(i));
+        }
+    }
+    }
+}
+
+void ParsedExpressionVisitor::visitCaseChildren(const ParsedExpression& expr) {
+    auto& caseExpr = expr.constCast<ParsedCaseExpression>();
+    if (caseExpr.hasCaseExpression()) {
+        visit(caseExpr.getCaseExpression());
+    }
+    for (auto i = 0u; i < caseExpr.getNumCaseAlternative(); ++i) {
+        auto alternative = caseExpr.getCaseAlternative(i);
+        visit(alternative->whenExpression.get());
+        visit(alternative->thenExpression.get());
+    }
+    if (caseExpr.hasElseExpression()) {
+        visit(caseExpr.getElseExpression());
+    }
+}
+
+void ParsedExpressionVisitor::visitCaseChildrenUnsafe(ParsedExpression& expr) {
+    auto& caseExpr = expr.cast<ParsedCaseExpression>();
+    if (caseExpr.hasCaseExpression()) {
+        visitUnsafe(caseExpr.getCaseExpression());
+    }
+    for (auto i = 0u; i < caseExpr.getNumCaseAlternative(); ++i) {
+        auto alternative = caseExpr.getCaseAlternative(i);
+        visitUnsafe(alternative->whenExpression.get());
+        visitUnsafe(alternative->thenExpression.get());
+    }
+    if (caseExpr.hasElseExpression()) {
+        visitUnsafe(caseExpr.getElseExpression());
+    }
+}
+
+void ReadWriteExprAnalyzer::visitFunctionExpr(const ParsedExpression* expr) {
+    if (expr->getExpressionType() != ExpressionType::FUNCTION) {
+        // Can be AND/OR/... which guarantees to be readonly.
+        return;
+    }
+    auto funcName = expr->constCast<ParsedFunctionExpression>().getFunctionName();
+    auto catalog = Catalog::Get(*context);
+    // Assume user cannot add function with sideeffect, i.e. all non-readonly function is
+    // registered when database starts.
+    auto transaction = &transaction::DUMMY_TRANSACTION;
+    if (!catalog->containsFunction(transaction, funcName)) {
+        return;
+    }
+    auto entry = catalog->getFunctionEntry(transaction, funcName);
+    if (entry->getType() != CatalogEntryType::SCALAR_FUNCTION_ENTRY) {
+        // Can be macro function which guarantees to be readonly.
+        return;
+    }
+    auto& funcSet = entry->constPtrCast<FunctionCatalogEntry>()->getFunctionSet();
+    KU_ASSERT(!funcSet.empty());
+    if (!funcSet[0]->isReadOnly) {
+        readOnly = false;
+    }
+}
+
+std::unique_ptr<ParsedExpression> MacroParameterReplacer::replace(
+    std::unique_ptr<ParsedExpression> input) {
+    if (nameToExpr.contains(input->getRawName())) {
+        return nameToExpr.at(input->getRawName())->copy();
+    }
+    visitUnsafe(input.get());
+    return input;
+}
+
+void MacroParameterReplacer::visitSwitchUnsafe(ParsedExpression* expr) {
+    switch (expr->getExpressionType()) {
+    case ExpressionType::CASE_ELSE: {
+        auto& caseExpr = expr->cast<ParsedCaseExpression>();
+        if (caseExpr.hasCaseExpression()) {
+            auto replace = getReplace(caseExpr.getCaseExpression()->getRawName());
+            if (replace) {
+                caseExpr.setCaseExpression(std::move(replace));
+            }
+        }
+        for (auto i = 0u; i < caseExpr.getNumCaseAlternative(); i++) {
+            auto caseAlternative = caseExpr.getCaseAlternativeUnsafe(i);
+            auto whenReplace = getReplace(caseAlternative->whenExpression->getRawName());
+            auto thenReplace = getReplace(caseAlternative->thenExpression->getRawName());
+            if (whenReplace) {
+                caseAlternative->whenExpression = std::move(whenReplace);
+            }
+            if (thenReplace) {
+                caseAlternative->thenExpression = std::move(thenReplace);
+            }
+        }
+        if (caseExpr.hasElseExpression()) {
+            auto replace = getReplace(caseExpr.getElseExpression()->getRawName());
+            if (replace) {
+                caseExpr.setElseExpression(std::move(replace));
+            }
+        }
+    } break;
+    default: {
+        for (auto i = 0u; i < expr->getNumChildren(); ++i) {
+            auto child = expr->getChild(i);
+            auto replace = getReplace(child->getRawName());
+            if (replace) {
+                expr->setChild(i, std::move(replace));
+            }
+        }
+    }
+    }
+}
+
+std::unique_ptr<ParsedExpression> MacroParameterReplacer::getReplace(const std::string& name) {
+    if (nameToExpr.contains(name)) {
+        return nameToExpr.at(name)->copy();
+    }
+    return nullptr;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_function_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_function_expression.cpp
new file mode 100644
index 0000000000..e61063e38c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_function_expression.cpp
@@ -0,0 +1,31 @@
+#include "parser/expression/parsed_function_expression.h"
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<ParsedFunctionExpression> ParsedFunctionExpression::deserialize(
+    Deserializer& deserializer) {
+    bool isDistinct = false;
+    deserializer.deserializeValue(isDistinct);
+    std::string functionName;
+    deserializer.deserializeValue(functionName);
+    std::vector<std::string> optionalArguments;
+    deserializer.deserializeVector(optionalArguments);
+    auto result = std::make_unique<ParsedFunctionExpression>(std::move(functionName), isDistinct);
+    result->setOptionalArguments(std::move(optionalArguments));
+    return result;
+}
+
+void ParsedFunctionExpression::serializeInternal(Serializer& serializer) const {
+    serializer.serializeValue(isDistinct);
+    serializer.serializeValue(functionName);
+    serializer.serializeVector(optionalArguments);
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_property_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_property_expression.cpp
new file mode 100644
index 0000000000..fa4d613110
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_property_expression.cpp
@@ -0,0 +1,18 @@
+#include "parser/expression/parsed_property_expression.h"
+
+#include "common/serializer/deserializer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<ParsedPropertyExpression> ParsedPropertyExpression::deserialize(
+    Deserializer& deserializer) {
+    std::string propertyName;
+    deserializer.deserializeValue(propertyName);
+    return std::make_unique<ParsedPropertyExpression>(std::move(propertyName));
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_variable_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_variable_expression.cpp
new file mode 100644
index 0000000000..07bdcb9eeb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/expression/parsed_variable_expression.cpp
@@ -0,0 +1,18 @@
+#include "parser/expression/parsed_variable_expression.h"
+
+#include "common/serializer/deserializer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<ParsedVariableExpression> ParsedVariableExpression::deserialize(
+    Deserializer& deserializer) {
+    std::string variableName;
+    deserializer.deserializeValue(variableName);
+    return std::make_unique<ParsedVariableExpression>(std::move(variableName));
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/parsed_statement_visitor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/parsed_statement_visitor.cpp
new file mode 100644
index 0000000000..4bd54f65a3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/parsed_statement_visitor.cpp
@@ -0,0 +1,155 @@
+#include "parser/parsed_statement_visitor.h"
+
+#include "common/cast.h"
+#include "parser/explain_statement.h"
+#include "parser/query/regular_query.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+void StatementVisitor::visit(const Statement& statement) {
+    switch (statement.getStatementType()) {
+    case StatementType::QUERY: {
+        visitQuery(statement);
+    } break;
+    case StatementType::CREATE_SEQUENCE: {
+        visitCreateSequence(statement);
+    } break;
+    case StatementType::DROP: {
+        visitDrop(statement);
+    } break;
+    case StatementType::CREATE_TABLE: {
+        visitCreateTable(statement);
+    } break;
+    case StatementType::CREATE_TYPE: {
+        visitCreateType(statement);
+    } break;
+    case StatementType::ALTER: {
+        visitAlter(statement);
+    } break;
+    case StatementType::COPY_FROM: {
+        visitCopyFrom(statement);
+    } break;
+    case StatementType::COPY_TO: {
+        visitCopyTo(statement);
+    } break;
+    case StatementType::STANDALONE_CALL: {
+        visitStandaloneCall(statement);
+    } break;
+    case StatementType::EXPLAIN: {
+        visitExplain(statement);
+    } break;
+    case StatementType::CREATE_MACRO: {
+        visitCreateMacro(statement);
+    } break;
+    case StatementType::TRANSACTION: {
+        visitTransaction(statement);
+    } break;
+    case StatementType::EXTENSION: {
+        visitExtension(statement);
+    } break;
+    case StatementType::EXPORT_DATABASE: {
+        visitExportDatabase(statement);
+    } break;
+    case StatementType::IMPORT_DATABASE: {
+        visitImportDatabase(statement);
+    } break;
+    case StatementType::ATTACH_DATABASE: {
+        visitAttachDatabase(statement);
+    } break;
+    case StatementType::DETACH_DATABASE: {
+        visitDetachDatabase(statement);
+    } break;
+    case StatementType::USE_DATABASE: {
+        visitUseDatabase(statement);
+    } break;
+    case StatementType::STANDALONE_CALL_FUNCTION: {
+        visitStandaloneCallFunction(statement);
+    } break;
+    case StatementType::EXTENSION_CLAUSE: {
+        visitExtensionClause(statement);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void StatementVisitor::visitExplain(const Statement& statement) {
+    auto& explainStatement = ku_dynamic_cast<const ExplainStatement&>(statement);
+    visit(*explainStatement.getStatementToExplain());
+}
+
+void StatementVisitor::visitQuery(const Statement& statement) {
+    auto& regularQuery = ku_dynamic_cast<const RegularQuery&>(statement);
+    for (auto i = 0u; i < regularQuery.getNumSingleQueries(); ++i) {
+        visitSingleQuery(regularQuery.getSingleQuery(i));
+    }
+}
+
+void StatementVisitor::visitSingleQuery(const SingleQuery* singleQuery) {
+    for (auto i = 0u; i < singleQuery->getNumQueryParts(); ++i) {
+        visitQueryPart(singleQuery->getQueryPart(i));
+    }
+    for (auto i = 0u; i < singleQuery->getNumReadingClauses(); ++i) {
+        visitReadingClause(singleQuery->getReadingClause(i));
+    }
+    for (auto i = 0u; i < singleQuery->getNumUpdatingClauses(); ++i) {
+        visitUpdatingClause(singleQuery->getUpdatingClause(i));
+    }
+    if (singleQuery->hasReturnClause()) {
+        visitReturnClause(singleQuery->getReturnClause());
+    }
+}
+
+void StatementVisitor::visitQueryPart(const QueryPart* queryPart) {
+    for (auto i = 0u; i < queryPart->getNumReadingClauses(); ++i) {
+        visitReadingClause(queryPart->getReadingClause(i));
+    }
+    for (auto i = 0u; i < queryPart->getNumUpdatingClauses(); ++i) {
+        visitUpdatingClause(queryPart->getUpdatingClause(i));
+    }
+    visitWithClause(queryPart->getWithClause());
+}
+
+void StatementVisitor::visitReadingClause(const ReadingClause* readingClause) {
+    switch (readingClause->getClauseType()) {
+    case ClauseType::MATCH: {
+        visitMatch(readingClause);
+    } break;
+    case ClauseType::UNWIND: {
+        visitUnwind(readingClause);
+    } break;
+    case ClauseType::IN_QUERY_CALL: {
+        visitInQueryCall(readingClause);
+    } break;
+    case ClauseType::LOAD_FROM: {
+        visitLoadFrom(readingClause);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void StatementVisitor::visitUpdatingClause(const UpdatingClause* updatingClause) {
+    switch (updatingClause->getClauseType()) {
+    case ClauseType::SET: {
+        visitSet(updatingClause);
+    } break;
+    case ClauseType::DELETE_: {
+        visitDelete(updatingClause);
+    } break;
+    case ClauseType::INSERT: {
+        visitInsert(updatingClause);
+    } break;
+    case ClauseType::MERGE: {
+        visitMerge(updatingClause);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/parser.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/parser.cpp
new file mode 100644
index 0000000000..2b15d41380
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/parser.cpp
@@ -0,0 +1,54 @@
+#include "parser/parser.h"
+
+// ANTLR4 generates code with unused parameters.
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wunused-parameter"
+#include "cypher_lexer.h"
+#pragma GCC diagnostic pop
+
+#include "common/exception/parser.h"
+#include "common/string_utils.h"
+#include "parser/antlr_parser/lbug_cypher_parser.h"
+#include "parser/antlr_parser/parser_error_listener.h"
+#include "parser/antlr_parser/parser_error_strategy.h"
+#include "parser/transformer.h"
+
+using namespace antlr4;
+
+namespace lbug {
+namespace parser {
+
+std::vector<std::shared_ptr<Statement>> Parser::parseQuery(std::string_view query,
+    std::vector<extension::TransformerExtension*> transformerExtensions) {
+    auto queryStr = std::string(query);
+    queryStr = common::StringUtils::ltrim(queryStr);
+    queryStr = common::StringUtils::ltrimNewlines(queryStr);
+    // LCOV_EXCL_START
+    // We should have enforced this in connection, but I also realize empty query will cause
+    // antlr to hang. So enforce a duplicate check here.
+    if (queryStr.empty()) {
+        throw common::ParserException(
+            "Cannot parse empty query. This should be handled in connection.");
+    }
+    // LCOV_EXCL_STOP
+
+    auto inputStream = ANTLRInputStream(queryStr);
+    auto parserErrorListener = ParserErrorListener();
+
+    auto cypherLexer = CypherLexer(&inputStream);
+    cypherLexer.removeErrorListeners();
+    cypherLexer.addErrorListener(&parserErrorListener);
+    auto tokens = CommonTokenStream(&cypherLexer);
+    tokens.fill();
+
+    auto lbugCypherParser = LbugCypherParser(&tokens);
+    lbugCypherParser.removeErrorListeners();
+    lbugCypherParser.addErrorListener(&parserErrorListener);
+    lbugCypherParser.setErrorHandler(std::make_shared<ParserErrorStrategy>());
+
+    Transformer transformer(*lbugCypherParser.ku_Statements(), std::move(transformerExtensions));
+    return transformer.transform();
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/CMakeLists.txt
new file mode 100644
index 0000000000..541cd6845b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/CMakeLists.txt
@@ -0,0 +1,22 @@
+add_library(lbug_parser_transform
+        OBJECT
+        transform_copy.cpp
+        transform_ddl.cpp
+        transform_expression.cpp
+        transform_graph_pattern.cpp
+        transform_macro.cpp
+        transform_projection.cpp
+        transform_query.cpp
+        transform_reading_clause.cpp
+        transform_standalone_call.cpp
+        transform_transaction.cpp
+        transform_updating_clause.cpp
+        transform_extension.cpp
+        transform_port_db.cpp
+        transform_attach_database.cpp
+        transform_detach_database.cpp
+        transform_use_database.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_parser_transform>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_attach_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_attach_database.cpp
new file mode 100644
index 0000000000..e7b141ff1a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_attach_database.cpp
@@ -0,0 +1,19 @@
+#include "parser/attach_database.h"
+#include "parser/transformer.h"
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformAttachDatabase(
+    CypherParser::KU_AttachDatabaseContext& ctx) {
+    auto dbPath = transformStringLiteral(*ctx.StringLiteral());
+    auto dbAlias = ctx.oC_SchemaName() ? transformSchemaName(*ctx.oC_SchemaName()) : "";
+    auto dbType = transformSymbolicName(*ctx.oC_SymbolicName());
+    auto attachOption = ctx.kU_Options() ? transformOptions(*ctx.kU_Options()) : options_t{};
+    AttachInfo attachInfo{std::move(dbPath), std::move(dbAlias), std::move(dbType),
+        std::move(attachOption)};
+    return std::make_unique<AttachDatabase>(std::move(attachInfo));
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_copy.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_copy.cpp
new file mode 100644
index 0000000000..a169938656
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_copy.cpp
@@ -0,0 +1,109 @@
+#include "common/assert.h"
+#include "parser/copy.h"
+#include "parser/expression/parsed_literal_expression.h"
+#include "parser/scan_source.h"
+#include "parser/transformer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformCopyTo(CypherParser::KU_CopyTOContext& ctx) {
+    std::string filePath = transformStringLiteral(*ctx.StringLiteral());
+    auto regularQuery = transformQuery(*ctx.oC_Query());
+    auto copyTo = std::make_unique<CopyTo>(std::move(filePath), std::move(regularQuery));
+    if (ctx.kU_Options()) {
+        copyTo->setParsingOption(transformOptions(*ctx.kU_Options()));
+    }
+    return copyTo;
+}
+
+std::unique_ptr<Statement> Transformer::transformCopyFrom(CypherParser::KU_CopyFromContext& ctx) {
+    auto source = transformScanSource(*ctx.kU_ScanSource());
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto copyFrom = std::make_unique<CopyFrom>(std::move(source), std::move(tableName));
+    CopyFromColumnInfo info;
+    info.inputColumnOrder = ctx.kU_ColumnNames();
+    if (ctx.kU_ColumnNames()) {
+        info.columnNames = transformColumnNames(*ctx.kU_ColumnNames());
+    }
+    if (ctx.kU_Options()) {
+        copyFrom->setParsingOption(transformOptions(*ctx.kU_Options()));
+    }
+    copyFrom->setColumnInfo(std::move(info));
+    return copyFrom;
+}
+
+std::unique_ptr<Statement> Transformer::transformCopyFromByColumn(
+    CypherParser::KU_CopyFromByColumnContext& ctx) {
+    auto source = std::make_unique<FileScanSource>(transformFilePaths(ctx.StringLiteral()));
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto copyFrom = std::make_unique<CopyFrom>(std::move(source), std::move(tableName));
+    copyFrom->setByColumn();
+    return copyFrom;
+}
+
+std::vector<std::string> Transformer::transformColumnNames(
+    CypherParser::KU_ColumnNamesContext& ctx) {
+    std::vector<std::string> columnNames;
+    for (auto& schemaName : ctx.oC_SchemaName()) {
+        columnNames.push_back(transformSchemaName(*schemaName));
+    }
+    return columnNames;
+}
+
+std::vector<std::string> Transformer::transformFilePaths(
+    const std::vector<antlr4::tree::TerminalNode*>& stringLiteral) {
+    std::vector<std::string> csvFiles;
+    csvFiles.reserve(stringLiteral.size());
+    for (auto& csvFile : stringLiteral) {
+        csvFiles.push_back(transformStringLiteral(*csvFile));
+    }
+    return csvFiles;
+}
+
+std::unique_ptr<BaseScanSource> Transformer::transformScanSource(
+    CypherParser::KU_ScanSourceContext& ctx) {
+    if (ctx.kU_FilePaths()) {
+        auto filePaths = transformFilePaths(ctx.kU_FilePaths()->StringLiteral());
+        return std::make_unique<FileScanSource>(std::move(filePaths));
+    } else if (ctx.oC_Query()) {
+        auto query = transformQuery(*ctx.oC_Query());
+        return std::make_unique<QueryScanSource>(std::move(query));
+    } else if (ctx.oC_Variable()) {
+        std::vector<std::string> objectNames;
+        objectNames.push_back(transformVariable(*ctx.oC_Variable()));
+        if (ctx.oC_SchemaName()) {
+            objectNames.push_back(transformSchemaName(*ctx.oC_SchemaName()));
+        }
+        return std::make_unique<ObjectScanSource>(std::move(objectNames));
+    } else if (ctx.oC_FunctionInvocation()) {
+        auto functionExpression = transformFunctionInvocation(*ctx.oC_FunctionInvocation());
+        return std::make_unique<TableFuncScanSource>(std::move(functionExpression));
+    } else if (ctx.oC_Parameter()) {
+        auto paramExpression = transformParameterExpression(*ctx.oC_Parameter());
+        return std::make_unique<ParameterScanSource>(std::move(paramExpression));
+    }
+    KU_UNREACHABLE;
+}
+
+options_t Transformer::transformOptions(CypherParser::KU_OptionsContext& ctx) {
+    options_t options;
+    for (auto loadOption : ctx.kU_Option()) {
+        auto optionName = transformSymbolicName(*loadOption->oC_SymbolicName());
+        // Check if the literal exists, otherwise set the value to true by default
+        if (loadOption->oC_Literal()) {
+            // If there is a literal, transform it and use it as the value
+            options.emplace(optionName, transformLiteral(*loadOption->oC_Literal()));
+        } else {
+            // If no literal is provided, set the default value to true
+            options.emplace(optionName,
+                std::make_unique<ParsedLiteralExpression>(Value(true), "true"));
+        }
+    }
+    return options;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_ddl.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_ddl.cpp
new file mode 100644
index 0000000000..0780959741
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_ddl.cpp
@@ -0,0 +1,395 @@
+#include "common/exception/parser.h"
+#include "common/string_format.h"
+#include "parser/ddl/alter.h"
+#include "parser/ddl/create_sequence.h"
+#include "parser/ddl/create_table.h"
+#include "parser/ddl/create_type.h"
+#include "parser/ddl/drop.h"
+#include "parser/ddl/drop_info.h"
+#include "parser/transformer.h"
+
+using namespace lbug::common;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformAlterTable(
+    CypherParser::KU_AlterTableContext& ctx) {
+    if (ctx.kU_AlterOptions()->kU_AddProperty()) {
+        return transformAddProperty(ctx);
+    }
+    if (ctx.kU_AlterOptions()->kU_DropProperty()) {
+        return transformDropProperty(ctx);
+    }
+    if (ctx.kU_AlterOptions()->kU_RenameTable()) {
+        return transformRenameTable(ctx);
+    }
+    if (ctx.kU_AlterOptions()->kU_AddFromToConnection()) {
+        return transformAddFromToConnection(ctx);
+    }
+    if (ctx.kU_AlterOptions()->kU_DropFromToConnection()) {
+        return transformDropFromToConnection(ctx);
+    }
+    return transformRenameProperty(ctx);
+}
+
+std::string Transformer::getPKName(CypherParser::KU_CreateNodeTableContext& ctx) {
+    auto pkCount = 0;
+    std::string pkName;
+    auto& propertyDefinitions = *ctx.kU_PropertyDefinitions();
+    for (auto& definition : propertyDefinitions.kU_PropertyDefinition()) {
+        if (definition->PRIMARY() && definition->KEY()) {
+            pkCount++;
+            pkName = transformPrimaryKey(*definition->kU_ColumnDefinition());
+        }
+    }
+    if (ctx.kU_CreateNodeConstraint()) {
+        // In the case where no pkName has been found, or the Node Constraint's name is different
+        // than the pkName found, add the counter.
+        if (pkCount == 0 || transformPrimaryKey(*ctx.kU_CreateNodeConstraint()) != pkName) {
+            pkCount++;
+        }
+        pkName = transformPrimaryKey(*ctx.kU_CreateNodeConstraint());
+    }
+    if (pkCount == 0) {
+        // Raise exception when no PRIMARY KEY is specified.
+        throw ParserException("Can not find primary key.");
+    } else if (pkCount > 1) {
+        // Raise exception when multiple PRIMARY KEY are specified.
+        throw ParserException("Found multiple primary keys.");
+    }
+    return pkName;
+}
+
+ConflictAction Transformer::transformConflictAction(CypherParser::KU_IfNotExistsContext* ctx) {
+    if (ctx != nullptr) {
+        return ConflictAction::ON_CONFLICT_DO_NOTHING;
+    }
+    return ConflictAction::ON_CONFLICT_THROW;
+}
+
+std::unique_ptr<Statement> Transformer::transformCreateNodeTable(
+    CypherParser::KU_CreateNodeTableContext& ctx) {
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto createTableInfo =
+        CreateTableInfo(TableType::NODE, tableName, transformConflictAction(ctx.kU_IfNotExists()));
+    // If CREATE NODE TABLE AS syntax
+    if (ctx.oC_Query()) {
+        return std::make_unique<CreateTable>(std::move(createTableInfo),
+            std::make_unique<QueryScanSource>(transformQuery(*ctx.oC_Query())));
+    } else {
+        createTableInfo.propertyDefinitions =
+            transformPropertyDefinitions(*ctx.kU_PropertyDefinitions());
+        createTableInfo.extraInfo = std::make_unique<ExtraCreateNodeTableInfo>(getPKName(ctx));
+        return std::make_unique<CreateTable>(std::move(createTableInfo));
+    }
+}
+
+std::unique_ptr<Statement> Transformer::transformCreateRelGroup(
+    CypherParser::KU_CreateRelTableContext& ctx) {
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    std::string relMultiplicity = "MANY_MANY";
+    if (ctx.oC_SymbolicName()) {
+        relMultiplicity = transformSymbolicName(*ctx.oC_SymbolicName());
+    }
+    options_t options;
+    if (ctx.kU_Options()) {
+        options = transformOptions(*ctx.kU_Options());
+    }
+    std::vector<std::pair<std::string, std::string>> fromToPairs;
+    for (auto& fromTo : ctx.kU_FromToConnections()->kU_FromToConnection()) {
+        auto src = transformSchemaName(*fromTo->oC_SchemaName(0));
+        auto dst = transformSchemaName(*fromTo->oC_SchemaName(1));
+        fromToPairs.emplace_back(src, dst);
+    }
+    std::unique_ptr<ExtraCreateTableInfo> extraInfo =
+        std::make_unique<ExtraCreateRelTableGroupInfo>(relMultiplicity, std::move(fromToPairs),
+            std::move(options));
+    auto conflictAction = transformConflictAction(ctx.kU_IfNotExists());
+    auto createTableInfo = CreateTableInfo(common::TableType::REL, tableName, conflictAction);
+    if (ctx.kU_PropertyDefinitions()) {
+        createTableInfo.propertyDefinitions =
+            transformPropertyDefinitions(*ctx.kU_PropertyDefinitions());
+    }
+    createTableInfo.extraInfo = std::move(extraInfo);
+    if (ctx.oC_Query()) {
+        auto scanSource = std::make_unique<QueryScanSource>(transformQuery(*ctx.oC_Query()));
+        return std::make_unique<CreateTable>(std::move(createTableInfo), std::move(scanSource));
+    } else {
+        return std::make_unique<CreateTable>(std::move(createTableInfo));
+    }
+}
+
+std::unique_ptr<Statement> Transformer::transformCreateSequence(
+    CypherParser::KU_CreateSequenceContext& ctx) {
+    auto sequenceName = transformSchemaName(*ctx.oC_SchemaName());
+    auto createSequenceInfo = CreateSequenceInfo(sequenceName,
+        ctx.kU_IfNotExists() ? common::ConflictAction::ON_CONFLICT_DO_NOTHING :
+                               common::ConflictAction::ON_CONFLICT_THROW);
+    std::unordered_set<SequenceInfoType> applied;
+    for (auto seqOption : ctx.kU_SequenceOptions()) {
+        SequenceInfoType type; // NOLINT(*-init-variables)
+        std::string typeString;
+        CypherParser::OC_IntegerLiteralContext* valCtx = nullptr;
+        std::string* valOption = nullptr;
+        if (seqOption->kU_StartWith()) {
+            type = SequenceInfoType::START;
+            typeString = "START";
+            valCtx = seqOption->kU_StartWith()->oC_IntegerLiteral();
+            valOption = &createSequenceInfo.startWith;
+            *valOption = seqOption->kU_StartWith()->MINUS() ? "-" : "";
+        } else if (seqOption->kU_IncrementBy()) {
+            type = SequenceInfoType::INCREMENT;
+            typeString = "INCREMENT";
+            valCtx = seqOption->kU_IncrementBy()->oC_IntegerLiteral();
+            valOption = &createSequenceInfo.increment;
+            *valOption = seqOption->kU_IncrementBy()->MINUS() ? "-" : "";
+        } else if (seqOption->kU_MinValue()) {
+            type = SequenceInfoType::MINVALUE;
+            typeString = "MINVALUE";
+            if (!seqOption->kU_MinValue()->NO()) {
+                valCtx = seqOption->kU_MinValue()->oC_IntegerLiteral();
+                valOption = &createSequenceInfo.minValue;
+                *valOption = seqOption->kU_MinValue()->MINUS() ? "-" : "";
+            }
+        } else if (seqOption->kU_MaxValue()) {
+            type = SequenceInfoType::MAXVALUE;
+            typeString = "MAXVALUE";
+            if (!seqOption->kU_MaxValue()->NO()) {
+                valCtx = seqOption->kU_MaxValue()->oC_IntegerLiteral();
+                valOption = &createSequenceInfo.maxValue;
+                *valOption = seqOption->kU_MaxValue()->MINUS() ? "-" : "";
+            }
+        } else { // seqOption->kU_Cycle()
+            type = SequenceInfoType::CYCLE;
+            typeString = "CYCLE";
+            if (!seqOption->kU_Cycle()->NO()) {
+                createSequenceInfo.cycle = true;
+            }
+        }
+        if (applied.find(type) != applied.end()) {
+            throw ParserException(typeString + " should be passed at most once.");
+        }
+        applied.insert(type);
+
+        if (valCtx && valOption) {
+            *valOption += valCtx->DecimalInteger()->getText();
+        }
+    }
+    return std::make_unique<CreateSequence>(std::move(createSequenceInfo));
+}
+
+std::unique_ptr<Statement> Transformer::transformCreateType(
+    CypherParser::KU_CreateTypeContext& ctx) {
+    auto name = transformSchemaName(*ctx.oC_SchemaName());
+    auto type = transformDataType(*ctx.kU_DataType());
+    return std::make_unique<CreateType>(name, type);
+}
+
+DropType transformDropType(CypherParser::KU_DropContext& ctx) {
+    if (ctx.TABLE()) {
+        return DropType::TABLE;
+    } else if (ctx.SEQUENCE()) {
+        return DropType::SEQUENCE;
+    } else if (ctx.MACRO()) {
+        return DropType::MACRO;
+    } else {
+        KU_UNREACHABLE;
+    }
+}
+
+std::unique_ptr<Statement> Transformer::transformDrop(CypherParser::KU_DropContext& ctx) {
+    auto name = transformSchemaName(*ctx.oC_SchemaName());
+    auto dropType = transformDropType(ctx);
+    auto conflictAction = ctx.kU_IfExists() ? common::ConflictAction::ON_CONFLICT_DO_NOTHING :
+                                              common::ConflictAction::ON_CONFLICT_THROW;
+    return std::make_unique<Drop>(DropInfo{std::move(name), dropType, conflictAction});
+}
+
+std::unique_ptr<Statement> Transformer::transformRenameTable(
+    CypherParser::KU_AlterTableContext& ctx) {
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto newName = transformSchemaName(*ctx.kU_AlterOptions()->kU_RenameTable()->oC_SchemaName());
+    auto extraInfo = std::make_unique<ExtraRenameTableInfo>(std::move(newName));
+    auto info = AlterInfo(AlterType::RENAME, tableName, std::move(extraInfo));
+    return std::make_unique<Alter>(std::move(info));
+}
+
+std::unique_ptr<Statement> Transformer::transformAddFromToConnection(
+    CypherParser::KU_AlterTableContext& ctx) {
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto schemaNameCtx =
+        ctx.kU_AlterOptions()->kU_AddFromToConnection()->kU_FromToConnection()->oC_SchemaName();
+    KU_ASSERT(schemaNameCtx.size() == 2);
+    auto srcTableName = transformSchemaName(*schemaNameCtx[0]);
+    auto dstTableName = transformSchemaName(*schemaNameCtx[1]);
+    auto extraInfo = std::make_unique<ExtraAddFromToConnection>(std::move(srcTableName),
+        std::move(dstTableName));
+    ConflictAction action = ConflictAction::ON_CONFLICT_THROW;
+    if (ctx.kU_AlterOptions()->kU_AddFromToConnection()->kU_IfNotExists()) {
+        action = ConflictAction::ON_CONFLICT_DO_NOTHING;
+    }
+    auto info = AlterInfo(AlterType::ADD_FROM_TO_CONNECTION, std::move(tableName),
+        std::move(extraInfo), action);
+    return std::make_unique<Alter>(std::move(info));
+}
+
+std::unique_ptr<Statement> Transformer::transformDropFromToConnection(
+    CypherParser::KU_AlterTableContext& ctx) {
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto schemaNameCtx =
+        ctx.kU_AlterOptions()->kU_DropFromToConnection()->kU_FromToConnection()->oC_SchemaName();
+    KU_ASSERT(schemaNameCtx.size() == 2);
+    auto srcTableName = transformSchemaName(*schemaNameCtx[0]);
+    auto dstTableName = transformSchemaName(*schemaNameCtx[1]);
+    auto extraInfo = std::make_unique<ExtraAddFromToConnection>(std::move(srcTableName),
+        std::move(dstTableName));
+    ConflictAction action = ConflictAction::ON_CONFLICT_THROW;
+    if (ctx.kU_AlterOptions()->kU_DropFromToConnection()->kU_IfExists()) {
+        action = ConflictAction::ON_CONFLICT_DO_NOTHING;
+    }
+    auto info = AlterInfo(AlterType::DROP_FROM_TO_CONNECTION, std::move(tableName),
+        std::move(extraInfo), action);
+    return std::make_unique<Alter>(std::move(info));
+}
+
+std::unique_ptr<Statement> Transformer::transformAddProperty(
+    CypherParser::KU_AlterTableContext& ctx) {
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto addPropertyCtx = ctx.kU_AlterOptions()->kU_AddProperty();
+    auto propertyName = transformPropertyKeyName(*addPropertyCtx->oC_PropertyKeyName());
+    auto dataType = transformDataType(*addPropertyCtx->kU_DataType());
+    std::unique_ptr<ParsedExpression> defaultValue = nullptr;
+    if (addPropertyCtx->kU_Default()) {
+        defaultValue = transformExpression(*addPropertyCtx->kU_Default()->oC_Expression());
+    }
+    auto extraInfo = std::make_unique<ExtraAddPropertyInfo>(std::move(propertyName),
+        std::move(dataType), std::move(defaultValue));
+    ConflictAction action = ConflictAction::ON_CONFLICT_THROW;
+    if (addPropertyCtx->kU_IfNotExists()) {
+        action = ConflictAction::ON_CONFLICT_DO_NOTHING;
+    }
+    auto info = AlterInfo(AlterType::ADD_PROPERTY, tableName, std::move(extraInfo), action);
+    return std::make_unique<Alter>(std::move(info));
+}
+
+std::unique_ptr<Statement> Transformer::transformDropProperty(
+    CypherParser::KU_AlterTableContext& ctx) {
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto dropProperty = ctx.kU_AlterOptions()->kU_DropProperty();
+    auto propertyName = transformPropertyKeyName(*dropProperty->oC_PropertyKeyName());
+    auto extraInfo = std::make_unique<ExtraDropPropertyInfo>(std::move(propertyName));
+    ConflictAction action = ConflictAction::ON_CONFLICT_THROW;
+    if (dropProperty->kU_IfExists()) {
+        action = ConflictAction::ON_CONFLICT_DO_NOTHING;
+    }
+    auto info = AlterInfo(AlterType::DROP_PROPERTY, tableName, std::move(extraInfo), action);
+    return std::make_unique<Alter>(std::move(info));
+}
+
+std::unique_ptr<Statement> Transformer::transformRenameProperty(
+    CypherParser::KU_AlterTableContext& ctx) {
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto propertyName = transformPropertyKeyName(
+        *ctx.kU_AlterOptions()->kU_RenameProperty()->oC_PropertyKeyName()[0]);
+    auto newName = transformPropertyKeyName(
+        *ctx.kU_AlterOptions()->kU_RenameProperty()->oC_PropertyKeyName()[1]);
+    auto extraInfo = std::make_unique<ExtraRenamePropertyInfo>(propertyName, newName);
+    auto info = AlterInfo(AlterType::RENAME_PROPERTY, tableName, std::move(extraInfo));
+    return std::make_unique<Alter>(std::move(info));
+}
+
+std::unique_ptr<Statement> Transformer::transformCommentOn(CypherParser::KU_CommentOnContext& ctx) {
+    auto tableName = transformSchemaName(*ctx.oC_SchemaName());
+    auto comment = transformStringLiteral(*ctx.StringLiteral());
+    auto extraInfo = std::make_unique<ExtraCommentInfo>(comment);
+    auto info = AlterInfo(AlterType::COMMENT, tableName, std::move(extraInfo));
+    return std::make_unique<Alter>(std::move(info));
+}
+
+std::vector<ParsedColumnDefinition> Transformer::transformColumnDefinitions(
+    CypherParser::KU_ColumnDefinitionsContext& ctx) {
+    std::vector<ParsedColumnDefinition> definitions;
+    for (auto& definition : ctx.kU_ColumnDefinition()) {
+        definitions.emplace_back(transformColumnDefinition(*definition));
+    }
+    return definitions;
+}
+
+ParsedColumnDefinition Transformer::transformColumnDefinition(
+    CypherParser::KU_ColumnDefinitionContext& ctx) {
+    auto propertyName = transformPropertyKeyName(*ctx.oC_PropertyKeyName());
+    auto dataType = transformDataType(*ctx.kU_DataType());
+    return ParsedColumnDefinition(propertyName, dataType);
+}
+
+std::vector<ParsedPropertyDefinition> Transformer::transformPropertyDefinitions(
+    CypherParser::KU_PropertyDefinitionsContext& ctx) {
+    std::vector<ParsedPropertyDefinition> definitions;
+    for (auto& definition : ctx.kU_PropertyDefinition()) {
+        auto columnDefinition = transformColumnDefinition(*definition->kU_ColumnDefinition());
+        std::unique_ptr<ParsedExpression> defaultExpr = nullptr;
+        if (definition->kU_Default()) {
+            defaultExpr = transformExpression(*definition->kU_Default()->oC_Expression());
+        }
+        definitions.push_back(
+            ParsedPropertyDefinition(std::move(columnDefinition), std::move(defaultExpr)));
+    }
+    return definitions;
+}
+
+static std::string convertColumnDefinitionsToString(
+    const std::vector<ParsedColumnDefinition>& columnDefinitions) {
+    std::string result;
+    for (auto& columnDefinition : columnDefinitions) {
+        result += common::stringFormat("{} {},", columnDefinition.name, columnDefinition.type);
+    }
+    return result.substr(0, result.length() - 1);
+}
+
+std::string Transformer::transformUnionType(CypherParser::KU_UnionTypeContext& ctx) {
+    return common::stringFormat("{}({})", ctx.UNION()->getText(),
+        convertColumnDefinitionsToString(transformColumnDefinitions(*ctx.kU_ColumnDefinitions())));
+}
+
+std::string Transformer::transformStructType(CypherParser::KU_StructTypeContext& ctx) {
+    return common::stringFormat("{}({})", ctx.STRUCT()->getText(),
+        convertColumnDefinitionsToString(transformColumnDefinitions(*ctx.kU_ColumnDefinitions())));
+}
+
+std::string Transformer::transformMapType(CypherParser::KU_MapTypeContext& ctx) {
+    return common::stringFormat("{}({},{})", ctx.MAP()->getText(),
+        transformDataType(*ctx.kU_DataType()[0]), transformDataType(*ctx.kU_DataType()[1]));
+}
+
+std::string Transformer::transformDecimalType(CypherParser::KU_DecimalTypeContext& ctx) {
+    return ctx.getText();
+}
+
+std::string Transformer::transformDataType(CypherParser::KU_DataTypeContext& ctx) {
+    if (ctx.oC_SymbolicName()) {
+        return transformSymbolicName(*ctx.oC_SymbolicName());
+    } else if (ctx.kU_UnionType()) {
+        return transformUnionType(*ctx.kU_UnionType());
+    } else if (ctx.kU_StructType()) {
+        return transformStructType(*ctx.kU_StructType());
+    } else if (ctx.kU_MapType()) {
+        return transformMapType(*ctx.kU_MapType());
+    } else if (ctx.kU_DecimalType()) {
+        return transformDecimalType(*ctx.kU_DecimalType());
+    } else {
+        return transformDataType(*ctx.kU_DataType()) + ctx.kU_ListIdentifiers()->getText();
+    }
+}
+
+std::string Transformer::transformPrimaryKey(CypherParser::KU_CreateNodeConstraintContext& ctx) {
+    return transformPropertyKeyName(*ctx.oC_PropertyKeyName());
+}
+
+std::string Transformer::transformPrimaryKey(CypherParser::KU_ColumnDefinitionContext& ctx) {
+    return transformPropertyKeyName(*ctx.oC_PropertyKeyName());
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_detach_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_detach_database.cpp
new file mode 100644
index 0000000000..c8656d5e8a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_detach_database.cpp
@@ -0,0 +1,14 @@
+#include "parser/detach_database.h"
+#include "parser/transformer.h"
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformDetachDatabase(
+    CypherParser::KU_DetachDatabaseContext& ctx) {
+    auto dbName = transformSchemaName(*ctx.oC_SchemaName());
+    return std::make_unique<DetachDatabase>(std::move(dbName));
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_expression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_expression.cpp
new file mode 100644
index 0000000000..45c1e20b8a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_expression.cpp
@@ -0,0 +1,704 @@
+#include "function/aggregate/count_star.h"
+#include "function/arithmetic/vector_arithmetic_functions.h"
+#include "function/cast/functions/cast_from_string_functions.h"
+#include "function/list/vector_list_functions.h"
+#include "function/string/vector_string_functions.h"
+#include "function/struct/vector_struct_functions.h"
+#include "parser/expression/parsed_case_expression.h"
+#include "parser/expression/parsed_function_expression.h"
+#include "parser/expression/parsed_lambda_expression.h"
+#include "parser/expression/parsed_literal_expression.h"
+#include "parser/expression/parsed_parameter_expression.h"
+#include "parser/expression/parsed_property_expression.h"
+#include "parser/expression/parsed_subquery_expression.h"
+#include "parser/expression/parsed_variable_expression.h"
+#include "parser/transformer.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<ParsedExpression> Transformer::transformExpression(
+    CypherParser::OC_ExpressionContext& ctx) {
+    return transformOrExpression(*ctx.oC_OrExpression());
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformOrExpression(
+    CypherParser::OC_OrExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> expression;
+    for (auto& xorExpression : ctx.oC_XorExpression()) {
+        auto next = transformXorExpression(*xorExpression);
+        if (!expression) {
+            expression = std::move(next);
+        } else {
+            auto rawName = expression->getRawName() + " OR " + next->getRawName();
+            expression = std::make_unique<ParsedExpression>(ExpressionType::OR,
+                std::move(expression), std::move(next), rawName);
+        }
+    }
+    return expression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformXorExpression(
+    CypherParser::OC_XorExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> expression;
+    for (auto& andExpression : ctx.oC_AndExpression()) {
+        auto next = transformAndExpression(*andExpression);
+        if (!expression) {
+            expression = std::move(next);
+        } else {
+            auto rawName = expression->getRawName() + " XOR " + next->getRawName();
+            expression = std::make_unique<ParsedExpression>(ExpressionType::XOR,
+                std::move(expression), std::move(next), rawName);
+        }
+    }
+    return expression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformAndExpression(
+    CypherParser::OC_AndExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> expression;
+    for (auto& notExpression : ctx.oC_NotExpression()) {
+        auto next = transformNotExpression(*notExpression);
+        if (!expression) {
+            expression = std::move(next);
+        } else {
+            auto rawName = expression->getRawName() + " AND " + next->getRawName();
+            expression = std::make_unique<ParsedExpression>(ExpressionType::AND,
+                std::move(expression), std::move(next), rawName);
+        }
+    }
+    return expression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformNotExpression(
+    CypherParser::OC_NotExpressionContext& ctx) {
+    auto result = transformComparisonExpression(*ctx.oC_ComparisonExpression());
+    if (!ctx.NOT().empty()) {
+        for ([[maybe_unused]] auto& _ : ctx.NOT()) {
+            auto rawName = "NOT " + result->toString();
+            result = std::make_unique<ParsedExpression>(ExpressionType::NOT, std::move(result),
+                std::move(rawName));
+        }
+    }
+    return result;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformComparisonExpression(
+    CypherParser::OC_ComparisonExpressionContext& ctx) {
+    if (1 == ctx.kU_BitwiseOrOperatorExpression().size()) {
+        return transformBitwiseOrOperatorExpression(*ctx.kU_BitwiseOrOperatorExpression(0));
+    }
+    // Antlr parser throws error for conjunctive comparison.
+    // Transformer should only handle the case of single comparison operator.
+    KU_ASSERT(ctx.kU_ComparisonOperator().size() == 1);
+    auto left = transformBitwiseOrOperatorExpression(*ctx.kU_BitwiseOrOperatorExpression(0));
+    auto right = transformBitwiseOrOperatorExpression(*ctx.kU_BitwiseOrOperatorExpression(1));
+    auto comparisonOperator = ctx.kU_ComparisonOperator()[0]->getText();
+    if (comparisonOperator == "=") {
+        return std::make_unique<ParsedExpression>(ExpressionType::EQUALS, std::move(left),
+            std::move(right), ctx.getText());
+    } else if (comparisonOperator == "<>") {
+        return std::make_unique<ParsedExpression>(ExpressionType::NOT_EQUALS, std::move(left),
+            std::move(right), ctx.getText());
+    } else if (comparisonOperator == ">") {
+        return std::make_unique<ParsedExpression>(ExpressionType::GREATER_THAN, std::move(left),
+            std::move(right), ctx.getText());
+    } else if (comparisonOperator == ">=") {
+        return std::make_unique<ParsedExpression>(ExpressionType::GREATER_THAN_EQUALS,
+            std::move(left), std::move(right), ctx.getText());
+    } else if (comparisonOperator == "<") {
+        return std::make_unique<ParsedExpression>(ExpressionType::LESS_THAN, std::move(left),
+            std::move(right), ctx.getText());
+    } else {
+        KU_ASSERT(comparisonOperator == "<=");
+        return std::make_unique<ParsedExpression>(ExpressionType::LESS_THAN_EQUALS, std::move(left),
+            std::move(right), ctx.getText());
+    }
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformBitwiseOrOperatorExpression(
+    CypherParser::KU_BitwiseOrOperatorExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> expression;
+    for (auto i = 0ul; i < ctx.kU_BitwiseAndOperatorExpression().size(); ++i) {
+        auto next = transformBitwiseAndOperatorExpression(*ctx.kU_BitwiseAndOperatorExpression(i));
+        if (!expression) {
+            expression = std::move(next);
+        } else {
+            auto rawName = expression->getRawName() + " | " + next->getRawName();
+            expression = std::make_unique<ParsedFunctionExpression>(BitwiseOrFunction::name,
+                std::move(expression), std::move(next), rawName);
+        }
+    }
+    return expression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformBitwiseAndOperatorExpression(
+    CypherParser::KU_BitwiseAndOperatorExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> expression;
+    for (auto i = 0ul; i < ctx.kU_BitShiftOperatorExpression().size(); ++i) {
+        auto next = transformBitShiftOperatorExpression(*ctx.kU_BitShiftOperatorExpression(i));
+        if (!expression) {
+            expression = std::move(next);
+        } else {
+            auto rawName = expression->getRawName() + " & " + next->getRawName();
+            expression = std::make_unique<ParsedFunctionExpression>(BitwiseAndFunction::name,
+                std::move(expression), std::move(next), rawName);
+        }
+    }
+    return expression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformBitShiftOperatorExpression(
+    CypherParser::KU_BitShiftOperatorExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> expression;
+    for (auto i = 0ul; i < ctx.oC_AddOrSubtractExpression().size(); ++i) {
+        auto next = transformAddOrSubtractExpression(*ctx.oC_AddOrSubtractExpression(i));
+        if (!expression) {
+            expression = std::move(next);
+        } else {
+            auto bitShiftOperator = ctx.kU_BitShiftOperator(i - 1)->getText();
+            auto rawName =
+                expression->getRawName() + " " + bitShiftOperator + " " + next->getRawName();
+            if (bitShiftOperator == "<<") {
+                expression = std::make_unique<ParsedFunctionExpression>(BitShiftLeftFunction::name,
+                    std::move(expression), std::move(next), rawName);
+            } else {
+                KU_ASSERT(bitShiftOperator == ">>");
+                expression = std::make_unique<ParsedFunctionExpression>(BitShiftRightFunction::name,
+                    std::move(expression), std::move(next), rawName);
+            }
+        }
+    }
+    return expression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformAddOrSubtractExpression(
+    CypherParser::OC_AddOrSubtractExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> expression;
+    for (auto i = 0ul; i < ctx.oC_MultiplyDivideModuloExpression().size(); ++i) {
+        auto next =
+            transformMultiplyDivideModuloExpression(*ctx.oC_MultiplyDivideModuloExpression(i));
+        if (!expression) {
+            expression = std::move(next);
+        } else {
+            auto arithmeticOperator = ctx.kU_AddOrSubtractOperator(i - 1)->getText();
+            auto rawName =
+                expression->getRawName() + " " + arithmeticOperator + " " + next->getRawName();
+            expression = std::make_unique<ParsedFunctionExpression>(arithmeticOperator,
+                std::move(expression), std::move(next), rawName);
+        }
+    }
+    return expression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformMultiplyDivideModuloExpression(
+    CypherParser::OC_MultiplyDivideModuloExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> expression;
+    for (auto i = 0ul; i < ctx.oC_PowerOfExpression().size(); i++) {
+        auto next = transformPowerOfExpression(*ctx.oC_PowerOfExpression(i));
+        if (!expression) {
+            expression = std::move(next);
+        } else {
+            auto arithmeticOperator = ctx.kU_MultiplyDivideModuloOperator(i - 1)->getText();
+            auto rawName =
+                expression->getRawName() + " " + arithmeticOperator + " " + next->getRawName();
+            expression = std::make_unique<ParsedFunctionExpression>(arithmeticOperator,
+                std::move(expression), std::move(next), rawName);
+        }
+    }
+    return expression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformPowerOfExpression(
+    CypherParser::OC_PowerOfExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> expression;
+    for (auto& stringListNullOperatorExpression : ctx.oC_StringListNullOperatorExpression()) {
+        auto next = transformStringListNullOperatorExpression(*stringListNullOperatorExpression);
+        if (!expression) {
+            expression = std::move(next);
+        } else {
+            auto rawName = expression->getRawName() + " ^ " + next->getRawName();
+            expression = std::make_unique<ParsedFunctionExpression>(PowerFunction::name,
+                std::move(expression), std::move(next), rawName);
+        }
+    }
+    return expression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformUnaryAddSubtractOrFactorialExpression(
+    CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext& ctx) {
+    auto atomCtx = ctx.oC_PropertyOrLabelsExpression()->oC_Atom();
+    bool isNumberLiteral = atomCtx->oC_Literal() && atomCtx->oC_Literal()->oC_NumberLiteral();
+    std::unique_ptr<ParsedExpression> result;
+    if (isNumberLiteral) {
+        // Try parse -number as a signed literal. This is to avoid
+        // -170141183460469231731687303715884105728 being parsed as
+        // 170141183460469231731687303715884105728 and cause overflow
+        result = transformNumberLiteral(*atomCtx->oC_Literal()->oC_NumberLiteral(),
+            ctx.MINUS().size() % 2 == 1);
+    } else {
+        result = transformPropertyOrLabelsExpression(*ctx.oC_PropertyOrLabelsExpression());
+    }
+    if (ctx.FACTORIAL()) { // Factorial has a higher precedence
+        auto raw = result->toString() + "!";
+        result = std::make_unique<ParsedFunctionExpression>(FactorialFunction::name,
+            std::move(result), std::move(raw));
+    }
+    if (!ctx.MINUS().empty() && !isNumberLiteral) {
+        for ([[maybe_unused]] auto& _ : ctx.MINUS()) {
+            auto raw = "-" + result->toString();
+            result = std::make_unique<ParsedFunctionExpression>(NegateFunction::name,
+                std::move(result), std::move(raw));
+        }
+    }
+    return result;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformStringListNullOperatorExpression(
+    CypherParser::OC_StringListNullOperatorExpressionContext& ctx) {
+    auto unaryAddSubtractOrFactorialExpression = transformUnaryAddSubtractOrFactorialExpression(
+        *ctx.oC_UnaryAddSubtractOrFactorialExpression());
+    if (ctx.oC_NullOperatorExpression()) {
+        return transformNullOperatorExpression(*ctx.oC_NullOperatorExpression(),
+            std::move(unaryAddSubtractOrFactorialExpression));
+    }
+    if (!ctx.oC_ListOperatorExpression().empty()) {
+        auto result = transformListOperatorExpression(*ctx.oC_ListOperatorExpression(0),
+            std::move(unaryAddSubtractOrFactorialExpression));
+        for (auto i = 1u; i < ctx.oC_ListOperatorExpression().size(); ++i) {
+            result = transformListOperatorExpression(*ctx.oC_ListOperatorExpression(i),
+                std::move(result));
+        }
+        return result;
+    }
+    if (ctx.oC_StringOperatorExpression()) {
+        return transformStringOperatorExpression(*ctx.oC_StringOperatorExpression(),
+            std::move(unaryAddSubtractOrFactorialExpression));
+    }
+    return unaryAddSubtractOrFactorialExpression;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformStringOperatorExpression(
+    CypherParser::OC_StringOperatorExpressionContext& ctx,
+    std::unique_ptr<ParsedExpression> propertyExpression) {
+    auto rawExpression = propertyExpression->getRawName() + " " + ctx.getText();
+    auto right = transformPropertyOrLabelsExpression(*ctx.oC_PropertyOrLabelsExpression());
+    if (ctx.STARTS()) {
+        return std::make_unique<ParsedFunctionExpression>(StartsWithFunction::name,
+            std::move(propertyExpression), std::move(right), rawExpression);
+    } else if (ctx.ENDS()) {
+        return std::make_unique<ParsedFunctionExpression>(EndsWithFunction::name,
+            std::move(propertyExpression), std::move(right), rawExpression);
+    } else if (ctx.CONTAINS()) {
+        return std::make_unique<ParsedFunctionExpression>(ContainsFunction::name,
+            std::move(propertyExpression), std::move(right), rawExpression);
+    } else {
+        KU_ASSERT(ctx.oC_RegularExpression());
+        return std::make_unique<ParsedFunctionExpression>(RegexpFullMatchFunction::name,
+            std::move(propertyExpression), std::move(right), rawExpression);
+    }
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformListOperatorExpression(
+    CypherParser::OC_ListOperatorExpressionContext& ctx, std::unique_ptr<ParsedExpression> child) {
+    auto raw = child->getRawName() + ctx.getText();
+    if (ctx.IN()) { // x IN y
+        auto listContains =
+            std::make_unique<ParsedFunctionExpression>(ListContainsFunction::name, std::move(raw));
+        auto right = transformPropertyOrLabelsExpression(*ctx.oC_PropertyOrLabelsExpression());
+        listContains->addChild(std::move(right));
+        listContains->addChild(std::move(child));
+        return listContains;
+    }
+    if (ctx.COLON() || ctx.DOTDOT()) { // x[:]/x[..]
+        auto listSlice =
+            std::make_unique<ParsedFunctionExpression>(ListSliceFunction::name, std::move(raw));
+        listSlice->addChild(std::move(child));
+        std::unique_ptr<ParsedExpression> left;
+        std::unique_ptr<ParsedExpression> right;
+        if (ctx.oC_Expression().size() == 2) { // [left:right]/[left..right]
+            left = transformExpression(*ctx.oC_Expression(0));
+            right = transformExpression(*ctx.oC_Expression(1));
+        } else if (ctx.oC_Expression().size() == 0) { // [:]/[..]
+            left = std::make_unique<ParsedLiteralExpression>(Value(1), "1");
+            right = std::make_unique<ParsedLiteralExpression>(Value(-1), "-1");
+        } else {
+            if (ctx.children[1]->getText() == ":" ||
+                ctx.children[1]->getText() == "..") { // [:right]/[..right]
+                left = std::make_unique<ParsedLiteralExpression>(Value(1), "1");
+                right = transformExpression(*ctx.oC_Expression(0));
+            } else { // [left:]/[left..]
+                left = transformExpression(*ctx.oC_Expression(0));
+                right = std::make_unique<ParsedLiteralExpression>(Value(-1), "-1");
+            }
+        }
+        listSlice->addChild(std::move(left));
+        listSlice->addChild(std::move(right));
+        return listSlice;
+    }
+    // x[a]
+    auto listExtract =
+        std::make_unique<ParsedFunctionExpression>(ListExtractFunction::name, std::move(raw));
+    listExtract->addChild(std::move(child));
+    KU_ASSERT(ctx.oC_Expression().size() == 1);
+    listExtract->addChild(transformExpression(*ctx.oC_Expression()[0]));
+    return listExtract;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformNullOperatorExpression(
+    CypherParser::OC_NullOperatorExpressionContext& ctx,
+    std::unique_ptr<ParsedExpression> propertyExpression) {
+    auto rawExpression = propertyExpression->getRawName() + " " + ctx.getText();
+    KU_ASSERT(ctx.IS() && ctx.NULL_());
+    return ctx.NOT() ? std::make_unique<ParsedExpression>(ExpressionType::IS_NOT_NULL,
+                           std::move(propertyExpression), rawExpression) :
+                       std::make_unique<ParsedExpression>(ExpressionType::IS_NULL,
+                           std::move(propertyExpression), rawExpression);
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformPropertyOrLabelsExpression(
+    CypherParser::OC_PropertyOrLabelsExpressionContext& ctx) {
+    auto atom = transformAtom(*ctx.oC_Atom());
+    if (!ctx.oC_PropertyLookup().empty()) {
+        auto lookUpCtx = ctx.oC_PropertyLookup(0);
+        auto result = createPropertyExpression(*lookUpCtx, std::move(atom));
+        for (auto i = 1u; i < ctx.oC_PropertyLookup().size(); ++i) {
+            lookUpCtx = ctx.oC_PropertyLookup(i);
+            result = createPropertyExpression(*lookUpCtx, std::move(result));
+        }
+        return result;
+    }
+    return atom;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformAtom(CypherParser::OC_AtomContext& ctx) {
+    if (ctx.oC_Literal()) {
+        return transformLiteral(*ctx.oC_Literal());
+    } else if (ctx.oC_Parameter()) {
+        return transformParameterExpression(*ctx.oC_Parameter());
+    } else if (ctx.oC_CaseExpression()) {
+        return transformCaseExpression(*ctx.oC_CaseExpression());
+    } else if (ctx.oC_ParenthesizedExpression()) {
+        return transformParenthesizedExpression(*ctx.oC_ParenthesizedExpression());
+    } else if (ctx.oC_FunctionInvocation()) {
+        return transformFunctionInvocation(*ctx.oC_FunctionInvocation());
+    } else if (ctx.oC_PathPatterns()) {
+        return transformPathPattern(*ctx.oC_PathPatterns());
+    } else if (ctx.oC_ExistCountSubquery()) {
+        return transformExistCountSubquery(*ctx.oC_ExistCountSubquery());
+    } else if (ctx.oC_Quantifier()) {
+        return transformOcQuantifier(*ctx.oC_Quantifier());
+    } else {
+        KU_ASSERT(ctx.oC_Variable());
+        return std::make_unique<ParsedVariableExpression>(transformVariable(*ctx.oC_Variable()),
+            ctx.getText());
+    }
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformLiteral(
+    CypherParser::OC_LiteralContext& ctx) {
+    if (ctx.oC_NumberLiteral()) {
+        return transformNumberLiteral(*ctx.oC_NumberLiteral(), false /*negative*/);
+    } else if (ctx.oC_BooleanLiteral()) {
+        return transformBooleanLiteral(*ctx.oC_BooleanLiteral());
+    } else if (ctx.StringLiteral()) {
+        return std::make_unique<ParsedLiteralExpression>(
+            Value(LogicalType::STRING(), transformStringLiteral(*ctx.StringLiteral())),
+            ctx.getText());
+    } else if (ctx.NULL_()) {
+        return std::make_unique<ParsedLiteralExpression>(Value::createNullValue(), ctx.getText());
+    } else if (ctx.kU_StructLiteral()) {
+        return transformStructLiteral(*ctx.kU_StructLiteral());
+    } else {
+        KU_ASSERT(ctx.oC_ListLiteral());
+        return transformListLiteral(*ctx.oC_ListLiteral());
+    }
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformBooleanLiteral(
+    CypherParser::OC_BooleanLiteralContext& ctx) {
+    if (ctx.TRUE()) {
+        return std::make_unique<ParsedLiteralExpression>(Value(true), ctx.getText());
+    } else if (ctx.FALSE()) {
+        return std::make_unique<ParsedLiteralExpression>(Value(false), ctx.getText());
+    }
+    KU_UNREACHABLE;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformListLiteral(
+    CypherParser::OC_ListLiteralContext& ctx) {
+    auto listCreation =
+        std::make_unique<ParsedFunctionExpression>(ListCreationFunction::name, ctx.getText());
+    if (ctx.oC_Expression() == nullptr) { // empty list
+        return listCreation;
+    }
+    listCreation->addChild(transformExpression(*ctx.oC_Expression()));
+    for (auto& listEntry : ctx.kU_ListEntry()) {
+        if (listEntry->oC_Expression() == nullptr) {
+            auto nullValue = Value::createNullValue();
+            listCreation->addChild(
+                std::make_unique<ParsedLiteralExpression>(nullValue, nullValue.toString()));
+        } else {
+            listCreation->addChild(transformExpression(*listEntry->oC_Expression()));
+        }
+    }
+    return listCreation;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformStructLiteral(
+    CypherParser::KU_StructLiteralContext& ctx) {
+    auto structPack =
+        std::make_unique<ParsedFunctionExpression>(StructPackFunctions::name, ctx.getText());
+    for (auto& structField : ctx.kU_StructField()) {
+        auto structExpr = transformExpression(*structField->oC_Expression());
+        std::string paramName;
+        if (structField->oC_SymbolicName()) {
+            paramName = transformSymbolicName(*structField->oC_SymbolicName());
+        } else {
+            paramName = transformStringLiteral(*structField->StringLiteral());
+        }
+        structPack->addOptionalParams(std::move(paramName), std::move(structExpr));
+    }
+    return structPack;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformParameterExpression(
+    CypherParser::OC_ParameterContext& ctx) {
+    auto parameterName =
+        ctx.oC_SymbolicName() ? ctx.oC_SymbolicName()->getText() : ctx.DecimalInteger()->getText();
+    return std::make_unique<ParsedParameterExpression>(parameterName, ctx.getText());
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformParenthesizedExpression(
+    CypherParser::OC_ParenthesizedExpressionContext& ctx) {
+    return transformExpression(*ctx.oC_Expression());
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformFunctionInvocation(
+    CypherParser::OC_FunctionInvocationContext& ctx) {
+    if (ctx.STAR()) {
+        return std::make_unique<ParsedFunctionExpression>(CountStarFunction::name, ctx.getText());
+    }
+    std::string functionName;
+    if (ctx.COUNT()) {
+        functionName = "COUNT";
+    } else if (ctx.CAST()) {
+        functionName = "CAST";
+    } else {
+        functionName = transformFunctionName(*ctx.oC_FunctionName());
+    }
+    auto expression = std::make_unique<ParsedFunctionExpression>(functionName, ctx.getText(),
+        ctx.DISTINCT() != nullptr);
+    if (ctx.CAST()) {
+        for (auto& functionParameter : ctx.kU_FunctionParameter()) {
+            expression->addChild(transformFunctionParameterExpression(*functionParameter));
+        }
+        if (ctx.kU_DataType()) {
+            expression->addChild(std::make_unique<ParsedLiteralExpression>(
+                common::Value(transformDataType(*ctx.kU_DataType()))));
+        }
+    } else {
+        for (auto& functionParameter : ctx.kU_FunctionParameter()) {
+            auto parsedFunctionParameter = transformFunctionParameterExpression(*functionParameter);
+            if (functionParameter->oC_SymbolicName()) {
+                // Optional parameter
+                expression->addOptionalParams(
+                    transformSymbolicName(*functionParameter->oC_SymbolicName()),
+                    std::move(parsedFunctionParameter));
+            } else {
+                expression->addChild(std::move(parsedFunctionParameter));
+            }
+        }
+    }
+    return expression;
+}
+
+std::string Transformer::transformFunctionName(CypherParser::OC_FunctionNameContext& ctx) {
+    return transformSymbolicName(*ctx.oC_SymbolicName());
+}
+
+std::vector<std::string> Transformer::transformLambdaVariables(
+    CypherParser::KU_LambdaVarsContext& ctx) {
+    std::vector<std::string> lambdaVariables;
+    lambdaVariables.reserve(ctx.oC_SymbolicName().size());
+    for (auto& var : ctx.oC_SymbolicName()) {
+        lambdaVariables.push_back(transformSymbolicName(*var));
+    }
+    return lambdaVariables;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformLambdaParameter(
+    CypherParser::KU_LambdaParameterContext& ctx) {
+    auto vars = transformLambdaVariables(*ctx.kU_LambdaVars());
+    auto lambdaOperation = transformExpression(*ctx.oC_Expression());
+    return std::make_unique<ParsedLambdaExpression>(std::move(vars), std::move(lambdaOperation),
+        ctx.getText());
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformFunctionParameterExpression(
+    CypherParser::KU_FunctionParameterContext& ctx) {
+    if (ctx.kU_LambdaParameter()) {
+        return transformLambdaParameter(*ctx.kU_LambdaParameter());
+    } else {
+        auto expression = transformExpression(*ctx.oC_Expression());
+        if (ctx.oC_SymbolicName()) {
+            expression->setAlias(transformSymbolicName(*ctx.oC_SymbolicName()));
+        }
+        return expression;
+    }
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformPathPattern(
+    CypherParser::OC_PathPatternsContext& ctx) {
+    auto subquery = std::make_unique<ParsedSubqueryExpression>(SubqueryType::EXISTS, ctx.getText());
+    auto patternElement = PatternElement(transformNodePattern(*ctx.oC_NodePattern()));
+    for (auto& chain : ctx.oC_PatternElementChain()) {
+        patternElement.addPatternElementChain(transformPatternElementChain(*chain));
+    }
+    subquery->addPatternElement(std::move(patternElement));
+    return subquery;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformExistCountSubquery(
+    CypherParser::OC_ExistCountSubqueryContext& ctx) {
+    auto type = ctx.EXISTS() ? SubqueryType::EXISTS : SubqueryType::COUNT;
+    auto subquery = std::make_unique<ParsedSubqueryExpression>(type, ctx.getText());
+    subquery->setPatternElements(transformPattern(*ctx.oC_Pattern()));
+    if (ctx.oC_Where()) {
+        subquery->setWhereClause(transformWhere(*ctx.oC_Where()));
+    }
+    if (ctx.kU_Hint()) {
+        subquery->setHint(transformJoinHint(*ctx.kU_Hint()->kU_JoinNode()));
+    }
+    return subquery;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformOcQuantifier(
+    CypherParser::OC_QuantifierContext& ctx) {
+    auto variable = transformVariable(*ctx.oC_FilterExpression()->oC_IdInColl()->oC_Variable());
+    auto whereExpr = transformWhere(*ctx.oC_FilterExpression()->oC_Where());
+    auto lambdaRaw = variable + "->" + whereExpr->toString();
+    auto lambdaExpr = std::make_unique<ParsedLambdaExpression>(std::vector<std::string>{variable},
+        std::move(whereExpr), lambdaRaw);
+    std::string quantifierName;
+    if (ctx.ALL()) {
+        quantifierName = "ALL";
+    } else if (ctx.ANY()) {
+        quantifierName = "ANY";
+    } else if (ctx.NONE()) {
+        quantifierName = "NONE";
+    } else if (ctx.SINGLE()) {
+        quantifierName = "SINGLE";
+    }
+    auto listExpr = transformExpression(*ctx.oC_FilterExpression()->oC_IdInColl()->oC_Expression());
+    return std::make_unique<ParsedFunctionExpression>(quantifierName, std::move(listExpr),
+        std::move(lambdaExpr), ctx.getText());
+}
+
+std::unique_ptr<ParsedExpression> Transformer::createPropertyExpression(
+    CypherParser::OC_PropertyKeyNameContext& ctx, std::unique_ptr<ParsedExpression> child) {
+    auto key = transformPropertyKeyName(ctx);
+    return std::make_unique<ParsedPropertyExpression>(key, std::move(child),
+        child->toString() + "." + key);
+}
+
+std::unique_ptr<ParsedExpression> Transformer::createPropertyExpression(
+    CypherParser::OC_PropertyLookupContext& ctx, std::unique_ptr<ParsedExpression> child) {
+    auto key =
+        ctx.STAR() ? InternalKeyword::STAR : transformPropertyKeyName(*ctx.oC_PropertyKeyName());
+    return std::make_unique<ParsedPropertyExpression>(key, std::move(child),
+        child->toString() + ctx.getText());
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformCaseExpression(
+    CypherParser::OC_CaseExpressionContext& ctx) {
+    std::unique_ptr<ParsedExpression> caseExpression = nullptr;
+    std::unique_ptr<ParsedExpression> elseExpression = nullptr;
+    if (ctx.ELSE()) {
+        if (ctx.oC_Expression().size() == 1) {
+            elseExpression = transformExpression(*ctx.oC_Expression(0));
+        } else {
+            KU_ASSERT(ctx.oC_Expression().size() == 2);
+            caseExpression = transformExpression(*ctx.oC_Expression(0));
+            elseExpression = transformExpression(*ctx.oC_Expression(1));
+        }
+    } else {
+        if (ctx.oC_Expression().size() == 1) {
+            caseExpression = transformExpression(*ctx.oC_Expression(0));
+        }
+    }
+    auto parsedCaseExpression = std::make_unique<ParsedCaseExpression>(ctx.getText());
+    parsedCaseExpression->setCaseExpression(std::move(caseExpression));
+    parsedCaseExpression->setElseExpression(std::move(elseExpression));
+    for (auto& caseAlternative : ctx.oC_CaseAlternative()) {
+        parsedCaseExpression->addCaseAlternative(transformCaseAlternative(*caseAlternative));
+    }
+    return parsedCaseExpression;
+}
+
+ParsedCaseAlternative Transformer::transformCaseAlternative(
+    CypherParser::OC_CaseAlternativeContext& ctx) {
+    auto whenExpression = transformExpression(*ctx.oC_Expression(0));
+    auto thenExpression = transformExpression(*ctx.oC_Expression(1));
+    return ParsedCaseAlternative(std::move(whenExpression), std::move(thenExpression));
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformNumberLiteral(
+    CypherParser::OC_NumberLiteralContext& ctx, bool negative) {
+    if (ctx.oC_IntegerLiteral()) {
+        return transformIntegerLiteral(*ctx.oC_IntegerLiteral(), negative);
+    } else {
+        KU_ASSERT(ctx.oC_DoubleLiteral());
+        return transformDoubleLiteral(*ctx.oC_DoubleLiteral(), negative);
+    }
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformProperty(
+    CypherParser::OC_PropertyExpressionContext& ctx) {
+    auto child = transformAtom(*ctx.oC_Atom());
+    return createPropertyExpression(*ctx.oC_PropertyLookup(), std::move(child));
+}
+
+std::string Transformer::transformPropertyKeyName(CypherParser::OC_PropertyKeyNameContext& ctx) {
+    return transformSchemaName(*ctx.oC_SchemaName());
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformIntegerLiteral(
+    CypherParser::OC_IntegerLiteralContext& ctx, bool negative) {
+    auto text = ctx.DecimalInteger()->getText();
+    if (negative) {
+        text = '-' + text;
+    }
+    ku_string_t literal{text.c_str(), text.length()};
+    int64_t result = 0;
+    if (function::CastString::tryCast(literal, result)) {
+        return std::make_unique<ParsedLiteralExpression>(Value(result), ctx.getText());
+    }
+    int128_t result128 = 0;
+    if (function::trySimpleIntegerCast(reinterpret_cast<const char*>(literal.getData()),
+            literal.len, result128)) {
+        return std::make_unique<ParsedLiteralExpression>(Value(result128), ctx.getText());
+    }
+    uint128_t resultu128 = 0;
+    function::CastString::operation(literal, resultu128);
+    return std::make_unique<ParsedLiteralExpression>(Value(resultu128), ctx.getText());
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformDoubleLiteral(
+    CypherParser::OC_DoubleLiteralContext& ctx, bool negative) {
+    auto text = ctx.ExponentDecimalReal() ? ctx.ExponentDecimalReal()->getText() :
+                                            ctx.RegularDecimalReal()->getText();
+    if (negative) {
+        text = '-' + text;
+    }
+    ku_string_t literal{text.c_str(), text.length()};
+    double result = 0;
+    function::CastString::operation(literal, result);
+    return std::make_unique<ParsedLiteralExpression>(Value(result), ctx.getText());
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_extension.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_extension.cpp
new file mode 100644
index 0000000000..5df14cd166
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_extension.cpp
@@ -0,0 +1,43 @@
+#include "extension/extension.h"
+#include "parser/extension_statement.h"
+#include "parser/transformer.h"
+
+using namespace lbug::common;
+using namespace lbug::extension;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformExtension(CypherParser::KU_ExtensionContext& ctx) {
+    if (ctx.kU_InstallExtension()) {
+        auto extensionRepo =
+            ctx.kU_InstallExtension()->StringLiteral() ?
+                transformStringLiteral(*ctx.kU_InstallExtension()->StringLiteral()) :
+                ExtensionUtils::OFFICIAL_EXTENSION_REPO;
+
+        auto installExtensionAuxInfo = std::make_unique<InstallExtensionAuxInfo>(
+            std::move(extensionRepo), transformVariable(*ctx.kU_InstallExtension()->oC_Variable()),
+            ctx.kU_InstallExtension()->FORCE());
+        return std::make_unique<ExtensionStatement>(std::move(installExtensionAuxInfo));
+    } else if (ctx.kU_UpdateExtension()) {
+        // Update extension is a syntax sugar for force install extension.
+        auto installExtensionAuxInfo = std::make_unique<InstallExtensionAuxInfo>(
+            ExtensionUtils::OFFICIAL_EXTENSION_REPO,
+            transformVariable(*ctx.kU_UpdateExtension()->oC_Variable()), true /* forceInstall */);
+        return std::make_unique<ExtensionStatement>(std::move(installExtensionAuxInfo));
+    } else if (ctx.kU_UninstallExtension()) {
+        auto path = transformVariable(*ctx.kU_UninstallExtension()->oC_Variable());
+        return std::make_unique<ExtensionStatement>(
+            std::make_unique<ExtensionAuxInfo>(ExtensionAction::UNINSTALL, std::move(path)));
+    } else {
+        auto path = ctx.kU_LoadExtension()->StringLiteral() ?
+                        transformStringLiteral(*ctx.kU_LoadExtension()->StringLiteral()) :
+                        transformVariable(*ctx.kU_LoadExtension()->oC_Variable());
+        auto installExtensionAuxInfo =
+            std::make_unique<ExtensionAuxInfo>(ExtensionAction::LOAD, std::move(path));
+        return std::make_unique<ExtensionStatement>(std::move(installExtensionAuxInfo));
+    }
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_graph_pattern.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_graph_pattern.cpp
new file mode 100644
index 0000000000..107f6f3947
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_graph_pattern.cpp
@@ -0,0 +1,213 @@
+#include "common/assert.h"
+#include "parser/query/graph_pattern/pattern_element.h"
+#include "parser/transformer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+std::vector<PatternElement> Transformer::transformPattern(CypherParser::OC_PatternContext& ctx) {
+    std::vector<PatternElement> patterns;
+    for (auto& patternPart : ctx.oC_PatternPart()) {
+        patterns.push_back(transformPatternPart(*patternPart));
+    }
+    return patterns;
+}
+
+PatternElement Transformer::transformPatternPart(CypherParser::OC_PatternPartContext& ctx) {
+    auto patternElement = transformAnonymousPatternPart(*ctx.oC_AnonymousPatternPart());
+    if (ctx.oC_Variable()) {
+        auto variable = transformVariable(*ctx.oC_Variable());
+        patternElement.setPathName(variable);
+    }
+    return patternElement;
+}
+
+PatternElement Transformer::transformAnonymousPatternPart(
+    CypherParser::OC_AnonymousPatternPartContext& ctx) {
+    return transformPatternElement(*ctx.oC_PatternElement());
+}
+
+PatternElement Transformer::transformPatternElement(CypherParser::OC_PatternElementContext& ctx) {
+    if (ctx.oC_PatternElement()) { // parenthesized pattern element
+        return transformPatternElement(*ctx.oC_PatternElement());
+    }
+    auto patternElement = PatternElement(transformNodePattern(*ctx.oC_NodePattern()));
+    if (!ctx.oC_PatternElementChain().empty()) {
+        for (auto& patternElementChain : ctx.oC_PatternElementChain()) {
+            patternElement.addPatternElementChain(
+                transformPatternElementChain(*patternElementChain));
+        }
+    }
+    return patternElement;
+}
+
+NodePattern Transformer::transformNodePattern(CypherParser::OC_NodePatternContext& ctx) {
+    auto variable = std::string();
+    if (ctx.oC_Variable()) {
+        variable = transformVariable(*ctx.oC_Variable());
+    }
+    auto nodeLabels = std::vector<std::string>{};
+    if (ctx.oC_NodeLabels()) {
+        nodeLabels = transformNodeLabels(*ctx.oC_NodeLabels());
+    }
+    auto properties = std::vector<std::pair<std::string, std::unique_ptr<ParsedExpression>>>{};
+    if (ctx.kU_Properties()) {
+        properties = transformProperties(*ctx.kU_Properties());
+    }
+    return NodePattern(std::move(variable), std::move(nodeLabels), std::move(properties));
+}
+
+PatternElementChain Transformer::transformPatternElementChain(
+    CypherParser::OC_PatternElementChainContext& ctx) {
+    return PatternElementChain(transformRelationshipPattern(*ctx.oC_RelationshipPattern()),
+        transformNodePattern(*ctx.oC_NodePattern()));
+}
+
+RelPattern Transformer::transformRelationshipPattern(
+    CypherParser::OC_RelationshipPatternContext& ctx) {
+    auto relDetail = ctx.oC_RelationshipDetail();
+    auto variable = std::string();
+    auto relTypes = std::vector<std::string>{};
+    auto properties = std::vector<std::pair<std::string, std::unique_ptr<ParsedExpression>>>{};
+    // Parse name, label & properties
+    if (relDetail) {
+        if (relDetail->oC_Variable()) {
+            variable = transformVariable(*relDetail->oC_Variable());
+        }
+        if (relDetail->oC_RelationshipTypes()) {
+            relTypes = transformRelTypes(*relDetail->oC_RelationshipTypes());
+        }
+        if (relDetail->kU_Properties()) {
+            properties = transformProperties(*relDetail->kU_Properties());
+        }
+    }
+    // Parse direction
+    ArrowDirection arrowDirection; // NOLINT(*-init-variables)
+    if (ctx.oC_LeftArrowHead()) {
+        arrowDirection = ArrowDirection::LEFT;
+    } else if (ctx.oC_RightArrowHead()) {
+        arrowDirection = ArrowDirection::RIGHT;
+    } else {
+        arrowDirection = ArrowDirection::BOTH;
+    }
+    // Parse recursive info
+    auto relType = QueryRelType::NON_RECURSIVE;
+    auto recursiveInfo = RecursiveRelPatternInfo();
+
+    if (relDetail && relDetail->kU_RecursiveDetail()) {
+        auto recursiveDetail = relDetail->kU_RecursiveDetail();
+        // Parse recursive type
+        auto recursiveType = recursiveDetail->kU_RecursiveType();
+        if (recursiveType) {
+            if (recursiveType->ALL()) {
+                if (recursiveType->WSHORTEST()) {
+                    relType = QueryRelType::ALL_WEIGHTED_SHORTEST;
+                    recursiveInfo.weightPropertyName =
+                        transformPropertyKeyName(*recursiveType->oC_PropertyKeyName());
+                } else {
+                    relType = QueryRelType::ALL_SHORTEST;
+                }
+            } else if (recursiveType->WSHORTEST()) {
+                relType = QueryRelType::WEIGHTED_SHORTEST;
+                recursiveInfo.weightPropertyName =
+                    transformPropertyKeyName(*recursiveType->oC_PropertyKeyName());
+            } else if (recursiveDetail->kU_RecursiveType()->SHORTEST()) {
+                relType = QueryRelType::SHORTEST;
+            } else if (recursiveDetail->kU_RecursiveType()->TRAIL()) {
+                relType = QueryRelType::VARIABLE_LENGTH_TRAIL;
+            } else if (recursiveDetail->kU_RecursiveType()->ACYCLIC()) {
+                relType = QueryRelType::VARIABLE_LENGTH_ACYCLIC;
+            } else {
+                relType = QueryRelType::VARIABLE_LENGTH_WALK;
+            }
+        } else {
+            relType = QueryRelType::VARIABLE_LENGTH_WALK;
+        }
+        // Parse lower, upper bound
+        auto lowerBound = std::string("1");
+        auto upperBound = std::string("");
+        auto range = recursiveDetail->oC_RangeLiteral();
+        if (range) {
+            if (range->oC_IntegerLiteral()) {
+                lowerBound = range->oC_IntegerLiteral()->getText();
+                upperBound = lowerBound;
+            }
+            if (range->oC_LowerBound()) {
+                lowerBound = range->oC_LowerBound()->getText();
+            }
+            if (range->oC_UpperBound()) {
+                upperBound = range->oC_UpperBound()->getText();
+            }
+        }
+        recursiveInfo.lowerBound = lowerBound;
+        recursiveInfo.upperBound = upperBound;
+        // Parse recursive comprehension
+        auto comprehension = recursiveDetail->kU_RecursiveComprehension();
+        if (comprehension) {
+            recursiveInfo.relName = transformVariable(*comprehension->oC_Variable(0));
+            recursiveInfo.nodeName = transformVariable(*comprehension->oC_Variable(1));
+            if (comprehension->oC_Where()) {
+                recursiveInfo.whereExpression = transformWhere(*comprehension->oC_Where());
+            }
+            if (!comprehension->kU_RecursiveProjectionItems().empty()) {
+                recursiveInfo.hasProjection = true;
+                KU_ASSERT(comprehension->kU_RecursiveProjectionItems().size() == 2);
+                auto relProjectionList =
+                    comprehension->kU_RecursiveProjectionItems(0)->oC_ProjectionItems();
+                if (relProjectionList) {
+                    recursiveInfo.relProjectionList = transformProjectionItems(*relProjectionList);
+                }
+                auto nodeProjectionList =
+                    comprehension->kU_RecursiveProjectionItems(1)->oC_ProjectionItems();
+                if (nodeProjectionList) {
+                    recursiveInfo.nodeProjectionList =
+                        transformProjectionItems(*nodeProjectionList);
+                }
+            }
+        }
+    }
+    return RelPattern(variable, relTypes, relType, arrowDirection, std::move(properties),
+        std::move(recursiveInfo));
+}
+
+std::vector<s_parsed_expr_pair> Transformer::transformProperties(
+    CypherParser::KU_PropertiesContext& ctx) {
+    std::vector<std::pair<std::string, std::unique_ptr<ParsedExpression>>> result;
+    KU_ASSERT(ctx.oC_PropertyKeyName().size() == ctx.oC_Expression().size());
+    for (auto i = 0u; i < ctx.oC_PropertyKeyName().size(); ++i) {
+        auto propertyKeyName = transformPropertyKeyName(*ctx.oC_PropertyKeyName(i));
+        auto expression = transformExpression(*ctx.oC_Expression(i));
+        result.emplace_back(propertyKeyName, std::move(expression));
+    }
+    return result;
+}
+
+std::vector<std::string> Transformer::transformRelTypes(
+    CypherParser::OC_RelationshipTypesContext& ctx) {
+    std::vector<std::string> relTypes;
+    for (auto& relType : ctx.oC_RelTypeName()) {
+        relTypes.push_back(transformRelTypeName(*relType));
+    }
+    return relTypes;
+}
+
+std::vector<std::string> Transformer::transformNodeLabels(CypherParser::OC_NodeLabelsContext& ctx) {
+    std::vector<std::string> nodeLabels;
+    for (auto& labelName : ctx.oC_LabelName()) {
+        nodeLabels.push_back(transformLabelName(*labelName));
+    }
+    return nodeLabels;
+}
+
+std::string Transformer::transformLabelName(CypherParser::OC_LabelNameContext& ctx) {
+    return transformSchemaName(*ctx.oC_SchemaName());
+}
+
+std::string Transformer::transformRelTypeName(CypherParser::OC_RelTypeNameContext& ctx) {
+    return transformSchemaName(*ctx.oC_SchemaName());
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_macro.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_macro.cpp
new file mode 100644
index 0000000000..2c210848f5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_macro.cpp
@@ -0,0 +1,34 @@
+#include "parser/create_macro.h"
+#include "parser/transformer.h"
+
+namespace lbug {
+namespace parser {
+
+std::vector<std::string> Transformer::transformPositionalArgs(
+    CypherParser::KU_PositionalArgsContext& ctx) {
+    std::vector<std::string> positionalArgs;
+    for (auto& positionalArg : ctx.oC_SymbolicName()) {
+        positionalArgs.push_back(transformSymbolicName(*positionalArg));
+    }
+    return positionalArgs;
+}
+
+std::unique_ptr<Statement> Transformer::transformCreateMacro(
+    CypherParser::KU_CreateMacroContext& ctx) {
+    auto macroName = transformFunctionName(*ctx.oC_FunctionName());
+    auto macroExpression = transformExpression(*ctx.oC_Expression());
+    std::vector<std::string> positionalArgs;
+    if (ctx.kU_PositionalArgs()) {
+        positionalArgs = transformPositionalArgs(*ctx.kU_PositionalArgs());
+    }
+    default_macro_args defaultArgs;
+    for (auto& defaultArg : ctx.kU_DefaultArg()) {
+        defaultArgs.emplace_back(transformSymbolicName(*defaultArg->oC_SymbolicName()),
+            transformLiteral(*defaultArg->oC_Literal()));
+    }
+    return std::make_unique<CreateMacro>(std::move(macroName), std::move(macroExpression),
+        std::move(positionalArgs), std::move(defaultArgs));
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_port_db.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_port_db.cpp
new file mode 100644
index 0000000000..37d97efff4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_port_db.cpp
@@ -0,0 +1,26 @@
+#include "parser/port_db.h"
+#include "parser/transformer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformExportDatabase(
+    CypherParser::KU_ExportDatabaseContext& ctx) {
+    std::string filePath = transformStringLiteral(*ctx.StringLiteral());
+    auto exportDB = std::make_unique<ExportDB>(std::move(filePath));
+    if (ctx.kU_Options()) {
+        exportDB->setParsingOption(transformOptions(*ctx.kU_Options()));
+    }
+    return exportDB;
+}
+
+std::unique_ptr<Statement> Transformer::transformImportDatabase(
+    CypherParser::KU_ImportDatabaseContext& ctx) {
+    std::string filePath = transformStringLiteral(*ctx.StringLiteral());
+    return std::make_unique<ImportDB>(std::move(filePath));
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_projection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_projection.cpp
new file mode 100644
index 0000000000..e41363ebcd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_projection.cpp
@@ -0,0 +1,66 @@
+#include "parser/query/return_with_clause/return_clause.h"
+#include "parser/query/return_with_clause/with_clause.h"
+#include "parser/transformer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+WithClause Transformer::transformWith(CypherParser::OC_WithContext& ctx) {
+    auto withClause = WithClause(transformProjectionBody(*ctx.oC_ProjectionBody()));
+    if (ctx.oC_Where()) {
+        withClause.setWhereExpression(transformWhere(*ctx.oC_Where()));
+    }
+    return withClause;
+}
+
+ReturnClause Transformer::transformReturn(CypherParser::OC_ReturnContext& ctx) {
+    return ReturnClause(transformProjectionBody(*ctx.oC_ProjectionBody()));
+}
+
+ProjectionBody Transformer::transformProjectionBody(CypherParser::OC_ProjectionBodyContext& ctx) {
+    auto projectionBody = ProjectionBody(nullptr != ctx.DISTINCT(),
+        transformProjectionItems(*ctx.oC_ProjectionItems()));
+    if (ctx.oC_Order()) {
+        std::vector<std::unique_ptr<ParsedExpression>> orderByExpressions;
+        std::vector<bool> isAscOrders;
+        for (auto& sortItem : ctx.oC_Order()->oC_SortItem()) {
+            orderByExpressions.push_back(transformExpression(*sortItem->oC_Expression()));
+            isAscOrders.push_back(!(sortItem->DESC() || sortItem->DESCENDING()));
+        }
+        projectionBody.setOrderByExpressions(std::move(orderByExpressions), std::move(isAscOrders));
+    }
+    if (ctx.oC_Skip()) {
+        projectionBody.setSkipExpression(transformExpression(*ctx.oC_Skip()->oC_Expression()));
+    }
+    if (ctx.oC_Limit()) {
+        projectionBody.setLimitExpression(transformExpression(*ctx.oC_Limit()->oC_Expression()));
+    }
+    return projectionBody;
+}
+
+std::vector<std::unique_ptr<ParsedExpression>> Transformer::transformProjectionItems(
+    CypherParser::OC_ProjectionItemsContext& ctx) {
+    std::vector<std::unique_ptr<ParsedExpression>> projectionExpressions;
+    if (ctx.STAR()) {
+        projectionExpressions.push_back(
+            std::make_unique<ParsedExpression>(ExpressionType::STAR, ctx.STAR()->getText()));
+    }
+    for (auto& projectionItem : ctx.oC_ProjectionItem()) {
+        projectionExpressions.push_back(transformProjectionItem(*projectionItem));
+    }
+    return projectionExpressions;
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformProjectionItem(
+    CypherParser::OC_ProjectionItemContext& ctx) {
+    auto expression = transformExpression(*ctx.oC_Expression());
+    if (ctx.AS()) {
+        expression->setAlias(transformVariable(*ctx.oC_Variable()));
+    }
+    return expression;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_query.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_query.cpp
new file mode 100644
index 0000000000..526c24343d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_query.cpp
@@ -0,0 +1,60 @@
+#include "parser/query/regular_query.h"
+#include "parser/transformer.h"
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformQuery(CypherParser::OC_QueryContext& ctx) {
+    return transformRegularQuery(*ctx.oC_RegularQuery());
+}
+
+std::unique_ptr<Statement> Transformer::transformRegularQuery(
+    CypherParser::OC_RegularQueryContext& ctx) {
+    auto regularQuery = std::make_unique<RegularQuery>(transformSingleQuery(*ctx.oC_SingleQuery()));
+    for (auto unionClause : ctx.oC_Union()) {
+        regularQuery->addSingleQuery(transformSingleQuery(*unionClause->oC_SingleQuery()),
+            unionClause->ALL());
+    }
+    return regularQuery;
+}
+
+SingleQuery Transformer::transformSingleQuery(CypherParser::OC_SingleQueryContext& ctx) {
+    auto singleQuery =
+        ctx.oC_MultiPartQuery() ?
+            transformSinglePartQuery(*ctx.oC_MultiPartQuery()->oC_SinglePartQuery()) :
+            transformSinglePartQuery(*ctx.oC_SinglePartQuery());
+    if (ctx.oC_MultiPartQuery()) {
+        for (auto queryPart : ctx.oC_MultiPartQuery()->kU_QueryPart()) {
+            singleQuery.addQueryPart(transformQueryPart(*queryPart));
+        }
+    }
+    return singleQuery;
+}
+
+SingleQuery Transformer::transformSinglePartQuery(CypherParser::OC_SinglePartQueryContext& ctx) {
+    auto singleQuery = SingleQuery();
+    for (auto& readingClause : ctx.oC_ReadingClause()) {
+        singleQuery.addReadingClause(transformReadingClause(*readingClause));
+    }
+    for (auto& updatingClause : ctx.oC_UpdatingClause()) {
+        singleQuery.addUpdatingClause(transformUpdatingClause(*updatingClause));
+    }
+    if (ctx.oC_Return()) {
+        singleQuery.setReturnClause(transformReturn(*ctx.oC_Return()));
+    }
+    return singleQuery;
+}
+
+QueryPart Transformer::transformQueryPart(CypherParser::KU_QueryPartContext& ctx) {
+    auto queryPart = QueryPart(transformWith(*ctx.oC_With()));
+    for (auto& readingClause : ctx.oC_ReadingClause()) {
+        queryPart.addReadingClause(transformReadingClause(*readingClause));
+    }
+    for (auto& updatingClause : ctx.oC_UpdatingClause()) {
+        queryPart.addUpdatingClause(transformUpdatingClause(*updatingClause));
+    }
+    return queryPart;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_reading_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_reading_clause.cpp
new file mode 100644
index 0000000000..cd927d39ca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_reading_clause.cpp
@@ -0,0 +1,118 @@
+#include "common/assert.h"
+#include "parser/query/reading_clause/in_query_call_clause.h"
+#include "parser/query/reading_clause/load_from.h"
+#include "parser/query/reading_clause/match_clause.h"
+#include "parser/query/reading_clause/unwind_clause.h"
+#include "parser/transformer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<ReadingClause> Transformer::transformReadingClause(
+    CypherParser::OC_ReadingClauseContext& ctx) {
+    if (ctx.oC_Match()) {
+        return transformMatch(*ctx.oC_Match());
+    } else if (ctx.oC_Unwind()) {
+        return transformUnwind(*ctx.oC_Unwind());
+    } else if (ctx.kU_InQueryCall()) {
+        return transformInQueryCall(*ctx.kU_InQueryCall());
+    } else if (ctx.kU_LoadFrom()) {
+        return transformLoadFrom(*ctx.kU_LoadFrom());
+    }
+    KU_UNREACHABLE;
+}
+
+std::unique_ptr<ReadingClause> Transformer::transformMatch(CypherParser::OC_MatchContext& ctx) {
+    auto matchClauseType =
+        ctx.OPTIONAL() ? MatchClauseType::OPTIONAL_MATCH : MatchClauseType::MATCH;
+    auto matchClause =
+        std::make_unique<MatchClause>(transformPattern(*ctx.oC_Pattern()), matchClauseType);
+    if (ctx.oC_Where()) {
+        matchClause->setWherePredicate(transformWhere(*ctx.oC_Where()));
+    }
+    if (ctx.kU_Hint()) {
+        matchClause->setHint(transformJoinHint(*ctx.kU_Hint()->kU_JoinNode()));
+    }
+    return matchClause;
+}
+
+std::shared_ptr<JoinHintNode> Transformer::transformJoinHint(
+    CypherParser::KU_JoinNodeContext& ctx) {
+    if (!ctx.MULTI_JOIN().empty()) {
+        auto joinNode = std::make_shared<JoinHintNode>();
+        joinNode->addChild(transformJoinHint(*ctx.kU_JoinNode(0)));
+        for (auto& schemaNameCtx : ctx.oC_SchemaName()) {
+            joinNode->addChild(std::make_shared<JoinHintNode>(transformSchemaName(*schemaNameCtx)));
+        }
+        return joinNode;
+    }
+    if (!ctx.oC_SchemaName().empty()) {
+        return std::make_shared<JoinHintNode>(transformSchemaName(*ctx.oC_SchemaName(0)));
+    }
+    if (ctx.kU_JoinNode().size() == 1) {
+        return transformJoinHint(*ctx.kU_JoinNode(0));
+    }
+    KU_ASSERT(ctx.kU_JoinNode().size() == 2);
+    auto joinNode = std::make_shared<JoinHintNode>();
+    joinNode->addChild(transformJoinHint(*ctx.kU_JoinNode(0)));
+    joinNode->addChild(transformJoinHint(*ctx.kU_JoinNode(1)));
+    return joinNode;
+}
+
+std::unique_ptr<ReadingClause> Transformer::transformUnwind(CypherParser::OC_UnwindContext& ctx) {
+    auto expression = transformExpression(*ctx.oC_Expression());
+    auto transformedVariable = transformVariable(*ctx.oC_Variable());
+    return std::make_unique<UnwindClause>(std::move(expression), std::move(transformedVariable));
+}
+
+std::vector<YieldVariable> Transformer::transformYieldVariables(
+    CypherParser::OC_YieldItemsContext& ctx) {
+    std::vector<YieldVariable> yieldVariables;
+    std::string name;
+    for (auto& yieldItem : ctx.oC_YieldItem()) {
+        std::string alias;
+        if (yieldItem->AS()) {
+            alias = transformVariable(*yieldItem->oC_Variable(1));
+        }
+        name = transformVariable(*yieldItem->oC_Variable(0));
+        yieldVariables.emplace_back(name, alias);
+    }
+    return yieldVariables;
+}
+
+std::unique_ptr<ReadingClause> Transformer::transformInQueryCall(
+    CypherParser::KU_InQueryCallContext& ctx) {
+    auto functionExpression =
+        Transformer::transformFunctionInvocation(*ctx.oC_FunctionInvocation());
+    std::vector<YieldVariable> yieldVariables;
+    if (ctx.oC_YieldItems()) {
+        yieldVariables = transformYieldVariables(*ctx.oC_YieldItems());
+    }
+    auto inQueryCall = std::make_unique<InQueryCallClause>(std::move(functionExpression),
+        std::move(yieldVariables));
+    if (ctx.oC_Where()) {
+        inQueryCall->setWherePredicate(transformWhere(*ctx.oC_Where()));
+    }
+    return inQueryCall;
+}
+
+std::unique_ptr<ReadingClause> Transformer::transformLoadFrom(
+    CypherParser::KU_LoadFromContext& ctx) {
+    auto source = transformScanSource(*ctx.kU_ScanSource());
+    auto loadFrom = std::make_unique<LoadFrom>(std::move(source));
+    if (ctx.kU_ColumnDefinitions()) {
+        loadFrom->setPropertyDefinitions(transformColumnDefinitions(*ctx.kU_ColumnDefinitions()));
+    }
+    if (ctx.kU_Options()) {
+        loadFrom->setParingOptions(transformOptions(*ctx.kU_Options()));
+    }
+    if (ctx.oC_Where()) {
+        loadFrom->setWherePredicate(transformWhere(*ctx.oC_Where()));
+    }
+    return loadFrom;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_standalone_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_standalone_call.cpp
new file mode 100644
index 0000000000..9063c2c3c0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_standalone_call.cpp
@@ -0,0 +1,21 @@
+#include "parser/standalone_call.h"
+#include "parser/standalone_call_function.h"
+#include "parser/transformer.h"
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformStandaloneCall(
+    CypherParser::KU_StandaloneCallContext& ctx) {
+    if (ctx.oC_FunctionInvocation()) {
+        return std::make_unique<StandaloneCallFunction>(
+            transformFunctionInvocation(*ctx.oC_FunctionInvocation()));
+    } else {
+        auto optionName = transformSymbolicName(*ctx.oC_SymbolicName());
+        auto parameter = transformExpression(*ctx.oC_Expression());
+        return std::make_unique<StandaloneCall>(std::move(optionName), std::move(parameter));
+    }
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_transaction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_transaction.cpp
new file mode 100644
index 0000000000..22adaeecf2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_transaction.cpp
@@ -0,0 +1,32 @@
+#include "common/assert.h"
+#include "parser/transaction_statement.h"
+#include "parser/transformer.h"
+
+using namespace lbug::transaction;
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformTransaction(
+    CypherParser::KU_TransactionContext& ctx) {
+    if (ctx.TRANSACTION()) {
+        if (ctx.READ()) {
+            return std::make_unique<TransactionStatement>(TransactionAction::BEGIN_READ);
+        }
+        return std::make_unique<TransactionStatement>(TransactionAction::BEGIN_WRITE);
+    }
+    if (ctx.COMMIT()) {
+        return std::make_unique<TransactionStatement>(TransactionAction::COMMIT);
+    }
+    if (ctx.ROLLBACK()) {
+        return std::make_unique<TransactionStatement>(TransactionAction::ROLLBACK);
+    }
+    if (ctx.CHECKPOINT()) {
+        return std::make_unique<TransactionStatement>(TransactionAction::CHECKPOINT);
+    }
+    KU_UNREACHABLE;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_updating_clause.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_updating_clause.cpp
new file mode 100644
index 0000000000..dbd4db57dd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_updating_clause.cpp
@@ -0,0 +1,79 @@
+#include "common/assert.h"
+#include "parser/query/updating_clause/delete_clause.h"
+#include "parser/query/updating_clause/insert_clause.h"
+#include "parser/query/updating_clause/merge_clause.h"
+#include "parser/query/updating_clause/set_clause.h"
+#include "parser/transformer.h"
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<UpdatingClause> Transformer::transformUpdatingClause(
+    CypherParser::OC_UpdatingClauseContext& ctx) {
+    if (ctx.oC_Create()) {
+        return transformCreate(*ctx.oC_Create());
+    } else if (ctx.oC_Merge()) {
+        return transformMerge(*ctx.oC_Merge());
+    } else if (ctx.oC_Set()) {
+        return transformSet(*ctx.oC_Set());
+    } else {
+        KU_ASSERT(ctx.oC_Delete());
+        return transformDelete(*ctx.oC_Delete());
+    }
+}
+
+std::unique_ptr<UpdatingClause> Transformer::transformCreate(CypherParser::OC_CreateContext& ctx) {
+    return std::make_unique<InsertClause>(transformPattern(*ctx.oC_Pattern()));
+}
+
+std::unique_ptr<UpdatingClause> Transformer::transformMerge(CypherParser::OC_MergeContext& ctx) {
+    auto mergeClause = std::make_unique<MergeClause>(transformPattern(*ctx.oC_Pattern()));
+    for (auto& mergeActionCtx : ctx.oC_MergeAction()) {
+        if (mergeActionCtx->MATCH()) {
+            for (auto& setItemCtx : mergeActionCtx->oC_Set()->oC_SetItem()) {
+                mergeClause->addOnMatchSetItems(transformSetItem(*setItemCtx));
+            }
+        } else {
+            for (auto& setItemCtx : mergeActionCtx->oC_Set()->oC_SetItem()) {
+                mergeClause->addOnCreateSetItems(transformSetItem(*setItemCtx));
+            }
+        }
+    }
+    return mergeClause;
+}
+
+std::unique_ptr<UpdatingClause> Transformer::transformSet(CypherParser::OC_SetContext& ctx) {
+    auto setClause = std::make_unique<SetClause>();
+    if (ctx.kU_Properties()) {
+        auto child = transformAtom(*ctx.oC_Atom());
+        for (auto i = 0u; i < ctx.kU_Properties()->oC_PropertyKeyName().size(); ++i) {
+            auto propertyKeyName = createPropertyExpression(
+                *ctx.kU_Properties()->oC_PropertyKeyName(i), child->copy());
+            auto expression = transformExpression(*ctx.kU_Properties()->oC_Expression(i));
+            setClause->addSetItem(make_pair(std::move(propertyKeyName), std::move(expression)));
+        }
+    } else {
+        for (auto& setItem : ctx.oC_SetItem()) {
+            setClause->addSetItem(transformSetItem(*setItem));
+        }
+    }
+    return setClause;
+}
+
+parsed_expr_pair Transformer::transformSetItem(CypherParser::OC_SetItemContext& ctx) {
+    return make_pair(transformProperty(*ctx.oC_PropertyExpression()),
+        transformExpression(*ctx.oC_Expression()));
+}
+
+std::unique_ptr<UpdatingClause> Transformer::transformDelete(CypherParser::OC_DeleteContext& ctx) {
+    auto deleteClauseType =
+        ctx.DETACH() ? common::DeleteNodeType::DETACH_DELETE : common::DeleteNodeType::DELETE;
+    auto deleteClause = std::make_unique<DeleteClause>(deleteClauseType);
+    for (auto& expression : ctx.oC_Expression()) {
+        deleteClause->addExpression(transformExpression(*expression));
+    }
+    return deleteClause;
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_use_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_use_database.cpp
new file mode 100644
index 0000000000..d72b83e8e8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transform/transform_use_database.cpp
@@ -0,0 +1,14 @@
+#include "parser/transformer.h"
+#include "parser/use_database.h"
+
+namespace lbug {
+namespace parser {
+
+std::unique_ptr<Statement> Transformer::transformUseDatabase(
+    CypherParser::KU_UseDatabaseContext& ctx) {
+    auto dbName = transformSchemaName(*ctx.oC_SchemaName());
+    return std::make_unique<UseDatabase>(std::move(dbName));
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transformer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transformer.cpp
new file mode 100644
index 0000000000..003a25f0bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/transformer.cpp
@@ -0,0 +1,213 @@
+#include "parser/transformer.h"
+
+#include <cstdlib>
+
+#include "common/assert.h"
+#include "common/exception/parser.h"
+#include "extension/transformer_extension.h"
+#include "parser/explain_statement.h"
+#include "parser/query/regular_query.h" // IWYU pragma: keep (fixes a forward declaration error)
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace parser {
+
+std::vector<std::shared_ptr<Statement>> Transformer::transform() {
+    std::vector<std::shared_ptr<Statement>> statements;
+    for (auto& oc_Statement : root.oC_Cypher()) {
+        auto statement = transformStatement(*oc_Statement->oC_Statement());
+        if (oc_Statement->oC_AnyCypherOption()) {
+            auto cypherOption = oc_Statement->oC_AnyCypherOption();
+            auto explainType = ExplainType::PROFILE;
+            if (cypherOption->oC_Explain()) {
+                explainType = cypherOption->oC_Explain()->LOGICAL() ? ExplainType::LOGICAL_PLAN :
+                                                                      ExplainType::PHYSICAL_PLAN;
+            }
+            statements.push_back(
+                std::make_unique<ExplainStatement>(std::move(statement), explainType));
+            continue;
+        }
+        statements.push_back(std::move(statement));
+    }
+    return statements;
+}
+
+std::unique_ptr<Statement> Transformer::transformStatement(CypherParser::OC_StatementContext& ctx) {
+    if (ctx.oC_Query()) {
+        return transformQuery(*ctx.oC_Query());
+    } else if (ctx.kU_CreateNodeTable()) {
+        return transformCreateNodeTable(*ctx.kU_CreateNodeTable());
+    } else if (ctx.kU_CreateRelTable()) {
+        return transformCreateRelGroup(*ctx.kU_CreateRelTable());
+    } else if (ctx.kU_CreateSequence()) {
+        return transformCreateSequence(*ctx.kU_CreateSequence());
+    } else if (ctx.kU_CreateType()) {
+        return transformCreateType(*ctx.kU_CreateType());
+    } else if (ctx.kU_CreateUser()) {
+        return transformExtensionStatement(ctx.kU_CreateUser());
+    } else if (ctx.kU_CreateRole()) {
+        return transformExtensionStatement(ctx.kU_CreateRole());
+    } else if (ctx.kU_Drop()) {
+        return transformDrop(*ctx.kU_Drop());
+    } else if (ctx.kU_AlterTable()) {
+        return transformAlterTable(*ctx.kU_AlterTable());
+    } else if (ctx.kU_CopyFromByColumn()) {
+        return transformCopyFromByColumn(*ctx.kU_CopyFromByColumn());
+    } else if (ctx.kU_CopyFrom()) {
+        return transformCopyFrom(*ctx.kU_CopyFrom());
+    } else if (ctx.kU_CopyTO()) {
+        return transformCopyTo(*ctx.kU_CopyTO());
+    } else if (ctx.kU_StandaloneCall()) {
+        return transformStandaloneCall(*ctx.kU_StandaloneCall());
+    } else if (ctx.kU_CreateMacro()) {
+        return transformCreateMacro(*ctx.kU_CreateMacro());
+    } else if (ctx.kU_CommentOn()) {
+        return transformCommentOn(*ctx.kU_CommentOn());
+    } else if (ctx.kU_Transaction()) {
+        return transformTransaction(*ctx.kU_Transaction());
+    } else if (ctx.kU_Extension()) {
+        return transformExtension(*ctx.kU_Extension());
+    } else if (ctx.kU_ExportDatabase()) {
+        return transformExportDatabase(*ctx.kU_ExportDatabase());
+    } else if (ctx.kU_ImportDatabase()) {
+        return transformImportDatabase(*ctx.kU_ImportDatabase());
+    } else if (ctx.kU_AttachDatabase()) {
+        return transformAttachDatabase(*ctx.kU_AttachDatabase());
+    } else if (ctx.kU_DetachDatabase()) {
+        return transformDetachDatabase(*ctx.kU_DetachDatabase());
+    } else if (ctx.kU_UseDatabase()) {
+        return transformUseDatabase(*ctx.kU_UseDatabase());
+    } else {
+        KU_UNREACHABLE;
+    }
+}
+
+std::unique_ptr<ParsedExpression> Transformer::transformWhere(CypherParser::OC_WhereContext& ctx) {
+    return transformExpression(*ctx.oC_Expression());
+}
+
+std::string Transformer::transformSchemaName(CypherParser::OC_SchemaNameContext& ctx) {
+    return transformSymbolicName(*ctx.oC_SymbolicName());
+}
+
+std::string Transformer::transformStringLiteral(antlr4::tree::TerminalNode& stringLiteral) {
+    auto str = stringLiteral.getText();
+    std::string content = str.substr(1, str.length() - 2);
+    std::string result;
+    result.reserve(content.length());
+    for (auto i = 0u; i < content.length(); i++) {
+        if (content[i] == '\\' && i + 1 < content.length()) {
+            char next = content[i + 1];
+            switch (next) {
+            case '\\':
+            case '\'':
+            case '"': {
+                result += next;
+                i++;
+            } break;
+            case 'b':
+            case 'B': {
+                result += '\b';
+                i++;
+            } break;
+            case 'f':
+            case 'F': {
+                result += '\f';
+                i++;
+            } break;
+            case 'n':
+            case 'N': {
+                result += '\n';
+                i++;
+            } break;
+            case 'r':
+            case 'R': {
+                result += '\r';
+                i++;
+            } break;
+            case 't':
+            case 'T': {
+                result += '\t';
+                i++;
+            } break;
+            case 'x':
+            case 'X': {
+                result += content.substr(i, 4);
+                i += 3;
+            } break;
+            case 'u':
+            case 'U': {
+                // Handle \uHHHH and \UHHHHHHHH unicode escape sequences
+                if (next == 'u' || next == 'U') {
+                    int hexDigits = (next == 'u') ? 4 : 8;
+                    if (i + 1 + hexDigits > content.length()) {
+                        KU_UNREACHABLE;
+                    }
+                    std::string hexStr = content.substr(i + 2, hexDigits);
+                    char* endPtr = nullptr;
+                    long hexValue = std::strtol(hexStr.c_str(), &endPtr, 16);
+                    if (endPtr != hexStr.c_str() + hexDigits) {
+                        KU_UNREACHABLE;
+                    }
+                    // Convert Unicode code point to UTF-8
+                    if (hexValue <= 0x7F) {
+                        result += static_cast<char>(hexValue);
+                    } else if (hexValue <= 0x7FF) {
+                        result += static_cast<char>(0xC0 | (hexValue >> 6));
+                        result += static_cast<char>(0x80 | (hexValue & 0x3F));
+                    } else if (hexValue <= 0xFFFF) {
+                        result += static_cast<char>(0xE0 | (hexValue >> 12));
+                        result += static_cast<char>(0x80 | ((hexValue >> 6) & 0x3F));
+                        result += static_cast<char>(0x80 | (hexValue & 0x3F));
+                    } else if (hexValue <= 0x10FFFF) {
+                        result += static_cast<char>(0xF0 | (hexValue >> 18));
+                        result += static_cast<char>(0x80 | ((hexValue >> 12) & 0x3F));
+                        result += static_cast<char>(0x80 | ((hexValue >> 6) & 0x3F));
+                        result += static_cast<char>(0x80 | (hexValue & 0x3F));
+                    } else {
+                        KU_UNREACHABLE;
+                    }
+                    i += 1 + hexDigits;
+                }
+            } break;
+            default:
+                KU_UNREACHABLE;
+            }
+        } else {
+            result += content[i];
+        }
+    }
+
+    return result;
+}
+
+std::string Transformer::transformVariable(CypherParser::OC_VariableContext& ctx) {
+    return transformSymbolicName(*ctx.oC_SymbolicName());
+}
+std::string Transformer::transformSymbolicName(CypherParser::OC_SymbolicNameContext& ctx) {
+    if (ctx.EscapedSymbolicName()) {
+        std::string escapedSymbolName = ctx.EscapedSymbolicName()->getText();
+        // escapedSymbolName symbol will be of form "`Some.Value`". Therefore, we need to sanitize
+        // it such that we don't store the symbol with escape character.
+        return escapedSymbolName.substr(1, escapedSymbolName.size() - 2);
+    } else {
+        KU_ASSERT(ctx.HexLetter() || ctx.UnescapedSymbolicName() || ctx.kU_NonReservedKeywords());
+        return ctx.getText();
+    }
+}
+
+std::unique_ptr<Statement> Transformer::transformExtensionStatement(
+    antlr4::ParserRuleContext* ctx) {
+    for (auto& transformerExtension : transformerExtensions) {
+        auto statement = transformerExtension->transform(ctx);
+        if (statement) {
+            return statement;
+        }
+    }
+    throw common::ParserException{
+        "Failed parse the statement. Do you forget to load the extension?"};
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/visitor/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/visitor/CMakeLists.txt
new file mode 100644
index 0000000000..32fbc07f93
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/visitor/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(
+        lbug_parser_visitor
+        OBJECT
+        standalone_call_rewriter.cpp
+        statement_read_write_analyzer.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_parser_visitor>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/visitor/standalone_call_rewriter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/visitor/standalone_call_rewriter.cpp
new file mode 100644
index 0000000000..69c5910e51
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/visitor/standalone_call_rewriter.cpp
@@ -0,0 +1,50 @@
+#include "parser/visitor/standalone_call_rewriter.h"
+
+#include "binder/binder.h"
+#include "binder/bound_standalone_call_function.h"
+#include "catalog/catalog.h"
+#include "common/exception/parser.h"
+#include "main/client_context.h"
+#include "parser/expression/parsed_function_expression.h"
+#include "parser/standalone_call_function.h"
+#include "transaction/transaction.h"
+#include "transaction/transaction_context.h"
+
+namespace lbug {
+namespace parser {
+
+std::string StandaloneCallRewriter::getRewriteQuery(const Statement& statement) {
+    visit(statement);
+    return rewriteQuery;
+}
+
+void StandaloneCallRewriter::visitStandaloneCallFunction(const Statement& statement) {
+    auto& standaloneCallFunc = statement.constCast<StandaloneCallFunction>();
+    main::ClientContext::TransactionHelper::runFuncInTransaction(
+        *transaction::TransactionContext::Get(*context),
+        [&]() -> void {
+            auto funcName = standaloneCallFunc.getFunctionExpression()
+                                ->constPtrCast<ParsedFunctionExpression>()
+                                ->getFunctionName();
+            if (!catalog::Catalog::Get(*context)->containsFunction(
+                    transaction::Transaction::Get(*context), funcName) &&
+                !singleStatement) {
+                throw common::ParserException{
+                    funcName + " must be called in a query which doesn't have other statements."};
+            }
+            binder::Binder binder{context};
+            const auto boundStatement = binder.bind(standaloneCallFunc);
+            auto& boundStandaloneCall =
+                boundStatement->constCast<binder::BoundStandaloneCallFunction>();
+            const auto func =
+                boundStandaloneCall.getTableFunction().constPtrCast<function::TableFunction>();
+            if (func->rewriteFunc) {
+                rewriteQuery = func->rewriteFunc(*context, *boundStandaloneCall.getBindData());
+            }
+        },
+        true /*readOnlyStatement*/, false /*isTransactionStatement*/,
+        main::ClientContext::TransactionHelper::TransactionCommitAction::COMMIT_IF_NEW);
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/parser/visitor/statement_read_write_analyzer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/visitor/statement_read_write_analyzer.cpp
new file mode 100644
index 0000000000..d54a31c8c5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/parser/visitor/statement_read_write_analyzer.cpp
@@ -0,0 +1,54 @@
+#include "parser/visitor/statement_read_write_analyzer.h"
+
+#include "main/client_context.h"
+#include "main/db_config.h"
+#include "parser/expression/parsed_expression_visitor.h"
+#include "parser/query/reading_clause/reading_clause.h"
+#include "parser/query/return_with_clause/with_clause.h"
+
+namespace lbug {
+namespace parser {
+
+void StatementReadWriteAnalyzer::visitExtension(const Statement& /*statement*/) {
+    // We allow LOAD EXTENSION to run in read-only mode.
+    if (context->getDBConfig()->readOnly) {
+        readOnly = true;
+    } else {
+        readOnly = false;
+    }
+}
+
+void StatementReadWriteAnalyzer::visitReadingClause(const ReadingClause* readingClause) {
+    if (readingClause->hasWherePredicate()) {
+        if (!isExprReadOnly(readingClause->getWherePredicate())) {
+            readOnly = false;
+        }
+    }
+}
+
+void StatementReadWriteAnalyzer::visitWithClause(const WithClause* withClause) {
+    for (auto& expr : withClause->getProjectionBody()->getProjectionExpressions()) {
+        if (!isExprReadOnly(expr.get())) {
+            readOnly = false;
+            return;
+        }
+    }
+}
+
+void StatementReadWriteAnalyzer::visitReturnClause(const ReturnClause* returnClause) {
+    for (auto& expr : returnClause->getProjectionBody()->getProjectionExpressions()) {
+        if (!isExprReadOnly(expr.get())) {
+            readOnly = false;
+            return;
+        }
+    }
+}
+
+bool StatementReadWriteAnalyzer::isExprReadOnly(const ParsedExpression* expr) {
+    auto analyzer = ReadWriteExprAnalyzer(context);
+    analyzer.visit(expr);
+    return analyzer.isReadOnly();
+}
+
+} // namespace parser
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/CMakeLists.txt
new file mode 100644
index 0000000000..5d600fea53
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/CMakeLists.txt
@@ -0,0 +1,14 @@
+add_subdirectory(join_order)
+add_subdirectory(operator)
+add_subdirectory(plan)
+
+add_library(lbug_planner
+        OBJECT
+        join_order_enumerator_context.cpp
+        planner.cpp
+        query_planner.cpp
+        subplans_table.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/CMakeLists.txt
new file mode 100644
index 0000000000..76ce7a3212
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/CMakeLists.txt
@@ -0,0 +1,12 @@
+add_library(lbug_planner_join_order
+        OBJECT
+        cardinality_estimator.cpp
+        cost_model.cpp
+        join_order_util.cpp
+        join_plan_solver.cpp
+        join_tree.cpp
+        join_tree_constructor.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner_join_order>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/cardinality_estimator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/cardinality_estimator.cpp
new file mode 100644
index 0000000000..e99a651ace
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/cardinality_estimator.cpp
@@ -0,0 +1,247 @@
+#include "planner/join_order/cardinality_estimator.h"
+
+#include "binder/expression/property_expression.h"
+#include "main/client_context.h"
+#include "planner/join_order/join_order_util.h"
+#include "planner/operator/logical_aggregate.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/scan/logical_scan_node_table.h"
+#include "storage/storage_manager.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace planner {
+
+static cardinality_t atLeastOne(uint64_t x) {
+    return x == 0 ? 1 : x;
+}
+
+void CardinalityEstimator::init(const QueryGraph& queryGraph) {
+    for (auto i = 0u; i < queryGraph.getNumQueryNodes(); ++i) {
+        init(*queryGraph.getQueryNode(i));
+    }
+    for (uint64_t i = 0u; i < queryGraph.getNumQueryRels(); ++i) {
+        auto rel = queryGraph.getQueryRel(i);
+        if (QueryRelTypeUtils::isRecursive(rel->getRelType())) {
+            auto recursiveInfo = rel->getRecursiveInfo();
+            init(*recursiveInfo->node);
+        }
+    }
+}
+
+void CardinalityEstimator::init(const NodeExpression& node) {
+    auto key = node.getInternalID()->getUniqueName();
+    cardinality_t numNodes = 0u;
+    auto storageManager = storage::StorageManager::Get(*context);
+    auto transaction = transaction::Transaction::Get(*context);
+    for (auto tableID : node.getTableIDs()) {
+        auto stats =
+            storageManager->getTable(tableID)->cast<storage::NodeTable>().getStats(transaction);
+        numNodes += stats.getTableCard();
+        if (!nodeTableStats.contains(tableID)) {
+            nodeTableStats.insert({tableID, std::move(stats)});
+        }
+    }
+    if (!nodeIDName2dom.contains(key)) {
+        nodeIDName2dom.insert({key, numNodes});
+    }
+}
+
+void CardinalityEstimator::rectifyCardinality(const Expression& nodeID, cardinality_t card) {
+    KU_ASSERT(nodeIDName2dom.contains(nodeID.getUniqueName()));
+    auto newCard = std::min(nodeIDName2dom.at(nodeID.getUniqueName()), card);
+    nodeIDName2dom[nodeID.getUniqueName()] = newCard;
+}
+
+cardinality_t CardinalityEstimator::getNodeIDDom(const std::string& nodeIDName) const {
+    KU_ASSERT(nodeIDName2dom.contains(nodeIDName));
+    return nodeIDName2dom.at(nodeIDName);
+}
+
+uint64_t CardinalityEstimator::estimateScanNode(const LogicalOperator& op) const {
+    const auto& scan = op.constCast<const LogicalScanNodeTable&>();
+    switch (scan.getScanType()) {
+    case LogicalScanNodeTableType::PRIMARY_KEY_SCAN:
+        return 1;
+    default:
+        return atLeastOne(getNodeIDDom(scan.getNodeID()->getUniqueName()));
+    }
+}
+
+uint64_t CardinalityEstimator::estimateAggregate(const LogicalAggregate& op) const {
+    // TODO(Royi) we can use HLL to better estimate the number of distinct keys here
+    return op.getKeys().empty() ? 1 : op.getChild(0)->getCardinality();
+}
+
+cardinality_t CardinalityEstimator::multiply(double extensionRate, cardinality_t card) const {
+    return atLeastOne(extensionRate * card);
+}
+
+uint64_t CardinalityEstimator::estimateHashJoin(
+    const std::vector<binder::expression_pair>& joinConditions, const LogicalOperator& probeOp,
+    const LogicalOperator& buildOp) const {
+    if (LogicalHashJoin::isNodeIDOnlyJoin(joinConditions)) {
+        cardinality_t denominator = 1u;
+        auto joinKeys = LogicalHashJoin::getJoinNodeIDs(joinConditions);
+        for (auto& joinKey : joinKeys) {
+            if (nodeIDName2dom.contains(joinKey->getUniqueName())) {
+                denominator *= getNodeIDDom(joinKey->getUniqueName());
+            }
+        }
+        return atLeastOne(probeOp.getCardinality() *
+                          JoinOrderUtil::getJoinKeysFlatCardinality(joinKeys, buildOp) /
+                          atLeastOne(denominator));
+    } else {
+        // Naively estimate the cardinality if the join is non-ID based
+        cardinality_t estCardinality = probeOp.getCardinality() * buildOp.getCardinality();
+        for (size_t i = 0; i < joinConditions.size(); ++i) {
+            estCardinality *= PlannerKnobs::EQUALITY_PREDICATE_SELECTIVITY;
+        }
+        return atLeastOne(estCardinality);
+    }
+}
+
+uint64_t CardinalityEstimator::estimateCrossProduct(const LogicalOperator& probeOp,
+    const LogicalOperator& buildOp) const {
+    return atLeastOne(probeOp.getCardinality() * buildOp.getCardinality());
+}
+
+uint64_t CardinalityEstimator::estimateIntersect(const expression_vector& joinNodeIDs,
+    const LogicalOperator& probeOp, const std::vector<LogicalOperator*>& buildOps) const {
+    // Formula 1: treat intersect as a Filter on probe side.
+    uint64_t estCardinality1 =
+        probeOp.getCardinality() * PlannerKnobs::NON_EQUALITY_PREDICATE_SELECTIVITY;
+    // Formula 2: assume independence on join conditions.
+    cardinality_t denominator = 1u;
+    for (auto& joinNodeID : joinNodeIDs) {
+        denominator *= getNodeIDDom(joinNodeID->getUniqueName());
+    }
+    auto numerator = probeOp.getCardinality();
+    for (auto& buildOp : buildOps) {
+        numerator *= buildOp->getCardinality();
+    }
+    auto estCardinality2 = numerator / atLeastOne(denominator);
+    // Pick minimum between the two formulas.
+    return atLeastOne(std::min<uint64_t>(estCardinality1, estCardinality2));
+}
+
+uint64_t CardinalityEstimator::estimateFlatten(const LogicalOperator& childOp,
+    f_group_pos groupPosToFlatten) const {
+    auto group = childOp.getSchema()->getGroup(groupPosToFlatten);
+    return atLeastOne(childOp.getCardinality() * group->cardinalityMultiplier);
+}
+
+static bool isPrimaryKey(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::PROPERTY) {
+        return false;
+    }
+    return ((PropertyExpression&)expression).isPrimaryKey();
+}
+
+static bool isSingleLabelledProperty(const Expression& expression) {
+    if (expression.expressionType != ExpressionType::PROPERTY) {
+        return false;
+    }
+    return expression.constCast<PropertyExpression>().isSingleLabel();
+}
+
+static std::optional<cardinality_t> getTableStatsIfPossible(main::ClientContext* context,
+    const Expression& predicate,
+    const std::unordered_map<common::table_id_t, storage::TableStats>& nodeTableStats) {
+    KU_ASSERT(predicate.getNumChildren() >= 1);
+    if (isSingleLabelledProperty(*predicate.getChild(0))) {
+        auto& propertyExpr = predicate.getChild(0)->cast<PropertyExpression>();
+        auto tableID = propertyExpr.getSingleTableID();
+        if (nodeTableStats.contains(tableID) && propertyExpr.hasProperty(tableID)) {
+            auto transaction = Transaction::Get(*context);
+            auto entry =
+                catalog::Catalog::Get(*context)->getTableCatalogEntry(transaction, tableID);
+            auto columnID = entry->getColumnID(propertyExpr.getPropertyName());
+            if (columnID != INVALID_COLUMN_ID && columnID != ROW_IDX_COLUMN_ID) {
+                auto& stats = nodeTableStats.at(tableID);
+                return atLeastOne(stats.getNumDistinctValues(columnID));
+            }
+        }
+    }
+    return {};
+}
+
+uint64_t CardinalityEstimator::estimateFilter(const LogicalOperator& childPlan,
+    const Expression& predicate) const {
+    if (predicate.expressionType == ExpressionType::EQUALS) {
+        if (isPrimaryKey(*predicate.getChild(0)) || isPrimaryKey(*predicate.getChild(1))) {
+            return 1;
+        } else {
+            const auto numDistinctValues =
+                getTableStatsIfPossible(context, predicate, nodeTableStats);
+            if (numDistinctValues.has_value()) {
+                return atLeastOne(childPlan.getCardinality() / numDistinctValues.value());
+            }
+            return atLeastOne(
+                childPlan.getCardinality() * PlannerKnobs::EQUALITY_PREDICATE_SELECTIVITY);
+        }
+    } else {
+        return atLeastOne(
+            childPlan.getCardinality() * PlannerKnobs::NON_EQUALITY_PREDICATE_SELECTIVITY);
+    }
+}
+
+uint64_t CardinalityEstimator::getNumNodes(const Transaction*,
+    const std::vector<table_id_t>& tableIDs) const {
+    cardinality_t numNodes = 0u;
+    for (auto& tableID : tableIDs) {
+        KU_ASSERT(nodeTableStats.contains(tableID));
+        numNodes += nodeTableStats.at(tableID).getTableCard();
+    }
+    return atLeastOne(numNodes);
+}
+
+uint64_t CardinalityEstimator::getNumRels(const Transaction* transaction,
+    const std::vector<table_id_t>& tableIDs) const {
+    cardinality_t numRels = 0u;
+    for (auto tableID : tableIDs) {
+        numRels +=
+            storage::StorageManager::Get(*context)->getTable(tableID)->getNumTotalRows(transaction);
+    }
+    return atLeastOne(numRels);
+}
+
+double CardinalityEstimator::getExtensionRate(const RelExpression& rel,
+    const NodeExpression& boundNode, const Transaction* transaction) const {
+    auto numBoundNodes = static_cast<double>(getNumNodes(transaction, boundNode.getTableIDs()));
+    auto numRels = static_cast<double>(getNumRels(transaction, rel.getInnerRelTableIDs()));
+    KU_ASSERT(numBoundNodes > 0);
+    auto oneHopExtensionRate = numRels / atLeastOne(numBoundNodes);
+    switch (rel.getRelType()) {
+    case QueryRelType::NON_RECURSIVE: {
+        return oneHopExtensionRate;
+    }
+    case QueryRelType::VARIABLE_LENGTH_WALK:
+    case QueryRelType::VARIABLE_LENGTH_TRAIL:
+    case QueryRelType::VARIABLE_LENGTH_ACYCLIC: {
+        auto rate = oneHopExtensionRate *
+                    std::max<uint16_t>(rel.getRecursiveInfo()->bindData->upperBound, 1);
+        return rate * context->getClientConfig()->recursivePatternCardinalityScaleFactor;
+    }
+    case QueryRelType::SHORTEST:
+    case QueryRelType::ALL_SHORTEST:
+    case QueryRelType::WEIGHTED_SHORTEST:
+    case QueryRelType::ALL_WEIGHTED_SHORTEST: {
+        auto rate = std::min<double>(
+            oneHopExtensionRate *
+                std::max<uint16_t>(rel.getRecursiveInfo()->bindData->upperBound, 1),
+            numRels);
+        return rate * context->getClientConfig()->recursivePatternCardinalityScaleFactor;
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/cost_model.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/cost_model.cpp
new file mode 100644
index 0000000000..25f3e4c3cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/cost_model.cpp
@@ -0,0 +1,57 @@
+#include "planner/join_order/cost_model.h"
+
+#include "common/constants.h"
+#include "planner/join_order/join_order_util.h"
+#include "planner/operator/logical_hash_join.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+uint64_t CostModel::computeExtendCost(const LogicalPlan& childPlan) {
+    return childPlan.getCost() + childPlan.getCardinality();
+}
+
+uint64_t CostModel::computeHashJoinCost(const std::vector<binder::expression_pair>& joinConditions,
+    const LogicalPlan& probe, const LogicalPlan& build) {
+    return computeHashJoinCost(LogicalHashJoin::getJoinNodeIDs(joinConditions), probe, build);
+}
+
+uint64_t CostModel::computeHashJoinCost(const binder::expression_vector& joinNodeIDs,
+    const LogicalPlan& probe, const LogicalPlan& build) {
+    uint64_t cost = 0ul;
+    cost += probe.getCost();
+    cost += build.getCost();
+    cost += probe.getCardinality();
+    cost += PlannerKnobs::BUILD_PENALTY *
+            JoinOrderUtil::getJoinKeysFlatCardinality(joinNodeIDs, build.getLastOperatorRef());
+    return cost;
+}
+
+uint64_t CostModel::computeMarkJoinCost(const std::vector<binder::expression_pair>& joinConditions,
+    const LogicalPlan& probe, const LogicalPlan& build) {
+    return computeMarkJoinCost(LogicalHashJoin::getJoinNodeIDs(joinConditions), probe, build);
+}
+
+uint64_t CostModel::computeMarkJoinCost(const binder::expression_vector& joinNodeIDs,
+    const LogicalPlan& probe, const LogicalPlan& build) {
+    return computeHashJoinCost(joinNodeIDs, probe, build);
+}
+
+uint64_t CostModel::computeIntersectCost(const LogicalPlan& probePlan,
+    const std::vector<LogicalPlan>& buildPlans) {
+    uint64_t cost = 0ul;
+    cost += probePlan.getCost();
+    // TODO(Xiyang): think of how to calculate intersect cost such that it will be picked in worst
+    // case.
+    cost += probePlan.getCardinality();
+    for (auto& buildPlan : buildPlans) {
+        KU_ASSERT(buildPlan.getCardinality() >= 1);
+        cost += buildPlan.getCost();
+    }
+    return cost;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_order_util.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_order_util.cpp
new file mode 100644
index 0000000000..c6526171f5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_order_util.cpp
@@ -0,0 +1,24 @@
+#include "planner/join_order/join_order_util.h"
+
+namespace lbug {
+namespace planner {
+
+uint64_t JoinOrderUtil::getJoinKeysFlatCardinality(const binder::expression_vector& joinNodeIDs,
+    const LogicalOperator& buildOp) {
+    auto schema = buildOp.getSchema();
+    f_group_pos_set unFlatGroupsPos;
+    for (auto& joinID : joinNodeIDs) {
+        auto groupPos = schema->getGroupPos(*joinID);
+        if (!schema->getGroup(groupPos)->isFlat()) {
+            unFlatGroupsPos.insert(groupPos);
+        }
+    }
+    auto cardinality = buildOp.getCardinality();
+    for (auto groupPos : unFlatGroupsPos) {
+        cardinality *= schema->getGroup(groupPos)->getMultiplier();
+    }
+    return cardinality;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_plan_solver.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_plan_solver.cpp
new file mode 100644
index 0000000000..346c92f262
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_plan_solver.cpp
@@ -0,0 +1,149 @@
+#include "planner/join_order/join_plan_solver.h"
+
+#include "common/enums/extend_direction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+LogicalPlan JoinPlanSolver::solve(const JoinTree& joinTree) {
+    return solveTreeNode(*joinTree.root, nullptr);
+}
+
+LogicalPlan JoinPlanSolver::solveTreeNode(const JoinTreeNode& current, const JoinTreeNode* parent) {
+    switch (current.type) {
+    case TreeNodeType::NODE_SCAN: {
+        return solveNodeScanTreeNode(current);
+    }
+    case TreeNodeType::REL_SCAN: {
+        KU_ASSERT(parent != nullptr);
+        return solveRelScanTreeNode(current, *parent);
+    }
+    case TreeNodeType::BINARY_JOIN: {
+        return solveBinaryJoinTreeNode(current);
+    }
+    case TreeNodeType::MULTIWAY_JOIN: {
+        return solveMultiwayJoinTreeNode(current);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static ExtendDirection getExtendDirection(const RelExpression& rel,
+    const NodeExpression& boundNode) {
+    if (rel.getDirectionType() == binder::RelDirectionType::BOTH) {
+        return ExtendDirection::BOTH;
+    }
+    if (*rel.getSrcNode() == boundNode) {
+        return ExtendDirection::FWD;
+    } else {
+        return ExtendDirection::BWD;
+    }
+}
+
+static std::shared_ptr<binder::NodeExpression> getOtherNode(const RelExpression& rel,
+    const NodeExpression& boundNode) {
+    if (*rel.getSrcNode() == boundNode) {
+        return rel.getDstNode();
+    }
+    return rel.getSrcNode();
+}
+
+LogicalPlan JoinPlanSolver::solveNodeScanTreeNode(const JoinTreeNode& treeNode) {
+    auto& extraInfo = treeNode.extraInfo->constCast<ExtraScanTreeNodeInfo>();
+    KU_ASSERT(extraInfo.nodeInfo != nullptr);
+    auto& nodeInfo = *extraInfo.nodeInfo;
+    auto boundNode = std::static_pointer_cast<NodeExpression>(nodeInfo.nodeOrRel);
+    auto plan = LogicalPlan();
+    planner->appendScanNodeTable(boundNode->getInternalID(), boundNode->getTableIDs(),
+        nodeInfo.properties, plan);
+    planner->appendFilters(nodeInfo.predicates, plan);
+    for (auto& relInfo : extraInfo.relInfos) {
+        auto rel = std::static_pointer_cast<RelExpression>(relInfo.nodeOrRel);
+        auto nbrNode = getOtherNode(*rel, *boundNode);
+        auto direction = getExtendDirection(*rel, *boundNode);
+        planner->appendExtend(boundNode, nbrNode, rel, direction, relInfo.properties, plan);
+        planner->appendFilters(relInfo.predicates, plan);
+    }
+    planner->appendFilters(extraInfo.predicates, plan);
+    return plan;
+}
+
+LogicalPlan JoinPlanSolver::solveRelScanTreeNode(const JoinTreeNode& treeNode,
+    const JoinTreeNode& parent) {
+    auto& extraInfo = treeNode.extraInfo->constCast<ExtraScanTreeNodeInfo>();
+    auto& relInfo = extraInfo.relInfos[0];
+    auto rel = std::static_pointer_cast<RelExpression>(relInfo.nodeOrRel);
+    std::shared_ptr<NodeExpression> boundNode = nullptr;
+    std::shared_ptr<NodeExpression> nbrNode = nullptr;
+    switch (parent.type) {
+    case TreeNodeType::BINARY_JOIN: {
+        auto& joinExtraInfo = parent.extraInfo->constCast<ExtraJoinTreeNodeInfo>();
+        if (joinExtraInfo.joinNodes.size() == 1) {
+            boundNode = joinExtraInfo.joinNodes[0];
+        } else {
+            boundNode = rel->getSrcNode();
+        }
+        nbrNode = getOtherNode(*rel, *boundNode);
+    } break;
+    case TreeNodeType::MULTIWAY_JOIN: {
+        auto& joinExtraInfo = parent.extraInfo->constCast<ExtraJoinTreeNodeInfo>();
+        KU_ASSERT(joinExtraInfo.joinNodes.size() == 1);
+        nbrNode = joinExtraInfo.joinNodes[0];
+        boundNode = getOtherNode(*rel, *nbrNode);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    auto direction = getExtendDirection(*rel, *boundNode);
+    auto plan = LogicalPlan();
+    planner->appendScanNodeTable(boundNode->getInternalID(), boundNode->getTableIDs(),
+        expression_vector{}, plan);
+    planner->appendExtend(boundNode, nbrNode, rel, direction, relInfo.properties, plan);
+    planner->appendFilters(relInfo.predicates, plan);
+    return plan;
+}
+
+LogicalPlan JoinPlanSolver::solveBinaryJoinTreeNode(const JoinTreeNode& treeNode) {
+    auto probePlan = solveTreeNode(*treeNode.children[0], &treeNode);
+    auto buildPlan = solveTreeNode(*treeNode.children[1], &treeNode);
+    auto& extraInfo = treeNode.extraInfo->constCast<ExtraJoinTreeNodeInfo>();
+    binder::expression_vector joinNodeIDs;
+    for (auto& expr : extraInfo.joinNodes) {
+        joinNodeIDs.push_back(expr->constCast<NodeExpression>().getInternalID());
+    }
+    auto plan = LogicalPlan();
+    planner->appendHashJoin(joinNodeIDs, JoinType::INNER, probePlan, buildPlan, plan);
+    planner->appendFilters(extraInfo.predicates, plan);
+    return plan;
+}
+
+LogicalPlan JoinPlanSolver::solveMultiwayJoinTreeNode(const JoinTreeNode& treeNode) {
+    auto& extraInfo = treeNode.extraInfo->constCast<ExtraJoinTreeNodeInfo>();
+    KU_ASSERT(extraInfo.joinNodes.size() == 1);
+    auto& joinNode = extraInfo.joinNodes[0]->constCast<NodeExpression>();
+    auto probePlan = solveTreeNode(*treeNode.children[0], &treeNode);
+    std::vector<LogicalPlan> buildPlans;
+    expression_vector boundNodeIDs;
+    for (auto i = 1u; i < treeNode.children.size(); ++i) {
+        auto child = treeNode.children[i];
+        KU_ASSERT(child->type == TreeNodeType::REL_SCAN);
+        auto& childExtraInfo = child->extraInfo->constCast<ExtraScanTreeNodeInfo>();
+        auto rel = std::static_pointer_cast<RelExpression>(childExtraInfo.relInfos[0].nodeOrRel);
+        auto boundNode = *rel->getSrcNode() == joinNode ? rel->getDstNode() : rel->getSrcNode();
+        buildPlans.push_back(solveTreeNode(*child, &treeNode).copy());
+        boundNodeIDs.push_back(boundNode->constCast<NodeExpression>().getInternalID());
+    }
+    auto plan = LogicalPlan();
+    // TODO(Xiyang): provide an interface to append operator to resultPlan.
+    planner->appendIntersect(joinNode.getInternalID(), boundNodeIDs, probePlan, buildPlans);
+    plan.setLastOperator(probePlan.getLastOperator());
+    planner->appendFilters(extraInfo.predicates, plan);
+    return plan;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_tree.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_tree.cpp
new file mode 100644
index 0000000000..8abe00dac2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_tree.cpp
@@ -0,0 +1,57 @@
+#include "planner/join_order/join_tree.h"
+
+namespace lbug {
+namespace planner {
+
+std::string TreeNodeTypeUtils::toString(TreeNodeType type) {
+    switch (type) {
+    case TreeNodeType::NODE_SCAN:
+        return "NODE_SCAN";
+    case TreeNodeType::REL_SCAN:
+        return "REL_SCAN";
+    case TreeNodeType::BINARY_JOIN:
+        return "BINARY_JOIN";
+    case TreeNodeType::MULTIWAY_JOIN:
+        return "MULTIWAY_JOIN";
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void ExtraScanTreeNodeInfo::merge(const ExtraScanTreeNodeInfo& other) {
+    KU_ASSERT(other.nodeInfo == nullptr && other.relInfos.size() == 1);
+    relInfos.push_back(other.relInfos[0]);
+}
+
+std::string JoinTreeNode::toString() const {
+    switch (type) {
+    case TreeNodeType::NODE_SCAN:
+    case TreeNodeType::REL_SCAN: {
+        auto& scanInfo = extraInfo->constCast<ExtraScanTreeNodeInfo>();
+        auto result = "Scan(" + scanInfo.nodeInfo->nodeOrRel->toString();
+        for (auto relInfo : scanInfo.relInfos) {
+            result += "," + relInfo.nodeOrRel->toString();
+        }
+        result += ")";
+        return result;
+    }
+    case TreeNodeType::BINARY_JOIN: {
+        KU_ASSERT(children.size() == 2);
+        return "JOIN(" + children[0]->toString() + "," + children[1]->toString() + ")";
+    }
+    case TreeNodeType::MULTIWAY_JOIN: {
+        KU_ASSERT(!children.empty());
+        auto result = "MULTI_JOIN(" + children[0]->toString();
+        for (auto i = 1u; i < children.size(); ++i) {
+            result += "," + children[i]->toString();
+        }
+        return result;
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_tree_constructor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_tree_constructor.cpp
new file mode 100644
index 0000000000..8f0fc8dd5a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order/join_tree_constructor.cpp
@@ -0,0 +1,207 @@
+#include "planner/join_order/join_tree_constructor.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/query/reading_clause/bound_join_hint.h"
+#include "common/exception/binder.h"
+#include "common/exception/not_implemented.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+JoinTree JoinTreeConstructor::construct(std::shared_ptr<BoundJoinHintNode> root) {
+    if (planningInfo.subqueryType == SubqueryPlanningType::CORRELATED) {
+        throw NotImplementedException(
+            stringFormat("Hint join pattern has correlation with previous "
+                         "patterns. This is not supported yet."));
+    }
+    return JoinTree(constructTreeNode(root).treeNode);
+}
+
+static std::vector<std::shared_ptr<NodeExpression>> getJoinNodes(const SubqueryGraph& subgraph,
+    const SubqueryGraph& otherSubgraph) {
+    KU_ASSERT(&subgraph.queryGraph == &otherSubgraph.queryGraph);
+    std::vector<std::shared_ptr<NodeExpression>> joinNodes;
+    for (auto idx : subgraph.getNbrNodeIndices()) {
+        if (otherSubgraph.queryNodesSelector[idx]) {
+            joinNodes.push_back(subgraph.queryGraph.getQueryNode(idx));
+        }
+    }
+    return joinNodes;
+}
+
+static std::vector<common::idx_t> intersect(std::vector<common::idx_t> left,
+    std::vector<common::idx_t> right) {
+    std::vector<common::idx_t> result;
+    auto set = std::unordered_set<common::idx_t>{right.begin(), right.end()};
+    for (auto idx : left) {
+        if (set.contains(idx)) {
+            result.push_back(idx);
+        }
+    }
+    return result;
+}
+
+std::shared_ptr<NodeExpression> getIntersectNode(const QueryGraph& queryGraph,
+    const std::vector<SubqueryGraph>& buildSubgraphs) {
+    auto candidates = buildSubgraphs[0].getNbrNodeIndices();
+    for (auto i = 1u; i < buildSubgraphs.size(); ++i) {
+        candidates = intersect(candidates, buildSubgraphs[i].getNbrNodeIndices());
+    }
+    if (candidates.size() != 1) {
+        throw BinderException("Cannot resolve join condition for multi-way join.");
+    }
+    return queryGraph.getQueryNode(candidates[0]);
+}
+
+JoinTreeConstructor::IntermediateResult JoinTreeConstructor::constructTreeNode(
+    std::shared_ptr<BoundJoinHintNode> hintNode) {
+    // Construct leaf scans.
+    if (hintNode->isLeaf()) {
+        if (ExpressionUtil::isNodePattern(*hintNode->nodeOrRel)) {
+            return constructNodeScan(hintNode->nodeOrRel);
+        } else {
+            KU_ASSERT(ExpressionUtil::isRelPattern(*hintNode->nodeOrRel) ||
+                      ExpressionUtil::isRecursiveRelPattern(*hintNode->nodeOrRel));
+            return constructRelScan(hintNode->nodeOrRel);
+        }
+    }
+    // Construct binary join.
+    if (hintNode->isBinary()) {
+        auto left = constructTreeNode(hintNode->children[0]);
+        auto right = constructTreeNode(hintNode->children[1]);
+        auto joinNodes = getJoinNodes(left.subqueryGraph, right.subqueryGraph);
+        if (joinNodes.empty()) {
+            joinNodes = getJoinNodes(right.subqueryGraph, left.subqueryGraph);
+        }
+        if (joinNodes.empty()) {
+            throw BinderException(stringFormat("Cannot resolve join condition between {} and {}.",
+                left.treeNode->toString(), right.treeNode->toString()));
+        }
+        auto newSubgraph = left.subqueryGraph;
+        newSubgraph.addSubqueryGraph(right.subqueryGraph);
+        auto predicates = Planner::getNewlyMatchedExprs(left.subqueryGraph, right.subqueryGraph,
+            newSubgraph, queryGraphPredicates);
+        // First try to construct as index nested loop join.
+        auto nestedLoopTreeNode =
+            tryConstructNestedLoopJoin(joinNodes, *left.treeNode, *right.treeNode, predicates);
+        if (nestedLoopTreeNode != nullptr) {
+            return {nestedLoopTreeNode, newSubgraph};
+        }
+        // Cannot construct index nested loop join. Fall back to hash join.
+        auto extraInfo = std::make_unique<ExtraJoinTreeNodeInfo>(joinNodes);
+        extraInfo->predicates = predicates;
+        auto treeNode =
+            std::make_shared<JoinTreeNode>(TreeNodeType::BINARY_JOIN, std::move(extraInfo));
+        treeNode->addChild(left.treeNode);
+        treeNode->addChild(right.treeNode);
+        return {treeNode, newSubgraph};
+    }
+    // Construct multi-way join
+    KU_ASSERT(hintNode->isMultiWay());
+    auto probe = constructTreeNode(hintNode->children[0]);
+    auto newSubgraph = probe.subqueryGraph;
+    std::vector<std::shared_ptr<JoinTreeNode>> childrenNodes;
+    childrenNodes.push_back(probe.treeNode);
+    std::vector<SubqueryGraph> buildSubgraphs;
+    for (auto i = 1u; i < hintNode->children.size(); ++i) {
+        auto build = constructTreeNode(hintNode->children[i]);
+        if (build.treeNode->type != TreeNodeType::REL_SCAN) {
+            throw BinderException(stringFormat(
+                "Cannot construct multi-way join because build side is not a relationship table."));
+        }
+        newSubgraph.addSubqueryGraph(build.subqueryGraph);
+        childrenNodes.push_back(build.treeNode);
+        buildSubgraphs.push_back(build.subqueryGraph);
+    }
+    auto joinNode = getIntersectNode(queryGraph, buildSubgraphs);
+    auto subgraphs = buildSubgraphs;
+    subgraphs.push_back(probe.subqueryGraph);
+    auto predicates = Planner::getNewlyMatchedExprs(subgraphs, newSubgraph, queryGraphPredicates);
+    auto extraInfo = std::make_unique<ExtraJoinTreeNodeInfo>(joinNode);
+    extraInfo->predicates = predicates;
+    auto treeNode =
+        std::make_shared<JoinTreeNode>(TreeNodeType::MULTIWAY_JOIN, std::move(extraInfo));
+    for (auto& child : childrenNodes) {
+        treeNode->addChild(child);
+    }
+    return {treeNode, newSubgraph};
+}
+
+JoinTreeConstructor::IntermediateResult JoinTreeConstructor::constructNodeScan(
+    std::shared_ptr<Expression> expr) {
+    auto& node = expr->constCast<NodeExpression>();
+    auto nodeIdx = queryGraph.getQueryNodeIdx(node.getUniqueName());
+    auto emptySubgraph = SubqueryGraph(queryGraph);
+    auto newSubgraph = SubqueryGraph(queryGraph);
+    newSubgraph.addQueryNode(nodeIdx);
+    auto extraInfo = std::make_unique<ExtraScanTreeNodeInfo>();
+    // See Planner::planBaseTableScans for how we plan unnest correlated subqueries.
+    if (planningInfo.subqueryType == SubqueryPlanningType::UNNEST_CORRELATED &&
+        planningInfo.containsCorrExpr(*node.getInternalID())) {
+        extraInfo->nodeInfo = std::make_unique<NodeRelScanInfo>(expr, expression_vector{});
+        ;
+        auto treeNode =
+            std::make_shared<JoinTreeNode>(TreeNodeType::NODE_SCAN, std::move(extraInfo));
+        return {treeNode, newSubgraph};
+    }
+    auto properties = propertyCollection.getProperties(*expr);
+    auto predicates =
+        Planner::getNewlyMatchedExprs(emptySubgraph, newSubgraph, queryGraphPredicates);
+    auto nodeScanInfo = std::make_unique<NodeRelScanInfo>(expr, properties);
+    nodeScanInfo->predicates = predicates;
+    extraInfo->nodeInfo = std::move(nodeScanInfo);
+    auto treeNode = std::make_shared<JoinTreeNode>(TreeNodeType::NODE_SCAN, std::move(extraInfo));
+    return {treeNode, newSubgraph};
+}
+
+JoinTreeConstructor::IntermediateResult JoinTreeConstructor::constructRelScan(
+    std::shared_ptr<binder::Expression> expr) {
+    auto& rel = expr->constCast<RelExpression>();
+    auto relIdx = queryGraph.getQueryRelIdx(rel.getUniqueName());
+    auto emptySubgraph = SubqueryGraph(queryGraph);
+    auto newSubgraph = SubqueryGraph(queryGraph);
+    newSubgraph.addQueryRel(relIdx);
+    auto properties = propertyCollection.getProperties(*expr);
+    auto predicates =
+        Planner::getNewlyMatchedExprs(emptySubgraph, newSubgraph, queryGraphPredicates);
+    auto relScanInfo = NodeRelScanInfo(expr, properties);
+    relScanInfo.predicates = predicates;
+    auto extraInfo = std::make_unique<ExtraScanTreeNodeInfo>();
+    extraInfo->relInfos.push_back(std::move(relScanInfo));
+    auto treeNode = std::make_shared<JoinTreeNode>(TreeNodeType::REL_SCAN, std::move(extraInfo));
+    return {treeNode, newSubgraph};
+}
+
+std::shared_ptr<JoinTreeNode> JoinTreeConstructor::tryConstructNestedLoopJoin(
+    std::vector<std::shared_ptr<NodeExpression>> joinNodes, const JoinTreeNode& leftRoot,
+    const JoinTreeNode& rightRoot, const binder::expression_vector& predicates) {
+    if (joinNodes.size() > 1) {
+        return nullptr;
+    }
+    if (leftRoot.type == TreeNodeType::REL_SCAN && rightRoot.type == TreeNodeType::NODE_SCAN) {
+        return tryConstructNestedLoopJoin(joinNodes, rightRoot, leftRoot, predicates);
+    }
+    if (leftRoot.type != TreeNodeType::NODE_SCAN) {
+        return nullptr;
+    }
+    if (rightRoot.type != TreeNodeType::REL_SCAN) {
+        return nullptr;
+    }
+    auto joinNode = joinNodes[0];
+    auto& leftExtraInfo = leftRoot.extraInfo->constCast<ExtraScanTreeNodeInfo>();
+    auto& rightExtraInfo = rightRoot.extraInfo->constCast<ExtraScanTreeNodeInfo>();
+    if (*leftExtraInfo.nodeInfo->nodeOrRel != *joinNode) {
+        return nullptr;
+    }
+    auto newExtraInfo = std::make_unique<ExtraScanTreeNodeInfo>(leftExtraInfo);
+    newExtraInfo->relInfos.push_back(rightExtraInfo.relInfos[0]);
+    newExtraInfo->predicates = predicates;
+    return std::make_shared<JoinTreeNode>(TreeNodeType::NODE_SCAN, std::move(newExtraInfo));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order_enumerator_context.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order_enumerator_context.cpp
new file mode 100644
index 0000000000..0bc0aefdd4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/join_order_enumerator_context.cpp
@@ -0,0 +1,37 @@
+#include "planner/join_order_enumerator_context.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void JoinOrderEnumeratorContext::init(const QueryGraph* queryGraph_,
+    const expression_vector& predicates) {
+    whereExpressionsSplitOnAND = predicates;
+    this->queryGraph = queryGraph_;
+    // clear and resize subPlansTable
+    subPlansTable->clear();
+    maxLevel = queryGraph_->getNumQueryNodes() + queryGraph_->getNumQueryRels() + 1;
+    subPlansTable->resize(maxLevel);
+    // Restart from level 1 for new query part so that we get hashJoin based plans
+    // that uses subplans coming from previous query part.See example in planRelIndexJoin().
+    currentLevel = 1;
+}
+
+SubqueryGraph JoinOrderEnumeratorContext::getFullyMatchedSubqueryGraph() const {
+    auto subqueryGraph = SubqueryGraph(*queryGraph);
+    for (auto i = 0u; i < queryGraph->getNumQueryNodes(); ++i) {
+        subqueryGraph.addQueryNode(i);
+    }
+    for (auto i = 0u; i < queryGraph->getNumQueryRels(); ++i) {
+        subqueryGraph.addQueryRel(i);
+    }
+    return subqueryGraph;
+}
+
+void JoinOrderEnumeratorContext::resetState() {
+    subPlansTable = std::make_unique<SubPlansTable>();
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/CMakeLists.txt
new file mode 100644
index 0000000000..2ad0838d77
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/CMakeLists.txt
@@ -0,0 +1,38 @@
+add_subdirectory(extend)
+add_subdirectory(factorization)
+add_subdirectory(persistent)
+add_subdirectory(scan)
+add_subdirectory(simple)
+add_subdirectory(sip)
+
+add_library(lbug_planner_operator
+        OBJECT
+        logical_accumulate.cpp
+        logical_aggregate.cpp
+        logical_create_macro.cpp
+        logical_cross_product.cpp
+        logical_distinct.cpp
+        logical_dummy_scan.cpp
+        logical_dummy_sink.cpp
+        logical_explain.cpp
+        logical_filter.cpp
+        logical_flatten.cpp
+        logical_hash_join.cpp
+        logical_table_function_call.cpp
+        logical_intersect.cpp
+        logical_limit.cpp
+        logical_operator.cpp
+        logical_order_by.cpp
+        logical_partitioner.cpp
+        logical_path_property_probe.cpp
+        logical_plan.cpp
+        logical_plan_util.cpp
+        logical_projection.cpp
+        logical_standalone_call.cpp
+        logical_union.cpp
+        logical_unwind.cpp
+        schema.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner_operator>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/CMakeLists.txt
new file mode 100644
index 0000000000..65e8c3f7f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_planner_extend
+        OBJECT
+        base_logical_extend.cpp
+        logical_extend.cpp
+        logical_recursive_extend.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner_extend>
+        PARENT_SCOPE)
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/base_logical_extend.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/base_logical_extend.cpp
new file mode 100644
index 0000000000..92b1c87982
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/base_logical_extend.cpp
@@ -0,0 +1,55 @@
+#include "planner/operator/extend/base_logical_extend.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+static std::string relToString(const binder::RelExpression& rel) {
+    auto result = rel.toString();
+    switch (rel.getRelType()) {
+    case QueryRelType::SHORTEST: {
+        result += "SHORTEST";
+    } break;
+    case QueryRelType::ALL_SHORTEST: {
+        result += "ALL SHORTEST";
+    } break;
+    default:
+        break;
+    }
+    if (QueryRelTypeUtils::isRecursive(rel.getRelType())) {
+        auto bindData = rel.getRecursiveInfo()->bindData.get();
+        result += std::to_string(bindData->lowerBound);
+        result += "..";
+        result += std::to_string(bindData->upperBound);
+    }
+    return result;
+}
+
+std::string BaseLogicalExtend::getExpressionsForPrinting() const {
+    auto result = boundNode->toString();
+    switch (direction) {
+    case ExtendDirection::FWD: {
+        result += "-";
+        result += relToString(*rel);
+        result += "->";
+    } break;
+    case ExtendDirection::BWD: {
+        result += "<-";
+        result += relToString(*rel);
+        result += "-";
+    } break;
+    case ExtendDirection::BOTH: {
+        result += "<-";
+        result += relToString(*rel);
+        result += "->";
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    result += nbrNode->toString();
+    return result;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/logical_extend.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/logical_extend.cpp
new file mode 100644
index 0000000000..141058bf92
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/logical_extend.cpp
@@ -0,0 +1,43 @@
+#include "planner/operator/extend/logical_extend.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalExtend::computeFactorizedSchema() {
+    copyChildSchema(0);
+    const auto boundGroupPos = schema->getGroupPos(*boundNode->getInternalID());
+    if (!schema->getGroup(boundGroupPos)->isFlat()) {
+        schema->flattenGroup(boundGroupPos);
+    }
+    uint32_t nbrGroupPos = 0u;
+    nbrGroupPos = schema->createGroup();
+    schema->insertToGroupAndScope(nbrNode->getInternalID(), nbrGroupPos);
+    for (auto& property : properties) {
+        schema->insertToGroupAndScope(property, nbrGroupPos);
+    }
+    if (rel->hasDirectionExpr()) {
+        schema->insertToGroupAndScope(rel->getDirectionExpr(), nbrGroupPos);
+    }
+}
+
+void LogicalExtend::computeFlatSchema() {
+    copyChildSchema(0);
+    schema->insertToGroupAndScope(nbrNode->getInternalID(), 0);
+    for (auto& property : properties) {
+        schema->insertToGroupAndScope(property, 0);
+    }
+    if (rel->hasDirectionExpr()) {
+        schema->insertToGroupAndScope(rel->getDirectionExpr(), 0);
+    }
+}
+
+std::unique_ptr<LogicalOperator> LogicalExtend::copy() {
+    auto extend = std::make_unique<LogicalExtend>(boundNode, nbrNode, rel, direction,
+        extendFromSource_, properties, children[0]->copy(), cardinality);
+    extend->setPropertyPredicates(copyVector(propertyPredicates));
+    extend->scanNbrID = scanNbrID;
+    return extend;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/logical_recursive_extend.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/logical_recursive_extend.cpp
new file mode 100644
index 0000000000..57a351b169
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/extend/logical_recursive_extend.cpp
@@ -0,0 +1,23 @@
+#include "planner/operator/extend/logical_recursive_extend.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalRecursiveExtend::computeFlatSchema() {
+    createEmptySchema();
+    schema->createGroup();
+    for (auto& expr : resultColumns) {
+        schema->insertToGroupAndScope(expr, 0);
+    }
+}
+
+void LogicalRecursiveExtend::computeFactorizedSchema() {
+    createEmptySchema();
+    auto pos = schema->createGroup();
+    for (auto& e : resultColumns) {
+        schema->insertToGroupAndScope(e, pos);
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/factorization/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/factorization/CMakeLists.txt
new file mode 100644
index 0000000000..eaa94b16f6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/factorization/CMakeLists.txt
@@ -0,0 +1,8 @@
+add_library(lbug_planner_factorization
+        OBJECT
+        flatten_resolver.cpp
+        sink_util.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner_factorization>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/factorization/flatten_resolver.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/factorization/flatten_resolver.cpp
new file mode 100644
index 0000000000..c903b8a48b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/factorization/flatten_resolver.cpp
@@ -0,0 +1,221 @@
+#include "planner/operator/factorization/flatten_resolver.h"
+
+#include "binder/expression/case_expression.h"
+#include "binder/expression/lambda_expression.h"
+#include "binder/expression/node_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "binder/expression/scalar_function_expression.h"
+#include "binder/expression/subquery_expression.h"
+#include "common/exception/not_implemented.h"
+#include "planner/operator/schema.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+std::pair<f_group_pos, f_group_pos_set> FlattenAllButOne::getGroupsPosToFlatten(
+    const expression_vector& exprs, const Schema& schema) {
+    f_group_pos_set result;
+    f_group_pos_set dependentGroups;
+    for (auto expr : exprs) {
+        auto analyzer = GroupDependencyAnalyzer(false /* collectDependentExpr */, schema);
+        analyzer.visit(expr);
+        for (auto pos : analyzer.getRequiredFlatGroups()) {
+            result.insert(pos);
+        }
+        for (auto pos : analyzer.getDependentGroups()) {
+            dependentGroups.insert(pos);
+        }
+    }
+    std::vector<f_group_pos> candidates;
+    for (auto pos : dependentGroups) {
+        if (!schema.getGroup(pos)->isFlat() && !result.contains(pos)) {
+            candidates.push_back(pos);
+        }
+    }
+    for (auto i = 1u; i < candidates.size(); ++i) {
+        result.insert(candidates[i]);
+    }
+    if (candidates.empty()) {
+        return std::make_pair(INVALID_F_GROUP_POS, result);
+    } else {
+        return std::make_pair(candidates[0], result);
+    }
+}
+
+f_group_pos_set FlattenAllButOne::getGroupsPosToFlatten(std::shared_ptr<Expression> expr,
+    const Schema& schema) {
+    auto analyzer = GroupDependencyAnalyzer(false /* collectDependentExpr */, schema);
+    analyzer.visit(expr);
+    f_group_pos_set result = analyzer.getRequiredFlatGroups();
+    std::vector<f_group_pos> candidates;
+    for (auto groupPos : analyzer.getDependentGroups()) {
+        if (!schema.getGroup(groupPos)->isFlat() && !result.contains(groupPos)) {
+            candidates.push_back(groupPos);
+        }
+    }
+    // Keep the first group as unFlat.
+    for (auto i = 1u; i < candidates.size(); ++i) {
+        result.insert(candidates[i]);
+    }
+    return result;
+}
+
+f_group_pos_set FlattenAllButOne::getGroupsPosToFlatten(
+    const std::unordered_set<f_group_pos>& dependentGroups, const Schema& schema) {
+    f_group_pos_set result;
+    std::vector<f_group_pos> candidates;
+    for (auto groupPos : dependentGroups) {
+        if (!schema.getGroup(groupPos)->isFlat()) {
+            candidates.push_back(groupPos);
+        }
+    }
+    for (auto i = 1u; i < candidates.size(); ++i) {
+        result.insert(candidates[i]);
+    }
+    return result;
+}
+
+f_group_pos_set FlattenAll::getGroupsPosToFlatten(const expression_vector& exprs,
+    const Schema& schema) {
+    f_group_pos_set result;
+    for (auto& expr : exprs) {
+        for (auto pos : getGroupsPosToFlatten(expr, schema)) {
+            result.insert(pos);
+        }
+    }
+    return result;
+}
+
+f_group_pos_set FlattenAll::getGroupsPosToFlatten(std::shared_ptr<Expression> expr,
+    const Schema& schema) {
+    auto analyzer = GroupDependencyAnalyzer(false /* collectDependentExpr */, schema);
+    analyzer.visit(expr);
+    return getGroupsPosToFlatten(analyzer.getDependentGroups(), schema);
+}
+
+f_group_pos_set FlattenAll::getGroupsPosToFlatten(
+    const std::unordered_set<f_group_pos>& dependentGroups, const Schema& schema) {
+    f_group_pos_set result;
+    for (auto groupPos : dependentGroups) {
+        if (!schema.getGroup(groupPos)->isFlat()) {
+            result.insert(groupPos);
+        }
+    }
+    return result;
+}
+
+void GroupDependencyAnalyzer::visit(std::shared_ptr<binder::Expression> expr) {
+    if (schema.isExpressionInScope(*expr)) {
+        dependentGroups.insert(schema.getGroupPos(*expr));
+        if (collectDependentExpr) {
+            dependentExprs.insert(expr);
+        }
+        return;
+    }
+    switch (expr->expressionType) {
+    case ExpressionType::FUNCTION:
+        return visitFunction(expr);
+    case ExpressionType::CASE_ELSE: {
+        visitCase(expr);
+    } break;
+    case ExpressionType::PATTERN: {
+        visitNodeOrRel(expr);
+    } break;
+    case ExpressionType::SUBQUERY: {
+        visitSubquery(expr);
+    } break;
+    case ExpressionType::LAMBDA: {
+        visit(expr->constCast<LambdaExpression>().getFunctionExpr());
+    } break;
+    case ExpressionType::LITERAL:
+    case ExpressionType::AGGREGATE_FUNCTION:
+    case ExpressionType::PROPERTY:
+    case ExpressionType::VARIABLE:
+    case ExpressionType::PATH:
+    case ExpressionType::PARAMETER:
+    case ExpressionType::GRAPH:
+    case ExpressionType::OR:
+    case ExpressionType::XOR:
+    case ExpressionType::AND:
+    case ExpressionType::NOT:
+    case ExpressionType::EQUALS:
+    case ExpressionType::NOT_EQUALS:
+    case ExpressionType::GREATER_THAN:
+    case ExpressionType::GREATER_THAN_EQUALS:
+    case ExpressionType::LESS_THAN:
+    case ExpressionType::LESS_THAN_EQUALS:
+    case ExpressionType::IS_NULL:
+    case ExpressionType::IS_NOT_NULL: {
+        for (auto& child : expr->getChildren()) {
+            visit(child);
+        }
+    } break;
+        // LCOV_EXCL_START
+    default:
+        throw NotImplementedException("GroupDependencyAnalyzer::visit");
+        // LCOV_EXCL_STOP
+    }
+}
+
+void GroupDependencyAnalyzer::visitFunction(std::shared_ptr<binder::Expression> expr) {
+    auto& funcExpr = expr->constCast<ScalarFunctionExpression>();
+    for (auto& child : expr->getChildren()) {
+        visit(child);
+    }
+    // For list lambda we need to flatten all dependent expressions in lambda function
+    // E.g. MATCH (a)->(b) RETURN list_filter(a.list, x -> x>b.age)
+    if (funcExpr.getFunction().isListLambda) {
+        auto lambdaFunctionAnalyzer = GroupDependencyAnalyzer(collectDependentExpr, schema);
+        lambdaFunctionAnalyzer.visit(funcExpr.getChild(1));
+        requiredFlatGroups = lambdaFunctionAnalyzer.getDependentGroups();
+    }
+}
+
+void GroupDependencyAnalyzer::visitCase(std::shared_ptr<binder::Expression> expr) {
+    auto& caseExpression = expr->constCast<CaseExpression>();
+    for (auto i = 0u; i < caseExpression.getNumCaseAlternatives(); ++i) {
+        auto caseAlternative = caseExpression.getCaseAlternative(i);
+        visit(caseAlternative->whenExpression);
+        visit(caseAlternative->thenExpression);
+    }
+    visit(caseExpression.getElseExpression());
+}
+
+void GroupDependencyAnalyzer::visitNodeOrRel(std::shared_ptr<Expression> expr) {
+    for (auto& p : expr->constCast<NodeOrRelExpression>().getPropertyExpressions()) {
+        visit(p);
+    }
+    switch (expr->getDataType().getLogicalTypeID()) {
+    case LogicalTypeID::NODE: {
+        auto& node = expr->constCast<NodeExpression>();
+        visit(node.getInternalID());
+    } break;
+    case LogicalTypeID::REL:
+    case LogicalTypeID::RECURSIVE_REL: {
+        auto& rel = expr->constCast<RelExpression>();
+        visit(rel.getSrcNode()->getInternalID());
+        visit(rel.getDstNode()->getInternalID());
+        if (rel.hasDirectionExpr()) {
+            visit(rel.getDirectionExpr());
+        }
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void GroupDependencyAnalyzer::visitSubquery(std::shared_ptr<binder::Expression> expr) {
+    auto& subqueryExpr = expr->constCast<SubqueryExpression>();
+    for (auto& node : subqueryExpr.getQueryGraphCollection()->getQueryNodes()) {
+        visit(node->getInternalID());
+    }
+    if (subqueryExpr.hasWhereExpression()) {
+        visit(subqueryExpr.getWhereExpression());
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/factorization/sink_util.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/factorization/sink_util.cpp
new file mode 100644
index 0000000000..c930bb73c1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/factorization/sink_util.cpp
@@ -0,0 +1,70 @@
+#include "planner/operator/factorization/sink_util.h"
+
+namespace lbug {
+namespace planner {
+
+void SinkOperatorUtil::mergeSchema(const Schema& inputSchema,
+    const binder::expression_vector& expressionsToMerge, Schema& resultSchema) {
+    auto flatPayloads = getFlatPayloads(inputSchema, expressionsToMerge);
+    auto unFlatPayloadsPerGroup = getUnFlatPayloadsPerGroup(inputSchema, expressionsToMerge);
+    if (unFlatPayloadsPerGroup.empty()) {
+        appendPayloadsToNewGroup(resultSchema, flatPayloads);
+    } else {
+        if (!flatPayloads.empty()) {
+            auto groupPos = appendPayloadsToNewGroup(resultSchema, flatPayloads);
+            resultSchema.setGroupAsSingleState(groupPos);
+        }
+        for (auto& [inputGroupPos, payloads] : unFlatPayloadsPerGroup) {
+            auto resultGroupPos = appendPayloadsToNewGroup(resultSchema, payloads);
+            resultSchema.getGroup(resultGroupPos)
+                ->setMultiplier(inputSchema.getGroup(inputGroupPos)->getMultiplier());
+        }
+    }
+}
+
+void SinkOperatorUtil::recomputeSchema(const Schema& inputSchema,
+    const binder::expression_vector& expressionsToMerge, Schema& resultSchema) {
+    KU_ASSERT(!expressionsToMerge.empty());
+    resultSchema.clear();
+    mergeSchema(inputSchema, expressionsToMerge, resultSchema);
+}
+
+std::unordered_map<f_group_pos, binder::expression_vector>
+SinkOperatorUtil::getUnFlatPayloadsPerGroup(const Schema& schema,
+    const binder::expression_vector& payloads) {
+    std::unordered_map<f_group_pos, binder::expression_vector> result;
+    for (auto& payload : payloads) {
+        auto groupPos = schema.getGroupPos(*payload);
+        if (schema.getGroup(groupPos)->isFlat()) {
+            continue;
+        }
+        if (!result.contains(groupPos)) {
+            result.insert({groupPos, binder::expression_vector{}});
+        }
+        result.at(groupPos).push_back(payload);
+    }
+    return result;
+}
+
+binder::expression_vector SinkOperatorUtil::getFlatPayloads(const Schema& schema,
+    const binder::expression_vector& payloads) {
+    binder::expression_vector result;
+    for (auto& payload : payloads) {
+        if (schema.getGroup(payload)->isFlat()) {
+            result.push_back(payload);
+        }
+    }
+    return result;
+}
+
+uint32_t SinkOperatorUtil::appendPayloadsToNewGroup(Schema& schema,
+    binder::expression_vector& payloads) {
+    auto outputGroupPos = schema.createGroup();
+    for (auto& payload : payloads) {
+        schema.insertToGroupAndScope(payload, outputGroupPos);
+    }
+    return outputGroupPos;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_accumulate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_accumulate.cpp
new file mode 100644
index 0000000000..06567054f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_accumulate.cpp
@@ -0,0 +1,34 @@
+#include "planner/operator/logical_accumulate.h"
+
+#include "planner/operator/factorization/flatten_resolver.h"
+#include "planner/operator/factorization/sink_util.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalAccumulate::computeFactorizedSchema() {
+    createEmptySchema();
+    auto childSchema = children[0]->getSchema();
+    SinkOperatorUtil::recomputeSchema(*childSchema, getPayloads(), *schema);
+    if (mark != nullptr) {
+        auto groupPos = schema->createGroup();
+        schema->setGroupAsSingleState(groupPos);
+        schema->insertToGroupAndScope(mark, groupPos);
+    }
+}
+
+void LogicalAccumulate::computeFlatSchema() {
+    copyChildSchema(0);
+    if (mark != nullptr) {
+        schema->insertToGroupAndScope(mark, 0);
+    }
+}
+
+f_group_pos_set LogicalAccumulate::getGroupPositionsToFlatten() const {
+    f_group_pos_set result;
+    auto childSchema = children[0]->getSchema();
+    return FlattenAll::getGroupsPosToFlatten(flatExprs, *childSchema);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_aggregate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_aggregate.cpp
new file mode 100644
index 0000000000..4386f21802
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_aggregate.cpp
@@ -0,0 +1,88 @@
+#include "planner/operator/logical_aggregate.h"
+
+#include "binder/expression/aggregate_function_expression.h"
+#include "binder/expression/expression_util.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+#include "planner/operator/schema.h"
+
+namespace lbug {
+namespace planner {
+
+std::string LogicalAggregatePrintInfo::toString() const {
+    std::string result = "";
+    result += "Group By: ";
+    result += binder::ExpressionUtil::toString(keys);
+    result += ", Aggregates: ";
+    result += binder::ExpressionUtil::toString(aggregates);
+    return result;
+}
+
+void LogicalAggregate::computeFactorizedSchema() {
+    createEmptySchema();
+    auto groupPos = schema->createGroup();
+    insertAllExpressionsToGroupAndScope(groupPos);
+}
+
+void LogicalAggregate::computeFlatSchema() {
+    createEmptySchema();
+    schema->createGroup();
+    insertAllExpressionsToGroupAndScope(0 /* groupPos */);
+}
+
+f_group_pos_set LogicalAggregate::getGroupsPosToFlatten() {
+    auto [unflatGroup, flattenedGroups] =
+        FlattenAllButOne::getGroupsPosToFlatten(getAllKeys(), *children[0]->getSchema());
+    // Flatten distinct aggregates if they are from a different group than the unflat key group
+    // Regular aggregates can be processed when unflat, but distinct aggregates get added to their
+    // own AggregateHashTable and have the same input limitations as the aggregate groups
+    if (unflatGroup != INVALID_F_GROUP_POS) {
+        for (const auto& aggregate : aggregates) {
+            auto funcExpr = aggregate->constPtrCast<binder::AggregateFunctionExpression>();
+            auto analyzer = GroupDependencyAnalyzer(false /* collectDependentExpr */,
+                *children[0]->getSchema());
+            analyzer.visit(aggregate);
+            for (const auto& group : analyzer.getRequiredFlatGroups()) {
+                flattenedGroups.insert(group);
+            }
+            if (funcExpr->isDistinct()) {
+                for (const auto& group : analyzer.getDependentGroups()) {
+                    if (group != unflatGroup) {
+                        flattenedGroups.insert(group);
+                    }
+                }
+            }
+        }
+    }
+    return flattenedGroups;
+}
+
+std::string LogicalAggregate::getExpressionsForPrinting() const {
+    std::string result = "Group By [";
+    for (auto& expression : keys) {
+        result += expression->toString() + ", ";
+    }
+    for (auto& expression : dependentKeys) {
+        result += expression->toString() + ", ";
+    }
+    result += "], Aggregate [";
+    for (auto& expression : aggregates) {
+        result += expression->toString() + ", ";
+    }
+    result += "]";
+    return result;
+}
+
+void LogicalAggregate::insertAllExpressionsToGroupAndScope(f_group_pos groupPos) {
+    for (auto& expression : keys) {
+        schema->insertToGroupAndScopeMayRepeat(expression, groupPos);
+    }
+    for (auto& expression : dependentKeys) {
+        schema->insertToGroupAndScopeMayRepeat(expression, groupPos);
+    }
+    for (auto& expression : aggregates) {
+        schema->insertToGroupAndScopeMayRepeat(expression, groupPos);
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_create_macro.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_create_macro.cpp
new file mode 100644
index 0000000000..18a193c1ea
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_create_macro.cpp
@@ -0,0 +1,21 @@
+#include "planner/operator/logical_create_macro.h"
+
+namespace lbug {
+namespace planner {
+
+std::string LogicalCreateMacroPrintInfo::toString() const {
+    std::string result = "Macro: ";
+    result += macroName;
+    return result;
+}
+
+void LogicalCreateMacro::computeFlatSchema() {
+    createEmptySchema();
+}
+
+void LogicalCreateMacro::computeFactorizedSchema() {
+    createEmptySchema();
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_cross_product.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_cross_product.cpp
new file mode 100644
index 0000000000..035e5cc903
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_cross_product.cpp
@@ -0,0 +1,34 @@
+#include "planner/operator/logical_cross_product.h"
+
+#include "planner/operator/factorization/sink_util.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalCrossProduct::computeFactorizedSchema() {
+    auto probeSchema = children[0]->getSchema();
+    auto buildSchema = children[1]->getSchema();
+    schema = probeSchema->copy();
+    SinkOperatorUtil::mergeSchema(*buildSchema, buildSchema->getExpressionsInScope(), *schema);
+    if (mark != nullptr) {
+        auto groupPos = schema->createGroup();
+        schema->setGroupAsSingleState(groupPos);
+        schema->insertToGroupAndScope(mark, groupPos);
+    }
+}
+
+void LogicalCrossProduct::computeFlatSchema() {
+    auto probeSchema = children[0]->getSchema();
+    auto buildSchema = children[1]->getSchema();
+    schema = probeSchema->copy();
+    KU_ASSERT(schema->getNumGroups() == 1);
+    for (auto& expression : buildSchema->getExpressionsInScope()) {
+        schema->insertToGroupAndScope(expression, 0);
+    }
+    if (mark != nullptr) {
+        schema->insertToGroupAndScope(mark, 0);
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_distinct.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_distinct.cpp
new file mode 100644
index 0000000000..3785fa49f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_distinct.cpp
@@ -0,0 +1,42 @@
+#include "planner/operator/logical_distinct.h"
+
+#include "binder/expression/expression_util.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalDistinct::computeFactorizedSchema() {
+    createEmptySchema();
+    auto groupPos = schema->createGroup();
+    for (auto& expression : getKeysAndPayloads()) {
+        schema->insertToGroupAndScope(expression, groupPos);
+    }
+}
+
+void LogicalDistinct::computeFlatSchema() {
+    createEmptySchema();
+    schema->createGroup();
+    for (auto& expression : getKeysAndPayloads()) {
+        schema->insertToGroupAndScope(expression, 0);
+    }
+}
+
+f_group_pos_set LogicalDistinct::getGroupsPosToFlatten() {
+    auto childSchema = children[0]->getSchema();
+    return FlattenAll::getGroupsPosToFlatten(getKeysAndPayloads(), *childSchema);
+}
+
+std::string LogicalDistinct::getExpressionsForPrinting() const {
+    return binder::ExpressionUtil::toString(getKeysAndPayloads());
+}
+
+binder::expression_vector LogicalDistinct::getKeysAndPayloads() const {
+    binder::expression_vector result;
+    result.insert(result.end(), keys.begin(), keys.end());
+    result.insert(result.end(), payloads.begin(), payloads.end());
+    return result;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_dummy_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_dummy_scan.cpp
new file mode 100644
index 0000000000..c72e49b1f5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_dummy_scan.cpp
@@ -0,0 +1,27 @@
+#include "planner/operator/scan/logical_dummy_scan.h"
+
+#include "binder/expression/literal_expression.h"
+#include "common/constants.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void LogicalDummyScan::computeFactorizedSchema() {
+    createEmptySchema();
+    schema->createGroup();
+}
+
+void LogicalDummyScan::computeFlatSchema() {
+    createEmptySchema();
+    schema->createGroup();
+}
+
+std::shared_ptr<binder::Expression> LogicalDummyScan::getDummyExpression() {
+    return std::make_shared<binder::LiteralExpression>(
+        Value::createNullValue(LogicalType::STRING()), InternalKeyword::PLACE_HOLDER);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_dummy_sink.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_dummy_sink.cpp
new file mode 100644
index 0000000000..203307f3cc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_dummy_sink.cpp
@@ -0,0 +1,15 @@
+#include "planner/operator/logical_dummy_sink.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalDummySink::computeFactorizedSchema() {
+    copyChildSchema(0);
+}
+
+void LogicalDummySink::computeFlatSchema() {
+    copyChildSchema(0);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_explain.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_explain.cpp
new file mode 100644
index 0000000000..4a2ffd5b15
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_explain.cpp
@@ -0,0 +1,35 @@
+#include "planner/operator/logical_explain.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void LogicalExplain::computeSchema() {
+    switch (explainType) {
+    case ExplainType::PROFILE:
+        if (children[0]->getSchema()) {
+            copyChildSchema(0);
+        } else {
+            createEmptySchema();
+        }
+        break;
+    case ExplainType::PHYSICAL_PLAN:
+    case ExplainType::LOGICAL_PLAN:
+        createEmptySchema();
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void LogicalExplain::computeFlatSchema() {
+    computeSchema();
+}
+
+void LogicalExplain::computeFactorizedSchema() {
+    computeSchema();
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_filter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_filter.cpp
new file mode 100644
index 0000000000..99fa982fec
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_filter.cpp
@@ -0,0 +1,22 @@
+#include "planner/operator/logical_filter.h"
+
+#include "planner/operator/factorization/flatten_resolver.h"
+
+namespace lbug {
+namespace planner {
+
+f_group_pos_set LogicalFilter::getGroupsPosToFlatten() {
+    auto childSchema = children[0]->getSchema();
+    return FlattenAllButOne::getGroupsPosToFlatten(expression, *childSchema);
+}
+
+f_group_pos LogicalFilter::getGroupPosToSelect() const {
+    auto childSchema = children[0]->getSchema();
+    auto analyzer = GroupDependencyAnalyzer(false, *childSchema);
+    analyzer.visit(expression);
+    SchemaUtils::validateAtMostOneUnFlatGroup(analyzer.getDependentGroups(), *childSchema);
+    return SchemaUtils::getLeadingGroupPos(analyzer.getDependentGroups(), *childSchema);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_flatten.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_flatten.cpp
new file mode 100644
index 0000000000..9a3a2f9429
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_flatten.cpp
@@ -0,0 +1,18 @@
+#include "planner/operator/logical_flatten.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void LogicalFlatten::computeFactorizedSchema() {
+    copyChildSchema(0);
+    schema->flattenGroup(groupPos);
+}
+
+void LogicalFlatten::computeFlatSchema() {
+    throw InternalException("LogicalFlatten::computeFlatSchema() should never be used.");
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_hash_join.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_hash_join.cpp
new file mode 100644
index 0000000000..b54383df37
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_hash_join.cpp
@@ -0,0 +1,207 @@
+#include "planner/operator/logical_hash_join.h"
+
+#include "planner/operator/factorization/flatten_resolver.h"
+#include "planner/operator/factorization/sink_util.h"
+#include "planner/operator/scan/logical_scan_node_table.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+f_group_pos_set LogicalHashJoin::getGroupsPosToFlattenOnProbeSide() {
+    f_group_pos_set result;
+    if (!requireFlatProbeKeys()) {
+        return result;
+    }
+    auto probeSchema = children[0]->getSchema();
+    for (auto& [probeKey, buildKey] : joinConditions) {
+        result.insert(probeSchema->getGroupPos(*probeKey));
+    }
+    return result;
+}
+
+f_group_pos_set LogicalHashJoin::getGroupsPosToFlattenOnBuildSide() {
+    auto buildSchema = children[1]->getSchema();
+    f_group_pos_set joinNodesGroupPos;
+    for (auto& [probeKey, buildKey] : joinConditions) {
+        joinNodesGroupPos.insert(buildSchema->getGroupPos(*buildKey));
+    }
+    return FlattenAllButOne::getGroupsPosToFlatten(joinNodesGroupPos, *buildSchema);
+}
+
+void LogicalHashJoin::computeFactorizedSchema() {
+    auto probeSchema = children[0]->getSchema();
+    auto buildSchema = children[1]->getSchema();
+    schema = probeSchema->copy();
+    switch (joinType) {
+    case JoinType::INNER:
+    case JoinType::LEFT:
+    case JoinType::COUNT: {
+        // Populate group position mapping
+        std::unordered_map<f_group_pos, f_group_pos> buildToProbeKeyGroupPositionMap;
+        for (auto& [probeKey, buildKey] : joinConditions) {
+            auto probeKeyGroupPos = probeSchema->getGroupPos(*probeKey);
+            auto buildKeyGroupPos = buildSchema->getGroupPos(*buildKey);
+            if (!buildToProbeKeyGroupPositionMap.contains(buildKeyGroupPos)) {
+                buildToProbeKeyGroupPositionMap.insert({buildKeyGroupPos, probeKeyGroupPos});
+            }
+        }
+        // Resolve expressions to materialize in each group
+        binder::expression_vector expressionsToMaterializeInNonKeyGroups;
+        for (auto groupIdx = 0u; groupIdx < buildSchema->getNumGroups(); ++groupIdx) {
+            auto expressions = buildSchema->getExpressionsInScope(groupIdx);
+            if (buildToProbeKeyGroupPositionMap.contains(groupIdx)) { // merge key group
+                auto probeKeyGroupPos = buildToProbeKeyGroupPositionMap.at(groupIdx);
+                for (auto& expression : expressions) {
+                    // Join key may repeat for internal ID based joins
+                    schema->insertToGroupAndScopeMayRepeat(expression, probeKeyGroupPos);
+                }
+            } else {
+                for (auto& expression : expressions) {
+                    expressionsToMaterializeInNonKeyGroups.push_back(expression);
+                }
+            }
+        }
+        SinkOperatorUtil::mergeSchema(*buildSchema, expressionsToMaterializeInNonKeyGroups,
+            *schema);
+        if (mark != nullptr) {
+            auto groupPos = schema->getGroupPos(*joinConditions[0].first);
+            schema->insertToGroupAndScope(mark, groupPos);
+        }
+    } break;
+    case JoinType::MARK: {
+        std::unordered_set<f_group_pos> probeSideKeyGroupPositions;
+        for (auto& [probeKey, buildKey] : joinConditions) {
+            probeSideKeyGroupPositions.insert(probeSchema->getGroupPos(*probeKey));
+        }
+        if (probeSideKeyGroupPositions.size() > 1) {
+            SchemaUtils::validateNoUnFlatGroup(probeSideKeyGroupPositions, *probeSchema);
+        }
+        auto markPos = *probeSideKeyGroupPositions.begin();
+        schema->insertToGroupAndScope(mark, markPos);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void LogicalHashJoin::computeFlatSchema() {
+    auto probeSchema = children[0]->getSchema();
+    auto buildSchema = children[1]->getSchema();
+    schema = probeSchema->copy();
+    switch (joinType) {
+    case JoinType::INNER:
+    case JoinType::LEFT:
+    case JoinType::COUNT: {
+        for (auto& expression : buildSchema->getExpressionsInScope()) {
+            // Join key may repeat for internal ID based joins.
+            schema->insertToGroupAndScopeMayRepeat(expression, 0);
+        }
+        if (mark != nullptr) {
+            schema->insertToGroupAndScope(mark, 0);
+        }
+    } break;
+    case JoinType::MARK: {
+        schema->insertToGroupAndScope(mark, 0);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::string LogicalHashJoin::getExpressionsForPrinting() const {
+    if (isNodeIDOnlyJoin(joinConditions)) {
+        return binder::ExpressionUtil::toStringOrdered(getJoinNodeIDs());
+    }
+    return binder::ExpressionUtil::toString(joinConditions);
+}
+
+binder::expression_vector LogicalHashJoin::getExpressionsToMaterialize() const {
+    switch (joinType) {
+    case JoinType::INNER:
+    case JoinType::LEFT:
+    case JoinType::COUNT: {
+        return children[1]->getSchema()->getExpressionsInScope();
+    }
+    case JoinType::MARK: {
+        return binder::expression_vector{};
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::unique_ptr<LogicalOperator> LogicalHashJoin::copy() {
+    auto op = std::make_unique<LogicalHashJoin>(joinConditions, joinType, mark, children[0]->copy(),
+        children[1]->copy(), cardinality);
+    op->sipInfo = sipInfo;
+    return op;
+}
+
+bool LogicalHashJoin::isNodeIDOnlyJoin(const std::vector<join_condition_t>& joinConditions) {
+    for (auto& [probeKey, buildKey] : joinConditions) {
+        if (probeKey->getUniqueName() != buildKey->getUniqueName() ||
+            probeKey->getDataType().getLogicalTypeID() != common::LogicalTypeID::INTERNAL_ID) {
+            return false;
+        }
+    }
+    return true;
+}
+
+binder::expression_vector LogicalHashJoin::getJoinNodeIDs() const {
+    return getJoinNodeIDs(joinConditions);
+}
+
+binder::expression_vector LogicalHashJoin::getJoinNodeIDs(
+    const std::vector<join_condition_t>& joinConditions) {
+    binder::expression_vector result;
+    for (auto& [probeKey, _] : joinConditions) {
+        if (probeKey->expressionType != ExpressionType::PROPERTY) {
+            continue;
+        }
+        if (probeKey->dataType.getLogicalTypeID() != LogicalTypeID::INTERNAL_ID) {
+            continue;
+        }
+        result.push_back(probeKey);
+    }
+    return result;
+}
+
+class JoinNodeIDUniquenessAnalyzer {
+public:
+    static bool isUnique(const LogicalOperator* op, const binder::Expression& joinNodeID) {
+        switch (op->getOperatorType()) {
+        case LogicalOperatorType::FILTER:
+        case LogicalOperatorType::FLATTEN:
+        case LogicalOperatorType::LIMIT:
+        case LogicalOperatorType::PROJECTION:
+        case LogicalOperatorType::SEMI_MASKER:
+            return isUnique(op->getChild(0).get(), joinNodeID);
+        case LogicalOperatorType::SCAN_NODE_TABLE:
+            return *op->constCast<LogicalScanNodeTable>().getNodeID() == joinNodeID;
+        default:
+            return false;
+        }
+    }
+};
+
+bool LogicalHashJoin::requireFlatProbeKeys() const {
+    // Flatten for multiple join keys.
+    if (joinConditions.size() > 1) {
+        return true;
+    }
+    // Flatten for left join.
+    if (joinType == JoinType::LEFT || joinType == JoinType::COUNT) {
+        return true; // TODO(Guodong): fix this. We shouldn't require flatten.
+    }
+    auto& [probeKey, buildKey] = joinConditions[0];
+    // Flatten for non-ID-based join.
+    if (probeKey->dataType.getLogicalTypeID() != LogicalTypeID::INTERNAL_ID) {
+        return true;
+    }
+    return !JoinNodeIDUniquenessAnalyzer::isUnique(children[1].get(), *buildKey);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_intersect.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_intersect.cpp
new file mode 100644
index 0000000000..7125928fde
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_intersect.cpp
@@ -0,0 +1,71 @@
+#include "planner/operator/logical_intersect.h"
+
+namespace lbug {
+namespace planner {
+
+f_group_pos_set LogicalIntersect::getGroupsPosToFlattenOnProbeSide() {
+    f_group_pos_set result;
+    for (auto& keyNodeID : keyNodeIDs) {
+        result.insert(children[0]->getSchema()->getGroupPos(*keyNodeID));
+    }
+    return result;
+}
+
+f_group_pos_set LogicalIntersect::getGroupsPosToFlattenOnBuildSide(uint32_t buildIdx) {
+    f_group_pos_set result;
+    auto childIdx = buildIdx + 1; // skip probe
+    result.insert(children[childIdx]->getSchema()->getGroupPos(*keyNodeIDs[buildIdx]));
+    return result;
+}
+
+void LogicalIntersect::computeFactorizedSchema() {
+    auto probeSchema = children[0]->getSchema();
+    schema = probeSchema->copy();
+    // Write intersect node and rels into a new group regardless of whether rel is n-n.
+    auto outGroupPos = schema->createGroup();
+    schema->insertToGroupAndScope(intersectNodeID, outGroupPos);
+    for (auto i = 1u; i < children.size(); ++i) {
+        auto buildSchema = children[i]->getSchema();
+        auto keyNodeID = keyNodeIDs[i - 1];
+        // Write rel properties into output group.
+        for (auto& expression : buildSchema->getExpressionsInScope()) {
+            if (expression->getUniqueName() == intersectNodeID->getUniqueName() ||
+                expression->getUniqueName() == keyNodeID->getUniqueName()) {
+                continue;
+            }
+            schema->insertToGroupAndScope(expression, outGroupPos);
+        }
+    }
+}
+
+void LogicalIntersect::computeFlatSchema() {
+    auto probeSchema = children[0]->getSchema();
+    schema = probeSchema->copy();
+    schema->insertToGroupAndScope(intersectNodeID, 0);
+    for (auto i = 1u; i < children.size(); ++i) {
+        auto buildSchema = children[i]->getSchema();
+        auto keyNodeID = keyNodeIDs[i - 1];
+        for (auto& expression : buildSchema->getExpressionsInScope()) {
+            if (expression->getUniqueName() == intersectNodeID->getUniqueName() ||
+                expression->getUniqueName() == keyNodeID->getUniqueName()) {
+                continue;
+            }
+            schema->insertToGroupAndScope(expression, 0);
+        }
+    }
+}
+
+std::unique_ptr<LogicalOperator> LogicalIntersect::copy() {
+    std::vector<std::shared_ptr<LogicalOperator>> buildChildren;
+    for (auto i = 1u; i < children.size(); ++i) {
+        buildChildren.push_back(children[i]->copy());
+    }
+    auto op = make_unique<LogicalIntersect>(intersectNodeID, keyNodeIDs, children[0]->copy(),
+        std::move(buildChildren), cardinality);
+    op->sipInfo = sipInfo;
+    op->cardinality = cardinality;
+    return op;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_limit.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_limit.cpp
new file mode 100644
index 0000000000..e9d14f17a0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_limit.cpp
@@ -0,0 +1,45 @@
+#include "planner/operator/logical_limit.h"
+
+#include "binder/expression/expression_util.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+std::string LogicalLimit::getExpressionsForPrinting() const {
+    std::string result;
+    if (hasSkipNum()) {
+        result += "SKIP ";
+        if (ExpressionUtil::canEvaluateAsLiteral(*skipNum)) {
+            result += std::to_string(ExpressionUtil::evaluateAsSkipLimit(*skipNum));
+        }
+    }
+    if (hasLimitNum()) {
+        if (!result.empty()) {
+            result += ",";
+        }
+        result += "LIMIT ";
+        if (ExpressionUtil::canEvaluateAsLiteral(*limitNum)) {
+            result += std::to_string(ExpressionUtil::evaluateAsSkipLimit(*limitNum));
+        }
+    }
+    return result;
+}
+
+f_group_pos_set LogicalLimit::getGroupsPosToFlatten() {
+    auto childSchema = children[0]->getSchema();
+    return FlattenAllButOne::getGroupsPosToFlatten(childSchema->getGroupsPosInScope(),
+        *childSchema);
+}
+
+f_group_pos LogicalLimit::getGroupPosToSelect() const {
+    auto childSchema = children[0]->getSchema();
+    auto groupsPosInScope = childSchema->getGroupsPosInScope();
+    SchemaUtils::validateAtMostOneUnFlatGroup(groupsPosInScope, *childSchema);
+    return SchemaUtils::getLeadingGroupPos(groupsPosInScope, *childSchema);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_operator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_operator.cpp
new file mode 100644
index 0000000000..9f80089c91
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_operator.cpp
@@ -0,0 +1,195 @@
+#include "planner/operator/logical_operator.h"
+
+#include "common/exception/runtime.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+// LCOV_EXCL_START
+std::string LogicalOperatorUtils::logicalOperatorTypeToString(LogicalOperatorType type) {
+    switch (type) {
+    case LogicalOperatorType::ACCUMULATE:
+        return "ACCUMULATE";
+    case LogicalOperatorType::AGGREGATE:
+        return "AGGREGATE";
+    case LogicalOperatorType::ALTER:
+        return "ALTER";
+    case LogicalOperatorType::ATTACH_DATABASE:
+        return "ATTACH_DATABASE";
+    case LogicalOperatorType::COPY_FROM:
+        return "COPY_FROM";
+    case LogicalOperatorType::COPY_TO:
+        return "COPY_TO";
+    case LogicalOperatorType::CREATE_MACRO:
+        return "CREATE_MACRO";
+    case LogicalOperatorType::CREATE_SEQUENCE:
+        return "CREATE_SEQUENCE";
+    case LogicalOperatorType::CREATE_TABLE:
+        return "CREATE_TABLE";
+    case LogicalOperatorType::CROSS_PRODUCT:
+        return "CROSS_PRODUCT";
+    case LogicalOperatorType::DELETE:
+        return "DELETE_NODE";
+    case LogicalOperatorType::DETACH_DATABASE:
+        return "DETACH_DATABASE";
+    case LogicalOperatorType::DISTINCT:
+        return "DISTINCT";
+    case LogicalOperatorType::DROP:
+        return "DROP";
+    case LogicalOperatorType::DUMMY_SCAN:
+        return "DUMMY_SCAN";
+    case LogicalOperatorType::DUMMY_SINK:
+        return "DUMMY_SINK";
+    case LogicalOperatorType::EMPTY_RESULT:
+        return "EMPTY_RESULT";
+    case LogicalOperatorType::EXPLAIN:
+        return "EXPLAIN";
+    case LogicalOperatorType::EXPRESSIONS_SCAN:
+        return "EXPRESSIONS_SCAN";
+    case LogicalOperatorType::EXTENSION:
+        return "LOAD";
+    case LogicalOperatorType::EXPORT_DATABASE:
+        return "EXPORT_DATABASE";
+    case LogicalOperatorType::EXTEND:
+        return "EXTEND";
+    case LogicalOperatorType::FILTER:
+        return "FILTER";
+    case LogicalOperatorType::FLATTEN:
+        return "FLATTEN";
+    case LogicalOperatorType::HASH_JOIN:
+        return "HASH_JOIN";
+    case LogicalOperatorType::IMPORT_DATABASE:
+        return "IMPORT_DATABASE";
+    case LogicalOperatorType::INDEX_LOOK_UP:
+        return "INDEX_LOOK_UP";
+    case LogicalOperatorType::INTERSECT:
+        return "INTERSECT";
+    case LogicalOperatorType::INSERT:
+        return "INSERT";
+    case LogicalOperatorType::LIMIT:
+        return "LIMIT";
+    case LogicalOperatorType::MERGE:
+        return "MERGE";
+    case LogicalOperatorType::MULTIPLICITY_REDUCER:
+        return "MULTIPLICITY_REDUCER";
+    case LogicalOperatorType::NODE_LABEL_FILTER:
+        return "NODE_LABEL_FILTER";
+    case LogicalOperatorType::NOOP:
+        return "NOOP";
+    case LogicalOperatorType::ORDER_BY:
+        return "ORDER_BY";
+    case LogicalOperatorType::PARTITIONER:
+        return "PARTITIONER";
+    case LogicalOperatorType::PATH_PROPERTY_PROBE:
+        return "PATH_PROPERTY_PROBE";
+    case LogicalOperatorType::PROJECTION:
+        return "PROJECTION";
+    case LogicalOperatorType::RECURSIVE_EXTEND:
+        return "RECURSIVE_EXTEND";
+    case LogicalOperatorType::SCAN_NODE_TABLE:
+        return "SCAN_NODE_TABLE";
+    case LogicalOperatorType::SEMI_MASKER:
+        return "SEMI_MASKER";
+    case LogicalOperatorType::SET_PROPERTY:
+        return "SET_PROPERTY";
+    case LogicalOperatorType::STANDALONE_CALL:
+        return "STANDALONE_CALL";
+    case LogicalOperatorType::TABLE_FUNCTION_CALL:
+        return "TABLE_FUNCTION_CALL";
+    case LogicalOperatorType::TRANSACTION:
+        return "TRANSACTION";
+    case LogicalOperatorType::UNION_ALL:
+        return "UNION_ALL";
+    case LogicalOperatorType::UNWIND:
+        return "UNWIND";
+    case LogicalOperatorType::USE_DATABASE:
+        return "USE_DATABASE";
+    case LogicalOperatorType::CREATE_TYPE:
+        return "CREATE_TYPE";
+    case LogicalOperatorType::EXTENSION_CLAUSE:
+        return "EXTENSION_CLAUSE";
+    default:
+        throw RuntimeException("Unknown logical operator type.");
+    }
+}
+// LCOV_EXCL_STOP
+
+bool LogicalOperatorUtils::isUpdate(LogicalOperatorType type) {
+    switch (type) {
+    case LogicalOperatorType::INSERT:
+    case LogicalOperatorType::DELETE:
+    case LogicalOperatorType::SET_PROPERTY:
+    case LogicalOperatorType::MERGE:
+        return true;
+    default:
+        return false;
+    }
+}
+
+bool LogicalOperatorUtils::isAccHashJoin(const LogicalOperator& op) {
+    return op.getOperatorType() == LogicalOperatorType::HASH_JOIN &&
+           op.getChild(0)->getOperatorType() == LogicalOperatorType::ACCUMULATE;
+}
+
+LogicalOperator::LogicalOperator(LogicalOperatorType operatorType,
+    std::shared_ptr<LogicalOperator> child, std::optional<common::cardinality_t> cardinality)
+    : operatorType{operatorType},
+      cardinality{cardinality.has_value() ? cardinality.value() : child->getCardinality()} {
+    children.push_back(std::move(child));
+}
+
+LogicalOperator::LogicalOperator(LogicalOperatorType operatorType,
+    std::shared_ptr<LogicalOperator> left, std::shared_ptr<LogicalOperator> right)
+    : LogicalOperator{operatorType} {
+    children.push_back(std::move(left));
+    children.push_back(std::move(right));
+}
+
+LogicalOperator::LogicalOperator(LogicalOperatorType operatorType,
+    const logical_op_vector_t& children)
+    : LogicalOperator{operatorType} {
+    for (auto& child : children) {
+        this->children.push_back(child);
+    }
+}
+
+bool LogicalOperator::hasUpdateRecursive() {
+    if (LogicalOperatorUtils::isUpdate(operatorType)) {
+        return true;
+    }
+    for (auto& child : children) {
+        if (child->hasUpdateRecursive()) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::string LogicalOperator::toString(uint64_t depth) const {
+    auto padding = std::string(depth * 4, ' ');
+    std::string result = padding;
+    result += LogicalOperatorUtils::logicalOperatorTypeToString(operatorType) + "[" +
+              getExpressionsForPrinting() + "]";
+    if (children.size() == 1) {
+        result += "\n" + children[0]->toString(depth);
+    } else {
+        for (auto& child : children) {
+            result += "\n" + padding + "CHILD:\n" + child->toString(depth + 1);
+        }
+    }
+    return result;
+}
+
+logical_op_vector_t LogicalOperator::copy(const logical_op_vector_t& ops) {
+    logical_op_vector_t result;
+    result.reserve(ops.size());
+    for (auto& op : ops) {
+        result.push_back(op->copy());
+    }
+    return result;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_order_by.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_order_by.cpp
new file mode 100644
index 0000000000..e2ab8b5ad8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_order_by.cpp
@@ -0,0 +1,59 @@
+#include "planner/operator/logical_order_by.h"
+
+#include "binder/expression/expression_util.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+#include "planner/operator/factorization/sink_util.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+f_group_pos_set LogicalOrderBy::getGroupsPosToFlatten() {
+    // We only allow orderby key(s) to be unflat, if they are all part of the same factorization
+    // group and there is no other factorized group in the schema, so any payload is also unflat
+    // and part of the same factorization group. The rationale for this limitation is this: (1)
+    // to keep both the frontend and orderby operators simpler, we want order by to not change
+    // the schema, so the input and output of order by should have the same factorization
+    // structure. (2) Because orderby needs to flatten the keys to sort, if a key column that is
+    // unflat is the input, we need to somehow flatten it in the factorized table. However
+    // whenever we can we want to avoid adding an explicit flatten operator as this makes us
+    // fall back to tuple-at-a-time processing. However in the specified limited case, we can
+    // give factorized table a set of unflat vectors (all in the same datachunk/factorization
+    // group), sort the table, and scan into unflat vectors, so the schema remains the same. In
+    // more complicated cases, e.g., when there are 2 factorization groups, FactorizedTable
+    // cannot read back a flat column into an unflat std::vector.
+    auto childSchema = children[0]->getSchema();
+    if (childSchema->getNumGroups() > 1) {
+        return FlattenAll::getGroupsPosToFlatten(expressionsToOrderBy, *childSchema);
+    }
+    return f_group_pos_set{};
+}
+
+void LogicalOrderBy::computeFactorizedSchema() {
+    createEmptySchema();
+    auto childSchema = children[0]->getSchema();
+    SinkOperatorUtil::recomputeSchema(*childSchema, childSchema->getExpressionsInScope(), *schema);
+}
+
+void LogicalOrderBy::computeFlatSchema() {
+    createEmptySchema();
+    schema->createGroup();
+    for (auto& expression : children[0]->getSchema()->getExpressionsInScope()) {
+        schema->insertToGroupAndScope(expression, 0);
+    }
+}
+
+std::string LogicalOrderBy::getExpressionsForPrinting() const {
+    auto result = ExpressionUtil::toString(expressionsToOrderBy) + " ";
+    if (hasSkipNum() && ExpressionUtil::canEvaluateAsLiteral(*skipNum)) {
+        result += "SKIP " + std::to_string(ExpressionUtil::evaluateAsSkipLimit(*skipNum));
+    }
+    if (hasLimitNum() && ExpressionUtil::canEvaluateAsLiteral(*limitNum)) {
+        result += "LIMIT " + std::to_string(ExpressionUtil::evaluateAsSkipLimit(*limitNum));
+    }
+    return result;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_partitioner.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_partitioner.cpp
new file mode 100644
index 0000000000..7c79b3ae20
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_partitioner.cpp
@@ -0,0 +1,41 @@
+#include "planner/operator/logical_partitioner.h"
+
+#include "binder/expression/expression_util.h"
+#include "common/exception/runtime.h"
+
+namespace lbug {
+namespace planner {
+
+static void validateSingleGroup(const Schema& schema) {
+    if (schema.getNumGroups() != 1) {
+        throw common::RuntimeException(
+            "Try to partition multiple factorization group. This should not happen.");
+    }
+}
+
+void LogicalPartitioner::computeFactorizedSchema() {
+    copyChildSchema(0);
+    // LCOV_EXCL_START
+    validateSingleGroup(*schema);
+    // LCOV_EXCL_STOP
+    schema->insertToGroupAndScope(info.offset, 0);
+}
+
+void LogicalPartitioner::computeFlatSchema() {
+    copyChildSchema(0);
+    // LCOV_EXCL_START
+    validateSingleGroup(*schema);
+    // LCOV_EXCL_STOP
+    schema->insertToGroupAndScope(info.offset, 0);
+}
+
+std::string LogicalPartitioner::getExpressionsForPrinting() const {
+    binder::expression_vector expressions;
+    for (auto& partitioningInfo : info.partitioningInfos) {
+        expressions.push_back(copyFromInfo.columnExprs[partitioningInfo.keyIdx]);
+    }
+    return binder::ExpressionUtil::toString(expressions);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_path_property_probe.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_path_property_probe.cpp
new file mode 100644
index 0000000000..3fc3ad48d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_path_property_probe.cpp
@@ -0,0 +1,57 @@
+#include "planner/operator/logical_path_property_probe.h"
+
+#include "optimizer/factorization_rewriter.h"
+#include "optimizer/remove_factorization_rewriter.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalPathPropertyProbe::computeFactorizedSchema() {
+    copyChildSchema(0);
+    if (pathNodeIDs != nullptr) {
+        KU_ASSERT(schema->getNumGroups() == 1);
+        schema->insertToGroupAndScope(recursiveRel, 0);
+    }
+
+    if (nodeChild != nullptr) {
+        auto rewriter = optimizer::FactorizationRewriter();
+        rewriter.visitOperator(nodeChild.get());
+    }
+    if (relChild != nullptr) {
+        auto rewriter = optimizer::FactorizationRewriter();
+        rewriter.visitOperator(relChild.get());
+    }
+}
+
+void LogicalPathPropertyProbe::computeFlatSchema() {
+    copyChildSchema(0);
+    if (pathNodeIDs != nullptr) {
+        KU_ASSERT(schema->getNumGroups() == 1);
+        schema->insertToGroupAndScope(recursiveRel, 0);
+    }
+
+    if (nodeChild != nullptr) {
+        auto rewriter = optimizer::RemoveFactorizationRewriter();
+        rewriter.visitOperator(nodeChild);
+    }
+    if (relChild != nullptr) {
+        auto rewriter = optimizer::RemoveFactorizationRewriter();
+        rewriter.visitOperator(relChild);
+    }
+}
+
+std::unique_ptr<LogicalOperator> LogicalPathPropertyProbe::copy() {
+    auto nodeChildCopy = nodeChild == nullptr ? nullptr : nodeChild->copy();
+    auto relChildCopy = relChild == nullptr ? nullptr : relChild->copy();
+    auto op = std::make_unique<LogicalPathPropertyProbe>(recursiveRel, children[0]->copy(),
+        std::move(nodeChildCopy), std::move(relChildCopy), joinType);
+    op->sipInfo = sipInfo;
+    op->direction = direction;
+    op->extendFromLeft = extendFromLeft;
+    op->pathNodeIDs = pathNodeIDs;
+    op->pathEdgeIDs = pathEdgeIDs;
+    return op;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_plan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_plan.cpp
new file mode 100644
index 0000000000..188857a3e8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_plan.cpp
@@ -0,0 +1,19 @@
+#include "planner/operator/logical_plan.h"
+
+#include "planner/operator/logical_explain.h"
+
+namespace lbug {
+namespace planner {
+
+bool LogicalPlan::isProfile() const {
+    return lastOperator->getOperatorType() == LogicalOperatorType::EXPLAIN &&
+           reinterpret_cast<LogicalExplain*>(lastOperator.get())->getExplainType() ==
+               common::ExplainType::PROFILE;
+}
+
+bool LogicalPlan::hasUpdate() const {
+    return lastOperator->hasUpdateRecursive();
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_plan_util.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_plan_util.cpp
new file mode 100644
index 0000000000..b54c879886
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_plan_util.cpp
@@ -0,0 +1,105 @@
+#include "planner/operator/logical_plan_util.h"
+
+#include "binder/expression/property_expression.h"
+#include "planner/operator/extend/logical_extend.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/logical_intersect.h"
+#include "planner/operator/scan/logical_scan_node_table.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+std::string LogicalPlanUtil::encodeJoin(LogicalPlan& logicalPlan) {
+    return encode(logicalPlan.getLastOperator().get());
+}
+
+std::string LogicalPlanUtil::encode(LogicalOperator* logicalOperator) {
+    std::string result;
+    encodeRecursive(logicalOperator, result);
+    return result;
+}
+
+void LogicalPlanUtil::encodeRecursive(LogicalOperator* logicalOperator, std::string& encodeString) {
+    switch (logicalOperator->getOperatorType()) {
+    case LogicalOperatorType::CROSS_PRODUCT: {
+        encodeCrossProduct(logicalOperator, encodeString);
+        for (auto i = 0u; i < logicalOperator->getNumChildren(); ++i) {
+            encodeString += "{";
+            encodeRecursive(logicalOperator->getChild(i).get(), encodeString);
+            encodeString += "}";
+        }
+    } break;
+    case LogicalOperatorType::INTERSECT: {
+        encodeIntersect(logicalOperator, encodeString);
+        for (auto i = 0u; i < logicalOperator->getNumChildren(); ++i) {
+            encodeString += "{";
+            encodeRecursive(logicalOperator->getChild(i).get(), encodeString);
+            encodeString += "}";
+        }
+    } break;
+    case LogicalOperatorType::HASH_JOIN: {
+        encodeHashJoin(logicalOperator, encodeString);
+        encodeString += "{";
+        encodeRecursive(logicalOperator->getChild(0).get(), encodeString);
+        encodeString += "}{";
+        encodeRecursive(logicalOperator->getChild(1).get(), encodeString);
+        encodeString += "}";
+    } break;
+    case LogicalOperatorType::EXTEND: {
+        encodeExtend(logicalOperator, encodeString);
+        encodeRecursive(logicalOperator->getChild(0).get(), encodeString);
+    } break;
+    case LogicalOperatorType::SCAN_NODE_TABLE: {
+        encodeScanNodeTable(logicalOperator, encodeString);
+    } break;
+    case LogicalOperatorType::FILTER: {
+        encodeFilter(logicalOperator, encodeString);
+        encodeRecursive(logicalOperator->getChild(0).get(), encodeString);
+    } break;
+    default:
+        for (auto i = 0u; i < logicalOperator->getNumChildren(); ++i) {
+            encodeRecursive(logicalOperator->getChild(i).get(), encodeString);
+        }
+    }
+}
+
+void LogicalPlanUtil::encodeCrossProduct(LogicalOperator* /*logicalOperator*/,
+    std::string& encodeString) {
+    encodeString += "CP()";
+}
+
+void LogicalPlanUtil::encodeIntersect(LogicalOperator* logicalOperator, std::string& encodeString) {
+    auto& logicalIntersect = logicalOperator->constCast<LogicalIntersect>();
+    encodeString += "I(" + logicalIntersect.getIntersectNodeID()->toString() + ")";
+}
+
+void LogicalPlanUtil::encodeHashJoin(LogicalOperator* logicalOperator, std::string& encodeString) {
+    auto& logicalHashJoin = logicalOperator->constCast<LogicalHashJoin>();
+    encodeString += "HJ(" + logicalHashJoin.getExpressionsForPrinting() + ")";
+}
+
+void LogicalPlanUtil::encodeExtend(LogicalOperator* logicalOperator, std::string& encodeString) {
+    auto& logicalExtend = logicalOperator->constCast<LogicalExtend>();
+    encodeString += "E(" + logicalExtend.getNbrNode()->toString() + ")";
+}
+
+void LogicalPlanUtil::encodeScanNodeTable(LogicalOperator* logicalOperator,
+    std::string& encodeString) {
+    auto& scan = logicalOperator->constCast<LogicalScanNodeTable>();
+    if (scan.getScanType() == LogicalScanNodeTableType::PRIMARY_KEY_SCAN) {
+        encodeString += "IndexScan";
+    } else {
+        encodeString += "S";
+    }
+    encodeString +=
+        "(" + scan.getNodeID()->constCast<PropertyExpression>().getRawVariableName() + ")";
+}
+
+void LogicalPlanUtil::encodeFilter(LogicalOperator*, std::string& encodedString) {
+    encodedString += "Filter()";
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_projection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_projection.cpp
new file mode 100644
index 0000000000..0f7f7379f8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_projection.cpp
@@ -0,0 +1,60 @@
+#include "planner/operator/logical_projection.h"
+
+#include "planner/operator/factorization/flatten_resolver.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalProjection::computeFactorizedSchema() {
+    auto childSchema = children[0]->getSchema();
+    schema = childSchema->copy();
+    schema->clearExpressionsInScope();
+    for (auto& expression : expressions) {
+        auto groupPos = INVALID_F_GROUP_POS;
+        if (childSchema->isExpressionInScope(*expression)) { // expression to reference
+            groupPos = childSchema->getGroupPos(*expression);
+            schema->insertToScopeMayRepeat(expression, groupPos);
+        } else { // expression to evaluate
+            auto analyzer = GroupDependencyAnalyzer(false, *childSchema);
+            analyzer.visit(expression);
+            auto dependentGroupPos = analyzer.getDependentGroups();
+            SchemaUtils::validateAtMostOneUnFlatGroup(dependentGroupPos, *childSchema);
+            if (dependentGroupPos.empty()) { // constant
+                groupPos = schema->createGroup();
+                schema->setGroupAsSingleState(groupPos);
+            } else {
+                groupPos = SchemaUtils::getLeadingGroupPos(dependentGroupPos, *childSchema);
+            }
+            schema->insertToGroupAndScopeMayRepeat(expression, groupPos);
+        }
+    }
+}
+
+void LogicalProjection::computeFlatSchema() {
+    copyChildSchema(0);
+    auto childSchema = children[0]->getSchema();
+    schema->clearExpressionsInScope();
+    for (auto& expression : expressions) {
+        if (childSchema->isExpressionInScope(*expression)) {
+            schema->insertToScopeMayRepeat(expression, 0);
+        } else {
+            schema->insertToGroupAndScopeMayRepeat(expression, 0);
+        }
+    }
+}
+
+std::unordered_set<uint32_t> LogicalProjection::getDiscardedGroupsPos() const {
+    auto groupsPosInScopeBeforeProjection = children[0]->getSchema()->getGroupsPosInScope();
+    auto groupsPosInScopeAfterProjection = schema->getGroupsPosInScope();
+    std::unordered_set<uint32_t> discardGroupsPos;
+    for (auto i = 0u; i < schema->getNumGroups(); ++i) {
+        if (groupsPosInScopeBeforeProjection.contains(i) &&
+            !groupsPosInScopeAfterProjection.contains(i)) {
+            discardGroupsPos.insert(i);
+        }
+    }
+    return discardGroupsPos;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_standalone_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_standalone_call.cpp
new file mode 100644
index 0000000000..9277b4ada8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_standalone_call.cpp
@@ -0,0 +1,13 @@
+#include "planner/operator/logical_standalone_call.h"
+
+#include "main/db_config.h"
+
+namespace lbug {
+namespace planner {
+
+std::string LogicalStandaloneCall::getExpressionsForPrinting() const {
+    return option->name;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_table_function_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_table_function_call.cpp
new file mode 100644
index 0000000000..e78d0712a2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_table_function_call.cpp
@@ -0,0 +1,23 @@
+#include "planner/operator/logical_table_function_call.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalTableFunctionCall::computeFlatSchema() {
+    createEmptySchema();
+    auto groupPos = schema->createGroup();
+    for (auto& expr : bindData->columns) {
+        schema->insertToGroupAndScope(expr, groupPos);
+    }
+}
+
+void LogicalTableFunctionCall::computeFactorizedSchema() {
+    createEmptySchema();
+    auto groupPos = schema->createGroup();
+    for (auto& expr : bindData->columns) {
+        schema->insertToGroupAndScope(expr, groupPos);
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_union.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_union.cpp
new file mode 100644
index 0000000000..b9fdc1ba67
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_union.cpp
@@ -0,0 +1,57 @@
+#include "planner/operator/logical_union.h"
+
+#include "planner/operator/factorization/flatten_resolver.h"
+#include "planner/operator/factorization/sink_util.h"
+
+namespace lbug {
+namespace planner {
+
+f_group_pos_set LogicalUnion::getGroupsPosToFlatten(uint32_t childIdx) {
+    f_group_pos_set groupsPos;
+    auto childSchema = children[childIdx]->getSchema();
+    for (auto i = 0u; i < expressionsToUnion.size(); ++i) {
+        if (requireFlatExpression(i)) {
+            auto expression = childSchema->getExpressionsInScope()[i];
+            groupsPos.insert(childSchema->getGroupPos(*expression));
+        }
+    }
+    return FlattenAll::getGroupsPosToFlatten(groupsPos, *childSchema);
+}
+
+void LogicalUnion::computeFactorizedSchema() {
+    auto firstChildSchema = children[0]->getSchema();
+    createEmptySchema();
+    SinkOperatorUtil::recomputeSchema(*firstChildSchema, firstChildSchema->getExpressionsInScope(),
+        *schema);
+}
+
+void LogicalUnion::computeFlatSchema() {
+    createEmptySchema();
+    schema->createGroup();
+    for (auto& expression : children[0]->getSchema()->getExpressionsInScope()) {
+        schema->insertToGroupAndScope(expression, 0);
+    }
+}
+
+std::unique_ptr<LogicalOperator> LogicalUnion::copy() {
+    std::vector<std::shared_ptr<LogicalOperator>> copiedChildren;
+    copiedChildren.reserve(getNumChildren());
+    for (auto i = 0u; i < getNumChildren(); ++i) {
+        copiedChildren.push_back(getChild(i)->copy());
+    }
+    return make_unique<LogicalUnion>(expressionsToUnion, std::move(copiedChildren));
+}
+
+bool LogicalUnion::requireFlatExpression(uint32_t expressionIdx) {
+    for (auto& child : children) {
+        auto childSchema = child->getSchema();
+        auto expression = childSchema->getExpressionsInScope()[expressionIdx];
+        if (childSchema->getGroup(expression)->isFlat()) {
+            return true;
+        }
+    }
+    return false;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_unwind.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_unwind.cpp
new file mode 100644
index 0000000000..38735c2e8d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/logical_unwind.cpp
@@ -0,0 +1,34 @@
+#include "planner/operator/logical_unwind.h"
+
+#include "planner/operator/factorization/flatten_resolver.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+f_group_pos_set LogicalUnwind::getGroupsPosToFlatten() {
+    auto childSchema = children[0]->getSchema();
+    return FlattenAll::getGroupsPosToFlatten(inExpr, *childSchema);
+}
+
+void LogicalUnwind::computeFactorizedSchema() {
+    copyChildSchema(0);
+    auto groupPos = schema->createGroup();
+    schema->insertToGroupAndScope(outExpr, groupPos);
+    if (hasIDExpr()) {
+        schema->insertToGroupAndScope(idExpr, groupPos);
+    }
+}
+
+void LogicalUnwind::computeFlatSchema() {
+    copyChildSchema(0);
+    schema->insertToGroupAndScope(outExpr, 0);
+    if (hasIDExpr()) {
+        schema->insertToGroupAndScope(idExpr, 0);
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/CMakeLists.txt
new file mode 100644
index 0000000000..93a3eea661
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/CMakeLists.txt
@@ -0,0 +1,13 @@
+add_library(lbug_planner_persistent
+        OBJECT
+        logical_copy_from.cpp
+        logical_copy_to.cpp
+        logical_insert.cpp
+        logical_delete.cpp
+        logical_merge.cpp
+        logical_set.cpp
+)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner_persistent>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_copy_from.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_copy_from.cpp
new file mode 100644
index 0000000000..7c77b89ffe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_copy_from.cpp
@@ -0,0 +1,17 @@
+#include "planner/operator/persistent/logical_copy_from.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void LogicalCopyFrom::computeFactorizedSchema() {
+    copyChildSchema(0);
+}
+
+void LogicalCopyFrom::computeFlatSchema() {
+    copyChildSchema(0);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_copy_to.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_copy_to.cpp
new file mode 100644
index 0000000000..260ad1abd0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_copy_to.cpp
@@ -0,0 +1,33 @@
+#include "planner/operator/persistent/logical_copy_to.h"
+
+#include "planner/operator/factorization/flatten_resolver.h"
+
+namespace lbug {
+namespace planner {
+
+std::string LogicalCopyToPrintInfo::toString() const {
+    std::string result = "";
+    result += "Export: ";
+    for (auto& name : columnNames) {
+        result += name + ", ";
+    }
+    result += "To: " + fileName;
+    return result;
+}
+
+void LogicalCopyTo::computeFactorizedSchema() {
+    copyChildSchema(0);
+}
+
+void LogicalCopyTo::computeFlatSchema() {
+    copyChildSchema(0);
+}
+
+f_group_pos_set LogicalCopyTo::getGroupsPosToFlatten() {
+    auto childSchema = children[0]->getSchema();
+    auto dependentGroupsPos = childSchema->getGroupsPosInScope();
+    return FlattenAllButOne::getGroupsPosToFlatten(dependentGroupsPos, *childSchema);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_delete.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_delete.cpp
new file mode 100644
index 0000000000..40107e84fd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_delete.cpp
@@ -0,0 +1,47 @@
+#include "planner/operator/persistent/logical_delete.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/expression/node_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+std::string LogicalDelete::getExpressionsForPrinting() const {
+    expression_vector patterns;
+    for (auto& info : infos) {
+        patterns.push_back(info.pattern);
+    }
+    return ExpressionUtil::toString(patterns);
+}
+
+f_group_pos_set LogicalDelete::getGroupsPosToFlatten() const {
+    KU_ASSERT(!infos.empty());
+    const auto childSchema = children[0]->getSchema();
+    f_group_pos_set dependentGroupPos;
+    switch (infos[0].tableType) {
+    case TableType::NODE: {
+        for (auto& info : infos) {
+            auto nodeID = info.pattern->constCast<NodeExpression>().getInternalID();
+            dependentGroupPos.insert(childSchema->getGroupPos(*nodeID));
+        }
+    } break;
+    case TableType::REL: {
+        for (auto& info : infos) {
+            auto& rel = info.pattern->constCast<RelExpression>();
+            dependentGroupPos.insert(childSchema->getGroupPos(*rel.getSrcNode()->getInternalID()));
+            dependentGroupPos.insert(childSchema->getGroupPos(*rel.getDstNode()->getInternalID()));
+        }
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return FlattenAll::getGroupsPosToFlatten(dependentGroupPos, *childSchema);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_insert.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_insert.cpp
new file mode 100644
index 0000000000..20238fd4e1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_insert.cpp
@@ -0,0 +1,60 @@
+#include "planner/operator/persistent/logical_insert.h"
+
+#include "binder/expression/node_expression.h"
+#include "common/cast.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void LogicalInsert::computeFactorizedSchema() {
+    copyChildSchema(0);
+    for (auto& info : infos) {
+        auto groupPos = schema->createGroup();
+        schema->setGroupAsSingleState(groupPos);
+        for (auto i = 0u; i < info.columnExprs.size(); ++i) {
+            if (info.isReturnColumnExprs[i]) {
+                schema->insertToGroupAndScope(info.columnExprs[i], groupPos);
+            }
+        }
+        if (info.tableType == TableType::NODE) {
+            auto node = ku_dynamic_cast<NodeExpression*>(info.pattern.get());
+            schema->insertToGroupAndScopeMayRepeat(node->getInternalID(), groupPos);
+        }
+    }
+}
+
+void LogicalInsert::computeFlatSchema() {
+    copyChildSchema(0);
+    for (auto& info : infos) {
+        for (auto i = 0u; i < info.columnExprs.size(); ++i) {
+            if (info.isReturnColumnExprs[i]) {
+                schema->insertToGroupAndScope(info.columnExprs[i], 0);
+            }
+        }
+        if (info.tableType == TableType::NODE) {
+            auto node = ku_dynamic_cast<NodeExpression*>(info.pattern.get());
+            schema->insertToGroupAndScopeMayRepeat(node->getInternalID(), 0);
+        }
+    }
+}
+
+std::string LogicalInsert::getExpressionsForPrinting() const {
+    std::string result;
+    for (auto i = 0u; i < infos.size() - 1; ++i) {
+        result += infos[i].pattern->toString() + ",";
+    }
+    result += infos[infos.size() - 1].pattern->toString();
+    return result;
+}
+
+f_group_pos_set LogicalInsert::getGroupsPosToFlatten() {
+    auto childSchema = children[0]->getSchema();
+    return FlattenAll::getGroupsPosToFlatten(childSchema->getGroupsPosInScope(), *childSchema);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_merge.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_merge.cpp
new file mode 100644
index 0000000000..af0b6464f8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_merge.cpp
@@ -0,0 +1,51 @@
+#include "planner/operator/persistent/logical_merge.h"
+
+#include "binder/expression/node_expression.h"
+#include "common/cast.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void LogicalMerge::computeFactorizedSchema() {
+    copyChildSchema(0);
+    for (auto& info : insertNodeInfos) {
+        // Predicate iri is not matched but needs to be inserted.
+        auto node = ku_dynamic_cast<NodeExpression*>(info.pattern.get());
+        if (!schema->isExpressionInScope(*node->getInternalID())) {
+            auto groupPos = schema->createGroup();
+            schema->setGroupAsSingleState(groupPos);
+            schema->insertToGroupAndScope(node->getInternalID(), groupPos);
+        }
+    }
+}
+
+void LogicalMerge::computeFlatSchema() {
+    copyChildSchema(0);
+    for (auto& info : insertNodeInfos) {
+        auto node = ku_dynamic_cast<NodeExpression*>(info.pattern.get());
+        schema->insertToGroupAndScopeMayRepeat(node->getInternalID(), 0);
+    }
+}
+
+f_group_pos_set LogicalMerge::getGroupsPosToFlatten() {
+    auto childSchema = children[0]->getSchema();
+    return FlattenAll::getGroupsPosToFlatten(childSchema->getGroupsPosInScope(), *childSchema);
+}
+
+std::unique_ptr<LogicalOperator> LogicalMerge::copy() {
+    auto merge = std::make_unique<LogicalMerge>(existenceMark, keys, children[0]->copy());
+    merge->insertNodeInfos = copyVector(insertNodeInfos);
+    merge->insertRelInfos = copyVector(insertRelInfos);
+    merge->onCreateSetNodeInfos = copyVector(onCreateSetNodeInfos);
+    merge->onCreateSetRelInfos = copyVector(onCreateSetRelInfos);
+    merge->onMatchSetNodeInfos = copyVector(onMatchSetNodeInfos);
+    merge->onMatchSetRelInfos = copyVector(onMatchSetRelInfos);
+    return merge;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_set.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_set.cpp
new file mode 100644
index 0000000000..b09c57e887
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/persistent/logical_set.cpp
@@ -0,0 +1,61 @@
+#include "planner/operator/persistent/logical_set.h"
+
+#include "binder/expression/expression_util.h"
+#include "binder/expression/rel_expression.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void LogicalSetProperty::computeFactorizedSchema() {
+    copyChildSchema(0);
+}
+
+void LogicalSetProperty::computeFlatSchema() {
+    copyChildSchema(0);
+}
+
+f_group_pos_set LogicalSetProperty::getGroupsPosToFlatten(uint32_t idx) const {
+    f_group_pos_set result;
+    auto childSchema = children[0]->getSchema();
+    auto& info = infos[idx];
+    switch (getTableType()) {
+    case TableType::NODE: {
+        auto node = info.pattern->constPtrCast<NodeExpression>();
+        result.insert(childSchema->getGroupPos(*node->getInternalID()));
+    } break;
+    case TableType::REL: {
+        auto rel = info.pattern->constPtrCast<RelExpression>();
+        result.insert(childSchema->getGroupPos(*rel->getSrcNode()->getInternalID()));
+        result.insert(childSchema->getGroupPos(*rel->getDstNode()->getInternalID()));
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    auto analyzer = GroupDependencyAnalyzer(false, *childSchema);
+    analyzer.visit(info.columnData);
+    for (auto& groupPos : analyzer.getDependentGroups()) {
+        result.insert(groupPos);
+    }
+    return FlattenAll::getGroupsPosToFlatten(result, *childSchema);
+}
+
+std::string LogicalSetProperty::getExpressionsForPrinting() const {
+    std::string result =
+        ExpressionUtil::toString(std::make_pair(infos[0].column, infos[0].columnData));
+    for (auto i = 1u; i < infos.size(); ++i) {
+        result += ExpressionUtil::toString(std::make_pair(infos[i].column, infos[i].columnData));
+    }
+    return result;
+}
+
+common::TableType LogicalSetProperty::getTableType() const {
+    KU_ASSERT(!infos.empty());
+    return infos[0].tableType;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/CMakeLists.txt
new file mode 100644
index 0000000000..f2b03bca0f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_planner_scan
+        OBJECT
+        logical_expressions_scan.cpp
+        logical_index_look_up.cpp
+        logical_scan_node_table.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner_scan>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/logical_expressions_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/logical_expressions_scan.cpp
new file mode 100644
index 0000000000..c1f767461a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/logical_expressions_scan.cpp
@@ -0,0 +1,15 @@
+#include "planner/operator/scan/logical_expressions_scan.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalExpressionsScan::computeSchema() {
+    createEmptySchema();
+    schema->createGroup();
+    for (auto& expression : expressions) {
+        schema->insertToGroupAndScope(expression, 0);
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/logical_index_look_up.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/logical_index_look_up.cpp
new file mode 100644
index 0000000000..6937bf337a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/logical_index_look_up.cpp
@@ -0,0 +1,35 @@
+#include "planner/operator/scan/logical_index_look_up.h"
+
+#include "binder/expression/expression_util.h"
+
+namespace lbug {
+namespace planner {
+
+std::string LogicalPrimaryKeyLookup::getExpressionsForPrinting() const {
+    binder::expression_vector expressions;
+    for (auto& info : infos) {
+        expressions.push_back(info.offset);
+    }
+    return binder::ExpressionUtil::toString(expressions);
+}
+
+void LogicalPrimaryKeyLookup::computeFactorizedSchema() {
+    copyChildSchema(0);
+    for (auto& info : infos) {
+        auto groupPos = 0u;
+        if (schema->isExpressionInScope(*info.key)) {
+            groupPos = schema->getGroupPos(*info.key);
+        }
+        schema->insertToGroupAndScope(info.offset, groupPos);
+    }
+}
+
+void LogicalPrimaryKeyLookup::computeFlatSchema() {
+    copyChildSchema(0);
+    for (auto& info : infos) {
+        schema->insertToGroupAndScope(info.offset, 0);
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/logical_scan_node_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/logical_scan_node_table.cpp
new file mode 100644
index 0000000000..177ecd647e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/scan/logical_scan_node_table.cpp
@@ -0,0 +1,47 @@
+#include "planner/operator/scan/logical_scan_node_table.h"
+
+namespace lbug {
+namespace planner {
+
+LogicalScanNodeTable::LogicalScanNodeTable(const LogicalScanNodeTable& other)
+    : LogicalOperator{type_}, scanType{other.scanType}, nodeID{other.nodeID},
+      nodeTableIDs{other.nodeTableIDs}, properties{other.properties},
+      propertyPredicates{copyVector(other.propertyPredicates)} {
+    if (other.extraInfo != nullptr) {
+        setExtraInfo(other.extraInfo->copy());
+    }
+    this->cardinality = other.cardinality;
+}
+
+void LogicalScanNodeTable::computeFactorizedSchema() {
+    createEmptySchema();
+    const auto groupPos = schema->createGroup();
+    KU_ASSERT(groupPos == 0);
+    schema->insertToGroupAndScope(nodeID, groupPos);
+    for (auto& property : properties) {
+        schema->insertToGroupAndScope(property, groupPos);
+    }
+    switch (scanType) {
+    case LogicalScanNodeTableType::PRIMARY_KEY_SCAN: {
+        schema->setGroupAsSingleState(groupPos);
+    } break;
+    default:
+        break;
+    }
+}
+
+void LogicalScanNodeTable::computeFlatSchema() {
+    createEmptySchema();
+    schema->createGroup();
+    schema->insertToGroupAndScope(nodeID, 0);
+    for (auto& property : properties) {
+        schema->insertToGroupAndScope(property, 0);
+    }
+}
+
+std::unique_ptr<LogicalOperator> LogicalScanNodeTable::copy() {
+    return std::make_unique<LogicalScanNodeTable>(*this);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/schema.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/schema.cpp
new file mode 100644
index 0000000000..b1123e9526
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/schema.cpp
@@ -0,0 +1,163 @@
+#include "planner/operator/schema.h"
+
+#include "binder/expression_visitor.h"
+#include "common/exception/internal.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+f_group_pos Schema::createGroup() {
+    auto pos = groups.size();
+    groups.push_back(std::make_unique<FactorizationGroup>());
+    return pos;
+}
+
+void Schema::insertToScope(const std::shared_ptr<Expression>& expression, f_group_pos groupPos) {
+    KU_ASSERT(!expressionNameToGroupPos.contains(expression->getUniqueName()));
+    expressionNameToGroupPos.insert({expression->getUniqueName(), groupPos});
+    KU_ASSERT(getGroup(groupPos)->expressionNameToPos.contains(expression->getUniqueName()));
+    expressionsInScope.push_back(expression);
+}
+
+void Schema::insertToGroupAndScope(const std::shared_ptr<Expression>& expression,
+    f_group_pos groupPos) {
+    KU_ASSERT(!expressionNameToGroupPos.contains(expression->getUniqueName()));
+    expressionNameToGroupPos.insert({expression->getUniqueName(), groupPos});
+    groups[groupPos]->insertExpression(expression);
+    expressionsInScope.push_back(expression);
+}
+
+void Schema::insertToScopeMayRepeat(const std::shared_ptr<Expression>& expression,
+    uint32_t groupPos) {
+    if (expressionNameToGroupPos.contains(expression->getUniqueName())) {
+        return;
+    }
+    insertToScope(expression, groupPos);
+}
+
+void Schema::insertToGroupAndScopeMayRepeat(const std::shared_ptr<Expression>& expression,
+    uint32_t groupPos) {
+    if (expressionNameToGroupPos.contains(expression->getUniqueName())) {
+        return;
+    }
+    insertToGroupAndScope(expression, groupPos);
+}
+
+void Schema::insertToGroupAndScope(const expression_vector& expressions, f_group_pos groupPos) {
+    for (auto& expression : expressions) {
+        insertToGroupAndScope(expression, groupPos);
+    }
+}
+
+f_group_pos Schema::getGroupPos(const std::string& expressionName) const {
+    KU_ASSERT(expressionNameToGroupPos.contains(expressionName));
+    return expressionNameToGroupPos.at(expressionName);
+}
+
+bool Schema::isExpressionInScope(const Expression& expression) const {
+    for (auto& expressionInScope : expressionsInScope) {
+        if (expressionInScope->getUniqueName() == expression.getUniqueName()) {
+            return true;
+        }
+    }
+    return false;
+}
+
+expression_vector Schema::getExpressionsInScope(f_group_pos pos) const {
+    expression_vector result;
+    for (auto& expression : expressionsInScope) {
+        if (getGroupPos(expression->getUniqueName()) == pos) {
+            result.push_back(expression);
+        }
+    }
+    return result;
+}
+
+bool Schema::evaluable(const Expression& expression) const {
+    auto inScope = isExpressionInScope(expression);
+    if (expression.expressionType == ExpressionType::LITERAL || inScope) {
+        return true;
+    }
+    auto children = ExpressionChildrenCollector::collectChildren(expression);
+    if (children.empty()) {
+        return inScope;
+    } else {
+        for (auto& child : children) {
+            if (!evaluable(*child)) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+
+std::unordered_set<f_group_pos> Schema::getGroupsPosInScope() const {
+    std::unordered_set<f_group_pos> result;
+    for (auto& expressionInScope : expressionsInScope) {
+        result.insert(getGroupPos(expressionInScope->getUniqueName()));
+    }
+    return result;
+}
+
+std::unique_ptr<Schema> Schema::copy() const {
+    auto newSchema = std::make_unique<Schema>();
+    newSchema->expressionNameToGroupPos = expressionNameToGroupPos;
+    for (auto& group : groups) {
+        newSchema->groups.push_back(std::make_unique<FactorizationGroup>(*group));
+    }
+    newSchema->expressionsInScope = expressionsInScope;
+    return newSchema;
+}
+
+void Schema::clear() {
+    groups.clear();
+    clearExpressionsInScope();
+}
+
+size_t Schema::getNumGroups(bool isFlat) const {
+    auto result = 0u;
+    for (auto groupPos : getGroupsPosInScope()) {
+        result += groups[groupPos]->isFlat() == isFlat;
+    }
+    return result;
+}
+
+f_group_pos SchemaUtils::getLeadingGroupPos(const std::unordered_set<f_group_pos>& groupPositions,
+    const Schema& schema) {
+    auto leadingGroupPos = INVALID_F_GROUP_POS;
+    for (auto groupPos : groupPositions) {
+        if (!schema.getGroup(groupPos)->isFlat()) {
+            return groupPos;
+        }
+        leadingGroupPos = groupPos;
+    }
+    return leadingGroupPos;
+}
+
+void SchemaUtils::validateAtMostOneUnFlatGroup(
+    const std::unordered_set<f_group_pos>& groupPositions, const Schema& schema) {
+    auto hasUnFlatGroup = false;
+    for (auto groupPos : groupPositions) {
+        if (!schema.getGroup(groupPos)->isFlat()) {
+            if (hasUnFlatGroup) {
+                throw InternalException("Unexpected multiple unFlat factorization groups found.");
+            }
+            hasUnFlatGroup = true;
+        }
+    }
+}
+
+void SchemaUtils::validateNoUnFlatGroup(const std::unordered_set<f_group_pos>& groupPositions,
+    const Schema& schema) {
+    for (auto groupPos : groupPositions) {
+        if (!schema.getGroup(groupPos)->isFlat()) {
+            throw InternalException("Unexpected unFlat factorization group found.");
+        }
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/simple/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/simple/CMakeLists.txt
new file mode 100644
index 0000000000..f0a3a9edcf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/simple/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_planner_simple
+        OBJECT
+        logical_simple.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner_simple>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/simple/logical_simple.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/simple/logical_simple.cpp
new file mode 100644
index 0000000000..ed6d16417c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/simple/logical_simple.cpp
@@ -0,0 +1,15 @@
+#include "planner/operator/simple/logical_simple.h"
+
+namespace lbug {
+namespace planner {
+
+void LogicalSimple::computeFlatSchema() {
+    createEmptySchema();
+}
+
+void LogicalSimple::computeFactorizedSchema() {
+    createEmptySchema();
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/sip/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/sip/CMakeLists.txt
new file mode 100644
index 0000000000..450b9fc170
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/sip/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_planner_sip
+        OBJECT
+        logical_semi_masker.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner_sip>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/sip/logical_semi_masker.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/sip/logical_semi_masker.cpp
new file mode 100644
index 0000000000..24327c7799
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/operator/sip/logical_semi_masker.cpp
@@ -0,0 +1,7 @@
+#include "planner/operator/sip/logical_semi_masker.h"
+
+namespace lbug {
+namespace planner {
+LogicalSemiMasker::~LogicalSemiMasker() = default;
+}
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/CMakeLists.txt
new file mode 100644
index 0000000000..2282652c0d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/CMakeLists.txt
@@ -0,0 +1,38 @@
+add_library(lbug_planner_plan_operator
+        OBJECT
+        append_accumulate.cpp
+        append_aggregate.cpp
+        append_insert.cpp
+        append_cross_product.cpp
+        append_delete.cpp
+        append_distinct.cpp
+        append_dummy_scan.cpp
+        append_empty_result.cpp
+        append_expressions_scan.cpp
+        append_extend.cpp
+        append_filter.cpp
+        append_flatten.cpp
+        append_table_function_call.cpp
+        append_join.cpp
+        append_limit.cpp
+        append_multiplicity_reducer.cpp
+        append_order_by.cpp
+        append_projection.cpp
+        append_scan_node_table.cpp
+        append_set.cpp
+        append_simple.cpp
+        append_unwind.cpp
+        plan_copy.cpp
+        plan_join_order.cpp
+        plan_node_scan.cpp
+        plan_node_semi_mask.cpp
+        plan_projection.cpp
+        plan_read.cpp
+        plan_single_query.cpp
+        plan_subquery.cpp
+        plan_update.cpp
+        plan_port_db.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_planner_plan_operator>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_accumulate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_accumulate.cpp
new file mode 100644
index 0000000000..b0cb4bb3d3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_accumulate.cpp
@@ -0,0 +1,40 @@
+#include "planner/operator/logical_accumulate.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void Planner::tryAppendAccumulate(LogicalPlan& plan) {
+    if (plan.getLastOperator()->getOperatorType() == LogicalOperatorType::ACCUMULATE) {
+        return;
+    }
+    appendAccumulate(plan);
+}
+
+void Planner::appendAccumulate(LogicalPlan& plan) {
+    appendAccumulate(AccumulateType::REGULAR, expression_vector{}, nullptr /* mark */, plan);
+}
+
+void Planner::appendOptionalAccumulate(std::shared_ptr<Expression> mark, LogicalPlan& plan) {
+    appendAccumulate(AccumulateType::OPTIONAL_, expression_vector{}, mark, plan);
+}
+
+void Planner::appendAccumulate(const expression_vector& flatExprs, LogicalPlan& plan) {
+    appendAccumulate(AccumulateType::REGULAR, flatExprs, nullptr /* mark */, plan);
+}
+
+void Planner::appendAccumulate(AccumulateType accumulateType, const expression_vector& flatExprs,
+    std::shared_ptr<Expression> mark, LogicalPlan& plan) {
+    auto op =
+        make_shared<LogicalAccumulate>(accumulateType, flatExprs, mark, plan.getLastOperator());
+    appendFlattens(op->getGroupPositionsToFlatten(), plan);
+    op->setChild(0, plan.getLastOperator());
+    op->computeFactorizedSchema();
+    plan.setLastOperator(std::move(op));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_aggregate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_aggregate.cpp
new file mode 100644
index 0000000000..373f9c11fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_aggregate.cpp
@@ -0,0 +1,21 @@
+#include "planner/operator/logical_aggregate.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendAggregate(const expression_vector& expressionsToGroupBy,
+    const expression_vector& expressionsToAggregate, LogicalPlan& plan) {
+    auto aggregate = make_shared<LogicalAggregate>(expressionsToGroupBy, expressionsToAggregate,
+        plan.getLastOperator());
+    appendFlattens(aggregate->getGroupsPosToFlatten(), plan);
+    aggregate->setChild(0, plan.getLastOperator());
+    aggregate->computeFactorizedSchema();
+    aggregate->setCardinality(cardinalityEstimator.estimateAggregate(*aggregate));
+    plan.setLastOperator(std::move(aggregate));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_cross_product.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_cross_product.cpp
new file mode 100644
index 0000000000..150176237f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_cross_product.cpp
@@ -0,0 +1,43 @@
+#include "planner/operator/logical_cross_product.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendCrossProduct(const LogicalPlan& probePlan, const LogicalPlan& buildPlan,
+    LogicalPlan& resultPlan) {
+    appendCrossProduct(AccumulateType::REGULAR, nullptr /* mark */, probePlan, buildPlan,
+        resultPlan);
+}
+
+void Planner::appendOptionalCrossProduct(std::shared_ptr<Expression> mark,
+    const LogicalPlan& probePlan, const LogicalPlan& buildPlan, LogicalPlan& resultPlan) {
+    appendCrossProduct(AccumulateType::OPTIONAL_, mark, probePlan, buildPlan, resultPlan);
+}
+
+void Planner::appendAccOptionalCrossProduct(std::shared_ptr<Expression> mark,
+    LogicalPlan& probePlan, const LogicalPlan& buildPlan, LogicalPlan& resultPlan) {
+    KU_ASSERT(probePlan.hasUpdate());
+    tryAppendAccumulate(probePlan);
+    appendCrossProduct(AccumulateType::OPTIONAL_, mark, probePlan, buildPlan, resultPlan);
+    auto& sipInfo = resultPlan.getLastOperator()->cast<LogicalCrossProduct>().getSIPInfoUnsafe();
+    sipInfo.direction = SIPDirection::PROBE_TO_BUILD;
+}
+
+void Planner::appendCrossProduct(AccumulateType accumulateType, std::shared_ptr<Expression> mark,
+    const LogicalPlan& probePlan, const LogicalPlan& buildPlan, LogicalPlan& resultPlan) {
+    auto crossProduct = make_shared<LogicalCrossProduct>(accumulateType, mark,
+        probePlan.getLastOperator(), buildPlan.getLastOperator(),
+        cardinalityEstimator.estimateCrossProduct(probePlan.getLastOperatorRef(),
+            buildPlan.getLastOperatorRef()));
+    crossProduct->computeFactorizedSchema();
+    // update cost
+    resultPlan.setCost(probePlan.getCardinality() + buildPlan.getCardinality());
+    resultPlan.setLastOperator(std::move(crossProduct));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_delete.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_delete.cpp
new file mode 100644
index 0000000000..71fa26ba56
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_delete.cpp
@@ -0,0 +1,19 @@
+#include "binder/query/updating_clause/bound_delete_info.h"
+#include "planner/operator/persistent/logical_delete.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendDelete(const std::vector<BoundDeleteInfo>& infos, LogicalPlan& plan) {
+    auto delete_ = std::make_shared<LogicalDelete>(copyVector(infos), plan.getLastOperator());
+    appendFlattens(delete_->getGroupsPosToFlatten(), plan);
+    delete_->setChild(0, plan.getLastOperator());
+    delete_->computeFactorizedSchema();
+    plan.setLastOperator(std::move(delete_));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_distinct.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_distinct.cpp
new file mode 100644
index 0000000000..e75af6490c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_distinct.cpp
@@ -0,0 +1,19 @@
+#include "planner/operator/logical_distinct.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendDistinct(const expression_vector& keys, LogicalPlan& plan) {
+    KU_ASSERT(!keys.empty());
+    auto distinct = make_shared<LogicalDistinct>(keys, plan.getLastOperator());
+    appendFlattens(distinct->getGroupsPosToFlatten(), plan);
+    distinct->setChild(0, plan.getLastOperator());
+    distinct->computeFactorizedSchema();
+    plan.setLastOperator(std::move(distinct));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_dummy_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_dummy_scan.cpp
new file mode 100644
index 0000000000..ada53fb57a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_dummy_scan.cpp
@@ -0,0 +1,15 @@
+#include "planner/operator/scan/logical_dummy_scan.h"
+#include "planner/planner.h"
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendDummyScan(LogicalPlan& plan) {
+    KU_ASSERT(plan.isEmpty());
+    auto dummyScan = std::make_shared<LogicalDummyScan>();
+    dummyScan->computeFactorizedSchema();
+    plan.setLastOperator(std::move(dummyScan));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_empty_result.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_empty_result.cpp
new file mode 100644
index 0000000000..a8266ecdfa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_empty_result.cpp
@@ -0,0 +1,14 @@
+#include "planner/operator/logical_empty_result.h"
+#include "planner/planner.h"
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendEmptyResult(LogicalPlan& plan) {
+    auto op = std::make_shared<LogicalEmptyResult>(*plan.getSchema());
+    op->computeFactorizedSchema();
+    plan.setLastOperator(std::move(op));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_expressions_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_expressions_scan.cpp
new file mode 100644
index 0000000000..7ae5536f22
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_expressions_scan.cpp
@@ -0,0 +1,16 @@
+#include "planner/operator/scan/logical_expressions_scan.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendExpressionsScan(const expression_vector& expressions, LogicalPlan& plan) {
+    auto expressionsScan = std::make_shared<LogicalExpressionsScan>(expressions);
+    expressionsScan->computeFactorizedSchema();
+    plan.setLastOperator(expressionsScan);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_extend.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_extend.cpp
new file mode 100644
index 0000000000..e915043deb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_extend.cpp
@@ -0,0 +1,191 @@
+#include <utility>
+
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/enums/join_type.h"
+#include "planner/join_order/cost_model.h"
+#include "planner/operator/extend/logical_extend.h"
+#include "planner/operator/extend/logical_recursive_extend.h"
+#include "planner/operator/extend/recursive_join_type.h"
+#include "planner/operator/logical_node_label_filter.h"
+#include "planner/operator/logical_path_property_probe.h"
+#include "planner/planner.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+using namespace lbug::catalog;
+using namespace lbug::transaction;
+using namespace lbug::function;
+
+namespace lbug {
+namespace planner {
+
+static std::unordered_set<table_id_t> getBoundNodeTableIDSet(const RelExpression& rel,
+    ExtendDirection extendDirection) {
+    std::unordered_set<table_id_t> result;
+    for (auto entry : rel.getEntries()) {
+        auto& groupEntry = entry->constCast<RelGroupCatalogEntry>();
+        switch (extendDirection) {
+        case ExtendDirection::FWD: {
+            result.merge(groupEntry.getBoundNodeTableIDSet(RelDataDirection::FWD));
+        } break;
+        case ExtendDirection::BWD: {
+            result.merge(groupEntry.getBoundNodeTableIDSet(RelDataDirection::BWD));
+        } break;
+        case ExtendDirection::BOTH: {
+            result.merge(groupEntry.getBoundNodeTableIDSet(RelDataDirection::FWD));
+            result.merge(groupEntry.getBoundNodeTableIDSet(RelDataDirection::BWD));
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    return result;
+}
+
+static std::unordered_set<table_id_t> getNbrNodeTableIDSet(const RelExpression& rel,
+    ExtendDirection extendDirection) {
+    std::unordered_set<table_id_t> result;
+    for (auto entry : rel.getEntries()) {
+        auto& groupEntry = entry->constCast<RelGroupCatalogEntry>();
+        switch (extendDirection) {
+        case ExtendDirection::FWD: {
+            result.merge(groupEntry.getNbrNodeTableIDSet(RelDataDirection::FWD));
+        } break;
+        case ExtendDirection::BWD: {
+            result.merge(groupEntry.getNbrNodeTableIDSet(RelDataDirection::BWD));
+        } break;
+        case ExtendDirection::BOTH: {
+            result.merge(groupEntry.getNbrNodeTableIDSet(RelDataDirection::FWD));
+            result.merge(groupEntry.getNbrNodeTableIDSet(RelDataDirection::BWD));
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    return result;
+}
+
+void Planner::appendNonRecursiveExtend(const std::shared_ptr<NodeExpression>& boundNode,
+    const std::shared_ptr<NodeExpression>& nbrNode, const std::shared_ptr<RelExpression>& rel,
+    ExtendDirection direction, bool extendFromSource, const expression_vector& properties,
+    LogicalPlan& plan) {
+    // Filter bound node label if we know some incoming nodes won't have any outgoing rel. This
+    // cannot be done at binding time because the pruning is affected by extend direction.
+    auto boundNodeTableIDSet = getBoundNodeTableIDSet(*rel, direction);
+    if (boundNode->getNumEntries() > boundNodeTableIDSet.size()) {
+        appendNodeLabelFilter(boundNode->getInternalID(), boundNodeTableIDSet, plan);
+    }
+    auto properties_ = properties;
+    // Append extend
+    auto extend = make_shared<LogicalExtend>(boundNode, nbrNode, rel, direction, extendFromSource,
+        properties_, plan.getLastOperator());
+    extend->computeFactorizedSchema();
+    // Update cost & cardinality. Note that extend does not change factorized cardinality.
+    auto transaction = Transaction::Get(*clientContext);
+    const auto extensionRate = cardinalityEstimator.getExtensionRate(*rel, *boundNode, transaction);
+    extend->setCardinality(plan.getLastOperator()->getCardinality());
+    plan.setCost(CostModel::computeExtendCost(plan));
+    auto group = extend->getSchema()->getGroup(nbrNode->getInternalID());
+    group->setMultiplier(extensionRate);
+    plan.setLastOperator(std::move(extend));
+    auto nbrNodeTableIDSet = getNbrNodeTableIDSet(*rel, direction);
+    if (nbrNodeTableIDSet.size() > nbrNode->getNumEntries()) {
+        appendNodeLabelFilter(nbrNode->getInternalID(), nbrNode->getTableIDsSet(), plan);
+    }
+}
+
+void Planner::appendRecursiveExtend(const std::shared_ptr<NodeExpression>& boundNode,
+    const std::shared_ptr<NodeExpression>& nbrNode, const std::shared_ptr<RelExpression>& rel,
+    ExtendDirection direction, LogicalPlan& plan) {
+    // GDS pipeline
+    auto recursiveInfo = rel->getRecursiveInfo();
+    // Fill bind data with direction information. This can only be decided at planning time.
+    auto bindData = recursiveInfo->bindData.get();
+    bindData->nodeOutput = nbrNode;
+    bindData->nodeInput = boundNode;
+    bindData->extendDirection = direction;
+    // If we extend from right to left, we need to print path in reverse direction.
+    bindData->flipPath = *boundNode == *rel->getRightNode();
+    auto resultColumns = recursiveInfo->function->getResultColumns(*bindData);
+    auto recursiveExtend = std::make_shared<LogicalRecursiveExtend>(recursiveInfo->function->copy(),
+        *recursiveInfo->bindData, resultColumns);
+    if (recursiveInfo->nodePredicate != nullptr) {
+        auto p = getNodeSemiMaskPlan(SemiMaskTargetType::RECURSIVE_EXTEND_PATH_NODE,
+            *recursiveInfo->node, recursiveInfo->nodePredicate);
+        recursiveExtend->addChild(p.getLastOperator());
+    }
+    recursiveExtend->computeFactorizedSchema();
+    auto probePlan = LogicalPlan();
+    probePlan.setLastOperator(std::move(recursiveExtend));
+    // Scan path node property pipeline
+    std::shared_ptr<LogicalOperator> pathNodePropertyScanRoot = nullptr;
+    if (!recursiveInfo->nodeProjectionList.empty()) {
+        auto pathNodePropertyScanPlan = LogicalPlan();
+        createPathNodePropertyScanPlan(recursiveInfo->node, recursiveInfo->nodeProjectionList,
+            pathNodePropertyScanPlan);
+        pathNodePropertyScanRoot = pathNodePropertyScanPlan.getLastOperator();
+    }
+    // Scan path rel property pipeline
+    std::shared_ptr<LogicalOperator> pathRelPropertyScanRoot = nullptr;
+    if (!recursiveInfo->relProjectionList.empty()) {
+        auto pathRelPropertyScanPlan = LogicalPlan();
+        auto relProperties = recursiveInfo->relProjectionList;
+        relProperties.push_back(recursiveInfo->rel->getInternalID());
+        bool extendFromSource = *boundNode == *rel->getSrcNode();
+        createPathRelPropertyScanPlan(recursiveInfo->node, recursiveInfo->nodeCopy,
+            recursiveInfo->rel, direction, extendFromSource, relProperties,
+            pathRelPropertyScanPlan);
+        pathRelPropertyScanRoot = pathRelPropertyScanPlan.getLastOperator();
+    }
+    // Construct path by probing scanned properties
+    auto pathPropertyProbe =
+        std::make_shared<LogicalPathPropertyProbe>(rel, probePlan.getLastOperator(),
+            pathNodePropertyScanRoot, pathRelPropertyScanRoot, RecursiveJoinType::TRACK_PATH);
+    pathPropertyProbe->direction = direction;
+    pathPropertyProbe->extendFromLeft = *boundNode == *rel->getLeftNode();
+    pathPropertyProbe->pathNodeIDs = recursiveInfo->bindData->pathNodeIDsExpr;
+    pathPropertyProbe->pathEdgeIDs = recursiveInfo->bindData->pathEdgeIDsExpr;
+    pathPropertyProbe->computeFactorizedSchema();
+    auto transaction = Transaction::Get(*clientContext);
+    auto extensionRate = cardinalityEstimator.getExtensionRate(*rel, *boundNode, transaction);
+    auto resultCard =
+        cardinalityEstimator.multiply(extensionRate, plan.getLastOperator()->getCardinality());
+    pathPropertyProbe->setCardinality(resultCard);
+    probePlan.setLastOperator(pathPropertyProbe);
+    probePlan.setCost(plan.getCardinality());
+
+    // Join with input node
+    auto joinConditions = expression_vector{boundNode->getInternalID()};
+    appendHashJoin(joinConditions, JoinType::INNER, probePlan, plan, plan);
+    // Hash join above is joining input node with its properties. So 1-1 match is guaranteed and
+    // thus should not change cardinality.
+    plan.getLastOperator()->setCardinality(resultCard);
+}
+
+void Planner::createPathNodePropertyScanPlan(const std::shared_ptr<NodeExpression>& node,
+    const expression_vector& properties, LogicalPlan& plan) {
+    appendScanNodeTable(node->getInternalID(), node->getTableIDs(), properties, plan);
+}
+
+void Planner::createPathRelPropertyScanPlan(const std::shared_ptr<NodeExpression>& boundNode,
+    const std::shared_ptr<NodeExpression>& nbrNode, const std::shared_ptr<RelExpression>& rel,
+    ExtendDirection direction, bool extendFromSource, const expression_vector& properties,
+    LogicalPlan& plan) {
+    appendScanNodeTable(boundNode->getInternalID(), boundNode->getTableIDs(), {}, plan);
+    appendNonRecursiveExtend(boundNode, nbrNode, rel, direction, extendFromSource, properties,
+        plan);
+    appendProjection(properties, plan);
+}
+
+void Planner::appendNodeLabelFilter(std::shared_ptr<Expression> nodeID,
+    std::unordered_set<table_id_t> tableIDSet, LogicalPlan& plan) {
+    auto filter = std::make_shared<LogicalNodeLabelFilter>(std::move(nodeID), std::move(tableIDSet),
+        plan.getLastOperator());
+    filter->computeFactorizedSchema();
+    plan.setLastOperator(std::move(filter));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_filter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_filter.cpp
new file mode 100644
index 0000000000..0d9d7de4ed
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_filter.cpp
@@ -0,0 +1,28 @@
+#include "planner/operator/logical_filter.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendFilters(const expression_vector& predicates, LogicalPlan& plan) {
+    for (auto& predicate : predicates) {
+        appendFilter(predicate, plan);
+    }
+}
+
+void Planner::appendFilter(const std::shared_ptr<Expression>& predicate, LogicalPlan& plan) {
+    planSubqueryIfNecessary(predicate, plan);
+    auto filter = make_shared<LogicalFilter>(predicate, plan.getLastOperator());
+    appendFlattens(filter->getGroupsPosToFlatten(), plan);
+    filter->setChild(0, plan.getLastOperator());
+    filter->computeFactorizedSchema();
+    // estimate cardinality
+    filter->setCardinality(
+        cardinalityEstimator.estimateFilter(plan.getLastOperatorRef(), *predicate));
+    plan.setLastOperator(std::move(filter));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_flatten.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_flatten.cpp
new file mode 100644
index 0000000000..7b1ea2ab3b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_flatten.cpp
@@ -0,0 +1,25 @@
+#include "planner/operator/logical_flatten.h"
+#include "planner/planner.h"
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendFlattens(const f_group_pos_set& groupsPos, LogicalPlan& plan) {
+    for (auto groupPos : groupsPos) {
+        appendFlattenIfNecessary(groupPos, plan);
+    }
+}
+
+void Planner::appendFlattenIfNecessary(f_group_pos groupPos, LogicalPlan& plan) {
+    auto group = plan.getSchema()->getGroup(groupPos);
+    if (group->isFlat()) {
+        return;
+    }
+    auto flatten = make_shared<LogicalFlatten>(groupPos, plan.getLastOperator(),
+        cardinalityEstimator.estimateFlatten(plan.getLastOperatorRef(), groupPos));
+    flatten->computeFactorizedSchema();
+    plan.setLastOperator(std::move(flatten));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_insert.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_insert.cpp
new file mode 100644
index 0000000000..9fe3a027d5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_insert.cpp
@@ -0,0 +1,55 @@
+#include "binder/query/updating_clause/bound_insert_info.h"
+#include "planner/operator/persistent/logical_insert.h"
+#include "planner/planner.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+std::unique_ptr<LogicalInsertInfo> Planner::createLogicalInsertInfo(
+    const BoundInsertInfo* info) const {
+    auto insertInfo = std::make_unique<LogicalInsertInfo>(info->tableType, info->pattern,
+        info->columnExprs, info->columnDataExprs, info->conflictAction);
+    binder::expression_set propertyExprSet;
+    for (auto& expr : getProperties(*info->pattern)) {
+        propertyExprSet.insert(expr);
+    }
+    for (auto& expr : insertInfo->columnExprs) {
+        insertInfo->isReturnColumnExprs.push_back(propertyExprSet.contains(expr));
+    }
+    return insertInfo;
+}
+
+void Planner::appendInsertNode(const std::vector<const binder::BoundInsertInfo*>& boundInsertInfos,
+    LogicalPlan& plan) {
+    std::vector<LogicalInsertInfo> logicalInfos;
+    logicalInfos.reserve(boundInsertInfos.size());
+    for (auto& boundInfo : boundInsertInfos) {
+        logicalInfos.push_back(createLogicalInsertInfo(boundInfo)->copy());
+    }
+    auto insertNode =
+        std::make_shared<LogicalInsert>(std::move(logicalInfos), plan.getLastOperator());
+    appendFlattens(insertNode->getGroupsPosToFlatten(), plan);
+    insertNode->setChild(0, plan.getLastOperator());
+    insertNode->computeFactorizedSchema();
+    plan.setLastOperator(insertNode);
+}
+
+void Planner::appendInsertRel(const std::vector<const binder::BoundInsertInfo*>& boundInsertInfos,
+    LogicalPlan& plan) {
+    std::vector<LogicalInsertInfo> logicalInfos;
+    logicalInfos.reserve(boundInsertInfos.size());
+    for (auto& boundInfo : boundInsertInfos) {
+        logicalInfos.push_back(createLogicalInsertInfo(boundInfo)->copy());
+    }
+    auto insertRel =
+        std::make_shared<LogicalInsert>(std::move(logicalInfos), plan.getLastOperator());
+    appendFlattens(insertRel->getGroupsPosToFlatten(), plan);
+    insertRel->setChild(0, plan.getLastOperator());
+    insertRel->computeFactorizedSchema();
+    plan.setLastOperator(insertRel);
+}
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_join.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_join.cpp
new file mode 100644
index 0000000000..9c514756e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_join.cpp
@@ -0,0 +1,123 @@
+#include "planner/join_order/cost_model.h"
+#include "planner/operator/logical_hash_join.h"
+#include "planner/operator/logical_intersect.h"
+#include "planner/planner.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendHashJoin(const expression_vector& joinNodeIDs, JoinType joinType,
+    LogicalPlan& probePlan, LogicalPlan& buildPlan, LogicalPlan& resultPlan) {
+    appendHashJoin(joinNodeIDs, joinType, nullptr /* mark */, probePlan, buildPlan, resultPlan);
+}
+
+void Planner::appendHashJoin(const expression_vector& joinNodeIDs, JoinType joinType,
+    std::shared_ptr<Expression> mark, LogicalPlan& probePlan, LogicalPlan& buildPlan,
+    LogicalPlan& resultPlan) {
+    std::vector<join_condition_t> joinConditions;
+    for (auto& joinNodeID : joinNodeIDs) {
+        joinConditions.emplace_back(joinNodeID, joinNodeID);
+    }
+    appendHashJoin(joinConditions, joinType, mark, probePlan, buildPlan, resultPlan);
+}
+
+void Planner::appendHashJoin(const std::vector<expression_pair>& joinConditions, JoinType joinType,
+    std::shared_ptr<Expression> mark, LogicalPlan& probePlan, LogicalPlan& buildPlan,
+    LogicalPlan& resultPlan) {
+    auto hashJoin = make_shared<LogicalHashJoin>(joinConditions, joinType, mark,
+        probePlan.getLastOperator(), buildPlan.getLastOperator());
+    // Apply flattening to probe side
+    auto groupsPosToFlattenOnProbeSide = hashJoin->getGroupsPosToFlattenOnProbeSide();
+    appendFlattens(groupsPosToFlattenOnProbeSide, probePlan);
+    hashJoin->setChild(0, probePlan.getLastOperator());
+    // Apply flattening to build side
+    appendFlattens(hashJoin->getGroupsPosToFlattenOnBuildSide(), buildPlan);
+    hashJoin->setChild(1, buildPlan.getLastOperator());
+    hashJoin->computeFactorizedSchema();
+    // Check for sip
+    if (probePlan.getCardinality() > buildPlan.getCardinality() * PlannerKnobs::SIP_RATIO) {
+        hashJoin->getSIPInfoUnsafe().position = SemiMaskPosition::PROHIBIT_PROBE_TO_BUILD;
+    }
+    // Update cost
+    hashJoin->setCardinality(cardinalityEstimator.estimateHashJoin(joinConditions,
+        probePlan.getLastOperatorRef(), buildPlan.getLastOperatorRef()));
+    resultPlan.setCost(CostModel::computeHashJoinCost(joinConditions, probePlan, buildPlan));
+    resultPlan.setLastOperator(std::move(hashJoin));
+}
+
+void Planner::appendAccHashJoin(const std::vector<binder::expression_pair>& joinConditions,
+    JoinType joinType, std::shared_ptr<Expression> mark, LogicalPlan& probePlan,
+    LogicalPlan& buildPlan, LogicalPlan& resultPlan) {
+    KU_ASSERT(probePlan.hasUpdate());
+    tryAppendAccumulate(probePlan);
+    appendHashJoin(joinConditions, joinType, mark, probePlan, buildPlan, resultPlan);
+    auto& sipInfo = probePlan.getLastOperator()->cast<LogicalHashJoin>().getSIPInfoUnsafe();
+    sipInfo.direction = SIPDirection::PROBE_TO_BUILD;
+}
+
+void Planner::appendMarkJoin(const expression_vector& joinNodeIDs,
+    const std::shared_ptr<Expression>& mark, LogicalPlan& probePlan, LogicalPlan& buildPlan,
+    LogicalPlan& resultPlan) {
+    std::vector<join_condition_t> joinConditions;
+    for (auto& joinNodeID : joinNodeIDs) {
+        joinConditions.emplace_back(joinNodeID, joinNodeID);
+    }
+    appendMarkJoin(joinConditions, mark, probePlan, buildPlan, resultPlan);
+}
+
+void Planner::appendMarkJoin(const std::vector<expression_pair>& joinConditions,
+    const std::shared_ptr<Expression>& mark, LogicalPlan& probePlan, LogicalPlan& buildPlan,
+    LogicalPlan& resultPlan) {
+    auto hashJoin = make_shared<LogicalHashJoin>(joinConditions, JoinType::MARK, mark,
+        probePlan.getLastOperator(), buildPlan.getLastOperator());
+    // Apply flattening to probe side
+    appendFlattens(hashJoin->getGroupsPosToFlattenOnProbeSide(), probePlan);
+    hashJoin->setChild(0, probePlan.getLastOperator());
+    // Apply flattening to build side
+    appendFlattens(hashJoin->getGroupsPosToFlattenOnBuildSide(), buildPlan);
+    hashJoin->setChild(1, buildPlan.getLastOperator());
+    hashJoin->computeFactorizedSchema();
+    // update cost. Mark join does not change cardinality.
+    hashJoin->setCardinality(probePlan.getCardinality());
+    resultPlan.setCost(CostModel::computeMarkJoinCost(joinConditions, probePlan, buildPlan));
+    resultPlan.setLastOperator(std::move(hashJoin));
+}
+
+void Planner::appendIntersect(const std::shared_ptr<Expression>& intersectNodeID,
+    expression_vector& boundNodeIDs, LogicalPlan& probePlan, std::vector<LogicalPlan>& buildPlans) {
+    KU_ASSERT(boundNodeIDs.size() == buildPlans.size());
+    std::vector<std::shared_ptr<LogicalOperator>> buildChildren;
+    expression_vector keyNodeIDs;
+    for (auto i = 0u; i < buildPlans.size(); ++i) {
+        keyNodeIDs.push_back(boundNodeIDs[i]);
+        buildChildren.push_back(buildPlans[i].getLastOperator());
+    }
+    auto intersect = make_shared<LogicalIntersect>(intersectNodeID, std::move(keyNodeIDs),
+        probePlan.getLastOperator(), std::move(buildChildren));
+    appendFlattens(intersect->getGroupsPosToFlattenOnProbeSide(), probePlan);
+    intersect->setChild(0, probePlan.getLastOperator());
+    for (auto i = 0u; i < buildPlans.size(); ++i) {
+        appendFlattens(intersect->getGroupsPosToFlattenOnBuildSide(i), buildPlans[i]);
+        intersect->setChild(i + 1, buildPlans[i].getLastOperator());
+        auto ratio = probePlan.getCardinality() / buildPlans[i].getCardinality();
+        if (ratio > PlannerKnobs::SIP_RATIO) {
+            intersect->getSIPInfoUnsafe().position = SemiMaskPosition::PROHIBIT;
+        }
+    }
+    intersect->computeFactorizedSchema();
+    // update cost
+    std::vector<LogicalOperator*> buildOps;
+    for (const auto& plan : buildPlans) {
+        buildOps.push_back(plan.getLastOperator().get());
+    }
+    intersect->setCardinality(cardinalityEstimator.estimateIntersect(boundNodeIDs,
+        probePlan.getLastOperatorRef(), buildOps));
+    probePlan.setCost(CostModel::computeIntersectCost(probePlan, buildPlans));
+    probePlan.setLastOperator(std::move(intersect));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_limit.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_limit.cpp
new file mode 100644
index 0000000000..79bd52b0b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_limit.cpp
@@ -0,0 +1,17 @@
+#include "planner/operator/logical_limit.h"
+#include "planner/planner.h"
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendLimit(std::shared_ptr<binder::Expression> skipNum,
+    std::shared_ptr<binder::Expression> limitNum, LogicalPlan& plan) {
+    auto limit = make_shared<LogicalLimit>(skipNum, limitNum, plan.getLastOperator());
+    appendFlattens(limit->getGroupsPosToFlatten(), plan);
+    limit->setChild(0, plan.getLastOperator());
+    limit->computeFactorizedSchema();
+    plan.setLastOperator(std::move(limit));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_multiplicity_reducer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_multiplicity_reducer.cpp
new file mode 100644
index 0000000000..77d1aa3919
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_multiplicity_reducer.cpp
@@ -0,0 +1,14 @@
+#include "planner/operator/logical_multiplcity_reducer.h"
+#include "planner/planner.h"
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendMultiplicityReducer(LogicalPlan& plan) {
+    auto multiplicityReducer = make_shared<LogicalMultiplicityReducer>(plan.getLastOperator());
+    multiplicityReducer->computeFactorizedSchema();
+    plan.setLastOperator(std::move(multiplicityReducer));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_order_by.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_order_by.cpp
new file mode 100644
index 0000000000..0ca37ab657
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_order_by.cpp
@@ -0,0 +1,19 @@
+#include "planner/operator/logical_order_by.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendOrderBy(const expression_vector& expressions,
+    const std::vector<bool>& isAscOrders, LogicalPlan& plan) {
+    auto orderBy = make_shared<LogicalOrderBy>(expressions, isAscOrders, plan.getLastOperator());
+    appendFlattens(orderBy->getGroupsPosToFlatten(), plan);
+    orderBy->setChild(0, plan.getLastOperator());
+    orderBy->computeFactorizedSchema();
+    plan.setLastOperator(std::move(orderBy));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_projection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_projection.cpp
new file mode 100644
index 0000000000..96919e75d0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_projection.cpp
@@ -0,0 +1,38 @@
+#include "binder/expression_visitor.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+#include "planner/operator/logical_projection.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendProjection(const expression_vector& expressionsToProject, LogicalPlan& plan) {
+    for (auto& expression : expressionsToProject) {
+        planSubqueryIfNecessary(expression, plan);
+    }
+    bool hasRandomFunction = false;
+    for (auto& expr : expressionsToProject) {
+        if (ExpressionVisitor::isRandom(*expr)) {
+            hasRandomFunction = true;
+        }
+    }
+    if (hasRandomFunction) {
+        // Fall back to tuple-at-a-time evaluation.
+        appendMultiplicityReducer(plan);
+        appendFlattens(plan.getSchema()->getGroupsPosInScope(), plan);
+    } else {
+        for (auto& expression : expressionsToProject) {
+            auto groupsPosToFlatten =
+                FlattenAllButOne::getGroupsPosToFlatten(expression, *plan.getSchema());
+            appendFlattens(groupsPosToFlatten, plan);
+        }
+    }
+    auto projection = make_shared<LogicalProjection>(expressionsToProject, plan.getLastOperator());
+    projection->computeFactorizedSchema();
+    plan.setLastOperator(std::move(projection));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_scan_node_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_scan_node_table.cpp
new file mode 100644
index 0000000000..72167dee03
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_scan_node_table.cpp
@@ -0,0 +1,33 @@
+#include "binder/expression/property_expression.h"
+#include "planner/operator/scan/logical_scan_node_table.h"
+#include "planner/planner.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+static expression_vector removeInternalIDProperty(const expression_vector& expressions) {
+    expression_vector result;
+    for (auto expr : expressions) {
+        if (expr->constCast<PropertyExpression>().isInternalID()) {
+            continue;
+        }
+        result.push_back(expr);
+    }
+    return result;
+}
+
+void Planner::appendScanNodeTable(std::shared_ptr<Expression> nodeID,
+    std::vector<table_id_t> tableIDs, const expression_vector& properties, LogicalPlan& plan) {
+    auto propertiesToScan_ = removeInternalIDProperty(properties);
+    auto scan = make_shared<LogicalScanNodeTable>(std::move(nodeID), std::move(tableIDs),
+        propertiesToScan_);
+    scan->computeFactorizedSchema();
+    scan->setCardinality(cardinalityEstimator.estimateScanNode(*scan));
+    plan.setLastOperator(std::move(scan));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_set.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_set.cpp
new file mode 100644
index 0000000000..c1de9e5b1a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_set.cpp
@@ -0,0 +1,22 @@
+#include "binder/query/updating_clause/bound_set_info.h"
+#include "planner/operator/persistent/logical_set.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendSetProperty(const std::vector<BoundSetPropertyInfo>& infos, LogicalPlan& plan) {
+    auto set = std::make_shared<LogicalSetProperty>(copyVector(infos), plan.getLastOperator());
+    for (auto i = 0u; i < set->getInfos().size(); ++i) {
+        auto groupsPos = set->getGroupsPosToFlatten(i);
+        appendFlattens(groupsPos, plan);
+        set->setChild(0, plan.getLastOperator());
+    }
+    set->computeFactorizedSchema();
+    plan.setLastOperator(std::move(set));
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_simple.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_simple.cpp
new file mode 100644
index 0000000000..60fca72419
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_simple.cpp
@@ -0,0 +1,170 @@
+#include "binder/bound_attach_database.h"
+#include "binder/bound_create_macro.h"
+#include "binder/bound_detach_database.h"
+#include "binder/bound_explain.h"
+#include "binder/bound_extension_statement.h"
+#include "binder/bound_standalone_call.h"
+#include "binder/bound_standalone_call_function.h"
+#include "binder/bound_transaction_statement.h"
+#include "binder/bound_use_database.h"
+#include "binder/ddl/bound_alter.h"
+#include "binder/ddl/bound_create_sequence.h"
+#include "binder/ddl/bound_create_table.h"
+#include "binder/ddl/bound_create_type.h"
+#include "binder/ddl/bound_drop.h"
+#include "extension/planner_extension.h"
+#include "planner/operator/ddl/logical_alter.h"
+#include "planner/operator/ddl/logical_create_sequence.h"
+#include "planner/operator/ddl/logical_create_table.h"
+#include "planner/operator/ddl/logical_create_type.h"
+#include "planner/operator/ddl/logical_drop.h"
+#include "planner/operator/logical_create_macro.h"
+#include "planner/operator/logical_explain.h"
+#include "planner/operator/logical_noop.h"
+#include "planner/operator/logical_standalone_call.h"
+#include "planner/operator/logical_table_function_call.h"
+#include "planner/operator/logical_transaction.h"
+#include "planner/operator/simple/logical_attach_database.h"
+#include "planner/operator/simple/logical_detach_database.h"
+#include "planner/operator/simple/logical_extension.h"
+#include "planner/operator/simple/logical_use_database.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+static LogicalPlan getSimplePlan(std::shared_ptr<LogicalOperator> op) {
+    LogicalPlan plan;
+    op->computeFactorizedSchema();
+    plan.setLastOperator(std::move(op));
+    return plan;
+}
+
+LogicalPlan Planner::planCreateTable(const BoundStatement& statement) {
+    auto& createTable = statement.constCast<BoundCreateTable>();
+    auto& info = createTable.getInfo();
+    // If it is a CREATE NODE TABLE AS, then copy as well
+    if (createTable.hasCopyInfo()) {
+        std::vector<std::shared_ptr<LogicalOperator>> children;
+        switch (info.type) {
+        case catalog::CatalogEntryType::NODE_TABLE_ENTRY: {
+            children.push_back(planCopyNodeFrom(&createTable.getCopyInfo()).getLastOperator());
+        } break;
+        case catalog::CatalogEntryType::REL_GROUP_ENTRY: {
+            children.push_back(planCopyRelFrom(&createTable.getCopyInfo()).getLastOperator());
+        } break;
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+        auto create = std::make_shared<LogicalCreateTable>(info.copy());
+        children.push_back(std::move(create));
+        auto noop = std::make_shared<LogicalNoop>(children.size() - 1, children);
+        return getSimplePlan(std::move(noop));
+    }
+    auto op = std::make_shared<LogicalCreateTable>(info.copy());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planCreateType(const BoundStatement& statement) {
+    auto& createType = statement.constCast<BoundCreateType>();
+    auto op =
+        std::make_shared<LogicalCreateType>(createType.getName(), createType.getType().copy());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planCreateSequence(const BoundStatement& statement) {
+    auto& createSequence = statement.constCast<BoundCreateSequence>();
+    auto& info = createSequence.getInfo();
+    auto op = std::make_shared<LogicalCreateSequence>(info.copy());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planDrop(const BoundStatement& statement) {
+    auto& dropTable = statement.constCast<BoundDrop>();
+    auto op = std::make_shared<LogicalDrop>(dropTable.getDropInfo());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planAlter(const BoundStatement& statement) {
+    auto& alter = statement.constCast<BoundAlter>();
+    auto op = std::make_shared<LogicalAlter>(alter.getInfo().copy());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planStandaloneCall(const BoundStatement& statement) {
+    auto& standaloneCallClause = statement.constCast<BoundStandaloneCall>();
+    auto op = std::make_shared<LogicalStandaloneCall>(standaloneCallClause.getOption(),
+        standaloneCallClause.getOptionValue());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planStandaloneCallFunction(const BoundStatement& statement) {
+    auto& standaloneCallFunctionClause = statement.constCast<BoundStandaloneCallFunction>();
+    auto op =
+        std::make_shared<LogicalTableFunctionCall>(standaloneCallFunctionClause.getTableFunction(),
+            standaloneCallFunctionClause.getBindData()->copy());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planExplain(const BoundStatement& statement) {
+    auto& explain = statement.constCast<BoundExplain>();
+    auto statementToExplain = explain.getStatementToExplain();
+    auto planToExplain = planStatement(*statementToExplain);
+    auto op = std::make_shared<LogicalExplain>(planToExplain.getLastOperator(),
+        explain.getExplainType(), statementToExplain->getStatementResult()->getColumns());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planCreateMacro(const BoundStatement& statement) {
+    auto& createMacro = statement.constCast<BoundCreateMacro>();
+    auto op =
+        std::make_shared<LogicalCreateMacro>(createMacro.getMacroName(), createMacro.getMacro());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planTransaction(const BoundStatement& statement) {
+    auto& transactionStatement = statement.constCast<BoundTransactionStatement>();
+    auto op = std::make_shared<LogicalTransaction>(transactionStatement.getTransactionAction());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planExtension(const BoundStatement& statement) {
+    auto& extensionStatement = statement.constCast<BoundExtensionStatement>();
+    auto op = std::make_shared<LogicalExtension>(extensionStatement.getAuxInfo());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planAttachDatabase(const BoundStatement& statement) {
+    auto& boundAttachDatabase = statement.constCast<BoundAttachDatabase>();
+    auto op = std::make_shared<LogicalAttachDatabase>(boundAttachDatabase.getAttachInfo());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planDetachDatabase(const BoundStatement& statement) {
+    auto& boundDetachDatabase = statement.constCast<BoundDetachDatabase>();
+    auto op = std::make_shared<LogicalDetachDatabase>(boundDetachDatabase.getDBName());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planUseDatabase(const BoundStatement& statement) {
+    auto& boundUseDatabase = statement.constCast<BoundUseDatabase>();
+    auto op = std::make_shared<LogicalUseDatabase>(boundUseDatabase.getDBName());
+    return getSimplePlan(std::move(op));
+}
+
+LogicalPlan Planner::planExtensionClause(const BoundStatement& statement) {
+    for (auto& plannerExtension : plannerExtensions) {
+        auto op = plannerExtension->plan(statement);
+        if (op) {
+            return getSimplePlan(op);
+        }
+    }
+    KU_UNREACHABLE;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_table_function_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_table_function_call.cpp
new file mode 100644
index 0000000000..b0688801fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_table_function_call.cpp
@@ -0,0 +1,33 @@
+#include "binder/bound_table_scan_info.h"
+#include "binder/query/reading_clause/bound_table_function_call.h"
+#include "planner/operator/logical_table_function_call.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendTableFunctionCall(const BoundTableScanInfo& info, LogicalPlan& plan) {
+    auto call = std::make_shared<LogicalTableFunctionCall>(info.func, info.bindData->copy());
+    call->computeFactorizedSchema();
+    plan.setLastOperator(std::move(call));
+}
+
+std::shared_ptr<LogicalOperator> Planner::getTableFunctionCall(const BoundTableScanInfo& info) {
+    auto call = std::make_shared<LogicalTableFunctionCall>(info.func, info.bindData->copy());
+    call->computeFactorizedSchema();
+    return call;
+}
+
+std::shared_ptr<LogicalOperator> Planner::getTableFunctionCall(
+    const BoundReadingClause& readingClause) {
+    auto& call = readingClause.constCast<BoundTableFunctionCall>();
+    auto op =
+        std::make_shared<LogicalTableFunctionCall>(call.getTableFunc(), call.getBindData()->copy());
+    op->computeFactorizedSchema();
+    return op;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_unwind.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_unwind.cpp
new file mode 100644
index 0000000000..53404d2858
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/append_unwind.cpp
@@ -0,0 +1,22 @@
+#include "binder/query/reading_clause/bound_unwind_clause.h"
+#include "planner/operator/logical_unwind.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendUnwind(const BoundReadingClause& readingClause, LogicalPlan& plan) {
+    auto& unwindClause = ku_dynamic_cast<const BoundUnwindClause&>(readingClause);
+    auto unwind = make_shared<LogicalUnwind>(unwindClause.getInExpr(), unwindClause.getOutExpr(),
+        unwindClause.getIDExpr(), plan.getLastOperator());
+    appendFlattens(unwind->getGroupsPosToFlatten(), plan);
+    unwind->setChild(0, plan.getLastOperator());
+    unwind->computeFactorizedSchema();
+    plan.setLastOperator(unwind);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_copy.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_copy.cpp
new file mode 100644
index 0000000000..75405d674f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_copy.cpp
@@ -0,0 +1,141 @@
+#include "binder/copy/bound_copy_from.h"
+#include "binder/copy/bound_copy_to.h"
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "planner/operator/logical_partitioner.h"
+#include "planner/operator/persistent/logical_copy_from.h"
+#include "planner/operator/persistent/logical_copy_to.h"
+#include "planner/operator/scan/logical_index_look_up.h"
+#include "planner/planner.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::storage;
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace planner {
+
+static void appendIndexScan(const ExtraBoundCopyRelInfo& extraInfo, LogicalPlan& plan) {
+    auto indexScan =
+        std::make_shared<LogicalPrimaryKeyLookup>(extraInfo.infos, plan.getLastOperator());
+    indexScan->computeFactorizedSchema();
+    plan.setLastOperator(std::move(indexScan));
+}
+
+static void appendPartitioner(const BoundCopyFromInfo& copyFromInfo, LogicalPlan& plan,
+    const std::vector<RelDataDirection>& directions) {
+    LogicalPartitionerInfo info(copyFromInfo.offset);
+    for (auto& direction : directions) {
+        info.partitioningInfos.push_back(
+            LogicalPartitioningInfo(RelDirectionUtils::relDirectionToKeyIdx(direction)));
+    }
+    auto partitioner = std::make_shared<LogicalPartitioner>(std::move(info), copyFromInfo.copy(),
+        plan.getLastOperator());
+    partitioner->computeFactorizedSchema();
+    plan.setLastOperator(std::move(partitioner));
+}
+
+static void appendCopyFrom(const BoundCopyFromInfo& info, LogicalPlan& plan) {
+    auto op = make_shared<LogicalCopyFrom>(info.copy(), plan.getLastOperator());
+    op->computeFactorizedSchema();
+    plan.setLastOperator(std::move(op));
+}
+
+LogicalPlan Planner::planCopyFrom(const BoundStatement& statement) {
+    auto& copyFrom = statement.constCast<BoundCopyFrom>();
+    auto copyFromInfo = copyFrom.getInfo();
+    switch (copyFromInfo->tableType) {
+    case TableType::NODE: {
+        return planCopyNodeFrom(copyFromInfo);
+    }
+    case TableType::REL: {
+        return planCopyRelFrom(copyFromInfo);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+LogicalPlan Planner::planCopyNodeFrom(const BoundCopyFromInfo* info) {
+    auto plan = LogicalPlan();
+    switch (info->source->type) {
+    case ScanSourceType::FILE:
+    case ScanSourceType::OBJECT: {
+        auto& scanSource = info->source->constCast<BoundTableScanSource>();
+        appendTableFunctionCall(scanSource.info, plan);
+    } break;
+    case ScanSourceType::QUERY: {
+        auto& querySource = info->source->constCast<BoundQueryScanSource>();
+        plan = planQuery(*querySource.statement);
+        if (plan.getSchema()->getNumGroups() > 1) {
+            // Copy operator assumes all input are in the same data chunk. If this is not the case,
+            // we first materialize input in flat form into a factorized table.
+            appendAccumulate(AccumulateType::REGULAR, plan.getSchema()->getExpressionsInScope(),
+                nullptr /* mark */, plan);
+        }
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    appendCopyFrom(*info, plan);
+    return plan;
+}
+
+LogicalPlan Planner::planCopyRelFrom(const BoundCopyFromInfo* info) {
+    auto plan = LogicalPlan();
+    switch (info->source->type) {
+    case ScanSourceType::FILE:
+    case ScanSourceType::OBJECT: {
+        auto& fileSource = info->source->constCast<BoundTableScanSource>();
+        appendTableFunctionCall(fileSource.info, plan);
+    } break;
+    case ScanSourceType::QUERY: {
+        auto& querySource = info->source->constCast<BoundQueryScanSource>();
+        plan = planQuery(*querySource.statement);
+        if (plan.getSchema()->getNumGroups() == 1 && !plan.getSchema()->getGroup(0)->isFlat()) {
+            break;
+        }
+        // Copy operator assumes all input are in the same data chunk. If this is not the case,
+        // we first materialize input in flat form into a factorized table.
+        appendAccumulate(AccumulateType::REGULAR, plan.getSchema()->getExpressionsInScope(),
+            nullptr /* mark */, plan);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    auto& extraInfo = info->extraInfo->constCast<ExtraBoundCopyRelInfo>();
+    // If the table entry doesn't exist, assume both directions
+    std::vector<RelDataDirection> directions = {RelDataDirection::FWD, RelDataDirection::BWD};
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    if (catalog->containsTable(transaction, info->tableName)) {
+        const auto& relGroupEntry = catalog->getTableCatalogEntry(transaction, info->tableName)
+                                        ->constCast<RelGroupCatalogEntry>();
+        directions = relGroupEntry.getRelDataDirections();
+    }
+    appendIndexScan(extraInfo, plan);
+    appendPartitioner(*info, plan, directions);
+    appendCopyFrom(*info, plan);
+    return plan;
+}
+
+LogicalPlan Planner::planCopyTo(const BoundStatement& statement) {
+    auto& boundCopyTo = statement.constCast<BoundCopyTo>();
+    auto regularQuery = boundCopyTo.getRegularQuery();
+    std::vector<std::string> columnNames;
+    for (auto& column : regularQuery->getStatementResult()->getColumns()) {
+        columnNames.push_back(column->toString());
+    }
+    KU_ASSERT(regularQuery->getStatementType() == StatementType::QUERY);
+    auto plan = planStatement(*regularQuery);
+    auto copyTo = make_shared<LogicalCopyTo>(boundCopyTo.getBindData()->copy(),
+        boundCopyTo.getExportFunc(), plan.getLastOperator());
+    plan.setLastOperator(std::move(copyTo));
+    return plan;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_join_order.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_join_order.cpp
new file mode 100644
index 0000000000..b582b8c668
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_join_order.cpp
@@ -0,0 +1,627 @@
+#include <cmath>
+
+#include "binder/expression_visitor.h"
+#include "common/enums/join_type.h"
+#include "common/enums/rel_direction.h"
+#include "common/utils.h"
+#include "planner/join_order/cost_model.h"
+#include "planner/join_order/join_plan_solver.h"
+#include "planner/join_order/join_tree_constructor.h"
+#include "planner/operator/scan/logical_scan_node_table.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+LogicalPlan Planner::planQueryGraphCollectionInNewContext(
+    const QueryGraphCollection& queryGraphCollection, const QueryGraphPlanningInfo& info) {
+    auto prevContext = enterNewContext();
+    auto plan = planQueryGraphCollection(queryGraphCollection, info);
+    exitContext(std::move(prevContext));
+    return plan;
+}
+
+static int32_t getConnectedQueryGraphIdx(const QueryGraphCollection& queryGraphCollection,
+    const QueryGraphPlanningInfo& info) {
+    for (auto i = 0u; i < queryGraphCollection.getNumQueryGraphs(); ++i) {
+        auto queryGraph = queryGraphCollection.getQueryGraph(i);
+        for (auto& queryNode : queryGraph->getQueryNodes()) {
+            if (info.containsCorrExpr(*queryNode->getInternalID())) {
+                return i;
+            }
+        }
+    }
+    return -1;
+}
+
+LogicalPlan Planner::planQueryGraphCollection(const QueryGraphCollection& queryGraphCollection,
+    const QueryGraphPlanningInfo& info) {
+    KU_ASSERT(queryGraphCollection.getNumQueryGraphs() > 0);
+    auto& corrExprs = info.corrExprs;
+    int32_t queryGraphIdxToPlanExpressionsScan = -1;
+    if (info.subqueryType == SubqueryPlanningType::CORRELATED) {
+        // Pick a query graph to plan ExpressionsScan. If -1 is returned, we fall back to cross
+        // product.
+        queryGraphIdxToPlanExpressionsScan = getConnectedQueryGraphIdx(queryGraphCollection, info);
+    }
+    std::unordered_set<uint32_t> evaluatedPredicatesIndices;
+    std::vector<LogicalPlan> planPerQueryGraph;
+    for (auto i = 0u; i < queryGraphCollection.getNumQueryGraphs(); ++i) {
+        auto queryGraph = queryGraphCollection.getQueryGraph(i);
+        // Extract predicates for current query graph
+        std::unordered_set<uint32_t> predicateToEvaluateIndices;
+        for (auto j = 0u; j < info.predicates.size(); ++j) {
+            if (info.predicates[j]->expressionType == ExpressionType::LITERAL) {
+                continue;
+            }
+            if (evaluatedPredicatesIndices.contains(j)) {
+                continue;
+            }
+            if (queryGraph->canProjectExpression(info.predicates[j])) {
+                predicateToEvaluateIndices.insert(j);
+            }
+        }
+        evaluatedPredicatesIndices.insert(predicateToEvaluateIndices.begin(),
+            predicateToEvaluateIndices.end());
+        expression_vector predicatesToEvaluate;
+        for (auto idx : predicateToEvaluateIndices) {
+            predicatesToEvaluate.push_back(info.predicates[idx]);
+        }
+        LogicalPlan plan;
+        auto newInfo = info;
+        newInfo.predicates = predicatesToEvaluate;
+        switch (info.subqueryType) {
+        case SubqueryPlanningType::NONE:
+        case SubqueryPlanningType::UNNEST_CORRELATED: {
+            plan = planQueryGraph(*queryGraph, newInfo);
+        } break;
+        case SubqueryPlanningType::CORRELATED: {
+            if (i == (uint32_t)queryGraphIdxToPlanExpressionsScan) {
+                // Plan ExpressionsScan with current query graph.
+                plan = planQueryGraph(*queryGraph, newInfo);
+            } else {
+                // Plan current query graph as an isolated query graph.
+                newInfo.subqueryType = SubqueryPlanningType::NONE;
+                plan = planQueryGraph(*queryGraph, newInfo);
+            }
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+        planPerQueryGraph.push_back(std::move(plan));
+    }
+    // Fail to plan ExpressionsScan with any query graph. Plan it independently and fall back to
+    // cross product.
+    if (info.subqueryType == SubqueryPlanningType::CORRELATED &&
+        queryGraphIdxToPlanExpressionsScan == -1) {
+        auto plan = LogicalPlan();
+        appendExpressionsScan(corrExprs, plan);
+        appendDistinct(corrExprs, plan);
+        planPerQueryGraph.push_back(std::move(plan));
+    }
+    // Take cross products
+    auto plan = planPerQueryGraph[0].copy();
+    for (auto i = 1u; i < planPerQueryGraph.size(); ++i) {
+        appendCrossProduct(plan, planPerQueryGraph[i], plan);
+    }
+    // Apply remaining predicates
+    expression_vector remainingPredicates;
+    for (auto i = 0u; i < info.predicates.size(); ++i) {
+        if (!evaluatedPredicatesIndices.contains(i)) {
+            remainingPredicates.push_back(info.predicates[i]);
+        }
+    }
+    for (auto& predicate : remainingPredicates) {
+        appendFilter(predicate, plan);
+    }
+    return plan;
+}
+
+LogicalPlan Planner::planQueryGraph(const QueryGraph& queryGraph,
+    const QueryGraphPlanningInfo& info) {
+    context.init(&queryGraph, info.predicates);
+    cardinalityEstimator.init(queryGraph);
+    if (info.hint != nullptr) {
+        auto constructor =
+            JoinTreeConstructor(queryGraph, propertyExprCollection, info.predicates, info);
+        auto joinTree = constructor.construct(info.hint);
+        auto plan = JoinPlanSolver(this).solve(joinTree);
+        return plan.copy();
+    }
+    planBaseTableScans(info);
+    context.currentLevel++;
+    while (context.currentLevel < context.maxLevel) {
+        planLevel(context.currentLevel++);
+    }
+
+    auto& plans = context.getPlans(context.getFullyMatchedSubqueryGraph());
+    auto bestIdx = 0;
+    for (auto i = 1u; i < plans.size(); ++i) {
+        if (plans[i].getCost() < plans[bestIdx].getCost()) {
+            bestIdx = i;
+        }
+    }
+    auto bestPlan = plans[bestIdx].copy();
+    if (queryGraph.isEmpty()) {
+        appendEmptyResult(bestPlan);
+    }
+    return bestPlan;
+}
+
+void Planner::planLevel(uint32_t level) {
+    KU_ASSERT(level > 1);
+    if (level > MAX_LEVEL_TO_PLAN_EXACTLY) {
+        planLevelApproximately(level);
+    } else {
+        planLevelExactly(level);
+    }
+}
+
+void Planner::planLevelExactly(uint32_t level) {
+    auto maxLeftLevel = floor(level / 2.0);
+    for (auto leftLevel = 1u; leftLevel <= maxLeftLevel; ++leftLevel) {
+        auto rightLevel = level - leftLevel;
+        if (leftLevel > 1) { // wcoj requires at least 2 rels
+            planWCOJoin(leftLevel, rightLevel);
+        }
+        planInnerJoin(leftLevel, rightLevel);
+    }
+}
+
+void Planner::planLevelApproximately(uint32_t level) {
+    planInnerJoin(1, level - 1);
+}
+
+void Planner::planBaseTableScans(const QueryGraphPlanningInfo& info) {
+    auto queryGraph = context.getQueryGraph();
+    switch (info.subqueryType) {
+    case SubqueryPlanningType::NONE: {
+        for (auto nodePos = 0u; nodePos < queryGraph->getNumQueryNodes(); ++nodePos) {
+            planNodeScan(nodePos);
+        }
+    } break;
+    case SubqueryPlanningType::UNNEST_CORRELATED: {
+        for (auto nodePos = 0u; nodePos < queryGraph->getNumQueryNodes(); ++nodePos) {
+            auto queryNode = queryGraph->getQueryNode(nodePos);
+            if (info.containsCorrExpr(*queryNode->getInternalID())) {
+                // NodeID will be a join condition with outer plan so very likely we will apply a
+                // semi mask later in the optimization stage. So we can assume the cardinality will
+                // not exceed outer plan cardinality.
+                cardinalityEstimator.rectifyCardinality(*queryNode->getInternalID(),
+                    info.corrExprsCard);
+                // In un-nested subquery, e.g. MATCH (a) OPTIONAL MATCH (a)-[e1]->(b), the inner
+                // query ("(a)-[e1]->(b)") needs to scan a, which is already scanned in the outer
+                // query (a). To avoid scanning storage twice, we keep track of node table "a" and
+                // make sure when planning inner query, we only scan internal ID of "a".
+                planNodeIDScan(nodePos);
+            } else {
+                planNodeScan(nodePos);
+            }
+        }
+    } break;
+    case SubqueryPlanningType::CORRELATED: {
+        for (auto nodePos = 0u; nodePos < queryGraph->getNumQueryNodes(); ++nodePos) {
+            auto queryNode = queryGraph->getQueryNode(nodePos);
+            if (info.containsCorrExpr(*queryNode->getInternalID())) {
+                continue;
+            }
+            planNodeScan(nodePos);
+        }
+        planCorrelatedExpressionsScan(info);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    for (auto relPos = 0u; relPos < queryGraph->getNumQueryRels(); ++relPos) {
+        planRelScan(relPos);
+    }
+}
+
+void Planner::planCorrelatedExpressionsScan(const QueryGraphPlanningInfo& info) {
+    auto queryGraph = context.getQueryGraph();
+    auto newSubgraph = context.getEmptySubqueryGraph();
+    auto& corrExprs = info.corrExprs;
+    for (auto nodePos = 0u; nodePos < queryGraph->getNumQueryNodes(); ++nodePos) {
+        auto queryNode = queryGraph->getQueryNode(nodePos);
+        if (info.containsCorrExpr(*queryNode->getInternalID())) {
+            newSubgraph.addQueryNode(nodePos);
+        }
+    }
+    auto plan = LogicalPlan();
+    appendExpressionsScan(corrExprs, plan);
+    plan.getLastOperator()->setCardinality(info.corrExprsCard);
+    auto predicates = getNewlyMatchedExprs(context.getEmptySubqueryGraph(), newSubgraph,
+        context.getWhereExpressions());
+    appendFilters(predicates, plan);
+    appendDistinct(corrExprs, plan);
+    context.addPlan(newSubgraph, std::move(plan));
+}
+
+void Planner::planNodeScan(uint32_t nodePos) {
+    auto node = context.queryGraph->getQueryNode(nodePos);
+    auto newSubgraph = context.getEmptySubqueryGraph();
+    newSubgraph.addQueryNode(nodePos);
+    auto plan = LogicalPlan();
+    auto properties = getProperties(*node);
+    appendScanNodeTable(node->getInternalID(), node->getTableIDs(), properties, plan);
+    auto predicates = getNewlyMatchedExprs(context.getEmptySubqueryGraph(), newSubgraph,
+        context.getWhereExpressions());
+    appendFilters(predicates, plan);
+    context.addPlan(newSubgraph, std::move(plan));
+}
+
+void Planner::planNodeIDScan(uint32_t nodePos) {
+    auto node = context.queryGraph->getQueryNode(nodePos);
+    auto newSubgraph = context.getEmptySubqueryGraph();
+    newSubgraph.addQueryNode(nodePos);
+    auto plan = LogicalPlan();
+    appendScanNodeTable(node->getInternalID(), node->getTableIDs(), {}, plan);
+    context.addPlan(newSubgraph, std::move(plan));
+}
+
+static std::pair<std::shared_ptr<NodeExpression>, std::shared_ptr<NodeExpression>>
+getBoundAndNbrNodes(const RelExpression& rel, ExtendDirection direction) {
+    KU_ASSERT(direction != ExtendDirection::BOTH);
+    auto boundNode = direction == ExtendDirection::FWD ? rel.getSrcNode() : rel.getDstNode();
+    auto dstNode = direction == ExtendDirection::FWD ? rel.getDstNode() : rel.getSrcNode();
+    return make_pair(boundNode, dstNode);
+}
+
+static ExtendDirection getExtendDirection(const binder::RelExpression& relExpression,
+    const binder::NodeExpression& boundNode) {
+    if (relExpression.getDirectionType() == binder::RelDirectionType::BOTH) {
+        KU_ASSERT(relExpression.getExtendDirections().size() == common::NUM_REL_DIRECTIONS);
+        return ExtendDirection::BOTH;
+    }
+    if (relExpression.getSrcNodeName() == boundNode.getUniqueName()) {
+        return ExtendDirection::FWD;
+    } else {
+        return ExtendDirection::BWD;
+    }
+}
+
+void Planner::planRelScan(uint32_t relPos) {
+    const auto rel = context.queryGraph->getQueryRel(relPos);
+    auto newSubgraph = context.getEmptySubqueryGraph();
+    newSubgraph.addQueryRel(relPos);
+    const auto predicates = getNewlyMatchedExprs(context.getEmptySubqueryGraph(), newSubgraph,
+        context.getWhereExpressions());
+    for (const auto direction : rel->getExtendDirections()) {
+        auto plan = LogicalPlan();
+        auto [boundNode, nbrNode] = getBoundAndNbrNodes(*rel, direction);
+        const auto extendDirection = getExtendDirection(*rel, *boundNode);
+        appendScanNodeTable(boundNode->getInternalID(), boundNode->getTableIDs(), {}, plan);
+        appendExtend(boundNode, nbrNode, rel, extendDirection, getProperties(*rel), plan);
+        appendFilters(predicates, plan);
+        context.addPlan(newSubgraph, std::move(plan));
+    }
+}
+
+void Planner::appendExtend(std::shared_ptr<NodeExpression> boundNode,
+    std::shared_ptr<NodeExpression> nbrNode, std::shared_ptr<RelExpression> rel,
+    ExtendDirection direction, const binder::expression_vector& properties, LogicalPlan& plan) {
+    switch (rel->getRelType()) {
+    case QueryRelType::NON_RECURSIVE: {
+        auto extendFromSource = *boundNode == *rel->getSrcNode();
+        appendNonRecursiveExtend(boundNode, nbrNode, rel, direction, extendFromSource, properties,
+            plan);
+    } break;
+    case QueryRelType::VARIABLE_LENGTH_WALK:
+    case QueryRelType::VARIABLE_LENGTH_TRAIL:
+    case QueryRelType::VARIABLE_LENGTH_ACYCLIC:
+    case QueryRelType::SHORTEST:
+    case QueryRelType::ALL_SHORTEST:
+    case QueryRelType::WEIGHTED_SHORTEST:
+    case QueryRelType::ALL_WEIGHTED_SHORTEST: {
+        appendRecursiveExtend(boundNode, nbrNode, rel, direction, plan);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static std::unordered_map<uint32_t, std::vector<std::shared_ptr<RelExpression>>>
+populateIntersectRelCandidates(const QueryGraph& queryGraph, const SubqueryGraph& subgraph) {
+    std::unordered_map<uint32_t, std::vector<std::shared_ptr<RelExpression>>>
+        intersectNodePosToRelsMap;
+    for (auto relPos : subgraph.getRelNbrPositions()) {
+        auto rel = queryGraph.getQueryRel(relPos);
+        if (!queryGraph.containsQueryNode(rel->getSrcNodeName()) ||
+            !queryGraph.containsQueryNode(rel->getDstNodeName())) {
+            continue;
+        }
+        auto srcNodePos = queryGraph.getQueryNodeIdx(rel->getSrcNodeName());
+        auto dstNodePos = queryGraph.getQueryNodeIdx(rel->getDstNodeName());
+        auto isSrcConnected = subgraph.queryNodesSelector[srcNodePos];
+        auto isDstConnected = subgraph.queryNodesSelector[dstNodePos];
+        // Closing rel should be handled with inner join.
+        if (isSrcConnected && isDstConnected) {
+            continue;
+        }
+        auto intersectNodePos = isSrcConnected ? dstNodePos : srcNodePos;
+        if (!intersectNodePosToRelsMap.contains(intersectNodePos)) {
+            intersectNodePosToRelsMap.insert(
+                {intersectNodePos, std::vector<std::shared_ptr<RelExpression>>{}});
+        }
+        intersectNodePosToRelsMap.at(intersectNodePos).push_back(rel);
+    }
+    return intersectNodePosToRelsMap;
+}
+
+void Planner::planWCOJoin(uint32_t leftLevel, uint32_t rightLevel) {
+    KU_ASSERT(leftLevel <= rightLevel);
+    auto queryGraph = context.getQueryGraph();
+    for (auto& rightSubgraph : context.subPlansTable->getSubqueryGraphs(rightLevel)) {
+        auto candidates = populateIntersectRelCandidates(*queryGraph, rightSubgraph);
+        for (auto& [intersectNodePos, rels] : candidates) {
+            if (rels.size() == leftLevel) {
+                auto intersectNode = queryGraph->getQueryNode(intersectNodePos);
+                planWCOJoin(rightSubgraph, rels, intersectNode);
+            }
+        }
+    }
+}
+
+static LogicalOperator* getSequentialScan(LogicalOperator* op) {
+    switch (op->getOperatorType()) {
+    case LogicalOperatorType::FLATTEN:
+    case LogicalOperatorType::FILTER:
+    case LogicalOperatorType::EXTEND:
+    case LogicalOperatorType::PROJECTION: { // operators we directly search through
+        return getSequentialScan(op->getChild(0).get());
+    }
+    case LogicalOperatorType::SCAN_NODE_TABLE: {
+        return op;
+    }
+    default:
+        return nullptr;
+    }
+}
+
+// Check whether given node ID has sequential guarantee on the plan.
+static bool isNodeSequentialOnPlan(const LogicalPlan& plan, const NodeExpression& node) {
+    const auto seqScan = getSequentialScan(plan.getLastOperator().get());
+    if (seqScan == nullptr) {
+        return false;
+    }
+    const auto sequentialScan = ku_dynamic_cast<LogicalScanNodeTable*>(seqScan);
+    return sequentialScan->getNodeID()->getUniqueName() == node.getInternalID()->getUniqueName();
+}
+
+// As a heuristic for wcoj, we always pick rel scan that starts from the bound node.
+static LogicalPlan getWCOJBuildPlanForRel(const std::vector<LogicalPlan>& candidatePlans,
+    const NodeExpression& boundNode) {
+    for (auto& candidatePlan : candidatePlans) {
+        if (isNodeSequentialOnPlan(candidatePlan, boundNode)) {
+            return candidatePlan.copy();
+        }
+    }
+    return LogicalPlan();
+}
+
+void Planner::planWCOJoin(const SubqueryGraph& subgraph,
+    const std::vector<std::shared_ptr<RelExpression>>& rels,
+    const std::shared_ptr<NodeExpression>& intersectNode) {
+    auto newSubgraph = subgraph;
+    std::vector<SubqueryGraph> prevSubgraphs;
+    prevSubgraphs.push_back(subgraph);
+    expression_vector boundNodeIDs;
+    std::vector<LogicalPlan> relPlans;
+    for (auto& rel : rels) {
+        auto boundNode = rel->getSrcNodeName() == intersectNode->getUniqueName() ?
+                             rel->getDstNode() :
+                             rel->getSrcNode();
+
+        // stop if the rel pattern's supported rel directions don't contain the current direction
+        const auto extendDirection = getExtendDirection(*rel, *boundNode);
+        if (extendDirection != ExtendDirection::BOTH &&
+            !containsValue(rel->getExtendDirections(), extendDirection)) {
+            return;
+        }
+
+        boundNodeIDs.push_back(boundNode->getInternalID());
+        auto relPos = context.getQueryGraph()->getQueryRelIdx(rel->getUniqueName());
+        auto prevSubgraph = context.getEmptySubqueryGraph();
+        prevSubgraph.addQueryRel(relPos);
+        prevSubgraphs.push_back(subgraph);
+        newSubgraph.addQueryRel(relPos);
+        // fetch build plans for rel
+        auto relSubgraph = context.getEmptySubqueryGraph();
+        relSubgraph.addQueryRel(relPos);
+        KU_ASSERT(context.subPlansTable->containSubgraphPlans(relSubgraph));
+        auto& relPlanCandidates = context.subPlansTable->getSubgraphPlans(relSubgraph);
+        auto relPlan = getWCOJBuildPlanForRel(relPlanCandidates, *boundNode);
+        if (relPlan.isEmpty()) { // Cannot find a suitable rel plan.
+            return;
+        }
+        relPlans.push_back(std::move(relPlan));
+    }
+    auto predicates =
+        getNewlyMatchedExprs(prevSubgraphs, newSubgraph, context.getWhereExpressions());
+    for (auto& leftPlan : context.getPlans(subgraph)) {
+        // Disable WCOJ if intersect node is in the scope of probe plan. This happens in the case
+        // like, MATCH (a)-[e1]->(b), (b)-[e2]->(a), (a)-[e3]->(b).
+        // When we perform edge-at-a-time enumeration, at some point we will in the state of e1 as
+        // probe side and e2, e3 as build side and we attempt to apply WCOJ. However, the right
+        // approach is to build e1, e2, e3 and intersect on a common node (either a or b).
+        // I tend to disable WCOJ for this case for now. The proper fix should be move to
+        // node-at-a-time enumeration and re-enable WCOJ.
+        // TODO(Xiyang): Fixme according to the description above.
+        if (leftPlan.getSchema()->isExpressionInScope(*intersectNode->getInternalID())) {
+            continue;
+        }
+        auto leftPlanCopy = leftPlan.copy();
+        std::vector<LogicalPlan> rightPlansCopy;
+        rightPlansCopy.reserve(relPlans.size());
+        for (auto& relPlan : relPlans) {
+            rightPlansCopy.push_back(relPlan.copy());
+        }
+        appendIntersect(intersectNode->getInternalID(), boundNodeIDs, leftPlanCopy, rightPlansCopy);
+        for (auto& predicate : predicates) {
+            appendFilter(predicate, leftPlanCopy);
+        }
+        context.subPlansTable->addPlan(newSubgraph, std::move(leftPlanCopy));
+    }
+}
+
+// E.g. Query graph (a)-[e1]->(b), (b)-[e2]->(a) and join between (a)-[e1] and [e2]
+// Since (b) is not in the scope of any join subgraph, join node is analyzed as (a) only, However,
+// [e1] and [e2] are also connected at (b) implicitly. So actual join nodes should be (a) and (b).
+// We prune such join.
+// Note that this does not mean we may lose good plan. An equivalent join can be found between [e2]
+// and (a)-[e1]->(b).
+static bool needPruneImplicitJoins(const SubqueryGraph& leftSubgraph,
+    const SubqueryGraph& rightSubgraph, uint32_t numJoinNodes) {
+    auto leftNodePositions = leftSubgraph.getNodePositionsIgnoringNodeSelector();
+    auto rightNodePositions = rightSubgraph.getNodePositionsIgnoringNodeSelector();
+    auto intersectionSize = 0u;
+    for (auto& pos : leftNodePositions) {
+        if (rightNodePositions.contains(pos)) {
+            intersectionSize++;
+        }
+    }
+    return intersectionSize != numJoinNodes;
+}
+
+void Planner::planInnerJoin(uint32_t leftLevel, uint32_t rightLevel) {
+    KU_ASSERT(leftLevel <= rightLevel);
+    for (auto& rightSubgraph : context.subPlansTable->getSubqueryGraphs(rightLevel)) {
+        for (auto& nbrSubgraph : rightSubgraph.getNbrSubgraphs(leftLevel)) {
+            // E.g. MATCH (a)->(b) MATCH (b)->(c)
+            // Since we merge query graph for multipart query, during enumeration for the second
+            // match, the query graph is (a)->(b)->(c). However, we omit plans corresponding to the
+            // first match (i.e. (a)->(b)).
+            if (!context.containPlans(nbrSubgraph)) {
+                continue;
+            }
+            auto joinNodePositions = rightSubgraph.getConnectedNodePos(nbrSubgraph);
+            auto joinNodes = context.queryGraph->getQueryNodes(joinNodePositions);
+            if (needPruneImplicitJoins(nbrSubgraph, rightSubgraph, joinNodes.size())) {
+                continue;
+            }
+            // If index nested loop (INL) join is possible, we prune hash join plans
+            if (tryPlanINLJoin(rightSubgraph, nbrSubgraph, joinNodes)) {
+                continue;
+            }
+            planInnerHashJoin(rightSubgraph, nbrSubgraph, joinNodes, leftLevel != rightLevel);
+        }
+    }
+}
+
+bool Planner::tryPlanINLJoin(const SubqueryGraph& subgraph, const SubqueryGraph& otherSubgraph,
+    const std::vector<std::shared_ptr<NodeExpression>>& joinNodes) {
+    if (joinNodes.size() > 1) {
+        return false;
+    }
+    if (!subgraph.isSingleRel() && !otherSubgraph.isSingleRel()) {
+        return false;
+    }
+    if (subgraph.isSingleRel()) { // Always put single rel subgraph to right.
+        return tryPlanINLJoin(otherSubgraph, subgraph, joinNodes);
+    }
+    auto relPos = UINT32_MAX;
+    for (auto i = 0u; i < context.queryGraph->getNumQueryRels(); ++i) {
+        if (otherSubgraph.queryRelsSelector[i]) {
+            relPos = i;
+        }
+    }
+    KU_ASSERT(relPos != UINT32_MAX);
+    auto rel = context.queryGraph->getQueryRel(relPos);
+    const auto& boundNode = joinNodes[0];
+    auto nbrNode =
+        boundNode->getUniqueName() == rel->getSrcNodeName() ? rel->getDstNode() : rel->getSrcNode();
+    auto extendDirection = getExtendDirection(*rel, *boundNode);
+    if (extendDirection != common::ExtendDirection::BOTH &&
+        !common::containsValue(rel->getExtendDirections(), extendDirection)) {
+        return false;
+    }
+    auto newSubgraph = subgraph;
+    newSubgraph.addQueryRel(relPos);
+    auto predicates = getNewlyMatchedExprs(subgraph, newSubgraph, context.getWhereExpressions());
+    bool hasAppliedINLJoin = false;
+    for (auto& prevPlan : context.getPlans(subgraph)) {
+        if (isNodeSequentialOnPlan(prevPlan, *boundNode)) {
+            auto plan = prevPlan.copy();
+            appendExtend(boundNode, nbrNode, rel, extendDirection, getProperties(*rel), plan);
+            appendFilters(predicates, plan);
+            context.addPlan(newSubgraph, std::move(plan));
+            hasAppliedINLJoin = true;
+        }
+    }
+    return hasAppliedINLJoin;
+}
+
+void Planner::planInnerHashJoin(const SubqueryGraph& subgraph, const SubqueryGraph& otherSubgraph,
+    const std::vector<std::shared_ptr<NodeExpression>>& joinNodes, bool flipPlan) {
+    auto newSubgraph = subgraph;
+    newSubgraph.addSubqueryGraph(otherSubgraph);
+    auto maxCost = context.subPlansTable->getMaxCost(newSubgraph);
+    expression_vector joinNodeIDs;
+    for (auto& joinNode : joinNodes) {
+        joinNodeIDs.push_back(joinNode->getInternalID());
+    }
+    auto predicates =
+        getNewlyMatchedExprs(subgraph, otherSubgraph, newSubgraph, context.getWhereExpressions());
+    for (auto& leftPlan : context.getPlans(subgraph)) {
+        for (auto& rightPlan : context.getPlans(otherSubgraph)) {
+            if (CostModel::computeHashJoinCost(joinNodeIDs, leftPlan, rightPlan) < maxCost) {
+                auto leftPlanProbeCopy = leftPlan.copy();
+                auto rightPlanBuildCopy = rightPlan.copy();
+                appendHashJoin(joinNodeIDs, JoinType::INNER, leftPlanProbeCopy, rightPlanBuildCopy,
+                    leftPlanProbeCopy);
+                appendFilters(predicates, leftPlanProbeCopy);
+                context.addPlan(newSubgraph, std::move(leftPlanProbeCopy));
+            }
+            // flip build and probe side to get another HashJoin plan
+            if (flipPlan &&
+                CostModel::computeHashJoinCost(joinNodeIDs, rightPlan, leftPlan) < maxCost) {
+                auto leftPlanBuildCopy = leftPlan.copy();
+                auto rightPlanProbeCopy = rightPlan.copy();
+                appendHashJoin(joinNodeIDs, JoinType::INNER, rightPlanProbeCopy, leftPlanBuildCopy,
+                    rightPlanProbeCopy);
+                appendFilters(predicates, rightPlanProbeCopy);
+                context.addPlan(newSubgraph, std::move(rightPlanProbeCopy));
+            }
+        }
+    }
+}
+
+static bool isExpressionNewlyMatched(const std::vector<SubqueryGraph>& prevs,
+    const SubqueryGraph& newSubgraph, const std::shared_ptr<Expression>& expression) {
+    auto collector = DependentVarNameCollector();
+    collector.visit(expression);
+    auto variables = collector.getVarNames();
+    for (auto& prev : prevs) {
+        if (prev.containAllVariables(variables)) {
+            return false; // matched in prev subgraph
+        }
+    }
+    return newSubgraph.containAllVariables(variables);
+}
+
+expression_vector Planner::getNewlyMatchedExprs(const std::vector<SubqueryGraph>& prevs,
+    const SubqueryGraph& new_, const expression_vector& exprs) {
+    expression_vector result;
+    for (auto& expr : exprs) {
+        if (isExpressionNewlyMatched(prevs, new_, expr)) {
+            result.push_back(expr);
+        }
+    }
+    return result;
+}
+
+expression_vector Planner::getNewlyMatchedExprs(const SubqueryGraph& prev,
+    const SubqueryGraph& new_, const expression_vector& exprs) {
+    return getNewlyMatchedExprs(std::vector<SubqueryGraph>{prev}, new_, exprs);
+}
+
+expression_vector Planner::getNewlyMatchedExprs(const SubqueryGraph& leftPrev,
+    const SubqueryGraph& rightPrev, const SubqueryGraph& new_, const expression_vector& exprs) {
+    return getNewlyMatchedExprs(std::vector<SubqueryGraph>{leftPrev, rightPrev}, new_, exprs);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_node_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_node_scan.cpp
new file mode 100644
index 0000000000..74609714c3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_node_scan.cpp
@@ -0,0 +1,19 @@
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+LogicalPlan Planner::getNodePropertyScanPlan(const NodeExpression& node) {
+    auto properties = getProperties(node);
+    auto scanPlan = LogicalPlan();
+    if (properties.empty()) {
+        return scanPlan;
+    }
+    appendScanNodeTable(node.getInternalID(), node.getTableIDs(), properties, scanPlan);
+    return scanPlan;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_node_semi_mask.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_node_semi_mask.cpp
new file mode 100644
index 0000000000..f614d970f3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_node_semi_mask.cpp
@@ -0,0 +1,48 @@
+#include "binder/expression/expression_util.h"
+#include "binder/expression/property_expression.h"
+#include "binder/expression_visitor.h"
+#include "planner/operator/logical_dummy_sink.h"
+#include "planner/operator/sip/logical_semi_masker.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void Planner::appendNodeSemiMask(SemiMaskTargetType targetType, const NodeExpression& node,
+    LogicalPlan& plan) {
+    auto semiMasker = std::make_shared<LogicalSemiMasker>(SemiMaskKeyType::NODE, targetType,
+        node.getInternalID(), node.getTableIDs(), plan.getLastOperator());
+    semiMasker->computeFactorizedSchema();
+    plan.setLastOperator(semiMasker);
+}
+
+void Planner::appendDummySink(LogicalPlan& plan) {
+    auto dummySink = std::make_shared<LogicalDummySink>(plan.getLastOperator());
+    dummySink->computeFactorizedSchema();
+    plan.setLastOperator(std::move(dummySink));
+}
+
+// Create a plan with a root semi masker for given node and node predicate.
+LogicalPlan Planner::getNodeSemiMaskPlan(SemiMaskTargetType targetType, const NodeExpression& node,
+    std::shared_ptr<Expression> nodePredicate) {
+    auto plan = LogicalPlan();
+    auto prevCollection = enterNewPropertyExprCollection();
+    auto collector = PropertyExprCollector();
+    collector.visit(nodePredicate);
+    for (auto& expr : ExpressionUtil::removeDuplication(collector.getPropertyExprs())) {
+        auto& propExpr = expr->constCast<PropertyExpression>();
+        propertyExprCollection.addProperties(propExpr.getVariableName(), expr);
+    }
+    appendScanNodeTable(node.getInternalID(), node.getTableIDs(), getProperties(node), plan);
+    appendFilter(nodePredicate, plan);
+    exitPropertyExprCollection(std::move(prevCollection));
+    appendNodeSemiMask(targetType, node, plan);
+    appendDummySink(plan);
+    return plan;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_port_db.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_port_db.cpp
new file mode 100644
index 0000000000..38fa79ee23
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_port_db.cpp
@@ -0,0 +1,76 @@
+#include "binder/bound_export_database.h"
+#include "binder/bound_import_database.h"
+#include "catalog/catalog.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/string_utils.h"
+#include "function/built_in_function_utils.h"
+#include "planner/operator/persistent/logical_copy_to.h"
+#include "planner/operator/simple/logical_export_db.h"
+#include "planner/operator/simple/logical_import_db.h"
+#include "planner/planner.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::storage;
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace planner {
+
+std::vector<std::shared_ptr<LogicalOperator>> Planner::planExportTableData(
+    const BoundStatement& statement) {
+    std::vector<std::shared_ptr<LogicalOperator>> logicalOperators;
+    auto& boundExportDatabase = statement.constCast<BoundExportDatabase>();
+    auto fileTypeStr = FileTypeUtils::toString(boundExportDatabase.getFileType());
+    StringUtils::toLower(fileTypeStr);
+    // TODO(Ziyi): Shouldn't these be done in Binder?
+    std::string name =
+        stringFormat("COPY_{}", FileTypeUtils::toString(boundExportDatabase.getFileType()));
+    auto entry =
+        Catalog::Get(*clientContext)->getFunctionEntry(Transaction::Get(*clientContext), name);
+    auto func = function::BuiltInFunctionsUtils::matchFunction(name,
+        entry->ptrCast<FunctionCatalogEntry>());
+    KU_ASSERT(func != nullptr);
+    auto exportFunc = *func->constPtrCast<function::ExportFunction>();
+    for (auto& exportTableData : *boundExportDatabase.getExportData()) {
+        auto regularQuery = exportTableData.getRegularQuery();
+        KU_ASSERT(regularQuery->getStatementType() == StatementType::QUERY);
+        auto tablePlan = planStatement(*regularQuery);
+        auto path = VirtualFileSystem::GetUnsafe(*clientContext)
+                        ->joinPath(boundExportDatabase.getFilePath(), exportTableData.fileName);
+        function::ExportFuncBindInput bindInput{exportTableData.columnNames, std::move(path),
+            boundExportDatabase.getExportOptions()};
+        auto copyTo = std::make_shared<LogicalCopyTo>(exportFunc.bind(bindInput), exportFunc,
+            tablePlan.getLastOperator());
+        logicalOperators.push_back(std::move(copyTo));
+    }
+    return logicalOperators;
+}
+
+LogicalPlan Planner::planExportDatabase(const BoundStatement& statement) {
+    auto& boundExportDatabase = statement.constCast<BoundExportDatabase>();
+    auto logicalOperators = std::vector<std::shared_ptr<LogicalOperator>>();
+    auto plan = LogicalPlan();
+    if (!boundExportDatabase.exportSchemaOnly()) {
+        logicalOperators = planExportTableData(statement);
+    }
+    auto exportDatabase =
+        std::make_shared<LogicalExportDatabase>(boundExportDatabase.getBoundFileInfo()->copy(),
+            std::move(logicalOperators), boundExportDatabase.exportSchemaOnly());
+    plan.setLastOperator(std::move(exportDatabase));
+    return plan;
+}
+
+LogicalPlan Planner::planImportDatabase(const BoundStatement& statement) {
+    auto& boundImportDatabase = statement.constCast<BoundImportDatabase>();
+    auto plan = LogicalPlan();
+    auto importDatabase = std::make_shared<LogicalImportDatabase>(boundImportDatabase.getQuery(),
+        boundImportDatabase.getIndexQuery());
+    plan.setLastOperator(std::move(importDatabase));
+    return plan;
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_projection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_projection.cpp
new file mode 100644
index 0000000000..7ee2c8a6b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_projection.cpp
@@ -0,0 +1,85 @@
+#include "binder/expression_visitor.h"
+#include "binder/query/return_with_clause/bound_projection_body.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::planProjectionBody(const BoundProjectionBody* projectionBody, LogicalPlan& plan) {
+    auto expressionsToProject = projectionBody->getProjectionExpressions();
+    if (expressionsToProject.empty()) {
+        return;
+    }
+    if (plan.isEmpty()) { // e.g. RETURN 1, COUNT(2)
+        appendDummyScan(plan);
+    }
+    auto expressionsToAggregate = projectionBody->getAggregateExpressions();
+    auto expressionsToGroupBy = projectionBody->getGroupByExpressions();
+    if (!expressionsToAggregate.empty()) {
+        planAggregate(expressionsToAggregate, expressionsToGroupBy, plan);
+    }
+    // We might order by an expression that is not in projection list, so after order by we
+    // always need to append a projection.
+    // If distinct is presented in projection list, we need to first append project to evaluate the
+    // list, then take the distinct.
+    // Order by should always be the last operator (except for skip/limit) because other operators
+    // will break the order.
+    if (projectionBody->isDistinct() && projectionBody->hasOrderByExpressions()) {
+        appendProjection(expressionsToProject, plan);
+        appendDistinct(expressionsToProject, plan);
+        planOrderBy(expressionsToProject, projectionBody->getOrderByExpressions(),
+            projectionBody->getSortingOrders(), plan);
+        appendProjection(expressionsToProject, plan);
+    } else if (projectionBody->isDistinct()) {
+        appendProjection(expressionsToProject, plan);
+        appendDistinct(expressionsToProject, plan);
+    } else if (projectionBody->hasOrderByExpressions()) {
+        planOrderBy(expressionsToProject, projectionBody->getOrderByExpressions(),
+            projectionBody->getSortingOrders(), plan);
+        appendProjection(expressionsToProject, plan);
+    } else {
+        appendProjection(expressionsToProject, plan);
+    }
+    if (projectionBody->hasSkipOrLimit()) {
+        appendMultiplicityReducer(plan);
+        appendLimit(projectionBody->getSkipNumber(), projectionBody->getLimitNumber(), plan);
+    }
+}
+
+void Planner::planAggregate(const expression_vector& expressionsToAggregate,
+    const expression_vector& expressionsToGroupBy, LogicalPlan& plan) {
+    KU_ASSERT(!expressionsToAggregate.empty());
+    expression_vector expressionsToProject;
+    for (auto& expressionToAggregate : expressionsToAggregate) {
+        if (ExpressionChildrenCollector::collectChildren(*expressionToAggregate)
+                .empty()) { // skip COUNT(*)
+            continue;
+        }
+        expressionsToProject.push_back(expressionToAggregate->getChild(0));
+    }
+    for (auto& expressionToGroupBy : expressionsToGroupBy) {
+        expressionsToProject.push_back(expressionToGroupBy);
+    }
+    appendProjection(expressionsToProject, plan);
+    appendAggregate(expressionsToGroupBy, expressionsToAggregate, plan);
+}
+
+void Planner::planOrderBy(const binder::expression_vector& expressionsToProject,
+    const binder::expression_vector& expressionsToOrderBy, const std::vector<bool>& isAscOrders,
+    LogicalPlan& plan) {
+    auto expressionsToProjectBeforeOrderBy = expressionsToProject;
+    auto expressionsToProjectSet =
+        expression_set{expressionsToProject.begin(), expressionsToProject.end()};
+    for (auto& expression : expressionsToOrderBy) {
+        if (!expressionsToProjectSet.contains(expression)) {
+            expressionsToProjectBeforeOrderBy.push_back(expression);
+        }
+    }
+    appendProjection(expressionsToProjectBeforeOrderBy, plan);
+    appendOrderBy(expressionsToOrderBy, isAscOrders, plan);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_read.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_read.cpp
new file mode 100644
index 0000000000..9f793ab5a6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_read.cpp
@@ -0,0 +1,143 @@
+#include "binder/expression_visitor.h"
+#include "binder/query/reading_clause/bound_load_from.h"
+#include "binder/query/reading_clause/bound_match_clause.h"
+#include "binder/query/reading_clause/bound_table_function_call.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+void Planner::planReadingClause(const BoundReadingClause& readingClause, LogicalPlan& plan) {
+    switch (readingClause.getClauseType()) {
+    case ClauseType::MATCH: {
+        planMatchClause(readingClause, plan);
+    } break;
+    case ClauseType::UNWIND: {
+        planUnwindClause(readingClause, plan);
+    } break;
+    case ClauseType::TABLE_FUNCTION_CALL: {
+        planTableFunctionCall(readingClause, plan);
+    } break;
+    case ClauseType::LOAD_FROM: {
+        planLoadFrom(readingClause, plan);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void Planner::planMatchClause(const BoundReadingClause& readingClause, LogicalPlan& plan) {
+    auto& boundMatchClause = readingClause.constCast<BoundMatchClause>();
+    auto queryGraphCollection = boundMatchClause.getQueryGraphCollection();
+    auto predicates = boundMatchClause.getConjunctivePredicates();
+    switch (boundMatchClause.getMatchClauseType()) {
+    case MatchClauseType::MATCH: {
+        if (plan.isEmpty()) {
+            auto info = QueryGraphPlanningInfo();
+            info.predicates = predicates;
+            info.hint = boundMatchClause.getHint();
+            plan = planQueryGraphCollection(*queryGraphCollection, info);
+        } else {
+            planRegularMatch(*queryGraphCollection, predicates, plan, boundMatchClause.getHint());
+        }
+    } break;
+    case MatchClauseType::OPTIONAL_MATCH: {
+        planOptionalMatch(*queryGraphCollection, predicates, plan, boundMatchClause.getHint());
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void Planner::planUnwindClause(const BoundReadingClause& boundReadingClause, LogicalPlan& plan) {
+    if (plan.isEmpty()) { // UNWIND [1, 2, 3, 4] AS x RETURN x
+        appendDummyScan(plan);
+    }
+    appendUnwind(boundReadingClause, plan);
+}
+
+class PredicatesDependencyAnalyzer {
+public:
+    explicit PredicatesDependencyAnalyzer(const expression_vector& outputColumns) {
+        for (auto& column : outputColumns) {
+            columnNameSet.insert(column->getUniqueName());
+        }
+    }
+
+    void analyze(const expression_vector& predicates) {
+        predicatesDependsOnlyOnOutputColumns.clear();
+        predicatesWithOtherDependencies.clear();
+        for (auto& predicate : predicates) {
+            if (hasExternalDependency(predicate)) {
+                predicatesWithOtherDependencies.push_back(predicate);
+            } else {
+                predicatesDependsOnlyOnOutputColumns.push_back(predicate);
+            }
+        }
+    }
+
+private:
+    bool hasExternalDependency(const std::shared_ptr<Expression>& expression) {
+        auto collector = DependentVarNameCollector();
+        collector.visit(expression);
+        for (auto& name : collector.getVarNames()) {
+            if (!columnNameSet.contains(name)) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+public:
+    expression_vector predicatesDependsOnlyOnOutputColumns;
+    expression_vector predicatesWithOtherDependencies;
+
+private:
+    std::unordered_set<std::string> columnNameSet;
+};
+
+void Planner::planTableFunctionCall(const BoundReadingClause& readingClause, LogicalPlan& plan) {
+    auto& boundCall = readingClause.constCast<BoundTableFunctionCall>();
+    auto analyzer = PredicatesDependencyAnalyzer(boundCall.getBindData()->columns);
+    analyzer.analyze(boundCall.getConjunctivePredicates());
+    KU_ASSERT(boundCall.getTableFunc().getLogicalPlanFunc);
+    boundCall.getTableFunc().getLogicalPlanFunc(this, readingClause,
+        analyzer.predicatesDependsOnlyOnOutputColumns, plan);
+    if (!analyzer.predicatesWithOtherDependencies.empty()) {
+        appendFilters(analyzer.predicatesWithOtherDependencies, plan);
+    }
+}
+
+void Planner::planLoadFrom(const BoundReadingClause& readingClause, LogicalPlan& plan) {
+    auto& loadFrom = readingClause.constCast<BoundLoadFrom>();
+    auto analyzer = PredicatesDependencyAnalyzer(loadFrom.getInfo()->bindData->columns);
+    analyzer.analyze(loadFrom.getConjunctivePredicates());
+    auto op = getTableFunctionCall(*loadFrom.getInfo());
+    planReadOp(std::move(op), analyzer.predicatesDependsOnlyOnOutputColumns, plan);
+    if (!analyzer.predicatesWithOtherDependencies.empty()) {
+        appendFilters(analyzer.predicatesWithOtherDependencies, plan);
+    }
+}
+
+void Planner::planReadOp(std::shared_ptr<LogicalOperator> op, const expression_vector& predicates,
+    LogicalPlan& plan) {
+    if (!plan.isEmpty()) {
+        auto tmpPlan = LogicalPlan();
+        tmpPlan.setLastOperator(std::move(op));
+        if (!predicates.empty()) {
+            appendFilters(predicates, tmpPlan);
+        }
+        appendCrossProduct(plan, tmpPlan, plan);
+    } else {
+        plan.setLastOperator(std::move(op));
+        if (!predicates.empty()) {
+            appendFilters(predicates, plan);
+        }
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_single_query.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_single_query.cpp
new file mode 100644
index 0000000000..a8112350cd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_single_query.cpp
@@ -0,0 +1,48 @@
+#include "binder/expression/property_expression.h"
+#include "binder/visitor/property_collector.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+// Note: we cannot append ResultCollector for plans enumerated for single query before there could
+// be a UNION on top which requires further flatten. So we delay ResultCollector appending to
+// enumerate regular query level.
+LogicalPlan Planner::planSingleQuery(const NormalizedSingleQuery& singleQuery) {
+    auto propertyCollector = PropertyCollector();
+    propertyCollector.visitSingleQuery(singleQuery);
+    auto properties = propertyCollector.getProperties();
+    for (auto& expr : propertyCollector.getProperties()) {
+        auto& property = expr->constCast<PropertyExpression>();
+        propertyExprCollection.addProperties(property.getVariableName(), expr);
+    }
+    context.resetState();
+    auto plan = LogicalPlan();
+    for (auto i = 0u; i < singleQuery.getNumQueryParts(); ++i) {
+        planQueryPart(*singleQuery.getQueryPart(i), plan);
+    }
+    return plan;
+}
+
+void Planner::planQueryPart(const NormalizedQueryPart& queryPart, LogicalPlan& plan) {
+    // plan read
+    for (auto i = 0u; i < queryPart.getNumReadingClause(); i++) {
+        planReadingClause(*queryPart.getReadingClause(i), plan);
+    }
+    // plan update
+    for (auto i = 0u; i < queryPart.getNumUpdatingClause(); ++i) {
+        planUpdatingClause(*queryPart.getUpdatingClause(i), plan);
+    }
+    // plan projection
+    if (queryPart.hasProjectionBody()) {
+        planProjectionBody(queryPart.getProjectionBody(), plan);
+        if (queryPart.hasProjectionBodyPredicate()) {
+            appendFilter(queryPart.getProjectionBodyPredicate(), plan);
+        }
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_subquery.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_subquery.cpp
new file mode 100644
index 0000000000..0c5c29689b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_subquery.cpp
@@ -0,0 +1,308 @@
+#include "binder/expression/expression_util.h"
+#include "binder/expression/subquery_expression.h"
+#include "binder/expression_visitor.h"
+#include "planner/operator/factorization/flatten_resolver.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+static expression_vector getDependentExprs(std::shared_ptr<Expression> expr, const Schema& schema) {
+    auto analyzer = GroupDependencyAnalyzer(true /* collectDependentExpr */, schema);
+    analyzer.visit(expr);
+    return analyzer.getDependentExprs();
+}
+
+expression_vector Planner::getCorrelatedExprs(const QueryGraphCollection& collection,
+    const expression_vector& predicates, Schema* outerSchema) {
+    expression_vector result;
+    for (auto& predicate : predicates) {
+        for (auto& expression : getDependentExprs(predicate, *outerSchema)) {
+            result.push_back(expression);
+        }
+    }
+    for (auto& node : collection.getQueryNodes()) {
+        if (outerSchema->isExpressionInScope(*node->getInternalID())) {
+            result.push_back(node->getInternalID());
+        }
+    }
+    return ExpressionUtil::removeDuplication(result);
+}
+
+class SubqueryPredicatePullUpAnalyzer {
+public:
+    SubqueryPredicatePullUpAnalyzer(const Schema& schema,
+        const QueryGraphCollection& queryGraphCollection)
+        : schema{schema}, queryGraphCollection{queryGraphCollection} {}
+
+    bool analyze(const expression_vector& predicates) {
+        expression_vector correlatedPredicates;
+        for (auto& predicate : predicates) {
+            if (getDependentExprs(predicate, schema).empty()) {
+                nonCorrelatedPredicates.push_back(predicate);
+            } else {
+                correlatedPredicates.push_back(predicate);
+            }
+        }
+        for (auto predicate : correlatedPredicates) {
+            auto [left, right] = analyze(predicate);
+            if (left == nullptr) {
+                return false;
+            }
+            joinConditions.emplace_back(left, right);
+        }
+        for (auto& node : queryGraphCollection.getQueryNodes()) {
+            if (schema.isExpressionInScope(*node->getInternalID())) {
+                joinConditions.emplace_back(node->getInternalID(), node->getInternalID());
+            }
+        }
+        return true;
+    }
+
+    expression_vector getNonCorrelatedPredicates() const { return nonCorrelatedPredicates; }
+    std::vector<binder::expression_pair> getJoinConditions() const { return joinConditions; }
+
+    expression_vector getCorrelatedInternalIDs() const {
+        expression_vector exprs;
+        for (auto& node : queryGraphCollection.getQueryNodes()) {
+            if (schema.isExpressionInScope(*node->getInternalID())) {
+                exprs.push_back(node->getInternalID());
+            }
+        }
+        return exprs;
+    }
+
+private:
+    expression_pair analyze(std::shared_ptr<Expression> predicate) {
+        if (predicate->expressionType != common::ExpressionType::EQUALS) {
+            return {nullptr, nullptr};
+        }
+        auto left = predicate->getChild(0);
+        auto right = predicate->getChild(1);
+        if (isUnnestableJoinCondition(*left, *right)) {
+            return {left, right};
+        }
+        if (isUnnestableJoinCondition(*right, *left)) {
+            return {right, left};
+        }
+        return {nullptr, nullptr};
+    }
+
+    bool isUnnestableJoinCondition(const Expression& left, const Expression& right) {
+        return right.expressionType == ExpressionType::PROPERTY &&
+               schema.isExpressionInScope(left) && !schema.isExpressionInScope(right);
+    }
+
+private:
+    const Schema& schema;
+    const QueryGraphCollection& queryGraphCollection;
+
+    expression_vector nonCorrelatedPredicates;
+    std::vector<binder::expression_pair> joinConditions;
+};
+
+void Planner::planOptionalMatch(const QueryGraphCollection& queryGraphCollection,
+    const expression_vector& predicates, LogicalPlan& leftPlan,
+    std::shared_ptr<BoundJoinHintNode> hint) {
+    planOptionalMatch(queryGraphCollection, predicates, nullptr /* mark */, leftPlan,
+        std::move(hint));
+}
+
+void Planner::planOptionalMatch(const QueryGraphCollection& queryGraphCollection,
+    const expression_vector& predicates, std::shared_ptr<Expression> mark, LogicalPlan& leftPlan,
+    std::shared_ptr<BoundJoinHintNode> hint) {
+    expression_vector correlatedExprs;
+    if (!leftPlan.isEmpty()) {
+        correlatedExprs =
+            getCorrelatedExprs(queryGraphCollection, predicates, leftPlan.getSchema());
+    }
+    auto info = QueryGraphPlanningInfo();
+    info.hint = hint;
+    if (leftPlan.isEmpty()) {
+        // Optional match is the first clause, e.g. OPTIONAL MATCH <pattern> RETURN *
+        info.predicates = predicates;
+        auto plan = planQueryGraphCollection(queryGraphCollection, info);
+        leftPlan.setLastOperator(plan.getLastOperator());
+        appendOptionalAccumulate(mark, leftPlan);
+        return;
+    }
+    if (correlatedExprs.empty()) {
+        // Plan uncorrelated subquery (think of this as a CTE)
+        info.predicates = predicates;
+        auto rightPlan = planQueryGraphCollection(queryGraphCollection, info);
+        if (leftPlan.hasUpdate()) {
+            appendAccOptionalCrossProduct(mark, leftPlan, rightPlan, leftPlan);
+        } else {
+            appendOptionalCrossProduct(mark, leftPlan, rightPlan, leftPlan);
+        }
+        return;
+    }
+    // Plan correlated subquery
+    info.corrExprsCard = leftPlan.getCardinality();
+    auto analyzer = SubqueryPredicatePullUpAnalyzer(*leftPlan.getSchema(), queryGraphCollection);
+    std::vector<expression_pair> joinConditions;
+    LogicalPlan rightPlan;
+    if (analyzer.analyze(predicates)) {
+        // Unnest as left join
+        info.subqueryType = SubqueryPlanningType::UNNEST_CORRELATED;
+        info.corrExprs = analyzer.getCorrelatedInternalIDs();
+        info.predicates = analyzer.getNonCorrelatedPredicates();
+        rightPlan = planQueryGraphCollectionInNewContext(queryGraphCollection, info);
+        joinConditions = analyzer.getJoinConditions();
+    } else {
+        // Unnest as expression scan + distinct & inner join
+        info.subqueryType = SubqueryPlanningType::CORRELATED;
+        info.corrExprs = correlatedExprs;
+        info.predicates = predicates;
+        for (auto& expr : correlatedExprs) {
+            joinConditions.emplace_back(expr, expr);
+        }
+        rightPlan = planQueryGraphCollectionInNewContext(queryGraphCollection, info);
+        appendAccumulate(correlatedExprs, leftPlan);
+    }
+    if (leftPlan.hasUpdate()) {
+        appendAccHashJoin(joinConditions, JoinType::LEFT, mark, leftPlan, rightPlan, leftPlan);
+    } else {
+        appendHashJoin(joinConditions, JoinType::LEFT, mark, leftPlan, rightPlan, leftPlan);
+    }
+}
+
+void Planner::planRegularMatch(const QueryGraphCollection& queryGraphCollection,
+    const expression_vector& predicates, LogicalPlan& leftPlan,
+    std::shared_ptr<BoundJoinHintNode> hint) {
+    expression_vector predicatesToPushDown, predicatesToPullUp;
+    // E.g. MATCH (a) WITH COUNT(*) AS s MATCH (b) WHERE b.age > s
+    // "b.age > s" should be pulled up after both MATCH clauses are joined.
+    for (auto& predicate : predicates) {
+        if (getDependentExprs(predicate, *leftPlan.getSchema()).empty()) {
+            predicatesToPushDown.push_back(predicate);
+        } else {
+            predicatesToPullUp.push_back(predicate);
+        }
+    }
+    auto correlatedExprs =
+        getCorrelatedExprs(queryGraphCollection, predicatesToPushDown, leftPlan.getSchema());
+    auto joinNodeIDs =
+        ExpressionUtil::getExpressionsWithDataType(correlatedExprs, LogicalTypeID::INTERNAL_ID);
+    auto info = QueryGraphPlanningInfo();
+    info.predicates = predicatesToPushDown;
+    info.hint = hint;
+    if (joinNodeIDs.empty()) {
+        info.subqueryType = SubqueryPlanningType::NONE;
+        auto rightPlan = planQueryGraphCollectionInNewContext(queryGraphCollection, info);
+        if (leftPlan.hasUpdate()) {
+            appendCrossProduct(rightPlan, leftPlan, leftPlan);
+        } else {
+            appendCrossProduct(leftPlan, rightPlan, leftPlan);
+        }
+    } else {
+        // TODO(Xiyang): there is a question regarding if we want to plan as a correlated subquery
+        // Multi-part query is actually CTE and CTE can be considered as a subquery but does not
+        // scan from outer.
+        info.subqueryType = SubqueryPlanningType::UNNEST_CORRELATED;
+        info.corrExprs = joinNodeIDs;
+        info.corrExprsCard = leftPlan.getCardinality();
+        auto rightPlan = planQueryGraphCollectionInNewContext(queryGraphCollection, info);
+        if (leftPlan.hasUpdate()) {
+            appendHashJoin(joinNodeIDs, JoinType::INNER, rightPlan, leftPlan, leftPlan);
+        } else {
+            appendHashJoin(joinNodeIDs, JoinType::INNER, leftPlan, rightPlan, leftPlan);
+        }
+    }
+    for (auto& predicate : predicatesToPullUp) {
+        appendFilter(predicate, leftPlan);
+    }
+}
+
+void Planner::planSubquery(const std::shared_ptr<Expression>& expression, LogicalPlan& outerPlan) {
+    KU_ASSERT(expression->expressionType == ExpressionType::SUBQUERY);
+    auto subquery = expression->ptrCast<SubqueryExpression>();
+    auto correlatedExprs = getDependentExprs(expression, *outerPlan.getSchema());
+    auto predicates = subquery->getPredicatesSplitOnAnd();
+    LogicalPlan innerPlan;
+    auto info = QueryGraphPlanningInfo();
+    info.hint = subquery->getHint();
+    if (correlatedExprs.empty()) {
+        // Plan uncorrelated subquery
+        info.subqueryType = SubqueryPlanningType::NONE;
+        info.predicates = predicates;
+        innerPlan =
+            planQueryGraphCollectionInNewContext(*subquery->getQueryGraphCollection(), info);
+        expression_vector emptyHashKeys;
+        auto projectExprs = expression_vector{subquery->getProjectionExpr()};
+        switch (subquery->getSubqueryType()) {
+        case common::SubqueryType::EXISTS: {
+            auto aggregates = expression_vector{subquery->getCountStarExpr()};
+            appendAggregate(emptyHashKeys, aggregates, innerPlan);
+            appendProjection(projectExprs, innerPlan);
+        } break;
+        case common::SubqueryType::COUNT: {
+            appendAggregate(emptyHashKeys, projectExprs, innerPlan);
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+        appendCrossProduct(outerPlan, innerPlan, outerPlan);
+        return;
+    }
+    // Plan correlated subquery
+    info.corrExprsCard = outerPlan.getCardinality();
+    auto analyzer = SubqueryPredicatePullUpAnalyzer(*outerPlan.getSchema(),
+        *subquery->getQueryGraphCollection());
+    std::vector<expression_pair> joinConditions;
+    if (analyzer.analyze(predicates)) {
+        // Unnest as inner join
+        info.subqueryType = SubqueryPlanningType::UNNEST_CORRELATED;
+        info.corrExprs = analyzer.getCorrelatedInternalIDs();
+        info.predicates = analyzer.getNonCorrelatedPredicates();
+        innerPlan =
+            planQueryGraphCollectionInNewContext(*subquery->getQueryGraphCollection(), info);
+        joinConditions = analyzer.getJoinConditions();
+    } else {
+        // Unnest as expression scan + distinct & inner join
+        info.subqueryType = SubqueryPlanningType::CORRELATED;
+        info.corrExprs = correlatedExprs;
+        info.predicates = predicates;
+        for (auto& expr : correlatedExprs) {
+            joinConditions.emplace_back(expr, expr);
+        }
+        innerPlan =
+            planQueryGraphCollectionInNewContext(*subquery->getQueryGraphCollection(), info);
+        appendAccumulate(correlatedExprs, outerPlan);
+    }
+    switch (subquery->getSubqueryType()) {
+    case common::SubqueryType::EXISTS: {
+        appendMarkJoin(joinConditions, expression, outerPlan, innerPlan, outerPlan);
+    } break;
+    case common::SubqueryType::COUNT: {
+        expression_vector hashKeys;
+        for (auto& joinCondition : joinConditions) {
+            hashKeys.push_back(joinCondition.second);
+        }
+        appendAggregate(hashKeys, expression_vector{subquery->getProjectionExpr()}, innerPlan);
+        appendHashJoin(joinConditions, common::JoinType::COUNT, nullptr, outerPlan, innerPlan,
+            outerPlan);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void Planner::planSubqueryIfNecessary(std::shared_ptr<Expression> expression, LogicalPlan& plan) {
+    auto collector = SubqueryExprCollector();
+    collector.visit(expression);
+    if (collector.hasSubquery()) {
+        for (auto& expr : collector.getSubqueryExprs()) {
+            if (plan.getSchema()->isExpressionInScope(*expr)) {
+                continue;
+            }
+            planSubquery(expr, plan);
+        }
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_update.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_update.cpp
new file mode 100644
index 0000000000..eea378b6c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/plan/plan_update.cpp
@@ -0,0 +1,137 @@
+#include "binder/query/updating_clause/bound_delete_clause.h"
+#include "binder/query/updating_clause/bound_insert_clause.h"
+#include "binder/query/updating_clause/bound_merge_clause.h"
+#include "binder/query/updating_clause/bound_set_clause.h"
+#include "planner/operator/persistent/logical_merge.h"
+#include "planner/planner.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+void Planner::planUpdatingClause(const BoundUpdatingClause& updatingClause, LogicalPlan& plan) {
+    switch (updatingClause.getClauseType()) {
+    case ClauseType::INSERT: {
+        planInsertClause(updatingClause, plan);
+        return;
+    }
+    case ClauseType::MERGE: {
+        planMergeClause(updatingClause, plan);
+        return;
+    }
+    case ClauseType::SET: {
+        planSetClause(updatingClause, plan);
+        return;
+    }
+    case ClauseType::DELETE_: {
+        planDeleteClause(updatingClause, plan);
+        return;
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void Planner::planInsertClause(const BoundUpdatingClause& updatingClause, LogicalPlan& plan) {
+    auto& insertClause = updatingClause.constCast<BoundInsertClause>();
+    if (plan.isEmpty()) { // E.g. CREATE (a:Person {age:20})
+        appendDummyScan(plan);
+    } else {
+        appendAccumulate(plan);
+    }
+    if (insertClause.hasNodeInfo()) {
+        appendInsertNode(insertClause.getNodeInfos(), plan);
+    }
+    if (insertClause.hasRelInfo()) {
+        appendInsertRel(insertClause.getRelInfos(), plan);
+    }
+}
+
+void Planner::planMergeClause(const BoundUpdatingClause& updatingClause, LogicalPlan& plan) {
+    auto& mergeClause = updatingClause.constCast<BoundMergeClause>();
+    expression_vector predicates;
+    if (mergeClause.hasPredicate()) {
+        predicates = mergeClause.getPredicate()->splitOnAND();
+    }
+    // Collect merge hash keys. See LogicalMerge for details.
+    expression_vector keys;
+    for (auto& expr : mergeClause.getColumnDataExprs()) {
+        if (expr->expressionType == ExpressionType::LITERAL ||
+            expr->expressionType == ExpressionType::PARAMETER) {
+            continue;
+        }
+        keys.push_back(expr);
+    }
+    if (!plan.isEmpty()) {
+        for (auto& node : mergeClause.getQueryGraphCollection()->getQueryNodes()) {
+            if (plan.getSchema()->isExpressionInScope(*node->getInternalID())) {
+                keys.push_back(node->getInternalID());
+            }
+        }
+    }
+    auto existenceMark = mergeClause.getExistenceMark();
+    planOptionalMatch(*mergeClause.getQueryGraphCollection(), predicates, existenceMark, plan,
+        nullptr /* hint */);
+    auto merge = std::make_shared<LogicalMerge>(existenceMark, keys, plan.getLastOperator());
+    if (mergeClause.hasInsertNodeInfo()) {
+        for (auto& info : mergeClause.getInsertNodeInfos()) {
+            merge->addInsertNodeInfo(createLogicalInsertInfo(info)->copy());
+        }
+    }
+    if (mergeClause.hasInsertRelInfo()) {
+        for (auto& info : mergeClause.getInsertRelInfos()) {
+            merge->addInsertRelInfo(createLogicalInsertInfo(info)->copy());
+        }
+    }
+    if (mergeClause.hasOnCreateSetNodeInfo()) {
+        for (auto& info : mergeClause.getOnCreateSetNodeInfos()) {
+            merge->addOnCreateSetNodeInfo(info.copy());
+        }
+    }
+    if (mergeClause.hasOnCreateSetRelInfo()) {
+        for (auto& info : mergeClause.getOnCreateSetRelInfos()) {
+            merge->addOnCreateSetRelInfo(info.copy());
+        }
+    }
+    if (mergeClause.hasOnMatchSetNodeInfo()) {
+        for (auto& info : mergeClause.getOnMatchSetNodeInfos()) {
+            merge->addOnMatchSetNodeInfo(info.copy());
+        }
+    }
+    if (mergeClause.hasOnMatchSetRelInfo()) {
+        for (auto& info : mergeClause.getOnMatchSetRelInfos()) {
+            merge->addOnMatchSetRelInfo(info.copy());
+        }
+    }
+    appendFlattens(merge->getGroupsPosToFlatten(), plan);
+    merge->setChild(0, plan.getLastOperator());
+    merge->computeFactorizedSchema();
+    plan.setLastOperator(merge);
+}
+
+void Planner::planSetClause(const BoundUpdatingClause& updatingClause, LogicalPlan& plan) {
+    appendAccumulate(plan);
+    auto& setClause = updatingClause.constCast<BoundSetClause>();
+    if (setClause.hasNodeInfo()) {
+        appendSetProperty(setClause.getNodeInfos(), plan);
+    }
+    if (setClause.hasRelInfo()) {
+        appendSetProperty(setClause.getRelInfos(), plan);
+    }
+}
+
+void Planner::planDeleteClause(const BoundUpdatingClause& updatingClause, LogicalPlan& plan) {
+    appendAccumulate(plan);
+    auto& deleteClause = updatingClause.constCast<BoundDeleteClause>();
+    if (deleteClause.hasRelInfo()) {
+        appendDelete(deleteClause.getRelInfos(), plan);
+    }
+    if (deleteClause.hasNodeInfo()) {
+        appendDelete(deleteClause.getNodeInfos(), plan);
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/planner.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/planner.cpp
new file mode 100644
index 0000000000..0f13e7c5f5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/planner.cpp
@@ -0,0 +1,129 @@
+#include "planner/planner.h"
+
+#include "main/client_context.h"
+#include "main/database.h"
+
+using namespace lbug::binder;
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace planner {
+
+bool QueryGraphPlanningInfo::containsCorrExpr(const Expression& expr) const {
+    for (auto& corrExpr : corrExprs) {
+        if (*corrExpr == expr) {
+            return true;
+        }
+    }
+    return false;
+}
+
+expression_vector PropertyExprCollection::getProperties(const Expression& pattern) const {
+    if (!patternNameToProperties.contains(pattern.getUniqueName())) {
+        return binder::expression_vector{};
+    }
+    return patternNameToProperties.at(pattern.getUniqueName());
+}
+
+expression_vector PropertyExprCollection::getProperties() const {
+    expression_vector result;
+    for (auto& [_, exprs] : patternNameToProperties) {
+        for (auto& expr : exprs) {
+            result.push_back(expr);
+        }
+    }
+    return result;
+}
+
+void PropertyExprCollection::addProperties(const std::string& patternName,
+    std::shared_ptr<Expression> property) {
+    if (!patternNameToProperties.contains(patternName)) {
+        patternNameToProperties.insert({patternName, expression_vector{}});
+    }
+    for (auto& p : patternNameToProperties.at(patternName)) {
+        if (*p == *property) {
+            return;
+        }
+    }
+    patternNameToProperties.at(patternName).push_back(property);
+}
+
+void PropertyExprCollection::clear() {
+    patternNameToProperties.clear();
+}
+
+Planner::Planner(main::ClientContext* clientContext)
+    : clientContext{clientContext}, cardinalityEstimator{clientContext}, context{},
+      plannerExtensions{clientContext->getDatabase()->getPlannerExtensions()} {}
+
+LogicalPlan Planner::planStatement(const BoundStatement& statement) {
+    switch (statement.getStatementType()) {
+    case StatementType::QUERY: {
+        return planQuery(statement);
+    }
+    case StatementType::CREATE_TABLE: {
+        return planCreateTable(statement);
+    }
+    case StatementType::CREATE_SEQUENCE: {
+        return planCreateSequence(statement);
+    }
+    case StatementType::CREATE_TYPE: {
+        return planCreateType(statement);
+    }
+    case StatementType::COPY_FROM: {
+        return planCopyFrom(statement);
+    }
+    case StatementType::COPY_TO: {
+        return planCopyTo(statement);
+    }
+    case StatementType::DROP: {
+        return planDrop(statement);
+    }
+    case StatementType::ALTER: {
+        return planAlter(statement);
+    }
+    case StatementType::STANDALONE_CALL: {
+        return planStandaloneCall(statement);
+    }
+    case StatementType::STANDALONE_CALL_FUNCTION: {
+        return planStandaloneCallFunction(statement);
+    }
+    case StatementType::EXPLAIN: {
+        return planExplain(statement);
+    }
+    case StatementType::CREATE_MACRO: {
+        return planCreateMacro(statement);
+    }
+    case StatementType::TRANSACTION: {
+        return planTransaction(statement);
+    }
+    case StatementType::EXTENSION: {
+        return planExtension(statement);
+    }
+    case StatementType::EXPORT_DATABASE: {
+        return planExportDatabase(statement);
+    }
+    case StatementType::IMPORT_DATABASE: {
+        return planImportDatabase(statement);
+    }
+    case StatementType::ATTACH_DATABASE: {
+        return planAttachDatabase(statement);
+    }
+    case StatementType::DETACH_DATABASE: {
+        return planDetachDatabase(statement);
+    }
+    case StatementType::USE_DATABASE: {
+        return planUseDatabase(statement);
+    }
+    case StatementType::EXTENSION_CLAUSE: {
+        return planExtensionClause(statement);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/query_planner.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/query_planner.cpp
new file mode 100644
index 0000000000..d149bdd065
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/query_planner.cpp
@@ -0,0 +1,73 @@
+#include "binder/query/bound_regular_query.h"
+#include "planner/operator/logical_union.h"
+#include "planner/planner.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace planner {
+
+LogicalPlan Planner::planQuery(const BoundStatement& boundStatement) {
+    auto& regularQuery = boundStatement.constCast<BoundRegularQuery>();
+    if (regularQuery.getNumSingleQueries() == 1) {
+        return planSingleQuery(*regularQuery.getSingleQuery(0));
+    }
+    std::vector<LogicalPlan> childrenPlans;
+    for (auto i = 0u; i < regularQuery.getNumSingleQueries(); i++) {
+        childrenPlans.push_back(planSingleQuery(*regularQuery.getSingleQuery(i)));
+    }
+    auto exprs = regularQuery.getStatementResult()->getColumns();
+    return createUnionPlan(childrenPlans, exprs, regularQuery.getIsUnionAll(0));
+}
+
+LogicalPlan Planner::createUnionPlan(std::vector<LogicalPlan>& childrenPlans,
+    const expression_vector& expressions, bool isUnionAll) {
+    KU_ASSERT(!childrenPlans.empty());
+    auto plan = LogicalPlan();
+    std::vector<std::shared_ptr<LogicalOperator>> children;
+    children.reserve(childrenPlans.size());
+    for (auto& childPlan : childrenPlans) {
+        children.push_back(childPlan.getLastOperator());
+    }
+    // we compute the schema based on first child
+    auto union_ = std::make_shared<LogicalUnion>(expressions, std::move(children));
+    for (auto i = 0u; i < childrenPlans.size(); ++i) {
+        appendFlattens(union_->getGroupsPosToFlatten(i), childrenPlans[i]);
+        union_->setChild(i, childrenPlans[i].getLastOperator());
+    }
+    union_->computeFactorizedSchema();
+    plan.setLastOperator(union_);
+    if (!isUnionAll && !expressions.empty()) {
+        appendDistinct(expressions, plan);
+    }
+    return plan;
+}
+
+expression_vector Planner::getProperties(const Expression& pattern) const {
+    KU_ASSERT(pattern.expressionType == ExpressionType::PATTERN);
+    return propertyExprCollection.getProperties(pattern);
+}
+
+JoinOrderEnumeratorContext Planner::enterNewContext() {
+    auto prevContext = std::move(context);
+    context = JoinOrderEnumeratorContext();
+    return prevContext;
+}
+
+void Planner::exitContext(JoinOrderEnumeratorContext prevContext) {
+    context = std::move(prevContext);
+}
+
+PropertyExprCollection Planner::enterNewPropertyExprCollection() {
+    auto prevCollection = std::move(propertyExprCollection);
+    propertyExprCollection = PropertyExprCollection();
+    return prevCollection;
+}
+
+void Planner::exitPropertyExprCollection(PropertyExprCollection collection) {
+    propertyExprCollection = std::move(collection);
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/planner/subplans_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/subplans_table.cpp
new file mode 100644
index 0000000000..48e8335360
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/planner/subplans_table.cpp
@@ -0,0 +1,113 @@
+#include "planner/subplans_table.h"
+
+using namespace lbug::binder;
+
+namespace lbug {
+namespace planner {
+
+SubgraphPlans::SubgraphPlans(const SubqueryGraph& subqueryGraph) {
+    for (auto i = 0u; i < subqueryGraph.queryGraph.getNumQueryNodes(); ++i) {
+        if (subqueryGraph.queryNodesSelector[i]) {
+            nodeIDsToEncode.push_back(subqueryGraph.queryGraph.getQueryNode(i)->getInternalID());
+        }
+    }
+    maxCost = UINT64_MAX;
+}
+
+void SubgraphPlans::addPlan(LogicalPlan plan) {
+    if (plans.size() > MAX_NUM_PLANS) {
+        return;
+    }
+    auto planCode = encodePlan(plan);
+    if (!encodedPlan2PlanIdx.contains(planCode)) {
+        encodedPlan2PlanIdx.insert({planCode, plans.size()});
+        if (maxCost == UINT64_MAX || plan.getCost() > maxCost) { // update max cost
+            maxCost = plan.getCost();
+        }
+        plans.push_back(std::move(plan));
+    } else {
+        auto planIdx = encodedPlan2PlanIdx.at(planCode);
+        if (plan.getCost() < plans[planIdx].getCost()) {
+            if (plans[planIdx].getCost() == maxCost) { // update max cost
+                maxCost = 0;
+                for (auto& plan_ : plans) {
+                    if (plan_.getCost() > maxCost) {
+                        maxCost = plan_.getCost();
+                    }
+                }
+            }
+            plans[planIdx] = std::move(plan);
+        }
+    }
+}
+
+std::bitset<MAX_NUM_QUERY_VARIABLES> SubgraphPlans::encodePlan(const LogicalPlan& plan) {
+    auto schema = plan.getSchema();
+    std::bitset<MAX_NUM_QUERY_VARIABLES> result;
+    result.reset();
+    for (auto i = 0u; i < nodeIDsToEncode.size(); ++i) {
+        result[i] = schema->getGroup(schema->getGroupPos(*nodeIDsToEncode[i]))->isFlat();
+    }
+    return result;
+}
+
+std::vector<SubqueryGraph> DPLevel::getSubqueryGraphs() {
+    std::vector<SubqueryGraph> result;
+    for (auto& [subGraph, _] : subgraph2Plans) {
+        result.push_back(subGraph);
+    }
+    return result;
+}
+
+void DPLevel::addPlan(const SubqueryGraph& subqueryGraph, LogicalPlan plan) {
+    if (subgraph2Plans.size() > MAX_NUM_SUBGRAPH) {
+        return;
+    }
+    if (!contains(subqueryGraph)) {
+        subgraph2Plans.insert({subqueryGraph, SubgraphPlans(subqueryGraph)});
+    }
+    subgraph2Plans.at(subqueryGraph).addPlan(std::move(plan));
+}
+
+void SubPlansTable::resize(uint32_t newSize) {
+    auto prevSize = dpLevels.size();
+    dpLevels.resize(newSize);
+    for (auto i = prevSize; i < newSize; ++i) {
+        dpLevels[i] = DPLevel();
+    }
+}
+
+uint64_t SubPlansTable::getMaxCost(const SubqueryGraph& subqueryGraph) const {
+    return containSubgraphPlans(subqueryGraph) ?
+               getDPLevel(subqueryGraph).getSubgraphPlans(subqueryGraph).getMaxCost() :
+               UINT64_MAX;
+}
+
+bool SubPlansTable::containSubgraphPlans(const SubqueryGraph& subqueryGraph) const {
+    return getDPLevel(subqueryGraph).contains(subqueryGraph);
+}
+
+const std::vector<LogicalPlan>& SubPlansTable::getSubgraphPlans(
+    const SubqueryGraph& subqueryGraph) const {
+    auto& dpLevel = getDPLevel(subqueryGraph);
+    KU_ASSERT(dpLevel.contains(subqueryGraph));
+    return dpLevel.getSubgraphPlans(subqueryGraph).getPlans();
+}
+
+std::vector<SubqueryGraph> SubPlansTable::getSubqueryGraphs(uint32_t level) {
+    return dpLevels[level].getSubqueryGraphs();
+}
+
+void SubPlansTable::addPlan(const SubqueryGraph& subqueryGraph, LogicalPlan plan) {
+    auto& dpLevel = getDPLevelUnsafe(subqueryGraph);
+    dpLevel.addPlan(subqueryGraph, std::move(plan));
+}
+
+void SubPlansTable::clear() {
+    for (auto& dpLevel : dpLevels) {
+        dpLevel.clear();
+    }
+}
+
+} // namespace planner
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/CMakeLists.txt
new file mode 100644
index 0000000000..3b9a277895
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/CMakeLists.txt
@@ -0,0 +1,13 @@
+add_subdirectory(map)
+add_subdirectory(operator)
+add_subdirectory(result)
+
+add_library(lbug_processor
+        OBJECT
+        warning_context.cpp
+        processor.cpp
+        processor_task.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/CMakeLists.txt
new file mode 100644
index 0000000000..3bd69011e4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/CMakeLists.txt
@@ -0,0 +1,51 @@
+add_library(lbug_processor_mapper
+        OBJECT
+        create_arrow_result_collector.cpp
+        create_factorized_table_scan.cpp
+        create_result_collector.cpp
+        expression_mapper.cpp
+        map_acc_hash_join.cpp
+        map_accumulate.cpp
+        map_aggregate.cpp
+        map_standalone_call.cpp
+        map_table_function_call.cpp
+        map_copy_to.cpp
+        map_copy_from.cpp
+        map_insert.cpp
+        map_create_macro.cpp
+        map_cross_product.cpp
+        map_ddl.cpp
+        map_delete.cpp
+        map_distinct.cpp
+        map_explain.cpp
+        map_expressions_scan.cpp
+        map_dummy_scan.cpp
+        map_dummy_sink.cpp
+        map_empty_result.cpp
+        map_extend.cpp
+        map_filter.cpp
+        map_flatten.cpp
+        map_hash_join.cpp
+        map_index_scan_node.cpp
+        map_intersect.cpp
+        map_label_filter.cpp
+        map_limit.cpp
+        map_merge.cpp
+        map_multiplicity_reducer.cpp
+        map_noop.cpp
+        map_order_by.cpp
+        map_path_property_probe.cpp
+        map_projection.cpp
+        map_recursive_extend.cpp
+        map_scan_node_table.cpp
+        map_semi_masker.cpp
+        map_set.cpp
+        map_simple.cpp
+        map_transaction.cpp
+        map_union.cpp
+        map_unwind.cpp
+        plan_mapper.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_mapper>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/create_arrow_result_collector.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/create_arrow_result_collector.cpp
new file mode 100644
index 0000000000..1a044b6a0e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/create_arrow_result_collector.cpp
@@ -0,0 +1,29 @@
+#include "processor/operator/arrow_result_collector.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::createArrowResultCollector(
+    ArrowResultConfig arrowConfig, const binder::expression_vector& expressions,
+    planner::Schema* schema, std::unique_ptr<PhysicalOperator> prevOperator) {
+    std::vector<DataPos> columnDataPos;
+    std::vector<LogicalType> columnTypes;
+    for (auto& expr : expressions) {
+        columnDataPos.push_back(getDataPos(*expr, *schema));
+        columnTypes.push_back(expr->getDataType().copy());
+    }
+    auto sharedState = std::make_shared<ArrowResultCollectorSharedState>();
+    auto opInfo =
+        ArrowResultCollectorInfo(arrowConfig.chunkSize, columnDataPos, std::move(columnTypes));
+    auto printInfo = OPPrintInfo::EmptyInfo();
+    auto op = std::make_unique<ArrowResultCollector>(sharedState, std::move(opInfo),
+        std::move(prevOperator), getOperatorID(), std::move(printInfo));
+    op->setDescriptor(std::make_unique<ResultSetDescriptor>(schema));
+    return op;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/create_factorized_table_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/create_factorized_table_scan.cpp
new file mode 100644
index 0000000000..702d2569e7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/create_factorized_table_scan.cpp
@@ -0,0 +1,90 @@
+#include "processor/operator/table_function_call.h"
+#include "processor/operator/table_scan/ftable_scan_function.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::binder;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::createFTableScan(const expression_vector& exprs,
+    std::vector<ft_col_idx_t> colIndices, const Schema* schema,
+    std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize, physical_op_vector_t children) {
+    std::vector<DataPos> outPosV;
+    if (!exprs.empty()) {
+        KU_ASSERT(schema);
+        outPosV = getDataPos(exprs, *schema);
+    }
+    auto function = FTableScan::getFunction();
+    auto bindData =
+        std::make_unique<FTableScanBindData>(table, std::move(colIndices), maxMorselSize);
+    auto info = TableFunctionCallInfo();
+    info.function = *function->copy();
+    info.bindData = std::move(bindData);
+    info.outPosV = std::move(outPosV);
+    auto initInput = TableFuncInitSharedStateInput(info.bindData.get(), executionContext);
+    auto sharedState = info.function.initSharedStateFunc(initInput);
+    auto printInfo = std::make_unique<TableFunctionCallPrintInfo>(function->name, exprs);
+    auto result = std::make_unique<TableFunctionCall>(std::move(info), sharedState, getOperatorID(),
+        std::move(printInfo));
+    for (auto& child : children) {
+        result->addChild(std::move(child));
+    }
+    return result;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::createFTableScan(const expression_vector& exprs,
+    const std::vector<ft_col_idx_t>& colIndices, const Schema* schema,
+    std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize) {
+    physical_op_vector_t children;
+    return createFTableScan(exprs, colIndices, schema, std::move(table), maxMorselSize,
+        std::move(children));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::createEmptyFTableScan(
+    std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize, physical_op_vector_t children) {
+    return createFTableScan(expression_vector{}, std::vector<ft_col_idx_t>{}, nullptr /* schema */,
+        std::move(table), maxMorselSize, std::move(children));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::createEmptyFTableScan(
+    std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize,
+    std::unique_ptr<PhysicalOperator> child) {
+    physical_op_vector_t children;
+    children.push_back(std::move(child));
+    return createFTableScan(expression_vector{}, std::vector<ft_col_idx_t>{}, nullptr /* schema */,
+        std::move(table), maxMorselSize, std::move(children));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::createEmptyFTableScan(
+    std::shared_ptr<FactorizedTable> table, uint64_t maxMorselSize) {
+    physical_op_vector_t children;
+    return createFTableScan(expression_vector{}, std::vector<ft_col_idx_t>{}, nullptr /* schema */,
+        std::move(table), maxMorselSize, std::move(children));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::createFTableScanAligned(
+    const expression_vector& exprs, const Schema* schema, std::shared_ptr<FactorizedTable> table,
+    uint64_t maxMorselSize, physical_op_vector_t children) {
+    std::vector<ft_col_idx_t> colIndices;
+    colIndices.reserve(exprs.size());
+    for (auto i = 0u; i < exprs.size(); ++i) {
+        colIndices.push_back(i);
+    }
+    return createFTableScan(exprs, std::move(colIndices), schema, std::move(table), maxMorselSize,
+        std::move(children));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::createFTableScanAligned(
+    const expression_vector& exprs, const Schema* schema, std::shared_ptr<FactorizedTable> table,
+    uint64_t maxMorselSize) {
+    physical_op_vector_t children;
+    return createFTableScanAligned(exprs, schema, std::move(table), maxMorselSize,
+        std::move(children));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/create_result_collector.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/create_result_collector.cpp
new file mode 100644
index 0000000000..1111e31c9e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/create_result_collector.cpp
@@ -0,0 +1,38 @@
+#include "processor/operator/result_collector.h"
+#include "processor/plan_mapper.h"
+#include "processor/result/factorized_table_util.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<ResultCollector> PlanMapper::createResultCollector(AccumulateType accumulateType,
+    const expression_vector& expressions, Schema* schema,
+    std::unique_ptr<PhysicalOperator> prevOperator) {
+    std::vector<DataPos> payloadsPos;
+    for (auto& expr : expressions) {
+        payloadsPos.push_back(getDataPos(*expr, *schema));
+    }
+    auto tableSchema = FactorizedTableUtils::createFTableSchema(expressions, *schema);
+    if (accumulateType == AccumulateType::OPTIONAL_) {
+        auto columnSchema = ColumnSchema(false /* isUnFlat */, INVALID_DATA_CHUNK_POS,
+            LogicalTypeUtils::getRowLayoutSize(LogicalType::BOOL()));
+        tableSchema.appendColumn(std::move(columnSchema));
+    }
+    auto table = std::make_shared<FactorizedTable>(storage::MemoryManager::Get(*clientContext),
+        tableSchema.copy());
+    auto sharedState = std::make_shared<ResultCollectorSharedState>(std::move(table));
+    auto opInfo = ResultCollectorInfo(accumulateType, std::move(tableSchema), payloadsPos);
+    auto printInfo = std::make_unique<ResultCollectorPrintInfo>(expressions, accumulateType);
+    auto op = std::make_unique<ResultCollector>(std::move(opInfo), std::move(sharedState),
+        std::move(prevOperator), getOperatorID(), std::move(printInfo));
+    op->setDescriptor(std::make_unique<ResultSetDescriptor>(schema));
+    return op;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/expression_mapper.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/expression_mapper.cpp
new file mode 100644
index 0000000000..08e68aadd0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/expression_mapper.cpp
@@ -0,0 +1,215 @@
+#include "processor/expression_mapper.h"
+
+#include "binder/expression/case_expression.h"
+#include "binder/expression/expression_util.h"
+#include "binder/expression/lambda_expression.h"
+#include "binder/expression/literal_expression.h"
+#include "binder/expression/node_expression.h"
+#include "binder/expression/parameter_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "binder/expression_visitor.h" // IWYU pragma: keep (used in assert)
+#include "common/exception/not_implemented.h"
+#include "common/string_format.h"
+#include "expression_evaluator/case_evaluator.h"
+#include "expression_evaluator/function_evaluator.h"
+#include "expression_evaluator/lambda_evaluator.h"
+#include "expression_evaluator/literal_evaluator.h"
+#include "expression_evaluator/path_evaluator.h"
+#include "expression_evaluator/pattern_evaluator.h"
+#include "expression_evaluator/reference_evaluator.h"
+#include "planner/operator/schema.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::evaluator;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+static bool canEvaluateAsFunction(ExpressionType expressionType) {
+    switch (expressionType) {
+    case ExpressionType::OR:
+    case ExpressionType::XOR:
+    case ExpressionType::AND:
+    case ExpressionType::NOT:
+    case ExpressionType::EQUALS:
+    case ExpressionType::NOT_EQUALS:
+    case ExpressionType::GREATER_THAN:
+    case ExpressionType::GREATER_THAN_EQUALS:
+    case ExpressionType::LESS_THAN:
+    case ExpressionType::LESS_THAN_EQUALS:
+    case ExpressionType::IS_NULL:
+    case ExpressionType::IS_NOT_NULL:
+    case ExpressionType::FUNCTION:
+        return true;
+    default:
+        return false;
+    }
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getEvaluator(
+    std::shared_ptr<Expression> expression) {
+    if (schema == nullptr) {
+        return getConstantEvaluator(std::move(expression));
+    }
+    auto expressionType = expression->expressionType;
+    if (schema->isExpressionInScope(*expression)) {
+        return getReferenceEvaluator(std::move(expression));
+    } else if (ExpressionType::LITERAL == expressionType) {
+        return getLiteralEvaluator(std::move(expression));
+    } else if (ExpressionUtil::isNodePattern(*expression)) {
+        return getNodeEvaluator(std::move(expression));
+    } else if (ExpressionUtil::isRelPattern(*expression)) {
+        return getRelEvaluator(std::move(expression));
+    } else if (expressionType == ExpressionType::PATH) {
+        return getPathEvaluator(std::move(expression));
+    } else if (expressionType == ExpressionType::PARAMETER) {
+        return getParameterEvaluator(std::move(expression));
+    } else if (expressionType == ExpressionType::CASE_ELSE) {
+        return getCaseEvaluator(std::move(expression));
+    } else if (canEvaluateAsFunction(expressionType)) {
+        return getFunctionEvaluator(std::move(expression));
+    } else if (parentEvaluator != nullptr) {
+        return getLambdaParamEvaluator(std::move(expression));
+    } else {
+        // LCOV_EXCL_START
+        throw NotImplementedException(stringFormat("Cannot evaluate expression with type {}.",
+            ExpressionTypeUtil::toString(expressionType)));
+        // LCOV_EXCL_STOP
+    }
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getConstantEvaluator(
+    std::shared_ptr<Expression> expression) {
+    KU_ASSERT(ConstantExpressionVisitor::isConstant(*expression));
+    auto expressionType = expression->expressionType;
+    if (ExpressionType::LITERAL == expressionType) {
+        return getLiteralEvaluator(std::move(expression));
+    } else if (ExpressionType::CASE_ELSE == expressionType) {
+        return getCaseEvaluator(std::move(expression));
+    } else if (canEvaluateAsFunction(expressionType)) {
+        return getFunctionEvaluator(std::move(expression));
+    } else {
+        // LCOV_EXCL_START
+        throw NotImplementedException(stringFormat("Cannot evaluate expression with type {}.",
+            ExpressionTypeUtil::toString(expressionType)));
+        // LCOV_EXCL_STOP
+    }
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getLiteralEvaluator(
+    std::shared_ptr<Expression> expression) {
+    auto& literalExpression = expression->constCast<LiteralExpression>();
+    return std::make_unique<LiteralExpressionEvaluator>(std::move(expression),
+        literalExpression.getValue());
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getParameterEvaluator(
+    std::shared_ptr<Expression> expression) {
+    auto& parameterExpression = expression->constCast<ParameterExpression>();
+    return std::make_unique<LiteralExpressionEvaluator>(std::move(expression),
+        parameterExpression.getValue());
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getReferenceEvaluator(
+    std::shared_ptr<Expression> expression) const {
+    KU_ASSERT(schema != nullptr);
+    auto vectorPos = DataPos(schema->getExpressionPos(*expression));
+    auto expressionGroup = schema->getGroup(expression->getUniqueName());
+    return std::make_unique<ReferenceExpressionEvaluator>(std::move(expression),
+        expressionGroup->isFlat(), vectorPos);
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getLambdaParamEvaluator(
+    std::shared_ptr<Expression> expression) {
+    return std::make_unique<LambdaParamEvaluator>(std::move(expression));
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getCaseEvaluator(
+    std::shared_ptr<Expression> expression) {
+    auto caseExpression = reinterpret_cast<CaseExpression*>(expression.get());
+    std::vector<CaseAlternativeEvaluator> alternativeEvaluators;
+    for (auto i = 0u; i < caseExpression->getNumCaseAlternatives(); ++i) {
+        auto alternative = caseExpression->getCaseAlternative(i);
+        auto whenEvaluator = getEvaluator(alternative->whenExpression);
+        auto thenEvaluator = getEvaluator(alternative->thenExpression);
+        alternativeEvaluators.push_back(
+            CaseAlternativeEvaluator(std::move(whenEvaluator), std::move(thenEvaluator)));
+    }
+    auto elseEvaluator = getEvaluator(caseExpression->getElseExpression());
+    return std::make_unique<CaseExpressionEvaluator>(std::move(expression),
+        std::move(alternativeEvaluators), std::move(elseEvaluator));
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getFunctionEvaluator(
+    std::shared_ptr<Expression> expression) {
+    evaluator_vector_t childrenEvaluators;
+    if (expression->getNumChildren() == 2 &&
+        expression->getChild(1)->expressionType == ExpressionType::LAMBDA) {
+        childrenEvaluators.push_back(getEvaluator(expression->getChild(0)));
+        auto result =
+            std::make_unique<ListLambdaEvaluator>(expression, std::move(childrenEvaluators));
+        auto recursiveExprMapper = ExpressionMapper(schema, result.get());
+        auto& lambdaExpr = expression->getChild(1)->constCast<LambdaExpression>();
+        result->setLambdaRootEvaluator(
+            recursiveExprMapper.getEvaluator(lambdaExpr.getFunctionExpr()));
+        return result;
+    }
+    childrenEvaluators = getEvaluators(expression->getChildren());
+    return std::make_unique<FunctionExpressionEvaluator>(std::move(expression),
+        std::move(childrenEvaluators));
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getNodeEvaluator(
+    std::shared_ptr<Expression> expression) {
+    auto node = expression->constPtrCast<NodeExpression>();
+    expression_vector children;
+    children.push_back(node->getInternalID());
+    children.push_back(node->getLabelExpression());
+    for (auto& property : node->getPropertyExpressions()) {
+        children.push_back(property);
+    }
+    auto childrenEvaluators = getEvaluators(children);
+    return std::make_unique<PatternExpressionEvaluator>(std::move(expression),
+        std::move(childrenEvaluators));
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getRelEvaluator(
+    std::shared_ptr<Expression> expression) {
+    auto rel = expression->constPtrCast<RelExpression>();
+    expression_vector children;
+    children.push_back(rel->getSrcNode()->getInternalID());
+    children.push_back(rel->getDstNode()->getInternalID());
+    children.push_back(rel->getLabelExpression());
+    for (auto& property : rel->getPropertyExpressions()) {
+        children.push_back(property);
+    }
+    auto childrenEvaluators = getEvaluators(children);
+    if (rel->hasDirectionExpr()) {
+        auto directionEvaluator = getEvaluator(rel->getDirectionExpr());
+        return std::make_unique<UndirectedRelExpressionEvaluator>(std::move(expression),
+            std::move(childrenEvaluators), std::move(directionEvaluator));
+    }
+    return std::make_unique<PatternExpressionEvaluator>(std::move(expression),
+        std::move(childrenEvaluators));
+}
+
+std::unique_ptr<ExpressionEvaluator> ExpressionMapper::getPathEvaluator(
+    std::shared_ptr<Expression> expression) {
+    auto children = getEvaluators(expression->getChildren());
+    return std::make_unique<PathExpressionEvaluator>(std::move(expression), std::move(children));
+}
+
+std::vector<std::unique_ptr<ExpressionEvaluator>> ExpressionMapper::getEvaluators(
+    const expression_vector& expressions) {
+    std::vector<std::unique_ptr<ExpressionEvaluator>> evaluators;
+    evaluators.reserve(expressions.size());
+    for (auto& expression : expressions) {
+        evaluators.push_back(getEvaluator(expression));
+    }
+    return evaluators;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_acc_hash_join.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_acc_hash_join.cpp
new file mode 100644
index 0000000000..72970ad41f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_acc_hash_join.cpp
@@ -0,0 +1,24 @@
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+static PhysicalOperator* getTableScan(const PhysicalOperator* joinRoot) {
+    auto op = joinRoot->getChild(0);
+    while (op->getOperatorType() != PhysicalOperatorType::TABLE_FUNCTION_CALL) {
+        KU_ASSERT(op->getNumChildren() != 0);
+        op = op->getChild(0);
+    }
+    return op;
+}
+
+void PlanMapper::mapSIPJoin(PhysicalOperator* joinRoot) {
+    auto tableScan = getTableScan(joinRoot);
+    auto resultCollector = tableScan->moveUnaryChild();
+    joinRoot->addChild(std::move(resultCollector));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_accumulate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_accumulate.cpp
new file mode 100644
index 0000000000..edc222dff8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_accumulate.cpp
@@ -0,0 +1,33 @@
+#include "common/system_config.h"
+#include "planner/operator/logical_accumulate.h"
+#include "processor/operator/result_collector.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapAccumulate(
+    const LogicalOperator* logicalOperator) {
+    const auto& acc = logicalOperator->constCast<LogicalAccumulate>();
+    auto outSchema = acc.getSchema();
+    auto inSchema = acc.getChild(0)->getSchema();
+    auto prevOperator = mapOperator(acc.getChild(0).get());
+    auto expressions = acc.getPayloads();
+    auto resultCollector = createResultCollector(acc.getAccumulateType(), expressions, inSchema,
+        std::move(prevOperator));
+    auto table = resultCollector->getResultFTable();
+    auto maxMorselSize = table->hasUnflatCol() ? 1 : DEFAULT_VECTOR_CAPACITY;
+    if (acc.hasMark()) {
+        expressions.push_back(acc.getMark());
+    }
+    physical_op_vector_t children;
+    children.push_back(std::move(resultCollector));
+    return createFTableScanAligned(expressions, outSchema, table, maxMorselSize,
+        std::move(children));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_aggregate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_aggregate.cpp
new file mode 100644
index 0000000000..5d01d37473
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_aggregate.cpp
@@ -0,0 +1,227 @@
+#include "binder/expression/aggregate_function_expression.h"
+#include "common/copy_constructors.h"
+#include "common/types/types.h"
+#include "planner/operator/logical_aggregate.h"
+#include "processor/operator/aggregate/hash_aggregate.h"
+#include "processor/operator/aggregate/hash_aggregate_scan.h"
+#include "processor/operator/aggregate/simple_aggregate.h"
+#include "processor/operator/aggregate/simple_aggregate_scan.h"
+#include "processor/plan_mapper.h"
+#include "processor/result/result_set_descriptor.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::function;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+static std::vector<AggregateInfo> getAggregateInputInfos(const expression_vector& keys,
+    const expression_vector& aggregates, const Schema& schema) {
+    // Collect unFlat groups from
+    std::unordered_set<f_group_pos> groupByGroupPosSet;
+    for (auto& expression : keys) {
+        groupByGroupPosSet.insert(schema.getGroupPos(*expression));
+    }
+    std::unordered_set<f_group_pos> unFlatAggregateGroupPosSet;
+    for (auto groupPos : schema.getGroupsPosInScope()) {
+        if (groupByGroupPosSet.contains(groupPos)) {
+            continue;
+        }
+        if (schema.getGroup(groupPos)->isFlat()) {
+            continue;
+        }
+        unFlatAggregateGroupPosSet.insert(groupPos);
+    }
+    std::vector<AggregateInfo> result;
+    for (auto& expression : aggregates) {
+        auto aggregateVectorPos = DataPos::getInvalidPos();
+        if (expression->getNumChildren() != 0) { // COUNT(*) has no children
+            auto child = expression->getChild(0);
+            aggregateVectorPos = DataPos{schema.getExpressionPos(*child)};
+        }
+        std::vector<data_chunk_pos_t> multiplicityChunksPos;
+        for (auto& groupPos : unFlatAggregateGroupPosSet) {
+            if (groupPos != aggregateVectorPos.dataChunkPos) {
+                multiplicityChunksPos.push_back(groupPos);
+            }
+        }
+        auto aggExpr = expression->constPtrCast<AggregateFunctionExpression>();
+        auto distinctAggKeyType = aggExpr->isDistinct() ?
+                                      expression->getChild(0)->getDataType().copy() :
+                                      LogicalType::ANY();
+        result.emplace_back(aggregateVectorPos, std::move(multiplicityChunksPos),
+            std::move(distinctAggKeyType));
+    }
+    return result;
+}
+
+static expression_vector getKeyExpressions(const expression_vector& expressions,
+    const Schema& schema, bool isFlat) {
+    expression_vector result;
+    for (auto& expression : expressions) {
+        if (schema.getGroup(schema.getGroupPos(*expression))->isFlat() == isFlat) {
+            result.emplace_back(expression);
+        }
+    }
+    return result;
+}
+
+static std::vector<AggregateFunction> getAggFunctions(const expression_vector& aggregates) {
+    std::vector<AggregateFunction> aggregateFunctions;
+    for (auto& expression : aggregates) {
+        auto aggExpr = expression->constPtrCast<AggregateFunctionExpression>();
+        aggregateFunctions.push_back(aggExpr->getFunction().copy());
+    }
+    return aggregateFunctions;
+}
+
+static void writeAggResultWithNullToVector(ValueVector& vector, uint64_t pos,
+    AggregateState* aggregateState) {
+    auto isNull = aggregateState->constCast<AggregateStateWithNull>().isNull;
+    vector.setNull(pos, isNull);
+    if (!isNull) {
+        aggregateState->writeToVector(&vector, pos);
+    }
+}
+
+static void writeAggResultWithoutNullToVector(ValueVector& vector, uint64_t pos,
+    AggregateState* aggregateState) {
+    vector.setNull(pos, false);
+    aggregateState->writeToVector(&vector, pos);
+}
+
+static std::vector<move_agg_result_to_vector_func> getMoveAggResultToVectorFuncs(
+    std::vector<AggregateFunction>& aggregateFunctions) {
+    std::vector<move_agg_result_to_vector_func> moveAggResultToVectorFuncs;
+    for (auto& aggregateFunction : aggregateFunctions) {
+        if (aggregateFunction.needToHandleNulls) {
+            moveAggResultToVectorFuncs.push_back(writeAggResultWithoutNullToVector);
+        } else {
+            moveAggResultToVectorFuncs.push_back(writeAggResultWithNullToVector);
+        }
+    }
+    return moveAggResultToVectorFuncs;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapAggregate(const LogicalOperator* logicalOperator) {
+    auto& agg = logicalOperator->constCast<LogicalAggregate>();
+    auto aggregates = agg.getAggregates();
+    auto outSchema = agg.getSchema();
+    auto child = agg.getChild(0).get();
+    auto inSchema = child->getSchema();
+    auto prevOperator = mapOperator(child);
+    if (agg.hasKeys()) {
+        return createHashAggregate(agg.getKeys(), agg.getDependentKeys(), aggregates, inSchema,
+            outSchema, std::move(prevOperator));
+    }
+    auto aggFunctions = getAggFunctions(aggregates);
+    auto aggOutputPos = getDataPos(aggregates, *outSchema);
+    auto aggregateInputInfos = getAggregateInputInfos(agg.getAllKeys(), aggregates, *inSchema);
+    auto sharedState =
+        make_shared<SimpleAggregateSharedState>(clientContext, aggFunctions, aggregateInputInfos);
+    auto printInfo = std::make_unique<SimpleAggregatePrintInfo>(aggregates);
+    auto aggregate = make_unique<SimpleAggregate>(sharedState, std::move(aggFunctions),
+        copyVector(aggregateInputInfos), std::move(prevOperator), getOperatorID(),
+        printInfo->copy());
+    aggregate->setDescriptor(std::make_unique<ResultSetDescriptor>(inSchema));
+    auto finalizer = std::make_unique<SimpleAggregateFinalize>(sharedState,
+        std::move(aggregateInputInfos), getOperatorID(), printInfo->copy());
+    finalizer->addChild(std::move(aggregate));
+    aggFunctions = getAggFunctions(aggregates);
+    auto scan = std::make_unique<SimpleAggregateScan>(sharedState,
+        AggregateScanInfo{std::move(aggOutputPos), getMoveAggResultToVectorFuncs(aggFunctions)},
+        getOperatorID(), printInfo->copy());
+    scan->addChild(std::move(finalizer));
+    return scan;
+}
+
+static FactorizedTableSchema getFactorizedTableSchema(const expression_vector& flatKeys,
+    const expression_vector& unFlatKeys, const expression_vector& payloads,
+    const std::vector<AggregateFunction>& aggregateFunctions) {
+    auto isUnFlat = false;
+    auto groupID = 0u;
+    auto tableSchema = FactorizedTableSchema();
+    for (auto& flatKey : flatKeys) {
+        auto size = LogicalTypeUtils::getRowLayoutSize(flatKey->dataType);
+        tableSchema.appendColumn(ColumnSchema(isUnFlat, groupID, size));
+    }
+    for (auto& unFlatKey : unFlatKeys) {
+        auto size = LogicalTypeUtils::getRowLayoutSize(unFlatKey->dataType);
+        tableSchema.appendColumn(ColumnSchema(isUnFlat, groupID, size));
+    }
+    for (auto& payload : payloads) {
+        auto size = LogicalTypeUtils::getRowLayoutSize(payload->dataType);
+        tableSchema.appendColumn(ColumnSchema(isUnFlat, groupID, size));
+    }
+    for (auto& aggregateFunc : aggregateFunctions) {
+        tableSchema.appendColumn(
+            ColumnSchema(isUnFlat, groupID, aggregateFunc.getAggregateStateSize()));
+    }
+    tableSchema.appendColumn(ColumnSchema(isUnFlat, groupID, sizeof(hash_t)));
+    return tableSchema;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::createDistinctHashAggregate(
+    const expression_vector& keys, const expression_vector& payloads, Schema* inSchema,
+    Schema* outSchema, std::unique_ptr<PhysicalOperator> prevOperator) {
+    return createHashAggregate(keys, payloads, expression_vector{} /* aggregates */, inSchema,
+        outSchema, std::move(prevOperator));
+}
+
+// Payloads are also group by keys except that they are functional dependent on keys so we don't
+// need to hash or compare payloads.
+std::unique_ptr<PhysicalOperator> PlanMapper::createHashAggregate(const expression_vector& keys,
+    const expression_vector& payloads, const expression_vector& aggregates, Schema* inSchema,
+    Schema* outSchema, std::unique_ptr<PhysicalOperator> prevOperator) {
+    // Create hash aggregate
+    auto aggFunctions = getAggFunctions(aggregates);
+    expression_vector allKeys;
+    allKeys.insert(allKeys.end(), keys.begin(), keys.end());
+    allKeys.insert(allKeys.end(), payloads.begin(), payloads.end());
+    auto aggregateInputInfos = getAggregateInputInfos(allKeys, aggregates, *inSchema);
+    auto flatKeys = getKeyExpressions(keys, *inSchema, true /* isFlat */);
+    auto unFlatKeys = getKeyExpressions(keys, *inSchema, false /* isFlat */);
+    std::vector<LogicalType> keyTypes, payloadTypes;
+    for (auto& key : flatKeys) {
+        keyTypes.push_back(key->getDataType().copy());
+    }
+    for (auto& key : unFlatKeys) {
+        keyTypes.push_back(key->getDataType().copy());
+    }
+    for (auto& payload : payloads) {
+        payloadTypes.push_back(payload->getDataType().copy());
+    }
+    auto tableSchema = getFactorizedTableSchema(flatKeys, unFlatKeys, payloads, aggFunctions);
+    HashAggregateInfo aggregateInfo{getDataPos(flatKeys, *inSchema),
+        getDataPos(unFlatKeys, *inSchema), getDataPos(payloads, *inSchema), std::move(tableSchema)};
+
+    auto sharedState =
+        std::make_shared<HashAggregateSharedState>(clientContext, std::move(aggregateInfo),
+            aggFunctions, aggregateInputInfos, std::move(keyTypes), std::move(payloadTypes));
+    auto printInfo = std::make_unique<HashAggregatePrintInfo>(allKeys, aggregates);
+    auto aggregate = make_unique<HashAggregate>(sharedState, std::move(aggFunctions),
+        std::move(aggregateInputInfos), std::move(prevOperator), getOperatorID(),
+        printInfo->copy());
+    aggregate->setDescriptor(std::make_unique<ResultSetDescriptor>(inSchema));
+    // Create AggScan.
+    expression_vector outputExpressions;
+    outputExpressions.insert(outputExpressions.end(), flatKeys.begin(), flatKeys.end());
+    outputExpressions.insert(outputExpressions.end(), unFlatKeys.begin(), unFlatKeys.end());
+    outputExpressions.insert(outputExpressions.end(), payloads.begin(), payloads.end());
+    auto aggOutputPos = getDataPos(aggregates, *outSchema);
+    auto finalizer =
+        std::make_unique<HashAggregateFinalize>(sharedState, getOperatorID(), printInfo->copy());
+    finalizer->addChild(std::move(aggregate));
+    aggFunctions = getAggFunctions(aggregates);
+    auto scan =
+        std::make_unique<HashAggregateScan>(sharedState, getDataPos(outputExpressions, *outSchema),
+            AggregateScanInfo{std::move(aggOutputPos), getMoveAggResultToVectorFuncs(aggFunctions)},
+            getOperatorID(), printInfo->copy());
+    scan->addChild(std::move(finalizer));
+    return scan;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_copy_from.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_copy_from.cpp
new file mode 100644
index 0000000000..243b14eb27
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_copy_from.cpp
@@ -0,0 +1,165 @@
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "planner/operator/logical_partitioner.h"
+#include "planner/operator/persistent/logical_copy_from.h"
+#include "processor/expression_mapper.h"
+#include "processor/operator/index_lookup.h"
+#include "processor/operator/partitioner.h"
+#include "processor/operator/persistent/copy_rel_batch_insert.h"
+#include "processor/operator/persistent/node_batch_insert.h"
+#include "processor/operator/persistent/rel_batch_insert.h"
+#include "processor/operator/table_function_call.h"
+#include "processor/plan_mapper.h"
+#include "processor/result/factorized_table_util.h"
+#include "processor/warning_context.h"
+#include "storage/storage_manager.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+
+using namespace lbug::binder;
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapCopyFrom(const LogicalOperator* logicalOperator) {
+    const auto& copyFrom = logicalOperator->constCast<LogicalCopyFrom>();
+    WarningContext::Get(*clientContext)
+        ->setIgnoreErrorsForCurrentQuery(copyFrom.getInfo()->getIgnoreErrorsOption());
+    switch (copyFrom.getInfo()->tableType) {
+    case TableType::NODE: {
+        return mapCopyNodeFrom(logicalOperator);
+    }
+    case TableType::REL: {
+        return mapCopyRelFrom(logicalOperator);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapCopyNodeFrom(
+    const LogicalOperator* logicalOperator) {
+    auto& copyFrom = logicalOperator->constCast<LogicalCopyFrom>();
+    const auto copyFromInfo = copyFrom.getInfo();
+    const auto outFSchema = copyFrom.getSchema();
+    auto prevOperator = mapOperator(copyFrom.getChild(0).get());
+    auto fTable =
+        FactorizedTableUtils::getSingleStringColumnFTable(MemoryManager::Get(*clientContext));
+
+    auto sharedState = std::make_shared<NodeBatchInsertSharedState>(fTable);
+    if (prevOperator->getOperatorType() == PhysicalOperatorType::TABLE_FUNCTION_CALL) {
+        const auto call = prevOperator->ptrCast<TableFunctionCall>();
+        sharedState->tableFuncSharedState = call->getSharedState().get();
+    }
+    std::vector<std::unique_ptr<evaluator::ExpressionEvaluator>> columnEvaluators;
+    auto exprMapper = ExpressionMapper(outFSchema);
+    for (auto& expr : copyFromInfo->columnExprs) {
+        columnEvaluators.push_back(exprMapper.getEvaluator(expr));
+    }
+    std::vector<LogicalType> warningColumnTypes;
+    for (auto& column : copyFromInfo->getWarningColumns()) {
+        warningColumnTypes.push_back(column->getDataType().copy());
+    }
+    auto info = std::make_unique<NodeBatchInsertInfo>(copyFromInfo->tableName,
+        std::move(warningColumnTypes), std::move(columnEvaluators),
+        copyFromInfo->columnEvaluateTypes);
+    auto printInfo = std::make_unique<NodeBatchInsertPrintInfo>(copyFromInfo->tableName);
+    auto batchInsert = std::make_unique<NodeBatchInsert>(std::move(info), std::move(sharedState),
+        std::move(prevOperator), getOperatorID(), std::move(printInfo));
+    batchInsert->setDescriptor(std::make_unique<ResultSetDescriptor>(copyFrom.getSchema()));
+    return batchInsert;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapPartitioner(
+    const LogicalOperator* logicalOperator) {
+    auto& logicalPartitioner = logicalOperator->constCast<LogicalPartitioner>();
+    auto prevOperator = mapOperator(logicalPartitioner.getChild(0).get());
+    auto outFSchema = logicalPartitioner.getSchema();
+    auto& copyFromInfo = logicalPartitioner.copyFromInfo;
+    auto& extraInfo = copyFromInfo.extraInfo->constCast<ExtraBoundCopyRelInfo>();
+    PartitionerInfo partitionerInfo;
+    partitionerInfo.relOffsetDataPos =
+        getDataPos(*logicalPartitioner.getInfo().offset, *outFSchema);
+    partitionerInfo.infos.reserve(logicalPartitioner.getInfo().getNumInfos());
+    for (auto i = 0u; i < logicalPartitioner.getInfo().getNumInfos(); i++) {
+        partitionerInfo.infos.emplace_back(logicalPartitioner.getInfo().getInfo(i).keyIdx,
+            PartitionerFunctions::partitionRelData);
+    }
+    std::vector<LogicalType> columnTypes;
+    evaluator::evaluator_vector_t columnEvaluators;
+    auto exprMapper = ExpressionMapper(outFSchema);
+    for (auto& expr : copyFromInfo.columnExprs) {
+        columnTypes.push_back(expr->getDataType().copy());
+        columnEvaluators.push_back(exprMapper.getEvaluator(expr));
+    }
+    for (auto idx : extraInfo.internalIDColumnIndices) {
+        columnTypes[idx] = LogicalType::INTERNAL_ID();
+    }
+    auto dataInfo = PartitionerDataInfo(copyFromInfo.tableName, extraInfo.fromTableName,
+        extraInfo.toTableName, LogicalType::copy(columnTypes), std::move(columnEvaluators),
+        copyFromInfo.columnEvaluateTypes);
+    auto sharedState =
+        std::make_shared<CopyPartitionerSharedState>(*MemoryManager::Get(*clientContext));
+    expression_vector expressions;
+    for (auto& info : partitionerInfo.infos) {
+        expressions.push_back(copyFromInfo.columnExprs[info.keyIdx]);
+    }
+    auto printInfo = std::make_unique<PartitionerPrintInfo>(expressions);
+    auto partitioner =
+        std::make_unique<Partitioner>(std::move(partitionerInfo), std::move(dataInfo),
+            std::move(sharedState), std::move(prevOperator), getOperatorID(), std::move(printInfo));
+    partitioner->setDescriptor(std::make_unique<ResultSetDescriptor>(outFSchema));
+    return partitioner;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapCopyRelFrom(
+    const LogicalOperator* logicalOperator) {
+    auto& copyFrom = logicalOperator->constCast<LogicalCopyFrom>();
+    const auto copyFromInfo = copyFrom.getInfo();
+    auto partitioner = mapOperator(copyFrom.getChild(0).get());
+    KU_ASSERT(partitioner->getOperatorType() == PhysicalOperatorType::PARTITIONER);
+    auto partitionerSharedState = partitioner->ptrCast<Partitioner>()->getSharedState();
+    const auto catalog = Catalog::Get(*clientContext);
+    const auto transaction = transaction::Transaction::Get(*clientContext);
+    auto extraInfo = copyFromInfo->extraInfo->constCast<ExtraBoundCopyRelInfo>();
+    auto fromTableID =
+        catalog->getTableCatalogEntry(transaction, extraInfo.fromTableName)->getTableID();
+    auto toTableID =
+        catalog->getTableCatalogEntry(transaction, extraInfo.toTableName)->getTableID();
+    std::vector<LogicalType> warningColumnTypes;
+    for (auto& column : copyFromInfo->getWarningColumns()) {
+        warningColumnTypes.push_back(column->getDataType().copy());
+    }
+    auto fTable =
+        FactorizedTableUtils::getSingleStringColumnFTable(MemoryManager::Get(*clientContext));
+    auto batchInsertSharedState = std::make_shared<BatchInsertSharedState>(fTable);
+    // If the table entry doesn't exist, assume both directions
+    std::vector directions = {RelDataDirection::FWD, RelDataDirection::BWD};
+    if (catalog->containsTable(transaction, copyFromInfo->tableName)) {
+        const auto& relGroupEntry =
+            catalog->getTableCatalogEntry(transaction, copyFromInfo->tableName)
+                ->constCast<RelGroupCatalogEntry>();
+        directions = relGroupEntry.getRelDataDirections();
+    }
+
+    auto sink = std::make_unique<DummySimpleSink>(fTable, getOperatorID());
+    for (auto direction : directions) {
+        auto insertInfo = std::make_unique<RelBatchInsertInfo>(copyFromInfo->tableName,
+            copyVector(warningColumnTypes), fromTableID, toTableID, direction);
+        auto printInfo = std::make_unique<RelBatchInsertPrintInfo>(copyFromInfo->tableName);
+        auto progress = std::make_shared<RelBatchInsertProgressSharedState>();
+        auto batchInsert = std::make_unique<RelBatchInsert>(std::move(insertInfo),
+            partitionerSharedState, batchInsertSharedState, getOperatorID(), std::move(printInfo),
+            progress, std::make_unique<CopyRelBatchInsert>());
+        batchInsert->setDescriptor(std::make_unique<ResultSetDescriptor>(copyFrom.getSchema()));
+        sink->addChild(std::move(batchInsert));
+    }
+    sink->addChild(std::move(partitioner));
+    return sink;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_copy_to.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_copy_to.cpp
new file mode 100644
index 0000000000..21619ea40b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_copy_to.cpp
@@ -0,0 +1,43 @@
+#include "planner/operator/persistent/logical_copy_to.h"
+#include "processor/operator/persistent/copy_to.h"
+#include "processor/plan_mapper.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapCopyTo(const LogicalOperator* logicalOperator) {
+    auto& logicalCopyTo = logicalOperator->constCast<LogicalCopyTo>();
+    auto childSchema = logicalOperator->getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    std::vector<DataPos> vectorsToCopyPos;
+    std::vector<bool> isFlat;
+    std::vector<LogicalType> types;
+    for (auto& expression : childSchema->getExpressionsInScope()) {
+        vectorsToCopyPos.emplace_back(childSchema->getExpressionPos(*expression));
+        isFlat.push_back(childSchema->getGroup(expression)->isFlat());
+        types.push_back(expression->dataType.copy());
+    }
+    auto exportFunc = logicalCopyTo.getExportFunc();
+    auto bindData = logicalCopyTo.getBindData();
+    // TODO(Xiyang): Query: COPY (RETURN null) TO '/tmp/1.parquet', the datatype of the first
+    // column is ANY, should we solve the type at binder?
+    bindData->setDataType(std::move(types));
+    auto sharedState = exportFunc.createSharedState();
+    auto info =
+        CopyToInfo{exportFunc, std::move(bindData), std::move(vectorsToCopyPos), std::move(isFlat)};
+    auto printInfo =
+        std::make_unique<CopyToPrintInfo>(info.bindData->columnNames, info.bindData->fileName);
+    auto copyTo = std::make_unique<CopyTo>(std::move(info), std::move(sharedState),
+        std::move(prevOperator), getOperatorID(), std::move(printInfo));
+    copyTo->setDescriptor(std::make_unique<ResultSetDescriptor>(childSchema));
+    return createEmptyFTableScan(FactorizedTable::EmptyTable(MemoryManager::Get(*clientContext)), 0,
+        std::move(copyTo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_create_macro.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_create_macro.cpp
new file mode 100644
index 0000000000..cb7efec3b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_create_macro.cpp
@@ -0,0 +1,25 @@
+#include "planner/operator/logical_create_macro.h"
+#include "processor/operator/macro/create_macro.h"
+#include "processor/plan_mapper.h"
+#include "processor/result/factorized_table_util.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapCreateMacro(
+    const LogicalOperator* logicalOperator) {
+    auto& logicalCreateMacro = logicalOperator->constCast<LogicalCreateMacro>();
+    auto createMacroInfo =
+        CreateMacroInfo(logicalCreateMacro.getMacroName(), logicalCreateMacro.getMacro());
+    auto printInfo = std::make_unique<CreateMacroPrintInfo>(createMacroInfo.macroName);
+    auto messageTable = FactorizedTableUtils::getSingleStringColumnFTable(
+        storage::MemoryManager::Get(*clientContext));
+    return std::make_unique<CreateMacro>(std::move(createMacroInfo), std::move(messageTable),
+        getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_cross_product.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_cross_product.cpp
new file mode 100644
index 0000000000..57142499a0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_cross_product.cpp
@@ -0,0 +1,50 @@
+#include "common/system_config.h"
+#include "planner/operator/logical_cross_product.h"
+#include "processor/operator/cross_product.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapCrossProduct(
+    const LogicalOperator* logicalOperator) {
+    auto& logicalCrossProduct = logicalOperator->constCast<LogicalCrossProduct>();
+    auto outSchema = logicalCrossProduct.getSchema();
+    auto buildChild = logicalCrossProduct.getChild(1);
+    // map build side
+    auto buildSchema = buildChild->getSchema();
+    auto buildSidePrevOperator = mapOperator(buildChild.get());
+    auto expressions = buildSchema->getExpressionsInScope();
+    auto resultCollector = createResultCollector(logicalCrossProduct.getAccumulateType(),
+        expressions, buildSchema, std::move(buildSidePrevOperator));
+    // map probe side
+    auto probeSidePrevOperator = mapOperator(logicalCrossProduct.getChild(0).get());
+    std::vector<DataPos> outVecPos;
+    std::vector<uint32_t> colIndicesToScan;
+    if (logicalCrossProduct.hasMark()) {
+        expressions.push_back(logicalCrossProduct.getMark());
+    }
+    for (auto i = 0u; i < expressions.size(); ++i) {
+        auto expression = expressions[i];
+        outVecPos.emplace_back(outSchema->getExpressionPos(*expression));
+        colIndicesToScan.push_back(i);
+    }
+    auto info = CrossProductInfo(std::move(outVecPos), std::move(colIndicesToScan));
+    auto table = resultCollector->getResultFTable();
+    auto maxMorselSize = table->hasUnflatCol() ? 1 : DEFAULT_VECTOR_CAPACITY;
+    auto localState = CrossProductLocalState(table, maxMorselSize);
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    auto crossProduct = std::make_unique<CrossProduct>(std::move(info), std::move(localState),
+        std::move(probeSidePrevOperator), getOperatorID(), std::move(printInfo));
+    crossProduct->addChild(std::move(resultCollector));
+    if (logicalCrossProduct.getSIPInfo().direction == SIPDirection::PROBE_TO_BUILD) {
+        mapSIPJoin(crossProduct.get());
+    }
+    return crossProduct;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_ddl.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_ddl.cpp
new file mode 100644
index 0000000000..a1a8d50a92
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_ddl.cpp
@@ -0,0 +1,83 @@
+#include "planner/operator/ddl/logical_alter.h"
+#include "planner/operator/ddl/logical_create_sequence.h"
+#include "planner/operator/ddl/logical_create_table.h"
+#include "planner/operator/ddl/logical_create_type.h"
+#include "planner/operator/ddl/logical_drop.h"
+#include "processor/expression_mapper.h"
+#include "processor/operator/ddl/alter.h"
+#include "processor/operator/ddl/create_sequence.h"
+#include "processor/operator/ddl/create_table.h"
+#include "processor/operator/ddl/create_type.h"
+#include "processor/operator/ddl/drop.h"
+#include "processor/plan_mapper.h"
+#include "processor/result/factorized_table_util.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapCreateTable(
+    const LogicalOperator* logicalOperator) {
+    auto& createTable = logicalOperator->constCast<LogicalCreateTable>();
+    auto printInfo = std::make_unique<LogicalCreateTablePrintInfo>(createTable.getInfo()->copy());
+    auto messageTable = FactorizedTableUtils::getSingleStringColumnFTable(
+        storage::MemoryManager::Get(*clientContext));
+    auto sharedState = std::make_shared<CreateTableSharedState>();
+    return std::make_unique<CreateTable>(createTable.getInfo()->copy(), messageTable, sharedState,
+        getOperatorID(), std::move(printInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapCreateType(
+    const LogicalOperator* logicalOperator) {
+    auto& createType = logicalOperator->constCast<LogicalCreateType>();
+    auto typeName = createType.getExpressionsForPrinting();
+    auto printInfo =
+        std::make_unique<CreateTypePrintInfo>(typeName, createType.getType().toString());
+    auto messageTable = FactorizedTableUtils::getSingleStringColumnFTable(
+        storage::MemoryManager::Get(*clientContext));
+    return std::make_unique<CreateType>(typeName, createType.getType().copy(),
+        std::move(messageTable), getOperatorID(), std::move(printInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapCreateSequence(
+    const LogicalOperator* logicalOperator) {
+    auto& createSequence = logicalOperator->constCast<LogicalCreateSequence>();
+    auto printInfo =
+        std::make_unique<CreateSequencePrintInfo>(createSequence.getInfo().sequenceName);
+    auto messageTable = FactorizedTableUtils::getSingleStringColumnFTable(
+        storage::MemoryManager::Get(*clientContext));
+    return std::make_unique<CreateSequence>(createSequence.getInfo(), std::move(messageTable),
+        getOperatorID(), std::move(printInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapDrop(const LogicalOperator* logicalOperator) {
+    auto& drop = logicalOperator->constCast<LogicalDrop>();
+    auto& dropInfo = drop.getDropInfo();
+    auto printInfo = std::make_unique<DropPrintInfo>(drop.getDropInfo().name);
+    auto messageTable = FactorizedTableUtils::getSingleStringColumnFTable(
+        storage::MemoryManager::Get(*clientContext));
+    return std::make_unique<Drop>(dropInfo, std::move(messageTable), getOperatorID(),
+        std::move(printInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapAlter(const LogicalOperator* logicalOperator) {
+    auto& alter = logicalOperator->constCast<LogicalAlter>();
+    std::unique_ptr<evaluator::ExpressionEvaluator> defaultValueEvaluator;
+    auto exprMapper = ExpressionMapper(alter.getSchema());
+    if (alter.getInfo()->alterType == AlterType::ADD_PROPERTY) {
+        auto& addPropInfo = alter.getInfo()->extraInfo->constCast<BoundExtraAddPropertyInfo>();
+        defaultValueEvaluator = exprMapper.getEvaluator(addPropInfo.boundDefault);
+    }
+    auto printInfo = std::make_unique<LogicalAlterPrintInfo>(alter.getInfo()->copy());
+    auto messageTable = FactorizedTableUtils::getSingleStringColumnFTable(
+        storage::MemoryManager::Get(*clientContext));
+    return std::make_unique<Alter>(alter.getInfo()->copy(), std::move(defaultValueEvaluator),
+        std::move(messageTable), getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_delete.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_delete.cpp
new file mode 100644
index 0000000000..776e3d0bc7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_delete.cpp
@@ -0,0 +1,174 @@
+#include "binder/expression/node_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "planner/operator/persistent/logical_delete.h"
+#include "processor/operator/persistent/delete.h"
+#include "processor/plan_mapper.h"
+#include "storage/storage_manager.h"
+
+using namespace lbug::binder;
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::vector<RelTable*> getFwdRelTables(table_id_t nodeTableID, const main::ClientContext* context) {
+    std::vector<RelTable*> result;
+    auto transaction = transaction::Transaction::Get(*context);
+    for (const auto entry : Catalog::Get(*context)->getRelGroupEntries(transaction, false)) {
+        auto& relGroupEntry = entry->constCast<RelGroupCatalogEntry>();
+        for (auto& relEntryInfo : relGroupEntry.getRelEntryInfos()) {
+            const auto srcTableID = relEntryInfo.nodePair.srcTableID;
+            if (srcTableID == nodeTableID) {
+                const auto relTable = StorageManager::Get(*context)->getTable(relEntryInfo.oid);
+                result.push_back(relTable->ptrCast<RelTable>());
+            }
+        }
+    }
+    return result;
+}
+
+std::vector<RelTable*> getBwdRelTables(table_id_t nodeTableID, const main::ClientContext* context) {
+    std::vector<RelTable*> result;
+    auto transaction = transaction::Transaction::Get(*context);
+    for (const auto entry : Catalog::Get(*context)->getRelGroupEntries(transaction, false)) {
+        auto& relGroupEntry = entry->constCast<RelGroupCatalogEntry>();
+        for (auto& relEntryInfo : relGroupEntry.getRelEntryInfos()) {
+            const auto dstTableID = relEntryInfo.nodePair.dstTableID;
+            if (dstTableID == nodeTableID) {
+                const auto relTable = StorageManager::Get(*context)->getTable(relEntryInfo.oid);
+                result.push_back(relTable->ptrCast<RelTable>());
+            }
+        }
+    }
+    return result;
+}
+
+NodeTableDeleteInfo PlanMapper::getNodeTableDeleteInfo(const TableCatalogEntry& entry,
+    DataPos pkPos) const {
+    auto storageManager = StorageManager::Get(*clientContext);
+    auto tableID = entry.getTableID();
+    auto table = storageManager->getTable(tableID)->ptrCast<NodeTable>();
+    std::unordered_set<RelTable*> fwdRelTables;
+    std::unordered_set<RelTable*> bwdRelTables;
+    auto& nodeEntry = entry.constCast<NodeTableCatalogEntry>();
+    for (auto relTable : getFwdRelTables(nodeEntry.getTableID(), clientContext)) {
+        fwdRelTables.insert(relTable);
+    }
+    for (auto relTable : getBwdRelTables(nodeEntry.getTableID(), clientContext)) {
+        bwdRelTables.insert(relTable);
+    }
+    return NodeTableDeleteInfo(table, std::move(fwdRelTables), std::move(bwdRelTables), pkPos);
+}
+
+std::unique_ptr<NodeDeleteExecutor> PlanMapper::getNodeDeleteExecutor(
+    const BoundDeleteInfo& boundInfo, const Schema& schema) const {
+    KU_ASSERT(boundInfo.tableType == TableType::NODE);
+    auto& node = boundInfo.pattern->constCast<NodeExpression>();
+    auto nodeIDPos = getDataPos(*node.getInternalID(), schema);
+    auto info = NodeDeleteInfo(boundInfo.deleteType, nodeIDPos);
+    if (node.isEmpty()) {
+        return std::make_unique<EmptyNodeDeleteExecutor>(std::move(info));
+    }
+    if (node.isMultiLabeled()) {
+        table_id_map_t<NodeTableDeleteInfo> tableInfos;
+        for (auto entry : node.getEntries()) {
+            auto tableID = entry->getTableID();
+            auto pkPos = getDataPos(*node.getPrimaryKey(tableID), schema);
+            tableInfos.insert({tableID, getNodeTableDeleteInfo(*entry, pkPos)});
+        }
+        return std::make_unique<MultiLabelNodeDeleteExecutor>(std::move(info),
+            std::move(tableInfos));
+    }
+    KU_ASSERT(node.getNumEntries() == 1);
+    auto entry = node.getEntry(0);
+    auto pkPos = getDataPos(*node.getPrimaryKey(entry->getTableID()), schema);
+    auto extraInfo = getNodeTableDeleteInfo(*entry, pkPos);
+    return std::make_unique<SingleLabelNodeDeleteExecutor>(std::move(info), std::move(extraInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapDelete(const LogicalOperator* logicalOperator) {
+    auto delete_ = logicalOperator->constPtrCast<LogicalDelete>();
+    switch (delete_->getTableType()) {
+    case TableType::NODE: {
+        return mapDeleteNode(logicalOperator);
+    }
+    case TableType::REL: {
+        return mapDeleteRel(logicalOperator);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapDeleteNode(
+    const LogicalOperator* logicalOperator) {
+    auto delete_ = logicalOperator->constPtrCast<LogicalDelete>();
+    auto inSchema = delete_->getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    std::vector<std::unique_ptr<NodeDeleteExecutor>> executors;
+    for (auto& info : delete_->getInfos()) {
+        executors.push_back(getNodeDeleteExecutor(info, *inSchema));
+    }
+    expression_vector patterns;
+    for (auto& info : delete_->getInfos()) {
+        patterns.push_back(info.pattern);
+    }
+    auto printInfo =
+        std::make_unique<DeleteNodePrintInfo>(patterns, delete_->getInfos()[0].deleteType);
+    return std::make_unique<DeleteNode>(std::move(executors), std::move(prevOperator),
+        getOperatorID(), std::move(printInfo));
+}
+
+std::unique_ptr<RelDeleteExecutor> PlanMapper::getRelDeleteExecutor(
+    const BoundDeleteInfo& boundInfo, const Schema& schema) const {
+    auto& rel = boundInfo.pattern->constCast<RelExpression>();
+    if (rel.isEmpty()) {
+        return std::make_unique<EmptyRelDeleteExecutor>();
+    }
+    auto relIDPos = getDataPos(*rel.getInternalID(), schema);
+    auto srcNodeIDPos = getDataPos(*rel.getSrcNode()->getInternalID(), schema);
+    auto dstNodeIDPos = getDataPos(*rel.getDstNode()->getInternalID(), schema);
+    auto info = RelDeleteInfo(srcNodeIDPos, dstNodeIDPos, relIDPos);
+    auto storageManager = StorageManager::Get(*clientContext);
+    if (rel.isMultiLabeled()) {
+        table_id_map_t<RelTable*> tableIDToTableMap;
+        for (auto entry : rel.getEntries()) {
+            auto& relGroupEntry = entry->constCast<RelGroupCatalogEntry>();
+            for (auto& relEntryInfo : relGroupEntry.getRelEntryInfos()) {
+                auto table = storageManager->getTable(relEntryInfo.oid);
+                tableIDToTableMap.insert({table->getTableID(), table->ptrCast<RelTable>()});
+            }
+        }
+        return std::make_unique<MultiLabelRelDeleteExecutor>(std::move(tableIDToTableMap),
+            std::move(info));
+    }
+    KU_ASSERT(rel.getNumEntries() == 1);
+    auto& entry = rel.getEntry(0)->constCast<RelGroupCatalogEntry>();
+    auto relEntryInfo = entry.getSingleRelEntryInfo();
+    auto table = storageManager->getTable(relEntryInfo.oid)->ptrCast<RelTable>();
+    return std::make_unique<SingleLabelRelDeleteExecutor>(table, std::move(info));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapDeleteRel(const LogicalOperator* logicalOperator) {
+    auto delete_ = logicalOperator->constPtrCast<LogicalDelete>();
+    auto inSchema = delete_->getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    std::vector<std::unique_ptr<RelDeleteExecutor>> executors;
+    for (auto& info : delete_->getInfos()) {
+        executors.push_back(getRelDeleteExecutor(info, *inSchema));
+    }
+    expression_vector patterns;
+    for (auto& info : delete_->getInfos()) {
+        patterns.push_back(info.pattern);
+    }
+    auto printInfo = std::make_unique<DeleteRelPrintInfo>(patterns);
+    return std::make_unique<DeleteRel>(std::move(executors), std::move(prevOperator),
+        getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_distinct.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_distinct.cpp
new file mode 100644
index 0000000000..77a5c27974
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_distinct.cpp
@@ -0,0 +1,37 @@
+#include "planner/operator/logical_distinct.h"
+#include "processor/operator/aggregate/hash_aggregate.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapDistinct(const LogicalOperator* logicalOperator) {
+    auto distinct = logicalOperator->constPtrCast<LogicalDistinct>();
+    auto child = distinct->getChild(0).get();
+    auto outSchema = distinct->getSchema();
+    auto inSchema = child->getSchema();
+    auto prevOperator = mapOperator(child);
+    uint64_t limitNum = 0;
+    if (distinct->hasLimitNum()) {
+        limitNum += distinct->getLimitNum();
+    }
+    if (distinct->hasSkipNum()) {
+        limitNum += distinct->getSkipNum();
+    }
+    if (limitNum == 0) {
+        limitNum = UINT64_MAX;
+    }
+    auto op = createDistinctHashAggregate(distinct->getKeys(), distinct->getPayloads(), inSchema,
+        outSchema, std::move(prevOperator));
+    auto hashAggregate = op->getChild(0)->getChild(0)->ptrCast<HashAggregate>();
+    hashAggregate->getSharedState()->setLimitNumber(limitNum);
+    auto printInfo = static_cast<const HashAggregatePrintInfo*>(hashAggregate->getPrintInfo());
+    const_cast<HashAggregatePrintInfo*>(printInfo)->limitNum = limitNum;
+    return op;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_dummy_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_dummy_scan.cpp
new file mode 100644
index 0000000000..0540466211
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_dummy_scan.cpp
@@ -0,0 +1,36 @@
+#include "planner/operator/scan/logical_dummy_scan.h"
+#include "processor/expression_mapper.h"
+#include "processor/plan_mapper.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapDummyScan(const LogicalOperator*) {
+    auto inSchema = std::make_unique<Schema>();
+    auto expression = LogicalDummyScan::getDummyExpression();
+    auto tableSchema = FactorizedTableSchema();
+    // TODO(Ziyi): remove vectors when we have done the refactor of dataChunk.
+    std::vector<std::shared_ptr<ValueVector>> vectors;
+    std::vector<ValueVector*> vectorsToAppend;
+    auto columnSchema = ColumnSchema(false, 0 /* groupID */,
+        LogicalTypeUtils::getRowLayoutSize(expression->dataType));
+    tableSchema.appendColumn(std::move(columnSchema));
+    auto exprMapper = ExpressionMapper(inSchema.get());
+    auto expressionEvaluator = exprMapper.getEvaluator(expression);
+    auto memoryManager = storage::MemoryManager::Get(*clientContext);
+    // expression can be evaluated statically and does not require an actual resultset to init
+    expressionEvaluator->init(ResultSet(0) /* dummy resultset */, clientContext);
+    expressionEvaluator->evaluate();
+    vectors.push_back(expressionEvaluator->resultVector);
+    vectorsToAppend.push_back(expressionEvaluator->resultVector.get());
+    auto table = std::make_shared<FactorizedTable>(memoryManager, std::move(tableSchema));
+    table->append(vectorsToAppend);
+    return createEmptyFTableScan(table, 1 /* maxMorselSize */);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_dummy_sink.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_dummy_sink.cpp
new file mode 100644
index 0000000000..92bdaf08b0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_dummy_sink.cpp
@@ -0,0 +1,17 @@
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapDummySink(const LogicalOperator* logicalOperator) {
+    auto child = mapOperator(logicalOperator->getChild(0).get());
+    auto descriptor = std::make_unique<ResultSetDescriptor>(logicalOperator->getSchema());
+    auto sink = std::make_unique<DummySink>(std::move(child), getOperatorID());
+    sink->setDescriptor(std::move(descriptor));
+    return sink;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_empty_result.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_empty_result.cpp
new file mode 100644
index 0000000000..6cbfd10fc1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_empty_result.cpp
@@ -0,0 +1,15 @@
+#include "processor/operator/empty_result.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapEmptyResult(const LogicalOperator*) {
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    return std::make_unique<EmptyResult>(getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_explain.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_explain.cpp
new file mode 100644
index 0000000000..13f8ab298e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_explain.cpp
@@ -0,0 +1,48 @@
+#include "common/profiler.h"
+#include "main/plan_printer.h"
+#include "planner/operator/logical_explain.h"
+#include "planner/operator/logical_plan.h"
+#include "processor/operator/profile.h"
+#include "processor/plan_mapper.h"
+#include "processor/result/factorized_table_util.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapExplain(const LogicalOperator* logicalOperator) {
+    auto& logicalExplain = logicalOperator->constCast<LogicalExplain>();
+    auto root = mapOperator(logicalExplain.getChild(0).get());
+    if (!root->isSink()) {
+        auto inSchema = logicalExplain.getChild(0)->getSchema();
+        root = createResultCollector(AccumulateType::REGULAR,
+            logicalExplain.getInnerResultColumns(), inSchema, std::move(root));
+    }
+    auto memoryManager = storage::MemoryManager::Get(*clientContext);
+    auto messageTable = FactorizedTableUtils::getSingleStringColumnFTable(memoryManager);
+    if (logicalExplain.getExplainType() == ExplainType::PROFILE) {
+        auto profile = std::make_unique<Profile>(ProfileInfo{}, std::move(messageTable),
+            getOperatorID(), OPPrintInfo::EmptyInfo());
+        profile->addChild(std::move(root));
+        return profile;
+    }
+    if (logicalExplain.getExplainType() == ExplainType::PHYSICAL_PLAN) {
+        auto plan = std::make_unique<PhysicalPlan>(std::move(root));
+        auto profiler = std::make_unique<Profiler>();
+        auto explainStr = main::PlanPrinter::printPlanToOstream(plan.get(), profiler.get()).str();
+        FactorizedTableUtils::appendStringToTable(messageTable.get(), explainStr, memoryManager);
+        return std::make_unique<DummySimpleSink>(std::move(messageTable), getOperatorID());
+    }
+    auto plan = LogicalPlan();
+    plan.setLastOperator(logicalExplain.getChild(0));
+    auto explainStr = main::PlanPrinter::printPlanToOstream(&plan).str();
+    FactorizedTableUtils::appendStringToTable(messageTable.get(), explainStr, memoryManager);
+    return std::make_unique<DummySimpleSink>(std::move(messageTable), getOperatorID());
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_expressions_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_expressions_scan.cpp
new file mode 100644
index 0000000000..304e34e35a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_expressions_scan.cpp
@@ -0,0 +1,41 @@
+#include "common/system_config.h"
+#include "planner/operator/logical_accumulate.h"
+#include "planner/operator/scan/logical_expressions_scan.h"
+#include "processor/operator/result_collector.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapExpressionsScan(
+    const LogicalOperator* logicalOperator) {
+    auto& expressionsScan = logicalOperator->constCast<LogicalExpressionsScan>();
+    auto outerAccumulate = expressionsScan.getOuterAccumulate()->ptrCast<LogicalAccumulate>();
+    expression_map<ft_col_idx_t> materializedExpressionToColIdx;
+    auto materializedExpressions = outerAccumulate->getPayloads();
+    for (auto i = 0u; i < materializedExpressions.size(); ++i) {
+        materializedExpressionToColIdx.insert({materializedExpressions[i], i});
+    }
+    auto expressionsToScan = expressionsScan.getExpressions();
+    std::vector<ft_col_idx_t> colIndicesToScan;
+    for (auto& expression : expressionsToScan) {
+        KU_ASSERT(materializedExpressionToColIdx.contains(expression));
+        colIndicesToScan.push_back(materializedExpressionToColIdx.at(expression));
+    }
+    auto schema = expressionsScan.getSchema();
+    KU_ASSERT(logicalOpToPhysicalOpMap.contains(outerAccumulate));
+    auto physicalOp = logicalOpToPhysicalOpMap.at(outerAccumulate);
+    KU_ASSERT(physicalOp->getOperatorType() == PhysicalOperatorType::TABLE_FUNCTION_CALL);
+    KU_ASSERT(physicalOp->getChild(0)->getOperatorType() == PhysicalOperatorType::RESULT_COLLECTOR);
+    auto resultCollector = physicalOp->getChild(0)->ptrCast<ResultCollector>();
+    auto table = resultCollector->getResultFTable();
+    return createFTableScan(expressionsToScan, colIndicesToScan, schema, table,
+        DEFAULT_VECTOR_CAPACITY /* maxMorselSize */);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_extend.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_extend.cpp
new file mode 100644
index 0000000000..be0f8f74a9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_extend.cpp
@@ -0,0 +1,187 @@
+#include "binder/binder.h"
+#include "binder/expression/property_expression.h"
+#include "binder/expression_binder.h"
+#include "common/enums/extend_direction_util.h"
+#include "main/client_context.h"
+#include "planner/operator/extend/logical_extend.h"
+#include "processor/operator/scan/scan_multi_rel_tables.h"
+#include "processor/operator/scan/scan_rel_table.h"
+#include "processor/plan_mapper.h"
+#include "storage/storage_manager.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::storage;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace processor {
+
+static ScanRelTableInfo getRelTableScanInfo(const TableCatalogEntry& tableEntry,
+    RelDataDirection direction, RelTable* relTable, bool shouldScanNbrID,
+    const expression_vector& properties, const std::vector<ColumnPredicateSet>& columnPredicates,
+    main::ClientContext* clientContext) {
+    std::vector<ColumnPredicateSet> columnPredicateSets = copyVector(columnPredicates);
+    if (!columnPredicateSets.empty()) {
+        // Since we insert a nbr column. We need to pad an empty nbr column predicate set.
+        columnPredicateSets.insert(columnPredicateSets.begin(), ColumnPredicateSet());
+    }
+    auto tableInfo = ScanRelTableInfo(relTable, std::move(columnPredicateSets), direction);
+    // We always should scan nbrID from relTable. This is not a property in the schema label, so
+    // cannot be bound to a column in the front-end.
+    auto nbrColumnID = shouldScanNbrID ? NBR_ID_COLUMN_ID : INVALID_COLUMN_ID;
+    tableInfo.addColumnInfo(nbrColumnID, ColumnCaster(LogicalType::INTERNAL_ID()));
+    auto binder = Binder(clientContext);
+    auto expressionBinder = ExpressionBinder(&binder, clientContext);
+    for (auto& expr : properties) {
+        auto& property = expr->constCast<PropertyExpression>();
+        if (property.hasProperty(tableEntry.getTableID())) {
+            auto propertyName = property.getPropertyName();
+            auto& columnType = tableEntry.getProperty(propertyName).getType();
+            auto columnCaster = ColumnCaster(columnType.copy());
+            if (property.getDataType() != columnType) {
+                auto columnExpr = std::make_shared<PropertyExpression>(property);
+                columnExpr->dataType = columnType.copy();
+                columnCaster.setCastExpr(
+                    expressionBinder.forceCast(columnExpr, property.getDataType()));
+            }
+            tableInfo.addColumnInfo(tableEntry.getColumnID(propertyName), std::move(columnCaster));
+        } else {
+            tableInfo.addColumnInfo(INVALID_COLUMN_ID, ColumnCaster(LogicalType::ANY()));
+        }
+    }
+    return tableInfo;
+}
+
+static bool isRelTableQualifies(ExtendDirection direction, table_id_t srcTableID,
+    table_id_t dstTableID, table_id_t boundNodeTableID, const table_id_set_t& nbrTableISet) {
+    switch (direction) {
+    case ExtendDirection::FWD: {
+        return srcTableID == boundNodeTableID && nbrTableISet.contains(dstTableID);
+    }
+    case ExtendDirection::BWD: {
+        return dstTableID == boundNodeTableID && nbrTableISet.contains(srcTableID);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static std::vector<ScanRelTableInfo> populateRelTableCollectionScanner(table_id_t boundNodeTableID,
+    const table_id_set_t& nbrTableISet, const RelGroupCatalogEntry& entry,
+    ExtendDirection extendDirection, bool shouldScanNbrID, const expression_vector& properties,
+    const std::vector<ColumnPredicateSet>& columnPredicates, main::ClientContext* clientContext) {
+    std::vector<ScanRelTableInfo> scanInfos;
+    const auto storageManager = StorageManager::Get(*clientContext);
+    for (auto& info : entry.getRelEntryInfos()) {
+        auto srcTableID = info.nodePair.srcTableID;
+        auto dstTableID = info.nodePair.dstTableID;
+        auto relTable = storageManager->getTable(info.oid)->ptrCast<RelTable>();
+        switch (extendDirection) {
+        case ExtendDirection::FWD: {
+            if (isRelTableQualifies(ExtendDirection::FWD, srcTableID, dstTableID, boundNodeTableID,
+                    nbrTableISet)) {
+                scanInfos.push_back(getRelTableScanInfo(entry, RelDataDirection::FWD, relTable,
+                    shouldScanNbrID, properties, columnPredicates, clientContext));
+            }
+        } break;
+        case ExtendDirection::BWD: {
+            if (isRelTableQualifies(ExtendDirection::BWD, srcTableID, dstTableID, boundNodeTableID,
+                    nbrTableISet)) {
+                scanInfos.push_back(getRelTableScanInfo(entry, RelDataDirection::BWD, relTable,
+                    shouldScanNbrID, properties, columnPredicates, clientContext));
+            }
+        } break;
+        case ExtendDirection::BOTH: {
+            if (isRelTableQualifies(ExtendDirection::FWD, srcTableID, dstTableID, boundNodeTableID,
+                    nbrTableISet)) {
+                scanInfos.push_back(getRelTableScanInfo(entry, RelDataDirection::FWD, relTable,
+                    shouldScanNbrID, properties, columnPredicates, clientContext));
+            }
+            if (isRelTableQualifies(ExtendDirection::BWD, srcTableID, dstTableID, boundNodeTableID,
+                    nbrTableISet)) {
+                scanInfos.push_back(getRelTableScanInfo(entry, RelDataDirection::BWD, relTable,
+                    shouldScanNbrID, properties, columnPredicates, clientContext));
+            }
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    return scanInfos;
+}
+
+static bool scanSingleRelTable(const RelExpression& rel, const NodeExpression& boundNode,
+    ExtendDirection extendDirection) {
+    return !rel.isMultiLabeled() && !boundNode.isMultiLabeled() &&
+           extendDirection != ExtendDirection::BOTH;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapExtend(const LogicalOperator* logicalOperator) {
+    auto extend = logicalOperator->constPtrCast<LogicalExtend>();
+    auto outFSchema = extend->getSchema();
+    auto inFSchema = extend->getChild(0)->getSchema();
+    auto boundNode = extend->getBoundNode();
+    auto nbrNode = extend->getNbrNode();
+    auto rel = extend->getRel();
+    auto extendDirection = extend->getDirection();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    auto inNodeIDPos = getDataPos(*boundNode->getInternalID(), *inFSchema);
+    std::vector<DataPos> outVectorsPos;
+    auto outNodeIDPos = getDataPos(*nbrNode->getInternalID(), *outFSchema);
+    outVectorsPos.push_back(outNodeIDPos);
+    for (auto& expression : extend->getProperties()) {
+        outVectorsPos.push_back(getDataPos(*expression, *outFSchema));
+    }
+    auto scanInfo = ScanOpInfo(inNodeIDPos, outVectorsPos);
+    std::vector<std::string> tableNames;
+    auto storageManager = StorageManager::Get(*clientContext);
+    for (auto entry : rel->getEntries()) {
+        tableNames.push_back(entry->getName());
+    }
+    auto printInfo = std::make_unique<ScanRelTablePrintInfo>(tableNames, extend->getProperties(),
+        boundNode, rel, nbrNode, extendDirection, rel->getVariableName());
+    if (scanSingleRelTable(*rel, *boundNode, extendDirection)) {
+        KU_ASSERT(rel->getNumEntries() == 1);
+        auto entry = rel->getEntry(0)->ptrCast<RelGroupCatalogEntry>();
+        auto relDataDirection = ExtendDirectionUtil::getRelDataDirection(extendDirection);
+        auto entryInfo = entry->getSingleRelEntryInfo();
+        auto relTable = storageManager->getTable(entryInfo.oid)->ptrCast<RelTable>();
+        auto scanRelInfo =
+            getRelTableScanInfo(*entry, relDataDirection, relTable, extend->shouldScanNbrID(),
+                extend->getProperties(), extend->getPropertyPredicates(), clientContext);
+        return std::make_unique<ScanRelTable>(std::move(scanInfo), std::move(scanRelInfo),
+            std::move(prevOperator), getOperatorID(), printInfo->copy());
+    }
+    // map to generic extend
+    auto directionInfo = DirectionInfo();
+    directionInfo.extendFromSource = extend->extendFromSourceNode();
+    if (rel->hasDirectionExpr()) {
+        directionInfo.directionPos = getDataPos(*rel->getDirectionExpr(), *outFSchema);
+    }
+    table_id_map_t<RelTableCollectionScanner> scanners;
+    for (auto boundNodeTableID : boundNode->getTableIDs()) {
+        for (auto entry : rel->getEntries()) {
+            auto& relGroupEntry = entry->constCast<RelGroupCatalogEntry>();
+            auto scanInfos =
+                populateRelTableCollectionScanner(boundNodeTableID, nbrNode->getTableIDsSet(),
+                    relGroupEntry, extendDirection, extend->shouldScanNbrID(),
+                    extend->getProperties(), extend->getPropertyPredicates(), clientContext);
+            if (scanInfos.empty()) {
+                continue;
+            }
+            if (scanners.contains(boundNodeTableID)) {
+                scanners.at(boundNodeTableID).addRelInfos(std::move(scanInfos));
+            } else {
+                scanners.insert(
+                    {boundNodeTableID, RelTableCollectionScanner(std::move(scanInfos))});
+            }
+        }
+    }
+    return std::make_unique<ScanMultiRelTable>(std::move(scanInfo), std::move(directionInfo),
+        std::move(scanners), std::move(prevOperator), getOperatorID(), printInfo->copy());
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_filter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_filter.cpp
new file mode 100644
index 0000000000..e37fdbed14
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_filter.cpp
@@ -0,0 +1,23 @@
+#include "planner/operator/logical_filter.h"
+#include "processor/expression_mapper.h"
+#include "processor/operator/filter.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapFilter(const LogicalOperator* logicalOperator) {
+    auto& logicalFilter = logicalOperator->constCast<LogicalFilter>();
+    auto inSchema = logicalFilter.getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    auto exprMapper = ExpressionMapper(inSchema);
+    auto physicalRootExpr = exprMapper.getEvaluator(logicalFilter.getPredicate());
+    auto printInfo = std::make_unique<FilterPrintInfo>(logicalFilter.getPredicate());
+    return make_unique<Filter>(std::move(physicalRootExpr), logicalFilter.getGroupPosToSelect(),
+        std::move(prevOperator), getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_flatten.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_flatten.cpp
new file mode 100644
index 0000000000..dba5cf83d0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_flatten.cpp
@@ -0,0 +1,20 @@
+#include "planner/operator/logical_flatten.h"
+#include "processor/operator/flatten.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapFlatten(const LogicalOperator* logicalOperator) {
+    auto& flatten = logicalOperator->constCast<LogicalFlatten>();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    // todo (Xiyang): add print info for flatten
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    return make_unique<Flatten>(flatten.getGroupPos(), std::move(prevOperator), getOperatorID(),
+        std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_hash_join.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_hash_join.cpp
new file mode 100644
index 0000000000..69148c9390
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_hash_join.cpp
@@ -0,0 +1,125 @@
+#include "binder/expression/expression_util.h"
+#include "planner/operator/logical_hash_join.h"
+#include "processor/operator/hash_join/hash_join_build.h"
+#include "processor/operator/hash_join/hash_join_probe.h"
+#include "processor/plan_mapper.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::binder;
+using namespace lbug::planner;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+HashJoinBuildInfo PlanMapper::createHashBuildInfo(const Schema& buildSideSchema,
+    const expression_vector& keys, const expression_vector& payloads) {
+    f_group_pos_set keyGroupPosSet;
+    std::vector<DataPos> keysPos;
+    std::vector<FStateType> fStateTypes;
+    std::vector<DataPos> payloadsPos;
+    auto tableSchema = FactorizedTableSchema();
+    for (auto& key : keys) {
+        auto pos = DataPos(buildSideSchema.getExpressionPos(*key));
+        keyGroupPosSet.insert(pos.dataChunkPos);
+        // Keys are always stored in flat column.
+        auto columnSchema = ColumnSchema(false /* isUnFlat */, pos.dataChunkPos,
+            LogicalTypeUtils::getRowLayoutSize(key->dataType));
+        tableSchema.appendColumn(std::move(columnSchema));
+        keysPos.push_back(pos);
+        fStateTypes.push_back(buildSideSchema.getGroup(pos.dataChunkPos)->isFlat() ?
+                                  FStateType::FLAT :
+                                  FStateType::UNFLAT);
+    }
+    for (auto& payload : payloads) {
+        auto pos = DataPos(buildSideSchema.getExpressionPos(*payload));
+        if (keyGroupPosSet.contains(pos.dataChunkPos) ||
+            buildSideSchema.getGroup(pos.dataChunkPos)->isFlat()) {
+            // Payloads need to be stored in flat column in 2 cases
+            // 1. payload is in the same chunk as a key. Since keys are always stored as flat,
+            // payloads must also be stored as flat.
+            // 2. payload is in flat chunk
+            auto columnSchema = ColumnSchema(false /* isUnFlat */, pos.dataChunkPos,
+                LogicalTypeUtils::getRowLayoutSize(payload->dataType));
+            tableSchema.appendColumn(std::move(columnSchema));
+        } else {
+            auto columnSchema =
+                ColumnSchema(true /* isUnFlat */, pos.dataChunkPos, sizeof(overflow_value_t));
+            tableSchema.appendColumn(std::move(columnSchema));
+        }
+        payloadsPos.push_back(pos);
+    }
+    auto hashValueColumn = ColumnSchema(false /* isUnFlat */, INVALID_DATA_CHUNK_POS,
+        LogicalTypeUtils::getRowLayoutSize(LogicalType::HASH()));
+    tableSchema.appendColumn(std::move(hashValueColumn));
+    auto pointerColumn = ColumnSchema(false /* isUnFlat */, INVALID_DATA_CHUNK_POS,
+        LogicalTypeUtils::getRowLayoutSize(LogicalType::INT64()));
+    tableSchema.appendColumn(std::move(pointerColumn));
+    return HashJoinBuildInfo(std::move(keysPos), std::move(fStateTypes), std::move(payloadsPos),
+        std::move(tableSchema));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapHashJoin(const LogicalOperator* logicalOperator) {
+    auto hashJoin = logicalOperator->constPtrCast<LogicalHashJoin>();
+    auto outSchema = hashJoin->getSchema();
+    auto buildSchema = hashJoin->getChild(1)->getSchema();
+    std::unique_ptr<PhysicalOperator> probeSidePrevOperator;
+    std::unique_ptr<PhysicalOperator> buildSidePrevOperator;
+    // Map the side into which semi mask is passed first.
+    if (hashJoin->getSIPInfo().dependency == SIPDependency::PROBE_DEPENDS_ON_BUILD) {
+        buildSidePrevOperator = mapOperator(hashJoin->getChild(1).get());
+        probeSidePrevOperator = mapOperator(hashJoin->getChild(0).get());
+    } else {
+        probeSidePrevOperator = mapOperator(hashJoin->getChild(0).get());
+        buildSidePrevOperator = mapOperator(hashJoin->getChild(1).get());
+    }
+    expression_vector probeKeys;
+    expression_vector buildKeys;
+    for (auto& [probeKey, buildKey] : hashJoin->getJoinConditions()) {
+        probeKeys.push_back(probeKey);
+        buildKeys.push_back(buildKey);
+    }
+    auto buildKeyTypes = ExpressionUtil::getDataTypes(buildKeys);
+    auto payloads =
+        ExpressionUtil::excludeExpressions(hashJoin->getExpressionsToMaterialize(), probeKeys);
+    // Create build
+    auto buildInfo = createHashBuildInfo(*buildSchema, buildKeys, payloads);
+    auto globalHashTable =
+        std::make_unique<JoinHashTable>(*storage::MemoryManager::Get(*clientContext),
+            LogicalType::copy(buildKeyTypes), buildInfo.tableSchema.copy());
+    auto sharedState = std::make_shared<HashJoinSharedState>(std::move(globalHashTable));
+    auto buildPrintInfo = std::make_unique<HashJoinBuildPrintInfo>(buildKeys, payloads);
+    auto hashJoinBuild = std::make_unique<HashJoinBuild>(PhysicalOperatorType::HASH_JOIN_BUILD,
+        sharedState, std::move(buildInfo), std::move(buildSidePrevOperator), getOperatorID(),
+        buildPrintInfo->copy());
+    hashJoinBuild->setDescriptor(std::make_unique<ResultSetDescriptor>(buildSchema));
+    // Create probe
+    std::vector<DataPos> probeKeysDataPos;
+    for (auto& probeKey : probeKeys) {
+        probeKeysDataPos.emplace_back(outSchema->getExpressionPos(*probeKey));
+    }
+    std::vector<DataPos> probePayloadsOutPos;
+    for (auto& payload : payloads) {
+        probePayloadsOutPos.emplace_back(outSchema->getExpressionPos(*payload));
+    }
+    ProbeDataInfo probeDataInfo(probeKeysDataPos, probePayloadsOutPos);
+    if (hashJoin->hasMark()) {
+        auto mark = hashJoin->getMark();
+        auto markOutputPos = DataPos(outSchema->getExpressionPos(*mark));
+        probeDataInfo.markDataPos = markOutputPos;
+    } else {
+        probeDataInfo.markDataPos = DataPos::getInvalidPos();
+    }
+    auto probePrintInfo = std::make_unique<HashJoinProbePrintInfo>(probeKeys);
+    auto hashJoinProbe = make_unique<HashJoinProbe>(sharedState, hashJoin->getJoinType(),
+        hashJoin->requireFlatProbeKeys(), probeDataInfo, std::move(probeSidePrevOperator),
+        getOperatorID(), probePrintInfo->copy());
+    hashJoinProbe->addChild(std::move(hashJoinBuild));
+    if (hashJoin->getSIPInfo().direction == SIPDirection::PROBE_TO_BUILD) {
+        mapSIPJoin(hashJoinProbe.get());
+    }
+    return hashJoinProbe;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_index_scan_node.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_index_scan_node.cpp
new file mode 100644
index 0000000000..b37d8bec74
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_index_scan_node.cpp
@@ -0,0 +1,41 @@
+#include "main/client_context.h"
+#include "planner/operator/scan/logical_index_look_up.h"
+#include "processor/expression_mapper.h"
+#include "processor/operator/index_lookup.h"
+#include "processor/plan_mapper.h"
+#include "storage/storage_manager.h"
+#include "storage/table/node_table.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapIndexLookup(
+    const LogicalOperator* logicalOperator) {
+    auto& logicalIndexScan = logicalOperator->constCast<LogicalPrimaryKeyLookup>();
+    auto outSchema = logicalIndexScan.getSchema();
+    auto child = logicalOperator->getChild(0).get();
+    auto prevOperator = mapOperator(child);
+    auto storageManager = storage::StorageManager::Get(*clientContext);
+    auto exprMapper = ExpressionMapper(child->getSchema());
+    std::vector<IndexLookupInfo> indexLookupInfos;
+    for (auto i = 0u; i < logicalIndexScan.getNumInfos(); ++i) {
+        auto& info = logicalIndexScan.getInfo(i);
+        auto nodeTable = storageManager->getTable(info.nodeTableID)->ptrCast<storage::NodeTable>();
+        auto offsetPos = DataPos(outSchema->getExpressionPos(*info.offset));
+        auto keyEvaluator = exprMapper.getEvaluator(info.key);
+        indexLookupInfos.emplace_back(nodeTable, std::move(keyEvaluator), offsetPos);
+    }
+    auto warningDataPos = getDataPos(logicalIndexScan.getInfo(0).warningExprs, *outSchema);
+    binder::expression_vector expressions;
+    for (auto i = 0u; i < logicalIndexScan.getNumInfos(); ++i) {
+        expressions.push_back(logicalIndexScan.getInfo(i).offset);
+    }
+    auto printInfo = std::make_unique<IndexLookupPrintInfo>(expressions);
+    return std::make_unique<IndexLookup>(std::move(indexLookupInfos), std::move(warningDataPos),
+        std::move(prevOperator), getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_insert.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_insert.cpp
new file mode 100644
index 0000000000..4cc5350685
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_insert.cpp
@@ -0,0 +1,109 @@
+#include "binder/expression/rel_expression.h"
+#include "main/client_context.h"
+#include "planner/operator/persistent/logical_insert.h"
+#include "processor/expression_mapper.h"
+#include "processor/operator/persistent/insert.h"
+#include "processor/plan_mapper.h"
+#include "storage/storage_manager.h"
+
+using namespace lbug::evaluator;
+using namespace lbug::planner;
+using namespace lbug::storage;
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace processor {
+
+static std::vector<DataPos> populateReturnColumnsPos(const LogicalInsertInfo& info,
+    const Schema& schema) {
+    std::vector<DataPos> result;
+    for (auto i = 0u; i < info.columnDataExprs.size(); ++i) {
+        if (info.isReturnColumnExprs[i]) {
+            result.emplace_back(schema.getExpressionPos(*info.columnExprs[i]));
+        } else {
+            result.push_back(DataPos::getInvalidPos());
+        }
+    }
+    return result;
+}
+
+NodeInsertExecutor PlanMapper::getNodeInsertExecutor(const LogicalInsertInfo* boundInfo,
+    const Schema& inSchema, const Schema& outSchema) const {
+    auto& node = boundInfo->pattern->constCast<NodeExpression>();
+    auto nodeIDPos = getDataPos(*node.getInternalID(), outSchema);
+    auto columnsPos = populateReturnColumnsPos(*boundInfo, outSchema);
+    auto info = NodeInsertInfo(nodeIDPos, columnsPos, boundInfo->conflictAction);
+    auto storageManager = StorageManager::Get(*clientContext);
+    KU_ASSERT(node.getNumEntries() == 1);
+    ;
+    auto table = storageManager->getTable(node.getEntry(0)->getTableID())->ptrCast<NodeTable>();
+    evaluator_vector_t evaluators;
+    auto exprMapper = ExpressionMapper(&inSchema);
+    for (auto& expr : boundInfo->columnDataExprs) {
+        evaluators.push_back(exprMapper.getEvaluator(expr));
+    }
+    auto tableInfo = NodeTableInsertInfo(table, std::move(evaluators));
+    return NodeInsertExecutor(std::move(info), std::move(tableInfo));
+}
+
+RelInsertExecutor PlanMapper::getRelInsertExecutor(const LogicalInsertInfo* boundInfo,
+    const Schema& inSchema, const Schema& outSchema) const {
+    auto& rel = boundInfo->pattern->constCast<RelExpression>();
+    auto srcNode = rel.getSrcNode();
+    auto dstNode = rel.getDstNode();
+    auto srcNodeIDPos = getDataPos(*srcNode->getInternalID(), inSchema);
+    auto dstNodeIDPos = getDataPos(*dstNode->getInternalID(), inSchema);
+    auto columnsPos = populateReturnColumnsPos(*boundInfo, outSchema);
+    auto info = RelInsertInfo(srcNodeIDPos, dstNodeIDPos, std::move(columnsPos));
+    auto storageManager = StorageManager::Get(*clientContext);
+    KU_ASSERT(srcNode->getNumEntries() == 1 && dstNode->getNumEntries() == 1);
+    auto srcTableID = srcNode->getEntry(0)->getTableID();
+    auto dstTableID = dstNode->getEntry(0)->getTableID();
+    KU_ASSERT(rel.getNumEntries() == 1);
+    auto& relGroupEntry = rel.getEntry(0)->constCast<RelGroupCatalogEntry>();
+    auto relEntryInfo = relGroupEntry.getRelEntryInfo(srcTableID, dstTableID);
+    auto table = storageManager->getTable(relEntryInfo->oid)->ptrCast<RelTable>();
+    evaluator_vector_t evaluators;
+    auto exprMapper = ExpressionMapper(&outSchema);
+    for (auto& expr : boundInfo->columnDataExprs) {
+        evaluators.push_back(exprMapper.getEvaluator(expr));
+    }
+    auto tableInfo = RelTableInsertInfo(table, std::move(evaluators));
+    return RelInsertExecutor(std::move(info), std::move(tableInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapInsert(const LogicalOperator* logicalOperator) {
+    auto& logicalInsert = logicalOperator->constCast<LogicalInsert>();
+    auto inSchema = logicalInsert.getChild(0)->getSchema();
+    auto outSchema = logicalInsert.getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    std::vector<NodeInsertExecutor> nodeExecutors;
+    std::vector<RelInsertExecutor> relExecutors;
+    for (auto& info : logicalInsert.getInfos()) {
+        switch (info.tableType) {
+        case TableType::NODE: {
+            nodeExecutors.push_back(getNodeInsertExecutor(&info, *inSchema, *outSchema));
+        } break;
+        case TableType::REL: {
+            relExecutors.push_back(getRelInsertExecutor(&info, *inSchema, *outSchema));
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    expression_vector expressions;
+    for (auto& info : logicalInsert.getInfos()) {
+        for (auto& expr : info.columnExprs) {
+            expressions.push_back(expr);
+        }
+    }
+    auto printInfo =
+        std::make_unique<InsertPrintInfo>(expressions, logicalInsert.getInfos()[0].conflictAction);
+    return std::make_unique<Insert>(std::move(nodeExecutors), std::move(relExecutors),
+        std::move(prevOperator), getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_intersect.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_intersect.cpp
new file mode 100644
index 0000000000..46f001b0d2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_intersect.cpp
@@ -0,0 +1,69 @@
+#include "binder/expression/expression_util.h"
+#include "planner/operator/logical_intersect.h"
+#include "processor/operator/intersect/intersect.h"
+#include "processor/operator/intersect/intersect_build.h"
+#include "processor/plan_mapper.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::binder;
+using namespace lbug::planner;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapIntersect(const LogicalOperator* logicalOperator) {
+    auto logicalIntersect = logicalOperator->constPtrCast<LogicalIntersect>();
+    auto intersectNodeID = logicalIntersect->getIntersectNodeID();
+    auto outSchema = logicalIntersect->getSchema();
+    std::vector<std::shared_ptr<HashJoinSharedState>> sharedStates;
+    std::vector<IntersectDataInfo> intersectDataInfos;
+    // Map build side children.
+    std::vector<std::unique_ptr<PhysicalOperator>> buildChildren;
+    for (auto i = 1u; i < logicalIntersect->getNumChildren(); i++) {
+        auto keyNodeID = logicalIntersect->getKeyNodeID(i - 1);
+        auto keys = expression_vector{keyNodeID};
+        auto buildSchema = logicalIntersect->getChild(i)->getSchema();
+        auto buildPrevOperator = mapOperator(logicalIntersect->getChild(i).get());
+        auto payloadExpressions =
+            ExpressionUtil::excludeExpressions(buildSchema->getExpressionsInScope(), keys);
+        auto buildInfo = createHashBuildInfo(*buildSchema, keys, payloadExpressions);
+        auto globalHashTable =
+            std::make_unique<JoinHashTable>(*storage::MemoryManager::Get(*clientContext),
+                ExpressionUtil::getDataTypes(keys), buildInfo.tableSchema.copy());
+        auto sharedState = std::make_shared<HashJoinSharedState>(std::move(globalHashTable));
+        sharedStates.push_back(sharedState);
+        auto printInfo = std::make_unique<IntersectBuildPrintInfo>(keys, payloadExpressions);
+        auto build = std::make_unique<IntersectBuild>(sharedState, std::move(buildInfo),
+            std::move(buildPrevOperator), getOperatorID(), std::move(printInfo));
+        build->setDescriptor(std::make_unique<ResultSetDescriptor>(buildSchema));
+        buildChildren.push_back(std::move(build));
+        // Collect intersect info
+        std::vector<DataPos> vectorsToScanPos;
+        auto expressionsToScan = ExpressionUtil::excludeExpressions(
+            buildSchema->getExpressionsInScope(), {keyNodeID, intersectNodeID});
+        for (auto& expression : expressionsToScan) {
+            vectorsToScanPos.emplace_back(outSchema->getExpressionPos(*expression));
+        }
+        IntersectDataInfo info{DataPos(outSchema->getExpressionPos(*keyNodeID)), vectorsToScanPos};
+        intersectDataInfos.push_back(info);
+    }
+    // Map probe side child.
+    auto probeChild = mapOperator(logicalIntersect->getChild(0).get());
+    // Map intersect.
+    auto outputDataPos =
+        DataPos(outSchema->getExpressionPos(*logicalIntersect->getIntersectNodeID()));
+    auto printInfo = std::make_unique<IntersectPrintInfo>(intersectNodeID);
+    auto intersect = make_unique<Intersect>(outputDataPos, intersectDataInfos, sharedStates,
+        std::move(probeChild), getOperatorID(), std::move(printInfo));
+    for (auto& child : buildChildren) {
+        intersect->addChild(std::move(child));
+    }
+    if (logicalIntersect->getSIPInfo().direction == SIPDirection::PROBE_TO_BUILD) {
+        mapSIPJoin(intersect.get());
+    }
+    return intersect;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_label_filter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_label_filter.cpp
new file mode 100644
index 0000000000..26a3abf91c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_label_filter.cpp
@@ -0,0 +1,24 @@
+#include "planner/operator/logical_node_label_filter.h"
+#include "processor/operator/filter.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapNodeLabelFilter(
+    const LogicalOperator* logicalOperator) {
+    auto& logicalLabelFilter = logicalOperator->constCast<LogicalNodeLabelFilter>();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    auto schema = logicalOperator->getSchema();
+    auto nbrNodeVectorPos = DataPos(schema->getExpressionPos(*logicalLabelFilter.getNodeID()));
+    auto filterInfo =
+        std::make_unique<NodeLabelFilterInfo>(nbrNodeVectorPos, logicalLabelFilter.getTableIDSet());
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    return std::make_unique<NodeLabelFiler>(std::move(filterInfo), std::move(prevOperator),
+        getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_limit.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_limit.cpp
new file mode 100644
index 0000000000..d52e78ae07
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_limit.cpp
@@ -0,0 +1,50 @@
+#include "binder/expression/expression_util.h"
+#include "common/exception/message.h"
+#include "common/exception/runtime.h"
+#include "planner/operator/logical_limit.h"
+#include "processor/operator/limit.h"
+#include "processor/operator/skip.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::binder;
+using namespace lbug::planner;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapLimit(const LogicalOperator* logicalOperator) {
+    auto& logicalLimit = logicalOperator->constCast<LogicalLimit>();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    auto dataChunkToSelectPos = logicalLimit.getGroupPosToSelect();
+    auto groupsPotToLimit = logicalLimit.getGroupsPosToLimit();
+    std::unique_ptr<PhysicalOperator> lastOperator = std::move(prevOperator);
+    if (logicalLimit.hasSkipNum()) {
+        auto skipExpr = logicalLimit.getSkipNum();
+        if (!ExpressionUtil::canEvaluateAsLiteral(*skipExpr)) {
+            throw RuntimeException{
+                ExceptionMessage::invalidSkipLimitParam(skipExpr->toString(), "skip")};
+        }
+        auto skipNum = ExpressionUtil::evaluateAsSkipLimit(*skipExpr);
+        auto printInfo = std::make_unique<SkipPrintInfo>(skipNum);
+        lastOperator = make_unique<Skip>(skipNum, std::make_shared<std::atomic_uint64_t>(0),
+            dataChunkToSelectPos, groupsPotToLimit, std::move(lastOperator), getOperatorID(),
+            printInfo->copy());
+    }
+    if (logicalLimit.hasLimitNum()) {
+        auto limitExpr = logicalLimit.getLimitNum();
+        if (!ExpressionUtil::canEvaluateAsLiteral(*limitExpr)) {
+            throw RuntimeException{
+                ExceptionMessage::invalidSkipLimitParam(limitExpr->toString(), "limit")};
+        }
+        auto limitNum = ExpressionUtil::evaluateAsSkipLimit(*limitExpr);
+        auto printInfo = std::make_unique<LimitPrintInfo>(limitNum);
+        lastOperator = make_unique<Limit>(limitNum, std::make_shared<std::atomic_uint64_t>(0),
+            dataChunkToSelectPos, groupsPotToLimit, std::move(lastOperator), getOperatorID(),
+            printInfo->copy());
+    }
+    return lastOperator;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_merge.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_merge.cpp
new file mode 100644
index 0000000000..e3d5866b1a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_merge.cpp
@@ -0,0 +1,117 @@
+#include "planner/operator/persistent/logical_merge.h"
+#include "processor/operator/persistent/merge.h"
+#include "processor/plan_mapper.h"
+#include <processor/expression_mapper.h>
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+static FactorizedTableSchema getFactorizedTableSchema(const binder::expression_vector& keys,
+    uint64_t numNodeInsertExecutors, uint64_t numRelInsertExecutors) {
+    auto tableSchema = FactorizedTableSchema();
+    auto isUnFlat = false;
+    auto groupID = 0u;
+    for (auto& key : keys) {
+        auto size = common::LogicalTypeUtils::getRowLayoutSize(key->dataType);
+        tableSchema.appendColumn(ColumnSchema(isUnFlat, groupID, size));
+    }
+    auto numNodeIDFields = numNodeInsertExecutors + numRelInsertExecutors;
+    for (auto i = 0u; i < numNodeIDFields; i++) {
+        tableSchema.appendColumn(ColumnSchema(isUnFlat, groupID, sizeof(common::nodeID_t)));
+    }
+    tableSchema.appendColumn(ColumnSchema(isUnFlat, groupID, sizeof(common::hash_t)));
+    return tableSchema;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapMerge(const LogicalOperator* logicalOperator) {
+    auto& logicalMerge = logicalOperator->constCast<LogicalMerge>();
+    auto outSchema = logicalMerge.getSchema();
+    auto inSchema = logicalMerge.getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    auto existenceMarkPos = getDataPos(*logicalMerge.getExistenceMark(), *inSchema);
+    std::vector<NodeInsertExecutor> nodeInsertExecutors;
+    for (auto& info : logicalMerge.getInsertNodeInfos()) {
+        nodeInsertExecutors.push_back(getNodeInsertExecutor(&info, *inSchema, *outSchema));
+    }
+    std::vector<RelInsertExecutor> relInsertExecutors;
+    for (auto& info : logicalMerge.getInsertRelInfos()) {
+        relInsertExecutors.push_back(getRelInsertExecutor(&info, *inSchema, *outSchema));
+    }
+    std::vector<std::unique_ptr<NodeSetExecutor>> onCreateNodeSetExecutors;
+    for (auto& info : logicalMerge.getOnCreateSetNodeInfos()) {
+        onCreateNodeSetExecutors.push_back(getNodeSetExecutor(info, *inSchema));
+    }
+    std::vector<std::unique_ptr<RelSetExecutor>> onCreateRelSetExecutors;
+    for (auto& info : logicalMerge.getOnCreateSetRelInfos()) {
+        onCreateRelSetExecutors.push_back(getRelSetExecutor(info, *inSchema));
+    }
+    std::vector<std::unique_ptr<NodeSetExecutor>> onMatchNodeSetExecutors;
+    common::executor_info executorInfo;
+    for (auto i = 0u; i < logicalMerge.getOnMatchSetNodeInfos().size(); i++) {
+        auto& info = logicalMerge.getOnMatchSetNodeInfos()[i];
+        for (auto j = 0u; j < logicalMerge.getInsertNodeInfos().size(); j++) {
+            if (*info.pattern == *logicalMerge.getInsertNodeInfos()[j].pattern) {
+                executorInfo.emplace(j, i);
+            }
+        }
+        onMatchNodeSetExecutors.push_back(getNodeSetExecutor(info, *inSchema));
+    }
+    std::vector<std::unique_ptr<RelSetExecutor>> onMatchRelSetExecutors;
+    for (auto i = 0u; i < logicalMerge.getOnMatchSetRelInfos().size(); i++) {
+        auto& info = logicalMerge.getOnMatchSetRelInfos()[i];
+        for (auto j = 0u; j < logicalMerge.getInsertRelInfos().size(); j++) {
+            if (*info.pattern == *logicalMerge.getInsertRelInfos()[j].pattern) {
+                executorInfo.emplace(j + logicalMerge.getInsertNodeInfos().size(),
+                    i + logicalMerge.getOnMatchSetNodeInfos().size());
+            }
+        }
+        onMatchRelSetExecutors.push_back(getRelSetExecutor(info, *inSchema));
+    }
+    binder::expression_vector expressions;
+    for (auto& info : logicalMerge.getInsertNodeInfos()) {
+        for (auto& expr : info.columnExprs) {
+            expressions.push_back(expr);
+        }
+    }
+    for (auto& info : logicalMerge.getInsertRelInfos()) {
+        for (auto& expr : info.columnExprs) {
+            expressions.push_back(expr);
+        }
+    }
+    std::vector<binder::expression_pair> onCreateOperation;
+    for (auto& info : logicalMerge.getOnCreateSetRelInfos()) {
+        onCreateOperation.emplace_back(info.column, info.columnData);
+    }
+    for (auto& info : logicalMerge.getOnCreateSetNodeInfos()) {
+        onCreateOperation.emplace_back(info.column, info.columnData);
+    }
+    std::vector<binder::expression_pair> onMatchOperation;
+    for (auto& info : logicalMerge.getOnMatchSetRelInfos()) {
+        onMatchOperation.emplace_back(info.column, info.columnData);
+    }
+    for (auto& info : logicalMerge.getOnMatchSetNodeInfos()) {
+        onMatchOperation.emplace_back(info.column, info.columnData);
+    }
+    auto printInfo =
+        std::make_unique<MergePrintInfo>(expressions, onCreateOperation, onMatchOperation);
+    std::vector<std::unique_ptr<evaluator::ExpressionEvaluator>> keyEvaluators;
+    auto expressionMapper = ExpressionMapper(inSchema);
+    for (auto& key : logicalMerge.getKeys()) {
+        keyEvaluators.push_back(expressionMapper.getEvaluator(key));
+    }
+
+    MergeInfo mergeInfo{std::move(keyEvaluators),
+        getFactorizedTableSchema(logicalMerge.getKeys(),
+            logicalMerge.getOnMatchSetNodeInfos().size(),
+            logicalMerge.getOnMatchSetRelInfos().size()),
+        std::move(executorInfo), existenceMarkPos};
+    return std::make_unique<Merge>(std::move(nodeInsertExecutors), std::move(relInsertExecutors),
+        std::move(onCreateNodeSetExecutors), std::move(onCreateRelSetExecutors),
+        std::move(onMatchNodeSetExecutors), std::move(onMatchRelSetExecutors), std::move(mergeInfo),
+        std::move(prevOperator), getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_multiplicity_reducer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_multiplicity_reducer.cpp
new file mode 100644
index 0000000000..05f5b60aaf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_multiplicity_reducer.cpp
@@ -0,0 +1,18 @@
+#include "processor/operator/multiplicity_reducer.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapMultiplicityReducer(
+    const LogicalOperator* logicalOperator) {
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    return std::make_unique<MultiplicityReducer>(std::move(prevOperator), getOperatorID(),
+        std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_noop.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_noop.cpp
new file mode 100644
index 0000000000..865d5d2c97
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_noop.cpp
@@ -0,0 +1,34 @@
+#include "planner/operator/logical_noop.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapNoop(const LogicalOperator* logicalOperator) {
+    std::vector<std::unique_ptr<PhysicalOperator>> children;
+    for (auto child : logicalOperator->getChildren()) {
+        children.push_back(mapOperator(child.get()));
+    }
+    auto noop = logicalOperator->constPtrCast<LogicalNoop>();
+    auto idx = noop->getMessageChildIdx();
+    KU_ASSERT(idx < children.size());
+    auto child = children[idx].get();
+    // LCOV_EXCL_START
+    if (!child->isSink()) {
+        throw common::InternalException(
+            common::stringFormat("Trying to propagate result table from a non sink operator. This "
+                                 "should never happen."));
+    }
+    // LCOV_EXCL_STOP
+    auto fTable = child->ptrCast<Sink>()->getResultFTable();
+    auto op = std::make_unique<DummySimpleSink>(fTable, getOperatorID());
+    for (auto& childOp : children) {
+        op->addChild(std::move(childOp));
+    }
+    return op;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_order_by.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_order_by.cpp
new file mode 100644
index 0000000000..06a3550d56
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_order_by.cpp
@@ -0,0 +1,107 @@
+#include "binder/expression/expression_util.h"
+#include "common/exception/message.h"
+#include "common/exception/runtime.h"
+#include "planner/operator/logical_order_by.h"
+#include "processor/operator/order_by/order_by.h"
+#include "processor/operator/order_by/order_by_merge.h"
+#include "processor/operator/order_by/order_by_scan.h"
+#include "processor/operator/order_by/top_k.h"
+#include "processor/operator/order_by/top_k_scanner.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapOrderBy(const LogicalOperator* logicalOperator) {
+    auto& logicalOrderBy = logicalOperator->constCast<LogicalOrderBy>();
+    auto outSchema = logicalOrderBy.getSchema();
+    auto inSchema = logicalOrderBy.getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOrderBy.getChild(0).get());
+    auto keyExpressions = logicalOrderBy.getExpressionsToOrderBy();
+    auto payloadExpressions = inSchema->getExpressionsInScope();
+    std::vector<DataPos> payloadsPos;
+    std::vector<LogicalType> payloadTypes;
+    expression_map<ft_col_idx_t> payloadToColIdx;
+    auto payloadSchema = FactorizedTableSchema();
+    auto mayContainUnFlatKey = inSchema->getNumGroups() == 1;
+    for (auto i = 0u; i < payloadExpressions.size(); ++i) {
+        auto expression = payloadExpressions[i];
+        auto [dataChunkPos, vectorPos] = inSchema->getExpressionPos(*expression);
+        payloadsPos.emplace_back(dataChunkPos, vectorPos);
+        payloadTypes.push_back(expression->dataType.copy());
+        if (!inSchema->getGroup(dataChunkPos)->isFlat() && !mayContainUnFlatKey) {
+            // payload is unFlat and not in the same group as keys
+            auto columnSchema =
+                ColumnSchema(true /* isUnFlat */, dataChunkPos, sizeof(overflow_value_t));
+            payloadSchema.appendColumn(std::move(columnSchema));
+        } else {
+            auto columnSchema = ColumnSchema(false /* isUnFlat */, dataChunkPos,
+                LogicalTypeUtils::getRowLayoutSize(expression->getDataType()));
+            payloadSchema.appendColumn(std::move(columnSchema));
+        }
+        payloadToColIdx.insert({expression, i});
+    }
+    std::vector<DataPos> keysPos;
+    std::vector<LogicalType> keyTypes;
+    std::vector<uint32_t> keyInPayloadPos;
+    for (auto& expression : keyExpressions) {
+        keysPos.emplace_back(inSchema->getExpressionPos(*expression));
+        keyTypes.push_back(expression->getDataType().copy());
+        KU_ASSERT(payloadToColIdx.contains(expression));
+        keyInPayloadPos.push_back(payloadToColIdx.at(expression));
+    }
+    std::vector<DataPos> outPos;
+    for (auto& expression : payloadExpressions) {
+        outPos.emplace_back(outSchema->getExpressionPos(*expression));
+    }
+    auto orderByDataInfo = OrderByDataInfo(keysPos, payloadsPos, LogicalType::copy(keyTypes),
+        LogicalType::copy(payloadTypes), logicalOrderBy.getIsAscOrders(), std::move(payloadSchema),
+        std::move(keyInPayloadPos));
+    if (logicalOrderBy.hasLimitNum()) {
+        auto limitExpr = logicalOrderBy.getLimitNum();
+        if (!ExpressionUtil::canEvaluateAsLiteral(*limitExpr)) {
+            throw RuntimeException{
+                ExceptionMessage::invalidSkipLimitParam(limitExpr->toString(), "limit")};
+        }
+        auto limitNum = ExpressionUtil::evaluateAsSkipLimit(*limitExpr);
+        uint64_t skipNum = 0;
+        if (logicalOrderBy.hasSkipNum()) {
+            auto skipExpr = logicalOrderBy.getSkipNum();
+            if (!ExpressionUtil::canEvaluateAsLiteral(*skipExpr)) {
+                throw RuntimeException{
+                    ExceptionMessage::invalidSkipLimitParam(skipExpr->toString(), "skip")};
+            }
+            skipNum = ExpressionUtil::evaluateAsSkipLimit(*skipExpr);
+        }
+        auto topKSharedState = std::make_shared<TopKSharedState>();
+        auto printInfo =
+            std::make_unique<TopKPrintInfo>(keyExpressions, payloadExpressions, skipNum, limitNum);
+        auto topK = make_unique<TopK>(std::move(orderByDataInfo), topKSharedState, skipNum,
+            limitNum, std::move(prevOperator), getOperatorID(), printInfo->copy());
+        topK->setDescriptor(std::make_unique<ResultSetDescriptor>(inSchema));
+        auto scan =
+            std::make_unique<TopKScan>(outPos, topKSharedState, getOperatorID(), printInfo->copy());
+        scan->addChild(std::move(topK));
+        return scan;
+    }
+    auto orderBySharedState = std::make_shared<SortSharedState>();
+    auto printInfo = std::make_unique<OrderByPrintInfo>(keyExpressions, payloadExpressions);
+    auto orderBy = make_unique<OrderBy>(std::move(orderByDataInfo), orderBySharedState,
+        std::move(prevOperator), getOperatorID(), printInfo->copy());
+    orderBy->setDescriptor(std::make_unique<ResultSetDescriptor>(inSchema));
+    auto dispatcher = std::make_shared<KeyBlockMergeTaskDispatcher>();
+    auto orderByMerge = make_unique<OrderByMerge>(orderBySharedState, std::move(dispatcher),
+        getOperatorID(), printInfo->copy());
+    orderByMerge->addChild(std::move(orderBy));
+    auto scan = std::make_unique<OrderByScan>(outPos, orderBySharedState, getOperatorID(),
+        printInfo->copy());
+    scan->addChild(std::move(orderByMerge));
+    return scan;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_path_property_probe.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_path_property_probe.cpp
new file mode 100644
index 0000000000..e8f45a5a65
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_path_property_probe.cpp
@@ -0,0 +1,170 @@
+#include "binder/expression/expression_util.h"
+#include "binder/expression/property_expression.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/string_utils.h"
+#include "planner/operator/extend/logical_recursive_extend.h"
+#include "planner/operator/logical_path_property_probe.h"
+#include "processor/operator/hash_join/hash_join_build.h"
+#include "processor/operator/path_property_probe.h"
+#include "processor/operator/recursive_extend.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+static std::pair<std::vector<struct_field_idx_t>, std::vector<ft_col_idx_t>> getColIdxToScan(
+    const expression_vector& payloads, uint32_t numKeys, const LogicalType& structType) {
+    std::unordered_map<std::string, ft_col_idx_t> propertyNameToColumnIdx;
+    for (auto i = 0u; i < payloads.size(); ++i) {
+        KU_ASSERT(payloads[i]->expressionType == ExpressionType::PROPERTY);
+        auto propertyName = payloads[i]->ptrCast<PropertyExpression>()->getPropertyName();
+        StringUtils::toUpper(propertyName);
+        propertyNameToColumnIdx.insert({propertyName, i + numKeys});
+    }
+    const auto& structFields = StructType::getFields(structType);
+    std::vector<struct_field_idx_t> structFieldIndices;
+    std::vector<ft_col_idx_t> colIndices;
+    for (auto i = 0u; i < structFields.size(); ++i) {
+        auto field = structFields[i].copy();
+        auto fieldName = StringUtils::getUpper(field.getName());
+        if (propertyNameToColumnIdx.contains(fieldName)) {
+            structFieldIndices.push_back(i);
+            colIndices.push_back(propertyNameToColumnIdx.at(fieldName));
+        }
+    }
+    return std::make_pair(std::move(structFieldIndices), std::move(colIndices));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapPathPropertyProbe(
+    const LogicalOperator* logicalOperator) {
+    auto& logicalProbe = logicalOperator->constCast<LogicalPathPropertyProbe>();
+    if (logicalProbe.getJoinType() == RecursiveJoinType::TRACK_NONE) {
+        return mapOperator(logicalProbe.getChild(0).get());
+    }
+    auto rel = logicalProbe.getRel();
+    auto recursiveInfo = rel->getRecursiveInfo();
+    std::vector<struct_field_idx_t> nodeFieldIndices;
+    std::vector<ft_col_idx_t> nodeTableColumnIndices;
+    std::shared_ptr<HashJoinSharedState> nodeBuildSharedState = nullptr;
+    std::unique_ptr<HashJoinBuild> nodeBuild = nullptr;
+    // Map build node property
+    if (logicalProbe.getNodeChild() != nullptr) {
+        auto nodeBuildPrevOperator = mapOperator(logicalProbe.getNodeChild().get());
+        auto nodeBuildSchema = logicalProbe.getNodeChild()->getSchema();
+        auto nodeKeys = expression_vector{recursiveInfo->node->getInternalID()};
+        auto nodeKeyTypes = ExpressionUtil::getDataTypes(nodeKeys);
+        auto nodePayloads =
+            ExpressionUtil::excludeExpressions(nodeBuildSchema->getExpressionsInScope(), nodeKeys);
+        auto nodeBuildInfo = createHashBuildInfo(*nodeBuildSchema, nodeKeys, nodePayloads);
+        auto nodeHashTable =
+            std::make_unique<JoinHashTable>(*storage::MemoryManager::Get(*clientContext),
+                std::move(nodeKeyTypes), nodeBuildInfo.tableSchema.copy());
+        nodeBuildSharedState = std::make_shared<HashJoinSharedState>(std::move(nodeHashTable));
+        nodeBuild = make_unique<HashJoinBuild>(PhysicalOperatorType::HASH_JOIN_BUILD,
+            nodeBuildSharedState, std::move(nodeBuildInfo), std::move(nodeBuildPrevOperator),
+            getOperatorID(), std::make_unique<OPPrintInfo>());
+        nodeBuild->setDescriptor(std::make_unique<ResultSetDescriptor>(nodeBuildSchema));
+        auto [fieldIndices, columnIndices] = getColIdxToScan(nodePayloads, nodeKeys.size(),
+            ListType::getChildType(
+                StructType::getField(rel->getDataType(), InternalKeyword::NODES).getType()));
+        nodeFieldIndices = std::move(fieldIndices);
+        nodeTableColumnIndices = std::move(columnIndices);
+    }
+    std::vector<struct_field_idx_t> relFieldIndices;
+    std::vector<ft_col_idx_t> relTableColumnIndices;
+    std::shared_ptr<HashJoinSharedState> relBuildSharedState = nullptr;
+    std::unique_ptr<HashJoinBuild> relBuild = nullptr;
+    // Map build rel property
+    if (logicalProbe.getRelChild() != nullptr) {
+        auto relBuildPrvOperator = mapOperator(logicalProbe.getRelChild().get());
+        auto relBuildSchema = logicalProbe.getRelChild()->getSchema();
+        auto relKeys = expression_vector{recursiveInfo->rel->getInternalID()};
+        auto relKeyTypes = ExpressionUtil::getDataTypes(relKeys);
+        auto relPayloads =
+            ExpressionUtil::excludeExpressions(relBuildSchema->getExpressionsInScope(), relKeys);
+        auto relBuildInfo = createHashBuildInfo(*relBuildSchema, relKeys, relPayloads);
+        auto relHashTable =
+            std::make_unique<JoinHashTable>(*storage::MemoryManager::Get(*clientContext),
+                std::move(relKeyTypes), relBuildInfo.tableSchema.copy());
+        relBuildSharedState = std::make_shared<HashJoinSharedState>(std::move(relHashTable));
+        relBuild = std::make_unique<HashJoinBuild>(PhysicalOperatorType::HASH_JOIN_BUILD,
+            relBuildSharedState, std::move(relBuildInfo), std::move(relBuildPrvOperator),
+            getOperatorID(), std::make_unique<OPPrintInfo>());
+        relBuild->setDescriptor(std::make_unique<ResultSetDescriptor>(relBuildSchema));
+        auto [fieldIndices, columnIndices] = getColIdxToScan(relPayloads, relKeys.size(),
+            ListType::getChildType(
+                StructType::getField(rel->getDataType(), InternalKeyword::RELS).getType()));
+        relFieldIndices = std::move(fieldIndices);
+        relTableColumnIndices = std::move(columnIndices);
+    }
+    // Map child
+    auto logicalChild = logicalOperator->getChild(0).get();
+    auto prevOperator = mapOperator(logicalChild);
+    if (logicalChild->getOperatorType() == LogicalOperatorType::SEMI_MASKER) {
+        // Create a pipeline to populate semi mask. Pipeline source is the scan of recursive extend
+        // result, and pipeline sink is a dummy operator that does not materialize anything.
+        auto dummySink = std::make_unique<DummySink>(std::move(prevOperator), getOperatorID());
+        dummySink->setDescriptor(std::make_unique<ResultSetDescriptor>(logicalChild->getSchema()));
+        auto extend = logicalChild->getChild(0)->ptrCast<LogicalRecursiveExtend>();
+        auto columns = extend->getResultColumns();
+        auto physicalCall = logicalOpToPhysicalOpMap.at(extend)->ptrCast<RecursiveExtend>();
+        physical_op_vector_t children;
+        children.push_back(std::move(dummySink));
+        prevOperator = createFTableScanAligned(columns, extend->getSchema(),
+            physicalCall->getSharedState()->factorizedTablePool.getGlobalTable(),
+            DEFAULT_VECTOR_CAPACITY, std::move(children));
+    }
+    // Map probe
+    auto pathProbeInfo = PathPropertyProbeInfo();
+    auto schema = logicalProbe.getSchema();
+    pathProbeInfo.pathPos = getDataPos(*rel, *schema);
+    if (logicalProbe.getPathEdgeIDs() != nullptr) {
+        pathProbeInfo.leftNodeIDPos = getDataPos(*rel->getLeftNode()->getInternalID(), *schema);
+        pathProbeInfo.rightNodeIDPos = getDataPos(*rel->getRightNode()->getInternalID(), *schema);
+        pathProbeInfo.inputNodeIDsPos = getDataPos(*logicalProbe.getPathNodeIDs(), *schema);
+        pathProbeInfo.inputEdgeIDsPos = getDataPos(*logicalProbe.getPathEdgeIDs(), *schema);
+        pathProbeInfo.extendFromLeft = logicalProbe.extendFromLeft;
+        pathProbeInfo.extendDirection = logicalProbe.direction;
+        if (logicalProbe.direction == ExtendDirection::BOTH) {
+            pathProbeInfo.directionPos =
+                getDataPos(*recursiveInfo->bindData->directionExpr, *schema);
+        }
+        for (auto entry : recursiveInfo->node->getEntries()) {
+            pathProbeInfo.tableIDToName.insert({entry->getTableID(), entry->getName()});
+        }
+        for (auto& entry : recursiveInfo->rel->getEntries()) {
+            auto& relGroupEntry = entry->constCast<catalog::RelGroupCatalogEntry>();
+            for (auto& relEntryInfo : relGroupEntry.getRelEntryInfos()) {
+                pathProbeInfo.tableIDToName.insert({relEntryInfo.oid, entry->getName()});
+            }
+        }
+    }
+    pathProbeInfo.nodeFieldIndices = nodeFieldIndices;
+    pathProbeInfo.relFieldIndices = relFieldIndices;
+    pathProbeInfo.nodeTableColumnIndices = nodeTableColumnIndices;
+    pathProbeInfo.relTableColumnIndices = relTableColumnIndices;
+    pathProbeInfo.extendFromLeft = logicalProbe.extendFromLeft;
+    auto pathProbeSharedState =
+        std::make_shared<PathPropertyProbeSharedState>(nodeBuildSharedState, relBuildSharedState);
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    auto pathPropertyProbe = std::make_unique<PathPropertyProbe>(std::move(pathProbeInfo),
+        pathProbeSharedState, std::move(prevOperator), getOperatorID(), std::move(printInfo));
+    if (nodeBuild != nullptr) {
+        pathPropertyProbe->addChild(std::move(nodeBuild));
+    }
+    if (relBuild != nullptr) {
+        pathPropertyProbe->addChild(std::move(relBuild));
+    }
+    if (logicalProbe.getSIPInfo().direction == SIPDirection::PROBE_TO_BUILD) {
+        mapSIPJoin(pathPropertyProbe.get());
+    }
+    return pathPropertyProbe;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_projection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_projection.cpp
new file mode 100644
index 0000000000..f104f889f1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_projection.cpp
@@ -0,0 +1,30 @@
+#include "planner/operator/logical_projection.h"
+#include "processor/expression_mapper.h"
+#include "processor/operator/projection.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapProjection(
+    const LogicalOperator* logicalOperator) {
+    auto& logicalProjection = logicalOperator->constCast<LogicalProjection>();
+    auto outSchema = logicalProjection.getSchema();
+    auto inSchema = logicalProjection.getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    auto printInfo =
+        std::make_unique<ProjectionPrintInfo>(logicalProjection.getExpressionsToProject());
+    auto info = ProjectionInfo();
+    info.discardedChunkIndices = logicalProjection.getDiscardedGroupsPos();
+    auto exprMapper = ExpressionMapper(inSchema);
+    for (auto& expr : logicalProjection.getExpressionsToProject()) {
+        info.addEvaluator(exprMapper.getEvaluator(expr), getDataPos(*expr, *outSchema));
+    }
+    return make_unique<Projection>(std::move(info), std::move(prevOperator), getOperatorID(),
+        std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_recursive_extend.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_recursive_extend.cpp
new file mode 100644
index 0000000000..04b61911fb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_recursive_extend.cpp
@@ -0,0 +1,73 @@
+#include "binder/expression/node_expression.h"
+#include "graph/on_disk_graph.h"
+#include "planner/operator/extend/logical_recursive_extend.h"
+#include "planner/operator/sip/logical_semi_masker.h"
+#include "processor/operator/recursive_extend.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+using namespace lbug::graph;
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<NodeOffsetMaskMap> createNodeOffsetMaskMap(const Expression& expr,
+    PlanMapper* mapper) {
+    auto& node = expr.constCast<NodeExpression>();
+    auto maskMap = std::make_unique<NodeOffsetMaskMap>();
+    for (auto tableID : node.getTableIDs()) {
+        maskMap->addMask(tableID, mapper->createSemiMask(tableID));
+    }
+    return maskMap;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapRecursiveExtend(
+    const LogicalOperator* logicalOperator) {
+    auto& extend = logicalOperator->constCast<LogicalRecursiveExtend>();
+    auto& bindData = extend.getBindData();
+    auto columns = extend.getResultColumns();
+    auto tableSchema = createFlatFTableSchema(columns, *extend.getSchema());
+    auto table = std::make_shared<FactorizedTable>(storage::MemoryManager::Get(*clientContext),
+        tableSchema.copy());
+    auto graph = std::make_unique<OnDiskGraph>(clientContext, bindData.graphEntry.copy());
+    auto sharedState =
+        std::make_shared<RecursiveExtendSharedState>(table, std::move(graph), extend.getLimitNum());
+    if (extend.hasInputNodeMask()) {
+        sharedState->setInputNodeMask(createNodeOffsetMaskMap(*bindData.nodeInput, this));
+    }
+    if (extend.hasOutputNodeMask()) {
+        sharedState->setOutputNodeMask(createNodeOffsetMaskMap(*bindData.nodeOutput, this));
+    }
+    auto printInfo =
+        std::make_unique<RecursiveExtendPrintInfo>(extend.getFunction().getFunctionName());
+    auto recursiveExtend = std::make_unique<RecursiveExtend>(extend.getFunction().copy(), bindData,
+        sharedState, getOperatorID(), std::move(printInfo));
+    // Map node predicate pipeline
+    if (extend.hasNodePredicate()) {
+        addOperatorMapping(logicalOperator, recursiveExtend.get());
+        sharedState->setPathNodeMask(std::make_unique<NodeOffsetMaskMap>());
+        auto maskMap = sharedState->getPathNodeMaskMap();
+        KU_ASSERT(extend.getNumChildren() == 1);
+        auto logicalRoot = extend.getChild(0);
+        KU_ASSERT(logicalRoot->getNumChildren() == 1 &&
+                  logicalRoot->getChild(0)->getOperatorType() == LogicalOperatorType::SEMI_MASKER);
+        auto logicalSemiMasker = logicalRoot->getChild(0)->ptrCast<LogicalSemiMasker>();
+        logicalSemiMasker->addTarget(logicalOperator);
+        for (auto tableID : logicalSemiMasker->getNodeTableIDs()) {
+            maskMap->addMask(tableID, createSemiMask(tableID));
+        }
+        auto root = mapOperator(logicalRoot.get());
+        recursiveExtend->addChild(std::move(root));
+        eraseOperatorMapping(logicalOperator);
+    }
+    logicalOpToPhysicalOpMap.insert({logicalOperator, recursiveExtend.get()});
+    physical_op_vector_t children;
+    children.push_back(std::move(recursiveExtend));
+    return createFTableScanAligned(columns, extend.getSchema(), table, DEFAULT_VECTOR_CAPACITY,
+        std::move(children));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_scan_node_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_scan_node_table.cpp
new file mode 100644
index 0000000000..d4a680b860
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_scan_node_table.cpp
@@ -0,0 +1,94 @@
+#include "binder/binder.h"
+#include "binder/expression/property_expression.h"
+#include "binder/expression_binder.h"
+#include "common/mask.h"
+#include "planner/operator/scan/logical_scan_node_table.h"
+#include "processor/expression_mapper.h"
+#include "processor/operator/scan/primary_key_scan_node_table.h"
+#include "processor/operator/scan/scan_node_table.h"
+#include "processor/plan_mapper.h"
+#include "storage/storage_manager.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapScanNodeTable(
+    const LogicalOperator* logicalOperator) {
+    auto storageManager = storage::StorageManager::Get(*clientContext);
+    auto catalog = catalog::Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto& scan = logicalOperator->constCast<LogicalScanNodeTable>();
+    const auto outSchema = scan.getSchema();
+    auto nodeIDPos = getDataPos(*scan.getNodeID(), *outSchema);
+    std::vector<DataPos> outVectorsPos;
+    for (auto& expression : scan.getProperties()) {
+        outVectorsPos.emplace_back(getDataPos(*expression, *outSchema));
+    }
+    auto scanInfo = ScanOpInfo(nodeIDPos, outVectorsPos);
+    const auto tableIDs = scan.getTableIDs();
+    std::vector<std::string> tableNames;
+    std::vector<ScanNodeTableInfo> tableInfos;
+    auto binder = Binder(clientContext);
+    auto expressionBinder = ExpressionBinder(&binder, clientContext);
+    for (const auto& tableID : tableIDs) {
+        auto tableEntry = catalog->getTableCatalogEntry(transaction, tableID);
+        tableNames.push_back(tableEntry->getName());
+        auto table = storageManager->getTable(tableID)->ptrCast<storage::NodeTable>();
+        auto tableInfo = ScanNodeTableInfo(table, copyVector(scan.getPropertyPredicates()));
+        for (auto& expr : scan.getProperties()) {
+            auto& property = expr->constCast<PropertyExpression>();
+            if (property.hasProperty(tableEntry->getTableID())) {
+                auto propertyName = property.getPropertyName();
+                auto& columnType = tableEntry->getProperty(propertyName).getType();
+                auto columnCaster = ColumnCaster(columnType.copy());
+                if (property.getDataType() != columnType) {
+                    auto columnExpr = std::make_shared<PropertyExpression>(property);
+                    columnExpr->dataType = columnType.copy();
+                    columnCaster.setCastExpr(
+                        expressionBinder.forceCast(columnExpr, property.getDataType()));
+                }
+                tableInfo.addColumnInfo(tableEntry->getColumnID(propertyName),
+                    std::move(columnCaster));
+            } else {
+                tableInfo.addColumnInfo(INVALID_COLUMN_ID, ColumnCaster(LogicalType::ANY()));
+            }
+        }
+        tableInfos.push_back(std::move(tableInfo));
+    }
+    std::vector<std::shared_ptr<ScanNodeTableSharedState>> sharedStates;
+    for (auto& tableID : tableIDs) {
+        auto table = storageManager->getTable(tableID)->ptrCast<storage::NodeTable>();
+        auto semiMask = SemiMaskUtil::createMask(table->getNumTotalRows(transaction));
+        sharedStates.push_back(std::make_shared<ScanNodeTableSharedState>(std::move(semiMask)));
+    }
+    auto alias = scan.getNodeID()->cast<PropertyExpression>().getRawVariableName();
+    std::unique_ptr<PhysicalOperator> result;
+    switch (scan.getScanType()) {
+    case LogicalScanNodeTableType::SCAN: {
+        auto printInfo =
+            std::make_unique<ScanNodeTablePrintInfo>(tableNames, alias, scan.getProperties());
+        auto progressSharedState = std::make_shared<ScanNodeTableProgressSharedState>();
+        return std::make_unique<ScanNodeTable>(std::move(scanInfo), std::move(tableInfos),
+            std::move(sharedStates), getOperatorID(), std::move(printInfo), progressSharedState);
+    }
+    case LogicalScanNodeTableType::PRIMARY_KEY_SCAN: {
+        auto& primaryKeyScanInfo = scan.getExtraInfo()->constCast<PrimaryKeyScanInfo>();
+        auto exprMapper = ExpressionMapper(outSchema);
+        auto evaluator = exprMapper.getEvaluator(primaryKeyScanInfo.key);
+        auto sharedState = std::make_shared<PrimaryKeyScanSharedState>(tableInfos.size());
+        auto printInfo = std::make_unique<PrimaryKeyScanPrintInfo>(scan.getProperties(),
+            primaryKeyScanInfo.key->toString(), alias);
+        return std::make_unique<PrimaryKeyScanNodeTable>(std::move(scanInfo), std::move(tableInfos),
+            std::move(evaluator), std::move(sharedState), getOperatorID(), std::move(printInfo));
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_semi_masker.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_semi_masker.cpp
new file mode 100644
index 0000000000..8d92b03411
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_semi_masker.cpp
@@ -0,0 +1,131 @@
+#include "function/gds/gds.h"
+#include "planner/operator/sip/logical_semi_masker.h"
+#include "processor/operator/recursive_extend.h"
+#include "processor/operator/scan/scan_node_table.h"
+#include "processor/operator/semi_masker.h"
+#include "processor/operator/table_function_call.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+// masksPerTable is collected from semiMasker.
+// maskPerTable is collected from target operator, i.e. GDS, scan, ...
+// Normally the two maps should have the same tableIDs.
+// An exception is in GDS with filtered projected graph, multiple semiMasker will work on
+// the same target GDS operator so masksPerTable may have fewer tableIDs.
+static void initMask(table_id_map_t<std::vector<SemiMask*>>& masksPerTable,
+    const table_id_map_t<SemiMask*>& maskPerTable) {
+    for (auto& [tableID, masks] : masksPerTable) {
+        KU_ASSERT(maskPerTable.contains(tableID));
+        auto mask = maskPerTable.at(tableID);
+        mask->enable();
+        masks.emplace_back(mask);
+    }
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapSemiMasker(
+    const LogicalOperator* logicalOperator) {
+    const auto& semiMasker = logicalOperator->constCast<LogicalSemiMasker>();
+    const auto inSchema = semiMasker.getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    const auto tableIDs = semiMasker.getNodeTableIDs();
+    table_id_map_t<std::vector<SemiMask*>> masksPerTable;
+    for (auto tableID : tableIDs) {
+        masksPerTable.insert({tableID, std::vector<SemiMask*>{}});
+    }
+    std::vector<std::string> operatorNames;
+    for (auto& op : semiMasker.getTargetOperators()) {
+        const auto physicalOp = logicalOpToPhysicalOpMap.at(op);
+        operatorNames.push_back(PhysicalOperatorUtils::operatorToString(physicalOp));
+        switch (physicalOp->getOperatorType()) {
+        case PhysicalOperatorType::SCAN_NODE_TABLE: {
+            KU_ASSERT(semiMasker.getTargetType() == SemiMaskTargetType::SCAN_NODE);
+            auto scan = physicalOp->ptrCast<ScanNodeTable>();
+            initMask(masksPerTable, scan->getSemiMasks());
+        } break;
+        case PhysicalOperatorType::TABLE_FUNCTION_CALL: {
+            auto sharedState = physicalOp->ptrCast<TableFunctionCall>()->getSharedState();
+            switch (semiMasker.getTargetType()) {
+            case SemiMaskTargetType::GDS_GRAPH_NODE: {
+                auto funcSharedState = sharedState->ptrCast<function::GDSFuncSharedState>();
+                initMask(masksPerTable, funcSharedState->getGraphNodeMaskMap()->getMasks());
+            } break;
+            case SemiMaskTargetType::SCAN_NODE: {
+                auto tableFunc = physicalOp->ptrCast<TableFunctionCall>();
+                initMask(masksPerTable, tableFunc->getSharedState()->getSemiMasks());
+            } break;
+            default:
+                KU_UNREACHABLE;
+            }
+        } break;
+        case PhysicalOperatorType::RECURSIVE_EXTEND: {
+            auto sharedState = physicalOp->ptrCast<RecursiveExtend>()->getSharedState();
+            NodeOffsetMaskMap* maskMap = nullptr;
+            switch (semiMasker.getTargetType()) {
+            case SemiMaskTargetType::RECURSIVE_EXTEND_INPUT_NODE: {
+                maskMap = sharedState->getInputNodeMaskMap();
+            } break;
+            case SemiMaskTargetType::RECURSIVE_EXTEND_OUTPUT_NODE: {
+                maskMap = sharedState->getOutputNodeMaskMap();
+            } break;
+            case SemiMaskTargetType::RECURSIVE_EXTEND_PATH_NODE: {
+                maskMap = sharedState->getPathNodeMaskMap();
+            } break;
+            default:
+                KU_UNREACHABLE;
+            }
+            KU_ASSERT(maskMap != nullptr);
+            initMask(masksPerTable, maskMap->getMasks());
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    auto keyPos = DataPos(inSchema->getExpressionPos(*semiMasker.getKey()));
+    auto sharedState = std::make_shared<SemiMaskerSharedState>(std::move(masksPerTable));
+    auto printInfo = std::make_unique<SemiMaskerPrintInfo>(operatorNames);
+    switch (semiMasker.getKeyType()) {
+    case SemiMaskKeyType::NODE: {
+        if (tableIDs.size() > 1) {
+            return std::make_unique<MultiTableSemiMasker>(keyPos, sharedState,
+                std::move(prevOperator), getOperatorID(), std::move(printInfo));
+        } else {
+            return std::make_unique<SingleTableSemiMasker>(keyPos, sharedState,
+                std::move(prevOperator), getOperatorID(), std::move(printInfo));
+        }
+    }
+    case SemiMaskKeyType::PATH: {
+        auto& extraInfo = semiMasker.getExtraKeyInfo()->constCast<ExtraPathKeyInfo>();
+        if (tableIDs.size() > 1) {
+            return std::make_unique<PathMultipleTableSemiMasker>(keyPos, sharedState,
+                std::move(prevOperator), getOperatorID(), std::move(printInfo),
+                extraInfo.direction);
+        } else {
+            return std::make_unique<PathSingleTableSemiMasker>(keyPos, sharedState,
+                std::move(prevOperator), getOperatorID(), std::move(printInfo),
+                extraInfo.direction);
+        }
+    }
+    case SemiMaskKeyType::NODE_ID_LIST: {
+        auto& extraInfo = semiMasker.getExtraKeyInfo()->constCast<ExtraNodeIDListKeyInfo>();
+        auto srcIDPos = getDataPos(*extraInfo.srcNodeID, *inSchema);
+        auto dstIDPos = getDataPos(*extraInfo.dstNodeID, *inSchema);
+        if (tableIDs.size() > 1) {
+            return std::make_unique<NodeIDsMultipleTableSemiMasker>(keyPos, srcIDPos, dstIDPos,
+                sharedState, std::move(prevOperator), getOperatorID(), std::move(printInfo));
+        } else {
+            return std::make_unique<NodeIDsSingleTableSemiMasker>(keyPos, srcIDPos, dstIDPos,
+                sharedState, std::move(prevOperator), getOperatorID(), std::move(printInfo));
+        }
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_set.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_set.cpp
new file mode 100644
index 0000000000..ffdc8fd9ff
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_set.cpp
@@ -0,0 +1,170 @@
+#include "binder/expression/property_expression.h"
+#include "binder/expression/rel_expression.h"
+#include "main/client_context.h"
+#include "planner/operator/persistent/logical_set.h"
+#include "processor/expression_mapper.h"
+#include "processor/operator/persistent/set.h"
+#include "processor/plan_mapper.h"
+#include "storage/storage_manager.h"
+#include "storage/table/table.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::planner;
+using namespace lbug::evaluator;
+using namespace lbug::transaction;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+static column_id_t getColumnID(const TableCatalogEntry& entry,
+    const PropertyExpression& propertyExpr) {
+    auto columnID = INVALID_COLUMN_ID;
+    if (propertyExpr.hasProperty(entry.getTableID())) {
+        columnID = entry.getColumnID(propertyExpr.getPropertyName());
+    }
+    return columnID;
+}
+
+static NodeTableSetInfo getNodeTableSetInfo(const TableCatalogEntry& entry, const Expression& expr,
+    StorageManager* storageManager) {
+    auto table = storageManager->getTable(entry.getTableID())->ptrCast<NodeTable>();
+    auto columnID = getColumnID(entry, expr.constCast<PropertyExpression>());
+    return NodeTableSetInfo(table, columnID);
+}
+
+static RelTableSetInfo getRelTableSetInfo(const RelGroupCatalogEntry& entry, table_id_t srcTableID,
+    table_id_t dstTableID, const Expression& expr, StorageManager* storageManager) {
+    auto relEntryInfo = entry.getRelEntryInfo(srcTableID, dstTableID);
+    auto table = storageManager->getTable(relEntryInfo->oid)->ptrCast<RelTable>();
+    auto columnID = getColumnID(entry, expr.constCast<PropertyExpression>());
+    return RelTableSetInfo(table, columnID);
+}
+
+std::unique_ptr<NodeSetExecutor> PlanMapper::getNodeSetExecutor(
+    const BoundSetPropertyInfo& boundInfo, const Schema& schema) const {
+    auto& node = boundInfo.pattern->constCast<NodeExpression>();
+    auto nodeIDPos = getDataPos(*node.getInternalID(), schema);
+    auto& property = boundInfo.column->constCast<PropertyExpression>();
+    auto columnVectorPos = DataPos::getInvalidPos();
+    if (schema.isExpressionInScope(property)) {
+        columnVectorPos = getDataPos(property, schema);
+    }
+    auto exprMapper = ExpressionMapper(&schema);
+    auto evaluator = exprMapper.getEvaluator(boundInfo.columnData);
+    auto setInfo = NodeSetInfo(nodeIDPos, columnVectorPos, std::move(evaluator));
+    if (node.isMultiLabeled()) {
+        table_id_map_t<NodeTableSetInfo> tableInfos;
+        for (auto entry : node.getEntries()) {
+            auto tableID = entry->getTableID();
+            auto tableInfo =
+                getNodeTableSetInfo(*entry, property, StorageManager::Get(*clientContext));
+            if (tableInfo.columnID == INVALID_COLUMN_ID) {
+                continue;
+            }
+            tableInfos.insert({tableID, std::move(tableInfo)});
+        }
+        return std::make_unique<MultiLabelNodeSetExecutor>(std::move(setInfo),
+            std::move(tableInfos));
+    }
+    KU_ASSERT(node.getNumEntries() == 1);
+    auto tableInfo =
+        getNodeTableSetInfo(*node.getEntry(0), property, StorageManager::Get(*clientContext));
+    return std::make_unique<SingleLabelNodeSetExecutor>(std::move(setInfo), std::move(tableInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapSetProperty(
+    const LogicalOperator* logicalOperator) {
+    auto set = logicalOperator->constPtrCast<LogicalSetProperty>();
+    switch (set->getTableType()) {
+    case TableType::NODE: {
+        return mapSetNodeProperty(logicalOperator);
+    }
+    case TableType::REL: {
+        return mapSetRelProperty(logicalOperator);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapSetNodeProperty(
+    const LogicalOperator* logicalOperator) {
+    auto set = logicalOperator->constPtrCast<LogicalSetProperty>();
+    auto inSchema = set->getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    std::vector<std::unique_ptr<NodeSetExecutor>> executors;
+    for (auto& info : set->getInfos()) {
+        executors.push_back(getNodeSetExecutor(info, *inSchema));
+    }
+    std::vector<binder::expression_pair> expressions;
+    for (auto& info : set->getInfos()) {
+        expressions.emplace_back(info.column, info.columnData);
+    }
+    auto printInfo = std::make_unique<SetPropertyPrintInfo>(expressions);
+    return std::make_unique<SetNodeProperty>(std::move(executors), std::move(prevOperator),
+        getOperatorID(), std::move(printInfo));
+}
+
+std::unique_ptr<RelSetExecutor> PlanMapper::getRelSetExecutor(const BoundSetPropertyInfo& boundInfo,
+    const Schema& schema) const {
+    auto& rel = boundInfo.pattern->constCast<RelExpression>();
+    auto srcNodeIDPos = getDataPos(*rel.getSrcNode()->getInternalID(), schema);
+    auto dstNodeIDPos = getDataPos(*rel.getDstNode()->getInternalID(), schema);
+    auto relIDPos = getDataPos(*rel.getInternalID(), schema);
+    auto& property = boundInfo.column->constCast<PropertyExpression>();
+    auto columnVectorPos = DataPos::getInvalidPos();
+    if (schema.isExpressionInScope(property)) {
+        columnVectorPos = getDataPos(property, schema);
+    }
+    auto exprMapper = ExpressionMapper(&schema);
+    auto evaluator = exprMapper.getEvaluator(boundInfo.columnData);
+    auto info =
+        RelSetInfo(srcNodeIDPos, dstNodeIDPos, relIDPos, columnVectorPos, std::move(evaluator));
+    if (rel.isMultiLabeled()) {
+        table_id_map_t<RelTableSetInfo> tableInfos;
+        for (auto entry : rel.getEntries()) {
+            auto& relGroupEntry = entry->constCast<RelGroupCatalogEntry>();
+            for (auto& relEntryInfo : relGroupEntry.getRelEntryInfos()) {
+                auto srcTableID = relEntryInfo.nodePair.srcTableID;
+                auto dstTableID = relEntryInfo.nodePair.dstTableID;
+                auto tableInfo = getRelTableSetInfo(relGroupEntry, srcTableID, dstTableID, property,
+                    StorageManager::Get(*clientContext));
+                if (tableInfo.columnID == INVALID_COLUMN_ID) {
+                    continue;
+                }
+                tableInfos.insert({tableInfo.table->getTableID(), std::move(tableInfo)});
+            }
+        }
+        return std::make_unique<MultiLabelRelSetExecutor>(std::move(info), std::move(tableInfos));
+    }
+    KU_ASSERT(rel.getNumEntries() == 1);
+    auto& relGroupEntry = rel.getEntry(0)->constCast<RelGroupCatalogEntry>();
+    auto fromToNodePair = relGroupEntry.getSingleRelEntryInfo().nodePair;
+    auto tableInfo = getRelTableSetInfo(relGroupEntry, fromToNodePair.srcTableID,
+        fromToNodePair.dstTableID, property, StorageManager::Get(*clientContext));
+    return std::make_unique<SingleLabelRelSetExecutor>(std::move(info), std::move(tableInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapSetRelProperty(
+    const LogicalOperator* logicalOperator) {
+    auto set = logicalOperator->constPtrCast<LogicalSetProperty>();
+    auto inSchema = set->getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    std::vector<std::unique_ptr<RelSetExecutor>> executors;
+    for (auto& info : set->getInfos()) {
+        executors.push_back(getRelSetExecutor(info, *inSchema));
+    }
+    std::vector<expression_pair> expressions;
+    for (auto& info : set->getInfos()) {
+        expressions.emplace_back(info.column, info.columnData);
+    }
+    auto printInfo = std::make_unique<SetPropertyPrintInfo>(expressions);
+    return std::make_unique<SetRelProperty>(std::move(executors), std::move(prevOperator),
+        getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_simple.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_simple.cpp
new file mode 100644
index 0000000000..b50652be12
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_simple.cpp
@@ -0,0 +1,151 @@
+#include "common/exception/runtime.h"
+#include "common/file_system/virtual_file_system.h"
+#include "extension/mapper_extension.h"
+#include "main/client_context.h"
+#include "planner/operator/simple/logical_attach_database.h"
+#include "planner/operator/simple/logical_detach_database.h"
+#include "planner/operator/simple/logical_export_db.h"
+#include "planner/operator/simple/logical_extension.h"
+#include "planner/operator/simple/logical_import_db.h"
+#include "planner/operator/simple/logical_use_database.h"
+#include "processor/operator/persistent/copy_to.h"
+#include "processor/operator/simple/attach_database.h"
+#include "processor/operator/simple/detach_database.h"
+#include "processor/operator/simple/export_db.h"
+#include "processor/operator/simple/import_db.h"
+#include "processor/operator/simple/install_extension.h"
+#include "processor/operator/simple/load_extension.h"
+#include "processor/operator/simple/uninstall_extension.h"
+#include "processor/operator/simple/use_database.h"
+#include "processor/plan_mapper.h"
+#include "processor/result/factorized_table_util.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug::planner;
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::extension;
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapUseDatabase(
+    const LogicalOperator* logicalOperator) {
+    auto useDatabase = logicalOperator->constPtrCast<LogicalUseDatabase>();
+    auto printInfo = std::make_unique<UseDatabasePrintInfo>(useDatabase->getDBName());
+    auto messageTable =
+        FactorizedTableUtils::getSingleStringColumnFTable(MemoryManager::Get(*clientContext));
+    return std::make_unique<UseDatabase>(useDatabase->getDBName(), std::move(messageTable),
+        getOperatorID(), std::move(printInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapAttachDatabase(
+    const LogicalOperator* logicalOperator) {
+    auto attachDatabase = logicalOperator->constPtrCast<LogicalAttachDatabase>();
+    auto info = attachDatabase->getAttachInfo();
+    auto printInfo = std::make_unique<AttachDatabasePrintInfo>(info.dbAlias, info.dbPath);
+    auto messageTable =
+        FactorizedTableUtils::getSingleStringColumnFTable(MemoryManager::Get(*clientContext));
+    return std::make_unique<AttachDatabase>(std::move(info), std::move(messageTable),
+        getOperatorID(), std::move(printInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapDetachDatabase(
+    const LogicalOperator* logicalOperator) {
+    auto detachDatabase = logicalOperator->constPtrCast<LogicalDetachDatabase>();
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    auto messageTable =
+        FactorizedTableUtils::getSingleStringColumnFTable(MemoryManager::Get(*clientContext));
+    return std::make_unique<DetachDatabase>(detachDatabase->getDBName(), std::move(messageTable),
+        getOperatorID(), std::move(printInfo));
+}
+
+static void exportDatabaseCollectParallelFlags(const std::unique_ptr<DummySimpleSink>& sink) {
+    auto exportDB = sink->getChild(0)->ptrCast<ExportDB>();
+    for (auto i = 1u; i < sink->getNumChildren(); ++i) {
+        const auto& tableFuncCall = sink->getChild(i);
+        KU_ASSERT_UNCONDITIONAL(
+            tableFuncCall->getChild(0)->getOperatorType() == PhysicalOperatorType::COPY_TO);
+        const auto& [file, parallelFlag] =
+            tableFuncCall->getChild(0)->ptrCast<CopyTo>()->getParallelFlag();
+        exportDB->addToParallelReaderMap(file, parallelFlag);
+    }
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapExportDatabase(
+    const LogicalOperator* logicalOperator) {
+    auto exportDatabase = logicalOperator->constPtrCast<LogicalExportDatabase>();
+    auto fs = VirtualFileSystem::GetUnsafe(*clientContext);
+    auto boundFileInfo = exportDatabase->getBoundFileInfo();
+    KU_ASSERT(boundFileInfo->filePaths.size() == 1);
+    auto filePath = boundFileInfo->filePaths[0];
+    if (fs->fileOrPathExists(filePath, clientContext)) {
+        throw RuntimeException(stringFormat("Directory {} already exists.", filePath));
+    }
+    fs->createDir(filePath);
+    auto printInfo = std::make_unique<ExportDBPrintInfo>(filePath, boundFileInfo->options);
+    auto messageTable =
+        FactorizedTableUtils::getSingleStringColumnFTable(MemoryManager::Get(*clientContext));
+    auto exportDB = std::make_unique<ExportDB>(boundFileInfo->copy(),
+        exportDatabase->isSchemaOnly(), messageTable, getOperatorID(), std::move(printInfo));
+    auto sink = std::make_unique<DummySimpleSink>(messageTable, getOperatorID());
+    sink->addChild(std::move(exportDB));
+    for (auto child : exportDatabase->getChildren()) {
+        sink->addChild(mapOperator(child.get()));
+    }
+    exportDatabaseCollectParallelFlags(sink);
+    return sink;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapImportDatabase(
+    const LogicalOperator* logicalOperator) {
+    auto importDatabase = logicalOperator->constPtrCast<LogicalImportDatabase>();
+    auto printInfo = std::make_unique<OPPrintInfo>();
+    auto messageTable =
+        FactorizedTableUtils::getSingleStringColumnFTable(MemoryManager::Get(*clientContext));
+    return std::make_unique<ImportDB>(importDatabase->getQuery(), importDatabase->getIndexQuery(),
+        std::move(messageTable), getOperatorID(), std::move(printInfo));
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapExtension(const LogicalOperator* logicalOperator) {
+    auto logicalExtension = logicalOperator->constPtrCast<LogicalExtension>();
+    auto& auxInfo = logicalExtension->getAuxInfo();
+    auto path = auxInfo.path;
+    auto messageTable =
+        FactorizedTableUtils::getSingleStringColumnFTable(MemoryManager::Get(*clientContext));
+    switch (auxInfo.action) {
+    case ExtensionAction::INSTALL: {
+        auto installAuxInfo = auxInfo.contCast<InstallExtensionAuxInfo>();
+        InstallExtensionInfo info{path, installAuxInfo.extensionRepo, installAuxInfo.forceInstall};
+        auto printInfo = std::make_unique<InstallExtensionPrintInfo>(path);
+        return std::make_unique<InstallExtension>(std::move(info), std::move(messageTable),
+            getOperatorID(), std::move(printInfo));
+    }
+    case ExtensionAction::UNINSTALL: {
+        auto printInfo = std::make_unique<UninstallExtensionPrintInfo>(path);
+        return std::make_unique<UninstallExtension>(path, std::move(messageTable), getOperatorID(),
+            std::move(printInfo));
+    }
+    case ExtensionAction::LOAD: {
+        auto printInfo = std::make_unique<LoadExtensionPrintInfo>(path);
+        return std::make_unique<LoadExtension>(path, std::move(messageTable), getOperatorID(),
+            std::move(printInfo));
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapExtensionClause(
+    const LogicalOperator* logicalOperator) {
+    for (auto& mapperExtension : mapperExtensions) {
+        auto physicalOP = mapperExtension->map(logicalOperator, clientContext, getOperatorID());
+        if (physicalOP) {
+            return physicalOP;
+        }
+    }
+    KU_UNREACHABLE;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_standalone_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_standalone_call.cpp
new file mode 100644
index 0000000000..6bee7c7923
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_standalone_call.cpp
@@ -0,0 +1,26 @@
+#include "binder/expression/literal_expression.h"
+#include "main/db_config.h"
+#include "planner/operator/logical_standalone_call.h"
+#include "processor/operator/standalone_call.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapStandaloneCall(
+    const LogicalOperator* logicalOperator) {
+    auto logicalStandaloneCall = logicalOperator->constPtrCast<LogicalStandaloneCall>();
+    auto optionValue =
+        logicalStandaloneCall->getOptionValue()->constPtrCast<binder::LiteralExpression>();
+    auto standaloneCallInfo =
+        StandaloneCallInfo(logicalStandaloneCall->getOption(), optionValue->getValue());
+    auto printInfo =
+        std::make_unique<StandaloneCallPrintInfo>(logicalStandaloneCall->getOption()->name);
+    return std::make_unique<StandaloneCall>(std::move(standaloneCallInfo), getOperatorID(),
+        std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_table_function_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_table_function_call.cpp
new file mode 100644
index 0000000000..bb943e33c1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_table_function_call.cpp
@@ -0,0 +1,21 @@
+#include "planner/operator/logical_table_function_call.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapTableFunctionCall(
+    const LogicalOperator* logicalOperator) {
+    auto& call = logicalOperator->constCast<LogicalTableFunctionCall>();
+    auto getPhysicalPlanFunc = call.getTableFunc().getPhysicalPlanFunc;
+    KU_ASSERT(getPhysicalPlanFunc);
+    auto res = getPhysicalPlanFunc(this, logicalOperator);
+    logicalOpToPhysicalOpMap.insert({logicalOperator, res.get()});
+    return res;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_transaction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_transaction.cpp
new file mode 100644
index 0000000000..1732738f1a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_transaction.cpp
@@ -0,0 +1,20 @@
+#include "planner/operator/logical_transaction.h"
+#include "processor/operator/transaction.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapTransaction(
+    const LogicalOperator* logicalOperator) {
+    auto& logicalTransaction = logicalOperator->constCast<LogicalTransaction>();
+    auto printInfo =
+        std::make_unique<TransactionPrintInfo>(logicalTransaction.getTransactionAction());
+    return std::make_unique<Transaction>(logicalTransaction.getTransactionAction(), getOperatorID(),
+        std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_union.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_union.cpp
new file mode 100644
index 0000000000..3d38c12546
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_union.cpp
@@ -0,0 +1,49 @@
+#include "common/system_config.h"
+#include "planner/operator/logical_union.h"
+#include "processor/operator/table_scan/union_all_scan.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapUnionAll(const LogicalOperator* logicalOperator) {
+    auto& logicalUnionAll = logicalOperator->constCast<LogicalUnion>();
+    auto outSchema = logicalUnionAll.getSchema();
+    // append result collectors to each child
+    std::vector<std::unique_ptr<PhysicalOperator>> prevOperators;
+    std::vector<std::shared_ptr<FactorizedTable>> tables;
+    for (auto i = 0u; i < logicalOperator->getNumChildren(); ++i) {
+        auto child = logicalOperator->getChild(i);
+        auto childSchema = logicalUnionAll.getSchemaBeforeUnion(i);
+        auto prevOperator = mapOperator(child.get());
+        auto resultCollector = createResultCollector(AccumulateType::REGULAR,
+            childSchema->getExpressionsInScope(), childSchema, std::move(prevOperator));
+        tables.push_back(resultCollector->getResultFTable());
+        prevOperators.push_back(std::move(resultCollector));
+    }
+    // append union all
+    std::vector<DataPos> outputPositions;
+    std::vector<uint32_t> columnIndices;
+    auto expressionsToUnion = logicalUnionAll.getExpressionsToUnion();
+    for (auto i = 0u; i < expressionsToUnion.size(); ++i) {
+        auto expression = expressionsToUnion[i];
+        outputPositions.emplace_back(outSchema->getExpressionPos(*expression));
+        columnIndices.push_back(i);
+    }
+    auto info = UnionAllScanInfo(std::move(outputPositions), std::move(columnIndices));
+    auto maxMorselSize = tables[0]->hasUnflatCol() ? 1 : DEFAULT_VECTOR_CAPACITY;
+    auto unionSharedState = make_shared<UnionAllScanSharedState>(std::move(tables), maxMorselSize);
+    auto printInfo = std::make_unique<UnionAllScanPrintInfo>(expressionsToUnion);
+    auto scan = make_unique<UnionAllScan>(std::move(info), unionSharedState, getOperatorID(),
+        std::move(printInfo));
+    for (auto& child : prevOperators) {
+        scan->addChild(std::move(child));
+    }
+    return scan;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_unwind.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_unwind.cpp
new file mode 100644
index 0000000000..d7a114e878
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/map_unwind.cpp
@@ -0,0 +1,31 @@
+#include "planner/operator/logical_unwind.h"
+#include "processor/expression_mapper.h"
+#include "processor/operator/physical_operator.h"
+#include "processor/operator/unwind.h"
+#include "processor/plan_mapper.h"
+
+using namespace lbug::common;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapUnwind(const LogicalOperator* logicalOperator) {
+    auto& unwind = logicalOperator->constCast<LogicalUnwind>();
+    auto outSchema = unwind.getSchema();
+    auto inSchema = unwind.getChild(0)->getSchema();
+    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
+    auto dataPos = DataPos(outSchema->getExpressionPos(*unwind.getOutExpr()));
+    auto exprMapper = ExpressionMapper(inSchema);
+    auto evaluator = exprMapper.getEvaluator(unwind.getInExpr());
+    DataPos idPos;
+    if (unwind.hasIDExpr()) {
+        idPos = getDataPos(*unwind.getIDExpr(), *outSchema);
+    }
+    auto printInfo = std::make_unique<UnwindPrintInfo>(unwind.getInExpr(), unwind.getOutExpr());
+    return std::make_unique<Unwind>(dataPos, idPos, std::move(evaluator), std::move(prevOperator),
+        getOperatorID(), std::move(printInfo));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/plan_mapper.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/plan_mapper.cpp
new file mode 100644
index 0000000000..3211606d76
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/map/plan_mapper.cpp
@@ -0,0 +1,234 @@
+#include "processor/plan_mapper.h"
+
+#include "main/client_context.h"
+#include "main/database.h"
+#include "planner/operator/logical_plan.h"
+#include "processor/operator/profile.h"
+#include "storage/storage_manager.h"
+#include "storage/table/node_table.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::planner;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+PlanMapper::PlanMapper(ExecutionContext* executionContext)
+    : executionContext{executionContext}, physicalOperatorID{0} {
+    clientContext = executionContext->clientContext;
+    mapperExtensions = clientContext->getDatabase()->getMapperExtensions();
+}
+
+std::unique_ptr<PhysicalPlan> PlanMapper::getPhysicalPlan(const LogicalPlan* logicalPlan,
+    const expression_vector& expressions, main::QueryResultType resultType,
+    ArrowResultConfig arrowConfig) {
+    auto root = mapOperator(logicalPlan->getLastOperator().get());
+    if (!root->isSink()) {
+        if (resultType == main::QueryResultType::ARROW) {
+            root = createArrowResultCollector(arrowConfig, expressions, logicalPlan->getSchema(),
+                std::move(root));
+        } else {
+            root = createResultCollector(AccumulateType::REGULAR, expressions,
+                logicalPlan->getSchema(), std::move(root));
+        }
+    }
+    auto physicalPlan = std::make_unique<PhysicalPlan>(std::move(root));
+    if (logicalPlan->isProfile()) {
+        physicalPlan->lastOperator->ptrCast<Profile>()->setPhysicalPlan(physicalPlan.get());
+    }
+    return physicalPlan;
+}
+
+std::unique_ptr<PhysicalOperator> PlanMapper::mapOperator(const LogicalOperator* logicalOperator) {
+    std::unique_ptr<PhysicalOperator> physicalOperator;
+    switch (logicalOperator->getOperatorType()) {
+    case LogicalOperatorType::ACCUMULATE: {
+        physicalOperator = mapAccumulate(logicalOperator);
+    } break;
+    case LogicalOperatorType::AGGREGATE: {
+        physicalOperator = mapAggregate(logicalOperator);
+    } break;
+    case LogicalOperatorType::ALTER: {
+        physicalOperator = mapAlter(logicalOperator);
+    } break;
+    case LogicalOperatorType::ATTACH_DATABASE: {
+        physicalOperator = mapAttachDatabase(logicalOperator);
+    } break;
+    case LogicalOperatorType::COPY_FROM: {
+        physicalOperator = mapCopyFrom(logicalOperator);
+    } break;
+    case LogicalOperatorType::COPY_TO: {
+        physicalOperator = mapCopyTo(logicalOperator);
+    } break;
+    case LogicalOperatorType::CREATE_MACRO: {
+        physicalOperator = mapCreateMacro(logicalOperator);
+    } break;
+    case LogicalOperatorType::CREATE_SEQUENCE: {
+        physicalOperator = mapCreateSequence(logicalOperator);
+    } break;
+    case LogicalOperatorType::CREATE_TABLE: {
+        physicalOperator = mapCreateTable(logicalOperator);
+    } break;
+    case LogicalOperatorType::CREATE_TYPE: {
+        physicalOperator = mapCreateType(logicalOperator);
+    } break;
+    case LogicalOperatorType::CROSS_PRODUCT: {
+        physicalOperator = mapCrossProduct(logicalOperator);
+    } break;
+    case LogicalOperatorType::DELETE: {
+        physicalOperator = mapDelete(logicalOperator);
+    } break;
+    case LogicalOperatorType::DETACH_DATABASE: {
+        physicalOperator = mapDetachDatabase(logicalOperator);
+    } break;
+    case LogicalOperatorType::DISTINCT: {
+        physicalOperator = mapDistinct(logicalOperator);
+    } break;
+    case LogicalOperatorType::DROP: {
+        physicalOperator = mapDrop(logicalOperator);
+    } break;
+    case LogicalOperatorType::DUMMY_SCAN: {
+        physicalOperator = mapDummyScan(logicalOperator);
+    } break;
+    case LogicalOperatorType::DUMMY_SINK: {
+        physicalOperator = mapDummySink(logicalOperator);
+    } break;
+    case LogicalOperatorType::EMPTY_RESULT: {
+        physicalOperator = mapEmptyResult(logicalOperator);
+    } break;
+    case LogicalOperatorType::EXPLAIN: {
+        physicalOperator = mapExplain(logicalOperator);
+    } break;
+    case LogicalOperatorType::EXPRESSIONS_SCAN: {
+        physicalOperator = mapExpressionsScan(logicalOperator);
+    } break;
+    case LogicalOperatorType::EXTEND: {
+        physicalOperator = mapExtend(logicalOperator);
+    } break;
+    case LogicalOperatorType::EXTENSION: {
+        physicalOperator = mapExtension(logicalOperator);
+    } break;
+    case LogicalOperatorType::EXPORT_DATABASE: {
+        physicalOperator = mapExportDatabase(logicalOperator);
+    } break;
+    case LogicalOperatorType::FLATTEN: {
+        physicalOperator = mapFlatten(logicalOperator);
+    } break;
+    case LogicalOperatorType::FILTER: {
+        physicalOperator = mapFilter(logicalOperator);
+    } break;
+    case LogicalOperatorType::HASH_JOIN: {
+        physicalOperator = mapHashJoin(logicalOperator);
+    } break;
+    case LogicalOperatorType::IMPORT_DATABASE: {
+        physicalOperator = mapImportDatabase(logicalOperator);
+    } break;
+    case LogicalOperatorType::INDEX_LOOK_UP: {
+        physicalOperator = mapIndexLookup(logicalOperator);
+    } break;
+    case LogicalOperatorType::INTERSECT: {
+        physicalOperator = mapIntersect(logicalOperator);
+    } break;
+    case LogicalOperatorType::INSERT: {
+        physicalOperator = mapInsert(logicalOperator);
+    } break;
+    case LogicalOperatorType::LIMIT: {
+        physicalOperator = mapLimit(logicalOperator);
+    } break;
+    case LogicalOperatorType::MERGE: {
+        physicalOperator = mapMerge(logicalOperator);
+    } break;
+    case LogicalOperatorType::MULTIPLICITY_REDUCER: {
+        physicalOperator = mapMultiplicityReducer(logicalOperator);
+    } break;
+    case LogicalOperatorType::NODE_LABEL_FILTER: {
+        physicalOperator = mapNodeLabelFilter(logicalOperator);
+    } break;
+    case LogicalOperatorType::NOOP: {
+        physicalOperator = mapNoop(logicalOperator);
+    } break;
+    case LogicalOperatorType::ORDER_BY: {
+        physicalOperator = mapOrderBy(logicalOperator);
+    } break;
+    case LogicalOperatorType::PARTITIONER: {
+        physicalOperator = mapPartitioner(logicalOperator);
+    } break;
+    case LogicalOperatorType::PATH_PROPERTY_PROBE: {
+        physicalOperator = mapPathPropertyProbe(logicalOperator);
+    } break;
+    case LogicalOperatorType::PROJECTION: {
+        physicalOperator = mapProjection(logicalOperator);
+    } break;
+    case LogicalOperatorType::RECURSIVE_EXTEND: {
+        physicalOperator = mapRecursiveExtend(logicalOperator);
+    } break;
+    case LogicalOperatorType::SCAN_NODE_TABLE: {
+        physicalOperator = mapScanNodeTable(logicalOperator);
+    } break;
+    case LogicalOperatorType::SEMI_MASKER: {
+        physicalOperator = mapSemiMasker(logicalOperator);
+    } break;
+    case LogicalOperatorType::SET_PROPERTY: {
+        physicalOperator = mapSetProperty(logicalOperator);
+    } break;
+    case LogicalOperatorType::STANDALONE_CALL: {
+        physicalOperator = mapStandaloneCall(logicalOperator);
+    } break;
+    case LogicalOperatorType::TABLE_FUNCTION_CALL: {
+        physicalOperator = mapTableFunctionCall(logicalOperator);
+    } break;
+    case LogicalOperatorType::TRANSACTION: {
+        physicalOperator = mapTransaction(logicalOperator);
+    } break;
+    case LogicalOperatorType::UNION_ALL: {
+        physicalOperator = mapUnionAll(logicalOperator);
+    } break;
+    case LogicalOperatorType::UNWIND: {
+        physicalOperator = mapUnwind(logicalOperator);
+    } break;
+    case LogicalOperatorType::USE_DATABASE: {
+        physicalOperator = mapUseDatabase(logicalOperator);
+    } break;
+    case LogicalOperatorType::EXTENSION_CLAUSE: {
+        physicalOperator = mapExtensionClause(logicalOperator);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    if (!logicalOpToPhysicalOpMap.contains(logicalOperator)) {
+        logicalOpToPhysicalOpMap.insert({logicalOperator, physicalOperator.get()});
+    }
+    return physicalOperator;
+}
+
+std::vector<DataPos> PlanMapper::getDataPos(const expression_vector& expressions,
+    const Schema& schema) {
+    std::vector<DataPos> result;
+    for (auto& expression : expressions) {
+        result.emplace_back(getDataPos(*expression, schema));
+    }
+    return result;
+}
+
+FactorizedTableSchema PlanMapper::createFlatFTableSchema(const expression_vector& expressions,
+    const Schema& schema) {
+    auto tableSchema = FactorizedTableSchema();
+    for (auto& expr : expressions) {
+        auto dataPos = getDataPos(*expr, schema);
+        auto columnSchema = ColumnSchema(false /* isUnFlat */, dataPos.dataChunkPos,
+            LogicalTypeUtils::getRowLayoutSize(expr->getDataType()));
+        tableSchema.appendColumn(std::move(columnSchema));
+    }
+    return tableSchema;
+}
+
+std::unique_ptr<SemiMask> PlanMapper::createSemiMask(table_id_t tableID) const {
+    auto table = StorageManager::Get(*clientContext)->getTable(tableID)->ptrCast<NodeTable>();
+    return SemiMaskUtil::createMask(
+        table->getNumTotalRows(transaction::Transaction::Get(*clientContext)));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/CMakeLists.txt
new file mode 100644
index 0000000000..629659bc19
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/CMakeLists.txt
@@ -0,0 +1,41 @@
+add_subdirectory(aggregate)
+add_subdirectory(ddl)
+add_subdirectory(hash_join)
+add_subdirectory(intersect)
+add_subdirectory(order_by)
+add_subdirectory(persistent)
+add_subdirectory(scan)
+add_subdirectory(simple)
+add_subdirectory(table_scan)
+add_subdirectory(macro)
+
+add_library(lbug_processor_operator
+        OBJECT
+        arrow_result_collector.cpp
+        base_partitioner_shared_state.cpp
+        cross_product.cpp
+        empty_result.cpp
+        filter.cpp
+        filtering_operator.cpp
+        flatten.cpp
+        index_lookup.cpp
+        limit.cpp
+        multiplicity_reducer.cpp
+        partitioner.cpp
+        path_property_probe.cpp
+        physical_operator.cpp
+        projection.cpp
+        profile.cpp
+        recursive_extend.cpp
+        result_collector.cpp
+        semi_masker.cpp
+        sink.cpp
+        skip.cpp
+        standalone_call.cpp
+        table_function_call.cpp
+        transaction.cpp
+        unwind.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/CMakeLists.txt
new file mode 100644
index 0000000000..edfe077b23
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/CMakeLists.txt
@@ -0,0 +1,13 @@
+add_library(lbug_processor_operator_aggregate
+        OBJECT
+        aggregate_hash_table.cpp
+        base_aggregate.cpp
+        base_aggregate_scan.cpp
+        hash_aggregate.cpp
+        hash_aggregate_scan.cpp
+        simple_aggregate.cpp
+        simple_aggregate_scan.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_aggregate>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/aggregate_hash_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/aggregate_hash_table.cpp
new file mode 100644
index 0000000000..c74d3932ba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/aggregate_hash_table.cpp
@@ -0,0 +1,881 @@
+#include "processor/operator/aggregate/aggregate_hash_table.h"
+
+#include <cstdint>
+#include <memory>
+
+#include "common/assert.h"
+#include "common/constants.h"
+#include "common/data_chunk/data_chunk_state.h"
+#include "common/data_chunk/sel_vector.h"
+#include "common/in_mem_overflow_buffer.h"
+#include "common/type_utils.h"
+#include "common/types/types.h"
+#include "common/utils.h"
+#include "common/vector/value_vector.h"
+#include "processor/operator/aggregate/aggregate_input.h"
+#include "processor/result/factorized_table.h"
+#include "processor/result/factorized_table_schema.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+AggregateHashTable::AggregateHashTable(MemoryManager& memoryManager,
+    std::vector<LogicalType> keyTypes, std::vector<LogicalType> payloadTypes,
+    const std::vector<AggregateFunction>& aggregateFunctions,
+    const std::vector<LogicalType>& distinctAggKeyTypes, uint64_t numEntriesToAllocate,
+    FactorizedTableSchema tableSchema)
+    : BaseHashTable{memoryManager, std::move(keyTypes)}, payloadTypes{std::move(payloadTypes)} {
+    initializeFT(aggregateFunctions, std::move(tableSchema));
+    initializeHashTable(numEntriesToAllocate);
+    KU_ASSERT(aggregateFunctions.size() == distinctAggKeyTypes.size());
+    distinctHashTables.reserve(this->aggregateFunctions.size());
+    distinctHashEntriesProcessed.resize(this->aggregateFunctions.size());
+    for (auto i = 0u; i < this->aggregateFunctions.size(); ++i) {
+        std::unique_ptr<AggregateHashTable> distinctHT;
+        if (this->aggregateFunctions[i].isDistinct) {
+            distinctHT = AggregateHashTableUtils::createDistinctHashTable(memoryManager,
+                this->keyTypes, distinctAggKeyTypes[i]);
+        } else {
+            distinctHT = nullptr;
+        }
+        distinctHashTables.push_back(std::move(distinctHT));
+    }
+    initializeTmpVectors();
+}
+
+uint64_t AggregateHashTable::append(const std::vector<ValueVector*>& keyVectors,
+    const std::vector<ValueVector*>& dependentKeyVectors, const DataChunkState* leadingState,
+    const std::vector<AggregateInput>& aggregateInputs, uint64_t resultSetMultiplicity) {
+    const auto numFlatTuples = leadingState->getSelVector().getSelSize();
+    resizeHashTableIfNecessary(numFlatTuples);
+    computeVectorHashes(keyVectors);
+    findHashSlots(keyVectors, dependentKeyVectors, leadingState);
+    updateAggStates(keyVectors, aggregateInputs, resultSetMultiplicity, leadingState);
+    return numFlatTuples;
+}
+
+hash_t getHash(const FactorizedTable& table, ft_tuple_idx_t tupleIdx) {
+    return *(hash_t*)(table.getTuple(tupleIdx) + table.getTableSchema()->getColOffset(
+                                                     table.getTableSchema()->getNumColumns() - 1));
+}
+
+void AggregateHashTable::merge(FactorizedTable&& table) {
+    KU_ASSERT(*table.getTableSchema() == *getTableSchema());
+    resizeHashTableIfNecessary(table.getNumTuples());
+
+    uint64_t startTupleIdx = 0;
+    while (startTupleIdx < table.getNumTuples()) {
+        auto numTuplesToScan =
+            std::min(table.getNumTuples() - startTupleIdx, DEFAULT_VECTOR_CAPACITY);
+        findHashSlots(table, startTupleIdx, numTuplesToScan);
+        auto aggregateStateOffset = aggStateColOffsetInFT;
+        for (auto& aggregateFunction : aggregateFunctions) {
+            // We'll update the distinct state at the end.
+            // The distinct data gets merged separately, and only after the main data so that
+            // we can guarantee that there is a group available in teh hash table for any given
+            // distinct tuple.
+            if (!aggregateFunction.isDistinct) {
+                for (auto i = 0u; i < numTuplesToScan; i++) {
+                    aggregateFunction.combineState(hashSlotsToUpdateAggState[i]->getEntry() +
+                                                       aggregateStateOffset,
+                        table.getTuple(startTupleIdx + i) + aggregateStateOffset,
+                        factorizedTable->getInMemOverflowBuffer());
+                }
+            }
+            aggregateStateOffset += aggregateFunction.getAggregateStateSize();
+        }
+        startTupleIdx += numTuplesToScan;
+    }
+}
+
+void AggregateHashTable::mergeDistinctAggregateInfo() {
+    auto state = std::make_shared<DataChunkState>();
+    std::vector<std::unique_ptr<ValueVector>> vectors;
+    std::vector<ValueVector*> vectorPtrs;
+    vectors.reserve(keyTypes.size() + 1);
+    vectorPtrs.reserve(keyTypes.size() + 1);
+    for (auto& keyType : keyTypes) {
+        vectors.emplace_back(std::make_unique<ValueVector>(keyType.copy(), memoryManager, state));
+        vectorPtrs.emplace_back(vectors.back().get());
+    }
+    vectors.emplace_back(nullptr);
+    vectorPtrs.emplace_back(nullptr);
+
+    auto aggStateColOffset = aggStateColOffsetInFT;
+    for (size_t distinctIdx = 0; distinctIdx < distinctHashTables.size(); distinctIdx++) {
+        auto& distinctHashTable = distinctHashTables[distinctIdx];
+        if (distinctHashTable) {
+            // Distinct key type is always the last key type in the distinct table
+            vectors.back() = std::make_unique<ValueVector>(
+                distinctHashTable->keyTypes.back().copy(), memoryManager, state);
+            vectorPtrs.back() = vectors.back().get();
+
+            // process 2048 at a time, beginning with the first unprocessed tuple
+            while (distinctHashEntriesProcessed[distinctIdx] < distinctHashTable->getNumEntries()) {
+                // Scan everything but the hash column, which isn't needed as we need hashes for
+                // everything but the distinct key type
+                std::vector<uint32_t> colIdxToScan(vectorPtrs.size());
+                std::iota(colIdxToScan.begin(), colIdxToScan.end(), 0);
+
+                auto numTuplesToScan = std::min(DEFAULT_VECTOR_CAPACITY,
+                    distinctHashTable->getNumEntries() - distinctHashEntriesProcessed[distinctIdx]);
+                state->getSelVectorUnsafe().setSelSize(numTuplesToScan);
+                distinctHashTable->factorizedTable->scan(vectorPtrs,
+                    distinctHashEntriesProcessed[distinctIdx], numTuplesToScan, colIdxToScan);
+                // Compute hashes for the scanned keys but not the distinct key (i.e. the groups in
+                // the main hash table)
+                computeVectorHashes(std::span(const_cast<const ValueVector**>(vectorPtrs.data()),
+                    vectorPtrs.size() - 1));
+                for (size_t i = 0; i < numTuplesToScan; i++) {
+                    // Find slot in current hash table corresponding to the entry in the distinct
+                    // hash table
+                    // updatePosState may not check nulls, and we avoid inserting any nulls into
+                    // distinct hash tables
+                    if (vectors.back()->isNull(i)) {
+                        continue;
+                    }
+                    auto hash = hashVector->getValue<hash_t>(i);
+                    // matchFTEntries expects that the index is the same as the index in the vector
+                    // Doesn't need to be done each time, but maybe this can be vectorized so that
+                    // we can find the correct slots for all of them simultaneously?
+                    mayMatchIdxes[0] = i;
+                    auto entry = findEntry(hash, [&](auto entry) {
+                        HashSlot slot{hash, entry};
+                        hashSlotsToUpdateAggState[i] = &slot;
+                        return matchFTEntries(
+                                   std::span(const_cast<const ValueVector**>(vectorPtrs.data()),
+                                       vectorPtrs.size() - 1),
+                                   1, 0) == 0;
+                    });
+                    KU_ASSERT(entry != nullptr);
+                    aggregateFunctions[distinctIdx].updatePosState(entry + aggStateColOffset,
+                        vectors.back().get() /*aggregateVector*/,
+                        1 /* Distinct aggregate should ignore multiplicity since they are known to
+                             be non-distinct. */
+                        ,
+                        i, factorizedTable->getInMemOverflowBuffer());
+                }
+                distinctHashEntriesProcessed[distinctIdx] += numTuplesToScan;
+            }
+        }
+        aggStateColOffset += aggregateFunctions[distinctIdx].getAggregateStateSize();
+    }
+}
+
+void AggregateHashTable::finalizeAggregateStates() {
+    if (!aggregateFunctions.empty()) {
+        for (auto i = 0u; i < getNumEntries(); ++i) {
+            auto entry = factorizedTable->getTuple(i);
+            auto aggregateStatesOffset = aggStateColOffsetInFT;
+            for (auto& aggregateFunction : aggregateFunctions) {
+                aggregateFunction.finalizeState(entry + aggregateStatesOffset);
+                aggregateStatesOffset += aggregateFunction.getAggregateStateSize();
+            }
+        }
+    }
+}
+
+void AggregateHashTable::initializeFT(const std::vector<AggregateFunction>& aggFuncs,
+    FactorizedTableSchema&& tableSchema) {
+    aggStateColIdxInFT = keyTypes.size() + payloadTypes.size();
+    for (auto& dataType : keyTypes) {
+        numBytesForKeys += LogicalTypeUtils::getRowLayoutSize(dataType);
+    }
+    for (auto& dataType : payloadTypes) {
+        numBytesForDependentKeys += LogicalTypeUtils::getRowLayoutSize(dataType);
+    }
+    aggStateColOffsetInFT = numBytesForKeys + numBytesForDependentKeys;
+
+    aggregateFunctions.reserve(aggFuncs.size());
+    for (auto i = 0u; i < aggFuncs.size(); i++) {
+        auto& aggFunc = aggFuncs[i];
+        aggregateFunctions.push_back(aggFunc.copy());
+    }
+    hashColIdxInFT = tableSchema.getNumColumns() - 1;
+    hashColOffsetInFT = tableSchema.getColOffset(hashColIdxInFT);
+    factorizedTable = std::make_unique<FactorizedTable>(memoryManager, std::move(tableSchema));
+}
+
+void AggregateHashTable::initializeHashTable(uint64_t numEntriesToAllocate) {
+    auto numHashSlotsPerBlock = prevPowerOfTwo(HASH_BLOCK_SIZE / sizeof(HashSlot));
+    setMaxNumHashSlots(nextPowerOfTwo(std::max(numHashSlotsPerBlock, numEntriesToAllocate)));
+    initSlotConstant(numHashSlotsPerBlock);
+    auto numDataBlocks =
+        maxNumHashSlots / numHashSlotsPerBlock + (maxNumHashSlots % numHashSlotsPerBlock != 0);
+    for (auto i = 0u; i < numDataBlocks; i++) {
+        hashSlotsBlocks.emplace_back(std::make_unique<DataBlock>(memoryManager, HASH_BLOCK_SIZE));
+    }
+}
+
+void AggregateHashTable::initializeTmpVectors() {
+    hashSlotsToUpdateAggState = std::make_unique<HashSlot*[]>(DEFAULT_VECTOR_CAPACITY);
+    tmpValueIdxes = std::make_unique<uint64_t[]>(DEFAULT_VECTOR_CAPACITY);
+    entryIdxesToInitialize = std::make_unique<uint64_t[]>(DEFAULT_VECTOR_CAPACITY);
+    mayMatchIdxes = std::make_unique<uint64_t[]>(DEFAULT_VECTOR_CAPACITY);
+    noMatchIdxes = std::make_unique<uint64_t[]>(DEFAULT_VECTOR_CAPACITY);
+    tmpSlotIdxes = std::make_unique<uint64_t[]>(DEFAULT_VECTOR_CAPACITY);
+}
+
+uint8_t* AggregateHashTable::findEntryInDistinctHT(
+    const std::vector<ValueVector*>& groupByKeyVectors, hash_t hash) {
+    return findEntry(hash,
+        [&](auto entry) { return matchFlatVecWithEntry(groupByKeyVectors, entry); });
+}
+
+void AggregateHashTable::resize(uint64_t newSize) {
+    setMaxNumHashSlots(newSize);
+    addDataBlocksIfNecessary(maxNumHashSlots);
+    for (auto& block : hashSlotsBlocks) {
+        block->resetToZero();
+    }
+    factorizedTable->forEach(
+        [&](auto tuple) { fillHashSlot(*(hash_t*)(tuple + hashColOffsetInFT), tuple); });
+}
+
+uint64_t AggregateHashTable::matchFTEntries(std::span<const ValueVector*> keyVectors,
+    uint64_t numMayMatches, uint64_t numNoMatches) {
+    auto colIdx = 0u;
+    for (const auto& keyVector : keyVectors) {
+        if (keyVector->state->isFlat()) {
+            numMayMatches =
+                matchFlatVecWithFTColumn(keyVector, numMayMatches, numNoMatches, colIdx++);
+        } else {
+            numMayMatches =
+                matchUnFlatVecWithFTColumn(keyVector, numMayMatches, numNoMatches, colIdx++);
+        }
+    }
+    return numNoMatches;
+}
+
+uint64_t AggregateHashTable::matchFTEntries(const FactorizedTable& srcTable, uint64_t startOffset,
+    uint64_t numMayMatches, uint64_t numNoMatches) {
+    for (auto colIdx = 0u; colIdx < keyTypes.size(); colIdx++) {
+        auto colOffset = getTableSchema()->getColOffset(colIdx);
+        uint64_t mayMatchIdx = 0;
+        for (auto i = 0u; i < numMayMatches; i++) {
+            auto idx = mayMatchIdxes[i];
+            auto& slot = *hashSlotsToUpdateAggState[idx];
+            auto isEntryKeyNull = factorizedTable->isNonOverflowColNull(
+                slot.getEntry() + getTableSchema()->getNullMapOffset(), colIdx);
+            auto isSrcEntryKeyNull = srcTable.isNonOverflowColNull(startOffset + idx, colIdx);
+            if (isEntryKeyNull && isSrcEntryKeyNull) {
+                mayMatchIdxes[mayMatchIdx++] = idx;
+                continue;
+            } else if (isEntryKeyNull != isSrcEntryKeyNull) {
+                noMatchIdxes[numNoMatches++] = idx;
+                continue;
+            }
+            if (ftCompareEntryFuncs[colIdx](srcTable.getTuple(startOffset + idx) + colOffset,
+                    hashSlotsToUpdateAggState[idx]->getEntry() + colOffset, keyTypes[colIdx])) {
+                mayMatchIdxes[mayMatchIdx++] = idx;
+            } else {
+                noMatchIdxes[numNoMatches++] = idx;
+            }
+        }
+        numMayMatches = mayMatchIdx;
+    }
+    return numNoMatches;
+}
+
+void AggregateHashTable::initializeFTEntries(const std::vector<ValueVector*>& keyVectors,
+    const std::vector<ValueVector*>& dependentKeyVectors, uint64_t numFTEntriesToInitialize) {
+    auto colIdx = 0u;
+    for (auto keyVector : keyVectors) {
+        if (keyVector->state->isFlat()) {
+            initializeFTEntryWithFlatVec(keyVector, numFTEntriesToInitialize, colIdx++);
+        } else {
+            initializeFTEntryWithUnFlatVec(keyVector, numFTEntriesToInitialize, colIdx++);
+        }
+    }
+    for (auto dependentKeyVector : dependentKeyVectors) {
+        if (dependentKeyVector->state->isFlat()) {
+            initializeFTEntryWithFlatVec(dependentKeyVector, numFTEntriesToInitialize, colIdx++);
+        } else {
+            initializeFTEntryWithUnFlatVec(dependentKeyVector, numFTEntriesToInitialize, colIdx++);
+        }
+    }
+    for (auto i = 0u; i < numFTEntriesToInitialize; i++) {
+        auto entryIdx = entryIdxesToInitialize[i];
+        auto& slot = *hashSlotsToUpdateAggState[entryIdx];
+        fillEntryWithInitialNullAggregateState(*factorizedTable, slot.getEntry());
+        // Fill the hashValue in the ftEntry.
+        factorizedTable->updateFlatCellNoNull(slot.getEntry(), hashColIdxInFT,
+            hashVector->getData() + hashVector->getNumBytesPerValue() * entryIdx);
+    }
+}
+
+void AggregateHashTable::initializeFTEntries(const FactorizedTable& sourceTable,
+    uint64_t sourceStartOffset, uint64_t numFTEntriesToInitialize) {
+    // auto colIdx = 0u;
+    for (size_t i = 0; i < numFTEntriesToInitialize; i++) {
+        auto idx = entryIdxesToInitialize[i];
+        auto& slot = *hashSlotsToUpdateAggState[idx];
+        auto sourcePos = sourceStartOffset + idx;
+        memcpy(slot.getEntry(), sourceTable.getTuple(sourcePos),
+            getTableSchema()->getNumBytesPerTuple());
+    }
+    for (auto i = 0u; i < numFTEntriesToInitialize; i++) {
+        auto entryIdx = entryIdxesToInitialize[i];
+        auto& slot = *hashSlotsToUpdateAggState[entryIdx];
+        fillEntryWithInitialNullAggregateState(*factorizedTable, slot.getEntry());
+        // Fill the hashValue in the ftEntry.
+        factorizedTable->updateFlatCellNoNull(slot.getEntry(), hashColIdxInFT,
+            hashVector->getData() + hashVector->getNumBytesPerValue() * entryIdx);
+    }
+}
+
+uint64_t AggregateHashTable::matchUnFlatVecWithFTColumn(const ValueVector* vector,
+    uint64_t numMayMatches, uint64_t& numNoMatches, uint32_t colIdx) {
+    KU_ASSERT(!vector->state->isFlat());
+    auto& schema = *getTableSchema();
+    auto colOffset = schema.getColOffset(colIdx);
+    uint64_t mayMatchIdx = 0;
+    if (vector->hasNoNullsGuarantee()) {
+        for (auto i = 0u; i < numMayMatches; i++) {
+            auto idx = mayMatchIdxes[i];
+            auto& slot = *hashSlotsToUpdateAggState[idx];
+            auto isEntryKeyNull = factorizedTable->isNonOverflowColNull(
+                slot.getEntry() + schema.getNullMapOffset(), colIdx);
+            if (isEntryKeyNull) {
+                noMatchIdxes[numNoMatches++] = idx;
+                continue;
+            }
+            if (compareEntryFuncs[colIdx](vector, idx, slot.getEntry() + colOffset)) {
+                mayMatchIdxes[mayMatchIdx++] = idx;
+            } else {
+                noMatchIdxes[numNoMatches++] = idx;
+            }
+        }
+    } else {
+        for (auto i = 0u; i < numMayMatches; i++) {
+            auto idx = mayMatchIdxes[i];
+            auto isKeyVectorNull = vector->isNull(idx);
+            auto& slot = *hashSlotsToUpdateAggState[idx];
+            auto isEntryKeyNull = factorizedTable->isNonOverflowColNull(
+                slot.getEntry() + schema.getNullMapOffset(), colIdx);
+            if (isKeyVectorNull && isEntryKeyNull) {
+                mayMatchIdxes[mayMatchIdx++] = idx;
+                continue;
+            } else if (isKeyVectorNull != isEntryKeyNull) {
+                noMatchIdxes[numNoMatches++] = idx;
+                continue;
+            }
+
+            if (compareEntryFuncs[colIdx](vector, idx, slot.getEntry() + colOffset)) {
+                mayMatchIdxes[mayMatchIdx++] = idx;
+            } else {
+                noMatchIdxes[numNoMatches++] = idx;
+            }
+        }
+    }
+    return mayMatchIdx;
+}
+
+uint64_t AggregateHashTable::matchFlatVecWithFTColumn(const ValueVector* vector,
+    uint64_t numMayMatches, uint64_t& numNoMatches, uint32_t colIdx) {
+    KU_ASSERT(vector->state->isFlat());
+    auto colOffset = getTableSchema()->getColOffset(colIdx);
+    uint64_t mayMatchIdx = 0;
+    auto pos = vector->state->getSelVector()[0];
+    auto isVectorNull = vector->isNull(pos);
+    for (auto i = 0u; i < numMayMatches; i++) {
+        auto idx = mayMatchIdxes[i];
+        auto& slot = *hashSlotsToUpdateAggState[idx];
+        auto isEntryKeyNull = factorizedTable->isNonOverflowColNull(
+            slot.getEntry() + getTableSchema()->getNullMapOffset(), colIdx);
+        if (isEntryKeyNull && isVectorNull) {
+            mayMatchIdxes[mayMatchIdx++] = idx;
+            continue;
+        } else if (isEntryKeyNull != isVectorNull) {
+            noMatchIdxes[numNoMatches++] = idx;
+            continue;
+        }
+        if (compareEntryFuncs[colIdx](vector, pos,
+                hashSlotsToUpdateAggState[idx]->getEntry() + colOffset)) {
+            mayMatchIdxes[mayMatchIdx++] = idx;
+        } else {
+            noMatchIdxes[numNoMatches++] = idx;
+        }
+    }
+    return mayMatchIdx;
+}
+
+void AggregateHashTable::initializeFTEntryWithFlatVec(ValueVector* flatVector,
+    uint64_t numEntriesToInitialize, uint32_t colIdx) {
+    KU_ASSERT(flatVector->state->isFlat());
+    auto colOffset = getTableSchema()->getColOffset(colIdx);
+    auto pos = flatVector->state->getSelVector()[0];
+    if (flatVector->isNull(pos)) {
+        for (auto i = 0u; i < numEntriesToInitialize; i++) {
+            auto idx = entryIdxesToInitialize[i];
+            auto& slot = *hashSlotsToUpdateAggState[idx];
+            factorizedTable->setNonOverflowColNull(
+                slot.getEntry() + getTableSchema()->getNullMapOffset(), colIdx);
+        }
+    } else {
+        for (auto i = 0u; i < numEntriesToInitialize; i++) {
+            auto idx = entryIdxesToInitialize[i];
+            auto& slot = *hashSlotsToUpdateAggState[idx];
+            flatVector->copyToRowData(pos, slot.getEntry() + colOffset,
+                factorizedTable->getInMemOverflowBuffer());
+        }
+    }
+}
+
+void AggregateHashTable::initializeFTEntryWithUnFlatVec(ValueVector* unFlatVector,
+    uint64_t numEntriesToInitialize, uint32_t colIdx) {
+    KU_ASSERT(!unFlatVector->state->isFlat());
+    auto colOffset = factorizedTable->getTableSchema()->getColOffset(colIdx);
+    if (unFlatVector->hasNoNullsGuarantee()) {
+        for (auto i = 0u; i < numEntriesToInitialize; i++) {
+            auto entryIdx = entryIdxesToInitialize[i];
+            auto& slot = *hashSlotsToUpdateAggState[entryIdx];
+            unFlatVector->copyToRowData(entryIdx, slot.getEntry() + colOffset,
+                factorizedTable->getInMemOverflowBuffer());
+        }
+    } else {
+        for (auto i = 0u; i < numEntriesToInitialize; i++) {
+            auto entryIdx = entryIdxesToInitialize[i];
+            auto& slot = *hashSlotsToUpdateAggState[entryIdx];
+            factorizedTable->updateFlatCell(slot.getEntry(), colIdx, unFlatVector, entryIdx);
+        }
+    }
+}
+
+uint8_t* AggregateHashTable::createEntryInDistinctHT(
+    const std::vector<ValueVector*>& groupByHashKeyVectors, hash_t hash) {
+    auto entry = factorizedTable->appendEmptyTuple();
+    for (auto i = 0u; i < groupByHashKeyVectors.size(); i++) {
+        factorizedTable->updateFlatCell(entry, i, groupByHashKeyVectors[i],
+            groupByHashKeyVectors[i]->state->getSelVector()[0]);
+    }
+    factorizedTable->updateFlatCellNoNull(entry, hashColIdxInFT, &hash);
+    fillEntryWithInitialNullAggregateState(*factorizedTable, entry);
+    fillHashSlot(hash, entry);
+    return entry;
+}
+
+void AggregateHashTable::increaseSlotIdx(uint64_t& slotIdx) const {
+    slotIdx = (slotIdx + 1) % maxNumHashSlots;
+}
+
+void AggregateHashTable::initTmpHashSlotsAndIdxes(const FactorizedTable& sourceTable,
+    uint64_t startOffset, uint64_t numTuples) {
+    for (size_t i = 0; i < numTuples; i++) {
+        tmpValueIdxes[i] = i;
+        auto hash = getHash(sourceTable, startOffset + i);
+        hashVector->setValue(i, hash);
+        tmpSlotIdxes[i] = getSlotIdxForHash(hash);
+        hashSlotsToUpdateAggState[i] = getHashSlot(tmpSlotIdxes[i]);
+    }
+}
+
+void AggregateHashTable::initTmpHashSlotsAndIdxes() {
+    auto& hashSelVector = hashVector->state->getSelVector();
+    if (hashSelVector.isUnfiltered()) {
+        for (auto i = 0u; i < hashSelVector.getSelSize(); i++) {
+            tmpValueIdxes[i] = i;
+            tmpSlotIdxes[i] = getSlotIdxForHash(hashVector->getValue<hash_t>(i));
+            hashSlotsToUpdateAggState[i] = getHashSlot(tmpSlotIdxes[i]);
+        }
+    } else {
+        for (auto i = 0u; i < hashSelVector.getSelSize(); i++) {
+            auto pos = hashSelVector[i];
+            tmpValueIdxes[i] = pos;
+            tmpSlotIdxes[pos] = getSlotIdxForHash(hashVector->getValue<hash_t>(pos));
+            hashSlotsToUpdateAggState[pos] = getHashSlot(tmpSlotIdxes[pos]);
+        }
+    }
+}
+
+void AggregateHashTable::increaseHashSlotIdxes(uint64_t numNoMatches) {
+    for (auto i = 0u; i < numNoMatches; i++) {
+        auto idx = noMatchIdxes[i];
+        increaseSlotIdx(tmpSlotIdxes[idx]);
+        hashSlotsToUpdateAggState[idx] = getHashSlot(tmpSlotIdxes[idx]);
+    }
+}
+
+void AggregateHashTable::findHashSlots(const std::vector<ValueVector*>& keyVectors,
+    const std::vector<ValueVector*>& dependentKeyVectors, const DataChunkState* leadingState) {
+    initTmpHashSlotsAndIdxes();
+    auto numEntriesToFindHashSlots = leadingState->getSelSize();
+    KU_ASSERT(getNumEntries() + numEntriesToFindHashSlots < maxNumHashSlots);
+    while (numEntriesToFindHashSlots > 0) {
+        uint64_t numFTEntriesToUpdate = 0;
+        uint64_t numMayMatches = 0;
+        uint64_t numNoMatches = 0;
+        for (auto i = 0u; i < numEntriesToFindHashSlots; i++) {
+            auto idx = tmpValueIdxes[i];
+            auto hash = hashVector->getValue<hash_t>(idx);
+            auto slot = hashSlotsToUpdateAggState[idx];
+            if (slot->getEntry() == nullptr) {
+                entryIdxesToInitialize[numFTEntriesToUpdate++] = idx;
+                *slot = HashSlot(hash, factorizedTable->appendEmptyTuple());
+            } else if (slot->checkFingerprint(hash)) {
+                mayMatchIdxes[numMayMatches++] = idx;
+            } else {
+                noMatchIdxes[numNoMatches++] = idx;
+            }
+        }
+        initializeFTEntries(keyVectors, dependentKeyVectors, numFTEntriesToUpdate);
+        numNoMatches = matchFTEntries(constSpan(keyVectors), numMayMatches, numNoMatches);
+        increaseHashSlotIdxes(numNoMatches);
+        KU_ASSERT(numNoMatches <= numEntriesToFindHashSlots);
+        numEntriesToFindHashSlots = numNoMatches;
+        memcpy(tmpValueIdxes.get(), noMatchIdxes.get(), numNoMatches * sizeof(uint64_t));
+    }
+}
+
+void AggregateHashTable::findHashSlots(const FactorizedTable& srcTable, uint64_t startOffset,
+    uint64_t numEntriesToFindHashSlots) {
+    initTmpHashSlotsAndIdxes(srcTable, startOffset, numEntriesToFindHashSlots);
+    KU_ASSERT(getNumEntries() + numEntriesToFindHashSlots < maxNumHashSlots);
+    while (numEntriesToFindHashSlots > 0) {
+        uint64_t numFTEntriesToUpdate = 0;
+        uint64_t numMayMatches = 0;
+        uint64_t numNoMatches = 0;
+        for (auto i = 0u; i < numEntriesToFindHashSlots; i++) {
+            auto idx = tmpValueIdxes[i];
+            auto slot = hashSlotsToUpdateAggState[idx];
+            auto hash = hashVector->getValue<hash_t>(idx);
+            if (slot->getEntry() == nullptr) {
+                entryIdxesToInitialize[numFTEntriesToUpdate++] = idx;
+                *slot = HashSlot(hash, factorizedTable->appendEmptyTuple());
+            } else if (slot->checkFingerprint(hash)) {
+                mayMatchIdxes[numMayMatches++] = idx;
+            } else {
+                noMatchIdxes[numNoMatches++] = idx;
+            }
+        }
+        initializeFTEntries(srcTable, startOffset, numFTEntriesToUpdate);
+        numNoMatches = matchFTEntries(srcTable, startOffset, numMayMatches, numNoMatches);
+        increaseHashSlotIdxes(numNoMatches);
+        KU_ASSERT(numNoMatches <= numEntriesToFindHashSlots);
+        numEntriesToFindHashSlots = numNoMatches;
+        memcpy(tmpValueIdxes.get(), noMatchIdxes.get(), numNoMatches * sizeof(uint64_t));
+    }
+}
+
+void AggregateHashTable::appendDistinct(const std::vector<ValueVector*>& keyVectors,
+    ValueVector* aggregateVector, const DataChunkState* leadingState) {
+    std::vector<ValueVector*> distinctKeyVectors(keyVectors);
+    distinctKeyVectors.push_back(aggregateVector);
+    // The aggregateVector's state is either the same as the leading state (doesn't matter which we
+    // use), flat (where we must pass the original leading state), or unflat while the leadingState
+    // is flat (where we must pass the aggregateVector's state)
+    auto distinctLeadingState =
+        aggregateVector->state->isFlat() ? leadingState : aggregateVector->state.get();
+    append(distinctKeyVectors, distinctLeadingState, std::vector<AggregateInput>{},
+        1 /*multiplicity*/);
+}
+
+void AggregateHashTable::updateAggState(const std::vector<ValueVector*>& keyVectors,
+    AggregateFunction& aggregateFunction, ValueVector* aggVector, uint64_t multiplicity,
+    uint32_t aggStateOffset, const DataChunkState* leadingState) {
+    //  There may be a mix of flat and unflat states, but any unflat states will be the same
+    bool allFlat = leadingState->isFlat();
+    if (!aggVector) {
+        updateNullAggVectorState(*leadingState, aggregateFunction, multiplicity, aggStateOffset);
+    } else if (aggVector->state->isFlat() && allFlat) {
+        updateBothFlatAggVectorState(aggregateFunction, aggVector, multiplicity, aggStateOffset);
+    } else if (aggVector->state->isFlat()) {
+        updateFlatUnFlatKeyFlatAggVectorState(*leadingState, aggregateFunction, aggVector,
+            multiplicity, aggStateOffset);
+    } else if (allFlat) {
+        updateFlatKeyUnFlatAggVectorState(keyVectors, aggregateFunction, aggVector, multiplicity,
+            aggStateOffset);
+    } else if (aggVector->state.get() == leadingState) {
+        updateBothUnFlatSameDCAggVectorState(aggregateFunction, aggVector, multiplicity,
+            aggStateOffset);
+    } else {
+        updateBothUnFlatDifferentDCAggVectorState(*leadingState, aggregateFunction, aggVector,
+            multiplicity, aggStateOffset);
+    }
+}
+
+void AggregateHashTable::updateAggStates(const std::vector<ValueVector*>& keyVectors,
+    const std::vector<AggregateInput>& aggregateInputs, uint64_t resultSetMultiplicity,
+    const DataChunkState* leadingState) {
+    auto aggregateStateOffset = aggStateColOffsetInFT;
+    for (auto i = 0u; i < aggregateFunctions.size(); i++) {
+        if (!aggregateFunctions[i].isDistinct) {
+            auto multiplicity = resultSetMultiplicity;
+            for (auto& dataChunk : aggregateInputs[i].multiplicityChunks) {
+                multiplicity *= dataChunk->state->getSelVector().getSelSize();
+            }
+            updateAggState(keyVectors, aggregateFunctions[i], aggregateInputs[i].aggregateVector,
+                multiplicity, aggregateStateOffset, leadingState);
+            aggregateStateOffset += aggregateFunctions[i].getAggregateStateSize();
+        } else {
+            // If a function is distinct we still need to insert the value into the distinct
+            // hash table
+            distinctHashTables[i]->appendDistinct(keyVectors, aggregateInputs[i].aggregateVector,
+                leadingState);
+        }
+    }
+}
+
+void AggregateHashTable::fillEntryWithInitialNullAggregateState(FactorizedTable& table,
+    uint8_t* entry) {
+    for (auto i = 0u; i < aggregateFunctions.size(); i++) {
+        table.updateFlatCellNoNull(entry, aggStateColIdxInFT + i,
+            (void*)aggregateFunctions[i].getInitialNullAggregateState());
+    }
+}
+
+void AggregateHashTable::fillHashSlot(hash_t hash, uint8_t* groupByKeysAndAggregateStateBuffer) {
+    auto slotIdx = getSlotIdxForHash(hash);
+    auto hashSlot = getHashSlot(slotIdx);
+    while (true) {
+        if (hashSlot->getEntry()) {
+            increaseSlotIdx(slotIdx);
+            hashSlot = getHashSlot(slotIdx);
+            continue;
+        }
+        break;
+    }
+    *hashSlot = HashSlot(hash, groupByKeysAndAggregateStateBuffer);
+}
+
+void AggregateHashTable::addDataBlocksIfNecessary(uint64_t maxNumHashSlots) {
+    auto numHashSlotsPerBlock = static_cast<uint64_t>(1) << numSlotsPerBlockLog2;
+    auto numHashSlotsBlocksNeeded =
+        (maxNumHashSlots + numHashSlotsPerBlock - 1) / numHashSlotsPerBlock;
+    while (hashSlotsBlocks.size() < numHashSlotsBlocksNeeded) {
+        hashSlotsBlocks.emplace_back(std::make_unique<DataBlock>(memoryManager, HASH_BLOCK_SIZE));
+    }
+}
+
+void AggregateHashTable::resizeHashTableIfNecessary(uint32_t maxNumDistinctHashKeys) {
+    if (factorizedTable->getNumTuples() + maxNumDistinctHashKeys > maxNumHashSlots ||
+        static_cast<double>(factorizedTable->getNumTuples()) + maxNumDistinctHashKeys >
+            static_cast<double>(maxNumHashSlots) / DEFAULT_HT_LOAD_FACTOR) {
+        resize(std::max(factorizedTable->getNumTuples() + maxNumDistinctHashKeys, maxNumHashSlots) *
+               DEFAULT_HT_LOAD_FACTOR);
+    }
+}
+
+void AggregateHashTable::updateNullAggVectorState(const DataChunkState& keyState,
+    AggregateFunction& aggregateFunction, uint64_t multiplicity, uint32_t aggStateOffset) {
+    if (keyState.isFlat()) {
+        auto pos = keyState.getSelVector()[0];
+        aggregateFunction.updatePosState(hashSlotsToUpdateAggState[pos]->getEntry() +
+                                             aggStateOffset,
+            nullptr, multiplicity, 0 /* dummy pos */, factorizedTable->getInMemOverflowBuffer());
+    } else {
+        keyState.getSelVector().forEach([&](auto pos) {
+            aggregateFunction.updatePosState(
+                hashSlotsToUpdateAggState[pos]->getEntry() + aggStateOffset, nullptr, multiplicity,
+                0 /* dummy pos */, factorizedTable->getInMemOverflowBuffer());
+        });
+    }
+}
+
+void AggregateHashTable::updateBothFlatAggVectorState(AggregateFunction& aggregateFunction,
+    ValueVector* aggVector, uint64_t multiplicity, uint32_t aggStateOffset) {
+    auto aggPos = aggVector->state->getSelVector()[0];
+    if (!aggVector->isNull(aggPos)) {
+        aggregateFunction.updatePosState(
+            hashSlotsToUpdateAggState[hashVector->state->getSelVector()[0]]->getEntry() +
+                aggStateOffset,
+            aggVector, multiplicity, aggPos, factorizedTable->getInMemOverflowBuffer());
+    }
+}
+
+void AggregateHashTable::updateFlatUnFlatKeyFlatAggVectorState(const DataChunkState& unFlatKeyState,
+    AggregateFunction& aggregateFunction, ValueVector* aggVector, uint64_t multiplicity,
+    uint32_t aggStateOffset) {
+    auto aggPos = aggVector->state->getSelVector()[0];
+    if (!aggVector->isNull(aggPos)) {
+        unFlatKeyState.getSelVector().forEach([&](auto pos) {
+            aggregateFunction.updatePosState(hashSlotsToUpdateAggState[pos]->getEntry() +
+                                                 aggStateOffset,
+                aggVector, multiplicity, aggPos, factorizedTable->getInMemOverflowBuffer());
+        });
+    }
+}
+
+void AggregateHashTable::updateFlatKeyUnFlatAggVectorState(
+    const std::vector<ValueVector*>& flatKeyVectors, AggregateFunction& aggregateFunction,
+    ValueVector* aggVector, uint64_t multiplicity, uint32_t aggStateOffset) {
+    auto groupByKeyPos = flatKeyVectors[0]->state->getSelVector()[0];
+    aggVector->forEachNonNull([&](auto pos) {
+        aggregateFunction.updatePosState(hashSlotsToUpdateAggState[groupByKeyPos]->getEntry() +
+                                             aggStateOffset,
+            aggVector, multiplicity, pos, factorizedTable->getInMemOverflowBuffer());
+    });
+}
+
+void AggregateHashTable::updateBothUnFlatSameDCAggVectorState(AggregateFunction& aggregateFunction,
+    ValueVector* aggVector, uint64_t multiplicity, uint32_t aggStateOffset) {
+    aggVector->forEachNonNull([&](auto pos) {
+        aggregateFunction.updatePosState(hashSlotsToUpdateAggState[pos]->getEntry() +
+                                             aggStateOffset,
+            aggVector, multiplicity, pos, factorizedTable->getInMemOverflowBuffer());
+    });
+}
+
+void AggregateHashTable::updateBothUnFlatDifferentDCAggVectorState(
+    const DataChunkState& unFlatKeyState, AggregateFunction& aggregateFunction,
+    ValueVector* aggVector, uint64_t multiplicity, uint32_t aggStateOffset) {
+    unFlatKeyState.getSelVector().forEach([&](auto pos) {
+        aggregateFunction.updateAllState(hashSlotsToUpdateAggState[pos]->getEntry() +
+                                             aggStateOffset,
+            aggVector, multiplicity, factorizedTable->getInMemOverflowBuffer());
+    });
+}
+
+FactorizedTableSchema AggregateHashTableUtils::getTableSchemaForKeys(
+    const std::vector<common::LogicalType>& groupByKeyTypes,
+    const common::LogicalType& distinctKeyType) {
+    auto tableSchema = FactorizedTableSchema();
+    // Group by key columns
+    for (auto i = 0u; i < groupByKeyTypes.size(); i++) {
+        auto size = LogicalTypeUtils::getRowLayoutSize(groupByKeyTypes[i]);
+        auto columnSchema = ColumnSchema(false /* isUnFlat */, 0 /* groupID */, size);
+        // This isn't really necessary except in the global queues, but it's easier to just always
+        // set it here
+        columnSchema.setMayContainsNullsToTrue();
+        tableSchema.appendColumn(std::move(columnSchema));
+    }
+    // Distinct key column
+    auto columnSchema = ColumnSchema(false /* isUnFlat */, 0 /* groupID */,
+        LogicalTypeUtils::getRowLayoutSize(distinctKeyType));
+    columnSchema.setMayContainsNullsToTrue();
+    tableSchema.appendColumn(std::move(columnSchema));
+    // Hash column
+    tableSchema.appendColumn(ColumnSchema(false /* isUnFlat */, 0 /* groupID */, sizeof(hash_t)));
+    return tableSchema;
+}
+
+std::unique_ptr<AggregateHashTable> AggregateHashTableUtils::createDistinctHashTable(
+    MemoryManager& memoryManager, const std::vector<LogicalType>& groupByKeyTypes,
+    const LogicalType& distinctKeyType) {
+    std::vector<LogicalType> hashKeyTypes(groupByKeyTypes.size() + 1);
+    auto i = 0u;
+    // Group by key columns
+    for (; i < groupByKeyTypes.size(); i++) {
+        hashKeyTypes[i] = groupByKeyTypes[i].copy();
+    }
+    // Distinct key column
+    hashKeyTypes[i] = distinctKeyType.copy();
+    return std::make_unique<AggregateHashTable>(memoryManager, std::move(hashKeyTypes),
+        std::vector<LogicalType>{} /* empty payload types */, 0 /* numEntriesToAllocate */,
+        getTableSchemaForKeys(groupByKeyTypes, distinctKeyType));
+}
+
+uint64_t PartitioningAggregateHashTable::append(const std::vector<ValueVector*>& keyVectors,
+    const std::vector<ValueVector*>& dependentKeyVectors,
+    const common::DataChunkState* leadingState, const std::vector<AggregateInput>& aggregateInputs,
+    uint64_t resultSetMultiplicity) {
+    const auto numFlatTuples = leadingState->getSelVector().getSelSize();
+
+    mergeIfFull(numFlatTuples);
+
+    // mergeAll makes use of the hashVector, so it needs to be called before computeVectorHashes
+    computeVectorHashes(keyVectors);
+    KU_ASSERT(
+        hashVector->getSelVectorPtr()->getSelSize() == leadingState->getSelVector().getSelSize());
+    findHashSlots(keyVectors, dependentKeyVectors, leadingState);
+    // Don't update distinct states since they can't be merged into the global hash tables.
+    // Instead we'll calculate them from scratch when merging.
+    updateAggStates(keyVectors, aggregateInputs, resultSetMultiplicity, leadingState);
+    return numFlatTuples;
+}
+
+bool outOfSpace(const AggregateHashTable& hashTable, uint64_t newNumTuples) {
+    return hashTable.getNumEntries() + newNumTuples > hashTable.getCapacity() ||
+           static_cast<double>(hashTable.getNumEntries()) + newNumTuples >
+               static_cast<double>(hashTable.getCapacity()) / DEFAULT_HT_LOAD_FACTOR;
+}
+
+void PartitioningAggregateHashTable::mergeIfFull(uint64_t tuplesToAdd, bool mergeAll) {
+    if (mergeAll || outOfSpace(*this, tuplesToAdd)) {
+        partitioningData->appendTuples(*factorizedTable,
+            tableSchema.getColOffset(tableSchema.getNumColumns() - 1));
+        // Move overflow data into the shared state so that it isn't obliterated when we clear
+        // the factorized table
+        partitioningData->appendOverflow(std::move(*factorizedTable->getInMemOverflowBuffer()));
+        clear();
+    }
+    bool anyToMerge = mergeAll;
+    if (!mergeAll) {
+        for (const auto& hashTable : distinctHashTables) {
+            if (hashTable && outOfSpace(*hashTable, tuplesToAdd)) {
+                anyToMerge = true;
+                break;
+            }
+        }
+    }
+    // If no distinct hash tables need to be merged, skip the setup needed for merging
+    if (!anyToMerge) {
+        return;
+    }
+    std::vector<ValueVector*> vectors;
+    std::vector<std::unique_ptr<ValueVector>> keyVectors;
+    std::vector<ft_col_idx_t> colIdxToScan;
+    if (distinctHashTables.size() > 0) {
+        // We need the hashes of the key columns to partition them appropriately.
+        // These will be the same for each of the distinct hash tables since we exclude the
+        // distinct aggregate key Reserve inside here so that we don't unnecessarily allocate
+        // memory if there are no distinct hash tables
+        colIdxToScan.resize(keyTypes.size());
+        std::iota(colIdxToScan.begin(), colIdxToScan.end(), 0);
+        vectors.reserve(keyTypes.size());
+        keyVectors.reserve(keyTypes.size());
+        auto state = std::make_shared<DataChunkState>();
+
+        for (const auto& keyType : keyTypes) {
+            keyVectors.push_back(
+                std::make_unique<ValueVector>(keyType.copy(), memoryManager, state));
+            vectors.push_back(keyVectors.back().get());
+        }
+    }
+    for (size_t distinctIdx = 0; distinctIdx < distinctHashTables.size(); distinctIdx++) {
+        auto& distinctHashTable = distinctHashTables[distinctIdx];
+        if (distinctHashTable && (mergeAll || outOfSpace(*distinctHashTable, tuplesToAdd))) {
+            auto* distinctFactorizedTable = distinctHashTables[distinctIdx]->getFactorizedTable();
+            auto distinctTableSchema = distinctFactorizedTable->getTableSchema();
+            uint64_t startTupleIdx = 0;
+            auto numTuplesToScan =
+                std::min(distinctFactorizedTable->getNumTuples(), DEFAULT_VECTOR_CAPACITY);
+            while (startTupleIdx < distinctFactorizedTable->getNumTuples()) {
+                distinctFactorizedTable->scan(vectors, startTupleIdx, numTuplesToScan,
+                    colIdxToScan);
+                computeVectorHashes(vectors);
+                for (uint64_t tupleIdx = 0; tupleIdx < numTuplesToScan; tupleIdx++) {
+                    auto* tuple = distinctFactorizedTable->getTuple(startTupleIdx + tupleIdx);
+                    // The distinct value needs to be partitioned according to the group that
+                    // stores its aggregate state So we need to ignore the aggregate key when
+                    // calculating the hash for partitioning
+                    const auto hash = hashVector->getValue<hash_t>(tupleIdx);
+                    partitioningData->appendDistinctTuple(distinctIdx,
+                        std::span(tuple, distinctTableSchema->getNumBytesPerTuple()), hash);
+                }
+                startTupleIdx += numTuplesToScan;
+                numTuplesToScan = std::min(distinctFactorizedTable->getNumTuples() - startTupleIdx,
+                    DEFAULT_VECTOR_CAPACITY);
+            }
+
+            partitioningData->appendOverflow(
+                std::move(*distinctFactorizedTable->getInMemOverflowBuffer()));
+            distinctHashTable->clear();
+        }
+    }
+}
+
+void AggregateHashTable::clear() {
+    factorizedTable->clear();
+    // Clear hash table
+    for (auto& block : hashSlotsBlocks) {
+        block->resetToZero();
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/base_aggregate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/base_aggregate.cpp
new file mode 100644
index 0000000000..4287985935
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/base_aggregate.cpp
@@ -0,0 +1,100 @@
+#include "processor/operator/aggregate/base_aggregate.h"
+
+#include "main/client_context.h"
+#include "processor/operator/aggregate/aggregate_hash_table.h"
+
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+size_t getNumPartitionsForParallelism(main::ClientContext* context) {
+    return context->getMaxNumThreadForExec();
+}
+
+BaseAggregateSharedState::BaseAggregateSharedState(
+    const std::vector<AggregateFunction>& aggregateFunctions, size_t numPartitions)
+    : currentOffset{0}, aggregateFunctions{copyVector(aggregateFunctions)}, numThreads{0},
+      // numPartitions - 1 since we want the bit width of the largest value that
+      // could be used to index the partitions
+      shiftForPartitioning{
+          static_cast<uint8_t>(sizeof(common::hash_t) * 8 - std::bit_width(numPartitions - 1))},
+      readyForFinalization{false} {}
+
+void BaseAggregate::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* /*context*/) {
+    for (auto& info : aggInfos) {
+        auto aggregateInput = AggregateInput();
+        if (info.aggVectorPos.dataChunkPos == INVALID_DATA_CHUNK_POS) {
+            aggregateInput.aggregateVector = nullptr;
+        } else {
+            aggregateInput.aggregateVector = resultSet->getValueVector(info.aggVectorPos).get();
+        }
+        for (auto dataChunkPos : info.multiplicityChunksPos) {
+            aggregateInput.multiplicityChunks.push_back(
+                resultSet->getDataChunk(dataChunkPos).get());
+        }
+        aggInputs.push_back(std::move(aggregateInput));
+    }
+}
+
+BaseAggregateSharedState::HashTableQueue::HashTableQueue(storage::MemoryManager* memoryManager,
+    FactorizedTableSchema tableSchema) {
+    headBlock = new TupleBlock(memoryManager, std::move(tableSchema));
+    numTuplesPerBlock = headBlock.load()->table.getNumTuplesPerBlock();
+}
+
+BaseAggregateSharedState::HashTableQueue::~HashTableQueue() {
+    delete headBlock.load();
+    TupleBlock* block = nullptr;
+    while (queuedTuples.pop(block)) {
+        delete block;
+    }
+}
+
+void BaseAggregateSharedState::HashTableQueue::appendTuple(std::span<uint8_t> tuple) {
+    while (true) {
+        auto* block = headBlock.load();
+        KU_ASSERT(tuple.size() == block->table.getTableSchema()->getNumBytesPerTuple());
+        auto posToWrite = block->numTuplesReserved++;
+        if (posToWrite < numTuplesPerBlock) {
+            memcpy(block->table.getTuple(posToWrite), tuple.data(), tuple.size());
+            block->numTuplesWritten++;
+            return;
+        } else {
+            // No more space in the block, allocate and replace it
+            auto* newBlock = new TupleBlock(block->table.getMemoryManager(),
+                block->table.getTableSchema()->copy());
+            if (headBlock.compare_exchange_strong(block, newBlock)) {
+                // TODO(bmwinger): if the queuedTuples has at least a certain size (benchmark to see
+                // if there's a benefit to waiting for multiple blocks) then cycle through the queue
+                // and flush any blocks which have been fully written
+                queuedTuples.push(block);
+            } else {
+                // If the block was replaced by another thread, discard the block we created and try
+                // again with the block allocated by the other thread
+                delete newBlock;
+            }
+        }
+    }
+}
+
+void BaseAggregateSharedState::HashTableQueue::mergeInto(AggregateHashTable& hashTable) {
+    TupleBlock* partitionToMerge = nullptr;
+    auto headBlock = this->headBlock.load();
+    KU_ASSERT(headBlock != nullptr);
+    while (queuedTuples.pop(partitionToMerge)) {
+        KU_ASSERT(
+            partitionToMerge->numTuplesWritten == partitionToMerge->table.getNumTuplesPerBlock());
+        hashTable.merge(std::move(partitionToMerge->table));
+        delete partitionToMerge;
+    }
+    if (headBlock->numTuplesWritten > 0) {
+        headBlock->table.resize(headBlock->numTuplesWritten);
+        hashTable.merge(std::move(headBlock->table));
+    }
+    delete headBlock;
+    this->headBlock = nullptr;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/base_aggregate_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/base_aggregate_scan.cpp
new file mode 100644
index 0000000000..6cdc06f185
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/base_aggregate_scan.cpp
@@ -0,0 +1,18 @@
+#include "processor/operator/aggregate/base_aggregate_scan.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+void BaseAggregateScan::initLocalStateInternal(ResultSet* resultSet,
+    ExecutionContext* /*context*/) {
+    for (auto& dataPos : scanInfo.aggregatesPos) {
+        auto valueVector = resultSet->getValueVector(dataPos);
+        aggregateVectors.push_back(valueVector);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/hash_aggregate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/hash_aggregate.cpp
new file mode 100644
index 0000000000..32b5fe2327
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/hash_aggregate.cpp
@@ -0,0 +1,265 @@
+#include "processor/operator/aggregate/hash_aggregate.h"
+
+#include <memory>
+
+#include "binder/expression/expression_util.h"
+#include "common/assert.h"
+#include "common/types/types.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "processor/operator/aggregate/aggregate_hash_table.h"
+#include "processor/operator/aggregate/aggregate_input.h"
+#include "processor/operator/aggregate/base_aggregate.h"
+#include "processor/result/factorized_table_schema.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::string HashAggregatePrintInfo::toString() const {
+    std::string result = "";
+    result += "Group By: ";
+    result += binder::ExpressionUtil::toString(keys);
+    if (!aggregates.empty()) {
+        result += ", Aggregates: ";
+        result += binder::ExpressionUtil::toString(aggregates);
+    }
+    if (limitNum != UINT64_MAX) {
+        result += ", Distinct Limit: " + std::to_string(limitNum);
+    }
+    return result;
+}
+
+HashAggregateInfo::HashAggregateInfo(std::vector<DataPos> flatKeysPos,
+    std::vector<DataPos> unFlatKeysPos, std::vector<DataPos> dependentKeysPos,
+    FactorizedTableSchema tableSchema)
+    : flatKeysPos{std::move(flatKeysPos)}, unFlatKeysPos{std::move(unFlatKeysPos)},
+      dependentKeysPos{std::move(dependentKeysPos)}, tableSchema{std::move(tableSchema)} {}
+
+HashAggregateInfo::HashAggregateInfo(const HashAggregateInfo& other)
+    : flatKeysPos{other.flatKeysPos}, unFlatKeysPos{other.unFlatKeysPos},
+      dependentKeysPos{other.dependentKeysPos}, tableSchema{other.tableSchema.copy()} {}
+
+HashAggregateSharedState::HashAggregateSharedState(main::ClientContext* context,
+    HashAggregateInfo hashAggInfo,
+    const std::vector<function::AggregateFunction>& aggregateFunctions,
+    std::span<AggregateInfo> aggregateInfos, std::vector<LogicalType> keyTypes,
+    std::vector<LogicalType> payloadTypes)
+    : BaseAggregateSharedState{aggregateFunctions, getNumPartitionsForParallelism(context)},
+      aggInfo{std::move(hashAggInfo)}, limitNumber{common::INVALID_LIMIT},
+      memoryManager{MemoryManager::Get(*context)},
+      globalPartitions{getNumPartitionsForParallelism(context)} {
+    std::vector<LogicalType> distinctAggregateKeyTypes;
+    for (auto& aggInfo : aggregateInfos) {
+        distinctAggregateKeyTypes.push_back(aggInfo.distinctAggKeyType.copy());
+    }
+
+    // When copying directly into factorizedTables the table's schema's internal mayContainNulls
+    // won't be updated and it's probably less work to just always check nulls
+    // Skip the last column, which is the hash column and should never contain nulls
+    for (size_t i = 0; i < this->aggInfo.tableSchema.getNumColumns() - 1; i++) {
+        this->aggInfo.tableSchema.setMayContainsNullsToTrue(i);
+    }
+
+    auto& partition = globalPartitions[0];
+    partition.queue = std::make_unique<HashTableQueue>(MemoryManager::Get(*context),
+        this->aggInfo.tableSchema.copy());
+
+    // Always create a hash table for the first partition. Any other partitions which are non-empty
+    // when finalizing will create an empty copy of this table
+    partition.hashTable = std::make_unique<AggregateHashTable>(*MemoryManager::Get(*context),
+        std::move(keyTypes), std::move(payloadTypes), aggregateFunctions, distinctAggregateKeyTypes,
+        0, this->aggInfo.tableSchema.copy());
+    for (size_t functionIdx = 0; functionIdx < aggregateFunctions.size(); functionIdx++) {
+        auto& function = aggregateFunctions[functionIdx];
+        if (function.isFunctionDistinct()) {
+            // Create table schema for distinct hash table
+            auto distinctTableSchema = FactorizedTableSchema();
+            // Group by key columns
+            for (size_t i = 0;
+                 i < this->aggInfo.flatKeysPos.size() + this->aggInfo.unFlatKeysPos.size(); i++) {
+                distinctTableSchema.appendColumn(this->aggInfo.tableSchema.getColumn(i)->copy());
+                distinctTableSchema.setMayContainsNullsToTrue(i);
+            }
+            // Distinct key column
+            distinctTableSchema.appendColumn(ColumnSchema(false /*isUnFlat*/, 0 /*groupID*/,
+                LogicalTypeUtils::getRowLayoutSize(
+                    aggregateInfos[functionIdx].distinctAggKeyType)));
+            distinctTableSchema.setMayContainsNullsToTrue(distinctTableSchema.getNumColumns() - 1);
+            // Hash column
+            distinctTableSchema.appendColumn(
+                ColumnSchema(false /* isUnFlat */, 0 /* groupID */, sizeof(hash_t)));
+
+            partition.distinctTableQueues.emplace_back(std::make_unique<HashTableQueue>(
+                MemoryManager::Get(*context), std::move(distinctTableSchema)));
+        } else {
+            // dummy entry so that indices line up with the aggregateFunctions
+            partition.distinctTableQueues.emplace_back();
+        }
+    }
+    // Each partition is the same, so we create the list of distinct queues for the first partition
+    // and copy it to the other partitions
+    for (size_t i = 1; i < globalPartitions.size(); i++) {
+        globalPartitions[i].queue = std::make_unique<HashTableQueue>(MemoryManager::Get(*context),
+            this->aggInfo.tableSchema.copy());
+        globalPartitions[i].distinctTableQueues.resize(partition.distinctTableQueues.size());
+        std::transform(partition.distinctTableQueues.begin(), partition.distinctTableQueues.end(),
+            globalPartitions[i].distinctTableQueues.begin(), [&](auto& q) {
+                if (q.get() != nullptr) {
+                    return q->copy();
+                } else {
+                    return std::unique_ptr<HashTableQueue>();
+                }
+            });
+    }
+}
+
+std::pair<uint64_t, uint64_t> HashAggregateSharedState::getNextRangeToRead() {
+    std::unique_lock lck{mtx};
+    auto startOffset = currentOffset.load();
+    auto numTuples = getNumTuples();
+    if (startOffset >= numTuples) {
+        return std::make_pair(startOffset, startOffset);
+    }
+    // FactorizedTable::lookup resets the ValueVector and writes to the beginning,
+    // so we can't support scanning from multiple partitions at once
+    auto [table, tableStartOffset] = getPartitionForOffset(startOffset);
+    auto range = std::min(std::min(DEFAULT_VECTOR_CAPACITY, numTuples - startOffset),
+        table->getNumTuples() + tableStartOffset - startOffset);
+    currentOffset += range;
+    return std::make_pair(startOffset, startOffset + range);
+}
+
+uint64_t HashAggregateSharedState::getNumTuples() const {
+    uint64_t numTuples = 0;
+    for (auto& partition : globalPartitions) {
+        numTuples += partition.hashTable->getNumEntries();
+    }
+    return numTuples;
+}
+
+void HashAggregateSharedState::finalizePartitions() {
+    BaseAggregateSharedState::finalizePartitions(globalPartitions, [&](auto& partition) {
+        if (!partition.hashTable) {
+            // We always initialize the hash table in the first partition
+            partition.hashTable = std::make_unique<AggregateHashTable>(
+                globalPartitions[0].hashTable->createEmptyCopy());
+        }
+        // TODO(bmwinger): ideally these can be merged into a single function.
+        // The distinct tables need to be merged first so that they exist when the other table
+        // updates the agg states when it merges
+        for (size_t i = 0; i < partition.distinctTableQueues.size(); i++) {
+            if (partition.distinctTableQueues[i]) {
+                partition.distinctTableQueues[i]->mergeInto(
+                    *partition.hashTable->getDistinctHashTable(i));
+            }
+        }
+        partition.queue->mergeInto(*partition.hashTable);
+        partition.hashTable->mergeDistinctAggregateInfo();
+
+        partition.hashTable->finalizeAggregateStates();
+    });
+}
+
+std::tuple<const FactorizedTable*, offset_t> HashAggregateSharedState::getPartitionForOffset(
+    offset_t offset) const {
+    auto factorizedTableStartOffset = 0;
+    auto partitionIdx = 0;
+    const auto* table = globalPartitions[partitionIdx].hashTable->getFactorizedTable();
+    while (factorizedTableStartOffset + table->getNumTuples() <= offset) {
+        factorizedTableStartOffset += table->getNumTuples();
+        table = globalPartitions[++partitionIdx].hashTable->getFactorizedTable();
+    }
+    return std::make_tuple(table, factorizedTableStartOffset);
+}
+
+void HashAggregateSharedState::scan(std::span<uint8_t*> entries,
+    std::vector<common::ValueVector*>& keyVectors, offset_t startOffset, offset_t numTuplesToScan,
+    std::vector<uint32_t>& columnIndices) {
+    auto [table, tableStartOffset] = getPartitionForOffset(startOffset);
+    // Due to the way FactorizedTable::lookup works, it's necessary to read one partition
+    // at a time.
+    KU_ASSERT(startOffset - tableStartOffset + numTuplesToScan <= table->getNumTuples());
+    for (size_t pos = 0; pos < numTuplesToScan; pos++) {
+        auto posInTable = startOffset + pos - tableStartOffset;
+        entries[pos] = table->getTuple(posInTable);
+    }
+    table->lookup(keyVectors, columnIndices, entries.data(), 0, numTuplesToScan);
+    KU_ASSERT(true);
+}
+
+void HashAggregateSharedState::assertFinalized() const {
+    RUNTIME_CHECK(for (const auto& partition
+                       : globalPartitions) {
+        KU_ASSERT(partition.finalized);
+        KU_ASSERT(partition.queue->empty());
+    });
+}
+
+void HashAggregateLocalState::init(HashAggregateSharedState* sharedState, ResultSet& resultSet,
+    main::ClientContext* context, std::vector<function::AggregateFunction>& aggregateFunctions,
+    std::vector<common::LogicalType> distinctKeyTypes) {
+    auto& info = sharedState->getAggregateInfo();
+    std::vector<LogicalType> keyDataTypes;
+    for (auto& pos : info.flatKeysPos) {
+        auto vector = resultSet.getValueVector(pos).get();
+        keyVectors.push_back(vector);
+        keyDataTypes.push_back(vector->dataType.copy());
+    }
+    for (auto& pos : info.unFlatKeysPos) {
+        auto vector = resultSet.getValueVector(pos).get();
+        keyVectors.push_back(vector);
+        keyDataTypes.push_back(vector->dataType.copy());
+        leadingState = vector->state.get();
+    }
+    if (leadingState == nullptr) {
+        // All vectors are flat, so any can be the leading state
+        leadingState = keyVectors.front()->state.get();
+    }
+    std::vector<LogicalType> payloadDataTypes;
+    for (auto& pos : info.dependentKeysPos) {
+        auto vector = resultSet.getValueVector(pos).get();
+        dependentKeyVectors.push_back(vector);
+        payloadDataTypes.push_back(vector->dataType.copy());
+    }
+
+    aggregateHashTable = std::make_unique<PartitioningAggregateHashTable>(sharedState,
+        *MemoryManager::Get(*context), std::move(keyDataTypes), std::move(payloadDataTypes),
+        aggregateFunctions, std::move(distinctKeyTypes), info.tableSchema.copy());
+}
+
+uint64_t HashAggregateLocalState::append(const std::vector<AggregateInput>& aggregateInputs,
+    uint64_t multiplicity) const {
+    return aggregateHashTable->append(keyVectors, dependentKeyVectors, leadingState,
+        aggregateInputs, multiplicity);
+}
+
+void HashAggregate::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    BaseAggregate::initLocalStateInternal(resultSet, context);
+    std::vector<LogicalType> distinctAggKeyTypes;
+    for (auto& info : aggInfos) {
+        distinctAggKeyTypes.push_back(info.distinctAggKeyType.copy());
+    }
+    localState.init(common::ku_dynamic_cast<HashAggregateSharedState*>(sharedState.get()),
+        *resultSet, context->clientContext, aggregateFunctions, std::move(distinctAggKeyTypes));
+}
+
+void HashAggregate::executeInternal(ExecutionContext* context) {
+    while (children[0]->getNextTuple(context)) {
+        const auto numAppendedFlatTuples = localState.append(aggInputs, resultSet->multiplicity);
+        metrics->numOutputTuple.increase(numAppendedFlatTuples);
+        // Note: The limit count check here is only applicable to the distinct limit case.
+        if (localState.aggregateHashTable->getNumEntries() >=
+            getSharedStateReference().getLimitNumber()) {
+            break;
+        }
+    }
+    localState.aggregateHashTable->mergeIfFull(0 /*tuplesToAdd*/, true /*mergeAll*/);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/hash_aggregate_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/hash_aggregate_scan.cpp
new file mode 100644
index 0000000000..e8ab4c2bd4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/hash_aggregate_scan.cpp
@@ -0,0 +1,52 @@
+#include "processor/operator/aggregate/hash_aggregate_scan.h"
+
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+void HashAggregateScan::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    BaseAggregateScan::initLocalStateInternal(resultSet, context);
+    for (auto& dataPos : groupByKeyVectorsPos) {
+        auto valueVector = resultSet->getValueVector(dataPos);
+        groupByKeyVectors.push_back(valueVector.get());
+    }
+    groupByKeyVectorsColIdxes.resize(groupByKeyVectors.size());
+    iota(groupByKeyVectorsColIdxes.begin(), groupByKeyVectorsColIdxes.end(), 0);
+}
+
+bool HashAggregateScan::getNextTuplesInternal(ExecutionContext* /*context*/) {
+    auto [startOffset, endOffset] = sharedState->getNextRangeToRead();
+    if (startOffset >= endOffset) {
+        return false;
+    }
+    auto numRowsToScan = endOffset - startOffset;
+    entries.resize(numRowsToScan);
+    sharedState->scan(entries, groupByKeyVectors, startOffset, numRowsToScan,
+        groupByKeyVectorsColIdxes);
+    for (auto pos = 0u; pos < numRowsToScan; ++pos) {
+        auto entry = entries[pos];
+        auto offset = sharedState->getTableSchema()->getColOffset(groupByKeyVectors.size());
+        for (auto i = 0u; i < aggregateVectors.size(); i++) {
+            auto vector = aggregateVectors[i];
+            auto aggState = reinterpret_cast<AggregateState*>(entry + offset);
+            scanInfo.moveAggResultToVectorFuncs[i](*vector, pos, aggState);
+            offset += aggState->getStateSize();
+        }
+    }
+    metrics->numOutputTuple.increase(numRowsToScan);
+    return true;
+}
+
+double HashAggregateScan::getProgress(ExecutionContext* /*context*/) const {
+    uint64_t totalNumTuples = sharedState->getNumTuples();
+    if (totalNumTuples == 0) {
+        return 0.0;
+    } else if (sharedState->getCurrentOffset() == totalNumTuples) {
+        return 1.0;
+    }
+    return static_cast<double>(sharedState->getCurrentOffset()) / totalNumTuples;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/simple_aggregate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/simple_aggregate.cpp
new file mode 100644
index 0000000000..23079cf253
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/simple_aggregate.cpp
@@ -0,0 +1,275 @@
+#include "processor/operator/aggregate/simple_aggregate.h"
+
+#include <algorithm>
+#include <array>
+#include <cstdint>
+#include <vector>
+
+#include "binder/expression/expression_util.h"
+#include "common/data_chunk/data_chunk_state.h"
+#include "common/in_mem_overflow_buffer.h"
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "function/aggregate_function.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "processor/operator/aggregate/aggregate_hash_table.h"
+#include "processor/operator/aggregate/aggregate_input.h"
+#include "processor/operator/aggregate/base_aggregate.h"
+#include "processor/result/factorized_table.h"
+#include "processor/result/factorized_table_schema.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+std::string SimpleAggregatePrintInfo::toString() const {
+    std::string result = "";
+    result += "Aggregate: ";
+    result += binder::ExpressionUtil::toString(aggregates);
+    return result;
+}
+
+static bool isAnyFunctionDistinct(const std::vector<AggregateFunction>& functions) {
+    return std::any_of(functions.begin(), functions.end(),
+        [&](auto& func) { return func.isDistinct; });
+}
+
+SimpleAggregateSharedState::SimpleAggregateSharedState(main::ClientContext* context,
+    const std::vector<AggregateFunction>& aggregateFunctions,
+    const std::vector<AggregateInfo>& aggInfos)
+    : BaseAggregateSharedState{aggregateFunctions,
+          // Only distinct functions need partitioning
+          getNumPartitionsForParallelism(context)},
+      hasDistinct{isAnyFunctionDistinct(aggregateFunctions)},
+      globalPartitions{hasDistinct ? getNumPartitionsForParallelism(context) : 0},
+      aggregateOverflowBuffer{storage::MemoryManager::Get(*context)} {
+    auto mm = storage::MemoryManager::Get(*context);
+    for (size_t funcIdx = 0; funcIdx < this->aggregateFunctions.size(); funcIdx++) {
+        auto& aggregateFunction = this->aggregateFunctions[funcIdx];
+        globalAggregateStates.push_back(aggregateFunction.createInitialNullAggregateState());
+        partitioningData.emplace_back(this, funcIdx);
+        if (aggregateFunction.isDistinct) {
+            const auto& distinctKeyType = aggInfos[funcIdx].distinctAggKeyType;
+            auto schema = AggregateHashTableUtils::getTableSchemaForKeys(std::vector<LogicalType>{},
+                aggInfos[funcIdx].distinctAggKeyType);
+            for (auto& partition : globalPartitions) {
+                std::vector<LogicalType> keyTypes(1);
+                keyTypes[0] = distinctKeyType.copy();
+                auto hashTable = std::make_unique<AggregateHashTable>(*mm, std::move(keyTypes),
+                    std::vector<LogicalType>{} /*payloadTypes*/, std::vector<AggregateFunction>{},
+                    std::vector<LogicalType>{}, 0, schema.copy());
+                auto queue = std::make_unique<HashTableQueue>(mm,
+                    AggregateHashTableUtils::getTableSchemaForKeys(std::vector<LogicalType>{},
+                        aggInfos[funcIdx].distinctAggKeyType));
+                partition.distinctTables.emplace_back(Partition::DistinctData{std::move(hashTable),
+                    std::move(queue), aggregateFunction.createInitialNullAggregateState()});
+            }
+        } else {
+            for (auto& partition : globalPartitions) {
+                partition.distinctTables.emplace_back();
+            }
+        }
+    }
+}
+
+void SimpleAggregateSharedState::combineAggregateStates(
+    const std::vector<std::unique_ptr<AggregateState>>& localAggregateStates,
+    common::InMemOverflowBuffer&& localOverflowBuffer) {
+    KU_ASSERT(localAggregateStates.size() == globalAggregateStates.size());
+    std::unique_lock lck{mtx};
+    for (auto i = 0u; i < aggregateFunctions.size(); ++i) {
+        // Distinct functions will be combined accross the partitions in
+        // finalizeAggregateStates
+        aggregateOverflowBuffer.merge(localOverflowBuffer);
+        if (!aggregateFunctions[i].isDistinct) {
+            aggregateFunctions[i].combineState(
+                reinterpret_cast<uint8_t*>(globalAggregateStates[i].get()),
+                reinterpret_cast<uint8_t*>(localAggregateStates[i].get()),
+                &aggregateOverflowBuffer);
+        }
+    }
+}
+
+void SimpleAggregateSharedState::finalizeAggregateStates() {
+    std::unique_lock lck{mtx};
+    for (auto i = 0u; i < aggregateFunctions.size(); ++i) {
+        if (aggregateFunctions[i].isDistinct) {
+            for (auto& partition : globalPartitions) {
+                aggregateFunctions[i].combineState(reinterpret_cast<uint8_t*>(getAggregateState(i)),
+                    reinterpret_cast<uint8_t*>(partition.distinctTables[i].state.get()),
+                    &aggregateOverflowBuffer);
+            }
+        }
+        aggregateFunctions[i].finalizeState(
+            reinterpret_cast<uint8_t*>(globalAggregateStates[i].get()));
+    }
+}
+
+std::pair<uint64_t, uint64_t> SimpleAggregateSharedState::getNextRangeToRead() {
+    std::unique_lock lck{mtx};
+    if (currentOffset >= 1) {
+        return std::make_pair(currentOffset.load(), currentOffset.load());
+    }
+    auto startOffset = currentOffset.load();
+    currentOffset++;
+    return std::make_pair(startOffset, currentOffset.load());
+}
+
+void SimpleAggregateSharedState::SimpleAggregatePartitioningData::appendTuples(
+    const FactorizedTable& factorizedTable, ft_col_offset_t hashOffset) {
+    KU_ASSERT(sharedState->globalPartitions.size() > 0);
+    auto numBytesPerTuple = factorizedTable.getTableSchema()->getNumBytesPerTuple();
+    for (ft_tuple_idx_t tupleIdx = 0; tupleIdx < factorizedTable.getNumTuples(); tupleIdx++) {
+        auto tuple = factorizedTable.getTuple(tupleIdx);
+        auto hash = *reinterpret_cast<common::hash_t*>(tuple + hashOffset);
+        auto& partition =
+            sharedState->globalPartitions[(hash >> sharedState->shiftForPartitioning) %
+                                          sharedState->globalPartitions.size()];
+        partition.distinctTables[functionIdx].queue->appendTuple(
+            std::span(tuple, numBytesPerTuple));
+    }
+}
+
+// LCOV_EXCL_START
+void SimpleAggregateSharedState::SimpleAggregatePartitioningData::appendDistinctTuple(size_t,
+    std::span<uint8_t>, common::hash_t) {
+    KU_UNREACHABLE;
+}
+// LCOV_EXCL_END
+
+void SimpleAggregateSharedState::SimpleAggregatePartitioningData::appendOverflow(
+    common::InMemOverflowBuffer&& overflowBuffer) {
+    sharedState->overflow.push(
+        std::make_unique<common::InMemOverflowBuffer>(std::move(overflowBuffer)));
+}
+
+void SimpleAggregateSharedState::finalizePartitions(storage::MemoryManager* memoryManager,
+    const std::vector<AggregateInfo>& aggInfos) {
+    if (!hasDistinct) {
+        return;
+    }
+    InMemOverflowBuffer localOverflowBuffer(memoryManager);
+    BaseAggregateSharedState::finalizePartitions(globalPartitions, [&](auto& partition) {
+        for (size_t i = 0; i < partition.distinctTables.size(); i++) {
+            if (!aggregateFunctions[i].isDistinct) {
+                continue;
+            }
+            auto& [hashTable, queue, state] = partition.distinctTables[i];
+            if (queue) {
+                KU_ASSERT(hashTable);
+                queue->mergeInto(*hashTable);
+            }
+
+            ValueVector aggregateVector(aggInfos[i].distinctAggKeyType.copy(), memoryManager,
+                std::make_shared<DataChunkState>());
+            const auto& ft = hashTable->getFactorizedTable();
+            ft_tuple_idx_t startTupleIdx = 0;
+            ft_tuple_idx_t numTuplesToScan =
+                std::min(DEFAULT_VECTOR_CAPACITY, ft->getNumTuples() - startTupleIdx);
+            std::array<uint32_t, 1> colIdxToScan = {0};
+            std::array<ValueVector*, 1> vectors = {&aggregateVector};
+            while (numTuplesToScan > 0) {
+                ft->scan(vectors, startTupleIdx, numTuplesToScan, colIdxToScan);
+                aggregateFunctions[i].updateAllState((uint8_t*)state.get(), &aggregateVector,
+                    1 /*multiplicity*/, &localOverflowBuffer);
+                startTupleIdx += numTuplesToScan;
+                numTuplesToScan =
+                    std::min(DEFAULT_VECTOR_CAPACITY, ft->getNumTuples() - startTupleIdx);
+            }
+            hashTable.reset();
+            queue.reset();
+        }
+    });
+    {
+        std::unique_lock lck{mtx};
+        aggregateOverflowBuffer.merge(localOverflowBuffer);
+    }
+}
+
+void SimpleAggregate::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    BaseAggregate::initLocalStateInternal(resultSet, context);
+    for (auto i = 0u; i < aggregateFunctions.size(); ++i) {
+        auto& func = aggregateFunctions[i];
+        localAggregateStates.push_back(func.createInitialNullAggregateState());
+        std::unique_ptr<PartitioningAggregateHashTable> distinctHT;
+        if (func.isDistinct) {
+            auto mm = storage::MemoryManager::Get(*context->clientContext);
+            std::vector<LogicalType> keyTypes;
+            keyTypes.push_back(aggInfos[i].distinctAggKeyType.copy());
+            distinctHT = std::make_unique<PartitioningAggregateHashTable>(
+                &getSharedState().partitioningData[i], *mm, std::move(keyTypes),
+                std::vector<LogicalType>{} /* empty payload*/,
+                std::vector<function::AggregateFunction>{},
+                std::vector<LogicalType>{} /*empty distinct keys*/,
+                AggregateHashTableUtils::getTableSchemaForKeys(std::vector<LogicalType>{},
+                    aggInfos[i].distinctAggKeyType));
+        } else {
+            distinctHT = nullptr;
+        }
+        distinctHashTables.push_back(std::move(distinctHT));
+    };
+}
+
+void SimpleAggregate::executeInternal(ExecutionContext* context) {
+    InMemOverflowBuffer localOverflowBuffer(storage::MemoryManager::Get(*context->clientContext));
+    while (children[0]->getNextTuple(context)) {
+        for (auto i = 0u; i < aggregateFunctions.size(); i++) {
+            auto aggregateFunction = &aggregateFunctions[i];
+            if (aggregateFunction->isFunctionDistinct()) {
+                // Just add distinct value to the hash table. We'll calculate the aggregate state
+                // once it's been merged into the shared state
+                distinctHashTables[i]->appendDistinct(std::vector<ValueVector*>{},
+                    aggInputs[i].aggregateVector, aggInputs[i].aggregateVector->state.get());
+            } else {
+                computeAggregate(aggregateFunction, &aggInputs[i], localAggregateStates[i].get(),
+                    localOverflowBuffer);
+            }
+        }
+    }
+    if (getSharedState().hasDistinct) {
+        for (auto& hashTable : distinctHashTables) {
+            if (hashTable) {
+                hashTable->mergeIfFull(0 /*tuplesToAdd*/, true /*mergeAll*/);
+            }
+        }
+    }
+    getSharedState().combineAggregateStates(localAggregateStates, std::move(localOverflowBuffer));
+}
+
+void SimpleAggregate::computeAggregate(function::AggregateFunction* function, AggregateInput* input,
+    function::AggregateState* state, common::InMemOverflowBuffer& overflowBuffer) {
+    auto multiplicity = resultSet->multiplicity;
+    for (auto dataChunk : input->multiplicityChunks) {
+        multiplicity *= dataChunk->state->getSelVector().getSelSize();
+    }
+    if (input->aggregateVector && input->aggregateVector->state->isFlat()) {
+        auto pos = input->aggregateVector->state->getSelVector()[0];
+        if (!input->aggregateVector->isNull(pos)) {
+            function->updatePosState((uint8_t*)state, input->aggregateVector, multiplicity, pos,
+                &overflowBuffer);
+        }
+    } else {
+        function->updateAllState((uint8_t*)state, input->aggregateVector, multiplicity,
+            &overflowBuffer);
+    }
+}
+
+void SimpleAggregateFinalize::finalizeInternal(ExecutionContext* /*context*/) {
+    sharedState->finalizeAggregateStates();
+    if (metrics) {
+        metrics->numOutputTuple.incrementByOne();
+    }
+}
+
+void SimpleAggregateFinalize::executeInternal(ExecutionContext* context) {
+    KU_ASSERT(sharedState->isReadyForFinalization());
+    sharedState->finalizePartitions(storage::MemoryManager::Get(*context->clientContext), aggInfos);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/simple_aggregate_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/simple_aggregate_scan.cpp
new file mode 100644
index 0000000000..925c0b73b8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/aggregate/simple_aggregate_scan.cpp
@@ -0,0 +1,36 @@
+#include "processor/operator/aggregate/simple_aggregate_scan.h"
+
+namespace lbug {
+namespace processor {
+
+void SimpleAggregateScan::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    BaseAggregateScan::initLocalStateInternal(resultSet, context);
+    KU_ASSERT(!scanInfo.aggregatesPos.empty());
+    auto outDataChunkPos = scanInfo.aggregatesPos[0].dataChunkPos;
+    RUNTIME_CHECK({
+        for (auto& dataPos : scanInfo.aggregatesPos) {
+            KU_ASSERT(dataPos.dataChunkPos == outDataChunkPos);
+        }
+    });
+    outDataChunk = resultSet->dataChunks[outDataChunkPos].get();
+}
+
+bool SimpleAggregateScan::getNextTuplesInternal(ExecutionContext* /*context*/) {
+    auto [startOffset, endOffset] = sharedState->getNextRangeToRead();
+    if (startOffset >= endOffset) {
+        return false;
+    }
+    // Output of simple aggregate is guaranteed to be a single value for each aggregate.
+    KU_ASSERT(startOffset == 0 && endOffset == 1);
+    for (auto i = 0u; i < aggregateVectors.size(); i++) {
+        scanInfo.moveAggResultToVectorFuncs[i](*aggregateVectors[i], 0 /* position to write */,
+            sharedState->getAggregateState(i));
+    }
+    KU_ASSERT(!scanInfo.aggregatesPos.empty());
+    outDataChunk->state->initOriginalAndSelectedSize(1);
+    metrics->numOutputTuple.increase(outDataChunk->state->getSelVector().getSelSize());
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/arrow_result_collector.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/arrow_result_collector.cpp
new file mode 100644
index 0000000000..54142d351f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/arrow_result_collector.cpp
@@ -0,0 +1,102 @@
+#include "processor/operator/arrow_result_collector.h"
+
+#include "common/arrow/arrow_row_batch.h"
+#include "main/query_result/arrow_query_result.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+bool ArrowResultCollectorLocalState::advance() {
+    for (int64_t i = static_cast<int64_t>(chunks.size()) - 1; i >= 0; --i) {
+        chunkCursors[i]++;
+        if (chunkCursors[i] < chunks[i]->state->getSelSize()) {
+            return true;
+        }
+        chunkCursors[i] = 0;
+    }
+    return false;
+}
+
+void ArrowResultCollectorLocalState::fillTuple() {
+    KU_ASSERT(tuple->len() == vectors.size());
+    for (auto i = 0u; i < vectors.size(); ++i) {
+        auto vector = vectors[i];
+        auto pos = vector->state->getSelVector()[vectorsSelPos[i]];
+        auto data = vector->getData() + pos * vector->getNumBytesPerValue();
+        tuple->getValue(i)->copyFromColLayout(data, vector);
+    }
+}
+
+void ArrowResultCollectorLocalState::resetCursor() {
+    for (auto i = 0u; i < chunkCursors.size(); ++i) {
+        chunkCursors[i] = 0;
+    }
+}
+
+void ArrowResultCollectorSharedState::merge(const std::vector<ArrowArray>& localArrays) {
+    std::unique_lock lck{mutex};
+    for (auto i = 0u; i < localArrays.size(); ++i) {
+        arrays.push_back(localArrays[i]);
+    }
+}
+
+void ArrowResultCollector::executeInternal(ExecutionContext* context) {
+    auto rowBatch = std::make_unique<ArrowRowBatch>(info.columnTypes, info.chunkSize,
+        false /* fallbackExtensionTypes */);
+    while (children[0]->getNextTuple(context)) {
+        localState.resetCursor();
+        while (true) {
+            if (!fillRowBatch(*rowBatch)) {
+                break;
+            }
+            localState.arrays.push_back(rowBatch->toArray(info.columnTypes));
+            rowBatch = std::make_unique<ArrowRowBatch>(info.columnTypes, info.chunkSize,
+                false /* fallbackExtensionTypes */);
+        }
+    }
+    // Handle the last rowBatch whose size can be smaller than chunk size.
+    if (rowBatch->size() > 0) {
+        localState.arrays.push_back(rowBatch->toArray(info.columnTypes));
+    }
+    sharedState->merge(localState.arrays);
+}
+
+bool ArrowResultCollector::fillRowBatch(ArrowRowBatch& rowBatch) {
+    while (rowBatch.size() < info.chunkSize) {
+        localState.fillTuple();
+        rowBatch.append(*localState.tuple);
+        if (!localState.advance()) {
+            return false;
+        }
+    }
+    return true;
+}
+
+void ArrowResultCollector::initLocalStateInternal(ResultSet* resultSet, ExecutionContext*) {
+    std::unordered_map<idx_t, idx_t> idxMap; // Map result set chunk idx to local state idx
+    // Populate chunks
+    for (auto& pos : info.payloadPositions) {
+        auto idx = pos.dataChunkPos;
+        if (idxMap.contains(idx)) {
+            continue;
+        }
+        idxMap.insert({idx, localState.chunks.size()});
+        localState.chunks.push_back(resultSet->getDataChunk(idx).get());
+        localState.chunkCursors.push_back(0);
+    }
+    // Populate vectors
+    for (auto& pos : info.payloadPositions) {
+        localState.vectors.push_back(resultSet->getValueVector(pos).get());
+        localState.vectorsSelPos.push_back(localState.chunkCursors[idxMap.at(pos.dataChunkPos)]);
+    }
+    localState.tuple = std::make_unique<FlatTuple>(info.columnTypes);
+}
+
+std::unique_ptr<main::QueryResult> ArrowResultCollector::getQueryResult() const {
+    return std::make_unique<main::ArrowQueryResult>(std::move(sharedState->arrays), info.chunkSize);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/base_partitioner_shared_state.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/base_partitioner_shared_state.cpp
new file mode 100644
index 0000000000..f52cb3aa72
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/base_partitioner_shared_state.cpp
@@ -0,0 +1,37 @@
+#include "processor/operator/base_partitioner_shared_state.h"
+
+#include "storage/table/node_table.h"
+#include "transaction/transaction.h"
+
+namespace lbug::processor {
+void PartitionerSharedState::initialize(const common::logical_type_vec_t&,
+    common::idx_t numPartitioners, const main::ClientContext* clientContext) {
+    KU_ASSERT(numPartitioners >= 1 && numPartitioners <= DIRECTIONS);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    numNodes[0] = srcNodeTable->getNumTotalRows(transaction);
+    if (numPartitioners > 1) {
+        numNodes[1] = dstNodeTable->getNumTotalRows(transaction);
+    }
+    numPartitions[0] = getNumPartitionsFromRows(numNodes[0]);
+    if (numPartitioners > 1) {
+        numPartitions[1] = getNumPartitionsFromRows(numNodes[1]);
+    }
+}
+
+common::partition_idx_t PartitionerSharedState::getNextPartition(common::idx_t partitioningIdx) {
+    auto nextPartitionIdxToReturn = nextPartitionIdx++;
+    if (nextPartitionIdxToReturn >= numPartitions[partitioningIdx]) {
+        return common::INVALID_PARTITION_IDX;
+    }
+    return nextPartitionIdxToReturn;
+}
+
+common::partition_idx_t PartitionerSharedState::getNumPartitionsFromRows(common::offset_t numRows) {
+    return (numRows + common::StorageConfig::NODE_GROUP_SIZE - 1) /
+           common::StorageConfig::NODE_GROUP_SIZE;
+}
+
+void PartitionerSharedState::resetState(common::idx_t) {
+    nextPartitionIdx = 0;
+}
+} // namespace lbug::processor
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/cross_product.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/cross_product.cpp
new file mode 100644
index 0000000000..47b32d0c18
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/cross_product.cpp
@@ -0,0 +1,38 @@
+#include "processor/operator/cross_product.h"
+
+#include "common/metric.h"
+
+namespace lbug {
+namespace processor {
+
+void CrossProduct::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* /*context*/) {
+    for (auto& pos : info.outVecPos) {
+        vectorsToScan.push_back(resultSet->getValueVector(pos).get());
+    }
+    localState.init();
+}
+
+bool CrossProduct::getNextTuplesInternal(ExecutionContext* context) {
+    // Note: we should NOT morselize right table scanning (i.e. calling sharedState.getMorsel)
+    // because every thread should scan its own table.
+    auto table = localState.table.get();
+    if (table->getNumTuples() == 0) {
+        return false;
+    }
+    if (localState.startIdx == table->getNumTuples()) { // no more to scan from right
+        if (!children[0]->getNextTuple(context)) {      // fetch a new left tuple
+            return false;
+        }
+        localState.startIdx = 0; // reset right table scanning for a new left tuple
+    }
+    // scan from right table if there is tuple left
+    auto numTuplesToScan =
+        std::min(localState.maxMorselSize, table->getNumTuples() - localState.startIdx);
+    table->scan(vectorsToScan, localState.startIdx, numTuplesToScan, info.colIndicesToScan);
+    localState.startIdx += numTuplesToScan;
+    metrics->numOutputTuple.increase(numTuplesToScan);
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/CMakeLists.txt
new file mode 100644
index 0000000000..846d152fa6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/CMakeLists.txt
@@ -0,0 +1,11 @@
+add_library(lbug_processor_operator_ddl
+        OBJECT
+        alter.cpp
+        create_table.cpp
+        create_type.cpp
+        drop.cpp
+        create_sequence.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_ddl>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/alter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/alter.cpp
new file mode 100644
index 0000000000..7c8ee0c875
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/alter.cpp
@@ -0,0 +1,356 @@
+#include "processor/operator/ddl/alter.h"
+
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/enums/alter_type.h"
+#include "common/exception/binder.h"
+#include "common/exception/runtime.h"
+#include "processor/execution_context.h"
+#include "storage/storage_manager.h"
+#include "storage/table/table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+using namespace lbug::catalog;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace processor {
+
+void Alter::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    if (defaultValueEvaluator) {
+        defaultValueEvaluator->init(*resultSet, context->clientContext);
+    }
+}
+
+void Alter::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = Transaction::Get(*clientContext);
+    if (catalog->containsTable(transaction, info.tableName)) {
+        auto entry = catalog->getTableCatalogEntry(transaction, info.tableName);
+        alterTable(clientContext, *entry, info);
+    } else {
+        throw BinderException("Table " + info.tableName + " does not exist.");
+    }
+}
+
+using on_conflict_throw_action = std::function<void()>;
+
+static void validate(ConflictAction action, const on_conflict_throw_action& throwAction) {
+    switch (action) {
+    case ConflictAction::ON_CONFLICT_THROW: {
+        throwAction();
+    } break;
+    case ConflictAction::ON_CONFLICT_DO_NOTHING:
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static std::string propertyNotInTableMessage(const std::string& tableName,
+    const std::string& propertyName) {
+    return stringFormat("{} table does not have property {}.", tableName, propertyName);
+}
+
+static void validatePropertyExist(ConflictAction action, const TableCatalogEntry& tableEntry,
+    const std::string& propertyName) {
+    validate(action, [&tableEntry, &propertyName]() {
+        if (!tableEntry.containsProperty(propertyName)) {
+            throw RuntimeException(propertyNotInTableMessage(tableEntry.getName(), propertyName));
+        }
+    });
+}
+
+static std::string propertyInTableMessage(const std::string& tableName,
+    const std::string& propertyName) {
+    return stringFormat("{} table already has property {}.", tableName, propertyName);
+}
+
+static void validatePropertyNotExist(ConflictAction action, const TableCatalogEntry& tableEntry,
+    const std::string& propertyName) {
+    validate(action, [&tableEntry, &propertyName] {
+        if (tableEntry.containsProperty(propertyName)) {
+            throw RuntimeException(propertyInTableMessage(tableEntry.getName(), propertyName));
+        }
+    });
+}
+
+using skip_alter_on_conflict = std::function<bool()>;
+
+static bool skipAlter(ConflictAction action, const skip_alter_on_conflict& skipAlterOnConflict) {
+    switch (action) {
+    case ConflictAction::ON_CONFLICT_THROW:
+        return false;
+    case ConflictAction::ON_CONFLICT_DO_NOTHING:
+        return skipAlterOnConflict();
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+static bool checkAddPropertyConflicts(const TableCatalogEntry& tableEntry,
+    const BoundAlterInfo& info) {
+    const auto& extraInfo = info.extraInfo->constCast<BoundExtraAddPropertyInfo>();
+    auto propertyName = extraInfo.propertyDefinition.getName();
+    validatePropertyNotExist(info.onConflict, tableEntry, propertyName);
+
+    // Eventually, we want to support non-constant default on rel tables, but it is non-trivial
+    // due to FWD/BWD storage
+    if (tableEntry.getType() == CatalogEntryType::REL_GROUP_ENTRY &&
+        extraInfo.boundDefault->expressionType != ExpressionType::LITERAL) {
+        throw RuntimeException(
+            "Cannot set a non-constant default value when adding columns on REL tables.");
+    }
+
+    return skipAlter(info.onConflict,
+        [&tableEntry, &propertyName]() { return tableEntry.containsProperty(propertyName); });
+}
+
+static bool checkDropPropertyConflicts(const TableCatalogEntry& tableEntry,
+    const BoundAlterInfo& info, main::ClientContext& context) {
+    const auto& extraInfo = info.extraInfo->constCast<BoundExtraDropPropertyInfo>();
+    auto propertyName = extraInfo.propertyName;
+    validatePropertyExist(info.onConflict, tableEntry, propertyName);
+    if (tableEntry.containsProperty(propertyName)) {
+        // Check constrains if we are going to drop a property that exists.
+        auto propertyID = tableEntry.getPropertyID(propertyName);
+        // Check primary key constraint
+        if (tableEntry.getTableType() == TableType::NODE &&
+            tableEntry.constCast<NodeTableCatalogEntry>().getPrimaryKeyID() == propertyID) {
+            throw BinderException(stringFormat(
+                "Cannot drop property {} in table {} because it is used as primary key.",
+                propertyName, tableEntry.getName()));
+        }
+        // Check secondary index constraints
+        auto catalog = Catalog::Get(context);
+        auto transaction = transaction::Transaction::Get(context);
+        if (catalog->containsIndex(transaction, tableEntry.getTableID(), propertyID)) {
+            throw BinderException(stringFormat(
+                "Cannot drop property {} in table {} because it is used in one or more indexes. "
+                "Please remove the associated indexes before attempting to drop this property.",
+                propertyName, tableEntry.getName()));
+        }
+    }
+    return skipAlter(info.onConflict,
+        [&tableEntry, &propertyName]() { return !tableEntry.containsProperty(propertyName); });
+}
+
+static bool checkRenamePropertyConflicts(const TableCatalogEntry& tableEntry,
+    const BoundAlterInfo& info) {
+    const auto* extraInfo = info.extraInfo->constPtrCast<BoundExtraRenamePropertyInfo>();
+    validatePropertyExist(ConflictAction::ON_CONFLICT_THROW, tableEntry, extraInfo->oldName);
+    validatePropertyNotExist(ConflictAction::ON_CONFLICT_THROW, tableEntry, extraInfo->newName);
+    return false;
+}
+
+static bool checkRenameTableConflicts(const BoundAlterInfo& info, main::ClientContext& context) {
+    auto newName = info.extraInfo->constCast<BoundExtraRenameTableInfo>().newName;
+    auto catalog = Catalog::Get(context);
+    auto transaction = transaction::Transaction::Get(context);
+    if (catalog->containsTable(transaction, newName)) {
+        throw BinderException("Table " + newName + " already exists.");
+    }
+    return false;
+}
+
+static std::string fromToInTableMessage(const std::string& relGroupName,
+    const std::string& fromTableName, const std::string& toTableName) {
+    return stringFormat("{}->{} already exists in {} table.", fromTableName, toTableName,
+        relGroupName);
+}
+
+static bool checkAddFromToConflicts(const TableCatalogEntry& tableEntry, const BoundAlterInfo& info,
+    main::ClientContext& context) {
+    auto& extraInfo = info.extraInfo->constCast<BoundExtraAlterFromToConnection>();
+    auto& relGroupEntry = tableEntry.constCast<RelGroupCatalogEntry>();
+    validate(info.onConflict, [&relGroupEntry, &extraInfo, &context]() {
+        if (relGroupEntry.hasRelEntryInfo(extraInfo.fromTableID, extraInfo.toTableID)) {
+            auto catalog = Catalog::Get(context);
+            auto transaction = transaction::Transaction::Get(context);
+            auto fromTableName =
+                catalog->getTableCatalogEntry(transaction, extraInfo.fromTableID)->getName();
+            auto toTableName =
+                catalog->getTableCatalogEntry(transaction, extraInfo.toTableID)->getName();
+            throw BinderException{
+                fromToInTableMessage(relGroupEntry.getName(), fromTableName, toTableName)};
+        }
+    });
+    return skipAlter(info.onConflict, [&relGroupEntry, &extraInfo]() {
+        return relGroupEntry.hasRelEntryInfo(extraInfo.fromTableID, extraInfo.toTableID);
+    });
+}
+
+static std::string fromToNotInTableMessage(const std::string& relGroupName,
+    const std::string& fromTableName, const std::string& toTableName) {
+    return stringFormat("{}->{} does not exist in {} table.", fromTableName, toTableName,
+        relGroupName);
+}
+
+static bool checkDropFromToConflicts(const TableCatalogEntry& tableEntry,
+    const BoundAlterInfo& info, main::ClientContext& context) {
+    auto& extraInfo = info.extraInfo->constCast<BoundExtraAlterFromToConnection>();
+    auto& relGroupEntry = tableEntry.constCast<RelGroupCatalogEntry>();
+    validate(info.onConflict, [&relGroupEntry, &extraInfo, &context]() {
+        if (!relGroupEntry.hasRelEntryInfo(extraInfo.fromTableID, extraInfo.toTableID)) {
+            auto catalog = Catalog::Get(context);
+            auto transaction = transaction::Transaction::Get(context);
+            auto fromTableName =
+                catalog->getTableCatalogEntry(transaction, extraInfo.fromTableID)->getName();
+            auto toTableName =
+                catalog->getTableCatalogEntry(transaction, extraInfo.toTableID)->getName();
+            throw BinderException{
+                fromToNotInTableMessage(relGroupEntry.getName(), fromTableName, toTableName)};
+        }
+    });
+    return skipAlter(info.onConflict, [&relGroupEntry, &extraInfo]() {
+        return !relGroupEntry.hasRelEntryInfo(extraInfo.fromTableID, extraInfo.toTableID);
+    });
+}
+
+void Alter::alterTable(main::ClientContext* clientContext, const TableCatalogEntry& entry,
+    const BoundAlterInfo& alterInfo) {
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = Transaction::Get(*clientContext);
+    auto memoryManager = storage::MemoryManager::Get(*clientContext);
+    auto tableName = entry.getName();
+    switch (info.alterType) {
+    case AlterType::ADD_PROPERTY: {
+        auto& extraInfo = info.extraInfo->constCast<BoundExtraAddPropertyInfo>();
+        auto propertyName = extraInfo.propertyDefinition.getName();
+        if (checkAddPropertyConflicts(entry, info)) {
+            appendMessage(propertyInTableMessage(tableName, propertyName), memoryManager);
+            return;
+        }
+        appendMessage(stringFormat("Property {} added to table {}.", propertyName, tableName),
+            memoryManager);
+    } break;
+    case AlterType::DROP_PROPERTY: {
+        auto& extraInfo = info.extraInfo->constCast<BoundExtraDropPropertyInfo>();
+        auto propertyName = extraInfo.propertyName;
+        if (checkDropPropertyConflicts(entry, info, *clientContext)) {
+            appendMessage(propertyNotInTableMessage(tableName, propertyName), memoryManager);
+            return;
+        }
+        appendMessage(
+            stringFormat("Property {} has been dropped from table {}.", propertyName, tableName),
+            memoryManager);
+    } break;
+    case AlterType::RENAME_PROPERTY: {
+        // Rename property does not have IF EXISTS
+        checkRenamePropertyConflicts(entry, info);
+        auto& extraInfo = info.extraInfo->constCast<BoundExtraRenamePropertyInfo>();
+        appendMessage(
+            stringFormat("Property {} renamed to {}.", extraInfo.oldName, extraInfo.newName),
+            memoryManager);
+    } break;
+    case AlterType::RENAME: {
+        // Rename table does not have IF EXISTS
+        checkRenameTableConflicts(info, *clientContext);
+        auto& extraInfo = info.extraInfo->constCast<BoundExtraRenameTableInfo>();
+        appendMessage(stringFormat("Table {} renamed to {}.", tableName, extraInfo.newName),
+            memoryManager);
+    } break;
+    case AlterType::ADD_FROM_TO_CONNECTION: {
+        auto& extraInfo = info.extraInfo->constCast<BoundExtraAlterFromToConnection>();
+        auto fromTableName =
+            catalog->getTableCatalogEntry(transaction, extraInfo.fromTableID)->getName();
+        auto toTableName =
+            catalog->getTableCatalogEntry(transaction, extraInfo.toTableID)->getName();
+        if (checkAddFromToConflicts(entry, info, *clientContext)) {
+            appendMessage(fromToInTableMessage(tableName, fromTableName, toTableName),
+                memoryManager);
+            return;
+        }
+        appendMessage(
+            stringFormat("{}->{} added to table {}.", fromTableName, toTableName, tableName),
+            memoryManager);
+    } break;
+    case AlterType::DROP_FROM_TO_CONNECTION: {
+        auto& extraInfo = info.extraInfo->constCast<BoundExtraAlterFromToConnection>();
+        auto fromTableName =
+            catalog->getTableCatalogEntry(transaction, extraInfo.fromTableID)->getName();
+        auto toTableName =
+            catalog->getTableCatalogEntry(transaction, extraInfo.toTableID)->getName();
+        if (checkDropFromToConflicts(entry, info, *clientContext)) {
+            appendMessage(fromToNotInTableMessage(tableName, fromTableName, toTableName),
+                memoryManager);
+            return;
+        }
+        appendMessage(stringFormat("{}->{} has been dropped from table {}.", fromTableName,
+                          toTableName, tableName),
+            memoryManager);
+    } break;
+    case AlterType::COMMENT: {
+        appendMessage(stringFormat("Comment added to table {}.", tableName), memoryManager);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+
+    // Handle storage changes
+    const auto storageManager = storage::StorageManager::Get(*clientContext);
+    catalog->alterTableEntry(transaction, alterInfo);
+    // We don't use an optimistic allocator in this case since rollback of new columns is already
+    // handled by checkpoint
+    auto& pageAllocator = *storageManager->getDataFH()->getPageManager();
+    switch (info.alterType) {
+    case AlterType::ADD_PROPERTY: {
+        auto& boundAddPropInfo = info.extraInfo->constCast<BoundExtraAddPropertyInfo>();
+        KU_ASSERT(defaultValueEvaluator);
+        auto* alteredEntry = catalog->getTableCatalogEntry(transaction, alterInfo.tableName);
+        auto& addedProp = alteredEntry->getProperty(boundAddPropInfo.propertyDefinition.getName());
+        storage::TableAddColumnState state{addedProp, *defaultValueEvaluator};
+        switch (alteredEntry->getTableType()) {
+        case TableType::NODE: {
+            storageManager->getTable(alteredEntry->getTableID())
+                ->addColumn(transaction, state, pageAllocator);
+        } break;
+        case TableType::REL: {
+            for (auto& innerRelEntry :
+                alteredEntry->cast<RelGroupCatalogEntry>().getRelEntryInfos()) {
+                auto* relTable = storageManager->getTable(innerRelEntry.oid);
+                relTable->addColumn(transaction, state, pageAllocator);
+            }
+        } break;
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+    } break;
+    case AlterType::DROP_PROPERTY: {
+        auto* alteredEntry = catalog->getTableCatalogEntry(transaction, alterInfo.tableName);
+        switch (alteredEntry->getTableType()) {
+        case TableType::NODE: {
+            storageManager->getTable(alteredEntry->getTableID())->dropColumn();
+        } break;
+        case TableType::REL: {
+            for (auto& innerRelEntry :
+                alteredEntry->cast<RelGroupCatalogEntry>().getRelEntryInfos()) {
+                auto* relTable = storageManager->getTable(innerRelEntry.oid);
+                relTable->dropColumn();
+            }
+        } break;
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+    } break;
+    case AlterType::ADD_FROM_TO_CONNECTION: {
+        auto relGroupEntry = catalog->getTableCatalogEntry(transaction, alterInfo.tableName)
+                                 ->ptrCast<RelGroupCatalogEntry>();
+        auto connectionInfo = alterInfo.extraInfo->constPtrCast<BoundExtraAlterFromToConnection>();
+        auto relEntryInfo =
+            relGroupEntry->getRelEntryInfo(connectionInfo->fromTableID, connectionInfo->toTableID);
+        storageManager->addRelTable(relGroupEntry, *relEntryInfo);
+    } break;
+    default:
+        break;
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/create_sequence.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/create_sequence.cpp
new file mode 100644
index 0000000000..6c0236426c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/create_sequence.cpp
@@ -0,0 +1,40 @@
+#include "processor/operator/ddl/create_sequence.h"
+
+#include "catalog/catalog.h"
+#include "common/string_format.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string CreateSequencePrintInfo::toString() const {
+    return seqName;
+}
+
+void CreateSequence::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto memoryManager = storage::MemoryManager::Get(*clientContext);
+    if (catalog->containsSequence(transaction, info.sequenceName)) {
+        switch (info.onConflict) {
+        case ConflictAction::ON_CONFLICT_DO_NOTHING: {
+            appendMessage(stringFormat("Sequence {} already exists.", info.sequenceName),
+                memoryManager);
+            return;
+        }
+        default:
+            break;
+        }
+    }
+    catalog->createSequence(transaction, info);
+    appendMessage(stringFormat("Sequence {} has been created.", info.sequenceName), memoryManager);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/create_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/create_table.cpp
new file mode 100644
index 0000000000..c92af894c0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/create_table.cpp
@@ -0,0 +1,50 @@
+#include "processor/operator/ddl/create_table.h"
+
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "processor/execution_context.h"
+#include "storage/storage_manager.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void CreateTable::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto memoryManager = storage::MemoryManager::Get(*clientContext);
+    // Check conflict
+    if (catalog->containsTable(transaction, info.tableName)) {
+        switch (info.onConflict) {
+        case ConflictAction::ON_CONFLICT_DO_NOTHING: {
+            appendMessage(stringFormat("Table {} already exists.", info.tableName), memoryManager);
+            return;
+        }
+        case ConflictAction::ON_CONFLICT_THROW: {
+            throw BinderException(info.tableName + " already exists in catalog.");
+        }
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    // Create the table.
+    CatalogEntry* entry = nullptr;
+    switch (info.type) {
+    case CatalogEntryType::NODE_TABLE_ENTRY:
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        entry = catalog->createTableEntry(transaction, info);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    storage::StorageManager::Get(*clientContext)->createTable(entry->ptrCast<TableCatalogEntry>());
+    appendMessage(stringFormat("Table {} has been created.", info.tableName), memoryManager);
+    sharedState->tableCreated = true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/create_type.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/create_type.cpp
new file mode 100644
index 0000000000..9b7358eaf7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/create_type.cpp
@@ -0,0 +1,27 @@
+#include "processor/operator/ddl/create_type.h"
+
+#include "catalog/catalog.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string CreateTypePrintInfo::toString() const {
+    return typeName + " AS " + type;
+}
+
+void CreateType::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    Catalog::Get(*clientContext)->createType(transaction, name, type.copy());
+    appendMessage(stringFormat("Type {}({}) has been created.", name, type.toString()),
+        storage::MemoryManager::Get(*clientContext));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/drop.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/drop.cpp
new file mode 100644
index 0000000000..bde00103d8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/ddl/drop.cpp
@@ -0,0 +1,134 @@
+#include "processor/operator/ddl/drop.h"
+
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/index_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void Drop::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    switch (dropInfo.dropType) {
+    case DropType::SEQUENCE: {
+        dropSequence(clientContext);
+    } break;
+    case DropType::TABLE: {
+        dropTable(clientContext);
+    } break;
+    case DropType::MACRO: {
+        dropMacro(clientContext);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void Drop::dropSequence(const main::ClientContext* context) {
+    auto catalog = Catalog::Get(*context);
+    auto transaction = transaction::Transaction::Get(*context);
+    auto memoryManager = storage::MemoryManager::Get(*context);
+    if (!catalog->containsSequence(transaction, dropInfo.name)) {
+        auto message = stringFormat("Sequence {} does not exist.", dropInfo.name);
+        switch (dropInfo.conflictAction) {
+        case ConflictAction::ON_CONFLICT_DO_NOTHING: {
+            appendMessage(message, memoryManager);
+            return;
+        }
+        case ConflictAction::ON_CONFLICT_THROW: {
+            throw BinderException(message);
+        }
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    catalog->dropSequence(transaction, dropInfo.name);
+    appendMessage(stringFormat("Sequence {} has been dropped.", dropInfo.name), memoryManager);
+}
+
+void Drop::dropTable(const main::ClientContext* context) {
+    auto catalog = Catalog::Get(*context);
+    auto transaction = transaction::Transaction::Get(*context);
+    auto memoryManager = storage::MemoryManager::Get(*context);
+    if (!catalog->containsTable(transaction, dropInfo.name, context->useInternalCatalogEntry())) {
+        auto message = stringFormat("Table {} does not exist.", dropInfo.name);
+        switch (dropInfo.conflictAction) {
+        case ConflictAction::ON_CONFLICT_DO_NOTHING: {
+            appendMessage(message, memoryManager);
+            return;
+        }
+        case ConflictAction::ON_CONFLICT_THROW: {
+            throw BinderException(message);
+        }
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    auto entry = catalog->getTableCatalogEntry(transaction, dropInfo.name);
+    switch (entry->getType()) {
+    case CatalogEntryType::NODE_TABLE_ENTRY: {
+        for (auto& indexEntry : catalog->getIndexEntries(transaction)) {
+            if (indexEntry->getTableID() == entry->getTableID()) {
+                throw BinderException(stringFormat(
+                    "Cannot delete node table {} because it is referenced by index {}.",
+                    entry->getName(), indexEntry->getIndexName()));
+            }
+        }
+        for (auto& relEntry : catalog->getRelGroupEntries(transaction)) {
+            if (relEntry->isParent(entry->getTableID())) {
+                throw BinderException(stringFormat("Cannot delete node table {} because it is "
+                                                   "referenced by relationship table {}.",
+                    entry->getName(), relEntry->getName()));
+            }
+        }
+    } break;
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        // Do nothing
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    catalog->dropTableEntryAndIndex(transaction, dropInfo.name);
+    appendMessage(stringFormat("Table {} has been dropped.", dropInfo.name), memoryManager);
+}
+
+void Drop::dropMacro(const main::ClientContext* context) {
+    auto catalog = Catalog::Get(*context);
+    auto transaction = transaction::Transaction::Get(*context);
+    auto memoryManager = storage::MemoryManager::Get(*context);
+    handleMacroExistence(context);
+    catalog->dropMacro(transaction, dropInfo.name);
+    appendMessage(stringFormat("Macro {} has been dropped.", dropInfo.name), memoryManager);
+}
+
+void Drop::handleMacroExistence(const main::ClientContext* context) {
+    auto catalog = Catalog::Get(*context);
+    auto transaction = transaction::Transaction::Get(*context);
+    auto memoryManager = storage::MemoryManager::Get(*context);
+    if (!catalog->containsMacro(transaction, dropInfo.name)) {
+        auto message = stringFormat("Macro {} does not exist.", dropInfo.name);
+        switch (dropInfo.conflictAction) {
+        case ConflictAction::ON_CONFLICT_DO_NOTHING: {
+            appendMessage(message, memoryManager);
+            return;
+        }
+        case ConflictAction::ON_CONFLICT_THROW: {
+            throw BinderException(message);
+        }
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/empty_result.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/empty_result.cpp
new file mode 100644
index 0000000000..fb7393a64f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/empty_result.cpp
@@ -0,0 +1,11 @@
+#include "processor/operator/empty_result.h"
+
+namespace lbug {
+namespace processor {
+
+bool EmptyResult::getNextTuplesInternal(ExecutionContext*) {
+    return false;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/filter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/filter.cpp
new file mode 100644
index 0000000000..9eb882d6f4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/filter.cpp
@@ -0,0 +1,70 @@
+#include "processor/operator/filter.h"
+
+#include "binder/expression/expression.h" // IWYU pragma: keep
+#include "processor/execution_context.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string FilterPrintInfo::toString() const {
+    return expression->toString();
+}
+
+void Filter::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    expressionEvaluator->init(*resultSet, context->clientContext);
+    if (dataChunkToSelectPos == INVALID_DATA_CHUNK_POS) {
+        // Filter a constant expression. Ideally we should fold all such expression at compile time.
+        // But there are many edge cases, so we keep this code path for robustness.
+        state = DataChunkState::getSingleValueDataChunkState();
+    } else {
+        state = resultSet->dataChunks[dataChunkToSelectPos]->state;
+    }
+}
+
+bool Filter::getNextTuplesInternal(ExecutionContext* context) {
+    bool hasAtLeastOneSelectedValue = false;
+    do {
+        restoreSelVector(*state);
+        if (!children[0]->getNextTuple(context)) {
+            return false;
+        }
+        saveSelVector(*state);
+        hasAtLeastOneSelectedValue =
+            expressionEvaluator->select(state->getSelVectorUnsafe(), !state->isFlat());
+    } while (!hasAtLeastOneSelectedValue);
+    metrics->numOutputTuple.increase(state->getSelVector().getSelSize());
+    return true;
+}
+
+void NodeLabelFiler::initLocalStateInternal(ResultSet* /*resultSet_*/,
+    ExecutionContext* /*context*/) {
+    nodeIDVector = resultSet->getValueVector(info->nodeVectorPos).get();
+}
+
+bool NodeLabelFiler::getNextTuplesInternal(ExecutionContext* context) {
+    sel_t numSelectValue = 0;
+    do {
+        restoreSelVector(*nodeIDVector->state);
+        if (!children[0]->getNextTuple(context)) {
+            return false;
+        }
+        saveSelVector(*nodeIDVector->state);
+        numSelectValue = 0;
+        auto buffer = nodeIDVector->state->getSelVectorUnsafe().getMutableBuffer();
+        for (auto i = 0u; i < nodeIDVector->state->getSelVector().getSelSize(); ++i) {
+            auto pos = nodeIDVector->state->getSelVector()[i];
+            buffer[numSelectValue] = pos;
+            numSelectValue +=
+                info->nodeLabelSet.contains(nodeIDVector->getValue<nodeID_t>(pos).tableID);
+        }
+        nodeIDVector->state->getSelVectorUnsafe().setToFiltered();
+    } while (numSelectValue == 0);
+    nodeIDVector->state->getSelVectorUnsafe().setSelSize(numSelectValue);
+    metrics->numOutputTuple.increase(nodeIDVector->state->getSelVector().getSelSize());
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/filtering_operator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/filtering_operator.cpp
new file mode 100644
index 0000000000..cd60ea5896
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/filtering_operator.cpp
@@ -0,0 +1,43 @@
+#include "processor/operator/filtering_operator.h"
+
+#include <cstring>
+
+#include "common/data_chunk/data_chunk_state.h"
+#include "common/system_config.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+SelVectorOverWriter::SelVectorOverWriter() {
+    currentSelVector = std::make_shared<common::SelectionVector>(common::DEFAULT_VECTOR_CAPACITY);
+}
+
+void SelVectorOverWriter::restoreSelVector(DataChunkState& dataChunkState) const {
+    if (prevSelVector != nullptr) {
+        dataChunkState.setSelVector(prevSelVector);
+    }
+}
+
+void SelVectorOverWriter::saveSelVector(DataChunkState& dataChunkState) {
+    if (prevSelVector == nullptr) {
+        prevSelVector = dataChunkState.getSelVectorShared();
+    }
+    resetCurrentSelVector(dataChunkState.getSelVector());
+    dataChunkState.setSelVector(currentSelVector);
+}
+
+void SelVectorOverWriter::resetCurrentSelVector(const SelectionVector& selVector) {
+    currentSelVector->setSelSize(selVector.getSelSize());
+    if (selVector.isUnfiltered()) {
+        currentSelVector->setToUnfiltered();
+    } else {
+        std::memcpy(currentSelVector->getMutableBuffer().data(),
+            selVector.getSelectedPositions().data(), selVector.getSelSize() * sizeof(sel_t));
+        currentSelVector->setToFiltered();
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/flatten.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/flatten.cpp
new file mode 100644
index 0000000000..a820768109
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/flatten.cpp
@@ -0,0 +1,37 @@
+#include "processor/operator/flatten.h"
+
+#include "common/metric.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void Flatten::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* /*context*/) {
+    dataChunkState = resultSet->dataChunks[dataChunkToFlattenPos]->state.get();
+    currentSelVector->setToFiltered(1 /* size */);
+    localState = std::make_unique<FlattenLocalState>();
+}
+
+bool Flatten::getNextTuplesInternal(ExecutionContext* context) {
+    if (localState->currentIdx == localState->sizeToFlatten) {
+        dataChunkState->setToUnflat(); // TODO(Xiyang): this should be part of restore/save
+        restoreSelVector(*dataChunkState);
+        if (!children[0]->getNextTuple(context)) {
+            return false;
+        }
+        localState->currentIdx = 0;
+        localState->sizeToFlatten = dataChunkState->getSelVector().getSelSize();
+        saveSelVector(*dataChunkState);
+        dataChunkState->setToFlat();
+    }
+    sel_t selPos = prevSelVector->operator[](localState->currentIdx++);
+    currentSelVector->operator[](0) = selPos;
+    metrics->numOutputTuple.incrementByOne();
+    return true;
+}
+
+void Flatten::resetCurrentSelVector(const SelectionVector&) {}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/CMakeLists.txt
new file mode 100644
index 0000000000..67d5ed7f11
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_processor_operator_hash_join
+        OBJECT
+        hash_join_build.cpp
+        hash_join_probe.cpp
+        join_hash_table.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_hash_join>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/hash_join_build.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/hash_join_build.cpp
new file mode 100644
index 0000000000..d0e05aeff8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/hash_join_build.cpp
@@ -0,0 +1,76 @@
+#include "processor/operator/hash_join/hash_join_build.h"
+
+#include "binder/expression/expression_util.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::string HashJoinBuildPrintInfo::toString() const {
+    std::string result = "Keys: ";
+    result += binder::ExpressionUtil::toString(keys);
+    if (!payloads.empty()) {
+        result += ", Payloads: ";
+        result += binder::ExpressionUtil::toString(payloads);
+    }
+    return result;
+}
+
+void HashJoinSharedState::mergeLocalHashTable(JoinHashTable& localHashTable) {
+    std::unique_lock lck(mtx);
+    hashTable->merge(localHashTable);
+}
+
+void HashJoinBuild::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    std::vector<LogicalType> keyTypes;
+    for (auto i = 0u; i < info.keysPos.size(); ++i) {
+        auto vector = resultSet->getValueVector(info.keysPos[i]).get();
+        keyTypes.push_back(vector->dataType.copy());
+        if (info.fStateTypes[i] == common::FStateType::UNFLAT) {
+            setKeyState(vector->state.get());
+        }
+        keyVectors.push_back(vector);
+    }
+    if (keyState == nullptr) {
+        setKeyState(keyVectors[0]->state.get());
+    }
+    for (auto& pos : info.payloadsPos) {
+        payloadVectors.push_back(resultSet->getValueVector(pos).get());
+    }
+    hashTable = std::make_unique<JoinHashTable>(*MemoryManager::Get(*context->clientContext),
+        std::move(keyTypes), info.tableSchema.copy());
+}
+
+void HashJoinBuild::setKeyState(common::DataChunkState* state) {
+    if (keyState == nullptr) {
+        keyState = state;
+    } else {
+        KU_ASSERT(keyState == state); // two pointers should be pointing to the same state
+    }
+}
+
+void HashJoinBuild::finalizeInternal(ExecutionContext* /*context*/) {
+    auto numTuples = sharedState->getHashTable()->getNumEntries();
+    sharedState->getHashTable()->allocateHashSlots(numTuples);
+    sharedState->getHashTable()->buildHashSlots();
+}
+
+void HashJoinBuild::executeInternal(ExecutionContext* context) {
+    // Append thread-local tuples
+    while (children[0]->getNextTuple(context)) {
+        uint64_t numAppended = 0u;
+        for (auto i = 0u; i < resultSet->multiplicity; ++i) {
+            numAppended += appendVectors();
+        }
+        metrics->numOutputTuple.increase(numAppended);
+    }
+    // Merge with global hash table once local tuples are all appended.
+    sharedState->mergeLocalHashTable(*hashTable);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/hash_join_probe.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/hash_join_probe.cpp
new file mode 100644
index 0000000000..f59ade8bc0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/hash_join_probe.cpp
@@ -0,0 +1,211 @@
+#include "processor/operator/hash_join/hash_join_probe.h"
+
+#include "binder/expression/expression_util.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string HashJoinProbePrintInfo::toString() const {
+    std::string result = "Keys: ";
+    result += binder::ExpressionUtil::toString(keys);
+    return result;
+}
+
+void HashJoinProbe::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    probeState = std::make_unique<ProbeState>();
+    for (auto& keyDataPos : probeDataInfo.keysDataPos) {
+        keyVectors.push_back(resultSet->getValueVector(keyDataPos).get());
+    }
+    if (probeDataInfo.markDataPos.isValid()) {
+        markVector = resultSet->getValueVector(probeDataInfo.markDataPos).get();
+    } else {
+        markVector = nullptr;
+    }
+    for (auto& dataPos : probeDataInfo.payloadsOutPos) {
+        vectorsToReadInto.push_back(resultSet->getValueVector(dataPos).get());
+    }
+    // We only need to read nonKeys from the factorizedTable. Key columns are always kept as first k
+    // columns in the factorizedTable, so we skip the first k columns.
+    KU_ASSERT(probeDataInfo.keysDataPos.size() + probeDataInfo.getNumPayloads() + 2 ==
+              sharedState->getHashTable()->getTableSchema()->getNumColumns());
+    columnIdxsToReadFrom.resize(probeDataInfo.getNumPayloads());
+    iota(columnIdxsToReadFrom.begin(), columnIdxsToReadFrom.end(),
+        probeDataInfo.keysDataPos.size());
+    auto mm = storage::MemoryManager::Get(*context->clientContext);
+    hashVector = std::make_unique<ValueVector>(LogicalType::HASH(), mm);
+    if (keyVectors.size() > 1) {
+        tmpHashVector = std::make_unique<ValueVector>(LogicalType::HASH(), mm);
+    }
+}
+
+bool HashJoinProbe::getMatchedTuplesForFlatKey(ExecutionContext* context) {
+    if (probeState->nextMatchedTupleIdx < probeState->matchedSelVector.getSelSize()) {
+        // Not all matched tuples have been shipped. Continue shipping.
+        return true;
+    }
+    if (probeState->probedTuples[0] == nullptr) { // No more matched tuples on the chain.
+        // We still need to save and restore for flat input because we are discarding NULL join keys
+        // which changes the selected position.
+        // TODO(Guodong): we have potential bugs here because all keys' states should be restored.
+        restoreSelVector(*keyVectors[0]->state);
+        if (!children[0]->getNextTuple(context)) {
+            return false;
+        }
+        saveSelVector(*keyVectors[0]->state);
+        sharedState->getHashTable()->probe(keyVectors, *hashVector, hashSelVec, tmpHashVector.get(),
+            probeState->probedTuples.get());
+    }
+    auto numMatchedTuples = sharedState->getHashTable()->matchFlatKeys(keyVectors,
+        probeState->probedTuples.get(), probeState->matchedTuples.get());
+    probeState->matchedSelVector.setSelSize(numMatchedTuples);
+    probeState->nextMatchedTupleIdx = 0;
+    return true;
+}
+
+bool HashJoinProbe::getMatchedTuplesForUnFlatKey(ExecutionContext* context) {
+    KU_ASSERT(keyVectors.size() == 1);
+    auto keyVector = keyVectors[0];
+    restoreSelVector(*keyVector->state);
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    saveSelVector(*keyVector->state);
+    sharedState->getHashTable()->probe(keyVectors, *hashVector, hashSelVec, tmpHashVector.get(),
+        probeState->probedTuples.get());
+    auto numMatchedTuples =
+        sharedState->getHashTable()->matchUnFlatKey(keyVector, probeState->probedTuples.get(),
+            probeState->matchedTuples.get(), probeState->matchedSelVector);
+    probeState->matchedSelVector.setSelSize(numMatchedTuples);
+    probeState->nextMatchedTupleIdx = 0;
+    return true;
+}
+
+uint64_t HashJoinProbe::getInnerJoinResultForFlatKey() {
+    if (probeState->matchedSelVector.getSelSize() == 0) {
+        return 0;
+    }
+    auto numTuplesToRead = 1;
+    sharedState->getHashTable()->lookup(vectorsToReadInto, columnIdxsToReadFrom,
+        probeState->matchedTuples.get(), probeState->nextMatchedTupleIdx, numTuplesToRead);
+    probeState->nextMatchedTupleIdx += numTuplesToRead;
+    return numTuplesToRead;
+}
+
+uint64_t HashJoinProbe::getInnerJoinResultForUnFlatKey() {
+    auto numTuplesToRead = probeState->matchedSelVector.getSelSize();
+    if (numTuplesToRead == 0) {
+        return 0;
+    }
+    auto& keySelVector = keyVectors[0]->state->getSelVectorUnsafe();
+    if (keySelVector.getSelSize() != numTuplesToRead) {
+        // Some keys have no matched tuple. So we modify selected position.
+        auto buffer = keySelVector.getMutableBuffer();
+        for (auto i = 0u; i < numTuplesToRead; i++) {
+            buffer[i] = probeState->matchedSelVector[i];
+        }
+        keySelVector.setToFiltered(numTuplesToRead);
+    }
+    sharedState->getHashTable()->lookup(vectorsToReadInto, columnIdxsToReadFrom,
+        probeState->matchedTuples.get(), probeState->nextMatchedTupleIdx, numTuplesToRead);
+    probeState->nextMatchedTupleIdx += numTuplesToRead;
+    return numTuplesToRead;
+}
+
+static void writeLeftJoinMarkVector(ValueVector* markVector, bool flag) {
+    if (markVector == nullptr) {
+        return;
+    }
+    KU_ASSERT(markVector->state->getSelVector().getSelSize() == 1);
+    auto pos = markVector->state->getSelVector()[0];
+    markVector->setValue<bool>(pos, flag);
+}
+
+uint64_t HashJoinProbe::getLeftJoinResult() {
+    if (getInnerJoinResult() == 0) {
+        for (auto& vector : vectorsToReadInto) {
+            vector->setAsSingleNullEntry();
+        }
+        // TODO(Xiyang): We have a bug in LEFT JOIN which should not discard NULL keys. To be more
+        // clear, NULL keys should only be discarded for probe but should not reflect on the vector.
+        // The following for loop is a temporary hack.
+        for (auto& vector : keyVectors) {
+            KU_ASSERT(vector->state->isFlat());
+            vector->state->getSelVectorUnsafe().setSelSize(1);
+        }
+        probeState->probedTuples[0] = nullptr;
+        writeLeftJoinMarkVector(markVector, false);
+        return 1;
+    }
+    writeLeftJoinMarkVector(markVector, true);
+    return 1;
+}
+
+uint64_t HashJoinProbe::getCountJoinResult() {
+    KU_ASSERT(vectorsToReadInto.size() == 1);
+    if (getInnerJoinResult() == 0) {
+        auto pos = vectorsToReadInto[0]->state->getSelVector()[0];
+        vectorsToReadInto[0]->setValue<int64_t>(pos, 0);
+        probeState->probedTuples[0] = nullptr;
+    }
+    return 1;
+}
+
+uint64_t HashJoinProbe::getMarkJoinResult() {
+    auto markValues = (bool*)markVector->getData();
+    if (markVector->state->isFlat()) {
+        auto pos = markVector->state->getSelVector()[0];
+        markValues[pos] = probeState->matchedSelVector.getSelSize() != 0;
+    } else {
+        std::fill(markValues, markValues + DEFAULT_VECTOR_CAPACITY, false);
+        for (auto i = 0u; i < probeState->matchedSelVector.getSelSize(); i++) {
+            auto pos = probeState->matchedSelVector[i];
+            markValues[pos] = true;
+        }
+    }
+    probeState->probedTuples[0] = nullptr;
+    probeState->nextMatchedTupleIdx = probeState->matchedSelVector.getSelSize();
+    return 1;
+}
+
+uint64_t HashJoinProbe::getJoinResult() {
+    switch (joinType) {
+    case JoinType::LEFT: {
+        return getLeftJoinResult();
+    }
+    case JoinType::COUNT: {
+        return getCountJoinResult();
+    }
+    case JoinType::MARK: {
+        return getMarkJoinResult();
+    }
+    case JoinType::INNER: {
+        return getInnerJoinResult();
+    }
+    default:
+        throw InternalException("Unimplemented join type for HashJoinProbe::getJoinResult()");
+    }
+}
+
+// The general flow of a hash join probe:
+// 1) find matched tuples of probe side key from ht.
+// 2) populate values from matched tuples into resultKeyDataChunk , buildSideFlatResultDataChunk
+// (all flat data chunks from the build side are merged into one) and buildSideVectorPtrs (each
+// VectorPtr corresponds to one unFlat build side data chunk that is appended to the resultSet).
+bool HashJoinProbe::getNextTuplesInternal(ExecutionContext* context) {
+    uint64_t numPopulatedTuples = 0;
+    do {
+        if (!getMatchedTuples(context)) {
+            return false;
+        }
+        numPopulatedTuples = getJoinResult();
+    } while (numPopulatedTuples == 0);
+    metrics->numOutputTuple.increase(numPopulatedTuples);
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/join_hash_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/join_hash_table.cpp
new file mode 100644
index 0000000000..81925998c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/hash_join/join_hash_table.cpp
@@ -0,0 +1,212 @@
+#include "processor/operator/hash_join/join_hash_table.h"
+
+#include "common/utils.h"
+#include "function/hash/vector_hash_functions.h"
+#include "processor/result/factorized_table.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+JoinHashTable::JoinHashTable(MemoryManager& memoryManager, logical_type_vec_t keyTypes,
+    FactorizedTableSchema tableSchema)
+    : BaseHashTable{memoryManager, std::move(keyTypes)} {
+    auto numSlotsPerBlock = HASH_BLOCK_SIZE / sizeof(uint8_t*);
+    initSlotConstant(numSlotsPerBlock);
+    // Prev pointer is always the last column in the table.
+    prevPtrColOffset = tableSchema.getColOffset(tableSchema.getNumColumns() - PREV_PTR_COL_IDX);
+    factorizedTable = std::make_unique<FactorizedTable>(&memoryManager, std::move(tableSchema));
+}
+
+static bool discardNullFromKeys(const std::vector<ValueVector*>& vectors) {
+    bool hasNonNullKeys = true;
+    for (auto& vector : vectors) {
+        if (!ValueVector::discardNull(*vector)) {
+            hasNonNullKeys = false;
+            break;
+        }
+    }
+    return hasNonNullKeys;
+}
+
+uint64_t JoinHashTable::appendVectors(const std::vector<ValueVector*>& keyVectors,
+    const std::vector<ValueVector*>& payloadVectors, DataChunkState* keyState) {
+    discardNullFromKeys(keyVectors);
+    auto numTuplesToAppend = keyState->getSelVector().getSelSize();
+    auto appendInfos = factorizedTable->allocateFlatTupleBlocks(numTuplesToAppend);
+    computeVectorHashes(keyVectors);
+    auto colIdx = 0u;
+    for (auto& vector : keyVectors) {
+        appendVector(vector, appendInfos, colIdx++);
+    }
+    for (auto& vector : payloadVectors) {
+        appendVector(vector, appendInfos, colIdx++);
+    }
+    appendVector(hashVector.get(), appendInfos, colIdx);
+    factorizedTable->numTuples += numTuplesToAppend;
+    return numTuplesToAppend;
+}
+
+void JoinHashTable::appendVector(ValueVector* vector,
+    const std::vector<BlockAppendingInfo>& appendInfos, ft_col_idx_t colIdx) {
+    auto numAppendedTuples = 0ul;
+    for (auto& blockAppendInfo : appendInfos) {
+        factorizedTable->copyVectorToColumn(*vector, blockAppendInfo, numAppendedTuples, colIdx);
+        numAppendedTuples += blockAppendInfo.numTuplesToAppend;
+    }
+}
+
+static void sortSelectedPos(ValueVector* nodeIDVector) {
+    auto& selVector = nodeIDVector->state->getSelVectorUnsafe();
+    auto size = selVector.getSelSize();
+    auto buffer = selVector.getMutableBuffer();
+    if (selVector.isUnfiltered()) {
+        std::memcpy(buffer.data(), selVector.getSelectedPositions().data(), size * sizeof(sel_t));
+        selVector.setToFiltered();
+    }
+    std::sort(buffer.begin(), buffer.begin() + size, [nodeIDVector](sel_t left, sel_t right) {
+        return nodeIDVector->getValue<nodeID_t>(left) < nodeIDVector->getValue<nodeID_t>(right);
+    });
+}
+
+uint64_t JoinHashTable::appendVectorWithSorting(ValueVector* keyVector,
+    std::vector<ValueVector*> payloadVectors) {
+    auto numTuplesToAppend = 1;
+    KU_ASSERT(keyVector->state->getSelVector().getSelSize() == 1);
+    // Based on the way we are planning, we assume that the first and second vectors are both
+    // nodeIDs from extending, while the first one is key, and the second one is payload.
+    auto payloadNodeIDVector = payloadVectors[0];
+    auto payloadsState = payloadNodeIDVector->state.get();
+    if (!payloadsState->isFlat()) {
+        // Sorting is only needed when the payload is unFlat (a list of values).
+        sortSelectedPos(payloadNodeIDVector);
+    }
+    // A single appendInfo will return from `allocateFlatTupleBlocks` when numTuplesToAppend is 1.
+    auto appendInfos = factorizedTable->allocateFlatTupleBlocks(numTuplesToAppend);
+    KU_ASSERT(appendInfos.size() == 1);
+    auto colIdx = 0u;
+    std::vector<ValueVector*> keyVectors = {keyVector};
+    computeVectorHashes(keyVectors);
+    factorizedTable->copyVectorToColumn(*keyVector, appendInfos[0], numTuplesToAppend, colIdx++);
+    for (auto& vector : payloadVectors) {
+        factorizedTable->copyVectorToColumn(*vector, appendInfos[0], numTuplesToAppend, colIdx++);
+    }
+    factorizedTable->copyVectorToColumn(*hashVector, appendInfos[0], numTuplesToAppend, colIdx);
+    if (!payloadsState->isFlat()) {
+        // TODO(Xiyang): I can no longer recall why I set to un-filtered but this is probably wrong.
+        // We should set back to the un-sorted state.
+        payloadsState->getSelVectorUnsafe().setToUnfiltered();
+    }
+    factorizedTable->numTuples += numTuplesToAppend;
+    return numTuplesToAppend;
+}
+
+void JoinHashTable::allocateHashSlots(uint64_t numTuples) {
+    setMaxNumHashSlots(nextPowerOfTwo(numTuples * 2));
+    auto numSlotsPerBlock = (uint64_t)1 << numSlotsPerBlockLog2;
+    auto numBlocksNeeded = (maxNumHashSlots + numSlotsPerBlock - 1) / numSlotsPerBlock;
+    while (hashSlotsBlocks.size() < numBlocksNeeded) {
+        hashSlotsBlocks.emplace_back(std::make_unique<DataBlock>(memoryManager, HASH_BLOCK_SIZE));
+    }
+}
+
+void JoinHashTable::buildHashSlots() {
+    for (auto& tupleBlock : factorizedTable->getTupleDataBlocks()) {
+        uint8_t* tuple = tupleBlock->getData();
+        for (auto i = 0u; i < tupleBlock->numTuples; i++) {
+            auto lastSlotEntryInHT = insertEntry(tuple);
+            auto prevPtr = getPrevTuple(tuple);
+            memcpy(reinterpret_cast<void*>(prevPtr), reinterpret_cast<void*>(&lastSlotEntryInHT),
+                sizeof(uint8_t*));
+            tuple += getTableSchema()->getNumBytesPerTuple();
+        }
+    }
+}
+
+void JoinHashTable::probe(const std::vector<ValueVector*>& keyVectors, ValueVector& hashVector,
+    SelectionVector& hashSelVec, ValueVector* tmpHashResultVector, uint8_t** probedTuples) {
+    KU_ASSERT(keyVectors.size() == keyTypes.size());
+    if (getNumEntries() == 0) {
+        return;
+    }
+    if (!discardNullFromKeys(keyVectors)) {
+        return;
+    }
+    hashSelVec.setSelSize(keyVectors[0]->state->getSelVector().getSelSize());
+    VectorHashFunction::computeHash(*keyVectors[0], keyVectors[0]->state->getSelVector(),
+        hashVector, hashSelVec);
+    for (auto i = 1u; i < keyVectors.size(); i++) {
+        hashSelVec.setSelSize(keyVectors[i]->state->getSelVector().getSelSize());
+        VectorHashFunction::computeHash(*keyVectors[i], keyVectors[i]->state->getSelVector(),
+            *tmpHashResultVector, hashSelVec);
+        VectorHashFunction::combineHash(hashVector, hashSelVec, *tmpHashResultVector, hashSelVec,
+            hashVector, hashSelVec);
+    }
+    for (auto i = 0u; i < hashSelVec.getSelSize(); i++) {
+        KU_ASSERT(i < DEFAULT_VECTOR_CAPACITY);
+        probedTuples[i] = getTupleForHash(hashVector.getValue<hash_t>(hashSelVec[i]));
+    }
+}
+
+sel_t JoinHashTable::matchFlatKeys(const std::vector<ValueVector*>& keyVectors,
+    uint8_t** probedTuples, uint8_t** matchedTuples) {
+    auto numMatchedTuples = 0;
+    while (probedTuples[0]) {
+        if (numMatchedTuples == DEFAULT_VECTOR_CAPACITY) {
+            break;
+        }
+        auto currentTuple = probedTuples[0];
+        matchedTuples[numMatchedTuples] = currentTuple;
+        numMatchedTuples += matchFlatVecWithEntry(keyVectors, currentTuple);
+        probedTuples[0] = *getPrevTuple(currentTuple);
+    }
+    return numMatchedTuples;
+}
+
+sel_t JoinHashTable::matchUnFlatKey(ValueVector* keyVector, uint8_t** probedTuples,
+    uint8_t** matchedTuples, SelectionVector& matchedTuplesSelVector) {
+    auto numMatchedTuples = 0;
+    for (auto i = 0u; i < keyVector->state->getSelVector().getSelSize(); ++i) {
+        auto pos = keyVector->state->getSelVector()[i];
+        while (probedTuples[i]) {
+            auto currentTuple = probedTuples[i];
+            auto entryCompareResult = compareEntryFuncs[0](keyVector, pos, currentTuple);
+            if (entryCompareResult) {
+                matchedTuples[numMatchedTuples] = currentTuple;
+                matchedTuplesSelVector[numMatchedTuples] = pos;
+                numMatchedTuples++;
+                break;
+            }
+            probedTuples[i] = *getPrevTuple(currentTuple);
+        }
+    }
+    return numMatchedTuples;
+}
+
+uint8_t** JoinHashTable::findHashSlot(const uint8_t* tuple) const {
+    auto hash = *(hash_t*)(tuple + getHashValueColOffset());
+    auto slotIdx = getSlotIdxForHash(hash);
+    return (uint8_t**)(hashSlotsBlocks[slotIdx >> numSlotsPerBlockLog2]->getData() +
+                       (slotIdx & slotIdxInBlockMask) * sizeof(uint8_t*));
+}
+
+uint8_t* JoinHashTable::insertEntry(uint8_t* tuple) const {
+    auto slot = findHashSlot(tuple);
+    auto prevPtr = *slot;
+    *slot = tuple;
+    return prevPtr;
+}
+
+void JoinHashTable::computeVectorHashes(std::vector<common::ValueVector*> keyVectors) {
+    BaseHashTable::computeVectorHashes(keyVectors);
+}
+
+offset_t JoinHashTable::getHashValueColOffset() const {
+    return getTableSchema()->getColOffset(getTableSchema()->getNumColumns() - HASH_COL_IDX);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/index_lookup.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/index_lookup.cpp
new file mode 100644
index 0000000000..f4b77513a9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/index_lookup.cpp
@@ -0,0 +1,161 @@
+#include "processor/operator/index_lookup.h"
+
+#include "binder/expression/expression_util.h"
+#include "common/assert.h"
+#include "common/exception/message.h"
+#include "common/types/types.h"
+#include "common/utils.h"
+#include "common/vector/value_vector.h"
+#include "processor/warning_context.h"
+#include "storage/index/hash_index.h"
+#include "storage/table/node_table.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+namespace {
+
+std::optional<WarningSourceData> getWarningSourceData(
+    const std::vector<ValueVector*>& warningDataVectors, sel_t pos) {
+    std::optional<WarningSourceData> ret;
+    if (!warningDataVectors.empty()) {
+        ret.emplace(WarningSourceData::constructFromData(warningDataVectors,
+            safeIntegerConversion<idx_t>(pos)));
+    }
+    return ret;
+}
+
+// TODO(Guodong): Add short path for unfiltered case.
+bool checkNullKey(ValueVector* keyVector, offset_t vectorOffset,
+    BatchInsertErrorHandler* errorHandler, const std::vector<ValueVector*>& warningDataVectors) {
+    bool isNull = keyVector->isNull(vectorOffset);
+    if (isNull) {
+        errorHandler->handleError(ExceptionMessage::nullPKException(),
+            getWarningSourceData(warningDataVectors, vectorOffset));
+    }
+    return !isNull;
+}
+
+struct OffsetVectorManager {
+    OffsetVectorManager(ValueVector* resultVector, BatchInsertErrorHandler* errorHandler)
+        : ignoreErrors(errorHandler->getIgnoreErrors()), resultVector(resultVector),
+          insertOffset(0) {
+        // if we are ignoring errors we may need to filter the output sel vector
+        if (ignoreErrors) {
+            resultVector->state->getSelVectorUnsafe().setToFiltered();
+        }
+    }
+
+    ~OffsetVectorManager() {
+        if (ignoreErrors) {
+            resultVector->state->getSelVectorUnsafe().setSelSize(insertOffset);
+        }
+    }
+
+    void insertEntry(offset_t entry, sel_t posInKeyVector) {
+        auto* offsets = reinterpret_cast<offset_t*>(resultVector->getData());
+        offsets[posInKeyVector] = entry;
+        if (ignoreErrors) {
+            // if the lookup was successful we may add the current entry to the output selection
+            resultVector->state->getSelVectorUnsafe()[insertOffset] = posInKeyVector;
+        }
+        ++insertOffset;
+    }
+
+    bool ignoreErrors;
+    ValueVector* resultVector;
+
+    offset_t insertOffset;
+};
+
+// TODO(Guodong): Add short path for unfiltered case.
+template<bool hasNoNullsGuarantee>
+void fillOffsetArraysFromVector(transaction::Transaction* transaction, const IndexLookupInfo& info,
+    ValueVector* keyVector, ValueVector* resultVector,
+    const std::vector<ValueVector*>& warningDataVectors, BatchInsertErrorHandler* errorHandler) {
+    KU_ASSERT(resultVector->dataType.getPhysicalType() == PhysicalTypeID::INT64);
+    TypeUtils::visit(
+        keyVector->dataType.getPhysicalType(),
+        [&]<IndexHashable T>(T) {
+            auto numKeys = keyVector->state->getSelVector().getSelSize();
+
+            // fetch all the selection pos at the start
+            // since we may modify the selection vector in the middle of the lookup
+            std::vector<sel_t> lookupPos(numKeys);
+            for (idx_t i = 0; i < numKeys; ++i) {
+                lookupPos[i] = (keyVector->state->getSelVector()[i]);
+            }
+
+            OffsetVectorManager resultManager{resultVector, errorHandler};
+            for (auto i = 0u; i < numKeys; i++) {
+                auto pos = lookupPos[i];
+                if constexpr (!hasNoNullsGuarantee) {
+                    if (!checkNullKey(keyVector, pos, errorHandler, warningDataVectors)) {
+                        continue;
+                    }
+                }
+                offset_t lookupOffset = 0;
+                if (!info.nodeTable->lookupPK(transaction, keyVector, pos, lookupOffset)) {
+                    TypeUtils::visit(keyVector->dataType, [&]<typename type>(type) {
+                        errorHandler->handleError(
+                            ExceptionMessage::nonExistentPKException(
+                                TypeUtils::toString(keyVector->getValue<type>(pos), keyVector)),
+                            getWarningSourceData(warningDataVectors, pos));
+                    });
+                } else {
+                    resultManager.insertEntry(lookupOffset, pos);
+                }
+            }
+        },
+        [&](auto) { KU_UNREACHABLE; });
+}
+} // namespace
+
+std::string IndexLookupPrintInfo::toString() const {
+    std::string result = "Indexes: ";
+    result += binder::ExpressionUtil::toString(expressions);
+    return result;
+}
+
+bool IndexLookup::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    for (auto& info : infos) {
+        info.keyEvaluator->evaluate();
+        lookup(transaction::Transaction::Get(*context->clientContext), info);
+    }
+    localState->errorHandler->flushStoredErrors();
+    return true;
+}
+
+void IndexLookup::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    auto errorHandler = std::make_unique<BatchInsertErrorHandler>(context,
+        WarningContext::Get(*context->clientContext)->getIgnoreErrorsOption());
+    localState = std::make_unique<IndexLookupLocalState>(std::move(errorHandler));
+    for (auto& pos : warningDataVectorPos) {
+        localState->warningDataVectors.push_back(resultSet->getValueVector(pos).get());
+    }
+    for (auto& info : infos) {
+        info.keyEvaluator->init(*resultSet, context->clientContext);
+    }
+}
+
+void IndexLookup::lookup(transaction::Transaction* transaction, const IndexLookupInfo& info) {
+    auto keyVector = info.keyEvaluator->resultVector.get();
+    auto resultVector = resultSet->getValueVector(info.resultVectorPos).get();
+
+    if (keyVector->hasNoNullsGuarantee()) {
+        fillOffsetArraysFromVector<true>(transaction, info, keyVector, resultVector,
+            localState->warningDataVectors, localState->errorHandler.get());
+    } else {
+        fillOffsetArraysFromVector<false>(transaction, info, keyVector, resultVector,
+            localState->warningDataVectors, localState->errorHandler.get());
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/intersect/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/intersect/CMakeLists.txt
new file mode 100644
index 0000000000..8df0db7892
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/intersect/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_processor_operator_intersect
+        OBJECT
+        intersect.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_intersect>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/intersect/intersect.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/intersect/intersect.cpp
new file mode 100644
index 0000000000..3eda85e8a7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/intersect/intersect.cpp
@@ -0,0 +1,228 @@
+#include "processor/operator/intersect/intersect.h"
+
+#include <algorithm>
+
+#include "function/hash/hash_functions.h"
+#include "processor/result/factorized_table.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string IntersectPrintInfo::toString() const {
+    std::string result = "Key: ";
+    result += key->toString();
+    return result;
+}
+
+void Intersect::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* /*context*/) {
+    outKeyVector = resultSet->getValueVector(outputDataPos);
+    for (auto& dataInfo : intersectDataInfos) {
+        probeKeyVectors.push_back(resultSet->getValueVector(dataInfo.keyDataPos));
+        std::vector<uint32_t> columnIdxesToScanFrom;
+        std::vector<ValueVector*> vectorsToReadInto;
+        for (auto i = 0u; i < dataInfo.payloadsDataPos.size(); i++) {
+            auto vector = resultSet->getValueVector(dataInfo.payloadsDataPos[i]);
+            // Always skip the first two columns in the fTable: build key and intersect key.
+            // TODO(Guodong): Remove this assumption so that keys can be stored in any order. Change
+            // mapping logic too so that we don't need to maintain this order explicitly.
+            columnIdxesToScanFrom.push_back(i + 2);
+            vectorsToReadInto.push_back(vector.get());
+        }
+        payloadColumnIdxesToScanFrom.push_back(columnIdxesToScanFrom);
+        payloadVectorsToScanInto.push_back(std::move(vectorsToReadInto));
+    }
+    for (auto& sharedHT : sharedHTs) {
+        intersectSelVectors.push_back(std::make_unique<SelectionVector>(DEFAULT_VECTOR_CAPACITY));
+        isIntersectListAFlatValue.push_back(
+            sharedHT->getHashTable()->getTableSchema()->getColumn(1)->isFlat());
+    }
+}
+
+void Intersect::probeHTs() {
+    std::vector<std::vector<overflow_value_t>> flatTuples(probeKeyVectors.size());
+    hash_t hashVal = 0;
+    for (auto i = 0u; i < probeKeyVectors.size(); i++) {
+        KU_ASSERT(probeKeyVectors[i]->state->isFlat());
+        probedFlatTuples[i].clear();
+        if (sharedHTs[i]->getHashTable()->getNumEntries() == 0) {
+            continue;
+        }
+        auto key =
+            probeKeyVectors[i]->getValue<nodeID_t>(probeKeyVectors[i]->state->getSelVector()[0]);
+        function::Hash::operation<nodeID_t>(key, false, hashVal);
+        auto flatTuple = sharedHTs[i]->getHashTable()->getTupleForHash(hashVal);
+        while (flatTuple) {
+            if (*(nodeID_t*)flatTuple == key) {
+                probedFlatTuples[i].push_back(flatTuple);
+            }
+            flatTuple = *sharedHTs[i]->getHashTable()->getPrevTuple(flatTuple);
+        }
+    }
+}
+
+void Intersect::twoWayIntersect(nodeID_t* leftNodeIDs, SelectionVector& lSelVector,
+    nodeID_t* rightNodeIDs, SelectionVector& rSelVector) {
+    KU_ASSERT(lSelVector.getSelSize() <= rSelVector.getSelSize());
+    auto leftPositionBuffer = lSelVector.getMutableBuffer();
+    auto rightPositionBuffer = rSelVector.getMutableBuffer();
+    sel_t leftPosition = 0, rightPosition = 0;
+    uint64_t outputValuePosition = 0;
+    while (leftPosition < lSelVector.getSelSize() && rightPosition < rSelVector.getSelSize()) {
+        auto leftNodeID = leftNodeIDs[leftPosition];
+        auto rightNodeID = rightNodeIDs[rightPosition];
+        if (leftNodeID < rightNodeID) {
+            leftPosition++;
+        } else if (leftNodeID > rightNodeID) {
+            rightPosition++;
+        } else {
+            leftPositionBuffer[outputValuePosition] = leftPosition;
+            rightPositionBuffer[outputValuePosition] = rightPosition;
+            leftNodeIDs[outputValuePosition] = leftNodeID;
+            leftPosition++;
+            rightPosition++;
+            outputValuePosition++;
+        }
+    }
+    lSelVector.setToFiltered(outputValuePosition);
+    rSelVector.setToFiltered(outputValuePosition);
+}
+
+static std::vector<overflow_value_t> fetchListsToIntersectFromTuples(
+    const std::vector<uint8_t*>& tuples, const std::vector<bool>& isFlatValue) {
+    std::vector<overflow_value_t> listsToIntersect(tuples.size());
+    for (auto i = 0u; i < tuples.size(); i++) {
+        listsToIntersect[i] =
+            isFlatValue[i] ? overflow_value_t{1 /* numElements */, tuples[i] + sizeof(nodeID_t)} :
+                             *(overflow_value_t*)(tuples[i] + sizeof(nodeID_t));
+    }
+    return listsToIntersect;
+}
+
+static std::vector<uint32_t> swapSmallestListToFront(std::vector<overflow_value_t>& lists) {
+    KU_ASSERT(lists.size() >= 2);
+    std::vector<uint32_t> listIdxes(lists.size());
+    iota(listIdxes.begin(), listIdxes.end(), 0);
+    uint32_t smallestListIdx = 0;
+    for (auto i = 1u; i < lists.size(); i++) {
+        if (lists[i].numElements < lists[smallestListIdx].numElements) {
+            smallestListIdx = i;
+        }
+    }
+    if (smallestListIdx != 0) {
+        std::swap(lists[smallestListIdx], lists[0]);
+        std::swap(listIdxes[smallestListIdx], listIdxes[0]);
+    }
+    return listIdxes;
+}
+
+static void sliceSelVectors(const std::vector<SelectionVector*>& selVectorsToSlice,
+    SelectionVector& slicer) {
+    for (auto selVec : selVectorsToSlice) {
+        for (auto i = 0u; i < slicer.getSelSize(); i++) {
+            auto pos = slicer[i];
+            auto buffer = selVec->getMutableBuffer();
+            buffer[i] = selVec->operator[](pos);
+        }
+        selVec->setToFiltered(slicer.getSelSize());
+    }
+}
+
+void Intersect::intersectLists(const std::vector<overflow_value_t>& listsToIntersect) {
+    if (listsToIntersect[0].numElements == 0) {
+        outKeyVector->state->getSelVectorUnsafe().setSelSize(0);
+        return;
+    }
+    KU_ASSERT(listsToIntersect[0].numElements <= DEFAULT_VECTOR_CAPACITY);
+    memcpy(outKeyVector->getData(), listsToIntersect[0].value,
+        listsToIntersect[0].numElements * sizeof(nodeID_t));
+    SelectionVector lSelVector(listsToIntersect[0].numElements);
+    lSelVector.setSelSize(listsToIntersect[0].numElements);
+    std::vector<SelectionVector*> selVectorsForIntersectedLists;
+    intersectSelVectors[0]->setToUnfiltered(listsToIntersect[0].numElements);
+    selVectorsForIntersectedLists.push_back(intersectSelVectors[0].get());
+    for (auto i = 0u; i < listsToIntersect.size() - 1; i++) {
+        intersectSelVectors[i + 1]->setToUnfiltered(listsToIntersect[i + 1].numElements);
+        twoWayIntersect((nodeID_t*)outKeyVector->getData(), lSelVector,
+            (nodeID_t*)listsToIntersect[i + 1].value, *intersectSelVectors[i + 1]);
+        // Here we need to slice all selVectors that have been previously intersected, as all these
+        // lists need to be selected synchronously to read payloads correctly.
+        sliceSelVectors(selVectorsForIntersectedLists, lSelVector);
+        lSelVector.setToUnfiltered();
+        selVectorsForIntersectedLists.push_back(intersectSelVectors[i + 1].get());
+    }
+    outKeyVector->state->getSelVectorUnsafe().setSelSize(lSelVector.getSelSize());
+}
+
+void Intersect::populatePayloads(const std::vector<uint8_t*>& tuples,
+    const std::vector<uint32_t>& listIdxes) {
+    for (auto i = 0u; i < listIdxes.size(); i++) {
+        auto listIdx = listIdxes[i];
+        sharedHTs[listIdx]->getHashTable()->getFactorizedTable()->lookup(
+            payloadVectorsToScanInto[listIdx], intersectSelVectors[i].get(),
+            payloadColumnIdxesToScanFrom[listIdx], tuples[listIdx]);
+    }
+}
+
+bool Intersect::hasNextTuplesToIntersect() {
+    tupleIdxPerBuildSide[carryBuildSideIdx]++;
+    if (tupleIdxPerBuildSide[carryBuildSideIdx] == probedFlatTuples[carryBuildSideIdx].size()) {
+        if (carryBuildSideIdx == 0) {
+            return false;
+        }
+        tupleIdxPerBuildSide[carryBuildSideIdx] = 0;
+        carryBuildSideIdx--;
+        if (!hasNextTuplesToIntersect()) {
+            return false;
+        }
+        carryBuildSideIdx++;
+    }
+    return true;
+}
+
+bool Intersect::getNextTuplesInternal(ExecutionContext* context) {
+    do {
+        while (carryBuildSideIdx == -1u) {
+            if (!children[0]->getNextTuple(context)) {
+                return false;
+            }
+            // For each build side, probe its HT and return a vector of matched flat tuples.
+            probeHTs();
+            auto maxNumTuplesToIntersect = 1u;
+            for (auto i = 0u; i < getNumBuilds(); i++) {
+                maxNumTuplesToIntersect *= probedFlatTuples[i].size();
+            }
+            if (maxNumTuplesToIntersect == 0) {
+                // Skip if any build side has no matches.
+                continue;
+            }
+            carryBuildSideIdx = getNumBuilds() - 1;
+            std::fill(tupleIdxPerBuildSide.begin(), tupleIdxPerBuildSide.end(), 0);
+        }
+        // Cartesian product of all flat tuples probed from all build sides.
+        // Notice: when there are large adjacency lists in the build side, which means the list is
+        // too large to fit in a single ValueVector, we end up chunking the list as multiple tuples
+        // in FTable. Thus, when performing the intersection, we need to perform cartesian product
+        // between all flat tuples probed from all build sides.
+        std::vector<uint8_t*> flatTuplesToIntersect(getNumBuilds());
+        for (auto i = 0u; i < getNumBuilds(); i++) {
+            flatTuplesToIntersect[i] = probedFlatTuples[i][tupleIdxPerBuildSide[i]];
+        }
+        auto listsToIntersect =
+            fetchListsToIntersectFromTuples(flatTuplesToIntersect, isIntersectListAFlatValue);
+        auto listIdxes = swapSmallestListToFront(listsToIntersect);
+        intersectLists(listsToIntersect);
+        if (outKeyVector->state->getSelVector().getSelSize() != 0) {
+            populatePayloads(flatTuplesToIntersect, listIdxes);
+        }
+        if (!hasNextTuplesToIntersect()) {
+            carryBuildSideIdx = -1u;
+        }
+    } while (outKeyVector->state->getSelVector().getSelSize() == 0);
+    metrics->numOutputTuple.increase(outKeyVector->state->getSelVector().getSelSize());
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/limit.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/limit.cpp
new file mode 100644
index 0000000000..4400480d2d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/limit.cpp
@@ -0,0 +1,40 @@
+#include "processor/operator/limit.h"
+
+#include "common/metric.h"
+
+namespace lbug {
+namespace processor {
+
+std::string LimitPrintInfo::toString() const {
+    return "Limit: " + std::to_string(limitNum);
+}
+
+bool Limit::getNextTuplesInternal(ExecutionContext* context) {
+    // end of execution due to no more input
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    auto numTupleAvailable = resultSet->getNumTuples(dataChunksPosInScope);
+    auto numTupleProcessedBefore = counter->fetch_add(numTupleAvailable);
+    if (numTupleProcessedBefore + numTupleAvailable > limitNumber) {
+        int64_t numTupleToProcessInCurrentResultSet = limitNumber - numTupleProcessedBefore;
+        // end of execution due to limit has reached
+        if (numTupleToProcessInCurrentResultSet <= 0) {
+            return false;
+        } else {
+            // If all dataChunks are flat, numTupleAvailable = 1 which means numTupleProcessedBefore
+            // = limitNumber. So execution is terminated in above if statement.
+            auto& dataChunkToSelect = resultSet->dataChunks[dataChunkToSelectPos];
+            KU_ASSERT(!dataChunkToSelect->state->isFlat());
+            dataChunkToSelect->state->getSelVectorUnsafe().setSelSize(
+                numTupleToProcessInCurrentResultSet);
+            metrics->numOutputTuple.increase(numTupleToProcessInCurrentResultSet);
+        }
+    } else {
+        metrics->numOutputTuple.increase(numTupleAvailable);
+    }
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/macro/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/macro/CMakeLists.txt
new file mode 100644
index 0000000000..527c46d20a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/macro/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_processor_operator_create_macro
+        OBJECT
+        create_macro.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_create_macro>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/macro/create_macro.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/macro/create_macro.cpp
new file mode 100644
index 0000000000..e92ee74c72
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/macro/create_macro.cpp
@@ -0,0 +1,27 @@
+#include "processor/operator/macro/create_macro.h"
+
+#include "common/string_format.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string CreateMacroPrintInfo::toString() const {
+    return macroName;
+}
+
+void CreateMacro::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    auto catalog = catalog::Catalog::Get(*clientContext);
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    catalog->addScalarMacroFunction(transaction, info.macroName, info.macro->copy());
+    appendMessage(stringFormat("Macro: {} has been created.", info.macroName),
+        storage::MemoryManager::Get(*clientContext));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/multiplicity_reducer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/multiplicity_reducer.cpp
new file mode 100644
index 0000000000..36895f78d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/multiplicity_reducer.cpp
@@ -0,0 +1,23 @@
+#include "processor/operator/multiplicity_reducer.h"
+
+namespace lbug {
+namespace processor {
+
+bool MultiplicityReducer::getNextTuplesInternal(ExecutionContext* context) {
+    if (numRepeat == 0) {
+        restoreMultiplicity();
+        if (!children[0]->getNextTuple(context)) {
+            return false;
+        }
+        saveMultiplicity();
+        resultSet->multiplicity = 1;
+    }
+    numRepeat++;
+    if (numRepeat == prevMultiplicity) {
+        numRepeat = 0;
+    }
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/CMakeLists.txt
new file mode 100644
index 0000000000..3b3fce6548
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/CMakeLists.txt
@@ -0,0 +1,15 @@
+add_library(lbug_processor_operator_order_by
+        OBJECT
+        key_block_merger.cpp
+        order_by.cpp
+        order_by_key_encoder.cpp
+        order_by_merge.cpp
+        order_by_scan.cpp
+        radix_sort.cpp
+        sort_state.cpp
+        top_k.cpp
+        top_k_scanner.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_order_by>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/key_block_merger.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/key_block_merger.cpp
new file mode 100644
index 0000000000..5714219cb5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/key_block_merger.cpp
@@ -0,0 +1,326 @@
+#include "processor/operator/order_by/key_block_merger.h"
+
+#include "common/system_config.h"
+
+using namespace lbug::common;
+using namespace lbug::processor;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+static constexpr uint64_t DATA_BLOCK_SIZE = common::TEMP_PAGE_SIZE;
+
+MergedKeyBlocks::MergedKeyBlocks(uint32_t numBytesPerTuple, uint64_t numTuples,
+    MemoryManager* memoryManager)
+    : numBytesPerTuple{numBytesPerTuple},
+      numTuplesPerBlock{(uint32_t)(DATA_BLOCK_SIZE / numBytesPerTuple)}, numTuples{numTuples},
+      endTupleOffset{numTuplesPerBlock * numBytesPerTuple} {
+    auto numKeyBlocks = numTuples / numTuplesPerBlock + (numTuples % numTuplesPerBlock ? 1 : 0);
+    for (auto i = 0u; i < numKeyBlocks; i++) {
+        keyBlocks.emplace_back(std::make_shared<DataBlock>(memoryManager, DATA_BLOCK_SIZE));
+    }
+}
+
+// This constructor is used to convert a keyBlock to a MergedKeyBlocks.
+MergedKeyBlocks::MergedKeyBlocks(uint32_t numBytesPerTuple, std::shared_ptr<DataBlock> keyBlock)
+    : numBytesPerTuple{numBytesPerTuple},
+      numTuplesPerBlock{(uint32_t)(DATA_BLOCK_SIZE / numBytesPerTuple)},
+      numTuples{keyBlock->numTuples}, endTupleOffset{numTuplesPerBlock * numBytesPerTuple} {
+    keyBlocks.emplace_back(std::move(keyBlock));
+}
+
+uint8_t* MergedKeyBlocks::getBlockEndTuplePtr(uint32_t blockIdx, uint64_t endTupleIdx,
+    uint32_t endTupleBlockIdx) const {
+    KU_ASSERT(blockIdx < keyBlocks.size());
+    if (endTupleIdx == 0) {
+        return getKeyBlockBuffer(0);
+    }
+    return blockIdx == endTupleBlockIdx ? getTuple(endTupleIdx - 1) + numBytesPerTuple :
+                                          getKeyBlockBuffer(blockIdx) + endTupleOffset;
+}
+
+BlockPtrInfo::BlockPtrInfo(uint64_t startTupleIdx, uint64_t endTupleIdx, MergedKeyBlocks* keyBlocks)
+    : keyBlocks{keyBlocks}, curBlockIdx{startTupleIdx / keyBlocks->getNumTuplesPerBlock()},
+      endBlockIdx{endTupleIdx == 0 ? 0 : (endTupleIdx - 1) / keyBlocks->getNumTuplesPerBlock()},
+      endTupleIdx{endTupleIdx} {
+    if (startTupleIdx == endTupleIdx) {
+        curTuplePtr = nullptr;
+        endTuplePtr = nullptr;
+        curBlockEndTuplePtr = nullptr;
+    } else {
+        curTuplePtr = keyBlocks->getTuple(startTupleIdx);
+        endTuplePtr = keyBlocks->getBlockEndTuplePtr(endBlockIdx, endTupleIdx, endBlockIdx);
+        curBlockEndTuplePtr = keyBlocks->getBlockEndTuplePtr(curBlockIdx, endTupleIdx, endBlockIdx);
+    }
+}
+
+void BlockPtrInfo::updateTuplePtrIfNecessary() {
+    if (curTuplePtr == curBlockEndTuplePtr) {
+        curBlockIdx++;
+        if (curBlockIdx <= endBlockIdx) {
+            curTuplePtr = keyBlocks->getKeyBlockBuffer(curBlockIdx);
+            curBlockEndTuplePtr =
+                keyBlocks->getBlockEndTuplePtr(curBlockIdx, endTupleIdx, endBlockIdx);
+        }
+    }
+}
+
+uint64_t KeyBlockMergeTask::findRightKeyBlockIdx(uint8_t* leftEndTuplePtr) const {
+    // Find a tuple in the right memory block such that:
+    // 1. The value of the current tuple is smaller than the value in leftEndTuple.
+    // 2. Either the value of next tuple is larger than the value in leftEndTuple or
+    // the current tuple is the last tuple in the right memory block.
+    int64_t startIdx = rightKeyBlockNextIdx;
+    int64_t endIdx = rightKeyBlock->getNumTuples() - 1;
+
+    while (startIdx <= endIdx) {
+        uint64_t curTupleIdx = (startIdx + endIdx) / 2;
+        uint8_t* curTuplePtr = rightKeyBlock->getTuple(curTupleIdx);
+
+        if (keyBlockMerger.compareTuplePtr(leftEndTuplePtr, curTuplePtr)) {
+            if (curTupleIdx == rightKeyBlock->getNumTuples() - 1 ||
+                !keyBlockMerger.compareTuplePtr(leftEndTuplePtr,
+                    rightKeyBlock->getTuple(curTupleIdx + 1))) {
+                // If the current tuple is the last tuple or the value of next tuple is larger than
+                // the value of leftEndTuple, return the curTupleIdx.
+                return curTupleIdx;
+            } else {
+                startIdx = curTupleIdx + 1;
+            }
+        } else {
+            endIdx = curTupleIdx - 1;
+        }
+    }
+    // If such tuple doesn't exist, return -1.
+    return -1;
+}
+
+std::unique_ptr<KeyBlockMergeMorsel> KeyBlockMergeTask::getMorsel() {
+    // We grab a batch of tuples from the left memory block, then do a binary search on the
+    // right memory block to find the range of tuples to merge.
+    activeMorsels++;
+    if (rightKeyBlockNextIdx >= rightKeyBlock->getNumTuples()) {
+        // If there is no more tuples left in the right key block,
+        // just append all tuples in the left key block to the result key block.
+        auto keyBlockMergeMorsel =
+            std::make_unique<KeyBlockMergeMorsel>(leftKeyBlockNextIdx, leftKeyBlock->getNumTuples(),
+                rightKeyBlock->getNumTuples(), rightKeyBlock->getNumTuples());
+        leftKeyBlockNextIdx = leftKeyBlock->getNumTuples();
+        return keyBlockMergeMorsel;
+    }
+
+    auto leftKeyBlockStartIdx = leftKeyBlockNextIdx;
+    leftKeyBlockNextIdx += batch_size;
+
+    if (leftKeyBlockNextIdx >= leftKeyBlock->getNumTuples()) {
+        // This is the last batch of tuples in the left key block to merge, so just merge it with
+        // remaining tuples of the right key block.
+        auto keyBlockMergeMorsel = std::make_unique<KeyBlockMergeMorsel>(leftKeyBlockStartIdx,
+            std::min(leftKeyBlockNextIdx, leftKeyBlock->getNumTuples()), rightKeyBlockNextIdx,
+            rightKeyBlock->getNumTuples());
+        rightKeyBlockNextIdx = rightKeyBlock->getNumTuples();
+        return keyBlockMergeMorsel;
+    } else {
+        // Conduct a binary search to find the ending index in the right memory block.
+        auto leftEndIdxPtr = leftKeyBlock->getTuple(leftKeyBlockNextIdx - 1);
+        auto rightEndIdx = findRightKeyBlockIdx(leftEndIdxPtr);
+
+        auto keyBlockMergeMorsel = std::make_unique<KeyBlockMergeMorsel>(leftKeyBlockStartIdx,
+            std::min(leftKeyBlockNextIdx, leftKeyBlock->getNumTuples()), rightKeyBlockNextIdx,
+            rightEndIdx == (uint64_t)-1 ? rightKeyBlockNextIdx : ++rightEndIdx);
+
+        if (rightEndIdx != (uint64_t)-1) {
+            rightKeyBlockNextIdx = rightEndIdx;
+        }
+        return keyBlockMergeMorsel;
+    }
+}
+
+void KeyBlockMerger::mergeKeyBlocks(KeyBlockMergeMorsel& keyBlockMergeMorsel) const {
+    KU_ASSERT(keyBlockMergeMorsel.leftKeyBlockStartIdx < keyBlockMergeMorsel.leftKeyBlockEndIdx ||
+              keyBlockMergeMorsel.rightKeyBlockStartIdx < keyBlockMergeMorsel.rightKeyBlockEndIdx);
+
+    auto leftBlockPtrInfo = BlockPtrInfo(keyBlockMergeMorsel.leftKeyBlockStartIdx,
+        keyBlockMergeMorsel.leftKeyBlockEndIdx,
+        keyBlockMergeMorsel.keyBlockMergeTask->leftKeyBlock.get());
+
+    auto rightBlockPtrInfo = BlockPtrInfo(keyBlockMergeMorsel.rightKeyBlockStartIdx,
+        keyBlockMergeMorsel.rightKeyBlockEndIdx,
+        keyBlockMergeMorsel.keyBlockMergeTask->rightKeyBlock.get());
+
+    auto resultBlockPtrInfo = BlockPtrInfo(keyBlockMergeMorsel.leftKeyBlockStartIdx +
+                                               keyBlockMergeMorsel.rightKeyBlockStartIdx,
+        keyBlockMergeMorsel.leftKeyBlockEndIdx + keyBlockMergeMorsel.rightKeyBlockEndIdx,
+        keyBlockMergeMorsel.keyBlockMergeTask->resultKeyBlock.get());
+
+    while (leftBlockPtrInfo.hasMoreTuplesToRead() && rightBlockPtrInfo.hasMoreTuplesToRead()) {
+        uint64_t nextNumBytesToMerge =
+            std::min(std::min(leftBlockPtrInfo.getNumBytesLeftInCurBlock(),
+                         rightBlockPtrInfo.getNumBytesLeftInCurBlock()),
+                resultBlockPtrInfo.getNumBytesLeftInCurBlock());
+        for (auto i = 0u; i < nextNumBytesToMerge; i += numBytesPerTuple) {
+            if (compareTuplePtr(leftBlockPtrInfo.curTuplePtr, rightBlockPtrInfo.curTuplePtr)) {
+                memcpy(resultBlockPtrInfo.curTuplePtr, rightBlockPtrInfo.curTuplePtr,
+                    numBytesPerTuple);
+                rightBlockPtrInfo.curTuplePtr += numBytesPerTuple;
+            } else {
+                memcpy(resultBlockPtrInfo.curTuplePtr, leftBlockPtrInfo.curTuplePtr,
+                    numBytesPerTuple);
+                leftBlockPtrInfo.curTuplePtr += numBytesPerTuple;
+            }
+            resultBlockPtrInfo.curTuplePtr += numBytesPerTuple;
+        }
+        leftBlockPtrInfo.updateTuplePtrIfNecessary();
+        rightBlockPtrInfo.updateTuplePtrIfNecessary();
+        resultBlockPtrInfo.updateTuplePtrIfNecessary();
+    }
+
+    copyRemainingBlockDataToResult(rightBlockPtrInfo, resultBlockPtrInfo);
+    copyRemainingBlockDataToResult(leftBlockPtrInfo, resultBlockPtrInfo);
+}
+
+// This function returns true if the value in the leftTuplePtr is larger than the value in the
+// rightTuplePtr.
+bool KeyBlockMerger::compareTuplePtrWithStringCol(uint8_t* leftTuplePtr,
+    uint8_t* rightTuplePtr) const {
+    // We can't simply use memcmp to compare tuples if there are string columns.
+    // We should only compare the binary strings starting from the last compared string column
+    // till the next string column.
+    uint64_t lastComparedBytes = 0;
+    for (auto& strKeyColInfo : strKeyColsInfo) {
+        auto result = memcmp(leftTuplePtr + lastComparedBytes, rightTuplePtr + lastComparedBytes,
+            strKeyColInfo.colOffsetInEncodedKeyBlock - lastComparedBytes +
+                strKeyColInfo.getEncodingSize());
+        // If both sides are nulls, we can just continue to check the next string column.
+        auto leftStrColPtr = leftTuplePtr + strKeyColInfo.colOffsetInEncodedKeyBlock;
+        auto rightStrColPtr = rightTuplePtr + strKeyColInfo.colOffsetInEncodedKeyBlock;
+        if (OrderByKeyEncoder::isNullVal(leftStrColPtr, strKeyColInfo.isAscOrder) &&
+            OrderByKeyEncoder::isNullVal(rightStrColPtr, strKeyColInfo.isAscOrder)) {
+            lastComparedBytes =
+                strKeyColInfo.colOffsetInEncodedKeyBlock + strKeyColInfo.getEncodingSize();
+            continue;
+        }
+
+        // If there is a tie, we need to compare the overflow ptr of strings values.
+        if (result == 0) {
+            // We do an optimization here to minimize the number of times that we fetch
+            // strings from factorizedTable. If both left and right strings are short string,
+            // they must equal to each other (since there are no other characters to compare for
+            // them). If one string is long string and the other string is short string, the
+            // long string must be greater than the short string.
+            bool isLeftStrLong =
+                OrderByKeyEncoder::isLongStr(leftStrColPtr, strKeyColInfo.isAscOrder);
+            bool isRightStrLong =
+                OrderByKeyEncoder::isLongStr(rightStrColPtr, strKeyColInfo.isAscOrder);
+            if (!isLeftStrLong && !isRightStrLong) {
+                continue;
+            } else if (isLeftStrLong && !isRightStrLong) {
+                return strKeyColInfo.isAscOrder;
+            } else if (!isLeftStrLong && isRightStrLong) {
+                return !strKeyColInfo.isAscOrder;
+            }
+
+            auto leftTupleInfo = leftTuplePtr + numBytesToCompare;
+            auto rightTupleInfo = rightTuplePtr + numBytesToCompare;
+            auto leftBlockIdx = OrderByKeyEncoder::getEncodedFTBlockIdx(leftTupleInfo);
+            auto leftBlockOffset = OrderByKeyEncoder::getEncodedFTBlockOffset(leftTupleInfo);
+            auto rightBlockIdx = OrderByKeyEncoder::getEncodedFTBlockIdx(rightTupleInfo);
+            auto rightBlockOffset = OrderByKeyEncoder::getEncodedFTBlockOffset(rightTupleInfo);
+
+            auto& leftFactorizedTable =
+                factorizedTables[OrderByKeyEncoder::getEncodedFTIdx(leftTupleInfo)];
+            auto& rightFactorizedTable =
+                factorizedTables[OrderByKeyEncoder::getEncodedFTIdx(rightTupleInfo)];
+            auto leftStr = leftFactorizedTable->getData<ku_string_t>(leftBlockIdx, leftBlockOffset,
+                strKeyColInfo.colOffsetInFT);
+            auto rightStr = rightFactorizedTable->getData<ku_string_t>(rightBlockIdx,
+                rightBlockOffset, strKeyColInfo.colOffsetInFT);
+            result = (leftStr == rightStr);
+            if (result) {
+                // If the tie can't be solved, we need to check the next string column.
+                lastComparedBytes =
+                    strKeyColInfo.colOffsetInEncodedKeyBlock + strKeyColInfo.getEncodingSize();
+                continue;
+            }
+            result = leftStr > rightStr;
+            return strKeyColInfo.isAscOrder == result;
+        }
+        return result > 0;
+    }
+    // The string tie can't be solved, just add the tuple in the leftMemBlock to
+    // resultMemBlock.
+    return false;
+}
+
+void KeyBlockMerger::copyRemainingBlockDataToResult(BlockPtrInfo& blockToCopy,
+    BlockPtrInfo& resultBlock) const {
+    while (blockToCopy.curBlockIdx <= blockToCopy.endBlockIdx) {
+        uint64_t nextNumBytesToMerge = std::min(blockToCopy.getNumBytesLeftInCurBlock(),
+            resultBlock.getNumBytesLeftInCurBlock());
+        for (auto i = 0u; i < nextNumBytesToMerge; i += numBytesPerTuple) {
+            memcpy(resultBlock.curTuplePtr, blockToCopy.curTuplePtr, numBytesPerTuple);
+            blockToCopy.curTuplePtr += numBytesPerTuple;
+            resultBlock.curTuplePtr += numBytesPerTuple;
+        }
+        blockToCopy.updateTuplePtrIfNecessary();
+        resultBlock.updateTuplePtrIfNecessary();
+    }
+}
+
+std::unique_ptr<KeyBlockMergeMorsel> KeyBlockMergeTaskDispatcher::getMorsel() {
+    if (isDoneMerge()) {
+        return nullptr;
+    }
+    std::lock_guard<std::mutex> keyBlockMergeDispatcherLock{mtx};
+
+    if (!activeKeyBlockMergeTasks.empty() && activeKeyBlockMergeTasks.back()->hasMorselLeft()) {
+        // If there are morsels left in the lastMergeTask, just give it to the caller.
+        auto morsel = activeKeyBlockMergeTasks.back()->getMorsel();
+        morsel->keyBlockMergeTask = activeKeyBlockMergeTasks.back();
+        return morsel;
+    } else if (sortedKeyBlocks->size() > 1) {
+        // If there are no morsels left in the lastMergeTask, we just create a new merge task.
+        auto leftKeyBlock = sortedKeyBlocks->front();
+        sortedKeyBlocks->pop();
+        auto rightKeyBlock = sortedKeyBlocks->front();
+        sortedKeyBlocks->pop();
+        auto resultKeyBlock = std::make_shared<MergedKeyBlocks>(leftKeyBlock->getNumBytesPerTuple(),
+            leftKeyBlock->getNumTuples() + rightKeyBlock->getNumTuples(), memoryManager);
+        auto newMergeTask = std::make_shared<KeyBlockMergeTask>(leftKeyBlock, rightKeyBlock,
+            resultKeyBlock, *keyBlockMerger);
+        activeKeyBlockMergeTasks.emplace_back(newMergeTask);
+        auto morsel = newMergeTask->getMorsel();
+        morsel->keyBlockMergeTask = newMergeTask;
+        return morsel;
+    } else {
+        // There is no morsel can be given at this time, just wait for the ongoing merge
+        // task to finish.
+        return nullptr;
+    }
+}
+
+void KeyBlockMergeTaskDispatcher::doneMorsel(std::unique_ptr<KeyBlockMergeMorsel> morsel) {
+    std::lock_guard<std::mutex> keyBlockMergeDispatcherLock{mtx};
+    // If there is no active and morsels left tin the keyBlockMergeTask, just remove it from
+    // the active keyBlockMergeTask and add the result key block to the sortedKeyBlocks queue.
+    if ((--morsel->keyBlockMergeTask->activeMorsels) == 0 &&
+        !morsel->keyBlockMergeTask->hasMorselLeft()) {
+        erase(activeKeyBlockMergeTasks, morsel->keyBlockMergeTask);
+        sortedKeyBlocks->emplace(morsel->keyBlockMergeTask->resultKeyBlock);
+    }
+}
+
+void KeyBlockMergeTaskDispatcher::init(MemoryManager* memoryManager,
+    std::queue<std::shared_ptr<MergedKeyBlocks>>* sortedKeyBlocks,
+    std::vector<FactorizedTable*> factorizedTables, std::vector<StrKeyColInfo>& strKeyColsInfo,
+    uint64_t numBytesPerTuple) {
+    KU_ASSERT(this->keyBlockMerger == nullptr);
+    this->memoryManager = memoryManager;
+    this->sortedKeyBlocks = sortedKeyBlocks;
+    this->keyBlockMerger = std::make_unique<KeyBlockMerger>(std::move(factorizedTables),
+        strKeyColsInfo, numBytesPerTuple);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by.cpp
new file mode 100644
index 0000000000..5a97ec526c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by.cpp
@@ -0,0 +1,46 @@
+#include "processor/operator/order_by/order_by.h"
+
+#include "binder/expression/expression_util.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string OrderByPrintInfo::toString() const {
+    std::string result = "Order By: ";
+    result += binder::ExpressionUtil::toString(keys);
+    result += ", Expressions: ";
+    result += binder::ExpressionUtil::toString(payloads);
+    return result;
+}
+
+void OrderBy::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    localState = SortLocalState();
+    localState.init(info, *sharedState, storage::MemoryManager::Get(*context->clientContext));
+    for (auto& dataPos : info.payloadsPos) {
+        payloadVectors.push_back(resultSet->getValueVector(dataPos).get());
+    }
+    for (auto& dataPos : info.keysPos) {
+        orderByVectors.push_back(resultSet->getValueVector(dataPos).get());
+    }
+}
+
+void OrderBy::initGlobalStateInternal(ExecutionContext* /*context*/) {
+    sharedState->init(info);
+}
+
+void OrderBy::executeInternal(ExecutionContext* context) {
+    // Append thread-local tuples.
+    while (children[0]->getNextTuple(context)) {
+        for (auto i = 0u; i < resultSet->multiplicity; i++) {
+            localState.append(orderByVectors, payloadVectors);
+        }
+    }
+    localState.finalize(*sharedState);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by_key_encoder.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by_key_encoder.cpp
new file mode 100644
index 0000000000..572a234d6d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by_key_encoder.cpp
@@ -0,0 +1,413 @@
+#include "processor/operator/order_by/order_by_key_encoder.h"
+
+#include <cstdint>
+#include <cstring>
+
+#include "common/exception/runtime.h"
+#include "common/string_format.h"
+#include "common/utils.h"
+#include "storage/storage_utils.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+static constexpr uint64_t DATA_BLOCK_SIZE = common::TEMP_PAGE_SIZE;
+
+OrderByKeyEncoder::OrderByKeyEncoder(const OrderByDataInfo& orderByDataInfo,
+    MemoryManager* memoryManager, uint8_t ftIdx, uint32_t numTuplesPerBlockInFT,
+    uint32_t numBytesPerTuple)
+    : memoryManager{memoryManager}, isAscOrder{orderByDataInfo.isAscOrder},
+      numBytesPerTuple{numBytesPerTuple}, ftIdx{ftIdx},
+      numTuplesPerBlockInFT{numTuplesPerBlockInFT}, swapBytes{isLittleEndian()} {
+    if (numTuplesPerBlockInFT > MAX_FT_BLOCK_OFFSET) {
+        throw RuntimeException(
+            "The number of tuples per block of factorizedTable exceeds the maximum blockOffset!");
+    }
+    keyBlocks.emplace_back(std::make_unique<DataBlock>(memoryManager, DATA_BLOCK_SIZE));
+    KU_ASSERT(this->numBytesPerTuple == getNumBytesPerTuple());
+    maxNumTuplesPerBlock = DATA_BLOCK_SIZE / numBytesPerTuple;
+    if (maxNumTuplesPerBlock <= 0) {
+        throw RuntimeException(
+            stringFormat("TupleSize({} bytes) is larger than the LARGE_PAGE_SIZE({} bytes)",
+                numBytesPerTuple, DATA_BLOCK_SIZE));
+    }
+    encodeFunctions.reserve(orderByDataInfo.keysPos.size());
+    for (auto& type : orderByDataInfo.keyTypes) {
+        encode_function_t encodeFunction;
+        getEncodingFunction(type.getPhysicalType(), encodeFunction);
+        encodeFunctions.push_back(std::move(encodeFunction));
+    }
+}
+
+void OrderByKeyEncoder::encodeKeys(const std::vector<common::ValueVector*>& orderByKeys) {
+    uint32_t numEntries = orderByKeys[0]->state->getSelVector().getSelSize();
+    uint32_t encodedTuples = 0;
+    while (numEntries > 0) {
+        allocateMemoryIfFull();
+        uint32_t numEntriesToEncode =
+            std::min(numEntries, maxNumTuplesPerBlock - getNumTuplesInCurBlock());
+        auto tuplePtr =
+            keyBlocks.back()->getData() + keyBlocks.back()->numTuples * numBytesPerTuple;
+        uint32_t tuplePtrOffset = 0;
+        for (auto keyColIdx = 0u; keyColIdx < orderByKeys.size(); keyColIdx++) {
+            encodeVector(orderByKeys[keyColIdx], tuplePtr + tuplePtrOffset, encodedTuples,
+                numEntriesToEncode, keyColIdx);
+            tuplePtrOffset += getEncodingSize(orderByKeys[keyColIdx]->dataType);
+        }
+        encodeFTIdx(numEntriesToEncode, tuplePtr + tuplePtrOffset);
+        encodedTuples += numEntriesToEncode;
+        keyBlocks.back()->numTuples += numEntriesToEncode;
+        numEntries -= numEntriesToEncode;
+    }
+}
+
+uint32_t OrderByKeyEncoder::getNumBytesPerTuple(const std::vector<ValueVector*>& keyVectors) {
+    uint32_t result = 0u;
+    for (auto& vector : keyVectors) {
+        result += getEncodingSize(vector->dataType);
+    }
+    result += 8;
+    return result;
+}
+
+uint32_t OrderByKeyEncoder::getEncodingSize(const LogicalType& dataType) {
+    // Add one more byte for null flag.
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::STRING:
+        // 1 byte for null flag + 1 byte to indicate long/short string + 12 bytes for string prefix
+        return 2 + ku_string_t::SHORT_STR_LENGTH;
+    default:
+        return 1 + storage::StorageUtils::getDataTypeSize(dataType);
+    }
+}
+
+void OrderByKeyEncoder::flipBytesIfNecessary(uint32_t keyColIdx, uint8_t* tuplePtr,
+    uint32_t numEntriesToEncode, LogicalType& type) {
+    if (!isAscOrder[keyColIdx]) {
+        auto encodingSize = getEncodingSize(type);
+        // If the current column is in desc order, flip all bytes.
+        for (auto i = 0u; i < numEntriesToEncode; i++) {
+            for (auto byte = 0u; byte < encodingSize; ++byte) {
+                *(tuplePtr + byte) = ~*(tuplePtr + byte);
+            }
+            tuplePtr += numBytesPerTuple;
+        }
+    }
+}
+
+void OrderByKeyEncoder::encodeFlatVector(ValueVector* vector, uint8_t* tuplePtr,
+    uint32_t keyColIdx) {
+    auto pos = vector->state->getSelVector()[0];
+    if (vector->isNull(pos)) {
+        for (auto j = 0u; j < getEncodingSize(vector->dataType); j++) {
+            *(tuplePtr + j) = UINT8_MAX;
+        }
+    } else {
+        *tuplePtr = 0;
+        encodeFunctions[keyColIdx](vector->getData() + pos * vector->getNumBytesPerValue(),
+            tuplePtr + 1, swapBytes);
+    }
+}
+
+void OrderByKeyEncoder::encodeUnflatVector(ValueVector* vector, uint8_t* tuplePtr,
+    uint32_t encodedTuples, uint32_t numEntriesToEncode, uint32_t keyColIdx) {
+    if (vector->state->getSelVector().isUnfiltered()) {
+        auto value = vector->getData() + encodedTuples * vector->getNumBytesPerValue();
+        if (vector->hasNoNullsGuarantee()) {
+            for (auto i = 0u; i < numEntriesToEncode; i++) {
+                *tuplePtr = 0;
+                encodeFunctions[keyColIdx](value, tuplePtr + 1, swapBytes);
+                tuplePtr += numBytesPerTuple;
+                value += vector->getNumBytesPerValue();
+            }
+        } else {
+            for (auto i = 0u; i < numEntriesToEncode; i++) {
+                if (vector->isNull(encodedTuples + i)) {
+                    for (auto j = 0u; j < getEncodingSize(vector->dataType); j++) {
+                        *(tuplePtr + j) = UINT8_MAX;
+                    }
+                } else {
+                    *tuplePtr = 0;
+                    encodeFunctions[keyColIdx](value, tuplePtr + 1, swapBytes);
+                }
+                tuplePtr += numBytesPerTuple;
+                value += vector->getNumBytesPerValue();
+            }
+        }
+    } else {
+        if (vector->hasNoNullsGuarantee()) {
+            for (auto i = 0u; i < numEntriesToEncode; i++) {
+                *tuplePtr = 0;
+                encodeFunctions[keyColIdx](vector->getData() +
+                                               vector->state->getSelVector()[i + encodedTuples] *
+                                                   vector->getNumBytesPerValue(),
+                    tuplePtr + 1, swapBytes);
+                tuplePtr += numBytesPerTuple;
+            }
+        } else {
+            for (auto i = 0u; i < numEntriesToEncode; i++) {
+                auto pos = vector->state->getSelVector()[i + encodedTuples];
+                if (vector->isNull(pos)) {
+                    for (auto j = 0u; j < getEncodingSize(vector->dataType); j++) {
+                        *(tuplePtr + j) = UINT8_MAX;
+                    }
+                } else {
+                    *tuplePtr = 0;
+                    encodeFunctions[keyColIdx](vector->getData() +
+                                                   pos * vector->getNumBytesPerValue(),
+                        tuplePtr + 1, swapBytes);
+                }
+                tuplePtr += numBytesPerTuple;
+            }
+        }
+    }
+}
+
+void OrderByKeyEncoder::encodeVector(ValueVector* vector, uint8_t* tuplePtr, uint32_t encodedTuples,
+    uint32_t numEntriesToEncode, uint32_t keyColIdx) {
+    if (vector->state->isFlat()) {
+        encodeFlatVector(vector, tuplePtr, keyColIdx);
+    } else {
+        encodeUnflatVector(vector, tuplePtr, encodedTuples, numEntriesToEncode, keyColIdx);
+    }
+    flipBytesIfNecessary(keyColIdx, tuplePtr, numEntriesToEncode, vector->dataType);
+}
+
+void OrderByKeyEncoder::encodeFTIdx(uint32_t numEntriesToEncode, uint8_t* tupleInfoPtr) {
+    uint32_t numUpdatedFTInfoEntries = 0;
+    while (numUpdatedFTInfoEntries < numEntriesToEncode) {
+        auto nextBatchOfEntries = std::min(numEntriesToEncode - numUpdatedFTInfoEntries,
+            numTuplesPerBlockInFT - ftBlockOffset);
+        for (auto i = 0u; i < nextBatchOfEntries; i++) {
+            *(uint32_t*)tupleInfoPtr = ftBlockIdx;
+            *(uint32_t*)(tupleInfoPtr + 4) = ftBlockOffset;
+            *(uint8_t*)(tupleInfoPtr + 7) = ftIdx;
+            tupleInfoPtr += numBytesPerTuple;
+            ftBlockOffset++;
+        }
+        numUpdatedFTInfoEntries += nextBatchOfEntries;
+        if (ftBlockOffset == numTuplesPerBlockInFT) {
+            ftBlockIdx++;
+            ftBlockOffset = 0;
+        }
+    }
+}
+
+void OrderByKeyEncoder::allocateMemoryIfFull() {
+    if (getNumTuplesInCurBlock() == maxNumTuplesPerBlock) {
+        keyBlocks.emplace_back(std::make_shared<DataBlock>(memoryManager, DATA_BLOCK_SIZE));
+    }
+}
+
+void OrderByKeyEncoder::getEncodingFunction(PhysicalTypeID physicalType, encode_function_t& func) {
+    switch (physicalType) {
+    case PhysicalTypeID::BOOL: {
+        func = encodeTemplate<bool>;
+        return;
+    }
+    case PhysicalTypeID::INT64: {
+        func = encodeTemplate<int64_t>;
+        return;
+    }
+    case PhysicalTypeID::INT32: {
+        func = encodeTemplate<int32_t>;
+        return;
+    }
+    case PhysicalTypeID::INT16: {
+        func = encodeTemplate<int16_t>;
+        return;
+    }
+    case PhysicalTypeID::INT8: {
+        func = encodeTemplate<int8_t>;
+        return;
+    }
+    case PhysicalTypeID::UINT64: {
+        func = encodeTemplate<uint64_t>;
+        return;
+    }
+    case PhysicalTypeID::UINT32: {
+        func = encodeTemplate<uint32_t>;
+        return;
+    }
+    case PhysicalTypeID::UINT16: {
+        func = encodeTemplate<uint16_t>;
+        return;
+    }
+    case PhysicalTypeID::UINT8: {
+        func = encodeTemplate<uint8_t>;
+        return;
+    }
+    case PhysicalTypeID::INT128: {
+        func = encodeTemplate<int128_t>;
+        return;
+    }
+    case PhysicalTypeID::DOUBLE: {
+        func = encodeTemplate<double>;
+        return;
+    }
+    case PhysicalTypeID::FLOAT: {
+        func = encodeTemplate<float>;
+        return;
+    }
+    case PhysicalTypeID::STRING: {
+        func = encodeTemplate<ku_string_t>;
+        return;
+    }
+    case PhysicalTypeID::INTERVAL: {
+        func = encodeTemplate<interval_t>;
+        return;
+    }
+    case PhysicalTypeID::UINT128: {
+        func = encodeTemplate<uint128_t>;
+        return;
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(int8_t data, uint8_t* resultPtr, bool /*swapBytes*/) {
+    memcpy(resultPtr, (void*)&data, sizeof(data));
+    resultPtr[0] = flipSign(resultPtr[0]);
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(int16_t data, uint8_t* resultPtr, bool swapBytes) {
+    if (swapBytes) {
+        data = BSWAP16(data);
+    }
+    memcpy(resultPtr, (void*)&data, sizeof(data));
+    resultPtr[0] = flipSign(resultPtr[0]);
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(int32_t data, uint8_t* resultPtr, bool swapBytes) {
+    if (swapBytes) {
+        data = BSWAP32(data);
+    }
+    memcpy(resultPtr, (void*)&data, sizeof(data));
+    resultPtr[0] = flipSign(resultPtr[0]);
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(int64_t data, uint8_t* resultPtr, bool swapBytes) {
+    if (swapBytes) {
+        data = BSWAP64(data);
+    }
+    memcpy(resultPtr, (void*)&data, sizeof(data));
+    resultPtr[0] = flipSign(resultPtr[0]);
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(uint8_t data, uint8_t* resultPtr, bool /*swapBytes*/) {
+    memcpy(resultPtr, (void*)&data, sizeof(data));
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(uint16_t data, uint8_t* resultPtr, bool swapBytes) {
+    if (swapBytes) {
+        data = BSWAP16(data);
+    }
+    memcpy(resultPtr, (void*)&data, sizeof(data));
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(uint32_t data, uint8_t* resultPtr, bool swapBytes) {
+    if (swapBytes) {
+        data = BSWAP32(data);
+    }
+    memcpy(resultPtr, (void*)&data, sizeof(data));
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(uint64_t data, uint8_t* resultPtr, bool swapBytes) {
+    if (swapBytes) {
+        data = BSWAP64(data);
+    }
+    memcpy(resultPtr, (void*)&data, sizeof(data));
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(common::int128_t data, uint8_t* resultPtr, bool swapBytes) {
+    encodeData<int64_t>(data.high, resultPtr, swapBytes);
+    encodeData<uint64_t>(data.low, resultPtr + sizeof(data.high), swapBytes);
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(common::uint128_t data, uint8_t* resultPtr, bool swapBytes) {
+    encodeData<uint64_t>(data.high, resultPtr, swapBytes);
+    encodeData<uint64_t>(data.low, resultPtr + sizeof(data.high), swapBytes);
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(bool data, uint8_t* resultPtr, bool /*swapBytes*/) {
+    uint8_t val = data ? 1 : 0;
+    memcpy(resultPtr, (void*)&val, sizeof(data));
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(double data, uint8_t* resultPtr, bool swapBytes) {
+    memcpy(resultPtr, &data, sizeof(data));
+    uint64_t* dataBytes = (uint64_t*)resultPtr;
+    if (swapBytes) {
+        *dataBytes = BSWAP64(*dataBytes);
+    }
+    if (data < (double)0) {
+        *dataBytes = ~*dataBytes;
+    } else {
+        resultPtr[0] = flipSign(resultPtr[0]);
+    }
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(date_t data, uint8_t* resultPtr, bool swapBytes) {
+    encodeData(data.days, resultPtr, swapBytes);
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(timestamp_t data, uint8_t* resultPtr, bool swapBytes) {
+    encodeData(data.value, resultPtr, swapBytes);
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(interval_t data, uint8_t* resultPtr, bool swapBytes) {
+    int64_t months = 0, days = 0, micros = 0;
+    Interval::normalizeIntervalEntries(data, months, days, micros);
+    encodeData((int32_t)months, resultPtr, swapBytes);
+    resultPtr += sizeof(data.months);
+    encodeData((int32_t)days, resultPtr, swapBytes);
+    resultPtr += sizeof(data.days);
+    encodeData(micros, resultPtr, swapBytes);
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(ku_string_t data, uint8_t* resultPtr, bool /*swapBytes*/) {
+    // Only encode the prefix of ku_string.
+    memcpy(resultPtr, (void*)data.getAsString().c_str(),
+        std::min((uint32_t)ku_string_t::SHORT_STR_LENGTH, data.len));
+    if (ku_string_t::isShortString(data.len)) {
+        memset(resultPtr + data.len, '\0', ku_string_t::SHORT_STR_LENGTH + 1 - data.len);
+    } else {
+        resultPtr[12] = UINT8_MAX;
+    }
+}
+
+template<>
+void OrderByKeyEncoder::encodeData(float data, uint8_t* resultPtr, bool swapBytes) {
+    memcpy(resultPtr, &data, sizeof(data));
+    uint32_t* dataBytes = (uint32_t*)resultPtr;
+    if (swapBytes) {
+        *dataBytes = BSWAP32(*dataBytes);
+    }
+    if (data < (float)0) {
+        *dataBytes = ~*dataBytes;
+    } else {
+        resultPtr[0] = flipSign(resultPtr[0]);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by_merge.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by_merge.cpp
new file mode 100644
index 0000000000..592dba8e2c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by_merge.cpp
@@ -0,0 +1,42 @@
+#include "processor/operator/order_by/order_by_merge.h"
+
+#include <thread>
+
+#include "common/constants.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void OrderByMerge::initLocalStateInternal(ResultSet* /*resultSet*/, ExecutionContext* /*context*/) {
+    // OrderByMerge is the only sink operator in a pipeline and only modifies the
+    // sharedState by merging sortedKeyBlocks, So we don't need to initialize the resultSet.
+    localMerger = make_unique<KeyBlockMerger>(sharedState->getPayloadTables(),
+        sharedState->getStrKeyColInfo(), sharedState->getNumBytesPerTuple());
+}
+
+void OrderByMerge::executeInternal(ExecutionContext* /*context*/) {
+    while (!sharedDispatcher->isDoneMerge()) {
+        auto keyBlockMergeMorsel = sharedDispatcher->getMorsel();
+        if (keyBlockMergeMorsel == nullptr) {
+            std::this_thread::sleep_for(
+                std::chrono::microseconds(THREAD_SLEEP_TIME_WHEN_WAITING_IN_MICROS));
+            continue;
+        }
+        localMerger->mergeKeyBlocks(*keyBlockMergeMorsel);
+        sharedDispatcher->doneMorsel(std::move(keyBlockMergeMorsel));
+    }
+}
+
+void OrderByMerge::initGlobalStateInternal(ExecutionContext* context) {
+    // TODO(Ziyi): directly feed sharedState to merger and dispatcher.
+    sharedDispatcher->init(storage::MemoryManager::Get(*context->clientContext),
+        sharedState->getSortedKeyBlocks(), sharedState->getPayloadTables(),
+        sharedState->getStrKeyColInfo(), sharedState->getNumBytesPerTuple());
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by_scan.cpp
new file mode 100644
index 0000000000..9f0cff3b97
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/order_by_scan.cpp
@@ -0,0 +1,45 @@
+#include "processor/operator/order_by/order_by_scan.h"
+
+#include "common/metric.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void OrderByScanLocalState::init(std::vector<DataPos>& outVectorPos, SortSharedState& sharedState,
+    ResultSet& resultSet) {
+    for (auto& dataPos : outVectorPos) {
+        vectorsToRead.push_back(resultSet.getValueVector(dataPos).get());
+    }
+    payloadScanner = std::make_unique<PayloadScanner>(sharedState.getMergedKeyBlock(),
+        sharedState.getPayloadTables());
+    numTuples = 0;
+    for (auto& table : sharedState.getPayloadTables()) {
+        numTuples += table->getNumTuples();
+    }
+    numTuplesRead = 0;
+}
+
+void OrderByScan::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* /*context*/) {
+    localState->init(outVectorPos, *sharedState, *resultSet);
+}
+
+bool OrderByScan::getNextTuplesInternal(ExecutionContext* /*context*/) {
+    // If there is no more tuples to read, just return false.
+    auto numTuplesRead = localState->scan();
+    metrics->numOutputTuple.increase(numTuplesRead);
+    return numTuplesRead != 0;
+}
+
+double OrderByScan::getProgress(ExecutionContext* /*context*/) const {
+    if (localState->numTuples == 0) {
+        return 0.0;
+    } else if (localState->numTuplesRead == localState->numTuples) {
+        return 1.0;
+    }
+    return static_cast<double>(localState->numTuplesRead) / localState->numTuples;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/radix_sort.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/radix_sort.cpp
new file mode 100644
index 0000000000..d05d6e8cb3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/radix_sort.cpp
@@ -0,0 +1,283 @@
+#include "processor/operator/order_by/radix_sort.h"
+
+#include <algorithm>
+
+#include "common/system_config.h"
+#include "function/comparison/comparison_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+static constexpr uint16_t COUNTING_ARRAY_SIZE = 256;
+static constexpr uint64_t DATA_BLOCK_SIZE = common::TEMP_PAGE_SIZE;
+
+RadixSort::RadixSort(storage::MemoryManager* memoryManager, FactorizedTable& factorizedTable,
+    OrderByKeyEncoder& orderByKeyEncoder, std::vector<StrKeyColInfo> strKeyColsInfo)
+    : tmpSortingResultBlock{std::make_unique<DataBlock>(memoryManager, DATA_BLOCK_SIZE)},
+      tmpTuplePtrSortingBlock{std::make_unique<DataBlock>(memoryManager, DATA_BLOCK_SIZE)},
+      factorizedTable{factorizedTable}, strKeyColsInfo{std::move(strKeyColsInfo)},
+      numBytesPerTuple{orderByKeyEncoder.getNumBytesPerTuple()},
+      numBytesToRadixSort{numBytesPerTuple - 8} {}
+
+void RadixSort::sortSingleKeyBlock(const DataBlock& keyBlock) {
+    auto numBytesSorted = 0ul;
+    auto numTuplesInKeyBlock = keyBlock.numTuples;
+    std::queue<TieRange> ties;
+    // We need to sort the whole keyBlock for the first radix sort, so just mark all tuples as a
+    // tie.
+    ties.push(TieRange{0, numTuplesInKeyBlock - 1});
+    for (auto i = 0u; i < strKeyColsInfo.size(); i++) {
+        const auto numBytesToSort = strKeyColsInfo[i].colOffsetInEncodedKeyBlock - numBytesSorted +
+                                    strKeyColsInfo[i].getEncodingSize();
+        const auto numOfTies = ties.size();
+        for (auto j = 0u; j < numOfTies; j++) {
+            auto keyBlockTie = ties.front();
+            ties.pop();
+            radixSort(keyBlock.getData() + keyBlockTie.startingTupleIdx * numBytesPerTuple,
+                keyBlockTie.getNumTuples(), numBytesSorted, numBytesToSort);
+
+            auto newTiesInKeyBlock =
+                findTies(keyBlock.getData() + keyBlockTie.startingTupleIdx * numBytesPerTuple +
+                             numBytesSorted,
+                    keyBlockTie.getNumTuples(), numBytesToSort, keyBlockTie.startingTupleIdx);
+            for (auto& newTieInKeyBlock : newTiesInKeyBlock) {
+                solveStringTies(newTieInKeyBlock,
+                    keyBlock.getData() + newTieInKeyBlock.startingTupleIdx * numBytesPerTuple, ties,
+                    strKeyColsInfo[i]);
+            }
+        }
+        if (ties.empty()) {
+            return;
+        }
+        numBytesSorted += numBytesToSort;
+    }
+
+    if (numBytesSorted < numBytesPerTuple) {
+        while (!ties.empty()) {
+            auto tie = ties.front();
+            ties.pop();
+            radixSort(keyBlock.getData() + tie.startingTupleIdx * numBytesPerTuple,
+                tie.getNumTuples(), numBytesSorted, numBytesToRadixSort - numBytesSorted);
+        }
+    }
+}
+
+void RadixSort::radixSort(uint8_t* keyBlockPtr, uint32_t numTuplesToSort, uint32_t numBytesSorted,
+    uint32_t numBytesToSort) {
+    // We use radixSortLSD which sorts from the least significant byte to the most significant byte.
+    auto tmpKeyBlockPtr = tmpSortingResultBlock->getData();
+    keyBlockPtr += numBytesSorted;
+    tmpKeyBlockPtr += numBytesSorted;
+    uint32_t count[COUNTING_ARRAY_SIZE];
+    auto isInTmpBlock = false;
+    for (auto curByteIdx = 1ul; curByteIdx <= numBytesToSort; curByteIdx++) {
+        memset(count, 0, COUNTING_ARRAY_SIZE * sizeof(uint32_t));
+        auto sourcePtr = isInTmpBlock ? tmpKeyBlockPtr : keyBlockPtr;
+        auto targetPtr = isInTmpBlock ? keyBlockPtr : tmpKeyBlockPtr;
+        auto curByteOffset = numBytesToSort - curByteIdx;
+        auto sortBytePtr = sourcePtr + curByteOffset;
+        // counting sort
+        for (auto j = 0ul; j < numTuplesToSort; j++) {
+            count[*sortBytePtr]++;
+            sortBytePtr += numBytesPerTuple;
+        }
+        auto maxCounter = count[0];
+        for (auto val = 1ul; val < COUNTING_ARRAY_SIZE; val++) {
+            maxCounter = std::max(count[val], maxCounter);
+            count[val] = count[val] + count[val - 1];
+        }
+        // If all bytes have the same value (tie), continue on the next byte.
+        if (maxCounter == numTuplesToSort) {
+            continue;
+        }
+        // Reorder the data based on the count array.
+        auto sourceTuplePtr = sourcePtr + (numTuplesToSort - 1) * numBytesPerTuple;
+        for (auto j = 0ul; j < numTuplesToSort; j++) {
+            auto targetTupleNum = --count[*(sourceTuplePtr + curByteOffset)];
+            memcpy(targetPtr + targetTupleNum * numBytesPerTuple - numBytesSorted,
+                sourceTuplePtr - numBytesSorted, numBytesPerTuple);
+            sourceTuplePtr -= numBytesPerTuple;
+        }
+        isInTmpBlock = !isInTmpBlock;
+    }
+    // If the data is in the tmp block, copy the data from tmp block back.
+    if (isInTmpBlock) {
+        memcpy(keyBlockPtr - numBytesSorted, tmpKeyBlockPtr - numBytesSorted,
+            numTuplesToSort * numBytesPerTuple);
+    }
+}
+
+std::vector<TieRange> RadixSort::findTies(uint8_t* keyBlockPtr, uint32_t numTuplesToFindTies,
+    uint32_t numBytesToSort, uint32_t baseTupleIdx) const {
+    std::vector<TieRange> newTiesInKeyBlock;
+    auto iTuplePtr = keyBlockPtr;
+    for (auto i = 0u; i < numTuplesToFindTies - 1; i++) {
+        auto j = i + 1;
+        auto jTuplePtr = iTuplePtr + numBytesPerTuple;
+        for (; j < numTuplesToFindTies; j++) {
+            if (memcmp(iTuplePtr, jTuplePtr, numBytesToSort) != 0) {
+                break;
+            }
+            jTuplePtr += numBytesPerTuple;
+        }
+        j--;
+        if (i != j) {
+            newTiesInKeyBlock.emplace_back(TieRange(i + baseTupleIdx, j + baseTupleIdx));
+        }
+        iTuplePtr = jTuplePtr;
+        i = j;
+    }
+    return newTiesInKeyBlock;
+}
+
+void RadixSort::fillTmpTuplePtrSortingBlock(TieRange& keyBlockTie, uint8_t* keyBlockPtr) {
+    auto tmpTuplePtrSortingBlockPtr = (uint8_t**)tmpTuplePtrSortingBlock->getData();
+    for (auto i = 0ul; i < keyBlockTie.getNumTuples(); i++) {
+        tmpTuplePtrSortingBlockPtr[i] = keyBlockPtr;
+        keyBlockPtr += numBytesPerTuple;
+    }
+}
+
+void RadixSort::reOrderKeyBlock(TieRange& keyBlockTie, uint8_t* keyBlockPtr) {
+    auto tmpTuplePtrSortingBlockPtr = (uint8_t**)tmpTuplePtrSortingBlock->getData();
+    auto tmpKeyBlockPtr = tmpSortingResultBlock->getData();
+    for (auto i = 0ul; i < keyBlockTie.getNumTuples(); i++) {
+        memcpy(tmpKeyBlockPtr, tmpTuplePtrSortingBlockPtr[i], numBytesPerTuple);
+        tmpKeyBlockPtr += numBytesPerTuple;
+    }
+    memcpy(keyBlockPtr, tmpSortingResultBlock->getData(),
+        keyBlockTie.getNumTuples() * numBytesPerTuple);
+}
+
+template<typename TYPE>
+void RadixSort::findStringTies(TieRange& keyBlockTie, uint8_t* keyBlockPtr,
+    std::queue<TieRange>& ties, StrKeyColInfo& keyColInfo) {
+    auto iTuplePtr = keyBlockPtr;
+    for (auto i = keyBlockTie.startingTupleIdx; i < keyBlockTie.endingTupleIdx; i++) {
+        bool isIValNull = OrderByKeyEncoder::isNullVal(
+            iTuplePtr + keyColInfo.colOffsetInEncodedKeyBlock, keyColInfo.isAscOrder);
+        // This variable will only be used when the current column is a string column. Otherwise,
+        // we just set this variable to false.
+        bool isIStringLong = OrderByKeyEncoder::isLongStr(
+            iTuplePtr + keyColInfo.colOffsetInEncodedKeyBlock, keyColInfo.isAscOrder);
+        TYPE iValue =
+            isIValNull ?
+                TYPE() :
+                factorizedTable.getData<TYPE>(
+                    OrderByKeyEncoder::getEncodedFTBlockIdx(iTuplePtr + numBytesToRadixSort),
+                    OrderByKeyEncoder::getEncodedFTBlockOffset(iTuplePtr + numBytesToRadixSort),
+                    keyColInfo.colOffsetInFT);
+        auto j = i + 1;
+        auto jTuplePtr = iTuplePtr + numBytesPerTuple;
+        for (; j <= keyBlockTie.endingTupleIdx; j++) {
+            auto jTupleInfoPtr = jTuplePtr + numBytesToRadixSort;
+            bool isJValNull = OrderByKeyEncoder::isNullVal(
+                jTuplePtr + keyColInfo.colOffsetInEncodedKeyBlock, keyColInfo.isAscOrder);
+            if (isIValNull && isJValNull) {
+                // If the left value and the right value are nulls, we can just continue on
+                // the next tuple.
+                jTupleInfoPtr += numBytesPerTuple;
+                continue;
+            } else if (isIValNull || isJValNull) {
+                // If only one value is null, we can just conclude that those two values are
+                // not equal.
+                break;
+            }
+            if constexpr (std::is_same<TYPE, ku_string_t>::value) {
+                // We do an optimization here to minimize the number of times that we fetch
+                // tuples from factorizedTable. If both left and right string are short, they
+                // must equal to each other (since they have the same prefix). If one string is
+                // short and the other string is long, then they must not equal to each other.
+                bool isJStringLong = OrderByKeyEncoder::isLongStr(
+                    jTuplePtr + keyColInfo.colOffsetInEncodedKeyBlock, keyColInfo.isAscOrder);
+                if (!isIStringLong && !isJStringLong) {
+                    jTupleInfoPtr += numBytesPerTuple;
+                    continue;
+                } else if (isIStringLong != isJStringLong) {
+                    break;
+                }
+            }
+
+            uint8_t result = UINT8_MAX;
+            function::NotEquals::operation<TYPE, TYPE>(iValue,
+                factorizedTable.getData<TYPE>(
+                    OrderByKeyEncoder::getEncodedFTBlockIdx(jTupleInfoPtr),
+                    OrderByKeyEncoder::getEncodedFTBlockOffset(jTupleInfoPtr),
+                    keyColInfo.colOffsetInFT),
+                result, nullptr /* leftVector */, nullptr /* rightVector */);
+            if (result) {
+                break;
+            }
+            jTuplePtr += numBytesPerTuple;
+        }
+        j--;
+        if (i != j) {
+            ties.push(TieRange(i, j));
+        }
+        i = j;
+        iTuplePtr = jTuplePtr;
+    }
+}
+
+void RadixSort::solveStringTies(TieRange& keyBlockTie, uint8_t* keyBlockPtr,
+    std::queue<TieRange>& ties, StrKeyColInfo& keyColInfo) {
+    fillTmpTuplePtrSortingBlock(keyBlockTie, keyBlockPtr);
+    auto tmpTuplePtrSortingBlockPtr = (uint8_t**)tmpTuplePtrSortingBlock->getData();
+    std::sort(tmpTuplePtrSortingBlockPtr, tmpTuplePtrSortingBlockPtr + keyBlockTie.getNumTuples(),
+        [this, keyColInfo](const uint8_t* leftPtr, const uint8_t* rightPtr) -> bool {
+            auto isLeftNull = OrderByKeyEncoder::isNullVal(
+                leftPtr + keyColInfo.colOffsetInEncodedKeyBlock, keyColInfo.isAscOrder);
+            auto isRightNull = OrderByKeyEncoder::isNullVal(
+                rightPtr + keyColInfo.colOffsetInEncodedKeyBlock, keyColInfo.isAscOrder);
+            // Handle null value comparison.
+            if (isLeftNull && isRightNull) {
+                // If left and right strings are both null, we can't conclude that the left string
+                // is smaller than the right string.
+                return false;
+            } else if (isLeftNull) {
+                return !keyColInfo.isAscOrder;
+            } else if (isRightNull) {
+                return keyColInfo.isAscOrder;
+            }
+
+            // We only need to fetch the actual strings from the
+            // factorizedTable when both left and right strings are long string.
+            auto isLeftLongStr = OrderByKeyEncoder::isLongStr(
+                leftPtr + keyColInfo.colOffsetInEncodedKeyBlock, keyColInfo.isAscOrder);
+            auto isRightLongStr = OrderByKeyEncoder::isLongStr(
+                rightPtr + keyColInfo.colOffsetInEncodedKeyBlock, keyColInfo.isAscOrder);
+            if (!isLeftLongStr && !isRightLongStr) {
+                // If left and right are both short string and have the same prefix, we can't
+                // conclude that the left string is smaller than the right string.
+                return false;
+            } else if (isLeftLongStr && !isRightLongStr) {
+                // If left string is a long string and right string is a short string, we can
+                // conclude that the left string must be greater than the right string.
+                return !keyColInfo.isAscOrder;
+            } else if (isRightLongStr && !isLeftLongStr) {
+                // If right string is a long string and left string is a short string, we can
+                // conclude that the right string must be greater than the left string.
+                return keyColInfo.isAscOrder;
+            }
+            auto leftTupleInfoPtr = leftPtr + numBytesToRadixSort;
+            auto rightTupleInfoPtr = rightPtr + numBytesToRadixSort;
+            const auto leftBlockIdx = OrderByKeyEncoder::getEncodedFTBlockIdx(leftTupleInfoPtr);
+            const auto leftBlockOffset =
+                OrderByKeyEncoder::getEncodedFTBlockOffset(leftTupleInfoPtr);
+            const auto rightBlockIdx = OrderByKeyEncoder::getEncodedFTBlockIdx(rightTupleInfoPtr);
+            const auto rightBlockOffset =
+                OrderByKeyEncoder::getEncodedFTBlockOffset(rightTupleInfoPtr);
+            auto leftStr = factorizedTable.getData<ku_string_t>(leftBlockIdx, leftBlockOffset,
+                keyColInfo.colOffsetInFT);
+            auto rightStr = factorizedTable.getData<ku_string_t>(rightBlockIdx, rightBlockOffset,
+                keyColInfo.colOffsetInFT);
+            return keyColInfo.isAscOrder ? leftStr < rightStr : leftStr > rightStr;
+        });
+    reOrderKeyBlock(keyBlockTie, keyBlockPtr);
+    findStringTies<ku_string_t>(keyBlockTie, keyBlockPtr, ties, keyColInfo);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/sort_state.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/sort_state.cpp
new file mode 100644
index 0000000000..099caa754e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/sort_state.cpp
@@ -0,0 +1,198 @@
+#include "processor/operator/order_by/sort_state.h"
+
+#include <mutex>
+
+#include "common/constants.h"
+#include "common/system_config.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void SortSharedState::init(const OrderByDataInfo& orderByDataInfo) {
+    auto encodedKeyBlockColOffset = 0ul;
+    for (auto i = 0u; i < orderByDataInfo.keysPos.size(); ++i) {
+        const auto& dataType = orderByDataInfo.keyTypes[i];
+        if (PhysicalTypeID::STRING == dataType.getPhysicalType()) {
+            // If this is a string column, we need to find the factorizedTable offset for this
+            // column.
+            auto ftColIdx = orderByDataInfo.keyInPayloadPos[i];
+            strKeyColsInfo.emplace_back(orderByDataInfo.payloadTableSchema.getColOffset(ftColIdx),
+                encodedKeyBlockColOffset, orderByDataInfo.isAscOrder[i]);
+        }
+        encodedKeyBlockColOffset += OrderByKeyEncoder::getEncodingSize(dataType);
+    }
+    numBytesPerTuple = encodedKeyBlockColOffset + OrderByConstants::NUM_BYTES_FOR_PAYLOAD_IDX;
+}
+
+std::pair<uint64_t, FactorizedTable*> SortSharedState::getLocalPayloadTable(
+    storage::MemoryManager& memoryManager, const FactorizedTableSchema& payloadTableSchema) {
+    std::unique_lock lck{mtx};
+    auto payloadTable =
+        std::make_unique<FactorizedTable>(&memoryManager, payloadTableSchema.copy());
+    auto result = std::make_pair(nextTableIdx++, payloadTable.get());
+    payloadTables.push_back(std::move(payloadTable));
+    return result;
+}
+
+void SortSharedState::appendLocalSortedKeyBlock(
+    const std::shared_ptr<MergedKeyBlocks>& mergedDataBlocks) {
+    std::unique_lock lck{mtx};
+    sortedKeyBlocks->emplace(mergedDataBlocks);
+}
+
+void SortSharedState::combineFTHasNoNullGuarantee() {
+    for (auto i = 1u; i < payloadTables.size(); i++) {
+        payloadTables[0]->mergeMayContainNulls(*payloadTables[i]);
+    }
+}
+
+std::vector<FactorizedTable*> SortSharedState::getPayloadTables() const {
+    std::vector<FactorizedTable*> payloadTablesToReturn;
+    payloadTablesToReturn.reserve(payloadTables.size());
+    for (auto& payloadTable : payloadTables) {
+        payloadTablesToReturn.push_back(payloadTable.get());
+    }
+    return payloadTablesToReturn;
+}
+
+void SortLocalState::init(const OrderByDataInfo& orderByDataInfo, SortSharedState& sharedState,
+    storage::MemoryManager* memoryManager) {
+    auto [idx, table] =
+        sharedState.getLocalPayloadTable(*memoryManager, orderByDataInfo.payloadTableSchema);
+    globalIdx = idx;
+    payloadTable = table;
+    orderByKeyEncoder = std::make_unique<OrderByKeyEncoder>(orderByDataInfo, memoryManager,
+        globalIdx, payloadTable->getNumTuplesPerBlock(), sharedState.getNumBytesPerTuple());
+    radixSorter = std::make_unique<RadixSort>(memoryManager, *payloadTable, *orderByKeyEncoder,
+        sharedState.getStrKeyColInfo());
+}
+
+void SortLocalState::append(const std::vector<common::ValueVector*>& keyVectors,
+    const std::vector<common::ValueVector*>& payloadVectors) {
+    orderByKeyEncoder->encodeKeys(keyVectors);
+    payloadTable->append(payloadVectors);
+}
+
+void SortLocalState::finalize(lbug::processor::SortSharedState& sharedState) {
+    for (auto& keyBlock : orderByKeyEncoder->getKeyBlocks()) {
+        if (keyBlock->numTuples > 0) {
+            radixSorter->sortSingleKeyBlock(*keyBlock);
+            sharedState.appendLocalSortedKeyBlock(
+                make_shared<MergedKeyBlocks>(orderByKeyEncoder->getNumBytesPerTuple(), keyBlock));
+        }
+    }
+    orderByKeyEncoder->clear();
+}
+
+PayloadScanner::PayloadScanner(MergedKeyBlocks* keyBlockToScan,
+    std::vector<FactorizedTable*> payloadTables, uint64_t skipNumber, uint64_t limitNumber)
+    : keyBlockToScan{keyBlockToScan}, payloadTables{std::move(payloadTables)},
+      limitNumber{limitNumber} {
+    if (this->keyBlockToScan == nullptr || this->keyBlockToScan->getNumTuples() == 0) {
+        nextTupleIdxToReadInMergedKeyBlock = 0;
+        endTuplesIdxToReadInMergedKeyBlock = 0;
+        return;
+    }
+    payloadIdxOffset =
+        this->keyBlockToScan->getNumBytesPerTuple() - OrderByConstants::NUM_BYTES_FOR_PAYLOAD_IDX;
+    colsToScan = std::vector<uint32_t>(this->payloadTables[0]->getTableSchema()->getNumColumns());
+    iota(colsToScan.begin(), colsToScan.end(), 0);
+    hasUnflatColInPayload = this->payloadTables[0]->hasUnflatCol();
+    if (!hasUnflatColInPayload) {
+        tuplesToRead = std::make_unique<uint8_t*[]>(DEFAULT_VECTOR_CAPACITY);
+    }
+    nextTupleIdxToReadInMergedKeyBlock = skipNumber == UINT64_MAX ? 0 : skipNumber;
+    endTuplesIdxToReadInMergedKeyBlock =
+        limitNumber == UINT64_MAX ? this->keyBlockToScan->getNumTuples() :
+                                    std::min(nextTupleIdxToReadInMergedKeyBlock + limitNumber,
+                                        this->keyBlockToScan->getNumTuples());
+    blockPtrInfo = std::make_unique<BlockPtrInfo>(nextTupleIdxToReadInMergedKeyBlock,
+        endTuplesIdxToReadInMergedKeyBlock, this->keyBlockToScan);
+}
+
+uint64_t PayloadScanner::scan(std::vector<common::ValueVector*> vectorsToRead) {
+    if (limitNumber <= 0 ||
+        nextTupleIdxToReadInMergedKeyBlock >= endTuplesIdxToReadInMergedKeyBlock) {
+        return 0;
+    }
+    if (scanSingleTuple(vectorsToRead)) {
+        auto payloadInfo = blockPtrInfo->curTuplePtr + payloadIdxOffset;
+        auto blockIdx = OrderByKeyEncoder::getEncodedFTBlockIdx(payloadInfo);
+        auto blockOffset = OrderByKeyEncoder::getEncodedFTBlockOffset(payloadInfo);
+        auto payloadTable = payloadTables[OrderByKeyEncoder::getEncodedFTIdx(payloadInfo)];
+        payloadTable->scan(vectorsToRead,
+            blockIdx * payloadTable->getNumTuplesPerBlock() + blockOffset, 1 /* numTuples */);
+        blockPtrInfo->curTuplePtr += keyBlockToScan->getNumBytesPerTuple();
+        blockPtrInfo->updateTuplePtrIfNecessary();
+        nextTupleIdxToReadInMergedKeyBlock++;
+        applyLimitOnResultVectors(vectorsToRead);
+        return 1;
+    } else {
+        auto numTuplesToRead = std::min(DEFAULT_VECTOR_CAPACITY,
+            endTuplesIdxToReadInMergedKeyBlock - nextTupleIdxToReadInMergedKeyBlock);
+        auto numTuplesRead = 0u;
+        while (numTuplesRead < numTuplesToRead) {
+            auto numTuplesToReadInCurBlock = std::min(numTuplesToRead - numTuplesRead,
+                blockPtrInfo->getNumTuplesLeftInCurBlock());
+            for (auto i = 0u; i < numTuplesToReadInCurBlock; i++) {
+                auto payloadInfo = blockPtrInfo->curTuplePtr + payloadIdxOffset;
+                auto blockIdx = OrderByKeyEncoder::getEncodedFTBlockIdx(payloadInfo);
+                auto blockOffset = OrderByKeyEncoder::getEncodedFTBlockOffset(payloadInfo);
+                auto ft = payloadTables[OrderByKeyEncoder::getEncodedFTIdx(payloadInfo)];
+                tuplesToRead[numTuplesRead + i] =
+                    ft->getTuple(blockIdx * ft->getNumTuplesPerBlock() + blockOffset);
+                blockPtrInfo->curTuplePtr += keyBlockToScan->getNumBytesPerTuple();
+            }
+            blockPtrInfo->updateTuplePtrIfNecessary();
+            numTuplesRead += numTuplesToReadInCurBlock;
+        }
+        // TODO(Ziyi): This is a hacky way of using factorizedTable::lookup function,
+        // since the tuples in tuplesToRead may not belong to factorizedTable0. The
+        // lookup function doesn't perform a check on whether it holds all the tuples in
+        // tuplesToRead. We should optimize this lookup function in the orderByScan
+        // optimization PR.
+        payloadTables[0]->lookup(vectorsToRead, colsToScan, tuplesToRead.get(), 0, numTuplesToRead);
+        nextTupleIdxToReadInMergedKeyBlock += numTuplesToRead;
+        return numTuplesRead;
+    }
+}
+
+bool PayloadScanner::scanSingleTuple(std::vector<common::ValueVector*> vectorsToRead) const {
+    // If there is an unflat col in factorizedTable or flat vector in vectorsToRead, we can only
+    // read one tuple at a time. Otherwise, we can read min(DEFAULT_VECTOR_CAPACITY,
+    // numTuplesRemainingInMemBlock) tuples.
+    bool hasFlatVectorToRead = false;
+    for (auto& vector : vectorsToRead) {
+        if (vector->state->isFlat()) {
+            hasFlatVectorToRead = true;
+        }
+    }
+    return hasUnflatColInPayload || hasFlatVectorToRead;
+}
+
+void PayloadScanner::applyLimitOnResultVectors(std::vector<common::ValueVector*> vectorsToRead) {
+    // The query doesn't contain a limit clause.
+    if (limitNumber == UINT64_MAX) {
+        return;
+    }
+    // Otherwise, we have to figure out the number of tuples in current batch exceeds the limit
+    // number.
+    common::ValueVector* unflatVector = nullptr;
+    for (auto& vector : vectorsToRead) {
+        if (!vector->state->isFlat()) {
+            unflatVector = vector;
+        }
+    }
+    if (unflatVector != nullptr) {
+        unflatVector->state->getSelVectorUnsafe().setSelSize(
+            std::min(limitNumber, (uint64_t)unflatVector->state->getSelVector().getSelSize()));
+        limitNumber -= unflatVector->state->getSelVector().getSelSize();
+    } else {
+        limitNumber--;
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/top_k.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/top_k.cpp
new file mode 100644
index 0000000000..2f019e67b4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/top_k.cpp
@@ -0,0 +1,289 @@
+#include "processor/operator/order_by/top_k.h"
+
+#include "binder/expression/expression_util.h"
+#include "common/constants.h"
+#include "common/system_config.h"
+#include "common/type_utils.h"
+#include "function/binary_function_executor.h"
+#include "function/comparison/comparison_functions.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string TopKPrintInfo::toString() const {
+    std::string result = "Order By: ";
+    result += binder::ExpressionUtil::toString(keys);
+    result += ", Expressions: ";
+    result += binder::ExpressionUtil::toString(payloads);
+    result += ", Skip: ";
+    result += std::to_string(skipNum);
+    result += ", Limit: ";
+    result += std::to_string(limitNum);
+    return result;
+}
+
+TopKSortState::TopKSortState() : numTuples{0}, memoryManager{nullptr} {
+    orderByLocalState = std::make_unique<SortLocalState>();
+    orderBySharedState = std::make_unique<SortSharedState>();
+}
+
+void TopKSortState::init(const OrderByDataInfo& orderByDataInfo,
+    storage::MemoryManager* memoryManager_) {
+    this->memoryManager = memoryManager_;
+    orderBySharedState->init(orderByDataInfo);
+    orderByLocalState->init(orderByDataInfo, *orderBySharedState, memoryManager_);
+    numTuples = 0;
+}
+
+void TopKSortState::append(const std::vector<common::ValueVector*>& keyVectors,
+    const std::vector<common::ValueVector*>& payloadVectors) {
+    numTuples += keyVectors[0]->state->getSelVector().getSelSize();
+    orderByLocalState->append(keyVectors, payloadVectors);
+}
+
+void TopKSortState::finalize() {
+    orderByLocalState->finalize(*orderBySharedState);
+    auto merger = std::make_unique<KeyBlockMerger>(orderBySharedState->getPayloadTables(),
+        orderBySharedState->getStrKeyColInfo(), orderBySharedState->getNumBytesPerTuple());
+    auto dispatcher = std::make_unique<KeyBlockMergeTaskDispatcher>();
+    dispatcher->init(memoryManager, orderBySharedState->getSortedKeyBlocks(),
+        orderBySharedState->getPayloadTables(), orderBySharedState->getStrKeyColInfo(),
+        orderBySharedState->getNumBytesPerTuple());
+    while (!dispatcher->isDoneMerge()) {
+        auto keyBlockMergeMorsel = dispatcher->getMorsel();
+        merger->mergeKeyBlocks(*keyBlockMergeMorsel);
+        dispatcher->doneMorsel(std::move(keyBlockMergeMorsel));
+    }
+}
+
+void TopKBuffer::init(storage::MemoryManager* memoryManager_, uint64_t skipNumber,
+    uint64_t limitNumber) {
+    this->memoryManager = memoryManager_;
+    sortState->init(*orderByDataInfo, memoryManager_);
+    this->skip = skipNumber;
+    this->limit = limitNumber;
+    initVectors();
+    initCompareFuncs();
+}
+
+void TopKBuffer::append(const std::vector<common::ValueVector*>& keyVectors,
+    const std::vector<common::ValueVector*>& payloadVectors) {
+    auto originalSelState = keyVectors[0]->state->getSelVectorShared();
+    if (hasBoundaryValue && !compareBoundaryValue(keyVectors)) {
+        keyVectors[0]->state->setSelVector(originalSelState);
+        return;
+    }
+    sortState->append(keyVectors, payloadVectors);
+    keyVectors[0]->state->setSelVector(originalSelState);
+}
+
+void TopKBuffer::reduce() {
+    auto reduceThreshold = std::max(OrderByConfig::MIN_SIZE_TO_REDUCE,
+        OrderByConstants::MIN_LIMIT_RATIO_TO_REDUCE * (limit + skip));
+    if (sortState->getNumTuples() < reduceThreshold) {
+        return;
+    }
+    sortState->finalize();
+    auto newSortState = std::make_unique<TopKSortState>();
+    newSortState->init(*orderByDataInfo, memoryManager);
+    auto scanner = sortState->getScanner(0, skip + limit);
+    while (true) {
+        auto numTuplesScanned = scanner->scan(payloadVecsToScan);
+        if (numTuplesScanned == 0) {
+            setBoundaryValue();
+            break;
+        }
+        newSortState->append(keyVecsToScan, payloadVecsToScan);
+        std::swap(payloadVecsToScan, lastPayloadVecsToScan);
+        std::swap(keyVecsToScan, lastKeyVecsToScan);
+    }
+    sortState = std::move(newSortState);
+}
+
+void TopKBuffer::merge(TopKBuffer* other) {
+    other->finalize();
+    if (other->sortState->getSharedState()->getSortedKeyBlocks()->empty()) {
+        return;
+    }
+    auto scanner = other->sortState->getScanner(0, skip + limit);
+    while (scanner->scan(payloadVecsToScan) > 0) {
+        sortState->append(keyVecsToScan, payloadVecsToScan);
+    }
+    reduce();
+}
+
+void TopKBuffer::initVectors() {
+    auto payloadUnflatState = std::make_shared<common::DataChunkState>();
+    auto payloadFlatState = common::DataChunkState::getSingleValueDataChunkState();
+    auto lastPayloadUnflatState = std::make_shared<common::DataChunkState>();
+    auto lastPayloadFlatState = common::DataChunkState::getSingleValueDataChunkState();
+    for (auto i = 0u; i < orderByDataInfo->payloadTypes.size(); i++) {
+        auto type = &orderByDataInfo->payloadTypes[i];
+        auto payloadVec = std::make_unique<common::ValueVector>(type->copy(), memoryManager);
+        auto lastPayloadVec = std::make_unique<common::ValueVector>(type->copy(), memoryManager);
+        if (orderByDataInfo->payloadTableSchema.getColumn(i)->isFlat()) {
+            payloadVec->setState(payloadFlatState);
+            lastPayloadVec->setState(lastPayloadFlatState);
+        } else {
+            payloadVec->setState(payloadUnflatState);
+            lastPayloadVec->setState(lastPayloadUnflatState);
+        }
+        payloadVecsToScan.push_back(payloadVec.get());
+        lastPayloadVecsToScan.push_back(lastPayloadVec.get());
+        tmpVectors.push_back(std::move(payloadVec));
+        tmpVectors.push_back(std::move(lastPayloadVec));
+    }
+    auto boundaryState = common::DataChunkState::getSingleValueDataChunkState();
+    for (auto i = 0u; i < orderByDataInfo->keyTypes.size(); ++i) {
+        auto type = &orderByDataInfo->keyTypes[i];
+        auto boundaryVec = std::make_unique<common::ValueVector>(type->copy(), memoryManager);
+        boundaryVec->setState(boundaryState);
+        boundaryVecs.push_back(std::move(boundaryVec));
+        auto posInPayload = orderByDataInfo->keyInPayloadPos[i];
+        keyVecsToScan.push_back(payloadVecsToScan[posInPayload]);
+        lastKeyVecsToScan.push_back(lastPayloadVecsToScan[posInPayload]);
+    }
+}
+
+template<typename FUNC>
+void TopKBuffer::getSelectComparisonFunction(common::PhysicalTypeID typeID,
+    vector_select_comparison_func& selectFunc) {
+    common::TypeUtils::visit(
+        typeID,
+        [&selectFunc]<ComparableTypes T>(
+            T) { selectFunc = function::BinaryFunctionExecutor::selectComparison<T, T, FUNC>; },
+        [](auto) { KU_UNREACHABLE; });
+}
+
+void TopKBuffer::initCompareFuncs() {
+    compareFuncs.reserve(orderByDataInfo->isAscOrder.size());
+    equalsFuncs.reserve(orderByDataInfo->isAscOrder.size());
+    vector_select_comparison_func compareFunc;
+    vector_select_comparison_func equalsFunc;
+    for (auto i = 0u; i < orderByDataInfo->isAscOrder.size(); i++) {
+        auto physicalType = orderByDataInfo->keyTypes[i].getPhysicalType();
+        if (orderByDataInfo->isAscOrder[i]) {
+            getSelectComparisonFunction<function::LessThan>(physicalType, compareFunc);
+        } else {
+            getSelectComparisonFunction<function::GreaterThan>(physicalType, compareFunc);
+        }
+        getSelectComparisonFunction<function::Equals>(physicalType, equalsFunc);
+        compareFuncs.push_back(compareFunc);
+        equalsFuncs.push_back(equalsFunc);
+    }
+}
+
+void TopKBuffer::setBoundaryValue() {
+    for (auto i = 0u; i < boundaryVecs.size(); i++) {
+        auto boundaryVec = boundaryVecs[i].get();
+        auto dstData = boundaryVec->getData() +
+                       boundaryVec->getNumBytesPerValue() * boundaryVec->state->getSelVector()[0];
+        auto srcVector = lastKeyVecsToScan[i];
+        auto srcData =
+            srcVector->getData() +
+            srcVector->getNumBytesPerValue() *
+                srcVector->state->getSelVector()[srcVector->state->getSelVector().getSelSize() - 1];
+        boundaryVec->copyFromVectorData(dstData, srcVector, srcData);
+        hasBoundaryValue = true;
+    }
+}
+
+bool TopKBuffer::compareBoundaryValue(const std::vector<common::ValueVector*>& keyVectors) {
+    if (keyVectors[0]->state->isFlat()) {
+        return compareFlatKeys(0 /* startKeyVectorIdxToCompare */, keyVectors);
+    } else {
+        compareUnflatKeys(0 /* startKeyVectorIdxToCompare */, keyVectors);
+        return keyVectors[0]->state->getSelVector().getSelSize() > 0;
+    }
+}
+
+bool TopKBuffer::compareFlatKeys(idx_t vectorIdxToCompare, std::vector<ValueVector*> keyVectors) {
+    KU_ASSERT(!keyVectors.empty());
+    auto selVector = std::make_shared<common::SelectionVector>(common::DEFAULT_VECTOR_CAPACITY);
+    selVector->setToFiltered();
+
+    if (vectorIdxToCompare < keyVectors.size() - 1 &&
+        equalsFuncs[vectorIdxToCompare](*keyVectors[vectorIdxToCompare],
+            *boundaryVecs[vectorIdxToCompare], *selVector, nullptr /* dataPtr */)) {
+        return compareFlatKeys(vectorIdxToCompare + 1, std::move(keyVectors));
+    } else {
+        return compareFuncs[vectorIdxToCompare](*keyVectors[vectorIdxToCompare],
+            *boundaryVecs[vectorIdxToCompare], *selVector, nullptr /* dataPtr */);
+    }
+}
+
+void TopKBuffer::compareUnflatKeys(idx_t vectorIdxToCompare, std::vector<ValueVector*> keyVectors) {
+    auto compareSelVector =
+        std::make_shared<common::SelectionVector>(common::DEFAULT_VECTOR_CAPACITY);
+    compareSelVector->setToFiltered();
+    compareFuncs[vectorIdxToCompare](*keyVectors[vectorIdxToCompare],
+        *boundaryVecs[vectorIdxToCompare], *compareSelVector, nullptr /* dataPtr */);
+    if (vectorIdxToCompare != keyVectors.size() - 1) {
+        auto equalsSelVector =
+            std::make_shared<common::SelectionVector>(common::DEFAULT_VECTOR_CAPACITY);
+        equalsSelVector->setToFiltered();
+        if (equalsFuncs[vectorIdxToCompare](*keyVectors[vectorIdxToCompare],
+                *boundaryVecs[vectorIdxToCompare], *equalsSelVector, nullptr /* dataPtr */)) {
+            keyVectors[vectorIdxToCompare]->state->setSelVector(equalsSelVector);
+            compareUnflatKeys(vectorIdxToCompare + 1, keyVectors);
+            appendSelState(compareSelVector.get(), equalsSelVector.get());
+        }
+    }
+    keyVectors[vectorIdxToCompare]->state->setSelVector(std::move(compareSelVector));
+}
+
+void TopKBuffer::appendSelState(common::SelectionVector* selVector,
+    common::SelectionVector* selVectorToAppend) {
+    for (auto i = 0u; i < selVectorToAppend->getSelSize(); i++) {
+        selVector->operator[](selVector->getSelSize() + i) = selVectorToAppend->operator[](i);
+    }
+    selVector->incrementSelSize(selVectorToAppend->getSelSize());
+}
+
+void TopKLocalState::init(const OrderByDataInfo& orderByDataInfo,
+    storage::MemoryManager* memoryManager, ResultSet& /*resultSet*/, uint64_t skipNumber,
+    uint64_t limitNumber) {
+    buffer = std::make_unique<TopKBuffer>(orderByDataInfo);
+    buffer->init(memoryManager, skipNumber, limitNumber);
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void TopKLocalState::append(const std::vector<common::ValueVector*>& keyVectors,
+    const std::vector<common::ValueVector*>& payloadVectors) {
+    buffer->append(keyVectors, payloadVectors);
+    buffer->reduce();
+}
+
+void TopK::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    localState = TopKLocalState();
+    localState.init(info, storage::MemoryManager::Get(*context->clientContext), *resultSet,
+        skipNumber, limitNumber);
+    for (auto& dataPos : info.payloadsPos) {
+        payloadVectors.push_back(resultSet->getValueVector(dataPos).get());
+    }
+    for (auto& dataPos : info.keysPos) {
+        orderByVectors.push_back(resultSet->getValueVector(dataPos).get());
+    }
+}
+
+void TopK::initGlobalStateInternal(ExecutionContext* context) {
+    sharedState->init(info, storage::MemoryManager::Get(*context->clientContext), skipNumber,
+        limitNumber);
+}
+
+void TopK::executeInternal(ExecutionContext* context) {
+    while (children[0]->getNextTuple(context)) {
+        for (auto i = 0u; i < resultSet->multiplicity; i++) {
+            localState.append(orderByVectors, payloadVectors);
+        }
+    }
+    localState.finalize();
+    sharedState->mergeLocalState(&localState);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/top_k_scanner.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/top_k_scanner.cpp
new file mode 100644
index 0000000000..239578bdbe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/order_by/top_k_scanner.cpp
@@ -0,0 +1,26 @@
+#include "processor/operator/order_by/top_k_scanner.h"
+
+namespace lbug {
+namespace processor {
+
+void TopKLocalScanState::init(std::vector<DataPos>& outVectorPos, TopKSharedState& sharedState,
+    ResultSet& resultSet) {
+    for (auto& pos : outVectorPos) {
+        vectorsToScan.push_back(resultSet.getValueVector(pos).get());
+    }
+    payloadScanner = sharedState.buffer->getScanner();
+}
+
+void TopKScan::initLocalStateInternal(lbug::processor::ResultSet* resultSet,
+    lbug::processor::ExecutionContext* /*context*/) {
+    localState->init(outVectorPos, *sharedState, *resultSet);
+}
+
+bool TopKScan::getNextTuplesInternal(ExecutionContext* /*context*/) {
+    auto numTuplesRead = localState->scan();
+    metrics->numOutputTuple.increase(numTuplesRead);
+    return numTuplesRead != 0;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/partitioner.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/partitioner.cpp
new file mode 100644
index 0000000000..db60d46f16
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/partitioner.cpp
@@ -0,0 +1,186 @@
+#include "processor/operator/partitioner.h"
+
+#include "binder/expression/expression_util.h"
+#include "processor/execution_context.h"
+#include "storage/storage_manager.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::string PartitionerPrintInfo::toString() const {
+    std::string result = "Indexes: ";
+    result += binder::ExpressionUtil::toString(expressions);
+    return result;
+}
+
+void PartitionerFunctions::partitionRelData(ValueVector* key, ValueVector* partitionIdxes) {
+    KU_ASSERT(key->state == partitionIdxes->state &&
+              key->dataType.getPhysicalType() == PhysicalTypeID::INT64);
+    for (auto i = 0u; i < key->state->getSelVector().getSelSize(); i++) {
+        const auto pos = key->state->getSelVector()[i];
+        const partition_idx_t partitionIdx =
+            key->getValue<offset_t>(pos) >> StorageConfig::NODE_GROUP_SIZE_LOG2;
+        partitionIdxes->setValue(pos, partitionIdx);
+    }
+}
+
+void CopyPartitionerSharedState::initialize(const logical_type_vec_t& columnTypes,
+    idx_t numPartitioners, const main::ClientContext* clientContext) {
+    PartitionerSharedState::initialize(columnTypes, numPartitioners, clientContext);
+    Partitioner::initializePartitioningStates(columnTypes, partitioningBuffers, numPartitions,
+        numPartitioners);
+}
+
+void CopyPartitionerSharedState::merge(
+    const std::vector<std::unique_ptr<PartitioningBuffer>>& localPartitioningStates) {
+    std::unique_lock xLck{mtx};
+    KU_ASSERT(partitioningBuffers.size() == localPartitioningStates.size());
+    for (auto partitioningIdx = 0u; partitioningIdx < partitioningBuffers.size();
+         partitioningIdx++) {
+        partitioningBuffers[partitioningIdx]->merge(*localPartitioningStates[partitioningIdx]);
+    }
+}
+
+void CopyPartitionerSharedState::resetState(common::idx_t partitioningIdx) {
+    PartitionerSharedState::resetState(partitioningIdx);
+    partitioningBuffers[partitioningIdx].reset();
+}
+
+void PartitioningBuffer::merge(const PartitioningBuffer& localPartitioningState) const {
+    KU_ASSERT(partitions.size() == localPartitioningState.partitions.size());
+    for (auto partitionIdx = 0u; partitionIdx < partitions.size(); partitionIdx++) {
+        auto& sharedPartition = partitions[partitionIdx];
+        auto& localPartition = localPartitioningState.partitions[partitionIdx];
+        sharedPartition->merge(*localPartition);
+    }
+}
+
+Partitioner::Partitioner(PartitionerInfo info, PartitionerDataInfo dataInfo,
+    std::shared_ptr<CopyPartitionerSharedState> sharedState,
+    std::unique_ptr<PhysicalOperator> child, uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+    : Sink{type_, std::move(child), id, std::move(printInfo)}, dataInfo{std::move(dataInfo)},
+      info{std::move(info)}, sharedState{std::move(sharedState)} {
+    partitionIdxes = std::make_unique<ValueVector>(LogicalTypeID::INT64);
+}
+
+void Partitioner::initGlobalStateInternal(ExecutionContext* context) {
+    const auto clientContext = context->clientContext;
+    // If initialization is required
+    if (!sharedState->srcNodeTable) {
+        auto storageManager = StorageManager::Get(*clientContext);
+        auto catalog = catalog::Catalog::Get(*clientContext);
+        auto transaction = transaction::Transaction::Get(*clientContext);
+        auto fromTableID =
+            catalog->getTableCatalogEntry(transaction, dataInfo.fromTableName)->getTableID();
+        auto toTableID =
+            catalog->getTableCatalogEntry(transaction, dataInfo.toTableName)->getTableID();
+        sharedState->srcNodeTable = storageManager->getTable(fromTableID)->ptrCast<NodeTable>();
+        sharedState->dstNodeTable = storageManager->getTable(toTableID)->ptrCast<NodeTable>();
+        auto& relGroupEntry = catalog->getTableCatalogEntry(transaction, dataInfo.tableName)
+                                  ->constCast<catalog::RelGroupCatalogEntry>();
+        auto relEntryInfo = relGroupEntry.getRelEntryInfo(fromTableID, toTableID);
+        sharedState->relTable = storageManager->getTable(relEntryInfo->oid)->ptrCast<RelTable>();
+    }
+    sharedState->initialize(dataInfo.columnTypes, info.infos.size(), clientContext);
+}
+
+void Partitioner::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    localState = std::make_unique<PartitionerLocalState>();
+    initializePartitioningStates(dataInfo.columnTypes, localState->partitioningBuffers,
+        sharedState->numPartitions, info.infos.size());
+    for (const auto& evaluator : dataInfo.columnEvaluators) {
+        evaluator->init(*resultSet, context->clientContext);
+    }
+}
+
+DataChunk Partitioner::constructDataChunk(const std::shared_ptr<DataChunkState>& state) const {
+    const auto numColumns = dataInfo.columnEvaluators.size();
+    DataChunk dataChunk(numColumns, state);
+    for (auto i = 0u; i < numColumns; ++i) {
+        auto& evaluator = dataInfo.columnEvaluators[i];
+        dataChunk.insert(i, evaluator->resultVector);
+    }
+    return dataChunk;
+}
+
+void Partitioner::initializePartitioningStates(const logical_type_vec_t& columnTypes,
+    std::vector<std::unique_ptr<PartitioningBuffer>>& partitioningBuffers,
+    const std::array<partition_idx_t, CopyPartitionerSharedState::DIRECTIONS>& numPartitions,
+    idx_t numPartitioners) {
+    partitioningBuffers.resize(numPartitioners);
+    for (auto partitioningIdx = 0u; partitioningIdx < numPartitioners; partitioningIdx++) {
+        const auto numPartition = numPartitions[partitioningIdx];
+        auto partitioningBuffer = std::make_unique<PartitioningBuffer>();
+        partitioningBuffer->partitions.reserve(numPartition);
+        for (auto i = 0u; i < numPartition; i++) {
+            partitioningBuffer->partitions.push_back(
+                std::make_unique<InMemChunkedNodeGroupCollection>(LogicalType::copy(columnTypes)));
+        }
+        partitioningBuffers[partitioningIdx] = std::move(partitioningBuffer);
+    }
+}
+
+void Partitioner::executeInternal(ExecutionContext* context) {
+    const auto relOffsetVector = resultSet->getValueVector(info.relOffsetDataPos);
+    while (children[0]->getNextTuple(context)) {
+        KU_ASSERT(dataInfo.columnEvaluators.size() >= 1);
+        const auto numRels = relOffsetVector->state->getSelVector().getSelSize();
+        evaluateExpressions(numRels);
+        auto currentRelOffset = sharedState->relTable->reserveRelOffsets(numRels);
+        for (auto i = 0u; i < numRels; i++) {
+            const auto pos = relOffsetVector->state->getSelVector()[i];
+            relOffsetVector->setValue<offset_t>(pos, currentRelOffset++);
+        }
+        for (auto partitioningIdx = 0u; partitioningIdx < info.infos.size(); partitioningIdx++) {
+            auto& partitionInfo = info.infos[partitioningIdx];
+            auto keyVector = dataInfo.columnEvaluators[partitionInfo.keyIdx]->resultVector;
+            partitionIdxes->state = keyVector->state;
+            partitionInfo.partitionerFunc(keyVector.get(), partitionIdxes.get());
+            auto chunkToCopyFrom = constructDataChunk(keyVector->state);
+            copyDataToPartitions(*MemoryManager::Get(*context->clientContext), partitioningIdx,
+                chunkToCopyFrom);
+        }
+    }
+    sharedState->merge(localState->partitioningBuffers);
+}
+
+void Partitioner::evaluateExpressions(uint64_t numRels) const {
+    for (auto i = 0u; i < dataInfo.evaluateTypes.size(); ++i) {
+        auto evaluator = dataInfo.columnEvaluators[i].get();
+        switch (dataInfo.evaluateTypes[i]) {
+        case ColumnEvaluateType::DEFAULT: {
+            evaluator->evaluate(numRels);
+        } break;
+        default: {
+            evaluator->evaluate();
+        }
+        }
+    }
+}
+
+void Partitioner::copyDataToPartitions(MemoryManager& memoryManager,
+    partition_idx_t partitioningIdx, const DataChunk& chunkToCopyFrom) const {
+    std::vector<ValueVector*> vectorsToAppend;
+    vectorsToAppend.reserve(chunkToCopyFrom.getNumValueVectors());
+    for (auto j = 0u; j < chunkToCopyFrom.getNumValueVectors(); j++) {
+        vectorsToAppend.push_back(&chunkToCopyFrom.getValueVectorMutable(j));
+    }
+    for (auto i = 0u; i < chunkToCopyFrom.state->getSelVector().getSelSize(); i++) {
+        const auto posToCopyFrom = chunkToCopyFrom.state->getSelVector()[i];
+        const auto partitionIdx = partitionIdxes->getValue<partition_idx_t>(posToCopyFrom);
+        KU_ASSERT(
+            partitionIdx < localState->getPartitioningBuffer(partitioningIdx)->partitions.size());
+        const auto& partition =
+            localState->getPartitioningBuffer(partitioningIdx)->partitions[partitionIdx];
+        partition->append(memoryManager, vectorsToAppend, i, 1);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/path_property_probe.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/path_property_probe.cpp
new file mode 100644
index 0000000000..4528d7d4b0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/path_property_probe.cpp
@@ -0,0 +1,327 @@
+#include "processor/operator/path_property_probe.h"
+
+#include "common/constants.h"
+#include "function/hash/hash_functions.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void PathPropertyProbe::initLocalStateInternal(ResultSet* /*resultSet_*/,
+    ExecutionContext* /*context*/) {
+    localState = PathPropertyProbeLocalState();
+    auto pathVector = resultSet->getValueVector(info.pathPos);
+    pathNodesVector = StructVector::getFieldVectorRaw(*pathVector, InternalKeyword::NODES);
+    pathRelsVector = StructVector::getFieldVectorRaw(*pathVector, InternalKeyword::RELS);
+    auto nodesDataVector = ListVector::getDataVector(pathNodesVector);
+    auto relsDataVector = ListVector::getDataVector(pathRelsVector);
+    pathNodeIDsDataVector = StructVector::getFieldVectorRaw(*nodesDataVector, InternalKeyword::ID);
+    pathNodeLabelsDataVector =
+        StructVector::getFieldVectorRaw(*nodesDataVector, InternalKeyword::LABEL);
+    pathRelIDsDataVector = StructVector::getFieldVectorRaw(*relsDataVector, InternalKeyword::ID);
+    pathRelLabelsDataVector =
+        StructVector::getFieldVectorRaw(*relsDataVector, InternalKeyword::LABEL);
+    pathSrcNodeIDsDataVector =
+        StructVector::getFieldVectorRaw(*relsDataVector, InternalKeyword::SRC);
+    pathDstNodeIDsDataVector =
+        StructVector::getFieldVectorRaw(*relsDataVector, InternalKeyword::DST);
+    for (auto fieldIdx : info.nodeFieldIndices) {
+        pathNodesPropertyDataVectors.push_back(
+            StructVector::getFieldVector(nodesDataVector, fieldIdx).get());
+    }
+    for (auto fieldIdx : info.relFieldIndices) {
+        pathRelsPropertyDataVectors.push_back(
+            StructVector::getFieldVector(relsDataVector, fieldIdx).get());
+    }
+    if (info.leftNodeIDPos.isValid()) {
+        inputLeftNodeIDVector = resultSet->getValueVector(info.leftNodeIDPos).get();
+        inputRightNodeIDVector = resultSet->getValueVector(info.rightNodeIDPos).get();
+        inputNodeIDsVector = resultSet->getValueVector(info.inputNodeIDsPos).get();
+        inputRelIDsVector = resultSet->getValueVector(info.inputEdgeIDsPos).get();
+        if (info.directionPos.isValid()) {
+            inputDirectionVector = resultSet->getValueVector(info.directionPos).get();
+        }
+    }
+}
+
+static void copyListEntry(const ValueVector& srcVector, ValueVector* dstVector) {
+    auto& selVector = srcVector.state->getSelVector();
+    for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+        auto pos = selVector[i];
+        auto entry = srcVector.getValue<list_entry_t>(pos);
+        ListVector::addList(dstVector, entry.size);
+        dstVector->setValue(pos, entry);
+    }
+}
+
+static void copyInternalID(ValueVector* srcVector, ValueVector* dstIDVector,
+    ValueVector* dstLabelVector,
+    const std::unordered_map<common::table_id_t, std::string>& tableIDToName) {
+    auto srcDataVector = ListVector::getDataVector(srcVector);
+    for (auto i = 0u; i < ListVector::getDataVectorSize(srcVector); ++i) {
+        auto id = srcDataVector->getValue<internalID_t>(i);
+        dstIDVector->setValue(i, id);
+        StringVector::addString(dstLabelVector, i, tableIDToName.at(id.tableID));
+    }
+}
+
+// TODO(Xiyang): revisit me. Instead of printing in src->dst order. Maybe left->right order make
+// more sense.
+// Truth table.
+// Edge Direction | ExtendFromSource | Result
+// FWD            | T                | T
+// FWD            | F                | F
+// BWD            | T                | F
+// BWD            | F                | T
+static bool isCorrectOrder(ValueVector* vector, sel_t pos, bool extendFromSource) {
+    if (extendFromSource) {
+        return vector->getValue<bool>(pos);
+    }
+    return !vector->getValue<bool>(pos);
+}
+
+static void writeSrcDstNodeIDs(nodeID_t fromID, nodeID_t toID, ValueVector* directionDataVector,
+    ValueVector* srcNodeIDsDataVector, ValueVector* dstNodeIDsDataVector, sel_t pos, bool flag) {
+    if (isCorrectOrder(directionDataVector, pos, flag)) {
+        srcNodeIDsDataVector->setValue(pos, fromID);
+        dstNodeIDsDataVector->setValue(pos, toID);
+    } else {
+        srcNodeIDsDataVector->setValue(pos, toID);
+        dstNodeIDsDataVector->setValue(pos, fromID);
+    }
+}
+
+bool PathPropertyProbe::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    auto sizeProbed = 0u;
+    // Copy node IDs
+    if (inputNodeIDsVector != nullptr) {
+        pathNodesVector->resetAuxiliaryBuffer();
+        copyListEntry(*inputNodeIDsVector, pathNodesVector);
+        copyInternalID(inputNodeIDsVector, pathNodeIDsDataVector, pathNodeLabelsDataVector,
+            info.tableIDToName);
+    }
+    // Scan node properties
+    if (sharedState->nodeHashTableState != nullptr) {
+        auto nodeHashTable = sharedState->nodeHashTableState->getHashTable();
+        auto nodeDataSize = ListVector::getDataVectorSize(pathNodesVector);
+        while (sizeProbed < nodeDataSize) {
+            auto sizeToProbe =
+                std::min<uint64_t>(DEFAULT_VECTOR_CAPACITY, nodeDataSize - sizeProbed);
+            probe(nodeHashTable, sizeProbed, sizeToProbe, pathNodeIDsDataVector,
+                pathNodesPropertyDataVectors, info.nodeTableColumnIndices);
+            sizeProbed += sizeToProbe;
+        }
+    }
+    // Copy rel IDs
+    if (inputRelIDsVector != nullptr) {
+        pathRelsVector->resetAuxiliaryBuffer();
+        copyListEntry(*inputRelIDsVector, pathRelsVector);
+        copyInternalID(inputRelIDsVector, pathRelIDsDataVector, pathRelLabelsDataVector,
+            info.tableIDToName);
+    }
+    // Scan rel property
+    if (sharedState->relHashTableState != nullptr) {
+        auto relHashTable = sharedState->relHashTableState->getHashTable();
+        auto relDataSize = ListVector::getDataVectorSize(pathRelsVector);
+        sizeProbed = 0u;
+        while (sizeProbed < relDataSize) {
+            auto sizeToProbe =
+                std::min<uint64_t>(DEFAULT_VECTOR_CAPACITY, relDataSize - sizeProbed);
+            probe(relHashTable, sizeProbed, sizeToProbe, pathRelIDsDataVector,
+                pathRelsPropertyDataVectors, info.relTableColumnIndices);
+            sizeProbed += sizeToProbe;
+        }
+    }
+    if (inputNodeIDsVector == nullptr || inputRelIDsVector == nullptr) {
+        return true;
+    }
+    auto& selVector = inputNodeIDsVector->state->getSelVector();
+    auto inputNodeIDsDataVector = ListVector::getDataVector(inputNodeIDsVector);
+    // Copy rel src&dst IDs
+
+    switch (info.extendDirection) {
+    case ExtendDirection::FWD: {
+        if (info.extendFromLeft) {
+            // Example graph src->1->2->3->dst
+            // Input: src, dst, [1, 2, 3]
+            // Output:
+            // - srcIDs [src, 1, 2, 3]
+            // - dstIDs [1, 2, 3, dst]
+            for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+                auto leftNodeID = inputLeftNodeIDVector->getValue<nodeID_t>(i);
+                auto rightNodeID = inputRightNodeIDVector->getValue<nodeID_t>(i);
+                auto nodeListEntry = inputNodeIDsVector->getValue<list_entry_t>(i);
+                auto relListEntry = inputRelIDsVector->getValue<list_entry_t>(i);
+                if (relListEntry.size == 0) {
+                    continue;
+                }
+                for (auto j = 0u; j < nodeListEntry.size; ++j) {
+                    auto id = inputNodeIDsDataVector->getValue<nodeID_t>(nodeListEntry.offset + j);
+                    pathSrcNodeIDsDataVector->setValue(relListEntry.offset + j + 1, id);
+                    pathDstNodeIDsDataVector->setValue(relListEntry.offset + j, id);
+                }
+                pathSrcNodeIDsDataVector->setValue(relListEntry.offset, leftNodeID);
+                pathDstNodeIDsDataVector->setValue(relListEntry.offset + relListEntry.size - 1,
+                    rightNodeID);
+            }
+        } else {
+            // Example graph src<-1<-2<-3<-dst
+            // Input: src, dst, [1, 2, 3]
+            // Output:
+            // - srcIDs [1, 2, 3, dst]
+            // - dstIDs [src, 1, 2, 3]
+            for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+                auto leftNodeID = inputLeftNodeIDVector->getValue<nodeID_t>(i);
+                auto rightNodeID = inputRightNodeIDVector->getValue<nodeID_t>(i);
+                auto nodeListEntry = inputNodeIDsVector->getValue<list_entry_t>(i);
+                auto relListEntry = inputRelIDsVector->getValue<list_entry_t>(i);
+                if (relListEntry.size == 0) {
+                    continue;
+                }
+                for (auto j = 0u; j < nodeListEntry.size; ++j) {
+                    auto id = inputNodeIDsDataVector->getValue<nodeID_t>(nodeListEntry.offset + j);
+                    pathSrcNodeIDsDataVector->setValue(relListEntry.offset + j, id);
+                    pathDstNodeIDsDataVector->setValue(relListEntry.offset + j + 1, id);
+                }
+                pathSrcNodeIDsDataVector->setValue(relListEntry.offset + relListEntry.size - 1,
+                    rightNodeID);
+                pathDstNodeIDsDataVector->setValue(relListEntry.offset, leftNodeID);
+            }
+        }
+    } break;
+    case common::ExtendDirection::BWD: {
+        if (info.extendFromLeft) {
+            // Example graph src<-1<-2<-3<-dst
+            // Input: src, dst, [1, 2, 3]
+            // Output:
+            // - srcIDs [1, 2, 3, dst]
+            // - dstIDs [src, 1, 2, 3]
+            for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+                auto leftNodeID = inputLeftNodeIDVector->getValue<nodeID_t>(i);
+                auto rightNodeID = inputRightNodeIDVector->getValue<nodeID_t>(i);
+                auto nodeListEntry = inputNodeIDsVector->getValue<list_entry_t>(i);
+                auto relListEntry = inputRelIDsVector->getValue<list_entry_t>(i);
+                if (relListEntry.size == 0) {
+                    continue;
+                }
+                for (auto j = 0u; j < nodeListEntry.size; ++j) {
+                    auto id = inputNodeIDsDataVector->getValue<nodeID_t>(nodeListEntry.offset + j);
+                    pathSrcNodeIDsDataVector->setValue(relListEntry.offset + j, id);
+                    pathDstNodeIDsDataVector->setValue(relListEntry.offset + j + 1, id);
+                }
+                pathSrcNodeIDsDataVector->setValue(relListEntry.offset + relListEntry.size - 1,
+                    rightNodeID);
+                pathDstNodeIDsDataVector->setValue(relListEntry.offset, leftNodeID);
+            }
+        } else {
+            // Example graph src->1->2->3->dst
+            // Input: src, dst, [1, 2, 3]
+            // Output:
+            // - srcIDs [src, 1, 2, 3]
+            // - dstIDs [1, 2, 3, dst]
+            for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+                auto leftNodeID = inputLeftNodeIDVector->getValue<nodeID_t>(i);
+                auto rightNodeID = inputRightNodeIDVector->getValue<nodeID_t>(i);
+                auto nodeListEntry = inputNodeIDsVector->getValue<list_entry_t>(i);
+                auto relListEntry = inputRelIDsVector->getValue<list_entry_t>(i);
+                if (relListEntry.size == 0) {
+                    continue;
+                }
+                for (auto j = 0u; j < nodeListEntry.size; ++j) {
+                    auto id = inputNodeIDsDataVector->getValue<nodeID_t>(nodeListEntry.offset + j);
+                    pathSrcNodeIDsDataVector->setValue(relListEntry.offset + j + 1, id);
+                    pathDstNodeIDsDataVector->setValue(relListEntry.offset + j, id);
+                }
+                pathSrcNodeIDsDataVector->setValue(relListEntry.offset, leftNodeID);
+                pathDstNodeIDsDataVector->setValue(relListEntry.offset + relListEntry.size - 1,
+                    rightNodeID);
+            }
+        }
+    } break;
+    case common::ExtendDirection::BOTH: {
+        auto directionDataVector = ListVector::getDataVector(inputDirectionVector);
+        for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+            auto leftNodeID = inputLeftNodeIDVector->getValue<nodeID_t>(i);
+            auto rightNodeID = inputRightNodeIDVector->getValue<nodeID_t>(i);
+            auto nodeListEntry = inputNodeIDsVector->getValue<list_entry_t>(i);
+            auto relListEntry = inputRelIDsVector->getValue<list_entry_t>(i);
+            if (relListEntry.size == 0) {
+                continue;
+            }
+            if (nodeListEntry.size == 0) {
+                KU_ASSERT(relListEntry.size == 1);
+                if (isCorrectOrder(directionDataVector, relListEntry.offset, info.extendFromLeft)) {
+                    pathSrcNodeIDsDataVector->setValue(relListEntry.offset, leftNodeID);
+                    pathDstNodeIDsDataVector->setValue(relListEntry.offset, rightNodeID);
+                } else {
+                    pathSrcNodeIDsDataVector->setValue(relListEntry.offset, rightNodeID);
+                    pathDstNodeIDsDataVector->setValue(relListEntry.offset, leftNodeID);
+                }
+                continue;
+            }
+            for (auto j = 0u; j < nodeListEntry.size - 1; ++j) {
+                auto from = inputNodeIDsDataVector->getValue<nodeID_t>(nodeListEntry.offset + j);
+                auto to = inputNodeIDsDataVector->getValue<nodeID_t>(nodeListEntry.offset + j + 1);
+                writeSrcDstNodeIDs(from, to, directionDataVector, pathSrcNodeIDsDataVector,
+                    pathDstNodeIDsDataVector, relListEntry.offset + j + 1, info.extendFromLeft);
+            }
+            writeSrcDstNodeIDs(leftNodeID,
+                inputNodeIDsDataVector->getValue<nodeID_t>(nodeListEntry.offset),
+                directionDataVector, pathSrcNodeIDsDataVector, pathDstNodeIDsDataVector,
+                relListEntry.offset, info.extendFromLeft);
+            writeSrcDstNodeIDs(inputNodeIDsDataVector->getValue<nodeID_t>(
+                                   nodeListEntry.offset + nodeListEntry.size - 1),
+                rightNodeID, directionDataVector, pathSrcNodeIDsDataVector,
+                pathDstNodeIDsDataVector, relListEntry.offset + relListEntry.size - 1,
+                info.extendFromLeft);
+        }
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    return true;
+}
+
+void PathPropertyProbe::probe(lbug::processor::JoinHashTable* hashTable, uint64_t sizeProbed,
+    uint64_t sizeToProbe, ValueVector* idVector, const std::vector<ValueVector*>& propertyVectors,
+    const std::vector<ft_col_idx_t>& colIndicesToScan) const {
+    // Hash
+    for (auto i = 0u; i < sizeToProbe; ++i) {
+        function::Hash::operation(idVector->getValue<internalID_t>(sizeProbed + i),
+            localState.hashes[i]);
+    }
+    // Probe hash
+    for (auto i = 0u; i < sizeToProbe; ++i) {
+        localState.probedTuples[i] = hashTable->getTupleForHash(localState.hashes[i]);
+    }
+    // Match value
+    for (auto i = 0u; i < sizeToProbe; ++i) {
+        while (localState.probedTuples[i]) {
+            auto currentTuple = localState.probedTuples[i];
+            if (*(internalID_t*)currentTuple == idVector->getValue<internalID_t>(sizeProbed + i)) {
+                localState.matchedTuples[i] = currentTuple;
+                break;
+            }
+            localState.probedTuples[i] = *hashTable->getPrevTuple(currentTuple);
+        }
+        KU_ASSERT(localState.matchedTuples[i] != nullptr);
+    }
+    // Scan table
+    auto factorizedTable = hashTable->getFactorizedTable();
+    for (auto i = 0u; i < sizeToProbe; ++i) {
+        auto tuple = localState.matchedTuples[i];
+        for (auto j = 0u; j < propertyVectors.size(); ++j) {
+            auto propertyVector = propertyVectors[j];
+            auto colIdx = colIndicesToScan[j];
+            factorizedTable->readFlatColToFlatVector(tuple, colIdx, *propertyVector,
+                sizeProbed + i);
+        }
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/CMakeLists.txt
new file mode 100644
index 0000000000..969da73e37
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/CMakeLists.txt
@@ -0,0 +1,24 @@
+add_subdirectory(reader)
+add_subdirectory(writer/parquet)
+
+add_library(lbug_processor_operator_persistent
+        OBJECT
+        batch_insert_error_handler.cpp
+        node_batch_insert.cpp
+        node_batch_insert_error_handler.cpp
+        copy_rel_batch_insert.cpp
+        rel_batch_insert.cpp
+        copy_to.cpp
+        delete.cpp
+        delete_executor.cpp
+        index_builder.cpp
+        insert.cpp
+        insert_executor.cpp
+        merge.cpp
+        set.cpp
+        set_executor.cpp
+)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_persistent>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/batch_insert_error_handler.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/batch_insert_error_handler.cpp
new file mode 100644
index 0000000000..c6fafd8e4a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/batch_insert_error_handler.cpp
@@ -0,0 +1,92 @@
+#include "processor/operator/persistent/batch_insert_error_handler.h"
+
+#include "common/exception/copy.h"
+#include "common/uniq_lock.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "processor/warning_context.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+BatchInsertCachedError::BatchInsertCachedError(std::string message,
+    const std::optional<WarningSourceData>& warningData)
+    : message(std::move(message)), warningData(warningData) {}
+
+BatchInsertErrorHandler::BatchInsertErrorHandler(ExecutionContext* context, bool ignoreErrors,
+    std::shared_ptr<common::row_idx_t> sharedErrorCounter, std::mutex* sharedErrorCounterMtx)
+    : ignoreErrors(ignoreErrors),
+      warningLimit(
+          std::min(context->clientContext->getClientConfig()->warningLimit, LOCAL_WARNING_LIMIT)),
+      context(context), currentInsertIdx(0), sharedErrorCounterMtx(sharedErrorCounterMtx),
+      sharedErrorCounter(std::move(sharedErrorCounter)) {}
+
+void BatchInsertErrorHandler::addNewVectorsIfNeeded() {
+    KU_ASSERT(currentInsertIdx <= cachedErrors.size());
+    if (currentInsertIdx == cachedErrors.size()) {
+        cachedErrors.emplace_back();
+    }
+}
+
+bool BatchInsertErrorHandler::getIgnoreErrors() const {
+    return ignoreErrors;
+}
+
+void BatchInsertErrorHandler::handleError(std::string message,
+    const std::optional<WarningSourceData>& warningData) {
+    handleError(BatchInsertCachedError{std::move(message), warningData});
+}
+
+void BatchInsertErrorHandler::handleError(BatchInsertCachedError error) {
+    if (!ignoreErrors) {
+        throw common::CopyException(error.message);
+    }
+
+    if (getNumErrors() >= warningLimit) {
+        flushStoredErrors();
+    }
+
+    addNewVectorsIfNeeded();
+    cachedErrors[currentInsertIdx] = std::move(error);
+    ++currentInsertIdx;
+}
+
+void BatchInsertErrorHandler::flushStoredErrors() {
+    std::vector<CopyFromFileError> unpopulatedErrors;
+
+    for (row_idx_t i = 0; i < getNumErrors(); ++i) {
+        auto& error = cachedErrors[i];
+        CopyFromFileError warningToAdd{std::move(error.message), {}, false};
+        if (error.warningData.has_value()) {
+            warningToAdd.completedLine = true;
+            warningToAdd.warningData = error.warningData.value();
+        }
+        unpopulatedErrors.push_back(warningToAdd);
+    }
+
+    if (!unpopulatedErrors.empty()) {
+        KU_ASSERT(ignoreErrors);
+        WarningContext::Get(*context->clientContext)->appendWarningMessages(unpopulatedErrors);
+    }
+
+    if (!unpopulatedErrors.empty() && sharedErrorCounter != nullptr) {
+        KU_ASSERT(sharedErrorCounterMtx);
+        common::UniqLock lockGuard{*sharedErrorCounterMtx};
+        *sharedErrorCounter += unpopulatedErrors.size();
+    }
+
+    clearErrors();
+}
+
+void BatchInsertErrorHandler::clearErrors() {
+    currentInsertIdx = 0;
+}
+
+row_idx_t BatchInsertErrorHandler::getNumErrors() const {
+    return currentInsertIdx;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/copy_rel_batch_insert.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/copy_rel_batch_insert.cpp
new file mode 100644
index 0000000000..5fabcde2ac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/copy_rel_batch_insert.cpp
@@ -0,0 +1,92 @@
+#include "processor/operator/persistent/copy_rel_batch_insert.h"
+
+#include "storage/storage_utils.h"
+#include "storage/table/csr_chunked_node_group.h"
+
+namespace lbug {
+namespace processor {
+
+static void setOffsetToWithinNodeGroup(storage::ColumnChunkData& chunk,
+    common::offset_t startOffset) {
+    KU_ASSERT(chunk.getDataType().getPhysicalType() == common::PhysicalTypeID::INTERNAL_ID);
+    const auto offsets = reinterpret_cast<common::offset_t*>(chunk.getData());
+    for (auto i = 0u; i < chunk.getNumValues(); i++) {
+        offsets[i] -= startOffset;
+    }
+}
+
+std::unique_ptr<RelBatchInsertExecutionState> CopyRelBatchInsert::initExecutionState(
+    const PartitionerSharedState& partitionerSharedState, const RelBatchInsertInfo& relInfo,
+    common::node_group_idx_t nodeGroupIdx) {
+    auto executionState = std::make_unique<CopyRelBatchInsertExecutionState>();
+    executionState->partitioningBuffer =
+        partitionerSharedState.constCast<CopyPartitionerSharedState>().getPartitionBuffer(
+            relInfo.partitioningIdx, nodeGroupIdx);
+    const auto startNodeOffset = storage::StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx);
+    for (auto& chunkedGroup : executionState->partitioningBuffer->getChunkedGroups()) {
+        setOffsetToWithinNodeGroup(chunkedGroup->getColumnChunk(relInfo.boundNodeOffsetColumnID),
+            startNodeOffset);
+    }
+    return executionState;
+}
+
+void CopyRelBatchInsert::populateCSRLengthsInternal(const storage::InMemChunkedCSRHeader& csrHeader,
+    common::offset_t numNodes, storage::InMemChunkedNodeGroupCollection& partition,
+    common::column_id_t boundNodeOffsetColumn) {
+    KU_ASSERT(numNodes == csrHeader.length->getNumValues() &&
+              numNodes == csrHeader.offset->getNumValues());
+    const auto lengthData = reinterpret_cast<common::length_t*>(csrHeader.length->getData());
+    std::fill(lengthData, lengthData + numNodes, 0);
+    for (auto& chunkedGroup : partition.getChunkedGroups()) {
+        auto& offsetChunk = chunkedGroup->getColumnChunk(boundNodeOffsetColumn);
+        for (auto i = 0u; i < offsetChunk.getNumValues(); i++) {
+            const auto nodeOffset = offsetChunk.getValue<common::offset_t>(i);
+            KU_ASSERT(nodeOffset < numNodes);
+            lengthData[nodeOffset]++;
+        }
+    }
+}
+
+void CopyRelBatchInsert::populateCSRLengths(RelBatchInsertExecutionState& executionState,
+    storage::InMemChunkedCSRHeader& csrHeader, common::offset_t numNodes,
+    const RelBatchInsertInfo& relInfo) {
+    auto& copyRelExecutionState = executionState.cast<CopyRelBatchInsertExecutionState>();
+    populateCSRLengthsInternal(csrHeader, numNodes, *copyRelExecutionState.partitioningBuffer,
+        relInfo.boundNodeOffsetColumnID);
+}
+
+void CopyRelBatchInsert::setRowIdxFromCSROffsets(storage::ColumnChunkData& rowIdxChunk,
+    storage::ColumnChunkData& csrOffsetChunk) {
+    KU_ASSERT(rowIdxChunk.getDataType().getPhysicalType() == common::PhysicalTypeID::INTERNAL_ID);
+    for (auto i = 0u; i < rowIdxChunk.getNumValues(); i++) {
+        const auto nodeOffset = rowIdxChunk.getValue<common::offset_t>(i);
+        const auto csrOffset = csrOffsetChunk.getValue<common::offset_t>(nodeOffset);
+        rowIdxChunk.setValue<common::offset_t>(csrOffset, i);
+        // Increment current csr offset for nodeOffset by 1.
+        csrOffsetChunk.setValue<common::offset_t>(csrOffset + 1, nodeOffset);
+    }
+}
+
+void CopyRelBatchInsert::finalizeStartCSROffsets(RelBatchInsertExecutionState& executionState,
+    storage::InMemChunkedCSRHeader& csrHeader, const RelBatchInsertInfo& relInfo) {
+    auto& copyRelExecutionState = executionState.cast<CopyRelBatchInsertExecutionState>();
+    for (auto& chunkedGroup : copyRelExecutionState.partitioningBuffer->getChunkedGroups()) {
+        auto& offsetChunk = chunkedGroup->getColumnChunk(relInfo.boundNodeOffsetColumnID);
+        // We reuse bound node offset column to store row idx for each rel in the node group.
+        setRowIdxFromCSROffsets(offsetChunk, *csrHeader.offset);
+    }
+}
+
+void CopyRelBatchInsert::writeToTable(RelBatchInsertExecutionState& executionState,
+    const storage::InMemChunkedCSRHeader&, const RelBatchInsertLocalState& localState,
+    BatchInsertSharedState& sharedState, const RelBatchInsertInfo& relInfo) {
+    auto& copyRelExecutionState = executionState.cast<CopyRelBatchInsertExecutionState>();
+    for (auto& chunkedGroup : copyRelExecutionState.partitioningBuffer->getChunkedGroups()) {
+        sharedState.incrementNumRows(chunkedGroup->getNumRows());
+        // we reused the bound node offset column to store row idx
+        // the row idx column determines which rows to write each entry in the chunked group to
+        localState.chunkedGroup->write(*chunkedGroup, relInfo.boundNodeOffsetColumnID);
+    }
+}
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/copy_to.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/copy_to.cpp
new file mode 100644
index 0000000000..f304679288
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/copy_to.cpp
@@ -0,0 +1,44 @@
+#include "processor/operator/persistent/copy_to.h"
+
+#include "processor/execution_context.h"
+
+namespace lbug {
+namespace processor {
+
+std::string CopyToPrintInfo::toString() const {
+    std::string result = "";
+    result += "Export: ";
+    for (auto& name : columnNames) {
+        result += name + ", ";
+    }
+    result += "To: " + fileName;
+    return result;
+}
+
+void CopyTo::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    localState.exportFuncLocalState =
+        info.exportFunc.initLocalState(*context->clientContext, *info.bindData, info.isFlatVec);
+    localState.inputVectors.reserve(info.inputVectorPoses.size());
+    for (auto& inputVectorPos : info.inputVectorPoses) {
+        localState.inputVectors.push_back(resultSet->getValueVector(inputVectorPos));
+    }
+}
+
+void CopyTo::initGlobalStateInternal(lbug::processor::ExecutionContext* context) {
+    sharedState->init(*context->clientContext, *info.bindData);
+}
+
+void CopyTo::finalize(ExecutionContext* /*context*/) {
+    info.exportFunc.finalize(*sharedState);
+}
+
+void CopyTo::executeInternal(processor::ExecutionContext* context) {
+    while (children[0]->getNextTuple(context)) {
+        info.exportFunc.sink(*sharedState, *localState.exportFuncLocalState, *info.bindData,
+            localState.inputVectors);
+    }
+    info.exportFunc.combine(*sharedState, *localState.exportFuncLocalState);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/delete.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/delete.cpp
new file mode 100644
index 0000000000..a943a769c4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/delete.cpp
@@ -0,0 +1,64 @@
+#include "processor/operator/persistent/delete.h"
+
+namespace lbug {
+namespace processor {
+
+std::string DeleteNodePrintInfo::toString() const {
+    std::string result = "Type: ";
+    switch (deleteType) {
+    case common::DeleteNodeType::DELETE:
+        result += "Delete Nodes";
+        break;
+    case common::DeleteNodeType::DETACH_DELETE:
+        result += "Detach Delete Nodes";
+        break;
+    }
+    result += ", From: ";
+    for (const auto& expression : expressions) {
+        result += expression->toString() + ", ";
+    }
+    return result;
+}
+
+std::string DeleteRelPrintInfo::toString() const {
+    std::string result = "Type: Delete Relationships, From: ";
+    for (const auto& expression : expressions) {
+        result += expression->toString() + ", ";
+    }
+    return result;
+}
+
+void DeleteNode::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    for (auto& executor : executors) {
+        executor->init(resultSet, context);
+    }
+}
+
+bool DeleteNode::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    for (auto& executor : executors) {
+        executor->delete_(context);
+    }
+    return true;
+}
+
+void DeleteRel::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    for (auto& executor : executors) {
+        executor->init(resultSet, context);
+    }
+}
+
+bool DeleteRel::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    for (auto& executor : executors) {
+        executor->delete_(context);
+    }
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/delete_executor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/delete_executor.cpp
new file mode 100644
index 0000000000..734c80173e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/delete_executor.cpp
@@ -0,0 +1,157 @@
+#include "processor/operator/persistent/delete_executor.h"
+
+#include <memory>
+
+#include "common/assert.h"
+#include "common/exception/message.h"
+#include "common/vector/value_vector.h"
+#include "processor/execution_context.h"
+#include "storage/table/rel_table.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace processor {
+
+void NodeDeleteInfo::init(const ResultSet& resultSet) {
+    nodeIDVector = resultSet.getValueVector(nodeIDPos).get();
+}
+
+void NodeTableDeleteInfo::init(const ResultSet& resultSet) {
+    pkVector = resultSet.getValueVector(pkPos).get();
+}
+
+static void throwDeleteNodeWithConnectedEdgesError(const std::string& tableName,
+    offset_t nodeOffset, RelDataDirection direction) {
+    throw RuntimeException(ExceptionMessage::violateDeleteNodeWithConnectedEdgesConstraint(
+        tableName, std::to_string(nodeOffset), RelDirectionUtils::relDirectionToString(direction)));
+}
+
+void NodeTableDeleteInfo::deleteFromRelTable(Transaction* transaction,
+    ValueVector* nodeIDVector) const {
+    for (auto& relTable : fwdRelTables) {
+        relTable->throwIfNodeHasRels(transaction, RelDataDirection::FWD, nodeIDVector,
+            throwDeleteNodeWithConnectedEdgesError);
+    }
+    for (auto& relTable : bwdRelTables) {
+        relTable->throwIfNodeHasRels(transaction, RelDataDirection::BWD, nodeIDVector,
+            throwDeleteNodeWithConnectedEdgesError);
+    }
+}
+
+void NodeTableDeleteInfo::detachDeleteFromRelTable(Transaction* transaction,
+    RelTableDeleteState* detachDeleteState) const {
+    for (auto& relTable : fwdRelTables) {
+        detachDeleteState->detachDeleteDirection = RelDataDirection::FWD;
+        relTable->detachDelete(transaction, detachDeleteState);
+    }
+    for (auto& relTable : bwdRelTables) {
+        detachDeleteState->detachDeleteDirection = RelDataDirection::BWD;
+        relTable->detachDelete(transaction, detachDeleteState);
+    }
+}
+
+void NodeDeleteExecutor::init(ResultSet* resultSet, ExecutionContext*) {
+    info.init(*resultSet);
+    if (info.deleteType == DeleteNodeType::DETACH_DELETE) {
+        const auto tempSharedState = std::make_shared<DataChunkState>();
+        dstNodeIDVector = std::make_unique<ValueVector>(LogicalType::INTERNAL_ID());
+        relIDVector = std::make_unique<ValueVector>(LogicalType::INTERNAL_ID());
+        dstNodeIDVector->setState(tempSharedState);
+        relIDVector->setState(tempSharedState);
+        detachDeleteState = std::make_unique<RelTableDeleteState>(*info.nodeIDVector,
+            *dstNodeIDVector, *relIDVector);
+    }
+}
+
+void SingleLabelNodeDeleteExecutor::init(ResultSet* resultSet, ExecutionContext* context) {
+    NodeDeleteExecutor::init(resultSet, context);
+    tableInfo.init(*resultSet);
+}
+
+void SingleLabelNodeDeleteExecutor::delete_(ExecutionContext* context) {
+    KU_ASSERT(tableInfo.pkVector->state == info.nodeIDVector->state);
+    auto deleteState =
+        std::make_unique<NodeTableDeleteState>(*info.nodeIDVector, *tableInfo.pkVector);
+    auto transaction = Transaction::Get(*context->clientContext);
+    if (!tableInfo.table->delete_(transaction, *deleteState)) {
+        return;
+    }
+    switch (info.deleteType) {
+    case DeleteNodeType::DELETE: {
+        tableInfo.deleteFromRelTable(transaction, info.nodeIDVector);
+    } break;
+    case DeleteNodeType::DETACH_DELETE: {
+        tableInfo.detachDeleteFromRelTable(transaction, detachDeleteState.get());
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void MultiLabelNodeDeleteExecutor::init(ResultSet* resultSet, ExecutionContext* context) {
+    NodeDeleteExecutor::init(resultSet, context);
+    for (auto& [_, tableInfo] : tableInfos) {
+        tableInfo.init(*resultSet);
+    }
+}
+
+void MultiLabelNodeDeleteExecutor::delete_(ExecutionContext* context) {
+    auto& nodeIDSelVector = info.nodeIDVector->state->getSelVector();
+    KU_ASSERT(nodeIDSelVector.getSelSize() == 1);
+    const auto pos = nodeIDSelVector[0];
+    if (info.nodeIDVector->isNull(pos)) {
+        return;
+    }
+    const auto nodeID = info.nodeIDVector->getValue<internalID_t>(pos);
+    const auto& tableInfo = tableInfos.at(nodeID.tableID);
+    auto deleteState =
+        std::make_unique<NodeTableDeleteState>(*info.nodeIDVector, *tableInfo.pkVector);
+    auto transaction = Transaction::Get(*context->clientContext);
+    if (!tableInfo.table->delete_(transaction, *deleteState)) {
+        return;
+    }
+    switch (info.deleteType) {
+    case DeleteNodeType::DELETE: {
+        tableInfo.deleteFromRelTable(transaction, info.nodeIDVector);
+    } break;
+    case DeleteNodeType::DETACH_DELETE: {
+        tableInfo.detachDeleteFromRelTable(transaction, detachDeleteState.get());
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void RelDeleteInfo::init(const ResultSet& resultSet) {
+    srcNodeIDVector = resultSet.getValueVector(srcNodeIDPos).get();
+    dstNodeIDVector = resultSet.getValueVector(dstNodeIDPos).get();
+    relIDVector = resultSet.getValueVector(relIDPos).get();
+}
+
+void RelDeleteExecutor::init(ResultSet* resultSet, ExecutionContext*) {
+    info.init(*resultSet);
+}
+
+void SingleLabelRelDeleteExecutor::delete_(ExecutionContext* context) {
+    auto deleteState = std::make_unique<RelTableDeleteState>(*info.srcNodeIDVector,
+        *info.dstNodeIDVector, *info.relIDVector);
+    table->delete_(Transaction::Get(*context->clientContext), *deleteState);
+}
+
+void MultiLabelRelDeleteExecutor::delete_(ExecutionContext* context) {
+    auto& idSelVector = info.relIDVector->state->getSelVector();
+    KU_ASSERT(idSelVector.getSelSize() == 1);
+    const auto pos = idSelVector[0];
+    const auto relID = info.relIDVector->getValue<internalID_t>(pos);
+    KU_ASSERT(tableIDToTableMap.contains(relID.tableID));
+    auto table = tableIDToTableMap.at(relID.tableID);
+    auto deleteState = std::make_unique<RelTableDeleteState>(*info.srcNodeIDVector,
+        *info.dstNodeIDVector, *info.relIDVector);
+    table->delete_(Transaction::Get(*context->clientContext), *deleteState);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/index_builder.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/index_builder.cpp
new file mode 100644
index 0000000000..35fed7e4e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/index_builder.cpp
@@ -0,0 +1,210 @@
+#include "processor/operator/persistent/index_builder.h"
+
+#include <thread>
+
+#include "common/assert.h"
+#include "common/cast.h"
+#include "common/exception/copy.h"
+#include "common/exception/message.h"
+#include "common/type_utils.h"
+#include "common/types/ku_string.h"
+#include "storage/index/hash_index_utils.h"
+#include "storage/table/node_table.h"
+#include "storage/table/string_chunk_data.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+template<typename T>
+bool IndexBufferWithWarningData<T>::full() const {
+    return indexBuffer.full() || (warningDataBuffer != nullptr && warningDataBuffer->full());
+}
+
+template<typename T>
+void IndexBufferWithWarningData<T>::append(T key, common::offset_t value,
+    OptionalWarningSourceData&& warningData) {
+    indexBuffer.push_back(std::make_pair(key, value));
+    if (warningData.has_value()) {
+        if (warningDataBuffer == nullptr) {
+            warningDataBuffer = std::make_unique<OptionalWarningDataBuffer::element_type>();
+        }
+        warningDataBuffer->push_back(warningData.value());
+    }
+}
+
+IndexBuilderGlobalQueues::IndexBuilderGlobalQueues(transaction::Transaction* transaction,
+    NodeTable* nodeTable)
+    : nodeTable(nodeTable), transaction{transaction} {
+    TypeUtils::visit(
+        pkTypeID(), [&](ku_string_t) { queues.emplace<Queue<std::string>>(); },
+        [&]<HashablePrimitive T>(T) { queues.emplace<Queue<T>>(); }, [](auto) { KU_UNREACHABLE; });
+}
+
+PhysicalTypeID IndexBuilderGlobalQueues::pkTypeID() const {
+    return nodeTable->getPKIndex()->keyTypeID();
+}
+
+void IndexBuilderGlobalQueues::consume(NodeBatchInsertErrorHandler& errorHandler) {
+    for (auto index = 0u; index < NUM_HASH_INDEXES; index++) {
+        maybeConsumeIndex(index, errorHandler);
+    }
+}
+
+void IndexBuilderGlobalQueues::maybeConsumeIndex(size_t index,
+    NodeBatchInsertErrorHandler& errorHandler) {
+    auto& pkIndex = nodeTable->getPKIndex()->cast<PrimaryKeyIndex>();
+    if (!pkIndex.tryLockTypedIndex(index)) {
+        return;
+    }
+
+    std::visit(
+        [&](auto&& queues) {
+            using T = std::decay_t<decltype(queues.type)>;
+            auto lck = pkIndex.adoptLockOfTypedIndex(index);
+            IndexBufferWithWarningData<T> bufferWithWarningData;
+            while (queues.array[index].pop(bufferWithWarningData)) {
+                auto& buffer = bufferWithWarningData.indexBuffer;
+                auto& warningDataBuffer = bufferWithWarningData.warningDataBuffer;
+                uint64_t insertBufferOffset = 0;
+                while (insertBufferOffset < buffer.size()) {
+                    auto numValuesInserted = pkIndex.appendWithIndexPosNoLock(transaction, buffer,
+                        insertBufferOffset, index,
+                        [&](offset_t offset) { return nodeTable->isVisible(transaction, offset); });
+                    if (numValuesInserted < buffer.size() - insertBufferOffset) {
+                        const auto& erroneousEntry = buffer[insertBufferOffset + numValuesInserted];
+                        OptionalWarningSourceData erroneousEntryWarningData;
+                        if (warningDataBuffer != nullptr) {
+                            erroneousEntryWarningData =
+                                (*warningDataBuffer)[insertBufferOffset + numValuesInserted];
+                        }
+                        errorHandler.handleError(
+                            IndexBuilderError<T>{.message = ExceptionMessage::duplicatePKException(
+                                                     TypeUtils::toString(erroneousEntry.first)),
+                                .key = erroneousEntry.first,
+                                .nodeID =
+                                    nodeID_t{
+                                        erroneousEntry.second,
+                                        nodeTable->getTableID(),
+                                    },
+                                .warningData = erroneousEntryWarningData});
+                        insertBufferOffset += 1; // skip the erroneous index then continue
+                    }
+                    insertBufferOffset += numValuesInserted;
+                }
+            }
+            return;
+        },
+        std::move(queues));
+}
+
+IndexBuilderLocalBuffers::IndexBuilderLocalBuffers(IndexBuilderGlobalQueues& globalQueues)
+    : globalQueues(&globalQueues) {
+    TypeUtils::visit(
+        globalQueues.pkTypeID(),
+        [&](ku_string_t) { buffers = std::make_unique<Buffers<std::string>>(); },
+        [&]<HashablePrimitive T>(T) { buffers = std::make_unique<Buffers<T>>(); },
+        [](auto) { KU_UNREACHABLE; });
+}
+
+void IndexBuilderLocalBuffers::flush(NodeBatchInsertErrorHandler& errorHandler) {
+    std::visit(
+        [&](auto&& buffers) {
+            for (auto i = 0u; i < buffers->size(); i++) {
+                globalQueues->insert(i, std::move((*buffers)[i]), errorHandler);
+            }
+        },
+        buffers);
+}
+
+IndexBuilder::IndexBuilder(std::shared_ptr<IndexBuilderSharedState> sharedState)
+    : sharedState(std::move(sharedState)), localBuffers(this->sharedState->globalQueues) {}
+
+void IndexBuilderSharedState::quitProducer() {
+    if (producers.fetch_sub(1, std::memory_order_relaxed) == 1) {
+        done.store(true, std::memory_order_relaxed);
+    }
+}
+
+static OptionalWarningSourceData getWarningDataFromChunks(
+    const std::vector<storage::ColumnChunkData*>& chunks, common::idx_t posInChunk) {
+    OptionalWarningSourceData ret;
+    if (!chunks.empty()) {
+        ret = WarningSourceData::constructFromData(chunks, posInChunk);
+    }
+    return ret;
+}
+
+void IndexBuilder::insert(const ColumnChunkData& chunk,
+    const std::vector<ColumnChunkData*>& warningData, offset_t nodeOffset, offset_t numNodes,
+    NodeBatchInsertErrorHandler& errorHandler) {
+    TypeUtils::visit(
+        chunk.getDataType().getPhysicalType(),
+        [&]<HashablePrimitive T>(T) {
+            for (auto i = 0u; i < numNodes; i++) {
+                if (checkNonNullConstraint(chunk, warningData, nodeOffset, i, errorHandler)) {
+                    auto value = chunk.getValue<T>(i);
+                    localBuffers.insert(value, nodeOffset + i,
+                        getWarningDataFromChunks(warningData, i), errorHandler);
+                }
+            }
+        },
+        [&](ku_string_t) {
+            auto& stringColumnChunk = ku_dynamic_cast<const StringChunkData&>(chunk);
+            for (auto i = 0u; i < numNodes; i++) {
+                if (checkNonNullConstraint(chunk, warningData, nodeOffset, i, errorHandler)) {
+                    auto value = stringColumnChunk.getValue<std::string>(i);
+                    localBuffers.insert(std::move(value), nodeOffset + i,
+                        getWarningDataFromChunks(warningData, i), errorHandler);
+                }
+            }
+        },
+        [&](auto) {
+            throw CopyException(ExceptionMessage::invalidPKType(chunk.getDataType().toString()));
+        });
+}
+
+void IndexBuilder::finishedProducing(NodeBatchInsertErrorHandler& errorHandler) {
+    localBuffers.flush(errorHandler);
+    sharedState->consume(errorHandler);
+    while (!sharedState->isDone()) {
+        std::this_thread::sleep_for(std::chrono::microseconds(500));
+        sharedState->consume(errorHandler);
+    }
+}
+
+void IndexBuilder::finalize(ExecutionContext* /*context*/,
+    NodeBatchInsertErrorHandler& errorHandler) {
+    // Flush anything added by last node group.
+    localBuffers.flush(errorHandler);
+
+    sharedState->consume(errorHandler);
+}
+
+bool IndexBuilder::checkNonNullConstraint(const ColumnChunkData& chunk,
+    const std::vector<storage::ColumnChunkData*>& warningData, offset_t nodeOffset,
+    offset_t chunkOffset, NodeBatchInsertErrorHandler& errorHandler) {
+    const auto* nullChunk = chunk.getNullData();
+    if (nullChunk->isNull(chunkOffset)) {
+        TypeUtils::visit(
+            chunk.getDataType().getPhysicalType(),
+            [&](struct_entry_t) {
+                // primary key cannot be struct
+                KU_UNREACHABLE;
+            },
+            [&]<typename T>(T) {
+                errorHandler.handleError<T>({.message = ExceptionMessage::nullPKException(),
+                    .key = {},
+                    .nodeID =
+                        nodeID_t{nodeOffset + chunkOffset, sharedState->nodeTable->getTableID()},
+                    .warningData = getWarningDataFromChunks(warningData, chunkOffset)});
+            });
+        return false;
+    }
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/insert.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/insert.cpp
new file mode 100644
index 0000000000..2e457efe9c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/insert.cpp
@@ -0,0 +1,42 @@
+#include "processor/operator/persistent/insert.h"
+
+#include "binder/expression/expression_util.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::string InsertPrintInfo::toString() const {
+    std::string result = "Expressions: ";
+    result += binder::ExpressionUtil::toString(expressions);
+    result += ", Action: ";
+    result += ConflictActionUtil::toString(action);
+    return result;
+}
+
+void Insert::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    for (auto& executor : nodeExecutors) {
+        executor.init(resultSet, context);
+    }
+    for (auto& executor : relExecutors) {
+        executor.init(resultSet, context);
+    }
+}
+
+bool Insert::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    for (auto& executor : nodeExecutors) {
+        executor.insert(context->clientContext);
+    }
+    for (auto& executor : relExecutors) {
+        executor.insert(context->clientContext);
+    }
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/insert_executor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/insert_executor.cpp
new file mode 100644
index 0000000000..5caad25d9d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/insert_executor.cpp
@@ -0,0 +1,193 @@
+#include "processor/operator/persistent/insert_executor.h"
+
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace processor {
+
+void NodeInsertInfo::init(const ResultSet& resultSet) {
+    nodeIDVector = resultSet.getValueVector(nodeIDPos).get();
+    for (auto& pos : columnsPos) {
+        if (pos.isValid()) {
+            columnVectors.push_back(resultSet.getValueVector(pos).get());
+        } else {
+            columnVectors.push_back(nullptr);
+        }
+    }
+}
+
+void NodeInsertInfo::updateNodeID(nodeID_t nodeID) const {
+    KU_ASSERT(nodeIDVector->state->getSelVector().getSelSize() == 1);
+    auto pos = nodeIDVector->state->getSelVector()[0];
+    nodeIDVector->setNull(pos, false);
+    nodeIDVector->setValue<nodeID_t>(pos, nodeID);
+}
+
+nodeID_t NodeInsertInfo::getNodeID() const {
+    auto& nodeIDSelVector = nodeIDVector->state->getSelVector();
+    KU_ASSERT(nodeIDSelVector.getSelSize() == 1);
+    if (nodeIDVector->isNull(nodeIDSelVector[0])) {
+        return {INVALID_OFFSET, INVALID_TABLE_ID};
+    }
+    return nodeIDVector->getValue<nodeID_t>(nodeIDSelVector[0]);
+}
+
+void NodeTableInsertInfo::init(const ResultSet& resultSet, main::ClientContext* context) {
+    for (auto& evaluator : columnDataEvaluators) {
+        evaluator->init(resultSet, context);
+        columnDataVectors.push_back(evaluator->resultVector.get());
+    }
+    pkVector = columnDataVectors[table->getPKColumnID()];
+}
+
+void NodeInsertExecutor::init(ResultSet* resultSet, const ExecutionContext* context) {
+    info.init(*resultSet);
+    tableInfo.init(*resultSet, context->clientContext);
+}
+
+static void writeColumnVector(ValueVector* columnVector, const ValueVector* dataVector) {
+    auto& columnSelVector = columnVector->state->getSelVector();
+    auto& dataSelVector = dataVector->state->getSelVector();
+    KU_ASSERT(columnSelVector.getSelSize() == 1 && dataSelVector.getSelSize() == 1);
+    auto columnPos = columnSelVector[0];
+    auto dataPos = dataSelVector[0];
+    if (dataVector->isNull(dataPos)) {
+        columnVector->setNull(columnPos, true);
+    } else {
+        columnVector->setNull(columnPos, false);
+        columnVector->copyFromVectorData(columnPos, dataVector, dataPos);
+    }
+}
+
+// TODO(Guodong/Xiyang): think we can reference data vector instead of copy.
+static void writeColumnVectors(const std::vector<ValueVector*>& columnVectors,
+    const std::vector<ValueVector*>& dataVectors) {
+    KU_ASSERT(columnVectors.size() == dataVectors.size());
+    for (auto i = 0u; i < columnVectors.size(); ++i) {
+        if (columnVectors[i] == nullptr) { // No need to project
+            continue;
+        }
+        writeColumnVector(columnVectors[i], dataVectors[i]);
+    }
+}
+
+static void writeColumnVectorsToNull(const std::vector<ValueVector*>& columnVectors) {
+    for (auto i = 0u; i < columnVectors.size(); ++i) {
+        auto columnVector = columnVectors[i];
+        if (columnVector == nullptr) { // No need to project
+            continue;
+        }
+        auto& columnSelVector = columnVector->state->getSelVector();
+        KU_ASSERT(columnSelVector.getSelSize() == 1);
+        columnVector->setNull(columnSelVector[0], true);
+    }
+}
+
+void NodeInsertExecutor::setNodeIDVectorToNonNull() const {
+    info.nodeIDVector->setNull(info.nodeIDVector->state->getSelVector()[0], false);
+}
+
+nodeID_t NodeInsertExecutor::insert(main::ClientContext* context) {
+    for (auto& evaluator : tableInfo.columnDataEvaluators) {
+        evaluator->evaluate();
+    }
+    auto transaction = Transaction::Get(*context);
+    if (checkConflict(transaction)) {
+        return info.getNodeID();
+    }
+    auto insertState = std::make_unique<storage::NodeTableInsertState>(*info.nodeIDVector,
+        *tableInfo.pkVector, tableInfo.columnDataVectors);
+    tableInfo.table->initInsertState(context, *insertState);
+    tableInfo.table->insert(transaction, *insertState);
+    writeColumnVectors(info.columnVectors, tableInfo.columnDataVectors);
+    return info.getNodeID();
+}
+
+void NodeInsertExecutor::skipInsert() const {
+    for (auto& evaluator : tableInfo.columnDataEvaluators) {
+        evaluator->evaluate();
+    }
+    info.nodeIDVector->setNull(info.nodeIDVector->state->getSelVector()[0], false);
+    writeColumnVectors(info.columnVectors, tableInfo.columnDataVectors);
+}
+
+bool NodeInsertExecutor::checkConflict(const Transaction* transaction) const {
+    if (info.conflictAction == ConflictAction::ON_CONFLICT_DO_NOTHING) {
+        auto offset =
+            tableInfo.table->validateUniquenessConstraint(transaction, tableInfo.columnDataVectors);
+        if (offset != INVALID_OFFSET) {
+            // Conflict. Skip insertion.
+            info.updateNodeID({offset, tableInfo.table->getTableID()});
+            return true;
+        }
+    }
+    return false;
+}
+
+void RelInsertInfo::init(const ResultSet& resultSet) {
+    srcNodeIDVector = resultSet.getValueVector(srcNodeIDPos).get();
+    dstNodeIDVector = resultSet.getValueVector(dstNodeIDPos).get();
+    for (auto& pos : columnsPos) {
+        if (pos.isValid()) {
+            columnVectors.push_back(resultSet.getValueVector(pos).get());
+        } else {
+            columnVectors.push_back(nullptr);
+        }
+    }
+}
+
+void RelTableInsertInfo::init(const ResultSet& resultSet, main::ClientContext* context) {
+    for (auto& evaluator : columnDataEvaluators) {
+        evaluator->init(resultSet, context);
+        columnDataVectors.push_back(evaluator->resultVector.get());
+    }
+}
+
+internalID_t RelTableInsertInfo::getRelID() const {
+    auto relIDVector = columnDataVectors[0];
+    auto& nodeIDSelVector = relIDVector->state->getSelVector();
+    KU_ASSERT(nodeIDSelVector.getSelSize() == 1);
+    if (relIDVector->isNull(nodeIDSelVector[0])) {
+        return {INVALID_OFFSET, INVALID_TABLE_ID};
+    }
+    return relIDVector->getValue<nodeID_t>(nodeIDSelVector[0]);
+}
+
+void RelInsertExecutor::init(ResultSet* resultSet, const ExecutionContext* context) {
+    info.init(*resultSet);
+    tableInfo.init(*resultSet, context->clientContext);
+}
+
+internalID_t RelInsertExecutor::insert(main::ClientContext* context) {
+    KU_ASSERT(info.srcNodeIDVector->state->getSelVector().getSelSize() == 1);
+    KU_ASSERT(info.dstNodeIDVector->state->getSelVector().getSelSize() == 1);
+    auto srcNodeIDPos = info.srcNodeIDVector->state->getSelVector()[0];
+    auto dstNodeIDPos = info.dstNodeIDVector->state->getSelVector()[0];
+    if (info.srcNodeIDVector->isNull(srcNodeIDPos) || info.dstNodeIDVector->isNull(dstNodeIDPos)) {
+        // No need to insert.
+        writeColumnVectorsToNull(info.columnVectors);
+        return tableInfo.getRelID();
+    }
+    for (auto i = 1u; i < tableInfo.columnDataEvaluators.size(); ++i) {
+        tableInfo.columnDataEvaluators[i]->evaluate();
+    }
+    auto insertState = std::make_unique<storage::RelTableInsertState>(*info.srcNodeIDVector,
+        *info.dstNodeIDVector, tableInfo.columnDataVectors);
+    tableInfo.table->initInsertState(context, *insertState);
+    tableInfo.table->insert(Transaction::Get(*context), *insertState);
+    writeColumnVectors(info.columnVectors, tableInfo.columnDataVectors);
+    return tableInfo.getRelID();
+}
+
+void RelInsertExecutor::skipInsert() const {
+    for (auto i = 1u; i < tableInfo.columnDataEvaluators.size(); ++i) {
+        tableInfo.columnDataEvaluators[i]->evaluate();
+    }
+    writeColumnVectors(info.columnVectors, tableInfo.columnDataVectors);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/merge.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/merge.cpp
new file mode 100644
index 0000000000..605b9007b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/merge.cpp
@@ -0,0 +1,143 @@
+#include "processor/operator/persistent/merge.h"
+
+#include "binder/expression/expression_util.h"
+#include "main/client_context.h"
+
+namespace lbug {
+namespace processor {
+
+std::string MergePrintInfo::toString() const {
+    std::string result = "Pattern: ";
+    result += binder::ExpressionUtil::toString(pattern);
+    if (!onMatch.empty()) {
+        result += ", ON MATCH SET: " + binder::ExpressionUtil::toString(onMatch);
+    }
+    if (!onCreate.empty()) {
+        result += ", ON CREATE SET: " + binder::ExpressionUtil::toString(onCreate);
+    }
+    return result;
+}
+
+void Merge::initLocalStateInternal(ResultSet* resultSet_, ExecutionContext* context) {
+    for (auto& executor : nodeInsertExecutors) {
+        executor.init(resultSet, context);
+    }
+    for (auto& executor : relInsertExecutors) {
+        executor.init(resultSet, context);
+    }
+    for (auto& executor : onCreateNodeSetExecutors) {
+        executor->init(resultSet, context);
+    }
+    for (auto& executor : onCreateRelSetExecutors) {
+        executor->init(resultSet, context);
+    }
+    for (auto& executor : onMatchNodeSetExecutors) {
+        executor->init(resultSet, context);
+    }
+    for (auto& executor : onMatchRelSetExecutors) {
+        executor->init(resultSet, context);
+    }
+    for (auto& evaluator : info.keyEvaluators) {
+        evaluator->init(*resultSet_, context->clientContext);
+    }
+    localState.init(*resultSet, context->clientContext, info);
+}
+
+void MergeLocalState::init(ResultSet& resultSet, main::ClientContext* context, MergeInfo& info) {
+    std::vector<common::LogicalType> types;
+    for (auto& evaluator : info.keyEvaluators) {
+        auto keyVector = evaluator->resultVector.get();
+        types.push_back(keyVector->dataType.copy());
+        keyVectors.push_back(keyVector);
+    }
+    // TODO: remove types
+    hashTable = std::make_unique<PatternCreationInfoTable>(*storage::MemoryManager::Get(*context),
+        std::move(types), std::move(info.tableSchema));
+    existenceVector = resultSet.getValueVector(info.existenceMark).get();
+}
+
+bool MergeLocalState::patternExists() const {
+    KU_ASSERT(existenceVector->state->getSelVector().getSelSize() == 1);
+    auto pos = existenceVector->state->getSelVector()[0];
+    return existenceVector->getValue<bool>(pos);
+}
+
+void Merge::executeOnMatch(ExecutionContext* context) {
+    for (auto& executor : onMatchNodeSetExecutors) {
+        executor->set(context);
+    }
+    for (auto& executor : onMatchRelSetExecutors) {
+        executor->set(context);
+    }
+}
+
+void Merge::executeOnCreatedPattern(PatternCreationInfo& patternCreationInfo,
+    ExecutionContext* context) {
+    for (auto& executor : nodeInsertExecutors) {
+        executor.skipInsert();
+    }
+    for (auto& executor : relInsertExecutors) {
+        executor.skipInsert();
+    }
+    for (auto i = 0u; i < onMatchNodeSetExecutors.size(); i++) {
+        auto& executor = onMatchNodeSetExecutors[i];
+        auto nodeIDToSet = patternCreationInfo.getPatternID(i);
+        executor->setNodeID(nodeIDToSet);
+        executor->set(context);
+    }
+    for (auto i = 0u; i < onMatchRelSetExecutors.size(); i++) {
+        auto& executor = onMatchRelSetExecutors[i];
+        auto relIDToSet = patternCreationInfo.getPatternID(i + onMatchNodeSetExecutors.size());
+        executor->setRelID(relIDToSet);
+        executor->set(context);
+    }
+}
+
+void Merge::executeOnNewPattern(PatternCreationInfo& patternCreationInfo,
+    ExecutionContext* context) {
+    // do insert and on create
+    for (auto i = 0u; i < nodeInsertExecutors.size(); i++) {
+        auto& executor = nodeInsertExecutors[i];
+        executor.setNodeIDVectorToNonNull();
+        auto nodeID = executor.insert(context->clientContext);
+        patternCreationInfo.updateID(i, info.executorInfo, nodeID);
+    }
+    for (auto i = 0u; i < relInsertExecutors.size(); i++) {
+        auto& executor = relInsertExecutors[i];
+        auto relID = executor.insert(context->clientContext);
+        patternCreationInfo.updateID(i + nodeInsertExecutors.size(), info.executorInfo, relID);
+    }
+    for (auto& executor : onCreateNodeSetExecutors) {
+        executor->set(context);
+    }
+    for (auto& executor : onCreateRelSetExecutors) {
+        executor->set(context);
+    }
+}
+
+void Merge::executeNoMatch(ExecutionContext* context) {
+    for (auto& evaluator : info.keyEvaluators) {
+        evaluator->evaluate();
+    }
+    auto patternCreationInfo = localState.getPatternCreationInfo();
+    if (patternCreationInfo.hasCreated) {
+        executeOnCreatedPattern(patternCreationInfo, context);
+    } else {
+        executeOnNewPattern(patternCreationInfo, context);
+    }
+}
+
+bool Merge::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    if (localState.patternExists()) {
+        executeOnMatch(context);
+    } else {
+        executeNoMatch(context);
+    }
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/node_batch_insert.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/node_batch_insert.cpp
new file mode 100644
index 0000000000..31fb3c9841
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/node_batch_insert.cpp
@@ -0,0 +1,313 @@
+#include "processor/operator/persistent/node_batch_insert.h"
+
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "common/cast.h"
+#include "common/finally_wrapper.h"
+#include "common/string_format.h"
+#include "processor/execution_context.h"
+#include "processor/operator/persistent/index_builder.h"
+#include "processor/result/factorized_table_util.h"
+#include "processor/warning_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/local_storage/local_storage.h"
+#include "storage/storage_manager.h"
+#include "storage/table/chunked_node_group.h"
+#include "storage/table/node_table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace processor {
+
+std::string NodeBatchInsertPrintInfo::toString() const {
+    std::string result = "Table Name: ";
+    result += tableName;
+    return result;
+}
+
+void NodeBatchInsertSharedState::initPKIndex(const ExecutionContext* context) {
+    uint64_t numRows = 0;
+    if (tableFuncSharedState != nullptr) {
+        numRows = tableFuncSharedState->getNumRows();
+    }
+    auto* nodeTable = ku_dynamic_cast<NodeTable*>(table);
+    nodeTable->getPKIndex()->bulkReserve(numRows);
+    globalIndexBuilder = IndexBuilder(std::make_shared<IndexBuilderSharedState>(
+        Transaction::Get(*context->clientContext), nodeTable));
+}
+
+void NodeBatchInsert::initGlobalStateInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    auto catalog = Catalog::Get(*clientContext);
+    auto transaction = Transaction::Get(*clientContext);
+    auto nodeTableEntry = catalog->getTableCatalogEntry(transaction, info->tableName)
+                              ->ptrCast<NodeTableCatalogEntry>();
+    auto nodeTable = StorageManager::Get(*clientContext)->getTable(nodeTableEntry->getTableID());
+    const auto& pkDefinition = nodeTableEntry->getPrimaryKeyDefinition();
+    auto pkColumnID = nodeTableEntry->getColumnID(pkDefinition.getName());
+    // Init info
+    info->compressionEnabled = StorageManager::Get(*clientContext)->compressionEnabled();
+    auto dataColumnIdx = 0u;
+    for (auto& property : nodeTableEntry->getProperties()) {
+        info->columnTypes.push_back(property.getType().copy());
+        info->insertColumnIDs.push_back(nodeTableEntry->getColumnID(property.getName()));
+        info->outputDataColumns.push_back(dataColumnIdx++);
+    }
+    for (auto& type : info->warningColumnTypes) {
+        info->columnTypes.push_back(type.copy());
+        info->warningDataColumns.push_back(dataColumnIdx++);
+    }
+    // Init shared state
+    auto nodeSharedState = sharedState->ptrCast<NodeBatchInsertSharedState>();
+    nodeSharedState->table = nodeTable;
+    nodeSharedState->pkColumnID = pkColumnID;
+    nodeSharedState->pkType = pkDefinition.getType().copy();
+    nodeSharedState->initPKIndex(context);
+}
+
+void NodeBatchInsert::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    const auto nodeInfo = info->ptrCast<NodeBatchInsertInfo>();
+    const auto numColumns = nodeInfo->columnEvaluators.size();
+
+    const auto nodeSharedState = ku_dynamic_cast<NodeBatchInsertSharedState*>(sharedState.get());
+    localState = std::make_unique<NodeBatchInsertLocalState>(
+        std::span{nodeInfo->columnTypes.begin(), nodeInfo->outputDataColumns.size()});
+    const auto nodeLocalState = localState->ptrCast<NodeBatchInsertLocalState>();
+    KU_ASSERT(nodeSharedState->globalIndexBuilder);
+    nodeLocalState->localIndexBuilder = nodeSharedState->globalIndexBuilder->clone();
+    nodeLocalState->errorHandler = createErrorHandler(context);
+    nodeLocalState->optimisticAllocator =
+        Transaction::Get(*context->clientContext)->getLocalStorage()->addOptimisticAllocator();
+
+    nodeLocalState->columnVectors.resize(numColumns);
+
+    for (auto i = 0u; i < numColumns; ++i) {
+        auto& evaluator = nodeInfo->columnEvaluators[i];
+        evaluator->init(*resultSet, context->clientContext);
+        nodeLocalState->columnVectors[i] = evaluator->resultVector.get();
+    }
+    nodeLocalState->chunkedGroup =
+        std::make_unique<InMemChunkedNodeGroup>(*MemoryManager::Get(*context->clientContext),
+            nodeInfo->columnTypes, info->compressionEnabled, StorageConfig::NODE_GROUP_SIZE, 0);
+    KU_ASSERT(resultSet->dataChunks[0]);
+    nodeLocalState->columnState = resultSet->dataChunks[0]->state;
+}
+
+void NodeBatchInsert::executeInternal(ExecutionContext* context) {
+    const auto clientContext = context->clientContext;
+    std::optional<ProducerToken> token;
+    auto nodeLocalState = localState->ptrCast<NodeBatchInsertLocalState>();
+    if (nodeLocalState->localIndexBuilder) {
+        token = nodeLocalState->localIndexBuilder->getProducerToken();
+    }
+    auto transaction = Transaction::Get(*clientContext);
+    while (children[0]->getNextTuple(context)) {
+        const auto originalSelVector = nodeLocalState->columnState->getSelVectorShared();
+        // Evaluate expressions if needed.
+        const auto numTuples = nodeLocalState->columnState->getSelVector().getSelSize();
+        evaluateExpressions(numTuples);
+        copyToNodeGroup(transaction, MemoryManager::Get(*clientContext)),
+            nodeLocalState->columnState->setSelVector(originalSelVector);
+    }
+    if (nodeLocalState->chunkedGroup->getNumRows() > 0) {
+        appendIncompleteNodeGroup(transaction, std::move(nodeLocalState->chunkedGroup),
+            nodeLocalState->localIndexBuilder, MemoryManager::Get(*context->clientContext));
+    }
+    if (nodeLocalState->localIndexBuilder) {
+        KU_ASSERT(token);
+        token->quit();
+
+        KU_ASSERT(nodeLocalState->errorHandler.has_value());
+        nodeLocalState->localIndexBuilder->finishedProducing(nodeLocalState->errorHandler.value());
+        nodeLocalState->errorHandler->flushStoredErrors();
+    }
+    const auto nodeInfo = info->ptrCast<NodeBatchInsertInfo>();
+    sharedState->table->cast<NodeTable>().mergeStats(nodeInfo->insertColumnIDs,
+        nodeLocalState->stats);
+}
+
+void NodeBatchInsert::evaluateExpressions(uint64_t numTuples) const {
+    const auto nodeInfo = info->ptrCast<NodeBatchInsertInfo>();
+    for (auto i = 0u; i < nodeInfo->evaluateTypes.size(); ++i) {
+        switch (nodeInfo->evaluateTypes[i]) {
+        case ColumnEvaluateType::DEFAULT: {
+            nodeInfo->columnEvaluators[i]->evaluate(numTuples);
+        } break;
+        case ColumnEvaluateType::CAST: {
+            nodeInfo->columnEvaluators[i]->evaluate();
+        } break;
+        default:
+            break;
+        }
+    }
+}
+
+void NodeBatchInsert::copyToNodeGroup(transaction::Transaction* transaction,
+    MemoryManager* mm) const {
+    auto numAppendedTuples = 0ul;
+    const auto nodeLocalState = ku_dynamic_cast<NodeBatchInsertLocalState*>(localState.get());
+    const auto numTuplesToAppend = nodeLocalState->columnState->getSelVector().getSelSize();
+    while (numAppendedTuples < numTuplesToAppend) {
+        const auto numAppendedTuplesInNodeGroup =
+            nodeLocalState->chunkedGroup->append(nodeLocalState->columnVectors, numAppendedTuples,
+                numTuplesToAppend - numAppendedTuples);
+        numAppendedTuples += numAppendedTuplesInNodeGroup;
+        if (nodeLocalState->chunkedGroup->isFull()) {
+            writeAndResetNodeGroup(transaction, nodeLocalState->chunkedGroup,
+                nodeLocalState->localIndexBuilder, mm, *nodeLocalState->optimisticAllocator);
+        }
+    }
+    const auto nodeInfo = info->ptrCast<NodeBatchInsertInfo>();
+    nodeLocalState->stats.update(nodeLocalState->columnVectors, nodeInfo->outputDataColumns.size());
+    sharedState->incrementNumRows(numAppendedTuples);
+}
+
+NodeBatchInsertErrorHandler NodeBatchInsert::createErrorHandler(ExecutionContext* context) const {
+    const auto nodeSharedState = ku_dynamic_cast<NodeBatchInsertSharedState*>(sharedState.get());
+    auto* nodeTable = ku_dynamic_cast<NodeTable*>(sharedState->table);
+    return NodeBatchInsertErrorHandler{context, nodeSharedState->pkType.getLogicalTypeID(),
+        nodeTable, WarningContext::Get(*context->clientContext)->getIgnoreErrorsOption(),
+        sharedState->numErroredRows, &sharedState->erroredRowMutex};
+}
+
+void NodeBatchInsert::clearToIndex(MemoryManager* mm,
+    std::unique_ptr<InMemChunkedNodeGroup>& nodeGroup, offset_t startIndexInGroup) const {
+    // Create a new chunked node group and move the unwritten values to it
+    // TODO(bmwinger): Can probably re-use the chunk and shift the values
+    const auto oldNodeGroup = std::move(nodeGroup);
+    const auto nodeInfo = info->ptrCast<NodeBatchInsertInfo>();
+    nodeGroup = std::make_unique<InMemChunkedNodeGroup>(*mm, nodeInfo->columnTypes,
+        nodeInfo->compressionEnabled, StorageConfig::NODE_GROUP_SIZE, 0);
+    nodeGroup->append(*oldNodeGroup, startIndexInGroup,
+        oldNodeGroup->getNumRows() - startIndexInGroup);
+}
+
+void NodeBatchInsert::writeAndResetNodeGroup(transaction::Transaction* transaction,
+    std::unique_ptr<InMemChunkedNodeGroup>& nodeGroup, std::optional<IndexBuilder>& indexBuilder,
+    MemoryManager* mm, PageAllocator& pageAllocator) const {
+    const auto nodeLocalState = localState->ptrCast<NodeBatchInsertLocalState>();
+    KU_ASSERT(nodeLocalState->errorHandler.has_value());
+    writeAndResetNodeGroup(transaction, nodeGroup, indexBuilder, mm,
+        nodeLocalState->errorHandler.value(), pageAllocator);
+}
+
+void NodeBatchInsert::writeAndResetNodeGroup(transaction::Transaction* transaction,
+    std::unique_ptr<InMemChunkedNodeGroup>& nodeGroup, std::optional<IndexBuilder>& indexBuilder,
+    MemoryManager* mm, NodeBatchInsertErrorHandler& errorHandler,
+    PageAllocator& pageAllocator) const {
+    const auto nodeSharedState = ku_dynamic_cast<NodeBatchInsertSharedState*>(sharedState.get());
+    const auto nodeTable = ku_dynamic_cast<NodeTable*>(sharedState->table);
+
+    uint64_t nodeOffset{};
+    uint64_t numRowsWritten{};
+    {
+        // The chunked group in batch insert may contain extra data to populate error messages
+        // When we append to the table we only want the main data so this class is used to slice the
+        // original chunked group
+        // The slice must be restored even if an exception is thrown to prevent other threads from
+        // reading invalid data
+        InMemChunkedNodeGroup sliceToWriteToDisk{*nodeGroup, info->outputDataColumns};
+        FinallyWrapper sliceRestorer{
+            [&]() { nodeGroup->merge(sliceToWriteToDisk, info->outputDataColumns); }};
+        std::tie(nodeOffset, numRowsWritten) = nodeTable->appendToLastNodeGroup(transaction,
+            info->insertColumnIDs, sliceToWriteToDisk, pageAllocator);
+    }
+
+    if (indexBuilder) {
+        std::vector<ColumnChunkData*> warningChunkData;
+        for (const auto warningDataColumn : info->warningDataColumns) {
+            warningChunkData.push_back(&nodeGroup->getColumnChunk(warningDataColumn));
+        }
+        indexBuilder->insert(nodeGroup->getColumnChunk(nodeSharedState->pkColumnID),
+            warningChunkData, nodeOffset, numRowsWritten, errorHandler);
+    }
+    if (numRowsWritten == nodeGroup->getNumRows()) {
+        nodeGroup->resetToEmpty();
+    } else {
+        clearToIndex(mm, nodeGroup, numRowsWritten);
+    }
+}
+
+void NodeBatchInsert::appendIncompleteNodeGroup(transaction::Transaction* transaction,
+    std::unique_ptr<InMemChunkedNodeGroup> localNodeGroup,
+    std::optional<IndexBuilder>& indexBuilder, MemoryManager* mm) const {
+    std::unique_lock xLck{sharedState->mtx};
+    const auto nodeLocalState = ku_dynamic_cast<NodeBatchInsertLocalState*>(localState.get());
+    const auto nodeSharedState = ku_dynamic_cast<NodeBatchInsertSharedState*>(sharedState.get());
+    if (!nodeSharedState->sharedNodeGroup) {
+        nodeSharedState->sharedNodeGroup = std::move(localNodeGroup);
+        return;
+    }
+    uint64_t numNodesAppended = 0;
+    while (numNodesAppended < localNodeGroup->getNumRows()) {
+        if (nodeSharedState->sharedNodeGroup->isFull()) {
+            writeAndResetNodeGroup(transaction, nodeSharedState->sharedNodeGroup, indexBuilder, mm,
+                *nodeLocalState->optimisticAllocator);
+        }
+        numNodesAppended += nodeSharedState->sharedNodeGroup->append(*localNodeGroup,
+            numNodesAppended /* offsetInNodeGroup */,
+            localNodeGroup->getNumRows() - numNodesAppended);
+    }
+    KU_ASSERT(numNodesAppended == localNodeGroup->getNumRows());
+}
+
+void NodeBatchInsert::finalize(ExecutionContext* context) {
+    KU_ASSERT(localState == nullptr);
+    const auto nodeSharedState = ku_dynamic_cast<NodeBatchInsertSharedState*>(sharedState.get());
+    auto errorHandler = createErrorHandler(context);
+    auto clientContext = context->clientContext;
+    auto transaction = Transaction::Get(*clientContext);
+    auto& pageAllocator = *transaction->getLocalStorage()->addOptimisticAllocator();
+    if (nodeSharedState->sharedNodeGroup) {
+        while (nodeSharedState->sharedNodeGroup->getNumRows() > 0) {
+            writeAndResetNodeGroup(transaction, nodeSharedState->sharedNodeGroup,
+                nodeSharedState->globalIndexBuilder, MemoryManager::Get(*clientContext),
+                errorHandler, pageAllocator);
+        }
+    }
+    if (nodeSharedState->globalIndexBuilder) {
+        nodeSharedState->globalIndexBuilder->finalize(context, errorHandler);
+        errorHandler.flushStoredErrors();
+    }
+
+    auto& nodeTable = nodeSharedState->table->cast<NodeTable>();
+    for (auto& index : nodeTable.getIndexes()) {
+        index.finalize(clientContext);
+    }
+    // we want to flush all index errors before children call finalize
+    // as the children (if they are table function calls) are responsible for populating the errors
+    // and sending it to the warning context
+    PhysicalOperator::finalize(context);
+
+    // if the child is a subquery it will not send the errors to the warning context
+    // sends any remaining warnings in this case
+    // if the child is a table function call it will have already sent the warnings so this line
+    // will do nothing
+    WarningContext::Get(*clientContext)->defaultPopulateAllWarnings(context->queryID);
+}
+
+void NodeBatchInsert::finalizeInternal(ExecutionContext* context) {
+    auto outputMsg = stringFormat("{} tuples have been copied to the {} table.",
+        sharedState->getNumRows() - sharedState->getNumErroredRows(), info->tableName);
+    auto clientContext = context->clientContext;
+    FactorizedTableUtils::appendStringToTable(sharedState->fTable.get(), outputMsg,
+        MemoryManager::Get(*clientContext));
+
+    const auto warningCount =
+        WarningContext::Get(*clientContext)->getWarningCount(context->queryID);
+    if (warningCount > 0) {
+        auto warningMsg =
+            stringFormat("{} warnings encountered during copy. Use 'CALL "
+                         "show_warnings() RETURN *' to view the actual warnings. Query ID: {}",
+                warningCount, context->queryID);
+        FactorizedTableUtils::appendStringToTable(sharedState->fTable.get(), warningMsg,
+            MemoryManager::Get(*clientContext));
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/node_batch_insert_error_handler.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/node_batch_insert_error_handler.cpp
new file mode 100644
index 0000000000..b39caf0ec4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/node_batch_insert_error_handler.cpp
@@ -0,0 +1,37 @@
+#include "processor/operator/persistent/node_batch_insert_error_handler.h"
+
+#include "processor/execution_context.h"
+#include "storage/table/node_table.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+NodeBatchInsertErrorHandler::NodeBatchInsertErrorHandler(ExecutionContext* context,
+    LogicalTypeID pkType, storage::NodeTable* nodeTable, bool ignoreErrors,
+    std::shared_ptr<row_idx_t> sharedErrorCounter, std::mutex* sharedErrorCounterMtx)
+    : nodeTable(nodeTable), context(context),
+      keyVector(std::make_shared<ValueVector>(pkType,
+          storage::MemoryManager::Get(*context->clientContext))),
+      offsetVector(std::make_shared<ValueVector>(LogicalTypeID::INTERNAL_ID,
+          storage::MemoryManager::Get(*context->clientContext))),
+      baseErrorHandler(context, ignoreErrors, sharedErrorCounter, sharedErrorCounterMtx) {
+    keyVector->state = DataChunkState::getSingleValueDataChunkState();
+    offsetVector->state = DataChunkState::getSingleValueDataChunkState();
+}
+
+void NodeBatchInsertErrorHandler::deleteCurrentErroneousRow() {
+    storage::NodeTableDeleteState deleteState{
+        *offsetVector,
+        *keyVector,
+    };
+    nodeTable->delete_(transaction::Transaction::Get(*context->clientContext), deleteState);
+}
+
+void NodeBatchInsertErrorHandler::flushStoredErrors() {
+    baseErrorHandler.flushStoredErrors();
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/CMakeLists.txt
new file mode 100644
index 0000000000..85bac2e6ae
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/CMakeLists.txt
@@ -0,0 +1,13 @@
+add_subdirectory(csv)
+add_subdirectory(npy)
+add_subdirectory(parquet)
+
+add_library(lbug_processor_operator_persistent_reader
+        OBJECT
+        copy_from_error.cpp
+        file_error_handler.cpp
+        reader_bind_utils.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_persistent_reader>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/copy_from_error.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/copy_from_error.cpp
new file mode 100644
index 0000000000..a7f3981116
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/copy_from_error.cpp
@@ -0,0 +1,76 @@
+#include "processor/operator/persistent/reader/copy_from_error.h"
+
+#include "common/vector/value_vector.h"
+#include "storage/table/column_chunk_data.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+template<DataSource T>
+static PhysicalTypeID getPhysicalTypeFromDataSource(T* data) {
+    if constexpr (std::is_same_v<T, storage::ColumnChunkData>) {
+        return data->getDataType().getPhysicalType();
+    } else if constexpr (std::is_same_v<T, ValueVector>) {
+        return data->dataType.getPhysicalType();
+    } else {
+        KU_UNREACHABLE;
+    }
+}
+
+template<DataSource T>
+WarningSourceData::DataType getValueFromData(T* data, common::idx_t pos) {
+    // avoid using TypeUtils::visit here to avoid the overhead from constructing a capturing lambda
+    switch (getPhysicalTypeFromDataSource(data)) {
+    case common::PhysicalTypeID::UINT64:
+        return data->template getValue<uint64_t>(pos);
+    case common::PhysicalTypeID::UINT32:
+        return data->template getValue<uint32_t>(pos);
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+WarningSourceData::WarningSourceData(uint64_t numValues) : numValues(numValues) {
+    KU_ASSERT(numValues <= values.size());
+}
+
+template<DataSource T>
+WarningSourceData WarningSourceData::constructFromData(const std::vector<T*>& data,
+    common::idx_t pos) {
+    KU_ASSERT(data.size() >= CopyConstants::SHARED_WARNING_DATA_NUM_COLUMNS &&
+              data.size() <= CopyConstants::MAX_NUM_WARNING_DATA_COLUMNS);
+    WarningSourceData ret{data.size()};
+    for (idx_t i = 0; i < data.size(); ++i) {
+        ret.values[i] = getValueFromData(data[i], pos);
+    }
+    return ret;
+}
+
+uint64_t WarningSourceData::getBlockIdx() const {
+    return std::get<uint64_t>(values[BLOCK_IDX_IDX]);
+}
+uint32_t WarningSourceData::getOffsetInBlock() const {
+    return std::get<uint32_t>(values[OFFSET_IN_BLOCK_IDX]);
+}
+
+template WarningSourceData WarningSourceData::constructFromData<storage::ColumnChunkData>(
+    const std::vector<storage::ColumnChunkData*>& data, common::idx_t pos);
+template WarningSourceData WarningSourceData::constructFromData<ValueVector>(
+    const std::vector<ValueVector*>& data, common::idx_t pos);
+
+CopyFromFileError::CopyFromFileError(std::string message, WarningSourceData warningData,
+    bool completedLine, bool mustThrow)
+    : message(std::move(message)), completedLine(completedLine), warningData(warningData),
+      mustThrow(mustThrow) {}
+
+bool CopyFromFileError::operator<(const CopyFromFileError& o) const {
+    if (warningData.getBlockIdx() == o.warningData.getBlockIdx()) {
+        return warningData.getOffsetInBlock() < o.warningData.getOffsetInBlock();
+    }
+    return warningData.getBlockIdx() < o.warningData.getBlockIdx();
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/CMakeLists.txt
new file mode 100644
index 0000000000..23592dfd1d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/CMakeLists.txt
@@ -0,0 +1,11 @@
+add_library(lbug_processor_operator_csv_reader
+        OBJECT
+        base_csv_reader.cpp
+        driver.cpp
+        parallel_csv_reader.cpp
+        serial_csv_reader.cpp
+        dialect_detection.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_csv_reader>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/base_csv_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/base_csv_reader.cpp
new file mode 100644
index 0000000000..019d878139
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/base_csv_reader.cpp
@@ -0,0 +1,588 @@
+#include "processor/operator/persistent/reader/csv/base_csv_reader.h"
+
+#include <vector>
+
+#include "common/file_system/virtual_file_system.h"
+#include "common/string_format.h"
+#include "common/string_utils.h"
+#include "common/system_message.h"
+#include "common/utils.h"
+#include "main/client_context.h"
+#include "processor/operator/persistent/reader/csv/driver.h"
+#include "processor/operator/persistent/reader/file_error_handler.h"
+#include "utf8proc_wrapper.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+// TODO(Royi) for performance reasons we may want to reduce the number of fields here since each
+// field is essentially an extra column during copy
+struct CSVWarningSourceData {
+    CSVWarningSourceData() = default;
+    static CSVWarningSourceData constructFrom(const processor::WarningSourceData& warningData);
+
+    uint64_t startByteOffset;
+    uint64_t endByteOffset;
+    uint64_t blockIdx;
+    uint32_t offsetInBlock;
+    common::idx_t fileIdx;
+};
+
+CSVWarningSourceData CSVWarningSourceData::constructFrom(
+    const processor::WarningSourceData& warningData) {
+    KU_ASSERT(warningData.numValues == CopyConstants::CSV_WARNING_DATA_NUM_COLUMNS);
+
+    CSVWarningSourceData ret{};
+    warningData.dumpTo(ret.blockIdx, ret.offsetInBlock, ret.startByteOffset, ret.endByteOffset,
+        ret.fileIdx);
+    return ret;
+}
+
+BaseCSVReader::BaseCSVReader(const std::string& filePath, common::idx_t fileIdx,
+    common::CSVOption option, CSVColumnInfo columnInfo, main::ClientContext* context,
+    LocalFileErrorHandler* errorHandler)
+    : context{context}, option{std::move(option)}, columnInfo{std::move(columnInfo)},
+      currentBlockIdx(0), numRowsInCurrentBlock(0), curRowIdx(0), numErrors(0), buffer{nullptr},
+      bufferIdx(0), bufferSize{0}, position{0}, lineContext(), osFileOffset{0}, fileIdx(fileIdx),
+      errorHandler(errorHandler), rowEmpty{false} {
+    fileInfo = VirtualFileSystem::GetUnsafe(*context)->openFile(filePath,
+        FileOpenFlags(FileFlags::READ_ONLY
+#ifdef _WIN32
+                      | FileFlags::BINARY
+#endif
+            ),
+        context);
+}
+
+bool BaseCSVReader::isEOF() const {
+    return getFileOffset() >= fileInfo->getFileSize();
+}
+
+uint64_t BaseCSVReader::getFileSize() {
+    return fileInfo->getFileSize();
+}
+
+template<typename Driver>
+bool BaseCSVReader::addValue(Driver& driver, uint64_t rowNum, column_id_t columnIdx,
+    std::string_view strVal, std::vector<uint64_t>& escapePositions) {
+    std::string valueToAdd;
+    // insert the line number into the chunk
+    if (!escapePositions.empty()) {
+        // remove escape characters (if any)
+        std::string newVal = "";
+        uint64_t prevPos = 0;
+        for (auto i = 0u; i < escapePositions.size(); i++) {
+            auto nextPos = escapePositions[i];
+            newVal += strVal.substr(prevPos, nextPos - prevPos);
+            prevPos = nextPos + 1;
+        }
+        newVal += strVal.substr(prevPos, strVal.size() - prevPos);
+        escapePositions.clear();
+        valueToAdd = newVal;
+    } else {
+        valueToAdd = strVal;
+    }
+    if (!utf8proc::Utf8Proc::isValid(valueToAdd.data(), valueToAdd.length())) {
+        handleCopyException("Invalid UTF8-encoded string.", true /* mustThrow */);
+    }
+    return driver.addValue(rowNum, columnIdx, valueToAdd);
+}
+
+struct SkipRowDriver {
+    DriverType driverType = DriverType::SKIP_ROW;
+    explicit SkipRowDriver(uint64_t skipNum) : skipNum{skipNum} {}
+    bool done(uint64_t rowNum) const { return rowNum >= skipNum; }
+    bool addRow(uint64_t, column_id_t, std::optional<WarningDataWithColumnInfo>) { return true; }
+    bool addValue(uint64_t, column_id_t, std::string_view) { return true; }
+
+    uint64_t skipNum;
+};
+
+BaseCSVReader::parse_result_t BaseCSVReader::handleFirstBlock() {
+    uint64_t numRowsRead = 0;
+    uint64_t numErrors = 0;
+    readBOM();
+    if (option.skipNum > 0) {
+        SkipRowDriver driver{option.skipNum};
+        const auto parseResult = parseCSV(driver);
+        numRowsRead += parseResult.first;
+        numErrors += parseResult.second;
+    }
+    if (option.hasHeader) {
+        const auto parseResult = readHeader();
+        numRowsRead += parseResult.first;
+        numErrors += parseResult.second;
+    }
+    return {numRowsRead, numErrors};
+}
+
+void BaseCSVReader::readBOM() {
+    if (!maybeReadBuffer(nullptr)) {
+        return;
+    }
+    if (bufferSize >= 3 && buffer[0] == '\xEF' && buffer[1] == '\xBB' && buffer[2] == '\xBF') {
+        position = 3;
+    }
+}
+
+// Dummy driver that just skips a row.
+struct HeaderDriver {
+    DriverType driverType = DriverType::HEADER;
+    bool done(uint64_t) { return true; }
+    bool addRow(uint64_t, column_id_t, std::optional<WarningDataWithColumnInfo>) { return true; }
+    bool addValue(uint64_t, column_id_t, std::string_view) { return true; }
+};
+
+void BaseCSVReader::resetNumRowsInCurrentBlock() {
+    numRowsInCurrentBlock = 0;
+}
+
+void BaseCSVReader::increaseNumRowsInCurrentBlock(uint64_t numRows, uint64_t numErrors) {
+    numRowsInCurrentBlock += numRows + numErrors;
+}
+
+uint64_t BaseCSVReader::getNumRowsInCurrentBlock() const {
+    return numRowsInCurrentBlock;
+}
+
+uint32_t BaseCSVReader::getRowOffsetInCurrentBlock() const {
+    return safeIntegerConversion<uint32_t>(numRowsInCurrentBlock + curRowIdx + numErrors);
+}
+
+BaseCSVReader::parse_result_t BaseCSVReader::readHeader() {
+    HeaderDriver driver;
+    return parseCSV(driver);
+}
+
+bool BaseCSVReader::readBuffer(uint64_t* start) {
+    std::unique_ptr<char[]> oldBuffer = std::move(buffer);
+
+    // the remaining part of the last buffer
+    uint64_t remaining = 0;
+    if (start != nullptr) {
+        KU_ASSERT(*start <= bufferSize);
+        remaining = bufferSize - *start;
+    }
+
+    uint64_t bufferReadSize = CopyConstants::INITIAL_BUFFER_SIZE;
+    while (remaining > bufferReadSize) {
+        bufferReadSize *= 2;
+    }
+
+    buffer = std::unique_ptr<char[]>(new char[bufferReadSize + remaining + 1]());
+    if (remaining > 0) {
+        // remaining from last buffer: copy it here
+        KU_ASSERT(start != nullptr);
+        memcpy(buffer.get(), oldBuffer.get() + *start, remaining);
+    }
+    auto readCount = fileInfo->readFile(buffer.get() + remaining, bufferReadSize);
+    if (readCount == -1) {
+        // LCOV_EXCL_START
+        lineContext.setEndOfLine(getFileOffset());
+        handleCopyException(stringFormat("Could not read from file: {}", posixErrMessage()), true);
+        // LCOV_EXCL_STOP
+    }
+
+    // Update buffer size in a way so that the invariant osFileOffset >= bufferSize is never broken
+    // This is needed because in the serial CSV reader the progressFunc can call getFileOffset from
+    // a different thread
+    bufferSize = remaining;
+    osFileOffset += readCount;
+    bufferSize += readCount;
+
+    buffer[bufferSize] = '\0';
+    if (start != nullptr) {
+        *start = 0;
+    }
+    position = remaining;
+    ++bufferIdx;
+    return readCount > 0;
+}
+
+std::string BaseCSVReader::reconstructLine(uint64_t startPosition, uint64_t endPosition,
+    bool completeLine) {
+    KU_ASSERT(endPosition >= startPosition);
+
+    std::string res;
+    // For cases where we cannot perform a seek (e.g. compressed file system) we just return an
+    // empty string
+    if (fileInfo->canPerformSeek()) {
+        res.resize(endPosition - startPosition);
+        fileInfo->readFromFile(res.data(), res.size(), startPosition);
+
+        const char* incompleteLineSuffix = completeLine ? "" : "...";
+        res += incompleteLineSuffix;
+    }
+
+    return StringUtils::ltrimNewlines(StringUtils::rtrimNewlines(res));
+}
+
+void BaseCSVReader::skipCurrentLine() {
+    do {
+        for (; position < bufferSize; ++position) {
+            if (isNewLine(buffer[position])) {
+                while (position < bufferSize && isNewLine(buffer[position])) {
+                    ++position;
+                }
+                return;
+            }
+        }
+    } while (maybeReadBuffer(nullptr));
+}
+
+void BaseCSVReader::handleCopyException(const std::string& message, bool mustThrow) {
+    auto endByteOffset = lineContext.endByteOffset;
+    if (!lineContext.isCompleteLine) {
+        endByteOffset = getFileOffset();
+    }
+    CopyFromFileError error{message,
+        WarningSourceData::constructFrom(currentBlockIdx, getRowOffsetInCurrentBlock(),
+            lineContext.startByteOffset, endByteOffset, fileIdx),
+        lineContext.isCompleteLine, mustThrow};
+    errorHandler->handleError(error);
+
+    // if we reach here it means we are ignoring the error
+    ++numErrors;
+}
+
+template<typename Driver>
+static std::optional<WarningDataWithColumnInfo> getOptionalWarningData(
+    const CSVColumnInfo& columnInfo, const CSVOption& option,
+    WarningSourceData&& warningSourceData) {
+    std::optional<WarningDataWithColumnInfo> warningData;
+
+    // we only care about populating the extra warning data when actually parsing the CSV
+    // and not when performing actions like sniffing
+    if constexpr (std::is_same_v<Driver, ParallelParsingDriver> ||
+                  std::is_same_v<Driver, SerialParsingDriver>) {
+        // For now we only populate extra warning data when IGNORE_ERRORS is enabled
+        if (option.ignoreErrors) {
+            KU_ASSERT(
+                columnInfo.numWarningDataColumns == CopyConstants::CSV_WARNING_DATA_NUM_COLUMNS);
+            warningData.emplace(warningSourceData, columnInfo.numColumns);
+        }
+    }
+    return warningData;
+}
+
+WarningSourceData BaseCSVReader::getWarningSourceData() const {
+    return WarningSourceData::constructFrom(currentBlockIdx, getRowOffsetInCurrentBlock(),
+        lineContext.startByteOffset, lineContext.endByteOffset, fileIdx);
+}
+
+template<typename Driver>
+BaseCSVReader::parse_result_t BaseCSVReader::parseCSV(Driver& driver) {
+    KU_ASSERT(nullptr != errorHandler);
+
+    // used for parsing algorithm
+    curRowIdx = 0;
+    numErrors = 0;
+
+    while (true) {
+        column_id_t column = 0;
+        auto start = position.load();
+        bool hasQuotes = false;
+        std::vector<uint64_t> escapePositions;
+        lineContext.setNewLine(getFileOffset());
+
+        // read values into the buffer (if any)
+        if (!maybeReadBuffer(&start)) {
+            return {curRowIdx, numErrors};
+        }
+
+        // start parsing the first value
+        goto value_start;
+    value_start:
+        // state: value_start
+        // this state parses the first character of a value
+        if (buffer[position] == option.quoteChar) {
+            [[unlikely]]
+            // quote: actual value starts in the next position
+            // move to in_quotes state
+            start = position + 1;
+            hasQuotes = true;
+            goto in_quotes;
+        } else {
+            // no quote, move to normal parsing state
+            start = position;
+            hasQuotes = false;
+            goto normal;
+        }
+    normal:
+        // state: normal parsing state
+        // this state parses the remainder of a non-quoted value until we reach a delimiter or
+        // newline
+        do {
+            for (; position < bufferSize; position++) {
+                if (buffer[position] == option.delimiter) {
+                    // delimiter: end the value and add it to the chunk
+                    goto add_value;
+                } else if (isNewLine(buffer[position])) {
+                    // newline: add row
+                    goto add_row;
+                }
+            }
+        } while (readBuffer(&start));
+
+        [[unlikely]]
+        // file ends during normal scan: go to end state
+        goto final_state;
+    add_value:
+        // We get here after we have a delimiter.
+        KU_ASSERT(buffer[position] == option.delimiter ||
+                  buffer[position] == CopyConstants::DEFAULT_CSV_LIST_END_CHAR);
+        // Trim one character if we have quotes.
+        if (!addValue(driver, curRowIdx, column,
+                std::string_view(buffer.get() + start, position - start - hasQuotes),
+                escapePositions)) {
+            goto ignore_error;
+        }
+        column++;
+
+        // Move past the delimiter.
+        ++position;
+        // Adjust start for MaybeReadBuffer.
+        start = position;
+        if (!maybeReadBuffer(&start)) {
+            [[unlikely]]
+            // File ends right after delimiter, go to final state
+            goto final_state;
+        }
+        goto value_start;
+    add_row: {
+        // We get here after we have a newline.
+        KU_ASSERT(isNewLine(buffer[position]));
+        lineContext.setEndOfLine(getFileOffset());
+        bool isCarriageReturn = buffer[position] == '\r';
+        if (!addValue(driver, curRowIdx, column,
+                std::string_view(buffer.get() + start, position - start - hasQuotes),
+                escapePositions)) {
+            goto ignore_error;
+        }
+        column++;
+
+        curRowIdx += driver.addRow(curRowIdx, column,
+            getOptionalWarningData<Driver>(columnInfo, option, getWarningSourceData()));
+
+        column = 0;
+        position++;
+        // Adjust start for ReadBuffer.
+        start = position;
+        lineContext.setNewLine(getFileOffset());
+        if (!maybeReadBuffer(&start)) {
+            // File ends right after newline, go to final state.
+            goto final_state;
+        }
+        if (isCarriageReturn) {
+            // \r newline, go to special state that parses an optional \n afterwards
+            goto carriage_return;
+        } else {
+            if (driver.done(curRowIdx)) {
+                return {curRowIdx, numErrors};
+            }
+            goto value_start;
+        }
+    }
+    in_quotes:
+        // this state parses the remainder of a quoted value.
+        position++;
+        do {
+            for (; position < bufferSize; position++) {
+                if (driver.driverType == DriverType::SNIFF_CSV_DIALECT) {
+                    auto& sniffDriver = reinterpret_cast<SniffCSVDialectDriver&>(driver);
+                    sniffDriver.setEverQuoted();
+                }
+                if (buffer[position] == option.quoteChar) {
+                    // quote: move to unquoted state
+                    goto unquote;
+                } else if (buffer[position] == option.escapeChar) {
+                    // escape: store the escaped position and move to handle_escape state
+                    escapePositions.push_back(position - start);
+                    goto handle_escape;
+                } else if (isNewLine(buffer[position])) {
+                    [[unlikely]] if (!handleQuotedNewline()) { goto ignore_error; }
+                }
+            }
+        } while (readBuffer(&start));
+        [[unlikely]]
+        // still in quoted state at the end of the file, error:
+        lineContext.setEndOfLine(getFileOffset());
+        if (driver.driverType == DriverType::SNIFF_CSV_DIALECT) {
+            auto& sniffDriver = reinterpret_cast<SniffCSVDialectDriver&>(driver);
+            sniffDriver.setError();
+        } else {
+            handleCopyException("unterminated quotes.");
+        }
+        // we are ignoring this error, skip current row and restart state machine
+        goto ignore_error;
+    unquote:
+        KU_ASSERT(hasQuotes && buffer[position] == option.quoteChar);
+        // this state handles the state directly after we unquote
+        // in this state we expect either another quote (entering the quoted state again, and
+        // escaping the quote) or a delimiter/newline, ending the current value and moving on to the
+        // next value
+        position++;
+        if (!maybeReadBuffer(&start)) {
+            // file ends right after unquote, go to final state
+            goto final_state;
+        }
+        if (buffer[position] == option.quoteChar &&
+            (!option.escapeChar || option.escapeChar == option.quoteChar)) {
+            // the escapeChar is used correctly, record this for DialectSniff
+            if (driver.driverType == DriverType::SNIFF_CSV_DIALECT) {
+                auto& sniffDriver = reinterpret_cast<SniffCSVDialectDriver&>(driver);
+                sniffDriver.setEverEscaped();
+            }
+            // escaped quote, return to quoted state and store escape position
+            escapePositions.push_back(position - start);
+            goto in_quotes;
+        } else if (buffer[position] == option.delimiter ||
+                   buffer[position] == CopyConstants::DEFAULT_CSV_LIST_END_CHAR) {
+            // delimiter, add value
+            goto add_value;
+        } else if (isNewLine(buffer[position])) {
+            goto add_row;
+        } else {
+            if (driver.driverType == DriverType::SNIFF_CSV_DIALECT) {
+                auto& sniffDriver = reinterpret_cast<SniffCSVDialectDriver&>(driver);
+                sniffDriver.setError();
+            } else {
+                [[unlikely]] handleCopyException("quote should be followed by "
+                                                 "end of file, end of value, end of "
+                                                 "row or another quote.");
+            }
+            goto ignore_error;
+        }
+    handle_escape:
+        // state: handle_escape
+        // escape should be followed by a quote or another escape character
+        position++;
+        if (!maybeReadBuffer(&start)) {
+            [[unlikely]] lineContext.setEndOfLine(getFileOffset());
+            if (driver.driverType == DriverType::SNIFF_CSV_DIALECT) {
+                auto& sniffDriver = reinterpret_cast<SniffCSVDialectDriver&>(driver);
+                sniffDriver.setError();
+            } else {
+                handleCopyException("escape at end of file.");
+            }
+            goto ignore_error;
+        }
+        if (buffer[position] != option.quoteChar && buffer[position] != option.escapeChar) {
+            ++position; // consume the invalid char
+            if (driver.driverType == DriverType::SNIFF_CSV_DIALECT) {
+                auto& sniffDriver = reinterpret_cast<SniffCSVDialectDriver&>(driver);
+                sniffDriver.setError();
+            } else {
+                [[unlikely]] handleCopyException(
+                    "neither QUOTE nor ESCAPE is proceeded by ESCAPE.");
+            }
+            goto ignore_error;
+        }
+        // the escapeChar is used correctly, record this for DialectSniff
+        if (driver.driverType == DriverType::SNIFF_CSV_DIALECT) {
+            auto& sniffDriver = reinterpret_cast<SniffCSVDialectDriver&>(driver);
+            sniffDriver.setEverEscaped();
+        }
+        // escape was followed by quote or escape, go back to quoted state
+        goto in_quotes;
+    carriage_return:
+        // this stage optionally skips a newline (\n) character, which allows \r\n to be interpreted
+        // as a single line
+
+        // position points to the character after the carriage return.
+        if (buffer[position] == '\n') {
+            // newline after carriage return: skip
+            // increase position by 1 and move start to the new position
+            start = ++position;
+            if (!maybeReadBuffer(&start)) {
+                // file ends right after newline, go to final state
+                goto final_state;
+            }
+        }
+        if (driver.done(curRowIdx)) {
+            return {curRowIdx, numErrors};
+        }
+
+        goto value_start;
+    final_state:
+        // We get here when the file ends.
+        // If we were mid-value, add the remaining value to the chunk.
+        lineContext.setEndOfLine(getFileOffset());
+        if (position > start) {
+            // Add remaining value to chunk.
+            if (!addValue(driver, curRowIdx, column,
+                    std::string_view(buffer.get() + start, position - start - hasQuotes),
+                    escapePositions)) {
+                return {curRowIdx, numErrors};
+            }
+            column++;
+        }
+        if (column > 0) {
+            curRowIdx += driver.addRow(curRowIdx, column,
+                getOptionalWarningData<Driver>(columnInfo, option, getWarningSourceData()));
+        }
+        return {curRowIdx, numErrors};
+    ignore_error:
+        // we skip the current row then restart the state machine to continue parsing
+        skipCurrentLine();
+        if (driver.done(curRowIdx)) {
+            return {curRowIdx, numErrors};
+        }
+        continue;
+    }
+    KU_UNREACHABLE;
+}
+
+column_id_t BaseCSVReader::appendWarningDataColumns(std::vector<std::string>& resultColumnNames,
+    std::vector<common::LogicalType>& resultColumnTypes, const common::FileScanInfo& fileScanInfo) {
+    const bool ignoreErrors = fileScanInfo.getOption(CopyConstants::IGNORE_ERRORS_OPTION_NAME,
+        CopyConstants::DEFAULT_IGNORE_ERRORS);
+    column_id_t numWarningDataColumns = 0;
+    if (ignoreErrors) {
+        numWarningDataColumns = CopyConstants::CSV_WARNING_DATA_NUM_COLUMNS;
+        for (idx_t i = 0; i < CopyConstants::CSV_WARNING_DATA_NUM_COLUMNS; ++i) {
+            resultColumnNames.emplace_back(CopyConstants::CSV_WARNING_DATA_COLUMN_NAMES[i]);
+            resultColumnTypes.emplace_back(CopyConstants::CSV_WARNING_DATA_COLUMN_TYPES[i]);
+        }
+    }
+    return numWarningDataColumns;
+}
+
+PopulatedCopyFromError BaseCSVReader::basePopulateErrorFunc(CopyFromFileError error,
+    const SharedFileErrorHandler* sharedErrorHandler, BaseCSVReader* reader, std::string filePath) {
+    const auto warningData = CSVWarningSourceData::constructFrom(error.warningData);
+    const auto lineNumber =
+        sharedErrorHandler->getLineNumber(warningData.blockIdx, warningData.offsetInBlock);
+    return PopulatedCopyFromError{
+        .message = std::move(error.message),
+        .filePath = std::move(filePath),
+        .skippedLineOrRecord = reader->reconstructLine(warningData.startByteOffset,
+            warningData.endByteOffset, error.completedLine),
+        .lineNumber = lineNumber,
+    };
+}
+
+common::idx_t BaseCSVReader::getFileIdxFunc(const CopyFromFileError& error) {
+    return CSVWarningSourceData::constructFrom(error.warningData).fileIdx;
+}
+
+template BaseCSVReader::parse_result_t BaseCSVReader::parseCSV<ParallelParsingDriver>(
+    ParallelParsingDriver&);
+template BaseCSVReader::parse_result_t BaseCSVReader::parseCSV<SerialParsingDriver>(
+    SerialParsingDriver&);
+template BaseCSVReader::parse_result_t BaseCSVReader::parseCSV<SniffCSVNameAndTypeDriver>(
+    SniffCSVNameAndTypeDriver&);
+template BaseCSVReader::parse_result_t BaseCSVReader::parseCSV<SniffCSVDialectDriver>(
+    SniffCSVDialectDriver&);
+template BaseCSVReader::parse_result_t BaseCSVReader::parseCSV<SniffCSVHeaderDriver>(
+    SniffCSVHeaderDriver&);
+
+uint64_t BaseCSVReader::getFileOffset() const {
+    KU_ASSERT(osFileOffset >= bufferSize);
+    return osFileOffset - bufferSize + position;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/dialect_detection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/dialect_detection.cpp
new file mode 100644
index 0000000000..9e108f3f59
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/dialect_detection.cpp
@@ -0,0 +1,46 @@
+#include "processor/operator/persistent/reader/csv/dialect_detection.h"
+
+namespace lbug {
+namespace processor {
+
+std::vector<DialectOption> generateDialectOptions(const common::CSVOption& option) {
+    std::vector<DialectOption> options;
+    std::string delimiters = "";
+    std::string quoteChars = "";
+    std::string escapeChars = "";
+
+    if (option.setDelim) {
+        delimiters += option.delimiter;
+    } else {
+        delimiters.assign(common::CopyConstants::DEFAULT_CSV_DELIMITER_SEARCH_SPACE.begin(),
+            common::CopyConstants::DEFAULT_CSV_DELIMITER_SEARCH_SPACE.end());
+    }
+
+    if (option.setQuote) {
+        quoteChars += option.quoteChar;
+    } else {
+        quoteChars.resize(common::CopyConstants::DEFAULT_CSV_QUOTE_SEARCH_SPACE.size());
+        quoteChars.assign(common::CopyConstants::DEFAULT_CSV_QUOTE_SEARCH_SPACE.begin(),
+            common::CopyConstants::DEFAULT_CSV_QUOTE_SEARCH_SPACE.end());
+    }
+
+    if (option.setEscape) {
+        escapeChars += option.escapeChar;
+    } else {
+        escapeChars.assign(common::CopyConstants::DEFAULT_CSV_ESCAPE_SEARCH_SPACE.begin(),
+            common::CopyConstants::DEFAULT_CSV_ESCAPE_SEARCH_SPACE.end());
+    }
+
+    for (auto& delim : delimiters) {
+        for (auto& quote : quoteChars) {
+            for (auto& escape : escapeChars) {
+                DialectOption option{delim, quote, escape};
+                options.push_back(option);
+            }
+        }
+    }
+    return options;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/driver.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/driver.cpp
new file mode 100644
index 0000000000..158a775e62
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/driver.cpp
@@ -0,0 +1,309 @@
+#include "processor/operator/persistent/reader/csv/driver.h"
+
+#include "common/string_format.h"
+#include "common/system_config.h"
+#include "function/cast/functions/cast_from_string_functions.h"
+#include "processor/operator/persistent/reader/csv/parallel_csv_reader.h"
+#include "processor/operator/persistent/reader/csv/serial_csv_reader.h"
+#include "utf8proc_wrapper.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+ParsingDriver::ParsingDriver(common::DataChunk& chunk, DriverType type /* = DriverType::PARSING */)
+    : driverType(type), chunk(chunk), rowEmpty(false) {}
+
+bool ParsingDriver::done(uint64_t rowNum) {
+    return rowNum >= DEFAULT_VECTOR_CAPACITY || doneEarly();
+}
+
+bool ParsingDriver::addValue(uint64_t rowNum, common::column_id_t columnIdx,
+    std::string_view value) {
+    uint64_t length = value.length();
+    if (length == 0 && columnIdx == 0) {
+        rowEmpty = true;
+    } else {
+        rowEmpty = false;
+    }
+    BaseCSVReader* reader = getReader();
+
+    if (columnIdx == reader->getNumColumns() && length == 0) {
+        // skip a single trailing delimiter in last columnIdx
+        return true;
+    }
+    if (columnIdx >= reader->getNumColumns()) {
+        reader->handleCopyException(
+            stringFormat("expected {} values per row, but got more.", reader->getNumColumns()));
+        return false;
+    }
+    if (reader->skipColumn(columnIdx)) {
+        return true;
+    }
+    try {
+        function::CastString::copyStringToVector(&chunk.getValueVectorMutable(columnIdx), rowNum,
+            value, &reader->option);
+    } catch (ConversionException& e) {
+        reader->handleCopyException(e.what());
+        return false;
+    }
+
+    return true;
+}
+
+bool ParsingDriver::addRow(uint64_t rowNum, common::column_id_t columnCount,
+    std::optional<WarningDataWithColumnInfo> warningDataWithColumnInfo) {
+    BaseCSVReader* reader = getReader();
+    if (rowEmpty) {
+        rowEmpty = false;
+        if (reader->getNumColumns() != 1) {
+            return false;
+        }
+        // Otherwise, treat it as null.
+    }
+    if (columnCount < reader->getNumColumns()) {
+        // Column number mismatch.
+        reader->handleCopyException(stringFormat("expected {} values per row, but got {}.",
+            reader->getNumColumns(), columnCount));
+        return false;
+    }
+
+    if (warningDataWithColumnInfo.has_value()) {
+        const auto warningDataStartColumn = warningDataWithColumnInfo->warningDataStartColumnIdx;
+        const auto numWarningDataColumns = warningDataWithColumnInfo->data.numValues;
+        KU_ASSERT(numWarningDataColumns == CopyConstants::CSV_WARNING_DATA_NUM_COLUMNS);
+        for (idx_t i = 0; i < numWarningDataColumns; ++i) {
+            const auto& warningData = warningDataWithColumnInfo->data.values[i];
+            const auto columnIdx = warningDataStartColumn + i;
+            KU_ASSERT(columnIdx < chunk.getNumValueVectors());
+            auto& vectorToSet = chunk.getValueVectorMutable(columnIdx);
+            std::visit(
+                [&vectorToSet, rowNum](
+                    auto warningDataField) { vectorToSet.setValue(rowNum, warningDataField); },
+                warningData);
+        }
+    }
+    return true;
+}
+
+ParallelParsingDriver::ParallelParsingDriver(common::DataChunk& chunk, ParallelCSVReader* reader)
+    : ParsingDriver(chunk, DriverType::PARALLEL), reader(reader) {}
+
+bool ParallelParsingDriver::doneEarly() {
+    return reader->finishedBlock();
+}
+
+BaseCSVReader* ParallelParsingDriver::getReader() {
+    return reader;
+}
+
+SerialParsingDriver::SerialParsingDriver(common::DataChunk& chunk, SerialCSVReader* reader,
+    DriverType type /*= DriverType::SERIAL*/)
+    : ParsingDriver(chunk, type), reader(reader) {}
+
+bool SerialParsingDriver::doneEarly() {
+    return false;
+}
+
+BaseCSVReader* SerialParsingDriver::getReader() {
+    return reader;
+}
+
+common::DataChunk& getDummyDataChunk() {
+    static common::DataChunk dummyChunk = DataChunk(); // static ensures it's created only once
+    return dummyChunk;
+}
+
+SniffCSVDialectDriver::SniffCSVDialectDriver(SerialCSVReader* reader)
+    : SerialParsingDriver(getDummyDataChunk(), reader, DriverType::SNIFF_CSV_DIALECT) {
+    auto& csvOption = reader->getCSVOption();
+    columnCounts = std::vector<idx_t>(csvOption.sampleSize, 0);
+}
+
+bool SniffCSVDialectDriver::addValue(uint64_t /*rowNum*/, common::column_id_t columnIdx,
+    std::string_view value) {
+    uint64_t length = value.length();
+    if (length == 0 && columnIdx == 0) {
+        rowEmpty = true;
+    } else {
+        rowEmpty = false;
+    }
+    if (columnIdx == reader->getNumColumns() && length == 0) {
+        // skip a single trailing delimiter in last columnIdx
+        return true;
+    }
+    currentColumnCount++;
+    return true;
+}
+
+bool SniffCSVDialectDriver::addRow(uint64_t /*rowNum*/, common::column_id_t /*columnCount*/,
+    std::optional<WarningDataWithColumnInfo> /*warningData*/) {
+    auto& csvOption = reader->getCSVOption();
+    if (rowEmpty) {
+        rowEmpty = false;
+        if (reader->getNumColumns() != 1) {
+            currentColumnCount = 0;
+            return false;
+        }
+        // Otherwise, treat it as null.
+    }
+    if (resultPosition < csvOption.sampleSize) {
+        columnCounts[resultPosition] = currentColumnCount;
+        currentColumnCount = 0;
+        resultPosition++;
+    }
+    return true;
+}
+
+bool SniffCSVDialectDriver::done(uint64_t rowNum) const {
+    auto& csvOption = reader->getCSVOption();
+    return (csvOption.hasHeader ? 1 : 0) + csvOption.sampleSize <= rowNum;
+}
+
+void SniffCSVDialectDriver::reset() {
+    columnCounts = std::vector<idx_t>(columnCounts.size(), 0);
+    currentColumnCount = 0;
+    error = false;
+    resultPosition = 0;
+    everQuoted = false;
+    everEscaped = false;
+}
+
+SniffCSVNameAndTypeDriver::SniffCSVNameAndTypeDriver(SerialCSVReader* reader,
+    const function::ExtraScanTableFuncBindInput* bindInput)
+    : SerialParsingDriver(getDummyDataChunk(), reader, DriverType::SNIFF_CSV_NAME_AND_TYPE) {
+    if (bindInput != nullptr) {
+        for (auto i = 0u; i < bindInput->expectedColumnNames.size(); i++) {
+            columns.push_back(
+                {bindInput->expectedColumnNames[i], bindInput->expectedColumnTypes[i].copy()});
+            sniffType.push_back(false);
+        }
+    }
+}
+
+bool SniffCSVNameAndTypeDriver::done(uint64_t rowNum) {
+    auto& csvOption = reader->getCSVOption();
+    bool finished = (csvOption.hasHeader ? 1 : 0) + csvOption.sampleSize <= rowNum;
+    // if the csv only has one row
+    if (finished && rowNum <= 1 && csvOption.autoDetection && !csvOption.setHeader) {
+        for (auto columnIdx = 0u; columnIdx < firstRow.size(); ++columnIdx) {
+            auto value = firstRow[columnIdx];
+            if (!utf8proc::Utf8Proc::isValid(value.data(), value.length())) {
+                reader->handleCopyException("Invalid UTF8-encoded string.", true /* mustThrow */);
+            }
+            std::string columnName = std::string(value);
+            LogicalType columnType = function::inferMinimalTypeFromString(value);
+            columns[columnIdx].first = columnName;
+            columns[columnIdx].second = std::move(columnType);
+        }
+    }
+    return finished;
+}
+
+bool SniffCSVNameAndTypeDriver::addValue(uint64_t rowNum, common::column_id_t columnIdx,
+    std::string_view value) {
+    uint64_t length = value.length();
+    if (length == 0 && columnIdx == 0) {
+        rowEmpty = true;
+    } else {
+        rowEmpty = false;
+    }
+    if (columnIdx == reader->getNumColumns() && length == 0) {
+        // skip a single trailing delimiter in last columnIdx
+        return true;
+    }
+    auto& csvOption = reader->getCSVOption();
+    if (columns.size() < columnIdx + 1 && csvOption.hasHeader && rowNum > 0) {
+        reader->handleCopyException(
+            stringFormat("expected {} values per row, but got more.", reader->getNumColumns()));
+    }
+    while (columns.size() < columnIdx + 1) {
+        columns.emplace_back(stringFormat("column{}", columns.size()), LogicalType::ANY());
+        sniffType.push_back(true);
+    }
+    if (rowNum == 0 && csvOption.hasHeader) {
+        // reading the header
+        std::string columnName(value);
+        LogicalType columnType(LogicalTypeID::ANY);
+        auto it = value.rfind(':');
+        if (it != std::string_view::npos) {
+            try {
+                columnType = LogicalType::convertFromString(std::string(value.substr(it + 1)),
+                    reader->getClientContext());
+                columnName = std::string(value.substr(0, it));
+                sniffType[columnIdx] = false;
+            } catch (const Exception&) { // NOLINT(bugprone-empty-catch):
+                                         // This is how we check for a suitable
+                                         // datatype name.
+                // Didn't parse, just use the whole name.
+            }
+        }
+        columns[columnIdx].first = columnName;
+        columns[columnIdx].second = std::move(columnType);
+    } else if (sniffType[columnIdx] &&
+               (rowNum != 0 || !csvOption.autoDetection || csvOption.setHeader)) {
+        // reading the body
+        LogicalType combinedType;
+        columns[columnIdx].second = LogicalTypeUtils::combineTypes(columns[columnIdx].second,
+            function::inferMinimalTypeFromString(value));
+        if (columns[columnIdx].second.getLogicalTypeID() == LogicalTypeID::STRING) {
+            sniffType[columnIdx] = false;
+        }
+    } else if (sniffType[columnIdx] &&
+               (rowNum == 0 && csvOption.autoDetection && !csvOption.setHeader)) {
+        // store the first line for later use
+        firstRow.push_back(std::string{value});
+    }
+
+    return true;
+}
+
+SniffCSVHeaderDriver::SniffCSVHeaderDriver(SerialCSVReader* reader,
+    const std::vector<std::pair<std::string, common::LogicalType>>& typeDetected)
+    : SerialParsingDriver(getDummyDataChunk(), reader, DriverType::SNIFF_CSV_HEADER) {
+    for (auto i = 0u; i < typeDetected.size(); i++) {
+        columns.push_back({typeDetected[i].first, typeDetected[i].second.copy()});
+    }
+}
+
+bool SniffCSVHeaderDriver::addValue(uint64_t /*rowNum*/, common::column_id_t columnIdx,
+    std::string_view value) {
+    uint64_t length = value.length();
+    if (length == 0 && columnIdx == 0) {
+        rowEmpty = true;
+    } else {
+        rowEmpty = false;
+    }
+    if (columnIdx == reader->getNumColumns() && length == 0) {
+        // skip a single trailing delimiter in last columnIdx
+        return true;
+    }
+
+    // reading the header
+    LogicalType columnType(LogicalTypeID::ANY);
+
+    columnType = function::inferMinimalTypeFromString(value);
+
+    // Store the value to Header vector for potential later use.
+    header.push_back({std::string(value), columnType.copy()});
+
+    // If we already determined has a header, just skip
+    if (detectedHeader) {
+        return true;
+    }
+
+    // If any of the column in the first row cannot be casted to its expected type, we have a
+    // header.
+    if (columnType.getLogicalTypeID() == LogicalTypeID::STRING &&
+        columnType.getLogicalTypeID() != columns[columnIdx].second.getLogicalTypeID() &&
+        LogicalTypeID::BLOB != columns[columnIdx].second.getLogicalTypeID() &&
+        LogicalTypeID::UNION != columns[columnIdx].second.getLogicalTypeID()) {
+        detectedHeader = true;
+    }
+
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/parallel_csv_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/parallel_csv_reader.cpp
new file mode 100644
index 0000000000..14039d29d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/parallel_csv_reader.cpp
@@ -0,0 +1,334 @@
+#include "processor/operator/persistent/reader/csv/parallel_csv_reader.h"
+
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "processor/execution_context.h"
+#include "processor/operator/persistent/reader/csv/serial_csv_reader.h"
+#include "processor/operator/persistent/reader/reader_bind_utils.h"
+
+#if defined(_WIN32)
+#include <io.h>
+#endif
+
+#include "common/string_format.h"
+#include "common/system_message.h"
+#include "function/table/table_function.h"
+#include "processor/operator/persistent/reader/csv/driver.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+ParallelCSVReader::ParallelCSVReader(const std::string& filePath, idx_t fileIdx, CSVOption option,
+    CSVColumnInfo columnInfo, main::ClientContext* context, LocalFileErrorHandler* errorHandler)
+    : BaseCSVReader{filePath, fileIdx, std::move(option), std::move(columnInfo), context,
+          errorHandler} {}
+
+bool ParallelCSVReader::hasMoreToRead() const {
+    // If we haven't started the first block yet or are done our block, get the next block.
+    return buffer != nullptr && !finishedBlock();
+}
+
+uint64_t ParallelCSVReader::parseBlock(block_idx_t blockIdx, DataChunk& resultChunk) {
+    currentBlockIdx = blockIdx;
+    resetNumRowsInCurrentBlock();
+    seekToBlockStart();
+    if (blockIdx == 0) {
+        readBOM();
+        if (option.hasHeader) {
+            const auto [numRowsRead, numErrors] = readHeader();
+            errorHandler->setHeaderNumRows(numRowsRead + numErrors);
+        }
+    }
+    if (finishedBlock()) {
+        return 0;
+    }
+    ParallelParsingDriver driver(resultChunk, this);
+    const auto [numRowsRead, numErrors] = parseCSV(driver);
+    increaseNumRowsInCurrentBlock(numRowsRead, numErrors);
+    return numRowsRead;
+}
+
+void ParallelCSVReader::reportFinishedBlock() {
+    errorHandler->reportFinishedBlock(currentBlockIdx, getNumRowsInCurrentBlock());
+}
+
+uint64_t ParallelCSVReader::continueBlock(DataChunk& resultChunk) {
+    KU_ASSERT(hasMoreToRead());
+    ParallelParsingDriver driver(resultChunk, this);
+    const auto [numRowsParsed, numErrors] = parseCSV(driver);
+    increaseNumRowsInCurrentBlock(numRowsParsed, numErrors);
+    return numRowsParsed;
+}
+
+void ParallelCSVReader::seekToBlockStart() {
+    // Seek to the proper location in the file.
+    if (fileInfo->seek(currentBlockIdx * CopyConstants::PARALLEL_BLOCK_SIZE, SEEK_SET) == -1) {
+        // LCOV_EXCL_START
+        handleCopyException(
+            stringFormat("Failed to seek to block {}: {}", currentBlockIdx, posixErrMessage()),
+            true);
+        // LCOV_EXCL_STOP
+    }
+    osFileOffset = currentBlockIdx * CopyConstants::PARALLEL_BLOCK_SIZE;
+
+    if (currentBlockIdx == 0) {
+        // First block doesn't search for a newline.
+        return;
+    }
+
+    // Reset the buffer.
+    position = 0;
+    bufferSize = 0;
+    buffer.reset();
+    if (!readBuffer(nullptr)) {
+        return;
+    }
+
+    // Find the start of the next line.
+    do {
+        for (; position < bufferSize; position++) {
+            if (buffer[position] == '\r') {
+                position++;
+                if (!maybeReadBuffer(nullptr)) {
+                    return;
+                }
+                if (buffer[position] == '\n') {
+                    position++;
+                }
+                return;
+            } else if (buffer[position] == '\n') {
+                position++;
+                return;
+            }
+        }
+    } while (readBuffer(nullptr));
+}
+
+bool ParallelCSVReader::handleQuotedNewline() {
+    lineContext.setEndOfLine(getFileOffset());
+    handleCopyException("Quoted newlines are not supported in parallel CSV reader."
+                        " Please specify PARALLEL=FALSE in the options.");
+    return false;
+}
+
+bool ParallelCSVReader::finishedBlock() const {
+    // Only stop if we've ventured into the next block by at least a byte.
+    // Use `>` because `position` points to just past the newline right now.
+    return getFileOffset() > (currentBlockIdx + 1) * CopyConstants::PARALLEL_BLOCK_SIZE;
+}
+
+ParallelCSVScanSharedState::ParallelCSVScanSharedState(FileScanInfo fileScanInfo, uint64_t numRows,
+    main::ClientContext* context, CSVOption csvOption, CSVColumnInfo columnInfo)
+    : ScanFileWithProgressSharedState{std::move(fileScanInfo), numRows, context},
+      csvOption{std::move(csvOption)}, columnInfo{std::move(columnInfo)}, numBlocksReadByFiles{0} {
+    errorHandlers.reserve(this->fileScanInfo.getNumFiles());
+    for (idx_t i = 0; i < this->fileScanInfo.getNumFiles(); ++i) {
+        errorHandlers.emplace_back(i, &mtx);
+    }
+    populateErrorFunc = constructPopulateFunc();
+    for (auto& errorHandler : errorHandlers) {
+        errorHandler.setPopulateErrorFunc(populateErrorFunc);
+    }
+}
+
+populate_func_t ParallelCSVScanSharedState::constructPopulateFunc() {
+    const auto numFiles = fileScanInfo.getNumFiles();
+    auto localErrorHandlers = std::vector<std::shared_ptr<LocalFileErrorHandler>>(numFiles);
+    auto readers = std::vector<std::shared_ptr<SerialCSVReader>>(numFiles);
+    for (idx_t i = 0; i < numFiles; ++i) {
+        // If we run into errors while reconstructing lines they should be unrecoverable
+        localErrorHandlers[i] =
+            std::make_shared<LocalFileErrorHandler>(&errorHandlers[i], false, context);
+        readers[i] = std::make_shared<SerialCSVReader>(fileScanInfo.filePaths[i], i,
+            csvOption.copy(), columnInfo.copy(), context, localErrorHandlers[i].get());
+    }
+    return [this, movedErrorHandlers = std::move(localErrorHandlers),
+               movedReaders = std::move(readers)](CopyFromFileError error,
+               idx_t fileIdx) -> PopulatedCopyFromError {
+        return BaseCSVReader::basePopulateErrorFunc(std::move(error), &errorHandlers[fileIdx],
+            movedReaders[fileIdx].get(), fileScanInfo.getFilePath(fileIdx));
+    };
+}
+
+void ParallelCSVScanSharedState::setFileComplete(uint64_t completedFileIdx) {
+    std::lock_guard<std::mutex> guard{mtx};
+    if (completedFileIdx == fileIdx) {
+        numBlocksReadByFiles += blockIdx;
+        blockIdx = 0;
+        fileIdx++;
+    }
+}
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput& output) {
+    auto& outputChunk = output.dataChunk;
+
+    auto localState = input.localState->ptrCast<ParallelCSVLocalState>();
+    auto sharedState = input.sharedState->ptrCast<ParallelCSVScanSharedState>();
+
+    do {
+        if (localState->reader != nullptr) {
+            if (localState->reader->hasMoreToRead()) {
+                auto result = localState->reader->continueBlock(outputChunk);
+                outputChunk.state->getSelVectorUnsafe().setSelSize(result);
+                if (result > 0) {
+                    return result;
+                }
+            }
+            localState->reader->reportFinishedBlock();
+        }
+        auto [fileIdx, blockIdx] = sharedState->getNext();
+        if (fileIdx == UINT64_MAX) {
+            return 0;
+        }
+        if (fileIdx != localState->fileIdx) {
+            localState->fileIdx = fileIdx;
+            localState->errorHandler =
+                std::make_unique<LocalFileErrorHandler>(&sharedState->errorHandlers[fileIdx],
+                    sharedState->csvOption.ignoreErrors, sharedState->context, true);
+            localState->reader =
+                std::make_unique<ParallelCSVReader>(sharedState->fileScanInfo.filePaths[fileIdx],
+                    fileIdx, sharedState->csvOption.copy(), sharedState->columnInfo.copy(),
+                    sharedState->context, localState->errorHandler.get());
+        }
+        auto numRowsRead = localState->reader->parseBlock(blockIdx, outputChunk);
+
+        // if there are any pending errors to throw, stop the parsing
+        // the actual error will be thrown during finalize
+        if (!sharedState->csvOption.ignoreErrors &&
+            sharedState->errorHandlers[fileIdx].getNumCachedErrors() > 0) {
+            numRowsRead = 0;
+        }
+
+        outputChunk.state->getSelVectorUnsafe().setSelSize(numRowsRead);
+        if (numRowsRead > 0) {
+            return numRowsRead;
+        }
+        if (localState->reader->isEOF()) {
+            localState->reader->reportFinishedBlock();
+            localState->errorHandler->finalize();
+            sharedState->setFileComplete(localState->fileIdx);
+            localState->reader = nullptr;
+            localState->errorHandler = nullptr;
+        }
+    } while (true);
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    auto scanInput = ku_dynamic_cast<ExtraScanTableFuncBindInput*>(input->extraInput.get());
+    bool detectedHeader = false;
+
+    DialectOption detectedDialect;
+    auto csvOption = CSVReaderConfig::construct(scanInput->fileScanInfo.options).option;
+    detectedDialect.doDialectDetection = csvOption.autoDetection;
+
+    std::vector<std::string> detectedColumnNames;
+    std::vector<LogicalType> detectedColumnTypes;
+    SerialCSVScan::bindColumns(scanInput, detectedColumnNames, detectedColumnTypes, detectedDialect,
+        detectedHeader, context);
+
+    std::vector<std::string> resultColumnNames;
+    std::vector<LogicalType> resultColumnTypes;
+    ReaderBindUtils::resolveColumns(scanInput->expectedColumnNames, detectedColumnNames,
+        resultColumnNames, scanInput->expectedColumnTypes, detectedColumnTypes, resultColumnTypes);
+
+    if (csvOption.autoDetection) {
+        std::string quote(1, detectedDialect.quoteChar);
+        std::string delim(1, detectedDialect.delimiter);
+        std::string escape(1, detectedDialect.escapeChar);
+        scanInput->fileScanInfo.options.insert_or_assign("ESCAPE",
+            Value(LogicalType::STRING(), escape));
+        scanInput->fileScanInfo.options.insert_or_assign("QUOTE",
+            Value(LogicalType::STRING(), quote));
+        scanInput->fileScanInfo.options.insert_or_assign("DELIM",
+            Value(LogicalType::STRING(), delim));
+    }
+
+    if (!csvOption.setHeader && csvOption.autoDetection && detectedHeader) {
+        scanInput->fileScanInfo.options.insert_or_assign("HEADER", Value(detectedHeader));
+    }
+
+    resultColumnNames =
+        TableFunction::extractYieldVariables(resultColumnNames, input->yieldVariables);
+    auto resultColumns = input->binder->createVariables(resultColumnNames, resultColumnTypes);
+    std::vector<std::string> warningColumnNames;
+    std::vector<LogicalType> warningColumnTypes;
+    const column_id_t numWarningDataColumns = BaseCSVReader::appendWarningDataColumns(
+        warningColumnNames, warningColumnTypes, scanInput->fileScanInfo);
+    auto warningColumns =
+        input->binder->createInvisibleVariables(warningColumnNames, warningColumnTypes);
+    for (auto& column : warningColumns) {
+        resultColumns.push_back(column);
+    }
+    return std::make_unique<ScanFileBindData>(std::move(resultColumns), 0 /* numRows */,
+        scanInput->fileScanInfo.copy(), context, numWarningDataColumns);
+}
+
+static std::unique_ptr<TableFuncSharedState> initSharedState(
+    const TableFuncInitSharedStateInput& input) {
+    auto bindData = input.bindData->constPtrCast<ScanFileBindData>();
+    auto csvOption = CSVReaderConfig::construct(bindData->fileScanInfo.options).option;
+    auto columnInfo = CSVColumnInfo(bindData->getNumColumns() - bindData->numWarningDataColumns,
+        bindData->getColumnSkips(), bindData->numWarningDataColumns);
+    auto sharedState = std::make_unique<ParallelCSVScanSharedState>(bindData->fileScanInfo.copy(),
+        0 /* numRows */, bindData->context, csvOption.copy(), columnInfo.copy());
+
+    for (idx_t i = 0; i < sharedState->fileScanInfo.getNumFiles(); ++i) {
+        auto filePath = sharedState->fileScanInfo.filePaths[i];
+        auto reader = std::make_unique<ParallelCSVReader>(filePath, i, csvOption.copy(),
+            columnInfo.copy(), bindData->context, nullptr);
+        sharedState->totalSize += reader->getFileSize();
+    }
+
+    return sharedState;
+}
+
+static std::unique_ptr<TableFuncLocalState> initLocalState(const TableFuncInitLocalStateInput&) {
+    auto localState = std::make_unique<ParallelCSVLocalState>();
+    localState->fileIdx = std::numeric_limits<decltype(localState->fileIdx)>::max();
+    return localState;
+}
+
+static double progressFunc(TableFuncSharedState* sharedState) {
+    auto state = sharedState->ptrCast<ParallelCSVScanSharedState>();
+    if (state->fileIdx >= state->fileScanInfo.getNumFiles()) {
+        return 1.0;
+    }
+    if (state->totalSize == 0) {
+        return 0.0;
+    }
+    uint64_t totalReadSize =
+        (state->numBlocksReadByFiles + state->blockIdx) * CopyConstants::PARALLEL_BLOCK_SIZE;
+    if (totalReadSize > state->totalSize) {
+        return 1.0;
+    }
+    return static_cast<double>(totalReadSize) / state->totalSize;
+}
+
+static void finalizeFunc(const ExecutionContext* ctx, TableFuncSharedState* sharedState) {
+    auto state = ku_dynamic_cast<ParallelCSVScanSharedState*>(sharedState);
+    for (idx_t i = 0; i < state->fileScanInfo.getNumFiles(); ++i) {
+        state->errorHandlers[i].throwCachedErrorsIfNeeded();
+    }
+    WarningContext::Get(*ctx->clientContext)
+        ->populateWarnings(ctx->queryID, state->populateErrorFunc, BaseCSVReader::getFileIdxFunc);
+}
+
+function_set ParallelCSVScan::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    function->tableFunc = tableFunc;
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = initSharedState;
+    function->initLocalStateFunc = initLocalState;
+    function->progressFunc = progressFunc;
+    function->finalizeFunc = finalizeFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/serial_csv_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/serial_csv_reader.cpp
new file mode 100644
index 0000000000..e0c98418be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/csv/serial_csv_reader.cpp
@@ -0,0 +1,472 @@
+#include "processor/operator/persistent/reader/csv/serial_csv_reader.h"
+
+#include "binder/binder.h"
+#include "function/table/bind_data.h"
+#include "function/table/table_function.h"
+#include "processor/execution_context.h"
+#include "processor/operator/persistent/reader/csv/driver.h"
+#include "processor/operator/persistent/reader/reader_bind_utils.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+SerialCSVReader::SerialCSVReader(const std::string& filePath, idx_t fileIdx, CSVOption option,
+    CSVColumnInfo columnInfo, main::ClientContext* context, LocalFileErrorHandler* errorHandler,
+    const ExtraScanTableFuncBindInput* bindInput)
+    : BaseCSVReader{filePath, fileIdx, std::move(option), std::move(columnInfo), context,
+          errorHandler},
+      bindInput{bindInput} {}
+
+std::vector<std::pair<std::string, LogicalType>> SerialCSVReader::sniffCSV(
+    DialectOption& detectedDialect, bool& detectedHeader) {
+    auto csvOption = CSVReaderConfig::construct(bindInput->fileScanInfo.options).option;
+    readBOM();
+
+    if (detectedDialect.doDialectDetection) {
+        detectedDialect = detectDialect();
+    }
+
+    SniffCSVNameAndTypeDriver driver{this, bindInput};
+    parseCSV(driver);
+
+    for (auto& i : driver.columns) {
+        // purge null types
+        i.second = LogicalTypeUtils::purgeAny(i.second, LogicalType::STRING());
+    }
+    // Do header detection IFF user didn't set header AND user didn't turn off auto detection
+    if (!csvOption.setHeader && csvOption.autoDetection) {
+        detectedHeader = detectHeader(driver.columns);
+    }
+
+    // finalize the columns; rename duplicate names
+    std::map<std::string, int32_t> names;
+    for (auto& i : driver.columns) {
+        // Suppose name "col" already exists
+        // Let N be the number of times it exists
+        // rename to "col" + "_{N}"
+        // ideally "col_{N}" shouldn't exist, but if it already exists M times (due to user
+        // declaration), rename to "col_{N}" + "_{M}" repeat until no match exists
+        while (names.contains(i.first)) {
+            names[i.first]++;
+            i.first += "_" + std::to_string(names[i.first]);
+        }
+        names[i.first];
+        // purge null types
+        i.second = LogicalTypeUtils::purgeAny(i.second, LogicalType::STRING());
+    }
+    return std::move(driver.columns);
+}
+
+uint64_t SerialCSVReader::parseBlock(block_idx_t blockIdx, DataChunk& resultChunk) {
+    KU_ASSERT(nullptr != errorHandler);
+
+    if (blockIdx != currentBlockIdx) {
+        resetNumRowsInCurrentBlock();
+    }
+    currentBlockIdx = blockIdx;
+    if (blockIdx == 0) {
+        const auto [numRowsRead, numErrors] = handleFirstBlock();
+        errorHandler->setHeaderNumRows(numRowsRead + numErrors);
+    }
+    SerialParsingDriver driver(resultChunk, this);
+    const auto [numRowsRead, numErrors] = parseCSV(driver);
+    errorHandler->reportFinishedBlock(blockIdx, numRowsRead + numErrors);
+    resultChunk.state->getSelVectorUnsafe().setSelSize(numRowsRead);
+    increaseNumRowsInCurrentBlock(numRowsRead, numErrors);
+    return numRowsRead;
+}
+
+SerialCSVScanSharedState::SerialCSVScanSharedState(FileScanInfo fileScanInfo, uint64_t numRows,
+    main::ClientContext* context, CSVOption csvOption, CSVColumnInfo columnInfo, uint64_t queryID)
+    : ScanFileWithProgressSharedState{std::move(fileScanInfo), numRows, context},
+      csvOption{std::move(csvOption)}, columnInfo{std::move(columnInfo)}, totalReadSizeByFile{0},
+      queryID(queryID), populateErrorFunc(constructPopulateFunc()) {
+    std::lock_guard lck{mtx};
+    initReader(context);
+}
+
+populate_func_t SerialCSVScanSharedState::constructPopulateFunc() const {
+    return [this](CopyFromFileError error, idx_t fileIdx) -> PopulatedCopyFromError {
+        return BaseCSVReader::basePopulateErrorFunc(std::move(error), sharedErrorHandler.get(),
+            reader.get(), fileScanInfo.getFilePath(fileIdx));
+    };
+}
+
+void SerialCSVScanSharedState::read(DataChunk& outputChunk) {
+    std::lock_guard<std::mutex> lck{mtx};
+    do {
+        if (fileIdx >= fileScanInfo.getNumFiles()) {
+            return;
+        }
+        uint64_t numRows = reader->parseBlock(reader->getFileOffset() == 0 ? 0 : 1, outputChunk);
+        if (numRows > 0) {
+            return;
+        }
+        totalReadSizeByFile += reader->getFileSize();
+        finalizeReader(context);
+        fileIdx++;
+        initReader(context);
+    } while (true);
+}
+
+void SerialCSVScanSharedState::finalizeReader(main::ClientContext* context) const {
+    if (localErrorHandler) {
+        localErrorHandler->finalize();
+    }
+    if (sharedErrorHandler) {
+        sharedErrorHandler->throwCachedErrorsIfNeeded();
+        WarningContext::Get(*context)->populateWarnings(queryID, populateErrorFunc,
+            BaseCSVReader::getFileIdxFunc);
+    }
+}
+
+void SerialCSVScanSharedState::initReader(main::ClientContext* context) {
+    if (fileIdx < fileScanInfo.getNumFiles()) {
+        sharedErrorHandler =
+            std::make_unique<SharedFileErrorHandler>(fileIdx, nullptr, populateErrorFunc);
+        localErrorHandler = std::make_unique<LocalFileErrorHandler>(sharedErrorHandler.get(),
+            csvOption.ignoreErrors, context);
+        reader = std::make_unique<SerialCSVReader>(fileScanInfo.filePaths[fileIdx], fileIdx,
+            csvOption.copy(), columnInfo.copy(), context, localErrorHandler.get());
+    }
+}
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput& output) {
+    auto serialCSVScanSharedState = ku_dynamic_cast<SerialCSVScanSharedState*>(input.sharedState);
+    serialCSVScanSharedState->read(output.dataChunk);
+    return output.dataChunk.state->getSelVector().getSelSize();
+}
+
+static void bindColumnsFromFile(const ExtraScanTableFuncBindInput* bindInput, uint32_t fileIdx,
+    std::vector<std::string>& columnNames, std::vector<LogicalType>& columnTypes,
+    DialectOption& detectedDialect, bool& detectedHeader, main::ClientContext* context) {
+    auto csvOption = CSVReaderConfig::construct(bindInput->fileScanInfo.options).option;
+    auto columnInfo = CSVColumnInfo(bindInput->expectedColumnNames.size() /* numColumns */,
+        {} /* columnSkips */, {} /*warningDataColumns*/);
+    SharedFileErrorHandler sharedErrorHandler{fileIdx, nullptr};
+    // We don't want to cache CSV errors encountered during sniffing, they will be re-encountered
+    // when actually parsing
+    LocalFileErrorHandler errorHandler{&sharedErrorHandler, csvOption.ignoreErrors, context, false};
+    auto csvReader = SerialCSVReader(bindInput->fileScanInfo.filePaths[fileIdx], fileIdx,
+        csvOption.copy(), columnInfo.copy(), context, &errorHandler, bindInput);
+    sharedErrorHandler.setPopulateErrorFunc(
+        [&sharedErrorHandler, &csvReader, bindInput](CopyFromFileError error,
+            idx_t fileIdx) -> PopulatedCopyFromError {
+            return BaseCSVReader::basePopulateErrorFunc(std::move(error), &sharedErrorHandler,
+                &csvReader, bindInput->fileScanInfo.filePaths[fileIdx]);
+        });
+    auto sniffedColumns = csvReader.sniffCSV(detectedDialect, detectedHeader);
+    sharedErrorHandler.throwCachedErrorsIfNeeded();
+    for (auto& [name, type] : sniffedColumns) {
+        columnNames.push_back(name);
+        columnTypes.push_back(type.copy());
+    }
+}
+
+void SerialCSVScan::bindColumns(const ExtraScanTableFuncBindInput* bindInput,
+    std::vector<std::string>& columnNames, std::vector<LogicalType>& columnTypes,
+    DialectOption& detectedDialect, bool& detectedHeader, main::ClientContext* context) {
+    KU_ASSERT(bindInput->fileScanInfo.getNumFiles() > 0);
+    bindColumnsFromFile(bindInput, 0, columnNames, columnTypes, detectedDialect, detectedHeader,
+        context);
+    for (auto i = 1u; i < bindInput->fileScanInfo.getNumFiles(); ++i) {
+        std::vector<std::string> tmpColumnNames;
+        std::vector<LogicalType> tmpColumnTypes;
+        bindColumnsFromFile(bindInput, i, tmpColumnNames, tmpColumnTypes, detectedDialect,
+            detectedHeader, context);
+        ReaderBindUtils::validateNumColumns(columnTypes.size(), tmpColumnTypes.size());
+    }
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    auto scanInput = ku_dynamic_cast<ExtraScanTableFuncBindInput*>(input->extraInput.get());
+    if (scanInput->expectedColumnTypes.size() > 0) {
+        scanInput->fileScanInfo.options.insert_or_assign("SAMPLE_SIZE",
+            Value((int64_t)0)); // only scan headers
+    }
+
+    bool detectedHeader = false;
+
+    DialectOption detectedDialect;
+    auto csvOption = CSVReaderConfig::construct(scanInput->fileScanInfo.options).option;
+    detectedDialect.doDialectDetection = csvOption.autoDetection;
+
+    std::vector<std::string> detectedColumnNames;
+    std::vector<LogicalType> detectedColumnTypes;
+    SerialCSVScan::bindColumns(scanInput, detectedColumnNames, detectedColumnTypes, detectedDialect,
+        detectedHeader, context);
+
+    std::vector<std::string> resultColumnNames;
+    std::vector<LogicalType> resultColumnTypes;
+    ReaderBindUtils::resolveColumns(scanInput->expectedColumnNames, detectedColumnNames,
+        resultColumnNames, scanInput->expectedColumnTypes, detectedColumnTypes, resultColumnTypes);
+
+    if (detectedDialect.doDialectDetection) {
+        std::string quote(1, detectedDialect.quoteChar);
+        std::string delim(1, detectedDialect.delimiter);
+        std::string escape(1, detectedDialect.escapeChar);
+        scanInput->fileScanInfo.options.insert_or_assign("ESCAPE",
+            Value(LogicalType::STRING(), escape));
+        scanInput->fileScanInfo.options.insert_or_assign("QUOTE",
+            Value(LogicalType::STRING(), quote));
+        scanInput->fileScanInfo.options.insert_or_assign("DELIM",
+            Value(LogicalType::STRING(), delim));
+    }
+
+    if (!csvOption.setHeader && csvOption.autoDetection && detectedHeader) {
+        scanInput->fileScanInfo.options.insert_or_assign("HEADER", Value(detectedHeader));
+    }
+
+    resultColumnNames =
+        TableFunction::extractYieldVariables(resultColumnNames, input->yieldVariables);
+    auto resultColumns = input->binder->createVariables(resultColumnNames, resultColumnTypes);
+    std::vector<std::string> warningColumnNames;
+    std::vector<LogicalType> warningColumnTypes;
+    const column_id_t numWarningDataColumns = BaseCSVReader::appendWarningDataColumns(
+        warningColumnNames, warningColumnTypes, scanInput->fileScanInfo);
+    auto warningColumns =
+        input->binder->createInvisibleVariables(warningColumnNames, warningColumnTypes);
+    for (auto& column : warningColumns) {
+        resultColumns.push_back(column);
+    }
+    return std::make_unique<ScanFileBindData>(std::move(resultColumns), 0 /* numRows */,
+        scanInput->fileScanInfo.copy(), context, numWarningDataColumns);
+}
+
+static std::unique_ptr<TableFuncSharedState> initSharedState(
+    const TableFuncInitSharedStateInput& input) {
+    auto bindData = input.bindData->constPtrCast<ScanFileBindData>();
+    auto csvOption = CSVReaderConfig::construct(bindData->fileScanInfo.options).option;
+    auto columnInfo = CSVColumnInfo(bindData->getNumColumns() - bindData->numWarningDataColumns,
+        bindData->getColumnSkips(), bindData->numWarningDataColumns);
+    auto sharedState =
+        std::make_unique<SerialCSVScanSharedState>(bindData->fileScanInfo.copy(), 0 /* numRows */,
+            bindData->context, csvOption.copy(), columnInfo.copy(), input.context->queryID);
+    for (idx_t i = 0; i < sharedState->fileScanInfo.filePaths.size(); ++i) {
+        const auto& filePath = sharedState->fileScanInfo.filePaths[i];
+        auto reader = std::make_unique<SerialCSVReader>(filePath, i, csvOption.copy(),
+            columnInfo.copy(), sharedState->context, nullptr);
+        sharedState->totalSize += reader->getFileSize();
+    }
+    return sharedState;
+}
+
+static void finalizeFunc(const ExecutionContext* ctx, TableFuncSharedState* sharedState) {
+    auto state = ku_dynamic_cast<SerialCSVScanSharedState*>(sharedState);
+    state->finalizeReader(ctx->clientContext);
+}
+
+static double progressFunc(TableFuncSharedState* sharedState) {
+    auto state = ku_dynamic_cast<SerialCSVScanSharedState*>(sharedState);
+    if (state->totalSize == 0) {
+        return 0.0;
+    } else if (state->fileIdx >= state->fileScanInfo.getNumFiles()) {
+        return 1.0;
+    }
+    std::lock_guard lck{state->mtx};
+    uint64_t totalReadSize = state->totalReadSizeByFile + state->reader->getFileOffset();
+    return static_cast<double>(totalReadSize) / state->totalSize;
+}
+
+function_set SerialCSVScan::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    function->tableFunc = tableFunc;
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    function->progressFunc = progressFunc;
+    function->finalizeFunc = finalizeFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+void SerialCSVReader::resetReaderState() {
+    // Reset file position to the beginning.
+    fileInfo->reset();
+    buffer.reset();
+    bufferSize = 0;
+    position = 0;
+    osFileOffset = 0;
+    bufferIdx = 0;
+    lineContext.setNewLine(getFileOffset());
+
+    readBOM();
+}
+
+DialectOption SerialCSVReader::detectDialect() {
+    // Extract a sample of rows from the file for dialect detection.
+    SniffCSVDialectDriver driver{this};
+
+    // Generate dialect options based on the non-user-specified options.
+    auto dialectSearchSpace = generateDialectOptions(option);
+
+    // Save default for dialect not found situation.
+    DialectOption defaultOption{option.delimiter, option.quoteChar, option.escapeChar};
+
+    idx_t bestConsistentRows = 0;
+    idx_t maxColumnsFound = 0;
+    idx_t minIgnoredRows = 0;
+    std::vector<DialectOption> validDialects;
+    std::vector<DialectOption> finalDialects;
+    for (auto& dialectOption : dialectSearchSpace) {
+        bool notExpected = false;
+        // Load current dialect option.
+        option.delimiter = dialectOption.delimiter;
+        option.quoteChar = dialectOption.quoteChar;
+        option.escapeChar = dialectOption.escapeChar;
+        // reset Driver.
+        driver.reset();
+        // Try parsing it with current dialect.
+        parseCSV(driver);
+        // Reset the file position and buffer to start reading from the beginning after detection.
+        resetReaderState();
+        // If never unquoting quoted values or any other error during the parsing, discard this
+        // dialect.
+        if (driver.getError()) {
+            continue;
+        }
+
+        idx_t ignoredRows = 0;
+        idx_t consistentRows = 0;
+        idx_t numCols = driver.getResultPosition() == 0 ? 1 : driver.getColumnCount(0);
+        dialectOption.everQuoted = driver.getEverQuoted();
+        dialectOption.everEscaped = driver.getEverEscaped();
+
+        // If the columns didn't match the user input columns number.
+        if (getNumColumns() != 0 && getNumColumns() != numCols) {
+            continue;
+        }
+
+        for (auto row = 0u; row < driver.getResultPosition(); row++) {
+            if (getNumColumns() != 0 && getNumColumns() != driver.getColumnCount(row)) {
+                notExpected = true;
+                break;
+            }
+            if (numCols < driver.getColumnCount(row)) {
+                numCols = driver.getColumnCount(row);
+                consistentRows = 1;
+            } else if (driver.getColumnCount(row) == numCols) {
+                consistentRows++;
+            } else {
+                ignoredRows++;
+            }
+        }
+
+        if (notExpected) {
+            continue;
+        }
+
+        auto moreValues = consistentRows > bestConsistentRows && numCols >= maxColumnsFound;
+        auto singleColumnBefore =
+            maxColumnsFound < 2 && numCols > maxColumnsFound * validDialects.size();
+        auto moreThanOneRow = consistentRows > 1;
+        auto moreThanOneColumn = numCols > 1;
+
+        if (singleColumnBefore || moreValues || moreThanOneColumn) {
+            if (maxColumnsFound == numCols && ignoredRows > minIgnoredRows) {
+                continue;
+            }
+            if (!validDialects.empty() && validDialects.front().everQuoted &&
+                !dialectOption.everQuoted) {
+                // Give preference to quoted dialect.
+                continue;
+            }
+
+            if (!validDialects.empty() && validDialects.front().everEscaped &&
+                !dialectOption.everEscaped) {
+                // Give preference to Escaped dialect.
+                continue;
+            }
+
+            if (consistentRows >= bestConsistentRows) {
+                bestConsistentRows = consistentRows;
+                maxColumnsFound = numCols;
+                minIgnoredRows = ignoredRows;
+                validDialects.clear();
+                validDialects.emplace_back(dialectOption);
+            }
+        }
+
+        if (moreThanOneRow && moreThanOneColumn && numCols == maxColumnsFound) {
+            bool same_quote = false;
+            for (auto& validDialect : validDialects) {
+                if (validDialect.quoteChar == dialectOption.quoteChar) {
+                    same_quote = true;
+                }
+            }
+
+            if (!same_quote) {
+                validDialects.push_back(dialectOption);
+            }
+        }
+    }
+
+    // If we have multiple validDialect with quotes set, we will give the preference to ones
+    // that have actually quoted values.
+    if (!validDialects.empty()) {
+        for (auto& validDialect : validDialects) {
+            if (validDialect.everQuoted) {
+                finalDialects.clear();
+                finalDialects.emplace_back(validDialect);
+                break;
+            }
+            finalDialects.emplace_back(validDialect);
+        }
+    }
+
+    // If the Dialect we found doesn't need Quote, we use empty as QuoteChar.
+    if (!finalDialects.empty() && !finalDialects[0].everQuoted && !option.setQuote) {
+        finalDialects[0].quoteChar = '\0';
+    }
+    // If the Dialect we found doesn't need Escape, we use empty as EscapeChar.
+    if (!finalDialects.empty() && !finalDialects[0].everEscaped && !option.setEscape) {
+        finalDialects[0].escapeChar = '\0';
+    }
+
+    // Apply the detected dialect to the CSV options.
+    if (!finalDialects.empty()) {
+        option.delimiter = finalDialects[0].delimiter;
+        option.quoteChar = finalDialects[0].quoteChar;
+        option.escapeChar = finalDialects[0].escapeChar;
+    } else {
+        option.delimiter = defaultOption.delimiter;
+        option.quoteChar = defaultOption.quoteChar;
+        option.escapeChar = defaultOption.escapeChar;
+    }
+
+    DialectOption ret{option.delimiter, option.quoteChar, option.escapeChar};
+    return ret;
+}
+
+bool SerialCSVReader::detectHeader(
+    std::vector<std::pair<std::string, LogicalType>>& detectedTypes) {
+    // Reset the file position and buffer to start reading from the beginning after detection.
+    resetReaderState();
+    SniffCSVHeaderDriver sniffHeaderDriver{this, detectedTypes};
+    readBOM();
+    parseCSV(sniffHeaderDriver);
+    resetReaderState();
+    // In this case, User didn't set Header, but we detected a Header, use the detected header to
+    // set the name and type.
+    if (sniffHeaderDriver.detectedHeader) {
+        // If the detected header has fewer columns that expected, treat it as if no header was
+        // detected
+        if (sniffHeaderDriver.header.size() < detectedTypes.size()) {
+            sniffHeaderDriver.detectedHeader = false;
+            return false;
+        }
+
+        for (auto i = 0u; i < detectedTypes.size(); i++) {
+            detectedTypes[i].first = sniffHeaderDriver.header[i].first;
+        }
+    }
+    return sniffHeaderDriver.detectedHeader;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/file_error_handler.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/file_error_handler.cpp
new file mode 100644
index 0000000000..7bf0b28c2c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/file_error_handler.cpp
@@ -0,0 +1,237 @@
+#include "processor/operator/persistent/reader/file_error_handler.h"
+
+#include <algorithm>
+
+#include "common/assert.h"
+#include "common/exception/copy.h"
+#include "common/string_format.h"
+#include "main/client_context.h"
+
+namespace lbug {
+using namespace common;
+namespace processor {
+
+void LineContext::setNewLine(uint64_t start) {
+    startByteOffset = start;
+    isCompleteLine = false;
+}
+
+void LineContext::setEndOfLine(uint64_t end) {
+    endByteOffset = end;
+    isCompleteLine = true;
+}
+
+SharedFileErrorHandler::SharedFileErrorHandler(common::idx_t fileIdx, std::mutex* sharedMtx,
+    populate_func_t populateErrorFunc)
+    : mtx(sharedMtx), fileIdx(fileIdx), populateErrorFunc(std::move(populateErrorFunc)),
+      headerNumRows(0) {}
+
+uint64_t SharedFileErrorHandler::getNumCachedErrors() {
+    auto lockGuard = lock();
+    return cachedErrors.size();
+}
+
+void SharedFileErrorHandler::tryCacheError(CopyFromFileError error, const common::UniqLock&) {
+    if (cachedErrors.size() < MAX_CACHED_ERROR_COUNT) {
+        cachedErrors.push_back(std::move(error));
+    }
+}
+
+void SharedFileErrorHandler::handleError(CopyFromFileError error) {
+    auto lockGuard = lock();
+    if (error.mustThrow) {
+        throwError(error);
+    }
+
+    const auto blockIdx = error.warningData.getBlockIdx();
+    if (blockIdx >= linesPerBlock.size()) {
+        linesPerBlock.resize(blockIdx + 1);
+    }
+
+    // throwing of the error is not done when in the middle of parsing blocks
+    // so we cache the error to be thrown later
+    tryCacheError(std::move(error), lockGuard);
+}
+
+void SharedFileErrorHandler::throwCachedErrorsIfNeeded() {
+    auto lockGuard = lock();
+    tryThrowFirstCachedError();
+}
+
+void SharedFileErrorHandler::tryThrowFirstCachedError() {
+    if (cachedErrors.empty()) {
+        return;
+    }
+
+    // we sort the cached errors to report the one with the earliest line number
+    std::sort(cachedErrors.begin(), cachedErrors.end());
+
+    const auto error = *cachedErrors.cbegin();
+    KU_ASSERT(!error.mustThrow);
+
+    const bool errorIsThrowable = canGetLineNumber(error.warningData.getBlockIdx());
+    if (errorIsThrowable) {
+        throwError(error);
+    }
+}
+
+namespace {
+std::string getFilePathMessage(std::string_view filePath) {
+    static constexpr std::string_view invalidFilePath = "";
+    return filePath == invalidFilePath ? std::string{} :
+                                         common::stringFormat(" in file {}", filePath);
+}
+
+std::string getLineNumberMessage(uint64_t lineNumber) {
+    static constexpr uint64_t invalidLineNumber = 0;
+    return lineNumber == invalidLineNumber ? std::string{} :
+                                             common::stringFormat(" on line {}", lineNumber);
+}
+
+std::string getSkippedLineMessage(std::string_view skippedLineOrRecord) {
+    static constexpr std::string_view emptySkippedLine = "";
+    return skippedLineOrRecord == emptySkippedLine ?
+               std::string{} :
+               common::stringFormat(" Line/record containing the error: '{}'", skippedLineOrRecord);
+}
+} // namespace
+
+std::string SharedFileErrorHandler::getErrorMessage(PopulatedCopyFromError populatedError) const {
+    return common::stringFormat("Error{}{}: {}{}", getFilePathMessage(populatedError.filePath),
+        getLineNumberMessage(populatedError.lineNumber), populatedError.message,
+        getSkippedLineMessage(populatedError.skippedLineOrRecord));
+}
+
+void SharedFileErrorHandler::throwError(CopyFromFileError error) const {
+    KU_ASSERT(populateErrorFunc);
+    throw CopyException(getErrorMessage(populateErrorFunc(std::move(error), fileIdx)));
+}
+
+common::UniqLock SharedFileErrorHandler::lock() {
+    if (mtx) {
+        return common::UniqLock{*mtx};
+    }
+    return common::UniqLock{};
+}
+
+bool SharedFileErrorHandler::canGetLineNumber(uint64_t blockIdx) const {
+    if (blockIdx > linesPerBlock.size()) {
+        return false;
+    }
+    for (uint64_t i = 0; i < blockIdx; ++i) {
+        //  the line count for a block is empty if it hasn't finished being parsed
+        if (!linesPerBlock[i].doneParsingBlock) {
+            return false;
+        }
+    }
+    return true;
+}
+
+void SharedFileErrorHandler::setPopulateErrorFunc(populate_func_t newPopulateErrorFunc) {
+    populateErrorFunc = newPopulateErrorFunc;
+}
+
+uint64_t SharedFileErrorHandler::getLineNumber(uint64_t blockIdx,
+    uint64_t numRowsReadInBlock) const {
+    // 1-indexed
+    uint64_t res = numRowsReadInBlock + headerNumRows + 1;
+    for (uint64_t i = 0; i < blockIdx; ++i) {
+        KU_ASSERT(i < linesPerBlock.size());
+        res += linesPerBlock[i].numLines;
+    }
+    return res;
+}
+
+void SharedFileErrorHandler::setHeaderNumRows(uint64_t numRows) {
+    if (numRows == headerNumRows) {
+        return;
+    }
+    auto lockGuard = lock();
+    headerNumRows = numRows;
+}
+
+void SharedFileErrorHandler::updateLineNumberInfo(
+    const std::map<uint64_t, LinesPerBlock>& newLinesPerBlock, bool canThrowCachedError) {
+    const auto lockGuard = lock();
+
+    if (!newLinesPerBlock.empty()) {
+        const auto maxNewBlockIdx = newLinesPerBlock.rbegin()->first;
+        if (maxNewBlockIdx >= linesPerBlock.size()) {
+            linesPerBlock.resize(maxNewBlockIdx + 1);
+        }
+
+        for (const auto& [blockIdx, linesInBlock] : newLinesPerBlock) {
+            auto& currentBlock = linesPerBlock[blockIdx];
+            currentBlock.numLines += linesInBlock.numLines;
+            currentBlock.doneParsingBlock =
+                currentBlock.doneParsingBlock || linesInBlock.doneParsingBlock;
+        }
+    }
+
+    if (canThrowCachedError) {
+        tryThrowFirstCachedError();
+    }
+}
+
+LocalFileErrorHandler::LocalFileErrorHandler(SharedFileErrorHandler* sharedErrorHandler,
+    bool ignoreErrors, main::ClientContext* context, bool cacheErrors)
+    : sharedErrorHandler(sharedErrorHandler), context(context),
+      maxCachedErrorCount(
+          std::min(this->context->getClientConfig()->warningLimit, LOCAL_WARNING_LIMIT)),
+      ignoreErrors(ignoreErrors), cacheIgnoredErrors(cacheErrors) {}
+
+void LocalFileErrorHandler::handleError(CopyFromFileError error) {
+    if (error.mustThrow || !ignoreErrors) {
+        // we delegate throwing to the shared error handler
+        sharedErrorHandler->handleError(std::move(error));
+        return;
+    }
+
+    KU_ASSERT(cachedErrors.size() <= maxCachedErrorCount);
+    if (cachedErrors.size() == maxCachedErrorCount) {
+        flushCachedErrors();
+    }
+
+    if (cacheIgnoredErrors) {
+        cachedErrors.push_back(std::move(error));
+    }
+}
+
+void LocalFileErrorHandler::reportFinishedBlock(uint64_t blockIdx, uint64_t numRowsRead) {
+    linesPerBlock[blockIdx].numLines += numRowsRead;
+    linesPerBlock[blockIdx].doneParsingBlock = true;
+    if (linesPerBlock.size() >= maxCachedErrorCount) {
+        flushCachedErrors();
+    }
+}
+
+void LocalFileErrorHandler::setHeaderNumRows(uint64_t numRows) {
+    sharedErrorHandler->setHeaderNumRows(numRows);
+}
+
+LocalFileErrorHandler::~LocalFileErrorHandler() {
+    // we don't want to throw in the destructor
+    // so we leave throwing for later in the parsing stage or during finalize
+    flushCachedErrors(false);
+}
+
+void LocalFileErrorHandler::finalize(bool canThrowCachedError) {
+    flushCachedErrors(canThrowCachedError);
+}
+
+void LocalFileErrorHandler::flushCachedErrors(bool canThrowCachedError) {
+    if (!linesPerBlock.empty()) {
+        // clear linesPerBlock first so that it is empty even if updateLineNumberInfo() throws
+        decltype(linesPerBlock) oldLinesPerBlock;
+        oldLinesPerBlock.swap(linesPerBlock);
+        sharedErrorHandler->updateLineNumberInfo(oldLinesPerBlock, canThrowCachedError);
+    }
+
+    if (!cachedErrors.empty()) {
+        WarningContext::Get(*context)->appendWarningMessages(cachedErrors);
+        cachedErrors.clear();
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/npy/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/npy/CMakeLists.txt
new file mode 100644
index 0000000000..c4faf3ac3f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/npy/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(lbug_processor_operator_npy_reader
+        OBJECT
+        npy_reader.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_npy_reader>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/npy/npy_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/npy/npy_reader.cpp
new file mode 100644
index 0000000000..8a5bd23290
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/npy/npy_reader.cpp
@@ -0,0 +1,356 @@
+#include "processor/operator/persistent/reader/npy/npy_reader.h"
+
+#include <fcntl.h>
+#include <sys/stat.h>
+
+#include "binder/binder.h"
+#include "common/exception/binder.h"
+#include "processor/execution_context.h"
+#include "processor/operator/persistent/reader/reader_bind_utils.h"
+#include "processor/warning_context.h"
+
+#ifdef _WIN32
+#include "common/exception/buffer_manager.h"
+#include <errhandlingapi.h>
+#include <handleapi.h>
+#include <io.h>
+#include <memoryapi.h>
+#else
+#include <sys/mman.h>
+#include <unistd.h>
+#endif
+#include "common/exception/copy.h"
+#include "common/string_format.h"
+#include "common/utils.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/table_function.h"
+#include "pyparse.h"
+#include "storage/storage_utils.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+NpyReader::NpyReader(const std::string& filePath)
+    : filePath{filePath}, dataOffset{0}, type{LogicalTypeID::ANY} {
+    fd = open(filePath.c_str(), O_RDONLY);
+    if (fd == -1) {
+        throw CopyException("Failed to open NPY file.");
+    }
+    struct stat fileStatus {};
+    fstat(fd, &fileStatus);
+    fileSize = fileStatus.st_size;
+
+#ifdef _WIN32
+    DWORD low = (DWORD)(fileSize & 0xFFFFFFFFL);
+    DWORD high = (DWORD)((fileSize >> 32) & 0xFFFFFFFFL);
+    auto handle =
+        CreateFileMappingW((HANDLE)_get_osfhandle(fd), NULL, PAGE_READONLY, high, low, NULL);
+    if (handle == NULL) {
+        throw BufferManagerException(
+            stringFormat("CreateFileMapping for size {} failed with error code {}: {}.", fileSize,
+                GetLastError(), std::system_category().message(GetLastError())));
+    }
+
+    mmapRegion = MapViewOfFile(handle, FILE_MAP_READ, 0, 0, fileSize);
+    CloseHandle(handle);
+    if (mmapRegion == NULL) {
+        throw BufferManagerException(
+            stringFormat("MapViewOfFile for size {} failed with error code {}: {}.", fileSize,
+                GetLastError(), std::system_category().message(GetLastError())));
+    }
+#else
+    mmapRegion = mmap(nullptr, fileSize, PROT_READ, MAP_SHARED, fd, 0);
+    if (mmapRegion == MAP_FAILED) {
+        throw CopyException("Failed to mmap NPY file.");
+    }
+#endif
+    parseHeader();
+}
+
+NpyReader::~NpyReader() {
+#ifdef _WIN32
+    UnmapViewOfFile(mmapRegion);
+#else
+    munmap(mmapRegion, fileSize);
+#endif
+    close(fd);
+}
+
+size_t NpyReader::getNumElementsPerRow() const {
+    size_t numElements = 1;
+    for (size_t i = 1; i < shape.size(); ++i) {
+        numElements *= shape[i];
+    }
+    return numElements;
+}
+
+uint8_t* NpyReader::getPointerToRow(size_t row) const {
+    if (row >= getNumRows()) {
+        return nullptr;
+    }
+    return (
+        uint8_t*)((char*)mmapRegion + dataOffset +
+                  row * getNumElementsPerRow() * StorageUtils::getDataTypeSize(LogicalType{type}));
+}
+
+void NpyReader::parseHeader() {
+    // The first 6 bytes are a magic string: exactly \x93NUMPY
+    char* magicString = (char*)mmapRegion;
+    const char* expectedMagicString = "\x93NUMPY";
+    if (memcmp(magicString, expectedMagicString, 6) != 0) {
+        throw CopyException("Invalid NPY file");
+    }
+
+    // The next 1 byte is an unsigned byte: the major version number of the file
+    // format, e.g. x01.
+    char* majorVersion = magicString + 6;
+    if (*majorVersion != 1) {
+        throw CopyException("Unsupported NPY file version.");
+    }
+    // The next 1 byte is an unsigned byte: the minor version number of the file
+    // format, e.g. x00. Note: the version of the file format is not tied to the
+    // version of the numpy package.
+    char* minorVersion = majorVersion + 1;
+    if (*minorVersion != 0) {
+        throw CopyException("Unsupported NPY file version.");
+    }
+    // The next 2 bytes form a little-endian unsigned short int: the length of
+    // the header data HEADER_LEN.
+    auto headerLength = *(unsigned short int*)(minorVersion + 1);
+    if (!isLittleEndian()) {
+        headerLength = ((headerLength & 0xff00) >> 8) | ((headerLength & 0x00ff) << 8);
+    }
+
+    // The next HEADER_LEN bytes form the header data describing the array's
+    // format. It is an ASCII string which contains a Python literal expression
+    // of a dictionary. It is terminated by a newline ('n') and padded with
+    // spaces ('x20') to make the total length of the magic string + 4 +
+    // HEADER_LEN be evenly divisible by 16 for alignment purposes.
+    auto metaInfoLength = strlen(expectedMagicString) + 4;
+    char* header = (char*)mmapRegion + metaInfoLength;
+    auto headerEnd = std::find(header, header + headerLength, '}');
+
+    std::string headerString(header, headerEnd + 1);
+    std::unordered_map<std::string, std::string> headerMap =
+        pyparse::parse_dict(headerString, {"descr", "fortran_order", "shape"});
+    auto isFortranOrder = pyparse::parse_bool(headerMap["fortran_order"]);
+    if (isFortranOrder) {
+        throw CopyException("Fortran-order NPY files are not currently supported.");
+    }
+    auto descr = pyparse::parse_str(headerMap["descr"]);
+    parseType(descr);
+    auto shapeV = pyparse::parse_tuple(headerMap["shape"]);
+    for (auto const& item : shapeV) {
+        shape.emplace_back(std::stoul(item));
+    }
+    dataOffset = metaInfoLength + headerLength;
+}
+
+void NpyReader::parseType(std::string descr) {
+    if (descr[0] == '<' || descr[0] == '>') {
+        // Data type endianness is specified
+        auto machineEndianness = isLittleEndian() ? "<" : ">";
+        if (descr[0] != machineEndianness[0]) {
+            throw CopyException(
+                "The endianness of the file does not match the machine's endianness.");
+        }
+        descr = descr.substr(1);
+    }
+    if (descr[0] == '|' || descr[0] == '=') {
+        // Data type endianness is not applicable or native
+        descr = descr.substr(1);
+    }
+    if (descr == "f8") {
+        type = LogicalTypeID::DOUBLE;
+    } else if (descr == "f4") {
+        type = LogicalTypeID::FLOAT;
+    } else if (descr == "i8") {
+        type = LogicalTypeID::INT64;
+    } else if (descr == "i4") {
+        type = LogicalTypeID::INT32;
+    } else if (descr == "i2") {
+        type = LogicalTypeID::INT16;
+    } else {
+        throw CopyException("Unsupported data type: " + descr);
+    }
+}
+
+void NpyReader::validate(const LogicalType& type_, offset_t numRows) {
+    auto numNodesInFile = getNumRows();
+    if (numNodesInFile == 0) {
+        throw CopyException(stringFormat("Number of rows in npy file {} is 0.", filePath));
+    }
+    if (numNodesInFile != numRows) {
+        throw CopyException("Number of rows in npy files is not equal to each other.");
+    }
+    // TODO(Guodong): Set npy reader data type to ARRAY, so we can simplify checks here.
+    if (type_.getLogicalTypeID() == this->type) {
+        if (getNumElementsPerRow() != 1) {
+            throw CopyException(stringFormat("Cannot copy a vector property in npy file {} to a "
+                                             "scalar property.",
+                filePath));
+        }
+        return;
+    } else if (type_.getLogicalTypeID() == LogicalTypeID::ARRAY) {
+        if (this->type != ArrayType::getChildType(type_).getLogicalTypeID()) {
+            throw CopyException(stringFormat("The type of npy file {} does not "
+                                             "match the expected type.",
+                filePath));
+        }
+        if (getNumElementsPerRow() != ArrayType::getNumElements(type_)) {
+            throw CopyException(
+                stringFormat("The shape of {} does not match {}.", filePath, type_.toString()));
+        }
+        return;
+    } else {
+        throw CopyException(stringFormat("The type of npy file {} does not "
+                                         "match the expected type.",
+            filePath));
+    }
+}
+
+void NpyReader::readBlock(block_idx_t blockIdx, ValueVector* vectorToRead) const {
+    uint64_t rowNumber = DEFAULT_VECTOR_CAPACITY * blockIdx;
+    auto numRows = getNumRows();
+    if (rowNumber >= numRows) {
+        vectorToRead->state->getSelVectorUnsafe().setSelSize(0);
+    } else {
+        auto rowPointer = getPointerToRow(rowNumber);
+        auto numRowsToRead = std::min(DEFAULT_VECTOR_CAPACITY, getNumRows() - rowNumber);
+        const auto& rowType = vectorToRead->dataType;
+        if (rowType.getLogicalTypeID() == LogicalTypeID::ARRAY) {
+            auto numValuesPerRow = ArrayType::getNumElements(rowType);
+            for (auto i = 0u; i < numRowsToRead; i++) {
+                auto listEntry = ListVector::addList(vectorToRead, numValuesPerRow);
+                vectorToRead->setValue(i, listEntry);
+            }
+            auto dataVector = ListVector::getDataVector(vectorToRead);
+            memcpy(dataVector->getData(), rowPointer,
+                numRowsToRead * numValuesPerRow * dataVector->getNumBytesPerValue());
+            vectorToRead->state->getSelVectorUnsafe().setSelSize(numRowsToRead);
+        } else {
+            memcpy(vectorToRead->getData(), rowPointer,
+                numRowsToRead * vectorToRead->getNumBytesPerValue());
+            vectorToRead->state->getSelVectorUnsafe().setSelSize(numRowsToRead);
+        }
+    }
+}
+
+NpyMultiFileReader::NpyMultiFileReader(const std::vector<std::string>& filePaths) {
+    for (auto& file : filePaths) {
+        fileReaders.push_back(std::make_unique<NpyReader>(file));
+    }
+}
+
+void NpyMultiFileReader::readBlock(block_idx_t blockIdx, DataChunk& dataChunkToRead) const {
+    for (auto i = 0u; i < fileReaders.size(); i++) {
+        fileReaders[i]->readBlock(blockIdx, &dataChunkToRead.getValueVectorMutable(i));
+    }
+}
+
+NpyScanSharedState::NpyScanSharedState(FileScanInfo fileScanInfo, uint64_t numRows)
+    : ScanFileSharedState{std::move(fileScanInfo), numRows} {
+    npyMultiFileReader = std::make_unique<NpyMultiFileReader>(this->fileScanInfo.filePaths);
+}
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput& output) {
+    auto sharedState = reinterpret_cast<NpyScanSharedState*>(input.sharedState);
+    auto [_, blockIdx] = sharedState->getNext();
+    sharedState->npyMultiFileReader->readBlock(blockIdx, output.dataChunk);
+    return output.dataChunk.state->getSelVector().getSelSize();
+}
+
+static LogicalType bindColumnType(const NpyReader& reader) {
+    if (reader.getShape().size() == 1) {
+        return LogicalType(reader.getType());
+    }
+    // For columns whose type is a multi-dimension array of size n*m,
+    // we flatten the row data into an 1-d array with size 1*k where k = n*m
+    return LogicalType::ARRAY(LogicalType(reader.getType()), reader.getNumElementsPerRow());
+}
+
+static void bindColumns(const FileScanInfo& fileScanInfo, uint32_t fileIdx,
+    std::vector<std::string>& columnNames, std::vector<LogicalType>& columnTypes) {
+    auto reader = NpyReader(fileScanInfo.filePaths[fileIdx]); // TODO: double check
+    auto columnName = std::string("column" + std::to_string(fileIdx));
+    auto columnType = bindColumnType(reader);
+    columnNames.push_back(columnName);
+    columnTypes.push_back(std::move(columnType));
+}
+
+static void bindColumns(const FileScanInfo& fileScanInfo, std::vector<std::string>& columnNames,
+    std::vector<LogicalType>& columnTypes) {
+    KU_ASSERT(fileScanInfo.getNumFiles() > 0);
+    bindColumns(fileScanInfo, 0, columnNames, columnTypes);
+    for (auto i = 1u; i < fileScanInfo.getNumFiles(); ++i) {
+        std::vector<std::string> tmpColumnNames;
+        std::vector<LogicalType> tmpColumnTypes;
+        bindColumns(fileScanInfo, i, tmpColumnNames, tmpColumnTypes);
+        ReaderBindUtils::validateNumColumns(1, tmpColumnTypes.size());
+        columnNames.push_back(tmpColumnNames[0]);
+        columnTypes.push_back(std::move(tmpColumnTypes[0]));
+    }
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    auto scanInput = ku_dynamic_cast<ExtraScanTableFuncBindInput*>(input->extraInput.get());
+    if (scanInput->fileScanInfo.options.size() > 1 ||
+        (scanInput->fileScanInfo.options.size() == 1 &&
+            !scanInput->fileScanInfo.options.contains(CopyConstants::IGNORE_ERRORS_OPTION_NAME))) {
+        throw BinderException{"Copy from numpy cannot have options other than IGNORE_ERRORS."};
+    }
+    std::vector<std::string> detectedColumnNames;
+    std::vector<LogicalType> detectedColumnTypes;
+    bindColumns(scanInput->fileScanInfo, detectedColumnNames, detectedColumnTypes);
+    std::vector<std::string> resultColumnNames;
+    std::vector<LogicalType> resultColumnTypes;
+    ReaderBindUtils::resolveColumns(scanInput->expectedColumnNames, detectedColumnNames,
+        resultColumnNames, scanInput->expectedColumnTypes, detectedColumnTypes, resultColumnTypes);
+    auto config = scanInput->fileScanInfo.copy();
+    KU_ASSERT(!config.filePaths.empty() && config.getNumFiles() == resultColumnNames.size());
+    row_idx_t numRows = 0;
+    for (auto i = 0u; i < config.getNumFiles(); i++) {
+        auto reader = make_unique<NpyReader>(config.filePaths[i]);
+        if (i == 0) {
+            numRows = reader->getNumRows();
+        }
+        reader->validate(resultColumnTypes[i], numRows);
+    }
+    resultColumnNames =
+        TableFunction::extractYieldVariables(resultColumnNames, input->yieldVariables);
+    auto columns = input->binder->createVariables(resultColumnNames, resultColumnTypes);
+    return std::make_unique<ScanFileBindData>(columns, numRows, scanInput->fileScanInfo.copy(),
+        context);
+}
+
+static std::unique_ptr<TableFuncSharedState> initSharedState(
+    const TableFuncInitSharedStateInput& input) {
+    auto bindData = input.bindData->constPtrCast<ScanFileBindData>();
+    auto reader = make_unique<NpyReader>(bindData->fileScanInfo.filePaths[0]);
+    return std::make_unique<NpyScanSharedState>(bindData->fileScanInfo.copy(), bindData->numRows);
+}
+
+static void finalizeFunc(const ExecutionContext* ctx, TableFuncSharedState*) {
+    processor::WarningContext::Get(*ctx->clientContext)->defaultPopulateAllWarnings(ctx->queryID);
+}
+
+function_set NpyScanFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    function->tableFunc = tableFunc;
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    function->finalizeFunc = finalizeFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/CMakeLists.txt
new file mode 100644
index 0000000000..3f54037d06
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/CMakeLists.txt
@@ -0,0 +1,15 @@
+add_library(lbug_processor_operator_parquet_reader
+        OBJECT
+        boolean_column_reader.cpp
+        column_reader.cpp
+        parquet_reader.cpp
+        interval_column_reader.cpp
+        struct_column_reader.cpp
+        string_column_reader.cpp
+        list_column_reader.cpp
+        parquet_timestamp.cpp
+        uuid_column_reader.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_parquet_reader>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/boolean_column_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/boolean_column_reader.cpp
new file mode 100644
index 0000000000..9c14dce343
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/boolean_column_reader.cpp
@@ -0,0 +1,27 @@
+#include "processor/operator/persistent/reader/parquet/boolean_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+void BooleanColumnReader::initializeRead(uint64_t rowGroupIdx,
+    const std::vector<lbug_parquet::format::ColumnChunk>& columns,
+    lbug_apache::thrift::protocol::TProtocol& protocol) {
+    bytePos = 0;
+    TemplatedColumnReader<bool, BooleanParquetValueConversion>::initializeRead(rowGroupIdx, columns,
+        protocol);
+}
+
+bool BooleanParquetValueConversion::plainRead(ByteBuffer& plainData, ColumnReader& reader) {
+    plainData.available(1);
+    auto& bytePos = reinterpret_cast<BooleanColumnReader&>(reader).bytePos;
+    bool ret = (*plainData.ptr >> bytePos) & 1;
+    bytePos++;
+    if (bytePos == 8) {
+        bytePos = 0;
+        plainData.inc(1);
+    }
+    return ret;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/column_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/column_reader.cpp
new file mode 100644
index 0000000000..b8ad9864a0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/column_reader.cpp
@@ -0,0 +1,585 @@
+#include "processor/operator/persistent/reader/parquet/column_reader.h"
+
+#include <sstream>
+
+#include "brotli/decode.h"
+#include "common/assert.h"
+#include "common/exception/not_implemented.h"
+#include "common/exception/runtime.h"
+#include "common/types/date_t.h"
+#include "lz4.hpp"
+#include "miniz_wrapper.hpp"
+#include "processor/operator/persistent/reader/parquet/boolean_column_reader.h"
+#include "processor/operator/persistent/reader/parquet/callback_column_reader.h"
+#include "processor/operator/persistent/reader/parquet/interval_column_reader.h"
+#include "processor/operator/persistent/reader/parquet/parquet_timestamp.h"
+#include "processor/operator/persistent/reader/parquet/string_column_reader.h"
+#include "processor/operator/persistent/reader/parquet/templated_column_reader.h"
+#include "processor/operator/persistent/reader/parquet/uuid_column_reader.h"
+#include "snappy.h"
+#include "zstd.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+using lbug_parquet::format::CompressionCodec;
+using lbug_parquet::format::ConvertedType;
+using lbug_parquet::format::Encoding;
+using lbug_parquet::format::PageType;
+using lbug_parquet::format::Type;
+
+ColumnReader::ColumnReader(ParquetReader& reader, LogicalType type,
+    const lbug_parquet::format::SchemaElement& schema, idx_t fileIdx, uint64_t maxDefinition,
+    uint64_t maxRepeat)
+    : schema{schema}, fileIdx{fileIdx}, maxDefine{maxDefinition}, maxRepeat{maxRepeat},
+      reader{reader}, type{std::move(type)}, protocol(nullptr), pageRowsAvailable{0},
+      groupRowsAvailable(0), chunkReadOffset(0) {}
+
+void ColumnReader::initializeRead(uint64_t /*rowGroupIdx*/,
+    const std::vector<lbug_parquet::format::ColumnChunk>& columns,
+    lbug_apache::thrift::protocol::TProtocol& protocol) {
+    KU_ASSERT(fileIdx < columns.size());
+    chunk = &columns[fileIdx];
+    this->protocol = &protocol;
+    KU_ASSERT(chunk);
+    KU_ASSERT(chunk->__isset.meta_data);
+
+    if (chunk->__isset.file_path) {
+        throw std::runtime_error("Only inlined data files are supported (no references)");
+    }
+
+    // ugh. sometimes there is an extra offset for the dict. sometimes it's wrong.
+    chunkReadOffset = chunk->meta_data.data_page_offset;
+    if (chunk->meta_data.__isset.dictionary_page_offset &&
+        chunk->meta_data.dictionary_page_offset >= 4) {
+        // this assumes the data pages follow the dict pages directly.
+        chunkReadOffset = chunk->meta_data.dictionary_page_offset;
+    }
+    groupRowsAvailable = chunk->meta_data.num_values;
+}
+
+void ColumnReader::registerPrefetch(ThriftFileTransport& transport, bool allowMerge) {
+    if (chunk) {
+        uint64_t size = chunk->meta_data.total_compressed_size;
+        transport.RegisterPrefetch(fileOffset(), size, allowMerge);
+    }
+}
+
+uint64_t ColumnReader::fileOffset() const {
+    if (!chunk) {
+        throw std::runtime_error("fileOffset called on ColumnReader with no chunk");
+    }
+    auto minOffset = UINT64_MAX;
+    if (chunk->meta_data.__isset.dictionary_page_offset) {
+        minOffset = std::min<uint64_t>(minOffset, chunk->meta_data.dictionary_page_offset);
+    }
+    if (chunk->meta_data.__isset.index_page_offset) {
+        minOffset = std::min<uint64_t>(minOffset, chunk->meta_data.index_page_offset);
+    }
+    minOffset = std::min<uint64_t>(minOffset, chunk->meta_data.data_page_offset);
+
+    return minOffset;
+}
+
+void ColumnReader::applyPendingSkips(uint64_t numValues) {
+    pendingSkips -= numValues;
+
+    dummyDefine.zero();
+    dummyRepeat.zero();
+
+    // TODO this can be optimized, for example we dont actually have to bitunpack offsets
+    std::unique_ptr<common::ValueVector> dummyResult =
+        std::make_unique<common::ValueVector>(type.copy());
+
+    uint64_t remaining = numValues;
+    uint64_t numValuesRead = 0;
+
+    while (remaining) {
+        auto numValuesToRead = std::min<uint64_t>(remaining, common::DEFAULT_VECTOR_CAPACITY);
+        numValuesRead +=
+            read(numValuesToRead, noneFilter, dummyDefine.ptr, dummyRepeat.ptr, dummyResult.get());
+        remaining -= numValuesToRead;
+    }
+
+    if (numValuesRead != numValues) {
+        throw std::runtime_error("Row count mismatch when skipping rows");
+    }
+}
+
+uint64_t ColumnReader::read(uint64_t numValues, parquet_filter_t& filter, uint8_t* defineOut,
+    uint8_t* repeatOut, common::ValueVector* resultOut) {
+    // we need to reset the location because multiple column readers share the same protocol
+    auto& trans = reinterpret_cast<ThriftFileTransport&>(*protocol->getTransport());
+    trans.SetLocation(chunkReadOffset);
+
+    // Perform any skips that were not applied yet.
+    if (pendingSkips > 0) {
+        applyPendingSkips(pendingSkips);
+    }
+
+    uint64_t resultOffset = 0;
+    auto toRead = numValues;
+
+    while (toRead > 0) {
+        while (pageRowsAvailable == 0) {
+            prepareRead(filter);
+        }
+
+        KU_ASSERT(block);
+        auto readNow = std::min<uint64_t>(toRead, pageRowsAvailable);
+
+        KU_ASSERT(readNow <= common::DEFAULT_VECTOR_CAPACITY);
+
+        if (hasRepeats()) {
+            KU_ASSERT(repeatedDecoder);
+            repeatedDecoder->GetBatch<uint8_t>(repeatOut + resultOffset, readNow);
+        }
+
+        if (hasDefines()) {
+            KU_ASSERT(defineDecoder);
+            defineDecoder->GetBatch<uint8_t>(defineOut + resultOffset, readNow);
+        }
+
+        uint64_t nullCount = 0;
+
+        if ((dictDecoder || dbpDecoder || rleDecoder) && hasDefines()) {
+            // we need the null count because the dictionary offsets have no entries for nulls
+            for (auto i = 0u; i < readNow; i++) {
+                if (defineOut[i + resultOffset] != maxDefine) {
+                    nullCount++;
+                }
+            }
+        }
+
+        if (dictDecoder) {
+            offsetBuffer.resize(sizeof(uint32_t) * (readNow - nullCount));
+            dictDecoder->GetBatch<uint32_t>(offsetBuffer.ptr, readNow - nullCount);
+            offsets(reinterpret_cast<uint32_t*>(offsetBuffer.ptr), defineOut, readNow, filter,
+                resultOffset, resultOut);
+        } else if (dbpDecoder) {
+            // TODO keep this in the state
+            auto readBuf = std::make_shared<ResizeableBuffer>();
+
+            switch (type.getPhysicalType()) {
+            case common::PhysicalTypeID::INT32:
+                readBuf->resize(sizeof(int32_t) * (readNow - nullCount));
+                dbpDecoder->GetBatch<int32_t>(readBuf->ptr, readNow - nullCount);
+                break;
+            case common::PhysicalTypeID::INT64:
+                readBuf->resize(sizeof(int64_t) * (readNow - nullCount));
+                dbpDecoder->GetBatch<int64_t>(readBuf->ptr, readNow - nullCount);
+                break;
+            default:
+                throw std::runtime_error("DELTA_BINARY_PACKED should only be INT32 or INT64");
+            }
+            // Plain() will put NULLs in the right place
+            plain(readBuf, defineOut, readNow, filter, resultOffset, resultOut);
+        } else if (rleDecoder) {
+            // RLE encoding for boolean
+            KU_ASSERT(type.getLogicalTypeID() == common::LogicalTypeID::BOOL);
+            auto readBuf = std::make_shared<ResizeableBuffer>();
+            readBuf->resize(sizeof(bool) * (readNow - nullCount));
+            rleDecoder->GetBatch<uint8_t>(readBuf->ptr, readNow - nullCount);
+            plainTemplated<bool, TemplatedParquetValueConversion<bool>>(readBuf, defineOut, readNow,
+                filter, resultOffset, resultOut);
+        } else {
+            plain(block, defineOut, readNow, filter, resultOffset, resultOut);
+        }
+
+        resultOffset += readNow;
+        pageRowsAvailable -= readNow;
+        toRead -= readNow;
+    }
+    groupRowsAvailable -= numValues;
+    chunkReadOffset = trans.GetLocation();
+
+    return numValues;
+}
+
+std::unique_ptr<ColumnReader> ColumnReader::createReader(ParquetReader& reader,
+    common::LogicalType type, const lbug_parquet::format::SchemaElement& schema, uint64_t fileIdx,
+    uint64_t maxDefine, uint64_t maxRepeat) {
+    switch (type.getLogicalTypeID()) {
+    case common::LogicalTypeID::BOOL:
+        return std::make_unique<BooleanColumnReader>(reader, std::move(type), schema, fileIdx,
+            maxDefine, maxRepeat);
+    case common::LogicalTypeID::INT8:
+        return std::make_unique<
+            TemplatedColumnReader<int8_t, TemplatedParquetValueConversion<int32_t>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::INT16:
+        return std::make_unique<
+            TemplatedColumnReader<int16_t, TemplatedParquetValueConversion<int32_t>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::INT32:
+        return std::make_unique<
+            TemplatedColumnReader<int32_t, TemplatedParquetValueConversion<int32_t>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::SERIAL:
+    case common::LogicalTypeID::INT64:
+        return std::make_unique<
+            TemplatedColumnReader<int64_t, TemplatedParquetValueConversion<int64_t>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::UINT8:
+        return std::make_unique<
+            TemplatedColumnReader<uint8_t, TemplatedParquetValueConversion<uint32_t>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::UINT16:
+        return std::make_unique<
+            TemplatedColumnReader<uint16_t, TemplatedParquetValueConversion<uint32_t>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::UINT32:
+        return std::make_unique<
+            TemplatedColumnReader<uint32_t, TemplatedParquetValueConversion<uint32_t>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::UINT64:
+        return std::make_unique<
+            TemplatedColumnReader<uint64_t, TemplatedParquetValueConversion<uint64_t>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::FLOAT:
+        return std::make_unique<
+            TemplatedColumnReader<float, TemplatedParquetValueConversion<float>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::DOUBLE:
+        return std::make_unique<
+            TemplatedColumnReader<double, TemplatedParquetValueConversion<double>>>(reader,
+            std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::DATE:
+        return std::make_unique<
+            CallbackColumnReader<int32_t, common::date_t, ParquetTimeStampUtils::parquetIntToDate>>(
+            reader, std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+    case common::LogicalTypeID::BLOB:
+    case common::LogicalTypeID::STRING:
+        return std::make_unique<StringColumnReader>(reader, std::move(type), schema, fileIdx,
+            maxDefine, maxRepeat);
+    case common::LogicalTypeID::INTERVAL:
+        return std::make_unique<IntervalColumnReader>(reader, std::move(type), schema, fileIdx,
+            maxDefine, maxRepeat);
+    case common::LogicalTypeID::TIMESTAMP_TZ:
+    case common::LogicalTypeID::TIMESTAMP:
+        return createTimestampReader(reader, std::move(type), schema, fileIdx, maxDefine,
+            maxRepeat);
+    case common::LogicalTypeID::UUID:
+        return std::make_unique<UUIDColumnReader>(reader, std::move(type), schema, fileIdx,
+            maxDefine, maxRepeat);
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void ColumnReader::prepareRead(parquet_filter_t& /*filter*/) {
+    dictDecoder.reset();
+    defineDecoder.reset();
+    block.reset();
+    lbug_parquet::format::PageHeader pageHdr;
+    pageHdr.read(protocol);
+
+    switch (pageHdr.type) {
+    case PageType::DATA_PAGE_V2:
+        preparePageV2(pageHdr);
+        prepareDataPage(pageHdr);
+        break;
+    case PageType::DATA_PAGE:
+        preparePage(pageHdr);
+        prepareDataPage(pageHdr);
+        break;
+    case PageType::DICTIONARY_PAGE:
+        preparePage(pageHdr);
+        dictionary(block, pageHdr.dictionary_page_header.num_values);
+        break;
+    default:
+        break; // ignore INDEX page type and any other custom extensions
+    }
+    resetPage();
+}
+
+void ColumnReader::allocateBlock(uint64_t size) {
+    if (!block) {
+        block = std::make_shared<ResizeableBuffer>(size);
+    } else {
+        block->resize(size);
+    }
+}
+
+void ColumnReader::allocateCompressed(uint64_t size) {
+    compressedBuffer.resize(size);
+}
+
+static void brotliDecompress(uint8_t* dst, size_t dstSize, const uint8_t* src, size_t srcSize) {
+    auto instance = BrotliDecoderCreateInstance(nullptr /* alloc_func */, nullptr /* free_func */,
+        nullptr /* opaque */);
+    BrotliDecoderResult oneshotResult{};
+    do {
+        oneshotResult =
+            BrotliDecoderDecompressStream(instance, &srcSize, &src, &dstSize, &dst, nullptr);
+    } while (srcSize != 0 || oneshotResult != BROTLI_DECODER_RESULT_SUCCESS);
+    BrotliDecoderDestroyInstance(instance);
+}
+
+void ColumnReader::decompressInternal(lbug_parquet::format::CompressionCodec::type codec,
+    const uint8_t* src, uint64_t srcSize, uint8_t* dst, uint64_t dstSize) {
+    switch (codec) {
+    case CompressionCodec::UNCOMPRESSED:
+        throw common::CopyException("Parquet data unexpectedly uncompressed");
+    case CompressionCodec::GZIP: {
+        MiniZStream s;
+        s.Decompress(reinterpret_cast<const char*>(src), srcSize, reinterpret_cast<char*>(dst),
+            dstSize);
+    } break;
+    case CompressionCodec::SNAPPY: {
+        {
+            size_t uncompressedSize = 0;
+            auto res = lbug_snappy::GetUncompressedLength(reinterpret_cast<const char*>(src),
+                srcSize, &uncompressedSize);
+            // LCOV_EXCL_START
+            if (!res) {
+                throw common::RuntimeException{"Failed to decompress parquet file."};
+            }
+            if (uncompressedSize != (size_t)dstSize) {
+                throw common::RuntimeException{
+                    "Snappy decompression failure: Uncompressed data size mismatch"};
+            }
+            // LCOV_EXCL_STOP
+        }
+        auto res = lbug_snappy::RawUncompress(reinterpret_cast<const char*>(src), srcSize,
+            reinterpret_cast<char*>(dst));
+        // LCOV_EXCL_START
+        if (!res) {
+            throw common::RuntimeException{"Snappy decompression failed."};
+        }
+        // LCOV_EXCL_STOP
+    } break;
+    case CompressionCodec::ZSTD: {
+        auto res = lbug_zstd::ZSTD_decompress(dst, dstSize, src, srcSize);
+        // LCOV_EXCL_START
+        if (lbug_zstd::ZSTD_isError(res) || res != (size_t)dstSize) {
+            throw common::RuntimeException{"ZSTD decompression failed."};
+        }
+        // LCOV_EXCL_STOP
+    } break;
+    case CompressionCodec::BROTLI: {
+        brotliDecompress(dst, dstSize, src, srcSize);
+    } break;
+    case CompressionCodec::LZ4_RAW: {
+        auto res = lbug_lz4::LZ4_decompress_safe(reinterpret_cast<const char*>(src),
+            reinterpret_cast<char*>(dst), srcSize, dstSize);
+        // LCOV_EXCL_START
+        if (res != (int64_t)dstSize) {
+            throw common::RuntimeException{"LZ4 decompression failed."};
+        }
+        // LCOV_EXCL_STOP
+    } break;
+    default: {
+        // LCOV_EXCL_START
+        std::stringstream codec_name;
+        codec_name << codec;
+        throw common::CopyException("Unsupported compression codec \"" + codec_name.str() +
+                                    "\". Supported options are uncompressed, gzip, snappy or zstd");
+        // LCOV_EXCL_STOP
+    }
+    }
+}
+
+void ColumnReader::preparePageV2(lbug_parquet::format::PageHeader& pageHdr) {
+    KU_ASSERT(pageHdr.type == PageType::DATA_PAGE_V2);
+
+    auto& trans = reinterpret_cast<ThriftFileTransport&>(*protocol->getTransport());
+
+    allocateBlock(pageHdr.uncompressed_page_size + 1);
+    bool uncompressed = false;
+    if (pageHdr.data_page_header_v2.__isset.is_compressed &&
+        !pageHdr.data_page_header_v2.is_compressed) {
+        uncompressed = true;
+    }
+    if (chunk->meta_data.codec == CompressionCodec::UNCOMPRESSED) {
+        if (pageHdr.compressed_page_size != pageHdr.uncompressed_page_size) {
+            throw std::runtime_error("Page size mismatch");
+        }
+        uncompressed = true;
+    }
+    if (uncompressed) {
+        trans.read(block->ptr, pageHdr.compressed_page_size);
+        return;
+    }
+
+    // copy repeats & defines as-is because FOR SOME REASON they are uncompressed
+    auto uncompressedBytes = pageHdr.data_page_header_v2.repetition_levels_byte_length +
+                             pageHdr.data_page_header_v2.definition_levels_byte_length;
+    trans.read(block->ptr, uncompressedBytes);
+
+    auto compressedBytes = pageHdr.compressed_page_size - uncompressedBytes;
+
+    allocateCompressed(compressedBytes);
+    trans.read(compressedBuffer.ptr, compressedBytes);
+
+    decompressInternal(chunk->meta_data.codec, compressedBuffer.ptr, compressedBytes,
+        block->ptr + uncompressedBytes, pageHdr.uncompressed_page_size - uncompressedBytes);
+}
+
+void ColumnReader::preparePage(lbug_parquet::format::PageHeader& pageHdr) {
+    auto& trans = reinterpret_cast<ThriftFileTransport&>(*protocol->getTransport());
+
+    allocateBlock(pageHdr.uncompressed_page_size + 1);
+    if (chunk->meta_data.codec == CompressionCodec::UNCOMPRESSED) {
+        if (pageHdr.compressed_page_size != pageHdr.uncompressed_page_size) {
+            throw std::runtime_error("Page size mismatch");
+        }
+        trans.read((uint8_t*)block->ptr, pageHdr.compressed_page_size);
+        return;
+    }
+
+    allocateCompressed(pageHdr.compressed_page_size + 1);
+    trans.read((uint8_t*)compressedBuffer.ptr, pageHdr.compressed_page_size);
+
+    decompressInternal(chunk->meta_data.codec, compressedBuffer.ptr, pageHdr.compressed_page_size,
+        block->ptr, pageHdr.uncompressed_page_size);
+}
+
+void ColumnReader::prepareDataPage(lbug_parquet::format::PageHeader& pageHdr) {
+    if (pageHdr.type == PageType::DATA_PAGE && !pageHdr.__isset.data_page_header) {
+        throw std::runtime_error("Missing data page header from data page");
+    }
+    if (pageHdr.type == PageType::DATA_PAGE_V2 && !pageHdr.__isset.data_page_header_v2) {
+        throw std::runtime_error("Missing data page header from data page v2");
+    }
+
+    bool isV1 = pageHdr.type == PageType::DATA_PAGE;
+    bool isV2 = pageHdr.type == PageType::DATA_PAGE_V2;
+    auto& v1Header = pageHdr.data_page_header;
+    auto& v2Header = pageHdr.data_page_header_v2;
+
+    pageRowsAvailable = isV1 ? v1Header.num_values : v2Header.num_values;
+    auto pageEncoding = isV1 ? v1Header.encoding : v2Header.encoding;
+
+    if (hasRepeats()) {
+        uint32_t repLength =
+            isV1 ? block->read<uint32_t>() : v2Header.repetition_levels_byte_length;
+        block->available(repLength);
+        repeatedDecoder = std::make_unique<RleBpDecoder>(block->ptr, repLength,
+            RleBpDecoder::ComputeBitWidth(maxRepeat));
+        block->inc(repLength);
+    } else if (isV2 && v2Header.repetition_levels_byte_length > 0) {
+        block->inc(v2Header.repetition_levels_byte_length);
+    }
+
+    if (hasDefines()) {
+        auto defLen = isV1 ? block->read<uint32_t>() : v2Header.definition_levels_byte_length;
+        block->available(defLen);
+        defineDecoder = std::make_unique<RleBpDecoder>(block->ptr, defLen,
+            RleBpDecoder::ComputeBitWidth(maxDefine));
+        block->inc(defLen);
+    } else if (isV2 && v2Header.definition_levels_byte_length > 0) {
+        block->inc(v2Header.definition_levels_byte_length);
+    }
+
+    switch (pageEncoding) {
+    case Encoding::RLE_DICTIONARY:
+    case Encoding::PLAIN_DICTIONARY: {
+        // where is it otherwise??
+        auto dictWidth = block->read<uint8_t>();
+        // TODO somehow dict_width can be 0 ?
+        dictDecoder = std::make_unique<RleBpDecoder>(block->ptr, block->len, dictWidth);
+        block->inc(block->len);
+        break;
+    }
+    case Encoding::RLE: {
+        if (type.getLogicalTypeID() != common::LogicalTypeID::BOOL) {
+            throw std::runtime_error("RLE encoding is only supported for boolean data");
+        }
+        block->inc(sizeof(uint32_t));
+        rleDecoder = std::make_unique<RleBpDecoder>(block->ptr, block->len, 1);
+        break;
+    }
+    case Encoding::DELTA_BINARY_PACKED: {
+        dbpDecoder = std::make_unique<DbpDecoder>(block->ptr, block->len);
+        block->inc(block->len);
+        break;
+    }
+    case Encoding::DELTA_LENGTH_BYTE_ARRAY:
+    case Encoding::DELTA_BYTE_ARRAY: {
+        KU_UNREACHABLE;
+    }
+    case Encoding::PLAIN:
+        // nothing to do here, will be read directly below
+        break;
+    default:
+        throw common::NotImplementedException("Parquet: unsupported page encoding");
+    }
+}
+
+uint64_t ColumnReader::getTotalCompressedSize() {
+    if (!chunk) {
+        return 0;
+    }
+    return chunk->meta_data.total_compressed_size;
+}
+
+std::unique_ptr<ColumnReader> ColumnReader::createTimestampReader(ParquetReader& reader,
+    common::LogicalType type, const lbug_parquet::format::SchemaElement& schema, uint64_t fileIdx,
+    uint64_t maxDefine, uint64_t maxRepeat) {
+    switch (schema.type) {
+    case Type::INT96: {
+        return std::make_unique<CallbackColumnReader<Int96, common::timestamp_t,
+            ParquetTimeStampUtils::impalaTimestampToTimestamp>>(reader, std::move(type), schema,
+            fileIdx, maxDefine, maxRepeat);
+    }
+    case Type::INT64: {
+        if (schema.__isset.logicalType && schema.logicalType.__isset.TIMESTAMP) {
+            if (schema.logicalType.TIMESTAMP.unit.__isset.MILLIS) {
+                return std::make_unique<CallbackColumnReader<int64_t, common::timestamp_t,
+                    ParquetTimeStampUtils::parquetTimestampMsToTimestamp>>(reader, std::move(type),
+                    schema, fileIdx, maxDefine, maxRepeat);
+            } else if (schema.logicalType.TIMESTAMP.unit.__isset.MICROS) {
+                return std::make_unique<CallbackColumnReader<int64_t, common::timestamp_t,
+                    ParquetTimeStampUtils::parquetTimestampMicrosToTimestamp>>(reader,
+                    std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+            } else if (schema.logicalType.TIMESTAMP.unit.__isset.NANOS) {
+                return std::make_unique<CallbackColumnReader<int64_t, common::timestamp_t,
+                    ParquetTimeStampUtils::parquetTimestampNsToTimestamp>>(reader, std::move(type),
+                    schema, fileIdx, maxDefine, maxRepeat);
+            }
+            // LCOV_EXCL_START
+        } else if (schema.__isset.converted_type) {
+            // For legacy compatibility.
+            switch (schema.converted_type) {
+            case ConvertedType::TIMESTAMP_MICROS:
+                return std::make_unique<CallbackColumnReader<int64_t, common::timestamp_t,
+                    ParquetTimeStampUtils::parquetTimestampMicrosToTimestamp>>(reader,
+                    std::move(type), schema, fileIdx, maxDefine, maxRepeat);
+            case ConvertedType::TIMESTAMP_MILLIS:
+                return std::make_unique<CallbackColumnReader<int64_t, common::timestamp_t,
+                    ParquetTimeStampUtils::parquetTimestampMsToTimestamp>>(reader, std::move(type),
+                    schema, fileIdx, maxDefine, maxRepeat);
+            default:
+                KU_UNREACHABLE;
+            }
+            // LCOV_EXCL_STOP
+        }
+        KU_UNREACHABLE;
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+const uint64_t ParquetDecodeUtils::BITPACK_MASKS[] = {0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023,
+    2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303,
+    8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647,
+    4294967295, 8589934591, 17179869183, 34359738367, 68719476735, 137438953471, 274877906943,
+    549755813887, 1099511627775, 2199023255551, 4398046511103, 8796093022207, 17592186044415,
+    35184372088831, 70368744177663, 140737488355327, 281474976710655, 562949953421311,
+    1125899906842623, 2251799813685247, 4503599627370495, 9007199254740991, 18014398509481983,
+    36028797018963967, 72057594037927935, 144115188075855871, 288230376151711743,
+    576460752303423487, 1152921504606846975, 2305843009213693951, 4611686018427387903,
+    9223372036854775807, 18446744073709551615ULL};
+
+const uint64_t ParquetDecodeUtils::BITPACK_MASKS_SIZE =
+    sizeof(ParquetDecodeUtils::BITPACK_MASKS) / sizeof(uint64_t);
+
+const uint8_t ParquetDecodeUtils::BITPACK_DLEN = 8;
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/interval_column_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/interval_column_reader.cpp
new file mode 100644
index 0000000000..8f8e05974a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/interval_column_reader.cpp
@@ -0,0 +1,34 @@
+#include "processor/operator/persistent/reader/parquet/interval_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+common::interval_t IntervalValueConversion::readParquetInterval(const char* input) {
+    common::interval_t result;
+    auto inputData = reinterpret_cast<const uint32_t*>(input);
+    result.months = inputData[0];
+    result.days = inputData[1];
+    result.micros = int64_t(inputData[2]) * 1000;
+    return result;
+}
+
+common::interval_t IntervalValueConversion::plainRead(ByteBuffer& plainData,
+    ColumnReader& /*reader*/) {
+    auto intervalLen = common::ParquetConstants::PARQUET_INTERVAL_SIZE;
+    plainData.available(intervalLen);
+    auto res = readParquetInterval(reinterpret_cast<const char*>(plainData.ptr));
+    plainData.inc(intervalLen);
+    return res;
+}
+
+void IntervalColumnReader::dictionary(const std::shared_ptr<ResizeableBuffer>& dictionaryData,
+    uint64_t numEntries) {
+    allocateDict(numEntries * sizeof(common::interval_t));
+    auto dict_ptr = reinterpret_cast<common::interval_t*>(this->dict->ptr);
+    for (auto i = 0u; i < numEntries; i++) {
+        dict_ptr[i] = IntervalValueConversion::plainRead(*dictionaryData, *this);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/list_column_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/list_column_reader.cpp
new file mode 100644
index 0000000000..1a60abbe2d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/list_column_reader.cpp
@@ -0,0 +1,131 @@
+#include "processor/operator/persistent/reader/parquet/list_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+ListColumnReader::ListColumnReader(ParquetReader& reader, common::LogicalType type,
+    const lbug_parquet::format::SchemaElement& schema, uint64_t schemaIdx, uint64_t maxDefine,
+    uint64_t maxRepeat, std::unique_ptr<ColumnReader> childColumnReader,
+    storage::MemoryManager* memoryManager)
+    : ColumnReader(reader, std::move(type), schema, schemaIdx, maxDefine, maxRepeat),
+      childColumnReader(std::move(childColumnReader)), overflowChildCount(0) {
+    childDefines.resize(common::DEFAULT_VECTOR_CAPACITY);
+    childRepeats.resize(common::DEFAULT_VECTOR_CAPACITY);
+    childDefinesPtr = (uint8_t*)childDefines.ptr;
+    childRepeatsPtr = (uint8_t*)childRepeats.ptr;
+    childFilter.set();
+    vectorToRead = std::make_unique<common::ValueVector>(
+        common::ListType::getChildType(this->type).copy(), memoryManager);
+}
+
+void ListColumnReader::applyPendingSkips(uint64_t numValues) {
+    pendingSkips -= numValues;
+    auto defineOut = std::unique_ptr<uint8_t[]>(new uint8_t[numValues]);
+    auto repeatOut = std::unique_ptr<uint8_t[]>(new uint8_t[numValues]);
+    uint64_t remaining = numValues;
+    uint64_t numValuesRead = 0;
+    while (remaining) {
+        auto result_out = std::make_unique<common::ValueVector>(type.copy());
+        parquet_filter_t filter;
+        auto to_read = std::min<uint64_t>(remaining, common::DEFAULT_VECTOR_CAPACITY);
+        numValuesRead += read(to_read, filter, defineOut.get(), repeatOut.get(), result_out.get());
+        remaining -= to_read;
+    }
+
+    if (numValuesRead != numValues) {
+        throw common::CopyException("Not all skips done!");
+    }
+}
+
+uint64_t ListColumnReader::read(uint64_t numValues, parquet_filter_t& /*filter*/,
+    uint8_t* defineOut, uint8_t* repeatOut, common::ValueVector* resultOut) {
+    common::offset_t resultOffset = 0;
+    auto resultPtr = reinterpret_cast<common::list_entry_t*>(resultOut->getData());
+
+    if (pendingSkips > 0) {
+        applyPendingSkips(pendingSkips);
+    }
+
+    // if an individual list is longer than STANDARD_VECTOR_SIZE we actually have to loop the child
+    // read to fill it
+    bool finished = false;
+    while (!finished) {
+        uint64_t childActualNumValues = 0;
+
+        // check if we have any overflow from a previous read
+        if (overflowChildCount == 0) {
+            // we don't: read elements from the child reader
+            childDefines.zero();
+            childRepeats.zero();
+            // we don't know in advance how many values to read because of the beautiful
+            // repetition/definition setup we just read (up to) a vector from the child column, and
+            // see if we have read enough if we have not read enough, we read another vector if we
+            // have read enough, we leave any unhandled elements in the overflow vector for a
+            // subsequent read
+            auto childReqNumValues = std::min<uint64_t>(common::DEFAULT_VECTOR_CAPACITY,
+                childColumnReader->getGroupRowsAvailable());
+            childActualNumValues = childColumnReader->read(childReqNumValues, childFilter,
+                childDefinesPtr, childRepeatsPtr, vectorToRead.get());
+        } else {
+            childActualNumValues = overflowChildCount;
+            overflowChildCount = 0;
+        }
+
+        if (childActualNumValues == 0) {
+            // no more elements available: we are done
+            break;
+        }
+        auto currentChunkOffset = common::ListVector::getDataVectorSize(resultOut);
+
+        // hard-won piece of code this, modify at your own risk
+        // the intuition is that we have to only collapse values into lists that are repeated *on
+        // this level* the rest is pretty much handed up as-is as a single-valued list or NULL
+        uint64_t childIdx = 0;
+        for (childIdx = 0; childIdx < childActualNumValues; childIdx++) {
+            if (childRepeatsPtr[childIdx] == maxRepeat) {
+                // value repeats on this level, append
+                KU_ASSERT(resultOffset > 0);
+                resultPtr[resultOffset - 1].size++;
+                continue;
+            }
+
+            if (resultOffset >= numValues) {
+                // we ran out of output space
+                finished = true;
+                break;
+            }
+            if (childDefinesPtr[childIdx] >= maxDefine) {
+                resultOut->setNull(resultOffset, false);
+                // value has been defined down the stack, hence its NOT NULL
+                resultPtr[resultOffset].offset = childIdx + currentChunkOffset;
+                resultPtr[resultOffset].size = 1;
+            } else if (childDefinesPtr[childIdx] == maxDefine - 1) {
+                resultOut->setNull(resultOffset, false);
+                resultPtr[resultOffset].offset = childIdx + currentChunkOffset;
+                resultPtr[resultOffset].size = 0;
+            } else {
+                resultOut->setNull(resultOffset, true);
+                resultPtr[resultOffset].offset = 0;
+                resultPtr[resultOffset].size = 0;
+            }
+
+            repeatOut[resultOffset] = childRepeatsPtr[childIdx];
+            defineOut[resultOffset] = childDefinesPtr[childIdx];
+
+            resultOffset++;
+        }
+        common::ListVector::appendDataVector(resultOut, vectorToRead.get(), childIdx);
+        if (childIdx < childActualNumValues && resultOffset == numValues) {
+            common::ListVector::sliceDataVector(vectorToRead.get(), childIdx, childActualNumValues);
+            overflowChildCount = childActualNumValues - childIdx;
+            for (auto repdefIdx = 0u; repdefIdx < overflowChildCount; repdefIdx++) {
+                childDefinesPtr[repdefIdx] = childDefinesPtr[childIdx + repdefIdx];
+                childRepeatsPtr[repdefIdx] = childRepeatsPtr[childIdx + repdefIdx];
+            }
+        }
+    }
+    return resultOffset;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/parquet_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/parquet_reader.cpp
new file mode 100644
index 0000000000..0f905fd87c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/parquet_reader.cpp
@@ -0,0 +1,756 @@
+#include "processor/operator/persistent/reader/parquet/parquet_reader.h"
+
+#include "binder/binder.h"
+#include "common/exception/binder.h"
+#include "common/exception/copy.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/string_format.h"
+#include "function/table/bind_data.h"
+#include "function/table/bind_input.h"
+#include "function/table/table_function.h"
+#include "processor/execution_context.h"
+#include "processor/operator/persistent/reader/parquet/list_column_reader.h"
+#include "processor/operator/persistent/reader/parquet/struct_column_reader.h"
+#include "processor/operator/persistent/reader/parquet/thrift_tools.h"
+#include "processor/operator/persistent/reader/reader_bind_utils.h"
+#include "processor/warning_context.h"
+
+using namespace lbug_parquet::format;
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug::function;
+using namespace lbug::common;
+
+ParquetReader::ParquetReader(std::string filePath, std::vector<bool> columnSkips,
+    main::ClientContext* context)
+    : filePath{std::move(filePath)}, columnSkips(std::move(columnSkips)), context{context} {
+    initMetadata();
+}
+
+void ParquetReader::initializeScan(ParquetReaderScanState& state,
+    std::vector<uint64_t> groups_to_read, VirtualFileSystem* vfs) {
+    state.currentGroup = -1;
+    state.finished = false;
+    state.groupOffset = 0;
+    state.groupIdxList = std::move(groups_to_read);
+    if (!state.fileInfo || state.fileInfo->path != filePath) {
+        state.prefetchMode = false;
+        state.fileInfo =
+            vfs->openFile(filePath, common::FileOpenFlags(FileFlags::READ_ONLY), context);
+    }
+
+    state.thriftFileProto = createThriftProtocol(state.fileInfo.get(), state.prefetchMode);
+    state.rootReader = createReader();
+    state.defineBuf.resize(DEFAULT_VECTOR_CAPACITY);
+    state.repeatBuf.resize(DEFAULT_VECTOR_CAPACITY);
+}
+
+bool ParquetReader::scanInternal(ParquetReaderScanState& state, DataChunk& result) {
+    if (state.finished) {
+        return false;
+    }
+
+    // see if we have to switch to the next row group in the parquet file
+    if (state.currentGroup < 0 || (int64_t)state.groupOffset >= getGroup(state).num_rows) {
+        state.currentGroup++;
+        state.groupOffset = 0;
+
+        auto& trans = ku_dynamic_cast<ThriftFileTransport&>(*state.thriftFileProto->getTransport());
+        trans.ClearPrefetch();
+        state.currentGroupPrefetched = false;
+
+        if ((uint64_t)state.currentGroup == state.groupIdxList.size()) {
+            state.finished = true;
+            return false;
+        }
+
+        uint64_t toScanCompressedBytes = 0;
+        for (auto colIdx = 0u; colIdx < result.getNumValueVectors(); colIdx++) {
+            prepareRowGroupBuffer(state, colIdx);
+
+            auto fileColIdx = colIdx;
+
+            auto rootReader = ku_dynamic_cast<StructColumnReader*>(state.rootReader.get());
+            toScanCompressedBytes +=
+                rootReader->getChildReader(fileColIdx)->getTotalCompressedSize();
+        }
+
+        auto& group = getGroup(state);
+        if (state.prefetchMode && state.groupOffset != (uint64_t)group.num_rows) {
+
+            uint64_t totalRowGroupSpan = getGroupSpan(state);
+
+            double scanPercentage = (double)(toScanCompressedBytes) / totalRowGroupSpan;
+
+            // LCOV_EXCL_START
+            if (toScanCompressedBytes > totalRowGroupSpan) {
+                throw CopyException("Malformed parquet file: sum of total compressed bytes "
+                                    "of columns seems incorrect");
+            }
+            // LCOV_EXCL_STOP
+
+            if (scanPercentage > ParquetReaderPrefetchConfig::WHOLE_GROUP_PREFETCH_MINIMUM_SCAN) {
+                // Prefetch the whole row group
+                if (!state.currentGroupPrefetched) {
+                    auto totalCompressedSize = getGroupCompressedSize(state);
+                    if (totalCompressedSize > 0) {
+                        trans.Prefetch(getGroupOffset(state), totalRowGroupSpan);
+                    }
+                    state.currentGroupPrefetched = true;
+                }
+            } else {
+                // Prefetch column-wise.
+                for (auto colIdx = 0u; colIdx < result.getNumValueVectors(); colIdx++) {
+                    auto fileColIdx = colIdx;
+                    auto rootReader = ku_dynamic_cast<StructColumnReader*>(state.rootReader.get());
+
+                    rootReader->getChildReader(fileColIdx)
+                        ->registerPrefetch(trans, true /* lazy fetch */);
+                }
+                trans.FinalizeRegistration();
+                trans.PrefetchRegistered();
+            }
+        }
+        return true;
+    }
+
+    auto thisOutputChunkRows =
+        std::min<uint64_t>(DEFAULT_VECTOR_CAPACITY, getGroup(state).num_rows - state.groupOffset);
+    result.state->getSelVectorUnsafe().setSelSize(thisOutputChunkRows);
+
+    if (thisOutputChunkRows == 0) {
+        state.finished = true;
+        return false; // end of last group, we are done
+    }
+
+    // we evaluate simple table filters directly in this scan, so we can skip decoding column data
+    // that's never going to be relevant
+    parquet_filter_t filterMask;
+    filterMask.set();
+
+    // mask out unused part of bitset
+    for (auto i = thisOutputChunkRows; i < DEFAULT_VECTOR_CAPACITY; i++) {
+        filterMask.set(i, false);
+    }
+
+    state.defineBuf.zero();
+    state.repeatBuf.zero();
+
+    auto definePtr = (uint8_t*)state.defineBuf.ptr;
+    auto repeatPtr = (uint8_t*)state.repeatBuf.ptr;
+
+    auto rootReader = ku_dynamic_cast<StructColumnReader*>(state.rootReader.get());
+    for (auto colIdx = 0u; colIdx < result.getNumValueVectors(); colIdx++) {
+        if (!columnSkips.empty() && columnSkips[colIdx]) {
+            continue;
+        }
+        auto fileColIdx = colIdx;
+        auto& resultVector = result.getValueVectorMutable(colIdx);
+        auto childReader = rootReader->getChildReader(fileColIdx);
+        auto rowsRead = childReader->read(resultVector.state->getSelVector().getSelSize(),
+            filterMask, definePtr, repeatPtr, &resultVector);
+        // LCOV_EXCL_START
+        if (rowsRead != result.state->getSelVector().getSelSize()) {
+            throw CopyException(
+                stringFormat("Mismatch in parquet read for column {}, expected {} rows, got {}",
+                    fileColIdx, result.state->getSelVector().getSelSize(), rowsRead));
+        }
+        // LCOV_EXCL_STOP
+    }
+
+    state.groupOffset += thisOutputChunkRows;
+    return true;
+}
+
+void ParquetReader::scan(processor::ParquetReaderScanState& state, DataChunk& result) {
+    while (scanInternal(state, result)) {
+        if (result.state->getSelVector().getSelSize() > 0) {
+            break;
+        }
+    }
+}
+
+void ParquetReader::initMetadata() {
+    auto fileInfo = VirtualFileSystem::GetUnsafe(*context)->openFile(filePath,
+        FileOpenFlags(FileFlags::READ_ONLY), context);
+    auto proto = createThriftProtocol(fileInfo.get(), false);
+    auto& transport = ku_dynamic_cast<ThriftFileTransport&>(*proto->getTransport());
+    auto fileSize = transport.GetSize();
+    // LCOV_EXCL_START
+    if (fileSize < 12) {
+        throw CopyException{
+            stringFormat("File {} is too small to be a Parquet file", filePath.c_str())};
+    }
+    // LCOV_EXCL_STOP
+
+    ResizeableBuffer buf;
+    buf.resize(8);
+    buf.zero();
+
+    transport.SetLocation(fileSize - 8);
+    transport.read((uint8_t*)buf.ptr, 8);
+
+    // LCOV_EXCL_START
+    if (memcmp(buf.ptr + 4, "PAR1", 4) != 0) {
+        if (memcmp(buf.ptr + 4, "PARE", 4) == 0) {
+            throw CopyException{stringFormat(
+                "Encrypted Parquet files are not supported for file {}", fileInfo->path.c_str())};
+        }
+        throw CopyException{
+            stringFormat("No magic bytes found at the end of file {}", fileInfo->path.c_str())};
+    }
+    // LCOV_EXCL_STOP
+    // Read four-byte footer length from just before the end magic bytes.
+    auto footerLen = *reinterpret_cast<uint32_t*>(buf.ptr);
+    // LCOV_EXCL_START
+    if (footerLen == 0 || fileSize < 12 + footerLen) {
+        throw CopyException{stringFormat("Footer length error in file {}", fileInfo->path.c_str())};
+    }
+    // LCOV_EXCL_STOP
+    auto metadataPos = fileSize - (footerLen + 8);
+    transport.SetLocation(metadataPos);
+    transport.Prefetch(metadataPos, footerLen);
+
+    metadata = std::make_unique<FileMetaData>();
+    metadata->read(proto.get());
+}
+
+std::unique_ptr<ColumnReader> ParquetReader::createReaderRecursive(uint64_t depth,
+    uint64_t maxDefine, uint64_t maxRepeat, uint64_t& nextSchemaIdx, uint64_t& nextFileIdx) {
+    KU_ASSERT(nextSchemaIdx < metadata->schema.size());
+    auto& sEle = metadata->schema[nextSchemaIdx];
+    auto thisIdx = nextSchemaIdx;
+
+    auto repetition_type = FieldRepetitionType::REQUIRED;
+    if (sEle.__isset.repetition_type && thisIdx > 0) {
+        repetition_type = sEle.repetition_type;
+    }
+    if (repetition_type != FieldRepetitionType::REQUIRED) {
+        maxDefine++;
+    }
+    if (repetition_type == FieldRepetitionType::REPEATED) {
+        maxRepeat++;
+    }
+    if (sEle.__isset.num_children && sEle.num_children > 0) {
+        std::vector<StructField> structFields;
+        std::vector<std::unique_ptr<ColumnReader>> childrenReaders;
+        uint64_t cIdx = 0;
+        while (cIdx < (uint64_t)sEle.num_children) {
+            nextSchemaIdx++;
+            auto& childEle = metadata->schema[nextSchemaIdx];
+            auto childReader =
+                createReaderRecursive(depth + 1, maxDefine, maxRepeat, nextSchemaIdx, nextFileIdx);
+            structFields.emplace_back(childEle.name, childReader->getDataType().copy());
+            childrenReaders.push_back(std::move(childReader));
+            cIdx++;
+        }
+        KU_ASSERT(!structFields.empty());
+        std::unique_ptr<ColumnReader> result;
+        LogicalType resultType;
+
+        bool isRepeated = repetition_type == FieldRepetitionType::REPEATED;
+        bool isList = sEle.__isset.converted_type && sEle.converted_type == ConvertedType::LIST;
+        bool isMap = sEle.__isset.converted_type && sEle.converted_type == ConvertedType::MAP;
+        bool isMapKV =
+            sEle.__isset.converted_type && sEle.converted_type == ConvertedType::MAP_KEY_VALUE;
+        if (!isMapKV && thisIdx > 0) {
+            // check if the parent node of this is a map
+            auto& parentEle = metadata->schema[thisIdx - 1];
+            bool parentIsMap =
+                parentEle.__isset.converted_type && parentEle.converted_type == ConvertedType::MAP;
+            bool parentHasChildren = parentEle.__isset.num_children && parentEle.num_children == 1;
+            isMapKV = parentIsMap && parentHasChildren;
+        }
+
+        if (isMapKV) {
+            // LCOV_EXCL_START
+            if (structFields.size() != 2) {
+                throw CopyException{"MAP_KEY_VALUE requires two children"};
+            }
+            if (!isRepeated) {
+                throw CopyException{"MAP_KEY_VALUE needs to be repeated"};
+            }
+            // LCOV_EXCL_STOP
+            auto structType = LogicalType::STRUCT(std::move(structFields));
+            resultType = LogicalType(LogicalTypeID::MAP,
+                std::make_unique<ListTypeInfo>(std::move(structType)));
+
+            auto structReader = std::make_unique<StructColumnReader>(*this,
+                ListType::getChildType(resultType).copy(), sEle, thisIdx, maxDefine - 1,
+                maxRepeat - 1, std::move(childrenReaders));
+            return std::make_unique<ListColumnReader>(*this, std::move(resultType), sEle, thisIdx,
+                maxDefine, maxRepeat, std::move(structReader),
+                storage::MemoryManager::Get(*context));
+        }
+
+        if (structFields.size() > 1 || (!isList && !isMap && !isRepeated)) {
+            resultType = LogicalType::STRUCT(std::move(structFields));
+            result = std::make_unique<StructColumnReader>(*this, resultType.copy(), sEle, thisIdx,
+                maxDefine, maxRepeat, std::move(childrenReaders));
+        } else {
+            // if we have a struct with only a single type, pull up
+            resultType = structFields[0].getType().copy();
+            result = std::move(childrenReaders[0]);
+        }
+        if (isRepeated) {
+            resultType = LogicalType::LIST(resultType.copy());
+            return std::make_unique<ListColumnReader>(*this, std::move(resultType), sEle, thisIdx,
+                maxDefine, maxRepeat, std::move(result), storage::MemoryManager::Get(*context));
+        }
+        return result;
+    } else {
+        // LCOV_EXCL_START
+        if (!sEle.__isset.type) {
+            throw CopyException{"Node has neither num_children nor type set - this "
+                                "violates the Parquet spec (corrupted file)"};
+        }
+        // LCOV_EXCL_STOP
+        if (sEle.repetition_type == FieldRepetitionType::REPEATED) {
+            auto derivedType = deriveLogicalType(sEle);
+            auto listType = LogicalType::LIST(derivedType.copy());
+            auto elementReader = ColumnReader::createReader(*this, std::move(derivedType), sEle,
+                nextFileIdx++, maxDefine, maxRepeat);
+            return std::make_unique<ListColumnReader>(*this, std::move(listType), sEle, thisIdx,
+                maxDefine, maxRepeat, std::move(elementReader),
+                storage::MemoryManager::Get(*context));
+        }
+        // TODO check return value of derive type or should we only do this on read()
+        return ColumnReader::createReader(*this, deriveLogicalType(sEle), sEle, nextFileIdx++,
+            maxDefine, maxRepeat);
+    }
+}
+
+std::unique_ptr<ColumnReader> ParquetReader::createReader() {
+    uint64_t nextSchemaIdx = 0;
+    uint64_t nextFileIdx = 0;
+
+    // LCOV_EXCL_START
+    if (metadata->schema.empty()) {
+        throw CopyException{"Parquet reader: no schema elements found"};
+    }
+    if (metadata->schema[0].num_children == 0) {
+        throw CopyException{"Parquet reader: root schema element has no children"};
+    }
+    // LCOV_EXCL_STOP
+    auto rootReader = createReaderRecursive(0, 0, 0, nextSchemaIdx, nextFileIdx);
+    // LCOV_EXCL_START
+    if (rootReader->getDataType().getPhysicalType() != PhysicalTypeID::STRUCT) {
+        throw CopyException{"Root element of Parquet file must be a struct"};
+    }
+    // LCOV_EXCL_STOP
+    for (auto& field : StructType::getFields(rootReader->getDataType())) {
+        columnNames.push_back(field.getName());
+        columnTypes.push_back(field.getType().copy());
+    }
+
+    KU_ASSERT(nextSchemaIdx == metadata->schema.size() - 1);
+    KU_ASSERT(
+        metadata->row_groups.empty() || nextFileIdx == metadata->row_groups[0].columns.size());
+    return rootReader;
+}
+
+void ParquetReader::prepareRowGroupBuffer(ParquetReaderScanState& state, uint64_t /*colIdx*/) {
+    auto& group = getGroup(state);
+    state.rootReader->initializeRead(state.groupIdxList[state.currentGroup], group.columns,
+        *state.thriftFileProto);
+}
+
+uint64_t ParquetReader::getGroupSpan(ParquetReaderScanState& state) {
+    auto& group = getGroup(state);
+    uint64_t min_offset = UINT64_MAX;
+    uint64_t max_offset = 0;
+    for (auto& column_chunk : group.columns) {
+        // Set the min offset
+        auto current_min_offset = UINT64_MAX;
+        if (column_chunk.meta_data.__isset.dictionary_page_offset) {
+            current_min_offset = std::min<uint64_t>(current_min_offset,
+                column_chunk.meta_data.dictionary_page_offset);
+        }
+        if (column_chunk.meta_data.__isset.index_page_offset) {
+            current_min_offset =
+                std::min<uint64_t>(current_min_offset, column_chunk.meta_data.index_page_offset);
+        }
+        current_min_offset =
+            std::min<uint64_t>(current_min_offset, column_chunk.meta_data.data_page_offset);
+        min_offset = std::min<uint64_t>(current_min_offset, min_offset);
+        max_offset = std::max<uint64_t>(max_offset,
+            column_chunk.meta_data.total_compressed_size + current_min_offset);
+    }
+
+    return max_offset - min_offset;
+}
+
+LogicalType ParquetReader::deriveLogicalType(const lbug_parquet::format::SchemaElement& s_ele) {
+    // inner node
+    if (s_ele.type == Type::FIXED_LEN_BYTE_ARRAY && !s_ele.__isset.type_length) {
+        // LCOV_EXCL_START
+        throw CopyException("FIXED_LEN_BYTE_ARRAY requires length to be set");
+        // LCOV_EXCL_STOP
+    }
+    if (s_ele.__isset.logicalType && s_ele.logicalType.__isset.UUID &&
+        s_ele.type == Type::FIXED_LEN_BYTE_ARRAY) {
+        return LogicalType::UUID();
+    }
+    if (s_ele.__isset.converted_type) {
+        switch (s_ele.converted_type) {
+        case ConvertedType::INT_8:
+            if (s_ele.type == Type::INT32) {
+                return LogicalType::INT8();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{"INT8 converted type can only be set for value of Type::INT32"};
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::INT_16:
+            if (s_ele.type == Type::INT32) {
+                return LogicalType::INT16();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{
+                    "INT16 converted type can only be set for value of Type::INT32"};
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::INT_32:
+            if (s_ele.type == Type::INT32) {
+                return LogicalType::INT32();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{
+                    "INT32 converted type can only be set for value of Type::INT32"};
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::INT_64:
+            if (s_ele.type == Type::INT64) {
+                return LogicalType::INT64();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{
+                    "INT64 converted type can only be set for value of Type::INT64"};
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::UINT_8:
+            if (s_ele.type == Type::INT32) {
+                return LogicalType::UINT8();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{
+                    "UINT8 converted type can only be set for value of Type::INT32"};
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::UINT_16:
+            if (s_ele.type == Type::INT32) {
+                return LogicalType::UINT16();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{
+                    "UINT16 converted type can only be set for value of Type::INT32"};
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::UINT_32:
+            if (s_ele.type == Type::INT32) {
+                return LogicalType::UINT32();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{
+                    "UINT32 converted type can only be set for value of Type::INT32"};
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::UINT_64:
+            if (s_ele.type == Type::INT64) {
+                return LogicalType::UINT64();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{
+                    "UINT64 converted type can only be set for value of Type::INT64"};
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::DATE:
+            if (s_ele.type == Type::INT32) {
+                return LogicalType::DATE();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{"DATE converted type can only be set for value of Type::INT32"};
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::TIMESTAMP_MICROS:
+        case ConvertedType::TIMESTAMP_MILLIS:
+            if (s_ele.type == Type::INT64) {
+                return LogicalType::TIMESTAMP();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException(
+                    "TIMESTAMP converted type can only be set for value of Type::INT64");
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::INTERVAL: {
+            return LogicalType::INTERVAL();
+        }
+        case ConvertedType::UTF8:
+            switch (s_ele.type) {
+            case Type::BYTE_ARRAY:
+            case Type::FIXED_LEN_BYTE_ARRAY:
+                return LogicalType::STRING();
+                // LCOV_EXCL_START
+            default:
+                throw CopyException(
+                    "UTF8 converted type can only be set for Type::(FIXED_LEN_)BYTE_ARRAY");
+                // LCOV_EXCL_STOP
+            }
+        case ConvertedType::SERIAL:
+            if (s_ele.type == Type::INT64) {
+                return LogicalType::SERIAL();
+            } else {
+                // LCOV_EXCL_START
+                throw CopyException{
+                    "SERIAL converted type can only be set for value of Type::INT64"};
+                // LCOV_EXCL_STOP
+            }
+
+        default:
+            // LCOV_EXCL_START
+            throw CopyException{"Unsupported converted type"};
+            // LCOV_EXCL_STOP
+        }
+    } else {
+        // no converted type set
+        // use default type for each physical type
+        switch (s_ele.type) {
+        case Type::BOOLEAN:
+            return LogicalType::BOOL();
+        case Type::INT32:
+            return LogicalType::INT32();
+        case Type::INT64:
+            return LogicalType::INT64();
+        case Type::INT96:
+            return LogicalType::TIMESTAMP();
+        case Type::FLOAT:
+            return LogicalType::FLOAT();
+        case Type::DOUBLE:
+            return LogicalType::DOUBLE();
+        case Type::BYTE_ARRAY:
+        case Type::FIXED_LEN_BYTE_ARRAY:
+            // TODO(Ziyi): Support parquet copy option(binary_as_string).
+            return LogicalType::BLOB();
+        default:
+            return LogicalType(LogicalTypeID::ANY);
+        }
+    }
+}
+
+uint64_t ParquetReader::getGroupCompressedSize(ParquetReaderScanState& state) {
+    auto& group = getGroup(state);
+    auto total_compressed_size = group.total_compressed_size;
+
+    uint64_t calc_compressed_size = 0;
+
+    // If the global total_compressed_size is not set, we can still calculate it
+    if (group.total_compressed_size == 0) {
+        for (auto& column_chunk : group.columns) {
+            calc_compressed_size += column_chunk.meta_data.total_compressed_size;
+        }
+    }
+
+    // LCOV_EXCL_START
+    if (total_compressed_size != 0 && calc_compressed_size != 0 &&
+        (uint64_t)total_compressed_size != calc_compressed_size) {
+        throw CopyException(
+            "mismatch between calculated compressed size and reported compressed size");
+    }
+    // LCOV_EXCL_STOP
+
+    return total_compressed_size ? total_compressed_size : calc_compressed_size;
+}
+
+uint64_t ParquetReader::getGroupOffset(ParquetReaderScanState& state) {
+    auto& group = getGroup(state);
+    uint64_t minOffset = UINT64_MAX;
+
+    for (auto& column_chunk : group.columns) {
+        if (column_chunk.meta_data.__isset.dictionary_page_offset) {
+            minOffset =
+                std::min<uint64_t>(minOffset, column_chunk.meta_data.dictionary_page_offset);
+        }
+        if (column_chunk.meta_data.__isset.index_page_offset) {
+            minOffset = std::min<uint64_t>(minOffset, column_chunk.meta_data.index_page_offset);
+        }
+        minOffset = std::min<uint64_t>(minOffset, column_chunk.meta_data.data_page_offset);
+    }
+
+    return minOffset;
+}
+
+ParquetScanSharedState::ParquetScanSharedState(FileScanInfo fileScanInfo, uint64_t numRows,
+    main::ClientContext* context, std::vector<bool> columnSkips)
+    : ScanFileWithProgressSharedState{std::move(fileScanInfo), numRows, context},
+      columnSkips{columnSkips} {
+    readers.push_back(std::make_unique<ParquetReader>(this->fileScanInfo.filePaths[fileIdx],
+        columnSkips, context));
+    totalRowsGroups = 0;
+    for (auto i = fileIdx.load(); i < this->fileScanInfo.getNumFiles(); i++) {
+        auto reader =
+            std::make_unique<ParquetReader>(this->fileScanInfo.filePaths[i], columnSkips, context);
+        totalRowsGroups += reader->getNumRowsGroups();
+    }
+    numBlocksReadByFiles = 0;
+}
+
+static bool parquetSharedStateNext(ParquetScanLocalState& localState,
+    ParquetScanSharedState& sharedState) {
+    std::lock_guard<std::mutex> mtx{sharedState.mtx};
+    while (true) {
+        if (sharedState.fileIdx >= sharedState.fileScanInfo.getNumFiles()) {
+            return false;
+        }
+        if (sharedState.blockIdx < sharedState.readers[sharedState.fileIdx]->getNumRowsGroups()) {
+            localState.reader = sharedState.readers[sharedState.fileIdx].get();
+            localState.reader->initializeScan(*localState.state, {sharedState.blockIdx},
+                VirtualFileSystem::GetUnsafe(*sharedState.context));
+            sharedState.blockIdx++;
+            return true;
+        } else {
+            sharedState.numBlocksReadByFiles +=
+                sharedState.readers[sharedState.fileIdx]->getNumRowsGroups();
+            sharedState.blockIdx = 0;
+            sharedState.fileIdx++;
+            if (sharedState.fileIdx >= sharedState.fileScanInfo.getNumFiles()) {
+                return false;
+            }
+            sharedState.readers.push_back(std::make_unique<ParquetReader>(
+                sharedState.fileScanInfo.filePaths[sharedState.fileIdx], sharedState.columnSkips,
+                sharedState.context));
+            continue;
+        }
+    }
+}
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput& output) {
+    auto& outputChunk = output.dataChunk;
+    if (input.localState == nullptr) {
+        return 0;
+    }
+    auto parquetScanLocalState = ku_dynamic_cast<ParquetScanLocalState*>(input.localState);
+    auto parquetScanSharedState = ku_dynamic_cast<ParquetScanSharedState*>(input.sharedState);
+    do {
+        parquetScanLocalState->reader->scan(*parquetScanLocalState->state, outputChunk);
+        if (outputChunk.state->getSelVector().getSelSize() > 0) {
+            return outputChunk.state->getSelVector().getSelSize();
+        }
+        if (!parquetSharedStateNext(*parquetScanLocalState, *parquetScanSharedState)) {
+            return outputChunk.state->getSelVector().getSelSize();
+        }
+    } while (true);
+}
+
+static void bindColumns(const ExtraScanTableFuncBindInput* bindInput, uint32_t fileIdx,
+    std::vector<std::string>& columnNames, std::vector<LogicalType>& columnTypes,
+    main::ClientContext* context) {
+    auto reader = ParquetReader(bindInput->fileScanInfo.filePaths[fileIdx], {}, context);
+    auto state = std::make_unique<processor::ParquetReaderScanState>();
+    reader.initializeScan(*state, std::vector<uint64_t>{}, VirtualFileSystem::GetUnsafe(*context));
+    for (auto i = 0u; i < reader.getNumColumns(); ++i) {
+        columnNames.push_back(reader.getColumnName(i));
+        columnTypes.push_back(reader.getColumnType(i).copy());
+    }
+}
+
+static void bindColumns(const ExtraScanTableFuncBindInput* bindInput,
+    std::vector<std::string>& columnNames, std::vector<LogicalType>& columnTypes,
+    main::ClientContext* context) {
+    KU_ASSERT(bindInput->fileScanInfo.getNumFiles() > 0);
+    bindColumns(bindInput, 0 /* fileIdx */, columnNames, columnTypes, context);
+    for (auto i = 1u; i < bindInput->fileScanInfo.getNumFiles(); ++i) {
+        std::vector<std::string> tmpColumnNames;
+        std::vector<LogicalType> tmpColumnTypes;
+        bindColumns(bindInput, i, tmpColumnNames, tmpColumnTypes, context);
+        ReaderBindUtils::validateNumColumns(columnTypes.size(), tmpColumnTypes.size());
+        ReaderBindUtils::validateColumnTypes(columnNames, columnTypes, tmpColumnTypes);
+    }
+}
+
+static row_idx_t getNumRows(std::vector<std::string> filePaths, uint64_t numColumns,
+    main::ClientContext* context) {
+    std::vector<bool> dummyColumnSkips(false, numColumns);
+    row_idx_t numRows = 0;
+    for (const auto& path : filePaths) {
+        auto reader = std::make_unique<ParquetReader>(path, dummyColumnSkips, context);
+        numRows += reader->getMetadata()->num_rows;
+    }
+    return numRows;
+}
+
+static std::unique_ptr<TableFuncBindData> bindFunc(main::ClientContext* context,
+    const TableFuncBindInput* input) {
+    auto scanInput = ku_dynamic_cast<ExtraScanTableFuncBindInput*>(input->extraInput.get());
+    const auto& options = scanInput->fileScanInfo.options;
+    if (options.size() > 1 ||
+        (options.size() == 1 && !options.contains(CopyConstants::IGNORE_ERRORS_OPTION_NAME))) {
+        throw BinderException{"Copy from Parquet cannot have options other than IGNORE_ERRORS."};
+    }
+    std::vector<std::string> detectedColumnNames;
+    std::vector<LogicalType> detectedColumnTypes;
+    bindColumns(scanInput, detectedColumnNames, detectedColumnTypes, context);
+    if (!scanInput->expectedColumnNames.empty()) {
+        ReaderBindUtils::validateNumColumns(scanInput->expectedColumnNames.size(),
+            detectedColumnNames.size());
+        detectedColumnNames = scanInput->expectedColumnNames;
+    }
+
+    detectedColumnNames =
+        TableFunction::extractYieldVariables(detectedColumnNames, input->yieldVariables);
+    auto resultColumns = input->binder->createVariables(detectedColumnNames, detectedColumnTypes);
+    auto bindData = std::make_unique<ScanFileBindData>(std::move(resultColumns),
+        getNumRows(scanInput->fileScanInfo.filePaths, detectedColumnNames.size(), context),
+        scanInput->fileScanInfo.copy(), context);
+    return bindData;
+}
+
+static std::unique_ptr<TableFuncSharedState> initSharedState(
+    const TableFuncInitSharedStateInput& input) {
+    auto bindData = input.bindData->constPtrCast<ScanFileBindData>();
+    return std::make_unique<ParquetScanSharedState>(bindData->fileScanInfo.copy(),
+        bindData->numRows, bindData->context, bindData->getColumnSkips());
+}
+
+static std::unique_ptr<TableFuncLocalState> initLocalState(
+    const TableFuncInitLocalStateInput& input) {
+    auto sharedState = input.sharedState.ptrCast<ParquetScanSharedState>();
+    auto localState = std::make_unique<ParquetScanLocalState>();
+    if (!parquetSharedStateNext(*localState, *sharedState)) {
+        return nullptr;
+    }
+    return localState;
+}
+
+static double progressFunc(TableFuncSharedState* sharedState) {
+    auto state = sharedState->ptrCast<ParquetScanSharedState>();
+    if (state->fileIdx >= state->fileScanInfo.getNumFiles()) {
+        return 1.0;
+    }
+    if (state->totalRowsGroups == 0) {
+        return 0.0;
+    }
+    uint64_t totalReadSize = state->numBlocksReadByFiles + state->blockIdx;
+    return static_cast<double>(totalReadSize) / state->totalRowsGroups;
+}
+
+static void finalizeFunc(const ExecutionContext* ctx, TableFuncSharedState*) {
+    WarningContext::Get(*ctx->clientContext)->defaultPopulateAllWarnings(ctx->queryID);
+}
+
+function_set ParquetScanFunction::getFunctionSet() {
+    function_set functionSet;
+    auto function = std::make_unique<TableFunction>(name, std::vector{LogicalTypeID::STRING});
+    function->tableFunc = tableFunc;
+    function->bindFunc = bindFunc;
+    function->initSharedStateFunc = initSharedState;
+    function->initLocalStateFunc = initLocalState;
+    function->progressFunc = progressFunc;
+    function->finalizeFunc = finalizeFunc;
+    functionSet.push_back(std::move(function));
+    return functionSet;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/parquet_timestamp.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/parquet_timestamp.cpp
new file mode 100644
index 0000000000..f236ac9461
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/parquet_timestamp.cpp
@@ -0,0 +1,38 @@
+#include "processor/operator/persistent/reader/parquet/parquet_timestamp.h"
+
+#include <cstring>
+
+namespace lbug {
+namespace processor {
+
+common::timestamp_t ParquetTimeStampUtils::impalaTimestampToTimestamp(const Int96& rawTS) {
+    auto impalaUS = impalaTimestampToMicroseconds(rawTS);
+    return common::Timestamp::fromEpochMicroSeconds(impalaUS);
+}
+
+common::timestamp_t ParquetTimeStampUtils::parquetTimestampMicrosToTimestamp(const int64_t& rawTS) {
+    return common::Timestamp::fromEpochMicroSeconds(rawTS);
+}
+
+common::timestamp_t ParquetTimeStampUtils::parquetTimestampMsToTimestamp(const int64_t& rawTS) {
+    return common::Timestamp::fromEpochMilliSeconds(rawTS);
+}
+
+common::timestamp_t ParquetTimeStampUtils::parquetTimestampNsToTimestamp(const int64_t& rawTS) {
+    return common::Timestamp::fromEpochNanoSeconds(rawTS);
+}
+
+int64_t ParquetTimeStampUtils::impalaTimestampToMicroseconds(const Int96& impalaTimestamp) {
+    int64_t daysSinceEpoch = impalaTimestamp.value[2] - JULIAN_TO_UNIX_EPOCH_DAYS;
+    int64_t nanoSeconds = 0;
+    memcpy(&nanoSeconds, &impalaTimestamp.value, sizeof(nanoSeconds));
+    auto microseconds = nanoSeconds / NANOSECONDS_PER_MICRO;
+    return daysSinceEpoch * MICROSECONDS_PER_DAY + microseconds;
+}
+
+common::date_t ParquetTimeStampUtils::parquetIntToDate(const int32_t& raw_date) {
+    return common::date_t(raw_date);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/string_column_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/string_column_reader.cpp
new file mode 100644
index 0000000000..5ad98d1d4a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/string_column_reader.cpp
@@ -0,0 +1,93 @@
+#include "processor/operator/persistent/reader/parquet/string_column_reader.h"
+
+#include "common/types/blob.h"
+#include "common/types/ku_string.h"
+#include "parquet_types.h"
+#include "utf8proc_wrapper.h"
+
+using lbug_parquet::format::Type;
+
+namespace lbug {
+namespace processor {
+
+StringColumnReader::StringColumnReader(ParquetReader& reader, common::LogicalType type,
+    const lbug_parquet::format::SchemaElement& schema, uint64_t schemaIdx, uint64_t maxDefine,
+    uint64_t maxRepeat)
+    : TemplatedColumnReader<common::ku_string_t, StringParquetValueConversion>(reader,
+          std::move(type), schema, schemaIdx, maxDefine, maxRepeat) {
+    fixedWidthStringLength = 0;
+    if (schema.type == Type::FIXED_LEN_BYTE_ARRAY) {
+        KU_ASSERT(schema.__isset.type_length);
+        fixedWidthStringLength = schema.type_length;
+    }
+}
+
+uint32_t StringColumnReader::verifyString(const char* strData, uint32_t strLen,
+    const bool isVarchar) {
+    if (!isVarchar) {
+        return strLen;
+    }
+    // verify if a string is actually UTF8, and if there are no null bytes in the middle of the
+    // string technically Parquet should guarantee this, but reality is often disappointing
+    auto reason = utf8proc::UnicodeInvalidReason::INVALID_UNICODE;
+    size_t pos = 0;
+    auto utf_type = utf8proc::Utf8Proc::analyze(strData, strLen, &reason, &pos);
+    if (utf_type == utf8proc::UnicodeType::INVALID) {
+        throw common::CopyException{
+            "Invalid string encoding found in Parquet file: value \"" +
+            common::Blob::toString(reinterpret_cast<const uint8_t*>(strData), strLen) +
+            "\" is not valid UTF8!"};
+    }
+    return strLen;
+}
+
+uint32_t StringColumnReader::verifyString(const char* strData, uint32_t strLen) {
+    return verifyString(strData, strLen,
+        getDataType().getLogicalTypeID() == common::LogicalTypeID::STRING);
+}
+
+void StringColumnReader::dictionary(const std::shared_ptr<ResizeableBuffer>& data,
+    uint64_t numEntries) {
+    dict = data;
+    dictStrs = std::unique_ptr<common::ku_string_t[]>(new common::ku_string_t[numEntries]);
+    for (auto dictIdx = 0u; dictIdx < numEntries; dictIdx++) {
+        auto strLen = fixedWidthStringLength == 0 ? dict->read<uint32_t>() : fixedWidthStringLength;
+        dict->available(strLen);
+
+        auto dict_str = reinterpret_cast<const char*>(dict->ptr);
+        auto actual_str_len = verifyString(dict_str, strLen);
+        dictStrs[dictIdx].setFromRawStr(dict_str, actual_str_len);
+        dict->inc(strLen);
+    }
+}
+
+common::ku_string_t StringParquetValueConversion::dictRead(ByteBuffer& /*dict*/, uint32_t& offset,
+    ColumnReader& reader) {
+    auto& dictStrings = reinterpret_cast<StringColumnReader&>(reader).dictStrs;
+    return dictStrings[offset];
+}
+
+common::ku_string_t StringParquetValueConversion::plainRead(ByteBuffer& plainData,
+    ColumnReader& reader) {
+    auto& scr = reinterpret_cast<StringColumnReader&>(reader);
+    uint32_t strLen =
+        scr.fixedWidthStringLength == 0 ? plainData.read<uint32_t>() : scr.fixedWidthStringLength;
+    plainData.available(strLen);
+    auto plainStr = reinterpret_cast<char*>(plainData.ptr);
+    auto actualStrLen =
+        reinterpret_cast<StringColumnReader&>(reader).verifyString(plainStr, strLen);
+    auto retStr = common::ku_string_t();
+    retStr.setFromRawStr(plainStr, actualStrLen);
+    plainData.inc(strLen);
+    return retStr;
+}
+
+void StringParquetValueConversion::plainSkip(ByteBuffer& plainData, ColumnReader& reader) {
+    auto& scr = reinterpret_cast<StringColumnReader&>(reader);
+    uint32_t strLen =
+        scr.fixedWidthStringLength == 0 ? plainData.read<uint32_t>() : scr.fixedWidthStringLength;
+    plainData.inc(strLen);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/struct_column_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/struct_column_reader.cpp
new file mode 100644
index 0000000000..975c82769b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/struct_column_reader.cpp
@@ -0,0 +1,99 @@
+#include "processor/operator/persistent/reader/parquet/struct_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+StructColumnReader::StructColumnReader(ParquetReader& reader, common::LogicalType type,
+    const lbug_parquet::format::SchemaElement& schema, uint64_t schemaIdx, uint64_t maxDefine,
+    uint64_t maxRepeat, std::vector<std::unique_ptr<ColumnReader>> childReaders)
+    : ColumnReader(reader, std::move(type), schema, schemaIdx, maxDefine, maxRepeat),
+      childReaders(std::move(childReaders)) {
+    KU_ASSERT(this->type.getPhysicalType() == common::PhysicalTypeID::STRUCT);
+}
+
+ColumnReader* StructColumnReader::getChildReader(uint64_t childIdx) {
+    KU_ASSERT(childIdx < childReaders.size());
+    return childReaders[childIdx].get();
+}
+
+void StructColumnReader::initializeRead(uint64_t rowGroupIdx,
+    const std::vector<lbug_parquet::format::ColumnChunk>& columns,
+    lbug_apache::thrift::protocol::TProtocol& protocol) {
+    for (auto& child : childReaders) {
+        child->initializeRead(rowGroupIdx, columns, protocol);
+    }
+}
+
+uint64_t StructColumnReader::getTotalCompressedSize() {
+    uint64_t size = 0;
+    for (auto& child : childReaders) {
+        size += child->getTotalCompressedSize();
+    }
+    return size;
+}
+
+void StructColumnReader::registerPrefetch(ThriftFileTransport& transport, bool allow_merge) {
+    for (auto& child : childReaders) {
+        child->registerPrefetch(transport, allow_merge);
+    }
+}
+
+uint64_t StructColumnReader::read(uint64_t numValuesToRead, parquet_filter_t& filter,
+    uint8_t* define_out, uint8_t* repeat_out, common::ValueVector* result) {
+    auto& fieldVectors = common::StructVector::getFieldVectors(result);
+    KU_ASSERT(common::StructType::getNumFields(type) == fieldVectors.size());
+    if (pendingSkips > 0) {
+        applyPendingSkips(pendingSkips);
+    }
+
+    uint64_t numValuesRead = numValuesToRead;
+    for (auto i = 0u; i < fieldVectors.size(); i++) {
+        auto numValuesChildrenRead = childReaders[i]->read(numValuesToRead, filter, define_out,
+            repeat_out, fieldVectors[i].get());
+        if (i == 0) {
+            numValuesRead = numValuesChildrenRead;
+        } else if (numValuesRead != numValuesChildrenRead) {
+            throw std::runtime_error("Struct child row count mismatch");
+        }
+    }
+    for (auto i = 0u; i < numValuesRead; i++) {
+        result->setNull(i, define_out[i] < maxDefine);
+    }
+
+    return numValuesRead;
+}
+
+void StructColumnReader::skip(uint64_t num_values) {
+    for (auto& child_reader : childReaders) {
+        child_reader->skip(num_values);
+    }
+}
+
+static bool TypeHasExactRowCount(const common::LogicalType& type) {
+    switch (type.getLogicalTypeID()) {
+    case common::LogicalTypeID::LIST:
+    case common::LogicalTypeID::MAP:
+        return false;
+    case common::LogicalTypeID::STRUCT:
+        for (auto kv : common::StructType::getFieldTypes(type)) {
+            if (TypeHasExactRowCount(*kv)) {
+                return true;
+            }
+        }
+        return false;
+    default:
+        return true;
+    }
+}
+
+uint64_t StructColumnReader::getGroupRowsAvailable() {
+    for (auto i = 0u; i < childReaders.size(); i++) {
+        if (TypeHasExactRowCount(childReaders[i]->getDataType())) {
+            return childReaders[i]->getGroupRowsAvailable();
+        }
+    }
+    return childReaders[0]->getGroupRowsAvailable();
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/uuid_column_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/uuid_column_reader.cpp
new file mode 100644
index 0000000000..683dd629cd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/parquet/uuid_column_reader.cpp
@@ -0,0 +1,41 @@
+#include "processor/operator/persistent/reader/parquet/uuid_column_reader.h"
+
+namespace lbug {
+namespace processor {
+
+common::ku_uuid_t UUIDValueConversion::ReadParquetUUID(const uint8_t* input) {
+    common::ku_uuid_t result{};
+    result.value.low = 0;
+    uint64_t unsignedUpper = 0;
+    for (auto i = 0u; i < sizeof(uint64_t); i++) {
+        unsignedUpper <<= 8;
+        unsignedUpper += input[i];
+    }
+    for (auto i = sizeof(uint64_t); i < sizeof(common::ku_uuid_t); i++) {
+        result.value.low <<= 8;
+        result.value.low += input[i];
+    }
+    result.value.high = unsignedUpper;
+    result.value.high ^= (int64_t(1) << 63);
+    return result;
+}
+
+common::ku_uuid_t UUIDValueConversion::plainRead(ByteBuffer& bufferData, ColumnReader& /*reader*/) {
+    auto uuidLen = sizeof(common::ku_uuid_t);
+    bufferData.available(uuidLen);
+    auto res = ReadParquetUUID(reinterpret_cast<const uint8_t*>(bufferData.ptr));
+    bufferData.inc(uuidLen);
+    return res;
+}
+
+void UUIDColumnReader::dictionary(const std::shared_ptr<ResizeableBuffer>& dictionaryData,
+    uint64_t numEntries) {
+    allocateDict(numEntries * sizeof(common::ku_uuid_t));
+    auto dictPtr = reinterpret_cast<common::ku_uuid_t*>(this->dict->ptr);
+    for (auto i = 0u; i < numEntries; i++) {
+        dictPtr[i] = UUIDValueConversion::plainRead(*dictionaryData, *this);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/reader_bind_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/reader_bind_utils.cpp
new file mode 100644
index 0000000000..fe5b00467e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/reader/reader_bind_utils.cpp
@@ -0,0 +1,51 @@
+#include "processor/operator/persistent/reader/reader_bind_utils.h"
+
+#include "common/exception/binder.h"
+#include "common/string_format.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void ReaderBindUtils::validateNumColumns(uint32_t expectedNumber, uint32_t detectedNumber) {
+    if (detectedNumber == 0) {
+        return; // Empty CSV. Continue processing.
+    }
+    if (expectedNumber != detectedNumber) {
+        throw common::BinderException(common::stringFormat(
+            "Number of columns mismatch. Expected {} but got {}.", expectedNumber, detectedNumber));
+    }
+}
+
+void ReaderBindUtils::validateColumnTypes(const std::vector<std::string>& columnNames,
+    const std::vector<common::LogicalType>& expectedColumnTypes,
+    const std::vector<common::LogicalType>& detectedColumnTypes) {
+    KU_ASSERT(expectedColumnTypes.size() == detectedColumnTypes.size());
+    for (auto i = 0u; i < expectedColumnTypes.size(); ++i) {
+        if (expectedColumnTypes[i] != detectedColumnTypes[i]) {
+            throw common::BinderException(common::stringFormat(
+                "Column `{}` type mismatch. Expected {} but got {}.", columnNames[i],
+                expectedColumnTypes[i].toString(), detectedColumnTypes[i].toString()));
+        }
+    }
+}
+
+void ReaderBindUtils::resolveColumns(const std::vector<std::string>& expectedColumnNames,
+    const std::vector<std::string>& detectedColumnNames,
+    std::vector<std::string>& resultColumnNames,
+    const std::vector<common::LogicalType>& expectedColumnTypes,
+    const std::vector<common::LogicalType>& detectedColumnTypes,
+    std::vector<common::LogicalType>& resultColumnTypes) {
+    if (expectedColumnTypes.empty()) {
+        resultColumnNames = detectedColumnNames;
+        resultColumnTypes = LogicalType::copy(detectedColumnTypes);
+    } else {
+        validateNumColumns(expectedColumnTypes.size(), detectedColumnTypes.size());
+        resultColumnNames = expectedColumnNames;
+        resultColumnTypes = LogicalType::copy(expectedColumnTypes);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/rel_batch_insert.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/rel_batch_insert.cpp
new file mode 100644
index 0000000000..4893425cdf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/rel_batch_insert.cpp
@@ -0,0 +1,279 @@
+#include "processor/operator/persistent/rel_batch_insert.h"
+
+#include "catalog/catalog.h"
+#include "common/cast.h"
+#include "common/exception/copy.h"
+#include "common/exception/message.h"
+#include "common/string_format.h"
+#include "common/task_system/progress_bar.h"
+#include "processor/execution_context.h"
+#include "processor/result/factorized_table_util.h"
+#include "processor/warning_context.h"
+#include "storage/local_storage/local_storage.h"
+#include "storage/storage_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/table/chunked_node_group.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/csr_chunked_node_group.h"
+#include "storage/table/rel_table.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::string RelBatchInsertPrintInfo::toString() const {
+    std::string result = "Table Name: ";
+    result += tableName;
+    return result;
+}
+
+void RelBatchInsert::initLocalStateInternal(ResultSet*, ExecutionContext* context) {
+    localState = std::make_unique<RelBatchInsertLocalState>();
+    const auto relInfo = info->ptrCast<RelBatchInsertInfo>();
+    localState->chunkedGroup =
+        std::make_unique<InMemChunkedCSRNodeGroup>(*MemoryManager::Get(*context->clientContext),
+            relInfo->columnTypes, relInfo->compressionEnabled, 0, 0);
+    const auto transaction = transaction::Transaction::Get(*context->clientContext);
+    localState->optimisticAllocator = transaction->getLocalStorage()->addOptimisticAllocator();
+    const auto clientContext = context->clientContext;
+    const auto catalog = Catalog::Get(*clientContext);
+    const auto catalogEntry = catalog->getTableCatalogEntry(transaction, info->tableName);
+    const auto& relGroupEntry = catalogEntry->constCast<RelGroupCatalogEntry>();
+    auto tableID = relGroupEntry.getRelEntryInfo(relInfo->fromTableID, relInfo->toTableID)->oid;
+    auto nbrTableID = RelDirectionUtils::getNbrTableID(relInfo->direction, relInfo->fromTableID,
+        relInfo->toTableID);
+    // TODO(Guodong): Get rid of the hard-coded nbr and rel column ID 0/1.
+    localState->chunkedGroup->getColumnChunk(0).cast<InternalIDChunkData>().setTableID(nbrTableID);
+    localState->chunkedGroup->getColumnChunk(1).cast<InternalIDChunkData>().setTableID(tableID);
+    const auto relLocalState = localState->ptrCast<RelBatchInsertLocalState>();
+    relLocalState->dummyAllNullDataChunk = std::make_unique<DataChunk>(relInfo->columnTypes.size());
+    for (auto i = 0u; i < relInfo->columnTypes.size(); i++) {
+        auto valueVector = std::make_shared<ValueVector>(relInfo->columnTypes[i].copy(),
+            MemoryManager::Get(*context->clientContext));
+        valueVector->setAllNull();
+        relLocalState->dummyAllNullDataChunk->insert(i, std::move(valueVector));
+    }
+}
+
+void RelBatchInsert::initGlobalStateInternal(ExecutionContext* context) {
+    const auto relBatchInsertInfo = info->ptrCast<RelBatchInsertInfo>();
+    const auto clientContext = context->clientContext;
+    const auto catalog = Catalog::Get(*clientContext);
+    const auto transaction = transaction::Transaction::Get(*clientContext);
+    const auto catalogEntry = catalog->getTableCatalogEntry(transaction, info->tableName);
+    const auto& relGroupEntry = catalogEntry->constCast<RelGroupCatalogEntry>();
+    // Init info
+    info->compressionEnabled = StorageManager::Get(*clientContext)->compressionEnabled();
+    auto dataColumnIdx = 0u;
+    // Handle internal id column
+    info->columnTypes.push_back(LogicalType::INTERNAL_ID());
+    info->insertColumnIDs.push_back(0);
+    info->outputDataColumns.push_back(dataColumnIdx++);
+    for (auto& property : relGroupEntry.getProperties()) {
+        info->columnTypes.push_back(property.getType().copy());
+        info->insertColumnIDs.push_back(relGroupEntry.getColumnID(property.getName()));
+        info->outputDataColumns.push_back(dataColumnIdx++);
+    }
+    for (auto& type : info->warningColumnTypes) {
+        info->columnTypes.push_back(type.copy());
+        info->warningDataColumns.push_back(dataColumnIdx++);
+    }
+    relBatchInsertInfo->partitioningIdx =
+        relBatchInsertInfo->direction == RelDataDirection::FWD ? 0 : 1;
+    relBatchInsertInfo->boundNodeOffsetColumnID =
+        relBatchInsertInfo->direction == RelDataDirection::FWD ? 0 : 1;
+    // Init shared state
+    sharedState->table = partitionerSharedState->relTable;
+    progressSharedState = std::make_shared<RelBatchInsertProgressSharedState>();
+    progressSharedState->partitionsDone = 0;
+    progressSharedState->partitionsTotal =
+        partitionerSharedState->getNumPartitions(relBatchInsertInfo->partitioningIdx);
+}
+
+void RelBatchInsert::executeInternal(ExecutionContext* context) {
+    const auto relInfo = info->ptrCast<RelBatchInsertInfo>();
+    const auto relTable = sharedState->table->ptrCast<RelTable>();
+    const auto relLocalState = localState->ptrCast<RelBatchInsertLocalState>();
+    const auto clientContext = context->clientContext;
+    const auto catalog = Catalog::Get(*clientContext);
+    const auto transaction = transaction::Transaction::Get(*clientContext);
+    const auto& relGroupEntry = catalog->getTableCatalogEntry(transaction, relInfo->tableName)
+                                    ->constCast<RelGroupCatalogEntry>();
+    while (true) {
+        relLocalState->nodeGroupIdx =
+            partitionerSharedState->getNextPartition(relInfo->partitioningIdx);
+        if (relLocalState->nodeGroupIdx == INVALID_PARTITION_IDX) {
+            // No more partitions left in the partitioning buffer.
+            break;
+        }
+        ++progressSharedState->partitionsDone;
+        // TODO(Guodong): We need to handle the concurrency between COPY and other insertions
+        // into the same node group.
+        auto& nodeGroup =
+            relTable
+                ->getOrCreateNodeGroup(transaction, relLocalState->nodeGroupIdx, relInfo->direction)
+                ->cast<CSRNodeGroup>();
+        appendNodeGroup(relGroupEntry, *MemoryManager::Get(*clientContext), transaction, nodeGroup,
+            *relInfo, *relLocalState);
+        updateProgress(context);
+    }
+}
+
+static void appendNewChunkedGroup(MemoryManager& mm, transaction::Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, InMemChunkedCSRNodeGroup& chunkedGroup,
+    RelTable& relTable, CSRNodeGroup& nodeGroup, RelDataDirection direction,
+    PageAllocator& pageAllocator) {
+    const bool isNewNodeGroup = nodeGroup.isEmpty();
+    const CSRNodeGroupScanSource source = isNewNodeGroup ?
+                                              CSRNodeGroupScanSource::COMMITTED_PERSISTENT :
+                                              CSRNodeGroupScanSource::COMMITTED_IN_MEMORY;
+    // since each thread operates on distinct node groups
+    // We don't need a lock here (to ensure the insert info and append agree on the number of rows
+    // in the node group)
+    relTable.pushInsertInfo(transaction, direction, nodeGroup, chunkedGroup.getNumRows(), source);
+    if (isNewNodeGroup) {
+        auto flushedChunkedGroup = chunkedGroup.flush(transaction, pageAllocator);
+
+        // If there are deleted columns that haven't been vacuumed yet
+        // we need to add extra columns to the chunked group
+        // to ensure that the number of columns is consistent with the rest of the node group
+        auto persistentChunkedGroup = std::make_unique<ChunkedCSRNodeGroup>(mm,
+            flushedChunkedGroup->cast<ChunkedCSRNodeGroup>(), nodeGroup.getDataTypes(), columnIDs);
+
+        nodeGroup.setPersistentChunkedGroup(std::move(persistentChunkedGroup));
+    } else {
+        nodeGroup.appendChunkedCSRGroup(transaction, columnIDs, chunkedGroup);
+    }
+}
+
+void RelBatchInsert::appendNodeGroup(const RelGroupCatalogEntry& relGroupEntry, MemoryManager& mm,
+    transaction::Transaction* transaction, CSRNodeGroup& nodeGroup,
+    const RelBatchInsertInfo& relInfo, const RelBatchInsertLocalState& localState) {
+    const auto nodeGroupIdx = localState.nodeGroupIdx;
+    const auto startNodeOffset = storage::StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx);
+    auto executionState = impl->initExecutionState(*partitionerSharedState, relInfo, nodeGroupIdx);
+    // Calculate num of source nodes in this node group.
+    // This will be used to set the num of values of the node group.
+    const auto numNodes = std::min(StorageConfig::NODE_GROUP_SIZE,
+        partitionerSharedState->getNumNodes(relInfo.partitioningIdx) - startNodeOffset);
+    // We optimistically flush new node group directly to disk in gapped CSR format.
+    // There is no benefit of leaving gaps for existing node groups, which is kept in memory.
+    const auto leaveGaps = nodeGroup.isEmpty();
+    populateCSRHeader(relGroupEntry, *executionState, startNodeOffset, relInfo, localState,
+        numNodes, leaveGaps);
+    const auto& csrHeader =
+        ku_dynamic_cast<InMemChunkedCSRNodeGroup&>(*localState.chunkedGroup).getCSRHeader();
+    impl->writeToTable(*executionState, csrHeader, localState, *sharedState, relInfo);
+    // Reset num of rows in the chunked group to fill gaps at the end of the node group.
+    const auto maxSize = csrHeader.getEndCSROffset(numNodes - 1);
+    auto numGapsAtEnd = maxSize - localState.chunkedGroup->getNumRows();
+    KU_ASSERT(localState.chunkedGroup->getCapacity() >= maxSize);
+    while (numGapsAtEnd > 0) {
+        const auto numGapsToFill = std::min(numGapsAtEnd, DEFAULT_VECTOR_CAPACITY);
+        localState.dummyAllNullDataChunk->state->getSelVectorUnsafe().setSelSize(numGapsToFill);
+        std::vector<ValueVector*> dummyVectors;
+        for (auto i = 0u; i < relInfo.columnTypes.size(); i++) {
+            dummyVectors.push_back(&localState.dummyAllNullDataChunk->getValueVectorMutable(i));
+        }
+        const auto numGapsFilled = localState.chunkedGroup->append(dummyVectors, 0, numGapsToFill);
+        KU_ASSERT(numGapsFilled == numGapsToFill);
+        numGapsAtEnd -= numGapsFilled;
+    }
+    KU_ASSERT(localState.chunkedGroup->getNumRows() == maxSize);
+
+    auto* relTable = sharedState->table->ptrCast<RelTable>();
+
+    InMemChunkedCSRNodeGroup sliceToWriteToDisk{
+        ku_dynamic_cast<InMemChunkedCSRNodeGroup&>(*localState.chunkedGroup),
+        relInfo.outputDataColumns};
+    appendNewChunkedGroup(mm, transaction, relInfo.insertColumnIDs, sliceToWriteToDisk, *relTable,
+        nodeGroup, relInfo.direction, *localState.optimisticAllocator);
+    ku_dynamic_cast<InMemChunkedCSRNodeGroup&>(*localState.chunkedGroup)
+        .mergeChunkedCSRGroup(sliceToWriteToDisk, relInfo.outputDataColumns);
+
+    localState.chunkedGroup->resetToEmpty();
+}
+
+void RelBatchInsertImpl::finalizeStartCSROffsets(RelBatchInsertExecutionState&,
+    storage::InMemChunkedCSRHeader& csrHeader, const RelBatchInsertInfo&) {
+    csrHeader.populateEndCSROffsetFromStartAndLength();
+}
+
+void RelBatchInsert::populateCSRHeader(const RelGroupCatalogEntry& relGroupEntry,
+    RelBatchInsertExecutionState& executionState, offset_t startNodeOffset,
+    const RelBatchInsertInfo& relInfo, const RelBatchInsertLocalState& localState,
+    offset_t numNodes, bool leaveGaps) {
+    auto& csrNodeGroup = ku_dynamic_cast<InMemChunkedCSRNodeGroup&>(*localState.chunkedGroup);
+    auto& csrHeader = csrNodeGroup.getCSRHeader();
+    csrHeader.setNumValues(numNodes);
+    // Populate lengths for each node and check multiplicity constraint.
+    impl->populateCSRLengths(executionState, csrHeader, numNodes, relInfo);
+    checkRelMultiplicityConstraint(relGroupEntry, csrHeader, startNodeOffset, relInfo);
+    const auto rightCSROffsetOfRegions = csrHeader.populateStartCSROffsetsFromLength(leaveGaps);
+    impl->finalizeStartCSROffsets(executionState, csrHeader, relInfo);
+    csrHeader.finalizeCSRRegionEndOffsets(rightCSROffsetOfRegions);
+    // Resize csr data column chunks.
+    localState.chunkedGroup->resizeChunks(csrHeader.getEndCSROffset(numNodes - 1));
+    localState.chunkedGroup->resetToAllNull();
+    KU_ASSERT(csrHeader.sanityCheck());
+}
+
+void RelBatchInsert::checkRelMultiplicityConstraint(const RelGroupCatalogEntry& relGroupEntry,
+    const InMemChunkedCSRHeader& csrHeader, offset_t startNodeOffset,
+    const RelBatchInsertInfo& relInfo) {
+    if (!relGroupEntry.isSingleMultiplicity(relInfo.direction)) {
+        return;
+    }
+    for (auto i = 0u; i < csrHeader.length->getNumValues(); i++) {
+        if (csrHeader.length->getValue<length_t>(i) > 1) {
+            throw CopyException(ExceptionMessage::violateRelMultiplicityConstraint(
+                relInfo.tableName, std::to_string(i + startNodeOffset),
+                RelDirectionUtils::relDirectionToString(relInfo.direction)));
+        }
+    }
+}
+
+void RelBatchInsert::finalizeInternal(ExecutionContext* context) {
+    const auto relInfo = info->ptrCast<RelBatchInsertInfo>();
+    if (relInfo->direction == RelDataDirection::FWD) {
+        KU_ASSERT(relInfo->partitioningIdx == 0);
+
+        auto outputMsg = stringFormat("{} tuples have been copied to the {} table.",
+            sharedState->getNumRows(), relInfo->tableName);
+        auto clientContext = context->clientContext;
+        FactorizedTableUtils::appendStringToTable(sharedState->fTable.get(), outputMsg,
+            MemoryManager::Get(*clientContext));
+
+        auto warningContext = WarningContext::Get(*context->clientContext);
+        const auto warningCount = warningContext->getWarningCount(context->queryID);
+        if (warningCount > 0) {
+            auto warningMsg =
+                stringFormat("{} warnings encountered during copy. Use 'CALL "
+                             "show_warnings() RETURN *' to view the actual warnings. Query ID: {}",
+                    warningCount, context->queryID);
+            FactorizedTableUtils::appendStringToTable(sharedState->fTable.get(), warningMsg,
+                MemoryManager::Get(*context->clientContext));
+            warningContext->defaultPopulateAllWarnings(context->queryID);
+        }
+    }
+    sharedState->numRows.store(0);
+    sharedState->table->cast<RelTable>().setHasChanges();
+    partitionerSharedState->resetState(relInfo->partitioningIdx);
+}
+
+void RelBatchInsert::updateProgress(const ExecutionContext* context) const {
+    auto progressBar = ProgressBar::Get(*context->clientContext);
+    if (progressSharedState->partitionsTotal == 0) {
+        progressBar->updateProgress(context->queryID, 0);
+    } else {
+        double progress = static_cast<double>(progressSharedState->partitionsDone) /
+                          static_cast<double>(progressSharedState->partitionsTotal);
+        progressBar->updateProgress(context->queryID, progress);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/set.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/set.cpp
new file mode 100644
index 0000000000..fd21fda709
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/set.cpp
@@ -0,0 +1,46 @@
+#include "processor/operator/persistent/set.h"
+
+#include "binder/expression/expression_util.h"
+
+namespace lbug {
+namespace processor {
+
+void SetNodeProperty::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    for (auto& executor : executors) {
+        executor->init(resultSet, context);
+    }
+}
+
+bool SetNodeProperty::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    for (auto& executor : executors) {
+        executor->set(context);
+    }
+    return true;
+}
+
+void SetRelProperty::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    for (auto& executor : executors) {
+        executor->init(resultSet, context);
+    }
+}
+
+bool SetRelProperty::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    for (auto& executor : executors) {
+        executor->set(context);
+    }
+    return true;
+}
+
+std::string SetPropertyPrintInfo::toString() const {
+    std::string result = "Properties: ";
+    result += binder::ExpressionUtil::toString(expressions);
+    return result;
+}
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/set_executor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/set_executor.cpp
new file mode 100644
index 0000000000..90920219f8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/set_executor.cpp
@@ -0,0 +1,141 @@
+#include "processor/operator/persistent/set_executor.h"
+
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void NodeSetInfo::init(const ResultSet& resultSet, main::ClientContext* context) {
+    nodeIDVector = resultSet.getValueVector(nodeIDPos).get();
+    if (columnVectorPos.isValid()) {
+        columnVector = resultSet.getValueVector(columnVectorPos).get();
+    }
+    evaluator->init(resultSet, context);
+    columnDataVector = evaluator->resultVector.get();
+}
+
+void NodeSetExecutor::init(ResultSet* resultSet, ExecutionContext* context) {
+    info.init(*resultSet, context->clientContext);
+}
+
+void NodeSetExecutor::setNodeID(nodeID_t nodeID) const {
+    info.nodeIDVector->setValue(info.nodeIDVector->state->getSelVector()[0], nodeID);
+}
+
+static void writeColumnUpdateResult(ValueVector* idVector, ValueVector* columnVector,
+    ValueVector* dataVector) {
+    auto& idSelVector = idVector->state->getSelVector();
+    auto& columnSelVector = columnVector->state->getSelVector();
+    auto& dataSelVector = dataVector->state->getSelVector();
+    KU_ASSERT(idSelVector.getSelSize() == 1);
+    if (idVector->isNull(idSelVector[0])) { // No update happened.
+        return;
+    }
+    KU_ASSERT(dataSelVector.getSelSize() == 1);
+    if (dataVector->isNull(dataSelVector[0])) { // Update to NULL
+        columnVector->setNull(dataSelVector[0], true);
+        return;
+    }
+    columnVector->setNull(columnSelVector[0], false);
+    columnVector->copyFromVectorData(columnSelVector[0], dataVector, dataSelVector[0]);
+}
+
+void SingleLabelNodeSetExecutor::set(ExecutionContext* context) {
+    if (tableInfo.columnID == INVALID_COLUMN_ID) {
+        // Not a valid column. Set projected column to null.
+        if (info.columnVectorPos.isValid()) {
+            info.columnVector->setNull(info.columnDataVector->state->getSelVector()[0], true);
+        }
+        return;
+    }
+    info.evaluator->evaluate();
+    auto updateState = std::make_unique<storage::NodeTableUpdateState>(tableInfo.columnID,
+        *info.nodeIDVector, *info.columnDataVector);
+    tableInfo.table->initUpdateState(context->clientContext, *updateState);
+    tableInfo.table->update(transaction::Transaction::Get(*context->clientContext), *updateState);
+    if (info.columnVectorPos.isValid()) {
+        writeColumnUpdateResult(info.nodeIDVector, info.columnVector, info.columnDataVector);
+    }
+}
+
+void MultiLabelNodeSetExecutor::set(ExecutionContext* context) {
+    info.evaluator->evaluate();
+    auto& nodeIDSelVector = info.nodeIDVector->state->getSelVector();
+    KU_ASSERT(nodeIDSelVector.getSelSize() == 1);
+    auto nodeIDPos = nodeIDSelVector[0];
+    auto& nodeID = info.nodeIDVector->getValue<internalID_t>(nodeIDPos);
+    if (!tableInfos.contains(nodeID.tableID)) {
+        if (info.columnVectorPos.isValid()) {
+            info.columnVector->setNull(info.columnDataVector->state->getSelVector()[0], true);
+        }
+        return;
+    }
+    auto& tableInfo = tableInfos.at(nodeID.tableID);
+    auto updateState = std::make_unique<storage::NodeTableUpdateState>(tableInfo.columnID,
+        *info.nodeIDVector, *info.columnDataVector);
+    tableInfo.table->initUpdateState(context->clientContext, *updateState);
+    tableInfo.table->update(transaction::Transaction::Get(*context->clientContext), *updateState);
+    if (info.columnVectorPos.isValid()) {
+        writeColumnUpdateResult(info.nodeIDVector, info.columnVector, info.columnDataVector);
+    }
+}
+
+void RelSetInfo::init(const ResultSet& resultSet, main::ClientContext* context) {
+    srcNodeIDVector = resultSet.getValueVector(srcNodeIDPos).get();
+    dstNodeIDVector = resultSet.getValueVector(dstNodeIDPos).get();
+    relIDVector = resultSet.getValueVector(relIDPos).get();
+    if (columnVectorPos.isValid()) {
+        columnVector = resultSet.getValueVector(columnVectorPos).get();
+    }
+    evaluator->init(resultSet, context);
+    columnDataVector = evaluator->resultVector.get();
+}
+
+void RelSetExecutor::init(ResultSet* resultSet, ExecutionContext* context) {
+    info.init(*resultSet, context->clientContext);
+}
+
+void RelSetExecutor::setRelID(nodeID_t relID) const {
+    info.relIDVector->setValue(info.relIDVector->state->getSelVector()[0], relID);
+}
+
+void SingleLabelRelSetExecutor::set(ExecutionContext* context) {
+    if (tableInfo.columnID == INVALID_COLUMN_ID) {
+        if (info.columnVectorPos.isValid()) {
+            info.columnVector->setNull(info.columnDataVector->state->getSelVector()[0], true);
+        }
+        return;
+    }
+    info.evaluator->evaluate();
+    auto updateState = std::make_unique<storage::RelTableUpdateState>(tableInfo.columnID,
+        *info.srcNodeIDVector, *info.dstNodeIDVector, *info.relIDVector, *info.columnDataVector);
+    tableInfo.table->update(transaction::Transaction::Get(*context->clientContext), *updateState);
+    if (info.columnVectorPos.isValid()) {
+        writeColumnUpdateResult(info.relIDVector, info.columnVector, info.columnDataVector);
+    }
+}
+
+void MultiLabelRelSetExecutor::set(ExecutionContext* context) {
+    info.evaluator->evaluate();
+    auto& idSelVector = info.relIDVector->state->getSelVector();
+    KU_ASSERT(idSelVector.getSelSize() == 1);
+    auto relID = info.relIDVector->getValue<internalID_t>(idSelVector[0]);
+    if (!tableInfos.contains(relID.tableID)) {
+        if (info.columnVectorPos.isValid()) {
+            info.columnVector->setNull(info.columnDataVector->state->getSelVector()[0], true);
+        }
+        return;
+    }
+    auto& tableInfo = tableInfos.at(relID.tableID);
+    auto updateState = std::make_unique<storage::RelTableUpdateState>(tableInfo.columnID,
+        *info.srcNodeIDVector, *info.dstNodeIDVector, *info.relIDVector, *info.columnDataVector);
+    tableInfo.table->update(transaction::Transaction::Get(*context->clientContext), *updateState);
+    if (info.columnVectorPos.isValid()) {
+        writeColumnUpdateResult(info.relIDVector, info.columnVector, info.columnDataVector);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/CMakeLists.txt
new file mode 100644
index 0000000000..20840df2d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/CMakeLists.txt
@@ -0,0 +1,18 @@
+add_library(lbug_processor_operator_parquet_writer
+        OBJECT
+        basic_column_writer.cpp
+        boolean_column_writer.cpp
+        column_writer.cpp
+        interval_column_writer.cpp
+        struct_column_writer.cpp
+        string_column_writer.cpp
+        list_column_writer.cpp
+        parquet_writer.cpp
+        parquet_rle_bp_encoder.cpp
+        uuid_column_writer.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_parquet_writer>
+        PARENT_SCOPE)
+
+target_link_libraries(lbug_processor_operator_parquet_writer PUBLIC parquet)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/basic_column_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/basic_column_writer.cpp
new file mode 100644
index 0000000000..603c98dd35
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/basic_column_writer.cpp
@@ -0,0 +1,319 @@
+#include "processor/operator/persistent/writer/parquet/basic_column_writer.h"
+
+#include "common/constants.h"
+#include "common/exception/runtime.h"
+#include "function/cast/functions/numeric_limits.h"
+#include "processor/operator/persistent/reader/parquet/parquet_rle_bp_decoder.h"
+#include "processor/operator/persistent/writer//parquet/parquet_rle_bp_encoder.h"
+#include "processor/operator/persistent/writer/parquet/parquet_writer.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug_parquet::format;
+using namespace lbug::common;
+
+std::unique_ptr<ColumnWriterState> BasicColumnWriter::initializeWriteState(
+    lbug_parquet::format::RowGroup& rowGroup) {
+    auto result = std::make_unique<BasicColumnWriterState>(rowGroup, rowGroup.columns.size());
+    registerToRowGroup(rowGroup);
+    return result;
+}
+
+void BasicColumnWriter::prepare(ColumnWriterState& stateToPrepare, ColumnWriterState* parent,
+    common::ValueVector* vector, uint64_t count) {
+    auto& state = reinterpret_cast<BasicColumnWriterState&>(stateToPrepare);
+    auto& colChunk = state.rowGroup.columns[state.colIdx];
+
+    uint64_t start = 0;
+    auto vcount = parent ? parent->definitionLevels.size() - state.definitionLevels.size() : count;
+    auto parentIdx = state.definitionLevels.size();
+    handleRepeatLevels(state, parent);
+    handleDefineLevels(state, parent, vector, count, maxDefine, maxDefine - 1);
+
+    auto vectorIdx = 0u;
+    for (auto i = start; i < vcount; i++) {
+        auto& pageInfo = state.pageInfo.back();
+        pageInfo.rowCount++;
+        colChunk.meta_data.num_values++;
+        if (parent && !parent->isEmpty.empty() && parent->isEmpty[parentIdx + i]) {
+            pageInfo.emptyCount++;
+            continue;
+        }
+        if (!vector->isNull(vectorIdx)) {
+            pageInfo.estimatedPageSize += getRowSize(vector, vectorIdx, state);
+            if (pageInfo.estimatedPageSize >= ParquetConstants::MAX_UNCOMPRESSED_PAGE_SIZE) {
+                PageInformation newInfo;
+                newInfo.offset = pageInfo.offset + pageInfo.rowCount;
+                state.pageInfo.push_back(newInfo);
+            }
+        }
+        vectorIdx++;
+    }
+}
+
+void BasicColumnWriter::beginWrite(ColumnWriterState& writerState) {
+    auto& state = reinterpret_cast<BasicColumnWriterState&>(writerState);
+
+    // Set up the page write info.
+    state.statsState = initializeStatsState();
+    for (auto pageIdx = 0u; pageIdx < state.pageInfo.size(); pageIdx++) {
+        auto& pageInfo = state.pageInfo[pageIdx];
+        if (pageInfo.rowCount == 0) {
+            KU_ASSERT(pageIdx + 1 == state.pageInfo.size());
+            state.pageInfo.erase(state.pageInfo.begin() + pageIdx);
+            break;
+        }
+        PageWriteInformation writeInfo;
+        // Set up the header.
+        auto& hdr = writeInfo.pageHeader;
+        hdr.compressed_page_size = 0;
+        hdr.uncompressed_page_size = 0;
+        hdr.type = PageType::DATA_PAGE;
+        hdr.__isset.data_page_header = true;
+
+        hdr.data_page_header.num_values = pageInfo.rowCount;
+        hdr.data_page_header.encoding = getEncoding(state);
+        hdr.data_page_header.definition_level_encoding = Encoding::RLE;
+        hdr.data_page_header.repetition_level_encoding = Encoding::RLE;
+
+        writeInfo.bufferWriter = std::make_shared<BufferWriter>();
+        writeInfo.writer = std::make_unique<Serializer>(writeInfo.bufferWriter);
+        writeInfo.writeCount = pageInfo.emptyCount;
+        writeInfo.maxWriteCount = pageInfo.rowCount;
+        writeInfo.pageState = initializePageState(state);
+
+        writeInfo.compressedSize = 0;
+        writeInfo.compressedData = nullptr;
+
+        state.writeInfo.push_back(std::move(writeInfo));
+    }
+
+    nextPage(state);
+}
+
+void BasicColumnWriter::write(ColumnWriterState& writerState, common::ValueVector* vector,
+    uint64_t count) {
+    auto& state = reinterpret_cast<BasicColumnWriterState&>(writerState);
+
+    uint64_t remaining = count;
+    uint64_t offset = 0;
+    while (remaining > 0) {
+        auto& writeInfo = state.writeInfo[state.currentPage - 1];
+        KU_ASSERT(writeInfo.bufferWriter != nullptr);
+        auto writeCount =
+            std::min<uint64_t>(remaining, writeInfo.maxWriteCount - writeInfo.writeCount);
+
+        writeVector(*writeInfo.writer, state.statsState.get(), writeInfo.pageState.get(), vector,
+            offset, offset + writeCount);
+
+        writeInfo.writeCount += writeCount;
+        if (writeInfo.writeCount == writeInfo.maxWriteCount) {
+            nextPage(state);
+        }
+        offset += writeCount;
+        remaining -= writeCount;
+    }
+}
+
+void BasicColumnWriter::finalizeWrite(ColumnWriterState& writerState) {
+    auto& state = reinterpret_cast<BasicColumnWriterState&>(writerState);
+    auto& columnChunk = state.rowGroup.columns[state.colIdx];
+
+    // Flush the last page (if any remains).
+    flushPage(state);
+
+    auto startOffset = writer.getOffset();
+    auto pageOffset = startOffset;
+    // Flush the dictionary.
+    if (hasDictionary(state)) {
+        columnChunk.meta_data.statistics.distinct_count = dictionarySize(state);
+        columnChunk.meta_data.statistics.__isset.distinct_count = true;
+        columnChunk.meta_data.dictionary_page_offset = pageOffset;
+        columnChunk.meta_data.__isset.dictionary_page_offset = true;
+        flushDictionary(state, state.statsState.get());
+        pageOffset += state.writeInfo[0].compressedSize;
+    }
+
+    // Record the start position of the pages for this column.
+    columnChunk.meta_data.data_page_offset = pageOffset;
+    setParquetStatistics(state, columnChunk);
+
+    // write the individual pages to disk
+    uint64_t totalUncompressedSize = 0;
+    for (auto& write_info : state.writeInfo) {
+        KU_ASSERT(write_info.pageHeader.uncompressed_page_size > 0);
+        auto header_start_offset = writer.getOffset();
+        write_info.pageHeader.write(writer.getProtocol());
+        // total uncompressed size in the column chunk includes the header size (!)
+        totalUncompressedSize += writer.getOffset() - header_start_offset;
+        totalUncompressedSize += write_info.pageHeader.uncompressed_page_size;
+        writer.write(write_info.compressedData, write_info.compressedSize);
+    }
+    columnChunk.meta_data.total_compressed_size = writer.getOffset() - startOffset;
+    columnChunk.meta_data.total_uncompressed_size = totalUncompressedSize;
+}
+
+void BasicColumnWriter::writeLevels(Serializer& serializer, const std::vector<uint16_t>& levels,
+    uint64_t maxValue, uint64_t startOffset, uint64_t count) {
+    if (levels.empty() || count == 0) {
+        return;
+    }
+
+    // Write the levels using the RLE-BP encoding.
+    auto bitWidth = RleBpDecoder::ComputeBitWidth((maxValue));
+    RleBpEncoder rleEncoder(bitWidth);
+
+    rleEncoder.beginPrepare(levels[startOffset]);
+    for (auto i = startOffset + 1; i < startOffset + count; i++) {
+        rleEncoder.prepareValue(levels[i]);
+    }
+    rleEncoder.finishPrepare();
+
+    // Start off by writing the byte count as a uint32_t.
+    serializer.write<uint32_t>(rleEncoder.getByteCount());
+    rleEncoder.beginWrite(levels[startOffset]);
+    for (auto i = startOffset + 1; i < startOffset + count; i++) {
+        rleEncoder.writeValue(serializer, levels[i]);
+    }
+    rleEncoder.finishWrite(serializer);
+}
+
+void BasicColumnWriter::nextPage(BasicColumnWriterState& state) {
+    if (state.currentPage > 0) {
+        // Need to flush the current page.
+        flushPage(state);
+    }
+    if (state.currentPage >= state.writeInfo.size()) {
+        state.currentPage = state.writeInfo.size() + 1;
+        return;
+    }
+    auto& pageInfo = state.pageInfo[state.currentPage];
+    auto& writeInfo = state.writeInfo[state.currentPage];
+    state.currentPage++;
+
+    // write the repetition levels
+    writeLevels(*writeInfo.writer, state.repetitionLevels, maxRepeat, pageInfo.offset,
+        pageInfo.rowCount);
+
+    // write the definition levels
+    writeLevels(*writeInfo.writer, state.definitionLevels, maxDefine, pageInfo.offset,
+        pageInfo.rowCount);
+}
+
+void BasicColumnWriter::flushPage(BasicColumnWriterState& state) {
+    KU_ASSERT(state.currentPage > 0);
+    if (state.currentPage > state.writeInfo.size()) {
+        return;
+    }
+
+    // compress the page info
+    auto& writeInfo = state.writeInfo[state.currentPage - 1];
+    auto& bufferedWriter = *writeInfo.bufferWriter;
+    auto& hdr = writeInfo.pageHeader;
+
+    flushPageState(*writeInfo.writer, writeInfo.pageState.get());
+
+    // now that we have finished writing the data we know the uncompressed size
+    if (bufferedWriter.getSize() > uint64_t(function::NumericLimits<int32_t>::maximum())) {
+        throw common::RuntimeException{common::stringFormat(
+            "Parquet writer: %d uncompressed page size out of range for type integer",
+            bufferedWriter.getSize())};
+    }
+    hdr.uncompressed_page_size = bufferedWriter.getSize();
+
+    // compress the data
+    compressPage(bufferedWriter, writeInfo.compressedSize, writeInfo.compressedData,
+        writeInfo.compressedBuf);
+    hdr.compressed_page_size = writeInfo.compressedSize;
+    KU_ASSERT(hdr.uncompressed_page_size > 0);
+    KU_ASSERT(hdr.compressed_page_size > 0);
+
+    if (writeInfo.compressedBuf) {
+        // if the data has been compressed, we no longer need the compressed data
+        KU_ASSERT(writeInfo.compressedBuf.get() == writeInfo.compressedData);
+        writeInfo.bufferWriter.reset();
+    }
+}
+
+void BasicColumnWriter::writeDictionary(BasicColumnWriterState& state,
+    std::unique_ptr<BufferWriter> bufferedSerializer, uint64_t rowCount) {
+    KU_ASSERT(bufferedSerializer);
+    KU_ASSERT(bufferedSerializer->getSize() > 0);
+
+    // write the dictionary page header
+    PageWriteInformation writeInfo;
+    // set up the header
+    auto& hdr = writeInfo.pageHeader;
+    hdr.uncompressed_page_size = bufferedSerializer->getSize();
+    hdr.type = PageType::DICTIONARY_PAGE;
+    hdr.__isset.dictionary_page_header = true;
+
+    hdr.dictionary_page_header.encoding = Encoding::PLAIN;
+    hdr.dictionary_page_header.is_sorted = false;
+    hdr.dictionary_page_header.num_values = rowCount;
+
+    writeInfo.bufferWriter = std::move(bufferedSerializer);
+    writeInfo.writer = std::make_unique<Serializer>(writeInfo.bufferWriter);
+    writeInfo.writeCount = 0;
+    writeInfo.maxWriteCount = 0;
+
+    // compress the contents of the dictionary page
+    compressPage(*writeInfo.bufferWriter, writeInfo.compressedSize, writeInfo.compressedData,
+        writeInfo.compressedBuf);
+    hdr.compressed_page_size = writeInfo.compressedSize;
+
+    // insert the dictionary page as the first page to write for this column
+    state.writeInfo.insert(state.writeInfo.begin(), std::move(writeInfo));
+}
+
+void BasicColumnWriter::setParquetStatistics(BasicColumnWriterState& state,
+    lbug_parquet::format::ColumnChunk& column) {
+    if (maxRepeat == 0) {
+        column.meta_data.statistics.null_count = nullCount;
+        column.meta_data.statistics.__isset.null_count = true;
+        column.meta_data.__isset.statistics = true;
+    }
+    // set min/max/min_value/max_value
+    // this code is not going to win any beauty contests, but well
+    auto min = state.statsState->getMin();
+    if (!min.empty()) {
+        column.meta_data.statistics.min = std::move(min);
+        column.meta_data.statistics.__isset.min = true;
+        column.meta_data.__isset.statistics = true;
+    }
+    auto max = state.statsState->getMax();
+    if (!max.empty()) {
+        column.meta_data.statistics.max = std::move(max);
+        column.meta_data.statistics.__isset.max = true;
+        column.meta_data.__isset.statistics = true;
+    }
+    auto min_value = state.statsState->getMinValue();
+    if (!min_value.empty()) {
+        column.meta_data.statistics.min_value = std::move(min_value);
+        column.meta_data.statistics.__isset.min_value = true;
+        column.meta_data.__isset.statistics = true;
+    }
+    auto max_value = state.statsState->getMaxValue();
+    if (!max_value.empty()) {
+        column.meta_data.statistics.max_value = std::move(max_value);
+        column.meta_data.statistics.__isset.max_value = true;
+        column.meta_data.__isset.statistics = true;
+    }
+    for (const auto& write_info : state.writeInfo) {
+        column.meta_data.encodings.push_back(write_info.pageHeader.data_page_header.encoding);
+    }
+}
+
+void BasicColumnWriter::registerToRowGroup(lbug_parquet::format::RowGroup& rowGroup) {
+    ColumnChunk column_chunk;
+    column_chunk.__isset.meta_data = true;
+    column_chunk.meta_data.codec = writer.getCodec();
+    column_chunk.meta_data.path_in_schema = schemaPath;
+    column_chunk.meta_data.num_values = 0;
+    column_chunk.meta_data.type = writer.getParquetType(schemaIdx);
+    rowGroup.columns.push_back(std::move(column_chunk));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/boolean_column_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/boolean_column_writer.cpp
new file mode 100644
index 0000000000..cd6bdd4760
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/boolean_column_writer.cpp
@@ -0,0 +1,45 @@
+#include "processor/operator/persistent/writer/parquet/boolean_column_writer.h"
+
+#include "common/serializer/serializer.h"
+
+namespace lbug {
+namespace processor {
+
+void BooleanColumnWriter::writeVector(common::Serializer& temp_writer,
+    ColumnWriterStatistics* writerStatistics, ColumnWriterPageState* writerPageState,
+    common::ValueVector* vector, uint64_t chunkStart, uint64_t chunkEnd) {
+    auto stats = reinterpret_cast<BooleanStatisticsState*>(writerStatistics);
+    auto state = reinterpret_cast<BooleanWriterPageState*>(writerPageState);
+    for (auto r = chunkStart; r < chunkEnd; r++) {
+        auto pos = getVectorPos(vector, r);
+        if (!vector->isNull(pos)) {
+            // only encode if non-null
+            if (vector->getValue<bool>(pos)) {
+                stats->max = true;
+                state->byte |= 1 << state->bytePos;
+            } else {
+                stats->min = false;
+            }
+            state->bytePos++;
+
+            if (state->bytePos == 8) {
+                temp_writer.write<uint8_t>(state->byte);
+                state->byte = 0;
+                state->bytePos = 0;
+            }
+        }
+    }
+}
+
+void BooleanColumnWriter::flushPageState(common::Serializer& temp_writer,
+    ColumnWriterPageState* writerPageState) {
+    auto state = reinterpret_cast<BooleanWriterPageState*>(writerPageState);
+    if (state->bytePos > 0) {
+        temp_writer.write<uint8_t>(state->byte);
+        state->byte = 0;
+        state->bytePos = 0;
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/column_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/column_writer.cpp
new file mode 100644
index 0000000000..b59719ff80
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/column_writer.cpp
@@ -0,0 +1,378 @@
+#include "processor/operator/persistent/writer/parquet/column_writer.h"
+
+#include "common/exception/runtime.h"
+#include "common/string_format.h"
+#include "function/cast/functions/numeric_limits.h"
+#include "lz4.hpp"
+#include "miniz_wrapper.hpp"
+#include "processor/operator/persistent/writer/parquet/boolean_column_writer.h"
+#include "processor/operator/persistent/writer/parquet/interval_column_writer.h"
+#include "processor/operator/persistent/writer/parquet/list_column_writer.h"
+#include "processor/operator/persistent/writer/parquet/parquet_writer.h"
+#include "processor/operator/persistent/writer/parquet/standard_column_writer.h"
+#include "processor/operator/persistent/writer/parquet/string_column_writer.h"
+#include "processor/operator/persistent/writer/parquet/struct_column_writer.h"
+#include "processor/operator/persistent/writer/parquet/uuid_column_writer.h"
+#include "snappy.h"
+#include "zstd.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug_parquet::format;
+using namespace lbug::common;
+
+struct ParquetInt128Operator {
+    template<class SRC, class TGT>
+    static inline TGT Operation(SRC input) {
+        return Int128_t::cast<double>(input);
+    }
+
+    template<class /*SRC*/, class /*TGT*/>
+    static inline std::unique_ptr<ColumnWriterStatistics> initializeStats() {
+        return std::make_unique<ColumnWriterStatistics>();
+    }
+
+    template<class SRC, class TGT>
+    static void handleStats(ColumnWriterStatistics* /*stats*/, SRC /*source*/, TGT /*target*/) {}
+};
+
+struct ParquetTimestampNSOperator : public BaseParquetOperator {
+    template<class SRC, class TGT>
+    static TGT Operation(SRC input) {
+        return Timestamp::fromEpochNanoSeconds(input).value;
+    }
+};
+
+struct ParquetTimestampSOperator : public BaseParquetOperator {
+    template<class SRC, class TGT>
+    static TGT Operation(SRC input) {
+        return Timestamp::fromEpochSeconds(input).value;
+    }
+};
+
+ColumnWriter::ColumnWriter(ParquetWriter& writer, uint64_t schemaIdx,
+    std::vector<std::string> schemaPath, uint64_t maxRepeat, uint64_t maxDefine, bool canHaveNulls)
+    : writer{writer}, schemaIdx{schemaIdx}, schemaPath{std::move(schemaPath)}, maxRepeat{maxRepeat},
+      maxDefine{maxDefine}, canHaveNulls{canHaveNulls}, nullCount{0} {}
+
+std::unique_ptr<ColumnWriter> ColumnWriter::createWriterRecursive(
+    std::vector<lbug_parquet::format::SchemaElement>& schemas, ParquetWriter& writer,
+    const LogicalType& type, const std::string& name, std::vector<std::string> schemaPathToCreate,
+    storage::MemoryManager* mm, uint64_t maxRepeatToCreate, uint64_t maxDefineToCreate,
+    bool canHaveNullsToCreate) {
+    auto nullType =
+        canHaveNullsToCreate ? FieldRepetitionType::OPTIONAL : FieldRepetitionType::REQUIRED;
+    if (!canHaveNullsToCreate) {
+        maxDefineToCreate--;
+    }
+    auto schemaIdx = schemas.size();
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::UNION:
+    case LogicalTypeID::STRUCT: {
+        const auto& fields = StructType::getFields(type);
+        // set up the schema element for this struct
+        lbug_parquet::format::SchemaElement schema_element;
+        schema_element.repetition_type = nullType;
+        schema_element.num_children = fields.size();
+        schema_element.__isset.num_children = true;
+        schema_element.__isset.type = false;
+        schema_element.__isset.repetition_type = true;
+        schema_element.name = name;
+        schemas.push_back(std::move(schema_element));
+        schemaPathToCreate.push_back(name);
+
+        // Construct the child types recursively.
+        std::vector<std::unique_ptr<ColumnWriter>> childWriters;
+        childWriters.reserve(fields.size());
+        for (auto& field : fields) {
+            childWriters.push_back(createWriterRecursive(schemas, writer, field.getType(),
+                field.getName(), schemaPathToCreate, mm, maxRepeatToCreate, maxDefineToCreate + 1));
+        }
+        return std::make_unique<StructColumnWriter>(writer, schemaIdx,
+            std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+            std::move(childWriters), canHaveNullsToCreate);
+    }
+    case LogicalTypeID::ARRAY:
+    case LogicalTypeID::LIST: {
+        const auto& childType = ListType::getChildType(type);
+        // Set up the two schema elements for the list
+        // for some reason we only set the converted type in the OPTIONAL element
+        // first an OPTIONAL element.
+        lbug_parquet::format::SchemaElement optionalElem;
+        optionalElem.repetition_type = nullType;
+        optionalElem.num_children = 1;
+        optionalElem.converted_type = ConvertedType::LIST;
+        optionalElem.__isset.num_children = true;
+        optionalElem.__isset.type = false;
+        optionalElem.__isset.repetition_type = true;
+        optionalElem.__isset.converted_type = true;
+        optionalElem.name = name;
+        schemas.push_back(std::move(optionalElem));
+        schemaPathToCreate.push_back(name);
+
+        // Then a REPEATED element.
+        lbug_parquet::format::SchemaElement repeatedElem;
+        repeatedElem.repetition_type = FieldRepetitionType::REPEATED;
+        repeatedElem.num_children = 1;
+        repeatedElem.__isset.num_children = true;
+        repeatedElem.__isset.type = false;
+        repeatedElem.__isset.repetition_type = true;
+        repeatedElem.name = "list";
+        schemas.push_back(std::move(repeatedElem));
+        schemaPathToCreate.emplace_back("list");
+
+        auto child_writer = createWriterRecursive(schemas, writer, childType, "element",
+            schemaPathToCreate, mm, maxRepeatToCreate + 1, maxDefineToCreate + 2);
+        return std::make_unique<ListColumnWriter>(writer, schemaIdx, std::move(schemaPathToCreate),
+            maxRepeatToCreate, maxDefineToCreate, std::move(child_writer), canHaveNullsToCreate);
+    }
+    case LogicalTypeID::MAP: {
+        // Maps are stored as follows in parquet:
+        // <map-repetition> group <name> (MAP) {
+        // 	repeated group key_value {
+        // 		required <key-type> key;
+        // 		<value-repetition> <value-type> value;
+        // 	}
+        // }
+        lbug_parquet::format::SchemaElement topElement;
+        topElement.repetition_type = nullType;
+        topElement.num_children = 1;
+        topElement.converted_type = ConvertedType::MAP;
+        topElement.__isset.repetition_type = true;
+        topElement.__isset.num_children = true;
+        topElement.__isset.converted_type = true;
+        topElement.__isset.type = false;
+        topElement.name = name;
+        schemas.push_back(std::move(topElement));
+        schemaPathToCreate.push_back(name);
+
+        // key_value element
+        lbug_parquet::format::SchemaElement kv_element;
+        kv_element.repetition_type = FieldRepetitionType::REPEATED;
+        kv_element.num_children = 2;
+        kv_element.__isset.repetition_type = true;
+        kv_element.__isset.num_children = true;
+        kv_element.__isset.type = false;
+        kv_element.name = "key_value";
+        schemas.push_back(std::move(kv_element));
+        schemaPathToCreate.emplace_back("key_value");
+
+        // Construct the child types recursively.
+        std::vector<common::LogicalType> kvTypes;
+        kvTypes.push_back(MapType::getKeyType(type).copy());
+        kvTypes.push_back(MapType::getValueType(type).copy());
+        std::vector<std::string> kvNames{"key", "value"};
+        std::vector<std::unique_ptr<ColumnWriter>> childrenWriters;
+        childrenWriters.reserve(2);
+        for (auto i = 0u; i < 2; i++) {
+            auto childWriter = createWriterRecursive(schemas, writer, kvTypes[i], kvNames[i],
+                schemaPathToCreate, mm, maxRepeatToCreate + 1, maxDefineToCreate + 2, i != 0);
+            childrenWriters.push_back(std::move(childWriter));
+        }
+        auto structWriter = std::make_unique<StructColumnWriter>(writer, schemaIdx,
+            schemaPathToCreate, maxRepeatToCreate, maxDefineToCreate, std::move(childrenWriters),
+            canHaveNullsToCreate);
+        return std::make_unique<ListColumnWriter>(writer, schemaIdx, schemaPathToCreate,
+            maxRepeatToCreate, maxDefineToCreate, std::move(structWriter), canHaveNullsToCreate);
+    }
+    default: {
+        SchemaElement schemaElement;
+        schemaElement.type = ParquetWriter::convertToParquetType(type);
+        schemaElement.repetition_type = nullType;
+        schemaElement.__isset.num_children = false;
+        schemaElement.__isset.type = true;
+        schemaElement.__isset.repetition_type = true;
+        schemaElement.name = name;
+        ParquetWriter::setSchemaProperties(type, schemaElement);
+        schemas.push_back(std::move(schemaElement));
+        schemaPathToCreate.push_back(name);
+
+        switch (type.getLogicalTypeID()) {
+        case LogicalTypeID::BOOL:
+            return std::make_unique<BooleanColumnWriter>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::INT8:
+            return std::make_unique<StandardColumnWriter<int8_t, int32_t>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::INT16:
+            return std::make_unique<StandardColumnWriter<int16_t, int32_t>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::INT32:
+        case LogicalTypeID::DATE:
+            return std::make_unique<StandardColumnWriter<int32_t, int32_t>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::TIMESTAMP_TZ:
+        case LogicalTypeID::TIMESTAMP_MS:
+        case LogicalTypeID::TIMESTAMP:
+        case LogicalTypeID::SERIAL:
+        case LogicalTypeID::INT64:
+            return std::make_unique<StandardColumnWriter<int64_t, int64_t>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::TIMESTAMP_NS:
+            return make_unique<StandardColumnWriter<int64_t, int64_t, ParquetTimestampNSOperator>>(
+                writer, schemaIdx, std::move(schemaPathToCreate), maxRepeatToCreate,
+                maxDefineToCreate, canHaveNullsToCreate);
+        case LogicalTypeID::TIMESTAMP_SEC:
+            return make_unique<StandardColumnWriter<int64_t, int64_t, ParquetTimestampSOperator>>(
+                writer, schemaIdx, std::move(schemaPathToCreate), maxRepeatToCreate,
+                maxDefineToCreate, canHaveNullsToCreate);
+        case LogicalTypeID::INT128:
+            return std::make_unique<StandardColumnWriter<int128_t, double, ParquetInt128Operator>>(
+                writer, schemaIdx, std::move(schemaPathToCreate), maxRepeatToCreate,
+                maxDefineToCreate, canHaveNullsToCreate);
+        case LogicalTypeID::UINT8:
+            return std::make_unique<StandardColumnWriter<uint8_t, int32_t>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::UINT16:
+            return std::make_unique<StandardColumnWriter<uint16_t, int32_t>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::UINT32:
+            return std::make_unique<StandardColumnWriter<uint32_t, uint32_t>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::UINT64:
+            return std::make_unique<StandardColumnWriter<uint64_t, uint64_t>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::FLOAT:
+            return std::make_unique<StandardColumnWriter<float, float>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::DOUBLE:
+            return std::make_unique<StandardColumnWriter<double, double>>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::BLOB:
+        case LogicalTypeID::STRING:
+            return std::make_unique<StringColumnWriter>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate, mm);
+        case LogicalTypeID::INTERVAL:
+            return std::make_unique<IntervalColumnWriter>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        case LogicalTypeID::UUID:
+            return std::make_unique<UUIDColumnWriter>(writer, schemaIdx,
+                std::move(schemaPathToCreate), maxRepeatToCreate, maxDefineToCreate,
+                canHaveNullsToCreate);
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    }
+}
+
+void ColumnWriter::handleRepeatLevels(ColumnWriterState& stateToHandle, ColumnWriterState* parent) {
+    if (!parent) {
+        // no repeat levels without a parent node
+        return;
+    }
+    while (stateToHandle.repetitionLevels.size() < parent->repetitionLevels.size()) {
+        stateToHandle.repetitionLevels.push_back(
+            parent->repetitionLevels[stateToHandle.repetitionLevels.size()]);
+    }
+}
+
+void ColumnWriter::handleDefineLevels(ColumnWriterState& state, ColumnWriterState* parent,
+    common::ValueVector* vector, uint64_t count, uint16_t defineValue, uint16_t nullValue) {
+    if (parent) {
+        // parent node: inherit definition level from the parent
+        uint64_t vectorIdx = 0;
+        while (state.definitionLevels.size() < parent->definitionLevels.size()) {
+            auto currentIdx = state.definitionLevels.size();
+            if (parent->definitionLevels[currentIdx] != ParquetConstants::PARQUET_DEFINE_VALID) {
+                state.definitionLevels.push_back(parent->definitionLevels[currentIdx]);
+            } else if (!vector->isNull(getVectorPos(vector, vectorIdx))) {
+                state.definitionLevels.push_back(defineValue);
+            } else {
+                if (!canHaveNulls) {
+                    throw RuntimeException(
+                        "Parquet writer: map key column is not allowed to contain NULL values");
+                }
+                nullCount++;
+                state.definitionLevels.push_back(nullValue);
+            }
+            if (parent->isEmpty.empty() || !parent->isEmpty[currentIdx]) {
+                vectorIdx++;
+            }
+        }
+    } else {
+        // no parent: set definition levels only from this validity mask
+        for (auto i = 0u; i < count; i++) {
+            if (!vector->isNull(getVectorPos(vector, i))) {
+                state.definitionLevels.push_back(defineValue);
+            } else {
+                if (!canHaveNulls) {
+                    throw RuntimeException(
+                        "Parquet writer: map key column is not allowed to contain NULL values");
+                }
+                nullCount++;
+                state.definitionLevels.push_back(nullValue);
+            }
+        }
+    }
+}
+
+void ColumnWriter::compressPage(common::BufferWriter& bufferedSerializer, size_t& compressedSize,
+    uint8_t*& compressedData, std::unique_ptr<uint8_t[]>& compressedBuf) {
+    switch (writer.getCodec()) {
+    case CompressionCodec::UNCOMPRESSED: {
+        compressedSize = bufferedSerializer.getSize();
+        compressedData = bufferedSerializer.getBlobData();
+    } break;
+    case CompressionCodec::SNAPPY: {
+        compressedSize = lbug_snappy::MaxCompressedLength(bufferedSerializer.getSize());
+        compressedBuf = std::unique_ptr<uint8_t[]>(new uint8_t[compressedSize]);
+        lbug_snappy::RawCompress(reinterpret_cast<const char*>(bufferedSerializer.getBlobData()),
+            bufferedSerializer.getSize(), reinterpret_cast<char*>(compressedBuf.get()),
+            &compressedSize);
+        compressedData = compressedBuf.get();
+        KU_ASSERT(compressedSize <= lbug_snappy::MaxCompressedLength(bufferedSerializer.getSize()));
+    } break;
+    case CompressionCodec::ZSTD: {
+        compressedSize = lbug_zstd::ZSTD_compressBound(bufferedSerializer.getSize());
+        compressedBuf = std::unique_ptr<uint8_t[]>(new uint8_t[compressedSize]);
+        compressedSize = lbug_zstd::ZSTD_compress((void*)compressedBuf.get(), compressedSize,
+            reinterpret_cast<const char*>(bufferedSerializer.getBlobData()),
+            bufferedSerializer.getSize(), ZSTD_CLEVEL_DEFAULT);
+        compressedData = compressedBuf.get();
+    } break;
+    case CompressionCodec::GZIP: {
+        MiniZStream stream;
+        compressedSize = stream.MaxCompressedLength(bufferedSerializer.getSize());
+        compressedBuf = std::unique_ptr<uint8_t[]>(new uint8_t[compressedSize]);
+        stream.Compress(reinterpret_cast<const char*>(bufferedSerializer.getBlobData()),
+            bufferedSerializer.getSize(), reinterpret_cast<char*>(compressedBuf.get()),
+            &compressedSize);
+        compressedData = compressedBuf.get();
+    } break;
+    case CompressionCodec::LZ4_RAW: {
+        compressedSize = lbug_lz4::LZ4_compressBound(bufferedSerializer.getSize());
+        compressedBuf = std::unique_ptr<uint8_t[]>(new uint8_t[compressedSize]);
+        compressedSize = lbug_lz4::LZ4_compress_default(
+            reinterpret_cast<const char*>(bufferedSerializer.getBlobData()),
+            reinterpret_cast<char*>(compressedBuf.get()), bufferedSerializer.getSize(),
+            compressedSize);
+        compressedData = compressedBuf.get();
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+
+    if (compressedSize > uint64_t(function::NumericLimits<int32_t>::maximum())) {
+        throw RuntimeException(
+            stringFormat("Parquet writer: {} compressed page size out of range for type integer",
+                bufferedSerializer.getSize()));
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/interval_column_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/interval_column_writer.cpp
new file mode 100644
index 0000000000..6c4b141e39
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/interval_column_writer.cpp
@@ -0,0 +1,39 @@
+#include "processor/operator/persistent/writer/parquet/interval_column_writer.h"
+
+#include "common/exception/runtime.h"
+#include "common/serializer/serializer.h"
+
+namespace lbug {
+namespace processor {
+
+void IntervalColumnWriter::writeParquetInterval(common::interval_t input, uint8_t* result) {
+    if (input.days < 0 || input.months < 0 || input.micros < 0) {
+        throw common::RuntimeException{"Parquet files do not support negative intervals"};
+    }
+    uint32_t dataToStore = 0;
+    dataToStore = input.months;
+    memcpy(result, &dataToStore, sizeof(dataToStore));
+    dataToStore = input.days;
+    result += sizeof(dataToStore);
+    memcpy(result, &dataToStore, sizeof(dataToStore));
+    dataToStore = input.micros / 1000;
+    result += sizeof(dataToStore);
+    memcpy(result, &dataToStore, sizeof(dataToStore));
+}
+
+void IntervalColumnWriter::writeVector(common::Serializer& bufferedSerializer,
+    ColumnWriterStatistics* /*state*/, ColumnWriterPageState* /*pageState*/,
+    common::ValueVector* vector, uint64_t chunkStart, uint64_t chunkEnd) {
+    uint8_t tmpIntervalBuf[common::ParquetConstants::PARQUET_INTERVAL_SIZE];
+    for (auto r = chunkStart; r < chunkEnd; r++) {
+        auto pos = getVectorPos(vector, r);
+        if (!vector->isNull(pos)) {
+            writeParquetInterval(vector->getValue<common::interval_t>(pos), tmpIntervalBuf);
+            bufferedSerializer.write(tmpIntervalBuf,
+                common::ParquetConstants::PARQUET_INTERVAL_SIZE);
+        }
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/list_column_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/list_column_writer.cpp
new file mode 100644
index 0000000000..dd3e1718b2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/list_column_writer.cpp
@@ -0,0 +1,109 @@
+#include "processor/operator/persistent/writer/parquet/list_column_writer.h"
+
+#include "common/constants.h"
+#include "common/exception/runtime.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug_parquet::format;
+
+std::unique_ptr<ColumnWriterState> ListColumnWriter::initializeWriteState(
+    lbug_parquet::format::RowGroup& rowGroup) {
+    auto result = std::make_unique<ListColumnWriterState>(rowGroup, rowGroup.columns.size());
+    result->childState = childWriter->initializeWriteState(rowGroup);
+    return result;
+}
+
+bool ListColumnWriter::hasAnalyze() {
+    return childWriter->hasAnalyze();
+}
+
+void ListColumnWriter::analyze(ColumnWriterState& writerState, ColumnWriterState* /*parent*/,
+    common::ValueVector* vector, uint64_t /*count*/) {
+    auto& state = reinterpret_cast<ListColumnWriterState&>(writerState);
+    childWriter->analyze(*state.childState, &writerState, common::ListVector::getDataVector(vector),
+        common::ListVector::getDataVectorSize(vector));
+}
+
+void ListColumnWriter::finalizeAnalyze(ColumnWriterState& writerState) {
+    auto& state = reinterpret_cast<ListColumnWriterState&>(writerState);
+    childWriter->finalizeAnalyze(*state.childState);
+}
+
+void ListColumnWriter::prepare(ColumnWriterState& writerState, ColumnWriterState* parent,
+    common::ValueVector* vector, uint64_t count) {
+    auto& state = reinterpret_cast<ListColumnWriterState&>(writerState);
+
+    // Write definition levels and repeats.
+    uint64_t start = 0;
+    auto vcount = parent ? parent->definitionLevels.size() - state.parentIdx : count;
+    uint64_t vectorIdx = 0;
+    for (auto i = start; i < vcount; i++) {
+        auto parentIdx = state.parentIdx + i;
+        if (parent && !parent->isEmpty.empty() && parent->isEmpty[parentIdx]) {
+            state.definitionLevels.push_back(parent->definitionLevels[parentIdx]);
+            state.repetitionLevels.push_back(parent->repetitionLevels[parentIdx]);
+            state.isEmpty.push_back(true);
+            continue;
+        }
+        auto firstRepeatLevel = parent && !parent->repetitionLevels.empty() ?
+                                    parent->repetitionLevels[parentIdx] :
+                                    maxRepeat;
+        auto pos = getVectorPos(vector, vectorIdx);
+        if (parent &&
+            parent->definitionLevels[parentIdx] != common::ParquetConstants::PARQUET_DEFINE_VALID) {
+            state.definitionLevels.push_back(parent->definitionLevels[parentIdx]);
+            state.repetitionLevels.push_back(firstRepeatLevel);
+            state.isEmpty.push_back(true);
+        } else if (!vector->isNull(pos)) {
+            auto listEntry = vector->getValue<common::list_entry_t>(pos);
+            // push the repetition levels
+            if (listEntry.size == 0) {
+                state.definitionLevels.push_back(maxDefine);
+                state.isEmpty.push_back(true);
+            } else {
+                state.definitionLevels.push_back(common::ParquetConstants::PARQUET_DEFINE_VALID);
+                state.isEmpty.push_back(false);
+            }
+            state.repetitionLevels.push_back(firstRepeatLevel);
+            for (auto k = 1u; k < listEntry.size; k++) {
+                state.repetitionLevels.push_back(maxRepeat + 1);
+                state.definitionLevels.push_back(common::ParquetConstants::PARQUET_DEFINE_VALID);
+                state.isEmpty.push_back(false);
+            }
+        } else {
+            if (!canHaveNulls) {
+                throw common::RuntimeException(
+                    "Parquet writer: map key column is not allowed to contain NULL values");
+            }
+            state.definitionLevels.push_back(maxDefine - 1);
+            state.repetitionLevels.push_back(firstRepeatLevel);
+            state.isEmpty.push_back(true);
+        }
+        vectorIdx++;
+    }
+    state.parentIdx += vcount;
+    childWriter->prepare(*state.childState, &writerState, common::ListVector::getDataVector(vector),
+        common::ListVector::getDataVectorSize(vector));
+}
+
+void ListColumnWriter::beginWrite(ColumnWriterState& state_p) {
+    auto& state = reinterpret_cast<ListColumnWriterState&>(state_p);
+    childWriter->beginWrite(*state.childState);
+}
+
+void ListColumnWriter::write(ColumnWriterState& writerState, common::ValueVector* vector,
+    uint64_t /*count*/) {
+    auto& state = reinterpret_cast<ListColumnWriterState&>(writerState);
+    childWriter->write(*state.childState, common::ListVector::getDataVector(vector),
+        common::ListVector::getDataVectorSize(vector));
+}
+
+void ListColumnWriter::finalizeWrite(ColumnWriterState& writerState) {
+    auto& state = reinterpret_cast<ListColumnWriterState&>(writerState);
+    childWriter->finalizeWrite(*state.childState);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/parquet_rle_bp_encoder.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/parquet_rle_bp_encoder.cpp
new file mode 100644
index 0000000000..363b5ee3b5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/parquet_rle_bp_encoder.cpp
@@ -0,0 +1,112 @@
+#include "processor/operator/persistent/writer/parquet/parquet_rle_bp_encoder.h"
+
+#include "common/assert.h"
+
+namespace lbug {
+namespace processor {
+
+static void varintEncode(uint32_t val, common::Serializer& ser) {
+    do {
+        uint8_t byte = val & 127;
+        val >>= 7;
+        if (val != 0) {
+            byte |= 128;
+        }
+        ser.write<uint8_t>(byte);
+    } while (val != 0);
+}
+
+uint8_t RleBpEncoder::getVarintSize(uint32_t val) {
+    uint8_t res = 0;
+    do {
+        val >>= 7;
+        res++;
+    } while (val != 0);
+    return res;
+}
+
+RleBpEncoder::RleBpEncoder(uint32_t bit_width)
+    : byteWidth((bit_width + 7) / 8), byteCount(uint64_t(-1)), runCount(uint64_t(-1)),
+      currentRunCount(0), lastValue(0) {}
+
+// we always RLE everything (for now)
+void RleBpEncoder::beginPrepare(uint32_t first_value) {
+    byteCount = 0;
+    runCount = 1;
+    currentRunCount = 1;
+    lastValue = first_value;
+}
+
+void RleBpEncoder::finishRun() {
+    // last value, or value has changed
+    // write out the current run
+    byteCount += getVarintSize(currentRunCount << 1) + byteWidth;
+    currentRunCount = 1;
+    runCount++;
+}
+
+void RleBpEncoder::prepareValue(uint32_t value) {
+    if (value != lastValue) {
+        finishRun();
+        lastValue = value;
+    } else {
+        currentRunCount++;
+    }
+}
+
+void RleBpEncoder::finishPrepare() {
+    finishRun();
+}
+
+uint64_t RleBpEncoder::getByteCount() const {
+    KU_ASSERT(byteCount != uint64_t(-1));
+    return byteCount;
+}
+
+void RleBpEncoder::beginWrite(uint32_t first_value) {
+    // start the RLE runs
+    lastValue = first_value;
+    currentRunCount = 1;
+}
+
+void RleBpEncoder::writeRun(common::Serializer& writer) {
+    // write the header of the run
+    varintEncode(currentRunCount << 1, writer);
+    // now write the value
+    KU_ASSERT(lastValue >> (byteWidth * 8) == 0);
+    switch (byteWidth) {
+    case 1:
+        writer.write<uint8_t>(lastValue);
+        break;
+    case 2:
+        writer.write<uint16_t>(lastValue);
+        break;
+    case 3:
+        writer.write<uint8_t>(lastValue & 0xFF);
+        writer.write<uint8_t>((lastValue >> 8) & 0xFF);
+        writer.write<uint8_t>((lastValue >> 16) & 0xFF);
+        break;
+    case 4:
+        writer.write<uint32_t>(lastValue);
+        break;
+    default:
+        KU_UNREACHABLE;
+    }
+    currentRunCount = 1;
+}
+
+void RleBpEncoder::writeValue(common::Serializer& writer, uint32_t value) {
+    if (value != lastValue) {
+        writeRun(writer);
+        lastValue = value;
+    } else {
+        currentRunCount++;
+    }
+}
+
+void RleBpEncoder::finishWrite(common::Serializer& writer) {
+    writeRun(writer);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/parquet_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/parquet_writer.cpp
new file mode 100644
index 0000000000..a8ed8de768
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/parquet_writer.cpp
@@ -0,0 +1,304 @@
+#include "processor/operator/persistent/writer/parquet/parquet_writer.h"
+
+#include "common/constants.h"
+#include "common/data_chunk/data_chunk.h"
+#include "common/exception/runtime.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/system_config.h"
+#include "main/client_context.h"
+#include "protocol/TCompactProtocol.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug_parquet::format;
+using namespace lbug::common;
+
+ParquetWriter::ParquetWriter(std::string fileName, std::vector<common::LogicalType> types,
+    std::vector<std::string> columnNames, lbug_parquet::format::CompressionCodec::type codec,
+    main::ClientContext* context)
+    : fileName{std::move(fileName)}, types{std::move(types)}, columnNames{std::move(columnNames)},
+      codec{codec}, fileOffset{0}, mm{storage::MemoryManager::Get(*context)} {
+    fileInfo = VirtualFileSystem::GetUnsafe(*context)->openFile(this->fileName,
+        FileOpenFlags(FileFlags::WRITE | FileFlags::CREATE_AND_TRUNCATE_IF_EXISTS), context);
+    // Parquet files start with the string "PAR1".
+    fileInfo->writeFile(reinterpret_cast<const uint8_t*>(ParquetConstants::PARQUET_MAGIC_WORDS),
+        strlen(ParquetConstants::PARQUET_MAGIC_WORDS), fileOffset);
+    fileOffset += strlen(ParquetConstants::PARQUET_MAGIC_WORDS);
+    lbug_apache::thrift::protocol::TCompactProtocolFactoryT<ParquetWriterTransport> tprotoFactory;
+    protocol = tprotoFactory.getProtocol(
+        std::make_shared<ParquetWriterTransport>(fileInfo.get(), fileOffset));
+
+    fileMetaData.num_rows = 0;
+    fileMetaData.version = 1;
+
+    fileMetaData.__isset.created_by = true;
+    fileMetaData.created_by = "LBUG";
+
+    fileMetaData.schema.resize(1);
+
+    // populate root schema object
+    fileMetaData.schema[0].name = "lbug_schema";
+    fileMetaData.schema[0].num_children = this->types.size();
+    fileMetaData.schema[0].__isset.num_children = true;
+    fileMetaData.schema[0].repetition_type = lbug_parquet::format::FieldRepetitionType::REQUIRED;
+    fileMetaData.schema[0].__isset.repetition_type = true;
+
+    std::vector<std::string> schemaPath;
+    for (auto i = 0u; i < this->types.size(); i++) {
+        columnWriters.push_back(ColumnWriter::createWriterRecursive(fileMetaData.schema, *this,
+            this->types[i], this->columnNames[i], schemaPath, mm));
+    }
+}
+
+Type::type ParquetWriter::convertToParquetType(const LogicalType& type) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL:
+        return Type::BOOLEAN;
+    case LogicalTypeID::INT8:
+    case LogicalTypeID::INT16:
+    case LogicalTypeID::INT32:
+    case LogicalTypeID::UINT8:
+    case LogicalTypeID::UINT16:
+    case LogicalTypeID::UINT32:
+    case LogicalTypeID::DATE:
+        return Type::INT32;
+    case LogicalTypeID::UINT64:
+    case LogicalTypeID::INT64:
+    case LogicalTypeID::SERIAL:
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::TIMESTAMP_NS:
+    case LogicalTypeID::TIMESTAMP_MS:
+    case LogicalTypeID::TIMESTAMP_SEC:
+    case LogicalTypeID::TIMESTAMP:
+        return Type::INT64;
+    case LogicalTypeID::FLOAT:
+        return Type::FLOAT;
+    case LogicalTypeID::INT128:
+    case LogicalTypeID::DOUBLE:
+        return Type::DOUBLE;
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::STRING:
+        return Type::BYTE_ARRAY;
+    case LogicalTypeID::UUID:
+    case LogicalTypeID::INTERVAL:
+        return Type::FIXED_LEN_BYTE_ARRAY;
+    default:
+        throw RuntimeException{
+            stringFormat("Writing a column with type: {} to parquet is not supported.",
+                LogicalTypeUtils::toString(type.getLogicalTypeID()))};
+    }
+}
+
+void ParquetWriter::setSchemaProperties(const LogicalType& type, SchemaElement& schemaElement) {
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::INT8: {
+        schemaElement.converted_type = ConvertedType::INT_8;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::INT16: {
+        schemaElement.converted_type = ConvertedType::INT_16;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::INT32: {
+        schemaElement.converted_type = ConvertedType::INT_32;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::INT64: {
+        schemaElement.converted_type = ConvertedType::INT_64;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::UINT8: {
+        schemaElement.converted_type = ConvertedType::UINT_8;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::UINT16: {
+        schemaElement.converted_type = ConvertedType::UINT_16;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::UINT32: {
+        schemaElement.converted_type = ConvertedType::UINT_32;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::UINT64: {
+        schemaElement.converted_type = ConvertedType::UINT_64;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::DATE: {
+        schemaElement.converted_type = ConvertedType::DATE;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::STRING: {
+        schemaElement.converted_type = ConvertedType::UTF8;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::INTERVAL: {
+        schemaElement.type_length = common::ParquetConstants::PARQUET_INTERVAL_SIZE;
+        schemaElement.converted_type = ConvertedType::INTERVAL;
+        schemaElement.__isset.type_length = true;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::TIMESTAMP_TZ:
+    case LogicalTypeID::TIMESTAMP_NS:
+    case LogicalTypeID::TIMESTAMP_SEC:
+    case LogicalTypeID::TIMESTAMP: {
+        schemaElement.converted_type = ConvertedType::TIMESTAMP_MICROS;
+        schemaElement.__isset.converted_type = true;
+        schemaElement.__isset.logicalType = true;
+        schemaElement.logicalType.__isset.TIMESTAMP = true;
+        schemaElement.logicalType.TIMESTAMP.isAdjustedToUTC =
+            (type.getLogicalTypeID() == LogicalTypeID::TIMESTAMP_TZ);
+        schemaElement.logicalType.TIMESTAMP.unit.__isset.MICROS = true;
+    } break;
+    case LogicalTypeID::TIMESTAMP_MS: {
+        schemaElement.converted_type = ConvertedType::TIMESTAMP_MILLIS;
+        schemaElement.__isset.converted_type = true;
+        schemaElement.__isset.logicalType = true;
+        schemaElement.logicalType.__isset.TIMESTAMP = true;
+        schemaElement.logicalType.TIMESTAMP.isAdjustedToUTC = false;
+        schemaElement.logicalType.TIMESTAMP.unit.__isset.MILLIS = true;
+    } break;
+    case LogicalTypeID::SERIAL: {
+        schemaElement.converted_type = ConvertedType::SERIAL;
+        schemaElement.__isset.converted_type = true;
+    } break;
+    case LogicalTypeID::UUID: {
+        schemaElement.type_length = common::ParquetConstants::PARQUET_UUID_SIZE;
+        schemaElement.__isset.type_length = true;
+        schemaElement.__isset.logicalType = true;
+        schemaElement.logicalType.__isset.UUID = true;
+    } break;
+    default:
+        break;
+    }
+}
+
+void ParquetWriter::flush(FactorizedTable& ft) {
+    if (ft.getNumTuples() == 0) {
+        return;
+    }
+
+    PreparedRowGroup preparedRowGroup;
+    prepareRowGroup(ft, preparedRowGroup);
+    flushRowGroup(preparedRowGroup);
+    ft.clear();
+}
+
+void ParquetWriter::prepareRowGroup(FactorizedTable& ft, PreparedRowGroup& result) {
+    // set up a new row group for this chunk collection
+    auto& row_group = result.rowGroup;
+    row_group.num_rows = ft.getTotalNumFlatTuples();
+    row_group.total_byte_size = row_group.num_rows * ft.getTableSchema()->getNumBytesPerTuple();
+    row_group.__isset.file_offset = true;
+
+    auto& states = result.states;
+    // iterate over each of the columns of the chunk collection and write them
+    KU_ASSERT(ft.getTableSchema()->getNumColumns() == columnWriters.size());
+    std::vector<std::unique_ptr<ColumnWriterState>> writerStates;
+    std::unique_ptr<DataChunk> unflatDataChunkToRead =
+        std::make_unique<DataChunk>(ft.getTableSchema()->getNumUnFlatColumns());
+    std::unique_ptr<DataChunk> flatDataChunkToRead = std::make_unique<DataChunk>(
+        ft.getTableSchema()->getNumFlatColumns(), DataChunkState::getSingleValueDataChunkState());
+    std::vector<ValueVector*> vectorsToRead;
+    vectorsToRead.reserve(columnWriters.size());
+    auto numFlatVectors = 0;
+    for (auto i = 0u; i < columnWriters.size(); i++) {
+        writerStates.emplace_back(columnWriters[i]->initializeWriteState(row_group));
+        auto vector = std::make_unique<ValueVector>(types[i].copy(), mm);
+        vectorsToRead.push_back(vector.get());
+        if (ft.getTableSchema()->getColumn(i)->isFlat()) {
+            flatDataChunkToRead->insert(numFlatVectors, std::move(vector));
+            numFlatVectors++;
+        } else {
+            unflatDataChunkToRead->insert(i - numFlatVectors, std::move(vector));
+        }
+    }
+    uint64_t numTuplesRead = 0u;
+    while (numTuplesRead < ft.getNumTuples()) {
+        readFromFT(ft, vectorsToRead, numTuplesRead);
+        for (auto i = 0u; i < columnWriters.size(); i++) {
+            if (columnWriters[i]->hasAnalyze()) {
+                columnWriters[i]->analyze(*writerStates[i], nullptr, vectorsToRead[i],
+                    getNumTuples(unflatDataChunkToRead.get()));
+            }
+        }
+    }
+
+    for (auto i = 0u; i < columnWriters.size(); i++) {
+        if (columnWriters[i]->hasAnalyze()) {
+            columnWriters[i]->finalizeAnalyze(*writerStates[i]);
+        }
+    }
+
+    numTuplesRead = 0u;
+    while (numTuplesRead < ft.getNumTuples()) {
+        readFromFT(ft, vectorsToRead, numTuplesRead);
+        for (auto i = 0u; i < columnWriters.size(); i++) {
+            columnWriters[i]->prepare(*writerStates[i], nullptr, vectorsToRead[i],
+                getNumTuples(unflatDataChunkToRead.get()));
+        }
+    }
+
+    for (auto i = 0u; i < columnWriters.size(); i++) {
+        columnWriters[i]->beginWrite(*writerStates[i]);
+    }
+
+    numTuplesRead = 0u;
+    while (numTuplesRead < ft.getNumTuples()) {
+        readFromFT(ft, vectorsToRead, numTuplesRead);
+        for (auto i = 0u; i < columnWriters.size(); i++) {
+            columnWriters[i]->write(*writerStates[i], vectorsToRead[i],
+                getNumTuples(unflatDataChunkToRead.get()));
+        }
+    }
+
+    for (auto& write_state : writerStates) {
+        states.push_back(std::move(write_state));
+    }
+}
+
+void ParquetWriter::flushRowGroup(PreparedRowGroup& rowGroup) {
+    std::lock_guard<std::mutex> glock(lock);
+    auto& parquetRowGroup = rowGroup.rowGroup;
+    auto& states = rowGroup.states;
+    if (states.empty()) {
+        throw RuntimeException("Attempting to flush a row group with no rows");
+    }
+    parquetRowGroup.file_offset = fileOffset;
+    for (auto i = 0u; i < states.size(); i++) {
+        auto write_state = std::move(states[i]);
+        columnWriters[i]->finalizeWrite(*write_state);
+    }
+
+    // Append the row group to the file meta data.
+    fileMetaData.row_groups.push_back(parquetRowGroup);
+    fileMetaData.num_rows += parquetRowGroup.num_rows;
+}
+
+void ParquetWriter::readFromFT(FactorizedTable& ft, std::vector<ValueVector*> vectorsToRead,
+    uint64_t& numTuplesRead) {
+    auto numTuplesToRead =
+        ft.getTableSchema()->getNumUnFlatColumns() != 0 ?
+            1 :
+            std::min<uint64_t>(ft.getNumTuples() - numTuplesRead, DEFAULT_VECTOR_CAPACITY);
+    ft.scan(vectorsToRead, numTuplesRead, numTuplesToRead);
+    numTuplesRead += numTuplesToRead;
+}
+
+void ParquetWriter::finalize() {
+    auto startOffset = fileOffset;
+    fileMetaData.write(protocol.get());
+    uint32_t metadataSize = fileOffset - startOffset;
+    fileInfo->writeFile(reinterpret_cast<const uint8_t*>(&metadataSize), sizeof(metadataSize),
+        fileOffset);
+    fileOffset += sizeof(uint32_t);
+
+    // Parquet files also end with the string "PAR1".
+    fileInfo->writeFile(reinterpret_cast<const uint8_t*>(ParquetConstants::PARQUET_MAGIC_WORDS),
+        strlen(ParquetConstants::PARQUET_MAGIC_WORDS), fileOffset);
+    fileOffset += strlen(ParquetConstants::PARQUET_MAGIC_WORDS);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/string_column_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/string_column_writer.cpp
new file mode 100644
index 0000000000..d9ac727b2b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/string_column_writer.cpp
@@ -0,0 +1,210 @@
+#include "processor/operator/persistent/writer/parquet/string_column_writer.h"
+
+#include "common/constants.h"
+#include "function/comparison/comparison_functions.h"
+#include "function/hash/hash_functions.h"
+#include "processor/operator/persistent/reader/parquet/parquet_rle_bp_decoder.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug::common;
+using namespace lbug_parquet::format;
+
+std::size_t StringHash::operator()(const ku_string_t& k) const {
+    hash_t result = 0;
+    function::Hash::operation(k, result);
+    return result;
+}
+
+bool StringEquality::operator()(const ku_string_t& a, const ku_string_t& b) const {
+    uint8_t result = 0;
+    function::Equals::operation(a, b, result, nullptr /* leftVector */, nullptr /* rightVector */);
+    return result;
+}
+
+void StringStatisticsState::update(const ku_string_t& val) {
+    if (valuesTooBig) {
+        return;
+    }
+    if (val.len > ParquetConstants::MAX_STRING_STATISTICS_SIZE) {
+        // we avoid gathering stats when individual string values are too large
+        // this is because the statistics are copied into the Parquet file meta data in
+        // uncompressed format ideally we avoid placing several mega or giga-byte long strings
+        // there we put a threshold of 10KB, if we see strings that exceed this threshold we
+        // avoid gathering stats
+        valuesTooBig = true;
+        min = std::string();
+        max = std::string();
+        return;
+    }
+    if (!hasStats || val.getAsString() < min) {
+        min = val.getAsString();
+    }
+    if (!hasStats || val.getAsString() > max) {
+        max = val.getAsString();
+    }
+    hasStats = true;
+}
+
+std::unique_ptr<ColumnWriterState> StringColumnWriter::initializeWriteState(RowGroup& rowGroup) {
+    auto result = std::make_unique<StringColumnWriterState>(rowGroup, rowGroup.columns.size(), mm);
+    registerToRowGroup(rowGroup);
+    return result;
+}
+
+void StringColumnWriter::analyze(ColumnWriterState& writerState, ColumnWriterState* parent,
+    ValueVector* vector, uint64_t count) {
+    auto& state = reinterpret_cast<StringColumnWriterState&>(writerState);
+    uint64_t vcount =
+        parent ? parent->definitionLevels.size() - state.definitionLevels.size() : count;
+    uint64_t parentIdx = state.definitionLevels.size();
+    uint64_t vectorIdx = 0;
+    uint32_t newValueIdx = state.dictionary.size();
+    uint32_t lastValueIdx = -1;
+    uint64_t runLen = 0;
+    uint64_t runCount = 0;
+    for (auto i = 0u; i < vcount; i++) {
+        if (parent && !parent->isEmpty.empty() && parent->isEmpty[parentIdx + i]) {
+            continue;
+        }
+        auto pos = getVectorPos(vector, vectorIdx);
+        if (!vector->isNull(pos)) {
+            runLen++;
+            const auto& value = vector->getValue<ku_string_t>(pos);
+            // Try to insert into the dictionary. If it's already there, we get back the value
+            // index.
+            ku_string_t valueToInsert;
+            StringVector::copyToRowData(vector, pos, reinterpret_cast<uint8_t*>(&valueToInsert),
+                state.overflowBuffer.get());
+            auto found = state.dictionary.insert(
+                string_map_t<uint32_t>::value_type(valueToInsert, newValueIdx));
+            state.estimatedPlainSize += value.len + ParquetConstants::STRING_LENGTH_SIZE;
+            if (found.second) {
+                // String didn't exist yet in the dictionary.
+                newValueIdx++;
+                state.estimatedDictPageSize +=
+                    value.len + ParquetConstants::MAX_DICTIONARY_KEY_SIZE;
+            }
+            // If the value changed, we will encode it in the page.
+            if (lastValueIdx != found.first->second) {
+                // we will add the value index size later, when we know the total number of keys
+                state.estimatedRlePagesSize += RleBpEncoder::getVarintSize(runLen);
+                runLen = 0;
+                runCount++;
+                lastValueIdx = found.first->second;
+            }
+        }
+        vectorIdx++;
+    }
+    // Add the costs of keys sizes. We don't know yet how many bytes the keys need as we haven't
+    // seen all the values. therefore we use an over-estimation of
+    state.estimatedRlePagesSize += ParquetConstants::MAX_DICTIONARY_KEY_SIZE * runCount;
+}
+
+void StringColumnWriter::finalizeAnalyze(ColumnWriterState& writerState) {
+    auto& state = reinterpret_cast<StringColumnWriterState&>(writerState);
+
+    // Check if a dictionary will require more space than a plain write, or if the dictionary
+    // page is going to be too large.
+    if (state.estimatedDictPageSize > ParquetConstants::MAX_UNCOMPRESSED_DICT_PAGE_SIZE ||
+        state.estimatedRlePagesSize + state.estimatedDictPageSize > state.estimatedPlainSize) {
+        // Clearing the dictionary signals a plain write.
+        state.dictionary.clear();
+        state.keyBitWidth = 0;
+    } else {
+        state.keyBitWidth = RleBpDecoder::ComputeBitWidth(state.dictionary.size());
+    }
+}
+
+void StringColumnWriter::writeVector(common::Serializer& serializer,
+    ColumnWriterStatistics* statsToWrite, ColumnWriterPageState* writerPageState,
+    ValueVector* vector, uint64_t chunkStart, uint64_t chunkEnd) {
+    auto pageState = reinterpret_cast<StringWriterPageState*>(writerPageState);
+    auto stats = reinterpret_cast<StringStatisticsState*>(statsToWrite);
+
+    if (pageState->isDictionaryEncoded()) {
+        // Dictionary based page.
+        for (auto r = chunkStart; r < chunkEnd; r++) {
+            auto pos = getVectorPos(vector, r);
+            if (vector->isNull(pos)) {
+                continue;
+            }
+            auto value_index = pageState->dictionary.at(vector->getValue<ku_string_t>(pos));
+            if (!pageState->writtenValue) {
+                // Write the bit-width as a one-byte entry.
+                serializer.write<uint8_t>(pageState->bitWidth);
+                // Now begin writing the actual value.
+                pageState->encoder.beginWrite(value_index);
+                pageState->writtenValue = true;
+            } else {
+                pageState->encoder.writeValue(serializer, value_index);
+            }
+        }
+    } else {
+        for (auto r = chunkStart; r < chunkEnd; r++) {
+            auto pos = getVectorPos(vector, r);
+            if (vector->isNull(pos)) {
+                continue;
+            }
+            auto& str = vector->getValue<ku_string_t>(pos);
+            stats->update(str);
+            serializer.write<uint32_t>(str.len);
+            serializer.write(str.getData(), str.len);
+        }
+    }
+}
+
+void StringColumnWriter::flushPageState(common::Serializer& serializer,
+    ColumnWriterPageState* writerPageState) {
+    auto pageState = reinterpret_cast<StringWriterPageState*>(writerPageState);
+    if (pageState->bitWidth != 0) {
+        if (!pageState->writtenValue) {
+            // all values are null
+            // just write the bit width
+            serializer.write<uint8_t>(pageState->bitWidth);
+            return;
+        }
+        pageState->encoder.finishWrite(serializer);
+    }
+}
+
+void StringColumnWriter::flushDictionary(BasicColumnWriterState& writerState,
+    ColumnWriterStatistics* writerStats) {
+    auto stats = reinterpret_cast<StringStatisticsState*>(writerStats);
+    auto& state = reinterpret_cast<StringColumnWriterState&>(writerState);
+    if (!state.isDictionaryEncoded()) {
+        return;
+    }
+    // First we need to sort the values in index order.
+    auto values = std::vector<ku_string_t>(state.dictionary.size());
+    for (const auto& entry : state.dictionary) {
+        KU_ASSERT(values[entry.second].len == 0);
+        values[entry.second] = entry.first;
+    }
+    // First write the contents of the dictionary page to a temporary buffer.
+    auto bufferedSerializer = std::make_unique<common::BufferWriter>();
+    for (auto r = 0u; r < values.size(); r++) {
+        auto& value = values[r];
+        // Update the statistics.
+        stats->update(value);
+        // Write this string value to the dictionary.
+        bufferedSerializer->write<uint32_t>(value.len);
+        bufferedSerializer->write(value.getData(), value.len);
+    }
+    // Flush the dictionary page and add it to the to-be-written pages.
+    writeDictionary(state, std::move(bufferedSerializer), values.size());
+}
+
+uint64_t StringColumnWriter::getRowSize(ValueVector* vector, uint64_t index,
+    BasicColumnWriterState& writerState) {
+    auto& state = reinterpret_cast<StringColumnWriterState&>(writerState);
+    if (state.isDictionaryEncoded()) {
+        return (state.keyBitWidth + 7) / 8;
+    } else {
+        return vector->getValue<ku_string_t>(getVectorPos(vector, index)).len;
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/struct_column_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/struct_column_writer.cpp
new file mode 100644
index 0000000000..317233278a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/struct_column_writer.cpp
@@ -0,0 +1,100 @@
+#include "processor/operator/persistent/writer/parquet/struct_column_writer.h"
+
+#include "common/constants.h"
+#include "common/vector/value_vector.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug_parquet::format;
+using namespace lbug::common;
+
+std::unique_ptr<ColumnWriterState> StructColumnWriter::initializeWriteState(
+    lbug_parquet::format::RowGroup& rowGroup) {
+    auto result = std::make_unique<StructColumnWriterState>(rowGroup, rowGroup.columns.size());
+
+    result->childStates.reserve(childWriters.size());
+    for (auto& child_writer : childWriters) {
+        result->childStates.push_back(child_writer->initializeWriteState(rowGroup));
+    }
+    return result;
+}
+
+bool StructColumnWriter::hasAnalyze() {
+    for (auto& child_writer : childWriters) {
+        if (child_writer->hasAnalyze()) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void StructColumnWriter::analyze(ColumnWriterState& state_p, ColumnWriterState* /*parent*/,
+    ValueVector* vector, uint64_t count) {
+    auto& state = reinterpret_cast<StructColumnWriterState&>(state_p);
+    auto& childVectors = StructVector::getFieldVectors(vector);
+    for (auto child_idx = 0u; child_idx < childWriters.size(); child_idx++) {
+        // Need to check again. It might be that just one child needs it but the rest not
+        if (childWriters[child_idx]->hasAnalyze()) {
+            childWriters[child_idx]->analyze(*state.childStates[child_idx], &state_p,
+                childVectors[child_idx].get(), count);
+        }
+    }
+}
+
+void StructColumnWriter::finalizeAnalyze(ColumnWriterState& state_p) {
+    auto& state = reinterpret_cast<StructColumnWriterState&>(state_p);
+    for (auto child_idx = 0u; child_idx < childWriters.size(); child_idx++) {
+        // Need to check again. It might be that just one child needs it but the rest not
+        if (childWriters[child_idx]->hasAnalyze()) {
+            childWriters[child_idx]->finalizeAnalyze(*state.childStates[child_idx]);
+        }
+    }
+}
+
+void StructColumnWriter::prepare(ColumnWriterState& state_p, ColumnWriterState* parent,
+    ValueVector* vector, uint64_t count) {
+    auto& state = reinterpret_cast<StructColumnWriterState&>(state_p);
+    if (parent) {
+        // propagate empty entries from the parent
+        while (state.isEmpty.size() < parent->isEmpty.size()) {
+            state.isEmpty.push_back(parent->isEmpty[state.isEmpty.size()]);
+        }
+    }
+    handleRepeatLevels(state_p, parent);
+    handleDefineLevels(state_p, parent, vector, count, ParquetConstants::PARQUET_DEFINE_VALID,
+        maxDefine - 1);
+    auto& child_vectors = StructVector::getFieldVectors(vector);
+    for (auto child_idx = 0u; child_idx < childWriters.size(); child_idx++) {
+        childWriters[child_idx]->prepare(*state.childStates[child_idx], &state_p,
+            child_vectors[child_idx].get(), count);
+    }
+}
+
+void StructColumnWriter::beginWrite(ColumnWriterState& state_p) {
+    auto& state = reinterpret_cast<StructColumnWriterState&>(state_p);
+    for (auto child_idx = 0u; child_idx < childWriters.size(); child_idx++) {
+        childWriters[child_idx]->beginWrite(*state.childStates[child_idx]);
+    }
+}
+
+void StructColumnWriter::write(ColumnWriterState& state_p, ValueVector* vector, uint64_t count) {
+    auto& state = reinterpret_cast<StructColumnWriterState&>(state_p);
+    auto& child_vectors = StructVector::getFieldVectors(vector);
+    for (auto child_idx = 0u; child_idx < childWriters.size(); child_idx++) {
+        childWriters[child_idx]->write(*state.childStates[child_idx],
+            child_vectors[child_idx].get(), count);
+    }
+}
+
+void StructColumnWriter::finalizeWrite(ColumnWriterState& state_p) {
+    auto& state = reinterpret_cast<StructColumnWriterState&>(state_p);
+    for (auto child_idx = 0u; child_idx < childWriters.size(); child_idx++) {
+        // we add the null count of the struct to the null count of the children
+        childWriters[child_idx]->nullCount += nullCount;
+        childWriters[child_idx]->finalizeWrite(*state.childStates[child_idx]);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/uuid_column_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/uuid_column_writer.cpp
new file mode 100644
index 0000000000..1287676751
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/persistent/writer/parquet/uuid_column_writer.cpp
@@ -0,0 +1,38 @@
+#include "processor/operator/persistent/writer/parquet/uuid_column_writer.h"
+
+#include "common/constants.h"
+#include "common/serializer/serializer.h"
+#include "common/types/uuid.h"
+
+namespace lbug {
+namespace processor {
+
+static void writeParquetUUID(common::ku_uuid_t input, uint8_t* result) {
+    uint64_t high_bytes = input.value.high ^ (int64_t(1) << 63);
+    uint64_t low_bytes = input.value.low;
+
+    for (auto i = 0u; i < sizeof(uint64_t); i++) {
+        auto shift_count = (sizeof(uint64_t) - i - 1) * 8;
+        result[i] = (high_bytes >> shift_count) & 0xFF;
+    }
+    for (auto i = 0u; i < sizeof(uint64_t); i++) {
+        auto shift_count = (sizeof(uint64_t) - i - 1) * 8;
+        result[sizeof(uint64_t) + i] = (low_bytes >> shift_count) & 0xFF;
+    }
+}
+
+void UUIDColumnWriter::writeVector(common::Serializer& bufferedSerializer,
+    ColumnWriterStatistics* /*state*/, ColumnWriterPageState* /*pageState*/,
+    common::ValueVector* vector, uint64_t chunkStart, uint64_t chunkEnd) {
+    uint8_t buffer[common::ParquetConstants::PARQUET_UUID_SIZE];
+    for (auto i = chunkStart; i < chunkEnd; i++) {
+        auto pos = getVectorPos(vector, i);
+        if (!vector->isNull(pos)) {
+            writeParquetUUID(vector->getValue<common::ku_uuid_t>(pos), buffer);
+            bufferedSerializer.write(buffer, common::ParquetConstants::PARQUET_UUID_SIZE);
+        }
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/physical_operator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/physical_operator.cpp
new file mode 100644
index 0000000000..b4c165ff79
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/physical_operator.cpp
@@ -0,0 +1,256 @@
+#include "processor/operator/physical_operator.h"
+
+#include "common/exception/interrupt.h"
+#include "common/exception/runtime.h"
+#include "common/task_system/progress_bar.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+// LCOV_EXCL_START
+std::string PhysicalOperatorUtils::operatorTypeToString(PhysicalOperatorType operatorType) {
+    switch (operatorType) {
+    case PhysicalOperatorType::ALTER:
+        return "ALTER";
+    case PhysicalOperatorType::AGGREGATE:
+        return "AGGREGATE";
+    case PhysicalOperatorType::AGGREGATE_FINALIZE:
+        return "AGGREGATE_FINALIZE";
+    case PhysicalOperatorType::AGGREGATE_SCAN:
+        return "AGGREGATE_SCAN";
+    case PhysicalOperatorType::ATTACH_DATABASE:
+        return "ATTACH_DATABASE";
+    case PhysicalOperatorType::BATCH_INSERT:
+        return "BATCH_INSERT";
+    case PhysicalOperatorType::COPY_TO:
+        return "COPY_TO";
+    case PhysicalOperatorType::CREATE_MACRO:
+        return "CREATE_MACRO";
+    case PhysicalOperatorType::CREATE_SEQUENCE:
+        return "CREATE_SEQUENCE";
+    case PhysicalOperatorType::CREATE_TABLE:
+        return "CREATE_TABLE";
+    case PhysicalOperatorType::CREATE_TYPE:
+        return "CREATE_TYPE";
+    case PhysicalOperatorType::CROSS_PRODUCT:
+        return "CROSS_PRODUCT";
+    case PhysicalOperatorType::DETACH_DATABASE:
+        return "DETACH_DATABASE";
+    case PhysicalOperatorType::DELETE_:
+        return "DELETE";
+    case PhysicalOperatorType::DROP:
+        return "DROP";
+    case PhysicalOperatorType::DUMMY_SINK:
+        return "DUMMY_SINK";
+    case PhysicalOperatorType::DUMMY_SIMPLE_SINK:
+        return "DUMMY_SIMPLE_SINK";
+    case PhysicalOperatorType::EMPTY_RESULT:
+        return "EMPTY_RESULT";
+    case PhysicalOperatorType::EXPORT_DATABASE:
+        return "EXPORT_DATABASE";
+    case PhysicalOperatorType::FILTER:
+        return "FILTER";
+    case PhysicalOperatorType::FLATTEN:
+        return "FLATTEN";
+    case PhysicalOperatorType::HASH_JOIN_BUILD:
+        return "HASH_JOIN_BUILD";
+    case PhysicalOperatorType::HASH_JOIN_PROBE:
+        return "HASH_JOIN_PROBE";
+    case PhysicalOperatorType::IMPORT_DATABASE:
+        return "IMPORT_DATABASE";
+    case PhysicalOperatorType::INDEX_LOOKUP:
+        return "INDEX_LOOKUP";
+    case PhysicalOperatorType::INSERT:
+        return "INSERT";
+    case PhysicalOperatorType::INTERSECT_BUILD:
+        return "INTERSECT_BUILD";
+    case PhysicalOperatorType::INTERSECT:
+        return "INTERSECT";
+    case PhysicalOperatorType::INSTALL_EXTENSION:
+        return "INSTALL_EXTENSION";
+    case PhysicalOperatorType::LIMIT:
+        return "LIMIT";
+    case PhysicalOperatorType::LOAD_EXTENSION:
+        return "LOAD_EXTENSION";
+    case PhysicalOperatorType::MERGE:
+        return "MERGE";
+    case PhysicalOperatorType::MULTIPLICITY_REDUCER:
+        return "MULTIPLICITY_REDUCER";
+    case PhysicalOperatorType::PARTITIONER:
+        return "PARTITIONER";
+    case PhysicalOperatorType::PATH_PROPERTY_PROBE:
+        return "PATH_PROPERTY_PROBE";
+    case PhysicalOperatorType::PRIMARY_KEY_SCAN_NODE_TABLE:
+        return "PRIMARY_KEY_SCAN_NODE_TABLE";
+    case PhysicalOperatorType::PROJECTION:
+        return "PROJECTION";
+    case PhysicalOperatorType::PROFILE:
+        return "PROFILE";
+    case PhysicalOperatorType::RECURSIVE_EXTEND:
+        return "RECURSIVE_EXTEND";
+    case PhysicalOperatorType::RESULT_COLLECTOR:
+        return "RESULT_COLLECTOR";
+    case PhysicalOperatorType::SCAN_NODE_TABLE:
+        return "SCAN_NODE_TABLE";
+    case PhysicalOperatorType::SCAN_REL_TABLE:
+        return "SCAN_REL_TABLE";
+    case PhysicalOperatorType::SEMI_MASKER:
+        return "SEMI_MASKER";
+    case PhysicalOperatorType::SET_PROPERTY:
+        return "SET_PROPERTY";
+    case PhysicalOperatorType::SKIP:
+        return "SKIP";
+    case PhysicalOperatorType::STANDALONE_CALL:
+        return "STANDALONE_CALL";
+    case PhysicalOperatorType::TABLE_FUNCTION_CALL:
+        return "TABLE_FUNCTION_CALL";
+    case PhysicalOperatorType::TOP_K:
+        return "TOP_K";
+    case PhysicalOperatorType::TOP_K_SCAN:
+        return "TOP_K_SCAN";
+    case PhysicalOperatorType::TRANSACTION:
+        return "TRANSACTION";
+    case PhysicalOperatorType::ORDER_BY:
+        return "ORDER_BY";
+    case PhysicalOperatorType::ORDER_BY_MERGE:
+        return "ORDER_BY_MERGE";
+    case PhysicalOperatorType::ORDER_BY_SCAN:
+        return "ORDER_BY_SCAN";
+    case PhysicalOperatorType::UNION_ALL_SCAN:
+        return "UNION_ALL_SCAN";
+    case PhysicalOperatorType::UNWIND:
+        return "UNWIND";
+    case PhysicalOperatorType::USE_DATABASE:
+        return "USE_DATABASE";
+    case PhysicalOperatorType::UNINSTALL_EXTENSION:
+        return "UNINSTALL_EXTENSION";
+    default:
+        throw RuntimeException("Unknown physical operator type.");
+    }
+}
+
+std::string PhysicalOperatorUtils::operatorToString(const PhysicalOperator* physicalOp) {
+    return operatorTypeToString(physicalOp->getOperatorType()) + "[" +
+           std::to_string(physicalOp->getOperatorID()) + "]";
+}
+// LCOV_EXCL_STOP
+
+PhysicalOperator::PhysicalOperator(PhysicalOperatorType operatorType,
+    std::unique_ptr<PhysicalOperator> child, uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+    : PhysicalOperator{operatorType, id, std::move(printInfo)} {
+    children.push_back(std::move(child));
+}
+
+PhysicalOperator::PhysicalOperator(PhysicalOperatorType operatorType,
+    std::unique_ptr<PhysicalOperator> left, std::unique_ptr<PhysicalOperator> right, uint32_t id,
+    std::unique_ptr<OPPrintInfo> printInfo)
+    : PhysicalOperator{operatorType, id, std::move(printInfo)} {
+    children.push_back(std::move(left));
+    children.push_back(std::move(right));
+}
+
+PhysicalOperator::PhysicalOperator(PhysicalOperatorType operatorType, physical_op_vector_t children,
+    uint32_t id, std::unique_ptr<OPPrintInfo> printInfo)
+    : PhysicalOperator{operatorType, id, std::move(printInfo)} {
+    for (auto& child : children) {
+        this->children.push_back(std::move(child));
+    }
+}
+
+std::unique_ptr<PhysicalOperator> PhysicalOperator::moveUnaryChild() {
+    KU_ASSERT(children.size() == 1);
+    auto result = std::move(children[0]);
+    children.clear();
+    return result;
+}
+
+void PhysicalOperator::initGlobalState(ExecutionContext* context) {
+    if (!isSource()) {
+        children[0]->initGlobalState(context);
+    }
+    initGlobalStateInternal(context);
+}
+
+void PhysicalOperator::initLocalState(ResultSet* resultSet_, ExecutionContext* context) {
+    if (!isSource()) {
+        children[0]->initLocalState(resultSet_, context);
+    }
+    resultSet = resultSet_;
+    registerProfilingMetrics(context->profiler);
+    initLocalStateInternal(resultSet_, context);
+}
+
+bool PhysicalOperator::getNextTuple(ExecutionContext* context) {
+    if (context->clientContext->interrupted()) {
+        throw InterruptException{};
+    }
+#ifdef __SINGLE_THREADED__
+    // In single-threaded mode, the timeout cannot be checked in the main thread
+    // because the main thread is blocked by the task execution. Instead, we
+    // check the timeout in the processor. The timeout handling may still be
+    // delayed, but it is better than checking it at the end of each task.
+    // This is the best we can do now because SIGALRM is not cross-platform.
+    if (context->clientContext->hasTimeout()) {
+        if (context->clientContext->getTimeoutRemainingInMS() == 0) {
+            throw InterruptException{};
+        }
+    }
+#endif
+    metrics->executionTime.start();
+    auto result = getNextTuplesInternal(context);
+    ProgressBar::Get(*context->clientContext)
+        ->updateProgress(context->queryID, getProgress(context));
+    metrics->executionTime.stop();
+    return result;
+}
+
+void PhysicalOperator::finalize(ExecutionContext* context) {
+    if (!isSource()) {
+        children[0]->finalize(context);
+    }
+    finalizeInternal(context);
+}
+
+void PhysicalOperator::registerProfilingMetrics(Profiler* profiler) {
+    auto executionTime = profiler->registerTimeMetric(getTimeMetricKey());
+    auto numOutputTuple = profiler->registerNumericMetric(getNumTupleMetricKey());
+    metrics = std::make_unique<OperatorMetrics>(*executionTime, *numOutputTuple);
+}
+
+double PhysicalOperator::getExecutionTime(Profiler& profiler) const {
+    auto executionTime = profiler.sumAllTimeMetricsWithKey(getTimeMetricKey());
+    if (!isSource()) {
+        executionTime -= profiler.sumAllTimeMetricsWithKey(children[0]->getTimeMetricKey());
+    }
+    return executionTime;
+}
+
+uint64_t PhysicalOperator::getNumOutputTuples(Profiler& profiler) const {
+    return profiler.sumAllNumericMetricsWithKey(getNumTupleMetricKey());
+}
+
+std::unordered_map<std::string, std::string> PhysicalOperator::getProfilerKeyValAttributes(
+    Profiler& profiler) const {
+    std::unordered_map<std::string, std::string> result;
+    result.insert({"ExecutionTime", std::to_string(getExecutionTime(profiler))});
+    result.insert({"NumOutputTuples", std::to_string(getNumOutputTuples(profiler))});
+    return result;
+}
+
+std::vector<std::string> PhysicalOperator::getProfilerAttributes(Profiler& profiler) const {
+    std::vector<std::string> result;
+    for (auto& [key, val] : getProfilerKeyValAttributes(profiler)) {
+        result.emplace_back(key + ": " + std::move(val));
+    }
+    return result;
+}
+
+double PhysicalOperator::getProgress(ExecutionContext* /*context*/) const {
+    return 0;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/profile.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/profile.cpp
new file mode 100644
index 0000000000..140477929d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/profile.cpp
@@ -0,0 +1,19 @@
+#include "processor/operator/profile.h"
+
+#include "main/plan_printer.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+void Profile::executeInternal(ExecutionContext* context) {
+    const auto planInString =
+        main::PlanPrinter::printPlanToOstream(info.physicalPlan, context->profiler).str();
+    appendMessage(planInString, storage::MemoryManager::Get(*context->clientContext));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/projection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/projection.cpp
new file mode 100644
index 0000000000..d9e24c1f56
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/projection.cpp
@@ -0,0 +1,53 @@
+#include "processor/operator/projection.h"
+
+#include "binder/expression/expression_util.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::evaluator;
+
+namespace lbug {
+namespace processor {
+
+std::string ProjectionPrintInfo::toString() const {
+    std::string result = "Expressions: ";
+    result += binder::ExpressionUtil::toString(expressions);
+    return result;
+}
+
+void Projection::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    for (auto i = 0u; i < info.evaluators.size(); ++i) {
+        auto& expressionEvaluator = *info.evaluators[i];
+        expressionEvaluator.init(*resultSet, context->clientContext);
+        auto [dataChunkPos, vectorPos] = info.exprsOutputPos[i];
+        auto dataChunk = resultSet->dataChunks[dataChunkPos];
+        dataChunk->valueVectors[vectorPos] = expressionEvaluator.resultVector;
+    }
+}
+
+bool Projection::getNextTuplesInternal(ExecutionContext* context) {
+    restoreMultiplicity();
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    saveMultiplicity();
+    for (auto& evaluator : info.evaluators) {
+        evaluator->evaluate();
+    }
+    if (!info.discardedChunkIndices.empty()) {
+        resultSet->multiplicity *=
+            resultSet->getNumTuplesWithoutMultiplicity(info.discardedChunkIndices);
+    }
+    // The if statement is added to avoid the cost of calculating numTuples when metric is disabled.
+    if (metrics->numOutputTuple.enabled) [[unlikely]] {
+        if (info.activeChunkIndices.empty()) {
+            // In COUNT(*) case we are projecting away everything and only track multiplicity
+            metrics->numOutputTuple.increase(resultSet->multiplicity);
+        } else {
+            metrics->numOutputTuple.increase(resultSet->getNumTuples(info.activeChunkIndices));
+        }
+    }
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/recursive_extend.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/recursive_extend.cpp
new file mode 100644
index 0000000000..d7863d71e9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/recursive_extend.cpp
@@ -0,0 +1,160 @@
+#include "processor/operator/recursive_extend.h"
+
+#include "binder/expression/node_expression.h"
+#include "binder/expression/property_expression.h"
+#include "common/task_system/progress_bar.h"
+#include "function/gds/compute.h"
+#include "function/gds/gds_function_collection.h"
+#include "function/gds/gds_utils.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+// All recursive join computation have the same vertex compute. This vertex compute writes
+// result (could be dst, length or path) from a dst node ID to given source node ID.
+class RJVertexCompute : public VertexCompute {
+public:
+    RJVertexCompute(storage::MemoryManager* mm, RecursiveExtendSharedState* sharedState,
+        std::unique_ptr<RJOutputWriter> writer, table_id_set_t nbrTableIDSet)
+        : mm{mm}, sharedState{sharedState}, writer{std::move(writer)},
+          nbrTableIDSet{std::move(nbrTableIDSet)} {
+        localFT = sharedState->factorizedTablePool.claimLocalTable(mm);
+    }
+    ~RJVertexCompute() override { sharedState->factorizedTablePool.returnLocalTable(localFT); }
+
+    bool beginOnTable(table_id_t tableID) override {
+        // Nbr node table IDs might be different from graph node table IDs
+        // See comment below in RecursiveExtend::executeInternal.
+        if (!nbrTableIDSet.contains(tableID)) {
+            return false;
+        }
+        writer->beginWriting(tableID);
+        return true;
+    }
+
+    void vertexCompute(offset_t startOffset, offset_t endOffset, table_id_t tableID) override {
+        for (auto i = startOffset; i < endOffset; ++i) {
+            if (sharedState->exceedLimit()) {
+                return;
+            }
+            auto nodeID = nodeID_t{i, tableID};
+            writer->write(*localFT, nodeID, sharedState->counter.get());
+        }
+    }
+
+    void vertexCompute(table_id_t tableID) override {
+        writer->write(*localFT, tableID, sharedState->counter.get());
+    }
+
+    std::unique_ptr<VertexCompute> copy() override {
+        return std::make_unique<RJVertexCompute>(mm, sharedState, writer->copy(), nbrTableIDSet);
+    }
+
+private:
+    storage::MemoryManager* mm;
+    // Shared state storing ftables to materialize output.
+    RecursiveExtendSharedState* sharedState;
+    FactorizedTable* localFT;
+    std::unique_ptr<RJOutputWriter> writer;
+    table_id_set_t nbrTableIDSet;
+};
+
+static double getRJProgress(offset_t totalNumNodes, offset_t completedNumNodes) {
+    if (totalNumNodes == 0) {
+        return 0;
+    }
+    return (double)completedNumNodes / totalNumNodes;
+}
+
+static bool requireRelID(const RJAlgorithm& function) {
+    if (function.getFunctionName() == WeightedSPPathsFunction::name ||
+        function.getFunctionName() == SingleSPPathsFunction::name ||
+        function.getFunctionName() == AllSPPathsFunction::name ||
+        function.getFunctionName() == AllWeightedSPPathsFunction::name ||
+        function.getFunctionName() == VarLenJoinsFunction::name) {
+        return true;
+    }
+    return false;
+}
+
+void RecursiveExtend::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    auto transaction = transaction::Transaction::Get(*clientContext);
+    auto progressBar = ProgressBar::Get(*clientContext);
+    auto graph = sharedState->graph.get();
+    auto inputNodeMaskMap = sharedState->getInputNodeMaskMap();
+    offset_t totalNumNodes = 0;
+    if (inputNodeMaskMap != nullptr) {
+        totalNumNodes = inputNodeMaskMap->getNumMaskedNode();
+    } else {
+        for (auto& tableID : graph->getNodeTableIDs()) {
+            totalNumNodes += graph->getMaxOffset(transaction, tableID);
+        }
+    }
+    std::vector<std::string> propertyNames;
+    if (requireRelID(*function)) {
+        propertyNames.push_back(InternalKeyword::ID);
+    }
+    if (bindData.weightPropertyExpr != nullptr) {
+        propertyNames.push_back(
+            bindData.weightPropertyExpr->ptrCast<PropertyExpression>()->getPropertyName());
+    }
+    offset_t completedNumNodes = 0;
+    auto inputNodeTableIDSet = bindData.nodeInput->constCast<NodeExpression>().getTableIDsSet();
+    for (auto& tableID : graph->getNodeTableIDs()) {
+        // Input node table IDs could be different from graph node table IDs, e.g.
+        // Given schema, student-knows->student, teacher-knows->teacher
+        // MATCH (a:student)-[e*knows]->(b:student)
+        // the graph node table IDs will include both student and teacher.
+        if (!inputNodeTableIDSet.contains(tableID)) {
+            continue;
+        }
+        auto calcFunc = [tableID, propertyNames, graph, context, this](offset_t offset) {
+            auto clientContext = context->clientContext;
+            auto computeState = function->getComputeState(context, bindData, sharedState.get());
+            auto sourceNodeID = nodeID_t{offset, tableID};
+            computeState->initSource(sourceNodeID);
+            GDSUtils::runRecursiveJoinEdgeCompute(context, *computeState, graph,
+                bindData.extendDirection, bindData.upperBound, sharedState->getOutputNodeMaskMap(),
+                propertyNames);
+            auto writer = function->getOutputWriter(context, bindData, *computeState, sourceNodeID,
+                sharedState.get());
+            auto vertexCompute = std::make_unique<RJVertexCompute>(
+                storage::MemoryManager::Get(*clientContext), sharedState.get(), writer->copy(),
+                bindData.nodeOutput->constCast<NodeExpression>().getTableIDsSet());
+            GDSUtils::runVertexCompute(context, computeState->frontierPair->getState(), graph,
+                *vertexCompute);
+        };
+        auto maxOffset = graph->getMaxOffset(transaction, tableID);
+        if (inputNodeMaskMap && inputNodeMaskMap->getOffsetMask(tableID)->isEnabled()) {
+            for (const auto& offset :
+                inputNodeMaskMap->getOffsetMask(tableID)->range(0, maxOffset)) {
+                calcFunc(offset);
+                progressBar->updateProgress(context->queryID,
+                    getRJProgress(totalNumNodes, completedNumNodes++));
+                if (sharedState->exceedLimit()) {
+                    break;
+                }
+            }
+        } else {
+            for (auto offset = 0u; offset < maxOffset; ++offset) {
+                calcFunc(offset);
+                progressBar->updateProgress(context->queryID,
+                    getRJProgress(totalNumNodes, completedNumNodes++));
+                if (sharedState->exceedLimit()) {
+                    break;
+                }
+            }
+        }
+    }
+    sharedState->factorizedTablePool.mergeLocalTables();
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/result_collector.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/result_collector.cpp
new file mode 100644
index 0000000000..071ab981d6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/result_collector.cpp
@@ -0,0 +1,94 @@
+#include "processor/operator/result_collector.h"
+
+#include "binder/expression/expression_util.h"
+#include "main/query_result/materialized_query_result.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::string ResultCollectorPrintInfo::toString() const {
+    std::string result = "";
+    if (accumulateType == AccumulateType::OPTIONAL_) {
+        result += "Type: " + AccumulateTypeUtil::toString(accumulateType);
+    }
+    result += ",Expressions: ";
+    result += binder::ExpressionUtil::toString(expressions);
+    return result;
+}
+
+void ResultCollector::initNecessaryLocalState(ResultSet* resultSet, ExecutionContext* context) {
+    payloadVectors.reserve(info.payloadPositions.size());
+    for (auto& pos : info.payloadPositions) {
+        auto vec = resultSet->getValueVector(pos).get();
+        payloadVectors.push_back(vec);
+        payloadAndMarkVectors.push_back(vec);
+    }
+    if (info.accumulateType == AccumulateType::OPTIONAL_) {
+        markVector = std::make_unique<ValueVector>(LogicalType::BOOL(),
+            MemoryManager::Get(*context->clientContext));
+        markVector->state = DataChunkState::getSingleValueDataChunkState();
+        markVector->setValue<bool>(0, true);
+        payloadAndMarkVectors.push_back(markVector.get());
+    }
+}
+
+void ResultCollector::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    initNecessaryLocalState(resultSet, context);
+    localTable = std::make_unique<FactorizedTable>(MemoryManager::Get(*context->clientContext),
+        info.tableSchema.copy());
+}
+
+void ResultCollector::executeInternal(ExecutionContext* context) {
+    while (children[0]->getNextTuple(context)) {
+        if (!payloadVectors.empty()) {
+            for (auto i = 0u; i < resultSet->multiplicity; i++) {
+                localTable->append(payloadAndMarkVectors);
+            }
+        }
+    }
+    if (!payloadVectors.empty()) {
+        metrics->numOutputTuple.increase(localTable->getTotalNumFlatTuples());
+        sharedState->mergeLocalTable(*localTable);
+    }
+}
+
+void ResultCollector::finalizeInternal(ExecutionContext* context) {
+    switch (info.accumulateType) {
+    case AccumulateType::OPTIONAL_: {
+        auto localResultSet = getResultSet(MemoryManager::Get(*context->clientContext));
+        initNecessaryLocalState(localResultSet.get(), context);
+        // We should remove currIdx completely as some of the code still relies on currIdx = -1 to
+        // check if the state if unFlat or not. This should no longer be necessary.
+        // TODO(Ziyi): add an interface in factorized table
+        auto table = sharedState->getTable();
+        auto tableSchema = table->getTableSchema();
+        for (auto i = 0u; i < payloadVectors.size(); ++i) {
+            auto columnSchema = tableSchema->getColumn(i);
+            if (columnSchema->isFlat()) {
+                payloadVectors[i]->state->setToFlat();
+            }
+        }
+        if (table->isEmpty()) {
+            for (auto& vector : payloadVectors) {
+                vector->setAsSingleNullEntry();
+            }
+            markVector->setValue<bool>(0, false);
+            table->append(payloadAndMarkVectors);
+        }
+    }
+    default:
+        break;
+    }
+}
+
+std::unique_ptr<main::QueryResult> ResultCollector::getQueryResult() const {
+    return std::make_unique<main::MaterializedQueryResult>(sharedState->getTable());
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/CMakeLists.txt
new file mode 100644
index 0000000000..0de0db6334
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/CMakeLists.txt
@@ -0,0 +1,11 @@
+add_library(lbug_processor_operator_scan
+        OBJECT
+        primary_key_scan_node_table.cpp
+        scan_multi_rel_tables.cpp
+        scan_node_table.cpp
+        scan_rel_table.cpp
+        scan_table.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_scan>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/primary_key_scan_node_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/primary_key_scan_node_table.cpp
new file mode 100644
index 0000000000..e2290b8ac6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/primary_key_scan_node_table.cpp
@@ -0,0 +1,75 @@
+#include "processor/operator/scan/primary_key_scan_node_table.h"
+
+#include "binder/expression/expression_util.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::string PrimaryKeyScanPrintInfo::toString() const {
+    std::string result = "Key: ";
+    result += key;
+    if (!alias.empty()) {
+        result += ",Alias: ";
+        result += alias;
+    }
+    result += ", Expressions: ";
+    result += binder::ExpressionUtil::toString(expressions);
+    return result;
+}
+
+idx_t PrimaryKeyScanSharedState::getTableIdx() {
+    std::unique_lock lck{mtx};
+    if (cursor < numTables) {
+        return cursor++;
+    }
+    return numTables;
+}
+
+void PrimaryKeyScanNodeTable::initLocalStateInternal(ResultSet* resultSet,
+    ExecutionContext* context) {
+    ScanTable::initLocalStateInternal(resultSet, context);
+    auto nodeIDVector = resultSet->getValueVector(opInfo.nodeIDPos).get();
+    scanState = std::make_unique<NodeTableScanState>(nodeIDVector, std::vector<ValueVector*>{},
+        nodeIDVector->state);
+    indexEvaluator->init(*resultSet, context->clientContext);
+}
+
+bool PrimaryKeyScanNodeTable::getNextTuplesInternal(ExecutionContext* context) {
+    auto transaction = transaction::Transaction::Get(*context->clientContext);
+    auto tableIdx = sharedState->getTableIdx();
+    if (tableIdx >= tableInfos.size()) {
+        return false;
+    }
+    KU_ASSERT(tableIdx < tableInfos.size());
+    auto& tableInfo = tableInfos[tableIdx];
+    // Look up index
+    indexEvaluator->evaluate();
+    auto indexVector = indexEvaluator->resultVector.get();
+    auto& selVector = indexVector->state->getSelVector();
+    KU_ASSERT(selVector.getSelSize() == 1);
+    auto pos = selVector.getSelectedPositions()[0];
+    if (indexVector->isNull(pos)) {
+        return false;
+    }
+    offset_t nodeOffset = 0;
+    auto& table = tableInfo.table->cast<NodeTable>();
+    if (!table.lookupPK(transaction, indexVector, pos, nodeOffset)) {
+        return false;
+    }
+    auto nodeID = nodeID_t{nodeOffset, table.getTableID()};
+    scanState->nodeIDVector->setValue<nodeID_t>(pos, nodeID);
+    // Look up properties
+    tableInfo.initScanState(*scanState, outVectors, context->clientContext);
+    table.initScanState(transaction, *scanState, nodeID.tableID, nodeOffset);
+    auto succeeded = table.lookup(transaction, *scanState);
+    tableInfo.castColumns();
+    metrics->numOutputTuple.incrementByOne();
+    return succeeded;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_multi_rel_tables.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_multi_rel_tables.cpp
new file mode 100644
index 0000000000..d9c75aa91e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_multi_rel_tables.cpp
@@ -0,0 +1,109 @@
+#include "processor/operator/scan/scan_multi_rel_tables.h"
+
+#include "processor/execution_context.h"
+#include "storage/local_storage/local_storage.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace processor {
+
+bool DirectionInfo::needFlip(RelDataDirection relDataDirection) const {
+    if (extendFromSource && relDataDirection == RelDataDirection::BWD) {
+        return true;
+    }
+    if (!extendFromSource && relDataDirection == RelDataDirection::FWD) {
+        return true;
+    }
+    return false;
+}
+
+bool RelTableCollectionScanner::scan(main::ClientContext* context, RelTableScanState& scanState,
+    const std::vector<ValueVector*>& outVectors) {
+    auto transaction = Transaction::Get(*context);
+    while (true) {
+        auto& relInfo = relInfos[currentTableIdx];
+        if (relInfo.table->scan(transaction, scanState)) {
+            auto& selVector = scanState.outState->getSelVector();
+            if (directionVector != nullptr) {
+                for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+                    directionVector->setValue<bool>(selVector[i], directionValues[currentTableIdx]);
+                }
+            }
+            if (selVector.getSelSize() > 0) {
+                relInfo.castColumns();
+                return true;
+            }
+        } else {
+            currentTableIdx = nextTableIdx;
+            if (currentTableIdx == relInfos.size()) {
+                return false;
+            }
+            auto& currentInfo = relInfos[currentTableIdx];
+            currentInfo.initScanState(scanState, outVectors, context);
+            currentInfo.table->initScanState(transaction, scanState, currentTableIdx == 0);
+            nextTableIdx++;
+        }
+    }
+}
+
+void ScanMultiRelTable::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    ScanTable::initLocalStateInternal(resultSet, context);
+    auto clientContext = context->clientContext;
+    boundNodeIDVector = resultSet->getValueVector(opInfo.nodeIDPos).get();
+    auto nbrNodeIDVector = outVectors[0];
+    scanState = std::make_unique<RelTableScanState>(*MemoryManager::Get(*clientContext),
+        boundNodeIDVector, outVectors, nbrNodeIDVector->state);
+    for (auto& [_, scanner] : scanners) {
+        for (auto& relInfo : scanner.relInfos) {
+            if (directionInfo.directionPos.isValid()) {
+                scanner.directionVector =
+                    resultSet->getValueVector(directionInfo.directionPos).get();
+                scanner.directionValues.push_back(directionInfo.needFlip(relInfo.direction));
+            }
+        }
+    }
+    currentScanner = nullptr;
+}
+
+bool ScanMultiRelTable::getNextTuplesInternal(ExecutionContext* context) {
+    while (true) {
+        if (currentScanner != nullptr &&
+            currentScanner->scan(context->clientContext, *scanState, outVectors)) {
+            metrics->numOutputTuple.increase(scanState->outState->getSelVector().getSelSize());
+            return true;
+        }
+        if (!children[0]->getNextTuple(context)) {
+            resetState();
+            return false;
+        }
+        const auto currentIdx = boundNodeIDVector->state->getSelVector()[0];
+        if (boundNodeIDVector->isNull(currentIdx)) {
+            currentScanner = nullptr;
+            continue;
+        }
+        auto nodeID = boundNodeIDVector->getValue<nodeID_t>(currentIdx);
+        initCurrentScanner(nodeID);
+    }
+}
+
+void ScanMultiRelTable::resetState() {
+    currentScanner = nullptr;
+    for (auto& [_, scanner] : scanners) {
+        scanner.resetState();
+    }
+}
+
+void ScanMultiRelTable::initCurrentScanner(const nodeID_t& nodeID) {
+    if (scanners.contains(nodeID.tableID)) {
+        currentScanner = &scanners.at(nodeID.tableID);
+        currentScanner->resetState();
+    } else {
+        currentScanner = nullptr;
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_node_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_node_table.cpp
new file mode 100644
index 0000000000..95db1c06b0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_node_table.cpp
@@ -0,0 +1,142 @@
+#include "processor/operator/scan/scan_node_table.h"
+
+#include "binder/expression/expression_util.h"
+#include "processor/execution_context.h"
+#include "storage/local_storage/local_node_table.h"
+#include "storage/local_storage/local_storage.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::string ScanNodeTablePrintInfo::toString() const {
+    std::string result = "Tables: ";
+    for (auto& tableName : tableNames) {
+        result += tableName;
+        if (tableName != tableNames.back()) {
+            result += ", ";
+        }
+    }
+    if (!alias.empty()) {
+        result += ",Alias: ";
+        result += alias;
+    }
+    if (!properties.empty()) {
+        result += ",Properties: ";
+        result += binder::ExpressionUtil::toString(properties);
+    }
+    return result;
+}
+
+void ScanNodeTableSharedState::initialize(const transaction::Transaction* transaction,
+    NodeTable* table, ScanNodeTableProgressSharedState& progressSharedState) {
+    this->table = table;
+    this->currentCommittedGroupIdx = 0;
+    this->currentUnCommittedGroupIdx = 0;
+    this->numCommittedNodeGroups = table->getNumCommittedNodeGroups();
+    if (transaction->isWriteTransaction()) {
+        if (const auto localTable =
+                transaction->getLocalStorage()->getLocalTable(this->table->getTableID())) {
+            auto& localNodeTable = localTable->cast<LocalNodeTable>();
+            this->numUnCommittedNodeGroups = localNodeTable.getNumNodeGroups();
+        }
+    }
+    progressSharedState.numGroups += numCommittedNodeGroups;
+}
+
+void ScanNodeTableSharedState::nextMorsel(NodeTableScanState& scanState,
+    ScanNodeTableProgressSharedState& progressSharedState) {
+    std::unique_lock lck{mtx};
+    if (currentCommittedGroupIdx < numCommittedNodeGroups) {
+        scanState.nodeGroupIdx = currentCommittedGroupIdx++;
+        progressSharedState.numGroupsScanned++;
+        scanState.source = TableScanSource::COMMITTED;
+        return;
+    }
+    if (currentUnCommittedGroupIdx < numUnCommittedNodeGroups) {
+        scanState.nodeGroupIdx = currentUnCommittedGroupIdx++;
+        scanState.source = TableScanSource::UNCOMMITTED;
+        return;
+    }
+    scanState.source = TableScanSource::NONE;
+}
+
+table_id_map_t<SemiMask*> ScanNodeTable::getSemiMasks() const {
+    table_id_map_t<SemiMask*> result;
+    KU_ASSERT(tableInfos.size() == sharedStates.size());
+    for (auto i = 0u; i < sharedStates.size(); ++i) {
+        result.insert({tableInfos[i].table->getTableID(), sharedStates[i]->getSemiMask()});
+    }
+    return result;
+}
+
+void ScanNodeTableInfo::initScanState(TableScanState& scanState,
+    const std::vector<ValueVector*>& outVectors, main::ClientContext* context) {
+    auto transaction = transaction::Transaction::Get(*context);
+    scanState.setToTable(transaction, table, columnIDs, copyVector(columnPredicates));
+    initScanStateVectors(scanState, outVectors, MemoryManager::Get(*context));
+}
+
+void ScanNodeTable::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    ScanTable::initLocalStateInternal(resultSet, context);
+    auto nodeIDVector = resultSet->getValueVector(opInfo.nodeIDPos).get();
+    scanState = std::make_unique<NodeTableScanState>(nodeIDVector, outVectors, nodeIDVector->state);
+    currentTableIdx = 0;
+    initCurrentTable(context);
+}
+
+void ScanNodeTable::initCurrentTable(ExecutionContext* context) {
+    auto& currentInfo = tableInfos[currentTableIdx];
+    currentInfo.initScanState(*scanState, outVectors, context->clientContext);
+    scanState->semiMask = sharedStates[currentTableIdx]->getSemiMask();
+}
+
+void ScanNodeTable::initGlobalStateInternal(ExecutionContext* context) {
+    KU_ASSERT(sharedStates.size() == tableInfos.size());
+    for (auto i = 0u; i < tableInfos.size(); i++) {
+        sharedStates[i]->initialize(transaction::Transaction::Get(*context->clientContext),
+            tableInfos[i].table->ptrCast<NodeTable>(), *progressSharedState);
+    }
+}
+
+bool ScanNodeTable::getNextTuplesInternal(ExecutionContext* context) {
+    const auto transaction = transaction::Transaction::Get(*context->clientContext);
+    while (currentTableIdx < tableInfos.size()) {
+        auto& info = tableInfos[currentTableIdx];
+        while (info.table->scan(transaction, *scanState)) {
+            const auto outputSize = scanState->outState->getSelVector().getSelSize();
+            if (outputSize > 0) {
+                info.castColumns();
+                scanState->outState->setToUnflat();
+                metrics->numOutputTuple.increase(outputSize);
+                return true;
+            }
+        }
+        sharedStates[currentTableIdx]->nextMorsel(*scanState, *progressSharedState);
+        if (scanState->source == TableScanSource::NONE) {
+            currentTableIdx++;
+            if (currentTableIdx < tableInfos.size()) {
+                initCurrentTable(context);
+            }
+        } else {
+            info.table->initScanState(transaction, *scanState);
+        }
+    }
+    return false;
+}
+
+double ScanNodeTable::getProgress(ExecutionContext* /*context*/) const {
+    if (currentTableIdx >= tableInfos.size()) {
+        return 1.0;
+    }
+    if (progressSharedState->numGroups == 0) {
+        return 0.0;
+    }
+    return static_cast<double>(progressSharedState->numGroupsScanned) /
+           progressSharedState->numGroups;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_rel_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_rel_table.cpp
new file mode 100644
index 0000000000..6b933167f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_rel_table.cpp
@@ -0,0 +1,93 @@
+#include "processor/operator/scan/scan_rel_table.h"
+
+#include "binder/expression/expression_util.h"
+#include "processor/execution_context.h"
+#include "storage/local_storage/local_rel_table.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+std::string ScanRelTablePrintInfo::toString() const {
+    std::string result = "Tables: ";
+    for (auto& tableName : tableNames) {
+        result += tableName;
+        if (tableName != tableNames.back()) {
+            result += ", ";
+        }
+    }
+    if (!alias.empty()) {
+        result += ",Alias: ";
+        result += alias;
+    }
+    result += ",Direction: (";
+    result += boundNode->toString();
+    result += ")";
+    switch (direction) {
+    case ExtendDirection::FWD: {
+        result += "-[";
+        result += rel->detailsToString();
+        result += "]->";
+    } break;
+    case ExtendDirection::BWD: {
+        result += "<-[";
+        result += rel->detailsToString();
+        result += "]-";
+    } break;
+    case ExtendDirection::BOTH: {
+        result += "<-[";
+        result += rel->detailsToString();
+        result += "]->";
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+    result += "(";
+    result += nbrNode->toString();
+    result += ")";
+    if (!properties.empty()) {
+        result += ",Properties: ";
+        result += binder::ExpressionUtil::toString(properties);
+    }
+    return result;
+}
+
+void ScanRelTableInfo::initScanState(TableScanState& scanState,
+    const std::vector<ValueVector*>& outVectors, main::ClientContext* context) {
+    auto transaction = transaction::Transaction::Get(*context);
+    scanState.setToTable(transaction, table, columnIDs, copyVector(columnPredicates), direction);
+    initScanStateVectors(scanState, outVectors, MemoryManager::Get(*context));
+}
+
+void ScanRelTable::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    ScanTable::initLocalStateInternal(resultSet, context);
+    auto clientContext = context->clientContext;
+    auto boundNodeIDVector = resultSet->getValueVector(opInfo.nodeIDPos).get();
+    auto nbrNodeIDVector = outVectors[0];
+    scanState = std::make_unique<RelTableScanState>(*MemoryManager::Get(*clientContext),
+        boundNodeIDVector, outVectors, nbrNodeIDVector->state);
+    tableInfo.initScanState(*scanState, outVectors, clientContext);
+}
+
+bool ScanRelTable::getNextTuplesInternal(ExecutionContext* context) {
+    const auto transaction = transaction::Transaction::Get(*context->clientContext);
+    while (true) {
+        while (tableInfo.table->scan(transaction, *scanState)) {
+            const auto outputSize = scanState->outState->getSelVector().getSelSize();
+            if (outputSize > 0) {
+                // No need to perform column cast because this is single table scan.
+                metrics->numOutputTuple.increase(outputSize);
+                return true;
+            }
+        }
+        if (!children[0]->getNextTuple(context)) {
+            return false;
+        }
+        tableInfo.table->initScanState(transaction, *scanState);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_table.cpp
new file mode 100644
index 0000000000..6e8ca2b007
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/scan/scan_table.cpp
@@ -0,0 +1,69 @@
+#include "processor/operator/scan/scan_table.h"
+
+#include "binder/expression/scalar_function_expression.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+void ColumnCaster::init(ValueVector* vectorAfterCasting, storage::MemoryManager* memoryManager) {
+    this->vectorAfterCasting = vectorAfterCasting;
+    vectorBeforeCasting = std::make_shared<ValueVector>(columnType.copy(), memoryManager);
+    vectorBeforeCasting->setState(vectorAfterCasting->state);
+    funcInputVectors = {vectorBeforeCasting};
+    funcInputSelVectors = {&vectorBeforeCasting->state->getSelVectorUnsafe()};
+}
+
+void ColumnCaster::cast() {
+    auto& funcExpr = castExpr->constCast<binder::ScalarFunctionExpression>();
+    funcExpr.getFunction().execFunc(funcInputVectors, funcInputSelVectors, *vectorAfterCasting,
+        &vectorAfterCasting->state->getSelVectorUnsafe(), funcExpr.getBindData());
+}
+
+void ScanTableInfo::castColumns() {
+    for (auto& caster : columnCasters) {
+        if (caster.hasCast()) {
+            caster.cast();
+        }
+    }
+}
+
+void ScanTableInfo::addColumnInfo(column_id_t columnID, ColumnCaster caster) {
+    if (caster.hasCast()) {
+        hasColumnCaster = true;
+    }
+    columnIDs.push_back(columnID);
+    columnCasters.push_back(std::move(caster));
+}
+
+void ScanTableInfo::initScanStateVectors(TableScanState& scanState,
+    const std::vector<ValueVector*>& outVectors, MemoryManager* memoryManager) {
+    if (!hasColumnCaster) {
+        // Fast path
+        scanState.outputVectors = outVectors;
+        return;
+    }
+    scanState.outputVectors.clear();
+    for (auto i = 0u; i < columnCasters.size(); ++i) {
+        auto& caster = columnCasters[i];
+        auto vector = outVectors[i];
+        if (!caster.hasCast()) {
+            // No need to cast
+            scanState.outputVectors.push_back(vector);
+        } else {
+            caster.init(vector, memoryManager);
+            scanState.outputVectors.push_back(caster.getVectorBeforeCasting());
+        }
+    }
+}
+
+void ScanTable::initLocalStateInternal(ResultSet*, ExecutionContext*) {
+    for (auto& pos : opInfo.outVectorsPos) {
+        outVectors.push_back(resultSet->getValueVector(pos).get());
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/semi_masker.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/semi_masker.cpp
new file mode 100644
index 0000000000..f4e486f811
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/semi_masker.cpp
@@ -0,0 +1,221 @@
+#include "processor/operator/semi_masker.h"
+
+#include "common/constants.h"
+#include "common/roaring_mask.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+SemiMaskerLocalState* SemiMaskerSharedState::appendLocalState() {
+    auto localInfo = std::make_unique<SemiMaskerLocalState>();
+    bool isSingle = masksPerTable.size() == 1;
+    for (const auto& [tableID, vector] : masksPerTable) {
+        auto& mask = vector.front();
+        auto newOne = SemiMaskUtil::createMask(mask->getMaxOffset());
+        if (isSingle) {
+            localInfo->singleTableRef = newOne.get();
+        }
+        localInfo->localMasksPerTable.insert({tableID, std::move(newOne)});
+    }
+    std::unique_lock lock{mtx};
+    localInfos.push_back(std::move(localInfo));
+    return localInfos[localInfos.size() - 1].get();
+}
+
+void SemiMaskerSharedState::mergeToGlobal() {
+    for (const auto& [tableID, globalVector] : masksPerTable) {
+        if (globalVector.front()->getMaxOffset() > std::numeric_limits<uint32_t>::max()) {
+            std::vector<roaring::Roaring64Map*> masks;
+            for (const auto& localInfo : localInfos) {
+                const auto& mask = localInfo->localMasksPerTable.at(tableID);
+                auto mask64 = static_cast<Roaring64BitmapSemiMask*>(mask.get());
+                if (!mask64->roaring->isEmpty()) {
+                    masks.push_back(mask64->roaring.get());
+                }
+            }
+            auto mergedMask = std::make_shared<roaring::Roaring64Map>(
+                roaring::Roaring64Map::fastunion(masks.size(),
+                    const_cast<const roaring::Roaring64Map**>(masks.data())));
+            for (const auto& item : globalVector) {
+                auto mask64 = static_cast<Roaring64BitmapSemiMask*>(item);
+                mask64->roaring = mergedMask;
+            }
+        } else {
+            std::vector<roaring::Roaring*> masks;
+            for (const auto& localInfo : localInfos) {
+                const auto& mask = localInfo->localMasksPerTable.at(tableID);
+                auto mask32 = static_cast<Roaring32BitmapSemiMask*>(mask.get());
+                if (!mask32->roaring->isEmpty()) {
+                    masks.push_back(mask32->roaring.get());
+                }
+            }
+            auto mergedMask = std::make_shared<roaring::Roaring>(roaring::Roaring::fastunion(
+                masks.size(), const_cast<const roaring::Roaring**>(masks.data())));
+            for (const auto& item : globalVector) {
+                auto mask32 = static_cast<Roaring32BitmapSemiMask*>(item);
+                mask32->roaring = mergedMask;
+            }
+        }
+    }
+}
+
+std::string SemiMaskerPrintInfo::toString() const {
+    std::string result = "Operators: ";
+    for (const auto& op : operatorNames) {
+        result += op;
+        if (&op != &operatorNames.back()) {
+            result += ", ";
+        }
+    }
+    return result;
+}
+
+void BaseSemiMasker::initLocalStateInternal(ResultSet* resultSet, ExecutionContext*) {
+    keyVector = resultSet->getValueVector(keyPos).get();
+    localState = sharedState->appendLocalState();
+}
+
+void BaseSemiMasker::finalizeInternal(ExecutionContext* /*context*/) {
+    sharedState->mergeToGlobal();
+}
+
+bool SingleTableSemiMasker::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    auto& selVector = keyVector->state->getSelVector();
+    for (auto i = 0u; i < selVector.getSelSize(); i++) {
+        auto pos = selVector[i];
+        auto nodeID = keyVector->getValue<nodeID_t>(pos);
+        localState->maskSingleTable(nodeID.offset);
+    }
+    metrics->numOutputTuple.increase(selVector.getSelSize());
+    return true;
+}
+
+bool MultiTableSemiMasker::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    auto& selVector = keyVector->state->getSelVector();
+    for (auto i = 0u; i < selVector.getSelSize(); i++) {
+        auto pos = selVector[i];
+        auto nodeID = keyVector->getValue<nodeID_t>(pos);
+        localState->maskMultiTable(nodeID);
+    }
+    metrics->numOutputTuple.increase(selVector.getSelSize());
+    return true;
+}
+
+void NodeIDsSemiMask::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    BaseSemiMasker::initLocalStateInternal(resultSet, context);
+    srcNodeIDVector = resultSet->getValueVector(srcNodeIDPos).get();
+    dstNodeIDVector = resultSet->getValueVector(dstNodeIDPos).get();
+}
+
+bool NodeIDsSingleTableSemiMasker::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    auto& selVector = keyVector->state->getSelVector();
+    KU_ASSERT(keyVector->state == srcNodeIDVector->state);
+    KU_ASSERT(keyVector->state == dstNodeIDVector->state);
+    auto keyDataVector = ListVector::getDataVector(keyVector);
+    for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+        auto pos = selVector[i];
+        localState->maskSingleTable(srcNodeIDVector->getValue<nodeID_t>(pos).offset);
+        localState->maskSingleTable(dstNodeIDVector->getValue<nodeID_t>(pos).offset);
+        auto [offset, size] = keyVector->getValue<list_entry_t>(pos);
+        for (auto j = 0u; j < size; ++j) {
+            localState->maskSingleTable(keyDataVector->getValue<nodeID_t>(offset + j).offset);
+        }
+    }
+    return true;
+}
+
+bool NodeIDsMultipleTableSemiMasker::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    auto& selVector = keyVector->state->getSelVector();
+    KU_ASSERT(keyVector->state == srcNodeIDVector->state);
+    KU_ASSERT(keyVector->state == dstNodeIDVector->state);
+    auto keyDataVector = ListVector::getDataVector(keyVector);
+    for (auto i = 0u; i < selVector.getSelSize(); ++i) {
+        auto pos = selVector[i];
+        localState->maskMultiTable(srcNodeIDVector->getValue<nodeID_t>(pos));
+        localState->maskMultiTable(dstNodeIDVector->getValue<nodeID_t>(pos));
+        auto [offset, size] = keyVector->getValue<list_entry_t>(pos);
+        for (auto j = 0u; j < size; ++j) {
+            localState->maskMultiTable(keyDataVector->getValue<nodeID_t>(offset + j));
+        }
+    }
+    return true;
+}
+
+void PathSemiMasker::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    BaseSemiMasker::initLocalStateInternal(resultSet, context);
+    auto pathRelsFieldIdx = StructType::getFieldIdx(keyVector->dataType, InternalKeyword::RELS);
+    pathRelsVector = StructVector::getFieldVector(keyVector, pathRelsFieldIdx).get();
+    auto pathRelsDataVector = ListVector::getDataVector(pathRelsVector);
+    auto pathRelsSrcIDFieldIdx =
+        StructType::getFieldIdx(pathRelsDataVector->dataType, InternalKeyword::SRC);
+    pathRelsSrcIDDataVector =
+        StructVector::getFieldVector(pathRelsDataVector, pathRelsSrcIDFieldIdx).get();
+    auto pathRelsDstIDFieldIdx =
+        StructType::getFieldIdx(pathRelsDataVector->dataType, InternalKeyword::DST);
+    pathRelsDstIDDataVector =
+        StructVector::getFieldVector(pathRelsDataVector, pathRelsDstIDFieldIdx).get();
+}
+
+bool PathSingleTableSemiMasker::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    auto& selVector = keyVector->state->getSelVector();
+    // for both direction, we should deal with direction based on the actual direction of the edge
+    for (auto i = 0u; i < selVector.getSelSize(); i++) {
+        auto [offset, size] = pathRelsVector->getValue<list_entry_t>(selVector[i]);
+        for (auto j = 0u; j < size; ++j) {
+            auto pos = offset + j;
+            if (direction == ExtendDirection::FWD || direction == ExtendDirection::BOTH) {
+                auto srcNodeID = pathRelsSrcIDDataVector->getValue<nodeID_t>(pos);
+                localState->maskSingleTable(srcNodeID.offset);
+            }
+            if (direction == ExtendDirection::BWD || direction == ExtendDirection::BOTH) {
+                auto dstNodeID = pathRelsDstIDDataVector->getValue<nodeID_t>(pos);
+                localState->maskSingleTable(dstNodeID.offset);
+            }
+        }
+    }
+    return true;
+}
+
+bool PathMultipleTableSemiMasker::getNextTuplesInternal(ExecutionContext* context) {
+    if (!children[0]->getNextTuple(context)) {
+        return false;
+    }
+    auto& selVector = pathRelsVector->state->getSelVector();
+    for (auto i = 0u; i < selVector.getSelSize(); i++) {
+        auto [offset, size] = pathRelsVector->getValue<list_entry_t>(selVector[i]);
+        for (auto j = 0u; j < size; ++j) {
+            auto pos = offset + j;
+            if (direction == ExtendDirection::FWD || direction == ExtendDirection::BOTH) {
+                auto srcNodeID = pathRelsSrcIDDataVector->getValue<nodeID_t>(pos);
+                localState->maskMultiTable(srcNodeID);
+            }
+            if (direction == ExtendDirection::BWD || direction == ExtendDirection::BOTH) {
+                auto dstNodeID = pathRelsDstIDDataVector->getValue<nodeID_t>(pos);
+                localState->maskMultiTable(dstNodeID);
+            }
+        }
+    }
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/CMakeLists.txt
new file mode 100644
index 0000000000..728015d314
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/CMakeLists.txt
@@ -0,0 +1,14 @@
+add_library(lbug_processor_operator_simple
+        OBJECT
+        attach_database.cpp
+        detach_database.cpp
+        install_extension.cpp
+        load_extension.cpp
+        import_db.cpp
+        export_db.cpp
+        use_database.cpp
+        uninstall_extension.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_simple>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/attach_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/attach_database.cpp
new file mode 100644
index 0000000000..98554dbfaf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/attach_database.cpp
@@ -0,0 +1,64 @@
+#include "processor/operator/simple/attach_database.h"
+
+#include "common/exception/runtime.h"
+#include "common/string_utils.h"
+#include "main/attached_database.h"
+#include "main/client_context.h"
+#include "main/database.h"
+#include "main/database_manager.h"
+#include "processor/execution_context.h"
+#include "storage/storage_extension.h"
+#include "storage/storage_manager.h"
+
+namespace lbug {
+namespace processor {
+
+std::string AttachDatabasePrintInfo::toString() const {
+    std::string result = "Database: ";
+    if (!dbName.empty()) {
+        result += dbName;
+    } else {
+        result += dbPath;
+    }
+    return result;
+}
+
+static std::string attachMessage() {
+    return "Attached database successfully.";
+}
+
+void AttachDatabase::executeInternal(ExecutionContext* context) {
+    auto client = context->clientContext;
+    auto databaseManager = main::DatabaseManager::Get(*client);
+    auto memoryManager = storage::MemoryManager::Get(*client);
+    if (common::StringUtils::getUpper(attachInfo.dbType) == common::ATTACHED_LBUG_DB_TYPE) {
+        auto db = std::make_unique<main::AttachedLbugDatabase>(attachInfo.dbPath,
+            attachInfo.dbAlias, common::ATTACHED_LBUG_DB_TYPE, client);
+        client->setDefaultDatabase(db.get());
+        databaseManager->registerAttachedDatabase(std::move(db));
+        appendMessage(attachMessage(), memoryManager);
+        return;
+    }
+    for (auto& storageExtension : client->getDatabase()->getStorageExtensions()) {
+        if (storageExtension->canHandleDB(attachInfo.dbType)) {
+            auto db = storageExtension->attach(attachInfo.dbAlias, attachInfo.dbPath, client,
+                attachInfo.options);
+            databaseManager->registerAttachedDatabase(std::move(db));
+            appendMessage(attachMessage(), memoryManager);
+            return;
+        }
+    }
+    auto errMsg = common::stringFormat("No loaded extension can handle database type: {}.",
+        attachInfo.dbType);
+    if (attachInfo.dbType == "duckdb") {
+        errMsg += "\nDid you forget to load duckdb extension?\nYou can load it by: load "
+                  "extension duckdb;";
+    } else if (attachInfo.dbType == "postgres") {
+        errMsg += "\nDid you forget to load postgres extension?\nYou can load it by: load "
+                  "extension postgres;";
+    }
+    throw common::RuntimeException{errMsg};
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/detach_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/detach_database.cpp
new file mode 100644
index 0000000000..004c04a195
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/detach_database.cpp
@@ -0,0 +1,28 @@
+#include "processor/operator/simple/detach_database.h"
+
+#include "main/client_context.h"
+#include "main/database.h"
+#include "main/database_manager.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace processor {
+
+std::string DetatchDatabasePrintInfo::toString() const {
+    return "Database: " + name;
+}
+
+void DetachDatabase::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    auto dbManager = main::DatabaseManager::Get(*clientContext);
+    if (dbManager->hasAttachedDatabase(dbName) &&
+        dbManager->getAttachedDatabase(dbName)->getDBType() == common::ATTACHED_LBUG_DB_TYPE) {
+        clientContext->setDefaultDatabase(nullptr /* defaultDatabase */);
+    }
+    dbManager->detachDatabase(dbName);
+    appendMessage("Detached database successfully.", storage::MemoryManager::Get(*clientContext));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/export_db.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/export_db.cpp
new file mode 100644
index 0000000000..a9a24eaee6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/export_db.cpp
@@ -0,0 +1,203 @@
+#include "processor/operator/simple/export_db.h"
+
+#include <sstream>
+
+#include "catalog/catalog.h"
+#include "catalog/catalog_entry/index_catalog_entry.h"
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "common/copier_config/csv_reader_config.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/string_utils.h"
+#include "extension/extension_manager.h"
+#include "function/scalar_macro_function.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+using namespace lbug::catalog;
+using namespace lbug::main;
+
+namespace lbug {
+namespace processor {
+
+using std::stringstream;
+
+std::string ExportDBPrintInfo::toString() const {
+    std::string result = "Export To: ";
+    result += filePath;
+    if (!options.empty()) {
+        result += ",Options: ";
+        auto it = options.begin();
+        for (auto i = 0u; it != options.end(); ++it, ++i) {
+            result += it->first + "=" + it->second.toString();
+            if (i < options.size() - 1) {
+                result += ", ";
+            }
+        }
+    }
+    return result;
+}
+
+static void writeStringStreamToFile(ClientContext* context, const std::string& ssString,
+    const std::string& path) {
+    const auto fileInfo = VirtualFileSystem::GetUnsafe(*context)->openFile(path,
+        FileOpenFlags(FileFlags::WRITE | FileFlags::CREATE_IF_NOT_EXISTS), context);
+    fileInfo->writeFile(reinterpret_cast<const uint8_t*>(ssString.c_str()), ssString.size(),
+        0 /* offset */);
+}
+
+static std::string getTablePropertyDefinitions(const TableCatalogEntry* entry) {
+    std::string columns;
+    auto properties = entry->getProperties();
+    auto propertyIdx = 0u;
+    for (auto& property : properties) {
+        propertyIdx++;
+        if (property.getType() == LogicalType::INTERNAL_ID()) {
+            continue;
+        }
+        columns += "`" + property.getName() + "`";
+        columns += propertyIdx == properties.size() ? "" : ",";
+    }
+    return columns;
+}
+
+static void writeCopyNodeStatement(stringstream& ss, const TableCatalogEntry* entry,
+    const FileScanInfo* info,
+    const std::unordered_map<std::string, const std::atomic<bool>*>& canUseParallelReader) {
+    const auto csvConfig = CSVReaderConfig::construct(info->options);
+    // TODO(Ziyi): We should pass fileName from binder phase to here.
+    auto fileName = entry->getName() + "." + StringUtils::getLower(info->fileTypeInfo.fileTypeStr);
+    std::string columns = getTablePropertyDefinitions(entry);
+    bool useParallelReader = true;
+    if (canUseParallelReader.contains(fileName)) {
+        useParallelReader = canUseParallelReader.at(fileName)->load();
+    }
+    auto copyOptionsCypher = CSVOption::toCypher(csvConfig.option.toOptionsMap(useParallelReader));
+    if (columns.empty()) {
+        ss << stringFormat("COPY `{}` FROM \"{}\" {};\n", entry->getName(), fileName,
+            copyOptionsCypher);
+    } else {
+        ss << stringFormat("COPY `{}` ({}) FROM \"{}\" {};\n", entry->getName(), columns, fileName,
+            copyOptionsCypher);
+    }
+}
+
+static void writeCopyRelStatement(stringstream& ss, const ClientContext* context,
+    const TableCatalogEntry* entry, const FileScanInfo* info,
+    const std::unordered_map<std::string, const std::atomic<bool>*>& canUseParallelReader) {
+    const auto csvConfig = CSVReaderConfig::construct(info->options);
+    std::string columns = getTablePropertyDefinitions(entry);
+    auto transaction = Transaction::Get(*context);
+    const auto catalog = Catalog::Get(*context);
+    for (auto& entryInfo : entry->constCast<RelGroupCatalogEntry>().getRelEntryInfos()) {
+        auto fromTableName =
+            catalog->getTableCatalogEntry(transaction, entryInfo.nodePair.srcTableID)->getName();
+        auto toTableName =
+            catalog->getTableCatalogEntry(transaction, entryInfo.nodePair.dstTableID)->getName();
+        // TODO(Ziyi): We should pass fileName from binder phase to here.
+        auto fileName = stringFormat("{}_{}_{}.{}", entry->getName(), fromTableName, toTableName,
+            StringUtils::getLower(info->fileTypeInfo.fileTypeStr));
+        bool useParallelReader = true;
+        if (canUseParallelReader.contains(fileName)) {
+            useParallelReader = canUseParallelReader.at(fileName)->load();
+        }
+        auto copyOptionsMap = csvConfig.option.toOptionsMap(useParallelReader);
+        copyOptionsMap["from"] = stringFormat("'{}'", fromTableName);
+        copyOptionsMap["to"] = stringFormat("'{}'", toTableName);
+        auto copyOptions = CSVOption::toCypher(copyOptionsMap);
+        if (columns.empty()) {
+            ss << stringFormat("COPY `{}` FROM \"{}\" {};\n", entry->getName(), fileName,
+                copyOptions);
+        } else {
+            ss << stringFormat("COPY `{}` ({}) FROM \"{}\" {};\n", entry->getName(), columns,
+                fileName, copyOptions);
+        }
+    }
+}
+
+static void exportLoadedExtensions(stringstream& ss, const ClientContext* clientContext) {
+    auto extensionCypher = extension::ExtensionManager::Get(*clientContext)->toCypher();
+    if (!extensionCypher.empty()) {
+        ss << extensionCypher << std::endl;
+    }
+}
+
+std::string getSchemaCypher(ClientContext* clientContext) {
+    stringstream ss;
+    exportLoadedExtensions(ss, clientContext);
+    const auto catalog = Catalog::Get(*clientContext);
+    auto transaction = Transaction::Get(*clientContext);
+    ToCypherInfo toCypherInfo;
+    for (const auto& nodeTableEntry :
+        catalog->getNodeTableEntries(transaction, false /* useInternal */)) {
+        ss << nodeTableEntry->toCypher(toCypherInfo) << std::endl;
+    }
+    RelGroupToCypherInfo relTableToCypherInfo{clientContext};
+    for (const auto& entry : catalog->getRelGroupEntries(transaction, false /* useInternal */)) {
+        ss << entry->toCypher(relTableToCypherInfo) << std::endl;
+    }
+    RelGroupToCypherInfo relGroupToCypherInfo{clientContext};
+    for (const auto sequenceEntry : catalog->getSequenceEntries(transaction)) {
+        ss << sequenceEntry->toCypher(relGroupToCypherInfo) << std::endl;
+    }
+    for (auto macroName : catalog->getMacroNames(transaction)) {
+        ss << catalog->getScalarMacroFunction(transaction, macroName)->toCypher(macroName)
+           << std::endl;
+    }
+    return ss.str();
+}
+
+std::string getCopyCypher(const ClientContext* context, const FileScanInfo* boundFileInfo,
+    const std::unordered_map<std::string, const std::atomic<bool>*>& canUseParallelReader) {
+    stringstream ss;
+    auto transaction = Transaction::Get(*context);
+    const auto catalog = Catalog::Get(*context);
+    for (const auto& nodeTableEntry :
+        catalog->getNodeTableEntries(transaction, false /* useInternal */)) {
+        writeCopyNodeStatement(ss, nodeTableEntry, boundFileInfo, canUseParallelReader);
+    }
+    for (const auto& entry : catalog->getRelGroupEntries(transaction, false /* useInternal */)) {
+        writeCopyRelStatement(ss, context, entry, boundFileInfo, canUseParallelReader);
+    }
+    return ss.str();
+}
+
+std::string getIndexCypher(ClientContext* clientContext, const FileScanInfo& exportFileInfo) {
+    stringstream ss;
+    IndexToCypherInfo info{clientContext, exportFileInfo};
+    auto transaction = Transaction::Get(*clientContext);
+    auto catalog = Catalog::Get(*clientContext);
+    for (auto entry : catalog->getIndexEntries(transaction)) {
+        auto indexCypher = entry->toCypher(info);
+        if (!indexCypher.empty()) {
+            ss << indexCypher << std::endl;
+        }
+    }
+    return ss.str();
+}
+
+void ExportDB::executeInternal(ExecutionContext* context) {
+    const auto clientContext = context->clientContext;
+    // write the schema.cypher file
+    writeStringStreamToFile(clientContext, getSchemaCypher(clientContext),
+        boundFileInfo.filePaths[0] + "/" + PortDBConstants::SCHEMA_FILE_NAME);
+    if (schemaOnly) {
+        return;
+    }
+    // write the copy.cypher file
+    // for every table, we write COPY FROM statement
+    writeStringStreamToFile(clientContext,
+        getCopyCypher(clientContext, &boundFileInfo, sharedState->canUseParallelReader),
+        boundFileInfo.filePaths[0] + "/" + PortDBConstants::COPY_FILE_NAME);
+    // write the index.cypher file
+    writeStringStreamToFile(clientContext, getIndexCypher(clientContext, boundFileInfo),
+        boundFileInfo.filePaths[0] + "/" + PortDBConstants::INDEX_FILE_NAME);
+    appendMessage("Exported database successfully.", storage::MemoryManager::Get(*clientContext));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/import_db.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/import_db.cpp
new file mode 100644
index 0000000000..bb2bab9673
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/import_db.cpp
@@ -0,0 +1,51 @@
+#include "processor/operator/simple/import_db.h"
+
+#include "common/exception/runtime.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "transaction/transaction_context.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace processor {
+
+static void validateQueryResult(main::QueryResult* queryResult) {
+    auto currentResult = queryResult;
+    while (currentResult) {
+        if (!currentResult->isSuccess()) {
+            throw RuntimeException("Import database failed: " + currentResult->getErrorMessage());
+        }
+        currentResult = currentResult->getNextQueryResult();
+    }
+}
+
+void ImportDB::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    if (query.empty()) { // Export empty database.
+        appendMessage("Imported database successfully.",
+            storage::MemoryManager::Get(*clientContext));
+        return;
+    }
+    // TODO(Guodong): this is special for "Import database". Should refactor after we support
+    // multiple DDL and COPY statements in a single transaction.
+    // Currently, we split multiple query statements into single query and execute them one by one,
+    // each with an auto transaction.
+    auto transactionContext = transaction::TransactionContext::Get(*clientContext);
+    if (transactionContext->hasActiveTransaction()) {
+        transactionContext->commit();
+    }
+    auto res = clientContext->queryNoLock(query);
+    validateQueryResult(res.get());
+    if (!indexQuery.empty()) {
+        res = clientContext->queryNoLock(indexQuery);
+        validateQueryResult(res.get());
+    }
+    appendMessage("Imported database successfully.", storage::MemoryManager::Get(*clientContext));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/install_extension.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/install_extension.cpp
new file mode 100644
index 0000000000..7eb634dec0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/install_extension.cpp
@@ -0,0 +1,44 @@
+#include "processor/operator/simple/install_extension.h"
+
+#include "common/string_format.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug::common;
+using namespace lbug::extension;
+
+void InstallExtension::setOutputMessage(bool installed, storage::MemoryManager* memoryManager) {
+    if (info.forceInstall) {
+        appendMessage(
+            stringFormat("Extension: {} updated from the repo: {}.", info.name, info.repo),
+            memoryManager);
+        return;
+    }
+    if (installed) {
+        appendMessage(
+            stringFormat("Extension: {} installed from the repo: {}.", info.name, info.repo),
+            memoryManager);
+    } else {
+        appendMessage(
+            stringFormat(
+                "Extension: {} is already installed.\nTo update it, you can run: UPDATE {}.",
+                info.name, info.name),
+            memoryManager);
+    }
+}
+
+void InstallExtension::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    ExtensionInstaller installer{info, *clientContext};
+    bool installResult = installer.install();
+    setOutputMessage(installResult, storage::MemoryManager::Get(*clientContext));
+    if (info.forceInstall) {
+        KU_ASSERT(installResult);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/load_extension.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/load_extension.cpp
new file mode 100644
index 0000000000..ad9a8b25b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/load_extension.cpp
@@ -0,0 +1,27 @@
+#include "processor/operator/simple/load_extension.h"
+
+#include "extension/extension_manager.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug::extension;
+
+std::string LoadExtensionPrintInfo::toString() const {
+    return "Load " + extensionName;
+}
+
+void LoadExtension::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    ExtensionManager::Get(*clientContext)->loadExtension(path, clientContext);
+    appendMessage(stringFormat("Extension: {} has been loaded.", path),
+        storage::MemoryManager::Get(*clientContext));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/uninstall_extension.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/uninstall_extension.cpp
new file mode 100644
index 0000000000..14e5ca15b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/uninstall_extension.cpp
@@ -0,0 +1,39 @@
+#include "processor/operator/simple/uninstall_extension.h"
+
+#include "common/exception/runtime.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/string_format.h"
+#include "extension/extension.h"
+#include "main/client_context.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace processor {
+
+using namespace lbug::common;
+using namespace lbug::extension;
+
+void UninstallExtension::executeInternal(ExecutionContext* context) {
+    auto clientContext = context->clientContext;
+    auto vfs = VirtualFileSystem::GetUnsafe(*clientContext);
+    auto localLibFilePath = ExtensionUtils::getLocalPathForExtensionLib(clientContext, path);
+    if (!vfs->fileOrPathExists(localLibFilePath)) {
+        throw RuntimeException{
+            stringFormat("Can not uninstall extension: {} since it has not been installed.", path)};
+    }
+    std::error_code errCode;
+    if (!std::filesystem::remove_all(
+            extension::ExtensionUtils::getLocalDirForExtension(clientContext, path), errCode)) {
+        // LCOV_EXCL_START
+        throw RuntimeException{
+            stringFormat("An error occurred while uninstalling extension: {}. Error: {}.", path,
+                errCode.message())};
+        // LCOV_EXCL_STOP
+    }
+    appendMessage(stringFormat("Extension: {} has been uninstalled", path),
+        storage::MemoryManager::Get(*clientContext));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/use_database.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/use_database.cpp
new file mode 100644
index 0000000000..11f561f683
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/simple/use_database.cpp
@@ -0,0 +1,25 @@
+#include "processor/operator/simple/use_database.h"
+
+#include "main/client_context.h"
+#include "main/database_manager.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+namespace lbug {
+namespace processor {
+
+void UseDatabase::executeInternal(ExecutionContext* context) {
+    auto dbManager = main::DatabaseManager::Get(*context->clientContext);
+    dbManager->setDefaultDatabase(dbName);
+    appendMessage("Used database successfully.",
+        storage::MemoryManager::Get(*context->clientContext));
+}
+
+std::string UseDatabasePrintInfo::toString() const {
+    std::string result = "Database: ";
+    result += dbName;
+    return result;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/sink.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/sink.cpp
new file mode 100644
index 0000000000..b8fbbbe5b1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/sink.cpp
@@ -0,0 +1,26 @@
+#include "processor/operator/sink.h"
+
+#include "main/query_result/materialized_query_result.h"
+#include "processor/result/factorized_table_util.h"
+
+namespace lbug {
+namespace processor {
+
+std::unique_ptr<ResultSet> Sink::getResultSet(storage::MemoryManager* memoryManager) {
+    if (resultSetDescriptor == nullptr) {
+        // Some pipeline does not need a resultSet, e.g. OrderByMerge
+        return std::unique_ptr<ResultSet>();
+    }
+    return std::make_unique<ResultSet>(resultSetDescriptor.get(), memoryManager);
+}
+
+std::unique_ptr<main::QueryResult> SimpleSink::getQueryResult() const {
+    return std::make_unique<main::MaterializedQueryResult>(messageTable);
+}
+
+void SimpleSink::appendMessage(const std::string& msg, storage::MemoryManager* memoryManager) {
+    FactorizedTableUtils::appendStringToTable(messageTable.get(), msg, memoryManager);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/skip.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/skip.cpp
new file mode 100644
index 0000000000..82ae73e2cc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/skip.cpp
@@ -0,0 +1,61 @@
+#include "processor/operator/skip.h"
+
+#include "processor/execution_context.h"
+
+namespace lbug {
+namespace processor {
+
+void Skip::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* /*context*/) {
+    dataChunkToSelect = resultSet->dataChunks[dataChunkToSelectPos];
+}
+
+std::string SkipPrintInfo::toString() const {
+    std::string result = "Skip: ";
+    result += std::to_string(number);
+    return result;
+}
+
+bool Skip::getNextTuplesInternal(ExecutionContext* context) {
+    auto numTupleSkippedBefore = 0u;
+    auto numTuplesAvailable = 1u;
+    do {
+        restoreSelVector(*dataChunkToSelect->state);
+        // end of execution due to no more input
+        if (!children[0]->getNextTuple(context)) {
+            return false;
+        }
+        saveSelVector(*dataChunkToSelect->state);
+        numTuplesAvailable = resultSet->getNumTuples(dataChunksPosInScope);
+        numTupleSkippedBefore = counter->fetch_add(numTuplesAvailable);
+    } while (numTupleSkippedBefore + numTuplesAvailable <= skipNumber);
+    auto numTupleToSkipInCurrentResultSet = (int64_t)(skipNumber - numTupleSkippedBefore);
+    if (numTupleToSkipInCurrentResultSet <= 0) {
+        // Other thread has finished skipping. Process everything in current result set.
+        metrics->numOutputTuple.increase(numTuplesAvailable);
+    } else {
+        // If all dataChunks are flat, numTupleAvailable = 1 which means numTupleSkippedBefore =
+        // skipNumber. So execution is handled in above if statement.
+        KU_ASSERT(!dataChunkToSelect->state->isFlat());
+        auto buffer = dataChunkToSelect->state->getSelVectorUnsafe().getMutableBuffer();
+        if (dataChunkToSelect->state->getSelVector().isUnfiltered()) {
+            for (uint64_t i = numTupleToSkipInCurrentResultSet;
+                 i < dataChunkToSelect->state->getSelVector().getSelSize(); ++i) {
+                buffer[i - numTupleToSkipInCurrentResultSet] = i;
+            }
+            dataChunkToSelect->state->getSelVectorUnsafe().setToFiltered();
+        } else {
+            for (uint64_t i = numTupleToSkipInCurrentResultSet;
+                 i < dataChunkToSelect->state->getSelVector().getSelSize(); ++i) {
+                buffer[i - numTupleToSkipInCurrentResultSet] = buffer[i];
+            }
+        }
+        dataChunkToSelect->state->getSelVectorUnsafe().setSelSize(
+            dataChunkToSelect->state->getSelVector().getSelSize() -
+            numTupleToSkipInCurrentResultSet);
+        metrics->numOutputTuple.increase(dataChunkToSelect->state->getSelVector().getSelSize());
+    }
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/standalone_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/standalone_call.cpp
new file mode 100644
index 0000000000..841611ec54
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/standalone_call.cpp
@@ -0,0 +1,39 @@
+#include "processor/operator/standalone_call.h"
+
+#include "common/cast.h"
+#include "main/client_context.h"
+#include "main/db_config.h"
+#include "processor/execution_context.h"
+
+namespace lbug {
+namespace processor {
+
+std::string StandaloneCallPrintInfo::toString() const {
+    std::string result = "Function: ";
+    result += functionName;
+    return result;
+}
+
+bool StandaloneCall::getNextTuplesInternal(ExecutionContext* context) {
+    if (standaloneCallInfo.hasExecuted) {
+        return false;
+    }
+    standaloneCallInfo.hasExecuted = true;
+    switch (standaloneCallInfo.option->optionType) {
+    case main::OptionType::CONFIGURATION: {
+        const auto configurationOption =
+            common::ku_dynamic_cast<const main::ConfigurationOption*>(standaloneCallInfo.option);
+        configurationOption->setContext(context->clientContext, standaloneCallInfo.optionValue);
+        break;
+    }
+    case main::OptionType::EXTENSION:
+        context->clientContext->setExtensionOption(standaloneCallInfo.option->name,
+            standaloneCallInfo.optionValue);
+        break;
+    }
+    metrics->numOutputTuple.incrementByOne();
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_function_call.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_function_call.cpp
new file mode 100644
index 0000000000..2744e0a170
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_function_call.cpp
@@ -0,0 +1,57 @@
+#include "processor/operator/table_function_call.h"
+
+#include "binder/expression/expression_util.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+std::string TableFunctionCallPrintInfo::toString() const {
+    std::string result = "Function: ";
+    result += funcName;
+    if (!exprs.empty()) {
+        result += ", Expressions: ";
+        result += binder::ExpressionUtil::toString(exprs);
+    }
+    return result;
+}
+
+void TableFunctionCall::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    auto initLocalStateInput =
+        TableFuncInitLocalStateInput(*sharedState, *info.bindData, context->clientContext);
+    localState = info.function.initLocalStateFunc(initLocalStateInput);
+    funcInput = std::make_unique<TableFuncInput>(info.bindData.get(), localState.get(),
+        sharedState.get(), context);
+    auto initOutputInput = TableFuncInitOutputInput(info.outPosV, *resultSet);
+    // Technically we should make all table function has its own initOutputFunc. But since most
+    // table function is using initSingleDataChunkScanOutput. For simplicity, we assume if no
+    // initOutputFunc provided then we use to initSingleDataChunkScanOutput.
+    if (info.function.initOutputFunc == nullptr) {
+        funcOutput = TableFunction::initSingleDataChunkScanOutput(initOutputInput);
+    } else {
+        funcOutput = info.function.initOutputFunc(initOutputInput);
+    }
+}
+
+bool TableFunctionCall::getNextTuplesInternal(ExecutionContext* context) {
+    funcOutput->resetState();
+    funcInput->bindData->evaluateParams(context->clientContext);
+    auto numTuplesScanned = info.function.tableFunc(*funcInput, *funcOutput);
+    funcOutput->setOutputSize(numTuplesScanned);
+    metrics->numOutputTuple.increase(numTuplesScanned);
+    return numTuplesScanned != 0;
+}
+
+void TableFunctionCall::finalizeInternal(ExecutionContext* context) {
+    info.function.finalizeFunc(context, sharedState.get());
+}
+
+double TableFunctionCall::getProgress(ExecutionContext* /*context*/) const {
+    return info.function.progressFunc(sharedState.get());
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_scan/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_scan/CMakeLists.txt
new file mode 100644
index 0000000000..adde3e3577
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_scan/CMakeLists.txt
@@ -0,0 +1,8 @@
+add_library(lbug_processor_operator_table_scan
+        OBJECT
+        ftable_scan_function.cpp
+        union_all_scan.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_operator_table_scan>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_scan/ftable_scan_function.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_scan/ftable_scan_function.cpp
new file mode 100644
index 0000000000..11780d56c4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_scan/ftable_scan_function.cpp
@@ -0,0 +1,78 @@
+#include "processor/operator/table_scan/ftable_scan_function.h"
+
+#include "function/table/simple_table_function.h"
+#include "processor/result/factorized_table.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+struct FTableScanSharedState final : public SimpleTableFuncSharedState {
+    std::shared_ptr<FactorizedTable> table;
+    uint64_t morselSize;
+    offset_t nextTupleIdx;
+
+    FTableScanSharedState(std::shared_ptr<FactorizedTable> table, uint64_t morselSize)
+        : SimpleTableFuncSharedState{table->getNumTuples()}, table{std::move(table)},
+          morselSize{morselSize}, nextTupleIdx{0} {}
+
+    TableFuncMorsel getMorsel() override {
+        std::unique_lock lck{mtx};
+        auto numTuplesToScan = std::min(morselSize, table->getNumTuples() - nextTupleIdx);
+        auto morsel = TableFuncMorsel(nextTupleIdx, nextTupleIdx + numTuplesToScan);
+        nextTupleIdx += numTuplesToScan;
+        return morsel;
+    }
+};
+
+// FTableScan has an exceptional output where vectors can be in different dataChunks. So we give
+// a dummy dataChunk during initialization and never use it.
+struct FTableScanTableFuncOutput : TableFuncOutput {
+    std::vector<common::ValueVector*> vectors;
+
+    explicit FTableScanTableFuncOutput(std::vector<common::ValueVector*> vectors)
+        : TableFuncOutput(common::DataChunk{} /* dummy DataChunk */), vectors{std::move(vectors)} {}
+};
+
+static std::unique_ptr<TableFuncOutput> initFTableScanOutput(
+    const TableFuncInitOutputInput& input) {
+    std::vector<ValueVector*> vectors;
+    for (auto i = 0u; i < input.outColumnPositions.size(); ++i) {
+        vectors.push_back(input.resultSet.getValueVector(input.outColumnPositions[i]).get());
+    }
+    return std::make_unique<FTableScanTableFuncOutput>(std::move(vectors));
+}
+
+static offset_t tableFunc(const TableFuncInput& input, TableFuncOutput& output) {
+    auto sharedState = ku_dynamic_cast<FTableScanSharedState*>(input.sharedState);
+    auto bindData = ku_dynamic_cast<FTableScanBindData*>(input.bindData);
+    auto morsel = sharedState->getMorsel();
+    if (morsel.endOffset <= morsel.startOffset) {
+        return 0;
+    }
+    auto numTuples = morsel.endOffset - morsel.startOffset;
+    auto& output_ = ku_dynamic_cast<FTableScanTableFuncOutput&>(output);
+    sharedState->table->scan(output_.vectors, morsel.startOffset, numTuples,
+        bindData->columnIndices);
+    return numTuples;
+}
+
+static std::unique_ptr<TableFuncSharedState> initSharedState(
+    const TableFuncInitSharedStateInput& input) {
+    auto bindData = ku_dynamic_cast<FTableScanBindData*>(input.bindData);
+    return std::make_unique<FTableScanSharedState>(bindData->table, bindData->morselSize);
+}
+
+std::unique_ptr<TableFunction> FTableScan::getFunction() {
+    auto function = std::make_unique<TableFunction>(name, std::vector<LogicalTypeID>{});
+    function->tableFunc = tableFunc;
+    function->initSharedStateFunc = initSharedState;
+    function->initLocalStateFunc = TableFunction::initEmptyLocalState;
+    function->initOutputFunc = initFTableScanOutput;
+    return function;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_scan/union_all_scan.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_scan/union_all_scan.cpp
new file mode 100644
index 0000000000..292df1bf34
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/table_scan/union_all_scan.cpp
@@ -0,0 +1,63 @@
+#include "processor/operator/table_scan/union_all_scan.h"
+
+#include <mutex>
+
+#include "binder/expression/expression_util.h"
+#include "common/metric.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string UnionAllScanPrintInfo::toString() const {
+    std::string result = "Expressions: ";
+    result += binder::ExpressionUtil::toString(expressions);
+    return result;
+}
+
+std::unique_ptr<UnionAllScanMorsel> UnionAllScanSharedState::getMorsel() {
+    std::unique_lock lck{mtx};
+    if (tableIdx == tables.size()) { // No more to scan.
+        return std::make_unique<UnionAllScanMorsel>(nullptr /* table */, 0, 0);
+    }
+    auto morsel = getMorselNoLock(tables[tableIdx].get());
+    // Fetch next table if current table has nothing to scan.
+    while (morsel->numTuples == 0) {
+        tableIdx++;
+        nextTupleIdxToScan = 0;
+        if (tableIdx == tables.size()) { // No more to scan.
+            return std::make_unique<UnionAllScanMorsel>(nullptr /* table */, 0, 0);
+        }
+        morsel = getMorselNoLock(tables[tableIdx].get());
+    }
+    return morsel;
+}
+
+std::unique_ptr<UnionAllScanMorsel> UnionAllScanSharedState::getMorselNoLock(
+    FactorizedTable* table) {
+    auto numTuplesToScan = std::min(maxMorselSize, table->getNumTuples() - nextTupleIdxToScan);
+    auto morsel = std::make_unique<UnionAllScanMorsel>(table, nextTupleIdxToScan, numTuplesToScan);
+    nextTupleIdxToScan += numTuplesToScan;
+    return morsel;
+}
+
+void UnionAllScan::initLocalStateInternal(ResultSet* /*resultSet_*/,
+    ExecutionContext* /*context*/) {
+    for (auto& dataPos : info.outputPositions) {
+        vectors.push_back(resultSet->getValueVector(dataPos).get());
+    }
+}
+
+bool UnionAllScan::getNextTuplesInternal(ExecutionContext* /*context*/) {
+    auto morsel = sharedState->getMorsel();
+    if (morsel->numTuples == 0) {
+        return false;
+    }
+    morsel->table->scan(vectors, morsel->startTupleIdx, morsel->numTuples, info.columnIndices);
+    metrics->numOutputTuple.increase(morsel->numTuples);
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/transaction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/transaction.cpp
new file mode 100644
index 0000000000..991bf38f41
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/transaction.cpp
@@ -0,0 +1,82 @@
+#include "processor/operator/transaction.h"
+
+#include "common/exception/transaction_manager.h"
+#include "processor/execution_context.h"
+#include "transaction/transaction_context.h"
+#include "transaction/transaction_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace processor {
+
+std::string TransactionPrintInfo::toString() const {
+    std::string result = "Action: ";
+    result += TransactionActionUtils::toString(action);
+    return result;
+}
+
+bool Transaction::getNextTuplesInternal(ExecutionContext* context) {
+    if (hasExecuted) {
+        return false;
+    }
+    hasExecuted = true;
+    auto clientContext = context->clientContext;
+    auto transactionContext = TransactionContext::Get(*clientContext);
+    validateActiveTransaction(*transactionContext);
+    switch (transactionAction) {
+    case TransactionAction::BEGIN_READ: {
+        transactionContext->beginReadTransaction();
+    } break;
+    case TransactionAction::BEGIN_WRITE: {
+        transactionContext->beginWriteTransaction();
+    } break;
+    case TransactionAction::COMMIT: {
+        transactionContext->commit();
+    } break;
+    case TransactionAction::ROLLBACK: {
+        transactionContext->rollback();
+    } break;
+    case TransactionAction::CHECKPOINT: {
+        TransactionManager::Get(*clientContext)->checkpoint(*clientContext);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    return true;
+}
+
+void Transaction::validateActiveTransaction(const TransactionContext& context) const {
+    switch (transactionAction) {
+    case TransactionAction::BEGIN_READ:
+    case TransactionAction::BEGIN_WRITE: {
+        if (context.hasActiveTransaction()) {
+            throw TransactionManagerException(
+                "Connection already has an active transaction. Cannot start a transaction within "
+                "another one. For concurrent multiple transactions, please open other "
+                "connections.");
+        }
+    } break;
+    case TransactionAction::COMMIT:
+    case TransactionAction::ROLLBACK: {
+        if (!context.hasActiveTransaction()) {
+            throw TransactionManagerException(stringFormat("No active transaction for {}.",
+                TransactionActionUtils::toString(transactionAction)));
+        }
+    } break;
+    case TransactionAction::CHECKPOINT: {
+        if (context.hasActiveTransaction()) {
+            throw TransactionManagerException(stringFormat("Found active transaction for {}.",
+                TransactionActionUtils::toString(transactionAction)));
+        }
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/unwind.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/unwind.cpp
new file mode 100644
index 0000000000..d136bb3713
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/operator/unwind.cpp
@@ -0,0 +1,79 @@
+#include "processor/operator/unwind.h"
+
+#include "binder/expression/expression.h" // IWYU pragma: keep
+#include "common/system_config.h"
+#include "processor/execution_context.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+std::string UnwindPrintInfo::toString() const {
+    std::string result = "Unwind: ";
+    result += inExpression->toString();
+    result += ", As: ";
+    result += outExpression->toString();
+    return result;
+}
+
+void Unwind::initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) {
+    expressionEvaluator->init(*resultSet, context->clientContext);
+    outValueVector = resultSet->getValueVector(outDataPos);
+    if (idPos.isValid()) {
+        idVector = resultSet->getValueVector(idPos).get();
+    }
+}
+
+bool Unwind::hasMoreToRead() const {
+    return listEntry.offset != INVALID_OFFSET && listEntry.size > startIndex;
+}
+
+void Unwind::copyTuplesToOutVector(uint64_t startPos, uint64_t endPos) const {
+    auto listDataVector = ListVector::getDataVector(expressionEvaluator->resultVector.get());
+    auto listPos = listEntry.offset + startPos;
+    for (auto i = 0u; i < endPos - startPos; i++) {
+        outValueVector->copyFromVectorData(i, listDataVector, listPos++);
+    }
+    if (idVector != nullptr) {
+        KU_ASSERT(listDataVector->dataType.getLogicalTypeID() == common::LogicalTypeID::NODE);
+        auto idFieldVector = StructVector::getFieldVector(listDataVector, 0);
+        listPos = listEntry.offset + startPos;
+        for (auto i = 0u; i < endPos - startPos; i++) {
+            idVector->copyFromVectorData(i, idFieldVector.get(), listPos++);
+        }
+    }
+}
+
+bool Unwind::getNextTuplesInternal(ExecutionContext* context) {
+    if (hasMoreToRead()) {
+        auto totalElementsCopy =
+            std::min(DEFAULT_VECTOR_CAPACITY, (uint64_t)listEntry.size - startIndex);
+        copyTuplesToOutVector(startIndex, (totalElementsCopy + startIndex));
+        startIndex += totalElementsCopy;
+        outValueVector->state->initOriginalAndSelectedSize(totalElementsCopy);
+        return true;
+    }
+    do {
+        if (!children[0]->getNextTuple(context)) {
+            return false;
+        }
+        expressionEvaluator->evaluate();
+        auto pos = expressionEvaluator->resultVector->state->getSelVector()[0];
+        if (expressionEvaluator->resultVector->isNull(pos)) {
+            outValueVector->state->getSelVectorUnsafe().setSelSize(0);
+            continue;
+        }
+        listEntry = expressionEvaluator->resultVector->getValue<list_entry_t>(pos);
+        startIndex = 0;
+        auto totalElementsCopy = std::min(DEFAULT_VECTOR_CAPACITY, (uint64_t)listEntry.size);
+        copyTuplesToOutVector(0, totalElementsCopy);
+        startIndex += totalElementsCopy;
+        outValueVector->state->initOriginalAndSelectedSize(startIndex);
+    } while (outValueVector->state->getSelVector().getSelSize() == 0);
+    metrics->numOutputTuple.increase(outValueVector->state->getSelVector().getSelSize());
+    return true;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/processor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/processor.cpp
new file mode 100644
index 0000000000..a422433152
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/processor.cpp
@@ -0,0 +1,82 @@
+#include "processor/processor.h"
+
+#include "common/task_system/progress_bar.h"
+#include "main/query_result.h"
+#include "processor/operator/sink.h"
+#include "processor/physical_plan.h"
+#include "processor/processor_task.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+#if defined(__APPLE__)
+QueryProcessor::QueryProcessor(uint64_t numThreads, uint32_t threadQos) {
+    taskScheduler = std::make_unique<TaskScheduler>(numThreads, threadQos);
+}
+#else
+QueryProcessor::QueryProcessor(uint64_t numThreads) {
+    taskScheduler = std::make_unique<TaskScheduler>(numThreads);
+}
+#endif
+
+std::unique_ptr<main::QueryResult> QueryProcessor::execute(PhysicalPlan* physicalPlan,
+    ExecutionContext* context) {
+    auto lastOperator = physicalPlan->lastOperator.get();
+    // The root pipeline(task) consists of operators and its prevOperator only, because we
+    // expect to have linear plans. For binary operators, e.g., HashJoin, we  keep probe and its
+    // prevOperator in the same pipeline, and decompose build and its prevOperator into another
+    // one.
+    auto sink = lastOperator->ptrCast<Sink>();
+    auto task = std::make_shared<ProcessorTask>(sink, context);
+    for (auto i = (int64_t)sink->getNumChildren() - 1; i >= 0; --i) {
+        decomposePlanIntoTask(sink->getChild(i), task.get(), context);
+    }
+    initTask(task.get());
+    auto progressBar = ProgressBar::Get(*context->clientContext);
+    progressBar->startProgress(context->queryID);
+    taskScheduler->scheduleTaskAndWaitOrError(task, context);
+    progressBar->endProgress(context->queryID);
+    return sink->getQueryResult();
+}
+
+void QueryProcessor::decomposePlanIntoTask(PhysicalOperator* op, Task* task,
+    ExecutionContext* context) {
+    if (op->isSource()) {
+        ProgressBar::Get(*context->clientContext)->addPipeline();
+    }
+    if (op->isSink()) {
+        auto childTask = std::make_unique<ProcessorTask>(ku_dynamic_cast<Sink*>(op), context);
+        for (auto i = (int64_t)op->getNumChildren() - 1; i >= 0; --i) {
+            decomposePlanIntoTask(op->getChild(i), childTask.get(), context);
+        }
+        task->addChildTask(std::move(childTask));
+    } else {
+        // Schedule the right most side (e.g., build side of the hash join) first.
+        for (auto i = (int64_t)op->getNumChildren() - 1; i >= 0; --i) {
+            decomposePlanIntoTask(op->getChild(i), task, context);
+        }
+    }
+}
+
+void QueryProcessor::initTask(Task* task) {
+    auto processorTask = ku_dynamic_cast<ProcessorTask*>(task);
+    PhysicalOperator* op = processorTask->sink;
+    while (!op->isSource()) {
+        if (!op->isParallel()) {
+            task->setSingleThreadedTask();
+        }
+        op = op->getChild(0);
+    }
+    if (!op->isParallel()) {
+        task->setSingleThreadedTask();
+    }
+    for (auto& child : task->children) {
+        initTask(child.get());
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/processor_task.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/processor_task.cpp
new file mode 100644
index 0000000000..61ec9797ca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/processor_task.cpp
@@ -0,0 +1,44 @@
+#include "processor/processor_task.h"
+
+#include "common/task_system/progress_bar.h"
+#include "main/client_context.h"
+#include "main/settings.h"
+#include "processor/execution_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+ProcessorTask::ProcessorTask(Sink* sink, ExecutionContext* executionContext)
+    : Task{executionContext->clientContext->getCurrentSetting(main::ThreadsSetting::name)
+               .getValue<uint64_t>()},
+      sharedStateInitialized{false}, sink{sink}, executionContext{executionContext} {}
+
+void ProcessorTask::run() {
+    // We need the lock when cloning because multiple threads can be accessing to clone,
+    // which is not thread safe
+    lock_t lck{taskMtx};
+    if (!sharedStateInitialized) {
+        sink->initGlobalState(executionContext);
+        sharedStateInitialized = true;
+    }
+    auto taskRoot = sink->copy();
+    lck.unlock();
+    auto resultSet =
+        sink->getResultSet(storage::MemoryManager::Get(*executionContext->clientContext));
+    taskRoot->ptrCast<Sink>()->execute(resultSet.get(), executionContext);
+}
+
+void ProcessorTask::finalize() {
+    ProgressBar::Get(*executionContext->clientContext)->finishPipeline(executionContext->queryID);
+    sink->finalize(executionContext);
+}
+
+bool ProcessorTask::terminate() {
+    return sink->terminate();
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/CMakeLists.txt
new file mode 100644
index 0000000000..e57cca0234
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/CMakeLists.txt
@@ -0,0 +1,16 @@
+add_library(lbug_processor_result
+        OBJECT
+        base_hash_table.cpp
+        factorized_table.cpp
+        factorized_table_pool.cpp
+        factorized_table_schema.cpp
+        factorized_table_util.cpp
+        flat_tuple.cpp
+        pattern_creation_info_table.cpp
+        result_set.cpp
+        result_set_descriptor.cpp
+        )
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_processor_result>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/base_hash_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/base_hash_table.cpp
new file mode 100644
index 0000000000..efe5f1f95b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/base_hash_table.cpp
@@ -0,0 +1,305 @@
+#include "processor/result/base_hash_table.h"
+
+#include "math.h"
+
+#include "common/constants.h"
+#include "common/null_buffer.h"
+#include "common/type_utils.h"
+#include "common/types/ku_list.h"
+#include "common/types/types.h"
+#include "common/utils.h"
+#include "function/comparison/comparison_functions.h"
+#include "function/hash/vector_hash_functions.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace processor {
+
+BaseHashTable::BaseHashTable(storage::MemoryManager& memoryManager, logical_type_vec_t keyTypes)
+    : maxNumHashSlots{0}, numSlotsPerBlockLog2{0}, slotIdxInBlockMask{0},
+      memoryManager{&memoryManager}, keyTypes{std::move(keyTypes)} {
+    initCompareFuncs();
+    initTmpHashVector();
+}
+
+void BaseHashTable::setMaxNumHashSlots(uint64_t newSize) {
+    maxNumHashSlots = newSize;
+}
+
+void BaseHashTable::computeVectorHashes(std::span<const ValueVector*> keyVectors) {
+    hashVector->state = keyVectors[0]->state;
+    VectorHashFunction::computeHash(*keyVectors[0], keyVectors[0]->state->getSelVector(),
+        *hashVector.get(), hashVector->state->getSelVector());
+
+    for (size_t startVecIdx = 1; startVecIdx < keyVectors.size(); startVecIdx++) {
+        auto keyVector = keyVectors[startVecIdx];
+        tmpHashResultVector->state = keyVector->state;
+        tmpHashCombineResultVector->state = keyVector->state;
+        VectorHashFunction::computeHash(*keyVector, keyVector->state->getSelVector(),
+            *tmpHashResultVector, tmpHashResultVector->state->getSelVector());
+        tmpHashCombineResultVector->state =
+            !tmpHashResultVector->state->isFlat() ? tmpHashResultVector->state : hashVector->state;
+        VectorHashFunction::combineHash(*hashVector, hashVector->state->getSelVector(),
+            *tmpHashResultVector, tmpHashResultVector->state->getSelVector(),
+            *tmpHashCombineResultVector, tmpHashCombineResultVector->state->getSelVector());
+        hashVector.swap(tmpHashCombineResultVector);
+    }
+}
+
+template<typename T>
+static bool compareEntry(const common::ValueVector* vector, uint32_t vectorPos,
+    const uint8_t* entry) {
+    uint8_t result = 0;
+    auto key = vector->getData() + vectorPos * vector->getNumBytesPerValue();
+    function::Equals::operation(*(T*)key, *(T*)entry, result, nullptr /* leftVector */,
+        nullptr /* rightVector */);
+    return result != 0;
+}
+
+template<typename T>
+static bool factorizedTableCompareEntry(const uint8_t* entry1, const uint8_t* entry2,
+    const LogicalType&) {
+    return function::Equals::operation(*(T*)entry1, *(T*)entry2);
+}
+
+static ft_compare_function_t getFactorizedTableCompareEntryFunc(const LogicalType& type);
+
+template<>
+bool factorizedTableCompareEntry<list_entry_t>(const uint8_t* entry1, const uint8_t* entry2,
+    const LogicalType& type) {
+    const auto* list1 = reinterpret_cast<const ku_list_t*>(entry1);
+    const auto* list2 = reinterpret_cast<const ku_list_t*>(entry2);
+    if (list1->size != list2->size) {
+        return false;
+    }
+    const auto& childType = ListType::getChildType(type);
+    const auto childSize = LogicalTypeUtils::getRowLayoutSize(childType);
+    const auto nullPtr1 = reinterpret_cast<const uint8_t*>(list1->overflowPtr);
+    const auto nullPtr2 = reinterpret_cast<const uint8_t*>(list2->overflowPtr);
+    const auto dataPtr1 = nullPtr1 + NullBuffer::getNumBytesForNullValues(list1->size);
+    const auto dataPtr2 = nullPtr2 + NullBuffer::getNumBytesForNullValues(list2->size);
+    auto compareFunc = getFactorizedTableCompareEntryFunc(childType);
+    for (size_t index = 0; index < list1->size; index++) {
+        const bool child1IsNull = NullBuffer::isNull(nullPtr1, index);
+        const bool child2IsNull = NullBuffer::isNull(nullPtr2, index);
+        if (child1IsNull != child2IsNull) {
+            return false;
+        }
+        if (!child1IsNull && !child2IsNull &&
+            !compareFunc(dataPtr1 + index * childSize, dataPtr2 + index * childSize, childType)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+const uint8_t* getFTStructFirstField(const uint8_t* structEntry, uint64_t numFields) {
+    return structEntry + common::NullBuffer::getNumBytesForNullValues(numFields);
+}
+
+const uint8_t* getFTStructNodeID(const uint8_t* structEntry, const LogicalType& type) {
+    return getFTStructFirstField(structEntry, common::StructType::getNumFields(type));
+}
+
+const uint8_t* getFTStructRelID(const uint8_t* structEntry, const LogicalType& type) {
+    return getFTStructFirstField(structEntry, common::StructType::getNumFields(type)) +
+           sizeof(common::internalID_t) * 2 + sizeof(common::ku_string_t);
+}
+
+static bool compareFTNodeEntry(const uint8_t* entry1, const uint8_t* entry2,
+    const LogicalType& type) {
+    return factorizedTableCompareEntry<common::internalID_t>(getFTStructNodeID(entry1, type),
+        getFTStructNodeID(entry2, type),
+        type /*not actually used; should really be the type of the field*/);
+}
+
+static bool compareFTRelEntry(const uint8_t* entry1, const uint8_t* entry2,
+    const LogicalType& type) {
+    return factorizedTableCompareEntry<common::internalID_t>(getFTStructRelID(entry1, type),
+        getFTStructRelID(entry2, type),
+        type /*not actually used; should really be the type of the field*/);
+}
+
+template<>
+bool factorizedTableCompareEntry<struct_entry_t>(const uint8_t* entry1, const uint8_t* entry2,
+    const LogicalType& type) {
+    const auto numFields = StructType::getNumFields(type);
+    auto entryToCompare1 = getFTStructFirstField(entry1, numFields);
+    auto entryToCompare2 = getFTStructFirstField(entry2, numFields);
+    for (auto i = 0u; i < numFields; i++) {
+        const auto isNullInEntry1 = NullBuffer::isNull(entry1, i);
+        const auto isNullInEntry2 = NullBuffer::isNull(entry2, i);
+        if (isNullInEntry1 != isNullInEntry2) {
+            return false;
+        }
+        const auto& fieldType = StructType::getFieldType(type, i);
+        ft_compare_function_t compareFunc = getFactorizedTableCompareEntryFunc(fieldType);
+        // If both not null, compare the value.
+        if (!isNullInEntry1 && !compareFunc(entryToCompare1, entryToCompare2, fieldType)) {
+            return false;
+        }
+        const auto fieldSize = LogicalTypeUtils::getRowLayoutSize(fieldType);
+        entryToCompare1 += fieldSize;
+        entryToCompare2 += fieldSize;
+    }
+    return true;
+}
+
+static compare_function_t getCompareEntryFunc(const LogicalType& type);
+
+template<>
+[[maybe_unused]] bool compareEntry<list_entry_t>(const common::ValueVector* vector,
+    uint32_t vectorPos, const uint8_t* entry) {
+    auto dataVector = ListVector::getDataVector(vector);
+    auto listToCompare = vector->getValue<list_entry_t>(vectorPos);
+    auto listEntry = reinterpret_cast<const ku_list_t*>(entry);
+    auto entryNullBytes = reinterpret_cast<uint8_t*>(listEntry->overflowPtr);
+    auto entryValues = entryNullBytes + NullBuffer::getNumBytesForNullValues(listEntry->size);
+    auto rowLayoutSize = LogicalTypeUtils::getRowLayoutSize(dataVector->dataType);
+    compare_function_t compareFunc = getCompareEntryFunc(dataVector->dataType);
+    if (listToCompare.size != listEntry->size) {
+        return false;
+    }
+    for (auto i = 0u; i < listEntry->size; i++) {
+        const bool entryChildIsNull = NullBuffer::isNull(entryNullBytes, i);
+        const bool vectorChildIsNull = dataVector->isNull(listToCompare.offset + i);
+        if (entryChildIsNull != vectorChildIsNull) {
+            return false;
+        }
+        if (!entryChildIsNull && !vectorChildIsNull &&
+            !compareFunc(dataVector, listToCompare.offset + i, entryValues)) {
+            return false;
+        }
+        entryValues += rowLayoutSize;
+    }
+    return true;
+}
+
+static bool compareNodeEntry(const common::ValueVector* vector, uint32_t vectorPos,
+    const uint8_t* entry) {
+    KU_ASSERT(0 == common::StructType::getFieldIdx(vector->dataType, common::InternalKeyword::ID));
+    auto idVector = common::StructVector::getFieldVector(vector, 0).get();
+    return compareEntry<common::internalID_t>(idVector, vectorPos,
+        getFTStructNodeID(entry, vector->dataType));
+}
+
+static bool compareRelEntry(const common::ValueVector* vector, uint32_t vectorPos,
+    const uint8_t* entry) {
+    KU_ASSERT(3 == common::StructType::getFieldIdx(vector->dataType, common::InternalKeyword::ID));
+    auto idVector = common::StructVector::getFieldVector(vector, 3).get();
+    return compareEntry<common::internalID_t>(idVector, vectorPos,
+        getFTStructRelID(entry, vector->dataType));
+}
+
+template<>
+[[maybe_unused]] bool compareEntry<struct_entry_t>(const common::ValueVector* vector,
+    uint32_t vectorPos, const uint8_t* entry) {
+    auto numFields = StructType::getNumFields(vector->dataType);
+    auto entryToCompare = getFTStructFirstField(entry, numFields);
+    for (auto i = 0u; i < numFields; i++) {
+        auto isNullInEntry = NullBuffer::isNull(entry, i);
+        auto fieldVector = StructVector::getFieldVector(vector, i);
+        // Firstly check null on left and right side.
+        if (isNullInEntry != fieldVector->isNull(vectorPos)) {
+            return false;
+        }
+        compare_function_t compareFunc = getCompareEntryFunc(fieldVector->dataType);
+        // If both not null, compare the value.
+        if (!isNullInEntry && !compareFunc(fieldVector.get(), vectorPos, entryToCompare)) {
+            return false;
+        }
+        entryToCompare += LogicalTypeUtils::getRowLayoutSize(fieldVector->dataType);
+    }
+    return true;
+}
+
+static compare_function_t getCompareEntryFunc(const LogicalType& type) {
+    compare_function_t func;
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::NODE: {
+        func = compareNodeEntry;
+    } break;
+    case LogicalTypeID::REL: {
+        func = compareRelEntry;
+    } break;
+    default: {
+        TypeUtils::visit(
+            type.getPhysicalType(), [&]<HashableTypes T>(T) { func = compareEntry<T>; },
+            [](auto) { KU_UNREACHABLE; });
+    }
+    }
+    return func;
+}
+
+static ft_compare_function_t getFactorizedTableCompareEntryFunc(const LogicalType& type) {
+    ft_compare_function_t func;
+    switch (type.getLogicalTypeID()) {
+    case LogicalTypeID::NODE: {
+        func = compareFTNodeEntry;
+    } break;
+    case LogicalTypeID::REL: {
+        func = compareFTRelEntry;
+    } break;
+    default: {
+        TypeUtils::visit(
+            type.getPhysicalType(),
+            [&]<HashableTypes T>(T) { func = factorizedTableCompareEntry<T>; },
+            [](auto) { KU_UNREACHABLE; });
+    }
+    }
+    return func;
+}
+
+void BaseHashTable::initSlotConstant(uint64_t numSlotsPerBlock) {
+    numSlotsPerBlockLog2 = std::log2(numSlotsPerBlock);
+    slotIdxInBlockMask =
+        common::BitmaskUtils::all1sMaskForLeastSignificantBits<uint64_t>(numSlotsPerBlockLog2);
+}
+
+// ! This function will only be used by distinct aggregate and hashJoin, which assumes that all
+// keyVectors are flat.
+bool BaseHashTable::matchFlatVecWithEntry(const std::vector<common::ValueVector*>& keyVectors,
+    const uint8_t* entry) {
+    for (auto i = 0u; i < keyVectors.size(); i++) {
+        auto keyVector = keyVectors[i];
+        KU_ASSERT(keyVector->state->isFlat());
+        KU_ASSERT(keyVector->state->getSelVector().getSelSize() == 1);
+        auto pos = keyVector->state->getSelVector()[0];
+        auto isKeyVectorNull = keyVector->isNull(pos);
+        auto isEntryKeyNull =
+            factorizedTable->isNonOverflowColNull(entry + getTableSchema()->getNullMapOffset(), i);
+        // If either key or entry is null, we shouldn't compare the value of keyVector and
+        // entry.
+        if (isKeyVectorNull && isEntryKeyNull) {
+            continue;
+        } else if (isKeyVectorNull != isEntryKeyNull) {
+            return false;
+        }
+        if (!compareEntryFuncs[i](keyVector, pos, entry + getTableSchema()->getColOffset(i))) {
+            return false;
+        }
+    }
+    return true;
+}
+
+void BaseHashTable::initCompareFuncs() {
+    compareEntryFuncs.reserve(keyTypes.size());
+    for (auto i = 0u; i < keyTypes.size(); ++i) {
+        compareEntryFuncs.push_back(getCompareEntryFunc(keyTypes[i]));
+        ftCompareEntryFuncs.push_back(getFactorizedTableCompareEntryFunc(keyTypes[i]));
+    }
+}
+
+void BaseHashTable::initTmpHashVector() {
+    hashState = std::make_shared<DataChunkState>();
+    hashState->setToFlat();
+    hashVector = std::make_unique<ValueVector>(LogicalType::HASH(), memoryManager);
+    hashVector->state = hashState;
+    tmpHashResultVector = std::make_unique<ValueVector>(LogicalType::HASH(), memoryManager);
+    tmpHashCombineResultVector = std::make_unique<ValueVector>(LogicalType::HASH(), memoryManager);
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table.cpp
new file mode 100644
index 0000000000..e3d466baee
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table.cpp
@@ -0,0 +1,770 @@
+#include "processor/result/factorized_table.h"
+
+#include <cstdint>
+
+#include "common/assert.h"
+#include "common/exception/runtime.h"
+#include "common/null_buffer.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace processor {
+
+DataBlock::DataBlock(storage::MemoryManager* mm, uint64_t size) : numTuples{0}, freeSize{size} {
+    block = mm->allocateBuffer(true /* initializeToZero */, size);
+}
+
+DataBlock::~DataBlock() = default;
+
+uint8_t* DataBlock::getData() const {
+    return block->getBuffer().data();
+}
+std::span<uint8_t> DataBlock::getSizedData() const {
+    return block->getBuffer();
+}
+uint8_t* DataBlock::getWritableData() const {
+    return block->getBuffer().last(freeSize).data();
+}
+void DataBlock::resetNumTuplesAndFreeSize() {
+    freeSize = block->getBuffer().size();
+    numTuples = 0;
+}
+void DataBlock::resetToZero() {
+    memset(block->getBuffer().data(), 0, block->getBuffer().size());
+}
+
+void DataBlock::preventDestruction() {
+    block->preventDestruction();
+}
+
+void DataBlock::copyTuples(DataBlock* blockToCopyFrom, ft_tuple_idx_t tupleIdxToCopyFrom,
+    DataBlock* blockToCopyInto, ft_tuple_idx_t tupleIdxToCopyTo, uint32_t numTuplesToCopy,
+    uint32_t numBytesPerTuple) {
+    for (auto i = 0u; i < numTuplesToCopy; i++) {
+        memcpy(blockToCopyInto->getData() + (tupleIdxToCopyTo * numBytesPerTuple),
+            blockToCopyFrom->getData() + (tupleIdxToCopyFrom * numBytesPerTuple), numBytesPerTuple);
+        tupleIdxToCopyFrom++;
+        tupleIdxToCopyTo++;
+    }
+    blockToCopyInto->numTuples += numTuplesToCopy;
+    blockToCopyInto->freeSize -= (numTuplesToCopy * numBytesPerTuple);
+}
+
+void DataBlockCollection::merge(DataBlockCollection& other) {
+    if (blocks.empty()) {
+        append(std::move(other.blocks));
+        return;
+    }
+    // Pop up the old last block first, and then push back blocks from other into the vector.
+    auto oldLastBlock = std::move(blocks.back());
+    blocks.pop_back();
+    append(std::move(other.blocks));
+    // Insert back tuples in the old last block to the new last block.
+    auto newLastBlock = blocks.back().get();
+    auto numTuplesToAppendIntoNewLastBlock =
+        std::min(numTuplesPerBlock - newLastBlock->numTuples, oldLastBlock->numTuples);
+    DataBlock::copyTuples(oldLastBlock.get(), 0, newLastBlock, newLastBlock->numTuples,
+        numTuplesToAppendIntoNewLastBlock, numBytesPerTuple);
+    // If any tuples left in the old last block, shift them to the beginning, and push the old last
+    // block back.
+    auto numTuplesLeftForNewBlock = oldLastBlock->numTuples - numTuplesToAppendIntoNewLastBlock;
+    if (numTuplesLeftForNewBlock > 0) {
+        auto tupleIdxInOldLastBlock = numTuplesToAppendIntoNewLastBlock;
+        oldLastBlock->resetNumTuplesAndFreeSize();
+        DataBlock::copyTuples(oldLastBlock.get(), tupleIdxInOldLastBlock, oldLastBlock.get(), 0,
+            numTuplesLeftForNewBlock, numBytesPerTuple);
+        blocks.push_back(std::move(oldLastBlock));
+    }
+}
+
+FactorizedTable::FactorizedTable(MemoryManager* memoryManager, FactorizedTableSchema tableSchema)
+    : memoryManager{memoryManager}, tableSchema{std::move(tableSchema)}, numTuples{0} {
+    if (!this->tableSchema.isEmpty()) {
+        inMemOverflowBuffer = std::make_unique<InMemOverflowBuffer>(memoryManager);
+        auto numBytesPerTuple = this->tableSchema.getNumBytesPerTuple();
+        if (numBytesPerTuple > TEMP_PAGE_SIZE) {
+            // I realize it's unlikely to trigger this case because the fixed size part for
+            // a column is always small. A quick calculation, assume average column size is 16 bytes
+            // then we need more than 16K column to test this. I choose to throw exception until
+            // we encounter a use case.
+            throw RuntimeException(
+                "Trying to allocate for a large tuple of size greater than 256KB. "
+                "Allocation is disabled for performance reason.");
+        }
+        flatTupleBlockSize = TEMP_PAGE_SIZE;
+        numFlatTuplesPerBlock = flatTupleBlockSize / numBytesPerTuple;
+        flatTupleBlockCollection =
+            std::make_unique<DataBlockCollection>(numBytesPerTuple, numFlatTuplesPerBlock);
+        unFlatTupleBlockCollection = std::make_unique<DataBlockCollection>();
+    }
+}
+
+FactorizedTable::~FactorizedTable() {
+    if (!preventDestruction) {
+        return;
+    }
+    flatTupleBlockCollection->preventDestruction();
+    unFlatTupleBlockCollection->preventDestruction();
+    inMemOverflowBuffer->preventDestruction();
+}
+
+void FactorizedTable::append(const std::vector<ValueVector*>& vectors) {
+    auto numTuplesToAppend = computeNumTuplesToAppend(vectors);
+    auto appendInfos = allocateFlatTupleBlocks(numTuplesToAppend);
+    for (auto i = 0u; i < vectors.size(); i++) {
+        auto numAppendedTuples = 0ul;
+        for (auto& blockAppendInfo : appendInfos) {
+            copyVectorToColumn(*vectors[i], blockAppendInfo, numAppendedTuples, i);
+            numAppendedTuples += blockAppendInfo.numTuplesToAppend;
+        }
+        KU_ASSERT(numAppendedTuples == numTuplesToAppend);
+    }
+    numTuples += numTuplesToAppend;
+}
+
+void FactorizedTable::resize(uint64_t numTuples) {
+    if (numTuples > this->numTuples) {
+        auto numTuplesToAdd = numTuples - this->numTuples;
+        auto numBytesPerTuple = tableSchema.getNumBytesPerTuple();
+        while (flatTupleBlockCollection->needAllocation(numTuplesToAdd * numBytesPerTuple)) {
+            auto newBlock = std::make_unique<DataBlock>(memoryManager, flatTupleBlockSize);
+            flatTupleBlockCollection->append(std::move(newBlock));
+            auto numTuplesToAddInBlock =
+                std::min(static_cast<uint32_t>(numTuplesToAdd), numFlatTuplesPerBlock);
+            auto block = flatTupleBlockCollection->getLastBlock();
+            block->freeSize -= numBytesPerTuple * numTuplesToAddInBlock;
+            block->numTuples += numTuplesToAddInBlock;
+            numTuplesToAdd -= numTuplesToAddInBlock;
+        }
+        KU_ASSERT(numTuplesToAdd < numFlatTuplesPerBlock);
+        auto block = flatTupleBlockCollection->getLastBlock();
+        block->freeSize -= numBytesPerTuple * numTuplesToAdd;
+        block->numTuples += numTuplesToAdd;
+    } else {
+        auto numTuplesRemaining = numTuples;
+        KU_ASSERT(flatTupleBlockCollection->getBlocks().size() == 1);
+        // TODO: It always adds to the end, so this will leave empty blocks in the middle if it's
+        // reused
+        for (auto& block : flatTupleBlockCollection->getBlocks()) {
+            block->numTuples =
+                std::min(static_cast<uint32_t>(numTuplesRemaining), numFlatTuplesPerBlock);
+            block->freeSize =
+                block->getSizedData().size() - block->numTuples * tableSchema.getNumBytesPerTuple();
+            numTuplesRemaining -= block->numTuples;
+        }
+        KU_ASSERT(numTuplesRemaining == 0);
+    }
+    this->numTuples = numTuples;
+}
+uint8_t* FactorizedTable::appendEmptyTuple() {
+    auto numBytesPerTuple = tableSchema.getNumBytesPerTuple();
+    if (flatTupleBlockCollection->needAllocation(numBytesPerTuple)) {
+        auto newBlock = std::make_unique<DataBlock>(memoryManager, flatTupleBlockSize);
+        flatTupleBlockCollection->append(std::move(newBlock));
+    }
+    auto block = flatTupleBlockCollection->getLastBlock();
+    uint8_t* tuplePtr = block->getWritableData();
+    block->freeSize -= numBytesPerTuple;
+    block->numTuples++;
+    numTuples++;
+    return tuplePtr;
+}
+
+void FactorizedTable::scan(std::span<ValueVector*> vectors, ft_tuple_idx_t tupleIdx,
+    uint64_t numTuplesToScan, std::span<ft_col_idx_t> colIdxesToScan) const {
+    KU_ASSERT(tupleIdx + numTuplesToScan <= numTuples);
+    KU_ASSERT(vectors.size() == colIdxesToScan.size());
+    std::unique_ptr<uint8_t*[]> tuplesToRead = std::make_unique<uint8_t*[]>(numTuplesToScan);
+    for (auto i = 0u; i < numTuplesToScan; i++) {
+        tuplesToRead[i] = getTuple(tupleIdx + i);
+    }
+    lookup(vectors, colIdxesToScan, tuplesToRead.get(), 0 /* startPos */, numTuplesToScan);
+}
+
+void FactorizedTable::lookup(std::span<ValueVector*> vectors,
+    std::span<ft_col_idx_t> colIdxesToScan, uint8_t** tuplesToRead, uint64_t startPos,
+    uint64_t numTuplesToRead) const {
+    KU_ASSERT(vectors.size() == colIdxesToScan.size());
+    for (auto i = 0u; i < colIdxesToScan.size(); i++) {
+        auto vector = vectors[i];
+        // TODO(Xiyang/Ziyi): we should set up a rule about when to reset. Should it be in operator?
+        vector->resetAuxiliaryBuffer();
+        ft_col_idx_t colIdx = colIdxesToScan[i];
+        if (tableSchema.getColumn(colIdx)->isFlat()) {
+            KU_ASSERT(!(vector->state->isFlat() && numTuplesToRead > 1));
+            readFlatCol(tuplesToRead + startPos, colIdx, *vector, numTuplesToRead);
+        } else {
+            // If the caller wants to read an unflat column from factorizedTable, the vector
+            // must be unflat and the numTuplesToScan should be 1.
+            KU_ASSERT(!vector->state->isFlat() && numTuplesToRead == 1);
+            readUnflatCol(tuplesToRead + startPos, colIdx, *vector);
+        }
+    }
+}
+
+void FactorizedTable::lookup(std::vector<ValueVector*>& vectors, const SelectionVector* selVector,
+    std::vector<ft_col_idx_t>& colIdxesToScan, uint8_t* tupleToRead) const {
+    KU_ASSERT(vectors.size() == colIdxesToScan.size());
+    for (auto i = 0u; i < colIdxesToScan.size(); i++) {
+        ft_col_idx_t colIdx = colIdxesToScan[i];
+        if (tableSchema.getColumn(colIdx)->isFlat()) {
+            readFlatCol(&tupleToRead, colIdx, *vectors[i], 1);
+        } else {
+            readUnflatCol(tupleToRead, *selVector, colIdx, *vectors[i]);
+        }
+    }
+}
+
+void FactorizedTable::lookup(std::vector<ValueVector*>& vectors,
+    std::vector<ft_col_idx_t>& colIdxesToScan, std::vector<ft_tuple_idx_t>& tupleIdxesToRead,
+    uint64_t startPos, uint64_t numTuplesToRead) const {
+    KU_ASSERT(vectors.size() == colIdxesToScan.size());
+    auto tuplesToRead = std::make_unique<uint8_t*[]>(tupleIdxesToRead.size());
+    KU_ASSERT(numTuplesToRead > 0);
+    for (auto i = 0u; i < numTuplesToRead; i++) {
+        tuplesToRead[i] = getTuple(tupleIdxesToRead[i + startPos]);
+    }
+    lookup(vectors, colIdxesToScan, tuplesToRead.get(), 0 /* startPos */, numTuplesToRead);
+}
+
+void FactorizedTable::mergeMayContainNulls(FactorizedTable& other) {
+    for (auto i = 0u; i < other.tableSchema.getNumColumns(); i++) {
+        if (!other.hasNoNullGuarantee(i)) {
+            tableSchema.setMayContainsNullsToTrue(i);
+        }
+    }
+}
+
+void FactorizedTable::merge(FactorizedTable& other) {
+    KU_ASSERT(tableSchema == other.tableSchema);
+    if (other.numTuples == 0) {
+        return;
+    }
+    mergeMayContainNulls(other);
+    unFlatTupleBlockCollection->append(std::move(other.unFlatTupleBlockCollection));
+    flatTupleBlockCollection->merge(*other.flatTupleBlockCollection);
+    inMemOverflowBuffer->merge(*other.inMemOverflowBuffer);
+    numTuples += other.numTuples;
+}
+
+bool FactorizedTable::hasUnflatCol() const {
+    std::vector<ft_col_idx_t> colIdxes(tableSchema.getNumColumns());
+    iota(colIdxes.begin(), colIdxes.end(), 0);
+    return hasUnflatCol(colIdxes);
+}
+
+uint64_t FactorizedTable::getTotalNumFlatTuples() const {
+    auto totalNumFlatTuples = 0ul;
+    for (auto i = 0u; i < getNumTuples(); i++) {
+        totalNumFlatTuples += getNumFlatTuples(i);
+    }
+    return totalNumFlatTuples;
+}
+
+uint64_t FactorizedTable::getNumFlatTuples(ft_tuple_idx_t tupleIdx) const {
+    std::unordered_map<uint32_t, bool> calculatedGroups;
+    uint64_t numFlatTuples = 1;
+    auto tupleBuffer = getTuple(tupleIdx);
+    for (auto i = 0u; i < tableSchema.getNumColumns(); i++) {
+        auto column = tableSchema.getColumn(i);
+        auto groupID = column->getGroupID();
+        if (!calculatedGroups.contains(groupID)) {
+            calculatedGroups[groupID] = true;
+            numFlatTuples *= column->isFlat() ? 1 : ((overflow_value_t*)tupleBuffer)->numElements;
+        }
+        tupleBuffer += column->getNumBytes();
+    }
+    return numFlatTuples;
+}
+
+uint8_t* FactorizedTable::getTuple(ft_tuple_idx_t tupleIdx) const {
+    KU_ASSERT(tupleIdx < numTuples);
+    auto [blockIdx, tupleIdxInBlock] = getBlockIdxAndTupleIdxInBlock(tupleIdx);
+    auto buffer = flatTupleBlockCollection->getBlock(blockIdx)->getSizedData();
+    // Check that the end of the block doesn't overflow the buffer
+    KU_ASSERT((tupleIdxInBlock + 1) * tableSchema.getNumBytesPerTuple() <= buffer.size());
+    return buffer.data() + tupleIdxInBlock * tableSchema.getNumBytesPerTuple();
+}
+
+void FactorizedTable::updateFlatCell(uint8_t* tuplePtr, ft_col_idx_t colIdx,
+    ValueVector* valueVector, uint32_t pos) {
+    auto nullBuffer = tuplePtr + tableSchema.getNullMapOffset();
+    if (valueVector->isNull(pos)) {
+        setNonOverflowColNull(nullBuffer, colIdx);
+    } else {
+        valueVector->copyToRowData(pos, tuplePtr + tableSchema.getColOffset(colIdx),
+            inMemOverflowBuffer.get());
+        NullBuffer::setNoNull(nullBuffer, colIdx);
+    }
+}
+
+bool FactorizedTable::isOverflowColNull(const uint8_t* nullBuffer, ft_tuple_idx_t tupleIdx,
+    ft_col_idx_t colIdx) const {
+    KU_ASSERT(colIdx < tableSchema.getNumColumns());
+    if (tableSchema.getColumn(colIdx)->hasNoNullGuarantee()) {
+        return false;
+    }
+    return NullBuffer::isNull(nullBuffer, tupleIdx);
+}
+
+bool FactorizedTable::isNonOverflowColNull(const uint8_t* nullBuffer, ft_col_idx_t colIdx) const {
+    KU_ASSERT(colIdx < tableSchema.getNumColumns());
+    if (tableSchema.getColumn(colIdx)->hasNoNullGuarantee()) {
+        return false;
+    }
+    return NullBuffer::isNull(nullBuffer, colIdx);
+}
+
+bool FactorizedTable::isNonOverflowColNull(ft_tuple_idx_t tupleIdx, ft_col_idx_t colIdx) const {
+    KU_ASSERT(colIdx < tableSchema.getNumColumns());
+    if (tableSchema.getColumn(colIdx)->hasNoNullGuarantee()) {
+        return false;
+    }
+    return NullBuffer::isNull(getTuple(tupleIdx) + tableSchema.getNullMapOffset(), colIdx);
+}
+
+void FactorizedTable::setNonOverflowColNull(uint8_t* nullBuffer, ft_col_idx_t colIdx) {
+    NullBuffer::setNull(nullBuffer, colIdx);
+    tableSchema.setMayContainsNullsToTrue(colIdx);
+}
+
+void FactorizedTable::clear() {
+    numTuples = 0;
+    flatTupleBlockCollection = std::make_unique<DataBlockCollection>(
+        tableSchema.getNumBytesPerTuple(), numFlatTuplesPerBlock);
+    unFlatTupleBlockCollection = std::make_unique<DataBlockCollection>();
+    inMemOverflowBuffer->resetBuffer();
+}
+
+void FactorizedTable::setOverflowColNull(uint8_t* nullBuffer, ft_col_idx_t colIdx,
+    ft_tuple_idx_t tupleIdx) {
+    NullBuffer::setNull(nullBuffer, tupleIdx);
+    tableSchema.setMayContainsNullsToTrue(colIdx);
+}
+
+// TODO(Guodong): change this function to not use dataChunkPos in ColumnSchema.
+uint64_t FactorizedTable::computeNumTuplesToAppend(
+    const std::vector<ValueVector*>& vectorsToAppend) const {
+    KU_ASSERT(!vectorsToAppend.empty());
+    auto numTuplesToAppend = 1ul;
+    for (auto i = 0u; i < vectorsToAppend.size(); i++) {
+        // If the caller tries to append an unflat vector to a flat column in the
+        // factorizedTable, the factorizedTable needs to flatten that vector.
+        if (tableSchema.getColumn(i)->isFlat() && !vectorsToAppend[i]->state->isFlat()) {
+            // The caller is not allowed to append multiple unFlat columns from different
+            // datachunks to multiple flat columns in the factorizedTable.
+            numTuplesToAppend = vectorsToAppend[i]->state->getSelVector().getSelSize();
+        }
+    }
+    return numTuplesToAppend;
+}
+
+std::vector<BlockAppendingInfo> FactorizedTable::allocateFlatTupleBlocks(
+    uint64_t numTuplesToAppend) {
+    auto numBytesPerTuple = tableSchema.getNumBytesPerTuple();
+    std::vector<BlockAppendingInfo> appendingInfos;
+    while (numTuplesToAppend > 0) {
+        if (flatTupleBlockCollection->needAllocation(numBytesPerTuple)) {
+            auto newBlock = std::make_unique<DataBlock>(memoryManager, flatTupleBlockSize);
+            flatTupleBlockCollection->append(std::move(newBlock));
+        }
+        auto block = flatTupleBlockCollection->getLastBlock();
+        auto numTuplesToAppendInCurBlock =
+            std::min(numTuplesToAppend, block->freeSize / numBytesPerTuple);
+        appendingInfos.emplace_back(block->getWritableData(), numTuplesToAppendInCurBlock);
+        block->freeSize -= numTuplesToAppendInCurBlock * numBytesPerTuple;
+        block->numTuples += numTuplesToAppendInCurBlock;
+        numTuplesToAppend -= numTuplesToAppendInCurBlock;
+    }
+    return appendingInfos;
+}
+
+uint64_t getDataBlockSize(uint32_t numBytes) {
+    if (numBytes < TEMP_PAGE_SIZE) {
+        return TEMP_PAGE_SIZE;
+    }
+    return numBytes + 1;
+}
+
+uint8_t* FactorizedTable::allocateUnflatTupleBlock(uint32_t numBytes) {
+    if (unFlatTupleBlockCollection->isEmpty()) {
+        auto newBlock = std::make_unique<DataBlock>(memoryManager, getDataBlockSize(numBytes));
+        unFlatTupleBlockCollection->append(std::move(newBlock));
+    }
+    auto lastBlock = unFlatTupleBlockCollection->getLastBlock();
+    if (lastBlock->freeSize > numBytes) {
+        auto writableData = lastBlock->getWritableData();
+        lastBlock->freeSize -= numBytes;
+        return writableData;
+    }
+    auto newBlock = std::make_unique<DataBlock>(memoryManager, getDataBlockSize(numBytes));
+    unFlatTupleBlockCollection->append(std::move(newBlock));
+    lastBlock = unFlatTupleBlockCollection->getLastBlock();
+    lastBlock->freeSize -= numBytes;
+    return lastBlock->getData();
+}
+
+void FactorizedTable::copyFlatVectorToFlatColumn(const ValueVector& vector,
+    const BlockAppendingInfo& blockAppendInfo, ft_col_idx_t colIdx) {
+    auto valuePositionInVectorToAppend = vector.state->getSelVector()[0];
+    auto colOffsetInDataBlock = tableSchema.getColOffset(colIdx);
+    auto dstDataPtr = blockAppendInfo.data;
+    for (auto i = 0u; i < blockAppendInfo.numTuplesToAppend; i++) {
+        if (vector.isNull(valuePositionInVectorToAppend)) {
+            setNonOverflowColNull(dstDataPtr + tableSchema.getNullMapOffset(), colIdx);
+        } else {
+            vector.copyToRowData(valuePositionInVectorToAppend, dstDataPtr + colOffsetInDataBlock,
+                inMemOverflowBuffer.get());
+        }
+        dstDataPtr += tableSchema.getNumBytesPerTuple();
+    }
+}
+
+void FactorizedTable::copyUnflatVectorToFlatColumn(const ValueVector& vector,
+    const BlockAppendingInfo& blockAppendInfo, uint64_t numAppendedTuples, ft_col_idx_t colIdx) {
+    auto byteOffsetOfColumnInTuple = tableSchema.getColOffset(colIdx);
+    auto dstTuple = blockAppendInfo.data;
+    if (vector.state->getSelVector().isUnfiltered()) {
+        if (vector.hasNoNullsGuarantee()) {
+            for (auto i = 0u; i < blockAppendInfo.numTuplesToAppend; i++) {
+                vector.copyToRowData(numAppendedTuples + i, dstTuple + byteOffsetOfColumnInTuple,
+                    inMemOverflowBuffer.get());
+                dstTuple += tableSchema.getNumBytesPerTuple();
+            }
+        } else {
+            for (auto i = 0u; i < blockAppendInfo.numTuplesToAppend; i++) {
+                if (vector.isNull(numAppendedTuples + i)) {
+                    setNonOverflowColNull(dstTuple + tableSchema.getNullMapOffset(), colIdx);
+                } else {
+                    vector.copyToRowData(numAppendedTuples + i,
+                        dstTuple + byteOffsetOfColumnInTuple, inMemOverflowBuffer.get());
+                }
+                dstTuple += tableSchema.getNumBytesPerTuple();
+            }
+        }
+    } else {
+        if (vector.hasNoNullsGuarantee()) {
+            for (auto i = 0u; i < blockAppendInfo.numTuplesToAppend; i++) {
+                vector.copyToRowData(vector.state->getSelVector()[numAppendedTuples + i],
+                    dstTuple + byteOffsetOfColumnInTuple, inMemOverflowBuffer.get());
+                dstTuple += tableSchema.getNumBytesPerTuple();
+            }
+        } else {
+            for (auto i = 0u; i < blockAppendInfo.numTuplesToAppend; i++) {
+                auto pos = vector.state->getSelVector()[numAppendedTuples + i];
+                if (vector.isNull(pos)) {
+                    setNonOverflowColNull(dstTuple + tableSchema.getNullMapOffset(), colIdx);
+                } else {
+                    vector.copyToRowData(pos, dstTuple + byteOffsetOfColumnInTuple,
+                        inMemOverflowBuffer.get());
+                }
+                dstTuple += tableSchema.getNumBytesPerTuple();
+            }
+        }
+    }
+}
+
+// For an unflat column, only an unflat vector is allowed to copy from, for the column, we only
+// store an overflow_value_t, which contains a pointer to the overflow dataBlock in the
+// factorizedTable. NullMasks are stored inside the overflow buffer.
+void FactorizedTable::copyVectorToUnflatColumn(const ValueVector& vector,
+    const BlockAppendingInfo& blockAppendInfo, ft_col_idx_t colIdx) {
+    KU_ASSERT(!vector.state->isFlat());
+    auto unflatTupleValue = appendVectorToUnflatTupleBlocks(vector, colIdx);
+    auto blockPtr = blockAppendInfo.data + tableSchema.getColOffset(colIdx);
+    for (auto i = 0u; i < blockAppendInfo.numTuplesToAppend; i++) {
+        memcpy(blockPtr, (uint8_t*)&unflatTupleValue, sizeof(overflow_value_t));
+        blockPtr += tableSchema.getNumBytesPerTuple();
+    }
+}
+
+void FactorizedTable::copyVectorToColumn(const ValueVector& vector,
+    const BlockAppendingInfo& blockAppendInfo, uint64_t numAppendedTuples, ft_col_idx_t colIdx) {
+    if (tableSchema.getColumn(colIdx)->isFlat()) {
+        copyVectorToFlatColumn(vector, blockAppendInfo, numAppendedTuples, colIdx);
+    } else {
+        copyVectorToUnflatColumn(vector, blockAppendInfo, colIdx);
+    }
+}
+
+overflow_value_t FactorizedTable::appendVectorToUnflatTupleBlocks(const ValueVector& vector,
+    ft_col_idx_t colIdx) {
+    KU_ASSERT(!vector.state->isFlat());
+    auto numFlatTuplesInVector = vector.state->getSelVector().getSelSize();
+    auto numBytesPerValue = LogicalTypeUtils::getRowLayoutSize(vector.dataType);
+    auto numBytesForData = numBytesPerValue * numFlatTuplesInVector;
+    auto overflowBlockBuffer = allocateUnflatTupleBlock(
+        numBytesForData + NullBuffer::getNumBytesForNullValues(numFlatTuplesInVector));
+    if (vector.state->getSelVector().isUnfiltered()) {
+        if (vector.hasNoNullsGuarantee()) {
+            auto dstDataBuffer = overflowBlockBuffer;
+            for (auto i = 0u; i < numFlatTuplesInVector; i++) {
+                vector.copyToRowData(i, dstDataBuffer, inMemOverflowBuffer.get());
+                dstDataBuffer += numBytesPerValue;
+            }
+        } else {
+            auto dstDataBuffer = overflowBlockBuffer;
+            for (auto i = 0u; i < numFlatTuplesInVector; i++) {
+                if (vector.isNull(i)) {
+                    setOverflowColNull(overflowBlockBuffer + numBytesForData, colIdx, i);
+                } else {
+                    vector.copyToRowData(i, dstDataBuffer, inMemOverflowBuffer.get());
+                }
+                dstDataBuffer += numBytesPerValue;
+            }
+        }
+    } else {
+        if (vector.hasNoNullsGuarantee()) {
+            auto dstDataBuffer = overflowBlockBuffer;
+            for (auto i = 0u; i < numFlatTuplesInVector; i++) {
+                vector.copyToRowData(vector.state->getSelVector()[i], dstDataBuffer,
+                    inMemOverflowBuffer.get());
+                dstDataBuffer += numBytesPerValue;
+            }
+        } else {
+            auto dstDataBuffer = overflowBlockBuffer;
+            for (auto i = 0u; i < numFlatTuplesInVector; i++) {
+                auto pos = vector.state->getSelVector()[i];
+                if (vector.isNull(pos)) {
+                    setOverflowColNull(overflowBlockBuffer + numBytesForData, colIdx, i);
+                } else {
+                    vector.copyToRowData(pos, dstDataBuffer, inMemOverflowBuffer.get());
+                }
+                dstDataBuffer += numBytesPerValue;
+            }
+        }
+    }
+    return overflow_value_t{numFlatTuplesInVector, overflowBlockBuffer};
+}
+
+void FactorizedTable::readUnflatCol(uint8_t** tuplesToRead, ft_col_idx_t colIdx,
+    ValueVector& vector) const {
+    auto overflowColValue =
+        *(overflow_value_t*)(tuplesToRead[0] + tableSchema.getColOffset(colIdx));
+    KU_ASSERT(vector.state->getSelVector().isUnfiltered());
+    auto numBytesPerValue = LogicalTypeUtils::getRowLayoutSize(vector.dataType);
+    if (hasNoNullGuarantee(colIdx)) {
+        vector.setAllNonNull();
+        auto val = overflowColValue.value;
+        for (auto i = 0u; i < overflowColValue.numElements; i++) {
+            vector.copyFromRowData(i, val);
+            val += numBytesPerValue;
+        }
+    } else {
+        auto overflowColNullData =
+            overflowColValue.value + overflowColValue.numElements * numBytesPerValue;
+        auto overflowColData = overflowColValue.value;
+        for (auto i = 0u; i < overflowColValue.numElements; i++) {
+            if (isOverflowColNull(overflowColNullData, i, colIdx)) {
+                vector.setNull(i, true);
+            } else {
+                vector.setNull(i, false);
+                vector.copyFromRowData(i, overflowColData);
+            }
+            overflowColData += numBytesPerValue;
+        }
+    }
+    vector.state->getSelVectorUnsafe().setSelSize(overflowColValue.numElements);
+}
+
+void FactorizedTable::readUnflatCol(const uint8_t* tupleToRead, const SelectionVector& selVector,
+    ft_col_idx_t colIdx, ValueVector& vector) const {
+    auto vectorOverflowValue = *(overflow_value_t*)(tupleToRead + tableSchema.getColOffset(colIdx));
+    KU_ASSERT(vector.state->getSelVector().isUnfiltered());
+    if (hasNoNullGuarantee(colIdx)) {
+        vector.setAllNonNull();
+        auto val = vectorOverflowValue.value;
+        for (auto i = 0u; i < vectorOverflowValue.numElements; i++) {
+            auto pos = selVector[i];
+            vector.copyFromRowData(i, val + (pos * vector.getNumBytesPerValue()));
+        }
+    } else {
+        for (auto i = 0u; i < vectorOverflowValue.numElements; i++) {
+            auto pos = selVector[i];
+            if (isOverflowColNull(vectorOverflowValue.value + vectorOverflowValue.numElements *
+                                                                  vector.getNumBytesPerValue(),
+                    pos, colIdx)) {
+                vector.setNull(i, true);
+            } else {
+                vector.setNull(i, false);
+                vector.copyFromRowData(i,
+                    vectorOverflowValue.value + pos * vector.getNumBytesPerValue());
+            }
+        }
+    }
+    vector.state->getSelVectorUnsafe().setSelSize(selVector.getSelSize());
+}
+
+void FactorizedTable::readFlatColToFlatVector(uint8_t* tupleToRead, ft_col_idx_t colIdx,
+    ValueVector& vector, sel_t pos) const {
+    if (isNonOverflowColNull(tupleToRead + tableSchema.getNullMapOffset(), colIdx)) {
+        vector.setNull(pos, true);
+    } else {
+        vector.setNull(pos, false);
+        vector.copyFromRowData(pos, tupleToRead + tableSchema.getColOffset(colIdx));
+    }
+}
+
+void FactorizedTable::readFlatCol(uint8_t** tuplesToRead, ft_col_idx_t colIdx, ValueVector& vector,
+    uint64_t numTuplesToRead) const {
+    if (vector.state->isFlat()) {
+        auto pos = vector.state->getSelVector()[0];
+        readFlatColToFlatVector(tuplesToRead[0], colIdx, vector, pos);
+    } else {
+        readFlatColToUnflatVector(tuplesToRead, colIdx, vector, numTuplesToRead);
+    }
+}
+
+void FactorizedTable::readFlatColToUnflatVector(uint8_t** tuplesToRead, ft_col_idx_t colIdx,
+    ValueVector& vector, uint64_t numTuplesToRead) const {
+    vector.state->getSelVectorUnsafe().setSelSize(numTuplesToRead);
+    if (hasNoNullGuarantee(colIdx)) {
+        vector.setAllNonNull();
+        for (auto i = 0u; i < numTuplesToRead; i++) {
+            auto positionInVectorToWrite = vector.state->getSelVector()[i];
+            auto srcData = tuplesToRead[i] + tableSchema.getColOffset(colIdx);
+            vector.copyFromRowData(positionInVectorToWrite, srcData);
+        }
+    } else {
+        for (auto i = 0u; i < numTuplesToRead; i++) {
+            auto positionInVectorToWrite = vector.state->getSelVector()[i];
+            auto dataBuffer = tuplesToRead[i];
+            if (isNonOverflowColNull(dataBuffer + tableSchema.getNullMapOffset(), colIdx)) {
+                vector.setNull(positionInVectorToWrite, true);
+            } else {
+                vector.setNull(positionInVectorToWrite, false);
+                vector.copyFromRowData(positionInVectorToWrite,
+                    dataBuffer + tableSchema.getColOffset(colIdx));
+            }
+        }
+    }
+}
+
+FactorizedTableIterator::FactorizedTableIterator(FactorizedTable& factorizedTable)
+    : factorizedTable{factorizedTable}, currentTupleBuffer{nullptr}, numFlatTuples{0},
+      nextFlatTupleIdx{0}, nextTupleIdx{1} {
+    resetState();
+}
+
+void FactorizedTableIterator::getNext(FlatTuple& tuple) {
+    // Go to the next tuple if we have iterated all the flat tuples of the current tuple.
+    if (nextFlatTupleIdx >= numFlatTuples) {
+        currentTupleBuffer = factorizedTable.getTuple(nextTupleIdx);
+        numFlatTuples = factorizedTable.getNumFlatTuples(nextTupleIdx);
+        nextFlatTupleIdx = 0;
+        updateNumElementsInDataChunk();
+        nextTupleIdx++;
+    }
+    for (auto i = 0ul; i < factorizedTable.getTableSchema()->getNumColumns(); i++) {
+        auto column = factorizedTable.getTableSchema()->getColumn(i);
+        if (column->isFlat()) {
+            readFlatColToFlatTuple(i, currentTupleBuffer, tuple);
+        } else {
+            readUnflatColToFlatTuple(i, currentTupleBuffer, tuple);
+        }
+    }
+    updateFlatTuplePositionsInDataChunk();
+    nextFlatTupleIdx++;
+}
+
+void FactorizedTableIterator::resetState() {
+    numFlatTuples = 0;
+    nextFlatTupleIdx = 0;
+    nextTupleIdx = 1;
+    if (factorizedTable.getNumTuples()) {
+        currentTupleBuffer = factorizedTable.getTuple(0);
+        numFlatTuples = factorizedTable.getNumFlatTuples(0);
+        updateNumElementsInDataChunk();
+        updateInvalidEntriesInFlatTuplePositionsInDataChunk();
+    }
+}
+
+void FactorizedTableIterator::readUnflatColToFlatTuple(ft_col_idx_t colIdx, uint8_t* valueBuffer,
+    FlatTuple& tuple) {
+    auto overflowValue =
+        (overflow_value_t*)(valueBuffer + factorizedTable.getTableSchema()->getColOffset(colIdx));
+    auto groupID = factorizedTable.getTableSchema()->getColumn(colIdx)->getGroupID();
+    auto tupleSizeInOverflowBuffer =
+        LogicalTypeUtils::getRowLayoutSize(tuple[colIdx].getDataType());
+    valueBuffer = overflowValue->value +
+                  tupleSizeInOverflowBuffer * flatTuplePositionsInDataChunk[groupID].first;
+    auto isNull = factorizedTable.isOverflowColNull(
+        overflowValue->value + tupleSizeInOverflowBuffer * overflowValue->numElements,
+        flatTuplePositionsInDataChunk[groupID].first, colIdx);
+    tuple[colIdx].setNull(isNull);
+    if (!isNull) {
+        tuple[colIdx].copyFromRowLayout(valueBuffer);
+    }
+}
+
+void FactorizedTableIterator::readFlatColToFlatTuple(ft_col_idx_t colIdx, uint8_t* valueBuffer,
+    FlatTuple& tuple) {
+    auto isNull = factorizedTable.isNonOverflowColNull(
+        valueBuffer + factorizedTable.getTableSchema()->getNullMapOffset(), colIdx);
+    tuple[colIdx].setNull(isNull);
+    if (!isNull) {
+        tuple[colIdx].copyFromRowLayout(
+            valueBuffer + factorizedTable.getTableSchema()->getColOffset(colIdx));
+    }
+}
+
+void FactorizedTableIterator::updateInvalidEntriesInFlatTuplePositionsInDataChunk() {
+    for (auto i = 0u; i < flatTuplePositionsInDataChunk.size(); i++) {
+        bool isValidEntry = false;
+        for (auto j = 0u; j < factorizedTable.getTableSchema()->getNumColumns(); j++) {
+            if (factorizedTable.getTableSchema()->getColumn(j)->getGroupID() == i) {
+                isValidEntry = true;
+                break;
+            }
+        }
+        if (!isValidEntry) {
+            flatTuplePositionsInDataChunk[i] = std::make_pair(UINT64_MAX, UINT64_MAX);
+        }
+    }
+}
+
+void FactorizedTableIterator::updateNumElementsInDataChunk() {
+    auto colOffsetInTupleBuffer = 0ul;
+    for (auto i = 0u; i < factorizedTable.getTableSchema()->getNumColumns(); i++) {
+        auto column = factorizedTable.getTableSchema()->getColumn(i);
+        auto groupID = column->getGroupID();
+        // If this is an unflat column, the number of elements is stored in the
+        // overflow_value_t struct. Otherwise, the number of elements is 1.
+        auto numElementsInDataChunk =
+            column->isFlat() ?
+                1 :
+                ((overflow_value_t*)(currentTupleBuffer + colOffsetInTupleBuffer))->numElements;
+        if (groupID >= flatTuplePositionsInDataChunk.size()) {
+            flatTuplePositionsInDataChunk.resize(groupID + 1);
+        }
+        flatTuplePositionsInDataChunk[groupID] =
+            std::make_pair(0 /* nextIdxToReadInDataChunk */, numElementsInDataChunk);
+        colOffsetInTupleBuffer += column->getNumBytes();
+    }
+}
+
+void FactorizedTableIterator::updateFlatTuplePositionsInDataChunk() {
+    for (auto i = 0u; i < flatTuplePositionsInDataChunk.size(); i++) {
+        if (!isValidDataChunkPos(i)) {
+            continue;
+        }
+        flatTuplePositionsInDataChunk.at(i).first++;
+        // If we have output all elements in the current column, we reset the
+        // nextIdxToReadInDataChunk in the current column to 0.
+        if (flatTuplePositionsInDataChunk.at(i).first >=
+            flatTuplePositionsInDataChunk.at(i).second) {
+            flatTuplePositionsInDataChunk.at(i).first = 0;
+        } else {
+            // If the current dataChunk is not full, then we don't need to update the next
+            // dataChunk.
+            break;
+        }
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table_pool.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table_pool.cpp
new file mode 100644
index 0000000000..afa313815b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table_pool.cpp
@@ -0,0 +1,31 @@
+#include "processor/result/factorized_table_pool.h"
+
+namespace lbug {
+namespace processor {
+
+FactorizedTable* FactorizedTablePool::claimLocalTable(storage::MemoryManager* mm) {
+    std::unique_lock<std::mutex> lck{mtx};
+    if (availableLocalTables.empty()) {
+        auto table = std::make_shared<FactorizedTable>(mm, globalTable->getTableSchema()->copy());
+        localTables.push_back(table);
+        availableLocalTables.push(table.get());
+    }
+    auto result = availableLocalTables.top();
+    availableLocalTables.pop();
+    return result;
+}
+
+void FactorizedTablePool::returnLocalTable(FactorizedTable* table) {
+    std::unique_lock<std::mutex> lck{mtx};
+    availableLocalTables.push(table);
+}
+
+void FactorizedTablePool::mergeLocalTables() {
+    std::unique_lock<std::mutex> lck{mtx};
+    for (auto& localTable : localTables) {
+        globalTable->merge(*localTable);
+    }
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table_schema.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table_schema.cpp
new file mode 100644
index 0000000000..c92cc2475e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table_schema.cpp
@@ -0,0 +1,66 @@
+#include "processor/result/factorized_table_schema.h"
+
+#include "common/null_buffer.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+ColumnSchema::ColumnSchema(const ColumnSchema& other) {
+    isUnFlat = other.isUnFlat;
+    groupID = other.groupID;
+    numBytes = other.numBytes;
+    mayContainNulls = other.mayContainNulls;
+}
+
+FactorizedTableSchema::FactorizedTableSchema(const FactorizedTableSchema& other) {
+    for (auto i = 0u; i < other.columns.size(); ++i) {
+        appendColumn(other.columns[i].copy());
+    }
+}
+
+void FactorizedTableSchema::appendColumn(ColumnSchema column) {
+    numBytesForDataPerTuple += column.getNumBytes();
+    columns.push_back(std::move(column));
+    colOffsets.push_back(
+        colOffsets.empty() ? 0 : colOffsets.back() + getColumn(columns.size() - 2)->getNumBytes());
+    numBytesForNullMapPerTuple = NullBuffer::getNumBytesForNullValues(getNumColumns());
+    numBytesPerTuple = numBytesForDataPerTuple + numBytesForNullMapPerTuple;
+}
+
+bool FactorizedTableSchema::operator==(const FactorizedTableSchema& other) const {
+    if (columns.size() != other.columns.size()) {
+        return false;
+    }
+    for (auto i = 0u; i < columns.size(); i++) {
+        if (columns[i] != other.columns[i]) {
+            return false;
+        }
+    }
+    return numBytesForDataPerTuple == other.numBytesForDataPerTuple && numBytesForNullMapPerTuple &&
+           other.numBytesForNullMapPerTuple;
+}
+
+uint64_t FactorizedTableSchema::getNumFlatColumns() const {
+    auto numFlatColumns = 0u;
+    for (auto& column : columns) {
+        if (column.isFlat()) {
+            numFlatColumns++;
+        }
+    }
+    return numFlatColumns;
+}
+
+uint64_t FactorizedTableSchema::getNumUnFlatColumns() const {
+    auto numUnflatColumns = 0u;
+    for (auto& column : columns) {
+        if (!column.isFlat()) {
+            numUnflatColumns++;
+        }
+    }
+    return numUnflatColumns;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table_util.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table_util.cpp
new file mode 100644
index 0000000000..da7b7ac3af
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/factorized_table_util.cpp
@@ -0,0 +1,70 @@
+#include "processor/result/factorized_table_util.h"
+
+using namespace lbug::storage;
+using namespace lbug::common;
+using namespace lbug::binder;
+using namespace lbug::planner;
+
+namespace lbug {
+namespace processor {
+
+FactorizedTableSchema FactorizedTableUtils::createFTableSchema(const expression_vector& exprs,
+    const Schema& schema) {
+    auto tableSchema = FactorizedTableSchema();
+    std::unordered_set<common::idx_t> groupIDSet;
+    for (auto& e : exprs) {
+        auto groupPos = schema.getExpressionPos(*e).first;
+        auto group = schema.getGroup(groupPos);
+        if (group->isFlat()) {
+            auto column =
+                ColumnSchema(false, groupPos, LogicalTypeUtils::getRowLayoutSize(e->getDataType()));
+            tableSchema.appendColumn(std::move(column));
+        } else {
+            auto column = ColumnSchema(true, groupPos, (uint32_t)sizeof(overflow_value_t));
+            tableSchema.appendColumn(std::move(column));
+        }
+    }
+    return tableSchema;
+}
+
+FactorizedTableSchema FactorizedTableUtils::createFlatTableSchema(
+    std::vector<LogicalType> columnTypes) {
+    auto tableSchema = FactorizedTableSchema();
+    for (auto& type : columnTypes) {
+        auto column = ColumnSchema(false /* isUnFlat */, 0 /* groupID */,
+            LogicalTypeUtils::getRowLayoutSize(type));
+        tableSchema.appendColumn(std::move(column));
+    }
+    return tableSchema;
+}
+
+void FactorizedTableUtils::appendStringToTable(FactorizedTable* factorizedTable,
+    const std::string& outputMsg, MemoryManager* memoryManager) {
+    auto outputMsgVector = std::make_shared<ValueVector>(LogicalTypeID::STRING, memoryManager);
+    outputMsgVector->state = DataChunkState::getSingleValueDataChunkState();
+    auto outputKUStr = ku_string_t();
+    outputKUStr.overflowPtr =
+        reinterpret_cast<uint64_t>(StringVector::getInMemOverflowBuffer(outputMsgVector.get())
+                                       ->allocateSpace(outputMsg.length()));
+    outputKUStr.set(outputMsg);
+    outputMsgVector->setValue(0, outputKUStr);
+    factorizedTable->append(std::vector<ValueVector*>{outputMsgVector.get()});
+}
+
+std::shared_ptr<FactorizedTable> FactorizedTableUtils::getFactorizedTableForOutputMsg(
+    const std::string& outputMsg, MemoryManager* memoryManager) {
+    auto table = getSingleStringColumnFTable(memoryManager);
+    appendStringToTable(table.get(), outputMsg, memoryManager);
+    return table;
+}
+
+std::shared_ptr<FactorizedTable> FactorizedTableUtils::getSingleStringColumnFTable(
+    MemoryManager* mm) {
+    std::vector<LogicalType> typeVec;
+    typeVec.push_back(LogicalType::STRING());
+    auto fTableSchema = createFlatTableSchema(std::move(typeVec));
+    return std::make_shared<FactorizedTable>(mm, std::move(fTableSchema));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/flat_tuple.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/flat_tuple.cpp
new file mode 100644
index 0000000000..04d7d7d9e1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/flat_tuple.cpp
@@ -0,0 +1,99 @@
+#include "processor/result/flat_tuple.h"
+
+#include <sstream>
+
+#include "common/exception/runtime.h"
+#include "common/string_format.h"
+#include "common/types/value/value.h"
+#include "utf8proc.h"
+#include "utf8proc_wrapper.h"
+
+using namespace lbug::utf8proc;
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+FlatTuple::FlatTuple(const std::vector<LogicalType>& types) {
+    for (auto& type : types) {
+        values.emplace_back(Value::createDefaultValue(type));
+    }
+}
+
+uint32_t FlatTuple::len() const {
+    return values.size();
+}
+
+static void checkOutOfRange(idx_t idx, idx_t size) {
+    if (idx >= size) {
+        throw RuntimeException(stringFormat(
+            "ValIdx is out of range. Number of values in flatTuple: {}, valIdx: {}.", size, idx));
+    }
+}
+
+Value* FlatTuple::getValue(uint32_t idx) {
+    checkOutOfRange(idx, len());
+    return &values[idx];
+}
+
+Value& FlatTuple::operator[](idx_t idx) {
+    checkOutOfRange(idx, len());
+    return values[idx];
+}
+
+const Value& FlatTuple::operator[](idx_t idx) const {
+    checkOutOfRange(idx, len());
+    return values[idx];
+}
+
+std::string FlatTuple::toString() const {
+    std::string result;
+    for (auto i = 0ul; i < values.size(); i++) {
+        if (i != 0) {
+            result += "|";
+        }
+        result += values[i].toString();
+    }
+    result += "\n";
+    return result;
+}
+
+std::string FlatTuple::toString(const std::vector<uint32_t>& colsWidth,
+    const std::string& delimiter, const uint32_t maxWidth) {
+    std::ostringstream result;
+    for (auto i = 0ul; i < values.size(); i++) {
+        auto value = values[i].toString();
+        auto fieldLen = 0u;
+        auto cutoff = 0u, cutoffLen = 0u;
+        for (auto iter = 0u; iter < value.length();) {
+            auto width = Utf8Proc::renderWidth(value.c_str(), iter);
+            if (fieldLen + 3 > maxWidth && cutoff == 0) {
+                cutoff = iter;
+                cutoffLen = fieldLen;
+            }
+            fieldLen += width;
+            iter = utf8proc_next_grapheme(value.c_str(), value.length(), iter);
+        }
+        if (fieldLen > maxWidth) {
+            value = value.substr(0, cutoff) + "...";
+            fieldLen = cutoffLen + 3;
+        }
+        if (colsWidth[i] != 0) {
+            value = " " + std::move(value) + " ";
+            fieldLen += 2;
+        }
+        fieldLen = std::min(fieldLen, maxWidth + 2);
+        if (colsWidth[i] != 0) {
+            result << value << std::string(colsWidth[i] - fieldLen, ' ');
+        } else {
+            result << value;
+        }
+        if (i != values.size() - 1) {
+            result << delimiter;
+        }
+    }
+    return result.str();
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/pattern_creation_info_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/pattern_creation_info_table.cpp
new file mode 100644
index 0000000000..376ae3ffaf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/pattern_creation_info_table.cpp
@@ -0,0 +1,57 @@
+#include "processor/result/pattern_creation_info_table.h"
+
+namespace lbug {
+namespace processor {
+
+void PatternCreationInfo::updateID(common::executor_id_t executorID,
+    common::executor_info executorInfo, common::nodeID_t nodeID) const {
+    if (!executorInfo.contains(executorID)) {
+        return;
+    }
+    auto ftColIndex = executorInfo.at(executorID);
+    *(common::nodeID_t*)(tuple + ftColIndex * sizeof(common::nodeID_t)) = nodeID;
+}
+
+PatternCreationInfoTable::PatternCreationInfoTable(storage::MemoryManager& memoryManager,
+    std::vector<common::LogicalType> keyTypes, FactorizedTableSchema tableSchema)
+    : AggregateHashTable{memoryManager, copyVector(keyTypes), std::vector<common::LogicalType>{},
+          std::vector<function::AggregateFunction>{} /* empty aggregates */,
+          std::vector<common::LogicalType>{} /* empty distinct agg key*/,
+          0 /* numEntriesToAllocate */, tableSchema.copy()},
+      tuple{nullptr}, idColOffset{tableSchema.getColOffset(keyTypes.size())} {}
+
+PatternCreationInfo PatternCreationInfoTable::getPatternCreationInfo(
+    const std::vector<common::ValueVector*>& keyVectors) {
+    auto hasCreated = true;
+    if (keyVectors.size() == 0) {
+        // Constant keys, we can simply use one tuple to store all information
+        if (factorizedTable->getNumTuples() == 0) {
+            tuple = factorizedTable->appendEmptyTuple();
+            hasCreated = false;
+        }
+        KU_ASSERT(factorizedTable->getNumTuples() == 1);
+        return PatternCreationInfo{tuple, hasCreated};
+    } else {
+        resizeHashTableIfNecessary(1);
+        computeVectorHashes(keyVectors);
+        findHashSlots(keyVectors, std::vector<common::ValueVector*>{}, keyVectors[0]->state.get());
+        hasCreated = tuple != nullptr;
+        auto idTuple = tuple == nullptr ?
+                           factorizedTable->getTuple(factorizedTable->getNumTuples() - 1) :
+                           tuple;
+        return PatternCreationInfo{idTuple + idColOffset, hasCreated};
+    }
+}
+
+uint64_t PatternCreationInfoTable::matchFTEntries(std::span<const common::ValueVector*> keyVectors,
+    uint64_t numMayMatches, uint64_t numNoMatches) {
+    numNoMatches = AggregateHashTable::matchFTEntries(keyVectors, numMayMatches, numNoMatches);
+    KU_ASSERT(numMayMatches <= 1);
+    // If we found the entry for the target key, we set tuple to the key tuple. Otherwise, simply
+    // set tuple to nullptr.
+    tuple = numMayMatches != 0 ? hashSlotsToUpdateAggState[mayMatchIdxes[0]]->getEntry() : nullptr;
+    return numNoMatches;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/result_set.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/result_set.cpp
new file mode 100644
index 0000000000..56daf68f67
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/result_set.cpp
@@ -0,0 +1,40 @@
+#include "processor/result/result_set.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+ResultSet::ResultSet(ResultSetDescriptor* resultSetDescriptor,
+    storage::MemoryManager* memoryManager)
+    : multiplicity{1} {
+    auto numDataChunks = resultSetDescriptor->dataChunkDescriptors.size();
+    dataChunks.resize(numDataChunks);
+    for (auto i = 0u; i < numDataChunks; ++i) {
+        auto dataChunkDescriptor = resultSetDescriptor->dataChunkDescriptors[i].get();
+        auto numValueVectors = dataChunkDescriptor->logicalTypes.size();
+        auto dataChunk = std::make_unique<DataChunk>(numValueVectors);
+        if (dataChunkDescriptor->isSingleState) {
+            dataChunk->state = DataChunkState::getSingleValueDataChunkState();
+        }
+        for (auto j = 0u; j < numValueVectors; ++j) {
+            auto vector = std::make_shared<ValueVector>(dataChunkDescriptor->logicalTypes[j].copy(),
+                memoryManager);
+            dataChunk->insert(j, std::move(vector));
+        }
+        insert(i, std::move(dataChunk));
+    }
+}
+
+uint64_t ResultSet::getNumTuplesWithoutMultiplicity(
+    const std::unordered_set<uint32_t>& dataChunksPosInScope) {
+    KU_ASSERT(!dataChunksPosInScope.empty());
+    uint64_t numTuples = 1;
+    for (auto& dataChunkPos : dataChunksPosInScope) {
+        numTuples *= dataChunks[dataChunkPos]->state->getSelVector().getSelSize();
+    }
+    return numTuples;
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/result_set_descriptor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/result_set_descriptor.cpp
new file mode 100644
index 0000000000..ab65971cf5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/result/result_set_descriptor.cpp
@@ -0,0 +1,30 @@
+#include "processor/result/result_set_descriptor.h"
+
+#include "planner/operator/schema.h"
+
+namespace lbug {
+namespace processor {
+
+ResultSetDescriptor::ResultSetDescriptor(planner::Schema* schema) {
+    for (auto i = 0u; i < schema->getNumGroups(); ++i) {
+        auto group = schema->getGroup(i);
+        auto dataChunkDescriptor = std::make_unique<DataChunkDescriptor>(group->isSingleState());
+        for (auto& expression : group->getExpressions()) {
+            dataChunkDescriptor->logicalTypes.push_back(expression->getDataType().copy());
+        }
+        dataChunkDescriptors.push_back(std::move(dataChunkDescriptor));
+    }
+}
+
+std::unique_ptr<ResultSetDescriptor> ResultSetDescriptor::copy() const {
+    std::vector<std::unique_ptr<DataChunkDescriptor>> dataChunkDescriptorsCopy;
+    dataChunkDescriptorsCopy.reserve(dataChunkDescriptors.size());
+    for (auto& dataChunkDescriptor : dataChunkDescriptors) {
+        dataChunkDescriptorsCopy.push_back(
+            std::make_unique<DataChunkDescriptor>(*dataChunkDescriptor));
+    }
+    return std::make_unique<ResultSetDescriptor>(std::move(dataChunkDescriptorsCopy));
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/processor/warning_context.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/warning_context.cpp
new file mode 100644
index 0000000000..54ced3d65f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/processor/warning_context.cpp
@@ -0,0 +1,95 @@
+#include "processor/warning_context.h"
+
+#include "common/assert.h"
+#include "common/uniq_lock.h"
+#include "main/client_context.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace processor {
+
+static PopulatedCopyFromError defaultPopulateFunc(CopyFromFileError error, common::idx_t) {
+    return PopulatedCopyFromError{
+        .message = std::move(error.message),
+        .filePath = "",
+        .skippedLineOrRecord = "",
+        .lineNumber = 0,
+    };
+}
+
+static idx_t defaultGetFileIdxFunc(const CopyFromFileError&) {
+    return 0;
+}
+
+WarningContext::WarningContext(main::ClientConfig* clientConfig)
+    : clientConfig{clientConfig}, queryWarningCount{0}, numStoredWarnings{0},
+      ignoreErrorsOption{false} {}
+
+void WarningContext::appendWarningMessages(const std::vector<CopyFromFileError>& messages) {
+    UniqLock lock{mtx};
+
+    queryWarningCount += messages.size();
+
+    for (const auto& message : messages) {
+        if (numStoredWarnings >= clientConfig->warningLimit) {
+            break;
+        }
+        unpopulatedWarnings.push_back(message);
+        ++numStoredWarnings;
+    }
+}
+
+const std::vector<WarningInfo>& WarningContext::getPopulatedWarnings() const {
+    // if there are still unpopulated warnings when we try to get populated warnings something is
+    // probably wrong
+    KU_ASSERT(unpopulatedWarnings.empty());
+    return populatedWarnings;
+}
+
+void WarningContext::defaultPopulateAllWarnings(uint64_t queryID) {
+    populateWarnings(queryID);
+}
+
+void WarningContext::populateWarnings(uint64_t queryID, populate_func_t populateFunc,
+    get_file_idx_func_t getFileIdxFunc) {
+    if (!populateFunc) {
+        // if no populate functor is provided we default to just copying the message over
+        // and leaving the CSV fields unpopulated
+        populateFunc = defaultPopulateFunc;
+    }
+    if (!getFileIdxFunc) {
+        getFileIdxFunc = defaultGetFileIdxFunc;
+    }
+    for (auto& warning : unpopulatedWarnings) {
+        const auto fileIdx = getFileIdxFunc(warning);
+        populatedWarnings.emplace_back(populateFunc(std::move(warning), fileIdx), queryID);
+    }
+    unpopulatedWarnings.clear();
+}
+
+void WarningContext::clearPopulatedWarnings() {
+    populatedWarnings.clear();
+    numStoredWarnings = 0;
+}
+
+uint64_t WarningContext::getWarningCount(uint64_t) {
+    auto ret = queryWarningCount;
+    queryWarningCount = 0;
+    return ret;
+}
+
+void WarningContext::setIgnoreErrorsForCurrentQuery(bool ignoreErrors) {
+    ignoreErrorsOption = ignoreErrors;
+}
+
+bool WarningContext::getIgnoreErrorsOption() const {
+    return ignoreErrorsOption;
+}
+
+WarningContext* WarningContext::Get(const main::ClientContext& context) {
+    return context.warningContext.get();
+}
+
+} // namespace processor
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/CMakeLists.txt
new file mode 100644
index 0000000000..0ce8c3ff18
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/CMakeLists.txt
@@ -0,0 +1,31 @@
+add_subdirectory(buffer_manager)
+add_subdirectory(compression)
+add_subdirectory(local_storage)
+add_subdirectory(predicate)
+add_subdirectory(index)
+add_subdirectory(stats)
+add_subdirectory(table)
+add_subdirectory(wal)
+
+add_library(lbug_storage
+        OBJECT
+        checkpointer.cpp
+        database_header.cpp
+        disk_array.cpp
+        disk_array_collection.cpp
+        file_db_id_utils.cpp
+        file_handle.cpp
+        free_space_manager.cpp
+        optimistic_allocator.cpp
+        overflow_file.cpp
+        page_manager.cpp
+        shadow_file.cpp
+        shadow_utils.cpp
+        storage_manager.cpp
+        storage_utils.cpp
+        storage_version_info.cpp
+        undo_buffer.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_storage>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/CMakeLists.txt
new file mode 100644
index 0000000000..d51720ce5e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/CMakeLists.txt
@@ -0,0 +1,10 @@
+add_library(lbug_storage_buffer_manager
+        OBJECT
+        vm_region.cpp
+        buffer_manager.cpp
+        memory_manager.cpp
+        spiller.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_storage_buffer_manager>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/buffer_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/buffer_manager.cpp
new file mode 100644
index 0000000000..52a32b599e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/buffer_manager.cpp
@@ -0,0 +1,516 @@
+#include "storage/buffer_manager/buffer_manager.h"
+
+#include <atomic>
+#include <chrono>
+#include <cstdint>
+#include <cstring>
+#include <memory>
+#include <thread>
+
+#include "common/assert.h"
+#include "common/constants.h"
+#include "common/exception/buffer_manager.h"
+#include "common/file_system/local_file_system.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/types/types.h"
+#include "main/db_config.h"
+#include "storage/buffer_manager/spiller.h"
+#include "storage/file_handle.h"
+#include "storage/table/column_chunk_data.h"
+#include <span>
+
+#if defined(_WIN32)
+#include <exception>
+
+#include <eh.h>
+#include <errhandlingapi.h>
+#include <memoryapi.h>
+#include <windows.h>
+#include <winnt.h>
+#endif
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+bool EvictionQueue::insert(uint32_t fileIndex, page_idx_t pageIndex) {
+    EvictionCandidate candidate{fileIndex, pageIndex};
+    while (size < capacity) {
+        // Weak is fine since spurious failure is acceptable.
+        // The slot can always be filled later.
+        auto emptyCandidate = EMPTY;
+        if (data[insertCursor.fetch_add(1, std::memory_order_relaxed) % capacity]
+                .compare_exchange_weak(emptyCandidate, candidate)) {
+            size++;
+            return true;
+        }
+    }
+    return false;
+}
+
+std::span<std::atomic<EvictionCandidate>, EvictionQueue::BATCH_SIZE> EvictionQueue::next() {
+    return std::span<std::atomic<EvictionCandidate>, BATCH_SIZE>(
+        data.get() + ((evictionCursor += BATCH_SIZE) % capacity), BATCH_SIZE);
+}
+
+void EvictionQueue::clear(std::atomic<EvictionCandidate>& candidate) {
+    auto nonEmpty = candidate.load();
+    if (nonEmpty != EMPTY && candidate.compare_exchange_strong(nonEmpty, EMPTY)) {
+        size--;
+        return;
+    }
+    KU_UNREACHABLE;
+}
+
+BufferManager::BufferManager(const std::string& databasePath, const std::string& spillToDiskPath,
+    uint64_t bufferPoolSize, uint64_t maxDBSize, VirtualFileSystem* vfs, bool readOnly)
+    : bufferPoolSize{bufferPoolSize}, evictionQueue{bufferPoolSize / LBUG_PAGE_SIZE},
+      usedMemory{evictionQueue.getCapacity() * sizeof(EvictionCandidate)}, vfs{vfs} {
+    verifySizeParams(bufferPoolSize, maxDBSize);
+#if !BM_MALLOC
+    vmRegions[0] = std::make_unique<VMRegion>(REGULAR_PAGE, maxDBSize);
+    vmRegions[1] = std::make_unique<VMRegion>(TEMP_PAGE, bufferPoolSize);
+#endif
+
+    // TODO(bmwinger): It may be better to spill to disk in a different location for remote file
+    // systems, or even in general.
+    // Ideally we want to spill to disk in some temporary location such
+    // as /var/tmp (not /tmp since that may be backed by memory). However we also need to be able to
+    // support multiple databases spilling at once (can't be the same file), and handle different
+    // platforms.
+    if (!readOnly && !main::DBConfig::isDBPathInMemory(databasePath) &&
+        dynamic_cast<LocalFileSystem*>(vfs->findFileSystem(spillToDiskPath))) {
+        spiller = std::make_unique<Spiller>(spillToDiskPath, *this, vfs);
+    }
+}
+
+void BufferManager::verifySizeParams(uint64_t bufferPoolSize, uint64_t maxDBSize) {
+    if (bufferPoolSize < LBUG_PAGE_SIZE) {
+        throw BufferManagerException(stringFormat(
+            "The given buffer pool size should be at least {} bytes.", LBUG_PAGE_SIZE));
+    }
+    // We require at least two page groups, one for the main data file, and one for the shadow file.
+    if (maxDBSize < 2 * LBUG_PAGE_SIZE * StorageConstants::PAGE_GROUP_SIZE) {
+        throw BufferManagerException(
+            "The given max db size should be at least " +
+            std::to_string(2 * LBUG_PAGE_SIZE * StorageConstants::PAGE_GROUP_SIZE) + " bytes.");
+    }
+    if ((maxDBSize & (maxDBSize - 1)) != 0) {
+        throw BufferManagerException("The given max db size should be a power of 2.");
+    }
+}
+
+// Important Note: Pin returns a raw pointer to the frame. This is potentially very dangerous and
+// trusts the caller is going to protect this memory space.
+// Important responsibilities for the caller are:
+// (1) The caller should know the page size and not read/write beyond these boundaries.
+// (2) If the given FileHandle is not a (temporary) in-memory file and the caller writes to the
+// frame, caller should make sure to call setFrameDirty to let the BufferManager know that the page
+// should be flushed to disk if it is evicted.
+// (3) If multiple threads are writing to the page, they should coordinate separately because they
+// both get access to the same piece of memory.
+uint8_t* BufferManager::pin(FileHandle& fileHandle, page_idx_t pageIdx,
+    PageReadPolicy pageReadPolicy) {
+    auto pageState = fileHandle.getPageState(pageIdx);
+    while (true) {
+        auto currStateAndVersion = pageState->getStateAndVersion();
+        switch (PageState::getState(currStateAndVersion)) {
+        case PageState::EVICTED: {
+            if (pageState->tryLock(currStateAndVersion)) {
+                if (!claimAFrame(fileHandle, pageIdx, pageReadPolicy)) {
+                    pageState->resetToEvicted();
+                    throw BufferManagerException("Unable to allocate memory! The buffer pool is "
+                                                 "full and no memory could be freed!");
+                }
+                if (!evictionQueue.insert(fileHandle.getFileIndex(), pageIdx)) {
+                    throw BufferManagerException(
+                        "Eviction queue is full! This should be impossible.");
+                }
+#if BM_MALLOC
+                KU_ASSERT(pageState->getPage());
+                return pageState->getPage();
+#else
+                return getFrame(fileHandle, pageIdx);
+#endif
+            }
+        } break;
+        case PageState::UNLOCKED:
+        case PageState::MARKED: {
+            if (pageState->tryLock(currStateAndVersion)) {
+                return getFrame(fileHandle, pageIdx);
+            }
+        } break;
+        case PageState::LOCKED: {
+            continue;
+        }
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+    }
+}
+
+#if defined(WIN32)
+class AccessViolation : public std::exception {
+public:
+    AccessViolation(const uint8_t* location) : location{location} {}
+
+    const uint8_t* location;
+};
+
+class ScopedTranslator {
+    const _se_translator_function old;
+
+public:
+    ScopedTranslator(_se_translator_function newTranslator)
+        : old{_set_se_translator(newTranslator)} {}
+    ~ScopedTranslator() { _set_se_translator(old); }
+};
+
+void handleAccessViolation(unsigned int exceptionCode, PEXCEPTION_POINTERS exceptionRecord) {
+    if (exceptionCode == EXCEPTION_ACCESS_VIOLATION
+        // exception was from a read
+        && exceptionRecord->ExceptionRecord->ExceptionInformation[0] == 0) [[likely]] {
+        throw AccessViolation(
+            (const uint8_t*)exceptionRecord->ExceptionRecord->ExceptionInformation[1]);
+    }
+    // Needs to not be an Exception so that it can't be caught by regular exception handling
+    // And is seems like throwing integer error codes is treated similarly to hardware
+    // exceptions with /EHa
+    throw exceptionCode;
+}
+#endif
+
+// Returns true if the function completes successfully
+inline bool try_func(const std::function<void(uint8_t*)>& func, uint8_t* frame,
+    const std::array<std::unique_ptr<VMRegion>, 2>& vmRegions [[maybe_unused]],
+    PageSizeClass pageSizeClass [[maybe_unused]], [[maybe_unused]] PageState* pageState) {
+#if BM_MALLOC
+    if (frame == nullptr) {
+        return false;
+    }
+    pageState->addReader();
+#endif
+
+#if defined(_WIN32) && !BM_MALLOC
+    try {
+#endif
+        func(frame);
+#if defined(_WIN32) && !BM_MALLOC
+    } catch (AccessViolation& exc) {
+        // If we encounter an acess violation within the VM region,
+        // the page was decomitted by another thread
+        // and is no longer valid memory
+        if (vmRegions[pageSizeClass]->contains(exc.location)) {
+            return false;
+        } else {
+            throw EXCEPTION_ACCESS_VIOLATION;
+        }
+    }
+#endif
+#if BM_MALLOC
+    pageState->removeReader();
+#endif
+    return true;
+}
+
+void BufferManager::optimisticRead(FileHandle& fileHandle, page_idx_t pageIdx,
+    const std::function<void(uint8_t*)>& func) {
+    auto pageState = fileHandle.getPageState(pageIdx);
+#if defined(_WIN32)
+    // Change the Structured Exception handling just for the scope of this function
+    auto translator = ScopedTranslator(handleAccessViolation);
+#endif
+    while (true) {
+        auto currStateAndVersion = pageState->getStateAndVersion();
+        switch (PageState::getState(currStateAndVersion)) {
+        case PageState::UNLOCKED: {
+            if (!try_func(func, getFrame(fileHandle, pageIdx), vmRegions,
+                    fileHandle.getPageSizeClass(), pageState)) {
+                continue;
+            }
+            if (pageState->getStateAndVersion() == currStateAndVersion) {
+                return;
+            }
+        } break;
+        case PageState::MARKED: {
+            // If the page is marked, we try to switch to unlocked.
+            pageState->tryClearMark(currStateAndVersion);
+            continue;
+        }
+        case PageState::EVICTED: {
+            pin(fileHandle, pageIdx, PageReadPolicy::READ_PAGE);
+            unpin(fileHandle, pageIdx);
+        } break;
+        default: {
+            // When locked, continue the spinning.
+            continue;
+        }
+        }
+    }
+}
+
+void BufferManager::unpin(FileHandle& fileHandle, page_idx_t pageIdx) {
+    auto pageState = fileHandle.getPageState(pageIdx);
+    pageState->unlock();
+}
+
+// evicts up to 64 pages and returns the space reclaimed
+uint64_t BufferManager::evictPages() {
+    std::array<std::atomic<EvictionCandidate>*, EvictionQueue::BATCH_SIZE> evictionCandidates{};
+    size_t evictablePages = 0;
+    uint64_t claimedMemory = 0;
+
+    // Try each page at least twice.
+    // E.g. if the vast majority of pages are unmarked and unlocked,
+    // the first pass will mark them and the second pass, if insufficient marked pages
+    // are found, will evict the first batch.
+    // Using the eviction queue's cursor means that we fail after the same number of total attempts,
+    // regardless of how many threads are trying to evict.
+    auto startCursor = evictionQueue.getEvictionCursor();
+    auto failureLimit = evictionQueue.getCapacity() * 2;
+    while (evictablePages == 0 && evictionQueue.getEvictionCursor() - startCursor < failureLimit) {
+        for (auto& candidate : evictionQueue.next()) {
+            auto evictionCandidate = candidate.load();
+            if (evictionCandidate == EvictionQueue::EMPTY) {
+                continue;
+            }
+            KU_ASSERT(evictionCandidate.fileIdx < fileHandles.size());
+            auto* pageState =
+                fileHandles[evictionCandidate.fileIdx]->getPageState(evictionCandidate.pageIdx);
+            auto pageStateAndVersion = pageState->getStateAndVersion();
+            if (!evictionCandidate.isEvictable(pageStateAndVersion)) {
+                if (evictionCandidate.isSecondChanceEvictable(pageStateAndVersion)) {
+                    pageState->tryMark(pageStateAndVersion);
+                }
+                continue;
+            }
+            evictionCandidates[evictablePages++] = &candidate;
+        }
+    }
+
+    for (size_t i = 0; i < evictablePages; i++) {
+        claimedMemory += tryEvictPage(*evictionCandidates[i]);
+    }
+    return claimedMemory;
+}
+
+void BufferManager::removeEvictedCandidates() {
+    auto startCursor = evictionQueue.getEvictionCursor();
+    while (evictionQueue.getEvictionCursor() - startCursor < evictionQueue.getCapacity()) {
+        for (auto& candidate : evictionQueue.next()) {
+            auto evictionCandidate = candidate.load();
+            if (evictionCandidate == EvictionQueue::EMPTY) {
+                continue;
+            }
+            KU_ASSERT(evictionCandidate.fileIdx < fileHandles.size());
+            auto* pageState =
+                fileHandles[evictionCandidate.fileIdx]->getPageState(evictionCandidate.pageIdx);
+            auto pageStateAndVersion = pageState->getStateAndVersion();
+            if (PageState::getState(pageStateAndVersion) == PageState::EVICTED) {
+                evictionQueue.clear(candidate);
+            }
+        }
+    }
+}
+
+// This function tries to load the given page into a frame. Due to our design of mmap, each page is
+// uniquely mapped to a frame. Thus, claiming a frame is equivalent to ensuring enough physical
+// memory is available.
+// First, we reserve the memory for the page, which increments the atomic counter `usedMemory`.
+// Then, we check if there is enough memory available. If not, we evict pages until we have enough
+// or we can find no more pages to be evicted.
+// Lastly, we double check if the needed memory is available. If not, we free the memory we reserved
+// and return false, otherwise, we load the page to its corresponding frame and return true.
+bool BufferManager::claimAFrame(FileHandle& fileHandle, page_idx_t pageIdx,
+    PageReadPolicy pageReadPolicy) {
+    page_offset_t pageSizeToClaim = fileHandle.getPageSize();
+    if (!reserve(pageSizeToClaim)) {
+        return false;
+    }
+#if _WIN32 && !BM_MALLOC
+    // Committing in this context means reserving physical memory/page file space for a segment of
+    // virtual memory. On Linux/Unix this is automatic when you write to the memory address.
+    auto result =
+        VirtualAlloc(getFrame(fileHandle, pageIdx), pageSizeToClaim, MEM_COMMIT, PAGE_READWRITE);
+    if (result == NULL) {
+        throw BufferManagerException(
+            stringFormat("VirtualAlloc MEM_COMMIT failed with error code {}: {}.", GetLastError(),
+                std::system_category().message(GetLastError())));
+    }
+#endif
+    cachePageIntoFrame(fileHandle, pageIdx, pageReadPolicy);
+    return true;
+}
+
+bool BufferManager::reserve(uint64_t sizeToReserve) {
+    // Reserve the memory for the page.
+    usedMemory += sizeToReserve;
+    uint64_t totalClaimedMemory = 0;
+    uint64_t nonEvictableClaimedMemory = 0;
+    const auto needMoreMemory = [&]() {
+        // The only time we should exceed the buffer pool size should be when threads are currently
+        // attempting to reserve space and have pre-allocated space. So if we've claimed enough
+        // space for what we're trying to reserve, then we can continue even if the current total is
+        // higher than the buffer pool size as we should never actually exceed the buffer pool size.
+        return sizeToReserve > totalClaimedMemory &&
+               // usedMemory - totalClaimedMemory could underflow
+               usedMemory > bufferPoolSize.load() - totalClaimedMemory;
+    };
+    uint8_t failedCount = 0;
+    // Evict pages if necessary until we have enough memory.
+    while (needMoreMemory()) {
+        uint64_t memoryClaimed = 0;
+        // Avoid reducing the evictable memory below 1/2 at first to reduce thrashing if most of the
+        // memory is non-evictable
+        if (!spiller || usedMemory - nonEvictableMemory > bufferPoolSize / 2) {
+            memoryClaimed = evictPages();
+        } else {
+            auto [_memoryClaimed, nowEvictableMemory] = spiller->claimNextGroup();
+            memoryClaimed = _memoryClaimed;
+            nonEvictableClaimedMemory += _memoryClaimed;
+            nonEvictableMemory -= nowEvictableMemory;
+            // If we're unable to claim anything from the spiller, fall back to evicting pages
+            // We may also need to evict pages if the spiller just unpins BM pages
+            if (memoryClaimed == 0 || nowEvictableMemory > 0) {
+                memoryClaimed = evictPages();
+            }
+        }
+        if (memoryClaimed == 0 && needMoreMemory()) {
+            if (failedCount++ < 2) {
+                // If we failed to find any memory to free, try waiting briefly for other threads to
+                // stop using memory
+                std::this_thread::sleep_for(std::chrono::milliseconds(5));
+            } else {
+                // Cannot find more pages to be evicted. Free the memory we reserved and return
+                // false.
+                freeUsedMemory(sizeToReserve + totalClaimedMemory);
+                nonEvictableMemory -= nonEvictableClaimedMemory;
+                return false;
+            }
+        }
+        totalClaimedMemory += memoryClaimed;
+    }
+    // Have enough memory available now
+    if (totalClaimedMemory > 0) {
+        freeUsedMemory(totalClaimedMemory);
+        nonEvictableMemory -= nonEvictableClaimedMemory;
+    }
+    return true;
+}
+
+uint64_t BufferManager::tryEvictPage(std::atomic<EvictionCandidate>& _candidate) {
+    auto candidate = _candidate.load();
+    // Page must have been evicted by another thread already
+    if (candidate.pageIdx == INVALID_PAGE_IDX) {
+        return 0;
+    }
+    auto& pageState = *fileHandles[candidate.fileIdx]->getPageState(candidate.pageIdx);
+    auto currStateAndVersion = pageState.getStateAndVersion();
+    // We check if the page is evictable again. Note that if the page's state or version has
+    // changed after the check, `tryLock` will fail, and we will abort the eviction of this page.
+    if (!candidate.isEvictable(currStateAndVersion) || !pageState.tryLock(currStateAndVersion)) {
+        return 0;
+    }
+    // The pageState was locked, but another thread already evicted this candidate and unlocked it
+    // before the lock occurred
+    if (_candidate.load() != candidate
+#if BM_MALLOC
+        // When the pageState is locked, optimisticReads will wait, so at this point no new
+        // optimistic reads will begin and thus it is safe to free the buffer at this point
+        || pageState.getReaderCount() > 0
+#endif
+    ) {
+        pageState.unlockUnchanged();
+        return 0;
+    }
+    if (fileHandles[candidate.fileIdx]->isInMemoryMode()) {
+        // Cannot flush pages under in memory mode.
+        return 0;
+    }
+    // At this point, the page is LOCKED, and we have exclusive access to the eviction candidate.
+    // Next, flush out the frame into the file page if the frame
+    // is dirty. Finally remove the page from the frame and reset the page to EVICTED.
+    auto& fileHandle = *fileHandles[candidate.fileIdx];
+    fileHandle.flushPageIfDirtyWithoutLock(candidate.pageIdx);
+    auto numBytesFreed = fileHandle.getPageSize();
+    releaseFrameForPage(fileHandle, candidate.pageIdx);
+    pageState.resetToEvicted();
+    evictionQueue.clear(_candidate);
+    return numBytesFreed;
+}
+
+void BufferManager::cachePageIntoFrame(FileHandle& fileHandle, page_idx_t pageIdx,
+    PageReadPolicy pageReadPolicy) {
+    auto pageState = fileHandle.getPageState(pageIdx);
+    pageState->clearDirty();
+#if BM_MALLOC
+    pageState->allocatePage(fileHandle.getPageSize());
+    if (pageReadPolicy == PageReadPolicy::READ_PAGE) {
+        fileHandle.readPageFromDisk(pageState->getPage(), pageIdx);
+    }
+#else
+    if (pageReadPolicy == PageReadPolicy::READ_PAGE) {
+        fileHandle.readPageFromDisk(getFrame(fileHandle, pageIdx), pageIdx);
+    }
+#endif
+}
+
+void BufferManager::removeFilePagesFromFrames(FileHandle& fileHandle) {
+    for (auto pageIdx = 0u; pageIdx < fileHandle.getNumPages(); ++pageIdx) {
+        removePageFromFrame(fileHandle, pageIdx, false /* do not flush */);
+    }
+}
+
+void BufferManager::updateFrameIfPageIsInFrameWithoutLock(file_idx_t fileIdx,
+    const uint8_t* newPage, page_idx_t pageIdx) {
+    KU_ASSERT(fileIdx < fileHandles.size());
+    auto& fileHandle = *fileHandles[fileIdx];
+    auto state = fileHandle.getPageState(pageIdx);
+    if (state && state->getState() != PageState::EVICTED) {
+        memcpy(getFrame(fileHandle, pageIdx), newPage, LBUG_PAGE_SIZE);
+    }
+}
+
+void BufferManager::removePageFromFrameIfNecessary(FileHandle& fileHandle, page_idx_t pageIdx) {
+    if (pageIdx >= fileHandle.getNumPages()) {
+        return;
+    }
+    removePageFromFrame(fileHandle, pageIdx, false /* do not flush */);
+}
+
+// NOTE: We assume the page is not pinned (locked) here.
+void BufferManager::removePageFromFrame(FileHandle& fileHandle, page_idx_t pageIdx,
+    bool shouldFlush) {
+    auto pageState = fileHandle.getPageState(pageIdx);
+    if (PageState::getState(pageState->getStateAndVersion()) == PageState::EVICTED) {
+        return;
+    }
+    pageState->spinLock(pageState->getStateAndVersion());
+    if (shouldFlush) {
+        fileHandle.flushPageIfDirtyWithoutLock(pageIdx);
+    }
+    releaseFrameForPage(fileHandle, pageIdx);
+    freeUsedMemory(fileHandle.getPageSize());
+    pageState->resetToEvicted();
+}
+
+uint64_t BufferManager::freeUsedMemory(uint64_t size) {
+    KU_ASSERT(usedMemory.load() >= size);
+    return usedMemory.fetch_sub(size);
+}
+
+void BufferManager::resetSpiller(std::string spillPath) {
+    if (spillPath.empty()) {
+        // Disable spilling to disk;
+        spiller = nullptr;
+    } else {
+        spiller = std::make_unique<Spiller>(spillPath, *this, vfs);
+    }
+}
+
+BufferManager::~BufferManager() = default;
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/memory_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/memory_manager.cpp
new file mode 100644
index 0000000000..b05f8a7d4a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/memory_manager.cpp
@@ -0,0 +1,115 @@
+#include "storage/buffer_manager/memory_manager.h"
+
+#include <mutex>
+
+#include "common/exception/buffer_manager.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/types/types.h"
+#include "main/client_context.h"
+#include "main/database.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/file_handle.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+MemoryBuffer::MemoryBuffer(MemoryManager* mm, page_idx_t pageIdx, uint8_t* buffer, uint64_t size)
+    : buffer{buffer, static_cast<size_t>(size)}, mm{mm}, pageIdx{pageIdx}, evicted{false} {}
+
+MemoryBuffer::~MemoryBuffer() {
+    if (buffer.data() != nullptr && !evicted) {
+        mm->freeBlock(pageIdx, buffer);
+        mm->updateUsedMemoryForFreedBlock(pageIdx, buffer);
+        buffer = std::span<uint8_t>();
+    }
+}
+
+SpillResult MemoryBuffer::setSpilledToDisk(uint64_t filePosition) {
+    mm->freeBlock(pageIdx, buffer);
+    // reinterpret_cast isn't allowed here, but we shouldn't leave the invalid pointer and
+    // still want to store the size
+    buffer = std::span(static_cast<uint8_t*>(nullptr), buffer.size());
+    evicted = true;
+    this->filePosition = filePosition;
+    if (pageIdx == INVALID_PAGE_IDX) {
+        return SpillResult{buffer.size(), 0};
+    } else {
+        return SpillResult{0, buffer.size()};
+    }
+}
+
+void MemoryBuffer::prepareLoadFromDisk() {
+    KU_ASSERT(buffer.data() == nullptr && evicted);
+    buffer = mm->mallocBuffer(false, buffer.size());
+    evicted = false;
+}
+
+MemoryManager::MemoryManager(BufferManager* bm, VirtualFileSystem* vfs) : bm{bm} {
+    pageSize = TEMP_PAGE_SIZE;
+    fh = bm->getFileHandle("mm-256KB", FileHandle::O_IN_MEM_TEMP_FILE, vfs, nullptr);
+}
+
+std::span<uint8_t> MemoryManager::mallocBuffer(bool initializeToZero, uint64_t size) {
+    if (!bm->reserve(size)) {
+        throw BufferManagerException(
+            "Unable to allocate memory! The buffer pool is full and no memory could be freed!");
+    }
+    void* buffer = nullptr;
+    bm->nonEvictableMemory += size;
+    if (initializeToZero) {
+        buffer = calloc(size, 1);
+    } else {
+        buffer = malloc(size);
+    }
+    return std::span(static_cast<uint8_t*>(buffer), size);
+}
+
+std::unique_ptr<MemoryBuffer> MemoryManager::allocateBuffer(bool initializeToZero, uint64_t size) {
+    if (size != TEMP_PAGE_SIZE) [[unlikely]] {
+        auto buffer = mallocBuffer(initializeToZero, size);
+        return std::make_unique<MemoryBuffer>(this, INVALID_PAGE_IDX, buffer.data(), size);
+    }
+    page_idx_t pageIdx = INVALID_PAGE_IDX;
+    {
+        std::scoped_lock<std::mutex> lock(allocatorLock);
+        if (freePages.empty()) {
+            pageIdx = fh->addNewPage();
+        } else {
+            pageIdx = freePages.top();
+            freePages.pop();
+        }
+    }
+    auto buffer = bm->pin(*fh, pageIdx, PageReadPolicy::DONT_READ_PAGE);
+    auto memoryBuffer = std::make_unique<MemoryBuffer>(this, pageIdx, buffer);
+    if (initializeToZero) {
+        memset(memoryBuffer->getBuffer().data(), 0, pageSize);
+    }
+    return memoryBuffer;
+}
+
+void MemoryManager::freeBlock(page_idx_t pageIdx, std::span<uint8_t> buffer) {
+    if (pageIdx == INVALID_PAGE_IDX) {
+        std::free(buffer.data());
+    } else {
+        bm->unpin(*fh, pageIdx);
+    }
+}
+
+void MemoryManager::updateUsedMemoryForFreedBlock(page_idx_t pageIdx, std::span<uint8_t> buffer) {
+    if (pageIdx == INVALID_PAGE_IDX) {
+        bm->freeUsedMemory(buffer.size());
+        bm->nonEvictableMemory -= buffer.size();
+    } else {
+        std::unique_lock<std::mutex> lock(allocatorLock);
+        freePages.push(pageIdx);
+    }
+}
+
+MemoryManager* MemoryManager::Get(const main::ClientContext& context) {
+    return context.getDatabase()->getMemoryManager();
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/spiller.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/spiller.cpp
new file mode 100644
index 0000000000..14ac3a01c5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/spiller.cpp
@@ -0,0 +1,115 @@
+#include "storage/buffer_manager/spiller.h"
+
+#include <mutex>
+
+#include "common/assert.h"
+#include "common/exception/io.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/file_handle.h"
+#include "storage/table/chunked_node_group.h"
+#include "storage/table/column_chunk_data.h"
+
+namespace lbug {
+namespace storage {
+
+Spiller::Spiller(std::string tmpFilePath, BufferManager& bufferManager,
+    common::VirtualFileSystem* vfs)
+    : tmpFilePath{std::move(tmpFilePath)}, bufferManager{bufferManager}, vfs{vfs}, dataFH{nullptr} {
+    // Clear the file if it already existed (e.g. from a previous run which
+    // failed to clean up).
+    vfs->removeFileIfExists(this->tmpFilePath);
+}
+
+FileHandle* Spiller::getOrCreateDataFH() const {
+    if (dataFH.load()) {
+        return dataFH;
+    }
+    std::unique_lock lock(fileCreationMutex);
+    // Another thread may have created the file while the lock was being acquired
+    if (dataFH.load()) {
+        return dataFH;
+    }
+    const_cast<Spiller*>(this)->dataFH = bufferManager.getFileHandle(tmpFilePath,
+        FileHandle::O_PERSISTENT_FILE_CREATE_NOT_EXISTS, vfs, nullptr);
+    return dataFH;
+}
+
+FileHandle* Spiller::getDataFH() const {
+    if (dataFH.load()) {
+        return dataFH;
+    }
+    return nullptr;
+}
+
+void Spiller::addUnusedChunk(InMemChunkedNodeGroup* nodeGroup) {
+    std::unique_lock lock(partitionerGroupsMtx);
+    fullPartitionerGroups.insert(nodeGroup);
+}
+
+void Spiller::clearUnusedChunk(InMemChunkedNodeGroup* nodeGroup) {
+    std::unique_lock lock(partitionerGroupsMtx);
+    auto entry = fullPartitionerGroups.find(nodeGroup);
+    if (entry != fullPartitionerGroups.end()) {
+        fullPartitionerGroups.erase(entry);
+    }
+}
+
+Spiller::~Spiller() {
+    // This should be safe as long as the VFS is always using a local file system and the VFS is
+    // destroyed after the buffer manager
+    try {
+        vfs->removeFileIfExists(this->tmpFilePath);
+    } catch (common::IOException&) {} // NOLINT
+}
+
+SpillResult Spiller::spillToDisk(ColumnChunkData& chunk) const {
+    auto& buffer = *chunk.buffer;
+    KU_ASSERT(!buffer.evicted);
+    auto dataFH = getOrCreateDataFH();
+    auto pageSize = dataFH->getPageSize();
+    auto numPages = (buffer.buffer.size_bytes() + pageSize - 1) / pageSize;
+    auto startPage = dataFH->addNewPages(numPages);
+    dataFH->writePagesToFile(buffer.buffer.data(), buffer.buffer.size_bytes(), startPage);
+    return buffer.setSpilledToDisk(startPage * pageSize);
+}
+
+void Spiller::loadFromDisk(ColumnChunkData& chunk) const {
+    auto& buffer = *chunk.buffer;
+    if (buffer.evicted) {
+        buffer.prepareLoadFromDisk();
+        auto dataFH = getDataFH();
+        KU_ASSERT(dataFH);
+        dataFH->getFileInfo()->readFromFile(buffer.buffer.data(), buffer.buffer.size(),
+            buffer.filePosition);
+    }
+}
+
+SpillResult Spiller::claimNextGroup() {
+    InMemChunkedNodeGroup* groupToFlush = nullptr;
+    {
+        std::unique_lock lock(partitionerGroupsMtx);
+        if (!fullPartitionerGroups.empty()) {
+            auto groupToFlushEntry = fullPartitionerGroups.begin();
+            groupToFlush = *groupToFlushEntry;
+            fullPartitionerGroups.erase(groupToFlushEntry);
+        }
+    }
+    if (groupToFlush == nullptr) {
+        return SpillResult{};
+    }
+    return groupToFlush->spillToDisk();
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Function shouldn't be re-ordered
+void Spiller::clearFile() {
+    auto curDataFH = getDataFH();
+    if (curDataFH) {
+        curDataFH->getFileInfo()->truncate(0);
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/vm_region.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/vm_region.cpp
new file mode 100644
index 0000000000..44769c3bae
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/buffer_manager/vm_region.cpp
@@ -0,0 +1,91 @@
+#include "storage/buffer_manager/vm_region.h"
+
+#include "common/string_format.h"
+#include "common/system_config.h"
+#include "common/system_message.h"
+
+#ifdef _WIN32
+#include <errhandlingapi.h>
+#include <handleapi.h>
+#include <memoryapi.h>
+#else
+#include <sys/mman.h>
+#endif
+
+#include "common/exception/buffer_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+VMRegion::VMRegion(PageSizeClass pageSizeClass, uint64_t maxRegionSize) : numFrameGroups{0} {
+    if (maxRegionSize > static_cast<std::size_t>(-1)) {
+        throw BufferManagerException("maxRegionSize is beyond the max available mmap region size.");
+    }
+    frameSize = pageSizeClass == REGULAR_PAGE ? LBUG_PAGE_SIZE : TEMP_PAGE_SIZE;
+    const auto numBytesForFrameGroup = frameSize * StorageConstants::PAGE_GROUP_SIZE;
+    maxNumFrameGroups = (maxRegionSize + numBytesForFrameGroup - 1) / numBytesForFrameGroup;
+#ifdef _WIN32
+    region = (uint8_t*)VirtualAlloc(NULL, getMaxRegionSize(), MEM_RESERVE, PAGE_READWRITE);
+    if (region == NULL) {
+        throw BufferManagerException(stringFormat(
+            "VirtualAlloc for size {} failed with error code {}: {}.", getMaxRegionSize(),
+            GetLastError(), std::system_category().message(GetLastError())));
+    }
+#else
+    // Create a private anonymous mapping. The mapping is not shared with other processes and not
+    // backed by any file, and its content are initialized to zero.
+    region = static_cast<uint8_t*>(mmap(NULL, getMaxRegionSize(), PROT_READ | PROT_WRITE,
+        MAP_PRIVATE | MAP_ANONYMOUS | MAP_NORESERVE, -1 /* fd */, 0 /* offset */));
+    if (region == MAP_FAILED) {
+        throw BufferManagerException(
+            "Mmap for size " + std::to_string(getMaxRegionSize()) + " failed.");
+    }
+#endif
+}
+
+VMRegion::~VMRegion() {
+#ifdef _WIN32
+    VirtualFree(region, 0, MEM_RELEASE);
+#else
+    munmap(region, getMaxRegionSize());
+#endif
+}
+
+void VMRegion::releaseFrame(frame_idx_t frameIdx) const {
+#ifdef _WIN32
+    // TODO: VirtualAlloc(..., MEM_RESET, ...) may be faster
+    // See https://arvid.io/2018/04/02/memory-mapping-on-windows/#1
+    // Not sure what the differences are
+    if (!VirtualFree(getFrame(frameIdx), frameSize, MEM_DECOMMIT)) {
+        auto code = GetLastError();
+        throw BufferManagerException(stringFormat(
+            "Releasing physical memory associated with a frame failed with error code {}: {}.",
+            code, systemErrMessage(code)));
+    }
+
+#else
+    int error = madvise(getFrame(frameIdx), frameSize, MADV_DONTNEED);
+    if (error != 0) {
+        // LCOV_EXCL_START
+        throw BufferManagerException(stringFormat(
+            "Releasing physical memory associated with a frame failed with error code {}: {}.",
+            error, posixErrMessage()));
+        // LCOV_EXCL_STOP
+    }
+#endif
+}
+
+frame_group_idx_t VMRegion::addNewFrameGroup() {
+    std::unique_lock xLck{mtx};
+    if (numFrameGroups >= maxNumFrameGroups) {
+        // LCOV_EXCL_START
+        throw BufferManagerException("No more frame groups can be added to the allocator.");
+        // LCOV_EXCL_STOP
+    }
+    return numFrameGroups++;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/checkpointer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/checkpointer.cpp
new file mode 100644
index 0000000000..b9d8dcad81
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/checkpointer.cpp
@@ -0,0 +1,224 @@
+#include "storage/checkpointer.h"
+
+#include "catalog/catalog.h"
+#include "common/file_system/file_system.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/serializer/buffered_file.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/in_mem_file_writer.h"
+#include "extension/extension_manager.h"
+#include "main/client_context.h"
+#include "main/db_config.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/database_header.h"
+#include "storage/shadow_utils.h"
+#include "storage/storage_manager.h"
+#include "storage/wal/local_wal.h"
+
+namespace lbug {
+namespace storage {
+
+Checkpointer::Checkpointer(main::ClientContext& clientContext)
+    : clientContext{clientContext},
+      isInMemory{main::DBConfig::isDBPathInMemory(clientContext.getDatabasePath())} {}
+
+Checkpointer::~Checkpointer() = default;
+
+PageRange Checkpointer::serializeCatalog(const catalog::Catalog& catalog,
+    StorageManager& storageManager) {
+    auto catalogWriter =
+        std::make_shared<common::InMemFileWriter>(*MemoryManager::Get(clientContext));
+    common::Serializer catalogSerializer(catalogWriter);
+    catalog.serialize(catalogSerializer);
+    auto pageAllocator = storageManager.getDataFH()->getPageManager();
+    return catalogWriter->flush(*pageAllocator, storageManager.getShadowFile());
+}
+
+PageRange Checkpointer::serializeMetadata(const catalog::Catalog& catalog,
+    StorageManager& storageManager) {
+    auto metadataWriter =
+        std::make_shared<common::InMemFileWriter>(*MemoryManager::Get(clientContext));
+    common::Serializer metadataSerializer(metadataWriter);
+    storageManager.serialize(catalog, metadataSerializer);
+
+    // We need to preallocate the pages for the page manager before we actually serialize it,
+    // this is because the page manager needs to track the pages used for itself.
+    // The number of pages needed for the page manager should only decrease after making an
+    // additional allocation, so we just calculate the number of pages needed to serialize the
+    // current state of the page manager.
+    // Thus, it is possible that we allocate an extra page that we won't end up writing to when we
+    // flush the metadata writer. This may cause a discrepancy between the number of tracked pages
+    // and the number of physical pages in the file but shouldn't cause any actual incorrect
+    // behavior in the database.
+    auto& pageManager = *storageManager.getDataFH()->getPageManager();
+    const auto pagesForPageManager = pageManager.estimatePagesNeededForSerialize();
+    auto pageAllocator = storageManager.getDataFH()->getPageManager();
+    const auto allocatedPages = pageAllocator->allocatePageRange(
+        metadataWriter->getNumPagesToFlush() + pagesForPageManager);
+    pageManager.serialize(metadataSerializer);
+
+    metadataWriter->flush(allocatedPages, pageAllocator->getDataFH(),
+        storageManager.getShadowFile());
+    return allocatedPages;
+}
+
+void Checkpointer::writeCheckpoint() {
+    if (isInMemory) {
+        return;
+    }
+
+    auto databaseHeader =
+        *StorageManager::Get(clientContext)->getOrInitDatabaseHeader(clientContext);
+    // Checkpoint storage. Note that we first checkpoint storage before serializing the catalog, as
+    // checkpointing storage may overwrite columnIDs in the catalog.
+    bool hasStorageChanges = checkpointStorage();
+    serializeCatalogAndMetadata(databaseHeader, hasStorageChanges);
+    writeDatabaseHeader(databaseHeader);
+    logCheckpointAndApplyShadowPages();
+
+    // This function will evict all pages that were freed during this checkpoint
+    // It must be called before we remove all evicted candidates from the BM
+    // Or else the evicted pages may end up appearing multiple times in the eviction queue
+    auto storageManager = StorageManager::Get(clientContext);
+    storageManager->finalizeCheckpoint();
+    // When a page is freed by the FSM, it evicts it from the BM. However, if the page is freed,
+    // then reused over and over, it can be appended to the eviction queue multiple times. To
+    // prevent multiple entries of the same page from existing in the eviction queue, at the end of
+    // each checkpoint we remove any already-evicted pages.
+    auto bufferManager = MemoryManager::Get(clientContext)->getBufferManager();
+    bufferManager->removeEvictedCandidates();
+
+    catalog::Catalog::Get(clientContext)->resetVersion();
+    auto* dataFH = storageManager->getDataFH();
+    dataFH->getPageManager()->resetVersion();
+    storageManager->getWAL().reset();
+    storageManager->getShadowFile().reset();
+}
+
+bool Checkpointer::checkpointStorage() {
+    const auto storageManager = StorageManager::Get(clientContext);
+    auto pageAllocator = storageManager->getDataFH()->getPageManager();
+    return storageManager->checkpoint(&clientContext, *pageAllocator);
+}
+
+void Checkpointer::serializeCatalogAndMetadata(DatabaseHeader& databaseHeader,
+    bool hasStorageChanges) {
+    const auto storageManager = StorageManager::Get(clientContext);
+    const auto catalog = catalog::Catalog::Get(clientContext);
+    auto* dataFH = storageManager->getDataFH();
+
+    // Serialize the catalog if there are changes
+    if (databaseHeader.catalogPageRange.startPageIdx == common::INVALID_PAGE_IDX ||
+        catalog->changedSinceLastCheckpoint()) {
+        databaseHeader.updateCatalogPageRange(*dataFH->getPageManager(),
+            serializeCatalog(*catalog, *storageManager));
+    }
+    // Serialize the storage metadata if there are changes
+    if (databaseHeader.metadataPageRange.startPageIdx == common::INVALID_PAGE_IDX ||
+        hasStorageChanges || catalog->changedSinceLastCheckpoint() ||
+        dataFH->getPageManager()->changedSinceLastCheckpoint()) {
+        // We must free the existing metadata page range before serializing
+        // So that the freed pages are serialized by the FSM
+        databaseHeader.freeMetadataPageRange(*dataFH->getPageManager());
+        databaseHeader.metadataPageRange = serializeMetadata(*catalog, *storageManager);
+    }
+}
+
+void Checkpointer::writeDatabaseHeader(const DatabaseHeader& header) {
+    auto headerWriter =
+        std::make_shared<common::InMemFileWriter>(*MemoryManager::Get(clientContext));
+    common::Serializer headerSerializer(headerWriter);
+    header.serialize(headerSerializer);
+    auto headerPage = headerWriter->getPage(0);
+
+    const auto storageManager = StorageManager::Get(clientContext);
+    auto dataFH = storageManager->getDataFH();
+    auto& shadowFile = storageManager->getShadowFile();
+    auto shadowHeader = ShadowUtils::createShadowVersionIfNecessaryAndPinPage(
+        common::StorageConstants::DB_HEADER_PAGE_IDX, true /* skipReadingOriginalPage */, *dataFH,
+        shadowFile);
+    memcpy(shadowHeader.frame, headerPage.data(), common::LBUG_PAGE_SIZE);
+    shadowFile.getShadowingFH().unpinPage(shadowHeader.shadowPage);
+
+    // Update the in-memory database header with the new version
+    StorageManager::Get(clientContext)->setDatabaseHeader(std::make_unique<DatabaseHeader>(header));
+}
+
+void Checkpointer::logCheckpointAndApplyShadowPages() {
+    const auto storageManager = StorageManager::Get(clientContext);
+    auto& shadowFile = storageManager->getShadowFile();
+    // Flush the shadow file.
+    shadowFile.flushAll(clientContext);
+    auto wal = WAL::Get(clientContext);
+    // Log the checkpoint to the WAL and flush WAL. This indicates that all shadow pages and
+    // files (snapshots of catalog and metadata) have been written to disk. The part that is not
+    // done is to replace them with the original pages or catalog and metadata files. If the
+    // system crashes before this point, the WAL can still be used to recover the system to a
+    // state where the checkpoint can be redone.
+    wal->logAndFlushCheckpoint(&clientContext);
+    shadowFile.applyShadowPages(clientContext);
+    // Clear the wal and also shadowing files.
+    auto bufferManager = MemoryManager::Get(clientContext)->getBufferManager();
+    wal->clear();
+    shadowFile.clear(*bufferManager);
+}
+
+void Checkpointer::rollback() {
+    if (isInMemory) {
+        return;
+    }
+    const auto storageManager = StorageManager::Get(clientContext);
+    auto catalog = catalog::Catalog::Get(clientContext);
+    // Any pages freed during the checkpoint are no longer freed
+    storageManager->rollbackCheckpoint(*catalog);
+}
+
+bool Checkpointer::canAutoCheckpoint(const main::ClientContext& clientContext,
+    const transaction::Transaction& transaction) {
+    if (clientContext.isInMemory()) {
+        return false;
+    }
+    if (!clientContext.getDBConfig()->autoCheckpoint) {
+        return false;
+    }
+    if (transaction.isRecovery()) {
+        // Recovery transactions are not allowed to trigger auto checkpoint.
+        return false;
+    }
+    auto wal = WAL::Get(clientContext);
+    const auto expectedSize = transaction.getLocalWAL().getSize() + wal->getFileSize();
+    return expectedSize > clientContext.getDBConfig()->checkpointThreshold;
+}
+
+void Checkpointer::readCheckpoint() {
+    auto storageManager = StorageManager::Get(clientContext);
+    storageManager->initDataFileHandle(common::VirtualFileSystem::GetUnsafe(clientContext),
+        &clientContext);
+    if (!isInMemory && storageManager->getDataFH()->getNumPages() > 0) {
+        readCheckpoint(&clientContext, catalog::Catalog::Get(clientContext), storageManager);
+    }
+    extension::ExtensionManager::Get(clientContext)->autoLoadLinkedExtensions(&clientContext);
+}
+
+void Checkpointer::readCheckpoint(main::ClientContext* context, catalog::Catalog* catalog,
+    StorageManager* storageManager) {
+    auto fileInfo = storageManager->getDataFH()->getFileInfo();
+    auto reader = std::make_unique<common::BufferedFileReader>(*fileInfo);
+    common::Deserializer deSer(std::move(reader));
+    auto currentHeader = std::make_unique<DatabaseHeader>(DatabaseHeader::deserialize(deSer));
+    // If the catalog page range is invalid, it means there is no catalog to read; thus, the
+    // database is empty.
+    if (currentHeader->catalogPageRange.startPageIdx != common::INVALID_PAGE_IDX) {
+        deSer.getReader()->cast<common::BufferedFileReader>()->resetReadOffset(
+            currentHeader->catalogPageRange.startPageIdx * common::LBUG_PAGE_SIZE);
+        catalog->deserialize(deSer);
+        deSer.getReader()->cast<common::BufferedFileReader>()->resetReadOffset(
+            currentHeader->metadataPageRange.startPageIdx * common::LBUG_PAGE_SIZE);
+        storageManager->deserialize(context, catalog, deSer);
+        storageManager->getDataFH()->getPageManager()->deserialize(deSer);
+    }
+    storageManager->setDatabaseHeader(std::move(currentHeader));
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/CMakeLists.txt
new file mode 100644
index 0000000000..86c36f06ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/CMakeLists.txt
@@ -0,0 +1,12 @@
+add_library(lbug_storage_compression
+        OBJECT
+        compression.cpp
+        float_compression.cpp
+        bitpacking_int128.cpp
+        bitpacking_utils.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_storage_compression>
+        PARENT_SCOPE)
+
+target_link_libraries(lbug_storage_compression PRIVATE fastpfor libalp)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/bitpacking_int128.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/bitpacking_int128.cpp
new file mode 100644
index 0000000000..f630c4c0d4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/bitpacking_int128.cpp
@@ -0,0 +1,171 @@
+// Adapted from
+// https://github.com/duckdb/duckdb/blob/main/src/storage/compression/bitpacking_hugeint.cpp
+
+#include "storage/compression/bitpacking_int128.h"
+
+#include "storage/compression/bitpacking_utils.h"
+#include "storage/compression/compression.h"
+
+namespace lbug::storage {
+
+//===--------------------------------------------------------------------===//
+// Unpacking
+//===--------------------------------------------------------------------===//
+
+static void unpackLast(const uint32_t* __restrict in, common::int128_t* __restrict out,
+    uint16_t delta) {
+    const uint8_t LAST_IDX = 31;
+    const uint16_t SHIFT = (delta * 31) % 32;
+    out[LAST_IDX] = in[0] >> SHIFT;
+    if (delta > 32) {
+        out[LAST_IDX] |= static_cast<common::int128_t>(in[1]) << (32 - SHIFT);
+    }
+    if (delta > 64) {
+        out[LAST_IDX] |= static_cast<common::int128_t>(in[2]) << (64 - SHIFT);
+    }
+    if (delta > 96) {
+        out[LAST_IDX] |= static_cast<common::int128_t>(in[3]) << (96 - SHIFT);
+    }
+}
+
+// Unpacks for specific deltas
+static void unpackDelta0(common::int128_t* __restrict out) {
+    for (uint8_t i = 0; i < 32; ++i) {
+        out[i] = 0;
+    }
+}
+
+static void unpackDelta32(const uint32_t* __restrict in, common::int128_t* __restrict out) {
+    for (uint8_t k = 0; k < 32; ++k) {
+        out[k] = static_cast<common::int128_t>(in[k]);
+    }
+}
+
+static void unpackDelta64(const uint32_t* __restrict in, common::int128_t* __restrict out) {
+    for (uint8_t i = 0; i < 32; ++i) {
+        const uint8_t OFFSET = i * 2;
+        out[i] = in[OFFSET];
+        out[i] |= static_cast<common::int128_t>(in[OFFSET + 1]) << 32;
+    }
+}
+
+static void unpackDelta96(const uint32_t* __restrict in, common::int128_t* __restrict out) {
+    for (uint8_t i = 0; i < 32; ++i) {
+        const uint8_t OFFSET = i * 3;
+        out[i] = in[OFFSET];
+        out[i] |= static_cast<common::int128_t>(in[OFFSET + 1]) << 32;
+        out[i] |= static_cast<common::int128_t>(in[OFFSET + 2]) << 64;
+    }
+}
+
+static void unpackDelta128(const uint32_t* __restrict in, common::int128_t* __restrict out) {
+    for (uint8_t i = 0; i < 32; ++i) {
+        const uint8_t OFFSET = i * 4;
+        out[i] = in[OFFSET];
+        out[i] |= static_cast<common::int128_t>(in[OFFSET + 1]) << 32;
+        out[i] |= static_cast<common::int128_t>(in[OFFSET + 2]) << 64;
+        out[i] |= static_cast<common::int128_t>(in[OFFSET + 3]) << 96;
+    }
+}
+
+//===--------------------------------------------------------------------===//
+// Packing
+//===--------------------------------------------------------------------===//
+
+// Packs for specific deltas
+static void packDelta32(const common::int128_t* __restrict in, uint32_t* __restrict out) {
+    for (uint8_t i = 0; i < 32; ++i) {
+        out[i] = static_cast<uint32_t>(in[i]);
+    }
+}
+
+static void packDelta64(const common::int128_t* __restrict in, uint32_t* __restrict out) {
+    for (uint8_t i = 0; i < 32; ++i) {
+        const uint8_t OFFSET = 2 * i;
+        out[OFFSET] = static_cast<uint32_t>(in[i]);
+        out[OFFSET + 1] = static_cast<uint32_t>(in[i] >> 32);
+    }
+}
+
+static void packDelta96(const common::int128_t* __restrict in, uint32_t* __restrict out) {
+    for (uint8_t i = 0; i < 32; ++i) {
+        const uint8_t OFFSET = 3 * i;
+        out[OFFSET] = static_cast<uint32_t>(in[i]);
+        out[OFFSET + 1] = static_cast<uint32_t>(in[i] >> 32);
+        out[OFFSET + 2] = static_cast<uint32_t>(in[i] >> 64);
+    }
+}
+
+static void packDelta128(const common::int128_t* __restrict in, uint32_t* __restrict out) {
+    for (uint8_t i = 0; i < 32; ++i) {
+        const uint8_t OFFSET = 4 * i;
+        out[OFFSET] = static_cast<uint32_t>(in[i]);
+        out[OFFSET + 1] = static_cast<uint32_t>(in[i] >> 32);
+        out[OFFSET + 2] = static_cast<uint32_t>(in[i] >> 64);
+        out[OFFSET + 3] = static_cast<uint32_t>(in[i] >> 96);
+    }
+}
+
+//===--------------------------------------------------------------------===//
+// HugeIntPacker
+//===--------------------------------------------------------------------===//
+
+void Int128Packer::pack(const common::int128_t* __restrict in, uint32_t* __restrict out,
+    uint8_t width) {
+    KU_ASSERT(width <= 128);
+    switch (width) {
+    case 0:
+        break;
+    case 32:
+        packDelta32(in, out);
+        break;
+    case 64:
+        packDelta64(in, out);
+        break;
+    case 96:
+        packDelta96(in, out);
+        break;
+    case 128:
+        packDelta128(in, out);
+        break;
+    default:
+        for (common::idx_t oindex = 0; oindex < IntegerBitpacking<common::int128_t>::CHUNK_SIZE;
+             ++oindex) {
+            BitpackingUtils<common::int128_t>::packSingle(in[oindex],
+                reinterpret_cast<uint8_t*>(out), width, oindex);
+        }
+    }
+}
+
+void Int128Packer::unpack(const uint32_t* __restrict in, common::int128_t* __restrict out,
+    uint8_t width) {
+    KU_ASSERT(width <= 128);
+    switch (width) {
+    case 0:
+        unpackDelta0(out);
+        break;
+    case 32:
+        unpackDelta32(in, out);
+        break;
+    case 64:
+        unpackDelta64(in, out);
+        break;
+    case 96:
+        unpackDelta96(in, out);
+        break;
+    case 128:
+        unpackDelta128(in, out);
+        break;
+    default:
+        for (common::idx_t oindex = 0; oindex < IntegerBitpacking<common::int128_t>::CHUNK_SIZE - 1;
+             ++oindex) {
+            BitpackingUtils<common::int128_t>::unpackSingle(reinterpret_cast<const uint8_t*>(in),
+                out + oindex, width, oindex);
+        }
+        unpackLast(in + +(IntegerBitpacking<common::int128_t>::CHUNK_SIZE - 1) * width /
+                            (sizeof(uint32_t) * 8),
+            out, width);
+    }
+}
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/bitpacking_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/bitpacking_utils.cpp
new file mode 100644
index 0000000000..6c4177952a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/bitpacking_utils.cpp
@@ -0,0 +1,140 @@
+// packSingle/unpackSingle are adapted from
+// https://github.com/duckdb/duckdb/blob/main/src/storage/compression/bitpacking_hugeint.cpp
+
+#include "storage/compression/bitpacking_utils.h"
+
+#include "common/utils.h"
+
+namespace lbug::storage {
+namespace {
+template<size_t compressed_field, std::integral CompressedType,
+    IntegerBitpackingType UncompressedType>
+void unpackSingleField(const CompressedType* __restrict in, UncompressedType* __restrict out,
+    uint16_t delta, uint16_t shiftRight) {
+    static constexpr size_t compressedFieldSizeBits = sizeof(CompressedType) * 8;
+
+    if constexpr (compressed_field == 0) {
+        *out = static_cast<UncompressedType>(in[0]) >> shiftRight;
+    } else {
+        unpackSingleField<compressed_field - 1>(in, out, delta, shiftRight);
+        KU_ASSERT(
+            sizeof(UncompressedType) * 8 > compressed_field * compressedFieldSizeBits - shiftRight);
+        *out |= static_cast<UncompressedType>(in[compressed_field])
+                << (compressed_field * compressedFieldSizeBits - shiftRight);
+    }
+}
+
+template<std::integral CompressedType, IntegerBitpackingType UncompressedType>
+void unpackSingleValueInPlace(const CompressedType* __restrict in, UncompressedType* __restrict out,
+    uint16_t delta, uint16_t shiftRight) {
+    static_assert(sizeof(UncompressedType) <= 4 * sizeof(CompressedType));
+
+    static constexpr size_t compressedFieldSizeBits = sizeof(CompressedType) * 8;
+
+    if (delta + shiftRight <= compressedFieldSizeBits) {
+        unpackSingleField<0>(in, out, delta, shiftRight);
+    } else if (delta + shiftRight > compressedFieldSizeBits &&
+               delta + shiftRight <= 2 * compressedFieldSizeBits) {
+        unpackSingleField<1>(in, out, delta, shiftRight);
+    } else if (delta + shiftRight > 2 * compressedFieldSizeBits &&
+               delta + shiftRight <= 3 * compressedFieldSizeBits) {
+        unpackSingleField<2>(in, out, delta, shiftRight);
+    } else if (delta + shiftRight > 3 * compressedFieldSizeBits &&
+               delta + shiftRight <= 4 * compressedFieldSizeBits) {
+        unpackSingleField<3>(in, out, delta, shiftRight);
+    } else if (delta + shiftRight > 4 * compressedFieldSizeBits) {
+        unpackSingleField<4>(in, out, delta, shiftRight);
+    }
+
+    // we previously copy over the entire most significant field
+    // zero out the bits that are not actually part of the compressed value
+    *out &= common::BitmaskUtils::all1sMaskForLeastSignificantBits<UncompressedType>(delta);
+}
+
+template<bool shiftRight, std::integral CompressedType, IntegerBitpackingType UncompressedType>
+void setValueForBitsMatchingMask(CompressedType& out, UncompressedType unshiftedValue,
+    UncompressedType unshiftedMask, size_t shift) {
+    CompressedType valueToSet = 0;
+    CompressedType mask = 0;
+    if constexpr (shiftRight) {
+        valueToSet = static_cast<CompressedType>((unshiftedValue & unshiftedMask) >> shift);
+        mask = static_cast<CompressedType>(unshiftedMask >> shift);
+    } else {
+        valueToSet = static_cast<CompressedType>((unshiftedValue & unshiftedMask) << shift);
+        mask = static_cast<CompressedType>(unshiftedMask << shift);
+    }
+    const CompressedType bitsToSet = valueToSet & mask;
+    const CompressedType bitsToClear = ~mask | valueToSet;
+    out = (out | bitsToSet) & bitsToClear;
+}
+
+template<size_t compressed_field, std::integral CompressedType,
+    IntegerBitpackingType UncompressedType>
+void packSingleField(const UncompressedType in, CompressedType* __restrict out, uint16_t delta,
+    uint16_t shiftLeft, UncompressedType mask) {
+    static constexpr size_t compressedFieldSizeBits = sizeof(CompressedType) * 8;
+
+    if constexpr (compressed_field == 0) {
+        setValueForBitsMatchingMask<false>(out[0], in, mask, shiftLeft);
+    } else {
+        packSingleField<compressed_field - 1>(in, out, delta, shiftLeft, mask);
+        KU_ASSERT(
+            sizeof(UncompressedType) * 8 > compressed_field * compressedFieldSizeBits - shiftLeft);
+
+        setValueForBitsMatchingMask<true>(out[compressed_field], in, mask,
+            (compressed_field * compressedFieldSizeBits - shiftLeft));
+    }
+}
+
+template<std::integral CompressedType, IntegerBitpackingType UncompressedType>
+void packSingleImpl(const UncompressedType in, CompressedType* __restrict out, uint16_t delta,
+    uint16_t shiftLeft, UncompressedType mask) {
+    static_assert(sizeof(UncompressedType) <= 4 * sizeof(CompressedType));
+
+    static constexpr size_t compressedFieldSizeBits = sizeof(CompressedType) * 8;
+
+    if (delta + shiftLeft <= compressedFieldSizeBits) {
+        packSingleField<0>(in, out, delta, shiftLeft, mask);
+    } else if (delta + shiftLeft > compressedFieldSizeBits &&
+               delta + shiftLeft <= 2 * compressedFieldSizeBits) {
+        packSingleField<1>(in, out, delta, shiftLeft, mask);
+    } else if (delta + shiftLeft > 2 * compressedFieldSizeBits &&
+               delta + shiftLeft <= 3 * compressedFieldSizeBits) {
+        packSingleField<2>(in, out, delta, shiftLeft, mask);
+    } else if (delta + shiftLeft > 3 * compressedFieldSizeBits &&
+               delta + shiftLeft <= 4 * compressedFieldSizeBits) {
+        packSingleField<3>(in, out, delta, shiftLeft, mask);
+    } else if (delta + shiftLeft > 4 * compressedFieldSizeBits) {
+        packSingleField<4>(in, out, delta, shiftLeft, mask);
+    }
+}
+} // namespace
+
+template<IntegerBitpackingType UncompressedType>
+void BitpackingUtils<UncompressedType>::unpackSingle(const uint8_t* __restrict srcCursor,
+    UncompressedType* __restrict dst, uint16_t bitWidth, size_t srcOffset) {
+    const size_t srcBufferOffset = srcOffset * bitWidth / sizeOfCompressedTypeBits;
+    const size_t shiftRight = srcOffset * bitWidth % sizeOfCompressedTypeBits;
+
+    const auto* castedSrcCursor =
+        reinterpret_cast<const CompressedType*>(srcCursor) + srcBufferOffset;
+    unpackSingleValueInPlace(castedSrcCursor, dst, bitWidth, shiftRight);
+}
+
+template<IntegerBitpackingType UncompressedType>
+void BitpackingUtils<UncompressedType>::packSingle(const UncompressedType src,
+    uint8_t* __restrict dstBuffer, uint16_t bitWidth, size_t dstOffset) {
+    const size_t dstBufferOffset = dstOffset * bitWidth / sizeOfCompressedTypeBits;
+    const size_t shiftLeft = dstOffset * bitWidth % sizeOfCompressedTypeBits;
+
+    auto* castedDstBuffer = reinterpret_cast<CompressedType*>(dstBuffer) + dstBufferOffset;
+    packSingleImpl(src, castedDstBuffer, bitWidth, shiftLeft,
+        common::BitmaskUtils::all1sMaskForLeastSignificantBits<UncompressedType>(bitWidth));
+}
+
+template struct BitpackingUtils<common::int128_t>;
+template struct BitpackingUtils<uint64_t>;
+template struct BitpackingUtils<uint32_t>;
+template struct BitpackingUtils<uint16_t>;
+template struct BitpackingUtils<uint8_t>;
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/compression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/compression.cpp
new file mode 100644
index 0000000000..ffaf2ff363
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/compression.cpp
@@ -0,0 +1,1251 @@
+#include "storage/compression/compression.h"
+
+#include <algorithm>
+#include <cstdint>
+#include <limits>
+#include <string>
+
+#include "common/assert.h"
+#include "common/exception/not_implemented.h"
+#include "common/exception/storage.h"
+#include "common/null_mask.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/type_utils.h"
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "fastpfor/bitpackinghelpers.h"
+#include "storage/compression/bitpacking_int128.h"
+#include "storage/compression/bitpacking_utils.h"
+#include "storage/compression/float_compression.h"
+#include "storage/compression/sign_extend.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column_chunk_data.h"
+#include <ranges>
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+template<typename T>
+auto getTypedMinMax(std::span<const T> data, const NullMask* nullMask, uint64_t nullMaskOffset) {
+    std::optional<StorageValue> min, max;
+    KU_ASSERT(data.size() > 0);
+    if (!nullMask || nullMask->hasNoNullsGuarantee()) {
+        auto [minRaw, maxRaw] = std::minmax_element(data.begin(), data.end());
+        min = StorageValue(*minRaw);
+        max = StorageValue(*maxRaw);
+    } else {
+        for (uint64_t i = 0; i < data.size(); i++) {
+            if (!nullMask->isNull(nullMaskOffset + i)) {
+                if (!min || data[i] < min->get<T>()) {
+                    min = StorageValue(data[i]);
+                }
+                if (!max || data[i] > max->get<T>()) {
+                    max = StorageValue(data[i]);
+                }
+            }
+        }
+    }
+    return std::make_pair(min, max);
+}
+
+uint32_t getDataTypeSizeInChunk(const common::LogicalType& dataType) {
+    return getDataTypeSizeInChunk(dataType.getPhysicalType());
+}
+
+uint32_t getDataTypeSizeInChunk(const common::PhysicalTypeID& dataType) {
+    switch (dataType) {
+    case PhysicalTypeID::STRING:
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST:
+    case PhysicalTypeID::STRUCT: {
+        return 0;
+    }
+    case PhysicalTypeID::INTERNAL_ID: {
+        return sizeof(offset_t);
+    }
+    default: {
+        auto size = PhysicalTypeUtils::getFixedTypeSize(dataType);
+        KU_ASSERT(size <= LBUG_PAGE_SIZE);
+        return size;
+    }
+    }
+}
+
+ALPMetadata::ALPMetadata(const alp::state& alpState, common::PhysicalTypeID physicalType)
+    : exp(alpState.exp), fac(alpState.fac), exceptionCount(alpState.exceptions_count) {
+    const size_t physicalTypeSize = PhysicalTypeUtils::getFixedTypeSize(physicalType);
+
+    // to get the exception capacity we find the number of bytes needed to store the current
+    // exception count, take the smallest power of 2 greater than or equal to that value
+    // or the size of one page (whichever is larger)
+    // then find how many exceptions fit in that size
+    exceptionCapacity =
+        static_cast<uint64_t>(std::bit_ceil(alpState.exceptions_count * physicalTypeSize)) /
+        physicalTypeSize;
+}
+
+void ALPMetadata::serialize(common::Serializer& serializer) const {
+    serializer.write(exp);
+    serializer.write(fac);
+    serializer.write(exceptionCount);
+    serializer.write(exceptionCapacity);
+}
+
+ALPMetadata ALPMetadata::deserialize(common::Deserializer& deserializer) {
+    ALPMetadata ret;
+    deserializer.deserializeValue(ret.exp);
+    deserializer.deserializeValue(ret.fac);
+    deserializer.deserializeValue(ret.exceptionCount);
+    deserializer.deserializeValue(ret.exceptionCapacity);
+    return ret;
+}
+
+std::unique_ptr<ExtraMetadata> ALPMetadata::copy() {
+    return std::make_unique<ALPMetadata>(*this);
+}
+
+CompressionMetadata::CompressionMetadata(StorageValue min, StorageValue max,
+    CompressionType compression, const alp::state& state, StorageValue minEncoded,
+    StorageValue maxEncoded, common::PhysicalTypeID physicalType)
+    : min(min), max(max), compression(compression),
+      extraMetadata(std::make_unique<ALPMetadata>(state, physicalType)) {
+    if (compression == CompressionType::ALP) {
+        children.emplace_back(minEncoded, maxEncoded,
+            minEncoded == maxEncoded ? CompressionType::CONSTANT :
+                                       CompressionType::INTEGER_BITPACKING);
+    }
+}
+
+const CompressionMetadata& CompressionMetadata::getChild(offset_t idx) const {
+    KU_ASSERT(idx < getChildCount(compression));
+    return children[idx];
+}
+
+CompressionMetadata::CompressionMetadata(const CompressionMetadata& o)
+    : min{o.min}, max{o.max}, compression{o.compression}, children{o.children} {
+    if (o.extraMetadata.has_value()) {
+        this->extraMetadata = o.extraMetadata.value()->copy();
+    }
+}
+
+CompressionMetadata& CompressionMetadata::operator=(const CompressionMetadata& o) {
+    if (this != &o) {
+        min = o.min;
+        max = o.max;
+        compression = o.compression;
+        if (o.extraMetadata.has_value()) {
+            extraMetadata = o.extraMetadata.value()->copy();
+        } else {
+            extraMetadata = {};
+        }
+        children = o.children;
+    }
+    return *this;
+}
+
+void CompressionMetadata::serialize(Serializer& serializer) const {
+    serializer.write(min);
+    serializer.write(max);
+    serializer.write(compression);
+
+    if (compression == CompressionType::ALP) {
+        floatMetadata()->serialize(serializer);
+    }
+
+    KU_ASSERT(children.size() == getChildCount(compression));
+    for (size_t i = 0; i < children.size(); ++i) {
+        children[i].serialize(serializer);
+    }
+}
+
+CompressionMetadata CompressionMetadata::deserialize(common::Deserializer& deserializer) {
+    StorageValue min{};
+    StorageValue max{};
+    CompressionType compressionType{};
+    deserializer.deserializeValue(min);
+    deserializer.deserializeValue(max);
+    deserializer.deserializeValue(compressionType);
+
+    CompressionMetadata ret(min, max, compressionType);
+
+    if (compressionType == CompressionType::ALP) {
+        auto alpMetadata = std::make_unique<ALPMetadata>(ALPMetadata::deserialize(deserializer));
+        ret.extraMetadata = std::move(alpMetadata);
+    }
+
+    for (size_t i = 0; i < getChildCount(compressionType); ++i) {
+        ret.children.push_back(deserialize(deserializer));
+    }
+
+    return ret;
+}
+
+bool CompressionMetadata::canAlwaysUpdateInPlace() const {
+    switch (compression) {
+    case CompressionType::BOOLEAN_BITPACKING:
+    case CompressionType::UNCOMPRESSED: {
+        return true;
+    }
+    case CompressionType::CONSTANT:
+    case CompressionType::ALP:
+    case CompressionType::INTEGER_BITPACKING: {
+        return false;
+    }
+    default: {
+        throw common::StorageException(
+            "Unknown compression type with ID " + std::to_string((uint8_t)compression));
+    }
+    }
+}
+
+bool CompressionMetadata::canUpdateInPlace(const uint8_t* data, uint32_t pos, uint64_t numValues,
+    PhysicalTypeID physicalType, InPlaceUpdateLocalState& localUpdateState,
+    const std::optional<NullMask>& nullMask) const {
+    if (canAlwaysUpdateInPlace()) {
+        return true;
+    }
+    switch (compression) {
+    case CompressionType::CONSTANT: {
+        // Value can be updated in place only if it is identical to the value already stored.
+        switch (physicalType) {
+        case PhysicalTypeID::BOOL: {
+            for (uint64_t i = pos; i < pos + numValues; i++) {
+                if (nullMask && nullMask->isNull(i)) {
+                    continue;
+                }
+                if (NullMask::isNull(reinterpret_cast<const uint64_t*>(data), i) !=
+                    static_cast<bool>(min.unsignedInt)) {
+                    return false;
+                }
+            }
+            return true;
+        }
+        default: {
+            for (uint64_t i = pos; i < pos + numValues; i++) {
+                if (nullMask && nullMask->isNull(i)) {
+                    continue;
+                }
+                auto size = getDataTypeSizeInChunk(physicalType);
+                if (memcmp(data + i * size, &min.unsignedInt, size) != 0) {
+                    return false;
+                }
+            }
+            return true;
+        }
+        }
+    }
+    case CompressionType::BOOLEAN_BITPACKING:
+    case CompressionType::UNCOMPRESSED: {
+        return true;
+    }
+    case CompressionType::ALP: {
+        return TypeUtils::visit(
+            physicalType,
+            [&]<std::floating_point T>(T) {
+                auto values = std::span<const T>(reinterpret_cast<const T*>(data) + pos, numValues);
+                return FloatCompression<T>::canUpdateInPlace(values, *this, localUpdateState,
+                    std::move(nullMask), pos);
+            },
+            [&](auto) {
+                throw common::StorageException("Attempted to read from a column chunk which "
+                                               "uses float compression but does "
+                                               "not have a supported physical type: " +
+                                               PhysicalTypeUtils::toString(physicalType));
+                return false;
+            });
+    }
+    case CompressionType::INTEGER_BITPACKING: {
+        auto cdata = const_cast<uint8_t*>(data);
+        return TypeUtils::visit(
+            physicalType,
+            [&]<IntegerBitpackingType T>(T) {
+                auto values = std::span<T>(reinterpret_cast<T*>(cdata) + pos, numValues);
+                return IntegerBitpacking<T>::canUpdateInPlace(values, *this, std::move(nullMask),
+                    pos);
+            },
+            [&](internalID_t) {
+                auto values =
+                    std::span<uint64_t>(reinterpret_cast<uint64_t*>(cdata) + pos, numValues);
+                return IntegerBitpacking<uint64_t>::canUpdateInPlace(values, *this,
+                    std::move(nullMask), pos);
+            },
+            [&](auto) {
+                throw common::StorageException("Attempted to read from a column chunk which "
+                                               "uses integer bitpacking but does "
+                                               "not have a supported integer physical type: " +
+                                               PhysicalTypeUtils::toString(physicalType));
+                return false;
+            });
+    }
+    default: {
+        throw common::StorageException(
+            "Unknown compression type with ID " + std::to_string((uint8_t)compression));
+    }
+    }
+}
+
+uint64_t CompressionMetadata::numValues(uint64_t pageSize, const LogicalType& dataType) const {
+    return numValues(pageSize, dataType.getPhysicalType());
+}
+
+uint64_t CompressionMetadata::numValues(uint64_t pageSize, common::PhysicalTypeID dataType) const {
+    switch (compression) {
+    case CompressionType::CONSTANT: {
+        return std::numeric_limits<uint64_t>::max();
+    }
+    case CompressionType::UNCOMPRESSED: {
+        return Uncompressed::numValues(pageSize, dataType);
+    }
+    case CompressionType::INTEGER_BITPACKING: {
+        switch (dataType) {
+        case PhysicalTypeID::INT128:
+            return IntegerBitpacking<int128_t>::numValues(pageSize, *this);
+        case PhysicalTypeID::INT64:
+            return IntegerBitpacking<int64_t>::numValues(pageSize, *this);
+        case PhysicalTypeID::INT32:
+            return IntegerBitpacking<int32_t>::numValues(pageSize, *this);
+        case PhysicalTypeID::INT16:
+            return IntegerBitpacking<int16_t>::numValues(pageSize, *this);
+        case PhysicalTypeID::INT8:
+            return IntegerBitpacking<int8_t>::numValues(pageSize, *this);
+        case PhysicalTypeID::INTERNAL_ID:
+        case PhysicalTypeID::UINT64:
+            return IntegerBitpacking<uint64_t>::numValues(pageSize, *this);
+        case PhysicalTypeID::UINT32:
+            return IntegerBitpacking<uint32_t>::numValues(pageSize, *this);
+        case PhysicalTypeID::UINT16:
+            return IntegerBitpacking<uint16_t>::numValues(pageSize, *this);
+        case PhysicalTypeID::UINT8:
+            return IntegerBitpacking<uint8_t>::numValues(pageSize, *this);
+        default: {
+            throw common::StorageException(
+                "Attempted to read from a column chunk which uses integer bitpacking but does "
+                "not "
+                "have a supported integer physical type: " +
+                PhysicalTypeUtils::toString(dataType));
+        }
+        }
+    }
+    case CompressionType::ALP: {
+        switch (dataType) {
+        case PhysicalTypeID::DOUBLE: {
+            return FloatCompression<double>::numValues(pageSize, *this);
+        }
+        case PhysicalTypeID::FLOAT: {
+            return FloatCompression<float>::numValues(pageSize, *this);
+        }
+        default: {
+            throw common::StorageException(
+                "Attempted to read from a column chunk which uses float compression but does "
+                "not "
+                "have a supported physical type: " +
+                PhysicalTypeUtils::toString(dataType));
+        }
+        }
+    }
+    case CompressionType::BOOLEAN_BITPACKING: {
+        return BooleanBitpacking::numValues(pageSize);
+    }
+    default: {
+        throw common::StorageException(
+            "Unknown compression type with ID " + std::to_string((uint8_t)compression));
+    }
+    }
+}
+
+size_t CompressionMetadata::getChildCount(CompressionType compressionType) {
+    switch (compressionType) {
+    case CompressionType::ALP: {
+        return 1;
+    }
+    default: {
+        return 0;
+    }
+    }
+}
+
+std::optional<CompressionMetadata> ConstantCompression::analyze(const ColumnChunkData& chunk) {
+    switch (chunk.getDataType().getPhysicalType()) {
+    // Only values that can fit in the CompressionMetadata's data field can use constant
+    // compression
+    case PhysicalTypeID::BOOL: {
+        if (chunk.getCapacity() == 0) {
+            return std::optional(
+                CompressionMetadata(StorageValue(0), StorageValue(0), CompressionType::CONSTANT));
+        }
+        auto firstValue = chunk.getValue<bool>(0);
+
+        // TODO(bmwinger): This could be optimized. We could do bytewise comparison with memcmp,
+        // but we need to make sure to stop at the end of the values to avoid false positives
+        for (auto i = 1u; i < chunk.getNumValues(); i++) {
+            // If any value is different from the first one, we can't use constant compression
+            if (firstValue != chunk.getValue<bool>(i)) {
+                return std::nullopt;
+            }
+        }
+        auto value = StorageValue(firstValue);
+        return std::optional(CompressionMetadata(value, value, CompressionType::CONSTANT));
+    }
+    case PhysicalTypeID::INTERNAL_ID:
+    case PhysicalTypeID::DOUBLE:
+    case PhysicalTypeID::FLOAT:
+    case PhysicalTypeID::UINT8:
+    case PhysicalTypeID::UINT16:
+    case PhysicalTypeID::UINT32:
+    case PhysicalTypeID::UINT64:
+    case PhysicalTypeID::INT8:
+    case PhysicalTypeID::INT16:
+    case PhysicalTypeID::INT32:
+    case PhysicalTypeID::INT64:
+    case PhysicalTypeID::INT128: {
+        uint8_t size = chunk.getNumBytesPerValue();
+        StorageValue value{};
+        KU_ASSERT(size <= sizeof(value.unsignedInt));
+        // If there are no values, or only one value, we will always use constant compression
+        // since the loop won't execute
+        for (auto i = 1u; i < chunk.getNumValues(); i++) {
+            // If any value is different from the first one, we can't use constant compression
+            if (std::memcmp(chunk.getData(), chunk.getData() + i * size, size) != 0) {
+                return std::nullopt;
+            }
+        }
+        if (chunk.getNumValues() > 0) {
+            std::memcpy(&value.unsignedInt, chunk.getData(), size);
+        }
+        return std::optional(CompressionMetadata(value, value, CompressionType::CONSTANT));
+    }
+    default: {
+        return std::optional<CompressionMetadata>();
+    }
+    }
+}
+
+uint64_t Uncompressed::numValues(uint64_t dataSize, common::PhysicalTypeID physicalType) {
+    uint32_t numBytesPerValue = getDataTypeSizeInChunk(physicalType);
+    return numBytesPerValue == 0 ? UINT64_MAX : dataSize / numBytesPerValue;
+}
+
+uint64_t Uncompressed::numValues(uint64_t dataSize, const common::LogicalType& logicalType) {
+    return numValues(dataSize, logicalType.getPhysicalType());
+}
+
+std::string CompressionMetadata::toString(const PhysicalTypeID physicalType) const {
+    switch (compression) {
+    case CompressionType::UNCOMPRESSED: {
+        return "UNCOMPRESSED";
+    }
+    case CompressionType::ALP: {
+        uint8_t bitWidth = TypeUtils::visit(
+            physicalType,
+            [&]<std::floating_point T>(T) {
+                static constexpr common::idx_t BITPACKING_CHILD_IDX = 0;
+                return IntegerBitpacking<typename FloatCompression<T>::EncodedType>::getPackingInfo(
+                    getChild(BITPACKING_CHILD_IDX))
+                    .bitWidth;
+            },
+            [](auto) -> uint8_t { KU_UNREACHABLE; });
+        return stringFormat("FLOAT_COMPRESSION[{}], {} Exceptions", bitWidth,
+            floatMetadata()->exceptionCount);
+    }
+    case CompressionType::INTEGER_BITPACKING: {
+        uint8_t bitWidth = TypeUtils::visit(
+            physicalType,
+            [&](common::internalID_t) {
+                return IntegerBitpacking<uint64_t>::getPackingInfo(*this).bitWidth;
+            },
+            [](bool) -> uint8_t { KU_UNREACHABLE; },
+            [&]<numeric_utils::IsIntegral T>(
+                T) { return IntegerBitpacking<T>::getPackingInfo(*this).bitWidth; },
+            [](auto) -> uint8_t { KU_UNREACHABLE; });
+        return stringFormat("INTEGER_BITPACKING[{}]", bitWidth);
+    }
+    case CompressionType::BOOLEAN_BITPACKING: {
+        return "BOOLEAN_BITPACKING";
+    }
+    case CompressionType::CONSTANT: {
+        return "CONSTANT";
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+void ConstantCompression::decompressValues(uint8_t* dstBuffer, uint64_t dstOffset,
+    uint64_t numValues, common::PhysicalTypeID physicalType, uint32_t numBytesPerValue,
+    const CompressionMetadata& metadata) {
+    auto start = dstBuffer + dstOffset * numBytesPerValue;
+    auto end = dstBuffer + (dstOffset + numValues) * numBytesPerValue;
+
+    TypeUtils::visit(
+        physicalType,
+        [&](common::internalID_t) {
+            std::fill(reinterpret_cast<uint64_t*>(start), reinterpret_cast<uint64_t*>(end),
+                metadata.min.get<uint64_t>());
+        },
+        [&]<typename T>
+            requires(numeric_utils::IsIntegral<T> || std::floating_point<T>)
+        (T) {
+            std::fill(reinterpret_cast<T*>(start), reinterpret_cast<T*>(end),
+                metadata.min.get<T>());
+        },
+        [&](auto) {
+            throw NotImplementedException("CONSTANT compression is not implemented for type " +
+                                          PhysicalTypeUtils::toString(physicalType));
+        });
+}
+
+void ConstantCompression::decompressFromPage(const uint8_t* /*srcBuffer*/, uint64_t /*srcOffset*/,
+    uint8_t* dstBuffer, uint64_t dstOffset, uint64_t numValues,
+    const CompressionMetadata& metadata) const {
+    return decompressValues(dstBuffer, dstOffset, numValues, dataType, numBytesPerValue, metadata);
+}
+
+void ConstantCompression::copyFromPage(const uint8_t* srcBuffer, uint64_t srcOffset,
+    uint8_t* dstBuffer, uint64_t dstOffset, uint64_t numValues,
+    const CompressionMetadata& metadata) const {
+    if (dataType == common::PhysicalTypeID::BOOL) {
+        common::NullMask::setNullRange(reinterpret_cast<uint64_t*>(dstBuffer), dstOffset, numValues,
+            metadata.min.unsignedInt);
+    } else {
+        decompressFromPage(srcBuffer, srcOffset, dstBuffer, dstOffset, numValues, metadata);
+    }
+}
+
+template<typename T>
+inline T abs(T value);
+
+template<typename T>
+    requires std::is_unsigned_v<T>
+inline T abs(T value) {
+    return value;
+}
+
+template<typename T>
+    requires std::is_signed_v<T>
+inline T abs(T value) {
+    return std::abs(value);
+}
+
+template<>
+inline int128_t abs<int128_t>(int128_t value) {
+    return value >= 0 ? value : -value;
+}
+
+template<IntegerBitpackingType T>
+BitpackInfo<T> IntegerBitpacking<T>::getPackingInfo(const CompressionMetadata& metadata) {
+    auto max = metadata.max.get<T>();
+    auto min = metadata.min.get<T>();
+    bool hasNegative = false;
+    T offset = 0;
+    uint8_t bitWidth = 0;
+    // Frame of reference encoding is only used when values are either all positive or all
+    // negative, and when we will save at least 1 bit per value. when the chunk was first
+    // compressed
+    if (min > 0 && max > 0 &&
+        numeric_utils::bitWidth((U)(max - min)) < numeric_utils::bitWidth((U)max)) {
+        offset = min;
+        bitWidth = static_cast<uint8_t>(numeric_utils::bitWidth((U)(max - min)));
+        hasNegative = false;
+    } else if (min < 0 && max < 0 &&
+               numeric_utils::bitWidth((U)(min - max)) < numeric_utils::bitWidth((U)max)) {
+        offset = (U)max;
+        bitWidth = static_cast<uint8_t>(numeric_utils::bitWidth((U)(min - max))) + 1;
+        // This is somewhat suboptimal since we know that the values are all negative
+        // We could use an offset equal to the minimum, but values which are all negative are
+        // probably going to grow in the negative direction, leading to many re-compressions
+        // when inserting
+        hasNegative = true;
+    } else if (min < 0) {
+        bitWidth =
+            static_cast<uint8_t>(numeric_utils::bitWidth((U)std::max(abs<T>(min), abs<T>(max)))) +
+            1;
+        hasNegative = true;
+    } else {
+        bitWidth =
+            static_cast<uint8_t>(numeric_utils::bitWidth((U)std::max(abs<T>(min), abs<T>(max))));
+        hasNegative = false;
+    }
+    return BitpackInfo<T>{bitWidth, hasNegative, offset};
+}
+
+template<IntegerBitpackingType T>
+bool IntegerBitpacking<T>::canUpdateInPlace(std::span<const T> values,
+    const CompressionMetadata& metadata, const std::optional<common::NullMask>& nullMask,
+    uint64_t nullMaskOffset) {
+    auto info = getPackingInfo(metadata);
+    auto [min, max] = getTypedMinMax<T>(values, nullMask ? &*nullMask : nullptr, nullMaskOffset);
+    KU_ASSERT((min && max) || (!min && !max));
+    // If all values are null update can trivially be done in-place
+    if (!min) {
+        return true;
+    }
+    auto newMetadata =
+        CompressionMetadata(StorageValue(std::min(metadata.min.get<T>(), min->template get<T>())),
+            StorageValue(std::max(metadata.max.get<T>(), max->template get<T>())),
+            metadata.compression);
+    auto newInfo = getPackingInfo(newMetadata);
+
+    if (info.bitWidth != newInfo.bitWidth || info.hasNegative != newInfo.hasNegative ||
+        info.offset != newInfo.offset) {
+        return false;
+    }
+    return true;
+}
+
+template<typename T>
+void fastunpack(const uint8_t* in, T* out, uint32_t bitWidth) {
+    if constexpr (std::is_same_v<numeric_utils::MakeSignedT<T>, int32_t> ||
+                  std::is_same_v<numeric_utils::MakeSignedT<T>, int64_t>) {
+        FastPForLib::fastunpack((const uint32_t*)in, out, bitWidth);
+    } else if constexpr (std::is_same_v<numeric_utils::MakeSignedT<T>, int16_t>) {
+        FastPForLib::fastunpack((const uint16_t*)in, out, bitWidth);
+    } else if constexpr (std::is_same_v<numeric_utils::MakeSignedT<T>, int8_t>) {
+        FastPForLib::fastunpack((const uint8_t*)in, out, bitWidth);
+    } else {
+        static_assert(std::is_same_v<numeric_utils::MakeSignedT<T>, int128_t>);
+        Int128Packer::unpack(reinterpret_cast<const uint32_t*>(in), out, bitWidth);
+    }
+}
+
+template<typename T>
+void fastpack(const T* in, uint8_t* out, uint8_t bitWidth) {
+    if constexpr (std::is_same_v<numeric_utils::MakeSignedT<T>, int32_t> ||
+                  std::is_same_v<numeric_utils::MakeSignedT<T>, int64_t>) {
+        FastPForLib::fastpack(in, (uint32_t*)out, bitWidth);
+    } else if constexpr (std::is_same_v<numeric_utils::MakeSignedT<T>, int16_t>) {
+        FastPForLib::fastpack(in, (uint16_t*)out, bitWidth);
+    } else if constexpr (std::is_same_v<numeric_utils::MakeSignedT<T>, int8_t>) {
+        FastPForLib::fastpack(in, (uint8_t*)out, bitWidth);
+    } else {
+        static_assert(std::is_same_v<numeric_utils::MakeSignedT<T>, int128_t>);
+        Int128Packer::pack(in, reinterpret_cast<uint32_t*>(out), bitWidth);
+    }
+}
+
+template<IntegerBitpackingType T>
+void IntegerBitpacking<T>::setPartialChunkInPlace(const uint8_t* srcBuffer, offset_t posInSrc,
+    uint8_t* dstBuffer, offset_t posInDst, offset_t numValues, const BitpackInfo<T>& header) const {
+    U tmpChunk[CHUNK_SIZE];
+    copyValuesToTempChunkWithOffset(reinterpret_cast<const U*>(srcBuffer) + posInSrc, tmpChunk,
+        header, numValues);
+    packPartialChunk(tmpChunk, dstBuffer, posInDst, header, numValues);
+}
+
+template<IntegerBitpackingType T>
+void IntegerBitpacking<T>::setValuesFromUncompressed(const uint8_t* srcBuffer, offset_t posInSrc,
+    uint8_t* dstBuffer, offset_t posInDst, offset_t numValues, const CompressionMetadata& metadata,
+    const NullMask* nullMask) const {
+    KU_UNUSED(nullMask);
+
+    auto header = getPackingInfo(metadata);
+
+    // Null values will usually be 0, which will not be able to be stored if there is a
+    // non-zero offset However we don't care about the value stored for null values
+    // Currently they will be mangled by storage+recovery (underflow in the subtraction
+    // below)
+    KU_ASSERT(numValues == static_cast<offset_t>(std::ranges::count_if(
+                               std::ranges::iota_view{posInSrc, posInSrc + numValues},
+                               [srcBuffer, &metadata, nullMask](offset_t i) {
+                                   auto value = reinterpret_cast<const T*>(srcBuffer)[i];
+                                   return (nullMask && nullMask->isNull(i)) ||
+                                          canUpdateInPlace(std::span(&value, 1), metadata);
+                               })));
+
+    // Data can be considered to be stored in aligned chunks of 32 values
+    // with a size of 32 * bitWidth bits,
+    // or bitWidth 32-bit values (we cast the buffer to a uint32_t* later).
+
+    // update unaligned values in the first chunk
+    auto valuesInFirstChunk = std::min(CHUNK_SIZE - (posInDst % CHUNK_SIZE), numValues);
+    offset_t dstIndex = posInDst;
+    if (valuesInFirstChunk < CHUNK_SIZE) {
+        // update unaligned values in the last chunk
+        setPartialChunkInPlace(srcBuffer, posInSrc, dstBuffer, posInDst, valuesInFirstChunk,
+            header);
+        dstIndex += valuesInFirstChunk;
+    }
+
+    // update chunk-aligned values using fastpack/unpack
+    for (; dstIndex + CHUNK_SIZE <= posInDst + numValues; dstIndex += CHUNK_SIZE) {
+        U chunk[CHUNK_SIZE];
+
+        const size_t chunkIndexOffsetInSrc = posInSrc + dstIndex - posInDst;
+        copyValuesToTempChunkWithOffset(reinterpret_cast<const U*>(srcBuffer) +
+                                            chunkIndexOffsetInSrc,
+            chunk, header, CHUNK_SIZE);
+
+        const offset_t dstOffsetBytes = dstIndex * header.bitWidth / 8;
+        fastpack(chunk, dstBuffer + dstOffsetBytes, header.bitWidth);
+    }
+
+    // update unaligned values in the last chunk
+    const auto lastChunkIndexOffset = dstIndex - posInDst;
+    const size_t unalignedValuesToPack = numValues - lastChunkIndexOffset;
+    if (unalignedValuesToPack > 0) {
+        setPartialChunkInPlace(srcBuffer, posInSrc + lastChunkIndexOffset, dstBuffer,
+            posInDst + lastChunkIndexOffset, unalignedValuesToPack, header);
+    }
+}
+
+template<IntegerBitpackingType T>
+void IntegerBitpacking<T>::getValues(const uint8_t* chunkStart, uint8_t pos, uint8_t* dst,
+    uint8_t numValuesToRead, const BitpackInfo<T>& header) const {
+    const size_t maxReadIndex = pos + numValuesToRead;
+    KU_ASSERT(maxReadIndex <= CHUNK_SIZE);
+
+    for (size_t i = pos; i < maxReadIndex; i++) {
+        // Always use unsigned version of unpacker to prevent sign-bit filling when right
+        // shifting
+        U& out = reinterpret_cast<U*>(dst)[i - pos];
+        BitpackingUtils<U>::unpackSingle(chunkStart, &out, header.bitWidth, i);
+
+        if (header.hasNegative && header.bitWidth > 0) {
+            SignExtend<T, U, 1>((uint8_t*)&out, header.bitWidth);
+        }
+
+        if (header.offset != 0) {
+            reinterpret_cast<T&>(out) += header.offset;
+        }
+    }
+}
+
+template<IntegerBitpackingType T>
+void IntegerBitpacking<T>::packPartialChunk(const U* srcBuffer, uint8_t* dstBuffer, size_t posInDst,
+    BitpackInfo<T> info, size_t numValuesToPack) const {
+    for (size_t i = 0; i < numValuesToPack; ++i) {
+        BitpackingUtils<U>::packSingle(srcBuffer[i], dstBuffer, info.bitWidth, i + posInDst);
+    }
+}
+
+template<IntegerBitpackingType T>
+void IntegerBitpacking<T>::copyValuesToTempChunkWithOffset(const U* srcBuffer, U* tmpBuffer,
+    BitpackInfo<T> info, size_t numValuesToCopy) const {
+    for (auto j = 0u; j < numValuesToCopy; j++) {
+        tmpBuffer[j] = static_cast<U>((T)(srcBuffer[j]) - info.offset);
+    }
+}
+
+template<IntegerBitpackingType T>
+uint64_t IntegerBitpacking<T>::compressNextPage(const uint8_t*& srcBuffer,
+    uint64_t numValuesRemaining, uint8_t* dstBuffer, uint64_t dstBufferSize,
+    const CompressionMetadata& metadata) const {
+    // TODO(bmwinger): this is hacky; we need a better system for dynamically choosing between
+    // algorithms when compressing
+    if (metadata.compression == CompressionType::UNCOMPRESSED) {
+        return Uncompressed(sizeof(T)).compressNextPage(srcBuffer, numValuesRemaining, dstBuffer,
+            dstBufferSize, metadata);
+    }
+    KU_ASSERT(metadata.compression == CompressionType::INTEGER_BITPACKING);
+    auto info = getPackingInfo(metadata);
+    auto bitWidth = info.bitWidth;
+
+    if (bitWidth == 0) {
+        return 0;
+    }
+    auto numValuesToCompress = std::min(numValuesRemaining, numValues(dstBufferSize, info));
+    // Round up to nearest byte
+    auto sizeToCompress =
+        numValuesToCompress * bitWidth / 8 + (numValuesToCompress * bitWidth % 8 != 0);
+    KU_ASSERT(dstBufferSize >= CHUNK_SIZE);
+    KU_ASSERT(dstBufferSize >= sizeToCompress);
+    // This might overflow the source buffer if there are fewer values remaining than the chunk
+    // size so we stop at the end of the last full chunk and use a temporary array to avoid
+    // overflow.
+    if (info.offset == 0) {
+        auto lastFullChunkEnd = numValuesToCompress - numValuesToCompress % CHUNK_SIZE;
+        for (auto i = 0ull; i < lastFullChunkEnd; i += CHUNK_SIZE) {
+            fastpack(reinterpret_cast<const U*>(srcBuffer) + i, dstBuffer + i * bitWidth / 8,
+                bitWidth);
+        }
+        // Pack last partial chunk, avoiding overflows
+        const size_t remainingNumValues = numValuesToCompress % CHUNK_SIZE;
+        if (remainingNumValues > 0) {
+            packPartialChunk(reinterpret_cast<const U*>(srcBuffer) + lastFullChunkEnd,
+                dstBuffer + lastFullChunkEnd * bitWidth / 8, 0, info, remainingNumValues);
+        }
+    } else {
+        U tmp[CHUNK_SIZE];
+        auto lastFullChunkEnd = numValuesToCompress - numValuesToCompress % CHUNK_SIZE;
+        for (auto i = 0ull; i < lastFullChunkEnd; i += CHUNK_SIZE) {
+            copyValuesToTempChunkWithOffset(reinterpret_cast<const U*>(srcBuffer) + i, tmp, info,
+                CHUNK_SIZE);
+            fastpack(tmp, dstBuffer + i * bitWidth / 8, bitWidth);
+        }
+        // Pack last partial chunk, avoiding overflows
+        auto remainingValues = numValuesToCompress % CHUNK_SIZE;
+        if (remainingValues > 0) {
+            copyValuesToTempChunkWithOffset(reinterpret_cast<const U*>(srcBuffer) +
+                                                lastFullChunkEnd,
+                tmp, info, remainingValues);
+            packPartialChunk(tmp, dstBuffer + lastFullChunkEnd * bitWidth / 8, 0, info,
+                remainingValues);
+        }
+    }
+    srcBuffer += numValuesToCompress * sizeof(U);
+    return sizeToCompress;
+}
+
+template<IntegerBitpackingType T>
+void IntegerBitpacking<T>::decompressFromPage(const uint8_t* srcBuffer, uint64_t srcOffset,
+    uint8_t* dstBuffer, uint64_t dstOffset, uint64_t numValues,
+    const CompressionMetadata& metadata) const {
+    auto info = getPackingInfo(metadata);
+
+    auto srcCursor = getChunkStart(srcBuffer, srcOffset, info.bitWidth);
+    auto valuesInFirstChunk = std::min(CHUNK_SIZE - (srcOffset % CHUNK_SIZE), numValues);
+    auto bytesPerChunk = CHUNK_SIZE / 8 * info.bitWidth;
+    auto dstIndex = dstOffset;
+
+    // Copy values which aren't aligned to the start of the chunk
+    if (valuesInFirstChunk < CHUNK_SIZE) {
+        getValues(srcCursor, srcOffset % CHUNK_SIZE, dstBuffer + dstIndex * sizeof(U),
+            valuesInFirstChunk, info);
+        if (numValues == valuesInFirstChunk) {
+            return;
+        }
+        // Start at the end of the first partial chunk
+        srcCursor += bytesPerChunk;
+        dstIndex += valuesInFirstChunk;
+    }
+
+    // Use fastunpack to directly unpack the full-sized chunks
+    for (; dstIndex + CHUNK_SIZE <= dstOffset + numValues; dstIndex += CHUNK_SIZE) {
+        fastunpack(srcCursor, (U*)dstBuffer + dstIndex, info.bitWidth);
+        if (info.hasNegative && info.bitWidth > 0) {
+            SignExtend<T, U, CHUNK_SIZE>(dstBuffer + dstIndex * sizeof(U), info.bitWidth);
+        }
+        if (info.offset != 0) {
+            for (auto i = 0u; i < CHUNK_SIZE; i++) {
+                ((T*)dstBuffer)[dstIndex + i] += info.offset;
+            }
+        }
+        srcCursor += bytesPerChunk;
+    }
+    // Copy remaining values from within the last chunk.
+    if (dstIndex < dstOffset + numValues) {
+        getValues(srcCursor, 0, dstBuffer + dstIndex * sizeof(U), dstOffset + numValues - dstIndex,
+            info);
+    }
+}
+
+template class IntegerBitpacking<int8_t>;
+template class IntegerBitpacking<int16_t>;
+template class IntegerBitpacking<int32_t>;
+template class IntegerBitpacking<int64_t>;
+template class IntegerBitpacking<int128_t>;
+template class IntegerBitpacking<uint8_t>;
+template class IntegerBitpacking<uint16_t>;
+template class IntegerBitpacking<uint32_t>;
+template class IntegerBitpacking<uint64_t>;
+
+void BooleanBitpacking::setValuesFromUncompressed(const uint8_t* srcBuffer, offset_t srcOffset,
+    uint8_t* dstBuffer, offset_t dstOffset, offset_t numValues,
+    const CompressionMetadata& /*metadata*/, const NullMask* /*nullMask*/) const {
+    for (auto i = 0u; i < numValues; i++) {
+        NullMask::setNull((uint64_t*)dstBuffer, dstOffset + i, ((bool*)srcBuffer)[srcOffset + i]);
+    }
+}
+
+uint64_t BooleanBitpacking::compressNextPage(const uint8_t*& srcBuffer, uint64_t numValuesRemaining,
+    uint8_t* dstBuffer, uint64_t dstBufferSize, const CompressionMetadata& /*metadata*/) const {
+    // TODO(bmwinger): Optimize, e.g. using an integer bitpacking function
+    auto numValuesToCompress = std::min(numValuesRemaining, numValues(dstBufferSize));
+    for (auto i = 0ull; i < numValuesToCompress; i++) {
+        NullMask::setNull((uint64_t*)dstBuffer, i, srcBuffer[i]);
+    }
+    srcBuffer += numValuesToCompress / 8;
+    // Will be a multiple of 8 except for the last iteration
+    return numValuesToCompress / 8 + (bool)(numValuesToCompress % 8);
+}
+
+void BooleanBitpacking::decompressFromPage(const uint8_t* srcBuffer, uint64_t srcOffset,
+    uint8_t* dstBuffer, uint64_t dstOffset, uint64_t numValues,
+    const CompressionMetadata& /*metadata*/) const {
+    // TODO(bmwinger): Optimize, e.g. using an integer bitpacking function
+    for (auto i = 0ull; i < numValues; i++) {
+        ((bool*)dstBuffer)[dstOffset + i] = NullMask::isNull((uint64_t*)srcBuffer, srcOffset + i);
+    }
+}
+
+void BooleanBitpacking::copyFromPage(const uint8_t* srcBuffer, uint64_t srcOffset,
+    uint8_t* dstBuffer, uint64_t dstOffset, uint64_t numValues,
+    const CompressionMetadata& /*metadata*/) const {
+    NullMask::copyNullMask(reinterpret_cast<const uint64_t*>(srcBuffer), srcOffset,
+        reinterpret_cast<uint64_t*>(dstBuffer), dstOffset, numValues);
+}
+
+void ReadCompressedValuesFromPageToVector::operator()(const uint8_t* frame, PageCursor& pageCursor,
+    common::ValueVector* resultVector, uint32_t posInVector, uint64_t numValuesToRead,
+    const CompressionMetadata& metadata) {
+    switch (metadata.compression) {
+    case CompressionType::CONSTANT:
+        return constant.decompressFromPage(frame, pageCursor.elemPosInPage, resultVector->getData(),
+            posInVector, numValuesToRead, metadata);
+    case CompressionType::UNCOMPRESSED:
+        return uncompressed.decompressFromPage(frame, pageCursor.elemPosInPage,
+            resultVector->getData(), posInVector, numValuesToRead, metadata);
+    case CompressionType::ALP: {
+        switch (physicalType) {
+        case PhysicalTypeID::DOUBLE: {
+            return FloatCompression<double>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::FLOAT: {
+            return FloatCompression<float>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        default: {
+            throw NotImplementedException("Float Compression is not implemented for type " +
+                                          PhysicalTypeUtils::toString(physicalType));
+        }
+        }
+    }
+    case CompressionType::INTEGER_BITPACKING: {
+        switch (physicalType) {
+        case PhysicalTypeID::INT128: {
+            return IntegerBitpacking<int128_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INT64: {
+            return IntegerBitpacking<int64_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INT32: {
+            return IntegerBitpacking<int32_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INT16: {
+            return IntegerBitpacking<int16_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INT8: {
+            return IntegerBitpacking<int8_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INTERNAL_ID:
+        case PhysicalTypeID::UINT64: {
+            return IntegerBitpacking<uint64_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::UINT32: {
+            return IntegerBitpacking<uint32_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::UINT16: {
+            return IntegerBitpacking<uint16_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::UINT8: {
+            return IntegerBitpacking<uint8_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                resultVector->getData(), posInVector, numValuesToRead, metadata);
+        }
+        default: {
+            throw NotImplementedException("INTEGER_BITPACKING is not implemented for type " +
+                                          PhysicalTypeUtils::toString(physicalType));
+        }
+        }
+    }
+    case CompressionType::BOOLEAN_BITPACKING:
+        return booleanBitpacking.decompressFromPage(frame, pageCursor.elemPosInPage,
+            resultVector->getData(), posInVector, numValuesToRead, metadata);
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void ReadCompressedValuesFromPage::operator()(const uint8_t* frame, PageCursor& pageCursor,
+    uint8_t* result, uint32_t startPosInResult, uint64_t numValuesToRead,
+    const CompressionMetadata& metadata) {
+    switch (metadata.compression) {
+    case CompressionType::CONSTANT:
+        return constant.copyFromPage(frame, pageCursor.elemPosInPage, result, startPosInResult,
+            numValuesToRead, metadata);
+    case CompressionType::UNCOMPRESSED:
+        return uncompressed.decompressFromPage(frame, pageCursor.elemPosInPage, result,
+            startPosInResult, numValuesToRead, metadata);
+    case CompressionType::ALP: {
+        switch (physicalType) {
+        case PhysicalTypeID::DOUBLE: {
+            return FloatCompression<double>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::FLOAT: {
+            return FloatCompression<float>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        default: {
+            throw NotImplementedException("Float Compression is not implemented for type " +
+                                          PhysicalTypeUtils::toString(physicalType));
+        }
+        }
+    }
+    case CompressionType::INTEGER_BITPACKING: {
+        switch (physicalType) {
+        case PhysicalTypeID::INT128: {
+            return IntegerBitpacking<int128_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INT64: {
+            return IntegerBitpacking<int64_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INT32: {
+            return IntegerBitpacking<int32_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INT16: {
+            return IntegerBitpacking<int16_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INT8: {
+            return IntegerBitpacking<int8_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::INTERNAL_ID:
+        case PhysicalTypeID::UINT64: {
+            return IntegerBitpacking<uint64_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::UINT32: {
+            return IntegerBitpacking<uint32_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::UINT16: {
+            return IntegerBitpacking<uint16_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        case PhysicalTypeID::UINT8: {
+            return IntegerBitpacking<int8_t>().decompressFromPage(frame, pageCursor.elemPosInPage,
+                result, startPosInResult, numValuesToRead, metadata);
+        }
+        default: {
+            throw NotImplementedException("INTEGER_BITPACKING is not implemented for type " +
+                                          PhysicalTypeUtils::toString(physicalType));
+        }
+        }
+    }
+    case CompressionType::BOOLEAN_BITPACKING:
+        // Reading into ColumnChunks should be done without decompressing for booleans
+        return booleanBitpacking.copyFromPage(frame, pageCursor.elemPosInPage, result,
+            startPosInResult, numValuesToRead, metadata);
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void WriteCompressedValuesToPage::operator()(uint8_t* frame, uint16_t posInFrame,
+    const uint8_t* data, offset_t dataOffset, offset_t numValues,
+    const CompressionMetadata& metadata, const NullMask* nullMask) {
+    switch (metadata.compression) {
+    case CompressionType::CONSTANT:
+        return constant.setValuesFromUncompressed(data, dataOffset, frame, posInFrame, numValues,
+            metadata, nullMask);
+    case CompressionType::UNCOMPRESSED:
+        return uncompressed.setValuesFromUncompressed(data, dataOffset, frame, posInFrame,
+            numValues, metadata, nullMask);
+    case CompressionType::INTEGER_BITPACKING: {
+        return TypeUtils::visit(physicalType, [&]<typename T>(T) {
+            if constexpr (std::same_as<T, bool>) {
+                throw NotImplementedException(
+                    "INTEGER_BITPACKING is not implemented for type bool");
+            } else if constexpr (std::same_as<T, internalID_t>) {
+                IntegerBitpacking<uint64_t>().setValuesFromUncompressed(data, dataOffset, frame,
+                    posInFrame, numValues, metadata, nullMask);
+            } else if constexpr (numeric_utils::IsIntegral<T>) {
+                return IntegerBitpacking<T>().setValuesFromUncompressed(data, dataOffset, frame,
+                    posInFrame, numValues, metadata, nullMask);
+            } else {
+                throw NotImplementedException("INTEGER_BITPACKING is not implemented for type " +
+                                              PhysicalTypeUtils::toString(physicalType));
+            }
+        });
+    }
+    case CompressionType::ALP: {
+        return TypeUtils::visit(physicalType, [&]<typename T>(T) {
+            if constexpr (std::is_floating_point_v<T>) {
+                FloatCompression<T>().setValuesFromUncompressed(data, dataOffset, frame, posInFrame,
+                    numValues, metadata, nullMask);
+            } else {
+                throw NotImplementedException("FLOAT_COMPRESSION is not implemented for type " +
+                                              PhysicalTypeUtils::toString(physicalType));
+            }
+        });
+    }
+    case CompressionType::BOOLEAN_BITPACKING:
+        return booleanBitpacking.copyFromPage(data, dataOffset, frame, posInFrame, numValues,
+            metadata);
+
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void WriteCompressedValuesToPage::operator()(uint8_t* frame, uint16_t posInFrame,
+    common::ValueVector* vector, uint32_t posInVector, offset_t numValues,
+    const CompressionMetadata& metadata) {
+    if (metadata.compression == CompressionType::BOOLEAN_BITPACKING) {
+        booleanBitpacking.setValuesFromUncompressed(vector->getData(), posInVector, frame,
+            posInFrame, numValues, metadata, &vector->getNullMask());
+    } else {
+        (*this)(frame, posInFrame, vector->getData(), posInVector, 1, metadata,
+            &vector->getNullMask());
+    }
+}
+
+std::optional<StorageValue> StorageValue::readFromVector(const common::ValueVector& vector,
+    common::offset_t posInVector) {
+    return TypeUtils::visit(
+        vector.dataType.getPhysicalType(),
+        // TODO(bmwinger): concept for supported storagevalue types
+        [&]<StorageValueType T>(
+            T) { return std::make_optional(StorageValue(vector.getValue<T>(posInVector))); },
+        [](auto) { return std::optional<StorageValue>(); });
+}
+
+bool StorageValue::gt(const StorageValue& other, common::PhysicalTypeID type) const {
+    switch (type) {
+    case common::PhysicalTypeID::BOOL:
+    case common::PhysicalTypeID::LIST:
+    case common::PhysicalTypeID::ARRAY:
+    case common::PhysicalTypeID::INTERNAL_ID:
+    case common::PhysicalTypeID::STRING:
+    case common::PhysicalTypeID::UINT64:
+    case common::PhysicalTypeID::UINT32:
+    case common::PhysicalTypeID::UINT16:
+    case common::PhysicalTypeID::UINT8:
+        return this->unsignedInt > other.unsignedInt;
+    case common::PhysicalTypeID::INT128:
+        return this->signedInt128 > other.signedInt128;
+    case common::PhysicalTypeID::INT64:
+    case common::PhysicalTypeID::INT32:
+    case common::PhysicalTypeID::INT16:
+    case common::PhysicalTypeID::INT8:
+        return this->signedInt > other.signedInt;
+    case common::PhysicalTypeID::FLOAT:
+    case common::PhysicalTypeID::DOUBLE:
+        return this->floatVal > other.floatVal;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::pair<std::optional<StorageValue>, std::optional<StorageValue>> getMinMaxStorageValue(
+    const uint8_t* data, uint64_t offset, uint64_t numValues, PhysicalTypeID physicalType,
+    const NullMask* nullMask, bool valueRequiredIfUnsupported) {
+    std::pair<std::optional<StorageValue>, std::optional<StorageValue>> returnValue;
+
+    TypeUtils::visit(
+        physicalType,
+        [&](bool) {
+            if (numValues > 0) {
+                const auto boolData = reinterpret_cast<const uint64_t*>(data);
+                if (!nullMask || nullMask->hasNoNullsGuarantee()) {
+                    auto [minRaw, maxRaw] = NullMask::getMinMax(boolData, offset, numValues);
+                    returnValue = std::make_pair(std::optional(StorageValue(minRaw)),
+                        std::optional(StorageValue(maxRaw)));
+                } else {
+                    std::optional<StorageValue> min, max;
+                    for (size_t i = offset; i < offset + numValues; i++) {
+                        if (!nullMask || !nullMask->isNull(i)) {
+                            auto boolValue = NullMask::isNull(boolData, i);
+                            if (!max || boolValue > max->get<bool>()) {
+                                max = boolValue;
+                            }
+                            if (!min || boolValue < min->get<bool>()) {
+                                min = boolValue;
+                            }
+                        }
+                    }
+                    returnValue = std::make_pair(min, max);
+                }
+            }
+        },
+        [&]<typename T>(T)
+            requires(numeric_utils::IsIntegral<T> || std::floating_point<T>)
+        {
+            if (numValues > 0) {
+                auto typedData = std::span(reinterpret_cast<const T*>(data) + offset, numValues);
+                returnValue = getTypedMinMax(typedData, nullMask ? &*nullMask : nullptr, offset);
+            }
+        },
+        [&]<typename T>(T)
+            requires(std::same_as<T, internalID_t>)
+        {
+            if (numValues > 0) {
+                const auto typedData =
+                    std::span(reinterpret_cast<const uint64_t*>(data) + offset, numValues);
+                returnValue = getTypedMinMax(typedData, nullMask ? &*nullMask : nullptr, offset);
+            }
+        },
+        [&]<typename T>(T)
+            requires(std::same_as<T, interval_t> || std::same_as<T, struct_entry_t> ||
+                     std::same_as<T, ku_string_t> || std::same_as<T, list_entry_t> ||
+                     std::same_as<T, uint128_t>)
+        {
+            if (valueRequiredIfUnsupported) {
+                // For unsupported types on the first copy,
+                // they need a non-optional value to distinguish them
+                // from supported types where every value is null
+                returnValue.first = std::numeric_limits<uint64_t>::min();
+                returnValue.second = std::numeric_limits<uint64_t>::max();
+            }
+        });
+    return returnValue;
+}
+std::pair<std::optional<StorageValue>, std::optional<StorageValue>> getMinMaxStorageValue(
+    const ColumnChunkData& data, uint64_t offset, uint64_t numValues, PhysicalTypeID physicalType,
+    bool valueRequiredIfUnsupported) {
+    auto nullMask = data.getNullMask();
+    return getMinMaxStorageValue(data.getData(), offset, numValues, physicalType,
+        nullMask ? &*nullMask : nullptr, valueRequiredIfUnsupported);
+}
+
+std::pair<std::optional<StorageValue>, std::optional<StorageValue>> getMinMaxStorageValue(
+    const ValueVector& data, uint64_t offset, uint64_t numValues, PhysicalTypeID physicalType,
+    bool valueRequiredIfUnsupported) {
+    std::pair<std::optional<StorageValue>, std::optional<StorageValue>> returnValue;
+    auto& nullMask = data.getNullMask();
+
+    TypeUtils::visit(
+        physicalType,
+        [&]<typename T>(T)
+            requires(numeric_utils::IsIntegral<T> || std::floating_point<T>)
+        {
+            if (numValues > 0) {
+                auto typedData =
+                    std::span(reinterpret_cast<const T*>(data.getData()) + offset, numValues);
+                returnValue = getTypedMinMax(typedData, &nullMask, offset);
+            }
+        },
+        [&]<typename T>(T)
+            requires(std::same_as<T, internalID_t>)
+        {
+            if (numValues > 0) {
+                const auto typedData = std::span(
+                    reinterpret_cast<const uint64_t*>(data.getData()) + offset, numValues);
+                returnValue = getTypedMinMax(typedData, &nullMask, offset);
+            }
+        },
+        [&]<typename T>(T)
+            requires(std::same_as<T, interval_t> || std::same_as<T, struct_entry_t> ||
+                     std::same_as<T, ku_string_t> || std::same_as<T, list_entry_t> ||
+                     std::same_as<T, uint128_t>)
+        {
+            if (valueRequiredIfUnsupported) {
+                // For unsupported types on the first copy,
+                // they need a non-optional value to distinguish them
+                // from supported types where every value is null
+                returnValue.first = std::numeric_limits<uint64_t>::min();
+                returnValue.second = std::numeric_limits<uint64_t>::max();
+            }
+        });
+    return returnValue;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/float_compression.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/float_compression.cpp
new file mode 100644
index 0000000000..4bfc605604
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/compression/float_compression.cpp
@@ -0,0 +1,248 @@
+#include "storage/compression/float_compression.h"
+
+#include "alp/encode.hpp"
+#include "common/system_config.h"
+#include "common/utils.h"
+#include <ranges>
+
+namespace lbug {
+namespace storage {
+
+namespace {
+static constexpr common::idx_t BITPACKING_CHILD_IDX = 0;
+
+template<std::floating_point T>
+common::LogicalType getBitpackingLogicalType() {
+    if constexpr (std::is_same_v<T, float>) {
+        return common::LogicalType::INT32();
+    } else {
+        return common::LogicalType::INT64();
+    }
+}
+} // namespace
+
+template<std::floating_point T>
+size_t EncodeException<T>::numPagesFromExceptions(size_t exceptionCount) {
+    return common::ceilDiv(static_cast<uint64_t>(exceptionCount),
+        common::LBUG_PAGE_SIZE / sizeInBytes());
+}
+
+template<std::floating_point T>
+size_t EncodeException<T>::exceptionBytesPerPage() {
+    return common::LBUG_PAGE_SIZE / sizeInBytes() * sizeInBytes();
+}
+
+template<std::floating_point T>
+bool EncodeException<T>::operator<(const EncodeException<T>& o) const {
+    return posInChunk < o.posInChunk;
+}
+
+template<std::floating_point T>
+EncodeException<T> EncodeExceptionView<T>::getValue(common::offset_t elementOffset) const {
+    EncodeException<T> ret{};
+    const auto* const elementAddress = bytes + elementOffset * decltype(ret)::sizeInBytes();
+    std::memcpy(&ret.value, elementAddress, sizeof(ret.value));
+    std::memcpy(&ret.posInChunk, elementAddress + sizeof(ret.value), sizeof(ret.posInChunk));
+    return ret;
+}
+
+template<std::floating_point T>
+void EncodeExceptionView<T>::setValue(EncodeException<T> exception,
+    common::offset_t elementOffset) {
+    auto* const elementAddress = bytes + elementOffset * decltype(exception)::sizeInBytes();
+    std::memcpy(elementAddress, &exception.value, sizeof(exception.value));
+    std::memcpy(elementAddress + sizeof(exception.value), &exception.posInChunk,
+        sizeof(exception.posInChunk));
+}
+
+template<std::floating_point T>
+FloatCompression<T>::FloatCompression()
+    : constantEncodedFloatBitpacker(getBitpackingLogicalType<T>()), encodedFloatBitpacker() {}
+
+template<std::floating_point T>
+uint64_t FloatCompression<T>::compressNextPage(const uint8_t*&, uint64_t, uint8_t*, uint64_t,
+    const struct CompressionMetadata&) const {
+    KU_UNREACHABLE;
+}
+
+template<std::floating_point T>
+uint64_t FloatCompression<T>::compressNextPageWithExceptions(const uint8_t*& srcBuffer,
+    uint64_t srcOffset, uint64_t numValuesRemaining, uint8_t* dstBuffer, uint64_t dstBufferSize,
+    EncodeExceptionView<T> exceptionBuffer, [[maybe_unused]] uint64_t exceptionBufferSize,
+    uint64_t& exceptionCount, const struct CompressionMetadata& metadata) const {
+    KU_ASSERT(metadata.compression == CompressionType::ALP);
+
+    const size_t numValuesToCompress =
+        std::min(numValuesRemaining, numValues(dstBufferSize, metadata));
+
+    std::vector<EncodedType> integerEncodedValues(numValuesToCompress);
+    for (size_t posInPage = 0; posInPage < numValuesToCompress; ++posInPage) {
+        const auto floatValue = reinterpret_cast<const T*>(srcBuffer)[posInPage];
+        const auto* floatMetadata = metadata.floatMetadata();
+        const EncodedType encodedValue =
+            alp::AlpEncode<T>::encode_value(floatValue, floatMetadata->fac, floatMetadata->exp);
+        const double decodedValue =
+            alp::AlpDecode<T>::decode_value(encodedValue, floatMetadata->fac, floatMetadata->exp);
+
+        if (floatValue != decodedValue) {
+            KU_ASSERT(
+                (exceptionCount + 1) * EncodeException<T>::sizeInBytes() <= exceptionBufferSize);
+            exceptionBuffer.setValue(
+                {.value = floatValue,
+                    .posInChunk = common::safeIntegerConversion<uint32_t>(srcOffset + posInPage)},
+                exceptionCount);
+
+            // We don't need to replace with 1st successful encode as the integer bitpacking
+            // metadata is already populated
+            ++exceptionCount;
+        } else {
+            integerEncodedValues[posInPage] = encodedValue;
+        }
+    }
+    srcBuffer += numValuesToCompress * sizeof(T);
+
+    const auto* castedIntegerEncodedBuffer =
+        reinterpret_cast<const uint8_t*>(integerEncodedValues.data());
+    const auto compressedIntegerSize =
+        getEncodedFloatBitpacker(metadata).compressNextPage(castedIntegerEncodedBuffer,
+            numValuesToCompress, dstBuffer, dstBufferSize, metadata.getChild(BITPACKING_CHILD_IDX));
+
+    // zero out unused parts of the page
+    memset(dstBuffer + compressedIntegerSize, 0, dstBufferSize - compressedIntegerSize);
+
+    // since we already do the zeroing we return the size of the whole page
+    return dstBufferSize;
+}
+
+template<std::floating_point T>
+uint64_t FloatCompression<T>::numValues(uint64_t dataSize, const CompressionMetadata& metadata) {
+    return metadata.getChild(BITPACKING_CHILD_IDX)
+        .numValues(dataSize, getBitpackingLogicalType<T>());
+}
+
+template<std::floating_point T>
+void FloatCompression<T>::decompressFromPage(const uint8_t* srcBuffer, uint64_t srcOffset,
+    uint8_t* dstBuffer, uint64_t dstOffset, uint64_t numValues,
+    const struct CompressionMetadata& metadata) const {
+
+    // use dstBuffer for unpacking the ALP encoded values then decode them in place
+    getEncodedFloatBitpacker(metadata).decompressFromPage(srcBuffer, srcOffset, dstBuffer,
+        dstOffset, numValues, metadata.getChild(BITPACKING_CHILD_IDX));
+
+    static_assert(sizeof(EncodedType) == sizeof(T));
+    auto* integerEncodedValues = reinterpret_cast<EncodedType*>(dstBuffer);
+    for (size_t i = 0; i < numValues; ++i) {
+        reinterpret_cast<T*>(dstBuffer)[dstOffset + i] =
+            alp::AlpDecode<T>::decode_value(integerEncodedValues[dstOffset + i],
+                metadata.floatMetadata()->fac, metadata.floatMetadata()->exp);
+    }
+}
+
+template<std::floating_point T>
+void FloatCompression<T>::setValuesFromUncompressed(const uint8_t* srcBuffer,
+    common::offset_t srcOffset, uint8_t* dstBuffer, common::offset_t dstOffset,
+    common::offset_t numValues, const CompressionMetadata& metadata,
+    const common::NullMask* nullMask) const {
+    // each individual value that is being updated should be able to be updated in place
+    RUNTIME_CHECK(InPlaceUpdateLocalState localUpdateState{});
+    KU_ASSERT(numValues ==
+              static_cast<common::offset_t>(
+                  std::ranges::count_if(std::ranges::iota_view{srcOffset, srcOffset + numValues},
+                      [&localUpdateState, srcBuffer, &metadata, nullMask](common::offset_t i) {
+                          auto value = reinterpret_cast<const T*>(srcBuffer)[i];
+                          return (nullMask && nullMask->isNull(i)) ||
+                                 canUpdateInPlace(std::span(&value, 1), metadata, localUpdateState);
+                      })));
+
+    std::vector<EncodedType> integerEncodedValues(numValues);
+    for (size_t i = 0; i < numValues; ++i) {
+        const size_t posInSrc = i + srcOffset;
+
+        const auto floatValue = reinterpret_cast<const T*>(srcBuffer)[posInSrc];
+        const EncodedType encodedValue = alp::AlpEncode<T>::encode_value(floatValue,
+            metadata.floatMetadata()->fac, metadata.floatMetadata()->exp);
+        integerEncodedValues[i] = encodedValue;
+    }
+
+    getEncodedFloatBitpacker(metadata).setValuesFromUncompressed(
+        reinterpret_cast<const uint8_t*>(integerEncodedValues.data()), 0, dstBuffer, dstOffset,
+        numValues, metadata.getChild(BITPACKING_CHILD_IDX), nullMask);
+}
+
+template<std::floating_point T>
+const CompressionAlg& FloatCompression<T>::getEncodedFloatBitpacker(
+    const CompressionMetadata& metadata) const {
+    if (metadata.getChild(BITPACKING_CHILD_IDX).isConstant()) {
+        return constantEncodedFloatBitpacker;
+    } else {
+        return encodedFloatBitpacker;
+    }
+}
+
+template<std::floating_point T>
+BitpackInfo<typename FloatCompression<T>::EncodedType> FloatCompression<T>::getBitpackInfo(
+    const CompressionMetadata& metadata) {
+    const auto& bitpackMetadata = metadata.getChild(BITPACKING_CHILD_IDX);
+    if (bitpackMetadata.isConstant()) {
+        const auto constValue = bitpackMetadata.min.get<EncodedType>();
+        return {.bitWidth = 0, .hasNegative = (constValue < 0), .offset = constValue};
+    } else {
+        return IntegerBitpacking<EncodedType>::getPackingInfo(bitpackMetadata);
+    }
+}
+
+template<std::floating_point T>
+bool FloatCompression<T>::canUpdateInPlace(std::span<const T> value,
+    const CompressionMetadata& metadata, InPlaceUpdateLocalState& localUpdateState,
+    const std::optional<common::NullMask>& nullMask, uint64_t nullMaskOffset) {
+    size_t newExceptionCount = 0;
+    std::vector<EncodedType> encodedValues(value.size());
+    const auto bitpackingInfo = getBitpackInfo(metadata);
+    const auto* floatMetadata = metadata.floatMetadata();
+    for (size_t i = 0; i < value.size(); ++i) {
+        if (nullMask && nullMask->isNull(nullMaskOffset + i)) {
+            continue;
+        }
+
+        const auto floatValue = value[i];
+        const EncodedType encodedValue =
+            alp::AlpEncode<T>::encode_value(floatValue, floatMetadata->fac, floatMetadata->exp);
+        const double decodedValue =
+            alp::AlpDecode<T>::decode_value(encodedValue, floatMetadata->fac, floatMetadata->exp);
+        if (floatValue != decodedValue) {
+            ++newExceptionCount;
+            encodedValues[i] = bitpackingInfo.offset;
+        } else {
+            encodedValues[i] = encodedValue;
+        }
+    }
+    localUpdateState.floatState.newExceptionCount += newExceptionCount;
+    const size_t totalExceptionCount =
+        floatMetadata->exceptionCount + localUpdateState.floatState.newExceptionCount;
+    const bool exceptionsOK = totalExceptionCount <= floatMetadata->exceptionCapacity;
+
+    return exceptionsOK &&
+           metadata.getChild(BITPACKING_CHILD_IDX)
+               .canUpdateInPlace(reinterpret_cast<uint8_t*>(encodedValues.data()), 0,
+                   encodedValues.size(), getBitpackingLogicalType<T>().getPhysicalType(),
+                   localUpdateState);
+}
+
+template<std::floating_point T>
+common::page_idx_t FloatCompression<T>::getNumDataPages(common::page_idx_t numTotalPages,
+    const CompressionMetadata& compMeta) {
+    return numTotalPages -
+           EncodeException<T>::numPagesFromExceptions(compMeta.floatMetadata()->exceptionCapacity);
+}
+
+template class FloatCompression<double>;
+template class FloatCompression<float>;
+
+template struct EncodeException<double>;
+template struct EncodeException<float>;
+
+template struct EncodeExceptionView<double>;
+template struct EncodeExceptionView<float>;
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/database_header.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/database_header.cpp
new file mode 100644
index 0000000000..444f12253b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/database_header.cpp
@@ -0,0 +1,117 @@
+#include "storage/database_header.h"
+
+#include <cstring>
+
+#include "common/exception/runtime.h"
+#include "common/file_system/file_info.h"
+#include "common/serializer/buffered_file.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/system_config.h"
+#include "main/client_context.h"
+#include "storage/page_manager.h"
+#include "storage/storage_version_info.h"
+
+namespace lbug::storage {
+static void validateStorageVersion(common::Deserializer& deSer) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "storage_version");
+    storage_version_t savedStorageVersion = 0;
+    deSer.deserializeValue(savedStorageVersion);
+    const auto storageVersion = StorageVersionInfo::getStorageVersion();
+    if (savedStorageVersion != storageVersion) {
+        // TODO(Guodong): Add a test case for this.
+        throw common::RuntimeException(
+            common::stringFormat("Trying to read a database file with a different version. "
+                                 "Database file version: {}, Current build storage version: {}",
+                savedStorageVersion, storageVersion));
+    }
+}
+
+static void validateMagicBytes(common::Deserializer& deSer) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "magic");
+    const auto numMagicBytes = strlen(StorageVersionInfo::MAGIC_BYTES);
+    uint8_t magicBytes[4];
+    for (auto i = 0u; i < numMagicBytes; i++) {
+        deSer.deserializeValue<uint8_t>(magicBytes[i]);
+    }
+    if (memcmp(magicBytes, StorageVersionInfo::MAGIC_BYTES, numMagicBytes) != 0) {
+        throw common::RuntimeException(
+            "Unable to open database. The file is not a valid Lbug database file!");
+    }
+}
+
+void DatabaseHeader::updateCatalogPageRange(PageManager& pageManager, PageRange newPageRange) {
+    if (catalogPageRange.startPageIdx != common::INVALID_PAGE_IDX) {
+        pageManager.freePageRange(catalogPageRange);
+    }
+    catalogPageRange = newPageRange;
+}
+
+void DatabaseHeader::freeMetadataPageRange(PageManager& pageManager) const {
+    if (metadataPageRange.startPageIdx != common::INVALID_PAGE_IDX) {
+        pageManager.freePageRange(metadataPageRange);
+    }
+}
+
+static void writeMagicBytes(common::Serializer& serializer) {
+    serializer.writeDebuggingInfo("magic");
+    const auto numMagicBytes = strlen(StorageVersionInfo::MAGIC_BYTES);
+    for (auto i = 0u; i < numMagicBytes; i++) {
+        serializer.serializeValue<uint8_t>(StorageVersionInfo::MAGIC_BYTES[i]);
+    }
+}
+
+void DatabaseHeader::serialize(common::Serializer& ser) const {
+    writeMagicBytes(ser);
+    ser.writeDebuggingInfo("storage_version");
+    ser.serializeValue(StorageVersionInfo::getStorageVersion());
+    ser.writeDebuggingInfo("catalog");
+    ser.serializeValue(catalogPageRange.startPageIdx);
+    ser.serializeValue(catalogPageRange.numPages);
+    ser.writeDebuggingInfo("metadata");
+    ser.serializeValue(metadataPageRange.startPageIdx);
+    ser.serializeValue(metadataPageRange.numPages);
+    ser.writeDebuggingInfo("databaseID");
+    ser.serializeValue(databaseID.value);
+}
+
+DatabaseHeader DatabaseHeader::deserialize(common::Deserializer& deSer) {
+    validateMagicBytes(deSer);
+    validateStorageVersion(deSer);
+    PageRange catalogPageRange{}, metaPageRange{};
+    common::ku_uuid_t databaseID{};
+    std::string key;
+    deSer.validateDebuggingInfo(key, "catalog");
+    deSer.deserializeValue(catalogPageRange.startPageIdx);
+    deSer.deserializeValue(catalogPageRange.numPages);
+    deSer.validateDebuggingInfo(key, "metadata");
+    deSer.deserializeValue(metaPageRange.startPageIdx);
+    deSer.deserializeValue(metaPageRange.numPages);
+    deSer.validateDebuggingInfo(key, "databaseID");
+    deSer.deserializeValue(databaseID.value);
+    return {catalogPageRange, metaPageRange, databaseID};
+}
+
+DatabaseHeader DatabaseHeader::createInitialHeader(common::RandomEngine* randomEngine) {
+    // We generate a random UUID to act as the database ID
+    return DatabaseHeader{{}, {}, common::UUID::generateRandomUUID(randomEngine)};
+}
+
+std::optional<DatabaseHeader> DatabaseHeader::readDatabaseHeader(common::FileInfo& dataFileInfo) {
+    if (dataFileInfo.getFileSize() < common::LBUG_PAGE_SIZE) {
+        // If the data file hasn't been written to there is no existing database header
+        return std::nullopt;
+    }
+    auto reader = std::make_unique<common::BufferedFileReader>(dataFileInfo);
+    common::Deserializer deSer(std::move(reader));
+    try {
+        return DatabaseHeader::deserialize(deSer);
+    } catch (const common::RuntimeException&) {
+        // It is possible we optimistically write to the database file before the first checkpoint
+        // In this case the magic bytes check will fail and we assume there is no existing header
+        return std::nullopt;
+    }
+}
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/disk_array.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/disk_array.cpp
new file mode 100644
index 0000000000..e31ad8f5df
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/disk_array.cpp
@@ -0,0 +1,401 @@
+#include "storage/disk_array.h"
+
+#include "common/exception/runtime.h"
+#include "common/string_format.h"
+#include "common/types/types.h"
+#include "storage/file_handle.h"
+#include "storage/shadow_file.h"
+#include "storage/shadow_utils.h"
+#include "storage/storage_utils.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+// Header can be read or write since it just needs the sizes
+static PageCursor getAPIdxAndOffsetInAP(const PageStorageInfo& info, uint64_t idx) {
+    // We assume that `numElementsPerPageLog2`, `elementPageOffsetMask`,
+    // `alignedElementSizeLog2` are never modified throughout transactional updates, thus, we
+    // directly use them from header here.
+    const page_idx_t apIdx = idx / info.numElementsPerPage;
+    const uint32_t byteOffsetInAP = (idx % info.numElementsPerPage) * info.alignedElementSize;
+    return PageCursor{apIdx, byteOffsetInAP};
+}
+
+PageStorageInfo::PageStorageInfo(uint64_t elementSize)
+    : alignedElementSize{std::bit_ceil(elementSize)},
+      numElementsPerPage{LBUG_PAGE_SIZE / alignedElementSize} {
+    KU_ASSERT(elementSize <= LBUG_PAGE_SIZE);
+}
+
+PIPWrapper::PIPWrapper(const FileHandle& fileHandle, page_idx_t pipPageIdx)
+    : pipPageIdx(pipPageIdx) {
+    fileHandle.readPageFromDisk(reinterpret_cast<uint8_t*>(&pipContents), pipPageIdx);
+}
+
+DiskArrayInternal::DiskArrayInternal(FileHandle& fileHandle,
+    const DiskArrayHeader& headerForReadTrx, DiskArrayHeader& headerForWriteTrx,
+    ShadowFile* shadowFile, uint64_t elementSize, bool bypassShadowing)
+    : storageInfo{elementSize}, fileHandle(fileHandle), header{headerForReadTrx},
+      headerForWriteTrx{headerForWriteTrx}, hasTransactionalUpdates{false}, shadowFile{shadowFile},
+      lastAPPageIdx{INVALID_PAGE_IDX}, lastPageOnDisk{INVALID_PAGE_IDX} {
+    if (this->header.firstPIPPageIdx != ShadowUtils::NULL_PAGE_IDX) {
+        pips.emplace_back(fileHandle, header.firstPIPPageIdx);
+        while (pips[pips.size() - 1].pipContents.nextPipPageIdx != ShadowUtils::NULL_PAGE_IDX) {
+            pips.emplace_back(fileHandle, pips[pips.size() - 1].pipContents.nextPipPageIdx);
+        }
+    }
+    // If bypassing the WAL is disabled, just leave the lastPageOnDisk as invalid, as then all pages
+    // will be treated as updates to existing ones
+    if (bypassShadowing) {
+        updateLastPageOnDisk();
+    }
+}
+
+void DiskArrayInternal::updateLastPageOnDisk() {
+    auto numElements = getNumElementsNoLock(TransactionType::READ_ONLY);
+    if (numElements > 0) {
+        auto apCursor = getAPIdxAndOffsetInAP(storageInfo, numElements - 1);
+        lastPageOnDisk = getAPPageIdxNoLock(apCursor.pageIdx, TransactionType::READ_ONLY);
+    } else {
+        lastPageOnDisk = 0;
+    }
+}
+
+uint64_t DiskArrayInternal::getNumElements(TransactionType trxType) {
+    std::shared_lock sLck{diskArraySharedMtx};
+    return getNumElementsNoLock(trxType);
+}
+
+bool DiskArrayInternal::checkOutOfBoundAccess(TransactionType trxType, uint64_t idx) const {
+    auto currentNumElements = getNumElementsNoLock(trxType);
+    if (idx >= currentNumElements) {
+        // LCOV_EXCL_START
+        throw RuntimeException(stringFormat(
+            "idx: {} of the DiskArray to be accessed is >= numElements in DiskArray{}.", idx,
+            currentNumElements));
+        // LCOV_EXCL_STOP
+    }
+    return true;
+}
+
+void DiskArrayInternal::get(uint64_t idx, const Transaction* transaction,
+    std::span<std::byte> val) {
+    std::shared_lock sLck{diskArraySharedMtx};
+    KU_ASSERT(checkOutOfBoundAccess(transaction->getType(), idx));
+    auto apCursor = getAPIdxAndOffsetInAP(storageInfo, idx);
+    page_idx_t apPageIdx = getAPPageIdxNoLock(apCursor.pageIdx, transaction->getType());
+    if (transaction->getType() != TransactionType::CHECKPOINT || !hasTransactionalUpdates ||
+        apPageIdx > lastPageOnDisk ||
+        !shadowFile->hasShadowPage(fileHandle.getFileIndex(), apPageIdx)) {
+        fileHandle.optimisticReadPage(apPageIdx, [&](const uint8_t* frame) -> void {
+            memcpy(val.data(), frame + apCursor.elemPosInPage, val.size());
+        });
+    } else {
+        ShadowUtils::readShadowVersionOfPage(fileHandle, apPageIdx, *shadowFile,
+            [&val, &apCursor](const uint8_t* frame) -> void {
+                memcpy(val.data(), frame + apCursor.elemPosInPage, val.size());
+            });
+    }
+}
+
+void DiskArrayInternal::updatePage(uint64_t pageIdx, bool isNewPage,
+    std::function<void(uint8_t*)> updateOp) {
+    // Pages which are new to this transaction are written directly to the file
+    // Pages which previously existed are written to the WAL file
+    if (pageIdx <= lastPageOnDisk) {
+        // This may still be used to create new pages since bypassing the WAL is currently optional
+        // and if disabled lastPageOnDisk will be INVALID_PAGE_IDX (and the above comparison will
+        // always be true)
+        ShadowUtils::updatePage(fileHandle, pageIdx, isNewPage, *shadowFile, updateOp);
+    } else {
+        const auto frame = fileHandle.pinPage(pageIdx,
+            isNewPage ? PageReadPolicy::DONT_READ_PAGE : PageReadPolicy::READ_PAGE);
+        updateOp(frame);
+        fileHandle.setLockedPageDirty(pageIdx);
+        fileHandle.unpinPage(pageIdx);
+    }
+}
+
+void DiskArrayInternal::update(const Transaction* transaction, uint64_t idx,
+    std::span<std::byte> val) {
+    std::unique_lock xLck{diskArraySharedMtx};
+    hasTransactionalUpdates = true;
+    KU_ASSERT(checkOutOfBoundAccess(transaction->getType(), idx));
+    auto apCursor = getAPIdxAndOffsetInAP(storageInfo, idx);
+    // TODO: We are currently supporting only DiskArrays that can grow in size and not
+    // those that can shrink in size. That is why we can use
+    // getAPPageIdxNoLock(apIdx, Transaction::WRITE) directly to compute the physical page Idx
+    // because any apIdx is guaranteed to be either in an existing PIP or a new PIP we added, which
+    // getAPPageIdxNoLock will correctly locate: this function simply searches an existing PIP if
+    // apIdx < numAPs stored in "previous" PIP; otherwise one of the newly inserted PIPs stored in
+    // pipPageIdxsOfInsertedPIPs. If within a single transaction we could grow or shrink, then
+    // getAPPageIdxNoLock logic needs to change to give the same guarantee (e.g., an apIdx = 0, may
+    // no longer to be guaranteed to be in pips[0].)
+    page_idx_t apPageIdx = getAPPageIdxNoLock(apCursor.pageIdx, transaction->getType());
+    updatePage(apPageIdx, false /*isNewPage=*/, [&apCursor, &val](uint8_t* frame) -> void {
+        memcpy(frame + apCursor.elemPosInPage, val.data(), val.size());
+    });
+}
+
+uint64_t DiskArrayInternal::resize(PageAllocator& pageAllocator, const Transaction* transaction,
+    uint64_t newNumElements, std::span<std::byte> defaultVal) {
+    std::unique_lock xLck{diskArraySharedMtx};
+    auto it = iter_mut(defaultVal.size());
+    auto originalNumElements = getNumElementsNoLock(transaction->getType());
+    while (it.size() < newNumElements) {
+        it.pushBack(pageAllocator, transaction, defaultVal);
+    }
+    return originalNumElements;
+}
+
+void DiskArrayInternal::setNextPIPPageIDxOfPIPNoLock(uint64_t pipIdxOfPreviousPIP,
+    page_idx_t nextPIPPageIdx) {
+    // This happens if the first pip is being inserted, in which case we need to change the header.
+    if (pipIdxOfPreviousPIP == UINT64_MAX) {
+        headerForWriteTrx.firstPIPPageIdx = nextPIPPageIdx;
+    } else if (pips.empty()) {
+        pipUpdates.newPIPs[pipIdxOfPreviousPIP].pipContents.nextPipPageIdx = nextPIPPageIdx;
+    } else {
+        if (!pipUpdates.updatedLastPIP.has_value()) {
+            pipUpdates.updatedLastPIP = std::make_optional(pips[pipIdxOfPreviousPIP]);
+        }
+        if (pipIdxOfPreviousPIP == pips.size() - 1) {
+            pipUpdates.updatedLastPIP->pipContents.nextPipPageIdx = nextPIPPageIdx;
+        } else {
+            KU_ASSERT(pipIdxOfPreviousPIP >= pips.size() &&
+                      pipUpdates.newPIPs.size() > pipIdxOfPreviousPIP - pips.size());
+            pipUpdates.newPIPs[pipIdxOfPreviousPIP - pips.size()].pipContents.nextPipPageIdx =
+                nextPIPPageIdx;
+        }
+    }
+}
+
+page_idx_t DiskArrayInternal::getAPPageIdxNoLock(page_idx_t apIdx, TransactionType trxType) {
+    auto [pipIdx, offsetInPIP] = StorageUtils::getQuotientRemainder(apIdx, NUM_PAGE_IDXS_PER_PIP);
+    if ((trxType != TransactionType::CHECKPOINT) || !hasPIPUpdatesNoLock(pipIdx)) {
+        return pips[pipIdx].pipContents.pageIdxs[offsetInPIP];
+    } else if (pipIdx == pips.size() - 1 && pipUpdates.updatedLastPIP) {
+        return pipUpdates.updatedLastPIP->pipContents.pageIdxs[offsetInPIP];
+    } else {
+        KU_ASSERT(pipIdx >= pips.size() && pipIdx - pips.size() < pipUpdates.newPIPs.size());
+        return pipUpdates.newPIPs[pipIdx - pips.size()].pipContents.pageIdxs[offsetInPIP];
+    }
+}
+
+page_idx_t DiskArrayInternal::getUpdatedPageIdxOfPipNoLock(uint64_t pipIdx) {
+    if (pipIdx < pips.size()) {
+        return pips[pipIdx].pipPageIdx;
+    }
+    return pipUpdates.newPIPs[pipIdx - pips.size()].pipPageIdx;
+}
+
+void DiskArrayInternal::clearWALPageVersionAndRemovePageFromFrameIfNecessary(page_idx_t pageIdx) {
+    shadowFile->clearShadowPage(fileHandle.getFileIndex(), pageIdx);
+    fileHandle.removePageFromFrameIfNecessary(pageIdx);
+}
+
+void DiskArrayInternal::checkpointOrRollbackInMemoryIfNecessaryNoLock(bool isCheckpoint) {
+    if (!hasTransactionalUpdates) {
+        return;
+    }
+    if (pipUpdates.updatedLastPIP.has_value()) {
+        // Note: This should not cause a memory leak because PIPWrapper is a struct. So we
+        // should overwrite the previous PIPWrapper's memory.
+        if (isCheckpoint) {
+            pips.back() = *pipUpdates.updatedLastPIP;
+        }
+        clearWALPageVersionAndRemovePageFromFrameIfNecessary(pips.back().pipPageIdx);
+    }
+
+    for (auto& newPIP : pipUpdates.newPIPs) {
+        clearWALPageVersionAndRemovePageFromFrameIfNecessary(newPIP.pipPageIdx);
+        if (isCheckpoint) {
+            pips.emplace_back(newPIP);
+        }
+    }
+    // Note that we already updated the header to its correct state above.
+    pipUpdates.clear();
+    hasTransactionalUpdates = false;
+    if (isCheckpoint && lastPageOnDisk != INVALID_PAGE_IDX) {
+        updateLastPageOnDisk();
+    }
+}
+
+void DiskArrayInternal::checkpoint() {
+    if (pipUpdates.updatedLastPIP.has_value()) {
+        ShadowUtils::updatePage(fileHandle, pipUpdates.updatedLastPIP->pipPageIdx, true,
+            *shadowFile, [&](auto* frame) {
+                memcpy(frame, &pipUpdates.updatedLastPIP->pipContents, sizeof(PIP));
+            });
+    }
+    for (auto& newPIP : pipUpdates.newPIPs) {
+        ShadowUtils::updatePage(fileHandle, newPIP.pipPageIdx, true, *shadowFile,
+            [&](auto* frame) { memcpy(frame, &newPIP.pipContents, sizeof(PIP)); });
+    }
+}
+
+void DiskArrayInternal::reclaimStorage(PageAllocator& pageAllocator) const {
+    for (auto& pip : pips) {
+        for (auto pageIdx : pip.pipContents.pageIdxs) {
+            if (pageIdx != ShadowUtils::NULL_PAGE_IDX) {
+                pageAllocator.freePage(pageIdx);
+            }
+        }
+        if (pip.pipPageIdx != ShadowUtils::NULL_PAGE_IDX) {
+            pageAllocator.freePage(pip.pipPageIdx);
+        }
+    }
+}
+
+bool DiskArrayInternal::hasPIPUpdatesNoLock(uint64_t pipIdx) const {
+    // This is a request to a pipIdx > pips.size(). Since pips.size() is the original number of pips
+    // we started with before the write transaction is updated, we return true, i.e., this PIP is
+    // an "updated" PIP and should be read from the WAL version.
+    if (pipIdx >= pips.size()) {
+        return true;
+    }
+    return (pipIdx == pips.size() - 1) && pipUpdates.updatedLastPIP;
+}
+
+std::pair<page_idx_t, bool>
+DiskArrayInternal::getAPPageIdxAndAddAPToPIPIfNecessaryForWriteTrxNoLock(
+    PageAllocator& pageAllocator, const Transaction* transaction, page_idx_t apIdx) {
+    if (apIdx == getNumAPs(headerForWriteTrx) - 1 && lastAPPageIdx != INVALID_PAGE_IDX) {
+        return std::make_pair(lastAPPageIdx, false /*not a new page*/);
+    } else if (apIdx < getNumAPs(headerForWriteTrx)) {
+        // If the apIdx of the array page is < numAPs, we do not have to
+        // add a new array page, so directly return the pageIdx of the apIdx.
+        return std::make_pair(getAPPageIdxNoLock(apIdx, transaction->getType()),
+            false /* is not inserting a new ap page */);
+    } else {
+        // apIdx even if it's being inserted should never be > updatedDiskArrayHeader->numAPs.
+        KU_ASSERT(apIdx == getNumAPs(headerForWriteTrx));
+        // We need to add a new AP. This may further cause a new pip to be inserted, which is
+        // handled by the if/else-if/else branch below.
+        page_idx_t newAPPageIdx = pageAllocator.allocatePage();
+        // We need to create a new array page and then add its apPageIdx (newAPPageIdx variable) to
+        // an appropriate PIP.
+        auto pipIdxAndOffsetOfNewAP =
+            StorageUtils::getQuotientRemainder(apIdx, NUM_PAGE_IDXS_PER_PIP);
+        uint64_t pipIdx = pipIdxAndOffsetOfNewAP.first;
+        uint64_t offsetOfNewAPInPIP = pipIdxAndOffsetOfNewAP.second;
+        if (pipIdx < pips.size()) {
+            KU_ASSERT(pipIdx == pips.size() - 1);
+            // We do not need to insert a new pip and we need to add newAPPageIdx to a PIP that
+            // existed before this transaction started.
+            if (!pipUpdates.updatedLastPIP.has_value()) {
+                pipUpdates.updatedLastPIP = std::make_optional(pips[pipIdx]);
+            }
+            pipUpdates.updatedLastPIP->pipContents.pageIdxs[offsetOfNewAPInPIP] = newAPPageIdx;
+        } else if ((pipIdx - pips.size()) < pipUpdates.newPIPs.size()) {
+            // We do not need to insert a new PIP and we need to add newAPPageIdx to a new PIP that
+            // already got created after this transaction started.
+            auto& pip = pipUpdates.newPIPs[pipIdx - pips.size()];
+            pip.pipContents.pageIdxs[offsetOfNewAPInPIP] = newAPPageIdx;
+        } else {
+            // We need to create a new PIP and make the previous PIP (or the header) point to it.
+            page_idx_t pipPageIdx = pageAllocator.allocatePage();
+            pipUpdates.newPIPs.emplace_back(pipPageIdx);
+            uint64_t pipIdxOfPreviousPIP = pipIdx - 1;
+            setNextPIPPageIDxOfPIPNoLock(pipIdxOfPreviousPIP, pipPageIdx);
+            pipUpdates.newPIPs.back().pipContents.pageIdxs[offsetOfNewAPInPIP] = newAPPageIdx;
+        }
+        return std::make_pair(newAPPageIdx, true /* inserting a new ap page */);
+    }
+}
+
+DiskArrayInternal::WriteIterator& DiskArrayInternal::WriteIterator::seek(size_t newIdx) {
+    KU_ASSERT(newIdx < diskArray.headerForWriteTrx.numElements);
+    auto oldPageIdx = apCursor.pageIdx;
+    idx = newIdx;
+    apCursor = getAPIdxAndOffsetInAP(diskArray.storageInfo, idx);
+    if (oldPageIdx != apCursor.pageIdx) {
+        page_idx_t apPageIdx = diskArray.getAPPageIdxNoLock(apCursor.pageIdx, TRX_TYPE);
+        getPage(apPageIdx, false /*isNewlyAdded*/);
+    }
+    return *this;
+}
+
+void DiskArrayInternal::WriteIterator::pushBack(PageAllocator& pageAllocator,
+    const Transaction* transaction, std::span<std::byte> val) {
+    idx = diskArray.headerForWriteTrx.numElements;
+    auto oldPageIdx = apCursor.pageIdx;
+    apCursor = getAPIdxAndOffsetInAP(diskArray.storageInfo, idx);
+    // If this would add a new page, pin new page and update PIP
+    auto [apPageIdx, isNewlyAdded] =
+        diskArray.getAPPageIdxAndAddAPToPIPIfNecessaryForWriteTrxNoLock(pageAllocator, transaction,
+            apCursor.pageIdx);
+    diskArray.lastAPPageIdx = apPageIdx;
+    // Used to calculate the number of APs, so it must be updated after the PIPs are.
+    diskArray.headerForWriteTrx.numElements++;
+    if (isNewlyAdded || shadowPageAndFrame.originalPage == INVALID_PAGE_IDX ||
+        apCursor.pageIdx != oldPageIdx) {
+        getPage(apPageIdx, isNewlyAdded);
+    }
+    memcpy(operator*().data(), val.data(), val.size());
+}
+
+void DiskArrayInternal::WriteIterator::unpin() {
+    if (shadowPageAndFrame.shadowPage != INVALID_PAGE_IDX) {
+        // unpin current page
+        diskArray.shadowFile->getShadowingFH().unpinPage(shadowPageAndFrame.shadowPage);
+        shadowPageAndFrame.shadowPage = INVALID_PAGE_IDX;
+    } else if (shadowPageAndFrame.originalPage != INVALID_PAGE_IDX) {
+        diskArray.fileHandle.setLockedPageDirty(shadowPageAndFrame.originalPage);
+        diskArray.fileHandle.unpinPage(shadowPageAndFrame.originalPage);
+        shadowPageAndFrame.originalPage = INVALID_PAGE_IDX;
+    }
+}
+
+void DiskArrayInternal::WriteIterator::getPage(page_idx_t newPageIdx, bool isNewlyAdded) {
+    unpin();
+    if (newPageIdx <= diskArray.lastPageOnDisk) {
+        // Pin new page
+        shadowPageAndFrame = ShadowUtils::createShadowVersionIfNecessaryAndPinPage(newPageIdx,
+            isNewlyAdded, diskArray.fileHandle, *diskArray.shadowFile);
+    } else {
+        shadowPageAndFrame.frame = diskArray.fileHandle.pinPage(newPageIdx,
+            isNewlyAdded ? PageReadPolicy::DONT_READ_PAGE : PageReadPolicy::READ_PAGE);
+        shadowPageAndFrame.originalPage = newPageIdx;
+        shadowPageAndFrame.shadowPage = INVALID_PAGE_IDX;
+    }
+}
+
+DiskArrayInternal::WriteIterator DiskArrayInternal::iter_mut(uint64_t valueSize) {
+    return WriteIterator(valueSize, *this);
+}
+
+page_idx_t DiskArrayInternal::getAPIdx(uint64_t idx) const {
+    return getAPIdxAndOffsetInAP(storageInfo, idx).pageIdx;
+}
+
+// [] operator to be used when building an InMemDiskArrayBuilder without transactional updates.
+// This changes the contents directly in memory and not on disk (nor on the wal)
+uint8_t* BlockVectorInternal::operator[](uint64_t idx) const {
+    auto apCursor = getAPIdxAndOffsetInAP(storageInfo, idx);
+    KU_ASSERT(apCursor.pageIdx < inMemArrayPages.size());
+    return inMemArrayPages[apCursor.pageIdx]->getData() + apCursor.elemPosInPage;
+}
+
+void BlockVectorInternal::resize(uint64_t newNumElements,
+    const element_construct_func_t& defaultConstructor) {
+    auto oldNumElements = numElements;
+    KU_ASSERT(newNumElements >= oldNumElements);
+    uint64_t oldNumArrayPages = inMemArrayPages.size();
+    uint64_t newNumArrayPages = getNumArrayPagesNeededForElements(newNumElements);
+    for (auto i = oldNumArrayPages; i < newNumArrayPages; ++i) {
+        inMemArrayPages.emplace_back(
+            memoryManager.allocateBuffer(true /*initializeToZero*/, LBUG_PAGE_SIZE));
+    }
+    for (uint64_t i = 0; i < newNumElements - oldNumElements; i++) {
+        auto* dest = operator[](oldNumElements + i);
+        defaultConstructor(dest);
+    }
+    numElements = newNumElements;
+}
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/disk_array_collection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/disk_array_collection.cpp
new file mode 100644
index 0000000000..80a67ffc96
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/disk_array_collection.cpp
@@ -0,0 +1,115 @@
+#include "storage/disk_array_collection.h"
+
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include "storage/file_handle.h"
+#include "storage/shadow_utils.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+DiskArrayCollection::DiskArrayCollection(FileHandle& fileHandle, ShadowFile& shadowFile,
+    bool bypassShadowing)
+    : fileHandle(fileHandle), shadowFile{shadowFile}, bypassShadowing{bypassShadowing},
+      numHeaders{0} {
+    headersForReadTrx.push_back(std::make_unique<HeaderPage>());
+    headersForWriteTrx.push_back(std::make_unique<HeaderPage>());
+    headerPagesOnDisk = 0;
+}
+
+DiskArrayCollection::DiskArrayCollection(FileHandle& fileHandle, ShadowFile& shadowFile,
+    page_idx_t firstHeaderPage, bool bypassShadowing)
+    : fileHandle(fileHandle), shadowFile{shadowFile}, bypassShadowing{bypassShadowing},
+      numHeaders{0} {
+    // Read headers from disk
+    page_idx_t headerPageIdx = firstHeaderPage;
+    do {
+        fileHandle.optimisticReadPage(headerPageIdx, [&](auto* frame) {
+            const auto page = reinterpret_cast<HeaderPage*>(frame);
+            headersForReadTrx.push_back(std::make_unique<HeaderPage>(*page));
+            headersForWriteTrx.push_back(std::make_unique<HeaderPage>(*page));
+            headerPageIdx = page->nextHeaderPage;
+            numHeaders += page->numHeaders;
+        });
+    } while (headerPageIdx != INVALID_PAGE_IDX);
+    headerPagesOnDisk = headersForReadTrx.size();
+}
+
+void DiskArrayCollection::checkpoint(page_idx_t firstHeaderPage, PageAllocator& pageAllocator) {
+    // Write headers to disk
+    page_idx_t headerPage = firstHeaderPage;
+    for (page_idx_t indexInMemory = 0; indexInMemory < headersForWriteTrx.size(); indexInMemory++) {
+        if (headersForWriteTrx[indexInMemory]->nextHeaderPage == INVALID_PAGE_IDX &&
+            indexInMemory < headersForWriteTrx.size() - 1) {
+            // This is the first time checkpointing the next disk array, allocate a page for its
+            // header
+            populateNextHeaderPage(pageAllocator, indexInMemory);
+        }
+
+        // Only update if the headers for the given page have changed
+        // Or if the page has not yet been written
+        if (indexInMemory >= headerPagesOnDisk ||
+            *headersForWriteTrx[indexInMemory] != *headersForReadTrx[indexInMemory]) {
+            ShadowUtils::updatePage(*pageAllocator.getDataFH(), headerPage,
+                true /*writing full page*/, shadowFile, [&](auto* frame) {
+                    memcpy(frame, headersForWriteTrx[indexInMemory].get(), sizeof(HeaderPage));
+                    if constexpr (sizeof(HeaderPage) < LBUG_PAGE_SIZE) {
+                        // Zero remaining data in the page
+                        std::fill(frame + sizeof(HeaderPage), frame + LBUG_PAGE_SIZE, 0);
+                    }
+                });
+        }
+        headerPage = headersForWriteTrx[indexInMemory]->nextHeaderPage;
+    }
+    headerPagesOnDisk = headersForWriteTrx.size();
+}
+
+void DiskArrayCollection::populateNextHeaderPage(PageAllocator& pageAllocator,
+    common::page_idx_t indexInMemory) {
+    auto nextHeaderPage = pageAllocator.allocatePage();
+    headersForWriteTrx[indexInMemory]->nextHeaderPage = nextHeaderPage;
+    // We can't really roll back the structural changes in the PKIndex (the disk arrays are
+    // created in the destructor and there are a fixed number which does not change after that
+    // point), so we apply those to the version that would otherwise be identical to the one on
+    // disk
+    headersForReadTrx[indexInMemory]->nextHeaderPage = nextHeaderPage;
+}
+
+size_t DiskArrayCollection::addDiskArray() {
+    auto oldSize = numHeaders++;
+    // This may not be the last header page. If we rollback there may be header pages which are
+    // empty
+    auto pageIdx = numHeaders % HeaderPage::NUM_HEADERS_PER_PAGE;
+    if (pageIdx >= headersForWriteTrx.size()) {
+
+        headersForWriteTrx.emplace_back(std::make_unique<HeaderPage>());
+        // Also add a new read header page as we need to pass read headers to the disk arrays
+        // Newly added read headers will be empty until checkpointing
+        headersForReadTrx.emplace_back(std::make_unique<HeaderPage>());
+    }
+
+    auto& headerPage = *headersForWriteTrx[pageIdx];
+    KU_ASSERT(headerPage.numHeaders < HeaderPage::NUM_HEADERS_PER_PAGE);
+    auto indexInPage = headerPage.numHeaders;
+    headerPage.headers[indexInPage] = DiskArrayHeader();
+    headerPage.numHeaders++;
+    headersForReadTrx[pageIdx]->numHeaders++;
+    return oldSize;
+}
+
+void DiskArrayCollection::reclaimStorage(PageAllocator& pageAllocator,
+    common::page_idx_t firstHeaderPage) const {
+    auto headerPage = firstHeaderPage;
+    for (page_idx_t indexInMemory = 0; indexInMemory < headersForReadTrx.size(); indexInMemory++) {
+        if (headerPage == INVALID_PAGE_IDX) {
+            break;
+        }
+        pageAllocator.freePage(headerPage);
+        headerPage = headersForReadTrx[indexInMemory]->nextHeaderPage;
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/file_db_id_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/file_db_id_utils.cpp
new file mode 100644
index 0000000000..83fe9ea181
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/file_db_id_utils.cpp
@@ -0,0 +1,20 @@
+#include "storage/file_db_id_utils.h"
+
+#include "common/exception/runtime.h"
+
+namespace lbug::storage {
+void FileDBIDUtils::verifyDatabaseID(const common::FileInfo& fileInfo,
+    common::ku_uuid_t expectedDatabaseID, common::ku_uuid_t databaseID) {
+    if (expectedDatabaseID.value != databaseID.value) {
+        throw common::RuntimeException(common::stringFormat(
+            "Database ID for temporary file '{}' does not match the current database. This file "
+            "may have been left behind from a previous database with the same name. If it is safe "
+            "to do so, please delete this file and restart the database.",
+            fileInfo.path));
+    }
+}
+
+void FileDBIDUtils::writeDatabaseID(common::Serializer& ser, common::ku_uuid_t databaseID) {
+    ser.write(databaseID);
+}
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/file_handle.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/file_handle.cpp
new file mode 100644
index 0000000000..679ac7a8d7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/file_handle.cpp
@@ -0,0 +1,177 @@
+#include "storage/file_handle.h"
+
+#include <cmath>
+
+#include "common/file_system/virtual_file_system.h"
+#include "storage/buffer_manager/buffer_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+FileHandle::FileHandle(const std::string& path, uint8_t fhFlags, BufferManager* bm,
+    uint32_t fileIndex, VirtualFileSystem* vfs, main::ClientContext* context)
+    : fhFlags{fhFlags}, fileIndex{fileIndex}, numPages{0}, pageCapacity{0}, bm{bm},
+      pageSizeClass{isNewTmpFile() && isLargePaged() ? TEMP_PAGE : REGULAR_PAGE}, pageStates{0, 0},
+      frameGroupIdxes{0, 0}, pageManager(std::make_unique<PageManager>(this)) {
+    if (isNewTmpFile()) {
+        constructTmpFileHandle(path);
+    } else {
+        constructPersistentFileHandle(path, vfs, context);
+    }
+    pageStates = ConcurrentVector<PageState, StorageConstants::PAGE_GROUP_SIZE,
+        TEMP_PAGE_SIZE / sizeof(void*)>{numPages, pageCapacity};
+    frameGroupIdxes = ConcurrentVector<page_group_idx_t>{getNumPageGroups(), getNumPageGroups()};
+    for (auto i = 0u; i < frameGroupIdxes.size(); i++) {
+        frameGroupIdxes[i] = bm->addNewFrameGroup(pageSizeClass);
+    }
+}
+
+void FileHandle::constructPersistentFileHandle(const std::string& path, VirtualFileSystem* vfs,
+    main::ClientContext* context) {
+    FileOpenFlags openFlags{0};
+    if (isReadOnlyFile()) {
+        openFlags.flags = FileFlags::READ_ONLY;
+        openFlags.lockType = isLockRequired() ? FileLockType::READ_LOCK : FileLockType::NO_LOCK;
+    } else {
+        openFlags.flags =
+            FileFlags::WRITE | FileFlags::READ_ONLY |
+            ((createFileIfNotExists()) ? FileFlags::CREATE_IF_NOT_EXISTS : 0x00000000);
+        openFlags.lockType = isLockRequired() ? FileLockType::WRITE_LOCK : FileLockType::NO_LOCK;
+    }
+    fileInfo = vfs->openFile(path, openFlags, context);
+    const auto fileLength = fileInfo->getFileSize();
+    numPages = ceil(static_cast<double>(fileLength) / static_cast<double>(getPageSize()));
+    pageCapacity = 0;
+    while (pageCapacity < numPages) {
+        pageCapacity += StorageConstants::PAGE_GROUP_SIZE;
+    }
+}
+
+void FileHandle::constructTmpFileHandle(const std::string& path) {
+    fileInfo = std::make_unique<FileInfo>(path, nullptr);
+    numPages = 0;
+    pageCapacity = 0;
+}
+
+page_idx_t FileHandle::addNewPage() {
+    return addNewPages(1 /* numNewPages */);
+}
+
+page_idx_t FileHandle::addNewPages(page_idx_t numNewPages) {
+    std::unique_lock lck{fhSharedMutex, std::defer_lock_t{}};
+    while (!lck.try_lock()) {}
+    const auto numPagesBeforeChange = numPages.load();
+    for (auto i = 0u; i < numNewPages; i++) {
+        addNewPageWithoutLock();
+    }
+    return numPagesBeforeChange;
+}
+
+page_idx_t FileHandle::addNewPageWithoutLock() {
+    if (numPages == pageCapacity) {
+        addNewPageGroupWithoutLock();
+    }
+    pageStates[numPages].resetToEvicted();
+    const auto pageIdx = numPages++;
+    if (isInMemoryMode()) {
+        bm->pin(*this, pageIdx, PageReadPolicy::DONT_READ_PAGE);
+    }
+    return pageIdx;
+}
+
+void FileHandle::addNewPageGroupWithoutLock() {
+    pageCapacity += StorageConstants::PAGE_GROUP_SIZE;
+    pageStates.resize(pageCapacity);
+    frameGroupIdxes.push_back(bm->addNewFrameGroup(pageSizeClass));
+}
+
+uint8_t* FileHandle::pinPage(page_idx_t pageIdx, PageReadPolicy readPolicy) {
+    if (isInMemoryMode()) {
+        // Already pinned.
+        return bm->getFrame(*this, pageIdx);
+    }
+    return bm->pin(*this, pageIdx, readPolicy);
+}
+
+void FileHandle::optimisticReadPage(page_idx_t pageIdx,
+    const std::function<void(uint8_t*)>& readOp) {
+    if (isInMemoryMode()) {
+        KU_ASSERT(
+            PageState::getState(getPageState(pageIdx)->getStateAndVersion()) == PageState::LOCKED);
+        const auto frame = bm->getFrame(*this, pageIdx);
+        readOp(frame);
+    } else {
+        bm->optimisticRead(*this, pageIdx, readOp);
+    }
+}
+
+void FileHandle::unpinPage(page_idx_t pageIdx) {
+    bm->unpin(*this, pageIdx);
+}
+
+void FileHandle::resetToZeroPagesAndPageCapacity() {
+    removePageIdxAndTruncateIfNecessary(0 /* pageIdx */);
+    if (isInMemoryMode()) {
+        for (auto i = 0u; i < numPages; i++) {
+            bm->unpin(*this, i);
+        }
+    } else {
+        fileInfo->truncate(0 /* size */);
+    }
+}
+
+uint8_t* FileHandle::getFrame(page_idx_t pageIdx) {
+    KU_ASSERT(pageIdx < numPages);
+    return bm->getFrame(*this, pageIdx);
+}
+
+void FileHandle::removePageIdxAndTruncateIfNecessary(page_idx_t pageIdx) {
+    std::unique_lock xLck{fhSharedMutex};
+    if (numPages <= pageIdx) {
+        return;
+    }
+    numPages = pageIdx;
+    pageStates.resize(numPages);
+    const auto numPageGroups = getNumPageGroups();
+    if (numPageGroups == frameGroupIdxes.size()) {
+        return;
+    }
+    KU_ASSERT(numPageGroups < frameGroupIdxes.size());
+    frameGroupIdxes.resize(numPageGroups);
+    pageCapacity = numPageGroups * StorageConstants::PAGE_GROUP_SIZE;
+}
+
+void FileHandle::removePageFromFrameIfNecessary(page_idx_t pageIdx) {
+    bm->removePageFromFrameIfNecessary(*this, pageIdx);
+}
+
+void FileHandle::flushAllDirtyPagesInFrames() {
+    for (auto pageIdx = 0u; pageIdx < numPages; ++pageIdx) {
+        flushPageIfDirtyWithoutLock(pageIdx);
+    }
+}
+
+void FileHandle::flushPageIfDirtyWithoutLock(page_idx_t pageIdx) {
+    auto pageState = getPageState(pageIdx);
+    if (!isInMemoryMode() && pageState->isDirty()) {
+        fileInfo->writeFile(getFrame(pageIdx), getPageSize(), pageIdx * getPageSize());
+        pageState->clearDirtyWithoutLock();
+    }
+}
+
+void FileHandle::writePagesToFile(const uint8_t* buffer, uint64_t size, page_idx_t startPageIdx) {
+    if (isInMemoryMode()) {
+        auto pageSize = getPageSize();
+        for (uint64_t i = 0; i < size; i += pageSize) {
+            const auto frame = getFrame(startPageIdx + i / pageSize);
+            memcpy(frame, buffer + i, std::min(pageSize, size - i));
+        }
+    } else {
+        fileInfo->writeFile(buffer, size, startPageIdx * getPageSize());
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/free_space_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/free_space_manager.cpp
new file mode 100644
index 0000000000..963f4d953d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/free_space_manager.cpp
@@ -0,0 +1,303 @@
+#include "storage/free_space_manager.h"
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/in_mem_file_writer.h"
+#include "common/serializer/serializer.h"
+#include "common/utils.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/file_handle.h"
+#include "storage/page_range.h"
+
+namespace lbug::storage {
+static FreeSpaceManager::sorted_free_list_t& getFreeList(
+    std::vector<FreeSpaceManager::sorted_free_list_t>& freeLists, common::idx_t level) {
+    if (level >= freeLists.size()) {
+        freeLists.resize(level + 1,
+            FreeSpaceManager::sorted_free_list_t{&FreeSpaceManager::entryCmp});
+    }
+    return freeLists[level];
+}
+
+FreeSpaceManager::FreeSpaceManager() : freeLists{}, numEntries(0), needClearEvictedEntries(false){};
+
+common::idx_t FreeSpaceManager::getLevel(common::page_idx_t numPages) {
+    // level is exponent of largest power of 2 that is <= numPages
+    // e.g. 2 -> level 1, 5 -> level 2
+    KU_ASSERT(numPages > 0);
+    return common::CountZeros<common::page_idx_t>::Trailing(std::bit_floor(numPages));
+}
+
+bool FreeSpaceManager::entryCmp(const PageRange& a, const PageRange& b) {
+    return a.numPages == b.numPages ? a.startPageIdx < b.startPageIdx : a.numPages < b.numPages;
+}
+
+void FreeSpaceManager::addFreePages(PageRange entry) {
+    KU_ASSERT(entry.numPages > 0);
+    const auto entryLevel = getLevel(entry.numPages);
+    KU_ASSERT(!getFreeList(freeLists, entryLevel).contains(entry));
+    getFreeList(freeLists, entryLevel).insert(entry);
+    ++numEntries;
+}
+
+void FreeSpaceManager::evictAndAddFreePages(FileHandle* fileHandle, PageRange entry) {
+    evictPages(fileHandle, entry);
+    addFreePages(entry);
+}
+
+void FreeSpaceManager::addUncheckpointedFreePages(PageRange entry) {
+    uncheckpointedFreePageRanges.push_back(entry);
+}
+
+void FreeSpaceManager::rollbackCheckpoint() {
+    uncheckpointedFreePageRanges.clear();
+}
+
+// This also removes the chunk from the free space manager
+std::optional<PageRange> FreeSpaceManager::popFreePages(common::page_idx_t numPages) {
+    if (numPages > 0) {
+        auto levelToSearch = getLevel(numPages);
+        for (; levelToSearch < freeLists.size(); ++levelToSearch) {
+            auto& curList = freeLists[levelToSearch];
+            auto entryIt = curList.lower_bound(PageRange{0, numPages});
+            if (entryIt != curList.end()) {
+                auto entry = *entryIt;
+                curList.erase(entryIt);
+                --numEntries;
+                return splitPageRange(entry, numPages);
+            }
+        }
+    }
+    return std::nullopt;
+}
+
+PageRange FreeSpaceManager::splitPageRange(PageRange chunk, common::page_idx_t numRequiredPages) {
+    KU_ASSERT(chunk.numPages >= numRequiredPages);
+    PageRange ret{chunk.startPageIdx, numRequiredPages};
+    if (numRequiredPages < chunk.numPages) {
+        PageRange remainingEntry{chunk.startPageIdx + numRequiredPages,
+            chunk.numPages - numRequiredPages};
+        addFreePages(remainingEntry);
+    }
+    return ret;
+}
+
+struct SerializePagesUsedTracker {
+    common::page_idx_t numPagesUsed;
+    uint64_t numBytesUsedInPage;
+
+    void updatePagesUsed(uint64_t numBytesToAdd) {
+        if (numBytesUsedInPage + numBytesToAdd > common::InMemFileWriter::getPageSize()) {
+            ++numPagesUsed;
+            numBytesUsedInPage = 0;
+        }
+        numBytesUsedInPage += numBytesToAdd;
+    }
+
+    template<typename T>
+    void processValue(T) {
+        updatePagesUsed(sizeof(T));
+    }
+
+    void processDebuggingInfo(const std::string& value) {
+        updatePagesUsed(sizeof(uint64_t) + value.size());
+    }
+};
+
+struct ValueSerializer {
+    common::Serializer& ser;
+
+    template<typename T>
+    void processValue(T value) {
+        ser.write(value);
+    }
+
+    void processDebuggingInfo(const std::string& value) { ser.writeDebuggingInfo(value); }
+};
+
+template<typename ValueProcessor>
+static common::row_idx_t serializeCheckpointedEntries(
+    const std::vector<FreeSpaceManager::sorted_free_list_t>& freeLists, ValueProcessor& ser) {
+    auto entryIt = FreeEntryIterator{freeLists};
+    common::row_idx_t numWrittenEntries = 0;
+    while (!entryIt.done()) {
+        const auto entry = *entryIt;
+        ser.processValue(entry.startPageIdx);
+        ser.processValue(entry.numPages);
+        ++entryIt;
+        ++numWrittenEntries;
+    }
+    return numWrittenEntries;
+}
+
+template<typename ValueProcessor>
+static common::row_idx_t serializeUncheckpointedEntries(
+    const FreeSpaceManager::free_list_t& uncheckpointedEntries, ValueProcessor& ser) {
+    for (const auto& entry : uncheckpointedEntries) {
+        ser.processValue(entry.startPageIdx);
+        ser.processValue(entry.numPages);
+    }
+    return uncheckpointedEntries.size();
+}
+
+template<typename ValueProcessor>
+void FreeSpaceManager::serializeInternal(ValueProcessor& ser) const {
+    // we also serialize uncheckpointed entries as serialize() may be called before
+    // finalizeCheckpoint()
+    ser.processDebuggingInfo("page_manager");
+    const auto numEntries = getNumEntries() + uncheckpointedFreePageRanges.size();
+    ser.processDebuggingInfo("numEntries");
+    ser.processValue(numEntries);
+    ser.processDebuggingInfo("entries");
+    [[maybe_unused]] const auto numCheckpointedEntries =
+        serializeCheckpointedEntries(freeLists, ser);
+    [[maybe_unused]] const auto numUncheckpointedEntries =
+        serializeUncheckpointedEntries(uncheckpointedFreePageRanges, ser);
+    KU_ASSERT(numCheckpointedEntries + numUncheckpointedEntries == numEntries);
+}
+
+common::page_idx_t FreeSpaceManager::getMaxNumPagesForSerialization() const {
+    SerializePagesUsedTracker ser{};
+    serializeInternal(ser);
+    return ser.numPagesUsed + (ser.numBytesUsedInPage > 0);
+}
+
+void FreeSpaceManager::serialize(common::Serializer& ser) const {
+    ValueSerializer serWrapper{.ser = ser};
+    serializeInternal(serWrapper);
+}
+
+void FreeSpaceManager::deserialize(common::Deserializer& deSer) {
+    std::string key;
+
+    deSer.validateDebuggingInfo(key, "page_manager");
+    deSer.validateDebuggingInfo(key, "numEntries");
+    common::row_idx_t numEntries{};
+    deSer.deserializeValue<common::row_idx_t>(numEntries);
+
+    deSer.validateDebuggingInfo(key, "entries");
+    for (common::row_idx_t i = 0; i < numEntries; ++i) {
+        PageRange entry{};
+        deSer.deserializeValue<common::page_idx_t>(entry.startPageIdx);
+        deSer.deserializeValue<common::page_idx_t>(entry.numPages);
+        addFreePages(entry);
+    }
+}
+
+void FreeSpaceManager::evictPages(FileHandle* fileHandle, const PageRange& entry) {
+    needClearEvictedEntries = true;
+    for (uint64_t i = 0; i < entry.numPages; ++i) {
+        const auto pageIdx = entry.startPageIdx + i;
+        fileHandle->removePageFromFrameIfNecessary(pageIdx);
+    }
+}
+
+void FreeSpaceManager::finalizeCheckpoint(FileHandle* fileHandle) {
+    // evict pages before they're added to the free list
+    for (const auto& entry : uncheckpointedFreePageRanges) {
+        evictPages(fileHandle, entry);
+    }
+
+    mergePageRanges(std::move(uncheckpointedFreePageRanges), fileHandle);
+    uncheckpointedFreePageRanges.clear();
+}
+
+void FreeSpaceManager::resetFreeLists() {
+    freeLists.clear();
+    numEntries = 0;
+}
+
+void FreeSpaceManager::mergePageRanges(free_list_t newInitialEntries, FileHandle* fileHandle) {
+    free_list_t allEntries = std::move(newInitialEntries);
+    for (const auto& freeList : freeLists) {
+        allEntries.insert(allEntries.end(), freeList.begin(), freeList.end());
+    }
+    if (allEntries.empty()) {
+        return;
+    }
+
+    resetFreeLists();
+    std::sort(allEntries.begin(), allEntries.end(), [](const auto& entryA, const auto& entryB) {
+        return entryA.startPageIdx < entryB.startPageIdx;
+    });
+
+    PageRange prevEntry = allEntries[0];
+    for (common::row_idx_t i = 1; i < allEntries.size(); ++i) {
+        const auto& entry = allEntries[i];
+        KU_ASSERT(prevEntry.startPageIdx + prevEntry.numPages <= entry.startPageIdx);
+        if (prevEntry.startPageIdx + prevEntry.numPages == entry.startPageIdx) {
+            prevEntry.numPages += entry.numPages;
+        } else {
+            addFreePages(prevEntry);
+            prevEntry = entry;
+        }
+    }
+    handleLastPageRange(prevEntry, fileHandle);
+}
+
+void FreeSpaceManager::handleLastPageRange(PageRange pageRange, FileHandle* fileHandle) {
+    if (pageRange.startPageIdx + pageRange.numPages == fileHandle->getNumPages()) {
+        fileHandle->removePageIdxAndTruncateIfNecessary(pageRange.startPageIdx);
+    } else {
+        addFreePages(pageRange);
+    }
+}
+
+common::row_idx_t FreeSpaceManager::getNumEntries() const {
+    return numEntries;
+}
+
+std::vector<PageRange> FreeSpaceManager::getEntries(common::row_idx_t startOffset,
+    common::row_idx_t endOffset) const {
+    KU_ASSERT(endOffset >= startOffset);
+    std::vector<PageRange> ret;
+    FreeEntryIterator it{freeLists};
+    it.advance(startOffset);
+    while (ret.size() < endOffset - startOffset) {
+        KU_ASSERT(!it.done());
+        ret.push_back(*it);
+        ++it;
+    }
+    return ret;
+}
+
+void FreeSpaceManager::clearEvictedBufferManagerEntriesIfNeeded(BufferManager* bufferManager) {
+    if (needClearEvictedEntries) {
+        bufferManager->removeEvictedCandidates();
+        needClearEvictedEntries = false;
+    }
+}
+
+void FreeEntryIterator::advance(common::row_idx_t numEntries) {
+    for (common::row_idx_t i = 0; i < numEntries; ++i) {
+        ++(*this);
+    }
+}
+
+void FreeEntryIterator::operator++() {
+    KU_ASSERT(freeListIdx < freeLists.size());
+    ++freeListIt;
+    if (freeListIt == freeLists[freeListIdx].end()) {
+        ++freeListIdx;
+        advanceFreeListIdx();
+    }
+}
+
+bool FreeEntryIterator::done() const {
+    return freeListIdx >= freeLists.size();
+}
+
+void FreeEntryIterator::advanceFreeListIdx() {
+    for (; freeListIdx < freeLists.size(); ++freeListIdx) {
+        if (!freeLists[freeListIdx].empty()) {
+            freeListIt = freeLists[freeListIdx].begin();
+            break;
+        }
+    }
+}
+
+PageRange FreeEntryIterator::operator*() const {
+    KU_ASSERT(freeListIdx < freeLists.size() && freeListIt != freeLists[freeListIdx].end());
+    return *freeListIt;
+}
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/CMakeLists.txt
new file mode 100644
index 0000000000..494c6421a7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_storage_index
+        OBJECT
+        hash_index.cpp
+        in_mem_hash_index.cpp
+        index.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_storage_index>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/hash_index.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/hash_index.cpp
new file mode 100644
index 0000000000..cc76445a69
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/hash_index.cpp
@@ -0,0 +1,735 @@
+#include "storage/index/hash_index.h"
+
+#include <bitset>
+
+#include "common/assert.h"
+#include "common/exception/message.h"
+#include "common/serializer/deserializer.h"
+#include "common/types/int128_t.h"
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "common/types/uint128_t.h"
+#include "main/client_context.h"
+#include "storage/disk_array.h"
+#include "storage/disk_array_collection.h"
+#include "storage/file_handle.h"
+#include "storage/index/hash_index_header.h"
+#include "storage/index/hash_index_slot.h"
+#include "storage/index/hash_index_utils.h"
+#include "storage/index/in_mem_hash_index.h"
+#include "storage/local_storage/local_hash_index.h"
+#include "storage/overflow_file.h"
+#include "storage/shadow_utils.h"
+#include "storage/storage_manager.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+template<typename T>
+HashIndex<T>::HashIndex(MemoryManager& memoryManager, OverflowFileHandle* overflowFileHandle,
+    DiskArrayCollection& diskArrays, uint64_t indexPos, ShadowFile* shadowFile,
+    const HashIndexHeader& indexHeaderForReadTrx, HashIndexHeader& indexHeaderForWriteTrx)
+    : shadowFile{shadowFile}, headerPageIdx{0}, overflowFileHandle{overflowFileHandle},
+      localStorage{std::make_unique<HashIndexLocalStorage<T>>(memoryManager, overflowFileHandle)},
+      indexHeaderForReadTrx{indexHeaderForReadTrx}, indexHeaderForWriteTrx{indexHeaderForWriteTrx},
+      memoryManager{memoryManager} {
+    pSlots = diskArrays.getDiskArray<OnDiskSlotType>(indexPos);
+    oSlots = diskArrays.getDiskArray<OnDiskSlotType>(NUM_HASH_INDEXES + indexPos);
+}
+
+template<typename T>
+void HashIndex<T>::deleteFromPersistentIndex(const Transaction* transaction, Key key,
+    visible_func isVisible) {
+    auto& header = this->indexHeaderForWriteTrx;
+    if (header.numEntries == 0) {
+        return;
+    }
+    auto hashValue = HashIndexUtils::hash(key);
+    auto fingerprint = HashIndexUtils::getFingerprintForHash(hashValue);
+    auto iter =
+        getSlotIterator(HashIndexUtils::getPrimarySlotIdForHash(header, hashValue), transaction);
+    do {
+        auto entryPos = findMatchedEntryInSlot(transaction, iter.slot, key, fingerprint, isVisible);
+        if (entryPos != SlotHeader::INVALID_ENTRY_POS) {
+            iter.slot.header.setEntryInvalid(entryPos);
+            updateSlot(transaction, iter.slotInfo, iter.slot);
+            header.numEntries--;
+        }
+    } while (nextChainedSlot(transaction, iter));
+}
+
+template<>
+inline hash_t HashIndex<ku_string_t>::hashStored(const Transaction* transaction,
+    const ku_string_t& key) const {
+    hash_t hash = 0;
+    const auto str = overflowFileHandle->readString(transaction->getType(), key);
+    function::Hash::operation(str, hash);
+    return hash;
+}
+
+template<typename T>
+bool HashIndex<T>::checkpoint(PageAllocator& pageAllocator) {
+    if (localStorage->hasUpdates()) {
+        auto transaction = &DUMMY_CHECKPOINT_TRANSACTION;
+        auto netInserts = localStorage->getNetInserts();
+        if (netInserts > 0) {
+            reserve(pageAllocator, transaction, netInserts);
+        }
+        localStorage->applyLocalChanges(
+            [&](Key) {
+                // TODO(Guodong/Ben): FIX-ME. We should vacuum the index during checkpoint.
+                // DO NOTHING.
+            },
+            [&](const auto& insertions) {
+                mergeBulkInserts(pageAllocator, transaction, insertions);
+            });
+        pSlots->checkpoint();
+        oSlots->checkpoint();
+        return true;
+    }
+    pSlots->checkpoint();
+    oSlots->checkpoint();
+    return false;
+}
+
+template<typename T>
+bool HashIndex<T>::checkpointInMemory() {
+    if (!localStorage->hasUpdates()) {
+        return false;
+    }
+    pSlots->checkpointInMemoryIfNecessary();
+    oSlots->checkpointInMemoryIfNecessary();
+    localStorage->clear();
+    if constexpr (std::same_as<ku_string_t, T>) {
+        overflowFileHandle->checkpointInMemory();
+    }
+    return true;
+}
+
+template<typename T>
+bool HashIndex<T>::rollbackInMemory() {
+    if (!localStorage->hasUpdates()) {
+        return false;
+    }
+    pSlots->rollbackInMemoryIfNecessary();
+    oSlots->rollbackInMemoryIfNecessary();
+    localStorage->clear();
+    return true;
+}
+
+template<typename T>
+void HashIndex<T>::rollbackCheckpoint() {
+    pSlots->rollbackInMemoryIfNecessary();
+    oSlots->rollbackInMemoryIfNecessary();
+}
+
+template<typename T>
+void HashIndex<T>::reclaimStorage(PageAllocator& pageAllocator) {
+    pSlots->reclaimStorage(pageAllocator);
+    oSlots->reclaimStorage(pageAllocator);
+}
+
+template<typename T>
+void HashIndex<T>::splitSlots(PageAllocator& pageAllocator, const Transaction* transaction,
+    HashIndexHeader& header, slot_id_t numSlotsToSplit) {
+    auto originalSlotIterator = pSlots->iter_mut();
+    auto newSlotIterator = pSlots->iter_mut();
+    auto overflowSlotIterator = oSlots->iter_mut();
+    // The overflow slot iterators will hang if they access the same page
+    // So instead buffer new overflow slots here and append them at the end
+    std::vector<OnDiskSlotType> newOverflowSlots;
+
+    auto getNextOvfSlot = [&](slot_id_t nextOvfSlotId) {
+        if (nextOvfSlotId >= oSlots->getNumElements()) {
+            return &newOverflowSlots[nextOvfSlotId - oSlots->getNumElements()];
+        } else {
+            return &*overflowSlotIterator.seek(nextOvfSlotId);
+        }
+    };
+
+    for (slot_id_t i = 0; i < numSlotsToSplit; i++) {
+        auto* newSlot = &*newSlotIterator.pushBack(pageAllocator, transaction, OnDiskSlotType());
+        entry_pos_t newEntryPos = 0;
+        OnDiskSlotType* originalSlot = &*originalSlotIterator.seek(header.nextSplitSlotId);
+        do {
+            for (entry_pos_t originalEntryPos = 0; originalEntryPos < PERSISTENT_SLOT_CAPACITY;
+                 originalEntryPos++) {
+                if (!originalSlot->header.isEntryValid(originalEntryPos)) {
+                    continue; // Skip invalid entries.
+                }
+                if (newEntryPos >= PERSISTENT_SLOT_CAPACITY) {
+                    newSlot->header.nextOvfSlotId =
+                        newOverflowSlots.size() + oSlots->getNumElements();
+                    newOverflowSlots.emplace_back();
+                    newSlot = &newOverflowSlots.back();
+                    newEntryPos = 0;
+                }
+                // Copy entry from old slot to new slot
+                const auto& key = originalSlot->entries[originalEntryPos].key;
+                const hash_t hash = this->hashStored(transaction, key);
+                const auto newSlotId = hash & header.higherLevelHashMask;
+                if (newSlotId != header.nextSplitSlotId) {
+                    KU_ASSERT(newSlotId == newSlotIterator.idx());
+                    newSlot->entries[newEntryPos] = originalSlot->entries[originalEntryPos];
+                    newSlot->header.setEntryValid(newEntryPos,
+                        originalSlot->header.fingerprints[originalEntryPos]);
+                    originalSlot->header.setEntryInvalid(originalEntryPos);
+                    newEntryPos++;
+                }
+            }
+        } while (originalSlot->header.nextOvfSlotId != SlotHeader::INVALID_OVERFLOW_SLOT_ID &&
+                 (originalSlot = getNextOvfSlot(originalSlot->header.nextOvfSlotId)));
+        header.incrementNextSplitSlotId();
+    }
+    for (auto&& slot : newOverflowSlots) {
+        overflowSlotIterator.pushBack(pageAllocator, transaction, std::move(slot));
+    }
+}
+
+template<typename T>
+std::vector<std::pair<SlotInfo, typename HashIndex<T>::OnDiskSlotType>>
+HashIndex<T>::getChainedSlots(const Transaction* transaction, slot_id_t pSlotId) {
+    std::vector<std::pair<SlotInfo, OnDiskSlotType>> slots;
+    SlotInfo slotInfo{pSlotId, SlotType::PRIMARY};
+    while (slotInfo.slotType == SlotType::PRIMARY ||
+           slotInfo.slotId != SlotHeader::INVALID_OVERFLOW_SLOT_ID) {
+        auto slot = getSlot(transaction, slotInfo);
+        slots.emplace_back(slotInfo, slot);
+        slotInfo.slotId = slot.header.nextOvfSlotId;
+        slotInfo.slotType = SlotType::OVF;
+    }
+    return slots;
+}
+
+template<typename T>
+void HashIndex<T>::reserve(PageAllocator& pageAllocator, const Transaction* transaction,
+    uint64_t newEntries) {
+    slot_id_t numRequiredEntries =
+        HashIndexUtils::getNumRequiredEntries(this->indexHeaderForWriteTrx.numEntries + newEntries);
+    // Can be no fewer slots than the current level requires
+    auto numRequiredSlots =
+        std::max((numRequiredEntries + PERSISTENT_SLOT_CAPACITY - 1) / PERSISTENT_SLOT_CAPACITY,
+            static_cast<slot_id_t>(1ul << this->indexHeaderForWriteTrx.currentLevel));
+    // Always start with at least one page worth of slots.
+    // This guarantees that when splitting the source and destination slot are never on the same
+    // page, which allows safe use of multiple disk array iterators.
+    numRequiredSlots = std::max(numRequiredSlots, LBUG_PAGE_SIZE / pSlots->getAlignedElementSize());
+    // If there are no entries, we can just re-size the number of primary slots and re-calculate the
+    // levels
+    if (this->indexHeaderForWriteTrx.numEntries == 0) {
+        pSlots->resize(pageAllocator, transaction, numRequiredSlots);
+
+        auto numSlotsOfCurrentLevel = 1u << this->indexHeaderForWriteTrx.currentLevel;
+        while ((numSlotsOfCurrentLevel << 1) <= numRequiredSlots) {
+            this->indexHeaderForWriteTrx.incrementLevel();
+            numSlotsOfCurrentLevel <<= 1;
+        }
+        if (numRequiredSlots >= numSlotsOfCurrentLevel) {
+            this->indexHeaderForWriteTrx.nextSplitSlotId =
+                numRequiredSlots - numSlotsOfCurrentLevel;
+        }
+    } else {
+        splitSlots(pageAllocator, transaction, this->indexHeaderForWriteTrx,
+            numRequiredSlots - pSlots->getNumElements(transaction->getType()));
+    }
+}
+
+template<typename T>
+void HashIndex<T>::sortEntries(const Transaction* transaction,
+    const InMemHashIndex<T>& insertLocalStorage,
+    typename InMemHashIndex<T>::SlotIterator& slotToMerge,
+    std::vector<HashIndexEntryView>& entries) {
+    do {
+        auto numEntries = slotToMerge.slot->header.numEntries();
+        for (auto entryPos = 0u; entryPos < numEntries; entryPos++) {
+            const auto* entry = &slotToMerge.slot->entries[entryPos];
+            const auto hash = hashStored(transaction, entry->key);
+            const auto primarySlot =
+                HashIndexUtils::getPrimarySlotIdForHash(indexHeaderForWriteTrx, hash);
+            entries.push_back(HashIndexEntryView{primarySlot,
+                slotToMerge.slot->header.fingerprints[entryPos], entry});
+        }
+    } while (insertLocalStorage.nextChainedSlot(slotToMerge));
+    std::sort(entries.begin(), entries.end(), [&](auto entry1, auto entry2) -> bool {
+        // Sort based on the entry's disk slot ID so that the first slot is at the end.
+        // Sorting is done reversed so that we can process from the back of the list,
+        // using the size to track the remaining entries
+        return entry1.diskSlotId > entry2.diskSlotId;
+    });
+}
+
+template<typename T>
+void HashIndex<T>::mergeBulkInserts(PageAllocator& pageAllocator, const Transaction* transaction,
+    const InMemHashIndex<T>& insertLocalStorage) {
+    // TODO: Ideally we can split slots at the same time that we insert new ones
+    // Compute the new number of primary slots, and iterate over each slot, determining if it
+    // needs to be split (and how many times, which is complicated) and insert/rehash each element
+    // one by one. Rehashed entries should be copied into a new slot in-memory, and then that new
+    // slot (with the entries from the respective slot in the local storage) should be processed
+    // immediately to avoid increasing memory usage (caching one page of slots at a time since split
+    // slots usually get rehashed to a new page).
+    //
+    // On the other hand, two passes may not be significantly slower than one
+    // TODO: one pass would also reduce locking when frames are unpinned,
+    // which is useful if this can be parallelized
+    reserve(pageAllocator, transaction, insertLocalStorage.size());
+    // RUNTIME_CHECK(auto originalNumEntries = this->indexHeaderForWriteTrx.numEntries);
+
+    // Storing as many slots in-memory as on-disk shouldn't be necessary (for one, it makes memory
+    // usage an issue as we may need significantly more memory to store the slots that we would
+    // otherwise). Instead, when merging here, we can re-hash and split each in-memory slot (into
+    // temporary vector buffers instead of slots for improved performance) and then merge each of
+    // those one at a time into the disk slots. That will keep the low memory requirements and still
+    // let us update each on-disk slot one at a time.
+
+    auto diskSlotIterator = pSlots->iter_mut();
+    // TODO: Use a separate random access iterator and one that's sequential for adding new overflow
+    // slots All new slots will be sequential and benefit from caching, but for existing randomly
+    // accessed slots we just benefit from the interface. However, the two iterators would not be
+    // able to pin the same page simultaneously
+    // Alternatively, cache new slots in memory and pushBack them at the end like in splitSlots
+    auto diskOverflowSlotIterator = oSlots->iter_mut();
+
+    // Store sorted slot positions. Re-use to avoid re-allocating memory
+    // TODO: Unify implementations to make sure this matches the size used by the disk array
+    constexpr size_t NUM_SLOTS_PER_PAGE =
+        LBUG_PAGE_SIZE / DiskArray<OnDiskSlotType>::getAlignedElementSize();
+    std::array<std::vector<HashIndexEntryView>, NUM_SLOTS_PER_PAGE> partitionedEntries;
+    // Sort entries for a page of slots at a time, then move vertically and process all entries
+    // which map to a given page on disk, then horizontally to the next page in the set. These pages
+    // may not be consecutive, but we reduce the memory overhead for storing the information about
+    // the sorted data and still just process each page once.
+    for (uint64_t localSlotId = 0; localSlotId < insertLocalStorage.numPrimarySlots();
+         localSlotId += NUM_SLOTS_PER_PAGE) {
+        for (size_t i = 0;
+             i < NUM_SLOTS_PER_PAGE && localSlotId + i < insertLocalStorage.numPrimarySlots();
+             i++) {
+            auto localSlot =
+                typename InMemHashIndex<T>::SlotIterator(localSlotId + i, &insertLocalStorage);
+            partitionedEntries[i].clear();
+            // Results are sorted in reverse, so we can process the end first and pop_back to remove
+            // them from the vector
+            sortEntries(transaction, insertLocalStorage, localSlot, partitionedEntries[i]);
+        }
+        // Repeat until there are no unprocessed partitions in partitionedEntries
+        // This will run at most NUM_SLOTS_PER_PAGE times the number of entries
+        std::bitset<NUM_SLOTS_PER_PAGE> done;
+        while (!done.all()) {
+            std::optional<page_idx_t> diskSlotPage;
+            for (size_t i = 0; i < NUM_SLOTS_PER_PAGE; i++) {
+                if (!done[i] && !partitionedEntries[i].empty()) {
+                    auto diskSlotId = partitionedEntries[i].back().diskSlotId;
+                    if (!diskSlotPage) {
+                        diskSlotPage = diskSlotId / NUM_SLOTS_PER_PAGE;
+                    }
+                    if (diskSlotId / NUM_SLOTS_PER_PAGE == diskSlotPage) {
+                        auto merged = mergeSlot(pageAllocator, transaction, partitionedEntries[i],
+                            diskSlotIterator, diskOverflowSlotIterator, diskSlotId);
+                        KU_ASSERT(merged <= partitionedEntries[i].size());
+                        partitionedEntries[i].resize(partitionedEntries[i].size() - merged);
+                        if (partitionedEntries[i].empty()) {
+                            done[i] = true;
+                        }
+                    }
+                } else {
+                    done[i] = true;
+                }
+            }
+        }
+    }
+    // TODO(Guodong): Fix this assertion statement which doesn't count the entries in
+    // deleteLocalStorage.
+    //     KU_ASSERT(originalNumEntries + insertLocalStorage.getIndexHeader().numEntries ==
+    //               indexHeaderForWriteTrx.numEntries);
+}
+
+template<typename T>
+size_t HashIndex<T>::mergeSlot(PageAllocator& pageAllocator, const Transaction* transaction,
+    const std::vector<HashIndexEntryView>& slotToMerge,
+    typename DiskArray<OnDiskSlotType>::WriteIterator& diskSlotIterator,
+    typename DiskArray<OnDiskSlotType>::WriteIterator& diskOverflowSlotIterator,
+    slot_id_t diskSlotId) {
+    slot_id_t diskEntryPos = 0u;
+    // mergeSlot should only be called when there is at least one entry for the given disk slot id
+    // in the slot to merge
+    OnDiskSlotType* diskSlot = &*diskSlotIterator.seek(diskSlotId);
+    KU_ASSERT(diskSlot->header.nextOvfSlotId == SlotHeader::INVALID_OVERFLOW_SLOT_ID ||
+              diskOverflowSlotIterator.size() > diskSlot->header.nextOvfSlotId);
+    // Merge slot from local storage to an existing slot.
+    size_t merged = 0;
+    for (auto it = std::rbegin(slotToMerge); it != std::rend(slotToMerge); ++it) {
+        if (it->diskSlotId != diskSlotId) {
+            return merged;
+        }
+        // Find the next empty entry or add a new slot if there are no more entries
+        while (diskSlot->header.isEntryValid(diskEntryPos) ||
+               diskEntryPos >= PERSISTENT_SLOT_CAPACITY) {
+            diskEntryPos++;
+            if (diskEntryPos >= PERSISTENT_SLOT_CAPACITY) {
+                if (diskSlot->header.nextOvfSlotId == SlotHeader::INVALID_OVERFLOW_SLOT_ID) {
+                    // If there are no more disk slots in this chain, we need to add one
+                    diskSlot->header.nextOvfSlotId = diskOverflowSlotIterator.size();
+                    // This may invalidate diskSlot
+                    diskOverflowSlotIterator.pushBack(pageAllocator, transaction, OnDiskSlotType());
+                    KU_ASSERT(
+                        diskSlot->header.nextOvfSlotId == SlotHeader::INVALID_OVERFLOW_SLOT_ID ||
+                        diskOverflowSlotIterator.size() > diskSlot->header.nextOvfSlotId);
+                } else {
+                    diskOverflowSlotIterator.seek(diskSlot->header.nextOvfSlotId);
+                    KU_ASSERT(
+                        diskSlot->header.nextOvfSlotId == SlotHeader::INVALID_OVERFLOW_SLOT_ID ||
+                        diskOverflowSlotIterator.size() > diskSlot->header.nextOvfSlotId);
+                }
+                diskSlot = &*diskOverflowSlotIterator;
+                // Check to make sure we're not looping
+                KU_ASSERT(diskOverflowSlotIterator.idx() != diskSlot->header.nextOvfSlotId);
+                diskEntryPos = 0;
+            }
+        }
+        KU_ASSERT(diskEntryPos < PERSISTENT_SLOT_CAPACITY);
+        if constexpr (std::is_same_v<T, ku_string_t>) {
+            auto* inMemEntry = it->entry;
+            auto kuString = overflowFileHandle->writeString(&pageAllocator, inMemEntry->key);
+            diskSlot->entries[diskEntryPos] = SlotEntry<T>{kuString, inMemEntry->value};
+        } else {
+            diskSlot->entries[diskEntryPos] = *it->entry;
+        }
+        diskSlot->header.setEntryValid(diskEntryPos, it->fingerprint);
+        KU_ASSERT([&]() {
+            const auto& key = it->entry->key;
+            const auto hash = hashStored(transaction, key);
+            const auto primarySlot =
+                HashIndexUtils::getPrimarySlotIdForHash(indexHeaderForWriteTrx, hash);
+            KU_ASSERT(it->fingerprint == HashIndexUtils::getFingerprintForHash(hash));
+            KU_ASSERT(primarySlot == diskSlotId);
+            return true;
+        }());
+        indexHeaderForWriteTrx.numEntries++;
+        diskEntryPos++;
+        merged++;
+    }
+    return merged;
+}
+
+template<typename T>
+void HashIndex<T>::bulkReserve(uint64_t newEntries) {
+    return localStorage->reserveInserts(newEntries);
+}
+
+template<typename T>
+HashIndex<T>::~HashIndex() = default;
+
+template<>
+bool HashIndex<common::ku_string_t>::equals(const transaction::Transaction* transaction,
+    std::string_view keyToLookup, const common::ku_string_t& keyInEntry) const {
+    if (!HashIndexUtils::areStringPrefixAndLenEqual(keyToLookup, keyInEntry)) {
+        return false;
+    }
+    if (keyInEntry.len <= common::ku_string_t::PREFIX_LENGTH) {
+        // For strings shorter than PREFIX_LENGTH, the result must be true.
+        return true;
+    } else if (keyInEntry.len <= common::ku_string_t::SHORT_STR_LENGTH) {
+        // For short strings, whose lengths are larger than PREFIX_LENGTH, check if their
+        // actual values are equal.
+        return memcmp(keyToLookup.data(), keyInEntry.prefix, keyInEntry.len) == 0;
+    } else {
+        // For long strings, compare with overflow data
+        return overflowFileHandle->equals(transaction->getType(), keyToLookup, keyInEntry);
+    }
+}
+
+template class HashIndex<int64_t>;
+template class HashIndex<int32_t>;
+template class HashIndex<int16_t>;
+template class HashIndex<int8_t>;
+template class HashIndex<uint64_t>;
+template class HashIndex<uint32_t>;
+template class HashIndex<uint16_t>;
+template class HashIndex<uint8_t>;
+template class HashIndex<double>;
+template class HashIndex<float>;
+template class HashIndex<int128_t>;
+template class HashIndex<uint128_t>;
+template class HashIndex<ku_string_t>;
+
+std::unique_ptr<IndexStorageInfo> PrimaryKeyIndexStorageInfo::deserialize(
+    std::unique_ptr<BufferReader> reader) {
+    page_idx_t firstHeaderPage = INVALID_PAGE_IDX;
+    page_idx_t overflowHeaderPage = INVALID_PAGE_IDX;
+    Deserializer deSer(std::move(reader));
+    deSer.deserializeValue(firstHeaderPage);
+    deSer.deserializeValue(overflowHeaderPage);
+    return std::make_unique<PrimaryKeyIndexStorageInfo>(firstHeaderPage, overflowHeaderPage);
+}
+
+std::unique_ptr<PrimaryKeyIndex> PrimaryKeyIndex::createNewIndex(IndexInfo indexInfo,
+    bool inMemMode, MemoryManager& memoryManager, PageAllocator& pageAllocator,
+    ShadowFile* shadowFile) {
+    return std::make_unique<PrimaryKeyIndex>(std::move(indexInfo),
+        std::make_unique<PrimaryKeyIndexStorageInfo>(), inMemMode, memoryManager, pageAllocator,
+        shadowFile);
+}
+
+PrimaryKeyIndex::PrimaryKeyIndex(IndexInfo indexInfo, std::unique_ptr<IndexStorageInfo> storageInfo,
+    bool inMemMode, MemoryManager& memoryManager, PageAllocator& pageAllocator,
+    ShadowFile* shadowFile)
+    : Index{std::move(indexInfo), std::move(storageInfo)}, shadowFile{*shadowFile} {
+    auto& hashIndexStorageInfo = this->storageInfo->cast<PrimaryKeyIndexStorageInfo>();
+    if (hashIndexStorageInfo.firstHeaderPage == INVALID_PAGE_IDX) {
+        KU_ASSERT(hashIndexStorageInfo.overflowHeaderPage == INVALID_PAGE_IDX);
+        hashIndexHeadersForReadTrx.resize(NUM_HASH_INDEXES);
+        hashIndexHeadersForWriteTrx.resize(NUM_HASH_INDEXES);
+        hashIndexDiskArrays = std::make_unique<DiskArrayCollection>(*pageAllocator.getDataFH(),
+            *shadowFile, true /*bypassShadowing*/);
+        // Each index has a primary slot array and an overflow slot array
+        for (size_t i = 0; i < NUM_HASH_INDEXES * 2; i++) {
+            hashIndexDiskArrays->addDiskArray();
+        }
+    } else {
+        size_t headerIdx = 0;
+        for (size_t headerPageIdx = 0; headerPageIdx < INDEX_HEADER_PAGES; headerPageIdx++) {
+            pageAllocator.getDataFH()->optimisticReadPage(
+                hashIndexStorageInfo.firstHeaderPage + headerPageIdx, [&](auto* frame) {
+                    const auto onDiskHeaders = reinterpret_cast<HashIndexHeaderOnDisk*>(frame);
+                    for (size_t i = 0; i < INDEX_HEADERS_PER_PAGE && headerIdx < NUM_HASH_INDEXES;
+                         i++) {
+                        hashIndexHeadersForReadTrx.emplace_back(onDiskHeaders[i]);
+                        headerIdx++;
+                    }
+                });
+        }
+        hashIndexHeadersForWriteTrx.assign(hashIndexHeadersForReadTrx.begin(),
+            hashIndexHeadersForReadTrx.end());
+        KU_ASSERT(headerIdx == NUM_HASH_INDEXES);
+        hashIndexDiskArrays = std::make_unique<DiskArrayCollection>(*pageAllocator.getDataFH(),
+            *shadowFile,
+            hashIndexStorageInfo.firstHeaderPage +
+                INDEX_HEADER_PAGES /*firstHeaderPage for the DAC follows the index header pages*/,
+            true /*bypassShadowing*/);
+    }
+    initOverflowAndSubIndices(inMemMode, memoryManager, pageAllocator, hashIndexStorageInfo);
+}
+
+void PrimaryKeyIndex::initOverflowAndSubIndices(bool inMemMode, MemoryManager& mm,
+    PageAllocator& pageAllocator, PrimaryKeyIndexStorageInfo& storageInfo) {
+    KU_ASSERT(indexInfo.keyDataTypes.size() == 1);
+    if (indexInfo.keyDataTypes[0] == PhysicalTypeID::STRING) {
+        if (inMemMode) {
+            overflowFile = std::make_unique<InMemOverflowFile>(mm);
+        } else {
+            overflowFile = std::make_unique<OverflowFile>(pageAllocator.getDataFH(), mm,
+                &shadowFile, storageInfo.overflowHeaderPage);
+        }
+    }
+    hashIndices.reserve(NUM_HASH_INDEXES);
+    TypeUtils::visit(
+        indexInfo.keyDataTypes[0],
+        [&](ku_string_t) {
+            for (auto i = 0u; i < NUM_HASH_INDEXES; i++) {
+                hashIndices.push_back(std::make_unique<HashIndex<ku_string_t>>(mm,
+                    overflowFile->addHandle(), *hashIndexDiskArrays, i, &shadowFile,
+                    hashIndexHeadersForReadTrx[i], hashIndexHeadersForWriteTrx[i]));
+            }
+        },
+        [&]<HashablePrimitive T>(T) {
+            for (auto i = 0u; i < NUM_HASH_INDEXES; i++) {
+                hashIndices.push_back(std::make_unique<HashIndex<T>>(mm, nullptr,
+                    *hashIndexDiskArrays, i, &shadowFile, hashIndexHeadersForReadTrx[i],
+                    hashIndexHeadersForWriteTrx[i]));
+            }
+        },
+        [&](auto) { KU_UNREACHABLE; });
+}
+
+bool PrimaryKeyIndex::lookup(const Transaction* trx, ValueVector* keyVector, uint64_t vectorPos,
+    offset_t& result, visible_func isVisible) {
+    bool retVal = false;
+    KU_ASSERT(indexInfo.keyDataTypes.size() == 1);
+    TypeUtils::visit(
+        indexInfo.keyDataTypes[0],
+        [&]<IndexHashable T>(T) {
+            T key = keyVector->getValue<T>(vectorPos);
+            retVal = lookup(trx, key, result, isVisible);
+        },
+        [](auto) { KU_UNREACHABLE; });
+    return retVal;
+}
+
+void PrimaryKeyIndex::commitInsert(Transaction* transaction, const ValueVector& nodeIDVector,
+    const std::vector<ValueVector*>& indexVectors, Index::InsertState& insertState) {
+    KU_ASSERT(indexVectors.size() == 1);
+    const auto& pkVector = *indexVectors[0];
+    const auto& pkInsertState = insertState.cast<InsertState>();
+    for (auto i = 0u; i < nodeIDVector.state->getSelSize(); i++) {
+        const auto nodeIDPos = nodeIDVector.state->getSelVector()[i];
+        const auto offset = nodeIDVector.readNodeOffset(nodeIDPos);
+        const auto pkPos = pkVector.state->getSelVector()[i];
+        if (pkVector.isNull(pkPos)) {
+            throw RuntimeException(ExceptionMessage::nullPKException());
+        }
+        if (!insert(transaction, &pkVector, pkPos, offset, pkInsertState.isVisible)) {
+            throw RuntimeException(
+                ExceptionMessage::duplicatePKException(pkVector.getAsValue(pkPos)->toString()));
+        }
+    }
+}
+
+bool PrimaryKeyIndex::insert(const Transaction* transaction, const ValueVector* keyVector,
+    uint64_t vectorPos, offset_t value, visible_func isVisible) {
+    bool result = false;
+    KU_ASSERT(indexInfo.keyDataTypes.size() == 1);
+    TypeUtils::visit(
+        indexInfo.keyDataTypes[0],
+        [&]<IndexHashable T>(T) {
+            T key = keyVector->getValue<T>(vectorPos);
+            result = insert(transaction, key, value, isVisible);
+        },
+        [](auto) { KU_UNREACHABLE; });
+    return result;
+}
+
+void PrimaryKeyIndex::delete_(ValueVector* keyVector) {
+    KU_ASSERT(indexInfo.keyDataTypes.size() == 1);
+    TypeUtils::visit(
+        indexInfo.keyDataTypes[0],
+        [&]<IndexHashable T>(T) {
+            for (auto i = 0u; i < keyVector->state->getSelVector().getSelSize(); i++) {
+                auto pos = keyVector->state->getSelVector()[i];
+                if (keyVector->isNull(pos)) {
+                    continue;
+                }
+                auto key = keyVector->getValue<T>(pos);
+                delete_(key);
+            }
+        },
+        [](auto) { KU_UNREACHABLE; });
+}
+
+void PrimaryKeyIndex::checkpointInMemory() {
+    bool indexChanged = false;
+    for (auto i = 0u; i < NUM_HASH_INDEXES; i++) {
+        if (hashIndices[i]->checkpointInMemory()) {
+            indexChanged = true;
+        }
+    }
+    if (indexChanged) {
+        for (size_t i = 0; i < NUM_HASH_INDEXES; i++) {
+            hashIndexHeadersForReadTrx[i] = hashIndexHeadersForWriteTrx[i];
+        }
+        hashIndexDiskArrays->checkpointInMemory();
+    }
+    if (overflowFile) {
+        overflowFile->checkpointInMemory();
+    }
+}
+
+void PrimaryKeyIndex::writeHeaders(PageAllocator& pageAllocator) const {
+    size_t headerIdx = 0;
+    auto& hashIndexStorageInfo = storageInfo->cast<PrimaryKeyIndexStorageInfo>();
+    if (hashIndexStorageInfo.firstHeaderPage == INVALID_PAGE_IDX) {
+        const auto allocatedPages = pageAllocator.allocatePageRange(
+            NUM_HEADER_PAGES + 1 /*first DiskArrayCollection header page*/);
+        hashIndexStorageInfo.firstHeaderPage = allocatedPages.startPageIdx;
+    }
+    for (size_t headerPageIdx = 0; headerPageIdx < INDEX_HEADER_PAGES; headerPageIdx++) {
+        ShadowUtils::updatePage(*pageAllocator.getDataFH(),
+            hashIndexStorageInfo.firstHeaderPage + headerPageIdx,
+            true /*writing all the data to the page; no need to read original*/, shadowFile,
+            [&](auto* frame) {
+                const auto onDiskFrame = reinterpret_cast<HashIndexHeaderOnDisk*>(frame);
+                for (size_t i = 0; i < INDEX_HEADERS_PER_PAGE && headerIdx < NUM_HASH_INDEXES;
+                     i++) {
+                    hashIndexHeadersForWriteTrx[headerIdx++].write(onDiskFrame[i]);
+                }
+            });
+    }
+    KU_ASSERT(headerIdx == NUM_HASH_INDEXES);
+}
+
+void PrimaryKeyIndex::rollbackCheckpoint() {
+    for (idx_t i = 0; i < NUM_HASH_INDEXES; ++i) {
+        hashIndices[i]->rollbackCheckpoint();
+    }
+    hashIndexDiskArrays->rollbackCheckpoint();
+    hashIndexHeadersForWriteTrx.assign(hashIndexHeadersForReadTrx.begin(),
+        hashIndexHeadersForReadTrx.end());
+    if (overflowFile) {
+        overflowFile->rollbackInMemory();
+    }
+}
+
+static void updateOverflowHeaderPageIfNeeded(IndexStorageInfo* storageInfo,
+    OverflowFile* overflowFile) {
+    auto& hashIndexStorageInfo = storageInfo->cast<PrimaryKeyIndexStorageInfo>();
+    if (hashIndexStorageInfo.overflowHeaderPage == INVALID_PAGE_IDX) {
+        hashIndexStorageInfo.overflowHeaderPage = overflowFile->getHeaderPageIdx();
+    }
+}
+
+void PrimaryKeyIndex::checkpoint(main::ClientContext*, storage::PageAllocator& pageAllocator) {
+    bool indexChanged = false;
+    for (auto i = 0u; i < NUM_HASH_INDEXES; i++) {
+        if (hashIndices[i]->checkpoint(pageAllocator)) {
+            indexChanged = true;
+        }
+    }
+    if (indexChanged) {
+        writeHeaders(pageAllocator);
+        hashIndexDiskArrays->checkpoint(getDiskArrayFirstHeaderPage(), pageAllocator);
+    }
+    if (overflowFile) {
+        overflowFile->checkpoint(pageAllocator);
+        updateOverflowHeaderPageIfNeeded(storageInfo.get(), overflowFile.get());
+    }
+    // Make sure that changes which bypassed the WAL are written.
+    // There is no other mechanism for enforcing that they are flushed
+    // and they will be dropped when the file handle is destroyed.
+    // TODO: Should eventually be moved into the disk array when the disk array can
+    // generally handle bypassing the WAL, but should only be run once per file, not once per
+    // disk array
+    pageAllocator.getDataFH()->flushAllDirtyPagesInFrames();
+    checkpointInMemory();
+}
+
+PrimaryKeyIndex::~PrimaryKeyIndex() = default;
+
+std::unique_ptr<Index> PrimaryKeyIndex::load(main::ClientContext* context,
+    StorageManager* storageManager, IndexInfo indexInfo, std::span<uint8_t> storageInfoBuffer) {
+    auto storageInfoBufferReader =
+        std::make_unique<BufferReader>(storageInfoBuffer.data(), storageInfoBuffer.size());
+    auto storageInfo = PrimaryKeyIndexStorageInfo::deserialize(std::move(storageInfoBufferReader));
+    return std::make_unique<PrimaryKeyIndex>(indexInfo, std::move(storageInfo),
+        storageManager->isInMemory(), *MemoryManager::Get(*context),
+        *storageManager->getDataFH()->getPageManager(), &storageManager->getShadowFile());
+}
+
+void PrimaryKeyIndex::reclaimStorage(PageAllocator& pageAllocator) const {
+    for (auto& hashIndex : hashIndices) {
+        hashIndex->reclaimStorage(pageAllocator);
+    }
+    hashIndexDiskArrays->reclaimStorage(pageAllocator, getDiskArrayFirstHeaderPage());
+    if (overflowFile) {
+        overflowFile->reclaimStorage(pageAllocator);
+    }
+    const auto firstHeaderPage = getFirstHeaderPage();
+    if (firstHeaderPage != INVALID_PAGE_IDX) {
+        pageAllocator.freePageRange({getFirstHeaderPage(), NUM_HEADER_PAGES});
+    }
+}
+
+page_idx_t PrimaryKeyIndex::getDiskArrayFirstHeaderPage() const {
+    const auto firstHeaderPage = getFirstHeaderPage();
+    return firstHeaderPage == INVALID_PAGE_IDX ? INVALID_PAGE_IDX :
+                                                 firstHeaderPage + NUM_HEADER_PAGES;
+}
+
+page_idx_t PrimaryKeyIndex::getFirstHeaderPage() const {
+    return storageInfo->cast<PrimaryKeyIndexStorageInfo>().firstHeaderPage;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/in_mem_hash_index.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/in_mem_hash_index.cpp
new file mode 100644
index 0000000000..d532d9be43
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/in_mem_hash_index.cpp
@@ -0,0 +1,289 @@
+#include "storage/index/in_mem_hash_index.h"
+
+#include <cstdint>
+#include <cstring>
+
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/disk_array.h"
+#include "storage/index/hash_index_header.h"
+#include "storage/index/hash_index_slot.h"
+#include "storage/index/hash_index_utils.h"
+#include "storage/overflow_file.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+template<typename T>
+InMemHashIndex<T>::InMemHashIndex(MemoryManager& memoryManager,
+    OverflowFileHandle* overflowFileHandle)
+    : overflowFileHandle(overflowFileHandle),
+      pSlots{std::make_unique<BlockVector<InMemSlotType>>(memoryManager)},
+      oSlots{std::make_unique<BlockVector<InMemSlotType>>(memoryManager)}, indexHeader{},
+      memoryManager{memoryManager}, numFreeSlots{0} {
+    // Match HashIndex in allocating at least one page of slots so that we don't split within the
+    // same page
+    allocateSlots(LBUG_PAGE_SIZE / pSlots->getAlignedElementSize());
+}
+
+template<typename T>
+void InMemHashIndex<T>::clear() {
+    indexHeader = HashIndexHeader();
+    pSlots = std::make_unique<BlockVector<InMemSlotType>>(memoryManager);
+    oSlots = std::make_unique<BlockVector<InMemSlotType>>(memoryManager);
+    allocateSlots(LBUG_PAGE_SIZE / pSlots->getAlignedElementSize());
+}
+
+template<typename T>
+void InMemHashIndex<T>::allocateSlots(uint32_t newNumSlots) {
+    // Allocate memory before updating the header in case the memory allocation fails
+    auto existingSlots = pSlots->size();
+    if (newNumSlots > existingSlots) {
+        allocatePSlots(newNumSlots - existingSlots);
+    }
+    auto numSlotsOfCurrentLevel = 1u << this->indexHeader.currentLevel;
+    while ((numSlotsOfCurrentLevel << 1) <= newNumSlots) {
+        this->indexHeader.incrementLevel();
+        numSlotsOfCurrentLevel <<= 1;
+    }
+    if (newNumSlots >= numSlotsOfCurrentLevel) {
+        this->indexHeader.nextSplitSlotId = newNumSlots - numSlotsOfCurrentLevel;
+    }
+}
+
+template<typename T>
+void InMemHashIndex<T>::reserve(uint32_t numEntries_) {
+    slot_id_t numRequiredEntries = HashIndexUtils::getNumRequiredEntries(numEntries_);
+    auto numRequiredSlots = (numRequiredEntries + SLOT_CAPACITY - 1) / SLOT_CAPACITY;
+    if (numRequiredSlots <= pSlots->size()) {
+        return;
+    }
+    if (indexHeader.numEntries == 0) {
+        allocateSlots(numRequiredSlots);
+    } else {
+        while (pSlots->size() < numRequiredSlots) {
+            splitSlot();
+        }
+    }
+}
+
+template<typename T>
+uint64_t InMemHashIndex<T>::countSlots(SlotIterator iter) const {
+    if (iter.slotInfo.slotType == SlotType::OVF &&
+        iter.slotInfo.slotId == SlotHeader::INVALID_OVERFLOW_SLOT_ID) {
+        return 0;
+    }
+    uint64_t count = 1;
+    while (nextChainedSlot(iter)) {
+        count++;
+    }
+    return count;
+}
+
+template<typename T>
+void InMemHashIndex<T>::reserveOverflowSlots(uint64_t totalSlotsRequired) {
+    // Make sure we have enough free slots to do the split without having to allocate more
+    // Any unused ones will just stay in the free slot chain and will be reused later
+    SlotInfo newSlot{oSlots->size(), SlotType::OVF};
+    if (totalSlotsRequired > numFreeSlots) {
+        oSlots->resize(oSlots->size() + totalSlotsRequired - numFreeSlots);
+        for (uint64_t i = 0; i < totalSlotsRequired - numFreeSlots; i++) {
+            auto slot = getSlot(newSlot);
+            addFreeOverflowSlot(*slot, newSlot);
+            newSlot.slotId++;
+        }
+    }
+}
+
+template<typename T>
+void InMemHashIndex<T>::splitSlot() {
+    // Add new slot
+    allocatePSlots(1);
+
+    // Rehash the entries in the slot to split
+    SlotIterator originalSlot(indexHeader.nextSplitSlotId, this);
+    // Reserve enough overflow slots to be able to finish splitting without allocating any new
+    // memory Otherwise we run the risk of leaving the hash index in an invalid state if we fail to
+    // allocate a new overflow slot
+    // TODO(bmwinger): If we split slots backwards instead of forwards we would need to reserve just
+    // one slot Since we could then reclaim slots that have been emptied. That would require making
+    // the slots doubly-linked
+    reserveOverflowSlots(countSlots(originalSlot));
+
+    // Use a separate iterator to track the first empty position so that the gapless entries can
+    // be maintained
+    SlotIterator originalSlotForInsert(indexHeader.nextSplitSlotId, this);
+    auto entryPosToInsert = 0u;
+    SlotIterator newSlot(pSlots->size() - 1, this);
+    entry_pos_t newSlotPos = 0;
+    bool gaps = false;
+    do {
+        for (auto entryPos = 0u; entryPos < SLOT_CAPACITY; entryPos++) {
+            if (!originalSlot.slot->header.isEntryValid(entryPos)) {
+                // Check that this function leaves no gaps
+                KU_ASSERT(originalSlot.slot->header.numEntries() ==
+                          std::countr_one(originalSlot.slot->header.validityMask));
+                // There should be no gaps, so when we encounter an invalid entry we can return
+                // early
+                reclaimOverflowSlots(originalSlotForInsert);
+                indexHeader.incrementNextSplitSlotId();
+                return;
+            }
+            const auto& entry = originalSlot.slot->entries[entryPos];
+            const auto& hash = this->hashStored(originalSlot.slot->entries[entryPos].key);
+            const auto fingerprint = HashIndexUtils::getFingerprintForHash(hash);
+            const auto newSlotId = hash & indexHeader.higherLevelHashMask;
+            if (newSlotId != indexHeader.nextSplitSlotId) {
+                if (newSlotPos >= SLOT_CAPACITY) {
+                    auto newOvfSlotId = allocateAOSlot();
+                    newSlot.slot->header.nextOvfSlotId = newOvfSlotId;
+                    [[maybe_unused]] bool hadNextSlot = nextChainedSlot(newSlot);
+                    KU_ASSERT(hadNextSlot);
+                    newSlotPos = 0;
+                }
+                newSlot.slot->entries[newSlotPos] = entry;
+                newSlot.slot->header.setEntryValid(newSlotPos, fingerprint);
+                originalSlot.slot->header.setEntryInvalid(entryPos);
+                newSlotPos++;
+                gaps = true;
+            } else if (gaps) {
+                // If we have created a gap previously, move the entry to the first gap to avoid
+                // leaving gaps
+                while (originalSlotForInsert.slot->header.isEntryValid(entryPosToInsert)) {
+                    entryPosToInsert++;
+                    if (entryPosToInsert >= SLOT_CAPACITY) {
+                        entryPosToInsert = 0;
+                        // There should always be another slot since we can't split more entries
+                        // than there were to begin with
+                        [[maybe_unused]] bool hadNextSlot = nextChainedSlot(originalSlotForInsert);
+                        KU_ASSERT(hadNextSlot);
+                    }
+                }
+                originalSlotForInsert.slot->entries[entryPosToInsert] = entry;
+                originalSlotForInsert.slot->header.setEntryValid(entryPosToInsert, fingerprint);
+                originalSlot.slot->header.setEntryInvalid(entryPos);
+            }
+        }
+        KU_ASSERT(originalSlot.slot->header.numEntries() ==
+                  std::countr_one(originalSlot.slot->header.validityMask));
+    } while (nextChainedSlot(originalSlot));
+
+    reclaimOverflowSlots(originalSlotForInsert);
+    indexHeader.incrementNextSplitSlotId();
+}
+
+template<typename T>
+void InMemHashIndex<T>::addFreeOverflowSlot(InMemSlotType& overflowSlot, SlotInfo slotInfo) {
+    // This function should only be called on slots that can be directly inserted into the free slot
+    // list
+    KU_ASSERT(slotInfo.slotId != SlotHeader::INVALID_OVERFLOW_SLOT_ID);
+    KU_ASSERT(overflowSlot.header.nextOvfSlotId == SlotHeader::INVALID_OVERFLOW_SLOT_ID);
+    KU_ASSERT(slotInfo.slotType == SlotType::OVF);
+    overflowSlot.header.nextOvfSlotId = indexHeader.firstFreeOverflowSlotId;
+    indexHeader.firstFreeOverflowSlotId = slotInfo.slotId;
+    numFreeSlots++;
+}
+
+template<typename T>
+void InMemHashIndex<T>::reclaimOverflowSlots(SlotIterator iter) {
+    // Reclaim empty overflow slots at the end of the chain.
+    // This saves the cost of having to iterate over them, and reduces memory usage by letting them
+    // be used instead of allocating new slots
+    if (iter.slot->header.nextOvfSlotId != SlotHeader::INVALID_OVERFLOW_SLOT_ID) {
+        // Skip past the last non-empty entry
+        InMemSlotType* lastNonEmptySlot = iter.slot;
+        while (iter.slot->header.numEntries() > 0 || iter.slotInfo.slotType == SlotType::PRIMARY) {
+            lastNonEmptySlot = iter.slot;
+            if (!nextChainedSlot(iter)) {
+                iter.slotInfo = HashIndexUtils::INVALID_OVF_INFO;
+                break;
+            }
+        }
+        lastNonEmptySlot->header.nextOvfSlotId = SlotHeader::INVALID_OVERFLOW_SLOT_ID;
+        while (iter.slotInfo != HashIndexUtils::INVALID_OVF_INFO) {
+            // Remove empty overflow slots from slot chain
+            KU_ASSERT(iter.slot->header.numEntries() == 0);
+            auto slotInfo = iter.slotInfo;
+            auto slot = clearNextOverflowAndAdvanceIter(iter);
+            if (slotInfo.slotType == SlotType::OVF) {
+                // Insert empty slot into free slot chain
+                addFreeOverflowSlot(*slot, slotInfo);
+            }
+        }
+    }
+}
+
+template<typename T>
+InMemHashIndex<T>::InMemSlotType* InMemHashIndex<T>::clearNextOverflowAndAdvanceIter(
+    SlotIterator& iter) {
+    auto originalSlot = iter.slot;
+    auto nextOverflowSlot = iter.slot->header.nextOvfSlotId;
+    iter.slot->header.nextOvfSlotId = SlotHeader::INVALID_OVERFLOW_SLOT_ID;
+    iter.slotInfo = SlotInfo{nextOverflowSlot, SlotType::OVF};
+    if (nextOverflowSlot != SlotHeader::INVALID_OVERFLOW_SLOT_ID) {
+        iter.slot = getSlot(iter.slotInfo);
+    }
+    return originalSlot;
+}
+
+template<typename T>
+uint32_t InMemHashIndex<T>::allocatePSlots(uint32_t numSlotsToAllocate) {
+    auto oldNumSlots = pSlots->size();
+    auto newNumSlots = oldNumSlots + numSlotsToAllocate;
+    pSlots->resize(newNumSlots);
+    return oldNumSlots;
+}
+
+template<typename T>
+uint32_t InMemHashIndex<T>::allocateAOSlot() {
+    if (indexHeader.firstFreeOverflowSlotId == SlotHeader::INVALID_OVERFLOW_SLOT_ID) {
+        auto oldNumSlots = oSlots->size();
+        auto newNumSlots = oldNumSlots + 1;
+        oSlots->resize(newNumSlots);
+        return oldNumSlots;
+    } else {
+        auto freeOSlotId = indexHeader.firstFreeOverflowSlotId;
+        auto& slot = (*oSlots)[freeOSlotId];
+        // Remove slot from the free slot chain
+        indexHeader.firstFreeOverflowSlotId = slot.header.nextOvfSlotId;
+        KU_ASSERT(slot.header.numEntries() == 0);
+        slot.header.nextOvfSlotId = SlotHeader::INVALID_OVERFLOW_SLOT_ID;
+        KU_ASSERT(numFreeSlots > 0);
+        numFreeSlots--;
+        return freeOSlotId;
+    }
+}
+
+template<typename T>
+InMemHashIndex<T>::InMemSlotType* InMemHashIndex<T>::getSlot(const SlotInfo& slotInfo) const {
+    if (slotInfo.slotType == SlotType::PRIMARY) {
+        return &pSlots->operator[](slotInfo.slotId);
+    } else {
+        return &oSlots->operator[](slotInfo.slotId);
+    }
+}
+
+template<typename T>
+common::hash_t InMemHashIndex<T>::hashStored(const InMemHashIndex<T>::OwnedType& key) const {
+    return HashIndexUtils::hash(key);
+}
+
+template class InMemHashIndex<int64_t>;
+template class InMemHashIndex<int32_t>;
+template class InMemHashIndex<int16_t>;
+template class InMemHashIndex<int8_t>;
+template class InMemHashIndex<uint64_t>;
+template class InMemHashIndex<uint32_t>;
+template class InMemHashIndex<uint16_t>;
+template class InMemHashIndex<uint8_t>;
+template class InMemHashIndex<double>;
+template class InMemHashIndex<float>;
+template class InMemHashIndex<int128_t>;
+template class InMemHashIndex<uint128_t>;
+template class InMemHashIndex<ku_string_t>;
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/index.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/index.cpp
new file mode 100644
index 0000000000..e242b9b3ae
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/index/index.cpp
@@ -0,0 +1,106 @@
+#include "storage/index/index.h"
+
+#include "common/exception/runtime.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "main/client_context.h"
+#include "storage/storage_manager.h"
+
+namespace lbug {
+namespace storage {
+
+IndexStorageInfo::~IndexStorageInfo() = default;
+
+Index::InsertState::~InsertState() = default;
+
+Index::UpdateState::~UpdateState() = default;
+
+Index::DeleteState::~DeleteState() = default;
+
+Index::~Index() = default;
+
+bool Index::isBuiltOnColumn(common::column_id_t columnID) const {
+    auto it = std::find(indexInfo.columnIDs.begin(), indexInfo.columnIDs.end(), columnID);
+    return it != indexInfo.columnIDs.end();
+}
+
+void IndexInfo::serialize(common::Serializer& ser) const {
+    ser.write<std::string>(name);
+    ser.write<std::string>(indexType);
+    ser.write<common::table_id_t>(tableID);
+    ser.serializeVector(columnIDs);
+    ser.serializeVector(keyDataTypes);
+    ser.write<bool>(isPrimary);
+    ser.write<bool>(isBuiltin);
+}
+
+IndexInfo IndexInfo::deserialize(common::Deserializer& deSer) {
+    std::string name;
+    std::string indexType;
+    common::table_id_t tableID = common::INVALID_TABLE_ID;
+    std::vector<common::column_id_t> columnIDs;
+    std::vector<common::PhysicalTypeID> keyDataTypes;
+    bool isPrimary = false;
+    bool isBuiltin = false;
+    deSer.deserializeValue(name);
+    deSer.deserializeValue(indexType);
+    deSer.deserializeValue<common::table_id_t>(tableID);
+    deSer.deserializeVector(columnIDs);
+    deSer.deserializeVector(keyDataTypes);
+    deSer.deserializeValue<bool>(isPrimary);
+    deSer.deserializeValue<bool>(isBuiltin);
+    return IndexInfo{std::move(name), std::move(indexType), tableID, std::move(columnIDs),
+        std::move(keyDataTypes), isPrimary, isBuiltin};
+}
+
+std::shared_ptr<common::BufferWriter> IndexStorageInfo::serialize() const {
+    return std::make_shared<common::BufferWriter>(0 /*maximumSize*/);
+}
+
+void Index::serialize(common::Serializer& ser) const {
+    indexInfo.serialize(ser);
+    auto bufferedWriter = storageInfo->serialize();
+    ser.write<uint64_t>(bufferedWriter->getSize());
+    ser.write(bufferedWriter->getData().data.get(), bufferedWriter->getSize());
+}
+
+IndexHolder::IndexHolder(std::unique_ptr<Index> loadedIndex)
+    : indexInfo{loadedIndex->getIndexInfo()}, storageInfoBuffer{nullptr}, storageInfoBufferSize{0},
+      loaded{true}, index{std::move(loadedIndex)} {}
+
+IndexHolder::IndexHolder(IndexInfo indexInfo, std::unique_ptr<uint8_t[]> storageInfoBuffer,
+    uint32_t storageInfoBufferSize)
+    : indexInfo{std::move(indexInfo)}, storageInfoBuffer{std::move(storageInfoBuffer)},
+      storageInfoBufferSize{storageInfoBufferSize}, loaded{false}, index{nullptr} {}
+
+void IndexHolder::serialize(common::Serializer& ser) const {
+    if (loaded) {
+        KU_ASSERT(index);
+        index->serialize(ser);
+    } else {
+        indexInfo.serialize(ser);
+        ser.write<uint64_t>(storageInfoBufferSize);
+        if (storageInfoBufferSize > 0) {
+            KU_ASSERT(storageInfoBuffer);
+            ser.write(storageInfoBuffer.get(), storageInfoBufferSize);
+        }
+    }
+}
+
+void IndexHolder::load(main::ClientContext* context, StorageManager* storageManager) {
+    if (loaded) {
+        return;
+    }
+    KU_ASSERT(!index);
+    KU_ASSERT(storageInfoBuffer);
+    auto indexTypeOptional = StorageManager::Get(*context)->getIndexType(indexInfo.indexType);
+    if (!indexTypeOptional.has_value()) {
+        throw common::RuntimeException("No index type with name: " + indexInfo.indexType);
+    }
+    index = indexTypeOptional.value().get().loadFunc(context, storageManager, indexInfo,
+        std::span(storageInfoBuffer.get(), storageInfoBufferSize));
+    loaded = true;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/CMakeLists.txt
new file mode 100644
index 0000000000..a30accd400
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_storage_local_storage
+        OBJECT
+        local_node_table.cpp
+        local_rel_table.cpp
+        local_storage.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_storage_local_storage>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/local_node_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/local_node_table.cpp
new file mode 100644
index 0000000000..5d71d5526d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/local_node_table.cpp
@@ -0,0 +1,129 @@
+#include "storage/local_storage/local_node_table.h"
+
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "common/cast.h"
+#include "common/exception/message.h"
+#include "common/types/types.h"
+#include "common/types/value/value.h"
+#include "storage/index/hash_index.h"
+#include "storage/storage_utils.h"
+#include "storage/table/node_table.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+std::vector<LogicalType> LocalNodeTable::getNodeTableColumnTypes(
+    const catalog::TableCatalogEntry& table) {
+    std::vector<LogicalType> types;
+    for (auto& property : table.getProperties()) {
+        types.push_back(property.getType().copy());
+    }
+    return types;
+}
+
+LocalNodeTable::LocalNodeTable(const catalog::TableCatalogEntry* tableEntry, Table& table,
+    MemoryManager& mm)
+    : LocalTable{table}, overflowFileHandle(nullptr),
+      nodeGroups{mm, getNodeTableColumnTypes(*tableEntry), false /*enableCompression*/} {
+    initLocalHashIndex(mm);
+    startOffset = table.getNumTotalRows(nullptr /* transaction */);
+}
+
+void LocalNodeTable::initLocalHashIndex(MemoryManager& mm) {
+    auto& nodeTable = ku_dynamic_cast<const NodeTable&>(table);
+    overflowFile = std::make_unique<InMemOverflowFile>(mm);
+    overflowFileHandle = overflowFile->addHandle();
+    hashIndex = std::make_unique<LocalHashIndex>(mm,
+        nodeTable.getColumn(nodeTable.getPKColumnID()).getDataType().getPhysicalType(),
+        overflowFileHandle);
+}
+
+bool LocalNodeTable::isVisible(const Transaction* transaction, offset_t offset) const {
+    auto [nodeGroupIdx, offsetInGroup] =
+        StorageUtils::getNodeGroupIdxAndOffsetInChunk(offset - startOffset);
+    auto* nodeGroup = nodeGroups.getNodeGroup(nodeGroupIdx);
+    if (nodeGroup->isDeleted(transaction, offsetInGroup)) {
+        return false;
+    }
+    return nodeGroup->isInserted(transaction, offsetInGroup);
+}
+
+offset_t LocalNodeTable::validateUniquenessConstraint(const Transaction* transaction,
+    const ValueVector& pkVector) const {
+    KU_ASSERT(pkVector.state->getSelVector().getSelSize() == 1);
+    return hashIndex->lookup(pkVector,
+        [&](offset_t offset_) { return isVisible(transaction, offset_); });
+}
+
+bool LocalNodeTable::insert(Transaction* transaction, TableInsertState& insertState) {
+    auto& nodeInsertState = insertState.constCast<NodeTableInsertState>();
+    const auto nodeOffset = startOffset + nodeGroups.getNumTotalRows();
+    KU_ASSERT(nodeInsertState.pkVector.state->getSelVector().getSelSize() == 1);
+    if (!hashIndex->insert(nodeInsertState.pkVector, nodeOffset,
+            [&](offset_t offset) { return isVisible(transaction, offset); })) {
+        const auto val =
+            nodeInsertState.pkVector.getAsValue(nodeInsertState.pkVector.state->getSelVector()[0]);
+        throw RuntimeException(ExceptionMessage::duplicatePKException(val->toString()));
+    }
+    const auto nodeIDPos =
+        nodeInsertState.nodeIDVector.state->getSelVector().getSelectedPositions()[0];
+    nodeInsertState.nodeIDVector.setValue(nodeIDPos, internalID_t{nodeOffset, table.getTableID()});
+    nodeGroups.append(&DUMMY_TRANSACTION, insertState.propertyVectors);
+    return true;
+}
+
+bool LocalNodeTable::update(Transaction* transaction, TableUpdateState& updateState) {
+    KU_ASSERT(transaction->isDummy());
+    const auto& nodeUpdateState = updateState.cast<NodeTableUpdateState>();
+    KU_ASSERT(nodeUpdateState.nodeIDVector.state->getSelVector().getSelSize() == 1);
+    const auto pos = nodeUpdateState.nodeIDVector.state->getSelVector()[0];
+    const auto offset = nodeUpdateState.nodeIDVector.readNodeOffset(pos);
+    KU_ASSERT(nodeUpdateState.columnID != table.cast<NodeTable>().getPKColumnID());
+    KU_ASSERT(offset >= startOffset);
+    const auto [nodeGroupIdx, rowIdxInGroup] =
+        StorageUtils::getQuotientRemainder(offset - startOffset, StorageConfig::NODE_GROUP_SIZE);
+    const auto nodeGroup = nodeGroups.getNodeGroup(nodeGroupIdx);
+    nodeGroup->update(transaction, rowIdxInGroup, nodeUpdateState.columnID,
+        nodeUpdateState.propertyVector);
+    return true;
+}
+
+bool LocalNodeTable::delete_(Transaction* transaction, TableDeleteState& deleteState) {
+    KU_ASSERT(transaction->isDummy());
+    const auto& nodeDeleteState = deleteState.cast<NodeTableDeleteState>();
+    KU_ASSERT(nodeDeleteState.nodeIDVector.state->getSelVector().getSelSize() == 1);
+    const auto pos = nodeDeleteState.nodeIDVector.state->getSelVector()[0];
+    const auto offset = nodeDeleteState.nodeIDVector.readNodeOffset(pos);
+    KU_ASSERT(offset >= startOffset);
+    hashIndex->delete_(nodeDeleteState.pkVector);
+    const auto [nodeGroupIdx, rowIdxInGroup] =
+        StorageUtils::getQuotientRemainder(offset - startOffset, StorageConfig::NODE_GROUP_SIZE);
+    const auto nodeGroup = nodeGroups.getNodeGroup(nodeGroupIdx);
+    return nodeGroup->delete_(transaction, rowIdxInGroup);
+}
+
+bool LocalNodeTable::addColumn(TableAddColumnState& addColumnState) {
+    nodeGroups.addColumn(addColumnState);
+    return true;
+}
+
+void LocalNodeTable::clear(MemoryManager& mm) {
+    auto& nodeTable = ku_dynamic_cast<const NodeTable&>(table);
+    hashIndex = std::make_unique<LocalHashIndex>(mm,
+        nodeTable.getColumn(nodeTable.getPKColumnID()).getDataType().getPhysicalType(),
+        overflowFileHandle);
+    nodeGroups.clear();
+}
+
+bool LocalNodeTable::lookupPK(const Transaction* transaction, const ValueVector* keyVector,
+    sel_t pos, offset_t& result) const {
+    result = hashIndex->lookup(*keyVector, pos,
+        [&](offset_t offset) { return isVisible(transaction, offset); });
+    return result != INVALID_OFFSET;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/local_rel_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/local_rel_table.cpp
new file mode 100644
index 0000000000..9952f2618e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/local_rel_table.cpp
@@ -0,0 +1,298 @@
+#include "storage/local_storage/local_rel_table.h"
+
+#include <algorithm>
+#include <numeric>
+
+#include "common/enums/rel_direction.h"
+#include "storage/table/rel_table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+static std::vector<LogicalType> getTypesForLocalRelTable(const catalog::TableCatalogEntry& table) {
+    std::vector<LogicalType> types;
+    types.reserve(table.getNumProperties() + 2);
+    // Pre-append src and dst node ID columns.
+    types.push_back(LogicalType::INTERNAL_ID());
+    types.push_back(LogicalType::INTERNAL_ID());
+    for (auto& property : table.getProperties()) {
+        types.push_back(property.getType().copy());
+    }
+    return types;
+}
+
+LocalRelTable::LocalRelTable(const catalog::TableCatalogEntry* tableEntry, const Table& table,
+    MemoryManager& mm)
+    : LocalTable{table} {
+    localNodeGroup = std::make_unique<NodeGroup>(mm, 0, false,
+        getTypesForLocalRelTable(*tableEntry), INVALID_ROW_IDX);
+    const auto& relTable = table.cast<RelTable>();
+    for (auto relDirection : relTable.getStorageDirections()) {
+        directedIndices.emplace_back(relDirection);
+    }
+}
+
+bool LocalRelTable::insert(Transaction*, TableInsertState& state) {
+    const auto& insertState = state.cast<RelTableInsertState>();
+
+    std::vector<row_idx_vec_t*> rowIndicesToInsertTo;
+    for (auto& directedIndex : directedIndices) {
+        const auto& nodeIDVector = insertState.getBoundNodeIDVector(directedIndex.direction);
+        KU_ASSERT(nodeIDVector.state->getSelVector().getSelSize() == 1);
+        auto nodePos = nodeIDVector.state->getSelVector()[0];
+        if (nodeIDVector.isNull(nodePos)) {
+            return false;
+        }
+        auto nodeOffset = nodeIDVector.readNodeOffset(nodePos);
+        rowIndicesToInsertTo.push_back(&directedIndex.index[nodeOffset]);
+    }
+
+    const auto numRowsInLocalTable = localNodeGroup->getNumRows();
+    const auto relOffset = StorageConstants::MAX_NUM_ROWS_IN_TABLE + numRowsInLocalTable;
+    const auto relIDVector = insertState.propertyVectors[0];
+    KU_ASSERT(relIDVector->dataType.getPhysicalType() == PhysicalTypeID::INTERNAL_ID);
+    const auto relIDPos = relIDVector->state->getSelVector()[0];
+    relIDVector->setValue<internalID_t>(relIDPos, internalID_t{relOffset, table.getTableID()});
+    relIDVector->setNull(relIDPos, false);
+    std::vector<ValueVector*> insertVectors;
+    insertVectors.push_back(&insertState.srcNodeIDVector);
+    insertVectors.push_back(&insertState.dstNodeIDVector);
+    for (auto i = 0u; i < insertState.propertyVectors.size(); i++) {
+        insertVectors.push_back(insertState.propertyVectors[i]);
+    }
+    const auto numRowsToAppend = insertState.srcNodeIDVector.state->getSelVector().getSelSize();
+    localNodeGroup->append(&DUMMY_TRANSACTION, insertVectors, 0, numRowsToAppend);
+
+    for (auto* rowIndexToInsertTo : rowIndicesToInsertTo) {
+        rowIndexToInsertTo->push_back(numRowsInLocalTable);
+    }
+
+    return true;
+}
+
+bool LocalRelTable::update(Transaction* transaction, TableUpdateState& state) {
+    KU_ASSERT(transaction->isDummy());
+    const auto& updateState = state.cast<RelTableUpdateState>();
+
+    std::vector<row_idx_vec_t*> rowIndicesToUpdate;
+    for (auto& directedIndex : directedIndices) {
+        const auto& nodeIDVector = updateState.getBoundNodeIDVector(directedIndex.direction);
+        KU_ASSERT(nodeIDVector.state->getSelVector().getSelSize() == 1);
+        auto nodePos = nodeIDVector.state->getSelVector()[0];
+        if (nodeIDVector.isNull(nodePos)) {
+            return false;
+        }
+        auto nodeOffset = nodeIDVector.readNodeOffset(nodePos);
+        rowIndicesToUpdate.push_back(&directedIndex.index[nodeOffset]);
+    }
+
+    const auto relIDPos = updateState.relIDVector.state->getSelVector()[0];
+    if (updateState.relIDVector.isNull(relIDPos)) {
+        return false;
+    }
+    const auto relOffset = updateState.relIDVector.readNodeOffset(relIDPos);
+    const auto matchedRow = findMatchingRow(transaction, rowIndicesToUpdate, relOffset);
+    if (matchedRow == INVALID_ROW_IDX) {
+        return false;
+    }
+    KU_ASSERT(updateState.columnID != NBR_ID_COLUMN_ID);
+    localNodeGroup->update(transaction, matchedRow,
+        rewriteLocalColumnID(RelDataDirection::FWD /* This is a dummy direction */,
+            updateState.columnID),
+        updateState.propertyVector);
+    return true;
+}
+
+bool LocalRelTable::delete_(Transaction* transaction, TableDeleteState& state) {
+    const auto& deleteState = state.cast<RelTableDeleteState>();
+
+    std::vector<row_idx_vec_t*> rowIndicesToDeleteFrom;
+    auto& directedIndex =
+        directedIndices[RelDirectionUtils::relDirectionToKeyIdx(deleteState.detachDeleteDirection)];
+    auto& reverseDirectedIndex = directedIndices[RelDirectionUtils::relDirectionToKeyIdx(
+        RelDirectionUtils::getOppositeDirection(deleteState.detachDeleteDirection))];
+    std::vector<std::pair<DirectedCSRIndex&, ValueVector&>> directedIndicesAndNodeIDVectors;
+    auto directedIndexPos =
+        RelDirectionUtils::relDirectionToKeyIdx(deleteState.detachDeleteDirection);
+    if (directedIndexPos < directedIndices.size()) {
+        directedIndicesAndNodeIDVectors.emplace_back(directedIndex, deleteState.srcNodeIDVector);
+    }
+    auto reverseDirectedIndexPos = RelDirectionUtils::relDirectionToKeyIdx(
+        RelDirectionUtils::getOppositeDirection(deleteState.detachDeleteDirection));
+    if (reverseDirectedIndexPos < directedIndices.size()) {
+        directedIndicesAndNodeIDVectors.emplace_back(reverseDirectedIndex,
+            deleteState.dstNodeIDVector);
+    }
+    for (auto& [csrIndex, nodeIDVector] : directedIndicesAndNodeIDVectors) {
+        KU_ASSERT(nodeIDVector.state->getSelVector().getSelSize() == 1);
+        auto nodePos = nodeIDVector.state->getSelVector()[0];
+        if (nodeIDVector.isNull(nodePos)) {
+            return false;
+        }
+        auto nodeOffset = nodeIDVector.readNodeOffset(nodePos);
+        KU_ASSERT(csrIndex.index.contains(nodeOffset));
+        rowIndicesToDeleteFrom.push_back(&csrIndex.index[nodeOffset]);
+    }
+
+    const auto relIDPos = deleteState.relIDVector.state->getSelVector()[0];
+    if (deleteState.relIDVector.isNull(relIDPos)) {
+        return false;
+    }
+    const auto relOffset = deleteState.relIDVector.readNodeOffset(relIDPos);
+    const auto matchedRow = findMatchingRow(transaction, rowIndicesToDeleteFrom, relOffset);
+    if (matchedRow == INVALID_ROW_IDX) {
+        return false;
+    }
+
+    for (auto* rowIndexToDeleteFrom : rowIndicesToDeleteFrom) {
+        std::erase(*rowIndexToDeleteFrom, matchedRow);
+    }
+    return true;
+}
+
+bool LocalRelTable::addColumn(TableAddColumnState& addColumnState) {
+    localNodeGroup->addColumn(addColumnState, nullptr /* FileHandle */,
+        nullptr /* newColumnStats */);
+    return true;
+}
+
+bool LocalRelTable::checkIfNodeHasRels(ValueVector* srcNodeIDVector,
+    RelDataDirection direction) const {
+    KU_ASSERT(srcNodeIDVector->state->isFlat());
+    const auto nodeIDPos = srcNodeIDVector->state->getSelVector()[0];
+    const auto nodeOffset = srcNodeIDVector->getValue<nodeID_t>(nodeIDPos).offset;
+    const auto& directedIndex =
+        directedIndices[RelDirectionUtils::relDirectionToKeyIdx(direction)].index;
+    return (directedIndex.contains(nodeOffset) && !directedIndex.at(nodeOffset).empty());
+}
+
+void LocalRelTable::initializeScan(TableScanState& state) {
+    auto& relScanState = state.cast<RelTableScanState>();
+    KU_ASSERT(relScanState.source == TableScanSource::UNCOMMITTED);
+    KU_ASSERT(relScanState.localTableScanState);
+    auto& localScanState = *relScanState.localTableScanState;
+    localScanState.rowIndices.clear();
+    localScanState.nextRowToScan = 0;
+}
+
+std::vector<column_id_t> LocalRelTable::rewriteLocalColumnIDs(RelDataDirection direction,
+    const std::vector<column_id_t>& columnIDs) {
+    std::vector<column_id_t> localColumnIDs;
+    localColumnIDs.reserve(columnIDs.size());
+    for (auto i = 0u; i < columnIDs.size(); i++) {
+        const auto columnID = columnIDs[i];
+        localColumnIDs.push_back(rewriteLocalColumnID(direction, columnID));
+    }
+    return localColumnIDs;
+}
+
+column_id_t LocalRelTable::rewriteLocalColumnID(RelDataDirection direction, column_id_t columnID) {
+    return columnID == NBR_ID_COLUMN_ID ? direction == RelDataDirection::FWD ?
+                                          LOCAL_NBR_NODE_ID_COLUMN_ID :
+                                          LOCAL_BOUND_NODE_ID_COLUMN_ID :
+                                          columnID + 1;
+}
+
+bool LocalRelTable::scan(const Transaction* transaction, TableScanState& state) const {
+    auto& relScanState = state.cast<RelTableScanState>();
+    KU_ASSERT(relScanState.localTableScanState);
+    auto& localScanState = *relScanState.localTableScanState;
+    while (true) {
+        if (relScanState.currBoundNodeIdx >= relScanState.cachedBoundNodeSelVector.getSelSize()) {
+            return false;
+        }
+        const auto boundNodePos =
+            relScanState.cachedBoundNodeSelVector[relScanState.currBoundNodeIdx];
+        const auto boundNodeOffset = relScanState.nodeIDVector->readNodeOffset(boundNodePos);
+        auto& localCSRIndex =
+            directedIndices[RelDirectionUtils::relDirectionToKeyIdx(relScanState.direction)].index;
+        if (localScanState.rowIndices.empty() && localCSRIndex.contains(boundNodeOffset)) {
+            localScanState.rowIndices = localCSRIndex.at(boundNodeOffset);
+            localScanState.nextRowToScan = 0;
+            KU_ASSERT(
+                std::is_sorted(localScanState.rowIndices.begin(), localScanState.rowIndices.end()));
+        }
+        KU_ASSERT(localScanState.rowIndices.size() >= localScanState.nextRowToScan);
+        const auto numToScan =
+            std::min(localScanState.rowIndices.size() - localScanState.nextRowToScan,
+                DEFAULT_VECTOR_CAPACITY);
+        if (numToScan == 0) {
+            relScanState.currBoundNodeIdx++;
+            localScanState.nextRowToScan = 0;
+            localScanState.rowIndices.clear();
+            continue;
+        }
+        for (auto i = 0u; i < numToScan; i++) {
+            localScanState.rowIdxVector->setValue<row_idx_t>(i,
+                localScanState.rowIndices[localScanState.nextRowToScan + i]);
+        }
+        localScanState.rowIdxVector->state->getSelVectorUnsafe().setSelSize(numToScan);
+        [[maybe_unused]] auto lookupRes =
+            localNodeGroup->lookupMultiple(transaction, localScanState);
+        localScanState.nextRowToScan += numToScan;
+        relScanState.setNodeIDVectorToFlat(
+            relScanState.cachedBoundNodeSelVector[relScanState.currBoundNodeIdx]);
+        return true;
+    }
+}
+
+static std::unique_ptr<RelTableScanState> setupLocalTableScanState(DataChunk& scanChunk,
+    std::span<row_idx_t> intersectRows) {
+    const std::vector columnIDs{LOCAL_REL_ID_COLUMN_ID};
+    auto scanState = std::make_unique<RelTableScanState>(nullptr,
+        std::vector{&scanChunk.getValueVectorMutable(0)}, scanChunk.state);
+    scanState->columnIDs = columnIDs;
+    scanState->nodeGroupScanState->chunkStates.resize(columnIDs.size());
+    scanChunk.state->getSelVectorUnsafe().setSelSize(intersectRows.size());
+    for (uint64_t i = 0; i < intersectRows.size(); i++) {
+        scanState->rowIdxVector->setValue<row_idx_t>(i, intersectRows[i]);
+    }
+    return scanState;
+}
+
+row_idx_t LocalRelTable::findMatchingRow(const Transaction* transaction,
+    const std::vector<row_idx_vec_t*>& rowIndicesToCheck, offset_t relOffset) const {
+    for (auto* rowIndex : rowIndicesToCheck) {
+        std::sort(rowIndex->begin(), rowIndex->end());
+    }
+    std::vector<row_idx_t> intersectRows =
+        std::accumulate(rowIndicesToCheck.begin(), rowIndicesToCheck.end(), *rowIndicesToCheck[0],
+            [](row_idx_vec_t curIntersection, row_idx_vec_t* rowIndex) -> row_idx_vec_t {
+                row_idx_vec_t ret;
+                std::set_intersection(curIntersection.begin(), curIntersection.end(),
+                    rowIndex->begin(), rowIndex->end(), std::back_inserter(ret));
+                return ret;
+            });
+    // Loop over relID column chunks to find the relID.
+    const auto numVectorsToScan =
+        ceilDiv(static_cast<uint64_t>(intersectRows.size()), DEFAULT_VECTOR_CAPACITY);
+    for (uint64_t vectorIdx = 0; vectorIdx < numVectorsToScan; ++vectorIdx) {
+        DataChunk scanChunk(1);
+        scanChunk.insert(0, std::make_shared<ValueVector>(LogicalType::INTERNAL_ID()));
+
+        const uint64_t startRowToScan = vectorIdx * DEFAULT_VECTOR_CAPACITY;
+        const auto endRowToScan = std::min(startRowToScan + DEFAULT_VECTOR_CAPACITY,
+            static_cast<uint64_t>(intersectRows.size()));
+        std::span currentRowsToCheck{intersectRows.begin() + startRowToScan,
+            intersectRows.begin() + endRowToScan};
+        const auto scanState = setupLocalTableScanState(scanChunk, currentRowsToCheck);
+
+        [[maybe_unused]] auto lookupRes = localNodeGroup->lookupMultiple(transaction, *scanState);
+        const auto scannedRelIDVector = scanState->outputVectors[0];
+        KU_ASSERT(
+            scannedRelIDVector->state->getSelVector().getSelSize() == currentRowsToCheck.size());
+        for (auto i = 0u; i < currentRowsToCheck.size(); i++) {
+            if (scannedRelIDVector->getValue<internalID_t>(i).offset == relOffset) {
+                return currentRowsToCheck[i];
+            }
+        }
+    }
+    return INVALID_ROW_IDX;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/local_storage.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/local_storage.cpp
new file mode 100644
index 0000000000..e808192117
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/local_storage/local_storage.cpp
@@ -0,0 +1,95 @@
+#include "storage/local_storage/local_storage.h"
+
+#include "storage/local_storage/local_node_table.h"
+#include "storage/local_storage/local_rel_table.h"
+#include "storage/local_storage/local_table.h"
+#include "storage/storage_manager.h"
+#include "storage/table/rel_table.h"
+#include "storage/table/table.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+LocalTable* LocalStorage::getOrCreateLocalTable(Table& table) {
+    const auto tableID = table.getTableID();
+    auto catalog = catalog::Catalog::Get(clientContext);
+    auto transaction = transaction::Transaction::Get(clientContext);
+    auto& mm = *MemoryManager::Get(clientContext);
+    if (!tables.contains(tableID)) {
+        switch (table.getTableType()) {
+        case TableType::NODE: {
+            auto tableEntry = catalog->getTableCatalogEntry(transaction, table.getTableID());
+            tables[tableID] = std::make_unique<LocalNodeTable>(tableEntry, table, mm);
+        } break;
+        case TableType::REL: {
+            // We have to fetch the rel group entry from the catalog to based on the relGroupID.
+            auto tableEntry =
+                catalog->getTableCatalogEntry(transaction, table.cast<RelTable>().getRelGroupID());
+            tables[tableID] = std::make_unique<LocalRelTable>(tableEntry, table, mm);
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    return tables.at(tableID).get();
+}
+
+LocalTable* LocalStorage::getLocalTable(table_id_t tableID) const {
+    if (tables.contains(tableID)) {
+        return tables.at(tableID).get();
+    }
+    return nullptr;
+}
+
+PageAllocator* LocalStorage::addOptimisticAllocator() {
+    auto* dataFH = StorageManager::Get(clientContext)->getDataFH();
+    if (dataFH->isInMemoryMode()) {
+        return dataFH->getPageManager();
+    }
+    UniqLock lck{mtx};
+    optimisticAllocators.emplace_back(
+        std::make_unique<OptimisticAllocator>(*dataFH->getPageManager()));
+    return optimisticAllocators.back().get();
+}
+
+void LocalStorage::commit() {
+    auto catalog = catalog::Catalog::Get(clientContext);
+    auto transaction = transaction::Transaction::Get(clientContext);
+    auto storageManager = StorageManager::Get(clientContext);
+    for (auto& [tableID, localTable] : tables) {
+        if (localTable->getTableType() == TableType::NODE) {
+            const auto tableEntry = catalog->getTableCatalogEntry(transaction, tableID);
+            const auto table = storageManager->getTable(tableID);
+            table->commit(&clientContext, tableEntry, localTable.get());
+        }
+    }
+    for (auto& [tableID, localTable] : tables) {
+        if (localTable->getTableType() == TableType::REL) {
+            const auto table = storageManager->getTable(tableID);
+            const auto tableEntry =
+                catalog->getTableCatalogEntry(transaction, table->cast<RelTable>().getRelGroupID());
+            table->commit(&clientContext, tableEntry, localTable.get());
+        }
+    }
+    for (auto& optimisticAllocator : optimisticAllocators) {
+        optimisticAllocator->commit();
+    }
+}
+
+void LocalStorage::rollback() {
+    auto mm = MemoryManager::Get(clientContext);
+    for (auto& [_, localTable] : tables) {
+        localTable->clear(*mm);
+    }
+    for (auto& optimisticAllocator : optimisticAllocators) {
+        optimisticAllocator->rollback();
+    }
+    auto* bufferManager = mm->getBufferManager();
+    PageManager::Get(clientContext)->clearEvictedBMEntriesIfNeeded(bufferManager);
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/optimistic_allocator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/optimistic_allocator.cpp
new file mode 100644
index 0000000000..0060d8fb5a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/optimistic_allocator.cpp
@@ -0,0 +1,31 @@
+#include "storage/optimistic_allocator.h"
+
+#include "storage/page_manager.h"
+
+namespace lbug::storage {
+OptimisticAllocator::OptimisticAllocator(PageManager& pageManager)
+    : PageAllocator(pageManager.getDataFH()), pageManager(pageManager) {}
+
+PageRange OptimisticAllocator::allocatePageRange(common::page_idx_t numPages) {
+    auto pageRange = pageManager.allocatePageRange(numPages);
+    if (numPages > 0) {
+        optimisticallyAllocatedPages.push_back(pageRange);
+    }
+    return pageRange;
+}
+
+void OptimisticAllocator::freePageRange(PageRange block) {
+    pageManager.freePageRange(block);
+}
+
+void OptimisticAllocator::rollback() {
+    for (const auto& entry : optimisticallyAllocatedPages) {
+        pageManager.freeImmediatelyRewritablePageRange(pageManager.getDataFH(), entry);
+    }
+    optimisticallyAllocatedPages.clear();
+}
+
+void OptimisticAllocator::commit() {
+    optimisticallyAllocatedPages.clear();
+}
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/overflow_file.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/overflow_file.cpp
new file mode 100644
index 0000000000..a9ac2d51ab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/overflow_file.cpp
@@ -0,0 +1,282 @@
+#include "storage/overflow_file.h"
+
+#include <memory>
+
+#include "common/type_utils.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/file_handle.h"
+#include "storage/shadow_utils.h"
+#include "storage/storage_utils.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::transaction;
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+std::string OverflowFileHandle::readString(TransactionType trxType, const ku_string_t& str) const {
+    if (ku_string_t::isShortString(str.len)) {
+        return str.getAsShortString();
+    }
+    PageCursor cursor;
+    TypeUtils::decodeOverflowPtr(str.overflowPtr, cursor.pageIdx, cursor.elemPosInPage);
+    std::string retVal;
+    retVal.reserve(str.len);
+    int32_t remainingLength = str.len;
+    while (remainingLength > 0) {
+        auto numBytesToReadInPage =
+            std::min(static_cast<uint32_t>(remainingLength), END_OF_PAGE - cursor.elemPosInPage);
+        auto startPosInSrc = retVal.size();
+        read(trxType, cursor.pageIdx, [&](uint8_t* frame) {
+            // Replace rather than append, since optimistic read may call the function multiple
+            // times
+            retVal.replace(startPosInSrc, numBytesToReadInPage,
+                std::string_view(reinterpret_cast<const char*>(frame) + cursor.elemPosInPage,
+                    numBytesToReadInPage));
+            cursor.pageIdx = *reinterpret_cast<page_idx_t*>(frame + END_OF_PAGE);
+        });
+        remainingLength -= numBytesToReadInPage;
+        // After the first page we always start reading from the beginning of the page.
+        cursor.elemPosInPage = 0;
+    }
+    return retVal;
+}
+
+bool OverflowFileHandle::equals(TransactionType trxType, std::string_view keyToLookup,
+    const ku_string_t& keyInEntry) const {
+    PageCursor cursor;
+    TypeUtils::decodeOverflowPtr(keyInEntry.overflowPtr, cursor.pageIdx, cursor.elemPosInPage);
+    auto lengthRead = 0u;
+    while (lengthRead < keyInEntry.len) {
+        auto numBytesToCheckInPage = std::min(static_cast<page_idx_t>(keyInEntry.len) - lengthRead,
+            END_OF_PAGE - cursor.elemPosInPage);
+        bool equal = true;
+        read(trxType, cursor.pageIdx, [&](auto* frame) {
+            equal = memcmp(keyToLookup.data() + lengthRead, frame + cursor.elemPosInPage,
+                        numBytesToCheckInPage) == 0;
+            // Update the next page index
+            cursor.pageIdx = *reinterpret_cast<page_idx_t*>(frame + END_OF_PAGE);
+        });
+        if (!equal) {
+            return false;
+        }
+        cursor.elemPosInPage = 0;
+        lengthRead += numBytesToCheckInPage;
+    }
+    return true;
+}
+
+uint8_t* OverflowFileHandle::addANewPage(PageAllocator* pageAllocator) {
+    page_idx_t newPageIdx = overflowFile.getNewPageIdx(pageAllocator);
+    if (pageWriteCache.size() > 0) {
+        memcpy(pageWriteCache[nextPosToWriteTo.pageIdx].buffer->getData() + END_OF_PAGE,
+            &newPageIdx, sizeof(page_idx_t));
+    }
+    if (startPageIdx == INVALID_PAGE_IDX) {
+        startPageIdx = newPageIdx;
+    }
+    pageWriteCache.emplace(newPageIdx,
+        CachedPage{.buffer = overflowFile.memoryManager.allocateBuffer(true /*initializeToZero*/,
+                       LBUG_PAGE_SIZE),
+            .newPage = true});
+    nextPosToWriteTo.elemPosInPage = 0;
+    nextPosToWriteTo.pageIdx = newPageIdx;
+    return pageWriteCache[newPageIdx].buffer->getData();
+}
+
+void OverflowFileHandle::setStringOverflow(PageAllocator* pageAllocator, const char* srcRawString,
+    uint64_t len, ku_string_t& diskDstString) {
+    if (len <= ku_string_t::SHORT_STR_LENGTH) {
+        return;
+    }
+    overflowFile.headerChanged = true;
+    uint8_t* pageToWrite = nullptr;
+    if (nextPosToWriteTo.pageIdx == INVALID_PAGE_IDX) {
+        pageToWrite = addANewPage(pageAllocator);
+    } else {
+        auto cached = pageWriteCache.find(nextPosToWriteTo.pageIdx);
+        if (cached != pageWriteCache.end()) {
+            pageToWrite = cached->second.buffer->getData();
+        } else {
+            overflowFile.readFromDisk(TransactionType::CHECKPOINT, nextPosToWriteTo.pageIdx,
+                [&](auto* frame) {
+                    auto page = overflowFile.memoryManager.allocateBuffer(
+                        false /*initializeToZero*/, LBUG_PAGE_SIZE);
+                    memcpy(page->getData(), frame, LBUG_PAGE_SIZE);
+                    pageToWrite = page->getData();
+                    pageWriteCache.emplace(nextPosToWriteTo.pageIdx,
+                        CachedPage{.buffer = std::move(page), .newPage = false});
+                });
+        }
+    }
+    int32_t remainingLength = len;
+    TypeUtils::encodeOverflowPtr(diskDstString.overflowPtr, nextPosToWriteTo.pageIdx,
+        nextPosToWriteTo.elemPosInPage);
+    while (remainingLength > 0) {
+        auto bytesWritten = len - remainingLength;
+        auto numBytesToWriteInPage = std::min(static_cast<uint32_t>(remainingLength),
+            END_OF_PAGE - nextPosToWriteTo.elemPosInPage);
+        memcpy(pageToWrite + nextPosToWriteTo.elemPosInPage, srcRawString + bytesWritten,
+            numBytesToWriteInPage);
+        remainingLength -= numBytesToWriteInPage;
+        nextPosToWriteTo.elemPosInPage += numBytesToWriteInPage;
+        if (nextPosToWriteTo.elemPosInPage >= END_OF_PAGE) {
+            pageToWrite = addANewPage(pageAllocator);
+        }
+    }
+}
+
+ku_string_t OverflowFileHandle::writeString(PageAllocator* pageAllocator,
+    std::string_view rawString) {
+    ku_string_t result;
+    result.len = rawString.length();
+    auto shortStrLen = ku_string_t::SHORT_STR_LENGTH;
+    auto inlineLen = std::min(shortStrLen, static_cast<uint64_t>(result.len));
+    memcpy(result.prefix, rawString.data(), inlineLen);
+    setStringOverflow(pageAllocator, rawString.data(), rawString.length(), result);
+    return result;
+}
+
+void OverflowFileHandle::checkpoint() {
+    for (auto& [pageIndex, page] : pageWriteCache) {
+        overflowFile.writePageToDisk(pageIndex, page.buffer->getData(), page.newPage);
+    }
+}
+
+void OverflowFileHandle::reclaimStorage(PageAllocator& pageAllocator) {
+    if (startPageIdx == INVALID_PAGE_IDX) {
+        return;
+    }
+
+    auto pageIdx = startPageIdx;
+    while (true) {
+        if (pageIdx == 0 || pageIdx == INVALID_PAGE_IDX) [[unlikely]] {
+            throw RuntimeException(
+                "The overflow file has been corrupted, this should never happen.");
+        }
+        pageAllocator.freePage(pageIdx);
+
+        if (pageIdx == nextPosToWriteTo.pageIdx) {
+            break;
+        }
+
+        // reclaimStorage() is only called after the hash index is checkpointed
+        // so the page write cache should always be cleared
+        KU_ASSERT(!pageWriteCache.contains(pageIdx));
+        overflowFile.readFromDisk(TransactionType::CHECKPOINT, pageIdx, [&pageIdx](auto* frame) {
+            pageIdx = *reinterpret_cast<page_idx_t*>(frame + END_OF_PAGE);
+        });
+    }
+}
+
+void OverflowFileHandle::read(TransactionType trxType, page_idx_t pageIdx,
+    const std::function<void(uint8_t*)>& func) const {
+    auto cachedPage = pageWriteCache.find(pageIdx);
+    if (cachedPage != pageWriteCache.end()) {
+        return func(cachedPage->second.buffer->getData());
+    }
+    overflowFile.readFromDisk(trxType, pageIdx, func);
+}
+
+OverflowFile::OverflowFile(FileHandle* fileHandle, MemoryManager& memoryManager,
+    ShadowFile* shadowFile, page_idx_t headerPageIdx)
+    : fileHandle{fileHandle}, shadowFile{shadowFile}, memoryManager{memoryManager},
+      headerChanged{false}, headerPageIdx{headerPageIdx} {
+    KU_ASSERT(shadowFile);
+    if (headerPageIdx != INVALID_PAGE_IDX) {
+        readFromDisk(TransactionType::READ_ONLY, headerPageIdx,
+            [&](auto* frame) { memcpy(&header, frame, sizeof(header)); });
+    } else {
+        header = StringOverflowFileHeader();
+    }
+}
+
+OverflowFile::OverflowFile(MemoryManager& memoryManager)
+    : fileHandle{nullptr}, shadowFile{nullptr}, memoryManager{memoryManager}, headerChanged{false},
+      headerPageIdx{INVALID_PAGE_IDX} {
+    // Reserve a page for the header
+    this->headerPageIdx = getNewPageIdx(nullptr);
+    header = StringOverflowFileHeader();
+}
+
+common::page_idx_t OverflowFile::getNewPageIdx(PageAllocator* pageAllocator) {
+    // If this isn't the first call reserving the page header, then the header flag must be set
+    // prior to this
+    if (pageAllocator) {
+        return pageAllocator->allocatePage();
+    } else {
+        return pageCounter.fetch_add(1);
+    }
+}
+
+void OverflowFile::readFromDisk(TransactionType trxType, page_idx_t pageIdx,
+    const std::function<void(uint8_t*)>& func) const {
+    KU_ASSERT(shadowFile);
+    auto [fileHandleToPin, pageIdxToPin] = ShadowUtils::getFileHandleAndPhysicalPageIdxToPin(
+        *fileHandle, pageIdx, *shadowFile, trxType);
+    fileHandleToPin->optimisticReadPage(pageIdxToPin, func);
+}
+
+void OverflowFile::writePageToDisk(page_idx_t pageIdx, uint8_t* data, bool newPage) const {
+    if (newPage) {
+        KU_ASSERT(fileHandle);
+        KU_ASSERT(!fileHandle->isInMemoryMode());
+        fileHandle->writePageToFile(data, pageIdx);
+    } else {
+        KU_ASSERT(shadowFile);
+        ShadowUtils::updatePage(*fileHandle, pageIdx, true /* overwriting entire page*/,
+            *shadowFile, [&](auto* frame) { memcpy(frame, data, LBUG_PAGE_SIZE); });
+    }
+}
+
+void OverflowFile::checkpoint(PageAllocator& pageAllocator) {
+    KU_ASSERT(fileHandle);
+    if (headerPageIdx == INVALID_PAGE_IDX) {
+        // Reserve a page for the header
+        this->headerPageIdx = getNewPageIdx(&pageAllocator);
+        headerChanged = true;
+    }
+    // TODO(bmwinger): Ideally this could be done separately and in parallel by each HashIndex
+    // However fileHandle->addNewPages needs to be called beforehand,
+    // but after each HashIndex::prepareCommit has written to the in-memory pages
+    for (auto& handle : handles) {
+        handle->checkpoint();
+    }
+    if (headerChanged) {
+        uint8_t page[LBUG_PAGE_SIZE];
+        memcpy(page, &header, sizeof(header));
+        // Zero free space at the end of the header page
+        std::fill(page + sizeof(header), page + LBUG_PAGE_SIZE, 0);
+        writePageToDisk(headerPageIdx + HEADER_PAGE_IDX, page, false /*newPage*/);
+    }
+}
+
+void OverflowFile::checkpointInMemory() {
+    headerChanged = false;
+}
+
+void OverflowFile::rollbackInMemory() {
+    KU_ASSERT(getFileHandle()->getNumPages() <= INVALID_PAGE_IDX);
+    if (getFileHandle()->getNumPages() > headerPageIdx) {
+        readFromDisk(TransactionType::READ_ONLY, headerPageIdx,
+            [&](auto* frame) { memcpy(&header, frame, sizeof(header)); });
+    }
+    for (auto i = 0u; i < handles.size(); i++) {
+        auto& handle = handles[i];
+        handle->rollbackInMemory(header.entries[i].cursor);
+    }
+}
+
+void OverflowFile::reclaimStorage(PageAllocator& pageAllocator) const {
+    for (auto& handle : handles) {
+        handle->reclaimStorage(pageAllocator);
+    }
+    if (headerPageIdx != INVALID_PAGE_IDX) {
+        pageAllocator.freePage(headerPageIdx);
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/page_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/page_manager.cpp
new file mode 100644
index 0000000000..89f764a629
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/page_manager.cpp
@@ -0,0 +1,66 @@
+#include "storage/page_manager.h"
+
+#include "common/uniq_lock.h"
+#include "storage/file_handle.h"
+#include "storage/storage_manager.h"
+
+namespace lbug::storage {
+static constexpr bool ENABLE_FSM = true;
+
+PageRange PageManager::allocatePageRange(common::page_idx_t numPages) {
+    if constexpr (ENABLE_FSM) {
+        common::UniqLock lck{mtx};
+        auto allocatedFreeChunk = freeSpaceManager->popFreePages(numPages);
+        if (allocatedFreeChunk.has_value()) {
+            ++version;
+            return {*allocatedFreeChunk};
+        }
+    }
+    auto startPageIdx = fileHandle->addNewPages(numPages);
+    KU_ASSERT(fileHandle->getNumPages() >= startPageIdx + numPages);
+    return PageRange(startPageIdx, numPages);
+}
+
+void PageManager::freePageRange(PageRange entry) {
+    if constexpr (ENABLE_FSM) {
+        common::UniqLock lck{mtx};
+        // Freed pages cannot be immediately reused to ensure checkpoint recovery works
+        // Instead they are reusable after the end of the next checkpoint
+        freeSpaceManager->addUncheckpointedFreePages(entry);
+        ++version;
+    }
+}
+
+common::page_idx_t PageManager::estimatePagesNeededForSerialize() {
+    return freeSpaceManager->getMaxNumPagesForSerialization();
+}
+
+void PageManager::freeImmediatelyRewritablePageRange(FileHandle* fileHandle, PageRange entry) {
+    if constexpr (ENABLE_FSM) {
+        common::UniqLock lck{mtx};
+        freeSpaceManager->evictAndAddFreePages(fileHandle, entry);
+        ++version;
+    }
+}
+
+void PageManager::serialize(common::Serializer& serializer) {
+    freeSpaceManager->serialize(serializer);
+}
+
+void PageManager::deserialize(common::Deserializer& deSer) {
+    freeSpaceManager->deserialize(deSer);
+}
+
+void PageManager::finalizeCheckpoint() {
+    freeSpaceManager->finalizeCheckpoint(fileHandle);
+}
+
+void PageManager::clearEvictedBMEntriesIfNeeded(BufferManager* bufferManager) {
+    freeSpaceManager->clearEvictedBufferManagerEntriesIfNeeded(bufferManager);
+}
+
+PageManager* PageManager::Get(const main::ClientContext& context) {
+    return StorageManager::Get(context)->getDataFH()->getPageManager();
+}
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/CMakeLists.txt
new file mode 100644
index 0000000000..a23fedfd36
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_storage_predicate
+        OBJECT
+        null_predicate.cpp
+        column_predicate.cpp
+        constant_predicate.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_storage_predicate>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/column_predicate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/column_predicate.cpp
new file mode 100644
index 0000000000..212b91e9cd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/column_predicate.cpp
@@ -0,0 +1,123 @@
+#include "storage/predicate/column_predicate.h"
+
+#include "binder/expression/literal_expression.h"
+#include "binder/expression/scalar_function_expression.h"
+#include "storage/predicate/constant_predicate.h"
+#include "storage/predicate/null_predicate.h"
+
+using namespace lbug::binder;
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+ZoneMapCheckResult ColumnPredicateSet::checkZoneMap(const MergedColumnChunkStats& stats) const {
+    for (auto& predicate : predicates) {
+        if (predicate->checkZoneMap(stats) == ZoneMapCheckResult::SKIP_SCAN) {
+            return ZoneMapCheckResult::SKIP_SCAN;
+        }
+    }
+    return ZoneMapCheckResult::ALWAYS_SCAN;
+}
+
+std::string ColumnPredicateSet::toString() const {
+    if (predicates.empty()) {
+        return {};
+    }
+    auto result = predicates[0]->toString();
+    for (auto i = 1u; i < predicates.size(); ++i) {
+        result += stringFormat(" AND {}", predicates[i]->toString());
+    }
+    return result;
+}
+
+static bool isColumnRef(ExpressionType type) {
+    return type == ExpressionType::PROPERTY || type == ExpressionType::VARIABLE;
+}
+
+static bool isCastedColumnRef(const Expression& expr) {
+    if (expr.expressionType == ExpressionType::FUNCTION) {
+        const auto& funcExpr = expr.constCast<ScalarFunctionExpression>();
+        if (funcExpr.getFunction().name.starts_with("CAST")) {
+            KU_ASSERT(funcExpr.getNumChildren() > 0);
+            return isColumnRef(funcExpr.getChild(0)->expressionType);
+        }
+    }
+    return false;
+}
+
+static bool isColumnOrCastedColumnRef(const Expression& expr) {
+    return isColumnRef(expr.expressionType) || isCastedColumnRef(expr);
+}
+
+static bool isColumnRefConstantPair(const Expression& left, const Expression& right) {
+    return isColumnOrCastedColumnRef(left) && right.expressionType == ExpressionType::LITERAL;
+}
+
+static bool columnMatchesExprChild(const Expression& column, const Expression& expr) {
+    return (expr.getNumChildren() > 0 && column == *expr.getChild(0));
+}
+
+static std::unique_ptr<ColumnPredicate> tryConvertToConstColumnPredicate(const Expression& column,
+    const Expression& predicate) {
+    if (isColumnRefConstantPair(*predicate.getChild(0), *predicate.getChild(1))) {
+        if (column != *predicate.getChild(0) &&
+            !columnMatchesExprChild(column, *predicate.getChild(0))) {
+            return nullptr;
+        }
+        auto value = predicate.getChild(1)->constCast<LiteralExpression>().getValue();
+        return std::make_unique<ColumnConstantPredicate>(column.toString(),
+            predicate.expressionType, value);
+    } else if (isColumnRefConstantPair(*predicate.getChild(1), *predicate.getChild(0))) {
+        if (column != *predicate.getChild(1) &&
+            !columnMatchesExprChild(column, *predicate.getChild(1))) {
+            return nullptr;
+        }
+        auto value = predicate.getChild(0)->constCast<LiteralExpression>().getValue();
+        auto expressionType =
+            ExpressionTypeUtil::reverseComparisonDirection(predicate.expressionType);
+        return std::make_unique<ColumnConstantPredicate>(column.toString(), expressionType, value);
+    }
+    // Not a predicate that runs on this property.
+    return nullptr;
+}
+
+static std::unique_ptr<ColumnPredicate> tryConvertToIsNull(const Expression& column,
+    const Expression& predicate) {
+    // we only convert simple predicates
+    if (isColumnOrCastedColumnRef(*predicate.getChild(0)) && column == *predicate.getChild(0)) {
+        return std::make_unique<ColumnNullPredicate>(column.toString(), ExpressionType::IS_NULL);
+    }
+    return nullptr;
+}
+
+static std::unique_ptr<ColumnPredicate> tryConvertToIsNotNull(const Expression& column,
+    const Expression& predicate) {
+    if (isColumnOrCastedColumnRef(*predicate.getChild(0)) && column == *predicate.getChild(0)) {
+        return std::make_unique<ColumnNullPredicate>(column.toString(),
+            ExpressionType::IS_NOT_NULL);
+    }
+    return nullptr;
+}
+
+std::unique_ptr<ColumnPredicate> ColumnPredicateUtil::tryConvert(const Expression& property,
+    const Expression& predicate) {
+    if (ExpressionTypeUtil::isComparison(predicate.expressionType)) {
+        return tryConvertToConstColumnPredicate(property, predicate);
+    }
+    switch (predicate.expressionType) {
+    case common::ExpressionType::IS_NULL:
+        return tryConvertToIsNull(property, predicate);
+    case common::ExpressionType::IS_NOT_NULL:
+        return tryConvertToIsNotNull(property, predicate);
+    default:
+        return nullptr;
+    }
+}
+
+std::string ColumnPredicate::toString() {
+    return stringFormat("{} {}", columnName, ExpressionTypeUtil::toParsableString(expressionType));
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/constant_predicate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/constant_predicate.cpp
new file mode 100644
index 0000000000..700284b8c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/constant_predicate.cpp
@@ -0,0 +1,95 @@
+#include "storage/predicate/constant_predicate.h"
+
+#include "common/type_utils.h"
+#include "function/comparison/comparison_functions.h"
+#include "storage/compression/compression.h"
+#include "storage/table/column_chunk_stats.h"
+
+using namespace lbug::common;
+using namespace lbug::function;
+
+namespace lbug {
+namespace storage {
+
+template<typename T>
+bool inRange(T min, T max, T val) {
+    auto a = GreaterThanEquals::operation<T>(val, min);
+    auto b = LessThanEquals::operation<T>(val, max);
+    return a && b;
+}
+
+template<typename T>
+ZoneMapCheckResult checkZoneMapSwitch(const MergedColumnChunkStats& mergedStats,
+    ExpressionType expressionType, const Value& value) {
+    // If the chunk is casted from a non-storage value type
+    // The stats will be empty, skip the zone map check in this case
+    if (mergedStats.stats.min.has_value() && mergedStats.stats.max.has_value()) {
+        auto max = mergedStats.stats.max->get<T>();
+        auto min = mergedStats.stats.min->get<T>();
+        auto constant = value.getValue<T>();
+        switch (expressionType) {
+        case ExpressionType::EQUALS: {
+            if (!inRange<T>(min, max, constant)) {
+                return ZoneMapCheckResult::SKIP_SCAN;
+            }
+        } break;
+        case ExpressionType::NOT_EQUALS: {
+            if (Equals::operation<T>(constant, min) && Equals::operation<T>(constant, max)) {
+                return ZoneMapCheckResult::SKIP_SCAN;
+            }
+        } break;
+        case ExpressionType::GREATER_THAN: {
+            if (GreaterThanEquals::operation<T>(constant, max)) {
+                return ZoneMapCheckResult::SKIP_SCAN;
+            }
+        } break;
+        case ExpressionType::GREATER_THAN_EQUALS: {
+            if (GreaterThan::operation<T>(constant, max)) {
+                return ZoneMapCheckResult::SKIP_SCAN;
+            }
+        } break;
+        case ExpressionType::LESS_THAN: {
+            if (LessThanEquals::operation<T>(constant, min)) {
+                return ZoneMapCheckResult::SKIP_SCAN;
+            }
+        } break;
+        case ExpressionType::LESS_THAN_EQUALS: {
+            if (LessThan::operation<T>(constant, min)) {
+                return ZoneMapCheckResult::SKIP_SCAN;
+            }
+        } break;
+        default:
+            KU_UNREACHABLE;
+        }
+    }
+    return ZoneMapCheckResult::ALWAYS_SCAN;
+}
+
+ZoneMapCheckResult ColumnConstantPredicate::checkZoneMap(
+    const MergedColumnChunkStats& stats) const {
+    auto physicalType = value.getDataType().getPhysicalType();
+    return TypeUtils::visit(
+        physicalType,
+        [&]<StorageValueType T>(T) { return checkZoneMapSwitch<T>(stats, expressionType, value); },
+        [&](auto) { return ZoneMapCheckResult::ALWAYS_SCAN; });
+}
+
+std::string ColumnConstantPredicate::toString() {
+    std::string valStr;
+    if (value.getDataType().getPhysicalType() == PhysicalTypeID::STRING ||
+        value.getDataType().getPhysicalType() == PhysicalTypeID::LIST ||
+        value.getDataType().getPhysicalType() == PhysicalTypeID::ARRAY ||
+        value.getDataType().getPhysicalType() == PhysicalTypeID::STRUCT ||
+        value.getDataType().getLogicalTypeID() == LogicalTypeID::UUID ||
+        value.getDataType().getLogicalTypeID() == LogicalTypeID::TIMESTAMP ||
+        value.getDataType().getLogicalTypeID() == LogicalTypeID::DATE ||
+        value.getDataType().getLogicalTypeID() == LogicalTypeID::INTERVAL) {
+        valStr = stringFormat("'{}'", value.toString());
+    } else {
+        valStr = value.toString();
+    }
+    return stringFormat("{} {}", ColumnPredicate::toString(), valStr);
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/null_predicate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/null_predicate.cpp
new file mode 100644
index 0000000000..dfafd18c87
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/predicate/null_predicate.cpp
@@ -0,0 +1,15 @@
+#include "storage/predicate/null_predicate.h"
+
+#include "storage/table/column_chunk_stats.h"
+
+namespace lbug::storage {
+common::ZoneMapCheckResult ColumnNullPredicate::checkZoneMap(
+    const MergedColumnChunkStats& mergedStats) const {
+    const bool statToCheck = (expressionType == common::ExpressionType::IS_NULL) ?
+                                 mergedStats.guaranteedNoNulls :
+                                 mergedStats.guaranteedAllNulls;
+    return statToCheck ? common::ZoneMapCheckResult::SKIP_SCAN :
+                         common::ZoneMapCheckResult::ALWAYS_SCAN;
+}
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/shadow_file.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/shadow_file.cpp
new file mode 100644
index 0000000000..8189581831
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/shadow_file.cpp
@@ -0,0 +1,195 @@
+#include "storage/shadow_file.h"
+
+#include "common/exception/io.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/serializer/buffered_file.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "main/client_context.h"
+#include "main/db_config.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/database_header.h"
+#include "storage/file_db_id_utils.h"
+#include "storage/file_handle.h"
+#include "storage/storage_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace storage {
+
+void ShadowPageRecord::serialize(Serializer& serializer) const {
+    serializer.write<file_idx_t>(originalFileIdx);
+    serializer.write<page_idx_t>(originalPageIdx);
+}
+
+ShadowPageRecord ShadowPageRecord::deserialize(Deserializer& deserializer) {
+    file_idx_t originalFileIdx = INVALID_FILE_IDX;
+    page_idx_t originalPageIdx = INVALID_PAGE_IDX;
+    deserializer.deserializeValue<file_idx_t>(originalFileIdx);
+    deserializer.deserializeValue<page_idx_t>(originalPageIdx);
+    return ShadowPageRecord{originalFileIdx, originalPageIdx};
+}
+
+ShadowFile::ShadowFile(BufferManager& bm, VirtualFileSystem* vfs, const std::string& databasePath)
+    : bm{bm}, shadowFilePath{StorageUtils::getShadowFilePath(databasePath)}, vfs{vfs},
+      shadowingFH{nullptr} {
+    KU_ASSERT(vfs);
+}
+
+void ShadowFile::clearShadowPage(file_idx_t originalFile, page_idx_t originalPage) {
+    if (hasShadowPage(originalFile, originalPage)) {
+        shadowPagesMap.at(originalFile).erase(originalPage);
+        if (shadowPagesMap.at(originalFile).empty()) {
+            shadowPagesMap.erase(originalFile);
+        }
+    }
+}
+
+page_idx_t ShadowFile::getOrCreateShadowPage(file_idx_t originalFile, page_idx_t originalPage) {
+    if (hasShadowPage(originalFile, originalPage)) {
+        return shadowPagesMap[originalFile][originalPage];
+    }
+    const auto shadowPageIdx = getOrCreateShadowingFH()->addNewPage();
+    shadowPagesMap[originalFile][originalPage] = shadowPageIdx;
+    shadowPageRecords.push_back({originalFile, originalPage});
+    return shadowPageIdx;
+}
+
+page_idx_t ShadowFile::getShadowPage(file_idx_t originalFile, page_idx_t originalPage) const {
+    KU_ASSERT(hasShadowPage(originalFile, originalPage));
+    return shadowPagesMap.at(originalFile).at(originalPage);
+}
+
+void ShadowFile::applyShadowPages(ClientContext& context) const {
+    const auto pageBuffer = std::make_unique<uint8_t[]>(LBUG_PAGE_SIZE);
+    page_idx_t shadowPageIdx = 1; // Skip header page.
+    auto dataFileInfo = StorageManager::Get(context)->getDataFH()->getFileInfo();
+    KU_ASSERT(shadowingFH);
+    for (const auto& record : shadowPageRecords) {
+        shadowingFH->readPageFromDisk(pageBuffer.get(), shadowPageIdx++);
+        dataFileInfo->writeFile(pageBuffer.get(), LBUG_PAGE_SIZE,
+            record.originalPageIdx * LBUG_PAGE_SIZE);
+        // NOTE: We're not taking lock here, as we assume this is only called with a single thread.
+        MemoryManager::Get(context)->getBufferManager()->updateFrameIfPageIsInFrameWithoutLock(
+            record.originalFileIdx, pageBuffer.get(), record.originalPageIdx);
+    }
+    dataFileInfo->syncFile();
+}
+
+static ku_uuid_t getOldDatabaseID(FileInfo& dataFileInfo) {
+    auto oldHeader = DatabaseHeader::readDatabaseHeader(dataFileInfo);
+    if (!oldHeader.has_value()) {
+        throw InternalException("Found a shadow file for database {} but no valid database header. "
+                                "The database is corrupted, please recreate it.");
+    }
+    return oldHeader->databaseID;
+}
+
+void ShadowFile::replayShadowPageRecords(ClientContext& context) {
+    if (context.getDBConfig()->readOnly) {
+        throw RuntimeException("Couldn't replay shadow pages under read-only mode. Please re-open "
+                               "the database with read-write mode to replay shadow pages.");
+    }
+    auto vfs = VirtualFileSystem::GetUnsafe(context);
+    auto shadowFilePath = StorageUtils::getShadowFilePath(context.getDatabasePath());
+    auto shadowFileInfo = vfs->openFile(shadowFilePath, FileOpenFlags(FileFlags::READ_ONLY));
+
+    std::unique_ptr<FileInfo> dataFileInfo;
+    try {
+        dataFileInfo = vfs->openFile(context.getDatabasePath(),
+            FileOpenFlags{FileFlags::WRITE | FileFlags::READ_ONLY, FileLockType::WRITE_LOCK});
+    } catch (IOException& e) {
+        throw RuntimeException(stringFormat(
+            "Found shadow file {} but no corresponding database file. This file "
+            "may have been left behind from a previous database with the same name. If it is safe "
+            "to do so, please delete this file and restart the database.",
+            shadowFilePath));
+    }
+
+    ShadowFileHeader header;
+    const auto headerBuffer = std::make_unique<uint8_t[]>(LBUG_PAGE_SIZE);
+    shadowFileInfo->readFromFile(headerBuffer.get(), LBUG_PAGE_SIZE, 0);
+    memcpy(&header, headerBuffer.get(), sizeof(ShadowFileHeader));
+
+    // When replaying the shadow file we haven't read the database ID from the database
+    // header yet
+    // So we need to do it separately here to verify the shadow file matches the database
+    auto oldDatabaseID = getOldDatabaseID(*dataFileInfo);
+    FileDBIDUtils::verifyDatabaseID(*shadowFileInfo, oldDatabaseID, header.databaseID);
+
+    std::vector<ShadowPageRecord> shadowPageRecords;
+    shadowPageRecords.reserve(header.numShadowPages);
+    auto reader = std::make_unique<BufferedFileReader>(*shadowFileInfo);
+    reader->resetReadOffset((header.numShadowPages + 1) * LBUG_PAGE_SIZE);
+    Deserializer deSer(std::move(reader));
+    deSer.deserializeVector(shadowPageRecords);
+
+    const auto pageBuffer = std::make_unique<uint8_t[]>(LBUG_PAGE_SIZE);
+    page_idx_t shadowPageIdx = 1;
+    for (const auto& record : shadowPageRecords) {
+        shadowFileInfo->readFromFile(pageBuffer.get(), LBUG_PAGE_SIZE,
+            shadowPageIdx * LBUG_PAGE_SIZE);
+        dataFileInfo->writeFile(pageBuffer.get(), LBUG_PAGE_SIZE,
+            record.originalPageIdx * LBUG_PAGE_SIZE);
+        shadowPageIdx++;
+    }
+}
+
+void ShadowFile::flushAll(main::ClientContext& context) const {
+    // Write header page to file.
+    ShadowFileHeader header;
+    header.numShadowPages = shadowPageRecords.size();
+    header.databaseID = StorageManager::Get(context)->getOrInitDatabaseID(context);
+    const auto headerBuffer = std::make_unique<uint8_t[]>(LBUG_PAGE_SIZE);
+    memcpy(headerBuffer.get(), &header, sizeof(ShadowFileHeader));
+    KU_ASSERT(shadowingFH && !shadowingFH->isInMemoryMode());
+    shadowingFH->writePageToFile(headerBuffer.get(), 0);
+    // Flush shadow pages to file.
+    shadowingFH->flushAllDirtyPagesInFrames();
+    // Append shadow page records to the end of the file.
+    const auto writer = std::make_shared<BufferedFileWriter>(*shadowingFH->getFileInfo());
+    writer->setFileOffset(shadowingFH->getNumPages() * LBUG_PAGE_SIZE);
+    Serializer ser(writer);
+    KU_ASSERT(shadowPageRecords.size() + 1 == shadowingFH->getNumPages());
+    ser.serializeVector(shadowPageRecords);
+    writer->flush();
+    // Sync the file to disk.
+    writer->sync();
+}
+
+void ShadowFile::clear(BufferManager& bm) {
+    KU_ASSERT(shadowingFH);
+    // TODO(Guodong): We should remove shadow file here. This requires changes:
+    // 1. We need to make shadow file not going through BM.
+    // 2. We need to remove fileHandles held in BM, so that BM only keeps FH for the data file.
+    bm.removeFilePagesFromFrames(*shadowingFH);
+    shadowingFH->resetToZeroPagesAndPageCapacity();
+    shadowPagesMap.clear();
+    shadowPageRecords.clear();
+    // Reserve header page.
+    shadowingFH->addNewPage();
+}
+
+void ShadowFile::reset() {
+    shadowingFH->resetFileInfo();
+    shadowingFH = nullptr;
+    vfs->removeFileIfExists(shadowFilePath);
+}
+
+FileHandle* ShadowFile::getOrCreateShadowingFH() {
+    if (!shadowingFH) {
+        shadowingFH = bm.getFileHandle(shadowFilePath,
+            FileHandle::O_PERSISTENT_FILE_CREATE_NOT_EXISTS, vfs, nullptr);
+        if (shadowingFH->getNumPages() == 0) {
+            // Reserve the first page for the header.
+            shadowingFH->addNewPage();
+        }
+    }
+    return shadowingFH;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/shadow_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/shadow_utils.cpp
new file mode 100644
index 0000000000..0a3d61b56d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/shadow_utils.cpp
@@ -0,0 +1,88 @@
+#include "storage/shadow_utils.h"
+
+#include "storage/file_handle.h"
+#include "storage/shadow_file.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+ShadowPageAndFrame ShadowUtils::createShadowVersionIfNecessaryAndPinPage(page_idx_t originalPage,
+    bool skipReadingOriginalPage, FileHandle& fileHandle, ShadowFile& shadowFile) {
+    KU_ASSERT(!fileHandle.isInMemoryMode());
+    const auto hasShadowPage = shadowFile.hasShadowPage(fileHandle.getFileIndex(), originalPage);
+    auto shadowPage = shadowFile.getOrCreateShadowPage(fileHandle.getFileIndex(), originalPage);
+    uint8_t* shadowFrame = nullptr;
+    try {
+        if (hasShadowPage) {
+            shadowFrame =
+                shadowFile.getShadowingFH().pinPage(shadowPage, PageReadPolicy::READ_PAGE);
+        } else {
+            shadowFrame =
+                shadowFile.getShadowingFH().pinPage(shadowPage, PageReadPolicy::DONT_READ_PAGE);
+            if (!skipReadingOriginalPage) {
+                fileHandle.optimisticReadPage(originalPage, [&](const uint8_t* frame) -> void {
+                    memcpy(shadowFrame, frame, LBUG_PAGE_SIZE);
+                });
+            }
+        }
+        // The shadow page existing already does not mean that it's already dirty
+        // It may have been flushed to disk to free memory and then read again
+        shadowFile.getShadowingFH().setLockedPageDirty(shadowPage);
+    } catch (Exception&) {
+        throw;
+    }
+    return {originalPage, shadowPage, shadowFrame};
+}
+
+std::pair<FileHandle*, page_idx_t> ShadowUtils::getFileHandleAndPhysicalPageIdxToPin(
+    FileHandle& fileHandle, page_idx_t pageIdx, const ShadowFile& shadowFile,
+    transaction::TransactionType trxType) {
+    if (trxType == transaction::TransactionType::CHECKPOINT &&
+        shadowFile.hasShadowPage(fileHandle.getFileIndex(), pageIdx)) {
+        return std::make_pair(&shadowFile.getShadowingFH(),
+            shadowFile.getShadowPage(fileHandle.getFileIndex(), pageIdx));
+    }
+    return std::make_pair(&fileHandle, pageIdx);
+}
+
+void unpinShadowPage(page_idx_t originalPageIdx, page_idx_t shadowPageIdx,
+    const ShadowFile& shadowFile) {
+    KU_ASSERT(originalPageIdx != INVALID_PAGE_IDX && shadowPageIdx != INVALID_PAGE_IDX);
+    KU_UNUSED(originalPageIdx);
+    shadowFile.getShadowingFH().unpinPage(shadowPageIdx);
+}
+
+void ShadowUtils::updatePage(FileHandle& fileHandle, page_idx_t originalPageIdx,
+    bool skipReadingOriginalPage, ShadowFile& shadowFile,
+    const std::function<void(uint8_t*)>& updateOp) {
+    KU_ASSERT(!fileHandle.isInMemoryMode());
+    const auto shadowPageIdxAndFrame = createShadowVersionIfNecessaryAndPinPage(originalPageIdx,
+        skipReadingOriginalPage, fileHandle, shadowFile);
+    try {
+        updateOp(shadowPageIdxAndFrame.frame);
+    } catch (Exception&) {
+        unpinShadowPage(shadowPageIdxAndFrame.originalPage, shadowPageIdxAndFrame.shadowPage,
+            shadowFile);
+        throw;
+    }
+    unpinShadowPage(shadowPageIdxAndFrame.originalPage, shadowPageIdxAndFrame.shadowPage,
+        shadowFile);
+}
+
+void ShadowUtils::readShadowVersionOfPage(const FileHandle& fileHandle, page_idx_t originalPageIdx,
+    const ShadowFile& shadowFile, const std::function<void(uint8_t*)>& readOp) {
+    KU_ASSERT(!fileHandle.isInMemoryMode());
+    KU_ASSERT(shadowFile.hasShadowPage(fileHandle.getFileIndex(), originalPageIdx));
+    const page_idx_t shadowPageIdx =
+        shadowFile.getShadowPage(fileHandle.getFileIndex(), originalPageIdx);
+    const auto frame =
+        shadowFile.getShadowingFH().pinPage(shadowPageIdx, PageReadPolicy::READ_PAGE);
+    readOp(frame);
+    unpinShadowPage(originalPageIdx, shadowPageIdx, shadowFile);
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/CMakeLists.txt
new file mode 100644
index 0000000000..353a920ba1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_storage_stats
+        OBJECT
+        column_stats.cpp
+        hyperloglog.cpp
+        table_stats.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_storage_stats>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/column_stats.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/column_stats.cpp
new file mode 100644
index 0000000000..ce1b4992ba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/column_stats.cpp
@@ -0,0 +1,32 @@
+#include "storage/stats/column_stats.h"
+
+#include "function/hash/vector_hash_functions.h"
+
+namespace lbug {
+namespace storage {
+
+ColumnStats::ColumnStats(const common::LogicalType& dataType) : hashes{nullptr} {
+    if (!common::LogicalTypeUtils::isNested(dataType)) {
+        hll.emplace();
+    }
+}
+
+void ColumnStats::update(const common::ValueVector* vector) {
+    if (hll) {
+        if (!hashes) {
+            hashes = std::make_unique<common::ValueVector>(common::LogicalTypeID::UINT64);
+        }
+        hashes->state = vector->state;
+        function::VectorHashFunction::computeHash(*vector, vector->state->getSelVector(), *hashes,
+            hashes->state->getSelVector());
+        KU_ASSERT(hashes->hasNoNullsGuarantee());
+        for (auto i = 0u; i < hashes->state->getSelVector().getSelSize(); i++) {
+            hll->insertElement(hashes->getValue<common::hash_t>(i));
+        }
+        hashes->state = nullptr;
+        hashes->setAllNonNull();
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/hyperloglog.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/hyperloglog.cpp
new file mode 100644
index 0000000000..5916275939
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/hyperloglog.cpp
@@ -0,0 +1,90 @@
+#include "storage/stats/hyperloglog.h"
+
+#include <math.h>
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+
+namespace lbug {
+namespace storage {
+
+common::cardinality_t HyperLogLog::count() const {
+    uint32_t c[Q + 2] = {0};
+    extractCounts(c);
+    return static_cast<common::cardinality_t>(estimateCardinality(c));
+}
+
+void HyperLogLog::merge(const HyperLogLog& other) {
+    for (auto i = 0u; i < M; ++i) {
+        update(i, other.k[i]);
+    }
+}
+
+void HyperLogLog::extractCounts(uint32_t* c) const {
+    for (auto i = 0u; i < M; ++i) {
+        c[k[i]]++;
+    }
+}
+
+//! Taken from redis code
+static double HLLSigma(double x) {
+    if (x == 1.) {
+        return std::numeric_limits<double>::infinity();
+    }
+    double z_prime = NAN;
+    double y = 1;
+    double z = x;
+    do {
+        x *= x;
+        z_prime = z;
+        z += x * y;
+        y += y;
+    } while (z_prime != z);
+    return z;
+}
+
+//! Taken from redis code
+static double HLLTau(double x) {
+    if (x == 0. || x == 1.) {
+        return 0.;
+    }
+    double z_prime = NAN;
+    double y = 1.0;
+    double z = 1 - x;
+    do {
+        x = sqrt(x);
+        z_prime = z;
+        y *= 0.5;
+        z -= pow(1 - x, 2) * y;
+    } while (z_prime != z);
+    return z / 3;
+}
+
+int64_t HyperLogLog::estimateCardinality(const uint32_t* c) {
+    auto z = M * HLLTau((static_cast<double>(M) - c[Q]) / static_cast<double>(M));
+
+    for (auto k = Q; k >= 1; --k) {
+        z += c[k];
+        z *= 0.5;
+    }
+
+    z += M * HLLSigma(c[0] / static_cast<double>(M));
+
+    return llroundl(ALPHA * M * M / z);
+}
+
+void HyperLogLog::serialize(common::Serializer& serializer) const {
+    serializer.writeDebuggingInfo("hll_data");
+    serializer.serializeArray<uint8_t, M>(k);
+}
+
+HyperLogLog HyperLogLog::deserialize(common::Deserializer& deserializer) {
+    HyperLogLog result;
+    std::string info;
+    deserializer.validateDebuggingInfo(info, "hll_data");
+    deserializer.deserializeArray<uint8_t, M>(result.k);
+    return result;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/table_stats.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/table_stats.cpp
new file mode 100644
index 0000000000..9091d39f1d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/stats/table_stats.cpp
@@ -0,0 +1,64 @@
+#include "storage/stats/table_stats.h"
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+
+namespace lbug {
+namespace storage {
+
+TableStats::TableStats(std::span<const common::LogicalType> dataTypes) : cardinality{0} {
+    for (const auto& dataType : dataTypes) {
+        columnStats.emplace_back(dataType);
+    }
+}
+
+TableStats::TableStats(const TableStats& other) : cardinality{other.cardinality} {
+    columnStats.reserve(other.columnStats.size());
+    for (auto i = 0u; i < other.columnStats.size(); ++i) {
+        columnStats.emplace_back(other.columnStats[i].copy());
+    }
+}
+
+void TableStats::update(const std::vector<common::ValueVector*>& vectors, size_t numColumns) {
+    std::vector<common::column_id_t> dummyColumnIDs;
+    for (auto i = 0u; i < vectors.size(); ++i) {
+        dummyColumnIDs.push_back(i);
+    }
+    update(dummyColumnIDs, vectors, numColumns);
+}
+
+void TableStats::update(const std::vector<common::column_id_t>& columnIDs,
+    const std::vector<common::ValueVector*>& vectors, size_t numColumns) {
+    KU_ASSERT(columnIDs.size() == vectors.size());
+    size_t numColumnsToUpdate = std::min(numColumns, vectors.size());
+
+    for (auto i = 0u; i < numColumnsToUpdate; ++i) {
+        auto columnID = columnIDs[i];
+        KU_ASSERT(columnID < columnStats.size());
+        columnStats[columnID].update(vectors[i]);
+    }
+    const auto numValues = vectors[0]->state->getSelVector().getSelSize();
+    for (auto i = 1u; i < numColumnsToUpdate; ++i) {
+        KU_ASSERT(vectors[i]->state->getSelVector().getSelSize() == numValues);
+    }
+    incrementCardinality(numValues);
+}
+
+void TableStats::serialize(common::Serializer& serializer) const {
+    serializer.writeDebuggingInfo("cardinality");
+    serializer.write(cardinality);
+    serializer.writeDebuggingInfo("column_stats");
+    serializer.serializeVector(columnStats);
+}
+
+TableStats TableStats::deserialize(common::Deserializer& deserializer) {
+    std::string info;
+    deserializer.validateDebuggingInfo(info, "cardinality");
+    deserializer.deserializeValue<common::cardinality_t>(cardinality);
+    deserializer.validateDebuggingInfo(info, "column_stats");
+    deserializer.deserializeVector(columnStats);
+    return *this;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/storage_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/storage_manager.cpp
new file mode 100644
index 0000000000..16e4c1161f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/storage_manager.cpp
@@ -0,0 +1,318 @@
+#include "storage/storage_manager.h"
+
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/random_engine.h"
+#include "common/serializer/in_mem_file_writer.h"
+#include "main/attached_database.h"
+#include "main/client_context.h"
+#include "main/database.h"
+#include "main/db_config.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/checkpointer.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+#include "storage/wal/wal_replayer.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+StorageManager::StorageManager(const std::string& databasePath, bool readOnly, bool enableChecksums,
+    MemoryManager& memoryManager, bool enableCompression, VirtualFileSystem* vfs)
+    : databasePath{databasePath}, readOnly{readOnly}, dataFH{nullptr}, memoryManager{memoryManager},
+      enableCompression{enableCompression} {
+    wal = std::make_unique<WAL>(databasePath, readOnly, enableChecksums, vfs);
+    shadowFile =
+        std::make_unique<ShadowFile>(*memoryManager.getBufferManager(), vfs, this->databasePath);
+    inMemory = main::DBConfig::isDBPathInMemory(databasePath);
+    registerIndexType(PrimaryKeyIndex::getIndexType());
+}
+
+StorageManager::~StorageManager() = default;
+
+void StorageManager::initDataFileHandle(VirtualFileSystem* vfs, main::ClientContext* context) {
+    if (inMemory) {
+        dataFH = memoryManager.getBufferManager()->getFileHandle(databasePath,
+            FileHandle::O_PERSISTENT_FILE_IN_MEM, vfs, context);
+    } else {
+        auto flag = readOnly ? FileHandle::O_PERSISTENT_FILE_READ_ONLY :
+                               FileHandle::O_PERSISTENT_FILE_CREATE_NOT_EXISTS;
+        flag |= FileHandle::O_LOCKED_PERSISTENT_FILE;
+        dataFH = memoryManager.getBufferManager()->getFileHandle(databasePath, flag, vfs, context);
+        if (dataFH->getNumPages() == 0) {
+            if (!readOnly) {
+                // Reserve the first page for the database header.
+                dataFH->getPageManager()->allocatePage();
+                // Write a dummy database header page.
+                const auto* initialHeader = getOrInitDatabaseHeader(*context);
+                auto headerWriter =
+                    std::make_shared<InMemFileWriter>(*MemoryManager::Get(*context));
+                Serializer headerSerializer(headerWriter);
+                initialHeader->serialize(headerSerializer);
+                dataFH->getFileInfo()->writeFile(headerWriter->getPage(0).data(), LBUG_PAGE_SIZE,
+                    StorageConstants::DB_HEADER_PAGE_IDX);
+                dataFH->getFileInfo()->syncFile();
+            }
+        }
+    }
+}
+
+Table* StorageManager::getTable(table_id_t tableID) {
+    std::lock_guard lck{mtx};
+    KU_ASSERT(tables.contains(tableID));
+    return tables.at(tableID).get();
+}
+
+void StorageManager::recover(main::ClientContext& clientContext, bool throwOnWalReplayFailure,
+    bool enableChecksums) {
+    const auto walReplayer = std::make_unique<WALReplayer>(clientContext);
+    walReplayer->replay(throwOnWalReplayFailure, enableChecksums);
+}
+
+void StorageManager::createNodeTable(NodeTableCatalogEntry* entry) {
+    tables[entry->getTableID()] = std::make_unique<NodeTable>(this, entry, &memoryManager);
+}
+
+// TODO(Guodong): This API is added since storageManager doesn't provide an API to add a single
+// rel table. We may have to refactor the existing StorageManager::createTable(TableCatalogEntry*
+// entry).
+void StorageManager::addRelTable(RelGroupCatalogEntry* entry, const RelTableCatalogInfo& info) {
+    tables[info.oid] = std::make_unique<RelTable>(entry, info.nodePair.srcTableID,
+        info.nodePair.dstTableID, this, &memoryManager);
+}
+
+void StorageManager::createRelTableGroup(RelGroupCatalogEntry* entry) {
+    for (auto& info : entry->getRelEntryInfos()) {
+        addRelTable(entry, info);
+    }
+}
+
+void StorageManager::createTable(TableCatalogEntry* entry) {
+    std::lock_guard lck{mtx};
+    switch (entry->getType()) {
+    case CatalogEntryType::NODE_TABLE_ENTRY: {
+        createNodeTable(entry->ptrCast<NodeTableCatalogEntry>());
+    } break;
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        createRelTableGroup(entry->ptrCast<RelGroupCatalogEntry>());
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+WAL& StorageManager::getWAL() const {
+    KU_ASSERT(wal);
+    return *wal;
+}
+
+ShadowFile& StorageManager::getShadowFile() const {
+    KU_ASSERT(shadowFile);
+    return *shadowFile;
+}
+
+void StorageManager::reclaimDroppedTables(const Catalog& catalog) {
+    std::vector<table_id_t> droppedTables;
+    for (const auto& [tableID, table] : tables) {
+        switch (table->getTableType()) {
+        case TableType::NODE: {
+            if (!catalog.containsTable(&DUMMY_CHECKPOINT_TRANSACTION, tableID, true)) {
+                table->reclaimStorage(*dataFH->getPageManager());
+                droppedTables.push_back(tableID);
+            }
+        } break;
+        case TableType::REL: {
+            auto& relTable = table->cast<RelTable>();
+            auto relGroupID = relTable.getRelGroupID();
+            if (!catalog.containsTable(&DUMMY_CHECKPOINT_TRANSACTION, relGroupID, true)) {
+                table->reclaimStorage(*dataFH->getPageManager());
+                droppedTables.push_back(tableID);
+            } else {
+                auto relGroupEntry =
+                    catalog.getTableCatalogEntry(&DUMMY_CHECKPOINT_TRANSACTION, relGroupID);
+                if (!relGroupEntry->cast<RelGroupCatalogEntry>().getRelEntryInfo(
+                        relTable.getFromNodeTableID(), relTable.getToNodeTableID())) {
+                    table->reclaimStorage(*dataFH->getPageManager());
+                    droppedTables.push_back(tableID);
+                }
+            }
+        }
+        default: {
+            // DO NOTHING.
+        }
+        }
+    }
+    for (auto tableID : droppedTables) {
+        tables.erase(tableID);
+    }
+}
+
+bool StorageManager::checkpoint(main::ClientContext* context, PageAllocator& pageAllocator) {
+    bool hasChanges = false;
+    const auto catalog = Catalog::Get(*context);
+    const auto nodeTableEntries = catalog->getNodeTableEntries(&DUMMY_CHECKPOINT_TRANSACTION);
+    const auto relGroupEntries = catalog->getRelGroupEntries(&DUMMY_CHECKPOINT_TRANSACTION);
+
+    for (const auto entry : nodeTableEntries) {
+        if (!tables.contains(entry->getTableID())) {
+            throw RuntimeException(stringFormat(
+                "Checkpoint failed: table {} not found in storage manager.", entry->getName()));
+        }
+        hasChanges =
+            tables.at(entry->getTableID())->checkpoint(context, entry, pageAllocator) || hasChanges;
+    }
+    for (const auto entry : relGroupEntries) {
+        for (auto& info : entry->getRelEntryInfos()) {
+            if (!tables.contains(info.oid)) {
+                throw RuntimeException(stringFormat(
+                    "Checkpoint failed: table {} not found in storage manager.", entry->getName()));
+            }
+            hasChanges =
+                tables.at(info.oid)->checkpoint(context, entry, pageAllocator) || hasChanges;
+        }
+        entry->vacuumColumnIDs(1);
+    }
+    reclaimDroppedTables(*catalog);
+    return hasChanges;
+}
+
+void StorageManager::finalizeCheckpoint() {
+    dataFH->getPageManager()->finalizeCheckpoint();
+}
+
+void StorageManager::rollbackCheckpoint(const Catalog& catalog) {
+    std::lock_guard lck{mtx};
+    const auto nodeTableEntries = catalog.getNodeTableEntries(&DUMMY_CHECKPOINT_TRANSACTION);
+    for (const auto tableEntry : nodeTableEntries) {
+        KU_ASSERT(tables.contains(tableEntry->getTableID()));
+        tables.at(tableEntry->getTableID())->rollbackCheckpoint();
+    }
+    dataFH->getPageManager()->rollbackCheckpoint();
+}
+
+std::optional<std::reference_wrapper<const IndexType>> StorageManager::getIndexType(
+    const std::string& typeName) const {
+    for (auto& indexType : registeredIndexTypes) {
+        if (StringUtils::caseInsensitiveEquals(indexType.typeName, typeName)) {
+            return indexType;
+        }
+    }
+    return std::nullopt;
+}
+
+void StorageManager::serialize(const Catalog& catalog, Serializer& ser) {
+    std::lock_guard lck{mtx};
+    auto nodeTableEntries = catalog.getNodeTableEntries(&DUMMY_CHECKPOINT_TRANSACTION);
+    auto relGroupEntries = catalog.getRelGroupEntries(&DUMMY_CHECKPOINT_TRANSACTION);
+    std::sort(nodeTableEntries.begin(), nodeTableEntries.end(),
+        [](const auto& a, const auto& b) { return a->getTableID() < b->getTableID(); });
+    std::sort(relGroupEntries.begin(), relGroupEntries.end(),
+        [](const auto& a, const auto& b) { return a->getTableID() < b->getTableID(); });
+    ser.writeDebuggingInfo("num_node_tables");
+    ser.write<uint64_t>(nodeTableEntries.size());
+    for (const auto tableEntry : nodeTableEntries) {
+        KU_ASSERT(tables.contains(tableEntry->getTableID()));
+        ser.writeDebuggingInfo("table_id");
+        ser.write<table_id_t>(tableEntry->getTableID());
+        tables.at(tableEntry->getTableID())->serialize(ser);
+    }
+    ser.writeDebuggingInfo("num_rel_groups");
+    ser.write<uint64_t>(relGroupEntries.size());
+    for (const auto entry : relGroupEntries) {
+        const auto& relGroupEntry = entry->cast<RelGroupCatalogEntry>();
+        ser.writeDebuggingInfo("rel_group_id");
+        ser.write<table_id_t>(relGroupEntry.getTableID());
+        ser.writeDebuggingInfo("num_inner_rel_tables");
+        ser.write<uint64_t>(relGroupEntry.getNumRelTables());
+        for (auto& info : relGroupEntry.getRelEntryInfos()) {
+            KU_ASSERT(tables.contains(info.oid));
+            info.serialize(ser);
+            tables.at(info.oid)->serialize(ser);
+        }
+    }
+}
+
+void StorageManager::deserialize(main::ClientContext* context, const Catalog* catalog,
+    Deserializer& deSer) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "num_node_tables");
+    uint64_t numNodeTables = 0;
+    deSer.deserializeValue<uint64_t>(numNodeTables);
+    for (auto i = 0u; i < numNodeTables; i++) {
+        deSer.validateDebuggingInfo(key, "table_id");
+        table_id_t tableID = INVALID_TABLE_ID;
+        deSer.deserializeValue<table_id_t>(tableID);
+        if (!catalog->containsTable(&DUMMY_TRANSACTION, tableID)) {
+            throw RuntimeException(
+                stringFormat("Load table failed: table {} doesn't exist in catalog.", tableID));
+        }
+        KU_ASSERT(!tables.contains(tableID));
+        auto tableEntry = catalog->getTableCatalogEntry(&DUMMY_TRANSACTION, tableID)
+                              ->ptrCast<NodeTableCatalogEntry>();
+        tables[tableID] = std::make_unique<NodeTable>(this, tableEntry, &memoryManager);
+        tables[tableID]->deserialize(context, this, deSer);
+    }
+    deSer.validateDebuggingInfo(key, "num_rel_groups");
+    uint64_t numRelGroups = 0;
+    deSer.deserializeValue<uint64_t>(numRelGroups);
+    for (auto i = 0u; i < numRelGroups; i++) {
+        deSer.validateDebuggingInfo(key, "rel_group_id");
+        table_id_t relGroupID = INVALID_TABLE_ID;
+        deSer.deserializeValue<table_id_t>(relGroupID);
+        if (!catalog->containsTable(&DUMMY_TRANSACTION, relGroupID)) {
+            throw RuntimeException(
+                stringFormat("Load table failed: table {} doesn't exist in catalog.", relGroupID));
+        }
+        deSer.validateDebuggingInfo(key, "num_inner_rel_tables");
+        uint64_t numInnerRelTables = 0;
+        deSer.deserializeValue<uint64_t>(numInnerRelTables);
+        auto relGroupEntry = catalog->getTableCatalogEntry(&DUMMY_TRANSACTION, relGroupID)
+                                 ->ptrCast<RelGroupCatalogEntry>();
+        for (auto k = 0u; k < numInnerRelTables; k++) {
+            RelTableCatalogInfo info = RelTableCatalogInfo::deserialize(deSer);
+            KU_ASSERT(!tables.contains(info.oid));
+            tables[info.oid] = std::make_unique<RelTable>(relGroupEntry, info.nodePair.srcTableID,
+                info.nodePair.dstTableID, this, &memoryManager);
+            tables.at(info.oid)->deserialize(context, this, deSer);
+        }
+    }
+}
+
+common::ku_uuid_t StorageManager::getOrInitDatabaseID(const main::ClientContext& clientContext) {
+    return getOrInitDatabaseHeader(clientContext)->databaseID;
+}
+
+const storage::DatabaseHeader* StorageManager::getOrInitDatabaseHeader(
+    const main::ClientContext& clientContext) {
+    if (databaseHeader == nullptr) {
+        // We should only create the database header if a persistent one doesn't exist
+        KU_ASSERT(std::nullopt == DatabaseHeader::readDatabaseHeader(*dataFH->getFileInfo()));
+        databaseHeader = std::make_unique<DatabaseHeader>(
+            DatabaseHeader::createInitialHeader(RandomEngine::Get(clientContext)));
+    }
+    return databaseHeader.get();
+}
+
+void StorageManager::setDatabaseHeader(std::unique_ptr<storage::DatabaseHeader> header) {
+    KU_ASSERT(!databaseHeader || header->databaseID.value == databaseHeader->databaseID.value);
+    databaseHeader = std::move(header);
+}
+
+StorageManager* StorageManager::Get(const main::ClientContext& context) {
+    if (context.getAttachedDatabase()) {
+        return context.getAttachedDatabase()->getStorageManager();
+    } else {
+        return context.getDatabase()->getStorageManager();
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/storage_utils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/storage_utils.cpp
new file mode 100644
index 0000000000..d9e585d886
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/storage_utils.cpp
@@ -0,0 +1,93 @@
+#include "storage/storage_utils.h"
+
+#include <filesystem>
+
+#include "common/null_buffer.h"
+#include "common/string_format.h"
+#include "common/types/ku_list.h"
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "main/client_context.h"
+#include "main/db_config.h"
+#include "main/settings.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+std::string StorageUtils::getColumnName(const std::string& propertyName, ColumnType type,
+    const std::string& prefix) {
+    switch (type) {
+    case ColumnType::DATA: {
+        return stringFormat("{}_data", propertyName);
+    }
+    case ColumnType::NULL_MASK: {
+        return stringFormat("{}_null", propertyName);
+    }
+    case ColumnType::INDEX: {
+        return stringFormat("{}_index", propertyName);
+    }
+    case ColumnType::OFFSET: {
+        return stringFormat("{}_offset", propertyName);
+    }
+    case ColumnType::CSR_OFFSET: {
+        return stringFormat("{}_csr_offset", prefix);
+    }
+    case ColumnType::CSR_LENGTH: {
+        return stringFormat("{}_csr_length", prefix);
+    }
+    case ColumnType::STRUCT_CHILD: {
+        return stringFormat("{}_{}_child", propertyName, prefix);
+    }
+    default: {
+        if (prefix.empty()) {
+            return propertyName;
+        }
+        return stringFormat("{}_{}", prefix, propertyName);
+    }
+    }
+}
+
+std::string StorageUtils::expandPath(const main::ClientContext* context, const std::string& path) {
+    if (main::DBConfig::isDBPathInMemory(path)) {
+        return path;
+    }
+    auto fullPath = path;
+    // Handle '~' for home directory expansion
+    if (path.starts_with('~')) {
+        fullPath =
+            context->getCurrentSetting(main::HomeDirectorySetting::name).getValue<std::string>() +
+            fullPath.substr(1);
+    }
+    // Normalize the path to resolve '.' and '..'
+    std::filesystem::path normalizedPath = std::filesystem::absolute(fullPath).lexically_normal();
+    return normalizedPath.string();
+}
+
+uint32_t StorageUtils::getDataTypeSize(const LogicalType& type) {
+    switch (type.getPhysicalType()) {
+    case PhysicalTypeID::STRING: {
+        return sizeof(ku_string_t);
+    }
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        return sizeof(ku_list_t);
+    }
+    case PhysicalTypeID::STRUCT: {
+        uint32_t size = 0;
+        const auto fieldsTypes = StructType::getFieldTypes(type);
+        for (const auto& fieldType : fieldsTypes) {
+            size += getDataTypeSize(*fieldType);
+        }
+        size += NullBuffer::getNumBytesForNullValues(fieldsTypes.size());
+        return size;
+    }
+    default: {
+        return PhysicalTypeUtils::getFixedTypeSize(type.getPhysicalType());
+    }
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/storage_version_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/storage_version_info.cpp
new file mode 100644
index 0000000000..3ec3f9c863
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/storage_version_info.cpp
@@ -0,0 +1,23 @@
+#include "storage/storage_version_info.h"
+
+namespace lbug {
+namespace storage {
+
+storage_version_t StorageVersionInfo::getStorageVersion() {
+    auto storageVersionInfo = getStorageVersionInfo();
+    if (!storageVersionInfo.contains(LBUG_CMAKE_VERSION)) {
+        // If the current LBUG_CMAKE_VERSION is not in the map,
+        // then we must run the newest version of lbug
+        // LCOV_EXCL_START
+        storage_version_t maxVersion = 0;
+        for (auto& [_, versionNumber] : storageVersionInfo) {
+            maxVersion = std::max(maxVersion, versionNumber);
+        }
+        return maxVersion;
+        // LCOV_EXCL_STOP
+    }
+    return storageVersionInfo.at(LBUG_CMAKE_VERSION);
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/CMakeLists.txt
new file mode 100644
index 0000000000..4d7e1938e4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/CMakeLists.txt
@@ -0,0 +1,39 @@
+add_library(lbug_storage_store
+        OBJECT
+        chunked_node_group.cpp
+        column.cpp
+        column_chunk.cpp
+        column_chunk_data.cpp
+        column_chunk_stats.cpp
+        csr_chunked_node_group.cpp
+        csr_node_group.cpp
+        column_reader_writer.cpp
+        column_chunk_data.cpp
+        column_chunk_metadata.cpp
+        compression_flush_buffer.cpp
+        dictionary_chunk.cpp
+        dictionary_column.cpp
+        in_mem_chunked_node_group_collection.cpp
+        in_memory_exception_chunk.cpp
+        lazy_segment_scanner.cpp
+        list_chunk_data.cpp
+        list_column.cpp
+        node_group.cpp
+        node_group_collection.cpp
+        node_table.cpp
+        null_column.cpp
+        rel_table.cpp
+        rel_table_data.cpp
+        string_chunk_data.cpp
+        string_column.cpp
+        struct_chunk_data.cpp
+        struct_column.cpp
+        table.cpp
+        update_info.cpp
+        version_info.cpp
+        version_record_handler.cpp
+)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_storage_store>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/chunked_node_group.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/chunked_node_group.cpp
new file mode 100644
index 0000000000..c7647d3349
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/chunked_node_group.cpp
@@ -0,0 +1,723 @@
+#include "storage/table/chunked_node_group.h"
+
+#include <exception>
+
+#include "common/assert.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/buffer_manager/spiller.h"
+#include "storage/enums/residency_state.h"
+#include "storage/page_allocator.h"
+#include "storage/table/column.h"
+#include "storage/table/column_chunk.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/column_chunk_scanner.h"
+#include "storage/table/node_table.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+template<class Chunk>
+static void handleAppendException(std::vector<std::unique_ptr<Chunk>>& chunks, uint64_t numRows) {
+    // After an exception is thrown other threads may continue to work on this chunked group for a
+    // while before they are interrupted
+    // Although the changes will eventually be rolled back
+    // We reset the state of the chunk so later changes won't corrupt any data
+    // Due to the numValues in column chunks not matching the number of rows
+    for (const auto& chunk : chunks) {
+        chunk->truncate(numRows);
+    }
+    std::rethrow_exception(std::current_exception());
+}
+
+ChunkedNodeGroup::ChunkedNodeGroup(std::vector<std::unique_ptr<ColumnChunk>> chunks,
+    row_idx_t startRowIdx, NodeGroupDataFormat format)
+    : format{format}, startRowIdx{startRowIdx}, chunks{std::move(chunks)} {
+    KU_ASSERT(!this->chunks.empty());
+    residencyState = this->chunks[0]->getResidencyState();
+    numRows = this->chunks[0]->getNumValues();
+    capacity = numRows;
+    for (auto columnID = 1u; columnID < this->chunks.size(); columnID++) {
+        KU_ASSERT(this->chunks[columnID]->getNumValues() == numRows);
+        KU_ASSERT(this->chunks[columnID]->getResidencyState() == residencyState);
+    }
+}
+
+ChunkedNodeGroup::ChunkedNodeGroup(ChunkedNodeGroup& base,
+    const std::vector<column_id_t>& selectedColumns)
+    : format{base.format}, residencyState{base.residencyState}, startRowIdx{base.startRowIdx},
+      capacity{base.capacity}, numRows{base.numRows.load()} {
+    chunks.resize(selectedColumns.size());
+    for (auto i = 0u; i < selectedColumns.size(); i++) {
+        auto columnID = selectedColumns[i];
+        KU_ASSERT(columnID < base.getNumColumns());
+        chunks[i] = base.moveColumnChunk(columnID);
+    }
+}
+
+ChunkedNodeGroup::ChunkedNodeGroup(InMemChunkedNodeGroup& base,
+    const std::vector<column_id_t>& selectedColumns, NodeGroupDataFormat format)
+    : format{format}, residencyState{ResidencyState::IN_MEMORY}, startRowIdx{base.getStartRowIdx()},
+      capacity{base.getCapacity()}, numRows{base.getNumRows()} {
+    chunks.resize(selectedColumns.size());
+    for (auto i = 0u; i < selectedColumns.size(); i++) {
+        auto columnID = selectedColumns[i];
+        KU_ASSERT(columnID < base.getNumColumns());
+        chunks[i] = std::make_unique<ColumnChunk>(true /*enableCompression*/,
+            base.moveColumnChunk(columnID));
+    }
+}
+
+ChunkedNodeGroup::ChunkedNodeGroup(MemoryManager& mm, const std::vector<LogicalType>& columnTypes,
+    bool enableCompression, uint64_t capacity, row_idx_t startRowIdx, ResidencyState residencyState,
+    NodeGroupDataFormat format)
+    : format{format}, residencyState{residencyState}, startRowIdx{startRowIdx}, capacity{capacity},
+      numRows{0} {
+    chunks.reserve(columnTypes.size());
+    for (auto& type : columnTypes) {
+        chunks.push_back(std::make_unique<ColumnChunk>(mm, type.copy(), capacity, enableCompression,
+            residencyState));
+    }
+}
+
+ChunkedNodeGroup::ChunkedNodeGroup(MemoryManager& mm, ChunkedNodeGroup& base,
+    std::span<const LogicalType> columnTypes, std::span<const column_id_t> baseColumnIDs)
+    : format{base.format}, residencyState{base.residencyState}, startRowIdx{base.startRowIdx},
+      capacity{base.capacity}, numRows{base.numRows.load()},
+      versionInfo(std::move(base.versionInfo)) {
+    bool enableCompression = false;
+    KU_ASSERT(!baseColumnIDs.empty());
+
+    chunks.resize(columnTypes.size());
+
+    KU_ASSERT(base.getNumColumns() == baseColumnIDs.size());
+    for (column_id_t i = 0; i < baseColumnIDs.size(); ++i) {
+        auto baseColumnID = baseColumnIDs[i];
+        KU_ASSERT(baseColumnID < chunks.size());
+        chunks[baseColumnID] = base.moveColumnChunk(i);
+        enableCompression = chunks[baseColumnID]->isCompressionEnabled();
+        KU_ASSERT(chunks[baseColumnID]->getDataType().getPhysicalType() ==
+                  columnTypes[baseColumnID].getPhysicalType());
+    }
+
+    for (column_id_t i = 0; i < columnTypes.size(); ++i) {
+        if (chunks[i] == nullptr) {
+            chunks[i] = std::make_unique<ColumnChunk>(mm, columnTypes[i].copy(), 0,
+                enableCompression, ResidencyState::IN_MEMORY);
+        }
+    }
+}
+
+void ChunkedNodeGroup::resetNumRowsFromChunks() {
+    KU_ASSERT(residencyState == ResidencyState::ON_DISK);
+    KU_ASSERT(!chunks.empty());
+    numRows = getColumnChunk(0).getNumValues();
+    capacity = numRows;
+    for (auto i = 1u; i < getNumColumns(); i++) {
+        KU_ASSERT(numRows == getColumnChunk(i).getNumValues());
+    }
+}
+
+void ChunkedNodeGroup::resetVersionAndUpdateInfo() {
+    if (versionInfo) {
+        versionInfo.reset();
+    }
+    for (const auto& chunk : chunks) {
+        chunk->resetUpdateInfo();
+    }
+}
+
+void ChunkedNodeGroup::truncate(const offset_t numRows_) {
+    KU_ASSERT(numRows >= numRows_);
+    for (const auto& chunk : chunks) {
+        chunk->truncate(numRows_);
+    }
+    numRows = numRows_;
+}
+
+void InMemChunkedNodeGroup::setNumRows(const offset_t numRows_) {
+    for (const auto& chunk : chunks) {
+        chunk->setNumValues(numRows_);
+    }
+    numRows = numRows_;
+}
+
+uint64_t ChunkedNodeGroup::append(const Transaction* transaction,
+    const std::vector<ValueVector*>& columnVectors, row_idx_t startRowInVectors,
+    uint64_t numValuesToAppend) {
+    KU_ASSERT(residencyState != ResidencyState::ON_DISK);
+    KU_ASSERT(columnVectors.size() == chunks.size());
+    const auto numRowsToAppendInChunk = std::min(numValuesToAppend, capacity - numRows);
+    try {
+        for (auto i = 0u; i < columnVectors.size(); i++) {
+            const auto columnVector = columnVectors[i];
+            chunks[i]->append(columnVector, columnVector->state->getSelVector().slice(
+                                                startRowInVectors, numRowsToAppendInChunk));
+        }
+    } catch ([[maybe_unused]] std::exception& e) {
+        handleAppendException(chunks, numRows);
+    }
+    if (transaction->shouldAppendToUndoBuffer()) {
+        if (!versionInfo) {
+            versionInfo = std::make_unique<VersionInfo>();
+        }
+        versionInfo->append(transaction->getID(), numRows, numRowsToAppendInChunk);
+    }
+    numRows += numRowsToAppendInChunk;
+    return numRowsToAppendInChunk;
+}
+
+offset_t ChunkedNodeGroup::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, const ChunkedNodeGroup& other,
+    offset_t offsetInOtherNodeGroup, offset_t numRowsToAppend) {
+    KU_ASSERT(residencyState == ResidencyState::IN_MEMORY);
+    KU_ASSERT(other.chunks.size() == chunks.size());
+    std::vector<const ColumnChunk*> chunksToAppend(other.chunks.size());
+    for (auto i = 0u; i < chunks.size(); i++) {
+        chunksToAppend[i] = other.chunks[i].get();
+    }
+    return append(transaction, columnIDs, chunksToAppend, offsetInOtherNodeGroup, numRowsToAppend);
+}
+
+offset_t ChunkedNodeGroup::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, const InMemChunkedNodeGroup& other,
+    offset_t offsetInOtherNodeGroup, offset_t numRowsToAppend) {
+    KU_ASSERT(residencyState == ResidencyState::IN_MEMORY);
+    KU_ASSERT(other.chunks.size() == chunks.size());
+    std::vector<const ColumnChunkData*> chunksToAppend(other.chunks.size());
+    for (auto i = 0u; i < chunks.size(); i++) {
+        chunksToAppend[i] = other.chunks[i].get();
+    }
+    return append(transaction, columnIDs, chunksToAppend, offsetInOtherNodeGroup, numRowsToAppend);
+}
+
+offset_t ChunkedNodeGroup::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, std::span<const ColumnChunkData*> other,
+    offset_t offsetInOtherNodeGroup, offset_t numRowsToAppend) {
+    KU_ASSERT(residencyState == ResidencyState::IN_MEMORY);
+    KU_ASSERT(other.size() == columnIDs.size());
+    const auto numToAppendInChunkedGroup = std::min(numRowsToAppend, capacity - numRows);
+    try {
+        for (auto i = 0u; i < columnIDs.size(); i++) {
+            auto columnID = columnIDs[i];
+            KU_ASSERT(columnID < chunks.size());
+            chunks[columnID]->append(other[i], offsetInOtherNodeGroup, numToAppendInChunkedGroup);
+        }
+    } catch ([[maybe_unused]] std::exception& e) {
+        handleAppendException(chunks, numRows);
+    }
+    if (transaction->getID() != Transaction::DUMMY_TRANSACTION_ID) {
+        if (!versionInfo) {
+            versionInfo = std::make_unique<VersionInfo>();
+        }
+        versionInfo->append(transaction->getID(), numRows, numToAppendInChunkedGroup);
+    }
+    numRows += numToAppendInChunkedGroup;
+    return numToAppendInChunkedGroup;
+}
+
+offset_t ChunkedNodeGroup::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, std::span<const ColumnChunk*> other,
+    offset_t offsetInOtherNodeGroup, offset_t numRowsToAppend) {
+    KU_ASSERT(residencyState == ResidencyState::IN_MEMORY);
+    KU_ASSERT(other.size() == columnIDs.size());
+    const auto numToAppendInChunkedGroup = std::min(numRowsToAppend, capacity - numRows);
+    try {
+        for (auto i = 0u; i < columnIDs.size(); i++) {
+            auto columnID = columnIDs[i];
+            KU_ASSERT(columnID < chunks.size());
+            chunks[columnID]->append(other[i], offsetInOtherNodeGroup, numToAppendInChunkedGroup);
+        }
+    } catch ([[maybe_unused]] std::exception& e) {
+        handleAppendException(chunks, numRows);
+    }
+    if (transaction->shouldAppendToUndoBuffer()) {
+        if (!versionInfo) {
+            versionInfo = std::make_unique<VersionInfo>();
+        }
+        versionInfo->append(transaction->getID(), numRows, numToAppendInChunkedGroup);
+    }
+    numRows += numToAppendInChunkedGroup;
+    return numToAppendInChunkedGroup;
+}
+
+void InMemChunkedNodeGroup::write(const InMemChunkedNodeGroup& data, column_id_t offsetColumnID) {
+    KU_ASSERT(data.chunks.size() == chunks.size() + 1);
+    auto& offsetChunk = data.chunks[offsetColumnID];
+    column_id_t columnID = 0, chunkIdx = 0;
+    for (auto i = 0u; i < data.chunks.size(); i++) {
+        if (i == offsetColumnID) {
+            columnID++;
+            continue;
+        }
+        KU_ASSERT(columnID < data.chunks.size());
+        writeToColumnChunk(chunkIdx, columnID, data.chunks, *offsetChunk);
+        chunkIdx++;
+        columnID++;
+    }
+    numRows = chunks[0]->getNumValues();
+    for (auto i = 1u; i < chunks.size(); i++) {
+        KU_ASSERT(numRows == chunks[i]->getNumValues());
+    }
+}
+
+static ZoneMapCheckResult getZoneMapResult(const TableScanState& scanState,
+    const std::vector<std::unique_ptr<ColumnChunk>>& chunks) {
+    if (!scanState.columnPredicateSets.empty()) {
+        for (auto i = 0u; i < scanState.columnIDs.size(); i++) {
+            const auto columnID = scanState.columnIDs[i];
+            if (columnID == INVALID_COLUMN_ID || columnID == ROW_IDX_COLUMN_ID) {
+                continue;
+            }
+
+            KU_ASSERT(i < scanState.columnPredicateSets.size());
+            if (chunks[columnID]->hasUpdates()) {
+                // With updates, we need to merge with update data for the correct stats, which can
+                // be slow if there are lots of updates. We defer this for now.
+                return ZoneMapCheckResult::ALWAYS_SCAN;
+            }
+            const auto columnZoneMapResult = scanState.columnPredicateSets[i].checkZoneMap(
+                chunks[columnID]->getMergedColumnChunkStats());
+            if (columnZoneMapResult == ZoneMapCheckResult::SKIP_SCAN) {
+                return ZoneMapCheckResult::SKIP_SCAN;
+            }
+        }
+    }
+    return ZoneMapCheckResult::ALWAYS_SCAN;
+}
+
+void ChunkedNodeGroup::scan(const Transaction* transaction, const TableScanState& scanState,
+    const NodeGroupScanState& nodeGroupScanState, offset_t rowIdxInGroup,
+    length_t numRowsToScan) const {
+    KU_ASSERT(rowIdxInGroup + numRowsToScan <= numRows);
+    auto& anchorSelVector = scanState.outState->getSelVectorUnsafe();
+    if (getZoneMapResult(scanState, chunks) == ZoneMapCheckResult::SKIP_SCAN) {
+        anchorSelVector.setToFiltered(0);
+        return;
+    }
+
+    if (versionInfo) {
+        versionInfo->getSelVectorToScan(transaction->getStartTS(), transaction->getID(),
+            anchorSelVector, rowIdxInGroup, numRowsToScan);
+    } else {
+        anchorSelVector.setToUnfiltered(numRowsToScan);
+    }
+
+    if (anchorSelVector.getSelSize() > 0) {
+        for (auto i = 0u; i < scanState.columnIDs.size(); i++) {
+            const auto columnID = scanState.columnIDs[i];
+            if (columnID == INVALID_COLUMN_ID) {
+                scanState.outputVectors[i]->setAllNull();
+                continue;
+            }
+            if (columnID == ROW_IDX_COLUMN_ID) {
+                for (auto rowIdx = 0u; rowIdx < numRowsToScan; rowIdx++) {
+                    scanState.rowIdxVector->setValue<row_idx_t>(rowIdx,
+                        rowIdx + rowIdxInGroup + startRowIdx);
+                }
+                continue;
+            }
+            KU_ASSERT(columnID < chunks.size());
+            chunks[columnID]->scan(transaction, nodeGroupScanState.chunkStates[i],
+                *scanState.outputVectors[i], rowIdxInGroup, numRowsToScan);
+        }
+    }
+}
+
+template<ResidencyState SCAN_RESIDENCY_STATE>
+void ChunkedNodeGroup::scanCommitted(Transaction* transaction, TableScanState& scanState,
+    InMemChunkedNodeGroup& output) const {
+    if (residencyState != SCAN_RESIDENCY_STATE) {
+        return;
+    }
+    for (auto i = 0u; i < scanState.columnIDs.size(); i++) {
+        const auto columnID = scanState.columnIDs[i];
+        chunks[columnID]->scanCommitted<SCAN_RESIDENCY_STATE>(transaction,
+            scanState.nodeGroupScanState->chunkStates[i], output.getColumnChunk(i));
+    }
+}
+
+template void ChunkedNodeGroup::scanCommitted<ResidencyState::ON_DISK>(Transaction* transaction,
+    TableScanState& scanState, InMemChunkedNodeGroup& output) const;
+template void ChunkedNodeGroup::scanCommitted<ResidencyState::IN_MEMORY>(Transaction* transaction,
+    TableScanState& scanState, InMemChunkedNodeGroup& output) const;
+
+bool ChunkedNodeGroup::hasDeletions(const Transaction* transaction) const {
+    return versionInfo && versionInfo->hasDeletions(transaction);
+}
+
+row_idx_t ChunkedNodeGroup::getNumUpdatedRows(const Transaction* transaction,
+    column_id_t columnID) {
+    return getColumnChunk(columnID).getNumUpdatedRows(transaction);
+}
+
+bool ChunkedNodeGroup::lookup(const Transaction* transaction, const TableScanState& state,
+    const NodeGroupScanState& nodeGroupScanState, offset_t rowIdxInChunk, sel_t posInOutput) const {
+    KU_ASSERT(rowIdxInChunk + 1 <= numRows);
+    const bool hasValuesToRead = versionInfo ? versionInfo->isSelected(transaction->getStartTS(),
+                                                   transaction->getID(), rowIdxInChunk) :
+                                               true;
+    if (!hasValuesToRead) {
+        return false;
+    }
+    for (auto i = 0u; i < state.columnIDs.size(); i++) {
+        const auto columnID = state.columnIDs[i];
+        if (columnID == INVALID_COLUMN_ID) {
+            state.outputVectors[i]->setAllNull();
+            continue;
+        }
+        if (columnID == ROW_IDX_COLUMN_ID) {
+            state.rowIdxVector->setValue<row_idx_t>(
+                state.rowIdxVector->state->getSelVector()[posInOutput],
+                rowIdxInChunk + startRowIdx);
+            continue;
+        }
+        KU_ASSERT(columnID < chunks.size());
+        KU_ASSERT(i < nodeGroupScanState.chunkStates.size());
+        chunks[columnID]->lookup(transaction, nodeGroupScanState.chunkStates[i], rowIdxInChunk,
+            *state.outputVectors[i], state.outputVectors[i]->state->getSelVector()[posInOutput]);
+    }
+    return true;
+}
+
+void ChunkedNodeGroup::update(const Transaction* transaction, row_idx_t rowIdxInChunk,
+    column_id_t columnID, const ValueVector& propertyVector) {
+    getColumnChunk(columnID).update(transaction, rowIdxInChunk, propertyVector);
+}
+
+bool ChunkedNodeGroup::delete_(const Transaction* transaction, row_idx_t rowIdxInChunk) {
+    if (!versionInfo) {
+        versionInfo = std::make_unique<VersionInfo>();
+    }
+    return versionInfo->delete_(transaction->getID(), rowIdxInChunk);
+}
+
+void ChunkedNodeGroup::addColumn(MemoryManager& mm, const TableAddColumnState& addColumnState,
+    bool enableCompression, PageAllocator* pageAllocator, ColumnStats* newColumnStats) {
+    auto& dataType = addColumnState.propertyDefinition.getType();
+    chunks.push_back(std::make_unique<ColumnChunk>(mm, dataType.copy(), capacity, enableCompression,
+        ResidencyState::IN_MEMORY));
+    auto numExistingRows = getNumRows();
+    chunks.back()->populateWithDefaultVal(addColumnState.defaultEvaluator, numExistingRows,
+        newColumnStats);
+    if (residencyState == ResidencyState::ON_DISK) {
+        KU_ASSERT(pageAllocator);
+        chunks.back()->flush(*pageAllocator);
+    }
+}
+
+bool ChunkedNodeGroup::isDeleted(const Transaction* transaction, row_idx_t rowInChunk) const {
+    if (!versionInfo) {
+        return false;
+    }
+    return versionInfo->isDeleted(transaction, rowInChunk);
+}
+
+bool ChunkedNodeGroup::isInserted(const Transaction* transaction, row_idx_t rowInChunk) const {
+    if (!versionInfo) {
+        return rowInChunk < getNumRows();
+    }
+    return versionInfo->isInserted(transaction, rowInChunk);
+}
+
+bool ChunkedNodeGroup::hasAnyUpdates(const Transaction* transaction, column_id_t columnID,
+    row_idx_t startRow, length_t numRowsToCheck) const {
+    return getColumnChunk(columnID).hasUpdates(transaction, startRow, numRowsToCheck);
+}
+
+row_idx_t ChunkedNodeGroup::getNumDeletions(const Transaction* transaction, row_idx_t startRow,
+    length_t numRowsToCheck) const {
+    if (versionInfo) {
+        return versionInfo->getNumDeletions(transaction, startRow, numRowsToCheck);
+    }
+    return 0;
+}
+
+std::unique_ptr<ColumnChunk> InMemChunkedNodeGroup::flushInternal(ColumnChunkData& chunk,
+    PageAllocator& pageAllocator) {
+    // Finalize is necessary prior to splitting for strings and lists so that pruned values
+    // don't have an impact on the number/size of segments It should not be necessary after
+    // splitting since the function is used to prune unused values (or duplicated dictionary
+    // entries in the case of strings) and those will never be introduced when splitting.
+    chunk.finalize();
+    if (chunk.shouldSplit()) {
+        auto splitSegments = chunk.split(true /*new segments are always the max size if possible*/);
+        std::vector<std::unique_ptr<ColumnChunkData>> flushedSegments;
+        flushedSegments.reserve(splitSegments.size());
+        for (auto& segment : splitSegments) {
+            // TODO(bmwinger): This should be removed when splitting works predictively instead of
+            // backtracking if we copy too many values
+            // It's only needed to prune values from string/list chunks which were truncated
+            segment->finalize();
+            flushedSegments.push_back(Column::flushChunkData(*segment, pageAllocator));
+        }
+        return std::make_unique<ColumnChunk>(chunk.isCompressionEnabled(),
+            std::move(flushedSegments));
+    } else {
+        return std::make_unique<ColumnChunk>(chunk.isCompressionEnabled(),
+            Column::flushChunkData(chunk, pageAllocator));
+    }
+}
+
+std::unique_ptr<ChunkedNodeGroup> InMemChunkedNodeGroup::flush(Transaction* transaction,
+    PageAllocator& pageAllocator) {
+    std::vector<std::unique_ptr<ColumnChunk>> flushedChunks(getNumColumns());
+    for (auto i = 0u; i < getNumColumns(); i++) {
+        flushedChunks[i] = flushInternal(getColumnChunk(i), pageAllocator);
+    }
+    auto flushedChunkedGroup =
+        std::make_unique<ChunkedNodeGroup>(std::move(flushedChunks), 0 /*startRowIdx*/);
+    flushedChunkedGroup->versionInfo = std::make_unique<VersionInfo>();
+    KU_ASSERT(flushedChunkedGroup->getNumRows() == numRows);
+    flushedChunkedGroup->versionInfo->append(transaction->getID(), 0, numRows);
+    return flushedChunkedGroup;
+}
+
+std::unique_ptr<ChunkedNodeGroup> ChunkedNodeGroup::flushEmpty(MemoryManager& mm,
+    const std::vector<common::LogicalType>& columnTypes, bool enableCompression, uint64_t capacity,
+    common::row_idx_t startRowIdx, PageAllocator& pageAllocator) {
+    auto emptyGroup = std::make_unique<ChunkedNodeGroup>(mm, columnTypes, enableCompression,
+        capacity, startRowIdx, ResidencyState::IN_MEMORY);
+    for (auto i = 0u; i < columnTypes.size(); i++) {
+        emptyGroup->getColumnChunk(i).flush(pageAllocator);
+    }
+    // Reset residencyState and numRows after flushing.
+    emptyGroup->residencyState = ResidencyState::ON_DISK;
+    return emptyGroup;
+}
+
+uint64_t ChunkedNodeGroup::getEstimatedMemoryUsage() const {
+    if (residencyState == ResidencyState::ON_DISK) {
+        return 0;
+    }
+    uint64_t memoryUsage = 0;
+    for (const auto& chunk : chunks) {
+        memoryUsage += chunk->getEstimatedMemoryUsage();
+    }
+    return memoryUsage;
+}
+
+bool ChunkedNodeGroup::hasUpdates() const {
+    for (const auto& chunk : chunks) {
+        if (chunk->hasUpdates()) {
+            return true;
+        }
+    }
+    return false;
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void ChunkedNodeGroup::commitInsert(row_idx_t startRow, row_idx_t numRowsToCommit,
+    transaction_t commitTS) {
+    versionInfo->commitInsert(startRow, numRowsToCommit, commitTS);
+}
+
+void ChunkedNodeGroup::rollbackInsert(row_idx_t startRow, row_idx_t numRows_, transaction_t) {
+    if (startRow == 0) {
+        truncate(0);
+        versionInfo.reset();
+        return;
+    }
+    if (startRow >= numRows) {
+        // Nothing to rollback.
+        return;
+    }
+    versionInfo->rollbackInsert(startRow, numRows_);
+    numRows = startRow;
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void ChunkedNodeGroup::commitDelete(row_idx_t startRow, row_idx_t numRows_,
+    transaction_t commitTS) {
+    versionInfo->commitDelete(startRow, numRows_, commitTS);
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void ChunkedNodeGroup::rollbackDelete(row_idx_t startRow, row_idx_t numRows_, transaction_t) {
+    versionInfo->rollbackDelete(startRow, numRows_);
+}
+
+void ChunkedNodeGroup::reclaimStorage(PageAllocator& pageAllocator) const {
+    for (auto& columnChunk : chunks) {
+        if (columnChunk) {
+            columnChunk->reclaimStorage(pageAllocator);
+        }
+    }
+}
+
+void ChunkedNodeGroup::serialize(Serializer& serializer) const {
+    KU_ASSERT(residencyState == ResidencyState::ON_DISK);
+    serializer.writeDebuggingInfo("chunks");
+    serializer.serializeVectorOfPtrs(chunks);
+    serializer.writeDebuggingInfo("startRowIdx");
+    serializer.write(startRowIdx);
+    serializer.writeDebuggingInfo("has_version_info");
+    serializer.write<bool>(versionInfo != nullptr);
+    if (versionInfo) {
+        serializer.writeDebuggingInfo("version_info");
+        versionInfo->serialize(serializer);
+    }
+}
+
+std::unique_ptr<ChunkedNodeGroup> ChunkedNodeGroup::deserialize(MemoryManager& memoryManager,
+    Deserializer& deSer) {
+    std::string key;
+    std::vector<std::unique_ptr<ColumnChunk>> chunks;
+    bool hasVersions = false;
+    row_idx_t startRowIdx = 0;
+    deSer.validateDebuggingInfo(key, "chunks");
+    deSer.deserializeVectorOfPtrs<ColumnChunk>(chunks,
+        [&](Deserializer& deser) { return ColumnChunk::deserialize(memoryManager, deser); });
+    deSer.validateDebuggingInfo(key, "startRowIdx");
+    deSer.deserializeValue<row_idx_t>(startRowIdx);
+    auto chunkedGroup = std::make_unique<ChunkedNodeGroup>(std::move(chunks), startRowIdx);
+    deSer.validateDebuggingInfo(key, "has_version_info");
+    deSer.deserializeValue<bool>(hasVersions);
+    if (hasVersions) {
+        deSer.validateDebuggingInfo(key, "version_info");
+        chunkedGroup->versionInfo = VersionInfo::deserialize(deSer);
+    }
+    return chunkedGroup;
+}
+
+InMemChunkedNodeGroup::InMemChunkedNodeGroup(MemoryManager& mm,
+    const std::vector<common::LogicalType>& columnTypes, bool enableCompression, uint64_t capacity,
+    common::row_idx_t startRowIdx)
+    : startRowIdx{startRowIdx}, numRows{0}, capacity{capacity}, dataInUse{true} {
+    chunks.reserve(columnTypes.size());
+    for (auto& type : columnTypes) {
+        chunks.push_back(ColumnChunkFactory::createColumnChunkData(mm, type.copy(),
+            enableCompression, capacity, ResidencyState::IN_MEMORY));
+    }
+}
+
+InMemChunkedNodeGroup::InMemChunkedNodeGroup(std::vector<std::unique_ptr<ColumnChunkData>>&& chunks,
+    row_idx_t startRowIdx)
+    : startRowIdx{startRowIdx}, numRows{chunks[0]->getNumValues()}, capacity{numRows},
+      chunks{std::move(chunks)}, dataInUse{true} {
+    KU_ASSERT(!this->chunks.empty());
+    for (auto columnID = 1u; columnID < this->chunks.size(); columnID++) {
+        KU_ASSERT(this->chunks[columnID]->getNumValues() == numRows);
+    }
+}
+
+void InMemChunkedNodeGroup::setUnused(const MemoryManager& mm) {
+    dataInUse = false;
+    mm.getBufferManager()->getSpillerOrSkip([&](auto& spiller) { spiller.addUnusedChunk(this); });
+}
+
+void InMemChunkedNodeGroup::loadFromDisk(const MemoryManager& mm) {
+    mm.getBufferManager()->getSpillerOrSkip([&](auto& spiller) {
+        std::unique_lock lock{spillToDiskMutex};
+        // Prevent buffer manager from being able to spill this chunk to disk
+        spiller.clearUnusedChunk(this);
+        for (auto& chunk : chunks) {
+            chunk->loadFromDisk();
+        }
+        dataInUse = true;
+    });
+}
+
+SpillResult InMemChunkedNodeGroup::spillToDisk() {
+    uint64_t reclaimedSpace = 0;
+    uint64_t nowEvictableMemory = 0;
+    std::unique_lock lock{spillToDiskMutex};
+    // Its possible that the chunk may be loaded and marked as in-use between when it is selected to
+    // be spilled to disk and actually spilled
+    if (!dataInUse) {
+        // These are groups from the partitioner which specifically are internalID columns and thus
+        // don't have a null column or any other sort of child column. That being said, it may be a
+        // good idea to make the interface more generic, which would open up the possibility of
+        // spilling to disk during node table copies too.
+        for (size_t i = 0; i < getNumColumns(); i++) {
+            auto [reclaimed, nowEvictable] = getColumnChunk(i).spillToDisk();
+            reclaimedSpace += reclaimed;
+            nowEvictableMemory += nowEvictable;
+        }
+    }
+    return SpillResult{reclaimedSpace, nowEvictableMemory};
+}
+
+void InMemChunkedNodeGroup::resetToEmpty() {
+    numRows = 0;
+    for (const auto& chunk : chunks) {
+        chunk->resetToEmpty();
+    }
+}
+
+void InMemChunkedNodeGroup::resetToAllNull() const {
+    for (const auto& chunk : chunks) {
+        chunk->resetToAllNull();
+    }
+}
+
+void InMemChunkedNodeGroup::resizeChunks(const uint64_t newSize) {
+    if (newSize <= capacity) {
+        return;
+    }
+    for (auto& chunk : chunks) {
+        chunk->resize(newSize);
+    }
+    capacity = newSize;
+}
+
+uint64_t InMemChunkedNodeGroup::append(const std::vector<ValueVector*>& columnVectors,
+    row_idx_t startRowInVectors, uint64_t numValuesToAppend) {
+    KU_ASSERT(columnVectors.size() == chunks.size());
+    const auto numRowsToAppendInChunk = std::min(numValuesToAppend, capacity - numRows);
+    try {
+        for (auto i = 0u; i < columnVectors.size(); i++) {
+            const auto columnVector = columnVectors[i];
+            chunks[i]->append(columnVector, columnVector->state->getSelVector().slice(
+                                                startRowInVectors, numRowsToAppendInChunk));
+        }
+    } catch ([[maybe_unused]] std::exception& e) {
+        handleAppendException(chunks, numRows);
+    }
+    numRows += numRowsToAppendInChunk;
+    return numRowsToAppendInChunk;
+}
+
+offset_t InMemChunkedNodeGroup::append(const InMemChunkedNodeGroup& other,
+    offset_t offsetInOtherNodeGroup, offset_t numRowsToAppend) {
+    KU_ASSERT(other.chunks.size() == chunks.size());
+    const auto numToAppendInChunkedGroup = std::min(numRowsToAppend, capacity - numRows);
+    try {
+        for (auto i = 0u; i < other.getNumColumns(); i++) {
+            chunks[i]->append(other.chunks[i].get(), offsetInOtherNodeGroup,
+                numToAppendInChunkedGroup);
+        }
+    } catch ([[maybe_unused]] std::exception& e) {
+        handleAppendException(chunks, numRows);
+    }
+    numRows += numToAppendInChunkedGroup;
+    return numToAppendInChunkedGroup;
+}
+
+void InMemChunkedNodeGroup::merge(InMemChunkedNodeGroup& base,
+    const std::vector<column_id_t>& columnsToMergeInto) {
+    KU_ASSERT(base.getNumColumns() == columnsToMergeInto.size());
+    for (idx_t i = 0; i < base.getNumColumns(); ++i) {
+        KU_ASSERT(columnsToMergeInto[i] < chunks.size());
+        chunks[columnsToMergeInto[i]] = base.moveColumnChunk(i);
+    }
+}
+
+InMemChunkedNodeGroup::InMemChunkedNodeGroup(InMemChunkedNodeGroup& base,
+    const std::vector<column_id_t>& selectedColumns)
+    : startRowIdx{base.getStartRowIdx()}, numRows{base.getNumRows()}, capacity{base.getCapacity()},
+      dataInUse{true} {
+    chunks.resize(selectedColumns.size());
+    for (auto i = 0u; i < selectedColumns.size(); i++) {
+        auto columnID = selectedColumns[i];
+        KU_ASSERT(columnID < base.getNumColumns());
+        chunks[i] = base.moveColumnChunk(columnID);
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column.cpp
new file mode 100644
index 0000000000..96496598bc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column.cpp
@@ -0,0 +1,580 @@
+#include "storage/table/column.h"
+
+#include <algorithm>
+#include <cstdint>
+#include <memory>
+
+#include "common/assert.h"
+#include "common/data_chunk/sel_vector.h"
+#include "common/null_mask.h"
+#include "common/system_config.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/compression/compression.h"
+#include "storage/file_handle.h"
+#include "storage/page_allocator.h"
+#include "storage/page_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column_chunk.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/list_column.h"
+#include "storage/table/null_column.h"
+#include "storage/table/string_column.h"
+#include "storage/table/struct_column.h"
+#include <bit>
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::evaluator;
+
+namespace lbug {
+namespace storage {
+
+struct ReadInternalIDValuesToVector {
+    ReadInternalIDValuesToVector() : compressedReader{LogicalType(LogicalTypeID::INTERNAL_ID)} {}
+    void operator()(const uint8_t* frame, PageCursor& pageCursor, ValueVector* resultVector,
+        uint32_t posInVector, uint32_t numValuesToRead, const CompressionMetadata& metadata) {
+        KU_ASSERT(resultVector->dataType.getPhysicalType() == PhysicalTypeID::INTERNAL_ID);
+
+        KU_ASSERT(numValuesToRead <= DEFAULT_VECTOR_CAPACITY);
+        offset_t offsetBuffer[DEFAULT_VECTOR_CAPACITY];
+
+        compressedReader(frame, pageCursor, reinterpret_cast<uint8_t*>(offsetBuffer), 0,
+            numValuesToRead, metadata);
+        auto resultData = reinterpret_cast<internalID_t*>(resultVector->getData());
+        for (auto i = 0u; i < numValuesToRead; i++) {
+            resultData[posInVector + i].offset = offsetBuffer[i];
+        }
+    }
+
+private:
+    ReadCompressedValuesFromPage compressedReader;
+};
+
+struct WriteInternalIDValuesToPage {
+    WriteInternalIDValuesToPage() : compressedWriter{LogicalType(LogicalTypeID::INTERNAL_ID)} {}
+    void operator()(uint8_t* frame, uint16_t posInFrame, const uint8_t* data, uint32_t dataOffset,
+        offset_t numValues, const CompressionMetadata& metadata, const NullMask* nullMask) {
+        compressedWriter(frame, posInFrame, data, dataOffset, numValues, metadata, nullMask);
+    }
+    void operator()(uint8_t* frame, uint16_t posInFrame, ValueVector* vector,
+        uint32_t offsetInVector, offset_t numValues, const CompressionMetadata& metadata) {
+        KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::INTERNAL_ID);
+        compressedWriter(frame, posInFrame,
+            reinterpret_cast<const uint8_t*>(
+                &vector->getValue<internalID_t>(offsetInVector).offset),
+            0 /*dataOffset*/, numValues, metadata);
+    }
+
+private:
+    WriteCompressedValuesToPage compressedWriter;
+};
+
+static read_values_to_vector_func_t getReadValuesToVectorFunc(const LogicalType& logicalType) {
+    switch (logicalType.getLogicalTypeID()) {
+    case LogicalTypeID::INTERNAL_ID:
+        return ReadInternalIDValuesToVector();
+    default:
+        return ReadCompressedValuesFromPageToVector(logicalType);
+    }
+}
+
+static write_values_func_t getWriteValuesFunc(const LogicalType& logicalType) {
+    switch (logicalType.getLogicalTypeID()) {
+    case LogicalTypeID::INTERNAL_ID:
+        return WriteInternalIDValuesToPage();
+    default:
+        return WriteCompressedValuesToPage(logicalType);
+    }
+}
+
+InternalIDColumn::InternalIDColumn(std::string name, FileHandle* dataFH, MemoryManager* mm,
+    ShadowFile* shadowFile, bool enableCompression)
+    : Column{std::move(name), LogicalType::INTERNAL_ID(), dataFH, mm, shadowFile, enableCompression,
+          false /*requireNullColumn*/},
+      commonTableID{INVALID_TABLE_ID} {}
+
+void InternalIDColumn::populateCommonTableID(const ValueVector* resultVector) const {
+    auto nodeIDs = reinterpret_cast<internalID_t*>(resultVector->getData());
+    auto& selVector = resultVector->state->getSelVector();
+    for (auto i = 0u; i < selVector.getSelSize(); i++) {
+        const auto pos = selVector[i];
+        nodeIDs[pos].tableID = commonTableID;
+    }
+}
+
+Column::Column(std::string name, LogicalType dataType, FileHandle* dataFH, MemoryManager* mm,
+    ShadowFile* shadowFile, bool enableCompression, bool requireNullColumn)
+    : name{std::move(name)}, dataType{std::move(dataType)}, mm{mm}, dataFH(dataFH),
+      shadowFile(shadowFile), enableCompression{enableCompression},
+      columnReadWriter(ColumnReadWriterFactory::createColumnReadWriter(
+          this->dataType.getPhysicalType(), dataFH, shadowFile)) {
+    readToVectorFunc = getReadValuesToVectorFunc(this->dataType);
+    readToPageFunc = ReadCompressedValuesFromPage(this->dataType);
+    writeFunc = getWriteValuesFunc(this->dataType);
+    if (requireNullColumn) {
+        auto columnName =
+            StorageUtils::getColumnName(this->name, StorageUtils::ColumnType::NULL_MASK, "");
+        nullColumn =
+            std::make_unique<NullColumn>(columnName, dataFH, mm, shadowFile, enableCompression);
+    }
+}
+
+Column::Column(std::string name, PhysicalTypeID physicalType, FileHandle* dataFH, MemoryManager* mm,
+    ShadowFile* shadowFile, bool enableCompression, bool requireNullColumn)
+    : Column(std::move(name), LogicalType::ANY(physicalType), dataFH, mm, shadowFile,
+          enableCompression, requireNullColumn) {}
+
+Column::~Column() = default;
+
+Column* Column::getNullColumn() const {
+    return nullColumn.get();
+}
+
+void Column::populateExtraChunkState(SegmentState& state) const {
+    if (state.metadata.compMeta.compression == CompressionType::ALP) {
+        if (dataType.getPhysicalType() == PhysicalTypeID::DOUBLE) {
+            state.alpExceptionChunk =
+                std::make_unique<InMemoryExceptionChunk<double>>(state, dataFH, mm, shadowFile);
+        } else if (dataType.getPhysicalType() == PhysicalTypeID::FLOAT) {
+            state.alpExceptionChunk =
+                std::make_unique<InMemoryExceptionChunk<float>>(state, dataFH, mm, shadowFile);
+        }
+    }
+}
+
+std::unique_ptr<ColumnChunkData> Column::flushChunkData(const ColumnChunkData& chunkData,
+    PageAllocator& pageAllocator) {
+    switch (chunkData.getDataType().getPhysicalType()) {
+    case PhysicalTypeID::STRUCT: {
+        return StructColumn::flushChunkData(chunkData, pageAllocator);
+    }
+    case PhysicalTypeID::STRING: {
+        return StringColumn::flushChunkData(chunkData, pageAllocator);
+    }
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        return ListColumn::flushChunkData(chunkData, pageAllocator);
+    }
+    default: {
+        return flushNonNestedChunkData(chunkData, pageAllocator);
+    }
+    }
+}
+
+std::unique_ptr<ColumnChunkData> Column::flushNonNestedChunkData(const ColumnChunkData& chunkData,
+    PageAllocator& pageAllocator) {
+    auto chunkMeta = flushData(chunkData, pageAllocator);
+    auto flushedChunk = ColumnChunkFactory::createColumnChunkData(chunkData.getMemoryManager(),
+        chunkData.getDataType().copy(), chunkData.isCompressionEnabled(), chunkMeta,
+        chunkData.hasNullData(), true);
+    if (chunkData.hasNullData()) {
+        auto nullChunkMeta = flushData(*chunkData.getNullData(), pageAllocator);
+        auto nullData = std::make_unique<NullChunkData>(chunkData.getMemoryManager(),
+            chunkData.isCompressionEnabled(), nullChunkMeta);
+        flushedChunk->setNullData(std::move(nullData));
+    }
+    return flushedChunk;
+}
+
+ColumnChunkMetadata Column::flushData(const ColumnChunkData& chunkData,
+    PageAllocator& pageAllocator) {
+    KU_ASSERT(chunkData.sanityCheck());
+    const auto preScanMetadata = chunkData.getMetadataToFlush();
+    auto allocatedBlock = pageAllocator.allocatePageRange(preScanMetadata.getNumPages());
+    return chunkData.flushBuffer(pageAllocator, allocatedBlock, preScanMetadata);
+}
+
+void Column::scan(const ChunkState& state, offset_t startOffsetInChunk, offset_t length,
+    ValueVector* resultVector, uint64_t offsetInVector) const {
+    if (length == 0) {
+        return;
+    }
+    // Selection vector must be ordered, and values must be within the range of [0, length)
+    RUNTIME_CHECK(if (resultVector->state) {
+        sel_t prevValue = 0;
+        resultVector->state->getSelVector().forEach([&](auto i) {
+            KU_ASSERT(prevValue <= i);
+            KU_ASSERT(i < length);
+            prevValue = i;
+        });
+    });
+
+    state.rangeSegments(startOffsetInChunk, length,
+        [&](auto& segmentState, auto startOffsetInSegment, auto lengthInSegment, auto dstOffset) {
+            scanSegment(segmentState, startOffsetInSegment, lengthInSegment, resultVector,
+                offsetInVector + dstOffset);
+        });
+}
+
+void Column::scanSegment(const SegmentState& state, offset_t startOffsetInSegment,
+    row_idx_t numValuesToScan, ValueVector* resultVector, offset_t offsetInVector) const {
+    if (numValuesToScan == 0) {
+        return;
+    }
+    KU_ASSERT(startOffsetInSegment + numValuesToScan <= state.metadata.numValues);
+    if (nullColumn) {
+        KU_ASSERT(state.nullState);
+        nullColumn->scanSegment(*state.nullState, startOffsetInSegment, numValuesToScan,
+            resultVector, offsetInVector);
+    }
+    if (getDataTypeSizeInChunk(dataType) == 0) {
+        return;
+    }
+    if (!resultVector->state || resultVector->state->getSelVector().isUnfiltered()) {
+        columnReadWriter->readCompressedValuesToVector(state, resultVector, offsetInVector,
+            startOffsetInSegment, numValuesToScan, readToVectorFunc);
+    } else {
+        struct Filterer {
+            explicit Filterer(const SelectionVector& selVector, offset_t offsetInVector)
+                : selVector(selVector), posInSelVector(0), offsetInVector{offsetInVector} {}
+            bool operator()(offset_t startIdx, offset_t endIdx) {
+                while (posInSelVector < selVector.getSelSize() &&
+                       (selVector[posInSelVector] < offsetInVector ||
+                           selVector[posInSelVector] - offsetInVector < startIdx)) {
+                    posInSelVector++;
+                }
+                return (posInSelVector < selVector.getSelSize() &&
+                        isInRange(selVector[posInSelVector] - offsetInVector, startIdx, endIdx));
+            }
+
+            const SelectionVector& selVector;
+            offset_t posInSelVector;
+            offset_t offsetInVector;
+        };
+
+        columnReadWriter->readCompressedValuesToVector(state, resultVector, offsetInVector,
+            startOffsetInSegment, numValuesToScan, readToVectorFunc,
+            Filterer{resultVector->state->getSelVector(), offsetInVector});
+    }
+}
+
+void Column::scanSegment(const SegmentState& state, ColumnChunkData* outputChunk,
+    offset_t offsetInSegment, offset_t numValues) const {
+    if (numValues == 0) {
+        return;
+    }
+    KU_ASSERT(offsetInSegment + numValues <= state.metadata.numValues);
+    auto startLength = outputChunk->getNumValues();
+    if (nullColumn) {
+        nullColumn->scanSegment(*state.nullState, outputChunk->getNullData(), offsetInSegment,
+            numValues);
+    }
+
+    if (startLength + numValues > outputChunk->getCapacity()) {
+        outputChunk->resize(std::bit_ceil(startLength + numValues));
+    }
+
+    if (getDataTypeSizeInChunk(dataType) > 0) {
+        columnReadWriter->readCompressedValuesToPage(state, outputChunk->getData(),
+            outputChunk->getNumValues(), offsetInSegment, numValues, readToPageFunc);
+    }
+    outputChunk->setNumValues(startLength + numValues);
+}
+
+void Column::scan(const ChunkState& state, ColumnChunkData* outputChunk, offset_t offsetInChunk,
+    offset_t numValues) const {
+    outputChunk->setNumValues(0);
+    [[maybe_unused]] uint64_t numValuesScanned = state.rangeSegments(offsetInChunk, numValues,
+        [&](auto& segmentState, auto startOffsetInSegment, auto lengthInSegment, auto) {
+            scanSegment(segmentState, outputChunk, startOffsetInSegment, lengthInSegment);
+        });
+    KU_ASSERT(outputChunk->getNumValues() == numValuesScanned);
+}
+
+void Column::scanSegment(const SegmentState& state, offset_t startOffsetInSegment, offset_t length,
+    uint8_t* result) const {
+    KU_ASSERT(startOffsetInSegment + length <= state.metadata.numValues);
+    columnReadWriter->readCompressedValuesToPage(state, result, 0, startOffsetInSegment, length,
+        readToPageFunc);
+}
+
+void Column::lookupValue(const ChunkState& state, offset_t nodeOffset, ValueVector* resultVector,
+    uint32_t posInVector) const {
+    auto [segmentState, offsetInSegment] = state.findSegment(nodeOffset);
+    if (nullColumn) {
+        nullColumn->lookupInternal(*segmentState->nullState, offsetInSegment, resultVector,
+            posInVector);
+    }
+    if (!resultVector->isNull(posInVector)) {
+        lookupInternal(*segmentState, offsetInSegment, resultVector, posInVector);
+    }
+}
+
+void Column::lookupInternal(const SegmentState& state, offset_t offsetInSegment,
+    ValueVector* resultVector, uint32_t posInVector) const {
+    columnReadWriter->readCompressedValueToVector(state, offsetInSegment, resultVector, posInVector,
+        readToVectorFunc);
+}
+
+[[maybe_unused]] static bool sanityCheckForWrites(const ColumnChunkMetadata& metadata,
+    const LogicalType& dataType) {
+    if (metadata.compMeta.compression == CompressionType::ALP) {
+        return metadata.compMeta.children.size() != 0;
+    }
+    if (metadata.compMeta.compression == CompressionType::CONSTANT) {
+        return metadata.getNumDataPages(dataType.getPhysicalType()) == 0;
+    }
+    const auto numValuesPerPage = metadata.compMeta.numValues(LBUG_PAGE_SIZE, dataType);
+    if (numValuesPerPage == UINT64_MAX) {
+        return metadata.getNumDataPages(dataType.getPhysicalType()) == 0;
+    }
+    return std::ceil(
+               static_cast<double>(metadata.numValues) / static_cast<double>(numValuesPerPage)) <=
+           metadata.getNumDataPages(dataType.getPhysicalType());
+}
+
+void Column::updateStatistics(ColumnChunkMetadata& metadata, offset_t maxIndex,
+    const std::optional<StorageValue>& min, const std::optional<StorageValue>& max) const {
+    if (maxIndex >= metadata.numValues) {
+        metadata.numValues = maxIndex + 1;
+        KU_ASSERT(sanityCheckForWrites(metadata, dataType));
+    }
+    // Either both or neither should be provided
+    KU_ASSERT((!min && !max) || (min && max));
+    if (min && max) {
+        // If new values are outside of the existing min/max, update them
+        if (max->gt(metadata.compMeta.max, dataType.getPhysicalType())) {
+            metadata.compMeta.max = *max;
+        } else if (metadata.compMeta.min.gt(*min, dataType.getPhysicalType())) {
+            metadata.compMeta.min = *min;
+        }
+    }
+}
+
+void Column::write(ColumnChunkData& persistentChunk, ChunkState& state, offset_t initialDstOffset,
+    const ColumnChunkData& data, offset_t srcOffset, length_t numValues) const {
+    state.rangeSegments(srcOffset, numValues,
+        [&](auto& segmentState, auto offsetInSegment, auto lengthInSegment, auto dstOffset) {
+            writeSegment(persistentChunk, segmentState, initialDstOffset + dstOffset, data,
+                offsetInSegment, lengthInSegment);
+        });
+}
+
+void Column::writeSegment(ColumnChunkData& persistentChunk, SegmentState& state,
+    offset_t dstOffsetInSegment, const ColumnChunkData& data, offset_t srcOffset,
+    offset_t numValues) const {
+    auto nullMask = data.getNullMask();
+    columnReadWriter->writeValuesToPageFromBuffer(state, dstOffsetInSegment, data.getData(),
+        nullMask ? &*nullMask : nullptr, srcOffset, numValues, writeFunc);
+
+    if (dataType.getPhysicalType() != common::PhysicalTypeID::ALP_EXCEPTION_DOUBLE &&
+        dataType.getPhysicalType() != common::PhysicalTypeID::ALP_EXCEPTION_FLOAT) {
+        auto [minWritten, maxWritten] =
+            getMinMaxStorageValue(data, srcOffset, numValues, dataType.getPhysicalType());
+        updateStatistics(persistentChunk.getMetadata(), dstOffsetInSegment + numValues - 1,
+            minWritten, maxWritten);
+    }
+}
+
+// TODO: Do we need to adapt the offsets to this current node group?
+void Column::writeValues(ChunkState& state, offset_t initialDstOffset, const uint8_t* data,
+    const NullMask* nullChunkData, offset_t srcOffset, offset_t numValues) const {
+    state.rangeSegments(srcOffset, numValues,
+        [&](auto& segmentState, auto offsetInSegment, auto lengthInSegment, auto dstOffset) {
+            writeValuesInternal(segmentState, initialDstOffset + dstOffset, data, nullChunkData,
+                offsetInSegment, lengthInSegment);
+        });
+}
+
+void Column::writeValuesInternal(SegmentState& state, common::offset_t dstOffsetInSegment,
+    const uint8_t* data, const common::NullMask* nullChunkData, common::offset_t srcOffset,
+    common::offset_t numValues) const {
+    columnReadWriter->writeValuesToPageFromBuffer(state, dstOffsetInSegment, data, nullChunkData,
+        srcOffset, numValues, writeFunc);
+}
+
+// Append to the end of the chunk.
+offset_t Column::appendValues(ColumnChunkData& persistentChunk, SegmentState& state,
+    const uint8_t* data, const NullMask* nullChunkData, offset_t numValues) const {
+    auto& metadata = persistentChunk.getMetadata();
+    const auto startOffset = metadata.numValues;
+    writeValuesInternal(state, metadata.numValues, data, nullChunkData, 0 /*dataOffset*/,
+        numValues);
+
+    auto [minWritten, maxWritten] = getMinMaxStorageValue(data, 0 /*offset*/, numValues,
+        dataType.getPhysicalType(), nullChunkData);
+    updateStatistics(metadata, startOffset + numValues - 1, minWritten, maxWritten);
+    return startOffset;
+}
+
+bool Column::isEndOffsetOutOfPagesCapacity(const ColumnChunkMetadata& metadata,
+    offset_t endOffset) const {
+    if (metadata.compMeta.compression != CompressionType::CONSTANT &&
+        (metadata.compMeta.numValues(LBUG_PAGE_SIZE, dataType) *
+            metadata.getNumDataPages(dataType.getPhysicalType())) <= endOffset) {
+        // Note that for constant compression, `metadata.numPages` will be equal to 0.
+        // Thus, this function will always return true.
+        return true;
+    }
+    return false;
+}
+
+void Column::checkpointColumnChunkInPlace(SegmentState& state,
+    const ColumnCheckpointState& checkpointState, PageAllocator& pageAllocator) const {
+    for (auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
+        KU_ASSERT(segmentCheckpointState.numRows > 0);
+        state.column->writeSegment(checkpointState.persistentData, state,
+            segmentCheckpointState.offsetInSegment, segmentCheckpointState.chunkData,
+            segmentCheckpointState.startRowInData, segmentCheckpointState.numRows);
+    }
+    // writeSegment doesn't update numValues, just the metadata
+    // TODO(bmwinger): either have all writes update numValues, or have writeSegment update it
+    // directly
+    checkpointState.persistentData.resetNumValuesFromMetadata();
+    if (nullColumn) {
+        checkpointNullData(checkpointState, pageAllocator);
+    }
+}
+
+void Column::checkpointNullData(const ColumnCheckpointState& checkpointState,
+    PageAllocator& pageAllocator) const {
+    std::vector<SegmentCheckpointState> nullSegmentCheckpointStates;
+    for (const auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
+        KU_ASSERT(segmentCheckpointState.chunkData.hasNullData());
+        nullSegmentCheckpointStates.emplace_back(*segmentCheckpointState.chunkData.getNullData(),
+            segmentCheckpointState.startRowInData, segmentCheckpointState.offsetInSegment,
+            segmentCheckpointState.numRows);
+    }
+    KU_ASSERT(checkpointState.persistentData.hasNullData());
+    nullColumn->checkpointSegment(
+        ColumnCheckpointState(*checkpointState.persistentData.getNullData(),
+            std::move(nullSegmentCheckpointStates)),
+        pageAllocator, false);
+}
+
+std::vector<std::unique_ptr<ColumnChunkData>> Column::checkpointColumnChunkOutOfPlace(
+    const SegmentState& state, const ColumnCheckpointState& checkpointState,
+    PageAllocator& pageAllocator, bool canSplitSegment) const {
+    const auto numRows = std::max(checkpointState.endRowIdxToWrite, state.metadata.numValues);
+    checkpointState.persistentData.setToInMemory();
+    checkpointState.persistentData.resize(numRows);
+    KU_ASSERT(checkpointState.persistentData.getNumValues() == 0);
+    scanSegment(state, &checkpointState.persistentData, 0, state.metadata.numValues);
+    state.reclaimAllocatedPages(pageAllocator);
+    // TODO(bmwinger): for simple compression types, we can predict whether or not we will need to
+    // split the segment and avoid having to re-write it multiple times
+    for (auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
+        checkpointState.persistentData.write(&segmentCheckpointState.chunkData,
+            segmentCheckpointState.startRowInData, segmentCheckpointState.offsetInSegment,
+            segmentCheckpointState.numRows);
+    }
+    // Finalize is necessary prior to splitting for strings and lists so that pruned values don't
+    // have an impact on the number/size of segments It should not be necessary after splitting
+    // since the function is used to prune unused values (or duplicated dictionary entries in the
+    // case of strings) and those will never be introduced when splitting.
+    checkpointState.persistentData.finalize();
+    if (canSplitSegment && checkpointState.persistentData.shouldSplit()) {
+        auto newSegments = checkpointState.persistentData.split();
+        for (auto& segment : newSegments) {
+            segment->flush(pageAllocator);
+        }
+        return newSegments;
+    }
+    checkpointState.persistentData.flush(pageAllocator);
+    return {};
+}
+
+bool Column::canCheckpointInPlace(const SegmentState& state,
+    const ColumnCheckpointState& checkpointState) const {
+    if (isEndOffsetOutOfPagesCapacity(checkpointState.persistentData.getMetadata(),
+            checkpointState.endRowIdxToWrite)) {
+        return false;
+    }
+    if (checkpointState.persistentData.getMetadata().compMeta.canAlwaysUpdateInPlace()) {
+        return true;
+    }
+
+    InPlaceUpdateLocalState localUpdateState{};
+    for (auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
+        auto& chunkData = segmentCheckpointState.chunkData;
+        if (chunkData.getNumValues() != 0 &&
+            !state.metadata.compMeta.canUpdateInPlace(chunkData.getData(),
+                segmentCheckpointState.startRowInData, segmentCheckpointState.numRows,
+                dataType.getPhysicalType(), localUpdateState, chunkData.getNullMask())) {
+            return false;
+        }
+    }
+    return true;
+}
+
+std::vector<std::unique_ptr<ColumnChunkData>> Column::checkpointSegment(
+    ColumnCheckpointState&& checkpointState, PageAllocator& pageAllocator,
+    bool canSplitSegment) const {
+    if (checkpointState.segmentCheckpointStates.empty()) {
+        return {};
+    }
+    SegmentState chunkState;
+    checkpointState.persistentData.initializeScanState(chunkState, this);
+    if (canCheckpointInPlace(chunkState, checkpointState)) {
+        checkpointColumnChunkInPlace(chunkState, checkpointState, pageAllocator);
+
+        if (chunkState.metadata.compMeta.compression == CompressionType::ALP) {
+            if (dataType.getPhysicalType() == PhysicalTypeID::DOUBLE) {
+                chunkState.getExceptionChunk<double>()->finalizeAndFlushToDisk(chunkState);
+            } else if (dataType.getPhysicalType() == PhysicalTypeID::FLOAT) {
+                chunkState.getExceptionChunk<float>()->finalizeAndFlushToDisk(chunkState);
+            } else {
+                KU_UNREACHABLE;
+            }
+            checkpointState.persistentData.getMetadata().compMeta.floatMetadata()->exceptionCount =
+                chunkState.metadata.compMeta.floatMetadata()->exceptionCount;
+        }
+        return {};
+    } else {
+        return checkpointColumnChunkOutOfPlace(chunkState, checkpointState, pageAllocator,
+            canSplitSegment);
+    }
+}
+
+std::unique_ptr<Column> ColumnFactory::createColumn(std::string name, PhysicalTypeID physicalType,
+    FileHandle* dataFH, MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression) {
+    return std::make_unique<Column>(name, LogicalType::ANY(physicalType), dataFH, mm, shadowFile,
+        enableCompression);
+}
+
+std::unique_ptr<Column> ColumnFactory::createColumn(std::string name, LogicalType dataType,
+    FileHandle* dataFH, MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression) {
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL:
+    case PhysicalTypeID::INT64:
+    case PhysicalTypeID::INT32:
+    case PhysicalTypeID::INT16:
+    case PhysicalTypeID::INT8:
+    case PhysicalTypeID::UINT64:
+    case PhysicalTypeID::UINT32:
+    case PhysicalTypeID::UINT16:
+    case PhysicalTypeID::UINT8:
+    case PhysicalTypeID::INT128:
+    case PhysicalTypeID::UINT128:
+    case PhysicalTypeID::DOUBLE:
+    case PhysicalTypeID::FLOAT:
+    case PhysicalTypeID::INTERVAL: {
+        return std::make_unique<Column>(name, std::move(dataType), dataFH, mm, shadowFile,
+            enableCompression);
+    }
+    case PhysicalTypeID::INTERNAL_ID: {
+        return std::make_unique<InternalIDColumn>(name, dataFH, mm, shadowFile, enableCompression);
+    }
+    case PhysicalTypeID::STRING: {
+        return std::make_unique<StringColumn>(name, std::move(dataType), dataFH, mm, shadowFile,
+            enableCompression);
+    }
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        return std::make_unique<ListColumn>(name, std::move(dataType), dataFH, mm, shadowFile,
+            enableCompression);
+    }
+    case PhysicalTypeID::STRUCT: {
+        return std::make_unique<StructColumn>(name, std::move(dataType), dataFH, mm, shadowFile,
+            enableCompression);
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk.cpp
new file mode 100644
index 0000000000..06917c90dc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk.cpp
@@ -0,0 +1,334 @@
+#include "storage/table/column_chunk.h"
+
+#include <algorithm>
+#include <memory>
+
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/vector/value_vector.h"
+#include "main/client_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/enums/residency_state.h"
+#include "storage/page_allocator.h"
+#include "storage/table/column.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/column_chunk_scanner.h"
+#include "storage/table/combined_chunk_scanner.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+void ChunkState::reclaimAllocatedPages(PageAllocator& pageAllocator) const {
+    for (auto& state : segmentStates) {
+        state.reclaimAllocatedPages(pageAllocator);
+    }
+}
+
+std::pair<const SegmentState*, common::offset_t> ChunkState::findSegment(
+    common::offset_t offsetInChunk) const {
+    auto [iter, offsetInSegment] = genericFindSegment(std::span(segmentStates), offsetInChunk);
+    if (iter == std::span(segmentStates).end()) {
+        return std::make_pair(nullptr, 0);
+    }
+    return std::make_pair(&*iter, offsetInSegment);
+}
+
+ColumnChunk::ColumnChunk(MemoryManager& mm, LogicalType&& dataType, uint64_t capacity,
+    bool enableCompression, ResidencyState residencyState, bool initializeToZero)
+    : enableCompression{enableCompression} {
+    data.push_back(ColumnChunkFactory::createColumnChunkData(mm, std::move(dataType),
+        enableCompression, capacity, residencyState, true, initializeToZero));
+    KU_ASSERT(residencyState != ResidencyState::ON_DISK);
+}
+
+ColumnChunk::ColumnChunk(MemoryManager& mm, LogicalType&& dataType, bool enableCompression,
+    ColumnChunkMetadata metadata)
+    : enableCompression{enableCompression} {
+    data.push_back(ColumnChunkFactory::createColumnChunkData(mm, std::move(dataType),
+        enableCompression, metadata, true, true));
+}
+
+ColumnChunk::ColumnChunk(bool enableCompression, std::unique_ptr<ColumnChunkData> data)
+    : enableCompression{enableCompression}, data{} {
+    this->data.push_back(std::move(data));
+}
+ColumnChunk::ColumnChunk(bool enableCompression,
+    std::vector<std::unique_ptr<ColumnChunkData>> segments)
+    : enableCompression{enableCompression}, data{std::move(segments)} {}
+
+void ColumnChunk::initializeScanState(ChunkState& state, const Column* column) const {
+    state.column = column;
+    state.segmentStates.resize(data.size());
+    for (size_t i = 0; i < data.size(); i++) {
+        data[i]->initializeScanState(state.segmentStates[i], column);
+    }
+}
+
+void ColumnChunk::scan(const Transaction* transaction, const ChunkState& state, ValueVector& output,
+    offset_t offsetInChunk, length_t length) const {
+    // Check if there is deletions or insertions. If so, update selVector based on transaction.
+    switch (getResidencyState()) {
+    case ResidencyState::IN_MEMORY: {
+        rangeSegments(offsetInChunk, length,
+            [&](auto& segment, auto offsetInSegment, auto lengthInSegment, auto dstOffset) {
+                segment->scan(output, offsetInSegment, lengthInSegment, dstOffset);
+            });
+    } break;
+    case ResidencyState::ON_DISK: {
+        state.column->scan(state, offsetInChunk, length, &output, 0);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    updateInfo.scan(transaction, output, offsetInChunk, length);
+}
+
+static void scanPersistentSegments(ChunkState& chunkState, ColumnChunkScanner& output,
+    common::offset_t startRow, common::offset_t numRows) {
+    KU_ASSERT(output.getNumValues() == 0);
+    [[maybe_unused]] uint64_t numValuesScanned = chunkState.rangeSegments(startRow, numRows,
+        [&](auto& segmentState, auto offsetInSegment, auto lengthInSegment, auto) {
+            output.scanSegment(offsetInSegment, lengthInSegment,
+                [&chunkState, &segmentState](ColumnChunkData& outputChunk, offset_t offsetInSegment,
+                    offset_t lengthInSegment) {
+                    chunkState.column->scanSegment(segmentState, &outputChunk, offsetInSegment,
+                        lengthInSegment);
+                });
+        });
+    KU_ASSERT(output.getNumValues() == numValuesScanned);
+}
+
+void ColumnChunk::scanInMemSegments(ColumnChunkScanner& output, common::offset_t startRow,
+    common::offset_t numRows) const {
+    rangeSegments(startRow, numRows,
+        [&](auto& segment, auto offsetInSegment, auto lengthInSegment, auto) {
+            output.scanSegment(offsetInSegment, lengthInSegment,
+                [&segment](ColumnChunkData& outputChunk, offset_t offsetInSegment,
+                    offset_t lengthInSegment) {
+                    outputChunk.append(segment.get(), offsetInSegment, lengthInSegment);
+                });
+        });
+}
+
+template<ResidencyState SCAN_RESIDENCY_STATE>
+void ColumnChunk::scanCommitted(const Transaction* transaction, ChunkState& chunkState,
+    ColumnChunkScanner& output, row_idx_t startRow, row_idx_t numRows) const {
+    auto numValuesInChunk = getNumValues();
+    if (numRows == INVALID_ROW_IDX || startRow + numRows > numValuesInChunk) {
+        numRows = numValuesInChunk - startRow;
+    }
+    if (numRows == 0 || startRow >= numValuesInChunk) {
+        return;
+    }
+    const auto residencyState = getResidencyState();
+    if (SCAN_RESIDENCY_STATE == residencyState) {
+        if constexpr (SCAN_RESIDENCY_STATE == ResidencyState::ON_DISK) {
+            scanPersistentSegments(chunkState, output, startRow, numRows);
+        } else {
+            static_assert(SCAN_RESIDENCY_STATE == ResidencyState::IN_MEMORY);
+            scanInMemSegments(output, startRow, numRows);
+        }
+        output.applyCommittedUpdates(updateInfo, transaction, startRow, numRows);
+    }
+}
+
+template void ColumnChunk::scanCommitted<ResidencyState::ON_DISK>(const Transaction* transaction,
+    ChunkState& chunkState, ColumnChunkScanner& output, row_idx_t startRow,
+    row_idx_t numRows) const;
+template void ColumnChunk::scanCommitted<ResidencyState::IN_MEMORY>(const Transaction* transaction,
+    ChunkState& chunkState, ColumnChunkScanner& output, row_idx_t startRow,
+    row_idx_t numRows) const;
+
+template<ResidencyState SCAN_RESIDENCY_STATE>
+void ColumnChunk::scanCommitted(const Transaction* transaction, ChunkState& chunkState,
+    ColumnChunkData& output, row_idx_t startRow, row_idx_t numRows) const {
+    CombinedChunkScanner scanner{output};
+    scanCommitted<SCAN_RESIDENCY_STATE>(transaction, chunkState, scanner, startRow, numRows);
+}
+
+template void ColumnChunk::scanCommitted<ResidencyState::ON_DISK>(const Transaction* transaction,
+    ChunkState& chunkState, ColumnChunkData& output, row_idx_t startRow, row_idx_t numRows) const;
+template void ColumnChunk::scanCommitted<ResidencyState::IN_MEMORY>(const Transaction* transaction,
+    ChunkState& chunkState, ColumnChunkData& output, row_idx_t startRow, row_idx_t numRows) const;
+
+bool ColumnChunk::hasUpdates(const Transaction* transaction, row_idx_t startRow,
+    length_t numRows) const {
+    return updateInfo.hasUpdates(transaction, startRow, numRows);
+}
+
+void ColumnChunk::lookup(const Transaction* transaction, const ChunkState& state,
+    offset_t rowInChunk, ValueVector& output, sel_t posInOutputVector) const {
+    switch (getResidencyState()) {
+    case ResidencyState::IN_MEMORY: {
+        rangeSegments(rowInChunk, 1, [&](auto& segment, auto offsetInSegment, auto, auto) {
+            segment->lookup(offsetInSegment, output, posInOutputVector);
+        });
+    } break;
+    case ResidencyState::ON_DISK: {
+        state.column->lookupValue(state, rowInChunk, &output, posInOutputVector);
+    } break;
+    }
+    updateInfo.lookup(transaction, rowInChunk, output, posInOutputVector);
+}
+
+void ColumnChunk::update(const Transaction* transaction, offset_t offsetInChunk,
+    const ValueVector& values) {
+    if (transaction->getType() == TransactionType::DUMMY) {
+        rangeSegments(offsetInChunk, 1, [&](auto& segment, auto offsetInSegment, auto, auto) {
+            segment->write(&values, values.state->getSelVector().getSelectedPositions()[0],
+                offsetInSegment);
+        });
+        return;
+    }
+
+    const auto vectorIdx = offsetInChunk / DEFAULT_VECTOR_CAPACITY;
+    const auto rowIdxInVector = offsetInChunk % DEFAULT_VECTOR_CAPACITY;
+    auto& vectorUpdateInfo = updateInfo.update(data.front()->getMemoryManager(), transaction,
+        vectorIdx, rowIdxInVector, values);
+    transaction->pushVectorUpdateInfo(updateInfo, vectorIdx, vectorUpdateInfo,
+        transaction->getID());
+}
+
+MergedColumnChunkStats ColumnChunk::getMergedColumnChunkStats() const {
+    KU_ASSERT(!updateInfo.isSet());
+    auto baseStats = MergedColumnChunkStats{ColumnChunkStats{}, true, true};
+    for (auto& segment : data) {
+        // TODO: Replace with a function that modifies the existing stats in-place?
+        auto segmentStats = segment->getMergedColumnChunkStats();
+        baseStats.merge(segmentStats, segment->getDataType().getPhysicalType());
+    }
+    return baseStats;
+}
+
+void ColumnChunk::serialize(Serializer& serializer) const {
+    serializer.writeDebuggingInfo("enable_compression");
+    serializer.write<bool>(enableCompression);
+    serializer.write<uint64_t>(data.size());
+    for (auto& segment : data) {
+        segment->serialize(serializer);
+    }
+}
+
+std::unique_ptr<ColumnChunk> ColumnChunk::deserialize(MemoryManager& mm, Deserializer& deSer) {
+    std::string key;
+    bool enableCompression = false;
+    deSer.validateDebuggingInfo(key, "enable_compression");
+    deSer.deserializeValue<bool>(enableCompression);
+    uint64_t numSegments = 0;
+    deSer.deserializeValue(numSegments);
+    std::vector<std::unique_ptr<ColumnChunkData>> segments;
+    for (uint64_t i = 0; i < numSegments; i++) {
+        segments.push_back(ColumnChunkData::deserialize(mm, deSer));
+    }
+    return std::make_unique<ColumnChunk>(enableCompression, std::move(segments));
+}
+
+row_idx_t ColumnChunk::getNumUpdatedRows(const Transaction* transaction) const {
+    return updateInfo.getNumUpdatedRows(transaction);
+}
+
+void ColumnChunk::reclaimStorage(PageAllocator& pageAllocator) const {
+    for (const auto& segment : data) {
+        segment->reclaimStorage(pageAllocator);
+    }
+}
+
+void ColumnChunk::append(common::ValueVector* vector, const common::SelectionView& selView) {
+    data.back()->append(vector, selView);
+}
+
+void ColumnChunk::append(const ColumnChunk* other, common::offset_t startPosInOtherChunk,
+    uint32_t numValuesToAppend) {
+    for (auto& otherSegment : other->data) {
+        if (numValuesToAppend == 0) {
+            return;
+        }
+        if (otherSegment->getNumValues() < startPosInOtherChunk) {
+            startPosInOtherChunk -= otherSegment->getNumValues();
+        } else {
+            auto numValuesToAppendInSegment =
+                std::min(otherSegment->getNumValues(), uint64_t{numValuesToAppend});
+            append(otherSegment.get(), startPosInOtherChunk, numValuesToAppendInSegment);
+            numValuesToAppend -= numValuesToAppendInSegment;
+            startPosInOtherChunk = 0;
+        }
+    }
+}
+
+void ColumnChunk::append(const ColumnChunkData* other, common::offset_t startPosInOtherChunk,
+    uint32_t numValuesToAppend) {
+    data.back()->append(other, startPosInOtherChunk, numValuesToAppend);
+}
+
+void ColumnChunk::write(Column& column, ChunkState& state, offset_t dstOffset,
+    const ColumnChunkData& dataToWrite, offset_t srcOffset, common::length_t numValues) {
+    auto segment = data.begin();
+    auto offsetInSegment = dstOffset;
+    while (segment->get()->getNumValues() < offsetInSegment) {
+        offsetInSegment -= segment->get()->getNumValues();
+        segment++;
+    }
+    while (numValues > 0) {
+        auto numValuesToWriteInSegment =
+            std::min(numValues, segment->get()->getNumValues()) - offsetInSegment;
+        column.write(*segment->get(), state, offsetInSegment, dataToWrite, srcOffset,
+            numValuesToWriteInSegment);
+        offsetInSegment = 0;
+        numValues -= numValuesToWriteInSegment;
+        srcOffset += numValuesToWriteInSegment;
+    }
+}
+
+void ColumnChunk::checkpoint(Column& column,
+    std::vector<ChunkCheckpointState>&& chunkCheckpointStates, PageAllocator& pageAllocator) {
+    offset_t segmentStart = 0;
+    for (size_t i = 0; i < data.size(); i++) {
+        std::vector<SegmentCheckpointState> segmentCheckpointStates;
+        auto& segment = data[i];
+        KU_ASSERT(segment->getResidencyState() == ResidencyState::ON_DISK);
+        for (auto& state : chunkCheckpointStates) {
+            const bool isLastSegment = (i == data.size() - 1);
+            if (state.startRow + state.numRows > segmentStart &&
+                (isLastSegment || state.startRow < segmentStart + segment->getNumValues())) {
+                const auto startOffset = std::max(state.startRow, segmentStart);
+                // Generally, we only want to checkpoint the overlapping parts of the old segment
+                // and the new chunk. This is to prevent having duplicate segments. However, for the
+                // last old segment we allow extending it to account for any insertions we have made
+                // in the current checkpoint.
+                const auto endOffset = isLastSegment ? state.startRow + state.numRows :
+                                                       std::min(state.startRow + state.numRows,
+                                                           segmentStart + segment->getNumValues());
+
+                const auto startOffsetInSegment = startOffset - segmentStart;
+                const auto startRowInChunk = startOffset - state.startRow;
+                segmentCheckpointStates.push_back({*state.chunkData, startRowInChunk,
+                    startOffsetInSegment, endOffset - startOffset});
+            }
+        }
+        auto segmentEnd = segmentStart + segment->getNumValues();
+        // If the segment was split during checkpointing we need to insert the new segments into the
+        // ColumnChunk
+        auto newSegments = column.checkpointSegment(
+            ColumnCheckpointState(*segment, std::move(segmentCheckpointStates)), pageAllocator);
+        if (!newSegments.empty()) {
+            auto oldSize = data.size();
+            data.resize(data.size() - 1 + newSegments.size());
+            std::move_backward(data.begin() + i, data.begin() + oldSize, data.end());
+            for (size_t j = 0; j < newSegments.size(); j++) {
+                data[i + j] = std::move(newSegments[j]);
+            }
+            // We want to increment by a total of newSegments.size() but we increment i at the end
+            // of each loop body
+            i += newSegments.size() - 1;
+        }
+        segmentStart = segmentEnd;
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk_data.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk_data.cpp
new file mode 100644
index 0000000000..ece8f3b970
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk_data.cpp
@@ -0,0 +1,1094 @@
+#include "storage/table/column_chunk_data.h"
+
+#include <algorithm>
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/exception/copy.h"
+#include "common/null_mask.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/system_config.h"
+#include "common/type_utils.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "expression_evaluator/expression_evaluator.h"
+#include "storage/buffer_manager/buffer_manager.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/buffer_manager/spill_result.h"
+#include "storage/buffer_manager/spiller.h"
+#include "storage/compression/compression.h"
+#include "storage/compression/float_compression.h"
+#include "storage/enums/residency_state.h"
+#include "storage/stats/column_stats.h"
+#include "storage/table/column.h"
+#include "storage/table/column_chunk_metadata.h"
+#include "storage/table/compression_flush_buffer.h"
+#include "storage/table/list_chunk_data.h"
+#include "storage/table/string_chunk_data.h"
+#include "storage/table/struct_chunk_data.h"
+
+using namespace lbug::common;
+using namespace lbug::evaluator;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+void SegmentState::reclaimAllocatedPages(PageAllocator& pageAllocator) const {
+    const auto& entry = metadata.pageRange;
+    if (entry.startPageIdx != INVALID_PAGE_IDX) {
+        pageAllocator.freePageRange(entry);
+    }
+    if (nullState) {
+        nullState->reclaimAllocatedPages(pageAllocator);
+    }
+    for (const auto& child : childrenStates) {
+        child.reclaimAllocatedPages(pageAllocator);
+    }
+}
+
+static std::shared_ptr<CompressionAlg> getCompression(const LogicalType& dataType,
+    bool enableCompression) {
+    if (!enableCompression) {
+        return std::make_shared<Uncompressed>(dataType);
+    }
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::INT128: {
+        return std::make_shared<IntegerBitpacking<int128_t>>();
+    }
+    case PhysicalTypeID::INT64: {
+        return std::make_shared<IntegerBitpacking<int64_t>>();
+    }
+    case PhysicalTypeID::INT32: {
+        return std::make_shared<IntegerBitpacking<int32_t>>();
+    }
+    case PhysicalTypeID::INT16: {
+        return std::make_shared<IntegerBitpacking<int16_t>>();
+    }
+    case PhysicalTypeID::INT8: {
+        return std::make_shared<IntegerBitpacking<int8_t>>();
+    }
+    case PhysicalTypeID::INTERNAL_ID:
+    case PhysicalTypeID::UINT64: {
+        return std::make_shared<IntegerBitpacking<uint64_t>>();
+    }
+    case PhysicalTypeID::UINT32: {
+        return std::make_shared<IntegerBitpacking<uint32_t>>();
+    }
+    case PhysicalTypeID::UINT16: {
+        return std::make_shared<IntegerBitpacking<uint16_t>>();
+    }
+    case PhysicalTypeID::UINT8: {
+        return std::make_shared<IntegerBitpacking<uint8_t>>();
+    }
+    case PhysicalTypeID::FLOAT: {
+        return std::make_shared<FloatCompression<float>>();
+    }
+    case PhysicalTypeID::DOUBLE: {
+        return std::make_shared<FloatCompression<double>>();
+    }
+    default: {
+        return std::make_shared<Uncompressed>(dataType);
+    }
+    }
+}
+
+ColumnChunkData::ColumnChunkData(MemoryManager& mm, LogicalType dataType, uint64_t capacity,
+    bool enableCompression, ResidencyState residencyState, bool hasNullData, bool initializeToZero)
+    : residencyState{residencyState}, dataType{std::move(dataType)},
+      enableCompression{enableCompression},
+      numBytesPerValue{getDataTypeSizeInChunk(this->dataType)}, capacity{capacity}, numValues{0},
+      inMemoryStats() {
+    if (hasNullData) {
+        nullData = std::make_unique<NullChunkData>(mm, capacity, enableCompression, residencyState);
+    }
+    initializeBuffer(this->dataType.getPhysicalType(), mm, initializeToZero);
+    initializeFunction();
+}
+
+ColumnChunkData::ColumnChunkData(MemoryManager& mm, LogicalType dataType, bool enableCompression,
+    const ColumnChunkMetadata& metadata, bool hasNullData, bool initializeToZero)
+    : residencyState(ResidencyState::ON_DISK), dataType{std::move(dataType)},
+      enableCompression{enableCompression},
+      numBytesPerValue{getDataTypeSizeInChunk(this->dataType)}, capacity{0},
+      numValues{metadata.numValues}, metadata{metadata} {
+    if (hasNullData) {
+        nullData = std::make_unique<NullChunkData>(mm, enableCompression, metadata);
+    }
+    initializeBuffer(this->dataType.getPhysicalType(), mm, initializeToZero);
+    initializeFunction();
+}
+
+ColumnChunkData::ColumnChunkData(MemoryManager& mm, PhysicalTypeID dataType, bool enableCompression,
+    const ColumnChunkMetadata& metadata, bool hasNullData, bool initializeToZero)
+    : ColumnChunkData(mm, LogicalType::ANY(dataType), enableCompression, metadata, hasNullData,
+          initializeToZero) {}
+
+void ColumnChunkData::initializeBuffer(PhysicalTypeID physicalType, MemoryManager& mm,
+    bool initializeToZero) {
+    numBytesPerValue = getDataTypeSizeInChunk(physicalType);
+
+    // Some columnChunks are much smaller than the 256KB minimum size used by allocateBuffer
+    // Which would lead to excessive memory use, particularly in the partitioner
+    buffer = mm.allocateBuffer(initializeToZero, getBufferSize(capacity));
+}
+
+void ColumnChunkData::initializeFunction() {
+    const auto compression = getCompression(dataType, enableCompression);
+    getMetadataFunction = GetCompressionMetadata(compression, dataType);
+    flushBufferFunction = initializeFlushBufferFunction(compression);
+}
+
+ColumnChunkData::flush_buffer_func_t ColumnChunkData::initializeFlushBufferFunction(
+    std::shared_ptr<CompressionAlg> compression) const {
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL: {
+        // Since we compress into memory, storage is the same as fixed-sized
+        // values, but we need to mark it as being boolean compressed.
+        return uncompressedFlushBuffer;
+    }
+    case PhysicalTypeID::STRING:
+    case PhysicalTypeID::INT64:
+    case PhysicalTypeID::INT32:
+    case PhysicalTypeID::INT16:
+    case PhysicalTypeID::INT8:
+    case PhysicalTypeID::INTERNAL_ID:
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST:
+    case PhysicalTypeID::UINT64:
+    case PhysicalTypeID::UINT32:
+    case PhysicalTypeID::UINT16:
+    case PhysicalTypeID::UINT8:
+    case PhysicalTypeID::INT128: {
+        return CompressedFlushBuffer(compression, dataType);
+    }
+    case PhysicalTypeID::DOUBLE: {
+        return CompressedFloatFlushBuffer<double>(compression, dataType);
+    }
+    case PhysicalTypeID::FLOAT: {
+        return CompressedFloatFlushBuffer<float>(compression, dataType);
+    }
+    default: {
+        return uncompressedFlushBuffer;
+    }
+    }
+}
+
+void ColumnChunkData::resetToAllNull() {
+    KU_ASSERT(residencyState != ResidencyState::ON_DISK);
+    if (nullData) {
+        nullData->resetToAllNull();
+    }
+    resetInMemoryStats();
+}
+
+void ColumnChunkData::resetToEmpty() {
+    KU_ASSERT(residencyState != ResidencyState::ON_DISK);
+    if (nullData) {
+        nullData->resetToEmpty();
+    }
+    KU_ASSERT(getBufferSize() == getBufferSize(capacity));
+    memset(getData<uint8_t>(), 0x00, getBufferSize());
+    numValues = 0;
+    resetInMemoryStats();
+}
+
+static void updateInMemoryStats(ColumnChunkStats& stats, const ValueVector& values,
+    uint64_t offset = 0, uint64_t numValues = std::numeric_limits<uint64_t>::max()) {
+    const auto physicalType = values.dataType.getPhysicalType();
+    const auto numValuesToCheck = std::min(numValues, values.state->getSelSize());
+    stats.update(values, offset, numValuesToCheck, physicalType);
+}
+
+static void updateInMemoryStats(ColumnChunkStats& stats, const ColumnChunkData* values,
+    uint64_t offset = 0, uint64_t numValues = std::numeric_limits<uint64_t>::max()) {
+    const auto physicalType = values->getDataType().getPhysicalType();
+    const auto numValuesToCheck = std::min(values->getNumValues(), numValues);
+    const auto nullMask = values->getNullMask();
+    stats.update(*values, offset, numValuesToCheck, physicalType);
+}
+
+MergedColumnChunkStats ColumnChunkData::getMergedColumnChunkStats() const {
+    const CompressionMetadata& onDiskMetadata = metadata.compMeta;
+    ColumnChunkStats stats = inMemoryStats;
+    const auto physicalType = getDataType().getPhysicalType();
+    const bool isStorageValueType =
+        TypeUtils::visit(physicalType, []<typename T>(T) { return StorageValueType<T>; });
+    if (isStorageValueType) {
+        stats.update(onDiskMetadata.min, onDiskMetadata.max, physicalType);
+    }
+    return MergedColumnChunkStats{stats, !nullData || nullData->haveNoNullsGuaranteed(),
+        nullData && nullData->haveAllNullsGuaranteed()};
+}
+
+void ColumnChunkData::updateStats(const ValueVector* vector, const SelectionView& selView) {
+    if (selView.isUnfiltered()) {
+        updateInMemoryStats(inMemoryStats, *vector);
+    } else {
+        TypeUtils::visit(
+            getDataType().getPhysicalType(),
+            [&]<StorageValueType T>(T) {
+                std::optional<T> firstValue;
+                // ValueVector::firstNonNull uses the vector's builtin selection vector, not the one
+                // passed as an argument
+                selView.forEachBreakWhenFalse([&](auto i) {
+                    if (vector->isNull(i)) {
+                        return true;
+                    } else {
+                        firstValue = vector->getValue<T>(i);
+                        return false;
+                    }
+                });
+                if (!firstValue) {
+                    return;
+                }
+                T min = *firstValue, max = *firstValue;
+                auto update = [&](sel_t pos) {
+                    const auto val = vector->getValue<T>(pos);
+                    if (val < min) {
+                        min = val;
+                    } else if (val > max) {
+                        max = val;
+                    }
+                };
+                if (vector->hasNoNullsGuarantee()) {
+                    selView.forEach(update);
+                } else {
+                    selView.forEach([&](auto pos) {
+                        if (!vector->isNull(pos)) {
+                            update(pos);
+                        }
+                    });
+                }
+                inMemoryStats.update(StorageValue(min), StorageValue(max),
+                    getDataType().getPhysicalType());
+            },
+            []<typename T>(T) { static_assert(!StorageValueType<T>); });
+    }
+}
+
+void ColumnChunkData::resetInMemoryStats() {
+    inMemoryStats.reset();
+}
+
+ColumnChunkMetadata ColumnChunkData::getMetadataToFlush() const {
+    KU_ASSERT(numValues <= capacity);
+    StorageValue minValue = {}, maxValue = {};
+    if (capacity > 0) {
+        std::optional<NullMask> nullMask;
+        if (nullData) {
+            nullMask = nullData->getNullMask();
+        }
+        auto [min, max] =
+            getMinMaxStorageValue(getData(), 0 /*offset*/, numValues, dataType.getPhysicalType(),
+                nullMask.has_value() ? &*nullMask : nullptr, true /*valueRequiredIfUnsupported*/);
+        minValue = min.value_or(StorageValue());
+        maxValue = max.value_or(StorageValue());
+    }
+    KU_ASSERT(getBufferSize() == getBufferSize(capacity));
+    return getMetadataFunction(buffer->getBuffer(), numValues, minValue, maxValue);
+}
+
+void ColumnChunkData::append(ValueVector* vector, const SelectionView& selView) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == dataType.getPhysicalType());
+    copyVectorToBuffer(vector, numValues, selView);
+    numValues += selView.getSelSize();
+    updateStats(vector, selView);
+}
+
+void ColumnChunkData::append(const ColumnChunkData* other, offset_t startPosInOtherChunk,
+    uint32_t numValuesToAppend) {
+    KU_ASSERT(other->dataType.getPhysicalType() == dataType.getPhysicalType());
+    if (nullData) {
+        KU_ASSERT(nullData->getNumValues() == getNumValues());
+        nullData->append(other->nullData.get(), startPosInOtherChunk, numValuesToAppend);
+    }
+    KU_ASSERT(numValues + numValuesToAppend <= capacity);
+    memcpy(getData<uint8_t>() + numValues * numBytesPerValue,
+        other->getData<uint8_t>() + startPosInOtherChunk * numBytesPerValue,
+        numValuesToAppend * numBytesPerValue);
+    numValues += numValuesToAppend;
+    updateInMemoryStats(inMemoryStats, other, startPosInOtherChunk, numValuesToAppend);
+}
+
+void ColumnChunkData::flush(PageAllocator& pageAllocator) {
+    const auto preScanMetadata = getMetadataToFlush();
+    auto allocatedEntry = pageAllocator.allocatePageRange(preScanMetadata.getNumPages());
+    const auto flushedMetadata = flushBuffer(pageAllocator, allocatedEntry, preScanMetadata);
+    setToOnDisk(flushedMetadata);
+    if (nullData) {
+        nullData->flush(pageAllocator);
+    }
+}
+
+// Note: This function is not setting child/null chunk data recursively.
+void ColumnChunkData::setToOnDisk(const ColumnChunkMetadata& otherMetadata) {
+    residencyState = ResidencyState::ON_DISK;
+    capacity = 0;
+    // Note: We don't need to set the buffer to nullptr, as it allows ColumnChunkData to be resized.
+    buffer = buffer->getMemoryManager()->allocateBuffer(true, 0 /*size*/);
+    this->metadata = otherMetadata;
+    this->numValues = otherMetadata.numValues;
+    resetInMemoryStats();
+}
+
+ColumnChunkMetadata ColumnChunkData::flushBuffer(PageAllocator& pageAllocator,
+    const PageRange& entry, const ColumnChunkMetadata& otherMetadata) const {
+    const auto bufferSizeToFlush = getBufferSize(numValues);
+    if (!otherMetadata.compMeta.isConstant() && bufferSizeToFlush != 0) {
+        KU_ASSERT(bufferSizeToFlush <= buffer->getBuffer().size_bytes());
+        const auto bufferToFlush = buffer->getBuffer().subspan(0, bufferSizeToFlush);
+        return flushBufferFunction(bufferToFlush, pageAllocator.getDataFH(), entry, otherMetadata);
+    }
+    KU_ASSERT(otherMetadata.getNumPages() == 0);
+    return otherMetadata;
+}
+
+uint64_t ColumnChunkData::getBufferSize(uint64_t capacity_) const {
+    switch (dataType.getLogicalTypeID()) {
+    case LogicalTypeID::BOOL: {
+        // 8 values per byte, and we need a buffer size which is a
+        // multiple of 8 bytes.
+        return ceil(capacity_ / 8.0 / 8.0) * 8;
+    }
+    default: {
+        return numBytesPerValue * capacity_;
+    }
+    }
+}
+
+void ColumnChunkData::initializeScanState(SegmentState& state, const Column* column) const {
+    if (nullData) {
+        KU_ASSERT(state.nullState);
+        nullData->initializeScanState(*state.nullState, column->getNullColumn());
+    }
+    state.column = column;
+    if (residencyState == ResidencyState::ON_DISK) {
+        state.metadata = metadata;
+        state.numValuesPerPage = state.metadata.compMeta.numValues(LBUG_PAGE_SIZE, dataType);
+
+        state.column->populateExtraChunkState(state);
+    }
+}
+
+void ColumnChunkData::scan(ValueVector& output, offset_t offset, length_t length,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offset + length <= numValues);
+    if (nullData) {
+        nullData->scan(output, offset, length, posInOutputVector);
+    }
+    memcpy(output.getData() + posInOutputVector * numBytesPerValue,
+        getData() + offset * numBytesPerValue, numBytesPerValue * length);
+}
+
+void ColumnChunkData::lookup(offset_t offsetInChunk, ValueVector& output,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offsetInChunk < capacity);
+    output.setNull(posInOutputVector, isNull(offsetInChunk));
+    if (!output.isNull(posInOutputVector)) {
+        memcpy(output.getData() + posInOutputVector * numBytesPerValue,
+            getData() + offsetInChunk * numBytesPerValue, numBytesPerValue);
+    }
+}
+
+void ColumnChunkData::write(ColumnChunkData* chunk, ColumnChunkData* dstOffsets,
+    RelMultiplicity multiplicity) {
+    KU_ASSERT(chunk->dataType.getPhysicalType() == dataType.getPhysicalType() &&
+              dstOffsets->getDataType().getPhysicalType() == PhysicalTypeID::INTERNAL_ID &&
+              chunk->getNumValues() == dstOffsets->getNumValues());
+    for (auto i = 0u; i < dstOffsets->getNumValues(); i++) {
+        const auto dstOffset = dstOffsets->getValue<offset_t>(i);
+        KU_ASSERT(dstOffset < capacity);
+        memcpy(getData() + dstOffset * numBytesPerValue, chunk->getData() + i * numBytesPerValue,
+            numBytesPerValue);
+        numValues = dstOffset >= numValues ? dstOffset + 1 : numValues;
+    }
+    if (nullData || multiplicity == RelMultiplicity::ONE) {
+        for (auto i = 0u; i < dstOffsets->getNumValues(); i++) {
+            const auto dstOffset = dstOffsets->getValue<offset_t>(i);
+            if (multiplicity == RelMultiplicity::ONE && isNull(dstOffset)) {
+                throw CopyException(
+                    stringFormat("Node with offset: {} can only have one neighbour due "
+                                 "to the MANY-ONE/ONE-ONE relationship constraint.",
+                        dstOffset));
+            }
+            if (nullData) {
+                nullData->setNull(dstOffset, chunk->isNull(i));
+            }
+        }
+    }
+    updateInMemoryStats(inMemoryStats, chunk);
+}
+
+// NOTE: This function is only called in LocalTable right now when
+// performing out-of-place committing. LIST has a different logic for
+// handling out-of-place committing as it has to be slided. However,
+// this is unsafe, as this function can also be used for other purposes
+// later. Thus, an assertion is added at the first line.
+void ColumnChunkData::write(const ValueVector* vector, offset_t offsetInVector,
+    offset_t offsetInChunk) {
+    KU_ASSERT(dataType.getPhysicalType() != PhysicalTypeID::BOOL &&
+              dataType.getPhysicalType() != PhysicalTypeID::LIST &&
+              dataType.getPhysicalType() != PhysicalTypeID::ARRAY);
+    if (nullData) {
+        nullData->setNull(offsetInChunk, vector->isNull(offsetInVector));
+    }
+    if (offsetInChunk >= numValues) {
+        numValues = offsetInChunk + 1;
+    }
+    if (!vector->isNull(offsetInVector)) {
+        memcpy(getData() + offsetInChunk * numBytesPerValue,
+            vector->getData() + offsetInVector * numBytesPerValue, numBytesPerValue);
+    }
+    static constexpr uint64_t numValuesToWrite = 1;
+    updateInMemoryStats(inMemoryStats, *vector, offsetInVector, numValuesToWrite);
+}
+
+void ColumnChunkData::write(const ColumnChunkData* srcChunk, offset_t srcOffsetInChunk,
+    offset_t dstOffsetInChunk, offset_t numValuesToCopy) {
+    KU_ASSERT(srcChunk->dataType.getPhysicalType() == dataType.getPhysicalType());
+    if ((dstOffsetInChunk + numValuesToCopy) >= numValues) {
+        numValues = dstOffsetInChunk + numValuesToCopy;
+    }
+    memcpy(getData() + dstOffsetInChunk * numBytesPerValue,
+        srcChunk->getData() + srcOffsetInChunk * numBytesPerValue,
+        numValuesToCopy * numBytesPerValue);
+    if (nullData) {
+        KU_ASSERT(srcChunk->getNullData());
+        nullData->write(srcChunk->getNullData(), srcOffsetInChunk, dstOffsetInChunk,
+            numValuesToCopy);
+    }
+    updateInMemoryStats(inMemoryStats, srcChunk, srcOffsetInChunk, numValuesToCopy);
+}
+
+void ColumnChunkData::resetNumValuesFromMetadata() {
+    KU_ASSERT(residencyState == ResidencyState::ON_DISK);
+    numValues = metadata.numValues;
+    if (nullData) {
+        nullData->resetNumValuesFromMetadata();
+        // FIXME(bmwinger): not always working
+        // KU_ASSERT(numValues == nullData->numValues);
+    }
+}
+
+void ColumnChunkData::setToInMemory() {
+    KU_ASSERT(residencyState == ResidencyState::ON_DISK);
+    KU_ASSERT(capacity == 0 && getBufferSize() == 0);
+    residencyState = ResidencyState::IN_MEMORY;
+    numValues = 0;
+    if (nullData) {
+        nullData->setToInMemory();
+    }
+}
+
+void ColumnChunkData::resize(uint64_t newCapacity) {
+    const auto numBytesAfterResize = getBufferSize(newCapacity);
+    if (numBytesAfterResize > getBufferSize()) {
+        auto resizedBuffer = buffer->getMemoryManager()->allocateBuffer(false, numBytesAfterResize);
+        auto bufferSize = getBufferSize();
+        auto resizedBufferData = resizedBuffer->getBuffer().data();
+        memcpy(resizedBufferData, buffer->getBuffer().data(), bufferSize);
+        memset(resizedBufferData + bufferSize, 0, numBytesAfterResize - bufferSize);
+        buffer = std::move(resizedBuffer);
+    }
+    if (nullData) {
+        nullData->resize(newCapacity);
+    }
+    if (newCapacity > capacity) {
+        capacity = newCapacity;
+    }
+}
+
+void ColumnChunkData::resizeWithoutPreserve(uint64_t newCapacity) {
+    const auto numBytesAfterResize = getBufferSize(newCapacity);
+    if (numBytesAfterResize > getBufferSize()) {
+        auto resizedBuffer = buffer->getMemoryManager()->allocateBuffer(false, numBytesAfterResize);
+        buffer = std::move(resizedBuffer);
+    }
+    if (nullData) {
+        nullData->resize(newCapacity);
+    }
+    if (newCapacity > capacity) {
+        capacity = newCapacity;
+    }
+}
+
+void ColumnChunkData::populateWithDefaultVal(ExpressionEvaluator& defaultEvaluator,
+    uint64_t& numValues_, ColumnStats* newColumnStats) {
+    auto numValuesAppended = 0u;
+    const auto numValuesToPopulate = numValues_;
+    while (numValuesAppended < numValuesToPopulate) {
+        const auto numValuesToAppend =
+            std::min(DEFAULT_VECTOR_CAPACITY, numValuesToPopulate - numValuesAppended);
+        defaultEvaluator.evaluate(numValuesToAppend);
+        auto resultVector = defaultEvaluator.resultVector.get();
+        KU_ASSERT(resultVector->state->getSelVector().getSelSize() == numValuesToAppend);
+        append(resultVector, resultVector->state->getSelVector());
+        if (newColumnStats) {
+            newColumnStats->update(resultVector);
+        }
+        numValuesAppended += numValuesToAppend;
+    }
+}
+
+void ColumnChunkData::copyVectorToBuffer(ValueVector* vector, offset_t startPosInChunk,
+    const SelectionView& selView) {
+    auto bufferToWrite = buffer->getBuffer().data() + startPosInChunk * numBytesPerValue;
+    KU_ASSERT(startPosInChunk + selView.getSelSize() <= capacity);
+    const auto vectorDataToWriteFrom = vector->getData();
+    if (nullData) {
+        nullData->appendNulls(vector, selView, startPosInChunk);
+    }
+    if (selView.isUnfiltered()) {
+        memcpy(bufferToWrite, vectorDataToWriteFrom, selView.getSelSize() * numBytesPerValue);
+    } else {
+        selView.forEach([&](auto pos) {
+            memcpy(bufferToWrite, vectorDataToWriteFrom + pos * numBytesPerValue, numBytesPerValue);
+            bufferToWrite += numBytesPerValue;
+        });
+    }
+}
+
+void ColumnChunkData::setNumValues(uint64_t numValues_) {
+    KU_ASSERT(numValues_ <= capacity);
+    numValues = numValues_;
+    if (nullData) {
+        nullData->setNumValues(numValues_);
+    }
+}
+
+bool ColumnChunkData::numValuesSanityCheck() const {
+    if (nullData) {
+        return numValues == nullData->getNumValues();
+    }
+    return numValues <= capacity;
+}
+
+bool ColumnChunkData::sanityCheck() const {
+    if (nullData) {
+        return nullData->sanityCheck() && numValuesSanityCheck();
+    }
+    return numValues <= capacity;
+}
+
+uint64_t ColumnChunkData::getEstimatedMemoryUsage() const {
+    return buffer->getBuffer().size() + (nullData ? nullData->getEstimatedMemoryUsage() : 0);
+}
+
+void ColumnChunkData::serialize(Serializer& serializer) const {
+    KU_ASSERT(residencyState == ResidencyState::ON_DISK);
+    serializer.writeDebuggingInfo("data_type");
+    dataType.serialize(serializer);
+    serializer.writeDebuggingInfo("metadata");
+    metadata.serialize(serializer);
+    serializer.writeDebuggingInfo("enable_compression");
+    serializer.write<bool>(enableCompression);
+    serializer.writeDebuggingInfo("has_null");
+    serializer.write<bool>(nullData != nullptr);
+    if (nullData) {
+        serializer.writeDebuggingInfo("null_data");
+        nullData->serialize(serializer);
+    }
+}
+
+std::unique_ptr<ColumnChunkData> ColumnChunkData::deserialize(MemoryManager& memoryManager,
+    Deserializer& deSer) {
+    std::string key;
+    ColumnChunkMetadata metadata;
+    bool enableCompression = false;
+    bool hasNull = false;
+    bool initializeToZero = true;
+    deSer.validateDebuggingInfo(key, "data_type");
+    const auto dataType = LogicalType::deserialize(deSer);
+    deSer.validateDebuggingInfo(key, "metadata");
+    metadata = decltype(metadata)::deserialize(deSer);
+    deSer.validateDebuggingInfo(key, "enable_compression");
+    deSer.deserializeValue<bool>(enableCompression);
+    deSer.validateDebuggingInfo(key, "has_null");
+    deSer.deserializeValue<bool>(hasNull);
+    auto chunkData = ColumnChunkFactory::createColumnChunkData(memoryManager, dataType.copy(),
+        enableCompression, metadata, hasNull, initializeToZero);
+    if (hasNull) {
+        deSer.validateDebuggingInfo(key, "null_data");
+        chunkData->nullData = NullChunkData::deserialize(memoryManager, deSer);
+    }
+
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::STRUCT: {
+        StructChunkData::deserialize(deSer, *chunkData);
+    } break;
+    case PhysicalTypeID::STRING: {
+        StringChunkData::deserialize(deSer, *chunkData);
+    } break;
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        ListChunkData::deserialize(deSer, *chunkData);
+    } break;
+    default: {
+        // DO NOTHING.
+    }
+    }
+
+    return chunkData;
+}
+
+void BoolChunkData::append(ValueVector* vector, const SelectionView& selView) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::BOOL);
+    for (auto i = 0u; i < selView.getSelSize(); i++) {
+        const auto pos = selView[i];
+        NullMask::setNull(getData<uint64_t>(), numValues + i, vector->getValue<bool>(pos));
+    }
+    if (nullData) {
+        nullData->appendNulls(vector, selView, numValues);
+    }
+    numValues += selView.getSelSize();
+    updateStats(vector, selView);
+}
+
+void BoolChunkData::append(const ColumnChunkData* other, offset_t startPosInOtherChunk,
+    uint32_t numValuesToAppend) {
+    NullMask::copyNullMask(other->getData<uint64_t>(), startPosInOtherChunk, getData<uint64_t>(),
+        numValues, numValuesToAppend);
+    if (nullData) {
+        nullData->append(other->getNullData(), startPosInOtherChunk, numValuesToAppend);
+    }
+    numValues += numValuesToAppend;
+    updateInMemoryStats(inMemoryStats, other, startPosInOtherChunk, numValuesToAppend);
+}
+
+void BoolChunkData::scan(ValueVector& output, offset_t offset, length_t length,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offset + length <= numValues);
+    if (nullData) {
+        nullData->scan(output, offset, length, posInOutputVector);
+    }
+    for (auto i = 0u; i < length; i++) {
+        output.setValue<bool>(posInOutputVector + i,
+            NullMask::isNull(getData<uint64_t>(), offset + i));
+    }
+}
+
+void BoolChunkData::lookup(offset_t offsetInChunk, ValueVector& output,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offsetInChunk < capacity);
+    output.setNull(posInOutputVector, nullData->isNull(offsetInChunk));
+    if (!output.isNull(posInOutputVector)) {
+        output.setValue<bool>(posInOutputVector,
+            NullMask::isNull(getData<uint64_t>(), offsetInChunk));
+    }
+}
+
+void BoolChunkData::write(ColumnChunkData* chunk, ColumnChunkData* dstOffsets, RelMultiplicity) {
+    KU_ASSERT(chunk->getDataType().getPhysicalType() == PhysicalTypeID::BOOL &&
+              dstOffsets->getDataType().getPhysicalType() == PhysicalTypeID::INTERNAL_ID &&
+              chunk->getNumValues() == dstOffsets->getNumValues());
+    for (auto i = 0u; i < dstOffsets->getNumValues(); i++) {
+        const auto dstOffset = dstOffsets->getValue<offset_t>(i);
+        KU_ASSERT(dstOffset < capacity);
+        NullMask::setNull(getData<uint64_t>(), dstOffset, chunk->getValue<bool>(i));
+        if (nullData) {
+            nullData->setNull(dstOffset, chunk->getNullData()->isNull(i));
+        }
+        numValues = dstOffset >= numValues ? dstOffset + 1 : numValues;
+    }
+    updateInMemoryStats(inMemoryStats, chunk);
+}
+
+void BoolChunkData::write(const ValueVector* vector, offset_t offsetInVector,
+    offset_t offsetInChunk) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::BOOL);
+    KU_ASSERT(offsetInChunk < capacity);
+    const auto valueToSet = vector->getValue<bool>(offsetInVector);
+    setValue(valueToSet, offsetInChunk);
+    if (nullData) {
+        nullData->write(vector, offsetInVector, offsetInChunk);
+    }
+    numValues = offsetInChunk >= numValues ? offsetInChunk + 1 : numValues;
+    if (!vector->isNull(offsetInVector)) {
+        inMemoryStats.update(StorageValue{valueToSet}, dataType.getPhysicalType());
+    }
+}
+
+void BoolChunkData::write(const ColumnChunkData* srcChunk, offset_t srcOffsetInChunk,
+    offset_t dstOffsetInChunk, offset_t numValuesToCopy) {
+    if (nullData) {
+        nullData->write(srcChunk->getNullData(), srcOffsetInChunk, dstOffsetInChunk,
+            numValuesToCopy);
+    }
+    if ((dstOffsetInChunk + numValuesToCopy) >= numValues) {
+        numValues = dstOffsetInChunk + numValuesToCopy;
+    }
+    NullMask::copyNullMask(srcChunk->getData<uint64_t>(), srcOffsetInChunk, getData<uint64_t>(),
+        dstOffsetInChunk, numValuesToCopy);
+    updateInMemoryStats(inMemoryStats, srcChunk, srcOffsetInChunk, numValuesToCopy);
+}
+
+NullMask NullChunkData::getNullMask() const {
+    return NullMask(
+        std::span(getData<uint64_t>(), ceilDiv(capacity, NullMask::NUM_BITS_PER_NULL_ENTRY)),
+        !noNullsGuaranteedInMem());
+}
+
+void NullChunkData::setNull(offset_t pos, bool isNull) {
+    setValue(isNull, pos);
+    // TODO(Guodong): Better let NullChunkData also support `append` a
+    // vector.
+}
+
+void NullChunkData::write(const ValueVector* vector, offset_t offsetInVector,
+    offset_t offsetInChunk) {
+    const bool isNull = vector->isNull(offsetInVector);
+    setValue(isNull, offsetInChunk);
+}
+
+void NullChunkData::write(const ColumnChunkData* srcChunk, offset_t srcOffsetInChunk,
+    offset_t dstOffsetInChunk, offset_t numValuesToCopy) {
+    if (numValuesToCopy == 0) {
+        return;
+    }
+    KU_ASSERT(srcChunk->getBufferSize() >= sizeof(uint64_t));
+    copyFromBuffer(srcChunk->getData<uint64_t>(), srcOffsetInChunk, dstOffsetInChunk,
+        numValuesToCopy);
+}
+
+void NullChunkData::append(const ColumnChunkData* other, offset_t startOffsetInOtherChunk,
+    uint32_t numValuesToAppend) {
+    write(other, startOffsetInOtherChunk, numValues, numValuesToAppend);
+}
+
+bool NullChunkData::haveNoNullsGuaranteed() const {
+    return noNullsGuaranteedInMem() && !metadata.compMeta.max.get<bool>();
+}
+
+bool NullChunkData::haveAllNullsGuaranteed() const {
+    return allNullsGuaranteedInMem() && metadata.compMeta.min.get<bool>();
+}
+
+void NullChunkData::serialize(Serializer& serializer) const {
+    KU_ASSERT(residencyState == ResidencyState::ON_DISK);
+    serializer.writeDebuggingInfo("null_chunk_metadata");
+    metadata.serialize(serializer);
+}
+
+std::unique_ptr<NullChunkData> NullChunkData::deserialize(MemoryManager& memoryManager,
+    Deserializer& deSer) {
+    std::string key;
+    ColumnChunkMetadata metadata;
+    deSer.validateDebuggingInfo(key, "null_chunk_metadata");
+    metadata = decltype(metadata)::deserialize(deSer);
+    // TODO: FIX-ME. enableCompression.
+    return std::make_unique<NullChunkData>(memoryManager, true, metadata);
+}
+
+void NullChunkData::scan(ValueVector& output, offset_t offset, length_t length,
+    sel_t posInOutputVector) const {
+    output.setNullFromBits(getNullMask().getData(), offset, posInOutputVector, length);
+}
+
+void NullChunkData::appendNulls(const ValueVector* vector, const SelectionView& selView,
+    offset_t startPosInChunk) {
+    if (selView.isUnfiltered()) {
+        copyFromBuffer(vector->getNullMask().getData(), 0, startPosInChunk, selView.getSelSize());
+    } else {
+        for (auto i = 0u; i < selView.getSelSize(); i++) {
+            const auto pos = selView[i];
+            setNull(startPosInChunk + i, vector->isNull(pos));
+        }
+    }
+}
+
+void InternalIDChunkData::append(ValueVector* vector, const SelectionView& selView) {
+    switch (vector->dataType.getPhysicalType()) {
+    case PhysicalTypeID::INTERNAL_ID: {
+        copyVectorToBuffer(vector, numValues, selView);
+    } break;
+    case PhysicalTypeID::INT64: {
+        copyInt64VectorToBuffer(vector, numValues, selView);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    numValues += selView.getSelSize();
+}
+
+void InternalIDChunkData::copyVectorToBuffer(ValueVector* vector, offset_t startPosInChunk,
+    const SelectionView& selView) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::INTERNAL_ID);
+    const auto relIDsInVector = reinterpret_cast<internalID_t*>(vector->getData());
+    if (commonTableID == INVALID_TABLE_ID) {
+        commonTableID = relIDsInVector[selView[0]].tableID;
+    }
+    for (auto i = 0u; i < selView.getSelSize(); i++) {
+        const auto pos = selView[i];
+        if (vector->isNull(pos)) {
+            continue;
+        }
+        KU_ASSERT(relIDsInVector[pos].tableID == commonTableID);
+        memcpy(getData() + (startPosInChunk + i) * numBytesPerValue, &relIDsInVector[pos].offset,
+            numBytesPerValue);
+    }
+}
+
+void InternalIDChunkData::copyInt64VectorToBuffer(ValueVector* vector, offset_t startPosInChunk,
+    const SelectionView& selView) const {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::INT64);
+    for (auto i = 0u; i < selView.getSelSize(); i++) {
+        const auto pos = selView[i];
+        if (vector->isNull(pos)) {
+            continue;
+        }
+        memcpy(getData() + (startPosInChunk + i) * numBytesPerValue,
+            &vector->getValue<offset_t>(pos), numBytesPerValue);
+    }
+}
+
+void InternalIDChunkData::scan(ValueVector& output, offset_t offset, length_t length,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offset + length <= numValues);
+    KU_ASSERT(commonTableID != INVALID_TABLE_ID);
+    internalID_t relID;
+    relID.tableID = commonTableID;
+    for (auto i = 0u; i < length; i++) {
+        relID.offset = getValue<offset_t>(offset + i);
+        output.setValue<internalID_t>(posInOutputVector + i, relID);
+    }
+}
+
+void InternalIDChunkData::lookup(offset_t offsetInChunk, ValueVector& output,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offsetInChunk < capacity);
+    internalID_t relID;
+    relID.offset = getValue<offset_t>(offsetInChunk);
+    KU_ASSERT(commonTableID != INVALID_TABLE_ID);
+    relID.tableID = commonTableID;
+    output.setValue<internalID_t>(posInOutputVector, relID);
+}
+
+void InternalIDChunkData::write(const ValueVector* vector, offset_t offsetInVector,
+    offset_t offsetInChunk) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::INTERNAL_ID);
+    const auto relIDsInVector = reinterpret_cast<internalID_t*>(vector->getData());
+    if (commonTableID == INVALID_TABLE_ID) {
+        commonTableID = relIDsInVector[offsetInVector].tableID;
+    }
+    KU_ASSERT(commonTableID == relIDsInVector[offsetInVector].tableID);
+    if (!vector->isNull(offsetInVector)) {
+        memcpy(getData() + offsetInChunk * numBytesPerValue, &relIDsInVector[offsetInVector].offset,
+            numBytesPerValue);
+    }
+    if (offsetInChunk >= numValues) {
+        numValues = offsetInChunk + 1;
+    }
+}
+
+void InternalIDChunkData::append(const ColumnChunkData* other, offset_t startPosInOtherChunk,
+    uint32_t numValuesToAppend) {
+    ColumnChunkData::append(other, startPosInOtherChunk, numValuesToAppend);
+    commonTableID = other->cast<InternalIDChunkData>().commonTableID;
+}
+
+std::optional<NullMask> ColumnChunkData::getNullMask() const {
+    return nullData ? std::optional(nullData->getNullMask()) : std::nullopt;
+}
+
+std::unique_ptr<ColumnChunkData> ColumnChunkFactory::createColumnChunkData(MemoryManager& mm,
+    LogicalType dataType, bool enableCompression, uint64_t capacity, ResidencyState residencyState,
+    bool hasNullData, bool initializeToZero) {
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL: {
+        return std::make_unique<BoolChunkData>(mm, capacity, enableCompression, residencyState,
+            hasNullData);
+    }
+    case PhysicalTypeID::INT64:
+    case PhysicalTypeID::INT32:
+    case PhysicalTypeID::INT16:
+    case PhysicalTypeID::INT8:
+    case PhysicalTypeID::UINT64:
+    case PhysicalTypeID::UINT32:
+    case PhysicalTypeID::UINT16:
+    case PhysicalTypeID::UINT8:
+    case PhysicalTypeID::INT128:
+    case PhysicalTypeID::UINT128:
+    case PhysicalTypeID::DOUBLE:
+    case PhysicalTypeID::FLOAT:
+    case PhysicalTypeID::INTERVAL: {
+        return std::make_unique<ColumnChunkData>(mm, std::move(dataType), capacity,
+            enableCompression, residencyState, hasNullData, initializeToZero);
+    }
+    case PhysicalTypeID::INTERNAL_ID: {
+        return std::make_unique<InternalIDChunkData>(mm, capacity, enableCompression,
+            residencyState);
+    }
+    case PhysicalTypeID::STRING: {
+        return std::make_unique<StringChunkData>(mm, std::move(dataType), capacity,
+            enableCompression, residencyState);
+    }
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        return std::make_unique<ListChunkData>(mm, std::move(dataType), capacity, enableCompression,
+            residencyState);
+    }
+    case PhysicalTypeID::STRUCT: {
+        return std::make_unique<StructChunkData>(mm, std::move(dataType), capacity,
+            enableCompression, residencyState);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+std::unique_ptr<ColumnChunkData> ColumnChunkFactory::createColumnChunkData(MemoryManager& mm,
+    LogicalType dataType, bool enableCompression, ColumnChunkMetadata& metadata, bool hasNullData,
+    bool initializeToZero) {
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL: {
+        return std::make_unique<BoolChunkData>(mm, enableCompression, metadata, hasNullData);
+    }
+    case PhysicalTypeID::INT64:
+    case PhysicalTypeID::INT32:
+    case PhysicalTypeID::INT16:
+    case PhysicalTypeID::INT8:
+    case PhysicalTypeID::UINT64:
+    case PhysicalTypeID::UINT32:
+    case PhysicalTypeID::UINT16:
+    case PhysicalTypeID::UINT8:
+    case PhysicalTypeID::INT128:
+    case PhysicalTypeID::UINT128:
+    case PhysicalTypeID::DOUBLE:
+    case PhysicalTypeID::FLOAT:
+    case PhysicalTypeID::INTERVAL: {
+        return std::make_unique<ColumnChunkData>(mm, std::move(dataType), enableCompression,
+            metadata, hasNullData, initializeToZero);
+    }
+        // Physically, we only materialize offset of INTERNAL_ID, which is same as INT64,
+    case PhysicalTypeID::INTERNAL_ID: {
+        // INTERNAL_ID should never have nulls.
+        return std::make_unique<InternalIDChunkData>(mm, enableCompression, metadata);
+    }
+    case PhysicalTypeID::STRING: {
+        return std::make_unique<StringChunkData>(mm, enableCompression, metadata);
+    }
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST: {
+        return std::make_unique<ListChunkData>(mm, std::move(dataType), enableCompression,
+            metadata);
+    }
+    case PhysicalTypeID::STRUCT: {
+        return std::make_unique<StructChunkData>(mm, std::move(dataType), enableCompression,
+            metadata);
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+bool ColumnChunkData::isNull(offset_t pos) const {
+    return nullData && nullData->isNull(pos);
+}
+
+MemoryManager& ColumnChunkData::getMemoryManager() const {
+    return *buffer->getMemoryManager();
+}
+
+uint8_t* ColumnChunkData::getData() const {
+    return buffer->getBuffer().data();
+}
+uint64_t ColumnChunkData::getBufferSize() const {
+    return buffer->getBuffer().size_bytes();
+}
+
+void ColumnChunkData::loadFromDisk() {
+    buffer->getMemoryManager()->getBufferManager()->getSpillerOrSkip(
+        [&](auto& spiller) { spiller.loadFromDisk(*this); });
+}
+
+SpillResult ColumnChunkData::spillToDisk() {
+    SpillResult spilled{};
+    buffer->getMemoryManager()->getBufferManager()->getSpillerOrSkip(
+        [&](auto& spiller) { spilled = spiller.spillToDisk(*this); });
+    return spilled;
+}
+
+void ColumnChunkData::reclaimStorage(PageAllocator& pageAllocator) {
+    if (nullData) {
+        nullData->reclaimStorage(pageAllocator);
+    }
+    if (residencyState == ResidencyState::ON_DISK) {
+        if (metadata.getStartPageIdx() != INVALID_PAGE_IDX) {
+            pageAllocator.freePageRange(metadata.pageRange);
+        }
+    }
+}
+
+uint64_t ColumnChunkData::getSizeOnDisk() const {
+    // Probably could just return the actual size from the metadata if it's on-disk, but it's not
+    // currently needed for on-disk segments
+    KU_ASSERT(ResidencyState::IN_MEMORY == residencyState);
+    auto metadata = getMetadataToFlush();
+    uint64_t nullSize = 0;
+    if (nullData) {
+        nullSize = nullData->getSizeOnDisk();
+    }
+    return metadata.getNumDataPages(dataType.getPhysicalType()) * common::LBUG_PAGE_SIZE + nullSize;
+}
+
+uint64_t ColumnChunkData::getSizeOnDiskInMemoryStats() const {
+    // Probably could just return the actual size from the metadata if it's on-disk, but it's not
+    // currently needed for on-disk segments
+    KU_ASSERT(ResidencyState::IN_MEMORY == residencyState);
+    uint64_t nullSize = 0;
+    if (nullData) {
+        nullSize = nullData->getSizeOnDiskInMemoryStats();
+    }
+    auto metadata = getMetadataFunction(buffer->getBuffer(), numValues,
+        inMemoryStats.min.value_or(StorageValue{}), inMemoryStats.max.value_or(StorageValue{}));
+    return metadata.getNumDataPages(dataType.getPhysicalType()) * common::LBUG_PAGE_SIZE + nullSize;
+}
+
+std::vector<std::unique_ptr<ColumnChunkData>> ColumnChunkData::split(bool targetMaxSize) const {
+    // FIXME(bmwinger): we either need to split recursively, or detect individual values which bring
+    // the size above MAX_SEGMENT_SIZE, since this will still sometimes produce segments larger than
+    // MAX_SEGMENT_SIZE
+    auto maxSegmentSize = std::max(getMinimumSizeOnDisk(), common::StorageConfig::MAX_SEGMENT_SIZE);
+    auto targetSize =
+        targetMaxSize ? maxSegmentSize : std::min(getSizeOnDisk() / 2, maxSegmentSize);
+    std::vector<std::unique_ptr<ColumnChunkData>> newSegments;
+    uint64_t pos = 0;
+    const uint64_t chunkSize = 64;
+    uint64_t initialCapacity = std::min(chunkSize, numValues);
+    while (pos < numValues) {
+        std::unique_ptr<ColumnChunkData> newSegment =
+            ColumnChunkFactory::createColumnChunkData(getMemoryManager(), getDataType().copy(),
+                isCompressionEnabled(), initialCapacity, ResidencyState::IN_MEMORY, hasNullData());
+
+        while (pos < numValues && newSegment->getSizeOnDiskInMemoryStats() <= targetSize) {
+            if (newSegment->getNumValues() == newSegment->getCapacity()) {
+                newSegment->resize(newSegment->getCapacity() * 2);
+            }
+            auto numValuesToAppendInChunk = std::min(numValues - pos, chunkSize);
+            newSegment->append(this, pos, numValuesToAppendInChunk);
+            pos += numValuesToAppendInChunk;
+        }
+        if (pos < numValues && newSegment->getNumValues() > chunkSize) {
+            // Size exceeded target size, so we should drop the last batch added (unless they are
+            // the only values)
+            pos -= chunkSize;
+            newSegment->truncate(newSegment->getNumValues() - chunkSize);
+        }
+        newSegments.push_back(std::move(newSegment));
+    }
+    return newSegments;
+}
+
+ColumnChunkData::~ColumnChunkData() = default;
+
+uint64_t ColumnChunkData::getMinimumSizeOnDisk() const {
+    if (hasNullData() && nullData->getSizeOnDisk() > 0) {
+        return 2 * LBUG_PAGE_SIZE;
+    }
+    return LBUG_PAGE_SIZE;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk_metadata.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk_metadata.cpp
new file mode 100644
index 0000000000..042ef819b4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk_metadata.cpp
@@ -0,0 +1,241 @@
+#include "storage/table/column_chunk_metadata.h"
+
+#include "alp/decode.hpp"
+#include "alp/encode.hpp"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/system_config.h"
+#include "common/type_utils.h"
+#include "common/types/types.h"
+#include "common/utils.h"
+#include "storage/compression/compression.h"
+#include "storage/compression/float_compression.h"
+
+namespace lbug::storage {
+using namespace common;
+
+ColumnChunkMetadata GetCompressionMetadata::operator()(std::span<const uint8_t> buffer,
+    uint64_t numValues, StorageValue min, StorageValue max) const {
+    if (min == max) {
+        return ColumnChunkMetadata(INVALID_PAGE_IDX, 0, numValues,
+            CompressionMetadata(min, max, CompressionType::CONSTANT));
+    }
+    switch (dataType.getPhysicalType()) {
+    case PhysicalTypeID::BOOL: {
+        return booleanGetMetadata(numValues, min, max);
+    }
+    case PhysicalTypeID::STRING:
+    case PhysicalTypeID::INT64:
+    case PhysicalTypeID::INT32:
+    case PhysicalTypeID::INT16:
+    case PhysicalTypeID::INT8:
+    case PhysicalTypeID::INTERNAL_ID:
+    case PhysicalTypeID::ARRAY:
+    case PhysicalTypeID::LIST:
+    case PhysicalTypeID::UINT64:
+    case PhysicalTypeID::UINT32:
+    case PhysicalTypeID::UINT16:
+    case PhysicalTypeID::UINT8:
+    case PhysicalTypeID::INT128: {
+        return GetBitpackingMetadata(alg, dataType)(buffer, numValues, min, max);
+    }
+    case PhysicalTypeID::DOUBLE: {
+        return GetFloatCompressionMetadata<double>(alg, dataType)(buffer, numValues, min, max);
+    }
+    case PhysicalTypeID::FLOAT: {
+        return GetFloatCompressionMetadata<float>(alg, dataType)(buffer, numValues, min, max);
+    }
+    default: {
+        return uncompressedGetMetadata(dataType.getPhysicalType(), numValues, min, max);
+    }
+    }
+}
+
+ColumnChunkMetadata uncompressedGetMetadata(PhysicalTypeID dataType, uint64_t numValues,
+    StorageValue min, StorageValue max) {
+    auto numPages = 0;
+    if (getDataTypeSizeInChunk(dataType) > 0) {
+        const auto numValuesPerPage = Uncompressed::numValues(LBUG_PAGE_SIZE, dataType);
+        numPages = ceilDiv(numValues, numValuesPerPage);
+    }
+    return ColumnChunkMetadata(INVALID_PAGE_IDX, numPages, numValues,
+        CompressionMetadata(min, max, CompressionType::UNCOMPRESSED));
+}
+
+ColumnChunkMetadata booleanGetMetadata(uint64_t numValues, StorageValue min, StorageValue max) {
+    return ColumnChunkMetadata(INVALID_PAGE_IDX,
+        ceilDiv(ceilDiv(numValues, uint64_t{8}), LBUG_PAGE_SIZE), numValues,
+        CompressionMetadata(min, max, CompressionType::BOOLEAN_BITPACKING));
+}
+
+void ColumnChunkMetadata::serialize(common::Serializer& serializer) const {
+    serializer.write(pageRange.startPageIdx);
+    serializer.write(pageRange.numPages);
+    serializer.write(numValues);
+    compMeta.serialize(serializer);
+}
+
+ColumnChunkMetadata ColumnChunkMetadata::deserialize(common::Deserializer& deserializer) {
+    ColumnChunkMetadata ret;
+    deserializer.deserializeValue(ret.pageRange.startPageIdx);
+    deserializer.deserializeValue(ret.pageRange.numPages);
+    deserializer.deserializeValue(ret.numValues);
+    ret.compMeta = decltype(ret.compMeta)::deserialize(deserializer);
+
+    return ret;
+}
+
+page_idx_t ColumnChunkMetadata::getNumDataPages(PhysicalTypeID dataType) const {
+    switch (compMeta.compression) {
+    case CompressionType::ALP: {
+        return TypeUtils::visit(
+            dataType,
+            [this]<std::floating_point T>(T) -> page_idx_t {
+                return FloatCompression<T>::getNumDataPages(getNumPages(), compMeta);
+            },
+            [](auto) -> page_idx_t { KU_UNREACHABLE; });
+    }
+    default:
+        return getNumPages();
+    }
+}
+
+ColumnChunkMetadata GetBitpackingMetadata::operator()(std::span<const uint8_t> /*buffer*/,
+    uint64_t numValues, StorageValue min, StorageValue max) {
+    // For supported types, min and max may be null if all values are null
+    // Compression is supported in this case
+    // Unsupported types always return a dummy value (where min != max)
+    // so that we don't constant compress them
+    auto compMeta = CompressionMetadata(min, max, alg->getCompressionType());
+    if (alg->getCompressionType() == CompressionType::INTEGER_BITPACKING) {
+        TypeUtils::visit(
+            dataType.getPhysicalType(),
+            [&]<IntegerBitpackingType T>(T) {
+                // If integer bitpacking bitwidth is the maximum, bitpacking cannot be used
+                // and has poor performance compared to uncompressed
+                if (IntegerBitpacking<T>::getPackingInfo(compMeta).bitWidth >= sizeof(T) * 8) {
+                    compMeta = CompressionMetadata(min, max, CompressionType::UNCOMPRESSED);
+                }
+            },
+            [&](auto) {});
+    }
+    const auto numValuesPerPage = compMeta.numValues(LBUG_PAGE_SIZE, dataType);
+    const auto numPages =
+        numValuesPerPage == UINT64_MAX ?
+            0 :
+            numValues / numValuesPerPage + (numValues % numValuesPerPage == 0 ? 0 : 1);
+    return ColumnChunkMetadata(INVALID_PAGE_IDX, numPages, numValues, compMeta);
+}
+
+namespace {
+ColumnChunkMetadata getConstantFloatMetadata(PhysicalTypeID physicalType, uint64_t numValues,
+    StorageValue min, StorageValue max) {
+    return {INVALID_PAGE_IDX, 0, numValues,
+        CompressionMetadata(min, max, CompressionType::CONSTANT, alp::state{}, StorageValue{0},
+            StorageValue{0}, physicalType)};
+}
+
+template<std::floating_point T>
+alp::state getAlpMetadata(const T* buffer, uint64_t numValues) {
+    alp::state alpMetadata;
+    std::vector<T> sampleBuffer(alp::config::SAMPLES_PER_ROWGROUP);
+    alp::AlpEncode<T>::init(buffer, 0, numValues, sampleBuffer.data(), alpMetadata);
+
+    if (alpMetadata.scheme == alp::SCHEME::ALP) {
+        if (alpMetadata.k_combinations > 1) {
+            alp::AlpEncode<T>::find_best_exponent_factor_from_combinations(
+                alpMetadata.best_k_combinations, alpMetadata.k_combinations, buffer, numValues,
+                alpMetadata.fac, alpMetadata.exp);
+        } else {
+            KU_ASSERT(alpMetadata.best_k_combinations.size() == 1);
+            alpMetadata.exp = alpMetadata.best_k_combinations[0].first;
+            alpMetadata.fac = alpMetadata.best_k_combinations[0].second;
+        }
+    }
+
+    return alpMetadata;
+}
+
+template<std::floating_point T>
+CompressionMetadata createFloatMetadata(CompressionType compressionType,
+    PhysicalTypeID physicalType, std::span<const T> src, alp::state& alpMetadata, StorageValue min,
+    StorageValue max) {
+    using EncodedType = typename FloatCompression<T>::EncodedType;
+
+    offset_vec_t unsuccessfulEncodeIdxes;
+    std::vector<EncodedType> floatEncodedValues(src.size());
+    std::optional<EncodedType> firstSuccessfulEncode;
+    size_t exceptionCount = 0;
+    for (offset_t i = 0; i < src.size(); ++i) {
+        const T& val = src[i];
+        const auto encoded_value =
+            alp::AlpEncode<T>::encode_value(val, alpMetadata.fac, alpMetadata.exp);
+        const auto decoded_value =
+            alp::AlpDecode<T>::decode_value(encoded_value, alpMetadata.fac, alpMetadata.exp);
+
+        if (val == decoded_value) {
+            floatEncodedValues[i] = encoded_value;
+            if (!firstSuccessfulEncode.has_value()) {
+                firstSuccessfulEncode = encoded_value;
+            }
+        } else {
+            unsuccessfulEncodeIdxes.push_back(i);
+            ++exceptionCount;
+        }
+    }
+    alpMetadata.exceptions_count = exceptionCount;
+
+    if (firstSuccessfulEncode.has_value()) {
+        for (auto unsuccessfulEncodeIdx : unsuccessfulEncodeIdxes) {
+            floatEncodedValues[unsuccessfulEncodeIdx] = firstSuccessfulEncode.value();
+        }
+    }
+
+    const auto& [minEncoded, maxEncoded] =
+        std::minmax_element(floatEncodedValues.begin(), floatEncodedValues.end());
+
+    return CompressionMetadata(min, max, compressionType, alpMetadata, StorageValue{*minEncoded},
+        StorageValue{*maxEncoded}, physicalType);
+}
+} // namespace
+
+template<std::floating_point T>
+ColumnChunkMetadata GetFloatCompressionMetadata<T>::operator()(std::span<const uint8_t> buffer,
+    uint64_t numValues, StorageValue min, StorageValue max) {
+    const PhysicalTypeID physicalType =
+        std::same_as<T, double> ? PhysicalTypeID::DOUBLE : PhysicalTypeID::FLOAT;
+
+    if (min == max) {
+        return getConstantFloatMetadata(physicalType, numValues, min, max);
+    }
+
+    if (numValues == 0) {
+        return uncompressedGetMetadata(physicalType, numValues, min, max);
+    }
+
+    std::span<const T> castedBuffer{reinterpret_cast<const T*>(buffer.data()), (size_t)numValues};
+    alp::state alpMetadata = getAlpMetadata<T>(castedBuffer.data(), numValues);
+    if (alpMetadata.scheme != alp::SCHEME::ALP) {
+        return uncompressedGetMetadata(physicalType, numValues, min, max);
+    }
+
+    const auto compMeta = createFloatMetadata(alg->getCompressionType(), physicalType, castedBuffer,
+        alpMetadata, min, max);
+    const auto* floatMetadata = compMeta.floatMetadata();
+    const auto exceptionCount = floatMetadata->exceptionCount;
+
+    if (exceptionCount * FloatCompression<T>::MAX_EXCEPTION_FACTOR >= numValues) {
+        return uncompressedGetMetadata(physicalType, numValues, min, max);
+    }
+
+    const auto numValuesPerPage = compMeta.numValues(LBUG_PAGE_SIZE, dataType);
+    const auto numPagesForEncoded = ceilDiv(numValues, numValuesPerPage);
+    const auto numPagesForExceptions =
+        EncodeException<T>::numPagesFromExceptions(floatMetadata->exceptionCapacity);
+    return ColumnChunkMetadata(INVALID_PAGE_IDX, numPagesForEncoded + numPagesForExceptions,
+        numValues, compMeta);
+}
+
+template class GetFloatCompressionMetadata<float>;
+template class GetFloatCompressionMetadata<double>;
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk_stats.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk_stats.cpp
new file mode 100644
index 0000000000..4f7188e9cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_chunk_stats.cpp
@@ -0,0 +1,62 @@
+#include "storage/table/column_chunk_stats.h"
+
+#include "common/type_utils.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/table/column_chunk_data.h"
+
+namespace lbug {
+namespace storage {
+
+void ColumnChunkStats::update(const ColumnChunkData& data, uint64_t offset, uint64_t numValues,
+    common::PhysicalTypeID physicalType) {
+    const bool isStorageValueType =
+        common::TypeUtils::visit(physicalType, []<typename T>(T) { return StorageValueType<T>; });
+    if (isStorageValueType || physicalType == common::PhysicalTypeID::INTERNAL_ID) {
+        auto [minVal, maxVal] = getMinMaxStorageValue(data, offset, numValues, physicalType);
+        update(minVal, maxVal, physicalType);
+    }
+}
+
+void ColumnChunkStats::update(const common::ValueVector& data, uint64_t offset, uint64_t numValues,
+    common::PhysicalTypeID physicalType) {
+    const bool isStorageValueType =
+        common::TypeUtils::visit(physicalType, []<typename T>(T) { return StorageValueType<T>; });
+    if (isStorageValueType || physicalType == common::PhysicalTypeID::INTERNAL_ID) {
+        auto [minVal, maxVal] = getMinMaxStorageValue(data, offset, numValues, physicalType);
+        update(minVal, maxVal, physicalType);
+    }
+}
+
+void ColumnChunkStats::update(std::optional<StorageValue> newMin,
+    std::optional<StorageValue> newMax, common::PhysicalTypeID dataType) {
+    if (!min.has_value() || (newMin.has_value() && min->gt(*newMin, dataType))) {
+        min = newMin;
+    }
+    if (!max.has_value() || (newMax.has_value() && newMax->gt(*max, dataType))) {
+        max = newMax;
+    }
+}
+
+void ColumnChunkStats::update(StorageValue val, common::PhysicalTypeID dataType) {
+    if (!min.has_value() || min->gt(val, dataType)) {
+        min = val;
+    }
+    if (!max.has_value() || val.gt(*max, dataType)) {
+        max = val;
+    }
+}
+
+void ColumnChunkStats::reset() {
+    *this = {};
+}
+
+void MergedColumnChunkStats::merge(const MergedColumnChunkStats& o,
+    common::PhysicalTypeID dataType) {
+    stats.update(o.stats.min, o.stats.max, dataType);
+    guaranteedNoNulls = guaranteedNoNulls && o.guaranteedNoNulls;
+    guaranteedAllNulls = guaranteedAllNulls && o.guaranteedAllNulls;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_reader_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_reader_writer.cpp
new file mode 100644
index 0000000000..b2c0b015c0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/column_reader_writer.cpp
@@ -0,0 +1,457 @@
+#include "storage/table/column_reader_writer.h"
+
+#include "alp/encode.hpp"
+#include "common/utils.h"
+#include "common/vector/value_vector.h"
+#include "storage/compression/float_compression.h"
+#include "storage/file_handle.h"
+#include "storage/shadow_utils.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/column_chunk_metadata.h"
+#include <concepts>
+
+namespace lbug::storage {
+
+using namespace common;
+using namespace transaction;
+
+namespace {
+[[maybe_unused]] bool isPageIdxValid(page_idx_t pageIdx, const ColumnChunkMetadata& metadata) {
+    return (metadata.getStartPageIdx() <= pageIdx &&
+               pageIdx < metadata.getStartPageIdx() + metadata.getNumPages()) ||
+           (pageIdx == INVALID_PAGE_IDX && metadata.compMeta.isConstant());
+}
+
+template<typename T, typename InputType, typename ElementType>
+concept WriteToPageHelper = requires(T obj, InputType input, offset_t offset, ElementType element) {
+    { obj.getValue(offset) } -> std::same_as<ElementType>;
+    { obj.setValue(offset, element) };
+    { obj.getData() } -> std::same_as<InputType>;
+} && std::is_constructible_v<T, InputType, size_t>;
+
+template<std::floating_point T>
+struct WriteToBufferHelper {
+    WriteToBufferHelper(const uint8_t* inputBuffer, size_t numValues)
+        : inputBuffer(inputBuffer),
+          outputBuffer(std::make_unique<uint8_t[]>(numValues * sizeof(T))) {}
+    T getValue(offset_t offset) const { return reinterpret_cast<const T*>(inputBuffer)[offset]; }
+    void setValue(offset_t offset, T element) {
+        reinterpret_cast<T*>(outputBuffer.get())[offset] = element;
+    }
+    const uint8_t* getData() const { return outputBuffer.get(); }
+
+    const uint8_t* inputBuffer;
+    std::unique_ptr<uint8_t[]> outputBuffer;
+};
+static_assert(WriteToPageHelper<WriteToBufferHelper<double>, const uint8_t*, double>);
+static_assert(WriteToPageHelper<WriteToBufferHelper<float>, const uint8_t*, float>);
+
+template<std::floating_point T>
+struct WriteToVectorHelper {
+    explicit WriteToVectorHelper(ValueVector* inputVec, size_t /*numValues*/)
+        : inputVec(inputVec),
+          outputVec(std::is_same_v<double, T> ? LogicalTypeID::DOUBLE : LogicalTypeID::FLOAT) {}
+    T getValue(offset_t offset) const { return inputVec->getValue<T>(offset); }
+    void setValue(offset_t offset, T element) { outputVec.setValue(offset, element); }
+    ValueVector* getData() { return &outputVec; }
+
+    ValueVector* inputVec;
+    ValueVector outputVec;
+};
+static_assert(WriteToPageHelper<WriteToVectorHelper<double>, ValueVector*, double>);
+static_assert(WriteToPageHelper<WriteToVectorHelper<float>, ValueVector*, float>);
+
+template<typename InputType, std::floating_point T>
+decltype(auto) getWriteToPageBufferHelper(InputType input, size_t numValues) {
+    if constexpr (std::is_same_v<InputType, const uint8_t*>) {
+        return WriteToBufferHelper<T>(input, numValues);
+    } else {
+        return WriteToVectorHelper<T>(input, numValues);
+    }
+}
+
+template<std::floating_point T>
+class FloatColumnReadWriter;
+
+class DefaultColumnReadWriter final : public ColumnReadWriter {
+public:
+    DefaultColumnReadWriter(FileHandle* dataFH, ShadowFile* shadowFile)
+        : ColumnReadWriter(dataFH, shadowFile) {}
+
+    void readCompressedValueToPage(const SegmentState& state, common::offset_t offsetInSegment,
+        uint8_t* result, uint32_t offsetInResult,
+        const read_value_from_page_func_t<uint8_t*>& readFunc) override {
+        auto cursor = getPageCursorForOffsetInGroup(offsetInSegment,
+            state.metadata.getStartPageIdx(), state.numValuesPerPage);
+        readCompressedValue<uint8_t*>(state.metadata, cursor, offsetInSegment, result,
+            offsetInResult, readFunc);
+    }
+
+    void readCompressedValueToVector(const SegmentState& state, common::offset_t offsetInSegment,
+        common::ValueVector* result, uint32_t offsetInResult,
+        const read_value_from_page_func_t<common::ValueVector*>& readFunc) override {
+        auto cursor = getPageCursorForOffsetInGroup(offsetInSegment,
+            state.metadata.getStartPageIdx(), state.numValuesPerPage);
+        readCompressedValue<ValueVector*>(state.metadata, cursor, offsetInSegment, result,
+            offsetInResult, readFunc);
+    }
+
+    uint64_t readCompressedValuesToPage(const SegmentState& state, uint8_t* result,
+        uint32_t startOffsetInResult, uint64_t startOffsetInSegment, uint64_t length,
+        const read_values_from_page_func_t<uint8_t*>& readFunc,
+        const std::optional<filter_func_t>& filterFunc) override {
+        return readCompressedValues(state, result, startOffsetInResult, startOffsetInSegment,
+            length, readFunc, filterFunc);
+    }
+
+    uint64_t readCompressedValuesToVector(const SegmentState& state, common::ValueVector* result,
+        uint32_t startOffsetInResult, uint64_t startOffsetInSegment, uint64_t length,
+        const read_values_from_page_func_t<common::ValueVector*>& readFunc,
+        const std::optional<filter_func_t>& filterFunc) override {
+        return readCompressedValues(state, result, startOffsetInResult, startOffsetInSegment,
+            length, readFunc, filterFunc);
+    }
+
+    void writeValueToPageFromVector(SegmentState& state, common::offset_t offsetInSegment,
+        common::ValueVector* vectorToWriteFrom, uint32_t posInVectorToWriteFrom,
+        const write_values_from_vector_func_t& writeFromVectorFunc) override {
+        writeValuesToPage(state, offsetInSegment, vectorToWriteFrom, posInVectorToWriteFrom, 1,
+            writeFromVectorFunc, &vectorToWriteFrom->getNullMask());
+    }
+
+    void writeValuesToPageFromBuffer(SegmentState& state, offset_t dstOffset, const uint8_t* data,
+        const NullMask* nullChunkData, offset_t srcOffset, offset_t numValues,
+        const write_values_func_t& writeFunc) override {
+        writeValuesToPage(state, dstOffset, data, srcOffset, numValues, writeFunc, nullChunkData);
+    }
+
+    template<typename InputType, typename... AdditionalArgs>
+    void writeValuesToPage(SegmentState& state, offset_t dstOffset, InputType data,
+        offset_t srcOffset, offset_t numValues,
+        const write_values_to_page_func_t<InputType, AdditionalArgs...>& writeFunc,
+        const NullMask* nullMask) {
+        auto numValuesWritten = 0u;
+        auto cursor = getPageCursorForOffsetInGroup(dstOffset, state.metadata.getStartPageIdx(),
+            state.numValuesPerPage);
+        while (numValuesWritten < numValues) {
+            KU_ASSERT(
+                cursor.pageIdx == INVALID_PAGE_IDX /*constant compression*/ ||
+                cursor.pageIdx < state.metadata.getStartPageIdx() + state.metadata.getNumPages());
+            auto numValuesToWriteInPage = std::min(numValues - numValuesWritten,
+                state.numValuesPerPage - cursor.elemPosInPage);
+            updatePageWithCursor(cursor, [&](auto frame, auto offsetInPage) {
+                if constexpr (std::is_same_v<InputType, ValueVector*>) {
+                    writeFunc(frame, offsetInPage, data, srcOffset + numValuesWritten,
+                        numValuesToWriteInPage, state.metadata.compMeta);
+                } else {
+                    writeFunc(frame, offsetInPage, data, srcOffset + numValuesWritten,
+                        numValuesToWriteInPage, state.metadata.compMeta, nullMask);
+                }
+            });
+            numValuesWritten += numValuesToWriteInPage;
+            cursor.nextPage();
+        }
+    }
+
+    template<typename OutputType>
+    void readCompressedValue(const ColumnChunkMetadata& metadata, PageCursor cursor,
+        common::offset_t /*offsetInSegment*/, OutputType result, uint32_t offsetInResult,
+        const read_value_from_page_func_t<OutputType>& readFunc) {
+
+        readFromPage(cursor.pageIdx, [&](uint8_t* frame) -> void {
+            readFunc(frame, cursor, result, offsetInResult, 1 /* numValuesToRead */,
+                metadata.compMeta);
+        });
+    }
+
+    template<typename OutputType>
+    uint64_t readCompressedValues(const SegmentState& state, OutputType result,
+        uint32_t startOffsetInResult, uint64_t startOffsetInSegment, uint64_t length,
+        const read_values_from_page_func_t<OutputType>& readFunc,
+        const std::optional<filter_func_t>& filterFunc) {
+        const ColumnChunkMetadata& chunkMeta = state.metadata;
+        if (length == 0) {
+            return 0;
+        }
+
+        auto pageCursor = getPageCursorForOffsetInGroup(startOffsetInSegment,
+            chunkMeta.getStartPageIdx(), state.numValuesPerPage);
+        KU_ASSERT(isPageIdxValid(pageCursor.pageIdx, chunkMeta));
+
+        uint64_t numValuesScanned = 0;
+        while (numValuesScanned < length) {
+            uint64_t numValuesToScanInPage = std::min(
+                state.numValuesPerPage - pageCursor.elemPosInPage, length - numValuesScanned);
+            KU_ASSERT(isPageIdxValid(pageCursor.pageIdx, chunkMeta));
+            if (!filterFunc.has_value() ||
+                filterFunc.value()(numValuesScanned, numValuesScanned + numValuesToScanInPage)) {
+
+                const auto readFromPageFunc = [&](uint8_t* frame) -> void {
+                    readFunc(frame, pageCursor, result, numValuesScanned + startOffsetInResult,
+                        numValuesToScanInPage, chunkMeta.compMeta);
+                };
+                readFromPage(pageCursor.pageIdx, std::cref(readFromPageFunc));
+            }
+            numValuesScanned += numValuesToScanInPage;
+            pageCursor.nextPage();
+        }
+
+        return numValuesScanned;
+    }
+};
+
+template<std::floating_point T>
+class FloatColumnReadWriter final : public ColumnReadWriter {
+public:
+    FloatColumnReadWriter(FileHandle* dataFH, ShadowFile* shadowFile)
+        : ColumnReadWriter(dataFH, shadowFile),
+          defaultReader(std::make_unique<DefaultColumnReadWriter>(dataFH, shadowFile)) {}
+
+    void readCompressedValueToPage(const SegmentState& state, common::offset_t offsetInSegment,
+        uint8_t* result, uint32_t offsetInResult,
+        const read_value_from_page_func_t<uint8_t*>& readFunc) override {
+        readCompressedValue<uint8_t*>(state, offsetInSegment, result, offsetInResult, readFunc);
+    }
+
+    void readCompressedValueToVector(const SegmentState& state, common::offset_t offsetInSegment,
+        common::ValueVector* result, uint32_t offsetInResult,
+        const read_value_from_page_func_t<common::ValueVector*>& readFunc) override {
+        readCompressedValue<ValueVector*>(state, offsetInSegment, result, offsetInResult, readFunc);
+    }
+
+    uint64_t readCompressedValuesToPage(const SegmentState& state, uint8_t* result,
+        uint32_t startOffsetInResult, uint64_t startOffsetInSegment, uint64_t length,
+        const read_values_from_page_func_t<uint8_t*>& readFunc,
+        const std::optional<filter_func_t>& filterFunc) override {
+        return readCompressedValues(state, result, startOffsetInResult, startOffsetInSegment,
+            length, readFunc, filterFunc);
+    }
+
+    uint64_t readCompressedValuesToVector(const SegmentState& state, common::ValueVector* result,
+        uint32_t startOffsetInResult, uint64_t startOffsetInSegment, uint64_t length,
+        const read_values_from_page_func_t<common::ValueVector*>& readFunc,
+        const std::optional<filter_func_t>& filterFunc) override {
+        return readCompressedValues(state, result, startOffsetInResult, startOffsetInSegment,
+            length, readFunc, filterFunc);
+    }
+
+    void writeValueToPageFromVector(SegmentState& state, common::offset_t offsetInSegment,
+        common::ValueVector* vectorToWriteFrom, uint32_t posInVectorToWriteFrom,
+        const write_values_from_vector_func_t& writeFromVectorFunc) override {
+        if (state.metadata.compMeta.compression != CompressionType::ALP) {
+            return defaultReader->writeValueToPageFromVector(state, offsetInSegment,
+                vectorToWriteFrom, posInVectorToWriteFrom, writeFromVectorFunc);
+        }
+
+        writeValuesToPage(state, offsetInSegment, vectorToWriteFrom, posInVectorToWriteFrom, 1,
+            writeFromVectorFunc, &vectorToWriteFrom->getNullMask());
+    }
+
+    void writeValuesToPageFromBuffer(SegmentState& state, offset_t dstOffset, const uint8_t* data,
+        const NullMask* nullChunkData, offset_t srcOffset, offset_t numValues,
+        const write_values_func_t& writeFunc) override {
+        if (state.metadata.compMeta.compression != CompressionType::ALP) {
+            defaultReader->writeValuesToPageFromBuffer(state, dstOffset, data, nullChunkData,
+                srcOffset, numValues, writeFunc);
+            return;
+        }
+
+        writeValuesToPage(state, dstOffset, data, srcOffset, numValues, writeFunc, nullChunkData);
+    }
+
+private:
+    template<typename OutputType>
+    void patchFloatExceptions(const SegmentState& state, offset_t startOffsetInChunk,
+        size_t numValuesToScan, OutputType result, offset_t startOffsetInResult,
+        const std::optional<filter_func_t>& filterFunc) {
+        auto* exceptionChunk = state.getExceptionChunkConst<T>();
+        offset_t curExceptionIdx =
+            exceptionChunk->findFirstExceptionAtOrPastOffset(startOffsetInChunk);
+        for (; curExceptionIdx < exceptionChunk->getExceptionCount(); ++curExceptionIdx) {
+            const auto curException = exceptionChunk->getExceptionAt(curExceptionIdx);
+            KU_ASSERT(curExceptionIdx == 0 ||
+                      curException.posInChunk >
+                          exceptionChunk->getExceptionAt(curExceptionIdx - 1).posInChunk);
+            KU_ASSERT(curException.posInChunk >= curExceptionIdx);
+            if (curException.posInChunk >= startOffsetInChunk + numValuesToScan) {
+                break;
+            }
+            const offset_t offsetInResult =
+                startOffsetInResult + curException.posInChunk - startOffsetInChunk;
+            if (!filterFunc.has_value() || filterFunc.value()(offsetInResult, offsetInResult + 1)) {
+                if constexpr (std::is_same_v<uint8_t*, OutputType>) {
+                    reinterpret_cast<T*>(result)[offsetInResult] = curException.value;
+                } else {
+                    static_assert(std::is_same_v<ValueVector*, std::remove_cvref_t<OutputType>>);
+                    reinterpret_cast<T*>(result->getData())[offsetInResult] = curException.value;
+                }
+            }
+        }
+    }
+
+    template<typename OutputType>
+    void readCompressedValue(const SegmentState& state, common::offset_t offsetInSegment,
+        OutputType result, uint32_t offsetInResult,
+        const read_value_from_page_func_t<OutputType>& readFunc) {
+        RUNTIME_CHECK(const ColumnChunkMetadata& metadata = state.metadata);
+        KU_ASSERT(metadata.compMeta.compression == CompressionType::ALP ||
+                  metadata.compMeta.compression == CompressionType::CONSTANT ||
+                  metadata.compMeta.compression == CompressionType::UNCOMPRESSED);
+        std::optional<filter_func_t> filterFunc{};
+        readCompressedValues(state, result, offsetInResult, offsetInSegment, 1, readFunc,
+            filterFunc);
+    }
+
+    template<typename OutputType>
+    uint64_t readCompressedValues(const SegmentState& state, OutputType result,
+        uint32_t startOffsetInResult, uint64_t startOffsetInSegment, uint64_t length,
+        const read_values_from_page_func_t<OutputType>& readFunc,
+        const std::optional<filter_func_t>& filterFunc) {
+        const ColumnChunkMetadata& metadata = state.metadata;
+        KU_ASSERT(metadata.compMeta.compression == CompressionType::ALP ||
+                  metadata.compMeta.compression == CompressionType::CONSTANT ||
+                  metadata.compMeta.compression == CompressionType::UNCOMPRESSED);
+
+        const uint64_t numValuesScanned =
+            defaultReader->readCompressedValues(state, result, startOffsetInResult,
+                startOffsetInSegment, length, readFunc, std::optional<filter_func_t>{filterFunc});
+
+        if (metadata.compMeta.compression == CompressionType::ALP && numValuesScanned > 0) {
+            // we pass in copies of the filter func as it can hold state which may need resetting
+            // between scanning passes
+            patchFloatExceptions(state, startOffsetInSegment, length, result, startOffsetInResult,
+                std::optional<filter_func_t>{filterFunc});
+        }
+
+        return numValuesScanned;
+    }
+
+    template<typename InputType, typename... AdditionalArgs>
+    void writeValuesToPage(SegmentState& state, offset_t offsetInSegment, InputType data,
+        uint32_t srcOffset, size_t numValues,
+        const write_values_to_page_func_t<InputType, AdditionalArgs...>& writeFunc,
+        const NullMask* nullMask) {
+        const ColumnChunkMetadata& metadata = state.metadata;
+
+        auto* exceptionChunk = state.getExceptionChunk<T>();
+
+        auto writeToPageBufferHelper = getWriteToPageBufferHelper<InputType, T>(data, numValues);
+
+        const auto bitpackHeader = FloatCompression<T>::getBitpackInfo(state.metadata.compMeta);
+        offset_t curExceptionIdx =
+            exceptionChunk->findFirstExceptionAtOrPastOffset(offsetInSegment);
+
+        const auto maxWrittenPosInChunk = offsetInSegment + numValues;
+        uint32_t curExceptionPosInChunk =
+            (curExceptionIdx < exceptionChunk->getExceptionCount()) ?
+                exceptionChunk->getExceptionAt(curExceptionIdx).posInChunk :
+                maxWrittenPosInChunk;
+
+        for (size_t i = 0; i < numValues; ++i) {
+            const size_t writeOffset = offsetInSegment + i;
+            const size_t readOffset = srcOffset + i;
+
+            if (nullMask && nullMask->isNull(readOffset)) {
+                continue;
+            }
+
+            while (curExceptionPosInChunk < writeOffset) {
+                ++curExceptionIdx;
+                if (curExceptionIdx < exceptionChunk->getExceptionCount()) {
+                    curExceptionPosInChunk =
+                        exceptionChunk->getExceptionAt(curExceptionIdx).posInChunk;
+                } else {
+                    curExceptionPosInChunk = maxWrittenPosInChunk;
+                }
+            }
+
+            const T newValue = writeToPageBufferHelper.getValue(readOffset);
+            const auto* floatMetadata = metadata.compMeta.floatMetadata();
+            const auto encodedValue =
+                alp::AlpEncode<T>::encode_value(newValue, floatMetadata->fac, floatMetadata->exp);
+            const T decodedValue = alp::AlpDecode<T>::decode_value(encodedValue, floatMetadata->fac,
+                floatMetadata->exp);
+
+            bool newValueIsException = newValue != decodedValue;
+            writeToPageBufferHelper.setValue(i,
+                newValueIsException ? bitpackHeader.offset : newValue);
+
+            // if the previous value was an exception
+            // either overwrite it (if the new value is also an exception) or remove it
+            if (curExceptionPosInChunk == writeOffset) {
+                if (newValueIsException) {
+                    exceptionChunk->writeException(
+                        EncodeException<T>{newValue, safeIntegerConversion<uint32_t>(writeOffset)},
+                        curExceptionIdx);
+                } else {
+                    exceptionChunk->removeExceptionAt(curExceptionIdx);
+                }
+            } else if (newValueIsException) {
+                exceptionChunk->addException(
+                    EncodeException<T>{newValue, safeIntegerConversion<uint32_t>(writeOffset)});
+            }
+        }
+
+        defaultReader->writeValuesToPage(state, offsetInSegment, writeToPageBufferHelper.getData(),
+            0, numValues, writeFunc, nullMask);
+    }
+
+    std::unique_ptr<DefaultColumnReadWriter> defaultReader;
+};
+
+} // namespace
+
+std::unique_ptr<ColumnReadWriter> ColumnReadWriterFactory::createColumnReadWriter(
+    PhysicalTypeID dataType, FileHandle* dataFH, ShadowFile* shadowFile) {
+    switch (dataType) {
+    case PhysicalTypeID::FLOAT:
+        return std::make_unique<FloatColumnReadWriter<float>>(dataFH, shadowFile);
+    case PhysicalTypeID::DOUBLE:
+        return std::make_unique<FloatColumnReadWriter<double>>(dataFH, shadowFile);
+    default:
+        return std::make_unique<DefaultColumnReadWriter>(dataFH, shadowFile);
+    }
+}
+
+ColumnReadWriter::ColumnReadWriter(FileHandle* dataFH, ShadowFile* shadowFile)
+    : dataFH(dataFH), shadowFile(shadowFile) {}
+
+void ColumnReadWriter::readFromPage(page_idx_t pageIdx,
+    const std::function<void(uint8_t*)>& readFunc) const {
+    // For constant compression, call read on a nullptr since there is no data on disk and
+    // decompression only requires metadata
+    if (pageIdx == INVALID_PAGE_IDX) {
+        return readFunc(nullptr);
+    }
+    dataFH->optimisticReadPage(pageIdx, readFunc);
+}
+
+void ColumnReadWriter::updatePageWithCursor(PageCursor cursor,
+    const std::function<void(uint8_t*, offset_t)>& writeOp) const {
+    if (cursor.pageIdx == INVALID_PAGE_IDX) {
+        writeOp(nullptr, cursor.elemPosInPage);
+        return;
+    }
+    KU_ASSERT(cursor.pageIdx < dataFH->getNumPages());
+
+    ShadowUtils::updatePage(*dataFH, cursor.pageIdx, false /*insertingNewPage*/, *shadowFile,
+        [&](auto frame) { writeOp(frame, cursor.elemPosInPage); });
+}
+
+// This function returns the page pageIdx of the page where element will be found and the pos of
+// the element in the page as the offset.
+static PageCursor getPageCursorForPos(uint64_t elementPos, uint32_t numElementsPerPage) {
+    KU_ASSERT((elementPos / numElementsPerPage) < UINT32_MAX);
+    return PageCursor{static_cast<page_idx_t>(elementPos / numElementsPerPage),
+        static_cast<uint32_t>(elementPos % numElementsPerPage)};
+}
+
+PageCursor ColumnReadWriter::getPageCursorForOffsetInGroup(offset_t offsetInSegment,
+    page_idx_t groupPageIdx, uint64_t numValuesPerPage) {
+    auto pageCursor = getPageCursorForPos(offsetInSegment, numValuesPerPage);
+    pageCursor.pageIdx += groupPageIdx;
+    return pageCursor;
+}
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/compression_flush_buffer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/compression_flush_buffer.cpp
new file mode 100644
index 0000000000..7408eddb4a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/compression_flush_buffer.cpp
@@ -0,0 +1,173 @@
+#include "storage/table/compression_flush_buffer.h"
+
+#include <type_traits>
+
+#include "common/types/types.h"
+#include "storage/file_handle.h"
+#include "storage/page_manager.h"
+#include "storage/table/column_chunk_data.h"
+#include <concepts>
+
+namespace lbug::storage {
+using namespace common;
+using namespace transaction;
+
+ColumnChunkMetadata uncompressedFlushBuffer(std::span<const uint8_t> buffer, FileHandle* dataFH,
+    const PageRange& entry, const ColumnChunkMetadata& metadata) {
+    KU_ASSERT(dataFH->getNumPages() >= entry.startPageIdx + entry.numPages);
+    KU_ASSERT(buffer.size_bytes() <= entry.numPages * LBUG_PAGE_SIZE);
+    dataFH->writePagesToFile(buffer.data(), buffer.size(), entry.startPageIdx);
+    return ColumnChunkMetadata(entry.startPageIdx, entry.numPages, metadata.numValues,
+        metadata.compMeta);
+}
+
+ColumnChunkMetadata CompressedFlushBuffer::operator()(std::span<const uint8_t> buffer,
+    FileHandle* dataFH, const PageRange& entry, const ColumnChunkMetadata& metadata) const {
+    auto valuesRemaining = metadata.numValues;
+    const uint8_t* bufferStart = buffer.data();
+    const auto compressedBuffer = std::make_unique<uint8_t[]>(LBUG_PAGE_SIZE);
+    auto numPages = 0u;
+    const auto numValuesPerPage = metadata.compMeta.numValues(LBUG_PAGE_SIZE, dataType);
+    KU_ASSERT(numValuesPerPage * entry.numPages >= metadata.numValues);
+    while (valuesRemaining > 0) {
+        const auto compressedSize = alg->compressNextPage(bufferStart, valuesRemaining,
+            compressedBuffer.get(), LBUG_PAGE_SIZE, metadata.compMeta);
+        // Avoid underflows (when data is compressed to nothing, numValuesPerPage may be
+        // UINT64_MAX)
+        if (numValuesPerPage > valuesRemaining) {
+            valuesRemaining = 0;
+        } else {
+            valuesRemaining -= numValuesPerPage;
+        }
+        if (compressedSize < LBUG_PAGE_SIZE) {
+            memset(compressedBuffer.get() + compressedSize, 0, LBUG_PAGE_SIZE - compressedSize);
+        }
+        KU_ASSERT(numPages < entry.numPages);
+        KU_ASSERT(dataFH->getNumPages() >= entry.startPageIdx + numPages);
+        dataFH->writePageToFile(compressedBuffer.get(), entry.startPageIdx + numPages);
+        numPages++;
+    }
+    // Make sure that the on-disk file is the right length
+    if (!dataFH->isInMemoryMode() && numPages < entry.numPages) {
+        memset(compressedBuffer.get(), 0, LBUG_PAGE_SIZE);
+        while (numPages < entry.numPages) {
+            dataFH->writePageToFile(compressedBuffer.get(), entry.startPageIdx + numPages);
+            ++numPages;
+        }
+    }
+    return ColumnChunkMetadata(entry.startPageIdx, entry.numPages, metadata.numValues,
+        metadata.compMeta);
+}
+
+namespace {
+template<std::floating_point T>
+std::pair<std::unique_ptr<uint8_t[]>, uint64_t> flushCompressedFloats(const CompressionAlg& alg,
+    PhysicalTypeID dataType, std::span<const uint8_t> buffer, FileHandle* dataFH,
+    const PageRange& entry, const ColumnChunkMetadata& metadata) {
+    const auto& castedAlg = ku_dynamic_cast<const FloatCompression<T>&>(alg);
+
+    const auto* floatMetadata = metadata.compMeta.floatMetadata();
+    KU_ASSERT(floatMetadata->exceptionCapacity >= floatMetadata->exceptionCount);
+
+    auto valuesRemaining = metadata.numValues;
+    KU_ASSERT(valuesRemaining <= buffer.size_bytes() / sizeof(T));
+
+    const size_t exceptionBufferSize =
+        EncodeException<T>::numPagesFromExceptions(floatMetadata->exceptionCapacity) *
+        LBUG_PAGE_SIZE;
+    auto exceptionBuffer = std::make_unique<uint8_t[]>(exceptionBufferSize);
+    std::byte* exceptionBufferCursor = reinterpret_cast<std::byte*>(exceptionBuffer.get());
+
+    const auto numValuesPerPage = metadata.compMeta.numValues(LBUG_PAGE_SIZE, dataType);
+    KU_ASSERT(numValuesPerPage * metadata.getNumDataPages(dataType) >= metadata.numValues);
+
+    const auto compressedBuffer = std::make_unique<uint8_t[]>(LBUG_PAGE_SIZE);
+    const uint8_t* bufferCursor = buffer.data();
+    auto numPages = 0u;
+    size_t remainingExceptionBufferSize = exceptionBufferSize;
+    RUNTIME_CHECK(size_t totalExceptionCount = 0);
+
+    while (valuesRemaining > 0) {
+        uint64_t pageExceptionCount = 0;
+        (void)castedAlg.compressNextPageWithExceptions(bufferCursor,
+            metadata.numValues - valuesRemaining, valuesRemaining, compressedBuffer.get(),
+            LBUG_PAGE_SIZE, EncodeExceptionView<T>{exceptionBufferCursor},
+            remainingExceptionBufferSize, pageExceptionCount, metadata.compMeta);
+
+        exceptionBufferCursor += pageExceptionCount * EncodeException<T>::sizeInBytes();
+        remainingExceptionBufferSize -= pageExceptionCount * EncodeException<T>::sizeInBytes();
+        RUNTIME_CHECK(totalExceptionCount += pageExceptionCount);
+
+        // Avoid underflows (when data is compressed to nothing, numValuesPerPage may be
+        // UINT64_MAX)
+        if (numValuesPerPage > valuesRemaining) {
+            valuesRemaining = 0;
+        } else {
+            valuesRemaining -= numValuesPerPage;
+        }
+        KU_ASSERT(numPages < entry.numPages);
+        KU_ASSERT(dataFH->getNumPages() >= entry.startPageIdx + numPages);
+        dataFH->writePageToFile(compressedBuffer.get(), entry.startPageIdx + numPages);
+        numPages++;
+    }
+
+    KU_ASSERT(totalExceptionCount == floatMetadata->exceptionCount);
+
+    return {std::move(exceptionBuffer), exceptionBufferSize};
+}
+
+template<std::floating_point T>
+void flushALPExceptions(std::span<const uint8_t> exceptionBuffer, FileHandle* dataFH,
+    const PageRange& entry, const ColumnChunkMetadata& metadata) {
+    const auto encodedType = std::is_same_v<T, float> ? PhysicalTypeID::ALP_EXCEPTION_FLOAT :
+                                                        PhysicalTypeID::ALP_EXCEPTION_DOUBLE;
+    // we don't care about the min/max values for exceptions
+    const auto preExceptionMetadata = uncompressedGetMetadata(encodedType,
+        metadata.compMeta.floatMetadata()->exceptionCapacity, StorageValue{0}, StorageValue{0});
+
+    const auto exceptionStartPageIdx =
+        entry.startPageIdx + entry.numPages - preExceptionMetadata.getNumPages();
+    KU_ASSERT(exceptionStartPageIdx + preExceptionMetadata.getNumPages() <= dataFH->getNumPages());
+    PageRange exceptionBlock{exceptionStartPageIdx, preExceptionMetadata.getNumPages()};
+
+    CompressedFlushBuffer exceptionFlushBuffer{
+        std::make_shared<Uncompressed>(EncodeException<T>::sizeInBytes()), encodedType};
+    (void)exceptionFlushBuffer.operator()(exceptionBuffer, dataFH, exceptionBlock,
+        preExceptionMetadata);
+}
+} // namespace
+
+template<std::floating_point T>
+CompressedFloatFlushBuffer<T>::CompressedFloatFlushBuffer(std::shared_ptr<CompressionAlg> alg,
+    PhysicalTypeID dataType)
+    : alg{std::move(alg)}, dataType{dataType} {}
+
+template<std::floating_point T>
+CompressedFloatFlushBuffer<T>::CompressedFloatFlushBuffer(std::shared_ptr<CompressionAlg> alg,
+    const LogicalType& dataType)
+    : CompressedFloatFlushBuffer<T>(alg, dataType.getPhysicalType()) {}
+
+template<std::floating_point T>
+ColumnChunkMetadata CompressedFloatFlushBuffer<T>::operator()(std::span<const uint8_t> buffer,
+    FileHandle* dataFH, const PageRange& entry, const ColumnChunkMetadata& metadata) const {
+    if (metadata.compMeta.compression == CompressionType::UNCOMPRESSED) {
+        return CompressedFlushBuffer{std::make_shared<Uncompressed>(dataType), dataType}.operator()(
+            buffer, dataFH, entry, metadata);
+    }
+    // FlushBuffer should not be called with constant compression
+    KU_ASSERT(metadata.compMeta.compression == CompressionType::ALP);
+
+    auto [exceptionBuffer, exceptionBufferSize] =
+        flushCompressedFloats<T>(*alg, dataType, buffer, dataFH, entry, metadata);
+
+    flushALPExceptions<T>(std::span<const uint8_t>(exceptionBuffer.get(), exceptionBufferSize),
+        dataFH, entry, metadata);
+
+    return ColumnChunkMetadata(entry.startPageIdx, entry.numPages, metadata.numValues,
+        metadata.compMeta);
+}
+
+template class CompressedFloatFlushBuffer<float>;
+template class CompressedFloatFlushBuffer<double>;
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/csr_chunked_node_group.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/csr_chunked_node_group.cpp
new file mode 100644
index 0000000000..cd36b63101
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/csr_chunked_node_group.cpp
@@ -0,0 +1,470 @@
+#include "storage/table/csr_chunked_node_group.h"
+
+#include "common/serializer/deserializer.h"
+#include "common/types/types.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/enums/residency_state.h"
+#include "storage/page_allocator.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column.h"
+#include "storage/table/column_chunk.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/csr_node_group.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+CSRRegion::CSRRegion(idx_t regionIdx, idx_t level) : regionIdx{regionIdx}, level{level} {
+    const auto leftLeafRegion = regionIdx << level;
+    leftNodeOffset = leftLeafRegion << StorageConfig::CSR_LEAF_REGION_SIZE_LOG2;
+    rightNodeOffset = leftNodeOffset + (StorageConfig::CSR_LEAF_REGION_SIZE << level) - 1;
+    if (rightNodeOffset >= StorageConfig::NODE_GROUP_SIZE) {
+        // The max right node offset should be NODE_GROUP_SIZE - 1.
+        rightNodeOffset = StorageConfig::NODE_GROUP_SIZE - 1;
+    }
+}
+
+bool CSRRegion::isWithin(const CSRRegion& other) const {
+    if (other.level <= level) {
+        return false;
+    }
+    const auto leftRegionIdx = getLeftLeafRegionIdx();
+    const auto rightRegionIdx = getRightLeafRegionIdx();
+    const auto otherLeftRegionIdx = other.getLeftLeafRegionIdx();
+    const auto otherRightRegionIdx = other.getRightLeafRegionIdx();
+    return leftRegionIdx >= otherLeftRegionIdx && rightRegionIdx <= otherRightRegionIdx;
+}
+
+CSRRegion CSRRegion::upgradeLevel(const std::vector<CSRRegion>& leafRegions,
+    const CSRRegion& region) {
+    const auto regionIdx = region.regionIdx >> 1;
+    CSRRegion newRegion{regionIdx, region.level + 1};
+    newRegion.hasUpdates.resize(region.hasUpdates.size(), false);
+    const idx_t leftLeafRegionIdx = newRegion.getLeftLeafRegionIdx();
+    const idx_t rightLeafRegionIdx = newRegion.getRightLeafRegionIdx();
+    for (auto leafRegionIdx = leftLeafRegionIdx; leafRegionIdx <= rightLeafRegionIdx;
+         leafRegionIdx++) {
+        KU_ASSERT(leafRegionIdx < leafRegions.size());
+        newRegion.sizeChange += leafRegions[leafRegionIdx].sizeChange;
+        newRegion.hasPersistentDeletions |= leafRegions[leafRegionIdx].hasPersistentDeletions;
+        newRegion.hasInsertions |= leafRegions[leafRegionIdx].hasInsertions;
+        for (auto columnID = 0u; columnID < leafRegions[leafRegionIdx].hasUpdates.size();
+             columnID++) {
+            newRegion.hasUpdates[columnID] =
+                static_cast<bool>(newRegion.hasUpdates[columnID]) ||
+                static_cast<bool>(leafRegions[leafRegionIdx].hasUpdates[columnID]);
+        }
+    }
+    return newRegion;
+}
+
+ChunkedCSRHeader::ChunkedCSRHeader(MemoryManager& memoryManager, bool enableCompression,
+    uint64_t capacity, ResidencyState residencyState) {
+    offset = std::make_unique<ColumnChunk>(memoryManager, LogicalType::UINT64(), capacity,
+        enableCompression, residencyState, false);
+    length = std::make_unique<ColumnChunk>(memoryManager, LogicalType::UINT64(), capacity,
+        enableCompression, residencyState, false);
+}
+
+offset_t ChunkedCSRHeader::getStartCSROffset(offset_t nodeOffset) const {
+    // TODO(Guodong): I think we can simplify the check here by getting rid of some of the
+    // conditions.
+    const auto numValues = offset->getNumValues();
+    if (nodeOffset == 0 || numValues == 0) {
+        return 0;
+    }
+    if (randomLookup) {
+        return offset->getValue<offset_t>(0);
+    }
+    return offset->getValue<offset_t>(nodeOffset >= numValues ? (numValues - 1) : nodeOffset - 1);
+}
+
+offset_t ChunkedCSRHeader::getEndCSROffset(offset_t nodeOffset) const {
+    // TODO(Guodong): I think we can simplify the check here by getting rid of some of the
+    // conditions.
+    const auto numValues = offset->getNumValues();
+    if (numValues == 0) {
+        return 0;
+    }
+    if (randomLookup) {
+        return offset->getValue<offset_t>(nodeOffset == 0 ? 0 : 1);
+    }
+    return offset->getValue<offset_t>(nodeOffset >= numValues ? (numValues - 1) : nodeOffset);
+}
+
+length_t ChunkedCSRHeader::getCSRLength(offset_t nodeOffset) const {
+    const auto offset = randomLookup ? 0 : nodeOffset;
+    return offset >= length->getNumValues() ? 0 : length->getValue<length_t>(offset);
+}
+
+length_t ChunkedCSRHeader::getGapSize(offset_t nodeOffset) const {
+    return getEndCSROffset(nodeOffset) - getStartCSROffset(nodeOffset) - getCSRLength(nodeOffset);
+}
+
+bool ChunkedCSRHeader::sanityCheck() const {
+    if (offset->getNumValues() != length->getNumValues()) {
+        return false;
+    }
+    if (offset->getNumValues() == 0) {
+        return true;
+    }
+    if (offset->getValue<offset_t>(0) < length->getValue<length_t>(0)) {
+        return false;
+    }
+    for (auto i = 1u; i < offset->getNumValues(); i++) {
+        if (offset->getValue<offset_t>(i - 1) + length->getValue<length_t>(i) >
+            offset->getValue<offset_t>(i)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+offset_vec_t ChunkedCSRHeader::populateStartCSROffsetsFromLength(bool leaveGaps) const {
+    const auto numNodes = length->getNumValues();
+    const auto numLeafRegions = getNumRegions();
+    offset_t leftCSROffset = 0;
+    offset_vec_t rightCSROffsetOfRegions;
+    rightCSROffsetOfRegions.reserve(numLeafRegions);
+    for (auto regionIdx = 0u; regionIdx < numLeafRegions; regionIdx++) {
+        CSRRegion region{regionIdx, 0 /* level*/};
+        length_t numRelsInRegion = 0;
+        const auto rightNodeOffset = std::min(region.rightNodeOffset, numNodes - 1);
+        // Populate start csr offset for each node in the region.
+        offset->mapValues<offset_t>(
+            [&](auto& value, auto nodeOffset) {
+                value = leftCSROffset + numRelsInRegion;
+                numRelsInRegion += getCSRLength(nodeOffset);
+            },
+            region.leftNodeOffset, rightNodeOffset);
+        // Update lastLeftCSROffset for next region.
+        leftCSROffset += numRelsInRegion;
+        if (leaveGaps) {
+            leftCSROffset += computeGapFromLength(numRelsInRegion);
+        }
+        rightCSROffsetOfRegions.push_back(leftCSROffset);
+    }
+    return rightCSROffsetOfRegions;
+}
+
+void ChunkedCSRHeader::populateEndCSROffsetFromStartAndLength() const {
+    [[maybe_unused]] const auto numNodes = length->getNumValues();
+    KU_ASSERT(offset->getNumValues() == numNodes);
+    // TODO(bmwinger): maybe there's a way of also vectorizing this for the length chunk, E.g. a
+    // forEach over two values
+    offset->mapValues<offset_t>(
+        [&](offset_t& offset, auto i) { offset += length->getValue<length_t>(i); });
+}
+
+void ChunkedCSRHeader::finalizeCSRRegionEndOffsets(
+    const offset_vec_t& rightCSROffsetOfRegions) const {
+    const auto numNodes = length->getNumValues();
+    const auto numLeafRegions = getNumRegions();
+    KU_ASSERT(numLeafRegions == rightCSROffsetOfRegions.size());
+    for (auto regionIdx = 0u; regionIdx < numLeafRegions; regionIdx++) {
+        CSRRegion region{regionIdx, 0 /* level*/};
+        const auto rightNodeOffset = std::min(region.rightNodeOffset, numNodes - 1);
+        offset->setValue<offset_t>(rightCSROffsetOfRegions[regionIdx], rightNodeOffset);
+    }
+}
+
+idx_t ChunkedCSRHeader::getNumRegions() const {
+    const auto numNodes = length->getNumValues();
+    KU_ASSERT(offset->getNumValues() == numNodes);
+    return (numNodes + StorageConfig::CSR_LEAF_REGION_SIZE - 1) /
+           StorageConfig::CSR_LEAF_REGION_SIZE;
+}
+
+void ChunkedCSRHeader::populateRegionCSROffsets(const CSRRegion& region,
+    const ChunkedCSRHeader& oldHeader) const {
+    KU_ASSERT(region.level <= CSRNodeGroup::DEFAULT_PACKED_CSR_INFO.calibratorTreeHeight);
+    const auto leftNodeOffset = region.leftNodeOffset;
+    const auto rightNodeOffset = region.rightNodeOffset;
+    const auto leftCSROffset = oldHeader.getStartCSROffset(leftNodeOffset);
+    const auto oldRightCSROffset = oldHeader.getEndCSROffset(rightNodeOffset);
+    length_t numRelsInRegion = 0u;
+    // TODO(bmwinger): should be able to vectorize this somewhat
+    for (auto i = leftNodeOffset; i <= rightNodeOffset; i++) {
+        numRelsInRegion += length->getValue<length_t>(i);
+        offset->setValue<offset_t>(leftCSROffset + numRelsInRegion, i);
+    }
+    // We should keep the region stable and the old right CSR offset is the end of the region.
+    KU_ASSERT(offset->getValue<offset_t>(rightNodeOffset) <= oldRightCSROffset);
+    offset->setValue(oldRightCSROffset, rightNodeOffset);
+}
+
+void ChunkedCSRHeader::populateEndCSROffsets(const offset_vec_t& gaps) const {
+    KU_ASSERT(offset->getNumValues() == length->getNumValues());
+    KU_ASSERT(offset->getNumValues() == gaps.size());
+    offset->mapValues<offset_t>([&](offset_t& offset, auto i) { offset = gaps[i]; });
+}
+
+length_t ChunkedCSRHeader::computeGapFromLength(length_t length) {
+    return StorageUtils::divideAndRoundUpTo(length, StorageConstants::PACKED_CSR_DENSITY) - length;
+}
+
+std::unique_ptr<ChunkedNodeGroup> InMemChunkedCSRNodeGroup::flush(
+    transaction::Transaction* transaction, PageAllocator& pageAllocator) {
+    auto csrOffset = flushInternal(*csrHeader.offset, pageAllocator);
+    auto csrLength = flushInternal(*csrHeader.length, pageAllocator);
+    std::vector<std::unique_ptr<ColumnChunk>> flushedChunks(getNumColumns());
+    for (auto i = 0u; i < getNumColumns(); i++) {
+        flushedChunks[i] = flushInternal(getColumnChunk(i), pageAllocator);
+    }
+    ChunkedCSRHeader newCSRHeader{std::move(csrOffset), std::move(csrLength)};
+    auto flushedChunkedGroup = std::make_unique<ChunkedCSRNodeGroup>(std::move(newCSRHeader),
+        std::move(flushedChunks), 0 /*startRowIdx*/);
+    flushedChunkedGroup->versionInfo = std::make_unique<VersionInfo>();
+    KU_ASSERT(numRows == flushedChunkedGroup->getNumRows());
+    flushedChunkedGroup->versionInfo->append(transaction->getID(), 0, numRows);
+    return flushedChunkedGroup;
+}
+
+void ChunkedCSRNodeGroup ::reclaimStorage(PageAllocator& pageAllocator) const {
+    ChunkedNodeGroup::reclaimStorage(pageAllocator);
+    if (csrHeader.offset) {
+        csrHeader.offset->reclaimStorage(pageAllocator);
+    }
+    if (csrHeader.length) {
+        csrHeader.length->reclaimStorage(pageAllocator);
+    }
+}
+
+void ChunkedCSRNodeGroup::scanCSRHeader(MemoryManager& memoryManager,
+    CSRNodeGroupCheckpointState& csrState) const {
+    if (!csrState.oldHeader) {
+        csrState.oldHeader = std::make_unique<InMemChunkedCSRHeader>(memoryManager,
+            false /*enableCompression*/, StorageConfig::NODE_GROUP_SIZE);
+    }
+    ChunkState headerChunkState;
+    KU_ASSERT(csrHeader.offset->getResidencyState() == ResidencyState::ON_DISK);
+    KU_ASSERT(csrHeader.length->getResidencyState() == ResidencyState::ON_DISK);
+    csrHeader.offset->initializeScanState(headerChunkState, csrState.csrOffsetColumn);
+    KU_ASSERT(csrState.csrOffsetColumn && csrState.csrLengthColumn);
+    csrState.csrOffsetColumn->scan(headerChunkState, csrState.oldHeader->offset.get());
+    csrHeader.length->initializeScanState(headerChunkState, csrState.csrLengthColumn);
+    csrState.csrLengthColumn->scan(headerChunkState, csrState.oldHeader->length.get());
+}
+
+void ChunkedCSRNodeGroup::serialize(Serializer& serializer) const {
+    KU_ASSERT(csrHeader.offset && csrHeader.length);
+    serializer.writeDebuggingInfo("csr_header_offset");
+    csrHeader.offset->serialize(serializer);
+    serializer.writeDebuggingInfo("csr_header_length");
+    csrHeader.length->serialize(serializer);
+    ChunkedNodeGroup::serialize(serializer);
+}
+
+std::unique_ptr<ChunkedCSRNodeGroup> ChunkedCSRNodeGroup::deserialize(MemoryManager& memoryManager,
+    Deserializer& deSer) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "csr_header_offset");
+    auto offset = ColumnChunk::deserialize(memoryManager, deSer);
+    deSer.validateDebuggingInfo(key, "csr_header_length");
+    auto length = ColumnChunk::deserialize(memoryManager, deSer);
+    // TODO(Guodong): Rework to reuse ChunkedNodeGroup::deserialize().
+    std::vector<std::unique_ptr<ColumnChunk>> chunks;
+    deSer.validateDebuggingInfo(key, "chunks");
+    deSer.deserializeVectorOfPtrs<ColumnChunk>(chunks,
+        [&](Deserializer& deser) { return ColumnChunk::deserialize(memoryManager, deser); });
+    deSer.validateDebuggingInfo(key, "startRowIdx");
+    row_idx_t startRowIdx = 0;
+    deSer.deserializeValue<row_idx_t>(startRowIdx);
+    auto chunkedGroup = std::make_unique<ChunkedCSRNodeGroup>(
+        ChunkedCSRHeader{std::move(offset), std::move(length)}, std::move(chunks), startRowIdx);
+    bool hasVersions = false;
+    deSer.validateDebuggingInfo(key, "has_version_info");
+    deSer.deserializeValue<bool>(hasVersions);
+    if (hasVersions) {
+        deSer.validateDebuggingInfo(key, "version_info");
+        chunkedGroup->versionInfo = VersionInfo::deserialize(deSer);
+    }
+    return chunkedGroup;
+}
+
+ChunkedCSRNodeGroup::ChunkedCSRNodeGroup(InMemChunkedCSRNodeGroup& base,
+    const std::vector<common::column_id_t>& selectedColumns)
+    : ChunkedNodeGroup{base, selectedColumns},
+      csrHeader{std::make_unique<ColumnChunk>(true /*enableCompression*/,
+                    std::move(base.csrHeader.offset)),
+          std::make_unique<ColumnChunk>(true /*enableCompression*/,
+              std::move(base.csrHeader.length))} {}
+
+void InMemChunkedCSRHeader::fillDefaultValues(const offset_t newNumValues) const {
+    const auto lastCSROffset = getEndCSROffset(length->getNumValues() - 1);
+    for (auto i = length->getNumValues(); i < newNumValues; i++) {
+        offset->setValue<offset_t>(lastCSROffset, i);
+        length->setValue<length_t>(0, i);
+    }
+    KU_ASSERT(
+        offset->getNumValues() >= newNumValues && length->getNumValues() == offset->getNumValues());
+}
+
+InMemChunkedCSRHeader::InMemChunkedCSRHeader(MemoryManager& memoryManager, bool enableCompression,
+    uint64_t capacity) {
+    offset = ColumnChunkFactory::createColumnChunkData(memoryManager, LogicalType::UINT64(),
+        enableCompression, capacity, ResidencyState::IN_MEMORY, false);
+    length = ColumnChunkFactory::createColumnChunkData(memoryManager, LogicalType::UINT64(),
+        enableCompression, capacity, ResidencyState::IN_MEMORY, false);
+}
+
+offset_t InMemChunkedCSRHeader::getStartCSROffset(offset_t nodeOffset) const {
+    // TODO(Guodong): I think we can simplify the check here by getting rid of some of the
+    // conditions.
+    const auto numValues = offset->getNumValues();
+    if (nodeOffset == 0 || numValues == 0) {
+        return 0;
+    }
+    if (randomLookup) {
+        return offset->getValue<offset_t>(0);
+    }
+    return offset->getValue<offset_t>(nodeOffset >= numValues ? (numValues - 1) : nodeOffset - 1);
+}
+
+offset_t InMemChunkedCSRHeader::getEndCSROffset(offset_t nodeOffset) const {
+    // TODO(Guodong): I think we can simplify the check here by getting rid of some of the
+    // conditions.
+    const auto numValues = offset->getNumValues();
+    if (numValues == 0) {
+        return 0;
+    }
+    if (randomLookup) {
+        return offset->getValue<offset_t>(nodeOffset == 0 ? 0 : 1);
+    }
+    return offset->getValue<offset_t>(nodeOffset >= numValues ? (numValues - 1) : nodeOffset);
+}
+
+length_t InMemChunkedCSRHeader::getCSRLength(offset_t nodeOffset) const {
+    const auto offset = randomLookup ? 0 : nodeOffset;
+    return offset >= length->getNumValues() ? 0 : length->getValue<length_t>(offset);
+}
+
+length_t InMemChunkedCSRHeader::getGapSize(offset_t nodeOffset) const {
+    return getEndCSROffset(nodeOffset) - getStartCSROffset(nodeOffset) - getCSRLength(nodeOffset);
+}
+
+bool InMemChunkedCSRHeader::sanityCheck() const {
+    if (offset->getNumValues() != length->getNumValues()) {
+        return false;
+    }
+    if (offset->getNumValues() == 0) {
+        return true;
+    }
+    if (offset->getValue<offset_t>(0) < length->getValue<length_t>(0)) {
+        return false;
+    }
+    for (auto i = 1u; i < offset->getNumValues(); i++) {
+        if (offset->getValue<offset_t>(i - 1) + length->getValue<length_t>(i) >
+            offset->getValue<offset_t>(i)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+void InMemChunkedCSRHeader::copyFrom(const InMemChunkedCSRHeader& other) const {
+    KU_ASSERT(offset->getNumValues() == length->getNumValues());
+    KU_ASSERT(other.offset->getNumValues() == other.length->getNumValues());
+    KU_ASSERT(other.offset->getCapacity() == offset->getCapacity());
+    const auto numOtherValues = other.offset->getNumValues();
+    memcpy(offset->getData(), other.offset->getData(), numOtherValues * sizeof(offset_t));
+    memcpy(length->getData(), other.length->getData(), numOtherValues * sizeof(length_t));
+    const auto lastOffsetInOtherHeader = other.getEndCSROffset(numOtherValues);
+    const auto numValues = offset->getNumValues();
+    for (auto i = numOtherValues; i < numValues; i++) {
+        offset->setValue<offset_t>(lastOffsetInOtherHeader, i);
+        length->setValue<length_t>(0, i);
+    }
+}
+
+offset_vec_t InMemChunkedCSRHeader::populateStartCSROffsetsFromLength(bool leaveGaps) const {
+    const auto numNodes = length->getNumValues();
+    const auto numLeafRegions = getNumRegions();
+    offset_t leftCSROffset = 0;
+    offset_vec_t rightCSROffsetOfRegions;
+    rightCSROffsetOfRegions.reserve(numLeafRegions);
+    for (auto regionIdx = 0u; regionIdx < numLeafRegions; regionIdx++) {
+        CSRRegion region{regionIdx, 0 /* level*/};
+        length_t numRelsInRegion = 0;
+        const auto rightNodeOffset = std::min(region.rightNodeOffset, numNodes - 1);
+        // Populate start csr offset for each node in the region.
+        for (auto nodeOffset = region.leftNodeOffset; nodeOffset <= rightNodeOffset; nodeOffset++) {
+            offset->setValue<offset_t>(leftCSROffset + numRelsInRegion, nodeOffset);
+            numRelsInRegion += getCSRLength(nodeOffset);
+        }
+        // Update lastLeftCSROffset for next region.
+        leftCSROffset += numRelsInRegion;
+        if (leaveGaps) {
+            leftCSROffset += computeGapFromLength(numRelsInRegion);
+        }
+        rightCSROffsetOfRegions.push_back(leftCSROffset);
+    }
+    return rightCSROffsetOfRegions;
+}
+
+void InMemChunkedCSRHeader::populateEndCSROffsetFromStartAndLength() const {
+    const auto numNodes = length->getNumValues();
+    KU_ASSERT(offset->getNumValues() == numNodes);
+    const auto csrOffsets = reinterpret_cast<offset_t*>(offset->getData());
+    const auto csrLengths = reinterpret_cast<length_t*>(length->getData());
+    for (auto i = 0u; i < numNodes; i++) {
+        csrOffsets[i] = csrOffsets[i] + csrLengths[i];
+    }
+}
+
+void InMemChunkedCSRHeader::finalizeCSRRegionEndOffsets(
+    const offset_vec_t& rightCSROffsetOfRegions) const {
+    const auto numNodes = length->getNumValues();
+    const auto numLeafRegions = getNumRegions();
+    KU_ASSERT(numLeafRegions == rightCSROffsetOfRegions.size());
+    for (auto regionIdx = 0u; regionIdx < numLeafRegions; regionIdx++) {
+        CSRRegion region{regionIdx, 0 /* level*/};
+        const auto rightNodeOffset = std::min(region.rightNodeOffset, numNodes - 1);
+        offset->setValue<offset_t>(rightCSROffsetOfRegions[regionIdx], rightNodeOffset);
+    }
+}
+
+idx_t InMemChunkedCSRHeader::getNumRegions() const {
+    const auto numNodes = length->getNumValues();
+    KU_ASSERT(offset->getNumValues() == numNodes);
+    return (numNodes + StorageConfig::CSR_LEAF_REGION_SIZE - 1) /
+           StorageConfig::CSR_LEAF_REGION_SIZE;
+}
+
+void InMemChunkedCSRHeader::populateRegionCSROffsets(const CSRRegion& region,
+    const InMemChunkedCSRHeader& oldHeader) const {
+    KU_ASSERT(region.level <= CSRNodeGroup::DEFAULT_PACKED_CSR_INFO.calibratorTreeHeight);
+    const auto leftNodeOffset = region.leftNodeOffset;
+    const auto rightNodeOffset = region.rightNodeOffset;
+    const auto leftCSROffset = oldHeader.getStartCSROffset(leftNodeOffset);
+    const auto oldRightCSROffset = oldHeader.getEndCSROffset(rightNodeOffset);
+    const auto csrOffsets = reinterpret_cast<offset_t*>(offset->getData());
+    const auto csrLengths = reinterpret_cast<length_t*>(length->getData());
+    length_t numRelsInRegion = 0u;
+    for (auto i = leftNodeOffset; i <= rightNodeOffset; i++) {
+        numRelsInRegion += csrLengths[i];
+        csrOffsets[i] = leftCSROffset + numRelsInRegion;
+    }
+    // We should keep the region stable and the old right CSR offset is the end of the region.
+    KU_ASSERT(csrOffsets[rightNodeOffset] <= oldRightCSROffset);
+    csrOffsets[rightNodeOffset] = oldRightCSROffset;
+}
+
+void InMemChunkedCSRHeader::populateEndCSROffsets(const offset_vec_t& gaps) const {
+    const auto csrOffsets = reinterpret_cast<offset_t*>(offset->getData());
+    KU_ASSERT(offset->getNumValues() == length->getNumValues());
+    KU_ASSERT(offset->getNumValues() == gaps.size());
+    for (auto i = 0u; i < offset->getNumValues(); i++) {
+        csrOffsets[i] += gaps[i];
+    }
+}
+
+length_t InMemChunkedCSRHeader::computeGapFromLength(length_t length) {
+    return StorageUtils::divideAndRoundUpTo(length, StorageConstants::PACKED_CSR_DENSITY) - length;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/csr_node_group.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/csr_node_group.cpp
new file mode 100644
index 0000000000..e75fb98188
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/csr_node_group.cpp
@@ -0,0 +1,1210 @@
+#include "storage/table/csr_node_group.h"
+
+#include "common/constants.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/csr_chunked_node_group.h"
+#include "storage/table/lazy_segment_scanner.h"
+#include "storage/table/rel_table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+bool CSRNodeGroupScanState::tryScanCachedTuples(RelTableScanState& tableScanState) {
+    if (numCachedRows == 0 ||
+        tableScanState.currBoundNodeIdx >= tableScanState.cachedBoundNodeSelVector.getSelSize()) {
+        return false;
+    }
+    const auto boundNodeOffset = tableScanState.nodeIDVector->readNodeOffset(
+        tableScanState.cachedBoundNodeSelVector[tableScanState.currBoundNodeIdx]);
+    const auto boundNodeOffsetInGroup = boundNodeOffset % StorageConfig::NODE_GROUP_SIZE;
+    const auto startCSROffset = header->getStartCSROffset(boundNodeOffsetInGroup);
+    const auto csrLength = header->getCSRLength(boundNodeOffsetInGroup);
+    nextCachedRowToScan = std::max(nextCachedRowToScan, startCSROffset);
+    if (nextCachedRowToScan >= nextRowToScan ||
+        nextCachedRowToScan < nextRowToScan - numCachedRows) {
+        // Out of the bound of cached rows.
+        return false;
+    }
+    KU_ASSERT(nextCachedRowToScan >= nextRowToScan - numCachedRows);
+    const auto numRowsToScan =
+        std::min(nextRowToScan, startCSROffset + csrLength) - nextCachedRowToScan;
+    const auto startCachedRow = nextCachedRowToScan - (nextRowToScan - numCachedRows);
+    if (cachedScannedVectorsSelBitset.has_value()) {
+        auto cachedScannedVectorsSelBitset = *this->cachedScannedVectorsSelBitset;
+        auto numSelected = 0u;
+        tableScanState.outState->getSelVectorUnsafe().setToFiltered();
+        for (auto i = 0u; i < numRowsToScan; i++) {
+            const auto rowIdx = startCachedRow + i;
+            tableScanState.outState->getSelVectorUnsafe()[numSelected] = rowIdx;
+            numSelected += cachedScannedVectorsSelBitset[rowIdx];
+        }
+        tableScanState.outState->getSelVectorUnsafe().setSelSize(numSelected);
+    } else {
+        tableScanState.outState->getSelVectorUnsafe().setRange(startCachedRow, numRowsToScan);
+    }
+    tableScanState.setNodeIDVectorToFlat(
+        tableScanState.cachedBoundNodeSelVector[tableScanState.currBoundNodeIdx]);
+    nextCachedRowToScan += numRowsToScan;
+    if ((startCSROffset + csrLength) == nextCachedRowToScan) {
+        tableScanState.currBoundNodeIdx++;
+        nextCachedRowToScan = 0;
+    }
+    return true;
+}
+
+void CSRNodeGroup::initializeScanState(const Transaction* transaction,
+    TableScanState& state) const {
+    auto& relScanState = state.cast<RelTableScanState>();
+    KU_ASSERT(relScanState.nodeGroupScanState);
+    auto& nodeGroupScanState = relScanState.nodeGroupScanState->cast<CSRNodeGroupScanState>();
+    if (relScanState.nodeGroupIdx != nodeGroupIdx || relScanState.randomLookup) {
+        relScanState.nodeGroupIdx = nodeGroupIdx;
+        if (persistentChunkGroup) {
+            initScanForCommittedPersistent(transaction, relScanState, nodeGroupScanState);
+        }
+    }
+    // Switch to a new Vector of bound nodes (i.e., new csr lists) in the node group.
+    if (persistentChunkGroup) {
+        nodeGroupScanState.nextRowToScan = 0;
+        nodeGroupScanState.numCachedRows = 0;
+        nodeGroupScanState.nextCachedRowToScan = 0;
+        nodeGroupScanState.source = CSRNodeGroupScanSource::COMMITTED_PERSISTENT;
+    } else if (csrIndex) {
+        initScanForCommittedInMem(relScanState, nodeGroupScanState);
+    } else {
+        nodeGroupScanState.source = CSRNodeGroupScanSource::NONE;
+        nodeGroupScanState.nextRowToScan = 0;
+    }
+}
+
+void CSRNodeGroup::initScanForCommittedPersistent(const Transaction* transaction,
+    RelTableScanState& relScanState, CSRNodeGroupScanState& nodeGroupScanState) const {
+    // Scan the csr header chunks from disk.
+    ChunkState offsetState, lengthState;
+    auto& csrChunkGroup = persistentChunkGroup->cast<ChunkedCSRNodeGroup>();
+    const auto& csrHeader = csrChunkGroup.getCSRHeader();
+    // We are switching to a new node group.
+    // Initialize the scan states of a new node group for the csr header.
+    csrHeader.offset->initializeScanState(offsetState, relScanState.csrOffsetColumn);
+    csrHeader.length->initializeScanState(lengthState, relScanState.csrLengthColumn);
+    nodeGroupScanState.header->offset->setNumValues(0);
+    nodeGroupScanState.header->length->setNumValues(0);
+    // Initialize the scan states of a new node group for data columns.
+    for (auto i = 0u; i < relScanState.columnIDs.size(); i++) {
+        if (relScanState.columnIDs[i] == INVALID_COLUMN_ID ||
+            relScanState.columnIDs[i] == ROW_IDX_COLUMN_ID) {
+            continue;
+        }
+        auto& chunk = persistentChunkGroup->getColumnChunk(relScanState.columnIDs[i]);
+        chunk.initializeScanState(nodeGroupScanState.chunkStates[i], relScanState.columns[i]);
+    }
+    KU_ASSERT(csrHeader.offset->getNumValues() == csrHeader.length->getNumValues());
+    if (relScanState.randomLookup) {
+        auto pos = relScanState.nodeIDVector->state->getSelVector()[0];
+        auto nodeOffset = relScanState.nodeIDVector->readNodeOffset(pos);
+        auto offsetInGroup = nodeOffset % StorageConfig::NODE_GROUP_SIZE;
+        auto offsetToScanFrom = offsetInGroup == 0 ? 0 : offsetInGroup - 1;
+        csrHeader.offset->scanCommitted<ResidencyState::ON_DISK>(transaction, offsetState,
+            *nodeGroupScanState.header->offset, offsetToScanFrom, 1);
+        csrHeader.length->scanCommitted<ResidencyState::ON_DISK>(transaction, lengthState,
+            *nodeGroupScanState.header->length, offsetInGroup, 1);
+    } else {
+        auto numBoundNodes = csrHeader.offset->getNumValues();
+        csrHeader.offset->scanCommitted<ResidencyState::ON_DISK>(transaction, offsetState,
+            *nodeGroupScanState.header->offset);
+        csrHeader.length->scanCommitted<ResidencyState::ON_DISK>(transaction, lengthState,
+            *nodeGroupScanState.header->length);
+        nodeGroupScanState.numTotalRows =
+            nodeGroupScanState.header->getStartCSROffset(numBoundNodes);
+    }
+    nodeGroupScanState.header->randomLookup = relScanState.randomLookup;
+}
+
+void CSRNodeGroup::initScanForCommittedInMem(RelTableScanState& relScanState,
+    CSRNodeGroupScanState& nodeGroupScanState) {
+    relScanState.currBoundNodeIdx = 0;
+    nodeGroupScanState.source = CSRNodeGroupScanSource::COMMITTED_IN_MEMORY;
+    nodeGroupScanState.nextRowToScan = 0;
+    nodeGroupScanState.numCachedRows = 0;
+    nodeGroupScanState.inMemCSRList.clear();
+}
+
+NodeGroupScanResult CSRNodeGroup::scan(const Transaction* transaction,
+    TableScanState& state) const {
+    auto& relScanState = state.cast<RelTableScanState>();
+    auto& nodeGroupScanState = relScanState.nodeGroupScanState->cast<CSRNodeGroupScanState>();
+    while (true) {
+        switch (nodeGroupScanState.source) {
+        case CSRNodeGroupScanSource::COMMITTED_PERSISTENT: {
+            auto result = scanCommittedPersistent(transaction, relScanState, nodeGroupScanState);
+            if (result == NODE_GROUP_SCAN_EMPTY_RESULT && csrIndex) {
+                initScanForCommittedInMem(relScanState, nodeGroupScanState);
+                continue;
+            }
+            return result;
+        }
+        case CSRNodeGroupScanSource::COMMITTED_IN_MEMORY: {
+            relScanState.resetOutVectors();
+            const auto result = scanCommittedInMem(transaction, relScanState, nodeGroupScanState);
+            if (result == NODE_GROUP_SCAN_EMPTY_RESULT) {
+                relScanState.outState->getSelVectorUnsafe().setSelSize(0);
+                return NODE_GROUP_SCAN_EMPTY_RESULT;
+            }
+            return result;
+        }
+        case CSRNodeGroupScanSource::NONE: {
+            relScanState.outState->getSelVectorUnsafe().setSelSize(0);
+            return NODE_GROUP_SCAN_EMPTY_RESULT;
+        }
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+    }
+}
+
+NodeGroupScanResult CSRNodeGroup::scanCommittedPersistent(const Transaction* transaction,
+    RelTableScanState& tableState, CSRNodeGroupScanState& nodeGroupScanState) const {
+    if (tableState.cachedBoundNodeSelVector.getSelSize() == 1) {
+        // Note that we don't apply cache when there is only one bound node.
+        return scanCommittedPersistentWithoutCache(transaction, tableState, nodeGroupScanState);
+    }
+    return scanCommittedPersistentWithCache(transaction, tableState, nodeGroupScanState);
+}
+
+NodeGroupScanResult CSRNodeGroup::scanCommittedPersistentWithCache(const Transaction* transaction,
+    RelTableScanState& tableState, CSRNodeGroupScanState& nodeGroupScanState) const {
+    while (true) {
+        while (nodeGroupScanState.tryScanCachedTuples(tableState)) {
+            if (tableState.outState->getSelVector().getSelSize() > 0) {
+                // Note: This is a dummy return value.
+                return NodeGroupScanResult{nodeGroupScanState.nextRowToScan,
+                    tableState.outState->getSelVector().getSelSize()};
+            }
+        }
+        if (nodeGroupScanState.nextRowToScan == nodeGroupScanState.numTotalRows ||
+            tableState.currBoundNodeIdx >= tableState.cachedBoundNodeSelVector.getSelSize()) {
+            return NODE_GROUP_SCAN_EMPTY_RESULT;
+        }
+        const auto currNodeOffset = tableState.nodeIDVector->readNodeOffset(
+            tableState.cachedBoundNodeSelVector[tableState.currBoundNodeIdx]);
+        const auto offsetInGroup = currNodeOffset % StorageConfig::NODE_GROUP_SIZE;
+        const auto startCSROffset = nodeGroupScanState.header->getStartCSROffset(offsetInGroup);
+        if (startCSROffset > nodeGroupScanState.nextRowToScan) {
+            nodeGroupScanState.nextRowToScan = startCSROffset;
+        }
+        KU_ASSERT(nodeGroupScanState.nextRowToScan <= nodeGroupScanState.numTotalRows);
+        const auto numToScan =
+            std::min(nodeGroupScanState.numTotalRows - nodeGroupScanState.nextRowToScan,
+                DEFAULT_VECTOR_CAPACITY);
+        persistentChunkGroup->scan(transaction, tableState, nodeGroupScanState,
+            nodeGroupScanState.nextRowToScan, numToScan);
+        nodeGroupScanState.numCachedRows = numToScan;
+        nodeGroupScanState.nextRowToScan += numToScan;
+        if (tableState.outState->getSelVector().isUnfiltered()) {
+            nodeGroupScanState.cachedScannedVectorsSelBitset.reset();
+        } else {
+            nodeGroupScanState.cachedScannedVectorsSelBitset =
+                std::bitset<DEFAULT_VECTOR_CAPACITY>();
+            for (auto i = 0u; i < tableState.outState->getSelVector().getSelSize(); i++) {
+                nodeGroupScanState.cachedScannedVectorsSelBitset->set(
+                    tableState.outState->getSelVector()[i], true);
+            }
+        }
+    }
+}
+
+NodeGroupScanResult CSRNodeGroup::scanCommittedPersistentWithoutCache(
+    const Transaction* transaction, RelTableScanState& tableState,
+    CSRNodeGroupScanState& nodeGroupScanState) const {
+    const auto currNodeOffset = tableState.nodeIDVector->readNodeOffset(
+        tableState.cachedBoundNodeSelVector[tableState.currBoundNodeIdx]);
+    const auto offsetInGroup = currNodeOffset % StorageConfig::NODE_GROUP_SIZE;
+    const auto csrListLength = nodeGroupScanState.header->getCSRLength(offsetInGroup);
+    if (nodeGroupScanState.nextRowToScan == csrListLength) {
+        return NODE_GROUP_SCAN_EMPTY_RESULT;
+    }
+    const auto startRow = nodeGroupScanState.header->getStartCSROffset(offsetInGroup) +
+                          nodeGroupScanState.nextRowToScan;
+    const auto numToScan =
+        std::min(csrListLength - nodeGroupScanState.nextRowToScan, DEFAULT_VECTOR_CAPACITY);
+    persistentChunkGroup->scan(transaction, tableState, nodeGroupScanState, startRow, numToScan);
+    nodeGroupScanState.nextRowToScan += numToScan;
+    tableState.setNodeIDVectorToFlat(
+        tableState.cachedBoundNodeSelVector[tableState.currBoundNodeIdx]);
+    return NodeGroupScanResult{startRow, numToScan};
+}
+
+NodeGroupScanResult CSRNodeGroup::scanCommittedInMem(const Transaction* transaction,
+    RelTableScanState& tableState, CSRNodeGroupScanState& nodeGroupScanState) const {
+    while (true) {
+        if (tableState.currBoundNodeIdx >= tableState.cachedBoundNodeSelVector.getSelSize()) {
+            return NODE_GROUP_SCAN_EMPTY_RESULT;
+        }
+        if (nodeGroupScanState.inMemCSRList.rowIndices.empty()) {
+            const auto boundNodePos =
+                tableState.cachedBoundNodeSelVector[tableState.currBoundNodeIdx];
+            const auto boundNodeOffset = tableState.nodeIDVector->readNodeOffset(boundNodePos);
+            const auto offsetInGroup = boundNodeOffset % StorageConfig::NODE_GROUP_SIZE;
+            nodeGroupScanState.inMemCSRList = csrIndex->indices[offsetInGroup];
+        }
+        if (!nodeGroupScanState.inMemCSRList.isSequential) {
+            KU_ASSERT(std::is_sorted(nodeGroupScanState.inMemCSRList.rowIndices.begin(),
+                nodeGroupScanState.inMemCSRList.rowIndices.end()));
+        }
+        auto scanResult =
+            nodeGroupScanState.inMemCSRList.isSequential ?
+                scanCommittedInMemSequential(transaction, tableState, nodeGroupScanState) :
+                scanCommittedInMemRandom(transaction, tableState, nodeGroupScanState);
+        if (scanResult == NODE_GROUP_SCAN_EMPTY_RESULT) {
+            tableState.currBoundNodeIdx++;
+            nodeGroupScanState.nextRowToScan = 0;
+            nodeGroupScanState.inMemCSRList.clear();
+        } else {
+            tableState.setNodeIDVectorToFlat(
+                tableState.cachedBoundNodeSelVector[tableState.currBoundNodeIdx]);
+            return scanResult;
+        }
+    }
+}
+
+NodeGroupScanResult CSRNodeGroup::scanCommittedInMemSequential(const Transaction* transaction,
+    const RelTableScanState& tableState, CSRNodeGroupScanState& nodeGroupScanState) const {
+    const auto startRow =
+        nodeGroupScanState.inMemCSRList.rowIndices[0] + nodeGroupScanState.nextRowToScan;
+    auto numRows =
+        std::min(nodeGroupScanState.inMemCSRList.rowIndices[1] - nodeGroupScanState.nextRowToScan,
+            DEFAULT_VECTOR_CAPACITY);
+    auto [chunkIdx, startRowInChunk] =
+        StorageUtils::getQuotientRemainder(startRow, StorageConfig::CHUNKED_NODE_GROUP_CAPACITY);
+    numRows = std::min(numRows, StorageConfig::CHUNKED_NODE_GROUP_CAPACITY - startRowInChunk);
+    if (numRows == 0) {
+        return NODE_GROUP_SCAN_EMPTY_RESULT;
+    }
+    const ChunkedNodeGroup* chunkedGroup = nullptr;
+    {
+        const auto lock = chunkedGroups.lock();
+        chunkedGroup = chunkedGroups.getGroup(lock, chunkIdx);
+    }
+    chunkedGroup->scan(transaction, tableState, nodeGroupScanState, startRowInChunk, numRows);
+    nodeGroupScanState.nextRowToScan += numRows;
+    return NodeGroupScanResult{startRow, numRows};
+}
+
+NodeGroupScanResult CSRNodeGroup::scanCommittedInMemRandom(const Transaction* transaction,
+    const RelTableScanState& tableState, CSRNodeGroupScanState& nodeGroupScanState) const {
+    const auto numRows = std::min(nodeGroupScanState.inMemCSRList.rowIndices.size() -
+                                      nodeGroupScanState.nextRowToScan,
+        DEFAULT_VECTOR_CAPACITY);
+    if (numRows == 0) {
+        return NODE_GROUP_SCAN_EMPTY_RESULT;
+    }
+    row_idx_t nextRow = 0;
+    ChunkedNodeGroup* chunkedGroup = nullptr;
+    node_group_idx_t currentChunkIdx = INVALID_NODE_GROUP_IDX;
+    sel_t numSelected = 0;
+    while (nextRow < numRows) {
+        const auto rowIdx =
+            nodeGroupScanState.inMemCSRList.rowIndices[nextRow + nodeGroupScanState.nextRowToScan];
+        auto [chunkIdx, rowInChunk] =
+            StorageUtils::getQuotientRemainder(rowIdx, StorageConfig::CHUNKED_NODE_GROUP_CAPACITY);
+        if (chunkIdx != currentChunkIdx) {
+            currentChunkIdx = chunkIdx;
+            const auto lock = chunkedGroups.lock();
+            chunkedGroup = chunkedGroups.getGroup(lock, chunkIdx);
+        }
+        KU_ASSERT(chunkedGroup);
+        numSelected += chunkedGroup->lookup(transaction, tableState, nodeGroupScanState, rowInChunk,
+            numSelected);
+        nextRow++;
+    }
+    nodeGroupScanState.nextRowToScan += numRows;
+    tableState.outState->getSelVectorUnsafe().setSelSize(numSelected);
+    return NodeGroupScanResult{0, numRows};
+}
+
+void CSRNodeGroup::appendChunkedCSRGroup(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, InMemChunkedCSRNodeGroup& chunkedGroup) {
+    const auto& csrHeader = chunkedGroup.getCSRHeader();
+    std::vector<const ColumnChunkData*> chunkedGroupForProperties(chunkedGroup.getNumColumns());
+    for (auto i = 0u; i < chunkedGroup.getNumColumns(); i++) {
+        chunkedGroupForProperties[i] = &chunkedGroup.getColumnChunk(i);
+    }
+    auto startRow = NodeGroup::append(transaction, columnIDs, chunkedGroupForProperties, 0,
+        chunkedGroup.getNumRows());
+    if (!csrIndex) {
+        csrIndex = std::make_unique<CSRIndex>();
+    }
+    for (auto i = 0u; i < csrHeader.offset->getNumValues(); i++) {
+        const auto length = csrHeader.length->getValue<length_t>(i);
+        updateCSRIndex(i, startRow, length);
+        startRow += length;
+    }
+}
+
+void CSRNodeGroup::append(const Transaction* transaction, const std::vector<column_id_t>& columnIDs,
+    offset_t boundOffsetInGroup, std::span<const ColumnChunk*> chunks, row_idx_t startRowInChunks,
+    row_idx_t numRows) {
+    const auto startRow =
+        NodeGroup::append(transaction, columnIDs, chunks, startRowInChunks, numRows);
+    if (!csrIndex) {
+        csrIndex = std::make_unique<CSRIndex>();
+    }
+    updateCSRIndex(boundOffsetInGroup, startRow, 1 /*length*/);
+}
+
+void CSRNodeGroup::updateCSRIndex(offset_t boundNodeOffsetInGroup, row_idx_t startRow,
+    length_t length) const {
+    auto& nodeCSRIndex = csrIndex->indices[boundNodeOffsetInGroup];
+    const auto isEmptyCSR = nodeCSRIndex.rowIndices.empty();
+    const auto appendToEndOfCSR =
+        !isEmptyCSR && nodeCSRIndex.isSequential &&
+        (nodeCSRIndex.rowIndices[0] + nodeCSRIndex.rowIndices[1] == startRow);
+    const bool sequential = isEmptyCSR || appendToEndOfCSR;
+    if (nodeCSRIndex.isSequential && !sequential) {
+        // Expand rowIndices for the node.
+        const auto csrListStartRow = nodeCSRIndex.rowIndices[0];
+        const auto csrListLength = nodeCSRIndex.rowIndices[1];
+        nodeCSRIndex.rowIndices.clear();
+        nodeCSRIndex.rowIndices.reserve(csrListLength + length);
+        for (auto j = 0u; j < csrListLength; j++) {
+            nodeCSRIndex.rowIndices.push_back(csrListStartRow + j);
+        }
+    }
+    if (sequential) {
+        nodeCSRIndex.isSequential = true;
+        if (!nodeCSRIndex.rowIndices.empty()) {
+            KU_ASSERT(appendToEndOfCSR);
+            nodeCSRIndex.rowIndices[1] += length;
+        } else {
+            nodeCSRIndex.rowIndices.resize(2);
+            nodeCSRIndex.rowIndices[0] = startRow;
+            nodeCSRIndex.rowIndices[1] = length;
+        }
+    } else {
+        nodeCSRIndex.isSequential = false;
+        for (auto j = 0u; j < length; j++) {
+            nodeCSRIndex.rowIndices.push_back(startRow + j);
+        }
+        std::sort(nodeCSRIndex.rowIndices.begin(), nodeCSRIndex.rowIndices.end());
+    }
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void CSRNodeGroup::update(const Transaction* transaction, CSRNodeGroupScanSource source,
+    row_idx_t rowIdxInGroup, column_id_t columnID, const ValueVector& propertyVector) {
+    switch (source) {
+    case CSRNodeGroupScanSource::COMMITTED_PERSISTENT: {
+        KU_ASSERT(persistentChunkGroup);
+        return persistentChunkGroup->update(transaction, rowIdxInGroup, columnID, propertyVector);
+    }
+    case CSRNodeGroupScanSource::COMMITTED_IN_MEMORY: {
+        KU_ASSERT(csrIndex);
+        auto [chunkIdx, rowInChunk] = StorageUtils::getQuotientRemainder(rowIdxInGroup,
+            StorageConfig::CHUNKED_NODE_GROUP_CAPACITY);
+        const auto lock = chunkedGroups.lock();
+        const auto chunkedGroup = chunkedGroups.getGroup(lock, chunkIdx);
+        return chunkedGroup->update(transaction, rowInChunk, columnID, propertyVector);
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+bool CSRNodeGroup::delete_(const Transaction* transaction, CSRNodeGroupScanSource source,
+    row_idx_t rowIdxInGroup) {
+    switch (source) {
+    case CSRNodeGroupScanSource::COMMITTED_PERSISTENT: {
+        KU_ASSERT(persistentChunkGroup);
+        return persistentChunkGroup->delete_(transaction, rowIdxInGroup);
+    }
+    case CSRNodeGroupScanSource::COMMITTED_IN_MEMORY: {
+        KU_ASSERT(csrIndex);
+        auto [chunkIdx, rowInChunk] = StorageUtils::getQuotientRemainder(rowIdxInGroup,
+            StorageConfig::CHUNKED_NODE_GROUP_CAPACITY);
+        const auto lock = chunkedGroups.lock();
+        const auto chunkedGroup = chunkedGroups.getGroup(lock, chunkIdx);
+        return chunkedGroup->delete_(transaction, rowInChunk);
+    }
+    default: {
+        return false;
+    }
+    }
+}
+
+void CSRNodeGroup::addColumn(TableAddColumnState& addColumnState, PageAllocator* pageAllocator,
+    ColumnStats* newColumnStats) {
+    if (persistentChunkGroup) {
+        persistentChunkGroup->addColumn(mm, addColumnState, enableCompression, pageAllocator,
+            newColumnStats);
+    }
+    NodeGroup::addColumn(addColumnState, pageAllocator, newColumnStats);
+}
+
+void CSRNodeGroup::serialize(Serializer& serializer) {
+    serializer.writeDebuggingInfo("node_group_idx");
+    serializer.write<node_group_idx_t>(nodeGroupIdx);
+    serializer.writeDebuggingInfo("enable_compression");
+    serializer.write<bool>(enableCompression);
+    serializer.writeDebuggingInfo("format");
+    serializer.write<NodeGroupDataFormat>(format);
+    serializer.writeDebuggingInfo("has_checkpointed_data");
+    serializer.write<bool>(persistentChunkGroup != nullptr);
+    if (persistentChunkGroup) {
+        serializer.writeDebuggingInfo("checkpointed_data");
+        persistentChunkGroup->serialize(serializer);
+    }
+}
+
+void CSRNodeGroup::checkpoint(MemoryManager&, NodeGroupCheckpointState& state) {
+    const auto lock = chunkedGroups.lock();
+    if (!persistentChunkGroup) {
+        checkpointInMemOnly(lock, state);
+    } else {
+        checkpointInMemAndOnDisk(lock, state);
+    }
+    checkpointDataTypesNoLock(state);
+}
+
+void CSRNodeGroup::reclaimStorage(PageAllocator& pageAllocator, const UniqLock& lock) const {
+    NodeGroup::reclaimStorage(pageAllocator, lock);
+    if (persistentChunkGroup) {
+        persistentChunkGroup->reclaimStorage(pageAllocator);
+    }
+}
+
+static std::unique_ptr<ChunkedCSRNodeGroup> createNewPersistentChunkGroup(
+    ChunkedCSRNodeGroup& oldPersistentChunkGroup, CSRNodeGroupCheckpointState& csrState) {
+    auto newGroup =
+        std::make_unique<ChunkedCSRNodeGroup>(oldPersistentChunkGroup, csrState.columnIDs);
+    // checkpointed columns have been moved to the new group, reclaim storage for dropped column
+    oldPersistentChunkGroup.reclaimStorage(csrState.pageAllocator);
+    return newGroup;
+}
+
+void CSRNodeGroup::checkpointInMemAndOnDisk(const UniqLock& lock, NodeGroupCheckpointState& state) {
+    // TODO(Guodong): Should skip early here if no changes in the node group, so we avoid scanning
+    // the csr header. Case: No insertions/deletions in persistent chunk and no in-mem chunks.
+    auto& csrState = state.cast<CSRNodeGroupCheckpointState>();
+    // Scan old csr header from disk and construct new csr header.
+    persistentChunkGroup->cast<ChunkedCSRNodeGroup>().scanCSRHeader(*state.mm, csrState);
+    csrState.newHeader =
+        std::make_unique<InMemChunkedCSRHeader>(*state.mm, false, StorageConfig::NODE_GROUP_SIZE);
+    // TODO(Guodong): Find max node offset in the node group.
+    csrState.newHeader->setNumValues(StorageConfig::NODE_GROUP_SIZE);
+    csrState.newHeader->copyFrom(*csrState.oldHeader);
+    auto leafRegions = collectLeafRegionsAndCSRLength(lock, csrState);
+    KU_ASSERT(std::is_sorted(leafRegions.begin(), leafRegions.end(),
+        [](const auto& a, const auto& b) { return a.regionIdx < b.regionIdx; }));
+    const auto regionsToCheckpoint = mergeRegionsToCheckpoint(csrState, leafRegions);
+    if (regionsToCheckpoint.empty()) {
+        // No csr regions need to be checkpointed, meaning nothing is updated or deleted.
+        // We should reset the version and update info of the persistent chunked group.
+        persistentChunkGroup->resetVersionAndUpdateInfo();
+        if (csrState.columnIDs.size() != persistentChunkGroup->getNumColumns()) {
+            // The column set of the node group has changed. We need to re-create the persistent
+            // chunked group.
+            persistentChunkGroup = createNewPersistentChunkGroup(
+                persistentChunkGroup->cast<ChunkedCSRNodeGroup>(), csrState);
+        }
+        return;
+    }
+    if (regionsToCheckpoint.size() == 1 &&
+        regionsToCheckpoint[0].level > DEFAULT_PACKED_CSR_INFO.calibratorTreeHeight) {
+        // Need to re-distribute all CSR regions in the node group.
+        redistributeCSRRegions(csrState, leafRegions);
+    } else {
+        for (auto& region : regionsToCheckpoint) {
+            csrState.newHeader->populateRegionCSROffsets(region, *csrState.oldHeader);
+            // The left node offset of a region should always maintain stable across length and
+            // offset changes.
+            KU_ASSERT(csrState.oldHeader->getStartCSROffset(region.leftNodeOffset) ==
+                      csrState.newHeader->getStartCSROffset(region.leftNodeOffset));
+        }
+    }
+
+    uint64_t numTuplesAfterCheckpoint = 0;
+    for (const auto& region : regionsToCheckpoint) {
+        for (auto i = region.leftNodeOffset; i <= region.rightNodeOffset; ++i) {
+            numTuplesAfterCheckpoint += csrState.newHeader->getCSRLength(i);
+        }
+    }
+    if (numTuplesAfterCheckpoint == 0) {
+        reclaimStorage(csrState.pageAllocator, lock);
+        persistentChunkGroup = nullptr;
+    } else {
+        KU_ASSERT(csrState.newHeader->sanityCheck());
+        for (const auto columnID : csrState.columnIDs) {
+            checkpointColumn(lock, columnID, csrState, regionsToCheckpoint);
+        }
+        checkpointCSRHeaderColumns(csrState);
+        persistentChunkGroup = createNewPersistentChunkGroup(
+            persistentChunkGroup->cast<ChunkedCSRNodeGroup>(), csrState);
+    }
+    finalizeCheckpoint(lock);
+}
+
+std::vector<CSRRegion> CSRNodeGroup::collectLeafRegionsAndCSRLength(const UniqLock& lock,
+    const CSRNodeGroupCheckpointState& csrState) const {
+    std::vector<CSRRegion> leafRegions;
+    constexpr auto numLeafRegions =
+        StorageConfig::NODE_GROUP_SIZE / StorageConfig::CSR_LEAF_REGION_SIZE;
+    leafRegions.reserve(numLeafRegions);
+    for (auto leafRegionIdx = 0u; leafRegionIdx < numLeafRegions; leafRegionIdx++) {
+        CSRRegion region(leafRegionIdx, 0 /*level*/);
+        collectRegionChangesAndUpdateHeaderLength(lock, region, csrState);
+        leafRegions.push_back(std::move(region));
+    }
+    return leafRegions;
+}
+
+void CSRNodeGroup::redistributeCSRRegions(const CSRNodeGroupCheckpointState& csrState,
+    const std::vector<CSRRegion>& leafRegions) {
+    KU_ASSERT(std::is_sorted(leafRegions.begin(), leafRegions.end(),
+        [](const auto& a, const auto& b) { return a.regionIdx < b.regionIdx; }));
+    KU_ASSERT(std::all_of(leafRegions.begin(), leafRegions.end(),
+        [](const CSRRegion& region) { return region.level == 0; }));
+    KU_UNUSED(leafRegions);
+    const auto rightCSROffsetOfRegions =
+        csrState.newHeader->populateStartCSROffsetsFromLength(true /* leaveGaps */);
+    csrState.newHeader->populateEndCSROffsetFromStartAndLength();
+    csrState.newHeader->finalizeCSRRegionEndOffsets(rightCSROffsetOfRegions);
+}
+
+void CSRNodeGroup::checkpointColumn(const UniqLock& lock, column_id_t columnID,
+    const CSRNodeGroupCheckpointState& csrState, const std::vector<CSRRegion>& regions) const {
+    std::vector<ChunkCheckpointState> chunkCheckpointStates;
+    chunkCheckpointStates.reserve(regions.size());
+    for (auto& region : regions) {
+        if (!region.needCheckpointColumn(columnID)) {
+            // Skip checkpoint for the column if it has no changes in the region.
+            continue;
+        }
+        auto regionCheckpointStates = checkpointColumnInRegion(lock, columnID, csrState, region);
+        // If there are no rows to write for the region, we don't aggressively reclaim the space in
+        // the region, but keep deleted rows as gaps. This can happen when all rows are deleted
+        // within the region.
+        for (auto& regionCheckpointState : regionCheckpointStates) {
+            chunkCheckpointStates.push_back(std::move(regionCheckpointState));
+        }
+    }
+    persistentChunkGroup->getColumnChunk(columnID).checkpoint(*csrState.columns[columnID],
+        std::move(chunkCheckpointStates), csrState.pageAllocator);
+}
+
+struct SegmentCursor {
+    SegmentCursor(LazySegmentScanner& scanner, offset_t leftCSROffset)
+        : scanner(scanner), it(scanner.begin()), curCSROffset(leftCSROffset) {}
+
+    void advance(offset_t n) {
+        curCSROffset += n;
+        it.advance(n);
+    }
+    void operator++() { advance(1); }
+
+    LazySegmentScanner& scanner;
+    LazySegmentScanner::Iterator it;
+    offset_t curCSROffset;
+};
+
+struct CheckpointReadCursor {
+    CheckpointReadCursor(LazySegmentScanner& scanner, offset_t leftCSROffset)
+        : cursor(scanner, leftCSROffset) {}
+
+    void advance(offset_t n) { cursor.advance(n); }
+    void operator++() { cursor.operator++(); }
+    offset_t getCSROffset() const { return cursor.curCSROffset; }
+
+    std::pair<ColumnChunkData*, offset_t> getDataToRead() {
+        if (cursor.it->segmentData == nullptr) {
+            cursor.scanner.scanSegmentIfNeeded(cursor.it.segmentIdx);
+        }
+        return {cursor.it->segmentData.get(), cursor.it.offsetInSegment};
+    }
+
+    bool canSkipRead() const { return cursor.it->segmentData == nullptr; }
+
+    template<typename Func>
+    void rangeSegments(common::length_t length, Func func) const {
+        cursor.scanner.rangeSegments(cursor.it, length, std::move(func));
+    }
+
+    SegmentCursor cursor;
+};
+
+/**
+ * Writes output into multiple "segments"
+ * Note that the segments in the output won't necessarily match the segments being read from the
+ * column chunk
+ * Lazy writes are supported:
+ * - when the cursor is advanced and we haven't written to the current position a "gap" is left
+ * - if there is currently a gap and we perform a write we start a new segment to be written to
+ */
+class CheckpointWriteCursor {
+public:
+    CheckpointWriteCursor(offset_t leftCSROffset, MemoryManager& memoryManager,
+        LogicalType& columnType, std::vector<ChunkCheckpointState>& outputSegments)
+        : segmentStartOffset(leftCSROffset), curCSROffset(leftCSROffset),
+          memoryManager(memoryManager), columnType(columnType), outputSegments(outputSegments) {
+        resetOutputChunk();
+    }
+
+    void advance(offset_t n) { curCSROffset += n; }
+    void operator++() { advance(1); }
+    offset_t getCSROffset() const { return curCSROffset; }
+
+    void finalize() {
+        if (currentOutputSegment->getNumValues() > 0) {
+            appendCurrentSegmentToOutput();
+        }
+    }
+
+    ColumnChunkData& getCurrentSegmentForWrite(offset_t numValuesToWrite) {
+        if (segmentStartOffset + currentOutputSegment->getNumValues() < curCSROffset) {
+            startNewSegment();
+        }
+        if (currentOutputSegment->getNumValues() + numValuesToWrite >
+            currentOutputSegment->getCapacity()) {
+            currentOutputSegment->resize(
+                std::bit_ceil(currentOutputSegment->getNumValues() + numValuesToWrite));
+        }
+        return *currentOutputSegment;
+    }
+
+    void appendToCurrentSegment(ColumnChunkData* data, offset_t srcOffset,
+        offset_t numValuesToAppend) {
+        getCurrentSegmentForWrite(numValuesToAppend).append(data, srcOffset, numValuesToAppend);
+    }
+
+private:
+    offset_t getInitChunkCapacity() const { return DEFAULT_VECTOR_CAPACITY; }
+
+    void resetOutputChunk() {
+        currentOutputSegment = ColumnChunkFactory::createColumnChunkData(memoryManager,
+            columnType.copy(), false, getInitChunkCapacity(), ResidencyState::IN_MEMORY);
+    }
+
+    void appendCurrentSegmentToOutput() {
+        outputSegments.emplace_back(std::move(currentOutputSegment), segmentStartOffset,
+            currentOutputSegment->getNumValues());
+    }
+
+    void startNewSegment() {
+        if (currentOutputSegment->getNumValues() > 0) {
+            appendCurrentSegmentToOutput();
+            resetOutputChunk();
+        }
+        segmentStartOffset = curCSROffset;
+    }
+
+    offset_t segmentStartOffset;
+    std::unique_ptr<ColumnChunkData> currentOutputSegment;
+    offset_t curCSROffset;
+
+    MemoryManager& memoryManager;
+    LogicalType& columnType;
+    std::vector<ChunkCheckpointState>& outputSegments;
+};
+
+static bool canSkipWrite(CheckpointReadCursor& readCursor, CheckpointWriteCursor& writeCursor) {
+    return readCursor.getCSROffset() == writeCursor.getCSROffset() && readCursor.canSkipRead();
+}
+
+static ChunkState scanCommittedUpdates(ColumnChunk& persistentChunk, Column* column,
+    LazySegmentScanner& scanner, offset_t startCSROffset, offset_t numRowsToScan) {
+    ChunkState chunkState;
+    persistentChunk.initializeScanState(chunkState, column);
+    persistentChunk.scanCommitted<ResidencyState::ON_DISK>(&DUMMY_CHECKPOINT_TRANSACTION,
+        chunkState, scanner, startCSROffset, numRowsToScan);
+    return chunkState;
+}
+
+static void writeCSRListNoPersistentDeletions(CheckpointReadCursor& readCursor,
+    CheckpointWriteCursor& writeCursor, offset_t oldCSRLength) {
+    readCursor.rangeSegments(oldCSRLength,
+        [&](auto& segmentData, auto offsetInSegment, auto lengthInSegment, auto) {
+            if (!canSkipWrite(readCursor, writeCursor)) {
+                [[maybe_unused]] auto [readSegmentData, readOffsetInSegment] =
+                    readCursor.getDataToRead();
+                KU_ASSERT(readSegmentData == segmentData.segmentData.get() &&
+                          readOffsetInSegment == offsetInSegment);
+                writeCursor.appendToCurrentSegment(segmentData.segmentData.get(), offsetInSegment,
+                    lengthInSegment);
+            }
+            readCursor.advance(lengthInSegment);
+            writeCursor.advance(lengthInSegment);
+        });
+}
+
+static void writeCSRListWithPersistentDeletions(CheckpointReadCursor& readCursor,
+    CheckpointWriteCursor& writeCursor, offset_t oldCSRLength,
+    const ChunkedNodeGroup& persistentChunkGroup) {
+    // TODO(Guodong): Optimize the for loop away by appending in batch
+    for (auto i = 0u; i < oldCSRLength; i++) {
+        if (!persistentChunkGroup.isDeleted(&DUMMY_CHECKPOINT_TRANSACTION,
+                readCursor.getCSROffset())) {
+            if (!canSkipWrite(readCursor, writeCursor)) {
+                auto [segmentData, offsetInSegment] = readCursor.getDataToRead();
+                writeCursor.appendToCurrentSegment(segmentData, offsetInSegment, 1);
+            }
+            ++writeCursor;
+        }
+        ++readCursor;
+    }
+}
+
+static void writeInMemoryCSRInsertion(CheckpointWriteCursor& writeCursor,
+    const ChunkedNodeGroup& chunkedGroup, row_idx_t rowInChunk, column_id_t columnID,
+    ChunkState& chunkState) {
+    KU_ASSERT(!chunkedGroup.isDeleted(&DUMMY_CHECKPOINT_TRANSACTION, rowInChunk));
+    chunkedGroup.getColumnChunk(columnID).scanCommitted<ResidencyState::IN_MEMORY>(
+        &DUMMY_CHECKPOINT_TRANSACTION, chunkState, writeCursor.getCurrentSegmentForWrite(1),
+        rowInChunk, 1);
+    ++writeCursor;
+}
+
+static void fillCSRGaps(CheckpointReadCursor& readCursor, CheckpointWriteCursor& writeCursor,
+    ColumnChunkData* dummyChunkForNulls, length_t numOldGaps, length_t numGaps) {
+    auto numOldGapsRemaining = numOldGaps;
+    auto numGapsRemaining = numGaps;
+    if (readCursor.getCSROffset() < writeCursor.getCSROffset()) {
+        // Try to advance read cursor to write cursor (if num old gaps is large enough)
+        const auto numGapsToAdvance =
+            std::min(numOldGapsRemaining, writeCursor.getCSROffset() - readCursor.getCSROffset());
+        readCursor.advance(numGapsToAdvance);
+        numOldGapsRemaining -= numGapsToAdvance;
+    }
+
+    // We can skip writes for any new gaps whose CSR offset also corresponds to an old gap
+    if (readCursor.getCSROffset() == writeCursor.getCSROffset()) {
+        auto numSkippableGaps = std::min(numGapsRemaining, numOldGapsRemaining);
+        numGapsRemaining -= numSkippableGaps;
+        writeCursor.advance(numSkippableGaps);
+    }
+
+    while (numGapsRemaining > 0) {
+        const auto numGapsToFill =
+            std::min(numGapsRemaining, static_cast<length_t>(DEFAULT_VECTOR_CAPACITY));
+        dummyChunkForNulls->setNumValues(numGapsToFill);
+        writeCursor.appendToCurrentSegment(dummyChunkForNulls, 0, numGapsToFill);
+        writeCursor.advance(numGapsToFill);
+        numGapsRemaining -= numGapsToFill;
+    }
+
+    readCursor.advance(numOldGapsRemaining);
+}
+
+std::vector<ChunkCheckpointState> CSRNodeGroup::checkpointColumnInRegion(const UniqLock& lock,
+    column_id_t columnID, const CSRNodeGroupCheckpointState& csrState,
+    const CSRRegion& region) const {
+    const auto leftCSROffset = csrState.oldHeader->getStartCSROffset(region.leftNodeOffset);
+    KU_ASSERT(leftCSROffset == csrState.newHeader->getStartCSROffset(region.leftNodeOffset));
+    const auto rightCSROffset = csrState.oldHeader->getEndCSROffset(region.rightNodeOffset);
+    const auto numOldRowsInRegion = rightCSROffset - leftCSROffset;
+
+    Column* column = csrState.columns[columnID];
+    LazySegmentScanner oldChunkScanner{*csrState.mm, column->getDataType().copy(),
+        enableCompression};
+    auto chunkState = scanCommittedUpdates(persistentChunkGroup->getColumnChunk(columnID), column,
+        oldChunkScanner, leftCSROffset, numOldRowsInRegion);
+
+    const auto dummyChunkForNulls = ColumnChunkFactory::createColumnChunkData(*csrState.mm,
+        dataTypes[columnID].copy(), false, DEFAULT_VECTOR_CAPACITY, ResidencyState::IN_MEMORY);
+    dummyChunkForNulls->resetToAllNull();
+
+    std::vector<ChunkCheckpointState> ret;
+
+    CheckpointReadCursor readCursor{oldChunkScanner, leftCSROffset};
+    CheckpointWriteCursor writeCursor{leftCSROffset, *csrState.mm, column->getDataType(), ret};
+
+    // Copy per csr list from old chunk and merge with new insertions into the newChunkData.
+    for (auto nodeOffset = region.leftNodeOffset; nodeOffset <= region.rightNodeOffset;
+         nodeOffset++) {
+        const auto oldCSRLength = csrState.oldHeader->getCSRLength(nodeOffset);
+
+        KU_ASSERT(csrState.newHeader->getStartCSROffset(nodeOffset) == writeCursor.getCSROffset());
+        KU_ASSERT(csrState.oldHeader->getStartCSROffset(nodeOffset) == readCursor.getCSROffset());
+
+        // Copy old csr list with updates into the new chunk.
+        if (!region.hasPersistentDeletions) {
+            writeCSRListNoPersistentDeletions(readCursor, writeCursor, oldCSRLength);
+        } else {
+            writeCSRListWithPersistentDeletions(readCursor, writeCursor, oldCSRLength,
+                *persistentChunkGroup);
+        }
+        // Merge in-memory insertions into the new chunk.
+        if (csrIndex) {
+            auto rows = csrIndex->indices[nodeOffset].getRows();
+            // TODO(Guodong): Optimize here. if no deletions and has sequential rows, scan in
+            // range.
+            for (const auto row : rows) {
+                if (row == INVALID_ROW_IDX) {
+                    continue;
+                }
+                auto [chunkIdx, rowInChunk] = StorageUtils::getQuotientRemainder(row,
+                    StorageConfig::CHUNKED_NODE_GROUP_CAPACITY);
+                const auto chunkedGroup = chunkedGroups.getGroup(lock, chunkIdx);
+                writeInMemoryCSRInsertion(writeCursor, *chunkedGroup, rowInChunk, columnID,
+                    chunkState);
+            }
+        }
+
+        const length_t numGaps = csrState.newHeader->getGapSize(nodeOffset);
+        const length_t numOldGaps = csrState.oldHeader->getGapSize(nodeOffset);
+        // Gaps should only happen at the end of the CSR region.
+        KU_ASSERT(numGaps == 0 || (nodeOffset == region.rightNodeOffset - 1) ||
+                  (nodeOffset + 1) % StorageConfig::CSR_LEAF_REGION_SIZE == 0);
+        fillCSRGaps(readCursor, writeCursor, dummyChunkForNulls.get(), numOldGaps, numGaps);
+    }
+    writeCursor.finalize();
+    KU_ASSERT(readCursor.getCSROffset() - leftCSROffset == numOldRowsInRegion);
+    KU_ASSERT(
+        writeCursor.getCSROffset() == csrState.newHeader->getEndCSROffset(region.rightNodeOffset));
+    // We can't skip writing appends as they need to be flushed to disk
+    KU_ASSERT(readCursor.getCSROffset() == writeCursor.getCSROffset() || ret.empty() ||
+              ret.back().startRow + ret.back().numRows == writeCursor.getCSROffset());
+    return ret;
+}
+
+void CSRNodeGroup::checkpointCSRHeaderColumns(const CSRNodeGroupCheckpointState& csrState) const {
+    std::vector<ChunkCheckpointState> csrOffsetChunkCheckpointStates;
+    const auto numNodes = csrState.newHeader->offset->getNumValues();
+    KU_ASSERT(numNodes == csrState.newHeader->length->getNumValues());
+    csrOffsetChunkCheckpointStates.push_back(
+        ChunkCheckpointState{std::move(csrState.newHeader->offset), 0, numNodes});
+    persistentChunkGroup->cast<ChunkedCSRNodeGroup>().getCSRHeader().offset->checkpoint(
+        *csrState.csrOffsetColumn, std::move(csrOffsetChunkCheckpointStates),
+        csrState.pageAllocator);
+    std::vector<ChunkCheckpointState> csrLengthChunkCheckpointStates;
+    csrLengthChunkCheckpointStates.push_back(
+        ChunkCheckpointState{std::move(csrState.newHeader->length), 0, numNodes});
+    persistentChunkGroup->cast<ChunkedCSRNodeGroup>().getCSRHeader().length->checkpoint(
+        *csrState.csrLengthColumn, std::move(csrLengthChunkCheckpointStates),
+        csrState.pageAllocator);
+}
+
+void CSRNodeGroup::collectRegionChangesAndUpdateHeaderLength(const UniqLock& lock,
+    CSRRegion& region, const CSRNodeGroupCheckpointState& csrState) const {
+    collectInMemRegionChangesAndUpdateHeaderLength(lock, region, csrState);
+    collectOnDiskRegionChangesAndUpdateHeaderLength(lock, region, csrState);
+}
+
+void CSRNodeGroup::collectInMemRegionChangesAndUpdateHeaderLength(const UniqLock& lock,
+    CSRRegion& region, const CSRNodeGroupCheckpointState& csrState) const {
+    row_idx_t numInsertionsInRegion = 0u;
+    if (csrIndex) {
+        for (auto nodeOffset = region.leftNodeOffset; nodeOffset <= region.rightNodeOffset;
+             nodeOffset++) {
+            auto rows = csrIndex->indices[nodeOffset].getRows();
+            row_idx_t numInsertedRows = rows.size();
+            row_idx_t numInMemDeletionsInCSR = 0;
+            for (auto i = 0u; i < rows.size(); i++) {
+                const auto row = rows[i];
+                auto [chunkIdx, rowInChunk] = StorageUtils::getQuotientRemainder(row,
+                    StorageConfig::CHUNKED_NODE_GROUP_CAPACITY);
+                const auto chunkedGroup = chunkedGroups.getGroup(lock, chunkIdx);
+                if (chunkedGroup->isDeleted(&DUMMY_CHECKPOINT_TRANSACTION, rowInChunk)) {
+                    csrIndex->indices[nodeOffset].turnToNonSequential();
+                    csrIndex->indices[nodeOffset].setInvalid(i);
+                    numInMemDeletionsInCSR++;
+                }
+            }
+            KU_ASSERT(numInMemDeletionsInCSR <= numInsertedRows);
+            numInsertedRows -= numInMemDeletionsInCSR;
+            const auto oldLength = csrState.oldHeader->getCSRLength(nodeOffset);
+            const auto newLength = oldLength + numInsertedRows;
+            csrState.newHeader->length->setValue<length_t>(newLength, nodeOffset);
+            numInsertionsInRegion += numInsertedRows;
+        }
+    }
+    region.hasInsertions = numInsertionsInRegion > 0;
+    region.sizeChange += static_cast<int64_t>(numInsertionsInRegion);
+}
+
+void CSRNodeGroup::collectOnDiskRegionChangesAndUpdateHeaderLength(const UniqLock&,
+    CSRRegion& region, const CSRNodeGroupCheckpointState& csrState) const {
+    collectPersistentUpdatesInRegion(region, csrState);
+    int64_t numDeletionsInRegion = 0u;
+    if (persistentChunkGroup) {
+        for (auto nodeOffset = region.leftNodeOffset; nodeOffset <= region.rightNodeOffset;
+             nodeOffset++) {
+            const auto numDeletedRows =
+                getNumDeletionsForNodeInPersistentData(nodeOffset, csrState);
+            if (numDeletedRows == 0) {
+                continue;
+            }
+            numDeletionsInRegion += numDeletedRows;
+            const auto currentLength = csrState.newHeader->getCSRLength(nodeOffset);
+            KU_ASSERT(currentLength >= numDeletedRows);
+            csrState.newHeader->length->setValue<length_t>(currentLength - numDeletedRows,
+                nodeOffset);
+        }
+    }
+    region.hasPersistentDeletions = numDeletionsInRegion > 0;
+    region.sizeChange -= numDeletionsInRegion;
+}
+
+void CSRNodeGroup::collectPersistentUpdatesInRegion(CSRRegion& region,
+    const CSRNodeGroupCheckpointState& csrState) const {
+    const auto leftCSROffset = csrState.oldHeader->getStartCSROffset(region.leftNodeOffset);
+    const auto rightCSROffset = csrState.oldHeader->getEndCSROffset(region.rightNodeOffset);
+    region.hasUpdates.resize(csrState.columnIDs.size(), false);
+    for (auto i = 0u; i < csrState.columnIDs.size(); i++) {
+        auto columnID = csrState.columnIDs[i];
+        if (persistentChunkGroup->hasAnyUpdates(&DUMMY_CHECKPOINT_TRANSACTION, columnID,
+                leftCSROffset, rightCSROffset - leftCSROffset + 1)) {
+            region.hasUpdates[i] = true;
+        }
+    }
+}
+
+row_idx_t CSRNodeGroup::getNumDeletionsForNodeInPersistentData(offset_t nodeOffset,
+    const CSRNodeGroupCheckpointState& csrState) const {
+    const auto length = csrState.oldHeader->getCSRLength(nodeOffset);
+    const auto startRow = csrState.oldHeader->getStartCSROffset(nodeOffset);
+    return persistentChunkGroup->getNumDeletions(&DUMMY_CHECKPOINT_TRANSACTION, startRow, length);
+}
+
+static DataChunk initScanDataChunk(const CSRNodeGroupCheckpointState& csrState,
+    const std::vector<LogicalType>& dataTypes) {
+    const auto scanChunkState = std::make_shared<DataChunkState>();
+    DataChunk dataChunk(csrState.columnIDs.size(), scanChunkState);
+    for (auto i = 0u; i < csrState.columnIDs.size(); i++) {
+        const auto columnID = csrState.columnIDs[i];
+        KU_ASSERT(columnID < dataTypes.size());
+        const auto valueVector =
+            std::make_shared<ValueVector>(dataTypes[columnID].copy(), csrState.mm);
+        dataChunk.insert(i, valueVector);
+    }
+    return dataChunk;
+}
+
+void CSRNodeGroup::checkpointInMemOnly(const UniqLock& lock, NodeGroupCheckpointState& state) {
+    auto numRels = 0u;
+    for (auto& chunkedGroup : chunkedGroups.getAllGroups(lock)) {
+        numRels += chunkedGroup->getNumRows();
+    }
+    if (numRels == 0) {
+        return;
+    }
+    // Construct in-mem csr header chunks.
+    auto& csrState = state.cast<CSRNodeGroupCheckpointState>();
+    csrState.newHeader = std::make_unique<InMemChunkedCSRHeader>(*state.mm,
+        false /*enableCompression*/, StorageConfig::NODE_GROUP_SIZE);
+    const auto numNodes = csrIndex->getMaxOffsetWithRels() + 1;
+    csrState.newHeader->setNumValues(numNodes);
+    populateCSRLengthInMemOnly(lock, numNodes, csrState);
+    const auto rightCSROffsetsOfRegions =
+        csrState.newHeader->populateStartCSROffsetsFromLength(true /* leaveGap */);
+    csrState.newHeader->populateEndCSROffsetFromStartAndLength();
+    csrState.newHeader->finalizeCSRRegionEndOffsets(rightCSROffsetsOfRegions);
+
+    // Init scan chunk and scan state.
+    const auto numColumnsToCheckpoint = csrState.columnIDs.size();
+    auto scanChunk = initScanDataChunk(csrState, dataTypes);
+    std::vector<const Column*> columns(numColumnsToCheckpoint);
+    for (auto i = 0u; i < numColumnsToCheckpoint; i++) {
+        columns[i] = csrState.columns[i];
+    }
+    std::vector<ValueVector*> outVectors;
+    for (auto i = 0u; i < numColumnsToCheckpoint; i++) {
+        outVectors.push_back(scanChunk.valueVectors[i].get());
+    }
+    auto scanState = std::make_unique<TableScanState>(nullptr, outVectors, scanChunk.state);
+    scanState->columnIDs = csrState.columnIDs;
+    scanState->columns = columns;
+    scanState->nodeGroupScanState =
+        std::make_unique<CSRNodeGroupScanState>(csrState.columnIDs.size());
+
+    auto dummyChunk = initScanDataChunk(csrState, dataTypes);
+    for (auto i = 0u; i < dummyChunk.getNumValueVectors(); i++) {
+        dummyChunk.getValueVectorMutable(i).setAllNull();
+    }
+
+    // Init data chunks to be appended and flushed.
+    auto chunkCapacity = rightCSROffsetsOfRegions.back() + 1;
+    std::vector<std::unique_ptr<ColumnChunk>> dataChunksToFlush(numColumnsToCheckpoint);
+    for (auto i = 0u; i < numColumnsToCheckpoint; i++) {
+        const auto columnID = csrState.columnIDs[i];
+        KU_ASSERT(columnID < dataTypes.size());
+        dataChunksToFlush[i] = std::make_unique<ColumnChunk>(*state.mm, dataTypes[columnID].copy(),
+            chunkCapacity, enableCompression, ResidencyState::IN_MEMORY);
+    }
+
+    // Scan tuples from in mem node groups and append to data chunks to flush.
+    for (auto offset = 0u; offset < numNodes; offset++) {
+        const auto numRows = csrIndex->getNumRows(offset);
+        auto rows = csrIndex->indices[offset].getRows();
+        auto numRowsTryAppended = 0u;
+        while (numRowsTryAppended < numRows) {
+            const auto maxNumRowsToAppend =
+                std::min(numRows - numRowsTryAppended, DEFAULT_VECTOR_CAPACITY);
+            auto numRowsToAppend = 0u;
+            for (auto i = 0u; i < maxNumRowsToAppend; i++) {
+                const auto row = rows[numRowsTryAppended + i];
+                // TODO(Guodong): Should skip deleted rows here.
+                if (row == INVALID_ROW_IDX) {
+                    continue;
+                }
+                scanState->rowIdxVector->setValue<row_idx_t>(numRowsToAppend++, row);
+            }
+            scanChunk.state->getSelVectorUnsafe().setSelSize(numRowsToAppend);
+            if (numRowsToAppend > 0) {
+                [[maybe_unused]] auto res =
+                    lookupMultiple(lock, &DUMMY_CHECKPOINT_TRANSACTION, *scanState);
+                for (auto idx = 0u; idx < numColumnsToCheckpoint; idx++) {
+                    dataChunksToFlush[idx]->append(scanChunk.valueVectors[idx].get(),
+                        scanChunk.state->getSelVector());
+                }
+            }
+            numRowsTryAppended += maxNumRowsToAppend;
+        }
+        auto gapSize = csrState.newHeader->getGapSize(offset);
+        while (gapSize > 0) {
+            // Gaps should only happen at the end of the CSR region.
+            KU_ASSERT((offset == numNodes - 1) ||
+                      (offset + 1) % StorageConfig::CSR_LEAF_REGION_SIZE == 0);
+            const auto numGapsToAppend = std::min(gapSize, DEFAULT_VECTOR_CAPACITY);
+            KU_ASSERT(dummyChunk.state->getSelVector().isUnfiltered());
+            dummyChunk.state->getSelVectorUnsafe().setSelSize(numGapsToAppend);
+            for (auto columnID = 0u; columnID < numColumnsToCheckpoint; columnID++) {
+                dataChunksToFlush[columnID]->append(dummyChunk.valueVectors[columnID].get(),
+                    dummyChunk.state->getSelVector());
+            }
+            gapSize -= numGapsToAppend;
+        }
+    }
+
+    // FIXME(bmwinger): this needs segmentation. Maybe this should use (or share code with)
+    // checkpointOutOfPlace Flush data chunks to disk.
+    for (const auto& chunk : dataChunksToFlush) {
+        chunk->flush(csrState.pageAllocator);
+    }
+    csrState.newHeader->offset->flush(csrState.pageAllocator);
+    csrState.newHeader->length->flush(csrState.pageAllocator);
+    persistentChunkGroup = std::make_unique<ChunkedCSRNodeGroup>(
+        ChunkedCSRHeader(false /*enableCompression*/, std::move(*csrState.newHeader)),
+        std::move(dataChunksToFlush), 0);
+    // TODO(Guodong): Use `finalizeCheckpoint`.
+    chunkedGroups.clear(lock);
+    // Set `numRows` back to 0 is to reflect that the in mem part of the node group is empty.
+    numRows = 0;
+    csrIndex.reset();
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void CSRNodeGroup::populateCSRLengthInMemOnly(const UniqLock& lock, offset_t numNodes,
+    const CSRNodeGroupCheckpointState& csrState) {
+    for (auto offset = 0u; offset < numNodes; offset++) {
+        auto rows = csrIndex->indices[offset].getRows();
+        const length_t length = rows.size();
+        auto lengthAfterDelete = length;
+        for (auto i = 0u; i < rows.size(); i++) {
+            const auto row = rows[i];
+            auto [chunkIdx, rowInChunk] =
+                StorageUtils::getQuotientRemainder(row, StorageConfig::CHUNKED_NODE_GROUP_CAPACITY);
+            const auto chunkedGroup = chunkedGroups.getGroup(lock, chunkIdx);
+            const auto isDeleted =
+                chunkedGroup->isDeleted(&DUMMY_CHECKPOINT_TRANSACTION, rowInChunk);
+            if (isDeleted) {
+                csrIndex->indices[offset].turnToNonSequential();
+                csrIndex->indices[offset].setInvalid(i);
+                lengthAfterDelete--;
+            }
+        }
+        KU_ASSERT(lengthAfterDelete <= length);
+        csrState.newHeader->length->setValue<length_t>(lengthAfterDelete, offset);
+    }
+}
+
+std::vector<CSRRegion> CSRNodeGroup::mergeRegionsToCheckpoint(
+    const CSRNodeGroupCheckpointState& csrState, const std::vector<CSRRegion>& leafRegions) {
+    KU_ASSERT(std::all_of(leafRegions.begin(), leafRegions.end(),
+        [](const CSRRegion& region) { return region.level == 0; }));
+    KU_ASSERT(std::is_sorted(leafRegions.begin(), leafRegions.end(),
+        [](const CSRRegion& a, const CSRRegion& b) { return a.regionIdx < b.regionIdx; }));
+    constexpr auto numLeafRegions =
+        StorageConfig::NODE_GROUP_SIZE / StorageConfig::CSR_LEAF_REGION_SIZE;
+    KU_ASSERT(leafRegions.size() == numLeafRegions);
+    std::vector<CSRRegion> mergedRegions;
+    idx_t leafRegionIdx = 0u;
+    while (leafRegionIdx < numLeafRegions) {
+        auto region = leafRegions[leafRegionIdx];
+        if (!region.needCheckpoint()) {
+            leafRegionIdx++;
+            continue;
+        }
+        while (!isWithinDensityBound(*csrState.oldHeader, leafRegions, region)) {
+            region = CSRRegion::upgradeLevel(leafRegions, region);
+            if (region.level > DEFAULT_PACKED_CSR_INFO.calibratorTreeHeight) {
+                // Hit the top level already. Need to re-distribute.
+                return {region};
+            }
+        }
+        // Skip to the next right leaf region of the found region.
+        leafRegionIdx = region.getRightLeafRegionIdx() + 1;
+        // Loop through found regions and eliminate the ones that are under the realm of the
+        // currently found region.
+        std::erase_if(mergedRegions, [&](const CSRRegion& r) { return r.isWithin(region); });
+        mergedRegions.push_back(region);
+    }
+    std::sort(mergedRegions.begin(), mergedRegions.end(),
+        [](const CSRRegion& a, const CSRRegion& b) {
+            return a.getLeftLeafRegionIdx() < b.getLeftLeafRegionIdx();
+        });
+    return mergedRegions;
+}
+
+static double getHighDensity(uint64_t level) {
+    KU_ASSERT(level <= CSRNodeGroup::DEFAULT_PACKED_CSR_INFO.calibratorTreeHeight);
+    if (level == 0) {
+        return StorageConstants::LEAF_HIGH_CSR_DENSITY;
+    }
+    return StorageConstants::PACKED_CSR_DENSITY +
+           CSRNodeGroup::DEFAULT_PACKED_CSR_INFO.highDensityStep *
+               static_cast<double>(
+                   CSRNodeGroup::DEFAULT_PACKED_CSR_INFO.calibratorTreeHeight - level);
+}
+
+bool CSRNodeGroup::isWithinDensityBound(const InMemChunkedCSRHeader& header,
+    const std::vector<CSRRegion>& leafRegions, const CSRRegion& region) {
+    int64_t oldSize = 0;
+    for (auto offset = region.leftNodeOffset; offset <= region.rightNodeOffset; offset++) {
+        oldSize += header.getCSRLength(offset);
+    }
+    int64_t sizeChange = 0;
+    const idx_t leftRegionIdx = region.getLeftLeafRegionIdx();
+    const idx_t rightRegionIdx = region.getRightLeafRegionIdx();
+    for (auto regionIdx = leftRegionIdx; regionIdx <= rightRegionIdx; regionIdx++) {
+        sizeChange += leafRegions[regionIdx].sizeChange;
+    }
+    KU_ASSERT(sizeChange >= 0 || sizeChange < oldSize);
+    const auto newSize = oldSize + sizeChange;
+    const auto capacity = header.getEndCSROffset(region.rightNodeOffset) -
+                          header.getStartCSROffset(region.leftNodeOffset);
+    const double ratio = static_cast<double>(newSize) / static_cast<double>(capacity);
+    return ratio <= getHighDensity(region.level);
+}
+
+void CSRNodeGroup::finalizeCheckpoint(const UniqLock& lock) {
+    // Clean up versions and in mem chunked groups.
+    if (persistentChunkGroup) {
+        persistentChunkGroup->resetNumRowsFromChunks();
+        persistentChunkGroup->resetVersionAndUpdateInfo();
+    }
+    chunkedGroups.clear(lock);
+    // Set `numRows` back to 0 is to reflect that the in mem part of the node group is empty.
+    numRows = 0;
+    csrIndex.reset();
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/dictionary_chunk.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/dictionary_chunk.cpp
new file mode 100644
index 0000000000..526819326d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/dictionary_chunk.cpp
@@ -0,0 +1,127 @@
+#include "storage/table/dictionary_chunk.h"
+
+#include "common/constants.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "storage/enums/residency_state.h"
+#include <bit>
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+// The offset chunk is able to grow beyond the node group size.
+// We rely on appending to the dictionary when updating, however if the chunk is full,
+// there will be no space for in-place updates.
+// The data chunk doubles in size on use, but out of place updates will never need the offset
+// chunk to be greater than the node group size since they remove unused entries.
+// So the chunk is initialized with a size equal to 3 so that the capacity is never resized to
+// exactly the node group size (which is always a power of 2), making sure there is always extra
+// space for updates.
+static constexpr uint64_t INITIAL_OFFSET_CHUNK_CAPACITY = 3;
+
+DictionaryChunk::DictionaryChunk(MemoryManager& mm, uint64_t capacity, bool enableCompression,
+    ResidencyState residencyState)
+    : enableCompression{enableCompression},
+      indexTable(0, StringOps(this) /*hash*/, StringOps(this) /*equals*/) {
+    // Bitpacking might save 1 bit per value with regular ascii compared to UTF-8
+    stringDataChunk = ColumnChunkFactory::createColumnChunkData(mm, LogicalType::UINT8(),
+        false /*enableCompression*/, 0, residencyState, false /*hasNullData*/);
+    offsetChunk = ColumnChunkFactory::createColumnChunkData(mm, LogicalType::UINT64(),
+        enableCompression, std::min(capacity, INITIAL_OFFSET_CHUNK_CAPACITY), residencyState,
+        false /*hasNullData*/);
+}
+
+void DictionaryChunk::resetToEmpty() {
+    stringDataChunk->resetToEmpty();
+    offsetChunk->resetToEmpty();
+    indexTable.clear();
+}
+
+uint64_t DictionaryChunk::getStringLength(string_index_t index) const {
+    if (stringDataChunk->getNumValues() == 0) {
+        return 0;
+    }
+    if (index + 1 < offsetChunk->getNumValues()) {
+        KU_ASSERT(offsetChunk->getValue<string_offset_t>(index + 1) >=
+                  offsetChunk->getValue<string_offset_t>(index));
+        return offsetChunk->getValue<string_offset_t>(index + 1) -
+               offsetChunk->getValue<string_offset_t>(index);
+    }
+    return stringDataChunk->getNumValues() - offsetChunk->getValue<string_offset_t>(index);
+}
+
+DictionaryChunk::string_index_t DictionaryChunk::appendString(std::string_view val) {
+    const auto found = indexTable.find(val);
+    // If the string already exists in the dictionary, skip it and refer to the existing string
+    if (enableCompression && found != indexTable.end()) {
+        return found->index;
+    }
+    const auto leftSpace = stringDataChunk->getCapacity() - stringDataChunk->getNumValues();
+    if (leftSpace < val.size()) {
+        stringDataChunk->resize(std::bit_ceil(stringDataChunk->getCapacity() + val.size()));
+    }
+    const auto startOffset = stringDataChunk->getNumValues();
+    memcpy(stringDataChunk->getData() + startOffset, val.data(), val.size());
+    stringDataChunk->setNumValues(startOffset + val.size());
+    const auto index = offsetChunk->getNumValues();
+    if (index >= offsetChunk->getCapacity()) {
+        offsetChunk->resize(offsetChunk->getCapacity() == 0 ?
+                                2 :
+                                (offsetChunk->getCapacity() * CHUNK_RESIZE_RATIO));
+    }
+    offsetChunk->setValue<string_offset_t>(startOffset, index);
+    offsetChunk->setNumValues(index + 1);
+    if (enableCompression) {
+        indexTable.insert({static_cast<string_index_t>(index)});
+    }
+    return index;
+}
+
+std::string_view DictionaryChunk::getString(string_index_t index) const {
+    KU_ASSERT(index < offsetChunk->getNumValues());
+    const auto startOffset = offsetChunk->getValue<string_offset_t>(index);
+    const auto length = getStringLength(index);
+    return std::string_view(reinterpret_cast<const char*>(stringDataChunk->getData()) + startOffset,
+        length);
+}
+
+bool DictionaryChunk::sanityCheck() const {
+    return offsetChunk->getNumValues() <= offsetChunk->getNumValues();
+}
+
+void DictionaryChunk::resetNumValuesFromMetadata() {
+    stringDataChunk->resetNumValuesFromMetadata();
+    offsetChunk->resetNumValuesFromMetadata();
+}
+
+uint64_t DictionaryChunk::getEstimatedMemoryUsage() const {
+    return stringDataChunk->getEstimatedMemoryUsage() + offsetChunk->getEstimatedMemoryUsage();
+}
+
+void DictionaryChunk::flush(PageAllocator& pageAllocator) {
+    stringDataChunk->flush(pageAllocator);
+    offsetChunk->flush(pageAllocator);
+}
+
+void DictionaryChunk::serialize(Serializer& serializer) const {
+    serializer.writeDebuggingInfo("offset_chunk");
+    offsetChunk->serialize(serializer);
+    serializer.writeDebuggingInfo("string_data_chunk");
+    stringDataChunk->serialize(serializer);
+}
+
+std::unique_ptr<DictionaryChunk> DictionaryChunk::deserialize(MemoryManager& memoryManager,
+    Deserializer& deSer) {
+    auto chunk = std::make_unique<DictionaryChunk>(memoryManager, 0, true, ResidencyState::ON_DISK);
+    std::string key;
+    deSer.validateDebuggingInfo(key, "offset_chunk");
+    chunk->offsetChunk = ColumnChunkData::deserialize(memoryManager, deSer);
+    deSer.validateDebuggingInfo(key, "string_data_chunk");
+    chunk->stringDataChunk = ColumnChunkData::deserialize(memoryManager, deSer);
+    return chunk;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/dictionary_column.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/dictionary_column.cpp
new file mode 100644
index 0000000000..11a734ba45
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/dictionary_column.cpp
@@ -0,0 +1,266 @@
+#include "storage/table/dictionary_column.h"
+
+#include <algorithm>
+#include <cstdint>
+
+#include "common/types/ku_string.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/dictionary_chunk.h"
+#include "storage/table/string_chunk_data.h"
+#include "storage/table/string_column.h"
+#include <bit>
+#include <concepts>
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+using string_index_t = DictionaryChunk::string_index_t;
+using string_offset_t = DictionaryChunk::string_offset_t;
+
+DictionaryColumn::DictionaryColumn(const std::string& name, FileHandle* dataFH, MemoryManager* mm,
+    ShadowFile* shadowFile, bool enableCompression) {
+    auto dataColName = StorageUtils::getColumnName(name, StorageUtils::ColumnType::DATA, "");
+    dataColumn = std::make_unique<Column>(dataColName, LogicalType::UINT8(), dataFH, mm, shadowFile,
+        false /*enableCompression*/, false /*requireNullColumn*/);
+    auto offsetColName = StorageUtils::getColumnName(name, StorageUtils::ColumnType::OFFSET, "");
+    offsetColumn = std::make_unique<Column>(offsetColName, LogicalType::UINT64(), dataFH, mm,
+        shadowFile, enableCompression, false /*requireNullColumn*/);
+}
+
+void DictionaryColumn::scan(const SegmentState& state, DictionaryChunk& dictChunk) const {
+    auto offsetChunk = dictChunk.getOffsetChunk();
+    auto stringDataChunk = dictChunk.getStringDataChunk();
+    auto initialDictSize = offsetChunk->getNumValues();
+    auto initialDictDataSize = stringDataChunk->getNumValues();
+
+    auto& dataMetadata =
+        StringColumn::getChildState(state, StringColumn::ChildStateIndex::DATA).metadata;
+    // Make sure that the chunk is large enough
+    if (stringDataChunk->getNumValues() + dataMetadata.numValues > stringDataChunk->getCapacity()) {
+        stringDataChunk->resize(
+            std::bit_ceil(stringDataChunk->getNumValues() + dataMetadata.numValues));
+    }
+    dataColumn->scanSegment(StringColumn::getChildState(state, StringColumn::ChildStateIndex::DATA),
+        stringDataChunk, 0,
+        StringColumn::getChildState(state, StringColumn::ChildStateIndex::DATA).metadata.numValues);
+
+    auto& offsetMetadata =
+        StringColumn::getChildState(state, StringColumn::ChildStateIndex::OFFSET).metadata;
+    // Make sure that the chunk is large enough
+    if (offsetChunk->getNumValues() + offsetMetadata.numValues > offsetChunk->getCapacity()) {
+        offsetChunk->resize(std::bit_ceil(offsetChunk->getNumValues() + offsetMetadata.numValues));
+    }
+    offsetColumn->scanSegment(
+        StringColumn::getChildState(state, StringColumn::ChildStateIndex::OFFSET), offsetChunk, 0,
+        StringColumn::getChildState(state, StringColumn::ChildStateIndex::OFFSET)
+            .metadata.numValues);
+    // Each offset needs to be incremented by the initial size of the dictionary data chunk
+    for (row_idx_t i = initialDictSize; i < offsetChunk->getNumValues(); i++) {
+        offsetChunk->setValue<string_offset_t>(
+            offsetChunk->getValue<string_offset_t>(i) + initialDictDataSize, i);
+    }
+}
+
+template<typename Result>
+void DictionaryColumn::scan(const SegmentState& offsetState, const SegmentState& dataState,
+    std::vector<std::pair<string_index_t, uint64_t>>& offsetsToScan, Result* result,
+    const ColumnChunkMetadata& indexMeta) const {
+    string_index_t firstOffsetToScan = 0, lastOffsetToScan = 0;
+    auto comp = [](auto pair1, auto pair2) { return pair1.first < pair2.first; };
+    auto duplicationFactor = (double)offsetState.metadata.numValues / indexMeta.numValues;
+    if (duplicationFactor <= 0.5) {
+        // If at least 50% of strings are duplicated, sort the offsets so we can re-use scanned
+        // strings
+        std::sort(offsetsToScan.begin(), offsetsToScan.end(), comp);
+        firstOffsetToScan = offsetsToScan.front().first;
+        lastOffsetToScan = offsetsToScan.back().first;
+    } else {
+        const auto& [min, max] =
+            std::minmax_element(offsetsToScan.begin(), offsetsToScan.end(), comp);
+        firstOffsetToScan = min->first;
+        lastOffsetToScan = max->first;
+    }
+    // TODO(bmwinger): scan batches of adjacent values.
+    // Ideally we scan values together until we reach empty pages
+    // This would also let us use the same optimization for the data column,
+    // where the worst case for the current method is much worse
+
+    // Note that the list will contain duplicates when indices are duplicated.
+    // Each distinct value is scanned once, and re-used when writing to each output value
+    auto numOffsetsToScan = lastOffsetToScan - firstOffsetToScan + 1;
+    // One extra offset to scan for the end offset of the last string
+    std::vector<string_offset_t> offsets(numOffsetsToScan + 1);
+    scanOffsets(offsetState, offsets.data(), firstOffsetToScan, numOffsetsToScan,
+        dataState.metadata.numValues);
+
+    if constexpr (std::same_as<Result, ColumnChunkData>) {
+        auto& offsetChunk = *result->getDictionaryChunk()->getOffsetChunk();
+        if (offsetChunk.getNumValues() + offsetsToScan.size() > offsetChunk.getCapacity()) {
+            offsetChunk.resize(std::bit_ceil(offsetChunk.getNumValues() + offsetsToScan.size()));
+        }
+    }
+
+    for (auto pos = 0u; pos < offsetsToScan.size(); pos++) {
+        auto startOffset = offsets[offsetsToScan[pos].first - firstOffsetToScan];
+        auto endOffset = offsets[offsetsToScan[pos].first - firstOffsetToScan + 1];
+        auto lengthToScan = endOffset - startOffset;
+        KU_ASSERT(endOffset >= startOffset);
+        scanValue(dataState, startOffset, lengthToScan, result, offsetsToScan[pos].second);
+        // For each string which has the same index in the dictionary as the one we scanned,
+        // copy the scanned string to its position in the result vector
+        if constexpr (std::same_as<Result, ValueVector>) {
+            auto& scannedString = result->template getValue<ku_string_t>(offsetsToScan[pos].second);
+            while (pos + 1 < offsetsToScan.size() &&
+                   offsetsToScan[pos + 1].first == offsetsToScan[pos].first) {
+                pos++;
+                result->template setValue<ku_string_t>(offsetsToScan[pos].second, scannedString);
+            }
+        } else {
+            // When scanning to chunks de-duplication should be done prior to this function such
+            // that you can have multiple positions in the string index chunk pointing to one string
+            // in this dictionary chunk.
+            // The offset chunk cannot have multiple offsets pointing to the same data, even if
+            // consecutive, since that would break the mechanism for calculating the size of a
+            // string.
+            KU_ASSERT(pos == offsetsToScan.size() - 1 ||
+                      offsetsToScan[pos].first != offsetsToScan[pos + 1].first);
+        }
+    }
+}
+
+template void DictionaryColumn::scan<common::ValueVector>(const SegmentState& offsetState,
+    const SegmentState& dataState,
+    std::vector<std::pair<DictionaryChunk::string_index_t, uint64_t>>& offsetsToScan,
+    common::ValueVector* result, const ColumnChunkMetadata& indexMeta) const;
+
+template void DictionaryColumn::scan<StringChunkData>(const SegmentState& offsetState,
+    const SegmentState& dataState,
+    std::vector<std::pair<DictionaryChunk::string_index_t, uint64_t>>& offsetsToScan,
+    StringChunkData* result, const ColumnChunkMetadata& indexMeta) const;
+
+string_index_t DictionaryColumn::append(const DictionaryChunk& dictChunk, SegmentState& state,
+    std::string_view val) const {
+    const auto startOffset = dataColumn->appendValues(*dictChunk.getStringDataChunk(),
+        StringColumn::getChildState(state, StringColumn::ChildStateIndex::DATA),
+        reinterpret_cast<const uint8_t*>(val.data()), nullptr /*nullChunkData*/, val.size());
+    return offsetColumn->appendValues(*dictChunk.getOffsetChunk(),
+        StringColumn::getChildState(state, StringColumn::ChildStateIndex::OFFSET),
+        reinterpret_cast<const uint8_t*>(&startOffset), nullptr /*nullChunkData*/, 1 /*numValues*/);
+}
+
+void DictionaryColumn::scanOffsets(const SegmentState& state,
+    DictionaryChunk::string_offset_t* offsets, uint64_t index, uint64_t numValues,
+    uint64_t dataSize) const {
+    // We either need to read the next value, or store the maximum string offset at the end.
+    // Otherwise we won't know what the length of the last string is.
+    if (index + numValues < state.metadata.numValues) {
+        offsetColumn->scanSegment(state, index, numValues + 1, (uint8_t*)offsets);
+    } else {
+        offsetColumn->scanSegment(state, index, numValues, (uint8_t*)offsets);
+        offsets[numValues] = dataSize;
+    }
+}
+
+void DictionaryColumn::scanValue(const SegmentState& dataState, uint64_t startOffset,
+    uint64_t length, ValueVector* resultVector, uint64_t offsetInVector) const {
+    // Add string to vector first and read directly into the vector
+    auto& kuString = StringVector::reserveString(resultVector, offsetInVector, length);
+    dataColumn->scanSegment(dataState, startOffset, length, (uint8_t*)kuString.getData());
+    // Update prefix to match the scanned string data
+    if (!ku_string_t::isShortString(kuString.len)) {
+        memcpy(kuString.prefix, kuString.getData(), ku_string_t::PREFIX_LENGTH);
+    }
+}
+
+void DictionaryColumn::scanValue(const SegmentState& dataState, uint64_t startOffset,
+    uint64_t length, StringChunkData* result, uint64_t offsetInResult) const {
+    auto& stringDataChunk = *result->getDictionaryChunk().getStringDataChunk();
+    auto& offsetChunk = *result->getDictionaryChunk().getOffsetChunk();
+    auto& indexChunk = *result->getIndexColumnChunk();
+    if (stringDataChunk.getCapacity() < stringDataChunk.getNumValues() + length) {
+        stringDataChunk.resize(std::bit_ceil(stringDataChunk.getNumValues() + length));
+    }
+    if (offsetChunk.getNumValues() == offsetChunk.getCapacity()) {
+        offsetChunk.resize(std::bit_ceil(offsetChunk.getNumValues() + 1));
+    }
+    if (offsetInResult >= indexChunk.getCapacity()) {
+        indexChunk.resize(std::bit_ceil(offsetInResult + 1));
+    }
+    dataColumn->scanSegment(dataState, startOffset, length,
+        stringDataChunk.getData<uint8_t>() + stringDataChunk.getNumValues());
+    indexChunk.setValue<string_index_t>(offsetChunk.getNumValues(), offsetInResult);
+    offsetChunk.setValue<string_offset_t>(stringDataChunk.getNumValues(),
+        offsetChunk.getNumValues());
+    stringDataChunk.setNumValues(stringDataChunk.getNumValues() + length);
+}
+
+bool DictionaryColumn::canCommitInPlace(const SegmentState& state, uint64_t numNewStrings,
+    uint64_t totalStringLengthToAdd) const {
+    if (!canDataCommitInPlace(
+            StringColumn::getChildState(state, StringColumn::ChildStateIndex::DATA),
+            totalStringLengthToAdd)) {
+        return false;
+    }
+    if (!canOffsetCommitInPlace(
+            StringColumn::getChildState(state, StringColumn::ChildStateIndex::OFFSET),
+            StringColumn::getChildState(state, StringColumn::ChildStateIndex::DATA), numNewStrings,
+            totalStringLengthToAdd)) {
+        return false;
+    }
+    return true;
+}
+
+bool DictionaryColumn::canDataCommitInPlace(const SegmentState& dataState,
+    uint64_t totalStringLengthToAdd) {
+    // Make sure there is sufficient space in the data chunk (not currently compressed)
+    auto totalStringDataAfterUpdate = dataState.metadata.numValues + totalStringLengthToAdd;
+    if (totalStringDataAfterUpdate > dataState.metadata.getNumPages() * LBUG_PAGE_SIZE) {
+        // Data cannot be updated in place
+        return false;
+    }
+    return true;
+}
+
+bool DictionaryColumn::canOffsetCommitInPlace(const SegmentState& offsetState,
+    const SegmentState& dataState, uint64_t numNewStrings, uint64_t totalStringLengthToAdd) const {
+    auto totalStringOffsetsAfterUpdate = dataState.metadata.numValues + totalStringLengthToAdd;
+    auto offsetCapacity =
+        offsetState.metadata.compMeta.numValues(LBUG_PAGE_SIZE, offsetColumn->getDataType()) *
+        offsetState.metadata.getNumPages();
+    auto numStringsAfterUpdate = offsetState.metadata.numValues + numNewStrings;
+    if (numStringsAfterUpdate > offsetCapacity) {
+        // Offsets cannot be updated in place
+        return false;
+    }
+    // Indices are limited to 32 bits but in theory could be larger than that since the offset
+    // column can grow beyond the node group size.
+    //
+    // E.g. one big string is written first, followed by NODE_GROUP_SIZE-1 small strings,
+    // which are all updated in-place many times (which may fit if the first string is large
+    // enough that 2^n minus the first string's size is large enough to fit the other strings,
+    // for some n.
+    // 32 bits should give plenty of space for updates.
+    if (numStringsAfterUpdate > std::numeric_limits<string_index_t>::max()) [[unlikely]] {
+        return false;
+    }
+    if (offsetState.metadata.compMeta.canAlwaysUpdateInPlace()) {
+        return true;
+    }
+    InPlaceUpdateLocalState localUpdateState{};
+    if (!offsetState.metadata.compMeta.canUpdateInPlace(
+            (const uint8_t*)&totalStringOffsetsAfterUpdate, 0 /*offset*/, 1 /*numValues*/,
+            offsetColumn->getDataType().getPhysicalType(), localUpdateState)) {
+        return false;
+    }
+    return true;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/in_mem_chunked_node_group_collection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/in_mem_chunked_node_group_collection.cpp
new file mode 100644
index 0000000000..32ff78d440
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/in_mem_chunked_node_group_collection.cpp
@@ -0,0 +1,51 @@
+#include "storage/table/in_mem_chunked_node_group_collection.h"
+
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+void InMemChunkedNodeGroupCollection::append(MemoryManager& memoryManager,
+    const std::vector<ValueVector*>& vectors, row_idx_t startRowInVectors,
+    row_idx_t numRowsToAppend) {
+    if (chunkedGroups.empty()) {
+        chunkedGroups.push_back(std::make_unique<InMemChunkedNodeGroup>(memoryManager, types,
+            false /*enableCompression*/, common::StorageConfig::CHUNKED_NODE_GROUP_CAPACITY,
+            0 /*startOffset*/));
+    }
+    row_idx_t numRowsAppended = 0;
+    while (numRowsAppended < numRowsToAppend) {
+        auto& lastChunkedGroup = chunkedGroups.back();
+        auto numRowsToAppendInGroup = std::min(numRowsToAppend - numRowsAppended,
+            common::StorageConfig::CHUNKED_NODE_GROUP_CAPACITY - lastChunkedGroup->getNumRows());
+        lastChunkedGroup->append(vectors, startRowInVectors, numRowsToAppendInGroup);
+        if (lastChunkedGroup->getNumRows() == common::StorageConfig::CHUNKED_NODE_GROUP_CAPACITY) {
+            lastChunkedGroup->setUnused(memoryManager);
+            chunkedGroups.push_back(std::make_unique<InMemChunkedNodeGroup>(memoryManager, types,
+                false /*enableCompression*/, common::StorageConfig::CHUNKED_NODE_GROUP_CAPACITY,
+                0 /* startRowIdx */));
+        }
+        numRowsAppended += numRowsToAppendInGroup;
+    }
+}
+
+void InMemChunkedNodeGroupCollection::merge(std::unique_ptr<InMemChunkedNodeGroup> chunkedGroup) {
+    KU_ASSERT(chunkedGroup->getNumColumns() == types.size());
+    for (auto i = 0u; i < chunkedGroup->getNumColumns(); i++) {
+        KU_ASSERT(chunkedGroup->getColumnChunk(i).getDataType() == types[i]);
+    }
+    chunkedGroups.push_back(std::move(chunkedGroup));
+}
+
+void InMemChunkedNodeGroupCollection::merge(InMemChunkedNodeGroupCollection& other) {
+    chunkedGroups.reserve(chunkedGroups.size() + other.chunkedGroups.size());
+    for (auto& chunkedGroup : other.chunkedGroups) {
+        merge(std::move(chunkedGroup));
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/in_memory_exception_chunk.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/in_memory_exception_chunk.cpp
new file mode 100644
index 0000000000..96990f89f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/in_memory_exception_chunk.cpp
@@ -0,0 +1,160 @@
+#include "storage/table/in_memory_exception_chunk.h"
+
+#include <algorithm>
+
+#include "common/utils.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/compression/float_compression.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column.h"
+#include "storage/table/column_chunk_data.h"
+#include <concepts>
+
+namespace lbug::storage {
+
+using namespace common;
+using namespace transaction;
+
+template<std::floating_point T>
+using ExceptionInBuffer = std::array<std::byte, EncodeException<T>::sizeInBytes()>;
+
+template<std::floating_point T>
+InMemoryExceptionChunk<T>::InMemoryExceptionChunk(const SegmentState& state, FileHandle* dataFH,
+    MemoryManager* memoryManager, ShadowFile* shadowFile)
+    : exceptionCount(state.metadata.compMeta.floatMetadata()->exceptionCount),
+      finalizedExceptionCount(exceptionCount),
+      exceptionCapacity(state.metadata.compMeta.floatMetadata()->exceptionCapacity),
+      emptyMask(exceptionCapacity),
+      column(std::make_unique<Column>("ALPExceptionChunk", physicalType, dataFH, memoryManager,
+          shadowFile, false, false /*has nulls*/)) {
+    const auto exceptionBaseCursor =
+        getExceptionPageCursor(state.metadata, PageCursor{state.metadata.getStartPageIdx(), 0},
+            state.metadata.compMeta.floatMetadata()->exceptionCapacity);
+    // for ALP exceptions we don't care about the statistics
+    const auto compMeta =
+        CompressionMetadata(StorageValue{0}, StorageValue{1}, CompressionType::UNCOMPRESSED);
+    const auto exceptionChunkMeta = ColumnChunkMetadata(exceptionBaseCursor.pageIdx,
+        safeIntegerConversion<page_idx_t>(
+            EncodeException<T>::numPagesFromExceptions(exceptionCapacity)),
+        exceptionCapacity, compMeta);
+    chunkState = std::make_unique<SegmentState>(exceptionChunkMeta,
+        EncodeException<T>::exceptionBytesPerPage() / EncodeException<T>::sizeInBytes());
+
+    chunkData =
+        std::make_unique<ColumnChunkData>(*memoryManager, physicalType, false, exceptionChunkMeta,
+            false /*all written data is non-null and nulls are kept in a separate mask in-memory*/);
+    chunkData->setToInMemory();
+    column->scanSegment(*chunkState, chunkData.get(), 0, chunkState->metadata.numValues);
+}
+
+template<std::floating_point T>
+InMemoryExceptionChunk<T>::~InMemoryExceptionChunk() = default;
+
+template<std::floating_point T>
+void InMemoryExceptionChunk<T>::finalizeAndFlushToDisk(SegmentState& state) {
+    finalize(state);
+
+    column->writeSegment(*chunkData, *chunkState, 0, *chunkData, 0, exceptionCapacity);
+}
+
+template<std::floating_point T>
+void InMemoryExceptionChunk<T>::finalize(SegmentState& state) {
+    // removes holes + sorts exception chunk
+    finalizedExceptionCount = 0;
+    for (size_t i = 0; i < exceptionCount; ++i) {
+        if (!emptyMask.isNull(i)) {
+            ++finalizedExceptionCount;
+            if (finalizedExceptionCount - 1 == i) {
+                continue;
+            }
+            writeException(getExceptionAt(i), finalizedExceptionCount - 1);
+        }
+    }
+
+    KU_ASSERT(
+        finalizedExceptionCount <= state.metadata.compMeta.floatMetadata()->exceptionCapacity);
+    state.metadata.compMeta.floatMetadata()->exceptionCount = finalizedExceptionCount;
+
+    ExceptionInBuffer<T>* exceptionWordBuffer =
+        reinterpret_cast<ExceptionInBuffer<T>*>(chunkData->getData());
+    std::sort(exceptionWordBuffer, exceptionWordBuffer + finalizedExceptionCount,
+        [](ExceptionInBuffer<T>& a, ExceptionInBuffer<T>& b) {
+            return EncodeExceptionView<T>{reinterpret_cast<std::byte*>(&a)}.getValue() <
+                   EncodeExceptionView<T>{reinterpret_cast<std::byte*>(&b)}.getValue();
+        });
+    std::memset(chunkData->getData() + finalizedExceptionCount * EncodeException<T>::sizeInBytes(),
+        0, (exceptionCount - finalizedExceptionCount) * EncodeException<T>::sizeInBytes());
+    emptyMask.setNullFromRange(0, finalizedExceptionCount, false);
+    emptyMask.setNullFromRange(finalizedExceptionCount, (exceptionCount - finalizedExceptionCount),
+        true);
+    exceptionCount = finalizedExceptionCount;
+    chunkData->setNumValues(finalizedExceptionCount);
+}
+
+template<std::floating_point T>
+void InMemoryExceptionChunk<T>::addException(EncodeException<T> exception) {
+    KU_ASSERT(exceptionCount < exceptionCapacity);
+    ++exceptionCount;
+    writeException(exception, exceptionCount - 1);
+    emptyMask.setNull(exceptionCount - 1, false);
+}
+
+template<std::floating_point T>
+void InMemoryExceptionChunk<T>::removeExceptionAt(size_t exceptionIdx) {
+    // removing an exception does not free up space in the exception buffer
+    emptyMask.setNull(exceptionIdx, true);
+}
+
+template<std::floating_point T>
+EncodeException<T> InMemoryExceptionChunk<T>::getExceptionAt(size_t exceptionIdx) const {
+    KU_ASSERT(exceptionIdx < exceptionCount);
+    auto bytesInBuffer = chunkData->getValue<ExceptionInBuffer<T>>(exceptionIdx);
+    return EncodeExceptionView<T>{reinterpret_cast<std::byte*>(&bytesInBuffer)}.getValue();
+}
+
+template<std::floating_point T>
+void InMemoryExceptionChunk<T>::writeException(EncodeException<T> exception, size_t exceptionIdx) {
+    KU_ASSERT(exceptionIdx < exceptionCount);
+    EncodeExceptionView<T>{reinterpret_cast<std::byte*>(chunkData->getData())}.setValue(exception,
+        exceptionIdx);
+}
+
+template<std::floating_point T>
+offset_t InMemoryExceptionChunk<T>::findFirstExceptionAtOrPastOffset(offset_t offsetInChunk) const {
+    // binary search for chunkOffset in exceptions
+    // we only search among non-finalized exceptions
+
+    offset_t lo = 0;
+    offset_t hi = finalizedExceptionCount;
+    while (lo < hi) {
+        const size_t curExceptionIdx = (lo + hi) / 2;
+        EncodeException<T> lastException = getExceptionAt(curExceptionIdx);
+
+        if (lastException.posInChunk < offsetInChunk) {
+            lo = curExceptionIdx + 1;
+        } else {
+            hi = curExceptionIdx;
+        }
+    }
+
+    return lo;
+}
+
+template<std::floating_point T>
+PageCursor InMemoryExceptionChunk<T>::getExceptionPageCursor(const ColumnChunkMetadata& metadata,
+    PageCursor pageBaseCursor, size_t exceptionCapacity) {
+    const size_t numExceptionPages = EncodeException<T>::numPagesFromExceptions(exceptionCapacity);
+    const size_t exceptionPageOffset = metadata.getNumPages() - numExceptionPages;
+    KU_ASSERT(exceptionPageOffset == (page_idx_t)exceptionPageOffset);
+    return {pageBaseCursor.pageIdx + (page_idx_t)exceptionPageOffset, 0};
+}
+
+template<std::floating_point T>
+size_t InMemoryExceptionChunk<T>::getExceptionCount() const {
+    return finalizedExceptionCount;
+}
+
+template class InMemoryExceptionChunk<float>;
+template class InMemoryExceptionChunk<double>;
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/lazy_segment_scanner.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/lazy_segment_scanner.cpp
new file mode 100644
index 0000000000..23cdf1510b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/lazy_segment_scanner.cpp
@@ -0,0 +1,47 @@
+#include "storage/table/lazy_segment_scanner.h"
+
+namespace lbug::storage {
+void LazySegmentScanner::Iterator::advance(common::offset_t n) {
+    segmentScanner.rangeSegments(*this, n,
+        [this](auto& segmentData, auto, auto lengthInSegment, auto) {
+            KU_ASSERT(segmentData.length > offsetInSegment);
+            if (segmentData.length - offsetInSegment == lengthInSegment) {
+                ++segmentIdx;
+                offsetInSegment = 0;
+            } else {
+                offsetInSegment += lengthInSegment;
+            }
+        });
+}
+
+void LazySegmentScanner::scanSegment(common::offset_t offsetInSegment,
+    common::offset_t segmentLength, scan_func_t newScanFunc) {
+    segments.emplace_back(nullptr, offsetInSegment, segmentLength, std::move(newScanFunc));
+    numValues += segmentLength;
+}
+
+void LazySegmentScanner::applyCommittedUpdates(const UpdateInfo& updateInfo,
+    const transaction::Transaction* transaction, common::offset_t startRow,
+    common::offset_t numRows) {
+    KU_ASSERT(numRows == numValues);
+    rangeSegments(begin(), numRows,
+        [&](auto& segment, common::offset_t, common::offset_t lengthInSegment,
+            common::offset_t offsetInChunk) {
+            updateInfo.iterateScan(transaction, startRow + offsetInChunk, lengthInSegment, 0,
+                [&](const VectorUpdateInfo& vecUpdateInfo, uint64_t i,
+                    uint64_t posInOutput) -> void {
+                    scanSegmentIfNeeded(segment);
+                    segment.segmentData->write(vecUpdateInfo.data.get(), i, posInOutput, 1);
+                });
+        });
+}
+
+void LazySegmentScanner::scanSegmentIfNeeded(LazySegmentData& segment) {
+    if (segment.segmentData == nullptr) {
+        segment.segmentData = ColumnChunkFactory::createColumnChunkData(mm, columnType.copy(),
+            enableCompression, segment.length, ResidencyState::IN_MEMORY);
+
+        segment.scanFunc(*segment.segmentData, segment.startOffsetInSegment, segment.length);
+    }
+}
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/list_chunk_data.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/list_chunk_data.cpp
new file mode 100644
index 0000000000..c57c9efb80
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/list_chunk_data.cpp
@@ -0,0 +1,462 @@
+#include "storage/table/list_chunk_data.h"
+
+#include <cmath>
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/list_column.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+ListChunkData::ListChunkData(MemoryManager& memoryManager, LogicalType dataType, uint64_t capacity,
+    bool enableCompression, ResidencyState residencyState)
+    : ColumnChunkData{memoryManager, std::move(dataType), capacity, enableCompression,
+          residencyState, true /*hasNullData*/} {
+    offsetColumnChunk = ColumnChunkFactory::createColumnChunkData(memoryManager,
+        LogicalType::UINT64(), enableCompression, capacity, residencyState, false /*hasNull*/);
+    sizeColumnChunk = ColumnChunkFactory::createColumnChunkData(memoryManager,
+        LogicalType::UINT32(), enableCompression, capacity, residencyState, false /*hasNull*/);
+    if (ListColumn::disableCompressionOnData(this->dataType)) {
+        enableCompression = false;
+    }
+    dataColumnChunk = ColumnChunkFactory::createColumnChunkData(memoryManager,
+        ListType::getChildType(this->dataType).copy(), enableCompression, 0 /* capacity */,
+        residencyState);
+    checkOffsetSortedAsc = false;
+    KU_ASSERT(this->dataType.getPhysicalType() == PhysicalTypeID::LIST ||
+              this->dataType.getPhysicalType() == PhysicalTypeID::ARRAY);
+}
+
+ListChunkData::ListChunkData(MemoryManager& memoryManager, LogicalType dataType,
+    bool enableCompression, const ColumnChunkMetadata& metadata)
+    : ColumnChunkData{memoryManager, std::move(dataType), enableCompression, metadata,
+          true /*hasNullData*/},
+      checkOffsetSortedAsc{false} {
+    offsetColumnChunk = ColumnChunkFactory::createColumnChunkData(memoryManager,
+        LogicalType::UINT64(), enableCompression, 0, ResidencyState::ON_DISK);
+    sizeColumnChunk = ColumnChunkFactory::createColumnChunkData(memoryManager,
+        LogicalType::UINT32(), enableCompression, 0, ResidencyState::ON_DISK);
+    if (ListColumn::disableCompressionOnData(this->dataType)) {
+        enableCompression = false;
+    }
+    dataColumnChunk = ColumnChunkFactory::createColumnChunkData(memoryManager,
+        ListType::getChildType(this->dataType).copy(), enableCompression, 0 /* capacity */,
+        ResidencyState::ON_DISK);
+}
+
+bool ListChunkData::isOffsetsConsecutiveAndSortedAscending(uint64_t startPos,
+    uint64_t endPos) const {
+    offset_t prevEndOffset = getListStartOffset(startPos);
+    for (auto i = startPos; i < endPos; i++) {
+        offset_t currentEndOffset = getListEndOffset(i);
+        auto size = getListSize(i);
+        prevEndOffset += size;
+        if (currentEndOffset != prevEndOffset) {
+            return false;
+        }
+    }
+    return true;
+}
+
+offset_t ListChunkData::getListStartOffset(offset_t offset) const {
+    if (numValues == 0 || (offset != numValues && nullData->isNull(offset))) {
+        return 0;
+    }
+    KU_ASSERT(offset == numValues || getListEndOffset(offset) >= getListSize(offset));
+    return offset == numValues ? getListEndOffset(offset - 1) :
+                                 getListEndOffset(offset) - getListSize(offset);
+}
+
+offset_t ListChunkData::getListEndOffset(offset_t offset) const {
+    if (numValues == 0 || nullData->isNull(offset)) {
+        return 0;
+    }
+    KU_ASSERT(offset < numValues);
+    return offsetColumnChunk->getValue<uint64_t>(offset);
+}
+
+list_size_t ListChunkData::getListSize(offset_t offset) const {
+    if (numValues == 0 || nullData->isNull(offset)) {
+        return 0;
+    }
+    KU_ASSERT(offset < sizeColumnChunk->getNumValues());
+    return sizeColumnChunk->getValue<list_size_t>(offset);
+}
+
+void ListChunkData::setOffsetChunkValue(offset_t val, offset_t pos) {
+    offsetColumnChunk->setValue(val, pos);
+
+    // we will keep numValues in the main column synchronized
+    numValues = offsetColumnChunk->getNumValues();
+}
+
+void ListChunkData::append(const ColumnChunkData* other, offset_t startPosInOtherChunk,
+    uint32_t numValuesToAppend) {
+    checkOffsetSortedAsc = true;
+    auto& otherListChunk = other->cast<ListChunkData>();
+    nullData->append(other->getNullData(), startPosInOtherChunk, numValuesToAppend);
+    offset_t offsetInDataChunkToAppend = dataColumnChunk->getNumValues();
+    for (auto i = 0u; i < numValuesToAppend; i++) {
+        auto appendSize = otherListChunk.getListSize(startPosInOtherChunk + i);
+        sizeColumnChunk->setValue<list_size_t>(appendSize, numValues);
+        offsetInDataChunkToAppend += appendSize;
+        setOffsetChunkValue(offsetInDataChunkToAppend, numValues);
+    }
+    dataColumnChunk->resize(offsetInDataChunkToAppend);
+    for (auto i = 0u; i < numValuesToAppend; i++) {
+        auto startOffset = otherListChunk.getListStartOffset(startPosInOtherChunk + i);
+        auto appendSize = otherListChunk.getListSize(startPosInOtherChunk + i);
+        dataColumnChunk->append(otherListChunk.dataColumnChunk.get(), startOffset, appendSize);
+    }
+    KU_ASSERT(sanityCheck());
+}
+
+void ListChunkData::resetToEmpty() {
+    ColumnChunkData::resetToEmpty();
+    sizeColumnChunk->resetToEmpty();
+    offsetColumnChunk->resetToEmpty();
+    dataColumnChunk->resetToEmpty();
+}
+
+void ListChunkData::resetNumValuesFromMetadata() {
+    ColumnChunkData::resetNumValuesFromMetadata();
+    sizeColumnChunk->resetNumValuesFromMetadata();
+    offsetColumnChunk->resetNumValuesFromMetadata();
+    dataColumnChunk->resetNumValuesFromMetadata();
+}
+
+void ListChunkData::append(ValueVector* vector, const SelectionView& selView) {
+    auto numToAppend = selView.getSelSize();
+    auto newCapacity = capacity;
+    while (numValues + numToAppend >= newCapacity) {
+        newCapacity = std::ceil(newCapacity * 1.5);
+    }
+    if (capacity < newCapacity) {
+        resize(newCapacity);
+    }
+    offset_t nextListOffsetInChunk = dataColumnChunk->getNumValues();
+    const offset_t appendBaseOffset = numValues;
+    for (auto i = 0u; i < selView.getSelSize(); i++) {
+        auto pos = selView[i];
+        auto listLen = vector->isNull(pos) ? 0 : vector->getValue<list_entry_t>(pos).size;
+        sizeColumnChunk->setValue<list_size_t>(listLen, appendBaseOffset + i);
+
+        nullData->setNull(appendBaseOffset + i, vector->isNull(pos));
+
+        nextListOffsetInChunk += listLen;
+        setOffsetChunkValue(nextListOffsetInChunk, appendBaseOffset + i);
+    }
+    dataColumnChunk->resize(nextListOffsetInChunk);
+    auto dataVector = ListVector::getDataVector(vector);
+    for (auto i = 0u; i < selView.getSelSize(); i++) {
+        auto pos = selView[i];
+        if (vector->isNull(pos)) {
+            continue;
+        }
+        copyListValues(vector->getValue<list_entry_t>(pos), dataVector);
+    }
+    KU_ASSERT(sanityCheck());
+}
+
+void ListChunkData::appendNullList() {
+    offset_t nextListOffsetInChunk = dataColumnChunk->getNumValues();
+    const offset_t appendPosition = numValues;
+    sizeColumnChunk->setValue<list_size_t>(0, appendPosition);
+    setOffsetChunkValue(nextListOffsetInChunk, appendPosition);
+    nullData->setNull(appendPosition, true);
+}
+
+void ListChunkData::scan(ValueVector& output, offset_t offset, length_t length,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offset + length <= numValues);
+    if (nullData) {
+        nullData->scan(output, offset, length, posInOutputVector);
+    }
+    auto currentListDataSize = ListVector::getDataVectorSize(&output);
+    auto dataSize = 0ul;
+    for (auto i = 0u; i < length; i++) {
+        auto listSize = getListSize(offset + i);
+        output.setValue<list_entry_t>(posInOutputVector + i,
+            list_entry_t{currentListDataSize + dataSize, listSize});
+        dataSize += listSize;
+    }
+    ListVector::resizeDataVector(&output, currentListDataSize + dataSize);
+    auto dataVector = ListVector::getDataVector(&output);
+    if (isOffsetsConsecutiveAndSortedAscending(offset, offset + length)) {
+        dataColumnChunk->scan(*dataVector, getListStartOffset(offset), dataSize,
+            currentListDataSize);
+    } else {
+        for (auto i = 0u; i < length; i++) {
+            auto startOffset = getListStartOffset(offset + i);
+            auto listSize = getListSize(offset + i);
+            dataColumnChunk->scan(*dataVector, startOffset, listSize, currentListDataSize);
+            currentListDataSize += listSize;
+        }
+    }
+}
+
+void ListChunkData::lookup(offset_t offsetInChunk, ValueVector& output,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offsetInChunk < numValues);
+    output.setNull(posInOutputVector, nullData->isNull(offsetInChunk));
+    if (output.isNull(posInOutputVector)) {
+        return;
+    }
+    auto startOffset = getListStartOffset(offsetInChunk);
+    auto listSize = getListSize(offsetInChunk);
+    auto dataVector = ListVector::getDataVector(&output);
+    auto currentListDataSize = ListVector::getDataVectorSize(&output);
+    ListVector::resizeDataVector(&output, currentListDataSize + listSize);
+    dataColumnChunk->scan(*dataVector, startOffset, listSize, currentListDataSize);
+    // reset offset
+    output.setValue<list_entry_t>(posInOutputVector, list_entry_t{currentListDataSize, listSize});
+}
+
+void ListChunkData::initializeScanState(SegmentState& state, const Column* column) const {
+    ColumnChunkData::initializeScanState(state, column);
+
+    auto* listColumn = ku_dynamic_cast<const ListColumn*>(column);
+    state.childrenStates.resize(CHILD_COLUMN_COUNT);
+    sizeColumnChunk->initializeScanState(state.childrenStates[SIZE_COLUMN_CHILD_READ_STATE_IDX],
+        listColumn->getSizeColumn());
+    dataColumnChunk->initializeScanState(state.childrenStates[DATA_COLUMN_CHILD_READ_STATE_IDX],
+        listColumn->getDataColumn());
+    offsetColumnChunk->initializeScanState(state.childrenStates[OFFSET_COLUMN_CHILD_READ_STATE_IDX],
+        listColumn->getOffsetColumn());
+}
+
+void ListChunkData::write(ColumnChunkData* chunk, ColumnChunkData* dstOffsets, RelMultiplicity) {
+    KU_ASSERT(chunk->getDataType().getPhysicalType() == dataType.getPhysicalType() &&
+              dstOffsets->getDataType().getPhysicalType() == PhysicalTypeID::INTERNAL_ID &&
+              chunk->getNumValues() == dstOffsets->getNumValues());
+    checkOffsetSortedAsc = true;
+    offset_t currentIndex = dataColumnChunk->getNumValues();
+    auto& otherListChunk = chunk->cast<ListChunkData>();
+    dataColumnChunk->resize(
+        dataColumnChunk->getNumValues() + otherListChunk.dataColumnChunk->getNumValues());
+    dataColumnChunk->append(otherListChunk.dataColumnChunk.get(), 0,
+        otherListChunk.dataColumnChunk->getNumValues());
+    offset_t maxDstOffset = 0;
+    for (auto i = 0u; i < dstOffsets->getNumValues(); i++) {
+        auto posInChunk = dstOffsets->getValue<offset_t>(i);
+        if (posInChunk > maxDstOffset) {
+            maxDstOffset = posInChunk;
+        }
+    }
+    while (maxDstOffset >= numValues) {
+        appendNullList();
+    }
+    for (auto i = 0u; i < dstOffsets->getNumValues(); i++) {
+        auto posInChunk = dstOffsets->getValue<offset_t>(i);
+        auto appendSize = otherListChunk.getListSize(i);
+        currentIndex += appendSize;
+        nullData->setNull(posInChunk, otherListChunk.nullData->isNull(i));
+        setOffsetChunkValue(currentIndex, posInChunk);
+        sizeColumnChunk->setValue<list_size_t>(appendSize, posInChunk);
+    }
+    KU_ASSERT(sanityCheck());
+}
+
+void ListChunkData::write(const ValueVector* vector, offset_t offsetInVector,
+    offset_t offsetInChunk) {
+    checkOffsetSortedAsc = true;
+    auto appendSize =
+        vector->isNull(offsetInVector) ? 0 : vector->getValue<list_entry_t>(offsetInVector).size;
+    dataColumnChunk->resize(dataColumnChunk->getNumValues() + appendSize);
+    while (offsetInChunk >= numValues) {
+        appendNullList();
+    }
+    auto isNull = vector->isNull(offsetInVector);
+    nullData->setNull(offsetInChunk, isNull);
+    if (!isNull) {
+        auto dataVector = ListVector::getDataVector(vector);
+        copyListValues(vector->getValue<list_entry_t>(offsetInVector), dataVector);
+
+        sizeColumnChunk->setValue<list_size_t>(appendSize, offsetInChunk);
+        setOffsetChunkValue(dataColumnChunk->getNumValues(), offsetInChunk);
+    }
+    KU_ASSERT(sanityCheck());
+}
+
+void ListChunkData::write(const ColumnChunkData* srcChunk, offset_t srcOffsetInChunk,
+    offset_t dstOffsetInChunk, offset_t numValuesToCopy) {
+    KU_ASSERT(srcChunk->getDataType().getPhysicalType() == PhysicalTypeID::LIST ||
+              srcChunk->getDataType().getPhysicalType() == PhysicalTypeID::ARRAY);
+    checkOffsetSortedAsc = true;
+    auto& srcListChunk = srcChunk->cast<ListChunkData>();
+    auto offsetInDataChunkToAppend = dataColumnChunk->getNumValues();
+    for (auto i = 0u; i < numValuesToCopy; i++) {
+        auto appendSize = srcListChunk.getListSize(srcOffsetInChunk + i);
+        offsetInDataChunkToAppend += appendSize;
+        sizeColumnChunk->setValue<list_size_t>(appendSize, dstOffsetInChunk + i);
+        setOffsetChunkValue(offsetInDataChunkToAppend, dstOffsetInChunk + i);
+        nullData->setNull(dstOffsetInChunk + i,
+            srcListChunk.nullData->isNull(srcOffsetInChunk + i));
+    }
+    dataColumnChunk->resize(offsetInDataChunkToAppend);
+    for (auto i = 0u; i < numValuesToCopy; i++) {
+        auto startOffsetInSrcChunk = srcListChunk.getListStartOffset(srcOffsetInChunk + i);
+        auto appendSize = srcListChunk.getListSize(srcOffsetInChunk + i);
+        dataColumnChunk->append(srcListChunk.dataColumnChunk.get(), startOffsetInSrcChunk,
+            appendSize);
+    }
+    KU_ASSERT(sanityCheck());
+}
+
+void ListChunkData::copyListValues(const list_entry_t& entry, ValueVector* dataVector) {
+    auto numListValuesToCopy = entry.size;
+    auto numListValuesCopied = 0u;
+
+    SelectionVector selVector;
+    selVector.setToFiltered();
+    while (numListValuesCopied < numListValuesToCopy) {
+        auto numListValuesToCopyInBatch =
+            std::min<uint64_t>(numListValuesToCopy - numListValuesCopied, DEFAULT_VECTOR_CAPACITY);
+        selVector.setSelSize(numListValuesToCopyInBatch);
+        for (auto j = 0u; j < numListValuesToCopyInBatch; j++) {
+            selVector[j] = entry.offset + numListValuesCopied + j;
+        }
+        dataColumnChunk->append(dataVector, selVector);
+        numListValuesCopied += numListValuesToCopyInBatch;
+    }
+}
+
+void ListChunkData::resetOffset() {
+    offset_t nextListOffsetReset = 0;
+    for (auto i = 0u; i < numValues; i++) {
+        auto listSize = getListSize(i);
+        nextListOffsetReset += uint64_t(listSize);
+        setOffsetChunkValue(nextListOffsetReset, i);
+        sizeColumnChunk->setValue<list_size_t>(listSize, i);
+    }
+}
+
+void ListChunkData::finalize() {
+    // rewrite the column chunk for better scanning performance
+    auto newColumnChunk = ColumnChunkFactory::createColumnChunkData(getMemoryManager(),
+        dataType.copy(), enableCompression, capacity, ResidencyState::IN_MEMORY);
+    uint64_t totalListLen = dataColumnChunk->getNumValues();
+    uint64_t resizeThreshold = dataColumnChunk->getCapacity() / 2;
+    // if the list is not very long, we do not need to rewrite
+    if (totalListLen < resizeThreshold) {
+        return;
+    }
+    // if we do not trigger random write, we do not need to rewrite
+    if (!checkOffsetSortedAsc) {
+        return;
+    }
+    // if the list is in ascending order, we do not need to rewrite
+    if (isOffsetsConsecutiveAndSortedAscending(0, numValues)) {
+        return;
+    }
+    auto& newListChunk = newColumnChunk->cast<ListChunkData>();
+    newListChunk.resize(numValues);
+    newListChunk.getDataColumnChunk()->resize(totalListLen);
+    auto newDataColumnChunk = newListChunk.getDataColumnChunk();
+    newDataColumnChunk->resize(totalListLen);
+    offset_t offsetInChunk = 0;
+    offset_t currentIndex = 0;
+    for (auto i = 0u; i < numValues; i++) {
+        if (nullData->isNull(i)) {
+            newListChunk.appendNullList();
+        } else {
+            auto startOffset = getListStartOffset(i);
+            auto listSize = getListSize(i);
+            newDataColumnChunk->append(dataColumnChunk.get(), startOffset, listSize);
+            offsetInChunk += listSize;
+            newListChunk.nullData->setNull(currentIndex, false);
+            newListChunk.sizeColumnChunk->setValue<list_size_t>(listSize, currentIndex);
+            newListChunk.setOffsetChunkValue(offsetInChunk, currentIndex);
+        }
+        currentIndex++;
+    }
+    KU_ASSERT(newListChunk.sanityCheck());
+    // Move offsets, null, data from newListChunk to this column chunk. And release indices.
+    resetFromOtherChunk(&newListChunk);
+}
+
+void ListChunkData::resetFromOtherChunk(ListChunkData* other) {
+    nullData = std::move(other->nullData);
+    sizeColumnChunk = std::move(other->sizeColumnChunk);
+    dataColumnChunk = std::move(other->dataColumnChunk);
+    offsetColumnChunk = std::move(other->offsetColumnChunk);
+    numValues = other->numValues;
+    checkOffsetSortedAsc = false;
+}
+
+bool ListChunkData::sanityCheck() const {
+    KU_ASSERT(ColumnChunkData::sanityCheck());
+    KU_ASSERT(sizeColumnChunk->sanityCheck());
+    KU_ASSERT(offsetColumnChunk->sanityCheck());
+    KU_ASSERT(getDataColumnChunk()->sanityCheck());
+    return sizeColumnChunk->getNumValues() == numValues;
+}
+
+uint64_t ListChunkData::getEstimatedMemoryUsage() const {
+    return ColumnChunkData::getEstimatedMemoryUsage() + sizeColumnChunk->getEstimatedMemoryUsage() +
+           dataColumnChunk->getEstimatedMemoryUsage() +
+           offsetColumnChunk->getEstimatedMemoryUsage();
+}
+
+void ListChunkData::serialize(Serializer& serializer) const {
+    ColumnChunkData::serialize(serializer);
+    serializer.writeDebuggingInfo("size_column_chunk");
+    sizeColumnChunk->serialize(serializer);
+    serializer.writeDebuggingInfo("data_column_chunk");
+    dataColumnChunk->serialize(serializer);
+    serializer.writeDebuggingInfo("offset_column_chunk");
+    offsetColumnChunk->serialize(serializer);
+}
+
+void ListChunkData::deserialize(Deserializer& deSer, ColumnChunkData& chunkData) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "size_column_chunk");
+    chunkData.cast<ListChunkData>().sizeColumnChunk =
+        ColumnChunkData::deserialize(chunkData.getMemoryManager(), deSer);
+    deSer.validateDebuggingInfo(key, "data_column_chunk");
+    chunkData.cast<ListChunkData>().dataColumnChunk =
+        ColumnChunkData::deserialize(chunkData.getMemoryManager(), deSer);
+    deSer.validateDebuggingInfo(key, "offset_column_chunk");
+    chunkData.cast<ListChunkData>().offsetColumnChunk =
+        ColumnChunkData::deserialize(chunkData.getMemoryManager(), deSer);
+}
+
+void ListChunkData::flush(PageAllocator& pageAllocator) {
+    ColumnChunkData::flush(pageAllocator);
+    sizeColumnChunk->flush(pageAllocator);
+    dataColumnChunk->flush(pageAllocator);
+    offsetColumnChunk->flush(pageAllocator);
+}
+
+void ListChunkData::reclaimStorage(PageAllocator& pageAllocator) {
+    ColumnChunkData::reclaimStorage(pageAllocator);
+    sizeColumnChunk->reclaimStorage(pageAllocator);
+    dataColumnChunk->reclaimStorage(pageAllocator);
+    offsetColumnChunk->reclaimStorage(pageAllocator);
+}
+uint64_t ListChunkData::getSizeOnDisk() const {
+    return ColumnChunkData::getSizeOnDisk() + sizeColumnChunk->getSizeOnDisk() +
+           dataColumnChunk->getSizeOnDisk() + offsetColumnChunk->getSizeOnDisk();
+}
+uint64_t ListChunkData::getMinimumSizeOnDisk() const {
+    return ColumnChunkData::getMinimumSizeOnDisk() + sizeColumnChunk->getMinimumSizeOnDisk() +
+           dataColumnChunk->getMinimumSizeOnDisk() + offsetColumnChunk->getMinimumSizeOnDisk();
+}
+
+uint64_t ListChunkData::getSizeOnDiskInMemoryStats() const {
+    return ColumnChunkData::getSizeOnDiskInMemoryStats() +
+           sizeColumnChunk->getSizeOnDiskInMemoryStats() +
+           dataColumnChunk->getSizeOnDiskInMemoryStats() +
+           offsetColumnChunk->getSizeOnDiskInMemoryStats();
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/list_column.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/list_column.cpp
new file mode 100644
index 0000000000..995cae8509
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/list_column.cpp
@@ -0,0 +1,435 @@
+#include "storage/table/list_column.h"
+
+#include <algorithm>
+
+#include "common/assert.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column.h"
+#include "storage/table/column_chunk.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/list_chunk_data.h"
+#include "storage/table/null_column.h"
+#include <bit>
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+offset_t ListOffsetSizeInfo::getListStartOffset(uint64_t pos) const {
+    if (numTotal == 0) {
+        return 0;
+    }
+    return pos == numTotal ? getListEndOffset(pos - 1) : getListEndOffset(pos) - getListSize(pos);
+}
+
+offset_t ListOffsetSizeInfo::getListEndOffset(uint64_t pos) const {
+    if (numTotal == 0) {
+        return 0;
+    }
+    KU_ASSERT(pos < offsetColumnChunk->getNumValues());
+    return offsetColumnChunk->getValue<offset_t>(pos);
+}
+
+list_size_t ListOffsetSizeInfo::getListSize(uint64_t pos) const {
+    if (numTotal == 0) {
+        return 0;
+    }
+    KU_ASSERT(pos < sizeColumnChunk->getNumValues());
+    return sizeColumnChunk->getValue<list_size_t>(pos);
+}
+
+bool ListOffsetSizeInfo::isOffsetSortedAscending(uint64_t startPos, uint64_t endPos) const {
+    offset_t prevEndOffset = getListStartOffset(startPos);
+    for (auto i = startPos; i < endPos; i++) {
+        offset_t currentEndOffset = getListEndOffset(i);
+        auto size = getListSize(i);
+        prevEndOffset += size;
+        if (currentEndOffset != prevEndOffset) {
+            return false;
+        }
+    }
+    return true;
+}
+
+ListColumn::ListColumn(std::string name, LogicalType dataType, FileHandle* dataFH,
+    MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression)
+    : Column{std::move(name), std::move(dataType), dataFH, mm, shadowFile, enableCompression,
+          true /* requireNullColumn */} {
+    auto offsetColName =
+        StorageUtils::getColumnName(this->name, StorageUtils::ColumnType::OFFSET, "offset_");
+    auto sizeColName =
+        StorageUtils::getColumnName(this->name, StorageUtils::ColumnType::OFFSET, "");
+    auto dataColName = StorageUtils::getColumnName(this->name, StorageUtils::ColumnType::DATA, "");
+    sizeColumn = std::make_unique<Column>(sizeColName, LogicalType::UINT32(), dataFH, mm,
+        shadowFile, enableCompression, false /*requireNullColumn*/);
+    offsetColumn = std::make_unique<Column>(offsetColName, LogicalType::UINT64(), dataFH, mm,
+        shadowFile, enableCompression, false /*requireNullColumn*/);
+    if (disableCompressionOnData(this->dataType)) {
+        enableCompression = false;
+    }
+    dataColumn = ColumnFactory::createColumn(dataColName,
+        ListType::getChildType(this->dataType).copy(), dataFH, mm, shadowFile, enableCompression);
+}
+
+bool ListColumn::disableCompressionOnData(const LogicalType& dataType) {
+    if (dataType.getLogicalTypeID() == LogicalTypeID::ARRAY &&
+        (ListType::getChildType(dataType).getPhysicalType() == PhysicalTypeID::FLOAT ||
+            ListType::getChildType(dataType).getPhysicalType() == PhysicalTypeID::DOUBLE)) {
+        // Force disable compression for floating point types.
+        return true;
+    }
+    return false;
+}
+
+std::unique_ptr<ColumnChunkData> ListColumn::flushChunkData(const ColumnChunkData& chunk,
+    PageAllocator& pageAllocator) {
+    auto flushedChunk = flushNonNestedChunkData(chunk, pageAllocator);
+    auto& listChunk = chunk.cast<ListChunkData>();
+    auto& flushedListChunk = flushedChunk->cast<ListChunkData>();
+    flushedListChunk.setOffsetColumnChunk(
+        Column::flushChunkData(*listChunk.getOffsetColumnChunk(), pageAllocator));
+    flushedListChunk.setSizeColumnChunk(
+        Column::flushChunkData(*listChunk.getSizeColumnChunk(), pageAllocator));
+    flushedListChunk.setDataColumnChunk(
+        Column::flushChunkData(*listChunk.getDataColumnChunk(), pageAllocator));
+    return flushedChunk;
+}
+
+void ListColumn::scanSegment(const SegmentState& state, offset_t startOffsetInChunk,
+    row_idx_t numValuesToScan, ValueVector* resultVector, offset_t offsetInResult) const {
+    if (nullColumn) {
+        KU_ASSERT(state.nullState);
+        nullColumn->scanSegment(*state.nullState, startOffsetInChunk, numValuesToScan, resultVector,
+            offsetInResult);
+    }
+    auto listOffsetSizeInfo = getListOffsetSizeInfo(state, startOffsetInChunk, numValuesToScan);
+    if (!resultVector->state || resultVector->state->getSelVector().isUnfiltered()) {
+        scanUnfiltered(state, resultVector, numValuesToScan, listOffsetSizeInfo, offsetInResult);
+    } else {
+        scanFiltered(state, startOffsetInChunk, resultVector, listOffsetSizeInfo, offsetInResult);
+    }
+}
+
+void ListColumn::scanSegment(const SegmentState& state, ColumnChunkData* resultChunk,
+    common::offset_t startOffsetInSegment, common::row_idx_t numValuesToScan) const {
+    auto startOffsetInResult = resultChunk->getNumValues();
+    Column::scanSegment(state, resultChunk, startOffsetInSegment, numValuesToScan);
+    if (numValuesToScan == 0) {
+        return;
+    }
+    // Column::scanSegment above modifies the size of the offset/size chunks before we scan
+    // them
+    // Revert this so that they scan to the correct position
+    // FIXME(bmwinger): there should be a better solution to this, but it will probably be removed
+    // later anyway
+    auto& listColumnChunk = resultChunk->cast<ListChunkData>();
+    listColumnChunk.getOffsetColumnChunk()->setNumValues(startOffsetInResult);
+    listColumnChunk.getSizeColumnChunk()->setNumValues(startOffsetInResult);
+
+    offsetColumn->scanSegment(state.childrenStates[OFFSET_COLUMN_CHILD_READ_STATE_IDX],
+        listColumnChunk.getOffsetColumnChunk(), startOffsetInSegment, numValuesToScan);
+    sizeColumn->scanSegment(state.childrenStates[SIZE_COLUMN_CHILD_READ_STATE_IDX],
+        listColumnChunk.getSizeColumnChunk(), startOffsetInSegment, numValuesToScan);
+    auto resizeNumValues = listColumnChunk.getDataColumnChunk()->getNumValues();
+    bool isOffsetSortedAscending = true;
+    KU_ASSERT(listColumnChunk.getSizeColumnChunk()->getNumValues() ==
+              startOffsetInResult + numValuesToScan);
+    offset_t prevOffset = listColumnChunk.getListStartOffset(startOffsetInResult);
+    for (auto i = startOffsetInResult; i < startOffsetInResult + numValuesToScan; i++) {
+        auto currentEndOffset = listColumnChunk.getListEndOffset(i);
+        auto appendSize = listColumnChunk.getListSize(i);
+        prevOffset += appendSize;
+        if (currentEndOffset != prevOffset) {
+            isOffsetSortedAscending = false;
+        }
+        resizeNumValues += appendSize;
+    }
+    if (isOffsetSortedAscending) {
+        listColumnChunk.resizeDataColumnChunk(std::bit_ceil(resizeNumValues));
+        offset_t startListOffset = listColumnChunk.getListStartOffset(startOffsetInResult);
+        offset_t endListOffset =
+            listColumnChunk.getListStartOffset(startOffsetInResult + numValuesToScan);
+        KU_ASSERT(endListOffset >= startListOffset);
+        dataColumn->scanSegment(state.childrenStates[DATA_COLUMN_CHILD_READ_STATE_IDX],
+            listColumnChunk.getDataColumnChunk(), startListOffset, endListOffset - startListOffset);
+    } else {
+        listColumnChunk.resizeDataColumnChunk(std::bit_ceil(resizeNumValues));
+        for (auto i = startOffsetInResult; i < startOffsetInResult + numValuesToScan; i++) {
+            offset_t startListOffset = listColumnChunk.getListStartOffset(i);
+            offset_t endListOffset = listColumnChunk.getListEndOffset(i);
+            dataColumn->scanSegment(state.childrenStates[DATA_COLUMN_CHILD_READ_STATE_IDX],
+                listColumnChunk.getDataColumnChunk(), startListOffset,
+                endListOffset - startListOffset);
+        }
+    }
+    listColumnChunk.resetOffset();
+
+    KU_ASSERT(listColumnChunk.sanityCheck());
+}
+
+void ListColumn::lookupInternal(const SegmentState& state, offset_t nodeOffset,
+    ValueVector* resultVector, uint32_t posInVector) const {
+    auto [nodeGroupIdx, offsetInChunk] = StorageUtils::getNodeGroupIdxAndOffsetInChunk(nodeOffset);
+    const auto listEndOffset = readOffset(state, offsetInChunk);
+    const auto size = readSize(state, offsetInChunk);
+    const auto listStartOffset = listEndOffset - size;
+    auto dataVector = ListVector::getDataVector(resultVector);
+    auto currentListDataSize = ListVector::getDataVectorSize(resultVector);
+    ListVector::resizeDataVector(resultVector, currentListDataSize + size);
+    dataColumn->scanSegment(state.childrenStates[ListChunkData::DATA_COLUMN_CHILD_READ_STATE_IDX],
+        listStartOffset, listEndOffset - listStartOffset, dataVector, currentListDataSize);
+    resultVector->setValue(posInVector, list_entry_t{currentListDataSize, size});
+}
+
+void ListColumn::scanUnfiltered(const SegmentState& state, ValueVector* resultVector,
+    uint64_t numValuesToScan, const ListOffsetSizeInfo& listOffsetInfoInStorage,
+    offset_t offsetInResult) const {
+    auto dataVector = ListVector::getDataVector(resultVector);
+    // Scans append to the end of the vector, so we need to start at the end of the last list
+    auto startOffsetInDataVector = ListVector::getDataVectorSize(resultVector);
+    auto offsetInDataVector = startOffsetInDataVector;
+
+    numValuesToScan = std::min(numValuesToScan, listOffsetInfoInStorage.numTotal);
+    for (auto i = 0u; i < numValuesToScan; i++) {
+        auto listLen = listOffsetInfoInStorage.getListSize(i);
+        resultVector->setValue(offsetInResult + i, list_entry_t{offsetInDataVector, listLen});
+        offsetInDataVector += listLen;
+    }
+    ListVector::resizeDataVector(resultVector, offsetInDataVector);
+    const bool checkOffsetOrder =
+        listOffsetInfoInStorage.isOffsetSortedAscending(0, numValuesToScan);
+    if (checkOffsetOrder) {
+        auto startListOffsetInStorage = listOffsetInfoInStorage.getListStartOffset(0);
+        numValuesToScan = numValuesToScan == 0 ? 0 : numValuesToScan - 1;
+        auto endListOffsetInStorage = listOffsetInfoInStorage.getListEndOffset(numValuesToScan);
+        dataColumn->scanSegment(
+            state.childrenStates[ListChunkData::DATA_COLUMN_CHILD_READ_STATE_IDX],
+            startListOffsetInStorage, endListOffsetInStorage - startListOffsetInStorage, dataVector,
+            static_cast<uint64_t>(startOffsetInDataVector /* offsetInVector */));
+    } else {
+        offsetInDataVector = startOffsetInDataVector;
+        for (auto i = 0u; i < numValuesToScan; i++) {
+            // Nulls are scanned to the resultVector first
+            if (!resultVector->isNull(i)) {
+                auto startListOffsetInStorage = listOffsetInfoInStorage.getListStartOffset(i);
+                auto appendSize = listOffsetInfoInStorage.getListSize(i);
+                dataColumn->scanSegment(state.childrenStates[DATA_COLUMN_CHILD_READ_STATE_IDX],
+                    startListOffsetInStorage, appendSize, dataVector, offsetInDataVector);
+                offsetInDataVector += appendSize;
+            }
+        }
+    }
+}
+
+void ListColumn::scanFiltered(const SegmentState& state, offset_t startOffsetInSegment,
+    ValueVector* resultVector, const ListOffsetSizeInfo& listOffsetSizeInfo,
+    offset_t offsetInResult) const {
+    auto dataVector = ListVector::getDataVector(resultVector);
+    auto startOffsetInDataVector = ListVector::getDataVectorSize(resultVector);
+    auto offsetInDataVector = startOffsetInDataVector;
+
+    for (sel_t i = 0; i < resultVector->state->getSelVector().getSelSize(); i++) {
+        auto pos = resultVector->state->getSelVector()[i];
+        if (startOffsetInSegment + pos - offsetInResult < state.metadata.numValues) {
+            // The listOffsetSizeInfo starts with the first value being scanned, so the
+            // startOffsetInSegment parameter is not needed here except for the bounds check
+            auto listSize = listOffsetSizeInfo.getListSize(pos - offsetInResult);
+            resultVector->setValue(pos, list_entry_t{(offset_t)offsetInDataVector, listSize});
+            offsetInDataVector += listSize;
+        }
+    }
+    ListVector::resizeDataVector(resultVector, offsetInDataVector);
+    offsetInDataVector = startOffsetInDataVector;
+    for (auto i = 0u; i < resultVector->state->getSelVector().getSelSize(); i++) {
+        auto pos = resultVector->state->getSelVector()[i];
+        // Nulls are scanned to the resultVector first
+        if (pos >= offsetInResult &&
+            startOffsetInSegment + pos - offsetInResult < state.metadata.numValues &&
+            !resultVector->isNull(pos)) {
+            auto startOffsetInStorageToScan =
+                listOffsetSizeInfo.getListStartOffset(pos - offsetInResult);
+            auto appendSize = listOffsetSizeInfo.getListSize(pos - offsetInResult);
+            // If there is a selection vector for the dataVector, its selected positions are not
+            // being updated at all for this specific segment
+            KU_ASSERT(!dataVector->state || dataVector->state->getSelVector().isUnfiltered());
+            dataColumn->scanSegment(state.childrenStates[DATA_COLUMN_CHILD_READ_STATE_IDX],
+                startOffsetInStorageToScan, appendSize, dataVector, offsetInDataVector);
+            offsetInDataVector += resultVector->getValue<list_entry_t>(pos).size;
+        }
+    }
+}
+
+offset_t ListColumn::readOffset(const SegmentState& state, offset_t offsetInNodeGroup) const {
+    offset_t ret = INVALID_OFFSET;
+    const auto& offsetState = state.childrenStates[OFFSET_COLUMN_CHILD_READ_STATE_IDX];
+    offsetColumn->columnReadWriter->readCompressedValueToPage(offsetState, offsetInNodeGroup,
+        reinterpret_cast<uint8_t*>(&ret), 0, offsetColumn->readToPageFunc);
+    return ret;
+}
+
+list_size_t ListColumn::readSize(const SegmentState& readState, offset_t offsetInNodeGroup) const {
+    const auto& sizeState = readState.childrenStates[SIZE_COLUMN_CHILD_READ_STATE_IDX];
+    offset_t value = INVALID_OFFSET;
+    sizeColumn->columnReadWriter->readCompressedValueToPage(sizeState, offsetInNodeGroup,
+        reinterpret_cast<uint8_t*>(&value), 0, sizeColumn->readToPageFunc);
+    return value;
+}
+
+ListOffsetSizeInfo ListColumn::getListOffsetSizeInfo(const SegmentState& state,
+    offset_t startOffsetInSegment, offset_t numOffsetsToRead) const {
+    auto offsetColumnChunk = ColumnChunkFactory::createColumnChunkData(*mm, LogicalType::INT64(),
+        enableCompression, numOffsetsToRead, ResidencyState::IN_MEMORY);
+    auto sizeColumnChunk = ColumnChunkFactory::createColumnChunkData(*mm, LogicalType::UINT32(),
+        enableCompression, numOffsetsToRead, ResidencyState::IN_MEMORY);
+    offsetColumn->scanSegment(state.childrenStates[OFFSET_COLUMN_CHILD_READ_STATE_IDX],
+        offsetColumnChunk.get(), startOffsetInSegment, numOffsetsToRead);
+    sizeColumn->scanSegment(state.childrenStates[SIZE_COLUMN_CHILD_READ_STATE_IDX],
+        sizeColumnChunk.get(), startOffsetInSegment, numOffsetsToRead);
+    auto numValuesScan = offsetColumnChunk->getNumValues();
+    return {numValuesScan, std::move(offsetColumnChunk), std::move(sizeColumnChunk)};
+}
+
+static void appendDataCheckpointState(
+    std::vector<SegmentCheckpointState>& listDataChunkCheckpointStates, ColumnChunkData& dataChunk,
+    offset_t inputOffset, offset_t& outputOffset, offset_t numRows) {
+    if (numRows > 0) {
+        listDataChunkCheckpointStates.push_back(
+            SegmentCheckpointState{dataChunk, inputOffset, outputOffset, numRows});
+        outputOffset += numRows;
+    }
+}
+
+static std::vector<SegmentCheckpointState> createListDataChunkCheckpointStates(
+    ListChunkData& persistentListChunk, std::span<SegmentCheckpointState> segmentCheckpointStates) {
+    const auto persistentDataChunk = persistentListChunk.getDataColumnChunk();
+    row_idx_t newListDataSize = persistentDataChunk->getNumValues();
+
+    std::vector<SegmentCheckpointState> listDataChunkCheckpointStates;
+    for (const auto& segmentCheckpointState : segmentCheckpointStates) {
+        // We append the data for each list entry as separate segment checkpoint states
+        // List entries with adjacent data are commbined into a single segment checkpoint state
+        const auto& listChunk = segmentCheckpointState.chunkData.cast<ListChunkData>();
+        offset_t currentSegmentStartOffset = INVALID_OFFSET;
+        offset_t currentSegmentNumRows = 0;
+        for (offset_t i = 0; i < segmentCheckpointState.numRows; i++) {
+            if (listChunk.isNull(segmentCheckpointState.startRowInData + i)) {
+                // Nulls will have 0 length and start at pos 0, which will work with the logic
+                // below, but may create more checkpoint states than necessary
+                continue;
+            }
+            const auto currentListStartOffset =
+                listChunk.getListStartOffset(segmentCheckpointState.startRowInData + i);
+            const auto currentListLength =
+                listChunk.getListSize(segmentCheckpointState.startRowInData + i);
+            if (currentSegmentStartOffset + currentSegmentNumRows == currentListStartOffset) {
+                currentSegmentNumRows += currentListLength;
+            } else {
+                appendDataCheckpointState(listDataChunkCheckpointStates,
+                    *listChunk.getDataColumnChunk(), currentSegmentStartOffset, newListDataSize,
+                    currentSegmentNumRows);
+                currentSegmentStartOffset = currentListStartOffset;
+                currentSegmentNumRows = currentListLength;
+            }
+        }
+        appendDataCheckpointState(listDataChunkCheckpointStates, *listChunk.getDataColumnChunk(),
+            currentSegmentStartOffset, newListDataSize, currentSegmentNumRows);
+    }
+
+    return listDataChunkCheckpointStates;
+}
+
+std::vector<std::unique_ptr<ColumnChunkData>> ListColumn::checkpointSegment(
+    ColumnCheckpointState&& checkpointState, PageAllocator& pageAllocator,
+    bool canSplitSegment) const {
+    if (checkpointState.segmentCheckpointStates.empty()) {
+        return {};
+    }
+    auto& persistentListChunk = checkpointState.persistentData.cast<ListChunkData>();
+    const auto persistentDataChunk = persistentListChunk.getDataColumnChunk();
+
+    auto listDataChunkCheckpointStates = createListDataChunkCheckpointStates(persistentListChunk,
+        checkpointState.segmentCheckpointStates);
+
+    // First, check if we can checkpoint list data chunk in place.
+    SegmentState chunkState;
+    checkpointState.persistentData.initializeScanState(chunkState, this);
+    ColumnCheckpointState listDataCheckpointState(*persistentDataChunk,
+        std::move(listDataChunkCheckpointStates));
+    const auto listDataCanCheckpointInPlace = dataColumn->canCheckpointInPlace(
+        chunkState.childrenStates[ListChunkData::DATA_COLUMN_CHILD_READ_STATE_IDX],
+        listDataCheckpointState);
+    if (!listDataCanCheckpointInPlace) {
+        // If we cannot checkpoint list data chunk in place, we need to checkpoint the whole chunk
+        // out of place.
+        return checkpointColumnChunkOutOfPlace(chunkState, checkpointState, pageAllocator,
+            canSplitSegment);
+    }
+
+    const auto persistentListDataSize = persistentDataChunk->getNumValues();
+
+    // In place checkpoint for list data.
+    dataColumn->checkpointColumnChunkInPlace(
+        chunkState.childrenStates[ListChunkData::DATA_COLUMN_CHILD_READ_STATE_IDX],
+        listDataCheckpointState, pageAllocator);
+
+    // Checkpoint offset data.
+    std::vector<SegmentCheckpointState> offsetChunkCheckpointStates;
+
+    KU_ASSERT(std::is_sorted(checkpointState.segmentCheckpointStates.begin(),
+        checkpointState.segmentCheckpointStates.end(),
+        [](const auto& a, const auto& b) { return a.startRowInData < b.startRowInData; }));
+    std::vector<std::unique_ptr<ColumnChunkData>> offsetsToWrite;
+    uint64_t totalAppendedListSize = 0;
+    for (const auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
+        offsetsToWrite.push_back(
+            ColumnChunkFactory::createColumnChunkData(*mm, LogicalType::UINT64(), false,
+                segmentCheckpointState.numRows, ResidencyState::IN_MEMORY));
+        const auto& listChunk = segmentCheckpointState.chunkData.cast<ListChunkData>();
+        for (auto i = 0u; i < segmentCheckpointState.numRows; i++) {
+            // When checkpointing the data chunks we append each list in the checkpoint state to the
+            // end of the data This loop processes the lists in the same order, so the offsets match
+            // the ones used by the data chunk checkpoint
+            totalAppendedListSize +=
+                listChunk.getListSize(segmentCheckpointState.startRowInData + i);
+            offsetsToWrite.back()->setValue<offset_t>(
+                persistentListDataSize + totalAppendedListSize, i);
+        }
+        offsetChunkCheckpointStates.push_back(SegmentCheckpointState{*offsetsToWrite.back(), 0,
+            segmentCheckpointState.offsetInSegment, segmentCheckpointState.numRows});
+    }
+
+    // We do not allow nested splitting of offset/size segments
+    offsetColumn->checkpointSegment(
+        ColumnCheckpointState(*persistentListChunk.getOffsetColumnChunk(),
+            std::move(offsetChunkCheckpointStates)),
+        pageAllocator, false);
+
+    // Checkpoint size data.
+    std::vector<SegmentCheckpointState> sizeChunkCheckpointStates;
+    for (const auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
+        sizeChunkCheckpointStates.push_back(SegmentCheckpointState{
+            *segmentCheckpointState.chunkData.cast<ListChunkData>().getSizeColumnChunk(),
+            segmentCheckpointState.startRowInData, segmentCheckpointState.offsetInSegment,
+            segmentCheckpointState.numRows});
+    }
+    sizeColumn->checkpointSegment(ColumnCheckpointState(*persistentListChunk.getSizeColumnChunk(),
+                                      std::move(sizeChunkCheckpointStates)),
+        pageAllocator, false);
+    // Checkpoint null data.
+    Column::checkpointNullData(checkpointState, pageAllocator);
+
+    KU_ASSERT(persistentListChunk.getNullData()->getNumValues() ==
+                  persistentListChunk.getOffsetColumnChunk()->getNumValues() &&
+              persistentListChunk.getNullData()->getNumValues() ==
+                  persistentListChunk.getSizeColumnChunk()->getNumValues());
+
+    persistentListChunk.syncNumValues();
+    return {};
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/node_group.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/node_group.cpp
new file mode 100644
index 0000000000..6ac7c473dd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/node_group.cpp
@@ -0,0 +1,785 @@
+#include "storage/table/node_group.h"
+
+#include "common/assert.h"
+#include "common/types/types.h"
+#include "common/uniq_lock.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/enums/residency_state.h"
+#include "storage/storage_utils.h"
+#include "storage/table/chunked_node_group.h"
+#include "storage/table/column_chunk.h"
+#include "storage/table/column_chunk_scanner.h"
+#include "storage/table/csr_chunked_node_group.h"
+#include "storage/table/csr_node_group.h"
+#include "storage/table/lazy_segment_scanner.h"
+#include "storage/table/node_table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+row_idx_t NodeGroup::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, ChunkedNodeGroup& chunkedGroup,
+    row_idx_t startRowIdx, row_idx_t numRowsToAppend) {
+    KU_ASSERT(numRowsToAppend <= chunkedGroup.getNumRows());
+    std::vector<const ColumnChunk*> chunksToAppend(chunkedGroup.getNumColumns());
+    for (auto i = 0u; i < chunkedGroup.getNumColumns(); i++) {
+        chunksToAppend[i] = &chunkedGroup.getColumnChunk(i);
+    }
+    return append(transaction, columnIDs, chunksToAppend, startRowIdx, numRowsToAppend);
+}
+
+row_idx_t NodeGroup::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, InMemChunkedNodeGroup& chunkedGroup,
+    row_idx_t startRowIdx, row_idx_t numRowsToAppend) {
+    KU_ASSERT(numRowsToAppend <= chunkedGroup.getNumRows());
+    std::vector<const ColumnChunkData*> chunksToAppend(chunkedGroup.getNumColumns());
+    for (auto i = 0u; i < chunkedGroup.getNumColumns(); i++) {
+        chunksToAppend[i] = &chunkedGroup.getColumnChunk(i);
+    }
+    return append(transaction, columnIDs, chunksToAppend, startRowIdx, numRowsToAppend);
+}
+
+row_idx_t NodeGroup::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, std::span<const ColumnChunkData*> chunkedGroup,
+    row_idx_t startRowIdx, row_idx_t numRowsToAppend) {
+    const auto lock = chunkedGroups.lock();
+    const auto numRowsBeforeAppend = getNumRows();
+    if (chunkedGroups.isEmpty(lock)) {
+        chunkedGroups.appendGroup(lock,
+            std::make_unique<ChunkedNodeGroup>(mm, dataTypes, enableCompression,
+                StorageConfig::CHUNKED_NODE_GROUP_CAPACITY, 0, ResidencyState::IN_MEMORY));
+    }
+    row_idx_t numRowsAppended = 0u;
+    while (numRowsAppended < numRowsToAppend) {
+        auto lastChunkedGroup = chunkedGroups.getLastGroup(lock);
+        if (!lastChunkedGroup || lastChunkedGroup->isFullOrOnDisk()) {
+            chunkedGroups.appendGroup(lock,
+                std::make_unique<ChunkedNodeGroup>(mm, dataTypes, enableCompression,
+                    StorageConfig::CHUNKED_NODE_GROUP_CAPACITY,
+                    numRowsBeforeAppend + numRowsAppended, ResidencyState::IN_MEMORY));
+        }
+        lastChunkedGroup = chunkedGroups.getLastGroup(lock);
+        KU_ASSERT(StorageConfig::CHUNKED_NODE_GROUP_CAPACITY >= lastChunkedGroup->getNumRows());
+        auto numToCopyIntoChunk =
+            StorageConfig::CHUNKED_NODE_GROUP_CAPACITY - lastChunkedGroup->getNumRows();
+        const auto numToAppendInChunk =
+            std::min(numRowsToAppend - numRowsAppended, numToCopyIntoChunk);
+        lastChunkedGroup->append(transaction, columnIDs, chunkedGroup,
+            numRowsAppended + startRowIdx, numToAppendInChunk);
+        numRowsAppended += numToAppendInChunk;
+    }
+    numRows += numRowsAppended;
+    return numRowsBeforeAppend;
+}
+
+row_idx_t NodeGroup::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, std::span<const ColumnChunk*> chunkedGroup,
+    row_idx_t startRowIdx, row_idx_t numRowsToAppend) {
+    const auto lock = chunkedGroups.lock();
+    const auto numRowsBeforeAppend = getNumRows();
+    if (chunkedGroups.isEmpty(lock)) {
+        chunkedGroups.appendGroup(lock,
+            std::make_unique<ChunkedNodeGroup>(mm, dataTypes, enableCompression,
+                StorageConfig::CHUNKED_NODE_GROUP_CAPACITY, 0, ResidencyState::IN_MEMORY));
+    }
+    row_idx_t numRowsAppended = 0u;
+    while (numRowsAppended < numRowsToAppend) {
+        auto lastChunkedGroup = chunkedGroups.getLastGroup(lock);
+        if (!lastChunkedGroup || lastChunkedGroup->isFullOrOnDisk()) {
+            chunkedGroups.appendGroup(lock,
+                std::make_unique<ChunkedNodeGroup>(mm, dataTypes, enableCompression,
+                    StorageConfig::CHUNKED_NODE_GROUP_CAPACITY,
+                    numRowsBeforeAppend + numRowsAppended, ResidencyState::IN_MEMORY));
+        }
+        lastChunkedGroup = chunkedGroups.getLastGroup(lock);
+        KU_ASSERT(StorageConfig::CHUNKED_NODE_GROUP_CAPACITY >= lastChunkedGroup->getNumRows());
+        auto numToCopyIntoChunk =
+            StorageConfig::CHUNKED_NODE_GROUP_CAPACITY - lastChunkedGroup->getNumRows();
+        const auto numToAppendInChunk =
+            std::min(numRowsToAppend - numRowsAppended, numToCopyIntoChunk);
+        lastChunkedGroup->append(transaction, columnIDs, chunkedGroup,
+            numRowsAppended + startRowIdx, numToAppendInChunk);
+        numRowsAppended += numToAppendInChunk;
+    }
+    numRows += numRowsAppended;
+    return numRowsBeforeAppend;
+}
+
+void NodeGroup::append(const Transaction* transaction, const std::vector<ValueVector*>& vectors,
+    const row_idx_t startRowIdx, const row_idx_t numRowsToAppend) {
+    const auto lock = chunkedGroups.lock();
+    const auto numRowsBeforeAppend = getNumRows();
+    if (chunkedGroups.isEmpty(lock)) {
+        chunkedGroups.appendGroup(lock,
+            std::make_unique<ChunkedNodeGroup>(mm, dataTypes, enableCompression,
+                StorageConfig::CHUNKED_NODE_GROUP_CAPACITY, 0 /*startOffset*/,
+                ResidencyState::IN_MEMORY));
+    }
+    row_idx_t numRowsAppended = 0;
+    while (numRowsAppended < numRowsToAppend) {
+        auto lastChunkedGroup = chunkedGroups.getLastGroup(lock);
+        if (!lastChunkedGroup || lastChunkedGroup->isFullOrOnDisk()) {
+            chunkedGroups.appendGroup(lock,
+                std::make_unique<ChunkedNodeGroup>(mm, dataTypes, enableCompression,
+                    StorageConfig::CHUNKED_NODE_GROUP_CAPACITY,
+                    numRowsBeforeAppend + numRowsAppended, ResidencyState::IN_MEMORY));
+        }
+        lastChunkedGroup = chunkedGroups.getLastGroup(lock);
+        const auto numRowsToAppendInGroup = std::min(numRowsToAppend - numRowsAppended,
+            StorageConfig::CHUNKED_NODE_GROUP_CAPACITY - lastChunkedGroup->getNumRows());
+        lastChunkedGroup->append(transaction, vectors, startRowIdx + numRowsAppended,
+            numRowsToAppendInGroup);
+        numRowsAppended += numRowsToAppendInGroup;
+    }
+    numRows += numRowsAppended;
+}
+
+void NodeGroup::merge(Transaction*, std::unique_ptr<ChunkedNodeGroup> chunkedGroup) {
+    KU_ASSERT(chunkedGroup->getNumColumns() == dataTypes.size());
+    for (auto i = 0u; i < chunkedGroup->getNumColumns(); i++) {
+        KU_ASSERT(chunkedGroup->getColumnChunk(i).getDataType().getPhysicalType() ==
+                  dataTypes[i].getPhysicalType());
+    }
+    const auto lock = chunkedGroups.lock();
+    numRows += chunkedGroup->getNumRows();
+    chunkedGroups.appendGroup(lock, std::move(chunkedGroup));
+}
+
+void NodeGroup::initializeScanState(const Transaction* transaction, TableScanState& state) const {
+    const auto lock = chunkedGroups.lock();
+    initializeScanState(transaction, lock, state);
+}
+
+static void initializeScanStateForChunkedGroup(const TableScanState& state,
+    const ChunkedNodeGroup* chunkedGroup) {
+    KU_ASSERT(chunkedGroup);
+    if (chunkedGroup->getResidencyState() != ResidencyState::ON_DISK) {
+        return;
+    }
+    auto& nodeGroupScanState = *state.nodeGroupScanState;
+    for (auto i = 0u; i < state.columnIDs.size(); i++) {
+        KU_ASSERT(i < state.columnIDs.size());
+        KU_ASSERT(i < nodeGroupScanState.chunkStates.size());
+        const auto columnID = state.columnIDs[i];
+        if (columnID == INVALID_COLUMN_ID || columnID == ROW_IDX_COLUMN_ID) {
+            continue;
+        }
+        auto& chunk = chunkedGroup->getColumnChunk(columnID);
+        auto& chunkState = nodeGroupScanState.chunkStates[i];
+        chunk.initializeScanState(chunkState, state.columns[i]);
+    }
+}
+
+void NodeGroup::initializeScanState(const Transaction*, const UniqLock& lock,
+    TableScanState& state) const {
+    auto& nodeGroupScanState = *state.nodeGroupScanState;
+    nodeGroupScanState.chunkedGroupIdx = 0;
+    ChunkedNodeGroup* firstChunkedGroup = chunkedGroups.getFirstGroup(lock);
+    nodeGroupScanState.nextRowToScan = firstChunkedGroup->getStartRowIdx();
+    initializeScanStateForChunkedGroup(state, firstChunkedGroup);
+}
+
+void applySemiMaskFilter(const TableScanState& state, row_idx_t numRowsToScan,
+    SelectionVector& selVector) {
+    auto& nodeGroupScanState = *state.nodeGroupScanState;
+    const auto startNodeOffset = nodeGroupScanState.nextRowToScan +
+                                 StorageUtils::getStartOffsetOfNodeGroup(state.nodeGroupIdx);
+    const auto endNodeOffset = startNodeOffset + numRowsToScan;
+    const auto& arr = state.semiMask->range(startNodeOffset, endNodeOffset);
+    if (arr.empty()) {
+        selVector.setSelSize(0);
+    } else {
+        auto stat = selVector.getMutableBuffer();
+        uint64_t numSelectedValues = 0;
+        size_t i = 0, j = 0;
+        while (i < numRowsToScan && j < arr.size()) {
+            auto temp = arr[j] - startNodeOffset;
+            if (selVector[i] < temp) {
+                ++i;
+            } else if (selVector[i] > temp) {
+                ++j;
+            } else {
+                stat[numSelectedValues++] = temp;
+                ++i;
+                ++j;
+            }
+        }
+        selVector.setToFiltered(numSelectedValues);
+    }
+}
+
+NodeGroupScanResult NodeGroup::scan(const Transaction* transaction, TableScanState& state) const {
+    // TODO(Guodong): Move the locked part of figuring out the chunked group to initScan.
+    const auto lock = chunkedGroups.lock();
+    auto& nodeGroupScanState = *state.nodeGroupScanState;
+    KU_ASSERT(nodeGroupScanState.chunkedGroupIdx < chunkedGroups.getNumGroups(lock));
+    const auto chunkedGroup = chunkedGroups.getGroup(lock, nodeGroupScanState.chunkedGroupIdx);
+    if (nodeGroupScanState.nextRowToScan >=
+        chunkedGroup->getNumRows() + chunkedGroup->getStartRowIdx()) {
+        nodeGroupScanState.chunkedGroupIdx++;
+        if (nodeGroupScanState.chunkedGroupIdx >= chunkedGroups.getNumGroups(lock)) {
+            return NODE_GROUP_SCAN_EMPTY_RESULT;
+        }
+        ChunkedNodeGroup* currentChunkedGroup =
+            chunkedGroups.getGroup(lock, nodeGroupScanState.chunkedGroupIdx);
+        initializeScanStateForChunkedGroup(state, currentChunkedGroup);
+    }
+    const auto& chunkedGroupToScan =
+        *chunkedGroups.getGroup(lock, nodeGroupScanState.chunkedGroupIdx);
+    KU_ASSERT(nodeGroupScanState.nextRowToScan >= chunkedGroupToScan.getStartRowIdx());
+    const auto rowIdxInChunkToScan =
+        nodeGroupScanState.nextRowToScan - chunkedGroupToScan.getStartRowIdx();
+    const auto numRowsToScan =
+        std::min(chunkedGroupToScan.getNumRows() - rowIdxInChunkToScan, DEFAULT_VECTOR_CAPACITY);
+    bool enableSemiMask =
+        state.source == TableScanSource::COMMITTED && state.semiMask && state.semiMask->isEnabled();
+    if (enableSemiMask) {
+        applySemiMaskFilter(state, numRowsToScan, state.outState->getSelVectorUnsafe());
+        if (state.outState->getSelVector().getSelSize() == 0) {
+            state.nodeGroupScanState->nextRowToScan += numRowsToScan;
+            return NodeGroupScanResult{nodeGroupScanState.nextRowToScan, 0};
+        }
+    }
+    chunkedGroupToScan.scan(transaction, state, nodeGroupScanState, rowIdxInChunkToScan,
+        numRowsToScan);
+    const auto startRow = nodeGroupScanState.nextRowToScan;
+    nodeGroupScanState.nextRowToScan += numRowsToScan;
+    return NodeGroupScanResult{startRow, numRowsToScan};
+}
+
+NodeGroupScanResult NodeGroup::scan(Transaction* transaction, TableScanState& state,
+    offset_t startOffsetInGroup, offset_t numRowsToScan) const {
+    bool enableSemiMask =
+        state.source == TableScanSource::COMMITTED && state.semiMask && state.semiMask->isEnabled();
+    if (enableSemiMask) {
+        applySemiMaskFilter(state, numRowsToScan, state.outState->getSelVectorUnsafe());
+        if (state.outState->getSelVector().getSelSize() == 0) {
+            state.nodeGroupScanState->nextRowToScan += numRowsToScan;
+            return NodeGroupScanResult{state.nodeGroupScanState->nextRowToScan, 0};
+        }
+    }
+    if (state.outputVectors.size() == 0) {
+        KU_ASSERT(scanInternal(chunkedGroups.lock(), transaction, state, startOffsetInGroup,
+                      numRowsToScan) == NodeGroupScanResult(startOffsetInGroup, numRowsToScan));
+        return NodeGroupScanResult{startOffsetInGroup, numRowsToScan};
+    }
+    return scanInternal(chunkedGroups.lock(), transaction, state, startOffsetInGroup,
+        numRowsToScan);
+}
+
+NodeGroupScanResult NodeGroup::scanInternal(const UniqLock& lock, Transaction* transaction,
+    TableScanState& state, offset_t startOffsetInGroup, offset_t numRowsToScan) const {
+    // Only meant for scanning once
+    KU_ASSERT(numRowsToScan <= DEFAULT_VECTOR_CAPACITY);
+
+    auto startRowIdxInGroup = getStartRowIdxInGroupNoLock();
+    if (startOffsetInGroup < startRowIdxInGroup) {
+        numRowsToScan = std::min(numRowsToScan, startRowIdxInGroup - startOffsetInGroup);
+        // If the scan starts before the first row in the group, skip the deleted part and return.
+        return NodeGroupScanResult{startOffsetInGroup, numRowsToScan};
+    }
+
+    auto& nodeGroupScanState = *state.nodeGroupScanState;
+    nodeGroupScanState.nextRowToScan = startOffsetInGroup;
+
+    auto [newChunkedGroupIdx, _] = findChunkedGroupIdxFromRowIdxNoLock(startOffsetInGroup);
+    KU_ASSERT(newChunkedGroupIdx != INVALID_CHUNKED_GROUP_IDX);
+
+    const auto* chunkedGroupToScan = chunkedGroups.getGroup(lock, newChunkedGroupIdx);
+    if (newChunkedGroupIdx != nodeGroupScanState.chunkedGroupIdx) {
+        // If the chunked group matches the scan state, don't re-initialize it.
+        // E.g., we may scan a group multiple times in parts
+        initializeScanStateForChunkedGroup(state, chunkedGroupToScan);
+        nodeGroupScanState.chunkedGroupIdx = newChunkedGroupIdx;
+    }
+
+    uint64_t numRowsScanned = 0;
+    const auto rowIdxInChunkToScan =
+        (startOffsetInGroup + numRowsScanned) - chunkedGroupToScan->getStartRowIdx();
+    uint64_t numRowsToScanInChunk = std::min(numRowsToScan - numRowsScanned,
+        chunkedGroupToScan->getNumRows() - rowIdxInChunkToScan);
+    KU_ASSERT(startOffsetInGroup + numRowsToScanInChunk <= numRows);
+    chunkedGroupToScan->scan(transaction, state, nodeGroupScanState, rowIdxInChunkToScan,
+        numRowsToScanInChunk);
+    numRowsScanned += numRowsToScanInChunk;
+    nodeGroupScanState.nextRowToScan += numRowsToScanInChunk;
+
+    return NodeGroupScanResult{startOffsetInGroup, numRowsScanned};
+}
+
+bool NodeGroup::lookupNoLock(const Transaction* transaction, const TableScanState& state,
+    sel_t posInSel) const {
+    auto& nodeGroupScanState = *state.nodeGroupScanState;
+    const auto pos = state.rowIdxVector->state->getSelVector().getSelectedPositions()[posInSel];
+    KU_ASSERT(!state.rowIdxVector->isNull(pos));
+    const auto rowIdx = state.rowIdxVector->getValue<row_idx_t>(pos);
+    const ChunkedNodeGroup* chunkedGroupToScan = findChunkedGroupFromRowIdxNoLock(rowIdx);
+    KU_ASSERT(chunkedGroupToScan);
+    const auto rowIdxInChunkedGroup = rowIdx - chunkedGroupToScan->getStartRowIdx();
+    return chunkedGroupToScan->lookup(transaction, state, nodeGroupScanState, rowIdxInChunkedGroup,
+        posInSel);
+}
+
+bool NodeGroup::lookupMultiple(const UniqLock& lock, const Transaction* transaction,
+    const TableScanState& state) const {
+    idx_t numTuplesFound = 0;
+    for (auto i = 0u; i < state.rowIdxVector->state->getSelVector().getSelSize(); i++) {
+        auto& nodeGroupScanState = *state.nodeGroupScanState;
+        const auto pos = state.rowIdxVector->state->getSelVector().getSelectedPositions()[i];
+        KU_ASSERT(!state.rowIdxVector->isNull(pos));
+        const auto rowIdx = state.rowIdxVector->getValue<row_idx_t>(pos);
+        const ChunkedNodeGroup* chunkedGroupToScan = findChunkedGroupFromRowIdx(lock, rowIdx);
+        KU_ASSERT(chunkedGroupToScan);
+        const auto rowIdxInChunkedGroup = rowIdx - chunkedGroupToScan->getStartRowIdx();
+        numTuplesFound += chunkedGroupToScan->lookup(transaction, state, nodeGroupScanState,
+            rowIdxInChunkedGroup, i);
+    }
+    return numTuplesFound == state.rowIdxVector->state->getSelVector().getSelSize();
+}
+
+bool NodeGroup::lookup(const Transaction* transaction, const TableScanState& state,
+    sel_t posInSel) const {
+    const auto lock = chunkedGroups.lock();
+    return lookupNoLock(transaction, state, posInSel);
+}
+
+bool NodeGroup::lookupMultiple(const Transaction* transaction, const TableScanState& state) const {
+    const auto lock = chunkedGroups.lock();
+    return lookupMultiple(lock, transaction, state);
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void NodeGroup::update(const Transaction* transaction, row_idx_t rowIdxInGroup,
+    column_id_t columnID, const ValueVector& propertyVector) {
+    KU_ASSERT(propertyVector.state->getSelVector().getSelSize() == 1);
+    ChunkedNodeGroup* chunkedGroupToUpdate = nullptr;
+    {
+        const auto lock = chunkedGroups.lock();
+        chunkedGroupToUpdate = findChunkedGroupFromRowIdx(lock, rowIdxInGroup);
+    }
+    KU_ASSERT(chunkedGroupToUpdate);
+    const auto rowIdxInChunkedGroup = rowIdxInGroup - chunkedGroupToUpdate->getStartRowIdx();
+    chunkedGroupToUpdate->update(transaction, rowIdxInChunkedGroup, columnID, propertyVector);
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+bool NodeGroup::delete_(const Transaction* transaction, row_idx_t rowIdxInGroup) {
+    ChunkedNodeGroup* groupToDelete = nullptr;
+    {
+        const auto lock = chunkedGroups.lock();
+        groupToDelete = findChunkedGroupFromRowIdx(lock, rowIdxInGroup);
+    }
+    KU_ASSERT(groupToDelete);
+    const auto rowIdxInChunkedGroup = rowIdxInGroup - groupToDelete->getStartRowIdx();
+    return groupToDelete->delete_(transaction, rowIdxInChunkedGroup);
+}
+
+bool NodeGroup::hasDeletions(const Transaction* transaction) const {
+    const auto lock = chunkedGroups.lock();
+    for (auto i = 0u; i < chunkedGroups.getNumGroups(lock); i++) {
+        const auto chunkedGroup = chunkedGroups.getGroup(lock, i);
+        if (chunkedGroup->hasDeletions(transaction)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void NodeGroup::addColumn(TableAddColumnState& addColumnState, PageAllocator* pageAllocator,
+    ColumnStats* newColumnStats) {
+    dataTypes.push_back(addColumnState.propertyDefinition.getType().copy());
+    const auto lock = chunkedGroups.lock();
+    for (auto& chunkedGroup : chunkedGroups.getAllGroups(lock)) {
+        chunkedGroup->addColumn(mm, addColumnState, enableCompression, pageAllocator,
+            newColumnStats);
+    }
+}
+
+void NodeGroup::rollbackInsert(row_idx_t startRow) {
+    const auto lock = chunkedGroups.lock();
+    const auto numEmptyTrailingGroups = chunkedGroups.getNumEmptyTrailingGroups(lock);
+    chunkedGroups.removeTrailingGroups(lock, numEmptyTrailingGroups);
+    numRows = startRow;
+}
+
+void NodeGroup::reclaimStorage(PageAllocator& pageAllocator) const {
+    reclaimStorage(pageAllocator, chunkedGroups.lock());
+}
+
+void NodeGroup::reclaimStorage(PageAllocator& pageAllocator, const UniqLock& lock) const {
+    for (auto& chunkedGroup : chunkedGroups.getAllGroups(lock)) {
+        chunkedGroup->reclaimStorage(pageAllocator);
+    }
+}
+
+void NodeGroup::checkpoint(MemoryManager& memoryManager, NodeGroupCheckpointState& state) {
+    const auto lock = chunkedGroups.lock();
+    KU_ASSERT(chunkedGroups.getNumGroups(lock) >= 1);
+    const auto firstGroup = chunkedGroups.getFirstGroup(lock);
+    const auto hasPersistentData = firstGroup->getResidencyState() == ResidencyState::ON_DISK;
+    // Re-populate version info here first.
+    auto checkpointedVersionInfo = checkpointVersionInfo(lock, &DUMMY_CHECKPOINT_TRANSACTION);
+    std::unique_ptr<ChunkedNodeGroup> checkpointedChunkedGroup;
+    if (checkpointedVersionInfo->getNumDeletions(&DUMMY_CHECKPOINT_TRANSACTION, 0, numRows) ==
+        numRows - firstGroup->getStartRowIdx()) {
+        reclaimStorage(state.pageAllocator, lock);
+        checkpointedChunkedGroup =
+            ChunkedNodeGroup::flushEmpty(memoryManager, dataTypes, enableCompression,
+                StorageConfig::CHUNKED_NODE_GROUP_CAPACITY, numRows, state.pageAllocator);
+    } else {
+        if (hasPersistentData) {
+            checkpointedChunkedGroup = checkpointInMemAndOnDisk(memoryManager, lock, state);
+        } else {
+            checkpointedChunkedGroup = checkpointInMemOnly(memoryManager, lock, state);
+        }
+        checkpointedChunkedGroup->setVersionInfo(std::move(checkpointedVersionInfo));
+    }
+    chunkedGroups.clear(lock);
+    chunkedGroups.appendGroup(lock, std::move(checkpointedChunkedGroup));
+    checkpointDataTypesNoLock(state);
+}
+
+void NodeGroup::checkpointDataTypesNoLock(const NodeGroupCheckpointState& state) {
+    std::vector<LogicalType> checkpointedTypes;
+    for (auto i = 0u; i < state.columnIDs.size(); i++) {
+        auto columnID = state.columnIDs[i];
+        KU_ASSERT(columnID < dataTypes.size());
+        checkpointedTypes.push_back(dataTypes[columnID].copy());
+    }
+    dataTypes = std::move(checkpointedTypes);
+}
+
+void NodeGroup::scanCommittedUpdatesForColumn(
+    std::vector<ChunkCheckpointState>& chunkCheckpointStates, MemoryManager& memoryManager,
+    const UniqLock& lock, column_id_t columnID, const Column* column) const {
+    auto updateSegmentScanner =
+        LazySegmentScanner(memoryManager, column->getDataType().copy(), enableCompression);
+    ChunkState chunkState;
+    auto& firstColumnChunk = chunkedGroups.getFirstGroup(lock)->getColumnChunk(columnID);
+    const auto numPersistentRows = firstColumnChunk.getNumValues();
+    firstColumnChunk.initializeScanState(chunkState, column);
+    for (auto& chunkedGroup : chunkedGroups.getAllGroups(lock)) {
+        chunkedGroup->getColumnChunk(columnID).scanCommitted<ResidencyState::ON_DISK>(
+            &DUMMY_CHECKPOINT_TRANSACTION, chunkState, updateSegmentScanner);
+    }
+    KU_ASSERT(updateSegmentScanner.getNumValues() == numPersistentRows);
+    updateSegmentScanner.rangeSegments(updateSegmentScanner.begin(), numPersistentRows,
+        [&chunkCheckpointStates](auto& segment, auto, auto segmentLength, auto offsetInChunk) {
+            if (segment.segmentData) {
+                chunkCheckpointStates.emplace_back(std::move(segment.segmentData), offsetInChunk,
+                    segmentLength);
+            }
+        });
+}
+
+std::unique_ptr<ChunkedNodeGroup> NodeGroup::checkpointInMemAndOnDisk(MemoryManager& memoryManager,
+    const UniqLock& lock, NodeGroupCheckpointState& state) const {
+    const auto firstGroup = chunkedGroups.getFirstGroup(lock);
+    const auto numPersistentRows = firstGroup->getNumRows();
+    std::vector<const Column*> columnPtrs;
+    columnPtrs.reserve(state.columns.size());
+    for (auto* column : state.columns) {
+        columnPtrs.push_back(column);
+    }
+    const auto insertChunkedGroup = scanAllInsertedAndVersions<ResidencyState::IN_MEMORY>(
+        memoryManager, lock, state.columnIDs, columnPtrs);
+    const auto numInsertedRows = insertChunkedGroup->getNumRows();
+    for (auto i = 0u; i < state.columnIDs.size(); i++) {
+        const auto columnID = state.columnIDs[i];
+        // if has persistent data, scan updates from persistent chunked group;
+        KU_ASSERT(firstGroup && firstGroup->getResidencyState() == ResidencyState::ON_DISK);
+        const auto columnHasUpdates = firstGroup->hasAnyUpdates(&DUMMY_CHECKPOINT_TRANSACTION,
+            columnID, 0, firstGroup->getNumRows());
+        if (numInsertedRows == 0 && !columnHasUpdates) {
+            continue;
+        }
+        std::vector<ChunkCheckpointState> chunkCheckpointStates;
+        if (columnHasUpdates) {
+            scanCommittedUpdatesForColumn(chunkCheckpointStates, memoryManager, lock, columnID,
+                state.columns[columnID]);
+        }
+        if (numInsertedRows > 0) {
+            chunkCheckpointStates.emplace_back(insertChunkedGroup->moveColumnChunk(columnID),
+                numPersistentRows, numInsertedRows);
+        }
+        firstGroup->getColumnChunk(columnID).checkpoint(*state.columns[i],
+            std::move(chunkCheckpointStates), state.pageAllocator);
+    }
+    auto checkpointedChunkedGroup =
+        std::make_unique<ChunkedNodeGroup>(*chunkedGroups.getGroup(lock, 0), state.columnIDs);
+    KU_ASSERT(checkpointedChunkedGroup->getResidencyState() == ResidencyState::ON_DISK);
+    checkpointedChunkedGroup->resetNumRowsFromChunks();
+    checkpointedChunkedGroup->resetVersionAndUpdateInfo();
+    // The first chunked group is the only persistent one
+    // The checkpointed columns have been moved to the checkpointedChunkedGroup, the
+    // remaining must have been dropped
+    firstGroup->reclaimStorage(state.pageAllocator);
+    return checkpointedChunkedGroup;
+}
+
+std::unique_ptr<ChunkedNodeGroup> NodeGroup::checkpointInMemOnly(MemoryManager& memoryManager,
+    const UniqLock& lock, const NodeGroupCheckpointState& state) const {
+    // Flush insertChunkedGroup to persistent one.
+    std::vector<const Column*> columnPtrs;
+    columnPtrs.reserve(state.columns.size());
+    for (auto& column : state.columns) {
+        columnPtrs.push_back(column);
+    }
+    auto insertChunkedGroup = scanAllInsertedAndVersions<ResidencyState::IN_MEMORY>(memoryManager,
+        lock, state.columnIDs, columnPtrs);
+    return insertChunkedGroup->flush(&DUMMY_CHECKPOINT_TRANSACTION, state.pageAllocator);
+}
+
+std::unique_ptr<VersionInfo> NodeGroup::checkpointVersionInfo(const UniqLock& lock,
+    const Transaction* transaction) const {
+    auto checkpointVersionInfo = std::make_unique<VersionInfo>();
+    row_idx_t currRow = 0;
+    for (auto& chunkedGroup : chunkedGroups.getAllGroups(lock)) {
+        if (chunkedGroup->hasVersionInfo()) {
+            // TODO(Guodong): Optimize the for loop here to directly acess the version info.
+            for (auto i = 0u; i < chunkedGroup->getNumRows(); i++) {
+                if (chunkedGroup->isDeleted(transaction, i)) {
+                    checkpointVersionInfo->delete_(transaction->getID(), currRow + i);
+                }
+            }
+        }
+        currRow += chunkedGroup->getNumRows();
+    }
+    return checkpointVersionInfo;
+}
+
+uint64_t NodeGroup::getEstimatedMemoryUsage() const {
+    uint64_t memUsage = 0;
+    const auto lock = chunkedGroups.lock();
+    for (const auto& chunkedGroup : chunkedGroups.getAllGroups(lock)) {
+        memUsage += chunkedGroup->getEstimatedMemoryUsage();
+    }
+    return memUsage;
+}
+
+void NodeGroup::serialize(Serializer& serializer) {
+    // Serialize checkpointed chunks.
+    serializer.writeDebuggingInfo("node_group_idx");
+    serializer.write<node_group_idx_t>(nodeGroupIdx);
+    serializer.writeDebuggingInfo("enable_compression");
+    serializer.write<bool>(enableCompression);
+    serializer.writeDebuggingInfo("format");
+    serializer.write<NodeGroupDataFormat>(format);
+    const auto lock = chunkedGroups.lock();
+    KU_ASSERT(chunkedGroups.getNumGroups(lock) == 1);
+    const auto chunkedGroup = chunkedGroups.getFirstGroup(lock);
+    serializer.writeDebuggingInfo("has_checkpointed_data");
+    serializer.write<bool>(chunkedGroup->getResidencyState() == ResidencyState::ON_DISK);
+    if (chunkedGroup->getResidencyState() == ResidencyState::ON_DISK) {
+        serializer.writeDebuggingInfo("checkpointed_data");
+        chunkedGroup->serialize(serializer);
+    }
+}
+
+std::unique_ptr<NodeGroup> NodeGroup::deserialize(MemoryManager& mm, Deserializer& deSer,
+    const std::vector<LogicalType>& columnTypes) {
+    std::string key;
+    node_group_idx_t nodeGroupIdx = INVALID_NODE_GROUP_IDX;
+    bool enableCompression = false;
+    auto format = NodeGroupDataFormat::REGULAR;
+    bool hasCheckpointedData = false;
+    deSer.validateDebuggingInfo(key, "node_group_idx");
+    deSer.deserializeValue<node_group_idx_t>(nodeGroupIdx);
+    deSer.validateDebuggingInfo(key, "enable_compression");
+    deSer.deserializeValue<bool>(enableCompression);
+    deSer.validateDebuggingInfo(key, "format");
+    deSer.deserializeValue<NodeGroupDataFormat>(format);
+    deSer.validateDebuggingInfo(key, "has_checkpointed_data");
+    deSer.deserializeValue<bool>(hasCheckpointedData);
+    if (hasCheckpointedData) {
+        deSer.validateDebuggingInfo(key, "checkpointed_data");
+    }
+    std::unique_ptr<ChunkedNodeGroup> chunkedNodeGroup;
+    switch (format) {
+    case NodeGroupDataFormat::REGULAR: {
+        if (hasCheckpointedData) {
+            chunkedNodeGroup = ChunkedNodeGroup::deserialize(mm, deSer);
+        } else {
+            chunkedNodeGroup = std::make_unique<ChunkedNodeGroup>(mm, columnTypes,
+                enableCompression, 0, 0, ResidencyState::IN_MEMORY);
+        }
+        return std::make_unique<NodeGroup>(mm, nodeGroupIdx, enableCompression,
+            std::move(chunkedNodeGroup));
+    }
+    case NodeGroupDataFormat::CSR: {
+        if (hasCheckpointedData) {
+            chunkedNodeGroup = ChunkedCSRNodeGroup::deserialize(mm, deSer);
+            return std::make_unique<CSRNodeGroup>(mm, nodeGroupIdx, enableCompression,
+                std::move(chunkedNodeGroup));
+        } else {
+            return std::make_unique<CSRNodeGroup>(mm, nodeGroupIdx, enableCompression,
+                copyVector(columnTypes));
+        }
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+std::pair<idx_t, row_idx_t> NodeGroup::findChunkedGroupIdxFromRowIdxNoLock(row_idx_t rowIdx) const {
+    if (chunkedGroups.getNumGroupsNoLock() == 0 || rowIdx < getStartRowIdxInGroupNoLock()) {
+        return {INVALID_CHUNKED_GROUP_IDX, INVALID_START_ROW_IDX};
+    }
+    rowIdx -= getStartRowIdxInGroupNoLock();
+    const auto numRowsInFirstGroup = chunkedGroups.getFirstGroupNoLock()->getNumRows();
+    if (rowIdx < numRowsInFirstGroup) {
+        return {0, rowIdx};
+    }
+    rowIdx -= numRowsInFirstGroup;
+    const auto chunkedGroupIdx = rowIdx / StorageConfig::CHUNKED_NODE_GROUP_CAPACITY + 1;
+    const auto rowIdxInChunk = rowIdx % StorageConfig::CHUNKED_NODE_GROUP_CAPACITY;
+    if (chunkedGroupIdx >= chunkedGroups.getNumGroupsNoLock()) {
+        return {INVALID_CHUNKED_GROUP_IDX, INVALID_START_ROW_IDX};
+    }
+    return {chunkedGroupIdx, rowIdxInChunk};
+}
+
+ChunkedNodeGroup* NodeGroup::findChunkedGroupFromRowIdx(const UniqLock& lock,
+    row_idx_t rowIdx) const {
+    const auto [chunkedGroupIdx, rowIdxInChunkedGroup] =
+        findChunkedGroupIdxFromRowIdxNoLock(rowIdx);
+    if (chunkedGroupIdx == INVALID_CHUNKED_GROUP_IDX) {
+        return nullptr;
+    }
+    return chunkedGroups.getGroup(lock, chunkedGroupIdx);
+}
+
+ChunkedNodeGroup* NodeGroup::findChunkedGroupFromRowIdxNoLock(row_idx_t rowIdx) const {
+    const auto [chunkedGroupIdx, rowIdxInChunkedGroup] =
+        findChunkedGroupIdxFromRowIdxNoLock(rowIdx);
+    if (chunkedGroupIdx == INVALID_CHUNKED_GROUP_IDX) {
+        return nullptr;
+    }
+    return chunkedGroups.getGroupNoLock(chunkedGroupIdx);
+}
+
+template<ResidencyState RESIDENCY_STATE>
+row_idx_t NodeGroup::getNumResidentRows(const UniqLock& lock) const {
+    row_idx_t numResidentRows = 0u;
+    for (auto& chunkedGroup : chunkedGroups.getAllGroups(lock)) {
+        if (chunkedGroup->getResidencyState() == RESIDENCY_STATE) {
+            numResidentRows += chunkedGroup->getNumRows();
+        }
+    }
+    return numResidentRows;
+}
+
+template<ResidencyState RESIDENCY_STATE>
+std::unique_ptr<InMemChunkedNodeGroup> NodeGroup::scanAllInsertedAndVersions(
+    MemoryManager& memoryManager, const UniqLock& lock, const std::vector<column_id_t>& columnIDs,
+    const std::vector<const Column*>& columns) const {
+    auto numResidentRows = getNumResidentRows<RESIDENCY_STATE>(lock);
+    std::vector<LogicalType> columnTypes;
+    for (const auto* column : columns) {
+        columnTypes.push_back(column->getDataType().copy());
+    }
+    auto mergedInMemGroup = std::make_unique<InMemChunkedNodeGroup>(memoryManager, columnTypes,
+        enableCompression, numResidentRows, chunkedGroups.getFirstGroup(lock)->getStartRowIdx());
+    auto scanState = std::make_unique<TableScanState>(columnIDs, columns);
+    scanState->nodeGroupScanState = std::make_unique<NodeGroupScanState>(columnIDs.size());
+    initializeScanState(&DUMMY_CHECKPOINT_TRANSACTION, lock, *scanState);
+    for (auto& chunkedGroup : chunkedGroups.getAllGroups(lock)) {
+        chunkedGroup->scanCommitted<RESIDENCY_STATE>(&DUMMY_CHECKPOINT_TRANSACTION, *scanState,
+            *mergedInMemGroup);
+    }
+    for (auto i = 0u; i < columnIDs.size(); i++) {
+        if (columnIDs[i] != 0) {
+            KU_ASSERT(numResidentRows == mergedInMemGroup->getColumnChunk(i).getNumValues());
+        }
+    }
+    mergedInMemGroup->setNumRows(numResidentRows);
+    return mergedInMemGroup;
+}
+
+template std::unique_ptr<InMemChunkedNodeGroup>
+NodeGroup::scanAllInsertedAndVersions<ResidencyState::ON_DISK>(MemoryManager& memoryManager,
+    const UniqLock& lock, const std::vector<column_id_t>& columnIDs,
+    const std::vector<const Column*>& columns) const;
+template std::unique_ptr<InMemChunkedNodeGroup>
+NodeGroup::scanAllInsertedAndVersions<ResidencyState::IN_MEMORY>(MemoryManager& memoryManager,
+    const UniqLock& lock, const std::vector<column_id_t>& columnIDs,
+    const std::vector<const Column*>& columns) const;
+
+bool NodeGroup::isVisible(const Transaction* transaction, row_idx_t rowIdxInGroup) const {
+    ChunkedNodeGroup* chunkedGroup = nullptr;
+    {
+        const auto lock = chunkedGroups.lock();
+        chunkedGroup = findChunkedGroupFromRowIdx(lock, rowIdxInGroup);
+    }
+    if (!chunkedGroup) {
+        return false;
+    }
+    const auto rowIdxInChunkedGroup = rowIdxInGroup - chunkedGroup->getStartRowIdx();
+    return !chunkedGroup->isDeleted(transaction, rowIdxInChunkedGroup) &&
+           chunkedGroup->isInserted(transaction, rowIdxInChunkedGroup);
+}
+
+bool NodeGroup::isVisibleNoLock(const Transaction* transaction, row_idx_t rowIdxInGroup) const {
+    const auto* chunkedGroup = findChunkedGroupFromRowIdxNoLock(rowIdxInGroup);
+    if (!chunkedGroup) {
+        return false;
+    }
+    const auto rowIdxInChunkedGroup = rowIdxInGroup - chunkedGroup->getStartRowIdx();
+    return !chunkedGroup->isDeleted(transaction, rowIdxInChunkedGroup) &&
+           chunkedGroup->isInserted(transaction, rowIdxInChunkedGroup);
+}
+
+bool NodeGroup::isDeleted(const Transaction* transaction, offset_t offsetInGroup) const {
+    const auto lock = chunkedGroups.lock();
+    const auto* chunkedGroup = findChunkedGroupFromRowIdx(lock, offsetInGroup);
+    KU_ASSERT(chunkedGroup);
+    return chunkedGroup->isDeleted(transaction, offsetInGroup - chunkedGroup->getStartRowIdx());
+}
+
+bool NodeGroup::isInserted(const Transaction* transaction, offset_t offsetInGroup) const {
+    const auto lock = chunkedGroups.lock();
+    const auto* chunkedGroup = findChunkedGroupFromRowIdx(lock, offsetInGroup);
+    KU_ASSERT(chunkedGroup);
+    return chunkedGroup->isInserted(transaction, offsetInGroup - chunkedGroup->getStartRowIdx());
+}
+
+void NodeGroup::applyFuncToChunkedGroups(version_record_handler_op_t func, row_idx_t startRow,
+    row_idx_t numRows, transaction_t commitTS) const {
+    KU_ASSERT(startRow <= getNumRows());
+
+    auto lock = chunkedGroups.lock();
+    const auto [chunkedGroupIdx, startRowInChunkedGroup] =
+        findChunkedGroupIdxFromRowIdxNoLock(startRow);
+    if (chunkedGroupIdx != INVALID_CHUNKED_GROUP_IDX) {
+        auto curChunkedGroupIdx = chunkedGroupIdx;
+        auto curStartRowIdxInChunk = startRowInChunkedGroup;
+
+        auto numRowsLeft = numRows;
+        while (numRowsLeft > 0 && curChunkedGroupIdx < chunkedGroups.getNumGroups(lock)) {
+            auto* chunkedGroup = chunkedGroups.getGroup(lock, curChunkedGroupIdx);
+            const auto numRowsForGroup =
+                std::min(numRowsLeft, chunkedGroup->getNumRows() - curStartRowIdxInChunk);
+            std::invoke(func, *chunkedGroup, curStartRowIdxInChunk, numRowsForGroup, commitTS);
+
+            ++curChunkedGroupIdx;
+            numRowsLeft -= numRowsForGroup;
+            curStartRowIdxInChunk = 0;
+        }
+    }
+}
+
+row_idx_t NodeGroup::getStartRowIdxInGroupNoLock() const {
+    return chunkedGroups.getFirstGroupNoLock()->getStartRowIdx();
+}
+
+row_idx_t NodeGroup::getStartRowIdxInGroup(const common::UniqLock& lock) const {
+    return chunkedGroups.getFirstGroup(lock)->getStartRowIdx();
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/node_group_collection.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/node_group_collection.cpp
new file mode 100644
index 0000000000..76d03aa342
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/node_group_collection.cpp
@@ -0,0 +1,276 @@
+#include "storage/table/node_group_collection.h"
+
+#include "common/vector/value_vector.h"
+#include "storage/table/chunked_node_group.h"
+#include "storage/table/csr_node_group.h"
+#include "storage/table/table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+NodeGroupCollection::NodeGroupCollection(MemoryManager& mm, const std::vector<LogicalType>& types,
+    const bool enableCompression, ResidencyState residency,
+    const VersionRecordHandler* versionRecordHandler)
+    : mm{mm}, enableCompression{enableCompression}, numTotalRows{0},
+      types{LogicalType::copy(types)}, residency{residency}, stats{std::span{types}},
+      versionRecordHandler(versionRecordHandler) {
+    const auto lock = nodeGroups.lock();
+    for (auto& nodeGroup : nodeGroups.getAllGroups(lock)) {
+        numTotalRows += nodeGroup->getNumRows();
+    }
+}
+
+void NodeGroupCollection::append(const Transaction* transaction,
+    const std::vector<ValueVector*>& vectors) {
+    const auto numRowsToAppend = vectors[0]->state->getSelVector().getSelSize();
+    KU_ASSERT(numRowsToAppend == vectors[0]->state->getSelVector().getSelSize());
+    for (auto i = 1u; i < vectors.size(); i++) {
+        KU_ASSERT(vectors[i]->state->getSelVector().getSelSize() == numRowsToAppend);
+    }
+    const auto lock = nodeGroups.lock();
+    if (nodeGroups.isEmpty(lock)) {
+        auto newGroup =
+            std::make_unique<NodeGroup>(mm, 0, enableCompression, LogicalType::copy(types));
+        nodeGroups.appendGroup(lock, std::move(newGroup));
+    }
+    row_idx_t numRowsAppended = 0u;
+    while (numRowsAppended < numRowsToAppend) {
+        auto lastNodeGroup = nodeGroups.getLastGroup(lock);
+        if (!lastNodeGroup || lastNodeGroup->isFull()) {
+            auto newGroup = std::make_unique<NodeGroup>(mm, nodeGroups.getNumGroups(lock),
+                enableCompression, LogicalType::copy(types));
+            nodeGroups.appendGroup(lock, std::move(newGroup));
+        }
+        lastNodeGroup = nodeGroups.getLastGroup(lock);
+        const auto numToAppendInNodeGroup =
+            std::min(numRowsToAppend - numRowsAppended, lastNodeGroup->getNumRowsLeftToAppend());
+        lastNodeGroup->moveNextRowToAppend(numToAppendInNodeGroup);
+        pushInsertInfo(transaction, lastNodeGroup, numToAppendInNodeGroup);
+        numTotalRows += numToAppendInNodeGroup;
+        lastNodeGroup->append(transaction, vectors, numRowsAppended, numToAppendInNodeGroup);
+        numRowsAppended += numToAppendInNodeGroup;
+    }
+    stats.update(vectors);
+}
+
+void NodeGroupCollection::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, const NodeGroupCollection& other) {
+    const auto otherLock = other.nodeGroups.lock();
+    for (auto& nodeGroup : other.nodeGroups.getAllGroups(otherLock)) {
+        append(transaction, columnIDs, *nodeGroup);
+    }
+    mergeStats(columnIDs, other.getStats(otherLock));
+}
+
+void NodeGroupCollection::append(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, const NodeGroup& nodeGroup) {
+    KU_ASSERT(nodeGroup.getDataTypes().size() == columnIDs.size());
+    const auto lock = nodeGroups.lock();
+    if (nodeGroups.isEmpty(lock)) {
+        auto newGroup =
+            std::make_unique<NodeGroup>(mm, 0, enableCompression, LogicalType::copy(types));
+        nodeGroups.appendGroup(lock, std::move(newGroup));
+    }
+    const auto numChunkedGroupsToAppend = nodeGroup.getNumChunkedGroups();
+    node_group_idx_t numChunkedGroupsAppended = 0;
+    while (numChunkedGroupsAppended < numChunkedGroupsToAppend) {
+        const auto chunkedGroupToAppend = nodeGroup.getChunkedNodeGroup(numChunkedGroupsAppended);
+        const auto numRowsToAppendInChunkedGroup = chunkedGroupToAppend->getNumRows();
+        row_idx_t numRowsAppendedInChunkedGroup = 0;
+        while (numRowsAppendedInChunkedGroup < numRowsToAppendInChunkedGroup) {
+            auto lastNodeGroup = nodeGroups.getLastGroup(lock);
+            if (!lastNodeGroup || lastNodeGroup->isFull()) {
+                auto newGroup = std::make_unique<NodeGroup>(mm, nodeGroups.getNumGroups(lock),
+                    enableCompression, LogicalType::copy(types));
+                nodeGroups.appendGroup(lock, std::move(newGroup));
+            }
+            lastNodeGroup = nodeGroups.getLastGroup(lock);
+            const auto numToAppendInBatch =
+                std::min(numRowsToAppendInChunkedGroup - numRowsAppendedInChunkedGroup,
+                    lastNodeGroup->getNumRowsLeftToAppend());
+            lastNodeGroup->moveNextRowToAppend(numToAppendInBatch);
+            pushInsertInfo(transaction, lastNodeGroup, numToAppendInBatch);
+            numTotalRows += numToAppendInBatch;
+            lastNodeGroup->append(transaction, columnIDs, *chunkedGroupToAppend,
+                numRowsAppendedInChunkedGroup, numToAppendInBatch);
+            numRowsAppendedInChunkedGroup += numToAppendInBatch;
+        }
+        numChunkedGroupsAppended++;
+    }
+}
+
+std::pair<offset_t, offset_t> NodeGroupCollection::appendToLastNodeGroupAndFlushWhenFull(
+    Transaction* transaction, const std::vector<column_id_t>& columnIDs,
+    InMemChunkedNodeGroup& chunkedGroup, PageAllocator& pageAllocator) {
+    NodeGroup* lastNodeGroup = nullptr;
+    offset_t startOffset = 0;
+    offset_t numToAppend = 0;
+    bool directFlushWhenAppend = false;
+    {
+        const auto lock = nodeGroups.lock();
+        startOffset = numTotalRows;
+        if (nodeGroups.isEmpty(lock)) {
+            nodeGroups.appendGroup(lock,
+                std::make_unique<NodeGroup>(mm, nodeGroups.getNumGroups(lock), enableCompression,
+                    LogicalType::copy(types)));
+        }
+        lastNodeGroup = nodeGroups.getLastGroup(lock);
+        auto numRowsLeftInLastNodeGroup = lastNodeGroup->getNumRowsLeftToAppend();
+        if (numRowsLeftInLastNodeGroup == 0) {
+            nodeGroups.appendGroup(lock,
+                std::make_unique<NodeGroup>(mm, nodeGroups.getNumGroups(lock), enableCompression,
+                    LogicalType::copy(types)));
+            lastNodeGroup = nodeGroups.getLastGroup(lock);
+            numRowsLeftInLastNodeGroup = lastNodeGroup->getNumRowsLeftToAppend();
+        }
+        numToAppend = std::min(chunkedGroup.getNumRows(), numRowsLeftInLastNodeGroup);
+        lastNodeGroup->moveNextRowToAppend(numToAppend);
+        // If the node group is empty now and the chunked group is full, we can directly flush it.
+        directFlushWhenAppend =
+            numToAppend == numRowsLeftInLastNodeGroup && lastNodeGroup->getNumRows() == 0;
+        pushInsertInfo(transaction, lastNodeGroup, numToAppend);
+        numTotalRows += numToAppend;
+        if (!directFlushWhenAppend) {
+            // TODO(Guodong): Further optimize on this. Should directly figure out startRowIdx to
+            // start appending into the node group and pass in as param.
+            lastNodeGroup->append(transaction, columnIDs, chunkedGroup, 0, numToAppend);
+        }
+    }
+    if (directFlushWhenAppend) {
+        auto flushedGroup = chunkedGroup.flush(transaction, pageAllocator);
+
+        // If there are deleted columns that haven't been vacuumed yet,
+        // we need to add extra columns to the chunked group
+        // to ensure that the number of columns is consistent with the rest of the node group
+        auto groupToMerge = std::make_unique<ChunkedNodeGroup>(mm, *flushedGroup,
+            lastNodeGroup->getDataTypes(), columnIDs);
+
+        KU_ASSERT(lastNodeGroup->getNumChunkedGroups() == 0);
+        lastNodeGroup->merge(transaction, std::move(groupToMerge));
+    }
+    return {startOffset, numToAppend};
+}
+
+row_idx_t NodeGroupCollection::getNumTotalRows() const {
+    const auto lock = nodeGroups.lock();
+    return numTotalRows;
+}
+
+NodeGroup* NodeGroupCollection::getOrCreateNodeGroup(const Transaction* transaction,
+    node_group_idx_t groupIdx, NodeGroupDataFormat format) {
+    const auto lock = nodeGroups.lock();
+    while (groupIdx >= nodeGroups.getNumGroups(lock)) {
+        const auto currentGroupIdx = nodeGroups.getNumGroups(lock);
+        nodeGroups.appendGroup(lock, format == NodeGroupDataFormat::REGULAR ?
+                                         std::make_unique<NodeGroup>(mm, currentGroupIdx,
+                                             enableCompression, LogicalType::copy(types)) :
+                                         std::make_unique<CSRNodeGroup>(mm, currentGroupIdx,
+                                             enableCompression, LogicalType::copy(types)));
+        // push an insert of size 0 so that we can roll back the creation of this node group if
+        // needed
+        pushInsertInfo(transaction, nodeGroups.getLastGroup(lock), 0);
+    }
+    KU_ASSERT(groupIdx < nodeGroups.getNumGroups(lock));
+    return nodeGroups.getGroup(lock, groupIdx);
+}
+
+void NodeGroupCollection::addColumn(TableAddColumnState& addColumnState,
+    PageAllocator* pageAllocator) {
+    KU_ASSERT((pageAllocator == nullptr) == (residency == ResidencyState::IN_MEMORY));
+    const auto lock = nodeGroups.lock();
+    auto& newColumnStats = stats.addNewColumn(addColumnState.propertyDefinition.getType());
+    for (const auto& nodeGroup : nodeGroups.getAllGroups(lock)) {
+        nodeGroup->addColumn(addColumnState, pageAllocator, &newColumnStats);
+    }
+    types.push_back(addColumnState.propertyDefinition.getType().copy());
+}
+
+uint64_t NodeGroupCollection::getEstimatedMemoryUsage() const {
+    auto estimatedMemUsage = 0u;
+    const auto lock = nodeGroups.lock();
+    for (const auto& nodeGroup : nodeGroups.getAllGroups(lock)) {
+        estimatedMemUsage += nodeGroup->getEstimatedMemoryUsage();
+    }
+    return estimatedMemUsage;
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void NodeGroupCollection::checkpoint(MemoryManager& memoryManager,
+    NodeGroupCheckpointState& state) {
+    KU_ASSERT(residency == ResidencyState::ON_DISK);
+    const auto lock = nodeGroups.lock();
+    for (const auto& nodeGroup : nodeGroups.getAllGroups(lock)) {
+        nodeGroup->checkpoint(memoryManager, state);
+    }
+    std::vector<LogicalType> typesAfterCheckpoint;
+    for (auto i = 0u; i < state.columnIDs.size(); i++) {
+        typesAfterCheckpoint.push_back(types[state.columnIDs[i]].copy());
+    }
+    types = std::move(typesAfterCheckpoint);
+}
+
+void NodeGroupCollection::reclaimStorage(PageAllocator& pageAllocator) const {
+    const auto lock = nodeGroups.lock();
+    for (auto& nodeGroup : nodeGroups.getAllGroups(lock)) {
+        nodeGroup->reclaimStorage(pageAllocator);
+    }
+}
+
+void NodeGroupCollection::rollbackInsert(row_idx_t numRows_, bool updateNumRows) {
+    const auto lock = nodeGroups.lock();
+
+    // remove any empty trailing node groups after the rollback
+    const auto numGroupsToRemove = nodeGroups.getNumEmptyTrailingGroups(lock);
+    nodeGroups.removeTrailingGroups(lock, numGroupsToRemove);
+
+    if (updateNumRows) {
+        KU_ASSERT(numRows_ <= numTotalRows);
+        numTotalRows -= numRows_;
+    }
+}
+
+void NodeGroupCollection::pushInsertInfo(const Transaction* transaction, const NodeGroup* nodeGroup,
+    row_idx_t numRows) {
+    pushInsertInfo(transaction, nodeGroup->getNodeGroupIdx(), nodeGroup->getNumRows(), numRows,
+        versionRecordHandler, false);
+};
+
+void NodeGroupCollection::pushInsertInfo(const Transaction* transaction,
+    node_group_idx_t nodeGroupIdx, row_idx_t startRow, row_idx_t numRows,
+    const VersionRecordHandler* versionRecordHandler, bool incrementNumRows) {
+    // we only append to the undo buffer if the node group collection is persistent
+    if (residency == ResidencyState::ON_DISK && transaction->shouldAppendToUndoBuffer()) {
+        transaction->pushInsertInfo(nodeGroupIdx, startRow, numRows, versionRecordHandler);
+    }
+    if (incrementNumRows) {
+        numTotalRows += numRows;
+    }
+}
+
+void NodeGroupCollection::serialize(Serializer& ser) {
+    ser.writeDebuggingInfo("node_groups");
+    nodeGroups.serializeGroups(ser);
+    ser.writeDebuggingInfo("stats");
+    stats.serialize(ser);
+}
+
+void NodeGroupCollection::deserialize(Deserializer& deSer, MemoryManager& memoryManager) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "node_groups");
+    KU_ASSERT(residency == ResidencyState::ON_DISK);
+    nodeGroups.deserializeGroups(memoryManager, deSer, types);
+    deSer.validateDebuggingInfo(key, "stats");
+    stats.deserialize(deSer);
+    numTotalRows = 0;
+    const auto lock = nodeGroups.lock();
+    for (auto& nodeGroup : nodeGroups.getAllGroups(lock)) {
+        numTotalRows += nodeGroup->getNumRows();
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/node_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/node_table.cpp
new file mode 100644
index 0000000000..3edbc9a573
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/node_table.cpp
@@ -0,0 +1,857 @@
+#include "storage/table/node_table.h"
+
+#include "catalog/catalog_entry/node_table_catalog_entry.h"
+#include "common/cast.h"
+#include "common/exception/message.h"
+#include "common/exception/runtime.h"
+#include "common/types/types.h"
+#include "main/client_context.h"
+#include "storage/local_storage/local_node_table.h"
+#include "storage/local_storage/local_storage.h"
+#include "storage/local_storage/local_table.h"
+#include "storage/storage_manager.h"
+#include "storage/wal/local_wal.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::transaction;
+using namespace lbug::evaluator;
+
+namespace lbug {
+namespace storage {
+
+NodeTableVersionRecordHandler::NodeTableVersionRecordHandler(NodeTable* table) : table(table) {}
+
+void NodeTableVersionRecordHandler::applyFuncToChunkedGroups(version_record_handler_op_t func,
+    node_group_idx_t nodeGroupIdx, row_idx_t startRow, row_idx_t numRows,
+    transaction_t commitTS) const {
+    table->getNodeGroupNoLock(nodeGroupIdx)
+        ->applyFuncToChunkedGroups(func, startRow, numRows, commitTS);
+}
+
+void NodeTableVersionRecordHandler::rollbackInsert(main::ClientContext* context,
+    node_group_idx_t nodeGroupIdx, row_idx_t startRow, row_idx_t numRows) const {
+    table->rollbackPKIndexInsert(context, startRow, numRows, nodeGroupIdx);
+
+    // the only case where a node group would be empty (and potentially removed before) is if an
+    // exception occurred while adding its first chunk
+    KU_ASSERT(nodeGroupIdx < table->getNumNodeGroups() || startRow == 0);
+    if (nodeGroupIdx < table->getNumNodeGroups()) {
+        VersionRecordHandler::rollbackInsert(context, nodeGroupIdx, startRow, numRows);
+        auto* nodeGroup = table->getNodeGroupNoLock(nodeGroupIdx);
+        const auto numRowsToRollback = std::min(numRows, nodeGroup->getNumRows() - startRow);
+        nodeGroup->rollbackInsert(startRow);
+        table->rollbackGroupCollectionInsert(numRowsToRollback);
+    }
+}
+
+NodeGroupScanResult NodeTableScanState::scanNext(Transaction* transaction, offset_t startOffset,
+    offset_t numNodes) {
+    KU_ASSERT(columns.size() == outputVectors.size());
+    if (source == TableScanSource::NONE) {
+        return NODE_GROUP_SCAN_EMPTY_RESULT;
+    }
+    auto nodeGroupStartOffset = StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx);
+    const auto tableID = table->getTableID();
+    if (source == TableScanSource::UNCOMMITTED) {
+        nodeGroupStartOffset = transaction->getUncommittedOffset(tableID, nodeGroupStartOffset);
+    }
+    auto startOffsetInGroup = startOffset - nodeGroupStartOffset;
+    const NodeGroupScanResult scanResult =
+        nodeGroup->scan(transaction, *this, startOffsetInGroup, numNodes);
+    if (scanResult == NODE_GROUP_SCAN_EMPTY_RESULT) {
+        return scanResult;
+    }
+    for (auto i = 0u; i < scanResult.numRows; i++) {
+        nodeIDVector->setValue(i,
+            nodeID_t{nodeGroupStartOffset + scanResult.startRow + i, tableID});
+    }
+    return scanResult;
+}
+
+std::unique_ptr<NodeTableScanState> IndexScanHelper::initScanState(const Transaction* transaction,
+    DataChunk& dataChunk) {
+    std::vector<ValueVector*> outVectors;
+    for (auto& vector : dataChunk.valueVectors) {
+        outVectors.push_back(vector.get());
+    }
+    auto scanState = std::make_unique<NodeTableScanState>(nullptr, outVectors, dataChunk.state);
+    scanState->setToTable(transaction, table, index->getIndexInfo().columnIDs, {});
+    return scanState;
+}
+
+namespace {
+
+struct UncommittedIndexInserter final : IndexScanHelper {
+    UncommittedIndexInserter(row_idx_t startNodeOffset, NodeTable* table, Index* index,
+        visible_func isVisible)
+        : IndexScanHelper(table, index), startNodeOffset(startNodeOffset),
+          nodeIDVector(LogicalType::INTERNAL_ID()), isVisible(std::move(isVisible)) {}
+
+    std::unique_ptr<NodeTableScanState> initScanState(const Transaction* transaction,
+        DataChunk& dataChunk) override;
+
+    bool processScanOutput(main::ClientContext* context, NodeGroupScanResult scanResult,
+        const std::vector<ValueVector*>& scannedVectors) override;
+
+    row_idx_t startNodeOffset;
+    ValueVector nodeIDVector;
+    visible_func isVisible;
+    std::unique_ptr<Index::InsertState> insertState;
+};
+
+struct RollbackPKDeleter final : IndexScanHelper {
+    RollbackPKDeleter(row_idx_t startNodeOffset, row_idx_t numRows, NodeTable* table,
+        PrimaryKeyIndex* pkIndex)
+        : IndexScanHelper(table, pkIndex),
+          semiMask(SemiMaskUtil::createMask(startNodeOffset + numRows)) {
+        semiMask->maskRange(startNodeOffset, startNodeOffset + numRows);
+        semiMask->enable();
+    }
+
+    std::unique_ptr<NodeTableScanState> initScanState(const Transaction* transaction,
+        DataChunk& dataChunk) override;
+
+    bool processScanOutput(main::ClientContext* context, NodeGroupScanResult scanResult,
+        const std::vector<ValueVector*>& scannedVectors) override;
+
+    std::unique_ptr<SemiMask> semiMask;
+};
+
+std::unique_ptr<NodeTableScanState> UncommittedIndexInserter::initScanState(
+    const Transaction* transaction, DataChunk& dataChunk) {
+    auto scanState = IndexScanHelper::initScanState(transaction, dataChunk);
+    nodeIDVector.setState(dataChunk.state);
+    scanState->source = TableScanSource::UNCOMMITTED;
+    return scanState;
+}
+
+bool UncommittedIndexInserter::processScanOutput(main::ClientContext* context,
+    NodeGroupScanResult scanResult, const std::vector<ValueVector*>& scannedVectors) {
+    if (scanResult == NODE_GROUP_SCAN_EMPTY_RESULT) {
+        return false;
+    }
+    for (auto i = 0u; i < scanResult.numRows; i++) {
+        nodeIDVector.setValue(i, nodeID_t{startNodeOffset + i, table->getTableID()});
+    }
+    if (!insertState) {
+        insertState = index->initInsertState(context, isVisible);
+    }
+    index->commitInsert(transaction::Transaction::Get(*context), nodeIDVector, {scannedVectors},
+        *insertState);
+    startNodeOffset += scanResult.numRows;
+    return true;
+}
+
+std::unique_ptr<NodeTableScanState> RollbackPKDeleter::initScanState(const Transaction* transaction,
+    DataChunk& dataChunk) {
+    auto scanState = IndexScanHelper::initScanState(transaction, dataChunk);
+    scanState->source = TableScanSource::COMMITTED;
+    scanState->semiMask = semiMask.get();
+    return scanState;
+}
+
+template<typename T>
+concept notIndexHashable = !IndexHashable<T>;
+
+bool RollbackPKDeleter::processScanOutput(main::ClientContext* context,
+    NodeGroupScanResult scanResult, const std::vector<ValueVector*>& scannedVectors) {
+    if (scanResult == NODE_GROUP_SCAN_EMPTY_RESULT) {
+        return false;
+    }
+    KU_ASSERT(scannedVectors.size() == 1);
+    auto& scannedVector = *scannedVectors[0];
+    auto& pkIndex = index->cast<PrimaryKeyIndex>();
+    const auto rollbackFunc = [&]<IndexHashable T>(T) {
+        for (idx_t i = 0; i < scannedVector.state->getSelSize(); ++i) {
+            const auto pos = scannedVector.state->getSelVector()[i];
+            T key = scannedVector.getValue<T>(pos);
+            static constexpr auto isVisible = [](offset_t) { return true; };
+            if (offset_t lookupOffset = 0; pkIndex.lookup(transaction::Transaction::Get(*context),
+                    key, lookupOffset, isVisible)) {
+                // If we delete the key then it will not be visible to future transactions within
+                // this process
+                pkIndex.discardLocal(key);
+            }
+        }
+    };
+    TypeUtils::visit(scannedVector.dataType.getPhysicalType(), std::cref(rollbackFunc),
+        []<notIndexHashable T>(T) { KU_UNREACHABLE; });
+    return true;
+}
+} // namespace
+
+void NodeTableScanState::setToTable(const Transaction* transaction, Table* table_,
+    std::vector<column_id_t> columnIDs_, std::vector<ColumnPredicateSet> columnPredicateSets_,
+    RelDataDirection) {
+    TableScanState::setToTable(transaction, table_, columnIDs_, std::move(columnPredicateSets_));
+    columns.resize(columnIDs.size());
+    for (auto i = 0u; i < columnIDs.size(); i++) {
+        if (const auto columnID = columnIDs[i];
+            columnID == INVALID_COLUMN_ID || columnID == ROW_IDX_COLUMN_ID) {
+            columns[i] = nullptr;
+        } else {
+            columns[i] = &table->cast<NodeTable>().getColumn(columnID);
+        }
+    }
+}
+
+bool NodeTableScanState::scanNext(Transaction* transaction) {
+    if (source == TableScanSource::NONE) {
+        return false;
+    }
+    KU_ASSERT(columns.size() == outputVectors.size());
+    const NodeGroupScanResult scanResult = nodeGroup->scan(transaction, *this);
+    if (scanResult == NODE_GROUP_SCAN_EMPTY_RESULT) {
+        return false;
+    }
+    auto nodeGroupStartOffset = StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx);
+    const auto tableID = table->getTableID();
+    if (source == TableScanSource::UNCOMMITTED) {
+        nodeGroupStartOffset = transaction->getUncommittedOffset(tableID, nodeGroupStartOffset);
+    }
+    for (auto i = 0u; i < scanResult.numRows; i++) {
+        auto& nodeID = nodeIDVector->getValue<nodeID_t>(i);
+        nodeID.tableID = tableID;
+        nodeID.offset = nodeGroupStartOffset + scanResult.startRow + i;
+    }
+    return true;
+}
+
+NodeTable::NodeTable(const StorageManager* storageManager,
+    const NodeTableCatalogEntry* nodeTableEntry, MemoryManager* mm)
+    : Table{nodeTableEntry, storageManager, mm},
+      pkColumnID{nodeTableEntry->getColumnID(nodeTableEntry->getPrimaryKeyName())},
+      versionRecordHandler(this) {
+    auto* dataFH = storageManager->getDataFH();
+    auto& pageAllocator = *dataFH->getPageManager();
+    const auto maxColumnID = nodeTableEntry->getMaxColumnID();
+    columns.resize(maxColumnID + 1);
+    for (auto& property : nodeTableEntry->getProperties()) {
+        const auto columnID = nodeTableEntry->getColumnID(property.getName());
+        const auto columnName =
+            StorageUtils::getColumnName(property.getName(), StorageUtils::ColumnType::DEFAULT, "");
+        columns[columnID] = ColumnFactory::createColumn(columnName, property.getType().copy(),
+            dataFH, mm, shadowFile, enableCompression);
+    }
+    auto& pkDefinition = nodeTableEntry->getPrimaryKeyDefinition();
+    KU_ASSERT(pkColumnID != INVALID_COLUMN_ID);
+    auto hashIndexType = PrimaryKeyIndex::getIndexType();
+    IndexInfo indexInfo{PrimaryKeyIndex::DEFAULT_NAME, hashIndexType.typeName, tableID,
+        {pkColumnID}, {pkDefinition.getType().getPhysicalType()},
+        hashIndexType.constraintType == IndexConstraintType::PRIMARY,
+        hashIndexType.definitionType == IndexDefinitionType::BUILTIN};
+    indexes.push_back(IndexHolder{PrimaryKeyIndex::createNewIndex(indexInfo,
+        storageManager->isInMemory(), *mm, pageAllocator, shadowFile)});
+    nodeGroups = std::make_unique<NodeGroupCollection>(*mm,
+        LocalNodeTable::getNodeTableColumnTypes(*nodeTableEntry), enableCompression,
+        storageManager->getDataFH() ? ResidencyState::ON_DISK : ResidencyState::IN_MEMORY,
+        &versionRecordHandler);
+}
+
+row_idx_t NodeTable::getNumTotalRows(const Transaction* transaction) {
+    auto numLocalRows = 0u;
+    if (transaction && transaction->getLocalStorage()) {
+        if (const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID)) {
+            numLocalRows = localTable->getNumTotalRows();
+        }
+    }
+    return numLocalRows + nodeGroups->getNumTotalRows();
+}
+
+void NodeTable::initScanState(Transaction* transaction, TableScanState& scanState, bool) const {
+    auto& nodeScanState = scanState.cast<NodeTableScanState>();
+    NodeGroup* nodeGroup = nullptr;
+    switch (nodeScanState.source) {
+    case TableScanSource::COMMITTED: {
+        nodeGroup = nodeGroups->getNodeGroup(nodeScanState.nodeGroupIdx);
+    } break;
+    case TableScanSource::UNCOMMITTED: {
+        const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+        KU_ASSERT(localTable);
+        const auto& localNodeTable = localTable->cast<LocalNodeTable>();
+        nodeGroup = localNodeTable.getNodeGroup(nodeScanState.nodeGroupIdx);
+        KU_ASSERT(nodeGroup);
+    } break;
+    case TableScanSource::NONE: {
+        // DO NOTHING.
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    nodeScanState.initState(transaction, nodeGroup);
+}
+
+void NodeTable::initScanState(Transaction* transaction, TableScanState& scanState,
+    table_id_t tableID, offset_t startOffset) const {
+    if (transaction->isUnCommitted(tableID, startOffset)) {
+        scanState.source = TableScanSource::UNCOMMITTED;
+        scanState.nodeGroupIdx =
+            StorageUtils::getNodeGroupIdx(transaction->getLocalRowIdx(tableID, startOffset));
+    } else {
+        scanState.source = TableScanSource::COMMITTED;
+        scanState.nodeGroupIdx = StorageUtils::getNodeGroupIdx(startOffset);
+    }
+    initScanState(transaction, scanState);
+}
+
+bool NodeTable::scanInternal(Transaction* transaction, TableScanState& scanState) {
+    scanState.resetOutVectors();
+    return scanState.scanNext(transaction);
+}
+
+template<bool lock>
+bool NodeTable::lookup(const Transaction* transaction, const TableScanState& scanState) const {
+    KU_ASSERT(scanState.nodeIDVector->state->getSelVector().getSelSize() == 1);
+    const auto nodeIDPos = scanState.nodeIDVector->state->getSelVector()[0];
+    if (scanState.nodeIDVector->isNull(nodeIDPos)) {
+        return false;
+    }
+    const auto nodeOffset = scanState.nodeIDVector->readNodeOffset(nodeIDPos);
+    const offset_t rowIdxInGroup =
+        transaction->isUnCommitted(tableID, nodeOffset) ?
+            transaction->getLocalRowIdx(tableID, nodeOffset) -
+                StorageUtils::getStartOffsetOfNodeGroup(scanState.nodeGroupIdx) :
+            nodeOffset - StorageUtils::getStartOffsetOfNodeGroup(scanState.nodeGroupIdx);
+    scanState.rowIdxVector->setValue<row_idx_t>(nodeIDPos, rowIdxInGroup);
+    if constexpr (lock) {
+        return scanState.nodeGroup->lookup(transaction, scanState);
+    } else {
+        return scanState.nodeGroup->lookupNoLock(transaction, scanState);
+    }
+}
+
+template bool NodeTable::lookup<true>(const Transaction* transaction,
+    const TableScanState& scanState) const;
+template bool NodeTable::lookup<false>(const Transaction* transaction,
+    const TableScanState& scanState) const;
+
+template<bool lock>
+bool NodeTable::lookupMultiple(Transaction* transaction, TableScanState& scanState) const {
+    const auto numRowsToRead = scanState.nodeIDVector->state->getSelSize();
+    sel_t numRowsRead = 0;
+    for (auto i = 0u; i < numRowsToRead; i++) {
+        const auto nodeIDPos = scanState.nodeIDVector->state->getSelVector()[i];
+        if (scanState.nodeIDVector->isNull(nodeIDPos)) {
+            continue;
+        }
+        const auto nodeOffset = scanState.nodeIDVector->readNodeOffset(nodeIDPos);
+        const auto isUnCommitted = transaction->isUnCommitted(tableID, nodeOffset);
+        const auto source =
+            isUnCommitted ? TableScanSource::UNCOMMITTED : TableScanSource::COMMITTED;
+        const auto nodeGroupIdx =
+            isUnCommitted ?
+                StorageUtils::getNodeGroupIdx(transaction->getLocalRowIdx(tableID, nodeOffset)) :
+                StorageUtils::getNodeGroupIdx(nodeOffset);
+        const offset_t rowIdxInGroup =
+            isUnCommitted ? transaction->getLocalRowIdx(tableID, nodeOffset) -
+                                StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx) :
+                            nodeOffset - StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx);
+        if (scanState.source == source && scanState.nodeGroupIdx == nodeGroupIdx) {
+            // If the scan state is already initialized for the same source and node group, we can
+            // skip re-initialization.
+        } else {
+            scanState.source = source;
+            scanState.nodeGroupIdx = nodeGroupIdx;
+            initScanState(transaction, scanState);
+        }
+        scanState.rowIdxVector->setValue<row_idx_t>(nodeIDPos, rowIdxInGroup);
+        if constexpr (lock) {
+            numRowsRead += scanState.nodeGroup->lookup(transaction, scanState, i);
+        } else {
+            numRowsRead += scanState.nodeGroup->lookupNoLock(transaction, scanState, i);
+        }
+    }
+    return numRowsRead == numRowsToRead;
+}
+
+template bool NodeTable::lookupMultiple<true>(Transaction* transaction,
+    TableScanState& scanState) const;
+template bool NodeTable::lookupMultiple<false>(Transaction* transaction,
+    TableScanState& scanState) const;
+
+offset_t NodeTable::validateUniquenessConstraint(const Transaction* transaction,
+    const std::vector<ValueVector*>& propertyVectors) const {
+    const auto pkVector = propertyVectors[pkColumnID];
+    KU_ASSERT(pkVector->state->getSelVector().getSelSize() == 1);
+    const auto pkVectorPos = pkVector->state->getSelVector()[0];
+    if (offset_t offset = INVALID_OFFSET;
+        getPKIndex()->lookup(transaction, propertyVectors[pkColumnID], pkVectorPos, offset,
+            [&](offset_t offset_) { return isVisible(transaction, offset_); })) {
+        return offset;
+    }
+    if (const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID)) {
+        return localTable->cast<LocalNodeTable>().validateUniquenessConstraint(transaction,
+            *pkVector);
+    }
+    return INVALID_OFFSET;
+}
+
+void NodeTable::validatePkNotExists(const Transaction* transaction, ValueVector* pkVector) const {
+    offset_t dummyOffset = INVALID_OFFSET;
+    auto& selVector = pkVector->state->getSelVector();
+    KU_ASSERT(selVector.getSelSize() == 1);
+    if (pkVector->isNull(selVector[0])) {
+        throw RuntimeException(ExceptionMessage::nullPKException());
+    }
+    if (getPKIndex()->lookup(transaction, pkVector, selVector[0], dummyOffset,
+            [&](offset_t offset) { return isVisible(transaction, offset); })) {
+        throw RuntimeException(
+            ExceptionMessage::duplicatePKException(pkVector->getAsValue(selVector[0])->toString()));
+    }
+}
+
+void NodeTable::initInsertState(main::ClientContext* context, TableInsertState& insertState) {
+    auto& nodeInsertState = insertState.cast<NodeTableInsertState>();
+    nodeInsertState.indexInsertStates.resize(indexes.size());
+    for (auto i = 0u; i < indexes.size(); i++) {
+        auto& indexHolder = indexes[i];
+        const auto index = indexHolder.getIndex();
+        nodeInsertState.indexInsertStates[i] =
+            index->initInsertState(context, [&](offset_t offset) {
+                return isVisible(transaction::Transaction::Get(*context), offset);
+            });
+    }
+}
+
+void NodeTable::insert(Transaction* transaction, TableInsertState& insertState) {
+    const auto& nodeInsertState = insertState.cast<NodeTableInsertState>();
+    auto& nodeIDSelVector = nodeInsertState.nodeIDVector.state->getSelVector();
+    KU_ASSERT(nodeInsertState.propertyVectors[0]->state->getSelVector().getSelSize() == 1);
+    KU_ASSERT(nodeIDSelVector.getSelSize() == 1);
+    if (nodeInsertState.nodeIDVector.isNull(nodeIDSelVector[0])) {
+        return;
+    }
+    const auto localTable = transaction->getLocalStorage()->getOrCreateLocalTable(*this);
+    validatePkNotExists(transaction, const_cast<ValueVector*>(&nodeInsertState.pkVector));
+    localTable->insert(transaction, insertState);
+    for (auto i = 0u; i < indexes.size(); i++) {
+        auto index = indexes[i].getIndex();
+        std::vector<ValueVector*> indexedPropertyVectors;
+        for (const auto columnID : index->getIndexInfo().columnIDs) {
+            indexedPropertyVectors.push_back(insertState.propertyVectors[columnID]);
+        }
+        index->insert(transaction, nodeInsertState.nodeIDVector, indexedPropertyVectors,
+            *nodeInsertState.indexInsertStates[i]);
+    }
+    if (insertState.logToWAL && transaction->shouldLogToWAL()) {
+        KU_ASSERT(transaction->isWriteTransaction());
+        auto& wal = transaction->getLocalWAL();
+        wal.logTableInsertion(tableID, TableType::NODE,
+            nodeInsertState.nodeIDVector.state->getSelVector().getSelSize(),
+            insertState.propertyVectors);
+    }
+    hasChanges = true;
+}
+
+void NodeTable::initUpdateState(main::ClientContext* context, TableUpdateState& updateState) const {
+    auto& nodeUpdateState = updateState.cast<NodeTableUpdateState>();
+    nodeUpdateState.indexUpdateState.resize(indexes.size());
+    for (auto i = 0u; i < indexes.size(); i++) {
+        auto& indexHolder = indexes[i];
+        auto index = indexHolder.getIndex();
+        if (index->isPrimary() || !index->isBuiltOnColumn(nodeUpdateState.columnID)) {
+            nodeUpdateState.indexUpdateState[i] = nullptr;
+            continue;
+        }
+        nodeUpdateState.indexUpdateState[i] =
+            index->initUpdateState(context, nodeUpdateState.columnID, [&](offset_t offset) {
+                return isVisible(transaction::Transaction::Get(*context), offset);
+            });
+    }
+}
+
+void NodeTable::update(Transaction* transaction, TableUpdateState& updateState) {
+    // NOTE: We assume all inputs are flattened now. This is to simplify the implementation.
+    // We should optimize this to take unflattened input later.
+    auto& nodeUpdateState = updateState.constCast<NodeTableUpdateState>();
+    KU_ASSERT(nodeUpdateState.nodeIDVector.state->getSelVector().getSelSize() == 1 &&
+              nodeUpdateState.propertyVector.state->getSelVector().getSelSize() == 1);
+    const auto pos = nodeUpdateState.nodeIDVector.state->getSelVector()[0];
+    if (nodeUpdateState.nodeIDVector.isNull(pos)) {
+        return;
+    }
+    const auto pkIndex = getPKIndex();
+    if (nodeUpdateState.columnID == pkColumnID && pkIndex) {
+        throw RuntimeException("Cannot update pk.");
+    }
+    const auto nodeOffset = nodeUpdateState.nodeIDVector.readNodeOffset(pos);
+    for (auto i = 0u; i < indexes.size(); i++) {
+        auto index = indexes[i].getIndex();
+        if (!nodeUpdateState.needToUpdateIndex(i)) {
+            continue;
+        }
+        index->update(transaction, nodeUpdateState.nodeIDVector, nodeUpdateState.propertyVector,
+            *nodeUpdateState.indexUpdateState[i]);
+    }
+    if (transaction->isUnCommitted(tableID, nodeOffset)) {
+        const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+        KU_ASSERT(localTable);
+        localTable->update(&DUMMY_TRANSACTION, updateState);
+    } else {
+        const auto nodeGroupIdx = StorageUtils::getNodeGroupIdx(nodeOffset);
+        const auto rowIdxInGroup =
+            nodeOffset - StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx);
+        nodeGroups->getNodeGroup(nodeGroupIdx)
+            ->update(transaction, rowIdxInGroup, nodeUpdateState.columnID,
+                nodeUpdateState.propertyVector);
+    }
+    if (updateState.logToWAL && transaction->shouldLogToWAL()) {
+        KU_ASSERT(transaction->isWriteTransaction());
+        auto& wal = transaction->getLocalWAL();
+        wal.logNodeUpdate(tableID, nodeUpdateState.columnID, nodeOffset,
+            &nodeUpdateState.propertyVector);
+    }
+    hasChanges = true;
+}
+
+bool NodeTable::delete_(Transaction* transaction, TableDeleteState& deleteState) {
+    const auto& nodeDeleteState = ku_dynamic_cast<NodeTableDeleteState&>(deleteState);
+    KU_ASSERT(nodeDeleteState.nodeIDVector.state->getSelVector().getSelSize() == 1);
+    const auto pos = nodeDeleteState.nodeIDVector.state->getSelVector()[0];
+    if (nodeDeleteState.nodeIDVector.isNull(pos)) {
+        return false;
+    }
+    bool isDeleted = false;
+    const auto nodeOffset = nodeDeleteState.nodeIDVector.readNodeOffset(pos);
+    for (auto& index : indexes) {
+        auto indexDeleteState = index.getIndex()->initDeleteState(transaction, memoryManager,
+            getVisibleFunc(transaction));
+        index.getIndex()->delete_(transaction, nodeDeleteState.nodeIDVector, *indexDeleteState);
+    }
+
+    if (transaction->isUnCommitted(tableID, nodeOffset)) {
+        const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+        isDeleted = localTable->delete_(&DUMMY_TRANSACTION, deleteState);
+    } else {
+        const auto nodeGroupIdx = StorageUtils::getNodeGroupIdx(nodeOffset);
+        const auto rowIdxInGroup =
+            nodeOffset - StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx);
+        isDeleted = nodeGroups->getNodeGroup(nodeGroupIdx)->delete_(transaction, rowIdxInGroup);
+        if (transaction->shouldAppendToUndoBuffer()) {
+            transaction->pushDeleteInfo(nodeGroupIdx, rowIdxInGroup, 1, &versionRecordHandler);
+        }
+    }
+    if (isDeleted) {
+        hasChanges = true;
+        if (deleteState.logToWAL && transaction->shouldLogToWAL()) {
+            KU_ASSERT(transaction->isWriteTransaction());
+            auto& wal = transaction->getLocalWAL();
+            wal.logNodeDeletion(tableID, nodeOffset, &nodeDeleteState.pkVector);
+        }
+    }
+    return isDeleted;
+}
+
+void NodeTable::addColumn(Transaction* transaction, TableAddColumnState& addColumnState,
+    PageAllocator& pageAllocator) {
+    auto& definition = addColumnState.propertyDefinition;
+    columns.push_back(ColumnFactory::createColumn(definition.getName(), definition.getType().copy(),
+        pageAllocator.getDataFH(), memoryManager, shadowFile, enableCompression));
+    LocalTable* localTable = nullptr;
+    if (transaction->getLocalStorage()) {
+        localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+    }
+    if (localTable) {
+        localTable->addColumn(addColumnState);
+    }
+    nodeGroups->addColumn(addColumnState, &pageAllocator);
+    hasChanges = true;
+}
+
+std::pair<offset_t, offset_t> NodeTable::appendToLastNodeGroup(Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, InMemChunkedNodeGroup& chunkedGroup,
+    PageAllocator& pageAllocator) {
+    hasChanges = true;
+    return nodeGroups->appendToLastNodeGroupAndFlushWhenFull(transaction, columnIDs, chunkedGroup,
+        pageAllocator);
+}
+
+DataChunk NodeTable::constructDataChunkForColumns(const std::vector<column_id_t>& columnIDs) const {
+    std::vector<LogicalType> types;
+    for (const auto& columnID : columnIDs) {
+        KU_ASSERT(columnID < columns.size());
+        types.push_back(columns[columnID]->getDataType().copy());
+    }
+    return constructDataChunk(memoryManager, std::move(types));
+}
+
+void NodeTable::commit(main::ClientContext* context, TableCatalogEntry* tableEntry,
+    LocalTable* localTable) {
+    const auto startNodeOffset = nodeGroups->getNumTotalRows();
+    auto& localNodeTable = localTable->cast<LocalNodeTable>();
+
+    std::vector<column_id_t> columnIDsToCommit;
+    for (auto& property : tableEntry->getProperties()) {
+        auto columnID = tableEntry->getColumnID(property.getName());
+        columnIDsToCommit.push_back(columnID);
+    }
+
+    auto transaction = transaction::Transaction::Get(*context);
+    // 1. Append all tuples from local storage to nodeGroups regardless of deleted or not.
+    // Note: We cannot simply remove all deleted tuples in local node table, as they may have
+    // connected local rels. Directly removing them will cause shift of committed node offset,
+    // leading to an inconsistent result with connected rels.
+    nodeGroups->append(transaction, columnIDsToCommit, localNodeTable.getNodeGroups());
+    // 2. Set deleted flag for tuples that are deleted in local storage.
+    row_idx_t numLocalRows = 0u;
+    for (auto localNodeGroupIdx = 0u; localNodeGroupIdx < localNodeTable.getNumNodeGroups();
+         localNodeGroupIdx++) {
+        const auto localNodeGroup = localNodeTable.getNodeGroup(localNodeGroupIdx);
+        if (localNodeGroup->hasDeletions(transaction)) {
+            // TODO(Guodong): Assume local storage is small here. Should optimize the loop away by
+            // grabbing a set of deleted rows.
+            for (auto row = 0u; row < localNodeGroup->getNumRows(); row++) {
+                if (localNodeGroup->isDeleted(transaction, row)) {
+                    const auto nodeOffset = startNodeOffset + numLocalRows + row;
+                    const auto nodeGroupIdx = StorageUtils::getNodeGroupIdx(nodeOffset);
+                    const auto rowIdxInGroup =
+                        nodeOffset - StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx);
+                    [[maybe_unused]] const bool isDeleted =
+                        nodeGroups->getNodeGroup(nodeGroupIdx)->delete_(transaction, rowIdxInGroup);
+                    KU_ASSERT(isDeleted);
+                    if (transaction->shouldAppendToUndoBuffer()) {
+                        transaction->pushDeleteInfo(nodeGroupIdx, rowIdxInGroup, 1,
+                            &versionRecordHandler);
+                    }
+                }
+            }
+        }
+        numLocalRows += localNodeGroup->getNumRows();
+    }
+
+    // 3. Scan index columns for newly inserted tuples.
+    for (auto& index : indexes) {
+        if (!index.needCommitInsert()) {
+            continue;
+        }
+        if (!index.isLoaded()) {
+            throw RuntimeException(
+                "Cannot commit index insertions for index " + index.getName() +
+                ", because it is not loaded. Please load the extension for the index first.");
+        }
+        UncommittedIndexInserter indexInserter{startNodeOffset, this, index.getIndex(),
+            getVisibleFunc(transaction)};
+        // We need to scan from local storage here because some tuples in local node groups might
+        // have been deleted.
+        scanIndexColumns(context, indexInserter, localNodeTable.getNodeGroups());
+    }
+
+    // 4. Clear local table.
+    localTable->clear(*MemoryManager::Get(*context));
+}
+
+visible_func NodeTable::getVisibleFunc(const Transaction* transaction) const {
+    return
+        [this, transaction](offset_t offset_) -> bool { return isVisible(transaction, offset_); };
+}
+
+bool NodeTable::checkpoint(main::ClientContext* context, TableCatalogEntry* tableEntry,
+    PageAllocator& pageAllocator) {
+    const bool ret = hasChanges;
+    if (hasChanges) {
+        // Deleted columns are vacuumed and not checkpointed.
+        std::vector<std::unique_ptr<Column>> checkpointColumns;
+        std::vector<column_id_t> columnIDs;
+        for (auto& property : tableEntry->getProperties()) {
+            auto columnID = tableEntry->getColumnID(property.getName());
+            checkpointColumns.push_back(std::move(columns[columnID]));
+            columnIDs.push_back(columnID);
+        }
+        columns = std::move(checkpointColumns);
+
+        std::vector<Column*> checkpointColumnPtrs;
+        for (const auto& column : columns) {
+            checkpointColumnPtrs.push_back(column.get());
+        }
+
+        NodeGroupCheckpointState state{columnIDs, std::move(checkpointColumnPtrs), pageAllocator,
+            memoryManager};
+        nodeGroups->checkpoint(*memoryManager, state);
+        for (auto& index : indexes) {
+            index.checkpoint(context, pageAllocator);
+        }
+        tableEntry->vacuumColumnIDs(0 /*nextColumnID*/);
+        hasChanges = false;
+    }
+    return ret;
+}
+
+void NodeTable::rollbackPKIndexInsert(main::ClientContext* context, row_idx_t startRow,
+    row_idx_t numRows_, node_group_idx_t nodeGroupIdx_) {
+    const row_idx_t startNodeOffset =
+        startRow + StorageUtils::getStartOffsetOfNodeGroup(nodeGroupIdx_);
+
+    RollbackPKDeleter pkDeleter{startNodeOffset, numRows_, this, getPKIndex()};
+    scanIndexColumns(context, pkDeleter, *nodeGroups);
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void NodeTable::rollbackGroupCollectionInsert(row_idx_t numRows_) {
+    nodeGroups->rollbackInsert(numRows_);
+}
+
+void NodeTable::rollbackCheckpoint() {
+    for (auto& index : indexes) {
+        index.rollbackCheckpoint();
+    }
+}
+
+void NodeTable::reclaimStorage(PageAllocator& pageAllocator) const {
+    nodeGroups->reclaimStorage(pageAllocator);
+    getPKIndex()->reclaimStorage(pageAllocator);
+}
+
+TableStats NodeTable::getStats(const Transaction* transaction) const {
+    auto stats = nodeGroups->getStats();
+    if (const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID)) {
+        const auto localStats = localTable->cast<LocalNodeTable>().getStats();
+        stats.merge(localStats);
+    }
+    return stats;
+}
+
+bool NodeTable::isVisible(const Transaction* transaction, offset_t offset) const {
+    auto [nodeGroupIdx, offsetInGroup] = StorageUtils::getNodeGroupIdxAndOffsetInChunk(offset);
+    const auto* nodeGroup = getNodeGroup(nodeGroupIdx);
+    return nodeGroup->isVisible(transaction, offsetInGroup);
+}
+
+bool NodeTable::isVisibleNoLock(const Transaction* transaction, offset_t offset) const {
+    auto [nodeGroupIdx, offsetInGroup] = StorageUtils::getNodeGroupIdxAndOffsetInChunk(offset);
+    if (nodeGroupIdx >= nodeGroups->getNumNodeGroupsNoLock()) {
+        return false;
+    }
+    const auto* nodeGroup = getNodeGroupNoLock(nodeGroupIdx);
+    return nodeGroup->isVisibleNoLock(transaction, offsetInGroup);
+}
+
+bool NodeTable::lookupPK(const Transaction* transaction, ValueVector* keyVector, uint64_t vectorPos,
+    offset_t& result) const {
+    if (transaction->getLocalStorage()) {
+        if (const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+            localTable && localTable->cast<LocalNodeTable>().lookupPK(transaction, keyVector,
+                              vectorPos, result)) {
+            return true;
+        }
+    }
+    return getPKIndex()->lookup(transaction, keyVector, vectorPos, result,
+        [&](offset_t offset) { return isVisibleNoLock(transaction, offset); });
+}
+
+void NodeTable::scanIndexColumns(main::ClientContext* context, IndexScanHelper& scanHelper,
+    const NodeGroupCollection& nodeGroups_) const {
+    auto dataChunk = constructDataChunkForColumns(scanHelper.index->getIndexInfo().columnIDs);
+    const auto scanState =
+        scanHelper.initScanState(transaction::Transaction::Get(*context), dataChunk);
+
+    const auto numNodeGroups = nodeGroups_.getNumNodeGroups();
+    for (node_group_idx_t nodeGroupToScan = 0u; nodeGroupToScan < numNodeGroups;
+         ++nodeGroupToScan) {
+        scanState->nodeGroup = nodeGroups_.getNodeGroupNoLock(nodeGroupToScan);
+
+        // It is possible for the node group to have no chunked groups if we are rolling back due to
+        // an exception that is thrown before any chunked groups could be appended to the node group
+        if (scanState->nodeGroup->getNumChunkedGroups() > 0) {
+            scanState->nodeGroupIdx = nodeGroupToScan;
+            KU_ASSERT(scanState->nodeGroup);
+            scanState->nodeGroup->initializeScanState(transaction::Transaction::Get(*context),
+                *scanState);
+            while (true) {
+                if (const auto scanResult = scanState->nodeGroup->scan(
+                        transaction::Transaction::Get(*context), *scanState);
+                    !scanHelper.processScanOutput(context, scanResult, scanState->outputVectors)) {
+                    break;
+                }
+            }
+        }
+    }
+}
+
+void NodeTable::addIndex(std::unique_ptr<Index> index) {
+    if (getIndex(index->getName()).has_value()) {
+        throw RuntimeException("Index with name " + index->getName() + " already exists.");
+    }
+    indexes.push_back(IndexHolder{std::move(index)});
+    hasChanges = true;
+}
+
+void NodeTable::dropIndex(const std::string& name) {
+    KU_ASSERT(getIndex(name) != nullptr);
+    for (auto it = indexes.begin(); it != indexes.end(); ++it) {
+        if (StringUtils::caseInsensitiveEquals(it->getName(), name)) {
+            KU_ASSERT(it->isLoaded());
+            indexes.erase(it);
+            hasChanges = true;
+            return;
+        }
+    }
+}
+
+std::optional<std::reference_wrapper<IndexHolder>> NodeTable::getIndexHolder(
+    const std::string& name) {
+    for (auto& index : indexes) {
+        if (StringUtils::caseInsensitiveEquals(index.getName(), name)) {
+            return index;
+        }
+    }
+    return std::nullopt;
+}
+
+std::optional<Index*> NodeTable::getIndex(const std::string& name) const {
+    for (auto& index : indexes) {
+        if (StringUtils::caseInsensitiveEquals(index.getName(), name)) {
+            if (index.isLoaded()) {
+                return index.getIndex();
+            }
+            throw RuntimeException(stringFormat(
+                "Index {} is not loaded yet. Please load the index before accessing it.", name));
+        }
+    }
+    return std::nullopt;
+}
+
+void NodeTable::serialize(Serializer& serializer) const {
+    nodeGroups->serialize(serializer);
+    serializer.write<uint64_t>(indexes.size());
+    for (auto i = 0u; i < indexes.size(); ++i) {
+        indexes[i].serialize(serializer);
+    }
+}
+
+void NodeTable::deserialize(main::ClientContext* context, StorageManager* storageManager,
+    Deserializer& deSer) {
+    nodeGroups->deserialize(deSer, *memoryManager);
+    std::vector<IndexInfo> indexInfos;
+    std::vector<length_t> storageInfoBufferSizes;
+    std::vector<std::unique_ptr<uint8_t[]>> storageInfoBuffers;
+    uint64_t numIndexes = 0u;
+    deSer.deserializeValue<uint64_t>(numIndexes);
+    indexInfos.reserve(numIndexes);
+    storageInfoBufferSizes.reserve(numIndexes);
+    storageInfoBuffers.reserve(numIndexes);
+    for (uint64_t i = 0; i < numIndexes; ++i) {
+        IndexInfo indexInfo = IndexInfo::deserialize(deSer);
+        indexInfos.push_back(indexInfo);
+        uint64_t storageInfoSize = 0u;
+        deSer.deserializeValue<uint64_t>(storageInfoSize);
+        storageInfoBufferSizes.push_back(storageInfoSize);
+        auto storageInfoBuffer = std::make_unique<uint8_t[]>(storageInfoSize);
+        deSer.read(storageInfoBuffer.get(), storageInfoSize);
+        storageInfoBuffers.push_back(std::move(storageInfoBuffer));
+    }
+    indexes.clear();
+    indexes.reserve(indexInfos.size());
+    for (auto i = 0u; i < indexInfos.size(); ++i) {
+        indexes.push_back(IndexHolder(indexInfos[i], std::move(storageInfoBuffers[i]),
+            storageInfoBufferSizes[i]));
+        if (indexInfos[i].isBuiltin) {
+            indexes[i].load(context, storageManager);
+        }
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/null_column.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/null_column.cpp
new file mode 100644
index 0000000000..44daf91335
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/null_column.cpp
@@ -0,0 +1,41 @@
+#include "storage/table/null_column.h"
+
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/compression/compression.h"
+#include "storage/storage_utils.h"
+
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+struct NullColumnFunc {
+    static void readValuesFromPageToVector(const uint8_t* frame, PageCursor& pageCursor,
+        ValueVector* resultVector, uint32_t posInVector, uint32_t numValuesToRead,
+        const CompressionMetadata& metadata) {
+        // Read bit-packed null flags from the frame into the result vector
+        // Casting to uint64_t should be safe as long as the page size is a multiple of 8 bytes.
+        // Otherwise, it could read off the end of the page.
+        if (metadata.isConstant()) {
+            bool value = false;
+            ConstantCompression::decompressValues(reinterpret_cast<uint8_t*>(&value), 0 /*offset*/,
+                1 /*numValues*/, PhysicalTypeID::BOOL, 1 /*numBytesPerValue*/, metadata);
+            resultVector->setNullRange(posInVector, numValuesToRead, value);
+        } else {
+            resultVector->setNullFromBits(reinterpret_cast<const uint64_t*>(frame),
+                pageCursor.elemPosInPage, posInVector, numValuesToRead);
+        }
+    }
+};
+
+NullColumn::NullColumn(const std::string& name, FileHandle* dataFH, MemoryManager* mm,
+    ShadowFile* shadowFile, bool enableCompression)
+    : Column{name, LogicalType::BOOL(), dataFH, mm, shadowFile, enableCompression,
+          false /*requireNullColumn*/} {
+    readToVectorFunc = NullColumnFunc::readValuesFromPageToVector;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/rel_table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/rel_table.cpp
new file mode 100644
index 0000000000..49820f9efc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/rel_table.cpp
@@ -0,0 +1,548 @@
+#include "storage/table/rel_table.h"
+
+#include <algorithm>
+
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/exception/message.h"
+#include "common/exception/runtime.h"
+#include "common/types/types.h"
+#include "main/client_context.h"
+#include "storage/local_storage/local_rel_table.h"
+#include "storage/local_storage/local_storage.h"
+#include "storage/local_storage/local_table.h"
+#include "storage/storage_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column_chunk.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/rel_table_data.h"
+#include "storage/wal/local_wal.h"
+#include "transaction/transaction.h"
+#include <ranges>
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::transaction;
+using namespace lbug::evaluator;
+
+namespace lbug {
+namespace storage {
+
+void RelTableScanState::setToTable(const Transaction* transaction, Table* table_,
+    std::vector<column_id_t> columnIDs_, std::vector<ColumnPredicateSet> columnPredicateSets_,
+    RelDataDirection direction_) {
+    TableScanState::setToTable(transaction, table_, std::move(columnIDs_),
+        std::move(columnPredicateSets_));
+    columns.resize(columnIDs.size());
+    direction = direction_;
+    for (size_t i = 0; i < columnIDs.size(); ++i) {
+        auto columnID = columnIDs[i];
+        if (columnID == INVALID_COLUMN_ID || columnID == ROW_IDX_COLUMN_ID) {
+            columns[i] = nullptr;
+        } else {
+            columns[i] = table->cast<RelTable>().getColumn(columnID, direction);
+        }
+    }
+    csrOffsetColumn = table->cast<RelTable>().getCSROffsetColumn(direction);
+    csrLengthColumn = table->cast<RelTable>().getCSRLengthColumn(direction);
+    nodeGroupIdx = INVALID_NODE_GROUP_IDX;
+    if (const auto localRelTable =
+            transaction->getLocalStorage()->getLocalTable(table->getTableID())) {
+        auto localTableColumnIDs = LocalRelTable::rewriteLocalColumnIDs(direction, columnIDs);
+        localTableScanState = std::make_unique<LocalRelTableScanState>(*this,
+            localRelTable->ptrCast<LocalRelTable>(), localTableColumnIDs);
+    }
+}
+
+void RelTableScanState::initState(Transaction* transaction, NodeGroup* nodeGroup,
+    bool resetCachedBoundNodeIDs) {
+    this->nodeGroup = nodeGroup;
+    if (resetCachedBoundNodeIDs) {
+        initCachedBoundNodeIDSelVector();
+    }
+    if (this->nodeGroup) {
+        initStateForCommitted(transaction);
+    } else if (hasUnCommittedData()) {
+        initStateForUncommitted();
+    } else {
+        source = TableScanSource::NONE;
+    }
+}
+
+void RelTableScanState::initCachedBoundNodeIDSelVector() {
+    if (nodeIDVector->state->getSelVector().isUnfiltered()) {
+        cachedBoundNodeSelVector.setToUnfiltered();
+    } else {
+        cachedBoundNodeSelVector.setToFiltered();
+        memcpy(cachedBoundNodeSelVector.getMutableBuffer().data(),
+            nodeIDVector->state->getSelVectorUnsafe().getMutableBuffer().data(),
+            nodeIDVector->state->getSelVector().getSelSize() * sizeof(sel_t));
+    }
+    cachedBoundNodeSelVector.setSelSize(nodeIDVector->state->getSelVector().getSelSize());
+}
+
+bool RelTableScanState::hasUnCommittedData() const {
+    return localTableScanState && localTableScanState->localRelTable;
+}
+
+void RelTableScanState::initStateForCommitted(const Transaction* transaction) {
+    source = TableScanSource::COMMITTED;
+    currBoundNodeIdx = 0;
+    nodeGroup->initializeScanState(transaction, *this);
+}
+
+void RelTableScanState::initStateForUncommitted() {
+    KU_ASSERT(localTableScanState);
+    source = TableScanSource::UNCOMMITTED;
+    currBoundNodeIdx = 0;
+    localTableScanState->localRelTable->initializeScan(*this);
+}
+
+bool RelTableScanState::scanNext(Transaction* transaction) {
+    while (true) {
+        switch (source) {
+        case TableScanSource::COMMITTED: {
+            const auto scanResult = nodeGroup->scan(transaction, *this);
+            if (scanResult == NODE_GROUP_SCAN_EMPTY_RESULT) {
+                if (hasUnCommittedData()) {
+                    initStateForUncommitted();
+                } else {
+                    source = TableScanSource::NONE;
+                }
+                continue;
+            }
+            return true;
+        }
+        case TableScanSource::UNCOMMITTED: {
+            KU_ASSERT(localTableScanState && localTableScanState->localRelTable);
+            return localTableScanState->localRelTable->scan(transaction, *this);
+        }
+        case TableScanSource::NONE: {
+            return false;
+        }
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+    }
+}
+
+void RelTableScanState::setNodeIDVectorToFlat(sel_t selPos) const {
+    nodeIDVector->state->setToFlat();
+    nodeIDVector->state->getSelVectorUnsafe().setToFiltered(1);
+    nodeIDVector->state->getSelVectorUnsafe()[0] = selPos;
+}
+
+RelTable::RelTable(RelGroupCatalogEntry* relGroupEntry, table_id_t fromTableID,
+    table_id_t toTableID, const StorageManager* storageManager, MemoryManager* memoryManager)
+    : Table{relGroupEntry, storageManager, memoryManager}, fromNodeTableID{fromTableID},
+      toNodeTableID{toTableID}, nextRelOffset{0} {
+    auto relEntryInfo = relGroupEntry->getRelEntryInfo(fromNodeTableID, toNodeTableID);
+    tableID = relEntryInfo->oid;
+    relGroupID = relGroupEntry->getTableID();
+    for (auto direction : relGroupEntry->getRelDataDirections()) {
+        auto nbrTableID = RelDirectionUtils::getNbrTableID(direction, fromTableID, toTableID);
+        directedRelData.emplace_back(
+            std::make_unique<RelTableData>(storageManager->getDataFH(), memoryManager, shadowFile,
+                *relGroupEntry, *this, direction, nbrTableID, enableCompression));
+    }
+}
+
+void RelTable::initScanState(Transaction* transaction, TableScanState& scanState,
+    bool resetCachedBoundNodeSelVec) const {
+    auto& relScanState = scanState.cast<RelTableScanState>();
+    // Note there we directly read node at pos 0 here regardless the selVector is filtered or not.
+    // This is because we're assuming the nodeIDVector is always a sequence here.
+    const auto boundNodeID = relScanState.nodeIDVector->getValue<nodeID_t>(
+        relScanState.nodeIDVector->state->getSelVector()[0]);
+    NodeGroup* nodeGroup = nullptr;
+    // Check if the node group idx is same as previous scan.
+    const auto nodeGroupIdx = StorageUtils::getNodeGroupIdx(boundNodeID.offset);
+    if (relScanState.nodeGroupIdx != nodeGroupIdx) {
+        // We need to re-initialize the node group scan state.
+        nodeGroup = getDirectedTableData(relScanState.direction)->getNodeGroup(nodeGroupIdx);
+    } else {
+        nodeGroup = relScanState.nodeGroup;
+    }
+    scanState.initState(transaction, nodeGroup, resetCachedBoundNodeSelVec);
+}
+
+bool RelTable::scanInternal(Transaction* transaction, TableScanState& scanState) {
+    return scanState.scanNext(transaction);
+}
+
+static void throwRelMultiplicityConstraintError(const std::string& tableName, offset_t nodeOffset,
+    RelDataDirection direction) {
+    throw RuntimeException(ExceptionMessage::violateRelMultiplicityConstraint(tableName,
+        std::to_string(nodeOffset), RelDirectionUtils::relDirectionToString(direction)));
+}
+
+void RelTable::checkRelMultiplicityConstraint(Transaction* transaction,
+    const TableInsertState& state) const {
+    const auto& insertState = state.constCast<RelTableInsertState>();
+    KU_ASSERT(insertState.srcNodeIDVector.state->getSelVector().getSelSize() == 1 &&
+              insertState.dstNodeIDVector.state->getSelVector().getSelSize() == 1);
+
+    for (auto& relData : directedRelData) {
+        if (relData->getMultiplicity() == RelMultiplicity::ONE) {
+            throwIfNodeHasRels(transaction, relData->getDirection(),
+                &insertState.getBoundNodeIDVector(relData->getDirection()),
+                throwRelMultiplicityConstraintError);
+        }
+    }
+}
+
+void RelTable::insert(Transaction* transaction, TableInsertState& insertState) {
+    checkRelMultiplicityConstraint(transaction, insertState);
+
+    KU_ASSERT(transaction->getLocalStorage());
+    const auto localTable = transaction->getLocalStorage()->getOrCreateLocalTable(*this);
+    localTable->insert(transaction, insertState);
+    if (insertState.logToWAL && transaction->shouldLogToWAL()) {
+        KU_ASSERT(transaction->isWriteTransaction());
+        const auto& relInsertState = insertState.cast<RelTableInsertState>();
+        std::vector<ValueVector*> vectorsToLog;
+        vectorsToLog.push_back(&relInsertState.srcNodeIDVector);
+        vectorsToLog.push_back(&relInsertState.dstNodeIDVector);
+        vectorsToLog.insert(vectorsToLog.end(), relInsertState.propertyVectors.begin(),
+            relInsertState.propertyVectors.end());
+        KU_ASSERT(relInsertState.srcNodeIDVector.state->getSelVector().getSelSize() == 1);
+        auto& wal = transaction->getLocalWAL();
+        wal.logTableInsertion(tableID, TableType::REL,
+            relInsertState.srcNodeIDVector.state->getSelVector().getSelSize(), vectorsToLog);
+    }
+    hasChanges = true;
+}
+
+void RelTable::update(Transaction* transaction, TableUpdateState& updateState) {
+    const auto& relUpdateState = updateState.cast<RelTableUpdateState>();
+    KU_ASSERT(relUpdateState.relIDVector.state->getSelVector().getSelSize() == 1);
+    const auto relIDPos = relUpdateState.relIDVector.state->getSelVector()[0];
+    if (const auto relOffset = relUpdateState.relIDVector.readNodeOffset(relIDPos);
+        relOffset >= StorageConstants::MAX_NUM_ROWS_IN_TABLE) {
+        const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+        KU_ASSERT(localTable);
+        localTable->update(&DUMMY_TRANSACTION, updateState);
+    } else {
+        for (auto& relData : directedRelData) {
+            relData->update(transaction,
+                relUpdateState.getBoundNodeIDVector(relData->getDirection()),
+                relUpdateState.relIDVector, relUpdateState.columnID, relUpdateState.propertyVector);
+        }
+    }
+    if (updateState.logToWAL && transaction->shouldLogToWAL()) {
+        KU_ASSERT(transaction->isWriteTransaction());
+        auto& wal = transaction->getLocalWAL();
+        wal.logRelUpdate(tableID, relUpdateState.columnID, &relUpdateState.srcNodeIDVector,
+            &relUpdateState.dstNodeIDVector, &relUpdateState.relIDVector,
+            &relUpdateState.propertyVector);
+    }
+    hasChanges = true;
+}
+
+bool RelTable::delete_(Transaction* transaction, TableDeleteState& deleteState) {
+    const auto& relDeleteState = deleteState.cast<RelTableDeleteState>();
+    KU_ASSERT(relDeleteState.relIDVector.state->getSelVector().getSelSize() == 1);
+    const auto relIDPos = relDeleteState.relIDVector.state->getSelVector()[0];
+    bool isDeleted = false;
+    if (const auto relOffset = relDeleteState.relIDVector.readNodeOffset(relIDPos);
+        relOffset >= StorageConstants::MAX_NUM_ROWS_IN_TABLE) {
+        const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+        KU_ASSERT(localTable);
+        isDeleted = localTable->delete_(transaction, deleteState);
+    } else {
+        for (auto& relData : directedRelData) {
+            isDeleted = relData->delete_(transaction,
+                relDeleteState.getBoundNodeIDVector(relData->getDirection()),
+                relDeleteState.relIDVector);
+            if (!isDeleted) {
+                break;
+            }
+        }
+    }
+    if (isDeleted) {
+        hasChanges = true;
+        if (deleteState.logToWAL && transaction->shouldLogToWAL()) {
+            KU_ASSERT(transaction->isWriteTransaction());
+            auto& wal = transaction->getLocalWAL();
+            wal.logRelDelete(tableID, &relDeleteState.srcNodeIDVector,
+                &relDeleteState.dstNodeIDVector, &relDeleteState.relIDVector);
+        }
+    }
+    return isDeleted;
+}
+
+void RelTable::detachDelete(Transaction* transaction, RelTableDeleteState* deleteState) {
+    auto direction = deleteState->detachDeleteDirection;
+    if (std::ranges::count(getStorageDirections(), direction) == 0) {
+        throw RuntimeException(
+            stringFormat("Cannot delete edges of direction {} from table {} as they do not exist.",
+                RelDirectionUtils::relDirectionToString(direction), tableName));
+    }
+    KU_ASSERT(deleteState->srcNodeIDVector.state->getSelVector().getSelSize() == 1);
+    const auto tableData = getDirectedTableData(direction);
+    const auto reverseTableData =
+        directedRelData.size() == NUM_REL_DIRECTIONS ?
+            getDirectedTableData(RelDirectionUtils::getOppositeDirection(direction)) :
+            nullptr;
+    auto relReadState =
+        std::make_unique<RelTableScanState>(*memoryManager, &deleteState->srcNodeIDVector,
+            std::vector{&deleteState->dstNodeIDVector, &deleteState->relIDVector},
+            deleteState->dstNodeIDVector.state, true /*randomLookup*/);
+    relReadState->setToTable(transaction, this, {NBR_ID_COLUMN_ID, REL_ID_COLUMN_ID}, {},
+        direction);
+    initScanState(transaction, *relReadState);
+    detachDeleteForCSRRels(transaction, tableData, reverseTableData, relReadState.get(),
+        deleteState);
+    if (deleteState->logToWAL && transaction->shouldLogToWAL()) {
+        KU_ASSERT(transaction->isWriteTransaction());
+        auto& wal = transaction->getLocalWAL();
+        wal.logRelDetachDelete(tableID, direction, &deleteState->srcNodeIDVector);
+    }
+    hasChanges = true;
+}
+
+std::vector<RelDataDirection> RelTable::getStorageDirections() const {
+    std::vector<RelDataDirection> ret;
+    for (const auto& relData : directedRelData) {
+        ret.push_back(relData->getDirection());
+    }
+    return ret;
+}
+
+bool RelTable::checkIfNodeHasRels(Transaction* transaction, RelDataDirection direction,
+    ValueVector* srcNodeIDVector) const {
+    bool hasRels = false;
+    const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+    if (localTable) {
+        hasRels = localTable->cast<LocalRelTable>().checkIfNodeHasRels(srcNodeIDVector, direction);
+    }
+    hasRels = hasRels ||
+              getDirectedTableData(direction)->checkIfNodeHasRels(transaction, srcNodeIDVector);
+    return hasRels;
+}
+
+void RelTable::throwIfNodeHasRels(Transaction* transaction, RelDataDirection direction,
+    ValueVector* srcNodeIDVector, const rel_multiplicity_constraint_throw_func_t& throwFunc) const {
+    const auto nodeIDPos = srcNodeIDVector->state->getSelVector()[0];
+    const auto nodeOffset = srcNodeIDVector->getValue<nodeID_t>(nodeIDPos).offset;
+    if (checkIfNodeHasRels(transaction, direction, srcNodeIDVector)) {
+        throwFunc(tableName, nodeOffset, direction);
+    }
+}
+
+void RelTable::detachDeleteForCSRRels(Transaction* transaction, RelTableData* tableData,
+    RelTableData* reverseTableData, RelTableScanState* relDataReadState,
+    RelTableDeleteState* deleteState) {
+    const auto localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+    const auto tempState = deleteState->dstNodeIDVector.state.get();
+    while (scan(transaction, *relDataReadState)) {
+        const auto numRelsScanned = tempState->getSelVector().getSelSize();
+
+        // rel table data delete_() expects the input to be flat
+        // so we manually flatten the scanned rels here
+        // also if the scanned state is unfiltered we need to copy over the unfiltered values to the
+        // filtered buffer
+        // TODO(Royi/Guodong) remove this once delete_() supports unflat vectors
+        if (tempState->getSelVector().isUnfiltered()) {
+            tempState->getSelVectorUnsafe().setRange(0, numRelsScanned);
+        }
+        tempState->getSelVectorUnsafe().setToFiltered(1);
+
+        for (auto i = 0u; i < numRelsScanned; i++) {
+            tempState->getSelVectorUnsafe()[0] = deleteState->relIDVector.state->getSelVector()[i];
+
+            const auto relIDPos = deleteState->relIDVector.state->getSelVector()[0];
+            const auto relOffset = deleteState->relIDVector.readNodeOffset(relIDPos);
+            if (relOffset >= StorageConstants::MAX_NUM_ROWS_IN_TABLE) {
+                KU_ASSERT(localTable);
+                localTable->delete_(transaction, *deleteState);
+                continue;
+            }
+            [[maybe_unused]] const auto deleted = tableData->delete_(transaction,
+                deleteState->srcNodeIDVector, deleteState->relIDVector);
+            if (reverseTableData) {
+                [[maybe_unused]] const auto reverseDeleted = reverseTableData->delete_(transaction,
+                    deleteState->dstNodeIDVector, deleteState->relIDVector);
+                KU_ASSERT(deleted == reverseDeleted);
+            }
+        }
+        tempState->getSelVectorUnsafe().setToUnfiltered();
+    }
+}
+
+void RelTable::addColumn(Transaction* transaction, TableAddColumnState& addColumnState,
+    PageAllocator& pageAllocator) {
+    LocalTable* localTable = nullptr;
+    if (transaction->getLocalStorage()) {
+        localTable = transaction->getLocalStorage()->getLocalTable(tableID);
+    }
+    if (localTable) {
+        localTable->addColumn(addColumnState);
+    }
+    for (auto& directedRelData : directedRelData) {
+        directedRelData->addColumn(addColumnState, pageAllocator);
+    }
+    hasChanges = true;
+}
+
+RelTableData* RelTable::getDirectedTableData(RelDataDirection direction) const {
+    const auto directionIdx = RelDirectionUtils::relDirectionToKeyIdx(direction);
+    if (directionIdx >= directedRelData.size()) {
+        throw RuntimeException(stringFormat(
+            "Failed to get {} data for rel table \"{}\", please set the storage direction to BOTH",
+            RelDirectionUtils::relDirectionToString(direction), tableName));
+    }
+    KU_ASSERT(directedRelData[directionIdx]->getDirection() == direction);
+    return directedRelData[directionIdx].get();
+}
+
+NodeGroup* RelTable::getOrCreateNodeGroup(const Transaction* transaction,
+    node_group_idx_t nodeGroupIdx, RelDataDirection direction) const {
+    return getDirectedTableData(direction)->getOrCreateNodeGroup(transaction, nodeGroupIdx);
+}
+
+void RelTable::pushInsertInfo(const Transaction* transaction, RelDataDirection direction,
+    const CSRNodeGroup& nodeGroup, row_idx_t numRows_, CSRNodeGroupScanSource source) const {
+    getDirectedTableData(direction)->pushInsertInfo(transaction, nodeGroup, numRows_, source);
+}
+
+void RelTable::commit(main::ClientContext* context, TableCatalogEntry* tableEntry,
+    LocalTable* localTable) {
+    auto& localRelTable = localTable->cast<LocalRelTable>();
+    if (localRelTable.isEmpty()) {
+        localTable->clear(*MemoryManager::Get(*context));
+        return;
+    }
+    // Update relID in local storage.
+    updateRelOffsets(localRelTable);
+    // For both forward and backward directions, re-org local storage into compact CSR node groups.
+    auto& localNodeGroup = localRelTable.getLocalNodeGroup();
+    // Scan from local node group and write to WAL.
+    std::vector<column_id_t> columnIDsToScan;
+    for (auto i = 0u; i < localRelTable.getNumColumns(); i++) {
+        columnIDsToScan.push_back(i);
+    }
+
+    std::vector<column_id_t> columnIDsToCommit;
+    columnIDsToCommit.push_back(0); // NBR column.
+    for (auto& property : tableEntry->getProperties()) {
+        auto columnID = tableEntry->getColumnID(property.getName());
+        columnIDsToCommit.push_back(columnID);
+    }
+    // commit rel table data
+    auto transaction = transaction::Transaction::Get(*context);
+    for (auto& relData : directedRelData) {
+        const auto direction = relData->getDirection();
+        const auto columnToSkip = (direction == RelDataDirection::FWD) ?
+                                      LOCAL_BOUND_NODE_ID_COLUMN_ID :
+                                      LOCAL_NBR_NODE_ID_COLUMN_ID;
+        for (auto& [boundNodeOffset, rowIndices] : localRelTable.getCSRIndex(direction)) {
+            auto [nodeGroupIdx, boundOffsetInGroup] =
+                StorageUtils::getQuotientRemainder(boundNodeOffset, StorageConfig::NODE_GROUP_SIZE);
+            auto& nodeGroup =
+                relData->getOrCreateNodeGroup(transaction, nodeGroupIdx)->cast<CSRNodeGroup>();
+            pushInsertInfo(transaction, direction, nodeGroup, rowIndices.size(),
+                CSRNodeGroupScanSource::COMMITTED_IN_MEMORY);
+            prepareCommitForNodeGroup(transaction, columnIDsToCommit, localNodeGroup, nodeGroup,
+                boundOffsetInGroup, rowIndices, columnToSkip);
+        }
+    }
+
+    localRelTable.clear(*MemoryManager::Get(*context));
+}
+
+void RelTable::reclaimStorage(PageAllocator& pageAllocator) const {
+    for (auto& relData : directedRelData) {
+        relData->reclaimStorage(pageAllocator);
+    }
+}
+
+void RelTable::updateRelOffsets(const LocalRelTable& localRelTable) {
+    auto& localNodeGroup = localRelTable.getLocalNodeGroup();
+    const offset_t maxCommittedOffset = reserveRelOffsets(localNodeGroup.getNumRows());
+    RUNTIME_CHECK(uint64_t totalNumRows = 0);
+    for (auto i = 0u; i < localNodeGroup.getNumChunkedGroups(); i++) {
+        const auto chunkedGroup = localNodeGroup.getChunkedNodeGroup(i);
+        KU_ASSERT(chunkedGroup);
+        auto& internalIDChunk = chunkedGroup->getColumnChunk(LOCAL_REL_ID_COLUMN_ID);
+        RUNTIME_CHECK(totalNumRows += internalIDChunk.getNumValues());
+        for (auto rowIdx = 0u; rowIdx < internalIDChunk.getNumValues(); rowIdx++) {
+            const auto localRelOffset = internalIDChunk.getValue<offset_t>(rowIdx);
+            const auto committedRelOffset = getCommittedOffset(localRelOffset, maxCommittedOffset);
+            internalIDChunk.setValue<offset_t>(committedRelOffset, rowIdx);
+        }
+
+        internalIDChunk.setTableID(tableID);
+    }
+    KU_ASSERT(totalNumRows == localNodeGroup.getNumRows());
+}
+
+offset_t RelTable::getCommittedOffset(offset_t uncommittedOffset, offset_t maxCommittedOffset) {
+    return uncommittedOffset - StorageConstants::MAX_NUM_ROWS_IN_TABLE + maxCommittedOffset;
+}
+
+void RelTable::prepareCommitForNodeGroup(const Transaction* transaction,
+    const std::vector<column_id_t>& columnIDs, const NodeGroup& localNodeGroup,
+    CSRNodeGroup& csrNodeGroup, offset_t boundOffsetInGroup, const row_idx_vec_t& rowIndices,
+    column_id_t skippedColumn) {
+    for (const auto row : rowIndices) {
+        auto [chunkedGroupIdx, rowInChunkedGroup] =
+            StorageUtils::getQuotientRemainder(row, StorageConfig::CHUNKED_NODE_GROUP_CAPACITY);
+        std::vector<const ColumnChunk*> chunks;
+        const auto chunkedGroup = localNodeGroup.getChunkedNodeGroup(chunkedGroupIdx);
+        for (auto i = 0u; i < chunkedGroup->getNumColumns(); i++) {
+            if (i == skippedColumn) {
+                continue;
+            }
+            chunks.push_back(&chunkedGroup->getColumnChunk(i));
+        }
+        csrNodeGroup.append(transaction, columnIDs, boundOffsetInGroup, chunks, rowInChunkedGroup,
+            1 /*numRows*/);
+    }
+}
+
+bool RelTable::checkpoint(main::ClientContext*, TableCatalogEntry* tableEntry,
+    PageAllocator& pageAllocator) {
+    bool ret = hasChanges;
+    if (hasChanges) {
+        // Deleted columns are vacuumed and not checkpointed or serialized.
+        std::vector<column_id_t> columnIDs;
+        columnIDs.push_back(0);
+        for (auto& property : tableEntry->getProperties()) {
+            columnIDs.push_back(tableEntry->getColumnID(property.getName()));
+        }
+        for (auto& directedRelData : directedRelData) {
+            directedRelData->checkpoint(columnIDs, pageAllocator);
+        }
+        hasChanges = false;
+    }
+    return ret;
+}
+
+row_idx_t RelTable::getNumTotalRows(const Transaction* transaction) {
+    auto numLocalRows = 0u;
+    if (auto localTable = transaction->getLocalStorage()->getLocalTable(tableID)) {
+        numLocalRows = localTable->getNumTotalRows();
+    }
+    return numLocalRows + nextRelOffset;
+}
+
+void RelTable::serialize(Serializer& ser) const {
+    ser.writeDebuggingInfo("next_rel_offset");
+    ser.write<offset_t>(nextRelOffset);
+    for (auto& directedRelData : directedRelData) {
+        directedRelData->serialize(ser);
+    }
+}
+
+void RelTable::deserialize(main::ClientContext*, StorageManager*, Deserializer& deSer) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "next_rel_offset");
+    deSer.deserializeValue<offset_t>(nextRelOffset);
+    for (auto i = 0u; i < directedRelData.size(); i++) {
+        directedRelData[i]->deserialize(deSer, *memoryManager);
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/rel_table_data.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/rel_table_data.cpp
new file mode 100644
index 0000000000..7640f6c202
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/rel_table_data.cpp
@@ -0,0 +1,292 @@
+#include "storage/table/rel_table_data.h"
+
+#include "catalog/catalog_entry/rel_group_catalog_entry.h"
+#include "common/enums/rel_direction.h"
+#include "common/types/types.h"
+#include "main/client_context.h"
+#include "storage/storage_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/table/node_group.h"
+#include "storage/table/rel_table.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+PersistentVersionRecordHandler::PersistentVersionRecordHandler(RelTableData* relTableData)
+    : relTableData(relTableData) {}
+
+void PersistentVersionRecordHandler::applyFuncToChunkedGroups(version_record_handler_op_t func,
+    node_group_idx_t nodeGroupIdx, row_idx_t startRow, row_idx_t numRows,
+    transaction_t commitTS) const {
+    if (nodeGroupIdx < relTableData->getNumNodeGroups()) {
+        auto& nodeGroup = relTableData->getNodeGroupNoLock(nodeGroupIdx)->cast<CSRNodeGroup>();
+        if (auto* persistentChunkedGroup = nodeGroup.getPersistentChunkedGroup()) {
+            std::invoke(func, *persistentChunkedGroup, startRow, numRows, commitTS);
+        }
+    }
+}
+
+void PersistentVersionRecordHandler::rollbackInsert(main::ClientContext* context,
+    node_group_idx_t nodeGroupIdx, row_idx_t startRow, row_idx_t numRows) const {
+    VersionRecordHandler::rollbackInsert(context, nodeGroupIdx, startRow, numRows);
+    relTableData->rollbackGroupCollectionInsert(numRows, true);
+}
+
+InMemoryVersionRecordHandler::InMemoryVersionRecordHandler(RelTableData* relTableData)
+    : relTableData(relTableData) {}
+
+void InMemoryVersionRecordHandler::applyFuncToChunkedGroups(version_record_handler_op_t func,
+    node_group_idx_t nodeGroupIdx, row_idx_t startRow, row_idx_t numRows,
+    transaction_t commitTS) const {
+    auto* nodeGroup = relTableData->getNodeGroupNoLock(nodeGroupIdx);
+    nodeGroup->applyFuncToChunkedGroups(func, startRow, numRows, commitTS);
+}
+
+void InMemoryVersionRecordHandler::rollbackInsert(main::ClientContext* context,
+    node_group_idx_t nodeGroupIdx, row_idx_t startRow, row_idx_t numRows) const {
+    VersionRecordHandler::rollbackInsert(context, nodeGroupIdx, startRow, numRows);
+    auto* nodeGroup = relTableData->getNodeGroupNoLock(nodeGroupIdx);
+    const auto numRowsToRollback = std::min(numRows, nodeGroup->getNumRows() - startRow);
+    nodeGroup->rollbackInsert(startRow);
+    relTableData->rollbackGroupCollectionInsert(numRowsToRollback, false);
+}
+
+RelTableData::RelTableData(FileHandle* dataFH, MemoryManager* mm, ShadowFile* shadowFile,
+    const RelGroupCatalogEntry& relGroupEntry, Table& table, RelDataDirection direction,
+    table_id_t nbrTableID, bool enableCompression)
+    : table{table}, mm{mm}, shadowFile{shadowFile}, enableCompression{enableCompression},
+      direction{direction}, multiplicity{relGroupEntry.getMultiplicity(direction)},
+      persistentVersionRecordHandler(this), inMemoryVersionRecordHandler(this) {
+    initCSRHeaderColumns(dataFH);
+    initPropertyColumns(relGroupEntry, nbrTableID, dataFH);
+    // default to using the persistent version record handler
+    // if we want to use the in-memory handler, we will explicitly pass it into
+    // nodeGroups.pushInsertInfo()
+    nodeGroups = std::make_unique<NodeGroupCollection>(*mm, getColumnTypes(), enableCompression,
+        ResidencyState::ON_DISK, &persistentVersionRecordHandler);
+}
+
+void RelTableData::initCSRHeaderColumns(FileHandle* dataFH) {
+    // No NULL values is allowed for the csr length and offset column.
+    auto csrOffsetColumnName = StorageUtils::getColumnName("", StorageUtils::ColumnType::CSR_OFFSET,
+        RelDirectionUtils::relDirectionToString(direction));
+    csrHeaderColumns.offset = std::make_unique<Column>(csrOffsetColumnName, LogicalType::UINT64(),
+        dataFH, mm, shadowFile, enableCompression, false /* requireNullColumn */);
+    auto csrLengthColumnName = StorageUtils::getColumnName("", StorageUtils::ColumnType::CSR_LENGTH,
+        RelDirectionUtils::relDirectionToString(direction));
+    csrHeaderColumns.length = std::make_unique<Column>(csrLengthColumnName, LogicalType::UINT64(),
+        dataFH, mm, shadowFile, enableCompression, false /* requireNullColumn */);
+}
+
+void RelTableData::initPropertyColumns(const RelGroupCatalogEntry& relGroupEntry,
+    table_id_t nbrTableID, FileHandle* dataFH) {
+    const auto maxColumnID = relGroupEntry.getMaxColumnID();
+    columns.resize(maxColumnID + 1);
+    auto nbrIDColName = StorageUtils::getColumnName("NBR_ID", StorageUtils::ColumnType::DEFAULT,
+        RelDirectionUtils::relDirectionToString(direction));
+    auto nbrIDColumn =
+        std::make_unique<InternalIDColumn>(nbrIDColName, dataFH, mm, shadowFile, enableCompression);
+    columns[NBR_ID_COLUMN_ID] = std::move(nbrIDColumn);
+    for (auto& property : relGroupEntry.getProperties()) {
+        const auto columnID = relGroupEntry.getColumnID(property.getName());
+        const auto colName = StorageUtils::getColumnName(property.getName(),
+            StorageUtils::ColumnType::DEFAULT, RelDirectionUtils::relDirectionToString(direction));
+        columns[columnID] = ColumnFactory::createColumn(colName, property.getType().copy(), dataFH,
+            mm, shadowFile, enableCompression);
+    }
+    // Set common tableID for nbrIDColumn and relIDColumn.
+    columns[NBR_ID_COLUMN_ID]->cast<InternalIDColumn>().setCommonTableID(nbrTableID);
+    columns[REL_ID_COLUMN_ID]->cast<InternalIDColumn>().setCommonTableID(table.getTableID());
+}
+
+bool RelTableData::update(Transaction* transaction, ValueVector& boundNodeIDVector,
+    const ValueVector& relIDVector, column_id_t columnID, const ValueVector& dataVector) const {
+    KU_ASSERT(boundNodeIDVector.state->getSelVector().getSelSize() == 1);
+    KU_ASSERT(relIDVector.state->getSelVector().getSelSize() == 1);
+    const auto boundNodePos = boundNodeIDVector.state->getSelVector()[0];
+    const auto relIDPos = relIDVector.state->getSelVector()[0];
+    if (boundNodeIDVector.isNull(boundNodePos) || relIDVector.isNull(relIDPos)) {
+        return false;
+    }
+    const auto [source, rowIdx] = findMatchingRow(transaction, boundNodeIDVector, relIDVector);
+    KU_ASSERT(rowIdx != INVALID_ROW_IDX);
+    const auto boundNodeOffset = boundNodeIDVector.getValue<nodeID_t>(boundNodePos).offset;
+    const auto nodeGroupIdx = StorageUtils::getNodeGroupIdx(boundNodeOffset);
+    auto& csrNodeGroup = getNodeGroup(nodeGroupIdx)->cast<CSRNodeGroup>();
+    csrNodeGroup.update(transaction, source, rowIdx, columnID, dataVector);
+    return true;
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+bool RelTableData::delete_(Transaction* transaction, ValueVector& boundNodeIDVector,
+    const ValueVector& relIDVector) {
+    const auto boundNodePos = boundNodeIDVector.state->getSelVector()[0];
+    const auto relIDPos = relIDVector.state->getSelVector()[0];
+    if (boundNodeIDVector.isNull(boundNodePos) || relIDVector.isNull(relIDPos)) {
+        return false;
+    }
+    const auto [source, rowIdx] = findMatchingRow(transaction, boundNodeIDVector, relIDVector);
+    if (rowIdx == INVALID_ROW_IDX) {
+        return false;
+    }
+    const auto boundNodeOffset = boundNodeIDVector.getValue<nodeID_t>(boundNodePos).offset;
+    const auto nodeGroupIdx = StorageUtils::getNodeGroupIdx(boundNodeOffset);
+    auto& csrNodeGroup = getNodeGroup(nodeGroupIdx)->cast<CSRNodeGroup>();
+    bool isDeleted = csrNodeGroup.delete_(transaction, source, rowIdx);
+    if (isDeleted && transaction->shouldAppendToUndoBuffer()) {
+        transaction->pushDeleteInfo(nodeGroupIdx, rowIdx, 1, getVersionRecordHandler(source));
+    }
+    return isDeleted;
+}
+
+void RelTableData::addColumn(TableAddColumnState& addColumnState, PageAllocator& pageAllocator) {
+    auto& definition = addColumnState.propertyDefinition;
+    columns.push_back(ColumnFactory::createColumn(definition.getName(), definition.getType().copy(),
+        pageAllocator.getDataFH(), mm, shadowFile, enableCompression));
+    nodeGroups->addColumn(addColumnState, &pageAllocator);
+}
+
+std::pair<CSRNodeGroupScanSource, row_idx_t> RelTableData::findMatchingRow(Transaction* transaction,
+    ValueVector& boundNodeIDVector, const ValueVector& relIDVector) const {
+    KU_ASSERT(boundNodeIDVector.state->getSelVector().getSelSize() == 1);
+    KU_ASSERT(relIDVector.state->getSelVector().getSelSize() == 1);
+    const auto boundNodePos = boundNodeIDVector.state->getSelVector()[0];
+    const auto relIDPos = relIDVector.state->getSelVector()[0];
+    const auto boundNodeOffset = boundNodeIDVector.getValue<nodeID_t>(boundNodePos).offset;
+    const auto relOffset = relIDVector.getValue<nodeID_t>(relIDPos).offset;
+    const auto nodeGroupIdx = StorageUtils::getNodeGroupIdx(boundNodeOffset);
+
+    DataChunk scanChunk(1);
+    // RelID output vector.
+    scanChunk.insert(0, std::make_shared<ValueVector>(LogicalType::INTERNAL_ID()));
+    std::vector columnIDs = {REL_ID_COLUMN_ID, ROW_IDX_COLUMN_ID};
+    std::vector<const Column*> columns{getColumn(REL_ID_COLUMN_ID), nullptr};
+    auto scanState = std::make_unique<RelTableScanState>(*mm, &boundNodeIDVector,
+        std::vector{&scanChunk.getValueVectorMutable(0)}, scanChunk.state, true /*randomLookup*/);
+    scanState->setToTable(transaction, &table, columnIDs, {}, direction);
+    scanState->initState(transaction, getNodeGroup(nodeGroupIdx));
+    row_idx_t matchingRowIdx = INVALID_ROW_IDX;
+    auto source = CSRNodeGroupScanSource::NONE;
+    const auto scannedIDVector = scanState->outputVectors[0];
+    while (true) {
+        const auto scanResult = scanState->nodeGroup->scan(transaction, *scanState);
+        if (scanResult == NODE_GROUP_SCAN_EMPTY_RESULT) {
+            break;
+        }
+        for (auto i = 0u; i < scanState->outState->getSelVector().getSelSize(); i++) {
+            const auto pos = scanState->outState->getSelVector()[i];
+            if (scannedIDVector->getValue<internalID_t>(pos).offset == relOffset) {
+                const auto rowIdxPos = scanState->rowIdxVector->state->getSelVector()[i];
+                matchingRowIdx = scanState->rowIdxVector->getValue<row_idx_t>(rowIdxPos);
+                source = scanState->nodeGroupScanState->cast<CSRNodeGroupScanState>().source;
+                break;
+            }
+        }
+        if (matchingRowIdx != INVALID_ROW_IDX) {
+            break;
+        }
+    }
+    return {source, matchingRowIdx};
+}
+
+bool RelTableData::checkIfNodeHasRels(Transaction* transaction,
+    ValueVector* srcNodeIDVector) const {
+    KU_ASSERT(srcNodeIDVector->state->isFlat());
+    const auto nodeIDPos = srcNodeIDVector->state->getSelVector()[0];
+    const auto nodeOffset = srcNodeIDVector->getValue<nodeID_t>(nodeIDPos).offset;
+    const auto nodeGroupIdx = StorageUtils::getNodeGroupIdx(nodeOffset);
+    if (nodeGroupIdx >= getNumNodeGroups()) {
+        return false;
+    }
+    DataChunk scanChunk(1);
+    // RelID output vector.
+    scanChunk.insert(0, std::make_shared<ValueVector>(LogicalType::INTERNAL_ID()));
+    std::vector columnIDs = {REL_ID_COLUMN_ID};
+    std::vector<const Column*> columns{getColumn(REL_ID_COLUMN_ID)};
+    auto scanState = std::make_unique<RelTableScanState>(*mm, srcNodeIDVector,
+        std::vector{&scanChunk.getValueVectorMutable(0)}, scanChunk.state, true /*randomLookup*/);
+    scanState->setToTable(transaction, &table, columnIDs, {}, direction);
+    scanState->initState(transaction, getNodeGroup(nodeGroupIdx));
+    while (true) {
+        const auto scanResult = scanState->nodeGroup->scan(transaction, *scanState);
+        if (scanResult == NODE_GROUP_SCAN_EMPTY_RESULT) {
+            break;
+        }
+        if (scanState->outState->getSelVector().getSelSize() > 0) {
+            return true;
+        }
+    }
+    return false;
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void RelTableData::pushInsertInfo(const Transaction* transaction, const CSRNodeGroup& nodeGroup,
+    row_idx_t numRows_, CSRNodeGroupScanSource source) {
+    // we shouldn't be appending directly to the to the persistent data
+    // unless we are performing batch insert and the persistent chunked group is empty
+    KU_ASSERT(source != CSRNodeGroupScanSource::COMMITTED_PERSISTENT ||
+              !nodeGroup.getPersistentChunkedGroup() ||
+              nodeGroup.getPersistentChunkedGroup()->getNumRows() == 0);
+
+    const auto [startRow, shouldIncrementNumRows] =
+        (source == CSRNodeGroupScanSource::COMMITTED_PERSISTENT) ?
+            std::make_pair(static_cast<row_idx_t>(0), false) :
+            std::make_pair(nodeGroup.getNumRows(), true);
+
+    nodeGroups->pushInsertInfo(transaction, nodeGroup.getNodeGroupIdx(), startRow, numRows_,
+        getVersionRecordHandler(source), shouldIncrementNumRows);
+}
+
+void RelTableData::checkpoint(const std::vector<column_id_t>& columnIDs,
+    PageAllocator& pageAllocator) {
+    std::vector<std::unique_ptr<Column>> checkpointColumns;
+    for (auto i = 0u; i < columnIDs.size(); i++) {
+        const auto columnID = columnIDs[i];
+        checkpointColumns.push_back(std::move(columns[columnID]));
+    }
+    columns = std::move(checkpointColumns);
+
+    std::vector<Column*> checkpointColumnPtrs;
+    for (const auto& column : columns) {
+        checkpointColumnPtrs.push_back(column.get());
+    }
+
+    CSRNodeGroupCheckpointState state{columnIDs, std::move(checkpointColumnPtrs), pageAllocator, mm,
+        csrHeaderColumns.offset.get(), csrHeaderColumns.length.get()};
+    nodeGroups->checkpoint(*mm, state);
+}
+
+void RelTableData::serialize(Serializer& serializer) const {
+    nodeGroups->serialize(serializer);
+}
+
+void RelTableData::deserialize(Deserializer& deSerializer, MemoryManager& memoryManager) {
+    nodeGroups->deserialize(deSerializer, memoryManager);
+}
+
+const VersionRecordHandler* RelTableData::getVersionRecordHandler(
+    CSRNodeGroupScanSource source) const {
+    if (source == CSRNodeGroupScanSource::COMMITTED_PERSISTENT) {
+        return &persistentVersionRecordHandler;
+    } else {
+        KU_ASSERT(source == CSRNodeGroupScanSource::COMMITTED_IN_MEMORY);
+        return &inMemoryVersionRecordHandler;
+    }
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void RelTableData::rollbackGroupCollectionInsert(row_idx_t numRows_, bool isPersistent) {
+    nodeGroups->rollbackInsert(numRows_, !isPersistent);
+}
+
+void RelTableData::reclaimStorage(PageAllocator& pageAllocator) const {
+    nodeGroups->reclaimStorage(pageAllocator);
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/string_chunk_data.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/string_chunk_data.cpp
new file mode 100644
index 0000000000..05eeb6863c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/string_chunk_data.cpp
@@ -0,0 +1,325 @@
+#include "storage/table/string_chunk_data.h"
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/dictionary_chunk.h"
+#include "storage/table/string_column.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+StringChunkData::StringChunkData(MemoryManager& mm, LogicalType dataType, uint64_t capacity,
+    bool enableCompression, ResidencyState residencyState)
+    : ColumnChunkData{mm, std::move(dataType), capacity, enableCompression, residencyState,
+          true /*hasNullData*/},
+      indexColumnChunk{ColumnChunkFactory::createColumnChunkData(mm, LogicalType::UINT32(),
+          enableCompression, capacity, residencyState, false /*hasNullData*/)},
+      dictionaryChunk{
+          std::make_unique<DictionaryChunk>(mm, capacity, enableCompression, residencyState)},
+      needFinalize{false} {}
+
+StringChunkData::StringChunkData(MemoryManager& mm, bool enableCompression,
+    const ColumnChunkMetadata& metadata)
+    : ColumnChunkData{mm, LogicalType::STRING(), enableCompression, metadata, true /*hasNullData*/},
+      dictionaryChunk{
+          std::make_unique<DictionaryChunk>(mm, 0, enableCompression, ResidencyState::IN_MEMORY)},
+      needFinalize{false} {
+    // create index chunk
+    indexColumnChunk = ColumnChunkFactory::createColumnChunkData(mm, LogicalType::UINT32(),
+        enableCompression, capacity, ResidencyState::ON_DISK);
+}
+
+ColumnChunkData* StringChunkData::getIndexColumnChunk() {
+    return indexColumnChunk.get();
+}
+
+const ColumnChunkData* StringChunkData::getIndexColumnChunk() const {
+    return indexColumnChunk.get();
+}
+
+void StringChunkData::updateNumValues(size_t newValue) {
+    numValues = newValue;
+    indexColumnChunk->setNumValues(newValue);
+}
+
+void StringChunkData::setToInMemory() {
+    ColumnChunkData::setToInMemory();
+    indexColumnChunk->setToInMemory();
+    dictionaryChunk->setToInMemory();
+}
+
+void StringChunkData::resize(uint64_t newCapacity) {
+    ColumnChunkData::resize(newCapacity);
+    indexColumnChunk->resize(newCapacity);
+}
+
+void StringChunkData::resizeWithoutPreserve(uint64_t newCapacity) {
+    ColumnChunkData::resizeWithoutPreserve(newCapacity);
+    indexColumnChunk->resizeWithoutPreserve(newCapacity);
+}
+
+void StringChunkData::resetToEmpty() {
+    ColumnChunkData::resetToEmpty();
+    indexColumnChunk->resetToEmpty();
+    dictionaryChunk->resetToEmpty();
+}
+
+void StringChunkData::append(ValueVector* vector, const SelectionView& selView) {
+    selView.forEach([&](auto pos) {
+        // index is stored in main chunk, data is stored in the data chunk
+        KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+        // index is stored in main chunk, data is stored in the data chunk
+        nullData->setNull(numValues, vector->isNull(pos));
+        auto dstPos = numValues;
+        updateNumValues(numValues + 1);
+        if (!vector->isNull(pos)) {
+            auto kuString = vector->getValue<ku_string_t>(pos);
+            setValueFromString(kuString.getAsStringView(), dstPos);
+        }
+    });
+}
+
+void StringChunkData::append(const ColumnChunkData* other, offset_t startPosInOtherChunk,
+    uint32_t numValuesToAppend) {
+    const auto& otherChunk = other->cast<StringChunkData>();
+    nullData->append(otherChunk.getNullData(), startPosInOtherChunk, numValuesToAppend);
+    switch (dataType.getLogicalTypeID()) {
+    case LogicalTypeID::BLOB:
+    case LogicalTypeID::STRING: {
+        appendStringColumnChunk(&otherChunk, startPosInOtherChunk, numValuesToAppend);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+void StringChunkData::scan(ValueVector& output, offset_t offset, length_t length,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offset + length <= numValues && nullData);
+    nullData->scan(output, offset, length, posInOutputVector);
+    if (!nullData->noNullsGuaranteedInMem()) {
+        for (auto i = 0u; i < length; i++) {
+            if (!nullData->isNull(offset + i)) {
+                output.setValue<std::string_view>(posInOutputVector + i,
+                    getValue<std::string_view>(offset + i));
+            }
+        }
+    } else {
+        for (auto i = 0u; i < length; i++) {
+            output.setValue<std::string_view>(posInOutputVector + i,
+                getValue<std::string_view>(offset + i));
+        }
+    }
+}
+
+void StringChunkData::lookup(offset_t offsetInChunk, ValueVector& output,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offsetInChunk < numValues);
+    output.setNull(posInOutputVector, nullData->isNull(offsetInChunk));
+    if (nullData->isNull(offsetInChunk)) {
+        return;
+    }
+    auto str = getValue<std::string_view>(offsetInChunk);
+    output.setValue<std::string_view>(posInOutputVector, str);
+}
+
+void StringChunkData::initializeScanState(SegmentState& state, const Column* column) const {
+    ColumnChunkData::initializeScanState(state, column);
+
+    auto* stringColumn = ku_dynamic_cast<const StringColumn*>(column);
+    state.childrenStates.resize(CHILD_COLUMN_COUNT);
+    indexColumnChunk->initializeScanState(state.childrenStates[INDEX_COLUMN_CHILD_READ_STATE_IDX],
+        stringColumn->getIndexColumn());
+    dictionaryChunk->getOffsetChunk()->initializeScanState(
+        state.childrenStates[OFFSET_COLUMN_CHILD_READ_STATE_IDX],
+        stringColumn->getDictionary().getOffsetColumn());
+    dictionaryChunk->getStringDataChunk()->initializeScanState(
+        state.childrenStates[DATA_COLUMN_CHILD_READ_STATE_IDX],
+        stringColumn->getDictionary().getDataColumn());
+}
+
+void StringChunkData::write(const ValueVector* vector, offset_t offsetInVector,
+    offset_t offsetInChunk) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+    if (!needFinalize && offsetInChunk < numValues) [[unlikely]] {
+        needFinalize = true;
+    }
+    nullData->setNull(offsetInChunk, vector->isNull(offsetInVector));
+    if (offsetInChunk >= numValues) {
+        updateNumValues(offsetInChunk + 1);
+    }
+    if (!vector->isNull(offsetInVector)) {
+        auto kuStr = vector->getValue<ku_string_t>(offsetInVector);
+        setValueFromString(kuStr.getAsStringView(), offsetInChunk);
+    }
+}
+
+void StringChunkData::write(ColumnChunkData* chunk, ColumnChunkData* dstOffsets, RelMultiplicity) {
+    KU_ASSERT(chunk->getDataType().getPhysicalType() == PhysicalTypeID::STRING &&
+              dstOffsets->getDataType().getPhysicalType() == PhysicalTypeID::INTERNAL_ID &&
+              chunk->getNumValues() == dstOffsets->getNumValues());
+    auto& stringChunk = chunk->cast<StringChunkData>();
+    for (auto i = 0u; i < chunk->getNumValues(); i++) {
+        auto offsetInChunk = dstOffsets->getValue<offset_t>(i);
+        if (!needFinalize && offsetInChunk < numValues) [[unlikely]] {
+            needFinalize = true;
+        }
+        bool isNull = chunk->getNullData()->isNull(i);
+        nullData->setNull(offsetInChunk, isNull);
+        if (offsetInChunk >= numValues) {
+            updateNumValues(offsetInChunk + 1);
+        }
+        if (!isNull) {
+            setValueFromString(stringChunk.getValue<std::string_view>(i), offsetInChunk);
+        }
+    }
+}
+
+void StringChunkData::write(const ColumnChunkData* srcChunk, offset_t srcOffsetInChunk,
+    offset_t dstOffsetInChunk, offset_t numValuesToCopy) {
+    KU_ASSERT(srcChunk->getDataType().getPhysicalType() == PhysicalTypeID::STRING);
+    if ((dstOffsetInChunk + numValuesToCopy) >= numValues) {
+        updateNumValues(dstOffsetInChunk + numValuesToCopy);
+    }
+    auto& srcStringChunk = srcChunk->cast<StringChunkData>();
+    for (auto i = 0u; i < numValuesToCopy; i++) {
+        auto srcPos = srcOffsetInChunk + i;
+        auto dstPos = dstOffsetInChunk + i;
+        bool isNull = srcChunk->getNullData()->isNull(srcPos);
+        nullData->setNull(dstPos, isNull);
+        if (isNull) {
+            continue;
+        }
+        setValueFromString(srcStringChunk.getValue<std::string_view>(srcPos), dstPos);
+    }
+}
+
+void StringChunkData::appendStringColumnChunk(const StringChunkData* other,
+    offset_t startPosInOtherChunk, uint32_t numValuesToAppend) {
+    for (auto i = 0u; i < numValuesToAppend; i++) {
+        auto posInChunk = numValues;
+        auto posInOtherChunk = i + startPosInOtherChunk;
+        updateNumValues(numValues + 1);
+        if (nullData->isNull(posInChunk)) {
+            indexColumnChunk->setValue<DictionaryChunk::string_index_t>(0, posInChunk);
+            continue;
+        }
+        setValueFromString(other->getValue<std::string_view>(posInOtherChunk), posInChunk);
+    }
+}
+
+void StringChunkData::setValueFromString(std::string_view value, uint64_t pos) {
+    auto index = dictionaryChunk->appendString(value);
+    indexColumnChunk->setValue<DictionaryChunk::string_index_t>(index, pos);
+}
+
+void StringChunkData::resetNumValuesFromMetadata() {
+    ColumnChunkData::resetNumValuesFromMetadata();
+    indexColumnChunk->resetNumValuesFromMetadata();
+    dictionaryChunk->resetNumValuesFromMetadata();
+}
+
+void StringChunkData::finalize() {
+    if (!needFinalize) {
+        return;
+    }
+    // Prune unused entries in the dictionary before we flush
+    // We already de-duplicate as we go, but when out of place updates occur new values will be
+    // appended to the end and the original values may be able to be pruned before flushing them to
+    // disk
+    auto newDictionaryChunk = std::make_unique<DictionaryChunk>(getMemoryManager(), numValues,
+        enableCompression, residencyState);
+    // Each index is replaced by a new one for the de-duplicated data in the new dictionary.
+    for (auto i = 0u; i < numValues; i++) {
+        if (nullData->isNull(i)) {
+            continue;
+        }
+        auto stringData = getValue<std::string_view>(i);
+        auto index = newDictionaryChunk->appendString(stringData);
+        indexColumnChunk->setValue<DictionaryChunk::string_index_t>(index, i);
+    }
+    dictionaryChunk = std::move(newDictionaryChunk);
+}
+
+void StringChunkData::flush(PageAllocator& pageAllocator) {
+    ColumnChunkData::flush(pageAllocator);
+    indexColumnChunk->flush(pageAllocator);
+    dictionaryChunk->flush(pageAllocator);
+}
+
+void StringChunkData::reclaimStorage(PageAllocator& pageAllocator) {
+    ColumnChunkData::reclaimStorage(pageAllocator);
+    indexColumnChunk->reclaimStorage(pageAllocator);
+    dictionaryChunk->getOffsetChunk()->reclaimStorage(pageAllocator);
+    dictionaryChunk->getStringDataChunk()->reclaimStorage(pageAllocator);
+}
+
+uint64_t StringChunkData::getSizeOnDisk() const {
+    return ColumnChunkData::getSizeOnDisk() + indexColumnChunk->getSizeOnDisk() +
+           dictionaryChunk->getOffsetChunk()->getSizeOnDisk() +
+           dictionaryChunk->getStringDataChunk()->getSizeOnDisk();
+}
+uint64_t StringChunkData::getMinimumSizeOnDisk() const {
+    return ColumnChunkData::getMinimumSizeOnDisk() + indexColumnChunk->getMinimumSizeOnDisk() +
+           dictionaryChunk->getOffsetChunk()->getMinimumSizeOnDisk() +
+           dictionaryChunk->getStringDataChunk()->getMinimumSizeOnDisk();
+}
+
+uint64_t StringChunkData::getSizeOnDiskInMemoryStats() const {
+    return ColumnChunkData::getSizeOnDiskInMemoryStats() +
+           indexColumnChunk->getSizeOnDiskInMemoryStats() +
+           dictionaryChunk->getOffsetChunk()->getSizeOnDiskInMemoryStats() +
+           dictionaryChunk->getStringDataChunk()->getSizeOnDiskInMemoryStats();
+}
+
+uint64_t StringChunkData::getEstimatedMemoryUsage() const {
+    return ColumnChunkData::getEstimatedMemoryUsage() + dictionaryChunk->getEstimatedMemoryUsage();
+}
+
+void StringChunkData::serialize(Serializer& serializer) const {
+    ColumnChunkData::serialize(serializer);
+    serializer.writeDebuggingInfo("index_column_chunk");
+    indexColumnChunk->serialize(serializer);
+    serializer.writeDebuggingInfo("dictionary_chunk");
+    dictionaryChunk->serialize(serializer);
+}
+
+void StringChunkData::deserialize(Deserializer& deSer, ColumnChunkData& chunkData) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "index_column_chunk");
+    chunkData.cast<StringChunkData>().indexColumnChunk =
+        ColumnChunkData::deserialize(chunkData.getMemoryManager(), deSer);
+    deSer.validateDebuggingInfo(key, "dictionary_chunk");
+    chunkData.cast<StringChunkData>().dictionaryChunk =
+        DictionaryChunk::deserialize(chunkData.getMemoryManager(), deSer);
+}
+
+template<>
+ku_string_t StringChunkData::getValue<ku_string_t>(offset_t) const {
+    KU_UNREACHABLE;
+}
+
+// STRING
+template<>
+std::string_view StringChunkData::getValue<std::string_view>(offset_t pos) const {
+    KU_ASSERT(pos < numValues);
+    KU_ASSERT(!nullData->isNull(pos));
+    auto index = indexColumnChunk->getValue<DictionaryChunk::string_index_t>(pos);
+    return dictionaryChunk->getString(index);
+}
+
+template<>
+std::string StringChunkData::getValue<std::string>(offset_t pos) const {
+    return std::string(getValue<std::string_view>(pos));
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/string_column.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/string_column.cpp
new file mode 100644
index 0000000000..2bf870ccd4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/string_column.cpp
@@ -0,0 +1,302 @@
+#include "storage/table/string_column.h"
+
+#include <algorithm>
+#include <unordered_map>
+
+#include "common/assert.h"
+#include "common/cast.h"
+#include "common/null_mask.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/compression/compression.h"
+#include "storage/page_allocator.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column.h"
+#include "storage/table/column_chunk.h"
+#include "storage/table/null_column.h"
+#include "storage/table/string_chunk_data.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+using string_index_t = DictionaryChunk::string_index_t;
+using string_offset_t = DictionaryChunk::string_offset_t;
+
+StringColumn::StringColumn(std::string name, common::LogicalType dataType, FileHandle* dataFH,
+    MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression)
+    : Column{std::move(name), std::move(dataType), dataFH, mm, shadowFile, enableCompression,
+          true /* requireNullColumn */},
+      dictionary{this->name, dataFH, mm, shadowFile, enableCompression} {
+    auto indexColumnName =
+        StorageUtils::getColumnName(this->name, StorageUtils::ColumnType::INDEX, "index");
+    indexColumn = std::make_unique<Column>(indexColumnName, LogicalType::UINT32(), dataFH, mm,
+        shadowFile, enableCompression, false /*requireNullColumn*/);
+}
+
+SegmentState& StringColumn::getChildState(SegmentState& state, ChildStateIndex child) {
+    const auto childIdx = static_cast<idx_t>(child);
+    return state.getChildState(childIdx);
+}
+
+const SegmentState& StringColumn::getChildState(const SegmentState& state, ChildStateIndex child) {
+    const auto childIdx = static_cast<idx_t>(child);
+    return state.getChildState(childIdx);
+}
+
+std::unique_ptr<ColumnChunkData> StringColumn::flushChunkData(const ColumnChunkData& chunkData,
+    PageAllocator& pageAllocator) {
+    auto flushedChunkData = flushNonNestedChunkData(chunkData, pageAllocator);
+    auto& flushedStringData = flushedChunkData->cast<StringChunkData>();
+
+    auto& stringChunk = chunkData.cast<StringChunkData>();
+    flushedStringData.setIndexChunk(
+        Column::flushChunkData(*stringChunk.getIndexColumnChunk(), pageAllocator));
+    auto& dictChunk = stringChunk.getDictionaryChunk();
+    flushedStringData.getDictionaryChunk().setOffsetChunk(
+        Column::flushChunkData(*dictChunk.getOffsetChunk(), pageAllocator));
+    flushedStringData.getDictionaryChunk().setStringDataChunk(
+        Column::flushChunkData(*dictChunk.getStringDataChunk(), pageAllocator));
+    return flushedChunkData;
+}
+
+void StringColumn::lookupInternal(const SegmentState& state, offset_t nodeOffset,
+    ValueVector* resultVector, uint32_t posInVector) const {
+    auto [nodeGroupIdx, offsetInChunk] = StorageUtils::getNodeGroupIdxAndOffsetInChunk(nodeOffset);
+    string_index_t index = 0;
+    indexColumn->scanSegment(getChildState(state, ChildStateIndex::INDEX), offsetInChunk, 1,
+        reinterpret_cast<uint8_t*>(&index));
+    std::vector<std::pair<string_index_t, uint64_t>> offsetsToScan;
+    offsetsToScan.emplace_back(index, posInVector);
+    dictionary.scan(getChildState(state, ChildStateIndex::OFFSET),
+        getChildState(state, ChildStateIndex::DATA), offsetsToScan, resultVector,
+        getChildState(state, ChildStateIndex::INDEX).metadata);
+}
+
+void StringColumn::writeSegment(ColumnChunkData& persistentChunk, SegmentState& state,
+    offset_t dstOffsetInSegment, const ColumnChunkData& data, offset_t srcOffset,
+    length_t numValues) const {
+    auto& stringPersistentChunk = persistentChunk.cast<StringChunkData>();
+    numValues = std::min(numValues, data.getNumValues() - srcOffset);
+    auto& strChunkToWriteFrom = data.cast<StringChunkData>();
+    std::vector<string_index_t> indices;
+    indices.resize(numValues);
+    for (auto i = 0u; i < numValues; i++) {
+        if (strChunkToWriteFrom.getNullData()->isNull(i + srcOffset)) {
+            indices[i] = 0;
+            continue;
+        }
+        const auto strVal = strChunkToWriteFrom.getValue<std::string_view>(i + srcOffset);
+        indices[i] = dictionary.append(persistentChunk.cast<StringChunkData>().getDictionaryChunk(),
+            state, strVal);
+    }
+    NullMask nullMask(numValues);
+    nullMask.copyFromNullBits(data.getNullData()->getNullMask().getData(), srcOffset,
+        0 /*dstOffset*/, numValues);
+    // Write index to main column
+    indexColumn->writeValuesInternal(getChildState(state, ChildStateIndex::INDEX),
+        dstOffsetInSegment, reinterpret_cast<const uint8_t*>(&indices[0]), &nullMask,
+        0 /*srcOffset*/, numValues);
+    auto [min, max] = std::minmax_element(indices.begin(), indices.end());
+    auto minWritten = StorageValue(*min);
+    auto maxWritten = StorageValue(*max);
+    updateStatistics(persistentChunk.getMetadata(), dstOffsetInSegment + numValues - 1, minWritten,
+        maxWritten);
+    indexColumn->updateStatistics(stringPersistentChunk.getIndexColumnChunk()->getMetadata(),
+        dstOffsetInSegment + numValues - 1, minWritten, maxWritten);
+}
+
+std::vector<std::unique_ptr<ColumnChunkData>> StringColumn::checkpointSegment(
+    ColumnCheckpointState&& checkpointState, PageAllocator& pageAllocator,
+    bool canSplitSegment) const {
+    auto& persistentData = checkpointState.persistentData;
+    auto result =
+        Column::checkpointSegment(std::move(checkpointState), pageAllocator, canSplitSegment);
+    persistentData.syncNumValues();
+    return result;
+}
+
+void StringColumn::scanSegment(const SegmentState& state, offset_t startOffsetInChunk,
+    row_idx_t numValuesToScan, ValueVector* resultVector, offset_t offsetInResult) const {
+    if (nullColumn) {
+        KU_ASSERT(state.nullState);
+        nullColumn->scanSegment(*state.nullState, startOffsetInChunk, numValuesToScan, resultVector,
+            offsetInResult);
+    }
+
+    KU_ASSERT(resultVector->dataType.getPhysicalType() == PhysicalTypeID::STRING);
+    if (!resultVector->state || resultVector->state->getSelVector().isUnfiltered()) {
+        scanUnfiltered(state, startOffsetInChunk, numValuesToScan, resultVector, offsetInResult);
+    } else {
+        scanFiltered(state, startOffsetInChunk, resultVector, offsetInResult);
+    }
+}
+
+void StringColumn::scanSegment(const SegmentState& state, ColumnChunkData* resultChunk,
+    common::offset_t startOffsetInSegment, common::row_idx_t numValuesToScan) const {
+    auto startOffsetInResult = resultChunk->getNumValues();
+    Column::scanSegment(state, resultChunk, startOffsetInSegment, numValuesToScan);
+    KU_ASSERT(resultChunk->getDataType().getPhysicalType() == PhysicalTypeID::STRING);
+
+    auto* stringResultChunk = ku_dynamic_cast<StringChunkData*>(resultChunk);
+    // Revert change to numValues from Column::scanSegment (see note in list_column.cpp)
+    // This shouldn't be necessary in future
+    stringResultChunk->getIndexColumnChunk()->setNumValues(startOffsetInResult);
+
+    auto* indexChunk = stringResultChunk->getIndexColumnChunk();
+    indexColumn->scanSegment(getChildState(state, ChildStateIndex::INDEX), indexChunk,
+        startOffsetInSegment, numValuesToScan);
+
+    const auto initialDictSize =
+        stringResultChunk->getDictionaryChunk().getOffsetChunk()->getNumValues();
+    if (numValuesToScan == state.metadata.numValues) {
+        // Append the entire dictionary into the chunk
+        // Since the resultChunk may be non-empty, each index needs to be incremented by the initial
+        // size of the dictionary so that the indices line up with the values that will be scanned
+        // into the dictionary chunk
+        for (row_idx_t i = 0; i < numValuesToScan; i++) {
+            indexChunk->setValue<string_index_t>(
+                indexChunk->getValue<string_index_t>(startOffsetInResult + i) + initialDictSize,
+                startOffsetInResult + i);
+        }
+        dictionary.scan(state, stringResultChunk->getDictionaryChunk());
+    } else {
+        // Any strings which are duplicated only need to be scanned once, so we track duplicate
+        // indices
+        std::unordered_map<string_index_t, uint64_t> indexMap;
+        std::vector<std::pair<string_index_t, uint64_t>> offsetsToScan;
+        for (auto i = 0u; i < numValuesToScan; i++) {
+            if (!resultChunk->isNull(startOffsetInResult + i)) {
+                auto index = indexChunk->getValue<string_index_t>(startOffsetInResult + i);
+                auto element = indexMap.find(index);
+                if (element == indexMap.end()) {
+                    indexMap.insert(std::make_pair(index, initialDictSize + offsetsToScan.size()));
+                    indexChunk->setValue<string_index_t>(initialDictSize + offsetsToScan.size(),
+                        startOffsetInResult + i);
+                    offsetsToScan.emplace_back(index, initialDictSize + offsetsToScan.size());
+                } else {
+                    indexChunk->setValue<string_index_t>(element->second, startOffsetInResult + i);
+                }
+            }
+        }
+
+        if (offsetsToScan.size() == 0) {
+            // All scanned values are null
+            return;
+        }
+        dictionary.scan(getChildState(state, ChildStateIndex::OFFSET),
+            getChildState(state, ChildStateIndex::DATA), offsetsToScan, stringResultChunk,
+            getChildState(state, ChildStateIndex::INDEX).metadata);
+    }
+    KU_ASSERT(resultChunk->getNumValues() == startOffsetInResult + numValuesToScan &&
+              stringResultChunk->getIndexColumnChunk()->getNumValues() ==
+                  startOffsetInResult + numValuesToScan);
+    RUNTIME_CHECK({
+        auto dictionarySize =
+            stringResultChunk->getDictionaryChunk().getOffsetChunk()->getNumValues();
+        auto indexSize = stringResultChunk->getIndexColumnChunk()->getNumValues();
+        for (offset_t i = 0; i < indexSize; i++) {
+            if (!stringResultChunk->isNull(i)) {
+                auto stringIndex =
+                    stringResultChunk->getIndexColumnChunk()->getValue<string_index_t>(i);
+                KU_ASSERT(stringIndex < dictionarySize);
+            }
+        }
+    });
+}
+
+void StringColumn::scanUnfiltered(const SegmentState& state, offset_t startOffsetInChunk,
+    offset_t numValuesToRead, ValueVector* resultVector, sel_t startPosInVector) const {
+    // TODO: Replace indices with ValueVector to avoid maintaining `scan` interface from
+    // uint8_t*.
+    auto indices = std::make_unique<string_index_t[]>(numValuesToRead);
+    indexColumn->scanSegment(getChildState(state, ChildStateIndex::INDEX), startOffsetInChunk,
+        numValuesToRead, reinterpret_cast<uint8_t*>(indices.get()));
+
+    std::vector<std::pair<string_index_t, uint64_t>> offsetsToScan;
+    for (auto i = 0u; i < numValuesToRead; i++) {
+        if (!resultVector->isNull(startPosInVector + i)) {
+            offsetsToScan.emplace_back(indices[i], startPosInVector + i);
+        }
+    }
+
+    if (offsetsToScan.size() == 0) {
+        // All scanned values are null
+        return;
+    }
+    dictionary.scan(getChildState(state, ChildStateIndex::OFFSET),
+        getChildState(state, ChildStateIndex::DATA), offsetsToScan, resultVector,
+        getChildState(state, ChildStateIndex::INDEX).metadata);
+}
+
+void StringColumn::scanFiltered(const SegmentState& state, offset_t startOffsetInChunk,
+    ValueVector* resultVector, offset_t offsetInResult) const {
+    std::vector<std::pair<string_index_t, uint64_t>> offsetsToScan;
+    for (sel_t i = 0; i < resultVector->state->getSelVector().getSelSize(); i++) {
+        const auto pos = resultVector->state->getSelVector()[i];
+        if (pos >= offsetInResult && startOffsetInChunk + pos < state.metadata.numValues &&
+            !resultVector->isNull(pos)) {
+            // TODO(bmwinger): optimize index scans by grouping them when adjacent
+            const auto offsetInGroup = startOffsetInChunk + pos - offsetInResult;
+            string_index_t index = 0;
+            indexColumn->scanSegment(getChildState(state, ChildStateIndex::INDEX), offsetInGroup, 1,
+                reinterpret_cast<uint8_t*>(&index));
+            offsetsToScan.emplace_back(index, pos);
+        }
+    }
+
+    if (offsetsToScan.size() == 0) {
+        // All scanned values are null
+        return;
+    }
+    dictionary.scan(getChildState(state, ChildStateIndex::OFFSET),
+        getChildState(state, ChildStateIndex::DATA), offsetsToScan, resultVector,
+        getChildState(state, ChildStateIndex::INDEX).metadata);
+}
+
+bool StringColumn::canCheckpointInPlace(const SegmentState& state,
+    const ColumnCheckpointState& checkpointState) const {
+    row_idx_t strLenToAdd = 0u;
+    idx_t numStrings = 0u;
+    for (auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
+        auto& strChunk = segmentCheckpointState.chunkData.cast<StringChunkData>();
+        numStrings += segmentCheckpointState.numRows;
+        for (auto i = 0u; i < segmentCheckpointState.numRows; i++) {
+            if (strChunk.getNullData()->isNull(segmentCheckpointState.startRowInData + i)) {
+                continue;
+            }
+            strLenToAdd += strChunk.getStringLength(segmentCheckpointState.startRowInData + i);
+        }
+    }
+    if (!dictionary.canCommitInPlace(state, numStrings, strLenToAdd)) {
+        return false;
+    }
+    return canIndexCommitInPlace(state, numStrings, checkpointState.endRowIdxToWrite);
+}
+
+bool StringColumn::canIndexCommitInPlace(const SegmentState& state, uint64_t numStrings,
+    offset_t maxOffset) const {
+    const SegmentState& indexState = getChildState(state, ChildStateIndex::INDEX);
+    if (indexColumn->isEndOffsetOutOfPagesCapacity(indexState.metadata, maxOffset)) {
+        return false;
+    }
+    if (indexState.metadata.compMeta.canAlwaysUpdateInPlace()) {
+        return true;
+    }
+    const auto totalStringsAfterUpdate =
+        getChildState(state, ChildStateIndex::OFFSET).metadata.numValues + numStrings;
+    InPlaceUpdateLocalState localUpdateState{};
+    // Check if the index column can store the largest new index in-place
+    if (!indexState.metadata.compMeta.canUpdateInPlace(
+            reinterpret_cast<const uint8_t*>(&totalStringsAfterUpdate), 0 /*pos*/, 1 /*numValues*/,
+            PhysicalTypeID::UINT32, localUpdateState)) {
+        return false;
+    }
+    return true;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/struct_chunk_data.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/struct_chunk_data.cpp
new file mode 100644
index 0000000000..118977695c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/struct_chunk_data.cpp
@@ -0,0 +1,266 @@
+#include "storage/table/struct_chunk_data.h"
+
+#include "common/data_chunk/sel_vector.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/table/column_chunk_data.h"
+#include "storage/table/struct_column.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+StructChunkData::StructChunkData(MemoryManager& mm, LogicalType dataType, uint64_t capacity,
+    bool enableCompression, ResidencyState residencyState)
+    : ColumnChunkData{mm, std::move(dataType), capacity, enableCompression, residencyState,
+          true /*hasNullData*/} {
+    const auto fieldTypes = StructType::getFieldTypes(this->dataType);
+    childChunks.resize(fieldTypes.size());
+    for (auto i = 0u; i < fieldTypes.size(); i++) {
+        childChunks[i] = ColumnChunkFactory::createColumnChunkData(mm, fieldTypes[i]->copy(),
+            enableCompression, capacity, residencyState);
+    }
+}
+
+StructChunkData::StructChunkData(MemoryManager& mm, LogicalType dataType, bool enableCompression,
+    const ColumnChunkMetadata& metadata)
+    : ColumnChunkData{mm, std::move(dataType), enableCompression, metadata, true /*hasNullData*/} {
+    const auto fieldTypes = StructType::getFieldTypes(this->dataType);
+    childChunks.resize(fieldTypes.size());
+    for (auto i = 0u; i < fieldTypes.size(); i++) {
+        childChunks[i] = ColumnChunkFactory::createColumnChunkData(mm, fieldTypes[i]->copy(),
+            enableCompression, 0, ResidencyState::IN_MEMORY);
+    }
+}
+
+void StructChunkData::finalize() {
+    for (const auto& childChunk : childChunks) {
+        childChunk->finalize();
+    }
+}
+
+uint64_t StructChunkData::getEstimatedMemoryUsage() const {
+    auto estimatedMemoryUsage = ColumnChunkData::getEstimatedMemoryUsage();
+    for (auto& childChunk : childChunks) {
+        estimatedMemoryUsage += childChunk->getEstimatedMemoryUsage();
+    }
+    return estimatedMemoryUsage;
+}
+
+void StructChunkData::resetNumValuesFromMetadata() {
+    ColumnChunkData::resetNumValuesFromMetadata();
+    for (const auto& childChunk : childChunks) {
+        childChunk->resetNumValuesFromMetadata();
+    }
+}
+
+void StructChunkData::resetToAllNull() {
+    ColumnChunkData::resetToAllNull();
+    for (const auto& childChunk : childChunks) {
+        childChunk->resetToAllNull();
+    }
+}
+
+void StructChunkData::serialize(Serializer& serializer) const {
+    ColumnChunkData::serialize(serializer);
+    serializer.writeDebuggingInfo("struct_children");
+    serializer.serializeVectorOfPtrs<ColumnChunkData>(childChunks);
+}
+
+void StructChunkData::deserialize(Deserializer& deSer, ColumnChunkData& chunkData) {
+    std::string key;
+    deSer.validateDebuggingInfo(key, "struct_children");
+    deSer.deserializeVectorOfPtrs<ColumnChunkData>(chunkData.cast<StructChunkData>().childChunks,
+        [&](Deserializer& deser) {
+            return ColumnChunkData::deserialize(chunkData.getMemoryManager(), deser);
+        });
+}
+
+void StructChunkData::flush(PageAllocator& pageAllocator) {
+    ColumnChunkData::flush(pageAllocator);
+    for (const auto& childChunk : childChunks) {
+        childChunk->flush(pageAllocator);
+    }
+}
+
+void StructChunkData::reclaimStorage(PageAllocator& pageAllocator) {
+    ColumnChunkData::reclaimStorage(pageAllocator);
+    for (const auto& childChunk : childChunks) {
+        childChunk->reclaimStorage(pageAllocator);
+    }
+}
+
+uint64_t StructChunkData::getSizeOnDisk() const {
+    uint64_t size = ColumnChunkData::getSizeOnDisk();
+    for (const auto& childChunk : childChunks) {
+        size += childChunk->getSizeOnDisk();
+    }
+    return size;
+}
+
+uint64_t StructChunkData::getMinimumSizeOnDisk() const {
+    uint64_t size = ColumnChunkData::getMinimumSizeOnDisk();
+    for (const auto& childChunk : childChunks) {
+        size += childChunk->getMinimumSizeOnDisk();
+    }
+    return size;
+}
+
+uint64_t StructChunkData::getSizeOnDiskInMemoryStats() const {
+    uint64_t size = ColumnChunkData::getSizeOnDiskInMemoryStats();
+    for (const auto& childChunk : childChunks) {
+        size += childChunk->getSizeOnDiskInMemoryStats();
+    }
+    return size;
+}
+
+void StructChunkData::append(const ColumnChunkData* other, offset_t startPosInOtherChunk,
+    uint32_t numValuesToAppend) {
+    KU_ASSERT(other->getDataType().getPhysicalType() == PhysicalTypeID::STRUCT);
+    const auto& otherStructChunk = other->cast<StructChunkData>();
+    KU_ASSERT(childChunks.size() == otherStructChunk.childChunks.size());
+    nullData->append(other->getNullData(), startPosInOtherChunk, numValuesToAppend);
+    for (auto i = 0u; i < childChunks.size(); i++) {
+        childChunks[i]->append(otherStructChunk.childChunks[i].get(), startPosInOtherChunk,
+            numValuesToAppend);
+    }
+    numValues += numValuesToAppend;
+}
+
+void StructChunkData::append(ValueVector* vector, const SelectionView& selView) {
+    const auto numFields = StructType::getNumFields(dataType);
+    for (auto i = 0u; i < numFields; i++) {
+        childChunks[i]->append(StructVector::getFieldVector(vector, i).get(), selView);
+    }
+    for (auto i = 0u; i < selView.getSelSize(); i++) {
+        nullData->setNull(numValues + i, vector->isNull(selView[i]));
+    }
+    numValues += selView.getSelSize();
+}
+
+void StructChunkData::scan(ValueVector& output, offset_t offset, length_t length,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offset + length <= numValues);
+    if (nullData) {
+        nullData->scan(output, offset, length, posInOutputVector);
+    }
+    const auto numFields = StructType::getNumFields(dataType);
+    for (auto i = 0u; i < numFields; i++) {
+        childChunks[i]->scan(*StructVector::getFieldVector(&output, i), offset, length,
+            posInOutputVector);
+    }
+}
+
+void StructChunkData::lookup(offset_t offsetInChunk, ValueVector& output,
+    sel_t posInOutputVector) const {
+    KU_ASSERT(offsetInChunk < numValues);
+    const auto numFields = StructType::getNumFields(dataType);
+    output.setNull(posInOutputVector, nullData->isNull(offsetInChunk));
+    for (auto i = 0u; i < numFields; i++) {
+        childChunks[i]->lookup(offsetInChunk, *StructVector::getFieldVector(&output, i).get(),
+            posInOutputVector);
+    }
+}
+
+void StructChunkData::initializeScanState(SegmentState& state, const Column* column) const {
+    ColumnChunkData::initializeScanState(state, column);
+
+    auto* structColumn = ku_dynamic_cast<const StructColumn*>(column);
+    state.childrenStates.resize(childChunks.size());
+    for (auto i = 0u; i < childChunks.size(); i++) {
+        childChunks[i]->initializeScanState(state.childrenStates[i], structColumn->getChild(i));
+    }
+}
+
+void StructChunkData::setToInMemory() {
+    ColumnChunkData::setToInMemory();
+    for (const auto& child : childChunks) {
+        child->setToInMemory();
+    }
+}
+
+void StructChunkData::resize(uint64_t newCapacity) {
+    ColumnChunkData::resize(newCapacity);
+    capacity = newCapacity;
+    for (const auto& child : childChunks) {
+        child->resize(newCapacity);
+    }
+}
+
+void StructChunkData::resizeWithoutPreserve(uint64_t newCapacity) {
+    ColumnChunkData::resizeWithoutPreserve(newCapacity);
+    capacity = newCapacity;
+    for (const auto& child : childChunks) {
+        child->resizeWithoutPreserve(newCapacity);
+    }
+}
+
+void StructChunkData::resetToEmpty() {
+    ColumnChunkData::resetToEmpty();
+    for (const auto& child : childChunks) {
+        child->resetToEmpty();
+    }
+}
+
+void StructChunkData::write(const ValueVector* vector, offset_t offsetInVector,
+    offset_t offsetInChunk) {
+    KU_ASSERT(vector->dataType.getPhysicalType() == PhysicalTypeID::STRUCT);
+    nullData->setNull(offsetInChunk, vector->isNull(offsetInVector));
+    const auto fields = StructVector::getFieldVectors(vector);
+    for (auto i = 0u; i < fields.size(); i++) {
+        childChunks[i]->write(fields[i].get(), offsetInVector, offsetInChunk);
+    }
+    if (offsetInChunk >= numValues) {
+        numValues = offsetInChunk + 1;
+    }
+}
+
+void StructChunkData::write(ColumnChunkData* chunk, ColumnChunkData* dstOffsets,
+    RelMultiplicity multiplicity) {
+    KU_ASSERT(chunk->getDataType().getPhysicalType() == PhysicalTypeID::STRUCT &&
+              dstOffsets->getDataType().getPhysicalType() == PhysicalTypeID::INTERNAL_ID);
+    for (auto i = 0u; i < dstOffsets->getNumValues(); i++) {
+        const auto offsetInChunk = dstOffsets->getValue<offset_t>(i);
+        KU_ASSERT(offsetInChunk < capacity);
+        nullData->setNull(offsetInChunk, chunk->getNullData()->isNull(i));
+        numValues = offsetInChunk >= numValues ? offsetInChunk + 1 : numValues;
+    }
+    auto& structChunk = chunk->cast<StructChunkData>();
+    for (auto i = 0u; i < childChunks.size(); i++) {
+        childChunks[i]->write(structChunk.getChild(i), dstOffsets, multiplicity);
+    }
+}
+
+void StructChunkData::write(const ColumnChunkData* srcChunk, offset_t srcOffsetInChunk,
+    offset_t dstOffsetInChunk, offset_t numValuesToCopy) {
+    KU_ASSERT(srcChunk->getDataType().getPhysicalType() == PhysicalTypeID::STRUCT);
+    const auto& srcStructChunk = srcChunk->cast<StructChunkData>();
+    KU_ASSERT(childChunks.size() == srcStructChunk.childChunks.size());
+    nullData->write(srcChunk->getNullData(), srcOffsetInChunk, dstOffsetInChunk, numValuesToCopy);
+    if ((dstOffsetInChunk + numValuesToCopy) >= numValues) {
+        numValues = dstOffsetInChunk + numValuesToCopy;
+    }
+    for (auto i = 0u; i < childChunks.size(); i++) {
+        childChunks[i]->write(srcStructChunk.childChunks[i].get(), srcOffsetInChunk,
+            dstOffsetInChunk, numValuesToCopy);
+    }
+}
+
+bool StructChunkData::numValuesSanityCheck() const {
+    for (auto& child : childChunks) {
+        if (child->getNumValues() != numValues) {
+            return false;
+        }
+        if (!child->numValuesSanityCheck()) {
+            return false;
+        }
+    }
+    return nullData->getNumValues() == numValues;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/struct_column.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/struct_column.cpp
new file mode 100644
index 0000000000..ab52006474
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/struct_column.cpp
@@ -0,0 +1,148 @@
+#include "storage/table/struct_column.h"
+
+#include "common/types/types.h"
+#include "common/vector/value_vector.h"
+#include "storage/buffer_manager/memory_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column_chunk.h"
+#include "storage/table/null_column.h"
+#include "storage/table/struct_chunk_data.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+StructColumn::StructColumn(std::string name, LogicalType dataType, FileHandle* dataFH,
+    MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression)
+    : Column{std::move(name), std::move(dataType), dataFH, mm, shadowFile, enableCompression,
+          true /* requireNullColumn */} {
+    const auto fieldTypes = StructType::getFieldTypes(this->dataType);
+    childColumns.resize(fieldTypes.size());
+    for (auto i = 0u; i < fieldTypes.size(); i++) {
+        const auto childColName = StorageUtils::getColumnName(this->name,
+            StorageUtils::ColumnType::STRUCT_CHILD, std::to_string(i));
+        childColumns[i] = ColumnFactory::createColumn(childColName, fieldTypes[i]->copy(), dataFH,
+            mm, shadowFile, enableCompression);
+    }
+}
+
+std::unique_ptr<ColumnChunkData> StructColumn::flushChunkData(const ColumnChunkData& chunk,
+    PageAllocator& pageAllocator) {
+    auto flushedChunk = flushNonNestedChunkData(chunk, pageAllocator);
+    auto& structChunk = chunk.cast<StructChunkData>();
+    auto& flushedStructChunk = flushedChunk->cast<StructChunkData>();
+    for (auto i = 0u; i < structChunk.getNumChildren(); i++) {
+        auto flushedChildChunk = Column::flushChunkData(structChunk.getChild(i), pageAllocator);
+        flushedStructChunk.setChild(i, std::move(flushedChildChunk));
+    }
+    return flushedChunk;
+}
+
+void StructColumn::scanSegment(const SegmentState& state, ColumnChunkData* resultChunk,
+    common::offset_t startOffsetInSegment, common::row_idx_t numValuesToScan) const {
+    KU_ASSERT(resultChunk->getDataType().getPhysicalType() == PhysicalTypeID::STRUCT);
+    // Fix size since Column::scanSegment will adjust the size of the child chunks to be equal to
+    // the size of the main one (see note in list_column.cpp)
+    // TODO(bmwinger): eventually this shouldn't be necessary
+    auto sizeBeforeScan = resultChunk->getNumValues();
+    Column::scanSegment(state, resultChunk, startOffsetInSegment, numValuesToScan);
+    auto& structColumnChunk = resultChunk->cast<StructChunkData>();
+    for (auto i = 0u; i < childColumns.size(); i++) {
+        structColumnChunk.getChild(i)->setNumValues(sizeBeforeScan);
+        childColumns[i]->scanSegment(state.childrenStates[i], structColumnChunk.getChild(i),
+            startOffsetInSegment, numValuesToScan);
+    }
+}
+
+void StructColumn::scanSegment(const SegmentState& state, offset_t startOffsetInSegment,
+    row_idx_t numValuesToScan, ValueVector* resultVector, offset_t offsetInResult) const {
+    Column::scanSegment(state, startOffsetInSegment, numValuesToScan, resultVector, offsetInResult);
+    for (auto i = 0u; i < childColumns.size(); i++) {
+        const auto fieldVector = StructVector::getFieldVector(resultVector, i).get();
+        childColumns[i]->scanSegment(state.childrenStates[i], startOffsetInSegment, numValuesToScan,
+            fieldVector, offsetInResult);
+    }
+}
+
+void StructColumn::lookupInternal(const SegmentState& state, offset_t offsetInSegment,
+    ValueVector* resultVector, uint32_t posInVector) const {
+    for (auto i = 0u; i < childColumns.size(); i++) {
+        const auto fieldVector = StructVector::getFieldVector(resultVector, i).get();
+        childColumns[i]->lookupInternal(state.childrenStates[i], offsetInSegment, fieldVector,
+            posInVector);
+    }
+}
+
+void StructColumn::writeSegment(ColumnChunkData& persistentChunk, SegmentState& state,
+    offset_t offsetInSegment, const ColumnChunkData& data, offset_t dataOffset,
+    length_t numValues) const {
+    KU_ASSERT(data.getDataType().getPhysicalType() == PhysicalTypeID::STRUCT);
+    nullColumn->writeSegment(*persistentChunk.getNullData(), *state.nullState, offsetInSegment,
+        *data.getNullData(), dataOffset, numValues);
+    auto& structData = data.cast<StructChunkData>();
+    auto& persistentStructChunk = persistentChunk.cast<StructChunkData>();
+    for (auto i = 0u; i < childColumns.size(); i++) {
+        const auto& childData = structData.getChild(i);
+        childColumns[i]->writeSegment(*persistentStructChunk.getChild(i), state.childrenStates[i],
+            offsetInSegment, childData, dataOffset, numValues);
+    }
+}
+
+std::vector<std::unique_ptr<ColumnChunkData>> StructColumn::checkpointSegment(
+    ColumnCheckpointState&& checkpointState, PageAllocator& pageAllocator,
+    bool canSplitSegment) const {
+    auto& persistentStructChunk = checkpointState.persistentData.cast<StructChunkData>();
+    // TODO(bmwinger): child columns are now handled as a group so they get split together
+    // Re-introduce the code below when struct columns checkpoing each field individually again
+    /*
+    for (auto i = 0u; i < childColumns.size(); i++) {
+        std::vector<SegmentCheckpointState> childSegmentCheckpointStates;
+        for (const auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
+            childSegmentCheckpointStates.emplace_back(
+                segmentCheckpointState.chunkData.cast<StructChunkData>().getChild(i),
+                segmentCheckpointState.startRowInData, segmentCheckpointState.offsetInSegment,
+                segmentCheckpointState.numRows);
+        }
+        childColumns[i]->checkpointSegment(ColumnCheckpointState(*persistentStructChunk.getChild(i),
+            std::move(childSegmentCheckpointStates)), pageAllocator);
+    }
+    Column::checkpointNullData(checkpointState, pageAllocator);
+    */
+    auto result =
+        Column::checkpointSegment(std::move(checkpointState), pageAllocator, canSplitSegment);
+    persistentStructChunk.syncNumValues();
+    return result;
+}
+
+bool StructColumn::canCheckpointInPlace(const SegmentState& state,
+    const ColumnCheckpointState& checkpointState) const {
+    if (!Column::canCheckpointInPlace(state, checkpointState)) {
+        return false;
+    }
+    for (size_t i = 0; i < childColumns.size(); ++i) {
+        auto& structChunkData = checkpointState.persistentData.cast<StructChunkData>();
+        KU_ASSERT(childColumns.size() == structChunkData.getNumChildren());
+        auto* childChunkData = structChunkData.getChild(i);
+
+        std::vector<SegmentCheckpointState> childSegmentCheckpointStates;
+        for (auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
+            auto& structSegmentData = segmentCheckpointState.chunkData.cast<StructChunkData>();
+            auto& childSegmentData = structSegmentData.getChild(i);
+            childSegmentCheckpointStates.emplace_back(childSegmentData,
+                segmentCheckpointState.offsetInSegment, segmentCheckpointState.startRowInData,
+                segmentCheckpointState.numRows);
+        }
+
+        if (!childColumns[i]->canCheckpointInPlace(state.getChildState(i),
+                ColumnCheckpointState(*childChunkData, std::move(childSegmentCheckpointStates)))) {
+            return false;
+        }
+    }
+    return true;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/table.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/table.cpp
new file mode 100644
index 0000000000..26400bd206
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/table.cpp
@@ -0,0 +1,65 @@
+#include "storage/table/table.h"
+
+#include "storage/storage_manager.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+TableScanState::~TableScanState() = default;
+
+// NOLINTNEXTLINE(readability-make-member-function-const): Semantically non-const.
+void TableScanState::resetOutVectors() {
+    for (const auto& outputVector : outputVectors) {
+        KU_ASSERT(outputVector->state.get() == outState.get());
+        KU_UNUSED(outputVector);
+        outputVector->resetAuxiliaryBuffer();
+    }
+    outState->getSelVectorUnsafe().setToUnfiltered();
+}
+
+void TableScanState::setToTable(const transaction::Transaction*, Table* table_,
+    std::vector<column_id_t> columnIDs_, std::vector<ColumnPredicateSet> columnPredicateSets_,
+    RelDataDirection) {
+    table = table_;
+    columnIDs = std::move(columnIDs_);
+    columnPredicateSets = std::move(columnPredicateSets_);
+    nodeGroupScanState->chunkStates.resize(columnIDs.size());
+}
+
+TableInsertState::TableInsertState(std::vector<ValueVector*> propertyVectors)
+    : propertyVectors{std::move(propertyVectors)}, logToWAL{true} {}
+TableInsertState::~TableInsertState() = default;
+TableUpdateState::TableUpdateState(column_id_t columnID, ValueVector& propertyVector)
+    : columnID{columnID}, propertyVector{propertyVector}, logToWAL{true} {}
+TableUpdateState::~TableUpdateState() = default;
+TableDeleteState::TableDeleteState() : logToWAL{true} {}
+TableDeleteState::~TableDeleteState() = default;
+
+Table::Table(const catalog::TableCatalogEntry* tableEntry, const StorageManager* storageManager,
+    MemoryManager* memoryManager)
+    : tableType{tableEntry->getTableType()}, tableID{tableEntry->getTableID()},
+      tableName{tableEntry->getName()}, enableCompression{storageManager->compressionEnabled()},
+      memoryManager{memoryManager}, shadowFile{&storageManager->getShadowFile()},
+      hasChanges{false} {}
+
+Table::~Table() = default;
+
+bool Table::scan(transaction::Transaction* transaction, TableScanState& scanState) {
+    return scanInternal(transaction, scanState);
+}
+
+DataChunk Table::constructDataChunk(MemoryManager* mm, std::vector<LogicalType> types) {
+    DataChunk dataChunk(types.size());
+    for (auto i = 0u; i < types.size(); i++) {
+        auto valueVector = std::make_unique<ValueVector>(std::move(types[i]), mm);
+        dataChunk.insert(i, std::move(valueVector));
+    }
+    return dataChunk;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/update_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/update_info.cpp
new file mode 100644
index 0000000000..032f3530a1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/update_info.cpp
@@ -0,0 +1,299 @@
+#include "storage/table/update_info.h"
+
+#include <bitset>
+
+#include "common/exception/runtime.h"
+#include "common/vector/value_vector.h"
+#include "storage/storage_utils.h"
+#include "storage/table/column_chunk_data.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::transaction;
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+VectorUpdateInfo& UpdateInfo::update(MemoryManager& memoryManager, const Transaction* transaction,
+    const idx_t vectorIdx, const sel_t rowIdxInVector, const ValueVector& values) {
+    UpdateNode& header = getOrCreateUpdateNode(vectorIdx);
+    // We always lock the head of the chain of vectorUpdateInfo to ensure that we can safely
+    // read/write to any part of the chain.
+    std::unique_lock chainLock{header.mtx};
+    // Traverse the chain of vectorUpdateInfo to find the one that matches the transaction. Also
+    // detect if there is any write-write conflicts.
+    auto current = header.info.get();
+    VectorUpdateInfo* vecUpdateInfo = nullptr;
+    while (current) {
+        if (current->version == transaction->getID()) {
+            // Same transaction, we can update the existing vector info.
+            KU_ASSERT(current->version >= Transaction::START_TRANSACTION_ID);
+            vecUpdateInfo = current;
+        } else if (current->version > transaction->getStartTS()) {
+            // Potentially there can be conflicts. `current` can be uncommitted transaction (version
+            // is transaction ID) or committed transaction started after this transaction.
+            for (auto i = 0u; i < current->numRowsUpdated; i++) {
+                if (current->rowsInVector[i] == rowIdxInVector) {
+                    throw RuntimeException("Write-write conflict of updating the same row.");
+                }
+            }
+        }
+        current = current->prev.get();
+    }
+    if (!vecUpdateInfo) {
+        // Create a new version here if not found in the chain.
+        auto newInfo = std::make_unique<VectorUpdateInfo>(memoryManager, transaction->getID(),
+            values.dataType.copy());
+        vecUpdateInfo = newInfo.get();
+        auto currentInfo = std::move(header.info);
+        if (currentInfo) {
+            currentInfo->next = newInfo.get();
+        }
+        newInfo->prev = std::move(currentInfo);
+        header.info = std::move(newInfo);
+    }
+    KU_ASSERT(vecUpdateInfo);
+    // Check if the row is already updated in this transaction.
+    idx_t idxInUpdateData = INVALID_IDX;
+    for (auto i = 0u; i < vecUpdateInfo->numRowsUpdated; i++) {
+        if (vecUpdateInfo->rowsInVector[i] == rowIdxInVector) {
+            idxInUpdateData = i;
+            break;
+        }
+    }
+    if (idxInUpdateData != INVALID_IDX) {
+        // Overwrite existing update value.
+        vecUpdateInfo->data->write(&values, values.state->getSelVector()[0], idxInUpdateData);
+    } else {
+        // Append new value and update `rowsInVector`.
+        vecUpdateInfo->rowsInVector[vecUpdateInfo->numRowsUpdated] = rowIdxInVector;
+        vecUpdateInfo->data->write(&values, values.state->getSelVector()[0],
+            vecUpdateInfo->numRowsUpdated++);
+    }
+    return *vecUpdateInfo;
+}
+
+void UpdateInfo::scan(const Transaction* transaction, ValueVector& output, offset_t offsetInChunk,
+    length_t length) const {
+    iterateScan(transaction, offsetInChunk, length, 0 /* startPosInOutput */,
+        [&](const VectorUpdateInfo& vecUpdateInfo, uint64_t i, uint64_t posInOutput) -> void {
+            vecUpdateInfo.data->lookup(i, output, posInOutput);
+        });
+}
+
+void UpdateInfo::lookup(const Transaction* transaction, offset_t rowInChunk, ValueVector& output,
+    sel_t posInOutputVector) const {
+    if (!isSet()) {
+        return;
+    }
+    auto [vectorIdx, rowInVector] =
+        StorageUtils::getQuotientRemainder(rowInChunk, DEFAULT_VECTOR_CAPACITY);
+    bool updated = false;
+    iterateVectorInfo(transaction, vectorIdx, [&](const VectorUpdateInfo& vectorInfo) {
+        if (updated) {
+            return;
+        }
+        for (auto i = 0u; i < vectorInfo.numRowsUpdated; i++) {
+            if (vectorInfo.rowsInVector[i] == rowInVector) {
+                vectorInfo.data->lookup(i, output, posInOutputVector);
+                updated = true;
+                return;
+            }
+        }
+    });
+}
+
+void UpdateInfo::scanCommitted(const Transaction* transaction, ColumnChunkData& output,
+    offset_t startOffsetInOutput, row_idx_t startRowScanned, row_idx_t numRows) const {
+    iterateScan(transaction, startRowScanned, numRows, startOffsetInOutput,
+        [&](const VectorUpdateInfo& vecUpdateInfo, uint64_t i, uint64_t posInOutput) -> void {
+            output.write(vecUpdateInfo.data.get(), i, posInOutput, 1);
+        });
+}
+
+void UpdateInfo::iterateVectorInfo(const Transaction* transaction, idx_t idx,
+    const std::function<void(const VectorUpdateInfo&)>& func) const {
+    const UpdateNode* head = nullptr;
+    {
+        std::shared_lock lock{mtx};
+        if (idx >= updates.size() || !updates[idx]->isEmpty()) {
+            return;
+        }
+        head = updates[idx].get();
+    }
+    // We lock the head of the chain to ensure that we can safely read from any part of the
+    // chain.
+    KU_ASSERT(head);
+    std::shared_lock chainLock{head->mtx};
+    auto current = head->info.get();
+    KU_ASSERT(current);
+    while (current) {
+        if (current->version == transaction->getID() ||
+            current->version <= transaction->getStartTS()) {
+            KU_ASSERT((current->version == transaction->getID() &&
+                          current->version >= Transaction::START_TRANSACTION_ID) ||
+                      (current->version <= transaction->getStartTS() &&
+                          current->version < Transaction::START_TRANSACTION_ID));
+            func(*current);
+        }
+        current = current->getPrev();
+    }
+}
+
+#if defined(LBUG_RUNTIME_CHECKS) || !defined(NDEBUG)
+// Assert that info is in the updatedNode version chain.
+static bool validateUpdateChain(const UpdateNode& updatedNode, const VectorUpdateInfo* info) {
+    auto current = updatedNode.info.get();
+    while (current) {
+        if (current == info) {
+            return true;
+        }
+        current = current->getPrev();
+    }
+    return false;
+}
+#endif
+
+void UpdateInfo::commit(idx_t vectorIdx, VectorUpdateInfo* info, transaction_t commitTS) {
+    auto& updateNode = getUpdateNode(vectorIdx);
+    std::unique_lock chainLock{updateNode.mtx};
+    KU_ASSERT(validateUpdateChain(updateNode, info));
+    info->version = commitTS;
+}
+
+void UpdateInfo::rollback(idx_t vectorIdx, transaction_t version) {
+    UpdateNode* header = nullptr;
+    // Note that we lock the entire UpdateInfo structure here because we might modify the
+    // head of the version chain. This is just a simplification and should be optimized later.
+    {
+        std::unique_lock lock{mtx};
+        KU_ASSERT(updates.size() > vectorIdx);
+        header = updates[vectorIdx].get();
+    }
+    KU_ASSERT(header);
+    std::unique_lock chainLock{header->mtx};
+    // First check if this version is still in the chain. It might have been removed by
+    // a previous rollback entry of the same transaction.
+    // TODO(Guodong): This will be optimized by moving VectorUpdateInfo into UndoBuffer.
+    auto current = header->info.get();
+    while (current) {
+        if (current->version == version) {
+            auto prevVersion = current->movePrev();
+            if (current->next) {
+                // Has newer version. Remove this from the version chain.
+                const auto newerVersion = current->next;
+                if (prevVersion) {
+                    prevVersion->next = newerVersion;
+                }
+                newerVersion->setPrev(std::move(prevVersion));
+            } else {
+                KU_ASSERT(header->info.get() == current);
+                // This is the beginning of the version chain.
+                if (prevVersion) {
+                    prevVersion->next = nullptr;
+                }
+                header->info = std::move(prevVersion);
+            }
+            break;
+        }
+        current = current->getPrev();
+    }
+}
+
+row_idx_t UpdateInfo::getNumUpdatedRows(const Transaction* transaction) const {
+    std::unordered_set<row_idx_t> updatedRows;
+    for (auto vectorIdx = 0u; vectorIdx < updates.size(); vectorIdx++) {
+        iterateVectorInfo(transaction, vectorIdx, [&](const VectorUpdateInfo& info) {
+            for (auto i = 0u; i < info.numRowsUpdated; i++) {
+                updatedRows.insert(info.rowsInVector[i]);
+            }
+        });
+    }
+    return updatedRows.size();
+}
+
+bool UpdateInfo::hasUpdates(const Transaction* transaction, row_idx_t startRow,
+    length_t numRows) const {
+    bool hasUpdates = false;
+    iterateScan(transaction, startRow, numRows, 0 /* startPosInOutput */,
+        [&](const VectorUpdateInfo&, uint64_t, uint64_t) -> void { hasUpdates = true; });
+    return hasUpdates;
+}
+
+UpdateNode& UpdateInfo::getUpdateNode(idx_t vectorIdx) {
+    std::shared_lock lock{mtx};
+    if (vectorIdx >= updates.size()) {
+        throw InternalException(
+            "UpdateInfo does not have update node for vector index: " + std::to_string(vectorIdx));
+    }
+    return *updates[vectorIdx];
+}
+
+UpdateNode& UpdateInfo::getOrCreateUpdateNode(idx_t vectorIdx) {
+    std::unique_lock lock{mtx};
+    if (vectorIdx >= updates.size()) {
+        updates.resize(vectorIdx + 1);
+        for (auto i = 0u; i < updates.size(); i++) {
+            if (!updates[i]) {
+                updates[i] = std::make_unique<UpdateNode>();
+            }
+        }
+    }
+    return *updates[vectorIdx];
+}
+
+void UpdateInfo::iterateScan(const Transaction* transaction, uint64_t startOffsetToScan,
+    uint64_t numRowsToScan, uint64_t startPosInOutput,
+    const iterate_read_from_row_func_t& readFromRowFunc) const {
+    if (!isSet()) {
+        return;
+    }
+    auto [startVectorIdx, startOffsetInVector] =
+        StorageUtils::getQuotientRemainder(startOffsetToScan, DEFAULT_VECTOR_CAPACITY);
+    auto [endVectorIdx, endOffsetInVector] = StorageUtils::getQuotientRemainder(
+        startOffsetToScan + numRowsToScan, DEFAULT_VECTOR_CAPACITY);
+    idx_t idx = startVectorIdx;
+    sel_t posInVector = startPosInOutput;
+    while (idx <= endVectorIdx) {
+        const auto startOffsetInclusively = idx == startVectorIdx ? startOffsetInVector : 0;
+        const auto endOffsetExclusively =
+            idx == endVectorIdx ? endOffsetInVector : DEFAULT_VECTOR_CAPACITY;
+        const auto numRowsInVector = endOffsetExclusively - startOffsetInclusively;
+        // We keep track of the rows that have been applied with updates from updateInfo. The update
+        // version chain is maintained with the newest version at the head and the oldest version at
+        // the tail. For each tuple, we iterate through the chain to merge the updates from latest
+        // visible version. If a row has been updated in the current vectorInfo, we should skip it
+        // in older versions.
+        std::bitset<DEFAULT_VECTOR_CAPACITY> rowsUpdated;
+        iterateVectorInfo(transaction, idx, [&](const VectorUpdateInfo& vecUpdateInfo) -> void {
+            if (vecUpdateInfo.numRowsUpdated == 0) {
+                return;
+            }
+            if (rowsUpdated.count() == numRowsInVector) {
+                // All rows in this vector have been updated with a newer visible version already.
+                return;
+            }
+            // TODO(Guodong): Ideally we should make sure vecUpdateInfo.rowsInVector is sorted to
+            // simplify the checks here.
+            for (auto i = 0u; i < vecUpdateInfo.numRowsUpdated; i++) {
+                if (vecUpdateInfo.rowsInVector[i] < startOffsetInclusively ||
+                    vecUpdateInfo.rowsInVector[i] >= endOffsetExclusively) {
+                    // Continue if the row is out of the current scan range.
+                    continue;
+                }
+                auto updatedRowIdx = vecUpdateInfo.rowsInVector[i] - startOffsetInclusively;
+                if (rowsUpdated[updatedRowIdx]) {
+                    // Skip the rows that have been updated with a newer visible version already.
+                    continue;
+                }
+                readFromRowFunc(vecUpdateInfo, i, posInVector + updatedRowIdx);
+                rowsUpdated[updatedRowIdx] = true;
+            }
+        });
+        posInVector += numRowsInVector;
+        idx++;
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/version_info.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/version_info.cpp
new file mode 100644
index 0000000000..7bd524706e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/version_info.cpp
@@ -0,0 +1,700 @@
+#include "storage/table/version_info.h"
+
+#include "common/exception/runtime.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "storage/storage_utils.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+struct VectorVersionInfo {
+    enum class InsertionStatus : uint8_t { NO_INSERTED, CHECK_VERSION, ALWAYS_INSERTED };
+    // TODO(Guodong): ALWAYS_INSERTED is not added for now, but it may be useful as an optimization
+    // to mark the vector data after checkpoint is all deleted.
+    enum class DeletionStatus : uint8_t { NO_DELETED, CHECK_VERSION };
+
+    // TODO: Keep an additional same insertion/deletion field as an optimization to avoid the need
+    // of `array` if all are inserted/deleted in the same transaction.
+    // Also, avoid allocate `array` when status are NO_INSERTED and NO_DELETED.
+    // We can even consider separating the insertion and deletion into two separate Vectors.
+    std::unique_ptr<std::array<transaction_t, DEFAULT_VECTOR_CAPACITY>> insertedVersions;
+    std::unique_ptr<std::array<transaction_t, DEFAULT_VECTOR_CAPACITY>> deletedVersions;
+    // If all values in the Vector are inserted/deleted in the same transaction, we can use this to
+    // avoid the allocation of `array`.
+    transaction_t sameInsertionVersion;
+    transaction_t sameDeletionVersion;
+    InsertionStatus insertionStatus;
+    DeletionStatus deletionStatus;
+
+    VectorVersionInfo()
+        : sameInsertionVersion{INVALID_TRANSACTION}, sameDeletionVersion{INVALID_TRANSACTION},
+          insertionStatus{InsertionStatus::NO_INSERTED},
+          deletionStatus{DeletionStatus::NO_DELETED} {}
+    DELETE_COPY_DEFAULT_MOVE(VectorVersionInfo);
+
+    void append(transaction_t transactionID, row_idx_t startRow, row_idx_t numRows);
+    bool delete_(transaction_t transactionID, row_idx_t rowIdx);
+    void setInsertCommitTS(transaction_t commitTS, row_idx_t startRow, row_idx_t numRows);
+    void setDeleteCommitTS(transaction_t commitTS, row_idx_t startRow, row_idx_t numRows);
+
+    bool isSelected(transaction_t startTS, transaction_t transactionID, row_idx_t rowIdx) const;
+    void getSelVectorForScan(transaction_t startTS, transaction_t transactionID,
+        SelectionVector& selVector, row_idx_t startRow, row_idx_t numRows,
+        sel_t startOutputPos) const;
+
+    void rollbackInsertions(row_idx_t startRowInVector, row_idx_t numRows);
+    void rollbackDeletions(row_idx_t startRowInVector, row_idx_t numRows);
+
+    bool hasDeletions(const transaction::Transaction* transaction) const;
+
+    // Given startTS and transactionID, if the row is deleted to the transaction, return true.
+    bool isDeleted(transaction_t startTS, transaction_t transactionID, row_idx_t rowIdx) const;
+    // Given startTS and transactionID, if the row is readable to the transaction, return true.
+    bool isInserted(transaction_t startTS, transaction_t transactionID, row_idx_t rowIdx) const;
+
+    row_idx_t getNumDeletions(transaction_t startTS, transaction_t transactionID,
+        row_idx_t startRow, length_t numRows) const;
+
+    void serialize(Serializer& serializer) const;
+    static std::unique_ptr<VectorVersionInfo> deSerialize(Deserializer& deSer);
+
+private:
+    void initInsertionVersionArray();
+    void initDeletionVersionArray();
+
+    bool isSameInsertionVersion() const;
+    bool isSameDeletionVersion() const;
+};
+
+void VectorVersionInfo::append(const transaction_t transactionID, const row_idx_t startRow,
+    const row_idx_t numRows) {
+    insertionStatus = InsertionStatus::CHECK_VERSION;
+    if (transactionID == sameInsertionVersion) {
+        return;
+    }
+    if (!isSameInsertionVersion() && !insertedVersions) {
+        // No insertions before, and no need to allocate array.
+        sameInsertionVersion = transactionID;
+        return;
+    }
+    if (!insertedVersions) {
+        initInsertionVersionArray();
+        for (auto i = 0u; i < startRow; i++) {
+            insertedVersions->operator[](i) = sameInsertionVersion;
+        }
+        sameInsertionVersion = INVALID_TRANSACTION;
+    }
+    for (auto i = 0u; i < numRows; i++) {
+        KU_ASSERT(insertedVersions->operator[](startRow + i) == INVALID_TRANSACTION);
+        insertedVersions->operator[](startRow + i) = transactionID;
+    }
+}
+
+bool VectorVersionInfo::delete_(const transaction_t transactionID, const row_idx_t rowIdx) {
+    deletionStatus = DeletionStatus::CHECK_VERSION;
+    if (transactionID == sameDeletionVersion) {
+        // All are deleted in the same transaction.
+        return false;
+    }
+    if (isSameDeletionVersion()) {
+        // All are deleted in a different transaction.
+        throw RuntimeException(
+            "Write-write conflict: deleting a row that is already deleted by another transaction.");
+    }
+    if (!deletedVersions) {
+        // No deletions before.
+        initDeletionVersionArray();
+    }
+    if (deletedVersions->operator[](rowIdx) == transactionID) {
+        return false;
+    }
+    if (deletedVersions->operator[](rowIdx) != INVALID_TRANSACTION) {
+        throw RuntimeException(
+            "Write-write conflict: deleting a row that is already deleted by another transaction.");
+    }
+    deletedVersions->operator[](rowIdx) = transactionID;
+    return true;
+}
+
+void VectorVersionInfo::setInsertCommitTS(transaction_t commitTS, row_idx_t startRow,
+    row_idx_t numRows) {
+    if (isSameInsertionVersion()) {
+        sameInsertionVersion = commitTS;
+        return;
+    }
+    KU_ASSERT(insertedVersions);
+    for (auto rowIdx = startRow; rowIdx < startRow + numRows; rowIdx++) {
+        insertedVersions->operator[](rowIdx) = commitTS;
+    }
+}
+
+void VectorVersionInfo::setDeleteCommitTS(transaction_t commitTS, row_idx_t startRow,
+    row_idx_t numRows) {
+    if (isSameDeletionVersion()) {
+        sameDeletionVersion = commitTS;
+        return;
+    }
+    KU_ASSERT(deletedVersions);
+    for (auto rowIdx = startRow; rowIdx < startRow + numRows; rowIdx++) {
+        deletedVersions->operator[](rowIdx) = commitTS;
+    }
+}
+
+bool VectorVersionInfo::isSelected(const transaction_t startTS, const transaction_t transactionID,
+    const row_idx_t rowIdx) const {
+    if (deletionStatus == DeletionStatus::NO_DELETED &&
+        insertionStatus == InsertionStatus::ALWAYS_INSERTED) {
+        return true;
+    }
+    if (insertionStatus == InsertionStatus::NO_INSERTED) {
+        return false;
+    }
+    if (isInserted(startTS, transactionID, rowIdx)) {
+        return !isDeleted(startTS, transactionID, rowIdx);
+    }
+    return false;
+}
+
+void VectorVersionInfo::getSelVectorForScan(const transaction_t startTS,
+    const transaction_t transactionID, SelectionVector& selVector, const row_idx_t startRow,
+    const row_idx_t numRows, sel_t startOutputPos) const {
+    auto numSelected = selVector.getSelSize();
+    if (deletionStatus == DeletionStatus::NO_DELETED &&
+        insertionStatus == InsertionStatus::ALWAYS_INSERTED) {
+        if (selVector.isUnfiltered()) {
+            selVector.setSelSize(selVector.getSelSize() + numRows);
+        } else {
+            for (auto i = 0u; i < numRows; i++) {
+                selVector.getMutableBuffer()[numSelected++] = startOutputPos + i;
+            }
+            selVector.setToFiltered(numSelected);
+        }
+    } else if (insertionStatus != InsertionStatus::NO_INSERTED) {
+        // If there were no deleted values up to this point the selVector may be unfiltered but have
+        // non-zero size, and the mutable buffer may have arbitrary contents
+        if (selVector.isUnfiltered()) {
+            selVector.makeDynamic();
+        }
+        for (auto i = 0u; i < numRows; i++) {
+            if (const auto rowIdx = startRow + i; isInserted(startTS, transactionID, rowIdx) &&
+                                                  !isDeleted(startTS, transactionID, rowIdx)) {
+                selVector.getMutableBuffer()[numSelected++] = startOutputPos + i;
+            }
+        }
+        selVector.setToFiltered(numSelected);
+    }
+}
+
+bool VectorVersionInfo::isDeleted(const transaction_t startTS, const transaction_t transactionID,
+    const row_idx_t rowIdx) const {
+    switch (deletionStatus) {
+    case DeletionStatus::NO_DELETED: {
+        return false;
+    }
+    case DeletionStatus::CHECK_VERSION: {
+        transaction_t deletion = INVALID_TRANSACTION;
+        if (isSameDeletionVersion()) {
+            deletion = sameDeletionVersion;
+        } else {
+            KU_ASSERT(deletedVersions);
+            deletion = deletedVersions->operator[](rowIdx);
+        }
+        const auto isDeletedWithinSameTransaction = deletion == transactionID;
+        const auto isDeletedByPrevCommittedTransaction = deletion <= startTS;
+        return isDeletedWithinSameTransaction || isDeletedByPrevCommittedTransaction;
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+bool VectorVersionInfo::isInserted(const transaction_t startTS, const transaction_t transactionID,
+    const row_idx_t rowIdx) const {
+    switch (insertionStatus) {
+    case InsertionStatus::ALWAYS_INSERTED: {
+        return true;
+    }
+    case InsertionStatus::NO_INSERTED: {
+        return false;
+    }
+    case InsertionStatus::CHECK_VERSION: {
+        transaction_t insertion = INVALID_TRANSACTION;
+        if (isSameInsertionVersion()) {
+            insertion = sameInsertionVersion;
+        } else {
+            KU_ASSERT(insertedVersions);
+            insertion = insertedVersions->operator[](rowIdx);
+        }
+        const auto isInsertedWithinSameTransaction = insertion == transactionID;
+        const auto isInsertedByPrevCommittedTransaction = insertion <= startTS;
+        return isInsertedWithinSameTransaction || isInsertedByPrevCommittedTransaction;
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+row_idx_t VectorVersionInfo::getNumDeletions(transaction_t startTS, transaction_t transactionID,
+    row_idx_t startRow, length_t numRows) const {
+    if (deletionStatus == DeletionStatus::NO_DELETED) {
+        return 0;
+    }
+    row_idx_t numDeletions = 0u;
+    for (auto i = 0u; i < numRows; i++) {
+        numDeletions += isDeleted(startTS, transactionID, startRow + i);
+    }
+    return numDeletions;
+}
+
+void VectorVersionInfo::rollbackInsertions(row_idx_t startRowInVector, row_idx_t numRows) {
+    if (isSameInsertionVersion()) {
+        // This implicitly assumes that all rows are inserted in the same transaction, so regardless
+        // which rows to be rolled back, we just reset the sameInsertionVersion.
+        sameInsertionVersion = INVALID_TRANSACTION;
+    } else {
+        if (insertedVersions) {
+            for (auto row = startRowInVector; row < startRowInVector + numRows; row++) {
+                insertedVersions->operator[](row) = INVALID_TRANSACTION;
+            }
+            bool hasAnyInsertions = false;
+            for (const auto& version : *insertedVersions) {
+                if (version != INVALID_TRANSACTION) {
+                    hasAnyInsertions = true;
+                    break;
+                }
+            }
+            if (!hasAnyInsertions) {
+                insertedVersions.reset();
+            }
+        }
+    }
+    if (!insertedVersions) {
+        insertionStatus = InsertionStatus::NO_INSERTED;
+        deletionStatus = DeletionStatus::NO_DELETED;
+    }
+}
+
+void VectorVersionInfo::rollbackDeletions(row_idx_t startRowInVector, row_idx_t numRows) {
+    if (isSameDeletionVersion()) {
+        // This implicitly assumes that all rows are deleted in the same transaction, so regardless
+        // which rows to be rollbacked, we just reset the sameInsertionVersion.
+        sameDeletionVersion = INVALID_TRANSACTION;
+    } else {
+        if (deletedVersions) {
+            for (auto row = startRowInVector; row < startRowInVector + numRows; row++) {
+                deletedVersions->operator[](row) = INVALID_TRANSACTION;
+            }
+            bool hasAnyDeletions = false;
+            for (const auto& version : *deletedVersions) {
+                if (version != INVALID_TRANSACTION) {
+                    hasAnyDeletions = true;
+                    break;
+                }
+            }
+            if (!hasAnyDeletions) {
+                deletedVersions.reset();
+            }
+        }
+    }
+    if (!deletedVersions) {
+        deletionStatus = DeletionStatus::NO_DELETED;
+    }
+}
+
+void VectorVersionInfo::initInsertionVersionArray() {
+    insertedVersions = std::make_unique<std::array<transaction_t, DEFAULT_VECTOR_CAPACITY>>();
+    insertedVersions->fill(INVALID_TRANSACTION);
+}
+
+void VectorVersionInfo::initDeletionVersionArray() {
+    deletedVersions = std::make_unique<std::array<transaction_t, DEFAULT_VECTOR_CAPACITY>>();
+    deletedVersions->fill(INVALID_TRANSACTION);
+}
+
+bool VectorVersionInfo::isSameInsertionVersion() const {
+    return sameInsertionVersion != INVALID_TRANSACTION;
+}
+
+bool VectorVersionInfo::isSameDeletionVersion() const {
+    return sameDeletionVersion != INVALID_TRANSACTION;
+}
+
+void VectorVersionInfo::serialize(Serializer& serializer) const {
+    if (deletedVersions) {
+        for (const auto deleted : *deletedVersions) {
+            // Versions should be either INVALID_TRANSACTION or committed timestamps.
+            KU_ASSERT(deleted == INVALID_TRANSACTION ||
+                      deleted < transaction::Transaction::START_TRANSACTION_ID);
+            KU_UNUSED(deleted);
+        }
+    }
+    KU_ASSERT(insertionStatus == InsertionStatus::NO_INSERTED ||
+              insertionStatus == InsertionStatus::ALWAYS_INSERTED);
+    serializer.writeDebuggingInfo("insertion_status");
+    serializer.serializeValue<InsertionStatus>(insertionStatus);
+    serializer.writeDebuggingInfo("deletion_status");
+    serializer.serializeValue<DeletionStatus>(deletionStatus);
+    switch (deletionStatus) {
+    case DeletionStatus::NO_DELETED: {
+        // Nothing to serialize.
+    } break;
+    case DeletionStatus::CHECK_VERSION: {
+        serializer.writeDebuggingInfo("same_deletion_version");
+        serializer.serializeValue<transaction_t>(sameDeletionVersion);
+        if (sameDeletionVersion == INVALID_TRANSACTION) {
+            KU_ASSERT(deletedVersions);
+            serializer.writeDebuggingInfo("deleted_versions");
+            serializer.serializeArray<transaction_t, DEFAULT_VECTOR_CAPACITY>(*deletedVersions);
+        }
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+std::unique_ptr<VectorVersionInfo> VectorVersionInfo::deSerialize(Deserializer& deSer) {
+    std::string key;
+    auto vectorVersionInfo = std::make_unique<VectorVersionInfo>();
+    deSer.validateDebuggingInfo(key, "insertion_status");
+    deSer.deserializeValue<InsertionStatus>(vectorVersionInfo->insertionStatus);
+    KU_ASSERT(vectorVersionInfo->insertionStatus == InsertionStatus::NO_INSERTED ||
+              vectorVersionInfo->insertionStatus == InsertionStatus::ALWAYS_INSERTED);
+    deSer.validateDebuggingInfo(key, "deletion_status");
+    deSer.deserializeValue<DeletionStatus>(vectorVersionInfo->deletionStatus);
+    switch (vectorVersionInfo->deletionStatus) {
+    case DeletionStatus::NO_DELETED: {
+        // Nothing to deserialize.
+    } break;
+    case DeletionStatus::CHECK_VERSION: {
+        deSer.validateDebuggingInfo(key, "same_deletion_version");
+        deSer.deserializeValue<transaction_t>(vectorVersionInfo->sameDeletionVersion);
+        if (vectorVersionInfo->sameDeletionVersion == INVALID_TRANSACTION) {
+            deSer.validateDebuggingInfo(key, "deleted_versions");
+            vectorVersionInfo->initDeletionVersionArray();
+            deSer.deserializeArray<transaction_t, DEFAULT_VECTOR_CAPACITY>(
+                *vectorVersionInfo->deletedVersions);
+        }
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    if (vectorVersionInfo->deletedVersions) {
+        for (const auto deleted : *vectorVersionInfo->deletedVersions) {
+            // Versions should be either INVALID_TRANSACTION or committed timestamps.
+            KU_ASSERT(deleted == INVALID_TRANSACTION ||
+                      deleted < transaction::Transaction::START_TRANSACTION_ID);
+            KU_UNUSED(deleted);
+        }
+    }
+    return vectorVersionInfo;
+}
+
+bool VectorVersionInfo::hasDeletions(const transaction::Transaction* transaction) const {
+    if (isSameDeletionVersion()) {
+        return sameDeletionVersion <= transaction->getStartTS() ||
+               sameDeletionVersion == transaction->getID();
+    }
+    row_idx_t numDeletions = 0;
+    for (auto i = 0u; i < deletedVersions->size(); i++) {
+        numDeletions += isDeleted(transaction->getStartTS(), transaction->getID(), i);
+    }
+    return numDeletions > 0;
+}
+
+VectorVersionInfo& VersionInfo::getOrCreateVersionInfo(idx_t vectorIdx) {
+    if (vectorsInfo.size() <= vectorIdx) {
+        vectorsInfo.resize(vectorIdx + 1);
+    }
+    if (!vectorsInfo[vectorIdx]) {
+        vectorsInfo[vectorIdx] = std::make_unique<VectorVersionInfo>();
+    }
+    return *vectorsInfo[vectorIdx];
+}
+
+VectorVersionInfo* VersionInfo::getVectorVersionInfo(idx_t vectorIdx) const {
+    if (vectorIdx >= vectorsInfo.size()) {
+        return nullptr;
+    }
+    return vectorsInfo[vectorIdx].get();
+}
+
+VersionInfo::VersionInfo() = default;
+VersionInfo::~VersionInfo() = default;
+
+void VersionInfo::append(transaction_t transactionID, const row_idx_t startRow,
+    const row_idx_t numRows) {
+    if (numRows == 0) {
+        return;
+    }
+    auto [startVectorIdx, startRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow, DEFAULT_VECTOR_CAPACITY);
+    auto [endVectorIdx, endRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow + numRows - 1, DEFAULT_VECTOR_CAPACITY);
+    for (auto vectorIdx = startVectorIdx; vectorIdx <= endVectorIdx; vectorIdx++) {
+        auto& vectorVersionInfo = getOrCreateVersionInfo(vectorIdx);
+        const auto startRowIdx = vectorIdx == startVectorIdx ? startRowIdxInVector : 0;
+        const auto endRowIdx =
+            vectorIdx == endVectorIdx ? endRowIdxInVector : DEFAULT_VECTOR_CAPACITY - 1;
+        const auto numRowsInVector = endRowIdx - startRowIdx + 1;
+        vectorVersionInfo.append(transactionID, startRowIdx, numRowsInVector);
+    }
+}
+
+bool VersionInfo::delete_(transaction_t transactionID, const row_idx_t rowIdx) {
+    auto [vectorIdx, rowIdxInVector] =
+        StorageUtils::getQuotientRemainder(rowIdx, DEFAULT_VECTOR_CAPACITY);
+    auto& vectorVersionInfo = getOrCreateVersionInfo(vectorIdx);
+    if (vectorVersionInfo.insertionStatus == VectorVersionInfo::InsertionStatus::NO_INSERTED) {
+        // Note: The version info is newly created due to `delete_`. There is no newly inserted rows
+        // in this vector, thus all are rows checkpointed. We set the insertion status to
+        // ALWAYS_INSERTED to avoid checking the version in the future.
+        vectorVersionInfo.insertionStatus = VectorVersionInfo::InsertionStatus::ALWAYS_INSERTED;
+    }
+    return vectorVersionInfo.delete_(transactionID, rowIdxInVector);
+}
+
+bool VersionInfo::isSelected(transaction_t startTS, transaction_t transactionID,
+    row_idx_t rowIdx) const {
+    auto [vectorIdx, rowIdxInVector] =
+        StorageUtils::getQuotientRemainder(rowIdx, DEFAULT_VECTOR_CAPACITY);
+    if (const auto vectorVersion = getVectorVersionInfo(vectorIdx)) {
+        return vectorVersion->isSelected(startTS, transactionID, rowIdxInVector);
+    }
+    return true;
+}
+
+void VersionInfo::getSelVectorToScan(const transaction_t startTS, const transaction_t transactionID,
+    SelectionVector& selVector, const row_idx_t startRow, const row_idx_t numRows) const {
+    if (numRows == 0) {
+        return;
+    }
+    auto [startVectorIdx, startRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow, DEFAULT_VECTOR_CAPACITY);
+    auto [endVectorIdx, endRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow + numRows - 1, DEFAULT_VECTOR_CAPACITY);
+    auto vectorIdx = startVectorIdx;
+    selVector.setToUnfiltered(0);
+    sel_t outputPos = 0u;
+    while (vectorIdx <= endVectorIdx) {
+        const auto startRowIdx = vectorIdx == startVectorIdx ? startRowIdxInVector : 0;
+        const auto endRowIdx =
+            vectorIdx == endVectorIdx ? endRowIdxInVector : DEFAULT_VECTOR_CAPACITY - 1;
+        const auto numRowsInVector = endRowIdx - startRowIdx + 1;
+        const auto vectorVersion = getVectorVersionInfo(vectorIdx);
+        if (!vectorVersion) {
+            auto numSelected = selVector.getSelSize();
+            if (selVector.isUnfiltered()) {
+                selVector.setSelSize(numSelected + numRowsInVector);
+            } else {
+                for (auto i = 0u; i < numRowsInVector; i++) {
+                    selVector.getMutableBuffer()[numSelected++] = outputPos + i;
+                }
+                selVector.setToFiltered(numSelected);
+            }
+        } else {
+            vectorVersion->getSelVectorForScan(startTS, transactionID, selVector, startRowIdx,
+                numRowsInVector, outputPos);
+        }
+        outputPos += numRowsInVector;
+        vectorIdx++;
+    }
+    KU_ASSERT(outputPos <= DEFAULT_VECTOR_CAPACITY);
+}
+
+void VersionInfo::clearVectorInfo(const idx_t vectorIdx) {
+    KU_ASSERT(vectorIdx < vectorsInfo.size());
+    vectorsInfo[vectorIdx] = nullptr;
+}
+
+bool VersionInfo::hasDeletions() const {
+    for (auto& vectorInfo : vectorsInfo) {
+        if (vectorInfo &&
+            vectorInfo->deletionStatus == VectorVersionInfo::DeletionStatus::CHECK_VERSION) {
+            return true;
+        }
+    }
+    return false;
+}
+
+row_idx_t VersionInfo::getNumDeletions(const transaction::Transaction* transaction,
+    row_idx_t startRow, length_t numRows) const {
+    if (numRows == 0) {
+        return 0;
+    }
+    auto [startVector, startRowInVector] =
+        StorageUtils::getQuotientRemainder(startRow, DEFAULT_VECTOR_CAPACITY);
+    auto [endVectorIdx, endRowInVector] =
+        StorageUtils::getQuotientRemainder(startRow + numRows - 1, DEFAULT_VECTOR_CAPACITY);
+    idx_t vectorIdx = startVector;
+    row_idx_t numDeletions = 0u;
+    while (vectorIdx <= endVectorIdx) {
+        const auto rowInVector = vectorIdx == startVector ? startRowInVector : 0;
+        const auto numRowsInVector = vectorIdx == endVectorIdx ?
+                                         endRowInVector - rowInVector + 1 :
+                                         DEFAULT_VECTOR_CAPACITY - rowInVector;
+        const auto vectorVersion = getVectorVersionInfo(vectorIdx);
+        if (vectorVersion) {
+            numDeletions += vectorVersion->getNumDeletions(transaction->getStartTS(),
+                transaction->getID(), rowInVector, numRowsInVector);
+        }
+        vectorIdx++;
+    }
+    return numDeletions;
+}
+
+bool VersionInfo::hasInsertions() const {
+    for (auto& vectorInfo : vectorsInfo) {
+        if (vectorInfo &&
+            vectorInfo->insertionStatus == VectorVersionInfo::InsertionStatus::CHECK_VERSION) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool VersionInfo::isDeleted(const transaction::Transaction* transaction,
+    row_idx_t rowInChunk) const {
+    auto [vectorIdx, rowInVector] =
+        StorageUtils::getQuotientRemainder(rowInChunk, DEFAULT_VECTOR_CAPACITY);
+    const auto vectorVersion = getVectorVersionInfo(vectorIdx);
+    if (vectorVersion) {
+        return vectorVersion->isDeleted(transaction->getStartTS(), transaction->getID(),
+            rowInVector);
+    }
+    return false;
+}
+
+bool VersionInfo::isInserted(const transaction::Transaction* transaction,
+    row_idx_t rowInChunk) const {
+    auto [vectorIdx, rowInVector] =
+        StorageUtils::getQuotientRemainder(rowInChunk, DEFAULT_VECTOR_CAPACITY);
+    const auto vectorVersion = getVectorVersionInfo(vectorIdx);
+    if (vectorVersion) {
+        return vectorVersion->isInserted(transaction->getStartTS(), transaction->getID(),
+            rowInVector);
+    }
+    return true;
+}
+
+bool VersionInfo::hasDeletions(const transaction::Transaction* transaction) const {
+    for (auto& vectorInfo : vectorsInfo) {
+        if (vectorInfo && vectorInfo->hasDeletions(transaction) > 0) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void VersionInfo::commitInsert(row_idx_t startRow, row_idx_t numRows, transaction_t commitTS) {
+    if (numRows == 0) {
+        return;
+    }
+    auto [startVectorIdx, startRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow, DEFAULT_VECTOR_CAPACITY);
+    auto [endVectorIdx, endRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow + numRows - 1, DEFAULT_VECTOR_CAPACITY);
+    for (auto vectorIdx = startVectorIdx; vectorIdx <= endVectorIdx; vectorIdx++) {
+        const auto startRowIdx = vectorIdx == startVectorIdx ? startRowIdxInVector : 0;
+        const auto endRowIdx =
+            vectorIdx == endVectorIdx ? endRowIdxInVector : DEFAULT_VECTOR_CAPACITY - 1;
+        auto& vectorVersionInfo = getOrCreateVersionInfo(vectorIdx);
+        vectorVersionInfo.setInsertCommitTS(commitTS, startRowIdx, endRowIdx - startRowIdx + 1);
+    }
+}
+
+void VersionInfo::rollbackInsert(row_idx_t startRow, row_idx_t numRows) {
+    if (numRows == 0) {
+        return;
+    }
+    auto [startVectorIdx, startRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow, DEFAULT_VECTOR_CAPACITY);
+    auto [endVectorIdx, endRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow + numRows - 1, DEFAULT_VECTOR_CAPACITY);
+    for (auto vectorIdx = startVectorIdx; vectorIdx <= endVectorIdx; vectorIdx++) {
+        const auto startRowIdx = vectorIdx == startVectorIdx ? startRowIdxInVector : 0;
+        const auto endRowIdx =
+            vectorIdx == endVectorIdx ? endRowIdxInVector : DEFAULT_VECTOR_CAPACITY - 1;
+        auto& vectorVersionInfo = getOrCreateVersionInfo(vectorIdx);
+        vectorVersionInfo.rollbackInsertions(startRowIdx, endRowIdx - startRowIdx + 1);
+    }
+}
+
+void VersionInfo::commitDelete(row_idx_t startRow, row_idx_t numRows, transaction_t commitTS) {
+    if (numRows == 0) {
+        return;
+    }
+    auto [startVectorIdx, startRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow, DEFAULT_VECTOR_CAPACITY);
+    auto [endVectorIdx, endRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow + numRows - 1, DEFAULT_VECTOR_CAPACITY);
+    for (auto vectorIdx = startVectorIdx; vectorIdx <= endVectorIdx; vectorIdx++) {
+        const auto startRowIdx = vectorIdx == startVectorIdx ? startRowIdxInVector : 0;
+        const auto endRowIdx =
+            vectorIdx == endVectorIdx ? endRowIdxInVector : DEFAULT_VECTOR_CAPACITY - 1;
+        auto& vectorVersionInfo = getOrCreateVersionInfo(vectorIdx);
+        vectorVersionInfo.setDeleteCommitTS(commitTS, startRowIdx, endRowIdx - startRowIdx + 1);
+    }
+}
+
+void VersionInfo::rollbackDelete(row_idx_t startRow, row_idx_t numRows) {
+    if (numRows == 0) {
+        return;
+    }
+    auto [startVectorIdx, startRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow, DEFAULT_VECTOR_CAPACITY);
+    auto [endVectorIdx, endRowIdxInVector] =
+        StorageUtils::getQuotientRemainder(startRow + numRows - 1, DEFAULT_VECTOR_CAPACITY);
+    for (auto vectorIdx = startVectorIdx; vectorIdx <= endVectorIdx; vectorIdx++) {
+        auto& vectorVersionInfo = getOrCreateVersionInfo(vectorIdx);
+        const auto startRowIdx = vectorIdx == startVectorIdx ? startRowIdxInVector : 0;
+        const auto endRowIdx =
+            vectorIdx == endVectorIdx ? endRowIdxInVector : DEFAULT_VECTOR_CAPACITY - 1;
+        vectorVersionInfo.rollbackDeletions(startRowIdx, endRowIdx - startRowIdx + 1);
+    }
+}
+
+void VersionInfo::serialize(Serializer& serializer) const {
+    serializer.writeDebuggingInfo("vectors_info_size");
+    serializer.write<uint64_t>(vectorsInfo.size());
+    for (auto i = 0u; i < vectorsInfo.size(); i++) {
+        auto hasVectorVersion = vectorsInfo[i] != nullptr;
+        serializer.writeDebuggingInfo("has_vector_info");
+        serializer.write<bool>(hasVectorVersion);
+        if (hasVectorVersion) {
+            serializer.writeDebuggingInfo("vector_info");
+            vectorsInfo[i]->serialize(serializer);
+        }
+    }
+}
+
+std::unique_ptr<VersionInfo> VersionInfo::deserialize(Deserializer& deSer) {
+    std::string key;
+    uint64_t vectorSize = 0;
+    deSer.validateDebuggingInfo(key, "vectors_info_size");
+    deSer.deserializeValue<uint64_t>(vectorSize);
+    auto versionInfo = std::make_unique<VersionInfo>();
+    for (auto i = 0u; i < vectorSize; i++) {
+        bool hasVectorVersion = false;
+        deSer.validateDebuggingInfo(key, "has_vector_info");
+        deSer.deserializeValue<bool>(hasVectorVersion);
+        if (hasVectorVersion) {
+            deSer.validateDebuggingInfo(key, "vector_info");
+            auto vectorVersionInfo = VectorVersionInfo::deSerialize(deSer);
+            versionInfo->vectorsInfo.push_back(std::move(vectorVersionInfo));
+        } else {
+            versionInfo->vectorsInfo.push_back(nullptr);
+        }
+    }
+    return versionInfo;
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/version_record_handler.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/version_record_handler.cpp
new file mode 100644
index 0000000000..7efa34727b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/table/version_record_handler.cpp
@@ -0,0 +1,15 @@
+#include "storage/table/version_record_handler.h"
+
+#include "main/client_context.h"
+#include "storage/table/chunked_node_group.h"
+
+namespace lbug::storage {
+
+void VersionRecordHandler::rollbackInsert(main::ClientContext* context,
+    common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+    common::row_idx_t numRows) const {
+    applyFuncToChunkedGroups(&ChunkedNodeGroup::rollbackInsert, nodeGroupIdx, startRow, numRows,
+        transaction::Transaction::Get(*context)->getCommitTS());
+}
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/undo_buffer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/undo_buffer.cpp
new file mode 100644
index 0000000000..c6e9faf6e1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/undo_buffer.cpp
@@ -0,0 +1,309 @@
+#include "storage/undo_buffer.h"
+
+#include "catalog/catalog_entry/catalog_entry.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "catalog/catalog_set.h"
+#include "storage/table/chunked_node_group.h"
+#include "storage/table/update_info.h"
+#include "storage/table/version_record_handler.h"
+#include "transaction/transaction.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::main;
+
+namespace lbug {
+namespace storage {
+
+struct UndoRecordHeader {
+    UndoBuffer::UndoRecordType recordType;
+    uint32_t recordSize;
+
+    UndoRecordHeader(const UndoBuffer::UndoRecordType recordType, const uint32_t recordSize)
+        : recordType{recordType}, recordSize{recordSize} {}
+};
+
+struct CatalogEntryRecord {
+    CatalogSet* catalogSet;
+    CatalogEntry* catalogEntry;
+};
+
+struct SequenceEntryRecord {
+    SequenceCatalogEntry* sequenceEntry;
+    SequenceRollbackData sequenceRollbackData;
+};
+
+struct NodeBatchInsertRecord {
+    table_id_t tableID;
+};
+
+struct VersionRecord {
+    row_idx_t startRow;
+    row_idx_t numRows;
+    node_group_idx_t nodeGroupIdx;
+    const VersionRecordHandler* versionRecordHandler;
+};
+
+struct VectorUpdateRecord {
+    UpdateInfo* updateInfo;
+    idx_t vectorIdx;
+    VectorUpdateInfo* vectorUpdateInfo;
+    transaction_t version; // This is used during roll back.
+};
+
+template<typename F>
+void UndoBufferIterator::iterate(F&& callback) {
+    idx_t bufferIdx = 0;
+    while (bufferIdx < undoBuffer.memoryBuffers.size()) {
+        auto& currentBuffer = undoBuffer.memoryBuffers[bufferIdx];
+        auto current = currentBuffer.getData();
+        const auto end = current + currentBuffer.getCurrentPosition();
+        while (current < end) {
+            UndoRecordHeader recordHeader = *reinterpret_cast<UndoRecordHeader const*>(current);
+            current += sizeof(UndoRecordHeader);
+            callback(recordHeader.recordType, current);
+            current += recordHeader.recordSize; // Skip the current entry.
+        }
+        bufferIdx++;
+    }
+}
+
+template<typename F>
+void UndoBufferIterator::reverseIterate(F&& callback) {
+    idx_t numBuffersLeft = undoBuffer.memoryBuffers.size();
+    while (numBuffersLeft > 0) {
+        const auto bufferIdx = numBuffersLeft - 1;
+        auto& currentBuffer = undoBuffer.memoryBuffers[bufferIdx];
+        auto current = currentBuffer.getData();
+        const auto end = current + currentBuffer.getCurrentPosition();
+        std::vector<std::pair<UndoBuffer::UndoRecordType, uint8_t const*>> entries;
+        while (current < end) {
+            UndoRecordHeader recordHeader = *reinterpret_cast<UndoRecordHeader const*>(current);
+            current += sizeof(UndoRecordHeader);
+            entries.push_back({recordHeader.recordType, current});
+            current += recordHeader.recordSize; // Skip the current entry.
+        }
+        for (auto i = entries.size(); i >= 1; i--) {
+            callback(entries[i - 1].first, entries[i - 1].second);
+        }
+        numBuffersLeft--;
+    }
+}
+
+void UndoBuffer::createCatalogEntry(CatalogSet& catalogSet, CatalogEntry& catalogEntry) {
+    auto buffer = createUndoRecord(sizeof(UndoRecordHeader) + sizeof(CatalogEntryRecord));
+    const UndoRecordHeader recordHeader{UndoRecordType::CATALOG_ENTRY, sizeof(CatalogEntryRecord)};
+    *reinterpret_cast<UndoRecordHeader*>(buffer) = recordHeader;
+    buffer += sizeof(UndoRecordHeader);
+    const CatalogEntryRecord catalogEntryRecord{&catalogSet, &catalogEntry};
+    *reinterpret_cast<CatalogEntryRecord*>(buffer) = catalogEntryRecord;
+}
+
+void UndoBuffer::createSequenceChange(SequenceCatalogEntry& sequenceEntry,
+    const SequenceRollbackData& data) {
+    auto buffer = createUndoRecord(sizeof(UndoRecordHeader) + sizeof(SequenceEntryRecord));
+    const UndoRecordHeader recordHeader{UndoRecordType::SEQUENCE_ENTRY,
+        sizeof(SequenceEntryRecord)};
+    *reinterpret_cast<UndoRecordHeader*>(buffer) = recordHeader;
+    buffer += sizeof(UndoRecordHeader);
+    const SequenceEntryRecord sequenceEntryRecord{&sequenceEntry, data};
+    *reinterpret_cast<SequenceEntryRecord*>(buffer) = sequenceEntryRecord;
+}
+
+void UndoBuffer::createInsertInfo(node_group_idx_t nodeGroupIdx, row_idx_t startRow,
+    row_idx_t numRows, const VersionRecordHandler* versionRecordHandler) {
+    createVersionInfo(UndoRecordType::INSERT_INFO, startRow, numRows, versionRecordHandler,
+        nodeGroupIdx);
+}
+
+void UndoBuffer::createDeleteInfo(node_group_idx_t nodeGroupIdx, row_idx_t startRow,
+    row_idx_t numRows, const VersionRecordHandler* versionRecordHandler) {
+    createVersionInfo(UndoRecordType::DELETE_INFO, startRow, numRows, versionRecordHandler,
+        nodeGroupIdx);
+}
+
+void UndoBuffer::createVersionInfo(const UndoRecordType recordType, row_idx_t startRow,
+    row_idx_t numRows, const VersionRecordHandler* versionRecordHandler,
+    node_group_idx_t nodeGroupIdx) {
+    KU_ASSERT(versionRecordHandler);
+    auto buffer = createUndoRecord(sizeof(UndoRecordHeader) + sizeof(VersionRecord));
+    const UndoRecordHeader recordHeader{recordType, sizeof(VersionRecord)};
+    *reinterpret_cast<UndoRecordHeader*>(buffer) = recordHeader;
+    buffer += sizeof(UndoRecordHeader);
+    *reinterpret_cast<VersionRecord*>(buffer) =
+        VersionRecord{startRow, numRows, nodeGroupIdx, versionRecordHandler};
+}
+
+void UndoBuffer::createVectorUpdateInfo(UpdateInfo* updateInfo, const idx_t vectorIdx,
+    VectorUpdateInfo* vectorUpdateInfo, transaction_t version) {
+    auto buffer = createUndoRecord(sizeof(UndoRecordHeader) + sizeof(VectorUpdateRecord));
+    const UndoRecordHeader recordHeader{UndoRecordType::UPDATE_INFO, sizeof(VectorUpdateRecord)};
+    *reinterpret_cast<UndoRecordHeader*>(buffer) = recordHeader;
+    buffer += sizeof(UndoRecordHeader);
+    const VectorUpdateRecord vectorUpdateRecord{updateInfo, vectorIdx, vectorUpdateInfo, version};
+    *reinterpret_cast<VectorUpdateRecord*>(buffer) = vectorUpdateRecord;
+}
+
+uint8_t* UndoBuffer::createUndoRecord(const uint64_t size) {
+    std::unique_lock xLck{mtx};
+    if (memoryBuffers.empty() || !memoryBuffers.back().canFit(size)) {
+        auto capacity = UndoMemoryBuffer::UNDO_MEMORY_BUFFER_INIT_CAPACITY;
+        while (size > capacity) {
+            capacity *= 2;
+        }
+        // We need to allocate a new memory buffer.
+        memoryBuffers.emplace_back(mm->allocateBuffer(false, capacity), capacity);
+    }
+    const auto res =
+        memoryBuffers.back().getDataUnsafe() + memoryBuffers.back().getCurrentPosition();
+    memoryBuffers.back().moveCurrentPosition(size);
+    return res;
+}
+
+void UndoBuffer::commit(transaction_t commitTS) const {
+    UndoBufferIterator iterator{*this};
+    iterator.iterate([&](UndoRecordType entryType, uint8_t const* entry) {
+        commitRecord(entryType, entry, commitTS);
+    });
+}
+
+void UndoBuffer::rollback(ClientContext* context) const {
+    UndoBufferIterator iterator{*this};
+    iterator.reverseIterate([&](UndoRecordType entryType, uint8_t const* entry) {
+        rollbackRecord(context, entryType, entry);
+    });
+}
+
+void UndoBuffer::commitRecord(UndoRecordType recordType, const uint8_t* record,
+    transaction_t commitTS) {
+    switch (recordType) {
+    case UndoRecordType::CATALOG_ENTRY: {
+        commitCatalogEntryRecord(record, commitTS);
+    } break;
+    case UndoRecordType::SEQUENCE_ENTRY: {
+        commitSequenceEntry(record, commitTS);
+    } break;
+    case UndoRecordType::INSERT_INFO:
+    case UndoRecordType::DELETE_INFO: {
+        commitVersionInfo(recordType, record, commitTS);
+    } break;
+    case UndoRecordType::UPDATE_INFO: {
+        commitVectorUpdateInfo(record, commitTS);
+    } break;
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void UndoBuffer::commitCatalogEntryRecord(const uint8_t* record, const transaction_t commitTS) {
+    const auto& [_, catalogEntry] = *reinterpret_cast<CatalogEntryRecord const*>(record);
+    const auto newCatalogEntry = catalogEntry->getNext();
+    KU_ASSERT(newCatalogEntry);
+    newCatalogEntry->setTimestamp(commitTS);
+}
+
+void UndoBuffer::commitVersionInfo(UndoRecordType recordType, const uint8_t* record,
+    transaction_t commitTS) {
+    const auto& undoRecord = *reinterpret_cast<VersionRecord const*>(record);
+    switch (recordType) {
+    case UndoRecordType::INSERT_INFO: {
+        undoRecord.versionRecordHandler->applyFuncToChunkedGroups(&ChunkedNodeGroup::commitInsert,
+            undoRecord.nodeGroupIdx, undoRecord.startRow, undoRecord.numRows, commitTS);
+    } break;
+    case UndoRecordType::DELETE_INFO: {
+        undoRecord.versionRecordHandler->applyFuncToChunkedGroups(&ChunkedNodeGroup::commitDelete,
+            undoRecord.nodeGroupIdx, undoRecord.startRow, undoRecord.numRows, commitTS);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+void UndoBuffer::commitVectorUpdateInfo(const uint8_t* record, transaction_t commitTS) {
+    auto& undoRecord = *reinterpret_cast<VectorUpdateRecord const*>(record);
+    KU_ASSERT(undoRecord.updateInfo);
+    KU_ASSERT(undoRecord.vectorUpdateInfo);
+    undoRecord.updateInfo->commit(undoRecord.vectorIdx, undoRecord.vectorUpdateInfo, commitTS);
+}
+
+void UndoBuffer::rollbackRecord(ClientContext* context, const UndoRecordType recordType,
+    const uint8_t* record) {
+    switch (recordType) {
+    case UndoRecordType::CATALOG_ENTRY: {
+        rollbackCatalogEntryRecord(record);
+    } break;
+    case UndoRecordType::SEQUENCE_ENTRY: {
+        rollbackSequenceEntry(record);
+    } break;
+    case UndoRecordType::INSERT_INFO:
+    case UndoRecordType::DELETE_INFO: {
+        rollbackVersionInfo(context, recordType, record);
+    } break;
+    case UndoRecordType::UPDATE_INFO: {
+        rollbackVectorUpdateInfo(record);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+void UndoBuffer::rollbackCatalogEntryRecord(const uint8_t* record) {
+    const auto& [catalogSet, catalogEntry] = *reinterpret_cast<CatalogEntryRecord const*>(record);
+    const auto entryToRollback = catalogEntry->getNext();
+    KU_ASSERT(entryToRollback);
+    if (entryToRollback->getNext()) {
+        // If entryToRollback has a newer entry (next) in the version chain. Simple remove
+        // entryToRollback from the chain.
+        const auto newerEntry = entryToRollback->getNext();
+        newerEntry->setPrev(entryToRollback->movePrev());
+    } else {
+        // This is the beginning of the version chain.
+        auto olderEntry = entryToRollback->movePrev();
+        catalogSet->eraseNoLock(catalogEntry->getName());
+        if (olderEntry) {
+            catalogSet->emplaceNoLock(std::move(olderEntry));
+        }
+    }
+}
+
+void UndoBuffer::commitSequenceEntry(const uint8_t*, transaction_t) {
+    // DO NOTHING.
+}
+
+void UndoBuffer::rollbackSequenceEntry(const uint8_t* entry) {
+    const auto& sequenceRecord = *reinterpret_cast<SequenceEntryRecord const*>(entry);
+    const auto sequenceEntry = sequenceRecord.sequenceEntry;
+    const auto& data = sequenceRecord.sequenceRollbackData;
+    sequenceEntry->rollbackVal(data.usageCount, data.currVal);
+}
+
+void UndoBuffer::rollbackVersionInfo(ClientContext* context, UndoRecordType recordType,
+    const uint8_t* record) {
+    auto& undoRecord = *reinterpret_cast<VersionRecord const*>(record);
+    switch (recordType) {
+    case UndoRecordType::INSERT_INFO: {
+        undoRecord.versionRecordHandler->rollbackInsert(context, undoRecord.nodeGroupIdx,
+            undoRecord.startRow, undoRecord.numRows);
+    } break;
+    case UndoRecordType::DELETE_INFO: {
+        undoRecord.versionRecordHandler->applyFuncToChunkedGroups(&ChunkedNodeGroup::rollbackDelete,
+            undoRecord.nodeGroupIdx, undoRecord.startRow, undoRecord.numRows,
+            transaction::Transaction::Get(*context)->getCommitTS());
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+void UndoBuffer::rollbackVectorUpdateInfo(const uint8_t* record) {
+    auto& undoRecord = *reinterpret_cast<VectorUpdateRecord const*>(record);
+    KU_ASSERT(undoRecord.updateInfo);
+    undoRecord.updateInfo->rollback(undoRecord.vectorIdx, undoRecord.version);
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/CMakeLists.txt
new file mode 100644
index 0000000000..eae0dd8343
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/CMakeLists.txt
@@ -0,0 +1,12 @@
+add_library(lbug_storage_wal
+        OBJECT
+        checksum_reader.cpp
+        checksum_writer.cpp
+        local_wal.cpp
+        wal.cpp
+        wal_record.cpp
+        wal_replayer.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_storage_wal>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/checksum_reader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/checksum_reader.cpp
new file mode 100644
index 0000000000..1282c7507b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/checksum_reader.cpp
@@ -0,0 +1,62 @@
+#include "storage/wal/checksum_reader.h"
+
+#include <cstring>
+
+#include "common/checksum.h"
+#include "common/exception/storage.h"
+#include "common/serializer/buffered_file.h"
+#include "common/serializer/deserializer.h"
+#include <bit>
+
+namespace lbug::storage {
+static constexpr uint64_t INITIAL_BUFFER_SIZE = common::LBUG_PAGE_SIZE;
+
+ChecksumReader::ChecksumReader(common::FileInfo& fileInfo, MemoryManager& memoryManager,
+    std::string_view checksumMismatchMessage)
+    : deserializer(std::make_unique<common::BufferedFileReader>(fileInfo)),
+      entryBuffer(memoryManager.allocateBuffer(false, INITIAL_BUFFER_SIZE)),
+      checksumMismatchMessage(checksumMismatchMessage) {}
+
+static void resizeBufferIfNeeded(std::unique_ptr<MemoryBuffer>& entryBuffer,
+    uint64_t requestedSize) {
+    const auto currentBufferSize = entryBuffer->getBuffer().size_bytes();
+    if (requestedSize > currentBufferSize) {
+        auto* memoryManager = entryBuffer->getMemoryManager();
+        entryBuffer = memoryManager->allocateBuffer(false, std::bit_ceil(requestedSize));
+    }
+}
+
+void ChecksumReader::read(uint8_t* data, uint64_t size) {
+    deserializer.read(data, size);
+    if (currentEntrySize.has_value()) {
+        resizeBufferIfNeeded(entryBuffer, *currentEntrySize + size);
+        std::memcpy(entryBuffer->getData() + *currentEntrySize, data, size);
+        *currentEntrySize += size;
+    }
+}
+
+bool ChecksumReader::finished() {
+    return deserializer.finished();
+}
+
+void ChecksumReader::onObjectBegin() {
+    currentEntrySize.emplace(0);
+}
+
+void ChecksumReader::onObjectEnd() {
+    KU_ASSERT(currentEntrySize.has_value());
+    const uint64_t computedChecksum = common::checksum(entryBuffer->getData(), *currentEntrySize);
+    uint64_t storedChecksum{};
+    deserializer.deserializeValue(storedChecksum);
+    if (storedChecksum != computedChecksum) {
+        throw common::StorageException(std::string{checksumMismatchMessage});
+    }
+
+    currentEntrySize.reset();
+}
+
+uint64_t ChecksumReader::getReadOffset() const {
+    return deserializer.getReader()->cast<common::BufferedFileReader>()->getReadOffset();
+}
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/checksum_writer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/checksum_writer.cpp
new file mode 100644
index 0000000000..99fd00a51d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/checksum_writer.cpp
@@ -0,0 +1,66 @@
+#include "storage/wal/checksum_writer.h"
+
+#include <cstring>
+
+#include "common/checksum.h"
+#include "common/serializer/serializer.h"
+#include <bit>
+
+namespace lbug::storage {
+static constexpr uint64_t INITIAL_BUFFER_SIZE = common::LBUG_PAGE_SIZE;
+
+ChecksumWriter::ChecksumWriter(std::shared_ptr<common::Writer> outputWriter,
+    MemoryManager& memoryManager)
+    : outputSerializer(std::move(outputWriter)),
+      entryBuffer(memoryManager.allocateBuffer(false, INITIAL_BUFFER_SIZE)) {}
+
+static void resizeBufferIfNeeded(std::unique_ptr<MemoryBuffer>& entryBuffer,
+    uint64_t requestedSize) {
+    const auto currentBufferSize = entryBuffer->getBuffer().size_bytes();
+    if (requestedSize > currentBufferSize) {
+        auto* memoryManager = entryBuffer->getMemoryManager();
+        entryBuffer = memoryManager->allocateBuffer(false, std::bit_ceil(requestedSize));
+    }
+}
+
+void ChecksumWriter::write(const uint8_t* data, uint64_t size) {
+    if (currentEntrySize.has_value()) {
+        resizeBufferIfNeeded(entryBuffer, *currentEntrySize + size);
+        std::memcpy(entryBuffer->getData() + *currentEntrySize, data, size);
+        *currentEntrySize += size;
+    } else {
+        // The data we are writing does not need to be checksummed
+        outputSerializer.write(data, size);
+    }
+}
+
+void ChecksumWriter::clear() {
+    currentEntrySize.reset();
+    outputSerializer.getWriter()->clear();
+}
+
+void ChecksumWriter::flush() {
+    outputSerializer.getWriter()->flush();
+}
+
+void ChecksumWriter::onObjectBegin() {
+    currentEntrySize.emplace(0);
+}
+
+void ChecksumWriter::onObjectEnd() {
+    KU_ASSERT(currentEntrySize.has_value());
+    const auto checksum = common::checksum(entryBuffer->getData(), *currentEntrySize);
+    outputSerializer.write(entryBuffer->getData(), *currentEntrySize);
+    outputSerializer.serializeValue(checksum);
+    currentEntrySize.reset();
+}
+
+uint64_t ChecksumWriter::getSize() const {
+    return currentEntrySize.value_or(0) + outputSerializer.getWriter()->getSize();
+}
+
+void ChecksumWriter::sync() {
+    outputSerializer.getWriter()->sync();
+}
+
+} // namespace lbug::storage
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/local_wal.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/local_wal.cpp
new file mode 100644
index 0000000000..94e9f88c69
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/local_wal.cpp
@@ -0,0 +1,113 @@
+#include "storage/wal/local_wal.h"
+
+#include "binder/ddl/bound_alter_info.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "common/serializer/in_mem_file_writer.h"
+#include "common/vector/value_vector.h"
+#include "storage/wal/checksum_writer.h"
+
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace storage {
+
+LocalWAL::LocalWAL(MemoryManager& mm, bool enableChecksums)
+    : inMemWriter(std::make_shared<InMemFileWriter>(mm)),
+      serializer(enableChecksums ? std::make_shared<ChecksumWriter>(inMemWriter, mm) :
+                                   std::static_pointer_cast<Writer>(inMemWriter)) {}
+
+void LocalWAL::logBeginTransaction() {
+    BeginTransactionRecord walRecord;
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logCommit() {
+    CommitRecord walRecord;
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logCreateCatalogEntryRecord(CatalogEntry* catalogEntry, bool isInternal) {
+    CreateCatalogEntryRecord walRecord(catalogEntry, isInternal);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logDropCatalogEntryRecord(table_id_t tableID, CatalogEntryType type) {
+    DropCatalogEntryRecord walRecord(tableID, type);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logAlterCatalogEntryRecord(const BoundAlterInfo* alterInfo) {
+    AlterTableEntryRecord walRecord(alterInfo);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logTableInsertion(table_id_t tableID, TableType tableType, row_idx_t numRows,
+    const std::vector<ValueVector*>& vectors) {
+    TableInsertionRecord walRecord(tableID, tableType, numRows, vectors);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logNodeDeletion(table_id_t tableID, offset_t nodeOffset, ValueVector* pkVector) {
+    NodeDeletionRecord walRecord(tableID, nodeOffset, pkVector);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logNodeUpdate(table_id_t tableID, column_id_t columnID, offset_t nodeOffset,
+    ValueVector* propertyVector) {
+    NodeUpdateRecord walRecord(tableID, columnID, nodeOffset, propertyVector);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logRelDelete(table_id_t tableID, ValueVector* srcNodeVector,
+    ValueVector* dstNodeVector, ValueVector* relIDVector) {
+    RelDeletionRecord walRecord(tableID, srcNodeVector, dstNodeVector, relIDVector);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logRelDetachDelete(table_id_t tableID, RelDataDirection direction,
+    ValueVector* srcNodeVector) {
+    RelDetachDeleteRecord walRecord(tableID, direction, srcNodeVector);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logRelUpdate(table_id_t tableID, column_id_t columnID, ValueVector* srcNodeVector,
+    ValueVector* dstNodeVector, ValueVector* relIDVector, ValueVector* propertyVector) {
+    RelUpdateRecord walRecord(tableID, columnID, srcNodeVector, dstNodeVector, relIDVector,
+        propertyVector);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logUpdateSequenceRecord(sequence_id_t sequenceID, uint64_t kCount) {
+    UpdateSequenceRecord walRecord(sequenceID, kCount);
+    addNewWALRecord(walRecord);
+}
+
+void LocalWAL::logLoadExtension(std::string path) {
+    LoadExtensionRecord walRecord(std::move(path));
+    addNewWALRecord(walRecord);
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): semantically non-const function.
+void LocalWAL::clear() {
+    std::unique_lock lck{mtx};
+    serializer.getWriter()->clear();
+}
+
+uint64_t LocalWAL::getSize() {
+    std::unique_lock lck{mtx};
+    return serializer.getWriter()->getSize();
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): semantically non-const function.
+void LocalWAL::addNewWALRecord(const WALRecord& walRecord) {
+    std::unique_lock lck{mtx};
+    KU_ASSERT(walRecord.type != WALRecordType::INVALID_RECORD);
+    serializer.getWriter()->onObjectBegin();
+    walRecord.serialize(serializer);
+    serializer.getWriter()->onObjectEnd();
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/wal.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/wal.cpp
new file mode 100644
index 0000000000..046378ef40
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/wal.cpp
@@ -0,0 +1,122 @@
+#include "storage/wal/wal.h"
+
+#include "common/file_system/file_info.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/serializer/buffered_file.h"
+#include "common/serializer/in_mem_file_writer.h"
+#include "main/client_context.h"
+#include "main/database.h"
+#include "main/db_config.h"
+#include "storage/file_db_id_utils.h"
+#include "storage/storage_manager.h"
+#include "storage/storage_utils.h"
+#include "storage/wal/checksum_writer.h"
+#include "storage/wal/local_wal.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace storage {
+
+WAL::WAL(const std::string& dbPath, bool readOnly, bool enableChecksums, VirtualFileSystem* vfs)
+    : walPath{StorageUtils::getWALFilePath(dbPath)},
+      inMemory{main::DBConfig::isDBPathInMemory(dbPath)}, readOnly{readOnly}, vfs{vfs},
+      enableChecksums(enableChecksums) {}
+
+WAL::~WAL() {}
+
+void WAL::logCommittedWAL(LocalWAL& localWAL, main::ClientContext* context) {
+    KU_ASSERT(!readOnly);
+    if (inMemory || localWAL.getSize() == 0) {
+        return; // No need to log empty WAL.
+    }
+    std::unique_lock lck{mtx};
+    initWriter(context);
+    localWAL.inMemWriter->flush(*serializer->getWriter());
+    flushAndSyncNoLock();
+}
+
+void WAL::logAndFlushCheckpoint(main::ClientContext* context) {
+    std::unique_lock lck{mtx};
+    initWriter(context);
+    CheckpointRecord walRecord;
+    addNewWALRecordNoLock(walRecord);
+    flushAndSyncNoLock();
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): semantically non-const function.
+void WAL::clear() {
+    std::unique_lock lck{mtx};
+    serializer->getWriter()->clear();
+}
+
+void WAL::reset() {
+    std::unique_lock lck{mtx};
+    fileInfo.reset();
+    serializer.reset();
+    vfs->removeFileIfExists(walPath);
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): semantically non-const function.
+void WAL::flushAndSyncNoLock() {
+    serializer->getWriter()->flush();
+    serializer->getWriter()->sync();
+}
+
+uint64_t WAL::getFileSize() {
+    std::unique_lock lck{mtx};
+    return serializer->getWriter()->getSize();
+}
+
+void WAL::writeHeader(main::ClientContext& context) {
+    serializer->getWriter()->onObjectBegin();
+    FileDBIDUtils::writeDatabaseID(*serializer,
+        StorageManager::Get(context)->getOrInitDatabaseID(context));
+    serializer->write(enableChecksums);
+    serializer->getWriter()->onObjectEnd();
+}
+
+void WAL::initWriter(main::ClientContext* context) {
+    if (serializer) {
+        return;
+    }
+    fileInfo = vfs->openFile(walPath,
+        FileOpenFlags(FileFlags::CREATE_IF_NOT_EXISTS | FileFlags::READ_ONLY | FileFlags::WRITE),
+        context);
+
+    std::shared_ptr<Writer> writer = std::make_shared<BufferedFileWriter>(*fileInfo);
+    auto& bufferedWriter = writer->cast<BufferedFileWriter>();
+    if (enableChecksums) {
+        writer = std::make_shared<ChecksumWriter>(std::move(writer), *MemoryManager::Get(*context));
+    }
+    serializer = std::make_unique<Serializer>(std::move(writer));
+
+    // Write the databaseID at the start of the WAL if needed
+    // This is used to ensure that when replaying the WAL matches the database
+    if (fileInfo->getFileSize() == 0) {
+        writeHeader(*context);
+    }
+
+    // WAL should always be APPEND only. We don't want to overwrite the file as it may still
+    // contain records not replayed. This can happen if checkpoint is not triggered before the
+    // Database is closed last time.
+    bufferedWriter.setFileOffset(fileInfo->getFileSize());
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const): semantically non-const function.
+void WAL::addNewWALRecordNoLock(const WALRecord& walRecord) {
+    KU_ASSERT(walRecord.type != WALRecordType::INVALID_RECORD);
+    KU_ASSERT(!inMemory);
+    KU_ASSERT(serializer != nullptr);
+    serializer->getWriter()->onObjectBegin();
+    walRecord.serialize(*serializer);
+    serializer->getWriter()->onObjectEnd();
+}
+
+WAL* WAL::Get(const main::ClientContext& context) {
+    KU_ASSERT(context.getDatabase() && context.getDatabase()->getStorageManager());
+    return &context.getDatabase()->getStorageManager()->getWAL();
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/wal_record.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/wal_record.cpp
new file mode 100644
index 0000000000..ccd12cb94c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/wal_record.cpp
@@ -0,0 +1,486 @@
+#include "storage/wal/wal_record.h"
+
+#include "catalog/catalog_entry/catalog_entry.h"
+#include "common/exception/runtime.h"
+#include "common/serializer/deserializer.h"
+#include "common/serializer/serializer.h"
+#include "main/client_context.h"
+#include "storage/buffer_manager/memory_manager.h"
+
+using namespace lbug::common;
+using namespace lbug::binder;
+
+namespace lbug {
+namespace storage {
+
+void WALRecord::serialize(Serializer& serializer) const {
+    serializer.writeDebuggingInfo("type");
+    serializer.write(type);
+}
+
+std::unique_ptr<WALRecord> WALRecord::deserialize(Deserializer& deserializer,
+    const main::ClientContext& clientContext) {
+    std::string key;
+    auto type = WALRecordType::INVALID_RECORD;
+    deserializer.getReader()->onObjectBegin();
+    deserializer.validateDebuggingInfo(key, "type");
+    deserializer.deserializeValue(type);
+    std::unique_ptr<WALRecord> walRecord;
+    switch (type) {
+    case WALRecordType::BEGIN_TRANSACTION_RECORD: {
+        walRecord = BeginTransactionRecord::deserialize(deserializer);
+    } break;
+    case WALRecordType::COMMIT_RECORD: {
+        walRecord = CommitRecord::deserialize(deserializer);
+    } break;
+    case WALRecordType::CREATE_CATALOG_ENTRY_RECORD: {
+        walRecord = CreateCatalogEntryRecord::deserialize(deserializer);
+    } break;
+    case WALRecordType::DROP_CATALOG_ENTRY_RECORD: {
+        walRecord = DropCatalogEntryRecord::deserialize(deserializer);
+    } break;
+    case WALRecordType::ALTER_TABLE_ENTRY_RECORD: {
+        walRecord = AlterTableEntryRecord::deserialize(deserializer);
+    } break;
+    case WALRecordType::TABLE_INSERTION_RECORD: {
+        walRecord = TableInsertionRecord::deserialize(deserializer, clientContext);
+    } break;
+    case WALRecordType::NODE_DELETION_RECORD: {
+        walRecord = NodeDeletionRecord::deserialize(deserializer, clientContext);
+    } break;
+    case WALRecordType::NODE_UPDATE_RECORD: {
+        walRecord = NodeUpdateRecord::deserialize(deserializer, clientContext);
+    } break;
+    case WALRecordType::REL_DELETION_RECORD: {
+        walRecord = RelDeletionRecord::deserialize(deserializer, clientContext);
+    } break;
+    case WALRecordType::REL_DETACH_DELETE_RECORD: {
+        walRecord = RelDetachDeleteRecord::deserialize(deserializer, clientContext);
+    } break;
+    case WALRecordType::REL_UPDATE_RECORD: {
+        walRecord = RelUpdateRecord::deserialize(deserializer, clientContext);
+    } break;
+    case WALRecordType::COPY_TABLE_RECORD: {
+        walRecord = CopyTableRecord::deserialize(deserializer);
+    } break;
+    case WALRecordType::CHECKPOINT_RECORD: {
+        walRecord = CheckpointRecord::deserialize(deserializer);
+    } break;
+    case WALRecordType::UPDATE_SEQUENCE_RECORD: {
+        walRecord = UpdateSequenceRecord::deserialize(deserializer);
+    } break;
+    case WALRecordType::LOAD_EXTENSION_RECORD: {
+        walRecord = LoadExtensionRecord::deserialize(deserializer);
+    } break;
+    case WALRecordType::INVALID_RECORD: {
+        throw RuntimeException("Corrupted wal file. Read out invalid WAL record type.");
+    }
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    walRecord->type = type;
+    deserializer.getReader()->onObjectEnd();
+    return walRecord;
+}
+
+void BeginTransactionRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+}
+
+std::unique_ptr<BeginTransactionRecord> BeginTransactionRecord::deserialize(Deserializer&) {
+    return std::make_unique<BeginTransactionRecord>();
+}
+
+void CommitRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+}
+
+std::unique_ptr<CommitRecord> CommitRecord::deserialize(Deserializer&) {
+    return std::make_unique<CommitRecord>();
+}
+
+void CheckpointRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+}
+
+std::unique_ptr<CheckpointRecord> CheckpointRecord::deserialize(Deserializer&) {
+    return std::make_unique<CheckpointRecord>();
+}
+
+void CreateCatalogEntryRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    catalogEntry->serialize(serializer);
+    serializer.serializeValue(isInternal);
+}
+
+std::unique_ptr<CreateCatalogEntryRecord> CreateCatalogEntryRecord::deserialize(
+    Deserializer& deserializer) {
+    auto retVal = std::make_unique<CreateCatalogEntryRecord>();
+    retVal->ownedCatalogEntry = catalog::CatalogEntry::deserialize(deserializer);
+    bool isInternal = false;
+    deserializer.deserializeValue(isInternal);
+    retVal->isInternal = isInternal;
+    return retVal;
+}
+
+void CopyTableRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.write(tableID);
+}
+
+std::unique_ptr<CopyTableRecord> CopyTableRecord::deserialize(Deserializer& deserializer) {
+    auto retVal = std::make_unique<CopyTableRecord>();
+    deserializer.deserializeValue(retVal->tableID);
+    return retVal;
+}
+
+void DropCatalogEntryRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.write<oid_t>(entryID);
+    serializer.write<catalog::CatalogEntryType>(entryType);
+}
+
+std::unique_ptr<DropCatalogEntryRecord> DropCatalogEntryRecord::deserialize(
+    Deserializer& deserializer) {
+    auto retVal = std::make_unique<DropCatalogEntryRecord>();
+    deserializer.deserializeValue(retVal->entryID);
+    deserializer.deserializeValue(retVal->entryType);
+    return retVal;
+}
+
+static void serializeAlterExtraInfo(Serializer& serializer, const BoundAlterInfo* alterInfo) {
+    const auto* extraInfo = alterInfo->extraInfo.get();
+    serializer.write(alterInfo->alterType);
+    serializer.write(alterInfo->tableName);
+    switch (alterInfo->alterType) {
+    case AlterType::ADD_PROPERTY: {
+        auto addInfo = extraInfo->constPtrCast<BoundExtraAddPropertyInfo>();
+        addInfo->propertyDefinition.serialize(serializer);
+    } break;
+    case AlterType::DROP_PROPERTY: {
+        auto dropInfo = extraInfo->constPtrCast<BoundExtraDropPropertyInfo>();
+        serializer.write(dropInfo->propertyName);
+    } break;
+    case AlterType::RENAME_PROPERTY: {
+        auto renamePropertyInfo = extraInfo->constPtrCast<BoundExtraRenamePropertyInfo>();
+        serializer.write(renamePropertyInfo->newName);
+        serializer.write(renamePropertyInfo->oldName);
+    } break;
+    case AlterType::COMMENT: {
+        auto commentInfo = extraInfo->constPtrCast<BoundExtraCommentInfo>();
+        serializer.write(commentInfo->comment);
+    } break;
+    case AlterType::RENAME: {
+        auto renameTableInfo = extraInfo->constPtrCast<BoundExtraRenameTableInfo>();
+        serializer.write(renameTableInfo->newName);
+    } break;
+    case AlterType::ADD_FROM_TO_CONNECTION:
+    case AlterType::DROP_FROM_TO_CONNECTION: {
+        auto connectionInfo = extraInfo->constPtrCast<BoundExtraAlterFromToConnection>();
+        serializer.write(connectionInfo->fromTableID);
+        serializer.write(connectionInfo->toTableID);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+static decltype(auto) deserializeAlterRecord(Deserializer& deserializer) {
+    auto alterType = AlterType::INVALID;
+    std::string tableName;
+    deserializer.deserializeValue(alterType);
+    deserializer.deserializeValue(tableName);
+    std::unique_ptr<BoundExtraAlterInfo> extraInfo;
+    switch (alterType) {
+    case AlterType::ADD_PROPERTY: {
+        auto definition = PropertyDefinition::deserialize(deserializer);
+        extraInfo = std::make_unique<BoundExtraAddPropertyInfo>(std::move(definition), nullptr);
+    } break;
+    case AlterType::DROP_PROPERTY: {
+        std::string propertyName;
+        deserializer.deserializeValue(propertyName);
+        extraInfo = std::make_unique<BoundExtraDropPropertyInfo>(std::move(propertyName));
+    } break;
+    case AlterType::RENAME_PROPERTY: {
+        std::string newName;
+        std::string oldName;
+        deserializer.deserializeValue(newName);
+        deserializer.deserializeValue(oldName);
+        extraInfo =
+            std::make_unique<BoundExtraRenamePropertyInfo>(std::move(newName), std::move(oldName));
+    } break;
+    case AlterType::COMMENT: {
+        std::string comment;
+        deserializer.deserializeValue(comment);
+        extraInfo = std::make_unique<BoundExtraCommentInfo>(std::move(comment));
+    } break;
+    case AlterType::RENAME: {
+        std::string newName;
+        deserializer.deserializeValue(newName);
+        extraInfo = std::make_unique<BoundExtraRenameTableInfo>(std::move(newName));
+    } break;
+    case AlterType::ADD_FROM_TO_CONNECTION:
+    case AlterType::DROP_FROM_TO_CONNECTION: {
+        table_id_t fromTableID = INVALID_TABLE_ID;
+        table_id_t toTableID = INVALID_TABLE_ID;
+        deserializer.deserializeValue(fromTableID);
+        deserializer.deserializeValue(toTableID);
+        extraInfo = std::make_unique<BoundExtraAlterFromToConnection>(fromTableID, toTableID);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+    return std::make_tuple(alterType, tableName, std::move(extraInfo));
+}
+
+void AlterTableEntryRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializeAlterExtraInfo(serializer, alterInfo);
+}
+
+std::unique_ptr<AlterTableEntryRecord> AlterTableEntryRecord::deserialize(
+    Deserializer& deserializer) {
+    auto [alterType, tableName, extraInfo] = deserializeAlterRecord(deserializer);
+    auto retval = std::make_unique<AlterTableEntryRecord>();
+    retval->ownedAlterInfo =
+        std::make_unique<BoundAlterInfo>(alterType, tableName, std::move(extraInfo));
+    return retval;
+}
+
+void UpdateSequenceRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.write(sequenceID);
+    serializer.write(kCount);
+}
+
+std::unique_ptr<UpdateSequenceRecord> UpdateSequenceRecord::deserialize(
+    Deserializer& deserializer) {
+    auto retVal = std::make_unique<UpdateSequenceRecord>();
+    deserializer.deserializeValue(retVal->sequenceID);
+    deserializer.deserializeValue(retVal->kCount);
+    return retVal;
+}
+
+void TableInsertionRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.writeDebuggingInfo("table_id");
+    serializer.write<table_id_t>(tableID);
+    serializer.writeDebuggingInfo("table_type");
+    serializer.write<TableType>(tableType);
+    serializer.writeDebuggingInfo("num_rows");
+    serializer.write<row_idx_t>(numRows);
+    serializer.writeDebuggingInfo("num_vectors");
+    serializer.write<idx_t>(vectors.size());
+    for (auto& vector : vectors) {
+        vector->serialize(serializer);
+    }
+}
+
+std::unique_ptr<TableInsertionRecord> TableInsertionRecord::deserialize(Deserializer& deserializer,
+    const main::ClientContext& clientContext) {
+    std::string key;
+    table_id_t tableID = INVALID_TABLE_ID;
+    auto tableType = TableType::UNKNOWN;
+    row_idx_t numRows = INVALID_ROW_IDX;
+    idx_t numVectors = 0;
+    std::vector<std::unique_ptr<ValueVector>> valueVectors;
+    deserializer.validateDebuggingInfo(key, "table_id");
+    deserializer.deserializeValue<table_id_t>(tableID);
+    deserializer.validateDebuggingInfo(key, "table_type");
+    deserializer.deserializeValue<TableType>(tableType);
+    deserializer.validateDebuggingInfo(key, "num_rows");
+    deserializer.deserializeValue<row_idx_t>(numRows);
+    deserializer.validateDebuggingInfo(key, "num_vectors");
+    deserializer.deserializeValue(numVectors);
+    auto resultChunkState = DataChunkState::getSingleValueDataChunkState();
+    valueVectors.reserve(numVectors);
+    for (auto i = 0u; i < numVectors; i++) {
+        valueVectors.push_back(ValueVector::deSerialize(deserializer,
+            MemoryManager::Get(clientContext), resultChunkState));
+    }
+    return std::make_unique<TableInsertionRecord>(tableID, tableType, numRows,
+        std::move(valueVectors));
+}
+
+void NodeDeletionRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.writeDebuggingInfo("table_id");
+    serializer.write<table_id_t>(tableID);
+    serializer.writeDebuggingInfo("node_offset");
+    serializer.write<offset_t>(nodeOffset);
+    serializer.writeDebuggingInfo("pk_vector");
+    pkVector->serialize(serializer);
+}
+
+std::unique_ptr<NodeDeletionRecord> NodeDeletionRecord::deserialize(Deserializer& deserializer,
+    const main::ClientContext& clientContext) {
+    std::string key;
+    table_id_t tableID = INVALID_TABLE_ID;
+    offset_t nodeOffset = INVALID_OFFSET;
+
+    deserializer.validateDebuggingInfo(key, "table_id");
+    deserializer.deserializeValue<table_id_t>(tableID);
+    deserializer.validateDebuggingInfo(key, "node_offset");
+    deserializer.deserializeValue<offset_t>(nodeOffset);
+    deserializer.validateDebuggingInfo(key, "pk_vector");
+    auto resultChunkState = std::make_shared<DataChunkState>();
+    auto ownedVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    return std::make_unique<NodeDeletionRecord>(tableID, nodeOffset, std::move(ownedVector));
+}
+
+void NodeUpdateRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.writeDebuggingInfo("table_id");
+    serializer.write<table_id_t>(tableID);
+    serializer.writeDebuggingInfo("column_id");
+    serializer.write<column_id_t>(columnID);
+    serializer.writeDebuggingInfo("node_offset");
+    serializer.write<offset_t>(nodeOffset);
+    serializer.writeDebuggingInfo("property_vector");
+    propertyVector->serialize(serializer);
+}
+
+std::unique_ptr<NodeUpdateRecord> NodeUpdateRecord::deserialize(Deserializer& deserializer,
+    const main::ClientContext& clientContext) {
+    std::string key;
+    table_id_t tableID = INVALID_TABLE_ID;
+    column_id_t columnID = INVALID_COLUMN_ID;
+    offset_t nodeOffset = INVALID_OFFSET;
+
+    deserializer.validateDebuggingInfo(key, "table_id");
+    deserializer.deserializeValue<table_id_t>(tableID);
+    deserializer.validateDebuggingInfo(key, "column_id");
+    deserializer.deserializeValue<column_id_t>(columnID);
+    deserializer.validateDebuggingInfo(key, "node_offset");
+    deserializer.deserializeValue<offset_t>(nodeOffset);
+    deserializer.validateDebuggingInfo(key, "property_vector");
+    auto resultChunkState = std::make_shared<DataChunkState>();
+    auto ownedVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    return std::make_unique<NodeUpdateRecord>(tableID, columnID, nodeOffset,
+        std::move(ownedVector));
+}
+
+void RelDeletionRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.writeDebuggingInfo("table_id");
+    serializer.write<table_id_t>(tableID);
+    serializer.writeDebuggingInfo("src_node_vector");
+    srcNodeIDVector->serialize(serializer);
+    serializer.writeDebuggingInfo("dst_node_vector");
+    dstNodeIDVector->serialize(serializer);
+    serializer.writeDebuggingInfo("rel_id_vector");
+    relIDVector->serialize(serializer);
+}
+
+std::unique_ptr<RelDeletionRecord> RelDeletionRecord::deserialize(Deserializer& deserializer,
+    const main::ClientContext& clientContext) {
+    std::string key;
+    table_id_t tableID = INVALID_TABLE_ID;
+
+    deserializer.validateDebuggingInfo(key, "table_id");
+    deserializer.deserializeValue<table_id_t>(tableID);
+    deserializer.validateDebuggingInfo(key, "src_node_vector");
+    auto resultChunkState = std::make_shared<DataChunkState>();
+    auto srcNodeIDVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    deserializer.validateDebuggingInfo(key, "dst_node_vector");
+    auto dstNodeIDVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    deserializer.validateDebuggingInfo(key, "rel_id_vector");
+    auto relIDVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    return std::make_unique<RelDeletionRecord>(tableID, std::move(srcNodeIDVector),
+        std::move(dstNodeIDVector), std::move(relIDVector));
+}
+
+void RelDetachDeleteRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.writeDebuggingInfo("table_id");
+    serializer.write<table_id_t>(tableID);
+    serializer.writeDebuggingInfo("direction");
+    serializer.write<RelDataDirection>(direction);
+    serializer.writeDebuggingInfo("src_node_vector");
+    srcNodeIDVector->serialize(serializer);
+}
+
+std::unique_ptr<RelDetachDeleteRecord> RelDetachDeleteRecord::deserialize(
+    Deserializer& deserializer, const main::ClientContext& clientContext) {
+    std::string key;
+    table_id_t tableID = INVALID_TABLE_ID;
+    auto direction = RelDataDirection::INVALID;
+
+    deserializer.validateDebuggingInfo(key, "table_id");
+    deserializer.deserializeValue<table_id_t>(tableID);
+    deserializer.validateDebuggingInfo(key, "direction");
+    deserializer.deserializeValue<RelDataDirection>(direction);
+    deserializer.validateDebuggingInfo(key, "src_node_vector");
+    auto resultChunkState = std::make_shared<DataChunkState>();
+    auto srcNodeIDVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    return std::make_unique<RelDetachDeleteRecord>(tableID, direction, std::move(srcNodeIDVector));
+}
+
+void RelUpdateRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.writeDebuggingInfo("table_id");
+    serializer.write<table_id_t>(tableID);
+    serializer.writeDebuggingInfo("column_id");
+    serializer.write<column_id_t>(columnID);
+    serializer.writeDebuggingInfo("src_node_vector");
+    srcNodeIDVector->serialize(serializer);
+    serializer.writeDebuggingInfo("dst_node_vector");
+    dstNodeIDVector->serialize(serializer);
+    serializer.writeDebuggingInfo("rel_id_vector");
+    relIDVector->serialize(serializer);
+    serializer.writeDebuggingInfo("property_vector");
+    propertyVector->serialize(serializer);
+}
+
+std::unique_ptr<RelUpdateRecord> RelUpdateRecord::deserialize(Deserializer& deserializer,
+    const main::ClientContext& clientContext) {
+    std::string key;
+    table_id_t tableID = INVALID_TABLE_ID;
+    column_id_t columnID = INVALID_COLUMN_ID;
+
+    deserializer.validateDebuggingInfo(key, "table_id");
+    deserializer.deserializeValue<table_id_t>(tableID);
+    deserializer.validateDebuggingInfo(key, "column_id");
+    deserializer.deserializeValue<column_id_t>(columnID);
+    deserializer.validateDebuggingInfo(key, "src_node_vector");
+    auto resultChunkState = std::make_shared<DataChunkState>();
+    auto srcNodeIDVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    deserializer.validateDebuggingInfo(key, "dst_node_vector");
+    auto dstNodeIDVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    deserializer.validateDebuggingInfo(key, "rel_id_vector");
+    auto relIDVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    deserializer.validateDebuggingInfo(key, "property_vector");
+    auto propertyVector =
+        ValueVector::deSerialize(deserializer, MemoryManager::Get(clientContext), resultChunkState);
+    return std::make_unique<RelUpdateRecord>(tableID, columnID, std::move(srcNodeIDVector),
+        std::move(dstNodeIDVector), std::move(relIDVector), std::move(propertyVector));
+}
+
+void LoadExtensionRecord::serialize(Serializer& serializer) const {
+    WALRecord::serialize(serializer);
+    serializer.writeDebuggingInfo("path");
+    serializer.write<std::string>(path);
+}
+
+std::unique_ptr<LoadExtensionRecord> LoadExtensionRecord::deserialize(Deserializer& deserializer) {
+    std::string key;
+    deserializer.validateDebuggingInfo(key, "path");
+    std::string path;
+    deserializer.deserializeValue<std::string>(path);
+    return std::make_unique<LoadExtensionRecord>(std::move(path));
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/wal_replayer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/wal_replayer.cpp
new file mode 100644
index 0000000000..6f1996dd44
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/storage/wal/wal_replayer.cpp
@@ -0,0 +1,592 @@
+#include "storage/wal/wal_replayer.h"
+
+#include "binder/binder.h"
+#include "catalog/catalog_entry/scalar_macro_catalog_entry.h"
+#include "catalog/catalog_entry/sequence_catalog_entry.h"
+#include "catalog/catalog_entry/table_catalog_entry.h"
+#include "catalog/catalog_entry/type_catalog_entry.h"
+#include "common/file_system/file_info.h"
+#include "common/file_system/file_system.h"
+#include "common/file_system/virtual_file_system.h"
+#include "common/serializer/buffered_file.h"
+#include "extension/extension_manager.h"
+#include "main/client_context.h"
+#include "processor/expression_mapper.h"
+#include "storage/file_db_id_utils.h"
+#include "storage/local_storage/local_rel_table.h"
+#include "storage/storage_manager.h"
+#include "storage/table/node_table.h"
+#include "storage/table/rel_table.h"
+#include "storage/wal/checksum_reader.h"
+#include "storage/wal/wal_record.h"
+#include "transaction/transaction_context.h"
+
+using namespace lbug::binder;
+using namespace lbug::catalog;
+using namespace lbug::common;
+using namespace lbug::processor;
+using namespace lbug::storage;
+using namespace lbug::transaction;
+
+namespace lbug {
+namespace storage {
+
+static constexpr std::string_view checksumMismatchMessage =
+    "Checksum verification failed, the WAL file is corrupted.";
+
+WALReplayer::WALReplayer(main::ClientContext& clientContext) : clientContext{clientContext} {
+    walPath = StorageUtils::getWALFilePath(clientContext.getDatabasePath());
+    shadowFilePath = StorageUtils::getShadowFilePath(clientContext.getDatabasePath());
+}
+
+static WALHeader readWALHeader(Deserializer& deserializer) {
+    WALHeader header{};
+    deserializer.deserializeValue(header.databaseID);
+
+    // It is possible to read a value other than 0/1 when deserializing the flag
+    // This causes some weird behaviours with some toolchains so we manually do the conversion here
+    uint8_t enableChecksumsBytes = 0;
+    deserializer.deserializeValue(enableChecksumsBytes);
+    header.enableChecksums = enableChecksumsBytes != 0;
+
+    return header;
+}
+
+static Deserializer initDeserializer(FileInfo& fileInfo, main::ClientContext& clientContext,
+    bool enableChecksums) {
+    if (enableChecksums) {
+        return Deserializer{std::make_unique<ChecksumReader>(fileInfo,
+            *MemoryManager::Get(clientContext), checksumMismatchMessage)};
+    } else {
+        return Deserializer{std::make_unique<BufferedFileReader>(fileInfo)};
+    }
+}
+
+static void checkWALHeader(const WALHeader& header, bool enableChecksums) {
+    if (enableChecksums != header.enableChecksums) {
+        throw RuntimeException(stringFormat(
+            "The database you are trying to open was serialized with enableChecksums={} but you "
+            "are trying to open it with enableChecksums={}. Please open your database using the "
+            "correct enableChecksums config. If you wish to change this for your database, please "
+            "use the export/import functionality.",
+            TypeUtils::toString(header.enableChecksums), TypeUtils::toString(enableChecksums)));
+    }
+}
+
+static uint64_t getReadOffset(Deserializer& deSer, bool enableChecksums) {
+    if (enableChecksums) {
+        return deSer.getReader()->cast<ChecksumReader>()->getReadOffset();
+    } else {
+        return deSer.getReader()->cast<BufferedFileReader>()->getReadOffset();
+    }
+}
+
+void WALReplayer::replay(bool throwOnWalReplayFailure, bool enableChecksums) const {
+    auto vfs = VirtualFileSystem::GetUnsafe(clientContext);
+    Checkpointer checkpointer(clientContext);
+    // First, check if the WAL file exists. If it does not, we can safely remove the shadow file.
+    if (!vfs->fileOrPathExists(walPath, &clientContext)) {
+        removeFileIfExists(shadowFilePath);
+        // Read the checkpointed data from the disk.
+        checkpointer.readCheckpoint();
+        return;
+    }
+    // If the WAL file exists, we need to replay it.
+    auto fileInfo = openWALFile();
+    // Check if the wal file is empty. If so, we do not need to replay anything.
+    if (fileInfo->getFileSize() == 0) {
+        removeWALAndShadowFiles();
+        // Read the checkpointed data from the disk.
+        checkpointer.readCheckpoint();
+        return;
+    }
+    // A previous unclean exit may have left non-durable contents in the WAL, so before we start
+    // replaying the WAL records, make a best-effort attempt at ensuring the WAL is fully durable.
+    syncWALFile(*fileInfo);
+
+    // Start replaying the WAL records.
+    try {
+        // First, we dry run the replay to find out the offset of the last record that was
+        // CHECKPOINT or COMMIT.
+        auto [offsetDeserialized, isLastRecordCheckpoint] =
+            dryReplay(*fileInfo, throwOnWalReplayFailure, enableChecksums);
+        if (isLastRecordCheckpoint) {
+            // If the last record is a checkpoint, we resume by replaying the shadow file.
+            ShadowFile::replayShadowPageRecords(clientContext);
+            removeWALAndShadowFiles();
+            // Re-read checkpointed data from disk again as now the shadow file is applied.
+            checkpointer.readCheckpoint();
+        } else {
+            // There is no checkpoint record, so we should remove the shadow file if it exists.
+            removeFileIfExists(shadowFilePath);
+            // Read the checkpointed data from the disk.
+            checkpointer.readCheckpoint();
+            // Resume by replaying the WAL file from the beginning until the last COMMIT record.
+            Deserializer deserializer = initDeserializer(*fileInfo, clientContext, enableChecksums);
+
+            if (offsetDeserialized > 0) {
+                // Make sure the WAL file is for the current database
+                deserializer.getReader()->onObjectBegin();
+                const auto walHeader = readWALHeader(deserializer);
+                FileDBIDUtils::verifyDatabaseID(*fileInfo,
+                    StorageManager::Get(clientContext)->getOrInitDatabaseID(clientContext),
+                    walHeader.databaseID);
+                deserializer.getReader()->onObjectEnd();
+            }
+
+            while (getReadOffset(deserializer, enableChecksums) < offsetDeserialized) {
+                KU_ASSERT(!deserializer.finished());
+                auto walRecord = WALRecord::deserialize(deserializer, clientContext);
+                replayWALRecord(*walRecord);
+            }
+            // After replaying all the records, we should truncate the WAL file to the last
+            // COMMIT/CHECKPOINT record.
+            truncateWALFile(*fileInfo, offsetDeserialized);
+        }
+    } catch (const std::exception&) {
+        auto transactionContext = TransactionContext::Get(clientContext);
+        if (transactionContext->hasActiveTransaction()) {
+            // Handle the case that some transaction went during replaying. We should roll back
+            // under this case. Usually this shouldn't happen, but it is possible if we have a bug
+            // with the replay logic. This is to handle cases like that so we don't corrupt
+            // transactions that have been replayed.
+            transactionContext->rollback();
+        }
+        throw;
+    }
+}
+
+WALReplayer::WALReplayInfo WALReplayer::dryReplay(FileInfo& fileInfo, bool throwOnWalReplayFailure,
+    bool enableChecksums) const {
+    uint64_t offsetDeserialized = 0;
+    bool isLastRecordCheckpoint = false;
+    try {
+        Deserializer deserializer = initDeserializer(fileInfo, clientContext, enableChecksums);
+
+        // Skip the databaseID here, we'll verify it when we actually replay
+        deserializer.getReader()->onObjectBegin();
+        const auto walHeader = readWALHeader(deserializer);
+        checkWALHeader(walHeader, enableChecksums);
+        deserializer.getReader()->onObjectEnd();
+
+        bool finishedDeserializing = deserializer.finished();
+        while (!finishedDeserializing) {
+            auto walRecord = WALRecord::deserialize(deserializer, clientContext);
+            finishedDeserializing = deserializer.finished();
+            switch (walRecord->type) {
+            case WALRecordType::CHECKPOINT_RECORD: {
+                KU_ASSERT(finishedDeserializing);
+                // If we reach a checkpoint record, we can stop replaying.
+                isLastRecordCheckpoint = true;
+                finishedDeserializing = true;
+                offsetDeserialized = getReadOffset(deserializer, enableChecksums);
+            } break;
+            case WALRecordType::COMMIT_RECORD: {
+                // Update the offset to the end of the last commit record.
+                offsetDeserialized = getReadOffset(deserializer, enableChecksums);
+            } break;
+            default: {
+                // DO NOTHING.
+            }
+            }
+        }
+    } catch (...) {
+        // If we hit an exception while deserializing, we assume that the WAL file is (partially)
+        // corrupted. This should only happen for records of the last transaction recorded.
+        if (throwOnWalReplayFailure) {
+            throw;
+        }
+    }
+    return {offsetDeserialized, isLastRecordCheckpoint};
+}
+
+void WALReplayer::replayWALRecord(WALRecord& walRecord) const {
+    switch (walRecord.type) {
+    case WALRecordType::BEGIN_TRANSACTION_RECORD: {
+        TransactionContext::Get(clientContext)->beginRecoveryTransaction();
+    } break;
+    case WALRecordType::COMMIT_RECORD: {
+        TransactionContext::Get(clientContext)->commit();
+    } break;
+    case WALRecordType::CREATE_CATALOG_ENTRY_RECORD: {
+        replayCreateCatalogEntryRecord(walRecord);
+    } break;
+    case WALRecordType::DROP_CATALOG_ENTRY_RECORD: {
+        replayDropCatalogEntryRecord(walRecord);
+    } break;
+    case WALRecordType::ALTER_TABLE_ENTRY_RECORD: {
+        replayAlterTableEntryRecord(walRecord);
+    } break;
+    case WALRecordType::TABLE_INSERTION_RECORD: {
+        replayTableInsertionRecord(walRecord);
+    } break;
+    case WALRecordType::NODE_DELETION_RECORD: {
+        replayNodeDeletionRecord(walRecord);
+    } break;
+    case WALRecordType::NODE_UPDATE_RECORD: {
+        replayNodeUpdateRecord(walRecord);
+    } break;
+    case WALRecordType::REL_DELETION_RECORD: {
+        replayRelDeletionRecord(walRecord);
+    } break;
+    case WALRecordType::REL_DETACH_DELETE_RECORD: {
+        replayRelDetachDeletionRecord(walRecord);
+    } break;
+    case WALRecordType::REL_UPDATE_RECORD: {
+        replayRelUpdateRecord(walRecord);
+    } break;
+    case WALRecordType::COPY_TABLE_RECORD: {
+        replayCopyTableRecord(walRecord);
+    } break;
+    case WALRecordType::UPDATE_SEQUENCE_RECORD: {
+        replayUpdateSequenceRecord(walRecord);
+    } break;
+    case WALRecordType::LOAD_EXTENSION_RECORD: {
+        replayLoadExtensionRecord(walRecord);
+    } break;
+    case WALRecordType::CHECKPOINT_RECORD: {
+        // This record should not be replayed. It is only used to indicate that the previous records
+        // had been replayed and shadow files are created.
+        KU_UNREACHABLE;
+    }
+    default:
+        KU_UNREACHABLE;
+    }
+}
+
+void WALReplayer::replayCreateCatalogEntryRecord(WALRecord& walRecord) const {
+    auto catalog = Catalog::Get(clientContext);
+    auto transaction = transaction::Transaction::Get(clientContext);
+    auto storageManager = StorageManager::Get(clientContext);
+    auto& record = walRecord.cast<CreateCatalogEntryRecord>();
+    switch (record.ownedCatalogEntry->getType()) {
+    case CatalogEntryType::NODE_TABLE_ENTRY:
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        auto& entry = record.ownedCatalogEntry->constCast<TableCatalogEntry>();
+        auto newEntry = catalog->createTableEntry(transaction,
+            entry.getBoundCreateTableInfo(transaction, record.isInternal));
+        storageManager->createTable(newEntry->ptrCast<TableCatalogEntry>());
+    } break;
+    case CatalogEntryType::SCALAR_MACRO_ENTRY: {
+        auto& macroEntry = record.ownedCatalogEntry->constCast<ScalarMacroCatalogEntry>();
+        catalog->addScalarMacroFunction(transaction, macroEntry.getName(),
+            macroEntry.getMacroFunction()->copy());
+    } break;
+    case CatalogEntryType::SEQUENCE_ENTRY: {
+        auto& sequenceEntry = record.ownedCatalogEntry->constCast<SequenceCatalogEntry>();
+        catalog->createSequence(transaction,
+            sequenceEntry.getBoundCreateSequenceInfo(record.isInternal));
+    } break;
+    case CatalogEntryType::TYPE_ENTRY: {
+        auto& typeEntry = record.ownedCatalogEntry->constCast<TypeCatalogEntry>();
+        catalog->createType(transaction, typeEntry.getName(), typeEntry.getLogicalType().copy());
+    } break;
+    case CatalogEntryType::INDEX_ENTRY: {
+        catalog->createIndex(transaction, std::move(record.ownedCatalogEntry));
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+void WALReplayer::replayDropCatalogEntryRecord(const WALRecord& walRecord) const {
+    auto& dropEntryRecord = walRecord.constCast<DropCatalogEntryRecord>();
+    auto catalog = Catalog::Get(clientContext);
+    auto transaction = transaction::Transaction::Get(clientContext);
+    const auto entryID = dropEntryRecord.entryID;
+    switch (dropEntryRecord.entryType) {
+    case CatalogEntryType::NODE_TABLE_ENTRY:
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        KU_ASSERT(Catalog::Get(clientContext));
+        catalog->dropTableEntry(transaction, entryID);
+    } break;
+    case CatalogEntryType::SEQUENCE_ENTRY: {
+        catalog->dropSequence(transaction, entryID);
+    } break;
+    case CatalogEntryType::INDEX_ENTRY: {
+        catalog->dropIndex(transaction, entryID);
+    } break;
+    case CatalogEntryType::SCALAR_MACRO_ENTRY: {
+        catalog->dropMacroEntry(transaction, entryID);
+    } break;
+    default: {
+        KU_UNREACHABLE;
+    }
+    }
+}
+
+void WALReplayer::replayAlterTableEntryRecord(const WALRecord& walRecord) const {
+    auto binder = Binder(&clientContext);
+    auto& alterEntryRecord = walRecord.constCast<AlterTableEntryRecord>();
+    auto catalog = Catalog::Get(clientContext);
+    auto transaction = transaction::Transaction::Get(clientContext);
+    auto storageManager = StorageManager::Get(clientContext);
+    auto ownedAlterInfo = alterEntryRecord.ownedAlterInfo.get();
+    catalog->alterTableEntry(transaction, *ownedAlterInfo);
+    auto& pageAllocator = *PageManager::Get(clientContext);
+    switch (ownedAlterInfo->alterType) {
+    case AlterType::ADD_PROPERTY: {
+        const auto exprBinder = binder.getExpressionBinder();
+        const auto addInfo = ownedAlterInfo->extraInfo->constPtrCast<BoundExtraAddPropertyInfo>();
+        // We don't implicit cast here since it must already be done the first time
+        const auto boundDefault =
+            exprBinder->bindExpression(*addInfo->propertyDefinition.defaultExpr);
+        auto exprMapper = ExpressionMapper();
+        const auto defaultValueEvaluator = exprMapper.getEvaluator(boundDefault);
+        defaultValueEvaluator->init(ResultSet(0) /* dummy ResultSet */, &clientContext);
+        const auto entry = catalog->getTableCatalogEntry(transaction, ownedAlterInfo->tableName);
+        const auto& addedProp = entry->getProperty(addInfo->propertyDefinition.getName());
+        TableAddColumnState state{addedProp, *defaultValueEvaluator};
+        KU_ASSERT(StorageManager::Get(clientContext));
+        switch (entry->getTableType()) {
+        case TableType::REL: {
+            for (auto& relEntryInfo : entry->cast<RelGroupCatalogEntry>().getRelEntryInfos()) {
+                storageManager->getTable(relEntryInfo.oid)
+                    ->addColumn(transaction, state, pageAllocator);
+            }
+        } break;
+        case TableType::NODE: {
+            storageManager->getTable(entry->getTableID())
+                ->addColumn(transaction, state, pageAllocator);
+        } break;
+        default: {
+            KU_UNREACHABLE;
+        }
+        }
+    } break;
+    case AlterType::ADD_FROM_TO_CONNECTION: {
+        auto extraInfo = ownedAlterInfo->extraInfo->constPtrCast<BoundExtraAlterFromToConnection>();
+        auto relGroupEntry = catalog->getTableCatalogEntry(transaction, ownedAlterInfo->tableName)
+                                 ->ptrCast<RelGroupCatalogEntry>();
+        auto relEntryInfo =
+            relGroupEntry->getRelEntryInfo(extraInfo->fromTableID, extraInfo->toTableID);
+        storageManager->addRelTable(relGroupEntry, *relEntryInfo);
+    } break;
+    default:
+        break;
+    }
+}
+
+void WALReplayer::replayTableInsertionRecord(const WALRecord& walRecord) const {
+    const auto& insertionRecord = walRecord.constCast<TableInsertionRecord>();
+    switch (insertionRecord.tableType) {
+    case TableType::NODE: {
+        replayNodeTableInsertRecord(walRecord);
+    } break;
+    case TableType::REL: {
+        replayRelTableInsertRecord(walRecord);
+    } break;
+    default: {
+        throw RuntimeException("Invalid table type for insertion replay in WAL record.");
+    }
+    }
+}
+
+void WALReplayer::replayNodeTableInsertRecord(const WALRecord& walRecord) const {
+    const auto& insertionRecord = walRecord.constCast<TableInsertionRecord>();
+    const auto tableID = insertionRecord.tableID;
+    auto& table = StorageManager::Get(clientContext)->getTable(tableID)->cast<NodeTable>();
+    KU_ASSERT(!insertionRecord.ownedVectors.empty());
+    const auto anchorState = insertionRecord.ownedVectors[0]->state;
+    const auto numNodes = anchorState->getSelVector().getSelSize();
+    for (auto i = 0u; i < insertionRecord.ownedVectors.size(); i++) {
+        insertionRecord.ownedVectors[i]->setState(anchorState);
+    }
+    std::vector<ValueVector*> propertyVectors(insertionRecord.ownedVectors.size());
+    for (auto i = 0u; i < insertionRecord.ownedVectors.size(); i++) {
+        propertyVectors[i] = insertionRecord.ownedVectors[i].get();
+    }
+    KU_ASSERT(table.getPKColumnID() < insertionRecord.ownedVectors.size());
+    auto& pkVector = *insertionRecord.ownedVectors[table.getPKColumnID()];
+    const auto nodeIDVector = std::make_unique<ValueVector>(LogicalType::INTERNAL_ID());
+    nodeIDVector->setState(anchorState);
+    const auto insertState =
+        std::make_unique<NodeTableInsertState>(*nodeIDVector, pkVector, propertyVectors);
+    KU_ASSERT(transaction::Transaction::Get(clientContext) &&
+              transaction::Transaction::Get(clientContext)->isRecovery());
+    table.initInsertState(&clientContext, *insertState);
+    anchorState->getSelVectorUnsafe().setToFiltered(1);
+    for (auto i = 0u; i < numNodes; i++) {
+        anchorState->getSelVectorUnsafe()[0] = i;
+        table.insert(transaction::Transaction::Get(clientContext), *insertState);
+    }
+}
+
+void WALReplayer::replayRelTableInsertRecord(const WALRecord& walRecord) const {
+    const auto& insertionRecord = walRecord.constCast<TableInsertionRecord>();
+    const auto tableID = insertionRecord.tableID;
+    auto& table = StorageManager::Get(clientContext)->getTable(tableID)->cast<RelTable>();
+    KU_ASSERT(!insertionRecord.ownedVectors.empty());
+    const auto anchorState = insertionRecord.ownedVectors[0]->state;
+    const auto numRels = anchorState->getSelVector().getSelSize();
+    anchorState->getSelVectorUnsafe().setToFiltered(1);
+    for (auto i = 0u; i < insertionRecord.ownedVectors.size(); i++) {
+        insertionRecord.ownedVectors[i]->setState(anchorState);
+    }
+    std::vector<ValueVector*> propertyVectors;
+    for (auto i = 0u; i < insertionRecord.ownedVectors.size(); i++) {
+        if (i < LOCAL_REL_ID_COLUMN_ID) {
+            // Skip the first two vectors which are the src nodeID and the dst nodeID.
+            continue;
+        }
+        propertyVectors.push_back(insertionRecord.ownedVectors[i].get());
+    }
+    const auto insertState = std::make_unique<RelTableInsertState>(
+        *insertionRecord.ownedVectors[LOCAL_BOUND_NODE_ID_COLUMN_ID],
+        *insertionRecord.ownedVectors[LOCAL_NBR_NODE_ID_COLUMN_ID], propertyVectors);
+    KU_ASSERT(transaction::Transaction::Get(clientContext) &&
+              transaction::Transaction::Get(clientContext)->isRecovery());
+    for (auto i = 0u; i < numRels; i++) {
+        anchorState->getSelVectorUnsafe()[0] = i;
+        table.initInsertState(&clientContext, *insertState);
+        table.insert(transaction::Transaction::Get(clientContext), *insertState);
+    }
+}
+
+void WALReplayer::replayNodeDeletionRecord(const WALRecord& walRecord) const {
+    const auto& deletionRecord = walRecord.constCast<NodeDeletionRecord>();
+    const auto tableID = deletionRecord.tableID;
+    auto& table = StorageManager::Get(clientContext)->getTable(tableID)->cast<NodeTable>();
+    const auto anchorState = deletionRecord.ownedPKVector->state;
+    KU_ASSERT(anchorState->getSelVector().getSelSize() == 1);
+    const auto nodeIDVector = std::make_unique<ValueVector>(LogicalType::INTERNAL_ID());
+    nodeIDVector->setState(anchorState);
+    nodeIDVector->setValue<internalID_t>(0,
+        internalID_t{deletionRecord.nodeOffset, deletionRecord.tableID});
+    const auto deleteState =
+        std::make_unique<NodeTableDeleteState>(*nodeIDVector, *deletionRecord.ownedPKVector);
+    KU_ASSERT(transaction::Transaction::Get(clientContext) &&
+              transaction::Transaction::Get(clientContext)->isRecovery());
+    table.delete_(transaction::Transaction::Get(clientContext), *deleteState);
+}
+
+void WALReplayer::replayNodeUpdateRecord(const WALRecord& walRecord) const {
+    const auto& updateRecord = walRecord.constCast<NodeUpdateRecord>();
+    const auto tableID = updateRecord.tableID;
+    auto& table = StorageManager::Get(clientContext)->getTable(tableID)->cast<NodeTable>();
+    const auto anchorState = updateRecord.ownedPropertyVector->state;
+    KU_ASSERT(anchorState->getSelVector().getSelSize() == 1);
+    const auto nodeIDVector = std::make_unique<ValueVector>(LogicalType::INTERNAL_ID());
+    nodeIDVector->setState(anchorState);
+    nodeIDVector->setValue<internalID_t>(0,
+        internalID_t{updateRecord.nodeOffset, updateRecord.tableID});
+    const auto updateState = std::make_unique<NodeTableUpdateState>(updateRecord.columnID,
+        *nodeIDVector, *updateRecord.ownedPropertyVector);
+    KU_ASSERT(transaction::Transaction::Get(clientContext) &&
+              transaction::Transaction::Get(clientContext)->isRecovery());
+    table.update(transaction::Transaction::Get(clientContext), *updateState);
+}
+
+void WALReplayer::replayRelDeletionRecord(const WALRecord& walRecord) const {
+    const auto& deletionRecord = walRecord.constCast<RelDeletionRecord>();
+    const auto tableID = deletionRecord.tableID;
+    auto& table = StorageManager::Get(clientContext)->getTable(tableID)->cast<RelTable>();
+    const auto anchorState = deletionRecord.ownedRelIDVector->state;
+    KU_ASSERT(anchorState->getSelVector().getSelSize() == 1);
+    const auto deleteState =
+        std::make_unique<RelTableDeleteState>(*deletionRecord.ownedSrcNodeIDVector,
+            *deletionRecord.ownedDstNodeIDVector, *deletionRecord.ownedRelIDVector);
+    KU_ASSERT(transaction::Transaction::Get(clientContext) &&
+              transaction::Transaction::Get(clientContext)->isRecovery());
+    table.delete_(transaction::Transaction::Get(clientContext), *deleteState);
+}
+
+void WALReplayer::replayRelDetachDeletionRecord(const WALRecord& walRecord) const {
+    const auto& deletionRecord = walRecord.constCast<RelDetachDeleteRecord>();
+    const auto tableID = deletionRecord.tableID;
+    auto& table = StorageManager::Get(clientContext)->getTable(tableID)->cast<RelTable>();
+    KU_ASSERT(transaction::Transaction::Get(clientContext) &&
+              transaction::Transaction::Get(clientContext)->isRecovery());
+    const auto anchorState = deletionRecord.ownedSrcNodeIDVector->state;
+    KU_ASSERT(anchorState->getSelVector().getSelSize() == 1);
+    const auto dstNodeIDVector =
+        std::make_unique<ValueVector>(LogicalType{LogicalTypeID::INTERNAL_ID});
+    const auto relIDVector = std::make_unique<ValueVector>(LogicalType{LogicalTypeID::INTERNAL_ID});
+    dstNodeIDVector->setState(anchorState);
+    relIDVector->setState(anchorState);
+    const auto deleteState = std::make_unique<RelTableDeleteState>(
+        *deletionRecord.ownedSrcNodeIDVector, *dstNodeIDVector, *relIDVector);
+    deleteState->detachDeleteDirection = deletionRecord.direction;
+    table.detachDelete(transaction::Transaction::Get(clientContext), deleteState.get());
+}
+
+void WALReplayer::replayRelUpdateRecord(const WALRecord& walRecord) const {
+    const auto& updateRecord = walRecord.constCast<RelUpdateRecord>();
+    const auto tableID = updateRecord.tableID;
+    auto& table = StorageManager::Get(clientContext)->getTable(tableID)->cast<RelTable>();
+    const auto anchorState = updateRecord.ownedRelIDVector->state;
+    KU_ASSERT(anchorState == updateRecord.ownedSrcNodeIDVector->state &&
+              anchorState == updateRecord.ownedSrcNodeIDVector->state &&
+              anchorState == updateRecord.ownedPropertyVector->state);
+    KU_ASSERT(anchorState->getSelVector().getSelSize() == 1);
+    const auto updateState = std::make_unique<RelTableUpdateState>(updateRecord.columnID,
+        *updateRecord.ownedSrcNodeIDVector, *updateRecord.ownedDstNodeIDVector,
+        *updateRecord.ownedRelIDVector, *updateRecord.ownedPropertyVector);
+    KU_ASSERT(transaction::Transaction::Get(clientContext) &&
+              transaction::Transaction::Get(clientContext)->isRecovery());
+    table.update(transaction::Transaction::Get(clientContext), *updateState);
+}
+
+void WALReplayer::replayCopyTableRecord(const WALRecord&) const {
+    // DO NOTHING.
+}
+
+void WALReplayer::replayUpdateSequenceRecord(const WALRecord& walRecord) const {
+    auto& sequenceEntryRecord = walRecord.constCast<UpdateSequenceRecord>();
+    const auto sequenceID = sequenceEntryRecord.sequenceID;
+    const auto entry =
+        Catalog::Get(clientContext)
+            ->getSequenceEntry(transaction::Transaction::Get(clientContext), sequenceID);
+    entry->nextKVal(transaction::Transaction::Get(clientContext), sequenceEntryRecord.kCount);
+}
+
+void WALReplayer::replayLoadExtensionRecord(const WALRecord& walRecord) const {
+    const auto& loadExtensionRecord = walRecord.constCast<LoadExtensionRecord>();
+    extension::ExtensionManager::Get(clientContext)
+        ->loadExtension(loadExtensionRecord.path, &clientContext);
+}
+
+void WALReplayer::removeWALAndShadowFiles() const {
+    removeFileIfExists(shadowFilePath);
+    removeFileIfExists(walPath);
+}
+
+void WALReplayer::removeFileIfExists(const std::string& path) const {
+    if (StorageManager::Get(clientContext)->isReadOnly()) {
+        return;
+    }
+    auto vfs = VirtualFileSystem::GetUnsafe(clientContext);
+    if (vfs->fileOrPathExists(path, &clientContext)) {
+        vfs->removeFileIfExists(path);
+    }
+}
+
+std::unique_ptr<FileInfo> WALReplayer::openWALFile() const {
+    auto flag = FileFlags::READ_ONLY;
+    if (!StorageManager::Get(clientContext)->isReadOnly()) {
+        flag |= FileFlags::WRITE; // The write flag here is to ensure the file is opened with O_RDWR
+                                  // so that we can sync it.
+    }
+    return VirtualFileSystem::GetUnsafe(clientContext)->openFile(walPath, FileOpenFlags(flag));
+}
+
+void WALReplayer::syncWALFile(const FileInfo& fileInfo) const {
+    if (StorageManager::Get(clientContext)->isReadOnly()) {
+        return;
+    }
+    fileInfo.syncFile();
+}
+
+void WALReplayer::truncateWALFile(FileInfo& fileInfo, uint64_t size) const {
+    if (StorageManager::Get(clientContext)->isReadOnly()) {
+        return;
+    }
+    if (fileInfo.getFileSize() > size) {
+        fileInfo.truncate(size);
+        fileInfo.syncFile();
+    }
+}
+
+} // namespace storage
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/CMakeLists.txt
new file mode 100644
index 0000000000..c833479015
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/CMakeLists.txt
@@ -0,0 +1,9 @@
+add_library(lbug_transaction
+        OBJECT
+        transaction.cpp
+        transaction_context.cpp
+        transaction_manager.cpp)
+
+set(ALL_OBJECT_FILES
+        ${ALL_OBJECT_FILES} $<TARGET_OBJECTS:lbug_transaction>
+        PARENT_SCOPE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/transaction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/transaction.cpp
new file mode 100644
index 0000000000..c8d027e74e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/transaction.cpp
@@ -0,0 +1,222 @@
+#include "transaction/transaction.h"
+
+#include "common/exception/runtime.h"
+#include "main/client_context.h"
+#include "main/db_config.h"
+#include "storage/local_storage/local_node_table.h"
+#include "storage/local_storage/local_storage.h"
+#include "storage/storage_manager.h"
+#include "storage/undo_buffer.h"
+#include "storage/wal/local_wal.h"
+#include "transaction/transaction_context.h"
+
+using namespace lbug::catalog;
+
+namespace lbug {
+namespace transaction {
+
+bool LocalCacheManager::put(std::unique_ptr<LocalCacheObject> object) {
+    std::unique_lock lck{mtx};
+    const auto key = object->getKey();
+    if (cachedObjects.contains(key)) {
+        return false;
+    }
+    cachedObjects[object->getKey()] = std::move(object);
+    return true;
+}
+
+Transaction::Transaction(main::ClientContext& clientContext, TransactionType transactionType,
+    common::transaction_t transactionID, common::transaction_t startTS)
+    : type{transactionType}, ID{transactionID}, startTS{startTS},
+      commitTS{common::INVALID_TRANSACTION}, forceCheckpoint{false}, hasCatalogChanges{false} {
+    this->clientContext = &clientContext;
+    localStorage = std::make_unique<storage::LocalStorage>(clientContext);
+    undoBuffer = std::make_unique<storage::UndoBuffer>(storage::MemoryManager::Get(clientContext));
+    currentTS = common::Timestamp::getCurrentTimestamp().value;
+    localWAL = std::make_unique<storage::LocalWAL>(*storage::MemoryManager::Get(clientContext),
+        clientContext.getDBConfig()->enableChecksums);
+}
+
+Transaction::Transaction(TransactionType transactionType) noexcept
+    : type{transactionType}, ID{DUMMY_TRANSACTION_ID}, startTS{DUMMY_START_TIMESTAMP},
+      commitTS{common::INVALID_TRANSACTION}, clientContext{nullptr}, undoBuffer{nullptr},
+      forceCheckpoint{false}, hasCatalogChanges{false} {
+    currentTS = common::Timestamp::getCurrentTimestamp().value;
+}
+
+Transaction::Transaction(TransactionType transactionType, common::transaction_t ID,
+    common::transaction_t startTS) noexcept
+    : type{transactionType}, ID{ID}, startTS{startTS}, commitTS{common::INVALID_TRANSACTION},
+      clientContext{nullptr}, undoBuffer{nullptr}, forceCheckpoint{false},
+      hasCatalogChanges{false} {
+    currentTS = common::Timestamp::getCurrentTimestamp().value;
+}
+
+bool Transaction::shouldLogToWAL() const {
+    return isWriteTransaction() && !clientContext->isInMemory();
+}
+
+bool Transaction::shouldForceCheckpoint() const {
+    return !clientContext->isInMemory() && forceCheckpoint;
+}
+
+void Transaction::commit(storage::WAL* wal) {
+    localStorage->commit();
+    undoBuffer->commit(commitTS);
+    if (shouldLogToWAL()) {
+        KU_ASSERT(localWAL && wal);
+        localWAL->logCommit();
+        wal->logCommittedWAL(*localWAL, clientContext);
+        localWAL->clear();
+    }
+    if (hasCatalogChanges) {
+        Catalog::Get(*clientContext)->incrementVersion();
+        hasCatalogChanges = false;
+    }
+}
+
+void Transaction::rollback(storage::WAL*) {
+    // Rolling back the local storage will free + evict all optimistically-allocated pages
+    // Since the undo buffer may do some scanning (e.g. to delete inserted keys from the hash index)
+    // this must be rolled back first
+    undoBuffer->rollback(clientContext);
+    localStorage->rollback();
+    hasCatalogChanges = false;
+}
+
+bool Transaction::isUnCommitted(common::table_id_t tableID, common::offset_t nodeOffset) const {
+    return localStorage && localStorage->getLocalTable(tableID) &&
+           nodeOffset >= getMinUncommittedNodeOffset(tableID);
+}
+
+void Transaction::pushCreateDropCatalogEntry(CatalogSet& catalogSet, CatalogEntry& catalogEntry,
+    bool isInternal, bool skipLoggingToWAL) {
+    undoBuffer->createCatalogEntry(catalogSet, catalogEntry);
+    hasCatalogChanges = true;
+    if (!shouldLogToWAL() || skipLoggingToWAL) {
+        return;
+    }
+    KU_ASSERT(localWAL);
+    const auto newCatalogEntry = catalogEntry.getNext();
+    switch (newCatalogEntry->getType()) {
+    case CatalogEntryType::INDEX_ENTRY:
+    case CatalogEntryType::NODE_TABLE_ENTRY:
+    case CatalogEntryType::REL_GROUP_ENTRY: {
+        if (catalogEntry.getType() == CatalogEntryType::DUMMY_ENTRY) {
+            KU_ASSERT(catalogEntry.isDeleted());
+            localWAL->logCreateCatalogEntryRecord(newCatalogEntry, isInternal);
+        } else {
+            throw common::RuntimeException("This shouldn't happen. Alter table is not supported.");
+        }
+    } break;
+    case CatalogEntryType::SEQUENCE_ENTRY: {
+        KU_ASSERT(
+            catalogEntry.getType() == CatalogEntryType::DUMMY_ENTRY && catalogEntry.isDeleted());
+        if (newCatalogEntry->hasParent()) {
+            // We don't log SERIAL catalog entry creation as it is implicit
+            return;
+        }
+        localWAL->logCreateCatalogEntryRecord(newCatalogEntry, isInternal);
+    } break;
+    case CatalogEntryType::SCALAR_MACRO_ENTRY:
+    case CatalogEntryType::TYPE_ENTRY: {
+        KU_ASSERT(
+            catalogEntry.getType() == CatalogEntryType::DUMMY_ENTRY && catalogEntry.isDeleted());
+        localWAL->logCreateCatalogEntryRecord(newCatalogEntry, isInternal);
+    } break;
+    case CatalogEntryType::DUMMY_ENTRY: {
+        KU_ASSERT(newCatalogEntry->isDeleted());
+        if (catalogEntry.hasParent()) {
+            return;
+        }
+        switch (catalogEntry.getType()) {
+        case CatalogEntryType::INDEX_ENTRY:
+        case CatalogEntryType::SCALAR_MACRO_ENTRY:
+        case CatalogEntryType::NODE_TABLE_ENTRY:
+        case CatalogEntryType::REL_GROUP_ENTRY:
+        case CatalogEntryType::SEQUENCE_ENTRY: {
+            localWAL->logDropCatalogEntryRecord(catalogEntry.getOID(), catalogEntry.getType());
+        } break;
+        case CatalogEntryType::SCALAR_FUNCTION_ENTRY:
+        case CatalogEntryType::TABLE_FUNCTION_ENTRY:
+        case CatalogEntryType::STANDALONE_TABLE_FUNCTION_ENTRY: {
+            // DO NOTHING. We don't persist function entries.
+        } break;
+        case CatalogEntryType::TYPE_ENTRY:
+        default: {
+            throw common::RuntimeException(
+                common::stringFormat("Not supported catalog entry type {} yet.",
+                    CatalogEntryTypeUtils::toString(catalogEntry.getType())));
+        }
+        }
+    } break;
+    case CatalogEntryType::SCALAR_FUNCTION_ENTRY:
+    case CatalogEntryType::TABLE_FUNCTION_ENTRY:
+    case CatalogEntryType::STANDALONE_TABLE_FUNCTION_ENTRY: {
+        // DO NOTHING. We don't persist function entries.
+    } break;
+    default: {
+        throw common::RuntimeException(
+            common::stringFormat("Not supported catalog entry type {} yet.",
+                CatalogEntryTypeUtils::toString(catalogEntry.getType())));
+    }
+    }
+}
+
+void Transaction::pushAlterCatalogEntry(CatalogSet& catalogSet, CatalogEntry& catalogEntry,
+    const binder::BoundAlterInfo& alterInfo) {
+    undoBuffer->createCatalogEntry(catalogSet, catalogEntry);
+    hasCatalogChanges = true;
+    if (shouldLogToWAL()) {
+        KU_ASSERT(localWAL);
+        localWAL->logAlterCatalogEntryRecord(&alterInfo);
+    }
+}
+
+void Transaction::pushSequenceChange(SequenceCatalogEntry* sequenceEntry, int64_t kCount,
+    const SequenceRollbackData& data) {
+    undoBuffer->createSequenceChange(*sequenceEntry, data);
+    hasCatalogChanges = true;
+    if (shouldLogToWAL()) {
+        KU_ASSERT(localWAL);
+        localWAL->logUpdateSequenceRecord(sequenceEntry->getOID(), kCount);
+    }
+}
+
+void Transaction::pushInsertInfo(common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+    common::row_idx_t numRows, const storage::VersionRecordHandler* versionRecordHandler) const {
+    undoBuffer->createInsertInfo(nodeGroupIdx, startRow, numRows, versionRecordHandler);
+}
+
+void Transaction::pushDeleteInfo(common::node_group_idx_t nodeGroupIdx, common::row_idx_t startRow,
+    common::row_idx_t numRows, const storage::VersionRecordHandler* versionRecordHandler) const {
+    undoBuffer->createDeleteInfo(nodeGroupIdx, startRow, numRows, versionRecordHandler);
+}
+
+void Transaction::pushVectorUpdateInfo(storage::UpdateInfo& updateInfo,
+    const common::idx_t vectorIdx, storage::VectorUpdateInfo& vectorUpdateInfo,
+    common::transaction_t version) const {
+    undoBuffer->createVectorUpdateInfo(&updateInfo, vectorIdx, &vectorUpdateInfo, version);
+}
+
+Transaction::~Transaction() = default;
+
+common::offset_t Transaction::getMinUncommittedNodeOffset(common::table_id_t tableID) const {
+    if (localStorage && localStorage->getLocalTable(tableID)) {
+        return localStorage->getLocalTable(tableID)
+            ->cast<storage::LocalNodeTable>()
+            .getStartOffset();
+    }
+    return 0;
+}
+
+Transaction* Transaction::Get(const main::ClientContext& context) {
+    return TransactionContext::Get(context)->getActiveTransaction();
+}
+
+Transaction DUMMY_TRANSACTION = Transaction(TransactionType::DUMMY);
+Transaction DUMMY_CHECKPOINT_TRANSACTION = Transaction(TransactionType::CHECKPOINT,
+    Transaction::DUMMY_TRANSACTION_ID, Transaction::START_TRANSACTION_ID - 1);
+
+} // namespace transaction
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/transaction_context.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/transaction_context.cpp
new file mode 100644
index 0000000000..066b0dd02d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/transaction_context.cpp
@@ -0,0 +1,88 @@
+#include "transaction/transaction_context.h"
+
+#include "common/exception/transaction_manager.h"
+#include "main/client_context.h"
+#include "main/database.h"
+#include "transaction/transaction_manager.h"
+
+using namespace lbug::common;
+
+namespace lbug {
+namespace transaction {
+
+TransactionContext::TransactionContext(main::ClientContext& clientContext)
+    : clientContext{clientContext}, mode{TransactionMode::AUTO}, activeTransaction{nullptr} {}
+
+TransactionContext::~TransactionContext() = default;
+
+void TransactionContext::beginReadTransaction() {
+    std::unique_lock lck{mtx};
+    mode = TransactionMode::MANUAL;
+    beginTransactionInternal(TransactionType::READ_ONLY);
+}
+
+void TransactionContext::beginWriteTransaction() {
+    std::unique_lock lck{mtx};
+    mode = TransactionMode::MANUAL;
+    beginTransactionInternal(TransactionType::WRITE);
+}
+
+void TransactionContext::beginAutoTransaction(bool readOnlyStatement) {
+    // LCOV_EXCL_START
+    if (hasActiveTransaction()) {
+        throw TransactionManagerException(
+            "Cannot start a new transaction while there is an active transaction.");
+    }
+    // LCOV_EXCL_STOP
+    beginTransactionInternal(
+        readOnlyStatement ? TransactionType::READ_ONLY : TransactionType::WRITE);
+}
+
+void TransactionContext::beginRecoveryTransaction() {
+    std::unique_lock lck{mtx};
+    mode = TransactionMode::MANUAL;
+    beginTransactionInternal(TransactionType::RECOVERY);
+}
+
+void TransactionContext::validateManualTransaction(bool readOnlyStatement) const {
+    KU_ASSERT(hasActiveTransaction());
+    if (activeTransaction->isReadOnly() && !readOnlyStatement) {
+        throw TransactionManagerException(
+            "Can not execute a write query inside a read-only transaction.");
+    }
+}
+
+void TransactionContext::commit() {
+    if (!hasActiveTransaction()) {
+        return;
+    }
+    clientContext.getDatabase()->getTransactionManager()->commit(clientContext, activeTransaction);
+    clearTransaction();
+}
+
+void TransactionContext::rollback() {
+    if (!hasActiveTransaction()) {
+        return;
+    }
+    clientContext.getDatabase()->getTransactionManager()->rollback(clientContext,
+        activeTransaction);
+    clearTransaction();
+}
+
+void TransactionContext::clearTransaction() {
+    activeTransaction = nullptr;
+    mode = TransactionMode::AUTO;
+}
+
+TransactionContext* TransactionContext::Get(const main::ClientContext& context) {
+    return context.transactionContext.get();
+}
+
+void TransactionContext::beginTransactionInternal(TransactionType transactionType) {
+    KU_ASSERT(!activeTransaction);
+    activeTransaction = clientContext.getDatabase()->getTransactionManager()->beginTransaction(
+        clientContext, transactionType);
+}
+
+} // namespace transaction
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/transaction_manager.cpp b/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/transaction_manager.cpp
new file mode 100644
index 0000000000..157b778132
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/src/transaction/transaction_manager.cpp
@@ -0,0 +1,187 @@
+#include "transaction/transaction_manager.h"
+
+#include <thread>
+
+#include "common/exception/checkpoint.h"
+#include "common/exception/transaction_manager.h"
+#include "main/attached_database.h"
+#include "main/client_context.h"
+#include "main/database.h"
+#include "main/db_config.h"
+#include "storage/checkpointer.h"
+#include "storage/wal/local_wal.h"
+
+using namespace lbug::common;
+using namespace lbug::storage;
+
+namespace lbug {
+namespace transaction {
+
+Transaction* TransactionManager::beginTransaction(main::ClientContext& clientContext,
+    TransactionType type) {
+    // We acquire the lock for starting new transactions. In case this cannot be acquired, this
+    // ensures calls to other public functions are not restricted.
+    std::unique_lock publicFunctionLck{mtxForSerializingPublicFunctionCalls};
+    std::unique_lock newTransactionLck{mtxForStartingNewTransactions};
+    switch (type) {
+    case TransactionType::READ_ONLY: {
+        auto transaction =
+            std::make_unique<Transaction>(clientContext, type, ++lastTransactionID, lastTimestamp);
+        activeTransactions.push_back(std::move(transaction));
+        return activeTransactions.back().get();
+    }
+    case TransactionType::RECOVERY:
+    case TransactionType::WRITE: {
+        if (!clientContext.getDBConfig()->enableMultiWrites && hasActiveWriteTransactionNoLock()) {
+            throw TransactionManagerException(
+                "Cannot start a new write transaction in the system. "
+                "Only one write transaction at a time is allowed in the system.");
+        }
+        auto transaction =
+            std::make_unique<Transaction>(clientContext, type, ++lastTransactionID, lastTimestamp);
+        if (transaction->shouldLogToWAL()) {
+            transaction->getLocalWAL().logBeginTransaction();
+        }
+        activeTransactions.push_back(std::move(transaction));
+        return activeTransactions.back().get();
+    }
+        // LCOV_EXCL_START
+    default: {
+        throw TransactionManagerException("Invalid transaction type to begin transaction.");
+    }
+        // LCOV_EXCL_STOP
+    }
+}
+
+void TransactionManager::commit(main::ClientContext& clientContext, Transaction* transaction) {
+    std::unique_lock lck{mtxForSerializingPublicFunctionCalls};
+    clientContext.cleanUp();
+    switch (transaction->getType()) {
+    case TransactionType::READ_ONLY: {
+        clearTransactionNoLock(transaction->getID());
+    } break;
+    case TransactionType::RECOVERY:
+    case TransactionType::WRITE: {
+        lastTimestamp++;
+        transaction->commitTS = lastTimestamp;
+        transaction->commit(&wal);
+        auto shouldCheckpoint = transaction->shouldForceCheckpoint() ||
+                                Checkpointer::canAutoCheckpoint(clientContext, *transaction);
+        clearTransactionNoLock(transaction->getID());
+        if (shouldCheckpoint) {
+            checkpointNoLock(clientContext);
+        }
+    } break;
+        // LCOV_EXCL_START
+    default: {
+        throw TransactionManagerException("Invalid transaction type to commit.");
+    }
+        // LCOV_EXCL_STOP
+    }
+}
+
+// Note: We take in additional `transaction` here is due to that `transactionContext` might be
+// destructed when a transaction throws an exception, while we need to roll back the active
+// transaction still.
+void TransactionManager::rollback(main::ClientContext& clientContext, Transaction* transaction) {
+    std::unique_lock lck{mtxForSerializingPublicFunctionCalls};
+    clientContext.cleanUp();
+    switch (transaction->getType()) {
+    case TransactionType::READ_ONLY: {
+        clearTransactionNoLock(transaction->getID());
+    } break;
+    case TransactionType::RECOVERY:
+    case TransactionType::WRITE: {
+        transaction->rollback(&wal);
+        clearTransactionNoLock(transaction->getID());
+    } break;
+    default: {
+        throw TransactionManagerException("Invalid transaction type to rollback.");
+    }
+    }
+}
+
+void TransactionManager::checkpoint(main::ClientContext& clientContext) {
+    UniqLock lck{mtxForSerializingPublicFunctionCalls};
+    if (clientContext.isInMemory()) {
+        return;
+    }
+    checkpointNoLock(clientContext);
+}
+
+TransactionManager* TransactionManager::Get(const main::ClientContext& context) {
+    if (context.getAttachedDatabase() != nullptr) {
+        context.getAttachedDatabase()->getTransactionManager();
+    }
+    return context.getDatabase()->getTransactionManager();
+}
+
+UniqLock TransactionManager::stopNewTransactionsAndWaitUntilAllTransactionsLeave() {
+    UniqLock startTransactionLock{mtxForStartingNewTransactions};
+    uint64_t numTimesWaited = 0;
+    while (true) {
+        if (hasNoActiveTransactions()) {
+            break;
+        }
+        numTimesWaited++;
+        if (numTimesWaited * THREAD_SLEEP_TIME_WHEN_WAITING_IN_MICROS >
+            checkpointWaitTimeoutInMicros) {
+            throw TransactionManagerException(
+                "Timeout waiting for active transactions to leave the system before "
+                "checkpointing. If you have an open transaction, please close it and try "
+                "again.");
+        }
+        std::this_thread::sleep_for(
+            std::chrono::microseconds(THREAD_SLEEP_TIME_WHEN_WAITING_IN_MICROS));
+    }
+    return startTransactionLock;
+}
+
+bool TransactionManager::hasNoActiveTransactions() const {
+    return activeTransactions.empty();
+}
+
+bool TransactionManager::hasActiveWriteTransactionNoLock() const {
+    return std::ranges::any_of(activeTransactions,
+        [](const auto& transaction) { return transaction->isWriteTransaction(); });
+}
+
+void TransactionManager::clearTransactionNoLock(transaction_t transactionID) {
+    KU_ASSERT(std::ranges::any_of(activeTransactions.begin(), activeTransactions.end(),
+        [transactionID](const auto& activeTransaction) {
+            return activeTransaction->getID() == transactionID;
+        }));
+    std::erase_if(activeTransactions, [transactionID](const auto& activeTransaction) {
+        return activeTransaction->getID() == transactionID;
+    });
+}
+
+std::unique_ptr<Checkpointer> TransactionManager::initCheckpointer(
+    main::ClientContext& clientContext) {
+    return std::make_unique<Checkpointer>(clientContext);
+}
+
+void TransactionManager::checkpointNoLock(main::ClientContext& clientContext) {
+    // Note: It is enough to stop and wait for transactions to leave the system instead of, for
+    // example, checking on the query processor's task scheduler. This is because the
+    // first and last steps that a connection performs when executing a query are to
+    // start and commit/rollback transaction. The query processor also ensures that it
+    // will only return results or error after all threads working on the tasks of a
+    // query stop working on the tasks of the query and these tasks are removed from the
+    // query.
+    try {
+        auto lockForStartingTransaction = stopNewTransactionsAndWaitUntilAllTransactionsLeave();
+    } catch (std::exception& e) {
+        throw CheckpointException{e};
+    }
+    auto checkpointer = initCheckpointerFunc(clientContext);
+    try {
+        checkpointer->writeCheckpoint();
+    } catch (std::exception& e) {
+        checkpointer->rollback();
+        throw CheckpointException{e};
+    }
+}
+
+} // namespace transaction
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/CMakeLists.txt
new file mode 100644
index 0000000000..5554d7759c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/CMakeLists.txt
@@ -0,0 +1,28 @@
+if(NOT MSVC)
+    add_compile_options(-Wno-extra)
+endif()
+
+add_subdirectory(alp)
+add_subdirectory(antlr4_cypher)
+add_subdirectory(antlr4_runtime)
+set(BROTLI_BUNDLED_MODE ON)
+add_subdirectory(brotli)
+add_subdirectory(fast_float)
+add_subdirectory(fastpfor)
+add_subdirectory(glob)
+add_subdirectory(lz4)
+add_subdirectory(mbedtls)
+add_subdirectory(miniz)
+add_subdirectory(parquet)
+if(${BUILD_PYTHON})
+    add_subdirectory(pybind11)
+endif()
+add_subdirectory(re2)
+add_subdirectory(roaring_bitmap)
+add_subdirectory(simsimd)
+add_subdirectory(snappy)
+add_subdirectory(thrift)
+add_subdirectory(utf8proc)
+add_subdirectory(yyjson)
+add_subdirectory(zstd)
+add_subdirectory(cppjieba)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/.clang-format b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/.clang-format
new file mode 100644
index 0000000000..faae7b654d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/.clang-format
@@ -0,0 +1,36 @@
+BasedOnStyle: LLVM
+TabWidth: 4
+IndentWidth: 4
+UseTab: ForIndentation
+DerivePointerAlignment: false
+PointerAlignment: Left
+AlignConsecutiveMacros: AcrossEmptyLinesAndComments
+AlignAfterOpenBracket: Align
+AlignTrailingComments: true
+AlignConsecutiveDeclarations: Consecutive
+AlignConsecutiveAssignments: Consecutive
+AllowAllArgumentsOnNextLine: true
+AllowAllConstructorInitializersOnNextLine: true
+AllowAllParametersOfDeclarationOnNextLine: true
+SpaceBeforeCpp11BracedList: true
+SpaceBeforeCtorInitializerColon: true
+SpaceBeforeInheritanceColon: true
+SpacesInAngles: false
+SpacesInCStyleCastParentheses: false
+SpacesInConditionalStatement: false
+AllowShortLambdasOnASingleLine: Inline
+AllowShortLoopsOnASingleLine: false
+AlwaysBreakTemplateDeclarations: Yes
+ColumnLimit: 120
+IncludeBlocks: Merge
+SortIncludes: CaseSensitive
+Language: Cpp
+AccessModifierOffset: -4
+BreakConstructorInitializers: BeforeComma
+AllowShortBlocksOnASingleLine: Always
+AllowShortFunctionsOnASingleLine: All
+AllowShortIfStatementsOnASingleLine: true
+CompactNamespaces: true
+BinPackArguments: false
+BinPackParameters: false
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/CMakeLists.txt
new file mode 100644
index 0000000000..f38d0c0717
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/CMakeLists.txt
@@ -0,0 +1,3 @@
+add_library(libalp INTERFACE)
+
+target_include_directories(libalp INTERFACE include)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/LICENSE
new file mode 100644
index 0000000000..46301aaa73
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2023 CWI, Azim Afroozeh,  Leonardo Xavier Kuffo Rivero
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp.hpp
new file mode 100644
index 0000000000..7baa7e26e1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp.hpp
@@ -0,0 +1,17 @@
+#ifndef ALP_ALP_HPP
+#define ALP_ALP_HPP
+
+#include "alp/compressor.hpp"
+#include "alp/config.hpp"
+#include "alp/constants.hpp"
+#include "alp/decode.hpp"
+#include "alp/decompressor.hpp"
+#include "alp/encode.hpp"
+#include "alp/rd.hpp"
+#include "alp/sampler.hpp"
+#include "alp/storer.hpp"
+#include "alp/utils.hpp"
+#include "fastlanes/ffor.hpp"
+#include "fastlanes/unffor.hpp"
+
+#endif // ALP_ALP_HPP
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/common.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/common.hpp
new file mode 100644
index 0000000000..5af36b5b43
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/common.hpp
@@ -0,0 +1,19 @@
+#ifndef ALP_COMMON_HPP
+#define ALP_COMMON_HPP
+
+#include <cstdint>
+
+namespace alp {
+//! bitwidth type
+using bw_t = uint8_t;
+//! exception counter type
+using exp_c_t = uint32_t;
+//! exception position type
+using exp_p_t = uint32_t;
+//! factor idx  type
+using factor_idx_t = uint8_t;
+//! exponent idx type
+using exponent_idx_t = uint8_t;
+} // namespace alp
+
+#endif // ALP_COMMON_HPP
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/config.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/config.hpp
new file mode 100644
index 0000000000..da102f46d8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/config.hpp
@@ -0,0 +1,29 @@
+#ifndef ALP_CONFIG_HPP
+#define ALP_CONFIG_HPP
+
+#include <cstddef>
+
+/*
+ * ALP Configs
+ */
+namespace alp::config {
+/// ALP Vector size (We recommend against changing this; it should be constant)
+inline constexpr size_t VECTOR_SIZE = 128UL * 1024;
+/// Rowgroup size
+inline constexpr size_t ROWGROUP_SIZE = VECTOR_SIZE;
+/// Vectors from the rowgroup from which to take samples; this will be used to then calculate the jumps
+inline constexpr size_t ROWGROUP_VECTOR_SAMPLES = 1;
+/// We calculate how many equidistant vector we must jump within a rowgroup
+inline constexpr size_t ROWGROUP_SAMPLES_JUMP = (ROWGROUP_SIZE / ROWGROUP_VECTOR_SAMPLES) / VECTOR_SIZE;
+/// Values to sample per vector
+inline constexpr size_t SAMPLES_PER_VECTOR   = 4 * 1024;
+inline constexpr size_t SAMPLES_PER_ROWGROUP = SAMPLES_PER_VECTOR;
+/// Maximum number of combinations obtained from row group sampling
+inline constexpr size_t MAX_K_COMBINATIONS     = 5;
+inline constexpr size_t CUTTING_LIMIT          = 16;
+inline constexpr size_t MAX_RD_DICT_BIT_WIDTH  = 3;
+inline constexpr size_t MAX_RD_DICTIONARY_SIZE = (1 << MAX_RD_DICT_BIT_WIDTH);
+
+} // namespace alp::config
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/constants.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/constants.hpp
new file mode 100644
index 0000000000..0d7d088211
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/constants.hpp
@@ -0,0 +1,245 @@
+#ifndef ALP_CONSTANTS_HPP
+#define ALP_CONSTANTS_HPP
+
+#include "alp/config.hpp"
+#include <concepts>
+#include <cstdint>
+
+namespace alp {
+
+enum class SCHEME : uint8_t {
+	ALP_RD,
+	ALP,
+};
+
+template <class T>
+struct FloatingToExact {};
+
+template <>
+struct FloatingToExact<double> {
+	typedef uint64_t type;
+};
+
+template <>
+struct FloatingToExact<float> {
+	typedef uint32_t type;
+};
+
+template <std::floating_point T>
+using FloatingToEncodedType = std::conditional_t<std::same_as<T, double>, int64_t, int32_t>;
+
+inline constexpr uint8_t SAMPLING_EARLY_EXIT_THRESHOLD    = 2;
+inline constexpr double  ENCODING_UPPER_LIMIT             = 9223372036854774784;
+inline constexpr double  ENCODING_LOWER_LIMIT             = -9223372036854774784;
+inline constexpr uint8_t DICTIONARY_ELEMENT_SIZE_BYTES    = 2;
+inline constexpr uint8_t RD_EXCEPTION_POSITION_SIZE       = 16;
+inline constexpr uint8_t RD_EXCEPTION_POSITION_SIZE_BYTES = RD_EXCEPTION_POSITION_SIZE / 8;
+inline constexpr uint8_t EXCEPTION_POSITION_SIZE          = 32;
+inline constexpr uint8_t EXCEPTION_POSITION_SIZE_BYTES    = EXCEPTION_POSITION_SIZE / 8;
+inline constexpr uint8_t RD_EXCEPTION_SIZE                = 16;
+inline constexpr uint8_t RD_EXCEPTION_SIZE_BYTES          = RD_EXCEPTION_SIZE / 8;
+
+template <class T>
+struct Constants {};
+
+template <>
+struct Constants<float> {
+	/// 22 bits per value * 32 values in the sampled vector
+	static inline constexpr size_t  RD_SIZE_THRESHOLD_LIMIT = 22 * alp::config::SAMPLES_PER_VECTOR;
+	static inline constexpr float   MAGIC_NUMBER            = 12582912.0;
+	static inline constexpr uint8_t EXCEPTION_SIZE          = 32;
+	static inline constexpr uint8_t EXCEPTION_SIZE_BYTES    = EXCEPTION_SIZE / 8;
+	static inline constexpr uint8_t MAX_EXPONENT            = 10;
+
+	// -Inf: 11111111100000000000000000000000
+	// +Inf: 01111111100000000000000000000000
+	// -0.0: 10000000000000000000000000000000
+	static constexpr uint32_t NEGATIVE_ZERO = 0b10000000000000000000000000000000;
+	static constexpr uint32_t POSITIVE_INF  = 0b11111111100000000000000000000000;
+	static constexpr uint32_t NEGATIVE_INF  = 0b11111111100000000000000000000000;
+
+	static inline constexpr float FRAC_ARR[] = {
+	    1.0, 0.1, 0.01, 0.001, 0.0001, 0.00001, 0.000001, 0.0000001, 0.00000001, 0.000000001, 0.0000000001};
+
+	static inline constexpr float EXP_ARR[] = {
+	    1.0, 10.0, 100.0, 1000.0, 10000.0, 100000.0, 1000000.0, 10000000.0, 100000000.0, 1000000000.0, 10000000000.0};
+};
+
+template <>
+struct Constants<double> {
+	/// 48 bits per value * 32 values in the sampled vector
+	static inline constexpr size_t  RD_SIZE_THRESHOLD_LIMIT = 48 * alp::config::SAMPLES_PER_VECTOR;
+	static inline constexpr double  MAGIC_NUMBER {0x0018000000000000};
+	static inline constexpr uint8_t EXCEPTION_SIZE       = 64;
+	static inline constexpr uint8_t EXCEPTION_SIZE_BYTES = EXCEPTION_SIZE / 8;
+	static inline constexpr uint8_t MAX_EXPONENT         = 18;
+
+	// -Inf: 1111111111110000000000000000000000000000000000000000000000000000
+	// +Inf: 0111111111110000000000000000000000000000000000000000000000000000
+	// -0.0: 1000000000000000000000000000000000000000000000000000000000000000
+	static constexpr uint64_t NEGATIVE_ZERO = 0b1000000000000000000000000000000000000000000000000000000000000000;
+	static constexpr uint64_t POSITIVE_INF  = 0b0111111111110000000000000000000000000000000000000000000000000000;
+	static constexpr uint64_t NEGATIVE_INF  = 0b1111111111110000000000000000000000000000000000000000000000000000;
+
+	static inline constexpr double FRAC_ARR[] = {
+	    1.0,
+	    0.1,
+	    0.01,
+	    0.001,
+	    0.0001,
+	    0.00001,
+	    0.000001,
+	    0.0000001,
+	    0.00000001,
+	    0.000000001,
+	    0.0000000001,
+	    0.00000000001,
+	    0.000000000001,
+	    0.0000000000001,
+	    0.00000000000001,
+	    0.000000000000001,
+	    0.0000000000000001,
+	    0.00000000000000001,
+	    0.000000000000000001,
+	    0.0000000000000000001,
+	    0.00000000000000000001,
+	};
+
+	static inline constexpr double EXP_ARR[] = {
+	    1.0,
+	    10.0,
+	    100.0,
+	    1000.0,
+	    10000.0,
+	    100000.0,
+	    1000000.0,
+	    10000000.0,
+	    100000000.0,
+	    1000000000.0,
+	    10000000000.0,
+	    100000000000.0,
+	    1000000000000.0,
+	    10000000000000.0,
+	    100000000000000.0,
+	    1000000000000000.0,
+	    10000000000000000.0,
+	    100000000000000000.0,
+	    1000000000000000000.0,
+	    10000000000000000000.0,
+	    100000000000000000000.0,
+	    1000000000000000000000.0,
+	    10000000000000000000000.0,
+	    100000000000000000000000.0,
+	};
+};
+
+inline constexpr int64_t FACT_ARR[] = {1,
+                                       10,
+                                       100,
+                                       1000,
+                                       10000,
+                                       100000,
+                                       1000000,
+                                       10000000,
+                                       100000000,
+                                       1000000000,
+                                       10000000000,
+                                       100000000000,
+                                       1000000000000,
+                                       10000000000000,
+                                       100000000000000,
+                                       1000000000000000,
+                                       10000000000000000,
+                                       100000000000000000,
+                                       1000000000000000000};
+
+inline constexpr int64_t U_FACT_ARR[] = {1,
+                                         10,
+                                         100,
+                                         1000,
+                                         10000,
+                                         100000,
+                                         1000000,
+                                         10000000,
+                                         100000000,
+                                         1000000000,
+                                         10000000000,
+                                         100000000000,
+                                         1000000000000,
+                                         10000000000000,
+                                         100000000000000,
+                                         1000000000000000,
+                                         10000000000000000,
+                                         100000000000000000,
+                                         1000000000000000000};
+
+alignas(64) inline constexpr uint64_t INDEX_ARR[1024] {
+    0,    1,    2,    3,    4,    5,    6,    7,    8,    9,    10,   11,   12,   13,   14,   15,   16,   17,   18,
+    19,   20,   21,   22,   23,   24,   25,   26,   27,   28,   29,   30,   31,   32,   33,   34,   35,   36,   37,
+    38,   39,   40,   41,   42,   43,   44,   45,   46,   47,   48,   49,   50,   51,   52,   53,   54,   55,   56,
+    57,   58,   59,   60,   61,   62,   63,   64,   65,   66,   67,   68,   69,   70,   71,   72,   73,   74,   75,
+    76,   77,   78,   79,   80,   81,   82,   83,   84,   85,   86,   87,   88,   89,   90,   91,   92,   93,   94,
+    95,   96,   97,   98,   99,   100,  101,  102,  103,  104,  105,  106,  107,  108,  109,  110,  111,  112,  113,
+    114,  115,  116,  117,  118,  119,  120,  121,  122,  123,  124,  125,  126,  127,  128,  129,  130,  131,  132,
+    133,  134,  135,  136,  137,  138,  139,  140,  141,  142,  143,  144,  145,  146,  147,  148,  149,  150,  151,
+    152,  153,  154,  155,  156,  157,  158,  159,  160,  161,  162,  163,  164,  165,  166,  167,  168,  169,  170,
+    171,  172,  173,  174,  175,  176,  177,  178,  179,  180,  181,  182,  183,  184,  185,  186,  187,  188,  189,
+    190,  191,  192,  193,  194,  195,  196,  197,  198,  199,  200,  201,  202,  203,  204,  205,  206,  207,  208,
+    209,  210,  211,  212,  213,  214,  215,  216,  217,  218,  219,  220,  221,  222,  223,  224,  225,  226,  227,
+    228,  229,  230,  231,  232,  233,  234,  235,  236,  237,  238,  239,  240,  241,  242,  243,  244,  245,  246,
+    247,  248,  249,  250,  251,  252,  253,  254,  255,  256,  257,  258,  259,  260,  261,  262,  263,  264,  265,
+    266,  267,  268,  269,  270,  271,  272,  273,  274,  275,  276,  277,  278,  279,  280,  281,  282,  283,  284,
+    285,  286,  287,  288,  289,  290,  291,  292,  293,  294,  295,  296,  297,  298,  299,  300,  301,  302,  303,
+    304,  305,  306,  307,  308,  309,  310,  311,  312,  313,  314,  315,  316,  317,  318,  319,  320,  321,  322,
+    323,  324,  325,  326,  327,  328,  329,  330,  331,  332,  333,  334,  335,  336,  337,  338,  339,  340,  341,
+    342,  343,  344,  345,  346,  347,  348,  349,  350,  351,  352,  353,  354,  355,  356,  357,  358,  359,  360,
+    361,  362,  363,  364,  365,  366,  367,  368,  369,  370,  371,  372,  373,  374,  375,  376,  377,  378,  379,
+    380,  381,  382,  383,  384,  385,  386,  387,  388,  389,  390,  391,  392,  393,  394,  395,  396,  397,  398,
+    399,  400,  401,  402,  403,  404,  405,  406,  407,  408,  409,  410,  411,  412,  413,  414,  415,  416,  417,
+    418,  419,  420,  421,  422,  423,  424,  425,  426,  427,  428,  429,  430,  431,  432,  433,  434,  435,  436,
+    437,  438,  439,  440,  441,  442,  443,  444,  445,  446,  447,  448,  449,  450,  451,  452,  453,  454,  455,
+    456,  457,  458,  459,  460,  461,  462,  463,  464,  465,  466,  467,  468,  469,  470,  471,  472,  473,  474,
+    475,  476,  477,  478,  479,  480,  481,  482,  483,  484,  485,  486,  487,  488,  489,  490,  491,  492,  493,
+    494,  495,  496,  497,  498,  499,  500,  501,  502,  503,  504,  505,  506,  507,  508,  509,  510,  511,  512,
+    513,  514,  515,  516,  517,  518,  519,  520,  521,  522,  523,  524,  525,  526,  527,  528,  529,  530,  531,
+    532,  533,  534,  535,  536,  537,  538,  539,  540,  541,  542,  543,  544,  545,  546,  547,  548,  549,  550,
+    551,  552,  553,  554,  555,  556,  557,  558,  559,  560,  561,  562,  563,  564,  565,  566,  567,  568,  569,
+    570,  571,  572,  573,  574,  575,  576,  577,  578,  579,  580,  581,  582,  583,  584,  585,  586,  587,  588,
+    589,  590,  591,  592,  593,  594,  595,  596,  597,  598,  599,  600,  601,  602,  603,  604,  605,  606,  607,
+    608,  609,  610,  611,  612,  613,  614,  615,  616,  617,  618,  619,  620,  621,  622,  623,  624,  625,  626,
+    627,  628,  629,  630,  631,  632,  633,  634,  635,  636,  637,  638,  639,  640,  641,  642,  643,  644,  645,
+    646,  647,  648,  649,  650,  651,  652,  653,  654,  655,  656,  657,  658,  659,  660,  661,  662,  663,  664,
+    665,  666,  667,  668,  669,  670,  671,  672,  673,  674,  675,  676,  677,  678,  679,  680,  681,  682,  683,
+    684,  685,  686,  687,  688,  689,  690,  691,  692,  693,  694,  695,  696,  697,  698,  699,  700,  701,  702,
+    703,  704,  705,  706,  707,  708,  709,  710,  711,  712,  713,  714,  715,  716,  717,  718,  719,  720,  721,
+    722,  723,  724,  725,  726,  727,  728,  729,  730,  731,  732,  733,  734,  735,  736,  737,  738,  739,  740,
+    741,  742,  743,  744,  745,  746,  747,  748,  749,  750,  751,  752,  753,  754,  755,  756,  757,  758,  759,
+    760,  761,  762,  763,  764,  765,  766,  767,  768,  769,  770,  771,  772,  773,  774,  775,  776,  777,  778,
+    779,  780,  781,  782,  783,  784,  785,  786,  787,  788,  789,  790,  791,  792,  793,  794,  795,  796,  797,
+    798,  799,  800,  801,  802,  803,  804,  805,  806,  807,  808,  809,  810,  811,  812,  813,  814,  815,  816,
+    817,  818,  819,  820,  821,  822,  823,  824,  825,  826,  827,  828,  829,  830,  831,  832,  833,  834,  835,
+    836,  837,  838,  839,  840,  841,  842,  843,  844,  845,  846,  847,  848,  849,  850,  851,  852,  853,  854,
+    855,  856,  857,  858,  859,  860,  861,  862,  863,  864,  865,  866,  867,  868,  869,  870,  871,  872,  873,
+    874,  875,  876,  877,  878,  879,  880,  881,  882,  883,  884,  885,  886,  887,  888,  889,  890,  891,  892,
+    893,  894,  895,  896,  897,  898,  899,  900,  901,  902,  903,  904,  905,  906,  907,  908,  909,  910,  911,
+    912,  913,  914,  915,  916,  917,  918,  919,  920,  921,  922,  923,  924,  925,  926,  927,  928,  929,  930,
+    931,  932,  933,  934,  935,  936,  937,  938,  939,  940,  941,  942,  943,  944,  945,  946,  947,  948,  949,
+    950,  951,  952,  953,  954,  955,  956,  957,  958,  959,  960,  961,  962,  963,  964,  965,  966,  967,  968,
+    969,  970,  971,  972,  973,  974,  975,  976,  977,  978,  979,  980,  981,  982,  983,  984,  985,  986,  987,
+    988,  989,  990,  991,  992,  993,  994,  995,  996,  997,  998,  999,  1000, 1001, 1002, 1003, 1004, 1005, 1006,
+    1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023,
+};
+
+alignas(64) inline constexpr uint8_t LOOKUP_TABLE[256] {
+    0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2,
+    3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3,
+    3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5,
+    6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4,
+    3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4,
+    5, 5, 6, 5, 6, 6, 7, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6,
+    6, 7, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8,
+};
+
+} // namespace alp
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/decode.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/decode.hpp
new file mode 100644
index 0000000000..d253b7afea
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/decode.hpp
@@ -0,0 +1,131 @@
+#ifndef ALP_DECODE_HPP
+#define ALP_DECODE_HPP
+
+#include "common.hpp"
+#include "constants.hpp"
+#include <cstdint>
+
+namespace alp {
+
+#ifdef AVX2
+#include "immintrin.h"
+
+// from: https://stackoverflow.com/questions/41144668/how-to-efficiently-perform-double-int64-conversions-with-sse-avx
+//  Only works for inputs in the range: [-2^51, 2^51]
+__m128i double_to_int64(__m128d x) {
+	x = _mm_add_pd(x, _mm_set1_pd(0x0018000000000000));
+	return _mm_sub_epi64(_mm_castpd_si128(x), _mm_castpd_si128(_mm_set1_pd(0x0018000000000000)));
+}
+
+//  Only works for inputs in the range: [-2^51, 2^51]
+__m128d int64_to_double(__m128i x) {
+	x = _mm_add_epi64(x, _mm_castpd_si128(_mm_set1_pd(0x0018000000000000)));
+	return _mm_sub_pd(_mm_castsi128_pd(x), _mm_set1_pd(0x0018000000000000));
+}
+
+/*
+ * scalar version of int64_to_double
+ */
+double int64_to_double(int64_t x) {
+	double magic_number = static_cast<double>(0x0018000000000000);
+	x                   = x + static_cast<int64_t>(magic_number);
+	return static_cast<double>(x) - static_cast<double>(magic_number);
+}
+
+// SSE version of int64_to_double
+// Only works for inputs in the range: [-2^51, 2^51]
+__m128d sse_int64_to_double(__m128i x) {
+	x = _mm_add_epi64(x, _mm_castpd_si128(_mm_set1_pd(0x0018000000000000)));
+	return _mm_sub_pd(_mm_castsi128_pd(x), _mm_set1_pd(0x0018000000000000));
+}
+
+__m256d int64_to_double_fast_precise(const __m256i v)
+/* Optimized full range int64_t to double conversion           */
+/* Emulate _mm256_cvtepi64_pd()                                */
+{
+	__m256i magic_i_lo   = _mm256_set1_epi64x(0x4330000000000000); /* 2^52               encoded as floating-point  */
+	__m256i magic_i_hi32 = _mm256_set1_epi64x(0x4530000080000000); /* 2^84 + 2^63        encoded as floating-point  */
+	__m256i magic_i_all  = _mm256_set1_epi64x(0x4530000080100000); /* 2^84 + 2^63 + 2^52 encoded as floating-point  */
+	__m256d magic_d_all  = _mm256_castsi256_pd(magic_i_all);
+
+	__m256i v_lo =
+	    _mm256_blend_epi32(magic_i_lo, v, 0b01010101); /* Blend the 32 lowest significant bits of v with magic_int_lo */
+	__m256i v_hi     = _mm256_srli_epi64(v, 32);       /* Extract the 32 most significant bits of v       */
+	v_hi             = _mm256_xor_si256(v_hi, magic_i_hi32); /* Flip the msb of v_hi and blend with 0x45300000 */
+	__m256d v_hi_dbl = _mm256_sub_pd(_mm256_castsi256_pd(v_hi), magic_d_all); /* Compute in double precision: */
+	__m256d result   = _mm256_add_pd(
+        v_hi_dbl,
+        _mm256_castsi256_pd(
+            v_lo)); /* (v_hi - magic_d_all) + v_lo  Do not assume associativity of floating point addition !! */
+	return result;    /* With gcc use -O3, then -fno-associative-math is default. Do not use -Ofast, which enables
+	             -fassociative-math! */
+}
+
+void sse_decode(const int64_t* digits, uint8_t fac_idx, uint8_t exp_idx, double* out_p) {
+	uint64_t factor     = alp::U_FACT_ARR[fac_idx];
+	double   frac10     = alp::Constants<double>::FRAC_ARR[exp_idx];
+	__m128i  factor_sse = _mm_set1_epi64x(factor);
+	__m128d  frac10_sse = _mm_set1_pd(frac10);
+
+	auto digits_p = reinterpret_cast<const __m128i*>(digits);
+
+	for (size_t i {0}; i < 512; ++i) {
+		__m128i digit       = _mm_loadu_si128(digits_p + i);
+		__m128i tmp_int     = digit * factor_sse;
+		__m128d tmp_dbl     = sse_int64_to_double(tmp_int);
+		__m128d tmp_dbl_mlt = tmp_dbl * frac10_sse;
+		_mm_storeu_pd(out_p + (i * 2), tmp_dbl_mlt);
+	}
+}
+
+void avx2_decode(const int64_t* digits, uint8_t fac_idx, uint8_t exp_idx, double* out_p) {
+	uint64_t factor     = alp::U_FACT_ARR[fac_idx];
+	double   frac10     = alp::Constants<double>::FRAC_ARR[exp_idx];
+	__m256i  factor_sse = _mm256_set1_epi64x(factor);
+	__m256d  frac10_sse = _mm256_set1_pd(frac10);
+
+	auto digits_p = reinterpret_cast<const __m256i*>(digits);
+
+	for (size_t i {0}; i < 256; ++i) {
+		__m256i digit       = _mm256_loadu_si256(digits_p + i);
+		__m256i tmp_int     = digit * factor_sse;
+		__m256d tmp_dbl     = int64_to_double_fast_precise(tmp_int);
+		__m256d tmp_dbl_mlt = tmp_dbl * frac10_sse;
+		_mm256_storeu_pd(out_p + (i * 4), tmp_dbl_mlt);
+	}
+}
+
+#endif
+
+template <class T>
+struct AlpDecode {
+
+	//! Scalar decoding a single value with ALP
+	static inline T decode_value(const int64_t encoded_value, const uint8_t factor, const uint8_t exponent) {
+		const T decoded_value = encoded_value * FACT_ARR[factor] * alp::Constants<T>::FRAC_ARR[exponent];
+		return decoded_value;
+	}
+
+	//! Scalar decoding of an ALP vector
+	static inline void
+	decode(const int64_t* encoded_integers, const uint8_t fac_idx, const uint8_t exp_idx, T* output) {
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			output[i] = decode_value(encoded_integers[i], fac_idx, exp_idx);
+		}
+	}
+
+	//! Patch Exceptions
+	static inline void patch_exceptions(T*             out,
+	                                    const T*       exceptions,
+	                                    const exp_p_t* exceptions_positions,
+	                                    const exp_c_t* exceptions_count) {
+		const auto exp_c = exceptions_count[0];
+		for (exp_c_t i {0}; i < exp_c; i++) {
+			out[exceptions_positions[i]] = exceptions[i];
+		}
+	}
+};
+
+} // namespace alp
+
+#endif // ALP_DECODE_HPP
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/encode.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/encode.hpp
new file mode 100644
index 0000000000..611842c7b3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/encode.hpp
@@ -0,0 +1,450 @@
+#ifndef ALP_ENCODE_HPP
+#define ALP_ENCODE_HPP
+
+#include "alp/config.hpp"
+#include "alp/constants.hpp"
+#include "alp/decode.hpp"
+#include "alp/sampler.hpp"
+#include "alp/state.hpp"
+#include "common.hpp"
+#include <cassert>
+#include <cfloat>
+#include <cmath>
+#include <cstdint>
+#include <map>
+#include <utility>
+#include <vector>
+
+#ifdef __AVX2__
+
+#include <immintrin.h>
+
+#endif
+
+/*
+ * ALP Encoding
+ */
+namespace alp {
+
+template <class T>
+struct AlpEncode {
+
+	using EXACT_TYPE                            = typename FloatingToExact<T>::type;
+	using ENCODED_TYPE                          = FloatingToEncodedType<T>;
+	static constexpr uint8_t EXACT_TYPE_BITSIZE = sizeof(EXACT_TYPE) * 8;
+
+	/*
+	 * Check for special values which are impossible for ALP to encode
+	 * because they cannot be cast to int64 without an undefined behaviour
+	 */
+	static inline bool is_impossible_to_encode(const T n) {
+		return !std::isfinite(n) || std::isnan(n) || n > ENCODING_UPPER_LIMIT || n < ENCODING_LOWER_LIMIT ||
+		       (n == 0.0 && std::signbit(n)); //! Verification for -0.0
+	}
+
+	//! Scalar encoding a single value with ALP
+	template <bool SAFE = true>
+	static ENCODED_TYPE encode_value(const T value, const factor_idx_t factor_idx, const exponent_idx_t exponent_idx) {
+		T tmp_encoded_value = value * Constants<T>::EXP_ARR[exponent_idx] * Constants<T>::FRAC_ARR[factor_idx];
+		if constexpr (SAFE) {
+			if (is_impossible_to_encode(tmp_encoded_value)) { return static_cast<ENCODED_TYPE>(ENCODING_UPPER_LIMIT); }
+		}
+		tmp_encoded_value = tmp_encoded_value + Constants<T>::MAGIC_NUMBER - Constants<T>::MAGIC_NUMBER;
+		return static_cast<ENCODED_TYPE>(tmp_encoded_value);
+	}
+
+	//! Analyze FFOR to obtain bitwidth and frame-of-reference value
+	static inline void analyze_ffor(const int64_t* input_vector, bw_t& bit_width, int64_t* base_for) {
+		auto min = std::numeric_limits<int64_t>::max();
+		auto max = std::numeric_limits<int64_t>::min();
+
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			if (input_vector[i] < min) { min = input_vector[i]; }
+			if (input_vector[i] > max) { max = input_vector[i]; }
+		}
+
+		const auto delta                    = (static_cast<uint64_t>(max) - static_cast<uint64_t>(min));
+		const auto estimated_bits_per_value = static_cast<bw_t>(ceil(log2(delta + 1)));
+		bit_width                           = estimated_bits_per_value;
+		base_for[0]                         = min;
+	}
+
+	/*
+	 * Function to sort the best combinations from each vector sampled from the rowgroup
+	 * First criteria is number of times it appears
+	 * Second criteria is bigger exponent
+	 * Third criteria is bigger factor
+	 */
+	static inline bool compare_best_combinations(const std::pair<std::pair<int, int>, int>& t1,
+	                                             const std::pair<std::pair<int, int>, int>& t2) {
+		return (t1.second > t2.second) || (t1.second == t2.second && (t2.first.first < t1.first.first)) ||
+		       ((t1.second == t2.second && t2.first.first == t1.first.first) && (t2.first.second < t1.first.second));
+	}
+
+	/*
+	 * Find the best combinations of factor-exponent from each vector sampled from a rowgroup
+	 * This function is called once per rowgroup
+	 * This operates over ALP first level samples
+	 */
+	static inline void find_top_k_combinations(const T* smp_arr, state& stt) {
+		const auto n_vectors_to_sample =
+		    static_cast<uint64_t>(std::ceil(static_cast<double>(stt.sampled_values_n) / config::SAMPLES_PER_VECTOR));
+		const uint64_t                     samples_size = std::min(stt.sampled_values_n, config::SAMPLES_PER_VECTOR);
+		std::map<std::pair<int, int>, int> global_combinations;
+		uint64_t                           smp_offset {0};
+
+		// For each vector in the rg sample
+		uint64_t best_estimated_compression_size {
+		    (samples_size * (Constants<T>::EXCEPTION_SIZE + EXCEPTION_POSITION_SIZE)) +
+		    (samples_size * (Constants<T>::EXCEPTION_SIZE))};
+		for (size_t smp_n = 0; smp_n < n_vectors_to_sample; smp_n++) {
+			uint8_t found_factor {0};
+			uint8_t found_exponent {0};
+			// We start our optimization with the worst possible total bits obtained from compression
+			uint64_t sample_estimated_compression_size {
+			    (samples_size * (Constants<T>::EXCEPTION_SIZE + EXCEPTION_POSITION_SIZE)) +
+			    (samples_size * (Constants<T>::EXCEPTION_SIZE))}; // worst scenario
+
+			// We try all combinations in search for the one which minimize the compression size
+			for (int8_t exp_ref = Constants<T>::MAX_EXPONENT; exp_ref >= 0; exp_ref--) {
+				for (int8_t factor_idx = exp_ref; factor_idx >= 0; factor_idx--) {
+					uint32_t exceptions_count           = {0};
+					uint32_t non_exceptions_count       = {0};
+					uint32_t estimated_bits_per_value   = {0};
+					uint64_t estimated_compression_size = {0};
+
+					ENCODED_TYPE max_encoded_value = {std::numeric_limits<ENCODED_TYPE>::min()};
+					ENCODED_TYPE min_encoded_value = {std::numeric_limits<ENCODED_TYPE>::max()};
+
+					for (size_t i = 0; i < samples_size; i++) {
+						const T            actual_value  = smp_arr[smp_offset + i];
+						const ENCODED_TYPE encoded_value = encode_value(actual_value, factor_idx, exp_ref);
+						const T decoded_value = AlpDecode<T>::decode_value(encoded_value, factor_idx, exp_ref);
+						if (decoded_value == actual_value) {
+							non_exceptions_count++;
+							if (encoded_value > max_encoded_value) { max_encoded_value = encoded_value; }
+							if (encoded_value < min_encoded_value) { min_encoded_value = encoded_value; }
+						} else {
+							exceptions_count++;
+						}
+					}
+
+					// We do not take into account combinations which yield to almsot all exceptions
+					if (non_exceptions_count < 2) { continue; }
+
+					// Evaluate factor/exponent compression size (we optimize for FOR)
+					const uint64_t delta =
+					    (static_cast<uint64_t>(max_encoded_value) - static_cast<uint64_t>(min_encoded_value));
+					estimated_bits_per_value = std::ceil(std::log2(delta + 1));
+					estimated_compression_size += samples_size * estimated_bits_per_value;
+					estimated_compression_size +=
+					    exceptions_count * (Constants<T>::EXCEPTION_SIZE + EXCEPTION_POSITION_SIZE);
+
+					if ((estimated_compression_size < sample_estimated_compression_size) ||
+					    (estimated_compression_size == sample_estimated_compression_size &&
+					     (found_exponent < exp_ref)) ||
+					    // We prefer bigger exponents
+					    ((estimated_compression_size == sample_estimated_compression_size &&
+					      found_exponent == exp_ref) &&
+					     (found_factor < factor_idx)) // We prefer bigger factors
+					) {
+						sample_estimated_compression_size = estimated_compression_size;
+						found_exponent                    = exp_ref;
+						found_factor                      = factor_idx;
+						if (sample_estimated_compression_size < best_estimated_compression_size) {
+							best_estimated_compression_size = sample_estimated_compression_size;
+						}
+					}
+				}
+			}
+			std::pair<int, int> cmb = std::make_pair(found_exponent, found_factor);
+			global_combinations[cmb]++;
+			smp_offset += samples_size;
+		}
+
+		// We adapt scheme if we were not able to achieve compression in the current rg
+		if (best_estimated_compression_size >= Constants<T>::RD_SIZE_THRESHOLD_LIMIT) {
+			stt.scheme = SCHEME::ALP_RD;
+			return;
+		}
+
+		// Convert our hash to a Combination vector to be able to sort
+		// Note that this vector is always small (< 10 combinations)
+		std::vector<std::pair<std::pair<int, int>, int>> best_k_combinations;
+		best_k_combinations.reserve(global_combinations.size());
+		for (auto const& itr : global_combinations) {
+			best_k_combinations.emplace_back(itr.first, // Pair exp, fac
+			                                 itr.second // N of times it appeared
+			);
+		}
+		// We sort combinations based on times they appeared
+		std::sort(best_k_combinations.begin(), best_k_combinations.end(), compare_best_combinations);
+		if (best_k_combinations.size() < stt.k_combinations) { stt.k_combinations = best_k_combinations.size(); }
+
+		// Save k' best exp, fac combination pairs
+		for (size_t i {0}; i < stt.k_combinations; i++) {
+			stt.best_k_combinations.push_back(best_k_combinations[i].first);
+		}
+	}
+
+	/*
+	 * Find the best combination of factor-exponent for a vector from within the best k combinations
+	 * This is ALP second level sampling
+	 */
+	static inline void
+	find_best_exponent_factor_from_combinations(const std::vector<std::pair<int, int>>& top_combinations,
+	                                            const uint8_t                           top_k,
+	                                            const T*                                input_vector,
+	                                            const size_t                            input_vector_size,
+	                                            uint8_t&                                factor,
+	                                            uint8_t&                                exponent) {
+		uint8_t  found_exponent {0};
+		uint8_t  found_factor {0};
+		uint64_t best_estimated_compression_size {0};
+		uint8_t  worse_threshold_count {0};
+
+		const int32_t sample_increments =
+		    std::max(1, static_cast<int32_t>(std::ceil(input_vector_size / config::SAMPLES_PER_ROWGROUP)));
+
+		// We try each K combination in search for the one which minimize the compression size in the vector
+		for (size_t k {0}; k < top_k; k++) {
+			const int    exp_idx    = top_combinations[k].first;
+			const int    factor_idx = top_combinations[k].second;
+			uint32_t     exception_count {0};
+			uint32_t     estimated_bits_per_value {0};
+			uint64_t     estimated_compression_size {0};
+			ENCODED_TYPE max_encoded_value {std::numeric_limits<ENCODED_TYPE>::min()};
+			ENCODED_TYPE min_encoded_value {std::numeric_limits<ENCODED_TYPE>::max()};
+
+			for (size_t sample_idx = 0; sample_idx < input_vector_size; sample_idx += sample_increments) {
+				const T            actual_value  = input_vector[sample_idx];
+				const ENCODED_TYPE encoded_value = encode_value(actual_value, factor_idx, exp_idx);
+				const T            decoded_value = AlpDecode<T>::decode_value(encoded_value, factor_idx, exp_idx);
+				if (decoded_value == actual_value) {
+					if (encoded_value > max_encoded_value) { max_encoded_value = encoded_value; }
+					if (encoded_value < min_encoded_value) { min_encoded_value = encoded_value; }
+				} else {
+					exception_count++;
+				}
+			}
+
+			// Evaluate factor/exponent performance (we optimize for FOR)
+			const uint64_t delta     = max_encoded_value - min_encoded_value;
+			estimated_bits_per_value = ceil(log2(delta + 1));
+			estimated_compression_size += config::SAMPLES_PER_ROWGROUP * estimated_bits_per_value;
+			estimated_compression_size += exception_count * (Constants<T>::EXCEPTION_SIZE + EXCEPTION_POSITION_SIZE);
+
+			if (k == 0) { // First try with first combination
+				best_estimated_compression_size = estimated_compression_size;
+				found_factor                    = factor_idx;
+				found_exponent                  = exp_idx;
+				continue; // Go to second
+			}
+			if (estimated_compression_size >=
+			    best_estimated_compression_size) { // If current is worse or equal than previous
+				worse_threshold_count += 1;
+				if (worse_threshold_count == SAMPLING_EARLY_EXIT_THRESHOLD) {
+					break; // We stop only if two are worse
+				}
+				continue;
+			}
+			// Otherwise we replace best and continue with next
+			best_estimated_compression_size = estimated_compression_size;
+			found_factor                    = factor_idx;
+			found_exponent                  = exp_idx;
+			worse_threshold_count           = 0;
+		}
+		exponent = found_exponent;
+		factor   = found_factor;
+	}
+
+	// DOUBLE
+	static inline void encode_simdized(const double*        input_vector,
+	                                   double*              exceptions,
+	                                   exp_p_t*             exceptions_positions,
+	                                   exp_c_t*             exceptions_count,
+	                                   int64_t*             encoded_integers,
+	                                   const factor_idx_t   factor_idx,
+	                                   const exponent_idx_t exponent_idx) {
+		alignas(64) static double   encoded_dbl_arr[1024];
+		alignas(64) static double   dbl_arr_without_specials[1024];
+		alignas(64) static uint64_t INDEX_ARR[1024];
+
+		exp_p_t  current_exceptions_count {0};
+		uint64_t exceptions_idx {0};
+
+		// make copy of input with all special values replaced by  ENCODING_UPPER_LIMIT
+		const auto* tmp_input = reinterpret_cast<const uint64_t*>(input_vector);
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			const auto is_special =
+			    ((tmp_input[i] & 0x7FFFFFFFFFFFFFFF) >=
+			     0x7FF0000000000000) // any NaN, +inf and -inf (https://stackoverflow.com/questions/29730530/)
+			    || tmp_input[i] == Constants<double>::NEGATIVE_ZERO;
+
+			if (is_special) {
+				dbl_arr_without_specials[i] = ENCODING_UPPER_LIMIT;
+			} else {
+				dbl_arr_without_specials[i] = input_vector[i];
+			}
+		}
+
+#pragma clang loop vectorize_width(64)
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			auto const actual_value = dbl_arr_without_specials[i];
+
+			// Attempt conversion
+			const int64_t encoded_value = encode_value<false>(actual_value, factor_idx, exponent_idx);
+			encoded_integers[i]         = encoded_value;
+			const double decoded_value  = AlpDecode<T>::decode_value(encoded_value, factor_idx, exponent_idx);
+			encoded_dbl_arr[i]          = decoded_value;
+		}
+
+#ifdef __AVX512F__
+		for (size_t i {0}; i < config::VECTOR_SIZE; i = i + 8) {
+			__m512d l            = _mm512_loadu_pd(tmp_dbl_arr + i);
+			__m512d r            = _mm512_loadu_pd(input_vector + i);
+			__m512i index        = _mm512_loadu_pd(INDEX_ARR + i);
+			auto    is_exception = _mm512_cmpneq_pd_mask(l, r);
+			_mm512_mask_compressstoreu_pd(tmp_index + exceptions_idx, is_exception, index);
+			exceptions_idx += LOOKUP_TABLE[is_exception];
+		}
+#else
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			auto l                    = encoded_dbl_arr[i];
+			auto r                    = dbl_arr_without_specials[i];
+			auto is_exception         = (l != r);
+			INDEX_ARR[exceptions_idx] = i;
+			exceptions_idx += is_exception;
+		}
+#endif
+
+		int64_t a_non_exception_value = 0;
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			if (i != INDEX_ARR[i]) {
+				a_non_exception_value = encoded_integers[i];
+				break;
+			}
+		}
+
+		for (size_t j {0}; j < exceptions_idx; j++) {
+			size_t     i                                   = INDEX_ARR[j];
+			const auto actual_value                        = input_vector[i];
+			encoded_integers[i]                            = a_non_exception_value;
+			exceptions[current_exceptions_count]           = actual_value;
+			exceptions_positions[current_exceptions_count] = i;
+			current_exceptions_count                       = current_exceptions_count + 1;
+		}
+
+		*exceptions_count = current_exceptions_count;
+	}
+
+	// FLOAT
+	static inline void encode_simdized(const float*         input_vector,
+	                                   float*               exceptions,
+	                                   exp_p_t*             exceptions_positions,
+	                                   exp_c_t*             exceptions_count,
+	                                   int64_t*             encoded_integers,
+	                                   const factor_idx_t   factor_idx,
+	                                   const exponent_idx_t exponent_idx) {
+		alignas(64) static float    encoded_dbl_arr[1024];
+		alignas(64) static float    dbl_arr_without_specials[1024];
+		alignas(64) static uint64_t INDEX_ARR[1024];
+
+		exp_p_t  current_exceptions_count {0};
+		uint64_t exceptions_idx {0};
+
+		// make copy of input with all special values replaced by  ENCODING_UPPER_LIMIT
+		const auto* tmp_input = reinterpret_cast<const uint32_t*>(input_vector);
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			const auto is_special =
+			    ((tmp_input[i] & 0x7FFFFFFF) >=
+			     0x7F800000) // any NaN, +inf and -inf (https://stackoverflow.com/questions/29730530/)
+			    || tmp_input[i] == Constants<float>::NEGATIVE_ZERO;
+
+			if (is_special) {
+				dbl_arr_without_specials[i] = ENCODING_UPPER_LIMIT;
+			} else {
+				dbl_arr_without_specials[i] = input_vector[i];
+			}
+		}
+
+#pragma clang loop vectorize_width(64)
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			auto const actual_value = dbl_arr_without_specials[i];
+
+			// Attempt conversion
+			const int64_t encoded_value = encode_value<false>(actual_value, factor_idx, exponent_idx);
+			encoded_integers[i]         = encoded_value;
+			const float decoded_value   = AlpDecode<T>::decode_value(encoded_value, factor_idx, exponent_idx);
+			encoded_dbl_arr[i]          = decoded_value;
+		}
+
+#ifdef __AVX512F__
+		for (size_t i {0}; i < config::VECTOR_SIZE; i = i + 16) {
+			__m512  l            = _mm512_loadu_ps(tmp_dbl_arr + i);
+			__m512  r            = _mm512_loadu_ps(input_vector + i);
+			__m512i index        = _mm512_loadu_ps(INDEX_ARR + i);
+			auto    is_exception = _mm512_cmpneq_ps_mask(l, r);
+			_mm512_mask_compressstoreu_ps(tmp_index + exceptions_idx, is_exception, index);
+			exceptions_idx += LOOKUP_TABLE[is_exception];
+		}
+#else
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			auto l                    = encoded_dbl_arr[i];
+			auto r                    = dbl_arr_without_specials[i];
+			auto is_exception         = (l != r);
+			INDEX_ARR[exceptions_idx] = i;
+			exceptions_idx += is_exception;
+		}
+#endif
+
+		int64_t a_non_exception_value = 0;
+		for (size_t i {0}; i < config::VECTOR_SIZE; i++) {
+			if (i != INDEX_ARR[i]) {
+				a_non_exception_value = encoded_integers[i];
+				break;
+			}
+		}
+
+		for (size_t j {0}; j < exceptions_idx; j++) {
+			size_t     i                                   = INDEX_ARR[j];
+			const auto actual_value                        = input_vector[i];
+			encoded_integers[i]                            = a_non_exception_value;
+			exceptions[current_exceptions_count]           = actual_value;
+			exceptions_positions[current_exceptions_count] = i;
+			current_exceptions_count                       = current_exceptions_count + 1;
+		}
+
+		*exceptions_count = current_exceptions_count;
+	}
+
+	static inline void encode(const T*  input_vector,
+	                          T*        exceptions,
+	                          uint32_t* exceptions_positions,
+	                          uint32_t* exceptions_count,
+	                          int64_t*  encoded_integers,
+	                          state&    stt) {
+
+		if (stt.k_combinations > 1) { // Only if more than 1 found top combinations we sample and search
+			find_best_exponent_factor_from_combinations(
+			    stt.best_k_combinations, stt.k_combinations, input_vector, stt.vector_size, stt.fac, stt.exp);
+		} else {
+			stt.exp = stt.best_k_combinations[0].first;
+			stt.fac = stt.best_k_combinations[0].second;
+		}
+		encode_simdized(
+		    input_vector, exceptions, exceptions_positions, exceptions_count, encoded_integers, stt.fac, stt.exp);
+	}
+
+	static inline void
+	init(const T* data_column, const size_t column_offset, const size_t tuples_count, T* sample_arr, state& stt) {
+		stt.scheme           = SCHEME::ALP;
+		stt.sampled_values_n = sampler::first_level_sample<T>(data_column, column_offset, tuples_count, sample_arr);
+		stt.k_combinations   = config::MAX_K_COMBINATIONS;
+		stt.best_k_combinations.clear();
+		find_top_k_combinations(sample_arr, stt);
+	}
+};
+
+} // namespace alp
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/sampler.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/sampler.hpp
new file mode 100644
index 0000000000..88d2d6001f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/sampler.hpp
@@ -0,0 +1,52 @@
+#ifndef ALP_SAMPLER_HPP
+#define ALP_SAMPLER_HPP
+
+#include "alp/config.hpp"
+#include <algorithm>
+#include <cmath>
+
+namespace alp::sampler {
+
+template <class T>
+inline size_t first_level_sample(const T* data, const size_t data_offset, const size_t data_size, T* data_sample) {
+	const size_t left_in_data          = data_size - data_offset;
+	const size_t portion_to_sample     = std::min(config::ROWGROUP_SIZE, left_in_data);
+	const size_t available_alp_vectors = std::ceil(static_cast<double>(portion_to_sample) / config::VECTOR_SIZE);
+	size_t       sample_idx            = 0;
+	size_t       data_idx              = data_offset;
+
+	for (size_t vector_idx = 0; vector_idx < available_alp_vectors; vector_idx++) {
+		const size_t current_vector_n_values = std::min(data_size - data_idx, config::VECTOR_SIZE);
+
+		//! We sample equidistant vectors; to do this we skip a fixed values of vectors
+		//! If we are not in the correct jump, we do not take sample from this vector
+		if (const bool must_select_rowgroup_sample = (vector_idx % config::ROWGROUP_SAMPLES_JUMP) == 0;
+		    !must_select_rowgroup_sample) {
+			data_idx += current_vector_n_values;
+			continue;
+		}
+
+		const size_t n_sampled_increments = std::max(
+		    1,
+		    static_cast<int32_t>(std::ceil(static_cast<double>(current_vector_n_values) / config::SAMPLES_PER_VECTOR)));
+
+		//! We do not take samples of non-complete duckdb vectors (usually the last one)
+		//! Except in the case of too little data
+		if (current_vector_n_values < config::SAMPLES_PER_VECTOR && sample_idx != 0) {
+			data_idx += current_vector_n_values;
+			continue;
+		}
+
+		// Storing the sample of that vector
+		for (size_t i = 0; i < current_vector_n_values; i += n_sampled_increments) {
+			data_sample[sample_idx] = data[data_idx + i];
+			sample_idx++;
+		}
+		data_idx += current_vector_n_values;
+	}
+	return sample_idx;
+}
+
+} // namespace alp::sampler
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/state.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/state.hpp
new file mode 100644
index 0000000000..d6c9c68677
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/state.hpp
@@ -0,0 +1,27 @@
+#ifndef ALP_STATE_HPP
+#define ALP_STATE_HPP
+
+#include "alp/common.hpp"
+#include "alp/config.hpp"
+#include "alp/constants.hpp"
+#include <cstdint>
+#include <vector>
+
+namespace alp {
+struct state {
+	SCHEME   scheme {SCHEME::ALP};
+	uint32_t vector_size {config::VECTOR_SIZE};
+	uint32_t exceptions_count {0};
+	size_t   sampled_values_n {0};
+
+	// ALP
+	uint16_t                         k_combinations {5};
+	std::vector<std::pair<int, int>> best_k_combinations;
+	uint8_t                          exp;
+	uint8_t                          fac;
+	bw_t                             bit_width;
+	int64_t                          for_base;
+};
+} // namespace alp
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/storer.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/storer.hpp
new file mode 100644
index 0000000000..bc761fbcbd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/storer.hpp
@@ -0,0 +1,56 @@
+#ifndef ALP_API_MEM_STORER_HPP
+#define ALP_API_MEM_STORER_HPP
+
+#include <cstdint>
+#include <string.h>
+
+namespace alp { namespace storer {
+
+template <bool DRY = false>
+struct MemStorer {
+
+	uint8_t* out_buffer;
+	size_t   buffer_offset;
+
+	MemStorer() {}
+	MemStorer(uint8_t* out_buffer)
+	    : out_buffer(out_buffer)
+	    , buffer_offset(0) {}
+
+	void set_buffer(uint8_t* out) { out_buffer = out; }
+
+	void reset() { buffer_offset = 0; }
+
+	size_t get_size() { return buffer_offset; }
+
+	void store(void* in, size_t bytes_to_store) {
+		if (!DRY) memcpy((void*)(out_buffer + buffer_offset), in, bytes_to_store);
+		buffer_offset += bytes_to_store;
+	}
+};
+
+struct MemReader {
+
+	uint8_t* in_buffer;
+	size_t   buffer_offset;
+
+	MemReader() {}
+	MemReader(uint8_t* in_buffer)
+	    : in_buffer(in_buffer)
+	    , buffer_offset(0) {}
+
+	void set_buffer(uint8_t* in) { in_buffer = in; }
+
+	void reset() { buffer_offset = 0; }
+
+	size_t get_size() { return buffer_offset; }
+
+	void read(void* out, size_t bytes_to_read) {
+		memcpy(out, (void*)(in_buffer + buffer_offset), bytes_to_read);
+		buffer_offset += bytes_to_read;
+	}
+};
+
+}} // namespace alp::storer
+
+#endif
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/utils.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/utils.hpp
new file mode 100644
index 0000000000..bf570125a9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/alp/include/alp/utils.hpp
@@ -0,0 +1,74 @@
+#ifndef ALP_UTILS_HPP
+#define ALP_UTILS_HPP
+
+#include "alp/config.hpp"
+#include "alp/encode.hpp"
+#include <cmath>
+#include <random>
+
+namespace alp {
+
+template <class T>
+struct AlpApiUtils {
+
+	static size_t get_rowgroup_count(size_t values_count) {
+		return std::ceil((double)values_count / config::ROWGROUP_SIZE);
+	};
+
+	static size_t get_complete_vector_count(size_t n_values) {
+		return std::floor(static_cast<double>(n_values) / config::VECTOR_SIZE);
+	}
+
+	/*
+	 * Function to get the size of a vector after bit packing
+	 * Note that we always store VECTOR_SIZE size vectors
+	 */
+	static size_t get_size_after_bitpacking(uint8_t bit_width) {
+		return align_value<size_t, 8>(config::VECTOR_SIZE * bit_width) / 8;
+	}
+
+	template <class M, M val = 8>
+	static M align_value(M n) {
+		return ((n + (val - 1)) / val) * val;
+	}
+
+	static void fill_incomplete_alp_vector(T*        input_vector,
+	                                       T*        exceptions,
+	                                       uint32_t* exceptions_positions,
+	                                       uint32_t* exceptions_count,
+	                                       int64_t*  encoded_integers,
+	                                       state&    stt) {
+
+		static auto* tmp_index = new (std::align_val_t {64}) uint64_t[1024];
+
+		// We fill a vector with 0s since these values will never be exceptions
+		for (size_t i = stt.vector_size; i < config::VECTOR_SIZE; i++) {
+			input_vector[i] = 0.0;
+		}
+		// We encode the vector filled with the dummy values
+		AlpEncode<T>::encode(input_vector, exceptions, exceptions_positions, exceptions_count, encoded_integers, stt);
+		T a_non_exception_value = 0.0;
+		// We lookup the first non exception value from the true vector values
+		for (size_t i {0}; i < stt.vector_size; i++) {
+			if (i != tmp_index[i]) {
+				a_non_exception_value = input_vector[i];
+				break;
+			}
+		}
+		// We fill the vector with this dummy value
+		for (size_t i = stt.vector_size; i < config::VECTOR_SIZE; i++) {
+			input_vector[i] = a_non_exception_value;
+		}
+	}
+
+	static void fill_incomplete_alprd_vector(T* input_vector, const state& stt) {
+		// We just fill the vector with the first value
+		const T first_vector_value = input_vector[0];
+		for (size_t i = stt.vector_size; i < config::VECTOR_SIZE; i++) {
+			input_vector[i] = first_vector_value;
+		}
+	}
+};
+} // namespace alp
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/CMakeLists.txt
new file mode 100644
index 0000000000..2c8b639231
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/CMakeLists.txt
@@ -0,0 +1,23 @@
+if(${AUTO_UPDATE_GRAMMAR})
+        add_custom_command(
+                OUTPUT
+                        ${CMAKE_CURRENT_SOURCE_DIR}/cypher_lexer.cpp
+                        ${CMAKE_CURRENT_SOURCE_DIR}/cypher_parser.cpp
+                        ${CMAKE_CURRENT_SOURCE_DIR}/include/cypher_lexer.h
+                        ${CMAKE_CURRENT_SOURCE_DIR}/include/cypher_parser.h
+                COMMAND cmake -D ROOT_DIR=${PROJECT_SOURCE_DIR} -P generate_grammar.cmake
+                DEPENDS
+                        ${PROJECT_SOURCE_DIR}/src/antlr4/Cypher.g4
+                        ${PROJECT_SOURCE_DIR}/scripts/antlr4/generate_grammar.cmake
+                WORKING_DIRECTORY ${PROJECT_SOURCE_DIR}/scripts/antlr4)
+endif()
+
+add_library(antlr4_cypher
+        STATIC
+        cypher_lexer.cpp
+        cypher_parser.cpp)
+
+target_include_directories(antlr4_cypher
+        PRIVATE ../antlr4_runtime/src)
+
+target_link_libraries(antlr4_cypher PRIVATE antlr4_runtime)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/cypher_lexer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/cypher_lexer.cpp
new file mode 100644
index 0000000000..6cffcad8ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/cypher_lexer.cpp
@@ -0,0 +1,965 @@
+
+// Generated from Cypher.g4 by ANTLR 4.13.1
+
+
+#include "cypher_lexer.h"
+
+
+using namespace antlr4;
+
+
+
+using namespace antlr4;
+
+namespace {
+
+struct CypherLexerStaticData final {
+  CypherLexerStaticData(std::vector<std::string> ruleNames,
+                          std::vector<std::string> channelNames,
+                          std::vector<std::string> modeNames,
+                          std::vector<std::string> literalNames,
+                          std::vector<std::string> symbolicNames)
+      : ruleNames(std::move(ruleNames)), channelNames(std::move(channelNames)),
+        modeNames(std::move(modeNames)), literalNames(std::move(literalNames)),
+        symbolicNames(std::move(symbolicNames)),
+        vocabulary(this->literalNames, this->symbolicNames) {}
+
+  CypherLexerStaticData(const CypherLexerStaticData&) = delete;
+  CypherLexerStaticData(CypherLexerStaticData&&) = delete;
+  CypherLexerStaticData& operator=(const CypherLexerStaticData&) = delete;
+  CypherLexerStaticData& operator=(CypherLexerStaticData&&) = delete;
+
+  std::vector<antlr4::dfa::DFA> decisionToDFA;
+  antlr4::atn::PredictionContextCache sharedContextCache;
+  const std::vector<std::string> ruleNames;
+  const std::vector<std::string> channelNames;
+  const std::vector<std::string> modeNames;
+  const std::vector<std::string> literalNames;
+  const std::vector<std::string> symbolicNames;
+  const antlr4::dfa::Vocabulary vocabulary;
+  antlr4::atn::SerializedATNView serializedATN;
+  std::unique_ptr<antlr4::atn::ATN> atn;
+};
+
+::antlr4::internal::OnceFlag cypherlexerLexerOnceFlag;
+#if ANTLR4_USE_THREAD_LOCAL_CACHE
+static thread_local
+#endif
+CypherLexerStaticData *cypherlexerLexerStaticData = nullptr;
+
+void cypherlexerLexerInitialize() {
+#if ANTLR4_USE_THREAD_LOCAL_CACHE
+  if (cypherlexerLexerStaticData != nullptr) {
+    return;
+  }
+#else
+  assert(cypherlexerLexerStaticData == nullptr);
+#endif
+  auto staticData = std::make_unique<CypherLexerStaticData>(
+    std::vector<std::string>{
+      "T__0", "T__1", "T__2", "T__3", "T__4", "T__5", "T__6", "T__7", "T__8", 
+      "T__9", "T__10", "T__11", "T__12", "T__13", "T__14", "T__15", "T__16", 
+      "T__17", "T__18", "T__19", "T__20", "T__21", "T__22", "T__23", "T__24", 
+      "T__25", "T__26", "T__27", "T__28", "T__29", "T__30", "T__31", "T__32", 
+      "T__33", "T__34", "T__35", "T__36", "T__37", "T__38", "T__39", "T__40", 
+      "T__41", "T__42", "T__43", "ACYCLIC", "ANY", "ADD", "ALL", "ALTER", 
+      "AND", "AS", "ASC", "ASCENDING", "ATTACH", "BEGIN", "BY", "CALL", 
+      "CASE", "CAST", "CHECKPOINT", "COLUMN", "COMMENT", "COMMIT", "COMMIT_SKIP_CHECKPOINT", 
+      "CONTAINS", "COPY", "COUNT", "CREATE", "CYCLE", "DATABASE", "DBTYPE", 
+      "DEFAULT", "DELETE", "DESC", "DESCENDING", "DETACH", "DISTINCT", "DROP", 
+      "ELSE", "END", "ENDS", "EXISTS", "EXPLAIN", "EXPORT", "EXTENSION", 
+      "FALSE", "FROM", "FORCE", "GLOB", "GRAPH", "GROUP", "HEADERS", "HINT", 
+      "IMPORT", "IF", "IN", "INCREMENT", "INSTALL", "IS", "JOIN", "KEY", 
+      "LIMIT", "LOAD", "LOGICAL", "MACRO", "MATCH", "MAXVALUE", "MERGE", 
+      "MINVALUE", "MULTI_JOIN", "NO", "NODE", "NOT", "NONE", "NULL", "ON", 
+      "ONLY", "OPTIONAL", "OR", "ORDER", "PRIMARY", "PROFILE", "PROJECT", 
+      "READ", "REL", "RENAME", "RETURN", "ROLLBACK", "ROLLBACK_SKIP_CHECKPOINT", 
+      "SEQUENCE", "SET", "SHORTEST", "START", "STARTS", "STRUCT", "TABLE", 
+      "THEN", "TO", "TRAIL", "TRANSACTION", "TRUE", "TYPE", "UNION", "UNWIND", 
+      "UNINSTALL", "UPDATE", "USE", "WHEN", "WHERE", "WITH", "WRITE", "WSHORTEST", 
+      "XOR", "SINGLE", "YIELD", "USER", "PASSWORD", "ROLE", "MAP", "DECIMAL", 
+      "STAR", "L_SKIP", "INVALID_NOT_EQUAL", "COLON", "DOTDOT", "MINUS", 
+      "FACTORIAL", "StringLiteral", "EscapedChar", "DecimalInteger", "HexLetter", 
+      "HexDigit", "Digit", "NonZeroDigit", "NonZeroOctDigit", "ZeroDigit", 
+      "ExponentDecimalReal", "RegularDecimalReal", "UnescapedSymbolicName", 
+      "IdentifierStart", "IdentifierPart", "EscapedSymbolicName", "SP", 
+      "WHITESPACE", "CypherComment", "FF", "EscapedSymbolicName_0", "RS", 
+      "ID_Continue", "Comment_1", "StringLiteral_1", "Comment_3", "Comment_2", 
+      "GS", "FS", "CR", "Sc", "SPACE", "Pc", "TAB", "StringLiteral_0", "LF", 
+      "VT", "US", "ID_Start", "Unknown"
+    },
+    std::vector<std::string>{
+      "DEFAULT_TOKEN_CHANNEL", "HIDDEN"
+    },
+    std::vector<std::string>{
+      "DEFAULT_MODE"
+    },
+    std::vector<std::string>{
+      "", "';'", "'('", "')'", "','", "'.'", "'='", "'['", "']'", "'{'", 
+      "'}'", "'|'", "'<>'", "'<'", "'<='", "'>'", "'>='", "'&'", "'>>'", 
+      "'<<'", "'+'", "'/'", "'%'", "'^'", "'=~'", "'$'", "'\\u27E8'", "'\\u3008'", 
+      "'\\uFE64'", "'\\uFF1C'", "'\\u27E9'", "'\\u3009'", "'\\uFE65'", "'\\uFF1E'", 
+      "'\\u00AD'", "'\\u2010'", "'\\u2011'", "'\\u2012'", "'\\u2013'", "'\\u2014'", 
+      "'\\u2015'", "'\\u2212'", "'\\uFE58'", "'\\uFE63'", "'\\uFF0D'", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "'*'", "", "'!='", 
+      "':'", "'..'", "'-'", "'!'", "", "", "", "", "", "", "", "", "'0'"
+    },
+    std::vector<std::string>{
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "ACYCLIC", "ANY", "ADD", 
+      "ALL", "ALTER", "AND", "AS", "ASC", "ASCENDING", "ATTACH", "BEGIN", 
+      "BY", "CALL", "CASE", "CAST", "CHECKPOINT", "COLUMN", "COMMENT", "COMMIT", 
+      "COMMIT_SKIP_CHECKPOINT", "CONTAINS", "COPY", "COUNT", "CREATE", "CYCLE", 
+      "DATABASE", "DBTYPE", "DEFAULT", "DELETE", "DESC", "DESCENDING", "DETACH", 
+      "DISTINCT", "DROP", "ELSE", "END", "ENDS", "EXISTS", "EXPLAIN", "EXPORT", 
+      "EXTENSION", "FALSE", "FROM", "FORCE", "GLOB", "GRAPH", "GROUP", "HEADERS", 
+      "HINT", "IMPORT", "IF", "IN", "INCREMENT", "INSTALL", "IS", "JOIN", 
+      "KEY", "LIMIT", "LOAD", "LOGICAL", "MACRO", "MATCH", "MAXVALUE", "MERGE", 
+      "MINVALUE", "MULTI_JOIN", "NO", "NODE", "NOT", "NONE", "NULL", "ON", 
+      "ONLY", "OPTIONAL", "OR", "ORDER", "PRIMARY", "PROFILE", "PROJECT", 
+      "READ", "REL", "RENAME", "RETURN", "ROLLBACK", "ROLLBACK_SKIP_CHECKPOINT", 
+      "SEQUENCE", "SET", "SHORTEST", "START", "STARTS", "STRUCT", "TABLE", 
+      "THEN", "TO", "TRAIL", "TRANSACTION", "TRUE", "TYPE", "UNION", "UNWIND", 
+      "UNINSTALL", "UPDATE", "USE", "WHEN", "WHERE", "WITH", "WRITE", "WSHORTEST", 
+      "XOR", "SINGLE", "YIELD", "USER", "PASSWORD", "ROLE", "MAP", "DECIMAL", 
+      "STAR", "L_SKIP", "INVALID_NOT_EQUAL", "COLON", "DOTDOT", "MINUS", 
+      "FACTORIAL", "StringLiteral", "EscapedChar", "DecimalInteger", "HexLetter", 
+      "HexDigit", "Digit", "NonZeroDigit", "NonZeroOctDigit", "ZeroDigit", 
+      "ExponentDecimalReal", "RegularDecimalReal", "UnescapedSymbolicName", 
+      "IdentifierStart", "IdentifierPart", "EscapedSymbolicName", "SP", 
+      "WHITESPACE", "CypherComment", "Unknown"
+    }
+  );
+  static const int32_t serializedATNSegment[] = {
+  	4,0,186,1527,6,-1,2,0,7,0,2,1,7,1,2,2,7,2,2,3,7,3,2,4,7,4,2,5,7,5,2,6,
+  	7,6,2,7,7,7,2,8,7,8,2,9,7,9,2,10,7,10,2,11,7,11,2,12,7,12,2,13,7,13,2,
+  	14,7,14,2,15,7,15,2,16,7,16,2,17,7,17,2,18,7,18,2,19,7,19,2,20,7,20,2,
+  	21,7,21,2,22,7,22,2,23,7,23,2,24,7,24,2,25,7,25,2,26,7,26,2,27,7,27,2,
+  	28,7,28,2,29,7,29,2,30,7,30,2,31,7,31,2,32,7,32,2,33,7,33,2,34,7,34,2,
+  	35,7,35,2,36,7,36,2,37,7,37,2,38,7,38,2,39,7,39,2,40,7,40,2,41,7,41,2,
+  	42,7,42,2,43,7,43,2,44,7,44,2,45,7,45,2,46,7,46,2,47,7,47,2,48,7,48,2,
+  	49,7,49,2,50,7,50,2,51,7,51,2,52,7,52,2,53,7,53,2,54,7,54,2,55,7,55,2,
+  	56,7,56,2,57,7,57,2,58,7,58,2,59,7,59,2,60,7,60,2,61,7,61,2,62,7,62,2,
+  	63,7,63,2,64,7,64,2,65,7,65,2,66,7,66,2,67,7,67,2,68,7,68,2,69,7,69,2,
+  	70,7,70,2,71,7,71,2,72,7,72,2,73,7,73,2,74,7,74,2,75,7,75,2,76,7,76,2,
+  	77,7,77,2,78,7,78,2,79,7,79,2,80,7,80,2,81,7,81,2,82,7,82,2,83,7,83,2,
+  	84,7,84,2,85,7,85,2,86,7,86,2,87,7,87,2,88,7,88,2,89,7,89,2,90,7,90,2,
+  	91,7,91,2,92,7,92,2,93,7,93,2,94,7,94,2,95,7,95,2,96,7,96,2,97,7,97,2,
+  	98,7,98,2,99,7,99,2,100,7,100,2,101,7,101,2,102,7,102,2,103,7,103,2,104,
+  	7,104,2,105,7,105,2,106,7,106,2,107,7,107,2,108,7,108,2,109,7,109,2,110,
+  	7,110,2,111,7,111,2,112,7,112,2,113,7,113,2,114,7,114,2,115,7,115,2,116,
+  	7,116,2,117,7,117,2,118,7,118,2,119,7,119,2,120,7,120,2,121,7,121,2,122,
+  	7,122,2,123,7,123,2,124,7,124,2,125,7,125,2,126,7,126,2,127,7,127,2,128,
+  	7,128,2,129,7,129,2,130,7,130,2,131,7,131,2,132,7,132,2,133,7,133,2,134,
+  	7,134,2,135,7,135,2,136,7,136,2,137,7,137,2,138,7,138,2,139,7,139,2,140,
+  	7,140,2,141,7,141,2,142,7,142,2,143,7,143,2,144,7,144,2,145,7,145,2,146,
+  	7,146,2,147,7,147,2,148,7,148,2,149,7,149,2,150,7,150,2,151,7,151,2,152,
+  	7,152,2,153,7,153,2,154,7,154,2,155,7,155,2,156,7,156,2,157,7,157,2,158,
+  	7,158,2,159,7,159,2,160,7,160,2,161,7,161,2,162,7,162,2,163,7,163,2,164,
+  	7,164,2,165,7,165,2,166,7,166,2,167,7,167,2,168,7,168,2,169,7,169,2,170,
+  	7,170,2,171,7,171,2,172,7,172,2,173,7,173,2,174,7,174,2,175,7,175,2,176,
+  	7,176,2,177,7,177,2,178,7,178,2,179,7,179,2,180,7,180,2,181,7,181,2,182,
+  	7,182,2,183,7,183,2,184,7,184,2,185,7,185,2,186,7,186,2,187,7,187,2,188,
+  	7,188,2,189,7,189,2,190,7,190,2,191,7,191,2,192,7,192,2,193,7,193,2,194,
+  	7,194,2,195,7,195,2,196,7,196,2,197,7,197,2,198,7,198,2,199,7,199,2,200,
+  	7,200,2,201,7,201,2,202,7,202,2,203,7,203,2,204,7,204,2,205,7,205,1,0,
+  	1,0,1,1,1,1,1,2,1,2,1,3,1,3,1,4,1,4,1,5,1,5,1,6,1,6,1,7,1,7,1,8,1,8,1,
+  	9,1,9,1,10,1,10,1,11,1,11,1,11,1,12,1,12,1,13,1,13,1,13,1,14,1,14,1,15,
+  	1,15,1,15,1,16,1,16,1,17,1,17,1,17,1,18,1,18,1,18,1,19,1,19,1,20,1,20,
+  	1,21,1,21,1,22,1,22,1,23,1,23,1,23,1,24,1,24,1,25,1,25,1,26,1,26,1,27,
+  	1,27,1,28,1,28,1,29,1,29,1,30,1,30,1,31,1,31,1,32,1,32,1,33,1,33,1,34,
+  	1,34,1,35,1,35,1,36,1,36,1,37,1,37,1,38,1,38,1,39,1,39,1,40,1,40,1,41,
+  	1,41,1,42,1,42,1,43,1,43,1,44,1,44,1,44,1,44,1,44,1,44,1,44,1,44,1,45,
+  	1,45,1,45,1,45,1,46,1,46,1,46,1,46,1,47,1,47,1,47,1,47,1,48,1,48,1,48,
+  	1,48,1,48,1,48,1,49,1,49,1,49,1,49,1,50,1,50,1,50,1,51,1,51,1,51,1,51,
+  	1,52,1,52,1,52,1,52,1,52,1,52,1,52,1,52,1,52,1,52,1,53,1,53,1,53,1,53,
+  	1,53,1,53,1,53,1,54,1,54,1,54,1,54,1,54,1,54,1,55,1,55,1,55,1,56,1,56,
+  	1,56,1,56,1,56,1,57,1,57,1,57,1,57,1,57,1,58,1,58,1,58,1,58,1,58,1,59,
+  	1,59,1,59,1,59,1,59,1,59,1,59,1,59,1,59,1,59,1,59,1,60,1,60,1,60,1,60,
+  	1,60,1,60,1,60,1,61,1,61,1,61,1,61,1,61,1,61,1,61,1,61,1,62,1,62,1,62,
+  	1,62,1,62,1,62,1,62,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,
+  	1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,64,
+  	1,64,1,64,1,64,1,64,1,64,1,64,1,64,1,64,1,65,1,65,1,65,1,65,1,65,1,66,
+  	1,66,1,66,1,66,1,66,1,66,1,67,1,67,1,67,1,67,1,67,1,67,1,67,1,68,1,68,
+  	1,68,1,68,1,68,1,68,1,69,1,69,1,69,1,69,1,69,1,69,1,69,1,69,1,69,1,70,
+  	1,70,1,70,1,70,1,70,1,70,1,70,1,71,1,71,1,71,1,71,1,71,1,71,1,71,1,71,
+  	1,72,1,72,1,72,1,72,1,72,1,72,1,72,1,73,1,73,1,73,1,73,1,73,1,74,1,74,
+  	1,74,1,74,1,74,1,74,1,74,1,74,1,74,1,74,1,74,1,75,1,75,1,75,1,75,1,75,
+  	1,75,1,75,1,76,1,76,1,76,1,76,1,76,1,76,1,76,1,76,1,76,1,77,1,77,1,77,
+  	1,77,1,77,1,78,1,78,1,78,1,78,1,78,1,79,1,79,1,79,1,79,1,80,1,80,1,80,
+  	1,80,1,80,1,81,1,81,1,81,1,81,1,81,1,81,1,81,1,82,1,82,1,82,1,82,1,82,
+  	1,82,1,82,1,82,1,83,1,83,1,83,1,83,1,83,1,83,1,83,1,84,1,84,1,84,1,84,
+  	1,84,1,84,1,84,1,84,1,84,1,84,1,85,1,85,1,85,1,85,1,85,1,85,1,86,1,86,
+  	1,86,1,86,1,86,1,87,1,87,1,87,1,87,1,87,1,87,1,88,1,88,1,88,1,88,1,88,
+  	1,89,1,89,1,89,1,89,1,89,1,89,1,90,1,90,1,90,1,90,1,90,1,90,1,91,1,91,
+  	1,91,1,91,1,91,1,91,1,91,1,91,1,92,1,92,1,92,1,92,1,92,1,93,1,93,1,93,
+  	1,93,1,93,1,93,1,93,1,94,1,94,1,94,1,95,1,95,1,95,1,96,1,96,1,96,1,96,
+  	1,96,1,96,1,96,1,96,1,96,1,96,1,97,1,97,1,97,1,97,1,97,1,97,1,97,1,97,
+  	1,98,1,98,1,98,1,99,1,99,1,99,1,99,1,99,1,100,1,100,1,100,1,100,1,101,
+  	1,101,1,101,1,101,1,101,1,101,1,102,1,102,1,102,1,102,1,102,1,103,1,103,
+  	1,103,1,103,1,103,1,103,1,103,1,103,1,104,1,104,1,104,1,104,1,104,1,104,
+  	1,105,1,105,1,105,1,105,1,105,1,105,1,106,1,106,1,106,1,106,1,106,1,106,
+  	1,106,1,106,1,106,1,107,1,107,1,107,1,107,1,107,1,107,1,108,1,108,1,108,
+  	1,108,1,108,1,108,1,108,1,108,1,108,1,109,1,109,1,109,1,109,1,109,1,109,
+  	1,109,1,109,1,109,1,109,1,109,1,110,1,110,1,110,1,111,1,111,1,111,1,111,
+  	1,111,1,112,1,112,1,112,1,112,1,113,1,113,1,113,1,113,1,113,1,114,1,114,
+  	1,114,1,114,1,114,1,115,1,115,1,115,1,116,1,116,1,116,1,116,1,116,1,117,
+  	1,117,1,117,1,117,1,117,1,117,1,117,1,117,1,117,1,118,1,118,1,118,1,119,
+  	1,119,1,119,1,119,1,119,1,119,1,120,1,120,1,120,1,120,1,120,1,120,1,120,
+  	1,120,1,121,1,121,1,121,1,121,1,121,1,121,1,121,1,121,1,122,1,122,1,122,
+  	1,122,1,122,1,122,1,122,1,122,1,123,1,123,1,123,1,123,1,123,1,124,1,124,
+  	1,124,1,124,1,125,1,125,1,125,1,125,1,125,1,125,1,125,1,126,1,126,1,126,
+  	1,126,1,126,1,126,1,126,1,127,1,127,1,127,1,127,1,127,1,127,1,127,1,127,
+  	1,127,1,128,1,128,1,128,1,128,1,128,1,128,1,128,1,128,1,128,1,128,1,128,
+  	1,128,1,128,1,128,1,128,1,128,1,128,1,128,1,128,1,128,1,128,1,128,1,128,
+  	1,128,1,128,1,129,1,129,1,129,1,129,1,129,1,129,1,129,1,129,1,129,1,130,
+  	1,130,1,130,1,130,1,131,1,131,1,131,1,131,1,131,1,131,1,131,1,131,1,131,
+  	1,132,1,132,1,132,1,132,1,132,1,132,1,133,1,133,1,133,1,133,1,133,1,133,
+  	1,133,1,134,1,134,1,134,1,134,1,134,1,134,1,134,1,135,1,135,1,135,1,135,
+  	1,135,1,135,1,136,1,136,1,136,1,136,1,136,1,137,1,137,1,137,1,138,1,138,
+  	1,138,1,138,1,138,1,138,1,139,1,139,1,139,1,139,1,139,1,139,1,139,1,139,
+  	1,139,1,139,1,139,1,139,1,140,1,140,1,140,1,140,1,140,1,141,1,141,1,141,
+  	1,141,1,141,1,142,1,142,1,142,1,142,1,142,1,142,1,143,1,143,1,143,1,143,
+  	1,143,1,143,1,143,1,144,1,144,1,144,1,144,1,144,1,144,1,144,1,144,1,144,
+  	1,144,1,145,1,145,1,145,1,145,1,145,1,145,1,145,1,146,1,146,1,146,1,146,
+  	1,147,1,147,1,147,1,147,1,147,1,148,1,148,1,148,1,148,1,148,1,148,1,149,
+  	1,149,1,149,1,149,1,149,1,150,1,150,1,150,1,150,1,150,1,150,1,151,1,151,
+  	1,151,1,151,1,151,1,151,1,151,1,151,1,151,1,151,1,152,1,152,1,152,1,152,
+  	1,153,1,153,1,153,1,153,1,153,1,153,1,153,1,154,1,154,1,154,1,154,1,154,
+  	1,154,1,155,1,155,1,155,1,155,1,155,1,156,1,156,1,156,1,156,1,156,1,156,
+  	1,156,1,156,1,156,1,157,1,157,1,157,1,157,1,157,1,158,1,158,1,158,1,158,
+  	1,159,1,159,1,159,1,159,1,159,1,159,1,159,1,159,1,160,1,160,1,161,1,161,
+  	1,161,1,161,1,161,1,162,1,162,1,162,1,163,1,163,1,164,1,164,1,164,1,165,
+  	1,165,1,166,1,166,1,167,1,167,1,167,5,167,1294,8,167,10,167,12,167,1297,
+  	9,167,1,167,1,167,1,167,1,167,5,167,1303,8,167,10,167,12,167,1306,9,167,
+  	1,167,3,167,1309,8,167,1,168,1,168,1,168,1,168,1,168,1,168,1,168,1,168,
+  	1,168,1,168,1,168,1,168,1,168,1,168,1,168,1,168,1,168,1,168,1,168,1,168,
+  	1,168,1,168,3,168,1333,8,168,1,169,1,169,1,169,5,169,1338,8,169,10,169,
+  	12,169,1341,9,169,3,169,1343,8,169,1,170,3,170,1346,8,170,1,171,1,171,
+  	3,171,1350,8,171,1,172,1,172,3,172,1354,8,172,1,173,1,173,3,173,1358,
+  	8,173,1,174,1,174,1,175,1,175,1,176,4,176,1365,8,176,11,176,12,176,1366,
+  	1,176,4,176,1370,8,176,11,176,12,176,1371,1,176,1,176,4,176,1376,8,176,
+  	11,176,12,176,1377,1,176,1,176,4,176,1382,8,176,11,176,12,176,1383,3,
+  	176,1386,8,176,1,176,1,176,3,176,1390,8,176,1,176,4,176,1393,8,176,11,
+  	176,12,176,1394,1,177,5,177,1398,8,177,10,177,12,177,1401,9,177,1,177,
+  	1,177,4,177,1405,8,177,11,177,12,177,1406,1,178,1,178,5,178,1411,8,178,
+  	10,178,12,178,1414,9,178,1,179,1,179,3,179,1418,8,179,1,180,1,180,3,180,
+  	1422,8,180,1,181,1,181,5,181,1426,8,181,10,181,12,181,1429,9,181,1,181,
+  	4,181,1432,8,181,11,181,12,181,1433,1,182,4,182,1437,8,182,11,182,12,
+  	182,1438,1,183,1,183,1,183,1,183,1,183,1,183,1,183,1,183,1,183,1,183,
+  	1,183,1,183,3,183,1453,8,183,1,184,1,184,1,184,1,184,1,184,1,184,5,184,
+  	1461,8,184,10,184,12,184,1464,9,184,1,184,1,184,1,184,1,184,1,184,1,184,
+  	5,184,1472,8,184,10,184,12,184,1475,9,184,1,184,3,184,1478,8,184,1,184,
+  	1,184,3,184,1482,8,184,3,184,1484,8,184,1,185,1,185,1,186,1,186,1,187,
+  	1,187,1,188,1,188,1,189,1,189,1,190,1,190,1,191,1,191,1,192,1,192,1,193,
+  	1,193,1,194,1,194,1,195,1,195,1,196,1,196,1,197,1,197,1,198,1,198,1,199,
+  	1,199,1,200,1,200,1,201,1,201,1,202,1,202,1,203,1,203,1,204,1,204,1,205,
+  	1,205,0,0,206,1,1,3,2,5,3,7,4,9,5,11,6,13,7,15,8,17,9,19,10,21,11,23,
+  	12,25,13,27,14,29,15,31,16,33,17,35,18,37,19,39,20,41,21,43,22,45,23,
+  	47,24,49,25,51,26,53,27,55,28,57,29,59,30,61,31,63,32,65,33,67,34,69,
+  	35,71,36,73,37,75,38,77,39,79,40,81,41,83,42,85,43,87,44,89,45,91,46,
+  	93,47,95,48,97,49,99,50,101,51,103,52,105,53,107,54,109,55,111,56,113,
+  	57,115,58,117,59,119,60,121,61,123,62,125,63,127,64,129,65,131,66,133,
+  	67,135,68,137,69,139,70,141,71,143,72,145,73,147,74,149,75,151,76,153,
+  	77,155,78,157,79,159,80,161,81,163,82,165,83,167,84,169,85,171,86,173,
+  	87,175,88,177,89,179,90,181,91,183,92,185,93,187,94,189,95,191,96,193,
+  	97,195,98,197,99,199,100,201,101,203,102,205,103,207,104,209,105,211,
+  	106,213,107,215,108,217,109,219,110,221,111,223,112,225,113,227,114,229,
+  	115,231,116,233,117,235,118,237,119,239,120,241,121,243,122,245,123,247,
+  	124,249,125,251,126,253,127,255,128,257,129,259,130,261,131,263,132,265,
+  	133,267,134,269,135,271,136,273,137,275,138,277,139,279,140,281,141,283,
+  	142,285,143,287,144,289,145,291,146,293,147,295,148,297,149,299,150,301,
+  	151,303,152,305,153,307,154,309,155,311,156,313,157,315,158,317,159,319,
+  	160,321,161,323,162,325,163,327,164,329,165,331,166,333,167,335,168,337,
+  	169,339,170,341,171,343,172,345,173,347,174,349,175,351,176,353,177,355,
+  	178,357,179,359,180,361,181,363,182,365,183,367,184,369,185,371,0,373,
+  	0,375,0,377,0,379,0,381,0,383,0,385,0,387,0,389,0,391,0,393,0,395,0,397,
+  	0,399,0,401,0,403,0,405,0,407,0,409,0,411,186,1,0,48,2,0,65,65,97,97,
+  	2,0,67,67,99,99,2,0,89,89,121,121,2,0,76,76,108,108,2,0,73,73,105,105,
+  	2,0,78,78,110,110,2,0,68,68,100,100,2,0,84,84,116,116,2,0,69,69,101,101,
+  	2,0,82,82,114,114,2,0,83,83,115,115,2,0,71,71,103,103,2,0,72,72,104,104,
+  	2,0,66,66,98,98,2,0,75,75,107,107,2,0,80,80,112,112,2,0,79,79,111,111,
+  	2,0,85,85,117,117,2,0,77,77,109,109,2,0,70,70,102,102,2,0,88,88,120,120,
+  	2,0,74,74,106,106,2,0,86,86,118,118,2,0,81,81,113,113,2,0,87,87,119,119,
+  	13,0,34,34,39,39,66,66,70,70,78,78,82,82,84,84,92,92,98,98,102,102,110,
+  	110,114,114,116,116,2,0,65,70,97,102,8,0,160,160,5760,5760,6158,6158,
+  	8192,8202,8232,8233,8239,8239,8287,8287,12288,12288,1,0,12,12,1,0,96,
+  	96,1,0,30,30,768,0,48,57,65,90,95,95,97,122,170,170,181,181,183,183,186,
+  	186,192,214,216,246,248,705,710,721,736,740,748,748,750,750,768,884,886,
+  	887,890,893,895,895,902,906,908,908,910,929,931,1013,1015,1153,1155,1159,
+  	1162,1327,1329,1366,1369,1369,1376,1416,1425,1469,1471,1471,1473,1474,
+  	1476,1477,1479,1479,1488,1514,1519,1522,1552,1562,1568,1641,1646,1747,
+  	1749,1756,1759,1768,1770,1788,1791,1791,1808,1866,1869,1969,1984,2037,
+  	2042,2042,2045,2045,2048,2093,2112,2139,2144,2154,2160,2183,2185,2190,
+  	2200,2273,2275,2403,2406,2415,2417,2435,2437,2444,2447,2448,2451,2472,
+  	2474,2480,2482,2482,2486,2489,2492,2500,2503,2504,2507,2510,2519,2519,
+  	2524,2525,2527,2531,2534,2545,2556,2556,2558,2558,2561,2563,2565,2570,
+  	2575,2576,2579,2600,2602,2608,2610,2611,2613,2614,2616,2617,2620,2620,
+  	2622,2626,2631,2632,2635,2637,2641,2641,2649,2652,2654,2654,2662,2677,
+  	2689,2691,2693,2701,2703,2705,2707,2728,2730,2736,2738,2739,2741,2745,
+  	2748,2757,2759,2761,2763,2765,2768,2768,2784,2787,2790,2799,2809,2815,
+  	2817,2819,2821,2828,2831,2832,2835,2856,2858,2864,2866,2867,2869,2873,
+  	2876,2884,2887,2888,2891,2893,2901,2903,2908,2909,2911,2915,2918,2927,
+  	2929,2929,2946,2947,2949,2954,2958,2960,2962,2965,2969,2970,2972,2972,
+  	2974,2975,2979,2980,2984,2986,2990,3001,3006,3010,3014,3016,3018,3021,
+  	3024,3024,3031,3031,3046,3055,3072,3084,3086,3088,3090,3112,3114,3129,
+  	3132,3140,3142,3144,3146,3149,3157,3158,3160,3162,3165,3165,3168,3171,
+  	3174,3183,3200,3203,3205,3212,3214,3216,3218,3240,3242,3251,3253,3257,
+  	3260,3268,3270,3272,3274,3277,3285,3286,3293,3294,3296,3299,3302,3311,
+  	3313,3315,3328,3340,3342,3344,3346,3396,3398,3400,3402,3406,3412,3415,
+  	3423,3427,3430,3439,3450,3455,3457,3459,3461,3478,3482,3505,3507,3515,
+  	3517,3517,3520,3526,3530,3530,3535,3540,3542,3542,3544,3551,3558,3567,
+  	3570,3571,3585,3642,3648,3662,3664,3673,3713,3714,3716,3716,3718,3722,
+  	3724,3747,3749,3749,3751,3773,3776,3780,3782,3782,3784,3790,3792,3801,
+  	3804,3807,3840,3840,3864,3865,3872,3881,3893,3893,3895,3895,3897,3897,
+  	3902,3911,3913,3948,3953,3972,3974,3991,3993,4028,4038,4038,4096,4169,
+  	4176,4253,4256,4293,4295,4295,4301,4301,4304,4346,4348,4680,4682,4685,
+  	4688,4694,4696,4696,4698,4701,4704,4744,4746,4749,4752,4784,4786,4789,
+  	4792,4798,4800,4800,4802,4805,4808,4822,4824,4880,4882,4885,4888,4954,
+  	4957,4959,4969,4977,4992,5007,5024,5109,5112,5117,5121,5740,5743,5759,
+  	5761,5786,5792,5866,5870,5880,5888,5909,5919,5940,5952,5971,5984,5996,
+  	5998,6000,6002,6003,6016,6099,6103,6103,6108,6109,6112,6121,6155,6157,
+  	6159,6169,6176,6264,6272,6314,6320,6389,6400,6430,6432,6443,6448,6459,
+  	6470,6509,6512,6516,6528,6571,6576,6601,6608,6618,6656,6683,6688,6750,
+  	6752,6780,6783,6793,6800,6809,6823,6823,6832,6845,6847,6862,6912,6988,
+  	6992,7001,7019,7027,7040,7155,7168,7223,7232,7241,7245,7293,7296,7304,
+  	7312,7354,7357,7359,7376,7378,7380,7418,7424,7957,7960,7965,7968,8005,
+  	8008,8013,8016,8023,8025,8025,8027,8027,8029,8029,8031,8061,8064,8116,
+  	8118,8124,8126,8126,8130,8132,8134,8140,8144,8147,8150,8155,8160,8172,
+  	8178,8180,8182,8188,8255,8256,8276,8276,8305,8305,8319,8319,8336,8348,
+  	8400,8412,8417,8417,8421,8432,8450,8450,8455,8455,8458,8467,8469,8469,
+  	8472,8477,8484,8484,8486,8486,8488,8488,8490,8505,8508,8511,8517,8521,
+  	8526,8526,8544,8584,11264,11492,11499,11507,11520,11557,11559,11559,11565,
+  	11565,11568,11623,11631,11631,11647,11670,11680,11686,11688,11694,11696,
+  	11702,11704,11710,11712,11718,11720,11726,11728,11734,11736,11742,11744,
+  	11775,12293,12295,12321,12335,12337,12341,12344,12348,12353,12438,12441,
+  	12447,12449,12538,12540,12543,12549,12591,12593,12686,12704,12735,12784,
+  	12799,13312,19903,19968,42124,42192,42237,42240,42508,42512,42539,42560,
+  	42607,42612,42621,42623,42737,42775,42783,42786,42888,42891,42954,42960,
+  	42961,42963,42963,42965,42969,42994,43047,43052,43052,43072,43123,43136,
+  	43205,43216,43225,43232,43255,43259,43259,43261,43309,43312,43347,43360,
+  	43388,43392,43456,43471,43481,43488,43518,43520,43574,43584,43597,43600,
+  	43609,43616,43638,43642,43714,43739,43741,43744,43759,43762,43766,43777,
+  	43782,43785,43790,43793,43798,43808,43814,43816,43822,43824,43866,43868,
+  	43881,43888,44010,44012,44013,44016,44025,44032,55203,55216,55238,55243,
+  	55291,63744,64109,64112,64217,64256,64262,64275,64279,64285,64296,64298,
+  	64310,64312,64316,64318,64318,64320,64321,64323,64324,64326,64433,64467,
+  	64829,64848,64911,64914,64967,65008,65019,65024,65039,65056,65071,65075,
+  	65076,65101,65103,65136,65140,65142,65276,65296,65305,65313,65338,65343,
+  	65343,65345,65370,65382,65470,65474,65479,65482,65487,65490,65495,65498,
+  	65500,65536,65547,65549,65574,65576,65594,65596,65597,65599,65613,65616,
+  	65629,65664,65786,65856,65908,66045,66045,66176,66204,66208,66256,66272,
+  	66272,66304,66335,66349,66378,66384,66426,66432,66461,66464,66499,66504,
+  	66511,66513,66517,66560,66717,66720,66729,66736,66771,66776,66811,66816,
+  	66855,66864,66915,66928,66938,66940,66954,66956,66962,66964,66965,66967,
+  	66977,66979,66993,66995,67001,67003,67004,67072,67382,67392,67413,67424,
+  	67431,67456,67461,67463,67504,67506,67514,67584,67589,67592,67592,67594,
+  	67637,67639,67640,67644,67644,67647,67669,67680,67702,67712,67742,67808,
+  	67826,67828,67829,67840,67861,67872,67897,67968,68023,68030,68031,68096,
+  	68099,68101,68102,68108,68115,68117,68119,68121,68149,68152,68154,68159,
+  	68159,68192,68220,68224,68252,68288,68295,68297,68326,68352,68405,68416,
+  	68437,68448,68466,68480,68497,68608,68680,68736,68786,68800,68850,68864,
+  	68903,68912,68921,69248,69289,69291,69292,69296,69297,69373,69404,69415,
+  	69415,69424,69456,69488,69509,69552,69572,69600,69622,69632,69702,69734,
+  	69749,69759,69818,69826,69826,69840,69864,69872,69881,69888,69940,69942,
+  	69951,69956,69959,69968,70003,70006,70006,70016,70084,70089,70092,70094,
+  	70106,70108,70108,70144,70161,70163,70199,70206,70209,70272,70278,70280,
+  	70280,70282,70285,70287,70301,70303,70312,70320,70378,70384,70393,70400,
+  	70403,70405,70412,70415,70416,70419,70440,70442,70448,70450,70451,70453,
+  	70457,70459,70468,70471,70472,70475,70477,70480,70480,70487,70487,70493,
+  	70499,70502,70508,70512,70516,70656,70730,70736,70745,70750,70753,70784,
+  	70853,70855,70855,70864,70873,71040,71093,71096,71104,71128,71133,71168,
+  	71232,71236,71236,71248,71257,71296,71352,71360,71369,71424,71450,71453,
+  	71467,71472,71481,71488,71494,71680,71738,71840,71913,71935,71942,71945,
+  	71945,71948,71955,71957,71958,71960,71989,71991,71992,71995,72003,72016,
+  	72025,72096,72103,72106,72151,72154,72161,72163,72164,72192,72254,72263,
+  	72263,72272,72345,72349,72349,72368,72440,72704,72712,72714,72758,72760,
+  	72768,72784,72793,72818,72847,72850,72871,72873,72886,72960,72966,72968,
+  	72969,72971,73014,73018,73018,73020,73021,73023,73031,73040,73049,73056,
+  	73061,73063,73064,73066,73102,73104,73105,73107,73112,73120,73129,73440,
+  	73462,73472,73488,73490,73530,73534,73538,73552,73561,73648,73648,73728,
+  	74649,74752,74862,74880,75075,77712,77808,77824,78895,78912,78933,82944,
+  	83526,92160,92728,92736,92766,92768,92777,92784,92862,92864,92873,92880,
+  	92909,92912,92916,92928,92982,92992,92995,93008,93017,93027,93047,93053,
+  	93071,93760,93823,93952,94026,94031,94087,94095,94111,94176,94177,94179,
+  	94180,94192,94193,94208,100343,100352,101589,101632,101640,110576,110579,
+  	110581,110587,110589,110590,110592,110882,110898,110898,110928,110930,
+  	110933,110933,110948,110951,110960,111355,113664,113770,113776,113788,
+  	113792,113800,113808,113817,113821,113822,118528,118573,118576,118598,
+  	119141,119145,119149,119154,119163,119170,119173,119179,119210,119213,
+  	119362,119364,119808,119892,119894,119964,119966,119967,119970,119970,
+  	119973,119974,119977,119980,119982,119993,119995,119995,119997,120003,
+  	120005,120069,120071,120074,120077,120084,120086,120092,120094,120121,
+  	120123,120126,120128,120132,120134,120134,120138,120144,120146,120485,
+  	120488,120512,120514,120538,120540,120570,120572,120596,120598,120628,
+  	120630,120654,120656,120686,120688,120712,120714,120744,120746,120770,
+  	120772,120779,120782,120831,121344,121398,121403,121452,121461,121461,
+  	121476,121476,121499,121503,121505,121519,122624,122654,122661,122666,
+  	122880,122886,122888,122904,122907,122913,122915,122916,122918,122922,
+  	122928,122989,123023,123023,123136,123180,123184,123197,123200,123209,
+  	123214,123214,123536,123566,123584,123641,124112,124153,124896,124902,
+  	124904,124907,124909,124910,124912,124926,124928,125124,125136,125142,
+  	125184,125259,125264,125273,126464,126467,126469,126495,126497,126498,
+  	126500,126500,126503,126503,126505,126514,126516,126519,126521,126521,
+  	126523,126523,126530,126530,126535,126535,126537,126537,126539,126539,
+  	126541,126543,126545,126546,126548,126548,126551,126551,126553,126553,
+  	126555,126555,126557,126557,126559,126559,126561,126562,126564,126564,
+  	126567,126570,126572,126578,126580,126583,126585,126588,126590,126590,
+  	126592,126601,126603,126619,126625,126627,126629,126633,126635,126651,
+  	130032,130041,131072,173791,173824,177977,177984,178205,178208,183969,
+  	183984,191456,194560,195101,196608,201546,201552,205743,917760,917999,
+  	1,0,42,42,2,0,39,39,92,92,2,0,10,10,13,13,1,0,47,47,1,0,29,29,1,0,28,
+  	28,1,0,13,13,21,0,36,36,162,165,1423,1423,1547,1547,2046,2047,2546,2547,
+  	2555,2555,2801,2801,3065,3065,3647,3647,6107,6107,8352,8384,43064,43064,
+  	65020,65020,65129,65129,65284,65284,65504,65505,65509,65510,73693,73696,
+  	123647,123647,126128,126128,1,0,32,32,6,0,95,95,8255,8256,8276,8276,65075,
+  	65076,65101,65103,65343,65343,1,0,9,9,2,0,34,34,92,92,1,0,10,10,1,0,11,
+  	11,1,0,31,31,659,0,65,90,97,122,170,170,181,181,186,186,192,214,216,246,
+  	248,705,710,721,736,740,748,748,750,750,880,884,886,887,890,893,895,895,
+  	902,902,904,906,908,908,910,929,931,1013,1015,1153,1162,1327,1329,1366,
+  	1369,1369,1376,1416,1488,1514,1519,1522,1568,1610,1646,1647,1649,1747,
+  	1749,1749,1765,1766,1774,1775,1786,1788,1791,1791,1808,1808,1810,1839,
+  	1869,1957,1969,1969,1994,2026,2036,2037,2042,2042,2048,2069,2074,2074,
+  	2084,2084,2088,2088,2112,2136,2144,2154,2160,2183,2185,2190,2208,2249,
+  	2308,2361,2365,2365,2384,2384,2392,2401,2417,2432,2437,2444,2447,2448,
+  	2451,2472,2474,2480,2482,2482,2486,2489,2493,2493,2510,2510,2524,2525,
+  	2527,2529,2544,2545,2556,2556,2565,2570,2575,2576,2579,2600,2602,2608,
+  	2610,2611,2613,2614,2616,2617,2649,2652,2654,2654,2674,2676,2693,2701,
+  	2703,2705,2707,2728,2730,2736,2738,2739,2741,2745,2749,2749,2768,2768,
+  	2784,2785,2809,2809,2821,2828,2831,2832,2835,2856,2858,2864,2866,2867,
+  	2869,2873,2877,2877,2908,2909,2911,2913,2929,2929,2947,2947,2949,2954,
+  	2958,2960,2962,2965,2969,2970,2972,2972,2974,2975,2979,2980,2984,2986,
+  	2990,3001,3024,3024,3077,3084,3086,3088,3090,3112,3114,3129,3133,3133,
+  	3160,3162,3165,3165,3168,3169,3200,3200,3205,3212,3214,3216,3218,3240,
+  	3242,3251,3253,3257,3261,3261,3293,3294,3296,3297,3313,3314,3332,3340,
+  	3342,3344,3346,3386,3389,3389,3406,3406,3412,3414,3423,3425,3450,3455,
+  	3461,3478,3482,3505,3507,3515,3517,3517,3520,3526,3585,3632,3634,3635,
+  	3648,3654,3713,3714,3716,3716,3718,3722,3724,3747,3749,3749,3751,3760,
+  	3762,3763,3773,3773,3776,3780,3782,3782,3804,3807,3840,3840,3904,3911,
+  	3913,3948,3976,3980,4096,4138,4159,4159,4176,4181,4186,4189,4193,4193,
+  	4197,4198,4206,4208,4213,4225,4238,4238,4256,4293,4295,4295,4301,4301,
+  	4304,4346,4348,4680,4682,4685,4688,4694,4696,4696,4698,4701,4704,4744,
+  	4746,4749,4752,4784,4786,4789,4792,4798,4800,4800,4802,4805,4808,4822,
+  	4824,4880,4882,4885,4888,4954,4992,5007,5024,5109,5112,5117,5121,5740,
+  	5743,5759,5761,5786,5792,5866,5870,5880,5888,5905,5919,5937,5952,5969,
+  	5984,5996,5998,6000,6016,6067,6103,6103,6108,6108,6176,6264,6272,6312,
+  	6314,6314,6320,6389,6400,6430,6480,6509,6512,6516,6528,6571,6576,6601,
+  	6656,6678,6688,6740,6823,6823,6917,6963,6981,6988,7043,7072,7086,7087,
+  	7098,7141,7168,7203,7245,7247,7258,7293,7296,7304,7312,7354,7357,7359,
+  	7401,7404,7406,7411,7413,7414,7418,7418,7424,7615,7680,7957,7960,7965,
+  	7968,8005,8008,8013,8016,8023,8025,8025,8027,8027,8029,8029,8031,8061,
+  	8064,8116,8118,8124,8126,8126,8130,8132,8134,8140,8144,8147,8150,8155,
+  	8160,8172,8178,8180,8182,8188,8305,8305,8319,8319,8336,8348,8450,8450,
+  	8455,8455,8458,8467,8469,8469,8472,8477,8484,8484,8486,8486,8488,8488,
+  	8490,8505,8508,8511,8517,8521,8526,8526,8544,8584,11264,11492,11499,11502,
+  	11506,11507,11520,11557,11559,11559,11565,11565,11568,11623,11631,11631,
+  	11648,11670,11680,11686,11688,11694,11696,11702,11704,11710,11712,11718,
+  	11720,11726,11728,11734,11736,11742,12293,12295,12321,12329,12337,12341,
+  	12344,12348,12353,12438,12443,12447,12449,12538,12540,12543,12549,12591,
+  	12593,12686,12704,12735,12784,12799,13312,19903,19968,42124,42192,42237,
+  	42240,42508,42512,42527,42538,42539,42560,42606,42623,42653,42656,42735,
+  	42775,42783,42786,42888,42891,42954,42960,42961,42963,42963,42965,42969,
+  	42994,43009,43011,43013,43015,43018,43020,43042,43072,43123,43138,43187,
+  	43250,43255,43259,43259,43261,43262,43274,43301,43312,43334,43360,43388,
+  	43396,43442,43471,43471,43488,43492,43494,43503,43514,43518,43520,43560,
+  	43584,43586,43588,43595,43616,43638,43642,43642,43646,43695,43697,43697,
+  	43701,43702,43705,43709,43712,43712,43714,43714,43739,43741,43744,43754,
+  	43762,43764,43777,43782,43785,43790,43793,43798,43808,43814,43816,43822,
+  	43824,43866,43868,43881,43888,44002,44032,55203,55216,55238,55243,55291,
+  	63744,64109,64112,64217,64256,64262,64275,64279,64285,64285,64287,64296,
+  	64298,64310,64312,64316,64318,64318,64320,64321,64323,64324,64326,64433,
+  	64467,64829,64848,64911,64914,64967,65008,65019,65136,65140,65142,65276,
+  	65313,65338,65345,65370,65382,65470,65474,65479,65482,65487,65490,65495,
+  	65498,65500,65536,65547,65549,65574,65576,65594,65596,65597,65599,65613,
+  	65616,65629,65664,65786,65856,65908,66176,66204,66208,66256,66304,66335,
+  	66349,66378,66384,66421,66432,66461,66464,66499,66504,66511,66513,66517,
+  	66560,66717,66736,66771,66776,66811,66816,66855,66864,66915,66928,66938,
+  	66940,66954,66956,66962,66964,66965,66967,66977,66979,66993,66995,67001,
+  	67003,67004,67072,67382,67392,67413,67424,67431,67456,67461,67463,67504,
+  	67506,67514,67584,67589,67592,67592,67594,67637,67639,67640,67644,67644,
+  	67647,67669,67680,67702,67712,67742,67808,67826,67828,67829,67840,67861,
+  	67872,67897,67968,68023,68030,68031,68096,68096,68112,68115,68117,68119,
+  	68121,68149,68192,68220,68224,68252,68288,68295,68297,68324,68352,68405,
+  	68416,68437,68448,68466,68480,68497,68608,68680,68736,68786,68800,68850,
+  	68864,68899,69248,69289,69296,69297,69376,69404,69415,69415,69424,69445,
+  	69488,69505,69552,69572,69600,69622,69635,69687,69745,69746,69749,69749,
+  	69763,69807,69840,69864,69891,69926,69956,69956,69959,69959,69968,70002,
+  	70006,70006,70019,70066,70081,70084,70106,70106,70108,70108,70144,70161,
+  	70163,70187,70207,70208,70272,70278,70280,70280,70282,70285,70287,70301,
+  	70303,70312,70320,70366,70405,70412,70415,70416,70419,70440,70442,70448,
+  	70450,70451,70453,70457,70461,70461,70480,70480,70493,70497,70656,70708,
+  	70727,70730,70751,70753,70784,70831,70852,70853,70855,70855,71040,71086,
+  	71128,71131,71168,71215,71236,71236,71296,71338,71352,71352,71424,71450,
+  	71488,71494,71680,71723,71840,71903,71935,71942,71945,71945,71948,71955,
+  	71957,71958,71960,71983,71999,71999,72001,72001,72096,72103,72106,72144,
+  	72161,72161,72163,72163,72192,72192,72203,72242,72250,72250,72272,72272,
+  	72284,72329,72349,72349,72368,72440,72704,72712,72714,72750,72768,72768,
+  	72818,72847,72960,72966,72968,72969,72971,73008,73030,73030,73056,73061,
+  	73063,73064,73066,73097,73112,73112,73440,73458,73474,73474,73476,73488,
+  	73490,73523,73648,73648,73728,74649,74752,74862,74880,75075,77712,77808,
+  	77824,78895,78913,78918,82944,83526,92160,92728,92736,92766,92784,92862,
+  	92880,92909,92928,92975,92992,92995,93027,93047,93053,93071,93760,93823,
+  	93952,94026,94032,94032,94099,94111,94176,94177,94179,94179,94208,100343,
+  	100352,101589,101632,101640,110576,110579,110581,110587,110589,110590,
+  	110592,110882,110898,110898,110928,110930,110933,110933,110948,110951,
+  	110960,111355,113664,113770,113776,113788,113792,113800,113808,113817,
+  	119808,119892,119894,119964,119966,119967,119970,119970,119973,119974,
+  	119977,119980,119982,119993,119995,119995,119997,120003,120005,120069,
+  	120071,120074,120077,120084,120086,120092,120094,120121,120123,120126,
+  	120128,120132,120134,120134,120138,120144,120146,120485,120488,120512,
+  	120514,120538,120540,120570,120572,120596,120598,120628,120630,120654,
+  	120656,120686,120688,120712,120714,120744,120746,120770,120772,120779,
+  	122624,122654,122661,122666,122928,122989,123136,123180,123191,123197,
+  	123214,123214,123536,123565,123584,123627,124112,124139,124896,124902,
+  	124904,124907,124909,124910,124912,124926,124928,125124,125184,125251,
+  	125259,125259,126464,126467,126469,126495,126497,126498,126500,126500,
+  	126503,126503,126505,126514,126516,126519,126521,126521,126523,126523,
+  	126530,126530,126535,126535,126537,126537,126539,126539,126541,126543,
+  	126545,126546,126548,126548,126551,126551,126553,126553,126555,126555,
+  	126557,126557,126559,126559,126561,126562,126564,126564,126567,126570,
+  	126572,126578,126580,126583,126585,126588,126590,126590,126592,126601,
+  	126603,126619,126625,126627,126629,126633,126635,126651,131072,173791,
+  	173824,177977,177984,178205,178208,183969,183984,191456,194560,195101,
+  	196608,201546,201552,205743,1552,0,1,1,0,0,0,0,3,1,0,0,0,0,5,1,0,0,0,
+  	0,7,1,0,0,0,0,9,1,0,0,0,0,11,1,0,0,0,0,13,1,0,0,0,0,15,1,0,0,0,0,17,1,
+  	0,0,0,0,19,1,0,0,0,0,21,1,0,0,0,0,23,1,0,0,0,0,25,1,0,0,0,0,27,1,0,0,
+  	0,0,29,1,0,0,0,0,31,1,0,0,0,0,33,1,0,0,0,0,35,1,0,0,0,0,37,1,0,0,0,0,
+  	39,1,0,0,0,0,41,1,0,0,0,0,43,1,0,0,0,0,45,1,0,0,0,0,47,1,0,0,0,0,49,1,
+  	0,0,0,0,51,1,0,0,0,0,53,1,0,0,0,0,55,1,0,0,0,0,57,1,0,0,0,0,59,1,0,0,
+  	0,0,61,1,0,0,0,0,63,1,0,0,0,0,65,1,0,0,0,0,67,1,0,0,0,0,69,1,0,0,0,0,
+  	71,1,0,0,0,0,73,1,0,0,0,0,75,1,0,0,0,0,77,1,0,0,0,0,79,1,0,0,0,0,81,1,
+  	0,0,0,0,83,1,0,0,0,0,85,1,0,0,0,0,87,1,0,0,0,0,89,1,0,0,0,0,91,1,0,0,
+  	0,0,93,1,0,0,0,0,95,1,0,0,0,0,97,1,0,0,0,0,99,1,0,0,0,0,101,1,0,0,0,0,
+  	103,1,0,0,0,0,105,1,0,0,0,0,107,1,0,0,0,0,109,1,0,0,0,0,111,1,0,0,0,0,
+  	113,1,0,0,0,0,115,1,0,0,0,0,117,1,0,0,0,0,119,1,0,0,0,0,121,1,0,0,0,0,
+  	123,1,0,0,0,0,125,1,0,0,0,0,127,1,0,0,0,0,129,1,0,0,0,0,131,1,0,0,0,0,
+  	133,1,0,0,0,0,135,1,0,0,0,0,137,1,0,0,0,0,139,1,0,0,0,0,141,1,0,0,0,0,
+  	143,1,0,0,0,0,145,1,0,0,0,0,147,1,0,0,0,0,149,1,0,0,0,0,151,1,0,0,0,0,
+  	153,1,0,0,0,0,155,1,0,0,0,0,157,1,0,0,0,0,159,1,0,0,0,0,161,1,0,0,0,0,
+  	163,1,0,0,0,0,165,1,0,0,0,0,167,1,0,0,0,0,169,1,0,0,0,0,171,1,0,0,0,0,
+  	173,1,0,0,0,0,175,1,0,0,0,0,177,1,0,0,0,0,179,1,0,0,0,0,181,1,0,0,0,0,
+  	183,1,0,0,0,0,185,1,0,0,0,0,187,1,0,0,0,0,189,1,0,0,0,0,191,1,0,0,0,0,
+  	193,1,0,0,0,0,195,1,0,0,0,0,197,1,0,0,0,0,199,1,0,0,0,0,201,1,0,0,0,0,
+  	203,1,0,0,0,0,205,1,0,0,0,0,207,1,0,0,0,0,209,1,0,0,0,0,211,1,0,0,0,0,
+  	213,1,0,0,0,0,215,1,0,0,0,0,217,1,0,0,0,0,219,1,0,0,0,0,221,1,0,0,0,0,
+  	223,1,0,0,0,0,225,1,0,0,0,0,227,1,0,0,0,0,229,1,0,0,0,0,231,1,0,0,0,0,
+  	233,1,0,0,0,0,235,1,0,0,0,0,237,1,0,0,0,0,239,1,0,0,0,0,241,1,0,0,0,0,
+  	243,1,0,0,0,0,245,1,0,0,0,0,247,1,0,0,0,0,249,1,0,0,0,0,251,1,0,0,0,0,
+  	253,1,0,0,0,0,255,1,0,0,0,0,257,1,0,0,0,0,259,1,0,0,0,0,261,1,0,0,0,0,
+  	263,1,0,0,0,0,265,1,0,0,0,0,267,1,0,0,0,0,269,1,0,0,0,0,271,1,0,0,0,0,
+  	273,1,0,0,0,0,275,1,0,0,0,0,277,1,0,0,0,0,279,1,0,0,0,0,281,1,0,0,0,0,
+  	283,1,0,0,0,0,285,1,0,0,0,0,287,1,0,0,0,0,289,1,0,0,0,0,291,1,0,0,0,0,
+  	293,1,0,0,0,0,295,1,0,0,0,0,297,1,0,0,0,0,299,1,0,0,0,0,301,1,0,0,0,0,
+  	303,1,0,0,0,0,305,1,0,0,0,0,307,1,0,0,0,0,309,1,0,0,0,0,311,1,0,0,0,0,
+  	313,1,0,0,0,0,315,1,0,0,0,0,317,1,0,0,0,0,319,1,0,0,0,0,321,1,0,0,0,0,
+  	323,1,0,0,0,0,325,1,0,0,0,0,327,1,0,0,0,0,329,1,0,0,0,0,331,1,0,0,0,0,
+  	333,1,0,0,0,0,335,1,0,0,0,0,337,1,0,0,0,0,339,1,0,0,0,0,341,1,0,0,0,0,
+  	343,1,0,0,0,0,345,1,0,0,0,0,347,1,0,0,0,0,349,1,0,0,0,0,351,1,0,0,0,0,
+  	353,1,0,0,0,0,355,1,0,0,0,0,357,1,0,0,0,0,359,1,0,0,0,0,361,1,0,0,0,0,
+  	363,1,0,0,0,0,365,1,0,0,0,0,367,1,0,0,0,0,369,1,0,0,0,0,411,1,0,0,0,1,
+  	413,1,0,0,0,3,415,1,0,0,0,5,417,1,0,0,0,7,419,1,0,0,0,9,421,1,0,0,0,11,
+  	423,1,0,0,0,13,425,1,0,0,0,15,427,1,0,0,0,17,429,1,0,0,0,19,431,1,0,0,
+  	0,21,433,1,0,0,0,23,435,1,0,0,0,25,438,1,0,0,0,27,440,1,0,0,0,29,443,
+  	1,0,0,0,31,445,1,0,0,0,33,448,1,0,0,0,35,450,1,0,0,0,37,453,1,0,0,0,39,
+  	456,1,0,0,0,41,458,1,0,0,0,43,460,1,0,0,0,45,462,1,0,0,0,47,464,1,0,0,
+  	0,49,467,1,0,0,0,51,469,1,0,0,0,53,471,1,0,0,0,55,473,1,0,0,0,57,475,
+  	1,0,0,0,59,477,1,0,0,0,61,479,1,0,0,0,63,481,1,0,0,0,65,483,1,0,0,0,67,
+  	485,1,0,0,0,69,487,1,0,0,0,71,489,1,0,0,0,73,491,1,0,0,0,75,493,1,0,0,
+  	0,77,495,1,0,0,0,79,497,1,0,0,0,81,499,1,0,0,0,83,501,1,0,0,0,85,503,
+  	1,0,0,0,87,505,1,0,0,0,89,507,1,0,0,0,91,515,1,0,0,0,93,519,1,0,0,0,95,
+  	523,1,0,0,0,97,527,1,0,0,0,99,533,1,0,0,0,101,537,1,0,0,0,103,540,1,0,
+  	0,0,105,544,1,0,0,0,107,554,1,0,0,0,109,561,1,0,0,0,111,567,1,0,0,0,113,
+  	570,1,0,0,0,115,575,1,0,0,0,117,580,1,0,0,0,119,585,1,0,0,0,121,596,1,
+  	0,0,0,123,603,1,0,0,0,125,611,1,0,0,0,127,618,1,0,0,0,129,641,1,0,0,0,
+  	131,650,1,0,0,0,133,655,1,0,0,0,135,661,1,0,0,0,137,668,1,0,0,0,139,674,
+  	1,0,0,0,141,683,1,0,0,0,143,690,1,0,0,0,145,698,1,0,0,0,147,705,1,0,0,
+  	0,149,710,1,0,0,0,151,721,1,0,0,0,153,728,1,0,0,0,155,737,1,0,0,0,157,
+  	742,1,0,0,0,159,747,1,0,0,0,161,751,1,0,0,0,163,756,1,0,0,0,165,763,1,
+  	0,0,0,167,771,1,0,0,0,169,778,1,0,0,0,171,788,1,0,0,0,173,794,1,0,0,0,
+  	175,799,1,0,0,0,177,805,1,0,0,0,179,810,1,0,0,0,181,816,1,0,0,0,183,822,
+  	1,0,0,0,185,830,1,0,0,0,187,835,1,0,0,0,189,842,1,0,0,0,191,845,1,0,0,
+  	0,193,848,1,0,0,0,195,858,1,0,0,0,197,866,1,0,0,0,199,869,1,0,0,0,201,
+  	874,1,0,0,0,203,878,1,0,0,0,205,884,1,0,0,0,207,889,1,0,0,0,209,897,1,
+  	0,0,0,211,903,1,0,0,0,213,909,1,0,0,0,215,918,1,0,0,0,217,924,1,0,0,0,
+  	219,933,1,0,0,0,221,944,1,0,0,0,223,947,1,0,0,0,225,952,1,0,0,0,227,956,
+  	1,0,0,0,229,961,1,0,0,0,231,966,1,0,0,0,233,969,1,0,0,0,235,974,1,0,0,
+  	0,237,983,1,0,0,0,239,986,1,0,0,0,241,992,1,0,0,0,243,1000,1,0,0,0,245,
+  	1008,1,0,0,0,247,1016,1,0,0,0,249,1021,1,0,0,0,251,1025,1,0,0,0,253,1032,
+  	1,0,0,0,255,1039,1,0,0,0,257,1048,1,0,0,0,259,1073,1,0,0,0,261,1082,1,
+  	0,0,0,263,1086,1,0,0,0,265,1095,1,0,0,0,267,1101,1,0,0,0,269,1108,1,0,
+  	0,0,271,1115,1,0,0,0,273,1121,1,0,0,0,275,1126,1,0,0,0,277,1129,1,0,0,
+  	0,279,1135,1,0,0,0,281,1147,1,0,0,0,283,1152,1,0,0,0,285,1157,1,0,0,0,
+  	287,1163,1,0,0,0,289,1170,1,0,0,0,291,1180,1,0,0,0,293,1187,1,0,0,0,295,
+  	1191,1,0,0,0,297,1196,1,0,0,0,299,1202,1,0,0,0,301,1207,1,0,0,0,303,1213,
+  	1,0,0,0,305,1223,1,0,0,0,307,1227,1,0,0,0,309,1234,1,0,0,0,311,1240,1,
+  	0,0,0,313,1245,1,0,0,0,315,1254,1,0,0,0,317,1259,1,0,0,0,319,1263,1,0,
+  	0,0,321,1271,1,0,0,0,323,1273,1,0,0,0,325,1278,1,0,0,0,327,1281,1,0,0,
+  	0,329,1283,1,0,0,0,331,1286,1,0,0,0,333,1288,1,0,0,0,335,1308,1,0,0,0,
+  	337,1310,1,0,0,0,339,1342,1,0,0,0,341,1345,1,0,0,0,343,1349,1,0,0,0,345,
+  	1353,1,0,0,0,347,1357,1,0,0,0,349,1359,1,0,0,0,351,1361,1,0,0,0,353,1385,
+  	1,0,0,0,355,1399,1,0,0,0,357,1408,1,0,0,0,359,1417,1,0,0,0,361,1421,1,
+  	0,0,0,363,1431,1,0,0,0,365,1436,1,0,0,0,367,1452,1,0,0,0,369,1483,1,0,
+  	0,0,371,1485,1,0,0,0,373,1487,1,0,0,0,375,1489,1,0,0,0,377,1491,1,0,0,
+  	0,379,1493,1,0,0,0,381,1495,1,0,0,0,383,1497,1,0,0,0,385,1499,1,0,0,0,
+  	387,1501,1,0,0,0,389,1503,1,0,0,0,391,1505,1,0,0,0,393,1507,1,0,0,0,395,
+  	1509,1,0,0,0,397,1511,1,0,0,0,399,1513,1,0,0,0,401,1515,1,0,0,0,403,1517,
+  	1,0,0,0,405,1519,1,0,0,0,407,1521,1,0,0,0,409,1523,1,0,0,0,411,1525,1,
+  	0,0,0,413,414,5,59,0,0,414,2,1,0,0,0,415,416,5,40,0,0,416,4,1,0,0,0,417,
+  	418,5,41,0,0,418,6,1,0,0,0,419,420,5,44,0,0,420,8,1,0,0,0,421,422,5,46,
+  	0,0,422,10,1,0,0,0,423,424,5,61,0,0,424,12,1,0,0,0,425,426,5,91,0,0,426,
+  	14,1,0,0,0,427,428,5,93,0,0,428,16,1,0,0,0,429,430,5,123,0,0,430,18,1,
+  	0,0,0,431,432,5,125,0,0,432,20,1,0,0,0,433,434,5,124,0,0,434,22,1,0,0,
+  	0,435,436,5,60,0,0,436,437,5,62,0,0,437,24,1,0,0,0,438,439,5,60,0,0,439,
+  	26,1,0,0,0,440,441,5,60,0,0,441,442,5,61,0,0,442,28,1,0,0,0,443,444,5,
+  	62,0,0,444,30,1,0,0,0,445,446,5,62,0,0,446,447,5,61,0,0,447,32,1,0,0,
+  	0,448,449,5,38,0,0,449,34,1,0,0,0,450,451,5,62,0,0,451,452,5,62,0,0,452,
+  	36,1,0,0,0,453,454,5,60,0,0,454,455,5,60,0,0,455,38,1,0,0,0,456,457,5,
+  	43,0,0,457,40,1,0,0,0,458,459,5,47,0,0,459,42,1,0,0,0,460,461,5,37,0,
+  	0,461,44,1,0,0,0,462,463,5,94,0,0,463,46,1,0,0,0,464,465,5,61,0,0,465,
+  	466,5,126,0,0,466,48,1,0,0,0,467,468,5,36,0,0,468,50,1,0,0,0,469,470,
+  	5,10216,0,0,470,52,1,0,0,0,471,472,5,12296,0,0,472,54,1,0,0,0,473,474,
+  	5,65124,0,0,474,56,1,0,0,0,475,476,5,65308,0,0,476,58,1,0,0,0,477,478,
+  	5,10217,0,0,478,60,1,0,0,0,479,480,5,12297,0,0,480,62,1,0,0,0,481,482,
+  	5,65125,0,0,482,64,1,0,0,0,483,484,5,65310,0,0,484,66,1,0,0,0,485,486,
+  	5,173,0,0,486,68,1,0,0,0,487,488,5,8208,0,0,488,70,1,0,0,0,489,490,5,
+  	8209,0,0,490,72,1,0,0,0,491,492,5,8210,0,0,492,74,1,0,0,0,493,494,5,8211,
+  	0,0,494,76,1,0,0,0,495,496,5,8212,0,0,496,78,1,0,0,0,497,498,5,8213,0,
+  	0,498,80,1,0,0,0,499,500,5,8722,0,0,500,82,1,0,0,0,501,502,5,65112,0,
+  	0,502,84,1,0,0,0,503,504,5,65123,0,0,504,86,1,0,0,0,505,506,5,65293,0,
+  	0,506,88,1,0,0,0,507,508,7,0,0,0,508,509,7,1,0,0,509,510,7,2,0,0,510,
+  	511,7,1,0,0,511,512,7,3,0,0,512,513,7,4,0,0,513,514,7,1,0,0,514,90,1,
+  	0,0,0,515,516,7,0,0,0,516,517,7,5,0,0,517,518,7,2,0,0,518,92,1,0,0,0,
+  	519,520,7,0,0,0,520,521,7,6,0,0,521,522,7,6,0,0,522,94,1,0,0,0,523,524,
+  	7,0,0,0,524,525,7,3,0,0,525,526,7,3,0,0,526,96,1,0,0,0,527,528,7,0,0,
+  	0,528,529,7,3,0,0,529,530,7,7,0,0,530,531,7,8,0,0,531,532,7,9,0,0,532,
+  	98,1,0,0,0,533,534,7,0,0,0,534,535,7,5,0,0,535,536,7,6,0,0,536,100,1,
+  	0,0,0,537,538,7,0,0,0,538,539,7,10,0,0,539,102,1,0,0,0,540,541,7,0,0,
+  	0,541,542,7,10,0,0,542,543,7,1,0,0,543,104,1,0,0,0,544,545,7,0,0,0,545,
+  	546,7,10,0,0,546,547,7,1,0,0,547,548,7,8,0,0,548,549,7,5,0,0,549,550,
+  	7,6,0,0,550,551,7,4,0,0,551,552,7,5,0,0,552,553,7,11,0,0,553,106,1,0,
+  	0,0,554,555,7,0,0,0,555,556,7,7,0,0,556,557,7,7,0,0,557,558,7,0,0,0,558,
+  	559,7,1,0,0,559,560,7,12,0,0,560,108,1,0,0,0,561,562,7,13,0,0,562,563,
+  	7,8,0,0,563,564,7,11,0,0,564,565,7,4,0,0,565,566,7,5,0,0,566,110,1,0,
+  	0,0,567,568,7,13,0,0,568,569,7,2,0,0,569,112,1,0,0,0,570,571,7,1,0,0,
+  	571,572,7,0,0,0,572,573,7,3,0,0,573,574,7,3,0,0,574,114,1,0,0,0,575,576,
+  	7,1,0,0,576,577,7,0,0,0,577,578,7,10,0,0,578,579,7,8,0,0,579,116,1,0,
+  	0,0,580,581,7,1,0,0,581,582,7,0,0,0,582,583,7,10,0,0,583,584,7,7,0,0,
+  	584,118,1,0,0,0,585,586,7,1,0,0,586,587,7,12,0,0,587,588,7,8,0,0,588,
+  	589,7,1,0,0,589,590,7,14,0,0,590,591,7,15,0,0,591,592,7,16,0,0,592,593,
+  	7,4,0,0,593,594,7,5,0,0,594,595,7,7,0,0,595,120,1,0,0,0,596,597,7,1,0,
+  	0,597,598,7,16,0,0,598,599,7,3,0,0,599,600,7,17,0,0,600,601,7,18,0,0,
+  	601,602,7,5,0,0,602,122,1,0,0,0,603,604,7,1,0,0,604,605,7,16,0,0,605,
+  	606,7,18,0,0,606,607,7,18,0,0,607,608,7,8,0,0,608,609,7,5,0,0,609,610,
+  	7,7,0,0,610,124,1,0,0,0,611,612,7,1,0,0,612,613,7,16,0,0,613,614,7,18,
+  	0,0,614,615,7,18,0,0,615,616,7,4,0,0,616,617,7,7,0,0,617,126,1,0,0,0,
+  	618,619,7,1,0,0,619,620,7,16,0,0,620,621,7,18,0,0,621,622,7,18,0,0,622,
+  	623,7,4,0,0,623,624,7,7,0,0,624,625,5,95,0,0,625,626,7,10,0,0,626,627,
+  	7,14,0,0,627,628,7,4,0,0,628,629,7,15,0,0,629,630,5,95,0,0,630,631,7,
+  	1,0,0,631,632,7,12,0,0,632,633,7,8,0,0,633,634,7,1,0,0,634,635,7,14,0,
+  	0,635,636,7,15,0,0,636,637,7,16,0,0,637,638,7,4,0,0,638,639,7,5,0,0,639,
+  	640,7,7,0,0,640,128,1,0,0,0,641,642,7,1,0,0,642,643,7,16,0,0,643,644,
+  	7,5,0,0,644,645,7,7,0,0,645,646,7,0,0,0,646,647,7,4,0,0,647,648,7,5,0,
+  	0,648,649,7,10,0,0,649,130,1,0,0,0,650,651,7,1,0,0,651,652,7,16,0,0,652,
+  	653,7,15,0,0,653,654,7,2,0,0,654,132,1,0,0,0,655,656,7,1,0,0,656,657,
+  	7,16,0,0,657,658,7,17,0,0,658,659,7,5,0,0,659,660,7,7,0,0,660,134,1,0,
+  	0,0,661,662,7,1,0,0,662,663,7,9,0,0,663,664,7,8,0,0,664,665,7,0,0,0,665,
+  	666,7,7,0,0,666,667,7,8,0,0,667,136,1,0,0,0,668,669,7,1,0,0,669,670,7,
+  	2,0,0,670,671,7,1,0,0,671,672,7,3,0,0,672,673,7,8,0,0,673,138,1,0,0,0,
+  	674,675,7,6,0,0,675,676,7,0,0,0,676,677,7,7,0,0,677,678,7,0,0,0,678,679,
+  	7,13,0,0,679,680,7,0,0,0,680,681,7,10,0,0,681,682,7,8,0,0,682,140,1,0,
+  	0,0,683,684,7,6,0,0,684,685,7,13,0,0,685,686,7,7,0,0,686,687,7,2,0,0,
+  	687,688,7,15,0,0,688,689,7,8,0,0,689,142,1,0,0,0,690,691,7,6,0,0,691,
+  	692,7,8,0,0,692,693,7,19,0,0,693,694,7,0,0,0,694,695,7,17,0,0,695,696,
+  	7,3,0,0,696,697,7,7,0,0,697,144,1,0,0,0,698,699,7,6,0,0,699,700,7,8,0,
+  	0,700,701,7,3,0,0,701,702,7,8,0,0,702,703,7,7,0,0,703,704,7,8,0,0,704,
+  	146,1,0,0,0,705,706,7,6,0,0,706,707,7,8,0,0,707,708,7,10,0,0,708,709,
+  	7,1,0,0,709,148,1,0,0,0,710,711,7,6,0,0,711,712,7,8,0,0,712,713,7,10,
+  	0,0,713,714,7,1,0,0,714,715,7,8,0,0,715,716,7,5,0,0,716,717,7,6,0,0,717,
+  	718,7,4,0,0,718,719,7,5,0,0,719,720,7,11,0,0,720,150,1,0,0,0,721,722,
+  	7,6,0,0,722,723,7,8,0,0,723,724,7,7,0,0,724,725,7,0,0,0,725,726,7,1,0,
+  	0,726,727,7,12,0,0,727,152,1,0,0,0,728,729,7,6,0,0,729,730,7,4,0,0,730,
+  	731,7,10,0,0,731,732,7,7,0,0,732,733,7,4,0,0,733,734,7,5,0,0,734,735,
+  	7,1,0,0,735,736,7,7,0,0,736,154,1,0,0,0,737,738,7,6,0,0,738,739,7,9,0,
+  	0,739,740,7,16,0,0,740,741,7,15,0,0,741,156,1,0,0,0,742,743,7,8,0,0,743,
+  	744,7,3,0,0,744,745,7,10,0,0,745,746,7,8,0,0,746,158,1,0,0,0,747,748,
+  	7,8,0,0,748,749,7,5,0,0,749,750,7,6,0,0,750,160,1,0,0,0,751,752,7,8,0,
+  	0,752,753,7,5,0,0,753,754,7,6,0,0,754,755,7,10,0,0,755,162,1,0,0,0,756,
+  	757,7,8,0,0,757,758,7,20,0,0,758,759,7,4,0,0,759,760,7,10,0,0,760,761,
+  	7,7,0,0,761,762,7,10,0,0,762,164,1,0,0,0,763,764,7,8,0,0,764,765,7,20,
+  	0,0,765,766,7,15,0,0,766,767,7,3,0,0,767,768,7,0,0,0,768,769,7,4,0,0,
+  	769,770,7,5,0,0,770,166,1,0,0,0,771,772,7,8,0,0,772,773,7,20,0,0,773,
+  	774,7,15,0,0,774,775,7,16,0,0,775,776,7,9,0,0,776,777,7,7,0,0,777,168,
+  	1,0,0,0,778,779,7,8,0,0,779,780,7,20,0,0,780,781,7,7,0,0,781,782,7,8,
+  	0,0,782,783,7,5,0,0,783,784,7,10,0,0,784,785,7,4,0,0,785,786,7,16,0,0,
+  	786,787,7,5,0,0,787,170,1,0,0,0,788,789,7,19,0,0,789,790,7,0,0,0,790,
+  	791,7,3,0,0,791,792,7,10,0,0,792,793,7,8,0,0,793,172,1,0,0,0,794,795,
+  	7,19,0,0,795,796,7,9,0,0,796,797,7,16,0,0,797,798,7,18,0,0,798,174,1,
+  	0,0,0,799,800,7,19,0,0,800,801,7,16,0,0,801,802,7,9,0,0,802,803,7,1,0,
+  	0,803,804,7,8,0,0,804,176,1,0,0,0,805,806,7,11,0,0,806,807,7,3,0,0,807,
+  	808,7,16,0,0,808,809,7,13,0,0,809,178,1,0,0,0,810,811,7,11,0,0,811,812,
+  	7,9,0,0,812,813,7,0,0,0,813,814,7,15,0,0,814,815,7,12,0,0,815,180,1,0,
+  	0,0,816,817,7,11,0,0,817,818,7,9,0,0,818,819,7,16,0,0,819,820,7,17,0,
+  	0,820,821,7,15,0,0,821,182,1,0,0,0,822,823,7,12,0,0,823,824,7,8,0,0,824,
+  	825,7,0,0,0,825,826,7,6,0,0,826,827,7,8,0,0,827,828,7,9,0,0,828,829,7,
+  	10,0,0,829,184,1,0,0,0,830,831,7,12,0,0,831,832,7,4,0,0,832,833,7,5,0,
+  	0,833,834,7,7,0,0,834,186,1,0,0,0,835,836,7,4,0,0,836,837,7,18,0,0,837,
+  	838,7,15,0,0,838,839,7,16,0,0,839,840,7,9,0,0,840,841,7,7,0,0,841,188,
+  	1,0,0,0,842,843,7,4,0,0,843,844,7,19,0,0,844,190,1,0,0,0,845,846,7,4,
+  	0,0,846,847,7,5,0,0,847,192,1,0,0,0,848,849,7,4,0,0,849,850,7,5,0,0,850,
+  	851,7,1,0,0,851,852,7,9,0,0,852,853,7,8,0,0,853,854,7,18,0,0,854,855,
+  	7,8,0,0,855,856,7,5,0,0,856,857,7,7,0,0,857,194,1,0,0,0,858,859,7,4,0,
+  	0,859,860,7,5,0,0,860,861,7,10,0,0,861,862,7,7,0,0,862,863,7,0,0,0,863,
+  	864,7,3,0,0,864,865,7,3,0,0,865,196,1,0,0,0,866,867,7,4,0,0,867,868,7,
+  	10,0,0,868,198,1,0,0,0,869,870,7,21,0,0,870,871,7,16,0,0,871,872,7,4,
+  	0,0,872,873,7,5,0,0,873,200,1,0,0,0,874,875,7,14,0,0,875,876,7,8,0,0,
+  	876,877,7,2,0,0,877,202,1,0,0,0,878,879,7,3,0,0,879,880,7,4,0,0,880,881,
+  	7,18,0,0,881,882,7,4,0,0,882,883,7,7,0,0,883,204,1,0,0,0,884,885,7,3,
+  	0,0,885,886,7,16,0,0,886,887,7,0,0,0,887,888,7,6,0,0,888,206,1,0,0,0,
+  	889,890,7,3,0,0,890,891,7,16,0,0,891,892,7,11,0,0,892,893,7,4,0,0,893,
+  	894,7,1,0,0,894,895,7,0,0,0,895,896,7,3,0,0,896,208,1,0,0,0,897,898,7,
+  	18,0,0,898,899,7,0,0,0,899,900,7,1,0,0,900,901,7,9,0,0,901,902,7,16,0,
+  	0,902,210,1,0,0,0,903,904,7,18,0,0,904,905,7,0,0,0,905,906,7,7,0,0,906,
+  	907,7,1,0,0,907,908,7,12,0,0,908,212,1,0,0,0,909,910,7,18,0,0,910,911,
+  	7,0,0,0,911,912,7,20,0,0,912,913,7,22,0,0,913,914,7,0,0,0,914,915,7,3,
+  	0,0,915,916,7,17,0,0,916,917,7,8,0,0,917,214,1,0,0,0,918,919,7,18,0,0,
+  	919,920,7,8,0,0,920,921,7,9,0,0,921,922,7,11,0,0,922,923,7,8,0,0,923,
+  	216,1,0,0,0,924,925,7,18,0,0,925,926,7,4,0,0,926,927,7,5,0,0,927,928,
+  	7,22,0,0,928,929,7,0,0,0,929,930,7,3,0,0,930,931,7,17,0,0,931,932,7,8,
+  	0,0,932,218,1,0,0,0,933,934,7,18,0,0,934,935,7,17,0,0,935,936,7,3,0,0,
+  	936,937,7,7,0,0,937,938,7,4,0,0,938,939,5,95,0,0,939,940,7,21,0,0,940,
+  	941,7,16,0,0,941,942,7,4,0,0,942,943,7,5,0,0,943,220,1,0,0,0,944,945,
+  	7,5,0,0,945,946,7,16,0,0,946,222,1,0,0,0,947,948,7,5,0,0,948,949,7,16,
+  	0,0,949,950,7,6,0,0,950,951,7,8,0,0,951,224,1,0,0,0,952,953,7,5,0,0,953,
+  	954,7,16,0,0,954,955,7,7,0,0,955,226,1,0,0,0,956,957,7,5,0,0,957,958,
+  	7,16,0,0,958,959,7,5,0,0,959,960,7,8,0,0,960,228,1,0,0,0,961,962,7,5,
+  	0,0,962,963,7,17,0,0,963,964,7,3,0,0,964,965,7,3,0,0,965,230,1,0,0,0,
+  	966,967,7,16,0,0,967,968,7,5,0,0,968,232,1,0,0,0,969,970,7,16,0,0,970,
+  	971,7,5,0,0,971,972,7,3,0,0,972,973,7,2,0,0,973,234,1,0,0,0,974,975,7,
+  	16,0,0,975,976,7,15,0,0,976,977,7,7,0,0,977,978,7,4,0,0,978,979,7,16,
+  	0,0,979,980,7,5,0,0,980,981,7,0,0,0,981,982,7,3,0,0,982,236,1,0,0,0,983,
+  	984,7,16,0,0,984,985,7,9,0,0,985,238,1,0,0,0,986,987,7,16,0,0,987,988,
+  	7,9,0,0,988,989,7,6,0,0,989,990,7,8,0,0,990,991,7,9,0,0,991,240,1,0,0,
+  	0,992,993,7,15,0,0,993,994,7,9,0,0,994,995,7,4,0,0,995,996,7,18,0,0,996,
+  	997,7,0,0,0,997,998,7,9,0,0,998,999,7,2,0,0,999,242,1,0,0,0,1000,1001,
+  	7,15,0,0,1001,1002,7,9,0,0,1002,1003,7,16,0,0,1003,1004,7,19,0,0,1004,
+  	1005,7,4,0,0,1005,1006,7,3,0,0,1006,1007,7,8,0,0,1007,244,1,0,0,0,1008,
+  	1009,7,15,0,0,1009,1010,7,9,0,0,1010,1011,7,16,0,0,1011,1012,7,21,0,0,
+  	1012,1013,7,8,0,0,1013,1014,7,1,0,0,1014,1015,7,7,0,0,1015,246,1,0,0,
+  	0,1016,1017,7,9,0,0,1017,1018,7,8,0,0,1018,1019,7,0,0,0,1019,1020,7,6,
+  	0,0,1020,248,1,0,0,0,1021,1022,7,9,0,0,1022,1023,7,8,0,0,1023,1024,7,
+  	3,0,0,1024,250,1,0,0,0,1025,1026,7,9,0,0,1026,1027,7,8,0,0,1027,1028,
+  	7,5,0,0,1028,1029,7,0,0,0,1029,1030,7,18,0,0,1030,1031,7,8,0,0,1031,252,
+  	1,0,0,0,1032,1033,7,9,0,0,1033,1034,7,8,0,0,1034,1035,7,7,0,0,1035,1036,
+  	7,17,0,0,1036,1037,7,9,0,0,1037,1038,7,5,0,0,1038,254,1,0,0,0,1039,1040,
+  	7,9,0,0,1040,1041,7,16,0,0,1041,1042,7,3,0,0,1042,1043,7,3,0,0,1043,1044,
+  	7,13,0,0,1044,1045,7,0,0,0,1045,1046,7,1,0,0,1046,1047,7,14,0,0,1047,
+  	256,1,0,0,0,1048,1049,7,9,0,0,1049,1050,7,16,0,0,1050,1051,7,3,0,0,1051,
+  	1052,7,3,0,0,1052,1053,7,13,0,0,1053,1054,7,0,0,0,1054,1055,7,1,0,0,1055,
+  	1056,7,14,0,0,1056,1057,5,95,0,0,1057,1058,7,10,0,0,1058,1059,7,14,0,
+  	0,1059,1060,7,4,0,0,1060,1061,7,15,0,0,1061,1062,5,95,0,0,1062,1063,7,
+  	1,0,0,1063,1064,7,12,0,0,1064,1065,7,8,0,0,1065,1066,7,1,0,0,1066,1067,
+  	7,14,0,0,1067,1068,7,15,0,0,1068,1069,7,16,0,0,1069,1070,7,4,0,0,1070,
+  	1071,7,5,0,0,1071,1072,7,7,0,0,1072,258,1,0,0,0,1073,1074,7,10,0,0,1074,
+  	1075,7,8,0,0,1075,1076,7,23,0,0,1076,1077,7,17,0,0,1077,1078,7,8,0,0,
+  	1078,1079,7,5,0,0,1079,1080,7,1,0,0,1080,1081,7,8,0,0,1081,260,1,0,0,
+  	0,1082,1083,7,10,0,0,1083,1084,7,8,0,0,1084,1085,7,7,0,0,1085,262,1,0,
+  	0,0,1086,1087,7,10,0,0,1087,1088,7,12,0,0,1088,1089,7,16,0,0,1089,1090,
+  	7,9,0,0,1090,1091,7,7,0,0,1091,1092,7,8,0,0,1092,1093,7,10,0,0,1093,1094,
+  	7,7,0,0,1094,264,1,0,0,0,1095,1096,7,10,0,0,1096,1097,7,7,0,0,1097,1098,
+  	7,0,0,0,1098,1099,7,9,0,0,1099,1100,7,7,0,0,1100,266,1,0,0,0,1101,1102,
+  	7,10,0,0,1102,1103,7,7,0,0,1103,1104,7,0,0,0,1104,1105,7,9,0,0,1105,1106,
+  	7,7,0,0,1106,1107,7,10,0,0,1107,268,1,0,0,0,1108,1109,7,10,0,0,1109,1110,
+  	7,7,0,0,1110,1111,7,9,0,0,1111,1112,7,17,0,0,1112,1113,7,1,0,0,1113,1114,
+  	7,7,0,0,1114,270,1,0,0,0,1115,1116,7,7,0,0,1116,1117,7,0,0,0,1117,1118,
+  	7,13,0,0,1118,1119,7,3,0,0,1119,1120,7,8,0,0,1120,272,1,0,0,0,1121,1122,
+  	7,7,0,0,1122,1123,7,12,0,0,1123,1124,7,8,0,0,1124,1125,7,5,0,0,1125,274,
+  	1,0,0,0,1126,1127,7,7,0,0,1127,1128,7,16,0,0,1128,276,1,0,0,0,1129,1130,
+  	7,7,0,0,1130,1131,7,9,0,0,1131,1132,7,0,0,0,1132,1133,7,4,0,0,1133,1134,
+  	7,3,0,0,1134,278,1,0,0,0,1135,1136,7,7,0,0,1136,1137,7,9,0,0,1137,1138,
+  	7,0,0,0,1138,1139,7,5,0,0,1139,1140,7,10,0,0,1140,1141,7,0,0,0,1141,1142,
+  	7,1,0,0,1142,1143,7,7,0,0,1143,1144,7,4,0,0,1144,1145,7,16,0,0,1145,1146,
+  	7,5,0,0,1146,280,1,0,0,0,1147,1148,7,7,0,0,1148,1149,7,9,0,0,1149,1150,
+  	7,17,0,0,1150,1151,7,8,0,0,1151,282,1,0,0,0,1152,1153,7,7,0,0,1153,1154,
+  	7,2,0,0,1154,1155,7,15,0,0,1155,1156,7,8,0,0,1156,284,1,0,0,0,1157,1158,
+  	7,17,0,0,1158,1159,7,5,0,0,1159,1160,7,4,0,0,1160,1161,7,16,0,0,1161,
+  	1162,7,5,0,0,1162,286,1,0,0,0,1163,1164,7,17,0,0,1164,1165,7,5,0,0,1165,
+  	1166,7,24,0,0,1166,1167,7,4,0,0,1167,1168,7,5,0,0,1168,1169,7,6,0,0,1169,
+  	288,1,0,0,0,1170,1171,7,17,0,0,1171,1172,7,5,0,0,1172,1173,7,4,0,0,1173,
+  	1174,7,5,0,0,1174,1175,7,10,0,0,1175,1176,7,7,0,0,1176,1177,7,0,0,0,1177,
+  	1178,7,3,0,0,1178,1179,7,3,0,0,1179,290,1,0,0,0,1180,1181,7,17,0,0,1181,
+  	1182,7,15,0,0,1182,1183,7,6,0,0,1183,1184,7,0,0,0,1184,1185,7,7,0,0,1185,
+  	1186,7,8,0,0,1186,292,1,0,0,0,1187,1188,7,17,0,0,1188,1189,7,10,0,0,1189,
+  	1190,7,8,0,0,1190,294,1,0,0,0,1191,1192,7,24,0,0,1192,1193,7,12,0,0,1193,
+  	1194,7,8,0,0,1194,1195,7,5,0,0,1195,296,1,0,0,0,1196,1197,7,24,0,0,1197,
+  	1198,7,12,0,0,1198,1199,7,8,0,0,1199,1200,7,9,0,0,1200,1201,7,8,0,0,1201,
+  	298,1,0,0,0,1202,1203,7,24,0,0,1203,1204,7,4,0,0,1204,1205,7,7,0,0,1205,
+  	1206,7,12,0,0,1206,300,1,0,0,0,1207,1208,7,24,0,0,1208,1209,7,9,0,0,1209,
+  	1210,7,4,0,0,1210,1211,7,7,0,0,1211,1212,7,8,0,0,1212,302,1,0,0,0,1213,
+  	1214,7,24,0,0,1214,1215,7,10,0,0,1215,1216,7,12,0,0,1216,1217,7,16,0,
+  	0,1217,1218,7,9,0,0,1218,1219,7,7,0,0,1219,1220,7,8,0,0,1220,1221,7,10,
+  	0,0,1221,1222,7,7,0,0,1222,304,1,0,0,0,1223,1224,7,20,0,0,1224,1225,7,
+  	16,0,0,1225,1226,7,9,0,0,1226,306,1,0,0,0,1227,1228,7,10,0,0,1228,1229,
+  	7,4,0,0,1229,1230,7,5,0,0,1230,1231,7,11,0,0,1231,1232,7,3,0,0,1232,1233,
+  	7,8,0,0,1233,308,1,0,0,0,1234,1235,7,2,0,0,1235,1236,7,4,0,0,1236,1237,
+  	7,8,0,0,1237,1238,7,3,0,0,1238,1239,7,6,0,0,1239,310,1,0,0,0,1240,1241,
+  	7,17,0,0,1241,1242,7,10,0,0,1242,1243,7,8,0,0,1243,1244,7,9,0,0,1244,
+  	312,1,0,0,0,1245,1246,7,15,0,0,1246,1247,7,0,0,0,1247,1248,7,10,0,0,1248,
+  	1249,7,10,0,0,1249,1250,7,24,0,0,1250,1251,7,16,0,0,1251,1252,7,9,0,0,
+  	1252,1253,7,6,0,0,1253,314,1,0,0,0,1254,1255,7,9,0,0,1255,1256,7,16,0,
+  	0,1256,1257,7,3,0,0,1257,1258,7,8,0,0,1258,316,1,0,0,0,1259,1260,7,18,
+  	0,0,1260,1261,7,0,0,0,1261,1262,7,15,0,0,1262,318,1,0,0,0,1263,1264,7,
+  	6,0,0,1264,1265,7,8,0,0,1265,1266,7,1,0,0,1266,1267,7,4,0,0,1267,1268,
+  	7,18,0,0,1268,1269,7,0,0,0,1269,1270,7,3,0,0,1270,320,1,0,0,0,1271,1272,
+  	5,42,0,0,1272,322,1,0,0,0,1273,1274,7,10,0,0,1274,1275,7,14,0,0,1275,
+  	1276,7,4,0,0,1276,1277,7,15,0,0,1277,324,1,0,0,0,1278,1279,5,33,0,0,1279,
+  	1280,5,61,0,0,1280,326,1,0,0,0,1281,1282,5,58,0,0,1282,328,1,0,0,0,1283,
+  	1284,5,46,0,0,1284,1285,5,46,0,0,1285,330,1,0,0,0,1286,1287,5,45,0,0,
+  	1287,332,1,0,0,0,1288,1289,5,33,0,0,1289,334,1,0,0,0,1290,1295,5,34,0,
+  	0,1291,1294,3,401,200,0,1292,1294,3,337,168,0,1293,1291,1,0,0,0,1293,
+  	1292,1,0,0,0,1294,1297,1,0,0,0,1295,1293,1,0,0,0,1295,1296,1,0,0,0,1296,
+  	1298,1,0,0,0,1297,1295,1,0,0,0,1298,1309,5,34,0,0,1299,1304,5,39,0,0,
+  	1300,1303,3,381,190,0,1301,1303,3,337,168,0,1302,1300,1,0,0,0,1302,1301,
+  	1,0,0,0,1303,1306,1,0,0,0,1304,1302,1,0,0,0,1304,1305,1,0,0,0,1305,1307,
+  	1,0,0,0,1306,1304,1,0,0,0,1307,1309,5,39,0,0,1308,1290,1,0,0,0,1308,1299,
+  	1,0,0,0,1309,336,1,0,0,0,1310,1332,5,92,0,0,1311,1333,7,25,0,0,1312,1313,
+  	7,20,0,0,1313,1314,3,343,171,0,1314,1315,3,343,171,0,1315,1333,1,0,0,
+  	0,1316,1317,7,17,0,0,1317,1318,3,343,171,0,1318,1319,3,343,171,0,1319,
+  	1320,3,343,171,0,1320,1321,3,343,171,0,1321,1333,1,0,0,0,1322,1323,7,
+  	17,0,0,1323,1324,3,343,171,0,1324,1325,3,343,171,0,1325,1326,3,343,171,
+  	0,1326,1327,3,343,171,0,1327,1328,3,343,171,0,1328,1329,3,343,171,0,1329,
+  	1330,3,343,171,0,1330,1331,3,343,171,0,1331,1333,1,0,0,0,1332,1311,1,
+  	0,0,0,1332,1312,1,0,0,0,1332,1316,1,0,0,0,1332,1322,1,0,0,0,1333,338,
+  	1,0,0,0,1334,1343,3,351,175,0,1335,1339,3,347,173,0,1336,1338,3,345,172,
+  	0,1337,1336,1,0,0,0,1338,1341,1,0,0,0,1339,1337,1,0,0,0,1339,1340,1,0,
+  	0,0,1340,1343,1,0,0,0,1341,1339,1,0,0,0,1342,1334,1,0,0,0,1342,1335,1,
+  	0,0,0,1343,340,1,0,0,0,1344,1346,7,26,0,0,1345,1344,1,0,0,0,1346,342,
+  	1,0,0,0,1347,1350,3,345,172,0,1348,1350,3,341,170,0,1349,1347,1,0,0,0,
+  	1349,1348,1,0,0,0,1350,344,1,0,0,0,1351,1354,3,351,175,0,1352,1354,3,
+  	347,173,0,1353,1351,1,0,0,0,1353,1352,1,0,0,0,1354,346,1,0,0,0,1355,1358,
+  	3,349,174,0,1356,1358,2,56,57,0,1357,1355,1,0,0,0,1357,1356,1,0,0,0,1358,
+  	348,1,0,0,0,1359,1360,2,49,55,0,1360,350,1,0,0,0,1361,1362,5,48,0,0,1362,
+  	352,1,0,0,0,1363,1365,3,345,172,0,1364,1363,1,0,0,0,1365,1366,1,0,0,0,
+  	1366,1364,1,0,0,0,1366,1367,1,0,0,0,1367,1386,1,0,0,0,1368,1370,3,345,
+  	172,0,1369,1368,1,0,0,0,1370,1371,1,0,0,0,1371,1369,1,0,0,0,1371,1372,
+  	1,0,0,0,1372,1373,1,0,0,0,1373,1375,5,46,0,0,1374,1376,3,345,172,0,1375,
+  	1374,1,0,0,0,1376,1377,1,0,0,0,1377,1375,1,0,0,0,1377,1378,1,0,0,0,1378,
+  	1386,1,0,0,0,1379,1381,5,46,0,0,1380,1382,3,345,172,0,1381,1380,1,0,0,
+  	0,1382,1383,1,0,0,0,1383,1381,1,0,0,0,1383,1384,1,0,0,0,1384,1386,1,0,
+  	0,0,1385,1364,1,0,0,0,1385,1369,1,0,0,0,1385,1379,1,0,0,0,1386,1387,1,
+  	0,0,0,1387,1389,7,8,0,0,1388,1390,5,45,0,0,1389,1388,1,0,0,0,1389,1390,
+  	1,0,0,0,1390,1392,1,0,0,0,1391,1393,3,345,172,0,1392,1391,1,0,0,0,1393,
+  	1394,1,0,0,0,1394,1392,1,0,0,0,1394,1395,1,0,0,0,1395,354,1,0,0,0,1396,
+  	1398,3,345,172,0,1397,1396,1,0,0,0,1398,1401,1,0,0,0,1399,1397,1,0,0,
+  	0,1399,1400,1,0,0,0,1400,1402,1,0,0,0,1401,1399,1,0,0,0,1402,1404,5,46,
+  	0,0,1403,1405,3,345,172,0,1404,1403,1,0,0,0,1405,1406,1,0,0,0,1406,1404,
+  	1,0,0,0,1406,1407,1,0,0,0,1407,356,1,0,0,0,1408,1412,3,359,179,0,1409,
+  	1411,3,361,180,0,1410,1409,1,0,0,0,1411,1414,1,0,0,0,1412,1410,1,0,0,
+  	0,1412,1413,1,0,0,0,1413,358,1,0,0,0,1414,1412,1,0,0,0,1415,1418,3,409,
+  	204,0,1416,1418,3,397,198,0,1417,1415,1,0,0,0,1417,1416,1,0,0,0,1418,
+  	360,1,0,0,0,1419,1422,3,377,188,0,1420,1422,3,393,196,0,1421,1419,1,0,
+  	0,0,1421,1420,1,0,0,0,1422,362,1,0,0,0,1423,1427,5,96,0,0,1424,1426,3,
+  	373,186,0,1425,1424,1,0,0,0,1426,1429,1,0,0,0,1427,1425,1,0,0,0,1427,
+  	1428,1,0,0,0,1428,1430,1,0,0,0,1429,1427,1,0,0,0,1430,1432,5,96,0,0,1431,
+  	1423,1,0,0,0,1432,1433,1,0,0,0,1433,1431,1,0,0,0,1433,1434,1,0,0,0,1434,
+  	364,1,0,0,0,1435,1437,3,367,183,0,1436,1435,1,0,0,0,1437,1438,1,0,0,0,
+  	1438,1436,1,0,0,0,1438,1439,1,0,0,0,1439,366,1,0,0,0,1440,1453,3,395,
+  	197,0,1441,1453,3,399,199,0,1442,1453,3,403,201,0,1443,1453,3,405,202,
+  	0,1444,1453,3,371,185,0,1445,1453,3,391,195,0,1446,1453,3,389,194,0,1447,
+  	1453,3,387,193,0,1448,1453,3,375,187,0,1449,1453,3,407,203,0,1450,1453,
+  	7,27,0,0,1451,1453,3,369,184,0,1452,1440,1,0,0,0,1452,1441,1,0,0,0,1452,
+  	1442,1,0,0,0,1452,1443,1,0,0,0,1452,1444,1,0,0,0,1452,1445,1,0,0,0,1452,
+  	1446,1,0,0,0,1452,1447,1,0,0,0,1452,1448,1,0,0,0,1452,1449,1,0,0,0,1452,
+  	1450,1,0,0,0,1452,1451,1,0,0,0,1453,368,1,0,0,0,1454,1455,5,47,0,0,1455,
+  	1456,5,42,0,0,1456,1462,1,0,0,0,1457,1461,3,379,189,0,1458,1459,5,42,
+  	0,0,1459,1461,3,385,192,0,1460,1457,1,0,0,0,1460,1458,1,0,0,0,1461,1464,
+  	1,0,0,0,1462,1460,1,0,0,0,1462,1463,1,0,0,0,1463,1465,1,0,0,0,1464,1462,
+  	1,0,0,0,1465,1466,5,42,0,0,1466,1484,5,47,0,0,1467,1468,5,47,0,0,1468,
+  	1469,5,47,0,0,1469,1473,1,0,0,0,1470,1472,3,383,191,0,1471,1470,1,0,0,
+  	0,1472,1475,1,0,0,0,1473,1471,1,0,0,0,1473,1474,1,0,0,0,1474,1477,1,0,
+  	0,0,1475,1473,1,0,0,0,1476,1478,3,391,195,0,1477,1476,1,0,0,0,1477,1478,
+  	1,0,0,0,1478,1481,1,0,0,0,1479,1482,3,403,201,0,1480,1482,5,0,0,1,1481,
+  	1479,1,0,0,0,1481,1480,1,0,0,0,1482,1484,1,0,0,0,1483,1454,1,0,0,0,1483,
+  	1467,1,0,0,0,1484,370,1,0,0,0,1485,1486,7,28,0,0,1486,372,1,0,0,0,1487,
+  	1488,8,29,0,0,1488,374,1,0,0,0,1489,1490,7,30,0,0,1490,376,1,0,0,0,1491,
+  	1492,7,31,0,0,1492,378,1,0,0,0,1493,1494,8,32,0,0,1494,380,1,0,0,0,1495,
+  	1496,8,33,0,0,1496,382,1,0,0,0,1497,1498,8,34,0,0,1498,384,1,0,0,0,1499,
+  	1500,8,35,0,0,1500,386,1,0,0,0,1501,1502,7,36,0,0,1502,388,1,0,0,0,1503,
+  	1504,7,37,0,0,1504,390,1,0,0,0,1505,1506,7,38,0,0,1506,392,1,0,0,0,1507,
+  	1508,7,39,0,0,1508,394,1,0,0,0,1509,1510,7,40,0,0,1510,396,1,0,0,0,1511,
+  	1512,7,41,0,0,1512,398,1,0,0,0,1513,1514,7,42,0,0,1514,400,1,0,0,0,1515,
+  	1516,8,43,0,0,1516,402,1,0,0,0,1517,1518,7,44,0,0,1518,404,1,0,0,0,1519,
+  	1520,7,45,0,0,1520,406,1,0,0,0,1521,1522,7,46,0,0,1522,408,1,0,0,0,1523,
+  	1524,7,47,0,0,1524,410,1,0,0,0,1525,1526,9,0,0,0,1526,412,1,0,0,0,35,
+  	0,1293,1295,1302,1304,1308,1332,1339,1342,1345,1349,1353,1357,1366,1371,
+  	1377,1383,1385,1389,1394,1399,1406,1412,1417,1421,1427,1433,1438,1452,
+  	1460,1462,1473,1477,1481,1483,0
+  };
+  staticData->serializedATN = antlr4::atn::SerializedATNView(serializedATNSegment, sizeof(serializedATNSegment) / sizeof(serializedATNSegment[0]));
+
+  antlr4::atn::ATNDeserializer deserializer;
+  staticData->atn = deserializer.deserialize(staticData->serializedATN);
+
+  const size_t count = staticData->atn->getNumberOfDecisions();
+  staticData->decisionToDFA.reserve(count);
+  for (size_t i = 0; i < count; i++) { 
+    staticData->decisionToDFA.emplace_back(staticData->atn->getDecisionState(i), i);
+  }
+  cypherlexerLexerStaticData = staticData.release();
+}
+
+}
+
+CypherLexer::CypherLexer(CharStream *input) : Lexer(input) {
+  CypherLexer::initialize();
+  _interpreter = new atn::LexerATNSimulator(this, *cypherlexerLexerStaticData->atn, cypherlexerLexerStaticData->decisionToDFA, cypherlexerLexerStaticData->sharedContextCache);
+}
+
+CypherLexer::~CypherLexer() {
+  delete _interpreter;
+}
+
+std::string CypherLexer::getGrammarFileName() const {
+  return "Cypher.g4";
+}
+
+const std::vector<std::string>& CypherLexer::getRuleNames() const {
+  return cypherlexerLexerStaticData->ruleNames;
+}
+
+const std::vector<std::string>& CypherLexer::getChannelNames() const {
+  return cypherlexerLexerStaticData->channelNames;
+}
+
+const std::vector<std::string>& CypherLexer::getModeNames() const {
+  return cypherlexerLexerStaticData->modeNames;
+}
+
+const dfa::Vocabulary& CypherLexer::getVocabulary() const {
+  return cypherlexerLexerStaticData->vocabulary;
+}
+
+antlr4::atn::SerializedATNView CypherLexer::getSerializedATN() const {
+  return cypherlexerLexerStaticData->serializedATN;
+}
+
+const atn::ATN& CypherLexer::getATN() const {
+  return *cypherlexerLexerStaticData->atn;
+}
+
+
+
+
+void CypherLexer::initialize() {
+#if ANTLR4_USE_THREAD_LOCAL_CACHE
+  cypherlexerLexerInitialize();
+#else
+  ::antlr4::internal::call_once(cypherlexerLexerOnceFlag, cypherlexerLexerInitialize);
+#endif
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/cypher_parser.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/cypher_parser.cpp
new file mode 100644
index 0000000000..1bff0da747
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/cypher_parser.cpp
@@ -0,0 +1,19407 @@
+
+// Generated from Cypher.g4 by ANTLR 4.13.1
+
+
+
+#include "cypher_parser.h"
+
+
+using namespace antlrcpp;
+
+using namespace antlr4;
+
+namespace {
+
+struct CypherParserStaticData final {
+  CypherParserStaticData(std::vector<std::string> ruleNames,
+                        std::vector<std::string> literalNames,
+                        std::vector<std::string> symbolicNames)
+      : ruleNames(std::move(ruleNames)), literalNames(std::move(literalNames)),
+        symbolicNames(std::move(symbolicNames)),
+        vocabulary(this->literalNames, this->symbolicNames) {}
+
+  CypherParserStaticData(const CypherParserStaticData&) = delete;
+  CypherParserStaticData(CypherParserStaticData&&) = delete;
+  CypherParserStaticData& operator=(const CypherParserStaticData&) = delete;
+  CypherParserStaticData& operator=(CypherParserStaticData&&) = delete;
+
+  std::vector<antlr4::dfa::DFA> decisionToDFA;
+  antlr4::atn::PredictionContextCache sharedContextCache;
+  const std::vector<std::string> ruleNames;
+  const std::vector<std::string> literalNames;
+  const std::vector<std::string> symbolicNames;
+  const antlr4::dfa::Vocabulary vocabulary;
+  antlr4::atn::SerializedATNView serializedATN;
+  std::unique_ptr<antlr4::atn::ATN> atn;
+};
+
+::antlr4::internal::OnceFlag cypherParserOnceFlag;
+#if ANTLR4_USE_THREAD_LOCAL_CACHE
+static thread_local
+#endif
+CypherParserStaticData *cypherParserStaticData = nullptr;
+
+void cypherParserInitialize() {
+#if ANTLR4_USE_THREAD_LOCAL_CACHE
+  if (cypherParserStaticData != nullptr) {
+    return;
+  }
+#else
+  assert(cypherParserStaticData == nullptr);
+#endif
+  auto staticData = std::make_unique<CypherParserStaticData>(
+    std::vector<std::string>{
+      "ku_Statements", "oC_Cypher", "oC_Statement", "kU_CopyFrom", "kU_ColumnNames", 
+      "kU_ScanSource", "kU_CopyFromByColumn", "kU_CopyTO", "kU_ExportDatabase", 
+      "kU_ImportDatabase", "kU_AttachDatabase", "kU_Option", "kU_Options", 
+      "kU_DetachDatabase", "kU_UseDatabase", "kU_StandaloneCall", "kU_CommentOn", 
+      "kU_CreateMacro", "kU_PositionalArgs", "kU_DefaultArg", "kU_FilePaths", 
+      "kU_IfNotExists", "kU_CreateNodeTable", "kU_CreateRelTable", "kU_FromToConnections", 
+      "kU_FromToConnection", "kU_CreateSequence", "kU_CreateType", "kU_SequenceOptions", 
+      "kU_WithPasswd", "kU_CreateUser", "kU_CreateRole", "kU_IncrementBy", 
+      "kU_MinValue", "kU_MaxValue", "kU_StartWith", "kU_Cycle", "kU_IfExists", 
+      "kU_Drop", "kU_AlterTable", "kU_AlterOptions", "kU_AddProperty", "kU_Default", 
+      "kU_DropProperty", "kU_RenameTable", "kU_RenameProperty", "kU_AddFromToConnection", 
+      "kU_DropFromToConnection", "kU_ColumnDefinitions", "kU_ColumnDefinition", 
+      "kU_PropertyDefinitions", "kU_PropertyDefinition", "kU_CreateNodeConstraint", 
+      "kU_UnionType", "kU_StructType", "kU_MapType", "kU_DecimalType", "kU_DataType", 
+      "kU_ListIdentifiers", "kU_ListIdentifier", "oC_AnyCypherOption", "oC_Explain", 
+      "oC_Profile", "kU_Transaction", "kU_Extension", "kU_LoadExtension", 
+      "kU_InstallExtension", "kU_UninstallExtension", "kU_UpdateExtension", 
+      "oC_Query", "oC_RegularQuery", "oC_Union", "oC_SingleQuery", "oC_SinglePartQuery", 
+      "oC_MultiPartQuery", "kU_QueryPart", "oC_UpdatingClause", "oC_ReadingClause", 
+      "kU_LoadFrom", "oC_YieldItem", "oC_YieldItems", "kU_InQueryCall", 
+      "oC_Match", "kU_Hint", "kU_JoinNode", "oC_Unwind", "oC_Create", "oC_Merge", 
+      "oC_MergeAction", "oC_Set", "oC_SetItem", "oC_Delete", "oC_With", 
+      "oC_Return", "oC_ProjectionBody", "oC_ProjectionItems", "oC_ProjectionItem", 
+      "oC_Order", "oC_Skip", "oC_Limit", "oC_SortItem", "oC_Where", "oC_Pattern", 
+      "oC_PatternPart", "oC_AnonymousPatternPart", "oC_PatternElement", 
+      "oC_NodePattern", "oC_PatternElementChain", "oC_RelationshipPattern", 
+      "oC_RelationshipDetail", "kU_Properties", "oC_RelationshipTypes", 
+      "oC_NodeLabels", "kU_RecursiveDetail", "kU_RecursiveType", "oC_RangeLiteral", 
+      "kU_RecursiveComprehension", "kU_RecursiveProjectionItems", "oC_LowerBound", 
+      "oC_UpperBound", "oC_LabelName", "oC_RelTypeName", "oC_Expression", 
+      "oC_OrExpression", "oC_XorExpression", "oC_AndExpression", "oC_NotExpression", 
+      "oC_ComparisonExpression", "kU_ComparisonOperator", "kU_BitwiseOrOperatorExpression", 
+      "kU_BitwiseAndOperatorExpression", "kU_BitShiftOperatorExpression", 
+      "kU_BitShiftOperator", "oC_AddOrSubtractExpression", "kU_AddOrSubtractOperator", 
+      "oC_MultiplyDivideModuloExpression", "kU_MultiplyDivideModuloOperator", 
+      "oC_PowerOfExpression", "oC_StringListNullOperatorExpression", "oC_ListOperatorExpression", 
+      "oC_StringOperatorExpression", "oC_RegularExpression", "oC_NullOperatorExpression", 
+      "oC_UnaryAddSubtractOrFactorialExpression", "oC_PropertyOrLabelsExpression", 
+      "oC_Atom", "oC_Quantifier", "oC_FilterExpression", "oC_IdInColl", 
+      "oC_Literal", "oC_BooleanLiteral", "oC_ListLiteral", "kU_ListEntry", 
+      "kU_StructLiteral", "kU_StructField", "oC_ParenthesizedExpression", 
+      "oC_FunctionInvocation", "oC_FunctionName", "kU_FunctionParameter", 
+      "kU_LambdaParameter", "kU_LambdaVars", "oC_PathPatterns", "oC_ExistCountSubquery", 
+      "oC_PropertyLookup", "oC_CaseExpression", "oC_CaseAlternative", "oC_Variable", 
+      "oC_NumberLiteral", "oC_Parameter", "oC_PropertyExpression", "oC_PropertyKeyName", 
+      "oC_IntegerLiteral", "oC_DoubleLiteral", "oC_SchemaName", "oC_SymbolicName", 
+      "kU_NonReservedKeywords", "oC_LeftArrowHead", "oC_RightArrowHead", 
+      "oC_Dash"
+    },
+    std::vector<std::string>{
+      "", "';'", "'('", "')'", "','", "'.'", "'='", "'['", "']'", "'{'", 
+      "'}'", "'|'", "'<>'", "'<'", "'<='", "'>'", "'>='", "'&'", "'>>'", 
+      "'<<'", "'+'", "'/'", "'%'", "'^'", "'=~'", "'$'", "'\\u27E8'", "'\\u3008'", 
+      "'\\uFE64'", "'\\uFF1C'", "'\\u27E9'", "'\\u3009'", "'\\uFE65'", "'\\uFF1E'", 
+      "'\\u00AD'", "'\\u2010'", "'\\u2011'", "'\\u2012'", "'\\u2013'", "'\\u2014'", 
+      "'\\u2015'", "'\\u2212'", "'\\uFE58'", "'\\uFE63'", "'\\uFF0D'", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "'*'", "", "'!='", 
+      "':'", "'..'", "'-'", "'!'", "", "", "", "", "", "", "", "", "'0'"
+    },
+    std::vector<std::string>{
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", 
+      "", "", "", "", "", "", "", "", "", "", "", "ACYCLIC", "ANY", "ADD", 
+      "ALL", "ALTER", "AND", "AS", "ASC", "ASCENDING", "ATTACH", "BEGIN", 
+      "BY", "CALL", "CASE", "CAST", "CHECKPOINT", "COLUMN", "COMMENT", "COMMIT", 
+      "COMMIT_SKIP_CHECKPOINT", "CONTAINS", "COPY", "COUNT", "CREATE", "CYCLE", 
+      "DATABASE", "DBTYPE", "DEFAULT", "DELETE", "DESC", "DESCENDING", "DETACH", 
+      "DISTINCT", "DROP", "ELSE", "END", "ENDS", "EXISTS", "EXPLAIN", "EXPORT", 
+      "EXTENSION", "FALSE", "FROM", "FORCE", "GLOB", "GRAPH", "GROUP", "HEADERS", 
+      "HINT", "IMPORT", "IF", "IN", "INCREMENT", "INSTALL", "IS", "JOIN", 
+      "KEY", "LIMIT", "LOAD", "LOGICAL", "MACRO", "MATCH", "MAXVALUE", "MERGE", 
+      "MINVALUE", "MULTI_JOIN", "NO", "NODE", "NOT", "NONE", "NULL", "ON", 
+      "ONLY", "OPTIONAL", "OR", "ORDER", "PRIMARY", "PROFILE", "PROJECT", 
+      "READ", "REL", "RENAME", "RETURN", "ROLLBACK", "ROLLBACK_SKIP_CHECKPOINT", 
+      "SEQUENCE", "SET", "SHORTEST", "START", "STARTS", "STRUCT", "TABLE", 
+      "THEN", "TO", "TRAIL", "TRANSACTION", "TRUE", "TYPE", "UNION", "UNWIND", 
+      "UNINSTALL", "UPDATE", "USE", "WHEN", "WHERE", "WITH", "WRITE", "WSHORTEST", 
+      "XOR", "SINGLE", "YIELD", "USER", "PASSWORD", "ROLE", "MAP", "DECIMAL", 
+      "STAR", "L_SKIP", "INVALID_NOT_EQUAL", "COLON", "DOTDOT", "MINUS", 
+      "FACTORIAL", "StringLiteral", "EscapedChar", "DecimalInteger", "HexLetter", 
+      "HexDigit", "Digit", "NonZeroDigit", "NonZeroOctDigit", "ZeroDigit", 
+      "ExponentDecimalReal", "RegularDecimalReal", "UnescapedSymbolicName", 
+      "IdentifierStart", "IdentifierPart", "EscapedSymbolicName", "SP", 
+      "WHITESPACE", "CypherComment", "Unknown"
+    }
+  );
+  static const int32_t serializedATNSegment[] = {
+  	4,1,186,2909,2,0,7,0,2,1,7,1,2,2,7,2,2,3,7,3,2,4,7,4,2,5,7,5,2,6,7,6,
+  	2,7,7,7,2,8,7,8,2,9,7,9,2,10,7,10,2,11,7,11,2,12,7,12,2,13,7,13,2,14,
+  	7,14,2,15,7,15,2,16,7,16,2,17,7,17,2,18,7,18,2,19,7,19,2,20,7,20,2,21,
+  	7,21,2,22,7,22,2,23,7,23,2,24,7,24,2,25,7,25,2,26,7,26,2,27,7,27,2,28,
+  	7,28,2,29,7,29,2,30,7,30,2,31,7,31,2,32,7,32,2,33,7,33,2,34,7,34,2,35,
+  	7,35,2,36,7,36,2,37,7,37,2,38,7,38,2,39,7,39,2,40,7,40,2,41,7,41,2,42,
+  	7,42,2,43,7,43,2,44,7,44,2,45,7,45,2,46,7,46,2,47,7,47,2,48,7,48,2,49,
+  	7,49,2,50,7,50,2,51,7,51,2,52,7,52,2,53,7,53,2,54,7,54,2,55,7,55,2,56,
+  	7,56,2,57,7,57,2,58,7,58,2,59,7,59,2,60,7,60,2,61,7,61,2,62,7,62,2,63,
+  	7,63,2,64,7,64,2,65,7,65,2,66,7,66,2,67,7,67,2,68,7,68,2,69,7,69,2,70,
+  	7,70,2,71,7,71,2,72,7,72,2,73,7,73,2,74,7,74,2,75,7,75,2,76,7,76,2,77,
+  	7,77,2,78,7,78,2,79,7,79,2,80,7,80,2,81,7,81,2,82,7,82,2,83,7,83,2,84,
+  	7,84,2,85,7,85,2,86,7,86,2,87,7,87,2,88,7,88,2,89,7,89,2,90,7,90,2,91,
+  	7,91,2,92,7,92,2,93,7,93,2,94,7,94,2,95,7,95,2,96,7,96,2,97,7,97,2,98,
+  	7,98,2,99,7,99,2,100,7,100,2,101,7,101,2,102,7,102,2,103,7,103,2,104,
+  	7,104,2,105,7,105,2,106,7,106,2,107,7,107,2,108,7,108,2,109,7,109,2,110,
+  	7,110,2,111,7,111,2,112,7,112,2,113,7,113,2,114,7,114,2,115,7,115,2,116,
+  	7,116,2,117,7,117,2,118,7,118,2,119,7,119,2,120,7,120,2,121,7,121,2,122,
+  	7,122,2,123,7,123,2,124,7,124,2,125,7,125,2,126,7,126,2,127,7,127,2,128,
+  	7,128,2,129,7,129,2,130,7,130,2,131,7,131,2,132,7,132,2,133,7,133,2,134,
+  	7,134,2,135,7,135,2,136,7,136,2,137,7,137,2,138,7,138,2,139,7,139,2,140,
+  	7,140,2,141,7,141,2,142,7,142,2,143,7,143,2,144,7,144,2,145,7,145,2,146,
+  	7,146,2,147,7,147,2,148,7,148,2,149,7,149,2,150,7,150,2,151,7,151,2,152,
+  	7,152,2,153,7,153,2,154,7,154,2,155,7,155,2,156,7,156,2,157,7,157,2,158,
+  	7,158,2,159,7,159,2,160,7,160,2,161,7,161,2,162,7,162,2,163,7,163,2,164,
+  	7,164,2,165,7,165,2,166,7,166,2,167,7,167,2,168,7,168,2,169,7,169,2,170,
+  	7,170,2,171,7,171,2,172,7,172,2,173,7,173,2,174,7,174,2,175,7,175,2,176,
+  	7,176,2,177,7,177,2,178,7,178,1,0,1,0,3,0,361,8,0,1,0,1,0,3,0,365,8,0,
+  	1,0,5,0,368,8,0,10,0,12,0,371,9,0,1,0,3,0,374,8,0,1,0,1,0,1,1,3,1,379,
+  	8,1,1,1,3,1,382,8,1,1,1,1,1,3,1,386,8,1,1,1,3,1,389,8,1,1,2,1,2,1,2,1,
+  	2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,
+  	1,2,3,2,413,8,2,1,3,1,3,1,3,1,3,3,3,419,8,3,1,3,1,3,1,3,1,3,1,3,3,3,426,
+  	8,3,1,3,1,3,3,3,430,8,3,1,3,1,3,3,3,434,8,3,1,3,1,3,3,3,438,8,3,1,4,3,
+  	4,441,8,4,1,4,1,4,3,4,445,8,4,1,4,1,4,3,4,449,8,4,1,4,1,4,3,4,453,8,4,
+  	1,4,5,4,456,8,4,10,4,12,4,459,9,4,1,4,3,4,462,8,4,3,4,464,8,4,1,4,1,4,
+  	1,5,1,5,1,5,3,5,471,8,5,1,5,1,5,3,5,475,8,5,1,5,1,5,1,5,1,5,1,5,1,5,1,
+  	5,3,5,484,8,5,1,5,1,5,1,5,3,5,489,8,5,1,6,1,6,1,6,1,6,1,6,1,6,1,6,1,6,
+  	3,6,499,8,6,1,6,1,6,3,6,503,8,6,1,6,1,6,3,6,507,8,6,1,6,5,6,510,8,6,10,
+  	6,12,6,513,9,6,1,6,1,6,1,6,1,6,1,6,1,6,1,7,1,7,1,7,1,7,3,7,525,8,7,1,
+  	7,1,7,3,7,529,8,7,1,7,1,7,1,7,1,7,1,7,1,7,3,7,537,8,7,1,7,1,7,3,7,541,
+  	8,7,1,7,1,7,3,7,545,8,7,1,7,1,7,3,7,549,8,7,1,8,1,8,1,8,1,8,1,8,1,8,3,
+  	8,557,8,8,1,8,1,8,3,8,561,8,8,1,8,1,8,3,8,565,8,8,1,8,1,8,3,8,569,8,8,
+  	1,9,1,9,1,9,1,9,1,9,1,9,1,10,1,10,1,10,1,10,1,10,1,10,1,10,3,10,584,8,
+  	10,1,10,1,10,1,10,3,10,589,8,10,1,10,1,10,1,10,1,10,3,10,595,8,10,1,10,
+  	1,10,3,10,599,8,10,1,10,3,10,602,8,10,1,10,3,10,605,8,10,1,10,1,10,1,
+  	11,1,11,3,11,611,8,11,1,11,1,11,3,11,615,8,11,1,11,5,11,618,8,11,10,11,
+  	12,11,621,9,11,3,11,623,8,11,1,11,1,11,1,11,3,11,628,8,11,1,12,1,12,3,
+  	12,632,8,12,1,12,1,12,3,12,636,8,12,1,12,5,12,639,8,12,10,12,12,12,642,
+  	9,12,1,13,1,13,1,13,1,13,1,14,1,14,1,14,1,14,1,15,1,15,1,15,1,15,3,15,
+  	656,8,15,1,15,1,15,3,15,660,8,15,1,15,1,15,1,15,1,15,1,15,3,15,667,8,
+  	15,1,16,1,16,1,16,1,16,1,16,1,16,1,16,1,16,1,16,1,16,1,16,1,16,1,17,1,
+  	17,1,17,1,17,1,17,1,17,3,17,687,8,17,1,17,1,17,3,17,691,8,17,1,17,3,17,
+  	694,8,17,1,17,3,17,697,8,17,1,17,3,17,700,8,17,1,17,3,17,703,8,17,1,17,
+  	1,17,3,17,707,8,17,1,17,5,17,710,8,17,10,17,12,17,713,9,17,1,17,3,17,
+  	716,8,17,1,17,1,17,1,17,1,17,1,17,1,17,1,18,1,18,3,18,726,8,18,1,18,1,
+  	18,3,18,730,8,18,1,18,5,18,733,8,18,10,18,12,18,736,9,18,1,19,1,19,3,
+  	19,740,8,19,1,19,1,19,1,19,3,19,745,8,19,1,19,1,19,1,20,1,20,3,20,751,
+  	8,20,1,20,1,20,3,20,755,8,20,1,20,1,20,3,20,759,8,20,1,20,5,20,762,8,
+  	20,10,20,12,20,765,9,20,1,20,1,20,1,20,1,20,3,20,771,8,20,1,20,1,20,3,
+  	20,775,8,20,1,20,1,20,3,20,779,8,20,1,20,3,20,782,8,20,1,21,1,21,1,21,
+  	1,21,1,21,1,21,1,22,1,22,1,22,1,22,1,22,1,22,1,22,1,22,1,22,3,22,799,
+  	8,22,1,22,1,22,3,22,803,8,22,1,22,1,22,3,22,807,8,22,1,22,1,22,3,22,811,
+  	8,22,1,22,1,22,3,22,815,8,22,1,22,3,22,818,8,22,1,22,3,22,821,8,22,1,
+  	22,1,22,1,22,1,22,1,22,1,22,3,22,829,8,22,1,23,1,23,1,23,1,23,1,23,1,
+  	23,1,23,3,23,838,8,23,1,23,1,23,3,23,842,8,23,1,23,1,23,1,23,3,23,847,
+  	8,23,1,23,1,23,3,23,851,8,23,1,23,1,23,3,23,855,8,23,1,23,1,23,3,23,859,
+  	8,23,1,23,1,23,3,23,863,8,23,3,23,865,8,23,1,23,1,23,3,23,869,8,23,1,
+  	23,1,23,3,23,873,8,23,3,23,875,8,23,1,23,1,23,1,23,1,23,1,23,1,23,3,23,
+  	883,8,23,1,23,1,23,1,23,3,23,888,8,23,1,23,1,23,3,23,892,8,23,1,23,1,
+  	23,3,23,896,8,23,1,23,1,23,3,23,900,8,23,1,24,1,24,3,24,904,8,24,1,24,
+  	1,24,3,24,908,8,24,1,24,5,24,911,8,24,10,24,12,24,914,9,24,1,25,1,25,
+  	1,25,1,25,1,25,1,25,1,25,1,25,1,26,1,26,1,26,1,26,1,26,1,26,1,26,3,26,
+  	931,8,26,1,26,1,26,1,26,5,26,936,8,26,10,26,12,26,939,9,26,1,27,1,27,
+  	1,27,1,27,1,27,1,27,1,27,1,27,1,27,1,27,3,27,951,8,27,1,28,1,28,1,28,
+  	1,28,1,28,3,28,958,8,28,1,29,1,29,1,29,1,29,1,29,1,29,1,29,1,30,1,30,
+  	1,30,1,30,1,30,1,30,1,30,3,30,974,8,30,1,30,1,30,3,30,978,8,30,1,31,1,
+  	31,1,31,1,31,1,31,1,31,1,31,3,31,987,8,31,1,31,1,31,1,32,1,32,1,32,1,
+  	32,3,32,995,8,32,1,32,3,32,998,8,32,1,32,1,32,1,33,1,33,1,33,1,33,1,33,
+  	1,33,3,33,1008,8,33,1,33,3,33,1011,8,33,1,34,1,34,1,34,1,34,1,34,1,34,
+  	3,34,1019,8,34,1,34,3,34,1022,8,34,1,35,1,35,1,35,1,35,3,35,1028,8,35,
+  	1,35,3,35,1031,8,35,1,35,1,35,1,36,1,36,3,36,1037,8,36,1,36,1,36,1,37,
+  	1,37,1,37,1,37,1,38,1,38,1,38,1,38,1,38,1,38,1,38,3,38,1052,8,38,1,38,
+  	1,38,1,39,1,39,1,39,1,39,1,39,1,39,1,39,1,39,1,40,1,40,1,40,1,40,1,40,
+  	1,40,3,40,1070,8,40,1,41,1,41,1,41,1,41,1,41,3,41,1077,8,41,1,41,1,41,
+  	1,41,1,41,1,41,3,41,1084,8,41,1,42,1,42,1,42,1,42,1,43,1,43,1,43,1,43,
+  	1,43,3,43,1095,8,43,1,43,1,43,1,44,1,44,1,44,1,44,1,44,1,44,1,45,1,45,
+  	1,45,1,45,1,45,1,45,1,45,1,45,1,46,1,46,1,46,1,46,1,46,3,46,1118,8,46,
+  	1,46,1,46,1,47,1,47,1,47,1,47,1,47,3,47,1127,8,47,1,47,1,47,1,48,1,48,
+  	3,48,1133,8,48,1,48,1,48,3,48,1137,8,48,1,48,5,48,1140,8,48,10,48,12,
+  	48,1143,9,48,1,49,1,49,1,49,1,49,1,50,1,50,3,50,1151,8,50,1,50,1,50,3,
+  	50,1155,8,50,1,50,5,50,1158,8,50,10,50,12,50,1161,9,50,1,51,1,51,1,51,
+  	3,51,1166,8,51,1,51,1,51,1,51,1,51,3,51,1172,8,51,1,52,1,52,1,52,1,52,
+  	3,52,1178,8,52,1,52,1,52,3,52,1182,8,52,1,52,1,52,3,52,1186,8,52,1,52,
+  	1,52,1,53,1,53,3,53,1192,8,53,1,53,1,53,3,53,1196,8,53,1,53,1,53,3,53,
+  	1200,8,53,1,53,1,53,1,54,1,54,3,54,1206,8,54,1,54,1,54,3,54,1210,8,54,
+  	1,54,1,54,3,54,1214,8,54,1,54,1,54,1,55,1,55,3,55,1220,8,55,1,55,1,55,
+  	3,55,1224,8,55,1,55,1,55,3,55,1228,8,55,1,55,1,55,3,55,1232,8,55,1,55,
+  	1,55,3,55,1236,8,55,1,55,1,55,1,56,1,56,3,56,1242,8,56,1,56,1,56,3,56,
+  	1246,8,56,1,56,1,56,3,56,1250,8,56,1,56,1,56,3,56,1254,8,56,1,56,1,56,
+  	3,56,1258,8,56,1,56,1,56,1,57,1,57,1,57,1,57,1,57,1,57,3,57,1268,8,57,
+  	1,57,1,57,5,57,1272,8,57,10,57,12,57,1275,9,57,1,58,1,58,5,58,1279,8,
+  	58,10,58,12,58,1282,9,58,1,59,1,59,3,59,1286,8,59,1,59,1,59,1,60,1,60,
+  	3,60,1292,8,60,1,61,1,61,1,61,3,61,1297,8,61,1,62,1,62,1,63,1,63,1,63,
+  	1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,1,63,3,63,1314,8,63,1,64,
+  	1,64,1,64,1,64,3,64,1320,8,64,1,65,1,65,1,65,1,65,3,65,1326,8,65,1,65,
+  	1,65,3,65,1330,8,65,1,66,1,66,3,66,1334,8,66,1,66,1,66,1,66,1,66,1,66,
+  	1,66,1,66,3,66,1343,8,66,1,67,1,67,1,67,1,67,1,68,1,68,1,68,1,68,1,69,
+  	1,69,1,70,1,70,3,70,1357,8,70,1,70,5,70,1360,8,70,10,70,12,70,1363,9,
+  	70,1,70,1,70,3,70,1367,8,70,4,70,1369,8,70,11,70,12,70,1370,1,70,1,70,
+  	1,70,3,70,1376,8,70,1,71,1,71,1,71,1,71,3,71,1382,8,71,1,71,1,71,1,71,
+  	3,71,1387,8,71,1,71,3,71,1390,8,71,1,72,1,72,3,72,1394,8,72,1,73,1,73,
+  	3,73,1398,8,73,5,73,1400,8,73,10,73,12,73,1403,9,73,1,73,1,73,1,73,3,
+  	73,1408,8,73,5,73,1410,8,73,10,73,12,73,1413,9,73,1,73,1,73,3,73,1417,
+  	8,73,1,73,5,73,1420,8,73,10,73,12,73,1423,9,73,1,73,3,73,1426,8,73,1,
+  	73,3,73,1429,8,73,3,73,1431,8,73,1,74,1,74,3,74,1435,8,74,4,74,1437,8,
+  	74,11,74,12,74,1438,1,74,1,74,1,75,1,75,3,75,1445,8,75,5,75,1447,8,75,
+  	10,75,12,75,1450,9,75,1,75,1,75,3,75,1454,8,75,5,75,1456,8,75,10,75,12,
+  	75,1459,9,75,1,75,1,75,1,76,1,76,1,76,1,76,3,76,1467,8,76,1,77,1,77,1,
+  	77,1,77,3,77,1473,8,77,1,78,1,78,1,78,1,78,1,78,1,78,3,78,1481,8,78,1,
+  	78,1,78,3,78,1485,8,78,1,78,1,78,3,78,1489,8,78,1,78,1,78,3,78,1493,8,
+  	78,1,78,1,78,1,78,1,78,1,78,3,78,1500,8,78,1,78,1,78,3,78,1504,8,78,1,
+  	78,1,78,3,78,1508,8,78,1,78,1,78,3,78,1512,8,78,1,78,3,78,1515,8,78,1,
+  	78,3,78,1518,8,78,1,79,1,79,1,79,1,79,1,79,3,79,1525,8,79,1,79,1,79,1,
+  	80,1,80,3,80,1531,8,80,1,80,1,80,3,80,1535,8,80,1,80,5,80,1538,8,80,10,
+  	80,12,80,1541,9,80,1,81,1,81,1,81,1,81,3,81,1547,8,81,1,81,3,81,1550,
+  	8,81,1,81,3,81,1553,8,81,1,81,1,81,1,81,3,81,1558,8,81,1,82,1,82,3,82,
+  	1562,8,82,1,82,1,82,3,82,1566,8,82,1,82,1,82,1,82,3,82,1571,8,82,1,82,
+  	1,82,3,82,1575,8,82,1,83,1,83,1,83,1,83,1,84,1,84,1,84,3,84,1584,8,84,
+  	1,84,1,84,3,84,1588,8,84,1,84,1,84,1,84,3,84,1593,8,84,1,84,1,84,1,84,
+  	1,84,1,84,1,84,1,84,1,84,1,84,1,84,4,84,1605,8,84,11,84,12,84,1606,5,
+  	84,1609,8,84,10,84,12,84,1612,9,84,1,85,1,85,3,85,1616,8,85,1,85,1,85,
+  	1,85,1,85,1,85,1,85,1,86,1,86,3,86,1626,8,86,1,86,1,86,1,87,1,87,3,87,
+  	1632,8,87,1,87,1,87,1,87,5,87,1637,8,87,10,87,12,87,1640,9,87,1,88,1,
+  	88,1,88,1,88,1,88,1,88,1,88,1,88,1,88,1,88,3,88,1652,8,88,1,89,1,89,3,
+  	89,1656,8,89,1,89,1,89,3,89,1660,8,89,1,89,1,89,3,89,1664,8,89,1,89,5,
+  	89,1667,8,89,10,89,12,89,1670,9,89,1,89,1,89,3,89,1674,8,89,1,89,1,89,
+  	3,89,1678,8,89,1,89,1,89,3,89,1682,8,89,1,89,1,89,3,89,1686,8,89,1,90,
+  	1,90,3,90,1690,8,90,1,90,1,90,3,90,1694,8,90,1,90,1,90,1,91,1,91,3,91,
+  	1700,8,91,1,91,1,91,3,91,1704,8,91,1,91,1,91,3,91,1708,8,91,1,91,1,91,
+  	3,91,1712,8,91,1,91,5,91,1715,8,91,10,91,12,91,1718,9,91,1,92,1,92,1,
+  	92,3,92,1723,8,92,1,92,3,92,1726,8,92,1,93,1,93,1,93,1,94,3,94,1732,8,
+  	94,1,94,3,94,1735,8,94,1,94,1,94,1,94,1,94,3,94,1741,8,94,1,94,1,94,3,
+  	94,1745,8,94,1,94,1,94,3,94,1749,8,94,1,95,1,95,3,95,1753,8,95,1,95,1,
+  	95,3,95,1757,8,95,1,95,5,95,1760,8,95,10,95,12,95,1763,9,95,1,95,1,95,
+  	3,95,1767,8,95,1,95,1,95,3,95,1771,8,95,1,95,5,95,1774,8,95,10,95,12,
+  	95,1777,9,95,3,95,1779,8,95,1,96,1,96,1,96,1,96,1,96,1,96,1,96,3,96,1788,
+  	8,96,1,97,1,97,1,97,1,97,1,97,1,97,1,97,3,97,1797,8,97,1,97,5,97,1800,
+  	8,97,10,97,12,97,1803,9,97,1,98,1,98,1,98,1,98,1,99,1,99,1,99,1,99,1,
+  	100,1,100,3,100,1815,8,100,1,100,3,100,1818,8,100,1,101,1,101,1,101,1,
+  	101,1,102,1,102,3,102,1826,8,102,1,102,1,102,3,102,1830,8,102,1,102,5,
+  	102,1833,8,102,10,102,12,102,1836,9,102,1,103,1,103,3,103,1840,8,103,
+  	1,103,1,103,3,103,1844,8,103,1,103,1,103,1,103,3,103,1849,8,103,1,104,
+  	1,104,1,105,1,105,3,105,1855,8,105,1,105,5,105,1858,8,105,10,105,12,105,
+  	1861,9,105,1,105,1,105,1,105,1,105,3,105,1867,8,105,1,106,1,106,3,106,
+  	1871,8,106,1,106,1,106,3,106,1875,8,106,3,106,1877,8,106,1,106,1,106,
+  	3,106,1881,8,106,3,106,1883,8,106,1,106,1,106,3,106,1887,8,106,3,106,
+  	1889,8,106,1,106,1,106,1,107,1,107,3,107,1895,8,107,1,107,1,107,1,108,
+  	1,108,3,108,1901,8,108,1,108,1,108,3,108,1905,8,108,1,108,3,108,1908,
+  	8,108,1,108,3,108,1911,8,108,1,108,1,108,1,108,1,108,3,108,1917,8,108,
+  	1,108,3,108,1920,8,108,1,108,3,108,1923,8,108,1,108,1,108,3,108,1927,
+  	8,108,1,108,1,108,1,108,1,108,3,108,1933,8,108,1,108,3,108,1936,8,108,
+  	1,108,3,108,1939,8,108,1,108,1,108,3,108,1943,8,108,1,109,1,109,3,109,
+  	1947,8,109,1,109,1,109,3,109,1951,8,109,3,109,1953,8,109,1,109,1,109,
+  	3,109,1957,8,109,3,109,1959,8,109,1,109,1,109,3,109,1963,8,109,3,109,
+  	1965,8,109,1,109,1,109,3,109,1969,8,109,3,109,1971,8,109,1,109,1,109,
+  	1,110,1,110,3,110,1977,8,110,1,110,1,110,3,110,1981,8,110,1,110,1,110,
+  	3,110,1985,8,110,1,110,1,110,3,110,1989,8,110,1,110,1,110,3,110,1993,
+  	8,110,1,110,1,110,3,110,1997,8,110,1,110,1,110,3,110,2001,8,110,1,110,
+  	1,110,3,110,2005,8,110,5,110,2007,8,110,10,110,12,110,2010,9,110,3,110,
+  	2012,8,110,1,110,1,110,1,111,1,111,3,111,2018,8,111,1,111,1,111,3,111,
+  	2022,8,111,1,111,1,111,3,111,2026,8,111,1,111,3,111,2029,8,111,1,111,
+  	5,111,2032,8,111,10,111,12,111,2035,9,111,1,112,1,112,3,112,2039,8,112,
+  	1,112,1,112,3,112,2043,8,112,1,112,1,112,3,112,2047,8,112,1,112,3,112,
+  	2050,8,112,1,112,3,112,2053,8,112,1,112,5,112,2056,8,112,10,112,12,112,
+  	2059,9,112,1,113,1,113,3,113,2063,8,113,1,113,3,113,2066,8,113,1,113,
+  	3,113,2069,8,113,1,113,3,113,2072,8,113,1,113,3,113,2075,8,113,1,113,
+  	3,113,2078,8,113,1,114,1,114,3,114,2082,8,114,1,114,1,114,3,114,2086,
+  	8,114,1,114,1,114,3,114,2090,8,114,1,114,1,114,3,114,2094,8,114,1,114,
+  	1,114,1,114,1,114,1,114,1,114,1,114,1,114,3,114,2104,8,114,1,115,3,115,
+  	2107,8,115,1,115,3,115,2110,8,115,1,115,1,115,3,115,2114,8,115,1,115,
+  	3,115,2117,8,115,1,115,3,115,2120,8,115,1,116,1,116,3,116,2124,8,116,
+  	1,116,1,116,3,116,2128,8,116,1,116,1,116,3,116,2132,8,116,1,116,1,116,
+  	3,116,2136,8,116,1,116,1,116,3,116,2140,8,116,1,116,1,116,3,116,2144,
+  	8,116,3,116,2146,8,116,1,116,3,116,2149,8,116,1,116,1,116,3,116,2153,
+  	8,116,1,116,1,116,3,116,2157,8,116,1,116,1,116,3,116,2161,8,116,1,116,
+  	1,116,3,116,2165,8,116,3,116,2167,8,116,1,116,1,116,1,117,1,117,3,117,
+  	2173,8,117,1,117,3,117,2176,8,117,1,117,3,117,2179,8,117,1,117,1,117,
+  	1,118,1,118,1,119,1,119,1,120,1,120,1,121,1,121,1,122,1,122,1,123,1,123,
+  	1,123,1,123,1,123,5,123,2198,8,123,10,123,12,123,2201,9,123,1,124,1,124,
+  	1,124,1,124,1,124,5,124,2208,8,124,10,124,12,124,2211,9,124,1,125,1,125,
+  	1,125,1,125,1,125,5,125,2218,8,125,10,125,12,125,2221,9,125,1,126,1,126,
+  	3,126,2225,8,126,5,126,2227,8,126,10,126,12,126,2230,9,126,1,126,1,126,
+  	1,127,1,127,3,127,2236,8,127,1,127,1,127,3,127,2240,8,127,1,127,1,127,
+  	3,127,2244,8,127,1,127,1,127,3,127,2248,8,127,1,127,1,127,3,127,2252,
+  	8,127,1,127,1,127,1,127,1,127,1,127,1,127,3,127,2260,8,127,1,127,1,127,
+  	3,127,2264,8,127,1,127,1,127,3,127,2268,8,127,1,127,1,127,3,127,2272,
+  	8,127,1,127,1,127,4,127,2276,8,127,11,127,12,127,2277,1,127,1,127,3,127,
+  	2282,8,127,1,128,1,128,1,129,1,129,3,129,2288,8,129,1,129,1,129,3,129,
+  	2292,8,129,1,129,5,129,2295,8,129,10,129,12,129,2298,9,129,1,130,1,130,
+  	3,130,2302,8,130,1,130,1,130,3,130,2306,8,130,1,130,5,130,2309,8,130,
+  	10,130,12,130,2312,9,130,1,131,1,131,3,131,2316,8,131,1,131,1,131,3,131,
+  	2320,8,131,1,131,1,131,5,131,2324,8,131,10,131,12,131,2327,9,131,1,132,
+  	1,132,1,133,1,133,3,133,2333,8,133,1,133,1,133,3,133,2337,8,133,1,133,
+  	1,133,5,133,2341,8,133,10,133,12,133,2344,9,133,1,134,1,134,1,135,1,135,
+  	3,135,2350,8,135,1,135,1,135,3,135,2354,8,135,1,135,1,135,5,135,2358,
+  	8,135,10,135,12,135,2361,9,135,1,136,1,136,1,137,1,137,3,137,2367,8,137,
+  	1,137,1,137,3,137,2371,8,137,1,137,5,137,2374,8,137,10,137,12,137,2377,
+  	9,137,1,138,1,138,1,138,4,138,2382,8,138,11,138,12,138,2383,1,138,3,138,
+  	2387,8,138,1,139,1,139,1,139,3,139,2392,8,139,1,139,1,139,1,139,1,139,
+  	1,139,1,139,1,139,3,139,2401,8,139,1,139,1,139,3,139,2405,8,139,1,139,
+  	3,139,2408,8,139,1,140,1,140,1,140,1,140,1,140,1,140,1,140,1,140,1,140,
+  	1,140,1,140,3,140,2421,8,140,1,140,3,140,2424,8,140,1,140,1,140,1,141,
+  	3,141,2429,8,141,1,141,1,141,1,142,1,142,1,142,1,142,1,142,1,142,1,142,
+  	1,142,1,142,1,142,3,142,2443,8,142,1,143,1,143,3,143,2447,8,143,5,143,
+  	2449,8,143,10,143,12,143,2452,9,143,1,143,1,143,3,143,2456,8,143,1,143,
+  	3,143,2459,8,143,1,144,1,144,3,144,2463,8,144,1,144,5,144,2466,8,144,
+  	10,144,12,144,2469,9,144,1,145,1,145,1,145,1,145,1,145,1,145,1,145,1,
+  	145,1,145,3,145,2480,8,145,1,146,1,146,3,146,2484,8,146,1,146,1,146,3,
+  	146,2488,8,146,1,146,1,146,3,146,2492,8,146,1,146,1,146,1,146,1,146,3,
+  	146,2498,8,146,1,146,1,146,3,146,2502,8,146,1,146,1,146,3,146,2506,8,
+  	146,1,146,1,146,1,146,1,146,3,146,2512,8,146,1,146,1,146,3,146,2516,8,
+  	146,1,146,1,146,3,146,2520,8,146,1,146,1,146,1,146,1,146,3,146,2526,8,
+  	146,1,146,1,146,3,146,2530,8,146,1,146,1,146,3,146,2534,8,146,1,146,1,
+  	146,3,146,2538,8,146,1,147,1,147,1,147,1,147,1,148,1,148,1,148,1,148,
+  	1,148,1,148,1,149,1,149,1,149,1,149,1,149,1,149,3,149,2556,8,149,1,150,
+  	1,150,1,151,1,151,3,151,2562,8,151,1,151,1,151,3,151,2566,8,151,1,151,
+  	1,151,3,151,2570,8,151,5,151,2572,8,151,10,151,12,151,2575,9,151,3,151,
+  	2577,8,151,1,151,1,151,1,152,1,152,3,152,2583,8,152,1,152,3,152,2586,
+  	8,152,1,153,1,153,3,153,2590,8,153,1,153,1,153,3,153,2594,8,153,1,153,
+  	1,153,3,153,2598,8,153,1,153,1,153,3,153,2602,8,153,5,153,2604,8,153,
+  	10,153,12,153,2607,9,153,1,153,1,153,1,154,1,154,3,154,2613,8,154,1,154,
+  	3,154,2616,8,154,1,154,1,154,3,154,2620,8,154,1,154,1,154,1,155,1,155,
+  	3,155,2626,8,155,1,155,1,155,3,155,2630,8,155,1,155,1,155,1,156,1,156,
+  	3,156,2636,8,156,1,156,1,156,3,156,2640,8,156,1,156,1,156,3,156,2644,
+  	8,156,1,156,1,156,1,156,3,156,2649,8,156,1,156,1,156,3,156,2653,8,156,
+  	1,156,1,156,3,156,2657,8,156,1,156,1,156,3,156,2661,8,156,1,156,1,156,
+  	1,156,3,156,2666,8,156,1,156,3,156,2669,8,156,1,156,3,156,2672,8,156,
+  	1,156,1,156,1,156,1,156,3,156,2678,8,156,1,156,1,156,3,156,2682,8,156,
+  	1,156,1,156,3,156,2686,8,156,3,156,2688,8,156,1,156,1,156,3,156,2692,
+  	8,156,1,156,1,156,3,156,2696,8,156,1,156,1,156,3,156,2700,8,156,5,156,
+  	2702,8,156,10,156,12,156,2705,9,156,3,156,2707,8,156,1,156,1,156,3,156,
+  	2711,8,156,1,157,1,157,1,158,1,158,3,158,2717,8,158,1,158,1,158,1,158,
+  	3,158,2722,8,158,3,158,2724,8,158,1,158,1,158,3,158,2728,8,158,1,159,
+  	1,159,3,159,2732,8,159,1,159,1,159,1,159,3,159,2737,8,159,1,159,1,159,
+  	3,159,2741,8,159,1,160,1,160,1,160,3,160,2746,8,160,1,160,1,160,3,160,
+  	2750,8,160,1,160,1,160,3,160,2754,8,160,1,160,1,160,3,160,2758,8,160,
+  	5,160,2760,8,160,10,160,12,160,2763,9,160,1,160,1,160,3,160,2767,8,160,
+  	1,161,1,161,3,161,2771,8,161,1,161,4,161,2774,8,161,11,161,12,161,2775,
+  	1,162,1,162,3,162,2780,8,162,1,162,1,162,3,162,2784,8,162,1,162,1,162,
+  	3,162,2788,8,162,1,162,1,162,3,162,2792,8,162,1,162,3,162,2795,8,162,
+  	1,162,3,162,2798,8,162,1,162,3,162,2801,8,162,1,162,3,162,2804,8,162,
+  	1,162,1,162,1,163,1,163,3,163,2810,8,163,1,163,1,163,3,163,2814,8,163,
+  	1,164,1,164,3,164,2818,8,164,1,164,4,164,2821,8,164,11,164,12,164,2822,
+  	1,164,1,164,3,164,2827,8,164,1,164,1,164,3,164,2831,8,164,1,164,4,164,
+  	2834,8,164,11,164,12,164,2835,3,164,2838,8,164,1,164,3,164,2841,8,164,
+  	1,164,1,164,3,164,2845,8,164,1,164,3,164,2848,8,164,1,164,3,164,2851,
+  	8,164,1,164,1,164,1,165,1,165,3,165,2857,8,165,1,165,1,165,3,165,2861,
+  	8,165,1,165,1,165,3,165,2865,8,165,1,165,1,165,1,166,1,166,1,167,1,167,
+  	3,167,2873,8,167,1,168,1,168,1,168,3,168,2878,8,168,1,169,1,169,3,169,
+  	2882,8,169,1,169,1,169,1,170,1,170,1,171,1,171,1,172,1,172,1,173,1,173,
+  	1,174,1,174,1,174,1,174,1,174,3,174,2899,8,174,1,175,1,175,1,176,1,176,
+  	1,177,1,177,1,178,1,178,1,178,0,2,114,168,179,0,2,4,6,8,10,12,14,16,18,
+  	20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,56,58,60,62,64,
+  	66,68,70,72,74,76,78,80,82,84,86,88,90,92,94,96,98,100,102,104,106,108,
+  	110,112,114,116,118,120,122,124,126,128,130,132,134,136,138,140,142,144,
+  	146,148,150,152,154,156,158,160,162,164,166,168,170,172,174,176,178,180,
+  	182,184,186,188,190,192,194,196,198,200,202,204,206,208,210,212,214,216,
+  	218,220,222,224,226,228,230,232,234,236,238,240,242,244,246,248,250,252,
+  	254,256,258,260,262,264,266,268,270,272,274,276,278,280,282,284,286,288,
+  	290,292,294,296,298,300,302,304,306,308,310,312,314,316,318,320,322,324,
+  	326,328,330,332,334,336,338,340,342,344,346,348,350,352,354,356,0,14,
+  	3,0,105,105,130,130,136,136,2,0,52,53,74,75,2,0,6,6,12,16,1,0,18,19,2,
+  	0,20,20,166,166,2,0,21,22,161,161,1,0,164,165,2,0,86,86,141,141,2,0,67,
+  	67,82,82,1,0,177,178,31,0,47,47,49,49,51,51,54,57,60,60,62,63,65,67,69,
+  	70,73,73,76,76,78,78,83,85,87,88,90,90,94,95,97,97,99,99,101,104,106,
+  	109,111,112,123,128,130,131,133,133,135,135,138,138,140,140,142,142,145,
+  	147,151,151,155,160,162,162,2,0,13,13,26,29,2,0,15,15,30,33,2,0,34,44,
+  	166,166,3294,0,358,1,0,0,0,2,378,1,0,0,0,4,412,1,0,0,0,6,414,1,0,0,0,
+  	8,440,1,0,0,0,10,488,1,0,0,0,12,490,1,0,0,0,14,520,1,0,0,0,16,550,1,0,
+  	0,0,18,570,1,0,0,0,20,576,1,0,0,0,22,627,1,0,0,0,24,629,1,0,0,0,26,643,
+  	1,0,0,0,28,647,1,0,0,0,30,666,1,0,0,0,32,668,1,0,0,0,34,680,1,0,0,0,36,
+  	723,1,0,0,0,38,737,1,0,0,0,40,781,1,0,0,0,42,783,1,0,0,0,44,789,1,0,0,
+  	0,46,830,1,0,0,0,48,901,1,0,0,0,50,915,1,0,0,0,52,923,1,0,0,0,54,940,
+  	1,0,0,0,56,957,1,0,0,0,58,959,1,0,0,0,60,966,1,0,0,0,62,979,1,0,0,0,64,
+  	990,1,0,0,0,66,1010,1,0,0,0,68,1021,1,0,0,0,70,1023,1,0,0,0,72,1036,1,
+  	0,0,0,74,1040,1,0,0,0,76,1044,1,0,0,0,78,1055,1,0,0,0,80,1069,1,0,0,0,
+  	82,1071,1,0,0,0,84,1085,1,0,0,0,86,1089,1,0,0,0,88,1098,1,0,0,0,90,1104,
+  	1,0,0,0,92,1112,1,0,0,0,94,1121,1,0,0,0,96,1130,1,0,0,0,98,1144,1,0,0,
+  	0,100,1148,1,0,0,0,102,1162,1,0,0,0,104,1173,1,0,0,0,106,1189,1,0,0,0,
+  	108,1203,1,0,0,0,110,1217,1,0,0,0,112,1239,1,0,0,0,114,1267,1,0,0,0,116,
+  	1276,1,0,0,0,118,1283,1,0,0,0,120,1291,1,0,0,0,122,1293,1,0,0,0,124,1298,
+  	1,0,0,0,126,1313,1,0,0,0,128,1319,1,0,0,0,130,1321,1,0,0,0,132,1333,1,
+  	0,0,0,134,1344,1,0,0,0,136,1348,1,0,0,0,138,1352,1,0,0,0,140,1375,1,0,
+  	0,0,142,1389,1,0,0,0,144,1393,1,0,0,0,146,1430,1,0,0,0,148,1436,1,0,0,
+  	0,150,1448,1,0,0,0,152,1466,1,0,0,0,154,1472,1,0,0,0,156,1474,1,0,0,0,
+  	158,1524,1,0,0,0,160,1528,1,0,0,0,162,1542,1,0,0,0,164,1561,1,0,0,0,166,
+  	1576,1,0,0,0,168,1592,1,0,0,0,170,1613,1,0,0,0,172,1623,1,0,0,0,174,1629,
+  	1,0,0,0,176,1651,1,0,0,0,178,1685,1,0,0,0,180,1687,1,0,0,0,182,1699,1,
+  	0,0,0,184,1719,1,0,0,0,186,1727,1,0,0,0,188,1734,1,0,0,0,190,1778,1,0,
+  	0,0,192,1787,1,0,0,0,194,1789,1,0,0,0,196,1804,1,0,0,0,198,1808,1,0,0,
+  	0,200,1812,1,0,0,0,202,1819,1,0,0,0,204,1823,1,0,0,0,206,1848,1,0,0,0,
+  	208,1850,1,0,0,0,210,1866,1,0,0,0,212,1868,1,0,0,0,214,1892,1,0,0,0,216,
+  	1942,1,0,0,0,218,1944,1,0,0,0,220,1974,1,0,0,0,222,2015,1,0,0,0,224,2036,
+  	1,0,0,0,226,2060,1,0,0,0,228,2103,1,0,0,0,230,2119,1,0,0,0,232,2121,1,
+  	0,0,0,234,2170,1,0,0,0,236,2182,1,0,0,0,238,2184,1,0,0,0,240,2186,1,0,
+  	0,0,242,2188,1,0,0,0,244,2190,1,0,0,0,246,2192,1,0,0,0,248,2202,1,0,0,
+  	0,250,2212,1,0,0,0,252,2228,1,0,0,0,254,2281,1,0,0,0,256,2283,1,0,0,0,
+  	258,2285,1,0,0,0,260,2299,1,0,0,0,262,2313,1,0,0,0,264,2328,1,0,0,0,266,
+  	2330,1,0,0,0,268,2345,1,0,0,0,270,2347,1,0,0,0,272,2362,1,0,0,0,274,2364,
+  	1,0,0,0,276,2378,1,0,0,0,278,2407,1,0,0,0,280,2420,1,0,0,0,282,2428,1,
+  	0,0,0,284,2442,1,0,0,0,286,2450,1,0,0,0,288,2460,1,0,0,0,290,2479,1,0,
+  	0,0,292,2537,1,0,0,0,294,2539,1,0,0,0,296,2543,1,0,0,0,298,2555,1,0,0,
+  	0,300,2557,1,0,0,0,302,2559,1,0,0,0,304,2580,1,0,0,0,306,2587,1,0,0,0,
+  	308,2612,1,0,0,0,310,2623,1,0,0,0,312,2710,1,0,0,0,314,2712,1,0,0,0,316,
+  	2727,1,0,0,0,318,2729,1,0,0,0,320,2766,1,0,0,0,322,2768,1,0,0,0,324,2777,
+  	1,0,0,0,326,2807,1,0,0,0,328,2837,1,0,0,0,330,2854,1,0,0,0,332,2868,1,
+  	0,0,0,334,2872,1,0,0,0,336,2874,1,0,0,0,338,2879,1,0,0,0,340,2885,1,0,
+  	0,0,342,2887,1,0,0,0,344,2889,1,0,0,0,346,2891,1,0,0,0,348,2898,1,0,0,
+  	0,350,2900,1,0,0,0,352,2902,1,0,0,0,354,2904,1,0,0,0,356,2906,1,0,0,0,
+  	358,369,3,2,1,0,359,361,5,183,0,0,360,359,1,0,0,0,360,361,1,0,0,0,361,
+  	362,1,0,0,0,362,364,5,1,0,0,363,365,5,183,0,0,364,363,1,0,0,0,364,365,
+  	1,0,0,0,365,366,1,0,0,0,366,368,3,2,1,0,367,360,1,0,0,0,368,371,1,0,0,
+  	0,369,367,1,0,0,0,369,370,1,0,0,0,370,373,1,0,0,0,371,369,1,0,0,0,372,
+  	374,5,183,0,0,373,372,1,0,0,0,373,374,1,0,0,0,374,375,1,0,0,0,375,376,
+  	5,0,0,1,376,1,1,0,0,0,377,379,3,120,60,0,378,377,1,0,0,0,378,379,1,0,
+  	0,0,379,381,1,0,0,0,380,382,5,183,0,0,381,380,1,0,0,0,381,382,1,0,0,0,
+  	382,383,1,0,0,0,383,388,3,4,2,0,384,386,5,183,0,0,385,384,1,0,0,0,385,
+  	386,1,0,0,0,386,387,1,0,0,0,387,389,5,1,0,0,388,385,1,0,0,0,388,389,1,
+  	0,0,0,389,3,1,0,0,0,390,413,3,138,69,0,391,413,3,60,30,0,392,413,3,62,
+  	31,0,393,413,3,44,22,0,394,413,3,46,23,0,395,413,3,52,26,0,396,413,3,
+  	54,27,0,397,413,3,76,38,0,398,413,3,78,39,0,399,413,3,6,3,0,400,413,3,
+  	12,6,0,401,413,3,14,7,0,402,413,3,30,15,0,403,413,3,34,17,0,404,413,3,
+  	32,16,0,405,413,3,126,63,0,406,413,3,128,64,0,407,413,3,16,8,0,408,413,
+  	3,18,9,0,409,413,3,20,10,0,410,413,3,26,13,0,411,413,3,28,14,0,412,390,
+  	1,0,0,0,412,391,1,0,0,0,412,392,1,0,0,0,412,393,1,0,0,0,412,394,1,0,0,
+  	0,412,395,1,0,0,0,412,396,1,0,0,0,412,397,1,0,0,0,412,398,1,0,0,0,412,
+  	399,1,0,0,0,412,400,1,0,0,0,412,401,1,0,0,0,412,402,1,0,0,0,412,403,1,
+  	0,0,0,412,404,1,0,0,0,412,405,1,0,0,0,412,406,1,0,0,0,412,407,1,0,0,0,
+  	412,408,1,0,0,0,412,409,1,0,0,0,412,410,1,0,0,0,412,411,1,0,0,0,413,5,
+  	1,0,0,0,414,415,5,66,0,0,415,416,5,183,0,0,416,418,3,346,173,0,417,419,
+  	3,8,4,0,418,417,1,0,0,0,418,419,1,0,0,0,419,420,1,0,0,0,420,421,5,183,
+  	0,0,421,422,5,87,0,0,422,423,5,183,0,0,423,437,3,10,5,0,424,426,5,183,
+  	0,0,425,424,1,0,0,0,425,426,1,0,0,0,426,427,1,0,0,0,427,429,5,2,0,0,428,
+  	430,5,183,0,0,429,428,1,0,0,0,429,430,1,0,0,0,430,431,1,0,0,0,431,433,
+  	3,24,12,0,432,434,5,183,0,0,433,432,1,0,0,0,433,434,1,0,0,0,434,435,1,
+  	0,0,0,435,436,5,3,0,0,436,438,1,0,0,0,437,425,1,0,0,0,437,438,1,0,0,0,
+  	438,7,1,0,0,0,439,441,5,183,0,0,440,439,1,0,0,0,440,441,1,0,0,0,441,442,
+  	1,0,0,0,442,444,5,2,0,0,443,445,5,183,0,0,444,443,1,0,0,0,444,445,1,0,
+  	0,0,445,463,1,0,0,0,446,457,3,346,173,0,447,449,5,183,0,0,448,447,1,0,
+  	0,0,448,449,1,0,0,0,449,450,1,0,0,0,450,452,5,4,0,0,451,453,5,183,0,0,
+  	452,451,1,0,0,0,452,453,1,0,0,0,453,454,1,0,0,0,454,456,3,346,173,0,455,
+  	448,1,0,0,0,456,459,1,0,0,0,457,455,1,0,0,0,457,458,1,0,0,0,458,461,1,
+  	0,0,0,459,457,1,0,0,0,460,462,5,183,0,0,461,460,1,0,0,0,461,462,1,0,0,
+  	0,462,464,1,0,0,0,463,446,1,0,0,0,463,464,1,0,0,0,464,465,1,0,0,0,465,
+  	466,5,3,0,0,466,9,1,0,0,0,467,489,3,40,20,0,468,470,5,2,0,0,469,471,5,
+  	183,0,0,470,469,1,0,0,0,470,471,1,0,0,0,471,472,1,0,0,0,472,474,3,138,
+  	69,0,473,475,5,183,0,0,474,473,1,0,0,0,474,475,1,0,0,0,475,476,1,0,0,
+  	0,476,477,5,3,0,0,477,489,1,0,0,0,478,489,3,336,168,0,479,489,3,332,166,
+  	0,480,481,3,332,166,0,481,483,5,5,0,0,482,484,5,183,0,0,483,482,1,0,0,
+  	0,483,484,1,0,0,0,484,485,1,0,0,0,485,486,3,346,173,0,486,489,1,0,0,0,
+  	487,489,3,312,156,0,488,467,1,0,0,0,488,468,1,0,0,0,488,478,1,0,0,0,488,
+  	479,1,0,0,0,488,480,1,0,0,0,488,487,1,0,0,0,489,11,1,0,0,0,490,491,5,
+  	66,0,0,491,492,5,183,0,0,492,493,3,346,173,0,493,494,5,183,0,0,494,495,
+  	5,87,0,0,495,496,5,183,0,0,496,498,5,2,0,0,497,499,5,183,0,0,498,497,
+  	1,0,0,0,498,499,1,0,0,0,499,500,1,0,0,0,500,511,5,168,0,0,501,503,5,183,
+  	0,0,502,501,1,0,0,0,502,503,1,0,0,0,503,504,1,0,0,0,504,506,5,4,0,0,505,
+  	507,5,183,0,0,506,505,1,0,0,0,506,507,1,0,0,0,507,508,1,0,0,0,508,510,
+  	5,168,0,0,509,502,1,0,0,0,510,513,1,0,0,0,511,509,1,0,0,0,511,512,1,0,
+  	0,0,512,514,1,0,0,0,513,511,1,0,0,0,514,515,5,3,0,0,515,516,5,183,0,0,
+  	516,517,5,56,0,0,517,518,5,183,0,0,518,519,5,61,0,0,519,13,1,0,0,0,520,
+  	521,5,66,0,0,521,522,5,183,0,0,522,524,5,2,0,0,523,525,5,183,0,0,524,
+  	523,1,0,0,0,524,525,1,0,0,0,525,526,1,0,0,0,526,528,3,138,69,0,527,529,
+  	5,183,0,0,528,527,1,0,0,0,528,529,1,0,0,0,529,530,1,0,0,0,530,531,5,3,
+  	0,0,531,532,5,183,0,0,532,533,5,138,0,0,533,534,5,183,0,0,534,548,5,168,
+  	0,0,535,537,5,183,0,0,536,535,1,0,0,0,536,537,1,0,0,0,537,538,1,0,0,0,
+  	538,540,5,2,0,0,539,541,5,183,0,0,540,539,1,0,0,0,540,541,1,0,0,0,541,
+  	542,1,0,0,0,542,544,3,24,12,0,543,545,5,183,0,0,544,543,1,0,0,0,544,545,
+  	1,0,0,0,545,546,1,0,0,0,546,547,5,3,0,0,547,549,1,0,0,0,548,536,1,0,0,
+  	0,548,549,1,0,0,0,549,15,1,0,0,0,550,551,5,84,0,0,551,552,5,183,0,0,552,
+  	553,5,70,0,0,553,554,5,183,0,0,554,568,5,168,0,0,555,557,5,183,0,0,556,
+  	555,1,0,0,0,556,557,1,0,0,0,557,558,1,0,0,0,558,560,5,2,0,0,559,561,5,
+  	183,0,0,560,559,1,0,0,0,560,561,1,0,0,0,561,562,1,0,0,0,562,564,3,24,
+  	12,0,563,565,5,183,0,0,564,563,1,0,0,0,564,565,1,0,0,0,565,566,1,0,0,
+  	0,566,567,5,3,0,0,567,569,1,0,0,0,568,556,1,0,0,0,568,569,1,0,0,0,569,
+  	17,1,0,0,0,570,571,5,94,0,0,571,572,5,183,0,0,572,573,5,70,0,0,573,574,
+  	5,183,0,0,574,575,5,168,0,0,575,19,1,0,0,0,576,577,5,54,0,0,577,578,5,
+  	183,0,0,578,583,5,168,0,0,579,580,5,183,0,0,580,581,5,51,0,0,581,582,
+  	5,183,0,0,582,584,3,346,173,0,583,579,1,0,0,0,583,584,1,0,0,0,584,585,
+  	1,0,0,0,585,586,5,183,0,0,586,588,5,2,0,0,587,589,5,183,0,0,588,587,1,
+  	0,0,0,588,589,1,0,0,0,589,590,1,0,0,0,590,591,5,71,0,0,591,592,5,183,
+  	0,0,592,601,3,348,174,0,593,595,5,183,0,0,594,593,1,0,0,0,594,595,1,0,
+  	0,0,595,596,1,0,0,0,596,598,5,4,0,0,597,599,5,183,0,0,598,597,1,0,0,0,
+  	598,599,1,0,0,0,599,600,1,0,0,0,600,602,3,24,12,0,601,594,1,0,0,0,601,
+  	602,1,0,0,0,602,604,1,0,0,0,603,605,5,183,0,0,604,603,1,0,0,0,604,605,
+  	1,0,0,0,605,606,1,0,0,0,606,607,5,3,0,0,607,21,1,0,0,0,608,622,3,348,
+  	174,0,609,611,5,183,0,0,610,609,1,0,0,0,610,611,1,0,0,0,611,612,1,0,0,
+  	0,612,614,5,6,0,0,613,615,5,183,0,0,614,613,1,0,0,0,614,615,1,0,0,0,615,
+  	623,1,0,0,0,616,618,5,183,0,0,617,616,1,0,0,0,618,621,1,0,0,0,619,617,
+  	1,0,0,0,619,620,1,0,0,0,620,623,1,0,0,0,621,619,1,0,0,0,622,610,1,0,0,
+  	0,622,619,1,0,0,0,623,624,1,0,0,0,624,625,3,298,149,0,625,628,1,0,0,0,
+  	626,628,3,348,174,0,627,608,1,0,0,0,627,626,1,0,0,0,628,23,1,0,0,0,629,
+  	640,3,22,11,0,630,632,5,183,0,0,631,630,1,0,0,0,631,632,1,0,0,0,632,633,
+  	1,0,0,0,633,635,5,4,0,0,634,636,5,183,0,0,635,634,1,0,0,0,635,636,1,0,
+  	0,0,636,637,1,0,0,0,637,639,3,22,11,0,638,631,1,0,0,0,639,642,1,0,0,0,
+  	640,638,1,0,0,0,640,641,1,0,0,0,641,25,1,0,0,0,642,640,1,0,0,0,643,644,
+  	5,76,0,0,644,645,5,183,0,0,645,646,3,346,173,0,646,27,1,0,0,0,647,648,
+  	5,147,0,0,648,649,5,183,0,0,649,650,3,346,173,0,650,29,1,0,0,0,651,652,
+  	5,57,0,0,652,653,5,183,0,0,653,655,3,348,174,0,654,656,5,183,0,0,655,
+  	654,1,0,0,0,655,656,1,0,0,0,656,657,1,0,0,0,657,659,5,6,0,0,658,660,5,
+  	183,0,0,659,658,1,0,0,0,659,660,1,0,0,0,660,661,1,0,0,0,661,662,3,244,
+  	122,0,662,667,1,0,0,0,663,664,5,57,0,0,664,665,5,183,0,0,665,667,3,312,
+  	156,0,666,651,1,0,0,0,666,663,1,0,0,0,667,31,1,0,0,0,668,669,5,62,0,0,
+  	669,670,5,183,0,0,670,671,5,116,0,0,671,672,5,183,0,0,672,673,5,136,0,
+  	0,673,674,5,183,0,0,674,675,3,346,173,0,675,676,5,183,0,0,676,677,5,99,
+  	0,0,677,678,5,183,0,0,678,679,5,168,0,0,679,33,1,0,0,0,680,681,5,68,0,
+  	0,681,682,5,183,0,0,682,683,5,105,0,0,683,684,5,183,0,0,684,686,3,314,
+  	157,0,685,687,5,183,0,0,686,685,1,0,0,0,686,687,1,0,0,0,687,688,1,0,0,
+  	0,688,690,5,2,0,0,689,691,5,183,0,0,690,689,1,0,0,0,690,691,1,0,0,0,691,
+  	693,1,0,0,0,692,694,3,36,18,0,693,692,1,0,0,0,693,694,1,0,0,0,694,696,
+  	1,0,0,0,695,697,5,183,0,0,696,695,1,0,0,0,696,697,1,0,0,0,697,699,1,0,
+  	0,0,698,700,3,38,19,0,699,698,1,0,0,0,699,700,1,0,0,0,700,711,1,0,0,0,
+  	701,703,5,183,0,0,702,701,1,0,0,0,702,703,1,0,0,0,703,704,1,0,0,0,704,
+  	706,5,4,0,0,705,707,5,183,0,0,706,705,1,0,0,0,706,707,1,0,0,0,707,708,
+  	1,0,0,0,708,710,3,38,19,0,709,702,1,0,0,0,710,713,1,0,0,0,711,709,1,0,
+  	0,0,711,712,1,0,0,0,712,715,1,0,0,0,713,711,1,0,0,0,714,716,5,183,0,0,
+  	715,714,1,0,0,0,715,716,1,0,0,0,716,717,1,0,0,0,717,718,5,3,0,0,718,719,
+  	5,183,0,0,719,720,5,51,0,0,720,721,5,183,0,0,721,722,3,244,122,0,722,
+  	35,1,0,0,0,723,734,3,348,174,0,724,726,5,183,0,0,725,724,1,0,0,0,725,
+  	726,1,0,0,0,726,727,1,0,0,0,727,729,5,4,0,0,728,730,5,183,0,0,729,728,
+  	1,0,0,0,729,730,1,0,0,0,730,731,1,0,0,0,731,733,3,348,174,0,732,725,1,
+  	0,0,0,733,736,1,0,0,0,734,732,1,0,0,0,734,735,1,0,0,0,735,37,1,0,0,0,
+  	736,734,1,0,0,0,737,739,3,348,174,0,738,740,5,183,0,0,739,738,1,0,0,0,
+  	739,740,1,0,0,0,740,741,1,0,0,0,741,742,5,164,0,0,742,744,5,6,0,0,743,
+  	745,5,183,0,0,744,743,1,0,0,0,744,745,1,0,0,0,745,746,1,0,0,0,746,747,
+  	3,298,149,0,747,39,1,0,0,0,748,750,5,7,0,0,749,751,5,183,0,0,750,749,
+  	1,0,0,0,750,751,1,0,0,0,751,752,1,0,0,0,752,763,5,168,0,0,753,755,5,183,
+  	0,0,754,753,1,0,0,0,754,755,1,0,0,0,755,756,1,0,0,0,756,758,5,4,0,0,757,
+  	759,5,183,0,0,758,757,1,0,0,0,758,759,1,0,0,0,759,760,1,0,0,0,760,762,
+  	5,168,0,0,761,754,1,0,0,0,762,765,1,0,0,0,763,761,1,0,0,0,763,764,1,0,
+  	0,0,764,766,1,0,0,0,765,763,1,0,0,0,766,782,5,8,0,0,767,782,5,168,0,0,
+  	768,770,5,89,0,0,769,771,5,183,0,0,770,769,1,0,0,0,770,771,1,0,0,0,771,
+  	772,1,0,0,0,772,774,5,2,0,0,773,775,5,183,0,0,774,773,1,0,0,0,774,775,
+  	1,0,0,0,775,776,1,0,0,0,776,778,5,168,0,0,777,779,5,183,0,0,778,777,1,
+  	0,0,0,778,779,1,0,0,0,779,780,1,0,0,0,780,782,5,3,0,0,781,748,1,0,0,0,
+  	781,767,1,0,0,0,781,768,1,0,0,0,782,41,1,0,0,0,783,784,5,95,0,0,784,785,
+  	5,183,0,0,785,786,5,113,0,0,786,787,5,183,0,0,787,788,5,82,0,0,788,43,
+  	1,0,0,0,789,790,5,68,0,0,790,791,5,183,0,0,791,792,5,112,0,0,792,793,
+  	5,183,0,0,793,794,5,136,0,0,794,798,5,183,0,0,795,796,3,42,21,0,796,797,
+  	5,183,0,0,797,799,1,0,0,0,798,795,1,0,0,0,798,799,1,0,0,0,799,800,1,0,
+  	0,0,800,828,3,346,173,0,801,803,5,183,0,0,802,801,1,0,0,0,802,803,1,0,
+  	0,0,803,804,1,0,0,0,804,806,5,2,0,0,805,807,5,183,0,0,806,805,1,0,0,0,
+  	806,807,1,0,0,0,807,808,1,0,0,0,808,810,3,100,50,0,809,811,5,183,0,0,
+  	810,809,1,0,0,0,810,811,1,0,0,0,811,817,1,0,0,0,812,814,5,4,0,0,813,815,
+  	5,183,0,0,814,813,1,0,0,0,814,815,1,0,0,0,815,816,1,0,0,0,816,818,3,104,
+  	52,0,817,812,1,0,0,0,817,818,1,0,0,0,818,820,1,0,0,0,819,821,5,183,0,
+  	0,820,819,1,0,0,0,820,821,1,0,0,0,821,822,1,0,0,0,822,823,5,3,0,0,823,
+  	829,1,0,0,0,824,825,5,183,0,0,825,826,5,51,0,0,826,827,5,183,0,0,827,
+  	829,3,138,69,0,828,802,1,0,0,0,828,824,1,0,0,0,829,45,1,0,0,0,830,831,
+  	5,68,0,0,831,832,5,183,0,0,832,833,5,125,0,0,833,834,5,183,0,0,834,837,
+  	5,136,0,0,835,836,5,183,0,0,836,838,5,91,0,0,837,835,1,0,0,0,837,838,
+  	1,0,0,0,838,841,1,0,0,0,839,840,5,183,0,0,840,842,3,42,21,0,841,839,1,
+  	0,0,0,841,842,1,0,0,0,842,843,1,0,0,0,843,844,5,183,0,0,844,846,3,346,
+  	173,0,845,847,5,183,0,0,846,845,1,0,0,0,846,847,1,0,0,0,847,848,1,0,0,
+  	0,848,850,5,2,0,0,849,851,5,183,0,0,850,849,1,0,0,0,850,851,1,0,0,0,851,
+  	852,1,0,0,0,852,854,3,48,24,0,853,855,5,183,0,0,854,853,1,0,0,0,854,855,
+  	1,0,0,0,855,882,1,0,0,0,856,858,5,4,0,0,857,859,5,183,0,0,858,857,1,0,
+  	0,0,858,859,1,0,0,0,859,860,1,0,0,0,860,862,3,100,50,0,861,863,5,183,
+  	0,0,862,861,1,0,0,0,862,863,1,0,0,0,863,865,1,0,0,0,864,856,1,0,0,0,864,
+  	865,1,0,0,0,865,874,1,0,0,0,866,868,5,4,0,0,867,869,5,183,0,0,868,867,
+  	1,0,0,0,868,869,1,0,0,0,869,870,1,0,0,0,870,872,3,348,174,0,871,873,5,
+  	183,0,0,872,871,1,0,0,0,872,873,1,0,0,0,873,875,1,0,0,0,874,866,1,0,0,
+  	0,874,875,1,0,0,0,875,876,1,0,0,0,876,883,5,3,0,0,877,878,5,3,0,0,878,
+  	879,5,183,0,0,879,880,5,51,0,0,880,881,5,183,0,0,881,883,3,138,69,0,882,
+  	864,1,0,0,0,882,877,1,0,0,0,883,899,1,0,0,0,884,885,5,183,0,0,885,887,
+  	5,150,0,0,886,888,5,183,0,0,887,886,1,0,0,0,887,888,1,0,0,0,888,889,1,
+  	0,0,0,889,891,5,2,0,0,890,892,5,183,0,0,891,890,1,0,0,0,891,892,1,0,0,
+  	0,892,893,1,0,0,0,893,895,3,24,12,0,894,896,5,183,0,0,895,894,1,0,0,0,
+  	895,896,1,0,0,0,896,897,1,0,0,0,897,898,5,3,0,0,898,900,1,0,0,0,899,884,
+  	1,0,0,0,899,900,1,0,0,0,900,47,1,0,0,0,901,912,3,50,25,0,902,904,5,183,
+  	0,0,903,902,1,0,0,0,903,904,1,0,0,0,904,905,1,0,0,0,905,907,5,4,0,0,906,
+  	908,5,183,0,0,907,906,1,0,0,0,907,908,1,0,0,0,908,909,1,0,0,0,909,911,
+  	3,50,25,0,910,903,1,0,0,0,911,914,1,0,0,0,912,910,1,0,0,0,912,913,1,0,
+  	0,0,913,49,1,0,0,0,914,912,1,0,0,0,915,916,5,87,0,0,916,917,5,183,0,0,
+  	917,918,3,346,173,0,918,919,5,183,0,0,919,920,5,138,0,0,920,921,5,183,
+  	0,0,921,922,3,346,173,0,922,51,1,0,0,0,923,924,5,68,0,0,924,925,5,183,
+  	0,0,925,926,5,130,0,0,926,930,5,183,0,0,927,928,3,42,21,0,928,929,5,183,
+  	0,0,929,931,1,0,0,0,930,927,1,0,0,0,930,931,1,0,0,0,931,932,1,0,0,0,932,
+  	937,3,346,173,0,933,934,5,183,0,0,934,936,3,56,28,0,935,933,1,0,0,0,936,
+  	939,1,0,0,0,937,935,1,0,0,0,937,938,1,0,0,0,938,53,1,0,0,0,939,937,1,
+  	0,0,0,940,941,5,68,0,0,941,942,5,183,0,0,942,943,5,142,0,0,943,944,5,
+  	183,0,0,944,945,3,346,173,0,945,946,5,183,0,0,946,947,5,51,0,0,947,948,
+  	5,183,0,0,948,950,3,114,57,0,949,951,5,183,0,0,950,949,1,0,0,0,950,951,
+  	1,0,0,0,951,55,1,0,0,0,952,958,3,64,32,0,953,958,3,66,33,0,954,958,3,
+  	68,34,0,955,958,3,70,35,0,956,958,3,72,36,0,957,952,1,0,0,0,957,953,1,
+  	0,0,0,957,954,1,0,0,0,957,955,1,0,0,0,957,956,1,0,0,0,958,57,1,0,0,0,
+  	959,960,5,183,0,0,960,961,5,150,0,0,961,962,5,183,0,0,962,963,5,157,0,
+  	0,963,964,5,183,0,0,964,965,5,168,0,0,965,59,1,0,0,0,966,967,5,68,0,0,
+  	967,968,5,183,0,0,968,969,5,156,0,0,969,973,5,183,0,0,970,971,3,42,21,
+  	0,971,972,5,183,0,0,972,974,1,0,0,0,973,970,1,0,0,0,973,974,1,0,0,0,974,
+  	975,1,0,0,0,975,977,3,332,166,0,976,978,3,58,29,0,977,976,1,0,0,0,977,
+  	978,1,0,0,0,978,61,1,0,0,0,979,980,5,68,0,0,980,981,5,183,0,0,981,982,
+  	5,158,0,0,982,986,5,183,0,0,983,984,3,42,21,0,984,985,5,183,0,0,985,987,
+  	1,0,0,0,986,983,1,0,0,0,986,987,1,0,0,0,987,988,1,0,0,0,988,989,3,332,
+  	166,0,989,63,1,0,0,0,990,991,5,97,0,0,991,994,5,183,0,0,992,993,5,56,
+  	0,0,993,995,5,183,0,0,994,992,1,0,0,0,994,995,1,0,0,0,995,997,1,0,0,0,
+  	996,998,5,166,0,0,997,996,1,0,0,0,997,998,1,0,0,0,998,999,1,0,0,0,999,
+  	1000,3,342,171,0,1000,65,1,0,0,0,1001,1002,5,111,0,0,1002,1003,5,183,
+  	0,0,1003,1011,5,109,0,0,1004,1005,5,109,0,0,1005,1007,5,183,0,0,1006,
+  	1008,5,166,0,0,1007,1006,1,0,0,0,1007,1008,1,0,0,0,1008,1009,1,0,0,0,
+  	1009,1011,3,342,171,0,1010,1001,1,0,0,0,1010,1004,1,0,0,0,1011,67,1,0,
+  	0,0,1012,1013,5,111,0,0,1013,1014,5,183,0,0,1014,1022,5,107,0,0,1015,
+  	1016,5,107,0,0,1016,1018,5,183,0,0,1017,1019,5,166,0,0,1018,1017,1,0,
+  	0,0,1018,1019,1,0,0,0,1019,1020,1,0,0,0,1020,1022,3,342,171,0,1021,1012,
+  	1,0,0,0,1021,1015,1,0,0,0,1022,69,1,0,0,0,1023,1024,5,133,0,0,1024,1027,
+  	5,183,0,0,1025,1026,5,150,0,0,1026,1028,5,183,0,0,1027,1025,1,0,0,0,1027,
+  	1028,1,0,0,0,1028,1030,1,0,0,0,1029,1031,5,166,0,0,1030,1029,1,0,0,0,
+  	1030,1031,1,0,0,0,1031,1032,1,0,0,0,1032,1033,3,342,171,0,1033,71,1,0,
+  	0,0,1034,1035,5,111,0,0,1035,1037,5,183,0,0,1036,1034,1,0,0,0,1036,1037,
+  	1,0,0,0,1037,1038,1,0,0,0,1038,1039,5,69,0,0,1039,73,1,0,0,0,1040,1041,
+  	5,95,0,0,1041,1042,5,183,0,0,1042,1043,5,82,0,0,1043,75,1,0,0,0,1044,
+  	1045,5,78,0,0,1045,1046,5,183,0,0,1046,1047,7,0,0,0,1047,1051,5,183,0,
+  	0,1048,1049,3,74,37,0,1049,1050,5,183,0,0,1050,1052,1,0,0,0,1051,1048,
+  	1,0,0,0,1051,1052,1,0,0,0,1052,1053,1,0,0,0,1053,1054,3,346,173,0,1054,
+  	77,1,0,0,0,1055,1056,5,49,0,0,1056,1057,5,183,0,0,1057,1058,5,136,0,0,
+  	1058,1059,5,183,0,0,1059,1060,3,346,173,0,1060,1061,5,183,0,0,1061,1062,
+  	3,80,40,0,1062,79,1,0,0,0,1063,1070,3,82,41,0,1064,1070,3,86,43,0,1065,
+  	1070,3,88,44,0,1066,1070,3,90,45,0,1067,1070,3,92,46,0,1068,1070,3,94,
+  	47,0,1069,1063,1,0,0,0,1069,1064,1,0,0,0,1069,1065,1,0,0,0,1069,1066,
+  	1,0,0,0,1069,1067,1,0,0,0,1069,1068,1,0,0,0,1070,81,1,0,0,0,1071,1072,
+  	5,47,0,0,1072,1076,5,183,0,0,1073,1074,3,42,21,0,1074,1075,5,183,0,0,
+  	1075,1077,1,0,0,0,1076,1073,1,0,0,0,1076,1077,1,0,0,0,1077,1078,1,0,0,
+  	0,1078,1079,3,340,170,0,1079,1080,5,183,0,0,1080,1083,3,114,57,0,1081,
+  	1082,5,183,0,0,1082,1084,3,84,42,0,1083,1081,1,0,0,0,1083,1084,1,0,0,
+  	0,1084,83,1,0,0,0,1085,1086,5,72,0,0,1086,1087,5,183,0,0,1087,1088,3,
+  	244,122,0,1088,85,1,0,0,0,1089,1090,5,78,0,0,1090,1094,5,183,0,0,1091,
+  	1092,3,74,37,0,1092,1093,5,183,0,0,1093,1095,1,0,0,0,1094,1091,1,0,0,
+  	0,1094,1095,1,0,0,0,1095,1096,1,0,0,0,1096,1097,3,340,170,0,1097,87,1,
+  	0,0,0,1098,1099,5,126,0,0,1099,1100,5,183,0,0,1100,1101,5,138,0,0,1101,
+  	1102,5,183,0,0,1102,1103,3,346,173,0,1103,89,1,0,0,0,1104,1105,5,126,
+  	0,0,1105,1106,5,183,0,0,1106,1107,3,340,170,0,1107,1108,5,183,0,0,1108,
+  	1109,5,138,0,0,1109,1110,5,183,0,0,1110,1111,3,340,170,0,1111,91,1,0,
+  	0,0,1112,1113,5,47,0,0,1113,1117,5,183,0,0,1114,1115,3,42,21,0,1115,1116,
+  	5,183,0,0,1116,1118,1,0,0,0,1117,1114,1,0,0,0,1117,1118,1,0,0,0,1118,
+  	1119,1,0,0,0,1119,1120,3,50,25,0,1120,93,1,0,0,0,1121,1122,5,78,0,0,1122,
+  	1126,5,183,0,0,1123,1124,3,74,37,0,1124,1125,5,183,0,0,1125,1127,1,0,
+  	0,0,1126,1123,1,0,0,0,1126,1127,1,0,0,0,1127,1128,1,0,0,0,1128,1129,3,
+  	50,25,0,1129,95,1,0,0,0,1130,1141,3,98,49,0,1131,1133,5,183,0,0,1132,
+  	1131,1,0,0,0,1132,1133,1,0,0,0,1133,1134,1,0,0,0,1134,1136,5,4,0,0,1135,
+  	1137,5,183,0,0,1136,1135,1,0,0,0,1136,1137,1,0,0,0,1137,1138,1,0,0,0,
+  	1138,1140,3,98,49,0,1139,1132,1,0,0,0,1140,1143,1,0,0,0,1141,1139,1,0,
+  	0,0,1141,1142,1,0,0,0,1142,97,1,0,0,0,1143,1141,1,0,0,0,1144,1145,3,340,
+  	170,0,1145,1146,5,183,0,0,1146,1147,3,114,57,0,1147,99,1,0,0,0,1148,1159,
+  	3,102,51,0,1149,1151,5,183,0,0,1150,1149,1,0,0,0,1150,1151,1,0,0,0,1151,
+  	1152,1,0,0,0,1152,1154,5,4,0,0,1153,1155,5,183,0,0,1154,1153,1,0,0,0,
+  	1154,1155,1,0,0,0,1155,1156,1,0,0,0,1156,1158,3,102,51,0,1157,1150,1,
+  	0,0,0,1158,1161,1,0,0,0,1159,1157,1,0,0,0,1159,1160,1,0,0,0,1160,101,
+  	1,0,0,0,1161,1159,1,0,0,0,1162,1165,3,98,49,0,1163,1164,5,183,0,0,1164,
+  	1166,3,84,42,0,1165,1163,1,0,0,0,1165,1166,1,0,0,0,1166,1171,1,0,0,0,
+  	1167,1168,5,183,0,0,1168,1169,5,121,0,0,1169,1170,5,183,0,0,1170,1172,
+  	5,101,0,0,1171,1167,1,0,0,0,1171,1172,1,0,0,0,1172,103,1,0,0,0,1173,1174,
+  	5,121,0,0,1174,1175,5,183,0,0,1175,1177,5,101,0,0,1176,1178,5,183,0,0,
+  	1177,1176,1,0,0,0,1177,1178,1,0,0,0,1178,1179,1,0,0,0,1179,1181,5,2,0,
+  	0,1180,1182,5,183,0,0,1181,1180,1,0,0,0,1181,1182,1,0,0,0,1182,1183,1,
+  	0,0,0,1183,1185,3,340,170,0,1184,1186,5,183,0,0,1185,1184,1,0,0,0,1185,
+  	1186,1,0,0,0,1186,1187,1,0,0,0,1187,1188,5,3,0,0,1188,105,1,0,0,0,1189,
+  	1191,5,143,0,0,1190,1192,5,183,0,0,1191,1190,1,0,0,0,1191,1192,1,0,0,
+  	0,1192,1193,1,0,0,0,1193,1195,5,2,0,0,1194,1196,5,183,0,0,1195,1194,1,
+  	0,0,0,1195,1196,1,0,0,0,1196,1197,1,0,0,0,1197,1199,3,96,48,0,1198,1200,
+  	5,183,0,0,1199,1198,1,0,0,0,1199,1200,1,0,0,0,1200,1201,1,0,0,0,1201,
+  	1202,5,3,0,0,1202,107,1,0,0,0,1203,1205,5,135,0,0,1204,1206,5,183,0,0,
+  	1205,1204,1,0,0,0,1205,1206,1,0,0,0,1206,1207,1,0,0,0,1207,1209,5,2,0,
+  	0,1208,1210,5,183,0,0,1209,1208,1,0,0,0,1209,1210,1,0,0,0,1210,1211,1,
+  	0,0,0,1211,1213,3,96,48,0,1212,1214,5,183,0,0,1213,1212,1,0,0,0,1213,
+  	1214,1,0,0,0,1214,1215,1,0,0,0,1215,1216,5,3,0,0,1216,109,1,0,0,0,1217,
+  	1219,5,159,0,0,1218,1220,5,183,0,0,1219,1218,1,0,0,0,1219,1220,1,0,0,
+  	0,1220,1221,1,0,0,0,1221,1223,5,2,0,0,1222,1224,5,183,0,0,1223,1222,1,
+  	0,0,0,1223,1224,1,0,0,0,1224,1225,1,0,0,0,1225,1227,3,114,57,0,1226,1228,
+  	5,183,0,0,1227,1226,1,0,0,0,1227,1228,1,0,0,0,1228,1229,1,0,0,0,1229,
+  	1231,5,4,0,0,1230,1232,5,183,0,0,1231,1230,1,0,0,0,1231,1232,1,0,0,0,
+  	1232,1233,1,0,0,0,1233,1235,3,114,57,0,1234,1236,5,183,0,0,1235,1234,
+  	1,0,0,0,1235,1236,1,0,0,0,1236,1237,1,0,0,0,1237,1238,5,3,0,0,1238,111,
+  	1,0,0,0,1239,1241,5,160,0,0,1240,1242,5,183,0,0,1241,1240,1,0,0,0,1241,
+  	1242,1,0,0,0,1242,1243,1,0,0,0,1243,1245,5,2,0,0,1244,1246,5,183,0,0,
+  	1245,1244,1,0,0,0,1245,1246,1,0,0,0,1246,1247,1,0,0,0,1247,1249,3,342,
+  	171,0,1248,1250,5,183,0,0,1249,1248,1,0,0,0,1249,1250,1,0,0,0,1250,1251,
+  	1,0,0,0,1251,1253,5,4,0,0,1252,1254,5,183,0,0,1253,1252,1,0,0,0,1253,
+  	1254,1,0,0,0,1254,1255,1,0,0,0,1255,1257,3,342,171,0,1256,1258,5,183,
+  	0,0,1257,1256,1,0,0,0,1257,1258,1,0,0,0,1258,1259,1,0,0,0,1259,1260,5,
+  	3,0,0,1260,113,1,0,0,0,1261,1262,6,57,-1,0,1262,1268,3,348,174,0,1263,
+  	1268,3,106,53,0,1264,1268,3,108,54,0,1265,1268,3,110,55,0,1266,1268,3,
+  	112,56,0,1267,1261,1,0,0,0,1267,1263,1,0,0,0,1267,1264,1,0,0,0,1267,1265,
+  	1,0,0,0,1267,1266,1,0,0,0,1268,1273,1,0,0,0,1269,1270,10,5,0,0,1270,1272,
+  	3,116,58,0,1271,1269,1,0,0,0,1272,1275,1,0,0,0,1273,1271,1,0,0,0,1273,
+  	1274,1,0,0,0,1274,115,1,0,0,0,1275,1273,1,0,0,0,1276,1280,3,118,59,0,
+  	1277,1279,3,118,59,0,1278,1277,1,0,0,0,1279,1282,1,0,0,0,1280,1278,1,
+  	0,0,0,1280,1281,1,0,0,0,1281,117,1,0,0,0,1282,1280,1,0,0,0,1283,1285,
+  	5,7,0,0,1284,1286,3,342,171,0,1285,1284,1,0,0,0,1285,1286,1,0,0,0,1286,
+  	1287,1,0,0,0,1287,1288,5,8,0,0,1288,119,1,0,0,0,1289,1292,3,122,61,0,
+  	1290,1292,3,124,62,0,1291,1289,1,0,0,0,1291,1290,1,0,0,0,1292,121,1,0,
+  	0,0,1293,1296,5,83,0,0,1294,1295,5,183,0,0,1295,1297,5,104,0,0,1296,1294,
+  	1,0,0,0,1296,1297,1,0,0,0,1297,123,1,0,0,0,1298,1299,5,122,0,0,1299,125,
+  	1,0,0,0,1300,1301,5,55,0,0,1301,1302,5,183,0,0,1302,1314,5,140,0,0,1303,
+  	1304,5,55,0,0,1304,1305,5,183,0,0,1305,1306,5,140,0,0,1306,1307,5,183,
+  	0,0,1307,1308,5,124,0,0,1308,1309,5,183,0,0,1309,1314,5,117,0,0,1310,
+  	1314,5,63,0,0,1311,1314,5,128,0,0,1312,1314,5,60,0,0,1313,1300,1,0,0,
+  	0,1313,1303,1,0,0,0,1313,1310,1,0,0,0,1313,1311,1,0,0,0,1313,1312,1,0,
+  	0,0,1314,127,1,0,0,0,1315,1320,3,130,65,0,1316,1320,3,132,66,0,1317,1320,
+  	3,134,67,0,1318,1320,3,136,68,0,1319,1315,1,0,0,0,1319,1316,1,0,0,0,1319,
+  	1317,1,0,0,0,1319,1318,1,0,0,0,1320,129,1,0,0,0,1321,1322,5,103,0,0,1322,
+  	1325,5,183,0,0,1323,1324,5,85,0,0,1324,1326,5,183,0,0,1325,1323,1,0,0,
+  	0,1325,1326,1,0,0,0,1326,1329,1,0,0,0,1327,1330,5,168,0,0,1328,1330,3,
+  	332,166,0,1329,1327,1,0,0,0,1329,1328,1,0,0,0,1330,131,1,0,0,0,1331,1332,
+  	5,88,0,0,1332,1334,5,183,0,0,1333,1331,1,0,0,0,1333,1334,1,0,0,0,1334,
+  	1335,1,0,0,0,1335,1336,5,98,0,0,1336,1337,5,183,0,0,1337,1342,3,332,166,
+  	0,1338,1339,5,183,0,0,1339,1340,5,87,0,0,1340,1341,5,183,0,0,1341,1343,
+  	5,168,0,0,1342,1338,1,0,0,0,1342,1343,1,0,0,0,1343,133,1,0,0,0,1344,1345,
+  	5,145,0,0,1345,1346,5,183,0,0,1346,1347,3,332,166,0,1347,135,1,0,0,0,
+  	1348,1349,5,146,0,0,1349,1350,5,183,0,0,1350,1351,3,332,166,0,1351,137,
+  	1,0,0,0,1352,1353,3,140,70,0,1353,139,1,0,0,0,1354,1361,3,144,72,0,1355,
+  	1357,5,183,0,0,1356,1355,1,0,0,0,1356,1357,1,0,0,0,1357,1358,1,0,0,0,
+  	1358,1360,3,142,71,0,1359,1356,1,0,0,0,1360,1363,1,0,0,0,1361,1359,1,
+  	0,0,0,1361,1362,1,0,0,0,1362,1376,1,0,0,0,1363,1361,1,0,0,0,1364,1366,
+  	3,186,93,0,1365,1367,5,183,0,0,1366,1365,1,0,0,0,1366,1367,1,0,0,0,1367,
+  	1369,1,0,0,0,1368,1364,1,0,0,0,1369,1370,1,0,0,0,1370,1368,1,0,0,0,1370,
+  	1371,1,0,0,0,1371,1372,1,0,0,0,1372,1373,3,144,72,0,1373,1374,6,70,-1,
+  	0,1374,1376,1,0,0,0,1375,1354,1,0,0,0,1375,1368,1,0,0,0,1376,141,1,0,
+  	0,0,1377,1378,5,143,0,0,1378,1379,5,183,0,0,1379,1381,5,48,0,0,1380,1382,
+  	5,183,0,0,1381,1380,1,0,0,0,1381,1382,1,0,0,0,1382,1383,1,0,0,0,1383,
+  	1390,3,144,72,0,1384,1386,5,143,0,0,1385,1387,5,183,0,0,1386,1385,1,0,
+  	0,0,1386,1387,1,0,0,0,1387,1388,1,0,0,0,1388,1390,3,144,72,0,1389,1377,
+  	1,0,0,0,1389,1384,1,0,0,0,1390,143,1,0,0,0,1391,1394,3,146,73,0,1392,
+  	1394,3,148,74,0,1393,1391,1,0,0,0,1393,1392,1,0,0,0,1394,145,1,0,0,0,
+  	1395,1397,3,154,77,0,1396,1398,5,183,0,0,1397,1396,1,0,0,0,1397,1398,
+  	1,0,0,0,1398,1400,1,0,0,0,1399,1395,1,0,0,0,1400,1403,1,0,0,0,1401,1399,
+  	1,0,0,0,1401,1402,1,0,0,0,1402,1404,1,0,0,0,1403,1401,1,0,0,0,1404,1431,
+  	3,186,93,0,1405,1407,3,154,77,0,1406,1408,5,183,0,0,1407,1406,1,0,0,0,
+  	1407,1408,1,0,0,0,1408,1410,1,0,0,0,1409,1405,1,0,0,0,1410,1413,1,0,0,
+  	0,1411,1409,1,0,0,0,1411,1412,1,0,0,0,1412,1414,1,0,0,0,1413,1411,1,0,
+  	0,0,1414,1421,3,152,76,0,1415,1417,5,183,0,0,1416,1415,1,0,0,0,1416,1417,
+  	1,0,0,0,1417,1418,1,0,0,0,1418,1420,3,152,76,0,1419,1416,1,0,0,0,1420,
+  	1423,1,0,0,0,1421,1419,1,0,0,0,1421,1422,1,0,0,0,1422,1428,1,0,0,0,1423,
+  	1421,1,0,0,0,1424,1426,5,183,0,0,1425,1424,1,0,0,0,1425,1426,1,0,0,0,
+  	1426,1427,1,0,0,0,1427,1429,3,186,93,0,1428,1425,1,0,0,0,1428,1429,1,
+  	0,0,0,1429,1431,1,0,0,0,1430,1401,1,0,0,0,1430,1411,1,0,0,0,1431,147,
+  	1,0,0,0,1432,1434,3,150,75,0,1433,1435,5,183,0,0,1434,1433,1,0,0,0,1434,
+  	1435,1,0,0,0,1435,1437,1,0,0,0,1436,1432,1,0,0,0,1437,1438,1,0,0,0,1438,
+  	1436,1,0,0,0,1438,1439,1,0,0,0,1439,1440,1,0,0,0,1440,1441,3,146,73,0,
+  	1441,149,1,0,0,0,1442,1444,3,154,77,0,1443,1445,5,183,0,0,1444,1443,1,
+  	0,0,0,1444,1445,1,0,0,0,1445,1447,1,0,0,0,1446,1442,1,0,0,0,1447,1450,
+  	1,0,0,0,1448,1446,1,0,0,0,1448,1449,1,0,0,0,1449,1457,1,0,0,0,1450,1448,
+  	1,0,0,0,1451,1453,3,152,76,0,1452,1454,5,183,0,0,1453,1452,1,0,0,0,1453,
+  	1454,1,0,0,0,1454,1456,1,0,0,0,1455,1451,1,0,0,0,1456,1459,1,0,0,0,1457,
+  	1455,1,0,0,0,1457,1458,1,0,0,0,1458,1460,1,0,0,0,1459,1457,1,0,0,0,1460,
+  	1461,3,184,92,0,1461,151,1,0,0,0,1462,1467,3,172,86,0,1463,1467,3,174,
+  	87,0,1464,1467,3,178,89,0,1465,1467,3,182,91,0,1466,1462,1,0,0,0,1466,
+  	1463,1,0,0,0,1466,1464,1,0,0,0,1466,1465,1,0,0,0,1467,153,1,0,0,0,1468,
+  	1473,3,164,82,0,1469,1473,3,170,85,0,1470,1473,3,162,81,0,1471,1473,3,
+  	156,78,0,1472,1468,1,0,0,0,1472,1469,1,0,0,0,1472,1470,1,0,0,0,1472,1471,
+  	1,0,0,0,1473,155,1,0,0,0,1474,1492,5,103,0,0,1475,1476,5,183,0,0,1476,
+  	1477,5,150,0,0,1477,1478,5,183,0,0,1478,1480,5,92,0,0,1479,1481,5,183,
+  	0,0,1480,1479,1,0,0,0,1480,1481,1,0,0,0,1481,1482,1,0,0,0,1482,1484,5,
+  	2,0,0,1483,1485,5,183,0,0,1484,1483,1,0,0,0,1484,1485,1,0,0,0,1485,1486,
+  	1,0,0,0,1486,1488,3,96,48,0,1487,1489,5,183,0,0,1488,1487,1,0,0,0,1488,
+  	1489,1,0,0,0,1489,1490,1,0,0,0,1490,1491,5,3,0,0,1491,1493,1,0,0,0,1492,
+  	1475,1,0,0,0,1492,1493,1,0,0,0,1493,1494,1,0,0,0,1494,1495,5,183,0,0,
+  	1495,1496,5,87,0,0,1496,1497,5,183,0,0,1497,1511,3,10,5,0,1498,1500,5,
+  	183,0,0,1499,1498,1,0,0,0,1499,1500,1,0,0,0,1500,1501,1,0,0,0,1501,1503,
+  	5,2,0,0,1502,1504,5,183,0,0,1503,1502,1,0,0,0,1503,1504,1,0,0,0,1504,
+  	1505,1,0,0,0,1505,1507,3,24,12,0,1506,1508,5,183,0,0,1507,1506,1,0,0,
+  	0,1507,1508,1,0,0,0,1508,1509,1,0,0,0,1509,1510,5,3,0,0,1510,1512,1,0,
+  	0,0,1511,1499,1,0,0,0,1511,1512,1,0,0,0,1512,1517,1,0,0,0,1513,1515,5,
+  	183,0,0,1514,1513,1,0,0,0,1514,1515,1,0,0,0,1515,1516,1,0,0,0,1516,1518,
+  	3,202,101,0,1517,1514,1,0,0,0,1517,1518,1,0,0,0,1518,157,1,0,0,0,1519,
+  	1520,3,332,166,0,1520,1521,5,183,0,0,1521,1522,5,51,0,0,1522,1523,5,183,
+  	0,0,1523,1525,1,0,0,0,1524,1519,1,0,0,0,1524,1525,1,0,0,0,1525,1526,1,
+  	0,0,0,1526,1527,3,332,166,0,1527,159,1,0,0,0,1528,1539,3,158,79,0,1529,
+  	1531,5,183,0,0,1530,1529,1,0,0,0,1530,1531,1,0,0,0,1531,1532,1,0,0,0,
+  	1532,1534,5,4,0,0,1533,1535,5,183,0,0,1534,1533,1,0,0,0,1534,1535,1,0,
+  	0,0,1535,1536,1,0,0,0,1536,1538,3,158,79,0,1537,1530,1,0,0,0,1538,1541,
+  	1,0,0,0,1539,1537,1,0,0,0,1539,1540,1,0,0,0,1540,161,1,0,0,0,1541,1539,
+  	1,0,0,0,1542,1543,5,57,0,0,1543,1544,5,183,0,0,1544,1549,3,312,156,0,
+  	1545,1547,5,183,0,0,1546,1545,1,0,0,0,1546,1547,1,0,0,0,1547,1548,1,0,
+  	0,0,1548,1550,3,202,101,0,1549,1546,1,0,0,0,1549,1550,1,0,0,0,1550,1557,
+  	1,0,0,0,1551,1553,5,183,0,0,1552,1551,1,0,0,0,1552,1553,1,0,0,0,1553,
+  	1554,1,0,0,0,1554,1555,5,155,0,0,1555,1556,5,183,0,0,1556,1558,3,160,
+  	80,0,1557,1552,1,0,0,0,1557,1558,1,0,0,0,1558,163,1,0,0,0,1559,1560,5,
+  	118,0,0,1560,1562,5,183,0,0,1561,1559,1,0,0,0,1561,1562,1,0,0,0,1562,
+  	1563,1,0,0,0,1563,1565,5,106,0,0,1564,1566,5,183,0,0,1565,1564,1,0,0,
+  	0,1565,1566,1,0,0,0,1566,1567,1,0,0,0,1567,1570,3,204,102,0,1568,1569,
+  	5,183,0,0,1569,1571,3,202,101,0,1570,1568,1,0,0,0,1570,1571,1,0,0,0,1571,
+  	1574,1,0,0,0,1572,1573,5,183,0,0,1573,1575,3,166,83,0,1574,1572,1,0,0,
+  	0,1574,1575,1,0,0,0,1575,165,1,0,0,0,1576,1577,5,93,0,0,1577,1578,5,183,
+  	0,0,1578,1579,3,168,84,0,1579,167,1,0,0,0,1580,1581,6,84,-1,0,1581,1583,
+  	5,2,0,0,1582,1584,5,183,0,0,1583,1582,1,0,0,0,1583,1584,1,0,0,0,1584,
+  	1585,1,0,0,0,1585,1587,3,168,84,0,1586,1588,5,183,0,0,1587,1586,1,0,0,
+  	0,1587,1588,1,0,0,0,1588,1589,1,0,0,0,1589,1590,5,3,0,0,1590,1593,1,0,
+  	0,0,1591,1593,3,346,173,0,1592,1580,1,0,0,0,1592,1591,1,0,0,0,1593,1610,
+  	1,0,0,0,1594,1595,10,4,0,0,1595,1596,5,183,0,0,1596,1597,5,100,0,0,1597,
+  	1598,5,183,0,0,1598,1609,3,168,84,5,1599,1604,10,3,0,0,1600,1601,5,183,
+  	0,0,1601,1602,5,110,0,0,1602,1603,5,183,0,0,1603,1605,3,346,173,0,1604,
+  	1600,1,0,0,0,1605,1606,1,0,0,0,1606,1604,1,0,0,0,1606,1607,1,0,0,0,1607,
+  	1609,1,0,0,0,1608,1594,1,0,0,0,1608,1599,1,0,0,0,1609,1612,1,0,0,0,1610,
+  	1608,1,0,0,0,1610,1611,1,0,0,0,1611,169,1,0,0,0,1612,1610,1,0,0,0,1613,
+  	1615,5,144,0,0,1614,1616,5,183,0,0,1615,1614,1,0,0,0,1615,1616,1,0,0,
+  	0,1616,1617,1,0,0,0,1617,1618,3,244,122,0,1618,1619,5,183,0,0,1619,1620,
+  	5,51,0,0,1620,1621,5,183,0,0,1621,1622,3,332,166,0,1622,171,1,0,0,0,1623,
+  	1625,5,68,0,0,1624,1626,5,183,0,0,1625,1624,1,0,0,0,1625,1626,1,0,0,0,
+  	1626,1627,1,0,0,0,1627,1628,3,204,102,0,1628,173,1,0,0,0,1629,1631,5,
+  	108,0,0,1630,1632,5,183,0,0,1631,1630,1,0,0,0,1631,1632,1,0,0,0,1632,
+  	1633,1,0,0,0,1633,1638,3,204,102,0,1634,1635,5,183,0,0,1635,1637,3,176,
+  	88,0,1636,1634,1,0,0,0,1637,1640,1,0,0,0,1638,1636,1,0,0,0,1638,1639,
+  	1,0,0,0,1639,175,1,0,0,0,1640,1638,1,0,0,0,1641,1642,5,116,0,0,1642,1643,
+  	5,183,0,0,1643,1644,5,106,0,0,1644,1645,5,183,0,0,1645,1652,3,178,89,
+  	0,1646,1647,5,116,0,0,1647,1648,5,183,0,0,1648,1649,5,68,0,0,1649,1650,
+  	5,183,0,0,1650,1652,3,178,89,0,1651,1641,1,0,0,0,1651,1646,1,0,0,0,1652,
+  	177,1,0,0,0,1653,1655,5,131,0,0,1654,1656,5,183,0,0,1655,1654,1,0,0,0,
+  	1655,1656,1,0,0,0,1656,1657,1,0,0,0,1657,1668,3,180,90,0,1658,1660,5,
+  	183,0,0,1659,1658,1,0,0,0,1659,1660,1,0,0,0,1660,1661,1,0,0,0,1661,1663,
+  	5,4,0,0,1662,1664,5,183,0,0,1663,1662,1,0,0,0,1663,1664,1,0,0,0,1664,
+  	1665,1,0,0,0,1665,1667,3,180,90,0,1666,1659,1,0,0,0,1667,1670,1,0,0,0,
+  	1668,1666,1,0,0,0,1668,1669,1,0,0,0,1669,1686,1,0,0,0,1670,1668,1,0,0,
+  	0,1671,1673,5,131,0,0,1672,1674,5,183,0,0,1673,1672,1,0,0,0,1673,1674,
+  	1,0,0,0,1674,1675,1,0,0,0,1675,1677,3,290,145,0,1676,1678,5,183,0,0,1677,
+  	1676,1,0,0,0,1677,1678,1,0,0,0,1678,1679,1,0,0,0,1679,1681,5,6,0,0,1680,
+  	1682,5,183,0,0,1681,1680,1,0,0,0,1681,1682,1,0,0,0,1682,1683,1,0,0,0,
+  	1683,1684,3,220,110,0,1684,1686,1,0,0,0,1685,1653,1,0,0,0,1685,1671,1,
+  	0,0,0,1686,179,1,0,0,0,1687,1689,3,338,169,0,1688,1690,5,183,0,0,1689,
+  	1688,1,0,0,0,1689,1690,1,0,0,0,1690,1691,1,0,0,0,1691,1693,5,6,0,0,1692,
+  	1694,5,183,0,0,1693,1692,1,0,0,0,1693,1694,1,0,0,0,1694,1695,1,0,0,0,
+  	1695,1696,3,244,122,0,1696,181,1,0,0,0,1697,1698,5,76,0,0,1698,1700,5,
+  	183,0,0,1699,1697,1,0,0,0,1699,1700,1,0,0,0,1700,1701,1,0,0,0,1701,1703,
+  	5,73,0,0,1702,1704,5,183,0,0,1703,1702,1,0,0,0,1703,1704,1,0,0,0,1704,
+  	1705,1,0,0,0,1705,1716,3,244,122,0,1706,1708,5,183,0,0,1707,1706,1,0,
+  	0,0,1707,1708,1,0,0,0,1708,1709,1,0,0,0,1709,1711,5,4,0,0,1710,1712,5,
+  	183,0,0,1711,1710,1,0,0,0,1711,1712,1,0,0,0,1712,1713,1,0,0,0,1713,1715,
+  	3,244,122,0,1714,1707,1,0,0,0,1715,1718,1,0,0,0,1716,1714,1,0,0,0,1716,
+  	1717,1,0,0,0,1717,183,1,0,0,0,1718,1716,1,0,0,0,1719,1720,5,150,0,0,1720,
+  	1725,3,188,94,0,1721,1723,5,183,0,0,1722,1721,1,0,0,0,1722,1723,1,0,0,
+  	0,1723,1724,1,0,0,0,1724,1726,3,202,101,0,1725,1722,1,0,0,0,1725,1726,
+  	1,0,0,0,1726,185,1,0,0,0,1727,1728,5,127,0,0,1728,1729,3,188,94,0,1729,
+  	187,1,0,0,0,1730,1732,5,183,0,0,1731,1730,1,0,0,0,1731,1732,1,0,0,0,1732,
+  	1733,1,0,0,0,1733,1735,5,77,0,0,1734,1731,1,0,0,0,1734,1735,1,0,0,0,1735,
+  	1736,1,0,0,0,1736,1737,5,183,0,0,1737,1740,3,190,95,0,1738,1739,5,183,
+  	0,0,1739,1741,3,194,97,0,1740,1738,1,0,0,0,1740,1741,1,0,0,0,1741,1744,
+  	1,0,0,0,1742,1743,5,183,0,0,1743,1745,3,196,98,0,1744,1742,1,0,0,0,1744,
+  	1745,1,0,0,0,1745,1748,1,0,0,0,1746,1747,5,183,0,0,1747,1749,3,198,99,
+  	0,1748,1746,1,0,0,0,1748,1749,1,0,0,0,1749,189,1,0,0,0,1750,1761,5,161,
+  	0,0,1751,1753,5,183,0,0,1752,1751,1,0,0,0,1752,1753,1,0,0,0,1753,1754,
+  	1,0,0,0,1754,1756,5,4,0,0,1755,1757,5,183,0,0,1756,1755,1,0,0,0,1756,
+  	1757,1,0,0,0,1757,1758,1,0,0,0,1758,1760,3,192,96,0,1759,1752,1,0,0,0,
+  	1760,1763,1,0,0,0,1761,1759,1,0,0,0,1761,1762,1,0,0,0,1762,1779,1,0,0,
+  	0,1763,1761,1,0,0,0,1764,1775,3,192,96,0,1765,1767,5,183,0,0,1766,1765,
+  	1,0,0,0,1766,1767,1,0,0,0,1767,1768,1,0,0,0,1768,1770,5,4,0,0,1769,1771,
+  	5,183,0,0,1770,1769,1,0,0,0,1770,1771,1,0,0,0,1771,1772,1,0,0,0,1772,
+  	1774,3,192,96,0,1773,1766,1,0,0,0,1774,1777,1,0,0,0,1775,1773,1,0,0,0,
+  	1775,1776,1,0,0,0,1776,1779,1,0,0,0,1777,1775,1,0,0,0,1778,1750,1,0,0,
+  	0,1778,1764,1,0,0,0,1779,191,1,0,0,0,1780,1781,3,244,122,0,1781,1782,
+  	5,183,0,0,1782,1783,5,51,0,0,1783,1784,5,183,0,0,1784,1785,3,332,166,
+  	0,1785,1788,1,0,0,0,1786,1788,3,244,122,0,1787,1780,1,0,0,0,1787,1786,
+  	1,0,0,0,1788,193,1,0,0,0,1789,1790,5,120,0,0,1790,1791,5,183,0,0,1791,
+  	1792,5,56,0,0,1792,1793,5,183,0,0,1793,1801,3,200,100,0,1794,1796,5,4,
+  	0,0,1795,1797,5,183,0,0,1796,1795,1,0,0,0,1796,1797,1,0,0,0,1797,1798,
+  	1,0,0,0,1798,1800,3,200,100,0,1799,1794,1,0,0,0,1800,1803,1,0,0,0,1801,
+  	1799,1,0,0,0,1801,1802,1,0,0,0,1802,195,1,0,0,0,1803,1801,1,0,0,0,1804,
+  	1805,5,162,0,0,1805,1806,5,183,0,0,1806,1807,3,244,122,0,1807,197,1,0,
+  	0,0,1808,1809,5,102,0,0,1809,1810,5,183,0,0,1810,1811,3,244,122,0,1811,
+  	199,1,0,0,0,1812,1817,3,244,122,0,1813,1815,5,183,0,0,1814,1813,1,0,0,
+  	0,1814,1815,1,0,0,0,1815,1816,1,0,0,0,1816,1818,7,1,0,0,1817,1814,1,0,
+  	0,0,1817,1818,1,0,0,0,1818,201,1,0,0,0,1819,1820,5,149,0,0,1820,1821,
+  	5,183,0,0,1821,1822,3,244,122,0,1822,203,1,0,0,0,1823,1834,3,206,103,
+  	0,1824,1826,5,183,0,0,1825,1824,1,0,0,0,1825,1826,1,0,0,0,1826,1827,1,
+  	0,0,0,1827,1829,5,4,0,0,1828,1830,5,183,0,0,1829,1828,1,0,0,0,1829,1830,
+  	1,0,0,0,1830,1831,1,0,0,0,1831,1833,3,206,103,0,1832,1825,1,0,0,0,1833,
+  	1836,1,0,0,0,1834,1832,1,0,0,0,1834,1835,1,0,0,0,1835,205,1,0,0,0,1836,
+  	1834,1,0,0,0,1837,1839,3,332,166,0,1838,1840,5,183,0,0,1839,1838,1,0,
+  	0,0,1839,1840,1,0,0,0,1840,1841,1,0,0,0,1841,1843,5,6,0,0,1842,1844,5,
+  	183,0,0,1843,1842,1,0,0,0,1843,1844,1,0,0,0,1844,1845,1,0,0,0,1845,1846,
+  	3,208,104,0,1846,1849,1,0,0,0,1847,1849,3,208,104,0,1848,1837,1,0,0,0,
+  	1848,1847,1,0,0,0,1849,207,1,0,0,0,1850,1851,3,210,105,0,1851,209,1,0,
+  	0,0,1852,1859,3,212,106,0,1853,1855,5,183,0,0,1854,1853,1,0,0,0,1854,
+  	1855,1,0,0,0,1855,1856,1,0,0,0,1856,1858,3,214,107,0,1857,1854,1,0,0,
+  	0,1858,1861,1,0,0,0,1859,1857,1,0,0,0,1859,1860,1,0,0,0,1860,1867,1,0,
+  	0,0,1861,1859,1,0,0,0,1862,1863,5,2,0,0,1863,1864,3,210,105,0,1864,1865,
+  	5,3,0,0,1865,1867,1,0,0,0,1866,1852,1,0,0,0,1866,1862,1,0,0,0,1867,211,
+  	1,0,0,0,1868,1870,5,2,0,0,1869,1871,5,183,0,0,1870,1869,1,0,0,0,1870,
+  	1871,1,0,0,0,1871,1876,1,0,0,0,1872,1874,3,332,166,0,1873,1875,5,183,
+  	0,0,1874,1873,1,0,0,0,1874,1875,1,0,0,0,1875,1877,1,0,0,0,1876,1872,1,
+  	0,0,0,1876,1877,1,0,0,0,1877,1882,1,0,0,0,1878,1880,3,224,112,0,1879,
+  	1881,5,183,0,0,1880,1879,1,0,0,0,1880,1881,1,0,0,0,1881,1883,1,0,0,0,
+  	1882,1878,1,0,0,0,1882,1883,1,0,0,0,1883,1888,1,0,0,0,1884,1886,3,220,
+  	110,0,1885,1887,5,183,0,0,1886,1885,1,0,0,0,1886,1887,1,0,0,0,1887,1889,
+  	1,0,0,0,1888,1884,1,0,0,0,1888,1889,1,0,0,0,1889,1890,1,0,0,0,1890,1891,
+  	5,3,0,0,1891,213,1,0,0,0,1892,1894,3,216,108,0,1893,1895,5,183,0,0,1894,
+  	1893,1,0,0,0,1894,1895,1,0,0,0,1895,1896,1,0,0,0,1896,1897,3,212,106,
+  	0,1897,215,1,0,0,0,1898,1900,3,352,176,0,1899,1901,5,183,0,0,1900,1899,
+  	1,0,0,0,1900,1901,1,0,0,0,1901,1902,1,0,0,0,1902,1904,3,356,178,0,1903,
+  	1905,5,183,0,0,1904,1903,1,0,0,0,1904,1905,1,0,0,0,1905,1907,1,0,0,0,
+  	1906,1908,3,218,109,0,1907,1906,1,0,0,0,1907,1908,1,0,0,0,1908,1910,1,
+  	0,0,0,1909,1911,5,183,0,0,1910,1909,1,0,0,0,1910,1911,1,0,0,0,1911,1912,
+  	1,0,0,0,1912,1913,3,356,178,0,1913,1943,1,0,0,0,1914,1916,3,356,178,0,
+  	1915,1917,5,183,0,0,1916,1915,1,0,0,0,1916,1917,1,0,0,0,1917,1919,1,0,
+  	0,0,1918,1920,3,218,109,0,1919,1918,1,0,0,0,1919,1920,1,0,0,0,1920,1922,
+  	1,0,0,0,1921,1923,5,183,0,0,1922,1921,1,0,0,0,1922,1923,1,0,0,0,1923,
+  	1924,1,0,0,0,1924,1926,3,356,178,0,1925,1927,5,183,0,0,1926,1925,1,0,
+  	0,0,1926,1927,1,0,0,0,1927,1928,1,0,0,0,1928,1929,3,354,177,0,1929,1943,
+  	1,0,0,0,1930,1932,3,356,178,0,1931,1933,5,183,0,0,1932,1931,1,0,0,0,1932,
+  	1933,1,0,0,0,1933,1935,1,0,0,0,1934,1936,3,218,109,0,1935,1934,1,0,0,
+  	0,1935,1936,1,0,0,0,1936,1938,1,0,0,0,1937,1939,5,183,0,0,1938,1937,1,
+  	0,0,0,1938,1939,1,0,0,0,1939,1940,1,0,0,0,1940,1941,3,356,178,0,1941,
+  	1943,1,0,0,0,1942,1898,1,0,0,0,1942,1914,1,0,0,0,1942,1930,1,0,0,0,1943,
+  	217,1,0,0,0,1944,1946,5,7,0,0,1945,1947,5,183,0,0,1946,1945,1,0,0,0,1946,
+  	1947,1,0,0,0,1947,1952,1,0,0,0,1948,1950,3,332,166,0,1949,1951,5,183,
+  	0,0,1950,1949,1,0,0,0,1950,1951,1,0,0,0,1951,1953,1,0,0,0,1952,1948,1,
+  	0,0,0,1952,1953,1,0,0,0,1953,1958,1,0,0,0,1954,1956,3,222,111,0,1955,
+  	1957,5,183,0,0,1956,1955,1,0,0,0,1956,1957,1,0,0,0,1957,1959,1,0,0,0,
+  	1958,1954,1,0,0,0,1958,1959,1,0,0,0,1959,1964,1,0,0,0,1960,1962,3,226,
+  	113,0,1961,1963,5,183,0,0,1962,1961,1,0,0,0,1962,1963,1,0,0,0,1963,1965,
+  	1,0,0,0,1964,1960,1,0,0,0,1964,1965,1,0,0,0,1965,1970,1,0,0,0,1966,1968,
+  	3,220,110,0,1967,1969,5,183,0,0,1968,1967,1,0,0,0,1968,1969,1,0,0,0,1969,
+  	1971,1,0,0,0,1970,1966,1,0,0,0,1970,1971,1,0,0,0,1971,1972,1,0,0,0,1972,
+  	1973,5,8,0,0,1973,219,1,0,0,0,1974,1976,5,9,0,0,1975,1977,5,183,0,0,1976,
+  	1975,1,0,0,0,1976,1977,1,0,0,0,1977,2011,1,0,0,0,1978,1980,3,340,170,
+  	0,1979,1981,5,183,0,0,1980,1979,1,0,0,0,1980,1981,1,0,0,0,1981,1982,1,
+  	0,0,0,1982,1984,5,164,0,0,1983,1985,5,183,0,0,1984,1983,1,0,0,0,1984,
+  	1985,1,0,0,0,1985,1986,1,0,0,0,1986,1988,3,244,122,0,1987,1989,5,183,
+  	0,0,1988,1987,1,0,0,0,1988,1989,1,0,0,0,1989,2008,1,0,0,0,1990,1992,5,
+  	4,0,0,1991,1993,5,183,0,0,1992,1991,1,0,0,0,1992,1993,1,0,0,0,1993,1994,
+  	1,0,0,0,1994,1996,3,340,170,0,1995,1997,5,183,0,0,1996,1995,1,0,0,0,1996,
+  	1997,1,0,0,0,1997,1998,1,0,0,0,1998,2000,5,164,0,0,1999,2001,5,183,0,
+  	0,2000,1999,1,0,0,0,2000,2001,1,0,0,0,2001,2002,1,0,0,0,2002,2004,3,244,
+  	122,0,2003,2005,5,183,0,0,2004,2003,1,0,0,0,2004,2005,1,0,0,0,2005,2007,
+  	1,0,0,0,2006,1990,1,0,0,0,2007,2010,1,0,0,0,2008,2006,1,0,0,0,2008,2009,
+  	1,0,0,0,2009,2012,1,0,0,0,2010,2008,1,0,0,0,2011,1978,1,0,0,0,2011,2012,
+  	1,0,0,0,2012,2013,1,0,0,0,2013,2014,5,10,0,0,2014,221,1,0,0,0,2015,2017,
+  	5,164,0,0,2016,2018,5,183,0,0,2017,2016,1,0,0,0,2017,2018,1,0,0,0,2018,
+  	2019,1,0,0,0,2019,2033,3,242,121,0,2020,2022,5,183,0,0,2021,2020,1,0,
+  	0,0,2021,2022,1,0,0,0,2022,2023,1,0,0,0,2023,2025,5,11,0,0,2024,2026,
+  	5,164,0,0,2025,2024,1,0,0,0,2025,2026,1,0,0,0,2026,2028,1,0,0,0,2027,
+  	2029,5,183,0,0,2028,2027,1,0,0,0,2028,2029,1,0,0,0,2029,2030,1,0,0,0,
+  	2030,2032,3,242,121,0,2031,2021,1,0,0,0,2032,2035,1,0,0,0,2033,2031,1,
+  	0,0,0,2033,2034,1,0,0,0,2034,223,1,0,0,0,2035,2033,1,0,0,0,2036,2038,
+  	5,164,0,0,2037,2039,5,183,0,0,2038,2037,1,0,0,0,2038,2039,1,0,0,0,2039,
+  	2040,1,0,0,0,2040,2057,3,240,120,0,2041,2043,5,183,0,0,2042,2041,1,0,
+  	0,0,2042,2043,1,0,0,0,2043,2049,1,0,0,0,2044,2046,5,11,0,0,2045,2047,
+  	5,164,0,0,2046,2045,1,0,0,0,2046,2047,1,0,0,0,2047,2050,1,0,0,0,2048,
+  	2050,5,164,0,0,2049,2044,1,0,0,0,2049,2048,1,0,0,0,2050,2052,1,0,0,0,
+  	2051,2053,5,183,0,0,2052,2051,1,0,0,0,2052,2053,1,0,0,0,2053,2054,1,0,
+  	0,0,2054,2056,3,240,120,0,2055,2042,1,0,0,0,2056,2059,1,0,0,0,2057,2055,
+  	1,0,0,0,2057,2058,1,0,0,0,2058,225,1,0,0,0,2059,2057,1,0,0,0,2060,2065,
+  	5,161,0,0,2061,2063,5,183,0,0,2062,2061,1,0,0,0,2062,2063,1,0,0,0,2063,
+  	2064,1,0,0,0,2064,2066,3,228,114,0,2065,2062,1,0,0,0,2065,2066,1,0,0,
+  	0,2066,2071,1,0,0,0,2067,2069,5,183,0,0,2068,2067,1,0,0,0,2068,2069,1,
+  	0,0,0,2069,2070,1,0,0,0,2070,2072,3,230,115,0,2071,2068,1,0,0,0,2071,
+  	2072,1,0,0,0,2072,2077,1,0,0,0,2073,2075,5,183,0,0,2074,2073,1,0,0,0,
+  	2074,2075,1,0,0,0,2075,2076,1,0,0,0,2076,2078,3,232,116,0,2077,2074,1,
+  	0,0,0,2077,2078,1,0,0,0,2078,227,1,0,0,0,2079,2080,5,48,0,0,2080,2082,
+  	5,183,0,0,2081,2079,1,0,0,0,2081,2082,1,0,0,0,2082,2083,1,0,0,0,2083,
+  	2085,5,152,0,0,2084,2086,5,183,0,0,2085,2084,1,0,0,0,2085,2086,1,0,0,
+  	0,2086,2087,1,0,0,0,2087,2089,5,2,0,0,2088,2090,5,183,0,0,2089,2088,1,
+  	0,0,0,2089,2090,1,0,0,0,2090,2091,1,0,0,0,2091,2093,3,340,170,0,2092,
+  	2094,5,183,0,0,2093,2092,1,0,0,0,2093,2094,1,0,0,0,2094,2095,1,0,0,0,
+  	2095,2096,5,3,0,0,2096,2104,1,0,0,0,2097,2104,5,132,0,0,2098,2099,5,48,
+  	0,0,2099,2100,5,183,0,0,2100,2104,5,132,0,0,2101,2104,5,139,0,0,2102,
+  	2104,5,45,0,0,2103,2081,1,0,0,0,2103,2097,1,0,0,0,2103,2098,1,0,0,0,2103,
+  	2101,1,0,0,0,2103,2102,1,0,0,0,2104,229,1,0,0,0,2105,2107,3,236,118,0,
+  	2106,2105,1,0,0,0,2106,2107,1,0,0,0,2107,2109,1,0,0,0,2108,2110,5,183,
+  	0,0,2109,2108,1,0,0,0,2109,2110,1,0,0,0,2110,2111,1,0,0,0,2111,2113,5,
+  	165,0,0,2112,2114,5,183,0,0,2113,2112,1,0,0,0,2113,2114,1,0,0,0,2114,
+  	2116,1,0,0,0,2115,2117,3,238,119,0,2116,2115,1,0,0,0,2116,2117,1,0,0,
+  	0,2117,2120,1,0,0,0,2118,2120,3,342,171,0,2119,2106,1,0,0,0,2119,2118,
+  	1,0,0,0,2120,231,1,0,0,0,2121,2123,5,2,0,0,2122,2124,5,183,0,0,2123,2122,
+  	1,0,0,0,2123,2124,1,0,0,0,2124,2125,1,0,0,0,2125,2127,3,332,166,0,2126,
+  	2128,5,183,0,0,2127,2126,1,0,0,0,2127,2128,1,0,0,0,2128,2129,1,0,0,0,
+  	2129,2131,5,4,0,0,2130,2132,5,183,0,0,2131,2130,1,0,0,0,2131,2132,1,0,
+  	0,0,2132,2133,1,0,0,0,2133,2145,3,332,166,0,2134,2136,5,183,0,0,2135,
+  	2134,1,0,0,0,2135,2136,1,0,0,0,2136,2137,1,0,0,0,2137,2139,5,11,0,0,2138,
+  	2140,5,183,0,0,2139,2138,1,0,0,0,2139,2140,1,0,0,0,2140,2141,1,0,0,0,
+  	2141,2143,3,202,101,0,2142,2144,5,183,0,0,2143,2142,1,0,0,0,2143,2144,
+  	1,0,0,0,2144,2146,1,0,0,0,2145,2135,1,0,0,0,2145,2146,1,0,0,0,2146,2166,
+  	1,0,0,0,2147,2149,5,183,0,0,2148,2147,1,0,0,0,2148,2149,1,0,0,0,2149,
+  	2150,1,0,0,0,2150,2152,5,11,0,0,2151,2153,5,183,0,0,2152,2151,1,0,0,0,
+  	2152,2153,1,0,0,0,2153,2154,1,0,0,0,2154,2156,3,234,117,0,2155,2157,5,
+  	183,0,0,2156,2155,1,0,0,0,2156,2157,1,0,0,0,2157,2158,1,0,0,0,2158,2160,
+  	5,4,0,0,2159,2161,5,183,0,0,2160,2159,1,0,0,0,2160,2161,1,0,0,0,2161,
+  	2162,1,0,0,0,2162,2164,3,234,117,0,2163,2165,5,183,0,0,2164,2163,1,0,
+  	0,0,2164,2165,1,0,0,0,2165,2167,1,0,0,0,2166,2148,1,0,0,0,2166,2167,1,
+  	0,0,0,2167,2168,1,0,0,0,2168,2169,5,3,0,0,2169,233,1,0,0,0,2170,2172,
+  	5,9,0,0,2171,2173,5,183,0,0,2172,2171,1,0,0,0,2172,2173,1,0,0,0,2173,
+  	2175,1,0,0,0,2174,2176,3,190,95,0,2175,2174,1,0,0,0,2175,2176,1,0,0,0,
+  	2176,2178,1,0,0,0,2177,2179,5,183,0,0,2178,2177,1,0,0,0,2178,2179,1,0,
+  	0,0,2179,2180,1,0,0,0,2180,2181,5,10,0,0,2181,235,1,0,0,0,2182,2183,5,
+  	170,0,0,2183,237,1,0,0,0,2184,2185,5,170,0,0,2185,239,1,0,0,0,2186,2187,
+  	3,346,173,0,2187,241,1,0,0,0,2188,2189,3,346,173,0,2189,243,1,0,0,0,2190,
+  	2191,3,246,123,0,2191,245,1,0,0,0,2192,2199,3,248,124,0,2193,2194,5,183,
+  	0,0,2194,2195,5,119,0,0,2195,2196,5,183,0,0,2196,2198,3,248,124,0,2197,
+  	2193,1,0,0,0,2198,2201,1,0,0,0,2199,2197,1,0,0,0,2199,2200,1,0,0,0,2200,
+  	247,1,0,0,0,2201,2199,1,0,0,0,2202,2209,3,250,125,0,2203,2204,5,183,0,
+  	0,2204,2205,5,153,0,0,2205,2206,5,183,0,0,2206,2208,3,250,125,0,2207,
+  	2203,1,0,0,0,2208,2211,1,0,0,0,2209,2207,1,0,0,0,2209,2210,1,0,0,0,2210,
+  	249,1,0,0,0,2211,2209,1,0,0,0,2212,2219,3,252,126,0,2213,2214,5,183,0,
+  	0,2214,2215,5,50,0,0,2215,2216,5,183,0,0,2216,2218,3,252,126,0,2217,2213,
+  	1,0,0,0,2218,2221,1,0,0,0,2219,2217,1,0,0,0,2219,2220,1,0,0,0,2220,251,
+  	1,0,0,0,2221,2219,1,0,0,0,2222,2224,5,113,0,0,2223,2225,5,183,0,0,2224,
+  	2223,1,0,0,0,2224,2225,1,0,0,0,2225,2227,1,0,0,0,2226,2222,1,0,0,0,2227,
+  	2230,1,0,0,0,2228,2226,1,0,0,0,2228,2229,1,0,0,0,2229,2231,1,0,0,0,2230,
+  	2228,1,0,0,0,2231,2232,3,254,127,0,2232,253,1,0,0,0,2233,2243,3,258,129,
+  	0,2234,2236,5,183,0,0,2235,2234,1,0,0,0,2235,2236,1,0,0,0,2236,2237,1,
+  	0,0,0,2237,2239,3,256,128,0,2238,2240,5,183,0,0,2239,2238,1,0,0,0,2239,
+  	2240,1,0,0,0,2240,2241,1,0,0,0,2241,2242,3,258,129,0,2242,2244,1,0,0,
+  	0,2243,2235,1,0,0,0,2243,2244,1,0,0,0,2244,2282,1,0,0,0,2245,2247,3,258,
+  	129,0,2246,2248,5,183,0,0,2247,2246,1,0,0,0,2247,2248,1,0,0,0,2248,2249,
+  	1,0,0,0,2249,2251,5,163,0,0,2250,2252,5,183,0,0,2251,2250,1,0,0,0,2251,
+  	2252,1,0,0,0,2252,2253,1,0,0,0,2253,2254,3,258,129,0,2254,2255,1,0,0,
+  	0,2255,2256,6,127,-1,0,2256,2282,1,0,0,0,2257,2259,3,258,129,0,2258,2260,
+  	5,183,0,0,2259,2258,1,0,0,0,2259,2260,1,0,0,0,2260,2261,1,0,0,0,2261,
+  	2263,3,256,128,0,2262,2264,5,183,0,0,2263,2262,1,0,0,0,2263,2264,1,0,
+  	0,0,2264,2265,1,0,0,0,2265,2275,3,258,129,0,2266,2268,5,183,0,0,2267,
+  	2266,1,0,0,0,2267,2268,1,0,0,0,2268,2269,1,0,0,0,2269,2271,3,256,128,
+  	0,2270,2272,5,183,0,0,2271,2270,1,0,0,0,2271,2272,1,0,0,0,2272,2273,1,
+  	0,0,0,2273,2274,3,258,129,0,2274,2276,1,0,0,0,2275,2267,1,0,0,0,2276,
+  	2277,1,0,0,0,2277,2275,1,0,0,0,2277,2278,1,0,0,0,2278,2279,1,0,0,0,2279,
+  	2280,6,127,-1,0,2280,2282,1,0,0,0,2281,2233,1,0,0,0,2281,2245,1,0,0,0,
+  	2281,2257,1,0,0,0,2282,255,1,0,0,0,2283,2284,7,2,0,0,2284,257,1,0,0,0,
+  	2285,2296,3,260,130,0,2286,2288,5,183,0,0,2287,2286,1,0,0,0,2287,2288,
+  	1,0,0,0,2288,2289,1,0,0,0,2289,2291,5,11,0,0,2290,2292,5,183,0,0,2291,
+  	2290,1,0,0,0,2291,2292,1,0,0,0,2292,2293,1,0,0,0,2293,2295,3,260,130,
+  	0,2294,2287,1,0,0,0,2295,2298,1,0,0,0,2296,2294,1,0,0,0,2296,2297,1,0,
+  	0,0,2297,259,1,0,0,0,2298,2296,1,0,0,0,2299,2310,3,262,131,0,2300,2302,
+  	5,183,0,0,2301,2300,1,0,0,0,2301,2302,1,0,0,0,2302,2303,1,0,0,0,2303,
+  	2305,5,17,0,0,2304,2306,5,183,0,0,2305,2304,1,0,0,0,2305,2306,1,0,0,0,
+  	2306,2307,1,0,0,0,2307,2309,3,262,131,0,2308,2301,1,0,0,0,2309,2312,1,
+  	0,0,0,2310,2308,1,0,0,0,2310,2311,1,0,0,0,2311,261,1,0,0,0,2312,2310,
+  	1,0,0,0,2313,2325,3,266,133,0,2314,2316,5,183,0,0,2315,2314,1,0,0,0,2315,
+  	2316,1,0,0,0,2316,2317,1,0,0,0,2317,2319,3,264,132,0,2318,2320,5,183,
+  	0,0,2319,2318,1,0,0,0,2319,2320,1,0,0,0,2320,2321,1,0,0,0,2321,2322,3,
+  	266,133,0,2322,2324,1,0,0,0,2323,2315,1,0,0,0,2324,2327,1,0,0,0,2325,
+  	2323,1,0,0,0,2325,2326,1,0,0,0,2326,263,1,0,0,0,2327,2325,1,0,0,0,2328,
+  	2329,7,3,0,0,2329,265,1,0,0,0,2330,2342,3,270,135,0,2331,2333,5,183,0,
+  	0,2332,2331,1,0,0,0,2332,2333,1,0,0,0,2333,2334,1,0,0,0,2334,2336,3,268,
+  	134,0,2335,2337,5,183,0,0,2336,2335,1,0,0,0,2336,2337,1,0,0,0,2337,2338,
+  	1,0,0,0,2338,2339,3,270,135,0,2339,2341,1,0,0,0,2340,2332,1,0,0,0,2341,
+  	2344,1,0,0,0,2342,2340,1,0,0,0,2342,2343,1,0,0,0,2343,267,1,0,0,0,2344,
+  	2342,1,0,0,0,2345,2346,7,4,0,0,2346,269,1,0,0,0,2347,2359,3,274,137,0,
+  	2348,2350,5,183,0,0,2349,2348,1,0,0,0,2349,2350,1,0,0,0,2350,2351,1,0,
+  	0,0,2351,2353,3,272,136,0,2352,2354,5,183,0,0,2353,2352,1,0,0,0,2353,
+  	2354,1,0,0,0,2354,2355,1,0,0,0,2355,2356,3,274,137,0,2356,2358,1,0,0,
+  	0,2357,2349,1,0,0,0,2358,2361,1,0,0,0,2359,2357,1,0,0,0,2359,2360,1,0,
+  	0,0,2360,271,1,0,0,0,2361,2359,1,0,0,0,2362,2363,7,5,0,0,2363,273,1,0,
+  	0,0,2364,2375,3,276,138,0,2365,2367,5,183,0,0,2366,2365,1,0,0,0,2366,
+  	2367,1,0,0,0,2367,2368,1,0,0,0,2368,2370,5,23,0,0,2369,2371,5,183,0,0,
+  	2370,2369,1,0,0,0,2370,2371,1,0,0,0,2371,2372,1,0,0,0,2372,2374,3,276,
+  	138,0,2373,2366,1,0,0,0,2374,2377,1,0,0,0,2375,2373,1,0,0,0,2375,2376,
+  	1,0,0,0,2376,275,1,0,0,0,2377,2375,1,0,0,0,2378,2386,3,286,143,0,2379,
+  	2387,3,280,140,0,2380,2382,3,278,139,0,2381,2380,1,0,0,0,2382,2383,1,
+  	0,0,0,2383,2381,1,0,0,0,2383,2384,1,0,0,0,2384,2387,1,0,0,0,2385,2387,
+  	3,284,142,0,2386,2379,1,0,0,0,2386,2381,1,0,0,0,2386,2385,1,0,0,0,2386,
+  	2387,1,0,0,0,2387,277,1,0,0,0,2388,2389,5,183,0,0,2389,2391,5,96,0,0,
+  	2390,2392,5,183,0,0,2391,2390,1,0,0,0,2391,2392,1,0,0,0,2392,2393,1,0,
+  	0,0,2393,2408,3,288,144,0,2394,2395,5,7,0,0,2395,2396,3,244,122,0,2396,
+  	2397,5,8,0,0,2397,2408,1,0,0,0,2398,2400,5,7,0,0,2399,2401,3,244,122,
+  	0,2400,2399,1,0,0,0,2400,2401,1,0,0,0,2401,2402,1,0,0,0,2402,2404,7,6,
+  	0,0,2403,2405,3,244,122,0,2404,2403,1,0,0,0,2404,2405,1,0,0,0,2405,2406,
+  	1,0,0,0,2406,2408,5,8,0,0,2407,2388,1,0,0,0,2407,2394,1,0,0,0,2407,2398,
+  	1,0,0,0,2408,279,1,0,0,0,2409,2421,3,282,141,0,2410,2411,5,183,0,0,2411,
+  	2412,5,134,0,0,2412,2413,5,183,0,0,2413,2421,5,150,0,0,2414,2415,5,183,
+  	0,0,2415,2416,5,81,0,0,2416,2417,5,183,0,0,2417,2421,5,150,0,0,2418,2419,
+  	5,183,0,0,2419,2421,5,65,0,0,2420,2409,1,0,0,0,2420,2410,1,0,0,0,2420,
+  	2414,1,0,0,0,2420,2418,1,0,0,0,2421,2423,1,0,0,0,2422,2424,5,183,0,0,
+  	2423,2422,1,0,0,0,2423,2424,1,0,0,0,2424,2425,1,0,0,0,2425,2426,3,288,
+  	144,0,2426,281,1,0,0,0,2427,2429,5,183,0,0,2428,2427,1,0,0,0,2428,2429,
+  	1,0,0,0,2429,2430,1,0,0,0,2430,2431,5,24,0,0,2431,283,1,0,0,0,2432,2433,
+  	5,183,0,0,2433,2434,5,99,0,0,2434,2435,5,183,0,0,2435,2443,5,115,0,0,
+  	2436,2437,5,183,0,0,2437,2438,5,99,0,0,2438,2439,5,183,0,0,2439,2440,
+  	5,113,0,0,2440,2441,5,183,0,0,2441,2443,5,115,0,0,2442,2432,1,0,0,0,2442,
+  	2436,1,0,0,0,2443,285,1,0,0,0,2444,2446,5,166,0,0,2445,2447,5,183,0,0,
+  	2446,2445,1,0,0,0,2446,2447,1,0,0,0,2447,2449,1,0,0,0,2448,2444,1,0,0,
+  	0,2449,2452,1,0,0,0,2450,2448,1,0,0,0,2450,2451,1,0,0,0,2451,2453,1,0,
+  	0,0,2452,2450,1,0,0,0,2453,2458,3,288,144,0,2454,2456,5,183,0,0,2455,
+  	2454,1,0,0,0,2455,2456,1,0,0,0,2456,2457,1,0,0,0,2457,2459,5,167,0,0,
+  	2458,2455,1,0,0,0,2458,2459,1,0,0,0,2459,287,1,0,0,0,2460,2467,3,290,
+  	145,0,2461,2463,5,183,0,0,2462,2461,1,0,0,0,2462,2463,1,0,0,0,2463,2464,
+  	1,0,0,0,2464,2466,3,326,163,0,2465,2462,1,0,0,0,2466,2469,1,0,0,0,2467,
+  	2465,1,0,0,0,2467,2468,1,0,0,0,2468,289,1,0,0,0,2469,2467,1,0,0,0,2470,
+  	2480,3,298,149,0,2471,2480,3,336,168,0,2472,2480,3,328,164,0,2473,2480,
+  	3,310,155,0,2474,2480,3,312,156,0,2475,2480,3,322,161,0,2476,2480,3,324,
+  	162,0,2477,2480,3,332,166,0,2478,2480,3,292,146,0,2479,2470,1,0,0,0,2479,
+  	2471,1,0,0,0,2479,2472,1,0,0,0,2479,2473,1,0,0,0,2479,2474,1,0,0,0,2479,
+  	2475,1,0,0,0,2479,2476,1,0,0,0,2479,2477,1,0,0,0,2479,2478,1,0,0,0,2480,
+  	291,1,0,0,0,2481,2483,5,48,0,0,2482,2484,5,183,0,0,2483,2482,1,0,0,0,
+  	2483,2484,1,0,0,0,2484,2485,1,0,0,0,2485,2487,5,2,0,0,2486,2488,5,183,
+  	0,0,2487,2486,1,0,0,0,2487,2488,1,0,0,0,2488,2489,1,0,0,0,2489,2491,3,
+  	294,147,0,2490,2492,5,183,0,0,2491,2490,1,0,0,0,2491,2492,1,0,0,0,2492,
+  	2493,1,0,0,0,2493,2494,5,3,0,0,2494,2538,1,0,0,0,2495,2497,5,46,0,0,2496,
+  	2498,5,183,0,0,2497,2496,1,0,0,0,2497,2498,1,0,0,0,2498,2499,1,0,0,0,
+  	2499,2501,5,2,0,0,2500,2502,5,183,0,0,2501,2500,1,0,0,0,2501,2502,1,0,
+  	0,0,2502,2503,1,0,0,0,2503,2505,3,294,147,0,2504,2506,5,183,0,0,2505,
+  	2504,1,0,0,0,2505,2506,1,0,0,0,2506,2507,1,0,0,0,2507,2508,5,3,0,0,2508,
+  	2538,1,0,0,0,2509,2511,5,114,0,0,2510,2512,5,183,0,0,2511,2510,1,0,0,
+  	0,2511,2512,1,0,0,0,2512,2513,1,0,0,0,2513,2515,5,2,0,0,2514,2516,5,183,
+  	0,0,2515,2514,1,0,0,0,2515,2516,1,0,0,0,2516,2517,1,0,0,0,2517,2519,3,
+  	294,147,0,2518,2520,5,183,0,0,2519,2518,1,0,0,0,2519,2520,1,0,0,0,2520,
+  	2521,1,0,0,0,2521,2522,5,3,0,0,2522,2538,1,0,0,0,2523,2525,5,154,0,0,
+  	2524,2526,5,183,0,0,2525,2524,1,0,0,0,2525,2526,1,0,0,0,2526,2527,1,0,
+  	0,0,2527,2529,5,2,0,0,2528,2530,5,183,0,0,2529,2528,1,0,0,0,2529,2530,
+  	1,0,0,0,2530,2531,1,0,0,0,2531,2533,3,294,147,0,2532,2534,5,183,0,0,2533,
+  	2532,1,0,0,0,2533,2534,1,0,0,0,2534,2535,1,0,0,0,2535,2536,5,3,0,0,2536,
+  	2538,1,0,0,0,2537,2481,1,0,0,0,2537,2495,1,0,0,0,2537,2509,1,0,0,0,2537,
+  	2523,1,0,0,0,2538,293,1,0,0,0,2539,2540,3,296,148,0,2540,2541,5,183,0,
+  	0,2541,2542,3,202,101,0,2542,295,1,0,0,0,2543,2544,3,332,166,0,2544,2545,
+  	5,183,0,0,2545,2546,5,96,0,0,2546,2547,5,183,0,0,2547,2548,3,244,122,
+  	0,2548,297,1,0,0,0,2549,2556,3,334,167,0,2550,2556,5,168,0,0,2551,2556,
+  	3,300,150,0,2552,2556,5,115,0,0,2553,2556,3,302,151,0,2554,2556,3,306,
+  	153,0,2555,2549,1,0,0,0,2555,2550,1,0,0,0,2555,2551,1,0,0,0,2555,2552,
+  	1,0,0,0,2555,2553,1,0,0,0,2555,2554,1,0,0,0,2556,299,1,0,0,0,2557,2558,
+  	7,7,0,0,2558,301,1,0,0,0,2559,2561,5,7,0,0,2560,2562,5,183,0,0,2561,2560,
+  	1,0,0,0,2561,2562,1,0,0,0,2562,2576,1,0,0,0,2563,2565,3,244,122,0,2564,
+  	2566,5,183,0,0,2565,2564,1,0,0,0,2565,2566,1,0,0,0,2566,2573,1,0,0,0,
+  	2567,2569,3,304,152,0,2568,2570,5,183,0,0,2569,2568,1,0,0,0,2569,2570,
+  	1,0,0,0,2570,2572,1,0,0,0,2571,2567,1,0,0,0,2572,2575,1,0,0,0,2573,2571,
+  	1,0,0,0,2573,2574,1,0,0,0,2574,2577,1,0,0,0,2575,2573,1,0,0,0,2576,2563,
+  	1,0,0,0,2576,2577,1,0,0,0,2577,2578,1,0,0,0,2578,2579,5,8,0,0,2579,303,
+  	1,0,0,0,2580,2582,5,4,0,0,2581,2583,5,183,0,0,2582,2581,1,0,0,0,2582,
+  	2583,1,0,0,0,2583,2585,1,0,0,0,2584,2586,3,244,122,0,2585,2584,1,0,0,
+  	0,2585,2586,1,0,0,0,2586,305,1,0,0,0,2587,2589,5,9,0,0,2588,2590,5,183,
+  	0,0,2589,2588,1,0,0,0,2589,2590,1,0,0,0,2590,2591,1,0,0,0,2591,2593,3,
+  	308,154,0,2592,2594,5,183,0,0,2593,2592,1,0,0,0,2593,2594,1,0,0,0,2594,
+  	2605,1,0,0,0,2595,2597,5,4,0,0,2596,2598,5,183,0,0,2597,2596,1,0,0,0,
+  	2597,2598,1,0,0,0,2598,2599,1,0,0,0,2599,2601,3,308,154,0,2600,2602,5,
+  	183,0,0,2601,2600,1,0,0,0,2601,2602,1,0,0,0,2602,2604,1,0,0,0,2603,2595,
+  	1,0,0,0,2604,2607,1,0,0,0,2605,2603,1,0,0,0,2605,2606,1,0,0,0,2606,2608,
+  	1,0,0,0,2607,2605,1,0,0,0,2608,2609,5,10,0,0,2609,307,1,0,0,0,2610,2613,
+  	3,348,174,0,2611,2613,5,168,0,0,2612,2610,1,0,0,0,2612,2611,1,0,0,0,2613,
+  	2615,1,0,0,0,2614,2616,5,183,0,0,2615,2614,1,0,0,0,2615,2616,1,0,0,0,
+  	2616,2617,1,0,0,0,2617,2619,5,164,0,0,2618,2620,5,183,0,0,2619,2618,1,
+  	0,0,0,2619,2620,1,0,0,0,2620,2621,1,0,0,0,2621,2622,3,244,122,0,2622,
+  	309,1,0,0,0,2623,2625,5,2,0,0,2624,2626,5,183,0,0,2625,2624,1,0,0,0,2625,
+  	2626,1,0,0,0,2626,2627,1,0,0,0,2627,2629,3,244,122,0,2628,2630,5,183,
+  	0,0,2629,2628,1,0,0,0,2629,2630,1,0,0,0,2630,2631,1,0,0,0,2631,2632,5,
+  	3,0,0,2632,311,1,0,0,0,2633,2635,5,67,0,0,2634,2636,5,183,0,0,2635,2634,
+  	1,0,0,0,2635,2636,1,0,0,0,2636,2637,1,0,0,0,2637,2639,5,2,0,0,2638,2640,
+  	5,183,0,0,2639,2638,1,0,0,0,2639,2640,1,0,0,0,2640,2641,1,0,0,0,2641,
+  	2643,5,161,0,0,2642,2644,5,183,0,0,2643,2642,1,0,0,0,2643,2644,1,0,0,
+  	0,2644,2645,1,0,0,0,2645,2711,5,3,0,0,2646,2648,5,59,0,0,2647,2649,5,
+  	183,0,0,2648,2647,1,0,0,0,2648,2649,1,0,0,0,2649,2650,1,0,0,0,2650,2652,
+  	5,2,0,0,2651,2653,5,183,0,0,2652,2651,1,0,0,0,2652,2653,1,0,0,0,2653,
+  	2654,1,0,0,0,2654,2656,3,316,158,0,2655,2657,5,183,0,0,2656,2655,1,0,
+  	0,0,2656,2657,1,0,0,0,2657,2668,1,0,0,0,2658,2660,5,51,0,0,2659,2661,
+  	5,183,0,0,2660,2659,1,0,0,0,2660,2661,1,0,0,0,2661,2662,1,0,0,0,2662,
+  	2669,3,114,57,0,2663,2665,5,4,0,0,2664,2666,5,183,0,0,2665,2664,1,0,0,
+  	0,2665,2666,1,0,0,0,2666,2667,1,0,0,0,2667,2669,3,316,158,0,2668,2658,
+  	1,0,0,0,2668,2663,1,0,0,0,2669,2671,1,0,0,0,2670,2672,5,183,0,0,2671,
+  	2670,1,0,0,0,2671,2672,1,0,0,0,2672,2673,1,0,0,0,2673,2674,5,3,0,0,2674,
+  	2711,1,0,0,0,2675,2677,3,314,157,0,2676,2678,5,183,0,0,2677,2676,1,0,
+  	0,0,2677,2678,1,0,0,0,2678,2679,1,0,0,0,2679,2681,5,2,0,0,2680,2682,5,
+  	183,0,0,2681,2680,1,0,0,0,2681,2682,1,0,0,0,2682,2687,1,0,0,0,2683,2685,
+  	5,77,0,0,2684,2686,5,183,0,0,2685,2684,1,0,0,0,2685,2686,1,0,0,0,2686,
+  	2688,1,0,0,0,2687,2683,1,0,0,0,2687,2688,1,0,0,0,2688,2706,1,0,0,0,2689,
+  	2691,3,316,158,0,2690,2692,5,183,0,0,2691,2690,1,0,0,0,2691,2692,1,0,
+  	0,0,2692,2703,1,0,0,0,2693,2695,5,4,0,0,2694,2696,5,183,0,0,2695,2694,
+  	1,0,0,0,2695,2696,1,0,0,0,2696,2697,1,0,0,0,2697,2699,3,316,158,0,2698,
+  	2700,5,183,0,0,2699,2698,1,0,0,0,2699,2700,1,0,0,0,2700,2702,1,0,0,0,
+  	2701,2693,1,0,0,0,2702,2705,1,0,0,0,2703,2701,1,0,0,0,2703,2704,1,0,0,
+  	0,2704,2707,1,0,0,0,2705,2703,1,0,0,0,2706,2689,1,0,0,0,2706,2707,1,0,
+  	0,0,2707,2708,1,0,0,0,2708,2709,5,3,0,0,2709,2711,1,0,0,0,2710,2633,1,
+  	0,0,0,2710,2646,1,0,0,0,2710,2675,1,0,0,0,2711,313,1,0,0,0,2712,2713,
+  	3,348,174,0,2713,315,1,0,0,0,2714,2716,3,348,174,0,2715,2717,5,183,0,
+  	0,2716,2715,1,0,0,0,2716,2717,1,0,0,0,2717,2718,1,0,0,0,2718,2719,5,164,
+  	0,0,2719,2721,5,6,0,0,2720,2722,5,183,0,0,2721,2720,1,0,0,0,2721,2722,
+  	1,0,0,0,2722,2724,1,0,0,0,2723,2714,1,0,0,0,2723,2724,1,0,0,0,2724,2725,
+  	1,0,0,0,2725,2728,3,244,122,0,2726,2728,3,318,159,0,2727,2723,1,0,0,0,
+  	2727,2726,1,0,0,0,2728,317,1,0,0,0,2729,2731,3,320,160,0,2730,2732,5,
+  	183,0,0,2731,2730,1,0,0,0,2731,2732,1,0,0,0,2732,2733,1,0,0,0,2733,2734,
+  	5,166,0,0,2734,2736,5,15,0,0,2735,2737,5,183,0,0,2736,2735,1,0,0,0,2736,
+  	2737,1,0,0,0,2737,2738,1,0,0,0,2738,2740,3,244,122,0,2739,2741,5,183,
+  	0,0,2740,2739,1,0,0,0,2740,2741,1,0,0,0,2741,319,1,0,0,0,2742,2767,3,
+  	348,174,0,2743,2745,5,2,0,0,2744,2746,5,183,0,0,2745,2744,1,0,0,0,2745,
+  	2746,1,0,0,0,2746,2747,1,0,0,0,2747,2749,3,348,174,0,2748,2750,5,183,
+  	0,0,2749,2748,1,0,0,0,2749,2750,1,0,0,0,2750,2761,1,0,0,0,2751,2753,5,
+  	4,0,0,2752,2754,5,183,0,0,2753,2752,1,0,0,0,2753,2754,1,0,0,0,2754,2755,
+  	1,0,0,0,2755,2757,3,348,174,0,2756,2758,5,183,0,0,2757,2756,1,0,0,0,2757,
+  	2758,1,0,0,0,2758,2760,1,0,0,0,2759,2751,1,0,0,0,2760,2763,1,0,0,0,2761,
+  	2759,1,0,0,0,2761,2762,1,0,0,0,2762,2764,1,0,0,0,2763,2761,1,0,0,0,2764,
+  	2765,5,3,0,0,2765,2767,1,0,0,0,2766,2742,1,0,0,0,2766,2743,1,0,0,0,2767,
+  	321,1,0,0,0,2768,2773,3,212,106,0,2769,2771,5,183,0,0,2770,2769,1,0,0,
+  	0,2770,2771,1,0,0,0,2771,2772,1,0,0,0,2772,2774,3,214,107,0,2773,2770,
+  	1,0,0,0,2774,2775,1,0,0,0,2775,2773,1,0,0,0,2775,2776,1,0,0,0,2776,323,
+  	1,0,0,0,2777,2779,7,8,0,0,2778,2780,5,183,0,0,2779,2778,1,0,0,0,2779,
+  	2780,1,0,0,0,2780,2781,1,0,0,0,2781,2783,5,9,0,0,2782,2784,5,183,0,0,
+  	2783,2782,1,0,0,0,2783,2784,1,0,0,0,2784,2785,1,0,0,0,2785,2787,5,106,
+  	0,0,2786,2788,5,183,0,0,2787,2786,1,0,0,0,2787,2788,1,0,0,0,2788,2789,
+  	1,0,0,0,2789,2794,3,204,102,0,2790,2792,5,183,0,0,2791,2790,1,0,0,0,2791,
+  	2792,1,0,0,0,2792,2793,1,0,0,0,2793,2795,3,202,101,0,2794,2791,1,0,0,
+  	0,2794,2795,1,0,0,0,2795,2800,1,0,0,0,2796,2798,5,183,0,0,2797,2796,1,
+  	0,0,0,2797,2798,1,0,0,0,2798,2799,1,0,0,0,2799,2801,3,166,83,0,2800,2797,
+  	1,0,0,0,2800,2801,1,0,0,0,2801,2803,1,0,0,0,2802,2804,5,183,0,0,2803,
+  	2802,1,0,0,0,2803,2804,1,0,0,0,2804,2805,1,0,0,0,2805,2806,5,10,0,0,2806,
+  	325,1,0,0,0,2807,2809,5,5,0,0,2808,2810,5,183,0,0,2809,2808,1,0,0,0,2809,
+  	2810,1,0,0,0,2810,2813,1,0,0,0,2811,2814,3,340,170,0,2812,2814,5,161,
+  	0,0,2813,2811,1,0,0,0,2813,2812,1,0,0,0,2814,327,1,0,0,0,2815,2820,5,
+  	58,0,0,2816,2818,5,183,0,0,2817,2816,1,0,0,0,2817,2818,1,0,0,0,2818,2819,
+  	1,0,0,0,2819,2821,3,330,165,0,2820,2817,1,0,0,0,2821,2822,1,0,0,0,2822,
+  	2820,1,0,0,0,2822,2823,1,0,0,0,2823,2838,1,0,0,0,2824,2826,5,58,0,0,2825,
+  	2827,5,183,0,0,2826,2825,1,0,0,0,2826,2827,1,0,0,0,2827,2828,1,0,0,0,
+  	2828,2833,3,244,122,0,2829,2831,5,183,0,0,2830,2829,1,0,0,0,2830,2831,
+  	1,0,0,0,2831,2832,1,0,0,0,2832,2834,3,330,165,0,2833,2830,1,0,0,0,2834,
+  	2835,1,0,0,0,2835,2833,1,0,0,0,2835,2836,1,0,0,0,2836,2838,1,0,0,0,2837,
+  	2815,1,0,0,0,2837,2824,1,0,0,0,2838,2847,1,0,0,0,2839,2841,5,183,0,0,
+  	2840,2839,1,0,0,0,2840,2841,1,0,0,0,2841,2842,1,0,0,0,2842,2844,5,79,
+  	0,0,2843,2845,5,183,0,0,2844,2843,1,0,0,0,2844,2845,1,0,0,0,2845,2846,
+  	1,0,0,0,2846,2848,3,244,122,0,2847,2840,1,0,0,0,2847,2848,1,0,0,0,2848,
+  	2850,1,0,0,0,2849,2851,5,183,0,0,2850,2849,1,0,0,0,2850,2851,1,0,0,0,
+  	2851,2852,1,0,0,0,2852,2853,5,80,0,0,2853,329,1,0,0,0,2854,2856,5,148,
+  	0,0,2855,2857,5,183,0,0,2856,2855,1,0,0,0,2856,2857,1,0,0,0,2857,2858,
+  	1,0,0,0,2858,2860,3,244,122,0,2859,2861,5,183,0,0,2860,2859,1,0,0,0,2860,
+  	2861,1,0,0,0,2861,2862,1,0,0,0,2862,2864,5,137,0,0,2863,2865,5,183,0,
+  	0,2864,2863,1,0,0,0,2864,2865,1,0,0,0,2865,2866,1,0,0,0,2866,2867,3,244,
+  	122,0,2867,331,1,0,0,0,2868,2869,3,348,174,0,2869,333,1,0,0,0,2870,2873,
+  	3,344,172,0,2871,2873,3,342,171,0,2872,2870,1,0,0,0,2872,2871,1,0,0,0,
+  	2873,335,1,0,0,0,2874,2877,5,25,0,0,2875,2878,3,348,174,0,2876,2878,5,
+  	170,0,0,2877,2875,1,0,0,0,2877,2876,1,0,0,0,2878,337,1,0,0,0,2879,2881,
+  	3,290,145,0,2880,2882,5,183,0,0,2881,2880,1,0,0,0,2881,2882,1,0,0,0,2882,
+  	2883,1,0,0,0,2883,2884,3,326,163,0,2884,339,1,0,0,0,2885,2886,3,346,173,
+  	0,2886,341,1,0,0,0,2887,2888,5,170,0,0,2888,343,1,0,0,0,2889,2890,7,9,
+  	0,0,2890,345,1,0,0,0,2891,2892,3,348,174,0,2892,347,1,0,0,0,2893,2899,
+  	5,179,0,0,2894,2895,5,182,0,0,2895,2899,6,174,-1,0,2896,2899,5,171,0,
+  	0,2897,2899,3,350,175,0,2898,2893,1,0,0,0,2898,2894,1,0,0,0,2898,2896,
+  	1,0,0,0,2898,2897,1,0,0,0,2899,349,1,0,0,0,2900,2901,7,10,0,0,2901,351,
+  	1,0,0,0,2902,2903,7,11,0,0,2903,353,1,0,0,0,2904,2905,7,12,0,0,2905,355,
+  	1,0,0,0,2906,2907,7,13,0,0,2907,357,1,0,0,0,495,360,364,369,373,378,381,
+  	385,388,412,418,425,429,433,437,440,444,448,452,457,461,463,470,474,483,
+  	488,498,502,506,511,524,528,536,540,544,548,556,560,564,568,583,588,594,
+  	598,601,604,610,614,619,622,627,631,635,640,655,659,666,686,690,693,696,
+  	699,702,706,711,715,725,729,734,739,744,750,754,758,763,770,774,778,781,
+  	798,802,806,810,814,817,820,828,837,841,846,850,854,858,862,864,868,872,
+  	874,882,887,891,895,899,903,907,912,930,937,950,957,973,977,986,994,997,
+  	1007,1010,1018,1021,1027,1030,1036,1051,1069,1076,1083,1094,1117,1126,
+  	1132,1136,1141,1150,1154,1159,1165,1171,1177,1181,1185,1191,1195,1199,
+  	1205,1209,1213,1219,1223,1227,1231,1235,1241,1245,1249,1253,1257,1267,
+  	1273,1280,1285,1291,1296,1313,1319,1325,1329,1333,1342,1356,1361,1366,
+  	1370,1375,1381,1386,1389,1393,1397,1401,1407,1411,1416,1421,1425,1428,
+  	1430,1434,1438,1444,1448,1453,1457,1466,1472,1480,1484,1488,1492,1499,
+  	1503,1507,1511,1514,1517,1524,1530,1534,1539,1546,1549,1552,1557,1561,
+  	1565,1570,1574,1583,1587,1592,1606,1608,1610,1615,1625,1631,1638,1651,
+  	1655,1659,1663,1668,1673,1677,1681,1685,1689,1693,1699,1703,1707,1711,
+  	1716,1722,1725,1731,1734,1740,1744,1748,1752,1756,1761,1766,1770,1775,
+  	1778,1787,1796,1801,1814,1817,1825,1829,1834,1839,1843,1848,1854,1859,
+  	1866,1870,1874,1876,1880,1882,1886,1888,1894,1900,1904,1907,1910,1916,
+  	1919,1922,1926,1932,1935,1938,1942,1946,1950,1952,1956,1958,1962,1964,
+  	1968,1970,1976,1980,1984,1988,1992,1996,2000,2004,2008,2011,2017,2021,
+  	2025,2028,2033,2038,2042,2046,2049,2052,2057,2062,2065,2068,2071,2074,
+  	2077,2081,2085,2089,2093,2103,2106,2109,2113,2116,2119,2123,2127,2131,
+  	2135,2139,2143,2145,2148,2152,2156,2160,2164,2166,2172,2175,2178,2199,
+  	2209,2219,2224,2228,2235,2239,2243,2247,2251,2259,2263,2267,2271,2277,
+  	2281,2287,2291,2296,2301,2305,2310,2315,2319,2325,2332,2336,2342,2349,
+  	2353,2359,2366,2370,2375,2383,2386,2391,2400,2404,2407,2420,2423,2428,
+  	2442,2446,2450,2455,2458,2462,2467,2479,2483,2487,2491,2497,2501,2505,
+  	2511,2515,2519,2525,2529,2533,2537,2555,2561,2565,2569,2573,2576,2582,
+  	2585,2589,2593,2597,2601,2605,2612,2615,2619,2625,2629,2635,2639,2643,
+  	2648,2652,2656,2660,2665,2668,2671,2677,2681,2685,2687,2691,2695,2699,
+  	2703,2706,2710,2716,2721,2723,2727,2731,2736,2740,2745,2749,2753,2757,
+  	2761,2766,2770,2775,2779,2783,2787,2791,2794,2797,2800,2803,2809,2813,
+  	2817,2822,2826,2830,2835,2837,2840,2844,2847,2850,2856,2860,2864,2872,
+  	2877,2881,2898
+  };
+  staticData->serializedATN = antlr4::atn::SerializedATNView(serializedATNSegment, sizeof(serializedATNSegment) / sizeof(serializedATNSegment[0]));
+
+  antlr4::atn::ATNDeserializer deserializer;
+  staticData->atn = deserializer.deserialize(staticData->serializedATN);
+
+  const size_t count = staticData->atn->getNumberOfDecisions();
+  staticData->decisionToDFA.reserve(count);
+  for (size_t i = 0; i < count; i++) { 
+    staticData->decisionToDFA.emplace_back(staticData->atn->getDecisionState(i), i);
+  }
+  cypherParserStaticData = staticData.release();
+}
+
+}
+
+CypherParser::CypherParser(TokenStream *input) : CypherParser(input, antlr4::atn::ParserATNSimulatorOptions()) {}
+
+CypherParser::CypherParser(TokenStream *input, const antlr4::atn::ParserATNSimulatorOptions &options) : Parser(input) {
+  CypherParser::initialize();
+  _interpreter = new atn::ParserATNSimulator(this, *cypherParserStaticData->atn, cypherParserStaticData->decisionToDFA, cypherParserStaticData->sharedContextCache, options);
+}
+
+CypherParser::~CypherParser() {
+  delete _interpreter;
+}
+
+const atn::ATN& CypherParser::getATN() const {
+  return *cypherParserStaticData->atn;
+}
+
+std::string CypherParser::getGrammarFileName() const {
+  return "Cypher.g4";
+}
+
+const std::vector<std::string>& CypherParser::getRuleNames() const {
+  return cypherParserStaticData->ruleNames;
+}
+
+const dfa::Vocabulary& CypherParser::getVocabulary() const {
+  return cypherParserStaticData->vocabulary;
+}
+
+antlr4::atn::SerializedATNView CypherParser::getSerializedATN() const {
+  return cypherParserStaticData->serializedATN;
+}
+
+
+//----------------- Ku_StatementsContext ------------------------------------------------------------------
+
+CypherParser::Ku_StatementsContext::Ku_StatementsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_CypherContext *> CypherParser::Ku_StatementsContext::oC_Cypher() {
+  return getRuleContexts<CypherParser::OC_CypherContext>();
+}
+
+CypherParser::OC_CypherContext* CypherParser::Ku_StatementsContext::oC_Cypher(size_t i) {
+  return getRuleContext<CypherParser::OC_CypherContext>(i);
+}
+
+tree::TerminalNode* CypherParser::Ku_StatementsContext::EOF() {
+  return getToken(CypherParser::EOF, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::Ku_StatementsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::Ku_StatementsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::Ku_StatementsContext::getRuleIndex() const {
+  return CypherParser::RuleKu_Statements;
+}
+
+
+CypherParser::Ku_StatementsContext* CypherParser::ku_Statements() {
+  Ku_StatementsContext *_localctx = _tracker.createInstance<Ku_StatementsContext>(_ctx, getState());
+  enterRule(_localctx, 0, CypherParser::RuleKu_Statements);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(358);
+    oC_Cypher();
+    setState(369);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 2, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(360);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(359);
+          match(CypherParser::SP);
+        }
+        setState(362);
+        match(CypherParser::T__0);
+        setState(364);
+        _errHandler->sync(this);
+
+        switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 1, _ctx)) {
+        case 1: {
+          setState(363);
+          match(CypherParser::SP);
+          break;
+        }
+
+        default:
+          break;
+        }
+        setState(366);
+        oC_Cypher(); 
+      }
+      setState(371);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 2, _ctx);
+    }
+    setState(373);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(372);
+      match(CypherParser::SP);
+    }
+    setState(375);
+    match(CypherParser::EOF);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_CypherContext ------------------------------------------------------------------
+
+CypherParser::OC_CypherContext::OC_CypherContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_StatementContext* CypherParser::OC_CypherContext::oC_Statement() {
+  return getRuleContext<CypherParser::OC_StatementContext>(0);
+}
+
+CypherParser::OC_AnyCypherOptionContext* CypherParser::OC_CypherContext::oC_AnyCypherOption() {
+  return getRuleContext<CypherParser::OC_AnyCypherOptionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_CypherContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_CypherContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_CypherContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Cypher;
+}
+
+
+CypherParser::OC_CypherContext* CypherParser::oC_Cypher() {
+  OC_CypherContext *_localctx = _tracker.createInstance<OC_CypherContext>(_ctx, getState());
+  enterRule(_localctx, 2, CypherParser::RuleOC_Cypher);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(378);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::EXPLAIN
+
+    || _la == CypherParser::PROFILE) {
+      setState(377);
+      oC_AnyCypherOption();
+    }
+    setState(381);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(380);
+      match(CypherParser::SP);
+    }
+
+    setState(383);
+    oC_Statement();
+    setState(388);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 7, _ctx)) {
+    case 1: {
+      setState(385);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(384);
+        match(CypherParser::SP);
+      }
+      setState(387);
+      match(CypherParser::T__0);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_StatementContext ------------------------------------------------------------------
+
+CypherParser::OC_StatementContext::OC_StatementContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_QueryContext* CypherParser::OC_StatementContext::oC_Query() {
+  return getRuleContext<CypherParser::OC_QueryContext>(0);
+}
+
+CypherParser::KU_CreateUserContext* CypherParser::OC_StatementContext::kU_CreateUser() {
+  return getRuleContext<CypherParser::KU_CreateUserContext>(0);
+}
+
+CypherParser::KU_CreateRoleContext* CypherParser::OC_StatementContext::kU_CreateRole() {
+  return getRuleContext<CypherParser::KU_CreateRoleContext>(0);
+}
+
+CypherParser::KU_CreateNodeTableContext* CypherParser::OC_StatementContext::kU_CreateNodeTable() {
+  return getRuleContext<CypherParser::KU_CreateNodeTableContext>(0);
+}
+
+CypherParser::KU_CreateRelTableContext* CypherParser::OC_StatementContext::kU_CreateRelTable() {
+  return getRuleContext<CypherParser::KU_CreateRelTableContext>(0);
+}
+
+CypherParser::KU_CreateSequenceContext* CypherParser::OC_StatementContext::kU_CreateSequence() {
+  return getRuleContext<CypherParser::KU_CreateSequenceContext>(0);
+}
+
+CypherParser::KU_CreateTypeContext* CypherParser::OC_StatementContext::kU_CreateType() {
+  return getRuleContext<CypherParser::KU_CreateTypeContext>(0);
+}
+
+CypherParser::KU_DropContext* CypherParser::OC_StatementContext::kU_Drop() {
+  return getRuleContext<CypherParser::KU_DropContext>(0);
+}
+
+CypherParser::KU_AlterTableContext* CypherParser::OC_StatementContext::kU_AlterTable() {
+  return getRuleContext<CypherParser::KU_AlterTableContext>(0);
+}
+
+CypherParser::KU_CopyFromContext* CypherParser::OC_StatementContext::kU_CopyFrom() {
+  return getRuleContext<CypherParser::KU_CopyFromContext>(0);
+}
+
+CypherParser::KU_CopyFromByColumnContext* CypherParser::OC_StatementContext::kU_CopyFromByColumn() {
+  return getRuleContext<CypherParser::KU_CopyFromByColumnContext>(0);
+}
+
+CypherParser::KU_CopyTOContext* CypherParser::OC_StatementContext::kU_CopyTO() {
+  return getRuleContext<CypherParser::KU_CopyTOContext>(0);
+}
+
+CypherParser::KU_StandaloneCallContext* CypherParser::OC_StatementContext::kU_StandaloneCall() {
+  return getRuleContext<CypherParser::KU_StandaloneCallContext>(0);
+}
+
+CypherParser::KU_CreateMacroContext* CypherParser::OC_StatementContext::kU_CreateMacro() {
+  return getRuleContext<CypherParser::KU_CreateMacroContext>(0);
+}
+
+CypherParser::KU_CommentOnContext* CypherParser::OC_StatementContext::kU_CommentOn() {
+  return getRuleContext<CypherParser::KU_CommentOnContext>(0);
+}
+
+CypherParser::KU_TransactionContext* CypherParser::OC_StatementContext::kU_Transaction() {
+  return getRuleContext<CypherParser::KU_TransactionContext>(0);
+}
+
+CypherParser::KU_ExtensionContext* CypherParser::OC_StatementContext::kU_Extension() {
+  return getRuleContext<CypherParser::KU_ExtensionContext>(0);
+}
+
+CypherParser::KU_ExportDatabaseContext* CypherParser::OC_StatementContext::kU_ExportDatabase() {
+  return getRuleContext<CypherParser::KU_ExportDatabaseContext>(0);
+}
+
+CypherParser::KU_ImportDatabaseContext* CypherParser::OC_StatementContext::kU_ImportDatabase() {
+  return getRuleContext<CypherParser::KU_ImportDatabaseContext>(0);
+}
+
+CypherParser::KU_AttachDatabaseContext* CypherParser::OC_StatementContext::kU_AttachDatabase() {
+  return getRuleContext<CypherParser::KU_AttachDatabaseContext>(0);
+}
+
+CypherParser::KU_DetachDatabaseContext* CypherParser::OC_StatementContext::kU_DetachDatabase() {
+  return getRuleContext<CypherParser::KU_DetachDatabaseContext>(0);
+}
+
+CypherParser::KU_UseDatabaseContext* CypherParser::OC_StatementContext::kU_UseDatabase() {
+  return getRuleContext<CypherParser::KU_UseDatabaseContext>(0);
+}
+
+
+size_t CypherParser::OC_StatementContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Statement;
+}
+
+
+CypherParser::OC_StatementContext* CypherParser::oC_Statement() {
+  OC_StatementContext *_localctx = _tracker.createInstance<OC_StatementContext>(_ctx, getState());
+  enterRule(_localctx, 4, CypherParser::RuleOC_Statement);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(412);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 8, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(390);
+      oC_Query();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(391);
+      kU_CreateUser();
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(392);
+      kU_CreateRole();
+      break;
+    }
+
+    case 4: {
+      enterOuterAlt(_localctx, 4);
+      setState(393);
+      kU_CreateNodeTable();
+      break;
+    }
+
+    case 5: {
+      enterOuterAlt(_localctx, 5);
+      setState(394);
+      kU_CreateRelTable();
+      break;
+    }
+
+    case 6: {
+      enterOuterAlt(_localctx, 6);
+      setState(395);
+      kU_CreateSequence();
+      break;
+    }
+
+    case 7: {
+      enterOuterAlt(_localctx, 7);
+      setState(396);
+      kU_CreateType();
+      break;
+    }
+
+    case 8: {
+      enterOuterAlt(_localctx, 8);
+      setState(397);
+      kU_Drop();
+      break;
+    }
+
+    case 9: {
+      enterOuterAlt(_localctx, 9);
+      setState(398);
+      kU_AlterTable();
+      break;
+    }
+
+    case 10: {
+      enterOuterAlt(_localctx, 10);
+      setState(399);
+      kU_CopyFrom();
+      break;
+    }
+
+    case 11: {
+      enterOuterAlt(_localctx, 11);
+      setState(400);
+      kU_CopyFromByColumn();
+      break;
+    }
+
+    case 12: {
+      enterOuterAlt(_localctx, 12);
+      setState(401);
+      kU_CopyTO();
+      break;
+    }
+
+    case 13: {
+      enterOuterAlt(_localctx, 13);
+      setState(402);
+      kU_StandaloneCall();
+      break;
+    }
+
+    case 14: {
+      enterOuterAlt(_localctx, 14);
+      setState(403);
+      kU_CreateMacro();
+      break;
+    }
+
+    case 15: {
+      enterOuterAlt(_localctx, 15);
+      setState(404);
+      kU_CommentOn();
+      break;
+    }
+
+    case 16: {
+      enterOuterAlt(_localctx, 16);
+      setState(405);
+      kU_Transaction();
+      break;
+    }
+
+    case 17: {
+      enterOuterAlt(_localctx, 17);
+      setState(406);
+      kU_Extension();
+      break;
+    }
+
+    case 18: {
+      enterOuterAlt(_localctx, 18);
+      setState(407);
+      kU_ExportDatabase();
+      break;
+    }
+
+    case 19: {
+      enterOuterAlt(_localctx, 19);
+      setState(408);
+      kU_ImportDatabase();
+      break;
+    }
+
+    case 20: {
+      enterOuterAlt(_localctx, 20);
+      setState(409);
+      kU_AttachDatabase();
+      break;
+    }
+
+    case 21: {
+      enterOuterAlt(_localctx, 21);
+      setState(410);
+      kU_DetachDatabase();
+      break;
+    }
+
+    case 22: {
+      enterOuterAlt(_localctx, 22);
+      setState(411);
+      kU_UseDatabase();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CopyFromContext ------------------------------------------------------------------
+
+CypherParser::KU_CopyFromContext::KU_CopyFromContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CopyFromContext::COPY() {
+  return getToken(CypherParser::COPY, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CopyFromContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyFromContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_CopyFromContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyFromContext::FROM() {
+  return getToken(CypherParser::FROM, 0);
+}
+
+CypherParser::KU_ScanSourceContext* CypherParser::KU_CopyFromContext::kU_ScanSource() {
+  return getRuleContext<CypherParser::KU_ScanSourceContext>(0);
+}
+
+CypherParser::KU_ColumnNamesContext* CypherParser::KU_CopyFromContext::kU_ColumnNames() {
+  return getRuleContext<CypherParser::KU_ColumnNamesContext>(0);
+}
+
+CypherParser::KU_OptionsContext* CypherParser::KU_CopyFromContext::kU_Options() {
+  return getRuleContext<CypherParser::KU_OptionsContext>(0);
+}
+
+
+size_t CypherParser::KU_CopyFromContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CopyFrom;
+}
+
+
+CypherParser::KU_CopyFromContext* CypherParser::kU_CopyFrom() {
+  KU_CopyFromContext *_localctx = _tracker.createInstance<KU_CopyFromContext>(_ctx, getState());
+  enterRule(_localctx, 6, CypherParser::RuleKU_CopyFrom);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(414);
+    match(CypherParser::COPY);
+    setState(415);
+    match(CypherParser::SP);
+    setState(416);
+    oC_SchemaName();
+    setState(418);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 9, _ctx)) {
+    case 1: {
+      setState(417);
+      kU_ColumnNames();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(420);
+    match(CypherParser::SP);
+    setState(421);
+    match(CypherParser::FROM);
+    setState(422);
+    match(CypherParser::SP);
+    setState(423);
+    kU_ScanSource();
+    setState(437);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 13, _ctx)) {
+    case 1: {
+      setState(425);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(424);
+        match(CypherParser::SP);
+      }
+      setState(427);
+      match(CypherParser::T__1);
+      setState(429);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(428);
+        match(CypherParser::SP);
+      }
+      setState(431);
+      kU_Options();
+      setState(433);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(432);
+        match(CypherParser::SP);
+      }
+      setState(435);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ColumnNamesContext ------------------------------------------------------------------
+
+CypherParser::KU_ColumnNamesContext::KU_ColumnNamesContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_ColumnNamesContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_ColumnNamesContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<CypherParser::OC_SchemaNameContext *> CypherParser::KU_ColumnNamesContext::oC_SchemaName() {
+  return getRuleContexts<CypherParser::OC_SchemaNameContext>();
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_ColumnNamesContext::oC_SchemaName(size_t i) {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(i);
+}
+
+
+size_t CypherParser::KU_ColumnNamesContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ColumnNames;
+}
+
+
+CypherParser::KU_ColumnNamesContext* CypherParser::kU_ColumnNames() {
+  KU_ColumnNamesContext *_localctx = _tracker.createInstance<KU_ColumnNamesContext>(_ctx, getState());
+  enterRule(_localctx, 8, CypherParser::RuleKU_ColumnNames);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(440);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(439);
+      match(CypherParser::SP);
+    }
+    setState(442);
+    match(CypherParser::T__1);
+    setState(444);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(443);
+      match(CypherParser::SP);
+    }
+    setState(463);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if ((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & -3185593048922849280) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 65)) & -287985230644762313) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 130)) & 5068755015275819) != 0)) {
+      setState(446);
+      oC_SchemaName();
+      setState(457);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 18, _ctx);
+      while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+        if (alt == 1) {
+          setState(448);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(447);
+            match(CypherParser::SP);
+          }
+          setState(450);
+          match(CypherParser::T__3);
+          setState(452);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(451);
+            match(CypherParser::SP);
+          }
+          setState(454);
+          oC_SchemaName(); 
+        }
+        setState(459);
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 18, _ctx);
+      }
+      setState(461);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(460);
+        match(CypherParser::SP);
+      }
+    }
+    setState(465);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ScanSourceContext ------------------------------------------------------------------
+
+CypherParser::KU_ScanSourceContext::KU_ScanSourceContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::KU_FilePathsContext* CypherParser::KU_ScanSourceContext::kU_FilePaths() {
+  return getRuleContext<CypherParser::KU_FilePathsContext>(0);
+}
+
+CypherParser::OC_QueryContext* CypherParser::KU_ScanSourceContext::oC_Query() {
+  return getRuleContext<CypherParser::OC_QueryContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_ScanSourceContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_ScanSourceContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_ParameterContext* CypherParser::KU_ScanSourceContext::oC_Parameter() {
+  return getRuleContext<CypherParser::OC_ParameterContext>(0);
+}
+
+CypherParser::OC_VariableContext* CypherParser::KU_ScanSourceContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_ScanSourceContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+CypherParser::OC_FunctionInvocationContext* CypherParser::KU_ScanSourceContext::oC_FunctionInvocation() {
+  return getRuleContext<CypherParser::OC_FunctionInvocationContext>(0);
+}
+
+
+size_t CypherParser::KU_ScanSourceContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ScanSource;
+}
+
+
+CypherParser::KU_ScanSourceContext* CypherParser::kU_ScanSource() {
+  KU_ScanSourceContext *_localctx = _tracker.createInstance<KU_ScanSourceContext>(_ctx, getState());
+  enterRule(_localctx, 10, CypherParser::RuleKU_ScanSource);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(488);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 24, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(467);
+      kU_FilePaths();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(468);
+      match(CypherParser::T__1);
+      setState(470);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(469);
+        match(CypherParser::SP);
+      }
+      setState(472);
+      oC_Query();
+      setState(474);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(473);
+        match(CypherParser::SP);
+      }
+      setState(476);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(478);
+      oC_Parameter();
+      break;
+    }
+
+    case 4: {
+      enterOuterAlt(_localctx, 4);
+      setState(479);
+      oC_Variable();
+      break;
+    }
+
+    case 5: {
+      enterOuterAlt(_localctx, 5);
+      setState(480);
+      oC_Variable();
+      setState(481);
+      match(CypherParser::T__4);
+      setState(483);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(482);
+        match(CypherParser::SP);
+      }
+      setState(485);
+      oC_SchemaName();
+      break;
+    }
+
+    case 6: {
+      enterOuterAlt(_localctx, 6);
+      setState(487);
+      oC_FunctionInvocation();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CopyFromByColumnContext ------------------------------------------------------------------
+
+CypherParser::KU_CopyFromByColumnContext::KU_CopyFromByColumnContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CopyFromByColumnContext::COPY() {
+  return getToken(CypherParser::COPY, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CopyFromByColumnContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyFromByColumnContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_CopyFromByColumnContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyFromByColumnContext::FROM() {
+  return getToken(CypherParser::FROM, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CopyFromByColumnContext::StringLiteral() {
+  return getTokens(CypherParser::StringLiteral);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyFromByColumnContext::StringLiteral(size_t i) {
+  return getToken(CypherParser::StringLiteral, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyFromByColumnContext::BY() {
+  return getToken(CypherParser::BY, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyFromByColumnContext::COLUMN() {
+  return getToken(CypherParser::COLUMN, 0);
+}
+
+
+size_t CypherParser::KU_CopyFromByColumnContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CopyFromByColumn;
+}
+
+
+CypherParser::KU_CopyFromByColumnContext* CypherParser::kU_CopyFromByColumn() {
+  KU_CopyFromByColumnContext *_localctx = _tracker.createInstance<KU_CopyFromByColumnContext>(_ctx, getState());
+  enterRule(_localctx, 12, CypherParser::RuleKU_CopyFromByColumn);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(490);
+    match(CypherParser::COPY);
+    setState(491);
+    match(CypherParser::SP);
+    setState(492);
+    oC_SchemaName();
+    setState(493);
+    match(CypherParser::SP);
+    setState(494);
+    match(CypherParser::FROM);
+    setState(495);
+    match(CypherParser::SP);
+    setState(496);
+    match(CypherParser::T__1);
+    setState(498);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(497);
+      match(CypherParser::SP);
+    }
+    setState(500);
+    match(CypherParser::StringLiteral);
+    setState(511);
+    _errHandler->sync(this);
+    _la = _input->LA(1);
+    while (_la == CypherParser::T__3 || _la == CypherParser::SP) {
+      setState(502);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(501);
+        match(CypherParser::SP);
+      }
+      setState(504);
+      match(CypherParser::T__3);
+      setState(506);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(505);
+        match(CypherParser::SP);
+      }
+      setState(508);
+      match(CypherParser::StringLiteral);
+      setState(513);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+    }
+    setState(514);
+    match(CypherParser::T__2);
+    setState(515);
+    match(CypherParser::SP);
+    setState(516);
+    match(CypherParser::BY);
+    setState(517);
+    match(CypherParser::SP);
+    setState(518);
+    match(CypherParser::COLUMN);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CopyTOContext ------------------------------------------------------------------
+
+CypherParser::KU_CopyTOContext::KU_CopyTOContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CopyTOContext::COPY() {
+  return getToken(CypherParser::COPY, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CopyTOContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyTOContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_QueryContext* CypherParser::KU_CopyTOContext::oC_Query() {
+  return getRuleContext<CypherParser::OC_QueryContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyTOContext::TO() {
+  return getToken(CypherParser::TO, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_CopyTOContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+CypherParser::KU_OptionsContext* CypherParser::KU_CopyTOContext::kU_Options() {
+  return getRuleContext<CypherParser::KU_OptionsContext>(0);
+}
+
+
+size_t CypherParser::KU_CopyTOContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CopyTO;
+}
+
+
+CypherParser::KU_CopyTOContext* CypherParser::kU_CopyTO() {
+  KU_CopyTOContext *_localctx = _tracker.createInstance<KU_CopyTOContext>(_ctx, getState());
+  enterRule(_localctx, 14, CypherParser::RuleKU_CopyTO);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(520);
+    match(CypherParser::COPY);
+    setState(521);
+    match(CypherParser::SP);
+    setState(522);
+    match(CypherParser::T__1);
+    setState(524);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(523);
+      match(CypherParser::SP);
+    }
+    setState(526);
+    oC_Query();
+    setState(528);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(527);
+      match(CypherParser::SP);
+    }
+    setState(530);
+    match(CypherParser::T__2);
+    setState(531);
+    match(CypherParser::SP);
+    setState(532);
+    match(CypherParser::TO);
+    setState(533);
+    match(CypherParser::SP);
+    setState(534);
+    match(CypherParser::StringLiteral);
+    setState(548);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 34, _ctx)) {
+    case 1: {
+      setState(536);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(535);
+        match(CypherParser::SP);
+      }
+      setState(538);
+      match(CypherParser::T__1);
+      setState(540);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(539);
+        match(CypherParser::SP);
+      }
+      setState(542);
+      kU_Options();
+      setState(544);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(543);
+        match(CypherParser::SP);
+      }
+      setState(546);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ExportDatabaseContext ------------------------------------------------------------------
+
+CypherParser::KU_ExportDatabaseContext::KU_ExportDatabaseContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_ExportDatabaseContext::EXPORT() {
+  return getToken(CypherParser::EXPORT, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_ExportDatabaseContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_ExportDatabaseContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_ExportDatabaseContext::DATABASE() {
+  return getToken(CypherParser::DATABASE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_ExportDatabaseContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+CypherParser::KU_OptionsContext* CypherParser::KU_ExportDatabaseContext::kU_Options() {
+  return getRuleContext<CypherParser::KU_OptionsContext>(0);
+}
+
+
+size_t CypherParser::KU_ExportDatabaseContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ExportDatabase;
+}
+
+
+CypherParser::KU_ExportDatabaseContext* CypherParser::kU_ExportDatabase() {
+  KU_ExportDatabaseContext *_localctx = _tracker.createInstance<KU_ExportDatabaseContext>(_ctx, getState());
+  enterRule(_localctx, 16, CypherParser::RuleKU_ExportDatabase);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(550);
+    match(CypherParser::EXPORT);
+    setState(551);
+    match(CypherParser::SP);
+    setState(552);
+    match(CypherParser::DATABASE);
+    setState(553);
+    match(CypherParser::SP);
+    setState(554);
+    match(CypherParser::StringLiteral);
+    setState(568);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 38, _ctx)) {
+    case 1: {
+      setState(556);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(555);
+        match(CypherParser::SP);
+      }
+      setState(558);
+      match(CypherParser::T__1);
+      setState(560);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(559);
+        match(CypherParser::SP);
+      }
+      setState(562);
+      kU_Options();
+      setState(564);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(563);
+        match(CypherParser::SP);
+      }
+      setState(566);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ImportDatabaseContext ------------------------------------------------------------------
+
+CypherParser::KU_ImportDatabaseContext::KU_ImportDatabaseContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_ImportDatabaseContext::IMPORT() {
+  return getToken(CypherParser::IMPORT, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_ImportDatabaseContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_ImportDatabaseContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_ImportDatabaseContext::DATABASE() {
+  return getToken(CypherParser::DATABASE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_ImportDatabaseContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+
+size_t CypherParser::KU_ImportDatabaseContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ImportDatabase;
+}
+
+
+CypherParser::KU_ImportDatabaseContext* CypherParser::kU_ImportDatabase() {
+  KU_ImportDatabaseContext *_localctx = _tracker.createInstance<KU_ImportDatabaseContext>(_ctx, getState());
+  enterRule(_localctx, 18, CypherParser::RuleKU_ImportDatabase);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(570);
+    match(CypherParser::IMPORT);
+    setState(571);
+    match(CypherParser::SP);
+    setState(572);
+    match(CypherParser::DATABASE);
+    setState(573);
+    match(CypherParser::SP);
+    setState(574);
+    match(CypherParser::StringLiteral);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_AttachDatabaseContext ------------------------------------------------------------------
+
+CypherParser::KU_AttachDatabaseContext::KU_AttachDatabaseContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_AttachDatabaseContext::ATTACH() {
+  return getToken(CypherParser::ATTACH, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_AttachDatabaseContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_AttachDatabaseContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_AttachDatabaseContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_AttachDatabaseContext::DBTYPE() {
+  return getToken(CypherParser::DBTYPE, 0);
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_AttachDatabaseContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_AttachDatabaseContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_AttachDatabaseContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+CypherParser::KU_OptionsContext* CypherParser::KU_AttachDatabaseContext::kU_Options() {
+  return getRuleContext<CypherParser::KU_OptionsContext>(0);
+}
+
+
+size_t CypherParser::KU_AttachDatabaseContext::getRuleIndex() const {
+  return CypherParser::RuleKU_AttachDatabase;
+}
+
+
+CypherParser::KU_AttachDatabaseContext* CypherParser::kU_AttachDatabase() {
+  KU_AttachDatabaseContext *_localctx = _tracker.createInstance<KU_AttachDatabaseContext>(_ctx, getState());
+  enterRule(_localctx, 20, CypherParser::RuleKU_AttachDatabase);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(576);
+    match(CypherParser::ATTACH);
+    setState(577);
+    match(CypherParser::SP);
+    setState(578);
+    match(CypherParser::StringLiteral);
+    setState(583);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 39, _ctx)) {
+    case 1: {
+      setState(579);
+      match(CypherParser::SP);
+      setState(580);
+      match(CypherParser::AS);
+      setState(581);
+      match(CypherParser::SP);
+      setState(582);
+      oC_SchemaName();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(585);
+    match(CypherParser::SP);
+    setState(586);
+    match(CypherParser::T__1);
+    setState(588);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(587);
+      match(CypherParser::SP);
+    }
+    setState(590);
+    match(CypherParser::DBTYPE);
+    setState(591);
+    match(CypherParser::SP);
+    setState(592);
+    oC_SymbolicName();
+    setState(601);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 43, _ctx)) {
+    case 1: {
+      setState(594);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(593);
+        match(CypherParser::SP);
+      }
+      setState(596);
+      match(CypherParser::T__3);
+      setState(598);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(597);
+        match(CypherParser::SP);
+      }
+      setState(600);
+      kU_Options();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(604);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(603);
+      match(CypherParser::SP);
+    }
+    setState(606);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_OptionContext ------------------------------------------------------------------
+
+CypherParser::KU_OptionContext::KU_OptionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_OptionContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+CypherParser::OC_LiteralContext* CypherParser::KU_OptionContext::oC_Literal() {
+  return getRuleContext<CypherParser::OC_LiteralContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_OptionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_OptionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_OptionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_Option;
+}
+
+
+CypherParser::KU_OptionContext* CypherParser::kU_Option() {
+  KU_OptionContext *_localctx = _tracker.createInstance<KU_OptionContext>(_ctx, getState());
+  enterRule(_localctx, 22, CypherParser::RuleKU_Option);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(627);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 49, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(608);
+      oC_SymbolicName();
+      setState(622);
+      _errHandler->sync(this);
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 48, _ctx)) {
+      case 1: {
+        setState(610);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(609);
+          match(CypherParser::SP);
+        }
+        setState(612);
+        match(CypherParser::T__5);
+        setState(614);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(613);
+          match(CypherParser::SP);
+        }
+        break;
+      }
+
+      case 2: {
+        setState(619);
+        _errHandler->sync(this);
+        _la = _input->LA(1);
+        while (_la == CypherParser::SP) {
+          setState(616);
+          match(CypherParser::SP);
+          setState(621);
+          _errHandler->sync(this);
+          _la = _input->LA(1);
+        }
+        break;
+      }
+
+      default:
+        break;
+      }
+      setState(624);
+      oC_Literal();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(626);
+      oC_SymbolicName();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_OptionsContext ------------------------------------------------------------------
+
+CypherParser::KU_OptionsContext::KU_OptionsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_OptionContext *> CypherParser::KU_OptionsContext::kU_Option() {
+  return getRuleContexts<CypherParser::KU_OptionContext>();
+}
+
+CypherParser::KU_OptionContext* CypherParser::KU_OptionsContext::kU_Option(size_t i) {
+  return getRuleContext<CypherParser::KU_OptionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_OptionsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_OptionsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_OptionsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_Options;
+}
+
+
+CypherParser::KU_OptionsContext* CypherParser::kU_Options() {
+  KU_OptionsContext *_localctx = _tracker.createInstance<KU_OptionsContext>(_ctx, getState());
+  enterRule(_localctx, 24, CypherParser::RuleKU_Options);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(629);
+    kU_Option();
+    setState(640);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 52, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(631);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(630);
+          match(CypherParser::SP);
+        }
+        setState(633);
+        match(CypherParser::T__3);
+        setState(635);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(634);
+          match(CypherParser::SP);
+        }
+        setState(637);
+        kU_Option(); 
+      }
+      setState(642);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 52, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_DetachDatabaseContext ------------------------------------------------------------------
+
+CypherParser::KU_DetachDatabaseContext::KU_DetachDatabaseContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_DetachDatabaseContext::DETACH() {
+  return getToken(CypherParser::DETACH, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_DetachDatabaseContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_DetachDatabaseContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+
+size_t CypherParser::KU_DetachDatabaseContext::getRuleIndex() const {
+  return CypherParser::RuleKU_DetachDatabase;
+}
+
+
+CypherParser::KU_DetachDatabaseContext* CypherParser::kU_DetachDatabase() {
+  KU_DetachDatabaseContext *_localctx = _tracker.createInstance<KU_DetachDatabaseContext>(_ctx, getState());
+  enterRule(_localctx, 26, CypherParser::RuleKU_DetachDatabase);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(643);
+    match(CypherParser::DETACH);
+    setState(644);
+    match(CypherParser::SP);
+    setState(645);
+    oC_SchemaName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_UseDatabaseContext ------------------------------------------------------------------
+
+CypherParser::KU_UseDatabaseContext::KU_UseDatabaseContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_UseDatabaseContext::USE() {
+  return getToken(CypherParser::USE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_UseDatabaseContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_UseDatabaseContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+
+size_t CypherParser::KU_UseDatabaseContext::getRuleIndex() const {
+  return CypherParser::RuleKU_UseDatabase;
+}
+
+
+CypherParser::KU_UseDatabaseContext* CypherParser::kU_UseDatabase() {
+  KU_UseDatabaseContext *_localctx = _tracker.createInstance<KU_UseDatabaseContext>(_ctx, getState());
+  enterRule(_localctx, 28, CypherParser::RuleKU_UseDatabase);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(647);
+    match(CypherParser::USE);
+    setState(648);
+    match(CypherParser::SP);
+    setState(649);
+    oC_SchemaName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_StandaloneCallContext ------------------------------------------------------------------
+
+CypherParser::KU_StandaloneCallContext::KU_StandaloneCallContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_StandaloneCallContext::CALL() {
+  return getToken(CypherParser::CALL, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_StandaloneCallContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_StandaloneCallContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_StandaloneCallContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::KU_StandaloneCallContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+CypherParser::OC_FunctionInvocationContext* CypherParser::KU_StandaloneCallContext::oC_FunctionInvocation() {
+  return getRuleContext<CypherParser::OC_FunctionInvocationContext>(0);
+}
+
+
+size_t CypherParser::KU_StandaloneCallContext::getRuleIndex() const {
+  return CypherParser::RuleKU_StandaloneCall;
+}
+
+
+CypherParser::KU_StandaloneCallContext* CypherParser::kU_StandaloneCall() {
+  KU_StandaloneCallContext *_localctx = _tracker.createInstance<KU_StandaloneCallContext>(_ctx, getState());
+  enterRule(_localctx, 30, CypherParser::RuleKU_StandaloneCall);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(666);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 55, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(651);
+      match(CypherParser::CALL);
+      setState(652);
+      match(CypherParser::SP);
+      setState(653);
+      oC_SymbolicName();
+      setState(655);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(654);
+        match(CypherParser::SP);
+      }
+      setState(657);
+      match(CypherParser::T__5);
+      setState(659);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(658);
+        match(CypherParser::SP);
+      }
+      setState(661);
+      oC_Expression();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(663);
+      match(CypherParser::CALL);
+      setState(664);
+      match(CypherParser::SP);
+      setState(665);
+      oC_FunctionInvocation();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CommentOnContext ------------------------------------------------------------------
+
+CypherParser::KU_CommentOnContext::KU_CommentOnContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CommentOnContext::COMMENT() {
+  return getToken(CypherParser::COMMENT, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CommentOnContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CommentOnContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CommentOnContext::ON() {
+  return getToken(CypherParser::ON, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_CommentOnContext::TABLE() {
+  return getToken(CypherParser::TABLE, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_CommentOnContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CommentOnContext::IS() {
+  return getToken(CypherParser::IS, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_CommentOnContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+
+size_t CypherParser::KU_CommentOnContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CommentOn;
+}
+
+
+CypherParser::KU_CommentOnContext* CypherParser::kU_CommentOn() {
+  KU_CommentOnContext *_localctx = _tracker.createInstance<KU_CommentOnContext>(_ctx, getState());
+  enterRule(_localctx, 32, CypherParser::RuleKU_CommentOn);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(668);
+    match(CypherParser::COMMENT);
+    setState(669);
+    match(CypherParser::SP);
+    setState(670);
+    match(CypherParser::ON);
+    setState(671);
+    match(CypherParser::SP);
+    setState(672);
+    match(CypherParser::TABLE);
+    setState(673);
+    match(CypherParser::SP);
+    setState(674);
+    oC_SchemaName();
+    setState(675);
+    match(CypherParser::SP);
+    setState(676);
+    match(CypherParser::IS);
+    setState(677);
+    match(CypherParser::SP);
+    setState(678);
+    match(CypherParser::StringLiteral);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CreateMacroContext ------------------------------------------------------------------
+
+CypherParser::KU_CreateMacroContext::KU_CreateMacroContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CreateMacroContext::CREATE() {
+  return getToken(CypherParser::CREATE, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CreateMacroContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateMacroContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateMacroContext::MACRO() {
+  return getToken(CypherParser::MACRO, 0);
+}
+
+CypherParser::OC_FunctionNameContext* CypherParser::KU_CreateMacroContext::oC_FunctionName() {
+  return getRuleContext<CypherParser::OC_FunctionNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateMacroContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::KU_CreateMacroContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+CypherParser::KU_PositionalArgsContext* CypherParser::KU_CreateMacroContext::kU_PositionalArgs() {
+  return getRuleContext<CypherParser::KU_PositionalArgsContext>(0);
+}
+
+std::vector<CypherParser::KU_DefaultArgContext *> CypherParser::KU_CreateMacroContext::kU_DefaultArg() {
+  return getRuleContexts<CypherParser::KU_DefaultArgContext>();
+}
+
+CypherParser::KU_DefaultArgContext* CypherParser::KU_CreateMacroContext::kU_DefaultArg(size_t i) {
+  return getRuleContext<CypherParser::KU_DefaultArgContext>(i);
+}
+
+
+size_t CypherParser::KU_CreateMacroContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CreateMacro;
+}
+
+
+CypherParser::KU_CreateMacroContext* CypherParser::kU_CreateMacro() {
+  KU_CreateMacroContext *_localctx = _tracker.createInstance<KU_CreateMacroContext>(_ctx, getState());
+  enterRule(_localctx, 34, CypherParser::RuleKU_CreateMacro);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(680);
+    match(CypherParser::CREATE);
+    setState(681);
+    match(CypherParser::SP);
+    setState(682);
+    match(CypherParser::MACRO);
+    setState(683);
+    match(CypherParser::SP);
+    setState(684);
+    oC_FunctionName();
+    setState(686);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(685);
+      match(CypherParser::SP);
+    }
+    setState(688);
+    match(CypherParser::T__1);
+    setState(690);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 57, _ctx)) {
+    case 1: {
+      setState(689);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(693);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 58, _ctx)) {
+    case 1: {
+      setState(692);
+      kU_PositionalArgs();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(696);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 59, _ctx)) {
+    case 1: {
+      setState(695);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(699);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if ((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & -3185593048922849280) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 65)) & -287985230644762313) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 130)) & 5068755015275819) != 0)) {
+      setState(698);
+      kU_DefaultArg();
+    }
+    setState(711);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 63, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(702);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(701);
+          match(CypherParser::SP);
+        }
+        setState(704);
+        match(CypherParser::T__3);
+        setState(706);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(705);
+          match(CypherParser::SP);
+        }
+        setState(708);
+        kU_DefaultArg(); 
+      }
+      setState(713);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 63, _ctx);
+    }
+    setState(715);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(714);
+      match(CypherParser::SP);
+    }
+    setState(717);
+    match(CypherParser::T__2);
+    setState(718);
+    match(CypherParser::SP);
+    setState(719);
+    match(CypherParser::AS);
+    setState(720);
+    match(CypherParser::SP);
+    setState(721);
+    oC_Expression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_PositionalArgsContext ------------------------------------------------------------------
+
+CypherParser::KU_PositionalArgsContext::KU_PositionalArgsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_SymbolicNameContext *> CypherParser::KU_PositionalArgsContext::oC_SymbolicName() {
+  return getRuleContexts<CypherParser::OC_SymbolicNameContext>();
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_PositionalArgsContext::oC_SymbolicName(size_t i) {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_PositionalArgsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_PositionalArgsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_PositionalArgsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_PositionalArgs;
+}
+
+
+CypherParser::KU_PositionalArgsContext* CypherParser::kU_PositionalArgs() {
+  KU_PositionalArgsContext *_localctx = _tracker.createInstance<KU_PositionalArgsContext>(_ctx, getState());
+  enterRule(_localctx, 36, CypherParser::RuleKU_PositionalArgs);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(723);
+    oC_SymbolicName();
+    setState(734);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 67, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(725);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(724);
+          match(CypherParser::SP);
+        }
+        setState(727);
+        match(CypherParser::T__3);
+        setState(729);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(728);
+          match(CypherParser::SP);
+        }
+        setState(731);
+        oC_SymbolicName(); 
+      }
+      setState(736);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 67, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_DefaultArgContext ------------------------------------------------------------------
+
+CypherParser::KU_DefaultArgContext::KU_DefaultArgContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_DefaultArgContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_DefaultArgContext::COLON() {
+  return getToken(CypherParser::COLON, 0);
+}
+
+CypherParser::OC_LiteralContext* CypherParser::KU_DefaultArgContext::oC_Literal() {
+  return getRuleContext<CypherParser::OC_LiteralContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_DefaultArgContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_DefaultArgContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_DefaultArgContext::getRuleIndex() const {
+  return CypherParser::RuleKU_DefaultArg;
+}
+
+
+CypherParser::KU_DefaultArgContext* CypherParser::kU_DefaultArg() {
+  KU_DefaultArgContext *_localctx = _tracker.createInstance<KU_DefaultArgContext>(_ctx, getState());
+  enterRule(_localctx, 38, CypherParser::RuleKU_DefaultArg);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(737);
+    oC_SymbolicName();
+    setState(739);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(738);
+      match(CypherParser::SP);
+    }
+    setState(741);
+    match(CypherParser::COLON);
+    setState(742);
+    match(CypherParser::T__5);
+    setState(744);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(743);
+      match(CypherParser::SP);
+    }
+    setState(746);
+    oC_Literal();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_FilePathsContext ------------------------------------------------------------------
+
+CypherParser::KU_FilePathsContext::KU_FilePathsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_FilePathsContext::StringLiteral() {
+  return getTokens(CypherParser::StringLiteral);
+}
+
+tree::TerminalNode* CypherParser::KU_FilePathsContext::StringLiteral(size_t i) {
+  return getToken(CypherParser::StringLiteral, i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_FilePathsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_FilePathsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_FilePathsContext::GLOB() {
+  return getToken(CypherParser::GLOB, 0);
+}
+
+
+size_t CypherParser::KU_FilePathsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_FilePaths;
+}
+
+
+CypherParser::KU_FilePathsContext* CypherParser::kU_FilePaths() {
+  KU_FilePathsContext *_localctx = _tracker.createInstance<KU_FilePathsContext>(_ctx, getState());
+  enterRule(_localctx, 40, CypherParser::RuleKU_FilePaths);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(781);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::T__6: {
+        enterOuterAlt(_localctx, 1);
+        setState(748);
+        match(CypherParser::T__6);
+        setState(750);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(749);
+          match(CypherParser::SP);
+        }
+        setState(752);
+        match(CypherParser::StringLiteral);
+        setState(763);
+        _errHandler->sync(this);
+        _la = _input->LA(1);
+        while (_la == CypherParser::T__3 || _la == CypherParser::SP) {
+          setState(754);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(753);
+            match(CypherParser::SP);
+          }
+          setState(756);
+          match(CypherParser::T__3);
+          setState(758);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(757);
+            match(CypherParser::SP);
+          }
+          setState(760);
+          match(CypherParser::StringLiteral);
+          setState(765);
+          _errHandler->sync(this);
+          _la = _input->LA(1);
+        }
+        setState(766);
+        match(CypherParser::T__7);
+        break;
+      }
+
+      case CypherParser::StringLiteral: {
+        enterOuterAlt(_localctx, 2);
+        setState(767);
+        match(CypherParser::StringLiteral);
+        break;
+      }
+
+      case CypherParser::GLOB: {
+        enterOuterAlt(_localctx, 3);
+        setState(768);
+        match(CypherParser::GLOB);
+        setState(770);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(769);
+          match(CypherParser::SP);
+        }
+        setState(772);
+        match(CypherParser::T__1);
+        setState(774);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(773);
+          match(CypherParser::SP);
+        }
+        setState(776);
+        match(CypherParser::StringLiteral);
+        setState(778);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(777);
+          match(CypherParser::SP);
+        }
+        setState(780);
+        match(CypherParser::T__2);
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_IfNotExistsContext ------------------------------------------------------------------
+
+CypherParser::KU_IfNotExistsContext::KU_IfNotExistsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_IfNotExistsContext::IF() {
+  return getToken(CypherParser::IF, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_IfNotExistsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_IfNotExistsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_IfNotExistsContext::NOT() {
+  return getToken(CypherParser::NOT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_IfNotExistsContext::EXISTS() {
+  return getToken(CypherParser::EXISTS, 0);
+}
+
+
+size_t CypherParser::KU_IfNotExistsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_IfNotExists;
+}
+
+
+CypherParser::KU_IfNotExistsContext* CypherParser::kU_IfNotExists() {
+  KU_IfNotExistsContext *_localctx = _tracker.createInstance<KU_IfNotExistsContext>(_ctx, getState());
+  enterRule(_localctx, 42, CypherParser::RuleKU_IfNotExists);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(783);
+    match(CypherParser::IF);
+    setState(784);
+    match(CypherParser::SP);
+    setState(785);
+    match(CypherParser::NOT);
+    setState(786);
+    match(CypherParser::SP);
+    setState(787);
+    match(CypherParser::EXISTS);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CreateNodeTableContext ------------------------------------------------------------------
+
+CypherParser::KU_CreateNodeTableContext::KU_CreateNodeTableContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CreateNodeTableContext::CREATE() {
+  return getToken(CypherParser::CREATE, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CreateNodeTableContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateNodeTableContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateNodeTableContext::NODE() {
+  return getToken(CypherParser::NODE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateNodeTableContext::TABLE() {
+  return getToken(CypherParser::TABLE, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_CreateNodeTableContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+CypherParser::KU_PropertyDefinitionsContext* CypherParser::KU_CreateNodeTableContext::kU_PropertyDefinitions() {
+  return getRuleContext<CypherParser::KU_PropertyDefinitionsContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateNodeTableContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+CypherParser::OC_QueryContext* CypherParser::KU_CreateNodeTableContext::oC_Query() {
+  return getRuleContext<CypherParser::OC_QueryContext>(0);
+}
+
+CypherParser::KU_IfNotExistsContext* CypherParser::KU_CreateNodeTableContext::kU_IfNotExists() {
+  return getRuleContext<CypherParser::KU_IfNotExistsContext>(0);
+}
+
+CypherParser::KU_CreateNodeConstraintContext* CypherParser::KU_CreateNodeTableContext::kU_CreateNodeConstraint() {
+  return getRuleContext<CypherParser::KU_CreateNodeConstraintContext>(0);
+}
+
+
+size_t CypherParser::KU_CreateNodeTableContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CreateNodeTable;
+}
+
+
+CypherParser::KU_CreateNodeTableContext* CypherParser::kU_CreateNodeTable() {
+  KU_CreateNodeTableContext *_localctx = _tracker.createInstance<KU_CreateNodeTableContext>(_ctx, getState());
+  enterRule(_localctx, 44, CypherParser::RuleKU_CreateNodeTable);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(789);
+    match(CypherParser::CREATE);
+    setState(790);
+    match(CypherParser::SP);
+    setState(791);
+    match(CypherParser::NODE);
+    setState(792);
+    match(CypherParser::SP);
+    setState(793);
+    match(CypherParser::TABLE);
+    setState(794);
+    match(CypherParser::SP);
+    setState(798);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 78, _ctx)) {
+    case 1: {
+      setState(795);
+      kU_IfNotExists();
+      setState(796);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(800);
+    oC_SchemaName();
+    setState(828);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 85, _ctx)) {
+    case 1: {
+      setState(802);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(801);
+        match(CypherParser::SP);
+      }
+      setState(804);
+      match(CypherParser::T__1);
+      setState(806);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(805);
+        match(CypherParser::SP);
+      }
+      setState(808);
+      kU_PropertyDefinitions();
+      setState(810);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 81, _ctx)) {
+      case 1: {
+        setState(809);
+        match(CypherParser::SP);
+        break;
+      }
+
+      default:
+        break;
+      }
+      setState(817);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::T__3) {
+        setState(812);
+        match(CypherParser::T__3);
+        setState(814);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(813);
+          match(CypherParser::SP);
+        }
+        setState(816);
+        kU_CreateNodeConstraint();
+      }
+      setState(820);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(819);
+        match(CypherParser::SP);
+      }
+      setState(822);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    case 2: {
+      setState(824);
+      match(CypherParser::SP);
+      setState(825);
+      match(CypherParser::AS);
+      setState(826);
+      match(CypherParser::SP);
+      setState(827);
+      oC_Query();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CreateRelTableContext ------------------------------------------------------------------
+
+CypherParser::KU_CreateRelTableContext::KU_CreateRelTableContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRelTableContext::CREATE() {
+  return getToken(CypherParser::CREATE, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CreateRelTableContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRelTableContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRelTableContext::REL() {
+  return getToken(CypherParser::REL, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRelTableContext::TABLE() {
+  return getToken(CypherParser::TABLE, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_CreateRelTableContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+CypherParser::KU_FromToConnectionsContext* CypherParser::KU_CreateRelTableContext::kU_FromToConnections() {
+  return getRuleContext<CypherParser::KU_FromToConnectionsContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRelTableContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+CypherParser::OC_QueryContext* CypherParser::KU_CreateRelTableContext::oC_Query() {
+  return getRuleContext<CypherParser::OC_QueryContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRelTableContext::GROUP() {
+  return getToken(CypherParser::GROUP, 0);
+}
+
+CypherParser::KU_IfNotExistsContext* CypherParser::KU_CreateRelTableContext::kU_IfNotExists() {
+  return getRuleContext<CypherParser::KU_IfNotExistsContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRelTableContext::WITH() {
+  return getToken(CypherParser::WITH, 0);
+}
+
+CypherParser::KU_OptionsContext* CypherParser::KU_CreateRelTableContext::kU_Options() {
+  return getRuleContext<CypherParser::KU_OptionsContext>(0);
+}
+
+CypherParser::KU_PropertyDefinitionsContext* CypherParser::KU_CreateRelTableContext::kU_PropertyDefinitions() {
+  return getRuleContext<CypherParser::KU_PropertyDefinitionsContext>(0);
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_CreateRelTableContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+
+size_t CypherParser::KU_CreateRelTableContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CreateRelTable;
+}
+
+
+CypherParser::KU_CreateRelTableContext* CypherParser::kU_CreateRelTable() {
+  KU_CreateRelTableContext *_localctx = _tracker.createInstance<KU_CreateRelTableContext>(_ctx, getState());
+  enterRule(_localctx, 46, CypherParser::RuleKU_CreateRelTable);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(830);
+    match(CypherParser::CREATE);
+    setState(831);
+    match(CypherParser::SP);
+    setState(832);
+    match(CypherParser::REL);
+    setState(833);
+    match(CypherParser::SP);
+    setState(834);
+    match(CypherParser::TABLE);
+    setState(837);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 86, _ctx)) {
+    case 1: {
+      setState(835);
+      match(CypherParser::SP);
+      setState(836);
+      match(CypherParser::GROUP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(841);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 87, _ctx)) {
+    case 1: {
+      setState(839);
+      match(CypherParser::SP);
+      setState(840);
+      kU_IfNotExists();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(843);
+    match(CypherParser::SP);
+    setState(844);
+    oC_SchemaName();
+    setState(846);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(845);
+      match(CypherParser::SP);
+    }
+    setState(848);
+    match(CypherParser::T__1);
+    setState(850);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(849);
+      match(CypherParser::SP);
+    }
+    setState(852);
+    kU_FromToConnections();
+    setState(854);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(853);
+      match(CypherParser::SP);
+    }
+    setState(882);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 97, _ctx)) {
+    case 1: {
+      setState(864);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 93, _ctx)) {
+      case 1: {
+        setState(856);
+        match(CypherParser::T__3);
+        setState(858);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(857);
+          match(CypherParser::SP);
+        }
+        setState(860);
+        kU_PropertyDefinitions();
+        setState(862);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(861);
+          match(CypherParser::SP);
+        }
+        break;
+      }
+
+      default:
+        break;
+      }
+      setState(874);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::T__3) {
+        setState(866);
+        match(CypherParser::T__3);
+        setState(868);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(867);
+          match(CypherParser::SP);
+        }
+        setState(870);
+        oC_SymbolicName();
+        setState(872);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(871);
+          match(CypherParser::SP);
+        }
+      }
+      setState(876);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    case 2: {
+      setState(877);
+      match(CypherParser::T__2);
+      setState(878);
+      match(CypherParser::SP);
+      setState(879);
+      match(CypherParser::AS);
+      setState(880);
+      match(CypherParser::SP);
+      setState(881);
+      oC_Query();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(899);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 101, _ctx)) {
+    case 1: {
+      setState(884);
+      match(CypherParser::SP);
+      setState(885);
+      match(CypherParser::WITH);
+      setState(887);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(886);
+        match(CypherParser::SP);
+      }
+      setState(889);
+      match(CypherParser::T__1);
+      setState(891);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(890);
+        match(CypherParser::SP);
+      }
+      setState(893);
+      kU_Options();
+      setState(895);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(894);
+        match(CypherParser::SP);
+      }
+      setState(897);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_FromToConnectionsContext ------------------------------------------------------------------
+
+CypherParser::KU_FromToConnectionsContext::KU_FromToConnectionsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_FromToConnectionContext *> CypherParser::KU_FromToConnectionsContext::kU_FromToConnection() {
+  return getRuleContexts<CypherParser::KU_FromToConnectionContext>();
+}
+
+CypherParser::KU_FromToConnectionContext* CypherParser::KU_FromToConnectionsContext::kU_FromToConnection(size_t i) {
+  return getRuleContext<CypherParser::KU_FromToConnectionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_FromToConnectionsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_FromToConnectionsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_FromToConnectionsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_FromToConnections;
+}
+
+
+CypherParser::KU_FromToConnectionsContext* CypherParser::kU_FromToConnections() {
+  KU_FromToConnectionsContext *_localctx = _tracker.createInstance<KU_FromToConnectionsContext>(_ctx, getState());
+  enterRule(_localctx, 48, CypherParser::RuleKU_FromToConnections);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(901);
+    kU_FromToConnection();
+    setState(912);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 104, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(903);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(902);
+          match(CypherParser::SP);
+        }
+        setState(905);
+        match(CypherParser::T__3);
+        setState(907);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(906);
+          match(CypherParser::SP);
+        }
+        setState(909);
+        kU_FromToConnection(); 
+      }
+      setState(914);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 104, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_FromToConnectionContext ------------------------------------------------------------------
+
+CypherParser::KU_FromToConnectionContext::KU_FromToConnectionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_FromToConnectionContext::FROM() {
+  return getToken(CypherParser::FROM, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_FromToConnectionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_FromToConnectionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<CypherParser::OC_SchemaNameContext *> CypherParser::KU_FromToConnectionContext::oC_SchemaName() {
+  return getRuleContexts<CypherParser::OC_SchemaNameContext>();
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_FromToConnectionContext::oC_SchemaName(size_t i) {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(i);
+}
+
+tree::TerminalNode* CypherParser::KU_FromToConnectionContext::TO() {
+  return getToken(CypherParser::TO, 0);
+}
+
+
+size_t CypherParser::KU_FromToConnectionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_FromToConnection;
+}
+
+
+CypherParser::KU_FromToConnectionContext* CypherParser::kU_FromToConnection() {
+  KU_FromToConnectionContext *_localctx = _tracker.createInstance<KU_FromToConnectionContext>(_ctx, getState());
+  enterRule(_localctx, 50, CypherParser::RuleKU_FromToConnection);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(915);
+    match(CypherParser::FROM);
+    setState(916);
+    match(CypherParser::SP);
+    setState(917);
+    oC_SchemaName();
+    setState(918);
+    match(CypherParser::SP);
+    setState(919);
+    match(CypherParser::TO);
+    setState(920);
+    match(CypherParser::SP);
+    setState(921);
+    oC_SchemaName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CreateSequenceContext ------------------------------------------------------------------
+
+CypherParser::KU_CreateSequenceContext::KU_CreateSequenceContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CreateSequenceContext::CREATE() {
+  return getToken(CypherParser::CREATE, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CreateSequenceContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateSequenceContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateSequenceContext::SEQUENCE() {
+  return getToken(CypherParser::SEQUENCE, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_CreateSequenceContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+CypherParser::KU_IfNotExistsContext* CypherParser::KU_CreateSequenceContext::kU_IfNotExists() {
+  return getRuleContext<CypherParser::KU_IfNotExistsContext>(0);
+}
+
+std::vector<CypherParser::KU_SequenceOptionsContext *> CypherParser::KU_CreateSequenceContext::kU_SequenceOptions() {
+  return getRuleContexts<CypherParser::KU_SequenceOptionsContext>();
+}
+
+CypherParser::KU_SequenceOptionsContext* CypherParser::KU_CreateSequenceContext::kU_SequenceOptions(size_t i) {
+  return getRuleContext<CypherParser::KU_SequenceOptionsContext>(i);
+}
+
+
+size_t CypherParser::KU_CreateSequenceContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CreateSequence;
+}
+
+
+CypherParser::KU_CreateSequenceContext* CypherParser::kU_CreateSequence() {
+  KU_CreateSequenceContext *_localctx = _tracker.createInstance<KU_CreateSequenceContext>(_ctx, getState());
+  enterRule(_localctx, 52, CypherParser::RuleKU_CreateSequence);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(923);
+    match(CypherParser::CREATE);
+    setState(924);
+    match(CypherParser::SP);
+    setState(925);
+    match(CypherParser::SEQUENCE);
+    setState(926);
+    match(CypherParser::SP);
+    setState(930);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 105, _ctx)) {
+    case 1: {
+      setState(927);
+      kU_IfNotExists();
+      setState(928);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(932);
+    oC_SchemaName();
+    setState(937);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 106, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(933);
+        match(CypherParser::SP);
+        setState(934);
+        kU_SequenceOptions(); 
+      }
+      setState(939);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 106, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CreateTypeContext ------------------------------------------------------------------
+
+CypherParser::KU_CreateTypeContext::KU_CreateTypeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CreateTypeContext::CREATE() {
+  return getToken(CypherParser::CREATE, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CreateTypeContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateTypeContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateTypeContext::TYPE() {
+  return getToken(CypherParser::TYPE, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_CreateTypeContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateTypeContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+CypherParser::KU_DataTypeContext* CypherParser::KU_CreateTypeContext::kU_DataType() {
+  return getRuleContext<CypherParser::KU_DataTypeContext>(0);
+}
+
+
+size_t CypherParser::KU_CreateTypeContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CreateType;
+}
+
+
+CypherParser::KU_CreateTypeContext* CypherParser::kU_CreateType() {
+  KU_CreateTypeContext *_localctx = _tracker.createInstance<KU_CreateTypeContext>(_ctx, getState());
+  enterRule(_localctx, 54, CypherParser::RuleKU_CreateType);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(940);
+    match(CypherParser::CREATE);
+    setState(941);
+    match(CypherParser::SP);
+    setState(942);
+    match(CypherParser::TYPE);
+    setState(943);
+    match(CypherParser::SP);
+    setState(944);
+    oC_SchemaName();
+    setState(945);
+    match(CypherParser::SP);
+    setState(946);
+    match(CypherParser::AS);
+    setState(947);
+    match(CypherParser::SP);
+    setState(948);
+    kU_DataType(0);
+    setState(950);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 107, _ctx)) {
+    case 1: {
+      setState(949);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_SequenceOptionsContext ------------------------------------------------------------------
+
+CypherParser::KU_SequenceOptionsContext::KU_SequenceOptionsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::KU_IncrementByContext* CypherParser::KU_SequenceOptionsContext::kU_IncrementBy() {
+  return getRuleContext<CypherParser::KU_IncrementByContext>(0);
+}
+
+CypherParser::KU_MinValueContext* CypherParser::KU_SequenceOptionsContext::kU_MinValue() {
+  return getRuleContext<CypherParser::KU_MinValueContext>(0);
+}
+
+CypherParser::KU_MaxValueContext* CypherParser::KU_SequenceOptionsContext::kU_MaxValue() {
+  return getRuleContext<CypherParser::KU_MaxValueContext>(0);
+}
+
+CypherParser::KU_StartWithContext* CypherParser::KU_SequenceOptionsContext::kU_StartWith() {
+  return getRuleContext<CypherParser::KU_StartWithContext>(0);
+}
+
+CypherParser::KU_CycleContext* CypherParser::KU_SequenceOptionsContext::kU_Cycle() {
+  return getRuleContext<CypherParser::KU_CycleContext>(0);
+}
+
+
+size_t CypherParser::KU_SequenceOptionsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_SequenceOptions;
+}
+
+
+CypherParser::KU_SequenceOptionsContext* CypherParser::kU_SequenceOptions() {
+  KU_SequenceOptionsContext *_localctx = _tracker.createInstance<KU_SequenceOptionsContext>(_ctx, getState());
+  enterRule(_localctx, 56, CypherParser::RuleKU_SequenceOptions);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(957);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 108, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(952);
+      kU_IncrementBy();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(953);
+      kU_MinValue();
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(954);
+      kU_MaxValue();
+      break;
+    }
+
+    case 4: {
+      enterOuterAlt(_localctx, 4);
+      setState(955);
+      kU_StartWith();
+      break;
+    }
+
+    case 5: {
+      enterOuterAlt(_localctx, 5);
+      setState(956);
+      kU_Cycle();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_WithPasswdContext ------------------------------------------------------------------
+
+CypherParser::KU_WithPasswdContext::KU_WithPasswdContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_WithPasswdContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_WithPasswdContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_WithPasswdContext::WITH() {
+  return getToken(CypherParser::WITH, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_WithPasswdContext::PASSWORD() {
+  return getToken(CypherParser::PASSWORD, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_WithPasswdContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+
+size_t CypherParser::KU_WithPasswdContext::getRuleIndex() const {
+  return CypherParser::RuleKU_WithPasswd;
+}
+
+
+CypherParser::KU_WithPasswdContext* CypherParser::kU_WithPasswd() {
+  KU_WithPasswdContext *_localctx = _tracker.createInstance<KU_WithPasswdContext>(_ctx, getState());
+  enterRule(_localctx, 58, CypherParser::RuleKU_WithPasswd);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(959);
+    match(CypherParser::SP);
+    setState(960);
+    match(CypherParser::WITH);
+    setState(961);
+    match(CypherParser::SP);
+    setState(962);
+    match(CypherParser::PASSWORD);
+    setState(963);
+    match(CypherParser::SP);
+    setState(964);
+    match(CypherParser::StringLiteral);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CreateUserContext ------------------------------------------------------------------
+
+CypherParser::KU_CreateUserContext::KU_CreateUserContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CreateUserContext::CREATE() {
+  return getToken(CypherParser::CREATE, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CreateUserContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateUserContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateUserContext::USER() {
+  return getToken(CypherParser::USER, 0);
+}
+
+CypherParser::OC_VariableContext* CypherParser::KU_CreateUserContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+CypherParser::KU_IfNotExistsContext* CypherParser::KU_CreateUserContext::kU_IfNotExists() {
+  return getRuleContext<CypherParser::KU_IfNotExistsContext>(0);
+}
+
+CypherParser::KU_WithPasswdContext* CypherParser::KU_CreateUserContext::kU_WithPasswd() {
+  return getRuleContext<CypherParser::KU_WithPasswdContext>(0);
+}
+
+
+size_t CypherParser::KU_CreateUserContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CreateUser;
+}
+
+
+CypherParser::KU_CreateUserContext* CypherParser::kU_CreateUser() {
+  KU_CreateUserContext *_localctx = _tracker.createInstance<KU_CreateUserContext>(_ctx, getState());
+  enterRule(_localctx, 60, CypherParser::RuleKU_CreateUser);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(966);
+    match(CypherParser::CREATE);
+    setState(967);
+    match(CypherParser::SP);
+    setState(968);
+    match(CypherParser::USER);
+    setState(969);
+    match(CypherParser::SP);
+    setState(973);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 109, _ctx)) {
+    case 1: {
+      setState(970);
+      kU_IfNotExists();
+      setState(971);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(975);
+    oC_Variable();
+    setState(977);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 110, _ctx)) {
+    case 1: {
+      setState(976);
+      kU_WithPasswd();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CreateRoleContext ------------------------------------------------------------------
+
+CypherParser::KU_CreateRoleContext::KU_CreateRoleContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRoleContext::CREATE() {
+  return getToken(CypherParser::CREATE, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CreateRoleContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRoleContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateRoleContext::ROLE() {
+  return getToken(CypherParser::ROLE, 0);
+}
+
+CypherParser::OC_VariableContext* CypherParser::KU_CreateRoleContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+CypherParser::KU_IfNotExistsContext* CypherParser::KU_CreateRoleContext::kU_IfNotExists() {
+  return getRuleContext<CypherParser::KU_IfNotExistsContext>(0);
+}
+
+
+size_t CypherParser::KU_CreateRoleContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CreateRole;
+}
+
+
+CypherParser::KU_CreateRoleContext* CypherParser::kU_CreateRole() {
+  KU_CreateRoleContext *_localctx = _tracker.createInstance<KU_CreateRoleContext>(_ctx, getState());
+  enterRule(_localctx, 62, CypherParser::RuleKU_CreateRole);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(979);
+    match(CypherParser::CREATE);
+    setState(980);
+    match(CypherParser::SP);
+    setState(981);
+    match(CypherParser::ROLE);
+    setState(982);
+    match(CypherParser::SP);
+    setState(986);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 111, _ctx)) {
+    case 1: {
+      setState(983);
+      kU_IfNotExists();
+      setState(984);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(988);
+    oC_Variable();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_IncrementByContext ------------------------------------------------------------------
+
+CypherParser::KU_IncrementByContext::KU_IncrementByContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_IncrementByContext::INCREMENT() {
+  return getToken(CypherParser::INCREMENT, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_IncrementByContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_IncrementByContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_IntegerLiteralContext* CypherParser::KU_IncrementByContext::oC_IntegerLiteral() {
+  return getRuleContext<CypherParser::OC_IntegerLiteralContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_IncrementByContext::BY() {
+  return getToken(CypherParser::BY, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_IncrementByContext::MINUS() {
+  return getToken(CypherParser::MINUS, 0);
+}
+
+
+size_t CypherParser::KU_IncrementByContext::getRuleIndex() const {
+  return CypherParser::RuleKU_IncrementBy;
+}
+
+
+CypherParser::KU_IncrementByContext* CypherParser::kU_IncrementBy() {
+  KU_IncrementByContext *_localctx = _tracker.createInstance<KU_IncrementByContext>(_ctx, getState());
+  enterRule(_localctx, 64, CypherParser::RuleKU_IncrementBy);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(990);
+    match(CypherParser::INCREMENT);
+    setState(991);
+    match(CypherParser::SP);
+    setState(994);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::BY) {
+      setState(992);
+      match(CypherParser::BY);
+      setState(993);
+      match(CypherParser::SP);
+    }
+    setState(997);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::MINUS) {
+      setState(996);
+      match(CypherParser::MINUS);
+    }
+    setState(999);
+    oC_IntegerLiteral();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_MinValueContext ------------------------------------------------------------------
+
+CypherParser::KU_MinValueContext::KU_MinValueContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_MinValueContext::NO() {
+  return getToken(CypherParser::NO, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_MinValueContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_MinValueContext::MINVALUE() {
+  return getToken(CypherParser::MINVALUE, 0);
+}
+
+CypherParser::OC_IntegerLiteralContext* CypherParser::KU_MinValueContext::oC_IntegerLiteral() {
+  return getRuleContext<CypherParser::OC_IntegerLiteralContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_MinValueContext::MINUS() {
+  return getToken(CypherParser::MINUS, 0);
+}
+
+
+size_t CypherParser::KU_MinValueContext::getRuleIndex() const {
+  return CypherParser::RuleKU_MinValue;
+}
+
+
+CypherParser::KU_MinValueContext* CypherParser::kU_MinValue() {
+  KU_MinValueContext *_localctx = _tracker.createInstance<KU_MinValueContext>(_ctx, getState());
+  enterRule(_localctx, 66, CypherParser::RuleKU_MinValue);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1010);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::NO: {
+        enterOuterAlt(_localctx, 1);
+        setState(1001);
+        match(CypherParser::NO);
+        setState(1002);
+        match(CypherParser::SP);
+        setState(1003);
+        match(CypherParser::MINVALUE);
+        break;
+      }
+
+      case CypherParser::MINVALUE: {
+        enterOuterAlt(_localctx, 2);
+        setState(1004);
+        match(CypherParser::MINVALUE);
+        setState(1005);
+        match(CypherParser::SP);
+        setState(1007);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::MINUS) {
+          setState(1006);
+          match(CypherParser::MINUS);
+        }
+        setState(1009);
+        oC_IntegerLiteral();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_MaxValueContext ------------------------------------------------------------------
+
+CypherParser::KU_MaxValueContext::KU_MaxValueContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_MaxValueContext::NO() {
+  return getToken(CypherParser::NO, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_MaxValueContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_MaxValueContext::MAXVALUE() {
+  return getToken(CypherParser::MAXVALUE, 0);
+}
+
+CypherParser::OC_IntegerLiteralContext* CypherParser::KU_MaxValueContext::oC_IntegerLiteral() {
+  return getRuleContext<CypherParser::OC_IntegerLiteralContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_MaxValueContext::MINUS() {
+  return getToken(CypherParser::MINUS, 0);
+}
+
+
+size_t CypherParser::KU_MaxValueContext::getRuleIndex() const {
+  return CypherParser::RuleKU_MaxValue;
+}
+
+
+CypherParser::KU_MaxValueContext* CypherParser::kU_MaxValue() {
+  KU_MaxValueContext *_localctx = _tracker.createInstance<KU_MaxValueContext>(_ctx, getState());
+  enterRule(_localctx, 68, CypherParser::RuleKU_MaxValue);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1021);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::NO: {
+        enterOuterAlt(_localctx, 1);
+        setState(1012);
+        match(CypherParser::NO);
+        setState(1013);
+        match(CypherParser::SP);
+        setState(1014);
+        match(CypherParser::MAXVALUE);
+        break;
+      }
+
+      case CypherParser::MAXVALUE: {
+        enterOuterAlt(_localctx, 2);
+        setState(1015);
+        match(CypherParser::MAXVALUE);
+        setState(1016);
+        match(CypherParser::SP);
+        setState(1018);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::MINUS) {
+          setState(1017);
+          match(CypherParser::MINUS);
+        }
+        setState(1020);
+        oC_IntegerLiteral();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_StartWithContext ------------------------------------------------------------------
+
+CypherParser::KU_StartWithContext::KU_StartWithContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_StartWithContext::START() {
+  return getToken(CypherParser::START, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_StartWithContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_StartWithContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_IntegerLiteralContext* CypherParser::KU_StartWithContext::oC_IntegerLiteral() {
+  return getRuleContext<CypherParser::OC_IntegerLiteralContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_StartWithContext::WITH() {
+  return getToken(CypherParser::WITH, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_StartWithContext::MINUS() {
+  return getToken(CypherParser::MINUS, 0);
+}
+
+
+size_t CypherParser::KU_StartWithContext::getRuleIndex() const {
+  return CypherParser::RuleKU_StartWith;
+}
+
+
+CypherParser::KU_StartWithContext* CypherParser::kU_StartWith() {
+  KU_StartWithContext *_localctx = _tracker.createInstance<KU_StartWithContext>(_ctx, getState());
+  enterRule(_localctx, 70, CypherParser::RuleKU_StartWith);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1023);
+    match(CypherParser::START);
+    setState(1024);
+    match(CypherParser::SP);
+    setState(1027);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::WITH) {
+      setState(1025);
+      match(CypherParser::WITH);
+      setState(1026);
+      match(CypherParser::SP);
+    }
+    setState(1030);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::MINUS) {
+      setState(1029);
+      match(CypherParser::MINUS);
+    }
+    setState(1032);
+    oC_IntegerLiteral();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CycleContext ------------------------------------------------------------------
+
+CypherParser::KU_CycleContext::KU_CycleContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CycleContext::CYCLE() {
+  return getToken(CypherParser::CYCLE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_CycleContext::NO() {
+  return getToken(CypherParser::NO, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_CycleContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+
+size_t CypherParser::KU_CycleContext::getRuleIndex() const {
+  return CypherParser::RuleKU_Cycle;
+}
+
+
+CypherParser::KU_CycleContext* CypherParser::kU_Cycle() {
+  KU_CycleContext *_localctx = _tracker.createInstance<KU_CycleContext>(_ctx, getState());
+  enterRule(_localctx, 72, CypherParser::RuleKU_Cycle);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1036);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::NO) {
+      setState(1034);
+      match(CypherParser::NO);
+      setState(1035);
+      match(CypherParser::SP);
+    }
+    setState(1038);
+    match(CypherParser::CYCLE);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_IfExistsContext ------------------------------------------------------------------
+
+CypherParser::KU_IfExistsContext::KU_IfExistsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_IfExistsContext::IF() {
+  return getToken(CypherParser::IF, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_IfExistsContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_IfExistsContext::EXISTS() {
+  return getToken(CypherParser::EXISTS, 0);
+}
+
+
+size_t CypherParser::KU_IfExistsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_IfExists;
+}
+
+
+CypherParser::KU_IfExistsContext* CypherParser::kU_IfExists() {
+  KU_IfExistsContext *_localctx = _tracker.createInstance<KU_IfExistsContext>(_ctx, getState());
+  enterRule(_localctx, 74, CypherParser::RuleKU_IfExists);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1040);
+    match(CypherParser::IF);
+    setState(1041);
+    match(CypherParser::SP);
+    setState(1042);
+    match(CypherParser::EXISTS);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_DropContext ------------------------------------------------------------------
+
+CypherParser::KU_DropContext::KU_DropContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_DropContext::DROP() {
+  return getToken(CypherParser::DROP, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_DropContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_DropContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_DropContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_DropContext::TABLE() {
+  return getToken(CypherParser::TABLE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_DropContext::SEQUENCE() {
+  return getToken(CypherParser::SEQUENCE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_DropContext::MACRO() {
+  return getToken(CypherParser::MACRO, 0);
+}
+
+CypherParser::KU_IfExistsContext* CypherParser::KU_DropContext::kU_IfExists() {
+  return getRuleContext<CypherParser::KU_IfExistsContext>(0);
+}
+
+
+size_t CypherParser::KU_DropContext::getRuleIndex() const {
+  return CypherParser::RuleKU_Drop;
+}
+
+
+CypherParser::KU_DropContext* CypherParser::kU_Drop() {
+  KU_DropContext *_localctx = _tracker.createInstance<KU_DropContext>(_ctx, getState());
+  enterRule(_localctx, 76, CypherParser::RuleKU_Drop);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1044);
+    match(CypherParser::DROP);
+    setState(1045);
+    match(CypherParser::SP);
+    setState(1046);
+    _la = _input->LA(1);
+    if (!(((((_la - 105) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 105)) & 2181038081) != 0))) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+    setState(1047);
+    match(CypherParser::SP);
+    setState(1051);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 121, _ctx)) {
+    case 1: {
+      setState(1048);
+      kU_IfExists();
+      setState(1049);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1053);
+    oC_SchemaName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_AlterTableContext ------------------------------------------------------------------
+
+CypherParser::KU_AlterTableContext::KU_AlterTableContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_AlterTableContext::ALTER() {
+  return getToken(CypherParser::ALTER, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_AlterTableContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_AlterTableContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_AlterTableContext::TABLE() {
+  return getToken(CypherParser::TABLE, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_AlterTableContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+CypherParser::KU_AlterOptionsContext* CypherParser::KU_AlterTableContext::kU_AlterOptions() {
+  return getRuleContext<CypherParser::KU_AlterOptionsContext>(0);
+}
+
+
+size_t CypherParser::KU_AlterTableContext::getRuleIndex() const {
+  return CypherParser::RuleKU_AlterTable;
+}
+
+
+CypherParser::KU_AlterTableContext* CypherParser::kU_AlterTable() {
+  KU_AlterTableContext *_localctx = _tracker.createInstance<KU_AlterTableContext>(_ctx, getState());
+  enterRule(_localctx, 78, CypherParser::RuleKU_AlterTable);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1055);
+    match(CypherParser::ALTER);
+    setState(1056);
+    match(CypherParser::SP);
+    setState(1057);
+    match(CypherParser::TABLE);
+    setState(1058);
+    match(CypherParser::SP);
+    setState(1059);
+    oC_SchemaName();
+    setState(1060);
+    match(CypherParser::SP);
+    setState(1061);
+    kU_AlterOptions();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_AlterOptionsContext ------------------------------------------------------------------
+
+CypherParser::KU_AlterOptionsContext::KU_AlterOptionsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::KU_AddPropertyContext* CypherParser::KU_AlterOptionsContext::kU_AddProperty() {
+  return getRuleContext<CypherParser::KU_AddPropertyContext>(0);
+}
+
+CypherParser::KU_DropPropertyContext* CypherParser::KU_AlterOptionsContext::kU_DropProperty() {
+  return getRuleContext<CypherParser::KU_DropPropertyContext>(0);
+}
+
+CypherParser::KU_RenameTableContext* CypherParser::KU_AlterOptionsContext::kU_RenameTable() {
+  return getRuleContext<CypherParser::KU_RenameTableContext>(0);
+}
+
+CypherParser::KU_RenamePropertyContext* CypherParser::KU_AlterOptionsContext::kU_RenameProperty() {
+  return getRuleContext<CypherParser::KU_RenamePropertyContext>(0);
+}
+
+CypherParser::KU_AddFromToConnectionContext* CypherParser::KU_AlterOptionsContext::kU_AddFromToConnection() {
+  return getRuleContext<CypherParser::KU_AddFromToConnectionContext>(0);
+}
+
+CypherParser::KU_DropFromToConnectionContext* CypherParser::KU_AlterOptionsContext::kU_DropFromToConnection() {
+  return getRuleContext<CypherParser::KU_DropFromToConnectionContext>(0);
+}
+
+
+size_t CypherParser::KU_AlterOptionsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_AlterOptions;
+}
+
+
+CypherParser::KU_AlterOptionsContext* CypherParser::kU_AlterOptions() {
+  KU_AlterOptionsContext *_localctx = _tracker.createInstance<KU_AlterOptionsContext>(_ctx, getState());
+  enterRule(_localctx, 80, CypherParser::RuleKU_AlterOptions);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1069);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 122, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1063);
+      kU_AddProperty();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1064);
+      kU_DropProperty();
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(1065);
+      kU_RenameTable();
+      break;
+    }
+
+    case 4: {
+      enterOuterAlt(_localctx, 4);
+      setState(1066);
+      kU_RenameProperty();
+      break;
+    }
+
+    case 5: {
+      enterOuterAlt(_localctx, 5);
+      setState(1067);
+      kU_AddFromToConnection();
+      break;
+    }
+
+    case 6: {
+      enterOuterAlt(_localctx, 6);
+      setState(1068);
+      kU_DropFromToConnection();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_AddPropertyContext ------------------------------------------------------------------
+
+CypherParser::KU_AddPropertyContext::KU_AddPropertyContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_AddPropertyContext::ADD() {
+  return getToken(CypherParser::ADD, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_AddPropertyContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_AddPropertyContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_PropertyKeyNameContext* CypherParser::KU_AddPropertyContext::oC_PropertyKeyName() {
+  return getRuleContext<CypherParser::OC_PropertyKeyNameContext>(0);
+}
+
+CypherParser::KU_DataTypeContext* CypherParser::KU_AddPropertyContext::kU_DataType() {
+  return getRuleContext<CypherParser::KU_DataTypeContext>(0);
+}
+
+CypherParser::KU_IfNotExistsContext* CypherParser::KU_AddPropertyContext::kU_IfNotExists() {
+  return getRuleContext<CypherParser::KU_IfNotExistsContext>(0);
+}
+
+CypherParser::KU_DefaultContext* CypherParser::KU_AddPropertyContext::kU_Default() {
+  return getRuleContext<CypherParser::KU_DefaultContext>(0);
+}
+
+
+size_t CypherParser::KU_AddPropertyContext::getRuleIndex() const {
+  return CypherParser::RuleKU_AddProperty;
+}
+
+
+CypherParser::KU_AddPropertyContext* CypherParser::kU_AddProperty() {
+  KU_AddPropertyContext *_localctx = _tracker.createInstance<KU_AddPropertyContext>(_ctx, getState());
+  enterRule(_localctx, 82, CypherParser::RuleKU_AddProperty);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1071);
+    match(CypherParser::ADD);
+    setState(1072);
+    match(CypherParser::SP);
+    setState(1076);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 123, _ctx)) {
+    case 1: {
+      setState(1073);
+      kU_IfNotExists();
+      setState(1074);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1078);
+    oC_PropertyKeyName();
+    setState(1079);
+    match(CypherParser::SP);
+    setState(1080);
+    kU_DataType(0);
+    setState(1083);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 124, _ctx)) {
+    case 1: {
+      setState(1081);
+      match(CypherParser::SP);
+      setState(1082);
+      kU_Default();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_DefaultContext ------------------------------------------------------------------
+
+CypherParser::KU_DefaultContext::KU_DefaultContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_DefaultContext::DEFAULT() {
+  return getToken(CypherParser::DEFAULT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_DefaultContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::KU_DefaultContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+
+size_t CypherParser::KU_DefaultContext::getRuleIndex() const {
+  return CypherParser::RuleKU_Default;
+}
+
+
+CypherParser::KU_DefaultContext* CypherParser::kU_Default() {
+  KU_DefaultContext *_localctx = _tracker.createInstance<KU_DefaultContext>(_ctx, getState());
+  enterRule(_localctx, 84, CypherParser::RuleKU_Default);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1085);
+    match(CypherParser::DEFAULT);
+    setState(1086);
+    match(CypherParser::SP);
+    setState(1087);
+    oC_Expression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_DropPropertyContext ------------------------------------------------------------------
+
+CypherParser::KU_DropPropertyContext::KU_DropPropertyContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_DropPropertyContext::DROP() {
+  return getToken(CypherParser::DROP, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_DropPropertyContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_DropPropertyContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_PropertyKeyNameContext* CypherParser::KU_DropPropertyContext::oC_PropertyKeyName() {
+  return getRuleContext<CypherParser::OC_PropertyKeyNameContext>(0);
+}
+
+CypherParser::KU_IfExistsContext* CypherParser::KU_DropPropertyContext::kU_IfExists() {
+  return getRuleContext<CypherParser::KU_IfExistsContext>(0);
+}
+
+
+size_t CypherParser::KU_DropPropertyContext::getRuleIndex() const {
+  return CypherParser::RuleKU_DropProperty;
+}
+
+
+CypherParser::KU_DropPropertyContext* CypherParser::kU_DropProperty() {
+  KU_DropPropertyContext *_localctx = _tracker.createInstance<KU_DropPropertyContext>(_ctx, getState());
+  enterRule(_localctx, 86, CypherParser::RuleKU_DropProperty);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1089);
+    match(CypherParser::DROP);
+    setState(1090);
+    match(CypherParser::SP);
+    setState(1094);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 125, _ctx)) {
+    case 1: {
+      setState(1091);
+      kU_IfExists();
+      setState(1092);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1096);
+    oC_PropertyKeyName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_RenameTableContext ------------------------------------------------------------------
+
+CypherParser::KU_RenameTableContext::KU_RenameTableContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_RenameTableContext::RENAME() {
+  return getToken(CypherParser::RENAME, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_RenameTableContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_RenameTableContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_RenameTableContext::TO() {
+  return getToken(CypherParser::TO, 0);
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_RenameTableContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+
+size_t CypherParser::KU_RenameTableContext::getRuleIndex() const {
+  return CypherParser::RuleKU_RenameTable;
+}
+
+
+CypherParser::KU_RenameTableContext* CypherParser::kU_RenameTable() {
+  KU_RenameTableContext *_localctx = _tracker.createInstance<KU_RenameTableContext>(_ctx, getState());
+  enterRule(_localctx, 88, CypherParser::RuleKU_RenameTable);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1098);
+    match(CypherParser::RENAME);
+    setState(1099);
+    match(CypherParser::SP);
+    setState(1100);
+    match(CypherParser::TO);
+    setState(1101);
+    match(CypherParser::SP);
+    setState(1102);
+    oC_SchemaName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_RenamePropertyContext ------------------------------------------------------------------
+
+CypherParser::KU_RenamePropertyContext::KU_RenamePropertyContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_RenamePropertyContext::RENAME() {
+  return getToken(CypherParser::RENAME, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_RenamePropertyContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_RenamePropertyContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<CypherParser::OC_PropertyKeyNameContext *> CypherParser::KU_RenamePropertyContext::oC_PropertyKeyName() {
+  return getRuleContexts<CypherParser::OC_PropertyKeyNameContext>();
+}
+
+CypherParser::OC_PropertyKeyNameContext* CypherParser::KU_RenamePropertyContext::oC_PropertyKeyName(size_t i) {
+  return getRuleContext<CypherParser::OC_PropertyKeyNameContext>(i);
+}
+
+tree::TerminalNode* CypherParser::KU_RenamePropertyContext::TO() {
+  return getToken(CypherParser::TO, 0);
+}
+
+
+size_t CypherParser::KU_RenamePropertyContext::getRuleIndex() const {
+  return CypherParser::RuleKU_RenameProperty;
+}
+
+
+CypherParser::KU_RenamePropertyContext* CypherParser::kU_RenameProperty() {
+  KU_RenamePropertyContext *_localctx = _tracker.createInstance<KU_RenamePropertyContext>(_ctx, getState());
+  enterRule(_localctx, 90, CypherParser::RuleKU_RenameProperty);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1104);
+    match(CypherParser::RENAME);
+    setState(1105);
+    match(CypherParser::SP);
+    setState(1106);
+    oC_PropertyKeyName();
+    setState(1107);
+    match(CypherParser::SP);
+    setState(1108);
+    match(CypherParser::TO);
+    setState(1109);
+    match(CypherParser::SP);
+    setState(1110);
+    oC_PropertyKeyName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_AddFromToConnectionContext ------------------------------------------------------------------
+
+CypherParser::KU_AddFromToConnectionContext::KU_AddFromToConnectionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_AddFromToConnectionContext::ADD() {
+  return getToken(CypherParser::ADD, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_AddFromToConnectionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_AddFromToConnectionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::KU_FromToConnectionContext* CypherParser::KU_AddFromToConnectionContext::kU_FromToConnection() {
+  return getRuleContext<CypherParser::KU_FromToConnectionContext>(0);
+}
+
+CypherParser::KU_IfNotExistsContext* CypherParser::KU_AddFromToConnectionContext::kU_IfNotExists() {
+  return getRuleContext<CypherParser::KU_IfNotExistsContext>(0);
+}
+
+
+size_t CypherParser::KU_AddFromToConnectionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_AddFromToConnection;
+}
+
+
+CypherParser::KU_AddFromToConnectionContext* CypherParser::kU_AddFromToConnection() {
+  KU_AddFromToConnectionContext *_localctx = _tracker.createInstance<KU_AddFromToConnectionContext>(_ctx, getState());
+  enterRule(_localctx, 92, CypherParser::RuleKU_AddFromToConnection);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1112);
+    match(CypherParser::ADD);
+    setState(1113);
+    match(CypherParser::SP);
+    setState(1117);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::IF) {
+      setState(1114);
+      kU_IfNotExists();
+      setState(1115);
+      match(CypherParser::SP);
+    }
+    setState(1119);
+    kU_FromToConnection();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_DropFromToConnectionContext ------------------------------------------------------------------
+
+CypherParser::KU_DropFromToConnectionContext::KU_DropFromToConnectionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_DropFromToConnectionContext::DROP() {
+  return getToken(CypherParser::DROP, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_DropFromToConnectionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_DropFromToConnectionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::KU_FromToConnectionContext* CypherParser::KU_DropFromToConnectionContext::kU_FromToConnection() {
+  return getRuleContext<CypherParser::KU_FromToConnectionContext>(0);
+}
+
+CypherParser::KU_IfExistsContext* CypherParser::KU_DropFromToConnectionContext::kU_IfExists() {
+  return getRuleContext<CypherParser::KU_IfExistsContext>(0);
+}
+
+
+size_t CypherParser::KU_DropFromToConnectionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_DropFromToConnection;
+}
+
+
+CypherParser::KU_DropFromToConnectionContext* CypherParser::kU_DropFromToConnection() {
+  KU_DropFromToConnectionContext *_localctx = _tracker.createInstance<KU_DropFromToConnectionContext>(_ctx, getState());
+  enterRule(_localctx, 94, CypherParser::RuleKU_DropFromToConnection);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1121);
+    match(CypherParser::DROP);
+    setState(1122);
+    match(CypherParser::SP);
+    setState(1126);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::IF) {
+      setState(1123);
+      kU_IfExists();
+      setState(1124);
+      match(CypherParser::SP);
+    }
+    setState(1128);
+    kU_FromToConnection();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ColumnDefinitionsContext ------------------------------------------------------------------
+
+CypherParser::KU_ColumnDefinitionsContext::KU_ColumnDefinitionsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_ColumnDefinitionContext *> CypherParser::KU_ColumnDefinitionsContext::kU_ColumnDefinition() {
+  return getRuleContexts<CypherParser::KU_ColumnDefinitionContext>();
+}
+
+CypherParser::KU_ColumnDefinitionContext* CypherParser::KU_ColumnDefinitionsContext::kU_ColumnDefinition(size_t i) {
+  return getRuleContext<CypherParser::KU_ColumnDefinitionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_ColumnDefinitionsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_ColumnDefinitionsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_ColumnDefinitionsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ColumnDefinitions;
+}
+
+
+CypherParser::KU_ColumnDefinitionsContext* CypherParser::kU_ColumnDefinitions() {
+  KU_ColumnDefinitionsContext *_localctx = _tracker.createInstance<KU_ColumnDefinitionsContext>(_ctx, getState());
+  enterRule(_localctx, 96, CypherParser::RuleKU_ColumnDefinitions);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1130);
+    kU_ColumnDefinition();
+    setState(1141);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 130, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(1132);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1131);
+          match(CypherParser::SP);
+        }
+        setState(1134);
+        match(CypherParser::T__3);
+        setState(1136);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1135);
+          match(CypherParser::SP);
+        }
+        setState(1138);
+        kU_ColumnDefinition(); 
+      }
+      setState(1143);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 130, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ColumnDefinitionContext ------------------------------------------------------------------
+
+CypherParser::KU_ColumnDefinitionContext::KU_ColumnDefinitionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_PropertyKeyNameContext* CypherParser::KU_ColumnDefinitionContext::oC_PropertyKeyName() {
+  return getRuleContext<CypherParser::OC_PropertyKeyNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_ColumnDefinitionContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::KU_DataTypeContext* CypherParser::KU_ColumnDefinitionContext::kU_DataType() {
+  return getRuleContext<CypherParser::KU_DataTypeContext>(0);
+}
+
+
+size_t CypherParser::KU_ColumnDefinitionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ColumnDefinition;
+}
+
+
+CypherParser::KU_ColumnDefinitionContext* CypherParser::kU_ColumnDefinition() {
+  KU_ColumnDefinitionContext *_localctx = _tracker.createInstance<KU_ColumnDefinitionContext>(_ctx, getState());
+  enterRule(_localctx, 98, CypherParser::RuleKU_ColumnDefinition);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1144);
+    oC_PropertyKeyName();
+    setState(1145);
+    match(CypherParser::SP);
+    setState(1146);
+    kU_DataType(0);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_PropertyDefinitionsContext ------------------------------------------------------------------
+
+CypherParser::KU_PropertyDefinitionsContext::KU_PropertyDefinitionsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_PropertyDefinitionContext *> CypherParser::KU_PropertyDefinitionsContext::kU_PropertyDefinition() {
+  return getRuleContexts<CypherParser::KU_PropertyDefinitionContext>();
+}
+
+CypherParser::KU_PropertyDefinitionContext* CypherParser::KU_PropertyDefinitionsContext::kU_PropertyDefinition(size_t i) {
+  return getRuleContext<CypherParser::KU_PropertyDefinitionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_PropertyDefinitionsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_PropertyDefinitionsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_PropertyDefinitionsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_PropertyDefinitions;
+}
+
+
+CypherParser::KU_PropertyDefinitionsContext* CypherParser::kU_PropertyDefinitions() {
+  KU_PropertyDefinitionsContext *_localctx = _tracker.createInstance<KU_PropertyDefinitionsContext>(_ctx, getState());
+  enterRule(_localctx, 100, CypherParser::RuleKU_PropertyDefinitions);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1148);
+    kU_PropertyDefinition();
+    setState(1159);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 133, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(1150);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1149);
+          match(CypherParser::SP);
+        }
+        setState(1152);
+        match(CypherParser::T__3);
+        setState(1154);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1153);
+          match(CypherParser::SP);
+        }
+        setState(1156);
+        kU_PropertyDefinition(); 
+      }
+      setState(1161);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 133, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_PropertyDefinitionContext ------------------------------------------------------------------
+
+CypherParser::KU_PropertyDefinitionContext::KU_PropertyDefinitionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::KU_ColumnDefinitionContext* CypherParser::KU_PropertyDefinitionContext::kU_ColumnDefinition() {
+  return getRuleContext<CypherParser::KU_ColumnDefinitionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_PropertyDefinitionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_PropertyDefinitionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::KU_DefaultContext* CypherParser::KU_PropertyDefinitionContext::kU_Default() {
+  return getRuleContext<CypherParser::KU_DefaultContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_PropertyDefinitionContext::PRIMARY() {
+  return getToken(CypherParser::PRIMARY, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_PropertyDefinitionContext::KEY() {
+  return getToken(CypherParser::KEY, 0);
+}
+
+
+size_t CypherParser::KU_PropertyDefinitionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_PropertyDefinition;
+}
+
+
+CypherParser::KU_PropertyDefinitionContext* CypherParser::kU_PropertyDefinition() {
+  KU_PropertyDefinitionContext *_localctx = _tracker.createInstance<KU_PropertyDefinitionContext>(_ctx, getState());
+  enterRule(_localctx, 102, CypherParser::RuleKU_PropertyDefinition);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1162);
+    kU_ColumnDefinition();
+    setState(1165);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 134, _ctx)) {
+    case 1: {
+      setState(1163);
+      match(CypherParser::SP);
+      setState(1164);
+      kU_Default();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1171);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 135, _ctx)) {
+    case 1: {
+      setState(1167);
+      match(CypherParser::SP);
+      setState(1168);
+      match(CypherParser::PRIMARY);
+      setState(1169);
+      match(CypherParser::SP);
+      setState(1170);
+      match(CypherParser::KEY);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_CreateNodeConstraintContext ------------------------------------------------------------------
+
+CypherParser::KU_CreateNodeConstraintContext::KU_CreateNodeConstraintContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_CreateNodeConstraintContext::PRIMARY() {
+  return getToken(CypherParser::PRIMARY, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_CreateNodeConstraintContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateNodeConstraintContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_CreateNodeConstraintContext::KEY() {
+  return getToken(CypherParser::KEY, 0);
+}
+
+CypherParser::OC_PropertyKeyNameContext* CypherParser::KU_CreateNodeConstraintContext::oC_PropertyKeyName() {
+  return getRuleContext<CypherParser::OC_PropertyKeyNameContext>(0);
+}
+
+
+size_t CypherParser::KU_CreateNodeConstraintContext::getRuleIndex() const {
+  return CypherParser::RuleKU_CreateNodeConstraint;
+}
+
+
+CypherParser::KU_CreateNodeConstraintContext* CypherParser::kU_CreateNodeConstraint() {
+  KU_CreateNodeConstraintContext *_localctx = _tracker.createInstance<KU_CreateNodeConstraintContext>(_ctx, getState());
+  enterRule(_localctx, 104, CypherParser::RuleKU_CreateNodeConstraint);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1173);
+    match(CypherParser::PRIMARY);
+    setState(1174);
+    match(CypherParser::SP);
+    setState(1175);
+    match(CypherParser::KEY);
+    setState(1177);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1176);
+      match(CypherParser::SP);
+    }
+    setState(1179);
+    match(CypherParser::T__1);
+    setState(1181);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1180);
+      match(CypherParser::SP);
+    }
+    setState(1183);
+    oC_PropertyKeyName();
+    setState(1185);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1184);
+      match(CypherParser::SP);
+    }
+    setState(1187);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_UnionTypeContext ------------------------------------------------------------------
+
+CypherParser::KU_UnionTypeContext::KU_UnionTypeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_UnionTypeContext::UNION() {
+  return getToken(CypherParser::UNION, 0);
+}
+
+CypherParser::KU_ColumnDefinitionsContext* CypherParser::KU_UnionTypeContext::kU_ColumnDefinitions() {
+  return getRuleContext<CypherParser::KU_ColumnDefinitionsContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_UnionTypeContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_UnionTypeContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_UnionTypeContext::getRuleIndex() const {
+  return CypherParser::RuleKU_UnionType;
+}
+
+
+CypherParser::KU_UnionTypeContext* CypherParser::kU_UnionType() {
+  KU_UnionTypeContext *_localctx = _tracker.createInstance<KU_UnionTypeContext>(_ctx, getState());
+  enterRule(_localctx, 106, CypherParser::RuleKU_UnionType);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1189);
+    match(CypherParser::UNION);
+    setState(1191);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1190);
+      match(CypherParser::SP);
+    }
+    setState(1193);
+    match(CypherParser::T__1);
+    setState(1195);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1194);
+      match(CypherParser::SP);
+    }
+    setState(1197);
+    kU_ColumnDefinitions();
+    setState(1199);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1198);
+      match(CypherParser::SP);
+    }
+    setState(1201);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_StructTypeContext ------------------------------------------------------------------
+
+CypherParser::KU_StructTypeContext::KU_StructTypeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_StructTypeContext::STRUCT() {
+  return getToken(CypherParser::STRUCT, 0);
+}
+
+CypherParser::KU_ColumnDefinitionsContext* CypherParser::KU_StructTypeContext::kU_ColumnDefinitions() {
+  return getRuleContext<CypherParser::KU_ColumnDefinitionsContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_StructTypeContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_StructTypeContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_StructTypeContext::getRuleIndex() const {
+  return CypherParser::RuleKU_StructType;
+}
+
+
+CypherParser::KU_StructTypeContext* CypherParser::kU_StructType() {
+  KU_StructTypeContext *_localctx = _tracker.createInstance<KU_StructTypeContext>(_ctx, getState());
+  enterRule(_localctx, 108, CypherParser::RuleKU_StructType);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1203);
+    match(CypherParser::STRUCT);
+    setState(1205);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1204);
+      match(CypherParser::SP);
+    }
+    setState(1207);
+    match(CypherParser::T__1);
+    setState(1209);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1208);
+      match(CypherParser::SP);
+    }
+    setState(1211);
+    kU_ColumnDefinitions();
+    setState(1213);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1212);
+      match(CypherParser::SP);
+    }
+    setState(1215);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_MapTypeContext ------------------------------------------------------------------
+
+CypherParser::KU_MapTypeContext::KU_MapTypeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_MapTypeContext::MAP() {
+  return getToken(CypherParser::MAP, 0);
+}
+
+std::vector<CypherParser::KU_DataTypeContext *> CypherParser::KU_MapTypeContext::kU_DataType() {
+  return getRuleContexts<CypherParser::KU_DataTypeContext>();
+}
+
+CypherParser::KU_DataTypeContext* CypherParser::KU_MapTypeContext::kU_DataType(size_t i) {
+  return getRuleContext<CypherParser::KU_DataTypeContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_MapTypeContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_MapTypeContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_MapTypeContext::getRuleIndex() const {
+  return CypherParser::RuleKU_MapType;
+}
+
+
+CypherParser::KU_MapTypeContext* CypherParser::kU_MapType() {
+  KU_MapTypeContext *_localctx = _tracker.createInstance<KU_MapTypeContext>(_ctx, getState());
+  enterRule(_localctx, 110, CypherParser::RuleKU_MapType);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1217);
+    match(CypherParser::MAP);
+    setState(1219);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1218);
+      match(CypherParser::SP);
+    }
+    setState(1221);
+    match(CypherParser::T__1);
+    setState(1223);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1222);
+      match(CypherParser::SP);
+    }
+    setState(1225);
+    kU_DataType(0);
+    setState(1227);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1226);
+      match(CypherParser::SP);
+    }
+    setState(1229);
+    match(CypherParser::T__3);
+    setState(1231);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1230);
+      match(CypherParser::SP);
+    }
+    setState(1233);
+    kU_DataType(0);
+    setState(1235);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1234);
+      match(CypherParser::SP);
+    }
+    setState(1237);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_DecimalTypeContext ------------------------------------------------------------------
+
+CypherParser::KU_DecimalTypeContext::KU_DecimalTypeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_DecimalTypeContext::DECIMAL() {
+  return getToken(CypherParser::DECIMAL, 0);
+}
+
+std::vector<CypherParser::OC_IntegerLiteralContext *> CypherParser::KU_DecimalTypeContext::oC_IntegerLiteral() {
+  return getRuleContexts<CypherParser::OC_IntegerLiteralContext>();
+}
+
+CypherParser::OC_IntegerLiteralContext* CypherParser::KU_DecimalTypeContext::oC_IntegerLiteral(size_t i) {
+  return getRuleContext<CypherParser::OC_IntegerLiteralContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_DecimalTypeContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_DecimalTypeContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_DecimalTypeContext::getRuleIndex() const {
+  return CypherParser::RuleKU_DecimalType;
+}
+
+
+CypherParser::KU_DecimalTypeContext* CypherParser::kU_DecimalType() {
+  KU_DecimalTypeContext *_localctx = _tracker.createInstance<KU_DecimalTypeContext>(_ctx, getState());
+  enterRule(_localctx, 112, CypherParser::RuleKU_DecimalType);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1239);
+    match(CypherParser::DECIMAL);
+    setState(1241);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1240);
+      match(CypherParser::SP);
+    }
+    setState(1243);
+    match(CypherParser::T__1);
+    setState(1245);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1244);
+      match(CypherParser::SP);
+    }
+    setState(1247);
+    oC_IntegerLiteral();
+    setState(1249);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1248);
+      match(CypherParser::SP);
+    }
+    setState(1251);
+    match(CypherParser::T__3);
+    setState(1253);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1252);
+      match(CypherParser::SP);
+    }
+    setState(1255);
+    oC_IntegerLiteral();
+    setState(1257);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1256);
+      match(CypherParser::SP);
+    }
+    setState(1259);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_DataTypeContext ------------------------------------------------------------------
+
+CypherParser::KU_DataTypeContext::KU_DataTypeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_DataTypeContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+CypherParser::KU_UnionTypeContext* CypherParser::KU_DataTypeContext::kU_UnionType() {
+  return getRuleContext<CypherParser::KU_UnionTypeContext>(0);
+}
+
+CypherParser::KU_StructTypeContext* CypherParser::KU_DataTypeContext::kU_StructType() {
+  return getRuleContext<CypherParser::KU_StructTypeContext>(0);
+}
+
+CypherParser::KU_MapTypeContext* CypherParser::KU_DataTypeContext::kU_MapType() {
+  return getRuleContext<CypherParser::KU_MapTypeContext>(0);
+}
+
+CypherParser::KU_DecimalTypeContext* CypherParser::KU_DataTypeContext::kU_DecimalType() {
+  return getRuleContext<CypherParser::KU_DecimalTypeContext>(0);
+}
+
+CypherParser::KU_DataTypeContext* CypherParser::KU_DataTypeContext::kU_DataType() {
+  return getRuleContext<CypherParser::KU_DataTypeContext>(0);
+}
+
+CypherParser::KU_ListIdentifiersContext* CypherParser::KU_DataTypeContext::kU_ListIdentifiers() {
+  return getRuleContext<CypherParser::KU_ListIdentifiersContext>(0);
+}
+
+
+size_t CypherParser::KU_DataTypeContext::getRuleIndex() const {
+  return CypherParser::RuleKU_DataType;
+}
+
+
+
+CypherParser::KU_DataTypeContext* CypherParser::kU_DataType() {
+   return kU_DataType(0);
+}
+
+CypherParser::KU_DataTypeContext* CypherParser::kU_DataType(int precedence) {
+  ParserRuleContext *parentContext = _ctx;
+  size_t parentState = getState();
+  CypherParser::KU_DataTypeContext *_localctx = _tracker.createInstance<KU_DataTypeContext>(_ctx, parentState);
+  CypherParser::KU_DataTypeContext *previousContext = _localctx;
+  (void)previousContext; // Silence compiler, in case the context is not used by generated code.
+  size_t startState = 114;
+  enterRecursionRule(_localctx, 114, CypherParser::RuleKU_DataType, precedence);
+
+    
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    unrollRecursionContexts(parentContext);
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1267);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 155, _ctx)) {
+    case 1: {
+      setState(1262);
+      oC_SymbolicName();
+      break;
+    }
+
+    case 2: {
+      setState(1263);
+      kU_UnionType();
+      break;
+    }
+
+    case 3: {
+      setState(1264);
+      kU_StructType();
+      break;
+    }
+
+    case 4: {
+      setState(1265);
+      kU_MapType();
+      break;
+    }
+
+    case 5: {
+      setState(1266);
+      kU_DecimalType();
+      break;
+    }
+
+    default:
+      break;
+    }
+    _ctx->stop = _input->LT(-1);
+    setState(1273);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 156, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        if (!_parseListeners.empty())
+          triggerExitRuleEvent();
+        previousContext = _localctx;
+        _localctx = _tracker.createInstance<KU_DataTypeContext>(parentContext, parentState);
+        pushNewRecursionContext(_localctx, startState, RuleKU_DataType);
+        setState(1269);
+
+        if (!(precpred(_ctx, 5))) throw FailedPredicateException(this, "precpred(_ctx, 5)");
+        setState(1270);
+        kU_ListIdentifiers(); 
+      }
+      setState(1275);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 156, _ctx);
+    }
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+  return _localctx;
+}
+
+//----------------- KU_ListIdentifiersContext ------------------------------------------------------------------
+
+CypherParser::KU_ListIdentifiersContext::KU_ListIdentifiersContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_ListIdentifierContext *> CypherParser::KU_ListIdentifiersContext::kU_ListIdentifier() {
+  return getRuleContexts<CypherParser::KU_ListIdentifierContext>();
+}
+
+CypherParser::KU_ListIdentifierContext* CypherParser::KU_ListIdentifiersContext::kU_ListIdentifier(size_t i) {
+  return getRuleContext<CypherParser::KU_ListIdentifierContext>(i);
+}
+
+
+size_t CypherParser::KU_ListIdentifiersContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ListIdentifiers;
+}
+
+
+CypherParser::KU_ListIdentifiersContext* CypherParser::kU_ListIdentifiers() {
+  KU_ListIdentifiersContext *_localctx = _tracker.createInstance<KU_ListIdentifiersContext>(_ctx, getState());
+  enterRule(_localctx, 116, CypherParser::RuleKU_ListIdentifiers);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1276);
+    kU_ListIdentifier();
+    setState(1280);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 157, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(1277);
+        kU_ListIdentifier(); 
+      }
+      setState(1282);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 157, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ListIdentifierContext ------------------------------------------------------------------
+
+CypherParser::KU_ListIdentifierContext::KU_ListIdentifierContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_IntegerLiteralContext* CypherParser::KU_ListIdentifierContext::oC_IntegerLiteral() {
+  return getRuleContext<CypherParser::OC_IntegerLiteralContext>(0);
+}
+
+
+size_t CypherParser::KU_ListIdentifierContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ListIdentifier;
+}
+
+
+CypherParser::KU_ListIdentifierContext* CypherParser::kU_ListIdentifier() {
+  KU_ListIdentifierContext *_localctx = _tracker.createInstance<KU_ListIdentifierContext>(_ctx, getState());
+  enterRule(_localctx, 118, CypherParser::RuleKU_ListIdentifier);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1283);
+    match(CypherParser::T__6);
+    setState(1285);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::DecimalInteger) {
+      setState(1284);
+      oC_IntegerLiteral();
+    }
+    setState(1287);
+    match(CypherParser::T__7);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_AnyCypherOptionContext ------------------------------------------------------------------
+
+CypherParser::OC_AnyCypherOptionContext::OC_AnyCypherOptionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_ExplainContext* CypherParser::OC_AnyCypherOptionContext::oC_Explain() {
+  return getRuleContext<CypherParser::OC_ExplainContext>(0);
+}
+
+CypherParser::OC_ProfileContext* CypherParser::OC_AnyCypherOptionContext::oC_Profile() {
+  return getRuleContext<CypherParser::OC_ProfileContext>(0);
+}
+
+
+size_t CypherParser::OC_AnyCypherOptionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_AnyCypherOption;
+}
+
+
+CypherParser::OC_AnyCypherOptionContext* CypherParser::oC_AnyCypherOption() {
+  OC_AnyCypherOptionContext *_localctx = _tracker.createInstance<OC_AnyCypherOptionContext>(_ctx, getState());
+  enterRule(_localctx, 120, CypherParser::RuleOC_AnyCypherOption);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1291);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::EXPLAIN: {
+        enterOuterAlt(_localctx, 1);
+        setState(1289);
+        oC_Explain();
+        break;
+      }
+
+      case CypherParser::PROFILE: {
+        enterOuterAlt(_localctx, 2);
+        setState(1290);
+        oC_Profile();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ExplainContext ------------------------------------------------------------------
+
+CypherParser::OC_ExplainContext::OC_ExplainContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_ExplainContext::EXPLAIN() {
+  return getToken(CypherParser::EXPLAIN, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_ExplainContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_ExplainContext::LOGICAL() {
+  return getToken(CypherParser::LOGICAL, 0);
+}
+
+
+size_t CypherParser::OC_ExplainContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Explain;
+}
+
+
+CypherParser::OC_ExplainContext* CypherParser::oC_Explain() {
+  OC_ExplainContext *_localctx = _tracker.createInstance<OC_ExplainContext>(_ctx, getState());
+  enterRule(_localctx, 122, CypherParser::RuleOC_Explain);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1293);
+    match(CypherParser::EXPLAIN);
+    setState(1296);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 160, _ctx)) {
+    case 1: {
+      setState(1294);
+      match(CypherParser::SP);
+      setState(1295);
+      match(CypherParser::LOGICAL);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ProfileContext ------------------------------------------------------------------
+
+CypherParser::OC_ProfileContext::OC_ProfileContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_ProfileContext::PROFILE() {
+  return getToken(CypherParser::PROFILE, 0);
+}
+
+
+size_t CypherParser::OC_ProfileContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Profile;
+}
+
+
+CypherParser::OC_ProfileContext* CypherParser::oC_Profile() {
+  OC_ProfileContext *_localctx = _tracker.createInstance<OC_ProfileContext>(_ctx, getState());
+  enterRule(_localctx, 124, CypherParser::RuleOC_Profile);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1298);
+    match(CypherParser::PROFILE);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_TransactionContext ------------------------------------------------------------------
+
+CypherParser::KU_TransactionContext::KU_TransactionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_TransactionContext::BEGIN() {
+  return getToken(CypherParser::BEGIN, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_TransactionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_TransactionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_TransactionContext::TRANSACTION() {
+  return getToken(CypherParser::TRANSACTION, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_TransactionContext::READ() {
+  return getToken(CypherParser::READ, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_TransactionContext::ONLY() {
+  return getToken(CypherParser::ONLY, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_TransactionContext::COMMIT() {
+  return getToken(CypherParser::COMMIT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_TransactionContext::ROLLBACK() {
+  return getToken(CypherParser::ROLLBACK, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_TransactionContext::CHECKPOINT() {
+  return getToken(CypherParser::CHECKPOINT, 0);
+}
+
+
+size_t CypherParser::KU_TransactionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_Transaction;
+}
+
+
+CypherParser::KU_TransactionContext* CypherParser::kU_Transaction() {
+  KU_TransactionContext *_localctx = _tracker.createInstance<KU_TransactionContext>(_ctx, getState());
+  enterRule(_localctx, 126, CypherParser::RuleKU_Transaction);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1313);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 161, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1300);
+      match(CypherParser::BEGIN);
+      setState(1301);
+      match(CypherParser::SP);
+      setState(1302);
+      match(CypherParser::TRANSACTION);
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1303);
+      match(CypherParser::BEGIN);
+      setState(1304);
+      match(CypherParser::SP);
+      setState(1305);
+      match(CypherParser::TRANSACTION);
+      setState(1306);
+      match(CypherParser::SP);
+      setState(1307);
+      match(CypherParser::READ);
+      setState(1308);
+      match(CypherParser::SP);
+      setState(1309);
+      match(CypherParser::ONLY);
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(1310);
+      match(CypherParser::COMMIT);
+      break;
+    }
+
+    case 4: {
+      enterOuterAlt(_localctx, 4);
+      setState(1311);
+      match(CypherParser::ROLLBACK);
+      break;
+    }
+
+    case 5: {
+      enterOuterAlt(_localctx, 5);
+      setState(1312);
+      match(CypherParser::CHECKPOINT);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ExtensionContext ------------------------------------------------------------------
+
+CypherParser::KU_ExtensionContext::KU_ExtensionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::KU_LoadExtensionContext* CypherParser::KU_ExtensionContext::kU_LoadExtension() {
+  return getRuleContext<CypherParser::KU_LoadExtensionContext>(0);
+}
+
+CypherParser::KU_InstallExtensionContext* CypherParser::KU_ExtensionContext::kU_InstallExtension() {
+  return getRuleContext<CypherParser::KU_InstallExtensionContext>(0);
+}
+
+CypherParser::KU_UninstallExtensionContext* CypherParser::KU_ExtensionContext::kU_UninstallExtension() {
+  return getRuleContext<CypherParser::KU_UninstallExtensionContext>(0);
+}
+
+CypherParser::KU_UpdateExtensionContext* CypherParser::KU_ExtensionContext::kU_UpdateExtension() {
+  return getRuleContext<CypherParser::KU_UpdateExtensionContext>(0);
+}
+
+
+size_t CypherParser::KU_ExtensionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_Extension;
+}
+
+
+CypherParser::KU_ExtensionContext* CypherParser::kU_Extension() {
+  KU_ExtensionContext *_localctx = _tracker.createInstance<KU_ExtensionContext>(_ctx, getState());
+  enterRule(_localctx, 128, CypherParser::RuleKU_Extension);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1319);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::LOAD: {
+        enterOuterAlt(_localctx, 1);
+        setState(1315);
+        kU_LoadExtension();
+        break;
+      }
+
+      case CypherParser::FORCE:
+      case CypherParser::INSTALL: {
+        enterOuterAlt(_localctx, 2);
+        setState(1316);
+        kU_InstallExtension();
+        break;
+      }
+
+      case CypherParser::UNINSTALL: {
+        enterOuterAlt(_localctx, 3);
+        setState(1317);
+        kU_UninstallExtension();
+        break;
+      }
+
+      case CypherParser::UPDATE: {
+        enterOuterAlt(_localctx, 4);
+        setState(1318);
+        kU_UpdateExtension();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_LoadExtensionContext ------------------------------------------------------------------
+
+CypherParser::KU_LoadExtensionContext::KU_LoadExtensionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_LoadExtensionContext::LOAD() {
+  return getToken(CypherParser::LOAD, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_LoadExtensionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_LoadExtensionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_LoadExtensionContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+CypherParser::OC_VariableContext* CypherParser::KU_LoadExtensionContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_LoadExtensionContext::EXTENSION() {
+  return getToken(CypherParser::EXTENSION, 0);
+}
+
+
+size_t CypherParser::KU_LoadExtensionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_LoadExtension;
+}
+
+
+CypherParser::KU_LoadExtensionContext* CypherParser::kU_LoadExtension() {
+  KU_LoadExtensionContext *_localctx = _tracker.createInstance<KU_LoadExtensionContext>(_ctx, getState());
+  enterRule(_localctx, 130, CypherParser::RuleKU_LoadExtension);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1321);
+    match(CypherParser::LOAD);
+    setState(1322);
+    match(CypherParser::SP);
+    setState(1325);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 163, _ctx)) {
+    case 1: {
+      setState(1323);
+      match(CypherParser::EXTENSION);
+      setState(1324);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1329);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::StringLiteral: {
+        setState(1327);
+        match(CypherParser::StringLiteral);
+        break;
+      }
+
+      case CypherParser::ADD:
+      case CypherParser::ALTER:
+      case CypherParser::AS:
+      case CypherParser::ATTACH:
+      case CypherParser::BEGIN:
+      case CypherParser::BY:
+      case CypherParser::CALL:
+      case CypherParser::CHECKPOINT:
+      case CypherParser::COMMENT:
+      case CypherParser::COMMIT:
+      case CypherParser::CONTAINS:
+      case CypherParser::COPY:
+      case CypherParser::COUNT:
+      case CypherParser::CYCLE:
+      case CypherParser::DATABASE:
+      case CypherParser::DELETE:
+      case CypherParser::DETACH:
+      case CypherParser::DROP:
+      case CypherParser::EXPLAIN:
+      case CypherParser::EXPORT:
+      case CypherParser::EXTENSION:
+      case CypherParser::FROM:
+      case CypherParser::FORCE:
+      case CypherParser::GRAPH:
+      case CypherParser::IMPORT:
+      case CypherParser::IF:
+      case CypherParser::INCREMENT:
+      case CypherParser::IS:
+      case CypherParser::KEY:
+      case CypherParser::LIMIT:
+      case CypherParser::LOAD:
+      case CypherParser::LOGICAL:
+      case CypherParser::MATCH:
+      case CypherParser::MAXVALUE:
+      case CypherParser::MERGE:
+      case CypherParser::MINVALUE:
+      case CypherParser::NO:
+      case CypherParser::NODE:
+      case CypherParser::PROJECT:
+      case CypherParser::READ:
+      case CypherParser::REL:
+      case CypherParser::RENAME:
+      case CypherParser::RETURN:
+      case CypherParser::ROLLBACK:
+      case CypherParser::SEQUENCE:
+      case CypherParser::SET:
+      case CypherParser::START:
+      case CypherParser::STRUCT:
+      case CypherParser::TO:
+      case CypherParser::TRANSACTION:
+      case CypherParser::TYPE:
+      case CypherParser::UNINSTALL:
+      case CypherParser::UPDATE:
+      case CypherParser::USE:
+      case CypherParser::WRITE:
+      case CypherParser::YIELD:
+      case CypherParser::USER:
+      case CypherParser::PASSWORD:
+      case CypherParser::ROLE:
+      case CypherParser::MAP:
+      case CypherParser::DECIMAL:
+      case CypherParser::L_SKIP:
+      case CypherParser::HexLetter:
+      case CypherParser::UnescapedSymbolicName:
+      case CypherParser::EscapedSymbolicName: {
+        setState(1328);
+        oC_Variable();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_InstallExtensionContext ------------------------------------------------------------------
+
+CypherParser::KU_InstallExtensionContext::KU_InstallExtensionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_InstallExtensionContext::INSTALL() {
+  return getToken(CypherParser::INSTALL, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_InstallExtensionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_InstallExtensionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_VariableContext* CypherParser::KU_InstallExtensionContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_InstallExtensionContext::FORCE() {
+  return getToken(CypherParser::FORCE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_InstallExtensionContext::FROM() {
+  return getToken(CypherParser::FROM, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_InstallExtensionContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+
+size_t CypherParser::KU_InstallExtensionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_InstallExtension;
+}
+
+
+CypherParser::KU_InstallExtensionContext* CypherParser::kU_InstallExtension() {
+  KU_InstallExtensionContext *_localctx = _tracker.createInstance<KU_InstallExtensionContext>(_ctx, getState());
+  enterRule(_localctx, 132, CypherParser::RuleKU_InstallExtension);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1333);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::FORCE) {
+      setState(1331);
+      match(CypherParser::FORCE);
+      setState(1332);
+      match(CypherParser::SP);
+    }
+    setState(1335);
+    match(CypherParser::INSTALL);
+    setState(1336);
+    match(CypherParser::SP);
+    setState(1337);
+    oC_Variable();
+    setState(1342);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 166, _ctx)) {
+    case 1: {
+      setState(1338);
+      match(CypherParser::SP);
+      setState(1339);
+      match(CypherParser::FROM);
+      setState(1340);
+      match(CypherParser::SP);
+      setState(1341);
+      match(CypherParser::StringLiteral);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_UninstallExtensionContext ------------------------------------------------------------------
+
+CypherParser::KU_UninstallExtensionContext::KU_UninstallExtensionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_UninstallExtensionContext::UNINSTALL() {
+  return getToken(CypherParser::UNINSTALL, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_UninstallExtensionContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_VariableContext* CypherParser::KU_UninstallExtensionContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+
+size_t CypherParser::KU_UninstallExtensionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_UninstallExtension;
+}
+
+
+CypherParser::KU_UninstallExtensionContext* CypherParser::kU_UninstallExtension() {
+  KU_UninstallExtensionContext *_localctx = _tracker.createInstance<KU_UninstallExtensionContext>(_ctx, getState());
+  enterRule(_localctx, 134, CypherParser::RuleKU_UninstallExtension);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1344);
+    match(CypherParser::UNINSTALL);
+    setState(1345);
+    match(CypherParser::SP);
+    setState(1346);
+    oC_Variable();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_UpdateExtensionContext ------------------------------------------------------------------
+
+CypherParser::KU_UpdateExtensionContext::KU_UpdateExtensionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_UpdateExtensionContext::UPDATE() {
+  return getToken(CypherParser::UPDATE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_UpdateExtensionContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_VariableContext* CypherParser::KU_UpdateExtensionContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+
+size_t CypherParser::KU_UpdateExtensionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_UpdateExtension;
+}
+
+
+CypherParser::KU_UpdateExtensionContext* CypherParser::kU_UpdateExtension() {
+  KU_UpdateExtensionContext *_localctx = _tracker.createInstance<KU_UpdateExtensionContext>(_ctx, getState());
+  enterRule(_localctx, 136, CypherParser::RuleKU_UpdateExtension);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1348);
+    match(CypherParser::UPDATE);
+    setState(1349);
+    match(CypherParser::SP);
+    setState(1350);
+    oC_Variable();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_QueryContext ------------------------------------------------------------------
+
+CypherParser::OC_QueryContext::OC_QueryContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_RegularQueryContext* CypherParser::OC_QueryContext::oC_RegularQuery() {
+  return getRuleContext<CypherParser::OC_RegularQueryContext>(0);
+}
+
+
+size_t CypherParser::OC_QueryContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Query;
+}
+
+
+CypherParser::OC_QueryContext* CypherParser::oC_Query() {
+  OC_QueryContext *_localctx = _tracker.createInstance<OC_QueryContext>(_ctx, getState());
+  enterRule(_localctx, 138, CypherParser::RuleOC_Query);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1352);
+    oC_RegularQuery();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_RegularQueryContext ------------------------------------------------------------------
+
+CypherParser::OC_RegularQueryContext::OC_RegularQueryContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SingleQueryContext* CypherParser::OC_RegularQueryContext::oC_SingleQuery() {
+  return getRuleContext<CypherParser::OC_SingleQueryContext>(0);
+}
+
+std::vector<CypherParser::OC_UnionContext *> CypherParser::OC_RegularQueryContext::oC_Union() {
+  return getRuleContexts<CypherParser::OC_UnionContext>();
+}
+
+CypherParser::OC_UnionContext* CypherParser::OC_RegularQueryContext::oC_Union(size_t i) {
+  return getRuleContext<CypherParser::OC_UnionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_RegularQueryContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_RegularQueryContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<CypherParser::OC_ReturnContext *> CypherParser::OC_RegularQueryContext::oC_Return() {
+  return getRuleContexts<CypherParser::OC_ReturnContext>();
+}
+
+CypherParser::OC_ReturnContext* CypherParser::OC_RegularQueryContext::oC_Return(size_t i) {
+  return getRuleContext<CypherParser::OC_ReturnContext>(i);
+}
+
+
+size_t CypherParser::OC_RegularQueryContext::getRuleIndex() const {
+  return CypherParser::RuleOC_RegularQuery;
+}
+
+
+CypherParser::OC_RegularQueryContext* CypherParser::oC_RegularQuery() {
+  OC_RegularQueryContext *_localctx = _tracker.createInstance<OC_RegularQueryContext>(_ctx, getState());
+  enterRule(_localctx, 140, CypherParser::RuleOC_RegularQuery);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    setState(1375);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 171, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1354);
+      oC_SingleQuery();
+      setState(1361);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 168, _ctx);
+      while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+        if (alt == 1) {
+          setState(1356);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(1355);
+            match(CypherParser::SP);
+          }
+          setState(1358);
+          oC_Union(); 
+        }
+        setState(1363);
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 168, _ctx);
+      }
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1368); 
+      _errHandler->sync(this);
+      alt = 1;
+      do {
+        switch (alt) {
+          case 1: {
+                setState(1364);
+                oC_Return();
+                setState(1366);
+                _errHandler->sync(this);
+
+                _la = _input->LA(1);
+                if (_la == CypherParser::SP) {
+                  setState(1365);
+                  match(CypherParser::SP);
+                }
+                break;
+              }
+
+        default:
+          throw NoViableAltException(this);
+        }
+        setState(1370); 
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 170, _ctx);
+      } while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER);
+      setState(1372);
+      oC_SingleQuery();
+       notifyReturnNotAtEnd(_localctx->start); 
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_UnionContext ------------------------------------------------------------------
+
+CypherParser::OC_UnionContext::OC_UnionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_UnionContext::UNION() {
+  return getToken(CypherParser::UNION, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_UnionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_UnionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_UnionContext::ALL() {
+  return getToken(CypherParser::ALL, 0);
+}
+
+CypherParser::OC_SingleQueryContext* CypherParser::OC_UnionContext::oC_SingleQuery() {
+  return getRuleContext<CypherParser::OC_SingleQueryContext>(0);
+}
+
+
+size_t CypherParser::OC_UnionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Union;
+}
+
+
+CypherParser::OC_UnionContext* CypherParser::oC_Union() {
+  OC_UnionContext *_localctx = _tracker.createInstance<OC_UnionContext>(_ctx, getState());
+  enterRule(_localctx, 142, CypherParser::RuleOC_Union);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1389);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 174, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1377);
+      match(CypherParser::UNION);
+      setState(1378);
+      match(CypherParser::SP);
+      setState(1379);
+      match(CypherParser::ALL);
+      setState(1381);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1380);
+        match(CypherParser::SP);
+      }
+      setState(1383);
+      oC_SingleQuery();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1384);
+      match(CypherParser::UNION);
+      setState(1386);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1385);
+        match(CypherParser::SP);
+      }
+      setState(1388);
+      oC_SingleQuery();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_SingleQueryContext ------------------------------------------------------------------
+
+CypherParser::OC_SingleQueryContext::OC_SingleQueryContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SinglePartQueryContext* CypherParser::OC_SingleQueryContext::oC_SinglePartQuery() {
+  return getRuleContext<CypherParser::OC_SinglePartQueryContext>(0);
+}
+
+CypherParser::OC_MultiPartQueryContext* CypherParser::OC_SingleQueryContext::oC_MultiPartQuery() {
+  return getRuleContext<CypherParser::OC_MultiPartQueryContext>(0);
+}
+
+
+size_t CypherParser::OC_SingleQueryContext::getRuleIndex() const {
+  return CypherParser::RuleOC_SingleQuery;
+}
+
+
+CypherParser::OC_SingleQueryContext* CypherParser::oC_SingleQuery() {
+  OC_SingleQueryContext *_localctx = _tracker.createInstance<OC_SingleQueryContext>(_ctx, getState());
+  enterRule(_localctx, 144, CypherParser::RuleOC_SingleQuery);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1393);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 175, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1391);
+      oC_SinglePartQuery();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1392);
+      oC_MultiPartQuery();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_SinglePartQueryContext ------------------------------------------------------------------
+
+CypherParser::OC_SinglePartQueryContext::OC_SinglePartQueryContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_ReturnContext* CypherParser::OC_SinglePartQueryContext::oC_Return() {
+  return getRuleContext<CypherParser::OC_ReturnContext>(0);
+}
+
+std::vector<CypherParser::OC_ReadingClauseContext *> CypherParser::OC_SinglePartQueryContext::oC_ReadingClause() {
+  return getRuleContexts<CypherParser::OC_ReadingClauseContext>();
+}
+
+CypherParser::OC_ReadingClauseContext* CypherParser::OC_SinglePartQueryContext::oC_ReadingClause(size_t i) {
+  return getRuleContext<CypherParser::OC_ReadingClauseContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_SinglePartQueryContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_SinglePartQueryContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<CypherParser::OC_UpdatingClauseContext *> CypherParser::OC_SinglePartQueryContext::oC_UpdatingClause() {
+  return getRuleContexts<CypherParser::OC_UpdatingClauseContext>();
+}
+
+CypherParser::OC_UpdatingClauseContext* CypherParser::OC_SinglePartQueryContext::oC_UpdatingClause(size_t i) {
+  return getRuleContext<CypherParser::OC_UpdatingClauseContext>(i);
+}
+
+
+size_t CypherParser::OC_SinglePartQueryContext::getRuleIndex() const {
+  return CypherParser::RuleOC_SinglePartQuery;
+}
+
+
+CypherParser::OC_SinglePartQueryContext* CypherParser::oC_SinglePartQuery() {
+  OC_SinglePartQueryContext *_localctx = _tracker.createInstance<OC_SinglePartQueryContext>(_ctx, getState());
+  enterRule(_localctx, 146, CypherParser::RuleOC_SinglePartQuery);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    setState(1430);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 184, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1401);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+      while (_la == CypherParser::CALL || ((((_la - 103) & ~ 0x3fULL) == 0) &&
+        ((1ULL << (_la - 103)) & 2199023288329) != 0)) {
+        setState(1395);
+        oC_ReadingClause();
+        setState(1397);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1396);
+          match(CypherParser::SP);
+        }
+        setState(1403);
+        _errHandler->sync(this);
+        _la = _input->LA(1);
+      }
+      setState(1404);
+      oC_Return();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1411);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+      while (_la == CypherParser::CALL || ((((_la - 103) & ~ 0x3fULL) == 0) &&
+        ((1ULL << (_la - 103)) & 2199023288329) != 0)) {
+        setState(1405);
+        oC_ReadingClause();
+        setState(1407);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1406);
+          match(CypherParser::SP);
+        }
+        setState(1413);
+        _errHandler->sync(this);
+        _la = _input->LA(1);
+      }
+      setState(1414);
+      oC_UpdatingClause();
+      setState(1421);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 181, _ctx);
+      while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+        if (alt == 1) {
+          setState(1416);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(1415);
+            match(CypherParser::SP);
+          }
+          setState(1418);
+          oC_UpdatingClause(); 
+        }
+        setState(1423);
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 181, _ctx);
+      }
+      setState(1428);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 183, _ctx)) {
+      case 1: {
+        setState(1425);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1424);
+          match(CypherParser::SP);
+        }
+        setState(1427);
+        oC_Return();
+        break;
+      }
+
+      default:
+        break;
+      }
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_MultiPartQueryContext ------------------------------------------------------------------
+
+CypherParser::OC_MultiPartQueryContext::OC_MultiPartQueryContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SinglePartQueryContext* CypherParser::OC_MultiPartQueryContext::oC_SinglePartQuery() {
+  return getRuleContext<CypherParser::OC_SinglePartQueryContext>(0);
+}
+
+std::vector<CypherParser::KU_QueryPartContext *> CypherParser::OC_MultiPartQueryContext::kU_QueryPart() {
+  return getRuleContexts<CypherParser::KU_QueryPartContext>();
+}
+
+CypherParser::KU_QueryPartContext* CypherParser::OC_MultiPartQueryContext::kU_QueryPart(size_t i) {
+  return getRuleContext<CypherParser::KU_QueryPartContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_MultiPartQueryContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_MultiPartQueryContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_MultiPartQueryContext::getRuleIndex() const {
+  return CypherParser::RuleOC_MultiPartQuery;
+}
+
+
+CypherParser::OC_MultiPartQueryContext* CypherParser::oC_MultiPartQuery() {
+  OC_MultiPartQueryContext *_localctx = _tracker.createInstance<OC_MultiPartQueryContext>(_ctx, getState());
+  enterRule(_localctx, 148, CypherParser::RuleOC_MultiPartQuery);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1436); 
+    _errHandler->sync(this);
+    alt = 1;
+    do {
+      switch (alt) {
+        case 1: {
+              setState(1432);
+              kU_QueryPart();
+              setState(1434);
+              _errHandler->sync(this);
+
+              _la = _input->LA(1);
+              if (_la == CypherParser::SP) {
+                setState(1433);
+                match(CypherParser::SP);
+              }
+              break;
+            }
+
+      default:
+        throw NoViableAltException(this);
+      }
+      setState(1438); 
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 186, _ctx);
+    } while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER);
+    setState(1440);
+    oC_SinglePartQuery();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_QueryPartContext ------------------------------------------------------------------
+
+CypherParser::KU_QueryPartContext::KU_QueryPartContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_WithContext* CypherParser::KU_QueryPartContext::oC_With() {
+  return getRuleContext<CypherParser::OC_WithContext>(0);
+}
+
+std::vector<CypherParser::OC_ReadingClauseContext *> CypherParser::KU_QueryPartContext::oC_ReadingClause() {
+  return getRuleContexts<CypherParser::OC_ReadingClauseContext>();
+}
+
+CypherParser::OC_ReadingClauseContext* CypherParser::KU_QueryPartContext::oC_ReadingClause(size_t i) {
+  return getRuleContext<CypherParser::OC_ReadingClauseContext>(i);
+}
+
+std::vector<CypherParser::OC_UpdatingClauseContext *> CypherParser::KU_QueryPartContext::oC_UpdatingClause() {
+  return getRuleContexts<CypherParser::OC_UpdatingClauseContext>();
+}
+
+CypherParser::OC_UpdatingClauseContext* CypherParser::KU_QueryPartContext::oC_UpdatingClause(size_t i) {
+  return getRuleContext<CypherParser::OC_UpdatingClauseContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_QueryPartContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_QueryPartContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_QueryPartContext::getRuleIndex() const {
+  return CypherParser::RuleKU_QueryPart;
+}
+
+
+CypherParser::KU_QueryPartContext* CypherParser::kU_QueryPart() {
+  KU_QueryPartContext *_localctx = _tracker.createInstance<KU_QueryPartContext>(_ctx, getState());
+  enterRule(_localctx, 150, CypherParser::RuleKU_QueryPart);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1448);
+    _errHandler->sync(this);
+    _la = _input->LA(1);
+    while (_la == CypherParser::CALL || ((((_la - 103) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 103)) & 2199023288329) != 0)) {
+      setState(1442);
+      oC_ReadingClause();
+      setState(1444);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1443);
+        match(CypherParser::SP);
+      }
+      setState(1450);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+    }
+    setState(1457);
+    _errHandler->sync(this);
+    _la = _input->LA(1);
+    while (((((_la - 68) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 68)) & -9223370937343147743) != 0)) {
+      setState(1451);
+      oC_UpdatingClause();
+      setState(1453);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1452);
+        match(CypherParser::SP);
+      }
+      setState(1459);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+    }
+    setState(1460);
+    oC_With();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_UpdatingClauseContext ------------------------------------------------------------------
+
+CypherParser::OC_UpdatingClauseContext::OC_UpdatingClauseContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_CreateContext* CypherParser::OC_UpdatingClauseContext::oC_Create() {
+  return getRuleContext<CypherParser::OC_CreateContext>(0);
+}
+
+CypherParser::OC_MergeContext* CypherParser::OC_UpdatingClauseContext::oC_Merge() {
+  return getRuleContext<CypherParser::OC_MergeContext>(0);
+}
+
+CypherParser::OC_SetContext* CypherParser::OC_UpdatingClauseContext::oC_Set() {
+  return getRuleContext<CypherParser::OC_SetContext>(0);
+}
+
+CypherParser::OC_DeleteContext* CypherParser::OC_UpdatingClauseContext::oC_Delete() {
+  return getRuleContext<CypherParser::OC_DeleteContext>(0);
+}
+
+
+size_t CypherParser::OC_UpdatingClauseContext::getRuleIndex() const {
+  return CypherParser::RuleOC_UpdatingClause;
+}
+
+
+CypherParser::OC_UpdatingClauseContext* CypherParser::oC_UpdatingClause() {
+  OC_UpdatingClauseContext *_localctx = _tracker.createInstance<OC_UpdatingClauseContext>(_ctx, getState());
+  enterRule(_localctx, 152, CypherParser::RuleOC_UpdatingClause);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1466);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::CREATE: {
+        enterOuterAlt(_localctx, 1);
+        setState(1462);
+        oC_Create();
+        break;
+      }
+
+      case CypherParser::MERGE: {
+        enterOuterAlt(_localctx, 2);
+        setState(1463);
+        oC_Merge();
+        break;
+      }
+
+      case CypherParser::SET: {
+        enterOuterAlt(_localctx, 3);
+        setState(1464);
+        oC_Set();
+        break;
+      }
+
+      case CypherParser::DELETE:
+      case CypherParser::DETACH: {
+        enterOuterAlt(_localctx, 4);
+        setState(1465);
+        oC_Delete();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ReadingClauseContext ------------------------------------------------------------------
+
+CypherParser::OC_ReadingClauseContext::OC_ReadingClauseContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_MatchContext* CypherParser::OC_ReadingClauseContext::oC_Match() {
+  return getRuleContext<CypherParser::OC_MatchContext>(0);
+}
+
+CypherParser::OC_UnwindContext* CypherParser::OC_ReadingClauseContext::oC_Unwind() {
+  return getRuleContext<CypherParser::OC_UnwindContext>(0);
+}
+
+CypherParser::KU_InQueryCallContext* CypherParser::OC_ReadingClauseContext::kU_InQueryCall() {
+  return getRuleContext<CypherParser::KU_InQueryCallContext>(0);
+}
+
+CypherParser::KU_LoadFromContext* CypherParser::OC_ReadingClauseContext::kU_LoadFrom() {
+  return getRuleContext<CypherParser::KU_LoadFromContext>(0);
+}
+
+
+size_t CypherParser::OC_ReadingClauseContext::getRuleIndex() const {
+  return CypherParser::RuleOC_ReadingClause;
+}
+
+
+CypherParser::OC_ReadingClauseContext* CypherParser::oC_ReadingClause() {
+  OC_ReadingClauseContext *_localctx = _tracker.createInstance<OC_ReadingClauseContext>(_ctx, getState());
+  enterRule(_localctx, 154, CypherParser::RuleOC_ReadingClause);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1472);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::MATCH:
+      case CypherParser::OPTIONAL: {
+        enterOuterAlt(_localctx, 1);
+        setState(1468);
+        oC_Match();
+        break;
+      }
+
+      case CypherParser::UNWIND: {
+        enterOuterAlt(_localctx, 2);
+        setState(1469);
+        oC_Unwind();
+        break;
+      }
+
+      case CypherParser::CALL: {
+        enterOuterAlt(_localctx, 3);
+        setState(1470);
+        kU_InQueryCall();
+        break;
+      }
+
+      case CypherParser::LOAD: {
+        enterOuterAlt(_localctx, 4);
+        setState(1471);
+        kU_LoadFrom();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_LoadFromContext ------------------------------------------------------------------
+
+CypherParser::KU_LoadFromContext::KU_LoadFromContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_LoadFromContext::LOAD() {
+  return getToken(CypherParser::LOAD, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_LoadFromContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_LoadFromContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_LoadFromContext::FROM() {
+  return getToken(CypherParser::FROM, 0);
+}
+
+CypherParser::KU_ScanSourceContext* CypherParser::KU_LoadFromContext::kU_ScanSource() {
+  return getRuleContext<CypherParser::KU_ScanSourceContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_LoadFromContext::WITH() {
+  return getToken(CypherParser::WITH, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_LoadFromContext::HEADERS() {
+  return getToken(CypherParser::HEADERS, 0);
+}
+
+CypherParser::KU_ColumnDefinitionsContext* CypherParser::KU_LoadFromContext::kU_ColumnDefinitions() {
+  return getRuleContext<CypherParser::KU_ColumnDefinitionsContext>(0);
+}
+
+CypherParser::KU_OptionsContext* CypherParser::KU_LoadFromContext::kU_Options() {
+  return getRuleContext<CypherParser::KU_OptionsContext>(0);
+}
+
+CypherParser::OC_WhereContext* CypherParser::KU_LoadFromContext::oC_Where() {
+  return getRuleContext<CypherParser::OC_WhereContext>(0);
+}
+
+
+size_t CypherParser::KU_LoadFromContext::getRuleIndex() const {
+  return CypherParser::RuleKU_LoadFrom;
+}
+
+
+CypherParser::KU_LoadFromContext* CypherParser::kU_LoadFrom() {
+  KU_LoadFromContext *_localctx = _tracker.createInstance<KU_LoadFromContext>(_ctx, getState());
+  enterRule(_localctx, 156, CypherParser::RuleKU_LoadFrom);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1474);
+    match(CypherParser::LOAD);
+    setState(1492);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 196, _ctx)) {
+    case 1: {
+      setState(1475);
+      match(CypherParser::SP);
+      setState(1476);
+      match(CypherParser::WITH);
+      setState(1477);
+      match(CypherParser::SP);
+      setState(1478);
+      match(CypherParser::HEADERS);
+      setState(1480);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1479);
+        match(CypherParser::SP);
+      }
+      setState(1482);
+      match(CypherParser::T__1);
+      setState(1484);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1483);
+        match(CypherParser::SP);
+      }
+      setState(1486);
+      kU_ColumnDefinitions();
+      setState(1488);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1487);
+        match(CypherParser::SP);
+      }
+      setState(1490);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1494);
+    match(CypherParser::SP);
+    setState(1495);
+    match(CypherParser::FROM);
+    setState(1496);
+    match(CypherParser::SP);
+    setState(1497);
+    kU_ScanSource();
+    setState(1511);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 200, _ctx)) {
+    case 1: {
+      setState(1499);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1498);
+        match(CypherParser::SP);
+      }
+      setState(1501);
+      match(CypherParser::T__1);
+      setState(1503);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1502);
+        match(CypherParser::SP);
+      }
+      setState(1505);
+      kU_Options();
+      setState(1507);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1506);
+        match(CypherParser::SP);
+      }
+      setState(1509);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1517);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 202, _ctx)) {
+    case 1: {
+      setState(1514);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1513);
+        match(CypherParser::SP);
+      }
+      setState(1516);
+      oC_Where();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_YieldItemContext ------------------------------------------------------------------
+
+CypherParser::OC_YieldItemContext::OC_YieldItemContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_VariableContext *> CypherParser::OC_YieldItemContext::oC_Variable() {
+  return getRuleContexts<CypherParser::OC_VariableContext>();
+}
+
+CypherParser::OC_VariableContext* CypherParser::OC_YieldItemContext::oC_Variable(size_t i) {
+  return getRuleContext<CypherParser::OC_VariableContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_YieldItemContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_YieldItemContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_YieldItemContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+
+size_t CypherParser::OC_YieldItemContext::getRuleIndex() const {
+  return CypherParser::RuleOC_YieldItem;
+}
+
+
+CypherParser::OC_YieldItemContext* CypherParser::oC_YieldItem() {
+  OC_YieldItemContext *_localctx = _tracker.createInstance<OC_YieldItemContext>(_ctx, getState());
+  enterRule(_localctx, 158, CypherParser::RuleOC_YieldItem);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1524);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 203, _ctx)) {
+    case 1: {
+      setState(1519);
+      oC_Variable();
+      setState(1520);
+      match(CypherParser::SP);
+      setState(1521);
+      match(CypherParser::AS);
+      setState(1522);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1526);
+    oC_Variable();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_YieldItemsContext ------------------------------------------------------------------
+
+CypherParser::OC_YieldItemsContext::OC_YieldItemsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_YieldItemContext *> CypherParser::OC_YieldItemsContext::oC_YieldItem() {
+  return getRuleContexts<CypherParser::OC_YieldItemContext>();
+}
+
+CypherParser::OC_YieldItemContext* CypherParser::OC_YieldItemsContext::oC_YieldItem(size_t i) {
+  return getRuleContext<CypherParser::OC_YieldItemContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_YieldItemsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_YieldItemsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_YieldItemsContext::getRuleIndex() const {
+  return CypherParser::RuleOC_YieldItems;
+}
+
+
+CypherParser::OC_YieldItemsContext* CypherParser::oC_YieldItems() {
+  OC_YieldItemsContext *_localctx = _tracker.createInstance<OC_YieldItemsContext>(_ctx, getState());
+  enterRule(_localctx, 160, CypherParser::RuleOC_YieldItems);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1528);
+    oC_YieldItem();
+    setState(1539);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 206, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(1530);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1529);
+          match(CypherParser::SP);
+        }
+        setState(1532);
+        match(CypherParser::T__3);
+        setState(1534);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1533);
+          match(CypherParser::SP);
+        }
+        setState(1536);
+        oC_YieldItem(); 
+      }
+      setState(1541);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 206, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_InQueryCallContext ------------------------------------------------------------------
+
+CypherParser::KU_InQueryCallContext::KU_InQueryCallContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_InQueryCallContext::CALL() {
+  return getToken(CypherParser::CALL, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_InQueryCallContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_InQueryCallContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_FunctionInvocationContext* CypherParser::KU_InQueryCallContext::oC_FunctionInvocation() {
+  return getRuleContext<CypherParser::OC_FunctionInvocationContext>(0);
+}
+
+CypherParser::OC_WhereContext* CypherParser::KU_InQueryCallContext::oC_Where() {
+  return getRuleContext<CypherParser::OC_WhereContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_InQueryCallContext::YIELD() {
+  return getToken(CypherParser::YIELD, 0);
+}
+
+CypherParser::OC_YieldItemsContext* CypherParser::KU_InQueryCallContext::oC_YieldItems() {
+  return getRuleContext<CypherParser::OC_YieldItemsContext>(0);
+}
+
+
+size_t CypherParser::KU_InQueryCallContext::getRuleIndex() const {
+  return CypherParser::RuleKU_InQueryCall;
+}
+
+
+CypherParser::KU_InQueryCallContext* CypherParser::kU_InQueryCall() {
+  KU_InQueryCallContext *_localctx = _tracker.createInstance<KU_InQueryCallContext>(_ctx, getState());
+  enterRule(_localctx, 162, CypherParser::RuleKU_InQueryCall);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1542);
+    match(CypherParser::CALL);
+    setState(1543);
+    match(CypherParser::SP);
+    setState(1544);
+    oC_FunctionInvocation();
+    setState(1549);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 208, _ctx)) {
+    case 1: {
+      setState(1546);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1545);
+        match(CypherParser::SP);
+      }
+      setState(1548);
+      oC_Where();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1557);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 210, _ctx)) {
+    case 1: {
+      setState(1552);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1551);
+        match(CypherParser::SP);
+      }
+      setState(1554);
+      match(CypherParser::YIELD);
+      setState(1555);
+      match(CypherParser::SP);
+      setState(1556);
+      oC_YieldItems();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_MatchContext ------------------------------------------------------------------
+
+CypherParser::OC_MatchContext::OC_MatchContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_MatchContext::MATCH() {
+  return getToken(CypherParser::MATCH, 0);
+}
+
+CypherParser::OC_PatternContext* CypherParser::OC_MatchContext::oC_Pattern() {
+  return getRuleContext<CypherParser::OC_PatternContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_MatchContext::OPTIONAL() {
+  return getToken(CypherParser::OPTIONAL, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_MatchContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_MatchContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_WhereContext* CypherParser::OC_MatchContext::oC_Where() {
+  return getRuleContext<CypherParser::OC_WhereContext>(0);
+}
+
+CypherParser::KU_HintContext* CypherParser::OC_MatchContext::kU_Hint() {
+  return getRuleContext<CypherParser::KU_HintContext>(0);
+}
+
+
+size_t CypherParser::OC_MatchContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Match;
+}
+
+
+CypherParser::OC_MatchContext* CypherParser::oC_Match() {
+  OC_MatchContext *_localctx = _tracker.createInstance<OC_MatchContext>(_ctx, getState());
+  enterRule(_localctx, 164, CypherParser::RuleOC_Match);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1561);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::OPTIONAL) {
+      setState(1559);
+      match(CypherParser::OPTIONAL);
+      setState(1560);
+      match(CypherParser::SP);
+    }
+    setState(1563);
+    match(CypherParser::MATCH);
+    setState(1565);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1564);
+      match(CypherParser::SP);
+    }
+    setState(1567);
+    oC_Pattern();
+    setState(1570);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 213, _ctx)) {
+    case 1: {
+      setState(1568);
+      match(CypherParser::SP);
+      setState(1569);
+      oC_Where();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1574);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 214, _ctx)) {
+    case 1: {
+      setState(1572);
+      match(CypherParser::SP);
+      setState(1573);
+      kU_Hint();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_HintContext ------------------------------------------------------------------
+
+CypherParser::KU_HintContext::KU_HintContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_HintContext::HINT() {
+  return getToken(CypherParser::HINT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_HintContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::KU_JoinNodeContext* CypherParser::KU_HintContext::kU_JoinNode() {
+  return getRuleContext<CypherParser::KU_JoinNodeContext>(0);
+}
+
+
+size_t CypherParser::KU_HintContext::getRuleIndex() const {
+  return CypherParser::RuleKU_Hint;
+}
+
+
+CypherParser::KU_HintContext* CypherParser::kU_Hint() {
+  KU_HintContext *_localctx = _tracker.createInstance<KU_HintContext>(_ctx, getState());
+  enterRule(_localctx, 166, CypherParser::RuleKU_Hint);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1576);
+    match(CypherParser::HINT);
+    setState(1577);
+    match(CypherParser::SP);
+    setState(1578);
+    kU_JoinNode(0);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_JoinNodeContext ------------------------------------------------------------------
+
+CypherParser::KU_JoinNodeContext::KU_JoinNodeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_JoinNodeContext *> CypherParser::KU_JoinNodeContext::kU_JoinNode() {
+  return getRuleContexts<CypherParser::KU_JoinNodeContext>();
+}
+
+CypherParser::KU_JoinNodeContext* CypherParser::KU_JoinNodeContext::kU_JoinNode(size_t i) {
+  return getRuleContext<CypherParser::KU_JoinNodeContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_JoinNodeContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_JoinNodeContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<CypherParser::OC_SchemaNameContext *> CypherParser::KU_JoinNodeContext::oC_SchemaName() {
+  return getRuleContexts<CypherParser::OC_SchemaNameContext>();
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::KU_JoinNodeContext::oC_SchemaName(size_t i) {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(i);
+}
+
+tree::TerminalNode* CypherParser::KU_JoinNodeContext::JOIN() {
+  return getToken(CypherParser::JOIN, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_JoinNodeContext::MULTI_JOIN() {
+  return getTokens(CypherParser::MULTI_JOIN);
+}
+
+tree::TerminalNode* CypherParser::KU_JoinNodeContext::MULTI_JOIN(size_t i) {
+  return getToken(CypherParser::MULTI_JOIN, i);
+}
+
+
+size_t CypherParser::KU_JoinNodeContext::getRuleIndex() const {
+  return CypherParser::RuleKU_JoinNode;
+}
+
+
+
+CypherParser::KU_JoinNodeContext* CypherParser::kU_JoinNode() {
+   return kU_JoinNode(0);
+}
+
+CypherParser::KU_JoinNodeContext* CypherParser::kU_JoinNode(int precedence) {
+  ParserRuleContext *parentContext = _ctx;
+  size_t parentState = getState();
+  CypherParser::KU_JoinNodeContext *_localctx = _tracker.createInstance<KU_JoinNodeContext>(_ctx, parentState);
+  CypherParser::KU_JoinNodeContext *previousContext = _localctx;
+  (void)previousContext; // Silence compiler, in case the context is not used by generated code.
+  size_t startState = 168;
+  enterRecursionRule(_localctx, 168, CypherParser::RuleKU_JoinNode, precedence);
+
+    size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    unrollRecursionContexts(parentContext);
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1592);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::T__1: {
+        setState(1581);
+        match(CypherParser::T__1);
+        setState(1583);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1582);
+          match(CypherParser::SP);
+        }
+        setState(1585);
+        kU_JoinNode(0);
+        setState(1587);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1586);
+          match(CypherParser::SP);
+        }
+        setState(1589);
+        match(CypherParser::T__2);
+        break;
+      }
+
+      case CypherParser::ADD:
+      case CypherParser::ALTER:
+      case CypherParser::AS:
+      case CypherParser::ATTACH:
+      case CypherParser::BEGIN:
+      case CypherParser::BY:
+      case CypherParser::CALL:
+      case CypherParser::CHECKPOINT:
+      case CypherParser::COMMENT:
+      case CypherParser::COMMIT:
+      case CypherParser::CONTAINS:
+      case CypherParser::COPY:
+      case CypherParser::COUNT:
+      case CypherParser::CYCLE:
+      case CypherParser::DATABASE:
+      case CypherParser::DELETE:
+      case CypherParser::DETACH:
+      case CypherParser::DROP:
+      case CypherParser::EXPLAIN:
+      case CypherParser::EXPORT:
+      case CypherParser::EXTENSION:
+      case CypherParser::FROM:
+      case CypherParser::FORCE:
+      case CypherParser::GRAPH:
+      case CypherParser::IMPORT:
+      case CypherParser::IF:
+      case CypherParser::INCREMENT:
+      case CypherParser::IS:
+      case CypherParser::KEY:
+      case CypherParser::LIMIT:
+      case CypherParser::LOAD:
+      case CypherParser::LOGICAL:
+      case CypherParser::MATCH:
+      case CypherParser::MAXVALUE:
+      case CypherParser::MERGE:
+      case CypherParser::MINVALUE:
+      case CypherParser::NO:
+      case CypherParser::NODE:
+      case CypherParser::PROJECT:
+      case CypherParser::READ:
+      case CypherParser::REL:
+      case CypherParser::RENAME:
+      case CypherParser::RETURN:
+      case CypherParser::ROLLBACK:
+      case CypherParser::SEQUENCE:
+      case CypherParser::SET:
+      case CypherParser::START:
+      case CypherParser::STRUCT:
+      case CypherParser::TO:
+      case CypherParser::TRANSACTION:
+      case CypherParser::TYPE:
+      case CypherParser::UNINSTALL:
+      case CypherParser::UPDATE:
+      case CypherParser::USE:
+      case CypherParser::WRITE:
+      case CypherParser::YIELD:
+      case CypherParser::USER:
+      case CypherParser::PASSWORD:
+      case CypherParser::ROLE:
+      case CypherParser::MAP:
+      case CypherParser::DECIMAL:
+      case CypherParser::L_SKIP:
+      case CypherParser::HexLetter:
+      case CypherParser::UnescapedSymbolicName:
+      case CypherParser::EscapedSymbolicName: {
+        setState(1591);
+        oC_SchemaName();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+    _ctx->stop = _input->LT(-1);
+    setState(1610);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 220, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        if (!_parseListeners.empty())
+          triggerExitRuleEvent();
+        previousContext = _localctx;
+        setState(1608);
+        _errHandler->sync(this);
+        switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 219, _ctx)) {
+        case 1: {
+          _localctx = _tracker.createInstance<KU_JoinNodeContext>(parentContext, parentState);
+          pushNewRecursionContext(_localctx, startState, RuleKU_JoinNode);
+          setState(1594);
+
+          if (!(precpred(_ctx, 4))) throw FailedPredicateException(this, "precpred(_ctx, 4)");
+          setState(1595);
+          match(CypherParser::SP);
+          setState(1596);
+          match(CypherParser::JOIN);
+          setState(1597);
+          match(CypherParser::SP);
+          setState(1598);
+          kU_JoinNode(5);
+          break;
+        }
+
+        case 2: {
+          _localctx = _tracker.createInstance<KU_JoinNodeContext>(parentContext, parentState);
+          pushNewRecursionContext(_localctx, startState, RuleKU_JoinNode);
+          setState(1599);
+
+          if (!(precpred(_ctx, 3))) throw FailedPredicateException(this, "precpred(_ctx, 3)");
+          setState(1604); 
+          _errHandler->sync(this);
+          alt = 1;
+          do {
+            switch (alt) {
+              case 1: {
+                    setState(1600);
+                    match(CypherParser::SP);
+                    setState(1601);
+                    match(CypherParser::MULTI_JOIN);
+                    setState(1602);
+                    match(CypherParser::SP);
+                    setState(1603);
+                    oC_SchemaName();
+                    break;
+                  }
+
+            default:
+              throw NoViableAltException(this);
+            }
+            setState(1606); 
+            _errHandler->sync(this);
+            alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 218, _ctx);
+          } while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER);
+          break;
+        }
+
+        default:
+          break;
+        } 
+      }
+      setState(1612);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 220, _ctx);
+    }
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+  return _localctx;
+}
+
+//----------------- OC_UnwindContext ------------------------------------------------------------------
+
+CypherParser::OC_UnwindContext::OC_UnwindContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_UnwindContext::UNWIND() {
+  return getToken(CypherParser::UNWIND, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_UnwindContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_UnwindContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_UnwindContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_UnwindContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+CypherParser::OC_VariableContext* CypherParser::OC_UnwindContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+
+size_t CypherParser::OC_UnwindContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Unwind;
+}
+
+
+CypherParser::OC_UnwindContext* CypherParser::oC_Unwind() {
+  OC_UnwindContext *_localctx = _tracker.createInstance<OC_UnwindContext>(_ctx, getState());
+  enterRule(_localctx, 170, CypherParser::RuleOC_Unwind);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1613);
+    match(CypherParser::UNWIND);
+    setState(1615);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1614);
+      match(CypherParser::SP);
+    }
+    setState(1617);
+    oC_Expression();
+    setState(1618);
+    match(CypherParser::SP);
+    setState(1619);
+    match(CypherParser::AS);
+    setState(1620);
+    match(CypherParser::SP);
+    setState(1621);
+    oC_Variable();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_CreateContext ------------------------------------------------------------------
+
+CypherParser::OC_CreateContext::OC_CreateContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_CreateContext::CREATE() {
+  return getToken(CypherParser::CREATE, 0);
+}
+
+CypherParser::OC_PatternContext* CypherParser::OC_CreateContext::oC_Pattern() {
+  return getRuleContext<CypherParser::OC_PatternContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_CreateContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+
+size_t CypherParser::OC_CreateContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Create;
+}
+
+
+CypherParser::OC_CreateContext* CypherParser::oC_Create() {
+  OC_CreateContext *_localctx = _tracker.createInstance<OC_CreateContext>(_ctx, getState());
+  enterRule(_localctx, 172, CypherParser::RuleOC_Create);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1623);
+    match(CypherParser::CREATE);
+    setState(1625);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1624);
+      match(CypherParser::SP);
+    }
+    setState(1627);
+    oC_Pattern();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_MergeContext ------------------------------------------------------------------
+
+CypherParser::OC_MergeContext::OC_MergeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_MergeContext::MERGE() {
+  return getToken(CypherParser::MERGE, 0);
+}
+
+CypherParser::OC_PatternContext* CypherParser::OC_MergeContext::oC_Pattern() {
+  return getRuleContext<CypherParser::OC_PatternContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_MergeContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_MergeContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<CypherParser::OC_MergeActionContext *> CypherParser::OC_MergeContext::oC_MergeAction() {
+  return getRuleContexts<CypherParser::OC_MergeActionContext>();
+}
+
+CypherParser::OC_MergeActionContext* CypherParser::OC_MergeContext::oC_MergeAction(size_t i) {
+  return getRuleContext<CypherParser::OC_MergeActionContext>(i);
+}
+
+
+size_t CypherParser::OC_MergeContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Merge;
+}
+
+
+CypherParser::OC_MergeContext* CypherParser::oC_Merge() {
+  OC_MergeContext *_localctx = _tracker.createInstance<OC_MergeContext>(_ctx, getState());
+  enterRule(_localctx, 174, CypherParser::RuleOC_Merge);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1629);
+    match(CypherParser::MERGE);
+    setState(1631);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1630);
+      match(CypherParser::SP);
+    }
+    setState(1633);
+    oC_Pattern();
+    setState(1638);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 224, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(1634);
+        match(CypherParser::SP);
+        setState(1635);
+        oC_MergeAction(); 
+      }
+      setState(1640);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 224, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_MergeActionContext ------------------------------------------------------------------
+
+CypherParser::OC_MergeActionContext::OC_MergeActionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_MergeActionContext::ON() {
+  return getToken(CypherParser::ON, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_MergeActionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_MergeActionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_MergeActionContext::MATCH() {
+  return getToken(CypherParser::MATCH, 0);
+}
+
+CypherParser::OC_SetContext* CypherParser::OC_MergeActionContext::oC_Set() {
+  return getRuleContext<CypherParser::OC_SetContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_MergeActionContext::CREATE() {
+  return getToken(CypherParser::CREATE, 0);
+}
+
+
+size_t CypherParser::OC_MergeActionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_MergeAction;
+}
+
+
+CypherParser::OC_MergeActionContext* CypherParser::oC_MergeAction() {
+  OC_MergeActionContext *_localctx = _tracker.createInstance<OC_MergeActionContext>(_ctx, getState());
+  enterRule(_localctx, 176, CypherParser::RuleOC_MergeAction);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1651);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 225, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1641);
+      match(CypherParser::ON);
+      setState(1642);
+      match(CypherParser::SP);
+      setState(1643);
+      match(CypherParser::MATCH);
+      setState(1644);
+      match(CypherParser::SP);
+      setState(1645);
+      oC_Set();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1646);
+      match(CypherParser::ON);
+      setState(1647);
+      match(CypherParser::SP);
+      setState(1648);
+      match(CypherParser::CREATE);
+      setState(1649);
+      match(CypherParser::SP);
+      setState(1650);
+      oC_Set();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_SetContext ------------------------------------------------------------------
+
+CypherParser::OC_SetContext::OC_SetContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_SetContext::SET() {
+  return getToken(CypherParser::SET, 0);
+}
+
+std::vector<CypherParser::OC_SetItemContext *> CypherParser::OC_SetContext::oC_SetItem() {
+  return getRuleContexts<CypherParser::OC_SetItemContext>();
+}
+
+CypherParser::OC_SetItemContext* CypherParser::OC_SetContext::oC_SetItem(size_t i) {
+  return getRuleContext<CypherParser::OC_SetItemContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_SetContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_SetContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_AtomContext* CypherParser::OC_SetContext::oC_Atom() {
+  return getRuleContext<CypherParser::OC_AtomContext>(0);
+}
+
+CypherParser::KU_PropertiesContext* CypherParser::OC_SetContext::kU_Properties() {
+  return getRuleContext<CypherParser::KU_PropertiesContext>(0);
+}
+
+
+size_t CypherParser::OC_SetContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Set;
+}
+
+
+CypherParser::OC_SetContext* CypherParser::oC_Set() {
+  OC_SetContext *_localctx = _tracker.createInstance<OC_SetContext>(_ctx, getState());
+  enterRule(_localctx, 178, CypherParser::RuleOC_Set);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    setState(1685);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 233, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1653);
+      match(CypherParser::SET);
+      setState(1655);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1654);
+        match(CypherParser::SP);
+      }
+      setState(1657);
+      oC_SetItem();
+      setState(1668);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 229, _ctx);
+      while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+        if (alt == 1) {
+          setState(1659);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(1658);
+            match(CypherParser::SP);
+          }
+          setState(1661);
+          match(CypherParser::T__3);
+          setState(1663);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(1662);
+            match(CypherParser::SP);
+          }
+          setState(1665);
+          oC_SetItem(); 
+        }
+        setState(1670);
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 229, _ctx);
+      }
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1671);
+      match(CypherParser::SET);
+      setState(1673);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1672);
+        match(CypherParser::SP);
+      }
+      setState(1675);
+      oC_Atom();
+      setState(1677);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1676);
+        match(CypherParser::SP);
+      }
+      setState(1679);
+      match(CypherParser::T__5);
+      setState(1681);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1680);
+        match(CypherParser::SP);
+      }
+      setState(1683);
+      kU_Properties();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_SetItemContext ------------------------------------------------------------------
+
+CypherParser::OC_SetItemContext::OC_SetItemContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_PropertyExpressionContext* CypherParser::OC_SetItemContext::oC_PropertyExpression() {
+  return getRuleContext<CypherParser::OC_PropertyExpressionContext>(0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_SetItemContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_SetItemContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_SetItemContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_SetItemContext::getRuleIndex() const {
+  return CypherParser::RuleOC_SetItem;
+}
+
+
+CypherParser::OC_SetItemContext* CypherParser::oC_SetItem() {
+  OC_SetItemContext *_localctx = _tracker.createInstance<OC_SetItemContext>(_ctx, getState());
+  enterRule(_localctx, 180, CypherParser::RuleOC_SetItem);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1687);
+    oC_PropertyExpression();
+    setState(1689);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1688);
+      match(CypherParser::SP);
+    }
+    setState(1691);
+    match(CypherParser::T__5);
+    setState(1693);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1692);
+      match(CypherParser::SP);
+    }
+    setState(1695);
+    oC_Expression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_DeleteContext ------------------------------------------------------------------
+
+CypherParser::OC_DeleteContext::OC_DeleteContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_DeleteContext::DELETE() {
+  return getToken(CypherParser::DELETE, 0);
+}
+
+std::vector<CypherParser::OC_ExpressionContext *> CypherParser::OC_DeleteContext::oC_Expression() {
+  return getRuleContexts<CypherParser::OC_ExpressionContext>();
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_DeleteContext::oC_Expression(size_t i) {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(i);
+}
+
+tree::TerminalNode* CypherParser::OC_DeleteContext::DETACH() {
+  return getToken(CypherParser::DETACH, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_DeleteContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_DeleteContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_DeleteContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Delete;
+}
+
+
+CypherParser::OC_DeleteContext* CypherParser::oC_Delete() {
+  OC_DeleteContext *_localctx = _tracker.createInstance<OC_DeleteContext>(_ctx, getState());
+  enterRule(_localctx, 182, CypherParser::RuleOC_Delete);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1699);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::DETACH) {
+      setState(1697);
+      match(CypherParser::DETACH);
+      setState(1698);
+      match(CypherParser::SP);
+    }
+    setState(1701);
+    match(CypherParser::DELETE);
+    setState(1703);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1702);
+      match(CypherParser::SP);
+    }
+    setState(1705);
+    oC_Expression();
+    setState(1716);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 240, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(1707);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1706);
+          match(CypherParser::SP);
+        }
+        setState(1709);
+        match(CypherParser::T__3);
+        setState(1711);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1710);
+          match(CypherParser::SP);
+        }
+        setState(1713);
+        oC_Expression(); 
+      }
+      setState(1718);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 240, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_WithContext ------------------------------------------------------------------
+
+CypherParser::OC_WithContext::OC_WithContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_WithContext::WITH() {
+  return getToken(CypherParser::WITH, 0);
+}
+
+CypherParser::OC_ProjectionBodyContext* CypherParser::OC_WithContext::oC_ProjectionBody() {
+  return getRuleContext<CypherParser::OC_ProjectionBodyContext>(0);
+}
+
+CypherParser::OC_WhereContext* CypherParser::OC_WithContext::oC_Where() {
+  return getRuleContext<CypherParser::OC_WhereContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_WithContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+
+size_t CypherParser::OC_WithContext::getRuleIndex() const {
+  return CypherParser::RuleOC_With;
+}
+
+
+CypherParser::OC_WithContext* CypherParser::oC_With() {
+  OC_WithContext *_localctx = _tracker.createInstance<OC_WithContext>(_ctx, getState());
+  enterRule(_localctx, 184, CypherParser::RuleOC_With);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1719);
+    match(CypherParser::WITH);
+    setState(1720);
+    oC_ProjectionBody();
+    setState(1725);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 242, _ctx)) {
+    case 1: {
+      setState(1722);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1721);
+        match(CypherParser::SP);
+      }
+      setState(1724);
+      oC_Where();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ReturnContext ------------------------------------------------------------------
+
+CypherParser::OC_ReturnContext::OC_ReturnContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_ReturnContext::RETURN() {
+  return getToken(CypherParser::RETURN, 0);
+}
+
+CypherParser::OC_ProjectionBodyContext* CypherParser::OC_ReturnContext::oC_ProjectionBody() {
+  return getRuleContext<CypherParser::OC_ProjectionBodyContext>(0);
+}
+
+
+size_t CypherParser::OC_ReturnContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Return;
+}
+
+
+CypherParser::OC_ReturnContext* CypherParser::oC_Return() {
+  OC_ReturnContext *_localctx = _tracker.createInstance<OC_ReturnContext>(_ctx, getState());
+  enterRule(_localctx, 186, CypherParser::RuleOC_Return);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1727);
+    match(CypherParser::RETURN);
+    setState(1728);
+    oC_ProjectionBody();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ProjectionBodyContext ------------------------------------------------------------------
+
+CypherParser::OC_ProjectionBodyContext::OC_ProjectionBodyContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_ProjectionBodyContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_ProjectionBodyContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_ProjectionItemsContext* CypherParser::OC_ProjectionBodyContext::oC_ProjectionItems() {
+  return getRuleContext<CypherParser::OC_ProjectionItemsContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_ProjectionBodyContext::DISTINCT() {
+  return getToken(CypherParser::DISTINCT, 0);
+}
+
+CypherParser::OC_OrderContext* CypherParser::OC_ProjectionBodyContext::oC_Order() {
+  return getRuleContext<CypherParser::OC_OrderContext>(0);
+}
+
+CypherParser::OC_SkipContext* CypherParser::OC_ProjectionBodyContext::oC_Skip() {
+  return getRuleContext<CypherParser::OC_SkipContext>(0);
+}
+
+CypherParser::OC_LimitContext* CypherParser::OC_ProjectionBodyContext::oC_Limit() {
+  return getRuleContext<CypherParser::OC_LimitContext>(0);
+}
+
+
+size_t CypherParser::OC_ProjectionBodyContext::getRuleIndex() const {
+  return CypherParser::RuleOC_ProjectionBody;
+}
+
+
+CypherParser::OC_ProjectionBodyContext* CypherParser::oC_ProjectionBody() {
+  OC_ProjectionBodyContext *_localctx = _tracker.createInstance<OC_ProjectionBodyContext>(_ctx, getState());
+  enterRule(_localctx, 188, CypherParser::RuleOC_ProjectionBody);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1734);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 244, _ctx)) {
+    case 1: {
+      setState(1731);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1730);
+        match(CypherParser::SP);
+      }
+      setState(1733);
+      match(CypherParser::DISTINCT);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1736);
+    match(CypherParser::SP);
+    setState(1737);
+    oC_ProjectionItems();
+    setState(1740);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 245, _ctx)) {
+    case 1: {
+      setState(1738);
+      match(CypherParser::SP);
+      setState(1739);
+      oC_Order();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1744);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 246, _ctx)) {
+    case 1: {
+      setState(1742);
+      match(CypherParser::SP);
+      setState(1743);
+      oC_Skip();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(1748);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 247, _ctx)) {
+    case 1: {
+      setState(1746);
+      match(CypherParser::SP);
+      setState(1747);
+      oC_Limit();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ProjectionItemsContext ------------------------------------------------------------------
+
+CypherParser::OC_ProjectionItemsContext::OC_ProjectionItemsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_ProjectionItemsContext::STAR() {
+  return getToken(CypherParser::STAR, 0);
+}
+
+std::vector<CypherParser::OC_ProjectionItemContext *> CypherParser::OC_ProjectionItemsContext::oC_ProjectionItem() {
+  return getRuleContexts<CypherParser::OC_ProjectionItemContext>();
+}
+
+CypherParser::OC_ProjectionItemContext* CypherParser::OC_ProjectionItemsContext::oC_ProjectionItem(size_t i) {
+  return getRuleContext<CypherParser::OC_ProjectionItemContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_ProjectionItemsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_ProjectionItemsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_ProjectionItemsContext::getRuleIndex() const {
+  return CypherParser::RuleOC_ProjectionItems;
+}
+
+
+CypherParser::OC_ProjectionItemsContext* CypherParser::oC_ProjectionItems() {
+  OC_ProjectionItemsContext *_localctx = _tracker.createInstance<OC_ProjectionItemsContext>(_ctx, getState());
+  enterRule(_localctx, 190, CypherParser::RuleOC_ProjectionItems);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    setState(1778);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::STAR: {
+        enterOuterAlt(_localctx, 1);
+        setState(1750);
+        match(CypherParser::STAR);
+        setState(1761);
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 250, _ctx);
+        while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+          if (alt == 1) {
+            setState(1752);
+            _errHandler->sync(this);
+
+            _la = _input->LA(1);
+            if (_la == CypherParser::SP) {
+              setState(1751);
+              match(CypherParser::SP);
+            }
+            setState(1754);
+            match(CypherParser::T__3);
+            setState(1756);
+            _errHandler->sync(this);
+
+            _la = _input->LA(1);
+            if (_la == CypherParser::SP) {
+              setState(1755);
+              match(CypherParser::SP);
+            }
+            setState(1758);
+            oC_ProjectionItem(); 
+          }
+          setState(1763);
+          _errHandler->sync(this);
+          alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 250, _ctx);
+        }
+        break;
+      }
+
+      case CypherParser::T__1:
+      case CypherParser::T__6:
+      case CypherParser::T__8:
+      case CypherParser::T__24:
+      case CypherParser::ANY:
+      case CypherParser::ADD:
+      case CypherParser::ALL:
+      case CypherParser::ALTER:
+      case CypherParser::AS:
+      case CypherParser::ATTACH:
+      case CypherParser::BEGIN:
+      case CypherParser::BY:
+      case CypherParser::CALL:
+      case CypherParser::CASE:
+      case CypherParser::CAST:
+      case CypherParser::CHECKPOINT:
+      case CypherParser::COMMENT:
+      case CypherParser::COMMIT:
+      case CypherParser::CONTAINS:
+      case CypherParser::COPY:
+      case CypherParser::COUNT:
+      case CypherParser::CYCLE:
+      case CypherParser::DATABASE:
+      case CypherParser::DELETE:
+      case CypherParser::DETACH:
+      case CypherParser::DROP:
+      case CypherParser::EXISTS:
+      case CypherParser::EXPLAIN:
+      case CypherParser::EXPORT:
+      case CypherParser::EXTENSION:
+      case CypherParser::FALSE:
+      case CypherParser::FROM:
+      case CypherParser::FORCE:
+      case CypherParser::GRAPH:
+      case CypherParser::IMPORT:
+      case CypherParser::IF:
+      case CypherParser::INCREMENT:
+      case CypherParser::IS:
+      case CypherParser::KEY:
+      case CypherParser::LIMIT:
+      case CypherParser::LOAD:
+      case CypherParser::LOGICAL:
+      case CypherParser::MATCH:
+      case CypherParser::MAXVALUE:
+      case CypherParser::MERGE:
+      case CypherParser::MINVALUE:
+      case CypherParser::NO:
+      case CypherParser::NODE:
+      case CypherParser::NOT:
+      case CypherParser::NONE:
+      case CypherParser::NULL_:
+      case CypherParser::PROJECT:
+      case CypherParser::READ:
+      case CypherParser::REL:
+      case CypherParser::RENAME:
+      case CypherParser::RETURN:
+      case CypherParser::ROLLBACK:
+      case CypherParser::SEQUENCE:
+      case CypherParser::SET:
+      case CypherParser::START:
+      case CypherParser::STRUCT:
+      case CypherParser::TO:
+      case CypherParser::TRANSACTION:
+      case CypherParser::TRUE:
+      case CypherParser::TYPE:
+      case CypherParser::UNINSTALL:
+      case CypherParser::UPDATE:
+      case CypherParser::USE:
+      case CypherParser::WRITE:
+      case CypherParser::SINGLE:
+      case CypherParser::YIELD:
+      case CypherParser::USER:
+      case CypherParser::PASSWORD:
+      case CypherParser::ROLE:
+      case CypherParser::MAP:
+      case CypherParser::DECIMAL:
+      case CypherParser::L_SKIP:
+      case CypherParser::MINUS:
+      case CypherParser::StringLiteral:
+      case CypherParser::DecimalInteger:
+      case CypherParser::HexLetter:
+      case CypherParser::ExponentDecimalReal:
+      case CypherParser::RegularDecimalReal:
+      case CypherParser::UnescapedSymbolicName:
+      case CypherParser::EscapedSymbolicName: {
+        enterOuterAlt(_localctx, 2);
+        setState(1764);
+        oC_ProjectionItem();
+        setState(1775);
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 253, _ctx);
+        while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+          if (alt == 1) {
+            setState(1766);
+            _errHandler->sync(this);
+
+            _la = _input->LA(1);
+            if (_la == CypherParser::SP) {
+              setState(1765);
+              match(CypherParser::SP);
+            }
+            setState(1768);
+            match(CypherParser::T__3);
+            setState(1770);
+            _errHandler->sync(this);
+
+            _la = _input->LA(1);
+            if (_la == CypherParser::SP) {
+              setState(1769);
+              match(CypherParser::SP);
+            }
+            setState(1772);
+            oC_ProjectionItem(); 
+          }
+          setState(1777);
+          _errHandler->sync(this);
+          alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 253, _ctx);
+        }
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ProjectionItemContext ------------------------------------------------------------------
+
+CypherParser::OC_ProjectionItemContext::OC_ProjectionItemContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_ProjectionItemContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_ProjectionItemContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_ProjectionItemContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_ProjectionItemContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+CypherParser::OC_VariableContext* CypherParser::OC_ProjectionItemContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+
+size_t CypherParser::OC_ProjectionItemContext::getRuleIndex() const {
+  return CypherParser::RuleOC_ProjectionItem;
+}
+
+
+CypherParser::OC_ProjectionItemContext* CypherParser::oC_ProjectionItem() {
+  OC_ProjectionItemContext *_localctx = _tracker.createInstance<OC_ProjectionItemContext>(_ctx, getState());
+  enterRule(_localctx, 192, CypherParser::RuleOC_ProjectionItem);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1787);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 255, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1780);
+      oC_Expression();
+      setState(1781);
+      match(CypherParser::SP);
+      setState(1782);
+      match(CypherParser::AS);
+      setState(1783);
+      match(CypherParser::SP);
+      setState(1784);
+      oC_Variable();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1786);
+      oC_Expression();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_OrderContext ------------------------------------------------------------------
+
+CypherParser::OC_OrderContext::OC_OrderContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_OrderContext::ORDER() {
+  return getToken(CypherParser::ORDER, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_OrderContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_OrderContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_OrderContext::BY() {
+  return getToken(CypherParser::BY, 0);
+}
+
+std::vector<CypherParser::OC_SortItemContext *> CypherParser::OC_OrderContext::oC_SortItem() {
+  return getRuleContexts<CypherParser::OC_SortItemContext>();
+}
+
+CypherParser::OC_SortItemContext* CypherParser::OC_OrderContext::oC_SortItem(size_t i) {
+  return getRuleContext<CypherParser::OC_SortItemContext>(i);
+}
+
+
+size_t CypherParser::OC_OrderContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Order;
+}
+
+
+CypherParser::OC_OrderContext* CypherParser::oC_Order() {
+  OC_OrderContext *_localctx = _tracker.createInstance<OC_OrderContext>(_ctx, getState());
+  enterRule(_localctx, 194, CypherParser::RuleOC_Order);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1789);
+    match(CypherParser::ORDER);
+    setState(1790);
+    match(CypherParser::SP);
+    setState(1791);
+    match(CypherParser::BY);
+    setState(1792);
+    match(CypherParser::SP);
+    setState(1793);
+    oC_SortItem();
+    setState(1801);
+    _errHandler->sync(this);
+    _la = _input->LA(1);
+    while (_la == CypherParser::T__3) {
+      setState(1794);
+      match(CypherParser::T__3);
+      setState(1796);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1795);
+        match(CypherParser::SP);
+      }
+      setState(1798);
+      oC_SortItem();
+      setState(1803);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_SkipContext ------------------------------------------------------------------
+
+CypherParser::OC_SkipContext::OC_SkipContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_SkipContext::L_SKIP() {
+  return getToken(CypherParser::L_SKIP, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_SkipContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_SkipContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+
+size_t CypherParser::OC_SkipContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Skip;
+}
+
+
+CypherParser::OC_SkipContext* CypherParser::oC_Skip() {
+  OC_SkipContext *_localctx = _tracker.createInstance<OC_SkipContext>(_ctx, getState());
+  enterRule(_localctx, 196, CypherParser::RuleOC_Skip);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1804);
+    match(CypherParser::L_SKIP);
+    setState(1805);
+    match(CypherParser::SP);
+    setState(1806);
+    oC_Expression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_LimitContext ------------------------------------------------------------------
+
+CypherParser::OC_LimitContext::OC_LimitContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_LimitContext::LIMIT() {
+  return getToken(CypherParser::LIMIT, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_LimitContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_LimitContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+
+size_t CypherParser::OC_LimitContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Limit;
+}
+
+
+CypherParser::OC_LimitContext* CypherParser::oC_Limit() {
+  OC_LimitContext *_localctx = _tracker.createInstance<OC_LimitContext>(_ctx, getState());
+  enterRule(_localctx, 198, CypherParser::RuleOC_Limit);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1808);
+    match(CypherParser::LIMIT);
+    setState(1809);
+    match(CypherParser::SP);
+    setState(1810);
+    oC_Expression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_SortItemContext ------------------------------------------------------------------
+
+CypherParser::OC_SortItemContext::OC_SortItemContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_SortItemContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_SortItemContext::ASCENDING() {
+  return getToken(CypherParser::ASCENDING, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_SortItemContext::ASC() {
+  return getToken(CypherParser::ASC, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_SortItemContext::DESCENDING() {
+  return getToken(CypherParser::DESCENDING, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_SortItemContext::DESC() {
+  return getToken(CypherParser::DESC, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_SortItemContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+
+size_t CypherParser::OC_SortItemContext::getRuleIndex() const {
+  return CypherParser::RuleOC_SortItem;
+}
+
+
+CypherParser::OC_SortItemContext* CypherParser::oC_SortItem() {
+  OC_SortItemContext *_localctx = _tracker.createInstance<OC_SortItemContext>(_ctx, getState());
+  enterRule(_localctx, 200, CypherParser::RuleOC_SortItem);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1812);
+    oC_Expression();
+    setState(1817);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 259, _ctx)) {
+    case 1: {
+      setState(1814);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1813);
+        match(CypherParser::SP);
+      }
+      setState(1816);
+      _la = _input->LA(1);
+      if (!(((((_la - 52) & ~ 0x3fULL) == 0) &&
+        ((1ULL << (_la - 52)) & 12582915) != 0))) {
+      _errHandler->recoverInline(this);
+      }
+      else {
+        _errHandler->reportMatch(this);
+        consume();
+      }
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_WhereContext ------------------------------------------------------------------
+
+CypherParser::OC_WhereContext::OC_WhereContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_WhereContext::WHERE() {
+  return getToken(CypherParser::WHERE, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_WhereContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_WhereContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+
+size_t CypherParser::OC_WhereContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Where;
+}
+
+
+CypherParser::OC_WhereContext* CypherParser::oC_Where() {
+  OC_WhereContext *_localctx = _tracker.createInstance<OC_WhereContext>(_ctx, getState());
+  enterRule(_localctx, 202, CypherParser::RuleOC_Where);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1819);
+    match(CypherParser::WHERE);
+    setState(1820);
+    match(CypherParser::SP);
+    setState(1821);
+    oC_Expression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PatternContext ------------------------------------------------------------------
+
+CypherParser::OC_PatternContext::OC_PatternContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_PatternPartContext *> CypherParser::OC_PatternContext::oC_PatternPart() {
+  return getRuleContexts<CypherParser::OC_PatternPartContext>();
+}
+
+CypherParser::OC_PatternPartContext* CypherParser::OC_PatternContext::oC_PatternPart(size_t i) {
+  return getRuleContext<CypherParser::OC_PatternPartContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_PatternContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_PatternContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_PatternContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Pattern;
+}
+
+
+CypherParser::OC_PatternContext* CypherParser::oC_Pattern() {
+  OC_PatternContext *_localctx = _tracker.createInstance<OC_PatternContext>(_ctx, getState());
+  enterRule(_localctx, 204, CypherParser::RuleOC_Pattern);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(1823);
+    oC_PatternPart();
+    setState(1834);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 262, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(1825);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1824);
+          match(CypherParser::SP);
+        }
+        setState(1827);
+        match(CypherParser::T__3);
+        setState(1829);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1828);
+          match(CypherParser::SP);
+        }
+        setState(1831);
+        oC_PatternPart(); 
+      }
+      setState(1836);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 262, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PatternPartContext ------------------------------------------------------------------
+
+CypherParser::OC_PatternPartContext::OC_PatternPartContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_VariableContext* CypherParser::OC_PatternPartContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+CypherParser::OC_AnonymousPatternPartContext* CypherParser::OC_PatternPartContext::oC_AnonymousPatternPart() {
+  return getRuleContext<CypherParser::OC_AnonymousPatternPartContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_PatternPartContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_PatternPartContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_PatternPartContext::getRuleIndex() const {
+  return CypherParser::RuleOC_PatternPart;
+}
+
+
+CypherParser::OC_PatternPartContext* CypherParser::oC_PatternPart() {
+  OC_PatternPartContext *_localctx = _tracker.createInstance<OC_PatternPartContext>(_ctx, getState());
+  enterRule(_localctx, 206, CypherParser::RuleOC_PatternPart);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1848);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::ADD:
+      case CypherParser::ALTER:
+      case CypherParser::AS:
+      case CypherParser::ATTACH:
+      case CypherParser::BEGIN:
+      case CypherParser::BY:
+      case CypherParser::CALL:
+      case CypherParser::CHECKPOINT:
+      case CypherParser::COMMENT:
+      case CypherParser::COMMIT:
+      case CypherParser::CONTAINS:
+      case CypherParser::COPY:
+      case CypherParser::COUNT:
+      case CypherParser::CYCLE:
+      case CypherParser::DATABASE:
+      case CypherParser::DELETE:
+      case CypherParser::DETACH:
+      case CypherParser::DROP:
+      case CypherParser::EXPLAIN:
+      case CypherParser::EXPORT:
+      case CypherParser::EXTENSION:
+      case CypherParser::FROM:
+      case CypherParser::FORCE:
+      case CypherParser::GRAPH:
+      case CypherParser::IMPORT:
+      case CypherParser::IF:
+      case CypherParser::INCREMENT:
+      case CypherParser::IS:
+      case CypherParser::KEY:
+      case CypherParser::LIMIT:
+      case CypherParser::LOAD:
+      case CypherParser::LOGICAL:
+      case CypherParser::MATCH:
+      case CypherParser::MAXVALUE:
+      case CypherParser::MERGE:
+      case CypherParser::MINVALUE:
+      case CypherParser::NO:
+      case CypherParser::NODE:
+      case CypherParser::PROJECT:
+      case CypherParser::READ:
+      case CypherParser::REL:
+      case CypherParser::RENAME:
+      case CypherParser::RETURN:
+      case CypherParser::ROLLBACK:
+      case CypherParser::SEQUENCE:
+      case CypherParser::SET:
+      case CypherParser::START:
+      case CypherParser::STRUCT:
+      case CypherParser::TO:
+      case CypherParser::TRANSACTION:
+      case CypherParser::TYPE:
+      case CypherParser::UNINSTALL:
+      case CypherParser::UPDATE:
+      case CypherParser::USE:
+      case CypherParser::WRITE:
+      case CypherParser::YIELD:
+      case CypherParser::USER:
+      case CypherParser::PASSWORD:
+      case CypherParser::ROLE:
+      case CypherParser::MAP:
+      case CypherParser::DECIMAL:
+      case CypherParser::L_SKIP:
+      case CypherParser::HexLetter:
+      case CypherParser::UnescapedSymbolicName:
+      case CypherParser::EscapedSymbolicName: {
+        enterOuterAlt(_localctx, 1);
+        setState(1837);
+        oC_Variable();
+        setState(1839);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1838);
+          match(CypherParser::SP);
+        }
+        setState(1841);
+        match(CypherParser::T__5);
+        setState(1843);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1842);
+          match(CypherParser::SP);
+        }
+        setState(1845);
+        oC_AnonymousPatternPart();
+        break;
+      }
+
+      case CypherParser::T__1: {
+        enterOuterAlt(_localctx, 2);
+        setState(1847);
+        oC_AnonymousPatternPart();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_AnonymousPatternPartContext ------------------------------------------------------------------
+
+CypherParser::OC_AnonymousPatternPartContext::OC_AnonymousPatternPartContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_PatternElementContext* CypherParser::OC_AnonymousPatternPartContext::oC_PatternElement() {
+  return getRuleContext<CypherParser::OC_PatternElementContext>(0);
+}
+
+
+size_t CypherParser::OC_AnonymousPatternPartContext::getRuleIndex() const {
+  return CypherParser::RuleOC_AnonymousPatternPart;
+}
+
+
+CypherParser::OC_AnonymousPatternPartContext* CypherParser::oC_AnonymousPatternPart() {
+  OC_AnonymousPatternPartContext *_localctx = _tracker.createInstance<OC_AnonymousPatternPartContext>(_ctx, getState());
+  enterRule(_localctx, 208, CypherParser::RuleOC_AnonymousPatternPart);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1850);
+    oC_PatternElement();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PatternElementContext ------------------------------------------------------------------
+
+CypherParser::OC_PatternElementContext::OC_PatternElementContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_NodePatternContext* CypherParser::OC_PatternElementContext::oC_NodePattern() {
+  return getRuleContext<CypherParser::OC_NodePatternContext>(0);
+}
+
+std::vector<CypherParser::OC_PatternElementChainContext *> CypherParser::OC_PatternElementContext::oC_PatternElementChain() {
+  return getRuleContexts<CypherParser::OC_PatternElementChainContext>();
+}
+
+CypherParser::OC_PatternElementChainContext* CypherParser::OC_PatternElementContext::oC_PatternElementChain(size_t i) {
+  return getRuleContext<CypherParser::OC_PatternElementChainContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_PatternElementContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_PatternElementContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_PatternElementContext* CypherParser::OC_PatternElementContext::oC_PatternElement() {
+  return getRuleContext<CypherParser::OC_PatternElementContext>(0);
+}
+
+
+size_t CypherParser::OC_PatternElementContext::getRuleIndex() const {
+  return CypherParser::RuleOC_PatternElement;
+}
+
+
+CypherParser::OC_PatternElementContext* CypherParser::oC_PatternElement() {
+  OC_PatternElementContext *_localctx = _tracker.createInstance<OC_PatternElementContext>(_ctx, getState());
+  enterRule(_localctx, 210, CypherParser::RuleOC_PatternElement);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    setState(1866);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 268, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1852);
+      oC_NodePattern();
+      setState(1859);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 267, _ctx);
+      while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+        if (alt == 1) {
+          setState(1854);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(1853);
+            match(CypherParser::SP);
+          }
+          setState(1856);
+          oC_PatternElementChain(); 
+        }
+        setState(1861);
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 267, _ctx);
+      }
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1862);
+      match(CypherParser::T__1);
+      setState(1863);
+      oC_PatternElement();
+      setState(1864);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_NodePatternContext ------------------------------------------------------------------
+
+CypherParser::OC_NodePatternContext::OC_NodePatternContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_NodePatternContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_NodePatternContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_VariableContext* CypherParser::OC_NodePatternContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+CypherParser::OC_NodeLabelsContext* CypherParser::OC_NodePatternContext::oC_NodeLabels() {
+  return getRuleContext<CypherParser::OC_NodeLabelsContext>(0);
+}
+
+CypherParser::KU_PropertiesContext* CypherParser::OC_NodePatternContext::kU_Properties() {
+  return getRuleContext<CypherParser::KU_PropertiesContext>(0);
+}
+
+
+size_t CypherParser::OC_NodePatternContext::getRuleIndex() const {
+  return CypherParser::RuleOC_NodePattern;
+}
+
+
+CypherParser::OC_NodePatternContext* CypherParser::oC_NodePattern() {
+  OC_NodePatternContext *_localctx = _tracker.createInstance<OC_NodePatternContext>(_ctx, getState());
+  enterRule(_localctx, 212, CypherParser::RuleOC_NodePattern);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1868);
+    match(CypherParser::T__1);
+    setState(1870);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1869);
+      match(CypherParser::SP);
+    }
+    setState(1876);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if ((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & -3185593048922849280) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 65)) & -287985230644762313) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 130)) & 5068755015275819) != 0)) {
+      setState(1872);
+      oC_Variable();
+      setState(1874);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1873);
+        match(CypherParser::SP);
+      }
+    }
+    setState(1882);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::COLON) {
+      setState(1878);
+      oC_NodeLabels();
+      setState(1880);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1879);
+        match(CypherParser::SP);
+      }
+    }
+    setState(1888);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::T__8) {
+      setState(1884);
+      kU_Properties();
+      setState(1886);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1885);
+        match(CypherParser::SP);
+      }
+    }
+    setState(1890);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PatternElementChainContext ------------------------------------------------------------------
+
+CypherParser::OC_PatternElementChainContext::OC_PatternElementChainContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_RelationshipPatternContext* CypherParser::OC_PatternElementChainContext::oC_RelationshipPattern() {
+  return getRuleContext<CypherParser::OC_RelationshipPatternContext>(0);
+}
+
+CypherParser::OC_NodePatternContext* CypherParser::OC_PatternElementChainContext::oC_NodePattern() {
+  return getRuleContext<CypherParser::OC_NodePatternContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_PatternElementChainContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+
+size_t CypherParser::OC_PatternElementChainContext::getRuleIndex() const {
+  return CypherParser::RuleOC_PatternElementChain;
+}
+
+
+CypherParser::OC_PatternElementChainContext* CypherParser::oC_PatternElementChain() {
+  OC_PatternElementChainContext *_localctx = _tracker.createInstance<OC_PatternElementChainContext>(_ctx, getState());
+  enterRule(_localctx, 214, CypherParser::RuleOC_PatternElementChain);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1892);
+    oC_RelationshipPattern();
+    setState(1894);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1893);
+      match(CypherParser::SP);
+    }
+    setState(1896);
+    oC_NodePattern();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_RelationshipPatternContext ------------------------------------------------------------------
+
+CypherParser::OC_RelationshipPatternContext::OC_RelationshipPatternContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_LeftArrowHeadContext* CypherParser::OC_RelationshipPatternContext::oC_LeftArrowHead() {
+  return getRuleContext<CypherParser::OC_LeftArrowHeadContext>(0);
+}
+
+std::vector<CypherParser::OC_DashContext *> CypherParser::OC_RelationshipPatternContext::oC_Dash() {
+  return getRuleContexts<CypherParser::OC_DashContext>();
+}
+
+CypherParser::OC_DashContext* CypherParser::OC_RelationshipPatternContext::oC_Dash(size_t i) {
+  return getRuleContext<CypherParser::OC_DashContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_RelationshipPatternContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_RelationshipPatternContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_RelationshipDetailContext* CypherParser::OC_RelationshipPatternContext::oC_RelationshipDetail() {
+  return getRuleContext<CypherParser::OC_RelationshipDetailContext>(0);
+}
+
+CypherParser::OC_RightArrowHeadContext* CypherParser::OC_RelationshipPatternContext::oC_RightArrowHead() {
+  return getRuleContext<CypherParser::OC_RightArrowHeadContext>(0);
+}
+
+
+size_t CypherParser::OC_RelationshipPatternContext::getRuleIndex() const {
+  return CypherParser::RuleOC_RelationshipPattern;
+}
+
+
+CypherParser::OC_RelationshipPatternContext* CypherParser::oC_RelationshipPattern() {
+  OC_RelationshipPatternContext *_localctx = _tracker.createInstance<OC_RelationshipPatternContext>(_ctx, getState());
+  enterRule(_localctx, 216, CypherParser::RuleOC_RelationshipPattern);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(1942);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 288, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(1898);
+      oC_LeftArrowHead();
+      setState(1900);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1899);
+        match(CypherParser::SP);
+      }
+      setState(1902);
+      oC_Dash();
+      setState(1904);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 278, _ctx)) {
+      case 1: {
+        setState(1903);
+        match(CypherParser::SP);
+        break;
+      }
+
+      default:
+        break;
+      }
+      setState(1907);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::T__6) {
+        setState(1906);
+        oC_RelationshipDetail();
+      }
+      setState(1910);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1909);
+        match(CypherParser::SP);
+      }
+      setState(1912);
+      oC_Dash();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(1914);
+      oC_Dash();
+      setState(1916);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 281, _ctx)) {
+      case 1: {
+        setState(1915);
+        match(CypherParser::SP);
+        break;
+      }
+
+      default:
+        break;
+      }
+      setState(1919);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::T__6) {
+        setState(1918);
+        oC_RelationshipDetail();
+      }
+      setState(1922);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1921);
+        match(CypherParser::SP);
+      }
+      setState(1924);
+      oC_Dash();
+      setState(1926);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1925);
+        match(CypherParser::SP);
+      }
+      setState(1928);
+      oC_RightArrowHead();
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(1930);
+      oC_Dash();
+      setState(1932);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 285, _ctx)) {
+      case 1: {
+        setState(1931);
+        match(CypherParser::SP);
+        break;
+      }
+
+      default:
+        break;
+      }
+      setState(1935);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::T__6) {
+        setState(1934);
+        oC_RelationshipDetail();
+      }
+      setState(1938);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1937);
+        match(CypherParser::SP);
+      }
+      setState(1940);
+      oC_Dash();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_RelationshipDetailContext ------------------------------------------------------------------
+
+CypherParser::OC_RelationshipDetailContext::OC_RelationshipDetailContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_RelationshipDetailContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_RelationshipDetailContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_VariableContext* CypherParser::OC_RelationshipDetailContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+CypherParser::OC_RelationshipTypesContext* CypherParser::OC_RelationshipDetailContext::oC_RelationshipTypes() {
+  return getRuleContext<CypherParser::OC_RelationshipTypesContext>(0);
+}
+
+CypherParser::KU_RecursiveDetailContext* CypherParser::OC_RelationshipDetailContext::kU_RecursiveDetail() {
+  return getRuleContext<CypherParser::KU_RecursiveDetailContext>(0);
+}
+
+CypherParser::KU_PropertiesContext* CypherParser::OC_RelationshipDetailContext::kU_Properties() {
+  return getRuleContext<CypherParser::KU_PropertiesContext>(0);
+}
+
+
+size_t CypherParser::OC_RelationshipDetailContext::getRuleIndex() const {
+  return CypherParser::RuleOC_RelationshipDetail;
+}
+
+
+CypherParser::OC_RelationshipDetailContext* CypherParser::oC_RelationshipDetail() {
+  OC_RelationshipDetailContext *_localctx = _tracker.createInstance<OC_RelationshipDetailContext>(_ctx, getState());
+  enterRule(_localctx, 218, CypherParser::RuleOC_RelationshipDetail);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1944);
+    match(CypherParser::T__6);
+    setState(1946);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1945);
+      match(CypherParser::SP);
+    }
+    setState(1952);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if ((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & -3185593048922849280) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 65)) & -287985230644762313) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 130)) & 5068755015275819) != 0)) {
+      setState(1948);
+      oC_Variable();
+      setState(1950);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1949);
+        match(CypherParser::SP);
+      }
+    }
+    setState(1958);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::COLON) {
+      setState(1954);
+      oC_RelationshipTypes();
+      setState(1956);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1955);
+        match(CypherParser::SP);
+      }
+    }
+    setState(1964);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::STAR) {
+      setState(1960);
+      kU_RecursiveDetail();
+      setState(1962);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1961);
+        match(CypherParser::SP);
+      }
+    }
+    setState(1970);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::T__8) {
+      setState(1966);
+      kU_Properties();
+      setState(1968);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1967);
+        match(CypherParser::SP);
+      }
+    }
+    setState(1972);
+    match(CypherParser::T__7);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_PropertiesContext ------------------------------------------------------------------
+
+CypherParser::KU_PropertiesContext::KU_PropertiesContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_PropertiesContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_PropertiesContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<CypherParser::OC_PropertyKeyNameContext *> CypherParser::KU_PropertiesContext::oC_PropertyKeyName() {
+  return getRuleContexts<CypherParser::OC_PropertyKeyNameContext>();
+}
+
+CypherParser::OC_PropertyKeyNameContext* CypherParser::KU_PropertiesContext::oC_PropertyKeyName(size_t i) {
+  return getRuleContext<CypherParser::OC_PropertyKeyNameContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_PropertiesContext::COLON() {
+  return getTokens(CypherParser::COLON);
+}
+
+tree::TerminalNode* CypherParser::KU_PropertiesContext::COLON(size_t i) {
+  return getToken(CypherParser::COLON, i);
+}
+
+std::vector<CypherParser::OC_ExpressionContext *> CypherParser::KU_PropertiesContext::oC_Expression() {
+  return getRuleContexts<CypherParser::OC_ExpressionContext>();
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::KU_PropertiesContext::oC_Expression(size_t i) {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(i);
+}
+
+
+size_t CypherParser::KU_PropertiesContext::getRuleIndex() const {
+  return CypherParser::RuleKU_Properties;
+}
+
+
+CypherParser::KU_PropertiesContext* CypherParser::kU_Properties() {
+  KU_PropertiesContext *_localctx = _tracker.createInstance<KU_PropertiesContext>(_ctx, getState());
+  enterRule(_localctx, 220, CypherParser::RuleKU_Properties);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(1974);
+    match(CypherParser::T__8);
+    setState(1976);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(1975);
+      match(CypherParser::SP);
+    }
+    setState(2011);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if ((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & -3185593048922849280) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 65)) & -287985230644762313) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 130)) & 5068755015275819) != 0)) {
+      setState(1978);
+      oC_PropertyKeyName();
+      setState(1980);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1979);
+        match(CypherParser::SP);
+      }
+      setState(1982);
+      match(CypherParser::COLON);
+      setState(1984);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1983);
+        match(CypherParser::SP);
+      }
+      setState(1986);
+      oC_Expression();
+      setState(1988);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(1987);
+        match(CypherParser::SP);
+      }
+      setState(2008);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+      while (_la == CypherParser::T__3) {
+        setState(1990);
+        match(CypherParser::T__3);
+        setState(1992);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1991);
+          match(CypherParser::SP);
+        }
+        setState(1994);
+        oC_PropertyKeyName();
+        setState(1996);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1995);
+          match(CypherParser::SP);
+        }
+        setState(1998);
+        match(CypherParser::COLON);
+        setState(2000);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(1999);
+          match(CypherParser::SP);
+        }
+        setState(2002);
+        oC_Expression();
+        setState(2004);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2003);
+          match(CypherParser::SP);
+        }
+        setState(2010);
+        _errHandler->sync(this);
+        _la = _input->LA(1);
+      }
+    }
+    setState(2013);
+    match(CypherParser::T__9);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_RelationshipTypesContext ------------------------------------------------------------------
+
+CypherParser::OC_RelationshipTypesContext::OC_RelationshipTypesContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_RelationshipTypesContext::COLON() {
+  return getTokens(CypherParser::COLON);
+}
+
+tree::TerminalNode* CypherParser::OC_RelationshipTypesContext::COLON(size_t i) {
+  return getToken(CypherParser::COLON, i);
+}
+
+std::vector<CypherParser::OC_RelTypeNameContext *> CypherParser::OC_RelationshipTypesContext::oC_RelTypeName() {
+  return getRuleContexts<CypherParser::OC_RelTypeNameContext>();
+}
+
+CypherParser::OC_RelTypeNameContext* CypherParser::OC_RelationshipTypesContext::oC_RelTypeName(size_t i) {
+  return getRuleContext<CypherParser::OC_RelTypeNameContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_RelationshipTypesContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_RelationshipTypesContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_RelationshipTypesContext::getRuleIndex() const {
+  return CypherParser::RuleOC_RelationshipTypes;
+}
+
+
+CypherParser::OC_RelationshipTypesContext* CypherParser::oC_RelationshipTypes() {
+  OC_RelationshipTypesContext *_localctx = _tracker.createInstance<OC_RelationshipTypesContext>(_ctx, getState());
+  enterRule(_localctx, 222, CypherParser::RuleOC_RelationshipTypes);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2015);
+    match(CypherParser::COLON);
+    setState(2017);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2016);
+      match(CypherParser::SP);
+    }
+    setState(2019);
+    oC_RelTypeName();
+    setState(2033);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 312, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2021);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2020);
+          match(CypherParser::SP);
+        }
+        setState(2023);
+        match(CypherParser::T__10);
+        setState(2025);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::COLON) {
+          setState(2024);
+          match(CypherParser::COLON);
+        }
+        setState(2028);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2027);
+          match(CypherParser::SP);
+        }
+        setState(2030);
+        oC_RelTypeName(); 
+      }
+      setState(2035);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 312, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_NodeLabelsContext ------------------------------------------------------------------
+
+CypherParser::OC_NodeLabelsContext::OC_NodeLabelsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_NodeLabelsContext::COLON() {
+  return getTokens(CypherParser::COLON);
+}
+
+tree::TerminalNode* CypherParser::OC_NodeLabelsContext::COLON(size_t i) {
+  return getToken(CypherParser::COLON, i);
+}
+
+std::vector<CypherParser::OC_LabelNameContext *> CypherParser::OC_NodeLabelsContext::oC_LabelName() {
+  return getRuleContexts<CypherParser::OC_LabelNameContext>();
+}
+
+CypherParser::OC_LabelNameContext* CypherParser::OC_NodeLabelsContext::oC_LabelName(size_t i) {
+  return getRuleContext<CypherParser::OC_LabelNameContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_NodeLabelsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_NodeLabelsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_NodeLabelsContext::getRuleIndex() const {
+  return CypherParser::RuleOC_NodeLabels;
+}
+
+
+CypherParser::OC_NodeLabelsContext* CypherParser::oC_NodeLabels() {
+  OC_NodeLabelsContext *_localctx = _tracker.createInstance<OC_NodeLabelsContext>(_ctx, getState());
+  enterRule(_localctx, 224, CypherParser::RuleOC_NodeLabels);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2036);
+    match(CypherParser::COLON);
+    setState(2038);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2037);
+      match(CypherParser::SP);
+    }
+    setState(2040);
+    oC_LabelName();
+    setState(2057);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 318, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2042);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2041);
+          match(CypherParser::SP);
+        }
+        setState(2049);
+        _errHandler->sync(this);
+        switch (_input->LA(1)) {
+          case CypherParser::T__10: {
+            setState(2044);
+            match(CypherParser::T__10);
+            setState(2046);
+            _errHandler->sync(this);
+
+            _la = _input->LA(1);
+            if (_la == CypherParser::COLON) {
+              setState(2045);
+              match(CypherParser::COLON);
+            }
+            break;
+          }
+
+          case CypherParser::COLON: {
+            setState(2048);
+            match(CypherParser::COLON);
+            break;
+          }
+
+        default:
+          throw NoViableAltException(this);
+        }
+        setState(2052);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2051);
+          match(CypherParser::SP);
+        }
+        setState(2054);
+        oC_LabelName(); 
+      }
+      setState(2059);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 318, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_RecursiveDetailContext ------------------------------------------------------------------
+
+CypherParser::KU_RecursiveDetailContext::KU_RecursiveDetailContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveDetailContext::STAR() {
+  return getToken(CypherParser::STAR, 0);
+}
+
+CypherParser::KU_RecursiveTypeContext* CypherParser::KU_RecursiveDetailContext::kU_RecursiveType() {
+  return getRuleContext<CypherParser::KU_RecursiveTypeContext>(0);
+}
+
+CypherParser::OC_RangeLiteralContext* CypherParser::KU_RecursiveDetailContext::oC_RangeLiteral() {
+  return getRuleContext<CypherParser::OC_RangeLiteralContext>(0);
+}
+
+CypherParser::KU_RecursiveComprehensionContext* CypherParser::KU_RecursiveDetailContext::kU_RecursiveComprehension() {
+  return getRuleContext<CypherParser::KU_RecursiveComprehensionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_RecursiveDetailContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveDetailContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_RecursiveDetailContext::getRuleIndex() const {
+  return CypherParser::RuleKU_RecursiveDetail;
+}
+
+
+CypherParser::KU_RecursiveDetailContext* CypherParser::kU_RecursiveDetail() {
+  KU_RecursiveDetailContext *_localctx = _tracker.createInstance<KU_RecursiveDetailContext>(_ctx, getState());
+  enterRule(_localctx, 226, CypherParser::RuleKU_RecursiveDetail);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2060);
+    match(CypherParser::STAR);
+    setState(2065);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 320, _ctx)) {
+    case 1: {
+      setState(2062);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2061);
+        match(CypherParser::SP);
+      }
+      setState(2064);
+      kU_RecursiveType();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2071);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 322, _ctx)) {
+    case 1: {
+      setState(2068);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 321, _ctx)) {
+      case 1: {
+        setState(2067);
+        match(CypherParser::SP);
+        break;
+      }
+
+      default:
+        break;
+      }
+      setState(2070);
+      oC_RangeLiteral();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2077);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 324, _ctx)) {
+    case 1: {
+      setState(2074);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2073);
+        match(CypherParser::SP);
+      }
+      setState(2076);
+      kU_RecursiveComprehension();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_RecursiveTypeContext ------------------------------------------------------------------
+
+CypherParser::KU_RecursiveTypeContext::KU_RecursiveTypeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveTypeContext::WSHORTEST() {
+  return getToken(CypherParser::WSHORTEST, 0);
+}
+
+CypherParser::OC_PropertyKeyNameContext* CypherParser::KU_RecursiveTypeContext::oC_PropertyKeyName() {
+  return getRuleContext<CypherParser::OC_PropertyKeyNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveTypeContext::ALL() {
+  return getToken(CypherParser::ALL, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_RecursiveTypeContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveTypeContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveTypeContext::SHORTEST() {
+  return getToken(CypherParser::SHORTEST, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveTypeContext::TRAIL() {
+  return getToken(CypherParser::TRAIL, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveTypeContext::ACYCLIC() {
+  return getToken(CypherParser::ACYCLIC, 0);
+}
+
+
+size_t CypherParser::KU_RecursiveTypeContext::getRuleIndex() const {
+  return CypherParser::RuleKU_RecursiveType;
+}
+
+
+CypherParser::KU_RecursiveTypeContext* CypherParser::kU_RecursiveType() {
+  KU_RecursiveTypeContext *_localctx = _tracker.createInstance<KU_RecursiveTypeContext>(_ctx, getState());
+  enterRule(_localctx, 228, CypherParser::RuleKU_RecursiveType);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2103);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 329, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(2081);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::ALL) {
+        setState(2079);
+        match(CypherParser::ALL);
+        setState(2080);
+        match(CypherParser::SP);
+      }
+      setState(2083);
+      match(CypherParser::WSHORTEST);
+      setState(2085);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2084);
+        match(CypherParser::SP);
+      }
+      setState(2087);
+      match(CypherParser::T__1);
+      setState(2089);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2088);
+        match(CypherParser::SP);
+      }
+      setState(2091);
+      oC_PropertyKeyName();
+      setState(2093);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2092);
+        match(CypherParser::SP);
+      }
+      setState(2095);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(2097);
+      match(CypherParser::SHORTEST);
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(2098);
+      match(CypherParser::ALL);
+      setState(2099);
+      match(CypherParser::SP);
+      setState(2100);
+      match(CypherParser::SHORTEST);
+      break;
+    }
+
+    case 4: {
+      enterOuterAlt(_localctx, 4);
+      setState(2101);
+      match(CypherParser::TRAIL);
+      break;
+    }
+
+    case 5: {
+      enterOuterAlt(_localctx, 5);
+      setState(2102);
+      match(CypherParser::ACYCLIC);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_RangeLiteralContext ------------------------------------------------------------------
+
+CypherParser::OC_RangeLiteralContext::OC_RangeLiteralContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_RangeLiteralContext::DOTDOT() {
+  return getToken(CypherParser::DOTDOT, 0);
+}
+
+CypherParser::OC_LowerBoundContext* CypherParser::OC_RangeLiteralContext::oC_LowerBound() {
+  return getRuleContext<CypherParser::OC_LowerBoundContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_RangeLiteralContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_RangeLiteralContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_UpperBoundContext* CypherParser::OC_RangeLiteralContext::oC_UpperBound() {
+  return getRuleContext<CypherParser::OC_UpperBoundContext>(0);
+}
+
+CypherParser::OC_IntegerLiteralContext* CypherParser::OC_RangeLiteralContext::oC_IntegerLiteral() {
+  return getRuleContext<CypherParser::OC_IntegerLiteralContext>(0);
+}
+
+
+size_t CypherParser::OC_RangeLiteralContext::getRuleIndex() const {
+  return CypherParser::RuleOC_RangeLiteral;
+}
+
+
+CypherParser::OC_RangeLiteralContext* CypherParser::oC_RangeLiteral() {
+  OC_RangeLiteralContext *_localctx = _tracker.createInstance<OC_RangeLiteralContext>(_ctx, getState());
+  enterRule(_localctx, 230, CypherParser::RuleOC_RangeLiteral);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2119);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 334, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(2106);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::DecimalInteger) {
+        setState(2105);
+        oC_LowerBound();
+      }
+      setState(2109);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2108);
+        match(CypherParser::SP);
+      }
+      setState(2111);
+      match(CypherParser::DOTDOT);
+      setState(2113);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 332, _ctx)) {
+      case 1: {
+        setState(2112);
+        match(CypherParser::SP);
+        break;
+      }
+
+      default:
+        break;
+      }
+      setState(2116);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::DecimalInteger) {
+        setState(2115);
+        oC_UpperBound();
+      }
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(2118);
+      oC_IntegerLiteral();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_RecursiveComprehensionContext ------------------------------------------------------------------
+
+CypherParser::KU_RecursiveComprehensionContext::KU_RecursiveComprehensionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_VariableContext *> CypherParser::KU_RecursiveComprehensionContext::oC_Variable() {
+  return getRuleContexts<CypherParser::OC_VariableContext>();
+}
+
+CypherParser::OC_VariableContext* CypherParser::KU_RecursiveComprehensionContext::oC_Variable(size_t i) {
+  return getRuleContext<CypherParser::OC_VariableContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_RecursiveComprehensionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveComprehensionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_WhereContext* CypherParser::KU_RecursiveComprehensionContext::oC_Where() {
+  return getRuleContext<CypherParser::OC_WhereContext>(0);
+}
+
+std::vector<CypherParser::KU_RecursiveProjectionItemsContext *> CypherParser::KU_RecursiveComprehensionContext::kU_RecursiveProjectionItems() {
+  return getRuleContexts<CypherParser::KU_RecursiveProjectionItemsContext>();
+}
+
+CypherParser::KU_RecursiveProjectionItemsContext* CypherParser::KU_RecursiveComprehensionContext::kU_RecursiveProjectionItems(size_t i) {
+  return getRuleContext<CypherParser::KU_RecursiveProjectionItemsContext>(i);
+}
+
+
+size_t CypherParser::KU_RecursiveComprehensionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_RecursiveComprehension;
+}
+
+
+CypherParser::KU_RecursiveComprehensionContext* CypherParser::kU_RecursiveComprehension() {
+  KU_RecursiveComprehensionContext *_localctx = _tracker.createInstance<KU_RecursiveComprehensionContext>(_ctx, getState());
+  enterRule(_localctx, 232, CypherParser::RuleKU_RecursiveComprehension);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2121);
+    match(CypherParser::T__1);
+    setState(2123);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2122);
+      match(CypherParser::SP);
+    }
+    setState(2125);
+    oC_Variable();
+    setState(2127);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2126);
+      match(CypherParser::SP);
+    }
+    setState(2129);
+    match(CypherParser::T__3);
+    setState(2131);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2130);
+      match(CypherParser::SP);
+    }
+    setState(2133);
+    oC_Variable();
+    setState(2145);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 341, _ctx)) {
+    case 1: {
+      setState(2135);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2134);
+        match(CypherParser::SP);
+      }
+      setState(2137);
+      match(CypherParser::T__10);
+      setState(2139);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2138);
+        match(CypherParser::SP);
+      }
+      setState(2141);
+      oC_Where();
+      setState(2143);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 340, _ctx)) {
+      case 1: {
+        setState(2142);
+        match(CypherParser::SP);
+        break;
+      }
+
+      default:
+        break;
+      }
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2166);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::T__10 || _la == CypherParser::SP) {
+      setState(2148);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2147);
+        match(CypherParser::SP);
+      }
+      setState(2150);
+      match(CypherParser::T__10);
+      setState(2152);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2151);
+        match(CypherParser::SP);
+      }
+      setState(2154);
+      kU_RecursiveProjectionItems();
+      setState(2156);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2155);
+        match(CypherParser::SP);
+      }
+      setState(2158);
+      match(CypherParser::T__3);
+      setState(2160);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2159);
+        match(CypherParser::SP);
+      }
+      setState(2162);
+      kU_RecursiveProjectionItems();
+      setState(2164);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2163);
+        match(CypherParser::SP);
+      }
+    }
+    setState(2168);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_RecursiveProjectionItemsContext ------------------------------------------------------------------
+
+CypherParser::KU_RecursiveProjectionItemsContext::KU_RecursiveProjectionItemsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_RecursiveProjectionItemsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_RecursiveProjectionItemsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_ProjectionItemsContext* CypherParser::KU_RecursiveProjectionItemsContext::oC_ProjectionItems() {
+  return getRuleContext<CypherParser::OC_ProjectionItemsContext>(0);
+}
+
+
+size_t CypherParser::KU_RecursiveProjectionItemsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_RecursiveProjectionItems;
+}
+
+
+CypherParser::KU_RecursiveProjectionItemsContext* CypherParser::kU_RecursiveProjectionItems() {
+  KU_RecursiveProjectionItemsContext *_localctx = _tracker.createInstance<KU_RecursiveProjectionItemsContext>(_ctx, getState());
+  enterRule(_localctx, 234, CypherParser::RuleKU_RecursiveProjectionItems);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2170);
+    match(CypherParser::T__8);
+    setState(2172);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 348, _ctx)) {
+    case 1: {
+      setState(2171);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2175);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if ((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & -2320550076713270652) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 65)) & -286014905805559497) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 130)) & 5492412753616171) != 0)) {
+      setState(2174);
+      oC_ProjectionItems();
+    }
+    setState(2178);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2177);
+      match(CypherParser::SP);
+    }
+    setState(2180);
+    match(CypherParser::T__9);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_LowerBoundContext ------------------------------------------------------------------
+
+CypherParser::OC_LowerBoundContext::OC_LowerBoundContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_LowerBoundContext::DecimalInteger() {
+  return getToken(CypherParser::DecimalInteger, 0);
+}
+
+
+size_t CypherParser::OC_LowerBoundContext::getRuleIndex() const {
+  return CypherParser::RuleOC_LowerBound;
+}
+
+
+CypherParser::OC_LowerBoundContext* CypherParser::oC_LowerBound() {
+  OC_LowerBoundContext *_localctx = _tracker.createInstance<OC_LowerBoundContext>(_ctx, getState());
+  enterRule(_localctx, 236, CypherParser::RuleOC_LowerBound);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2182);
+    match(CypherParser::DecimalInteger);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_UpperBoundContext ------------------------------------------------------------------
+
+CypherParser::OC_UpperBoundContext::OC_UpperBoundContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_UpperBoundContext::DecimalInteger() {
+  return getToken(CypherParser::DecimalInteger, 0);
+}
+
+
+size_t CypherParser::OC_UpperBoundContext::getRuleIndex() const {
+  return CypherParser::RuleOC_UpperBound;
+}
+
+
+CypherParser::OC_UpperBoundContext* CypherParser::oC_UpperBound() {
+  OC_UpperBoundContext *_localctx = _tracker.createInstance<OC_UpperBoundContext>(_ctx, getState());
+  enterRule(_localctx, 238, CypherParser::RuleOC_UpperBound);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2184);
+    match(CypherParser::DecimalInteger);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_LabelNameContext ------------------------------------------------------------------
+
+CypherParser::OC_LabelNameContext::OC_LabelNameContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::OC_LabelNameContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+
+size_t CypherParser::OC_LabelNameContext::getRuleIndex() const {
+  return CypherParser::RuleOC_LabelName;
+}
+
+
+CypherParser::OC_LabelNameContext* CypherParser::oC_LabelName() {
+  OC_LabelNameContext *_localctx = _tracker.createInstance<OC_LabelNameContext>(_ctx, getState());
+  enterRule(_localctx, 240, CypherParser::RuleOC_LabelName);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2186);
+    oC_SchemaName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_RelTypeNameContext ------------------------------------------------------------------
+
+CypherParser::OC_RelTypeNameContext::OC_RelTypeNameContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::OC_RelTypeNameContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+
+size_t CypherParser::OC_RelTypeNameContext::getRuleIndex() const {
+  return CypherParser::RuleOC_RelTypeName;
+}
+
+
+CypherParser::OC_RelTypeNameContext* CypherParser::oC_RelTypeName() {
+  OC_RelTypeNameContext *_localctx = _tracker.createInstance<OC_RelTypeNameContext>(_ctx, getState());
+  enterRule(_localctx, 242, CypherParser::RuleOC_RelTypeName);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2188);
+    oC_SchemaName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_ExpressionContext::OC_ExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_OrExpressionContext* CypherParser::OC_ExpressionContext::oC_OrExpression() {
+  return getRuleContext<CypherParser::OC_OrExpressionContext>(0);
+}
+
+
+size_t CypherParser::OC_ExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Expression;
+}
+
+
+CypherParser::OC_ExpressionContext* CypherParser::oC_Expression() {
+  OC_ExpressionContext *_localctx = _tracker.createInstance<OC_ExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 244, CypherParser::RuleOC_Expression);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2190);
+    oC_OrExpression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_OrExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_OrExpressionContext::OC_OrExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_XorExpressionContext *> CypherParser::OC_OrExpressionContext::oC_XorExpression() {
+  return getRuleContexts<CypherParser::OC_XorExpressionContext>();
+}
+
+CypherParser::OC_XorExpressionContext* CypherParser::OC_OrExpressionContext::oC_XorExpression(size_t i) {
+  return getRuleContext<CypherParser::OC_XorExpressionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_OrExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_OrExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_OrExpressionContext::OR() {
+  return getTokens(CypherParser::OR);
+}
+
+tree::TerminalNode* CypherParser::OC_OrExpressionContext::OR(size_t i) {
+  return getToken(CypherParser::OR, i);
+}
+
+
+size_t CypherParser::OC_OrExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_OrExpression;
+}
+
+
+CypherParser::OC_OrExpressionContext* CypherParser::oC_OrExpression() {
+  OC_OrExpressionContext *_localctx = _tracker.createInstance<OC_OrExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 246, CypherParser::RuleOC_OrExpression);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2192);
+    oC_XorExpression();
+    setState(2199);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 351, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2193);
+        match(CypherParser::SP);
+        setState(2194);
+        match(CypherParser::OR);
+        setState(2195);
+        match(CypherParser::SP);
+        setState(2196);
+        oC_XorExpression(); 
+      }
+      setState(2201);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 351, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_XorExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_XorExpressionContext::OC_XorExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_AndExpressionContext *> CypherParser::OC_XorExpressionContext::oC_AndExpression() {
+  return getRuleContexts<CypherParser::OC_AndExpressionContext>();
+}
+
+CypherParser::OC_AndExpressionContext* CypherParser::OC_XorExpressionContext::oC_AndExpression(size_t i) {
+  return getRuleContext<CypherParser::OC_AndExpressionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_XorExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_XorExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_XorExpressionContext::XOR() {
+  return getTokens(CypherParser::XOR);
+}
+
+tree::TerminalNode* CypherParser::OC_XorExpressionContext::XOR(size_t i) {
+  return getToken(CypherParser::XOR, i);
+}
+
+
+size_t CypherParser::OC_XorExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_XorExpression;
+}
+
+
+CypherParser::OC_XorExpressionContext* CypherParser::oC_XorExpression() {
+  OC_XorExpressionContext *_localctx = _tracker.createInstance<OC_XorExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 248, CypherParser::RuleOC_XorExpression);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2202);
+    oC_AndExpression();
+    setState(2209);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 352, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2203);
+        match(CypherParser::SP);
+        setState(2204);
+        match(CypherParser::XOR);
+        setState(2205);
+        match(CypherParser::SP);
+        setState(2206);
+        oC_AndExpression(); 
+      }
+      setState(2211);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 352, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_AndExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_AndExpressionContext::OC_AndExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_NotExpressionContext *> CypherParser::OC_AndExpressionContext::oC_NotExpression() {
+  return getRuleContexts<CypherParser::OC_NotExpressionContext>();
+}
+
+CypherParser::OC_NotExpressionContext* CypherParser::OC_AndExpressionContext::oC_NotExpression(size_t i) {
+  return getRuleContext<CypherParser::OC_NotExpressionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_AndExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_AndExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_AndExpressionContext::AND() {
+  return getTokens(CypherParser::AND);
+}
+
+tree::TerminalNode* CypherParser::OC_AndExpressionContext::AND(size_t i) {
+  return getToken(CypherParser::AND, i);
+}
+
+
+size_t CypherParser::OC_AndExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_AndExpression;
+}
+
+
+CypherParser::OC_AndExpressionContext* CypherParser::oC_AndExpression() {
+  OC_AndExpressionContext *_localctx = _tracker.createInstance<OC_AndExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 250, CypherParser::RuleOC_AndExpression);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2212);
+    oC_NotExpression();
+    setState(2219);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 353, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2213);
+        match(CypherParser::SP);
+        setState(2214);
+        match(CypherParser::AND);
+        setState(2215);
+        match(CypherParser::SP);
+        setState(2216);
+        oC_NotExpression(); 
+      }
+      setState(2221);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 353, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_NotExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_NotExpressionContext::OC_NotExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_ComparisonExpressionContext* CypherParser::OC_NotExpressionContext::oC_ComparisonExpression() {
+  return getRuleContext<CypherParser::OC_ComparisonExpressionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_NotExpressionContext::NOT() {
+  return getTokens(CypherParser::NOT);
+}
+
+tree::TerminalNode* CypherParser::OC_NotExpressionContext::NOT(size_t i) {
+  return getToken(CypherParser::NOT, i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_NotExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_NotExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_NotExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_NotExpression;
+}
+
+
+CypherParser::OC_NotExpressionContext* CypherParser::oC_NotExpression() {
+  OC_NotExpressionContext *_localctx = _tracker.createInstance<OC_NotExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 252, CypherParser::RuleOC_NotExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2228);
+    _errHandler->sync(this);
+    _la = _input->LA(1);
+    while (_la == CypherParser::NOT) {
+      setState(2222);
+      match(CypherParser::NOT);
+      setState(2224);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2223);
+        match(CypherParser::SP);
+      }
+      setState(2230);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+    }
+    setState(2231);
+    oC_ComparisonExpression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ComparisonExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_ComparisonExpressionContext::OC_ComparisonExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_BitwiseOrOperatorExpressionContext *> CypherParser::OC_ComparisonExpressionContext::kU_BitwiseOrOperatorExpression() {
+  return getRuleContexts<CypherParser::KU_BitwiseOrOperatorExpressionContext>();
+}
+
+CypherParser::KU_BitwiseOrOperatorExpressionContext* CypherParser::OC_ComparisonExpressionContext::kU_BitwiseOrOperatorExpression(size_t i) {
+  return getRuleContext<CypherParser::KU_BitwiseOrOperatorExpressionContext>(i);
+}
+
+std::vector<CypherParser::KU_ComparisonOperatorContext *> CypherParser::OC_ComparisonExpressionContext::kU_ComparisonOperator() {
+  return getRuleContexts<CypherParser::KU_ComparisonOperatorContext>();
+}
+
+CypherParser::KU_ComparisonOperatorContext* CypherParser::OC_ComparisonExpressionContext::kU_ComparisonOperator(size_t i) {
+  return getRuleContext<CypherParser::KU_ComparisonOperatorContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_ComparisonExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_ComparisonExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_ComparisonExpressionContext::INVALID_NOT_EQUAL() {
+  return getToken(CypherParser::INVALID_NOT_EQUAL, 0);
+}
+
+
+size_t CypherParser::OC_ComparisonExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_ComparisonExpression;
+}
+
+
+CypherParser::OC_ComparisonExpressionContext* CypherParser::oC_ComparisonExpression() {
+  OC_ComparisonExpressionContext *_localctx = _tracker.createInstance<OC_ComparisonExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 254, CypherParser::RuleOC_ComparisonExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    setState(2281);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 366, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(2233);
+      kU_BitwiseOrOperatorExpression();
+      setState(2243);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 358, _ctx)) {
+      case 1: {
+        setState(2235);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2234);
+          match(CypherParser::SP);
+        }
+        setState(2237);
+        kU_ComparisonOperator();
+        setState(2239);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2238);
+          match(CypherParser::SP);
+        }
+        setState(2241);
+        kU_BitwiseOrOperatorExpression();
+        break;
+      }
+
+      default:
+        break;
+      }
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(2245);
+      kU_BitwiseOrOperatorExpression();
+
+      setState(2247);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2246);
+        match(CypherParser::SP);
+      }
+      setState(2249);
+      antlrcpp::downCast<OC_ComparisonExpressionContext *>(_localctx)->invalid_not_equalToken = match(CypherParser::INVALID_NOT_EQUAL);
+      setState(2251);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2250);
+        match(CypherParser::SP);
+      }
+      setState(2253);
+      kU_BitwiseOrOperatorExpression();
+       notifyInvalidNotEqualOperator(antlrcpp::downCast<OC_ComparisonExpressionContext *>(_localctx)->invalid_not_equalToken); 
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(2257);
+      kU_BitwiseOrOperatorExpression();
+      setState(2259);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2258);
+        match(CypherParser::SP);
+      }
+      setState(2261);
+      kU_ComparisonOperator();
+      setState(2263);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2262);
+        match(CypherParser::SP);
+      }
+      setState(2265);
+      kU_BitwiseOrOperatorExpression();
+      setState(2275); 
+      _errHandler->sync(this);
+      alt = 1;
+      do {
+        switch (alt) {
+          case 1: {
+                setState(2267);
+                _errHandler->sync(this);
+
+                _la = _input->LA(1);
+                if (_la == CypherParser::SP) {
+                  setState(2266);
+                  match(CypherParser::SP);
+                }
+                setState(2269);
+                kU_ComparisonOperator();
+                setState(2271);
+                _errHandler->sync(this);
+
+                _la = _input->LA(1);
+                if (_la == CypherParser::SP) {
+                  setState(2270);
+                  match(CypherParser::SP);
+                }
+                setState(2273);
+                kU_BitwiseOrOperatorExpression();
+                break;
+              }
+
+        default:
+          throw NoViableAltException(this);
+        }
+        setState(2277); 
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 365, _ctx);
+      } while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER);
+       notifyNonBinaryComparison(_localctx->start); 
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ComparisonOperatorContext ------------------------------------------------------------------
+
+CypherParser::KU_ComparisonOperatorContext::KU_ComparisonOperatorContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+
+size_t CypherParser::KU_ComparisonOperatorContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ComparisonOperator;
+}
+
+
+CypherParser::KU_ComparisonOperatorContext* CypherParser::kU_ComparisonOperator() {
+  KU_ComparisonOperatorContext *_localctx = _tracker.createInstance<KU_ComparisonOperatorContext>(_ctx, getState());
+  enterRule(_localctx, 256, CypherParser::RuleKU_ComparisonOperator);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2283);
+    _la = _input->LA(1);
+    if (!((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & 127040) != 0))) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_BitwiseOrOperatorExpressionContext ------------------------------------------------------------------
+
+CypherParser::KU_BitwiseOrOperatorExpressionContext::KU_BitwiseOrOperatorExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_BitwiseAndOperatorExpressionContext *> CypherParser::KU_BitwiseOrOperatorExpressionContext::kU_BitwiseAndOperatorExpression() {
+  return getRuleContexts<CypherParser::KU_BitwiseAndOperatorExpressionContext>();
+}
+
+CypherParser::KU_BitwiseAndOperatorExpressionContext* CypherParser::KU_BitwiseOrOperatorExpressionContext::kU_BitwiseAndOperatorExpression(size_t i) {
+  return getRuleContext<CypherParser::KU_BitwiseAndOperatorExpressionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_BitwiseOrOperatorExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_BitwiseOrOperatorExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_BitwiseOrOperatorExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_BitwiseOrOperatorExpression;
+}
+
+
+CypherParser::KU_BitwiseOrOperatorExpressionContext* CypherParser::kU_BitwiseOrOperatorExpression() {
+  KU_BitwiseOrOperatorExpressionContext *_localctx = _tracker.createInstance<KU_BitwiseOrOperatorExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 258, CypherParser::RuleKU_BitwiseOrOperatorExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2285);
+    kU_BitwiseAndOperatorExpression();
+    setState(2296);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 369, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2287);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2286);
+          match(CypherParser::SP);
+        }
+        setState(2289);
+        match(CypherParser::T__10);
+        setState(2291);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2290);
+          match(CypherParser::SP);
+        }
+        setState(2293);
+        kU_BitwiseAndOperatorExpression(); 
+      }
+      setState(2298);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 369, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_BitwiseAndOperatorExpressionContext ------------------------------------------------------------------
+
+CypherParser::KU_BitwiseAndOperatorExpressionContext::KU_BitwiseAndOperatorExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_BitShiftOperatorExpressionContext *> CypherParser::KU_BitwiseAndOperatorExpressionContext::kU_BitShiftOperatorExpression() {
+  return getRuleContexts<CypherParser::KU_BitShiftOperatorExpressionContext>();
+}
+
+CypherParser::KU_BitShiftOperatorExpressionContext* CypherParser::KU_BitwiseAndOperatorExpressionContext::kU_BitShiftOperatorExpression(size_t i) {
+  return getRuleContext<CypherParser::KU_BitShiftOperatorExpressionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_BitwiseAndOperatorExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_BitwiseAndOperatorExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_BitwiseAndOperatorExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_BitwiseAndOperatorExpression;
+}
+
+
+CypherParser::KU_BitwiseAndOperatorExpressionContext* CypherParser::kU_BitwiseAndOperatorExpression() {
+  KU_BitwiseAndOperatorExpressionContext *_localctx = _tracker.createInstance<KU_BitwiseAndOperatorExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 260, CypherParser::RuleKU_BitwiseAndOperatorExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2299);
+    kU_BitShiftOperatorExpression();
+    setState(2310);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 372, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2301);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2300);
+          match(CypherParser::SP);
+        }
+        setState(2303);
+        match(CypherParser::T__16);
+        setState(2305);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2304);
+          match(CypherParser::SP);
+        }
+        setState(2307);
+        kU_BitShiftOperatorExpression(); 
+      }
+      setState(2312);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 372, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_BitShiftOperatorExpressionContext ------------------------------------------------------------------
+
+CypherParser::KU_BitShiftOperatorExpressionContext::KU_BitShiftOperatorExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_AddOrSubtractExpressionContext *> CypherParser::KU_BitShiftOperatorExpressionContext::oC_AddOrSubtractExpression() {
+  return getRuleContexts<CypherParser::OC_AddOrSubtractExpressionContext>();
+}
+
+CypherParser::OC_AddOrSubtractExpressionContext* CypherParser::KU_BitShiftOperatorExpressionContext::oC_AddOrSubtractExpression(size_t i) {
+  return getRuleContext<CypherParser::OC_AddOrSubtractExpressionContext>(i);
+}
+
+std::vector<CypherParser::KU_BitShiftOperatorContext *> CypherParser::KU_BitShiftOperatorExpressionContext::kU_BitShiftOperator() {
+  return getRuleContexts<CypherParser::KU_BitShiftOperatorContext>();
+}
+
+CypherParser::KU_BitShiftOperatorContext* CypherParser::KU_BitShiftOperatorExpressionContext::kU_BitShiftOperator(size_t i) {
+  return getRuleContext<CypherParser::KU_BitShiftOperatorContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_BitShiftOperatorExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_BitShiftOperatorExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_BitShiftOperatorExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleKU_BitShiftOperatorExpression;
+}
+
+
+CypherParser::KU_BitShiftOperatorExpressionContext* CypherParser::kU_BitShiftOperatorExpression() {
+  KU_BitShiftOperatorExpressionContext *_localctx = _tracker.createInstance<KU_BitShiftOperatorExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 262, CypherParser::RuleKU_BitShiftOperatorExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2313);
+    oC_AddOrSubtractExpression();
+    setState(2325);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 375, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2315);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2314);
+          match(CypherParser::SP);
+        }
+        setState(2317);
+        kU_BitShiftOperator();
+        setState(2319);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2318);
+          match(CypherParser::SP);
+        }
+        setState(2321);
+        oC_AddOrSubtractExpression(); 
+      }
+      setState(2327);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 375, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_BitShiftOperatorContext ------------------------------------------------------------------
+
+CypherParser::KU_BitShiftOperatorContext::KU_BitShiftOperatorContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+
+size_t CypherParser::KU_BitShiftOperatorContext::getRuleIndex() const {
+  return CypherParser::RuleKU_BitShiftOperator;
+}
+
+
+CypherParser::KU_BitShiftOperatorContext* CypherParser::kU_BitShiftOperator() {
+  KU_BitShiftOperatorContext *_localctx = _tracker.createInstance<KU_BitShiftOperatorContext>(_ctx, getState());
+  enterRule(_localctx, 264, CypherParser::RuleKU_BitShiftOperator);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2328);
+    _la = _input->LA(1);
+    if (!(_la == CypherParser::T__17
+
+    || _la == CypherParser::T__18)) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_AddOrSubtractExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_AddOrSubtractExpressionContext::OC_AddOrSubtractExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_MultiplyDivideModuloExpressionContext *> CypherParser::OC_AddOrSubtractExpressionContext::oC_MultiplyDivideModuloExpression() {
+  return getRuleContexts<CypherParser::OC_MultiplyDivideModuloExpressionContext>();
+}
+
+CypherParser::OC_MultiplyDivideModuloExpressionContext* CypherParser::OC_AddOrSubtractExpressionContext::oC_MultiplyDivideModuloExpression(size_t i) {
+  return getRuleContext<CypherParser::OC_MultiplyDivideModuloExpressionContext>(i);
+}
+
+std::vector<CypherParser::KU_AddOrSubtractOperatorContext *> CypherParser::OC_AddOrSubtractExpressionContext::kU_AddOrSubtractOperator() {
+  return getRuleContexts<CypherParser::KU_AddOrSubtractOperatorContext>();
+}
+
+CypherParser::KU_AddOrSubtractOperatorContext* CypherParser::OC_AddOrSubtractExpressionContext::kU_AddOrSubtractOperator(size_t i) {
+  return getRuleContext<CypherParser::KU_AddOrSubtractOperatorContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_AddOrSubtractExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_AddOrSubtractExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_AddOrSubtractExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_AddOrSubtractExpression;
+}
+
+
+CypherParser::OC_AddOrSubtractExpressionContext* CypherParser::oC_AddOrSubtractExpression() {
+  OC_AddOrSubtractExpressionContext *_localctx = _tracker.createInstance<OC_AddOrSubtractExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 266, CypherParser::RuleOC_AddOrSubtractExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2330);
+    oC_MultiplyDivideModuloExpression();
+    setState(2342);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 378, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2332);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2331);
+          match(CypherParser::SP);
+        }
+        setState(2334);
+        kU_AddOrSubtractOperator();
+        setState(2336);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2335);
+          match(CypherParser::SP);
+        }
+        setState(2338);
+        oC_MultiplyDivideModuloExpression(); 
+      }
+      setState(2344);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 378, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_AddOrSubtractOperatorContext ------------------------------------------------------------------
+
+CypherParser::KU_AddOrSubtractOperatorContext::KU_AddOrSubtractOperatorContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_AddOrSubtractOperatorContext::MINUS() {
+  return getToken(CypherParser::MINUS, 0);
+}
+
+
+size_t CypherParser::KU_AddOrSubtractOperatorContext::getRuleIndex() const {
+  return CypherParser::RuleKU_AddOrSubtractOperator;
+}
+
+
+CypherParser::KU_AddOrSubtractOperatorContext* CypherParser::kU_AddOrSubtractOperator() {
+  KU_AddOrSubtractOperatorContext *_localctx = _tracker.createInstance<KU_AddOrSubtractOperatorContext>(_ctx, getState());
+  enterRule(_localctx, 268, CypherParser::RuleKU_AddOrSubtractOperator);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2345);
+    _la = _input->LA(1);
+    if (!(_la == CypherParser::T__19 || _la == CypherParser::MINUS)) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_MultiplyDivideModuloExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_MultiplyDivideModuloExpressionContext::OC_MultiplyDivideModuloExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_PowerOfExpressionContext *> CypherParser::OC_MultiplyDivideModuloExpressionContext::oC_PowerOfExpression() {
+  return getRuleContexts<CypherParser::OC_PowerOfExpressionContext>();
+}
+
+CypherParser::OC_PowerOfExpressionContext* CypherParser::OC_MultiplyDivideModuloExpressionContext::oC_PowerOfExpression(size_t i) {
+  return getRuleContext<CypherParser::OC_PowerOfExpressionContext>(i);
+}
+
+std::vector<CypherParser::KU_MultiplyDivideModuloOperatorContext *> CypherParser::OC_MultiplyDivideModuloExpressionContext::kU_MultiplyDivideModuloOperator() {
+  return getRuleContexts<CypherParser::KU_MultiplyDivideModuloOperatorContext>();
+}
+
+CypherParser::KU_MultiplyDivideModuloOperatorContext* CypherParser::OC_MultiplyDivideModuloExpressionContext::kU_MultiplyDivideModuloOperator(size_t i) {
+  return getRuleContext<CypherParser::KU_MultiplyDivideModuloOperatorContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_MultiplyDivideModuloExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_MultiplyDivideModuloExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_MultiplyDivideModuloExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_MultiplyDivideModuloExpression;
+}
+
+
+CypherParser::OC_MultiplyDivideModuloExpressionContext* CypherParser::oC_MultiplyDivideModuloExpression() {
+  OC_MultiplyDivideModuloExpressionContext *_localctx = _tracker.createInstance<OC_MultiplyDivideModuloExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 270, CypherParser::RuleOC_MultiplyDivideModuloExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2347);
+    oC_PowerOfExpression();
+    setState(2359);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 381, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2349);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2348);
+          match(CypherParser::SP);
+        }
+        setState(2351);
+        kU_MultiplyDivideModuloOperator();
+        setState(2353);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2352);
+          match(CypherParser::SP);
+        }
+        setState(2355);
+        oC_PowerOfExpression(); 
+      }
+      setState(2361);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 381, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_MultiplyDivideModuloOperatorContext ------------------------------------------------------------------
+
+CypherParser::KU_MultiplyDivideModuloOperatorContext::KU_MultiplyDivideModuloOperatorContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_MultiplyDivideModuloOperatorContext::STAR() {
+  return getToken(CypherParser::STAR, 0);
+}
+
+
+size_t CypherParser::KU_MultiplyDivideModuloOperatorContext::getRuleIndex() const {
+  return CypherParser::RuleKU_MultiplyDivideModuloOperator;
+}
+
+
+CypherParser::KU_MultiplyDivideModuloOperatorContext* CypherParser::kU_MultiplyDivideModuloOperator() {
+  KU_MultiplyDivideModuloOperatorContext *_localctx = _tracker.createInstance<KU_MultiplyDivideModuloOperatorContext>(_ctx, getState());
+  enterRule(_localctx, 272, CypherParser::RuleKU_MultiplyDivideModuloOperator);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2362);
+    _la = _input->LA(1);
+    if (!(_la == CypherParser::T__20
+
+    || _la == CypherParser::T__21 || _la == CypherParser::STAR)) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PowerOfExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_PowerOfExpressionContext::OC_PowerOfExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_StringListNullOperatorExpressionContext *> CypherParser::OC_PowerOfExpressionContext::oC_StringListNullOperatorExpression() {
+  return getRuleContexts<CypherParser::OC_StringListNullOperatorExpressionContext>();
+}
+
+CypherParser::OC_StringListNullOperatorExpressionContext* CypherParser::OC_PowerOfExpressionContext::oC_StringListNullOperatorExpression(size_t i) {
+  return getRuleContext<CypherParser::OC_StringListNullOperatorExpressionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_PowerOfExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_PowerOfExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_PowerOfExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_PowerOfExpression;
+}
+
+
+CypherParser::OC_PowerOfExpressionContext* CypherParser::oC_PowerOfExpression() {
+  OC_PowerOfExpressionContext *_localctx = _tracker.createInstance<OC_PowerOfExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 274, CypherParser::RuleOC_PowerOfExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2364);
+    oC_StringListNullOperatorExpression();
+    setState(2375);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 384, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2366);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2365);
+          match(CypherParser::SP);
+        }
+        setState(2368);
+        match(CypherParser::T__22);
+        setState(2370);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2369);
+          match(CypherParser::SP);
+        }
+        setState(2372);
+        oC_StringListNullOperatorExpression(); 
+      }
+      setState(2377);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 384, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_StringListNullOperatorExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_StringListNullOperatorExpressionContext::OC_StringListNullOperatorExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext* CypherParser::OC_StringListNullOperatorExpressionContext::oC_UnaryAddSubtractOrFactorialExpression() {
+  return getRuleContext<CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext>(0);
+}
+
+CypherParser::OC_StringOperatorExpressionContext* CypherParser::OC_StringListNullOperatorExpressionContext::oC_StringOperatorExpression() {
+  return getRuleContext<CypherParser::OC_StringOperatorExpressionContext>(0);
+}
+
+CypherParser::OC_NullOperatorExpressionContext* CypherParser::OC_StringListNullOperatorExpressionContext::oC_NullOperatorExpression() {
+  return getRuleContext<CypherParser::OC_NullOperatorExpressionContext>(0);
+}
+
+std::vector<CypherParser::OC_ListOperatorExpressionContext *> CypherParser::OC_StringListNullOperatorExpressionContext::oC_ListOperatorExpression() {
+  return getRuleContexts<CypherParser::OC_ListOperatorExpressionContext>();
+}
+
+CypherParser::OC_ListOperatorExpressionContext* CypherParser::OC_StringListNullOperatorExpressionContext::oC_ListOperatorExpression(size_t i) {
+  return getRuleContext<CypherParser::OC_ListOperatorExpressionContext>(i);
+}
+
+
+size_t CypherParser::OC_StringListNullOperatorExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_StringListNullOperatorExpression;
+}
+
+
+CypherParser::OC_StringListNullOperatorExpressionContext* CypherParser::oC_StringListNullOperatorExpression() {
+  OC_StringListNullOperatorExpressionContext *_localctx = _tracker.createInstance<OC_StringListNullOperatorExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 276, CypherParser::RuleOC_StringListNullOperatorExpression);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2378);
+    oC_UnaryAddSubtractOrFactorialExpression();
+    setState(2386);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 386, _ctx)) {
+    case 1: {
+      setState(2379);
+      oC_StringOperatorExpression();
+      break;
+    }
+
+    case 2: {
+      setState(2381); 
+      _errHandler->sync(this);
+      alt = 1;
+      do {
+        switch (alt) {
+          case 1: {
+                setState(2380);
+                oC_ListOperatorExpression();
+                break;
+              }
+
+        default:
+          throw NoViableAltException(this);
+        }
+        setState(2383); 
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 385, _ctx);
+      } while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER);
+      break;
+    }
+
+    case 3: {
+      setState(2385);
+      oC_NullOperatorExpression();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ListOperatorExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_ListOperatorExpressionContext::OC_ListOperatorExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_ListOperatorExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_ListOperatorExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_ListOperatorExpressionContext::IN() {
+  return getToken(CypherParser::IN, 0);
+}
+
+CypherParser::OC_PropertyOrLabelsExpressionContext* CypherParser::OC_ListOperatorExpressionContext::oC_PropertyOrLabelsExpression() {
+  return getRuleContext<CypherParser::OC_PropertyOrLabelsExpressionContext>(0);
+}
+
+std::vector<CypherParser::OC_ExpressionContext *> CypherParser::OC_ListOperatorExpressionContext::oC_Expression() {
+  return getRuleContexts<CypherParser::OC_ExpressionContext>();
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_ListOperatorExpressionContext::oC_Expression(size_t i) {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(i);
+}
+
+tree::TerminalNode* CypherParser::OC_ListOperatorExpressionContext::COLON() {
+  return getToken(CypherParser::COLON, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_ListOperatorExpressionContext::DOTDOT() {
+  return getToken(CypherParser::DOTDOT, 0);
+}
+
+
+size_t CypherParser::OC_ListOperatorExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_ListOperatorExpression;
+}
+
+
+CypherParser::OC_ListOperatorExpressionContext* CypherParser::oC_ListOperatorExpression() {
+  OC_ListOperatorExpressionContext *_localctx = _tracker.createInstance<OC_ListOperatorExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 278, CypherParser::RuleOC_ListOperatorExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2407);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 390, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(2388);
+      match(CypherParser::SP);
+      setState(2389);
+      match(CypherParser::IN);
+      setState(2391);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2390);
+        match(CypherParser::SP);
+      }
+      setState(2393);
+      oC_PropertyOrLabelsExpression();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(2394);
+      match(CypherParser::T__6);
+      setState(2395);
+      oC_Expression();
+      setState(2396);
+      match(CypherParser::T__7);
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(2398);
+      match(CypherParser::T__6);
+      setState(2400);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if ((((_la & ~ 0x3fULL) == 0) &&
+        ((1ULL << _la) & -2320550076713270652) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+        ((1ULL << (_la - 65)) & -286014905805559497) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+        ((1ULL << (_la - 130)) & 5492410606132523) != 0)) {
+        setState(2399);
+        oC_Expression();
+      }
+      setState(2402);
+      _la = _input->LA(1);
+      if (!(_la == CypherParser::COLON
+
+      || _la == CypherParser::DOTDOT)) {
+      _errHandler->recoverInline(this);
+      }
+      else {
+        _errHandler->reportMatch(this);
+        consume();
+      }
+      setState(2404);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if ((((_la & ~ 0x3fULL) == 0) &&
+        ((1ULL << _la) & -2320550076713270652) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+        ((1ULL << (_la - 65)) & -286014905805559497) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+        ((1ULL << (_la - 130)) & 5492410606132523) != 0)) {
+        setState(2403);
+        oC_Expression();
+      }
+      setState(2406);
+      match(CypherParser::T__7);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_StringOperatorExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_StringOperatorExpressionContext::OC_StringOperatorExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_PropertyOrLabelsExpressionContext* CypherParser::OC_StringOperatorExpressionContext::oC_PropertyOrLabelsExpression() {
+  return getRuleContext<CypherParser::OC_PropertyOrLabelsExpressionContext>(0);
+}
+
+CypherParser::OC_RegularExpressionContext* CypherParser::OC_StringOperatorExpressionContext::oC_RegularExpression() {
+  return getRuleContext<CypherParser::OC_RegularExpressionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_StringOperatorExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_StringOperatorExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_StringOperatorExpressionContext::STARTS() {
+  return getToken(CypherParser::STARTS, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_StringOperatorExpressionContext::WITH() {
+  return getToken(CypherParser::WITH, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_StringOperatorExpressionContext::ENDS() {
+  return getToken(CypherParser::ENDS, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_StringOperatorExpressionContext::CONTAINS() {
+  return getToken(CypherParser::CONTAINS, 0);
+}
+
+
+size_t CypherParser::OC_StringOperatorExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_StringOperatorExpression;
+}
+
+
+CypherParser::OC_StringOperatorExpressionContext* CypherParser::oC_StringOperatorExpression() {
+  OC_StringOperatorExpressionContext *_localctx = _tracker.createInstance<OC_StringOperatorExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 280, CypherParser::RuleOC_StringOperatorExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2420);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 391, _ctx)) {
+    case 1: {
+      setState(2409);
+      oC_RegularExpression();
+      break;
+    }
+
+    case 2: {
+      setState(2410);
+      match(CypherParser::SP);
+      setState(2411);
+      match(CypherParser::STARTS);
+      setState(2412);
+      match(CypherParser::SP);
+      setState(2413);
+      match(CypherParser::WITH);
+      break;
+    }
+
+    case 3: {
+      setState(2414);
+      match(CypherParser::SP);
+      setState(2415);
+      match(CypherParser::ENDS);
+      setState(2416);
+      match(CypherParser::SP);
+      setState(2417);
+      match(CypherParser::WITH);
+      break;
+    }
+
+    case 4: {
+      setState(2418);
+      match(CypherParser::SP);
+      setState(2419);
+      match(CypherParser::CONTAINS);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2423);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2422);
+      match(CypherParser::SP);
+    }
+    setState(2425);
+    oC_PropertyOrLabelsExpression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_RegularExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_RegularExpressionContext::OC_RegularExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_RegularExpressionContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+
+size_t CypherParser::OC_RegularExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_RegularExpression;
+}
+
+
+CypherParser::OC_RegularExpressionContext* CypherParser::oC_RegularExpression() {
+  OC_RegularExpressionContext *_localctx = _tracker.createInstance<OC_RegularExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 282, CypherParser::RuleOC_RegularExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2428);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2427);
+      match(CypherParser::SP);
+    }
+    setState(2430);
+    match(CypherParser::T__23);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_NullOperatorExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_NullOperatorExpressionContext::OC_NullOperatorExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_NullOperatorExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_NullOperatorExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_NullOperatorExpressionContext::IS() {
+  return getToken(CypherParser::IS, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_NullOperatorExpressionContext::NULL_() {
+  return getToken(CypherParser::NULL_, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_NullOperatorExpressionContext::NOT() {
+  return getToken(CypherParser::NOT, 0);
+}
+
+
+size_t CypherParser::OC_NullOperatorExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_NullOperatorExpression;
+}
+
+
+CypherParser::OC_NullOperatorExpressionContext* CypherParser::oC_NullOperatorExpression() {
+  OC_NullOperatorExpressionContext *_localctx = _tracker.createInstance<OC_NullOperatorExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 284, CypherParser::RuleOC_NullOperatorExpression);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2442);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 394, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(2432);
+      match(CypherParser::SP);
+      setState(2433);
+      match(CypherParser::IS);
+      setState(2434);
+      match(CypherParser::SP);
+      setState(2435);
+      match(CypherParser::NULL_);
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(2436);
+      match(CypherParser::SP);
+      setState(2437);
+      match(CypherParser::IS);
+      setState(2438);
+      match(CypherParser::SP);
+      setState(2439);
+      match(CypherParser::NOT);
+      setState(2440);
+      match(CypherParser::SP);
+      setState(2441);
+      match(CypherParser::NULL_);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_UnaryAddSubtractOrFactorialExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext::OC_UnaryAddSubtractOrFactorialExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_PropertyOrLabelsExpressionContext* CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext::oC_PropertyOrLabelsExpression() {
+  return getRuleContext<CypherParser::OC_PropertyOrLabelsExpressionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext::MINUS() {
+  return getTokens(CypherParser::MINUS);
+}
+
+tree::TerminalNode* CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext::MINUS(size_t i) {
+  return getToken(CypherParser::MINUS, i);
+}
+
+tree::TerminalNode* CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext::FACTORIAL() {
+  return getToken(CypherParser::FACTORIAL, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_UnaryAddSubtractOrFactorialExpression;
+}
+
+
+CypherParser::OC_UnaryAddSubtractOrFactorialExpressionContext* CypherParser::oC_UnaryAddSubtractOrFactorialExpression() {
+  OC_UnaryAddSubtractOrFactorialExpressionContext *_localctx = _tracker.createInstance<OC_UnaryAddSubtractOrFactorialExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 286, CypherParser::RuleOC_UnaryAddSubtractOrFactorialExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2450);
+    _errHandler->sync(this);
+    _la = _input->LA(1);
+    while (_la == CypherParser::MINUS) {
+      setState(2444);
+      match(CypherParser::MINUS);
+      setState(2446);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2445);
+        match(CypherParser::SP);
+      }
+      setState(2452);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+    }
+    setState(2453);
+    oC_PropertyOrLabelsExpression();
+    setState(2458);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 398, _ctx)) {
+    case 1: {
+      setState(2455);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2454);
+        match(CypherParser::SP);
+      }
+      setState(2457);
+      match(CypherParser::FACTORIAL);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PropertyOrLabelsExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_PropertyOrLabelsExpressionContext::OC_PropertyOrLabelsExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_AtomContext* CypherParser::OC_PropertyOrLabelsExpressionContext::oC_Atom() {
+  return getRuleContext<CypherParser::OC_AtomContext>(0);
+}
+
+std::vector<CypherParser::OC_PropertyLookupContext *> CypherParser::OC_PropertyOrLabelsExpressionContext::oC_PropertyLookup() {
+  return getRuleContexts<CypherParser::OC_PropertyLookupContext>();
+}
+
+CypherParser::OC_PropertyLookupContext* CypherParser::OC_PropertyOrLabelsExpressionContext::oC_PropertyLookup(size_t i) {
+  return getRuleContext<CypherParser::OC_PropertyLookupContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_PropertyOrLabelsExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_PropertyOrLabelsExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_PropertyOrLabelsExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_PropertyOrLabelsExpression;
+}
+
+
+CypherParser::OC_PropertyOrLabelsExpressionContext* CypherParser::oC_PropertyOrLabelsExpression() {
+  OC_PropertyOrLabelsExpressionContext *_localctx = _tracker.createInstance<OC_PropertyOrLabelsExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 288, CypherParser::RuleOC_PropertyOrLabelsExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2460);
+    oC_Atom();
+    setState(2467);
+    _errHandler->sync(this);
+    alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 400, _ctx);
+    while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER) {
+      if (alt == 1) {
+        setState(2462);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2461);
+          match(CypherParser::SP);
+        }
+        setState(2464);
+        oC_PropertyLookup(); 
+      }
+      setState(2469);
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 400, _ctx);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_AtomContext ------------------------------------------------------------------
+
+CypherParser::OC_AtomContext::OC_AtomContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_LiteralContext* CypherParser::OC_AtomContext::oC_Literal() {
+  return getRuleContext<CypherParser::OC_LiteralContext>(0);
+}
+
+CypherParser::OC_ParameterContext* CypherParser::OC_AtomContext::oC_Parameter() {
+  return getRuleContext<CypherParser::OC_ParameterContext>(0);
+}
+
+CypherParser::OC_CaseExpressionContext* CypherParser::OC_AtomContext::oC_CaseExpression() {
+  return getRuleContext<CypherParser::OC_CaseExpressionContext>(0);
+}
+
+CypherParser::OC_ParenthesizedExpressionContext* CypherParser::OC_AtomContext::oC_ParenthesizedExpression() {
+  return getRuleContext<CypherParser::OC_ParenthesizedExpressionContext>(0);
+}
+
+CypherParser::OC_FunctionInvocationContext* CypherParser::OC_AtomContext::oC_FunctionInvocation() {
+  return getRuleContext<CypherParser::OC_FunctionInvocationContext>(0);
+}
+
+CypherParser::OC_PathPatternsContext* CypherParser::OC_AtomContext::oC_PathPatterns() {
+  return getRuleContext<CypherParser::OC_PathPatternsContext>(0);
+}
+
+CypherParser::OC_ExistCountSubqueryContext* CypherParser::OC_AtomContext::oC_ExistCountSubquery() {
+  return getRuleContext<CypherParser::OC_ExistCountSubqueryContext>(0);
+}
+
+CypherParser::OC_VariableContext* CypherParser::OC_AtomContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+CypherParser::OC_QuantifierContext* CypherParser::OC_AtomContext::oC_Quantifier() {
+  return getRuleContext<CypherParser::OC_QuantifierContext>(0);
+}
+
+
+size_t CypherParser::OC_AtomContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Atom;
+}
+
+
+CypherParser::OC_AtomContext* CypherParser::oC_Atom() {
+  OC_AtomContext *_localctx = _tracker.createInstance<OC_AtomContext>(_ctx, getState());
+  enterRule(_localctx, 290, CypherParser::RuleOC_Atom);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2479);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 401, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(2470);
+      oC_Literal();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(2471);
+      oC_Parameter();
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(2472);
+      oC_CaseExpression();
+      break;
+    }
+
+    case 4: {
+      enterOuterAlt(_localctx, 4);
+      setState(2473);
+      oC_ParenthesizedExpression();
+      break;
+    }
+
+    case 5: {
+      enterOuterAlt(_localctx, 5);
+      setState(2474);
+      oC_FunctionInvocation();
+      break;
+    }
+
+    case 6: {
+      enterOuterAlt(_localctx, 6);
+      setState(2475);
+      oC_PathPatterns();
+      break;
+    }
+
+    case 7: {
+      enterOuterAlt(_localctx, 7);
+      setState(2476);
+      oC_ExistCountSubquery();
+      break;
+    }
+
+    case 8: {
+      enterOuterAlt(_localctx, 8);
+      setState(2477);
+      oC_Variable();
+      break;
+    }
+
+    case 9: {
+      enterOuterAlt(_localctx, 9);
+      setState(2478);
+      oC_Quantifier();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_QuantifierContext ------------------------------------------------------------------
+
+CypherParser::OC_QuantifierContext::OC_QuantifierContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_QuantifierContext::ALL() {
+  return getToken(CypherParser::ALL, 0);
+}
+
+CypherParser::OC_FilterExpressionContext* CypherParser::OC_QuantifierContext::oC_FilterExpression() {
+  return getRuleContext<CypherParser::OC_FilterExpressionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_QuantifierContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_QuantifierContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_QuantifierContext::ANY() {
+  return getToken(CypherParser::ANY, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_QuantifierContext::NONE() {
+  return getToken(CypherParser::NONE, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_QuantifierContext::SINGLE() {
+  return getToken(CypherParser::SINGLE, 0);
+}
+
+
+size_t CypherParser::OC_QuantifierContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Quantifier;
+}
+
+
+CypherParser::OC_QuantifierContext* CypherParser::oC_Quantifier() {
+  OC_QuantifierContext *_localctx = _tracker.createInstance<OC_QuantifierContext>(_ctx, getState());
+  enterRule(_localctx, 292, CypherParser::RuleOC_Quantifier);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2537);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::ALL: {
+        enterOuterAlt(_localctx, 1);
+        setState(2481);
+        match(CypherParser::ALL);
+        setState(2483);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2482);
+          match(CypherParser::SP);
+        }
+        setState(2485);
+        match(CypherParser::T__1);
+        setState(2487);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2486);
+          match(CypherParser::SP);
+        }
+        setState(2489);
+        oC_FilterExpression();
+        setState(2491);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2490);
+          match(CypherParser::SP);
+        }
+        setState(2493);
+        match(CypherParser::T__2);
+        break;
+      }
+
+      case CypherParser::ANY: {
+        enterOuterAlt(_localctx, 2);
+        setState(2495);
+        match(CypherParser::ANY);
+        setState(2497);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2496);
+          match(CypherParser::SP);
+        }
+        setState(2499);
+        match(CypherParser::T__1);
+        setState(2501);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2500);
+          match(CypherParser::SP);
+        }
+        setState(2503);
+        oC_FilterExpression();
+        setState(2505);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2504);
+          match(CypherParser::SP);
+        }
+        setState(2507);
+        match(CypherParser::T__2);
+        break;
+      }
+
+      case CypherParser::NONE: {
+        enterOuterAlt(_localctx, 3);
+        setState(2509);
+        match(CypherParser::NONE);
+        setState(2511);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2510);
+          match(CypherParser::SP);
+        }
+        setState(2513);
+        match(CypherParser::T__1);
+        setState(2515);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2514);
+          match(CypherParser::SP);
+        }
+        setState(2517);
+        oC_FilterExpression();
+        setState(2519);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2518);
+          match(CypherParser::SP);
+        }
+        setState(2521);
+        match(CypherParser::T__2);
+        break;
+      }
+
+      case CypherParser::SINGLE: {
+        enterOuterAlt(_localctx, 4);
+        setState(2523);
+        match(CypherParser::SINGLE);
+        setState(2525);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2524);
+          match(CypherParser::SP);
+        }
+        setState(2527);
+        match(CypherParser::T__1);
+        setState(2529);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2528);
+          match(CypherParser::SP);
+        }
+        setState(2531);
+        oC_FilterExpression();
+        setState(2533);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2532);
+          match(CypherParser::SP);
+        }
+        setState(2535);
+        match(CypherParser::T__2);
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_FilterExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_FilterExpressionContext::OC_FilterExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_IdInCollContext* CypherParser::OC_FilterExpressionContext::oC_IdInColl() {
+  return getRuleContext<CypherParser::OC_IdInCollContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_FilterExpressionContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_WhereContext* CypherParser::OC_FilterExpressionContext::oC_Where() {
+  return getRuleContext<CypherParser::OC_WhereContext>(0);
+}
+
+
+size_t CypherParser::OC_FilterExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_FilterExpression;
+}
+
+
+CypherParser::OC_FilterExpressionContext* CypherParser::oC_FilterExpression() {
+  OC_FilterExpressionContext *_localctx = _tracker.createInstance<OC_FilterExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 294, CypherParser::RuleOC_FilterExpression);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2539);
+    oC_IdInColl();
+    setState(2540);
+    match(CypherParser::SP);
+    setState(2541);
+    oC_Where();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_IdInCollContext ------------------------------------------------------------------
+
+CypherParser::OC_IdInCollContext::OC_IdInCollContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_VariableContext* CypherParser::OC_IdInCollContext::oC_Variable() {
+  return getRuleContext<CypherParser::OC_VariableContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_IdInCollContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_IdInCollContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_IdInCollContext::IN() {
+  return getToken(CypherParser::IN, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_IdInCollContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+
+size_t CypherParser::OC_IdInCollContext::getRuleIndex() const {
+  return CypherParser::RuleOC_IdInColl;
+}
+
+
+CypherParser::OC_IdInCollContext* CypherParser::oC_IdInColl() {
+  OC_IdInCollContext *_localctx = _tracker.createInstance<OC_IdInCollContext>(_ctx, getState());
+  enterRule(_localctx, 296, CypherParser::RuleOC_IdInColl);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2543);
+    oC_Variable();
+    setState(2544);
+    match(CypherParser::SP);
+    setState(2545);
+    match(CypherParser::IN);
+    setState(2546);
+    match(CypherParser::SP);
+    setState(2547);
+    oC_Expression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_LiteralContext ------------------------------------------------------------------
+
+CypherParser::OC_LiteralContext::OC_LiteralContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_NumberLiteralContext* CypherParser::OC_LiteralContext::oC_NumberLiteral() {
+  return getRuleContext<CypherParser::OC_NumberLiteralContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_LiteralContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+CypherParser::OC_BooleanLiteralContext* CypherParser::OC_LiteralContext::oC_BooleanLiteral() {
+  return getRuleContext<CypherParser::OC_BooleanLiteralContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_LiteralContext::NULL_() {
+  return getToken(CypherParser::NULL_, 0);
+}
+
+CypherParser::OC_ListLiteralContext* CypherParser::OC_LiteralContext::oC_ListLiteral() {
+  return getRuleContext<CypherParser::OC_ListLiteralContext>(0);
+}
+
+CypherParser::KU_StructLiteralContext* CypherParser::OC_LiteralContext::kU_StructLiteral() {
+  return getRuleContext<CypherParser::KU_StructLiteralContext>(0);
+}
+
+
+size_t CypherParser::OC_LiteralContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Literal;
+}
+
+
+CypherParser::OC_LiteralContext* CypherParser::oC_Literal() {
+  OC_LiteralContext *_localctx = _tracker.createInstance<OC_LiteralContext>(_ctx, getState());
+  enterRule(_localctx, 298, CypherParser::RuleOC_Literal);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2555);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::DecimalInteger:
+      case CypherParser::ExponentDecimalReal:
+      case CypherParser::RegularDecimalReal: {
+        enterOuterAlt(_localctx, 1);
+        setState(2549);
+        oC_NumberLiteral();
+        break;
+      }
+
+      case CypherParser::StringLiteral: {
+        enterOuterAlt(_localctx, 2);
+        setState(2550);
+        match(CypherParser::StringLiteral);
+        break;
+      }
+
+      case CypherParser::FALSE:
+      case CypherParser::TRUE: {
+        enterOuterAlt(_localctx, 3);
+        setState(2551);
+        oC_BooleanLiteral();
+        break;
+      }
+
+      case CypherParser::NULL_: {
+        enterOuterAlt(_localctx, 4);
+        setState(2552);
+        match(CypherParser::NULL_);
+        break;
+      }
+
+      case CypherParser::T__6: {
+        enterOuterAlt(_localctx, 5);
+        setState(2553);
+        oC_ListLiteral();
+        break;
+      }
+
+      case CypherParser::T__8: {
+        enterOuterAlt(_localctx, 6);
+        setState(2554);
+        kU_StructLiteral();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_BooleanLiteralContext ------------------------------------------------------------------
+
+CypherParser::OC_BooleanLiteralContext::OC_BooleanLiteralContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_BooleanLiteralContext::TRUE() {
+  return getToken(CypherParser::TRUE, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_BooleanLiteralContext::FALSE() {
+  return getToken(CypherParser::FALSE, 0);
+}
+
+
+size_t CypherParser::OC_BooleanLiteralContext::getRuleIndex() const {
+  return CypherParser::RuleOC_BooleanLiteral;
+}
+
+
+CypherParser::OC_BooleanLiteralContext* CypherParser::oC_BooleanLiteral() {
+  OC_BooleanLiteralContext *_localctx = _tracker.createInstance<OC_BooleanLiteralContext>(_ctx, getState());
+  enterRule(_localctx, 300, CypherParser::RuleOC_BooleanLiteral);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2557);
+    _la = _input->LA(1);
+    if (!(_la == CypherParser::FALSE
+
+    || _la == CypherParser::TRUE)) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ListLiteralContext ------------------------------------------------------------------
+
+CypherParser::OC_ListLiteralContext::OC_ListLiteralContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_ListLiteralContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_ListLiteralContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_ListLiteralContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+std::vector<CypherParser::KU_ListEntryContext *> CypherParser::OC_ListLiteralContext::kU_ListEntry() {
+  return getRuleContexts<CypherParser::KU_ListEntryContext>();
+}
+
+CypherParser::KU_ListEntryContext* CypherParser::OC_ListLiteralContext::kU_ListEntry(size_t i) {
+  return getRuleContext<CypherParser::KU_ListEntryContext>(i);
+}
+
+
+size_t CypherParser::OC_ListLiteralContext::getRuleIndex() const {
+  return CypherParser::RuleOC_ListLiteral;
+}
+
+
+CypherParser::OC_ListLiteralContext* CypherParser::oC_ListLiteral() {
+  OC_ListLiteralContext *_localctx = _tracker.createInstance<OC_ListLiteralContext>(_ctx, getState());
+  enterRule(_localctx, 302, CypherParser::RuleOC_ListLiteral);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2559);
+    match(CypherParser::T__6);
+    setState(2561);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2560);
+      match(CypherParser::SP);
+    }
+    setState(2576);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if ((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & -2320550076713270652) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 65)) & -286014905805559497) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 130)) & 5492410606132523) != 0)) {
+      setState(2563);
+      oC_Expression();
+      setState(2565);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2564);
+        match(CypherParser::SP);
+      }
+      setState(2573);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+      while (_la == CypherParser::T__3) {
+        setState(2567);
+        kU_ListEntry();
+        setState(2569);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2568);
+          match(CypherParser::SP);
+        }
+        setState(2575);
+        _errHandler->sync(this);
+        _la = _input->LA(1);
+      }
+    }
+    setState(2578);
+    match(CypherParser::T__7);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_ListEntryContext ------------------------------------------------------------------
+
+CypherParser::KU_ListEntryContext::KU_ListEntryContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_ListEntryContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::KU_ListEntryContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+
+size_t CypherParser::KU_ListEntryContext::getRuleIndex() const {
+  return CypherParser::RuleKU_ListEntry;
+}
+
+
+CypherParser::KU_ListEntryContext* CypherParser::kU_ListEntry() {
+  KU_ListEntryContext *_localctx = _tracker.createInstance<KU_ListEntryContext>(_ctx, getState());
+  enterRule(_localctx, 304, CypherParser::RuleKU_ListEntry);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2580);
+    match(CypherParser::T__3);
+    setState(2582);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 421, _ctx)) {
+    case 1: {
+      setState(2581);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2585);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if ((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & -2320550076713270652) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 65)) & -286014905805559497) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 130)) & 5492410606132523) != 0)) {
+      setState(2584);
+      oC_Expression();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_StructLiteralContext ------------------------------------------------------------------
+
+CypherParser::KU_StructLiteralContext::KU_StructLiteralContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::KU_StructFieldContext *> CypherParser::KU_StructLiteralContext::kU_StructField() {
+  return getRuleContexts<CypherParser::KU_StructFieldContext>();
+}
+
+CypherParser::KU_StructFieldContext* CypherParser::KU_StructLiteralContext::kU_StructField(size_t i) {
+  return getRuleContext<CypherParser::KU_StructFieldContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_StructLiteralContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_StructLiteralContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_StructLiteralContext::getRuleIndex() const {
+  return CypherParser::RuleKU_StructLiteral;
+}
+
+
+CypherParser::KU_StructLiteralContext* CypherParser::kU_StructLiteral() {
+  KU_StructLiteralContext *_localctx = _tracker.createInstance<KU_StructLiteralContext>(_ctx, getState());
+  enterRule(_localctx, 306, CypherParser::RuleKU_StructLiteral);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2587);
+    match(CypherParser::T__8);
+    setState(2589);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2588);
+      match(CypherParser::SP);
+    }
+    setState(2591);
+    kU_StructField();
+    setState(2593);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2592);
+      match(CypherParser::SP);
+    }
+    setState(2605);
+    _errHandler->sync(this);
+    _la = _input->LA(1);
+    while (_la == CypherParser::T__3) {
+      setState(2595);
+      match(CypherParser::T__3);
+      setState(2597);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2596);
+        match(CypherParser::SP);
+      }
+      setState(2599);
+      kU_StructField();
+      setState(2601);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2600);
+        match(CypherParser::SP);
+      }
+      setState(2607);
+      _errHandler->sync(this);
+      _la = _input->LA(1);
+    }
+    setState(2608);
+    match(CypherParser::T__9);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_StructFieldContext ------------------------------------------------------------------
+
+CypherParser::KU_StructFieldContext::KU_StructFieldContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_StructFieldContext::COLON() {
+  return getToken(CypherParser::COLON, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::KU_StructFieldContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_StructFieldContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_StructFieldContext::StringLiteral() {
+  return getToken(CypherParser::StringLiteral, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_StructFieldContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_StructFieldContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_StructFieldContext::getRuleIndex() const {
+  return CypherParser::RuleKU_StructField;
+}
+
+
+CypherParser::KU_StructFieldContext* CypherParser::kU_StructField() {
+  KU_StructFieldContext *_localctx = _tracker.createInstance<KU_StructFieldContext>(_ctx, getState());
+  enterRule(_localctx, 308, CypherParser::RuleKU_StructField);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2612);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::ADD:
+      case CypherParser::ALTER:
+      case CypherParser::AS:
+      case CypherParser::ATTACH:
+      case CypherParser::BEGIN:
+      case CypherParser::BY:
+      case CypherParser::CALL:
+      case CypherParser::CHECKPOINT:
+      case CypherParser::COMMENT:
+      case CypherParser::COMMIT:
+      case CypherParser::CONTAINS:
+      case CypherParser::COPY:
+      case CypherParser::COUNT:
+      case CypherParser::CYCLE:
+      case CypherParser::DATABASE:
+      case CypherParser::DELETE:
+      case CypherParser::DETACH:
+      case CypherParser::DROP:
+      case CypherParser::EXPLAIN:
+      case CypherParser::EXPORT:
+      case CypherParser::EXTENSION:
+      case CypherParser::FROM:
+      case CypherParser::FORCE:
+      case CypherParser::GRAPH:
+      case CypherParser::IMPORT:
+      case CypherParser::IF:
+      case CypherParser::INCREMENT:
+      case CypherParser::IS:
+      case CypherParser::KEY:
+      case CypherParser::LIMIT:
+      case CypherParser::LOAD:
+      case CypherParser::LOGICAL:
+      case CypherParser::MATCH:
+      case CypherParser::MAXVALUE:
+      case CypherParser::MERGE:
+      case CypherParser::MINVALUE:
+      case CypherParser::NO:
+      case CypherParser::NODE:
+      case CypherParser::PROJECT:
+      case CypherParser::READ:
+      case CypherParser::REL:
+      case CypherParser::RENAME:
+      case CypherParser::RETURN:
+      case CypherParser::ROLLBACK:
+      case CypherParser::SEQUENCE:
+      case CypherParser::SET:
+      case CypherParser::START:
+      case CypherParser::STRUCT:
+      case CypherParser::TO:
+      case CypherParser::TRANSACTION:
+      case CypherParser::TYPE:
+      case CypherParser::UNINSTALL:
+      case CypherParser::UPDATE:
+      case CypherParser::USE:
+      case CypherParser::WRITE:
+      case CypherParser::YIELD:
+      case CypherParser::USER:
+      case CypherParser::PASSWORD:
+      case CypherParser::ROLE:
+      case CypherParser::MAP:
+      case CypherParser::DECIMAL:
+      case CypherParser::L_SKIP:
+      case CypherParser::HexLetter:
+      case CypherParser::UnescapedSymbolicName:
+      case CypherParser::EscapedSymbolicName: {
+        setState(2610);
+        oC_SymbolicName();
+        break;
+      }
+
+      case CypherParser::StringLiteral: {
+        setState(2611);
+        match(CypherParser::StringLiteral);
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+    setState(2615);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2614);
+      match(CypherParser::SP);
+    }
+    setState(2617);
+    match(CypherParser::COLON);
+    setState(2619);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2618);
+      match(CypherParser::SP);
+    }
+    setState(2621);
+    oC_Expression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ParenthesizedExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_ParenthesizedExpressionContext::OC_ParenthesizedExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_ParenthesizedExpressionContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_ParenthesizedExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_ParenthesizedExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_ParenthesizedExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_ParenthesizedExpression;
+}
+
+
+CypherParser::OC_ParenthesizedExpressionContext* CypherParser::oC_ParenthesizedExpression() {
+  OC_ParenthesizedExpressionContext *_localctx = _tracker.createInstance<OC_ParenthesizedExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 310, CypherParser::RuleOC_ParenthesizedExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2623);
+    match(CypherParser::T__1);
+    setState(2625);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2624);
+      match(CypherParser::SP);
+    }
+    setState(2627);
+    oC_Expression();
+    setState(2629);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2628);
+      match(CypherParser::SP);
+    }
+    setState(2631);
+    match(CypherParser::T__2);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_FunctionInvocationContext ------------------------------------------------------------------
+
+CypherParser::OC_FunctionInvocationContext::OC_FunctionInvocationContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_FunctionInvocationContext::COUNT() {
+  return getToken(CypherParser::COUNT, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_FunctionInvocationContext::STAR() {
+  return getToken(CypherParser::STAR, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_FunctionInvocationContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_FunctionInvocationContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_FunctionInvocationContext::CAST() {
+  return getToken(CypherParser::CAST, 0);
+}
+
+std::vector<CypherParser::KU_FunctionParameterContext *> CypherParser::OC_FunctionInvocationContext::kU_FunctionParameter() {
+  return getRuleContexts<CypherParser::KU_FunctionParameterContext>();
+}
+
+CypherParser::KU_FunctionParameterContext* CypherParser::OC_FunctionInvocationContext::kU_FunctionParameter(size_t i) {
+  return getRuleContext<CypherParser::KU_FunctionParameterContext>(i);
+}
+
+tree::TerminalNode* CypherParser::OC_FunctionInvocationContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+CypherParser::KU_DataTypeContext* CypherParser::OC_FunctionInvocationContext::kU_DataType() {
+  return getRuleContext<CypherParser::KU_DataTypeContext>(0);
+}
+
+CypherParser::OC_FunctionNameContext* CypherParser::OC_FunctionInvocationContext::oC_FunctionName() {
+  return getRuleContext<CypherParser::OC_FunctionNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_FunctionInvocationContext::DISTINCT() {
+  return getToken(CypherParser::DISTINCT, 0);
+}
+
+
+size_t CypherParser::OC_FunctionInvocationContext::getRuleIndex() const {
+  return CypherParser::RuleOC_FunctionInvocation;
+}
+
+
+CypherParser::OC_FunctionInvocationContext* CypherParser::oC_FunctionInvocation() {
+  OC_FunctionInvocationContext *_localctx = _tracker.createInstance<OC_FunctionInvocationContext>(_ctx, getState());
+  enterRule(_localctx, 312, CypherParser::RuleOC_FunctionInvocation);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2710);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 452, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(2633);
+      match(CypherParser::COUNT);
+      setState(2635);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2634);
+        match(CypherParser::SP);
+      }
+      setState(2637);
+      match(CypherParser::T__1);
+      setState(2639);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2638);
+        match(CypherParser::SP);
+      }
+      setState(2641);
+      match(CypherParser::STAR);
+      setState(2643);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2642);
+        match(CypherParser::SP);
+      }
+      setState(2645);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(2646);
+      match(CypherParser::CAST);
+      setState(2648);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2647);
+        match(CypherParser::SP);
+      }
+      setState(2650);
+      match(CypherParser::T__1);
+      setState(2652);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2651);
+        match(CypherParser::SP);
+      }
+      setState(2654);
+      kU_FunctionParameter();
+      setState(2656);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2655);
+        match(CypherParser::SP);
+      }
+      setState(2668);
+      _errHandler->sync(this);
+      switch (_input->LA(1)) {
+        case CypherParser::AS: {
+          setState(2658);
+          match(CypherParser::AS);
+          setState(2660);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(2659);
+            match(CypherParser::SP);
+          }
+          setState(2662);
+          kU_DataType(0);
+          break;
+        }
+
+        case CypherParser::T__3: {
+          setState(2663);
+          match(CypherParser::T__3);
+          setState(2665);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(2664);
+            match(CypherParser::SP);
+          }
+          setState(2667);
+          kU_FunctionParameter();
+          break;
+        }
+
+      default:
+        throw NoViableAltException(this);
+      }
+      setState(2671);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2670);
+        match(CypherParser::SP);
+      }
+      setState(2673);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    case 3: {
+      enterOuterAlt(_localctx, 3);
+      setState(2675);
+      oC_FunctionName();
+      setState(2677);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2676);
+        match(CypherParser::SP);
+      }
+      setState(2679);
+      match(CypherParser::T__1);
+      setState(2681);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2680);
+        match(CypherParser::SP);
+      }
+      setState(2687);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::DISTINCT) {
+        setState(2683);
+        match(CypherParser::DISTINCT);
+        setState(2685);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2684);
+          match(CypherParser::SP);
+        }
+      }
+      setState(2706);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if ((((_la & ~ 0x3fULL) == 0) &&
+        ((1ULL << _la) & -2320550076713270652) != 0) || ((((_la - 65) & ~ 0x3fULL) == 0) &&
+        ((1ULL << (_la - 65)) & -286014905805559497) != 0) || ((((_la - 130) & ~ 0x3fULL) == 0) &&
+        ((1ULL << (_la - 130)) & 5492410606132523) != 0)) {
+        setState(2689);
+        kU_FunctionParameter();
+        setState(2691);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2690);
+          match(CypherParser::SP);
+        }
+        setState(2703);
+        _errHandler->sync(this);
+        _la = _input->LA(1);
+        while (_la == CypherParser::T__3) {
+          setState(2693);
+          match(CypherParser::T__3);
+          setState(2695);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(2694);
+            match(CypherParser::SP);
+          }
+          setState(2697);
+          kU_FunctionParameter();
+          setState(2699);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(2698);
+            match(CypherParser::SP);
+          }
+          setState(2705);
+          _errHandler->sync(this);
+          _la = _input->LA(1);
+        }
+      }
+      setState(2708);
+      match(CypherParser::T__2);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_FunctionNameContext ------------------------------------------------------------------
+
+CypherParser::OC_FunctionNameContext::OC_FunctionNameContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::OC_FunctionNameContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+
+size_t CypherParser::OC_FunctionNameContext::getRuleIndex() const {
+  return CypherParser::RuleOC_FunctionName;
+}
+
+
+CypherParser::OC_FunctionNameContext* CypherParser::oC_FunctionName() {
+  OC_FunctionNameContext *_localctx = _tracker.createInstance<OC_FunctionNameContext>(_ctx, getState());
+  enterRule(_localctx, 314, CypherParser::RuleOC_FunctionName);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2712);
+    oC_SymbolicName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_FunctionParameterContext ------------------------------------------------------------------
+
+CypherParser::KU_FunctionParameterContext::KU_FunctionParameterContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::KU_FunctionParameterContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_FunctionParameterContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_FunctionParameterContext::COLON() {
+  return getToken(CypherParser::COLON, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_FunctionParameterContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_FunctionParameterContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::KU_LambdaParameterContext* CypherParser::KU_FunctionParameterContext::kU_LambdaParameter() {
+  return getRuleContext<CypherParser::KU_LambdaParameterContext>(0);
+}
+
+
+size_t CypherParser::KU_FunctionParameterContext::getRuleIndex() const {
+  return CypherParser::RuleKU_FunctionParameter;
+}
+
+
+CypherParser::KU_FunctionParameterContext* CypherParser::kU_FunctionParameter() {
+  KU_FunctionParameterContext *_localctx = _tracker.createInstance<KU_FunctionParameterContext>(_ctx, getState());
+  enterRule(_localctx, 316, CypherParser::RuleKU_FunctionParameter);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2727);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 456, _ctx)) {
+    case 1: {
+      enterOuterAlt(_localctx, 1);
+      setState(2723);
+      _errHandler->sync(this);
+
+      switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 455, _ctx)) {
+      case 1: {
+        setState(2714);
+        oC_SymbolicName();
+        setState(2716);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2715);
+          match(CypherParser::SP);
+        }
+        setState(2718);
+        match(CypherParser::COLON);
+        setState(2719);
+        match(CypherParser::T__5);
+        setState(2721);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2720);
+          match(CypherParser::SP);
+        }
+        break;
+      }
+
+      default:
+        break;
+      }
+      setState(2725);
+      oC_Expression();
+      break;
+    }
+
+    case 2: {
+      enterOuterAlt(_localctx, 2);
+      setState(2726);
+      kU_LambdaParameter();
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_LambdaParameterContext ------------------------------------------------------------------
+
+CypherParser::KU_LambdaParameterContext::KU_LambdaParameterContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::KU_LambdaVarsContext* CypherParser::KU_LambdaParameterContext::kU_LambdaVars() {
+  return getRuleContext<CypherParser::KU_LambdaVarsContext>(0);
+}
+
+tree::TerminalNode* CypherParser::KU_LambdaParameterContext::MINUS() {
+  return getToken(CypherParser::MINUS, 0);
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::KU_LambdaParameterContext::oC_Expression() {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_LambdaParameterContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_LambdaParameterContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_LambdaParameterContext::getRuleIndex() const {
+  return CypherParser::RuleKU_LambdaParameter;
+}
+
+
+CypherParser::KU_LambdaParameterContext* CypherParser::kU_LambdaParameter() {
+  KU_LambdaParameterContext *_localctx = _tracker.createInstance<KU_LambdaParameterContext>(_ctx, getState());
+  enterRule(_localctx, 318, CypherParser::RuleKU_LambdaParameter);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2729);
+    kU_LambdaVars();
+    setState(2731);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2730);
+      match(CypherParser::SP);
+    }
+    setState(2733);
+    match(CypherParser::MINUS);
+    setState(2734);
+    match(CypherParser::T__14);
+    setState(2736);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2735);
+      match(CypherParser::SP);
+    }
+    setState(2738);
+    oC_Expression();
+    setState(2740);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 459, _ctx)) {
+    case 1: {
+      setState(2739);
+      match(CypherParser::SP);
+      break;
+    }
+
+    default:
+      break;
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_LambdaVarsContext ------------------------------------------------------------------
+
+CypherParser::KU_LambdaVarsContext::KU_LambdaVarsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+std::vector<CypherParser::OC_SymbolicNameContext *> CypherParser::KU_LambdaVarsContext::oC_SymbolicName() {
+  return getRuleContexts<CypherParser::OC_SymbolicNameContext>();
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::KU_LambdaVarsContext::oC_SymbolicName(size_t i) {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::KU_LambdaVarsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::KU_LambdaVarsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::KU_LambdaVarsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_LambdaVars;
+}
+
+
+CypherParser::KU_LambdaVarsContext* CypherParser::kU_LambdaVars() {
+  KU_LambdaVarsContext *_localctx = _tracker.createInstance<KU_LambdaVarsContext>(_ctx, getState());
+  enterRule(_localctx, 320, CypherParser::RuleKU_LambdaVars);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2766);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::ADD:
+      case CypherParser::ALTER:
+      case CypherParser::AS:
+      case CypherParser::ATTACH:
+      case CypherParser::BEGIN:
+      case CypherParser::BY:
+      case CypherParser::CALL:
+      case CypherParser::CHECKPOINT:
+      case CypherParser::COMMENT:
+      case CypherParser::COMMIT:
+      case CypherParser::CONTAINS:
+      case CypherParser::COPY:
+      case CypherParser::COUNT:
+      case CypherParser::CYCLE:
+      case CypherParser::DATABASE:
+      case CypherParser::DELETE:
+      case CypherParser::DETACH:
+      case CypherParser::DROP:
+      case CypherParser::EXPLAIN:
+      case CypherParser::EXPORT:
+      case CypherParser::EXTENSION:
+      case CypherParser::FROM:
+      case CypherParser::FORCE:
+      case CypherParser::GRAPH:
+      case CypherParser::IMPORT:
+      case CypherParser::IF:
+      case CypherParser::INCREMENT:
+      case CypherParser::IS:
+      case CypherParser::KEY:
+      case CypherParser::LIMIT:
+      case CypherParser::LOAD:
+      case CypherParser::LOGICAL:
+      case CypherParser::MATCH:
+      case CypherParser::MAXVALUE:
+      case CypherParser::MERGE:
+      case CypherParser::MINVALUE:
+      case CypherParser::NO:
+      case CypherParser::NODE:
+      case CypherParser::PROJECT:
+      case CypherParser::READ:
+      case CypherParser::REL:
+      case CypherParser::RENAME:
+      case CypherParser::RETURN:
+      case CypherParser::ROLLBACK:
+      case CypherParser::SEQUENCE:
+      case CypherParser::SET:
+      case CypherParser::START:
+      case CypherParser::STRUCT:
+      case CypherParser::TO:
+      case CypherParser::TRANSACTION:
+      case CypherParser::TYPE:
+      case CypherParser::UNINSTALL:
+      case CypherParser::UPDATE:
+      case CypherParser::USE:
+      case CypherParser::WRITE:
+      case CypherParser::YIELD:
+      case CypherParser::USER:
+      case CypherParser::PASSWORD:
+      case CypherParser::ROLE:
+      case CypherParser::MAP:
+      case CypherParser::DECIMAL:
+      case CypherParser::L_SKIP:
+      case CypherParser::HexLetter:
+      case CypherParser::UnescapedSymbolicName:
+      case CypherParser::EscapedSymbolicName: {
+        enterOuterAlt(_localctx, 1);
+        setState(2742);
+        oC_SymbolicName();
+        break;
+      }
+
+      case CypherParser::T__1: {
+        enterOuterAlt(_localctx, 2);
+        setState(2743);
+        match(CypherParser::T__1);
+        setState(2745);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2744);
+          match(CypherParser::SP);
+        }
+        setState(2747);
+        oC_SymbolicName();
+        setState(2749);
+        _errHandler->sync(this);
+
+        _la = _input->LA(1);
+        if (_la == CypherParser::SP) {
+          setState(2748);
+          match(CypherParser::SP);
+        }
+        setState(2761);
+        _errHandler->sync(this);
+        _la = _input->LA(1);
+        while (_la == CypherParser::T__3) {
+          setState(2751);
+          match(CypherParser::T__3);
+          setState(2753);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(2752);
+            match(CypherParser::SP);
+          }
+          setState(2755);
+          oC_SymbolicName();
+          setState(2757);
+          _errHandler->sync(this);
+
+          _la = _input->LA(1);
+          if (_la == CypherParser::SP) {
+            setState(2756);
+            match(CypherParser::SP);
+          }
+          setState(2763);
+          _errHandler->sync(this);
+          _la = _input->LA(1);
+        }
+        setState(2764);
+        match(CypherParser::T__2);
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PathPatternsContext ------------------------------------------------------------------
+
+CypherParser::OC_PathPatternsContext::OC_PathPatternsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_NodePatternContext* CypherParser::OC_PathPatternsContext::oC_NodePattern() {
+  return getRuleContext<CypherParser::OC_NodePatternContext>(0);
+}
+
+std::vector<CypherParser::OC_PatternElementChainContext *> CypherParser::OC_PathPatternsContext::oC_PatternElementChain() {
+  return getRuleContexts<CypherParser::OC_PatternElementChainContext>();
+}
+
+CypherParser::OC_PatternElementChainContext* CypherParser::OC_PathPatternsContext::oC_PatternElementChain(size_t i) {
+  return getRuleContext<CypherParser::OC_PatternElementChainContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_PathPatternsContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_PathPatternsContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_PathPatternsContext::getRuleIndex() const {
+  return CypherParser::RuleOC_PathPatterns;
+}
+
+
+CypherParser::OC_PathPatternsContext* CypherParser::oC_PathPatterns() {
+  OC_PathPatternsContext *_localctx = _tracker.createInstance<OC_PathPatternsContext>(_ctx, getState());
+  enterRule(_localctx, 322, CypherParser::RuleOC_PathPatterns);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2768);
+    oC_NodePattern();
+    setState(2773); 
+    _errHandler->sync(this);
+    alt = 1;
+    do {
+      switch (alt) {
+        case 1: {
+              setState(2770);
+              _errHandler->sync(this);
+
+              _la = _input->LA(1);
+              if (_la == CypherParser::SP) {
+                setState(2769);
+                match(CypherParser::SP);
+              }
+              setState(2772);
+              oC_PatternElementChain();
+              break;
+            }
+
+      default:
+        throw NoViableAltException(this);
+      }
+      setState(2775); 
+      _errHandler->sync(this);
+      alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 467, _ctx);
+    } while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ExistCountSubqueryContext ------------------------------------------------------------------
+
+CypherParser::OC_ExistCountSubqueryContext::OC_ExistCountSubqueryContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_ExistCountSubqueryContext::MATCH() {
+  return getToken(CypherParser::MATCH, 0);
+}
+
+CypherParser::OC_PatternContext* CypherParser::OC_ExistCountSubqueryContext::oC_Pattern() {
+  return getRuleContext<CypherParser::OC_PatternContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_ExistCountSubqueryContext::EXISTS() {
+  return getToken(CypherParser::EXISTS, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_ExistCountSubqueryContext::COUNT() {
+  return getToken(CypherParser::COUNT, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_ExistCountSubqueryContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_ExistCountSubqueryContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+CypherParser::OC_WhereContext* CypherParser::OC_ExistCountSubqueryContext::oC_Where() {
+  return getRuleContext<CypherParser::OC_WhereContext>(0);
+}
+
+CypherParser::KU_HintContext* CypherParser::OC_ExistCountSubqueryContext::kU_Hint() {
+  return getRuleContext<CypherParser::KU_HintContext>(0);
+}
+
+
+size_t CypherParser::OC_ExistCountSubqueryContext::getRuleIndex() const {
+  return CypherParser::RuleOC_ExistCountSubquery;
+}
+
+
+CypherParser::OC_ExistCountSubqueryContext* CypherParser::oC_ExistCountSubquery() {
+  OC_ExistCountSubqueryContext *_localctx = _tracker.createInstance<OC_ExistCountSubqueryContext>(_ctx, getState());
+  enterRule(_localctx, 324, CypherParser::RuleOC_ExistCountSubquery);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2777);
+    _la = _input->LA(1);
+    if (!(_la == CypherParser::COUNT
+
+    || _la == CypherParser::EXISTS)) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+    setState(2779);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2778);
+      match(CypherParser::SP);
+    }
+    setState(2781);
+    match(CypherParser::T__8);
+    setState(2783);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2782);
+      match(CypherParser::SP);
+    }
+    setState(2785);
+    match(CypherParser::MATCH);
+    setState(2787);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2786);
+      match(CypherParser::SP);
+    }
+    setState(2789);
+    oC_Pattern();
+    setState(2794);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 472, _ctx)) {
+    case 1: {
+      setState(2791);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2790);
+        match(CypherParser::SP);
+      }
+      setState(2793);
+      oC_Where();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2800);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 474, _ctx)) {
+    case 1: {
+      setState(2797);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2796);
+        match(CypherParser::SP);
+      }
+      setState(2799);
+      kU_Hint();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2803);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2802);
+      match(CypherParser::SP);
+    }
+    setState(2805);
+    match(CypherParser::T__9);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PropertyLookupContext ------------------------------------------------------------------
+
+CypherParser::OC_PropertyLookupContext::OC_PropertyLookupContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_PropertyKeyNameContext* CypherParser::OC_PropertyLookupContext::oC_PropertyKeyName() {
+  return getRuleContext<CypherParser::OC_PropertyKeyNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_PropertyLookupContext::STAR() {
+  return getToken(CypherParser::STAR, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_PropertyLookupContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+
+size_t CypherParser::OC_PropertyLookupContext::getRuleIndex() const {
+  return CypherParser::RuleOC_PropertyLookup;
+}
+
+
+CypherParser::OC_PropertyLookupContext* CypherParser::oC_PropertyLookup() {
+  OC_PropertyLookupContext *_localctx = _tracker.createInstance<OC_PropertyLookupContext>(_ctx, getState());
+  enterRule(_localctx, 326, CypherParser::RuleOC_PropertyLookup);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2807);
+    match(CypherParser::T__4);
+    setState(2809);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2808);
+      match(CypherParser::SP);
+    }
+    setState(2813);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::ADD:
+      case CypherParser::ALTER:
+      case CypherParser::AS:
+      case CypherParser::ATTACH:
+      case CypherParser::BEGIN:
+      case CypherParser::BY:
+      case CypherParser::CALL:
+      case CypherParser::CHECKPOINT:
+      case CypherParser::COMMENT:
+      case CypherParser::COMMIT:
+      case CypherParser::CONTAINS:
+      case CypherParser::COPY:
+      case CypherParser::COUNT:
+      case CypherParser::CYCLE:
+      case CypherParser::DATABASE:
+      case CypherParser::DELETE:
+      case CypherParser::DETACH:
+      case CypherParser::DROP:
+      case CypherParser::EXPLAIN:
+      case CypherParser::EXPORT:
+      case CypherParser::EXTENSION:
+      case CypherParser::FROM:
+      case CypherParser::FORCE:
+      case CypherParser::GRAPH:
+      case CypherParser::IMPORT:
+      case CypherParser::IF:
+      case CypherParser::INCREMENT:
+      case CypherParser::IS:
+      case CypherParser::KEY:
+      case CypherParser::LIMIT:
+      case CypherParser::LOAD:
+      case CypherParser::LOGICAL:
+      case CypherParser::MATCH:
+      case CypherParser::MAXVALUE:
+      case CypherParser::MERGE:
+      case CypherParser::MINVALUE:
+      case CypherParser::NO:
+      case CypherParser::NODE:
+      case CypherParser::PROJECT:
+      case CypherParser::READ:
+      case CypherParser::REL:
+      case CypherParser::RENAME:
+      case CypherParser::RETURN:
+      case CypherParser::ROLLBACK:
+      case CypherParser::SEQUENCE:
+      case CypherParser::SET:
+      case CypherParser::START:
+      case CypherParser::STRUCT:
+      case CypherParser::TO:
+      case CypherParser::TRANSACTION:
+      case CypherParser::TYPE:
+      case CypherParser::UNINSTALL:
+      case CypherParser::UPDATE:
+      case CypherParser::USE:
+      case CypherParser::WRITE:
+      case CypherParser::YIELD:
+      case CypherParser::USER:
+      case CypherParser::PASSWORD:
+      case CypherParser::ROLE:
+      case CypherParser::MAP:
+      case CypherParser::DECIMAL:
+      case CypherParser::L_SKIP:
+      case CypherParser::HexLetter:
+      case CypherParser::UnescapedSymbolicName:
+      case CypherParser::EscapedSymbolicName: {
+        setState(2811);
+        oC_PropertyKeyName();
+        break;
+      }
+
+      case CypherParser::STAR: {
+        setState(2812);
+        match(CypherParser::STAR);
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_CaseExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_CaseExpressionContext::OC_CaseExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_CaseExpressionContext::END() {
+  return getToken(CypherParser::END, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_CaseExpressionContext::ELSE() {
+  return getToken(CypherParser::ELSE, 0);
+}
+
+std::vector<CypherParser::OC_ExpressionContext *> CypherParser::OC_CaseExpressionContext::oC_Expression() {
+  return getRuleContexts<CypherParser::OC_ExpressionContext>();
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_CaseExpressionContext::oC_Expression(size_t i) {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(i);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_CaseExpressionContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_CaseExpressionContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+tree::TerminalNode* CypherParser::OC_CaseExpressionContext::CASE() {
+  return getToken(CypherParser::CASE, 0);
+}
+
+std::vector<CypherParser::OC_CaseAlternativeContext *> CypherParser::OC_CaseExpressionContext::oC_CaseAlternative() {
+  return getRuleContexts<CypherParser::OC_CaseAlternativeContext>();
+}
+
+CypherParser::OC_CaseAlternativeContext* CypherParser::OC_CaseExpressionContext::oC_CaseAlternative(size_t i) {
+  return getRuleContext<CypherParser::OC_CaseAlternativeContext>(i);
+}
+
+
+size_t CypherParser::OC_CaseExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_CaseExpression;
+}
+
+
+CypherParser::OC_CaseExpressionContext* CypherParser::oC_CaseExpression() {
+  OC_CaseExpressionContext *_localctx = _tracker.createInstance<OC_CaseExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 328, CypherParser::RuleOC_CaseExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    size_t alt;
+    enterOuterAlt(_localctx, 1);
+    setState(2837);
+    _errHandler->sync(this);
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 483, _ctx)) {
+    case 1: {
+      setState(2815);
+      match(CypherParser::CASE);
+      setState(2820); 
+      _errHandler->sync(this);
+      alt = 1;
+      do {
+        switch (alt) {
+          case 1: {
+                setState(2817);
+                _errHandler->sync(this);
+
+                _la = _input->LA(1);
+                if (_la == CypherParser::SP) {
+                  setState(2816);
+                  match(CypherParser::SP);
+                }
+                setState(2819);
+                oC_CaseAlternative();
+                break;
+              }
+
+        default:
+          throw NoViableAltException(this);
+        }
+        setState(2822); 
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 479, _ctx);
+      } while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER);
+      break;
+    }
+
+    case 2: {
+      setState(2824);
+      match(CypherParser::CASE);
+      setState(2826);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2825);
+        match(CypherParser::SP);
+      }
+      setState(2828);
+      oC_Expression();
+      setState(2833); 
+      _errHandler->sync(this);
+      alt = 1;
+      do {
+        switch (alt) {
+          case 1: {
+                setState(2830);
+                _errHandler->sync(this);
+
+                _la = _input->LA(1);
+                if (_la == CypherParser::SP) {
+                  setState(2829);
+                  match(CypherParser::SP);
+                }
+                setState(2832);
+                oC_CaseAlternative();
+                break;
+              }
+
+        default:
+          throw NoViableAltException(this);
+        }
+        setState(2835); 
+        _errHandler->sync(this);
+        alt = getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 482, _ctx);
+      } while (alt != 2 && alt != atn::ATN::INVALID_ALT_NUMBER);
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2847);
+    _errHandler->sync(this);
+
+    switch (getInterpreter<atn::ParserATNSimulator>()->adaptivePredict(_input, 486, _ctx)) {
+    case 1: {
+      setState(2840);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2839);
+        match(CypherParser::SP);
+      }
+      setState(2842);
+      match(CypherParser::ELSE);
+      setState(2844);
+      _errHandler->sync(this);
+
+      _la = _input->LA(1);
+      if (_la == CypherParser::SP) {
+        setState(2843);
+        match(CypherParser::SP);
+      }
+      setState(2846);
+      oC_Expression();
+      break;
+    }
+
+    default:
+      break;
+    }
+    setState(2850);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2849);
+      match(CypherParser::SP);
+    }
+    setState(2852);
+    match(CypherParser::END);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_CaseAlternativeContext ------------------------------------------------------------------
+
+CypherParser::OC_CaseAlternativeContext::OC_CaseAlternativeContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_CaseAlternativeContext::WHEN() {
+  return getToken(CypherParser::WHEN, 0);
+}
+
+std::vector<CypherParser::OC_ExpressionContext *> CypherParser::OC_CaseAlternativeContext::oC_Expression() {
+  return getRuleContexts<CypherParser::OC_ExpressionContext>();
+}
+
+CypherParser::OC_ExpressionContext* CypherParser::OC_CaseAlternativeContext::oC_Expression(size_t i) {
+  return getRuleContext<CypherParser::OC_ExpressionContext>(i);
+}
+
+tree::TerminalNode* CypherParser::OC_CaseAlternativeContext::THEN() {
+  return getToken(CypherParser::THEN, 0);
+}
+
+std::vector<tree::TerminalNode *> CypherParser::OC_CaseAlternativeContext::SP() {
+  return getTokens(CypherParser::SP);
+}
+
+tree::TerminalNode* CypherParser::OC_CaseAlternativeContext::SP(size_t i) {
+  return getToken(CypherParser::SP, i);
+}
+
+
+size_t CypherParser::OC_CaseAlternativeContext::getRuleIndex() const {
+  return CypherParser::RuleOC_CaseAlternative;
+}
+
+
+CypherParser::OC_CaseAlternativeContext* CypherParser::oC_CaseAlternative() {
+  OC_CaseAlternativeContext *_localctx = _tracker.createInstance<OC_CaseAlternativeContext>(_ctx, getState());
+  enterRule(_localctx, 330, CypherParser::RuleOC_CaseAlternative);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2854);
+    match(CypherParser::WHEN);
+    setState(2856);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2855);
+      match(CypherParser::SP);
+    }
+    setState(2858);
+    oC_Expression();
+    setState(2860);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2859);
+      match(CypherParser::SP);
+    }
+    setState(2862);
+    match(CypherParser::THEN);
+    setState(2864);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2863);
+      match(CypherParser::SP);
+    }
+    setState(2866);
+    oC_Expression();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_VariableContext ------------------------------------------------------------------
+
+CypherParser::OC_VariableContext::OC_VariableContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::OC_VariableContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+
+size_t CypherParser::OC_VariableContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Variable;
+}
+
+
+CypherParser::OC_VariableContext* CypherParser::oC_Variable() {
+  OC_VariableContext *_localctx = _tracker.createInstance<OC_VariableContext>(_ctx, getState());
+  enterRule(_localctx, 332, CypherParser::RuleOC_Variable);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2868);
+    oC_SymbolicName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_NumberLiteralContext ------------------------------------------------------------------
+
+CypherParser::OC_NumberLiteralContext::OC_NumberLiteralContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_DoubleLiteralContext* CypherParser::OC_NumberLiteralContext::oC_DoubleLiteral() {
+  return getRuleContext<CypherParser::OC_DoubleLiteralContext>(0);
+}
+
+CypherParser::OC_IntegerLiteralContext* CypherParser::OC_NumberLiteralContext::oC_IntegerLiteral() {
+  return getRuleContext<CypherParser::OC_IntegerLiteralContext>(0);
+}
+
+
+size_t CypherParser::OC_NumberLiteralContext::getRuleIndex() const {
+  return CypherParser::RuleOC_NumberLiteral;
+}
+
+
+CypherParser::OC_NumberLiteralContext* CypherParser::oC_NumberLiteral() {
+  OC_NumberLiteralContext *_localctx = _tracker.createInstance<OC_NumberLiteralContext>(_ctx, getState());
+  enterRule(_localctx, 334, CypherParser::RuleOC_NumberLiteral);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2872);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::ExponentDecimalReal:
+      case CypherParser::RegularDecimalReal: {
+        enterOuterAlt(_localctx, 1);
+        setState(2870);
+        oC_DoubleLiteral();
+        break;
+      }
+
+      case CypherParser::DecimalInteger: {
+        enterOuterAlt(_localctx, 2);
+        setState(2871);
+        oC_IntegerLiteral();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_ParameterContext ------------------------------------------------------------------
+
+CypherParser::OC_ParameterContext::OC_ParameterContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::OC_ParameterContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_ParameterContext::DecimalInteger() {
+  return getToken(CypherParser::DecimalInteger, 0);
+}
+
+
+size_t CypherParser::OC_ParameterContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Parameter;
+}
+
+
+CypherParser::OC_ParameterContext* CypherParser::oC_Parameter() {
+  OC_ParameterContext *_localctx = _tracker.createInstance<OC_ParameterContext>(_ctx, getState());
+  enterRule(_localctx, 336, CypherParser::RuleOC_Parameter);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2874);
+    match(CypherParser::T__24);
+    setState(2877);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::ADD:
+      case CypherParser::ALTER:
+      case CypherParser::AS:
+      case CypherParser::ATTACH:
+      case CypherParser::BEGIN:
+      case CypherParser::BY:
+      case CypherParser::CALL:
+      case CypherParser::CHECKPOINT:
+      case CypherParser::COMMENT:
+      case CypherParser::COMMIT:
+      case CypherParser::CONTAINS:
+      case CypherParser::COPY:
+      case CypherParser::COUNT:
+      case CypherParser::CYCLE:
+      case CypherParser::DATABASE:
+      case CypherParser::DELETE:
+      case CypherParser::DETACH:
+      case CypherParser::DROP:
+      case CypherParser::EXPLAIN:
+      case CypherParser::EXPORT:
+      case CypherParser::EXTENSION:
+      case CypherParser::FROM:
+      case CypherParser::FORCE:
+      case CypherParser::GRAPH:
+      case CypherParser::IMPORT:
+      case CypherParser::IF:
+      case CypherParser::INCREMENT:
+      case CypherParser::IS:
+      case CypherParser::KEY:
+      case CypherParser::LIMIT:
+      case CypherParser::LOAD:
+      case CypherParser::LOGICAL:
+      case CypherParser::MATCH:
+      case CypherParser::MAXVALUE:
+      case CypherParser::MERGE:
+      case CypherParser::MINVALUE:
+      case CypherParser::NO:
+      case CypherParser::NODE:
+      case CypherParser::PROJECT:
+      case CypherParser::READ:
+      case CypherParser::REL:
+      case CypherParser::RENAME:
+      case CypherParser::RETURN:
+      case CypherParser::ROLLBACK:
+      case CypherParser::SEQUENCE:
+      case CypherParser::SET:
+      case CypherParser::START:
+      case CypherParser::STRUCT:
+      case CypherParser::TO:
+      case CypherParser::TRANSACTION:
+      case CypherParser::TYPE:
+      case CypherParser::UNINSTALL:
+      case CypherParser::UPDATE:
+      case CypherParser::USE:
+      case CypherParser::WRITE:
+      case CypherParser::YIELD:
+      case CypherParser::USER:
+      case CypherParser::PASSWORD:
+      case CypherParser::ROLE:
+      case CypherParser::MAP:
+      case CypherParser::DECIMAL:
+      case CypherParser::L_SKIP:
+      case CypherParser::HexLetter:
+      case CypherParser::UnescapedSymbolicName:
+      case CypherParser::EscapedSymbolicName: {
+        setState(2875);
+        oC_SymbolicName();
+        break;
+      }
+
+      case CypherParser::DecimalInteger: {
+        setState(2876);
+        match(CypherParser::DecimalInteger);
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PropertyExpressionContext ------------------------------------------------------------------
+
+CypherParser::OC_PropertyExpressionContext::OC_PropertyExpressionContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_AtomContext* CypherParser::OC_PropertyExpressionContext::oC_Atom() {
+  return getRuleContext<CypherParser::OC_AtomContext>(0);
+}
+
+CypherParser::OC_PropertyLookupContext* CypherParser::OC_PropertyExpressionContext::oC_PropertyLookup() {
+  return getRuleContext<CypherParser::OC_PropertyLookupContext>(0);
+}
+
+tree::TerminalNode* CypherParser::OC_PropertyExpressionContext::SP() {
+  return getToken(CypherParser::SP, 0);
+}
+
+
+size_t CypherParser::OC_PropertyExpressionContext::getRuleIndex() const {
+  return CypherParser::RuleOC_PropertyExpression;
+}
+
+
+CypherParser::OC_PropertyExpressionContext* CypherParser::oC_PropertyExpression() {
+  OC_PropertyExpressionContext *_localctx = _tracker.createInstance<OC_PropertyExpressionContext>(_ctx, getState());
+  enterRule(_localctx, 338, CypherParser::RuleOC_PropertyExpression);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2879);
+    oC_Atom();
+    setState(2881);
+    _errHandler->sync(this);
+
+    _la = _input->LA(1);
+    if (_la == CypherParser::SP) {
+      setState(2880);
+      match(CypherParser::SP);
+    }
+    setState(2883);
+    oC_PropertyLookup();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_PropertyKeyNameContext ------------------------------------------------------------------
+
+CypherParser::OC_PropertyKeyNameContext::OC_PropertyKeyNameContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SchemaNameContext* CypherParser::OC_PropertyKeyNameContext::oC_SchemaName() {
+  return getRuleContext<CypherParser::OC_SchemaNameContext>(0);
+}
+
+
+size_t CypherParser::OC_PropertyKeyNameContext::getRuleIndex() const {
+  return CypherParser::RuleOC_PropertyKeyName;
+}
+
+
+CypherParser::OC_PropertyKeyNameContext* CypherParser::oC_PropertyKeyName() {
+  OC_PropertyKeyNameContext *_localctx = _tracker.createInstance<OC_PropertyKeyNameContext>(_ctx, getState());
+  enterRule(_localctx, 340, CypherParser::RuleOC_PropertyKeyName);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2885);
+    oC_SchemaName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_IntegerLiteralContext ------------------------------------------------------------------
+
+CypherParser::OC_IntegerLiteralContext::OC_IntegerLiteralContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_IntegerLiteralContext::DecimalInteger() {
+  return getToken(CypherParser::DecimalInteger, 0);
+}
+
+
+size_t CypherParser::OC_IntegerLiteralContext::getRuleIndex() const {
+  return CypherParser::RuleOC_IntegerLiteral;
+}
+
+
+CypherParser::OC_IntegerLiteralContext* CypherParser::oC_IntegerLiteral() {
+  OC_IntegerLiteralContext *_localctx = _tracker.createInstance<OC_IntegerLiteralContext>(_ctx, getState());
+  enterRule(_localctx, 342, CypherParser::RuleOC_IntegerLiteral);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2887);
+    match(CypherParser::DecimalInteger);
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_DoubleLiteralContext ------------------------------------------------------------------
+
+CypherParser::OC_DoubleLiteralContext::OC_DoubleLiteralContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_DoubleLiteralContext::ExponentDecimalReal() {
+  return getToken(CypherParser::ExponentDecimalReal, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_DoubleLiteralContext::RegularDecimalReal() {
+  return getToken(CypherParser::RegularDecimalReal, 0);
+}
+
+
+size_t CypherParser::OC_DoubleLiteralContext::getRuleIndex() const {
+  return CypherParser::RuleOC_DoubleLiteral;
+}
+
+
+CypherParser::OC_DoubleLiteralContext* CypherParser::oC_DoubleLiteral() {
+  OC_DoubleLiteralContext *_localctx = _tracker.createInstance<OC_DoubleLiteralContext>(_ctx, getState());
+  enterRule(_localctx, 344, CypherParser::RuleOC_DoubleLiteral);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2889);
+    _la = _input->LA(1);
+    if (!(_la == CypherParser::ExponentDecimalReal
+
+    || _la == CypherParser::RegularDecimalReal)) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_SchemaNameContext ------------------------------------------------------------------
+
+CypherParser::OC_SchemaNameContext::OC_SchemaNameContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+CypherParser::OC_SymbolicNameContext* CypherParser::OC_SchemaNameContext::oC_SymbolicName() {
+  return getRuleContext<CypherParser::OC_SymbolicNameContext>(0);
+}
+
+
+size_t CypherParser::OC_SchemaNameContext::getRuleIndex() const {
+  return CypherParser::RuleOC_SchemaName;
+}
+
+
+CypherParser::OC_SchemaNameContext* CypherParser::oC_SchemaName() {
+  OC_SchemaNameContext *_localctx = _tracker.createInstance<OC_SchemaNameContext>(_ctx, getState());
+  enterRule(_localctx, 346, CypherParser::RuleOC_SchemaName);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2891);
+    oC_SymbolicName();
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_SymbolicNameContext ------------------------------------------------------------------
+
+CypherParser::OC_SymbolicNameContext::OC_SymbolicNameContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_SymbolicNameContext::UnescapedSymbolicName() {
+  return getToken(CypherParser::UnescapedSymbolicName, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_SymbolicNameContext::EscapedSymbolicName() {
+  return getToken(CypherParser::EscapedSymbolicName, 0);
+}
+
+tree::TerminalNode* CypherParser::OC_SymbolicNameContext::HexLetter() {
+  return getToken(CypherParser::HexLetter, 0);
+}
+
+CypherParser::KU_NonReservedKeywordsContext* CypherParser::OC_SymbolicNameContext::kU_NonReservedKeywords() {
+  return getRuleContext<CypherParser::KU_NonReservedKeywordsContext>(0);
+}
+
+
+size_t CypherParser::OC_SymbolicNameContext::getRuleIndex() const {
+  return CypherParser::RuleOC_SymbolicName;
+}
+
+
+CypherParser::OC_SymbolicNameContext* CypherParser::oC_SymbolicName() {
+  OC_SymbolicNameContext *_localctx = _tracker.createInstance<OC_SymbolicNameContext>(_ctx, getState());
+  enterRule(_localctx, 348, CypherParser::RuleOC_SymbolicName);
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    setState(2898);
+    _errHandler->sync(this);
+    switch (_input->LA(1)) {
+      case CypherParser::UnescapedSymbolicName: {
+        enterOuterAlt(_localctx, 1);
+        setState(2893);
+        match(CypherParser::UnescapedSymbolicName);
+        break;
+      }
+
+      case CypherParser::EscapedSymbolicName: {
+        enterOuterAlt(_localctx, 2);
+        setState(2894);
+        antlrcpp::downCast<OC_SymbolicNameContext *>(_localctx)->escapedsymbolicnameToken = match(CypherParser::EscapedSymbolicName);
+        if ((antlrcpp::downCast<OC_SymbolicNameContext *>(_localctx)->escapedsymbolicnameToken != nullptr ? antlrcpp::downCast<OC_SymbolicNameContext *>(_localctx)->escapedsymbolicnameToken->getText() : "") == "``") { notifyEmptyToken(antlrcpp::downCast<OC_SymbolicNameContext *>(_localctx)->escapedsymbolicnameToken); }
+        break;
+      }
+
+      case CypherParser::HexLetter: {
+        enterOuterAlt(_localctx, 3);
+        setState(2896);
+        match(CypherParser::HexLetter);
+        break;
+      }
+
+      case CypherParser::ADD:
+      case CypherParser::ALTER:
+      case CypherParser::AS:
+      case CypherParser::ATTACH:
+      case CypherParser::BEGIN:
+      case CypherParser::BY:
+      case CypherParser::CALL:
+      case CypherParser::CHECKPOINT:
+      case CypherParser::COMMENT:
+      case CypherParser::COMMIT:
+      case CypherParser::CONTAINS:
+      case CypherParser::COPY:
+      case CypherParser::COUNT:
+      case CypherParser::CYCLE:
+      case CypherParser::DATABASE:
+      case CypherParser::DELETE:
+      case CypherParser::DETACH:
+      case CypherParser::DROP:
+      case CypherParser::EXPLAIN:
+      case CypherParser::EXPORT:
+      case CypherParser::EXTENSION:
+      case CypherParser::FROM:
+      case CypherParser::FORCE:
+      case CypherParser::GRAPH:
+      case CypherParser::IMPORT:
+      case CypherParser::IF:
+      case CypherParser::INCREMENT:
+      case CypherParser::IS:
+      case CypherParser::KEY:
+      case CypherParser::LIMIT:
+      case CypherParser::LOAD:
+      case CypherParser::LOGICAL:
+      case CypherParser::MATCH:
+      case CypherParser::MAXVALUE:
+      case CypherParser::MERGE:
+      case CypherParser::MINVALUE:
+      case CypherParser::NO:
+      case CypherParser::NODE:
+      case CypherParser::PROJECT:
+      case CypherParser::READ:
+      case CypherParser::REL:
+      case CypherParser::RENAME:
+      case CypherParser::RETURN:
+      case CypherParser::ROLLBACK:
+      case CypherParser::SEQUENCE:
+      case CypherParser::SET:
+      case CypherParser::START:
+      case CypherParser::STRUCT:
+      case CypherParser::TO:
+      case CypherParser::TRANSACTION:
+      case CypherParser::TYPE:
+      case CypherParser::UNINSTALL:
+      case CypherParser::UPDATE:
+      case CypherParser::USE:
+      case CypherParser::WRITE:
+      case CypherParser::YIELD:
+      case CypherParser::USER:
+      case CypherParser::PASSWORD:
+      case CypherParser::ROLE:
+      case CypherParser::MAP:
+      case CypherParser::DECIMAL:
+      case CypherParser::L_SKIP: {
+        enterOuterAlt(_localctx, 4);
+        setState(2897);
+        kU_NonReservedKeywords();
+        break;
+      }
+
+    default:
+      throw NoViableAltException(this);
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- KU_NonReservedKeywordsContext ------------------------------------------------------------------
+
+CypherParser::KU_NonReservedKeywordsContext::KU_NonReservedKeywordsContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::COMMENT() {
+  return getToken(CypherParser::COMMENT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::ADD() {
+  return getToken(CypherParser::ADD, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::ALTER() {
+  return getToken(CypherParser::ALTER, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::AS() {
+  return getToken(CypherParser::AS, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::ATTACH() {
+  return getToken(CypherParser::ATTACH, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::BEGIN() {
+  return getToken(CypherParser::BEGIN, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::BY() {
+  return getToken(CypherParser::BY, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::CALL() {
+  return getToken(CypherParser::CALL, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::CHECKPOINT() {
+  return getToken(CypherParser::CHECKPOINT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::COMMIT() {
+  return getToken(CypherParser::COMMIT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::CONTAINS() {
+  return getToken(CypherParser::CONTAINS, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::COPY() {
+  return getToken(CypherParser::COPY, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::COUNT() {
+  return getToken(CypherParser::COUNT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::CYCLE() {
+  return getToken(CypherParser::CYCLE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::DATABASE() {
+  return getToken(CypherParser::DATABASE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::DECIMAL() {
+  return getToken(CypherParser::DECIMAL, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::DELETE() {
+  return getToken(CypherParser::DELETE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::DETACH() {
+  return getToken(CypherParser::DETACH, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::DROP() {
+  return getToken(CypherParser::DROP, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::EXPLAIN() {
+  return getToken(CypherParser::EXPLAIN, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::EXPORT() {
+  return getToken(CypherParser::EXPORT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::EXTENSION() {
+  return getToken(CypherParser::EXTENSION, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::FORCE() {
+  return getToken(CypherParser::FORCE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::GRAPH() {
+  return getToken(CypherParser::GRAPH, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::IF() {
+  return getToken(CypherParser::IF, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::IS() {
+  return getToken(CypherParser::IS, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::IMPORT() {
+  return getToken(CypherParser::IMPORT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::INCREMENT() {
+  return getToken(CypherParser::INCREMENT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::KEY() {
+  return getToken(CypherParser::KEY, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::LOAD() {
+  return getToken(CypherParser::LOAD, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::LOGICAL() {
+  return getToken(CypherParser::LOGICAL, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::MATCH() {
+  return getToken(CypherParser::MATCH, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::MAXVALUE() {
+  return getToken(CypherParser::MAXVALUE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::MERGE() {
+  return getToken(CypherParser::MERGE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::MINVALUE() {
+  return getToken(CypherParser::MINVALUE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::NO() {
+  return getToken(CypherParser::NO, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::NODE() {
+  return getToken(CypherParser::NODE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::PROJECT() {
+  return getToken(CypherParser::PROJECT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::READ() {
+  return getToken(CypherParser::READ, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::REL() {
+  return getToken(CypherParser::REL, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::RENAME() {
+  return getToken(CypherParser::RENAME, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::RETURN() {
+  return getToken(CypherParser::RETURN, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::ROLLBACK() {
+  return getToken(CypherParser::ROLLBACK, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::ROLE() {
+  return getToken(CypherParser::ROLE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::SEQUENCE() {
+  return getToken(CypherParser::SEQUENCE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::SET() {
+  return getToken(CypherParser::SET, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::START() {
+  return getToken(CypherParser::START, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::STRUCT() {
+  return getToken(CypherParser::STRUCT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::L_SKIP() {
+  return getToken(CypherParser::L_SKIP, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::LIMIT() {
+  return getToken(CypherParser::LIMIT, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::TRANSACTION() {
+  return getToken(CypherParser::TRANSACTION, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::TYPE() {
+  return getToken(CypherParser::TYPE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::USE() {
+  return getToken(CypherParser::USE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::UNINSTALL() {
+  return getToken(CypherParser::UNINSTALL, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::UPDATE() {
+  return getToken(CypherParser::UPDATE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::WRITE() {
+  return getToken(CypherParser::WRITE, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::FROM() {
+  return getToken(CypherParser::FROM, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::TO() {
+  return getToken(CypherParser::TO, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::YIELD() {
+  return getToken(CypherParser::YIELD, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::USER() {
+  return getToken(CypherParser::USER, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::PASSWORD() {
+  return getToken(CypherParser::PASSWORD, 0);
+}
+
+tree::TerminalNode* CypherParser::KU_NonReservedKeywordsContext::MAP() {
+  return getToken(CypherParser::MAP, 0);
+}
+
+
+size_t CypherParser::KU_NonReservedKeywordsContext::getRuleIndex() const {
+  return CypherParser::RuleKU_NonReservedKeywords;
+}
+
+
+CypherParser::KU_NonReservedKeywordsContext* CypherParser::kU_NonReservedKeywords() {
+  KU_NonReservedKeywordsContext *_localctx = _tracker.createInstance<KU_NonReservedKeywordsContext>(_ctx, getState());
+  enterRule(_localctx, 350, CypherParser::RuleKU_NonReservedKeywords);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2900);
+    _la = _input->LA(1);
+    if (!(((((_la - 47) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 47)) & 8923191552623093653) != 0) || ((((_la - 111) & ~ 0x3fULL) == 0) &&
+      ((1ULL << (_la - 111)) & 3361330146570243) != 0))) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_LeftArrowHeadContext ------------------------------------------------------------------
+
+CypherParser::OC_LeftArrowHeadContext::OC_LeftArrowHeadContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+
+size_t CypherParser::OC_LeftArrowHeadContext::getRuleIndex() const {
+  return CypherParser::RuleOC_LeftArrowHead;
+}
+
+
+CypherParser::OC_LeftArrowHeadContext* CypherParser::oC_LeftArrowHead() {
+  OC_LeftArrowHeadContext *_localctx = _tracker.createInstance<OC_LeftArrowHeadContext>(_ctx, getState());
+  enterRule(_localctx, 352, CypherParser::RuleOC_LeftArrowHead);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2902);
+    _la = _input->LA(1);
+    if (!((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & 1006641152) != 0))) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_RightArrowHeadContext ------------------------------------------------------------------
+
+CypherParser::OC_RightArrowHeadContext::OC_RightArrowHeadContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+
+size_t CypherParser::OC_RightArrowHeadContext::getRuleIndex() const {
+  return CypherParser::RuleOC_RightArrowHead;
+}
+
+
+CypherParser::OC_RightArrowHeadContext* CypherParser::oC_RightArrowHead() {
+  OC_RightArrowHeadContext *_localctx = _tracker.createInstance<OC_RightArrowHeadContext>(_ctx, getState());
+  enterRule(_localctx, 354, CypherParser::RuleOC_RightArrowHead);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2904);
+    _la = _input->LA(1);
+    if (!((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & 16106160128) != 0))) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+//----------------- OC_DashContext ------------------------------------------------------------------
+
+CypherParser::OC_DashContext::OC_DashContext(ParserRuleContext *parent, size_t invokingState)
+  : ParserRuleContext(parent, invokingState) {
+}
+
+tree::TerminalNode* CypherParser::OC_DashContext::MINUS() {
+  return getToken(CypherParser::MINUS, 0);
+}
+
+
+size_t CypherParser::OC_DashContext::getRuleIndex() const {
+  return CypherParser::RuleOC_Dash;
+}
+
+
+CypherParser::OC_DashContext* CypherParser::oC_Dash() {
+  OC_DashContext *_localctx = _tracker.createInstance<OC_DashContext>(_ctx, getState());
+  enterRule(_localctx, 356, CypherParser::RuleOC_Dash);
+  size_t _la = 0;
+
+#if __cplusplus > 201703L
+  auto onExit = finally([=, this] {
+#else
+  auto onExit = finally([=] {
+#endif
+    exitRule();
+  });
+  try {
+    enterOuterAlt(_localctx, 1);
+    setState(2906);
+    _la = _input->LA(1);
+    if (!((((_la & ~ 0x3fULL) == 0) &&
+      ((1ULL << _la) & 35167192219648) != 0) || _la == CypherParser::MINUS)) {
+    _errHandler->recoverInline(this);
+    }
+    else {
+      _errHandler->reportMatch(this);
+      consume();
+    }
+   
+  }
+  catch (RecognitionException &e) {
+    _errHandler->reportError(this, e);
+    _localctx->exception = std::current_exception();
+    _errHandler->recover(this, _localctx->exception);
+  }
+
+  return _localctx;
+}
+
+bool CypherParser::sempred(RuleContext *context, size_t ruleIndex, size_t predicateIndex) {
+  switch (ruleIndex) {
+    case 57: return kU_DataTypeSempred(antlrcpp::downCast<KU_DataTypeContext *>(context), predicateIndex);
+    case 84: return kU_JoinNodeSempred(antlrcpp::downCast<KU_JoinNodeContext *>(context), predicateIndex);
+
+  default:
+    break;
+  }
+  return true;
+}
+
+bool CypherParser::kU_DataTypeSempred(KU_DataTypeContext *_localctx, size_t predicateIndex) {
+  switch (predicateIndex) {
+    case 0: return precpred(_ctx, 5);
+
+  default:
+    break;
+  }
+  return true;
+}
+
+bool CypherParser::kU_JoinNodeSempred(KU_JoinNodeContext *_localctx, size_t predicateIndex) {
+  switch (predicateIndex) {
+    case 1: return precpred(_ctx, 4);
+    case 2: return precpred(_ctx, 3);
+
+  default:
+    break;
+  }
+  return true;
+}
+
+void CypherParser::initialize() {
+#if ANTLR4_USE_THREAD_LOCAL_CACHE
+  cypherParserInitialize();
+#else
+  ::antlr4::internal::call_once(cypherParserOnceFlag, cypherParserInitialize);
+#endif
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/include/cypher_lexer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/include/cypher_lexer.h
new file mode 100644
index 0000000000..f4357ba655
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/include/cypher_lexer.h
@@ -0,0 +1,82 @@
+
+// Generated from Cypher.g4 by ANTLR 4.13.1
+
+#pragma once
+
+
+#include "antlr4-runtime.h"
+
+
+
+
+class  CypherLexer : public antlr4::Lexer {
+public:
+  enum {
+    T__0 = 1, T__1 = 2, T__2 = 3, T__3 = 4, T__4 = 5, T__5 = 6, T__6 = 7, 
+    T__7 = 8, T__8 = 9, T__9 = 10, T__10 = 11, T__11 = 12, T__12 = 13, T__13 = 14, 
+    T__14 = 15, T__15 = 16, T__16 = 17, T__17 = 18, T__18 = 19, T__19 = 20, 
+    T__20 = 21, T__21 = 22, T__22 = 23, T__23 = 24, T__24 = 25, T__25 = 26, 
+    T__26 = 27, T__27 = 28, T__28 = 29, T__29 = 30, T__30 = 31, T__31 = 32, 
+    T__32 = 33, T__33 = 34, T__34 = 35, T__35 = 36, T__36 = 37, T__37 = 38, 
+    T__38 = 39, T__39 = 40, T__40 = 41, T__41 = 42, T__42 = 43, T__43 = 44, 
+    ACYCLIC = 45, ANY = 46, ADD = 47, ALL = 48, ALTER = 49, AND = 50, AS = 51, 
+    ASC = 52, ASCENDING = 53, ATTACH = 54, BEGIN = 55, BY = 56, CALL = 57, 
+    CASE = 58, CAST = 59, CHECKPOINT = 60, COLUMN = 61, COMMENT = 62, COMMIT = 63, 
+    COMMIT_SKIP_CHECKPOINT = 64, CONTAINS = 65, COPY = 66, COUNT = 67, CREATE = 68, 
+    CYCLE = 69, DATABASE = 70, DBTYPE = 71, DEFAULT = 72, DELETE = 73, DESC = 74, 
+    DESCENDING = 75, DETACH = 76, DISTINCT = 77, DROP = 78, ELSE = 79, END = 80, 
+    ENDS = 81, EXISTS = 82, EXPLAIN = 83, EXPORT = 84, EXTENSION = 85, FALSE = 86, 
+    FROM = 87, FORCE = 88, GLOB = 89, GRAPH = 90, GROUP = 91, HEADERS = 92, 
+    HINT = 93, IMPORT = 94, IF = 95, IN = 96, INCREMENT = 97, INSTALL = 98, 
+    IS = 99, JOIN = 100, KEY = 101, LIMIT = 102, LOAD = 103, LOGICAL = 104, 
+    MACRO = 105, MATCH = 106, MAXVALUE = 107, MERGE = 108, MINVALUE = 109, 
+    MULTI_JOIN = 110, NO = 111, NODE = 112, NOT = 113, NONE = 114, NULL_ = 115, 
+    ON = 116, ONLY = 117, OPTIONAL = 118, OR = 119, ORDER = 120, PRIMARY = 121, 
+    PROFILE = 122, PROJECT = 123, READ = 124, REL = 125, RENAME = 126, RETURN = 127, 
+    ROLLBACK = 128, ROLLBACK_SKIP_CHECKPOINT = 129, SEQUENCE = 130, SET = 131, 
+    SHORTEST = 132, START = 133, STARTS = 134, STRUCT = 135, TABLE = 136, 
+    THEN = 137, TO = 138, TRAIL = 139, TRANSACTION = 140, TRUE = 141, TYPE = 142, 
+    UNION = 143, UNWIND = 144, UNINSTALL = 145, UPDATE = 146, USE = 147, 
+    WHEN = 148, WHERE = 149, WITH = 150, WRITE = 151, WSHORTEST = 152, XOR = 153, 
+    SINGLE = 154, YIELD = 155, USER = 156, PASSWORD = 157, ROLE = 158, MAP = 159, 
+    DECIMAL = 160, STAR = 161, L_SKIP = 162, INVALID_NOT_EQUAL = 163, COLON = 164, 
+    DOTDOT = 165, MINUS = 166, FACTORIAL = 167, StringLiteral = 168, EscapedChar = 169, 
+    DecimalInteger = 170, HexLetter = 171, HexDigit = 172, Digit = 173, 
+    NonZeroDigit = 174, NonZeroOctDigit = 175, ZeroDigit = 176, ExponentDecimalReal = 177, 
+    RegularDecimalReal = 178, UnescapedSymbolicName = 179, IdentifierStart = 180, 
+    IdentifierPart = 181, EscapedSymbolicName = 182, SP = 183, WHITESPACE = 184, 
+    CypherComment = 185, Unknown = 186
+  };
+
+  explicit CypherLexer(antlr4::CharStream *input);
+
+  ~CypherLexer() override;
+
+
+  std::string getGrammarFileName() const override;
+
+  const std::vector<std::string>& getRuleNames() const override;
+
+  const std::vector<std::string>& getChannelNames() const override;
+
+  const std::vector<std::string>& getModeNames() const override;
+
+  const antlr4::dfa::Vocabulary& getVocabulary() const override;
+
+  antlr4::atn::SerializedATNView getSerializedATN() const override;
+
+  const antlr4::atn::ATN& getATN() const override;
+
+  // By default the static state used to implement the lexer is lazily initialized during the first
+  // call to the constructor. You can call this function if you wish to initialize the static state
+  // ahead of time.
+  static void initialize();
+
+private:
+
+  // Individual action functions triggered by action() above.
+
+  // Individual semantic predicate functions triggered by sempred() above.
+
+};
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/include/cypher_parser.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/include/cypher_parser.h
new file mode 100644
index 0000000000..7cfd61bda7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_cypher/include/cypher_parser.h
@@ -0,0 +1,3065 @@
+
+// Generated from Cypher.g4 by ANTLR 4.13.1
+
+#pragma once
+
+
+#include "antlr4-runtime.h"
+
+
+
+
+class  CypherParser : public antlr4::Parser {
+public:
+  enum {
+    T__0 = 1, T__1 = 2, T__2 = 3, T__3 = 4, T__4 = 5, T__5 = 6, T__6 = 7, 
+    T__7 = 8, T__8 = 9, T__9 = 10, T__10 = 11, T__11 = 12, T__12 = 13, T__13 = 14, 
+    T__14 = 15, T__15 = 16, T__16 = 17, T__17 = 18, T__18 = 19, T__19 = 20, 
+    T__20 = 21, T__21 = 22, T__22 = 23, T__23 = 24, T__24 = 25, T__25 = 26, 
+    T__26 = 27, T__27 = 28, T__28 = 29, T__29 = 30, T__30 = 31, T__31 = 32, 
+    T__32 = 33, T__33 = 34, T__34 = 35, T__35 = 36, T__36 = 37, T__37 = 38, 
+    T__38 = 39, T__39 = 40, T__40 = 41, T__41 = 42, T__42 = 43, T__43 = 44, 
+    ACYCLIC = 45, ANY = 46, ADD = 47, ALL = 48, ALTER = 49, AND = 50, AS = 51, 
+    ASC = 52, ASCENDING = 53, ATTACH = 54, BEGIN = 55, BY = 56, CALL = 57, 
+    CASE = 58, CAST = 59, CHECKPOINT = 60, COLUMN = 61, COMMENT = 62, COMMIT = 63, 
+    COMMIT_SKIP_CHECKPOINT = 64, CONTAINS = 65, COPY = 66, COUNT = 67, CREATE = 68, 
+    CYCLE = 69, DATABASE = 70, DBTYPE = 71, DEFAULT = 72, DELETE = 73, DESC = 74, 
+    DESCENDING = 75, DETACH = 76, DISTINCT = 77, DROP = 78, ELSE = 79, END = 80, 
+    ENDS = 81, EXISTS = 82, EXPLAIN = 83, EXPORT = 84, EXTENSION = 85, FALSE = 86, 
+    FROM = 87, FORCE = 88, GLOB = 89, GRAPH = 90, GROUP = 91, HEADERS = 92, 
+    HINT = 93, IMPORT = 94, IF = 95, IN = 96, INCREMENT = 97, INSTALL = 98, 
+    IS = 99, JOIN = 100, KEY = 101, LIMIT = 102, LOAD = 103, LOGICAL = 104, 
+    MACRO = 105, MATCH = 106, MAXVALUE = 107, MERGE = 108, MINVALUE = 109, 
+    MULTI_JOIN = 110, NO = 111, NODE = 112, NOT = 113, NONE = 114, NULL_ = 115, 
+    ON = 116, ONLY = 117, OPTIONAL = 118, OR = 119, ORDER = 120, PRIMARY = 121, 
+    PROFILE = 122, PROJECT = 123, READ = 124, REL = 125, RENAME = 126, RETURN = 127, 
+    ROLLBACK = 128, ROLLBACK_SKIP_CHECKPOINT = 129, SEQUENCE = 130, SET = 131, 
+    SHORTEST = 132, START = 133, STARTS = 134, STRUCT = 135, TABLE = 136, 
+    THEN = 137, TO = 138, TRAIL = 139, TRANSACTION = 140, TRUE = 141, TYPE = 142, 
+    UNION = 143, UNWIND = 144, UNINSTALL = 145, UPDATE = 146, USE = 147, 
+    WHEN = 148, WHERE = 149, WITH = 150, WRITE = 151, WSHORTEST = 152, XOR = 153, 
+    SINGLE = 154, YIELD = 155, USER = 156, PASSWORD = 157, ROLE = 158, MAP = 159, 
+    DECIMAL = 160, STAR = 161, L_SKIP = 162, INVALID_NOT_EQUAL = 163, COLON = 164, 
+    DOTDOT = 165, MINUS = 166, FACTORIAL = 167, StringLiteral = 168, EscapedChar = 169, 
+    DecimalInteger = 170, HexLetter = 171, HexDigit = 172, Digit = 173, 
+    NonZeroDigit = 174, NonZeroOctDigit = 175, ZeroDigit = 176, ExponentDecimalReal = 177, 
+    RegularDecimalReal = 178, UnescapedSymbolicName = 179, IdentifierStart = 180, 
+    IdentifierPart = 181, EscapedSymbolicName = 182, SP = 183, WHITESPACE = 184, 
+    CypherComment = 185, Unknown = 186
+  };
+
+  enum {
+    RuleKu_Statements = 0, RuleOC_Cypher = 1, RuleOC_Statement = 2, RuleKU_CopyFrom = 3, 
+    RuleKU_ColumnNames = 4, RuleKU_ScanSource = 5, RuleKU_CopyFromByColumn = 6, 
+    RuleKU_CopyTO = 7, RuleKU_ExportDatabase = 8, RuleKU_ImportDatabase = 9, 
+    RuleKU_AttachDatabase = 10, RuleKU_Option = 11, RuleKU_Options = 12, 
+    RuleKU_DetachDatabase = 13, RuleKU_UseDatabase = 14, RuleKU_StandaloneCall = 15, 
+    RuleKU_CommentOn = 16, RuleKU_CreateMacro = 17, RuleKU_PositionalArgs = 18, 
+    RuleKU_DefaultArg = 19, RuleKU_FilePaths = 20, RuleKU_IfNotExists = 21, 
+    RuleKU_CreateNodeTable = 22, RuleKU_CreateRelTable = 23, RuleKU_FromToConnections = 24, 
+    RuleKU_FromToConnection = 25, RuleKU_CreateSequence = 26, RuleKU_CreateType = 27, 
+    RuleKU_SequenceOptions = 28, RuleKU_WithPasswd = 29, RuleKU_CreateUser = 30, 
+    RuleKU_CreateRole = 31, RuleKU_IncrementBy = 32, RuleKU_MinValue = 33, 
+    RuleKU_MaxValue = 34, RuleKU_StartWith = 35, RuleKU_Cycle = 36, RuleKU_IfExists = 37, 
+    RuleKU_Drop = 38, RuleKU_AlterTable = 39, RuleKU_AlterOptions = 40, 
+    RuleKU_AddProperty = 41, RuleKU_Default = 42, RuleKU_DropProperty = 43, 
+    RuleKU_RenameTable = 44, RuleKU_RenameProperty = 45, RuleKU_AddFromToConnection = 46, 
+    RuleKU_DropFromToConnection = 47, RuleKU_ColumnDefinitions = 48, RuleKU_ColumnDefinition = 49, 
+    RuleKU_PropertyDefinitions = 50, RuleKU_PropertyDefinition = 51, RuleKU_CreateNodeConstraint = 52, 
+    RuleKU_UnionType = 53, RuleKU_StructType = 54, RuleKU_MapType = 55, 
+    RuleKU_DecimalType = 56, RuleKU_DataType = 57, RuleKU_ListIdentifiers = 58, 
+    RuleKU_ListIdentifier = 59, RuleOC_AnyCypherOption = 60, RuleOC_Explain = 61, 
+    RuleOC_Profile = 62, RuleKU_Transaction = 63, RuleKU_Extension = 64, 
+    RuleKU_LoadExtension = 65, RuleKU_InstallExtension = 66, RuleKU_UninstallExtension = 67, 
+    RuleKU_UpdateExtension = 68, RuleOC_Query = 69, RuleOC_RegularQuery = 70, 
+    RuleOC_Union = 71, RuleOC_SingleQuery = 72, RuleOC_SinglePartQuery = 73, 
+    RuleOC_MultiPartQuery = 74, RuleKU_QueryPart = 75, RuleOC_UpdatingClause = 76, 
+    RuleOC_ReadingClause = 77, RuleKU_LoadFrom = 78, RuleOC_YieldItem = 79, 
+    RuleOC_YieldItems = 80, RuleKU_InQueryCall = 81, RuleOC_Match = 82, 
+    RuleKU_Hint = 83, RuleKU_JoinNode = 84, RuleOC_Unwind = 85, RuleOC_Create = 86, 
+    RuleOC_Merge = 87, RuleOC_MergeAction = 88, RuleOC_Set = 89, RuleOC_SetItem = 90, 
+    RuleOC_Delete = 91, RuleOC_With = 92, RuleOC_Return = 93, RuleOC_ProjectionBody = 94, 
+    RuleOC_ProjectionItems = 95, RuleOC_ProjectionItem = 96, RuleOC_Order = 97, 
+    RuleOC_Skip = 98, RuleOC_Limit = 99, RuleOC_SortItem = 100, RuleOC_Where = 101, 
+    RuleOC_Pattern = 102, RuleOC_PatternPart = 103, RuleOC_AnonymousPatternPart = 104, 
+    RuleOC_PatternElement = 105, RuleOC_NodePattern = 106, RuleOC_PatternElementChain = 107, 
+    RuleOC_RelationshipPattern = 108, RuleOC_RelationshipDetail = 109, RuleKU_Properties = 110, 
+    RuleOC_RelationshipTypes = 111, RuleOC_NodeLabels = 112, RuleKU_RecursiveDetail = 113, 
+    RuleKU_RecursiveType = 114, RuleOC_RangeLiteral = 115, RuleKU_RecursiveComprehension = 116, 
+    RuleKU_RecursiveProjectionItems = 117, RuleOC_LowerBound = 118, RuleOC_UpperBound = 119, 
+    RuleOC_LabelName = 120, RuleOC_RelTypeName = 121, RuleOC_Expression = 122, 
+    RuleOC_OrExpression = 123, RuleOC_XorExpression = 124, RuleOC_AndExpression = 125, 
+    RuleOC_NotExpression = 126, RuleOC_ComparisonExpression = 127, RuleKU_ComparisonOperator = 128, 
+    RuleKU_BitwiseOrOperatorExpression = 129, RuleKU_BitwiseAndOperatorExpression = 130, 
+    RuleKU_BitShiftOperatorExpression = 131, RuleKU_BitShiftOperator = 132, 
+    RuleOC_AddOrSubtractExpression = 133, RuleKU_AddOrSubtractOperator = 134, 
+    RuleOC_MultiplyDivideModuloExpression = 135, RuleKU_MultiplyDivideModuloOperator = 136, 
+    RuleOC_PowerOfExpression = 137, RuleOC_StringListNullOperatorExpression = 138, 
+    RuleOC_ListOperatorExpression = 139, RuleOC_StringOperatorExpression = 140, 
+    RuleOC_RegularExpression = 141, RuleOC_NullOperatorExpression = 142, 
+    RuleOC_UnaryAddSubtractOrFactorialExpression = 143, RuleOC_PropertyOrLabelsExpression = 144, 
+    RuleOC_Atom = 145, RuleOC_Quantifier = 146, RuleOC_FilterExpression = 147, 
+    RuleOC_IdInColl = 148, RuleOC_Literal = 149, RuleOC_BooleanLiteral = 150, 
+    RuleOC_ListLiteral = 151, RuleKU_ListEntry = 152, RuleKU_StructLiteral = 153, 
+    RuleKU_StructField = 154, RuleOC_ParenthesizedExpression = 155, RuleOC_FunctionInvocation = 156, 
+    RuleOC_FunctionName = 157, RuleKU_FunctionParameter = 158, RuleKU_LambdaParameter = 159, 
+    RuleKU_LambdaVars = 160, RuleOC_PathPatterns = 161, RuleOC_ExistCountSubquery = 162, 
+    RuleOC_PropertyLookup = 163, RuleOC_CaseExpression = 164, RuleOC_CaseAlternative = 165, 
+    RuleOC_Variable = 166, RuleOC_NumberLiteral = 167, RuleOC_Parameter = 168, 
+    RuleOC_PropertyExpression = 169, RuleOC_PropertyKeyName = 170, RuleOC_IntegerLiteral = 171, 
+    RuleOC_DoubleLiteral = 172, RuleOC_SchemaName = 173, RuleOC_SymbolicName = 174, 
+    RuleKU_NonReservedKeywords = 175, RuleOC_LeftArrowHead = 176, RuleOC_RightArrowHead = 177, 
+    RuleOC_Dash = 178
+  };
+
+  explicit CypherParser(antlr4::TokenStream *input);
+
+  CypherParser(antlr4::TokenStream *input, const antlr4::atn::ParserATNSimulatorOptions &options);
+
+  ~CypherParser() override;
+
+  std::string getGrammarFileName() const override;
+
+  const antlr4::atn::ATN& getATN() const override;
+
+  const std::vector<std::string>& getRuleNames() const override;
+
+  const antlr4::dfa::Vocabulary& getVocabulary() const override;
+
+  antlr4::atn::SerializedATNView getSerializedATN() const override;
+
+
+  class Ku_StatementsContext;
+  class OC_CypherContext;
+  class OC_StatementContext;
+  class KU_CopyFromContext;
+  class KU_ColumnNamesContext;
+  class KU_ScanSourceContext;
+  class KU_CopyFromByColumnContext;
+  class KU_CopyTOContext;
+  class KU_ExportDatabaseContext;
+  class KU_ImportDatabaseContext;
+  class KU_AttachDatabaseContext;
+  class KU_OptionContext;
+  class KU_OptionsContext;
+  class KU_DetachDatabaseContext;
+  class KU_UseDatabaseContext;
+  class KU_StandaloneCallContext;
+  class KU_CommentOnContext;
+  class KU_CreateMacroContext;
+  class KU_PositionalArgsContext;
+  class KU_DefaultArgContext;
+  class KU_FilePathsContext;
+  class KU_IfNotExistsContext;
+  class KU_CreateNodeTableContext;
+  class KU_CreateRelTableContext;
+  class KU_FromToConnectionsContext;
+  class KU_FromToConnectionContext;
+  class KU_CreateSequenceContext;
+  class KU_CreateTypeContext;
+  class KU_SequenceOptionsContext;
+  class KU_WithPasswdContext;
+  class KU_CreateUserContext;
+  class KU_CreateRoleContext;
+  class KU_IncrementByContext;
+  class KU_MinValueContext;
+  class KU_MaxValueContext;
+  class KU_StartWithContext;
+  class KU_CycleContext;
+  class KU_IfExistsContext;
+  class KU_DropContext;
+  class KU_AlterTableContext;
+  class KU_AlterOptionsContext;
+  class KU_AddPropertyContext;
+  class KU_DefaultContext;
+  class KU_DropPropertyContext;
+  class KU_RenameTableContext;
+  class KU_RenamePropertyContext;
+  class KU_AddFromToConnectionContext;
+  class KU_DropFromToConnectionContext;
+  class KU_ColumnDefinitionsContext;
+  class KU_ColumnDefinitionContext;
+  class KU_PropertyDefinitionsContext;
+  class KU_PropertyDefinitionContext;
+  class KU_CreateNodeConstraintContext;
+  class KU_UnionTypeContext;
+  class KU_StructTypeContext;
+  class KU_MapTypeContext;
+  class KU_DecimalTypeContext;
+  class KU_DataTypeContext;
+  class KU_ListIdentifiersContext;
+  class KU_ListIdentifierContext;
+  class OC_AnyCypherOptionContext;
+  class OC_ExplainContext;
+  class OC_ProfileContext;
+  class KU_TransactionContext;
+  class KU_ExtensionContext;
+  class KU_LoadExtensionContext;
+  class KU_InstallExtensionContext;
+  class KU_UninstallExtensionContext;
+  class KU_UpdateExtensionContext;
+  class OC_QueryContext;
+  class OC_RegularQueryContext;
+  class OC_UnionContext;
+  class OC_SingleQueryContext;
+  class OC_SinglePartQueryContext;
+  class OC_MultiPartQueryContext;
+  class KU_QueryPartContext;
+  class OC_UpdatingClauseContext;
+  class OC_ReadingClauseContext;
+  class KU_LoadFromContext;
+  class OC_YieldItemContext;
+  class OC_YieldItemsContext;
+  class KU_InQueryCallContext;
+  class OC_MatchContext;
+  class KU_HintContext;
+  class KU_JoinNodeContext;
+  class OC_UnwindContext;
+  class OC_CreateContext;
+  class OC_MergeContext;
+  class OC_MergeActionContext;
+  class OC_SetContext;
+  class OC_SetItemContext;
+  class OC_DeleteContext;
+  class OC_WithContext;
+  class OC_ReturnContext;
+  class OC_ProjectionBodyContext;
+  class OC_ProjectionItemsContext;
+  class OC_ProjectionItemContext;
+  class OC_OrderContext;
+  class OC_SkipContext;
+  class OC_LimitContext;
+  class OC_SortItemContext;
+  class OC_WhereContext;
+  class OC_PatternContext;
+  class OC_PatternPartContext;
+  class OC_AnonymousPatternPartContext;
+  class OC_PatternElementContext;
+  class OC_NodePatternContext;
+  class OC_PatternElementChainContext;
+  class OC_RelationshipPatternContext;
+  class OC_RelationshipDetailContext;
+  class KU_PropertiesContext;
+  class OC_RelationshipTypesContext;
+  class OC_NodeLabelsContext;
+  class KU_RecursiveDetailContext;
+  class KU_RecursiveTypeContext;
+  class OC_RangeLiteralContext;
+  class KU_RecursiveComprehensionContext;
+  class KU_RecursiveProjectionItemsContext;
+  class OC_LowerBoundContext;
+  class OC_UpperBoundContext;
+  class OC_LabelNameContext;
+  class OC_RelTypeNameContext;
+  class OC_ExpressionContext;
+  class OC_OrExpressionContext;
+  class OC_XorExpressionContext;
+  class OC_AndExpressionContext;
+  class OC_NotExpressionContext;
+  class OC_ComparisonExpressionContext;
+  class KU_ComparisonOperatorContext;
+  class KU_BitwiseOrOperatorExpressionContext;
+  class KU_BitwiseAndOperatorExpressionContext;
+  class KU_BitShiftOperatorExpressionContext;
+  class KU_BitShiftOperatorContext;
+  class OC_AddOrSubtractExpressionContext;
+  class KU_AddOrSubtractOperatorContext;
+  class OC_MultiplyDivideModuloExpressionContext;
+  class KU_MultiplyDivideModuloOperatorContext;
+  class OC_PowerOfExpressionContext;
+  class OC_StringListNullOperatorExpressionContext;
+  class OC_ListOperatorExpressionContext;
+  class OC_StringOperatorExpressionContext;
+  class OC_RegularExpressionContext;
+  class OC_NullOperatorExpressionContext;
+  class OC_UnaryAddSubtractOrFactorialExpressionContext;
+  class OC_PropertyOrLabelsExpressionContext;
+  class OC_AtomContext;
+  class OC_QuantifierContext;
+  class OC_FilterExpressionContext;
+  class OC_IdInCollContext;
+  class OC_LiteralContext;
+  class OC_BooleanLiteralContext;
+  class OC_ListLiteralContext;
+  class KU_ListEntryContext;
+  class KU_StructLiteralContext;
+  class KU_StructFieldContext;
+  class OC_ParenthesizedExpressionContext;
+  class OC_FunctionInvocationContext;
+  class OC_FunctionNameContext;
+  class KU_FunctionParameterContext;
+  class KU_LambdaParameterContext;
+  class KU_LambdaVarsContext;
+  class OC_PathPatternsContext;
+  class OC_ExistCountSubqueryContext;
+  class OC_PropertyLookupContext;
+  class OC_CaseExpressionContext;
+  class OC_CaseAlternativeContext;
+  class OC_VariableContext;
+  class OC_NumberLiteralContext;
+  class OC_ParameterContext;
+  class OC_PropertyExpressionContext;
+  class OC_PropertyKeyNameContext;
+  class OC_IntegerLiteralContext;
+  class OC_DoubleLiteralContext;
+  class OC_SchemaNameContext;
+  class OC_SymbolicNameContext;
+  class KU_NonReservedKeywordsContext;
+  class OC_LeftArrowHeadContext;
+  class OC_RightArrowHeadContext;
+  class OC_DashContext; 
+
+  class  Ku_StatementsContext : public antlr4::ParserRuleContext {
+  public:
+    Ku_StatementsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_CypherContext *> oC_Cypher();
+    OC_CypherContext* oC_Cypher(size_t i);
+    antlr4::tree::TerminalNode *EOF();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  Ku_StatementsContext* ku_Statements();
+
+  class  OC_CypherContext : public antlr4::ParserRuleContext {
+  public:
+    OC_CypherContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_StatementContext *oC_Statement();
+    OC_AnyCypherOptionContext *oC_AnyCypherOption();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_CypherContext* oC_Cypher();
+
+  class  OC_StatementContext : public antlr4::ParserRuleContext {
+  public:
+    OC_StatementContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_QueryContext *oC_Query();
+    KU_CreateUserContext *kU_CreateUser();
+    KU_CreateRoleContext *kU_CreateRole();
+    KU_CreateNodeTableContext *kU_CreateNodeTable();
+    KU_CreateRelTableContext *kU_CreateRelTable();
+    KU_CreateSequenceContext *kU_CreateSequence();
+    KU_CreateTypeContext *kU_CreateType();
+    KU_DropContext *kU_Drop();
+    KU_AlterTableContext *kU_AlterTable();
+    KU_CopyFromContext *kU_CopyFrom();
+    KU_CopyFromByColumnContext *kU_CopyFromByColumn();
+    KU_CopyTOContext *kU_CopyTO();
+    KU_StandaloneCallContext *kU_StandaloneCall();
+    KU_CreateMacroContext *kU_CreateMacro();
+    KU_CommentOnContext *kU_CommentOn();
+    KU_TransactionContext *kU_Transaction();
+    KU_ExtensionContext *kU_Extension();
+    KU_ExportDatabaseContext *kU_ExportDatabase();
+    KU_ImportDatabaseContext *kU_ImportDatabase();
+    KU_AttachDatabaseContext *kU_AttachDatabase();
+    KU_DetachDatabaseContext *kU_DetachDatabase();
+    KU_UseDatabaseContext *kU_UseDatabase();
+
+   
+  };
+
+  OC_StatementContext* oC_Statement();
+
+  class  KU_CopyFromContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CopyFromContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *COPY();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_SchemaNameContext *oC_SchemaName();
+    antlr4::tree::TerminalNode *FROM();
+    KU_ScanSourceContext *kU_ScanSource();
+    KU_ColumnNamesContext *kU_ColumnNames();
+    KU_OptionsContext *kU_Options();
+
+   
+  };
+
+  KU_CopyFromContext* kU_CopyFrom();
+
+  class  KU_ColumnNamesContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ColumnNamesContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<OC_SchemaNameContext *> oC_SchemaName();
+    OC_SchemaNameContext* oC_SchemaName(size_t i);
+
+   
+  };
+
+  KU_ColumnNamesContext* kU_ColumnNames();
+
+  class  KU_ScanSourceContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ScanSourceContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    KU_FilePathsContext *kU_FilePaths();
+    OC_QueryContext *oC_Query();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_ParameterContext *oC_Parameter();
+    OC_VariableContext *oC_Variable();
+    OC_SchemaNameContext *oC_SchemaName();
+    OC_FunctionInvocationContext *oC_FunctionInvocation();
+
+   
+  };
+
+  KU_ScanSourceContext* kU_ScanSource();
+
+  class  KU_CopyFromByColumnContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CopyFromByColumnContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *COPY();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_SchemaNameContext *oC_SchemaName();
+    antlr4::tree::TerminalNode *FROM();
+    std::vector<antlr4::tree::TerminalNode *> StringLiteral();
+    antlr4::tree::TerminalNode* StringLiteral(size_t i);
+    antlr4::tree::TerminalNode *BY();
+    antlr4::tree::TerminalNode *COLUMN();
+
+   
+  };
+
+  KU_CopyFromByColumnContext* kU_CopyFromByColumn();
+
+  class  KU_CopyTOContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CopyTOContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *COPY();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_QueryContext *oC_Query();
+    antlr4::tree::TerminalNode *TO();
+    antlr4::tree::TerminalNode *StringLiteral();
+    KU_OptionsContext *kU_Options();
+
+   
+  };
+
+  KU_CopyTOContext* kU_CopyTO();
+
+  class  KU_ExportDatabaseContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ExportDatabaseContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *EXPORT();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *DATABASE();
+    antlr4::tree::TerminalNode *StringLiteral();
+    KU_OptionsContext *kU_Options();
+
+   
+  };
+
+  KU_ExportDatabaseContext* kU_ExportDatabase();
+
+  class  KU_ImportDatabaseContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ImportDatabaseContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *IMPORT();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *DATABASE();
+    antlr4::tree::TerminalNode *StringLiteral();
+
+   
+  };
+
+  KU_ImportDatabaseContext* kU_ImportDatabase();
+
+  class  KU_AttachDatabaseContext : public antlr4::ParserRuleContext {
+  public:
+    KU_AttachDatabaseContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *ATTACH();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *StringLiteral();
+    antlr4::tree::TerminalNode *DBTYPE();
+    OC_SymbolicNameContext *oC_SymbolicName();
+    antlr4::tree::TerminalNode *AS();
+    OC_SchemaNameContext *oC_SchemaName();
+    KU_OptionsContext *kU_Options();
+
+   
+  };
+
+  KU_AttachDatabaseContext* kU_AttachDatabase();
+
+  class  KU_OptionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_OptionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SymbolicNameContext *oC_SymbolicName();
+    OC_LiteralContext *oC_Literal();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_OptionContext* kU_Option();
+
+  class  KU_OptionsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_OptionsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_OptionContext *> kU_Option();
+    KU_OptionContext* kU_Option(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_OptionsContext* kU_Options();
+
+  class  KU_DetachDatabaseContext : public antlr4::ParserRuleContext {
+  public:
+    KU_DetachDatabaseContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DETACH();
+    antlr4::tree::TerminalNode *SP();
+    OC_SchemaNameContext *oC_SchemaName();
+
+   
+  };
+
+  KU_DetachDatabaseContext* kU_DetachDatabase();
+
+  class  KU_UseDatabaseContext : public antlr4::ParserRuleContext {
+  public:
+    KU_UseDatabaseContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *USE();
+    antlr4::tree::TerminalNode *SP();
+    OC_SchemaNameContext *oC_SchemaName();
+
+   
+  };
+
+  KU_UseDatabaseContext* kU_UseDatabase();
+
+  class  KU_StandaloneCallContext : public antlr4::ParserRuleContext {
+  public:
+    KU_StandaloneCallContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CALL();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_SymbolicNameContext *oC_SymbolicName();
+    OC_ExpressionContext *oC_Expression();
+    OC_FunctionInvocationContext *oC_FunctionInvocation();
+
+   
+  };
+
+  KU_StandaloneCallContext* kU_StandaloneCall();
+
+  class  KU_CommentOnContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CommentOnContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *COMMENT();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *ON();
+    antlr4::tree::TerminalNode *TABLE();
+    OC_SchemaNameContext *oC_SchemaName();
+    antlr4::tree::TerminalNode *IS();
+    antlr4::tree::TerminalNode *StringLiteral();
+
+   
+  };
+
+  KU_CommentOnContext* kU_CommentOn();
+
+  class  KU_CreateMacroContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CreateMacroContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CREATE();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *MACRO();
+    OC_FunctionNameContext *oC_FunctionName();
+    antlr4::tree::TerminalNode *AS();
+    OC_ExpressionContext *oC_Expression();
+    KU_PositionalArgsContext *kU_PositionalArgs();
+    std::vector<KU_DefaultArgContext *> kU_DefaultArg();
+    KU_DefaultArgContext* kU_DefaultArg(size_t i);
+
+   
+  };
+
+  KU_CreateMacroContext* kU_CreateMacro();
+
+  class  KU_PositionalArgsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_PositionalArgsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_SymbolicNameContext *> oC_SymbolicName();
+    OC_SymbolicNameContext* oC_SymbolicName(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_PositionalArgsContext* kU_PositionalArgs();
+
+  class  KU_DefaultArgContext : public antlr4::ParserRuleContext {
+  public:
+    KU_DefaultArgContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SymbolicNameContext *oC_SymbolicName();
+    antlr4::tree::TerminalNode *COLON();
+    OC_LiteralContext *oC_Literal();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_DefaultArgContext* kU_DefaultArg();
+
+  class  KU_FilePathsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_FilePathsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> StringLiteral();
+    antlr4::tree::TerminalNode* StringLiteral(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *GLOB();
+
+   
+  };
+
+  KU_FilePathsContext* kU_FilePaths();
+
+  class  KU_IfNotExistsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_IfNotExistsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *IF();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *NOT();
+    antlr4::tree::TerminalNode *EXISTS();
+
+   
+  };
+
+  KU_IfNotExistsContext* kU_IfNotExists();
+
+  class  KU_CreateNodeTableContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CreateNodeTableContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CREATE();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *NODE();
+    antlr4::tree::TerminalNode *TABLE();
+    OC_SchemaNameContext *oC_SchemaName();
+    KU_PropertyDefinitionsContext *kU_PropertyDefinitions();
+    antlr4::tree::TerminalNode *AS();
+    OC_QueryContext *oC_Query();
+    KU_IfNotExistsContext *kU_IfNotExists();
+    KU_CreateNodeConstraintContext *kU_CreateNodeConstraint();
+
+   
+  };
+
+  KU_CreateNodeTableContext* kU_CreateNodeTable();
+
+  class  KU_CreateRelTableContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CreateRelTableContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CREATE();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *REL();
+    antlr4::tree::TerminalNode *TABLE();
+    OC_SchemaNameContext *oC_SchemaName();
+    KU_FromToConnectionsContext *kU_FromToConnections();
+    antlr4::tree::TerminalNode *AS();
+    OC_QueryContext *oC_Query();
+    antlr4::tree::TerminalNode *GROUP();
+    KU_IfNotExistsContext *kU_IfNotExists();
+    antlr4::tree::TerminalNode *WITH();
+    KU_OptionsContext *kU_Options();
+    KU_PropertyDefinitionsContext *kU_PropertyDefinitions();
+    OC_SymbolicNameContext *oC_SymbolicName();
+
+   
+  };
+
+  KU_CreateRelTableContext* kU_CreateRelTable();
+
+  class  KU_FromToConnectionsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_FromToConnectionsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_FromToConnectionContext *> kU_FromToConnection();
+    KU_FromToConnectionContext* kU_FromToConnection(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_FromToConnectionsContext* kU_FromToConnections();
+
+  class  KU_FromToConnectionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_FromToConnectionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *FROM();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<OC_SchemaNameContext *> oC_SchemaName();
+    OC_SchemaNameContext* oC_SchemaName(size_t i);
+    antlr4::tree::TerminalNode *TO();
+
+   
+  };
+
+  KU_FromToConnectionContext* kU_FromToConnection();
+
+  class  KU_CreateSequenceContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CreateSequenceContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CREATE();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *SEQUENCE();
+    OC_SchemaNameContext *oC_SchemaName();
+    KU_IfNotExistsContext *kU_IfNotExists();
+    std::vector<KU_SequenceOptionsContext *> kU_SequenceOptions();
+    KU_SequenceOptionsContext* kU_SequenceOptions(size_t i);
+
+   
+  };
+
+  KU_CreateSequenceContext* kU_CreateSequence();
+
+  class  KU_CreateTypeContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CreateTypeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CREATE();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *TYPE();
+    OC_SchemaNameContext *oC_SchemaName();
+    antlr4::tree::TerminalNode *AS();
+    KU_DataTypeContext *kU_DataType();
+
+   
+  };
+
+  KU_CreateTypeContext* kU_CreateType();
+
+  class  KU_SequenceOptionsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_SequenceOptionsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    KU_IncrementByContext *kU_IncrementBy();
+    KU_MinValueContext *kU_MinValue();
+    KU_MaxValueContext *kU_MaxValue();
+    KU_StartWithContext *kU_StartWith();
+    KU_CycleContext *kU_Cycle();
+
+   
+  };
+
+  KU_SequenceOptionsContext* kU_SequenceOptions();
+
+  class  KU_WithPasswdContext : public antlr4::ParserRuleContext {
+  public:
+    KU_WithPasswdContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *WITH();
+    antlr4::tree::TerminalNode *PASSWORD();
+    antlr4::tree::TerminalNode *StringLiteral();
+
+   
+  };
+
+  KU_WithPasswdContext* kU_WithPasswd();
+
+  class  KU_CreateUserContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CreateUserContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CREATE();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *USER();
+    OC_VariableContext *oC_Variable();
+    KU_IfNotExistsContext *kU_IfNotExists();
+    KU_WithPasswdContext *kU_WithPasswd();
+
+   
+  };
+
+  KU_CreateUserContext* kU_CreateUser();
+
+  class  KU_CreateRoleContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CreateRoleContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CREATE();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *ROLE();
+    OC_VariableContext *oC_Variable();
+    KU_IfNotExistsContext *kU_IfNotExists();
+
+   
+  };
+
+  KU_CreateRoleContext* kU_CreateRole();
+
+  class  KU_IncrementByContext : public antlr4::ParserRuleContext {
+  public:
+    KU_IncrementByContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *INCREMENT();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_IntegerLiteralContext *oC_IntegerLiteral();
+    antlr4::tree::TerminalNode *BY();
+    antlr4::tree::TerminalNode *MINUS();
+
+   
+  };
+
+  KU_IncrementByContext* kU_IncrementBy();
+
+  class  KU_MinValueContext : public antlr4::ParserRuleContext {
+  public:
+    KU_MinValueContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *NO();
+    antlr4::tree::TerminalNode *SP();
+    antlr4::tree::TerminalNode *MINVALUE();
+    OC_IntegerLiteralContext *oC_IntegerLiteral();
+    antlr4::tree::TerminalNode *MINUS();
+
+   
+  };
+
+  KU_MinValueContext* kU_MinValue();
+
+  class  KU_MaxValueContext : public antlr4::ParserRuleContext {
+  public:
+    KU_MaxValueContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *NO();
+    antlr4::tree::TerminalNode *SP();
+    antlr4::tree::TerminalNode *MAXVALUE();
+    OC_IntegerLiteralContext *oC_IntegerLiteral();
+    antlr4::tree::TerminalNode *MINUS();
+
+   
+  };
+
+  KU_MaxValueContext* kU_MaxValue();
+
+  class  KU_StartWithContext : public antlr4::ParserRuleContext {
+  public:
+    KU_StartWithContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *START();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_IntegerLiteralContext *oC_IntegerLiteral();
+    antlr4::tree::TerminalNode *WITH();
+    antlr4::tree::TerminalNode *MINUS();
+
+   
+  };
+
+  KU_StartWithContext* kU_StartWith();
+
+  class  KU_CycleContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CycleContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CYCLE();
+    antlr4::tree::TerminalNode *NO();
+    antlr4::tree::TerminalNode *SP();
+
+   
+  };
+
+  KU_CycleContext* kU_Cycle();
+
+  class  KU_IfExistsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_IfExistsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *IF();
+    antlr4::tree::TerminalNode *SP();
+    antlr4::tree::TerminalNode *EXISTS();
+
+   
+  };
+
+  KU_IfExistsContext* kU_IfExists();
+
+  class  KU_DropContext : public antlr4::ParserRuleContext {
+  public:
+    KU_DropContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DROP();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_SchemaNameContext *oC_SchemaName();
+    antlr4::tree::TerminalNode *TABLE();
+    antlr4::tree::TerminalNode *SEQUENCE();
+    antlr4::tree::TerminalNode *MACRO();
+    KU_IfExistsContext *kU_IfExists();
+
+   
+  };
+
+  KU_DropContext* kU_Drop();
+
+  class  KU_AlterTableContext : public antlr4::ParserRuleContext {
+  public:
+    KU_AlterTableContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *ALTER();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *TABLE();
+    OC_SchemaNameContext *oC_SchemaName();
+    KU_AlterOptionsContext *kU_AlterOptions();
+
+   
+  };
+
+  KU_AlterTableContext* kU_AlterTable();
+
+  class  KU_AlterOptionsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_AlterOptionsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    KU_AddPropertyContext *kU_AddProperty();
+    KU_DropPropertyContext *kU_DropProperty();
+    KU_RenameTableContext *kU_RenameTable();
+    KU_RenamePropertyContext *kU_RenameProperty();
+    KU_AddFromToConnectionContext *kU_AddFromToConnection();
+    KU_DropFromToConnectionContext *kU_DropFromToConnection();
+
+   
+  };
+
+  KU_AlterOptionsContext* kU_AlterOptions();
+
+  class  KU_AddPropertyContext : public antlr4::ParserRuleContext {
+  public:
+    KU_AddPropertyContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *ADD();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_PropertyKeyNameContext *oC_PropertyKeyName();
+    KU_DataTypeContext *kU_DataType();
+    KU_IfNotExistsContext *kU_IfNotExists();
+    KU_DefaultContext *kU_Default();
+
+   
+  };
+
+  KU_AddPropertyContext* kU_AddProperty();
+
+  class  KU_DefaultContext : public antlr4::ParserRuleContext {
+  public:
+    KU_DefaultContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DEFAULT();
+    antlr4::tree::TerminalNode *SP();
+    OC_ExpressionContext *oC_Expression();
+
+   
+  };
+
+  KU_DefaultContext* kU_Default();
+
+  class  KU_DropPropertyContext : public antlr4::ParserRuleContext {
+  public:
+    KU_DropPropertyContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DROP();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_PropertyKeyNameContext *oC_PropertyKeyName();
+    KU_IfExistsContext *kU_IfExists();
+
+   
+  };
+
+  KU_DropPropertyContext* kU_DropProperty();
+
+  class  KU_RenameTableContext : public antlr4::ParserRuleContext {
+  public:
+    KU_RenameTableContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *RENAME();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *TO();
+    OC_SchemaNameContext *oC_SchemaName();
+
+   
+  };
+
+  KU_RenameTableContext* kU_RenameTable();
+
+  class  KU_RenamePropertyContext : public antlr4::ParserRuleContext {
+  public:
+    KU_RenamePropertyContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *RENAME();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<OC_PropertyKeyNameContext *> oC_PropertyKeyName();
+    OC_PropertyKeyNameContext* oC_PropertyKeyName(size_t i);
+    antlr4::tree::TerminalNode *TO();
+
+   
+  };
+
+  KU_RenamePropertyContext* kU_RenameProperty();
+
+  class  KU_AddFromToConnectionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_AddFromToConnectionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *ADD();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    KU_FromToConnectionContext *kU_FromToConnection();
+    KU_IfNotExistsContext *kU_IfNotExists();
+
+   
+  };
+
+  KU_AddFromToConnectionContext* kU_AddFromToConnection();
+
+  class  KU_DropFromToConnectionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_DropFromToConnectionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DROP();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    KU_FromToConnectionContext *kU_FromToConnection();
+    KU_IfExistsContext *kU_IfExists();
+
+   
+  };
+
+  KU_DropFromToConnectionContext* kU_DropFromToConnection();
+
+  class  KU_ColumnDefinitionsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ColumnDefinitionsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_ColumnDefinitionContext *> kU_ColumnDefinition();
+    KU_ColumnDefinitionContext* kU_ColumnDefinition(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_ColumnDefinitionsContext* kU_ColumnDefinitions();
+
+  class  KU_ColumnDefinitionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ColumnDefinitionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_PropertyKeyNameContext *oC_PropertyKeyName();
+    antlr4::tree::TerminalNode *SP();
+    KU_DataTypeContext *kU_DataType();
+
+   
+  };
+
+  KU_ColumnDefinitionContext* kU_ColumnDefinition();
+
+  class  KU_PropertyDefinitionsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_PropertyDefinitionsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_PropertyDefinitionContext *> kU_PropertyDefinition();
+    KU_PropertyDefinitionContext* kU_PropertyDefinition(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_PropertyDefinitionsContext* kU_PropertyDefinitions();
+
+  class  KU_PropertyDefinitionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_PropertyDefinitionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    KU_ColumnDefinitionContext *kU_ColumnDefinition();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    KU_DefaultContext *kU_Default();
+    antlr4::tree::TerminalNode *PRIMARY();
+    antlr4::tree::TerminalNode *KEY();
+
+   
+  };
+
+  KU_PropertyDefinitionContext* kU_PropertyDefinition();
+
+  class  KU_CreateNodeConstraintContext : public antlr4::ParserRuleContext {
+  public:
+    KU_CreateNodeConstraintContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *PRIMARY();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *KEY();
+    OC_PropertyKeyNameContext *oC_PropertyKeyName();
+
+   
+  };
+
+  KU_CreateNodeConstraintContext* kU_CreateNodeConstraint();
+
+  class  KU_UnionTypeContext : public antlr4::ParserRuleContext {
+  public:
+    KU_UnionTypeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *UNION();
+    KU_ColumnDefinitionsContext *kU_ColumnDefinitions();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_UnionTypeContext* kU_UnionType();
+
+  class  KU_StructTypeContext : public antlr4::ParserRuleContext {
+  public:
+    KU_StructTypeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *STRUCT();
+    KU_ColumnDefinitionsContext *kU_ColumnDefinitions();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_StructTypeContext* kU_StructType();
+
+  class  KU_MapTypeContext : public antlr4::ParserRuleContext {
+  public:
+    KU_MapTypeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *MAP();
+    std::vector<KU_DataTypeContext *> kU_DataType();
+    KU_DataTypeContext* kU_DataType(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_MapTypeContext* kU_MapType();
+
+  class  KU_DecimalTypeContext : public antlr4::ParserRuleContext {
+  public:
+    KU_DecimalTypeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DECIMAL();
+    std::vector<OC_IntegerLiteralContext *> oC_IntegerLiteral();
+    OC_IntegerLiteralContext* oC_IntegerLiteral(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_DecimalTypeContext* kU_DecimalType();
+
+  class  KU_DataTypeContext : public antlr4::ParserRuleContext {
+  public:
+    KU_DataTypeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SymbolicNameContext *oC_SymbolicName();
+    KU_UnionTypeContext *kU_UnionType();
+    KU_StructTypeContext *kU_StructType();
+    KU_MapTypeContext *kU_MapType();
+    KU_DecimalTypeContext *kU_DecimalType();
+    KU_DataTypeContext *kU_DataType();
+    KU_ListIdentifiersContext *kU_ListIdentifiers();
+
+   
+  };
+
+  KU_DataTypeContext* kU_DataType();
+  KU_DataTypeContext* kU_DataType(int precedence);
+  class  KU_ListIdentifiersContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ListIdentifiersContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_ListIdentifierContext *> kU_ListIdentifier();
+    KU_ListIdentifierContext* kU_ListIdentifier(size_t i);
+
+   
+  };
+
+  KU_ListIdentifiersContext* kU_ListIdentifiers();
+
+  class  KU_ListIdentifierContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ListIdentifierContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_IntegerLiteralContext *oC_IntegerLiteral();
+
+   
+  };
+
+  KU_ListIdentifierContext* kU_ListIdentifier();
+
+  class  OC_AnyCypherOptionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_AnyCypherOptionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_ExplainContext *oC_Explain();
+    OC_ProfileContext *oC_Profile();
+
+   
+  };
+
+  OC_AnyCypherOptionContext* oC_AnyCypherOption();
+
+  class  OC_ExplainContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ExplainContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *EXPLAIN();
+    antlr4::tree::TerminalNode *SP();
+    antlr4::tree::TerminalNode *LOGICAL();
+
+   
+  };
+
+  OC_ExplainContext* oC_Explain();
+
+  class  OC_ProfileContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ProfileContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *PROFILE();
+
+   
+  };
+
+  OC_ProfileContext* oC_Profile();
+
+  class  KU_TransactionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_TransactionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *BEGIN();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *TRANSACTION();
+    antlr4::tree::TerminalNode *READ();
+    antlr4::tree::TerminalNode *ONLY();
+    antlr4::tree::TerminalNode *COMMIT();
+    antlr4::tree::TerminalNode *ROLLBACK();
+    antlr4::tree::TerminalNode *CHECKPOINT();
+
+   
+  };
+
+  KU_TransactionContext* kU_Transaction();
+
+  class  KU_ExtensionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ExtensionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    KU_LoadExtensionContext *kU_LoadExtension();
+    KU_InstallExtensionContext *kU_InstallExtension();
+    KU_UninstallExtensionContext *kU_UninstallExtension();
+    KU_UpdateExtensionContext *kU_UpdateExtension();
+
+   
+  };
+
+  KU_ExtensionContext* kU_Extension();
+
+  class  KU_LoadExtensionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_LoadExtensionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *LOAD();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *StringLiteral();
+    OC_VariableContext *oC_Variable();
+    antlr4::tree::TerminalNode *EXTENSION();
+
+   
+  };
+
+  KU_LoadExtensionContext* kU_LoadExtension();
+
+  class  KU_InstallExtensionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_InstallExtensionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *INSTALL();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_VariableContext *oC_Variable();
+    antlr4::tree::TerminalNode *FORCE();
+    antlr4::tree::TerminalNode *FROM();
+    antlr4::tree::TerminalNode *StringLiteral();
+
+   
+  };
+
+  KU_InstallExtensionContext* kU_InstallExtension();
+
+  class  KU_UninstallExtensionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_UninstallExtensionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *UNINSTALL();
+    antlr4::tree::TerminalNode *SP();
+    OC_VariableContext *oC_Variable();
+
+   
+  };
+
+  KU_UninstallExtensionContext* kU_UninstallExtension();
+
+  class  KU_UpdateExtensionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_UpdateExtensionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *UPDATE();
+    antlr4::tree::TerminalNode *SP();
+    OC_VariableContext *oC_Variable();
+
+   
+  };
+
+  KU_UpdateExtensionContext* kU_UpdateExtension();
+
+  class  OC_QueryContext : public antlr4::ParserRuleContext {
+  public:
+    OC_QueryContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_RegularQueryContext *oC_RegularQuery();
+
+   
+  };
+
+  OC_QueryContext* oC_Query();
+
+  class  OC_RegularQueryContext : public antlr4::ParserRuleContext {
+  public:
+    OC_RegularQueryContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SingleQueryContext *oC_SingleQuery();
+    std::vector<OC_UnionContext *> oC_Union();
+    OC_UnionContext* oC_Union(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<OC_ReturnContext *> oC_Return();
+    OC_ReturnContext* oC_Return(size_t i);
+
+   
+  };
+
+  OC_RegularQueryContext* oC_RegularQuery();
+
+  class  OC_UnionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_UnionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *UNION();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *ALL();
+    OC_SingleQueryContext *oC_SingleQuery();
+
+   
+  };
+
+  OC_UnionContext* oC_Union();
+
+  class  OC_SingleQueryContext : public antlr4::ParserRuleContext {
+  public:
+    OC_SingleQueryContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SinglePartQueryContext *oC_SinglePartQuery();
+    OC_MultiPartQueryContext *oC_MultiPartQuery();
+
+   
+  };
+
+  OC_SingleQueryContext* oC_SingleQuery();
+
+  class  OC_SinglePartQueryContext : public antlr4::ParserRuleContext {
+  public:
+    OC_SinglePartQueryContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_ReturnContext *oC_Return();
+    std::vector<OC_ReadingClauseContext *> oC_ReadingClause();
+    OC_ReadingClauseContext* oC_ReadingClause(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<OC_UpdatingClauseContext *> oC_UpdatingClause();
+    OC_UpdatingClauseContext* oC_UpdatingClause(size_t i);
+
+   
+  };
+
+  OC_SinglePartQueryContext* oC_SinglePartQuery();
+
+  class  OC_MultiPartQueryContext : public antlr4::ParserRuleContext {
+  public:
+    OC_MultiPartQueryContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SinglePartQueryContext *oC_SinglePartQuery();
+    std::vector<KU_QueryPartContext *> kU_QueryPart();
+    KU_QueryPartContext* kU_QueryPart(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_MultiPartQueryContext* oC_MultiPartQuery();
+
+  class  KU_QueryPartContext : public antlr4::ParserRuleContext {
+  public:
+    KU_QueryPartContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_WithContext *oC_With();
+    std::vector<OC_ReadingClauseContext *> oC_ReadingClause();
+    OC_ReadingClauseContext* oC_ReadingClause(size_t i);
+    std::vector<OC_UpdatingClauseContext *> oC_UpdatingClause();
+    OC_UpdatingClauseContext* oC_UpdatingClause(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_QueryPartContext* kU_QueryPart();
+
+  class  OC_UpdatingClauseContext : public antlr4::ParserRuleContext {
+  public:
+    OC_UpdatingClauseContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_CreateContext *oC_Create();
+    OC_MergeContext *oC_Merge();
+    OC_SetContext *oC_Set();
+    OC_DeleteContext *oC_Delete();
+
+   
+  };
+
+  OC_UpdatingClauseContext* oC_UpdatingClause();
+
+  class  OC_ReadingClauseContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ReadingClauseContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_MatchContext *oC_Match();
+    OC_UnwindContext *oC_Unwind();
+    KU_InQueryCallContext *kU_InQueryCall();
+    KU_LoadFromContext *kU_LoadFrom();
+
+   
+  };
+
+  OC_ReadingClauseContext* oC_ReadingClause();
+
+  class  KU_LoadFromContext : public antlr4::ParserRuleContext {
+  public:
+    KU_LoadFromContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *LOAD();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *FROM();
+    KU_ScanSourceContext *kU_ScanSource();
+    antlr4::tree::TerminalNode *WITH();
+    antlr4::tree::TerminalNode *HEADERS();
+    KU_ColumnDefinitionsContext *kU_ColumnDefinitions();
+    KU_OptionsContext *kU_Options();
+    OC_WhereContext *oC_Where();
+
+   
+  };
+
+  KU_LoadFromContext* kU_LoadFrom();
+
+  class  OC_YieldItemContext : public antlr4::ParserRuleContext {
+  public:
+    OC_YieldItemContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_VariableContext *> oC_Variable();
+    OC_VariableContext* oC_Variable(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *AS();
+
+   
+  };
+
+  OC_YieldItemContext* oC_YieldItem();
+
+  class  OC_YieldItemsContext : public antlr4::ParserRuleContext {
+  public:
+    OC_YieldItemsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_YieldItemContext *> oC_YieldItem();
+    OC_YieldItemContext* oC_YieldItem(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_YieldItemsContext* oC_YieldItems();
+
+  class  KU_InQueryCallContext : public antlr4::ParserRuleContext {
+  public:
+    KU_InQueryCallContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CALL();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_FunctionInvocationContext *oC_FunctionInvocation();
+    OC_WhereContext *oC_Where();
+    antlr4::tree::TerminalNode *YIELD();
+    OC_YieldItemsContext *oC_YieldItems();
+
+   
+  };
+
+  KU_InQueryCallContext* kU_InQueryCall();
+
+  class  OC_MatchContext : public antlr4::ParserRuleContext {
+  public:
+    OC_MatchContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *MATCH();
+    OC_PatternContext *oC_Pattern();
+    antlr4::tree::TerminalNode *OPTIONAL();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_WhereContext *oC_Where();
+    KU_HintContext *kU_Hint();
+
+   
+  };
+
+  OC_MatchContext* oC_Match();
+
+  class  KU_HintContext : public antlr4::ParserRuleContext {
+  public:
+    KU_HintContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *HINT();
+    antlr4::tree::TerminalNode *SP();
+    KU_JoinNodeContext *kU_JoinNode();
+
+   
+  };
+
+  KU_HintContext* kU_Hint();
+
+  class  KU_JoinNodeContext : public antlr4::ParserRuleContext {
+  public:
+    KU_JoinNodeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_JoinNodeContext *> kU_JoinNode();
+    KU_JoinNodeContext* kU_JoinNode(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<OC_SchemaNameContext *> oC_SchemaName();
+    OC_SchemaNameContext* oC_SchemaName(size_t i);
+    antlr4::tree::TerminalNode *JOIN();
+    std::vector<antlr4::tree::TerminalNode *> MULTI_JOIN();
+    antlr4::tree::TerminalNode* MULTI_JOIN(size_t i);
+
+   
+  };
+
+  KU_JoinNodeContext* kU_JoinNode();
+  KU_JoinNodeContext* kU_JoinNode(int precedence);
+  class  OC_UnwindContext : public antlr4::ParserRuleContext {
+  public:
+    OC_UnwindContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *UNWIND();
+    OC_ExpressionContext *oC_Expression();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *AS();
+    OC_VariableContext *oC_Variable();
+
+   
+  };
+
+  OC_UnwindContext* oC_Unwind();
+
+  class  OC_CreateContext : public antlr4::ParserRuleContext {
+  public:
+    OC_CreateContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *CREATE();
+    OC_PatternContext *oC_Pattern();
+    antlr4::tree::TerminalNode *SP();
+
+   
+  };
+
+  OC_CreateContext* oC_Create();
+
+  class  OC_MergeContext : public antlr4::ParserRuleContext {
+  public:
+    OC_MergeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *MERGE();
+    OC_PatternContext *oC_Pattern();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<OC_MergeActionContext *> oC_MergeAction();
+    OC_MergeActionContext* oC_MergeAction(size_t i);
+
+   
+  };
+
+  OC_MergeContext* oC_Merge();
+
+  class  OC_MergeActionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_MergeActionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *ON();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *MATCH();
+    OC_SetContext *oC_Set();
+    antlr4::tree::TerminalNode *CREATE();
+
+   
+  };
+
+  OC_MergeActionContext* oC_MergeAction();
+
+  class  OC_SetContext : public antlr4::ParserRuleContext {
+  public:
+    OC_SetContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *SET();
+    std::vector<OC_SetItemContext *> oC_SetItem();
+    OC_SetItemContext* oC_SetItem(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_AtomContext *oC_Atom();
+    KU_PropertiesContext *kU_Properties();
+
+   
+  };
+
+  OC_SetContext* oC_Set();
+
+  class  OC_SetItemContext : public antlr4::ParserRuleContext {
+  public:
+    OC_SetItemContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_PropertyExpressionContext *oC_PropertyExpression();
+    OC_ExpressionContext *oC_Expression();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_SetItemContext* oC_SetItem();
+
+  class  OC_DeleteContext : public antlr4::ParserRuleContext {
+  public:
+    OC_DeleteContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DELETE();
+    std::vector<OC_ExpressionContext *> oC_Expression();
+    OC_ExpressionContext* oC_Expression(size_t i);
+    antlr4::tree::TerminalNode *DETACH();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_DeleteContext* oC_Delete();
+
+  class  OC_WithContext : public antlr4::ParserRuleContext {
+  public:
+    OC_WithContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *WITH();
+    OC_ProjectionBodyContext *oC_ProjectionBody();
+    OC_WhereContext *oC_Where();
+    antlr4::tree::TerminalNode *SP();
+
+   
+  };
+
+  OC_WithContext* oC_With();
+
+  class  OC_ReturnContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ReturnContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *RETURN();
+    OC_ProjectionBodyContext *oC_ProjectionBody();
+
+   
+  };
+
+  OC_ReturnContext* oC_Return();
+
+  class  OC_ProjectionBodyContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ProjectionBodyContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_ProjectionItemsContext *oC_ProjectionItems();
+    antlr4::tree::TerminalNode *DISTINCT();
+    OC_OrderContext *oC_Order();
+    OC_SkipContext *oC_Skip();
+    OC_LimitContext *oC_Limit();
+
+   
+  };
+
+  OC_ProjectionBodyContext* oC_ProjectionBody();
+
+  class  OC_ProjectionItemsContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ProjectionItemsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *STAR();
+    std::vector<OC_ProjectionItemContext *> oC_ProjectionItem();
+    OC_ProjectionItemContext* oC_ProjectionItem(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_ProjectionItemsContext* oC_ProjectionItems();
+
+  class  OC_ProjectionItemContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ProjectionItemContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_ExpressionContext *oC_Expression();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *AS();
+    OC_VariableContext *oC_Variable();
+
+   
+  };
+
+  OC_ProjectionItemContext* oC_ProjectionItem();
+
+  class  OC_OrderContext : public antlr4::ParserRuleContext {
+  public:
+    OC_OrderContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *ORDER();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *BY();
+    std::vector<OC_SortItemContext *> oC_SortItem();
+    OC_SortItemContext* oC_SortItem(size_t i);
+
+   
+  };
+
+  OC_OrderContext* oC_Order();
+
+  class  OC_SkipContext : public antlr4::ParserRuleContext {
+  public:
+    OC_SkipContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *L_SKIP();
+    antlr4::tree::TerminalNode *SP();
+    OC_ExpressionContext *oC_Expression();
+
+   
+  };
+
+  OC_SkipContext* oC_Skip();
+
+  class  OC_LimitContext : public antlr4::ParserRuleContext {
+  public:
+    OC_LimitContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *LIMIT();
+    antlr4::tree::TerminalNode *SP();
+    OC_ExpressionContext *oC_Expression();
+
+   
+  };
+
+  OC_LimitContext* oC_Limit();
+
+  class  OC_SortItemContext : public antlr4::ParserRuleContext {
+  public:
+    OC_SortItemContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_ExpressionContext *oC_Expression();
+    antlr4::tree::TerminalNode *ASCENDING();
+    antlr4::tree::TerminalNode *ASC();
+    antlr4::tree::TerminalNode *DESCENDING();
+    antlr4::tree::TerminalNode *DESC();
+    antlr4::tree::TerminalNode *SP();
+
+   
+  };
+
+  OC_SortItemContext* oC_SortItem();
+
+  class  OC_WhereContext : public antlr4::ParserRuleContext {
+  public:
+    OC_WhereContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *WHERE();
+    antlr4::tree::TerminalNode *SP();
+    OC_ExpressionContext *oC_Expression();
+
+   
+  };
+
+  OC_WhereContext* oC_Where();
+
+  class  OC_PatternContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PatternContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_PatternPartContext *> oC_PatternPart();
+    OC_PatternPartContext* oC_PatternPart(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_PatternContext* oC_Pattern();
+
+  class  OC_PatternPartContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PatternPartContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_VariableContext *oC_Variable();
+    OC_AnonymousPatternPartContext *oC_AnonymousPatternPart();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_PatternPartContext* oC_PatternPart();
+
+  class  OC_AnonymousPatternPartContext : public antlr4::ParserRuleContext {
+  public:
+    OC_AnonymousPatternPartContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_PatternElementContext *oC_PatternElement();
+
+   
+  };
+
+  OC_AnonymousPatternPartContext* oC_AnonymousPatternPart();
+
+  class  OC_PatternElementContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PatternElementContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_NodePatternContext *oC_NodePattern();
+    std::vector<OC_PatternElementChainContext *> oC_PatternElementChain();
+    OC_PatternElementChainContext* oC_PatternElementChain(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_PatternElementContext *oC_PatternElement();
+
+   
+  };
+
+  OC_PatternElementContext* oC_PatternElement();
+
+  class  OC_NodePatternContext : public antlr4::ParserRuleContext {
+  public:
+    OC_NodePatternContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_VariableContext *oC_Variable();
+    OC_NodeLabelsContext *oC_NodeLabels();
+    KU_PropertiesContext *kU_Properties();
+
+   
+  };
+
+  OC_NodePatternContext* oC_NodePattern();
+
+  class  OC_PatternElementChainContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PatternElementChainContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_RelationshipPatternContext *oC_RelationshipPattern();
+    OC_NodePatternContext *oC_NodePattern();
+    antlr4::tree::TerminalNode *SP();
+
+   
+  };
+
+  OC_PatternElementChainContext* oC_PatternElementChain();
+
+  class  OC_RelationshipPatternContext : public antlr4::ParserRuleContext {
+  public:
+    OC_RelationshipPatternContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_LeftArrowHeadContext *oC_LeftArrowHead();
+    std::vector<OC_DashContext *> oC_Dash();
+    OC_DashContext* oC_Dash(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_RelationshipDetailContext *oC_RelationshipDetail();
+    OC_RightArrowHeadContext *oC_RightArrowHead();
+
+   
+  };
+
+  OC_RelationshipPatternContext* oC_RelationshipPattern();
+
+  class  OC_RelationshipDetailContext : public antlr4::ParserRuleContext {
+  public:
+    OC_RelationshipDetailContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_VariableContext *oC_Variable();
+    OC_RelationshipTypesContext *oC_RelationshipTypes();
+    KU_RecursiveDetailContext *kU_RecursiveDetail();
+    KU_PropertiesContext *kU_Properties();
+
+   
+  };
+
+  OC_RelationshipDetailContext* oC_RelationshipDetail();
+
+  class  KU_PropertiesContext : public antlr4::ParserRuleContext {
+  public:
+    KU_PropertiesContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<OC_PropertyKeyNameContext *> oC_PropertyKeyName();
+    OC_PropertyKeyNameContext* oC_PropertyKeyName(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> COLON();
+    antlr4::tree::TerminalNode* COLON(size_t i);
+    std::vector<OC_ExpressionContext *> oC_Expression();
+    OC_ExpressionContext* oC_Expression(size_t i);
+
+   
+  };
+
+  KU_PropertiesContext* kU_Properties();
+
+  class  OC_RelationshipTypesContext : public antlr4::ParserRuleContext {
+  public:
+    OC_RelationshipTypesContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> COLON();
+    antlr4::tree::TerminalNode* COLON(size_t i);
+    std::vector<OC_RelTypeNameContext *> oC_RelTypeName();
+    OC_RelTypeNameContext* oC_RelTypeName(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_RelationshipTypesContext* oC_RelationshipTypes();
+
+  class  OC_NodeLabelsContext : public antlr4::ParserRuleContext {
+  public:
+    OC_NodeLabelsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> COLON();
+    antlr4::tree::TerminalNode* COLON(size_t i);
+    std::vector<OC_LabelNameContext *> oC_LabelName();
+    OC_LabelNameContext* oC_LabelName(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_NodeLabelsContext* oC_NodeLabels();
+
+  class  KU_RecursiveDetailContext : public antlr4::ParserRuleContext {
+  public:
+    KU_RecursiveDetailContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *STAR();
+    KU_RecursiveTypeContext *kU_RecursiveType();
+    OC_RangeLiteralContext *oC_RangeLiteral();
+    KU_RecursiveComprehensionContext *kU_RecursiveComprehension();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_RecursiveDetailContext* kU_RecursiveDetail();
+
+  class  KU_RecursiveTypeContext : public antlr4::ParserRuleContext {
+  public:
+    KU_RecursiveTypeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *WSHORTEST();
+    OC_PropertyKeyNameContext *oC_PropertyKeyName();
+    antlr4::tree::TerminalNode *ALL();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *SHORTEST();
+    antlr4::tree::TerminalNode *TRAIL();
+    antlr4::tree::TerminalNode *ACYCLIC();
+
+   
+  };
+
+  KU_RecursiveTypeContext* kU_RecursiveType();
+
+  class  OC_RangeLiteralContext : public antlr4::ParserRuleContext {
+  public:
+    OC_RangeLiteralContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DOTDOT();
+    OC_LowerBoundContext *oC_LowerBound();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_UpperBoundContext *oC_UpperBound();
+    OC_IntegerLiteralContext *oC_IntegerLiteral();
+
+   
+  };
+
+  OC_RangeLiteralContext* oC_RangeLiteral();
+
+  class  KU_RecursiveComprehensionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_RecursiveComprehensionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_VariableContext *> oC_Variable();
+    OC_VariableContext* oC_Variable(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_WhereContext *oC_Where();
+    std::vector<KU_RecursiveProjectionItemsContext *> kU_RecursiveProjectionItems();
+    KU_RecursiveProjectionItemsContext* kU_RecursiveProjectionItems(size_t i);
+
+   
+  };
+
+  KU_RecursiveComprehensionContext* kU_RecursiveComprehension();
+
+  class  KU_RecursiveProjectionItemsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_RecursiveProjectionItemsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_ProjectionItemsContext *oC_ProjectionItems();
+
+   
+  };
+
+  KU_RecursiveProjectionItemsContext* kU_RecursiveProjectionItems();
+
+  class  OC_LowerBoundContext : public antlr4::ParserRuleContext {
+  public:
+    OC_LowerBoundContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DecimalInteger();
+
+   
+  };
+
+  OC_LowerBoundContext* oC_LowerBound();
+
+  class  OC_UpperBoundContext : public antlr4::ParserRuleContext {
+  public:
+    OC_UpperBoundContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DecimalInteger();
+
+   
+  };
+
+  OC_UpperBoundContext* oC_UpperBound();
+
+  class  OC_LabelNameContext : public antlr4::ParserRuleContext {
+  public:
+    OC_LabelNameContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SchemaNameContext *oC_SchemaName();
+
+   
+  };
+
+  OC_LabelNameContext* oC_LabelName();
+
+  class  OC_RelTypeNameContext : public antlr4::ParserRuleContext {
+  public:
+    OC_RelTypeNameContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SchemaNameContext *oC_SchemaName();
+
+   
+  };
+
+  OC_RelTypeNameContext* oC_RelTypeName();
+
+  class  OC_ExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_OrExpressionContext *oC_OrExpression();
+
+   
+  };
+
+  OC_ExpressionContext* oC_Expression();
+
+  class  OC_OrExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_OrExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_XorExpressionContext *> oC_XorExpression();
+    OC_XorExpressionContext* oC_XorExpression(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> OR();
+    antlr4::tree::TerminalNode* OR(size_t i);
+
+   
+  };
+
+  OC_OrExpressionContext* oC_OrExpression();
+
+  class  OC_XorExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_XorExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_AndExpressionContext *> oC_AndExpression();
+    OC_AndExpressionContext* oC_AndExpression(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> XOR();
+    antlr4::tree::TerminalNode* XOR(size_t i);
+
+   
+  };
+
+  OC_XorExpressionContext* oC_XorExpression();
+
+  class  OC_AndExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_AndExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_NotExpressionContext *> oC_NotExpression();
+    OC_NotExpressionContext* oC_NotExpression(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> AND();
+    antlr4::tree::TerminalNode* AND(size_t i);
+
+   
+  };
+
+  OC_AndExpressionContext* oC_AndExpression();
+
+  class  OC_NotExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_NotExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_ComparisonExpressionContext *oC_ComparisonExpression();
+    std::vector<antlr4::tree::TerminalNode *> NOT();
+    antlr4::tree::TerminalNode* NOT(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_NotExpressionContext* oC_NotExpression();
+
+  class  OC_ComparisonExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    antlr4::Token *invalid_not_equalToken = nullptr;
+    OC_ComparisonExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_BitwiseOrOperatorExpressionContext *> kU_BitwiseOrOperatorExpression();
+    KU_BitwiseOrOperatorExpressionContext* kU_BitwiseOrOperatorExpression(size_t i);
+    std::vector<KU_ComparisonOperatorContext *> kU_ComparisonOperator();
+    KU_ComparisonOperatorContext* kU_ComparisonOperator(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *INVALID_NOT_EQUAL();
+
+   
+  };
+
+  OC_ComparisonExpressionContext* oC_ComparisonExpression();
+
+  class  KU_ComparisonOperatorContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ComparisonOperatorContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+
+   
+  };
+
+  KU_ComparisonOperatorContext* kU_ComparisonOperator();
+
+  class  KU_BitwiseOrOperatorExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_BitwiseOrOperatorExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_BitwiseAndOperatorExpressionContext *> kU_BitwiseAndOperatorExpression();
+    KU_BitwiseAndOperatorExpressionContext* kU_BitwiseAndOperatorExpression(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_BitwiseOrOperatorExpressionContext* kU_BitwiseOrOperatorExpression();
+
+  class  KU_BitwiseAndOperatorExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_BitwiseAndOperatorExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_BitShiftOperatorExpressionContext *> kU_BitShiftOperatorExpression();
+    KU_BitShiftOperatorExpressionContext* kU_BitShiftOperatorExpression(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_BitwiseAndOperatorExpressionContext* kU_BitwiseAndOperatorExpression();
+
+  class  KU_BitShiftOperatorExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    KU_BitShiftOperatorExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_AddOrSubtractExpressionContext *> oC_AddOrSubtractExpression();
+    OC_AddOrSubtractExpressionContext* oC_AddOrSubtractExpression(size_t i);
+    std::vector<KU_BitShiftOperatorContext *> kU_BitShiftOperator();
+    KU_BitShiftOperatorContext* kU_BitShiftOperator(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_BitShiftOperatorExpressionContext* kU_BitShiftOperatorExpression();
+
+  class  KU_BitShiftOperatorContext : public antlr4::ParserRuleContext {
+  public:
+    KU_BitShiftOperatorContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+
+   
+  };
+
+  KU_BitShiftOperatorContext* kU_BitShiftOperator();
+
+  class  OC_AddOrSubtractExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_AddOrSubtractExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_MultiplyDivideModuloExpressionContext *> oC_MultiplyDivideModuloExpression();
+    OC_MultiplyDivideModuloExpressionContext* oC_MultiplyDivideModuloExpression(size_t i);
+    std::vector<KU_AddOrSubtractOperatorContext *> kU_AddOrSubtractOperator();
+    KU_AddOrSubtractOperatorContext* kU_AddOrSubtractOperator(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_AddOrSubtractExpressionContext* oC_AddOrSubtractExpression();
+
+  class  KU_AddOrSubtractOperatorContext : public antlr4::ParserRuleContext {
+  public:
+    KU_AddOrSubtractOperatorContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *MINUS();
+
+   
+  };
+
+  KU_AddOrSubtractOperatorContext* kU_AddOrSubtractOperator();
+
+  class  OC_MultiplyDivideModuloExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_MultiplyDivideModuloExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_PowerOfExpressionContext *> oC_PowerOfExpression();
+    OC_PowerOfExpressionContext* oC_PowerOfExpression(size_t i);
+    std::vector<KU_MultiplyDivideModuloOperatorContext *> kU_MultiplyDivideModuloOperator();
+    KU_MultiplyDivideModuloOperatorContext* kU_MultiplyDivideModuloOperator(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_MultiplyDivideModuloExpressionContext* oC_MultiplyDivideModuloExpression();
+
+  class  KU_MultiplyDivideModuloOperatorContext : public antlr4::ParserRuleContext {
+  public:
+    KU_MultiplyDivideModuloOperatorContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *STAR();
+
+   
+  };
+
+  KU_MultiplyDivideModuloOperatorContext* kU_MultiplyDivideModuloOperator();
+
+  class  OC_PowerOfExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PowerOfExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_StringListNullOperatorExpressionContext *> oC_StringListNullOperatorExpression();
+    OC_StringListNullOperatorExpressionContext* oC_StringListNullOperatorExpression(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_PowerOfExpressionContext* oC_PowerOfExpression();
+
+  class  OC_StringListNullOperatorExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_StringListNullOperatorExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_UnaryAddSubtractOrFactorialExpressionContext *oC_UnaryAddSubtractOrFactorialExpression();
+    OC_StringOperatorExpressionContext *oC_StringOperatorExpression();
+    OC_NullOperatorExpressionContext *oC_NullOperatorExpression();
+    std::vector<OC_ListOperatorExpressionContext *> oC_ListOperatorExpression();
+    OC_ListOperatorExpressionContext* oC_ListOperatorExpression(size_t i);
+
+   
+  };
+
+  OC_StringListNullOperatorExpressionContext* oC_StringListNullOperatorExpression();
+
+  class  OC_ListOperatorExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ListOperatorExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *IN();
+    OC_PropertyOrLabelsExpressionContext *oC_PropertyOrLabelsExpression();
+    std::vector<OC_ExpressionContext *> oC_Expression();
+    OC_ExpressionContext* oC_Expression(size_t i);
+    antlr4::tree::TerminalNode *COLON();
+    antlr4::tree::TerminalNode *DOTDOT();
+
+   
+  };
+
+  OC_ListOperatorExpressionContext* oC_ListOperatorExpression();
+
+  class  OC_StringOperatorExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_StringOperatorExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_PropertyOrLabelsExpressionContext *oC_PropertyOrLabelsExpression();
+    OC_RegularExpressionContext *oC_RegularExpression();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *STARTS();
+    antlr4::tree::TerminalNode *WITH();
+    antlr4::tree::TerminalNode *ENDS();
+    antlr4::tree::TerminalNode *CONTAINS();
+
+   
+  };
+
+  OC_StringOperatorExpressionContext* oC_StringOperatorExpression();
+
+  class  OC_RegularExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_RegularExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *SP();
+
+   
+  };
+
+  OC_RegularExpressionContext* oC_RegularExpression();
+
+  class  OC_NullOperatorExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_NullOperatorExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *IS();
+    antlr4::tree::TerminalNode *NULL_();
+    antlr4::tree::TerminalNode *NOT();
+
+   
+  };
+
+  OC_NullOperatorExpressionContext* oC_NullOperatorExpression();
+
+  class  OC_UnaryAddSubtractOrFactorialExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_UnaryAddSubtractOrFactorialExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_PropertyOrLabelsExpressionContext *oC_PropertyOrLabelsExpression();
+    std::vector<antlr4::tree::TerminalNode *> MINUS();
+    antlr4::tree::TerminalNode* MINUS(size_t i);
+    antlr4::tree::TerminalNode *FACTORIAL();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_UnaryAddSubtractOrFactorialExpressionContext* oC_UnaryAddSubtractOrFactorialExpression();
+
+  class  OC_PropertyOrLabelsExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PropertyOrLabelsExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_AtomContext *oC_Atom();
+    std::vector<OC_PropertyLookupContext *> oC_PropertyLookup();
+    OC_PropertyLookupContext* oC_PropertyLookup(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_PropertyOrLabelsExpressionContext* oC_PropertyOrLabelsExpression();
+
+  class  OC_AtomContext : public antlr4::ParserRuleContext {
+  public:
+    OC_AtomContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_LiteralContext *oC_Literal();
+    OC_ParameterContext *oC_Parameter();
+    OC_CaseExpressionContext *oC_CaseExpression();
+    OC_ParenthesizedExpressionContext *oC_ParenthesizedExpression();
+    OC_FunctionInvocationContext *oC_FunctionInvocation();
+    OC_PathPatternsContext *oC_PathPatterns();
+    OC_ExistCountSubqueryContext *oC_ExistCountSubquery();
+    OC_VariableContext *oC_Variable();
+    OC_QuantifierContext *oC_Quantifier();
+
+   
+  };
+
+  OC_AtomContext* oC_Atom();
+
+  class  OC_QuantifierContext : public antlr4::ParserRuleContext {
+  public:
+    OC_QuantifierContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *ALL();
+    OC_FilterExpressionContext *oC_FilterExpression();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *ANY();
+    antlr4::tree::TerminalNode *NONE();
+    antlr4::tree::TerminalNode *SINGLE();
+
+   
+  };
+
+  OC_QuantifierContext* oC_Quantifier();
+
+  class  OC_FilterExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_FilterExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_IdInCollContext *oC_IdInColl();
+    antlr4::tree::TerminalNode *SP();
+    OC_WhereContext *oC_Where();
+
+   
+  };
+
+  OC_FilterExpressionContext* oC_FilterExpression();
+
+  class  OC_IdInCollContext : public antlr4::ParserRuleContext {
+  public:
+    OC_IdInCollContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_VariableContext *oC_Variable();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *IN();
+    OC_ExpressionContext *oC_Expression();
+
+   
+  };
+
+  OC_IdInCollContext* oC_IdInColl();
+
+  class  OC_LiteralContext : public antlr4::ParserRuleContext {
+  public:
+    OC_LiteralContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_NumberLiteralContext *oC_NumberLiteral();
+    antlr4::tree::TerminalNode *StringLiteral();
+    OC_BooleanLiteralContext *oC_BooleanLiteral();
+    antlr4::tree::TerminalNode *NULL_();
+    OC_ListLiteralContext *oC_ListLiteral();
+    KU_StructLiteralContext *kU_StructLiteral();
+
+   
+  };
+
+  OC_LiteralContext* oC_Literal();
+
+  class  OC_BooleanLiteralContext : public antlr4::ParserRuleContext {
+  public:
+    OC_BooleanLiteralContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *TRUE();
+    antlr4::tree::TerminalNode *FALSE();
+
+   
+  };
+
+  OC_BooleanLiteralContext* oC_BooleanLiteral();
+
+  class  OC_ListLiteralContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ListLiteralContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_ExpressionContext *oC_Expression();
+    std::vector<KU_ListEntryContext *> kU_ListEntry();
+    KU_ListEntryContext* kU_ListEntry(size_t i);
+
+   
+  };
+
+  OC_ListLiteralContext* oC_ListLiteral();
+
+  class  KU_ListEntryContext : public antlr4::ParserRuleContext {
+  public:
+    KU_ListEntryContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *SP();
+    OC_ExpressionContext *oC_Expression();
+
+   
+  };
+
+  KU_ListEntryContext* kU_ListEntry();
+
+  class  KU_StructLiteralContext : public antlr4::ParserRuleContext {
+  public:
+    KU_StructLiteralContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<KU_StructFieldContext *> kU_StructField();
+    KU_StructFieldContext* kU_StructField(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_StructLiteralContext* kU_StructLiteral();
+
+  class  KU_StructFieldContext : public antlr4::ParserRuleContext {
+  public:
+    KU_StructFieldContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *COLON();
+    OC_ExpressionContext *oC_Expression();
+    OC_SymbolicNameContext *oC_SymbolicName();
+    antlr4::tree::TerminalNode *StringLiteral();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_StructFieldContext* kU_StructField();
+
+  class  OC_ParenthesizedExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ParenthesizedExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_ExpressionContext *oC_Expression();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_ParenthesizedExpressionContext* oC_ParenthesizedExpression();
+
+  class  OC_FunctionInvocationContext : public antlr4::ParserRuleContext {
+  public:
+    OC_FunctionInvocationContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *COUNT();
+    antlr4::tree::TerminalNode *STAR();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *CAST();
+    std::vector<KU_FunctionParameterContext *> kU_FunctionParameter();
+    KU_FunctionParameterContext* kU_FunctionParameter(size_t i);
+    antlr4::tree::TerminalNode *AS();
+    KU_DataTypeContext *kU_DataType();
+    OC_FunctionNameContext *oC_FunctionName();
+    antlr4::tree::TerminalNode *DISTINCT();
+
+   
+  };
+
+  OC_FunctionInvocationContext* oC_FunctionInvocation();
+
+  class  OC_FunctionNameContext : public antlr4::ParserRuleContext {
+  public:
+    OC_FunctionNameContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SymbolicNameContext *oC_SymbolicName();
+
+   
+  };
+
+  OC_FunctionNameContext* oC_FunctionName();
+
+  class  KU_FunctionParameterContext : public antlr4::ParserRuleContext {
+  public:
+    KU_FunctionParameterContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_ExpressionContext *oC_Expression();
+    OC_SymbolicNameContext *oC_SymbolicName();
+    antlr4::tree::TerminalNode *COLON();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    KU_LambdaParameterContext *kU_LambdaParameter();
+
+   
+  };
+
+  KU_FunctionParameterContext* kU_FunctionParameter();
+
+  class  KU_LambdaParameterContext : public antlr4::ParserRuleContext {
+  public:
+    KU_LambdaParameterContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    KU_LambdaVarsContext *kU_LambdaVars();
+    antlr4::tree::TerminalNode *MINUS();
+    OC_ExpressionContext *oC_Expression();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_LambdaParameterContext* kU_LambdaParameter();
+
+  class  KU_LambdaVarsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_LambdaVarsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    std::vector<OC_SymbolicNameContext *> oC_SymbolicName();
+    OC_SymbolicNameContext* oC_SymbolicName(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  KU_LambdaVarsContext* kU_LambdaVars();
+
+  class  OC_PathPatternsContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PathPatternsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_NodePatternContext *oC_NodePattern();
+    std::vector<OC_PatternElementChainContext *> oC_PatternElementChain();
+    OC_PatternElementChainContext* oC_PatternElementChain(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_PathPatternsContext* oC_PathPatterns();
+
+  class  OC_ExistCountSubqueryContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ExistCountSubqueryContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *MATCH();
+    OC_PatternContext *oC_Pattern();
+    antlr4::tree::TerminalNode *EXISTS();
+    antlr4::tree::TerminalNode *COUNT();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    OC_WhereContext *oC_Where();
+    KU_HintContext *kU_Hint();
+
+   
+  };
+
+  OC_ExistCountSubqueryContext* oC_ExistCountSubquery();
+
+  class  OC_PropertyLookupContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PropertyLookupContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_PropertyKeyNameContext *oC_PropertyKeyName();
+    antlr4::tree::TerminalNode *STAR();
+    antlr4::tree::TerminalNode *SP();
+
+   
+  };
+
+  OC_PropertyLookupContext* oC_PropertyLookup();
+
+  class  OC_CaseExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_CaseExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *END();
+    antlr4::tree::TerminalNode *ELSE();
+    std::vector<OC_ExpressionContext *> oC_Expression();
+    OC_ExpressionContext* oC_Expression(size_t i);
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+    antlr4::tree::TerminalNode *CASE();
+    std::vector<OC_CaseAlternativeContext *> oC_CaseAlternative();
+    OC_CaseAlternativeContext* oC_CaseAlternative(size_t i);
+
+   
+  };
+
+  OC_CaseExpressionContext* oC_CaseExpression();
+
+  class  OC_CaseAlternativeContext : public antlr4::ParserRuleContext {
+  public:
+    OC_CaseAlternativeContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *WHEN();
+    std::vector<OC_ExpressionContext *> oC_Expression();
+    OC_ExpressionContext* oC_Expression(size_t i);
+    antlr4::tree::TerminalNode *THEN();
+    std::vector<antlr4::tree::TerminalNode *> SP();
+    antlr4::tree::TerminalNode* SP(size_t i);
+
+   
+  };
+
+  OC_CaseAlternativeContext* oC_CaseAlternative();
+
+  class  OC_VariableContext : public antlr4::ParserRuleContext {
+  public:
+    OC_VariableContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SymbolicNameContext *oC_SymbolicName();
+
+   
+  };
+
+  OC_VariableContext* oC_Variable();
+
+  class  OC_NumberLiteralContext : public antlr4::ParserRuleContext {
+  public:
+    OC_NumberLiteralContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_DoubleLiteralContext *oC_DoubleLiteral();
+    OC_IntegerLiteralContext *oC_IntegerLiteral();
+
+   
+  };
+
+  OC_NumberLiteralContext* oC_NumberLiteral();
+
+  class  OC_ParameterContext : public antlr4::ParserRuleContext {
+  public:
+    OC_ParameterContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SymbolicNameContext *oC_SymbolicName();
+    antlr4::tree::TerminalNode *DecimalInteger();
+
+   
+  };
+
+  OC_ParameterContext* oC_Parameter();
+
+  class  OC_PropertyExpressionContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PropertyExpressionContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_AtomContext *oC_Atom();
+    OC_PropertyLookupContext *oC_PropertyLookup();
+    antlr4::tree::TerminalNode *SP();
+
+   
+  };
+
+  OC_PropertyExpressionContext* oC_PropertyExpression();
+
+  class  OC_PropertyKeyNameContext : public antlr4::ParserRuleContext {
+  public:
+    OC_PropertyKeyNameContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SchemaNameContext *oC_SchemaName();
+
+   
+  };
+
+  OC_PropertyKeyNameContext* oC_PropertyKeyName();
+
+  class  OC_IntegerLiteralContext : public antlr4::ParserRuleContext {
+  public:
+    OC_IntegerLiteralContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *DecimalInteger();
+
+   
+  };
+
+  OC_IntegerLiteralContext* oC_IntegerLiteral();
+
+  class  OC_DoubleLiteralContext : public antlr4::ParserRuleContext {
+  public:
+    OC_DoubleLiteralContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *ExponentDecimalReal();
+    antlr4::tree::TerminalNode *RegularDecimalReal();
+
+   
+  };
+
+  OC_DoubleLiteralContext* oC_DoubleLiteral();
+
+  class  OC_SchemaNameContext : public antlr4::ParserRuleContext {
+  public:
+    OC_SchemaNameContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    OC_SymbolicNameContext *oC_SymbolicName();
+
+   
+  };
+
+  OC_SchemaNameContext* oC_SchemaName();
+
+  class  OC_SymbolicNameContext : public antlr4::ParserRuleContext {
+  public:
+    antlr4::Token *escapedsymbolicnameToken = nullptr;
+    OC_SymbolicNameContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *UnescapedSymbolicName();
+    antlr4::tree::TerminalNode *EscapedSymbolicName();
+    antlr4::tree::TerminalNode *HexLetter();
+    KU_NonReservedKeywordsContext *kU_NonReservedKeywords();
+
+   
+  };
+
+  OC_SymbolicNameContext* oC_SymbolicName();
+
+  class  KU_NonReservedKeywordsContext : public antlr4::ParserRuleContext {
+  public:
+    KU_NonReservedKeywordsContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *COMMENT();
+    antlr4::tree::TerminalNode *ADD();
+    antlr4::tree::TerminalNode *ALTER();
+    antlr4::tree::TerminalNode *AS();
+    antlr4::tree::TerminalNode *ATTACH();
+    antlr4::tree::TerminalNode *BEGIN();
+    antlr4::tree::TerminalNode *BY();
+    antlr4::tree::TerminalNode *CALL();
+    antlr4::tree::TerminalNode *CHECKPOINT();
+    antlr4::tree::TerminalNode *COMMIT();
+    antlr4::tree::TerminalNode *CONTAINS();
+    antlr4::tree::TerminalNode *COPY();
+    antlr4::tree::TerminalNode *COUNT();
+    antlr4::tree::TerminalNode *CYCLE();
+    antlr4::tree::TerminalNode *DATABASE();
+    antlr4::tree::TerminalNode *DECIMAL();
+    antlr4::tree::TerminalNode *DELETE();
+    antlr4::tree::TerminalNode *DETACH();
+    antlr4::tree::TerminalNode *DROP();
+    antlr4::tree::TerminalNode *EXPLAIN();
+    antlr4::tree::TerminalNode *EXPORT();
+    antlr4::tree::TerminalNode *EXTENSION();
+    antlr4::tree::TerminalNode *FORCE();
+    antlr4::tree::TerminalNode *GRAPH();
+    antlr4::tree::TerminalNode *IF();
+    antlr4::tree::TerminalNode *IS();
+    antlr4::tree::TerminalNode *IMPORT();
+    antlr4::tree::TerminalNode *INCREMENT();
+    antlr4::tree::TerminalNode *KEY();
+    antlr4::tree::TerminalNode *LOAD();
+    antlr4::tree::TerminalNode *LOGICAL();
+    antlr4::tree::TerminalNode *MATCH();
+    antlr4::tree::TerminalNode *MAXVALUE();
+    antlr4::tree::TerminalNode *MERGE();
+    antlr4::tree::TerminalNode *MINVALUE();
+    antlr4::tree::TerminalNode *NO();
+    antlr4::tree::TerminalNode *NODE();
+    antlr4::tree::TerminalNode *PROJECT();
+    antlr4::tree::TerminalNode *READ();
+    antlr4::tree::TerminalNode *REL();
+    antlr4::tree::TerminalNode *RENAME();
+    antlr4::tree::TerminalNode *RETURN();
+    antlr4::tree::TerminalNode *ROLLBACK();
+    antlr4::tree::TerminalNode *ROLE();
+    antlr4::tree::TerminalNode *SEQUENCE();
+    antlr4::tree::TerminalNode *SET();
+    antlr4::tree::TerminalNode *START();
+    antlr4::tree::TerminalNode *STRUCT();
+    antlr4::tree::TerminalNode *L_SKIP();
+    antlr4::tree::TerminalNode *LIMIT();
+    antlr4::tree::TerminalNode *TRANSACTION();
+    antlr4::tree::TerminalNode *TYPE();
+    antlr4::tree::TerminalNode *USE();
+    antlr4::tree::TerminalNode *UNINSTALL();
+    antlr4::tree::TerminalNode *UPDATE();
+    antlr4::tree::TerminalNode *WRITE();
+    antlr4::tree::TerminalNode *FROM();
+    antlr4::tree::TerminalNode *TO();
+    antlr4::tree::TerminalNode *YIELD();
+    antlr4::tree::TerminalNode *USER();
+    antlr4::tree::TerminalNode *PASSWORD();
+    antlr4::tree::TerminalNode *MAP();
+
+   
+  };
+
+  KU_NonReservedKeywordsContext* kU_NonReservedKeywords();
+
+  class  OC_LeftArrowHeadContext : public antlr4::ParserRuleContext {
+  public:
+    OC_LeftArrowHeadContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+
+   
+  };
+
+  OC_LeftArrowHeadContext* oC_LeftArrowHead();
+
+  class  OC_RightArrowHeadContext : public antlr4::ParserRuleContext {
+  public:
+    OC_RightArrowHeadContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+
+   
+  };
+
+  OC_RightArrowHeadContext* oC_RightArrowHead();
+
+  class  OC_DashContext : public antlr4::ParserRuleContext {
+  public:
+    OC_DashContext(antlr4::ParserRuleContext *parent, size_t invokingState);
+    virtual size_t getRuleIndex() const override;
+    antlr4::tree::TerminalNode *MINUS();
+
+   
+  };
+
+  OC_DashContext* oC_Dash();
+
+
+  bool sempred(antlr4::RuleContext *_localctx, size_t ruleIndex, size_t predicateIndex) override;
+
+  bool kU_DataTypeSempred(KU_DataTypeContext *_localctx, size_t predicateIndex);
+  bool kU_JoinNodeSempred(KU_JoinNodeContext *_localctx, size_t predicateIndex);
+
+  // By default the static state used to implement the parser is lazily initialized during the first
+  // call to the constructor. You can call this function if you wish to initialize the static state
+  // ahead of time.
+  static void initialize();
+
+private:
+
+      virtual void notifyQueryNotConcludeWithReturn(antlr4::Token* startToken) {};
+      virtual void notifyNodePatternWithoutParentheses(std::string nodeName, antlr4::Token* startToken) {};
+      virtual void notifyInvalidNotEqualOperator(antlr4::Token* startToken) {};
+      virtual void notifyEmptyToken(antlr4::Token* startToken) {};
+      virtual void notifyReturnNotAtEnd(antlr4::Token* startToken) {};
+      virtual void notifyNonBinaryComparison(antlr4::Token* startToken) {};
+
+};
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/CMakeLists.txt
new file mode 100644
index 0000000000..887e19257b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/CMakeLists.txt
@@ -0,0 +1,337 @@
+#------------------- LIBRARY CONFIGURATION ------------------------------------
+
+set(ANTLR4_RUNTIME antlr4_runtime CACHE INTERNAL "")
+set(ANTLR4_RUNTIME_SRC
+    src/antlr4-common.h
+    src/antlr4-runtime.h
+    src/ANTLRErrorListener.cpp
+    src/ANTLRErrorListener.h
+    src/ANTLRErrorStrategy.cpp
+    src/ANTLRErrorStrategy.h
+    src/ANTLRFileStream.cpp
+    src/ANTLRFileStream.h
+    src/ANTLRInputStream.cpp
+    src/ANTLRInputStream.h
+    src/atn/ActionTransition.cpp
+    src/atn/ActionTransition.h
+    src/atn/AmbiguityInfo.cpp
+    src/atn/AmbiguityInfo.h
+    src/atn/ArrayPredictionContext.cpp
+    src/atn/ArrayPredictionContext.h
+    src/atn/ATNConfig.cpp
+    src/atn/ATNConfig.h
+    src/atn/ATNConfigSet.cpp
+    src/atn/ATNConfigSet.h
+    src/atn/ATN.cpp
+    src/atn/ATNDeserializationOptions.cpp
+    src/atn/ATNDeserializationOptions.h
+    src/atn/ATNDeserializer.cpp
+    src/atn/ATNDeserializer.h
+    src/atn/ATN.h
+    src/atn/ATNSimulator.cpp
+    src/atn/ATNSimulator.h
+    src/atn/ATNState.cpp
+    src/atn/ATNState.h
+    src/atn/ATNStateType.cpp
+    src/atn/ATNStateType.h
+    src/atn/ATNType.h
+    src/atn/AtomTransition.cpp
+    src/atn/AtomTransition.h
+    src/atn/BasicBlockStartState.h
+    src/atn/BasicState.h
+    src/atn/BlockEndState.h
+    src/atn/BlockStartState.h
+    src/atn/ContextSensitivityInfo.cpp
+    src/atn/ContextSensitivityInfo.h
+    src/atn/DecisionEventInfo.cpp
+    src/atn/DecisionEventInfo.h
+    src/atn/DecisionInfo.cpp
+    src/atn/DecisionInfo.h
+    src/atn/DecisionState.cpp
+    src/atn/DecisionState.h
+    src/atn/EpsilonTransition.cpp
+    src/atn/EpsilonTransition.h
+    src/atn/ErrorInfo.cpp
+    src/atn/ErrorInfo.h
+    src/atn/HashUtils.h
+    src/atn/LexerAction.cpp
+    src/atn/LexerActionExecutor.cpp
+    src/atn/LexerActionExecutor.h
+    src/atn/LexerAction.h
+    src/atn/LexerActionType.h
+    src/atn/LexerATNConfig.cpp
+    src/atn/LexerATNConfig.h
+    src/atn/LexerATNSimulator.cpp
+    src/atn/LexerATNSimulator.h
+    src/atn/LexerChannelAction.cpp
+    src/atn/LexerChannelAction.h
+    src/atn/LexerCustomAction.cpp
+    src/atn/LexerCustomAction.h
+    src/atn/LexerIndexedCustomAction.cpp
+    src/atn/LexerIndexedCustomAction.h
+    src/atn/LexerModeAction.cpp
+    src/atn/LexerModeAction.h
+    src/atn/LexerMoreAction.cpp
+    src/atn/LexerMoreAction.h
+    src/atn/LexerPopModeAction.cpp
+    src/atn/LexerPopModeAction.h
+    src/atn/LexerPushModeAction.cpp
+    src/atn/LexerPushModeAction.h
+    src/atn/LexerSkipAction.cpp
+    src/atn/LexerSkipAction.h
+    src/atn/LexerTypeAction.cpp
+    src/atn/LexerTypeAction.h
+    src/atn/LL1Analyzer.cpp
+    src/atn/LL1Analyzer.h
+    src/atn/LookaheadEventInfo.cpp
+    src/atn/LookaheadEventInfo.h
+    src/atn/LoopEndState.h
+    src/atn/NotSetTransition.cpp
+    src/atn/NotSetTransition.h
+    src/atn/OrderedATNConfigSet.cpp
+    src/atn/OrderedATNConfigSet.h
+    src/atn/ParseInfo.cpp
+    src/atn/ParseInfo.h
+    src/atn/ParserATNSimulator.cpp
+    src/atn/ParserATNSimulator.h
+    src/atn/ParserATNSimulatorOptions.h
+    src/atn/PlusBlockStartState.h
+    src/atn/PlusLoopbackState.h
+    src/atn/PrecedencePredicateTransition.cpp
+    src/atn/PrecedencePredicateTransition.h
+    src/atn/PredicateEvalInfo.cpp
+    src/atn/PredicateEvalInfo.h
+    src/atn/PredicateTransition.cpp
+    src/atn/PredicateTransition.h
+    src/atn/PredictionContextCache.cpp
+    src/atn/PredictionContextCache.h
+    src/atn/PredictionContext.cpp
+    src/atn/PredictionContext.h
+    src/atn/PredictionContextMergeCache.cpp
+    src/atn/PredictionContextMergeCache.h
+    src/atn/PredictionContextMergeCacheOptions.h
+    src/atn/PredictionContextType.h
+    src/atn/PredictionMode.cpp
+    src/atn/PredictionMode.h
+    src/atn/ProfilingATNSimulator.cpp
+    src/atn/ProfilingATNSimulator.h
+    src/atn/RangeTransition.cpp
+    src/atn/RangeTransition.h
+    src/atn/RuleStartState.h
+    src/atn/RuleStopState.h
+    src/atn/RuleTransition.cpp
+    src/atn/RuleTransition.h
+    src/atn/SemanticContext.cpp
+    src/atn/SemanticContext.h
+    src/atn/SemanticContextType.h
+    src/atn/SerializedATNView.h
+    src/atn/SetTransition.cpp
+    src/atn/SetTransition.h
+    src/atn/SingletonPredictionContext.cpp
+    src/atn/SingletonPredictionContext.h
+    src/atn/StarBlockStartState.h
+    src/atn/StarLoopbackState.cpp
+    src/atn/StarLoopbackState.h
+    src/atn/StarLoopEntryState.h
+    src/atn/TokensStartState.h
+    src/atn/Transition.cpp
+    src/atn/Transition.h
+    src/atn/TransitionType.cpp
+    src/atn/TransitionType.h
+    src/atn/WildcardTransition.cpp
+    src/atn/WildcardTransition.h
+    src/BailErrorStrategy.cpp
+    src/BailErrorStrategy.h
+    src/BaseErrorListener.cpp
+    src/BaseErrorListener.h
+    src/BufferedTokenStream.cpp
+    src/BufferedTokenStream.h
+    src/CharStream.cpp
+    src/CharStream.h
+    src/CommonToken.cpp
+    src/CommonTokenFactory.cpp
+    src/CommonTokenFactory.h
+    src/CommonToken.h
+    src/CommonTokenStream.cpp
+    src/CommonTokenStream.h
+    src/ConsoleErrorListener.cpp
+    src/ConsoleErrorListener.h
+    src/DefaultErrorStrategy.cpp
+    src/DefaultErrorStrategy.h
+    src/dfa/DFA.cpp
+    src/dfa/DFA.h
+    src/dfa/DFASerializer.cpp
+    src/dfa/DFASerializer.h
+    src/dfa/DFAState.cpp
+    src/dfa/DFAState.h
+    src/dfa/LexerDFASerializer.cpp
+    src/dfa/LexerDFASerializer.h
+    src/DiagnosticErrorListener.cpp
+    src/DiagnosticErrorListener.h
+    src/Exceptions.cpp
+    src/Exceptions.h
+    src/FailedPredicateException.cpp
+    src/FailedPredicateException.h
+    src/FlatHashMap.h
+    src/FlatHashSet.h
+    src/InputMismatchException.cpp
+    src/InputMismatchException.h
+    src/internal/Synchronization.cpp
+    src/internal/Synchronization.h
+    src/InterpreterRuleContext.cpp
+    src/InterpreterRuleContext.h
+    src/IntStream.cpp
+    src/IntStream.h
+    src/Lexer.cpp
+    src/Lexer.h
+    src/LexerInterpreter.cpp
+    src/LexerInterpreter.h
+    src/LexerNoViableAltException.cpp
+    src/LexerNoViableAltException.h
+    src/ListTokenSource.cpp
+    src/ListTokenSource.h
+    src/misc/InterpreterDataReader.cpp
+    src/misc/InterpreterDataReader.h
+    src/misc/Interval.cpp
+    src/misc/Interval.h
+    src/misc/IntervalSet.cpp
+    src/misc/IntervalSet.h
+    src/misc/MurmurHash.cpp
+    src/misc/MurmurHash.h
+    src/misc/Predicate.cpp
+    src/misc/Predicate.h
+    src/NoViableAltException.cpp
+    src/NoViableAltException.h
+    src/Parser.cpp
+    src/Parser.h
+    src/ParserInterpreter.cpp
+    src/ParserInterpreter.h
+    src/ParserRuleContext.cpp
+    src/ParserRuleContext.h
+    src/ProxyErrorListener.cpp
+    src/ProxyErrorListener.h
+    src/RecognitionException.cpp
+    src/RecognitionException.h
+    src/Recognizer.cpp
+    src/Recognizer.h
+    src/RuleContext.cpp
+    src/RuleContext.h
+    src/RuleContextWithAltNum.cpp
+    src/RuleContextWithAltNum.h
+    src/RuntimeMetaData.cpp
+    src/RuntimeMetaData.h
+    src/support/Any.cpp
+    src/support/Any.h
+    src/support/Arrays.cpp
+    src/support/Arrays.h
+    src/support/BitSet.h
+    src/support/Casts.h
+    src/support/CPPUtils.cpp
+    src/support/CPPUtils.h
+    src/support/Declarations.h
+    src/support/StringUtils.cpp
+    src/support/StringUtils.h
+    src/support/Unicode.h
+    src/support/Utf8.cpp
+    src/support/Utf8.h
+    src/Token.cpp
+    src/TokenFactory.h
+    src/Token.h
+    src/TokenSource.cpp
+    src/TokenSource.h
+    src/TokenStream.cpp
+    src/TokenStream.h
+    src/TokenStreamRewriter.cpp
+    src/TokenStreamRewriter.h
+    src/tree/AbstractParseTreeVisitor.h
+    src/tree/ErrorNode.h
+    src/tree/ErrorNodeImpl.cpp
+    src/tree/ErrorNodeImpl.h
+    src/tree/IterativeParseTreeWalker.cpp
+    src/tree/IterativeParseTreeWalker.h
+    src/tree/ParseTree.cpp
+    src/tree/ParseTree.h
+    src/tree/ParseTreeListener.cpp
+    src/tree/ParseTreeListener.h
+    src/tree/ParseTreeProperty.h
+    src/tree/ParseTreeType.h
+    src/tree/ParseTreeVisitor.cpp
+    src/tree/ParseTreeVisitor.h
+    src/tree/ParseTreeWalker.cpp
+    src/tree/ParseTreeWalker.h
+    src/tree/pattern/Chunk.cpp
+    src/tree/pattern/Chunk.h
+    src/tree/pattern/ParseTreeMatch.cpp
+    src/tree/pattern/ParseTreeMatch.h
+    src/tree/pattern/ParseTreePattern.cpp
+    src/tree/pattern/ParseTreePattern.h
+    src/tree/pattern/ParseTreePatternMatcher.cpp
+    src/tree/pattern/ParseTreePatternMatcher.h
+    src/tree/pattern/RuleTagToken.cpp
+    src/tree/pattern/RuleTagToken.h
+    src/tree/pattern/TagChunk.cpp
+    src/tree/pattern/TagChunk.h
+    src/tree/pattern/TextChunk.cpp
+    src/tree/pattern/TextChunk.h
+    src/tree/pattern/TokenTagToken.cpp
+    src/tree/pattern/TokenTagToken.h
+    src/tree/TerminalNode.h
+    src/tree/TerminalNodeImpl.cpp
+    src/tree/TerminalNodeImpl.h
+    src/tree/Trees.cpp
+    src/tree/Trees.h
+    src/tree/xpath/XPath.cpp
+    src/tree/xpath/XPathElement.cpp
+    src/tree/xpath/XPathElement.h
+    src/tree/xpath/XPath.h
+    src/tree/xpath/XPathLexer.cpp
+    src/tree/xpath/XPathLexerErrorListener.cpp
+    src/tree/xpath/XPathLexerErrorListener.h
+    src/tree/xpath/XPathLexer.g4
+    src/tree/xpath/XPathLexer.h
+    src/tree/xpath/XPathLexer.tokens
+    src/tree/xpath/XPathRuleAnywhereElement.cpp
+    src/tree/xpath/XPathRuleAnywhereElement.h
+    src/tree/xpath/XPathRuleElement.cpp
+    src/tree/xpath/XPathRuleElement.h
+    src/tree/xpath/XPathTokenAnywhereElement.cpp
+    src/tree/xpath/XPathTokenAnywhereElement.h
+    src/tree/xpath/XPathTokenElement.cpp
+    src/tree/xpath/XPathTokenElement.h
+    src/tree/xpath/XPathWildcardAnywhereElement.cpp
+    src/tree/xpath/XPathWildcardAnywhereElement.h
+    src/tree/xpath/XPathWildcardElement.cpp
+    src/tree/xpath/XPathWildcardElement.h
+    src/UnbufferedCharStream.cpp
+    src/UnbufferedCharStream.h
+    src/UnbufferedTokenStream.cpp
+    src/UnbufferedTokenStream.h
+    src/Version.h
+    src/Vocabulary.cpp
+    src/Vocabulary.h
+    src/WritableToken.cpp
+    src/WritableToken.h
+)
+
+add_library(${ANTLR4_RUNTIME} STATIC ${ANTLR4_RUNTIME_SRC})
+
+target_include_directories(${ANTLR4_RUNTIME} PUBLIC
+    ${CMAKE_CURRENT_SOURCE_DIR}/src
+)
+
+target_compile_definitions(${ANTLR4_RUNTIME} PUBLIC -DANTLR4CPP_STATIC)
+
+if(MSVC)
+    target_compile_options(${ANTLR4_RUNTIME} PRIVATE
+        $<$<CONFIG:Debug>:/W4 /Od>
+        $<$<CONFIG:Release>:/O2>
+    )
+else()
+    target_compile_options(${ANTLR4_RUNTIME} PRIVATE
+        $<$<CONFIG:Debug>:-g -Wall -O0>
+        $<$<CONFIG:Release>:-w -O3>
+    )
+    target_compile_options(${ANTLR4_RUNTIME} PUBLIC
+        $<$<CONFIG:Release>:-Wno-attributes>
+    )
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/LICENSE
new file mode 100644
index 0000000000..d70ecc0464
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/LICENSE
@@ -0,0 +1,84 @@
+BSD 3-Clause License
+
+Copyright (c) 2020-2021, Alejandro de Haro
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its
+   contributors may be used to endorse or promote products derived from
+   this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+=====
+
+[The "BSD 3-clause license"]
+Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+ 1. Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+ 2. Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+ 3. Neither the name of the copyright holder nor the names of its contributors
+    may be used to endorse or promote products derived from this software
+    without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+=====
+
+MIT License for codepointat.js from https://git.io/codepointat
+MIT License for fromcodepoint.js from https://git.io/vDW1m
+
+Copyright Mathias Bynens <https://mathiasbynens.be/>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorListener.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorListener.cpp
new file mode 100644
index 0000000000..6ceadb87f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorListener.cpp
@@ -0,0 +1,10 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "ANTLRErrorListener.h"
+
+antlr4::ANTLRErrorListener::~ANTLRErrorListener()
+{
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorListener.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorListener.h
new file mode 100755
index 0000000000..d6efad1d9e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorListener.h
@@ -0,0 +1,167 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "RecognitionException.h"
+
+namespace antlrcpp {
+  class BitSet;
+}
+
+namespace antlr4 {
+
+  /// How to emit recognition errors (an interface in Java).
+  class ANTLR4CPP_PUBLIC ANTLRErrorListener {
+  public:
+    virtual ~ANTLRErrorListener();
+
+    /// <summary>
+    /// Upon syntax error, notify any interested parties. This is not how to
+    /// recover from errors or compute error messages. <seealso cref="ANTLRErrorStrategy"/>
+    /// specifies how to recover from syntax errors and how to compute error
+    /// messages. This listener's job is simply to emit a computed message,
+    /// though it has enough information to create its own message in many cases.
+    /// <p/>
+    /// The <seealso cref="RecognitionException"/> is non-null for all syntax errors except
+    /// when we discover mismatched token errors that we can recover from
+    /// in-line, without returning from the surrounding rule (via the single
+    /// token insertion and deletion mechanism).
+    /// </summary>
+    /// <param name="recognizer">
+    ///        What parser got the error. From this
+    /// 		  object, you can access the context as well
+    /// 		  as the input stream. </param>
+    /// <param name="offendingSymbol">
+    ///        The offending token in the input token
+    /// 		  stream, unless recognizer is a lexer (then it's null). If
+    /// 		  no viable alternative error, {@code e} has token at which we
+    /// 		  started production for the decision. </param>
+    /// <param name="line">
+    /// 		  The line number in the input where the error occurred. </param>
+    /// <param name="charPositionInLine">
+    /// 		  The character position within that line where the error occurred. </param>
+    /// <param name="msg">
+    /// 		  The message to emit. </param>
+    /// <param name="e">
+    ///        The exception generated by the parser that led to
+    ///        the reporting of an error. It is null in the case where
+    ///        the parser was able to recover in line without exiting the
+    ///        surrounding rule. </param>
+    virtual void syntaxError(Recognizer *recognizer, Token *offendingSymbol, size_t line,
+                             size_t charPositionInLine, const std::string &msg, std::exception_ptr e) = 0;
+
+    /**
+     * This method is called by the parser when a full-context prediction
+     * results in an ambiguity.
+     *
+     * <p>Each full-context prediction which does not result in a syntax error
+     * will call either {@link #reportContextSensitivity} or
+     * {@link #reportAmbiguity}.</p>
+     *
+     * <p>When {@code ambigAlts} is not null, it contains the set of potentially
+     * viable alternatives identified by the prediction algorithm. When
+     * {@code ambigAlts} is null, use {@link ATNConfigSet#getAlts} to obtain the
+     * represented alternatives from the {@code configs} argument.</p>
+     *
+     * <p>When {@code exact} is {@code true}, <em>all</em> of the potentially
+     * viable alternatives are truly viable, i.e. this is reporting an exact
+     * ambiguity. When {@code exact} is {@code false}, <em>at least two</em> of
+     * the potentially viable alternatives are viable for the current input, but
+     * the prediction algorithm terminated as soon as it determined that at
+     * least the <em>minimum</em> potentially viable alternative is truly
+     * viable.</p>
+     *
+     * <p>When the {@link PredictionMode#LL_EXACT_AMBIG_DETECTION} prediction
+     * mode is used, the parser is required to identify exact ambiguities so
+     * {@code exact} will always be {@code true}.</p>
+     *
+     * <p>This method is not used by lexers.</p>
+     *
+     * @param recognizer the parser instance
+     * @param dfa the DFA for the current decision
+     * @param startIndex the input index where the decision started
+     * @param stopIndex the input input where the ambiguity was identified
+     * @param exact {@code true} if the ambiguity is exactly known, otherwise
+     * {@code false}. This is always {@code true} when
+     * {@link PredictionMode#LL_EXACT_AMBIG_DETECTION} is used.
+     * @param ambigAlts the potentially ambiguous alternatives, or {@code null}
+     * to indicate that the potentially ambiguous alternatives are the complete
+     * set of represented alternatives in {@code configs}
+     * @param configs the ATN configuration set where the ambiguity was
+     * identified
+     */
+    virtual void reportAmbiguity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex, bool exact,
+      const antlrcpp::BitSet &ambigAlts, atn::ATNConfigSet *configs) = 0;
+
+    /**
+     * This method is called when an SLL conflict occurs and the parser is about
+     * to use the full context information to make an LL decision.
+     *
+     * <p>If one or more configurations in {@code configs} contains a semantic
+     * predicate, the predicates are evaluated before this method is called. The
+     * subset of alternatives which are still viable after predicates are
+     * evaluated is reported in {@code conflictingAlts}.</p>
+     *
+     * <p>This method is not used by lexers.</p>
+     *
+     * @param recognizer the parser instance
+     * @param dfa the DFA for the current decision
+     * @param startIndex the input index where the decision started
+     * @param stopIndex the input index where the SLL conflict occurred
+     * @param conflictingAlts The specific conflicting alternatives. If this is
+     * {@code null}, the conflicting alternatives are all alternatives
+     * represented in {@code configs}. At the moment, conflictingAlts is non-null
+     * (for the reference implementation, but Sam's optimized version can see this
+     * as null).
+     * @param configs the ATN configuration set where the SLL conflict was
+     * detected
+     */
+    virtual void reportAttemptingFullContext(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+      const antlrcpp::BitSet &conflictingAlts, atn::ATNConfigSet *configs) = 0;
+
+    /**
+     * This method is called by the parser when a full-context prediction has a
+     * unique result.
+     *
+     * <p>Each full-context prediction which does not result in a syntax error
+     * will call either {@link #reportContextSensitivity} or
+     * {@link #reportAmbiguity}.</p>
+     *
+     * <p>For prediction implementations that only evaluate full-context
+     * predictions when an SLL conflict is found (including the default
+     * {@link ParserATNSimulator} implementation), this method reports cases
+     * where SLL conflicts were resolved to unique full-context predictions,
+     * i.e. the decision was context-sensitive. This report does not necessarily
+     * indicate a problem, and it may appear even in completely unambiguous
+     * grammars.</p>
+     *
+     * <p>{@code configs} may have more than one represented alternative if the
+     * full-context prediction algorithm does not evaluate predicates before
+     * beginning the full-context prediction. In all cases, the final prediction
+     * is passed as the {@code prediction} argument.</p>
+     *
+     * <p>Note that the definition of "context sensitivity" in this method
+     * differs from the concept in {@link DecisionInfo#contextSensitivities}.
+     * This method reports all instances where an SLL conflict occurred but LL
+     * parsing produced a unique result, whether or not that unique result
+     * matches the minimum alternative in the SLL conflicting set.</p>
+     *
+     * <p>This method is not used by lexers.</p>
+     *
+     * @param recognizer the parser instance
+     * @param dfa the DFA for the current decision
+     * @param startIndex the input index where the decision started
+     * @param stopIndex the input index where the context sensitivity was
+     * finally determined
+     * @param prediction the unambiguous result of the full-context prediction
+     * @param configs the ATN configuration set where the unambiguous prediction
+     * was determined
+     */
+    virtual void reportContextSensitivity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+      size_t prediction, atn::ATNConfigSet *configs) = 0;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorStrategy.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorStrategy.cpp
new file mode 100644
index 0000000000..1655a5731d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorStrategy.cpp
@@ -0,0 +1,10 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "ANTLRErrorStrategy.h"
+
+antlr4::ANTLRErrorStrategy::~ANTLRErrorStrategy()
+{
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorStrategy.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorStrategy.h
new file mode 100755
index 0000000000..a3eecd14c4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRErrorStrategy.h
@@ -0,0 +1,121 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Token.h"
+
+namespace antlr4 {
+
+  /// <summary>
+  /// The interface for defining strategies to deal with syntax errors encountered
+  /// during a parse by ANTLR-generated parsers. We distinguish between three
+  /// different kinds of errors:
+  ///
+  /// <ul>
+  /// <li>The parser could not figure out which path to take in the ATN (none of
+  /// the available alternatives could possibly match)</li>
+  /// <li>The current input does not match what we were looking for</li>
+  /// <li>A predicate evaluated to false</li>
+  /// </ul>
+  ///
+  /// Implementations of this interface report syntax errors by calling
+  /// <seealso cref="Parser#notifyErrorListeners"/>.
+  /// <p/>
+  /// TODO: what to do about lexers
+  /// </summary>
+  class ANTLR4CPP_PUBLIC ANTLRErrorStrategy {
+  public:
+
+    /// <summary>
+    /// Reset the error handler state for the specified {@code recognizer}. </summary>
+    /// <param name="recognizer"> the parser instance </param>
+    virtual ~ANTLRErrorStrategy();
+
+    virtual void reset(Parser *recognizer) = 0;
+
+    /**
+     * This method is called when an unexpected symbol is encountered during an
+     * inline match operation, such as {@link Parser#match}. If the error
+     * strategy successfully recovers from the match failure, this method
+     * returns the {@link Token} instance which should be treated as the
+     * successful result of the match.
+     *
+     * <p>This method handles the consumption of any tokens - the caller should
+     * <b>not</b> call {@link Parser#consume} after a successful recovery.</p>
+     *
+     * <p>Note that the calling code will not report an error if this method
+     * returns successfully. The error strategy implementation is responsible
+     * for calling {@link Parser#notifyErrorListeners} as appropriate.</p>
+     *
+     * @param recognizer the parser instance
+     * @throws RecognitionException if the error strategy was not able to
+     * recover from the unexpected input symbol
+     */
+    virtual Token* recoverInline(Parser *recognizer) = 0;
+
+    /// <summary>
+    /// This method is called to recover from exception {@code e}. This method is
+    /// called after <seealso cref="#reportError"/> by the default exception handler
+    /// generated for a rule method.
+    /// </summary>
+    /// <seealso cref= #reportError
+    /// </seealso>
+    /// <param name="recognizer"> the parser instance </param>
+    /// <param name="e"> the recognition exception to recover from </param>
+    /// <exception cref="RecognitionException"> if the error strategy could not recover from
+    /// the recognition exception </exception>
+    virtual void recover(Parser *recognizer, std::exception_ptr e) = 0;
+
+    /// <summary>
+    /// This method provides the error handler with an opportunity to handle
+    /// syntactic or semantic errors in the input stream before they result in a
+    /// <seealso cref="RecognitionException"/>.
+    /// <p/>
+    /// The generated code currently contains calls to <seealso cref="#sync"/> after
+    /// entering the decision state of a closure block ({@code (...)*} or
+    /// {@code (...)+}).
+    /// <p/>
+    /// For an implementation based on Jim Idle's "magic sync" mechanism, see
+    /// <seealso cref="DefaultErrorStrategy#sync"/>.
+    /// </summary>
+    /// <seealso cref= DefaultErrorStrategy#sync
+    /// </seealso>
+    /// <param name="recognizer"> the parser instance </param>
+    /// <exception cref="RecognitionException"> if an error is detected by the error
+    /// strategy but cannot be automatically recovered at the current state in
+    /// the parsing process </exception>
+    virtual void sync(Parser *recognizer) = 0;
+
+    /// <summary>
+    /// Tests whether or not {@code recognizer} is in the process of recovering
+    /// from an error. In error recovery mode, <seealso cref="Parser#consume"/> adds
+    /// symbols to the parse tree by calling
+    /// {@link Parser#createErrorNode(ParserRuleContext, Token)} then
+    /// {@link ParserRuleContext#addErrorNode(ErrorNode)} instead of
+    /// {@link Parser#createTerminalNode(ParserRuleContext, Token)}.
+    /// </summary>
+    /// <param name="recognizer"> the parser instance </param>
+    /// <returns> {@code true} if the parser is currently recovering from a parse
+    /// error, otherwise {@code false} </returns>
+    virtual bool inErrorRecoveryMode(Parser *recognizer) = 0;
+
+    /// <summary>
+    /// This method is called by when the parser successfully matches an input
+    /// symbol.
+    /// </summary>
+    /// <param name="recognizer"> the parser instance </param>
+    virtual void reportMatch(Parser *recognizer) = 0;
+
+    /// <summary>
+    /// Report any kind of <seealso cref="RecognitionException"/>. This method is called by
+    /// the default exception handler generated for a rule method.
+    /// </summary>
+    /// <param name="recognizer"> the parser instance </param>
+    /// <param name="e"> the recognition exception to report </param>
+    virtual void reportError(Parser *recognizer, const RecognitionException &e) = 0;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRFileStream.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRFileStream.cpp
new file mode 100755
index 0000000000..674817ac0e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRFileStream.cpp
@@ -0,0 +1,23 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "ANTLRFileStream.h"
+
+using namespace antlr4;
+
+void ANTLRFileStream::loadFromFile(const std::string &fileName) {
+  _fileName = fileName;
+  if (_fileName.empty()) {
+    return;
+  }
+
+  std::ifstream stream(fileName, std::ios::binary);
+
+  ANTLRInputStream::load(stream);
+}
+
+std::string ANTLRFileStream::getSourceName() const {
+  return _fileName;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRFileStream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRFileStream.h
new file mode 100755
index 0000000000..6c7d619a00
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRFileStream.h
@@ -0,0 +1,30 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "ANTLRInputStream.h"
+
+namespace antlr4 {
+
+  /// This is an ANTLRInputStream that is loaded from a file all at once
+  /// when you construct the object (or call load()).
+  // TODO: this class needs testing.
+  class ANTLR4CPP_PUBLIC ANTLRFileStream : public ANTLRInputStream {
+  public:
+    ANTLRFileStream() = default;
+    ANTLRFileStream(const std::string &) = delete;
+    ANTLRFileStream(const char *data, size_t length) = delete;
+    ANTLRFileStream(std::istream &stream) = delete;
+
+    // Assumes a file name encoded in UTF-8 and file content in the same encoding (with or w/o BOM).
+    virtual void loadFromFile(const std::string &fileName);
+    virtual std::string getSourceName() const override;
+
+  private:
+    std::string _fileName; // UTF-8 encoded file name.
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRInputStream.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRInputStream.cpp
new file mode 100755
index 0000000000..b6470af9b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRInputStream.cpp
@@ -0,0 +1,180 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include <string.h>
+
+#include "Exceptions.h"
+#include "misc/Interval.h"
+#include "IntStream.h"
+
+#include "support/Utf8.h"
+#include "support/CPPUtils.h"
+
+#include "ANTLRInputStream.h"
+
+using namespace antlr4;
+using namespace antlrcpp;
+
+using misc::Interval;
+
+ANTLRInputStream::ANTLRInputStream() {
+  InitializeInstanceFields();
+}
+
+ANTLRInputStream::ANTLRInputStream(std::string_view input): ANTLRInputStream() {
+  load(input.data(), input.length());
+}
+
+ANTLRInputStream::ANTLRInputStream(const char *data, size_t length) {
+  load(data, length);
+}
+
+ANTLRInputStream::ANTLRInputStream(std::istream &stream): ANTLRInputStream() {
+  load(stream);
+}
+
+void ANTLRInputStream::load(const std::string &input, bool lenient) {
+  load(input.data(), input.size(), lenient);
+}
+
+void ANTLRInputStream::load(const char *data, size_t length, bool lenient) {
+  // Remove the UTF-8 BOM if present.
+  const char *bom = "\xef\xbb\xbf";
+  if (length >= 3 && strncmp(data, bom, 3) == 0) {
+    data += 3;
+    length -= 3;
+  }
+  if (lenient) {
+    _data = Utf8::lenientDecode(std::string_view(data, length));
+  } else {
+    auto maybe_utf32 = Utf8::strictDecode(std::string_view(data, length));
+    if (!maybe_utf32.has_value()) {
+      throw IllegalArgumentException("UTF-8 string contains an illegal byte sequence");
+    }
+    _data = std::move(maybe_utf32).value();
+  }
+  p = 0;
+}
+
+void ANTLRInputStream::load(std::istream &stream, bool lenient) {
+  if (!stream.good() || stream.eof()) // No fail, bad or EOF.
+    return;
+
+  _data.clear();
+
+  std::string s((std::istreambuf_iterator<char>(stream)), std::istreambuf_iterator<char>());
+  load(s.data(), s.length(), lenient);
+}
+
+void ANTLRInputStream::reset() {
+  p = 0;
+}
+
+void ANTLRInputStream::consume() {
+  if (p >= _data.size()) {
+    assert(LA(1) == IntStream::EOF);
+    throw IllegalStateException("cannot consume EOF");
+  }
+
+  if (p < _data.size()) {
+    p++;
+  }
+}
+
+size_t ANTLRInputStream::LA(ssize_t i) {
+  if (i == 0) {
+    return 0; // undefined
+  }
+
+  ssize_t position = static_cast<ssize_t>(p);
+  if (i < 0) {
+    i++; // e.g., translate LA(-1) to use offset i=0; then _data[p+0-1]
+    if ((position + i - 1) < 0) {
+      return IntStream::EOF; // invalid; no char before first char
+    }
+  }
+
+  if ((position + i - 1) >= static_cast<ssize_t>(_data.size())) {
+    return IntStream::EOF;
+  }
+
+  return _data[static_cast<size_t>((position + i - 1))];
+}
+
+size_t ANTLRInputStream::LT(ssize_t i) {
+  return LA(i);
+}
+
+size_t ANTLRInputStream::index() {
+  return p;
+}
+
+size_t ANTLRInputStream::size() {
+  return _data.size();
+}
+
+// Mark/release do nothing. We have entire buffer.
+ssize_t ANTLRInputStream::mark() {
+  return -1;
+}
+
+void ANTLRInputStream::release(ssize_t /* marker */) {
+}
+
+void ANTLRInputStream::seek(size_t index) {
+  if (index <= p) {
+    p = index; // just jump; don't update stream state (line, ...)
+    return;
+  }
+  // seek forward, consume until p hits index or n (whichever comes first)
+  index = std::min(index, _data.size());
+  while (p < index) {
+    consume();
+  }
+}
+
+std::string ANTLRInputStream::getText(const Interval &interval) {
+  if (interval.a < 0 || interval.b < 0) {
+    return "";
+  }
+
+  size_t start = static_cast<size_t>(interval.a);
+  size_t stop = static_cast<size_t>(interval.b);
+
+
+  if (stop >= _data.size()) {
+    stop = _data.size() - 1;
+  }
+
+  size_t count = stop - start + 1;
+  if (start >= _data.size()) {
+    return "";
+  }
+
+  auto maybeUtf8 = Utf8::strictEncode(std::u32string_view(_data).substr(start, count));
+  if (!maybeUtf8.has_value()) {
+    throw IllegalArgumentException("Input stream contains invalid Unicode code points");
+  }
+  return std::move(maybeUtf8).value();
+}
+
+std::string ANTLRInputStream::getSourceName() const {
+  if (name.empty()) {
+    return IntStream::UNKNOWN_SOURCE_NAME;
+  }
+  return name;
+}
+
+std::string ANTLRInputStream::toString() const {
+  auto maybeUtf8 = Utf8::strictEncode(_data);
+  if (!maybeUtf8.has_value()) {
+    throw IllegalArgumentException("Input stream contains invalid Unicode code points");
+  }
+  return std::move(maybeUtf8).value();
+}
+
+void ANTLRInputStream::InitializeInstanceFields() {
+  p = 0;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRInputStream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRInputStream.h
new file mode 100755
index 0000000000..413eadefa4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ANTLRInputStream.h
@@ -0,0 +1,79 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <string_view>
+
+#include "CharStream.h"
+
+namespace antlr4 {
+
+  // Vacuum all input from a stream and then treat it
+  // like a string. Can also pass in a string or char[] to use.
+  // Input is expected to be encoded in UTF-8 and converted to UTF-32 internally.
+  class ANTLR4CPP_PUBLIC ANTLRInputStream : public CharStream {
+  protected:
+    /// The data being scanned.
+    // UTF-32
+    std::u32string _data;
+
+    /// 0..n-1 index into string of next char </summary>
+    size_t p;
+
+  public:
+    /// What is name or source of this char stream?
+    std::string name;
+
+    ANTLRInputStream();
+
+    ANTLRInputStream(std::string_view input);
+
+    ANTLRInputStream(const char *data, size_t length);
+    ANTLRInputStream(std::istream &stream);
+
+    virtual void load(const std::string &input, bool lenient);
+    virtual void load(const char *data, size_t length, bool lenient);
+    virtual void load(std::istream &stream, bool lenient);
+
+    virtual void load(const std::string &input) { load(input, false); }
+    virtual void load(const char *data, size_t length) { load(data, length, false); }
+    virtual void load(std::istream &stream) { load(stream, false); }
+
+    /// Reset the stream so that it's in the same state it was
+    /// when the object was created *except* the data array is not
+    /// touched.
+    virtual void reset();
+    virtual void consume() override;
+    virtual size_t LA(ssize_t i) override;
+    virtual size_t LT(ssize_t i);
+
+    /// <summary>
+    /// Return the current input symbol index 0..n where n indicates the
+    ///  last symbol has been read.  The index is the index of char to
+    ///  be returned from LA(1).
+    /// </summary>
+    virtual size_t index() override;
+    virtual size_t size() override;
+
+    /// <summary>
+    /// mark/release do nothing; we have entire buffer </summary>
+    virtual ssize_t mark() override;
+    virtual void release(ssize_t marker) override;
+
+    /// <summary>
+    /// consume() ahead until p==index; can't just set p=index as we must
+    ///  update line and charPositionInLine. If we seek backwards, just set p
+    /// </summary>
+    virtual void seek(size_t index) override;
+    virtual std::string getText(const misc::Interval &interval) override;
+    virtual std::string getSourceName() const override;
+    virtual std::string toString() const override;
+
+  private:
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BailErrorStrategy.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BailErrorStrategy.cpp
new file mode 100755
index 0000000000..5fbc011611
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BailErrorStrategy.cpp
@@ -0,0 +1,61 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Exceptions.h"
+#include "ParserRuleContext.h"
+#include "InputMismatchException.h"
+#include "Parser.h"
+
+#include "BailErrorStrategy.h"
+
+using namespace antlr4;
+
+void BailErrorStrategy::recover(Parser *recognizer, std::exception_ptr e) {
+  ParserRuleContext *context = recognizer->getContext();
+  do {
+    context->exception = e;
+    if (context->parent == nullptr)
+      break;
+    context = static_cast<ParserRuleContext *>(context->parent);
+  } while (true);
+
+  try {
+    std::rethrow_exception(e); // Throw the exception to be able to catch and rethrow nested.
+#if defined(_MSC_FULL_VER) && _MSC_FULL_VER < 190023026
+  } catch (RecognitionException &inner) {
+    throw ParseCancellationException(inner.what());
+#else
+  } catch (RecognitionException & /*inner*/) {
+    std::throw_with_nested(ParseCancellationException());
+#endif
+  }
+}
+
+Token* BailErrorStrategy::recoverInline(Parser *recognizer)  {
+  InputMismatchException e(recognizer);
+  std::exception_ptr exception = std::make_exception_ptr(e);
+
+  ParserRuleContext *context = recognizer->getContext();
+  do {
+    context->exception = exception;
+    if (context->parent == nullptr)
+      break;
+    context = static_cast<ParserRuleContext *>(context->parent);
+  } while (true);
+
+  try {
+    throw e;
+#if defined(_MSC_FULL_VER) && _MSC_FULL_VER < 190023026
+  } catch (InputMismatchException &inner) {
+    throw ParseCancellationException(inner.what());
+#else
+  } catch (InputMismatchException & /*inner*/) {
+    std::throw_with_nested(ParseCancellationException());
+#endif
+  }
+}
+
+void BailErrorStrategy::sync(Parser * /*recognizer*/) {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BailErrorStrategy.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BailErrorStrategy.h
new file mode 100755
index 0000000000..2a8c36f9ed
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BailErrorStrategy.h
@@ -0,0 +1,59 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "DefaultErrorStrategy.h"
+
+namespace antlr4 {
+
+  /**
+   * This implementation of {@link ANTLRErrorStrategy} responds to syntax errors
+   * by immediately canceling the parse operation with a
+   * {@link ParseCancellationException}. The implementation ensures that the
+   * {@link ParserRuleContext#exception} field is set for all parse tree nodes
+   * that were not completed prior to encountering the error.
+   *
+   * <p>
+   * This error strategy is useful in the following scenarios.</p>
+   *
+   * <ul>
+   * <li><strong>Two-stage parsing:</strong> This error strategy allows the first
+   * stage of two-stage parsing to immediately terminate if an error is
+   * encountered, and immediately fall back to the second stage. In addition to
+   * avoiding wasted work by attempting to recover from errors here, the empty
+   * implementation of {@link BailErrorStrategy#sync} improves the performance of
+   * the first stage.</li>
+   * <li><strong>Silent validation:</strong> When syntax errors are not being
+   * reported or logged, and the parse result is simply ignored if errors occur,
+   * the {@link BailErrorStrategy} avoids wasting work on recovering from errors
+   * when the result will be ignored either way.</li>
+   * </ul>
+   *
+   * <p>
+   * {@code myparser.setErrorHandler(new BailErrorStrategy());}</p>
+   *
+   * @see Parser#setErrorHandler(ANTLRErrorStrategy)
+   */
+  class ANTLR4CPP_PUBLIC BailErrorStrategy : public DefaultErrorStrategy {
+    /// <summary>
+    /// Instead of recovering from exception {@code e}, re-throw it wrapped
+    ///  in a <seealso cref="ParseCancellationException"/> so it is not caught by the
+    ///  rule function catches.  Use <seealso cref="Exception#getCause()"/> to get the
+    ///  original <seealso cref="RecognitionException"/>.
+    /// </summary>
+  public:
+    virtual void recover(Parser *recognizer, std::exception_ptr e) override;
+
+    /// Make sure we don't attempt to recover inline; if the parser
+    ///  successfully recovers, it won't throw an exception.
+    virtual Token* recoverInline(Parser *recognizer) override;
+
+    /// <summary>
+    /// Make sure we don't attempt to recover from problems in subrules. </summary>
+    virtual void sync(Parser *recognizer) override;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BaseErrorListener.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BaseErrorListener.cpp
new file mode 100755
index 0000000000..c035f09f0f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BaseErrorListener.cpp
@@ -0,0 +1,25 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "BaseErrorListener.h"
+#include "RecognitionException.h"
+
+using namespace antlr4;
+
+void BaseErrorListener::syntaxError(Recognizer * /*recognizer*/, Token * /*offendingSymbol*/, size_t /*line*/,
+  size_t /*charPositionInLine*/, const std::string &/*msg*/, std::exception_ptr /*e*/) {
+}
+
+void BaseErrorListener::reportAmbiguity(Parser * /*recognizer*/, const dfa::DFA &/*dfa*/, size_t /*startIndex*/,
+  size_t /*stopIndex*/, bool /*exact*/, const antlrcpp::BitSet &/*ambigAlts*/, atn::ATNConfigSet * /*configs*/) {
+}
+
+void BaseErrorListener::reportAttemptingFullContext(Parser * /*recognizer*/, const dfa::DFA &/*dfa*/, size_t /*startIndex*/,
+  size_t /*stopIndex*/, const antlrcpp::BitSet &/*conflictingAlts*/, atn::ATNConfigSet * /*configs*/) {
+}
+
+void BaseErrorListener::reportContextSensitivity(Parser * /*recognizer*/, const dfa::DFA &/*dfa*/, size_t /*startIndex*/,
+  size_t /*stopIndex*/, size_t /*prediction*/, atn::ATNConfigSet * /*configs*/) {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BaseErrorListener.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BaseErrorListener.h
new file mode 100755
index 0000000000..aad2e5d755
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BaseErrorListener.h
@@ -0,0 +1,36 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "ANTLRErrorListener.h"
+
+namespace antlrcpp {
+  class BitSet;
+}
+
+namespace antlr4 {
+
+  /**
+   * Provides an empty default implementation of {@link ANTLRErrorListener}. The
+   * default implementation of each method does nothing, but can be overridden as
+   * necessary.
+   */
+  class ANTLR4CPP_PUBLIC BaseErrorListener : public ANTLRErrorListener {
+
+    virtual void syntaxError(Recognizer *recognizer, Token * offendingSymbol, size_t line, size_t charPositionInLine,
+      const std::string &msg, std::exception_ptr e) override;
+
+    virtual void reportAmbiguity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex, bool exact,
+      const antlrcpp::BitSet &ambigAlts, atn::ATNConfigSet *configs) override;
+
+    virtual void reportAttemptingFullContext(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+      const antlrcpp::BitSet &conflictingAlts, atn::ATNConfigSet *configs) override;
+
+    virtual void reportContextSensitivity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+      size_t prediction, atn::ATNConfigSet *configs) override;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BufferedTokenStream.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BufferedTokenStream.cpp
new file mode 100755
index 0000000000..241dfe5c47
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BufferedTokenStream.cpp
@@ -0,0 +1,414 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "WritableToken.h"
+#include "Lexer.h"
+#include "RuleContext.h"
+#include "misc/Interval.h"
+#include "Exceptions.h"
+#include "support/CPPUtils.h"
+
+#include "BufferedTokenStream.h"
+
+using namespace antlr4;
+using namespace antlrcpp;
+
+BufferedTokenStream::BufferedTokenStream(TokenSource *tokenSource) : _tokenSource(tokenSource){
+  InitializeInstanceFields();
+}
+
+TokenSource* BufferedTokenStream::getTokenSource() const {
+  return _tokenSource;
+}
+
+size_t BufferedTokenStream::index() {
+  return _p;
+}
+
+ssize_t BufferedTokenStream::mark() {
+  return 0;
+}
+
+void BufferedTokenStream::release(ssize_t /*marker*/) {
+  // no resources to release
+}
+
+void BufferedTokenStream::reset() {
+  seek(0);
+}
+
+void BufferedTokenStream::seek(size_t index) {
+  lazyInit();
+  _p = adjustSeekIndex(index);
+}
+
+size_t BufferedTokenStream::size() {
+  return _tokens.size();
+}
+
+void BufferedTokenStream::consume() {
+  bool skipEofCheck = false;
+  if (!_needSetup) {
+    if (_fetchedEOF) {
+      // the last token in tokens is EOF. skip check if p indexes any
+      // fetched token except the last.
+      skipEofCheck = _p < _tokens.size() - 1;
+    } else {
+      // no EOF token in tokens. skip check if p indexes a fetched token.
+      skipEofCheck = _p < _tokens.size();
+    }
+  } else {
+    // not yet initialized
+    skipEofCheck = false;
+  }
+
+  if (!skipEofCheck && LA(1) == Token::EOF) {
+    throw IllegalStateException("cannot consume EOF");
+  }
+
+  if (sync(_p + 1)) {
+    _p = adjustSeekIndex(_p + 1);
+  }
+}
+
+bool BufferedTokenStream::sync(size_t i) {
+  if (i + 1 < _tokens.size())
+    return true;
+  size_t n = i - _tokens.size() + 1; // how many more elements we need?
+
+  if (n > 0) {
+    size_t fetched = fetch(n);
+    return fetched >= n;
+  }
+
+  return true;
+}
+
+size_t BufferedTokenStream::fetch(size_t n) {
+  if (_fetchedEOF) {
+    return 0;
+  }
+
+  size_t i = 0;
+  while (i < n) {
+    std::unique_ptr<Token> t(_tokenSource->nextToken());
+
+    if (is<WritableToken *>(t.get())) {
+      (static_cast<WritableToken *>(t.get()))->setTokenIndex(_tokens.size());
+    }
+
+    _tokens.push_back(std::move(t));
+    ++i;
+
+    if (_tokens.back()->getType() == Token::EOF) {
+      _fetchedEOF = true;
+      break;
+    }
+  }
+
+  return i;
+}
+
+Token* BufferedTokenStream::get(size_t i) const {
+  if (i >= _tokens.size()) {
+    throw IndexOutOfBoundsException(std::string("token index ") +
+                                    std::to_string(i) +
+                                    std::string(" out of range 0..") +
+                                    std::to_string(_tokens.size() - 1));
+  }
+  return _tokens[i].get();
+}
+
+std::vector<Token *> BufferedTokenStream::get(size_t start, size_t stop) {
+  std::vector<Token *> subset;
+
+  lazyInit();
+
+  if (_tokens.empty()) {
+    return subset;
+  }
+
+  if (stop >= _tokens.size()) {
+    stop = _tokens.size() - 1;
+  }
+  for (size_t i = start; i <= stop; i++) {
+    Token *t = _tokens[i].get();
+    if (t->getType() == Token::EOF) {
+      break;
+    }
+    subset.push_back(t);
+  }
+  return subset;
+}
+
+size_t BufferedTokenStream::LA(ssize_t i) {
+  return LT(i)->getType();
+}
+
+Token* BufferedTokenStream::LB(size_t k) {
+  if (k > _p) {
+    return nullptr;
+  }
+  return _tokens[_p - k].get();
+}
+
+Token* BufferedTokenStream::LT(ssize_t k) {
+  lazyInit();
+  if (k == 0) {
+    return nullptr;
+  }
+  if (k < 0) {
+    return LB(-k);
+  }
+
+  size_t i = _p + k - 1;
+  sync(i);
+  if (i >= _tokens.size()) { // return EOF token
+                             // EOF must be last token
+    return _tokens.back().get();
+  }
+
+  return _tokens[i].get();
+}
+
+ssize_t BufferedTokenStream::adjustSeekIndex(size_t i) {
+  return i;
+}
+
+void BufferedTokenStream::lazyInit() {
+  if (_needSetup) {
+    setup();
+  }
+}
+
+void BufferedTokenStream::setup() {
+  _needSetup = false;
+  sync(0);
+  _p = adjustSeekIndex(0);
+}
+
+void BufferedTokenStream::setTokenSource(TokenSource *tokenSource) {
+  _tokenSource = tokenSource;
+  _tokens.clear();
+  _fetchedEOF = false;
+  _needSetup = true;
+}
+
+std::vector<Token *> BufferedTokenStream::getTokens() {
+  std::vector<Token *> result;
+  for (auto &t : _tokens)
+    result.push_back(t.get());
+  return result;
+}
+
+std::vector<Token *> BufferedTokenStream::getTokens(size_t start, size_t stop) {
+  return getTokens(start, stop, std::vector<size_t>());
+}
+
+std::vector<Token *> BufferedTokenStream::getTokens(size_t start, size_t stop, const std::vector<size_t> &types) {
+  lazyInit();
+  if (stop >= _tokens.size() || start >= _tokens.size()) {
+    throw IndexOutOfBoundsException(std::string("start ") +
+                                    std::to_string(start) +
+                                    std::string(" or stop ") +
+                                    std::to_string(stop) +
+                                    std::string(" not in 0..") +
+                                    std::to_string(_tokens.size() - 1));
+  }
+
+  std::vector<Token *> filteredTokens;
+
+  if (start > stop) {
+    return filteredTokens;
+  }
+
+  for (size_t i = start; i <= stop; i++) {
+    Token *tok = _tokens[i].get();
+
+    if (types.empty() || std::find(types.begin(), types.end(), tok->getType()) != types.end()) {
+      filteredTokens.push_back(tok);
+    }
+  }
+  return filteredTokens;
+}
+
+std::vector<Token *> BufferedTokenStream::getTokens(size_t start, size_t stop, size_t ttype) {
+  std::vector<size_t> s;
+  s.push_back(ttype);
+  return getTokens(start, stop, s);
+}
+
+ssize_t BufferedTokenStream::nextTokenOnChannel(size_t i, size_t channel) {
+  sync(i);
+  if (i >= size()) {
+    return size() - 1;
+  }
+
+  Token *token = _tokens[i].get();
+  while (token->getChannel() != channel) {
+    if (token->getType() == Token::EOF) {
+      return i;
+    }
+    i++;
+    sync(i);
+    token = _tokens[i].get();
+  }
+  return i;
+}
+
+ssize_t BufferedTokenStream::previousTokenOnChannel(size_t i, size_t channel) {
+  sync(i);
+  if (i >= size()) {
+    // the EOF token is on every channel
+    return size() - 1;
+  }
+
+  while (true) {
+    Token *token = _tokens[i].get();
+    if (token->getType() == Token::EOF || token->getChannel() == channel) {
+      return i;
+    }
+
+    if (i == 0)
+      return -1;
+    i--;
+  }
+  return i;
+}
+
+std::vector<Token *> BufferedTokenStream::getHiddenTokensToRight(size_t tokenIndex, ssize_t channel) {
+  lazyInit();
+  if (tokenIndex >= _tokens.size()) {
+    throw IndexOutOfBoundsException(std::to_string(tokenIndex) + " not in 0.." + std::to_string(_tokens.size() - 1));
+  }
+
+  ssize_t nextOnChannel = nextTokenOnChannel(tokenIndex + 1, Lexer::DEFAULT_TOKEN_CHANNEL);
+  size_t to;
+  size_t from = tokenIndex + 1;
+  // if none onchannel to right, nextOnChannel=-1 so set to = last token
+  if (nextOnChannel == -1) {
+    to = static_cast<ssize_t>(size() - 1);
+  } else {
+    to = nextOnChannel;
+  }
+
+  return filterForChannel(from, to, channel);
+}
+
+std::vector<Token *> BufferedTokenStream::getHiddenTokensToRight(size_t tokenIndex) {
+  return getHiddenTokensToRight(tokenIndex, -1);
+}
+
+std::vector<Token *> BufferedTokenStream::getHiddenTokensToLeft(size_t tokenIndex, ssize_t channel) {
+  lazyInit();
+  if (tokenIndex >= _tokens.size()) {
+    throw IndexOutOfBoundsException(std::to_string(tokenIndex) + " not in 0.." + std::to_string(_tokens.size() - 1));
+  }
+
+  if (tokenIndex == 0) {
+    // Obviously no tokens can appear before the first token.
+    return { };
+  }
+
+  ssize_t prevOnChannel = previousTokenOnChannel(tokenIndex - 1, Lexer::DEFAULT_TOKEN_CHANNEL);
+  if (prevOnChannel == static_cast<ssize_t>(tokenIndex - 1)) {
+    return { };
+  }
+  // if none onchannel to left, prevOnChannel=-1 then from=0
+  size_t from = static_cast<size_t>(prevOnChannel + 1);
+  size_t to = tokenIndex - 1;
+
+  return filterForChannel(from, to, channel);
+}
+
+std::vector<Token *> BufferedTokenStream::getHiddenTokensToLeft(size_t tokenIndex) {
+  return getHiddenTokensToLeft(tokenIndex, -1);
+}
+
+std::vector<Token *> BufferedTokenStream::filterForChannel(size_t from, size_t to, ssize_t channel) {
+  std::vector<Token *> hidden;
+  for (size_t i = from; i <= to; i++) {
+    Token *t = _tokens[i].get();
+    if (channel == -1) {
+      if (t->getChannel() != Lexer::DEFAULT_TOKEN_CHANNEL) {
+        hidden.push_back(t);
+      }
+    } else {
+      if (t->getChannel() == static_cast<size_t>(channel)) {
+        hidden.push_back(t);
+      }
+    }
+  }
+
+  return hidden;
+}
+
+bool BufferedTokenStream::isInitialized() const {
+  return !_needSetup;
+}
+
+/**
+ * Get the text of all tokens in this buffer.
+ */
+std::string BufferedTokenStream::getSourceName() const
+{
+  return _tokenSource->getSourceName();
+}
+
+std::string BufferedTokenStream::getText() {
+  fill();
+  return getText(misc::Interval(0U, size() - 1));
+}
+
+std::string BufferedTokenStream::getText(const misc::Interval &interval) {
+  lazyInit();
+  size_t start = interval.a;
+  size_t stop = interval.b;
+  if (start == INVALID_INDEX || stop == INVALID_INDEX) {
+    return "";
+  }
+  sync(stop);
+  if (stop >= _tokens.size()) {
+    stop = _tokens.size() - 1;
+  }
+
+  std::stringstream ss;
+  for (size_t i = start; i <= stop; i++) {
+    Token *t = _tokens[i].get();
+    if (t->getType() == Token::EOF) {
+      break;
+    }
+    ss << t->getText();
+  }
+  return ss.str();
+}
+
+std::string BufferedTokenStream::getText(RuleContext *ctx) {
+  return getText(ctx->getSourceInterval());
+}
+
+std::string BufferedTokenStream::getText(Token *start, Token *stop) {
+  if (start != nullptr && stop != nullptr) {
+    return getText(misc::Interval(start->getTokenIndex(), stop->getTokenIndex()));
+  }
+
+  return "";
+}
+
+void BufferedTokenStream::fill() {
+  lazyInit();
+  const size_t blockSize = 1000;
+  while (true) {
+    size_t fetched = fetch(blockSize);
+    if (fetched < blockSize) {
+      return;
+    }
+  }
+}
+
+void BufferedTokenStream::InitializeInstanceFields() {
+  _needSetup = true;
+  _fetchedEOF = false;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BufferedTokenStream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BufferedTokenStream.h
new file mode 100755
index 0000000000..fab74d24c2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/BufferedTokenStream.h
@@ -0,0 +1,200 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "TokenStream.h"
+
+namespace antlr4 {
+
+  /**
+   * This implementation of {@link TokenStream} loads tokens from a
+   * {@link TokenSource} on-demand, and places the tokens in a buffer to provide
+   * access to any previous token by index.
+   *
+   * <p>
+   * This token stream ignores the value of {@link Token#getChannel}. If your
+   * parser requires the token stream filter tokens to only those on a particular
+   * channel, such as {@link Token#DEFAULT_CHANNEL} or
+   * {@link Token#HIDDEN_CHANNEL}, use a filtering token stream such a
+   * {@link CommonTokenStream}.</p>
+   */
+  class ANTLR4CPP_PUBLIC BufferedTokenStream : public TokenStream {
+  public:
+    BufferedTokenStream(TokenSource *tokenSource);
+    BufferedTokenStream(const BufferedTokenStream& other) = delete;
+
+    BufferedTokenStream& operator = (const BufferedTokenStream& other) = delete;
+
+    virtual TokenSource* getTokenSource() const override;
+    virtual size_t index() override;
+    virtual ssize_t mark() override;
+
+    virtual void release(ssize_t marker) override;
+    virtual void reset();
+    virtual void seek(size_t index) override;
+
+    virtual size_t size() override;
+    virtual void consume() override;
+
+    virtual Token* get(size_t i) const override;
+
+    /// Get all tokens from start..stop inclusively.
+    virtual std::vector<Token *> get(size_t start, size_t stop);
+
+    virtual size_t LA(ssize_t i) override;
+    virtual Token* LT(ssize_t k) override;
+
+    /// Reset this token stream by setting its token source.
+    virtual void setTokenSource(TokenSource *tokenSource);
+    virtual std::vector<Token *> getTokens();
+    virtual std::vector<Token *> getTokens(size_t start, size_t stop);
+
+    /// <summary>
+    /// Given a start and stop index, return a List of all tokens in
+    ///  the token type BitSet.  Return null if no tokens were found.  This
+    ///  method looks at both on and off channel tokens.
+    /// </summary>
+    virtual std::vector<Token *> getTokens(size_t start, size_t stop, const std::vector<size_t> &types);
+    virtual std::vector<Token *> getTokens(size_t start, size_t stop, size_t ttype);
+
+    /// Collect all tokens on specified channel to the right of
+    ///  the current token up until we see a token on DEFAULT_TOKEN_CHANNEL or
+    ///  EOF. If channel is -1, find any non default channel token.
+    virtual std::vector<Token *> getHiddenTokensToRight(size_t tokenIndex, ssize_t channel);
+
+    /// <summary>
+    /// Collect all hidden tokens (any off-default channel) to the right of
+    ///  the current token up until we see a token on DEFAULT_TOKEN_CHANNEL
+    ///  or EOF.
+    /// </summary>
+    virtual std::vector<Token *> getHiddenTokensToRight(size_t tokenIndex);
+
+    /// <summary>
+    /// Collect all tokens on specified channel to the left of
+    ///  the current token up until we see a token on DEFAULT_TOKEN_CHANNEL.
+    ///  If channel is -1, find any non default channel token.
+    /// </summary>
+    virtual std::vector<Token *> getHiddenTokensToLeft(size_t tokenIndex, ssize_t channel);
+
+    /// <summary>
+    /// Collect all hidden tokens (any off-default channel) to the left of
+    ///  the current token up until we see a token on DEFAULT_TOKEN_CHANNEL.
+    /// </summary>
+    virtual std::vector<Token *> getHiddenTokensToLeft(size_t tokenIndex);
+
+    virtual std::string getSourceName() const override;
+    virtual std::string getText() override;
+    virtual std::string getText(const misc::Interval &interval) override;
+    virtual std::string getText(RuleContext *ctx) override;
+    virtual std::string getText(Token *start, Token *stop) override;
+
+    /// Get all tokens from lexer until EOF.
+    virtual void fill();
+
+  protected:
+    /**
+     * The {@link TokenSource} from which tokens for this stream are fetched.
+     */
+    TokenSource *_tokenSource;
+
+    /**
+     * A collection of all tokens fetched from the token source. The list is
+     * considered a complete view of the input once {@link #fetchedEOF} is set
+     * to {@code true}.
+     */
+    std::vector<std::unique_ptr<Token>> _tokens;
+
+    /**
+     * The index into {@link #tokens} of the current token (next token to
+     * {@link #consume}). {@link #tokens}{@code [}{@link #p}{@code ]} should be
+     * {@link #LT LT(1)}.
+     *
+     * <p>This field is set to -1 when the stream is first constructed or when
+     * {@link #setTokenSource} is called, indicating that the first token has
+     * not yet been fetched from the token source. For additional information,
+     * see the documentation of {@link IntStream} for a description of
+     * Initializing Methods.</p>
+     */
+    // ml: since -1 requires to make this member signed for just this single aspect we use a member _needSetup instead.
+    //     Use bool isInitialized() to find out if this stream has started reading.
+    size_t _p;
+
+    /**
+     * Indicates whether the {@link Token#EOF} token has been fetched from
+     * {@link #tokenSource} and added to {@link #tokens}. This field improves
+     * performance for the following cases:
+     *
+     * <ul>
+     * <li>{@link #consume}: The lookahead check in {@link #consume} to prevent
+     * consuming the EOF symbol is optimized by checking the values of
+     * {@link #fetchedEOF} and {@link #p} instead of calling {@link #LA}.</li>
+     * <li>{@link #fetch}: The check to prevent adding multiple EOF symbols into
+     * {@link #tokens} is trivial with this field.</li>
+     * <ul>
+     */
+    bool _fetchedEOF;
+
+    /// <summary>
+    /// Make sure index {@code i} in tokens has a token.
+    /// </summary>
+    /// <returns> {@code true} if a token is located at index {@code i}, otherwise
+    ///    {@code false}. </returns>
+    /// <seealso cref= #get(int i) </seealso>
+    virtual bool sync(size_t i);
+
+    /// <summary>
+    /// Add {@code n} elements to buffer.
+    /// </summary>
+    /// <returns> The actual number of elements added to the buffer. </returns>
+    virtual size_t fetch(size_t n);
+
+    virtual Token* LB(size_t k);
+
+    /// Allowed derived classes to modify the behavior of operations which change
+    /// the current stream position by adjusting the target token index of a seek
+    /// operation. The default implementation simply returns {@code i}. If an
+    /// exception is thrown in this method, the current stream index should not be
+    /// changed.
+    /// <p/>
+    /// For example, <seealso cref="CommonTokenStream"/> overrides this method to ensure that
+    /// the seek target is always an on-channel token.
+    ///
+    /// <param name="i"> The target token index. </param>
+    /// <returns> The adjusted target token index. </returns>
+    virtual ssize_t adjustSeekIndex(size_t i);
+    void lazyInit();
+    virtual void setup();
+
+    /**
+     * Given a starting index, return the index of the next token on channel.
+     * Return {@code i} if {@code tokens[i]} is on channel. Return the index of
+     * the EOF token if there are no tokens on channel between {@code i} and
+     * EOF.
+     */
+    virtual ssize_t nextTokenOnChannel(size_t i, size_t channel);
+
+    /**
+     * Given a starting index, return the index of the previous token on
+     * channel. Return {@code i} if {@code tokens[i]} is on channel. Return -1
+     * if there are no tokens on channel between {@code i} and 0.
+     *
+     * <p>
+     * If {@code i} specifies an index at or after the EOF token, the EOF token
+     * index is returned. This is due to the fact that the EOF token is treated
+     * as though it were on every channel.</p>
+     */
+    virtual ssize_t previousTokenOnChannel(size_t i, size_t channel);
+
+    virtual std::vector<Token *> filterForChannel(size_t from, size_t to, ssize_t channel);
+
+    bool isInitialized() const;
+
+  private:
+    bool _needSetup;
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CharStream.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CharStream.cpp
new file mode 100755
index 0000000000..5f38032d04
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CharStream.cpp
@@ -0,0 +1,11 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "CharStream.h"
+
+using namespace antlr4;
+
+CharStream::~CharStream() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CharStream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CharStream.h
new file mode 100755
index 0000000000..5f2a3408d7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CharStream.h
@@ -0,0 +1,37 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "IntStream.h"
+#include "misc/Interval.h"
+
+namespace antlr4 {
+
+  /// A source of characters for an ANTLR lexer.
+  class ANTLR4CPP_PUBLIC CharStream : public IntStream {
+  public:
+    virtual ~CharStream();
+
+    /// This method returns the text for a range of characters within this input
+    /// stream. This method is guaranteed to not throw an exception if the
+    /// specified interval lies entirely within a marked range. For more
+    /// information about marked ranges, see IntStream::mark.
+    ///
+    /// <param name="interval"> an interval within the stream </param>
+    /// <returns> the text of the specified interval
+    /// </returns>
+    /// <exception cref="NullPointerException"> if {@code interval} is {@code null} </exception>
+    /// <exception cref="IllegalArgumentException"> if {@code interval.a < 0}, or if
+    /// {@code interval.b < interval.a - 1}, or if {@code interval.b} lies at or
+    /// past the end of the stream </exception>
+    /// <exception cref="UnsupportedOperationException"> if the stream does not support
+    /// getting the text of the specified interval </exception>
+    virtual std::string getText(const misc::Interval &interval) = 0;
+
+    virtual std::string toString() const = 0;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonToken.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonToken.cpp
new file mode 100755
index 0000000000..1497846d37
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonToken.cpp
@@ -0,0 +1,193 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "TokenSource.h"
+#include "CharStream.h"
+#include "Recognizer.h"
+#include "Vocabulary.h"
+
+#include "misc/Interval.h"
+
+#include "support/CPPUtils.h"
+#include "support/StringUtils.h"
+
+#include "CommonToken.h"
+
+using namespace antlr4;
+using namespace antlr4::misc;
+
+using namespace antlrcpp;
+
+const std::pair<TokenSource*, CharStream*> CommonToken::EMPTY_SOURCE;
+
+CommonToken::CommonToken(size_t type) {
+  InitializeInstanceFields();
+  _type = type;
+}
+
+CommonToken::CommonToken(std::pair<TokenSource*, CharStream*> source, size_t type, size_t channel, size_t start, size_t stop) {
+  InitializeInstanceFields();
+  _source = source;
+  _type = type;
+  _channel = channel;
+  _start = start;
+  _stop = stop;
+  if (_source.first != nullptr) {
+    _line = static_cast<int>(source.first->getLine());
+    _charPositionInLine = source.first->getCharPositionInLine();
+  }
+}
+
+CommonToken::CommonToken(size_t type, const std::string &text) {
+  InitializeInstanceFields();
+  _type = type;
+  _channel = DEFAULT_CHANNEL;
+  _text = text;
+  _source = EMPTY_SOURCE;
+}
+
+CommonToken::CommonToken(Token *oldToken) {
+  InitializeInstanceFields();
+  _type = oldToken->getType();
+  _line = oldToken->getLine();
+  _index = oldToken->getTokenIndex();
+  _charPositionInLine = oldToken->getCharPositionInLine();
+  _channel = oldToken->getChannel();
+  _start = oldToken->getStartIndex();
+  _stop = oldToken->getStopIndex();
+
+  if (is<CommonToken *>(oldToken)) {
+    _text = (static_cast<CommonToken *>(oldToken))->_text;
+    _source = (static_cast<CommonToken *>(oldToken))->_source;
+  } else {
+    _text = oldToken->getText();
+    _source = { oldToken->getTokenSource(), oldToken->getInputStream() };
+  }
+}
+
+size_t CommonToken::getType() const {
+  return _type;
+}
+
+void CommonToken::setLine(size_t line) {
+  _line = line;
+}
+
+std::string CommonToken::getText() const {
+  if (!_text.empty()) {
+    return _text;
+  }
+
+  CharStream *input = getInputStream();
+  if (input == nullptr) {
+    return "";
+  }
+  size_t n = input->size();
+  if (_start < n && _stop < n) {
+    return input->getText(misc::Interval(_start, _stop));
+  } else {
+    return "<EOF>";
+  }
+}
+
+void CommonToken::setText(const std::string &text) {
+  _text = text;
+}
+
+size_t CommonToken::getLine() const {
+  return _line;
+}
+
+size_t CommonToken::getCharPositionInLine() const {
+  return _charPositionInLine;
+}
+
+void CommonToken::setCharPositionInLine(size_t charPositionInLine) {
+  _charPositionInLine = charPositionInLine;
+}
+
+size_t CommonToken::getChannel() const {
+  return _channel;
+}
+
+void CommonToken::setChannel(size_t channel) {
+  _channel = channel;
+}
+
+void CommonToken::setType(size_t type) {
+  _type = type;
+}
+
+size_t CommonToken::getStartIndex() const {
+  return _start;
+}
+
+void CommonToken::setStartIndex(size_t start) {
+  _start = start;
+}
+
+size_t CommonToken::getStopIndex() const {
+  return _stop;
+}
+
+void CommonToken::setStopIndex(size_t stop) {
+  _stop = stop;
+}
+
+size_t CommonToken::getTokenIndex() const {
+  return _index;
+}
+
+void CommonToken::setTokenIndex(size_t index) {
+  _index = index;
+}
+
+antlr4::TokenSource *CommonToken::getTokenSource() const {
+  return _source.first;
+}
+
+antlr4::CharStream *CommonToken::getInputStream() const {
+  return _source.second;
+}
+
+std::string CommonToken::toString() const {
+  return toString(nullptr);
+}
+
+std::string CommonToken::toString(Recognizer *r) const {
+  std::stringstream ss;
+
+  std::string channelStr;
+  if (_channel > 0) {
+    channelStr = ",channel=" + std::to_string(_channel);
+  }
+  std::string txt = getText();
+  if (!txt.empty()) {
+    txt = antlrcpp::escapeWhitespace(txt);
+  } else {
+    txt = "<no text>";
+  }
+
+  std::string typeString = std::to_string(symbolToNumeric(_type));
+  if (r != nullptr)
+    typeString = r->getVocabulary().getDisplayName(_type);
+
+  ss << "[@" << symbolToNumeric(getTokenIndex()) << "," << symbolToNumeric(_start) << ":" << symbolToNumeric(_stop)
+    << "='" << txt << "',<" << typeString << ">" << channelStr << "," << _line << ":"
+    << getCharPositionInLine() << "]";
+
+  return ss.str();
+}
+
+void CommonToken::InitializeInstanceFields() {
+  _type = 0;
+  _line = 0;
+  _charPositionInLine = INVALID_INDEX;
+  _channel = DEFAULT_CHANNEL;
+  _index = INVALID_INDEX;
+  _start = 0;
+  _stop = 0;
+  _source = EMPTY_SOURCE;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonToken.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonToken.h
new file mode 100755
index 0000000000..fdaab14de7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonToken.h
@@ -0,0 +1,158 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "WritableToken.h"
+
+namespace antlr4 {
+
+  class ANTLR4CPP_PUBLIC CommonToken : public WritableToken {
+  protected:
+    /**
+     * An empty {@link Pair} which is used as the default value of
+     * {@link #source} for tokens that do not have a source.
+     */
+    static const std::pair<TokenSource *, CharStream *> EMPTY_SOURCE;
+
+    /**
+     * This is the backing field for {@link #getType} and {@link #setType}.
+     */
+    size_t _type;
+
+    /**
+     * This is the backing field for {@link #getLine} and {@link #setLine}.
+     */
+    size_t _line;
+
+    /**
+     * This is the backing field for {@link #getCharPositionInLine} and
+     * {@link #setCharPositionInLine}.
+     */
+    size_t _charPositionInLine; // set to invalid position
+
+    /**
+     * This is the backing field for {@link #getChannel} and
+     * {@link #setChannel}.
+     */
+    size_t _channel;
+
+    /**
+     * This is the backing field for {@link #getTokenSource} and
+     * {@link #getInputStream}.
+     *
+     * <p>
+     * These properties share a field to reduce the memory footprint of
+     * {@link CommonToken}. Tokens created by a {@link CommonTokenFactory} from
+     * the same source and input stream share a reference to the same
+     * {@link Pair} containing these values.</p>
+     */
+
+    std::pair<TokenSource *, CharStream *> _source; // ml: pure references, usually from statically allocated classes.
+
+    /**
+     * This is the backing field for {@link #getText} when the token text is
+     * explicitly set in the constructor or via {@link #setText}.
+     *
+     * @see #getText()
+     */
+    std::string _text;
+
+    /**
+     * This is the backing field for {@link #getTokenIndex} and
+     * {@link #setTokenIndex}.
+     */
+    size_t _index;
+
+    /**
+     * This is the backing field for {@link #getStartIndex} and
+     * {@link #setStartIndex}.
+     */
+    size_t _start;
+
+    /**
+     * This is the backing field for {@link #getStopIndex} and
+     * {@link #setStopIndex}.
+     */
+    size_t _stop;
+
+  public:
+    /**
+     * Constructs a new {@link CommonToken} with the specified token type.
+     *
+     * @param type The token type.
+     */
+    CommonToken(size_t type);
+    CommonToken(std::pair<TokenSource*, CharStream*> source, size_t type, size_t channel, size_t start, size_t stop);
+
+    /**
+     * Constructs a new {@link CommonToken} with the specified token type and
+     * text.
+     *
+     * @param type The token type.
+     * @param text The text of the token.
+     */
+    CommonToken(size_t type, const std::string &text);
+
+    /**
+     * Constructs a new {@link CommonToken} as a copy of another {@link Token}.
+     *
+     * <p>
+     * If {@code oldToken} is also a {@link CommonToken} instance, the newly
+     * constructed token will share a reference to the {@link #text} field and
+     * the {@link Pair} stored in {@link #source}. Otherwise, {@link #text} will
+     * be assigned the result of calling {@link #getText}, and {@link #source}
+     * will be constructed from the result of {@link Token#getTokenSource} and
+     * {@link Token#getInputStream}.</p>
+     *
+     * @param oldToken The token to copy.
+     */
+    CommonToken(Token *oldToken);
+
+    virtual size_t getType() const override;
+
+    /**
+     * Explicitly set the text for this token. If {code text} is not
+     * {@code null}, then {@link #getText} will return this value rather than
+     * extracting the text from the input.
+     *
+     * @param text The explicit text of the token, or {@code null} if the text
+     * should be obtained from the input along with the start and stop indexes
+     * of the token.
+     */
+    virtual void setText(const std::string &text) override;
+    virtual std::string getText() const override;
+
+    virtual void setLine(size_t line) override;
+    virtual size_t getLine() const override;
+
+    virtual size_t getCharPositionInLine() const override;
+    virtual void setCharPositionInLine(size_t charPositionInLine) override;
+
+    virtual size_t getChannel() const override;
+    virtual void setChannel(size_t channel) override;
+
+    virtual void setType(size_t type) override;
+
+    virtual size_t getStartIndex() const override;
+    virtual void setStartIndex(size_t start);
+
+    virtual size_t getStopIndex() const override;
+    virtual void setStopIndex(size_t stop);
+
+    virtual size_t getTokenIndex() const override;
+    virtual void setTokenIndex(size_t index) override;
+
+    virtual TokenSource *getTokenSource() const override;
+    virtual CharStream *getInputStream() const override;
+
+    virtual std::string toString() const override;
+
+    virtual std::string toString(Recognizer *r) const;
+  private:
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenFactory.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenFactory.cpp
new file mode 100755
index 0000000000..b04d68fbc2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenFactory.cpp
@@ -0,0 +1,39 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/Interval.h"
+#include "CommonToken.h"
+#include "CharStream.h"
+
+#include "CommonTokenFactory.h"
+
+using namespace antlr4;
+
+const std::unique_ptr<TokenFactory<CommonToken>> CommonTokenFactory::DEFAULT(new CommonTokenFactory);
+
+CommonTokenFactory::CommonTokenFactory(bool copyText_) : copyText(copyText_) {
+}
+
+CommonTokenFactory::CommonTokenFactory() : CommonTokenFactory(false) {
+}
+
+std::unique_ptr<CommonToken> CommonTokenFactory::create(std::pair<TokenSource*, CharStream*> source, size_t type,
+  const std::string &text, size_t channel, size_t start, size_t stop, size_t line, size_t charPositionInLine) {
+
+  std::unique_ptr<CommonToken> t(new CommonToken(source, type, channel, start, stop));
+  t->setLine(line);
+  t->setCharPositionInLine(charPositionInLine);
+  if (text != "") {
+    t->setText(text);
+  } else if (copyText && source.second != nullptr) {
+    t->setText(source.second->getText(misc::Interval(start, stop)));
+  }
+
+  return t;
+}
+
+std::unique_ptr<CommonToken> CommonTokenFactory::create(size_t type, const std::string &text) {
+  return std::unique_ptr<CommonToken>(new CommonToken(type, text));
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenFactory.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenFactory.h
new file mode 100755
index 0000000000..129e9fc257
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenFactory.h
@@ -0,0 +1,74 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "TokenFactory.h"
+
+namespace antlr4 {
+
+  /**
+   * This default implementation of {@link TokenFactory} creates
+   * {@link CommonToken} objects.
+   */
+  class ANTLR4CPP_PUBLIC CommonTokenFactory : public TokenFactory<CommonToken> {
+  public:
+    /**
+     * The default {@link CommonTokenFactory} instance.
+     *
+     * <p>
+     * This token factory does not explicitly copy token text when constructing
+     * tokens.</p>
+     */
+    static const std::unique_ptr<TokenFactory<CommonToken>> DEFAULT;
+
+  protected:
+    /**
+     * Indicates whether {@link CommonToken#setText} should be called after
+     * constructing tokens to explicitly set the text. This is useful for cases
+     * where the input stream might not be able to provide arbitrary substrings
+     * of text from the input after the lexer creates a token (e.g. the
+     * implementation of {@link CharStream#getText} in
+     * {@link UnbufferedCharStream} throws an
+     * {@link UnsupportedOperationException}). Explicitly setting the token text
+     * allows {@link Token#getText} to be called at any time regardless of the
+     * input stream implementation.
+     *
+     * <p>
+     * The default value is {@code false} to avoid the performance and memory
+     * overhead of copying text for every token unless explicitly requested.</p>
+     */
+    const bool copyText;
+
+  public:
+    /**
+     * Constructs a {@link CommonTokenFactory} with the specified value for
+     * {@link #copyText}.
+     *
+     * <p>
+     * When {@code copyText} is {@code false}, the {@link #DEFAULT} instance
+     * should be used instead of constructing a new instance.</p>
+     *
+     * @param copyText The value for {@link #copyText}.
+     */
+    CommonTokenFactory(bool copyText);
+
+    /**
+     * Constructs a {@link CommonTokenFactory} with {@link #copyText} set to
+     * {@code false}.
+     *
+     * <p>
+     * The {@link #DEFAULT} instance should be used instead of calling this
+     * directly.</p>
+     */
+    CommonTokenFactory();
+
+    virtual std::unique_ptr<CommonToken> create(std::pair<TokenSource*, CharStream*> source, size_t type,
+      const std::string &text, size_t channel, size_t start, size_t stop, size_t line, size_t charPositionInLine) override;
+
+    virtual std::unique_ptr<CommonToken> create(size_t type, const std::string &text) override;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenStream.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenStream.cpp
new file mode 100755
index 0000000000..7834296ae2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenStream.cpp
@@ -0,0 +1,78 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Token.h"
+
+#include "CommonTokenStream.h"
+
+using namespace antlr4;
+
+CommonTokenStream::CommonTokenStream(TokenSource *tokenSource) : CommonTokenStream(tokenSource, Token::DEFAULT_CHANNEL) {
+}
+
+CommonTokenStream::CommonTokenStream(TokenSource *tokenSource, size_t channel_)
+: BufferedTokenStream(tokenSource), channel(channel_) {
+}
+
+ssize_t CommonTokenStream::adjustSeekIndex(size_t i) {
+  return nextTokenOnChannel(i, channel);
+}
+
+Token* CommonTokenStream::LB(size_t k) {
+  if (k == 0 || k > _p) {
+    return nullptr;
+  }
+
+  ssize_t i = static_cast<ssize_t>(_p);
+  size_t n = 1;
+  // find k good tokens looking backwards
+  while (n <= k) {
+    // skip off-channel tokens
+    i = previousTokenOnChannel(i - 1, channel);
+    n++;
+  }
+  if (i < 0) {
+    return nullptr;
+  }
+
+  return _tokens[i].get();
+}
+
+Token* CommonTokenStream::LT(ssize_t k) {
+  lazyInit();
+  if (k == 0) {
+    return nullptr;
+  }
+  if (k < 0) {
+    return LB(static_cast<size_t>(-k));
+  }
+  size_t i = _p;
+  ssize_t n = 1; // we know tokens[p] is a good one
+                 // find k good tokens
+  while (n < k) {
+    // skip off-channel tokens, but make sure to not look past EOF
+    if (sync(i + 1)) {
+      i = nextTokenOnChannel(i + 1, channel);
+    }
+    n++;
+  }
+
+  return _tokens[i].get();
+}
+
+int CommonTokenStream::getNumberOfOnChannelTokens() {
+  int n = 0;
+  fill();
+  for (size_t i = 0; i < _tokens.size(); i++) {
+    Token *t = _tokens[i].get();
+    if (t->getChannel() == channel) {
+      n++;
+    }
+    if (t->getType() == Token::EOF) {
+      break;
+    }
+  }
+  return n;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenStream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenStream.h
new file mode 100755
index 0000000000..628a986f7b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/CommonTokenStream.h
@@ -0,0 +1,79 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "BufferedTokenStream.h"
+
+namespace antlr4 {
+
+  /**
+   * This class extends {@link BufferedTokenStream} with functionality to filter
+   * token streams to tokens on a particular channel (tokens where
+   * {@link Token#getChannel} returns a particular value).
+   *
+   * <p>
+   * This token stream provides access to all tokens by index or when calling
+   * methods like {@link #getText}. The channel filtering is only used for code
+   * accessing tokens via the lookahead methods {@link #LA}, {@link #LT}, and
+   * {@link #LB}.</p>
+   *
+   * <p>
+   * By default, tokens are placed on the default channel
+   * ({@link Token#DEFAULT_CHANNEL}), but may be reassigned by using the
+   * {@code ->channel(HIDDEN)} lexer command, or by using an embedded action to
+   * call {@link Lexer#setChannel}.
+   * </p>
+   *
+   * <p>
+   * Note: lexer rules which use the {@code ->skip} lexer command or call
+   * {@link Lexer#skip} do not produce tokens at all, so input text matched by
+   * such a rule will not be available as part of the token stream, regardless of
+   * channel.</p>
+   */
+  class ANTLR4CPP_PUBLIC CommonTokenStream : public BufferedTokenStream {
+  public:
+    /**
+     * Constructs a new {@link CommonTokenStream} using the specified token
+     * source and the default token channel ({@link Token#DEFAULT_CHANNEL}).
+     *
+     * @param tokenSource The token source.
+     */
+    CommonTokenStream(TokenSource *tokenSource);
+
+    /**
+     * Constructs a new {@link CommonTokenStream} using the specified token
+     * source and filtering tokens to the specified channel. Only tokens whose
+     * {@link Token#getChannel} matches {@code channel} or have the
+     * {@link Token#getType} equal to {@link Token#EOF} will be returned by the
+     * token stream lookahead methods.
+     *
+     * @param tokenSource The token source.
+     * @param channel The channel to use for filtering tokens.
+     */
+    CommonTokenStream(TokenSource *tokenSource, size_t channel);
+
+    virtual Token* LT(ssize_t k) override;
+
+    /// Count EOF just once.
+    virtual int getNumberOfOnChannelTokens();
+    
+  protected:
+    /**
+     * Specifies the channel to use for filtering tokens.
+     *
+     * <p>
+     * The default value is {@link Token#DEFAULT_CHANNEL}, which matches the
+     * default channel assigned to tokens created by the lexer.</p>
+     */
+    size_t channel;
+
+    virtual ssize_t adjustSeekIndex(size_t i) override;
+
+    virtual Token* LB(size_t k) override;
+
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ConsoleErrorListener.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ConsoleErrorListener.cpp
new file mode 100755
index 0000000000..c7925e4270
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ConsoleErrorListener.cpp
@@ -0,0 +1,15 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "ConsoleErrorListener.h"
+
+using namespace antlr4;
+
+ConsoleErrorListener ConsoleErrorListener::INSTANCE;
+
+void ConsoleErrorListener::syntaxError(Recognizer * /*recognizer*/, Token * /*offendingSymbol*/,
+  size_t line, size_t charPositionInLine, const std::string &msg, std::exception_ptr /*e*/)  {
+  std::cerr << "line " << line << ":" << charPositionInLine << " " << msg << std::endl;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ConsoleErrorListener.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ConsoleErrorListener.h
new file mode 100755
index 0000000000..65c6f8c1eb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ConsoleErrorListener.h
@@ -0,0 +1,35 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "BaseErrorListener.h"
+
+namespace antlr4 {
+
+  class ANTLR4CPP_PUBLIC ConsoleErrorListener : public BaseErrorListener {
+  public:
+    /**
+     * Provides a default instance of {@link ConsoleErrorListener}.
+     */
+    static ConsoleErrorListener INSTANCE;
+
+    /**
+     * {@inheritDoc}
+     *
+     * <p>
+     * This implementation prints messages to {@link System#err} containing the
+     * values of {@code line}, {@code charPositionInLine}, and {@code msg} using
+     * the following format.</p>
+     *
+     * <pre>
+     * line <em>line</em>:<em>charPositionInLine</em> <em>msg</em>
+     * </pre>
+     */
+    virtual void syntaxError(Recognizer *recognizer, Token * offendingSymbol, size_t line, size_t charPositionInLine,
+                             const std::string &msg, std::exception_ptr e) override;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DefaultErrorStrategy.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DefaultErrorStrategy.cpp
new file mode 100755
index 0000000000..54d35ee3b1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DefaultErrorStrategy.cpp
@@ -0,0 +1,336 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "NoViableAltException.h"
+#include "misc/IntervalSet.h"
+#include "atn/ParserATNSimulator.h"
+#include "InputMismatchException.h"
+#include "FailedPredicateException.h"
+#include "ParserRuleContext.h"
+#include "atn/RuleTransition.h"
+#include "atn/ATN.h"
+#include "atn/ATNState.h"
+#include "support/StringUtils.h"
+#include "support/Casts.h"
+#include "Parser.h"
+#include "CommonToken.h"
+#include "Vocabulary.h"
+
+#include "DefaultErrorStrategy.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+using namespace antlrcpp;
+
+DefaultErrorStrategy::DefaultErrorStrategy() {
+  InitializeInstanceFields();
+}
+
+DefaultErrorStrategy::~DefaultErrorStrategy() {
+}
+
+void DefaultErrorStrategy::reset(Parser *recognizer) {
+  _errorSymbols.clear();
+  endErrorCondition(recognizer);
+}
+
+void DefaultErrorStrategy::beginErrorCondition(Parser * /*recognizer*/) {
+  errorRecoveryMode = true;
+}
+
+bool DefaultErrorStrategy::inErrorRecoveryMode(Parser * /*recognizer*/) {
+  return errorRecoveryMode;
+}
+
+void DefaultErrorStrategy::endErrorCondition(Parser * /*recognizer*/) {
+  errorRecoveryMode = false;
+  lastErrorIndex = -1;
+}
+
+void DefaultErrorStrategy::reportMatch(Parser *recognizer) {
+  endErrorCondition(recognizer);
+}
+
+void DefaultErrorStrategy::reportError(Parser *recognizer, const RecognitionException &e) {
+  // If we've already reported an error and have not matched a token
+  // yet successfully, don't report any errors.
+  if (inErrorRecoveryMode(recognizer)) {
+    return; // don't report spurious errors
+  }
+
+  beginErrorCondition(recognizer);
+  if (is<const NoViableAltException *>(&e)) {
+    reportNoViableAlternative(recognizer, static_cast<const NoViableAltException &>(e));
+  } else if (is<const InputMismatchException *>(&e)) {
+    reportInputMismatch(recognizer, static_cast<const InputMismatchException &>(e));
+  } else if (is<const FailedPredicateException *>(&e)) {
+    reportFailedPredicate(recognizer, static_cast<const FailedPredicateException &>(e));
+  } else if (is<const RecognitionException *>(&e)) {
+    recognizer->notifyErrorListeners(e.getOffendingToken(), e.what(), std::current_exception());
+  }
+}
+
+void DefaultErrorStrategy::recover(Parser *recognizer, std::exception_ptr /*e*/) {
+  if (lastErrorIndex == static_cast<int>(recognizer->getInputStream()->index()) &&
+      lastErrorStates.contains(recognizer->getState())) {
+
+    // uh oh, another error at same token index and previously-visited
+    // state in ATN; must be a case where LT(1) is in the recovery
+    // token set so nothing got consumed. Consume a single token
+    // at least to prevent an infinite loop; this is a failsafe.
+    recognizer->consume();
+  }
+  lastErrorIndex = static_cast<int>(recognizer->getInputStream()->index());
+  lastErrorStates.add(recognizer->getState());
+  misc::IntervalSet followSet = getErrorRecoverySet(recognizer);
+  consumeUntil(recognizer, followSet);
+}
+
+void DefaultErrorStrategy::sync(Parser *recognizer) {
+  atn::ATNState *s = recognizer->getInterpreter<atn::ATNSimulator>()->atn.states[recognizer->getState()];
+
+  // If already recovering, don't try to sync
+  if (inErrorRecoveryMode(recognizer)) {
+    return;
+  }
+
+  TokenStream *tokens = recognizer->getTokenStream();
+  size_t la = tokens->LA(1);
+
+  // try cheaper subset first; might get lucky. seems to shave a wee bit off
+  auto nextTokens = recognizer->getATN().nextTokens(s);
+  if (nextTokens.contains(Token::EPSILON) || nextTokens.contains(la)) {
+    return;
+  }
+
+  switch (s->getStateType()) {
+    case atn::ATNStateType::BLOCK_START:
+    case atn::ATNStateType::STAR_BLOCK_START:
+    case atn::ATNStateType::PLUS_BLOCK_START:
+    case atn::ATNStateType::STAR_LOOP_ENTRY:
+      // report error and recover if possible
+      if (singleTokenDeletion(recognizer) != nullptr) {
+        return;
+      }
+
+      throw InputMismatchException(recognizer);
+
+    case atn::ATNStateType::PLUS_LOOP_BACK:
+    case atn::ATNStateType::STAR_LOOP_BACK: {
+      reportUnwantedToken(recognizer);
+      misc::IntervalSet expecting = recognizer->getExpectedTokens();
+      misc::IntervalSet whatFollowsLoopIterationOrRule = expecting.Or(getErrorRecoverySet(recognizer));
+      consumeUntil(recognizer, whatFollowsLoopIterationOrRule);
+    }
+      break;
+
+    default:
+      // do nothing if we can't identify the exact kind of ATN state
+      break;
+  }
+}
+
+void DefaultErrorStrategy::reportNoViableAlternative(Parser *recognizer, const NoViableAltException &e) {
+  TokenStream *tokens = recognizer->getTokenStream();
+  std::string input;
+  if (tokens != nullptr) {
+    if (e.getStartToken()->getType() == Token::EOF) {
+      input = "<EOF>";
+    } else {
+      input = tokens->getText(e.getStartToken(), e.getOffendingToken());
+    }
+  } else {
+    input = "<unknown input>";
+  }
+  std::string msg = "no viable alternative at input " + escapeWSAndQuote(input);
+  recognizer->notifyErrorListeners(e.getOffendingToken(), msg, std::make_exception_ptr(e));
+}
+
+void DefaultErrorStrategy::reportInputMismatch(Parser *recognizer, const InputMismatchException &e) {
+  std::string msg = "mismatched input " + getTokenErrorDisplay(e.getOffendingToken()) +
+  " expecting " + e.getExpectedTokens().toString(recognizer->getVocabulary());
+  recognizer->notifyErrorListeners(e.getOffendingToken(), msg, std::make_exception_ptr(e));
+}
+
+void DefaultErrorStrategy::reportFailedPredicate(Parser *recognizer, const FailedPredicateException &e) {
+  const std::string& ruleName = recognizer->getRuleNames()[recognizer->getContext()->getRuleIndex()];
+  std::string msg = "rule " + ruleName + " " + e.what();
+  recognizer->notifyErrorListeners(e.getOffendingToken(), msg, std::make_exception_ptr(e));
+}
+
+void DefaultErrorStrategy::reportUnwantedToken(Parser *recognizer) {
+  if (inErrorRecoveryMode(recognizer)) {
+    return;
+  }
+
+  beginErrorCondition(recognizer);
+
+  Token *t = recognizer->getCurrentToken();
+  std::string tokenName = getTokenErrorDisplay(t);
+  misc::IntervalSet expecting = getExpectedTokens(recognizer);
+
+  std::string msg = "extraneous input " + tokenName + " expecting " + expecting.toString(recognizer->getVocabulary());
+  recognizer->notifyErrorListeners(t, msg, nullptr);
+}
+
+void DefaultErrorStrategy::reportMissingToken(Parser *recognizer) {
+  if (inErrorRecoveryMode(recognizer)) {
+    return;
+  }
+
+  beginErrorCondition(recognizer);
+
+  Token *t = recognizer->getCurrentToken();
+  misc::IntervalSet expecting = getExpectedTokens(recognizer);
+  std::string expectedText = expecting.toString(recognizer->getVocabulary());
+  std::string msg = "missing " + expectedText + " at " + getTokenErrorDisplay(t);
+
+  recognizer->notifyErrorListeners(t, msg, nullptr);
+}
+
+Token* DefaultErrorStrategy::recoverInline(Parser *recognizer) {
+  // Single token deletion.
+  Token *matchedSymbol = singleTokenDeletion(recognizer);
+  if (matchedSymbol) {
+    // We have deleted the extra token.
+    // Now, move past ttype token as if all were ok.
+    recognizer->consume();
+    return matchedSymbol;
+  }
+
+  // Single token insertion.
+  if (singleTokenInsertion(recognizer)) {
+    return getMissingSymbol(recognizer);
+  }
+
+  // Even that didn't work; must throw the exception.
+  throw InputMismatchException(recognizer);
+}
+
+bool DefaultErrorStrategy::singleTokenInsertion(Parser *recognizer) {
+  ssize_t currentSymbolType = recognizer->getInputStream()->LA(1);
+
+  // if current token is consistent with what could come after current
+  // ATN state, then we know we're missing a token; error recovery
+  // is free to conjure up and insert the missing token
+  atn::ATNState *currentState = recognizer->getInterpreter<atn::ATNSimulator>()->atn.states[recognizer->getState()];
+  atn::ATNState *next = currentState->transitions[0]->target;
+  const atn::ATN &atn = recognizer->getInterpreter<atn::ATNSimulator>()->atn;
+  misc::IntervalSet expectingAtLL2 = atn.nextTokens(next, recognizer->getContext());
+  if (expectingAtLL2.contains(currentSymbolType)) {
+    reportMissingToken(recognizer);
+    return true;
+  }
+  return false;
+}
+
+Token* DefaultErrorStrategy::singleTokenDeletion(Parser *recognizer) {
+  size_t nextTokenType = recognizer->getInputStream()->LA(2);
+  misc::IntervalSet expecting = getExpectedTokens(recognizer);
+  if (expecting.contains(nextTokenType)) {
+    reportUnwantedToken(recognizer);
+    recognizer->consume(); // simply delete extra token
+                           // we want to return the token we're actually matching
+    Token *matchedSymbol = recognizer->getCurrentToken();
+    reportMatch(recognizer); // we know current token is correct
+    return matchedSymbol;
+  }
+  return nullptr;
+}
+
+Token* DefaultErrorStrategy::getMissingSymbol(Parser *recognizer) {
+  Token *currentSymbol = recognizer->getCurrentToken();
+  misc::IntervalSet expecting = getExpectedTokens(recognizer);
+  size_t expectedTokenType = expecting.getMinElement(); // get any element
+  std::string tokenText;
+  if (expectedTokenType == Token::EOF) {
+    tokenText = "<missing EOF>";
+  } else {
+    tokenText = "<missing " + recognizer->getVocabulary().getDisplayName(expectedTokenType) + ">";
+  }
+  Token *current = currentSymbol;
+  Token *lookback = recognizer->getTokenStream()->LT(-1);
+  if (current->getType() == Token::EOF && lookback != nullptr) {
+    current = lookback;
+  }
+
+  _errorSymbols.push_back(recognizer->getTokenFactory()->create(
+    { current->getTokenSource(), current->getTokenSource()->getInputStream() },
+    expectedTokenType, tokenText, Token::DEFAULT_CHANNEL, INVALID_INDEX, INVALID_INDEX,
+    current->getLine(), current->getCharPositionInLine()));
+
+  return _errorSymbols.back().get();
+}
+
+misc::IntervalSet DefaultErrorStrategy::getExpectedTokens(Parser *recognizer) {
+  return recognizer->getExpectedTokens();
+}
+
+std::string DefaultErrorStrategy::getTokenErrorDisplay(Token *t) {
+  if (t == nullptr) {
+    return "<no Token>";
+  }
+  std::string s = getSymbolText(t);
+  if (s == "") {
+    if (getSymbolType(t) == Token::EOF) {
+      s = "<EOF>";
+    } else {
+      s = "<" + std::to_string(getSymbolType(t)) + ">";
+    }
+  }
+  return escapeWSAndQuote(s);
+}
+
+std::string DefaultErrorStrategy::getSymbolText(Token *symbol) {
+  return symbol->getText();
+}
+
+size_t DefaultErrorStrategy::getSymbolType(Token *symbol) {
+  return symbol->getType();
+}
+
+std::string DefaultErrorStrategy::escapeWSAndQuote(const std::string &s) const {
+  std::string result;
+  result.reserve(s.size() + 2);
+  result.push_back('\'');
+  antlrcpp::escapeWhitespace(result, s);
+  result.push_back('\'');
+  result.shrink_to_fit();
+  return result;
+}
+
+misc::IntervalSet DefaultErrorStrategy::getErrorRecoverySet(Parser *recognizer) {
+  const atn::ATN &atn = recognizer->getInterpreter<atn::ATNSimulator>()->atn;
+  RuleContext *ctx = recognizer->getContext();
+  misc::IntervalSet recoverSet;
+  while (ctx->invokingState != ATNState::INVALID_STATE_NUMBER) {
+    // compute what follows who invoked us
+    atn::ATNState *invokingState = atn.states[ctx->invokingState];
+    const atn::RuleTransition *rt = downCast<const atn::RuleTransition*>(invokingState->transitions[0].get());
+    misc::IntervalSet follow = atn.nextTokens(rt->followState);
+    recoverSet.addAll(follow);
+
+    if (ctx->parent == nullptr)
+      break;
+    ctx = static_cast<RuleContext *>(ctx->parent);
+  }
+  recoverSet.remove(Token::EPSILON);
+
+  return recoverSet;
+}
+
+void DefaultErrorStrategy::consumeUntil(Parser *recognizer, const misc::IntervalSet &set) {
+  size_t ttype = recognizer->getInputStream()->LA(1);
+  while (ttype != Token::EOF && !set.contains(ttype)) {
+    recognizer->consume();
+    ttype = recognizer->getInputStream()->LA(1);
+  }
+}
+
+void DefaultErrorStrategy::InitializeInstanceFields() {
+  errorRecoveryMode = false;
+  lastErrorIndex = -1;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DefaultErrorStrategy.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DefaultErrorStrategy.h
new file mode 100755
index 0000000000..47dabb8cda
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DefaultErrorStrategy.h
@@ -0,0 +1,466 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "ANTLRErrorStrategy.h"
+#include "misc/IntervalSet.h"
+
+namespace antlr4 {
+
+  /**
+   * This is the default implementation of {@link ANTLRErrorStrategy} used for
+   * error reporting and recovery in ANTLR parsers.
+   */
+  class ANTLR4CPP_PUBLIC DefaultErrorStrategy : public ANTLRErrorStrategy {
+  public:
+    DefaultErrorStrategy();
+    DefaultErrorStrategy(DefaultErrorStrategy const& other) = delete;
+    virtual ~DefaultErrorStrategy();
+
+    DefaultErrorStrategy& operator = (DefaultErrorStrategy const& other) = delete;
+
+  protected:
+    /**
+     * Indicates whether the error strategy is currently "recovering from an
+     * error". This is used to suppress reporting multiple error messages while
+     * attempting to recover from a detected syntax error.
+     *
+     * @see #inErrorRecoveryMode
+     */
+    bool errorRecoveryMode;
+
+    /** The index into the input stream where the last error occurred.
+     * 	This is used to prevent infinite loops where an error is found
+     *  but no token is consumed during recovery...another error is found,
+     *  ad nauseum.  This is a failsafe mechanism to guarantee that at least
+     *  one token/tree node is consumed for two errors.
+     */
+    int lastErrorIndex;
+
+    misc::IntervalSet lastErrorStates;
+
+    /// <summary>
+    /// {@inheritDoc}
+    /// <p/>
+    /// The default implementation simply calls <seealso cref="#endErrorCondition"/> to
+    /// ensure that the handler is not in error recovery mode.
+    /// </summary>
+  public:
+    virtual void reset(Parser *recognizer) override;
+
+    /// <summary>
+    /// This method is called to enter error recovery mode when a recognition
+    /// exception is reported.
+    /// </summary>
+    /// <param name="recognizer"> the parser instance </param>
+  protected:
+    virtual void beginErrorCondition(Parser *recognizer);
+
+    /// <summary>
+    /// {@inheritDoc}
+    /// </summary>
+  public:
+    virtual bool inErrorRecoveryMode(Parser *recognizer) override;
+
+    /// <summary>
+    /// This method is called to leave error recovery mode after recovering from
+    /// a recognition exception.
+    /// </summary>
+    /// <param name="recognizer"> </param>
+  protected:
+    virtual void endErrorCondition(Parser *recognizer);
+
+    /// <summary>
+    /// {@inheritDoc}
+    /// <p/>
+    /// The default implementation simply calls <seealso cref="#endErrorCondition"/>.
+    /// </summary>
+  public:
+    virtual void reportMatch(Parser *recognizer) override;
+
+    /// {@inheritDoc}
+    /// <p/>
+    /// The default implementation returns immediately if the handler is already
+    /// in error recovery mode. Otherwise, it calls <seealso cref="#beginErrorCondition"/>
+    /// and dispatches the reporting task based on the runtime type of {@code e}
+    /// according to the following table.
+    ///
+    /// <ul>
+    /// <li><seealso cref="NoViableAltException"/>: Dispatches the call to
+    /// <seealso cref="#reportNoViableAlternative"/></li>
+    /// <li><seealso cref="InputMismatchException"/>: Dispatches the call to
+    /// <seealso cref="#reportInputMismatch"/></li>
+    /// <li><seealso cref="FailedPredicateException"/>: Dispatches the call to
+    /// <seealso cref="#reportFailedPredicate"/></li>
+    /// <li>All other types: calls <seealso cref="Parser#notifyErrorListeners"/> to report
+    /// the exception</li>
+    /// </ul>
+    virtual void reportError(Parser *recognizer, const RecognitionException &e) override;
+
+    /// <summary>
+    /// {@inheritDoc}
+    /// <p/>
+    /// The default implementation resynchronizes the parser by consuming tokens
+    /// until we find one in the resynchronization set--loosely the set of tokens
+    /// that can follow the current rule.
+    /// </summary>
+    virtual void recover(Parser *recognizer, std::exception_ptr e) override;
+
+    /**
+     * The default implementation of {@link ANTLRErrorStrategy#sync} makes sure
+     * that the current lookahead symbol is consistent with what were expecting
+     * at this point in the ATN. You can call this anytime but ANTLR only
+     * generates code to check before subrules/loops and each iteration.
+     *
+     * <p>Implements Jim Idle's magic sync mechanism in closures and optional
+     * subrules. E.g.,</p>
+     *
+     * <pre>
+     * a : sync ( stuff sync )* ;
+     * sync : {consume to what can follow sync} ;
+     * </pre>
+     *
+     * At the start of a sub rule upon error, {@link #sync} performs single
+     * token deletion, if possible. If it can't do that, it bails on the current
+     * rule and uses the default error recovery, which consumes until the
+     * resynchronization set of the current rule.
+     *
+     * <p>If the sub rule is optional ({@code (...)?}, {@code (...)*}, or block
+     * with an empty alternative), then the expected set includes what follows
+     * the subrule.</p>
+     *
+     * <p>During loop iteration, it consumes until it sees a token that can start a
+     * sub rule or what follows loop. Yes, that is pretty aggressive. We opt to
+     * stay in the loop as long as possible.</p>
+     *
+     * <p><strong>ORIGINS</strong></p>
+     *
+     * <p>Previous versions of ANTLR did a poor job of their recovery within loops.
+     * A single mismatch token or missing token would force the parser to bail
+     * out of the entire rules surrounding the loop. So, for rule</p>
+     *
+     * <pre>
+     * classDef : 'class' ID '{' member* '}'
+     * </pre>
+     *
+     * input with an extra token between members would force the parser to
+     * consume until it found the next class definition rather than the next
+     * member definition of the current class.
+     *
+     * <p>This functionality cost a little bit of effort because the parser has to
+     * compare token set at the start of the loop and at each iteration. If for
+     * some reason speed is suffering for you, you can turn off this
+     * functionality by simply overriding this method as a blank { }.</p>
+     */
+    virtual void sync(Parser *recognizer) override;
+
+    /// <summary>
+    /// This is called by <seealso cref="#reportError"/> when the exception is a
+    /// <seealso cref="NoViableAltException"/>.
+    /// </summary>
+    /// <seealso cref= #reportError
+    /// </seealso>
+    /// <param name="recognizer"> the parser instance </param>
+    /// <param name="e"> the recognition exception </param>
+  protected:
+    virtual void reportNoViableAlternative(Parser *recognizer, const NoViableAltException &e);
+
+    /// <summary>
+    /// This is called by <seealso cref="#reportError"/> when the exception is an
+    /// <seealso cref="InputMismatchException"/>.
+    /// </summary>
+    /// <seealso cref= #reportError
+    /// </seealso>
+    /// <param name="recognizer"> the parser instance </param>
+    /// <param name="e"> the recognition exception </param>
+    virtual void reportInputMismatch(Parser *recognizer, const InputMismatchException &e);
+
+    /// <summary>
+    /// This is called by <seealso cref="#reportError"/> when the exception is a
+    /// <seealso cref="FailedPredicateException"/>.
+    /// </summary>
+    /// <seealso cref= #reportError
+    /// </seealso>
+    /// <param name="recognizer"> the parser instance </param>
+    /// <param name="e"> the recognition exception </param>
+    virtual void reportFailedPredicate(Parser *recognizer, const FailedPredicateException &e);
+
+    /**
+     * This method is called to report a syntax error which requires the removal
+     * of a token from the input stream. At the time this method is called, the
+     * erroneous symbol is current {@code LT(1)} symbol and has not yet been
+     * removed from the input stream. When this method returns,
+     * {@code recognizer} is in error recovery mode.
+     *
+     * <p>This method is called when {@link #singleTokenDeletion} identifies
+     * single-token deletion as a viable recovery strategy for a mismatched
+     * input error.</p>
+     *
+     * <p>The default implementation simply returns if the handler is already in
+     * error recovery mode. Otherwise, it calls {@link #beginErrorCondition} to
+     * enter error recovery mode, followed by calling
+     * {@link Parser#notifyErrorListeners}.</p>
+     *
+     * @param recognizer the parser instance
+     */
+    virtual void reportUnwantedToken(Parser *recognizer);
+
+    /**
+     * This method is called to report a syntax error which requires the
+     * insertion of a missing token into the input stream. At the time this
+     * method is called, the missing token has not yet been inserted. When this
+     * method returns, {@code recognizer} is in error recovery mode.
+     *
+     * <p>This method is called when {@link #singleTokenInsertion} identifies
+     * single-token insertion as a viable recovery strategy for a mismatched
+     * input error.</p>
+     *
+     * <p>The default implementation simply returns if the handler is already in
+     * error recovery mode. Otherwise, it calls {@link #beginErrorCondition} to
+     * enter error recovery mode, followed by calling
+     * {@link Parser#notifyErrorListeners}.</p>
+     *
+     * @param recognizer the parser instance
+     */
+    virtual void reportMissingToken(Parser *recognizer);
+
+  public:
+    /**
+     * {@inheritDoc}
+     *
+     * <p>The default implementation attempts to recover from the mismatched input
+     * by using single token insertion and deletion as described below. If the
+     * recovery attempt fails, this method throws an
+     * {@link InputMismatchException}.</p>
+     *
+     * <p><strong>EXTRA TOKEN</strong> (single token deletion)</p>
+     *
+     * <p>{@code LA(1)} is not what we are looking for. If {@code LA(2)} has the
+     * right token, however, then assume {@code LA(1)} is some extra spurious
+     * token and delete it. Then consume and return the next token (which was
+     * the {@code LA(2)} token) as the successful result of the match operation.</p>
+     *
+     * <p>This recovery strategy is implemented by {@link #singleTokenDeletion}.</p>
+     *
+     * <p><strong>MISSING TOKEN</strong> (single token insertion)</p>
+     *
+     * <p>If current token (at {@code LA(1)}) is consistent with what could come
+     * after the expected {@code LA(1)} token, then assume the token is missing
+     * and use the parser's {@link TokenFactory} to create it on the fly. The
+     * "insertion" is performed by returning the created token as the successful
+     * result of the match operation.</p>
+     *
+     * <p>This recovery strategy is implemented by {@link #singleTokenInsertion}.</p>
+     *
+     * <p><strong>EXAMPLE</strong></p>
+     *
+     * <p>For example, Input {@code i=(3;} is clearly missing the {@code ')'}. When
+     * the parser returns from the nested call to {@code expr}, it will have
+     * call chain:</p>
+     *
+     * <pre>
+     * stat &rarr; expr &rarr; atom
+     * </pre>
+     *
+     * and it will be trying to match the {@code ')'} at this point in the
+     * derivation:
+     *
+     * <pre>
+     * =&gt; ID '=' '(' INT ')' ('+' atom)* ';'
+     *                    ^
+     * </pre>
+     *
+     * The attempt to match {@code ')'} will fail when it sees {@code ';'} and
+     * call {@link #recoverInline}. To recover, it sees that {@code LA(1)==';'}
+     * is in the set of tokens that can follow the {@code ')'} token reference
+     * in rule {@code atom}. It can assume that you forgot the {@code ')'}.
+     */
+    virtual Token* recoverInline(Parser *recognizer) override;
+
+    /// <summary>
+    /// This method implements the single-token insertion inline error recovery
+    /// strategy. It is called by <seealso cref="#recoverInline"/> if the single-token
+    /// deletion strategy fails to recover from the mismatched input. If this
+    /// method returns {@code true}, {@code recognizer} will be in error recovery
+    /// mode.
+    /// <p/>
+    /// This method determines whether or not single-token insertion is viable by
+    /// checking if the {@code LA(1)} input symbol could be successfully matched
+    /// if it were instead the {@code LA(2)} symbol. If this method returns
+    /// {@code true}, the caller is responsible for creating and inserting a
+    /// token with the correct type to produce this behavior.
+    /// </summary>
+    /// <param name="recognizer"> the parser instance </param>
+    /// <returns> {@code true} if single-token insertion is a viable recovery
+    /// strategy for the current mismatched input, otherwise {@code false} </returns>
+  protected:
+    virtual bool singleTokenInsertion(Parser *recognizer);
+
+    /// <summary>
+    /// This method implements the single-token deletion inline error recovery
+    /// strategy. It is called by <seealso cref="#recoverInline"/> to attempt to recover
+    /// from mismatched input. If this method returns null, the parser and error
+    /// handler state will not have changed. If this method returns non-null,
+    /// {@code recognizer} will <em>not</em> be in error recovery mode since the
+    /// returned token was a successful match.
+    /// <p/>
+    /// If the single-token deletion is successful, this method calls
+    /// <seealso cref="#reportUnwantedToken"/> to report the error, followed by
+    /// <seealso cref="Parser#consume"/> to actually "delete" the extraneous token. Then,
+    /// before returning <seealso cref="#reportMatch"/> is called to signal a successful
+    /// match.
+    /// </summary>
+    /// <param name="recognizer"> the parser instance </param>
+    /// <returns> the successfully matched <seealso cref="Token"/> instance if single-token
+    /// deletion successfully recovers from the mismatched input, otherwise
+    /// {@code null} </returns>
+    virtual Token* singleTokenDeletion(Parser *recognizer);
+
+    /// <summary>
+    /// Conjure up a missing token during error recovery.
+    ///
+    ///  The recognizer attempts to recover from single missing
+    ///  symbols. But, actions might refer to that missing symbol.
+    ///  For example, x=ID {f($x);}. The action clearly assumes
+    ///  that there has been an identifier matched previously and that
+    ///  $x points at that token. If that token is missing, but
+    ///  the next token in the stream is what we want we assume that
+    ///  this token is missing and we keep going. Because we
+    ///  have to return some token to replace the missing token,
+    ///  we have to conjure one up. This method gives the user control
+    ///  over the tokens returned for missing tokens. Mostly,
+    ///  you will want to create something special for identifier
+    ///  tokens. For literals such as '{' and ',', the default
+    ///  action in the parser or tree parser works. It simply creates
+    ///  a CommonToken of the appropriate type. The text will be the token.
+    ///  If you change what tokens must be created by the lexer,
+    ///  override this method to create the appropriate tokens.
+    /// </summary>
+    virtual Token* getMissingSymbol(Parser *recognizer);
+
+    virtual misc::IntervalSet getExpectedTokens(Parser *recognizer);
+
+    /// <summary>
+    /// How should a token be displayed in an error message? The default
+    ///  is to display just the text, but during development you might
+    ///  want to have a lot of information spit out.  Override in that case
+    ///  to use t.toString() (which, for CommonToken, dumps everything about
+    ///  the token). This is better than forcing you to override a method in
+    ///  your token objects because you don't have to go modify your lexer
+    ///  so that it creates a new class.
+    /// </summary>
+    virtual std::string getTokenErrorDisplay(Token *t);
+
+    virtual std::string getSymbolText(Token *symbol);
+
+    virtual size_t getSymbolType(Token *symbol);
+
+    virtual std::string escapeWSAndQuote(const std::string &s) const;
+
+    /*  Compute the error recovery set for the current rule.  During
+     *  rule invocation, the parser pushes the set of tokens that can
+     *  follow that rule reference on the stack; this amounts to
+     *  computing FIRST of what follows the rule reference in the
+     *  enclosing rule. See LinearApproximator.FIRST().
+     *  This local follow set only includes tokens
+     *  from within the rule; i.e., the FIRST computation done by
+     *  ANTLR stops at the end of a rule.
+     *
+     *  EXAMPLE
+     *
+     *  When you find a "no viable alt exception", the input is not
+     *  consistent with any of the alternatives for rule r.  The best
+     *  thing to do is to consume tokens until you see something that
+     *  can legally follow a call to r *or* any rule that called r.
+     *  You don't want the exact set of viable next tokens because the
+     *  input might just be missing a token--you might consume the
+     *  rest of the input looking for one of the missing tokens.
+     *
+     *  Consider grammar:
+     *
+     *  a : '[' b ']'
+     *    | '(' b ')'
+     *    ;
+     *  b : c '^' INT ;
+     *  c : ID
+     *    | INT
+     *    ;
+     *
+     *  At each rule invocation, the set of tokens that could follow
+     *  that rule is pushed on a stack.  Here are the various
+     *  context-sensitive follow sets:
+     *
+     *  FOLLOW(b1_in_a) = FIRST(']') = ']'
+     *  FOLLOW(b2_in_a) = FIRST(')') = ')'
+     *  FOLLOW(c_in_b) = FIRST('^') = '^'
+     *
+     *  Upon erroneous input "[]", the call chain is
+     *
+     *  a -> b -> c
+     *
+     *  and, hence, the follow context stack is:
+     *
+     *  depth     follow set       start of rule execution
+     *    0         <EOF>                    a (from main())
+     *    1          ']'                     b
+     *    2          '^'                     c
+     *
+     *  Notice that ')' is not included, because b would have to have
+     *  been called from a different context in rule a for ')' to be
+     *  included.
+     *
+     *  For error recovery, we cannot consider FOLLOW(c)
+     *  (context-sensitive or otherwise).  We need the combined set of
+     *  all context-sensitive FOLLOW sets--the set of all tokens that
+     *  could follow any reference in the call chain.  We need to
+     *  resync to one of those tokens.  Note that FOLLOW(c)='^' and if
+     *  we resync'd to that token, we'd consume until EOF.  We need to
+     *  sync to context-sensitive FOLLOWs for a, b, and c: {']','^'}.
+     *  In this case, for input "[]", LA(1) is ']' and in the set, so we would
+     *  not consume anything. After printing an error, rule c would
+     *  return normally.  Rule b would not find the required '^' though.
+     *  At this point, it gets a mismatched token error and throws an
+     *  exception (since LA(1) is not in the viable following token
+     *  set).  The rule exception handler tries to recover, but finds
+     *  the same recovery set and doesn't consume anything.  Rule b
+     *  exits normally returning to rule a.  Now it finds the ']' (and
+     *  with the successful match exits errorRecovery mode).
+     *
+     *  So, you can see that the parser walks up the call chain looking
+     *  for the token that was a member of the recovery set.
+     *
+     *  Errors are not generated in errorRecovery mode.
+     *
+     *  ANTLR's error recovery mechanism is based upon original ideas:
+     *
+     *  "Algorithms + Data Structures = Programs" by Niklaus Wirth
+     *
+     *  and
+     *
+     *  "A note on error recovery in recursive descent parsers":
+     *  http://portal.acm.org/citation.cfm?id=947902.947905
+     *
+     *  Later, Josef Grosch had some good ideas:
+     *
+     *  "Efficient and Comfortable Error Recovery in Recursive Descent
+     *  Parsers":
+     *  ftp://www.cocolab.com/products/cocktail/doca4.ps/ell.ps.zip
+     *
+     *  Like Grosch I implement context-sensitive FOLLOW sets that are combined
+     *  at run-time upon error to avoid overhead during parsing.
+     */
+    virtual misc::IntervalSet getErrorRecoverySet(Parser *recognizer);
+
+    /// <summary>
+    /// Consume tokens until one matches the given token set. </summary>
+    virtual void consumeUntil(Parser *recognizer, const misc::IntervalSet &set);
+
+  private:
+    std::vector<std::unique_ptr<Token>> _errorSymbols; // Temporarily created token.
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DiagnosticErrorListener.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DiagnosticErrorListener.cpp
new file mode 100755
index 0000000000..ea2eaa0d8c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DiagnosticErrorListener.cpp
@@ -0,0 +1,84 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/PredictionContext.h"
+#include "atn/ATNConfig.h"
+#include "atn/ATNConfigSet.h"
+#include "Parser.h"
+#include "misc/Interval.h"
+#include "dfa/DFA.h"
+
+#include "DiagnosticErrorListener.h"
+
+using namespace antlr4;
+
+DiagnosticErrorListener::DiagnosticErrorListener() : DiagnosticErrorListener(true) {
+}
+
+DiagnosticErrorListener::DiagnosticErrorListener(bool exactOnly_) : exactOnly(exactOnly_) {
+}
+
+void DiagnosticErrorListener::reportAmbiguity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+   bool exact, const antlrcpp::BitSet &ambigAlts, atn::ATNConfigSet *configs) {
+  if (exactOnly && !exact) {
+    return;
+  }
+
+  std::string decision = getDecisionDescription(recognizer, dfa);
+  antlrcpp::BitSet conflictingAlts = getConflictingAlts(ambigAlts, configs);
+  std::string text = recognizer->getTokenStream()->getText(misc::Interval(startIndex, stopIndex));
+  std::string message = "reportAmbiguity d=" + decision + ": ambigAlts=" + conflictingAlts.toString() +
+    ", input='" + text + "'";
+
+  recognizer->notifyErrorListeners(message);
+}
+
+void DiagnosticErrorListener::reportAttemptingFullContext(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex,
+  size_t stopIndex, const antlrcpp::BitSet &/*conflictingAlts*/, atn::ATNConfigSet * /*configs*/) {
+  std::string decision = getDecisionDescription(recognizer, dfa);
+  std::string text = recognizer->getTokenStream()->getText(misc::Interval(startIndex, stopIndex));
+  std::string message = "reportAttemptingFullContext d=" + decision + ", input='" + text + "'";
+  recognizer->notifyErrorListeners(message);
+}
+
+void DiagnosticErrorListener::reportContextSensitivity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex,
+  size_t stopIndex, size_t /*prediction*/, atn::ATNConfigSet * /*configs*/) {
+  std::string decision = getDecisionDescription(recognizer, dfa);
+  std::string text = recognizer->getTokenStream()->getText(misc::Interval(startIndex, stopIndex));
+  std::string message = "reportContextSensitivity d=" + decision + ", input='" + text + "'";
+  recognizer->notifyErrorListeners(message);
+}
+
+std::string DiagnosticErrorListener::getDecisionDescription(Parser *recognizer, const dfa::DFA &dfa) {
+  size_t decision = dfa.decision;
+  size_t ruleIndex = (reinterpret_cast<atn::ATNState*>(dfa.atnStartState))->ruleIndex;
+
+  const std::vector<std::string>& ruleNames = recognizer->getRuleNames();
+  if (ruleIndex == INVALID_INDEX || ruleIndex >= ruleNames.size()) {
+    return std::to_string(decision);
+  }
+
+  std::string ruleName = ruleNames[ruleIndex];
+  if (ruleName == "" || ruleName.empty())  {
+    return std::to_string(decision);
+  }
+
+  return std::to_string(decision) + " (" + ruleName + ")";
+}
+
+antlrcpp::BitSet DiagnosticErrorListener::getConflictingAlts(const antlrcpp::BitSet &reportedAlts,
+                                                             atn::ATNConfigSet *configs) {
+  if (reportedAlts.count() > 0) { // Not exactly like the original Java code, but this listener is only used
+                                  // in the TestRig (where it never provides a good alt set), so it's probably ok so.
+    return reportedAlts;
+  }
+
+  antlrcpp::BitSet result;
+  for (auto &config : configs->configs) {
+    result.set(config->alt);
+  }
+
+  return result;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DiagnosticErrorListener.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DiagnosticErrorListener.h
new file mode 100755
index 0000000000..8419fdcfbd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/DiagnosticErrorListener.h
@@ -0,0 +1,80 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "BaseErrorListener.h"
+
+namespace antlr4 {
+
+  /// <summary>
+  /// This implementation of <seealso cref="ANTLRErrorListener"/> can be used to identify
+  /// certain potential correctness and performance problems in grammars. "Reports"
+  /// are made by calling <seealso cref="Parser#notifyErrorListeners"/> with the appropriate
+  /// message.
+  ///
+  /// <ul>
+  /// <li><b>Ambiguities</b>: These are cases where more than one path through the
+  /// grammar can match the input.</li>
+  /// <li><b>Weak context sensitivity</b>: These are cases where full-context
+  /// prediction resolved an SLL conflict to a unique alternative which equaled the
+  /// minimum alternative of the SLL conflict.</li>
+  /// <li><b>Strong (forced) context sensitivity</b>: These are cases where the
+  /// full-context prediction resolved an SLL conflict to a unique alternative,
+  /// <em>and</em> the minimum alternative of the SLL conflict was found to not be
+  /// a truly viable alternative. Two-stage parsing cannot be used for inputs where
+  /// this situation occurs.</li>
+  /// </ul>
+  ///
+  /// @author Sam Harwell
+  /// </summary>
+  class ANTLR4CPP_PUBLIC DiagnosticErrorListener : public BaseErrorListener {
+    /// <summary>
+    /// When {@code true}, only exactly known ambiguities are reported.
+    /// </summary>
+  protected:
+    const bool exactOnly;
+
+    /// <summary>
+    /// Initializes a new instance of <seealso cref="DiagnosticErrorListener"/> which only
+    /// reports exact ambiguities.
+    /// </summary>
+  public:
+    DiagnosticErrorListener();
+
+    /// <summary>
+    /// Initializes a new instance of <seealso cref="DiagnosticErrorListener"/>, specifying
+    /// whether all ambiguities or only exact ambiguities are reported.
+    /// </summary>
+    /// <param name="exactOnly"> {@code true} to report only exact ambiguities, otherwise
+    /// {@code false} to report all ambiguities. </param>
+    DiagnosticErrorListener(bool exactOnly);
+
+    virtual void reportAmbiguity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex, bool exact,
+      const antlrcpp::BitSet &ambigAlts, atn::ATNConfigSet *configs) override;
+
+    virtual void reportAttemptingFullContext(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+      const antlrcpp::BitSet &conflictingAlts, atn::ATNConfigSet *configs) override;
+
+    virtual void reportContextSensitivity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+      size_t prediction, atn::ATNConfigSet *configs) override;
+
+  protected:
+    virtual std::string getDecisionDescription(Parser *recognizer, const dfa::DFA &dfa);
+
+    /// <summary>
+    /// Computes the set of conflicting or ambiguous alternatives from a
+    /// configuration set, if that information was not already provided by the
+    /// parser.
+    /// </summary>
+    /// <param name="reportedAlts"> The set of conflicting or ambiguous alternatives, as
+    /// reported by the parser. </param>
+    /// <param name="configs"> The conflicting or ambiguous configuration set. </param>
+    /// <returns> Returns {@code reportedAlts} if it is not {@code null}, otherwise
+    /// returns the set of alternatives represented in {@code configs}. </returns>
+    virtual antlrcpp::BitSet getConflictingAlts(const antlrcpp::BitSet &reportedAlts, atn::ATNConfigSet *configs);
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Exceptions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Exceptions.cpp
new file mode 100644
index 0000000000..24aea29b0c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Exceptions.cpp
@@ -0,0 +1,64 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Exceptions.h"
+
+using namespace antlr4;
+
+RuntimeException::RuntimeException(const std::string &msg) : std::exception(), _message(msg) {
+}
+
+const char* RuntimeException::what() const noexcept {
+  return _message.c_str();
+}
+
+//------------------ IOException ---------------------------------------------------------------------------------------
+
+IOException::IOException(const std::string &msg) : std::exception(), _message(msg) {
+}
+
+const char* IOException::what() const noexcept {
+  return _message.c_str();
+}
+
+//------------------ IllegalStateException -----------------------------------------------------------------------------
+
+IllegalStateException::~IllegalStateException() {
+}
+
+//------------------ IllegalArgumentException --------------------------------------------------------------------------
+
+IllegalArgumentException::~IllegalArgumentException() {
+}
+
+//------------------ NullPointerException ------------------------------------------------------------------------------
+
+NullPointerException::~NullPointerException() {
+}
+
+//------------------ IndexOutOfBoundsException -------------------------------------------------------------------------
+
+IndexOutOfBoundsException::~IndexOutOfBoundsException() {
+}
+
+//------------------ UnsupportedOperationException ---------------------------------------------------------------------
+
+UnsupportedOperationException::~UnsupportedOperationException() {
+}
+
+//------------------ EmptyStackException -------------------------------------------------------------------------------
+
+EmptyStackException::~EmptyStackException() {
+}
+
+//------------------ CancellationException -----------------------------------------------------------------------------
+
+CancellationException::~CancellationException() {
+}
+
+//------------------ ParseCancellationException ------------------------------------------------------------------------
+
+ParseCancellationException::~ParseCancellationException() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Exceptions.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Exceptions.h
new file mode 100644
index 0000000000..35d72b52ee
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Exceptions.h
@@ -0,0 +1,99 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+
+  // An exception hierarchy modelled loosely after java.lang.* exceptions.
+  class ANTLR4CPP_PUBLIC RuntimeException : public std::exception {
+  private:
+    std::string _message;
+  public:
+    RuntimeException(const std::string &msg = "");
+
+    virtual const char* what() const noexcept override;
+  };
+
+  class ANTLR4CPP_PUBLIC IllegalStateException : public RuntimeException {
+  public:
+    IllegalStateException(const std::string &msg = "") : RuntimeException(msg) {}
+    IllegalStateException(IllegalStateException const&) = default;
+    ~IllegalStateException();
+    IllegalStateException& operator=(IllegalStateException const&) = default;
+  };
+
+  class ANTLR4CPP_PUBLIC IllegalArgumentException : public RuntimeException {
+  public:
+    IllegalArgumentException(IllegalArgumentException const&) = default;
+    IllegalArgumentException(const std::string &msg = "") : RuntimeException(msg) {}
+    ~IllegalArgumentException();
+    IllegalArgumentException& operator=(IllegalArgumentException const&) = default;
+  };
+
+  class ANTLR4CPP_PUBLIC NullPointerException : public RuntimeException {
+  public:
+    NullPointerException(const std::string &msg = "") : RuntimeException(msg) {}
+    NullPointerException(NullPointerException const&) = default;
+    ~NullPointerException();
+    NullPointerException& operator=(NullPointerException const&) = default;
+  };
+
+  class ANTLR4CPP_PUBLIC IndexOutOfBoundsException : public RuntimeException {
+  public:
+    IndexOutOfBoundsException(const std::string &msg = "") : RuntimeException(msg) {}
+    IndexOutOfBoundsException(IndexOutOfBoundsException const&) = default;
+    ~IndexOutOfBoundsException();
+    IndexOutOfBoundsException& operator=(IndexOutOfBoundsException const&) = default;
+  };
+
+  class ANTLR4CPP_PUBLIC UnsupportedOperationException : public RuntimeException {
+  public:
+    UnsupportedOperationException(const std::string &msg = "") : RuntimeException(msg) {}
+    UnsupportedOperationException(UnsupportedOperationException const&) = default;
+    ~UnsupportedOperationException();
+    UnsupportedOperationException& operator=(UnsupportedOperationException const&) = default;
+
+  };
+
+  class ANTLR4CPP_PUBLIC EmptyStackException : public RuntimeException {
+  public:
+    EmptyStackException(const std::string &msg = "") : RuntimeException(msg) {}
+    EmptyStackException(EmptyStackException const&) = default;
+    ~EmptyStackException();
+    EmptyStackException& operator=(EmptyStackException const&) = default;
+  };
+
+  // IOException is not a runtime exception (in the java hierarchy).
+  // Hence we have to duplicate the RuntimeException implementation.
+  class ANTLR4CPP_PUBLIC IOException : public std::exception {
+  private:
+    std::string _message;
+
+  public:
+    IOException(const std::string &msg = "");
+
+    virtual const char* what() const noexcept override;
+  };
+
+  class ANTLR4CPP_PUBLIC CancellationException : public IllegalStateException {
+  public:
+    CancellationException(const std::string &msg = "") : IllegalStateException(msg) {}
+    CancellationException(CancellationException const&) = default;
+    ~CancellationException();
+    CancellationException& operator=(CancellationException const&) = default;
+  };
+
+  class ANTLR4CPP_PUBLIC ParseCancellationException : public CancellationException {
+  public:
+    ParseCancellationException(const std::string &msg = "") : CancellationException(msg) {}
+    ParseCancellationException(ParseCancellationException const&) = default;
+    ~ParseCancellationException();
+    ParseCancellationException& operator=(ParseCancellationException const&) = default;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FailedPredicateException.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FailedPredicateException.cpp
new file mode 100755
index 0000000000..b44725cce8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FailedPredicateException.cpp
@@ -0,0 +1,52 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ParserATNSimulator.h"
+#include "Parser.h"
+#include "atn/PredicateTransition.h"
+#include "atn/ATN.h"
+#include "atn/ATNState.h"
+#include "support/Casts.h"
+#include "support/CPPUtils.h"
+
+#include "FailedPredicateException.h"
+
+using namespace antlr4;
+using namespace antlrcpp;
+
+FailedPredicateException::FailedPredicateException(Parser *recognizer) : FailedPredicateException(recognizer, "", "") {
+}
+
+FailedPredicateException::FailedPredicateException(Parser *recognizer, const std::string &predicate): FailedPredicateException(recognizer, predicate, "") {
+}
+
+FailedPredicateException::FailedPredicateException(Parser *recognizer, const std::string &predicate, const std::string &message)
+  : RecognitionException(!message.empty() ? message : "failed predicate: " + predicate + "?", recognizer,
+                         recognizer->getInputStream(), recognizer->getContext(), recognizer->getCurrentToken()) {
+
+  atn::ATNState *s = recognizer->getInterpreter<atn::ATNSimulator>()->atn.states[recognizer->getState()];
+  const atn::Transition *transition = s->transitions[0].get();
+  if (transition->getTransitionType() == atn::TransitionType::PREDICATE) {
+    _ruleIndex = downCast<const atn::PredicateTransition&>(*transition).getRuleIndex();
+    _predicateIndex = downCast<const atn::PredicateTransition&>(*transition).getPredIndex();
+  } else {
+    _ruleIndex = 0;
+    _predicateIndex = 0;
+  }
+
+  _predicate = predicate;
+}
+
+size_t FailedPredicateException::getRuleIndex() {
+  return _ruleIndex;
+}
+
+size_t FailedPredicateException::getPredIndex() {
+  return _predicateIndex;
+}
+
+std::string FailedPredicateException::getPredicate() {
+  return _predicate;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FailedPredicateException.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FailedPredicateException.h
new file mode 100755
index 0000000000..745537f74a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FailedPredicateException.h
@@ -0,0 +1,32 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "RecognitionException.h"
+
+namespace antlr4 {
+
+  /// A semantic predicate failed during validation.  Validation of predicates
+  /// occurs when normally parsing the alternative just like matching a token.
+  /// Disambiguating predicate evaluation occurs when we test a predicate during
+  /// prediction.
+  class ANTLR4CPP_PUBLIC FailedPredicateException : public RecognitionException {
+  public:
+    explicit FailedPredicateException(Parser *recognizer);
+    FailedPredicateException(Parser *recognizer, const std::string &predicate);
+    FailedPredicateException(Parser *recognizer, const std::string &predicate, const std::string &message);
+
+    virtual size_t getRuleIndex();
+    virtual size_t getPredIndex();
+    virtual std::string getPredicate();
+
+  private:
+    size_t _ruleIndex;
+    size_t _predicateIndex;
+    std::string _predicate;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FlatHashMap.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FlatHashMap.h
new file mode 100644
index 0000000000..a935ad9c7f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FlatHashMap.h
@@ -0,0 +1,57 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#pragma once
+
+#include "antlr4-common.h"
+
+#if ANTLR4CPP_USING_ABSEIL
+#include "absl/container/flat_hash_map.h"
+#else
+#include <unordered_map>
+#endif
+
+// By default ANTLRv4 uses containers provided by the C++ standard library. In most deployments this
+// is fine, however in some using custom containers may be preferred. This header allows that by
+// optionally supporting some alternative implementations and allowing for more easier patching of
+// other alternatives.
+
+namespace antlr4 {
+
+#if ANTLR4CPP_USING_ABSEIL
+  template <typename Key, typename Value,
+            typename Hash = typename absl::flat_hash_map<Key, Value>::hasher,
+            typename Equal = typename absl::flat_hash_map<Key, Value>::key_equal,
+            typename Allocator = typename absl::flat_hash_map<Key, Value>::allocator_type>
+  using FlatHashMap = absl::flat_hash_map<Key, Value, Hash, Equal, Allocator>;
+#else
+  template <typename Key, typename Value,
+            typename Hash = std::hash<Key>,
+            typename Equal = std::equal_to<Key>,
+            typename Allocator = std::allocator<std::pair<const Key, Value>>>
+  using FlatHashMap = std::unordered_map<Key, Value, Hash, Equal, Allocator>;
+#endif
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FlatHashSet.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FlatHashSet.h
new file mode 100644
index 0000000000..2ee6705e58
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/FlatHashSet.h
@@ -0,0 +1,57 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#pragma once
+
+#include "antlr4-common.h"
+
+#if ANTLR4CPP_USING_ABSEIL
+#include "absl/container/flat_hash_set.h"
+#else
+#include <unordered_set>
+#endif
+
+// By default ANTLRv4 uses containers provided by the C++ standard library. In most deployments this
+// is fine, however in some using custom containers may be preferred. This header allows that by
+// optionally supporting some alternative implementations and allowing for more easier patching of
+// other alternatives.
+
+namespace antlr4 {
+
+#if ANTLR4CPP_USING_ABSEIL
+  template <typename Key,
+            typename Hash = typename absl::flat_hash_set<Key>::hasher,
+            typename Equal = typename absl::flat_hash_set<Key>::key_equal,
+            typename Allocator = typename absl::flat_hash_set<Key>::allocator_type>
+  using FlatHashSet = absl::flat_hash_set<Key, Hash, Equal, Allocator>;
+#else
+  template <typename Key,
+            typename Hash = std::hash<Key>,
+            typename Equal = std::equal_to<Key>,
+            typename Allocator = std::allocator<Key>>
+  using FlatHashSet = std::unordered_set<Key, Hash, Equal, Allocator>;
+#endif
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InputMismatchException.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InputMismatchException.cpp
new file mode 100755
index 0000000000..1c85a35a25
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InputMismatchException.cpp
@@ -0,0 +1,18 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Parser.h"
+
+#include "InputMismatchException.h"
+
+using namespace antlr4;
+
+InputMismatchException::InputMismatchException(Parser *recognizer)
+  : RecognitionException(recognizer, recognizer->getInputStream(), recognizer->getContext(),
+                         recognizer->getCurrentToken()) {
+}
+
+InputMismatchException::~InputMismatchException() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InputMismatchException.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InputMismatchException.h
new file mode 100755
index 0000000000..051a2a4153
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InputMismatchException.h
@@ -0,0 +1,24 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "RecognitionException.h"
+
+namespace antlr4 {
+
+  /// <summary>
+  /// This signifies any kind of mismatched input exceptions such as
+  ///  when the current input does not match the expected token.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC InputMismatchException : public RecognitionException {
+  public:
+    InputMismatchException(Parser *recognizer);
+    InputMismatchException(InputMismatchException const&) = default;
+    ~InputMismatchException();
+    InputMismatchException& operator=(InputMismatchException const&) = default;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/IntStream.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/IntStream.cpp
new file mode 100755
index 0000000000..5408ae50f6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/IntStream.cpp
@@ -0,0 +1,12 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "IntStream.h"
+
+using namespace antlr4;
+
+const std::string IntStream::UNKNOWN_SOURCE_NAME = "<unknown>";
+
+IntStream::~IntStream() = default;
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/IntStream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/IntStream.h
new file mode 100755
index 0000000000..97a301cc28
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/IntStream.h
@@ -0,0 +1,218 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+
+  /// <summary>
+  /// A simple stream of symbols whose values are represented as integers. This
+  /// interface provides <em>marked ranges</em> with support for a minimum level
+  /// of buffering necessary to implement arbitrary lookahead during prediction.
+  /// For more information on marked ranges, see <seealso cref="#mark"/>.
+  /// <p/>
+  /// <strong>Initializing Methods:</strong> Some methods in this interface have
+  /// unspecified behavior if no call to an initializing method has occurred after
+  /// the stream was constructed. The following is a list of initializing methods:
+  ///
+  /// <ul>
+  ///   <li><seealso cref="#LA"/></li>
+  ///   <li><seealso cref="#consume"/></li>
+  ///   <li><seealso cref="#size"/></li>
+  /// </ul>
+  /// </summary>
+  class ANTLR4CPP_PUBLIC IntStream {
+  public:
+    static constexpr size_t EOF = std::numeric_limits<size_t>::max();
+
+    /// The value returned by <seealso cref="#LA LA()"/> when the end of the stream is
+    /// reached.
+    /// No explicit EOF definition. We got EOF on all platforms.
+    //static const size_t _EOF = std::ios::eofbit;
+
+    /// <summary>
+    /// The value returned by <seealso cref="#getSourceName"/> when the actual name of the
+    /// underlying source is not known.
+    /// </summary>
+    static const std::string UNKNOWN_SOURCE_NAME;
+
+    virtual ~IntStream();
+
+    /// <summary>
+    /// Consumes the current symbol in the stream. This method has the following
+    /// effects:
+    ///
+    /// <ul>
+    ///   <li><strong>Forward movement:</strong> The value of <seealso cref="#index index()"/>
+    ///		before calling this method is less than the value of {@code index()}
+    ///		after calling this method.</li>
+    ///   <li><strong>Ordered lookahead:</strong> The value of {@code LA(1)} before
+    ///		calling this method becomes the value of {@code LA(-1)} after calling
+    ///		this method.</li>
+    /// </ul>
+    ///
+    /// Note that calling this method does not guarantee that {@code index()} is
+    /// incremented by exactly 1, as that would preclude the ability to implement
+    /// filtering streams (e.g. <seealso cref="CommonTokenStream"/> which distinguishes
+    /// between "on-channel" and "off-channel" tokens).
+    /// </summary>
+    /// <exception cref="IllegalStateException"> if an attempt is made to consume the the
+    /// end of the stream (i.e. if {@code LA(1)==}<seealso cref="#EOF EOF"/> before calling
+    /// {@code consume}). </exception>
+    virtual void consume() = 0;
+
+    /// <summary>
+    /// Gets the value of the symbol at offset {@code i} from the current
+    /// position. When {@code i==1}, this method returns the value of the current
+    /// symbol in the stream (which is the next symbol to be consumed). When
+    /// {@code i==-1}, this method returns the value of the previously read
+    /// symbol in the stream. It is not valid to call this method with
+    /// {@code i==0}, but the specific behavior is unspecified because this
+    /// method is frequently called from performance-critical code.
+    /// <p/>
+    /// This method is guaranteed to succeed if any of the following are true:
+    ///
+    /// <ul>
+    ///   <li>{@code i>0}</li>
+    ///   <li>{@code i==-1} and <seealso cref="#index index()"/> returns a value greater
+    ///     than the value of {@code index()} after the stream was constructed
+    ///     and {@code LA(1)} was called in that order. Specifying the current
+    ///     {@code index()} relative to the index after the stream was created
+    ///     allows for filtering implementations that do not return every symbol
+    ///     from the underlying source. Specifying the call to {@code LA(1)}
+    ///     allows for lazily initialized streams.</li>
+    ///   <li>{@code LA(i)} refers to a symbol consumed within a marked region
+    ///     that has not yet been released.</li>
+    /// </ul>
+    ///
+    /// If {@code i} represents a position at or beyond the end of the stream,
+    /// this method returns <seealso cref="#EOF"/>.
+    /// <p/>
+    /// The return value is unspecified if {@code i<0} and fewer than {@code -i}
+    /// calls to <seealso cref="#consume consume()"/> have occurred from the beginning of
+    /// the stream before calling this method.
+    /// </summary>
+    /// <exception cref="UnsupportedOperationException"> if the stream does not support
+    /// retrieving the value of the specified symbol </exception>
+    virtual size_t LA(ssize_t i) = 0;
+
+    /// <summary>
+    /// A mark provides a guarantee that <seealso cref="#seek seek()"/> operations will be
+    /// valid over a "marked range" extending from the index where {@code mark()}
+    /// was called to the current <seealso cref="#index index()"/>. This allows the use of
+    /// streaming input sources by specifying the minimum buffering requirements
+    /// to support arbitrary lookahead during prediction.
+    /// <p/>
+    /// The returned mark is an opaque handle (type {@code int}) which is passed
+    /// to <seealso cref="#release release()"/> when the guarantees provided by the marked
+    /// range are no longer necessary. When calls to
+    /// {@code mark()}/{@code release()} are nested, the marks must be released
+    /// in reverse order of which they were obtained. Since marked regions are
+    /// used during performance-critical sections of prediction, the specific
+    /// behavior of invalid usage is unspecified (i.e. a mark is not released, or
+    /// a mark is released twice, or marks are not released in reverse order from
+    /// which they were created).
+    /// <p/>
+    /// The behavior of this method is unspecified if no call to an
+    /// <seealso cref="IntStream initializing method"/> has occurred after this stream was
+    /// constructed.
+    /// <p/>
+    /// This method does not change the current position in the input stream.
+    /// <p/>
+    /// The following example shows the use of <seealso cref="#mark mark()"/>,
+    /// <seealso cref="#release release(mark)"/>, <seealso cref="#index index()"/>, and
+    /// <seealso cref="#seek seek(index)"/> as part of an operation to safely work within a
+    /// marked region, then restore the stream position to its original value and
+    /// release the mark.
+    /// <pre>
+    /// IntStream stream = ...;
+    /// int index = -1;
+    /// int mark = stream.mark();
+    /// try {
+    ///   index = stream.index();
+    ///   // perform work here...
+    /// } finally {
+    ///   if (index != -1) {
+    ///     stream.seek(index);
+    ///   }
+    ///   stream.release(mark);
+    /// }
+    /// </pre>
+    /// </summary>
+    /// <returns> An opaque marker which should be passed to
+    /// <seealso cref="#release release()"/> when the marked range is no longer required. </returns>
+    virtual ssize_t mark() = 0;
+
+    /// <summary>
+    /// This method releases a marked range created by a call to
+    /// <seealso cref="#mark mark()"/>. Calls to {@code release()} must appear in the
+    /// reverse order of the corresponding calls to {@code mark()}. If a mark is
+    /// released twice, or if marks are not released in reverse order of the
+    /// corresponding calls to {@code mark()}, the behavior is unspecified.
+    /// <p/>
+    /// For more information and an example, see <seealso cref="#mark"/>.
+    /// </summary>
+    /// <param name="marker"> A marker returned by a call to {@code mark()}. </param>
+    /// <seealso cref= #mark </seealso>
+    virtual void release(ssize_t marker) = 0;
+
+    /// <summary>
+    /// Return the index into the stream of the input symbol referred to by
+    /// {@code LA(1)}.
+    /// <p/>
+    /// The behavior of this method is unspecified if no call to an
+    /// <seealso cref="IntStream initializing method"/> has occurred after this stream was
+    /// constructed.
+    /// </summary>
+    virtual size_t index() = 0;
+
+    /// <summary>
+    /// Set the input cursor to the position indicated by {@code index}. If the
+    /// specified index lies past the end of the stream, the operation behaves as
+    /// though {@code index} was the index of the EOF symbol. After this method
+    /// returns without throwing an exception, the at least one of the following
+    /// will be true.
+    ///
+    /// <ul>
+    ///   <li><seealso cref="#index index()"/> will return the index of the first symbol
+    ///     appearing at or after the specified {@code index}. Specifically,
+    ///     implementations which filter their sources should automatically
+    ///     adjust {@code index} forward the minimum amount required for the
+    ///     operation to target a non-ignored symbol.</li>
+    ///   <li>{@code LA(1)} returns <seealso cref="#EOF"/></li>
+    /// </ul>
+    ///
+    /// This operation is guaranteed to not throw an exception if {@code index}
+    /// lies within a marked region. For more information on marked regions, see
+    /// <seealso cref="#mark"/>. The behavior of this method is unspecified if no call to
+    /// an <seealso cref="IntStream initializing method"/> has occurred after this stream
+    /// was constructed.
+    /// </summary>
+    /// <param name="index"> The absolute index to seek to.
+    /// </param>
+    /// <exception cref="IllegalArgumentException"> if {@code index} is less than 0 </exception>
+    /// <exception cref="UnsupportedOperationException"> if the stream does not support
+    /// seeking to the specified index </exception>
+    virtual void seek(size_t index) = 0;
+
+    /// <summary>
+    /// Returns the total number of symbols in the stream, including a single EOF
+    /// symbol.
+    /// </summary>
+    /// <exception cref="UnsupportedOperationException"> if the size of the stream is
+    /// unknown. </exception>
+    virtual size_t size() = 0;
+
+    /// <summary>
+    /// Gets the name of the underlying symbol source. This method returns a
+    /// non-null, non-empty string. If such a name is not known, this method
+    /// returns <seealso cref="#UNKNOWN_SOURCE_NAME"/>.
+    /// </summary>
+    virtual std::string getSourceName() const = 0;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InterpreterRuleContext.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InterpreterRuleContext.cpp
new file mode 100755
index 0000000000..f6dbdd3cba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InterpreterRuleContext.cpp
@@ -0,0 +1,19 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "InterpreterRuleContext.h"
+
+using namespace antlr4;
+
+InterpreterRuleContext::InterpreterRuleContext() : ParserRuleContext() {
+}
+
+InterpreterRuleContext::InterpreterRuleContext(ParserRuleContext *parent, size_t invokingStateNumber, size_t ruleIndex)
+  : ParserRuleContext(parent, invokingStateNumber), _ruleIndex(ruleIndex) {
+}
+
+size_t InterpreterRuleContext::getRuleIndex() const {
+  return _ruleIndex;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InterpreterRuleContext.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InterpreterRuleContext.h
new file mode 100755
index 0000000000..cb6973e40d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/InterpreterRuleContext.h
@@ -0,0 +1,45 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "ParserRuleContext.h"
+
+namespace antlr4 {
+
+  /**
+   * This class extends {@link ParserRuleContext} by allowing the value of
+   * {@link #getRuleIndex} to be explicitly set for the context.
+   *
+   * <p>
+   * {@link ParserRuleContext} does not include field storage for the rule index
+   * since the context classes created by the code generator override the
+   * {@link #getRuleIndex} method to return the correct value for that context.
+   * Since the parser interpreter does not use the context classes generated for a
+   * parser, this class (with slightly more memory overhead per node) is used to
+   * provide equivalent functionality.</p>
+   */
+  class ANTLR4CPP_PUBLIC InterpreterRuleContext : public ParserRuleContext {
+  public:
+    InterpreterRuleContext();
+
+    /**
+     * Constructs a new {@link InterpreterRuleContext} with the specified
+     * parent, invoking state, and rule index.
+     *
+     * @param parent The parent context.
+     * @param invokingStateNumber The invoking state number.
+     * @param ruleIndex The rule index for the current context.
+     */
+    InterpreterRuleContext(ParserRuleContext *parent, size_t invokingStateNumber, size_t ruleIndex);
+
+    virtual size_t getRuleIndex() const override;
+
+  protected:
+    /** This is the backing field for {@link #getRuleIndex}. */
+    const size_t _ruleIndex = INVALID_INDEX;
+};
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Lexer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Lexer.cpp
new file mode 100755
index 0000000000..b0385c56ba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Lexer.cpp
@@ -0,0 +1,294 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/LexerATNSimulator.h"
+#include "Exceptions.h"
+#include "misc/Interval.h"
+#include "CommonTokenFactory.h"
+#include "LexerNoViableAltException.h"
+#include "ANTLRErrorListener.h"
+#include "support/CPPUtils.h"
+#include "CommonToken.h"
+
+#include "Lexer.h"
+
+#define DEBUG_LEXER 0
+
+using namespace antlrcpp;
+using namespace antlr4;
+
+Lexer::Lexer() : Recognizer() {
+  InitializeInstanceFields();
+  _input = nullptr;
+}
+
+Lexer::Lexer(CharStream *input) : Recognizer(), _input(input) {
+  InitializeInstanceFields();
+}
+
+void Lexer::reset() {
+  // wack Lexer state variables
+  _input->seek(0); // rewind the input
+
+  _syntaxErrors = 0;
+  token.reset();
+  type = Token::INVALID_TYPE;
+  channel = Token::DEFAULT_CHANNEL;
+  tokenStartCharIndex = INVALID_INDEX;
+  tokenStartCharPositionInLine = 0;
+  tokenStartLine = 0;
+  type = 0;
+  _text = "";
+
+  hitEOF = false;
+  mode = Lexer::DEFAULT_MODE;
+  modeStack.clear();
+
+  getInterpreter<atn::LexerATNSimulator>()->reset();
+}
+
+std::unique_ptr<Token> Lexer::nextToken() {
+  // Mark start location in char stream so unbuffered streams are
+  // guaranteed at least have text of current token
+  ssize_t tokenStartMarker = _input->mark();
+
+  auto onExit = finally([this, tokenStartMarker]{
+    // make sure we release marker after match or
+    // unbuffered char stream will keep buffering
+    _input->release(tokenStartMarker);
+  });
+
+  while (true) {
+  outerContinue:
+    if (hitEOF) {
+      emitEOF();
+      return std::move(token);
+    }
+
+    token.reset();
+    channel = Token::DEFAULT_CHANNEL;
+    tokenStartCharIndex = _input->index();
+    tokenStartCharPositionInLine = getInterpreter<atn::LexerATNSimulator>()->getCharPositionInLine();
+    tokenStartLine = getInterpreter<atn::LexerATNSimulator>()->getLine();
+    _text = "";
+    do {
+      type = Token::INVALID_TYPE;
+      size_t ttype;
+      try {
+        ttype = getInterpreter<atn::LexerATNSimulator>()->match(_input, mode);
+      } catch (LexerNoViableAltException &e) {
+        notifyListeners(e); // report error
+        recover(e);
+        ttype = SKIP;
+      }
+      if (_input->LA(1) == EOF) {
+        hitEOF = true;
+      }
+      if (type == Token::INVALID_TYPE) {
+        type = ttype;
+      }
+      if (type == SKIP) {
+        goto outerContinue;
+      }
+    } while (type == MORE);
+    if (token == nullptr) {
+      emit();
+    }
+    return std::move(token);
+  }
+}
+
+void Lexer::skip() {
+  type = SKIP;
+}
+
+void Lexer::more() {
+  type = MORE;
+}
+
+void Lexer::setMode(size_t m) {
+  mode = m;
+}
+
+void Lexer::pushMode(size_t m) {
+#if DEBUG_LEXER == 1
+    std::cout << "pushMode " << m << std::endl;
+#endif
+
+  modeStack.push_back(mode);
+  setMode(m);
+}
+
+size_t Lexer::popMode() {
+  if (modeStack.empty()) {
+    throw EmptyStackException();
+  }
+#if DEBUG_LEXER == 1
+    std::cout << std::string("popMode back to ") << modeStack.back() << std::endl;
+#endif
+
+  setMode(modeStack.back());
+  modeStack.pop_back();
+  return mode;
+}
+
+
+TokenFactory<CommonToken>* Lexer::getTokenFactory() {
+  return _factory;
+}
+
+void Lexer::setInputStream(IntStream *input) {
+  reset();
+  _input = dynamic_cast<CharStream*>(input);
+}
+
+std::string Lexer::getSourceName() {
+  return _input->getSourceName();
+}
+
+CharStream* Lexer::getInputStream() {
+  return _input;
+}
+
+void Lexer::emit(std::unique_ptr<Token> newToken) {
+  token = std::move(newToken);
+}
+
+Token* Lexer::emit() {
+  emit(_factory->create({ this, _input }, type, _text, channel,
+    tokenStartCharIndex, getCharIndex() - 1, tokenStartLine, tokenStartCharPositionInLine));
+  return token.get();
+}
+
+Token* Lexer::emitEOF() {
+  size_t cpos = getCharPositionInLine();
+  size_t line = getLine();
+  emit(_factory->create({ this, _input }, EOF, "", Token::DEFAULT_CHANNEL, _input->index(), _input->index() - 1, line, cpos));
+  return token.get();
+}
+
+size_t Lexer::getLine() const {
+  return getInterpreter<atn::LexerATNSimulator>()->getLine();
+}
+
+size_t Lexer::getCharPositionInLine() {
+  return getInterpreter<atn::LexerATNSimulator>()->getCharPositionInLine();
+}
+
+void Lexer::setLine(size_t line) {
+  getInterpreter<atn::LexerATNSimulator>()->setLine(line);
+}
+
+void Lexer::setCharPositionInLine(size_t charPositionInLine) {
+  getInterpreter<atn::LexerATNSimulator>()->setCharPositionInLine(charPositionInLine);
+}
+
+size_t Lexer::getCharIndex() {
+  return _input->index();
+}
+
+std::string Lexer::getText() {
+  if (!_text.empty()) {
+    return _text;
+  }
+  return getInterpreter<atn::LexerATNSimulator>()->getText(_input);
+}
+
+void Lexer::setText(const std::string &text) {
+  _text = text;
+}
+
+std::unique_ptr<Token> Lexer::getToken() {
+  return std::move(token);
+}
+
+void Lexer::setToken(std::unique_ptr<Token> newToken) {
+  token = std::move(newToken);
+}
+
+void Lexer::setType(size_t ttype) {
+  type = ttype;
+}
+
+size_t Lexer::getType() {
+  return type;
+}
+
+void Lexer::setChannel(size_t newChannel) {
+  channel = newChannel;
+}
+
+size_t Lexer::getChannel() {
+  return channel;
+}
+
+std::vector<std::unique_ptr<Token>> Lexer::getAllTokens() {
+  std::vector<std::unique_ptr<Token>> tokens;
+  std::unique_ptr<Token> t = nextToken();
+  while (t->getType() != EOF) {
+    tokens.push_back(std::move(t));
+    t = nextToken();
+  }
+  return tokens;
+}
+
+void Lexer::recover(const LexerNoViableAltException &/*e*/) {
+  if (_input->LA(1) != EOF) {
+    // skip a char and try again
+    getInterpreter<atn::LexerATNSimulator>()->consume(_input);
+  }
+}
+
+void Lexer::notifyListeners(const LexerNoViableAltException & /*e*/) {
+  ++_syntaxErrors;
+  std::string text = _input->getText(misc::Interval(tokenStartCharIndex, _input->index()));
+  std::string msg = std::string("token recognition error at: '") + getErrorDisplay(text) + std::string("'");
+
+  ProxyErrorListener &listener = getErrorListenerDispatch();
+  listener.syntaxError(this, nullptr, tokenStartLine, tokenStartCharPositionInLine, msg, std::current_exception());
+}
+
+std::string Lexer::getErrorDisplay(const std::string &s) {
+  std::stringstream ss;
+  for (auto c : s) {
+    switch (c) {
+    case '\n':
+      ss << "\\n";
+      break;
+    case '\t':
+      ss << "\\t";
+      break;
+    case '\r':
+      ss << "\\r";
+      break;
+    default:
+      ss << c;
+      break;
+    }
+  }
+  return ss.str();
+}
+
+void Lexer::recover(RecognitionException * /*re*/) {
+  // TODO: Do we lose character or line position information?
+  _input->consume();
+}
+
+size_t Lexer::getNumberOfSyntaxErrors() {
+  return _syntaxErrors;
+}
+
+void Lexer::InitializeInstanceFields() {
+  _syntaxErrors = 0;
+  token = nullptr;
+  _factory = CommonTokenFactory::DEFAULT.get();
+  tokenStartCharIndex = INVALID_INDEX;
+  tokenStartLine = 0;
+  tokenStartCharPositionInLine = 0;
+  hitEOF = false;
+  channel = 0;
+  type = 0;
+  mode = Lexer::DEFAULT_MODE;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Lexer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Lexer.h
new file mode 100755
index 0000000000..2f9b8b6442
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Lexer.h
@@ -0,0 +1,196 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Recognizer.h"
+#include "TokenSource.h"
+#include "CharStream.h"
+#include "Token.h"
+
+namespace antlr4 {
+
+  /// A lexer is recognizer that draws input symbols from a character stream.
+  /// lexer grammars result in a subclass of this object. A Lexer object
+  /// uses simplified match() and error recovery mechanisms in the interest
+  /// of speed.
+  class ANTLR4CPP_PUBLIC Lexer : public Recognizer, public TokenSource {
+  public:
+    static constexpr size_t DEFAULT_MODE = 0;
+    static constexpr size_t MORE = std::numeric_limits<size_t>::max() - 1;
+    static constexpr size_t SKIP = std::numeric_limits<size_t>::max() - 2;
+
+    static constexpr size_t DEFAULT_TOKEN_CHANNEL = Token::DEFAULT_CHANNEL;
+    static constexpr size_t HIDDEN = Token::HIDDEN_CHANNEL;
+    static constexpr size_t MIN_CHAR_VALUE = 0;
+    static constexpr size_t MAX_CHAR_VALUE = 0x10FFFF;
+
+    CharStream *_input; // Pure reference, usually from statically allocated instance.
+
+  protected:
+    /// How to create token objects.
+    TokenFactory<CommonToken> *_factory;
+
+  public:
+    /// The goal of all lexer rules/methods is to create a token object.
+    ///  This is an instance variable as multiple rules may collaborate to
+    ///  create a single token.  nextToken will return this object after
+    ///  matching lexer rule(s).  If you subclass to allow multiple token
+    ///  emissions, then set this to the last token to be matched or
+    ///  something nonnull so that the auto token emit mechanism will not
+    ///  emit another token.
+
+    // Life cycle of a token is this:
+    // Created by emit() (via the token factory) or by action code, holding ownership of it.
+    // Ownership is handed over to the token stream when calling nextToken().
+    std::unique_ptr<Token> token;
+
+    /// <summary>
+    /// What character index in the stream did the current token start at?
+    ///  Needed, for example, to get the text for current token.  Set at
+    ///  the start of nextToken.
+    /// </summary>
+    size_t tokenStartCharIndex;
+
+    /// <summary>
+    /// The line on which the first character of the token resides </summary>
+    size_t tokenStartLine;
+
+    /// The character position of first character within the line.
+    size_t tokenStartCharPositionInLine;
+
+    /// Once we see EOF on char stream, next token will be EOF.
+    /// If you have DONE : EOF ; then you see DONE EOF.
+    bool hitEOF;
+
+    /// The channel number for the current token.
+    size_t channel;
+
+    /// The token type for the current token.
+    size_t type;
+
+    // Use the vector as a stack.
+    std::vector<size_t> modeStack;
+    size_t mode;
+
+    Lexer();
+    Lexer(CharStream *input);
+    virtual ~Lexer() {}
+
+    virtual void reset();
+
+    /// Return a token from this source; i.e., match a token on the char stream.
+    virtual std::unique_ptr<Token> nextToken() override;
+
+    /// Instruct the lexer to skip creating a token for current lexer rule
+    /// and look for another token.  nextToken() knows to keep looking when
+    /// a lexer rule finishes with token set to SKIP_TOKEN.  Recall that
+    /// if token == null at end of any token rule, it creates one for you
+    /// and emits it.
+    virtual void skip();
+    virtual void more();
+    virtual void setMode(size_t m);
+    virtual void pushMode(size_t m);
+    virtual size_t popMode();
+
+    template<typename T1>
+    void setTokenFactory(TokenFactory<T1> *factory)  {
+      this->_factory = factory;
+    }
+
+    virtual TokenFactory<CommonToken>* getTokenFactory() override;
+
+    /// Set the char stream and reset the lexer
+    virtual void setInputStream(IntStream *input) override;
+
+    virtual std::string getSourceName() override;
+
+    virtual CharStream* getInputStream() override;
+
+    /// By default does not support multiple emits per nextToken invocation
+    /// for efficiency reasons. Subclasses can override this method, nextToken,
+    /// and getToken (to push tokens into a list and pull from that list
+    /// rather than a single variable as this implementation does).
+    virtual void emit(std::unique_ptr<Token> newToken);
+
+    /// The standard method called to automatically emit a token at the
+    /// outermost lexical rule.  The token object should point into the
+    /// char buffer start..stop.  If there is a text override in 'text',
+    /// use that to set the token's text.  Override this method to emit
+    /// custom Token objects or provide a new factory.
+    virtual Token* emit();
+
+    virtual Token* emitEOF();
+
+    virtual size_t getLine() const override;
+
+    virtual size_t getCharPositionInLine() override;
+
+    virtual void setLine(size_t line);
+
+    virtual void setCharPositionInLine(size_t charPositionInLine);
+
+    /// What is the index of the current character of lookahead?
+    virtual size_t getCharIndex();
+
+    /// Return the text matched so far for the current token or any
+    /// text override.
+    virtual std::string getText();
+
+    /// Set the complete text of this token; it wipes any previous
+    /// changes to the text.
+    virtual void setText(const std::string &text);
+
+    /// Override if emitting multiple tokens.
+    virtual std::unique_ptr<Token> getToken();
+
+    virtual void setToken(std::unique_ptr<Token> newToken);
+
+    virtual void setType(size_t ttype);
+
+    virtual size_t getType();
+
+    virtual void setChannel(size_t newChannel);
+
+    virtual size_t getChannel();
+
+    virtual const std::vector<std::string>& getChannelNames() const = 0;
+
+    virtual const std::vector<std::string>& getModeNames() const = 0;
+
+    /// Return a list of all Token objects in input char stream.
+    /// Forces load of all tokens. Does not include EOF token.
+    virtual std::vector<std::unique_ptr<Token>> getAllTokens();
+
+    virtual void recover(const LexerNoViableAltException &e);
+
+    virtual void notifyListeners(const LexerNoViableAltException &e);
+
+    virtual std::string getErrorDisplay(const std::string &s);
+
+    /// Lexers can normally match any char in it's vocabulary after matching
+    /// a token, so do the easy thing and just kill a character and hope
+    /// it all works out.  You can instead use the rule invocation stack
+    /// to do sophisticated error recovery if you are in a fragment rule.
+    virtual void recover(RecognitionException *re);
+
+    /// <summary>
+    /// Gets the number of syntax errors reported during parsing. This value is
+    /// incremented each time <seealso cref="#notifyErrorListeners"/> is called.
+    /// </summary>
+    /// <seealso cref= #notifyListeners </seealso>
+    virtual size_t getNumberOfSyntaxErrors();
+
+  protected:
+    /// You can set the text for the current token to override what is in
+    /// the input char buffer (via setText()).
+    std::string _text;
+
+  private:
+    size_t _syntaxErrors;
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerInterpreter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerInterpreter.cpp
new file mode 100755
index 0000000000..b23610c313
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerInterpreter.cpp
@@ -0,0 +1,60 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATNType.h"
+#include "atn/LexerATNSimulator.h"
+#include "dfa/DFA.h"
+#include "Exceptions.h"
+#include "Vocabulary.h"
+
+#include "LexerInterpreter.h"
+
+using namespace antlr4;
+
+LexerInterpreter::LexerInterpreter(const std::string &grammarFileName, const dfa::Vocabulary &vocabulary,
+  const std::vector<std::string> &ruleNames, const std::vector<std::string> &channelNames, const std::vector<std::string> &modeNames,
+  const atn::ATN &atn, CharStream *input)
+  : Lexer(input), _grammarFileName(grammarFileName), _atn(atn), _ruleNames(ruleNames),
+                  _channelNames(channelNames), _modeNames(modeNames),
+                  _vocabulary(vocabulary) {
+
+  if (_atn.grammarType != atn::ATNType::LEXER) {
+    throw IllegalArgumentException("The ATN must be a lexer ATN.");
+  }
+
+  for (size_t i = 0; i < atn.getNumberOfDecisions(); ++i) {
+    _decisionToDFA.push_back(dfa::DFA(_atn.getDecisionState(i), i));
+  }
+  _interpreter = new atn::LexerATNSimulator(this, _atn, _decisionToDFA, _sharedContextCache); /* mem-check: deleted in d-tor */
+}
+
+LexerInterpreter::~LexerInterpreter()
+{
+  delete _interpreter;
+}
+
+const atn::ATN& LexerInterpreter::getATN() const {
+  return _atn;
+}
+
+std::string LexerInterpreter::getGrammarFileName() const {
+  return _grammarFileName;
+}
+
+const std::vector<std::string>& LexerInterpreter::getRuleNames() const {
+  return _ruleNames;
+}
+
+const std::vector<std::string>& LexerInterpreter::getChannelNames() const {
+  return _channelNames;
+}
+
+const std::vector<std::string>& LexerInterpreter::getModeNames() const {
+  return _modeNames;
+}
+
+const dfa::Vocabulary& LexerInterpreter::getVocabulary() const {
+  return _vocabulary;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerInterpreter.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerInterpreter.h
new file mode 100755
index 0000000000..e39a7ccf2c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerInterpreter.h
@@ -0,0 +1,46 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Lexer.h"
+#include "atn/PredictionContext.h"
+#include "atn/PredictionContextCache.h"
+#include "Vocabulary.h"
+
+namespace antlr4 {
+
+  class ANTLR4CPP_PUBLIC LexerInterpreter : public Lexer {
+  public:
+    LexerInterpreter(const std::string &grammarFileName, const dfa::Vocabulary &vocabulary,
+                     const std::vector<std::string> &ruleNames, const std::vector<std::string> &channelNames,
+                     const std::vector<std::string> &modeNames, const atn::ATN &atn, CharStream *input);
+
+    ~LexerInterpreter();
+
+    virtual const atn::ATN& getATN() const override;
+    virtual std::string getGrammarFileName() const override;
+    virtual const std::vector<std::string>& getRuleNames() const override;
+    virtual const std::vector<std::string>& getChannelNames() const override;
+    virtual const std::vector<std::string>& getModeNames() const override;
+
+    virtual const dfa::Vocabulary& getVocabulary() const override;
+
+  protected:
+    const std::string _grammarFileName;
+    const atn::ATN &_atn;
+
+    const std::vector<std::string> &_ruleNames;
+    const std::vector<std::string> &_channelNames;
+    const std::vector<std::string> &_modeNames;
+    std::vector<dfa::DFA> _decisionToDFA;
+
+    atn::PredictionContextCache _sharedContextCache;
+
+  private:
+    dfa::Vocabulary _vocabulary;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerNoViableAltException.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerNoViableAltException.cpp
new file mode 100755
index 0000000000..cc4fdcfd90
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerNoViableAltException.cpp
@@ -0,0 +1,36 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/Interval.h"
+#include "support/CPPUtils.h"
+#include "CharStream.h"
+#include "Lexer.h"
+
+#include "LexerNoViableAltException.h"
+
+using namespace antlr4;
+
+LexerNoViableAltException::LexerNoViableAltException(Lexer *lexer, CharStream *input, size_t startIndex,
+                                                     atn::ATNConfigSet *deadEndConfigs)
+  : RecognitionException(lexer, input, nullptr, nullptr), _startIndex(startIndex), _deadEndConfigs(deadEndConfigs) {
+}
+
+size_t LexerNoViableAltException::getStartIndex() {
+  return _startIndex;
+}
+
+atn::ATNConfigSet* LexerNoViableAltException::getDeadEndConfigs() {
+  return _deadEndConfigs;
+}
+
+std::string LexerNoViableAltException::toString() {
+  std::string symbol;
+  if (_startIndex < getInputStream()->size()) {
+    symbol = static_cast<CharStream *>(getInputStream())->getText(misc::Interval(_startIndex, _startIndex));
+    symbol = antlrcpp::escapeWhitespace(symbol, false);
+  }
+  std::string format = "LexerNoViableAltException('" + symbol + "')";
+  return format;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerNoViableAltException.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerNoViableAltException.h
new file mode 100755
index 0000000000..bc827e803e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/LexerNoViableAltException.h
@@ -0,0 +1,31 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "RecognitionException.h"
+#include "atn/ATNConfigSet.h"
+
+namespace antlr4 {
+
+  class ANTLR4CPP_PUBLIC LexerNoViableAltException : public RecognitionException {
+  public:
+    LexerNoViableAltException(Lexer *lexer, CharStream *input, size_t startIndex,
+                              atn::ATNConfigSet *deadEndConfigs);
+
+    virtual size_t getStartIndex();
+    virtual atn::ATNConfigSet* getDeadEndConfigs();
+    virtual std::string toString();
+
+  private:
+    /// Matching attempted at what input index?
+    const size_t _startIndex;
+
+    /// Which configurations did we try at input.index() that couldn't match input.LA(1)?
+    atn::ATNConfigSet *_deadEndConfigs;
+
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ListTokenSource.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ListTokenSource.cpp
new file mode 100755
index 0000000000..ec93cb9b6a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ListTokenSource.cpp
@@ -0,0 +1,92 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Token.h"
+#include "CommonToken.h"
+#include "CharStream.h"
+
+#include "ListTokenSource.h"
+
+using namespace antlr4;
+
+ListTokenSource::ListTokenSource(std::vector<std::unique_ptr<Token>> tokens_) : ListTokenSource(std::move(tokens_), "") {
+}
+
+ListTokenSource::ListTokenSource(std::vector<std::unique_ptr<Token>> tokens_, const std::string &sourceName_)
+  : tokens(std::move(tokens_)), sourceName(sourceName_) {
+  InitializeInstanceFields();
+  if (tokens.empty()) {
+    throw "tokens cannot be null";
+  }
+
+  // Check if there is an eof token and create one if not.
+  if (tokens.back()->getType() != Token::EOF) {
+    Token *lastToken = tokens.back().get();
+    size_t start = INVALID_INDEX;
+    size_t previousStop = lastToken->getStopIndex();
+    if (previousStop != INVALID_INDEX) {
+      start = previousStop + 1;
+    }
+
+    size_t stop = std::max(INVALID_INDEX, start - 1);
+    tokens.emplace_back((_factory->create({ this, getInputStream() }, Token::EOF, "EOF",
+      Token::DEFAULT_CHANNEL, start, stop, static_cast<int>(lastToken->getLine()), lastToken->getCharPositionInLine())));
+  }
+}
+
+size_t ListTokenSource::getCharPositionInLine() {
+  if (i < tokens.size()) {
+    return tokens[i]->getCharPositionInLine();
+  }
+  return 0;
+}
+
+std::unique_ptr<Token> ListTokenSource::nextToken() {
+  if (i < tokens.size()) {
+    return std::move(tokens[i++]);
+  }
+  return nullptr;
+}
+
+size_t ListTokenSource::getLine() const {
+  if (i < tokens.size()) {
+    return tokens[i]->getLine();
+  }
+
+  return 1;
+}
+
+CharStream *ListTokenSource::getInputStream() {
+  if (i < tokens.size()) {
+    return tokens[i]->getInputStream();
+  } else if (!tokens.empty()) {
+    return tokens.back()->getInputStream();
+  }
+
+  // no input stream information is available
+  return nullptr;
+}
+
+std::string ListTokenSource::getSourceName() {
+  if (sourceName != "") {
+    return sourceName;
+  }
+
+  CharStream *inputStream = getInputStream();
+  if (inputStream != nullptr) {
+    return inputStream->getSourceName();
+  }
+
+  return "List";
+}
+
+TokenFactory<CommonToken>* ListTokenSource::getTokenFactory() {
+  return _factory;
+}
+
+void ListTokenSource::InitializeInstanceFields() {
+  i = 0;
+  _factory = CommonTokenFactory::DEFAULT.get();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ListTokenSource.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ListTokenSource.h
new file mode 100755
index 0000000000..70cba93638
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ListTokenSource.h
@@ -0,0 +1,88 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "TokenSource.h"
+#include "CommonTokenFactory.h"
+
+namespace antlr4 {
+
+  /// Provides an implementation of <seealso cref="TokenSource"/> as a wrapper around a list
+  /// of <seealso cref="Token"/> objects.
+  ///
+  /// If the final token in the list is an <seealso cref="Token#EOF"/> token, it will be used
+  /// as the EOF token for every call to <seealso cref="#nextToken"/> after the end of the
+  /// list is reached. Otherwise, an EOF token will be created.
+  class ANTLR4CPP_PUBLIC ListTokenSource : public TokenSource {
+  protected:
+    // This list will be emptied token by token as we call nextToken().
+    // Token streams can be used to buffer tokens for a while.
+    std::vector<std::unique_ptr<Token>> tokens;
+
+  private:
+    /// <summary>
+    /// The name of the input source. If this value is {@code null}, a call to
+    /// <seealso cref="#getSourceName"/> should return the source name used to create the
+    /// the next token in <seealso cref="#tokens"/> (or the previous token if the end of
+    /// the input has been reached).
+    /// </summary>
+    const std::string sourceName;
+
+  protected:
+    /// The index into <seealso cref="#tokens"/> of token to return by the next call to
+    /// <seealso cref="#nextToken"/>. The end of the input is indicated by this value
+    /// being greater than or equal to the number of items in <seealso cref="#tokens"/>.
+    size_t i;
+
+  private:
+    /// This is the backing field for <seealso cref="#getTokenFactory"/> and
+    /// <seealso cref="setTokenFactory"/>.
+    TokenFactory<CommonToken> *_factory = CommonTokenFactory::DEFAULT.get();
+
+  public:
+    /// Constructs a new <seealso cref="ListTokenSource"/> instance from the specified
+    /// collection of <seealso cref="Token"/> objects.
+    ///
+    /// <param name="tokens"> The collection of <seealso cref="Token"/> objects to provide as a
+    /// <seealso cref="TokenSource"/>. </param>
+    /// <exception cref="NullPointerException"> if {@code tokens} is {@code null} </exception>
+    ListTokenSource(std::vector<std::unique_ptr<Token>> tokens);
+    ListTokenSource(const ListTokenSource& other) = delete;
+
+    ListTokenSource& operator = (const ListTokenSource& other) = delete;
+
+    /// <summary>
+    /// Constructs a new <seealso cref="ListTokenSource"/> instance from the specified
+    /// collection of <seealso cref="Token"/> objects and source name.
+    /// </summary>
+    /// <param name="tokens"> The collection of <seealso cref="Token"/> objects to provide as a
+    /// <seealso cref="TokenSource"/>. </param>
+    /// <param name="sourceName"> The name of the <seealso cref="TokenSource"/>. If this value is
+    /// {@code null}, <seealso cref="#getSourceName"/> will attempt to infer the name from
+    /// the next <seealso cref="Token"/> (or the previous token if the end of the input has
+    /// been reached).
+    /// </param>
+    /// <exception cref="NullPointerException"> if {@code tokens} is {@code null} </exception>
+    ListTokenSource(std::vector<std::unique_ptr<Token>> tokens_, const std::string &sourceName_);
+
+    virtual size_t getCharPositionInLine() override;
+    virtual std::unique_ptr<Token> nextToken() override;
+    virtual size_t getLine() const override;
+    virtual CharStream* getInputStream() override;
+    virtual std::string getSourceName() override;
+
+    template<typename T1>
+    void setTokenFactory(TokenFactory<T1> *factory) {
+      this->_factory = factory;
+    }
+
+    virtual TokenFactory<CommonToken>* getTokenFactory() override;
+
+  private:
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/NoViableAltException.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/NoViableAltException.cpp
new file mode 100755
index 0000000000..273c208c74
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/NoViableAltException.cpp
@@ -0,0 +1,46 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Parser.h"
+
+#include "NoViableAltException.h"
+
+using namespace antlr4;
+
+namespace {
+
+// Create a normal shared pointer if the configurations are to be deleted. If not, then
+// the shared pointer is created with a deleter that does nothing.
+Ref<atn::ATNConfigSet> buildConfigsRef(atn::ATNConfigSet *configs, bool deleteConfigs) {
+  if (deleteConfigs) {
+    return Ref<atn::ATNConfigSet>(configs);
+  } else {
+    return Ref<atn::ATNConfigSet>(configs, [](atn::ATNConfigSet *){});
+  }
+}
+
+}
+
+NoViableAltException::NoViableAltException(Parser *recognizer)
+  : NoViableAltException(recognizer, recognizer->getTokenStream(), recognizer->getCurrentToken(),
+                         recognizer->getCurrentToken(), nullptr, recognizer->getContext(), false) {
+}
+
+NoViableAltException::NoViableAltException(Parser *recognizer, TokenStream *input,Token *startToken,
+  Token *offendingToken, atn::ATNConfigSet *deadEndConfigs, ParserRuleContext *ctx, bool deleteConfigs)
+  : RecognitionException("No viable alternative", recognizer, input, ctx, offendingToken),
+    _deadEndConfigs(buildConfigsRef(deadEndConfigs, deleteConfigs)), _startToken(startToken) {
+}
+
+NoViableAltException::~NoViableAltException() {
+}
+
+Token* NoViableAltException::getStartToken() const {
+  return _startToken;
+}
+
+atn::ATNConfigSet* NoViableAltException::getDeadEndConfigs() const {
+  return _deadEndConfigs.get();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/NoViableAltException.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/NoViableAltException.h
new file mode 100755
index 0000000000..b15039d0cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/NoViableAltException.h
@@ -0,0 +1,42 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "RecognitionException.h"
+#include "Token.h"
+#include "atn/ATNConfigSet.h"
+
+namespace antlr4 {
+
+  /// Indicates that the parser could not decide which of two or more paths
+  /// to take based upon the remaining input. It tracks the starting token
+  /// of the offending input and also knows where the parser was
+  /// in the various paths when the error. Reported by reportNoViableAlternative()
+  class ANTLR4CPP_PUBLIC NoViableAltException : public RecognitionException {
+  public:
+    NoViableAltException(Parser *recognizer); // LL(1) error
+    NoViableAltException(Parser *recognizer, TokenStream *input,Token *startToken,
+      Token *offendingToken, atn::ATNConfigSet *deadEndConfigs, ParserRuleContext *ctx, bool deleteConfigs);
+    ~NoViableAltException();
+    
+    virtual Token* getStartToken() const;
+    virtual atn::ATNConfigSet* getDeadEndConfigs() const;
+
+  private:
+    /// Which configurations did we try at input.index() that couldn't match input.LT(1)?
+    /// Shared pointer that conditionally deletes the configurations (based on flag
+    /// passed during construction)
+    Ref<atn::ATNConfigSet> _deadEndConfigs;
+
+    /// The token object at the start index; the input stream might
+    /// not be buffering tokens so get a reference to it. (At the
+    /// time the error occurred, of course the stream needs to keep a
+    /// buffer all of the tokens but later we might not have access to those.)
+    Token *_startToken;
+
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Parser.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Parser.cpp
new file mode 100755
index 0000000000..337bcba17a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Parser.cpp
@@ -0,0 +1,670 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATNDeserializationOptions.h"
+#include "tree/pattern/ParseTreePatternMatcher.h"
+#include "dfa/DFA.h"
+#include "ParserRuleContext.h"
+#include "tree/TerminalNode.h"
+#include "tree/ErrorNodeImpl.h"
+#include "Lexer.h"
+#include "atn/ParserATNSimulator.h"
+#include "misc/IntervalSet.h"
+#include "atn/RuleStartState.h"
+#include "DefaultErrorStrategy.h"
+#include "atn/ATNDeserializer.h"
+#include "atn/RuleTransition.h"
+#include "atn/ATN.h"
+#include "Exceptions.h"
+#include "ANTLRErrorListener.h"
+#include "tree/pattern/ParseTreePattern.h"
+#include "internal/Synchronization.h"
+
+#include "atn/ProfilingATNSimulator.h"
+#include "atn/ParseInfo.h"
+
+#include "Parser.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::internal;
+using namespace antlrcpp;
+
+namespace {
+
+struct BypassAltsAtnCache final {
+  std::shared_mutex mutex;
+  /// This field maps from the serialized ATN string to the deserialized <seealso cref="ATN"/> with
+  /// bypass alternatives.
+  ///
+  /// <seealso cref= ATNDeserializationOptions#isGenerateRuleBypassTransitions() </seealso>
+  std::map<std::vector<int32_t>, std::unique_ptr<const atn::ATN>, std::less<>> map;
+};
+
+BypassAltsAtnCache* getBypassAltsAtnCache() {
+  static BypassAltsAtnCache* const instance = new BypassAltsAtnCache();
+  return instance;
+}
+
+}
+
+Parser::TraceListener::TraceListener(Parser *outerInstance_) : outerInstance(outerInstance_) {
+}
+
+Parser::TraceListener::~TraceListener() {
+}
+
+void Parser::TraceListener::enterEveryRule(ParserRuleContext *ctx) {
+  std::cout << "enter   " << outerInstance->getRuleNames()[ctx->getRuleIndex()]
+    << ", LT(1)=" << outerInstance->_input->LT(1)->getText() << std::endl;
+}
+
+void Parser::TraceListener::visitTerminal(tree::TerminalNode *node) {
+  std::cout << "consume " << node->getSymbol() << " rule "
+    << outerInstance->getRuleNames()[outerInstance->getContext()->getRuleIndex()] << std::endl;
+}
+
+void Parser::TraceListener::visitErrorNode(tree::ErrorNode * /*node*/) {
+}
+
+void Parser::TraceListener::exitEveryRule(ParserRuleContext *ctx) {
+  std::cout << "exit    " << outerInstance->getRuleNames()[ctx->getRuleIndex()]
+    << ", LT(1)=" << outerInstance->_input->LT(1)->getText() << std::endl;
+}
+
+Parser::TrimToSizeListener Parser::TrimToSizeListener::INSTANCE;
+
+Parser::TrimToSizeListener::~TrimToSizeListener() {
+}
+
+void Parser::TrimToSizeListener::enterEveryRule(ParserRuleContext * /*ctx*/) {
+}
+
+void Parser::TrimToSizeListener::visitTerminal(tree::TerminalNode * /*node*/) {
+}
+
+void Parser::TrimToSizeListener::visitErrorNode(tree::ErrorNode * /*node*/) {
+}
+
+void Parser::TrimToSizeListener::exitEveryRule(ParserRuleContext * ctx) {
+  ctx->children.shrink_to_fit();
+}
+
+Parser::Parser(TokenStream *input) {
+  InitializeInstanceFields();
+  setInputStream(input);
+}
+
+Parser::~Parser() {
+  _tracker.reset();
+  delete _tracer;
+}
+
+void Parser::reset() {
+  if (getInputStream() != nullptr) {
+    getInputStream()->seek(0);
+  }
+  _errHandler->reset(this); // Watch out, this is not shared_ptr.reset().
+
+  _matchedEOF = false;
+  _syntaxErrors = 0;
+  setTrace(false);
+  _precedenceStack.clear();
+  _precedenceStack.push_back(0);
+  _ctx = nullptr;
+  _tracker.reset();
+
+  atn::ATNSimulator *interpreter = getInterpreter<atn::ParserATNSimulator>();
+  if (interpreter != nullptr) {
+    interpreter->reset();
+  }
+}
+
+Token* Parser::match(size_t ttype) {
+  Token *t = getCurrentToken();
+  if (t->getType() == ttype) {
+    if (ttype == EOF) {
+      _matchedEOF = true;
+    }
+    _errHandler->reportMatch(this);
+    consume();
+  } else {
+    t = _errHandler->recoverInline(this);
+    if (_buildParseTrees && t->getTokenIndex() == INVALID_INDEX) {
+      // we must have conjured up a new token during single token insertion
+      // if it's not the current symbol
+      _ctx->addChild(createErrorNode(t));
+    }
+  }
+  return t;
+}
+
+Token* Parser::matchWildcard() {
+  Token *t = getCurrentToken();
+  if (t->getType() > 0) {
+    _errHandler->reportMatch(this);
+    consume();
+  } else {
+    t = _errHandler->recoverInline(this);
+    if (_buildParseTrees && t->getTokenIndex() == INVALID_INDEX) {
+      // we must have conjured up a new token during single token insertion
+      // if it's not the current symbol
+      _ctx->addChild(createErrorNode(t));
+    }
+  }
+
+  return t;
+}
+
+void Parser::setBuildParseTree(bool buildParseTrees) {
+  this->_buildParseTrees = buildParseTrees;
+}
+
+bool Parser::getBuildParseTree() {
+  return _buildParseTrees;
+}
+
+void Parser::setTrimParseTree(bool trimParseTrees) {
+  if (trimParseTrees) {
+    if (getTrimParseTree()) {
+      return;
+    }
+    addParseListener(&TrimToSizeListener::INSTANCE);
+  } else {
+    removeParseListener(&TrimToSizeListener::INSTANCE);
+  }
+}
+
+bool Parser::getTrimParseTree() {
+  return std::find(getParseListeners().begin(), getParseListeners().end(), &TrimToSizeListener::INSTANCE) != getParseListeners().end();
+}
+
+std::vector<tree::ParseTreeListener *> Parser::getParseListeners() {
+  return _parseListeners;
+}
+
+void Parser::addParseListener(tree::ParseTreeListener *listener) {
+  if (!listener) {
+    throw NullPointerException("listener");
+  }
+
+  this->_parseListeners.push_back(listener);
+}
+
+void Parser::removeParseListener(tree::ParseTreeListener *listener) {
+  if (!_parseListeners.empty()) {
+    auto it = std::find(_parseListeners.begin(), _parseListeners.end(), listener);
+    if (it != _parseListeners.end()) {
+      _parseListeners.erase(it);
+    }
+  }
+}
+
+void Parser::removeParseListeners() {
+  _parseListeners.clear();
+}
+
+void Parser::triggerEnterRuleEvent() {
+  for (auto *listener : _parseListeners) {
+    listener->enterEveryRule(_ctx);
+    _ctx->enterRule(listener);
+  }
+}
+
+void Parser::triggerExitRuleEvent() {
+  // reverse order walk of listeners
+  for (auto it = _parseListeners.rbegin(); it != _parseListeners.rend(); ++it) {
+    _ctx->exitRule(*it);
+    (*it)->exitEveryRule(_ctx);
+  }
+}
+
+size_t Parser::getNumberOfSyntaxErrors() {
+  return _syntaxErrors;
+}
+
+TokenFactory<CommonToken>* Parser::getTokenFactory() {
+  return _input->getTokenSource()->getTokenFactory();
+}
+
+const atn::ATN& Parser::getATNWithBypassAlts() {
+  auto serializedAtn = getSerializedATN();
+  if (serializedAtn.empty()) {
+    throw UnsupportedOperationException("The current parser does not support an ATN with bypass alternatives.");
+  }
+  // XXX: using the entire serialized ATN as key into the map is a big resource waste.
+  //      How large can that thing become?
+  auto *cache = getBypassAltsAtnCache();
+  {
+    std::shared_lock<std::shared_mutex> lock(cache->mutex);
+    auto existing = cache->map.find(serializedAtn);
+    if (existing != cache->map.end()) {
+      return *existing->second;
+    }
+  }
+
+  std::unique_lock<std::shared_mutex> lock(cache->mutex);
+  auto existing = cache->map.find(serializedAtn);
+  if (existing != cache->map.end()) {
+    return *existing->second;
+  }
+  atn::ATNDeserializationOptions deserializationOptions;
+  deserializationOptions.setGenerateRuleBypassTransitions(true);
+  atn::ATNDeserializer deserializer(deserializationOptions);
+  auto atn = deserializer.deserialize(serializedAtn);
+  return *cache->map.insert(std::make_pair(std::vector<int32_t>(serializedAtn.begin(), serializedAtn.end()), std::move(atn))).first->second;
+}
+
+tree::pattern::ParseTreePattern Parser::compileParseTreePattern(const std::string &pattern, int patternRuleIndex) {
+  if (getTokenStream() != nullptr) {
+    TokenSource *tokenSource = getTokenStream()->getTokenSource();
+    if (is<Lexer*>(tokenSource)) {
+      Lexer *lexer = dynamic_cast<Lexer *>(tokenSource);
+      return compileParseTreePattern(pattern, patternRuleIndex, lexer);
+    }
+  }
+  throw UnsupportedOperationException("Parser can't discover a lexer to use");
+}
+
+tree::pattern::ParseTreePattern Parser::compileParseTreePattern(const std::string &pattern, int patternRuleIndex,
+  Lexer *lexer) {
+  tree::pattern::ParseTreePatternMatcher m(lexer, this);
+  return m.compile(pattern, patternRuleIndex);
+}
+
+Ref<ANTLRErrorStrategy> Parser::getErrorHandler() {
+  return _errHandler;
+}
+
+void Parser::setErrorHandler(Ref<ANTLRErrorStrategy> const& handler) {
+  _errHandler = handler;
+}
+
+IntStream* Parser::getInputStream() {
+  return getTokenStream();
+}
+
+void Parser::setInputStream(IntStream *input) {
+  setTokenStream(static_cast<TokenStream*>(input));
+}
+
+TokenStream* Parser::getTokenStream() {
+  return _input;
+}
+
+void Parser::setTokenStream(TokenStream *input) {
+  _input = nullptr; // Just a reference we don't own.
+  reset();
+  _input = input;
+}
+
+Token* Parser::getCurrentToken() {
+  return _input->LT(1);
+}
+
+void Parser::notifyErrorListeners(const std::string &msg) {
+  notifyErrorListeners(getCurrentToken(), msg, nullptr);
+}
+
+void Parser::notifyErrorListeners(Token *offendingToken, const std::string &msg, std::exception_ptr e) {
+  _syntaxErrors++;
+  size_t line = offendingToken->getLine();
+  size_t charPositionInLine = offendingToken->getCharPositionInLine();
+
+  ProxyErrorListener &listener = getErrorListenerDispatch();
+  listener.syntaxError(this, offendingToken, line, charPositionInLine, msg, e);
+}
+
+Token* Parser::consume() {
+  Token *o = getCurrentToken();
+  if (o->getType() != EOF) {
+    getInputStream()->consume();
+  }
+
+  bool hasListener = _parseListeners.size() > 0 && !_parseListeners.empty();
+  if (_buildParseTrees || hasListener) {
+    if (_errHandler->inErrorRecoveryMode(this)) {
+      tree::ErrorNode *node = createErrorNode(o);
+      _ctx->addChild(node);
+      if (_parseListeners.size() > 0) {
+        for (auto *listener : _parseListeners) {
+          listener->visitErrorNode(node);
+        }
+      }
+    } else {
+      tree::TerminalNode *node = _ctx->addChild(createTerminalNode(o));
+      if (_parseListeners.size() > 0) {
+        for (auto *listener : _parseListeners) {
+          listener->visitTerminal(node);
+        }
+      }
+    }
+  }
+  return o;
+}
+
+void Parser::addContextToParseTree() {
+  // Add current context to parent if we have a parent.
+  if (_ctx->parent == nullptr)
+    return;
+
+  downCast<ParserRuleContext*>(_ctx->parent)->addChild(_ctx);
+}
+
+void Parser::enterRule(ParserRuleContext *localctx, size_t state, size_t /*ruleIndex*/) {
+  setState(state);
+  _ctx = localctx;
+  _ctx->start = _input->LT(1);
+  if (_buildParseTrees) {
+    addContextToParseTree();
+  }
+  if (_parseListeners.size() > 0) {
+    triggerEnterRuleEvent();
+  }
+}
+
+void Parser::exitRule() {
+  if (_matchedEOF) {
+    // if we have matched EOF, it cannot consume past EOF so we use LT(1) here
+    _ctx->stop = _input->LT(1); // LT(1) will be end of file
+  } else {
+    _ctx->stop = _input->LT(-1); // stop node is what we just matched
+  }
+
+  // trigger event on ctx, before it reverts to parent
+  if (_parseListeners.size() > 0) {
+    triggerExitRuleEvent();
+  }
+  setState(_ctx->invokingState);
+  _ctx = downCast<ParserRuleContext*>(_ctx->parent);
+}
+
+void Parser::enterOuterAlt(ParserRuleContext *localctx, size_t altNum) {
+  localctx->setAltNumber(altNum);
+
+  // if we have new localctx, make sure we replace existing ctx
+  // that is previous child of parse tree
+  if (_buildParseTrees && _ctx != localctx) {
+    if (_ctx->parent != nullptr) {
+      ParserRuleContext *parent = downCast<ParserRuleContext*>(_ctx->parent);
+      parent->removeLastChild();
+      parent->addChild(localctx);
+    }
+  }
+  _ctx = localctx;
+}
+
+int Parser::getPrecedence() const {
+  if (_precedenceStack.empty()) {
+    return -1;
+  }
+
+  return _precedenceStack.back();
+}
+
+void Parser::enterRecursionRule(ParserRuleContext *localctx, size_t ruleIndex) {
+  enterRecursionRule(localctx, getATN().ruleToStartState[ruleIndex]->stateNumber, ruleIndex, 0);
+}
+
+void Parser::enterRecursionRule(ParserRuleContext *localctx, size_t state, size_t /*ruleIndex*/, int precedence) {
+  setState(state);
+  _precedenceStack.push_back(precedence);
+  _ctx = localctx;
+  _ctx->start = _input->LT(1);
+  if (!_parseListeners.empty()) {
+    triggerEnterRuleEvent(); // simulates rule entry for left-recursive rules
+  }
+}
+
+void Parser::pushNewRecursionContext(ParserRuleContext *localctx, size_t state, size_t /*ruleIndex*/) {
+  ParserRuleContext *previous = _ctx;
+  previous->parent = localctx;
+  previous->invokingState = state;
+  previous->stop = _input->LT(-1);
+
+  _ctx = localctx;
+  _ctx->start = previous->start;
+  if (_buildParseTrees) {
+    _ctx->addChild(previous);
+  }
+
+  if (_parseListeners.size() > 0) {
+    triggerEnterRuleEvent(); // simulates rule entry for left-recursive rules
+  }
+}
+
+void Parser::unrollRecursionContexts(ParserRuleContext *parentctx) {
+  _precedenceStack.pop_back();
+  _ctx->stop = _input->LT(-1);
+  ParserRuleContext *retctx = _ctx; // save current ctx (return value)
+
+  // unroll so ctx is as it was before call to recursive method
+  if (_parseListeners.size() > 0) {
+    while (_ctx != parentctx) {
+      triggerExitRuleEvent();
+      _ctx = downCast<ParserRuleContext*>(_ctx->parent);
+    }
+  } else {
+    _ctx = parentctx;
+  }
+
+  // hook into tree
+  retctx->parent = parentctx;
+
+  if (_buildParseTrees && parentctx != nullptr) {
+    // add return ctx into invoking rule's tree
+    parentctx->addChild(retctx);
+  }
+}
+
+ParserRuleContext* Parser::getInvokingContext(size_t ruleIndex) {
+  ParserRuleContext *p = _ctx;
+  while (p) {
+    if (p->getRuleIndex() == ruleIndex) {
+      return p;
+    }
+    if (p->parent == nullptr)
+      break;
+    p = downCast<ParserRuleContext*>(p->parent);
+  }
+  return nullptr;
+}
+
+ParserRuleContext* Parser::getContext() {
+  return _ctx;
+}
+
+void Parser::setContext(ParserRuleContext *ctx) {
+  _ctx = ctx;
+}
+
+bool Parser::precpred(RuleContext * /*localctx*/, int precedence) {
+  return precedence >= _precedenceStack.back();
+}
+
+bool Parser::inContext(const std::string &/*context*/) {
+  // TODO: useful in parser?
+  return false;
+}
+
+bool Parser::isExpectedToken(size_t symbol) {
+  const atn::ATN &atn = getInterpreter<atn::ParserATNSimulator>()->atn;
+  ParserRuleContext *ctx = _ctx;
+  atn::ATNState *s = atn.states[getState()];
+  misc::IntervalSet following = atn.nextTokens(s);
+
+  if (following.contains(symbol)) {
+    return true;
+  }
+
+  if (!following.contains(Token::EPSILON)) {
+    return false;
+  }
+
+  while (ctx && ctx->invokingState != ATNState::INVALID_STATE_NUMBER && following.contains(Token::EPSILON)) {
+    atn::ATNState *invokingState = atn.states[ctx->invokingState];
+    const atn::RuleTransition *rt = static_cast<const atn::RuleTransition*>(invokingState->transitions[0].get());
+    following = atn.nextTokens(rt->followState);
+    if (following.contains(symbol)) {
+      return true;
+    }
+
+    ctx = downCast<ParserRuleContext*>(ctx->parent);
+  }
+
+  if (following.contains(Token::EPSILON) && symbol == EOF) {
+    return true;
+  }
+
+  return false;
+}
+
+bool Parser::isMatchedEOF() const {
+  return _matchedEOF;
+}
+
+misc::IntervalSet Parser::getExpectedTokens() {
+  return getATN().getExpectedTokens(getState(), getContext());
+}
+
+misc::IntervalSet Parser::getExpectedTokensWithinCurrentRule() {
+  const atn::ATN &atn = getInterpreter<atn::ParserATNSimulator>()->atn;
+  atn::ATNState *s = atn.states[getState()];
+  return atn.nextTokens(s);
+}
+
+size_t Parser::getRuleIndex(const std::string &ruleName) {
+  const std::map<std::string, size_t> &m = getRuleIndexMap();
+  auto iterator = m.find(ruleName);
+  if (iterator == m.end()) {
+    return INVALID_INDEX;
+  }
+  return iterator->second;
+}
+
+ParserRuleContext* Parser::getRuleContext() {
+  return _ctx;
+}
+
+std::vector<std::string> Parser::getRuleInvocationStack() {
+  return getRuleInvocationStack(_ctx);
+}
+
+std::vector<std::string> Parser::getRuleInvocationStack(RuleContext *p) {
+  std::vector<std::string> const& ruleNames = getRuleNames();
+  std::vector<std::string> stack;
+  RuleContext *run = p;
+  while (run != nullptr) {
+    // compute what follows who invoked us
+    size_t ruleIndex = run->getRuleIndex();
+    if (ruleIndex == INVALID_INDEX ) {
+      stack.push_back("n/a");
+    } else {
+      stack.push_back(ruleNames[ruleIndex]);
+    }
+    if (!RuleContext::is(run->parent)) {
+      break;
+    }
+    run = downCast<RuleContext*>(run->parent);
+  }
+  return stack;
+}
+
+std::vector<std::string> Parser::getDFAStrings() {
+  atn::ParserATNSimulator *simulator = getInterpreter<atn::ParserATNSimulator>();
+  if (!simulator->decisionToDFA.empty()) {
+    UniqueLock<Mutex> lck(_mutex);
+
+    std::vector<std::string> s;
+    for (size_t d = 0; d < simulator->decisionToDFA.size(); d++) {
+      dfa::DFA &dfa = simulator->decisionToDFA[d];
+      s.push_back(dfa.toString(getVocabulary()));
+    }
+    return s;
+  }
+  return std::vector<std::string>();
+}
+
+void Parser::dumpDFA() {
+  atn::ParserATNSimulator *simulator = getInterpreter<atn::ParserATNSimulator>();
+  if (!simulator->decisionToDFA.empty()) {
+    UniqueLock<Mutex> lck(_mutex);
+    bool seenOne = false;
+    for (size_t d = 0; d < simulator->decisionToDFA.size(); d++) {
+      dfa::DFA &dfa = simulator->decisionToDFA[d];
+      if (!dfa.states.empty()) {
+        if (seenOne) {
+          std::cout << std::endl;
+        }
+        std::cout << "Decision " << dfa.decision << ":" << std::endl;
+        std::cout << dfa.toString(getVocabulary());
+        seenOne = true;
+      }
+    }
+  }
+}
+
+std::string Parser::getSourceName() {
+  return _input->getSourceName();
+}
+
+atn::ParseInfo Parser::getParseInfo() const {
+  atn::ParserATNSimulator *simulator = getInterpreter<atn::ParserATNSimulator>();
+  return atn::ParseInfo(dynamic_cast<atn::ProfilingATNSimulator*>(simulator));
+}
+
+void Parser::setProfile(bool profile) {
+  atn::ParserATNSimulator *interp = getInterpreter<atn::ParserATNSimulator>();
+  atn::PredictionMode saveMode = interp != nullptr ? interp->getPredictionMode() : atn::PredictionMode::LL;
+  if (profile) {
+    if (!is<atn::ProfilingATNSimulator *>(interp)) {
+      setInterpreter(new atn::ProfilingATNSimulator(this)); /* mem-check: replacing existing interpreter which gets deleted. */
+    }
+  } else if (is<atn::ProfilingATNSimulator *>(interp)) {
+    /* mem-check: replacing existing interpreter which gets deleted. */
+    atn::ParserATNSimulator *sim = new atn::ParserATNSimulator(this, getATN(), interp->decisionToDFA, interp->getSharedContextCache());
+    setInterpreter(sim);
+  }
+  getInterpreter<atn::ParserATNSimulator>()->setPredictionMode(saveMode);
+}
+
+void Parser::setTrace(bool trace) {
+  if (!trace) {
+    if (_tracer)
+      removeParseListener(_tracer);
+    delete _tracer;
+    _tracer = nullptr;
+  } else {
+    if (_tracer)
+      removeParseListener(_tracer); // Just in case this is triggered multiple times.
+    _tracer = new TraceListener(this);
+    addParseListener(_tracer);
+  }
+}
+
+bool Parser::isTrace() const {
+  return _tracer != nullptr;
+}
+
+tree::TerminalNode *Parser::createTerminalNode(Token *t) {
+  return _tracker.createInstance<tree::TerminalNodeImpl>(t);
+}
+
+tree::ErrorNode *Parser::createErrorNode(Token *t) {
+  return _tracker.createInstance<tree::ErrorNodeImpl>(t);
+}
+
+void Parser::InitializeInstanceFields() {
+  _errHandler = std::make_shared<DefaultErrorStrategy>();
+  _precedenceStack.clear();
+  _precedenceStack.push_back(0);
+  _buildParseTrees = true;
+  _syntaxErrors = 0;
+  _matchedEOF = false;
+  _input = nullptr;
+  _tracer = nullptr;
+  _ctx = nullptr;
+}
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Parser.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Parser.h
new file mode 100755
index 0000000000..4d735da68d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Parser.h
@@ -0,0 +1,461 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Recognizer.h"
+#include "tree/ParseTreeListener.h"
+#include "tree/ParseTree.h"
+#include "TokenStream.h"
+#include "TokenSource.h"
+#include "misc/Interval.h"
+
+namespace antlr4 {
+
+  /// This is all the parsing support code essentially; most of it is error recovery stuff.
+  class ANTLR4CPP_PUBLIC Parser : public Recognizer {
+  public:
+
+    class TraceListener : public tree::ParseTreeListener {
+    public:
+      TraceListener(Parser *outerInstance);
+      virtual ~TraceListener();
+
+      virtual void enterEveryRule(ParserRuleContext *ctx) override;
+      virtual void visitTerminal(tree::TerminalNode *node) override;
+      virtual void visitErrorNode(tree::ErrorNode *node) override;
+      virtual void exitEveryRule(ParserRuleContext *ctx) override;
+
+    private:
+      Parser *const outerInstance;
+    };
+
+    class TrimToSizeListener : public tree::ParseTreeListener {
+    public:
+      static TrimToSizeListener INSTANCE;
+
+      virtual ~TrimToSizeListener();
+
+      virtual void enterEveryRule(ParserRuleContext *ctx) override;
+      virtual void visitTerminal(tree::TerminalNode *node) override;
+      virtual void visitErrorNode(tree::ErrorNode *node) override;
+      virtual void exitEveryRule(ParserRuleContext *ctx) override;
+    };
+
+    Parser(TokenStream *input);
+    virtual ~Parser();
+
+    /// reset the parser's state
+    virtual void reset();
+
+    /// <summary>
+    /// Match current input symbol against {@code ttype}. If the symbol type
+    /// matches, <seealso cref="ANTLRErrorStrategy#reportMatch"/> and <seealso cref="#consume"/> are
+    /// called to complete the match process.
+    ///
+    /// If the symbol type does not match,
+    /// <seealso cref="ANTLRErrorStrategy#recoverInline"/> is called on the current error
+    /// strategy to attempt recovery. If <seealso cref="#getBuildParseTree"/> is
+    /// {@code true} and the token index of the symbol returned by
+    /// <seealso cref="ANTLRErrorStrategy#recoverInline"/> is -1, the symbol is added to
+    /// the parse tree by calling {@link #createErrorNode(ParserRuleContext, Token)} then
+    /// {@link ParserRuleContext#addErrorNode(ErrorNode)}.
+    /// </summary>
+    /// <param name="ttype"> the token type to match </param>
+    /// <returns> the matched symbol </returns>
+    /// <exception cref="RecognitionException"> if the current input symbol did not match
+    /// {@code ttype} and the error strategy could not recover from the
+    /// mismatched symbol </exception>
+    virtual Token* match(size_t ttype);
+
+    /// <summary>
+    /// Match current input symbol as a wildcard. If the symbol type matches
+    /// (i.e. has a value greater than 0), <seealso cref="ANTLRErrorStrategy#reportMatch"/>
+    /// and <seealso cref="#consume"/> are called to complete the match process.
+    /// <p/>
+    /// If the symbol type does not match,
+    /// <seealso cref="ANTLRErrorStrategy#recoverInline"/> is called on the current error
+    /// strategy to attempt recovery. If <seealso cref="#getBuildParseTree"/> is
+    /// {@code true} and the token index of the symbol returned by
+    /// <seealso cref="ANTLRErrorStrategy#recoverInline"/> is -1, the symbol is added to
+    /// the parse tree by calling <seealso cref="ParserRuleContext#addErrorNode"/>.
+    /// </summary>
+    /// <returns> the matched symbol </returns>
+    /// <exception cref="RecognitionException"> if the current input symbol did not match
+    /// a wildcard and the error strategy could not recover from the mismatched
+    /// symbol </exception>
+    virtual Token* matchWildcard();
+
+    /// <summary>
+    /// Track the <seealso cref="ParserRuleContext"/> objects during the parse and hook
+    /// them up using the <seealso cref="ParserRuleContext#children"/> list so that it
+    /// forms a parse tree. The <seealso cref="ParserRuleContext"/> returned from the start
+    /// rule represents the root of the parse tree.
+    /// <p/>
+    /// Note that if we are not building parse trees, rule contexts only point
+    /// upwards. When a rule exits, it returns the context but that gets garbage
+    /// collected if nobody holds a reference. It points upwards but nobody
+    /// points at it.
+    /// <p/>
+    /// When we build parse trees, we are adding all of these contexts to
+    /// <seealso cref="ParserRuleContext#children"/> list. Contexts are then not candidates
+    /// for garbage collection.
+    /// </summary>
+    virtual void setBuildParseTree(bool buildParseTrees);
+
+    /// <summary>
+    /// Gets whether or not a complete parse tree will be constructed while
+    /// parsing. This property is {@code true} for a newly constructed parser.
+    /// </summary>
+    /// <returns> {@code true} if a complete parse tree will be constructed while
+    /// parsing, otherwise {@code false} </returns>
+    virtual bool getBuildParseTree();
+
+    /// <summary>
+    /// Trim the internal lists of the parse tree during parsing to conserve memory.
+    /// This property is set to {@code false} by default for a newly constructed parser.
+    /// </summary>
+    /// <param name="trimParseTrees"> {@code true} to trim the capacity of the <seealso cref="ParserRuleContext#children"/>
+    /// list to its size after a rule is parsed. </param>
+    virtual void setTrimParseTree(bool trimParseTrees);
+
+    /// <returns> {@code true} if the <seealso cref="ParserRuleContext#children"/> list is trimmed
+    /// using the default <seealso cref="Parser.TrimToSizeListener"/> during the parse process. </returns>
+    virtual bool getTrimParseTree();
+
+    virtual std::vector<tree::ParseTreeListener *> getParseListeners();
+
+    /// <summary>
+    /// Registers {@code listener} to receive events during the parsing process.
+    /// <p/>
+    /// To support output-preserving grammar transformations (including but not
+    /// limited to left-recursion removal, automated left-factoring, and
+    /// optimized code generation), calls to listener methods during the parse
+    /// may differ substantially from calls made by
+    /// <seealso cref="ParseTreeWalker#DEFAULT"/> used after the parse is complete. In
+    /// particular, rule entry and exit events may occur in a different order
+    /// during the parse than after the parser. In addition, calls to certain
+    /// rule entry methods may be omitted.
+    /// <p/>
+    /// With the following specific exceptions, calls to listener events are
+    /// <em>deterministic</em>, i.e. for identical input the calls to listener
+    /// methods will be the same.
+    ///
+    /// <ul>
+    /// <li>Alterations to the grammar used to generate code may change the
+    /// behavior of the listener calls.</li>
+    /// <li>Alterations to the command line options passed to ANTLR 4 when
+    /// generating the parser may change the behavior of the listener calls.</li>
+    /// <li>Changing the version of the ANTLR Tool used to generate the parser
+    /// may change the behavior of the listener calls.</li>
+    /// </ul>
+    /// </summary>
+    /// <param name="listener"> the listener to add
+    /// </param>
+    /// <exception cref="NullPointerException"> if {@code} listener is {@code null} </exception>
+    virtual void addParseListener(tree::ParseTreeListener *listener);
+
+    /// <summary>
+    /// Remove {@code listener} from the list of parse listeners.
+    /// <p/>
+    /// If {@code listener} is {@code null} or has not been added as a parse
+    /// listener, this method does nothing.
+    /// </summary>
+    /// <seealso cref= #addParseListener
+    /// </seealso>
+    /// <param name="listener"> the listener to remove </param>
+    virtual void removeParseListener(tree::ParseTreeListener *listener);
+
+    /// <summary>
+    /// Remove all parse listeners.
+    /// </summary>
+    /// <seealso cref= #addParseListener </seealso>
+    virtual void removeParseListeners();
+
+    /// <summary>
+    /// Notify any parse listeners of an enter rule event.
+    /// </summary>
+    /// <seealso cref= #addParseListener </seealso>
+    virtual void triggerEnterRuleEvent();
+
+    /// <summary>
+    /// Notify any parse listeners of an exit rule event.
+    /// </summary>
+    /// <seealso cref= #addParseListener </seealso>
+    virtual void triggerExitRuleEvent();
+
+    /// <summary>
+    /// Gets the number of syntax errors reported during parsing. This value is
+    /// incremented each time <seealso cref="#notifyErrorListeners"/> is called.
+    /// </summary>
+    /// <seealso cref= #notifyErrorListeners </seealso>
+    virtual size_t getNumberOfSyntaxErrors();
+
+    virtual TokenFactory<CommonToken>* getTokenFactory() override;
+
+    /// <summary>
+    /// Tell our token source and error strategy about a new way to create tokens. </summary>
+    template<typename T1>
+    void setTokenFactory(TokenFactory<T1> *factory)  {
+      _input->getTokenSource()->setTokenFactory(factory);
+    }
+
+    /// The ATN with bypass alternatives is expensive to create so we create it
+    /// lazily. The ATN is owned by us.
+    virtual const atn::ATN& getATNWithBypassAlts();
+
+    /// <summary>
+    /// The preferred method of getting a tree pattern. For example, here's a
+    /// sample use:
+    ///
+    /// <pre>
+    /// ParseTree t = parser.expr();
+    /// ParseTreePattern p = parser.compileParseTreePattern("<ID>+0", MyParser.RULE_expr);
+    /// ParseTreeMatch m = p.match(t);
+    /// String id = m.get("ID");
+    /// </pre>
+    /// </summary>
+    virtual tree::pattern::ParseTreePattern compileParseTreePattern(const std::string &pattern, int patternRuleIndex);
+
+    /// <summary>
+    /// The same as <seealso cref="#compileParseTreePattern(String, int)"/> but specify a
+    /// <seealso cref="Lexer"/> rather than trying to deduce it from this parser.
+    /// </summary>
+    virtual tree::pattern::ParseTreePattern compileParseTreePattern(const std::string &pattern, int patternRuleIndex,
+                                                                    Lexer *lexer);
+
+    virtual Ref<ANTLRErrorStrategy> getErrorHandler();
+    virtual void setErrorHandler(Ref<ANTLRErrorStrategy> const& handler);
+
+    virtual IntStream* getInputStream() override;
+    void setInputStream(IntStream *input) override;
+
+    virtual TokenStream* getTokenStream();
+
+    /// Set the token stream and reset the parser.
+    virtual void setTokenStream(TokenStream *input);
+
+    /// <summary>
+    /// Match needs to return the current input symbol, which gets put
+    ///  into the label for the associated token ref; e.g., x=ID.
+    /// </summary>
+    virtual Token* getCurrentToken();
+
+    void notifyErrorListeners(const std::string &msg);
+
+    virtual void notifyErrorListeners(Token *offendingToken, const std::string &msg, std::exception_ptr e);
+
+    /// Consume and return the <seealso cref="#getCurrentToken current symbol"/>.
+    /// <p/>
+    /// E.g., given the following input with {@code A} being the current
+    /// lookahead symbol, this function moves the cursor to {@code B} and returns
+    /// {@code A}.
+    ///
+    /// <pre>
+    ///  A B
+    ///  ^
+    /// </pre>
+    ///
+    /// If the parser is not in error recovery mode, the consumed symbol is added
+    /// to the parse tree using <seealso cref="ParserRuleContext#addChild(TerminalNode)"/>, and
+    /// <seealso cref="ParseTreeListener#visitTerminal"/> is called on any parse listeners.
+    /// If the parser <em>is</em> in error recovery mode, the consumed symbol is
+    /// added to the parse tree using {@link #createErrorNode(ParserRuleContext, Token)} then
+    /// {@link ParserRuleContext#addErrorNode(ErrorNode)} and
+    /// <seealso cref="ParseTreeListener#visitErrorNode"/> is called on any parse
+    /// listeners.
+    virtual Token* consume();
+
+    /// Always called by generated parsers upon entry to a rule. Access field
+    /// <seealso cref="#_ctx"/> get the current context.
+    virtual void enterRule(ParserRuleContext *localctx, size_t state, size_t ruleIndex);
+
+    void exitRule();
+
+    virtual void enterOuterAlt(ParserRuleContext *localctx, size_t altNum);
+
+    /**
+     * Get the precedence level for the top-most precedence rule.
+     *
+     * @return The precedence level for the top-most precedence rule, or -1 if
+     * the parser context is not nested within a precedence rule.
+     */
+    int getPrecedence() const;
+
+    /// @deprecated Use
+    /// <seealso cref="#enterRecursionRule(ParserRuleContext, int, int, int)"/> instead.
+    virtual void enterRecursionRule(ParserRuleContext *localctx, size_t ruleIndex);
+    virtual void enterRecursionRule(ParserRuleContext *localctx, size_t state, size_t ruleIndex, int precedence);
+
+    /** Like {@link #enterRule} but for recursive rules.
+     *  Make the current context the child of the incoming localctx.
+     */
+    virtual void pushNewRecursionContext(ParserRuleContext *localctx, size_t state, size_t ruleIndex);
+    virtual void unrollRecursionContexts(ParserRuleContext *parentctx);
+    virtual ParserRuleContext* getInvokingContext(size_t ruleIndex);
+    virtual ParserRuleContext* getContext();
+    virtual void setContext(ParserRuleContext *ctx);
+    virtual bool precpred(RuleContext *localctx, int precedence) override;
+    virtual bool inContext(const std::string &context);
+
+    /// <summary>
+    /// Checks whether or not {@code symbol} can follow the current state in the
+    /// ATN. The behavior of this method is equivalent to the following, but is
+    /// implemented such that the complete context-sensitive follow set does not
+    /// need to be explicitly constructed.
+    ///
+    /// <pre>
+    /// return getExpectedTokens().contains(symbol);
+    /// </pre>
+    /// </summary>
+    /// <param name="symbol"> the symbol type to check </param>
+    /// <returns> {@code true} if {@code symbol} can follow the current state in
+    /// the ATN, otherwise {@code false}. </returns>
+    virtual bool isExpectedToken(size_t symbol);
+
+    bool isMatchedEOF() const;
+
+    /// <summary>
+    /// Computes the set of input symbols which could follow the current parser
+    /// state and context, as given by <seealso cref="#getState"/> and <seealso cref="#getContext"/>,
+    /// respectively.
+    /// </summary>
+    /// <seealso cref= ATN#getExpectedTokens(int, RuleContext) </seealso>
+    virtual misc::IntervalSet getExpectedTokens();
+
+    virtual misc::IntervalSet getExpectedTokensWithinCurrentRule();
+
+    /// Get a rule's index (i.e., {@code RULE_ruleName} field) or INVALID_INDEX if not found.
+    virtual size_t getRuleIndex(const std::string &ruleName);
+
+    virtual ParserRuleContext* getRuleContext();
+
+    /// <summary>
+    /// Return List&lt;String&gt; of the rule names in your parser instance
+    ///  leading up to a call to the current rule.  You could override if
+    ///  you want more details such as the file/line info of where
+    ///  in the ATN a rule is invoked.
+    ///
+    ///  This is very useful for error messages.
+    /// </summary>
+    virtual std::vector<std::string> getRuleInvocationStack();
+
+    virtual std::vector<std::string> getRuleInvocationStack(RuleContext *p);
+
+    /// <summary>
+    /// For debugging and other purposes. </summary>
+    virtual std::vector<std::string> getDFAStrings();
+
+    /// <summary>
+    /// For debugging and other purposes. </summary>
+    virtual void dumpDFA();
+
+    virtual std::string getSourceName();
+
+    atn::ParseInfo getParseInfo() const;
+
+    /**
+     * @since 4.3
+     */
+    void setProfile(bool profile);
+
+    /// <summary>
+    /// During a parse is sometimes useful to listen in on the rule entry and exit
+    ///  events as well as token matches. This is for quick and dirty debugging.
+    /// </summary>
+    virtual void setTrace(bool trace);
+
+    /**
+     * Gets whether a {@link TraceListener} is registered as a parse listener
+     * for the parser.
+     *
+     * @see #setTrace(boolean)
+     */
+    bool isTrace() const;
+
+    tree::ParseTreeTracker& getTreeTracker() { return _tracker; }
+
+    /** How to create a token leaf node associated with a parent.
+     *  Typically, the terminal node to create is not a function of the parent
+     *  but this method must still set the parent pointer of the terminal node
+     *  returned. I would prefer having {@link ParserRuleContext#addAnyChild(ParseTree)}
+     *  set the parent pointer, but the parent pointer is implementation dependent
+     *  and currently there is no setParent() in {@link TerminalNode} (and can't
+     *  add method in Java 1.7 without breaking backward compatibility).
+     *
+     * @since 4.7
+     */
+    tree::TerminalNode *createTerminalNode(Token *t);
+
+    /** How to create an error node, given a token, associated with a parent.
+       *  Typically, the error node to create is not a function of the parent
+       *  but this method must still set the parent pointer of the terminal node
+       *  returned. I would prefer having {@link ParserRuleContext#addAnyChild(ParseTree)}
+       *  set the parent pointer, but the parent pointer is implementation dependent
+       *  and currently there is no setParent() in {@link ErrorNode} (and can't
+       *  add method in Java 1.7 without breaking backward compatibility).
+       *
+       * @since 4.7
+       */
+    tree::ErrorNode *createErrorNode(Token *t);
+
+  protected:
+    /// The ParserRuleContext object for the currently executing rule.
+    /// This is always non-null during the parsing process.
+    // ml: this is one of the contexts tracked in _allocatedContexts.
+    ParserRuleContext *_ctx;
+
+    /// The error handling strategy for the parser. The default is DefaultErrorStrategy.
+    /// See also getErrorHandler.
+    Ref<ANTLRErrorStrategy> _errHandler;
+
+    /// <summary>
+    /// The input stream.
+    /// </summary>
+    /// <seealso cref= #getInputStream </seealso>
+    /// <seealso cref= #setInputStream </seealso>
+    TokenStream *_input;
+
+    std::vector<int> _precedenceStack;
+
+    /// <summary>
+    /// Specifies whether or not the parser should construct a parse tree during
+    /// the parsing process. The default value is {@code true}.
+    /// </summary>
+    /// <seealso cref= #getBuildParseTree </seealso>
+    /// <seealso cref= #setBuildParseTree </seealso>
+    bool _buildParseTrees;
+
+    /// The list of <seealso cref="ParseTreeListener"/> listeners registered to receive
+    /// events during the parse.
+    /// <seealso cref= #addParseListener </seealso>
+    std::vector<tree::ParseTreeListener *> _parseListeners;
+
+    /// <summary>
+    /// The number of syntax errors reported during parsing. This value is
+    /// incremented each time <seealso cref="#notifyErrorListeners"/> is called.
+    /// </summary>
+    size_t _syntaxErrors;
+
+    /** Indicates parser has match()ed EOF token. See {@link #exitRule()}. */
+    bool _matchedEOF;
+
+    virtual void addContextToParseTree();
+
+    // All rule contexts created during a parse run. This is cleared when calling reset().
+    tree::ParseTreeTracker _tracker;
+
+  private:
+    /// When setTrace(true) is called, a reference to the
+    /// TraceListener is stored here so it can be easily removed in a
+    /// later call to setTrace(false). The listener itself is
+    /// implemented as a parser listener so this field is not directly used by
+    /// other parser methods.
+    TraceListener *_tracer;
+
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserInterpreter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserInterpreter.cpp
new file mode 100755
index 0000000000..e3be2d2c61
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserInterpreter.cpp
@@ -0,0 +1,294 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "dfa/DFA.h"
+#include "atn/RuleStartState.h"
+#include "InterpreterRuleContext.h"
+#include "atn/ParserATNSimulator.h"
+#include "ANTLRErrorStrategy.h"
+#include "atn/LoopEndState.h"
+#include "FailedPredicateException.h"
+#include "atn/StarLoopEntryState.h"
+#include "atn/AtomTransition.h"
+#include "atn/RuleTransition.h"
+#include "atn/PredicateTransition.h"
+#include "atn/PrecedencePredicateTransition.h"
+#include "atn/ActionTransition.h"
+#include "atn/ATN.h"
+#include "atn/RuleStopState.h"
+#include "Lexer.h"
+#include "Token.h"
+#include "Vocabulary.h"
+#include "InputMismatchException.h"
+#include "CommonToken.h"
+#include "tree/ErrorNode.h"
+
+#include "support/CPPUtils.h"
+#include "support/Casts.h"
+
+#include "ParserInterpreter.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+
+using namespace antlrcpp;
+
+ParserInterpreter::ParserInterpreter(const std::string &grammarFileName, const dfa::Vocabulary &vocabulary,
+  const std::vector<std::string> &ruleNames, const atn::ATN &atn, TokenStream *input)
+  : Parser(input), _grammarFileName(grammarFileName), _atn(atn), _ruleNames(ruleNames), _vocabulary(vocabulary) {
+
+  // init decision DFA
+  for (size_t i = 0; i < atn.getNumberOfDecisions(); ++i) {
+    atn::DecisionState *decisionState = atn.getDecisionState(i);
+    _decisionToDFA.push_back(dfa::DFA(decisionState, i));
+  }
+
+  // get atn simulator that knows how to do predictions
+  _interpreter = new atn::ParserATNSimulator(this, atn, _decisionToDFA, _sharedContextCache); /* mem-check: deleted in d-tor */
+}
+
+ParserInterpreter::~ParserInterpreter() {
+  delete _interpreter;
+}
+
+void ParserInterpreter::reset() {
+  Parser::reset();
+  _overrideDecisionReached = false;
+  _overrideDecisionRoot = nullptr;
+}
+
+const atn::ATN& ParserInterpreter::getATN() const {
+  return _atn;
+}
+
+const dfa::Vocabulary& ParserInterpreter::getVocabulary() const {
+  return _vocabulary;
+}
+
+const std::vector<std::string>& ParserInterpreter::getRuleNames() const {
+  return _ruleNames;
+}
+
+std::string ParserInterpreter::getGrammarFileName() const {
+  return _grammarFileName;
+}
+
+ParserRuleContext* ParserInterpreter::parse(size_t startRuleIndex) {
+  atn::RuleStartState *startRuleStartState = _atn.ruleToStartState[startRuleIndex];
+
+  _rootContext = createInterpreterRuleContext(nullptr, atn::ATNState::INVALID_STATE_NUMBER, startRuleIndex);
+
+  if (startRuleStartState->isLeftRecursiveRule) {
+    enterRecursionRule(_rootContext, startRuleStartState->stateNumber, startRuleIndex, 0);
+  } else {
+    enterRule(_rootContext, startRuleStartState->stateNumber, startRuleIndex);
+  }
+
+  while (true) {
+    atn::ATNState *p = getATNState();
+    switch (p->getStateType()) {
+      case atn::ATNStateType::RULE_STOP :
+        // pop; return from rule
+        if (_ctx->isEmpty()) {
+          if (startRuleStartState->isLeftRecursiveRule) {
+            ParserRuleContext *result = _ctx;
+            auto parentContext = _parentContextStack.top();
+            _parentContextStack.pop();
+            unrollRecursionContexts(parentContext.first);
+            return result;
+          } else {
+            exitRule();
+            return _rootContext;
+          }
+        }
+
+        visitRuleStopState(p);
+        break;
+
+      default :
+        try {
+          visitState(p);
+        }
+        catch (RecognitionException &e) {
+          setState(_atn.ruleToStopState[p->ruleIndex]->stateNumber);
+          getErrorHandler()->reportError(this, e);
+          getContext()->exception = std::current_exception();
+          recover(e);
+        }
+
+        break;
+    }
+  }
+}
+
+void ParserInterpreter::enterRecursionRule(ParserRuleContext *localctx, size_t state, size_t ruleIndex, int precedence) {
+  _parentContextStack.push({ _ctx, localctx->invokingState });
+  Parser::enterRecursionRule(localctx, state, ruleIndex, precedence);
+}
+
+void ParserInterpreter::addDecisionOverride(int decision, int tokenIndex, int forcedAlt) {
+  _overrideDecision = decision;
+  _overrideDecisionInputIndex = tokenIndex;
+  _overrideDecisionAlt = forcedAlt;
+}
+
+Ref<InterpreterRuleContext> ParserInterpreter::getOverrideDecisionRoot() const {
+  return _overrideDecisionRoot;
+}
+
+InterpreterRuleContext* ParserInterpreter::getRootContext() {
+  return _rootContext;
+}
+
+atn::ATNState* ParserInterpreter::getATNState() {
+  return _atn.states[getState()];
+}
+
+void ParserInterpreter::visitState(atn::ATNState *p) {
+  size_t predictedAlt = 1;
+  if (DecisionState::is(p)) {
+    predictedAlt = visitDecisionState(downCast<DecisionState*>(p));
+  }
+
+  const atn::Transition *transition = p->transitions[predictedAlt - 1].get();
+  switch (transition->getTransitionType()) {
+    case atn::TransitionType::EPSILON:
+      if (p->getStateType() == ATNStateType::STAR_LOOP_ENTRY &&
+        (downCast<StarLoopEntryState *>(p))->isPrecedenceDecision &&
+        !LoopEndState::is(transition->target)) {
+        // We are at the start of a left recursive rule's (...)* loop
+        // and we're not taking the exit branch of loop.
+        InterpreterRuleContext *localctx = createInterpreterRuleContext(_parentContextStack.top().first,
+          _parentContextStack.top().second, static_cast<int>(_ctx->getRuleIndex()));
+        pushNewRecursionContext(localctx, _atn.ruleToStartState[p->ruleIndex]->stateNumber, static_cast<int>(_ctx->getRuleIndex()));
+      }
+      break;
+
+    case atn::TransitionType::ATOM:
+      match(static_cast<int>(static_cast<const atn::AtomTransition*>(transition)->_label));
+      break;
+
+    case atn::TransitionType::RANGE:
+    case atn::TransitionType::SET:
+    case atn::TransitionType::NOT_SET:
+      if (!transition->matches(static_cast<int>(_input->LA(1)), Token::MIN_USER_TOKEN_TYPE, Lexer::MAX_CHAR_VALUE)) {
+        recoverInline();
+      }
+      matchWildcard();
+      break;
+
+    case atn::TransitionType::WILDCARD:
+      matchWildcard();
+      break;
+
+    case atn::TransitionType::RULE:
+    {
+      atn::RuleStartState *ruleStartState = static_cast<atn::RuleStartState*>(transition->target);
+      size_t ruleIndex = ruleStartState->ruleIndex;
+      InterpreterRuleContext *newctx = createInterpreterRuleContext(_ctx, p->stateNumber, ruleIndex);
+      if (ruleStartState->isLeftRecursiveRule) {
+        enterRecursionRule(newctx, ruleStartState->stateNumber, ruleIndex, static_cast<const atn::RuleTransition*>(transition)->precedence);
+      } else {
+        enterRule(newctx, transition->target->stateNumber, ruleIndex);
+      }
+    }
+      break;
+
+    case atn::TransitionType::PREDICATE:
+    {
+      const atn::PredicateTransition *predicateTransition = static_cast<const atn::PredicateTransition*>(transition);
+      if (!sempred(_ctx, predicateTransition->getRuleIndex(), predicateTransition->getPredIndex())) {
+        throw FailedPredicateException(this);
+      }
+    }
+      break;
+
+    case atn::TransitionType::ACTION:
+    {
+      const atn::ActionTransition *actionTransition = static_cast<const atn::ActionTransition*>(transition);
+      action(_ctx, actionTransition->ruleIndex, actionTransition->actionIndex);
+    }
+      break;
+
+    case atn::TransitionType::PRECEDENCE:
+    {
+      if (!precpred(_ctx, static_cast<const atn::PrecedencePredicateTransition*>(transition)->getPrecedence())) {
+        throw FailedPredicateException(this, "precpred(_ctx, " + std::to_string(static_cast<const atn::PrecedencePredicateTransition*>(transition)->getPrecedence()) +  ")");
+      }
+    }
+      break;
+
+    default:
+      throw UnsupportedOperationException("Unrecognized ATN transition type.");
+  }
+
+  setState(transition->target->stateNumber);
+}
+
+size_t ParserInterpreter::visitDecisionState(DecisionState *p) {
+  size_t predictedAlt = 1;
+  if (p->transitions.size() > 1) {
+    getErrorHandler()->sync(this);
+    int decision = p->decision;
+    if (decision == _overrideDecision && _input->index() == _overrideDecisionInputIndex && !_overrideDecisionReached) {
+      predictedAlt = _overrideDecisionAlt;
+      _overrideDecisionReached = true;
+    } else {
+      predictedAlt = getInterpreter<ParserATNSimulator>()->adaptivePredict(_input, decision, _ctx);
+    }
+  }
+  return predictedAlt;
+}
+
+InterpreterRuleContext* ParserInterpreter::createInterpreterRuleContext(ParserRuleContext *parent,
+  size_t invokingStateNumber, size_t ruleIndex) {
+  return _tracker.createInstance<InterpreterRuleContext>(parent, invokingStateNumber, ruleIndex);
+}
+
+void ParserInterpreter::visitRuleStopState(atn::ATNState *p) {
+  atn::RuleStartState *ruleStartState = _atn.ruleToStartState[p->ruleIndex];
+  if (ruleStartState->isLeftRecursiveRule) {
+    std::pair<ParserRuleContext *, size_t> parentContext = _parentContextStack.top();
+    _parentContextStack.pop();
+
+    unrollRecursionContexts(parentContext.first);
+    setState(parentContext.second);
+  } else {
+    exitRule();
+  }
+
+  const atn::RuleTransition *ruleTransition = static_cast<const atn::RuleTransition*>(_atn.states[getState()]->transitions[0].get());
+  setState(ruleTransition->followState->stateNumber);
+}
+
+void ParserInterpreter::recover(RecognitionException &e) {
+  size_t i = _input->index();
+  getErrorHandler()->recover(this, std::make_exception_ptr(e));
+
+  if (_input->index() == i) {
+    // no input consumed, better add an error node
+    if (is<InputMismatchException *>(&e)) {
+      InputMismatchException &ime = static_cast<InputMismatchException&>(e);
+      Token *tok = e.getOffendingToken();
+      size_t expectedTokenType = ime.getExpectedTokens().getMinElement(); // get any element
+      _errorToken = getTokenFactory()->create({ tok->getTokenSource(), tok->getTokenSource()->getInputStream() },
+        expectedTokenType, tok->getText(), Token::DEFAULT_CHANNEL, INVALID_INDEX, INVALID_INDEX, // invalid start/stop
+        tok->getLine(), tok->getCharPositionInLine());
+      _ctx->addChild(createErrorNode(_errorToken.get()));
+    }
+    else { // NoViableAlt
+      Token *tok = e.getOffendingToken();
+      _errorToken = getTokenFactory()->create({ tok->getTokenSource(), tok->getTokenSource()->getInputStream() },
+        Token::INVALID_TYPE, tok->getText(), Token::DEFAULT_CHANNEL, INVALID_INDEX, INVALID_INDEX, // invalid start/stop
+        tok->getLine(), tok->getCharPositionInLine());
+      _ctx->addChild(createErrorNode(_errorToken.get()));
+    }
+  }
+}
+
+Token* ParserInterpreter::recoverInline() {
+  return _errHandler->recoverInline(this);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserInterpreter.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserInterpreter.h
new file mode 100755
index 0000000000..a040d7caf4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserInterpreter.h
@@ -0,0 +1,173 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Parser.h"
+#include "atn/ATN.h"
+#include "support/BitSet.h"
+#include "atn/PredictionContext.h"
+#include "atn/PredictionContextCache.h"
+#include "Vocabulary.h"
+
+namespace antlr4 {
+
+  /// <summary>
+  /// A parser simulator that mimics what ANTLR's generated
+  ///  parser code does. A ParserATNSimulator is used to make
+  ///  predictions via adaptivePredict but this class moves a pointer through the
+  ///  ATN to simulate parsing. ParserATNSimulator just
+  ///  makes us efficient rather than having to backtrack, for example.
+  ///
+  ///  This properly creates parse trees even for left recursive rules.
+  ///
+  ///  We rely on the left recursive rule invocation and special predicate
+  ///  transitions to make left recursive rules work.
+  ///
+  ///  See TestParserInterpreter for examples.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC ParserInterpreter : public Parser {
+  public:
+    ParserInterpreter(const std::string &grammarFileName, const dfa::Vocabulary &vocabulary,
+                      const std::vector<std::string> &ruleNames, const atn::ATN &atn, TokenStream *input);
+    ~ParserInterpreter();
+
+    virtual void reset() override;
+
+    virtual const atn::ATN& getATN() const override;
+
+    virtual const dfa::Vocabulary& getVocabulary() const override;
+
+    virtual const std::vector<std::string>& getRuleNames() const override;
+    virtual std::string getGrammarFileName() const override;
+
+    /// Begin parsing at startRuleIndex
+    virtual ParserRuleContext* parse(size_t startRuleIndex);
+
+    virtual void enterRecursionRule(ParserRuleContext *localctx, size_t state, size_t ruleIndex, int precedence) override;
+
+
+    /** Override this parser interpreters normal decision-making process
+     *  at a particular decision and input token index. Instead of
+     *  allowing the adaptive prediction mechanism to choose the
+     *  first alternative within a block that leads to a successful parse,
+     *  force it to take the alternative, 1..n for n alternatives.
+     *
+     *  As an implementation limitation right now, you can only specify one
+     *  override. This is sufficient to allow construction of different
+     *  parse trees for ambiguous input. It means re-parsing the entire input
+     *  in general because you're never sure where an ambiguous sequence would
+     *  live in the various parse trees. For example, in one interpretation,
+     *  an ambiguous input sequence would be matched completely in expression
+     *  but in another it could match all the way back to the root.
+     *
+     *  s : e '!'? ;
+     *  e : ID
+     *    | ID '!'
+     *    ;
+     *
+     *  Here, x! can be matched as (s (e ID) !) or (s (e ID !)). In the first
+     *  case, the ambiguous sequence is fully contained only by the root.
+     *  In the second case, the ambiguous sequences fully contained within just
+     *  e, as in: (e ID !).
+     *
+     *  Rather than trying to optimize this and make
+     *  some intelligent decisions for optimization purposes, I settled on
+     *  just re-parsing the whole input and then using
+     *  {link Trees#getRootOfSubtreeEnclosingRegion} to find the minimal
+     *  subtree that contains the ambiguous sequence. I originally tried to
+     *  record the call stack at the point the parser detected and ambiguity but
+     *  left recursive rules create a parse tree stack that does not reflect
+     *  the actual call stack. That impedance mismatch was enough to make
+     *  it it challenging to restart the parser at a deeply nested rule
+     *  invocation.
+     *
+     *  Only parser interpreters can override decisions so as to avoid inserting
+     *  override checking code in the critical ALL(*) prediction execution path.
+     *
+     *  @since 4.5.1
+     */
+    void addDecisionOverride(int decision, int tokenIndex, int forcedAlt);
+
+    Ref<InterpreterRuleContext> getOverrideDecisionRoot() const;
+
+    /** Return the root of the parse, which can be useful if the parser
+     *  bails out. You still can access the top node. Note that,
+     *  because of the way left recursive rules add children, it's possible
+     *  that the root will not have any children if the start rule immediately
+     *  called and left recursive rule that fails.
+     *
+     * @since 4.5.1
+     */
+    InterpreterRuleContext* getRootContext();
+
+  protected:
+    const std::string _grammarFileName;
+    const atn::ATN &_atn;
+
+    std::vector<std::string> _ruleNames;
+
+    std::vector<dfa::DFA> _decisionToDFA; // not shared like it is for generated parsers
+    atn::PredictionContextCache _sharedContextCache;
+
+    /** This stack corresponds to the _parentctx, _parentState pair of locals
+     *  that would exist on call stack frames with a recursive descent parser;
+     *  in the generated function for a left-recursive rule you'd see:
+     *
+     *  private EContext e(int _p) throws RecognitionException {
+     *      ParserRuleContext _parentctx = _ctx;    // Pair.a
+     *      int _parentState = getState();          // Pair.b
+     *      ...
+     *  }
+     *
+     *  Those values are used to create new recursive rule invocation contexts
+     *  associated with left operand of an alt like "expr '*' expr".
+     */
+    std::stack<std::pair<ParserRuleContext *, size_t>> _parentContextStack;
+
+    /** We need a map from (decision,inputIndex)->forced alt for computing ambiguous
+     *  parse trees. For now, we allow exactly one override.
+     */
+    int _overrideDecision = -1;
+    size_t _overrideDecisionInputIndex = INVALID_INDEX;
+    size_t _overrideDecisionAlt = INVALID_INDEX;
+    bool _overrideDecisionReached = false; // latch and only override once; error might trigger infinite loop
+
+    /** What is the current context when we override a decision? This tells
+     *  us what the root of the parse tree is when using override
+     *  for an ambiguity/lookahead check.
+     */
+    Ref<InterpreterRuleContext> _overrideDecisionRoot;
+    InterpreterRuleContext* _rootContext;
+
+    virtual atn::ATNState *getATNState();
+    virtual void visitState(atn::ATNState *p);
+
+    /** Method visitDecisionState() is called when the interpreter reaches
+     *  a decision state (instance of DecisionState). It gives an opportunity
+     *  for subclasses to track interesting things.
+     */
+    size_t visitDecisionState(atn::DecisionState *p);
+
+    /** Provide simple "factory" for InterpreterRuleContext's.
+     *  @since 4.5.1
+     */
+    InterpreterRuleContext* createInterpreterRuleContext(ParserRuleContext *parent, size_t invokingStateNumber, size_t ruleIndex);
+
+    virtual void visitRuleStopState(atn::ATNState *p);
+
+    /** Rely on the error handler for this parser but, if no tokens are consumed
+     *  to recover, add an error node. Otherwise, nothing is seen in the parse
+     *  tree.
+     */
+    void recover(RecognitionException &e);
+    Token* recoverInline();
+
+  private:
+    const dfa::Vocabulary &_vocabulary;
+    std::unique_ptr<Token> _errorToken;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserRuleContext.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserRuleContext.cpp
new file mode 100755
index 0000000000..2cf143c324
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserRuleContext.cpp
@@ -0,0 +1,138 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/TerminalNode.h"
+#include "tree/ErrorNode.h"
+#include "misc/Interval.h"
+#include "Parser.h"
+#include "Token.h"
+
+#include "support/Casts.h"
+#include "support/CPPUtils.h"
+
+#include "ParserRuleContext.h"
+
+using namespace antlr4;
+using namespace antlr4::tree;
+
+using namespace antlrcpp;
+
+ParserRuleContext ParserRuleContext::EMPTY;
+
+ParserRuleContext::ParserRuleContext()
+  : start(nullptr), stop(nullptr) {
+}
+
+ParserRuleContext::ParserRuleContext(ParserRuleContext *parent, size_t invokingStateNumber)
+: RuleContext(parent, invokingStateNumber), start(nullptr), stop(nullptr) {
+}
+
+void ParserRuleContext::copyFrom(ParserRuleContext *ctx) {
+  // from RuleContext
+  this->parent = ctx->parent;
+  this->invokingState = ctx->invokingState;
+
+  this->start = ctx->start;
+  this->stop = ctx->stop;
+
+  // copy any error nodes to alt label node
+  if (!ctx->children.empty()) {
+    for (auto *child : ctx->children) {
+      if (ErrorNode::is(child)) {
+        downCast<ErrorNode*>(child)->setParent(this);
+        children.push_back(child);
+      }
+    }
+
+    // Remove the just reparented error nodes from the source context.
+    ctx->children.erase(std::remove_if(ctx->children.begin(), ctx->children.end(), [this](tree::ParseTree *e) -> bool {
+      return std::find(children.begin(), children.end(), e) != children.end();
+    }), ctx->children.end());
+  }
+}
+
+void ParserRuleContext::enterRule(tree::ParseTreeListener * /*listener*/) {
+}
+
+void ParserRuleContext::exitRule(tree::ParseTreeListener * /*listener*/) {
+}
+
+tree::TerminalNode* ParserRuleContext::addChild(tree::TerminalNode *t) {
+  t->setParent(this);
+  children.push_back(t);
+  return t;
+}
+
+RuleContext* ParserRuleContext::addChild(RuleContext *ruleInvocation) {
+  children.push_back(ruleInvocation);
+  return ruleInvocation;
+}
+
+void ParserRuleContext::removeLastChild() {
+  if (!children.empty()) {
+    children.pop_back();
+  }
+}
+
+tree::TerminalNode* ParserRuleContext::getToken(size_t ttype, size_t i) const {
+  if (i >= children.size()) {
+    return nullptr;
+  }
+  size_t j = 0; // what token with ttype have we found?
+  for (auto *child : children) {
+    if (TerminalNode::is(child)) {
+      tree::TerminalNode *typedChild = downCast<tree::TerminalNode*>(child);
+      Token *symbol = typedChild->getSymbol();
+      if (symbol->getType() == ttype) {
+        if (j++ == i) {
+          return typedChild;
+        }
+      }
+    }
+  }
+  return nullptr;
+}
+
+std::vector<tree::TerminalNode *> ParserRuleContext::getTokens(size_t ttype) const {
+  std::vector<tree::TerminalNode*> tokens;
+  for (auto *child : children) {
+    if (TerminalNode::is(child)) {
+      tree::TerminalNode *typedChild = downCast<tree::TerminalNode*>(child);
+      Token *symbol = typedChild->getSymbol();
+      if (symbol->getType() == ttype) {
+        tokens.push_back(typedChild);
+      }
+    }
+  }
+  return tokens;
+}
+
+misc::Interval ParserRuleContext::getSourceInterval() {
+  if (start == nullptr) {
+    return misc::Interval::INVALID;
+  }
+
+  if (stop == nullptr || stop->getTokenIndex() < start->getTokenIndex()) {
+    return misc::Interval(start->getTokenIndex(), start->getTokenIndex() - 1); // empty
+  }
+  return misc::Interval(start->getTokenIndex(), stop->getTokenIndex());
+}
+
+Token* ParserRuleContext::getStart() const {
+  return start;
+}
+
+Token* ParserRuleContext::getStop() const {
+  return stop;
+}
+
+std::string ParserRuleContext::toInfoString(Parser *recognizer) {
+  std::vector<std::string> rules = recognizer->getRuleInvocationStack(this);
+  std::reverse(rules.begin(), rules.end());
+  std::string rulesStr = antlrcpp::arrayToString(rules);
+  return "ParserRuleContext" + rulesStr + "{start=" + std::to_string(start->getTokenIndex()) + ", stop=" +
+    std::to_string(stop->getTokenIndex()) + '}';
+}
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserRuleContext.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserRuleContext.h
new file mode 100755
index 0000000000..43528a2e91
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ParserRuleContext.h
@@ -0,0 +1,147 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "RuleContext.h"
+#include "support/CPPUtils.h"
+
+namespace antlr4 {
+
+  /// <summary>
+  /// A rule invocation record for parsing.
+  ///
+  ///  Contains all of the information about the current rule not stored in the
+  ///  RuleContext. It handles parse tree children list, Any ATN state
+  ///  tracing, and the default values available for rule invocatons:
+  ///  start, stop, rule index, current alt number.
+  ///
+  ///  Subclasses made for each rule and grammar track the parameters,
+  ///  return values, locals, and labels specific to that rule. These
+  ///  are the objects that are returned from rules.
+  ///
+  ///  Note text is not an actual field of a rule return value; it is computed
+  ///  from start and stop using the input stream's toString() method.  I
+  ///  could add a ctor to this so that we can pass in and store the input
+  ///  stream, but I'm not sure we want to do that.  It would seem to be undefined
+  ///  to get the .text property anyway if the rule matches tokens from multiple
+  ///  input streams.
+  ///
+  ///  I do not use getters for fields of objects that are used simply to
+  ///  group values such as this aggregate.  The getters/setters are there to
+  ///  satisfy the superclass interface.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC ParserRuleContext : public RuleContext {
+  public:
+    static ParserRuleContext EMPTY;
+
+    /// <summary>
+    /// For debugging/tracing purposes, we want to track all of the nodes in
+    ///  the ATN traversed by the parser for a particular rule.
+    ///  This list indicates the sequence of ATN nodes used to match
+    ///  the elements of the children list. This list does not include
+    ///  ATN nodes and other rules used to match rule invocations. It
+    ///  traces the rule invocation node itself but nothing inside that
+    ///  other rule's ATN submachine.
+    ///
+    ///  There is NOT a one-to-one correspondence between the children and
+    ///  states list. There are typically many nodes in the ATN traversed
+    ///  for each element in the children list. For example, for a rule
+    ///  invocation there is the invoking state and the following state.
+    ///
+    ///  The parser setState() method updates field s and adds it to this list
+    ///  if we are debugging/tracing.
+    ///
+    ///  This does not trace states visited during prediction.
+    /// </summary>
+    //	public List<Integer> states;
+
+    Token *start;
+    Token *stop;
+
+    /// The exception that forced this rule to return. If the rule successfully
+    /// completed, this is "null exception pointer".
+    std::exception_ptr exception;
+
+    ParserRuleContext();
+    ParserRuleContext(ParserRuleContext *parent, size_t invokingStateNumber);
+
+    /** COPY a ctx (I'm deliberately not using copy constructor) to avoid
+     *  confusion with creating node with parent. Does not copy children
+     *  (except error leaves).
+     */
+    virtual void copyFrom(ParserRuleContext *ctx);
+
+
+    // Double dispatch methods for listeners
+
+    virtual void enterRule(tree::ParseTreeListener *listener);
+    virtual void exitRule(tree::ParseTreeListener *listener);
+
+    /** Add a token leaf node child and force its parent to be this node. */
+    tree::TerminalNode* addChild(tree::TerminalNode *t);
+    RuleContext* addChild(RuleContext *ruleInvocation);
+
+    /// Used by enterOuterAlt to toss out a RuleContext previously added as
+    /// we entered a rule. If we have # label, we will need to remove
+    /// generic ruleContext object.
+    void removeLastChild();
+
+    tree::TerminalNode* getToken(size_t ttype, std::size_t i) const;
+
+    std::vector<tree::TerminalNode*> getTokens(size_t ttype) const;
+
+    template<typename T>
+    T* getRuleContext(size_t i) const {
+      static_assert(std::is_base_of_v<RuleContext, T>, "T must be derived from RuleContext");
+      size_t j = 0; // what element have we found with ctxType?
+      for (auto *child : children) {
+        if (RuleContext::is(child)) {
+          if (auto *typedChild = dynamic_cast<T*>(child); typedChild != nullptr) {
+            if (j++ == i) {
+              return typedChild;
+            }
+          }
+        }
+      }
+      return nullptr;
+    }
+
+    template<typename T>
+    std::vector<T*> getRuleContexts() const {
+      static_assert(std::is_base_of_v<RuleContext, T>, "T must be derived from RuleContext");
+      std::vector<T*> contexts;
+      for (auto *child : children) {
+        if (RuleContext::is(child)) {
+          if (auto *typedChild = dynamic_cast<T*>(child); typedChild != nullptr) {
+            contexts.push_back(typedChild);
+          }
+        }
+      }
+      return contexts;
+    }
+
+    virtual misc::Interval getSourceInterval() override;
+
+    /**
+     * Get the initial token in this context.
+     * Note that the range from start to stop is inclusive, so for rules that do not consume anything
+     * (for example, zero length or error productions) this token may exceed stop.
+     */
+    Token* getStart() const;
+
+    /**
+     * Get the final token in this context.
+     * Note that the range from start to stop is inclusive, so for rules that do not consume anything
+     * (for example, zero length or error productions) this token may precede start.
+     */
+    Token* getStop() const;
+
+    /// <summary>
+    /// Used for rule context info debugging during parse-time, not so much for ATN debugging </summary>
+    virtual std::string toInfoString(Parser *recognizer);
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ProxyErrorListener.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ProxyErrorListener.cpp
new file mode 100755
index 0000000000..0b031327bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ProxyErrorListener.cpp
@@ -0,0 +1,53 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "ProxyErrorListener.h"
+
+using namespace antlr4;
+
+void ProxyErrorListener::addErrorListener(ANTLRErrorListener *listener) {
+  if (listener == nullptr) {
+    throw "listener cannot be null.";
+  }
+
+  _delegates.insert(listener);
+}
+
+void ProxyErrorListener::removeErrorListener(ANTLRErrorListener *listener) {
+  _delegates.erase(listener);
+}
+
+void ProxyErrorListener::removeErrorListeners() {
+  _delegates.clear();
+}
+
+void ProxyErrorListener::syntaxError(Recognizer *recognizer, Token *offendingSymbol, size_t line,
+  size_t charPositionInLine, const std::string &msg, std::exception_ptr e) {
+
+  for (auto *listener : _delegates) {
+    listener->syntaxError(recognizer, offendingSymbol, line, charPositionInLine, msg, e);
+  }
+}
+
+void ProxyErrorListener::reportAmbiguity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+  bool exact, const antlrcpp::BitSet &ambigAlts, atn::ATNConfigSet *configs) {
+  for (auto *listener : _delegates) {
+    listener->reportAmbiguity(recognizer, dfa, startIndex, stopIndex, exact, ambigAlts, configs);
+  }
+}
+
+void ProxyErrorListener::reportAttemptingFullContext(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex,
+  size_t stopIndex, const antlrcpp::BitSet &conflictingAlts, atn::ATNConfigSet *configs) {
+  for (auto *listener : _delegates) {
+    listener->reportAttemptingFullContext(recognizer, dfa, startIndex, stopIndex, conflictingAlts, configs);
+  }
+}
+
+void ProxyErrorListener::reportContextSensitivity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+  size_t prediction, atn::ATNConfigSet *configs) {
+  for (auto *listener : _delegates) {
+    listener->reportContextSensitivity(recognizer, dfa, startIndex, stopIndex, prediction, configs);
+  }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ProxyErrorListener.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ProxyErrorListener.h
new file mode 100755
index 0000000000..6720f9714a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/ProxyErrorListener.h
@@ -0,0 +1,38 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "ANTLRErrorListener.h"
+#include "Exceptions.h"
+
+namespace antlr4 {
+
+  /// This implementation of ANTLRErrorListener dispatches all calls to a
+  /// collection of delegate listeners. This reduces the effort required to support multiple
+  /// listeners.
+  class ANTLR4CPP_PUBLIC ProxyErrorListener : public ANTLRErrorListener {
+  private:
+    std::set<ANTLRErrorListener *> _delegates; // Not owned.
+
+  public:
+    void addErrorListener(ANTLRErrorListener *listener);
+    void removeErrorListener(ANTLRErrorListener *listener);
+    void removeErrorListeners();
+
+    void syntaxError(Recognizer *recognizer, Token *offendingSymbol, size_t line, size_t charPositionInLine,
+                     const std::string &msg, std::exception_ptr e) override;
+
+    virtual void reportAmbiguity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex, bool exact,
+                                 const antlrcpp::BitSet &ambigAlts, atn::ATNConfigSet *configs) override;
+
+    virtual void reportAttemptingFullContext(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+      const antlrcpp::BitSet &conflictingAlts, atn::ATNConfigSet *configs) override;
+
+    virtual void reportContextSensitivity(Parser *recognizer, const dfa::DFA &dfa, size_t startIndex, size_t stopIndex,
+                                          size_t prediction, atn::ATNConfigSet *configs) override;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RecognitionException.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RecognitionException.cpp
new file mode 100755
index 0000000000..59ea48ad53
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RecognitionException.cpp
@@ -0,0 +1,65 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATN.h"
+#include "Recognizer.h"
+#include "ParserRuleContext.h"
+#include "misc/IntervalSet.h"
+
+#include "RecognitionException.h"
+
+using namespace antlr4;
+
+RecognitionException::RecognitionException(Recognizer *recognizer, IntStream *input, ParserRuleContext *ctx,
+                                           Token *offendingToken)
+  : RecognitionException("", recognizer, input, ctx, offendingToken) {
+}
+
+RecognitionException::RecognitionException(const std::string &message, Recognizer *recognizer, IntStream *input,
+                                           ParserRuleContext *ctx, Token *offendingToken)
+  : RuntimeException(message), _recognizer(recognizer), _input(input), _ctx(ctx), _offendingToken(offendingToken) {
+  InitializeInstanceFields();
+  if (recognizer != nullptr) {
+    _offendingState = recognizer->getState();
+  }
+}
+
+RecognitionException::~RecognitionException() {
+}
+
+size_t RecognitionException::getOffendingState() const {
+  return _offendingState;
+}
+
+void RecognitionException::setOffendingState(size_t offendingState) {
+  _offendingState = offendingState;
+}
+
+misc::IntervalSet RecognitionException::getExpectedTokens() const {
+  if (_recognizer) {
+    return _recognizer->getATN().getExpectedTokens(_offendingState, _ctx);
+  }
+  return misc::IntervalSet::EMPTY_SET;
+}
+
+RuleContext* RecognitionException::getCtx() const {
+  return _ctx;
+}
+
+IntStream* RecognitionException::getInputStream() const {
+  return _input;
+}
+
+Token* RecognitionException::getOffendingToken() const {
+  return _offendingToken;
+}
+
+Recognizer* RecognitionException::getRecognizer() const {
+  return _recognizer;
+}
+
+void RecognitionException::InitializeInstanceFields() {
+  _offendingState = INVALID_INDEX;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RecognitionException.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RecognitionException.h
new file mode 100755
index 0000000000..aa204f71e9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RecognitionException.h
@@ -0,0 +1,98 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Exceptions.h"
+
+namespace antlr4 {
+
+  /// The root of the ANTLR exception hierarchy. In general, ANTLR tracks just
+  /// 3 kinds of errors: prediction errors, failed predicate errors, and
+  /// mismatched input errors. In each case, the parser knows where it is
+  /// in the input, where it is in the ATN, the rule invocation stack,
+  /// and what kind of problem occurred.
+  class ANTLR4CPP_PUBLIC RecognitionException : public RuntimeException {
+  private:
+    /// The Recognizer where this exception originated.
+    Recognizer *_recognizer;
+    IntStream *_input;
+    ParserRuleContext *_ctx;
+
+    /// The current Token when an error occurred. Since not all streams
+    /// support accessing symbols by index, we have to track the Token
+    /// instance itself.
+    Token *_offendingToken;
+
+    size_t _offendingState;
+
+  public:
+    RecognitionException(Recognizer *recognizer, IntStream *input, ParserRuleContext *ctx,
+                         Token *offendingToken = nullptr);
+    RecognitionException(const std::string &message, Recognizer *recognizer, IntStream *input,
+                         ParserRuleContext *ctx, Token *offendingToken = nullptr);
+    RecognitionException(RecognitionException const&) = default;
+    ~RecognitionException();
+    RecognitionException& operator=(RecognitionException const&) = default;
+
+    /// Get the ATN state number the parser was in at the time the error
+    /// occurred. For NoViableAltException and
+    /// LexerNoViableAltException exceptions, this is the
+    /// DecisionState number. For others, it is the state whose outgoing
+    /// edge we couldn't match.
+    ///
+    /// If the state number is not known, this method returns -1.
+    virtual size_t getOffendingState() const;
+
+  protected:
+    void setOffendingState(size_t offendingState);
+
+    /// Gets the set of input symbols which could potentially follow the
+    /// previously matched symbol at the time this exception was thrown.
+    ///
+    /// If the set of expected tokens is not known and could not be computed,
+    /// this method returns an empty set.
+    ///
+    /// @returns The set of token types that could potentially follow the current
+    /// state in the ATN, or an empty set if the information is not available.
+  public:
+    virtual misc::IntervalSet getExpectedTokens() const;
+
+    /// <summary>
+    /// Gets the <seealso cref="RuleContext"/> at the time this exception was thrown.
+    /// <p/>
+    /// If the context is not available, this method returns {@code null}.
+    /// </summary>
+    /// <returns> The <seealso cref="RuleContext"/> at the time this exception was thrown.
+    /// If the context is not available, this method returns {@code null}. </returns>
+    virtual RuleContext* getCtx() const;
+
+    /// <summary>
+    /// Gets the input stream which is the symbol source for the recognizer where
+    /// this exception was thrown.
+    /// <p/>
+    /// If the input stream is not available, this method returns {@code null}.
+    /// </summary>
+    /// <returns> The input stream which is the symbol source for the recognizer
+    /// where this exception was thrown, or {@code null} if the stream is not
+    /// available. </returns>
+    virtual IntStream* getInputStream() const;
+
+    virtual Token* getOffendingToken() const;
+
+    /// <summary>
+    /// Gets the <seealso cref="Recognizer"/> where this exception occurred.
+    /// <p/>
+    /// If the recognizer is not available, this method returns {@code null}.
+    /// </summary>
+    /// <returns> The recognizer where this exception occurred, or {@code null} if
+    /// the recognizer is not available. </returns>
+    virtual Recognizer* getRecognizer() const;
+
+  private:
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Recognizer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Recognizer.cpp
new file mode 100755
index 0000000000..c8a183324c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Recognizer.cpp
@@ -0,0 +1,157 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "ConsoleErrorListener.h"
+#include "RecognitionException.h"
+#include "support/CPPUtils.h"
+#include "Token.h"
+#include "atn/ATN.h"
+#include "atn/ATNSimulator.h"
+#include "support/CPPUtils.h"
+#include "support/StringUtils.h"
+
+#include "Vocabulary.h"
+
+#include "Recognizer.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::internal;
+
+std::map<const dfa::Vocabulary*, std::map<std::string_view, size_t>> Recognizer::_tokenTypeMapCache;
+std::map<std::vector<std::string>, std::map<std::string, size_t>> Recognizer::_ruleIndexMapCache;
+
+Recognizer::Recognizer() {
+  InitializeInstanceFields();
+  _proxListener.addErrorListener(&ConsoleErrorListener::INSTANCE);
+}
+
+Recognizer::~Recognizer() {
+}
+
+std::map<std::string_view, size_t> Recognizer::getTokenTypeMap() {
+  const dfa::Vocabulary& vocabulary = getVocabulary();
+
+  UniqueLock<Mutex> lck(_mutex);
+  std::map<std::string_view, size_t> result;
+  auto iterator = _tokenTypeMapCache.find(&vocabulary);
+  if (iterator != _tokenTypeMapCache.end()) {
+    result = iterator->second;
+  } else {
+    for (size_t i = 0; i <= getATN().maxTokenType; ++i) {
+      std::string_view literalName = vocabulary.getLiteralName(i);
+      if (!literalName.empty()) {
+        result[literalName] = i;
+      }
+
+      std::string_view symbolicName = vocabulary.getSymbolicName(i);
+      if (!symbolicName.empty()) {
+        result[symbolicName] = i;
+      }
+    }
+    result["EOF"] = EOF;
+    _tokenTypeMapCache[&vocabulary] = result;
+  }
+
+  return result;
+}
+
+std::map<std::string, size_t> Recognizer::getRuleIndexMap() {
+  const std::vector<std::string>& ruleNames = getRuleNames();
+  if (ruleNames.empty()) {
+    throw "The current recognizer does not provide a list of rule names.";
+  }
+
+  UniqueLock<Mutex> lck(_mutex);
+  std::map<std::string, size_t> result;
+  auto iterator = _ruleIndexMapCache.find(ruleNames);
+  if (iterator != _ruleIndexMapCache.end()) {
+    result = iterator->second;
+  } else {
+    result = antlrcpp::toMap(ruleNames);
+    _ruleIndexMapCache[ruleNames] = result;
+  }
+  return result;
+}
+
+size_t Recognizer::getTokenType(std::string_view tokenName) {
+  const std::map<std::string_view, size_t> &map = getTokenTypeMap();
+  auto iterator = map.find(tokenName);
+  if (iterator == map.end())
+    return Token::INVALID_TYPE;
+
+  return iterator->second;
+}
+
+void Recognizer::setInterpreter(atn::ATNSimulator *interpreter) {
+  // Usually the interpreter is set by the descendant (lexer or parser (simulator), but can also be exchanged
+  // by the profiling ATN simulator.
+  delete _interpreter;
+  _interpreter = interpreter;
+}
+
+std::string Recognizer::getErrorHeader(RecognitionException *e) {
+  // We're having issues with cross header dependencies, these two classes will need to be
+  // rewritten to remove that.
+  size_t line = e->getOffendingToken()->getLine();
+  size_t charPositionInLine = e->getOffendingToken()->getCharPositionInLine();
+  return std::string("line ") + std::to_string(line) + ":" + std::to_string(charPositionInLine);
+
+}
+
+std::string Recognizer::getTokenErrorDisplay(Token *t) {
+  if (t == nullptr) {
+    return "<no Token>";
+  }
+  std::string s = t->getText();
+  if (s == "") {
+    if (t->getType() == EOF) {
+      s = "<EOF>";
+    } else {
+      s = std::string("<") + std::to_string(t->getType()) + std::string(">");
+    }
+  }
+
+  std::string result;
+  result.reserve(s.size() + 2);
+  result.push_back('\'');
+  antlrcpp::escapeWhitespace(result, s);
+  result.push_back('\'');
+  result.shrink_to_fit();
+  return result;
+}
+
+void Recognizer::addErrorListener(ANTLRErrorListener *listener) {
+  _proxListener.addErrorListener(listener);
+}
+
+void Recognizer::removeErrorListener(ANTLRErrorListener *listener) {
+  _proxListener.removeErrorListener(listener);
+}
+
+void Recognizer::removeErrorListeners() {
+  _proxListener.removeErrorListeners();
+}
+
+ProxyErrorListener& Recognizer::getErrorListenerDispatch() {
+  return _proxListener;
+}
+
+bool Recognizer::sempred(RuleContext * /*localctx*/, size_t /*ruleIndex*/, size_t /*actionIndex*/) {
+  return true;
+}
+
+bool Recognizer::precpred(RuleContext * /*localctx*/, int /*precedence*/) {
+  return true;
+}
+
+void Recognizer::action(RuleContext * /*localctx*/, size_t /*ruleIndex*/, size_t /*actionIndex*/) {
+}
+
+void Recognizer::InitializeInstanceFields() {
+  _stateNumber = ATNState::INVALID_STATE_NUMBER;
+  _interpreter = nullptr;
+}
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Recognizer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Recognizer.h
new file mode 100755
index 0000000000..bc62aea239
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Recognizer.h
@@ -0,0 +1,160 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "ProxyErrorListener.h"
+#include "support/Casts.h"
+#include "atn/SerializedATNView.h"
+#include "internal/Synchronization.h"
+
+namespace antlr4 {
+
+  class ANTLR4CPP_PUBLIC Recognizer {
+  public:
+    static constexpr size_t EOF = std::numeric_limits<size_t>::max();
+
+    Recognizer();
+    Recognizer(Recognizer const&) = delete;
+    virtual ~Recognizer();
+
+    Recognizer& operator=(Recognizer const&) = delete;
+
+    virtual std::vector<std::string> const& getRuleNames() const = 0;
+
+    /**
+     * Get the vocabulary used by the recognizer.
+     *
+     * @return A {@link Vocabulary} instance providing information about the
+     * vocabulary used by the grammar.
+     */
+    virtual dfa::Vocabulary const& getVocabulary() const = 0;
+
+    /// <summary>
+    /// Get a map from token names to token types.
+    /// <p/>
+    /// Used for XPath and tree pattern compilation.
+    /// </summary>
+    virtual std::map<std::string_view, size_t> getTokenTypeMap();
+
+    /// <summary>
+    /// Get a map from rule names to rule indexes.
+    /// <p/>
+    /// Used for XPath and tree pattern compilation.
+    /// </summary>
+    virtual std::map<std::string, size_t> getRuleIndexMap();
+
+    virtual size_t getTokenType(std::string_view tokenName);
+
+    /// <summary>
+    /// If this recognizer was generated, it will have a serialized ATN
+    /// representation of the grammar.
+    /// <p/>
+    /// For interpreters, we don't know their serialized ATN despite having
+    /// created the interpreter from it.
+    /// </summary>
+    virtual atn::SerializedATNView getSerializedATN() const {
+      throw "there is no serialized ATN";
+    }
+
+    /// <summary>
+    /// For debugging and other purposes, might want the grammar name.
+    ///  Have ANTLR generate an implementation for this method.
+    /// </summary>
+    virtual std::string getGrammarFileName() const = 0;
+
+    /// Get the ATN interpreter (in fact one of it's descendants) used by the recognizer for prediction.
+    /// @returns The ATN interpreter used by the recognizer for prediction.
+    template <class T>
+    T* getInterpreter() const {
+      return antlrcpp::downCast<T *>(_interpreter);
+    }
+
+    /**
+     * Set the ATN interpreter used by the recognizer for prediction.
+     *
+     * @param interpreter The ATN interpreter used by the recognizer for
+     * prediction.
+     */
+    void setInterpreter(atn::ATNSimulator *interpreter);
+
+    /// What is the error header, normally line/character position information?
+    virtual std::string getErrorHeader(RecognitionException *e);
+
+    /** How should a token be displayed in an error message? The default
+     *  is to display just the text, but during development you might
+     *  want to have a lot of information spit out.  Override in that case
+     *  to use t.toString() (which, for CommonToken, dumps everything about
+     *  the token). This is better than forcing you to override a method in
+     *  your token objects because you don't have to go modify your lexer
+     *  so that it creates a new Java type.
+     *
+     * @deprecated This method is not called by the ANTLR 4 Runtime. Specific
+     * implementations of {@link ANTLRErrorStrategy} may provide a similar
+     * feature when necessary. For example, see
+     * {@link DefaultErrorStrategy#getTokenErrorDisplay}.
+     */
+    virtual std::string getTokenErrorDisplay(Token *t);
+
+    /// <exception cref="NullPointerException"> if {@code listener} is {@code null}. </exception>
+    virtual void addErrorListener(ANTLRErrorListener *listener);
+
+    virtual void removeErrorListener(ANTLRErrorListener *listener);
+
+    virtual void removeErrorListeners();
+
+    virtual ProxyErrorListener& getErrorListenerDispatch();
+
+    // subclass needs to override these if there are sempreds or actions
+    // that the ATN interp needs to execute
+    virtual bool sempred(RuleContext *localctx, size_t ruleIndex, size_t actionIndex);
+
+    virtual bool precpred(RuleContext *localctx, int precedence);
+
+    virtual void action(RuleContext *localctx, size_t ruleIndex, size_t actionIndex);
+
+    size_t getState() const { return _stateNumber; }
+
+    // Get the ATN used by the recognizer for prediction.
+    virtual const atn::ATN& getATN() const = 0;
+
+    /// <summary>
+    /// Indicate that the recognizer has changed internal state that is
+    ///  consistent with the ATN state passed in.  This way we always know
+    ///  where we are in the ATN as the parser goes along. The rule
+    ///  context objects form a stack that lets us see the stack of
+    ///  invoking rules. Combine this and we have complete ATN
+    ///  configuration information.
+    /// </summary>
+    void setState(size_t atnState) { _stateNumber = atnState; }
+
+    virtual IntStream* getInputStream() = 0;
+
+    virtual void setInputStream(IntStream *input) = 0;
+
+    virtual TokenFactory<CommonToken>* getTokenFactory() = 0;
+
+    template<typename T1>
+    void setTokenFactory(TokenFactory<T1> *input);
+
+  protected:
+    atn::ATNSimulator *_interpreter; // Set and deleted in descendants (or the profiler).
+
+    // Mutex to manage synchronized access for multithreading.
+    internal::Mutex _mutex;
+
+  private:
+    static std::map<const dfa::Vocabulary*, std::map<std::string_view, size_t>> _tokenTypeMapCache;
+    static std::map<std::vector<std::string>, std::map<std::string, size_t>> _ruleIndexMapCache;
+
+    ProxyErrorListener _proxListener; // Manages a collection of listeners.
+
+    size_t _stateNumber;
+
+    void InitializeInstanceFields();
+
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContext.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContext.cpp
new file mode 100755
index 0000000000..3ed945fc1b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContext.cpp
@@ -0,0 +1,144 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/Trees.h"
+#include "misc/Interval.h"
+#include "Parser.h"
+#include "atn/ATN.h"
+#include "atn/ATNState.h"
+#include "tree/ParseTreeVisitor.h"
+
+#include "RuleContext.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::tree;
+
+RuleContext::RuleContext() : ParseTree(ParseTreeType::RULE) {
+  InitializeInstanceFields();
+}
+
+RuleContext::RuleContext(RuleContext *parent_, size_t invokingState_) : ParseTree(ParseTreeType::RULE) {
+  InitializeInstanceFields();
+  this->parent = parent_;
+  this->invokingState = invokingState_;
+}
+
+int RuleContext::depth() {
+  int n = 1;
+  RuleContext *p = this;
+  while (true) {
+    if (p->parent == nullptr)
+      break;
+    p = static_cast<RuleContext *>(p->parent);
+    n++;
+  }
+  return n;
+}
+
+bool RuleContext::isEmpty() {
+  return invokingState == ATNState::INVALID_STATE_NUMBER;
+}
+
+misc::Interval RuleContext::getSourceInterval() {
+  return misc::Interval::INVALID;
+}
+
+std::string RuleContext::getText() {
+  if (children.empty()) {
+    return "";
+  }
+
+  std::stringstream ss;
+  for (size_t i = 0; i < children.size(); i++) {
+    ParseTree *tree = children[i];
+    if (tree != nullptr)
+      ss << tree->getText();
+  }
+
+  return ss.str();
+}
+
+size_t RuleContext::getRuleIndex() const {
+  return INVALID_INDEX;
+}
+
+size_t RuleContext::getAltNumber() const {
+  return atn::ATN::INVALID_ALT_NUMBER;
+}
+
+void RuleContext::setAltNumber(size_t /*altNumber*/) {
+}
+
+std::any RuleContext::accept(tree::ParseTreeVisitor *visitor) {
+  return visitor->visitChildren(this);
+}
+
+std::string RuleContext::toStringTree(Parser *recog, bool pretty) {
+  return tree::Trees::toStringTree(this, recog, pretty);
+}
+
+std::string RuleContext::toStringTree(std::vector<std::string> &ruleNames, bool pretty) {
+  return tree::Trees::toStringTree(this, ruleNames, pretty);
+}
+
+std::string RuleContext::toStringTree(bool pretty) {
+  return toStringTree(nullptr, pretty);
+}
+
+
+std::string RuleContext::toString(const std::vector<std::string> &ruleNames) {
+  return toString(ruleNames, nullptr);
+}
+
+
+std::string RuleContext::toString(const std::vector<std::string> &ruleNames, RuleContext *stop) {
+  std::stringstream ss;
+
+  RuleContext *currentParent = this;
+  ss << "[";
+  while (currentParent != stop) {
+    if (ruleNames.empty()) {
+      if (!currentParent->isEmpty()) {
+        ss << currentParent->invokingState;
+      }
+    } else {
+      size_t ruleIndex = currentParent->getRuleIndex();
+
+      std::string ruleName = (ruleIndex < ruleNames.size()) ? ruleNames[ruleIndex] : std::to_string(ruleIndex);
+      ss << ruleName;
+    }
+
+    if (currentParent->parent == nullptr) // No parent anymore.
+      break;
+    currentParent = static_cast<RuleContext *>(currentParent->parent);
+    if (!ruleNames.empty() || !currentParent->isEmpty()) {
+      ss << " ";
+    }
+  }
+
+  ss << "]";
+
+  return ss.str();
+}
+
+std::string RuleContext::toString() {
+  return toString(nullptr);
+}
+
+std::string RuleContext::toString(Recognizer *recog) {
+  return toString(recog, &ParserRuleContext::EMPTY);
+}
+
+std::string RuleContext::toString(Recognizer *recog, RuleContext *stop) {
+  if (recog == nullptr)
+    return toString(std::vector<std::string>(), stop); // Don't use an initializer {} here or we end up calling ourselve recursivly.
+  return toString(recog->getRuleNames(), stop);
+}
+
+void RuleContext::InitializeInstanceFields() {
+  invokingState = INVALID_INDEX;
+}
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContext.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContext.h
new file mode 100755
index 0000000000..117f90b2d6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContext.h
@@ -0,0 +1,141 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "tree/ParseTree.h"
+
+namespace antlr4 {
+
+  /** A rule context is a record of a single rule invocation.
+   *
+   *  We form a stack of these context objects using the parent
+   *  pointer. A parent pointer of null indicates that the current
+   *  context is the bottom of the stack. The ParserRuleContext subclass
+   *  as a children list so that we can turn this data structure into a
+   *  tree.
+   *
+   *  The root node always has a null pointer and invokingState of -1.
+   *
+   *  Upon entry to parsing, the first invoked rule function creates a
+   *  context object (asubclass specialized for that rule such as
+   *  SContext) and makes it the root of a parse tree, recorded by field
+   *  Parser._ctx.
+   *
+   *  public final SContext s() throws RecognitionException {
+   *      SContext _localctx = new SContext(_ctx, getState()); <-- create new node
+   *      enterRule(_localctx, 0, RULE_s);                     <-- push it
+   *      ...
+   *      exitRule();                                          <-- pop back to _localctx
+   *      return _localctx;
+   *  }
+   *
+   *  A subsequent rule invocation of r from the start rule s pushes a
+   *  new context object for r whose parent points at s and use invoking
+   *  state is the state with r emanating as edge label.
+   *
+   *  The invokingState fields from a context object to the root
+   *  together form a stack of rule indication states where the root
+   *  (bottom of the stack) has a -1 sentinel value. If we invoke start
+   *  symbol s then call r1, which calls r2, the  would look like
+   *  this:
+   *
+   *     SContext[-1]   <- root node (bottom of the stack)
+   *     R1Context[p]   <- p in rule s called r1
+   *     R2Context[q]   <- q in rule r1 called r2
+   *
+   *  So the top of the stack, _ctx, represents a call to the current
+   *  rule and it holds the return address from another rule that invoke
+   *  to this rule. To invoke a rule, we must always have a current context.
+   *
+   *  The parent contexts are useful for computing lookahead sets and
+   *  getting error information.
+   *
+   *  These objects are used during parsing and prediction.
+   *  For the special case of parsers, we use the subclass
+   *  ParserRuleContext.
+   *
+   *  @see ParserRuleContext
+   */
+  class ANTLR4CPP_PUBLIC RuleContext : public tree::ParseTree {
+  public:
+    static bool is(const tree::ParseTree &parseTree) { return parseTree.getTreeType() == tree::ParseTreeType::RULE; }
+
+    static bool is(const tree::ParseTree *parseTree) { return parseTree != nullptr && is(*parseTree); }
+
+    /// What state invoked the rule associated with this context?
+    /// The "return address" is the followState of invokingState
+    /// If parent is null, this should be -1 and this context object represents the start rule.
+    size_t invokingState;
+
+    RuleContext();
+    RuleContext(RuleContext *parent, size_t invokingState);
+
+    virtual int depth();
+
+    /// A context is empty if there is no invoking state; meaning nobody called current context.
+    virtual bool isEmpty();
+
+    // satisfy the ParseTree / SyntaxTree interface
+
+    virtual misc::Interval getSourceInterval() override;
+
+    virtual std::string getText() override;
+
+    virtual size_t getRuleIndex() const;
+
+    /** For rule associated with this parse tree internal node, return
+     *  the outer alternative number used to match the input. Default
+     *  implementation does not compute nor store this alt num. Create
+     *  a subclass of ParserRuleContext with backing field and set
+     *  option contextSuperClass.
+     *  to set it.
+     *
+     *  @since 4.5.3
+     */
+    virtual size_t getAltNumber() const;
+
+    /** Set the outer alternative number for this context node. Default
+     *  implementation does nothing to avoid backing field overhead for
+     *  trees that don't need it.  Create
+     *  a subclass of ParserRuleContext with backing field and set
+     *  option contextSuperClass.
+     *
+     *  @since 4.5.3
+     */
+    virtual void setAltNumber(size_t altNumber);
+
+    virtual std::any accept(tree::ParseTreeVisitor *visitor) override;
+
+    /// <summary>
+    /// Print out a whole tree, not just a node, in LISP format
+    ///  (root child1 .. childN). Print just a node if this is a leaf.
+    ///  We have to know the recognizer so we can get rule names.
+    /// </summary>
+    virtual std::string toStringTree(Parser *recog, bool pretty = false) override;
+
+    /// <summary>
+    /// Print out a whole tree, not just a node, in LISP format
+    ///  (root child1 .. childN). Print just a node if this is a leaf.
+    /// </summary>
+    virtual std::string toStringTree(std::vector<std::string> &ruleNames, bool pretty = false);
+
+    virtual std::string toStringTree(bool pretty = false) override;
+    virtual std::string toString() override;
+    std::string toString(Recognizer *recog);
+    std::string toString(const std::vector<std::string> &ruleNames);
+
+    // recog null unless ParserRuleContext, in which case we use subclass toString(...)
+    std::string toString(Recognizer *recog, RuleContext *stop);
+
+    virtual std::string toString(const std::vector<std::string> &ruleNames, RuleContext *stop);
+
+    bool operator == (const RuleContext &other) { return this == &other; } // Simple address comparison.
+
+  private:
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContextWithAltNum.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContextWithAltNum.cpp
new file mode 100755
index 0000000000..250859fdc0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContextWithAltNum.cpp
@@ -0,0 +1,27 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATN.h"
+
+#include "RuleContextWithAltNum.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+RuleContextWithAltNum::RuleContextWithAltNum() : ParserRuleContext() {
+  altNum = ATN::INVALID_ALT_NUMBER;
+}
+
+RuleContextWithAltNum::RuleContextWithAltNum(ParserRuleContext *parent, int invokingStateNumber)
+  : ParserRuleContext(parent, invokingStateNumber) {
+}
+
+size_t RuleContextWithAltNum::getAltNumber() const {
+  return altNum;
+}
+
+void RuleContextWithAltNum::setAltNumber(size_t number) {
+  altNum = number;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContextWithAltNum.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContextWithAltNum.h
new file mode 100755
index 0000000000..995d9aa7b1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuleContextWithAltNum.h
@@ -0,0 +1,32 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "ParserRuleContext.h"
+
+namespace antlr4 {
+
+  /// A handy class for use with
+  ///
+  ///  options {contextSuperClass=org.antlr.v4.runtime.RuleContextWithAltNum;}
+  ///
+  ///  that provides a backing field / impl for the outer alternative number
+  ///  matched for an internal parse tree node.
+  ///
+  ///  I'm only putting into Java runtime as I'm certain I'm the only one that
+  ///  will really every use this.
+  class ANTLR4CPP_PUBLIC RuleContextWithAltNum : public ParserRuleContext {
+  public:
+    size_t altNum = 0;
+
+    RuleContextWithAltNum();
+    RuleContextWithAltNum(ParserRuleContext *parent, int invokingStateNumber);
+
+    virtual size_t getAltNumber() const override;
+    virtual void setAltNumber(size_t altNum) override;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuntimeMetaData.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuntimeMetaData.cpp
new file mode 100755
index 0000000000..cf30d68587
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuntimeMetaData.cpp
@@ -0,0 +1,54 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "RuntimeMetaData.h"
+#include "Version.h"
+
+using namespace antlr4;
+
+const std::string RuntimeMetaData::VERSION = ANTLRCPP_VERSION_STRING;
+
+std::string RuntimeMetaData::getRuntimeVersion() {
+  return VERSION;
+}
+
+void RuntimeMetaData::checkVersion(const std::string &generatingToolVersion, const std::string &compileTimeVersion) {
+  std::string runtimeVersion = VERSION;
+  bool runtimeConflictsWithGeneratingTool = false;
+  bool runtimeConflictsWithCompileTimeTool = false;
+
+  if (generatingToolVersion != "") {
+    runtimeConflictsWithGeneratingTool = runtimeVersion != generatingToolVersion
+      && getMajorMinorVersion(runtimeVersion) != getMajorMinorVersion(generatingToolVersion);
+  }
+
+  runtimeConflictsWithCompileTimeTool = runtimeVersion != compileTimeVersion
+    && getMajorMinorVersion(runtimeVersion) != getMajorMinorVersion(compileTimeVersion);
+
+  if (runtimeConflictsWithGeneratingTool) {
+    std::cerr << "ANTLR Tool version " << generatingToolVersion << " used for code generation does not match "
+      "the current runtime version " << runtimeVersion << std::endl;
+  }
+  if (runtimeConflictsWithCompileTimeTool) {
+    std::cerr << "ANTLR Runtime version " << compileTimeVersion << " used for parser compilation does not match "
+      "the current runtime version " << runtimeVersion << std::endl;
+  }
+}
+
+std::string RuntimeMetaData::getMajorMinorVersion(const std::string &version) {
+  size_t firstDot = version.find('.');
+  size_t secondDot = firstDot != std::string::npos ? version.find('.', firstDot + 1) : std::string::npos;
+  size_t firstDash = version.find('-');
+  size_t referenceLength = version.size();
+  if (secondDot != std::string::npos) {
+    referenceLength = std::min(referenceLength, secondDot);
+  }
+
+  if (firstDash != std::string::npos) {
+    referenceLength = std::min(referenceLength, firstDash);
+  }
+
+  return version.substr(0, referenceLength);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuntimeMetaData.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuntimeMetaData.h
new file mode 100755
index 0000000000..f178cfe9e8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/RuntimeMetaData.h
@@ -0,0 +1,155 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+
+  /// <summary>
+  /// This class provides access to the current version of the ANTLR 4 runtime
+  /// library as compile-time and runtime constants, along with methods for
+  /// checking for matching version numbers and notifying listeners in the case
+  /// where a version mismatch is detected.
+  ///
+  /// <para>
+  /// The runtime version information is provided by <seealso cref="#VERSION"/> and
+  /// <seealso cref="#getRuntimeVersion()"/>. Detailed information about these values is
+  /// provided in the documentation for each member.</para>
+  ///
+  /// <para>
+  /// The runtime version check is implemented by <seealso cref="#checkVersion"/>. Detailed
+  /// information about incorporating this call into user code, as well as its use
+  /// in generated code, is provided in the documentation for the method.</para>
+  ///
+  /// <para>
+  /// Version strings x.y and x.y.z are considered "compatible" and no error
+  /// would be generated. Likewise, version strings x.y-SNAPSHOT and x.y.z are
+  /// considered "compatible" because the major and minor components x.y
+  /// are the same in each.</para>
+  ///
+  /// <para>
+  /// To trap any error messages issued by this code, use System.setErr()
+  /// in your main() startup code.
+  /// </para>
+  ///
+  /// @since 4.3
+  /// </summary>
+  class ANTLR4CPP_PUBLIC RuntimeMetaData {
+  public:
+    /// A compile-time constant containing the current version of the ANTLR 4
+    /// runtime library.
+    ///
+    /// <para>
+    /// This compile-time constant value allows generated parsers and other
+    /// libraries to include a literal reference to the version of the ANTLR 4
+    /// runtime library the code was compiled against. At each release, we
+    /// change this value.</para>
+    ///
+    /// <para>Version numbers are assumed to have the form
+    ///
+    /// <em>major</em>.<em>minor</em>.<em>patch</em>.<em>revision</em>-<em>suffix</em>,
+    ///
+    /// with the individual components defined as follows.</para>
+    ///
+    /// <ul>
+    /// <li><em>major</em> is a required non-negative integer, and is equal to
+    /// {@code 4} for ANTLR 4.</li>
+    /// <li><em>minor</em> is a required non-negative integer.</li>
+    /// <li><em>patch</em> is an optional non-negative integer. When
+    /// <em>patch</em> is omitted, the {@code .} (dot) appearing before it is
+    /// also omitted.</li>
+    /// <li><em>revision</em> is an optional non-negative integer, and may only
+    /// be included when <em>patch</em> is also included. When <em>revision</em>
+    /// is omitted, the {@code .} (dot) appearing before it is also omitted.</li>
+    /// <li><em>suffix</em> is an optional string. When <em>suffix</em> is
+    /// omitted, the {@code -} (hyphen-minus) appearing before it is also
+    /// omitted.</li>
+    /// </ul>
+    static const std::string VERSION;
+
+    /// <summary>
+    /// Gets the currently executing version of the ANTLR 4 runtime library.
+    ///
+    /// <para>
+    /// This method provides runtime access to the <seealso cref="#VERSION"/> field, as
+    /// opposed to directly referencing the field as a compile-time constant.</para>
+    /// </summary>
+    /// <returns> The currently executing version of the ANTLR 4 library </returns>
+
+    static std::string getRuntimeVersion();
+
+    /// <summary>
+    /// This method provides the ability to detect mismatches between the version
+    /// of ANTLR 4 used to generate a parser, the version of the ANTLR runtime a
+    /// parser was compiled against, and the version of the ANTLR runtime which
+    /// is currently executing.
+    ///
+    /// <para>
+    /// The version check is designed to detect the following two specific
+    /// scenarios.</para>
+    ///
+    /// <ul>
+    /// <li>The ANTLR Tool version used for code generation does not match the
+    /// currently executing runtime version.</li>
+    /// <li>The ANTLR Runtime version referenced at the time a parser was
+    /// compiled does not match the currently executing runtime version.</li>
+    /// </ul>
+    ///
+    /// <para>
+    /// Starting with ANTLR 4.3, the code generator emits a call to this method
+    /// using two constants in each generated lexer and parser: a hard-coded
+    /// constant indicating the version of the tool used to generate the parser
+    /// and a reference to the compile-time constant <seealso cref="#VERSION"/>. At
+    /// runtime, this method is called during the initialization of the generated
+    /// parser to detect mismatched versions, and notify the registered listeners
+    /// prior to creating instances of the parser.</para>
+    ///
+    /// <para>
+    /// This method does not perform any detection or filtering of semantic
+    /// changes between tool and runtime versions. It simply checks for a
+    /// version match and emits an error to stderr if a difference
+    /// is detected.</para>
+    ///
+    /// <para>
+    /// Note that some breaking changes between releases could result in other
+    /// types of runtime exceptions, such as a <seealso cref="LinkageError"/>, prior to
+    /// calling this method. In these cases, the underlying version mismatch will
+    /// not be reported here. This method is primarily intended to
+    /// notify users of potential semantic changes between releases that do not
+    /// result in binary compatibility problems which would be detected by the
+    /// class loader. As with semantic changes, changes that break binary
+    /// compatibility between releases are mentioned in the release notes
+    /// accompanying the affected release.</para>
+    ///
+    /// <para>
+    /// <strong>Additional note for target developers:</strong> The version check
+    /// implemented by this class is designed to address specific compatibility
+    /// concerns that may arise during the execution of Java applications. Other
+    /// targets should consider the implementation of this method in the context
+    /// of that target's known execution environment, which may or may not
+    /// resemble the design provided for the Java target.</para>
+    /// </summary>
+    /// <param name="generatingToolVersion"> The version of the tool used to generate a parser.
+    /// This value may be null when called from user code that was not generated
+    /// by, and does not reference, the ANTLR 4 Tool itself. </param>
+    /// <param name="compileTimeVersion"> The version of the runtime the parser was
+    /// compiled against. This should always be passed using a direct reference
+    /// to <seealso cref="#VERSION"/>. </param>
+    static void checkVersion(const std::string &generatingToolVersion, const std::string &compileTimeVersion);
+
+    /// <summary>
+    /// Gets the major and minor version numbers from a version string. For
+    /// details about the syntax of the input {@code version}.
+    /// E.g., from x.y.z return x.y.
+    /// </summary>
+    /// <param name="version"> The complete version string. </param>
+    /// <returns> A string of the form <em>major</em>.<em>minor</em> containing
+    /// only the major and minor components of the version string. </returns>
+    static std::string getMajorMinorVersion(const std::string &version);
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Token.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Token.cpp
new file mode 100644
index 0000000000..31266b42d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Token.cpp
@@ -0,0 +1,9 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Token.h"
+
+antlr4::Token::~Token() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Token.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Token.h
new file mode 100755
index 0000000000..6f3fa76c12
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Token.h
@@ -0,0 +1,92 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "IntStream.h"
+
+namespace antlr4 {
+
+  /// A token has properties: text, type, line, character position in the line
+  /// (so we can ignore tabs), token channel, index, and source from which
+  /// we obtained this token.
+  class ANTLR4CPP_PUBLIC Token {
+  public:
+    static constexpr size_t INVALID_TYPE = 0;
+
+    /// During lookahead operations, this "token" signifies we hit rule end ATN state
+    /// and did not follow it despite needing to.
+    static constexpr size_t EPSILON = std::numeric_limits<size_t>::max() - 1;
+    static constexpr size_t MIN_USER_TOKEN_TYPE = 1;
+    static constexpr size_t EOF = IntStream::EOF;
+
+    virtual ~Token();
+
+    /// All tokens go to the parser (unless skip() is called in that rule)
+    /// on a particular "channel".  The parser tunes to a particular channel
+    /// so that whitespace etc... can go to the parser on a "hidden" channel.
+    static constexpr size_t DEFAULT_CHANNEL = 0;
+
+    /// Anything on different channel than DEFAULT_CHANNEL is not parsed
+    /// by parser.
+    static constexpr size_t HIDDEN_CHANNEL = 1;
+
+    /**
+     * This is the minimum constant value which can be assigned to a
+     * user-defined token channel.
+     *
+     * <p>
+     * The non-negative numbers less than {@link #MIN_USER_CHANNEL_VALUE} are
+     * assigned to the predefined channels {@link #DEFAULT_CHANNEL} and
+     * {@link #HIDDEN_CHANNEL}.</p>
+     *
+     * @see Token#getChannel()
+     */
+    static constexpr size_t MIN_USER_CHANNEL_VALUE = 2;
+
+    /// Get the text of the token.
+    virtual std::string getText() const = 0;
+
+    /// Get the token type of the token
+    virtual size_t getType() const = 0;
+
+    /// The line number on which the 1st character of this token was matched,  line=1..n
+    virtual size_t getLine() const = 0;
+
+    /// The index of the first character of this token relative to the
+    /// beginning of the line at which it occurs, 0..n-1
+    virtual size_t getCharPositionInLine() const = 0;
+
+    /// Return the channel this token. Each token can arrive at the parser
+    /// on a different channel, but the parser only "tunes" to a single channel.
+    /// The parser ignores everything not on DEFAULT_CHANNEL.
+    virtual size_t getChannel() const = 0;
+
+    /// An index from 0..n-1 of the token object in the input stream.
+    /// This must be valid in order to print token streams and
+    /// use TokenRewriteStream.
+    ///
+    /// Return INVALID_INDEX to indicate that this token was conjured up since
+    /// it doesn't have a valid index.
+    virtual size_t getTokenIndex() const = 0;
+
+    /// The starting character index of the token
+    /// This method is optional; return INVALID_INDEX if not implemented.
+    virtual size_t getStartIndex() const = 0;
+
+    /// The last character index of the token.
+    /// This method is optional; return INVALID_INDEX if not implemented.
+    virtual size_t getStopIndex() const = 0;
+
+    /// Gets the <seealso cref="TokenSource"/> which created this token.
+    virtual TokenSource *getTokenSource() const = 0;
+
+    /// Gets the <seealso cref="CharStream"/> from which this token was derived.
+    virtual CharStream *getInputStream() const = 0;
+
+    virtual std::string toString() const = 0;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenFactory.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenFactory.h
new file mode 100755
index 0000000000..e29335f5b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenFactory.h
@@ -0,0 +1,30 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+
+  /// The default mechanism for creating tokens. It's used by default in Lexer and
+  ///  the error handling strategy (to create missing tokens).  Notifying the parser
+  ///  of a new factory means that it notifies it's token source and error strategy.
+  template<typename Symbol>
+  class ANTLR4CPP_PUBLIC TokenFactory {
+  public:
+    virtual ~TokenFactory() {}
+
+    /// This is the method used to create tokens in the lexer and in the
+    /// error handling strategy. If text!=null, than the start and stop positions
+    /// are wiped to -1 in the text override is set in the CommonToken.
+    virtual std::unique_ptr<Symbol> create(std::pair<TokenSource *, CharStream *> source, size_t type, const std::string &text,
+      size_t channel, size_t start, size_t stop, size_t line, size_t charPositionInLine) = 0;
+
+    /// Generically useful
+    virtual std::unique_ptr<Symbol> create(size_t type, const std::string &text) = 0;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenSource.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenSource.cpp
new file mode 100644
index 0000000000..6b9d7af2f7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenSource.cpp
@@ -0,0 +1,9 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "TokenSource.h"
+
+antlr4::TokenSource::~TokenSource() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenSource.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenSource.h
new file mode 100755
index 0000000000..a8ed34f85d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenSource.h
@@ -0,0 +1,85 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "TokenFactory.h"
+
+namespace antlr4 {
+
+  /// <summary>
+  /// A source of tokens must provide a sequence of tokens via <seealso cref="#nextToken()"/>
+  /// and also must reveal it's source of characters; <seealso cref="CommonToken"/>'s text is
+  /// computed from a <seealso cref="CharStream"/>; it only store indices into the char
+  /// stream.
+  /// <p/>
+  /// Errors from the lexer are never passed to the parser. Either you want to keep
+  /// going or you do not upon token recognition error. If you do not want to
+  /// continue lexing then you do not want to continue parsing. Just throw an
+  /// exception not under <seealso cref="RecognitionException"/> and Java will naturally toss
+  /// you all the way out of the recognizers. If you want to continue lexing then
+  /// you should not throw an exception to the parser--it has already requested a
+  /// token. Keep lexing until you get a valid one. Just report errors and keep
+  /// going, looking for a valid token.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC TokenSource {
+  public:
+    virtual ~TokenSource();
+
+    /// Return a <seealso cref="Token"/> object from your input stream (usually a
+    /// <seealso cref="CharStream"/>). Do not fail/return upon lexing error; keep chewing
+    /// on the characters until you get a good one; errors are not passed through
+    /// to the parser.
+    virtual std::unique_ptr<Token> nextToken() = 0;
+
+    /// <summary>
+    /// Get the line number for the current position in the input stream. The
+    /// first line in the input is line 1.
+    /// </summary>
+    /// <returns> The line number for the current position in the input stream, or
+    /// 0 if the current token source does not track line numbers. </returns>
+    virtual size_t getLine() const = 0;
+
+    /// <summary>
+    /// Get the index into the current line for the current position in the input
+    /// stream. The first character on a line has position 0.
+    /// </summary>
+    /// <returns> The line number for the current position in the input stream, or
+    /// (sze_t)-1 if the current token source does not track character positions. </returns>
+    virtual size_t getCharPositionInLine() = 0;
+
+    /// <summary>
+    /// Get the <seealso cref="CharStream"/> from which this token source is currently
+    /// providing tokens.
+    /// </summary>
+    /// <returns> The <seealso cref="CharStream"/> associated with the current position in
+    /// the input, or {@code null} if no input stream is available for the token
+    /// source. </returns>
+    virtual CharStream* getInputStream() = 0;
+
+    /// <summary>
+    /// Gets the name of the underlying input source. This method returns a
+    /// non-null, non-empty string. If such a name is not known, this method
+    /// returns <seealso cref="IntStream#UNKNOWN_SOURCE_NAME"/>.
+    /// </summary>
+    virtual std::string getSourceName() = 0;
+
+    /// <summary>
+    /// Set the <seealso cref="TokenFactory"/> this token source should use for creating
+    /// <seealso cref="Token"/> objects from the input.
+    /// </summary>
+    /// <param name="factory"> The <seealso cref="TokenFactory"/> to use for creating tokens. </param>
+    template<typename T1>
+    void setTokenFactory(TokenFactory<T1> * /*factory*/) {}
+
+    /// <summary>
+    /// Gets the <seealso cref="TokenFactory"/> this token source is currently using for
+    /// creating <seealso cref="Token"/> objects from the input.
+    /// </summary>
+    /// <returns> The <seealso cref="TokenFactory"/> currently used by this token source. </returns>
+    virtual TokenFactory<CommonToken>* getTokenFactory() = 0;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStream.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStream.cpp
new file mode 100755
index 0000000000..51dcb3034b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStream.cpp
@@ -0,0 +1,11 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "TokenStream.h"
+
+using namespace antlr4;
+
+TokenStream::~TokenStream() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStream.h
new file mode 100755
index 0000000000..c7dd0d4033
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStream.h
@@ -0,0 +1,137 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "IntStream.h"
+
+namespace antlr4 {
+
+  /// <summary>
+  /// An <seealso cref="IntStream"/> whose symbols are <seealso cref="Token"/> instances.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC TokenStream : public IntStream {
+    /// <summary>
+    /// Get the <seealso cref="Token"/> instance associated with the value returned by
+    /// <seealso cref="#LA LA(k)"/>. This method has the same pre- and post-conditions as
+    /// <seealso cref="IntStream#LA"/>. In addition, when the preconditions of this method
+    /// are met, the return value is non-null and the value of
+    /// {@code LT(k).getType()==LA(k)}.
+    /// </summary>
+    /// <seealso cref= IntStream#LA </seealso>
+  public:
+    virtual ~TokenStream();
+
+    virtual Token* LT(ssize_t k) = 0;
+
+    /// <summary>
+    /// Gets the <seealso cref="Token"/> at the specified {@code index} in the stream. When
+    /// the preconditions of this method are met, the return value is non-null.
+    /// <p/>
+    /// The preconditions for this method are the same as the preconditions of
+    /// <seealso cref="IntStream#seek"/>. If the behavior of {@code seek(index)} is
+    /// unspecified for the current state and given {@code index}, then the
+    /// behavior of this method is also unspecified.
+    /// <p/>
+    /// The symbol referred to by {@code index} differs from {@code seek()} only
+    /// in the case of filtering streams where {@code index} lies before the end
+    /// of the stream. Unlike {@code seek()}, this method does not adjust
+    /// {@code index} to point to a non-ignored symbol.
+    /// </summary>
+    /// <exception cref="IllegalArgumentException"> if {code index} is less than 0 </exception>
+    /// <exception cref="UnsupportedOperationException"> if the stream does not support
+    /// retrieving the token at the specified index </exception>
+    virtual Token* get(size_t index) const = 0;
+
+    /// Gets the underlying TokenSource which provides tokens for this stream.
+    virtual TokenSource* getTokenSource() const = 0;
+
+    /// <summary>
+    /// Return the text of all tokens within the specified {@code interval}. This
+    /// method behaves like the following code (including potential exceptions
+    /// for violating preconditions of <seealso cref="#get"/>, but may be optimized by the
+    /// specific implementation.
+    ///
+    /// <pre>
+    /// TokenStream stream = ...;
+    /// String text = "";
+    /// for (int i = interval.a; i <= interval.b; i++) {
+    ///   text += stream.get(i).getText();
+    /// }
+    /// </pre>
+    /// </summary>
+    /// <param name="interval"> The interval of tokens within this stream to get text
+    /// for. </param>
+    /// <returns> The text of all tokens within the specified interval in this
+    /// stream.
+    /// </returns>
+    /// <exception cref="NullPointerException"> if {@code interval} is {@code null} </exception>
+    virtual std::string getText(const misc::Interval &interval) = 0;
+
+    /// <summary>
+    /// Return the text of all tokens in the stream. This method behaves like the
+    /// following code, including potential exceptions from the calls to
+    /// <seealso cref="IntStream#size"/> and <seealso cref="#getText(Interval)"/>, but may be
+    /// optimized by the specific implementation.
+    ///
+    /// <pre>
+    /// TokenStream stream = ...;
+    /// String text = stream.getText(new Interval(0, stream.size()));
+    /// </pre>
+    /// </summary>
+    /// <returns> The text of all tokens in the stream. </returns>
+    virtual std::string getText() = 0;
+
+    /// <summary>
+    /// Return the text of all tokens in the source interval of the specified
+    /// context. This method behaves like the following code, including potential
+    /// exceptions from the call to <seealso cref="#getText(Interval)"/>, but may be
+    /// optimized by the specific implementation.
+    /// </p>
+    /// If {@code ctx.getSourceInterval()} does not return a valid interval of
+    /// tokens provided by this stream, the behavior is unspecified.
+    ///
+    /// <pre>
+    /// TokenStream stream = ...;
+    /// String text = stream.getText(ctx.getSourceInterval());
+    /// </pre>
+    /// </summary>
+    /// <param name="ctx"> The context providing the source interval of tokens to get
+    /// text for. </param>
+    /// <returns> The text of all tokens within the source interval of {@code ctx}. </returns>
+    virtual std::string getText(RuleContext *ctx) = 0;
+
+    /// <summary>
+    /// Return the text of all tokens in this stream between {@code start} and
+    /// {@code stop} (inclusive).
+    /// <p/>
+    /// If the specified {@code start} or {@code stop} token was not provided by
+    /// this stream, or if the {@code stop} occurred before the {@code start}
+    /// token, the behavior is unspecified.
+    /// <p/>
+    /// For streams which ensure that the <seealso cref="Token#getTokenIndex"/> method is
+    /// accurate for all of its provided tokens, this method behaves like the
+    /// following code. Other streams may implement this method in other ways
+    /// provided the behavior is consistent with this at a high level.
+    ///
+    /// <pre>
+    /// TokenStream stream = ...;
+    /// String text = "";
+    /// for (int i = start.getTokenIndex(); i <= stop.getTokenIndex(); i++) {
+    ///   text += stream.get(i).getText();
+    /// }
+    /// </pre>
+    /// </summary>
+    /// <param name="start"> The first token in the interval to get text for. </param>
+    /// <param name="stop"> The last token in the interval to get text for (inclusive). </param>
+    /// <returns> The text of all tokens lying between the specified {@code start}
+    /// and {@code stop} tokens.
+    /// </returns>
+    /// <exception cref="UnsupportedOperationException"> if this stream does not support
+    /// this method for the specified tokens </exception>
+    virtual std::string getText(Token *start, Token *stop) = 0;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStreamRewriter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStreamRewriter.cpp
new file mode 100755
index 0000000000..1740b1178e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStreamRewriter.cpp
@@ -0,0 +1,425 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Exceptions.h"
+#include "misc/Interval.h"
+#include "Token.h"
+#include "TokenStream.h"
+
+#include "TokenStreamRewriter.h"
+
+using namespace antlr4;
+
+using antlr4::misc::Interval;
+
+TokenStreamRewriter::RewriteOperation::RewriteOperation(TokenStreamRewriter *outerInstance_, size_t index_)
+  : outerInstance(outerInstance_) {
+
+  InitializeInstanceFields();
+  this->index = index_;
+}
+
+TokenStreamRewriter::RewriteOperation::RewriteOperation(TokenStreamRewriter *outerInstance_, size_t index_,
+  const std::string& text_) : outerInstance(outerInstance_) {
+
+  InitializeInstanceFields();
+  this->index = index_;
+  this->text = text_;
+}
+
+TokenStreamRewriter::RewriteOperation::~RewriteOperation()
+{
+}
+
+size_t TokenStreamRewriter::RewriteOperation::execute(std::string * /*buf*/) {
+  return index;
+}
+
+std::string TokenStreamRewriter::RewriteOperation::toString() {
+  std::string opName = "TokenStreamRewriter";
+  size_t dollarIndex = opName.find('$');
+  opName = opName.substr(dollarIndex + 1, opName.length() - (dollarIndex + 1));
+  return "<" + opName + "@" + outerInstance->tokens->get(dollarIndex)->getText() + ":\"" + text + "\">";
+}
+
+void TokenStreamRewriter::RewriteOperation::InitializeInstanceFields() {
+  instructionIndex = 0;
+  index = 0;
+}
+
+TokenStreamRewriter::InsertBeforeOp::InsertBeforeOp(TokenStreamRewriter *outerInstance_, size_t index_, const std::string& text_)
+: RewriteOperation(outerInstance_, index_, text_), outerInstance(outerInstance_) {
+}
+
+size_t TokenStreamRewriter::InsertBeforeOp::execute(std::string *buf) {
+  buf->append(text);
+  if (outerInstance->tokens->get(index)->getType() != Token::EOF) {
+    buf->append(outerInstance->tokens->get(index)->getText());
+  }
+  return index + 1;
+}
+
+TokenStreamRewriter::ReplaceOp::ReplaceOp(TokenStreamRewriter *outerInstance_, size_t from, size_t to, const std::string& text)
+: RewriteOperation(outerInstance_, from, text), outerInstance(outerInstance_) {
+
+  InitializeInstanceFields();
+  lastIndex = to;
+}
+
+size_t TokenStreamRewriter::ReplaceOp::execute(std::string *buf) {
+  buf->append(text);
+  return lastIndex + 1;
+}
+
+std::string TokenStreamRewriter::ReplaceOp::toString() {
+  if (text.empty()) {
+    return "<DeleteOp@" + outerInstance->tokens->get(index)->getText() + ".." + outerInstance->tokens->get(lastIndex)->getText() + ">";
+  }
+  return "<ReplaceOp@" + outerInstance->tokens->get(index)->getText() + ".." + outerInstance->tokens->get(lastIndex)->getText() + ":\"" + text + "\">";
+}
+
+void TokenStreamRewriter::ReplaceOp::InitializeInstanceFields() {
+  lastIndex = 0;
+}
+
+//------------------ TokenStreamRewriter -------------------------------------------------------------------------------
+
+const std::string TokenStreamRewriter::DEFAULT_PROGRAM_NAME = "default";
+
+TokenStreamRewriter::TokenStreamRewriter(TokenStream *tokens_) : tokens(tokens_) {
+  _programs[DEFAULT_PROGRAM_NAME].reserve(PROGRAM_INIT_SIZE);
+}
+
+TokenStreamRewriter::~TokenStreamRewriter() {
+  for (const auto &program : _programs) {
+    for (auto *operation : program.second) {
+      delete operation;
+    }
+  }
+}
+
+TokenStream *TokenStreamRewriter::getTokenStream() {
+  return tokens;
+}
+
+void TokenStreamRewriter::rollback(size_t instructionIndex) {
+  rollback(DEFAULT_PROGRAM_NAME, instructionIndex);
+}
+
+void TokenStreamRewriter::rollback(const std::string &programName, size_t instructionIndex) {
+  std::vector<RewriteOperation*> is = _programs[programName];
+  if (is.size() > 0) {
+    _programs.insert({ programName, std::vector<RewriteOperation*>(is.begin() + MIN_TOKEN_INDEX, is.begin() + instructionIndex) });
+  }
+}
+
+void TokenStreamRewriter::deleteProgram() {
+  deleteProgram(DEFAULT_PROGRAM_NAME);
+}
+
+void TokenStreamRewriter::deleteProgram(const std::string &programName) {
+  rollback(programName, MIN_TOKEN_INDEX);
+}
+
+void TokenStreamRewriter::insertAfter(Token *t, const std::string& text) {
+  insertAfter(DEFAULT_PROGRAM_NAME, t, text);
+}
+
+void TokenStreamRewriter::insertAfter(size_t index, const std::string& text) {
+  insertAfter(DEFAULT_PROGRAM_NAME, index, text);
+}
+
+void TokenStreamRewriter::insertAfter(const std::string &programName, Token *t, const std::string& text) {
+  insertAfter(programName, t->getTokenIndex(), text);
+}
+
+void TokenStreamRewriter::insertAfter(const std::string &programName, size_t index, const std::string& text) {
+  // to insert after, just insert before next index (even if past end)
+  insertBefore(programName, index + 1, text);
+}
+
+void TokenStreamRewriter::insertBefore(Token *t, const std::string& text) {
+  insertBefore(DEFAULT_PROGRAM_NAME, t, text);
+}
+
+void TokenStreamRewriter::insertBefore(size_t index, const std::string& text) {
+  insertBefore(DEFAULT_PROGRAM_NAME, index, text);
+}
+
+void TokenStreamRewriter::insertBefore(const std::string &programName, Token *t, const std::string& text) {
+  insertBefore(programName, t->getTokenIndex(), text);
+}
+
+void TokenStreamRewriter::insertBefore(const std::string &programName, size_t index, const std::string& text) {
+  RewriteOperation *op = new InsertBeforeOp(this, index, text); /* mem-check: deleted in d-tor */
+  std::vector<RewriteOperation*> &rewrites = getProgram(programName);
+  op->instructionIndex = rewrites.size();
+  rewrites.push_back(op);
+}
+
+void TokenStreamRewriter::replace(size_t index, const std::string& text) {
+  replace(DEFAULT_PROGRAM_NAME, index, index, text);
+}
+
+void TokenStreamRewriter::replace(size_t from, size_t to, const std::string& text) {
+  replace(DEFAULT_PROGRAM_NAME, from, to, text);
+}
+
+void TokenStreamRewriter::replace(Token *indexT, const std::string& text) {
+  replace(DEFAULT_PROGRAM_NAME, indexT, indexT, text);
+}
+
+void TokenStreamRewriter::replace(Token *from, Token *to, const std::string& text) {
+  replace(DEFAULT_PROGRAM_NAME, from, to, text);
+}
+
+void TokenStreamRewriter::replace(const std::string &programName, size_t from, size_t to, const std::string& text) {
+  if (from > to || to >= tokens->size()) {
+    throw IllegalArgumentException("replace: range invalid: " + std::to_string(from) + ".." + std::to_string(to) +
+                                   "(size = " + std::to_string(tokens->size()) + ")");
+  }
+  RewriteOperation *op = new ReplaceOp(this, from, to, text); /* mem-check: deleted in d-tor */
+  std::vector<RewriteOperation*> &rewrites = getProgram(programName);
+  op->instructionIndex = rewrites.size();
+  rewrites.push_back(op);
+}
+
+void TokenStreamRewriter::replace(const std::string &programName, Token *from, Token *to, const std::string& text) {
+  replace(programName, from->getTokenIndex(), to->getTokenIndex(), text);
+}
+
+void TokenStreamRewriter::Delete(size_t index) {
+  Delete(DEFAULT_PROGRAM_NAME, index, index);
+}
+
+void TokenStreamRewriter::Delete(size_t from, size_t to) {
+  Delete(DEFAULT_PROGRAM_NAME, from, to);
+}
+
+void TokenStreamRewriter::Delete(Token *indexT) {
+  Delete(DEFAULT_PROGRAM_NAME, indexT, indexT);
+}
+
+void TokenStreamRewriter::Delete(Token *from, Token *to) {
+  Delete(DEFAULT_PROGRAM_NAME, from, to);
+}
+
+void TokenStreamRewriter::Delete(const std::string &programName, size_t from, size_t to) {
+  std::string nullString;
+  replace(programName, from, to, nullString);
+}
+
+void TokenStreamRewriter::Delete(const std::string &programName, Token *from, Token *to) {
+  std::string nullString;
+  replace(programName, from, to, nullString);
+}
+
+size_t TokenStreamRewriter::getLastRewriteTokenIndex() {
+  return getLastRewriteTokenIndex(DEFAULT_PROGRAM_NAME);
+}
+
+size_t TokenStreamRewriter::getLastRewriteTokenIndex(const std::string &programName) {
+  if (_lastRewriteTokenIndexes.find(programName) == _lastRewriteTokenIndexes.end()) {
+    return INVALID_INDEX;
+  }
+  return _lastRewriteTokenIndexes[programName];
+}
+
+void TokenStreamRewriter::setLastRewriteTokenIndex(const std::string &programName, size_t i) {
+  _lastRewriteTokenIndexes.insert({ programName, i });
+}
+
+std::vector<TokenStreamRewriter::RewriteOperation*>& TokenStreamRewriter::getProgram(const std::string &name) {
+  auto iterator = _programs.find(name);
+  if (iterator == _programs.end()) {
+    return initializeProgram(name);
+  }
+  return iterator->second;
+}
+
+std::vector<TokenStreamRewriter::RewriteOperation*>& TokenStreamRewriter::initializeProgram(const std::string &name) {
+  _programs[name].reserve(PROGRAM_INIT_SIZE);
+  return _programs[name];
+}
+
+std::string TokenStreamRewriter::getText() {
+  return getText(DEFAULT_PROGRAM_NAME, Interval(0UL, tokens->size() - 1));
+}
+
+std::string TokenStreamRewriter::getText(std::string programName) {
+  return getText(programName, Interval(0UL, tokens->size() - 1));
+}
+
+std::string TokenStreamRewriter::getText(const Interval &interval) {
+  return getText(DEFAULT_PROGRAM_NAME, interval);
+}
+
+std::string TokenStreamRewriter::getText(const std::string &programName, const Interval &interval) {
+  std::vector<TokenStreamRewriter::RewriteOperation*> &rewrites = _programs[programName];
+  size_t start = interval.a;
+  size_t stop = interval.b;
+
+  // ensure start/end are in range
+  if (stop > tokens->size() - 1) {
+    stop = tokens->size() - 1;
+  }
+  if (start == INVALID_INDEX) {
+    start = 0;
+  }
+
+  if (rewrites.empty() || rewrites.empty()) {
+    return tokens->getText(interval); // no instructions to execute
+  }
+  std::string buf;
+
+  // First, optimize instruction stream
+  std::unordered_map<size_t, TokenStreamRewriter::RewriteOperation*> indexToOp = reduceToSingleOperationPerIndex(rewrites);
+
+  // Walk buffer, executing instructions and emitting tokens
+  size_t i = start;
+  while (i <= stop && i < tokens->size()) {
+    RewriteOperation *op = indexToOp[i];
+    indexToOp.erase(i); // remove so any left have index size-1
+    Token *t = tokens->get(i);
+    if (op == nullptr) {
+      // no operation at that index, just dump token
+      if (t->getType() != Token::EOF) {
+        buf.append(t->getText());
+      }
+      i++; // move to next token
+    }
+    else {
+      i = op->execute(&buf); // execute operation and skip
+    }
+  }
+
+  // include stuff after end if it's last index in buffer
+  // So, if they did an insertAfter(lastValidIndex, "foo"), include
+  // foo if end==lastValidIndex.
+  if (stop == tokens->size() - 1) {
+    // Scan any remaining operations after last token
+    // should be included (they will be inserts).
+    for (auto op : indexToOp) {
+      if (op.second->index >= tokens->size() - 1) {
+        buf.append(op.second->text);
+      }
+    }
+  }
+  return buf;
+}
+
+std::unordered_map<size_t, TokenStreamRewriter::RewriteOperation*> TokenStreamRewriter::reduceToSingleOperationPerIndex(
+  std::vector<TokenStreamRewriter::RewriteOperation*> &rewrites) {
+
+
+  // WALK REPLACES
+  for (size_t i = 0; i < rewrites.size(); ++i) {
+    TokenStreamRewriter::RewriteOperation *op = rewrites[i];
+    ReplaceOp *rop = dynamic_cast<ReplaceOp *>(op);
+    if (rop == nullptr)
+      continue;
+
+    // Wipe prior inserts within range
+    std::vector<InsertBeforeOp *> inserts = getKindOfOps<InsertBeforeOp>(rewrites, i);
+    for (auto *iop : inserts) {
+      if (iop->index == rop->index) {
+        // E.g., insert before 2, delete 2..2; update replace
+        // text to include insert before, kill insert
+        delete rewrites[iop->instructionIndex];
+        rewrites[iop->instructionIndex] = nullptr;
+        rop->text = iop->text + (!rop->text.empty() ? rop->text : "");
+      }
+      else if (iop->index > rop->index && iop->index <= rop->lastIndex) {
+        // delete insert as it's a no-op.
+        delete rewrites[iop->instructionIndex];
+        rewrites[iop->instructionIndex] = nullptr;
+      }
+    }
+    // Drop any prior replaces contained within
+    std::vector<ReplaceOp*> prevReplaces = getKindOfOps<ReplaceOp>(rewrites, i);
+    for (auto *prevRop : prevReplaces) {
+      if (prevRop->index >= rop->index && prevRop->lastIndex <= rop->lastIndex) {
+        // delete replace as it's a no-op.
+        delete rewrites[prevRop->instructionIndex];
+        rewrites[prevRop->instructionIndex] = nullptr;
+        continue;
+      }
+      // throw exception unless disjoint or identical
+      bool disjoint = prevRop->lastIndex < rop->index || prevRop->index > rop->lastIndex;
+      // Delete special case of replace (text==null):
+      // D.i-j.u D.x-y.v    | boundaries overlap    combine to max(min)..max(right)
+      if (prevRop->text.empty() && rop->text.empty() && !disjoint) {
+        delete rewrites[prevRop->instructionIndex];
+        rewrites[prevRop->instructionIndex] = nullptr; // kill first delete
+        rop->index = std::min(prevRop->index, rop->index);
+        rop->lastIndex = std::max(prevRop->lastIndex, rop->lastIndex);
+        std::cout << "new rop " << rop << std::endl;
+      }
+      else if (!disjoint) {
+        throw IllegalArgumentException("replace op boundaries of " + rop->toString() +
+                                       " overlap with previous " + prevRop->toString());
+      }
+    }
+  }
+
+  // WALK INSERTS
+  for (size_t i = 0; i < rewrites.size(); i++) {
+    InsertBeforeOp *iop = dynamic_cast<InsertBeforeOp *>(rewrites[i]);
+    if (iop == nullptr)
+      continue;
+
+    // combine current insert with prior if any at same index
+
+    std::vector<InsertBeforeOp *> prevInserts = getKindOfOps<InsertBeforeOp>(rewrites, i);
+    for (auto *prevIop : prevInserts) {
+      if (prevIop->index == iop->index) { // combine objects
+                                          // convert to strings...we're in process of toString'ing
+                                          // whole token buffer so no lazy eval issue with any templates
+        iop->text = catOpText(&iop->text, &prevIop->text);
+        // delete redundant prior insert
+        delete rewrites[prevIop->instructionIndex];
+        rewrites[prevIop->instructionIndex] = nullptr;
+      }
+    }
+    // look for replaces where iop.index is in range; error
+    std::vector<ReplaceOp*> prevReplaces = getKindOfOps<ReplaceOp>(rewrites, i);
+    for (auto *rop : prevReplaces) {
+      if (iop->index == rop->index) {
+        rop->text = catOpText(&iop->text, &rop->text);
+        delete rewrites[i];
+        rewrites[i] = nullptr; // delete current insert
+        continue;
+      }
+      if (iop->index >= rop->index && iop->index <= rop->lastIndex) {
+        throw IllegalArgumentException("insert op " + iop->toString() + " within boundaries of previous " + rop->toString());
+      }
+    }
+  }
+
+  std::unordered_map<size_t, TokenStreamRewriter::RewriteOperation*> m;
+  for (TokenStreamRewriter::RewriteOperation *op : rewrites) {
+    if (op == nullptr) { // ignore deleted ops
+      continue;
+    }
+    if (m.count(op->index) > 0) {
+      throw RuntimeException("should only be one op per index");
+    }
+    m[op->index] = op;
+  }
+
+  return m;
+}
+
+std::string TokenStreamRewriter::catOpText(std::string *a, std::string *b) {
+  std::string x = "";
+  std::string y = "";
+  if (a != nullptr) {
+    x = *a;
+  }
+  if (b != nullptr) {
+    y = *b;
+  }
+  return x + y;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStreamRewriter.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStreamRewriter.h
new file mode 100755
index 0000000000..db6a863a9f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/TokenStreamRewriter.h
@@ -0,0 +1,295 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+
+  /**
+   * Useful for rewriting out a buffered input token stream after doing some
+   * augmentation or other manipulations on it.
+   *
+   * <p>
+   * You can insert stuff, replace, and delete chunks. Note that the operations
+   * are done lazily--only if you convert the buffer to a {@link String} with
+   * {@link TokenStream#getText()}. This is very efficient because you are not
+   * moving data around all the time. As the buffer of tokens is converted to
+   * strings, the {@link #getText()} method(s) scan the input token stream and
+   * check to see if there is an operation at the current index. If so, the
+   * operation is done and then normal {@link String} rendering continues on the
+   * buffer. This is like having multiple Turing machine instruction streams
+   * (programs) operating on a single input tape. :)</p>
+   *
+   * <p>
+   * This rewriter makes no modifications to the token stream. It does not ask the
+   * stream to fill itself up nor does it advance the input cursor. The token
+   * stream {@link TokenStream#index()} will return the same value before and
+   * after any {@link #getText()} call.</p>
+   *
+   * <p>
+   * The rewriter only works on tokens that you have in the buffer and ignores the
+   * current input cursor. If you are buffering tokens on-demand, calling
+   * {@link #getText()} halfway through the input will only do rewrites for those
+   * tokens in the first half of the file.</p>
+   *
+   * <p>
+   * Since the operations are done lazily at {@link #getText}-time, operations do
+   * not screw up the token index values. That is, an insert operation at token
+   * index {@code i} does not change the index values for tokens
+   * {@code i}+1..n-1.</p>
+   *
+   * <p>
+   * Because operations never actually alter the buffer, you may always get the
+   * original token stream back without undoing anything. Since the instructions
+   * are queued up, you can easily simulate transactions and roll back any changes
+   * if there is an error just by removing instructions. For example,</p>
+   *
+   * <pre>
+   * CharStream input = new ANTLRFileStream("input");
+   * TLexer lex = new TLexer(input);
+   * CommonTokenStream tokens = new CommonTokenStream(lex);
+   * T parser = new T(tokens);
+   * TokenStreamRewriter rewriter = new TokenStreamRewriter(tokens);
+   * parser.startRule();
+   * </pre>
+   *
+   * <p>
+   * Then in the rules, you can execute (assuming rewriter is visible):</p>
+   *
+   * <pre>
+   * Token t,u;
+   * ...
+   * rewriter.insertAfter(t, "text to put after t");}
+   * rewriter.insertAfter(u, "text after u");}
+   * System.out.println(rewriter.getText());
+   * </pre>
+   *
+   * <p>
+   * You can also have multiple "instruction streams" and get multiple rewrites
+   * from a single pass over the input. Just name the instruction streams and use
+   * that name again when printing the buffer. This could be useful for generating
+   * a C file and also its header file--all from the same buffer:</p>
+   *
+   * <pre>
+   * rewriter.insertAfter("pass1", t, "text to put after t");}
+   * rewriter.insertAfter("pass2", u, "text after u");}
+   * System.out.println(rewriter.getText("pass1"));
+   * System.out.println(rewriter.getText("pass2"));
+   * </pre>
+   *
+   * <p>
+   * If you don't use named rewrite streams, a "default" stream is used as the
+   * first example shows.</p>
+   */
+  class ANTLR4CPP_PUBLIC TokenStreamRewriter {
+  public:
+    static const std::string DEFAULT_PROGRAM_NAME;
+    static constexpr size_t PROGRAM_INIT_SIZE = 100;
+    static constexpr size_t MIN_TOKEN_INDEX = 0;
+
+    TokenStreamRewriter(TokenStream *tokens);
+    virtual ~TokenStreamRewriter();
+
+    TokenStream *getTokenStream();
+
+    virtual void rollback(size_t instructionIndex);
+
+    /// Rollback the instruction stream for a program so that
+    /// the indicated instruction (via instructionIndex) is no
+    /// longer in the stream.  UNTESTED!
+    virtual void rollback(const std::string &programName, size_t instructionIndex);
+
+    virtual void deleteProgram();
+
+    /// Reset the program so that no instructions exist.
+    virtual void deleteProgram(const std::string &programName);
+    virtual void insertAfter(Token *t, const std::string& text);
+    virtual void insertAfter(size_t index, const std::string& text);
+    virtual void insertAfter(const std::string &programName, Token *t, const std::string& text);
+    virtual void insertAfter(const std::string &programName, size_t index, const std::string& text);
+
+    virtual void insertBefore(Token *t, const std::string& text);
+    virtual void insertBefore(size_t index, const std::string& text);
+    virtual void insertBefore(const std::string &programName, Token *t, const std::string& text);
+    virtual void insertBefore(const std::string &programName, size_t index, const std::string& text);
+
+    virtual void replace(size_t index, const std::string& text);
+    virtual void replace(size_t from, size_t to, const std::string& text);
+    virtual void replace(Token *indexT, const std::string& text);
+    virtual void replace(Token *from, Token *to, const std::string& text);
+    virtual void replace(const std::string &programName, size_t from, size_t to, const std::string& text);
+    virtual void replace(const std::string &programName, Token *from, Token *to, const std::string& text);
+
+    virtual void Delete(size_t index);
+    virtual void Delete(size_t from, size_t to);
+    virtual void Delete(Token *indexT);
+    virtual void Delete(Token *from, Token *to);
+    virtual void Delete(const std::string &programName, size_t from, size_t to);
+    virtual void Delete(const std::string &programName, Token *from, Token *to);
+
+    virtual size_t getLastRewriteTokenIndex();
+
+    /// Return the text from the original tokens altered per the
+    /// instructions given to this rewriter.
+    virtual std::string getText();
+
+    /** Return the text from the original tokens altered per the
+     *  instructions given to this rewriter in programName.
+     */
+    std::string getText(std::string programName);
+
+    /// Return the text associated with the tokens in the interval from the
+    /// original token stream but with the alterations given to this rewriter.
+    /// The interval refers to the indexes in the original token stream.
+    /// We do not alter the token stream in any way, so the indexes
+    /// and intervals are still consistent. Includes any operations done
+    /// to the first and last token in the interval. So, if you did an
+    /// insertBefore on the first token, you would get that insertion.
+    /// The same is true if you do an insertAfter the stop token.
+    virtual std::string getText(const misc::Interval &interval);
+
+    virtual std::string getText(const std::string &programName, const misc::Interval &interval);
+
+  protected:
+    class RewriteOperation {
+    public:
+      /// What index into rewrites List are we?
+      size_t index;
+      std::string text;
+
+      /// Token buffer index.
+      size_t instructionIndex;
+
+      RewriteOperation(TokenStreamRewriter *outerInstance, size_t index);
+      RewriteOperation(TokenStreamRewriter *outerInstance, size_t index, const std::string& text);
+      virtual ~RewriteOperation();
+
+      /// Execute the rewrite operation by possibly adding to the buffer.
+      /// Return the index of the next token to operate on.
+
+      virtual size_t execute(std::string *buf);
+      virtual std::string toString();
+
+    private:
+      TokenStreamRewriter *const outerInstance;
+      void InitializeInstanceFields();
+    };
+
+    class InsertBeforeOp : public RewriteOperation {
+    private:
+      TokenStreamRewriter *const outerInstance;
+
+    public:
+      InsertBeforeOp(TokenStreamRewriter *outerInstance, size_t index, const std::string& text);
+
+      virtual size_t execute(std::string *buf) override;
+    };
+
+    class ReplaceOp : public RewriteOperation {
+    private:
+      TokenStreamRewriter *const outerInstance;
+
+    public:
+      size_t lastIndex;
+
+      ReplaceOp(TokenStreamRewriter *outerInstance, size_t from, size_t to, const std::string& text);
+      virtual size_t execute(std::string *buf) override;
+      virtual std::string toString() override;
+
+    private:
+      void InitializeInstanceFields();
+    };
+
+    /// Our source stream
+    TokenStream *const tokens;
+
+    /// You may have multiple, named streams of rewrite operations.
+    /// I'm calling these things "programs."
+    /// Maps String (name) -> rewrite (List)
+    std::map<std::string, std::vector<RewriteOperation*>> _programs;
+
+    /// <summary>
+    /// Map String (program name) -> Integer index </summary>
+    std::map<std::string, size_t> _lastRewriteTokenIndexes;
+    virtual size_t getLastRewriteTokenIndex(const std::string &programName);
+    virtual void setLastRewriteTokenIndex(const std::string &programName, size_t i);
+    virtual std::vector<RewriteOperation*>& getProgram(const std::string &name);
+
+    /// <summary>
+    /// We need to combine operations and report invalid operations (like
+    ///  overlapping replaces that are not completed nested).  Inserts to
+    ///  same index need to be combined etc...   Here are the cases:
+    ///
+    ///  I.i.u I.j.v                                leave alone, nonoverlapping
+    ///  I.i.u I.i.v                                combine: Iivu
+    ///
+    ///  R.i-j.u R.x-y.v    | i-j in x-y            delete first R
+    ///  R.i-j.u R.i-j.v                            delete first R
+    ///  R.i-j.u R.x-y.v    | x-y in i-j            ERROR
+    ///  R.i-j.u R.x-y.v    | boundaries overlap    ERROR
+    ///
+    ///  Delete special case of replace (text==null):
+    ///  D.i-j.u D.x-y.v    | boundaries overlap    combine to max(min)..max(right)
+    ///
+    ///  I.i.u R.x-y.v | i in (x+1)-y           delete I (since insert before
+    ///                                         we're not deleting i)
+    ///  I.i.u R.x-y.v | i not in (x+1)-y       leave alone, nonoverlapping
+    ///  R.x-y.v I.i.u | i in x-y               ERROR
+    ///  R.x-y.v I.x.u                          R.x-y.uv (combine, delete I)
+    ///  R.x-y.v I.i.u | i not in x-y           leave alone, nonoverlapping
+    ///
+    ///  I.i.u = insert u before op @ index i
+    ///  R.x-y.u = replace x-y indexed tokens with u
+    ///
+    ///  First we need to examine replaces.  For any replace op:
+    ///
+    ///         1. wipe out any insertions before op within that range.
+    ///     2. Drop any replace op before that is contained completely within
+    ///         that range.
+    ///     3. Throw exception upon boundary overlap with any previous replace.
+    ///
+    ///  Then we can deal with inserts:
+    ///
+    ///         1. for any inserts to same index, combine even if not adjacent.
+    ///         2. for any prior replace with same left boundary, combine this
+    ///         insert with replace and delete this replace.
+    ///         3. throw exception if index in same range as previous replace
+    ///
+    ///  Don't actually delete; make op null in list. Easier to walk list.
+    ///  Later we can throw as we add to index -> op map.
+    ///
+    ///  Note that I.2 R.2-2 will wipe out I.2 even though, technically, the
+    ///  inserted stuff would be before the replace range.  But, if you
+    ///  add tokens in front of a method body '{' and then delete the method
+    ///  body, I think the stuff before the '{' you added should disappear too.
+    ///
+    ///  Return a map from token index to operation.
+    /// </summary>
+    virtual std::unordered_map<size_t, RewriteOperation*> reduceToSingleOperationPerIndex(std::vector<RewriteOperation*> &rewrites);
+
+    virtual std::string catOpText(std::string *a, std::string *b);
+
+    /// Get all operations before an index of a particular kind.
+    template <typename T>
+    std::vector<T *> getKindOfOps(std::vector<RewriteOperation *> rewrites, size_t before) {
+      std::vector<T *> ops;
+      for (size_t i = 0; i < before && i < rewrites.size(); i++) {
+        T *op = dynamic_cast<T *>(rewrites[i]);
+        if (op == nullptr) { // ignore deleted or non matching entries
+          continue;
+        }
+        ops.push_back(op);
+      }
+      return ops;
+    }
+
+  private:
+    std::vector<RewriteOperation *>& initializeProgram(const std::string &name);
+
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedCharStream.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedCharStream.cpp
new file mode 100755
index 0000000000..fd234de099
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedCharStream.cpp
@@ -0,0 +1,208 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/Interval.h"
+#include "Exceptions.h"
+#include "support/Utf8.h"
+
+#include "UnbufferedCharStream.h"
+
+using namespace antlrcpp;
+using namespace antlr4;
+using namespace antlr4::misc;
+
+UnbufferedCharStream::UnbufferedCharStream(std::wistream &input)
+    : _p(0), _numMarkers(0), _lastChar(0), _lastCharBufferStart(0), _currentCharIndex(0), _input(input) {
+  // The vector's size is what used to be n in Java code.
+  fill(1); // prime
+}
+
+void UnbufferedCharStream::consume() {
+  if (LA(1) == EOF) {
+    throw IllegalStateException("cannot consume EOF");
+  }
+
+  // buf always has at least data[p==0] in this method due to ctor
+  _lastChar = _data[_p]; // track last char for LA(-1)
+
+  if (_p == _data.size() - 1 && _numMarkers == 0) {
+    size_t capacity = _data.capacity();
+    _data.clear();
+    _data.reserve(capacity);
+
+    _p = 0;
+    _lastCharBufferStart = _lastChar;
+  } else {
+    _p++;
+  }
+
+  _currentCharIndex++;
+  sync(1);
+}
+
+void UnbufferedCharStream::sync(size_t want) {
+  if (_p + want <= _data.size()) // Already enough data loaded?
+    return;
+
+  fill(_p + want - _data.size());
+}
+
+size_t UnbufferedCharStream::fill(size_t n) {
+  for (size_t i = 0; i < n; i++) {
+    if (_data.size() > 0 && _data.back() == 0xFFFF) {
+      return i;
+    }
+
+    try {
+      char32_t c = nextChar();
+      add(c);
+#if defined(_MSC_FULL_VER) && _MSC_FULL_VER < 190023026
+    } catch (IOException &ioe) {
+      // throw_with_nested is not available before VS 2015.
+      throw ioe;
+#else
+    } catch (IOException & /*ioe*/) {
+      std::throw_with_nested(RuntimeException());
+#endif
+    }
+  }
+
+  return n;
+}
+
+char32_t UnbufferedCharStream::nextChar()  {
+  return _input.get();
+}
+
+void UnbufferedCharStream::add(char32_t c) {
+  _data += c;
+}
+
+size_t UnbufferedCharStream::LA(ssize_t i) {
+  if (i == -1) { // special case
+    return _lastChar;
+  }
+
+  // We can look back only as many chars as we have buffered.
+  ssize_t index = static_cast<ssize_t>(_p) + i - 1;
+  if (index < 0) {
+    throw IndexOutOfBoundsException();
+  }
+
+  if (i > 0) {
+    sync(static_cast<size_t>(i)); // No need to sync if we look back.
+  }
+  if (static_cast<size_t>(index) >= _data.size()) {
+    return EOF;
+  }
+
+  if (_data[static_cast<size_t>(index)] == std::char_traits<wchar_t>::eof()) {
+    return EOF;
+  }
+
+  return _data[static_cast<size_t>(index)];
+}
+
+ssize_t UnbufferedCharStream::mark() {
+  if (_numMarkers == 0) {
+    _lastCharBufferStart = _lastChar;
+  }
+
+  ssize_t mark = -static_cast<ssize_t>(_numMarkers) - 1;
+  _numMarkers++;
+  return mark;
+}
+
+void UnbufferedCharStream::release(ssize_t marker) {
+  ssize_t expectedMark = -static_cast<ssize_t>(_numMarkers);
+  if (marker != expectedMark) {
+    throw IllegalStateException("release() called with an invalid marker.");
+  }
+
+  _numMarkers--;
+  if (_numMarkers == 0 && _p > 0) {
+    _data.erase(0, _p);
+    _p = 0;
+    _lastCharBufferStart = _lastChar;
+  }
+}
+
+size_t UnbufferedCharStream::index() {
+  return _currentCharIndex;
+}
+
+void UnbufferedCharStream::seek(size_t index) {
+  if (index == _currentCharIndex) {
+    return;
+  }
+
+  if (index > _currentCharIndex) {
+    sync(index - _currentCharIndex);
+    index = std::min(index, getBufferStartIndex() + _data.size() - 1);
+  }
+
+  // index == to bufferStartIndex should set p to 0
+  ssize_t i = static_cast<ssize_t>(index) - static_cast<ssize_t>(getBufferStartIndex());
+  if (i < 0) {
+    throw IllegalArgumentException(std::string("cannot seek to negative index ") + std::to_string(index));
+  } else if (i >= static_cast<ssize_t>(_data.size())) {
+    throw UnsupportedOperationException("Seek to index outside buffer: " + std::to_string(index) +
+                                        " not in " + std::to_string(getBufferStartIndex()) + ".." +
+                                        std::to_string(getBufferStartIndex() + _data.size()));
+  }
+
+  _p = static_cast<size_t>(i);
+  _currentCharIndex = index;
+  if (_p == 0) {
+    _lastChar = _lastCharBufferStart;
+  } else {
+    _lastChar = _data[_p - 1];
+  }
+}
+
+size_t UnbufferedCharStream::size() {
+  throw UnsupportedOperationException("Unbuffered stream cannot know its size");
+}
+
+std::string UnbufferedCharStream::getSourceName() const {
+  if (name.empty()) {
+    return UNKNOWN_SOURCE_NAME;
+  }
+
+  return name;
+}
+
+std::string UnbufferedCharStream::getText(const misc::Interval &interval) {
+  if (interval.a < 0 || interval.b < interval.a - 1) {
+    throw IllegalArgumentException("invalid interval");
+  }
+
+  size_t bufferStartIndex = getBufferStartIndex();
+  if (!_data.empty() && _data.back() == 0xFFFF) {
+    if (interval.a + interval.length() > bufferStartIndex + _data.size()) {
+      throw IllegalArgumentException("the interval extends past the end of the stream");
+    }
+  }
+
+  if (interval.a < static_cast<ssize_t>(bufferStartIndex) || interval.b >= ssize_t(bufferStartIndex + _data.size())) {
+    throw UnsupportedOperationException("interval " + interval.toString() + " outside buffer: " +
+      std::to_string(bufferStartIndex) + ".." + std::to_string(bufferStartIndex + _data.size() - 1));
+  }
+  // convert from absolute to local index
+  size_t i = interval.a - bufferStartIndex;
+  auto maybeUtf8 = Utf8::strictEncode(std::u32string_view(_data).substr(i, interval.length()));
+  if (!maybeUtf8.has_value()) {
+    throw IllegalArgumentException("Unbuffered stream contains invalid Unicode code points");
+  }
+  return std::move(maybeUtf8).value();
+}
+
+std::string UnbufferedCharStream::toString() const {
+  throw UnsupportedOperationException("Unbuffered stream cannot be materialized to a string");
+}
+
+size_t UnbufferedCharStream::getBufferStartIndex() const {
+  return _currentCharIndex - _p;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedCharStream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedCharStream.h
new file mode 100755
index 0000000000..a65c6ca054
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedCharStream.h
@@ -0,0 +1,117 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "CharStream.h"
+
+namespace antlr4 {
+
+  /// Do not buffer up the entire char stream. It does keep a small buffer
+  /// for efficiency and also buffers while a mark exists (set by the
+  /// lookahead prediction in parser). "Unbuffered" here refers to fact
+  /// that it doesn't buffer all data, not that's it's on demand loading of char.
+  class ANTLR4CPP_PUBLIC UnbufferedCharStream : public CharStream {
+  public:
+    /// The name or source of this char stream.
+    std::string name;
+
+    explicit UnbufferedCharStream(std::wistream &input);
+
+    void consume() override;
+    size_t LA(ssize_t i) override;
+
+    /// <summary>
+    /// Return a marker that we can release later.
+    /// <p/>
+    /// The specific marker value used for this class allows for some level of
+    /// protection against misuse where {@code seek()} is called on a mark or
+    /// {@code release()} is called in the wrong order.
+    /// </summary>
+    ssize_t mark() override;
+
+    /// <summary>
+    /// Decrement number of markers, resetting buffer if we hit 0. </summary>
+    /// <param name="marker"> </param>
+    void release(ssize_t marker) override;
+    size_t index() override;
+
+    /// <summary>
+    /// Seek to absolute character index, which might not be in the current
+    ///  sliding window.  Move {@code p} to {@code index-bufferStartIndex}.
+    /// </summary>
+    void seek(size_t index) override;
+    size_t size() override;
+    std::string getSourceName() const override;
+    std::string getText(const misc::Interval &interval) override;
+
+    std::string toString() const override;
+
+  protected:
+    /// A moving window buffer of the data being scanned. While there's a marker,
+    /// we keep adding to buffer. Otherwise, <seealso cref="#consume consume()"/> resets so
+    /// we start filling at index 0 again.
+    // UTF-32 encoded.
+    std::u32string _data;
+    typedef char32_t storage_type;
+
+    /// <summary>
+    /// 0..n-1 index into <seealso cref="#data data"/> of next character.
+    /// <p/>
+    /// The {@code LA(1)} character is {@code data[p]}. If {@code p == n}, we are
+    /// out of buffered characters.
+    /// </summary>
+    size_t _p;
+
+    /// <summary>
+    /// Count up with <seealso cref="#mark mark()"/> and down with
+    /// <seealso cref="#release release()"/>. When we {@code release()} the last mark,
+    /// {@code numMarkers} reaches 0 and we reset the buffer. Copy
+    /// {@code data[p]..data[n-1]} to {@code data[0]..data[(n-1)-p]}.
+    /// </summary>
+    size_t _numMarkers;
+
+    /// This is the {@code LA(-1)} character for the current position.
+    size_t _lastChar; // UTF-32
+
+    /// <summary>
+    /// When {@code numMarkers > 0}, this is the {@code LA(-1)} character for the
+    /// first character in <seealso cref="#data data"/>. Otherwise, this is unspecified.
+    /// </summary>
+    size_t _lastCharBufferStart; // UTF-32
+
+    /// <summary>
+    /// Absolute character index. It's the index of the character about to be
+    /// read via {@code LA(1)}. Goes from 0 to the number of characters in the
+    /// entire stream, although the stream size is unknown before the end is
+    /// reached.
+    /// </summary>
+    size_t _currentCharIndex;
+
+    std::wistream &_input;
+
+    /// <summary>
+    /// Make sure we have 'want' elements from current position <seealso cref="#p p"/>.
+    /// Last valid {@code p} index is {@code data.length-1}. {@code p+need-1} is
+    /// the char index 'need' elements ahead. If we need 1 element,
+    /// {@code (p+1-1)==p} must be less than {@code data.length}.
+    /// </summary>
+    virtual void sync(size_t want);
+
+    /// <summary>
+    /// Add {@code n} characters to the buffer. Returns the number of characters
+    /// actually added to the buffer. If the return value is less than {@code n},
+    /// then EOF was reached before {@code n} characters could be added.
+    /// </summary>
+    virtual size_t fill(size_t n);
+
+    /// Override to provide different source of characters than
+    /// <seealso cref="#input input"/>.
+    virtual char32_t nextChar();
+    virtual void add(char32_t c);
+    size_t getBufferStartIndex() const;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedTokenStream.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedTokenStream.cpp
new file mode 100755
index 0000000000..98e952a0a4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedTokenStream.cpp
@@ -0,0 +1,270 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Token.h"
+#include "Exceptions.h"
+#include "assert.h"
+#include "TokenSource.h"
+#include "support/Arrays.h"
+#include "misc/Interval.h"
+#include "RuleContext.h"
+#include "WritableToken.h"
+
+#include "UnbufferedTokenStream.h"
+
+using namespace antlr4;
+
+UnbufferedTokenStream::UnbufferedTokenStream(TokenSource *tokenSource) : UnbufferedTokenStream(tokenSource, 256) {
+}
+
+UnbufferedTokenStream::UnbufferedTokenStream(TokenSource *tokenSource, int /*bufferSize*/)
+  : _tokenSource(tokenSource), _lastToken(nullptr), _lastTokenBufferStart(nullptr)
+{
+  InitializeInstanceFields();
+  fill(1); // prime the pump
+}
+
+UnbufferedTokenStream::~UnbufferedTokenStream() {
+}
+
+Token* UnbufferedTokenStream::get(size_t i) const
+{ // get absolute index
+  size_t bufferStartIndex = getBufferStartIndex();
+  if (i < bufferStartIndex || i >= bufferStartIndex + _tokens.size()) {
+    throw IndexOutOfBoundsException(std::string("get(") + std::to_string(i) + std::string(") outside buffer: ")
+      + std::to_string(bufferStartIndex) + std::string("..") + std::to_string(bufferStartIndex + _tokens.size()));
+  }
+  return _tokens[i - bufferStartIndex].get();
+}
+
+Token* UnbufferedTokenStream::LT(ssize_t i)
+{
+  if (i == -1) {
+    return _lastToken;
+  }
+
+  sync(i);
+  ssize_t index = static_cast<ssize_t>(_p) + i - 1;
+  if (index < 0) {
+    throw IndexOutOfBoundsException(std::string("LT(") + std::to_string(i) + std::string(") gives negative index"));
+  }
+
+  if (index >= static_cast<ssize_t>(_tokens.size())) {
+    assert(_tokens.size() > 0 && _tokens.back()->getType() == EOF);
+    return _tokens.back().get();
+  }
+
+  return _tokens[static_cast<size_t>(index)].get();
+}
+
+size_t UnbufferedTokenStream::LA(ssize_t i)
+{
+  return LT(i)->getType();
+}
+
+TokenSource* UnbufferedTokenStream::getTokenSource() const
+{
+  return _tokenSource;
+}
+
+std::string UnbufferedTokenStream::getText()
+{
+  return "";
+}
+
+std::string UnbufferedTokenStream::getText(RuleContext* ctx)
+{
+  return getText(ctx->getSourceInterval());
+}
+
+std::string UnbufferedTokenStream::getText(Token *start, Token *stop)
+{
+  return getText(misc::Interval(start->getTokenIndex(), stop->getTokenIndex()));
+}
+
+void UnbufferedTokenStream::consume()
+{
+  if (LA(1) == EOF) {
+    throw IllegalStateException("cannot consume EOF");
+  }
+
+  // buf always has at least tokens[p==0] in this method due to ctor
+  _lastToken = _tokens[_p].get(); // track last token for LT(-1)
+
+  // if we're at last token and no markers, opportunity to flush buffer
+  if (_p == _tokens.size() - 1 && _numMarkers == 0) {
+    _tokens.clear();
+    _p = 0;
+    _lastTokenBufferStart = _lastToken;
+  } else {
+    ++_p;
+  }
+
+  ++_currentTokenIndex;
+  sync(1);
+}
+
+/// <summary>
+/// Make sure we have 'need' elements from current position <seealso cref="#p p"/>. Last valid
+///  {@code p} index is {@code tokens.length-1}.  {@code p+need-1} is the tokens index 'need' elements
+///  ahead.  If we need 1 element, {@code (p+1-1)==p} must be less than {@code tokens.length}.
+/// </summary>
+void UnbufferedTokenStream::sync(ssize_t want)
+{
+  ssize_t need = (static_cast<ssize_t>(_p) + want - 1) - static_cast<ssize_t>(_tokens.size()) + 1; // how many more elements we need?
+  if (need > 0) {
+    fill(static_cast<size_t>(need));
+  }
+}
+
+/// <summary>
+/// Add {@code n} elements to the buffer. Returns the number of tokens
+/// actually added to the buffer. If the return value is less than {@code n},
+/// then EOF was reached before {@code n} tokens could be added.
+/// </summary>
+size_t UnbufferedTokenStream::fill(size_t n)
+{
+  for (size_t i = 0; i < n; i++) {
+    if (_tokens.size() > 0 && _tokens.back()->getType() == EOF) {
+      return i;
+    }
+
+    add(_tokenSource->nextToken());
+  }
+
+  return n;
+}
+
+void UnbufferedTokenStream::add(std::unique_ptr<Token> t)
+{
+  WritableToken *writable = dynamic_cast<WritableToken *>(t.get());
+  if (writable != nullptr) {
+    writable->setTokenIndex(int(getBufferStartIndex() + _tokens.size()));
+  }
+
+  _tokens.push_back(std::move(t));
+}
+
+/// <summary>
+/// Return a marker that we can release later.
+/// <p/>
+/// The specific marker value used for this class allows for some level of
+/// protection against misuse where {@code seek()} is called on a mark or
+/// {@code release()} is called in the wrong order.
+/// </summary>
+ssize_t UnbufferedTokenStream::mark()
+{
+  if (_numMarkers == 0) {
+    _lastTokenBufferStart = _lastToken;
+  }
+
+  int mark = -_numMarkers - 1;
+  _numMarkers++;
+  return mark;
+}
+
+void UnbufferedTokenStream::release(ssize_t marker)
+{
+  ssize_t expectedMark = -_numMarkers;
+  if (marker != expectedMark) {
+    throw IllegalStateException("release() called with an invalid marker.");
+  }
+
+  _numMarkers--;
+  if (_numMarkers == 0) { // can we release buffer?
+    if (_p > 0) {
+      // Copy tokens[p]..tokens[n-1] to tokens[0]..tokens[(n-1)-p], reset ptrs
+      // p is last valid token; move nothing if p==n as we have no valid char
+      _tokens.erase(_tokens.begin(), _tokens.begin() + static_cast<ssize_t>(_p));
+      _p = 0;
+    }
+
+    _lastTokenBufferStart = _lastToken;
+  }
+}
+
+size_t UnbufferedTokenStream::index()
+{
+  return _currentTokenIndex;
+}
+
+void UnbufferedTokenStream::seek(size_t index)
+{ // seek to absolute index
+  if (index == _currentTokenIndex) {
+    return;
+  }
+
+  if (index > _currentTokenIndex) {
+    sync(ssize_t(index - _currentTokenIndex));
+    index = std::min(index, getBufferStartIndex() + _tokens.size() - 1);
+  }
+
+  size_t bufferStartIndex = getBufferStartIndex();
+  if (bufferStartIndex > index) {
+    throw IllegalArgumentException(std::string("cannot seek to negative index ") + std::to_string(index));
+  }
+
+  size_t i = index - bufferStartIndex;
+  if (i >= _tokens.size()) {
+    throw UnsupportedOperationException(std::string("seek to index outside buffer: ") + std::to_string(index) +
+      " not in " + std::to_string(bufferStartIndex) + ".." + std::to_string(bufferStartIndex + _tokens.size()));
+  }
+
+  _p = i;
+  _currentTokenIndex = index;
+  if (_p == 0) {
+    _lastToken = _lastTokenBufferStart;
+  } else {
+    _lastToken = _tokens[_p - 1].get();
+  }
+}
+
+size_t UnbufferedTokenStream::size()
+{
+  throw UnsupportedOperationException("Unbuffered stream cannot know its size");
+}
+
+std::string UnbufferedTokenStream::getSourceName() const
+{
+  return _tokenSource->getSourceName();
+}
+
+std::string UnbufferedTokenStream::getText(const misc::Interval &interval)
+{
+  size_t bufferStartIndex = getBufferStartIndex();
+  size_t bufferStopIndex = bufferStartIndex + _tokens.size() - 1;
+
+  size_t start = interval.a;
+  size_t stop = interval.b;
+  if (start < bufferStartIndex || stop > bufferStopIndex) {
+    throw UnsupportedOperationException(std::string("interval ") + interval.toString() +
+      " not in token buffer window: " + std::to_string(bufferStartIndex) + ".." + std::to_string(bufferStopIndex));
+  }
+
+  size_t a = start - bufferStartIndex;
+  size_t b = stop - bufferStartIndex;
+
+  std::stringstream ss;
+  for (size_t i = a; i <= b; i++) {
+    Token *t = _tokens[i].get();
+    if (i > 0)
+      ss << ", ";
+    ss << t->getText();
+  }
+
+  return ss.str();
+}
+
+size_t UnbufferedTokenStream::getBufferStartIndex() const
+{
+  return _currentTokenIndex - _p;
+}
+
+void UnbufferedTokenStream::InitializeInstanceFields()
+{
+  _p = 0;
+  _numMarkers = 0;
+  _currentTokenIndex = 0;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedTokenStream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedTokenStream.h
new file mode 100755
index 0000000000..244cc8d19d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/UnbufferedTokenStream.h
@@ -0,0 +1,115 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "TokenStream.h"
+
+namespace antlr4 {
+
+  class ANTLR4CPP_PUBLIC UnbufferedTokenStream : public TokenStream {
+  public:
+    UnbufferedTokenStream(TokenSource *tokenSource);
+    UnbufferedTokenStream(TokenSource *tokenSource, int bufferSize);
+    UnbufferedTokenStream(const UnbufferedTokenStream& other) = delete;
+    virtual ~UnbufferedTokenStream();
+
+    UnbufferedTokenStream& operator = (const UnbufferedTokenStream& other) = delete;
+
+    virtual Token* get(size_t i) const override;
+    virtual Token* LT(ssize_t i) override;
+    virtual size_t LA(ssize_t i) override;
+
+    virtual TokenSource* getTokenSource() const override;
+
+    virtual std::string getText(const misc::Interval &interval) override;
+    virtual std::string getText() override;
+    virtual std::string getText(RuleContext *ctx) override;
+    virtual std::string getText(Token *start, Token *stop) override;
+
+    virtual void consume() override;
+
+    /// <summary>
+    /// Return a marker that we can release later.
+    /// <p/>
+    /// The specific marker value used for this class allows for some level of
+    /// protection against misuse where {@code seek()} is called on a mark or
+    /// {@code release()} is called in the wrong order.
+    /// </summary>
+    virtual ssize_t mark() override;
+    virtual void release(ssize_t marker) override;
+    virtual size_t index() override;
+    virtual void seek(size_t index) override;
+    virtual size_t size() override;
+    virtual std::string getSourceName() const override;
+
+  protected:
+    /// Make sure we have 'need' elements from current position p. Last valid
+    /// p index is tokens.length - 1.  p + need - 1 is the tokens index 'need' elements
+    /// ahead.  If we need 1 element, (p+1-1)==p must be less than tokens.length.
+    TokenSource *_tokenSource;
+
+    /// <summary>
+    /// A moving window buffer of the data being scanned. While there's a marker,
+    /// we keep adding to buffer. Otherwise, <seealso cref="#consume consume()"/> resets so
+    /// we start filling at index 0 again.
+    /// </summary>
+
+    std::vector<std::unique_ptr<Token>> _tokens;
+
+    /// <summary>
+    /// 0..n-1 index into <seealso cref="#tokens tokens"/> of next token.
+    /// <p/>
+    /// The {@code LT(1)} token is {@code tokens[p]}. If {@code p == n}, we are
+    /// out of buffered tokens.
+    /// </summary>
+    size_t _p;
+
+    /// <summary>
+    /// Count up with <seealso cref="#mark mark()"/> and down with
+    /// <seealso cref="#release release()"/>. When we {@code release()} the last mark,
+    /// {@code numMarkers} reaches 0 and we reset the buffer. Copy
+    /// {@code tokens[p]..tokens[n-1]} to {@code tokens[0]..tokens[(n-1)-p]}.
+    /// </summary>
+    int _numMarkers;
+
+    /// <summary>
+    /// This is the {@code LT(-1)} token for the current position.
+    /// </summary>
+    Token *_lastToken;
+
+    /// <summary>
+    /// When {@code numMarkers > 0}, this is the {@code LT(-1)} token for the
+    /// first token in <seealso cref="#tokens"/>. Otherwise, this is {@code null}.
+    /// </summary>
+    Token *_lastTokenBufferStart;
+
+    /// <summary>
+    /// Absolute token index. It's the index of the token about to be read via
+    /// {@code LT(1)}. Goes from 0 to the number of tokens in the entire stream,
+    /// although the stream size is unknown before the end is reached.
+    /// <p/>
+    /// This value is used to set the token indexes if the stream provides tokens
+    /// that implement <seealso cref="WritableToken"/>.
+    /// </summary>
+    size_t _currentTokenIndex;
+
+    virtual void sync(ssize_t want);
+
+    /// <summary>
+    /// Add {@code n} elements to the buffer. Returns the number of tokens
+    /// actually added to the buffer. If the return value is less than {@code n},
+    /// then EOF was reached before {@code n} tokens could be added.
+    /// </summary>
+    virtual size_t fill(size_t n);
+    virtual void add(std::unique_ptr<Token> t);
+
+    size_t getBufferStartIndex() const;
+
+  private:
+    void InitializeInstanceFields();
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Version.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Version.h
new file mode 100644
index 0000000000..f87ba61f10
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Version.h
@@ -0,0 +1,42 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#pragma once
+
+#include "antlr4-common.h"
+
+#define ANTLRCPP_VERSION_MAJOR 4
+#define ANTLRCPP_VERSION_MINOR 13
+#define ANTLRCPP_VERSION_PATCH 1
+
+#define ANTLRCPP_MAKE_VERSION(major, minor, patch) ((major) * 100000 + (minor) * 1000 + (patch))
+
+#define ANTLRCPP_VERSION \
+  ANTLRCPP_MAKE_VERSION(ANTLR4CPP_VERSION_MAJOR, ANTLR4CPP_VERSION_MINOR, ANTLR4CPP_VERSION_PATCH)
+
+#define ANTLRCPP_VERSION_STRING \
+  ANTLR4CPP_STRINGIFY(ANTLR4CPP_VERSION_MAJOR) "." \
+  ANTLR4CPP_STRINGIFY(ANTLR4CPP_VERSION_MINOR) "." \
+  ANTLR4CPP_STRINGIFY(ANTLR4CPP_VERSION_PATCH)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Vocabulary.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Vocabulary.cpp
new file mode 100755
index 0000000000..9596a94e45
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Vocabulary.cpp
@@ -0,0 +1,79 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Token.h"
+
+#include "Vocabulary.h"
+
+using namespace antlr4::dfa;
+
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wdeprecated-declarations"
+#ifdef _MSC_VER
+#pragma warning(push)
+#pragma warning(disable : 4996)
+#endif
+
+const Vocabulary Vocabulary::EMPTY_VOCABULARY;
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif
+#pragma clang diagnostic pop
+#pragma GCC diagnostic pop
+
+Vocabulary::Vocabulary(std::vector<std::string> literalNames, std::vector<std::string> symbolicNames)
+: Vocabulary(std::move(literalNames), std::move(symbolicNames), {}) {
+}
+
+Vocabulary::Vocabulary(std::vector<std::string> literalNames,
+  std::vector<std::string> symbolicNames, std::vector<std::string> displayNames)
+  : _literalNames(std::move(literalNames)), _symbolicNames(std::move(symbolicNames)), _displayNames(std::move(displayNames)),
+    _maxTokenType(std::max(_displayNames.size(), std::max(_literalNames.size(), _symbolicNames.size())) - 1) {
+  // See note here on -1 part: https://github.com/antlr/antlr4/pull/1146
+}
+
+std::string_view Vocabulary::getLiteralName(size_t tokenType) const {
+  if (tokenType < _literalNames.size()) {
+    return _literalNames[tokenType];
+  }
+
+  return "";
+}
+
+std::string_view Vocabulary::getSymbolicName(size_t tokenType) const {
+  if (tokenType == Token::EOF) {
+    return "EOF";
+  }
+
+  if (tokenType < _symbolicNames.size()) {
+    return _symbolicNames[tokenType];
+  }
+
+  return "";
+}
+
+std::string Vocabulary::getDisplayName(size_t tokenType) const {
+  if (tokenType < _displayNames.size()) {
+    std::string_view displayName = _displayNames[tokenType];
+    if (!displayName.empty()) {
+      return std::string(displayName);
+    }
+  }
+
+  std::string_view literalName = getLiteralName(tokenType);
+  if (!literalName.empty()) {
+    return std::string(literalName);
+  }
+
+  std::string_view symbolicName = getSymbolicName(tokenType);
+  if (!symbolicName.empty()) {
+    return std::string(symbolicName);
+  }
+
+  return std::to_string(tokenType);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Vocabulary.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Vocabulary.h
new file mode 100755
index 0000000000..af5b243880
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/Vocabulary.h
@@ -0,0 +1,177 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace dfa {
+
+  /// This class provides a default implementation of the <seealso cref="Vocabulary"/>
+  /// interface.
+  class ANTLR4CPP_PUBLIC Vocabulary final {
+  public:
+    /// Gets an empty <seealso cref="Vocabulary"/> instance.
+    ///
+    /// <para>
+    /// No literal or symbol names are assigned to token types, so
+    /// <seealso cref="#getDisplayName(int)"/> returns the numeric value for all tokens
+    /// except <seealso cref="Token#EOF"/>.</para>
+    [[deprecated("Use the default constructor of Vocabulary instead.")]] static const Vocabulary EMPTY_VOCABULARY;
+
+    Vocabulary() {}
+
+    Vocabulary(const Vocabulary&) = default;
+
+    /// <summary>
+    /// Constructs a new instance of <seealso cref="Vocabulary"/> from the specified
+    /// literal and symbolic token names.
+    /// </summary>
+    /// <param name="literalNames"> The literal names assigned to tokens, or {@code null}
+    /// if no literal names are assigned. </param>
+    /// <param name="symbolicNames"> The symbolic names assigned to tokens, or
+    /// {@code null} if no symbolic names are assigned.
+    /// </param>
+    /// <seealso cref= #getLiteralName(int) </seealso>
+    /// <seealso cref= #getSymbolicName(int) </seealso>
+    Vocabulary(std::vector<std::string> literalNames, std::vector<std::string> symbolicNames);
+
+    /// <summary>
+    /// Constructs a new instance of <seealso cref="Vocabulary"/> from the specified
+    /// literal, symbolic, and display token names.
+    /// </summary>
+    /// <param name="literalNames"> The literal names assigned to tokens, or {@code null}
+    /// if no literal names are assigned. </param>
+    /// <param name="symbolicNames"> The symbolic names assigned to tokens, or
+    /// {@code null} if no symbolic names are assigned. </param>
+    /// <param name="displayNames"> The display names assigned to tokens, or {@code null}
+    /// to use the values in {@code literalNames} and {@code symbolicNames} as
+    /// the source of display names, as described in
+    /// <seealso cref="#getDisplayName(int)"/>.
+    /// </param>
+    /// <seealso cref= #getLiteralName(int) </seealso>
+    /// <seealso cref= #getSymbolicName(int) </seealso>
+    /// <seealso cref= #getDisplayName(int) </seealso>
+    Vocabulary(std::vector<std::string> literalNames, std::vector<std::string> symbolicNames,
+               std::vector<std::string> displayNames);
+
+    /// <summary>
+    /// Returns the highest token type value. It can be used to iterate from
+    /// zero to that number, inclusively, thus querying all stored entries. </summary>
+    /// <returns> the highest token type value </returns>
+    constexpr size_t getMaxTokenType() const { return _maxTokenType; }
+
+    /// <summary>
+    /// Gets the string literal associated with a token type. The string returned
+    /// by this method, when not {@code null}, can be used unaltered in a parser
+    /// grammar to represent this token type.
+    ///
+    /// <para>The following table shows examples of lexer rules and the literal
+    /// names assigned to the corresponding token types.</para>
+    ///
+    /// <table>
+    ///  <tr>
+    ///   <th>Rule</th>
+    ///   <th>Literal Name</th>
+    ///   <th>Java String Literal</th>
+    ///  </tr>
+    ///  <tr>
+    ///   <td>{@code THIS : 'this';}</td>
+    ///   <td>{@code 'this'}</td>
+    ///   <td>{@code "'this'"}</td>
+    ///  </tr>
+    ///  <tr>
+    ///   <td>{@code SQUOTE : '\'';}</td>
+    ///   <td>{@code '\''}</td>
+    ///   <td>{@code "'\\''"}</td>
+    ///  </tr>
+    ///  <tr>
+    ///   <td>{@code ID : [A-Z]+;}</td>
+    ///   <td>n/a</td>
+    ///   <td>{@code null}</td>
+    ///  </tr>
+    /// </table>
+    /// </summary>
+    /// <param name="tokenType"> The token type.
+    /// </param>
+    /// <returns> The string literal associated with the specified token type, or
+    /// {@code null} if no string literal is associated with the type. </returns>
+    std::string_view getLiteralName(size_t tokenType) const;
+
+    /// <summary>
+    /// Gets the symbolic name associated with a token type. The string returned
+    /// by this method, when not {@code null}, can be used unaltered in a parser
+    /// grammar to represent this token type.
+    ///
+    /// <para>This method supports token types defined by any of the following
+    /// methods:</para>
+    ///
+    /// <ul>
+    ///  <li>Tokens created by lexer rules.</li>
+    ///  <li>Tokens defined in a <code>tokens{}</code> block in a lexer or parser
+    ///  grammar.</li>
+    ///  <li>The implicitly defined {@code EOF} token, which has the token type
+    ///  <seealso cref="Token#EOF"/>.</li>
+    /// </ul>
+    ///
+    /// <para>The following table shows examples of lexer rules and the literal
+    /// names assigned to the corresponding token types.</para>
+    ///
+    /// <table>
+    ///  <tr>
+    ///   <th>Rule</th>
+    ///   <th>Symbolic Name</th>
+    ///  </tr>
+    ///  <tr>
+    ///   <td>{@code THIS : 'this';}</td>
+    ///   <td>{@code THIS}</td>
+    ///  </tr>
+    ///  <tr>
+    ///   <td>{@code SQUOTE : '\'';}</td>
+    ///   <td>{@code SQUOTE}</td>
+    ///  </tr>
+    ///  <tr>
+    ///   <td>{@code ID : [A-Z]+;}</td>
+    ///   <td>{@code ID}</td>
+    ///  </tr>
+    /// </table>
+    /// </summary>
+    /// <param name="tokenType"> The token type.
+    /// </param>
+    /// <returns> The symbolic name associated with the specified token type, or
+    /// {@code null} if no symbolic name is associated with the type. </returns>
+    std::string_view getSymbolicName(size_t tokenType) const;
+
+    /// <summary>
+    /// Gets the display name of a token type.
+    ///
+    /// <para>ANTLR provides a default implementation of this method, but
+    /// applications are free to override the behavior in any manner which makes
+    /// sense for the application. The default implementation returns the first
+    /// result from the following list which produces a non-{@code null}
+    /// result.</para>
+    ///
+    /// <ol>
+    ///  <li>The result of <seealso cref="#getLiteralName"/></li>
+    ///  <li>The result of <seealso cref="#getSymbolicName"/></li>
+    ///  <li>The result of <seealso cref="Integer#toString"/></li>
+    /// </ol>
+    /// </summary>
+    /// <param name="tokenType"> The token type.
+    /// </param>
+    /// <returns> The display name of the token type, for use in error reporting or
+    /// other user-visible messages which reference specific token types. </returns>
+    std::string getDisplayName(size_t tokenType) const;
+
+  private:
+    std::vector<std::string> const _literalNames;
+    std::vector<std::string> const _symbolicNames;
+    std::vector<std::string> const _displayNames;
+    const size_t _maxTokenType = 0;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/WritableToken.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/WritableToken.cpp
new file mode 100644
index 0000000000..a30cd96f19
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/WritableToken.cpp
@@ -0,0 +1,9 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "WritableToken.h"
+
+antlr4::WritableToken::~WritableToken() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/WritableToken.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/WritableToken.h
new file mode 100755
index 0000000000..56bc9d0796
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/WritableToken.h
@@ -0,0 +1,23 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Token.h"
+
+namespace antlr4 {
+
+  class ANTLR4CPP_PUBLIC WritableToken : public Token {
+  public:
+    virtual ~WritableToken();
+    virtual void setText(const std::string &text) = 0;
+    virtual void setType(size_t ttype) = 0;
+    virtual void setLine(size_t line) = 0;
+    virtual void setCharPositionInLine(size_t pos) = 0;
+    virtual void setChannel(size_t channel) = 0;
+    virtual void setTokenIndex(size_t index) = 0;
+  };
+
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/antlr4-common.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/antlr4-common.h
new file mode 100644
index 0000000000..010a3ec61d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/antlr4-common.h
@@ -0,0 +1,102 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <algorithm>
+#include <any>
+#include <atomic>
+#include <bitset>
+#include <cassert>
+#include <climits>
+#include <cstddef>
+#include <cstdint>
+#include <cstdlib>
+#include <exception>
+#include <fstream>
+#include <iostream>
+#include <iterator>
+#include <limits>
+#include <map>
+#include <memory>
+#include <set>
+#include <sstream>
+#include <stack>
+#include <string>
+#include <string_view>
+#include <typeinfo>
+#include <type_traits>
+#include <unordered_map>
+#include <unordered_set>
+#include <utility>
+#include <vector>
+#include <chrono>
+
+// Defines for the Guid class and other platform dependent stuff.
+#ifdef _WIN32
+  #ifdef _MSC_VER
+    #pragma warning (disable: 4250) // Class inherits by dominance.
+    #pragma warning (disable: 4512) // assignment operator could not be generated
+
+    #if _MSC_VER < 1900
+      // Before VS 2015 code like "while (true)" will create a (useless) warning in level 4.
+      #pragma warning (disable: 4127) // conditional expression is constant
+    #endif
+  #endif
+
+  #ifdef _WIN64
+    typedef __int64 ssize_t;
+  #else
+    typedef __int32 ssize_t;
+  #endif
+
+  #ifdef ANTLR4CPP_EXPORTS
+    #define ANTLR4CPP_PUBLIC __declspec(dllexport)
+  #else
+    #ifdef ANTLR4CPP_STATIC
+      #define ANTLR4CPP_PUBLIC
+    #else
+      #define ANTLR4CPP_PUBLIC __declspec(dllimport)
+    #endif
+  #endif
+
+#elif defined(__APPLE__)
+  #if __GNUC__ >= 4
+    #define ANTLR4CPP_PUBLIC __attribute__ ((visibility ("default")))
+  #else
+    #define ANTLR4CPP_PUBLIC
+  #endif
+#else
+  #if __GNUC__ >= 6
+    #define ANTLR4CPP_PUBLIC __attribute__ ((visibility ("default")))
+  #else
+    #define ANTLR4CPP_PUBLIC
+  #endif
+#endif
+
+#ifdef __has_builtin
+#define ANTLR4CPP_HAVE_BUILTIN(x) __has_builtin(x)
+#else
+#define ANTLR4CPP_HAVE_BUILTIN(x) 0
+#endif
+
+#define ANTLR4CPP_INTERNAL_STRINGIFY(x) #x
+#define ANTLR4CPP_STRINGIFY(x) ANTLR4CPP_INTERNAL_STRINGIFY(x)
+
+// We use everything from the C++ standard library by default.
+#ifndef ANTLR4CPP_USING_ABSEIL
+#define ANTLR4CPP_USING_ABSEIL 0
+#endif
+
+#include "support/Declarations.h"
+
+// We have to undefine this symbol as ANTLR will use this name for own members and even
+// generated functions. Because EOF is a global macro we cannot use e.g. a namespace scope to disambiguate.
+#ifdef EOF
+#undef EOF
+#endif
+
+#define INVALID_INDEX std::numeric_limits<size_t>::max()
+template<class T> using Ref = std::shared_ptr<T>;
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/antlr4-runtime.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/antlr4-runtime.h
new file mode 100644
index 0000000000..50b85aa4fc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/antlr4-runtime.h
@@ -0,0 +1,168 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+// This is the umbrella header for all ANTLR4 C++ runtime headers.
+
+#include "antlr4-common.h"
+
+#include "ANTLRErrorListener.h"
+#include "ANTLRErrorStrategy.h"
+#include "ANTLRFileStream.h"
+#include "ANTLRInputStream.h"
+#include "BailErrorStrategy.h"
+#include "BaseErrorListener.h"
+#include "BufferedTokenStream.h"
+#include "CharStream.h"
+#include "CommonToken.h"
+#include "CommonTokenFactory.h"
+#include "CommonTokenStream.h"
+#include "ConsoleErrorListener.h"
+#include "DefaultErrorStrategy.h"
+#include "DiagnosticErrorListener.h"
+#include "Exceptions.h"
+#include "FailedPredicateException.h"
+#include "InputMismatchException.h"
+#include "IntStream.h"
+#include "InterpreterRuleContext.h"
+#include "Lexer.h"
+#include "LexerInterpreter.h"
+#include "LexerNoViableAltException.h"
+#include "ListTokenSource.h"
+#include "NoViableAltException.h"
+#include "Parser.h"
+#include "ParserInterpreter.h"
+#include "ParserRuleContext.h"
+#include "ProxyErrorListener.h"
+#include "RecognitionException.h"
+#include "Recognizer.h"
+#include "RuleContext.h"
+#include "RuleContextWithAltNum.h"
+#include "RuntimeMetaData.h"
+#include "Token.h"
+#include "TokenFactory.h"
+#include "TokenSource.h"
+#include "TokenStream.h"
+#include "TokenStreamRewriter.h"
+#include "UnbufferedCharStream.h"
+#include "UnbufferedTokenStream.h"
+#include "Version.h"
+#include "Vocabulary.h"
+#include "Vocabulary.h"
+#include "WritableToken.h"
+#include "atn/ATN.h"
+#include "atn/ATNConfig.h"
+#include "atn/ATNConfigSet.h"
+#include "atn/ATNDeserializationOptions.h"
+#include "atn/ATNDeserializer.h"
+#include "atn/ATNSimulator.h"
+#include "atn/ATNState.h"
+#include "atn/ATNType.h"
+#include "atn/ActionTransition.h"
+#include "atn/AmbiguityInfo.h"
+#include "atn/ArrayPredictionContext.h"
+#include "atn/AtomTransition.h"
+#include "atn/BasicBlockStartState.h"
+#include "atn/BasicState.h"
+#include "atn/BlockEndState.h"
+#include "atn/BlockStartState.h"
+#include "atn/ContextSensitivityInfo.h"
+#include "atn/DecisionEventInfo.h"
+#include "atn/DecisionInfo.h"
+#include "atn/DecisionState.h"
+#include "atn/EpsilonTransition.h"
+#include "atn/ErrorInfo.h"
+#include "atn/LL1Analyzer.h"
+#include "atn/LexerATNConfig.h"
+#include "atn/LexerATNSimulator.h"
+#include "atn/LexerAction.h"
+#include "atn/LexerActionExecutor.h"
+#include "atn/LexerActionType.h"
+#include "atn/LexerChannelAction.h"
+#include "atn/LexerCustomAction.h"
+#include "atn/LexerIndexedCustomAction.h"
+#include "atn/LexerModeAction.h"
+#include "atn/LexerMoreAction.h"
+#include "atn/LexerPopModeAction.h"
+#include "atn/LexerPushModeAction.h"
+#include "atn/LexerSkipAction.h"
+#include "atn/LexerTypeAction.h"
+#include "atn/LookaheadEventInfo.h"
+#include "atn/LoopEndState.h"
+#include "atn/NotSetTransition.h"
+#include "atn/OrderedATNConfigSet.h"
+#include "atn/ParseInfo.h"
+#include "atn/ParserATNSimulator.h"
+#include "atn/ParserATNSimulatorOptions.h"
+#include "atn/PlusBlockStartState.h"
+#include "atn/PlusLoopbackState.h"
+#include "atn/PrecedencePredicateTransition.h"
+#include "atn/PredicateEvalInfo.h"
+#include "atn/PredicateTransition.h"
+#include "atn/PredictionContext.h"
+#include "atn/PredictionContextCache.h"
+#include "atn/PredictionContextMergeCache.h"
+#include "atn/PredictionContextMergeCacheOptions.h"
+#include "atn/PredictionMode.h"
+#include "atn/ProfilingATNSimulator.h"
+#include "atn/RangeTransition.h"
+#include "atn/RuleStartState.h"
+#include "atn/RuleStopState.h"
+#include "atn/RuleTransition.h"
+#include "atn/SemanticContext.h"
+#include "atn/SerializedATNView.h"
+#include "atn/SetTransition.h"
+#include "atn/SingletonPredictionContext.h"
+#include "atn/StarBlockStartState.h"
+#include "atn/StarLoopEntryState.h"
+#include "atn/StarLoopbackState.h"
+#include "atn/TokensStartState.h"
+#include "atn/Transition.h"
+#include "atn/WildcardTransition.h"
+#include "dfa/DFA.h"
+#include "dfa/DFASerializer.h"
+#include "dfa/DFAState.h"
+#include "dfa/LexerDFASerializer.h"
+#include "misc/InterpreterDataReader.h"
+#include "misc/Interval.h"
+#include "misc/IntervalSet.h"
+#include "misc/MurmurHash.h"
+#include "misc/Predicate.h"
+#include "support/Any.h"
+#include "support/Arrays.h"
+#include "support/BitSet.h"
+#include "support/Casts.h"
+#include "support/CPPUtils.h"
+#include "tree/AbstractParseTreeVisitor.h"
+#include "tree/ErrorNode.h"
+#include "tree/ErrorNodeImpl.h"
+#include "tree/ParseTree.h"
+#include "tree/ParseTreeListener.h"
+#include "tree/ParseTreeProperty.h"
+#include "tree/ParseTreeVisitor.h"
+#include "tree/ParseTreeWalker.h"
+#include "tree/TerminalNode.h"
+#include "tree/TerminalNodeImpl.h"
+#include "tree/Trees.h"
+#include "tree/pattern/Chunk.h"
+#include "tree/pattern/ParseTreeMatch.h"
+#include "tree/pattern/ParseTreePattern.h"
+#include "tree/pattern/ParseTreePatternMatcher.h"
+#include "tree/pattern/RuleTagToken.h"
+#include "tree/pattern/TagChunk.h"
+#include "tree/pattern/TextChunk.h"
+#include "tree/pattern/TokenTagToken.h"
+#include "tree/xpath/XPath.h"
+#include "tree/xpath/XPathElement.h"
+#include "tree/xpath/XPathLexer.h"
+#include "tree/xpath/XPathLexerErrorListener.h"
+#include "tree/xpath/XPathRuleAnywhereElement.h"
+#include "tree/xpath/XPathRuleElement.h"
+#include "tree/xpath/XPathTokenAnywhereElement.h"
+#include "tree/xpath/XPathTokenElement.h"
+#include "tree/xpath/XPathWildcardAnywhereElement.h"
+#include "tree/xpath/XPathWildcardElement.h"
+#include "internal/Synchronization.h"
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATN.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATN.cpp
new file mode 100755
index 0000000000..c434c933dd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATN.cpp
@@ -0,0 +1,159 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/LL1Analyzer.h"
+#include "Token.h"
+#include "atn/RuleTransition.h"
+#include "misc/IntervalSet.h"
+#include "RuleContext.h"
+#include "atn/DecisionState.h"
+#include "Recognizer.h"
+#include "atn/ATNType.h"
+#include "Exceptions.h"
+#include "support/CPPUtils.h"
+
+#include "atn/ATN.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::internal;
+using namespace antlrcpp;
+
+ATN::ATN() : ATN(ATNType::LEXER, 0) {}
+
+ATN::ATN(ATNType grammarType_, size_t maxTokenType_) : grammarType(grammarType_), maxTokenType(maxTokenType_) {}
+
+ATN::~ATN() {
+  for (ATNState *state : states) {
+    delete state;
+  }
+}
+
+misc::IntervalSet ATN::nextTokens(ATNState *s, RuleContext *ctx) const {
+  LL1Analyzer analyzer(*this);
+  return analyzer.LOOK(s, ctx);
+
+}
+
+misc::IntervalSet const& ATN::nextTokens(ATNState *s) const {
+  if (!s->_nextTokenUpdated) {
+    UniqueLock<Mutex> lock(_mutex);
+    if (!s->_nextTokenUpdated) {
+      s->_nextTokenWithinRule = nextTokens(s, nullptr);
+      s->_nextTokenUpdated = true;
+    }
+  }
+  return s->_nextTokenWithinRule;
+}
+
+void ATN::addState(ATNState *state) {
+  if (state != nullptr) {
+    //state->atn = this;
+    state->stateNumber = static_cast<int>(states.size());
+  }
+
+  states.push_back(state);
+}
+
+void ATN::removeState(ATNState *state) {
+  delete states.at(state->stateNumber);// just free mem, don't shift states in list
+  states.at(state->stateNumber) = nullptr;
+}
+
+int ATN::defineDecisionState(DecisionState *s) {
+  decisionToState.push_back(s);
+  s->decision = static_cast<int>(decisionToState.size() - 1);
+  return s->decision;
+}
+
+DecisionState *ATN::getDecisionState(size_t decision) const {
+  if (!decisionToState.empty()) {
+    return decisionToState[decision];
+  }
+  return nullptr;
+}
+
+size_t ATN::getNumberOfDecisions() const {
+  return decisionToState.size();
+}
+
+misc::IntervalSet ATN::getExpectedTokens(size_t stateNumber, RuleContext *context) const {
+  if (stateNumber == ATNState::INVALID_STATE_NUMBER || stateNumber >= states.size()) {
+    throw IllegalArgumentException("Invalid state number.");
+  }
+
+  RuleContext *ctx = context;
+  ATNState *s = states.at(stateNumber);
+  misc::IntervalSet following = nextTokens(s);
+  if (!following.contains(Token::EPSILON)) {
+    return following;
+  }
+
+  misc::IntervalSet expected;
+  expected.addAll(following);
+  expected.remove(Token::EPSILON);
+  while (ctx && ctx->invokingState != ATNState::INVALID_STATE_NUMBER && following.contains(Token::EPSILON)) {
+    ATNState *invokingState = states.at(ctx->invokingState);
+    const RuleTransition *rt = static_cast<const RuleTransition*>(invokingState->transitions[0].get());
+    following = nextTokens(rt->followState);
+    expected.addAll(following);
+    expected.remove(Token::EPSILON);
+
+    if (ctx->parent == nullptr) {
+      break;
+    }
+    ctx = static_cast<RuleContext *>(ctx->parent);
+  }
+
+  if (following.contains(Token::EPSILON)) {
+    expected.add(Token::EOF);
+  }
+
+  return expected;
+}
+
+std::string ATN::toString() const {
+  std::stringstream ss;
+  std::string type;
+  switch (grammarType) {
+    case ATNType::LEXER:
+      type = "LEXER ";
+      break;
+
+    case ATNType::PARSER:
+      type = "PARSER ";
+      break;
+
+    default:
+      break;
+  }
+  ss << "(" << type << "ATN " << std::hex << this << std::dec << ") maxTokenType: " << maxTokenType << std::endl;
+  ss << "states (" << states.size() << ") {" << std::endl;
+
+  size_t index = 0;
+  for (auto *state : states) {
+    if (state == nullptr) {
+      ss << "  " << index++ << ": nul" << std::endl;
+    } else {
+      std::string text = state->toString();
+      ss << "  " << index++ << ": " << indent(text, "  ", false) << std::endl;
+    }
+  }
+
+  index = 0;
+  for (auto *state : decisionToState) {
+    if (state == nullptr) {
+      ss << "  " << index++ << ": nul" << std::endl;
+    } else {
+      std::string text = state->toString();
+      ss << "  " << index++ << ": " << indent(text, "  ", false) << std::endl;
+    }
+  }
+
+  ss << "}";
+
+  return ss.str();
+}
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATN.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATN.h
new file mode 100755
index 0000000000..1fc3fa32c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATN.h
@@ -0,0 +1,133 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "RuleContext.h"
+#include "internal/Synchronization.h"
+
+// GCC generates a warning when forward-declaring ATN if ATN has already been
+// declared due to the attributes added by ANTLR4CPP_PUBLIC.
+// See: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=39159
+// Add constant that can be checked so forward-declarations can be omitted.
+#define ANTLR4CPP_ATN_DECLARED
+
+namespace antlr4 {
+namespace atn {
+
+  class LexerATNSimulator;
+  class ParserATNSimulator;
+
+  class ANTLR4CPP_PUBLIC ATN {
+  public:
+    static constexpr size_t INVALID_ALT_NUMBER = 0;
+
+    /// Used for runtime deserialization of ATNs from strings.
+    ATN();
+
+    ATN(ATNType grammarType, size_t maxTokenType);
+
+    ATN(const ATN&) = delete;
+
+    ATN(ATN&&) = delete;
+
+    ~ATN();
+
+    ATN& operator=(const ATN&) = delete;
+
+    ATN& operator=(ATN&&) = delete;
+
+    std::vector<ATNState *> states;
+
+    /// Each subrule/rule is a decision point and we must track them so we
+    /// can go back later and build DFA predictors for them.  This includes
+    /// all the rules, subrules, optional blocks, ()+, ()* etc...
+    std::vector<DecisionState *> decisionToState;
+
+    /// Maps from rule index to starting state number.
+    std::vector<RuleStartState *> ruleToStartState;
+
+    /// Maps from rule index to stop state number.
+    std::vector<RuleStopState *> ruleToStopState;
+
+    /// The type of the ATN.
+    ATNType grammarType;
+
+    /// The maximum value for any symbol recognized by a transition in the ATN.
+    size_t maxTokenType;
+
+    /// <summary>
+    /// For lexer ATNs, this maps the rule index to the resulting token type.
+    /// For parser ATNs, this maps the rule index to the generated bypass token
+    /// type if the
+    /// <seealso cref="ATNDeserializationOptions#isGenerateRuleBypassTransitions"/>
+    /// deserialization option was specified; otherwise, this is {@code null}.
+    /// </summary>
+    std::vector<size_t> ruleToTokenType;
+
+    /// For lexer ATNs, this is an array of {@link LexerAction} objects which may
+    /// be referenced by action transitions in the ATN.
+    std::vector<Ref<const LexerAction>> lexerActions;
+
+    std::vector<TokensStartState *> modeToStartState;
+
+    /// <summary>
+    /// Compute the set of valid tokens that can occur starting in state {@code s}.
+    ///  If {@code ctx} is null, the set of tokens will not include what can follow
+    ///  the rule surrounding {@code s}. In other words, the set will be
+    ///  restricted to tokens reachable staying within {@code s}'s rule.
+    /// </summary>
+    misc::IntervalSet nextTokens(ATNState *s, RuleContext *ctx) const;
+
+    /// <summary>
+    /// Compute the set of valid tokens that can occur starting in {@code s} and
+    /// staying in same rule. <seealso cref="Token#EPSILON"/> is in set if we reach end of
+    /// rule.
+    /// </summary>
+    misc::IntervalSet const& nextTokens(ATNState *s) const;
+
+    void addState(ATNState *state);
+
+    void removeState(ATNState *state);
+
+    int defineDecisionState(DecisionState *s);
+
+    DecisionState *getDecisionState(size_t decision) const;
+
+    size_t getNumberOfDecisions() const;
+
+    /// <summary>
+    /// Computes the set of input symbols which could follow ATN state number
+    /// {@code stateNumber} in the specified full {@code context}. This method
+    /// considers the complete parser context, but does not evaluate semantic
+    /// predicates (i.e. all predicates encountered during the calculation are
+    /// assumed true). If a path in the ATN exists from the starting state to the
+    /// <seealso cref="RuleStopState"/> of the outermost context without matching any
+    /// symbols, <seealso cref="Token#EOF"/> is added to the returned set.
+    /// <p/>
+    /// If {@code context} is {@code null}, it is treated as
+    /// <seealso cref="ParserRuleContext#EMPTY"/>.
+    /// </summary>
+    /// <param name="stateNumber"> the ATN state number </param>
+    /// <param name="context"> the full parse context </param>
+    /// <returns> The set of potentially valid input symbols which could follow the
+    /// specified state in the specified context. </returns>
+    /// <exception cref="IllegalArgumentException"> if the ATN does not contain a state with
+    /// number {@code stateNumber} </exception>
+    misc::IntervalSet getExpectedTokens(size_t stateNumber, RuleContext *context) const;
+
+    std::string toString() const;
+
+  private:
+    friend class LexerATNSimulator;
+    friend class ParserATNSimulator;
+
+    mutable internal::Mutex _mutex;
+    mutable internal::SharedMutex _stateMutex;
+    mutable internal::SharedMutex _edgeMutex;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfig.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfig.cpp
new file mode 100755
index 0000000000..2d7132f6fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfig.cpp
@@ -0,0 +1,106 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "atn/PredictionContext.h"
+#include "SemanticContext.h"
+
+#include "atn/ATNConfig.h"
+
+using namespace antlr4::atn;
+
+namespace {
+
+/**
+ * This field stores the bit mask for implementing the
+ * {@link #isPrecedenceFilterSuppressed} property as a bit within the
+ * existing {@link #reachesIntoOuterContext} field.
+ */
+inline constexpr size_t SUPPRESS_PRECEDENCE_FILTER = 0x40000000;
+
+}
+
+ATNConfig::ATNConfig(ATNState *state, size_t alt, Ref<const PredictionContext> context)
+    : ATNConfig(state, alt, std::move(context), 0, SemanticContext::Empty::Instance) {}
+
+ATNConfig::ATNConfig(ATNState *state, size_t alt, Ref<const PredictionContext> context, Ref<const SemanticContext> semanticContext)
+    : ATNConfig(state, alt, std::move(context), 0, std::move(semanticContext)) {}
+
+ATNConfig::ATNConfig(ATNConfig const& other, Ref<const SemanticContext> semanticContext)
+    : ATNConfig(other.state, other.alt, other.context, other.reachesIntoOuterContext, std::move(semanticContext)) {}
+
+ATNConfig::ATNConfig(ATNConfig const& other, ATNState *state)
+    : ATNConfig(state, other.alt, other.context, other.reachesIntoOuterContext, other.semanticContext) {}
+
+ATNConfig::ATNConfig(ATNConfig const& other, ATNState *state, Ref<const SemanticContext> semanticContext)
+    : ATNConfig(state, other.alt, other.context, other.reachesIntoOuterContext, std::move(semanticContext)) {}
+
+ATNConfig::ATNConfig(ATNConfig const& other, ATNState *state, Ref<const PredictionContext> context)
+    : ATNConfig(state, other.alt, std::move(context), other.reachesIntoOuterContext, other.semanticContext) {}
+
+ATNConfig::ATNConfig(ATNConfig const& other, ATNState *state, Ref<const PredictionContext> context, Ref<const SemanticContext> semanticContext)
+    : ATNConfig(state, other.alt, std::move(context), other.reachesIntoOuterContext, std::move(semanticContext)) {}
+
+ATNConfig::ATNConfig(ATNState *state, size_t alt, Ref<const PredictionContext> context, size_t reachesIntoOuterContext, Ref<const SemanticContext> semanticContext)
+    : state(state), alt(alt), context(std::move(context)), reachesIntoOuterContext(reachesIntoOuterContext), semanticContext(std::move(semanticContext)) {}
+
+size_t ATNConfig::hashCode() const {
+  size_t hashCode = misc::MurmurHash::initialize(7);
+  hashCode = misc::MurmurHash::update(hashCode, state->stateNumber);
+  hashCode = misc::MurmurHash::update(hashCode, alt);
+  hashCode = misc::MurmurHash::update(hashCode, context);
+  hashCode = misc::MurmurHash::update(hashCode, semanticContext);
+  hashCode = misc::MurmurHash::finish(hashCode, 4);
+  return hashCode;
+}
+
+size_t ATNConfig::getOuterContextDepth() const {
+  return reachesIntoOuterContext & ~SUPPRESS_PRECEDENCE_FILTER;
+}
+
+bool ATNConfig::isPrecedenceFilterSuppressed() const {
+  return (reachesIntoOuterContext & SUPPRESS_PRECEDENCE_FILTER) != 0;
+}
+
+void ATNConfig::setPrecedenceFilterSuppressed(bool value) {
+  if (value) {
+    reachesIntoOuterContext |= SUPPRESS_PRECEDENCE_FILTER;
+  } else {
+    reachesIntoOuterContext &= ~SUPPRESS_PRECEDENCE_FILTER;
+  }
+}
+
+bool ATNConfig::operator==(const ATNConfig &other) const {
+  return state->stateNumber == other.state->stateNumber && alt == other.alt &&
+    ((context == other.context) || (*context == *other.context)) &&
+    *semanticContext == *other.semanticContext &&
+    isPrecedenceFilterSuppressed() == other.isPrecedenceFilterSuppressed();
+}
+
+std::string ATNConfig::toString() const {
+  return toString(true);
+}
+
+std::string ATNConfig::toString(bool showAlt) const {
+  std::stringstream ss;
+  ss << "(";
+
+  ss << state->toString();
+  if (showAlt) {
+    ss << "," << alt;
+  }
+  if (context) {
+    ss << ",[" << context->toString() << "]";
+  }
+  if (semanticContext != nullptr && semanticContext != SemanticContext::Empty::Instance) {
+    ss << "," << semanticContext->toString();
+  }
+  if (getOuterContextDepth() > 0) {
+    ss << ",up=" << getOuterContextDepth();
+  }
+  ss << ")";
+
+  return ss.str();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfig.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfig.h
new file mode 100755
index 0000000000..1d2e7ae163
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfig.h
@@ -0,0 +1,157 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cassert>
+
+#include "antlr4-common.h"
+#include "atn/SemanticContext.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// A tuple: (ATN state, predicted alt, syntactic, semantic context).
+  ///  The syntactic context is a graph-structured stack node whose
+  ///  path(s) to the root is the rule invocation(s)
+  ///  chain used to arrive at the state.  The semantic context is
+  ///  the tree of semantic predicates encountered before reaching
+  ///  an ATN state.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC ATNConfig {
+  public:
+    struct Hasher
+    {
+      size_t operator()(Ref<ATNConfig> const& k) const {
+        return k->hashCode();
+      }
+
+      size_t operator()(ATNConfig const& k) const {
+        return k.hashCode();
+      }
+    };
+
+    struct Comparer {
+      bool operator()(Ref<ATNConfig> const& lhs, Ref<ATNConfig> const& rhs) const {
+        return (lhs == rhs) || (*lhs == *rhs);
+      }
+
+      bool operator()(ATNConfig const& lhs, ATNConfig const& rhs) const {
+        return (&lhs == &rhs) || (lhs == rhs);
+      }
+    };
+
+    using Set = std::unordered_set<Ref<ATNConfig>, Hasher, Comparer>;
+
+    /// The ATN state associated with this configuration.
+    ATNState *state = nullptr;
+
+    /// What alt (or lexer rule) is predicted by this configuration.
+    const size_t alt = 0;
+
+    /// The stack of invoking states leading to the rule/states associated
+    /// with this config.  We track only those contexts pushed during
+    /// execution of the ATN simulator.
+    ///
+    /// Can be shared between multiple ANTConfig instances.
+    Ref<const PredictionContext> context;
+
+    /**
+     * We cannot execute predicates dependent upon local context unless
+     * we know for sure we are in the correct context. Because there is
+     * no way to do this efficiently, we simply cannot evaluate
+     * dependent predicates unless we are in the rule that initially
+     * invokes the ATN simulator.
+     *
+     * <p>
+     * closure() tracks the depth of how far we dip into the outer context:
+     * depth > 0.  Note that it may not be totally accurate depth since I
+     * don't ever decrement. TODO: make it a boolean then</p>
+     *
+     * <p>
+     * For memory efficiency, the {@link #isPrecedenceFilterSuppressed} method
+     * is also backed by this field. Since the field is publicly accessible, the
+     * highest bit which would not cause the value to become negative is used to
+     * store this field. This choice minimizes the risk that code which only
+     * compares this value to 0 would be affected by the new purpose of the
+     * flag. It also ensures the performance of the existing {@link ATNConfig}
+     * constructors as well as certain operations like
+     * {@link ATNConfigSet#add(ATNConfig, DoubleKeyMap)} method are
+     * <em>completely</em> unaffected by the change.</p>
+     */
+    size_t reachesIntoOuterContext = 0;
+
+    /// Can be shared between multiple ATNConfig instances.
+    Ref<const SemanticContext> semanticContext;
+
+    ATNConfig(ATNState *state, size_t alt, Ref<const PredictionContext> context);
+    ATNConfig(ATNState *state, size_t alt, Ref<const PredictionContext> context, Ref<const SemanticContext> semanticContext);
+
+    ATNConfig(ATNConfig const& other, Ref<const SemanticContext> semanticContext);
+    ATNConfig(ATNConfig const& other, ATNState *state);
+    ATNConfig(ATNConfig const& other, ATNState *state, Ref<const SemanticContext> semanticContext);
+    ATNConfig(ATNConfig const& other, ATNState *state, Ref<const PredictionContext> context);
+    ATNConfig(ATNConfig const& other, ATNState *state, Ref<const PredictionContext> context, Ref<const SemanticContext> semanticContext);
+
+    ATNConfig(ATNConfig const&) = default;
+
+    ATNConfig(ATNConfig&&) = default;
+
+    virtual ~ATNConfig() = default;
+
+    virtual size_t hashCode() const;
+
+    /**
+     * This method gets the value of the {@link #reachesIntoOuterContext} field
+     * as it existed prior to the introduction of the
+     * {@link #isPrecedenceFilterSuppressed} method.
+     */
+    size_t getOuterContextDepth() const;
+    bool isPrecedenceFilterSuppressed() const;
+    void setPrecedenceFilterSuppressed(bool value);
+
+    /// An ATN configuration is equal to another if both have
+    /// the same state, they predict the same alternative, and
+    /// syntactic/semantic contexts are the same.
+    bool operator==(const ATNConfig &other) const;
+    bool operator!=(const ATNConfig &other) const;
+
+    virtual std::string toString() const;
+    std::string toString(bool showAlt) const;
+
+  private:
+    ATNConfig(ATNState *state, size_t alt, Ref<const PredictionContext> context, size_t reachesIntoOuterContext, Ref<const SemanticContext> semanticContext);
+  };
+
+} // namespace atn
+} // namespace antlr4
+
+
+// Hash function for ATNConfig.
+
+namespace std {
+  using antlr4::atn::ATNConfig;
+
+  template <> struct hash<ATNConfig>
+  {
+    size_t operator() (const ATNConfig &x) const
+    {
+      return x.hashCode();
+    }
+  };
+
+  template <> struct hash<std::vector<Ref<ATNConfig>>>
+  {
+    size_t operator() (const std::vector<Ref<ATNConfig>> &vector) const
+    {
+      std::size_t seed = 0;
+      for (const auto &config : vector) {
+        seed ^= config->hashCode() + 0x9e3779b9 + (seed << 6) + (seed >> 2);
+      }
+      return seed;
+    }
+  };
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfigSet.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfigSet.cpp
new file mode 100755
index 0000000000..4c5e84700d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfigSet.cpp
@@ -0,0 +1,233 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/PredictionContext.h"
+#include "atn/ATNConfig.h"
+#include "atn/ATNSimulator.h"
+#include "Exceptions.h"
+#include "atn/SemanticContext.h"
+#include "support/Arrays.h"
+
+#include "atn/ATNConfigSet.h"
+
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+namespace {
+
+}
+
+ATNConfigSet::ATNConfigSet() : ATNConfigSet(true) {}
+
+ATNConfigSet::ATNConfigSet(const ATNConfigSet &other)
+    : fullCtx(other.fullCtx), _configLookup(other._configLookup.bucket_count(), ATNConfigHasher{this}, ATNConfigComparer{this}) {
+  addAll(other);
+  uniqueAlt = other.uniqueAlt;
+  conflictingAlts = other.conflictingAlts;
+  hasSemanticContext = other.hasSemanticContext;
+  dipsIntoOuterContext = other.dipsIntoOuterContext;
+}
+
+ATNConfigSet::ATNConfigSet(bool fullCtx)
+    : fullCtx(fullCtx), _configLookup(0, ATNConfigHasher{this}, ATNConfigComparer{this}) {}
+
+bool ATNConfigSet::add(const Ref<ATNConfig> &config) {
+  return add(config, nullptr);
+}
+
+bool ATNConfigSet::add(const Ref<ATNConfig> &config, PredictionContextMergeCache *mergeCache) {
+  assert(config);
+
+  if (_readonly) {
+    throw IllegalStateException("This set is readonly");
+  }
+  if (config->semanticContext != SemanticContext::Empty::Instance) {
+    hasSemanticContext = true;
+  }
+  if (config->getOuterContextDepth() > 0) {
+    dipsIntoOuterContext = true;
+  }
+
+  auto existing = _configLookup.find(config.get());
+  if (existing == _configLookup.end()) {
+    _configLookup.insert(config.get());
+    _cachedHashCode = 0;
+    configs.push_back(config); // track order here
+
+    return true;
+  }
+
+  // a previous (s,i,pi,_), merge with it and save result
+  bool rootIsWildcard = !fullCtx;
+  Ref<const PredictionContext> merged = PredictionContext::merge((*existing)->context, config->context, rootIsWildcard, mergeCache);
+  // no need to check for existing.context, config.context in cache
+  // since only way to create new graphs is "call rule" and here. We
+  // cache at both places.
+  (*existing)->reachesIntoOuterContext = std::max((*existing)->reachesIntoOuterContext, config->reachesIntoOuterContext);
+
+  // make sure to preserve the precedence filter suppression during the merge
+  if (config->isPrecedenceFilterSuppressed()) {
+    (*existing)->setPrecedenceFilterSuppressed(true);
+  }
+
+  (*existing)->context = std::move(merged); // replace context; no need to alt mapping
+
+  return true;
+}
+
+bool ATNConfigSet::addAll(const ATNConfigSet &other) {
+  for (const auto &c : other.configs) {
+    add(c);
+  }
+  return false;
+}
+
+std::vector<ATNState*> ATNConfigSet::getStates() const {
+  std::vector<ATNState*> states;
+  states.reserve(configs.size());
+  for (const auto &c : configs) {
+    states.push_back(c->state);
+  }
+  return states;
+}
+
+/**
+ * Gets the complete set of represented alternatives for the configuration
+ * set.
+ *
+ * @return the set of represented alternatives in this configuration set
+ *
+ * @since 4.3
+ */
+
+BitSet ATNConfigSet::getAlts() const {
+  BitSet alts;
+  for (const auto &config : configs) {
+    alts.set(config->alt);
+  }
+  return alts;
+}
+
+std::vector<Ref<const SemanticContext>> ATNConfigSet::getPredicates() const {
+  std::vector<Ref<const SemanticContext>> preds;
+  preds.reserve(configs.size());
+  for (const auto &c : configs) {
+    if (c->semanticContext != SemanticContext::Empty::Instance) {
+      preds.push_back(c->semanticContext);
+    }
+  }
+  return preds;
+}
+
+const Ref<ATNConfig>& ATNConfigSet::get(size_t i) const {
+  return configs[i];
+}
+
+void ATNConfigSet::optimizeConfigs(ATNSimulator *interpreter) {
+  assert(interpreter);
+
+  if (_readonly) {
+    throw IllegalStateException("This set is readonly");
+  }
+  if (_configLookup.empty())
+    return;
+
+  for (const auto &config : configs) {
+    config->context = interpreter->getCachedContext(config->context);
+  }
+}
+
+bool ATNConfigSet::equals(const ATNConfigSet &other) const {
+  if (&other == this) {
+    return true;
+  }
+
+  if (configs.size() != other.configs.size())
+    return false;
+
+  if (fullCtx != other.fullCtx || uniqueAlt != other.uniqueAlt ||
+      conflictingAlts != other.conflictingAlts || hasSemanticContext != other.hasSemanticContext ||
+      dipsIntoOuterContext != other.dipsIntoOuterContext) // includes stack context
+    return false;
+
+  return Arrays::equals(configs, other.configs);
+}
+
+size_t ATNConfigSet::hashCode() const {
+  size_t cachedHashCode = _cachedHashCode.load(std::memory_order_relaxed);
+  if (!isReadonly() || cachedHashCode == 0) {
+    cachedHashCode = 1;
+    for (const auto &i : configs) {
+      cachedHashCode = 31 * cachedHashCode + i->hashCode(); // Same as Java's list hashCode impl.
+    }
+    _cachedHashCode.store(cachedHashCode, std::memory_order_relaxed);
+  }
+  return cachedHashCode;
+}
+
+size_t ATNConfigSet::size() const {
+  return configs.size();
+}
+
+bool ATNConfigSet::isEmpty() const {
+  return configs.empty();
+}
+
+void ATNConfigSet::clear() {
+  if (_readonly) {
+    throw IllegalStateException("This set is readonly");
+  }
+  configs.clear();
+  _cachedHashCode = 0;
+  _configLookup.clear();
+}
+
+bool ATNConfigSet::isReadonly() const {
+  return _readonly;
+}
+
+void ATNConfigSet::setReadonly(bool readonly) {
+  _readonly = readonly;
+  LookupContainer(0, ATNConfigHasher{this}, ATNConfigComparer{this}).swap(_configLookup);
+}
+
+std::string ATNConfigSet::toString() const {
+  std::stringstream ss;
+  ss << "[";
+  for (size_t i = 0; i < configs.size(); i++) {
+    if ( i>0 ) ss << ", ";
+    ss << configs[i]->toString();
+  }
+  ss << "]";
+
+  if (hasSemanticContext) {
+    ss << ",hasSemanticContext=" << (hasSemanticContext?"true":"false");
+  }
+  if (uniqueAlt != ATN::INVALID_ALT_NUMBER) {
+    ss << ",uniqueAlt=" << uniqueAlt;
+  }
+
+  if (conflictingAlts.count() > 0) {
+    ss << ",conflictingAlts=";
+    ss << conflictingAlts.toString();
+  }
+
+  if (dipsIntoOuterContext) {
+    ss << ",dipsIntoOuterContext";
+  }
+  return ss.str();
+}
+
+size_t ATNConfigSet::hashCode(const ATNConfig &other) const {
+  size_t hashCode = 7;
+  hashCode = 31 * hashCode + other.state->stateNumber;
+  hashCode = 31 * hashCode + other.alt;
+  hashCode = 31 * hashCode + other.semanticContext->hashCode();
+  return hashCode;
+}
+
+bool ATNConfigSet::equals(const ATNConfig &lhs, const ATNConfig &rhs) const {
+  return lhs.state->stateNumber == rhs.state->stateNumber && lhs.alt == rhs.alt && *lhs.semanticContext == *rhs.semanticContext;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfigSet.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfigSet.h
new file mode 100755
index 0000000000..d147f183a0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNConfigSet.h
@@ -0,0 +1,157 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cassert>
+
+#include "support/BitSet.h"
+#include "atn/PredictionContext.h"
+#include "atn/ATNConfig.h"
+#include "FlatHashSet.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// Specialized set that can track info about the set, with support for combining similar configurations using a
+  /// graph-structured stack.
+  class ANTLR4CPP_PUBLIC ATNConfigSet {
+  public:
+    /// Track the elements as they are added to the set; supports get(i)
+    std::vector<Ref<ATNConfig>> configs;
+
+    // TODO: these fields make me pretty uncomfortable but nice to pack up info together, saves recomputation
+    // TODO: can we track conflicts as they are added to save scanning configs later?
+    size_t uniqueAlt = 0;
+
+    /** Currently this is only used when we detect SLL conflict; this does
+     *  not necessarily represent the ambiguous alternatives. In fact,
+     *  I should also point out that this seems to include predicated alternatives
+     *  that have predicates that evaluate to false. Computed in computeTargetState().
+     */
+    antlrcpp::BitSet conflictingAlts;
+
+    // Used in parser and lexer. In lexer, it indicates we hit a pred
+    // while computing a closure operation.  Don't make a DFA state from this.
+    bool hasSemanticContext = false;
+    bool dipsIntoOuterContext = false;
+
+    /// Indicates that this configuration set is part of a full context
+    /// LL prediction. It will be used to determine how to merge $. With SLL
+    /// it's a wildcard whereas it is not for LL context merge.
+    const bool fullCtx = true;
+
+    ATNConfigSet();
+
+    ATNConfigSet(const ATNConfigSet &other);
+
+    ATNConfigSet(ATNConfigSet&&) = delete;
+
+    explicit ATNConfigSet(bool fullCtx);
+
+    virtual ~ATNConfigSet() = default;
+
+    bool add(const Ref<ATNConfig> &config);
+
+    /// <summary>
+    /// Adding a new config means merging contexts with existing configs for
+    /// {@code (s, i, pi, _)}, where {@code s} is the
+    /// <seealso cref="ATNConfig#state"/>, {@code i} is the <seealso cref="ATNConfig#alt"/>, and
+    /// {@code pi} is the <seealso cref="ATNConfig#semanticContext"/>. We use
+    /// {@code (s,i,pi)} as key.
+    /// <p/>
+    /// This method updates <seealso cref="#dipsIntoOuterContext"/> and
+    /// <seealso cref="#hasSemanticContext"/> when necessary.
+    /// </summary>
+    bool add(const Ref<ATNConfig> &config, PredictionContextMergeCache *mergeCache);
+
+    bool addAll(const ATNConfigSet &other);
+
+    std::vector<ATNState*> getStates() const;
+
+    /**
+     * Gets the complete set of represented alternatives for the configuration
+     * set.
+     *
+     * @return the set of represented alternatives in this configuration set
+     *
+     * @since 4.3
+     */
+    antlrcpp::BitSet getAlts() const;
+    std::vector<Ref<const SemanticContext>> getPredicates() const;
+
+    const Ref<ATNConfig>& get(size_t i) const;
+
+    void optimizeConfigs(ATNSimulator *interpreter);
+
+    size_t size() const;
+    bool isEmpty() const;
+    void clear();
+    bool isReadonly() const;
+    void setReadonly(bool readonly);
+
+    virtual size_t hashCode() const;
+
+    virtual bool equals(const ATNConfigSet &other) const;
+
+    virtual std::string toString() const;
+
+  private:
+    struct ATNConfigHasher final {
+      const ATNConfigSet* atnConfigSet;
+
+      size_t operator()(const ATNConfig *other) const {
+        assert(other != nullptr);
+        return atnConfigSet->hashCode(*other);
+      }
+    };
+
+    struct ATNConfigComparer final {
+      const ATNConfigSet* atnConfigSet;
+
+      bool operator()(const ATNConfig *lhs, const ATNConfig *rhs) const {
+        assert(lhs != nullptr);
+        assert(rhs != nullptr);
+        return atnConfigSet->equals(*lhs, *rhs);
+      }
+    };
+
+    mutable std::atomic<size_t> _cachedHashCode = 0;
+
+    /// Indicates that the set of configurations is read-only. Do not
+    /// allow any code to manipulate the set; DFA states will point at
+    /// the sets and they must not change. This does not protect the other
+    /// fields; in particular, conflictingAlts is set after
+    /// we've made this readonly.
+    bool _readonly = false;
+
+    virtual size_t hashCode(const ATNConfig &atnConfig) const;
+
+    virtual bool equals(const ATNConfig &lhs, const ATNConfig &rhs) const;
+
+    using LookupContainer = FlatHashSet<ATNConfig*, ATNConfigHasher, ATNConfigComparer>;
+
+    /// All configs but hashed by (s, i, _, pi) not including context. Wiped out
+    /// when we go readonly as this set becomes a DFA state.
+    LookupContainer _configLookup;
+  };
+
+  inline bool operator==(const ATNConfigSet &lhs, const ATNConfigSet &rhs) { return lhs.equals(rhs); }
+
+  inline bool operator!=(const ATNConfigSet &lhs, const ATNConfigSet &rhs) { return !operator==(lhs, rhs); }
+
+} // namespace atn
+} // namespace antlr4
+
+namespace std {
+
+template <>
+struct hash<::antlr4::atn::ATNConfigSet> {
+  size_t operator()(const ::antlr4::atn::ATNConfigSet &atnConfigSet) const {
+    return atnConfigSet.hashCode();
+  }
+};
+
+} // namespace std
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializationOptions.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializationOptions.cpp
new file mode 100755
index 0000000000..c1e1499f85
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializationOptions.cpp
@@ -0,0 +1,39 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATNDeserializationOptions.h"
+#include "Exceptions.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+ATNDeserializationOptions::ATNDeserializationOptions(ATNDeserializationOptions *options)
+    : _readOnly(false), _verifyATN(options->_verifyATN),
+      _generateRuleBypassTransitions(options->_generateRuleBypassTransitions) {}
+
+const ATNDeserializationOptions& ATNDeserializationOptions::getDefaultOptions() {
+  static const ATNDeserializationOptions* const defaultOptions = new ATNDeserializationOptions();
+  return *defaultOptions;
+}
+
+void ATNDeserializationOptions::makeReadOnly() {
+  _readOnly = true;
+}
+
+void ATNDeserializationOptions::setVerifyATN(bool verify) {
+  throwIfReadOnly();
+  _verifyATN = verify;
+}
+
+void ATNDeserializationOptions::setGenerateRuleBypassTransitions(bool generate) {
+  throwIfReadOnly();
+  _generateRuleBypassTransitions = generate;
+}
+
+void ATNDeserializationOptions::throwIfReadOnly() const {
+  if (isReadOnly()) {
+    throw IllegalStateException("ATNDeserializationOptions is read only.");
+  }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializationOptions.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializationOptions.h
new file mode 100755
index 0000000000..8b1f9850b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializationOptions.h
@@ -0,0 +1,48 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+class ANTLR4CPP_PUBLIC ATNDeserializationOptions final {
+public:
+  ATNDeserializationOptions()
+    : _readOnly(false), _verifyATN(true), _generateRuleBypassTransitions(false) {}
+
+  // TODO: Is this useful? If so we should mark it as explicit, otherwise remove it.
+  ATNDeserializationOptions(ATNDeserializationOptions *options);
+
+  ATNDeserializationOptions(const ATNDeserializationOptions&) = default;
+
+  ATNDeserializationOptions& operator=(const ATNDeserializationOptions&) = default;
+
+  static const ATNDeserializationOptions& getDefaultOptions();
+
+  bool isReadOnly() const { return _readOnly; }
+
+  void makeReadOnly();
+
+  bool isVerifyATN() const { return _verifyATN; }
+
+  void setVerifyATN(bool verify);
+
+  bool isGenerateRuleBypassTransitions() const { return _generateRuleBypassTransitions; }
+
+  void setGenerateRuleBypassTransitions(bool generate);
+
+private:
+  void throwIfReadOnly() const;
+
+  bool _readOnly;
+  bool _verifyATN;
+  bool _generateRuleBypassTransitions;
+};
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializer.cpp
new file mode 100755
index 0000000000..47ad15d628
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializer.cpp
@@ -0,0 +1,628 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATNDeserializationOptions.h"
+
+#include "atn/ATNType.h"
+#include "atn/ATNState.h"
+#include "atn/ATN.h"
+
+#include "atn/LoopEndState.h"
+#include "atn/DecisionState.h"
+#include "atn/RuleStartState.h"
+#include "atn/RuleStopState.h"
+#include "atn/TokensStartState.h"
+#include "atn/RuleTransition.h"
+#include "atn/EpsilonTransition.h"
+#include "atn/PlusLoopbackState.h"
+#include "atn/PlusBlockStartState.h"
+#include "atn/StarLoopbackState.h"
+#include "atn/BasicBlockStartState.h"
+#include "atn/BasicState.h"
+#include "atn/BlockEndState.h"
+#include "atn/StarLoopEntryState.h"
+
+#include "atn/AtomTransition.h"
+#include "atn/StarBlockStartState.h"
+#include "atn/RangeTransition.h"
+#include "atn/PredicateTransition.h"
+#include "atn/PrecedencePredicateTransition.h"
+#include "atn/ActionTransition.h"
+#include "atn/SetTransition.h"
+#include "atn/NotSetTransition.h"
+#include "atn/WildcardTransition.h"
+#include "atn/TransitionType.h"
+#include "Token.h"
+
+#include "misc/IntervalSet.h"
+#include "Exceptions.h"
+#include "support/CPPUtils.h"
+#include "support/Casts.h"
+
+#include "atn/LexerCustomAction.h"
+#include "atn/LexerChannelAction.h"
+#include "atn/LexerModeAction.h"
+#include "atn/LexerMoreAction.h"
+#include "atn/LexerPopModeAction.h"
+#include "atn/LexerPushModeAction.h"
+#include "atn/LexerSkipAction.h"
+#include "atn/LexerTypeAction.h"
+
+#include "atn/ATNDeserializer.h"
+
+#include <cassert>
+#include <string>
+#include <vector>
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+namespace {
+
+  void checkCondition(bool condition, std::string_view message) {
+    if (!condition) {
+      throw IllegalStateException(std::string(message));
+    }
+  }
+
+  void checkCondition(bool condition) {
+    checkCondition(condition, "");
+  }
+
+  /**
+   * Analyze the {@link StarLoopEntryState} states in the specified ATN to set
+   * the {@link StarLoopEntryState#isPrecedenceDecision} field to the
+   * correct value.
+   *
+   * @param atn The ATN.
+   */
+  void markPrecedenceDecisions(const ATN &atn) {
+    for (ATNState *state : atn.states) {
+      if (!StarLoopEntryState::is(state)) {
+        continue;
+      }
+
+      /* We analyze the ATN to determine if this ATN decision state is the
+      * decision for the closure block that determines whether a
+      * precedence rule should continue or complete.
+      */
+      if (atn.ruleToStartState[state->ruleIndex]->isLeftRecursiveRule) {
+        ATNState *maybeLoopEndState = state->transitions[state->transitions.size() - 1]->target;
+        if (LoopEndState::is(maybeLoopEndState)) {
+          if (maybeLoopEndState->epsilonOnlyTransitions && RuleStopState::is(maybeLoopEndState->transitions[0]->target)) {
+            downCast<StarLoopEntryState*>(state)->isPrecedenceDecision = true;
+          }
+        }
+      }
+    }
+  }
+
+  Ref<const LexerAction> lexerActionFactory(LexerActionType type, int data1, int data2) {
+    switch (type) {
+      case LexerActionType::CHANNEL:
+        return std::make_shared<LexerChannelAction>(data1);
+
+      case LexerActionType::CUSTOM:
+        return std::make_shared<LexerCustomAction>(data1, data2);
+
+      case LexerActionType::MODE:
+        return std::make_shared< LexerModeAction>(data1);
+
+      case LexerActionType::MORE:
+        return LexerMoreAction::getInstance();
+
+      case LexerActionType::POP_MODE:
+        return LexerPopModeAction::getInstance();
+
+      case LexerActionType::PUSH_MODE:
+        return std::make_shared<LexerPushModeAction>(data1);
+
+      case LexerActionType::SKIP:
+        return LexerSkipAction::getInstance();
+
+      case LexerActionType::TYPE:
+        return std::make_shared<LexerTypeAction>(data1);
+
+      default:
+        throw IllegalArgumentException("The specified lexer action type " + std::to_string(static_cast<size_t>(type)) +
+                                      " is not valid.");
+    }
+  }
+
+  ConstTransitionPtr edgeFactory(const ATN &atn, TransitionType type, size_t trg, size_t arg1, size_t arg2,
+                                        size_t arg3, const std::vector<misc::IntervalSet> &sets) {
+    ATNState *target = atn.states[trg];
+    switch (type) {
+      case TransitionType::EPSILON:
+        return std::make_unique<EpsilonTransition>(target);
+      case TransitionType::RANGE:
+        if (arg3 != 0) {
+          return std::make_unique<RangeTransition>(target, Token::EOF, arg2);
+        } else {
+          return std::make_unique<RangeTransition>(target, arg1, arg2);
+        }
+      case TransitionType::RULE:
+        return std::make_unique<RuleTransition>(downCast<RuleStartState*>(atn.states[arg1]), arg2, (int)arg3, target);
+      case TransitionType::PREDICATE:
+        return std::make_unique<PredicateTransition>(target, arg1, arg2, arg3 != 0);
+      case TransitionType::PRECEDENCE:
+        return std::make_unique<PrecedencePredicateTransition>(target, (int)arg1);
+      case TransitionType::ATOM:
+        if (arg3 != 0) {
+          return std::make_unique<AtomTransition>(target, Token::EOF);
+        } else {
+          return std::make_unique<AtomTransition>(target, arg1);
+        }
+      case TransitionType::ACTION:
+        return std::make_unique<ActionTransition>(target, arg1, arg2, arg3 != 0);
+      case TransitionType::SET:
+        return std::make_unique<SetTransition>(target, sets[arg1]);
+      case TransitionType::NOT_SET:
+        return std::make_unique<NotSetTransition>(target, sets[arg1]);
+      case TransitionType::WILDCARD:
+        return std::make_unique<WildcardTransition>(target);
+    }
+
+    throw IllegalArgumentException("The specified transition type is not valid.");
+  }
+
+  /* mem check: all created instances are freed in the d-tor of the ATN. */
+  ATNState* stateFactory(ATNStateType type, size_t ruleIndex) {
+    ATNState *s;
+    switch (type) {
+      case ATNStateType::INVALID:
+        return nullptr;
+      case ATNStateType::BASIC :
+        s = new BasicState();
+        break;
+      case ATNStateType::RULE_START :
+        s = new RuleStartState();
+        break;
+      case ATNStateType::BLOCK_START :
+        s = new BasicBlockStartState();
+        break;
+      case ATNStateType::PLUS_BLOCK_START :
+        s = new PlusBlockStartState();
+        break;
+      case ATNStateType::STAR_BLOCK_START :
+        s = new StarBlockStartState();
+        break;
+      case ATNStateType::TOKEN_START :
+        s = new TokensStartState();
+        break;
+      case ATNStateType::RULE_STOP :
+        s = new RuleStopState();
+        break;
+      case ATNStateType::BLOCK_END :
+        s = new BlockEndState();
+        break;
+      case ATNStateType::STAR_LOOP_BACK :
+        s = new StarLoopbackState();
+        break;
+      case ATNStateType::STAR_LOOP_ENTRY :
+        s = new StarLoopEntryState();
+        break;
+      case ATNStateType::PLUS_LOOP_BACK :
+        s = new PlusLoopbackState();
+        break;
+      case ATNStateType::LOOP_END :
+        s = new LoopEndState();
+        break;
+      default :
+        std::string message = "The specified state type " + std::to_string(static_cast<size_t>(type)) + " is not valid.";
+        throw IllegalArgumentException(message);
+    }
+    assert(s->getStateType() == type);
+    s->ruleIndex = ruleIndex;
+    return s;
+  }
+
+  ssize_t readUnicodeInt32(SerializedATNView data, int& p) {
+    return static_cast<ssize_t>(data[p++]);
+  }
+
+  void deserializeSets(
+    SerializedATNView data,
+    int& p,
+    std::vector<misc::IntervalSet>& sets) {
+    size_t nsets = data[p++];
+    sets.reserve(sets.size() + nsets);
+    for (size_t i = 0; i < nsets; i++) {
+      size_t nintervals = data[p++];
+      misc::IntervalSet set;
+
+      bool containsEof = data[p++] != 0;
+      if (containsEof) {
+        set.add(-1);
+      }
+
+      for (size_t j = 0; j < nintervals; j++) {
+        auto a = readUnicodeInt32(data, p);
+        auto b = readUnicodeInt32(data, p);
+        set.add(a, b);
+      }
+      sets.push_back(set);
+    }
+  }
+
+}
+
+ATNDeserializer::ATNDeserializer() : ATNDeserializer(ATNDeserializationOptions::getDefaultOptions()) {}
+
+ATNDeserializer::ATNDeserializer(ATNDeserializationOptions deserializationOptions) : _deserializationOptions(std::move(deserializationOptions)) {}
+
+std::unique_ptr<ATN> ATNDeserializer::deserialize(SerializedATNView data) const {
+  int p = 0;
+  int version = data[p++];
+  if (version != SERIALIZED_VERSION) {
+    std::string reason = "Could not deserialize ATN with version" + std::to_string(version) + "(expected " + std::to_string(SERIALIZED_VERSION) + ").";
+
+    throw UnsupportedOperationException(reason);
+  }
+
+  ATNType grammarType = (ATNType)data[p++];
+  size_t maxTokenType = data[p++];
+  auto atn = std::make_unique<ATN>(grammarType, maxTokenType);
+
+  //
+  // STATES
+  //
+  {
+    std::vector<std::pair<LoopEndState*, size_t>> loopBackStateNumbers;
+    std::vector<std::pair<BlockStartState*, size_t>> endStateNumbers;
+    size_t nstates = data[p++];
+    atn->states.reserve(nstates);
+    loopBackStateNumbers.reserve(nstates);  // Reserve worst case size, its short lived.
+    endStateNumbers.reserve(nstates);  // Reserve worst case size, its short lived.
+    for (size_t i = 0; i < nstates; i++) {
+      ATNStateType stype = static_cast<ATNStateType>(data[p++]);
+      // ignore bad type of states
+      if (stype == ATNStateType::INVALID) {
+        atn->addState(nullptr);
+        continue;
+      }
+
+      size_t ruleIndex = data[p++];
+      ATNState *s = stateFactory(stype, ruleIndex);
+      if (stype == ATNStateType::LOOP_END) { // special case
+        int loopBackStateNumber = data[p++];
+        loopBackStateNumbers.push_back({ downCast<LoopEndState*>(s),  loopBackStateNumber });
+      } else if (BlockStartState::is(s)) {
+        int endStateNumber = data[p++];
+        endStateNumbers.push_back({ downCast<BlockStartState*>(s), endStateNumber });
+      }
+      atn->addState(s);
+    }
+
+    // delay the assignment of loop back and end states until we know all the state instances have been initialized
+    for (auto &pair : loopBackStateNumbers) {
+      pair.first->loopBackState = atn->states[pair.second];
+    }
+
+    for (auto &pair : endStateNumbers) {
+      pair.first->endState = downCast<BlockEndState*>(atn->states[pair.second]);
+    }
+  }
+
+  size_t numNonGreedyStates = data[p++];
+  for (size_t i = 0; i < numNonGreedyStates; i++) {
+    size_t stateNumber = data[p++];
+    // The serialized ATN must be specifying the right states, so that the
+    // cast below is correct.
+    downCast<DecisionState*>(atn->states[stateNumber])->nonGreedy = true;
+  }
+
+  size_t numPrecedenceStates = data[p++];
+  for (size_t i = 0; i < numPrecedenceStates; i++) {
+    size_t stateNumber = data[p++];
+    downCast<RuleStartState*>(atn->states[stateNumber])->isLeftRecursiveRule = true;
+  }
+
+  //
+  // RULES
+  //
+  size_t nrules = data[p++];
+  atn->ruleToStartState.reserve(nrules);
+  for (size_t i = 0; i < nrules; i++) {
+    size_t s = data[p++];
+    // Also here, the serialized atn must ensure to point to the correct class type.
+    RuleStartState *startState = downCast<RuleStartState*>(atn->states[s]);
+    atn->ruleToStartState.push_back(startState);
+    if (atn->grammarType == ATNType::LEXER) {
+      size_t tokenType = data[p++];
+      atn->ruleToTokenType.push_back(tokenType);
+    }
+  }
+
+  atn->ruleToStopState.resize(nrules);
+  for (ATNState *state : atn->states) {
+    if (!RuleStopState::is(state)) {
+      continue;
+    }
+
+    RuleStopState *stopState = downCast<RuleStopState*>(state);
+    atn->ruleToStopState[state->ruleIndex] = stopState;
+    atn->ruleToStartState[state->ruleIndex]->stopState = stopState;
+  }
+
+  //
+  // MODES
+  //
+  size_t nmodes = data[p++];
+  atn->modeToStartState.reserve(nmodes);
+  for (size_t i = 0; i < nmodes; i++) {
+    size_t s = data[p++];
+    atn->modeToStartState.push_back(downCast<TokensStartState*>(atn->states[s]));
+  }
+
+  //
+  // SETS
+  //
+  {
+    std::vector<misc::IntervalSet> sets;
+
+    deserializeSets(data, p, sets);
+    sets.shrink_to_fit();
+
+    //
+    // EDGES
+    //
+    int nedges = data[p++];
+    for (int i = 0; i < nedges; i++) {
+      size_t src = data[p];
+      size_t trg = data[p + 1];
+      TransitionType ttype = static_cast<TransitionType>(data[p + 2]);
+      size_t arg1 = data[p + 3];
+      size_t arg2 = data[p + 4];
+      size_t arg3 = data[p + 5];
+      ConstTransitionPtr trans = edgeFactory(*atn, ttype, trg, arg1, arg2, arg3, sets);
+      ATNState *srcState = atn->states[src];
+      srcState->addTransition(std::move(trans));
+      p += 6;
+    }
+  }
+  // edges for rule stop states can be derived, so they aren't serialized
+  for (ATNState *state : atn->states) {
+    for (size_t i = 0; i < state->transitions.size(); i++) {
+      const Transition *t = state->transitions[i].get();
+      if (!RuleTransition::is(t)) {
+        continue;
+      }
+
+      const RuleTransition *ruleTransition = downCast<const RuleTransition*>(t);
+      size_t outermostPrecedenceReturn = INVALID_INDEX;
+      if (atn->ruleToStartState[ruleTransition->target->ruleIndex]->isLeftRecursiveRule) {
+        if (ruleTransition->precedence == 0) {
+          outermostPrecedenceReturn = ruleTransition->target->ruleIndex;
+        }
+      }
+
+      ConstTransitionPtr returnTransition = std::make_unique<EpsilonTransition>(ruleTransition->followState, outermostPrecedenceReturn);
+      atn->ruleToStopState[ruleTransition->target->ruleIndex]->addTransition(std::move(returnTransition));
+    }
+  }
+
+  for (ATNState *state : atn->states) {
+    if (BlockStartState::is(state)) {
+      BlockStartState *startState = downCast<BlockStartState*>(state);
+
+      // we need to know the end state to set its start state
+      if (startState->endState == nullptr) {
+        throw IllegalStateException();
+      }
+
+      // block end states can only be associated to a single block start state
+      if (startState->endState->startState != nullptr) {
+        throw IllegalStateException();
+      }
+
+      startState->endState->startState = downCast<BlockStartState*>(state);
+    }
+
+    if (PlusLoopbackState::is(state)) {
+      PlusLoopbackState *loopbackState = downCast<PlusLoopbackState*>(state);
+      for (size_t i = 0; i < loopbackState->transitions.size(); i++) {
+        ATNState *target = loopbackState->transitions[i]->target;
+        if (PlusBlockStartState::is(target)) {
+          (downCast<PlusBlockStartState*>(target))->loopBackState = loopbackState;
+        }
+      }
+    } else if (StarLoopbackState::is(state)) {
+      StarLoopbackState *loopbackState = downCast<StarLoopbackState*>(state);
+      for (size_t i = 0; i < loopbackState->transitions.size(); i++) {
+        ATNState *target = loopbackState->transitions[i]->target;
+        if (StarLoopEntryState::is(target)) {
+          downCast<StarLoopEntryState*>(target)->loopBackState = loopbackState;
+        }
+      }
+    }
+  }
+
+  //
+  // DECISIONS
+  //
+  size_t ndecisions = data[p++];
+  atn->decisionToState.reserve(ndecisions);
+  for (size_t i = 0; i < ndecisions; i++) {
+    size_t s = data[p++];
+    DecisionState *decState = downCast<DecisionState*>(atn->states[s]);
+    if (decState == nullptr)
+      throw IllegalStateException();
+
+    atn->decisionToState.push_back(decState);
+    decState->decision = static_cast<int>(i);
+  }
+
+  //
+  // LEXER ACTIONS
+  //
+  if (atn->grammarType == ATNType::LEXER) {
+    atn->lexerActions.resize(data[p++]);
+    for (size_t i = 0; i < atn->lexerActions.size(); i++) {
+      LexerActionType actionType = static_cast<LexerActionType>(data[p++]);
+      int data1 = data[p++];
+      int data2 = data[p++];
+      atn->lexerActions[i] = lexerActionFactory(actionType, data1, data2);
+    }
+  }
+
+  markPrecedenceDecisions(*atn);
+
+  if (_deserializationOptions.isVerifyATN()) {
+    verifyATN(*atn);
+  }
+
+  if (_deserializationOptions.isGenerateRuleBypassTransitions() && atn->grammarType == ATNType::PARSER) {
+    atn->ruleToTokenType.resize(atn->ruleToStartState.size());
+    for (size_t i = 0; i < atn->ruleToStartState.size(); i++) {
+      atn->ruleToTokenType[i] = static_cast<int>(atn->maxTokenType + i + 1);
+    }
+
+    for (std::vector<RuleStartState*>::size_type i = 0; i < atn->ruleToStartState.size(); i++) {
+      BasicBlockStartState *bypassStart = new BasicBlockStartState(); /* mem check: freed in ATN d-tor */
+      bypassStart->ruleIndex = static_cast<int>(i);
+      atn->addState(bypassStart);
+
+      BlockEndState *bypassStop = new BlockEndState(); /* mem check: freed in ATN d-tor */
+      bypassStop->ruleIndex = static_cast<int>(i);
+      atn->addState(bypassStop);
+
+      bypassStart->endState = bypassStop;
+      atn->defineDecisionState(bypassStart);
+
+      bypassStop->startState = bypassStart;
+
+      ATNState *endState;
+      const Transition *excludeTransition = nullptr;
+      if (atn->ruleToStartState[i]->isLeftRecursiveRule) {
+        // wrap from the beginning of the rule to the StarLoopEntryState
+        endState = nullptr;
+        for (ATNState *state : atn->states) {
+          if (state->ruleIndex != i) {
+            continue;
+          }
+
+          if (!StarLoopEntryState::is(state)) {
+            continue;
+          }
+
+          ATNState *maybeLoopEndState = state->transitions[state->transitions.size() - 1]->target;
+          if (!LoopEndState::is(maybeLoopEndState)) {
+            continue;
+          }
+
+          if (maybeLoopEndState->epsilonOnlyTransitions && RuleStopState::is(maybeLoopEndState->transitions[0]->target)) {
+            endState = state;
+            break;
+          }
+        }
+
+        if (endState == nullptr) {
+          throw UnsupportedOperationException("Couldn't identify final state of the precedence rule prefix section.");
+
+        }
+
+        excludeTransition = (static_cast<StarLoopEntryState*>(endState))->loopBackState->transitions[0].get();
+      } else {
+        endState = atn->ruleToStopState[i];
+      }
+
+      // all non-excluded transitions that currently target end state need to target blockEnd instead
+      for (ATNState *state : atn->states) {
+        for (auto &transition : state->transitions) {
+          if (transition.get() == excludeTransition) {
+            continue;
+          }
+
+          if (transition->target == endState) {
+            const_cast<Transition*>(transition.get())->target = bypassStop;
+          }
+        }
+      }
+
+      // all transitions leaving the rule start state need to leave blockStart instead
+      while (atn->ruleToStartState[i]->transitions.size() > 0) {
+        ConstTransitionPtr transition = atn->ruleToStartState[i]->removeTransition(atn->ruleToStartState[i]->transitions.size() - 1);
+        bypassStart->addTransition(std::move(transition));
+      }
+
+      // link the new states
+      atn->ruleToStartState[i]->addTransition(std::make_unique<EpsilonTransition>(bypassStart));
+      bypassStop->addTransition(std::make_unique<EpsilonTransition>(endState));
+
+      ATNState *matchState = new BasicState(); /* mem check: freed in ATN d-tor */
+      atn->addState(matchState);
+      matchState->addTransition(std::make_unique<AtomTransition>(bypassStop, atn->ruleToTokenType[i]));
+      bypassStart->addTransition(std::make_unique<EpsilonTransition>(matchState));
+    }
+
+    if (_deserializationOptions.isVerifyATN()) {
+      // reverify after modification
+      verifyATN(*atn);
+    }
+  }
+
+  return atn;
+}
+
+void ATNDeserializer::verifyATN(const ATN &atn) const {
+  // verify assumptions
+  for (ATNState *state : atn.states) {
+    if (state == nullptr) {
+      continue;
+    }
+
+    checkCondition(state->epsilonOnlyTransitions || state->transitions.size() <= 1);
+
+    if (PlusBlockStartState::is(state)) {
+      checkCondition((downCast<PlusBlockStartState*>(state))->loopBackState != nullptr);
+    }
+
+    if (StarLoopEntryState::is(state)) {
+      StarLoopEntryState *starLoopEntryState = downCast<StarLoopEntryState*>(state);
+      checkCondition(starLoopEntryState->loopBackState != nullptr);
+      checkCondition(starLoopEntryState->transitions.size() == 2);
+
+      if (StarBlockStartState::is(starLoopEntryState->transitions[0]->target)) {
+        checkCondition(downCast<LoopEndState*>(starLoopEntryState->transitions[1]->target) != nullptr);
+        checkCondition(!starLoopEntryState->nonGreedy);
+      } else if (LoopEndState::is(starLoopEntryState->transitions[0]->target)) {
+        checkCondition(StarBlockStartState::is(starLoopEntryState->transitions[1]->target));
+        checkCondition(starLoopEntryState->nonGreedy);
+      } else {
+        throw IllegalStateException();
+      }
+    }
+
+    if (StarLoopbackState::is(state)) {
+      checkCondition(state->transitions.size() == 1);
+      checkCondition(StarLoopEntryState::is(state->transitions[0]->target));
+    }
+
+    if (LoopEndState::is(state)) {
+      checkCondition((downCast<LoopEndState*>(state))->loopBackState != nullptr);
+    }
+
+    if (RuleStartState::is(state)) {
+      checkCondition((downCast<RuleStartState*>(state))->stopState != nullptr);
+    }
+
+    if (BlockStartState::is(state)) {
+      checkCondition((downCast<BlockStartState*>(state))->endState != nullptr);
+    }
+
+    if (BlockEndState::is(state)) {
+      checkCondition((downCast<BlockEndState*>(state))->startState != nullptr);
+    }
+
+    if (DecisionState::is(state)) {
+      DecisionState *decisionState = downCast<DecisionState*>(state);
+      checkCondition(decisionState->transitions.size() <= 1 || decisionState->decision >= 0);
+    } else {
+      checkCondition(state->transitions.size() <= 1 || RuleStopState::is(state));
+    }
+  }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializer.h
new file mode 100755
index 0000000000..9be49159fd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNDeserializer.h
@@ -0,0 +1,32 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNDeserializationOptions.h"
+#include "atn/SerializedATNView.h"
+#include "atn/LexerAction.h"
+#include "atn/Transition.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC ATNDeserializer final {
+  public:
+    static constexpr size_t SERIALIZED_VERSION = 4;
+
+    ATNDeserializer();
+
+    explicit ATNDeserializer(ATNDeserializationOptions deserializationOptions);
+
+    std::unique_ptr<ATN> deserialize(SerializedATNView input) const;
+    void verifyATN(const ATN &atn) const;
+
+  private:
+    const ATNDeserializationOptions _deserializationOptions;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNSimulator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNSimulator.cpp
new file mode 100755
index 0000000000..3abe6882ff
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNSimulator.cpp
@@ -0,0 +1,33 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATNSimulator.h"
+
+#include "atn/ATNConfigSet.h"
+#include "atn/ATNDeserializer.h"
+#include "atn/ATNType.h"
+#include "dfa/DFAState.h"
+
+using namespace antlr4;
+using namespace antlr4::dfa;
+using namespace antlr4::atn;
+
+const Ref<DFAState> ATNSimulator::ERROR = std::make_shared<DFAState>(std::numeric_limits<int>::max());
+
+ATNSimulator::ATNSimulator(const ATN &atn, PredictionContextCache &sharedContextCache)
+    : atn(atn), _sharedContextCache(sharedContextCache) {}
+
+void ATNSimulator::clearDFA() {
+  throw UnsupportedOperationException("This ATN simulator does not support clearing the DFA.");
+}
+
+PredictionContextCache& ATNSimulator::getSharedContextCache() const {
+  return _sharedContextCache;
+}
+
+Ref<const PredictionContext> ATNSimulator::getCachedContext(const Ref<const PredictionContext> &context) {
+  // This function must only be called with an active state lock, as we are going to change a shared structure.
+  return PredictionContext::getCachedContext(context, getSharedContextCache());
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNSimulator.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNSimulator.h
new file mode 100755
index 0000000000..1b0ebf6db3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNSimulator.h
@@ -0,0 +1,71 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATN.h"
+#include "atn/PredictionContext.h"
+#include "atn/PredictionContextCache.h"
+#include "misc/IntervalSet.h"
+#include "support/CPPUtils.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC ATNSimulator {
+  public:
+    /// Must distinguish between missing edge and edge we know leads nowhere.
+    static const Ref<dfa::DFAState> ERROR;
+    const ATN &atn;
+
+    ATNSimulator(const ATN &atn, PredictionContextCache &sharedContextCache);
+
+    virtual ~ATNSimulator() = default;
+
+    virtual void reset() = 0;
+
+    /**
+     * Clear the DFA cache used by the current instance. Since the DFA cache may
+     * be shared by multiple ATN simulators, this method may affect the
+     * performance (but not accuracy) of other parsers which are being used
+     * concurrently.
+     *
+     * @throws UnsupportedOperationException if the current instance does not
+     * support clearing the DFA.
+     *
+     * @since 4.3
+     */
+    virtual void clearDFA();
+
+    PredictionContextCache& getSharedContextCache() const;
+    Ref<const PredictionContext> getCachedContext(const Ref<const PredictionContext> &context);
+
+  protected:
+    /// <summary>
+    /// The context cache maps all PredictionContext objects that are equals()
+    ///  to a single cached copy. This cache is shared across all contexts
+    ///  in all ATNConfigs in all DFA states.  We rebuild each ATNConfigSet
+    ///  to use only cached nodes/graphs in addDFAState(). We don't want to
+    ///  fill this during closure() since there are lots of contexts that
+    ///  pop up but are not used ever again. It also greatly slows down closure().
+    ///  <p/>
+    ///  This cache makes a huge difference in memory and a little bit in speed.
+    ///  For the Java grammar on java.*, it dropped the memory requirements
+    ///  at the end from 25M to 16M. We don't store any of the full context
+    ///  graphs in the DFA because they are limited to local context only,
+    ///  but apparently there's a lot of repetition there as well. We optimize
+    ///  the config contexts before storing the config set in the DFA states
+    ///  by literally rebuilding them with cached subgraphs only.
+    ///  <p/>
+    ///  I tried a cache for use during closure operations, that was
+    ///  whacked after each adaptivePredict(). It cost a little bit
+    ///  more time I think and doesn't save on the overall footprint
+    ///  so it's not worth the complexity.
+    /// </summary>
+    PredictionContextCache &_sharedContextCache;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNState.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNState.cpp
new file mode 100755
index 0000000000..43deb258a8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNState.cpp
@@ -0,0 +1,56 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATN.h"
+#include "atn/Transition.h"
+#include "misc/IntervalSet.h"
+#include "support/CPPUtils.h"
+
+#include "atn/ATNState.h"
+
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+size_t ATNState::hashCode() const {
+  return stateNumber;
+}
+
+bool ATNState::equals(const ATNState &other) const {
+  return stateNumber == other.stateNumber;
+}
+
+bool ATNState::isNonGreedyExitState() const {
+  return false;
+}
+
+std::string ATNState::toString() const {
+  return std::to_string(stateNumber);
+}
+
+void ATNState::addTransition(ConstTransitionPtr e) {
+  addTransition(transitions.size(), std::move(e));
+}
+
+void ATNState::addTransition(size_t index, ConstTransitionPtr e) {
+  for (const auto &transition : transitions)
+    if (transition->target->stateNumber == e->target->stateNumber) {
+      return;
+    }
+
+  if (transitions.empty()) {
+    epsilonOnlyTransitions = e->isEpsilon();
+  } else if (epsilonOnlyTransitions != e->isEpsilon()) {
+    std::cerr << "ATN state %d has both epsilon and non-epsilon transitions.\n" << stateNumber;
+    epsilonOnlyTransitions = false;
+  }
+
+  transitions.insert(transitions.begin() + index, std::move(e));
+}
+
+ConstTransitionPtr ATNState::removeTransition(size_t index) {
+  ConstTransitionPtr result = std::move(transitions[index]);
+  transitions.erase(transitions.begin() + index);
+  return result;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNState.h
new file mode 100755
index 0000000000..8b3f118e28
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNState.h
@@ -0,0 +1,139 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "misc/IntervalSet.h"
+#include "atn/Transition.h"
+#include "atn/ATNStateType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// The following images show the relation of states and
+  /// <seealso cref="ATNState#transitions"/> for various grammar constructs.
+  ///
+  /// <ul>
+  ///
+  /// <li>Solid edges marked with an &#0949; indicate a required
+  /// <seealso cref="EpsilonTransition"/>.</li>
+  ///
+  /// <li>Dashed edges indicate locations where any transition derived from
+  /// <seealso cref="Transition"/> might appear.</li>
+  ///
+  /// <li>Dashed nodes are place holders for either a sequence of linked
+  /// <seealso cref="BasicState"/> states or the inclusion of a block representing a nested
+  /// construct in one of the forms below.</li>
+  ///
+  /// <li>Nodes showing multiple outgoing alternatives with a {@code ...} support
+  /// any number of alternatives (one or more). Nodes without the {@code ...} only
+  /// support the exact number of alternatives shown in the diagram.</li>
+  ///
+  /// </ul>
+  ///
+  /// <h2>Basic Blocks</h2>
+  ///
+  /// <h3>Rule</h3>
+  ///
+  /// <embed src="images/Rule.svg" type="image/svg+xml"/>
+  ///
+  /// <h3>Block of 1 or more alternatives</h3>
+  ///
+  /// <embed src="images/Block.svg" type="image/svg+xml"/>
+  ///
+  /// <h2>Greedy Loops</h2>
+  ///
+  /// <h3>Greedy Closure: {@code (...)*}</h3>
+  ///
+  /// <embed src="images/ClosureGreedy.svg" type="image/svg+xml"/>
+  ///
+  /// <h3>Greedy Positive Closure: {@code (...)+}</h3>
+  ///
+  /// <embed src="images/PositiveClosureGreedy.svg" type="image/svg+xml"/>
+  ///
+  /// <h3>Greedy Optional: {@code (...)?}</h3>
+  ///
+  /// <embed src="images/OptionalGreedy.svg" type="image/svg+xml"/>
+  ///
+  /// <h2>Non-Greedy Loops</h2>
+  ///
+  /// <h3>Non-Greedy Closure: {@code (...)*?}</h3>
+  ///
+  /// <embed src="images/ClosureNonGreedy.svg" type="image/svg+xml"/>
+  ///
+  /// <h3>Non-Greedy Positive Closure: {@code (...)+?}</h3>
+  ///
+  /// <embed src="images/PositiveClosureNonGreedy.svg" type="image/svg+xml"/>
+  ///
+  /// <h3>Non-Greedy Optional: {@code (...)??}</h3>
+  ///
+  /// <embed src="images/OptionalNonGreedy.svg" type="image/svg+xml"/>
+  /// </summary>
+
+// GCC generates a warning here if ATN has already been declared due to the
+// attributes added by ANTLR4CPP_PUBLIC.
+// See: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=39159
+// Only forward-declare if it hasn't already been declared.
+#ifndef ANTLR4CPP_ATN_DECLARED
+  class ANTLR4CPP_PUBLIC ATN;
+#endif
+
+  class ANTLR4CPP_PUBLIC ATNState {
+  public:
+    static constexpr size_t INITIAL_NUM_TRANSITIONS = 4;
+    static constexpr size_t INVALID_STATE_NUMBER = std::numeric_limits<size_t>::max();
+
+    size_t stateNumber = INVALID_STATE_NUMBER;
+    size_t ruleIndex = 0; // at runtime, we don't have Rule objects
+    bool epsilonOnlyTransitions = false;
+
+    /// Track the transitions emanating from this ATN state.
+    std::vector<ConstTransitionPtr> transitions;
+
+    ATNState() = delete;
+
+    ATNState(ATNState const&) = delete;
+
+    ATNState(ATNState&&) = delete;
+
+    virtual ~ATNState() = default;
+
+    ATNState& operator=(ATNState const&) = delete;
+
+    ATNState& operator=(ATNState&&) = delete;
+
+    void addTransition(ConstTransitionPtr e);
+    void addTransition(size_t index, ConstTransitionPtr e);
+    ConstTransitionPtr removeTransition(size_t index);
+
+    virtual size_t hashCode() const;
+    virtual bool equals(const ATNState &other) const;
+
+    virtual bool isNonGreedyExitState() const;
+    virtual std::string toString() const;
+
+    ATNStateType getStateType() const { return _stateType; }
+
+  protected:
+    explicit ATNState(ATNStateType stateType) : _stateType(stateType) {}
+
+  private:
+    /// Used to cache lookahead during parsing, not used during construction.
+
+    misc::IntervalSet _nextTokenWithinRule;
+    std::atomic<bool> _nextTokenUpdated { false };
+
+    const ATNStateType _stateType;
+
+    friend class ATN;
+  };
+
+  inline bool operator==(const ATNState &lhs, const ATNState &rhs) { return lhs.equals(rhs); }
+
+  inline bool operator!=(const ATNState &lhs, const ATNState &rhs) { return !operator==(lhs, rhs); }
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNStateType.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNStateType.cpp
new file mode 100644
index 0000000000..577e2af87c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNStateType.cpp
@@ -0,0 +1,33 @@
+#include "atn/ATNStateType.h"
+
+std::string antlr4::atn::atnStateTypeName(ATNStateType atnStateType) {
+  switch (atnStateType) {
+    case ATNStateType::INVALID:
+      return "INVALID";
+    case ATNStateType::BASIC:
+      return "BASIC";
+    case ATNStateType::RULE_START:
+      return "RULE_START";
+    case ATNStateType::BLOCK_START:
+      return "BLOCK_START";
+    case ATNStateType::PLUS_BLOCK_START:
+      return "PLUS_BLOCK_START";
+    case ATNStateType::STAR_BLOCK_START:
+      return "STAR_BLOCK_START";
+    case ATNStateType::TOKEN_START:
+      return "TOKEN_START";
+    case ATNStateType::RULE_STOP:
+      return "RULE_STOP";
+    case ATNStateType::BLOCK_END:
+      return "BLOCK_END";
+    case ATNStateType::STAR_LOOP_BACK:
+      return "STAR_LOOP_BACK";
+    case ATNStateType::STAR_LOOP_ENTRY:
+      return "STAR_LOOP_ENTRY";
+    case ATNStateType::PLUS_LOOP_BACK:
+      return "PLUS_LOOP_BACK";
+    case ATNStateType::LOOP_END:
+      return "LOOP_END";
+  }
+  return "UNKNOWN";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNStateType.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNStateType.h
new file mode 100644
index 0000000000..e19b2cce92
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNStateType.h
@@ -0,0 +1,36 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cstddef>
+#include <string>
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+  // Constants for ATNState serialization.
+  enum class ATNStateType : size_t {
+    INVALID = 0,
+    BASIC = 1,
+    RULE_START = 2,
+    BLOCK_START = 3,
+    PLUS_BLOCK_START = 4,
+    STAR_BLOCK_START = 5,
+    TOKEN_START = 6,
+    RULE_STOP = 7,
+    BLOCK_END = 8,
+    STAR_LOOP_BACK = 9,
+    STAR_LOOP_ENTRY = 10,
+    PLUS_LOOP_BACK = 11,
+    LOOP_END = 12,
+  };
+
+  ANTLR4CPP_PUBLIC std::string atnStateTypeName(ATNStateType atnStateType);
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNType.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNType.h
new file mode 100755
index 0000000000..19ed7a6695
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ATNType.h
@@ -0,0 +1,20 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// Represents the type of recognizer an ATN applies to.
+  enum class ATNType {
+    LEXER = 0,
+    PARSER = 1,
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ActionTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ActionTransition.cpp
new file mode 100755
index 0000000000..45930c42c8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ActionTransition.cpp
@@ -0,0 +1,29 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ActionTransition.h"
+
+using namespace antlr4::atn;
+
+ActionTransition::ActionTransition(ATNState *target, size_t ruleIndex)
+  : Transition(TransitionType::ACTION, target), ruleIndex(ruleIndex), actionIndex(INVALID_INDEX), isCtxDependent(false) {
+}
+
+ActionTransition::ActionTransition(ATNState *target, size_t ruleIndex, size_t actionIndex, bool isCtxDependent)
+  : Transition(TransitionType::ACTION, target), ruleIndex(ruleIndex), actionIndex(actionIndex), isCtxDependent(isCtxDependent) {
+}
+
+bool ActionTransition::isEpsilon() const {
+  return true; // we are to be ignored by analysis 'cept for predicates
+}
+
+bool ActionTransition::matches(size_t /*symbol*/, size_t /*minVocabSymbol*/, size_t /*maxVocabSymbol*/) const {
+  return false;
+}
+
+std::string ActionTransition::toString() const {
+  return " ACTION " + Transition::toString() + " { ruleIndex: " + std::to_string(ruleIndex) + ", actionIndex: " +
+  std::to_string(actionIndex) + ", isCtxDependent: " + std::to_string(isCtxDependent) + " }";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ActionTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ActionTransition.h
new file mode 100755
index 0000000000..0c6b9afce7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ActionTransition.h
@@ -0,0 +1,35 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/Transition.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC ActionTransition final : public Transition {
+  public:
+    static bool is(const Transition &transition) { return transition.getTransitionType() == TransitionType::ACTION; }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    const size_t ruleIndex;
+    const size_t actionIndex;
+    const bool isCtxDependent; // e.g., $i ref in action
+
+    ActionTransition(ATNState *target, size_t ruleIndex);
+
+    ActionTransition(ATNState *target, size_t ruleIndex, size_t actionIndex, bool isCtxDependent);
+
+    virtual bool isEpsilon() const override;
+
+    virtual bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+
+    virtual std::string toString() const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AmbiguityInfo.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AmbiguityInfo.cpp
new file mode 100755
index 0000000000..72ce922633
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AmbiguityInfo.cpp
@@ -0,0 +1,16 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/AmbiguityInfo.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+AmbiguityInfo::AmbiguityInfo(size_t decision, ATNConfigSet *configs, const antlrcpp::BitSet &ambigAlts,
+                             TokenStream *input, size_t startIndex, size_t stopIndex, bool fullCtx)
+  : DecisionEventInfo(decision, configs, input, startIndex, stopIndex, fullCtx) {
+
+  this->ambigAlts = ambigAlts;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AmbiguityInfo.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AmbiguityInfo.h
new file mode 100755
index 0000000000..db594a1f48
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AmbiguityInfo.h
@@ -0,0 +1,68 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionEventInfo.h"
+#include "support/BitSet.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// This class represents profiling event information for an ambiguity.
+  /// Ambiguities are decisions where a particular input resulted in an SLL
+  /// conflict, followed by LL prediction also reaching a conflict state
+  /// (indicating a true ambiguity in the grammar).
+  ///
+  /// <para>
+  /// This event may be reported during SLL prediction in cases where the
+  /// conflicting SLL configuration set provides sufficient information to
+  /// determine that the SLL conflict is truly an ambiguity. For example, if none
+  /// of the ATN configurations in the conflicting SLL configuration set have
+  /// traversed a global follow transition (i.e.
+  /// <seealso cref="ATNConfig#reachesIntoOuterContext"/> is 0 for all configurations), then
+  /// the result of SLL prediction for that input is known to be equivalent to the
+  /// result of LL prediction for that input.</para>
+  ///
+  /// <para>
+  /// In some cases, the minimum represented alternative in the conflicting LL
+  /// configuration set is not equal to the minimum represented alternative in the
+  /// conflicting SLL configuration set. Grammars and inputs which result in this
+  /// scenario are unable to use <seealso cref="PredictionMode#SLL"/>, which in turn means
+  /// they cannot use the two-stage parsing strategy to improve parsing performance
+  /// for that input.</para>
+  /// </summary>
+  /// <seealso cref= ParserATNSimulator#reportAmbiguity </seealso>
+  /// <seealso cref= ANTLRErrorListener#reportAmbiguity
+  ///
+  /// @since 4.3 </seealso>
+  class ANTLR4CPP_PUBLIC AmbiguityInfo : public DecisionEventInfo {
+  public:
+    /// The set of alternative numbers for this decision event that lead to a valid parse.
+    antlrcpp::BitSet ambigAlts;
+
+    /// <summary>
+    /// Constructs a new instance of the <seealso cref="AmbiguityInfo"/> class with the
+    /// specified detailed ambiguity information.
+    /// </summary>
+    /// <param name="decision"> The decision number </param>
+    /// <param name="configs"> The final configuration set identifying the ambiguous
+    /// alternatives for the current input </param>
+    /// <param name="ambigAlts"> The set of alternatives in the decision that lead to a valid parse.
+    ///                  The predicted alt is the min(ambigAlts) </param>
+    /// <param name="input"> The input token stream </param>
+    /// <param name="startIndex"> The start index for the current prediction </param>
+    /// <param name="stopIndex"> The index at which the ambiguity was identified during
+    /// prediction </param>
+    /// <param name="fullCtx"> {@code true} if the ambiguity was identified during LL
+    /// prediction; otherwise, {@code false} if the ambiguity was identified
+    /// during SLL prediction </param>
+    AmbiguityInfo(size_t decision, ATNConfigSet *configs, const antlrcpp::BitSet &ambigAlts, TokenStream *input,
+                  size_t startIndex, size_t stopIndex, bool fullCtx);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ArrayPredictionContext.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ArrayPredictionContext.cpp
new file mode 100755
index 0000000000..70dfa15ac0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ArrayPredictionContext.cpp
@@ -0,0 +1,129 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ArrayPredictionContext.h"
+
+#include <cstring>
+
+#include "atn/SingletonPredictionContext.h"
+#include "atn/HashUtils.h"
+#include "misc/MurmurHash.h"
+#include "support/Casts.h"
+
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+using namespace antlrcpp;
+
+namespace {
+
+  bool predictionContextEqual(const Ref<const PredictionContext> &lhs, const Ref<const PredictionContext> &rhs) {
+    // parent PredictionContext pointers can be null during full context mode and
+    // the ctxs are in an ArrayPredictionContext.  If both are null, return true
+    // if just one is null, return false. If both are non-null, do comparison.
+    if ( lhs == nullptr ) return rhs == nullptr;
+    if ( rhs == nullptr ) return false; // lhs!=null and rhs==null
+    return *lhs == *rhs;                // both nonnull
+  }
+
+}
+
+ArrayPredictionContext::ArrayPredictionContext(const SingletonPredictionContext &predictionContext)
+    : ArrayPredictionContext({ predictionContext.parent }, { predictionContext.returnState }) {}
+
+ArrayPredictionContext::ArrayPredictionContext(std::vector<Ref<const PredictionContext>> parents,
+                                               std::vector<size_t> returnStates)
+    : PredictionContext(PredictionContextType::ARRAY), parents(std::move(parents)), returnStates(std::move(returnStates)) {
+  assert(this->parents.size() > 0);
+  assert(this->returnStates.size() > 0);
+  assert(this->parents.size() == this->returnStates.size());
+}
+
+bool ArrayPredictionContext::isEmpty() const {
+  // Since EMPTY_RETURN_STATE can only appear in the last position, we don't need to verify that size == 1.
+  return returnStates[0] == EMPTY_RETURN_STATE;
+}
+
+size_t ArrayPredictionContext::size() const {
+  return returnStates.size();
+}
+
+const Ref<const PredictionContext>& ArrayPredictionContext::getParent(size_t index) const {
+  return parents[index];
+}
+
+size_t ArrayPredictionContext::getReturnState(size_t index) const {
+  return returnStates[index];
+}
+
+size_t ArrayPredictionContext::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getContextType()));
+  for (const auto &parent : parents) {
+    hash = MurmurHash::update(hash, parent);
+  }
+  for (const auto &returnState : returnStates) {
+    hash = MurmurHash::update(hash, returnState);
+  }
+  return MurmurHash::finish(hash, 1 + parents.size() + returnStates.size());
+}
+
+bool ArrayPredictionContext::equals(const PredictionContext &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  if (getContextType() != other.getContextType()) {
+    return false;
+  }
+  const auto &array = downCast<const ArrayPredictionContext&>(other);
+  const bool sameSize = returnStates.size() == array.returnStates.size() &&
+                        parents.size() == array.parents.size();
+  if ( !sameSize ) {
+      return false;
+  }
+
+  const bool sameHash = cachedHashCodeEqual(cachedHashCode(), array.cachedHashCode());
+  if ( !sameHash ) {
+      return false;
+  }
+
+  const size_t stateSizeBytes = sizeof(decltype(returnStates)::value_type);
+  const bool returnStateArraysEqual =
+          std::memcmp(returnStates.data(), array.returnStates.data(),
+                      returnStates.size() * stateSizeBytes) == 0;
+  if ( !returnStateArraysEqual ) {
+      return false;
+  }
+
+  // stack of contexts is the same
+  const bool parentCtxEqual =
+          std::equal(parents.begin(), parents.end(), array.parents.begin(), predictionContextEqual);
+  return parentCtxEqual;
+}
+
+std::string ArrayPredictionContext::toString() const {
+  if (isEmpty()) {
+    return "[]";
+  }
+
+  std::stringstream ss;
+  ss << "[";
+  for (size_t i = 0; i < returnStates.size(); i++) {
+    if (i > 0) {
+      ss << ", ";
+    }
+    if (returnStates[i] == EMPTY_RETURN_STATE) {
+      ss << "$";
+      continue;
+    }
+    ss << returnStates[i];
+    if (parents[i] != nullptr) {
+      ss << " " << parents[i]->toString();
+    } else {
+      ss << "nul";
+    }
+  }
+  ss << "]";
+  return ss.str();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ArrayPredictionContext.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ArrayPredictionContext.h
new file mode 100755
index 0000000000..adc2ca4ce4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ArrayPredictionContext.h
@@ -0,0 +1,51 @@
+
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/PredictionContext.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class SingletonPredictionContext;
+
+  class ANTLR4CPP_PUBLIC ArrayPredictionContext final : public PredictionContext {
+  public:
+    static bool is(const PredictionContext &predictionContext) { return predictionContext.getContextType() == PredictionContextType::ARRAY; }
+
+    static bool is(const PredictionContext *predictionContext) { return predictionContext != nullptr && is(*predictionContext); }
+
+    /// Parent can be empty only if full ctx mode and we make an array
+    /// from EMPTY and non-empty. We merge EMPTY by using null parent and
+    /// returnState == EMPTY_RETURN_STATE.
+    // Also here: we use a strong reference to our parents to avoid having them freed prematurely.
+    //            See also SinglePredictionContext.
+    std::vector<Ref<const PredictionContext>> parents;
+
+    /// Sorted for merge, no duplicates; if present, EMPTY_RETURN_STATE is always last.
+    std::vector<size_t> returnStates;
+
+    explicit ArrayPredictionContext(const SingletonPredictionContext &predictionContext);
+
+    ArrayPredictionContext(std::vector<Ref<const PredictionContext>> parents, std::vector<size_t> returnStates);
+
+    ArrayPredictionContext(ArrayPredictionContext&&) = default;
+
+    bool isEmpty() const override;
+    size_t size() const override;
+    const Ref<const PredictionContext>& getParent(size_t index) const override;
+    size_t getReturnState(size_t index) const override;
+    bool equals(const PredictionContext &other) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AtomTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AtomTransition.cpp
new file mode 100755
index 0000000000..4424980cde
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AtomTransition.cpp
@@ -0,0 +1,27 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/IntervalSet.h"
+#include "atn/Transition.h"
+
+#include "atn/AtomTransition.h"
+
+using namespace antlr4::misc;
+using namespace antlr4::atn;
+
+AtomTransition::AtomTransition(ATNState *target, size_t label) : Transition(TransitionType::ATOM, target), _label(label) {
+}
+
+IntervalSet AtomTransition::label() const {
+  return IntervalSet::of((int)_label);
+}
+
+bool AtomTransition::matches(size_t symbol, size_t /*minVocabSymbol*/, size_t /*maxVocabSymbol*/) const {
+  return _label == symbol;
+}
+
+std::string AtomTransition::toString() const {
+  return "ATOM " + Transition::toString() + " { label: " + std::to_string(_label) + " }";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AtomTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AtomTransition.h
new file mode 100755
index 0000000000..db62a7feab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/AtomTransition.h
@@ -0,0 +1,33 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/Transition.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// TODO: make all transitions sets? no, should remove set edges.
+  class ANTLR4CPP_PUBLIC AtomTransition final : public Transition {
+  public:
+    static bool is(const Transition &transition) { return transition.getTransitionType() == TransitionType::ATOM; }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    /// The token type or character value; or, signifies special label.
+    /// TODO: rename this to label
+    const size_t _label;
+
+    AtomTransition(ATNState *target, size_t label);
+
+    virtual misc::IntervalSet label() const override;
+    virtual bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+
+    virtual std::string toString() const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BasicBlockStartState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BasicBlockStartState.h
new file mode 100755
index 0000000000..c5a588fbfd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BasicBlockStartState.h
@@ -0,0 +1,24 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+#include "atn/BlockStartState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC BasicBlockStartState final : public BlockStartState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::BLOCK_START; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    BasicBlockStartState() : BlockStartState(ATNStateType::BLOCK_START) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BasicState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BasicState.h
new file mode 100755
index 0000000000..311a966e1d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BasicState.h
@@ -0,0 +1,23 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC BasicState final : public ATNState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::BASIC; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    BasicState() : ATNState(ATNStateType::BASIC) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BlockEndState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BlockEndState.h
new file mode 100755
index 0000000000..a3e067109e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BlockEndState.h
@@ -0,0 +1,26 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// Terminal node of a simple {@code (a|b|c)} block.
+  class ANTLR4CPP_PUBLIC BlockEndState final : public ATNState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::BLOCK_END; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    BlockStartState *startState = nullptr;
+
+    BlockEndState() : ATNState(ATNStateType::BLOCK_END) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BlockStartState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BlockStartState.h
new file mode 100755
index 0000000000..1e4006aef8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/BlockStartState.h
@@ -0,0 +1,30 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  ///  The start of a regular {@code (...)} block.
+  class ANTLR4CPP_PUBLIC BlockStartState : public DecisionState {
+  public:
+    static bool is(const ATNState &atnState) {
+      const auto stateType = atnState.getStateType();
+      return stateType >= ATNStateType::BLOCK_START && stateType <= ATNStateType::STAR_BLOCK_START;
+    }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    BlockEndState *endState = nullptr;
+
+  protected:
+    using DecisionState::DecisionState;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ContextSensitivityInfo.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ContextSensitivityInfo.cpp
new file mode 100755
index 0000000000..12442a9bc0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ContextSensitivityInfo.cpp
@@ -0,0 +1,14 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ContextSensitivityInfo.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+ContextSensitivityInfo::ContextSensitivityInfo(size_t decision, ATNConfigSet *configs, TokenStream *input,
+  size_t startIndex, size_t stopIndex)
+  : DecisionEventInfo(decision, configs, input, startIndex, stopIndex, true) {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ContextSensitivityInfo.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ContextSensitivityInfo.h
new file mode 100755
index 0000000000..430ce3b6e8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ContextSensitivityInfo.h
@@ -0,0 +1,47 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionEventInfo.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// This class represents profiling event information for a context sensitivity.
+  /// Context sensitivities are decisions where a particular input resulted in an
+  /// SLL conflict, but LL prediction produced a single unique alternative.
+  ///
+  /// <para>
+  /// In some cases, the unique alternative identified by LL prediction is not
+  /// equal to the minimum represented alternative in the conflicting SLL
+  /// configuration set. Grammars and inputs which result in this scenario are
+  /// unable to use <seealso cref="PredictionMode#SLL"/>, which in turn means they cannot use
+  /// the two-stage parsing strategy to improve parsing performance for that
+  /// input.</para>
+  /// </summary>
+  /// <seealso cref= ParserATNSimulator#reportContextSensitivity </seealso>
+  /// <seealso cref= ANTLRErrorListener#reportContextSensitivity
+  ///
+  /// @since 4.3 </seealso>
+  class ANTLR4CPP_PUBLIC ContextSensitivityInfo : public DecisionEventInfo {
+  public:
+    /// <summary>
+    /// Constructs a new instance of the <seealso cref="ContextSensitivityInfo"/> class
+    /// with the specified detailed context sensitivity information.
+    /// </summary>
+    /// <param name="decision"> The decision number </param>
+    /// <param name="configs"> The final configuration set containing the unique
+    /// alternative identified by full-context prediction </param>
+    /// <param name="input"> The input token stream </param>
+    /// <param name="startIndex"> The start index for the current prediction </param>
+    /// <param name="stopIndex"> The index at which the context sensitivity was
+    /// identified during full-context prediction </param>
+    ContextSensitivityInfo(size_t decision, ATNConfigSet *configs, TokenStream *input, size_t startIndex, size_t stopIndex);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionEventInfo.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionEventInfo.cpp
new file mode 100755
index 0000000000..bca6c778c0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionEventInfo.cpp
@@ -0,0 +1,14 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/DecisionEventInfo.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+DecisionEventInfo::DecisionEventInfo(size_t decision, ATNConfigSet *configs, TokenStream *input, size_t startIndex,
+  size_t stopIndex, bool fullCtx)
+  : decision(decision), configs(configs), input(input), startIndex(startIndex), stopIndex(stopIndex), fullCtx(fullCtx) {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionEventInfo.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionEventInfo.h
new file mode 100755
index 0000000000..af7f5f4b17
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionEventInfo.h
@@ -0,0 +1,70 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// This is the base class for gathering detailed information about prediction
+  /// events which occur during parsing.
+  ///
+  /// Note that we could record the parser call stack at the time this event
+  /// occurred but in the presence of left recursive rules, the stack is kind of
+  /// meaningless. It's better to look at the individual configurations for their
+  /// individual stacks. Of course that is a <seealso cref="PredictionContext"/> object
+  /// not a parse tree node and so it does not have information about the extent
+  /// (start...stop) of the various subtrees. Examining the stack tops of all
+  /// configurations provide the return states for the rule invocations.
+  /// From there you can get the enclosing rule.
+  ///
+  /// @since 4.3
+  /// </summary>
+  class ANTLR4CPP_PUBLIC DecisionEventInfo {
+  public:
+    /// <summary>
+    /// The invoked decision number which this event is related to.
+    /// </summary>
+    /// <seealso cref= ATN#decisionToState </seealso>
+    const size_t decision;
+
+    /// <summary>
+    /// The configuration set containing additional information relevant to the
+    /// prediction state when the current event occurred, or {@code null} if no
+    /// additional information is relevant or available.
+    /// </summary>
+    const ATNConfigSet *configs;
+
+    /// <summary>
+    /// The input token stream which is being parsed.
+    /// </summary>
+    const TokenStream *input;
+
+    /// <summary>
+    /// The token index in the input stream at which the current prediction was
+    /// originally invoked.
+    /// </summary>
+    const size_t startIndex;
+
+    /// <summary>
+    /// The token index in the input stream at which the current event occurred.
+    /// </summary>
+    const size_t stopIndex;
+
+    /// <summary>
+    /// {@code true} if the current event occurred during LL prediction;
+    /// otherwise, {@code false} if the input occurred during SLL prediction.
+    /// </summary>
+    const bool fullCtx;
+
+    DecisionEventInfo(size_t decision, ATNConfigSet *configs, TokenStream *input, size_t startIndex,
+                      size_t stopIndex, bool fullCtx);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionInfo.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionInfo.cpp
new file mode 100755
index 0000000000..ee9b1aac34
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionInfo.cpp
@@ -0,0 +1,25 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ErrorInfo.h"
+#include "atn/LookaheadEventInfo.h"
+
+#include "atn/DecisionInfo.h"
+
+using namespace antlr4::atn;
+
+DecisionInfo::DecisionInfo(size_t decision) : decision(decision) {
+}
+
+std::string DecisionInfo::toString() const {
+  std::stringstream ss;
+
+  ss << "{decision=" << decision << ", contextSensitivities=" << contextSensitivities.size() << ", errors=";
+  ss << errors.size() << ", ambiguities=" << ambiguities.size() << ", SLL_lookahead=" << SLL_TotalLook;
+  ss << ", SLL_ATNTransitions=" << SLL_ATNTransitions << ", SLL_DFATransitions=" << SLL_DFATransitions;
+  ss << ", LL_Fallback=" << LL_Fallback << ", LL_lookahead=" << LL_TotalLook << ", LL_ATNTransitions=" << LL_ATNTransitions << '}';
+
+  return ss.str();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionInfo.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionInfo.h
new file mode 100755
index 0000000000..2b43ad8be9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionInfo.h
@@ -0,0 +1,227 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ContextSensitivityInfo.h"
+#include "atn/AmbiguityInfo.h"
+#include "atn/PredicateEvalInfo.h"
+#include "atn/ErrorInfo.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class LookaheadEventInfo;
+
+  /// <summary>
+  /// This class contains profiling gathered for a particular decision.
+  ///
+  /// <para>
+  /// Parsing performance in ANTLR 4 is heavily influenced by both static factors
+  /// (e.g. the form of the rules in the grammar) and dynamic factors (e.g. the
+  /// choice of input and the state of the DFA cache at the time profiling
+  /// operations are started). For best results, gather and use aggregate
+  /// statistics from a large sample of inputs representing the inputs expected in
+  /// production before using the results to make changes in the grammar.</para>
+  ///
+  /// @since 4.3
+  /// </summary>
+  class ANTLR4CPP_PUBLIC DecisionInfo {
+  public:
+    /// <summary>
+    /// The decision number, which is an index into <seealso cref="ATN#decisionToState"/>.
+    /// </summary>
+    const size_t decision;
+
+    /// <summary>
+    /// The total number of times <seealso cref="ParserATNSimulator#adaptivePredict"/> was
+    /// invoked for this decision.
+    /// </summary>
+    long long invocations = 0;
+
+    /// <summary>
+    /// The total time spent in <seealso cref="ParserATNSimulator#adaptivePredict"/> for
+    /// this decision, in nanoseconds.
+    ///
+    /// <para>
+    /// The value of this field contains the sum of differential results obtained
+    /// by <seealso cref="System#nanoTime()"/>, and is not adjusted to compensate for JIT
+    /// and/or garbage collection overhead. For best accuracy, use a modern JVM
+    /// implementation that provides precise results from
+    /// <seealso cref="System#nanoTime()"/>, and perform profiling in a separate process
+    /// which is warmed up by parsing the input prior to profiling. If desired,
+    /// call <seealso cref="ATNSimulator#clearDFA"/> to reset the DFA cache to its initial
+    /// state before starting the profiling measurement pass.</para>
+    /// </summary>
+    long long timeInPrediction = 0;
+
+    /// <summary>
+    /// The sum of the lookahead required for SLL prediction for this decision.
+    /// Note that SLL prediction is used before LL prediction for performance
+    /// reasons even when <seealso cref="PredictionMode#LL"/> or
+    /// <seealso cref="PredictionMode#LL_EXACT_AMBIG_DETECTION"/> is used.
+    /// </summary>
+    long long SLL_TotalLook = 0;
+
+    /// <summary>
+    /// Gets the minimum lookahead required for any single SLL prediction to
+    /// complete for this decision, by reaching a unique prediction, reaching an
+    /// SLL conflict state, or encountering a syntax error.
+    /// </summary>
+    long long SLL_MinLook = 0;
+
+    /// <summary>
+    /// Gets the maximum lookahead required for any single SLL prediction to
+    /// complete for this decision, by reaching a unique prediction, reaching an
+    /// SLL conflict state, or encountering a syntax error.
+    /// </summary>
+    long long SLL_MaxLook = 0;
+
+    /// Gets the <seealso cref="LookaheadEventInfo"/> associated with the event where the
+    /// <seealso cref="#SLL_MaxLook"/> value was set.
+    Ref<LookaheadEventInfo> SLL_MaxLookEvent;
+
+    /// <summary>
+    /// The sum of the lookahead required for LL prediction for this decision.
+    /// Note that LL prediction is only used when SLL prediction reaches a
+    /// conflict state.
+    /// </summary>
+    long long LL_TotalLook = 0;
+
+    /// <summary>
+    /// Gets the minimum lookahead required for any single LL prediction to
+    /// complete for this decision. An LL prediction completes when the algorithm
+    /// reaches a unique prediction, a conflict state (for
+    /// <seealso cref="PredictionMode#LL"/>, an ambiguity state (for
+    /// <seealso cref="PredictionMode#LL_EXACT_AMBIG_DETECTION"/>, or a syntax error.
+    /// </summary>
+    long long LL_MinLook = 0;
+
+    /// <summary>
+    /// Gets the maximum lookahead required for any single LL prediction to
+    /// complete for this decision. An LL prediction completes when the algorithm
+    /// reaches a unique prediction, a conflict state (for
+    /// <seealso cref="PredictionMode#LL"/>, an ambiguity state (for
+    /// <seealso cref="PredictionMode#LL_EXACT_AMBIG_DETECTION"/>, or a syntax error.
+    /// </summary>
+    long long LL_MaxLook = 0;
+
+    /// <summary>
+    /// Gets the <seealso cref="LookaheadEventInfo"/> associated with the event where the
+    /// <seealso cref="#LL_MaxLook"/> value was set.
+    /// </summary>
+    Ref<LookaheadEventInfo> LL_MaxLookEvent;
+
+    /// <summary>
+    /// A collection of <seealso cref="ContextSensitivityInfo"/> instances describing the
+    /// context sensitivities encountered during LL prediction for this decision.
+    /// </summary>
+    /// <seealso cref= ContextSensitivityInfo </seealso>
+    std::vector<ContextSensitivityInfo> contextSensitivities;
+
+    /// <summary>
+    /// A collection of <seealso cref="ErrorInfo"/> instances describing the parse errors
+    /// identified during calls to <seealso cref="ParserATNSimulator#adaptivePredict"/> for
+    /// this decision.
+    /// </summary>
+    /// <seealso cref= ErrorInfo </seealso>
+    std::vector<ErrorInfo> errors;
+
+    /// <summary>
+    /// A collection of <seealso cref="AmbiguityInfo"/> instances describing the
+    /// ambiguities encountered during LL prediction for this decision.
+    /// </summary>
+    /// <seealso cref= AmbiguityInfo </seealso>
+    std::vector<AmbiguityInfo> ambiguities;
+
+    /// <summary>
+    /// A collection of <seealso cref="PredicateEvalInfo"/> instances describing the
+    /// results of evaluating individual predicates during prediction for this
+    /// decision.
+    /// </summary>
+    /// <seealso cref= PredicateEvalInfo </seealso>
+    std::vector<PredicateEvalInfo> predicateEvals;
+
+    /// <summary>
+    /// The total number of ATN transitions required during SLL prediction for
+    /// this decision. An ATN transition is determined by the number of times the
+    /// DFA does not contain an edge that is required for prediction, resulting
+    /// in on-the-fly computation of that edge.
+    ///
+    /// <para>
+    /// If DFA caching of SLL transitions is employed by the implementation, ATN
+    /// computation may cache the computed edge for efficient lookup during
+    /// future parsing of this decision. Otherwise, the SLL parsing algorithm
+    /// will use ATN transitions exclusively.</para>
+    /// </summary>
+    /// <seealso cref= #SLL_ATNTransitions </seealso>
+    /// <seealso cref= ParserATNSimulator#computeTargetState </seealso>
+    /// <seealso cref= LexerATNSimulator#computeTargetState </seealso>
+    long long SLL_ATNTransitions = 0;
+
+    /// <summary>
+    /// The total number of DFA transitions required during SLL prediction for
+    /// this decision.
+    ///
+    /// <para>If the ATN simulator implementation does not use DFA caching for SLL
+    /// transitions, this value will be 0.</para>
+    /// </summary>
+    /// <seealso cref= ParserATNSimulator#getExistingTargetState </seealso>
+    /// <seealso cref= LexerATNSimulator#getExistingTargetState </seealso>
+    long long SLL_DFATransitions = 0;
+
+    /// <summary>
+    /// Gets the total number of times SLL prediction completed in a conflict
+    /// state, resulting in fallback to LL prediction.
+    ///
+    /// <para>Note that this value is not related to whether or not
+    /// <seealso cref="PredictionMode#SLL"/> may be used successfully with a particular
+    /// grammar. If the ambiguity resolution algorithm applied to the SLL
+    /// conflicts for this decision produce the same result as LL prediction for
+    /// this decision, <seealso cref="PredictionMode#SLL"/> would produce the same overall
+    /// parsing result as <seealso cref="PredictionMode#LL"/>.</para>
+    /// </summary>
+    long long LL_Fallback = 0;
+
+    /// <summary>
+    /// The total number of ATN transitions required during LL prediction for
+    /// this decision. An ATN transition is determined by the number of times the
+    /// DFA does not contain an edge that is required for prediction, resulting
+    /// in on-the-fly computation of that edge.
+    ///
+    /// <para>
+    /// If DFA caching of LL transitions is employed by the implementation, ATN
+    /// computation may cache the computed edge for efficient lookup during
+    /// future parsing of this decision. Otherwise, the LL parsing algorithm will
+    /// use ATN transitions exclusively.</para>
+    /// </summary>
+    /// <seealso cref= #LL_DFATransitions </seealso>
+    /// <seealso cref= ParserATNSimulator#computeTargetState </seealso>
+    /// <seealso cref= LexerATNSimulator#computeTargetState </seealso>
+    long long LL_ATNTransitions = 0;
+
+    /// <summary>
+    /// The total number of DFA transitions required during LL prediction for
+    /// this decision.
+    ///
+    /// <para>If the ATN simulator implementation does not use DFA caching for LL
+    /// transitions, this value will be 0.</para>
+    /// </summary>
+    /// <seealso cref= ParserATNSimulator#getExistingTargetState </seealso>
+    /// <seealso cref= LexerATNSimulator#getExistingTargetState </seealso>
+    long long LL_DFATransitions = 0;
+
+    /// <summary>
+    /// Constructs a new instance of the <seealso cref="DecisionInfo"/> class to contain
+    /// statistics for a particular decision.
+    /// </summary>
+    /// <param name="decision"> The decision number </param>
+    explicit DecisionInfo(size_t decision);
+
+    std::string toString() const;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionState.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionState.cpp
new file mode 100755
index 0000000000..7ec3a9b32f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionState.cpp
@@ -0,0 +1,12 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/DecisionState.h"
+
+using namespace antlr4::atn;
+
+std::string DecisionState::toString() const {
+  return ATNState::toString();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionState.h
new file mode 100755
index 0000000000..f26ad07c93
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/DecisionState.h
@@ -0,0 +1,34 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC DecisionState : public ATNState {
+  public:
+    static bool is(const ATNState &atnState) {
+      const auto stateType = atnState.getStateType();
+      return (stateType >= ATNStateType::BLOCK_START && stateType <= ATNStateType::TOKEN_START) ||
+              stateType == ATNStateType::PLUS_LOOP_BACK ||
+              stateType == ATNStateType::STAR_LOOP_ENTRY;
+    }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    int decision = -1;
+    bool nonGreedy = false;
+
+    virtual std::string toString() const override;
+
+  protected:
+    using ATNState::ATNState;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/EpsilonTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/EpsilonTransition.cpp
new file mode 100755
index 0000000000..1dba801760
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/EpsilonTransition.cpp
@@ -0,0 +1,31 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/EpsilonTransition.h"
+
+using namespace antlr4::atn;
+
+EpsilonTransition::EpsilonTransition(ATNState *target) : EpsilonTransition(target, INVALID_INDEX) {
+}
+
+EpsilonTransition::EpsilonTransition(ATNState *target, size_t outermostPrecedenceReturn)
+  : Transition(TransitionType::EPSILON, target), _outermostPrecedenceReturn(outermostPrecedenceReturn) {
+}
+
+size_t EpsilonTransition::outermostPrecedenceReturn() const {
+  return _outermostPrecedenceReturn;
+}
+
+bool EpsilonTransition::isEpsilon() const {
+  return true;
+}
+
+bool EpsilonTransition::matches(size_t /*symbol*/, size_t /*minVocabSymbol*/, size_t /*maxVocabSymbol*/) const {
+  return false;
+}
+
+std::string EpsilonTransition::toString() const {
+  return "EPSILON " + Transition::toString() + " {}";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/EpsilonTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/EpsilonTransition.h
new file mode 100755
index 0000000000..2cc9cf0b61
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/EpsilonTransition.h
@@ -0,0 +1,42 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/Transition.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC EpsilonTransition final : public Transition {
+  public:
+    static bool is(const Transition &transition) { return transition.getTransitionType() == TransitionType::EPSILON; }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    explicit EpsilonTransition(ATNState *target);
+    EpsilonTransition(ATNState *target, size_t outermostPrecedenceReturn);
+
+    /**
+     * @return the rule index of a precedence rule for which this transition is
+     * returning from, where the precedence value is 0; otherwise, INVALID_INDEX.
+     *
+     * @see ATNConfig#isPrecedenceFilterSuppressed()
+     * @see ParserATNSimulator#applyPrecedenceFilter(ATNConfigSet)
+     * @since 4.4.1
+     */
+    size_t outermostPrecedenceReturn() const;
+
+    virtual bool isEpsilon() const override;
+    virtual bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+
+    virtual std::string toString() const override;
+
+  private:
+    const size_t _outermostPrecedenceReturn; // A rule index.
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ErrorInfo.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ErrorInfo.cpp
new file mode 100755
index 0000000000..efe8507124
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ErrorInfo.cpp
@@ -0,0 +1,15 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATNConfigSet.h"
+
+#include "atn/ErrorInfo.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+ErrorInfo::ErrorInfo(size_t decision, ATNConfigSet *configs, TokenStream *input, size_t startIndex, size_t stopIndex, bool fullCtx)
+  : DecisionEventInfo(decision, configs, input, startIndex, stopIndex, fullCtx) {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ErrorInfo.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ErrorInfo.h
new file mode 100755
index 0000000000..d34642a195
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ErrorInfo.h
@@ -0,0 +1,43 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionEventInfo.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// This class represents profiling event information for a syntax error
+  /// identified during prediction. Syntax errors occur when the prediction
+  /// algorithm is unable to identify an alternative which would lead to a
+  /// successful parse.
+  /// </summary>
+  /// <seealso cref= Parser#notifyErrorListeners(Token, String, RecognitionException) </seealso>
+  /// <seealso cref= ANTLRErrorListener#syntaxError
+  ///
+  /// @since 4.3 </seealso>
+  class ANTLR4CPP_PUBLIC ErrorInfo : public DecisionEventInfo {
+  public:
+    /// <summary>
+    /// Constructs a new instance of the <seealso cref="ErrorInfo"/> class with the
+    /// specified detailed syntax error information.
+    /// </summary>
+    /// <param name="decision"> The decision number </param>
+    /// <param name="configs"> The final configuration set reached during prediction
+    /// prior to reaching the <seealso cref="ATNSimulator#ERROR"/> state </param>
+    /// <param name="input"> The input token stream </param>
+    /// <param name="startIndex"> The start index for the current prediction </param>
+    /// <param name="stopIndex"> The index at which the syntax error was identified </param>
+    /// <param name="fullCtx"> {@code true} if the syntax error was identified during LL
+    /// prediction; otherwise, {@code false} if the syntax error was identified
+    /// during SLL prediction </param>
+    ErrorInfo(size_t decision, ATNConfigSet *configs, TokenStream *input, size_t startIndex, size_t stopIndex,
+              bool fullCtx);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/HashUtils.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/HashUtils.h
new file mode 100644
index 0000000000..690d204857
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/HashUtils.h
@@ -0,0 +1,18 @@
+/* Copyright (c) 2022 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cstddef>
+
+namespace antlr4 {
+namespace atn {
+
+  inline bool cachedHashCodeEqual(size_t lhs, size_t rhs) {
+    return lhs == rhs || lhs == 0 || rhs == 0;
+  }
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LL1Analyzer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LL1Analyzer.cpp
new file mode 100755
index 0000000000..1e6da892e0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LL1Analyzer.cpp
@@ -0,0 +1,189 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/RuleStopState.h"
+#include "atn/Transition.h"
+#include "atn/RuleTransition.h"
+#include "atn/SingletonPredictionContext.h"
+#include "atn/WildcardTransition.h"
+#include "atn/NotSetTransition.h"
+#include "misc/IntervalSet.h"
+#include "atn/ATNConfig.h"
+
+#include "support/CPPUtils.h"
+
+#include "atn/LL1Analyzer.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+namespace {
+
+  struct ATNConfigHasher final {
+    size_t operator()(const ATNConfig& atn_config) const {
+      return atn_config.hashCode();
+    }
+  };
+
+  struct ATNConfigComparer final {
+    bool operator()(const ATNConfig& lhs, const ATNConfig& rhs) const {
+      return lhs == rhs;
+    }
+  };
+
+  class LL1AnalyzerImpl final {
+  public:
+    LL1AnalyzerImpl(const ATN& atn, misc::IntervalSet& look, bool seeThruPreds, bool addEOF) : _atn(atn), _look(look), _seeThruPreds(seeThruPreds), _addEOF(addEOF) {}
+
+    /// <summary>
+    /// Compute set of tokens that can follow {@code s} in the ATN in the
+    /// specified {@code ctx}.
+    /// <p/>
+    /// If {@code ctx} is {@code null} and {@code stopState} or the end of the
+    /// rule containing {@code s} is reached, <seealso cref="Token#EPSILON"/> is added to
+    /// the result set. If {@code ctx} is not {@code null} and {@code addEOF} is
+    /// {@code true} and {@code stopState} or the end of the outermost rule is
+    /// reached, <seealso cref="Token#EOF"/> is added to the result set.
+    /// </summary>
+    /// <param name="s"> the ATN state. </param>
+    /// <param name="stopState"> the ATN state to stop at. This can be a
+    /// <seealso cref="BlockEndState"/> to detect epsilon paths through a closure. </param>
+    /// <param name="ctx"> The outer context, or {@code null} if the outer context should
+    /// not be used. </param>
+    /// <param name="look"> The result lookahead set. </param>
+    /// <param name="lookBusy"> A set used for preventing epsilon closures in the ATN
+    /// from causing a stack overflow. Outside code should pass
+    /// {@code new HashSet<ATNConfig>} for this argument. </param>
+    /// <param name="calledRuleStack"> A set used for preventing left recursion in the
+    /// ATN from causing a stack overflow. Outside code should pass
+    /// {@code new BitSet()} for this argument. </param>
+    /// <param name="seeThruPreds"> {@code true} to true semantic predicates as
+    /// implicitly {@code true} and "see through them", otherwise {@code false}
+    /// to treat semantic predicates as opaque and add <seealso cref="#HIT_PRED"/> to the
+    /// result if one is encountered. </param>
+    /// <param name="addEOF"> Add <seealso cref="Token#EOF"/> to the result if the end of the
+    /// outermost context is reached. This parameter has no effect if {@code ctx}
+    /// is {@code null}. </param>
+    void LOOK(ATNState *s, ATNState *stopState, Ref<const PredictionContext> const& ctx) {
+      if (!_lookBusy.insert(ATNConfig(s, 0, ctx)).second) {
+        return;
+      }
+
+      // ml: s can never be null, hence no need to check if stopState is != null.
+      if (s == stopState) {
+        if (ctx == nullptr) {
+          _look.add(Token::EPSILON);
+          return;
+        } else if (ctx->isEmpty() && _addEOF) {
+          _look.add(Token::EOF);
+          return;
+        }
+      }
+
+      if (s->getStateType() == ATNStateType::RULE_STOP) {
+        if (ctx == nullptr) {
+          _look.add(Token::EPSILON);
+          return;
+        } else if (ctx->isEmpty() && _addEOF) {
+          _look.add(Token::EOF);
+          return;
+        }
+
+        if (ctx != PredictionContext::EMPTY) {
+          bool removed = _calledRuleStack.test(s->ruleIndex);
+          _calledRuleStack[s->ruleIndex] = false;
+          // run thru all possible stack tops in ctx
+          for (size_t i = 0; i < ctx->size(); i++) {
+            ATNState *returnState = _atn.states[ctx->getReturnState(i)];
+            LOOK(returnState, stopState, ctx->getParent(i));
+          }
+          if (removed) {
+            _calledRuleStack.set(s->ruleIndex);
+          }
+          return;
+        }
+      }
+
+      size_t n = s->transitions.size();
+      for (size_t i = 0; i < n; i++) {
+        const Transition *t = s->transitions[i].get();
+        const auto tType = t->getTransitionType();
+
+        if (tType == TransitionType::RULE) {
+          if (_calledRuleStack[(static_cast<const RuleTransition*>(t))->target->ruleIndex]) {
+            continue;
+          }
+
+          Ref<const PredictionContext> newContext = SingletonPredictionContext::create(ctx, (static_cast<const RuleTransition*>(t))->followState->stateNumber);
+
+          _calledRuleStack.set((static_cast<const RuleTransition*>(t))->target->ruleIndex);
+          LOOK(t->target, stopState, newContext);
+          _calledRuleStack[(static_cast<const RuleTransition*>(t))->target->ruleIndex] = false;
+
+        } else if (tType == TransitionType::PREDICATE || tType == TransitionType::PRECEDENCE) {
+          if (_seeThruPreds) {
+            LOOK(t->target, stopState, ctx);
+          } else {
+            _look.add(LL1Analyzer::HIT_PRED);
+          }
+        } else if (t->isEpsilon()) {
+          LOOK(t->target, stopState, ctx);
+        } else if (tType == TransitionType::WILDCARD) {
+          _look.addAll(misc::IntervalSet::of(Token::MIN_USER_TOKEN_TYPE, static_cast<ssize_t>(_atn.maxTokenType)));
+        } else {
+          misc::IntervalSet set = t->label();
+          if (!set.isEmpty()) {
+            if (tType == TransitionType::NOT_SET) {
+              set = set.complement(misc::IntervalSet::of(Token::MIN_USER_TOKEN_TYPE, static_cast<ssize_t>(_atn.maxTokenType)));
+            }
+            _look.addAll(set);
+          }
+        }
+      }
+    }
+
+  private:
+    const ATN& _atn;
+    misc::IntervalSet& _look;
+    antlrcpp::BitSet _calledRuleStack;
+    std::unordered_set<ATNConfig, ATNConfigHasher, ATNConfigComparer> _lookBusy;
+    bool _seeThruPreds;
+    bool _addEOF;
+  };
+
+}
+
+std::vector<misc::IntervalSet> LL1Analyzer::getDecisionLookahead(ATNState *s) const {
+  std::vector<misc::IntervalSet> look;
+
+  if (s == nullptr) {
+    return look;
+  }
+
+  look.resize(s->transitions.size()); // Fills all interval sets with defaults.
+  for (size_t alt = 0; alt < s->transitions.size(); alt++) {
+    LL1AnalyzerImpl impl(_atn, look[alt], false, false);
+    impl.LOOK(s->transitions[alt]->target, nullptr, PredictionContext::EMPTY);
+    // Wipe out lookahead for this alternative if we found nothing
+    // or we had a predicate when we !seeThruPreds
+    if (look[alt].size() == 0 || look[alt].contains(LL1Analyzer::HIT_PRED)) {
+      look[alt].clear();
+    }
+  }
+  return look;
+}
+
+misc::IntervalSet LL1Analyzer::LOOK(ATNState *s, RuleContext *ctx) const {
+  return LOOK(s, nullptr, ctx);
+}
+
+misc::IntervalSet LL1Analyzer::LOOK(ATNState *s, ATNState *stopState, RuleContext *ctx) const {
+  Ref<const PredictionContext> lookContext = ctx != nullptr ? PredictionContext::fromRuleContext(_atn, ctx) : nullptr;
+  misc::IntervalSet r;
+  LL1AnalyzerImpl impl(_atn, r, true, true);
+  impl.LOOK(s, stopState, lookContext);
+  return r;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LL1Analyzer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LL1Analyzer.h
new file mode 100755
index 0000000000..cf17501d24
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LL1Analyzer.h
@@ -0,0 +1,76 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Token.h"
+#include "atn/ATNConfig.h"
+#include "atn/PredictionContext.h"
+#include "support/BitSet.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC LL1Analyzer final {
+  public:
+    /// Special value added to the lookahead sets to indicate that we hit
+    ///  a predicate during analysis if {@code seeThruPreds==false}.
+    static constexpr size_t HIT_PRED = Token::INVALID_TYPE;
+
+    explicit LL1Analyzer(const atn::ATN &atn) : _atn(atn) {}
+
+    /// <summary>
+    /// Calculates the SLL(1) expected lookahead set for each outgoing transition
+    /// of an <seealso cref="ATNState"/>. The returned array has one element for each
+    /// outgoing transition in {@code s}. If the closure from transition
+    /// <em>i</em> leads to a semantic predicate before matching a symbol, the
+    /// element at index <em>i</em> of the result will be {@code null}.
+    /// </summary>
+    /// <param name="s"> the ATN state </param>
+    /// <returns> the expected symbols for each outgoing transition of {@code s}. </returns>
+    std::vector<misc::IntervalSet> getDecisionLookahead(ATNState *s) const;
+
+    /// <summary>
+    /// Compute set of tokens that can follow {@code s} in the ATN in the
+    /// specified {@code ctx}.
+    /// <p/>
+    /// If {@code ctx} is {@code null} and the end of the rule containing
+    /// {@code s} is reached, <seealso cref="Token#EPSILON"/> is added to the result set.
+    /// If {@code ctx} is not {@code null} and the end of the outermost rule is
+    /// reached, <seealso cref="Token#EOF"/> is added to the result set.
+    /// </summary>
+    /// <param name="s"> the ATN state </param>
+    /// <param name="ctx"> the complete parser context, or {@code null} if the context
+    /// should be ignored
+    /// </param>
+    /// <returns> The set of tokens that can follow {@code s} in the ATN in the
+    /// specified {@code ctx}. </returns>
+    misc::IntervalSet LOOK(ATNState *s, RuleContext *ctx) const;
+
+    /// <summary>
+    /// Compute set of tokens that can follow {@code s} in the ATN in the
+    /// specified {@code ctx}.
+    /// <p/>
+    /// If {@code ctx} is {@code null} and the end of the rule containing
+    /// {@code s} is reached, <seealso cref="Token#EPSILON"/> is added to the result set.
+    /// If {@code ctx} is not {@code null} and the end of the outermost rule is
+    /// reached, <seealso cref="Token#EOF"/> is added to the result set.
+    /// </summary>
+    /// <param name="s"> the ATN state </param>
+    /// <param name="stopState"> the ATN state to stop at. This can be a
+    /// <seealso cref="BlockEndState"/> to detect epsilon paths through a closure. </param>
+    /// <param name="ctx"> the complete parser context, or {@code null} if the context
+    /// should be ignored
+    /// </param>
+    /// <returns> The set of tokens that can follow {@code s} in the ATN in the
+    /// specified {@code ctx}. </returns>
+    misc::IntervalSet LOOK(ATNState *s, ATNState *stopState, RuleContext *ctx) const;
+
+  private:
+    const atn::ATN &_atn;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNConfig.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNConfig.cpp
new file mode 100755
index 0000000000..055f8bbdab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNConfig.cpp
@@ -0,0 +1,67 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "atn/DecisionState.h"
+#include "atn/PredictionContext.h"
+#include "SemanticContext.h"
+#include "atn/LexerActionExecutor.h"
+
+#include "support/CPPUtils.h"
+#include "support/Casts.h"
+
+#include "atn/LexerATNConfig.h"
+
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+LexerATNConfig::LexerATNConfig(ATNState *state, int alt, Ref<const PredictionContext> context)
+    : ATNConfig(state, alt, std::move(context)) {}
+
+LexerATNConfig::LexerATNConfig(ATNState *state, int alt, Ref<const PredictionContext> context, Ref<const LexerActionExecutor> lexerActionExecutor)
+    : ATNConfig(state, alt, std::move(context)), _lexerActionExecutor(std::move(lexerActionExecutor)) {}
+
+LexerATNConfig::LexerATNConfig(LexerATNConfig const& other, ATNState *state)
+    : ATNConfig(other, state), _lexerActionExecutor(other._lexerActionExecutor), _passedThroughNonGreedyDecision(checkNonGreedyDecision(other, state)) {}
+
+LexerATNConfig::LexerATNConfig(LexerATNConfig const& other, ATNState *state, Ref<const LexerActionExecutor> lexerActionExecutor)
+    : ATNConfig(other, state), _lexerActionExecutor(std::move(lexerActionExecutor)), _passedThroughNonGreedyDecision(checkNonGreedyDecision(other, state)) {}
+
+LexerATNConfig::LexerATNConfig(LexerATNConfig const& other, ATNState *state, Ref<const PredictionContext> context)
+    : ATNConfig(other, state, std::move(context)), _lexerActionExecutor(other._lexerActionExecutor), _passedThroughNonGreedyDecision(checkNonGreedyDecision(other, state)) {}
+
+size_t LexerATNConfig::hashCode() const {
+  size_t hashCode = misc::MurmurHash::initialize(7);
+  hashCode = misc::MurmurHash::update(hashCode, state->stateNumber);
+  hashCode = misc::MurmurHash::update(hashCode, alt);
+  hashCode = misc::MurmurHash::update(hashCode, context);
+  hashCode = misc::MurmurHash::update(hashCode, semanticContext);
+  hashCode = misc::MurmurHash::update(hashCode, _passedThroughNonGreedyDecision ? 1 : 0);
+  hashCode = misc::MurmurHash::update(hashCode, _lexerActionExecutor);
+  hashCode = misc::MurmurHash::finish(hashCode, 6);
+  return hashCode;
+}
+
+bool LexerATNConfig::operator==(const LexerATNConfig& other) const
+{
+  if (this == &other)
+    return true;
+
+  if (_passedThroughNonGreedyDecision != other._passedThroughNonGreedyDecision)
+    return false;
+
+  if (_lexerActionExecutor == nullptr)
+    return other._lexerActionExecutor == nullptr;
+  if (*_lexerActionExecutor != *(other._lexerActionExecutor)) {
+    return false;
+  }
+
+  return ATNConfig::operator==(other);
+}
+
+bool LexerATNConfig::checkNonGreedyDecision(LexerATNConfig const& source, ATNState *target) {
+  return source._passedThroughNonGreedyDecision ||
+    (DecisionState::is(target) && downCast<DecisionState*>(target)->nonGreedy);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNConfig.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNConfig.h
new file mode 100755
index 0000000000..05d804f639
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNConfig.h
@@ -0,0 +1,44 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNConfig.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC LexerATNConfig final : public ATNConfig {
+  public:
+    LexerATNConfig(ATNState *state, int alt, Ref<const PredictionContext> context);
+    LexerATNConfig(ATNState *state, int alt, Ref<const PredictionContext> context, Ref<const LexerActionExecutor> lexerActionExecutor);
+
+    LexerATNConfig(LexerATNConfig const& other, ATNState *state);
+    LexerATNConfig(LexerATNConfig const& other, ATNState *state, Ref<const LexerActionExecutor> lexerActionExecutor);
+    LexerATNConfig(LexerATNConfig const& other, ATNState *state, Ref<const PredictionContext> context);
+
+    /**
+     * Gets the {@link LexerActionExecutor} capable of executing the embedded
+     * action(s) for the current configuration.
+     */
+    const Ref<const LexerActionExecutor>& getLexerActionExecutor() const { return _lexerActionExecutor; }
+    bool hasPassedThroughNonGreedyDecision() const { return _passedThroughNonGreedyDecision; }
+
+    virtual size_t hashCode() const override;
+
+    bool operator==(const LexerATNConfig& other) const;
+
+  private:
+    /**
+     * This is the backing field for {@link #getLexerActionExecutor}.
+     */
+    const Ref<const LexerActionExecutor> _lexerActionExecutor;
+    const bool _passedThroughNonGreedyDecision = false;
+
+    static bool checkNonGreedyDecision(LexerATNConfig const& source, ATNState *target);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNSimulator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNSimulator.cpp
new file mode 100755
index 0000000000..cc42a23810
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNSimulator.cpp
@@ -0,0 +1,621 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "IntStream.h"
+#include "atn/OrderedATNConfigSet.h"
+#include "Token.h"
+#include "LexerNoViableAltException.h"
+#include "atn/RuleStopState.h"
+#include "atn/RuleTransition.h"
+#include "atn/SingletonPredictionContext.h"
+#include "atn/PredicateTransition.h"
+#include "atn/ActionTransition.h"
+#include "atn/TokensStartState.h"
+#include "misc/Interval.h"
+#include "dfa/DFA.h"
+#include "Lexer.h"
+#include "internal/Synchronization.h"
+
+#include "dfa/DFAState.h"
+#include "atn/LexerATNConfig.h"
+#include "atn/LexerActionExecutor.h"
+
+#include "atn/LexerATNSimulator.h"
+
+#ifndef LEXER_DEBUG_ATN
+#define LEXER_DEBUG_ATN 0
+#endif
+#ifndef LEXER_DEBUG_DFA
+#define LEXER_DEBUG_DFA 0
+#endif
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::internal;
+using namespace antlrcpp;
+
+void LexerATNSimulator::SimState::reset() {
+  *this = SimState();
+}
+
+LexerATNSimulator::LexerATNSimulator(const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
+                                     PredictionContextCache &sharedContextCache)
+  : LexerATNSimulator(nullptr, atn, decisionToDFA, sharedContextCache) {
+}
+
+LexerATNSimulator::LexerATNSimulator(Lexer *recog, const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
+                                     PredictionContextCache &sharedContextCache)
+  : ATNSimulator(atn, sharedContextCache), _recog(recog), _decisionToDFA(decisionToDFA) {
+  InitializeInstanceFields();
+}
+
+void LexerATNSimulator::copyState(LexerATNSimulator *simulator) {
+  _charPositionInLine = simulator->_charPositionInLine;
+  _line = simulator->_line;
+  _mode = simulator->_mode;
+  _startIndex = simulator->_startIndex;
+}
+
+size_t LexerATNSimulator::match(CharStream *input, size_t mode) {
+  _mode = mode;
+  ssize_t mark = input->mark();
+
+  auto onExit = finally([input, mark] {
+    input->release(mark);
+  });
+
+  _startIndex = input->index();
+  _prevAccept.reset();
+  const dfa::DFA &dfa = _decisionToDFA[mode];
+  dfa::DFAState* s0;
+  {
+    SharedLock<SharedMutex> stateLock(atn._stateMutex);
+    s0 = dfa.s0;
+  }
+  if (s0 == nullptr) {
+    return matchATN(input);
+  } else {
+    return execATN(input, s0);
+  }
+}
+
+void LexerATNSimulator::reset() {
+  _prevAccept.reset();
+  _startIndex = 0;
+  _line = 1;
+  _charPositionInLine = 0;
+  _mode = Lexer::DEFAULT_MODE;
+}
+
+void LexerATNSimulator::clearDFA() {
+  size_t size = _decisionToDFA.size();
+  _decisionToDFA.clear();
+  for (size_t d = 0; d < size; ++d) {
+    _decisionToDFA.emplace_back(atn.getDecisionState(d), d);
+  }
+}
+
+size_t LexerATNSimulator::matchATN(CharStream *input) {
+  ATNState *startState = atn.modeToStartState[_mode];
+
+  std::unique_ptr<ATNConfigSet> s0_closure = computeStartState(input, startState);
+
+  bool suppressEdge = s0_closure->hasSemanticContext;
+  s0_closure->hasSemanticContext = false;
+
+  dfa::DFAState *next = addDFAState(s0_closure.release(), suppressEdge);
+
+  size_t predict = execATN(input, next);
+
+  return predict;
+}
+
+size_t LexerATNSimulator::execATN(CharStream *input, dfa::DFAState *ds0) {
+  if (ds0->isAcceptState) {
+    // allow zero-length tokens
+    // ml: in Java code this method uses 3 params. The first is a member var of the class anyway (_prevAccept), so why pass it here?
+    captureSimState(input, ds0);
+  }
+
+  size_t t = input->LA(1);
+  dfa::DFAState *s = ds0; // s is current/from DFA state
+
+  while (true) { // while more work
+    // As we move src->trg, src->trg, we keep track of the previous trg to
+    // avoid looking up the DFA state again, which is expensive.
+    // If the previous target was already part of the DFA, we might
+    // be able to avoid doing a reach operation upon t. If s!=null,
+    // it means that semantic predicates didn't prevent us from
+    // creating a DFA state. Once we know s!=null, we check to see if
+    // the DFA state has an edge already for t. If so, we can just reuse
+    // it's configuration set; there's no point in re-computing it.
+    // This is kind of like doing DFA simulation within the ATN
+    // simulation because DFA simulation is really just a way to avoid
+    // computing reach/closure sets. Technically, once we know that
+    // we have a previously added DFA state, we could jump over to
+    // the DFA simulator. But, that would mean popping back and forth
+    // a lot and making things more complicated algorithmically.
+    // This optimization makes a lot of sense for loops within DFA.
+    // A character will take us back to an existing DFA state
+    // that already has lots of edges out of it. e.g., .* in comments.
+    dfa::DFAState *target = getExistingTargetState(s, t);
+    if (target == nullptr) {
+      target = computeTargetState(input, s, t);
+    }
+
+    if (target == ERROR.get()) {
+      break;
+    }
+
+    // If this is a consumable input element, make sure to consume before
+    // capturing the accept state so the input index, line, and char
+    // position accurately reflect the state of the interpreter at the
+    // end of the token.
+    if (t != Token::EOF) {
+      consume(input);
+    }
+
+    if (target->isAcceptState) {
+      captureSimState(input, target);
+      if (t == Token::EOF) {
+        break;
+      }
+    }
+
+    t = input->LA(1);
+    s = target; // flip; current DFA target becomes new src/from state
+  }
+
+  return failOrAccept(input, s->configs.get(), t);
+}
+
+dfa::DFAState *LexerATNSimulator::getExistingTargetState(dfa::DFAState *s, size_t t) {
+  dfa::DFAState* retval = nullptr;
+  SharedLock<SharedMutex> edgeLock(atn._edgeMutex);
+  if (t <= MAX_DFA_EDGE) {
+    auto iterator = s->edges.find(t - MIN_DFA_EDGE);
+#if LEXER_DEBUG_ATN == 1
+    if (iterator != s->edges.end()) {
+      std::cout << std::string("reuse state ") << s->stateNumber << std::string(" edge to ") << iterator->second->stateNumber << std::endl;
+    }
+#endif
+
+    if (iterator != s->edges.end())
+      retval = iterator->second;
+  }
+  return retval;
+}
+
+dfa::DFAState *LexerATNSimulator::computeTargetState(CharStream *input, dfa::DFAState *s, size_t t) {
+  OrderedATNConfigSet *reach = new OrderedATNConfigSet(); /* mem-check: deleted on error or managed by new DFA state. */
+
+  // if we don't find an existing DFA state
+  // Fill reach starting from closure, following t transitions
+  getReachableConfigSet(input, s->configs.get(), reach, t);
+
+  if (reach->isEmpty()) { // we got nowhere on t from s
+    if (!reach->hasSemanticContext) {
+      // we got nowhere on t, don't throw out this knowledge; it'd
+      // cause a failover from DFA later.
+      addDFAEdge(s, t, ERROR.get());
+    }
+    delete reach;
+
+    // stop when we can't match any more char
+    return ERROR.get();
+  }
+
+  // Add an edge from s to target DFA found/created for reach
+  return addDFAEdge(s, t, reach);
+}
+
+size_t LexerATNSimulator::failOrAccept(CharStream *input, ATNConfigSet *reach, size_t t) {
+  if (_prevAccept.dfaState != nullptr) {
+    accept(input, _prevAccept.dfaState->lexerActionExecutor, _startIndex, _prevAccept.index, _prevAccept.line, _prevAccept.charPos);
+    return _prevAccept.dfaState->prediction;
+  } else {
+    // if no accept and EOF is first char, return EOF
+    if (t == Token::EOF && input->index() == _startIndex) {
+      return Token::EOF;
+    }
+
+    throw LexerNoViableAltException(_recog, input, _startIndex, reach);
+  }
+}
+
+void LexerATNSimulator::getReachableConfigSet(CharStream *input, ATNConfigSet *closure_, ATNConfigSet *reach, size_t t) {
+  // this is used to skip processing for configs which have a lower priority
+  // than a config that already reached an accept state for the same rule
+  size_t skipAlt = ATN::INVALID_ALT_NUMBER;
+
+  for (const auto &c : closure_->configs) {
+    bool currentAltReachedAcceptState = c->alt == skipAlt;
+    if (currentAltReachedAcceptState && (std::static_pointer_cast<LexerATNConfig>(c))->hasPassedThroughNonGreedyDecision()) {
+      continue;
+    }
+
+#if LEXER_DEBUG_ATN == 1
+      std::cout << "testing " << getTokenName((int)t) << " at " << c->toString(true) << std::endl;
+#endif
+
+    size_t n = c->state->transitions.size();
+    for (size_t ti = 0; ti < n; ti++) { // for each transition
+      const Transition *trans = c->state->transitions[ti].get();
+      ATNState *target = getReachableTarget(trans, (int)t);
+      if (target != nullptr) {
+        auto lexerActionExecutor = downCast<const LexerATNConfig&>(*c).getLexerActionExecutor();
+        if (lexerActionExecutor != nullptr) {
+          lexerActionExecutor = lexerActionExecutor->fixOffsetBeforeMatch((int)input->index() - (int)_startIndex);
+        }
+
+        bool treatEofAsEpsilon = t == Token::EOF;
+        Ref<LexerATNConfig> config = std::make_shared<LexerATNConfig>(downCast<const LexerATNConfig&>(*c),
+          target, std::move(lexerActionExecutor));
+
+        if (closure(input, config, reach, currentAltReachedAcceptState, true, treatEofAsEpsilon)) {
+          // any remaining configs for this alt have a lower priority than
+          // the one that just reached an accept state.
+          skipAlt = c->alt;
+          break;
+        }
+      }
+    }
+  }
+}
+
+void LexerATNSimulator::accept(CharStream *input, const Ref<const LexerActionExecutor> &lexerActionExecutor, size_t /*startIndex*/,
+                               size_t index, size_t line, size_t charPos) {
+#if LEXER_DEBUG_ATN == 1
+    std::cout << "ACTION ";
+    std::cout << toString(lexerActionExecutor) << std::endl;
+#endif
+
+  // seek to after last char in token
+  input->seek(index);
+  _line = line;
+  _charPositionInLine = (int)charPos;
+
+  if (lexerActionExecutor != nullptr && _recog != nullptr) {
+    lexerActionExecutor->execute(_recog, input, _startIndex);
+  }
+}
+
+atn::ATNState *LexerATNSimulator::getReachableTarget(const Transition *trans, size_t t) {
+  if (trans->matches(t, Lexer::MIN_CHAR_VALUE, Lexer::MAX_CHAR_VALUE)) {
+    return trans->target;
+  }
+
+  return nullptr;
+}
+
+std::unique_ptr<ATNConfigSet> LexerATNSimulator::computeStartState(CharStream *input, ATNState *p) {
+  Ref<const PredictionContext> initialContext = PredictionContext::EMPTY; // ml: the purpose of this assignment is unclear
+  std::unique_ptr<ATNConfigSet> configs(new OrderedATNConfigSet());
+  for (size_t i = 0; i < p->transitions.size(); i++) {
+    ATNState *target = p->transitions[i]->target;
+    Ref<LexerATNConfig> c = std::make_shared<LexerATNConfig>(target, (int)(i + 1), initialContext);
+    closure(input, c, configs.get(), false, false, false);
+  }
+
+  return configs;
+}
+
+bool LexerATNSimulator::closure(CharStream *input, const Ref<LexerATNConfig> &config, ATNConfigSet *configs,
+                                bool currentAltReachedAcceptState, bool speculative, bool treatEofAsEpsilon) {
+#if LEXER_DEBUG_ATN == 1
+    std::cout << "closure(" << config->toString(true) << ")" << std::endl;
+#endif
+
+  if (config->state != nullptr && config->state->getStateType() == ATNStateType::RULE_STOP) {
+#if LEXER_DEBUG_ATN == 1
+      if (_recog != nullptr) {
+        std::cout << "closure at " << _recog->getRuleNames()[config->state->ruleIndex] << " rule stop " << config << std::endl;
+      } else {
+        std::cout << "closure at rule stop " << config << std::endl;
+      }
+#endif
+
+    if (config->context == nullptr || config->context->hasEmptyPath()) {
+      if (config->context == nullptr || config->context->isEmpty()) {
+        configs->add(config);
+        return true;
+      } else {
+        configs->add(std::make_shared<LexerATNConfig>(*config, config->state, PredictionContext::EMPTY));
+        currentAltReachedAcceptState = true;
+      }
+    }
+
+    if (config->context != nullptr && !config->context->isEmpty()) {
+      for (size_t i = 0; i < config->context->size(); i++) {
+        if (config->context->getReturnState(i) != PredictionContext::EMPTY_RETURN_STATE) {
+          Ref<const PredictionContext> newContext = config->context->getParent(i); // "pop" return state
+          ATNState *returnState = atn.states[config->context->getReturnState(i)];
+          Ref<LexerATNConfig> c = std::make_shared<LexerATNConfig>(*config, returnState, newContext);
+          currentAltReachedAcceptState = closure(input, c, configs, currentAltReachedAcceptState, speculative, treatEofAsEpsilon);
+        }
+      }
+    }
+
+    return currentAltReachedAcceptState;
+  }
+
+  // optimization
+  if (!config->state->epsilonOnlyTransitions) {
+    if (!currentAltReachedAcceptState || !config->hasPassedThroughNonGreedyDecision()) {
+      configs->add(config);
+    }
+  }
+
+  ATNState *p = config->state;
+  for (size_t i = 0; i < p->transitions.size(); i++) {
+    const Transition *t = p->transitions[i].get();
+    Ref<LexerATNConfig> c = getEpsilonTarget(input, config, t, configs, speculative, treatEofAsEpsilon);
+    if (c != nullptr) {
+      currentAltReachedAcceptState = closure(input, c, configs, currentAltReachedAcceptState, speculative, treatEofAsEpsilon);
+    }
+  }
+
+  return currentAltReachedAcceptState;
+}
+
+Ref<LexerATNConfig> LexerATNSimulator::getEpsilonTarget(CharStream *input, const Ref<LexerATNConfig> &config, const Transition *t,
+  ATNConfigSet *configs, bool speculative, bool treatEofAsEpsilon) {
+
+  Ref<LexerATNConfig> c = nullptr;
+  switch (t->getTransitionType()) {
+    case TransitionType::RULE: {
+      const RuleTransition *ruleTransition = static_cast<const RuleTransition*>(t);
+      Ref<const PredictionContext> newContext = SingletonPredictionContext::create(config->context, ruleTransition->followState->stateNumber);
+      c = std::make_shared<LexerATNConfig>(*config, t->target, newContext);
+      break;
+    }
+
+    case TransitionType::PRECEDENCE:
+      throw UnsupportedOperationException("Precedence predicates are not supported in lexers.");
+
+    case TransitionType::PREDICATE: {
+      /*  Track traversing semantic predicates. If we traverse,
+       we cannot add a DFA state for this "reach" computation
+       because the DFA would not test the predicate again in the
+       future. Rather than creating collections of semantic predicates
+       like v3 and testing them on prediction, v4 will test them on the
+       fly all the time using the ATN not the DFA. This is slower but
+       semantically it's not used that often. One of the key elements to
+       this predicate mechanism is not adding DFA states that see
+       predicates immediately afterwards in the ATN. For example,
+
+       a : ID {p1}? | ID {p2}? ;
+
+       should create the start state for rule 'a' (to save start state
+       competition), but should not create target of ID state. The
+       collection of ATN states the following ID references includes
+       states reached by traversing predicates. Since this is when we
+       test them, we cannot cash the DFA state target of ID.
+       */
+      const PredicateTransition *pt = static_cast<const PredicateTransition*>(t);
+
+#if LEXER_DEBUG_ATN == 1
+        std::cout << "EVAL rule " << pt->getRuleIndex() << ":" << pt->getPredIndex() << std::endl;
+#endif
+
+      configs->hasSemanticContext = true;
+      if (evaluatePredicate(input, pt->getRuleIndex(), pt->getPredIndex(), speculative)) {
+        c = std::make_shared<LexerATNConfig>(*config, t->target);
+      }
+      break;
+    }
+
+    case TransitionType::ACTION:
+      if (config->context == nullptr|| config->context->hasEmptyPath()) {
+        // execute actions anywhere in the start rule for a token.
+        //
+        // TODO: if the entry rule is invoked recursively, some
+        // actions may be executed during the recursive call. The
+        // problem can appear when hasEmptyPath() is true but
+        // isEmpty() is false. In this case, the config needs to be
+        // split into two contexts - one with just the empty path
+        // and another with everything but the empty path.
+        // Unfortunately, the current algorithm does not allow
+        // getEpsilonTarget to return two configurations, so
+        // additional modifications are needed before we can support
+        // the split operation.
+        auto lexerActionExecutor = LexerActionExecutor::append(config->getLexerActionExecutor(),
+          atn.lexerActions[static_cast<const ActionTransition *>(t)->actionIndex]);
+        c = std::make_shared<LexerATNConfig>(*config, t->target, std::move(lexerActionExecutor));
+        break;
+      }
+      else {
+        // ignore actions in referenced rules
+        c = std::make_shared<LexerATNConfig>(*config, t->target);
+        break;
+      }
+
+    case TransitionType::EPSILON:
+      c = std::make_shared<LexerATNConfig>(*config, t->target);
+      break;
+
+    case TransitionType::ATOM:
+    case TransitionType::RANGE:
+    case TransitionType::SET:
+      if (treatEofAsEpsilon) {
+        if (t->matches(Token::EOF, Lexer::MIN_CHAR_VALUE, Lexer::MAX_CHAR_VALUE)) {
+          c = std::make_shared<LexerATNConfig>(*config, t->target);
+          break;
+        }
+      }
+
+      break;
+
+    default: // To silence the compiler. Other transition types are not used here.
+      break;
+  }
+
+  return c;
+}
+
+bool LexerATNSimulator::evaluatePredicate(CharStream *input, size_t ruleIndex, size_t predIndex, bool speculative) {
+  // assume true if no recognizer was provided
+  if (_recog == nullptr) {
+    return true;
+  }
+
+  if (!speculative) {
+    return _recog->sempred(nullptr, ruleIndex, predIndex);
+  }
+
+  size_t savedCharPositionInLine = _charPositionInLine;
+  size_t savedLine = _line;
+  size_t index = input->index();
+  ssize_t marker = input->mark();
+
+  auto onExit = finally([this, input, savedCharPositionInLine, savedLine, index, marker] {
+    _charPositionInLine = savedCharPositionInLine;
+    _line = savedLine;
+    input->seek(index);
+    input->release(marker);
+  });
+
+  consume(input);
+  return _recog->sempred(nullptr, ruleIndex, predIndex);
+}
+
+void LexerATNSimulator::captureSimState(CharStream *input, dfa::DFAState *dfaState) {
+  _prevAccept.index = input->index();
+  _prevAccept.line = _line;
+  _prevAccept.charPos = _charPositionInLine;
+  _prevAccept.dfaState = dfaState;
+}
+
+dfa::DFAState *LexerATNSimulator::addDFAEdge(dfa::DFAState *from, size_t t, ATNConfigSet *q) {
+  /* leading to this call, ATNConfigSet.hasSemanticContext is used as a
+   * marker indicating dynamic predicate evaluation makes this edge
+   * dependent on the specific input sequence, so the static edge in the
+   * DFA should be omitted. The target DFAState is still created since
+   * execATN has the ability to resynchronize with the DFA state cache
+   * following the predicate evaluation step.
+   *
+   * TJP notes: next time through the DFA, we see a pred again and eval.
+   * If that gets us to a previously created (but dangling) DFA
+   * state, we can continue in pure DFA mode from there.
+   */
+  bool suppressEdge = q->hasSemanticContext;
+  q->hasSemanticContext = false;
+
+  dfa::DFAState *to = addDFAState(q);
+
+  if (suppressEdge) {
+    return to;
+  }
+
+  addDFAEdge(from, t, to);
+  return to;
+}
+
+void LexerATNSimulator::addDFAEdge(dfa::DFAState *p, size_t t, dfa::DFAState *q) {
+  if (/*t < MIN_DFA_EDGE ||*/ t > MAX_DFA_EDGE) { // MIN_DFA_EDGE is 0
+    // Only track edges within the DFA bounds
+    return;
+  }
+
+  UniqueLock<SharedMutex> edgeLock(atn._edgeMutex);
+  p->edges[t - MIN_DFA_EDGE] = q; // connect
+}
+
+dfa::DFAState *LexerATNSimulator::addDFAState(ATNConfigSet *configs) {
+  return addDFAState(configs, true);
+}
+
+dfa::DFAState *LexerATNSimulator::addDFAState(ATNConfigSet *configs, bool suppressEdge) {
+  /* the lexer evaluates predicates on-the-fly; by this point configs
+   * should not contain any configurations with unevaluated predicates.
+   */
+  assert(!configs->hasSemanticContext);
+
+  dfa::DFAState *proposed = new dfa::DFAState(std::unique_ptr<ATNConfigSet>(configs)); /* mem-check: managed by the DFA or deleted below */
+  Ref<ATNConfig> firstConfigWithRuleStopState = nullptr;
+  for (const auto &c : configs->configs) {
+    if (RuleStopState::is(c->state)) {
+      firstConfigWithRuleStopState = c;
+      break;
+    }
+  }
+
+  if (firstConfigWithRuleStopState != nullptr) {
+    proposed->isAcceptState = true;
+    proposed->lexerActionExecutor = downCast<const LexerATNConfig&>(*firstConfigWithRuleStopState).getLexerActionExecutor();
+    proposed->prediction = atn.ruleToTokenType[firstConfigWithRuleStopState->state->ruleIndex];
+  }
+
+  dfa::DFA &dfa = _decisionToDFA[_mode];
+
+  {
+    UniqueLock<SharedMutex> stateLock(atn._stateMutex);
+    auto [existing, inserted] = dfa.states.insert(proposed);
+    if (!inserted) {
+      delete proposed;
+      proposed = *existing;
+    } else {
+      // Previously we did a lookup, then set fields, then inserted. It was `dfa.states.size()`,
+      // since we already inserted we need to subtract one.
+      proposed->stateNumber = static_cast<int>(dfa.states.size() - 1);
+      proposed->configs->setReadonly(true);
+    }
+    if (!suppressEdge) {
+      dfa.s0 = proposed;
+    }
+  }
+
+  return proposed;
+}
+
+dfa::DFA& LexerATNSimulator::getDFA(size_t mode) {
+  return _decisionToDFA[mode];
+}
+
+std::string LexerATNSimulator::getText(CharStream *input) {
+  // index is first lookahead char, don't include.
+  return input->getText(misc::Interval(_startIndex, input->index() - 1));
+}
+
+size_t LexerATNSimulator::getLine() const {
+  return _line;
+}
+
+void LexerATNSimulator::setLine(size_t line) {
+  _line = line;
+}
+
+size_t LexerATNSimulator::getCharPositionInLine() {
+  return _charPositionInLine;
+}
+
+void LexerATNSimulator::setCharPositionInLine(size_t charPositionInLine) {
+  _charPositionInLine = charPositionInLine;
+}
+
+void LexerATNSimulator::consume(CharStream *input) {
+  size_t curChar = input->LA(1);
+  if (curChar == '\n') {
+    _line++;
+    _charPositionInLine = 0;
+  } else {
+    _charPositionInLine++;
+  }
+  input->consume();
+}
+
+std::string LexerATNSimulator::getTokenName(size_t t) {
+  if (t == Token::EOF) {
+    return "EOF";
+  }
+  return std::string("'") + static_cast<char>(t) + std::string("'");
+}
+
+void LexerATNSimulator::InitializeInstanceFields() {
+  _startIndex = 0;
+  _line = 1;
+  _charPositionInLine = 0;
+  _mode = antlr4::Lexer::DEFAULT_MODE;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNSimulator.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNSimulator.h
new file mode 100755
index 0000000000..46bc22614a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerATNSimulator.h
@@ -0,0 +1,199 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <atomic>
+
+#include "atn/ATNSimulator.h"
+#include "atn/LexerATNConfig.h"
+#include "atn/ATNConfigSet.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// "dup" of ParserInterpreter
+  class ANTLR4CPP_PUBLIC LexerATNSimulator : public ATNSimulator {
+  protected:
+    struct ANTLR4CPP_PUBLIC SimState final {
+      size_t index = INVALID_INDEX;
+      size_t line = 0;
+      size_t charPos = INVALID_INDEX;
+      dfa::DFAState *dfaState = nullptr;
+
+      void reset();
+    };
+
+  public:
+    static constexpr size_t MIN_DFA_EDGE = 0;
+    static constexpr size_t MAX_DFA_EDGE = 127; // forces unicode to stay in ATN
+
+  protected:
+    /// <summary>
+    /// When we hit an accept state in either the DFA or the ATN, we
+    ///  have to notify the character stream to start buffering characters
+    ///  via <seealso cref="IntStream#mark"/> and record the current state. The current sim state
+    ///  includes the current index into the input, the current line,
+    ///  and current character position in that line. Note that the Lexer is
+    ///  tracking the starting line and characterization of the token. These
+    ///  variables track the "state" of the simulator when it hits an accept state.
+    /// <p/>
+    ///  We track these variables separately for the DFA and ATN simulation
+    ///  because the DFA simulation often has to fail over to the ATN
+    ///  simulation. If the ATN simulation fails, we need the DFA to fall
+    ///  back to its previously accepted state, if any. If the ATN succeeds,
+    ///  then the ATN does the accept and the DFA simulator that invoked it
+    ///  can simply return the predicted token type.
+    /// </summary>
+    Lexer *const _recog;
+
+    /// The current token's starting index into the character stream.
+    ///  Shared across DFA to ATN simulation in case the ATN fails and the
+    ///  DFA did not have a previous accept state. In this case, we use the
+    ///  ATN-generated exception object.
+    size_t _startIndex;
+
+    /// line number 1..n within the input.
+    size_t _line;
+
+    /// The index of the character relative to the beginning of the line 0..n-1.
+    size_t _charPositionInLine;
+
+  public:
+    std::vector<dfa::DFA> &_decisionToDFA;
+
+  protected:
+    size_t _mode;
+
+    /// Used during DFA/ATN exec to record the most recent accept configuration info.
+    SimState _prevAccept;
+
+  public:
+    LexerATNSimulator(const ATN &atn, std::vector<dfa::DFA> &decisionToDFA, PredictionContextCache &sharedContextCache);
+    LexerATNSimulator(Lexer *recog, const ATN &atn, std::vector<dfa::DFA> &decisionToDFA, PredictionContextCache &sharedContextCache);
+    virtual ~LexerATNSimulator() = default;
+
+    virtual void copyState(LexerATNSimulator *simulator);
+    virtual size_t match(CharStream *input, size_t mode);
+    virtual void reset() override;
+
+    virtual void clearDFA() override;
+
+  protected:
+    virtual size_t matchATN(CharStream *input);
+    virtual size_t execATN(CharStream *input, dfa::DFAState *ds0);
+
+    /// <summary>
+    /// Get an existing target state for an edge in the DFA. If the target state
+    /// for the edge has not yet been computed or is otherwise not available,
+    /// this method returns {@code null}.
+    /// </summary>
+    /// <param name="s"> The current DFA state </param>
+    /// <param name="t"> The next input symbol </param>
+    /// <returns> The existing target DFA state for the given input symbol
+    /// {@code t}, or {@code null} if the target state for this edge is not
+    /// already cached </returns>
+    virtual dfa::DFAState *getExistingTargetState(dfa::DFAState *s, size_t t);
+
+    /// <summary>
+    /// Compute a target state for an edge in the DFA, and attempt to add the
+    /// computed state and corresponding edge to the DFA.
+    /// </summary>
+    /// <param name="input"> The input stream </param>
+    /// <param name="s"> The current DFA state </param>
+    /// <param name="t"> The next input symbol
+    /// </param>
+    /// <returns> The computed target DFA state for the given input symbol
+    /// {@code t}. If {@code t} does not lead to a valid DFA state, this method
+    /// returns <seealso cref="#ERROR"/>. </returns>
+    virtual dfa::DFAState *computeTargetState(CharStream *input, dfa::DFAState *s, size_t t);
+
+    virtual size_t failOrAccept(CharStream *input, ATNConfigSet *reach, size_t t);
+
+    /// <summary>
+    /// Given a starting configuration set, figure out all ATN configurations
+    ///  we can reach upon input {@code t}. Parameter {@code reach} is a return
+    ///  parameter.
+    /// </summary>
+    void getReachableConfigSet(CharStream *input, ATNConfigSet *closure_, // closure_ as we have a closure() already
+                               ATNConfigSet *reach, size_t t);
+
+    virtual void accept(CharStream *input, const Ref<const LexerActionExecutor> &lexerActionExecutor, size_t startIndex, size_t index,
+                        size_t line, size_t charPos);
+
+    virtual ATNState *getReachableTarget(const Transition *trans, size_t t);
+
+    virtual std::unique_ptr<ATNConfigSet> computeStartState(CharStream *input, ATNState *p);
+
+    /// <summary>
+    /// Since the alternatives within any lexer decision are ordered by
+    /// preference, this method stops pursuing the closure as soon as an accept
+    /// state is reached. After the first accept state is reached by depth-first
+    /// search from {@code config}, all other (potentially reachable) states for
+    /// this rule would have a lower priority.
+    /// </summary>
+    /// <returns> {@code true} if an accept state is reached, otherwise
+    /// {@code false}. </returns>
+    virtual bool closure(CharStream *input, const Ref<LexerATNConfig> &config, ATNConfigSet *configs,
+                         bool currentAltReachedAcceptState, bool speculative, bool treatEofAsEpsilon);
+
+    // side-effect: can alter configs.hasSemanticContext
+    virtual Ref<LexerATNConfig> getEpsilonTarget(CharStream *input, const Ref<LexerATNConfig> &config, const Transition *t,
+      ATNConfigSet *configs, bool speculative, bool treatEofAsEpsilon);
+
+    /// <summary>
+    /// Evaluate a predicate specified in the lexer.
+    /// <p/>
+    /// If {@code speculative} is {@code true}, this method was called before
+    /// <seealso cref="#consume"/> for the matched character. This method should call
+    /// <seealso cref="#consume"/> before evaluating the predicate to ensure position
+    /// sensitive values, including <seealso cref="Lexer#getText"/>, <seealso cref="Lexer#getLine"/>,
+    /// and <seealso cref="Lexer#getCharPositionInLine"/>, properly reflect the current
+    /// lexer state. This method should restore {@code input} and the simulator
+    /// to the original state before returning (i.e. undo the actions made by the
+    /// call to <seealso cref="#consume"/>.
+    /// </summary>
+    /// <param name="input"> The input stream. </param>
+    /// <param name="ruleIndex"> The rule containing the predicate. </param>
+    /// <param name="predIndex"> The index of the predicate within the rule. </param>
+    /// <param name="speculative"> {@code true} if the current index in {@code input} is
+    /// one character before the predicate's location.
+    /// </param>
+    /// <returns> {@code true} if the specified predicate evaluates to
+    /// {@code true}. </returns>
+    virtual bool evaluatePredicate(CharStream *input, size_t ruleIndex, size_t predIndex, bool speculative);
+
+    virtual void captureSimState(CharStream *input, dfa::DFAState *dfaState);
+    virtual dfa::DFAState* addDFAEdge(dfa::DFAState *from, size_t t, ATNConfigSet *q);
+    virtual void addDFAEdge(dfa::DFAState *p, size_t t, dfa::DFAState *q);
+
+    /// <summary>
+    /// Add a new DFA state if there isn't one with this set of
+    /// configurations already. This method also detects the first
+    /// configuration containing an ATN rule stop state. Later, when
+    /// traversing the DFA, we will know which rule to accept.
+    /// </summary>
+    virtual dfa::DFAState *addDFAState(ATNConfigSet *configs);
+
+    virtual dfa::DFAState *addDFAState(ATNConfigSet *configs, bool suppressEdge);
+
+  public:
+    dfa::DFA& getDFA(size_t mode);
+
+    /// Get the text matched so far for the current token.
+    virtual std::string getText(CharStream *input);
+    virtual size_t getLine() const;
+    virtual void setLine(size_t line);
+    virtual size_t getCharPositionInLine();
+    virtual void setCharPositionInLine(size_t charPositionInLine);
+    virtual void consume(CharStream *input);
+    virtual std::string getTokenName(size_t t);
+
+  private:
+    void InitializeInstanceFields();
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerAction.cpp
new file mode 100644
index 0000000000..a9d9a6771b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerAction.cpp
@@ -0,0 +1,15 @@
+#include "LexerAction.h"
+
+using namespace antlr4::atn;
+
+size_t LexerAction::hashCode() const {
+  auto hash = cachedHashCode();
+  if (hash == 0) {
+    hash = hashCodeImpl();
+    if (hash == 0) {
+      hash = std::numeric_limits<size_t>::max();
+    }
+    _hashCode.store(hash, std::memory_order_relaxed);
+  }
+  return hash;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerAction.h
new file mode 100755
index 0000000000..5c30a89608
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerAction.h
@@ -0,0 +1,100 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/LexerActionType.h"
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// Represents a single action which can be executed following the successful
+  /// match of a lexer rule. Lexer actions are used for both embedded action syntax
+  /// and ANTLR 4's new lexer command syntax.
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  class ANTLR4CPP_PUBLIC LexerAction {
+  public:
+    virtual ~LexerAction() = default;
+
+    /// <summary>
+    /// Gets the serialization type of the lexer action.
+    /// </summary>
+    /// <returns> The serialization type of the lexer action. </returns>
+    ///
+    /// IMPORTANT: Unlike Java, this returns LexerActionType::INDEXED_CUSTOM for instances of
+    /// LexerIndexedCustomAction. If you need the wrapped action type, use
+    /// LexerIndexedCustomAction::getAction()->getActionType().
+    LexerActionType getActionType() const { return _actionType; }
+
+    /// <summary>
+    /// Gets whether the lexer action is position-dependent. Position-dependent
+    /// actions may have different semantics depending on the <seealso cref="CharStream"/>
+    /// index at the time the action is executed.
+    ///
+    /// <para>Many lexer commands, including {@code type}, {@code skip}, and
+    /// {@code more}, do not check the input index during their execution.
+    /// Actions like this are position-independent, and may be stored more
+    /// efficiently as part of the <seealso cref="LexerATNConfig#lexerActionExecutor"/>.</para>
+    /// </summary>
+    /// <returns> {@code true} if the lexer action semantics can be affected by the
+    /// position of the input <seealso cref="CharStream"/> at the time it is executed;
+    /// otherwise, {@code false}. </returns>
+    bool isPositionDependent() const { return _positionDependent; }
+
+    /// <summary>
+    /// Execute the lexer action in the context of the specified <seealso cref="Lexer"/>.
+    ///
+    /// <para>For position-dependent actions, the input stream must already be
+    /// positioned correctly prior to calling this method.</para>
+    /// </summary>
+    /// <param name="lexer"> The lexer instance. </param>
+    virtual void execute(Lexer *lexer) const = 0;
+
+    size_t hashCode() const;
+
+    virtual bool equals(const LexerAction &other) const = 0;
+
+    virtual std::string toString() const = 0;
+
+  protected:
+    LexerAction(LexerActionType actionType, bool positionDependent)
+        : _actionType(actionType), _hashCode(0), _positionDependent(positionDependent) {}
+
+    virtual size_t hashCodeImpl() const = 0;
+
+    size_t cachedHashCode() const { return _hashCode.load(std::memory_order_relaxed); }
+
+  private:
+    const LexerActionType _actionType;
+    mutable std::atomic<size_t> _hashCode;
+    const bool _positionDependent;
+  };
+
+  inline bool operator==(const LexerAction &lhs, const LexerAction &rhs) {
+    return lhs.equals(rhs);
+  }
+
+  inline bool operator!=(const LexerAction &lhs, const LexerAction &rhs) {
+    return !operator==(lhs, rhs);
+  }
+
+}  // namespace atn
+}  // namespace antlr4
+
+namespace std {
+
+  template <>
+  struct hash<::antlr4::atn::LexerAction> {
+    size_t operator()(const ::antlr4::atn::LexerAction &lexerAction) const {
+      return lexerAction.hashCode();
+    }
+  };
+
+}  // namespace std
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerActionExecutor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerActionExecutor.cpp
new file mode 100755
index 0000000000..f6bb9e2c4a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerActionExecutor.cpp
@@ -0,0 +1,108 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "atn/LexerIndexedCustomAction.h"
+#include "atn/HashUtils.h"
+#include "support/CPPUtils.h"
+#include "support/Arrays.h"
+#include "support/Casts.h"
+
+#include "atn/LexerActionExecutor.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+using namespace antlrcpp;
+
+namespace {
+
+  bool lexerActionEqual(const Ref<const LexerAction> &lhs, const Ref<const LexerAction> &rhs) {
+    return *lhs == *rhs;
+  }
+
+}
+
+LexerActionExecutor::LexerActionExecutor(std::vector<Ref<const LexerAction>> lexerActions)
+    : _lexerActions(std::move(lexerActions)), _hashCode(0) {}
+
+Ref<const LexerActionExecutor> LexerActionExecutor::append(const Ref<const LexerActionExecutor> &lexerActionExecutor,
+                                                           Ref<const LexerAction> lexerAction) {
+  if (lexerActionExecutor == nullptr) {
+    return std::make_shared<LexerActionExecutor>(std::vector<Ref<const LexerAction>>{ std::move(lexerAction) });
+  }
+  std::vector<Ref<const LexerAction>> lexerActions;
+  lexerActions.reserve(lexerActionExecutor->_lexerActions.size() + 1);
+  lexerActions.insert(lexerActions.begin(), lexerActionExecutor->_lexerActions.begin(), lexerActionExecutor->_lexerActions.end());
+  lexerActions.push_back(std::move(lexerAction));
+  return std::make_shared<LexerActionExecutor>(std::move(lexerActions));
+}
+
+Ref<const LexerActionExecutor> LexerActionExecutor::fixOffsetBeforeMatch(int offset) const {
+  std::vector<Ref<const LexerAction>> updatedLexerActions;
+  for (size_t i = 0; i < _lexerActions.size(); i++) {
+    if (_lexerActions[i]->isPositionDependent() && !LexerIndexedCustomAction::is(*_lexerActions[i])) {
+      if (updatedLexerActions.empty()) {
+        updatedLexerActions = _lexerActions; // Make a copy.
+      }
+      updatedLexerActions[i] = std::make_shared<LexerIndexedCustomAction>(offset, _lexerActions[i]);
+    }
+  }
+  if (updatedLexerActions.empty()) {
+    return shared_from_this();
+  }
+  return std::make_shared<LexerActionExecutor>(std::move(updatedLexerActions));
+}
+
+const std::vector<Ref<const LexerAction>>& LexerActionExecutor::getLexerActions() const {
+  return _lexerActions;
+}
+
+void LexerActionExecutor::execute(Lexer *lexer, CharStream *input, size_t startIndex) const {
+  bool requiresSeek = false;
+  size_t stopIndex = input->index();
+
+  auto onExit = finally([requiresSeek, input, stopIndex]() {
+    if (requiresSeek) {
+      input->seek(stopIndex);
+    }
+  });
+  for (const auto &lexerAction : _lexerActions) {
+    if (LexerIndexedCustomAction::is(*lexerAction)) {
+      int offset = downCast<const LexerIndexedCustomAction&>(*lexerAction).getOffset();
+      input->seek(startIndex + offset);
+      requiresSeek = (startIndex + offset) != stopIndex;
+    } else if (lexerAction->isPositionDependent()) {
+      input->seek(stopIndex);
+      requiresSeek = false;
+    }
+    lexerAction->execute(lexer);
+  }
+}
+
+size_t LexerActionExecutor::hashCode() const {
+  auto hash = _hashCode.load(std::memory_order_relaxed);
+  if (hash == 0) {
+    hash = MurmurHash::initialize();
+    for (const auto &lexerAction : _lexerActions) {
+      hash = MurmurHash::update(hash, lexerAction);
+    }
+    hash = MurmurHash::finish(hash, _lexerActions.size());
+    if (hash == 0) {
+      hash = std::numeric_limits<size_t>::max();
+    }
+    _hashCode.store(hash, std::memory_order_relaxed);
+  }
+  return hash;
+}
+
+bool LexerActionExecutor::equals(const LexerActionExecutor &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  return cachedHashCodeEqual(_hashCode.load(std::memory_order_relaxed), other._hashCode.load(std::memory_order_relaxed)) &&
+         _lexerActions.size() == other._lexerActions.size() &&
+         std::equal(_lexerActions.begin(), _lexerActions.end(), other._lexerActions.begin(), lexerActionEqual);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerActionExecutor.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerActionExecutor.h
new file mode 100755
index 0000000000..28bb1e28ec
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerActionExecutor.h
@@ -0,0 +1,128 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "CharStream.h"
+#include "atn/LexerAction.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// Represents an executor for a sequence of lexer actions which traversed during
+  /// the matching operation of a lexer rule (token).
+  ///
+  /// <para>The executor tracks position information for position-dependent lexer actions
+  /// efficiently, ensuring that actions appearing only at the end of the rule do
+  /// not cause bloating of the <seealso cref="DFA"/> created for the lexer.</para>
+  class ANTLR4CPP_PUBLIC LexerActionExecutor final : public std::enable_shared_from_this<LexerActionExecutor> {
+  public:
+    /// <summary>
+    /// Constructs an executor for a sequence of <seealso cref="LexerAction"/> actions. </summary>
+    /// <param name="lexerActions"> The lexer actions to execute. </param>
+    explicit LexerActionExecutor(std::vector<Ref<const LexerAction>> lexerActions);
+
+    /// <summary>
+    /// Creates a <seealso cref="LexerActionExecutor"/> which executes the actions for
+    /// the input {@code lexerActionExecutor} followed by a specified
+    /// {@code lexerAction}.
+    /// </summary>
+    /// <param name="lexerActionExecutor"> The executor for actions already traversed by
+    /// the lexer while matching a token within a particular
+    /// <seealso cref="LexerATNConfig"/>. If this is {@code null}, the method behaves as
+    /// though it were an empty executor. </param>
+    /// <param name="lexerAction"> The lexer action to execute after the actions
+    /// specified in {@code lexerActionExecutor}.
+    /// </param>
+    /// <returns> A <seealso cref="LexerActionExecutor"/> for executing the combine actions
+    /// of {@code lexerActionExecutor} and {@code lexerAction}. </returns>
+    static Ref<const LexerActionExecutor> append(const Ref<const LexerActionExecutor> &lexerActionExecutor,
+                                                 Ref<const LexerAction> lexerAction);
+
+    /// <summary>
+    /// Creates a <seealso cref="LexerActionExecutor"/> which encodes the current offset
+    /// for position-dependent lexer actions.
+    ///
+    /// <para>Normally, when the executor encounters lexer actions where
+    /// <seealso cref="LexerAction#isPositionDependent"/> returns {@code true}, it calls
+    /// <seealso cref="IntStream#seek"/> on the input <seealso cref="CharStream"/> to set the input
+    /// position to the <em>end</em> of the current token. This behavior provides
+    /// for efficient DFA representation of lexer actions which appear at the end
+    /// of a lexer rule, even when the lexer rule matches a variable number of
+    /// characters.</para>
+    ///
+    /// <para>Prior to traversing a match transition in the ATN, the current offset
+    /// from the token start index is assigned to all position-dependent lexer
+    /// actions which have not already been assigned a fixed offset. By storing
+    /// the offsets relative to the token start index, the DFA representation of
+    /// lexer actions which appear in the middle of tokens remains efficient due
+    /// to sharing among tokens of the same length, regardless of their absolute
+    /// position in the input stream.</para>
+    ///
+    /// <para>If the current executor already has offsets assigned to all
+    /// position-dependent lexer actions, the method returns {@code this}.</para>
+    /// </summary>
+    /// <param name="offset"> The current offset to assign to all position-dependent
+    /// lexer actions which do not already have offsets assigned.
+    /// </param>
+    /// <returns> A <seealso cref="LexerActionExecutor"/> which stores input stream offsets
+    /// for all position-dependent lexer actions. </returns>
+    Ref<const LexerActionExecutor> fixOffsetBeforeMatch(int offset) const;
+
+    /// <summary>
+    /// Gets the lexer actions to be executed by this executor. </summary>
+    /// <returns> The lexer actions to be executed by this executor. </returns>
+    const std::vector<Ref<const LexerAction>>& getLexerActions() const;
+
+    /// <summary>
+    /// Execute the actions encapsulated by this executor within the context of a
+    /// particular <seealso cref="Lexer"/>.
+    ///
+    /// <para>This method calls <seealso cref="IntStream#seek"/> to set the position of the
+    /// {@code input} <seealso cref="CharStream"/> prior to calling
+    /// <seealso cref="LexerAction#execute"/> on a position-dependent action. Before the
+    /// method returns, the input position will be restored to the same position
+    /// it was in when the method was invoked.</para>
+    /// </summary>
+    /// <param name="lexer"> The lexer instance. </param>
+    /// <param name="input"> The input stream which is the source for the current token.
+    /// When this method is called, the current <seealso cref="IntStream#index"/> for
+    /// {@code input} should be the start of the following token, i.e. 1
+    /// character past the end of the current token. </param>
+    /// <param name="startIndex"> The token start index. This value may be passed to
+    /// <seealso cref="IntStream#seek"/> to set the {@code input} position to the beginning
+    /// of the token. </param>
+    void execute(Lexer *lexer, CharStream *input, size_t startIndex) const;
+
+    size_t hashCode() const;
+
+    bool equals(const LexerActionExecutor &other) const;
+
+  private:
+    const std::vector<Ref<const LexerAction>> _lexerActions;
+    mutable std::atomic<size_t> _hashCode;
+  };
+
+  inline bool operator==(const LexerActionExecutor &lhs, const LexerActionExecutor &rhs) {
+    return lhs.equals(rhs);
+  }
+
+  inline bool operator!=(const LexerActionExecutor &lhs, const LexerActionExecutor &rhs) {
+    return !operator==(lhs, rhs);
+  }
+
+}  // namespace atn
+}  // namespace antlr4
+
+namespace std {
+
+  template <>
+  struct hash<::antlr4::atn::LexerActionExecutor> {
+    size_t operator()(const ::antlr4::atn::LexerActionExecutor &lexerActionExecutor) const {
+      return lexerActionExecutor.hashCode();
+    }
+  };
+
+}  // namespace std
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerActionType.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerActionType.h
new file mode 100755
index 0000000000..aab4033415
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerActionType.h
@@ -0,0 +1,57 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// Represents the serialization type of a <seealso cref="LexerAction"/>.
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  enum class LexerActionType : size_t {
+    /// <summary>
+    /// The type of a <seealso cref="LexerChannelAction"/> action.
+    /// </summary>
+    CHANNEL = 0,
+    /// <summary>
+    /// The type of a <seealso cref="LexerCustomAction"/> action.
+    /// </summary>
+    CUSTOM,
+    /// <summary>
+    /// The type of a <seealso cref="LexerModeAction"/> action.
+    /// </summary>
+    MODE,
+    /// <summary>
+    /// The type of a <seealso cref="LexerMoreAction"/> action.
+    /// </summary>
+    MORE,
+    /// <summary>
+    /// The type of a <seealso cref="LexerPopModeAction"/> action.
+    /// </summary>
+    POP_MODE,
+    /// <summary>
+    /// The type of a <seealso cref="LexerPushModeAction"/> action.
+    /// </summary>
+    PUSH_MODE,
+    /// <summary>
+    /// The type of a <seealso cref="LexerSkipAction"/> action.
+    /// </summary>
+    SKIP,
+    /// <summary>
+    /// The type of a <seealso cref="LexerTypeAction"/> action.
+    /// </summary>
+    TYPE,
+
+    INDEXED_CUSTOM,
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerChannelAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerChannelAction.cpp
new file mode 100755
index 0000000000..b6cda6cff0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerChannelAction.cpp
@@ -0,0 +1,43 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+#include "support/Casts.h"
+
+#include "atn/LexerChannelAction.h"
+
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+using namespace antlrcpp;
+
+LexerChannelAction::LexerChannelAction(int channel)
+    : LexerAction(LexerActionType::CHANNEL, false), _channel(channel) {}
+
+void LexerChannelAction::execute(Lexer *lexer) const {
+  lexer->setChannel(getChannel());
+}
+
+size_t LexerChannelAction::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getActionType()));
+  hash = MurmurHash::update(hash, getChannel());
+  return MurmurHash::finish(hash, 2);
+}
+
+bool LexerChannelAction::equals(const LexerAction &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  if (getActionType() != other.getActionType()) {
+    return false;
+  }
+  const auto &lexerAction = downCast<const LexerChannelAction&>(other);
+  return getChannel() == lexerAction.getChannel();
+}
+
+std::string LexerChannelAction::toString() const {
+  return "channel(" + std::to_string(getChannel()) + ")";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerChannelAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerChannelAction.h
new file mode 100755
index 0000000000..1a5c53efef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerChannelAction.h
@@ -0,0 +1,59 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/LexerAction.h"
+#include "atn/LexerActionType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  using antlr4::Lexer;
+
+  /// <summary>
+  /// Implements the {@code channel} lexer action by calling
+  /// <seealso cref="Lexer#setChannel"/> with the assigned channel.
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  class ANTLR4CPP_PUBLIC LexerChannelAction final : public LexerAction {
+  public:
+    static bool is(const LexerAction &lexerAction) { return lexerAction.getActionType() == LexerActionType::CHANNEL; }
+
+    static bool is(const LexerAction *lexerAction) { return lexerAction != nullptr && is(*lexerAction); }
+
+    /// <summary>
+    /// Constructs a new {@code channel} action with the specified channel value. </summary>
+    /// <param name="channel"> The channel value to pass to <seealso cref="Lexer#setChannel"/>. </param>
+    explicit LexerChannelAction(int channel);
+
+    /// <summary>
+    /// Gets the channel to use for the <seealso cref="Token"/> created by the lexer.
+    /// </summary>
+    /// <returns> The channel to use for the <seealso cref="Token"/> created by the lexer. </returns>
+    int getChannel() const { return _channel; }
+
+    /// <summary>
+    /// {@inheritDoc}
+    ///
+    /// <para>This action is implemented by calling <seealso cref="Lexer#setChannel"/> with the
+    /// value provided by <seealso cref="#getChannel"/>.</para>
+    /// </summary>
+    void execute(Lexer *lexer) const override;
+
+    bool equals(const LexerAction &other) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+
+  private:
+    const int _channel;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerCustomAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerCustomAction.cpp
new file mode 100755
index 0000000000..b6edd89ea1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerCustomAction.cpp
@@ -0,0 +1,45 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+#include "support/Casts.h"
+
+#include "atn/LexerCustomAction.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+using namespace antlrcpp;
+
+LexerCustomAction::LexerCustomAction(size_t ruleIndex, size_t actionIndex)
+    : LexerAction(LexerActionType::CUSTOM, true), _ruleIndex(ruleIndex), _actionIndex(actionIndex) {}
+
+void LexerCustomAction::execute(Lexer *lexer) const {
+  lexer->action(nullptr, getRuleIndex(), getActionIndex());
+}
+
+size_t LexerCustomAction::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getActionType()));
+  hash = MurmurHash::update(hash, getRuleIndex());
+  hash = MurmurHash::update(hash, getActionIndex());
+  return MurmurHash::finish(hash, 3);
+}
+
+bool LexerCustomAction::equals(const LexerAction &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  if (getActionType() != other.getActionType()) {
+    return false;
+  }
+  const auto &lexerAction = downCast<const LexerCustomAction&>(other);
+  return getRuleIndex() == lexerAction.getRuleIndex() && getActionIndex() == lexerAction.getActionIndex();
+}
+
+std::string LexerCustomAction::toString() const {
+  return "custom(" + std::to_string(getRuleIndex()) + ", " + std::to_string(getActionIndex()) + ")";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerCustomAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerCustomAction.h
new file mode 100755
index 0000000000..7973271c62
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerCustomAction.h
@@ -0,0 +1,75 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/LexerAction.h"
+#include "atn/LexerActionType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// Executes a custom lexer action by calling <seealso cref="Recognizer#action"/> with the
+  /// rule and action indexes assigned to the custom action. The implementation of
+  /// a custom action is added to the generated code for the lexer in an override
+  /// of <seealso cref="Recognizer#action"/> when the grammar is compiled.
+  ///
+  /// <para>This class may represent embedded actions created with the <code>{...}</code>
+  /// syntax in ANTLR 4, as well as actions created for lexer commands where the
+  /// command argument could not be evaluated when the grammar was compiled.</para>
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  class ANTLR4CPP_PUBLIC LexerCustomAction final : public LexerAction {
+  public:
+    static bool is(const LexerAction &lexerAction) { return lexerAction.getActionType() == LexerActionType::CUSTOM; }
+
+    static bool is(const LexerAction *lexerAction) { return lexerAction != nullptr && is(*lexerAction); }
+
+    /// <summary>
+    /// Constructs a custom lexer action with the specified rule and action
+    /// indexes.
+    /// </summary>
+    /// <param name="ruleIndex"> The rule index to use for calls to
+    /// <seealso cref="Recognizer#action"/>. </param>
+    /// <param name="actionIndex"> The action index to use for calls to
+    /// <seealso cref="Recognizer#action"/>. </param>
+    LexerCustomAction(size_t ruleIndex, size_t actionIndex);
+
+    /// <summary>
+    /// Gets the rule index to use for calls to <seealso cref="Recognizer#action"/>.
+    /// </summary>
+    /// <returns> The rule index for the custom action. </returns>
+    size_t getRuleIndex() const { return _ruleIndex; }
+
+    /// <summary>
+    /// Gets the action index to use for calls to <seealso cref="Recognizer#action"/>.
+    /// </summary>
+    /// <returns> The action index for the custom action. </returns>
+    size_t getActionIndex() const { return _actionIndex; }
+
+    /// <summary>
+    /// {@inheritDoc}
+    ///
+    /// <para>Custom actions are implemented by calling <seealso cref="Lexer#action"/> with the
+    /// appropriate rule and action indexes.</para>
+    /// </summary>
+    void execute(Lexer *lexer) const override;
+
+    bool equals(const LexerAction &other) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+
+  private:
+    const size_t _ruleIndex;
+    const size_t _actionIndex;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerIndexedCustomAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerIndexedCustomAction.cpp
new file mode 100755
index 0000000000..d4137af473
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerIndexedCustomAction.cpp
@@ -0,0 +1,50 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/HashUtils.h"
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+#include "support/CPPUtils.h"
+#include "support/Casts.h"
+
+#include "atn/LexerIndexedCustomAction.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+using namespace antlrcpp;
+
+LexerIndexedCustomAction::LexerIndexedCustomAction(int offset, Ref<const LexerAction> action)
+    : LexerAction(LexerActionType::INDEXED_CUSTOM, true), _action(std::move(action)), _offset(offset) {}
+
+void LexerIndexedCustomAction::execute(Lexer *lexer) const {
+  // assume the input stream position was properly set by the calling code
+  getAction()->execute(lexer);
+}
+
+size_t LexerIndexedCustomAction::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getActionType()));
+  hash = MurmurHash::update(hash, getOffset());
+  hash = MurmurHash::update(hash, getAction());
+  return MurmurHash::finish(hash, 3);
+}
+
+bool LexerIndexedCustomAction::equals(const LexerAction &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  if (getActionType() != other.getActionType()) {
+    return false;
+  }
+  const auto &lexerAction = downCast<const LexerIndexedCustomAction&>(other);
+  return getOffset() == lexerAction.getOffset() &&
+         cachedHashCodeEqual(cachedHashCode(), lexerAction.cachedHashCode()) &&
+         *getAction() == *lexerAction.getAction();
+}
+
+std::string LexerIndexedCustomAction::toString() const {
+  return "indexedCustom(" + std::to_string(getOffset()) + ", " + getAction()->toString() + ")";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerIndexedCustomAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerIndexedCustomAction.h
new file mode 100755
index 0000000000..5693bac62b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerIndexedCustomAction.h
@@ -0,0 +1,76 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "RuleContext.h"
+#include "atn/LexerAction.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// This implementation of <seealso cref="LexerAction"/> is used for tracking input offsets
+  /// for position-dependent actions within a <seealso cref="LexerActionExecutor"/>.
+  ///
+  /// <para>This action is not serialized as part of the ATN, and is only required for
+  /// position-dependent lexer actions which appear at a location other than the
+  /// end of a rule. For more information about DFA optimizations employed for
+  /// lexer actions, see <seealso cref="LexerActionExecutor#append"/> and
+  /// <seealso cref="LexerActionExecutor#fixOffsetBeforeMatch"/>.</para>
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  class ANTLR4CPP_PUBLIC LexerIndexedCustomAction final : public LexerAction {
+  public:
+    static bool is(const LexerAction &lexerAction) { return lexerAction.getActionType() == LexerActionType::INDEXED_CUSTOM; }
+
+    static bool is(const LexerAction *lexerAction) { return lexerAction != nullptr && is(*lexerAction); }
+
+    /// <summary>
+    /// Constructs a new indexed custom action by associating a character offset
+    /// with a <seealso cref="LexerAction"/>.
+    ///
+    /// <para>Note: This class is only required for lexer actions for which
+    /// <seealso cref="LexerAction#isPositionDependent"/> returns {@code true}.</para>
+    /// </summary>
+    /// <param name="offset"> The offset into the input <seealso cref="CharStream"/>, relative to
+    /// the token start index, at which the specified lexer action should be
+    /// executed. </param>
+    /// <param name="action"> The lexer action to execute at a particular offset in the
+    /// input <seealso cref="CharStream"/>. </param>
+    LexerIndexedCustomAction(int offset, Ref<const LexerAction> action);
+
+    /// <summary>
+    /// Gets the location in the input <seealso cref="CharStream"/> at which the lexer
+    /// action should be executed. The value is interpreted as an offset relative
+    /// to the token start index.
+    /// </summary>
+    /// <returns> The location in the input <seealso cref="CharStream"/> at which the lexer
+    /// action should be executed. </returns>
+    int getOffset() const { return _offset; }
+
+    /// <summary>
+    /// Gets the lexer action to execute.
+    /// </summary>
+    /// <returns> A <seealso cref="LexerAction"/> object which executes the lexer action. </returns>
+    const Ref<const LexerAction>& getAction() const { return _action; }
+
+    void execute(Lexer *lexer) const override;
+    bool equals(const LexerAction &other) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+
+  private:
+    const Ref<const LexerAction> _action;
+    const int _offset;
+  };
+
+} // namespace atn
+} // namespace antlr4
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerModeAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerModeAction.cpp
new file mode 100755
index 0000000000..a4ca3b3d79
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerModeAction.cpp
@@ -0,0 +1,43 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+#include "support/Casts.h"
+
+#include "atn/LexerModeAction.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+using namespace antlrcpp;
+
+LexerModeAction::LexerModeAction(int mode) : LexerAction(LexerActionType::MODE, false), _mode(mode) {}
+
+void LexerModeAction::execute(Lexer *lexer) const {
+  lexer->setMode(getMode());
+}
+
+size_t LexerModeAction::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getActionType()));
+  hash = MurmurHash::update(hash, getMode());
+  return MurmurHash::finish(hash, 2);
+}
+
+bool LexerModeAction::equals(const LexerAction &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  if (getActionType() != other.getActionType()) {
+    return false;
+  }
+  const auto &lexerAction = downCast<const LexerModeAction&>(other);
+  return getMode() == lexerAction.getMode();
+}
+
+std::string LexerModeAction::toString() const {
+  return "mode(" + std::to_string(getMode()) + ")";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerModeAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerModeAction.h
new file mode 100755
index 0000000000..6fa61a2e67
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerModeAction.h
@@ -0,0 +1,57 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/LexerAction.h"
+#include "atn/LexerActionType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// Implements the {@code mode} lexer action by calling <seealso cref="Lexer#mode"/> with
+  /// the assigned mode.
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  class ANTLR4CPP_PUBLIC LexerModeAction final : public LexerAction {
+  public:
+    static bool is(const LexerAction &lexerAction) { return lexerAction.getActionType() == LexerActionType::MODE; }
+
+    static bool is(const LexerAction *lexerAction) { return lexerAction != nullptr && is(*lexerAction); }
+
+    /// <summary>
+    /// Constructs a new {@code mode} action with the specified mode value. </summary>
+    /// <param name="mode"> The mode value to pass to <seealso cref="Lexer#mode"/>. </param>
+    explicit LexerModeAction(int mode);
+
+    /// <summary>
+    /// Get the lexer mode this action should transition the lexer to.
+    /// </summary>
+    /// <returns> The lexer mode for this {@code mode} command. </returns>
+    int getMode() const { return _mode; }
+
+    /// <summary>
+    /// {@inheritDoc}
+    ///
+    /// <para>This action is implemented by calling <seealso cref="Lexer#mode"/> with the
+    /// value provided by <seealso cref="#getMode"/>.</para>
+    /// </summary>
+    void execute(Lexer *lexer) const override;
+
+    bool equals(const LexerAction &obj) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+
+  private:
+    const int _mode;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerMoreAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerMoreAction.cpp
new file mode 100755
index 0000000000..30df87b7b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerMoreAction.cpp
@@ -0,0 +1,36 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+
+#include "atn/LexerMoreAction.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+
+const Ref<const LexerMoreAction>& LexerMoreAction::getInstance() {
+  static const Ref<const LexerMoreAction> instance(new LexerMoreAction());
+  return instance;
+}
+
+void LexerMoreAction::execute(Lexer *lexer) const {
+  lexer->more();
+}
+
+size_t LexerMoreAction::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getActionType()));
+  return MurmurHash::finish(hash, 1);
+}
+
+bool LexerMoreAction::equals(const LexerAction &other) const {
+  return this == std::addressof(other);
+}
+
+std::string LexerMoreAction::toString() const {
+  return "more";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerMoreAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerMoreAction.h
new file mode 100755
index 0000000000..fc4b8fcbfc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerMoreAction.h
@@ -0,0 +1,53 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/LexerAction.h"
+#include "atn/LexerActionType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// Implements the {@code more} lexer action by calling <seealso cref="Lexer#more"/>.
+  ///
+  /// <para>The {@code more} command does not have any parameters, so this action is
+  /// implemented as a singleton instance exposed by <seealso cref="#INSTANCE"/>.</para>
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  class ANTLR4CPP_PUBLIC LexerMoreAction final : public LexerAction {
+  public:
+    static bool is(const LexerAction &lexerAction) { return lexerAction.getActionType() == LexerActionType::MORE; }
+
+    static bool is(const LexerAction *lexerAction) { return lexerAction != nullptr && is(*lexerAction); }
+
+    /// <summary>
+    /// Provides a singleton instance of this parameterless lexer action.
+    /// </summary>
+    static const Ref<const LexerMoreAction>& getInstance();
+
+    /// <summary>
+    /// {@inheritDoc}
+    ///
+    /// <para>This action is implemented by calling <seealso cref="Lexer#more"/>.</para>
+    /// </summary>
+    void execute(Lexer *lexer) const override;
+
+    bool equals(const LexerAction &obj) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+
+  private:
+    /// Constructs the singleton instance of the lexer {@code more} command.
+    LexerMoreAction() : LexerAction(LexerActionType::MORE, false) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPopModeAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPopModeAction.cpp
new file mode 100755
index 0000000000..5192049348
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPopModeAction.cpp
@@ -0,0 +1,36 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+
+#include "atn/LexerPopModeAction.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+
+const Ref<const LexerPopModeAction>& LexerPopModeAction::getInstance() {
+  static const Ref<const LexerPopModeAction> instance(new LexerPopModeAction());
+  return instance;
+}
+
+void LexerPopModeAction::execute(Lexer *lexer) const {
+  lexer->popMode();
+}
+
+size_t LexerPopModeAction::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getActionType()));
+  return MurmurHash::finish(hash, 1);
+}
+
+bool LexerPopModeAction::equals(const LexerAction &other) const {
+  return this == std::addressof(other);
+}
+
+std::string LexerPopModeAction::toString() const {
+  return "popMode";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPopModeAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPopModeAction.h
new file mode 100755
index 0000000000..8d712cad8c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPopModeAction.h
@@ -0,0 +1,53 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/LexerAction.h"
+#include "atn/LexerActionType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// Implements the {@code popMode} lexer action by calling <seealso cref="Lexer#popMode"/>.
+  ///
+  /// <para>The {@code popMode} command does not have any parameters, so this action is
+  /// implemented as a singleton instance exposed by <seealso cref="#INSTANCE"/>.</para>
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  class ANTLR4CPP_PUBLIC LexerPopModeAction final : public LexerAction {
+  public:
+    static bool is(const LexerAction &lexerAction) { return lexerAction.getActionType() == LexerActionType::POP_MODE; }
+
+    static bool is(const LexerAction *lexerAction) { return lexerAction != nullptr && is(*lexerAction); }
+
+    /// <summary>
+    /// Provides a singleton instance of this parameterless lexer action.
+    /// </summary>
+    static const Ref<const LexerPopModeAction>& getInstance();
+
+    /// <summary>
+    /// {@inheritDoc}
+    ///
+    /// <para>This action is implemented by calling <seealso cref="Lexer#popMode"/>.</para>
+    /// </summary>
+    void execute(Lexer *lexer) const override;
+
+    bool equals(const LexerAction &other) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+
+  private:
+    /// Constructs the singleton instance of the lexer {@code popMode} command.
+    LexerPopModeAction() : LexerAction(LexerActionType::POP_MODE, false) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPushModeAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPushModeAction.cpp
new file mode 100755
index 0000000000..3ebd21fab2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPushModeAction.cpp
@@ -0,0 +1,43 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+#include "support/Casts.h"
+
+#include "atn/LexerPushModeAction.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+using namespace antlrcpp;
+
+LexerPushModeAction::LexerPushModeAction(int mode) : LexerAction(LexerActionType::PUSH_MODE, false), _mode(mode) {}
+
+void LexerPushModeAction::execute(Lexer *lexer) const {
+  lexer->pushMode(getMode());
+}
+
+size_t LexerPushModeAction::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getActionType()));
+  hash = MurmurHash::update(hash, getMode());
+  return MurmurHash::finish(hash, 2);
+}
+
+bool LexerPushModeAction::equals(const LexerAction &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  if (getActionType() != other.getActionType()) {
+    return false;
+  }
+  const auto &lexerAction = downCast<const LexerPushModeAction&>(other);
+  return getMode() == lexerAction.getMode();
+}
+
+std::string LexerPushModeAction::toString() const {
+  return "pushMode(" + std::to_string(getMode()) + ")";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPushModeAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPushModeAction.h
new file mode 100755
index 0000000000..32b706b583
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerPushModeAction.h
@@ -0,0 +1,57 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/LexerAction.h"
+#include "atn/LexerActionType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// Implements the {@code pushMode} lexer action by calling
+  /// <seealso cref="Lexer#pushMode"/> with the assigned mode.
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  class ANTLR4CPP_PUBLIC LexerPushModeAction final : public LexerAction {
+  public:
+    static bool is(const LexerAction &lexerAction) { return lexerAction.getActionType() == LexerActionType::PUSH_MODE; }
+
+    static bool is(const LexerAction *lexerAction) { return lexerAction != nullptr && is(*lexerAction); }
+
+    /// <summary>
+    /// Constructs a new {@code pushMode} action with the specified mode value. </summary>
+    /// <param name="mode"> The mode value to pass to <seealso cref="Lexer#pushMode"/>. </param>
+    explicit LexerPushModeAction(int mode);
+
+    /// <summary>
+    /// Get the lexer mode this action should transition the lexer to.
+    /// </summary>
+    /// <returns> The lexer mode for this {@code pushMode} command. </returns>
+    int getMode() const { return _mode; }
+
+    /// <summary>
+    /// {@inheritDoc}
+    ///
+    /// <para>This action is implemented by calling <seealso cref="Lexer#pushMode"/> with the
+    /// value provided by <seealso cref="#getMode"/>.</para>
+    /// </summary>
+    void execute(Lexer *lexer) const override;
+
+    bool equals(const LexerAction &obj) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+
+  private:
+    const int _mode;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerSkipAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerSkipAction.cpp
new file mode 100755
index 0000000000..72f9de3e1f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerSkipAction.cpp
@@ -0,0 +1,36 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+
+#include "atn/LexerSkipAction.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+
+const Ref<const LexerSkipAction>& LexerSkipAction::getInstance() {
+  static const Ref<const LexerSkipAction> instance(new LexerSkipAction());
+  return instance;
+}
+
+void LexerSkipAction::execute(Lexer *lexer) const {
+  lexer->skip();
+}
+
+size_t LexerSkipAction::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getActionType()));
+  return MurmurHash::finish(hash, 1);
+}
+
+bool LexerSkipAction::equals(const LexerAction &other) const {
+  return this == std::addressof(other);
+}
+
+std::string LexerSkipAction::toString() const {
+  return "skip";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerSkipAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerSkipAction.h
new file mode 100755
index 0000000000..afdf4702f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerSkipAction.h
@@ -0,0 +1,51 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/LexerAction.h"
+#include "atn/LexerActionType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// Implements the {@code skip} lexer action by calling <seealso cref="Lexer#skip"/>.
+  ///
+  /// <para>The {@code skip} command does not have any parameters, so this action is
+  /// implemented as a singleton instance exposed by <seealso cref="#INSTANCE"/>.</para>
+  ///
+  /// @author Sam Harwell
+  /// @since 4.2
+  /// </summary>
+  class ANTLR4CPP_PUBLIC LexerSkipAction final : public LexerAction {
+  public:
+    static bool is(const LexerAction &lexerAction) { return lexerAction.getActionType() == LexerActionType::SKIP; }
+
+    static bool is(const LexerAction *lexerAction) { return lexerAction != nullptr && is(*lexerAction); }
+
+    /// Provides a singleton instance of this parameterless lexer action.
+    static const Ref<const LexerSkipAction>& getInstance();
+
+    /// <summary>
+    /// {@inheritDoc}
+    ///
+    /// <para>This action is implemented by calling <seealso cref="Lexer#skip"/>.</para>
+    /// </summary>
+    void execute(Lexer *lexer) const override;
+
+    bool equals(const LexerAction &obj) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+
+  private:
+    /// Constructs the singleton instance of the lexer {@code skip} command.
+    LexerSkipAction() : LexerAction(LexerActionType::SKIP, false) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerTypeAction.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerTypeAction.cpp
new file mode 100755
index 0000000000..55ccf358ba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerTypeAction.cpp
@@ -0,0 +1,43 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+#include "support/Casts.h"
+
+#include "atn/LexerTypeAction.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+using namespace antlrcpp;
+
+LexerTypeAction::LexerTypeAction(int type) : LexerAction(LexerActionType::TYPE, false), _type(type) {}
+
+void LexerTypeAction::execute(Lexer *lexer) const {
+  lexer->setType(getType());
+}
+
+size_t LexerTypeAction::hashCodeImpl() const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, static_cast<size_t>(getActionType()));
+  hash = MurmurHash::update(hash, getType());
+  return MurmurHash::finish(hash, 2);
+}
+
+bool LexerTypeAction::equals(const LexerAction &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  if (getActionType() != other.getActionType()) {
+    return false;
+  }
+  const auto &lexerAction = downCast<const LexerTypeAction&>(other);
+  return getType() == lexerAction.getType();
+}
+
+std::string LexerTypeAction::toString() const {
+  return "type(" + std::to_string(getType()) + ")";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerTypeAction.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerTypeAction.h
new file mode 100755
index 0000000000..1cd7d71fd3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LexerTypeAction.h
@@ -0,0 +1,51 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/LexerActionType.h"
+#include "atn/LexerAction.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// Implements the {@code type} lexer action by calling <seealso cref="Lexer#setType"/>
+  /// with the assigned type.
+  class ANTLR4CPP_PUBLIC LexerTypeAction final : public LexerAction {
+  public:
+    static bool is(const LexerAction &lexerAction) { return lexerAction.getActionType() == LexerActionType::TYPE; }
+
+    static bool is(const LexerAction *lexerAction) { return lexerAction != nullptr && is(*lexerAction); }
+
+    /// <summary>
+    /// Constructs a new {@code type} action with the specified token type value. </summary>
+    /// <param name="type"> The type to assign to the token using <seealso cref="Lexer#setType"/>. </param>
+    explicit LexerTypeAction(int type);
+
+    /// <summary>
+    /// Gets the type to assign to a token created by the lexer. </summary>
+    /// <returns> The type to assign to a token created by the lexer. </returns>
+    int getType() const { return _type; }
+
+    /// <summary>
+    /// {@inheritDoc}
+    ///
+    /// <para>This action is implemented by calling <seealso cref="Lexer#setType"/> with the
+    /// value provided by <seealso cref="#getType"/>.</para>
+    /// </summary>
+    void execute(Lexer *lexer) const override;
+
+    bool equals(const LexerAction &obj) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+
+  private:
+    const int _type;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LookaheadEventInfo.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LookaheadEventInfo.cpp
new file mode 100755
index 0000000000..aa3f9124c7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LookaheadEventInfo.cpp
@@ -0,0 +1,16 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/LookaheadEventInfo.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+LookaheadEventInfo::LookaheadEventInfo(size_t decision, ATNConfigSet *configs, size_t predictedAlt,
+  TokenStream *input, size_t startIndex, size_t stopIndex, bool fullCtx)
+  : DecisionEventInfo(decision, configs, input, startIndex, stopIndex, fullCtx) {
+
+  this->predictedAlt = predictedAlt;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LookaheadEventInfo.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LookaheadEventInfo.h
new file mode 100755
index 0000000000..f5fc24fde2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LookaheadEventInfo.h
@@ -0,0 +1,42 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionEventInfo.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// This class represents profiling event information for tracking the lookahead
+  /// depth required in order to make a prediction.
+  class ANTLR4CPP_PUBLIC LookaheadEventInfo : public DecisionEventInfo {
+  public:
+    /// The alternative chosen by adaptivePredict(), not necessarily
+    ///  the outermost alt shown for a rule; left-recursive rules have
+    ///  user-level alts that differ from the rewritten rule with a (...) block
+    ///  and a (..)* loop.
+    size_t predictedAlt = 0;
+
+    /// <summary>
+    /// Constructs a new instance of the <seealso cref="LookaheadEventInfo"/> class with
+    /// the specified detailed lookahead information.
+    /// </summary>
+    /// <param name="decision"> The decision number </param>
+    /// <param name="configs"> The final configuration set containing the necessary
+    /// information to determine the result of a prediction, or {@code null} if
+    /// the final configuration set is not available </param>
+    /// <param name="input"> The input token stream </param>
+    /// <param name="startIndex"> The start index for the current prediction </param>
+    /// <param name="stopIndex"> The index at which the prediction was finally made </param>
+    /// <param name="fullCtx"> {@code true} if the current lookahead is part of an LL
+    /// prediction; otherwise, {@code false} if the current lookahead is part of
+    /// an SLL prediction </param>
+    LookaheadEventInfo(size_t decision, ATNConfigSet *configs, size_t predictedAlt, TokenStream *input, size_t startIndex,
+                       size_t stopIndex, bool fullCtx);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LoopEndState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LoopEndState.h
new file mode 100755
index 0000000000..b680414ebf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/LoopEndState.h
@@ -0,0 +1,26 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// Mark the end of a * or + loop.
+  class ANTLR4CPP_PUBLIC LoopEndState final : public ATNState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::LOOP_END; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    ATNState *loopBackState = nullptr;
+
+    LoopEndState() : ATNState(ATNStateType::LOOP_END) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/NotSetTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/NotSetTransition.cpp
new file mode 100755
index 0000000000..b652290d4e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/NotSetTransition.cpp
@@ -0,0 +1,22 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/NotSetTransition.h"
+#include "atn/ATNState.h"
+#include "misc/IntervalSet.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+NotSetTransition::NotSetTransition(ATNState *target, misc::IntervalSet set) : SetTransition(TransitionType::NOT_SET, target, std::move(set)) {}
+
+bool NotSetTransition::matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const {
+  return symbol >= minVocabSymbol && symbol <= maxVocabSymbol
+    && !SetTransition::matches(symbol, minVocabSymbol, maxVocabSymbol);
+}
+
+std::string NotSetTransition::toString() const {
+  return "NOT_SET " + Transition::toString() + " { " + SetTransition::toString() + " }";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/NotSetTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/NotSetTransition.h
new file mode 100755
index 0000000000..5c88ec1094
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/NotSetTransition.h
@@ -0,0 +1,27 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/SetTransition.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC NotSetTransition final : public SetTransition {
+  public:
+    static bool is(const Transition &transition) { return transition.getTransitionType() == TransitionType::NOT_SET; }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    NotSetTransition(ATNState *target, misc::IntervalSet set);
+
+    virtual bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+
+    virtual std::string toString() const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/OrderedATNConfigSet.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/OrderedATNConfigSet.cpp
new file mode 100755
index 0000000000..a7e76cd17e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/OrderedATNConfigSet.cpp
@@ -0,0 +1,16 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/OrderedATNConfigSet.h"
+
+using namespace antlr4::atn;
+
+size_t OrderedATNConfigSet::hashCode(const ATNConfig &atnConfig) const {
+  return atnConfig.hashCode();
+}
+
+bool OrderedATNConfigSet::equals(const ATNConfig &lhs, const ATNConfig &rhs) const {
+  return lhs == rhs;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/OrderedATNConfigSet.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/OrderedATNConfigSet.h
new file mode 100755
index 0000000000..b6b344fde9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/OrderedATNConfigSet.h
@@ -0,0 +1,25 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNConfigSet.h"
+#include "atn/ATNConfig.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC OrderedATNConfigSet final : public ATNConfigSet {
+  public:
+    OrderedATNConfigSet() = default;
+
+  private:
+    size_t hashCode(const ATNConfig &atnConfig) const override;
+
+    bool equals(const ATNConfig &lhs, const ATNConfig &rhs) const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParseInfo.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParseInfo.cpp
new file mode 100755
index 0000000000..95a89ac855
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParseInfo.cpp
@@ -0,0 +1,102 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ProfilingATNSimulator.h"
+#include "dfa/DFA.h"
+
+#include "atn/ParseInfo.h"
+
+using namespace antlr4::atn;
+
+ParseInfo::ParseInfo(ProfilingATNSimulator *atnSimulator) : _atnSimulator(atnSimulator) {
+}
+
+ParseInfo::~ParseInfo() {
+}
+
+std::vector<DecisionInfo> ParseInfo::getDecisionInfo() {
+  return _atnSimulator->getDecisionInfo();
+}
+
+std::vector<size_t> ParseInfo::getLLDecisions() {
+  std::vector<DecisionInfo> decisions = _atnSimulator->getDecisionInfo();
+  std::vector<size_t> LL;
+  for (size_t i = 0; i < decisions.size(); ++i) {
+    long long fallBack = decisions[i].LL_Fallback;
+    if (fallBack > 0) {
+      LL.push_back(i);
+    }
+  }
+  return LL;
+}
+
+long long ParseInfo::getTotalTimeInPrediction() {
+  std::vector<DecisionInfo> decisions = _atnSimulator->getDecisionInfo();
+  long long t = 0;
+  for (size_t i = 0; i < decisions.size(); ++i) {
+    t += decisions[i].timeInPrediction;
+  }
+  return t;
+}
+
+long long ParseInfo::getTotalSLLLookaheadOps() {
+  std::vector<DecisionInfo> decisions = _atnSimulator->getDecisionInfo();
+  long long k = 0;
+  for (size_t i = 0; i < decisions.size(); ++i) {
+    k += decisions[i].SLL_TotalLook;
+  }
+  return k;
+}
+
+long long ParseInfo::getTotalLLLookaheadOps() {
+  std::vector<DecisionInfo> decisions = _atnSimulator->getDecisionInfo();
+  long long k = 0;
+  for (size_t i = 0; i < decisions.size(); i++) {
+    k += decisions[i].LL_TotalLook;
+  }
+  return k;
+}
+
+long long ParseInfo::getTotalSLLATNLookaheadOps() {
+  std::vector<DecisionInfo> decisions = _atnSimulator->getDecisionInfo();
+  long long k = 0;
+  for (size_t i = 0; i < decisions.size(); ++i) {
+    k += decisions[i].SLL_ATNTransitions;
+  }
+  return k;
+}
+
+long long ParseInfo::getTotalLLATNLookaheadOps() {
+  std::vector<DecisionInfo> decisions = _atnSimulator->getDecisionInfo();
+  long long k = 0;
+  for (size_t i = 0; i < decisions.size(); ++i) {
+    k += decisions[i].LL_ATNTransitions;
+  }
+  return k;
+}
+
+long long ParseInfo::getTotalATNLookaheadOps() {
+  std::vector<DecisionInfo> decisions = _atnSimulator->getDecisionInfo();
+  long long k = 0;
+  for (size_t i = 0; i < decisions.size(); ++i) {
+    k += decisions[i].SLL_ATNTransitions;
+    k += decisions[i].LL_ATNTransitions;
+  }
+  return k;
+}
+
+size_t ParseInfo::getDFASize() {
+  size_t n = 0;
+  std::vector<dfa::DFA> &decisionToDFA = _atnSimulator->decisionToDFA;
+  for (size_t i = 0; i < decisionToDFA.size(); ++i) {
+    n += getDFASize(i);
+  }
+  return n;
+}
+
+size_t ParseInfo::getDFASize(size_t decision) {
+  dfa::DFA &decisionToDFA = _atnSimulator->decisionToDFA[decision];
+  return decisionToDFA.states.size();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParseInfo.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParseInfo.h
new file mode 100755
index 0000000000..7ced7de433
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParseInfo.h
@@ -0,0 +1,102 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionInfo.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ProfilingATNSimulator;
+
+  /// This class provides access to specific and aggregate statistics gathered
+  /// during profiling of a parser.
+  class ANTLR4CPP_PUBLIC ParseInfo {
+  public:
+    ParseInfo(ProfilingATNSimulator *atnSimulator);
+    ParseInfo(ParseInfo const&) = default;
+    virtual ~ParseInfo();
+
+    ParseInfo& operator=(ParseInfo const&) = default;
+
+    /// <summary>
+    /// Gets an array of <seealso cref="DecisionInfo"/> instances containing the profiling
+    /// information gathered for each decision in the ATN.
+    /// </summary>
+    /// <returns> An array of <seealso cref="DecisionInfo"/> instances, indexed by decision
+    /// number. </returns>
+    virtual std::vector<DecisionInfo> getDecisionInfo();
+
+    /// <summary>
+    /// Gets the decision numbers for decisions that required one or more
+    /// full-context predictions during parsing. These are decisions for which
+    /// <seealso cref="DecisionInfo#LL_Fallback"/> is non-zero.
+    /// </summary>
+    /// <returns> A list of decision numbers which required one or more
+    /// full-context predictions during parsing. </returns>
+    virtual std::vector<size_t> getLLDecisions();
+
+    /// <summary>
+    /// Gets the total time spent during prediction across all decisions made
+    /// during parsing. This value is the sum of
+    /// <seealso cref="DecisionInfo#timeInPrediction"/> for all decisions.
+    /// </summary>
+    virtual long long getTotalTimeInPrediction();
+
+    /// <summary>
+    /// Gets the total number of SLL lookahead operations across all decisions
+    /// made during parsing. This value is the sum of
+    /// <seealso cref="DecisionInfo#SLL_TotalLook"/> for all decisions.
+    /// </summary>
+    virtual long long getTotalSLLLookaheadOps();
+
+    /// <summary>
+    /// Gets the total number of LL lookahead operations across all decisions
+    /// made during parsing. This value is the sum of
+    /// <seealso cref="DecisionInfo#LL_TotalLook"/> for all decisions.
+    /// </summary>
+    virtual long long getTotalLLLookaheadOps();
+
+    /// <summary>
+    /// Gets the total number of ATN lookahead operations for SLL prediction
+    /// across all decisions made during parsing.
+    /// </summary>
+    virtual long long getTotalSLLATNLookaheadOps();
+
+    /// <summary>
+    /// Gets the total number of ATN lookahead operations for LL prediction
+    /// across all decisions made during parsing.
+    /// </summary>
+    virtual long long getTotalLLATNLookaheadOps();
+
+    /// <summary>
+    /// Gets the total number of ATN lookahead operations for SLL and LL
+    /// prediction across all decisions made during parsing.
+    ///
+    /// <para>
+    /// This value is the sum of <seealso cref="#getTotalSLLATNLookaheadOps"/> and
+    /// <seealso cref="#getTotalLLATNLookaheadOps"/>.</para>
+    /// </summary>
+    virtual long long getTotalATNLookaheadOps();
+
+    /// <summary>
+    /// Gets the total number of DFA states stored in the DFA cache for all
+    /// decisions in the ATN.
+    /// </summary>
+    virtual size_t getDFASize();
+
+    /// <summary>
+    /// Gets the total number of DFA states stored in the DFA cache for a
+    /// particular decision.
+    /// </summary>
+    virtual size_t getDFASize(size_t decision);
+
+  protected:
+    const ProfilingATNSimulator *_atnSimulator; // non-owning, we are created by this simulator.
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParserATNSimulator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParserATNSimulator.cpp
new file mode 100755
index 0000000000..3a1537587c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParserATNSimulator.cpp
@@ -0,0 +1,1413 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "dfa/DFA.h"
+#include "NoViableAltException.h"
+#include "atn/DecisionState.h"
+#include "ParserRuleContext.h"
+#include "misc/IntervalSet.h"
+#include "Parser.h"
+#include "CommonTokenStream.h"
+#include "atn/NotSetTransition.h"
+#include "atn/AtomTransition.h"
+#include "atn/RuleTransition.h"
+#include "atn/PredicateTransition.h"
+#include "atn/PrecedencePredicateTransition.h"
+#include "atn/SingletonPredictionContext.h"
+#include "atn/ActionTransition.h"
+#include "atn/EpsilonTransition.h"
+#include "atn/RuleStopState.h"
+#include "atn/ATNConfigSet.h"
+#include "atn/ATNConfig.h"
+#include "internal/Synchronization.h"
+
+#include "atn/StarLoopEntryState.h"
+#include "atn/BlockStartState.h"
+#include "atn/BlockEndState.h"
+
+#include "misc/Interval.h"
+#include "ANTLRErrorListener.h"
+
+#include "Vocabulary.h"
+#include "support/Arrays.h"
+#include "support/Casts.h"
+
+#include "atn/ParserATNSimulator.h"
+
+#ifndef DEBUG_ATN
+#define DEBUG_ATN 0
+#endif
+#ifndef TRACE_ATN_SIM
+#define TRACE_ATN_SIM 0
+#endif
+#ifndef DFA_DEBUG
+#define DFA_DEBUG 0
+#endif
+#ifndef RETRY_DEBUG
+#define RETRY_DEBUG 0
+#endif
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::internal;
+using namespace antlrcpp;
+
+const bool ParserATNSimulator::TURN_OFF_LR_LOOP_ENTRY_BRANCH_OPT = ParserATNSimulator::getLrLoopSetting();
+
+ParserATNSimulator::ParserATNSimulator(const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
+                                       PredictionContextCache &sharedContextCache)
+: ParserATNSimulator(nullptr, atn, decisionToDFA, sharedContextCache) {
+}
+
+ParserATNSimulator::ParserATNSimulator(Parser *parser, const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
+                                       PredictionContextCache &sharedContextCache)
+: ParserATNSimulator(parser, atn, decisionToDFA, sharedContextCache, ParserATNSimulatorOptions()) {}
+
+ParserATNSimulator::ParserATNSimulator(Parser *parser, const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
+                                       PredictionContextCache &sharedContextCache,
+                                       const ParserATNSimulatorOptions &options)
+: ATNSimulator(atn, sharedContextCache), decisionToDFA(decisionToDFA), parser(parser),
+  mergeCache(options.getPredictionContextMergeCacheOptions()) {
+  InitializeInstanceFields();
+}
+
+void ParserATNSimulator::reset() {
+}
+
+void ParserATNSimulator::clearDFA() {
+  int size = (int)decisionToDFA.size();
+  decisionToDFA.clear();
+  for (int d = 0; d < size; ++d) {
+    decisionToDFA.push_back(dfa::DFA(atn.getDecisionState(d), d));
+  }
+}
+
+size_t ParserATNSimulator::adaptivePredict(TokenStream *input, size_t decision, ParserRuleContext *outerContext) {
+
+#if DEBUG_ATN == 1 || TRACE_ATN_SIM == 1
+    std::cout << "adaptivePredict decision " << decision << " exec LA(1)==" << getLookaheadName(input) << " line "
+      << input->LT(1)->getLine() << ":" << input->LT(1)->getCharPositionInLine() << std::endl;
+#endif
+
+  _input = input;
+  _startIndex = input->index();
+  _outerContext = outerContext;
+  dfa::DFA &dfa = decisionToDFA[decision];
+  _dfa = &dfa;
+
+  ssize_t m = input->mark();
+  size_t index = _startIndex;
+
+  // Now we are certain to have a specific decision's DFA
+  // But, do we still need an initial state?
+  auto onExit = finally([this, input, index, m] {
+    if (mergeCache.getOptions().getClearEveryN() != 0) {
+      if (++_mergeCacheCounter == mergeCache.getOptions().getClearEveryN()) {
+        mergeCache.clear();
+        _mergeCacheCounter = 0;
+      }
+    }
+    _dfa = nullptr;
+    input->seek(index);
+    input->release(m);
+  });
+
+  dfa::DFAState *s0;
+  {
+    SharedLock<SharedMutex> stateLock(atn._stateMutex);
+    if (dfa.isPrecedenceDfa()) {
+      // the start state for a precedence DFA depends on the current
+      // parser precedence, and is provided by a DFA method.
+      SharedLock<SharedMutex> edgeLock(atn._edgeMutex);
+      s0 = dfa.getPrecedenceStartState(parser->getPrecedence());
+    } else {
+      // the start state for a "regular" DFA is just s0
+      s0 = dfa.s0;
+    }
+  }
+
+  if (s0 == nullptr) {
+    auto s0_closure = computeStartState(dfa.atnStartState, &ParserRuleContext::EMPTY, false);
+    std::unique_ptr<dfa::DFAState> newState;
+    std::unique_ptr<dfa::DFAState> oldState;
+    UniqueLock<SharedMutex> stateLock(atn._stateMutex);
+    dfa::DFAState* ds0 = dfa.s0;
+    if (dfa.isPrecedenceDfa()) {
+      /* If this is a precedence DFA, we use applyPrecedenceFilter
+       * to convert the computed start state to a precedence start
+       * state. We then use DFA.setPrecedenceStartState to set the
+       * appropriate start state for the precedence level rather
+       * than simply setting DFA.s0.
+       */
+      ds0->configs = std::move(s0_closure); // not used for prediction but useful to know start configs anyway
+      newState = std::make_unique<dfa::DFAState>(applyPrecedenceFilter(ds0->configs.get()));
+      s0 = addDFAState(dfa, newState.get());
+      UniqueLock<SharedMutex> edgeLock(atn._edgeMutex);
+      dfa.setPrecedenceStartState(parser->getPrecedence(), s0);
+    } else {
+      newState = std::make_unique<dfa::DFAState>(std::move(s0_closure));
+      s0 = addDFAState(dfa, newState.get());
+      if (ds0 != s0) {
+        oldState.reset(ds0);
+        dfa.s0 = s0;
+      }
+    }
+    if (s0 == newState.get()) {
+      newState.release();
+    }
+  }
+
+  // We can start with an existing DFA.
+  size_t alt = execATN(dfa, s0, input, index, outerContext != nullptr ? outerContext : &ParserRuleContext::EMPTY);
+
+  return alt;
+}
+
+size_t ParserATNSimulator::execATN(dfa::DFA &dfa, dfa::DFAState *s0, TokenStream *input, size_t startIndex,
+                                   ParserRuleContext *outerContext) {
+
+#if DEBUG_ATN == 1 || TRACE_ATN_SIM == 1
+    std::cout << "execATN decision " << dfa.decision << ", DFA state " << s0->toString() <<
+      ", LA(1)==" << getLookaheadName(input) <<
+      " line " << input->LT(1)->getLine() << ":" << input->LT(1)->getCharPositionInLine() << std::endl;
+#endif
+
+  dfa::DFAState *previousD = s0;
+
+#if DEBUG_ATN == 1
+    std::cout << "s0 = " << s0->toString() << std::endl;
+#endif
+
+  size_t t = input->LA(1);
+
+  while (true) { // while more work
+    dfa::DFAState *D = getExistingTargetState(previousD, t);
+    if (D == nullptr) {
+      D = computeTargetState(dfa, previousD, t);
+    }
+
+    if (D == ERROR.get()) {
+      // if any configs in previous dipped into outer context, that
+      // means that input up to t actually finished entry rule
+      // at least for SLL decision. Full LL doesn't dip into outer
+      // so don't need special case.
+      // We will get an error no matter what so delay until after
+      // decision; better error message. Also, no reachable target
+      // ATN states in SLL implies LL will also get nowhere.
+      // If conflict in states that dip out, choose min since we
+      // will get error no matter what.
+      NoViableAltException e = noViableAlt(input, outerContext, previousD->configs.get(), startIndex, false);
+      input->seek(startIndex);
+      size_t alt = getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule(previousD->configs.get(), outerContext);
+      if (alt != ATN::INVALID_ALT_NUMBER) {
+        return alt;
+      }
+
+      throw e;
+    }
+
+    if (D->requiresFullContext && _mode != PredictionMode::SLL) {
+      // IF PREDS, MIGHT RESOLVE TO SINGLE ALT => SLL (or syntax error)
+      BitSet conflictingAlts;
+      if (D->predicates.size() != 0) {
+#if DEBUG_ATN == 1
+          std::cout << "DFA state has preds in DFA sim LL failover" << std::endl;
+#endif
+
+        size_t conflictIndex = input->index();
+        if (conflictIndex != startIndex) {
+          input->seek(startIndex);
+        }
+
+        conflictingAlts = evalSemanticContext(D->predicates, outerContext, true);
+        if (conflictingAlts.count() == 1) {
+#if DEBUG_ATN == 1
+            std::cout << "Full LL avoided" << std::endl;
+#endif
+
+          return conflictingAlts.nextSetBit(0);
+        }
+
+        if (conflictIndex != startIndex) {
+          // restore the index so reporting the fallback to full
+          // context occurs with the index at the correct spot
+          input->seek(conflictIndex);
+        }
+      }
+
+#if DFA_DEBUG == 1
+        std::cout << "ctx sensitive state " << outerContext << " in " << D << std::endl;
+#endif
+
+      bool fullCtx = true;
+      std::unique_ptr<ATNConfigSet> s0_closure = computeStartState(dfa.atnStartState, outerContext, fullCtx);
+      reportAttemptingFullContext(dfa, conflictingAlts, D->configs.get(), startIndex, input->index());
+      size_t alt = execATNWithFullContext(dfa, D, s0_closure.get(), input, startIndex, outerContext);
+      return alt;
+    }
+
+    if (D->isAcceptState) {
+      if (D->predicates.empty()) {
+        return D->prediction;
+      }
+
+      size_t stopIndex = input->index();
+      input->seek(startIndex);
+      BitSet alts = evalSemanticContext(D->predicates, outerContext, true);
+      switch (alts.count()) {
+        case 0:
+          throw noViableAlt(input, outerContext, D->configs.get(), startIndex, false);
+
+        case 1:
+          return alts.nextSetBit(0);
+
+        default:
+          // report ambiguity after predicate evaluation to make sure the correct
+          // set of ambig alts is reported.
+          reportAmbiguity(dfa, D, startIndex, stopIndex, false, alts, D->configs.get());
+          return alts.nextSetBit(0);
+      }
+    }
+
+    previousD = D;
+
+    if (t != Token::EOF) {
+      input->consume();
+      t = input->LA(1);
+    }
+  }
+}
+
+dfa::DFAState *ParserATNSimulator::getExistingTargetState(dfa::DFAState *previousD, size_t t) {
+  dfa::DFAState* retval;
+  SharedLock<SharedMutex> edgeLock(atn._edgeMutex);
+  auto iterator = previousD->edges.find(t);
+  retval = (iterator == previousD->edges.end()) ? nullptr : iterator->second;
+  return retval;
+}
+
+dfa::DFAState *ParserATNSimulator::computeTargetState(dfa::DFA &dfa, dfa::DFAState *previousD, size_t t) {
+  std::unique_ptr<ATNConfigSet> reach = computeReachSet(previousD->configs.get(), t, false);
+  if (reach == nullptr) {
+    addDFAEdge(dfa, previousD, t, ERROR.get());
+    return ERROR.get();
+  }
+
+  // create new target state; we'll add to DFA after it's complete
+  dfa::DFAState *D = new dfa::DFAState(std::move(reach)); /* mem-check: managed by the DFA or deleted below, "reach" is no longer valid now. */
+  size_t predictedAlt = getUniqueAlt(D->configs.get());
+
+  if (predictedAlt != ATN::INVALID_ALT_NUMBER) {
+    // NO CONFLICT, UNIQUELY PREDICTED ALT
+    D->isAcceptState = true;
+    D->configs->uniqueAlt = predictedAlt;
+    D->prediction = predictedAlt;
+  } else if (PredictionModeClass::hasSLLConflictTerminatingPrediction(_mode, D->configs.get())) {
+    // MORE THAN ONE VIABLE ALTERNATIVE
+    D->configs->conflictingAlts = getConflictingAlts(D->configs.get());
+    D->requiresFullContext = true;
+    // in SLL-only mode, we will stop at this state and return the minimum alt
+    D->isAcceptState = true;
+    D->prediction = D->configs->conflictingAlts.nextSetBit(0);
+  }
+
+  if (D->isAcceptState && D->configs->hasSemanticContext) {
+    predicateDFAState(D, atn.getDecisionState(dfa.decision));
+    if (D->predicates.size() != 0) {
+      D->prediction = ATN::INVALID_ALT_NUMBER;
+    }
+  }
+
+  // all adds to dfa are done after we've created full D state
+  dfa::DFAState *state = addDFAEdge(dfa, previousD, t, D);
+  if (state != D) {
+    delete D; // If the new state exists already we don't need it and use the existing one instead.
+  }
+  return state;
+}
+
+void ParserATNSimulator::predicateDFAState(dfa::DFAState *dfaState, DecisionState *decisionState) {
+  // We need to test all predicates, even in DFA states that
+  // uniquely predict alternative.
+  size_t nalts = decisionState->transitions.size();
+
+  // Update DFA so reach becomes accept state with (predicate,alt)
+  // pairs if preds found for conflicting alts
+  BitSet altsToCollectPredsFrom = getConflictingAltsOrUniqueAlt(dfaState->configs.get());
+  std::vector<Ref<const SemanticContext>> altToPred = getPredsForAmbigAlts(altsToCollectPredsFrom, dfaState->configs.get(), nalts);
+  if (!altToPred.empty()) {
+    dfaState->predicates = getPredicatePredictions(altsToCollectPredsFrom, altToPred);
+    dfaState->prediction = ATN::INVALID_ALT_NUMBER; // make sure we use preds
+  } else {
+    // There are preds in configs but they might go away
+    // when OR'd together like {p}? || NONE == NONE. If neither
+    // alt has preds, resolve to min alt
+    dfaState->prediction = altsToCollectPredsFrom.nextSetBit(0);
+  }
+}
+
+size_t ParserATNSimulator::execATNWithFullContext(dfa::DFA &dfa, dfa::DFAState *D, ATNConfigSet *s0,
+  TokenStream *input, size_t startIndex, ParserRuleContext *outerContext) {
+
+#if TRACE_ATN_SIM == 1
+    std::cout << "execATNWithFullContext " << s0->toString() << std::endl;
+#endif
+
+  bool fullCtx = true;
+  bool foundExactAmbig = false;
+
+  std::unique_ptr<ATNConfigSet> reach;
+  ATNConfigSet *previous = s0;
+  input->seek(startIndex);
+  size_t t = input->LA(1);
+  size_t predictedAlt;
+
+  while (true) {
+    reach = computeReachSet(previous, t, fullCtx);
+    if (reach == nullptr) {
+      // if any configs in previous dipped into outer context, that
+      // means that input up to t actually finished entry rule
+      // at least for LL decision. Full LL doesn't dip into outer
+      // so don't need special case.
+      // We will get an error no matter what so delay until after
+      // decision; better error message. Also, no reachable target
+      // ATN states in SLL implies LL will also get nowhere.
+      // If conflict in states that dip out, choose min since we
+      // will get error no matter what.
+      NoViableAltException e = noViableAlt(input, outerContext, previous, startIndex, previous != s0);
+      input->seek(startIndex);
+      size_t alt = getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule(previous, outerContext);
+      if (alt != ATN::INVALID_ALT_NUMBER) {
+        return alt;
+      }
+      throw e;
+    }
+    if (previous != s0) // Don't delete the start set.
+        delete previous;
+    previous = nullptr;
+
+    std::vector<BitSet> altSubSets = PredictionModeClass::getConflictingAltSubsets(reach.get());
+    reach->uniqueAlt = getUniqueAlt(reach.get());
+    // unique prediction?
+    if (reach->uniqueAlt != ATN::INVALID_ALT_NUMBER) {
+      predictedAlt = reach->uniqueAlt;
+      break;
+    }
+    if (_mode != PredictionMode::LL_EXACT_AMBIG_DETECTION) {
+      predictedAlt = PredictionModeClass::resolvesToJustOneViableAlt(altSubSets);
+      if (predictedAlt != ATN::INVALID_ALT_NUMBER) {
+        break;
+      }
+    } else {
+      // In exact ambiguity mode, we never try to terminate early.
+      // Just keeps scarfing until we know what the conflict is
+      if (PredictionModeClass::allSubsetsConflict(altSubSets) && PredictionModeClass::allSubsetsEqual(altSubSets)) {
+        foundExactAmbig = true;
+        predictedAlt = PredictionModeClass::getSingleViableAlt(altSubSets);
+        break;
+      }
+      // else there are multiple non-conflicting subsets or
+      // we're not sure what the ambiguity is yet.
+      // So, keep going.
+    }
+    previous = reach.release();
+
+    if (t != Token::EOF) {
+      input->consume();
+      t = input->LA(1);
+    }
+  }
+
+  // If the configuration set uniquely predicts an alternative,
+  // without conflict, then we know that it's a full LL decision
+  // not SLL.
+  if (reach->uniqueAlt != ATN::INVALID_ALT_NUMBER) {
+    reportContextSensitivity(dfa, predictedAlt, reach.get(), startIndex, input->index());
+    return predictedAlt;
+  }
+
+  // We do not check predicates here because we have checked them
+  // on-the-fly when doing full context prediction.
+
+  /*
+   In non-exact ambiguity detection mode, we might	actually be able to
+   detect an exact ambiguity, but I'm not going to spend the cycles
+   needed to check. We only emit ambiguity warnings in exact ambiguity
+   mode.
+
+   For example, we might know that we have conflicting configurations.
+   But, that does not mean that there is no way forward without a
+   conflict. It's possible to have nonconflicting alt subsets as in:
+
+   LL altSubSets=[{1, 2}, {1, 2}, {1}, {1, 2}]
+
+   from
+
+   [(17,1,[5 $]), (13,1,[5 10 $]), (21,1,[5 10 $]), (11,1,[$]),
+   (13,2,[5 10 $]), (21,2,[5 10 $]), (11,2,[$])]
+
+   In this case, (17,1,[5 $]) indicates there is some next sequence that
+   would resolve this without conflict to alternative 1. Any other viable
+   next sequence, however, is associated with a conflict.  We stop
+   looking for input because no amount of further lookahead will alter
+   the fact that we should predict alternative 1.  We just can't say for
+   sure that there is an ambiguity without looking further.
+   */
+  reportAmbiguity(dfa, D, startIndex, input->index(), foundExactAmbig, reach->getAlts(), reach.get());
+
+  return predictedAlt;
+}
+
+std::unique_ptr<ATNConfigSet> ParserATNSimulator::computeReachSet(ATNConfigSet *closure_, size_t t, bool fullCtx) {
+
+  std::unique_ptr<ATNConfigSet> intermediate(new ATNConfigSet(fullCtx));
+
+  /* Configurations already in a rule stop state indicate reaching the end
+   * of the decision rule (local context) or end of the start rule (full
+   * context). Once reached, these configurations are never updated by a
+   * closure operation, so they are handled separately for the performance
+   * advantage of having a smaller intermediate set when calling closure.
+   *
+   * For full-context reach operations, separate handling is required to
+   * ensure that the alternative matching the longest overall sequence is
+   * chosen when multiple such configurations can match the input.
+   */
+  std::vector<Ref<ATNConfig>> skippedStopStates;
+
+  // First figure out where we can reach on input t
+  for (const auto &c : closure_->configs) {
+    if (RuleStopState::is(c->state)) {
+      assert(c->context->isEmpty());
+
+      if (fullCtx || t == Token::EOF) {
+        skippedStopStates.push_back(c);
+      }
+
+      continue;
+    }
+
+    size_t n = c->state->transitions.size();
+    for (size_t ti = 0; ti < n; ti++) { // for each transition
+      const Transition *trans = c->state->transitions[ti].get();
+      ATNState *target = getReachableTarget(trans, (int)t);
+      if (target != nullptr) {
+        intermediate->add(std::make_shared<ATNConfig>(*c, target), &mergeCache);
+      }
+    }
+  }
+
+  // Now figure out where the reach operation can take us...
+  std::unique_ptr<ATNConfigSet> reach;
+
+  /* This block optimizes the reach operation for intermediate sets which
+   * trivially indicate a termination state for the overall
+   * adaptivePredict operation.
+   *
+   * The conditions assume that intermediate
+   * contains all configurations relevant to the reach set, but this
+   * condition is not true when one or more configurations have been
+   * withheld in skippedStopStates, or when the current symbol is EOF.
+   */
+  if (skippedStopStates.empty() && t != Token::EOF) {
+    if (intermediate->size() == 1) {
+      // Don't pursue the closure if there is just one state.
+      // It can only have one alternative; just add to result
+      // Also don't pursue the closure if there is unique alternative
+      // among the configurations.
+      reach = std::move(intermediate);
+    } else if (getUniqueAlt(intermediate.get()) != ATN::INVALID_ALT_NUMBER) {
+      // Also don't pursue the closure if there is unique alternative
+      // among the configurations.
+      reach = std::move(intermediate);
+    }
+  }
+
+  /* If the reach set could not be trivially determined, perform a closure
+   * operation on the intermediate set to compute its initial value.
+   */
+  if (reach == nullptr) {
+    reach.reset(new ATNConfigSet(fullCtx));
+    ATNConfig::Set closureBusy;
+
+    bool treatEofAsEpsilon = t == Token::EOF;
+    for (const auto &c : intermediate->configs) {
+      closure(c, reach.get(), closureBusy, false, fullCtx, treatEofAsEpsilon);
+    }
+  }
+
+  if (t == IntStream::EOF) {
+    /* After consuming EOF no additional input is possible, so we are
+     * only interested in configurations which reached the end of the
+     * decision rule (local context) or end of the start rule (full
+     * context). Update reach to contain only these configurations. This
+     * handles both explicit EOF transitions in the grammar and implicit
+     * EOF transitions following the end of the decision or start rule.
+     *
+     * When reach==intermediate, no closure operation was performed. In
+     * this case, removeAllConfigsNotInRuleStopState needs to check for
+     * reachable rule stop states as well as configurations already in
+     * a rule stop state.
+     *
+     * This is handled before the configurations in skippedStopStates,
+     * because any configurations potentially added from that list are
+     * already guaranteed to meet this condition whether or not it's
+     * required.
+     */
+    ATNConfigSet *temp = removeAllConfigsNotInRuleStopState(reach.get(), *reach == *intermediate);
+    if (temp != reach.get())
+      reach.reset(temp); // We got a new set, so use that.
+  }
+
+  /* If skippedStopStates is not null, then it contains at least one
+   * configuration. For full-context reach operations, these
+   * configurations reached the end of the start rule, in which case we
+   * only add them back to reach if no configuration during the current
+   * closure operation reached such a state. This ensures adaptivePredict
+   * chooses an alternative matching the longest overall sequence when
+   * multiple alternatives are viable.
+   */
+  if (skippedStopStates.size() > 0 && (!fullCtx || !PredictionModeClass::hasConfigInRuleStopState(reach.get()))) {
+    assert(!skippedStopStates.empty());
+
+    for (const auto &c : skippedStopStates) {
+      reach->add(c, &mergeCache);
+    }
+  }
+
+#if DEBUG_ATN == 1 || TRACE_ATN_SIM == 1
+    std::cout << "computeReachSet " << closure_->toString() << " -> " << reach->toString() << std::endl;
+#endif
+
+    if (reach->isEmpty()) {
+    return nullptr;
+  }
+  return reach;
+}
+
+ATNConfigSet* ParserATNSimulator::removeAllConfigsNotInRuleStopState(ATNConfigSet *configs,
+  bool lookToEndOfRule) {
+  if (PredictionModeClass::allConfigsInRuleStopStates(configs)) {
+    return configs;
+  }
+
+  ATNConfigSet *result = new ATNConfigSet(configs->fullCtx); /* mem-check: released by caller */
+
+  for (const auto &config : configs->configs) {
+    if (config->state != nullptr && config->state->getStateType() == ATNStateType::RULE_STOP) {
+      result->add(config, &mergeCache);
+      continue;
+    }
+
+    if (lookToEndOfRule && config->state->epsilonOnlyTransitions) {
+      misc::IntervalSet nextTokens = atn.nextTokens(config->state);
+      if (nextTokens.contains(Token::EPSILON)) {
+        ATNState *endOfRuleState = atn.ruleToStopState[config->state->ruleIndex];
+        result->add(std::make_shared<ATNConfig>(*config, endOfRuleState), &mergeCache);
+      }
+    }
+  }
+
+  return result;
+}
+
+std::unique_ptr<ATNConfigSet> ParserATNSimulator::computeStartState(ATNState *p, RuleContext *ctx, bool fullCtx) {
+  // always at least the implicit call to start rule
+  Ref<const PredictionContext> initialContext = PredictionContext::fromRuleContext(atn, ctx);
+  std::unique_ptr<ATNConfigSet> configs(new ATNConfigSet(fullCtx));
+
+#if DEBUG_ATN == 1 || TRACE_ATN_SIM == 1
+    std::cout << "computeStartState from ATN state " << p->toString() << " initialContext=" << initialContext->toString() << std::endl;
+#endif
+
+    for (size_t i = 0; i < p->transitions.size(); i++) {
+    ATNState *target = p->transitions[i]->target;
+    Ref<ATNConfig> c = std::make_shared<ATNConfig>(target, (int)i + 1, initialContext);
+    ATNConfig::Set closureBusy;
+    closure(c, configs.get(), closureBusy, true, fullCtx, false);
+  }
+
+  return configs;
+}
+
+std::unique_ptr<ATNConfigSet> ParserATNSimulator::applyPrecedenceFilter(ATNConfigSet *configs) {
+  std::map<size_t, Ref<const PredictionContext>> statesFromAlt1;
+  std::unique_ptr<ATNConfigSet> configSet(new ATNConfigSet(configs->fullCtx));
+  for (const auto &config : configs->configs) {
+    // handle alt 1 first
+    if (config->alt != 1) {
+      continue;
+    }
+
+    Ref<const SemanticContext> updatedContext = config->semanticContext->evalPrecedence(parser, _outerContext);
+    if (updatedContext == nullptr) {
+      // the configuration was eliminated
+      continue;
+    }
+
+    statesFromAlt1[config->state->stateNumber] = config->context;
+    if (updatedContext != config->semanticContext) {
+      configSet->add(std::make_shared<ATNConfig>(*config, updatedContext), &mergeCache);
+    }
+    else {
+      configSet->add(config, &mergeCache);
+    }
+  }
+
+  for (const auto &config : configs->configs) {
+    if (config->alt == 1) {
+      // already handled
+      continue;
+    }
+
+    if (!config->isPrecedenceFilterSuppressed()) {
+      /* In the future, this elimination step could be updated to also
+       * filter the prediction context for alternatives predicting alt>1
+       * (basically a graph subtraction algorithm).
+       */
+      auto iterator = statesFromAlt1.find(config->state->stateNumber);
+      if (iterator != statesFromAlt1.end() && *iterator->second == *config->context) {
+        // eliminated
+        continue;
+      }
+    }
+
+    configSet->add(config, &mergeCache);
+  }
+
+  return configSet;
+}
+
+atn::ATNState* ParserATNSimulator::getReachableTarget(const Transition *trans, size_t ttype) {
+  if (trans->matches(ttype, 0, atn.maxTokenType)) {
+    return trans->target;
+  }
+
+  return nullptr;
+}
+
+// Note that caller must memory manage the returned value from this function
+std::vector<Ref<const SemanticContext>> ParserATNSimulator::getPredsForAmbigAlts(const BitSet &ambigAlts,
+  ATNConfigSet *configs, size_t nalts) {
+  // REACH=[1|1|[]|0:0, 1|2|[]|0:1]
+  /* altToPred starts as an array of all null contexts. The entry at index i
+   * corresponds to alternative i. altToPred[i] may have one of three values:
+   *   1. null: no ATNConfig c is found such that c.alt==i
+   *   2. SemanticContext.NONE: At least one ATNConfig c exists such that
+   *      c.alt==i and c.semanticContext==SemanticContext.NONE. In other words,
+   *      alt i has at least one un-predicated config.
+   *   3. Non-NONE Semantic Context: There exists at least one, and for all
+   *      ATNConfig c such that c.alt==i, c.semanticContext!=SemanticContext.NONE.
+   *
+   * From this, it is clear that NONE||anything==NONE.
+   */
+  std::vector<Ref<const SemanticContext>> altToPred(nalts + 1);
+
+  for (const auto &c : configs->configs) {
+    if (ambigAlts.test(c->alt)) {
+      altToPred[c->alt] = SemanticContext::Or(altToPred[c->alt], c->semanticContext);
+    }
+  }
+
+  size_t nPredAlts = 0;
+  for (size_t i = 1; i <= nalts; i++) {
+    if (altToPred[i] == nullptr) {
+      altToPred[i] = SemanticContext::Empty::Instance;
+    } else if (altToPred[i] != SemanticContext::Empty::Instance) {
+      nPredAlts++;
+    }
+  }
+
+  // nonambig alts are null in altToPred
+  if (nPredAlts == 0) {
+    altToPred.clear();
+  }
+#if DEBUG_ATN == 1
+    std::cout << "getPredsForAmbigAlts result " << Arrays::toString(altToPred) << std::endl;
+#endif
+
+  return altToPred;
+}
+
+std::vector<dfa::DFAState::PredPrediction> ParserATNSimulator::getPredicatePredictions(const antlrcpp::BitSet &ambigAlts,
+                                                                                       const std::vector<Ref<const SemanticContext>> &altToPred) {
+  bool containsPredicate = std::find_if(altToPred.begin(), altToPred.end(), [](const Ref<const SemanticContext> &context) {
+    return context != SemanticContext::Empty::Instance;
+  }) != altToPred.end();
+  std::vector<dfa::DFAState::PredPrediction> pairs;
+  if (containsPredicate) {
+    for (size_t i = 1; i < altToPred.size(); i++) {
+      const auto &pred = altToPred[i];
+      assert(pred != nullptr); // unpredicted is indicated by SemanticContext.NONE
+      if (ambigAlts.test(i)) {
+        pairs.emplace_back(pred, static_cast<int>(i));
+      }
+    }
+  }
+  return pairs;
+}
+
+size_t ParserATNSimulator::getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule(ATNConfigSet *configs,
+  ParserRuleContext *outerContext)
+{
+  std::pair<ATNConfigSet *, ATNConfigSet *> sets = splitAccordingToSemanticValidity(configs, outerContext);
+  std::unique_ptr<ATNConfigSet> semValidConfigs(sets.first);
+  std::unique_ptr<ATNConfigSet> semInvalidConfigs(sets.second);
+  size_t alt = getAltThatFinishedDecisionEntryRule(semValidConfigs.get());
+  if (alt != ATN::INVALID_ALT_NUMBER) { // semantically/syntactically viable path exists
+    return alt;
+  }
+  // Is there a syntactically valid path with a failed pred?
+  if (!semInvalidConfigs->configs.empty()) {
+    alt = getAltThatFinishedDecisionEntryRule(semInvalidConfigs.get());
+    if (alt != ATN::INVALID_ALT_NUMBER) { // syntactically viable path exists
+      return alt;
+    }
+  }
+  return ATN::INVALID_ALT_NUMBER;
+}
+
+size_t ParserATNSimulator::getAltThatFinishedDecisionEntryRule(ATNConfigSet *configs) {
+  misc::IntervalSet alts;
+  for (const auto &c : configs->configs) {
+    if (c->getOuterContextDepth() > 0 || (c->state != nullptr && c->state->getStateType() == ATNStateType::RULE_STOP && c->context->hasEmptyPath())) {
+      alts.add(c->alt);
+    }
+  }
+  if (alts.size() == 0) {
+    return ATN::INVALID_ALT_NUMBER;
+  }
+  return alts.getMinElement();
+}
+
+std::pair<ATNConfigSet *, ATNConfigSet *> ParserATNSimulator::splitAccordingToSemanticValidity(ATNConfigSet *configs,
+  ParserRuleContext *outerContext) {
+
+  // mem-check: both pointers must be freed by the caller.
+  ATNConfigSet *succeeded(new ATNConfigSet(configs->fullCtx));
+  ATNConfigSet *failed(new ATNConfigSet(configs->fullCtx));
+  for (const auto &c : configs->configs) {
+    if (c->semanticContext != SemanticContext::Empty::Instance) {
+      bool predicateEvaluationResult = evalSemanticContext(c->semanticContext, outerContext, c->alt, configs->fullCtx);
+      if (predicateEvaluationResult) {
+        succeeded->add(c);
+      } else {
+        failed->add(c);
+      }
+    } else {
+      succeeded->add(c);
+    }
+  }
+  return { succeeded, failed };
+}
+
+BitSet ParserATNSimulator::evalSemanticContext(const std::vector<dfa::DFAState::PredPrediction> &predPredictions,
+                                               ParserRuleContext *outerContext, bool complete) {
+  BitSet predictions;
+  for (const auto &prediction : predPredictions) {
+    if (prediction.pred == SemanticContext::Empty::Instance) {
+      predictions.set(prediction.alt);
+      if (!complete) {
+        break;
+      }
+      continue;
+    }
+
+    bool fullCtx = false; // in dfa
+    bool predicateEvaluationResult = evalSemanticContext(prediction.pred, outerContext, prediction.alt, fullCtx);
+#if DEBUG_ATN == 1 || DFA_DEBUG == 1
+      std::cout << "eval pred " << prediction.toString() << " = " << predicateEvaluationResult << std::endl;
+#endif
+
+    if (predicateEvaluationResult) {
+#if DEBUG_ATN == 1 || DFA_DEBUG == 1
+        std::cout << "PREDICT " << prediction.alt << std::endl;
+#endif
+
+      predictions.set(prediction.alt);
+      if (!complete) {
+        break;
+      }
+    }
+  }
+
+  return predictions;
+}
+
+bool ParserATNSimulator::evalSemanticContext(Ref<const SemanticContext> const& pred, ParserRuleContext *parserCallStack,
+                                             size_t /*alt*/, bool /*fullCtx*/) {
+  return pred->eval(parser, parserCallStack);
+}
+
+void ParserATNSimulator::closure(Ref<ATNConfig> const& config, ATNConfigSet *configs, ATNConfig::Set &closureBusy,
+                                 bool collectPredicates, bool fullCtx, bool treatEofAsEpsilon) {
+  const int initialDepth = 0;
+  closureCheckingStopState(config, configs, closureBusy, collectPredicates, fullCtx, initialDepth, treatEofAsEpsilon);
+
+  assert(!fullCtx || !configs->dipsIntoOuterContext);
+}
+
+void ParserATNSimulator::closureCheckingStopState(Ref<ATNConfig> const& config, ATNConfigSet *configs,
+  ATNConfig::Set &closureBusy, bool collectPredicates, bool fullCtx, int depth, bool treatEofAsEpsilon) {
+
+#if TRACE_ATN_SIM == 1
+    std::cout << "closure(" << config->toString(true) << ")" << std::endl;
+#endif
+
+  if (config->state != nullptr && config->state->getStateType() == ATNStateType::RULE_STOP) {
+    // We hit rule end. If we have context info, use it
+    // run thru all possible stack tops in ctx
+    if (!config->context->isEmpty()) {
+      for (size_t i = 0; i < config->context->size(); i++) {
+        if (config->context->getReturnState(i) == PredictionContext::EMPTY_RETURN_STATE) {
+          if (fullCtx) {
+            configs->add(std::make_shared<ATNConfig>(*config, config->state, PredictionContext::EMPTY), &mergeCache);
+            continue;
+          } else {
+            // we have no context info, just chase follow links (if greedy)
+#if DEBUG_ATN == 1
+              std::cout << "FALLING off rule " << getRuleName(config->state->ruleIndex) << std::endl;
+#endif
+            closure_(config, configs, closureBusy, collectPredicates, fullCtx, depth, treatEofAsEpsilon);
+          }
+          continue;
+        }
+        ATNState *returnState = atn.states[config->context->getReturnState(i)];
+        Ref<const PredictionContext> newContext = config->context->getParent(i); // "pop" return state
+        Ref<ATNConfig> c = std::make_shared<ATNConfig>(returnState, config->alt, newContext, config->semanticContext);
+        // While we have context to pop back from, we may have
+        // gotten that context AFTER having falling off a rule.
+        // Make sure we track that we are now out of context.
+        //
+        // This assignment also propagates the
+        // isPrecedenceFilterSuppressed() value to the new
+        // configuration.
+        c->reachesIntoOuterContext = config->reachesIntoOuterContext;
+        assert(depth > INT_MIN);
+
+        closureCheckingStopState(c, configs, closureBusy, collectPredicates, fullCtx, depth - 1, treatEofAsEpsilon);
+      }
+      return;
+    } else if (fullCtx) {
+      // reached end of start rule
+      configs->add(config, &mergeCache);
+      return;
+    } else {
+      // else if we have no context info, just chase follow links (if greedy)
+    }
+  }
+
+  closure_(config, configs, closureBusy, collectPredicates, fullCtx, depth, treatEofAsEpsilon);
+}
+
+void ParserATNSimulator::closure_(Ref<ATNConfig> const& config, ATNConfigSet *configs, ATNConfig::Set &closureBusy,
+                                  bool collectPredicates, bool fullCtx, int depth, bool treatEofAsEpsilon) {
+  ATNState *p = config->state;
+  // optimization
+  if (!p->epsilonOnlyTransitions) {
+    // make sure to not return here, because EOF transitions can act as
+    // both epsilon transitions and non-epsilon transitions.
+    configs->add(config, &mergeCache);
+  }
+
+  for (size_t i = 0; i < p->transitions.size(); i++) {
+    if (i == 0 && canDropLoopEntryEdgeInLeftRecursiveRule(config.get()))
+      continue;
+
+    const Transition *t = p->transitions[i].get();
+    bool continueCollecting = !(t != nullptr && t->getTransitionType() == TransitionType::ACTION) && collectPredicates;
+    Ref<ATNConfig> c = getEpsilonTarget(config, t, continueCollecting, depth == 0, fullCtx, treatEofAsEpsilon);
+    if (c != nullptr) {
+      int newDepth = depth;
+      if (config->state != nullptr && config->state->getStateType() == ATNStateType::RULE_STOP) {
+        assert(!fullCtx);
+
+        // target fell off end of rule; mark resulting c as having dipped into outer context
+        // We can't get here if incoming config was rule stop and we had context
+        // track how far we dip into outer context.  Might
+        // come in handy and we avoid evaluating context dependent
+        // preds if this is > 0.
+
+        if (closureBusy.count(c) > 0) {
+          // avoid infinite recursion for right-recursive rules
+          continue;
+        }
+        closureBusy.insert(c);
+
+        if (_dfa != nullptr && _dfa->isPrecedenceDfa()) {
+          size_t outermostPrecedenceReturn = downCast<const EpsilonTransition *>(t)->outermostPrecedenceReturn();
+          if (outermostPrecedenceReturn == _dfa->atnStartState->ruleIndex) {
+            c->setPrecedenceFilterSuppressed(true);
+          }
+        }
+
+        c->reachesIntoOuterContext++;
+
+        if (!t->isEpsilon()) {
+          // avoid infinite recursion for EOF* and EOF+
+          if (closureBusy.count(c) == 0) {
+            closureBusy.insert(c);
+          } else {
+            continue;
+          }
+        }
+
+        configs->dipsIntoOuterContext = true; // TODO: can remove? only care when we add to set per middle of this method
+        assert(newDepth > INT_MIN);
+
+        newDepth--;
+#if DFA_DEBUG == 1
+          std::cout << "dips into outer ctx: " << c << std::endl;
+#endif
+
+      } else  if (!t->isEpsilon()) {
+        // avoid infinite recursion for EOF* and EOF+
+        if (closureBusy.count(c) == 0) {
+          closureBusy.insert(c);
+        } else {
+          continue;
+        }
+      }
+
+      if (t != nullptr && t->getTransitionType() == TransitionType::RULE) {
+        // latch when newDepth goes negative - once we step out of the entry context we can't return
+        if (newDepth >= 0) {
+          newDepth++;
+        }
+      }
+
+      closureCheckingStopState(c, configs, closureBusy, continueCollecting, fullCtx, newDepth, treatEofAsEpsilon);
+    }
+  }
+}
+
+bool ParserATNSimulator::canDropLoopEntryEdgeInLeftRecursiveRule(ATNConfig *config) const {
+  if (TURN_OFF_LR_LOOP_ENTRY_BRANCH_OPT)
+    return false;
+
+  ATNState *p = config->state;
+
+  // First check to see if we are in StarLoopEntryState generated during
+  // left-recursion elimination. For efficiency, also check if
+  // the context has an empty stack case. If so, it would mean
+  // global FOLLOW so we can't perform optimization
+  if (p->getStateType() != ATNStateType::STAR_LOOP_ENTRY ||
+      !((StarLoopEntryState *)p)->isPrecedenceDecision || // Are we the special loop entry/exit state?
+      config->context->isEmpty() ||                      // If SLL wildcard
+      config->context->hasEmptyPath())
+  {
+    return false;
+  }
+
+  // Require all return states to return back to the same rule
+  // that p is in.
+  size_t numCtxs = config->context->size();
+  for (size_t i = 0; i < numCtxs; i++) { // for each stack context
+    ATNState *returnState = atn.states[config->context->getReturnState(i)];
+    if (returnState->ruleIndex != p->ruleIndex)
+      return false;
+  }
+
+  BlockStartState *decisionStartState = (BlockStartState *)p->transitions[0]->target;
+  size_t blockEndStateNum = decisionStartState->endState->stateNumber;
+  BlockEndState *blockEndState = (BlockEndState *)atn.states[blockEndStateNum];
+
+  // Verify that the top of each stack context leads to loop entry/exit
+  // state through epsilon edges and w/o leaving rule.
+  for (size_t i = 0; i < numCtxs; i++) {                           // for each stack context
+    size_t returnStateNumber = config->context->getReturnState(i);
+    ATNState *returnState = atn.states[returnStateNumber];
+    // All states must have single outgoing epsilon edge.
+    if (returnState->transitions.size() != 1 || !returnState->transitions[0]->isEpsilon())
+    {
+      return false;
+    }
+
+    // Look for prefix op case like 'not expr', (' type ')' expr
+    ATNState *returnStateTarget = returnState->transitions[0]->target;
+    if (returnState->getStateType() == ATNStateType::BLOCK_END && returnStateTarget == p) {
+      continue;
+    }
+
+    // Look for 'expr op expr' or case where expr's return state is block end
+    // of (...)* internal block; the block end points to loop back
+    // which points to p but we don't need to check that
+    if (returnState == blockEndState) {
+      continue;
+    }
+
+    // Look for ternary expr ? expr : expr. The return state points at block end,
+    // which points at loop entry state
+    if (returnStateTarget == blockEndState) {
+      continue;
+    }
+
+    // Look for complex prefix 'between expr and expr' case where 2nd expr's
+    // return state points at block end state of (...)* internal block
+    if (returnStateTarget->getStateType() == ATNStateType::BLOCK_END &&
+        returnStateTarget->transitions.size() == 1 &&
+        returnStateTarget->transitions[0]->isEpsilon() &&
+        returnStateTarget->transitions[0]->target == p)
+    {
+      continue;
+    }
+
+    // Anything else ain't conforming.
+    return false;
+  }
+
+  return true;
+}
+
+std::string ParserATNSimulator::getRuleName(size_t index) {
+  if (parser != nullptr) {
+    return parser->getRuleNames()[index];
+  }
+  return "<rule " + std::to_string(index) + ">";
+}
+
+Ref<ATNConfig> ParserATNSimulator::getEpsilonTarget(Ref<ATNConfig> const& config, const Transition *t, bool collectPredicates,
+                                                    bool inContext, bool fullCtx, bool treatEofAsEpsilon) {
+  switch (t->getTransitionType()) {
+    case TransitionType::RULE:
+      return ruleTransition(config, static_cast<const RuleTransition*>(t));
+
+    case TransitionType::PRECEDENCE:
+      return precedenceTransition(config, static_cast<const PrecedencePredicateTransition*>(t), collectPredicates, inContext, fullCtx);
+
+    case TransitionType::PREDICATE:
+      return predTransition(config, static_cast<const PredicateTransition*>(t), collectPredicates, inContext, fullCtx);
+
+    case TransitionType::ACTION:
+      return actionTransition(config, static_cast<const ActionTransition*>(t));
+
+    case TransitionType::EPSILON:
+      return std::make_shared<ATNConfig>(*config, t->target);
+
+    case TransitionType::ATOM:
+    case TransitionType::RANGE:
+    case TransitionType::SET:
+      // EOF transitions act like epsilon transitions after the first EOF
+      // transition is traversed
+      if (treatEofAsEpsilon) {
+        if (t->matches(Token::EOF, 0, 1)) {
+          return std::make_shared<ATNConfig>(*config, t->target);
+        }
+      }
+
+      return nullptr;
+
+    default:
+      return nullptr;
+  }
+}
+
+Ref<ATNConfig> ParserATNSimulator::actionTransition(Ref<ATNConfig> const& config, const ActionTransition *t) {
+#if DFA_DEBUG == 1
+    std::cout << "ACTION edge " << t->ruleIndex << ":" << t->actionIndex << std::endl;
+#endif
+
+  return std::make_shared<ATNConfig>(*config, t->target);
+}
+
+Ref<ATNConfig> ParserATNSimulator::precedenceTransition(Ref<ATNConfig> const& config, const PrecedencePredicateTransition *pt,
+    bool collectPredicates, bool inContext, bool fullCtx) {
+#if DFA_DEBUG == 1
+    std::cout << "PRED (collectPredicates=" << collectPredicates << ") " << pt->getPrecedence() << ">=_p" << ", ctx dependent=true" << std::endl;
+    if (parser != nullptr) {
+      std::cout << "context surrounding pred is " << Arrays::listToString(parser->getRuleInvocationStack(), ", ") << std::endl;
+    }
+#endif
+
+  Ref<ATNConfig> c;
+  if (collectPredicates && inContext) {
+    const auto &predicate = pt->getPredicate();
+
+    if (fullCtx) {
+      // In full context mode, we can evaluate predicates on-the-fly
+      // during closure, which dramatically reduces the size of
+      // the config sets. It also obviates the need to test predicates
+      // later during conflict resolution.
+      size_t currentPosition = _input->index();
+      _input->seek(_startIndex);
+      bool predSucceeds = evalSemanticContext(predicate, _outerContext, config->alt, fullCtx);
+      _input->seek(currentPosition);
+      if (predSucceeds) {
+        c = std::make_shared<ATNConfig>(*config, pt->target); // no pred context
+      }
+    } else {
+      Ref<const SemanticContext> newSemCtx = SemanticContext::And(config->semanticContext, predicate);
+      c = std::make_shared<ATNConfig>(*config, pt->target, std::move(newSemCtx));
+    }
+  } else {
+    c = std::make_shared<ATNConfig>(*config, pt->target);
+  }
+
+#if DFA_DEBUG == 1
+    std::cout << "config from pred transition=" << c << std::endl;
+#endif
+
+  return c;
+}
+
+Ref<ATNConfig> ParserATNSimulator::predTransition(Ref<ATNConfig> const& config, const PredicateTransition *pt,
+  bool collectPredicates, bool inContext, bool fullCtx) {
+#if DFA_DEBUG == 1
+    std::cout << "PRED (collectPredicates=" << collectPredicates << ") " << pt->getRuleIndex() << ":" << pt->getPredIndex() << ", ctx dependent=" << pt->isCtxDependent() << std::endl;
+    if (parser != nullptr) {
+      std::cout << "context surrounding pred is " << Arrays::listToString(parser->getRuleInvocationStack(), ", ") << std::endl;
+    }
+#endif
+
+  Ref<ATNConfig> c = nullptr;
+  if (collectPredicates && (!pt->isCtxDependent() || (pt->isCtxDependent() && inContext))) {
+    const auto &predicate = pt->getPredicate();
+    if (fullCtx) {
+      // In full context mode, we can evaluate predicates on-the-fly
+      // during closure, which dramatically reduces the size of
+      // the config sets. It also obviates the need to test predicates
+      // later during conflict resolution.
+      size_t currentPosition = _input->index();
+      _input->seek(_startIndex);
+      bool predSucceeds = evalSemanticContext(predicate, _outerContext, config->alt, fullCtx);
+      _input->seek(currentPosition);
+      if (predSucceeds) {
+        c = std::make_shared<ATNConfig>(*config, pt->target); // no pred context
+      }
+    } else {
+      Ref<const SemanticContext> newSemCtx = SemanticContext::And(config->semanticContext, predicate);
+      c = std::make_shared<ATNConfig>(*config, pt->target, std::move(newSemCtx));
+    }
+  } else {
+    c = std::make_shared<ATNConfig>(*config, pt->target);
+  }
+
+#if DFA_DEBUG == 1
+    std::cout << "config from pred transition=" << c << std::endl;
+#endif
+
+  return c;
+}
+
+Ref<ATNConfig> ParserATNSimulator::ruleTransition(Ref<ATNConfig> const& config, const RuleTransition *t) {
+#if DFA_DEBUG == 1
+    std::cout << "CALL rule " << getRuleName(t->target->ruleIndex) << ", ctx=" << config->context << std::endl;
+#endif
+
+  atn::ATNState *returnState = t->followState;
+  Ref<const PredictionContext> newContext = SingletonPredictionContext::create(config->context, returnState->stateNumber);
+  return std::make_shared<ATNConfig>(*config, t->target, newContext);
+}
+
+BitSet ParserATNSimulator::getConflictingAlts(ATNConfigSet *configs) {
+  std::vector<BitSet> altsets = PredictionModeClass::getConflictingAltSubsets(configs);
+  return PredictionModeClass::getAlts(altsets);
+}
+
+BitSet ParserATNSimulator::getConflictingAltsOrUniqueAlt(ATNConfigSet *configs) {
+  BitSet conflictingAlts;
+  if (configs->uniqueAlt != ATN::INVALID_ALT_NUMBER) {
+    conflictingAlts.set(configs->uniqueAlt);
+  } else {
+    conflictingAlts = configs->conflictingAlts;
+  }
+  return conflictingAlts;
+}
+
+std::string ParserATNSimulator::getTokenName(size_t t) {
+  if (t == Token::EOF) {
+    return "EOF";
+  }
+
+  const dfa::Vocabulary &vocabulary = parser != nullptr ? parser->getVocabulary() : dfa::Vocabulary();
+  std::string displayName = vocabulary.getDisplayName(t);
+  if (displayName == std::to_string(t)) {
+    return displayName;
+  }
+
+  return displayName + "<" + std::to_string(t) + ">";
+}
+
+std::string ParserATNSimulator::getLookaheadName(TokenStream *input) {
+  return getTokenName(input->LA(1));
+}
+
+void ParserATNSimulator::dumpDeadEndConfigs(NoViableAltException &nvae) {
+  std::cerr << "dead end configs: ";
+  for (const auto &c : nvae.getDeadEndConfigs()->configs) {
+    std::string trans = "no edges";
+    if (c->state->transitions.size() > 0) {
+      const Transition *t = c->state->transitions[0].get();
+      if (t != nullptr && t->getTransitionType() == TransitionType::ATOM) {
+        const AtomTransition *at = static_cast<const AtomTransition*>(t);
+        trans = "Atom " + getTokenName(at->_label);
+      } else if (t != nullptr && t->getTransitionType() == TransitionType::SET) {
+        const SetTransition *st = static_cast<const SetTransition*>(t);
+        trans = "Set ";
+        trans += st->set.toString();
+      } else if (t != nullptr && t->getTransitionType() == TransitionType::NOT_SET) {
+        const SetTransition *st = static_cast<const NotSetTransition*>(t);
+        trans = "~Set ";
+        trans += st->set.toString();
+      }
+    }
+    std::cerr << c->toString(true) + ":" + trans;
+  }
+}
+
+NoViableAltException ParserATNSimulator::noViableAlt(TokenStream *input, ParserRuleContext *outerContext,
+  ATNConfigSet *configs, size_t startIndex, bool deleteConfigs) {
+  return NoViableAltException(parser, input, input->get(startIndex), input->LT(1), configs, outerContext, deleteConfigs);
+}
+
+size_t ParserATNSimulator::getUniqueAlt(ATNConfigSet *configs) {
+  size_t alt = ATN::INVALID_ALT_NUMBER;
+  for (const auto &c : configs->configs) {
+    if (alt == ATN::INVALID_ALT_NUMBER) {
+      alt = c->alt; // found first alt
+    } else if (c->alt != alt) {
+      return ATN::INVALID_ALT_NUMBER;
+    }
+  }
+  return alt;
+}
+
+dfa::DFAState *ParserATNSimulator::addDFAEdge(dfa::DFA &dfa, dfa::DFAState *from, ssize_t t, dfa::DFAState *to) {
+#if DFA_DEBUG == 1
+    std::cout << "EDGE " << from << " -> " << to << " upon " << getTokenName(t) << std::endl;
+#endif
+
+  if (to == nullptr) {
+    return nullptr;
+  }
+
+  {
+    UniqueLock<SharedMutex> stateLock(atn._stateMutex);
+    to = addDFAState(dfa, to); // used existing if possible not incoming
+  }
+  if (from == nullptr || t > (int)atn.maxTokenType) {
+    return to;
+  }
+
+  {
+    UniqueLock<SharedMutex> edgeLock(atn._edgeMutex);
+    from->edges[t] = to; // connect
+  }
+
+#if DFA_DEBUG == 1
+    std::string dfaText;
+    if (parser != nullptr) {
+      dfaText = dfa.toString(parser->getVocabulary());
+    } else {
+      dfaText = dfa.toString(dfa::Vocabulary());
+    }
+    std::cout << "DFA=\n" << dfaText << std::endl;
+#endif
+
+  return to;
+}
+
+dfa::DFAState *ParserATNSimulator::addDFAState(dfa::DFA &dfa, dfa::DFAState *D) {
+  if (D == ERROR.get()) {
+    return D;
+  }
+
+  // Optimizing the configs below should not alter the hash code. Thus we can just do an insert
+  // which will only succeed if an equivalent DFAState does not already exist.
+  auto [existing, inserted] = dfa.states.insert(D);
+  if (!inserted) {
+#if TRACE_ATN_SIM == 1
+      std::cout << "addDFAState " << D->toString() << " exists" << std::endl;
+#endif
+    return *existing;
+  }
+
+  // Previously we did a lookup, then set fields, then inserted. It was `dfa.states.size()`, since
+  // we already inserted we need to subtract one.
+  D->stateNumber = static_cast<int>(dfa.states.size() - 1);
+
+#if TRACE_ATN_SIM == 1
+    std::cout << "addDFAState new " << D->toString() << std::endl;
+#endif
+
+  if (!D->configs->isReadonly()) {
+    D->configs->optimizeConfigs(this);
+    D->configs->setReadonly(true);
+  }
+
+#if DFA_DEBUG == 1
+  std::cout << "adding new DFA state: " << D << std::endl;
+#endif
+
+  return D;
+}
+
+void ParserATNSimulator::reportAttemptingFullContext(dfa::DFA &dfa, const antlrcpp::BitSet &conflictingAlts,
+  ATNConfigSet *configs, size_t startIndex, size_t stopIndex) {
+#if DFA_DEBUG == 1 || RETRY_DEBUG == 1
+    misc::Interval interval = misc::Interval((int)startIndex, (int)stopIndex);
+    std::cout << "reportAttemptingFullContext decision=" << dfa.decision << ":" << configs << ", input=" << parser->getTokenStream()->getText(interval) << std::endl;
+#endif
+
+  if (parser != nullptr) {
+    parser->getErrorListenerDispatch().reportAttemptingFullContext(parser, dfa, startIndex, stopIndex, conflictingAlts, configs);
+  }
+}
+
+void ParserATNSimulator::reportContextSensitivity(dfa::DFA &dfa, size_t prediction, ATNConfigSet *configs,
+  size_t startIndex, size_t stopIndex) {
+#if DFA_DEBUG == 1 || RETRY_DEBUG == 1
+    misc::Interval interval = misc::Interval(startIndex, stopIndex);
+    std::cout << "reportContextSensitivity decision=" << dfa.decision << ":" << configs << ", input=" << parser->getTokenStream()->getText(interval) << std::endl;
+#endif
+
+  if (parser != nullptr) {
+    parser->getErrorListenerDispatch().reportContextSensitivity(parser, dfa, startIndex, stopIndex, prediction, configs);
+  }
+}
+
+void ParserATNSimulator::reportAmbiguity(dfa::DFA &dfa, dfa::DFAState * /*D*/, size_t startIndex, size_t stopIndex,
+                                         bool exact, const antlrcpp::BitSet &ambigAlts, ATNConfigSet *configs) {
+#if DFA_DEBUG == 1 || RETRY_DEBUG == 1
+    misc::Interval interval = misc::Interval((int)startIndex, (int)stopIndex);
+    std::cout << "reportAmbiguity " << ambigAlts << ":" << configs << ", input=" << parser->getTokenStream()->getText(interval) << std::endl;
+#endif
+
+  if (parser != nullptr) {
+    parser->getErrorListenerDispatch().reportAmbiguity(parser, dfa, startIndex, stopIndex, exact, ambigAlts, configs);
+  }
+}
+
+void ParserATNSimulator::setPredictionMode(PredictionMode newMode) {
+  _mode = newMode;
+}
+
+atn::PredictionMode ParserATNSimulator::getPredictionMode() {
+  return _mode;
+}
+
+Parser* ParserATNSimulator::getParser() {
+  return parser;
+}
+
+#ifdef _MSC_VER
+#pragma warning (disable:4996) // 'getenv': This function or variable may be unsafe. Consider using _dupenv_s instead.
+#endif
+
+bool ParserATNSimulator::getLrLoopSetting() {
+  char *var = std::getenv("TURN_OFF_LR_LOOP_ENTRY_BRANCH_OPT");
+  if (var == nullptr)
+    return false;
+  std::string value(var);
+  return value == "true" || value == "1";
+}
+
+#ifdef _MSC_VER
+#pragma warning (default:4996)
+#endif
+
+void ParserATNSimulator::InitializeInstanceFields() {
+  _mode = PredictionMode::LL;
+  _startIndex = 0;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParserATNSimulator.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParserATNSimulator.h
new file mode 100755
index 0000000000..28fd059dd2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParserATNSimulator.h
@@ -0,0 +1,911 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "PredictionMode.h"
+#include "dfa/DFAState.h"
+#include "atn/ATNSimulator.h"
+#include "atn/PredictionContext.h"
+#include "atn/PredictionContextMergeCache.h"
+#include "atn/ParserATNSimulatorOptions.h"
+#include "SemanticContext.h"
+#include "atn/ATNConfig.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /**
+   * The embodiment of the adaptive LL(*), ALL(*), parsing strategy.
+   *
+   * <p>
+   * The basic complexity of the adaptive strategy makes it harder to understand.
+   * We begin with ATN simulation to build paths in a DFA. Subsequent prediction
+   * requests go through the DFA first. If they reach a state without an edge for
+   * the current symbol, the algorithm fails over to the ATN simulation to
+   * complete the DFA path for the current input (until it finds a conflict state
+   * or uniquely predicting state).</p>
+   *
+   * <p>
+   * All of that is done without using the outer context because we want to create
+   * a DFA that is not dependent upon the rule invocation stack when we do a
+   * prediction. One DFA works in all contexts. We avoid using context not
+   * necessarily because it's slower, although it can be, but because of the DFA
+   * caching problem. The closure routine only considers the rule invocation stack
+   * created during prediction beginning in the decision rule. For example, if
+   * prediction occurs without invoking another rule's ATN, there are no context
+   * stacks in the configurations. When lack of context leads to a conflict, we
+   * don't know if it's an ambiguity or a weakness in the strong LL(*) parsing
+   * strategy (versus full LL(*)).</p>
+   *
+   * <p>
+   * When SLL yields a configuration set with conflict, we rewind the input and
+   * retry the ATN simulation, this time using full outer context without adding
+   * to the DFA. Configuration context stacks will be the full invocation stacks
+   * from the start rule. If we get a conflict using full context, then we can
+   * definitively say we have a true ambiguity for that input sequence. If we
+   * don't get a conflict, it implies that the decision is sensitive to the outer
+   * context. (It is not context-sensitive in the sense of context-sensitive
+   * grammars.)</p>
+   *
+   * <p>
+   * The next time we reach this DFA state with an SLL conflict, through DFA
+   * simulation, we will again retry the ATN simulation using full context mode.
+   * This is slow because we can't save the results and have to "interpret" the
+   * ATN each time we get that input.</p>
+   *
+   * <p>
+   * <strong>CACHING FULL CONTEXT PREDICTIONS</strong></p>
+   *
+   * <p>
+   * We could cache results from full context to predicted alternative easily and
+   * that saves a lot of time but doesn't work in presence of predicates. The set
+   * of visible predicates from the ATN start state changes depending on the
+   * context, because closure can fall off the end of a rule. I tried to cache
+   * tuples (stack context, semantic context, predicted alt) but it was slower
+   * than interpreting and much more complicated. Also required a huge amount of
+   * memory. The goal is not to create the world's fastest parser anyway. I'd like
+   * to keep this algorithm simple. By launching multiple threads, we can improve
+   * the speed of parsing across a large number of files.</p>
+   *
+   * <p>
+   * There is no strict ordering between the amount of input used by SLL vs LL,
+   * which makes it really hard to build a cache for full context. Let's say that
+   * we have input A B C that leads to an SLL conflict with full context X. That
+   * implies that using X we might only use A B but we could also use A B C D to
+   * resolve conflict. Input A B C D could predict alternative 1 in one position
+   * in the input and A B C E could predict alternative 2 in another position in
+   * input. The conflicting SLL configurations could still be non-unique in the
+   * full context prediction, which would lead us to requiring more input than the
+   * original A B C.	To make a	prediction cache work, we have to track	the exact
+   * input	used during the previous prediction. That amounts to a cache that maps
+   * X to a specific DFA for that context.</p>
+   *
+   * <p>
+   * Something should be done for left-recursive expression predictions. They are
+   * likely LL(1) + pred eval. Easier to do the whole SLL unless error and retry
+   * with full LL thing Sam does.</p>
+   *
+   * <p>
+   * <strong>AVOIDING FULL CONTEXT PREDICTION</strong></p>
+   *
+   * <p>
+   * We avoid doing full context retry when the outer context is empty, we did not
+   * dip into the outer context by falling off the end of the decision state rule,
+   * or when we force SLL mode.</p>
+   *
+   * <p>
+   * As an example of the not dip into outer context case, consider as super
+   * constructor calls versus function calls. One grammar might look like
+   * this:</p>
+   *
+   * <pre>
+   * ctorBody
+   *   : '{' superCall? stat* '}'
+   *   ;
+   * </pre>
+   *
+   * <p>
+   * Or, you might see something like</p>
+   *
+   * <pre>
+   * stat
+   *   : superCall ';'
+   *   | expression ';'
+   *   | ...
+   *   ;
+   * </pre>
+   *
+   * <p>
+   * In both cases I believe that no closure operations will dip into the outer
+   * context. In the first case ctorBody in the worst case will stop at the '}'.
+   * In the 2nd case it should stop at the ';'. Both cases should stay within the
+   * entry rule and not dip into the outer context.</p>
+   *
+   * <p>
+   * <strong>PREDICATES</strong></p>
+   *
+   * <p>
+   * Predicates are always evaluated if present in either SLL or LL both. SLL and
+   * LL simulation deals with predicates differently. SLL collects predicates as
+   * it performs closure operations like ANTLR v3 did. It delays predicate
+   * evaluation until it reaches and accept state. This allows us to cache the SLL
+   * ATN simulation whereas, if we had evaluated predicates on-the-fly during
+   * closure, the DFA state configuration sets would be different and we couldn't
+   * build up a suitable DFA.</p>
+   *
+   * <p>
+   * When building a DFA accept state during ATN simulation, we evaluate any
+   * predicates and return the sole semantically valid alternative. If there is
+   * more than 1 alternative, we report an ambiguity. If there are 0 alternatives,
+   * we throw an exception. Alternatives without predicates act like they have
+   * true predicates. The simple way to think about it is to strip away all
+   * alternatives with false predicates and choose the minimum alternative that
+   * remains.</p>
+   *
+   * <p>
+   * When we start in the DFA and reach an accept state that's predicated, we test
+   * those and return the minimum semantically viable alternative. If no
+   * alternatives are viable, we throw an exception.</p>
+   *
+   * <p>
+   * During full LL ATN simulation, closure always evaluates predicates and
+   * on-the-fly. This is crucial to reducing the configuration set size during
+   * closure. It hits a landmine when parsing with the Java grammar, for example,
+   * without this on-the-fly evaluation.</p>
+   *
+   * <p>
+   * <strong>SHARING DFA</strong></p>
+   *
+   * <p>
+   * All instances of the same parser share the same decision DFAs through a
+   * static field. Each instance gets its own ATN simulator but they share the
+   * same {@link #decisionToDFA} field. They also share a
+   * {@link PredictionContextCache} object that makes sure that all
+   * {@link PredictionContext} objects are shared among the DFA states. This makes
+   * a big size difference.</p>
+   *
+   * <p>
+   * <strong>THREAD SAFETY</strong></p>
+   *
+   * <p>
+   * The {@link ParserATNSimulator} locks on the {@link #decisionToDFA} field when
+   * it adds a new DFA object to that array. {@link #addDFAEdge}
+   * locks on the DFA for the current decision when setting the
+   * {@link DFAState#edges} field. {@link #addDFAState} locks on
+   * the DFA for the current decision when looking up a DFA state to see if it
+   * already exists. We must make sure that all requests to add DFA states that
+   * are equivalent result in the same shared DFA object. This is because lots of
+   * threads will be trying to update the DFA at once. The
+   * {@link #addDFAState} method also locks inside the DFA lock
+   * but this time on the shared context cache when it rebuilds the
+   * configurations' {@link PredictionContext} objects using cached
+   * subgraphs/nodes. No other locking occurs, even during DFA simulation. This is
+   * safe as long as we can guarantee that all threads referencing
+   * {@code s.edge[t]} get the same physical target {@link DFAState}, or
+   * {@code null}. Once into the DFA, the DFA simulation does not reference the
+   * {@link DFA#states} map. It follows the {@link DFAState#edges} field to new
+   * targets. The DFA simulator will either find {@link DFAState#edges} to be
+   * {@code null}, to be non-{@code null} and {@code dfa.edges[t]} null, or
+   * {@code dfa.edges[t]} to be non-null. The
+   * {@link #addDFAEdge} method could be racing to set the field
+   * but in either case the DFA simulator works; if {@code null}, and requests ATN
+   * simulation. It could also race trying to get {@code dfa.edges[t]}, but either
+   * way it will work because it's not doing a test and set operation.</p>
+   *
+   * <p>
+   * <strong>Starting with SLL then failing to combined SLL/LL (Two-Stage
+   * Parsing)</strong></p>
+   *
+   * <p>
+   * Sam pointed out that if SLL does not give a syntax error, then there is no
+   * point in doing full LL, which is slower. We only have to try LL if we get a
+   * syntax error. For maximum speed, Sam starts the parser set to pure SLL
+   * mode with the {@link BailErrorStrategy}:</p>
+   *
+   * <pre>
+   * parser.{@link Parser#getInterpreter() getInterpreter()}.{@link #setPredictionMode setPredictionMode}{@code (}{@link PredictionMode#SLL}{@code )};
+   * parser.{@link Parser#setErrorHandler setErrorHandler}(new {@link BailErrorStrategy}());
+   * </pre>
+   *
+   * <p>
+   * If it does not get a syntax error, then we're done. If it does get a syntax
+   * error, we need to retry with the combined SLL/LL strategy.</p>
+   *
+   * <p>
+   * The reason this works is as follows. If there are no SLL conflicts, then the
+   * grammar is SLL (at least for that input set). If there is an SLL conflict,
+   * the full LL analysis must yield a set of viable alternatives which is a
+   * subset of the alternatives reported by SLL. If the LL set is a singleton,
+   * then the grammar is LL but not SLL. If the LL set is the same size as the SLL
+   * set, the decision is SLL. If the LL set has size &gt; 1, then that decision
+   * is truly ambiguous on the current input. If the LL set is smaller, then the
+   * SLL conflict resolution might choose an alternative that the full LL would
+   * rule out as a possibility based upon better context information. If that's
+   * the case, then the SLL parse will definitely get an error because the full LL
+   * analysis says it's not viable. If SLL conflict resolution chooses an
+   * alternative within the LL set, them both SLL and LL would choose the same
+   * alternative because they both choose the minimum of multiple conflicting
+   * alternatives.</p>
+   *
+   * <p>
+   * Let's say we have a set of SLL conflicting alternatives {@code {1, 2, 3}} and
+   * a smaller LL set called <em>s</em>. If <em>s</em> is {@code {2, 3}}, then SLL
+   * parsing will get an error because SLL will pursue alternative 1. If
+   * <em>s</em> is {@code {1, 2}} or {@code {1, 3}} then both SLL and LL will
+   * choose the same alternative because alternative one is the minimum of either
+   * set. If <em>s</em> is {@code {2}} or {@code {3}} then SLL will get a syntax
+   * error. If <em>s</em> is {@code {1}} then SLL will succeed.</p>
+   *
+   * <p>
+   * Of course, if the input is invalid, then we will get an error for sure in
+   * both SLL and LL parsing. Erroneous input will therefore require 2 passes over
+   * the input.</p>
+   */
+  class ANTLR4CPP_PUBLIC ParserATNSimulator : public ATNSimulator {
+  public:
+    /// Testing only!
+    ParserATNSimulator(const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
+                       PredictionContextCache &sharedContextCache);
+
+    ParserATNSimulator(Parser *parser, const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
+                       PredictionContextCache &sharedContextCache);
+
+    ParserATNSimulator(Parser *parser, const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
+                       PredictionContextCache &sharedContextCache,
+                       const ParserATNSimulatorOptions &options);
+
+    virtual void reset() override;
+    virtual void clearDFA() override;
+    virtual size_t adaptivePredict(TokenStream *input, size_t decision, ParserRuleContext *outerContext);
+
+    static const bool TURN_OFF_LR_LOOP_ENTRY_BRANCH_OPT;
+
+    std::vector<dfa::DFA> &decisionToDFA;
+
+    /** Implements first-edge (loop entry) elimination as an optimization
+     *  during closure operations.  See antlr/antlr4#1398.
+     *
+     * The optimization is to avoid adding the loop entry config when
+     * the exit path can only lead back to the same
+     * StarLoopEntryState after popping context at the rule end state
+     * (traversing only epsilon edges, so we're still in closure, in
+     * this same rule).
+     *
+     * We need to detect any state that can reach loop entry on
+     * epsilon w/o exiting rule. We don't have to look at FOLLOW
+     * links, just ensure that all stack tops for config refer to key
+     * states in LR rule.
+     *
+     * To verify we are in the right situation we must first check
+     * closure is at a StarLoopEntryState generated during LR removal.
+     * Then we check that each stack top of context is a return state
+     * from one of these cases:
+     *
+     *   1. 'not' expr, '(' type ')' expr. The return state points at loop entry state
+     *   2. expr op expr. The return state is the block end of internal block of (...)*
+     *   3. 'between' expr 'and' expr. The return state of 2nd expr reference.
+     *      That state points at block end of internal block of (...)*.
+     *   4. expr '?' expr ':' expr. The return state points at block end,
+     *      which points at loop entry state.
+     *
+     * If any is true for each stack top, then closure does not add a
+     * config to the current config set for edge[0], the loop entry branch.
+     *
+     *  Conditions fail if any context for the current config is:
+     *
+     *   a. empty (we'd fall out of expr to do a global FOLLOW which could
+     *      even be to some weird spot in expr) or,
+     *   b. lies outside of expr or,
+     *   c. lies within expr but at a state not the BlockEndState
+     *   generated during LR removal
+     *
+     * Do we need to evaluate predicates ever in closure for this case?
+     *
+     * No. Predicates, including precedence predicates, are only
+     * evaluated when computing a DFA start state. I.e., only before
+     * the lookahead (but not parser) consumes a token.
+     *
+     * There are no epsilon edges allowed in LR rule alt blocks or in
+     * the "primary" part (ID here). If closure is in
+     * StarLoopEntryState any lookahead operation will have consumed a
+     * token as there are no epsilon-paths that lead to
+     * StarLoopEntryState. We do not have to evaluate predicates
+     * therefore if we are in the generated StarLoopEntryState of a LR
+     * rule. Note that when making a prediction starting at that
+     * decision point, decision d=2, compute-start-state performs
+     * closure starting at edges[0], edges[1] emanating from
+     * StarLoopEntryState. That means it is not performing closure on
+     * StarLoopEntryState during compute-start-state.
+     *
+     * How do we know this always gives same prediction answer?
+     *
+     * Without predicates, loop entry and exit paths are ambiguous
+     * upon remaining input +b (in, say, a+b). Either paths lead to
+     * valid parses. Closure can lead to consuming + immediately or by
+     * falling out of this call to expr back into expr and loop back
+     * again to StarLoopEntryState to match +b. In this special case,
+     * we choose the more efficient path, which is to take the bypass
+     * path.
+     *
+     * The lookahead language has not changed because closure chooses
+     * one path over the other. Both paths lead to consuming the same
+     * remaining input during a lookahead operation. If the next token
+     * is an operator, lookahead will enter the choice block with
+     * operators. If it is not, lookahead will exit expr. Same as if
+     * closure had chosen to enter the choice block immediately.
+     *
+     * Closure is examining one config (some loopentrystate, some alt,
+     * context) which means it is considering exactly one alt. Closure
+     * always copies the same alt to any derived configs.
+     *
+     * How do we know this optimization doesn't mess up precedence in
+     * our parse trees?
+     *
+     * Looking through expr from left edge of stat only has to confirm
+     * that an input, say, a+b+c; begins with any valid interpretation
+     * of an expression. The precedence actually doesn't matter when
+     * making a decision in stat seeing through expr. It is only when
+     * parsing rule expr that we must use the precedence to get the
+     * right interpretation and, hence, parse tree.
+     */
+    bool canDropLoopEntryEdgeInLeftRecursiveRule(ATNConfig *config) const;
+    virtual std::string getRuleName(size_t index);
+
+    virtual Ref<ATNConfig> precedenceTransition(Ref<ATNConfig> const& config, const PrecedencePredicateTransition *pt,
+                                                bool collectPredicates, bool inContext, bool fullCtx);
+
+    void setPredictionMode(PredictionMode newMode);
+    PredictionMode getPredictionMode();
+
+    Parser* getParser();
+
+    virtual std::string getTokenName(size_t t);
+
+    virtual std::string getLookaheadName(TokenStream *input);
+
+    /// <summary>
+    /// Used for debugging in adaptivePredict around execATN but I cut
+    ///  it out for clarity now that alg. works well. We can leave this
+    ///  "dead" code for a bit.
+    /// </summary>
+    virtual void dumpDeadEndConfigs(NoViableAltException &nvae);
+
+  protected:
+    Parser *const parser;
+
+    /// <summary>
+    /// Each prediction operation uses a cache for merge of prediction contexts.
+    /// Don't keep around as it wastes huge amounts of memory. The merge cache
+    /// isn't synchronized but we're ok since two threads shouldn't reuse same
+    /// parser/atnsim object because it can only handle one input at a time.
+    /// This maps graphs a and b to merged result c. (a,b)->c. We can avoid
+    /// the merge if we ever see a and b again.  Note that (b,a)->c should
+    /// also be examined during cache lookup.
+    /// </summary>
+    PredictionContextMergeCache mergeCache;
+    size_t _mergeCacheCounter = 0;
+
+    // LAME globals to avoid parameters!!!!! I need these down deep in predTransition
+    TokenStream *_input;
+    size_t _startIndex;
+    ParserRuleContext *_outerContext;
+    dfa::DFA *_dfa; // Reference into the decisionToDFA vector.
+
+    /// <summary>
+    /// Performs ATN simulation to compute a predicted alternative based
+    ///  upon the remaining input, but also updates the DFA cache to avoid
+    ///  having to traverse the ATN again for the same input sequence.
+    ///
+    /// There are some key conditions we're looking for after computing a new
+    /// set of ATN configs (proposed DFA state):
+    /// if the set is empty, there is no viable alternative for current symbol
+    /// does the state uniquely predict an alternative?
+    /// does the state have a conflict that would prevent us from
+    ///         putting it on the work list?
+    ///
+    /// We also have some key operations to do:
+    /// add an edge from previous DFA state to potentially new DFA state, D,
+    ///         upon current symbol but only if adding to work list, which means in all
+    ///         cases except no viable alternative (and possibly non-greedy decisions?)
+    /// collecting predicates and adding semantic context to DFA accept states
+    /// adding rule context to context-sensitive DFA accept states
+    /// consuming an input symbol
+    /// reporting a conflict
+    /// reporting an ambiguity
+    /// reporting a context sensitivity
+    /// reporting insufficient predicates
+    ///
+    /// cover these cases:
+    ///    dead end
+    ///    single alt
+    ///    single alt + preds
+    ///    conflict
+    ///    conflict + preds
+    /// </summary>
+    virtual size_t execATN(dfa::DFA &dfa, dfa::DFAState *s0, TokenStream *input, size_t startIndex,
+                           ParserRuleContext *outerContext);
+
+    /// <summary>
+    /// Get an existing target state for an edge in the DFA. If the target state
+    /// for the edge has not yet been computed or is otherwise not available,
+    /// this method returns {@code null}.
+    /// </summary>
+    /// <param name="previousD"> The current DFA state </param>
+    /// <param name="t"> The next input symbol </param>
+    /// <returns> The existing target DFA state for the given input symbol
+    /// {@code t}, or {@code null} if the target state for this edge is not
+    /// already cached </returns>
+    virtual dfa::DFAState* getExistingTargetState(dfa::DFAState *previousD, size_t t);
+
+    /// <summary>
+    /// Compute a target state for an edge in the DFA, and attempt to add the
+    /// computed state and corresponding edge to the DFA.
+    /// </summary>
+    /// <param name="dfa"> The DFA </param>
+    /// <param name="previousD"> The current DFA state </param>
+    /// <param name="t"> The next input symbol
+    /// </param>
+    /// <returns> The computed target DFA state for the given input symbol
+    /// {@code t}. If {@code t} does not lead to a valid DFA state, this method
+    /// returns <seealso cref="#ERROR"/>. </returns>
+    virtual dfa::DFAState *computeTargetState(dfa::DFA &dfa, dfa::DFAState *previousD, size_t t);
+
+    virtual void predicateDFAState(dfa::DFAState *dfaState, DecisionState *decisionState);
+
+    // comes back with reach.uniqueAlt set to a valid alt
+    virtual size_t execATNWithFullContext(dfa::DFA &dfa, dfa::DFAState *D, ATNConfigSet *s0,
+                                          TokenStream *input, size_t startIndex, ParserRuleContext *outerContext); // how far we got before failing over
+
+    virtual std::unique_ptr<ATNConfigSet> computeReachSet(ATNConfigSet *closure, size_t t, bool fullCtx);
+
+    /// <summary>
+    /// Return a configuration set containing only the configurations from
+    /// {@code configs} which are in a <seealso cref="RuleStopState"/>. If all
+    /// configurations in {@code configs} are already in a rule stop state, this
+    /// method simply returns {@code configs}.
+    /// <p/>
+    /// When {@code lookToEndOfRule} is true, this method uses
+    /// <seealso cref="ATN#nextTokens"/> for each configuration in {@code configs} which is
+    /// not already in a rule stop state to see if a rule stop state is reachable
+    /// from the configuration via epsilon-only transitions.
+    /// </summary>
+    /// <param name="configs"> the configuration set to update </param>
+    /// <param name="lookToEndOfRule"> when true, this method checks for rule stop states
+    /// reachable by epsilon-only transitions from each configuration in
+    /// {@code configs}.
+    /// </param>
+    /// <returns> {@code configs} if all configurations in {@code configs} are in a
+    /// rule stop state, otherwise return a new configuration set containing only
+    /// the configurations from {@code configs} which are in a rule stop state </returns>
+    virtual ATNConfigSet* removeAllConfigsNotInRuleStopState(ATNConfigSet *configs, bool lookToEndOfRule);
+
+    virtual std::unique_ptr<ATNConfigSet> computeStartState(ATNState *p, RuleContext *ctx, bool fullCtx);
+
+    /* parrt internal source braindump that doesn't mess up
+     * external API spec.
+
+     applyPrecedenceFilter is an optimization to avoid highly
+     nonlinear prediction of expressions and other left recursive
+     rules. The precedence predicates such as {3>=prec}? Are highly
+     context-sensitive in that they can only be properly evaluated
+     in the context of the proper prec argument. Without pruning,
+     these predicates are normal predicates evaluated when we reach
+     conflict state (or unique prediction). As we cannot evaluate
+     these predicates out of context, the resulting conflict leads
+     to full LL evaluation and nonlinear prediction which shows up
+     very clearly with fairly large expressions.
+
+     Example grammar:
+
+     e : e '*' e
+     | e '+' e
+     | INT
+     ;
+
+     We convert that to the following:
+
+     e[int prec]
+     :   INT
+     ( {3>=prec}? '*' e[4]
+     | {2>=prec}? '+' e[3]
+     )*
+     ;
+
+     The (..)* loop has a decision for the inner block as well as
+     an enter or exit decision, which is what concerns us here. At
+     the 1st + of input 1+2+3, the loop entry sees both predicates
+     and the loop exit also sees both predicates by falling off the
+     edge of e.  This is because we have no stack information with
+     SLL and find the follow of e, which will hit the return states
+     inside the loop after e[4] and e[3], which brings it back to
+     the enter or exit decision. In this case, we know that we
+     cannot evaluate those predicates because we have fallen off
+     the edge of the stack and will in general not know which prec
+     parameter is the right one to use in the predicate.
+
+     Because we have special information, that these are precedence
+     predicates, we can resolve them without failing over to full
+     LL despite their context sensitive nature. We make an
+     assumption that prec[-1] <= prec[0], meaning that the current
+     precedence level is greater than or equal to the precedence
+     level of recursive invocations above us in the stack. For
+     example, if predicate {3>=prec}? is true of the current prec,
+     then one option is to enter the loop to match it now. The
+     other option is to exit the loop and the left recursive rule
+     to match the current operator in rule invocation further up
+     the stack. But, we know that all of those prec are lower or
+     the same value and so we can decide to enter the loop instead
+     of matching it later. That means we can strip out the other
+     configuration for the exit branch.
+
+     So imagine we have (14,1,$,{2>=prec}?) and then
+     (14,2,$-dipsIntoOuterContext,{2>=prec}?). The optimization
+     allows us to collapse these two configurations. We know that
+     if {2>=prec}? is true for the current prec parameter, it will
+     also be true for any prec from an invoking e call, indicated
+     by dipsIntoOuterContext. As the predicates are both true, we
+     have the option to evaluate them early in the decision start
+     state. We do this by stripping both predicates and choosing to
+     enter the loop as it is consistent with the notion of operator
+     precedence. It's also how the full LL conflict resolution
+     would work.
+
+     The solution requires a different DFA start state for each
+     precedence level.
+
+     The basic filter mechanism is to remove configurations of the
+     form (p, 2, pi) if (p, 1, pi) exists for the same p and pi. In
+     other words, for the same ATN state and predicate context,
+     remove any configuration associated with an exit branch if
+     there is a configuration associated with the enter branch.
+
+     It's also the case that the filter evaluates precedence
+     predicates and resolves conflicts according to precedence
+     levels. For example, for input 1+2+3 at the first +, we see
+     prediction filtering
+
+     [(11,1,[$],{3>=prec}?), (14,1,[$],{2>=prec}?), (5,2,[$],up=1),
+     (11,2,[$],up=1), (14,2,[$],up=1)],hasSemanticContext=true,dipsIntoOuterContext
+
+     to
+
+     [(11,1,[$]), (14,1,[$]), (5,2,[$],up=1)],dipsIntoOuterContext
+
+     This filters because {3>=prec}? evals to true and collapses
+     (11,1,[$],{3>=prec}?) and (11,2,[$],up=1) since early conflict
+     resolution based upon rules of operator precedence fits with
+     our usual match first alt upon conflict.
+
+     We noticed a problem where a recursive call resets precedence
+     to 0. Sam's fix: each config has flag indicating if it has
+     returned from an expr[0] call. then just don't filter any
+     config with that flag set. flag is carried along in
+     closure(). so to avoid adding field, set bit just under sign
+     bit of dipsIntoOuterContext (SUPPRESS_PRECEDENCE_FILTER).
+     With the change you filter "unless (p, 2, pi) was reached
+     after leaving the rule stop state of the LR rule containing
+     state p, corresponding to a rule invocation with precedence
+     level 0"
+     */
+
+    /**
+     * This method transforms the start state computed by
+     * {@link #computeStartState} to the special start state used by a
+     * precedence DFA for a particular precedence value. The transformation
+     * process applies the following changes to the start state's configuration
+     * set.
+     *
+     * <ol>
+     * <li>Evaluate the precedence predicates for each configuration using
+     * {@link SemanticContext#evalPrecedence}.</li>
+     * <li>When {@link ATNConfig#isPrecedenceFilterSuppressed} is {@code false},
+     * remove all configurations which predict an alternative greater than 1,
+     * for which another configuration that predicts alternative 1 is in the
+     * same ATN state with the same prediction context. This transformation is
+     * valid for the following reasons:
+     * <ul>
+     * <li>The closure block cannot contain any epsilon transitions which bypass
+     * the body of the closure, so all states reachable via alternative 1 are
+     * part of the precedence alternatives of the transformed left-recursive
+     * rule.</li>
+     * <li>The "primary" portion of a left recursive rule cannot contain an
+     * epsilon transition, so the only way an alternative other than 1 can exist
+     * in a state that is also reachable via alternative 1 is by nesting calls
+     * to the left-recursive rule, with the outer calls not being at the
+     * preferred precedence level. The
+     * {@link ATNConfig#isPrecedenceFilterSuppressed} property marks ATN
+     * configurations which do not meet this condition, and therefore are not
+     * eligible for elimination during the filtering process.</li>
+     * </ul>
+     * </li>
+     * </ol>
+     *
+     * <p>
+     * The prediction context must be considered by this filter to address
+     * situations like the following.
+     * </p>
+     * <code>
+     * <pre>
+     * grammar TA;
+     * prog: statement* EOF;
+     * statement: letterA | statement letterA 'b' ;
+     * letterA: 'a';
+     * </pre>
+     * </code>
+     * <p>
+     * If the above grammar, the ATN state immediately before the token
+     * reference {@code 'a'} in {@code letterA} is reachable from the left edge
+     * of both the primary and closure blocks of the left-recursive rule
+     * {@code statement}. The prediction context associated with each of these
+     * configurations distinguishes between them, and prevents the alternative
+     * which stepped out to {@code prog} (and then back in to {@code statement}
+     * from being eliminated by the filter.
+     * </p>
+     *
+     * @param configs The configuration set computed by
+     * {@link #computeStartState} as the start state for the DFA.
+     * @return The transformed configuration set representing the start state
+     * for a precedence DFA at a particular precedence level (determined by
+     * calling {@link Parser#getPrecedence}).
+     */
+    std::unique_ptr<ATNConfigSet> applyPrecedenceFilter(ATNConfigSet *configs);
+
+    virtual ATNState *getReachableTarget(const Transition *trans, size_t ttype);
+
+    virtual std::vector<Ref<const SemanticContext>> getPredsForAmbigAlts(const antlrcpp::BitSet &ambigAlts,
+                                                                   ATNConfigSet *configs, size_t nalts);
+
+    std::vector<dfa::DFAState::PredPrediction> getPredicatePredictions(const antlrcpp::BitSet &ambigAlts,
+                                                                       const std::vector<Ref<const SemanticContext>> &altToPred);
+
+    /**
+     * This method is used to improve the localization of error messages by
+     * choosing an alternative rather than throwing a
+     * {@link NoViableAltException} in particular prediction scenarios where the
+     * {@link #ERROR} state was reached during ATN simulation.
+     *
+     * <p>
+     * The default implementation of this method uses the following
+     * algorithm to identify an ATN configuration which successfully parsed the
+     * decision entry rule. Choosing such an alternative ensures that the
+     * {@link ParserRuleContext} returned by the calling rule will be complete
+     * and valid, and the syntax error will be reported later at a more
+     * localized location.</p>
+     *
+     * <ul>
+     * <li>If a syntactically valid path or paths reach the end of the decision rule and
+     * they are semantically valid if predicated, return the min associated alt.</li>
+     * <li>Else, if a semantically invalid but syntactically valid path exist
+     * or paths exist, return the minimum associated alt.
+     * </li>
+     * <li>Otherwise, return {@link ATN#INVALID_ALT_NUMBER}.</li>
+     * </ul>
+     *
+     * <p>
+     * In some scenarios, the algorithm described above could predict an
+     * alternative which will result in a {@link FailedPredicateException} in
+     * the parser. Specifically, this could occur if the <em>only</em> configuration
+     * capable of successfully parsing to the end of the decision rule is
+     * blocked by a semantic predicate. By choosing this alternative within
+     * {@link #adaptivePredict} instead of throwing a
+     * {@link NoViableAltException}, the resulting
+     * {@link FailedPredicateException} in the parser will identify the specific
+     * predicate which is preventing the parser from successfully parsing the
+     * decision rule, which helps developers identify and correct logic errors
+     * in semantic predicates.
+     * </p>
+     *
+     * @param configs The ATN configurations which were valid immediately before
+     * the {@link #ERROR} state was reached
+     * @param outerContext The is the \gamma_0 initial parser context from the paper
+     * or the parser stack at the instant before prediction commences.
+     *
+     * @return The value to return from {@link #adaptivePredict}, or
+     * {@link ATN#INVALID_ALT_NUMBER} if a suitable alternative was not
+     * identified and {@link #adaptivePredict} should report an error instead.
+     */
+    size_t getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule(ATNConfigSet *configs,
+                                                                   ParserRuleContext *outerContext);
+
+    virtual size_t getAltThatFinishedDecisionEntryRule(ATNConfigSet *configs);
+
+    /** Walk the list of configurations and split them according to
+     *  those that have preds evaluating to true/false.  If no pred, assume
+     *  true pred and include in succeeded set.  Returns Pair of sets.
+     *
+     *  Create a new set so as not to alter the incoming parameter.
+     *
+     *  Assumption: the input stream has been restored to the starting point
+     *  prediction, which is where predicates need to evaluate.
+     */
+    std::pair<ATNConfigSet *, ATNConfigSet *> splitAccordingToSemanticValidity(ATNConfigSet *configs,
+                                                                               ParserRuleContext *outerContext);
+
+    /// <summary>
+    /// Look through a list of predicate/alt pairs, returning alts for the
+    ///  pairs that win. A {@code NONE} predicate indicates an alt containing an
+    ///  unpredicated config which behaves as "always true." If !complete
+    ///  then we stop at the first predicate that evaluates to true. This
+    ///  includes pairs with null predicates.
+    /// </summary>
+    antlrcpp::BitSet evalSemanticContext(const std::vector<dfa::DFAState::PredPrediction> &predPredictions,
+                                         ParserRuleContext *outerContext, bool complete);
+
+    /**
+     * Evaluate a semantic context within a specific parser context.
+     *
+     * <p>
+     * This method might not be called for every semantic context evaluated
+     * during the prediction process. In particular, we currently do not
+     * evaluate the following but it may change in the future:</p>
+     *
+     * <ul>
+     * <li>Precedence predicates (represented by
+     * {@link SemanticContext.PrecedencePredicate}) are not currently evaluated
+     * through this method.</li>
+     * <li>Operator predicates (represented by {@link SemanticContext.AND} and
+     * {@link SemanticContext.OR}) are evaluated as a single semantic
+     * context, rather than evaluating the operands individually.
+     * Implementations which require evaluation results from individual
+     * predicates should override this method to explicitly handle evaluation of
+     * the operands within operator predicates.</li>
+     * </ul>
+     *
+     * @param pred The semantic context to evaluate
+     * @param parserCallStack The parser context in which to evaluate the
+     * semantic context
+     * @param alt The alternative which is guarded by {@code pred}
+     * @param fullCtx {@code true} if the evaluation is occurring during LL
+     * prediction; otherwise, {@code false} if the evaluation is occurring
+     * during SLL prediction
+     *
+     * @since 4.3
+     */
+    virtual bool evalSemanticContext(Ref<const SemanticContext> const& pred, ParserRuleContext *parserCallStack,
+                                     size_t alt, bool fullCtx);
+
+    /* TODO: If we are doing predicates, there is no point in pursuing
+     closure operations if we reach a DFA state that uniquely predicts
+     alternative. We will not be caching that DFA state and it is a
+     waste to pursue the closure. Might have to advance when we do
+     ambig detection thought :(
+     */
+    virtual void closure(Ref<ATNConfig> const& config, ATNConfigSet *configs, ATNConfig::Set &closureBusy,
+                         bool collectPredicates, bool fullCtx, bool treatEofAsEpsilon);
+
+    virtual void closureCheckingStopState(Ref<ATNConfig> const& config, ATNConfigSet *configs, ATNConfig::Set &closureBusy,
+                                          bool collectPredicates, bool fullCtx, int depth, bool treatEofAsEpsilon);
+
+    /// Do the actual work of walking epsilon edges.
+    virtual void closure_(Ref<ATNConfig> const& config, ATNConfigSet *configs, ATNConfig::Set &closureBusy,
+                          bool collectPredicates, bool fullCtx, int depth, bool treatEofAsEpsilon);
+
+    virtual Ref<ATNConfig> getEpsilonTarget(Ref<ATNConfig> const& config, const Transition *t, bool collectPredicates,
+                                            bool inContext, bool fullCtx, bool treatEofAsEpsilon);
+    virtual Ref<ATNConfig> actionTransition(Ref<ATNConfig> const& config, const ActionTransition *t);
+
+    virtual Ref<ATNConfig> predTransition(Ref<ATNConfig> const& config, const PredicateTransition *pt, bool collectPredicates,
+                                          bool inContext, bool fullCtx);
+
+    virtual Ref<ATNConfig> ruleTransition(Ref<ATNConfig> const& config, const RuleTransition *t);
+
+    /**
+     * Gets a {@link BitSet} containing the alternatives in {@code configs}
+     * which are part of one or more conflicting alternative subsets.
+     *
+     * @param configs The {@link ATNConfigSet} to analyze.
+     * @return The alternatives in {@code configs} which are part of one or more
+     * conflicting alternative subsets. If {@code configs} does not contain any
+     * conflicting subsets, this method returns an empty {@link BitSet}.
+     */
+    virtual antlrcpp::BitSet getConflictingAlts(ATNConfigSet *configs);
+
+    /// <summary>
+    /// Sam pointed out a problem with the previous definition, v3, of
+    /// ambiguous states. If we have another state associated with conflicting
+    /// alternatives, we should keep going. For example, the following grammar
+    ///
+    /// s : (ID | ID ID?) ';' ;
+    ///
+    /// When the ATN simulation reaches the state before ';', it has a DFA
+    /// state that looks like: [12|1|[], 6|2|[], 12|2|[]]. Naturally
+    /// 12|1|[] and 12|2|[] conflict, but we cannot stop processing this node
+    /// because alternative to has another way to continue, via [6|2|[]].
+    /// The key is that we have a single state that has config's only associated
+    /// with a single alternative, 2, and crucially the state transitions
+    /// among the configurations are all non-epsilon transitions. That means
+    /// we don't consider any conflicts that include alternative 2. So, we
+    /// ignore the conflict between alts 1 and 2. We ignore a set of
+    /// conflicting alts when there is an intersection with an alternative
+    /// associated with a single alt state in the state->config-list map.
+    ///
+    /// It's also the case that we might have two conflicting configurations but
+    /// also a 3rd nonconflicting configuration for a different alternative:
+    /// [1|1|[], 1|2|[], 8|3|[]]. This can come about from grammar:
+    ///
+    /// a : A | A | A B ;
+    ///
+    /// After matching input A, we reach the stop state for rule A, state 1.
+    /// State 8 is the state right before B. Clearly alternatives 1 and 2
+    /// conflict and no amount of further lookahead will separate the two.
+    /// However, alternative 3 will be able to continue and so we do not
+    /// stop working on this state. In the previous example, we're concerned
+    /// with states associated with the conflicting alternatives. Here alt
+    /// 3 is not associated with the conflicting configs, but since we can continue
+    /// looking for input reasonably, I don't declare the state done. We
+    /// ignore a set of conflicting alts when we have an alternative
+    /// that we still need to pursue.
+    /// </summary>
+
+    virtual antlrcpp::BitSet getConflictingAltsOrUniqueAlt(ATNConfigSet *configs);
+
+    virtual NoViableAltException noViableAlt(TokenStream *input, ParserRuleContext *outerContext,
+                                              ATNConfigSet *configs, size_t startIndex, bool deleteConfigs);
+
+    static size_t getUniqueAlt(ATNConfigSet *configs);
+
+    /// <summary>
+    /// Add an edge to the DFA, if possible. This method calls
+    /// <seealso cref="#addDFAState"/> to ensure the {@code to} state is present in the
+    /// DFA. If {@code from} is {@code null}, or if {@code t} is outside the
+    /// range of edges that can be represented in the DFA tables, this method
+    /// returns without adding the edge to the DFA.
+    /// <p/>
+    /// If {@code to} is {@code null}, this method returns {@code null}.
+    /// Otherwise, this method returns the <seealso cref="DFAState"/> returned by calling
+    /// <seealso cref="#addDFAState"/> for the {@code to} state.
+    /// </summary>
+    /// <param name="dfa"> The DFA </param>
+    /// <param name="from"> The source state for the edge </param>
+    /// <param name="t"> The input symbol </param>
+    /// <param name="to"> The target state for the edge
+    /// </param>
+    /// <returns> If {@code to} is {@code null}, this method returns {@code null};
+    /// otherwise this method returns the result of calling <seealso cref="#addDFAState"/>
+    /// on {@code to} </returns>
+    virtual dfa::DFAState *addDFAEdge(dfa::DFA &dfa, dfa::DFAState *from, ssize_t t, dfa::DFAState *to);
+
+    /// <summary>
+    /// Add state {@code D} to the DFA if it is not already present, and return
+    /// the actual instance stored in the DFA. If a state equivalent to {@code D}
+    /// is already in the DFA, the existing state is returned. Otherwise this
+    /// method returns {@code D} after adding it to the DFA.
+    /// <p/>
+    /// If {@code D} is <seealso cref="#ERROR"/>, this method returns <seealso cref="#ERROR"/> and
+    /// does not change the DFA.
+    /// </summary>
+    /// <param name="dfa"> The dfa </param>
+    /// <param name="D"> The DFA state to add </param>
+    /// <returns> The state stored in the DFA. This will be either the existing
+    /// state if {@code D} is already in the DFA, or {@code D} itself if the
+    /// state was not already present. </returns>
+    virtual dfa::DFAState *addDFAState(dfa::DFA &dfa, dfa::DFAState *D);
+
+    virtual void reportAttemptingFullContext(dfa::DFA &dfa, const antlrcpp::BitSet &conflictingAlts,
+      ATNConfigSet *configs, size_t startIndex, size_t stopIndex);
+
+    virtual void reportContextSensitivity(dfa::DFA &dfa, size_t prediction, ATNConfigSet *configs,
+                                          size_t startIndex, size_t stopIndex);
+
+    /// If context sensitive parsing, we know it's ambiguity not conflict.
+    virtual void reportAmbiguity(dfa::DFA &dfa,
+                                 dfa::DFAState *D, // the DFA state from execATN() that had SLL conflicts
+                                 size_t startIndex, size_t stopIndex,
+                                 bool exact,
+                                 const antlrcpp::BitSet &ambigAlts,
+                                 ATNConfigSet *configs); // configs that LL not SLL considered conflicting
+
+  private:
+    // SLL, LL, or LL + exact ambig detection?
+    PredictionMode _mode;
+
+    static bool getLrLoopSetting();
+    void InitializeInstanceFields();
+  };
+
+} // namespace atn
+} // namespace antlr4
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParserATNSimulatorOptions.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParserATNSimulatorOptions.h
new file mode 100644
index 0000000000..ea31226d25
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ParserATNSimulatorOptions.h
@@ -0,0 +1,50 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#pragma once
+
+#include "atn/PredictionContextMergeCacheOptions.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC ParserATNSimulatorOptions final {
+  public:
+    ParserATNSimulatorOptions& setPredictionContextMergeCacheOptions(
+        PredictionContextMergeCacheOptions predictionContextMergeCacheOptions) {
+      _predictionContextMergeCacheOptions = std::move(predictionContextMergeCacheOptions);
+      return *this;
+    }
+
+    const PredictionContextMergeCacheOptions& getPredictionContextMergeCacheOptions() const {
+      return _predictionContextMergeCacheOptions;
+    }
+
+  private:
+    PredictionContextMergeCacheOptions _predictionContextMergeCacheOptions;
+  };
+
+}  // namespace atn
+}  // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PlusBlockStartState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PlusBlockStartState.h
new file mode 100755
index 0000000000..6f67a8acad
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PlusBlockStartState.h
@@ -0,0 +1,29 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/BlockStartState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// Start of {@code (A|B|...)+} loop. Technically a decision state, but
+  /// we don't use for code generation; somebody might need it, so I'm defining
+  /// it for completeness. In reality, the <seealso cref="PlusLoopbackState"/> node is the
+  /// real decision-making note for {@code A+}.
+  class ANTLR4CPP_PUBLIC PlusBlockStartState final : public BlockStartState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::PLUS_BLOCK_START; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    PlusLoopbackState *loopBackState = nullptr;
+
+    PlusBlockStartState() : BlockStartState(ATNStateType::PLUS_BLOCK_START) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PlusLoopbackState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PlusLoopbackState.h
new file mode 100755
index 0000000000..d83ed7d021
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PlusLoopbackState.h
@@ -0,0 +1,25 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// Decision state for {@code A+} and {@code (A|B)+}. It has two transitions:
+  /// one to the loop back to start of the block and one to exit.
+  class ANTLR4CPP_PUBLIC PlusLoopbackState final : public DecisionState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::PLUS_LOOP_BACK; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    PlusLoopbackState() : DecisionState(ATNStateType::PLUS_LOOP_BACK) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PrecedencePredicateTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PrecedencePredicateTransition.cpp
new file mode 100755
index 0000000000..a0d123fd33
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PrecedencePredicateTransition.cpp
@@ -0,0 +1,23 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/PrecedencePredicateTransition.h"
+
+using namespace antlr4::atn;
+
+PrecedencePredicateTransition::PrecedencePredicateTransition(ATNState *target, int precedence)
+  : Transition(TransitionType::PRECEDENCE, target), _predicate(std::make_shared<SemanticContext::PrecedencePredicate>(precedence)) {}
+
+bool PrecedencePredicateTransition::isEpsilon() const {
+  return true;
+}
+
+bool PrecedencePredicateTransition::matches(size_t /*symbol*/, size_t /*minVocabSymbol*/, size_t /*maxVocabSymbol*/) const {
+  return false;
+}
+
+std::string PrecedencePredicateTransition::toString() const {
+  return "PRECEDENCE " + Transition::toString() + " { precedence: " + std::to_string(getPrecedence()) + " }";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PrecedencePredicateTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PrecedencePredicateTransition.h
new file mode 100755
index 0000000000..1bf83fb721
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PrecedencePredicateTransition.h
@@ -0,0 +1,35 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/Transition.h"
+#include "atn/SemanticContext.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC PrecedencePredicateTransition final : public Transition {
+  public:
+    static bool is(const Transition &transition) { return transition.getTransitionType() == TransitionType::PRECEDENCE; }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    PrecedencePredicateTransition(ATNState *target, int precedence);
+
+    int getPrecedence() const { return _predicate->precedence; }
+
+    bool isEpsilon() const override;
+    bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+    std::string toString() const override;
+
+    const Ref<const SemanticContext::PrecedencePredicate>& getPredicate() const { return _predicate; }
+
+  private:
+    const std::shared_ptr<const SemanticContext::PrecedencePredicate> _predicate;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateEvalInfo.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateEvalInfo.cpp
new file mode 100755
index 0000000000..73ee2a2b97
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateEvalInfo.cpp
@@ -0,0 +1,17 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "SemanticContext.h"
+
+#include "atn/PredicateEvalInfo.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+PredicateEvalInfo::PredicateEvalInfo(size_t decision, TokenStream *input, size_t startIndex, size_t stopIndex,
+  Ref<const SemanticContext> semctx, bool evalResult, size_t predictedAlt, bool fullCtx)
+  : DecisionEventInfo(decision, nullptr, input, startIndex, stopIndex, fullCtx),
+    semctx(std::move(semctx)), predictedAlt(predictedAlt), evalResult(evalResult) {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateEvalInfo.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateEvalInfo.h
new file mode 100755
index 0000000000..f343f541cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateEvalInfo.h
@@ -0,0 +1,62 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionEventInfo.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// This class represents profiling event information for semantic predicate
+  /// evaluations which occur during prediction.
+  /// </summary>
+  /// <seealso cref= ParserATNSimulator#evalSemanticContext
+  ///
+  /// @since 4.3 </seealso>
+  class ANTLR4CPP_PUBLIC PredicateEvalInfo : public DecisionEventInfo {
+  public:
+    /// The semantic context which was evaluated.
+    const Ref<const SemanticContext> semctx;
+
+    /// <summary>
+    /// The alternative number for the decision which is guarded by the semantic
+    /// context <seealso cref="#semctx"/>. Note that other ATN
+    /// configurations may predict the same alternative which are guarded by
+    /// other semantic contexts and/or <seealso cref="SemanticContext#NONE"/>.
+    /// </summary>
+    const size_t predictedAlt;
+
+    /// The result of evaluating the semantic context <seealso cref="#semctx"/>.
+    const bool evalResult;
+
+    /// <summary>
+    /// Constructs a new instance of the <seealso cref="PredicateEvalInfo"/> class with the
+    /// specified detailed predicate evaluation information.
+    /// </summary>
+    /// <param name="decision"> The decision number </param>
+    /// <param name="input"> The input token stream </param>
+    /// <param name="startIndex"> The start index for the current prediction </param>
+    /// <param name="stopIndex"> The index at which the predicate evaluation was
+    /// triggered. Note that the input stream may be reset to other positions for
+    /// the actual evaluation of individual predicates. </param>
+    /// <param name="semctx"> The semantic context which was evaluated </param>
+    /// <param name="evalResult"> The results of evaluating the semantic context </param>
+    /// <param name="predictedAlt"> The alternative number for the decision which is
+    /// guarded by the semantic context {@code semctx}. See <seealso cref="#predictedAlt"/>
+    /// for more information. </param>
+    /// <param name="fullCtx"> {@code true} if the semantic context was
+    /// evaluated during LL prediction; otherwise, {@code false} if the semantic
+    /// context was evaluated during SLL prediction
+    /// </param>
+    /// <seealso cref= ParserATNSimulator#evalSemanticContext(SemanticContext, ParserRuleContext, int, boolean) </seealso>
+    /// <seealso cref= SemanticContext#eval(Recognizer, RuleContext) </seealso>
+    PredicateEvalInfo(size_t decision, TokenStream *input, size_t startIndex, size_t stopIndex,
+                      Ref<const SemanticContext> semctx, bool evalResult, size_t predictedAlt, bool fullCtx);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateTransition.cpp
new file mode 100755
index 0000000000..4ba50730a2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateTransition.cpp
@@ -0,0 +1,24 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/PredicateTransition.h"
+
+using namespace antlr4::atn;
+
+PredicateTransition::PredicateTransition(ATNState *target, size_t ruleIndex, size_t predIndex, bool isCtxDependent)
+    : Transition(TransitionType::PREDICATE, target), _predicate(std::make_shared<SemanticContext::Predicate>(ruleIndex, predIndex, isCtxDependent)) {}
+
+bool PredicateTransition::isEpsilon() const {
+  return true;
+}
+
+bool PredicateTransition::matches(size_t /*symbol*/, size_t /*minVocabSymbol*/, size_t /*maxVocabSymbol*/) const {
+  return false;
+}
+
+std::string PredicateTransition::toString() const {
+  return "PREDICATE " + Transition::toString() + " { ruleIndex: " + std::to_string(getRuleIndex()) +
+    ", predIndex: " + std::to_string(getPredIndex()) + ", isCtxDependent: " + std::to_string(isCtxDependent()) + " }";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateTransition.h
new file mode 100755
index 0000000000..e889b1c198
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredicateTransition.h
@@ -0,0 +1,50 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/Transition.h"
+#include "atn/SemanticContext.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// TODO: this is old comment:
+  ///  A tree of semantic predicates from the grammar AST if label==SEMPRED.
+  ///  In the ATN, labels will always be exactly one predicate, but the DFA
+  ///  may have to combine a bunch of them as it collects predicates from
+  ///  multiple ATN configurations into a single DFA state.
+  class ANTLR4CPP_PUBLIC PredicateTransition final : public Transition {
+  public:
+    static bool is(const Transition &transition) { return transition.getTransitionType() == TransitionType::PREDICATE; }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    PredicateTransition(ATNState *target, size_t ruleIndex, size_t predIndex, bool isCtxDependent);
+
+    size_t getRuleIndex() const {
+      return _predicate->ruleIndex;
+    }
+
+    size_t getPredIndex() const {
+      return _predicate->predIndex;
+    }
+
+    bool isCtxDependent() const {
+      return _predicate->isCtxDependent;
+    }
+
+    bool isEpsilon() const override;
+    bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+    std::string toString() const override;
+
+    const Ref<const SemanticContext::Predicate>& getPredicate() const { return _predicate; }
+
+  private:
+    const std::shared_ptr<const SemanticContext::Predicate> _predicate;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContext.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContext.cpp
new file mode 100755
index 0000000000..b976de8f1f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContext.cpp
@@ -0,0 +1,601 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/SingletonPredictionContext.h"
+#include "misc/MurmurHash.h"
+#include "atn/ArrayPredictionContext.h"
+#include "atn/PredictionContextCache.h"
+#include "atn/PredictionContextMergeCache.h"
+#include "RuleContext.h"
+#include "ParserRuleContext.h"
+#include "atn/RuleTransition.h"
+#include "support/Arrays.h"
+#include "support/CPPUtils.h"
+#include "support/Casts.h"
+
+#include "atn/PredictionContext.h"
+
+using namespace antlr4;
+using namespace antlr4::misc;
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+namespace {
+
+  void combineCommonParents(std::vector<Ref<const PredictionContext>> &parents) {
+    std::unordered_set<Ref<const PredictionContext>> uniqueParents;
+    uniqueParents.reserve(parents.size());
+    for (const auto &parent : parents) {
+      uniqueParents.insert(parent);
+    }
+    for (auto &parent : parents) {
+      parent = *uniqueParents.find(parent);
+    }
+  }
+
+  Ref<const PredictionContext> getCachedContextImpl(const Ref<const PredictionContext> &context,
+                                                    PredictionContextCache &contextCache,
+                                                    std::unordered_map<Ref<const PredictionContext>,
+                                                    Ref<const PredictionContext>> &visited) {
+    if (context->isEmpty()) {
+      return context;
+    }
+
+    {
+      auto iterator = visited.find(context);
+      if (iterator != visited.end()) {
+        return iterator->second; // Not necessarly the same as context.
+      }
+    }
+
+    auto cached = contextCache.get(context);
+    if (cached) {
+      visited[context] = cached;
+      return cached;
+    }
+
+    bool changed = false;
+
+    std::vector<Ref<const PredictionContext>> parents(context->size());
+    for (size_t i = 0; i < parents.size(); i++) {
+      auto parent = getCachedContextImpl(context->getParent(i), contextCache, visited);
+      if (changed || parent != context->getParent(i)) {
+        if (!changed) {
+          parents.clear();
+          for (size_t j = 0; j < context->size(); j++) {
+            parents.push_back(context->getParent(j));
+          }
+
+          changed = true;
+        }
+
+        parents[i] = std::move(parent);
+      }
+    }
+
+    if (!changed) {
+      visited[context] = context;
+      contextCache.put(context);
+      return context;
+    }
+
+    Ref<const PredictionContext> updated;
+    if (parents.empty()) {
+      updated = PredictionContext::EMPTY;
+    } else if (parents.size() == 1) {
+      updated = SingletonPredictionContext::create(std::move(parents[0]), context->getReturnState(0));
+      contextCache.put(updated);
+    } else {
+      updated = std::make_shared<ArrayPredictionContext>(std::move(parents), downCast<const ArrayPredictionContext*>(context.get())->returnStates);
+      contextCache.put(updated);
+    }
+
+    visited[updated] = updated;
+    visited[context] = updated;
+
+    return updated;
+  }
+
+  void getAllContextNodesImpl(const Ref<const PredictionContext> &context,
+                              std::vector<Ref<const PredictionContext>> &nodes,
+                              std::unordered_set<const PredictionContext*> &visited) {
+
+    if (visited.find(context.get()) != visited.end()) {
+      return; // Already done.
+    }
+
+    visited.insert(context.get());
+    nodes.push_back(context);
+
+    for (size_t i = 0; i < context->size(); i++) {
+      getAllContextNodesImpl(context->getParent(i), nodes, visited);
+    }
+  }
+
+  size_t insertOrAssignNodeId(std::unordered_map<const PredictionContext*, size_t> &nodeIds, size_t &nodeId, const PredictionContext *node) {
+    auto existing = nodeIds.find(node);
+    if (existing != nodeIds.end()) {
+      return existing->second;
+    }
+    return nodeIds.insert({node, nodeId++}).first->second;
+  }
+
+}
+
+const Ref<const PredictionContext> PredictionContext::EMPTY = std::make_shared<SingletonPredictionContext>(nullptr, PredictionContext::EMPTY_RETURN_STATE);
+
+//----------------- PredictionContext ----------------------------------------------------------------------------------
+
+PredictionContext::PredictionContext(PredictionContextType contextType) : _contextType(contextType), _hashCode(0) {}
+
+PredictionContext::PredictionContext(PredictionContext&& other) : _contextType(other._contextType), _hashCode(other._hashCode.exchange(0, std::memory_order_relaxed)) {}
+
+Ref<const PredictionContext> PredictionContext::fromRuleContext(const ATN &atn, RuleContext *outerContext) {
+  if (outerContext == nullptr) {
+    return PredictionContext::EMPTY;
+  }
+
+  // if we are in RuleContext of start rule, s, then PredictionContext
+  // is EMPTY. Nobody called us. (if we are empty, return empty)
+  if (outerContext->parent == nullptr || outerContext == &ParserRuleContext::EMPTY) {
+    return PredictionContext::EMPTY;
+  }
+
+  // If we have a parent, convert it to a PredictionContext graph
+  auto parent = PredictionContext::fromRuleContext(atn, RuleContext::is(outerContext->parent) ? downCast<RuleContext*>(outerContext->parent) : nullptr);
+  const auto *transition = downCast<const RuleTransition*>(atn.states[outerContext->invokingState]->transitions[0].get());
+  return SingletonPredictionContext::create(std::move(parent), transition->followState->stateNumber);
+}
+
+bool PredictionContext::hasEmptyPath() const {
+  // since EMPTY_RETURN_STATE can only appear in the last position, we check last one
+  return getReturnState(size() - 1) == EMPTY_RETURN_STATE;
+}
+
+size_t PredictionContext::hashCode() const {
+  auto hash = cachedHashCode();
+  if (hash == 0) {
+    hash = hashCodeImpl();
+    if (hash == 0) {
+      hash = std::numeric_limits<size_t>::max();
+    }
+    _hashCode.store(hash, std::memory_order_relaxed);
+  }
+  return hash;
+}
+
+Ref<const PredictionContext> PredictionContext::merge(Ref<const PredictionContext> a, Ref<const PredictionContext> b,
+                                                      bool rootIsWildcard, PredictionContextMergeCache *mergeCache) {
+  assert(a && b);
+
+  // share same graph if both same
+  if (a == b || *a == *b) {
+    return a;
+  }
+
+  const auto aType = a->getContextType();
+  const auto bType = b->getContextType();
+
+  if (aType == PredictionContextType::SINGLETON && bType == PredictionContextType::SINGLETON) {
+    return mergeSingletons(std::static_pointer_cast<const SingletonPredictionContext>(std::move(a)),
+                           std::static_pointer_cast<const SingletonPredictionContext>(std::move(b)), rootIsWildcard, mergeCache);
+  }
+
+  // At least one of a or b is array.
+  // If one is $ and rootIsWildcard, return $ as * wildcard.
+  if (rootIsWildcard) {
+    if (a == PredictionContext::EMPTY) {
+      return a;
+    }
+    if (b == PredictionContext::EMPTY) {
+      return b;
+    }
+  }
+
+  // convert singleton so both are arrays to normalize
+  Ref<const ArrayPredictionContext> left;
+  if (aType == PredictionContextType::SINGLETON) {
+    left = std::make_shared<ArrayPredictionContext>(downCast<const SingletonPredictionContext&>(*a));
+  } else {
+    left = std::static_pointer_cast<const ArrayPredictionContext>(std::move(a));
+  }
+  Ref<const ArrayPredictionContext> right;
+  if (bType == PredictionContextType::SINGLETON) {
+    right = std::make_shared<ArrayPredictionContext>(downCast<const SingletonPredictionContext&>(*b));
+  } else {
+    right = std::static_pointer_cast<const ArrayPredictionContext>(std::move(b));
+  }
+  return mergeArrays(std::move(left), std::move(right), rootIsWildcard, mergeCache);
+}
+
+Ref<const PredictionContext> PredictionContext::mergeSingletons(Ref<const SingletonPredictionContext> a, Ref<const SingletonPredictionContext> b,
+                                                                bool rootIsWildcard, PredictionContextMergeCache *mergeCache) {
+
+  if (mergeCache) {
+    auto existing = mergeCache->get(a, b);
+    if (existing) {
+      return existing;
+    }
+    existing = mergeCache->get(b, a);
+    if (existing) {
+      return existing;
+    }
+  }
+
+  auto rootMerge = mergeRoot(a, b, rootIsWildcard);
+  if (rootMerge) {
+    if (mergeCache) {
+      return mergeCache->put(a, b, std::move(rootMerge));
+    }
+    return rootMerge;
+  }
+
+  const auto& parentA = a->parent;
+  const auto& parentB = b->parent;
+  if (a->returnState == b->returnState) { // a == b
+    auto parent = merge(parentA, parentB, rootIsWildcard, mergeCache);
+
+    // If parent is same as existing a or b parent or reduced to a parent, return it.
+    if (parent == parentA) { // ax + bx = ax, if a=b
+      return a;
+    }
+    if (parent == parentB) { // ax + bx = bx, if a=b
+      return b;
+    }
+
+    // else: ax + ay = a'[x,y]
+    // merge parents x and y, giving array node with x,y then remainders
+    // of those graphs.  dup a, a' points at merged array
+    // new joined parent so create new singleton pointing to it, a'
+    auto c = SingletonPredictionContext::create(std::move(parent), a->returnState);
+    if (mergeCache) {
+      return mergeCache->put(a, b, std::move(c));
+    }
+    return c;
+  }
+  // a != b payloads differ
+  // see if we can collapse parents due to $+x parents if local ctx
+  Ref<const PredictionContext> singleParent;
+  if (a == b || (*parentA == *parentB)) { // ax + bx = [a,b]x
+    singleParent = parentA;
+  }
+  if (singleParent) { // parents are same, sort payloads and use same parent
+    std::vector<size_t> payloads = { a->returnState, b->returnState };
+    if (a->returnState > b->returnState) {
+      payloads[0] = b->returnState;
+      payloads[1] = a->returnState;
+    }
+    std::vector<Ref<const PredictionContext>> parents = { singleParent, singleParent };
+    auto c = std::make_shared<ArrayPredictionContext>(std::move(parents), std::move(payloads));
+    if (mergeCache) {
+      return mergeCache->put(a, b, std::move(c));
+    }
+    return c;
+  }
+
+  // parents differ and can't merge them. Just pack together
+  // into array; can't merge.
+  // ax + by = [ax,by]
+  if (a->returnState > b->returnState) { // sort by payload
+    std::vector<size_t> payloads = { b->returnState, a->returnState };
+    std::vector<Ref<const PredictionContext>> parents = { b->parent, a->parent };
+    auto c = std::make_shared<ArrayPredictionContext>(std::move(parents), std::move(payloads));
+    if (mergeCache) {
+      return mergeCache->put(a, b, std::move(c));
+    }
+    return c;
+  }
+  std::vector<size_t> payloads = {a->returnState, b->returnState};
+  std::vector<Ref<const PredictionContext>> parents = { a->parent, b->parent };
+  auto c = std::make_shared<ArrayPredictionContext>(std::move(parents), std::move(payloads));
+  if (mergeCache) {
+    return mergeCache->put(a, b, std::move(c));
+  }
+  return c;
+}
+
+Ref<const PredictionContext> PredictionContext::mergeRoot(Ref<const SingletonPredictionContext> a, Ref<const SingletonPredictionContext> b,
+                                                          bool rootIsWildcard) {
+  if (rootIsWildcard) {
+    if (a == EMPTY) { // * + b = *
+      return EMPTY;
+    }
+    if (b == EMPTY) { // a + * = *
+      return EMPTY;
+    }
+  } else {
+    if (a == EMPTY && b == EMPTY) { // $ + $ = $
+      return EMPTY;
+    }
+    if (a == EMPTY) { // $ + x = [$,x]
+      std::vector<size_t> payloads = { b->returnState, EMPTY_RETURN_STATE };
+      std::vector<Ref<const PredictionContext>> parents = { b->parent, nullptr };
+      return std::make_shared<ArrayPredictionContext>(std::move(parents), std::move(payloads));
+    }
+    if (b == EMPTY) { // x + $ = [$,x] ($ is always first if present)
+      std::vector<size_t> payloads = { a->returnState, EMPTY_RETURN_STATE };
+      std::vector<Ref<const PredictionContext>> parents = { a->parent, nullptr };
+      return std::make_shared<ArrayPredictionContext>(std::move(parents), std::move(payloads));
+    }
+  }
+  return nullptr;
+}
+
+Ref<const PredictionContext> PredictionContext::mergeArrays(Ref<const ArrayPredictionContext> a, Ref<const ArrayPredictionContext> b,
+                                                            bool rootIsWildcard, PredictionContextMergeCache *mergeCache) {
+  if (mergeCache) {
+    auto existing = mergeCache->get(a, b);
+    if (existing) {
+#if TRACE_ATN_SIM == 1
+      std::cout << "mergeArrays a=" << a->toString() << ",b=" << b->toString() << " -> previous" << std::endl;
+#endif
+      return existing;
+    }
+    existing = mergeCache->get(b, a);
+    if (existing) {
+#if TRACE_ATN_SIM == 1
+        std::cout << "mergeArrays a=" << a->toString() << ",b=" << b->toString() << " -> previous" << std::endl;
+#endif
+      return existing;
+    }
+  }
+
+  // merge sorted payloads a + b => M
+  size_t i = 0; // walks a
+  size_t j = 0; // walks b
+  size_t k = 0; // walks target M array
+
+  std::vector<size_t> mergedReturnStates(a->returnStates.size() + b->returnStates.size());
+  std::vector<Ref<const PredictionContext>> mergedParents(a->returnStates.size() + b->returnStates.size());
+
+  // walk and merge to yield mergedParents, mergedReturnStates
+  while (i < a->returnStates.size() && j < b->returnStates.size()) {
+    const auto& parentA = a->parents[i];
+    const auto& parentB = b->parents[j];
+    if (a->returnStates[i] == b->returnStates[j]) {
+      // same payload (stack tops are equal), must yield merged singleton
+      size_t payload = a->returnStates[i];
+      // $+$ = $
+      bool both$ = payload == EMPTY_RETURN_STATE && !parentA && !parentB;
+      bool ax_ax = (parentA && parentB) && *parentA == *parentB; // ax+ax -> ax
+      if (both$ || ax_ax) {
+        mergedParents[k] = parentA; // choose left
+        mergedReturnStates[k] = payload;
+      } else { // ax+ay -> a'[x,y]
+        mergedParents[k] = merge(parentA, parentB, rootIsWildcard, mergeCache);
+        mergedReturnStates[k] = payload;
+      }
+      i++; // hop over left one as usual
+      j++; // but also skip one in right side since we merge
+    } else if (a->returnStates[i] < b->returnStates[j]) { // copy a[i] to M
+      mergedParents[k] = parentA;
+      mergedReturnStates[k] = a->returnStates[i];
+      i++;
+    } else { // b > a, copy b[j] to M
+      mergedParents[k] = parentB;
+      mergedReturnStates[k] = b->returnStates[j];
+      j++;
+    }
+    k++;
+  }
+
+  // copy over any payloads remaining in either array
+  if (i < a->returnStates.size()) {
+    for (auto p = i; p < a->returnStates.size(); p++) {
+      mergedParents[k] = a->parents[p];
+      mergedReturnStates[k] = a->returnStates[p];
+      k++;
+    }
+  } else {
+    for (auto p = j; p < b->returnStates.size(); p++) {
+      mergedParents[k] = b->parents[p];
+      mergedReturnStates[k] = b->returnStates[p];
+      k++;
+    }
+  }
+
+  // trim merged if we combined a few that had same stack tops
+  if (k < mergedParents.size()) { // write index < last position; trim
+    if (k == 1) { // for just one merged element, return singleton top
+      auto c = SingletonPredictionContext::create(std::move(mergedParents[0]), mergedReturnStates[0]);
+      if (mergeCache) {
+        return mergeCache->put(a, b, std::move(c));
+      }
+      return c;
+    }
+    mergedParents.resize(k);
+    mergedReturnStates.resize(k);
+  }
+
+  ArrayPredictionContext m(std::move(mergedParents), std::move(mergedReturnStates));
+
+  // if we created same array as a or b, return that instead
+  // TODO: track whether this is possible above during merge sort for speed
+  if (m == *a) {
+    if (mergeCache) {
+#if TRACE_ATN_SIM == 1
+      std::cout << "mergeArrays a=" << a->toString() << ",b=" << b->toString() << " -> a" << std::endl;
+#endif
+      return mergeCache->put(a, b, a);
+    }
+#if TRACE_ATN_SIM == 1
+    std::cout << "mergeArrays a=" << a->toString() << ",b=" << b->toString() << " -> a" << std::endl;
+#endif
+    return a;
+  }
+  if (m == *b) {
+    if (mergeCache) {
+#if TRACE_ATN_SIM == 1
+        std::cout << "mergeArrays a=" << a->toString() << ",b=" << b->toString() << " -> b" << std::endl;
+#endif
+      return mergeCache->put(a, b, b);
+    }
+#if TRACE_ATN_SIM == 1
+      std::cout << "mergeArrays a=" << a->toString() << ",b=" << b->toString() << " -> b" << std::endl;
+#endif
+    return b;
+  }
+
+  combineCommonParents(m.parents);
+  auto c = std::make_shared<ArrayPredictionContext>(std::move(m));
+
+#if TRACE_ATN_SIM == 1
+    std::cout << "mergeArrays a=" << a->toString() << ",b=" << b->toString() << " -> " << c->toString() << std::endl;
+#endif
+
+  if (mergeCache) {
+    return mergeCache->put(a, b, std::move(c));
+  }
+  return c;
+}
+
+std::string PredictionContext::toDOTString(const Ref<const PredictionContext> &context) {
+  if (context == nullptr) {
+    return "";
+  }
+
+  std::stringstream ss;
+  ss << "digraph G {\n" << "rankdir=LR;\n";
+
+  std::vector<Ref<const PredictionContext>> nodes = getAllContextNodes(context);
+  std::unordered_map<const PredictionContext*, size_t> nodeIds;
+  size_t nodeId = 0;
+
+  for (const auto &current : nodes) {
+    if (current->getContextType() == PredictionContextType::SINGLETON) {
+      std::string s = std::to_string(insertOrAssignNodeId(nodeIds, nodeId, current.get()));
+      ss << "  s" << s;
+      std::string returnState = std::to_string(current->getReturnState(0));
+      if (current == PredictionContext::EMPTY) {
+        returnState = "$";
+      }
+      ss << " [label=\"" << returnState << "\"];\n";
+      continue;
+    }
+    Ref<const ArrayPredictionContext> arr = std::static_pointer_cast<const ArrayPredictionContext>(current);
+    ss << "  s" << insertOrAssignNodeId(nodeIds, nodeId, arr.get()) << " [shape=box, label=\"" << "[";
+    bool first = true;
+    for (auto inv : arr->returnStates) {
+      if (!first) {
+       ss << ", ";
+      }
+      if (inv == EMPTY_RETURN_STATE) {
+        ss << "$";
+      } else {
+        ss << inv;
+      }
+      first = false;
+    }
+    ss << "]";
+    ss << "\"];\n";
+  }
+
+  for (const auto &current : nodes) {
+    if (current == EMPTY) {
+      continue;
+    }
+    for (size_t i = 0; i < current->size(); i++) {
+      if (!current->getParent(i)) {
+        continue;
+      }
+      ss << "  s" << insertOrAssignNodeId(nodeIds, nodeId, current.get()) << "->" << "s" << insertOrAssignNodeId(nodeIds, nodeId, current->getParent(i).get());
+      if (current->size() > 1) {
+        ss << " [label=\"parent[" << i << "]\"];\n";
+      } else {
+        ss << ";\n";
+      }
+    }
+  }
+
+  ss << "}\n";
+  return ss.str();
+}
+
+// The "visited" map is just a temporary structure to control the retrieval process (which is recursive).
+Ref<const PredictionContext> PredictionContext::getCachedContext(const Ref<const PredictionContext> &context,
+                                                                 PredictionContextCache &contextCache) {
+  std::unordered_map<Ref<const PredictionContext>, Ref<const PredictionContext>> visited;
+  return getCachedContextImpl(context, contextCache, visited);
+}
+
+std::vector<Ref<const PredictionContext>> PredictionContext::getAllContextNodes(const Ref<const PredictionContext> &context) {
+  std::vector<Ref<const PredictionContext>> nodes;
+  std::unordered_set<const PredictionContext*> visited;
+  getAllContextNodesImpl(context, nodes, visited);
+  return nodes;
+}
+
+std::vector<std::string> PredictionContext::toStrings(Recognizer *recognizer, int currentState) const {
+  return toStrings(recognizer, EMPTY, currentState);
+}
+
+std::vector<std::string> PredictionContext::toStrings(Recognizer *recognizer, const Ref<const PredictionContext> &stop, int currentState) const {
+
+  std::vector<std::string> result;
+
+  for (size_t perm = 0; ; perm++) {
+    size_t offset = 0;
+    bool last = true;
+    const PredictionContext *p = this;
+    size_t stateNumber = currentState;
+
+    std::stringstream ss;
+    ss << "[";
+    bool outerContinue = false;
+    while (!p->isEmpty() && p != stop.get()) {
+      size_t index = 0;
+      if (p->size() > 0) {
+        size_t bits = 1;
+        while ((1ULL << bits) < p->size()) {
+          bits++;
+        }
+
+        size_t mask = (1 << bits) - 1;
+        index = (perm >> offset) & mask;
+        last &= index >= p->size() - 1;
+        if (index >= p->size()) {
+          outerContinue = true;
+          break;
+        }
+        offset += bits;
+      }
+
+      if (recognizer != nullptr) {
+        if (ss.tellp() > 1) {
+          // first char is '[', if more than that this isn't the first rule
+          ss << ' ';
+        }
+
+        const ATN &atn = recognizer->getATN();
+        ATNState *s = atn.states[stateNumber];
+        std::string ruleName = recognizer->getRuleNames()[s->ruleIndex];
+        ss << ruleName;
+      } else if (p->getReturnState(index) != EMPTY_RETURN_STATE) {
+        if (!p->isEmpty()) {
+          if (ss.tellp() > 1) {
+            // first char is '[', if more than that this isn't the first rule
+            ss << ' ';
+          }
+
+          ss << p->getReturnState(index);
+        }
+      }
+      stateNumber = p->getReturnState(index);
+      p = p->getParent(index).get();
+    }
+
+    if (outerContinue)
+      continue;
+
+    ss << "]";
+    result.push_back(ss.str());
+
+    if (last) {
+      break;
+    }
+  }
+
+  return result;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContext.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContext.h
new file mode 100755
index 0000000000..23b68c30d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContext.h
@@ -0,0 +1,225 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <atomic>
+
+#include "Recognizer.h"
+#include "atn/ATN.h"
+#include "atn/ATNState.h"
+#include "atn/PredictionContextType.h"
+
+namespace antlr4 {
+
+  class RuleContext;
+
+namespace atn {
+
+  class ATN;
+  class ArrayPredictionContext;
+  class SingletonPredictionContext;
+  class PredictionContextCache;
+  class PredictionContextMergeCache;
+
+  class ANTLR4CPP_PUBLIC PredictionContext {
+  public:
+    /// Represents $ in local context prediction, which means wildcard.
+    /// *+x = *.
+    static const Ref<const PredictionContext> EMPTY;
+
+    /// Represents $ in an array in full context mode, when $
+    /// doesn't mean wildcard: $ + x = [$,x]. Here,
+    /// $ = EMPTY_RETURN_STATE.
+    // ml: originally Integer.MAX_VALUE, which would be -1 for us, but this is already used in places where
+    //     -1 is converted to unsigned, so we use a different value here. Any value does the job provided it doesn't
+    //     conflict with real return states.
+    static constexpr size_t EMPTY_RETURN_STATE = std::numeric_limits<size_t>::max() - 9;
+
+    // dispatch
+    static Ref<const PredictionContext> merge(Ref<const PredictionContext> a,
+                                              Ref<const PredictionContext> b,
+                                              bool rootIsWildcard,
+                                              PredictionContextMergeCache *mergeCache);
+
+    /// <summary>
+    /// Merge two <seealso cref="SingletonPredictionContext"/> instances.
+    ///
+    /// <p/>
+    ///
+    /// Stack tops equal, parents merge is same; return left graph.<br/>
+    /// <embed src="images/SingletonMerge_SameRootSamePar.svg" type="image/svg+xml"/>
+    ///
+    /// <p/>
+    ///
+    /// Same stack top, parents differ; merge parents giving array node, then
+    /// remainders of those graphs. A new root node is created to point to the
+    /// merged parents.<br/>
+    /// <embed src="images/SingletonMerge_SameRootDiffPar.svg" type="image/svg+xml"/>
+    ///
+    /// <p/>
+    ///
+    /// Different stack tops pointing to same parent. Make array node for the
+    /// root where both element in the root point to the same (original)
+    /// parent.<br/>
+    /// <embed src="images/SingletonMerge_DiffRootSamePar.svg" type="image/svg+xml"/>
+    ///
+    /// <p/>
+    ///
+    /// Different stack tops pointing to different parents. Make array node for
+    /// the root where each element points to the corresponding original
+    /// parent.<br/>
+    /// <embed src="images/SingletonMerge_DiffRootDiffPar.svg" type="image/svg+xml"/>
+    /// </summary>
+    /// <param name="a"> the first <seealso cref="SingletonPredictionContext"/> </param>
+    /// <param name="b"> the second <seealso cref="SingletonPredictionContext"/> </param>
+    /// <param name="rootIsWildcard"> {@code true} if this is a local-context merge,
+    /// otherwise false to indicate a full-context merge </param>
+    /// <param name="mergeCache"> </param>
+    static Ref<const PredictionContext> mergeSingletons(Ref<const SingletonPredictionContext> a,
+                                                        Ref<const SingletonPredictionContext> b,
+                                                        bool rootIsWildcard,
+                                                        PredictionContextMergeCache *mergeCache);
+
+    /**
+     * Handle case where at least one of {@code a} or {@code b} is
+     * {@link #EMPTY}. In the following diagrams, the symbol {@code $} is used
+     * to represent {@link #EMPTY}.
+     *
+     * <h2>Local-Context Merges</h2>
+     *
+     * <p>These local-context merge operations are used when {@code rootIsWildcard}
+     * is true.</p>
+     *
+     * <p>{@link #EMPTY} is superset of any graph; return {@link #EMPTY}.<br>
+     * <embed src="images/LocalMerge_EmptyRoot.svg" type="image/svg+xml"/></p>
+     *
+     * <p>{@link #EMPTY} and anything is {@code #EMPTY}, so merged parent is
+     * {@code #EMPTY}; return left graph.<br>
+     * <embed src="images/LocalMerge_EmptyParent.svg" type="image/svg+xml"/></p>
+     *
+     * <p>Special case of last merge if local context.<br>
+     * <embed src="images/LocalMerge_DiffRoots.svg" type="image/svg+xml"/></p>
+     *
+     * <h2>Full-Context Merges</h2>
+     *
+     * <p>These full-context merge operations are used when {@code rootIsWildcard}
+     * is false.</p>
+     *
+     * <p><embed src="images/FullMerge_EmptyRoots.svg" type="image/svg+xml"/></p>
+     *
+     * <p>Must keep all contexts; {@link #EMPTY} in array is a special value (and
+     * null parent).<br>
+     * <embed src="images/FullMerge_EmptyRoot.svg" type="image/svg+xml"/></p>
+     *
+     * <p><embed src="images/FullMerge_SameRoot.svg" type="image/svg+xml"/></p>
+     *
+     * @param a the first {@link SingletonPredictionContext}
+     * @param b the second {@link SingletonPredictionContext}
+     * @param rootIsWildcard {@code true} if this is a local-context merge,
+     * otherwise false to indicate a full-context merge
+     */
+    static Ref<const PredictionContext> mergeRoot(Ref<const SingletonPredictionContext> a,
+                                                  Ref<const SingletonPredictionContext> b,
+                                                  bool rootIsWildcard);
+
+    /**
+     * Merge two {@link ArrayPredictionContext} instances.
+     *
+     * <p>Different tops, different parents.<br>
+     * <embed src="images/ArrayMerge_DiffTopDiffPar.svg" type="image/svg+xml"/></p>
+     *
+     * <p>Shared top, same parents.<br>
+     * <embed src="images/ArrayMerge_ShareTopSamePar.svg" type="image/svg+xml"/></p>
+     *
+     * <p>Shared top, different parents.<br>
+     * <embed src="images/ArrayMerge_ShareTopDiffPar.svg" type="image/svg+xml"/></p>
+     *
+     * <p>Shared top, all shared parents.<br>
+     * <embed src="images/ArrayMerge_ShareTopSharePar.svg" type="image/svg+xml"/></p>
+     *
+     * <p>Equal tops, merge parents and reduce top to
+     * {@link SingletonPredictionContext}.<br>
+     * <embed src="images/ArrayMerge_EqualTop.svg" type="image/svg+xml"/></p>
+     */
+    static Ref<const PredictionContext> mergeArrays(Ref<const ArrayPredictionContext> a,
+                                                    Ref<const ArrayPredictionContext> b,
+                                                    bool rootIsWildcard,
+                                                    PredictionContextMergeCache *mergeCache);
+
+    static std::string toDOTString(const Ref<const PredictionContext> &context);
+
+    static Ref<const PredictionContext> getCachedContext(const Ref<const PredictionContext> &context,
+                                                         PredictionContextCache &contextCache);
+
+    static std::vector<Ref<const PredictionContext>> getAllContextNodes(const Ref<const PredictionContext> &context);
+
+    /// Convert a RuleContext tree to a PredictionContext graph.
+    /// Return EMPTY if outerContext is empty.
+    static Ref<const PredictionContext> fromRuleContext(const ATN &atn, RuleContext *outerContext);
+
+    PredictionContext(const PredictionContext&) = delete;
+
+    virtual ~PredictionContext() = default;
+
+    PredictionContext& operator=(const PredictionContext&) = delete;
+    PredictionContext& operator=(PredictionContext&&) = delete;
+
+    PredictionContextType getContextType() const { return _contextType; }
+
+    virtual size_t size() const = 0;
+    virtual const Ref<const PredictionContext>& getParent(size_t index) const = 0;
+    virtual size_t getReturnState(size_t index) const = 0;
+
+    /// This means only the EMPTY (wildcard? not sure) context is in set.
+    virtual bool isEmpty() const = 0;
+    bool hasEmptyPath() const;
+
+    size_t hashCode() const;
+
+    virtual bool equals(const PredictionContext &other) const = 0;
+
+    virtual std::string toString() const = 0;
+
+    std::vector<std::string> toStrings(Recognizer *recognizer, int currentState) const;
+    std::vector<std::string> toStrings(Recognizer *recognizer,
+                                       const Ref<const PredictionContext> &stop,
+                                       int currentState) const;
+
+  protected:
+    explicit PredictionContext(PredictionContextType contextType);
+
+    PredictionContext(PredictionContext&& other);
+
+    virtual size_t hashCodeImpl() const = 0;
+
+    size_t cachedHashCode() const { return _hashCode.load(std::memory_order_relaxed); }
+
+  private:
+    const PredictionContextType _contextType;
+    mutable std::atomic<size_t> _hashCode;
+  };
+
+  inline bool operator==(const PredictionContext &lhs, const PredictionContext &rhs) {
+    return lhs.equals(rhs);
+  }
+
+  inline bool operator!=(const PredictionContext &lhs, const PredictionContext &rhs) {
+    return !operator==(lhs, rhs);
+  }
+
+}  // namespace atn
+}  // namespace antlr4
+
+namespace std {
+
+  template <>
+  struct hash<::antlr4::atn::PredictionContext> {
+    size_t operator()(const ::antlr4::atn::PredictionContext &predictionContext) const {
+      return predictionContext.hashCode();
+    }
+  };
+
+}  // namespace std
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextCache.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextCache.cpp
new file mode 100644
index 0000000000..031a35cbf7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextCache.cpp
@@ -0,0 +1,56 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#include "atn/PredictionContextCache.h"
+
+using namespace antlr4::atn;
+
+void PredictionContextCache::put(const Ref<const PredictionContext> &value) {
+  assert(value);
+
+  _data.insert(value);
+}
+
+Ref<const PredictionContext> PredictionContextCache::get(
+    const Ref<const PredictionContext> &value) const {
+  assert(value);
+
+  auto iterator = _data.find(value);
+  if (iterator == _data.end()) {
+    return nullptr;
+  }
+  return *iterator;
+}
+
+size_t PredictionContextCache::PredictionContextHasher::operator()(
+    const Ref<const PredictionContext> &predictionContext) const {
+  return predictionContext->hashCode();
+}
+
+bool PredictionContextCache::PredictionContextComparer::operator()(
+    const Ref<const PredictionContext> &lhs,
+    const Ref<const PredictionContext> &rhs) const {
+  return *lhs == *rhs;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextCache.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextCache.h
new file mode 100644
index 0000000000..78c8210d97
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextCache.h
@@ -0,0 +1,63 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#pragma once
+
+#include "atn/PredictionContext.h"
+#include "FlatHashSet.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC PredictionContextCache final {
+  public:
+    PredictionContextCache() = default;
+
+    PredictionContextCache(const PredictionContextCache&) = delete;
+    PredictionContextCache(PredictionContextCache&&) = delete;
+
+    PredictionContextCache& operator=(const PredictionContextCache&) = delete;
+    PredictionContextCache& operator=(PredictionContextCache&&) = delete;
+
+    void put(const Ref<const PredictionContext> &value);
+
+    Ref<const PredictionContext> get(const Ref<const PredictionContext> &value) const;
+
+  private:
+    struct ANTLR4CPP_PUBLIC PredictionContextHasher final {
+      size_t operator()(const Ref<const PredictionContext> &predictionContext) const;
+    };
+
+    struct ANTLR4CPP_PUBLIC PredictionContextComparer final {
+      bool operator()(const Ref<const PredictionContext> &lhs,
+                      const Ref<const PredictionContext> &rhs) const;
+    };
+
+    FlatHashSet<Ref<const PredictionContext>,
+                PredictionContextHasher, PredictionContextComparer> _data;
+  };
+
+}  // namespace atn
+}  // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextMergeCache.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextMergeCache.cpp
new file mode 100644
index 0000000000..7160b59998
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextMergeCache.cpp
@@ -0,0 +1,167 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#include "atn/PredictionContextMergeCache.h"
+
+#include "misc/MurmurHash.h"
+
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+
+PredictionContextMergeCache::PredictionContextMergeCache(
+    const PredictionContextMergeCacheOptions &options) : _options(options) {}
+
+Ref<const PredictionContext> PredictionContextMergeCache::put(
+    const Ref<const PredictionContext> &key1,
+    const Ref<const PredictionContext> &key2,
+    Ref<const PredictionContext> value) {
+  assert(key1);
+  assert(key2);
+
+  if (getOptions().getMaxSize() == 0) {
+    // Cache is effectively disabled.
+    return value;
+  }
+
+  auto [existing, inserted] = _entries.try_emplace(std::make_pair(key1.get(), key2.get()));
+  if (inserted) {
+    try {
+      existing->second.reset(new Entry());
+    } catch (...) {
+      _entries.erase(existing);
+      throw;
+    }
+    existing->second->key = std::make_pair(key1, key2);
+    existing->second->value = std::move(value);
+    pushToFront(existing->second.get());
+  } else {
+    if (existing->second->value != value) {
+      existing->second->value = std::move(value);
+    }
+    moveToFront(existing->second.get());
+  }
+  compact(existing->second.get());
+  return existing->second->value;
+}
+
+Ref<const PredictionContext> PredictionContextMergeCache::get(
+    const Ref<const PredictionContext> &key1,
+    const Ref<const PredictionContext> &key2) const {
+  assert(key1);
+  assert(key2);
+
+  if (getOptions().getMaxSize() == 0) {
+    // Cache is effectively disabled.
+    return nullptr;
+  }
+
+  auto iterator = _entries.find(std::make_pair(key1.get(), key2.get()));
+  if (iterator == _entries.end()) {
+    return nullptr;
+  }
+  moveToFront(iterator->second.get());
+  return iterator->second->value;
+}
+
+void PredictionContextMergeCache::clear() {
+  Container().swap(_entries);
+  _head = _tail = nullptr;
+  _size = 0;
+}
+
+void PredictionContextMergeCache::moveToFront(Entry *entry) const {
+  if (entry->prev == nullptr) {
+    assert(entry == _head);
+    return;
+  }
+  entry->prev->next = entry->next;
+  if (entry->next != nullptr) {
+    entry->next->prev = entry->prev;
+  } else {
+    assert(entry == _tail);
+    _tail = entry->prev;
+  }
+  entry->prev = nullptr;
+  entry->next = _head;
+  _head->prev = entry;
+  _head = entry;
+  assert(entry->prev == nullptr);
+}
+
+void PredictionContextMergeCache::pushToFront(Entry *entry) {
+  ++_size;
+  entry->prev = nullptr;
+  entry->next = _head;
+  if (_head != nullptr) {
+    _head->prev = entry;
+    _head = entry;
+  } else {
+    assert(entry->next == nullptr);
+    _head = entry;
+    _tail = entry;
+  }
+  assert(entry->prev == nullptr);
+}
+
+void PredictionContextMergeCache::remove(Entry *entry) {
+  if (entry->prev != nullptr) {
+    entry->prev->next = entry->next;
+  } else {
+    assert(entry == _head);
+    _head = entry->next;
+  }
+  if (entry->next != nullptr) {
+    entry->next->prev = entry->prev;
+  } else {
+    assert(entry == _tail);
+    _tail = entry->prev;
+  }
+  --_size;
+  _entries.erase(std::make_pair(entry->key.first.get(), entry->key.second.get()));
+}
+
+void PredictionContextMergeCache::compact(const Entry *preserve) {
+  Entry *entry = _tail;
+  while (entry != nullptr && _size > getOptions().getMaxSize()) {
+    Entry *next = entry->prev;
+    if (entry != preserve) {
+      remove(entry);
+    }
+    entry = next;
+  }
+}
+
+size_t PredictionContextMergeCache::PredictionContextHasher::operator()(
+    const PredictionContextPair &value) const {
+  size_t hash = MurmurHash::initialize();
+  hash = MurmurHash::update(hash, value.first->hashCode());
+  hash = MurmurHash::update(hash, value.second->hashCode());
+  return MurmurHash::finish(hash, 2);
+}
+
+bool PredictionContextMergeCache::PredictionContextComparer::operator()(
+    const PredictionContextPair &lhs, const PredictionContextPair &rhs) const {
+  return *lhs.first == *rhs.first && *lhs.second == *rhs.second;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextMergeCache.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextMergeCache.h
new file mode 100644
index 0000000000..efaeaef578
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextMergeCache.h
@@ -0,0 +1,101 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#pragma once
+
+#include <utility>
+
+#include "atn/PredictionContext.h"
+#include "atn/PredictionContextMergeCacheOptions.h"
+#include "FlatHashMap.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC PredictionContextMergeCache final {
+  public:
+    PredictionContextMergeCache()
+        : PredictionContextMergeCache(PredictionContextMergeCacheOptions()) {}
+
+    explicit PredictionContextMergeCache(const PredictionContextMergeCacheOptions &options);
+
+    PredictionContextMergeCache(const PredictionContextMergeCache&) = delete;
+    PredictionContextMergeCache(PredictionContextMergeCache&&) = delete;
+
+    PredictionContextMergeCache& operator=(const PredictionContextMergeCache&) = delete;
+    PredictionContextMergeCache& operator=(PredictionContextMergeCache&&) = delete;
+
+    Ref<const PredictionContext> put(const Ref<const PredictionContext> &key1,
+                                     const Ref<const PredictionContext> &key2,
+                                     Ref<const PredictionContext> value);
+
+    Ref<const PredictionContext> get(const Ref<const PredictionContext> &key1,
+                                     const Ref<const PredictionContext> &key2) const;
+
+    const PredictionContextMergeCacheOptions& getOptions() const { return _options; }
+
+    void clear();
+
+  private:
+    using PredictionContextPair = std::pair<const PredictionContext*, const PredictionContext*>;
+
+    struct ANTLR4CPP_PUBLIC PredictionContextHasher final {
+      size_t operator()(const PredictionContextPair &value) const;
+    };
+
+    struct ANTLR4CPP_PUBLIC PredictionContextComparer final {
+      bool operator()(const PredictionContextPair &lhs, const PredictionContextPair &rhs) const;
+    };
+
+    struct ANTLR4CPP_PUBLIC Entry final {
+      std::pair<Ref<const PredictionContext>, Ref<const PredictionContext>> key;
+      Ref<const PredictionContext> value;
+      Entry *prev = nullptr;
+      Entry *next = nullptr;
+    };
+
+    void moveToFront(Entry *entry) const;
+
+    void pushToFront(Entry *entry);
+
+    void remove(Entry *entry);
+
+    void compact(const Entry *preserve);
+
+    using Container = FlatHashMap<PredictionContextPair, std::unique_ptr<Entry>,
+                                  PredictionContextHasher, PredictionContextComparer>;
+
+    const PredictionContextMergeCacheOptions _options;
+
+    Container _entries;
+
+    mutable Entry *_head = nullptr;
+    mutable Entry *_tail = nullptr;
+
+    size_t _size = 0;
+  };
+
+}  // namespace atn
+}  // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextMergeCacheOptions.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextMergeCacheOptions.h
new file mode 100644
index 0000000000..7331cc17e0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextMergeCacheOptions.h
@@ -0,0 +1,71 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#pragma once
+
+#include <cstddef>
+#include <cstdint>
+#include <limits>
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC PredictionContextMergeCacheOptions final {
+  public:
+    PredictionContextMergeCacheOptions() = default;
+
+    size_t getMaxSize() const { return _maxSize; }
+
+    bool hasMaxSize() const { return getMaxSize() != std::numeric_limits<size_t>::max(); }
+
+    PredictionContextMergeCacheOptions& setMaxSize(size_t maxSize) {
+      _maxSize = maxSize;
+      return *this;
+    }
+
+    size_t getClearEveryN() const {
+      return _clearEveryN;
+    }
+
+    bool hasClearEveryN() const { return getClearEveryN() != 0; }
+
+    PredictionContextMergeCacheOptions& setClearEveryN(uint64_t clearEveryN) {
+      _clearEveryN = clearEveryN;
+      return *this;
+    }
+
+    PredictionContextMergeCacheOptions& neverClear() {
+      return setClearEveryN(0);
+    }
+
+  private:
+    size_t _maxSize = std::numeric_limits<size_t>::max();
+    uint64_t _clearEveryN = 1;
+  };
+
+}  // namespace atn
+}  // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextType.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextType.h
new file mode 100644
index 0000000000..c8c4473e13
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionContextType.h
@@ -0,0 +1,21 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cstddef>
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+  enum class PredictionContextType : size_t {
+    SINGLETON = 1,
+    ARRAY = 2,
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionMode.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionMode.cpp
new file mode 100755
index 0000000000..9db0b8bdb9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionMode.cpp
@@ -0,0 +1,202 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/RuleStopState.h"
+#include "atn/ATNConfigSet.h"
+#include "atn/ATNConfig.h"
+#include "misc/MurmurHash.h"
+#include "SemanticContext.h"
+
+#include "PredictionMode.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+struct AltAndContextConfigHasher
+{
+  /**
+   * The hash code is only a function of the {@link ATNState#stateNumber}
+   * and {@link ATNConfig#context}.
+   */
+  size_t operator () (ATNConfig *o) const {
+    size_t hashCode = misc::MurmurHash::initialize(7);
+    hashCode = misc::MurmurHash::update(hashCode, o->state->stateNumber);
+    hashCode = misc::MurmurHash::update(hashCode, o->context);
+    return misc::MurmurHash::finish(hashCode, 2);
+  }
+};
+
+struct AltAndContextConfigComparer {
+  bool operator()(ATNConfig *a, ATNConfig *b) const
+  {
+    if (a == b) {
+      return true;
+    }
+    return a->state->stateNumber == b->state->stateNumber && *a->context == *b->context;
+  }
+};
+
+bool PredictionModeClass::hasSLLConflictTerminatingPrediction(PredictionMode mode, ATNConfigSet *configs) {
+  /* Configs in rule stop states indicate reaching the end of the decision
+   * rule (local context) or end of start rule (full context). If all
+   * configs meet this condition, then none of the configurations is able
+   * to match additional input so we terminate prediction.
+   */
+  if (allConfigsInRuleStopStates(configs)) {
+    return true;
+  }
+
+  bool heuristic;
+
+  // Pure SLL mode parsing or SLL+LL if:
+  // Don't bother with combining configs from different semantic
+  // contexts if we can fail over to full LL; costs more time
+  // since we'll often fail over anyway.
+  if (mode == PredictionMode::SLL || !configs->hasSemanticContext) {
+    std::vector<antlrcpp::BitSet> altsets = getConflictingAltSubsets(configs);
+    heuristic = hasConflictingAltSet(altsets) && !hasStateAssociatedWithOneAlt(configs);
+  } else {
+    // dup configs, tossing out semantic predicates
+    ATNConfigSet dup(true);
+    for (auto &config : configs->configs) {
+      Ref<ATNConfig> c = std::make_shared<ATNConfig>(*config, SemanticContext::Empty::Instance);
+      dup.add(c);
+    }
+    std::vector<antlrcpp::BitSet> altsets = getConflictingAltSubsets(&dup);
+    heuristic = hasConflictingAltSet(altsets) && !hasStateAssociatedWithOneAlt(&dup);
+  }
+
+  return heuristic;
+}
+
+bool PredictionModeClass::hasConfigInRuleStopState(ATNConfigSet *configs) {
+  for (const auto &config : configs->configs) {
+    if (RuleStopState::is(config->state)) {
+      return true;
+    }
+  }
+
+  return false;
+}
+
+bool PredictionModeClass::allConfigsInRuleStopStates(ATNConfigSet *configs) {
+  for (const auto &config : configs->configs) {
+    if (!RuleStopState::is(config->state)) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+size_t PredictionModeClass::resolvesToJustOneViableAlt(const std::vector<antlrcpp::BitSet>& altsets) {
+  return getSingleViableAlt(altsets);
+}
+
+bool PredictionModeClass::allSubsetsConflict(const std::vector<antlrcpp::BitSet>& altsets) {
+  return !hasNonConflictingAltSet(altsets);
+}
+
+bool PredictionModeClass::hasNonConflictingAltSet(const std::vector<antlrcpp::BitSet>& altsets) {
+  for (antlrcpp::BitSet alts : altsets) {
+    if (alts.count() == 1) {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool PredictionModeClass::hasConflictingAltSet(const std::vector<antlrcpp::BitSet>& altsets) {
+  for (antlrcpp::BitSet alts : altsets) {
+    if (alts.count() > 1) {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool PredictionModeClass::allSubsetsEqual(const std::vector<antlrcpp::BitSet>& altsets) {
+  if (altsets.empty()) {
+    return true;
+  }
+
+  const antlrcpp::BitSet& first = *altsets.begin();
+  for (const antlrcpp::BitSet& alts : altsets) {
+    if (alts != first) {
+      return false;
+    }
+  }
+  return true;
+}
+
+size_t PredictionModeClass::getUniqueAlt(const std::vector<antlrcpp::BitSet>& altsets) {
+  antlrcpp::BitSet all = getAlts(altsets);
+  if (all.count() == 1) {
+    return all.nextSetBit(0);
+  }
+  return ATN::INVALID_ALT_NUMBER;
+}
+
+antlrcpp::BitSet PredictionModeClass::getAlts(const std::vector<antlrcpp::BitSet>& altsets) {
+  antlrcpp::BitSet all;
+  for (const auto &alts : altsets) {
+    all |= alts;
+  }
+
+  return all;
+}
+
+antlrcpp::BitSet PredictionModeClass::getAlts(ATNConfigSet *configs) {
+  antlrcpp::BitSet alts;
+  for (const auto &config : configs->configs) {
+    alts.set(config->alt);
+  }
+  return alts;
+}
+
+std::vector<antlrcpp::BitSet> PredictionModeClass::getConflictingAltSubsets(ATNConfigSet *configs) {
+  std::unordered_map<ATNConfig*, antlrcpp::BitSet, AltAndContextConfigHasher, AltAndContextConfigComparer> configToAlts;
+  for (auto &config : configs->configs) {
+    configToAlts[config.get()].set(config->alt);
+  }
+  std::vector<antlrcpp::BitSet> values;
+  values.reserve(configToAlts.size());
+  for (const auto &pair : configToAlts) {
+    values.push_back(pair.second);
+  }
+  return values;
+}
+
+std::unordered_map<ATNState*, antlrcpp::BitSet> PredictionModeClass::getStateToAltMap(ATNConfigSet *configs) {
+  std::unordered_map<ATNState*, antlrcpp::BitSet> m;
+  for (const auto &c : configs->configs) {
+    m[c->state].set(c->alt);
+  }
+  return m;
+}
+
+bool PredictionModeClass::hasStateAssociatedWithOneAlt(ATNConfigSet *configs) {
+  auto x = getStateToAltMap(configs);
+  for (const auto &pair : x){
+    if (pair.second.count() == 1) return true;
+  }
+  return false;
+}
+
+size_t PredictionModeClass::getSingleViableAlt(const std::vector<antlrcpp::BitSet>& altsets) {
+  antlrcpp::BitSet viableAlts;
+  for (const auto &alts : altsets) {
+    size_t minAlt = alts.nextSetBit(0);
+
+    viableAlts.set(minAlt);
+    if (viableAlts.count() > 1)  // more than 1 viable alt
+    {
+      return ATN::INVALID_ALT_NUMBER;
+    }
+  }
+
+  return viableAlts.nextSetBit(0);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionMode.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionMode.h
new file mode 100755
index 0000000000..11d1bbe034
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/PredictionMode.h
@@ -0,0 +1,436 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "support/BitSet.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /**
+   * This enumeration defines the prediction modes available in ANTLR 4 along with
+   * utility methods for analyzing configuration sets for conflicts and/or
+   * ambiguities.
+   */
+  enum class PredictionMode {
+    /**
+     * The SLL(*) prediction mode. This prediction mode ignores the current
+     * parser context when making predictions. This is the fastest prediction
+     * mode, and provides correct results for many grammars. This prediction
+     * mode is more powerful than the prediction mode provided by ANTLR 3, but
+     * may result in syntax errors for grammar and input combinations which are
+     * not SLL.
+     *
+     * <p>
+     * When using this prediction mode, the parser will either return a correct
+     * parse tree (i.e. the same parse tree that would be returned with the
+     * {@link #LL} prediction mode), or it will report a syntax error. If a
+     * syntax error is encountered when using the {@link #SLL} prediction mode,
+     * it may be due to either an actual syntax error in the input or indicate
+     * that the particular combination of grammar and input requires the more
+     * powerful {@link #LL} prediction abilities to complete successfully.</p>
+     *
+     * <p>
+     * This prediction mode does not provide any guarantees for prediction
+     * behavior for syntactically-incorrect inputs.</p>
+     */
+    SLL,
+
+    /**
+     * The LL(*) prediction mode. This prediction mode allows the current parser
+     * context to be used for resolving SLL conflicts that occur during
+     * prediction. This is the fastest prediction mode that guarantees correct
+     * parse results for all combinations of grammars with syntactically correct
+     * inputs.
+     *
+     * <p>
+     * When using this prediction mode, the parser will make correct decisions
+     * for all syntactically-correct grammar and input combinations. However, in
+     * cases where the grammar is truly ambiguous this prediction mode might not
+     * report a precise answer for <em>exactly which</em> alternatives are
+     * ambiguous.</p>
+     *
+     * <p>
+     * This prediction mode does not provide any guarantees for prediction
+     * behavior for syntactically-incorrect inputs.</p>
+     */
+    LL,
+
+    /**
+     * The LL(*) prediction mode with exact ambiguity detection. In addition to
+     * the correctness guarantees provided by the {@link #LL} prediction mode,
+     * this prediction mode instructs the prediction algorithm to determine the
+     * complete and exact set of ambiguous alternatives for every ambiguous
+     * decision encountered while parsing.
+     *
+     * <p>
+     * This prediction mode may be used for diagnosing ambiguities during
+     * grammar development. Due to the performance overhead of calculating sets
+     * of ambiguous alternatives, this prediction mode should be avoided when
+     * the exact results are not necessary.</p>
+     *
+     * <p>
+     * This prediction mode does not provide any guarantees for prediction
+     * behavior for syntactically-incorrect inputs.</p>
+     */
+    LL_EXACT_AMBIG_DETECTION
+  };
+
+  class ANTLR4CPP_PUBLIC PredictionModeClass {
+  public:
+    /**
+     * Computes the SLL prediction termination condition.
+     *
+     * <p>
+     * This method computes the SLL prediction termination condition for both of
+     * the following cases.</p>
+     *
+     * <ul>
+     * <li>The usual SLL+LL fallback upon SLL conflict</li>
+     * <li>Pure SLL without LL fallback</li>
+     * </ul>
+     *
+     * <p><strong>COMBINED SLL+LL PARSING</strong></p>
+     *
+     * <p>When LL-fallback is enabled upon SLL conflict, correct predictions are
+     * ensured regardless of how the termination condition is computed by this
+     * method. Due to the substantially higher cost of LL prediction, the
+     * prediction should only fall back to LL when the additional lookahead
+     * cannot lead to a unique SLL prediction.</p>
+     *
+     * <p>Assuming combined SLL+LL parsing, an SLL configuration set with only
+     * conflicting subsets should fall back to full LL, even if the
+     * configuration sets don't resolve to the same alternative (e.g.
+     * {@code {1,2}} and {@code {3,4}}. If there is at least one non-conflicting
+     * configuration, SLL could continue with the hopes that more lookahead will
+     * resolve via one of those non-conflicting configurations.</p>
+     *
+     * <p>Here's the prediction termination rule them: SLL (for SLL+LL parsing)
+     * stops when it sees only conflicting configuration subsets. In contrast,
+     * full LL keeps going when there is uncertainty.</p>
+     *
+     * <p><strong>HEURISTIC</strong></p>
+     *
+     * <p>As a heuristic, we stop prediction when we see any conflicting subset
+     * unless we see a state that only has one alternative associated with it.
+     * The single-alt-state thing lets prediction continue upon rules like
+     * (otherwise, it would admit defeat too soon):</p>
+     *
+     * <p>{@code [12|1|[], 6|2|[], 12|2|[]]. s : (ID | ID ID?) ';' ;}</p>
+     *
+     * <p>When the ATN simulation reaches the state before {@code ';'}, it has a
+     * DFA state that looks like: {@code [12|1|[], 6|2|[], 12|2|[]]}. Naturally
+     * {@code 12|1|[]} and {@code 12|2|[]} conflict, but we cannot stop
+     * processing this node because alternative to has another way to continue,
+     * via {@code [6|2|[]]}.</p>
+     *
+     * <p>It also let's us continue for this rule:</p>
+     *
+     * <p>{@code [1|1|[], 1|2|[], 8|3|[]] a : A | A | A B ;}</p>
+     *
+     * <p>After matching input A, we reach the stop state for rule A, state 1.
+     * State 8 is the state right before B. Clearly alternatives 1 and 2
+     * conflict and no amount of further lookahead will separate the two.
+     * However, alternative 3 will be able to continue and so we do not stop
+     * working on this state. In the previous example, we're concerned with
+     * states associated with the conflicting alternatives. Here alt 3 is not
+     * associated with the conflicting configs, but since we can continue
+     * looking for input reasonably, don't declare the state done.</p>
+     *
+     * <p><strong>PURE SLL PARSING</strong></p>
+     *
+     * <p>To handle pure SLL parsing, all we have to do is make sure that we
+     * combine stack contexts for configurations that differ only by semantic
+     * predicate. From there, we can do the usual SLL termination heuristic.</p>
+     *
+     * <p><strong>PREDICATES IN SLL+LL PARSING</strong></p>
+     *
+     * <p>SLL decisions don't evaluate predicates until after they reach DFA stop
+     * states because they need to create the DFA cache that works in all
+     * semantic situations. In contrast, full LL evaluates predicates collected
+     * during start state computation so it can ignore predicates thereafter.
+     * This means that SLL termination detection can totally ignore semantic
+     * predicates.</p>
+     *
+     * <p>Implementation-wise, {@link ATNConfigSet} combines stack contexts but not
+     * semantic predicate contexts so we might see two configurations like the
+     * following.</p>
+     *
+     * <p>{@code (s, 1, x, {}), (s, 1, x', {p})}</p>
+     *
+     * <p>Before testing these configurations against others, we have to merge
+     * {@code x} and {@code x'} (without modifying the existing configurations).
+     * For example, we test {@code (x+x')==x''} when looking for conflicts in
+     * the following configurations.</p>
+     *
+     * <p>{@code (s, 1, x, {}), (s, 1, x', {p}), (s, 2, x'', {})}</p>
+     *
+     * <p>If the configuration set has predicates (as indicated by
+     * {@link ATNConfigSet#hasSemanticContext}), this algorithm makes a copy of
+     * the configurations to strip out all of the predicates so that a standard
+     * {@link ATNConfigSet} will merge everything ignoring predicates.</p>
+     */
+    static bool hasSLLConflictTerminatingPrediction(PredictionMode mode, ATNConfigSet *configs);
+
+    /// <summary>
+    /// Checks if any configuration in {@code configs} is in a
+    /// <seealso cref="RuleStopState"/>. Configurations meeting this condition have
+    /// reached
+    /// the end of the decision rule (local context) or end of start rule (full
+    /// context).
+    /// </summary>
+    /// <param name="configs"> the configuration set to test </param>
+    /// <returns> {@code true} if any configuration in {@code configs} is in a
+    /// <seealso cref="RuleStopState"/>, otherwise {@code false} </returns>
+    static bool hasConfigInRuleStopState(ATNConfigSet *configs);
+
+    /// <summary>
+    /// Checks if all configurations in {@code configs} are in a
+    /// <seealso cref="RuleStopState"/>. Configurations meeting this condition have
+    /// reached
+    /// the end of the decision rule (local context) or end of start rule (full
+    /// context).
+    /// </summary>
+    /// <param name="configs"> the configuration set to test </param>
+    /// <returns> {@code true} if all configurations in {@code configs} are in a
+    /// <seealso cref="RuleStopState"/>, otherwise {@code false} </returns>
+    static bool allConfigsInRuleStopStates(ATNConfigSet *configs);
+
+    /**
+     * Full LL prediction termination.
+     *
+     * <p>Can we stop looking ahead during ATN simulation or is there some
+     * uncertainty as to which alternative we will ultimately pick, after
+     * consuming more input? Even if there are partial conflicts, we might know
+     * that everything is going to resolve to the same minimum alternative. That
+     * means we can stop since no more lookahead will change that fact. On the
+     * other hand, there might be multiple conflicts that resolve to different
+     * minimums. That means we need more look ahead to decide which of those
+     * alternatives we should predict.</p>
+     *
+     * <p>The basic idea is to split the set of configurations {@code C}, into
+     * conflicting subsets {@code (s, _, ctx, _)} and singleton subsets with
+     * non-conflicting configurations. Two configurations conflict if they have
+     * identical {@link ATNConfig#state} and {@link ATNConfig#context} values
+     * but different {@link ATNConfig#alt} value, e.g. {@code (s, i, ctx, _)}
+     * and {@code (s, j, ctx, _)} for {@code i!=j}.</p>
+     *
+     * <p>Reduce these configuration subsets to the set of possible alternatives.
+     * You can compute the alternative subsets in one pass as follows:</p>
+     *
+     * <p>{@code A_s,ctx = {i | (s, i, ctx, _)}} for each configuration in
+     * {@code C} holding {@code s} and {@code ctx} fixed.</p>
+     *
+     * <p>Or in pseudo-code, for each configuration {@code c} in {@code C}:</p>
+     *
+     * <pre>
+     * map[c] U= c.{@link ATNConfig#alt alt} # map hash/equals uses s and x, not
+     * alt and not pred
+     * </pre>
+     *
+     * <p>The values in {@code map} are the set of {@code A_s,ctx} sets.</p>
+     *
+     * <p>If {@code |A_s,ctx|=1} then there is no conflict associated with
+     * {@code s} and {@code ctx}.</p>
+     *
+     * <p>Reduce the subsets to singletons by choosing a minimum of each subset. If
+     * the union of these alternative subsets is a singleton, then no amount of
+     * more lookahead will help us. We will always pick that alternative. If,
+     * however, there is more than one alternative, then we are uncertain which
+     * alternative to predict and must continue looking for resolution. We may
+     * or may not discover an ambiguity in the future, even if there are no
+     * conflicting subsets this round.</p>
+     *
+     * <p>The biggest sin is to terminate early because it means we've made a
+     * decision but were uncertain as to the eventual outcome. We haven't used
+     * enough lookahead. On the other hand, announcing a conflict too late is no
+     * big deal; you will still have the conflict. It's just inefficient. It
+     * might even look until the end of file.</p>
+     *
+     * <p>No special consideration for semantic predicates is required because
+     * predicates are evaluated on-the-fly for full LL prediction, ensuring that
+     * no configuration contains a semantic context during the termination
+     * check.</p>
+     *
+     * <p><strong>CONFLICTING CONFIGS</strong></p>
+     *
+     * <p>Two configurations {@code (s, i, x)} and {@code (s, j, x')}, conflict
+     * when {@code i!=j} but {@code x=x'}. Because we merge all
+     * {@code (s, i, _)} configurations together, that means that there are at
+     * most {@code n} configurations associated with state {@code s} for
+     * {@code n} possible alternatives in the decision. The merged stacks
+     * complicate the comparison of configuration contexts {@code x} and
+     * {@code x'}. Sam checks to see if one is a subset of the other by calling
+     * merge and checking to see if the merged result is either {@code x} or
+     * {@code x'}. If the {@code x} associated with lowest alternative {@code i}
+     * is the superset, then {@code i} is the only possible prediction since the
+     * others resolve to {@code min(i)} as well. However, if {@code x} is
+     * associated with {@code j>i} then at least one stack configuration for
+     * {@code j} is not in conflict with alternative {@code i}. The algorithm
+     * should keep going, looking for more lookahead due to the uncertainty.</p>
+     *
+     * <p>For simplicity, I'm doing a equality check between {@code x} and
+     * {@code x'} that lets the algorithm continue to consume lookahead longer
+     * than necessary. The reason I like the equality is of course the
+     * simplicity but also because that is the test you need to detect the
+     * alternatives that are actually in conflict.</p>
+     *
+     * <p><strong>CONTINUE/STOP RULE</strong></p>
+     *
+     * <p>Continue if union of resolved alternative sets from non-conflicting and
+     * conflicting alternative subsets has more than one alternative. We are
+     * uncertain about which alternative to predict.</p>
+     *
+     * <p>The complete set of alternatives, {@code [i for (_,i,_)]}, tells us which
+     * alternatives are still in the running for the amount of input we've
+     * consumed at this point. The conflicting sets let us to strip away
+     * configurations that won't lead to more states because we resolve
+     * conflicts to the configuration with a minimum alternate for the
+     * conflicting set.</p>
+     *
+     * <p><strong>CASES</strong></p>
+     *
+     * <ul>
+     *
+     * <li>no conflicts and more than 1 alternative in set =&gt; continue</li>
+     *
+     * <li> {@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s, 3, z)},
+     * {@code (s', 1, y)}, {@code (s', 2, y)} yields non-conflicting set
+     * {@code {3}} U conflicting sets {@code min({1,2})} U {@code min({1,2})} =
+     * {@code {1,3}} =&gt; continue
+     * </li>
+     *
+     * <li>{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 1, y)},
+     * {@code (s', 2, y)}, {@code (s'', 1, z)} yields non-conflicting set
+     * {@code {1}} U conflicting sets {@code min({1,2})} U {@code min({1,2})} =
+     * {@code {1}} =&gt; stop and predict 1</li>
+     *
+     * <li>{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 1, y)},
+     * {@code (s', 2, y)} yields conflicting, reduced sets {@code {1}} U
+     * {@code {1}} = {@code {1}} =&gt; stop and predict 1, can announce
+     * ambiguity {@code {1,2}}</li>
+     *
+     * <li>{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 2, y)},
+     * {@code (s', 3, y)} yields conflicting, reduced sets {@code {1}} U
+     * {@code {2}} = {@code {1,2}} =&gt; continue</li>
+     *
+     * <li>{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 3, y)},
+     * {@code (s', 4, y)} yields conflicting, reduced sets {@code {1}} U
+     * {@code {3}} = {@code {1,3}} =&gt; continue</li>
+     *
+     * </ul>
+     *
+     * <p><strong>EXACT AMBIGUITY DETECTION</strong></p>
+     *
+     * <p>If all states report the same conflicting set of alternatives, then we
+     * know we have the exact ambiguity set.</p>
+     *
+     * <p><code>|A_<em>i</em>|&gt;1</code> and
+     * <code>A_<em>i</em> = A_<em>j</em></code> for all <em>i</em>, <em>j</em>.</p>
+     *
+     * <p>In other words, we continue examining lookahead until all {@code A_i}
+     * have more than one alternative and all {@code A_i} are the same. If
+     * {@code A={{1,2}, {1,3}}}, then regular LL prediction would terminate
+     * because the resolved set is {@code {1}}. To determine what the real
+     * ambiguity is, we have to know whether the ambiguity is between one and
+     * two or one and three so we keep going. We can only stop prediction when
+     * we need exact ambiguity detection when the sets look like
+     * {@code A={{1,2}}} or {@code {{1,2},{1,2}}}, etc...</p>
+     */
+    static size_t resolvesToJustOneViableAlt(const std::vector<antlrcpp::BitSet> &altsets);
+
+    /// <summary>
+    /// Determines if every alternative subset in {@code altsets} contains more
+    /// than one alternative.
+    /// </summary>
+    /// <param name="altsets"> a collection of alternative subsets </param>
+    /// <returns> {@code true} if every <seealso cref="BitSet"/> in {@code altsets}
+    /// has
+    /// <seealso cref="BitSet#cardinality cardinality"/> &gt; 1, otherwise {@code
+    /// false} </returns>
+    static bool allSubsetsConflict(const std::vector<antlrcpp::BitSet> &altsets);
+
+    /// <summary>
+    /// Determines if any single alternative subset in {@code altsets} contains
+    /// exactly one alternative.
+    /// </summary>
+    /// <param name="altsets"> a collection of alternative subsets </param>
+    /// <returns> {@code true} if {@code altsets} contains a <seealso
+    /// cref="BitSet"/> with
+    /// <seealso cref="BitSet#cardinality cardinality"/> 1, otherwise {@code false}
+    /// </returns>
+    static bool hasNonConflictingAltSet(const std::vector<antlrcpp::BitSet> &altsets);
+
+    /// <summary>
+    /// Determines if any single alternative subset in {@code altsets} contains
+    /// more than one alternative.
+    /// </summary>
+    /// <param name="altsets"> a collection of alternative subsets </param>
+    /// <returns> {@code true} if {@code altsets} contains a <seealso
+    /// cref="BitSet"/> with
+    /// <seealso cref="BitSet#cardinality cardinality"/> &gt; 1, otherwise {@code
+    /// false} </returns>
+    static bool hasConflictingAltSet(const std::vector<antlrcpp::BitSet> &altsets);
+
+    /// <summary>
+    /// Determines if every alternative subset in {@code altsets} is equivalent.
+    /// </summary>
+    /// <param name="altsets"> a collection of alternative subsets </param>
+    /// <returns> {@code true} if every member of {@code altsets} is equal to the
+    /// others, otherwise {@code false} </returns>
+    static bool allSubsetsEqual(const std::vector<antlrcpp::BitSet> &altsets);
+
+    /// <summary>
+    /// Returns the unique alternative predicted by all alternative subsets in
+    /// {@code altsets}. If no such alternative exists, this method returns
+    /// <seealso cref="ATN#INVALID_ALT_NUMBER"/>.
+    /// </summary>
+    /// <param name="altsets"> a collection of alternative subsets </param>
+    static size_t getUniqueAlt(const std::vector<antlrcpp::BitSet> &altsets);
+
+    /// <summary>
+    /// Gets the complete set of represented alternatives for a collection of
+    /// alternative subsets. This method returns the union of each <seealso
+    /// cref="BitSet"/>
+    /// in {@code altsets}.
+    /// </summary>
+    /// <param name="altsets"> a collection of alternative subsets </param>
+    /// <returns> the set of represented alternatives in {@code altsets} </returns>
+    static antlrcpp::BitSet getAlts(const std::vector<antlrcpp::BitSet> &altsets);
+
+    /** Get union of all alts from configs. @since 4.5.1 */
+    static antlrcpp::BitSet getAlts(ATNConfigSet *configs);
+
+    /// <summary>
+    /// This function gets the conflicting alt subsets from a configuration set.
+    /// For each configuration {@code c} in {@code configs}:
+    ///
+    /// <pre>
+    /// map[c] U= c.<seealso cref="ATNConfig#alt alt"/> # map hash/equals uses s and
+    /// x, not
+    /// alt and not pred
+    /// </pre>
+    /// </summary>
+    static std::vector<antlrcpp::BitSet> getConflictingAltSubsets(ATNConfigSet *configs);
+
+    /// <summary>
+    /// Get a map from state to alt subset from a configuration set. For each
+    /// configuration {@code c} in {@code configs}:
+    ///
+    /// <pre>
+    /// map[c.<seealso cref="ATNConfig#state state"/>] U= c.<seealso
+    /// cref="ATNConfig#alt alt"/>
+    /// </pre>
+    /// </summary>
+    static std::unordered_map<ATNState*, antlrcpp::BitSet> getStateToAltMap(ATNConfigSet *configs);
+
+    static bool hasStateAssociatedWithOneAlt(ATNConfigSet *configs);
+
+    static size_t getSingleViableAlt(const std::vector<antlrcpp::BitSet> &altsets);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ProfilingATNSimulator.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ProfilingATNSimulator.cpp
new file mode 100755
index 0000000000..9fd86d67d4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ProfilingATNSimulator.cpp
@@ -0,0 +1,179 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/PredicateEvalInfo.h"
+#include "atn/LookaheadEventInfo.h"
+#include "Parser.h"
+#include "atn/ATNConfigSet.h"
+#include "support/CPPUtils.h"
+
+#include "atn/ProfilingATNSimulator.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlr4::dfa;
+using namespace antlrcpp;
+
+using namespace std::chrono;
+
+ProfilingATNSimulator::ProfilingATNSimulator(Parser *parser)
+  : ParserATNSimulator(parser, parser->getInterpreter<ParserATNSimulator>()->atn,
+                       parser->getInterpreter<ParserATNSimulator>()->decisionToDFA,
+                       parser->getInterpreter<ParserATNSimulator>()->getSharedContextCache()) {
+  for (size_t i = 0; i < atn.decisionToState.size(); i++) {
+    _decisions.push_back(DecisionInfo(i));
+  }
+}
+
+size_t ProfilingATNSimulator::adaptivePredict(TokenStream *input, size_t decision, ParserRuleContext *outerContext) {
+  auto onExit = finally([this](){
+    _currentDecision = 0; // Originally -1, but that makes no sense (index into a vector and init value is also 0).
+  });
+
+  _sllStopIndex = -1;
+  _llStopIndex = -1;
+  _currentDecision = decision;
+  high_resolution_clock::time_point start = high_resolution_clock::now();
+  size_t alt = ParserATNSimulator::adaptivePredict(input, decision, outerContext);
+  high_resolution_clock::time_point stop = high_resolution_clock::now();
+  _decisions[decision].timeInPrediction += duration_cast<nanoseconds>(stop - start).count();
+  _decisions[decision].invocations++;
+
+  long long SLL_k = _sllStopIndex - _startIndex + 1;
+  _decisions[decision].SLL_TotalLook += SLL_k;
+  _decisions[decision].SLL_MinLook = _decisions[decision].SLL_MinLook == 0 ? SLL_k : std::min(_decisions[decision].SLL_MinLook, SLL_k);
+  if (SLL_k > _decisions[decision].SLL_MaxLook) {
+    _decisions[decision].SLL_MaxLook = SLL_k;
+    _decisions[decision].SLL_MaxLookEvent = std::make_shared<LookaheadEventInfo>(decision, nullptr, alt, input, _startIndex, _sllStopIndex, false);
+  }
+
+  if (_llStopIndex >= 0) {
+    long long LL_k = _llStopIndex - _startIndex + 1;
+    _decisions[decision].LL_TotalLook += LL_k;
+    _decisions[decision].LL_MinLook = _decisions[decision].LL_MinLook == 0 ? LL_k : std::min(_decisions[decision].LL_MinLook, LL_k);
+    if (LL_k > _decisions[decision].LL_MaxLook) {
+      _decisions[decision].LL_MaxLook = LL_k;
+      _decisions[decision].LL_MaxLookEvent = std::make_shared<LookaheadEventInfo>(decision, nullptr, alt, input, _startIndex, _llStopIndex, true);
+    }
+  }
+
+  return alt;
+}
+
+DFAState* ProfilingATNSimulator::getExistingTargetState(DFAState *previousD, size_t t) {
+  // this method is called after each time the input position advances
+  // during SLL prediction
+  _sllStopIndex = (int)_input->index();
+
+  DFAState *existingTargetState = ParserATNSimulator::getExistingTargetState(previousD, t);
+  if (existingTargetState != nullptr) {
+    _decisions[_currentDecision].SLL_DFATransitions++; // count only if we transition over a DFA state
+    if (existingTargetState == ERROR.get()) {
+      _decisions[_currentDecision].errors.push_back(
+        ErrorInfo(_currentDecision, previousD->configs.get(), _input, _startIndex, _sllStopIndex, false)
+      );
+    }
+  }
+
+  _currentState = existingTargetState;
+  return existingTargetState;
+}
+
+DFAState* ProfilingATNSimulator::computeTargetState(DFA &dfa, DFAState *previousD, size_t t) {
+  DFAState *state = ParserATNSimulator::computeTargetState(dfa, previousD, t);
+  _currentState = state;
+  return state;
+}
+
+std::unique_ptr<ATNConfigSet> ProfilingATNSimulator::computeReachSet(ATNConfigSet *closure, size_t t, bool fullCtx) {
+  if (fullCtx) {
+    // this method is called after each time the input position advances
+    // during full context prediction
+    _llStopIndex = (int)_input->index();
+  }
+
+  std::unique_ptr<ATNConfigSet> reachConfigs = ParserATNSimulator::computeReachSet(closure, t, fullCtx);
+  if (fullCtx) {
+    _decisions[_currentDecision].LL_ATNTransitions++; // count computation even if error
+    if (reachConfigs != nullptr) {
+    } else { // no reach on current lookahead symbol. ERROR.
+      // TODO: does not handle delayed errors per getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule()
+      _decisions[_currentDecision].errors.push_back(ErrorInfo(_currentDecision, closure, _input, _startIndex, _llStopIndex, true));
+    }
+  } else {
+    ++_decisions[_currentDecision].SLL_ATNTransitions;
+    if (reachConfigs != nullptr) {
+    } else { // no reach on current lookahead symbol. ERROR.
+      _decisions[_currentDecision].errors.push_back(ErrorInfo(_currentDecision, closure, _input, _startIndex, _sllStopIndex, false));
+    }
+  }
+  return reachConfigs;
+}
+
+bool ProfilingATNSimulator::evalSemanticContext(Ref<const SemanticContext> const& pred, ParserRuleContext *parserCallStack,
+                                                size_t alt, bool fullCtx) {
+  bool result = ParserATNSimulator::evalSemanticContext(pred, parserCallStack, alt, fullCtx);
+  if (!(std::dynamic_pointer_cast<const SemanticContext::PrecedencePredicate>(pred) != nullptr)) {
+    bool fullContext = _llStopIndex >= 0;
+    int stopIndex = fullContext ? _llStopIndex : _sllStopIndex;
+    _decisions[_currentDecision].predicateEvals.push_back(
+      PredicateEvalInfo(_currentDecision, _input, _startIndex, stopIndex, pred, result, alt, fullCtx));
+  }
+
+  return result;
+}
+
+void ProfilingATNSimulator::reportAttemptingFullContext(DFA &dfa, const BitSet &conflictingAlts, ATNConfigSet *configs,
+                                                        size_t startIndex, size_t stopIndex) {
+  if (conflictingAlts.count() > 0) {
+    conflictingAltResolvedBySLL = conflictingAlts.nextSetBit(0);
+  } else {
+    conflictingAltResolvedBySLL = configs->getAlts().nextSetBit(0);
+  }
+  _decisions[_currentDecision].LL_Fallback++;
+  ParserATNSimulator::reportAttemptingFullContext(dfa, conflictingAlts, configs, startIndex, stopIndex);
+}
+
+void ProfilingATNSimulator::reportContextSensitivity(DFA &dfa, size_t prediction, ATNConfigSet *configs,
+                                                     size_t startIndex, size_t stopIndex) {
+  if (prediction != conflictingAltResolvedBySLL) {
+    _decisions[_currentDecision].contextSensitivities.push_back(
+      ContextSensitivityInfo(_currentDecision, configs, _input, startIndex, stopIndex)
+    );
+  }
+  ParserATNSimulator::reportContextSensitivity(dfa, prediction, configs, startIndex, stopIndex);
+}
+
+void ProfilingATNSimulator::reportAmbiguity(DFA &dfa, DFAState *D, size_t startIndex, size_t stopIndex, bool exact,
+                                            const BitSet &ambigAlts, ATNConfigSet *configs) {
+  size_t prediction;
+  if (ambigAlts.count() > 0) {
+    prediction = ambigAlts.nextSetBit(0);
+  } else {
+    prediction = configs->getAlts().nextSetBit(0);
+  }
+  if (configs->fullCtx && prediction != conflictingAltResolvedBySLL) {
+    // Even though this is an ambiguity we are reporting, we can
+    // still detect some context sensitivities.  Both SLL and LL
+    // are showing a conflict, hence an ambiguity, but if they resolve
+    // to different minimum alternatives we have also identified a
+    // context sensitivity.
+    _decisions[_currentDecision].contextSensitivities.push_back(
+      ContextSensitivityInfo(_currentDecision, configs, _input, startIndex, stopIndex)
+    );
+  }
+  _decisions[_currentDecision].ambiguities.push_back(
+    AmbiguityInfo(_currentDecision, configs, ambigAlts, _input, startIndex, stopIndex, configs->fullCtx)
+  );
+  ParserATNSimulator::reportAmbiguity(dfa, D, startIndex, stopIndex, exact, ambigAlts, configs);
+}
+
+std::vector<DecisionInfo> ProfilingATNSimulator::getDecisionInfo() const {
+  return _decisions;
+}
+
+DFAState* ProfilingATNSimulator::getCurrentState() const {
+  return _currentState;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ProfilingATNSimulator.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ProfilingATNSimulator.h
new file mode 100755
index 0000000000..551efb8556
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/ProfilingATNSimulator.h
@@ -0,0 +1,60 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ParserATNSimulator.h"
+#include "atn/DecisionInfo.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC ProfilingATNSimulator : public ParserATNSimulator {
+  public:
+    explicit ProfilingATNSimulator(Parser *parser);
+
+    virtual size_t adaptivePredict(TokenStream *input, size_t decision, ParserRuleContext *outerContext) override;
+
+    virtual std::vector<DecisionInfo> getDecisionInfo() const;
+    virtual dfa::DFAState* getCurrentState() const;
+
+  protected:
+    std::vector<DecisionInfo> _decisions;
+
+    int _sllStopIndex = 0;
+    int _llStopIndex = 0;
+
+    size_t _currentDecision = 0;
+    dfa::DFAState *_currentState;
+
+    /// <summary>
+    /// At the point of LL failover, we record how SLL would resolve the conflict so that
+    ///  we can determine whether or not a decision / input pair is context-sensitive.
+    ///  If LL gives a different result than SLL's predicted alternative, we have a
+    ///  context sensitivity for sure. The converse is not necessarily true, however.
+    ///  It's possible that after conflict resolution chooses minimum alternatives,
+    ///  SLL could get the same answer as LL. Regardless of whether or not the result indicates
+    ///  an ambiguity, it is not treated as a context sensitivity because LL prediction
+    ///  was not required in order to produce a correct prediction for this decision and input sequence.
+    ///  It may in fact still be a context sensitivity but we don't know by looking at the
+    ///  minimum alternatives for the current input.
+    /// </summary>
+    size_t conflictingAltResolvedBySLL = 0;
+
+    virtual dfa::DFAState* getExistingTargetState(dfa::DFAState *previousD, size_t t) override;
+    virtual dfa::DFAState* computeTargetState(dfa::DFA &dfa, dfa::DFAState *previousD, size_t t) override;
+    virtual std::unique_ptr<ATNConfigSet> computeReachSet(ATNConfigSet *closure, size_t t, bool fullCtx) override;
+    virtual bool evalSemanticContext(Ref<const SemanticContext> const& pred, ParserRuleContext *parserCallStack,
+                                     size_t alt, bool fullCtx) override;
+    virtual void reportAttemptingFullContext(dfa::DFA &dfa, const antlrcpp::BitSet &conflictingAlts, ATNConfigSet *configs,
+                                             size_t startIndex, size_t stopIndex) override;
+    virtual void reportContextSensitivity(dfa::DFA &dfa, size_t prediction, ATNConfigSet *configs,
+                                          size_t startIndex, size_t stopIndex) override;
+    virtual void reportAmbiguity(dfa::DFA &dfa, dfa::DFAState *D, size_t startIndex, size_t stopIndex, bool exact,
+                                 const antlrcpp::BitSet &ambigAlts, ATNConfigSet *configs) override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RangeTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RangeTransition.cpp
new file mode 100755
index 0000000000..101a3bb0c3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RangeTransition.cpp
@@ -0,0 +1,26 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/IntervalSet.h"
+
+#include "atn/RangeTransition.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+RangeTransition::RangeTransition(ATNState *target, size_t from, size_t to) : Transition(TransitionType::RANGE, target), from(from), to(to) {
+}
+
+misc::IntervalSet RangeTransition::label() const {
+  return misc::IntervalSet::of((int)from, (int)to);
+}
+
+bool RangeTransition::matches(size_t symbol, size_t /*minVocabSymbol*/, size_t /*maxVocabSymbol*/) const {
+  return symbol >= from && symbol <= to;
+}
+
+std::string RangeTransition::toString() const {
+  return "RANGE " + Transition::toString() + " { from: " + std::to_string(from) + ", to: " + std::to_string(to) + " }";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RangeTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RangeTransition.h
new file mode 100755
index 0000000000..721b712d41
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RangeTransition.h
@@ -0,0 +1,31 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/Transition.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC RangeTransition final : public Transition {
+  public:
+    static bool is(const Transition &transition) { return transition.getTransitionType() == TransitionType::RANGE; }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    const size_t from;
+    const size_t to;
+
+    RangeTransition(ATNState *target, size_t from, size_t to);
+
+    virtual misc::IntervalSet label() const override;
+    virtual bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+
+    virtual std::string toString() const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleStartState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleStartState.h
new file mode 100755
index 0000000000..0d396dfcbb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleStartState.h
@@ -0,0 +1,26 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC RuleStartState final : public ATNState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::RULE_START; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    RuleStopState *stopState = nullptr;
+    bool isLeftRecursiveRule = false;
+
+    RuleStartState() : ATNState(ATNStateType::RULE_START) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleStopState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleStopState.h
new file mode 100755
index 0000000000..e5f4dc4ca9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleStopState.h
@@ -0,0 +1,27 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// The last node in the ATN for a rule, unless that rule is the start symbol.
+  /// In that case, there is one transition to EOF. Later, we might encode
+  /// references to all calls to this rule to compute FOLLOW sets for
+  /// error handling.
+  class ANTLR4CPP_PUBLIC RuleStopState final : public ATNState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::RULE_STOP; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    RuleStopState() : ATNState(ATNStateType::RULE_STOP) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleTransition.cpp
new file mode 100755
index 0000000000..f2f7f70729
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleTransition.cpp
@@ -0,0 +1,33 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/RuleStartState.h"
+#include "atn/RuleTransition.h"
+
+using namespace antlr4::atn;
+
+RuleTransition::RuleTransition(RuleStartState *ruleStart, size_t ruleIndex, ATNState *followState)
+  : RuleTransition(ruleStart, ruleIndex, 0, followState) {
+}
+
+RuleTransition::RuleTransition(RuleStartState *ruleStart, size_t ruleIndex, int precedence, ATNState *followState)
+  : Transition(TransitionType::RULE, ruleStart), ruleIndex(ruleIndex), precedence(precedence) {
+  this->followState = followState;
+}
+
+bool RuleTransition::isEpsilon() const {
+  return true;
+}
+
+bool RuleTransition::matches(size_t /*symbol*/, size_t /*minVocabSymbol*/, size_t /*maxVocabSymbol*/) const {
+  return false;
+}
+
+std::string RuleTransition::toString() const {
+  std::stringstream ss;
+  ss << "RULE " << Transition::toString() << " { ruleIndex: " << ruleIndex << ", precedence: " << precedence <<
+    ", followState: " << std::hex << followState << " }";
+  return ss.str();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleTransition.h
new file mode 100755
index 0000000000..943152d09a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/RuleTransition.h
@@ -0,0 +1,42 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/Transition.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC RuleTransition final : public Transition {
+  public:
+    static bool is(const Transition &transition) { return transition.getTransitionType() == TransitionType::RULE; }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    /// Ptr to the rule definition object for this rule ref.
+    const size_t ruleIndex; // no Rule object at runtime
+
+    const int precedence;
+
+    /// What node to begin computations following ref to rule.
+    ATNState *followState;
+
+    /// @deprecated Use
+    /// <seealso cref="#RuleTransition(RuleStartState, size_t, int, ATNState)"/> instead.
+    RuleTransition(RuleStartState *ruleStart, size_t ruleIndex, ATNState *followState);
+
+    RuleTransition(RuleStartState *ruleStart, size_t ruleIndex, int precedence, ATNState *followState);
+    RuleTransition(RuleTransition const&) = delete;
+    RuleTransition& operator=(RuleTransition const&) = delete;
+
+    virtual bool isEpsilon() const override;
+    virtual bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+
+    virtual std::string toString() const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SemanticContext.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SemanticContext.cpp
new file mode 100755
index 0000000000..7d7fe068df
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SemanticContext.cpp
@@ -0,0 +1,418 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include <functional>
+#include <unordered_set>
+
+#include "misc/MurmurHash.h"
+#include "support/Casts.h"
+#include "support/CPPUtils.h"
+#include "support/Arrays.h"
+
+#include "SemanticContext.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+namespace {
+
+  struct SemanticContextHasher final {
+    size_t operator()(const SemanticContext *semanticContext) const {
+      return semanticContext->hashCode();
+    }
+  };
+
+  struct SemanticContextComparer final {
+    bool operator()(const SemanticContext *lhs, const SemanticContext *rhs) const {
+      return *lhs == *rhs;
+    }
+  };
+
+  template <typename Comparer>
+  void insertSemanticContext(const Ref<const SemanticContext> &semanticContext,
+                             std::unordered_set<const SemanticContext*, SemanticContextHasher, SemanticContextComparer> &operandSet,
+                             std::vector<Ref<const SemanticContext>> &operandList,
+                             Ref<const SemanticContext::PrecedencePredicate> &precedencePredicate,
+                             Comparer comparer) {
+    if (semanticContext != nullptr) {
+      if (semanticContext->getContextType() == SemanticContextType::PRECEDENCE) {
+        if (precedencePredicate == nullptr || comparer(downCast<const SemanticContext::PrecedencePredicate*>(semanticContext.get())->precedence, precedencePredicate->precedence)) {
+          precedencePredicate = std::static_pointer_cast<const SemanticContext::PrecedencePredicate>(semanticContext);
+        }
+      } else {
+        auto [existing, inserted] = operandSet.insert(semanticContext.get());
+        if (inserted) {
+          operandList.push_back(semanticContext);
+        }
+      }
+    }
+  }
+
+  template <typename Comparer>
+  void insertSemanticContext(Ref<const SemanticContext> &&semanticContext,
+                             std::unordered_set<const SemanticContext*, SemanticContextHasher, SemanticContextComparer> &operandSet,
+                             std::vector<Ref<const SemanticContext>> &operandList,
+                             Ref<const SemanticContext::PrecedencePredicate> &precedencePredicate,
+                             Comparer comparer) {
+    if (semanticContext != nullptr) {
+      if (semanticContext->getContextType() == SemanticContextType::PRECEDENCE) {
+        if (precedencePredicate == nullptr || comparer(downCast<const SemanticContext::PrecedencePredicate*>(semanticContext.get())->precedence, precedencePredicate->precedence)) {
+          precedencePredicate = std::static_pointer_cast<const SemanticContext::PrecedencePredicate>(std::move(semanticContext));
+        }
+      } else {
+        auto [existing, inserted] = operandSet.insert(semanticContext.get());
+        if (inserted) {
+          operandList.push_back(std::move(semanticContext));
+        }
+      }
+    }
+  }
+
+  size_t predictOperandCapacity(const Ref<const SemanticContext> &x) {
+    switch (x->getContextType()) {
+      case SemanticContextType::AND:
+        return downCast<const SemanticContext::AND&>(*x).getOperands().size();
+      case SemanticContextType::OR:
+        return downCast<const SemanticContext::OR&>(*x).getOperands().size();
+      default:
+        return 1;
+    }
+  }
+
+  size_t predictOperandCapacity(const Ref<const SemanticContext> &a, const Ref<const SemanticContext> &b) {
+    return predictOperandCapacity(a) + predictOperandCapacity(b);
+  }
+
+}
+
+//------------------ Predicate -----------------------------------------------------------------------------------------
+
+SemanticContext::Predicate::Predicate(size_t ruleIndex, size_t predIndex, bool isCtxDependent)
+    : SemanticContext(SemanticContextType::PREDICATE), ruleIndex(ruleIndex), predIndex(predIndex), isCtxDependent(isCtxDependent) {}
+
+bool SemanticContext::Predicate::eval(Recognizer *parser, RuleContext *parserCallStack) const {
+  RuleContext *localctx = nullptr;
+  if (isCtxDependent) {
+    localctx = parserCallStack;
+  }
+  return parser->sempred(localctx, ruleIndex, predIndex);
+}
+
+size_t SemanticContext::Predicate::hashCode() const {
+  size_t hashCode = misc::MurmurHash::initialize();
+  hashCode = misc::MurmurHash::update(hashCode, static_cast<size_t>(getContextType()));
+  hashCode = misc::MurmurHash::update(hashCode, ruleIndex);
+  hashCode = misc::MurmurHash::update(hashCode, predIndex);
+  hashCode = misc::MurmurHash::update(hashCode, isCtxDependent ? 1 : 0);
+  hashCode = misc::MurmurHash::finish(hashCode, 4);
+  return hashCode;
+}
+
+bool SemanticContext::Predicate::equals(const SemanticContext &other) const {
+  if (this == &other) {
+    return true;
+  }
+  if (getContextType() != other.getContextType()) {
+    return false;
+  }
+  const Predicate &p = downCast<const Predicate&>(other);
+  return ruleIndex == p.ruleIndex && predIndex == p.predIndex && isCtxDependent == p.isCtxDependent;
+}
+
+std::string SemanticContext::Predicate::toString() const {
+  return std::string("{") + std::to_string(ruleIndex) + std::string(":") + std::to_string(predIndex) + std::string("}?");
+}
+
+//------------------ PrecedencePredicate -------------------------------------------------------------------------------
+
+SemanticContext::PrecedencePredicate::PrecedencePredicate(int precedence) : SemanticContext(SemanticContextType::PRECEDENCE), precedence(precedence) {}
+
+bool SemanticContext::PrecedencePredicate::eval(Recognizer *parser, RuleContext *parserCallStack) const {
+  return parser->precpred(parserCallStack, precedence);
+}
+
+Ref<const SemanticContext> SemanticContext::PrecedencePredicate::evalPrecedence(Recognizer *parser,
+  RuleContext *parserCallStack) const {
+  if (parser->precpred(parserCallStack, precedence)) {
+    return SemanticContext::Empty::Instance;
+  }
+  return nullptr;
+}
+
+size_t SemanticContext::PrecedencePredicate::hashCode() const {
+  size_t hashCode = misc::MurmurHash::initialize();
+  hashCode = misc::MurmurHash::update(hashCode, static_cast<size_t>(getContextType()));
+  hashCode = misc::MurmurHash::update(hashCode, static_cast<size_t>(precedence));
+  return misc::MurmurHash::finish(hashCode, 2);
+}
+
+bool SemanticContext::PrecedencePredicate::equals(const SemanticContext &other) const {
+  if (this == &other) {
+    return true;
+  }
+  if (getContextType() != other.getContextType()) {
+    return false;
+  }
+  const PrecedencePredicate &predicate = downCast<const PrecedencePredicate&>(other);
+  return precedence == predicate.precedence;
+}
+
+std::string SemanticContext::PrecedencePredicate::toString() const {
+  return "{" + std::to_string(precedence) + ">=prec}?";
+}
+
+//------------------ AND -----------------------------------------------------------------------------------------------
+
+SemanticContext::AND::AND(Ref<const SemanticContext> a, Ref<const SemanticContext> b) : Operator(SemanticContextType::AND) {
+  std::unordered_set<const SemanticContext*, SemanticContextHasher, SemanticContextComparer> operands;
+  Ref<const SemanticContext::PrecedencePredicate> precedencePredicate;
+
+  _opnds.reserve(predictOperandCapacity(a, b) + 1);
+
+  if (a->getContextType() == SemanticContextType::AND) {
+    for (const auto &operand : downCast<const AND*>(a.get())->getOperands()) {
+      insertSemanticContext(operand, operands, _opnds, precedencePredicate, std::less<int>{});
+    }
+  } else {
+    insertSemanticContext(std::move(a), operands, _opnds, precedencePredicate, std::less<int>{});
+  }
+
+  if (b->getContextType() == SemanticContextType::AND) {
+    for (const auto &operand : downCast<const AND*>(b.get())->getOperands()) {
+      insertSemanticContext(operand, operands, _opnds, precedencePredicate, std::less<int>{});
+    }
+  } else {
+    insertSemanticContext(std::move(b), operands, _opnds, precedencePredicate, std::less<int>{});
+  }
+
+  if (precedencePredicate != nullptr) {
+    // interested in the transition with the lowest precedence
+    auto [existing, inserted] = operands.insert(precedencePredicate.get());
+    if (inserted) {
+      _opnds.push_back(std::move(precedencePredicate));
+    }
+  }
+}
+
+const std::vector<Ref<const SemanticContext>>& SemanticContext::AND::getOperands() const {
+  return _opnds;
+}
+
+bool SemanticContext::AND::equals(const SemanticContext &other) const {
+  if (this == &other) {
+    return true;
+  }
+  if (getContextType() != other.getContextType()) {
+    return false;
+  }
+  const AND &context = downCast<const AND&>(other);
+  return Arrays::equals(getOperands(), context.getOperands());
+}
+
+size_t SemanticContext::AND::hashCode() const {
+  size_t hash = misc::MurmurHash::initialize();
+  hash = misc::MurmurHash::update(hash, static_cast<size_t>(getContextType()));
+  return misc::MurmurHash::hashCode(getOperands(), hash);
+}
+
+bool SemanticContext::AND::eval(Recognizer *parser, RuleContext *parserCallStack) const {
+  for (const auto &opnd : getOperands()) {
+    if (!opnd->eval(parser, parserCallStack)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+Ref<const SemanticContext> SemanticContext::AND::evalPrecedence(Recognizer *parser, RuleContext *parserCallStack) const {
+  bool differs = false;
+  std::vector<Ref<const SemanticContext>> operands;
+  for (const auto &context : getOperands()) {
+    auto evaluated = context->evalPrecedence(parser, parserCallStack);
+    differs |= (evaluated != context);
+    if (evaluated == nullptr) {
+      // The AND context is false if any element is false.
+      return nullptr;
+    }
+    if (evaluated != Empty::Instance) {
+      // Reduce the result by skipping true elements.
+      operands.push_back(std::move(evaluated));
+    }
+  }
+
+  if (!differs) {
+    return shared_from_this();
+  }
+
+  if (operands.empty()) {
+    // All elements were true, so the AND context is true.
+    return Empty::Instance;
+  }
+
+  Ref<const SemanticContext> result = std::move(operands[0]);
+  for (size_t i = 1; i < operands.size(); ++i) {
+    result = SemanticContext::And(std::move(result), std::move(operands[i]));
+  }
+
+  return result;
+}
+
+std::string SemanticContext::AND::toString() const {
+  std::string tmp;
+  for (const auto &var : getOperands()) {
+    tmp += var->toString() + " && ";
+  }
+  return tmp;
+}
+
+//------------------ OR ------------------------------------------------------------------------------------------------
+
+SemanticContext::OR::OR(Ref<const SemanticContext> a, Ref<const SemanticContext> b) : Operator(SemanticContextType::OR) {
+  std::unordered_set<const SemanticContext*, SemanticContextHasher, SemanticContextComparer> operands;
+  Ref<const SemanticContext::PrecedencePredicate> precedencePredicate;
+
+  _opnds.reserve(predictOperandCapacity(a, b) + 1);
+
+  if (a->getContextType() == SemanticContextType::OR) {
+    for (const auto &operand : downCast<const OR*>(a.get())->getOperands()) {
+      insertSemanticContext(operand, operands, _opnds, precedencePredicate, std::greater<int>{});
+    }
+  } else {
+    insertSemanticContext(std::move(a), operands, _opnds, precedencePredicate, std::greater<int>{});
+  }
+
+  if (b->getContextType() == SemanticContextType::OR) {
+    for (const auto &operand : downCast<const OR*>(b.get())->getOperands()) {
+      insertSemanticContext(operand, operands, _opnds, precedencePredicate, std::greater<int>{});
+    }
+  } else {
+    insertSemanticContext(std::move(b), operands, _opnds, precedencePredicate, std::greater<int>{});
+  }
+
+  if (precedencePredicate != nullptr) {
+    // interested in the transition with the highest precedence
+    auto [existing, inserted] = operands.insert(precedencePredicate.get());
+    if (inserted) {
+      _opnds.push_back(std::move(precedencePredicate));
+    }
+  }
+}
+
+const std::vector<Ref<const SemanticContext>>& SemanticContext::OR::getOperands() const {
+  return _opnds;
+}
+
+bool SemanticContext::OR::equals(const SemanticContext &other) const {
+  if (this == &other) {
+    return true;
+  }
+  if (getContextType() != other.getContextType()) {
+    return false;
+  }
+  const OR &context = downCast<const OR&>(other);
+  return Arrays::equals(getOperands(), context.getOperands());
+}
+
+size_t SemanticContext::OR::hashCode() const {
+  size_t hash = misc::MurmurHash::initialize();
+  hash = misc::MurmurHash::update(hash, static_cast<size_t>(getContextType()));
+  return misc::MurmurHash::hashCode(getOperands(), hash);
+}
+
+bool SemanticContext::OR::eval(Recognizer *parser, RuleContext *parserCallStack) const {
+  for (const auto &opnd : getOperands()) {
+    if (opnd->eval(parser, parserCallStack)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+Ref<const SemanticContext> SemanticContext::OR::evalPrecedence(Recognizer *parser, RuleContext *parserCallStack) const {
+  bool differs = false;
+  std::vector<Ref<const SemanticContext>> operands;
+  for (const auto &context : getOperands()) {
+    auto evaluated = context->evalPrecedence(parser, parserCallStack);
+    differs |= (evaluated != context);
+    if (evaluated == Empty::Instance) {
+      // The OR context is true if any element is true.
+      return Empty::Instance;
+    }
+    if (evaluated != nullptr) {
+      // Reduce the result by skipping false elements.
+      operands.push_back(std::move(evaluated));
+    }
+  }
+
+  if (!differs) {
+    return shared_from_this();
+  }
+
+  if (operands.empty()) {
+    // All elements were false, so the OR context is false.
+    return nullptr;
+  }
+
+  Ref<const SemanticContext> result = std::move(operands[0]);
+  for (size_t i = 1; i < operands.size(); ++i) {
+    result = SemanticContext::Or(std::move(result), std::move(operands[i]));
+  }
+
+  return result;
+}
+
+std::string SemanticContext::OR::toString() const {
+  std::string tmp;
+  for(const auto &var : getOperands()) {
+    tmp += var->toString() + " || ";
+  }
+  return tmp;
+}
+
+//------------------ SemanticContext -----------------------------------------------------------------------------------
+
+const Ref<const SemanticContext> SemanticContext::Empty::Instance = std::make_shared<Predicate>(INVALID_INDEX, INVALID_INDEX, false);
+
+Ref<const SemanticContext> SemanticContext::evalPrecedence(Recognizer * /*parser*/, RuleContext * /*parserCallStack*/) const {
+  return shared_from_this();
+}
+
+Ref<const SemanticContext> SemanticContext::And(Ref<const SemanticContext> a, Ref<const SemanticContext> b) {
+  if (!a || a == Empty::Instance) {
+    return b;
+  }
+
+  if (!b || b == Empty::Instance) {
+    return a;
+  }
+
+  Ref<AND> result = std::make_shared<AND>(std::move(a), std::move(b));
+  if (result->getOperands().size() == 1) {
+    return result->getOperands()[0];
+  }
+
+  return result;
+}
+
+Ref<const SemanticContext> SemanticContext::Or(Ref<const SemanticContext> a, Ref<const SemanticContext> b) {
+  if (!a) {
+    return b;
+  }
+  if (!b) {
+    return a;
+  }
+
+  if (a == Empty::Instance || b == Empty::Instance) {
+    return Empty::Instance;
+  }
+
+  Ref<OR> result = std::make_shared<OR>(std::move(a), std::move(b));
+  if (result->getOperands().size() == 1) {
+    return result->getOperands()[0];
+  }
+
+  return result;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SemanticContext.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SemanticContext.h
new file mode 100755
index 0000000000..8116fc0b56
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SemanticContext.h
@@ -0,0 +1,237 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Recognizer.h"
+#include "support/CPPUtils.h"
+#include "atn/SemanticContextType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// A tree structure used to record the semantic context in which
+  ///  an ATN configuration is valid.  It's either a single predicate,
+  ///  a conjunction "p1 && p2", or a sum of products "p1||p2".
+  ///
+  ///  I have scoped the AND, OR, and Predicate subclasses of
+  ///  SemanticContext within the scope of this outer class.
+  class ANTLR4CPP_PUBLIC SemanticContext : public std::enable_shared_from_this<SemanticContext> {
+  public:
+    virtual ~SemanticContext() = default;
+
+    SemanticContextType getContextType() const { return _contextType; }
+
+    /// <summary>
+    /// For context independent predicates, we evaluate them without a local
+    /// context (i.e., null context). That way, we can evaluate them without
+    /// having to create proper rule-specific context during prediction (as
+    /// opposed to the parser, which creates them naturally). In a practical
+    /// sense, this avoids a cast exception from RuleContext to myruleContext.
+    /// <p/>
+    /// For context dependent predicates, we must pass in a local context so that
+    /// references such as $arg evaluate properly as _localctx.arg. We only
+    /// capture context dependent predicates in the context in which we begin
+    /// prediction, so we passed in the outer context here in case of context
+    /// dependent predicate evaluation.
+    /// </summary>
+    virtual bool eval(Recognizer *parser, RuleContext *parserCallStack) const = 0;
+
+    /**
+     * Evaluate the precedence predicates for the context and reduce the result.
+     *
+     * @param parser The parser instance.
+     * @param parserCallStack
+     * @return The simplified semantic context after precedence predicates are
+     * evaluated, which will be one of the following values.
+     * <ul>
+     * <li>{@link #NONE}: if the predicate simplifies to {@code true} after
+     * precedence predicates are evaluated.</li>
+     * <li>{@code null}: if the predicate simplifies to {@code false} after
+     * precedence predicates are evaluated.</li>
+     * <li>{@code this}: if the semantic context is not changed as a result of
+     * precedence predicate evaluation.</li>
+     * <li>A non-{@code null} {@link SemanticContext}: the new simplified
+     * semantic context after precedence predicates are evaluated.</li>
+     * </ul>
+     */
+    virtual Ref<const SemanticContext> evalPrecedence(Recognizer *parser, RuleContext *parserCallStack) const;
+
+    virtual size_t hashCode() const = 0;
+
+    virtual bool equals(const SemanticContext &other) const = 0;
+
+    virtual std::string toString() const = 0;
+
+    static Ref<const SemanticContext> And(Ref<const SemanticContext> a, Ref<const SemanticContext> b);
+
+    /// See also: ParserATNSimulator::getPredsForAmbigAlts.
+    static Ref<const SemanticContext> Or(Ref<const SemanticContext> a, Ref<const SemanticContext> b);
+
+    class Empty;
+    class Predicate;
+    class PrecedencePredicate;
+    class Operator;
+    class AND;
+    class OR;
+
+  protected:
+    explicit SemanticContext(SemanticContextType contextType) : _contextType(contextType) {}
+
+  private:
+    const SemanticContextType _contextType;
+  };
+
+  inline bool operator==(const SemanticContext &lhs, const SemanticContext &rhs) {
+    return lhs.equals(rhs);
+  }
+
+  inline bool operator!=(const SemanticContext &lhs, const SemanticContext &rhs) {
+    return !operator==(lhs, rhs);
+  }
+
+  class ANTLR4CPP_PUBLIC SemanticContext::Empty : public SemanticContext{
+  public:
+    /**
+     * The default {@link SemanticContext}, which is semantically equivalent to
+     * a predicate of the form {@code {true}?}.
+     */
+    static const Ref<const SemanticContext> Instance;
+  };
+
+  class ANTLR4CPP_PUBLIC SemanticContext::Predicate final : public SemanticContext {
+  public:
+    static bool is(const SemanticContext &semanticContext) { return semanticContext.getContextType() == SemanticContextType::PREDICATE; }
+
+    static bool is(const SemanticContext *semanticContext) { return semanticContext != nullptr && is(*semanticContext); }
+
+    const size_t ruleIndex;
+    const size_t predIndex;
+    const bool isCtxDependent; // e.g., $i ref in pred
+
+    Predicate(size_t ruleIndex, size_t predIndex, bool isCtxDependent);
+
+    bool eval(Recognizer *parser, RuleContext *parserCallStack) const override;
+    size_t hashCode() const override;
+    bool equals(const SemanticContext &other) const override;
+    std::string toString() const override;
+  };
+
+  class ANTLR4CPP_PUBLIC SemanticContext::PrecedencePredicate final : public SemanticContext {
+  public:
+    static bool is(const SemanticContext &semanticContext) { return semanticContext.getContextType() == SemanticContextType::PRECEDENCE; }
+
+    static bool is(const SemanticContext *semanticContext) { return semanticContext != nullptr && is(*semanticContext); }
+
+    const int precedence;
+
+    explicit PrecedencePredicate(int precedence);
+
+    bool eval(Recognizer *parser, RuleContext *parserCallStack) const override;
+    Ref<const SemanticContext> evalPrecedence(Recognizer *parser, RuleContext *parserCallStack) const override;
+    size_t hashCode() const override;
+    bool equals(const SemanticContext &other) const override;
+    std::string toString() const override;
+  };
+
+  /**
+   * This is the base class for semantic context "operators", which operate on
+   * a collection of semantic context "operands".
+   *
+   * @since 4.3
+   */
+  class ANTLR4CPP_PUBLIC SemanticContext::Operator : public SemanticContext {
+  public:
+    static bool is(const SemanticContext &semanticContext) {
+      const auto contextType = semanticContext.getContextType();
+      return contextType == SemanticContextType::AND || contextType == SemanticContextType::OR;
+    }
+
+    static bool is(const SemanticContext *semanticContext) { return semanticContext != nullptr && is(*semanticContext); }
+
+    /**
+     * Gets the operands for the semantic context operator.
+     *
+     * @return a collection of {@link SemanticContext} operands for the
+     * operator.
+     *
+     * @since 4.3
+     */
+
+    virtual const std::vector<Ref<const SemanticContext>>& getOperands() const = 0;
+
+  protected:
+    using SemanticContext::SemanticContext;
+  };
+
+  /**
+   * A semantic context which is true whenever none of the contained contexts
+   * is false.
+   */
+  class ANTLR4CPP_PUBLIC SemanticContext::AND final : public SemanticContext::Operator {
+  public:
+    static bool is(const SemanticContext &semanticContext) { return semanticContext.getContextType() == SemanticContextType::AND; }
+
+    static bool is(const SemanticContext *semanticContext) { return semanticContext != nullptr && is(*semanticContext); }
+
+    AND(Ref<const SemanticContext> a, Ref<const SemanticContext> b) ;
+
+    const std::vector<Ref<const SemanticContext>>& getOperands() const override;
+
+    /**
+     * The evaluation of predicates by this context is short-circuiting, but
+     * unordered.</p>
+     */
+    bool eval(Recognizer *parser, RuleContext *parserCallStack) const override;
+    Ref<const SemanticContext> evalPrecedence(Recognizer *parser, RuleContext *parserCallStack) const override;
+    size_t hashCode() const override;
+    bool equals(const SemanticContext &other) const override;
+    std::string toString() const override;
+
+  private:
+    std::vector<Ref<const SemanticContext>> _opnds;
+  };
+
+  /**
+   * A semantic context which is true whenever at least one of the contained
+   * contexts is true.
+   */
+  class ANTLR4CPP_PUBLIC SemanticContext::OR final : public SemanticContext::Operator {
+  public:
+    static bool is(const SemanticContext &semanticContext) { return semanticContext.getContextType() == SemanticContextType::OR; }
+
+    static bool is(const SemanticContext *semanticContext) { return semanticContext != nullptr && is(*semanticContext); }
+
+    OR(Ref<const SemanticContext> a, Ref<const SemanticContext> b);
+
+    const std::vector<Ref<const SemanticContext>>& getOperands() const override;
+
+    /**
+     * The evaluation of predicates by this context is short-circuiting, but
+     * unordered.
+     */
+    bool eval(Recognizer *parser, RuleContext *parserCallStack) const override;
+    Ref<const SemanticContext> evalPrecedence(Recognizer *parser, RuleContext *parserCallStack) const override;
+    size_t hashCode() const override;
+    bool equals(const SemanticContext &other) const override;
+    std::string toString() const override;
+
+  private:
+    std::vector<Ref<const SemanticContext>> _opnds;
+  };
+
+}  // namespace atn
+}  // namespace antlr4
+
+namespace std {
+
+  template <>
+  struct hash<::antlr4::atn::SemanticContext> {
+    size_t operator()(const ::antlr4::atn::SemanticContext &semanticContext) const {
+      return semanticContext.hashCode();
+    }
+  };
+
+}  // namespace std
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SemanticContextType.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SemanticContextType.h
new file mode 100644
index 0000000000..bca6e421d2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SemanticContextType.h
@@ -0,0 +1,23 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cstddef>
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+  enum class SemanticContextType : size_t {
+    PREDICATE = 1,
+    PRECEDENCE = 2,
+    AND = 3,
+    OR = 4,
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SerializedATNView.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SerializedATNView.h
new file mode 100644
index 0000000000..a723589bc3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SerializedATNView.h
@@ -0,0 +1,101 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cstddef>
+#include <cstdint>
+#include <cstring>
+#include <iterator>
+#include <vector>
+
+#include "antlr4-common.h"
+#include "misc/MurmurHash.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC SerializedATNView final {
+  public:
+    using value_type = int32_t;
+    using size_type = size_t;
+    using difference_type = ptrdiff_t;
+    using reference = int32_t&;
+    using const_reference = const int32_t&;
+    using pointer = int32_t*;
+    using const_pointer = const int32_t*;
+    using iterator = const_pointer;
+    using const_iterator = const_pointer;
+    using reverse_iterator = std::reverse_iterator<iterator>;
+    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+
+    SerializedATNView() = default;
+
+    SerializedATNView(const_pointer data, size_type size) : _data(data), _size(size) {}
+
+    SerializedATNView(const std::vector<int32_t> &serializedATN) : _data(serializedATN.data()), _size(serializedATN.size()) {}
+
+    SerializedATNView(const SerializedATNView&) = default;
+
+    SerializedATNView& operator=(const SerializedATNView&) = default;
+
+    const_iterator begin() const { return data(); }
+
+    const_iterator cbegin() const { return data(); }
+
+    const_iterator end() const { return data() + size(); }
+
+    const_iterator cend() const { return data() + size(); }
+
+    const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); }
+
+    const_reverse_iterator crbegin() const { return const_reverse_iterator(cend()); }
+
+    const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
+
+    const_reverse_iterator crend() const { return const_reverse_iterator(cbegin()); }
+
+    bool empty() const { return size() == 0; }
+
+    const_pointer data() const { return _data; }
+
+    size_type size() const { return _size; }
+
+    size_type size_bytes() const { return size() * sizeof(value_type); }
+
+    const_reference operator[](size_type index) const { return _data[index]; }
+
+  private:
+    const_pointer _data = nullptr;
+    size_type _size = 0;
+  };
+
+  inline bool operator==(const SerializedATNView &lhs, const SerializedATNView &rhs) {
+    return (lhs.data() == rhs.data() && lhs.size() == rhs.size()) ||
+           (lhs.size() == rhs.size() && std::memcmp(lhs.data(), rhs.data(), lhs.size_bytes()) == 0);
+  }
+
+  inline bool operator!=(const SerializedATNView &lhs, const SerializedATNView &rhs) {
+    return !operator==(lhs, rhs);
+  }
+
+  inline bool operator<(const SerializedATNView &lhs, const SerializedATNView &rhs) {
+    int diff = std::memcmp(lhs.data(), rhs.data(), std::min(lhs.size_bytes(), rhs.size_bytes()));
+    return diff < 0 || (diff == 0 && lhs.size() < rhs.size());
+  }
+
+}  // namespace atn
+}  // namespace antlr4
+
+namespace std {
+
+  template <>
+  struct hash<::antlr4::atn::SerializedATNView> {
+    size_t operator()(const ::antlr4::atn::SerializedATNView &serializedATNView) const {
+      return ::antlr4::misc::MurmurHash::hashCode(serializedATNView.data(), serializedATNView.size());
+    }
+  };
+
+}  // namespace std
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SetTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SetTransition.cpp
new file mode 100755
index 0000000000..69395832e8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SetTransition.cpp
@@ -0,0 +1,28 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Token.h"
+#include "misc/IntervalSet.h"
+
+#include "atn/SetTransition.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+
+SetTransition::SetTransition(TransitionType transitionType, ATNState *target, misc::IntervalSet aSet)
+  : Transition(transitionType, target), set(aSet.isEmpty() ? misc::IntervalSet::of(Token::INVALID_TYPE) : std::move(aSet)) {
+}
+
+misc::IntervalSet SetTransition::label() const {
+  return set;
+}
+
+bool SetTransition::matches(size_t symbol, size_t /*minVocabSymbol*/, size_t /*maxVocabSymbol*/) const {
+  return set.contains(symbol);
+}
+
+std::string SetTransition::toString() const {
+  return "SET " + Transition::toString() + " { set: " + set.toString() + "}";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SetTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SetTransition.h
new file mode 100755
index 0000000000..cc514c3d01
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SetTransition.h
@@ -0,0 +1,38 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/Transition.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// A transition containing a set of values. </summary>
+  class ANTLR4CPP_PUBLIC SetTransition : public Transition {
+  public:
+    static bool is(const Transition &transition) {
+      const auto transitionType = transition.getTransitionType();
+      return transitionType == TransitionType::SET || transitionType == TransitionType::NOT_SET;
+    }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    const misc::IntervalSet set;
+
+    SetTransition(ATNState *target, misc::IntervalSet set) : SetTransition(TransitionType::SET, target, std::move(set)) {}
+
+    virtual misc::IntervalSet label() const override;
+    virtual bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+
+    virtual std::string toString() const override;
+
+  protected:
+    SetTransition(TransitionType transitionType, ATNState *target, misc::IntervalSet set);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SingletonPredictionContext.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SingletonPredictionContext.cpp
new file mode 100755
index 0000000000..3dc5464d24
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SingletonPredictionContext.cpp
@@ -0,0 +1,79 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/SingletonPredictionContext.h"
+
+#include "support/Casts.h"
+#include "misc/MurmurHash.h"
+#include "atn/HashUtils.h"
+
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+SingletonPredictionContext::SingletonPredictionContext(Ref<const PredictionContext> parent, size_t returnState)
+    : PredictionContext(PredictionContextType::SINGLETON), parent(std::move(parent)), returnState(returnState) {
+  assert(returnState != ATNState::INVALID_STATE_NUMBER);
+}
+
+Ref<const SingletonPredictionContext> SingletonPredictionContext::create(Ref<const PredictionContext> parent, size_t returnState) {
+  if (returnState == EMPTY_RETURN_STATE && parent == nullptr) {
+    // someone can pass in the bits of an array ctx that mean $
+    return std::dynamic_pointer_cast<const SingletonPredictionContext>(EMPTY);
+  }
+  return std::make_shared<SingletonPredictionContext>(std::move(parent), returnState);
+}
+
+bool SingletonPredictionContext::isEmpty() const {
+  return parent == nullptr && returnState == EMPTY_RETURN_STATE;
+}
+
+size_t SingletonPredictionContext::size() const {
+  return 1;
+}
+
+const Ref<const PredictionContext>& SingletonPredictionContext::getParent(size_t index) const {
+  assert(index == 0);
+  static_cast<void>(index);
+  return parent;
+}
+
+size_t SingletonPredictionContext::getReturnState(size_t index) const {
+  assert(index == 0);
+  static_cast<void>(index);
+  return returnState;
+}
+
+size_t SingletonPredictionContext::hashCodeImpl() const {
+  size_t hash = misc::MurmurHash::initialize();
+  hash = misc::MurmurHash::update(hash, static_cast<size_t>(getContextType()));
+  hash = misc::MurmurHash::update(hash, parent);
+  hash = misc::MurmurHash::update(hash, returnState);
+  return misc::MurmurHash::finish(hash, 3);
+}
+
+bool SingletonPredictionContext::equals(const PredictionContext &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  if (getContextType() != other.getContextType()) {
+    return false;
+  }
+  const auto &singleton = downCast<const SingletonPredictionContext&>(other);
+  return returnState == singleton.returnState &&
+         cachedHashCodeEqual(cachedHashCode(), singleton.cachedHashCode()) &&
+         (parent == singleton.parent || (parent != nullptr && singleton.parent != nullptr && *parent == *singleton.parent));
+}
+
+std::string SingletonPredictionContext::toString() const {
+  //std::string up = !parent.expired() ? parent.lock()->toString() : "";
+  std::string up = parent != nullptr ? parent->toString() : "";
+  if (up.length() == 0) {
+    if (returnState == EMPTY_RETURN_STATE) {
+      return "$";
+    }
+    return std::to_string(returnState);
+  }
+  return std::to_string(returnState) + " " + up;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SingletonPredictionContext.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SingletonPredictionContext.h
new file mode 100755
index 0000000000..646a6fddcc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/SingletonPredictionContext.h
@@ -0,0 +1,43 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/PredictionContext.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC SingletonPredictionContext final : public PredictionContext {
+  public:
+    static bool is(const PredictionContext &predictionContext) { return predictionContext.getContextType() == PredictionContextType::SINGLETON; }
+
+    static bool is(const PredictionContext *predictionContext) { return predictionContext != nullptr && is(*predictionContext); }
+
+    static Ref<const SingletonPredictionContext> create(Ref<const PredictionContext> parent, size_t returnState);
+
+    // Usually a parent is linked via a weak ptr. Not so here as we have kinda reverse reference chain.
+    // There are no child contexts stored here and often the parent context is left dangling when it's
+    // owning ATNState is released. In order to avoid having this context released as well (leaving all other contexts
+    // which got this one as parent with a null reference) we use a shared_ptr here instead, to keep those left alone
+    // parent contexts alive.
+    const Ref<const PredictionContext> parent;
+    const size_t returnState;
+
+    SingletonPredictionContext(Ref<const PredictionContext> parent, size_t returnState);
+
+    bool isEmpty() const override;
+    size_t size() const override;
+    const Ref<const PredictionContext>& getParent(size_t index) const override;
+    size_t getReturnState(size_t index) const override;
+    bool equals(const PredictionContext &other) const override;
+    std::string toString() const override;
+
+  protected:
+    size_t hashCodeImpl() const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarBlockStartState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarBlockStartState.h
new file mode 100755
index 0000000000..a162631dec
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarBlockStartState.h
@@ -0,0 +1,24 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/BlockStartState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// The block that begins a closure loop.
+  class ANTLR4CPP_PUBLIC StarBlockStartState final : public BlockStartState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::STAR_BLOCK_START; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    StarBlockStartState() : BlockStartState(ATNStateType::STAR_BLOCK_START) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarLoopEntryState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarLoopEntryState.h
new file mode 100755
index 0000000000..c3f47b8f70
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarLoopEntryState.h
@@ -0,0 +1,37 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC StarLoopEntryState final : public DecisionState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::STAR_LOOP_ENTRY; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    /**
+     * Indicates whether this state can benefit from a precedence DFA during SLL
+     * decision making.
+     *
+     * <p>This is a computed property that is calculated during ATN deserialization
+     * and stored for use in {@link ParserATNSimulator} and
+     * {@link ParserInterpreter}.</p>
+     *
+     * @see DFA#isPrecedenceDfa()
+     */
+    bool isPrecedenceDecision = false;
+
+    StarLoopbackState *loopBackState = nullptr;
+
+    StarLoopEntryState() : DecisionState(ATNStateType::STAR_LOOP_ENTRY) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarLoopbackState.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarLoopbackState.cpp
new file mode 100755
index 0000000000..40d05e699b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarLoopbackState.cpp
@@ -0,0 +1,19 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/StarLoopEntryState.h"
+#include "atn/Transition.h"
+#include "support/Casts.h"
+
+#include "atn/StarLoopbackState.h"
+
+using namespace antlr4::atn;
+
+StarLoopEntryState *StarLoopbackState::getLoopEntryState() const {
+  if (transitions[0]->target != nullptr && transitions[0]->target->getStateType() == ATNStateType::STAR_LOOP_ENTRY) {
+    return antlrcpp::downCast<StarLoopEntryState*>(transitions[0]->target);
+  }
+  return nullptr;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarLoopbackState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarLoopbackState.h
new file mode 100755
index 0000000000..0780b4c25d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/StarLoopbackState.h
@@ -0,0 +1,25 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/ATNState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC StarLoopbackState final : public ATNState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::STAR_LOOP_BACK; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    StarLoopbackState() : ATNState(ATNStateType::STAR_LOOP_BACK) {}
+
+    StarLoopEntryState *getLoopEntryState() const;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/TokensStartState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/TokensStartState.h
new file mode 100755
index 0000000000..e1d043e78f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/TokensStartState.h
@@ -0,0 +1,24 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/DecisionState.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// The Tokens rule start state linking to each lexer rule start state.
+  class ANTLR4CPP_PUBLIC TokensStartState final : public DecisionState {
+  public:
+    static bool is(const ATNState &atnState) { return atnState.getStateType() == ATNStateType::TOKEN_START; }
+
+    static bool is(const ATNState *atnState) { return atnState != nullptr && is(*atnState); }
+
+    TokensStartState() : DecisionState(ATNStateType::TOKEN_START) {}
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/Transition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/Transition.cpp
new file mode 100755
index 0000000000..da9b7fd4e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/Transition.cpp
@@ -0,0 +1,36 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Exceptions.h"
+#include "support/Arrays.h"
+
+#include "atn/Transition.h"
+
+using namespace antlr4;
+using namespace antlr4::atn;
+using namespace antlrcpp;
+
+Transition::Transition(TransitionType transitionType, ATNState *target) : _transitionType(transitionType) {
+  if (target == nullptr) {
+    throw NullPointerException("target cannot be null.");
+  }
+
+  this->target = target;
+}
+
+bool Transition::isEpsilon() const {
+  return false;
+}
+
+misc::IntervalSet Transition::label() const {
+  return misc::IntervalSet::EMPTY_SET;
+}
+
+std::string Transition::toString() const {
+  std::stringstream ss;
+  ss << "(Transition " << std::hex << this << ", target: " << std::hex << target << ')';
+
+  return ss.str();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/Transition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/Transition.h
new file mode 100755
index 0000000000..72db7512eb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/Transition.h
@@ -0,0 +1,65 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "misc/IntervalSet.h"
+#include "atn/TransitionType.h"
+
+namespace antlr4 {
+namespace atn {
+
+  /// <summary>
+  /// An ATN transition between any two ATN states.  Subclasses define
+  ///  atom, set, epsilon, action, predicate, rule transitions.
+  /// <p/>
+  ///  This is a one way link.  It emanates from a state (usually via a list of
+  ///  transitions) and has a target state.
+  /// <p/>
+  ///  Since we never have to change the ATN transitions once we construct it,
+  ///  we can fix these transitions as specific classes. The DFA transitions
+  ///  on the other hand need to update the labels as it adds transitions to
+  ///  the states. We'll use the term Edge for the DFA to distinguish them from
+  ///  ATN transitions.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC Transition {
+  public:
+    /// The target of this transition.
+    // ml: this is a reference into the ATN.
+    ATNState *target;
+
+    virtual ~Transition() = default;
+
+    TransitionType getTransitionType() const { return _transitionType; }
+
+    /**
+     * Determines if the transition is an "epsilon" transition.
+     *
+     * <p>The default implementation returns {@code false}.</p>
+     *
+     * @return {@code true} if traversing this transition in the ATN does not
+     * consume an input symbol; otherwise, {@code false} if traversing this
+     * transition consumes (matches) an input symbol.
+     */
+    virtual bool isEpsilon() const;
+    virtual misc::IntervalSet label() const;
+    virtual bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const = 0;
+
+    virtual std::string toString() const;
+
+    Transition(Transition const&) = delete;
+    Transition& operator=(Transition const&) = delete;
+
+  protected:
+    Transition(TransitionType transitionType, ATNState *target);
+
+  private:
+    const TransitionType _transitionType;
+  };
+
+  using ConstTransitionPtr = std::unique_ptr<const Transition>;
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/TransitionType.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/TransitionType.cpp
new file mode 100644
index 0000000000..78769b2ada
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/TransitionType.cpp
@@ -0,0 +1,27 @@
+#include "atn/TransitionType.h"
+
+std::string antlr4::atn::transitionTypeName(TransitionType transitionType) {
+  switch (transitionType) {
+    case TransitionType::EPSILON:
+      return "EPSILON";
+    case TransitionType::RANGE:
+      return "RANGE";
+    case TransitionType::RULE:
+      return "RULE";
+    case TransitionType::PREDICATE:
+      return "PREDICATE";
+    case TransitionType::ATOM:
+      return "ATOM";
+    case TransitionType::ACTION:
+      return "ACTION";
+    case TransitionType::SET:
+      return "SET";
+    case TransitionType::NOT_SET:
+      return "NOT_SET";
+    case TransitionType::WILDCARD:
+      return "WILDCARD";
+    case TransitionType::PRECEDENCE:
+      return "PRECEDENCE";
+  }
+  return "UNKNOWN";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/TransitionType.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/TransitionType.h
new file mode 100644
index 0000000000..d5d5f3bd97
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/TransitionType.h
@@ -0,0 +1,33 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cstddef>
+#include <string>
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace atn {
+
+  // Constants for transition serialization.
+  enum class TransitionType : size_t {
+    EPSILON = 1,
+    RANGE = 2,
+    RULE = 3,
+    PREDICATE = 4, // e.g., {isType(input.LT(1))}?
+    ATOM = 5,
+    ACTION = 6,
+    SET = 7, // ~(A|B) or ~atom, wildcard, which convert to next 2
+    NOT_SET = 8,
+    WILDCARD = 9,
+    PRECEDENCE = 10,
+  };
+
+  ANTLR4CPP_PUBLIC std::string transitionTypeName(TransitionType transitionType);
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/WildcardTransition.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/WildcardTransition.cpp
new file mode 100755
index 0000000000..9614815e6f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/WildcardTransition.cpp
@@ -0,0 +1,21 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATNState.h"
+
+#include "atn/WildcardTransition.h"
+
+using namespace antlr4::atn;
+
+WildcardTransition::WildcardTransition(ATNState *target) : Transition(TransitionType::WILDCARD, target) {
+}
+
+bool WildcardTransition::matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const {
+  return symbol >= minVocabSymbol && symbol <= maxVocabSymbol;
+}
+
+std::string WildcardTransition::toString() const {
+  return "WILDCARD " + Transition::toString() + " {}";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/WildcardTransition.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/WildcardTransition.h
new file mode 100755
index 0000000000..e088e8934f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/atn/WildcardTransition.h
@@ -0,0 +1,27 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "atn/Transition.h"
+
+namespace antlr4 {
+namespace atn {
+
+  class ANTLR4CPP_PUBLIC WildcardTransition final : public Transition {
+  public:
+    static bool is(const Transition &transition) { return transition.getTransitionType() == TransitionType::WILDCARD; }
+
+    static bool is(const Transition *transition) { return transition != nullptr && is(*transition); }
+
+    explicit WildcardTransition(ATNState *target);
+
+    virtual bool matches(size_t symbol, size_t minVocabSymbol, size_t maxVocabSymbol) const override;
+
+    virtual std::string toString() const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFA.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFA.cpp
new file mode 100755
index 0000000000..ef5b07c5ea
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFA.cpp
@@ -0,0 +1,115 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "dfa/DFASerializer.h"
+#include "dfa/LexerDFASerializer.h"
+#include "support/CPPUtils.h"
+#include "atn/StarLoopEntryState.h"
+#include "atn/ATNConfigSet.h"
+#include "support/Casts.h"
+
+#include "dfa/DFA.h"
+
+using namespace antlr4;
+using namespace antlr4::dfa;
+using namespace antlrcpp;
+
+DFA::DFA(atn::DecisionState *atnStartState) : DFA(atnStartState, 0) {
+}
+
+DFA::DFA(atn::DecisionState *atnStartState, size_t decision)
+  : atnStartState(atnStartState), s0(nullptr), decision(decision) {
+
+  _precedenceDfa = false;
+  if (atn::StarLoopEntryState::is(atnStartState)) {
+    if (downCast<atn::StarLoopEntryState*>(atnStartState)->isPrecedenceDecision) {
+      _precedenceDfa = true;
+      s0 = new DFAState(std::unique_ptr<atn::ATNConfigSet>(new atn::ATNConfigSet()));
+      s0->isAcceptState = false;
+      s0->requiresFullContext = false;
+    }
+  }
+}
+
+DFA::DFA(DFA &&other) : atnStartState(other.atnStartState), s0(other.s0), decision(other.decision) {
+  // Source states are implicitly cleared by the move.
+  states = std::move(other.states);
+
+  other.atnStartState = nullptr;
+  other.decision = 0;
+  other.s0 = nullptr;
+  _precedenceDfa = other._precedenceDfa;
+  other._precedenceDfa = false;
+}
+
+DFA::~DFA() {
+  bool s0InList = (s0 == nullptr);
+  for (auto *state : states) {
+    if (state == s0)
+      s0InList = true;
+    delete state;
+  }
+
+  if (!s0InList) {
+    delete s0;
+  }
+}
+
+bool DFA::isPrecedenceDfa() const {
+  return _precedenceDfa;
+}
+
+DFAState* DFA::getPrecedenceStartState(int precedence) const {
+  assert(_precedenceDfa); // Only precedence DFAs may contain a precedence start state.
+
+  auto iterator = s0->edges.find(precedence);
+  if (iterator == s0->edges.end())
+    return nullptr;
+
+  return iterator->second;
+}
+
+void DFA::setPrecedenceStartState(int precedence, DFAState *startState) {
+  if (!isPrecedenceDfa()) {
+    throw IllegalStateException("Only precedence DFAs may contain a precedence start state.");
+  }
+
+  if (precedence < 0) {
+    return;
+  }
+
+  s0->edges[precedence] = startState;
+}
+
+std::vector<DFAState *> DFA::getStates() const {
+  std::vector<DFAState *> result;
+  for (auto *state : states)
+    result.push_back(state);
+
+  std::sort(result.begin(), result.end(), [](DFAState *o1, DFAState *o2) -> bool {
+    return o1->stateNumber < o2->stateNumber;
+  });
+
+  return result;
+}
+
+std::string DFA::toString(const Vocabulary &vocabulary) const {
+  if (s0 == nullptr) {
+    return "";
+  }
+
+  DFASerializer serializer(this, vocabulary);
+  return serializer.toString();
+}
+
+std::string DFA::toLexerString() const {
+  if (s0 == nullptr) {
+    return "";
+  }
+  LexerDFASerializer serializer(this);
+
+  return serializer.toString();
+}
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFA.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFA.h
new file mode 100755
index 0000000000..f676655749
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFA.h
@@ -0,0 +1,96 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "dfa/DFAState.h"
+
+namespace antlr4 {
+namespace dfa {
+
+  class ANTLR4CPP_PUBLIC DFA final {
+  private:
+    struct DFAStateHasher final {
+      size_t operator()(const DFAState *dfaState) const {
+        return dfaState->hashCode();
+      }
+    };
+
+    struct DFAStateComparer final {
+      bool operator()(const DFAState *lhs, const DFAState *rhs) const {
+        return lhs == rhs || *lhs == *rhs;
+      }
+    };
+
+  public:
+    /// A set of all DFA states. Use a map so we can get old state back.
+    /// Set only allows you to see if it's there.
+
+    /// From which ATN state did we create this DFA?
+    atn::DecisionState *atnStartState;
+    std::unordered_set<DFAState*, DFAStateHasher, DFAStateComparer> states; // States are owned by this class.
+    DFAState *s0;
+    size_t decision;
+
+    explicit DFA(atn::DecisionState *atnStartState);
+    DFA(atn::DecisionState *atnStartState, size_t decision);
+    DFA(const DFA &other) = delete;
+    DFA(DFA &&other);
+    ~DFA();
+
+    /**
+     * Gets whether this DFA is a precedence DFA. Precedence DFAs use a special
+     * start state {@link #s0} which is not stored in {@link #states}. The
+     * {@link DFAState#edges} array for this start state contains outgoing edges
+     * supplying individual start states corresponding to specific precedence
+     * values.
+     *
+     * @return {@code true} if this is a precedence DFA; otherwise,
+     * {@code false}.
+     * @see Parser#getPrecedence()
+     */
+    bool isPrecedenceDfa() const;
+
+    /**
+     * Get the start state for a specific precedence value.
+     *
+     * @param precedence The current precedence.
+     * @return The start state corresponding to the specified precedence, or
+     * {@code null} if no start state exists for the specified precedence.
+     *
+     * @throws IllegalStateException if this is not a precedence DFA.
+     * @see #isPrecedenceDfa()
+     */
+    DFAState* getPrecedenceStartState(int precedence) const;
+
+    /**
+     * Set the start state for a specific precedence value.
+     *
+     * @param precedence The current precedence.
+     * @param startState The start state corresponding to the specified
+     * precedence.
+     *
+     * @throws IllegalStateException if this is not a precedence DFA.
+     * @see #isPrecedenceDfa()
+     */
+    void setPrecedenceStartState(int precedence, DFAState *startState);
+
+    /// Return a list of all states in this DFA, ordered by state number.
+    std::vector<DFAState *> getStates() const;
+
+    std::string toString(const Vocabulary &vocabulary) const;
+
+    std::string toLexerString() const;
+
+  private:
+    /**
+     * {@code true} if this DFA is for a precedence decision; otherwise,
+     * {@code false}. This is the backing field for {@link #isPrecedenceDfa}.
+     */
+    bool _precedenceDfa;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFASerializer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFASerializer.cpp
new file mode 100755
index 0000000000..50c86c436a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFASerializer.cpp
@@ -0,0 +1,60 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "dfa/DFA.h"
+#include "Vocabulary.h"
+
+#include "dfa/DFASerializer.h"
+
+using namespace antlr4::dfa;
+
+DFASerializer::DFASerializer(const DFA *dfa, const Vocabulary &vocabulary) : _dfa(dfa), _vocabulary(vocabulary) {
+}
+
+std::string DFASerializer::toString() const {
+  if (_dfa->s0 == nullptr) {
+    return "";
+  }
+
+  std::stringstream ss;
+  std::vector<DFAState *> states = _dfa->getStates();
+  for (auto *s : states) {
+    for (size_t i = 0; i < s->edges.size(); i++) {
+      DFAState *t = s->edges[i];
+      if (t != nullptr && t->stateNumber != INT32_MAX) {
+        ss << getStateString(s);
+        std::string label = getEdgeLabel(i);
+        ss << "-" << label << "->" << getStateString(t) << "\n";
+      }
+    }
+  }
+
+  return ss.str();
+}
+
+std::string DFASerializer::getEdgeLabel(size_t i) const {
+  return _vocabulary.getDisplayName(i); // ml: no longer needed -1 as we use a map for edges, without offset.
+}
+
+std::string DFASerializer::getStateString(DFAState *s) const {
+  size_t n = s->stateNumber;
+
+  const std::string baseStateStr = std::string(s->isAcceptState ? ":" : "") + "s" + std::to_string(n) +
+    (s->requiresFullContext ? "^" : "");
+
+  if (s->isAcceptState) {
+    if (!s->predicates.empty()) {
+      std::string buf;
+      for (size_t i = 0; i < s->predicates.size(); i++) {
+        buf.append(s->predicates[i].toString());
+      }
+      return baseStateStr + "=>" + buf;
+    } else {
+      return baseStateStr + "=>" + std::to_string(s->prediction);
+    }
+  } else {
+    return baseStateStr;
+  }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFASerializer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFASerializer.h
new file mode 100755
index 0000000000..155c8b2085
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFASerializer.h
@@ -0,0 +1,32 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Vocabulary.h"
+
+namespace antlr4 {
+namespace dfa {
+
+  /// A DFA walker that knows how to dump them to serialized strings.
+  class ANTLR4CPP_PUBLIC DFASerializer {
+  public:
+    DFASerializer(const DFA *dfa, const Vocabulary &vocabulary);
+
+    virtual ~DFASerializer() = default;
+
+    std::string toString() const;
+
+  protected:
+    virtual std::string getEdgeLabel(size_t i) const;
+    std::string getStateString(DFAState *s) const;
+
+  private:
+    const DFA *_dfa;
+    const Vocabulary &_vocabulary;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFAState.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFAState.cpp
new file mode 100755
index 0000000000..85acff8114
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFAState.cpp
@@ -0,0 +1,59 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATNConfigSet.h"
+#include "atn/SemanticContext.h"
+#include "atn/ATNConfig.h"
+#include "misc/MurmurHash.h"
+
+#include "dfa/DFAState.h"
+
+using namespace antlr4::dfa;
+using namespace antlr4::atn;
+
+std::string DFAState::PredPrediction::toString() const {
+  return std::string("(") + pred->toString() + ", " + std::to_string(alt) + ")";
+}
+
+std::set<size_t> DFAState::getAltSet() const {
+  std::set<size_t> alts;
+  if (configs != nullptr) {
+    for (size_t i = 0; i < configs->size(); i++) {
+      alts.insert(configs->get(i)->alt);
+    }
+  }
+  return alts;
+}
+
+size_t DFAState::hashCode() const {
+  return configs != nullptr ? configs->hashCode() : 0;
+}
+
+bool DFAState::equals(const DFAState &other) const {
+  if (this == std::addressof(other)) {
+    return true;
+  }
+  return configs == other.configs ||
+         (configs != nullptr && other.configs != nullptr && *configs == *other.configs);
+}
+
+std::string DFAState::toString() const {
+  std::stringstream ss;
+  ss << stateNumber;
+  if (configs) {
+    ss << ":" << configs->toString();
+  }
+  if (isAcceptState) {
+    ss << "=>";
+    if (!predicates.empty()) {
+      for (size_t i = 0; i < predicates.size(); i++) {
+        ss << predicates[i].toString();
+      }
+    } else {
+      ss << prediction;
+    }
+  }
+  return ss.str();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFAState.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFAState.h
new file mode 100755
index 0000000000..5b33a88512
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/DFAState.h
@@ -0,0 +1,154 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+#include "atn/ATNConfigSet.h"
+#include "FlatHashMap.h"
+
+namespace antlr4 {
+namespace dfa {
+
+  /// <summary>
+  /// A DFA state represents a set of possible ATN configurations.
+  ///  As Aho, Sethi, Ullman p. 117 says "The DFA uses its state
+  ///  to keep track of all possible states the ATN can be in after
+  ///  reading each input symbol.  That is to say, after reading
+  ///  input a1a2..an, the DFA is in a state that represents the
+  ///  subset T of the states of the ATN that are reachable from the
+  ///  ATN's start state along some path labeled a1a2..an."
+  ///  In conventional NFA->DFA conversion, therefore, the subset T
+  ///  would be a bitset representing the set of states the
+  ///  ATN could be in.  We need to track the alt predicted by each
+  ///  state as well, however.  More importantly, we need to maintain
+  ///  a stack of states, tracking the closure operations as they
+  ///  jump from rule to rule, emulating rule invocations (method calls).
+  ///  I have to add a stack to simulate the proper lookahead sequences for
+  ///  the underlying LL grammar from which the ATN was derived.
+  /// <p/>
+  ///  I use a set of ATNConfig objects not simple states.  An ATNConfig
+  ///  is both a state (ala normal conversion) and a RuleContext describing
+  ///  the chain of rules (if any) followed to arrive at that state.
+  /// <p/>
+  ///  A DFA state may have multiple references to a particular state,
+  ///  but with different ATN contexts (with same or different alts)
+  ///  meaning that state was reached via a different set of rule invocations.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC DFAState final {
+  public:
+    struct ANTLR4CPP_PUBLIC PredPrediction final {
+    public:
+      Ref<const atn::SemanticContext> pred; // never null; at least SemanticContext.NONE
+      int alt;
+
+      PredPrediction() = delete;
+
+      PredPrediction(const PredPrediction&) = default;
+      PredPrediction(PredPrediction&&) = default;
+
+      PredPrediction(Ref<const atn::SemanticContext> pred, int alt) : pred(std::move(pred)), alt(alt) {}
+
+      PredPrediction& operator=(const PredPrediction&) = default;
+      PredPrediction& operator=(PredPrediction&&) = default;
+
+      std::string toString() const;
+    };
+
+    std::unique_ptr<atn::ATNConfigSet> configs;
+
+    /// {@code edges[symbol]} points to target of symbol. Shift up by 1 so (-1)
+    ///  <seealso cref="Token#EOF"/> maps to {@code edges[0]}.
+    // ml: this is a sparse list, so we use a map instead of a vector.
+    //     Watch out: we no longer have the -1 offset, as it isn't needed anymore.
+    FlatHashMap<size_t, DFAState*> edges;
+
+    /// if accept state, what ttype do we match or alt do we predict?
+    /// This is set to <seealso cref="ATN#INVALID_ALT_NUMBER"/> when <seealso cref="#predicates"/>{@code !=null} or
+    /// <seealso cref="#requiresFullContext"/>.
+    size_t prediction = 0;
+
+    Ref<const atn::LexerActionExecutor> lexerActionExecutor;
+
+    /// <summary>
+    /// During SLL parsing, this is a list of predicates associated with the
+    ///  ATN configurations of the DFA state. When we have predicates,
+    ///  <seealso cref="#requiresFullContext"/> is {@code false} since full context prediction evaluates predicates
+    ///  on-the-fly. If this is not null, then <seealso cref="#prediction"/> is
+    ///  <seealso cref="ATN#INVALID_ALT_NUMBER"/>.
+    /// <p/>
+    ///  We only use these for non-<seealso cref="#requiresFullContext"/> but conflicting states. That
+    ///  means we know from the context (it's $ or we don't dip into outer
+    ///  context) that it's an ambiguity not a conflict.
+    /// <p/>
+    ///  This list is computed by <seealso cref="ParserATNSimulator#predicateDFAState"/>.
+    /// </summary>
+    std::vector<PredPrediction> predicates;
+
+    int stateNumber = -1;
+
+    bool isAcceptState = false;
+
+    /// <summary>
+    /// Indicates that this state was created during SLL prediction that
+    /// discovered a conflict between the configurations in the state. Future
+    /// <seealso cref="ParserATNSimulator#execATN"/> invocations immediately jumped doing
+    /// full context prediction if this field is true.
+    /// </summary>
+    bool requiresFullContext = false;
+
+    /// Map a predicate to a predicted alternative.
+    DFAState() = default;
+
+    explicit DFAState(int stateNumber) : stateNumber(stateNumber) {}
+
+    explicit DFAState(std::unique_ptr<atn::ATNConfigSet> configs) : configs(std::move(configs)) {}
+
+    /// <summary>
+    /// Get the set of all alts mentioned by all ATN configurations in this
+    ///  DFA state.
+    /// </summary>
+    std::set<size_t> getAltSet() const;
+
+    size_t hashCode() const;
+
+    /// Two DFAState instances are equal if their ATN configuration sets
+    /// are the same. This method is used to see if a state already exists.
+    ///
+    /// Because the number of alternatives and number of ATN configurations are
+    /// finite, there is a finite number of DFA states that can be processed.
+    /// This is necessary to show that the algorithm terminates.
+    ///
+    /// Cannot test the DFA state numbers here because in
+    /// ParserATNSimulator#addDFAState we need to know if any other state
+    /// exists that has this exact set of ATN configurations. The
+    /// stateNumber is irrelevant.
+    bool equals(const DFAState &other) const;
+
+    std::string toString() const;
+  };
+
+  inline bool operator==(const DFAState &lhs, const DFAState &rhs) {
+    return lhs.equals(rhs);
+  }
+
+  inline bool operator!=(const DFAState &lhs, const DFAState &rhs) {
+    return !operator==(lhs, rhs);
+  }
+
+}  // namespace dfa
+}  // namespace antlr4
+
+namespace std {
+
+  template <>
+  struct hash<::antlr4::dfa::DFAState> {
+    size_t operator()(const ::antlr4::dfa::DFAState &dfaState) const {
+      return dfaState.hashCode();
+    }
+  };
+
+}  // namespace std
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/LexerDFASerializer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/LexerDFASerializer.cpp
new file mode 100755
index 0000000000..fe95fd19fc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/LexerDFASerializer.cpp
@@ -0,0 +1,17 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Vocabulary.h"
+
+#include "dfa/LexerDFASerializer.h"
+
+using namespace antlr4::dfa;
+
+LexerDFASerializer::LexerDFASerializer(const DFA *dfa) : DFASerializer(dfa, Vocabulary()) {
+}
+
+std::string LexerDFASerializer::getEdgeLabel(size_t i) const {
+  return std::string("'") + static_cast<char>(i) + "'";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/LexerDFASerializer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/LexerDFASerializer.h
new file mode 100755
index 0000000000..3a6c782290
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/dfa/LexerDFASerializer.h
@@ -0,0 +1,22 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "dfa/DFASerializer.h"
+
+namespace antlr4 {
+namespace dfa {
+
+  class ANTLR4CPP_PUBLIC LexerDFASerializer final : public DFASerializer {
+  public:
+    explicit LexerDFASerializer(const DFA *dfa);
+
+  protected:
+    std::string getEdgeLabel(size_t i) const override;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/internal/Synchronization.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/internal/Synchronization.cpp
new file mode 100644
index 0000000000..dd30ef971b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/internal/Synchronization.cpp
@@ -0,0 +1,100 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#include "internal/Synchronization.h"
+
+using namespace antlr4::internal;
+
+void Mutex::lock() {
+#if ANTLR4CPP_USING_ABSEIL
+  _impl.Lock();
+#else
+  _impl.lock();
+#endif
+}
+
+bool Mutex::try_lock() {
+#if ANTLR4CPP_USING_ABSEIL
+  return _impl.TryLock();
+#else
+  return _impl.try_lock();
+#endif
+}
+
+void Mutex::unlock() {
+#if ANTLR4CPP_USING_ABSEIL
+  _impl.Unlock();
+#else
+  _impl.unlock();
+#endif
+}
+
+void SharedMutex::lock() {
+#if ANTLR4CPP_USING_ABSEIL
+  _impl.WriterLock();
+#else
+  _impl.lock();
+#endif
+}
+
+bool SharedMutex::try_lock() {
+#if ANTLR4CPP_USING_ABSEIL
+  return _impl.WriterTryLock();
+#else
+  return _impl.try_lock();
+#endif
+}
+
+void SharedMutex::unlock() {
+#if ANTLR4CPP_USING_ABSEIL
+  _impl.WriterUnlock();
+#else
+  _impl.unlock();
+#endif
+}
+
+void SharedMutex::lock_shared() {
+#if ANTLR4CPP_USING_ABSEIL
+  _impl.ReaderLock();
+#else
+  _impl.lock_shared();
+#endif
+}
+
+bool SharedMutex::try_lock_shared() {
+#if ANTLR4CPP_USING_ABSEIL
+  return _impl.ReaderTryLock();
+#else
+  return _impl.try_lock_shared();
+#endif
+}
+
+void SharedMutex::unlock_shared() {
+#if ANTLR4CPP_USING_ABSEIL
+  _impl.ReaderUnlock();
+#else
+  _impl.unlock_shared();
+#endif
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/internal/Synchronization.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/internal/Synchronization.h
new file mode 100644
index 0000000000..4f969a8ab6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/internal/Synchronization.h
@@ -0,0 +1,154 @@
+// Copyright 2012-2022 The ANTLR Project
+//
+// Redistribution and use in source and binary forms, with or without modification, are permitted
+// provided that the following conditions are met:
+//
+// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
+//    and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
+//    conditions and the following disclaimer in the documentation and/or other materials provided
+//    with the distribution.
+//
+// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
+//    endorse or promote products derived from this software without specific prior written
+//    permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
+// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
+// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#pragma once
+
+#include "antlr4-common.h"
+
+#include <mutex>
+#include <shared_mutex>
+#include <utility>
+
+#if ANTLR4CPP_USING_ABSEIL
+#include "absl/base/call_once.h"
+#include "absl/base/thread_annotations.h"
+#include "absl/synchronization/mutex.h"
+#define ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS ABSL_NO_THREAD_SAFETY_ANALYSIS
+#else
+#define ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS
+#endif
+
+// By default ANTLRv4 uses synchronization primitives provided by the C++ standard library. In most
+// deployments this is fine, however in some using custom synchronization primitives may be
+// preferred. This header allows that by optionally supporting some alternative implementations and
+// allowing for more easier patching of other alternatives.
+
+namespace antlr4::internal {
+
+  // Must be compatible with C++ standard library Mutex requirement.
+  class ANTLR4CPP_PUBLIC Mutex final {
+  public:
+    Mutex() = default;
+
+    // No copying or moving, we are as strict as possible to support other implementations.
+    Mutex(const Mutex&) = delete;
+    Mutex(Mutex&&) = delete;
+
+    // No copying or moving, we are as strict as possible to support other implementations.
+    Mutex& operator=(const Mutex&) = delete;
+    Mutex& operator=(Mutex&&) = delete;
+
+    void lock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
+
+    bool try_lock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
+
+    void unlock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
+
+  private:
+#if ANTLR4CPP_USING_ABSEIL
+    absl::Mutex _impl;
+#else
+    std::mutex _impl;
+#endif
+  };
+
+  template <typename Mutex>
+  using UniqueLock = std::unique_lock<Mutex>;
+
+  // Must be compatible with C++ standard library SharedMutex requirement.
+  class ANTLR4CPP_PUBLIC SharedMutex final {
+  public:
+    SharedMutex() = default;
+
+    // No copying or moving, we are as strict as possible to support other implementations.
+    SharedMutex(const SharedMutex&) = delete;
+    SharedMutex(SharedMutex&&) = delete;
+
+    // No copying or moving, we are as strict as possible to support other implementations.
+    SharedMutex& operator=(const SharedMutex&) = delete;
+    SharedMutex& operator=(SharedMutex&&) = delete;
+
+    void lock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
+
+    bool try_lock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
+
+    void unlock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
+
+    void lock_shared() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
+
+    bool try_lock_shared() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
+
+    void unlock_shared() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
+
+  private:
+#if ANTLR4CPP_USING_ABSEIL
+    absl::Mutex _impl;
+#else
+    std::shared_mutex _impl;
+#endif
+  };
+
+  template <typename Mutex>
+  using SharedLock = std::shared_lock<Mutex>;
+
+  class OnceFlag;
+
+  template <typename Callable, typename... Args>
+  void call_once(OnceFlag &onceFlag, Callable &&callable, Args&&... args);
+
+  // Must be compatible with std::once_flag.
+  class ANTLR4CPP_PUBLIC OnceFlag final {
+  public:
+    constexpr OnceFlag() = default;
+
+    // No copying or moving, we are as strict as possible to support other implementations.
+    OnceFlag(const OnceFlag&) = delete;
+    OnceFlag(OnceFlag&&) = delete;
+
+    // No copying or moving, we are as strict as possible to support other implementations.
+    OnceFlag& operator=(const OnceFlag&) = delete;
+    OnceFlag& operator=(OnceFlag&&) = delete;
+
+  private:
+    template <typename Callable, typename... Args>
+    friend void call_once(OnceFlag &onceFlag, Callable &&callable, Args&&... args);
+
+#if ANTLR4CPP_USING_ABSEIL
+    absl::once_flag _impl;
+#else
+    std::once_flag _impl;
+#endif
+  };
+
+  template <typename Callable, typename... Args>
+  void call_once(OnceFlag &onceFlag, Callable &&callable, Args&&... args) {
+#if ANTLR4CPP_USING_ABSEIL
+    absl::call_once(onceFlag._impl, std::forward<Callable>(callable), std::forward<Args>(args)...);
+#else
+    std::call_once(onceFlag._impl, std::forward<Callable>(callable), std::forward<Args>(args)...);
+#endif
+  }
+
+}  // namespace antlr4::internal
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/InterpreterDataReader.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/InterpreterDataReader.cpp
new file mode 100755
index 0000000000..0bcaf07b54
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/InterpreterDataReader.cpp
@@ -0,0 +1,124 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "atn/ATN.h"
+#include "atn/ATNDeserializer.h"
+#include "Vocabulary.h"
+
+#include "misc/InterpreterDataReader.h"
+
+using namespace antlr4::dfa;
+using namespace antlr4::atn;
+using namespace antlr4::misc;
+
+InterpreterData::InterpreterData(std::vector<std::string> const& literalNames, std::vector<std::string> const& symbolicNames)
+: vocabulary(literalNames, symbolicNames) {
+}
+
+InterpreterData InterpreterDataReader::parseFile(std::string const& fileName) {
+  // The structure of the data file is very simple. Everything is line based with empty lines
+  // separating the different parts. For lexers the layout is:
+  // token literal names:
+  // ...
+  //
+  // token symbolic names:
+  // ...
+  //
+  // rule names:
+  // ...
+  //
+  // channel names:
+  // ...
+  //
+  // mode names:
+  // ...
+  //
+  // atn:
+  // <a single line with comma separated int values> enclosed in a pair of squared brackets.
+  //
+  // Data for a parser does not contain channel and mode names.
+
+  std::ifstream input(fileName);
+  if (!input.good())
+    return {};
+
+  std::vector<std::string> literalNames;
+  std::vector<std::string> symbolicNames;
+
+  std::string line;
+
+  std::getline(input, line, '\n');
+  assert(line == "token literal names:");
+  while (true) {
+    std::getline(input, line, '\n');
+    if (line.empty())
+      break;
+
+    literalNames.push_back(line == "null" ? "" : line);
+  };
+
+  std::getline(input, line, '\n');
+  assert(line == "token symbolic names:");
+  while (true) {
+    std::getline(input, line, '\n');
+    if (line.empty())
+      break;
+
+    symbolicNames.push_back(line == "null" ? "" : line);
+  };
+  InterpreterData result(literalNames, symbolicNames);
+
+  std::getline(input, line, '\n');
+  assert(line == "rule names:");
+  while (true) {
+    std::getline(input, line, '\n');
+    if (line.empty())
+      break;
+
+    result.ruleNames.push_back(line);
+  };
+
+  std::getline(input, line, '\n');
+  if (line == "channel names:") {
+    while (true) {
+      std::getline(input, line, '\n');
+      if (line.empty())
+        break;
+
+      result.channels.push_back(line);
+    };
+
+    std::getline(input, line, '\n');
+    assert(line == "mode names:");
+    while (true) {
+      std::getline(input, line, '\n');
+      if (line.empty())
+        break;
+
+      result.modes.push_back(line);
+    };
+  }
+
+  std::vector<int32_t> serializedATN;
+
+  std::getline(input, line, '\n');
+  assert(line == "atn:");
+  std::getline(input, line, '\n');
+  std::stringstream tokenizer(line);
+  std::string value;
+  while (tokenizer.good()) {
+    std::getline(tokenizer, value, ',');
+    unsigned long number;
+    if (value[0] == '[')
+      number = std::strtoul(&value[1], nullptr, 10);
+    else
+      number = std::strtoul(value.c_str(), nullptr, 10);
+    serializedATN.push_back(static_cast<int32_t>(number));
+  }
+
+  ATNDeserializer deserializer;
+  result.atn = deserializer.deserialize(serializedATN);
+  return result;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/InterpreterDataReader.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/InterpreterDataReader.h
new file mode 100755
index 0000000000..c0cf9880a1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/InterpreterDataReader.h
@@ -0,0 +1,33 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+#include "atn/ATN.h"
+#include "Vocabulary.h"
+
+namespace antlr4 {
+namespace misc {
+
+  struct InterpreterData {
+    std::unique_ptr<atn::ATN> atn;
+    dfa::Vocabulary vocabulary;
+    std::vector<std::string> ruleNames;
+    std::vector<std::string> channels; // Only valid for lexer grammars.
+    std::vector<std::string> modes; // ditto
+
+    InterpreterData() {}; // For invalid content.
+    InterpreterData(std::vector<std::string> const& literalNames, std::vector<std::string> const& symbolicNames);
+  };
+
+  // A class to read plain text interpreter data produced by ANTLR.
+  class ANTLR4CPP_PUBLIC InterpreterDataReader {
+  public:
+    static InterpreterData parseFile(std::string const& fileName);
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Interval.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Interval.cpp
new file mode 100755
index 0000000000..16eec34340
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Interval.cpp
@@ -0,0 +1,61 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/Interval.h"
+
+using namespace antlr4::misc;
+
+const Interval Interval::INVALID;
+
+size_t Interval::hashCode() const {
+  size_t hash = 23;
+  hash = hash * 31 + static_cast<size_t>(a);
+  hash = hash * 31 + static_cast<size_t>(b);
+  return hash;
+}
+
+bool Interval::startsBeforeDisjoint(const Interval &other) const {
+  return a < other.a && b < other.a;
+}
+
+bool Interval::startsBeforeNonDisjoint(const Interval &other) const {
+  return a <= other.a && b >= other.a;
+}
+
+bool Interval::startsAfter(const Interval &other) const {
+  return a > other.a;
+}
+
+bool Interval::startsAfterDisjoint(const Interval &other) const {
+  return a > other.b;
+}
+
+bool Interval::startsAfterNonDisjoint(const Interval &other) const {
+  return a > other.a && a <= other.b; // b >= other.b implied
+}
+
+bool Interval::disjoint(const Interval &other) const {
+  return startsBeforeDisjoint(other) || startsAfterDisjoint(other);
+}
+
+bool Interval::adjacent(const Interval &other) const {
+  return a == other.b + 1 || b == other.a - 1;
+}
+
+bool Interval::properlyContains(const Interval &other) const {
+  return other.a >= a && other.b <= b;
+}
+
+Interval Interval::Union(const Interval &other) const {
+  return Interval(std::min(a, other.a), std::max(b, other.b));
+}
+
+Interval Interval::intersection(const Interval &other) const {
+  return Interval(std::max(a, other.a), std::min(b, other.b));
+}
+
+std::string Interval::toString() const {
+  return std::to_string(a) + ".." + std::to_string(b);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Interval.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Interval.h
new file mode 100755
index 0000000000..4ca3cfcdbc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Interval.h
@@ -0,0 +1,84 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace misc {
+
+  // Helpers to convert certain unsigned symbols (e.g. Token::EOF) to their original numeric value (e.g. -1)
+  // and vice versa. This is needed mostly for intervals to keep their original order and for toString()
+  // methods to print the original numeric value (e.g. for tests).
+  constexpr size_t numericToSymbol(ssize_t v) { return static_cast<size_t>(v); }
+  constexpr ssize_t symbolToNumeric(size_t v) { return static_cast<ssize_t>(v); }
+
+  /// An immutable inclusive interval a..b
+  class ANTLR4CPP_PUBLIC Interval final {
+  public:
+    static const Interval INVALID;
+
+    // Must stay signed to guarantee the correct sort order.
+    ssize_t a;
+    ssize_t b;
+
+    constexpr Interval() : Interval(static_cast<ssize_t>(-1), static_cast<ssize_t>(-2)) {}
+
+    constexpr explicit Interval(size_t a_, size_t b_) : Interval(symbolToNumeric(a_), symbolToNumeric(b_)) {}
+
+    constexpr Interval(ssize_t a_, ssize_t b_) : a(a_), b(b_) {}
+
+    /// return number of elements between a and b inclusively. x..x is length 1.
+    ///  if b < a, then length is 0.  9..10 has length 2.
+    constexpr size_t length() const { return b >= a ? static_cast<size_t>(b - a + 1) : 0; }
+
+    constexpr bool operator==(const Interval &other) const { return a == other.a && b == other.b; }
+
+    size_t hashCode() const;
+
+    /// <summary>
+    /// Does this start completely before other? Disjoint </summary>
+    bool startsBeforeDisjoint(const Interval &other) const;
+
+    /// <summary>
+    /// Does this start at or before other? Nondisjoint </summary>
+    bool startsBeforeNonDisjoint(const Interval &other) const;
+
+    /// <summary>
+    /// Does this.a start after other.b? May or may not be disjoint </summary>
+    bool startsAfter(const Interval &other) const;
+
+    /// <summary>
+    /// Does this start completely after other? Disjoint </summary>
+    bool startsAfterDisjoint(const Interval &other) const;
+
+    /// <summary>
+    /// Does this start after other? NonDisjoint </summary>
+    bool startsAfterNonDisjoint(const Interval &other) const;
+
+    /// <summary>
+    /// Are both ranges disjoint? I.e., no overlap? </summary>
+    bool disjoint(const Interval &other) const;
+
+    /// <summary>
+    /// Are two intervals adjacent such as 0..41 and 42..42? </summary>
+    bool adjacent(const Interval &other) const;
+
+    bool properlyContains(const Interval &other) const;
+
+    /// <summary>
+    /// Return the interval computed from combining this and other </summary>
+    Interval Union(const Interval &other) const;
+
+    /// <summary>
+    /// Return the interval in common between this and o </summary>
+    Interval intersection(const Interval &other) const;
+
+    std::string toString() const;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/IntervalSet.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/IntervalSet.cpp
new file mode 100755
index 0000000000..058d98703e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/IntervalSet.cpp
@@ -0,0 +1,508 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/MurmurHash.h"
+#include "Lexer.h"
+#include "Exceptions.h"
+#include "Vocabulary.h"
+
+#include "misc/IntervalSet.h"
+
+using namespace antlr4;
+using namespace antlr4::misc;
+
+IntervalSet const IntervalSet::COMPLETE_CHAR_SET =
+    IntervalSet::of(Lexer::MIN_CHAR_VALUE, Lexer::MAX_CHAR_VALUE);
+
+IntervalSet const IntervalSet::EMPTY_SET;
+
+IntervalSet::IntervalSet() : _intervals() {
+}
+
+IntervalSet::IntervalSet(const IntervalSet &set) : IntervalSet() {
+  _intervals = set._intervals;
+}
+
+IntervalSet::IntervalSet(IntervalSet&& set) : IntervalSet(std::move(set._intervals)) {
+}
+
+IntervalSet::IntervalSet(std::vector<Interval>&& intervals) : _intervals(std::move(intervals)) {
+}
+
+IntervalSet& IntervalSet::operator=(const IntervalSet& other) {
+  _intervals = other._intervals;
+  return *this;
+}
+
+IntervalSet& IntervalSet::operator=(IntervalSet&& other) {
+  _intervals = std::move(other._intervals);
+  return *this;
+}
+
+IntervalSet IntervalSet::of(ssize_t a) {
+  return IntervalSet({ Interval(a, a) });
+}
+
+IntervalSet IntervalSet::of(ssize_t a, ssize_t b) {
+  return IntervalSet({ Interval(a, b) });
+}
+
+void IntervalSet::clear() {
+  _intervals.clear();
+}
+
+void IntervalSet::add(ssize_t el) {
+  add(el, el);
+}
+
+void IntervalSet::add(ssize_t a, ssize_t b) {
+  add(Interval(a, b));
+}
+
+void IntervalSet::add(const Interval &addition) {
+  if (addition.b < addition.a) {
+    return;
+  }
+
+  // find position in list
+  for (auto iterator = _intervals.begin(); iterator != _intervals.end(); ++iterator) {
+    Interval r = *iterator;
+    if (addition == r) {
+      return;
+    }
+
+    if (addition.adjacent(r) || !addition.disjoint(r)) {
+      // next to each other, make a single larger interval
+      Interval bigger = addition.Union(r);
+      *iterator = bigger;
+
+      // make sure we didn't just create an interval that
+      // should be merged with next interval in list
+      while (iterator + 1 != _intervals.end()) {
+        Interval next = *++iterator;
+        if (!bigger.adjacent(next) && bigger.disjoint(next)) {
+          break;
+        }
+
+        // if we bump up against or overlap next, merge
+        iterator = _intervals.erase(iterator);// remove this one
+        --iterator; // move backwards to what we just set
+        *iterator = bigger.Union(next); // set to 3 merged ones
+        // ml: no need to advance iterator, we do that in the next round anyway. ++iterator; // first call to next after previous duplicates the result
+      }
+      return;
+    }
+
+    if (addition.startsBeforeDisjoint(r)) {
+      // insert before r
+      //--iterator;
+      _intervals.insert(iterator, addition);
+      return;
+    }
+
+    // if disjoint and after r, a future iteration will handle it
+  }
+
+  // ok, must be after last interval (and disjoint from last interval)
+  // just add it
+  _intervals.push_back(addition);
+}
+
+IntervalSet IntervalSet::Or(const std::vector<IntervalSet> &sets) {
+  IntervalSet result;
+  for (const auto &s : sets) {
+    result.addAll(s);
+  }
+  return result;
+}
+
+IntervalSet& IntervalSet::addAll(const IntervalSet &set) {
+  // walk set and add each interval
+  for (auto const& interval : set._intervals) {
+    add(interval);
+  }
+  return *this;
+}
+
+IntervalSet IntervalSet::complement(ssize_t minElement, ssize_t maxElement) const {
+  return complement(IntervalSet::of(minElement, maxElement));
+}
+
+IntervalSet IntervalSet::complement(const IntervalSet &vocabulary) const {
+  return vocabulary.subtract(*this);
+}
+
+IntervalSet IntervalSet::subtract(const IntervalSet &other) const {
+  return subtract(*this, other);
+}
+
+IntervalSet IntervalSet::subtract(const IntervalSet &left, const IntervalSet &right) {
+  if (left.isEmpty()) {
+    return IntervalSet();
+  }
+
+  if (right.isEmpty()) {
+    // right set has no elements; just return the copy of the current set
+    return left;
+  }
+
+  IntervalSet result(left);
+  size_t resultI = 0;
+  size_t rightI = 0;
+  while (resultI < result._intervals.size() && rightI < right._intervals.size()) {
+    Interval &resultInterval = result._intervals[resultI];
+    const Interval &rightInterval = right._intervals[rightI];
+
+    // operation: (resultInterval - rightInterval) and update indexes
+
+    if (rightInterval.b < resultInterval.a) {
+      rightI++;
+      continue;
+    }
+
+    if (rightInterval.a > resultInterval.b) {
+      resultI++;
+      continue;
+    }
+
+    Interval beforeCurrent;
+    Interval afterCurrent;
+    if (rightInterval.a > resultInterval.a) {
+      beforeCurrent = Interval(resultInterval.a, rightInterval.a - 1);
+    }
+
+    if (rightInterval.b < resultInterval.b) {
+      afterCurrent = Interval(rightInterval.b + 1, resultInterval.b);
+    }
+
+    if (beforeCurrent.a > -1) { // -1 is the default value
+      if (afterCurrent.a > -1) {
+        // split the current interval into two
+        result._intervals[resultI] = beforeCurrent;
+        result._intervals.insert(result._intervals.begin() + resultI + 1, afterCurrent);
+        resultI++;
+        rightI++;
+      } else {
+        // replace the current interval
+        result._intervals[resultI] = beforeCurrent;
+        resultI++;
+      }
+    } else {
+      if (afterCurrent.a > -1) {
+        // replace the current interval
+        result._intervals[resultI] = afterCurrent;
+        rightI++;
+      } else {
+        // remove the current interval (thus no need to increment resultI)
+        result._intervals.erase(result._intervals.begin() + resultI);
+      }
+    }
+  }
+
+  // If rightI reached right.intervals.size(), no more intervals to subtract from result.
+  // If resultI reached result.intervals.size(), we would be subtracting from an empty set.
+  // Either way, we are done.
+  return result;
+}
+
+IntervalSet IntervalSet::Or(const IntervalSet &a) const {
+  IntervalSet result;
+  result.addAll(*this);
+  result.addAll(a);
+  return result;
+}
+
+IntervalSet IntervalSet::And(const IntervalSet &other) const {
+  IntervalSet intersection;
+  size_t i = 0;
+  size_t j = 0;
+
+  // iterate down both interval lists looking for nondisjoint intervals
+  while (i < _intervals.size() && j < other._intervals.size()) {
+    Interval mine = _intervals[i];
+    Interval theirs = other._intervals[j];
+
+    if (mine.startsBeforeDisjoint(theirs)) {
+      // move this iterator looking for interval that might overlap
+      i++;
+    } else if (theirs.startsBeforeDisjoint(mine)) {
+      // move other iterator looking for interval that might overlap
+      j++;
+    } else if (mine.properlyContains(theirs)) {
+      // overlap, add intersection, get next theirs
+      intersection.add(mine.intersection(theirs));
+      j++;
+    } else if (theirs.properlyContains(mine)) {
+      // overlap, add intersection, get next mine
+      intersection.add(mine.intersection(theirs));
+      i++;
+    } else if (!mine.disjoint(theirs)) {
+      // overlap, add intersection
+      intersection.add(mine.intersection(theirs));
+
+      // Move the iterator of lower range [a..b], but not
+      // the upper range as it may contain elements that will collide
+      // with the next iterator. So, if mine=[0..115] and
+      // theirs=[115..200], then intersection is 115 and move mine
+      // but not theirs as theirs may collide with the next range
+      // in thisIter.
+      // move both iterators to next ranges
+      if (mine.startsAfterNonDisjoint(theirs)) {
+        j++;
+      } else if (theirs.startsAfterNonDisjoint(mine)) {
+        i++;
+      }
+    }
+  }
+
+  return intersection;
+}
+
+bool IntervalSet::contains(size_t el) const {
+  return contains(symbolToNumeric(el));
+}
+
+bool IntervalSet::contains(ssize_t el) const {
+  if (_intervals.empty() || el < _intervals.front().a || el > _intervals.back().b) {
+    return false;
+  }
+
+  return std::binary_search(_intervals.begin(), _intervals.end(), Interval(el, el), [](const Interval &lhs, const Interval &rhs) {
+    return lhs.b < rhs.a;
+  });
+}
+
+bool IntervalSet::isEmpty() const {
+  return _intervals.empty();
+}
+
+ssize_t IntervalSet::getSingleElement() const {
+  if (_intervals.size() == 1) {
+    if (_intervals[0].a == _intervals[0].b) {
+      return _intervals[0].a;
+    }
+  }
+
+  return Token::INVALID_TYPE; // XXX: this value is 0, but 0 is a valid interval range, how can that work?
+}
+
+ssize_t IntervalSet::getMaxElement() const {
+  if (_intervals.empty()) {
+    return Token::INVALID_TYPE;
+  }
+
+  return _intervals.back().b;
+}
+
+ssize_t IntervalSet::getMinElement() const {
+  if (_intervals.empty()) {
+    return Token::INVALID_TYPE;
+  }
+
+  return _intervals.front().a;
+}
+
+std::vector<Interval> const& IntervalSet::getIntervals() const {
+  return _intervals;
+}
+
+size_t IntervalSet::hashCode() const {
+  size_t hash = MurmurHash::initialize();
+  for (const auto &interval : _intervals) {
+    hash = MurmurHash::update(hash, interval.a);
+    hash = MurmurHash::update(hash, interval.b);
+  }
+
+  return MurmurHash::finish(hash, _intervals.size() * 2);
+}
+
+bool IntervalSet::operator == (const IntervalSet &other) const {
+  if (_intervals.empty() && other._intervals.empty())
+    return true;
+
+  if (_intervals.size() != other._intervals.size())
+    return false;
+
+  return std::equal(_intervals.begin(), _intervals.end(), other._intervals.begin());
+}
+
+std::string IntervalSet::toString() const {
+  return toString(false);
+}
+
+std::string IntervalSet::toString(bool elemAreChar) const {
+  if (_intervals.empty()) {
+    return "{}";
+  }
+
+  std::stringstream ss;
+  size_t effectiveSize = size();
+  if (effectiveSize > 1) {
+    ss << "{";
+  }
+
+  bool firstEntry = true;
+  for (const auto &interval : _intervals) {
+    if (!firstEntry)
+      ss << ", ";
+    firstEntry = false;
+
+    ssize_t a = interval.a;
+    ssize_t b = interval.b;
+    if (a == b) {
+      if (a == -1) {
+        ss << "<EOF>";
+      } else if (elemAreChar) {
+        ss << "'" << static_cast<char>(a) << "'";
+      } else {
+        ss << a;
+      }
+    } else {
+      if (elemAreChar) {
+        ss << "'" << static_cast<char>(a) << "'..'" << static_cast<char>(b) << "'";
+      } else {
+        ss << a << ".." << b;
+      }
+    }
+  }
+  if (effectiveSize > 1) {
+    ss << "}";
+  }
+
+  return ss.str();
+}
+
+std::string IntervalSet::toString(const dfa::Vocabulary &vocabulary) const {
+  if (_intervals.empty()) {
+    return "{}";
+  }
+
+  std::stringstream ss;
+  size_t effectiveSize = size();
+  if (effectiveSize > 1) {
+    ss << "{";
+  }
+
+  bool firstEntry = true;
+  for (const auto &interval : _intervals) {
+    if (!firstEntry)
+      ss << ", ";
+    firstEntry = false;
+
+    ssize_t a = interval.a;
+    ssize_t b = interval.b;
+    if (a == b) {
+      ss << elementName(vocabulary, a);
+    } else {
+      for (ssize_t i = a; i <= b; i++) {
+        if (i > a) {
+          ss << ", ";
+        }
+        ss << elementName(vocabulary, i);
+      }
+    }
+  }
+  if (effectiveSize > 1) {
+    ss << "}";
+  }
+
+  return ss.str();
+}
+
+std::string IntervalSet::elementName(const dfa::Vocabulary &vocabulary, ssize_t a) const {
+  if (a == -1) {
+    return "<EOF>";
+  } else if (a == -2) {
+    return "<EPSILON>";
+  } else {
+    return vocabulary.getDisplayName(a);
+  }
+}
+
+size_t IntervalSet::size() const {
+  size_t result = 0;
+  for (const auto &interval : _intervals) {
+    result += size_t(interval.b - interval.a + 1);
+  }
+  return result;
+}
+
+std::vector<ssize_t> IntervalSet::toList() const {
+  std::vector<ssize_t> result;
+  for (const auto &interval : _intervals) {
+    ssize_t a = interval.a;
+    ssize_t b = interval.b;
+    for (ssize_t v = a; v <= b; v++) {
+      result.push_back(v);
+    }
+  }
+  return result;
+}
+
+std::set<ssize_t> IntervalSet::toSet() const {
+  std::set<ssize_t> result;
+  for (const auto &interval : _intervals) {
+    ssize_t a = interval.a;
+    ssize_t b = interval.b;
+    for (ssize_t v = a; v <= b; v++) {
+      result.insert(v);
+    }
+  }
+  return result;
+}
+
+ssize_t IntervalSet::get(size_t i) const {
+  size_t index = 0;
+  for (const auto &interval : _intervals) {
+    ssize_t a = interval.a;
+    ssize_t b = interval.b;
+    for (ssize_t v = a; v <= b; v++) {
+      if (index == i) {
+        return v;
+      }
+      index++;
+    }
+  }
+  return -1;
+}
+
+void IntervalSet::remove(size_t el) {
+  remove(symbolToNumeric(el));
+}
+
+void IntervalSet::remove(ssize_t el) {
+  for (size_t i = 0; i < _intervals.size(); ++i) {
+    Interval &interval = _intervals[i];
+    ssize_t a = interval.a;
+    ssize_t b = interval.b;
+    if (el < a) {
+      break; // list is sorted and el is before this interval; not here
+    }
+
+    // if whole interval x..x, rm
+    if (el == a && el == b) {
+      _intervals.erase(_intervals.begin() + (long)i);
+      break;
+    }
+    // if on left edge x..b, adjust left
+    if (el == a) {
+      interval.a++;
+      break;
+    }
+    // if on right edge a..x, adjust right
+    if (el == b) {
+      interval.b--;
+      break;
+    }
+    // if in middle a..x..b, split interval
+    if (el > a && el < b) { // found in this interval
+      ssize_t oldb = interval.b;
+      interval.b = el - 1; // [a..x-1]
+      add(el + 1, oldb); // add [x+1..b]
+
+      break; // ml: not in the Java code but I believe we also should stop searching here, as we found x.
+    }
+  }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/IntervalSet.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/IntervalSet.h
new file mode 100755
index 0000000000..7f24b78138
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/IntervalSet.h
@@ -0,0 +1,190 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "misc/Interval.h"
+#include "Exceptions.h"
+
+namespace antlr4 {
+namespace misc {
+
+  /**
+   * This class implements the {@link IntSet} backed by a sorted array of
+   * non-overlapping intervals. It is particularly efficient for representing
+   * large collections of numbers, where the majority of elements appear as part
+   * of a sequential range of numbers that are all part of the set. For example,
+   * the set { 1, 2, 3, 4, 7, 8 } may be represented as { [1, 4], [7, 8] }.
+   *
+   * <p>
+   * This class is able to represent sets containing any combination of values in
+   * the range {@link Integer#MIN_VALUE} to {@link Integer#MAX_VALUE}
+   * (inclusive).</p>
+   */
+  class ANTLR4CPP_PUBLIC IntervalSet final {
+  public:
+    static IntervalSet const COMPLETE_CHAR_SET;
+    static IntervalSet const EMPTY_SET;
+
+  private:
+    /// The list of sorted, disjoint intervals.
+    std::vector<Interval> _intervals;
+
+    explicit IntervalSet(std::vector<Interval>&& intervals);
+
+  public:
+    IntervalSet();
+    IntervalSet(IntervalSet const& set);
+    IntervalSet(IntervalSet&& set);
+
+    template<typename T1, typename... T_NEXT>
+    IntervalSet(int, T1 t1, T_NEXT&&... next) : IntervalSet() {
+      // The first int argument is an ignored count for compatibility
+      // with the previous varargs based interface.
+      addItems(t1, std::forward<T_NEXT>(next)...);
+    }
+
+    IntervalSet& operator=(IntervalSet const& set);
+    IntervalSet& operator=(IntervalSet&& set);
+
+    /// Create a set with a single element, el.
+    static IntervalSet of(ssize_t a);
+
+    /// Create a set with all ints within range [a..b] (inclusive)
+    static IntervalSet of(ssize_t a, ssize_t b);
+
+    void clear();
+
+    /// Add a single element to the set.  An isolated element is stored
+    /// as a range el..el.
+    void add(ssize_t el);
+
+    /// Add interval; i.e., add all integers from a to b to set.
+    /// If b<a, do nothing.
+    /// Keep list in sorted order (by left range value).
+    /// If overlap, combine ranges.  For example,
+    /// If this is {1..5, 10..20}, adding 6..7 yields
+    /// {1..5, 6..7, 10..20}.  Adding 4..8 yields {1..8, 10..20}.
+    void add(ssize_t a, ssize_t b);
+
+    /// combine all sets in the array returned the or'd value
+    static IntervalSet Or(const std::vector<IntervalSet> &sets);
+
+    // Copy on write so we can cache a..a intervals and sets of that.
+    void add(const Interval &addition);
+    IntervalSet& addAll(const IntervalSet &set);
+
+    template<typename T1, typename... T_NEXT>
+    void addItems(T1 t1, T_NEXT&&... next) {
+      add(t1);
+      addItems(std::forward<T_NEXT>(next)...);
+    }
+
+    IntervalSet complement(ssize_t minElement, ssize_t maxElement) const;
+
+    /// Given the set of possible values (rather than, say UNICODE or MAXINT),
+    /// return a new set containing all elements in vocabulary, but not in
+    /// this.  The computation is (vocabulary - this).
+    ///
+    /// 'this' is assumed to be either a subset or equal to vocabulary.
+    IntervalSet complement(const IntervalSet &vocabulary) const;
+
+    /// Compute this-other via this&~other.
+    /// Return a new set containing all elements in this but not in other.
+    /// other is assumed to be a subset of this;
+    /// anything that is in other but not in this will be ignored.
+    IntervalSet subtract(const IntervalSet &other) const;
+
+    /**
+     * Compute the set difference between two interval sets. The specific
+     * operation is {@code left - right}. If either of the input sets is
+     * {@code null}, it is treated as though it was an empty set.
+     */
+    static IntervalSet subtract(const IntervalSet &left, const IntervalSet &right);
+
+    IntervalSet Or(const IntervalSet &a) const;
+
+    /// Return a new set with the intersection of this set with other.  Because
+    /// the intervals are sorted, we can use an iterator for each list and
+    /// just walk them together.  This is roughly O(min(n,m)) for interval
+    /// list lengths n and m.
+    IntervalSet And(const IntervalSet &other) const;
+
+    /// Is el in any range of this set?
+    bool contains(size_t el) const; // For mapping of e.g. Token::EOF to -1 etc.
+    bool contains(ssize_t el) const;
+
+    /// return true if this set has no members
+    bool isEmpty() const;
+
+    /// If this set is a single integer, return it otherwise Token.INVALID_TYPE.
+    ssize_t getSingleElement() const;
+
+    /**
+     * Returns the maximum value contained in the set.
+     *
+     * @return the maximum value contained in the set. If the set is empty, this
+     * method returns {@link Token#INVALID_TYPE}.
+     */
+    ssize_t getMaxElement() const;
+
+    /**
+     * Returns the minimum value contained in the set.
+     *
+     * @return the minimum value contained in the set. If the set is empty, this
+     * method returns {@link Token#INVALID_TYPE}.
+     */
+    ssize_t getMinElement() const;
+
+    /// <summary>
+    /// Return a list of Interval objects. </summary>
+    std::vector<Interval> const& getIntervals() const;
+
+    size_t hashCode() const;
+
+    /// Are two IntervalSets equal?  Because all intervals are sorted
+    ///  and disjoint, equals is a simple linear walk over both lists
+    ///  to make sure they are the same.
+    bool operator == (const IntervalSet &other) const;
+    std::string toString() const;
+    std::string toString(bool elemAreChar) const;
+
+    std::string toString(const dfa::Vocabulary &vocabulary) const;
+
+  protected:
+    std::string elementName(const dfa::Vocabulary &vocabulary, ssize_t a) const;
+
+  public:
+    size_t size() const;
+    std::vector<ssize_t> toList() const;
+    std::set<ssize_t> toSet() const;
+
+    /// Get the ith element of ordered set.  Used only by RandomPhrase so
+    /// don't bother to implement if you're not doing that for a new
+    /// ANTLR code gen target.
+    ssize_t get(size_t i) const;
+    void remove(size_t el); // For mapping of e.g. Token::EOF to -1 etc.
+    void remove(ssize_t el);
+
+  private:
+    void addItems() { /* No-op */ }
+  };
+
+} // namespace atn
+} // namespace antlr4
+
+// Hash function for IntervalSet.
+
+namespace std {
+  using antlr4::misc::IntervalSet;
+
+  template <> struct hash<IntervalSet>
+  {
+    size_t operator() (const IntervalSet &x) const
+    {
+      return x.hashCode();
+    }
+  };
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/MurmurHash.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/MurmurHash.cpp
new file mode 100755
index 0000000000..09072c9f7e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/MurmurHash.cpp
@@ -0,0 +1,120 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include <cstddef>
+#include <cstdint>
+#include <cstring>
+
+#include "misc/MurmurHash.h"
+
+using namespace antlr4::misc;
+
+// A variation of the MurmurHash3 implementation (https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp)
+// Here we unrolled the loop used there into individual calls to update(), as we usually hash object fields
+// instead of entire buffers.
+
+// Platform-specific functions and macros
+
+// Microsoft Visual Studio
+
+#if defined(_MSC_VER)
+
+#include <stdlib.h>
+
+#define ROTL32(x,y)	_rotl(x,y)
+#define ROTL64(x,y)	_rotl64(x,y)
+
+#elif ANTLR4CPP_HAVE_BUILTIN(__builtin_rotateleft32) && ANTLR4CPP_HAVE_BUILTIN(__builtin_rotateleft64)
+
+#define ROTL32(x, y) __builtin_rotateleft32(x, y)
+#define ROTL64(x, y) __builtin_rotateleft64(x, y)
+
+#else	// defined(_MSC_VER)
+
+// Other compilers
+
+namespace {
+
+constexpr uint32_t ROTL32(uint32_t x, int r) {
+  return (x << r) | (x >> (32 - r));
+}
+constexpr uint64_t ROTL64(uint64_t x, int r) {
+  return (x << r) | (x >> (64 - r));
+}
+
+}
+
+#endif // !defined(_MSC_VER)
+
+#if SIZE_MAX == UINT64_MAX
+
+size_t MurmurHash::update(size_t hash, size_t value) {
+  size_t k1 = value;
+  k1 *= UINT64_C(0x87c37b91114253d5);
+  k1 = ROTL64(k1, 31);
+  k1 *= UINT64_C(0x4cf5ad432745937f);
+
+  hash ^= k1;
+  hash = ROTL64(hash, 27);
+  hash = hash * 5 + UINT64_C(0x52dce729);
+
+  return hash;
+}
+
+size_t MurmurHash::finish(size_t hash, size_t entryCount) {
+  hash ^= entryCount * 8;
+  hash ^= hash >> 33;
+  hash *= UINT64_C(0xff51afd7ed558ccd);
+  hash ^= hash >> 33;
+  hash *= UINT64_C(0xc4ceb9fe1a85ec53);
+  hash ^= hash >> 33;
+  return hash;
+}
+
+#elif SIZE_MAX == UINT32_MAX
+
+size_t MurmurHash::update(size_t hash, size_t value) {
+  size_t k1 = value;
+  k1 *= UINT32_C(0xCC9E2D51);
+  k1 = ROTL32(k1, 15);
+  k1 *= UINT32_C(0x1B873593);
+
+  hash ^= k1;
+  hash = ROTL32(hash, 13);
+  hash = hash * 5 + UINT32_C(0xE6546B64);
+
+  return hash;
+}
+
+size_t MurmurHash::finish(size_t hash, size_t entryCount) {
+  hash ^= entryCount * 4;
+  hash ^= hash >> 16;
+  hash *= UINT32_C(0x85EBCA6B);
+  hash ^= hash >> 13;
+  hash *= UINT32_C(0xC2B2AE35);
+  hash ^= hash >> 16;
+  return hash;
+}
+
+#else
+#error "Expected sizeof(size_t) to be 4 or 8."
+#endif
+
+size_t MurmurHash::update(size_t hash, const void *data, size_t size) {
+  size_t value;
+  const uint8_t *bytes = static_cast<const uint8_t*>(data);
+  while (size >= sizeof(size_t)) {
+    std::memcpy(&value, bytes, sizeof(size_t));
+    hash = update(hash, value);
+    bytes += sizeof(size_t);
+    size -= sizeof(size_t);
+  }
+  if (size != 0) {
+    value = 0;
+    std::memcpy(&value, bytes, size);
+    hash = update(hash, value);
+  }
+  return hash;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/MurmurHash.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/MurmurHash.h
new file mode 100755
index 0000000000..940ee67155
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/MurmurHash.h
@@ -0,0 +1,102 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cstdint>
+#include <type_traits>
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace misc {
+
+  class ANTLR4CPP_PUBLIC MurmurHash final {
+  private:
+    static constexpr size_t DEFAULT_SEED = 0;
+
+    /// Initialize the hash using the default seed value.
+    /// Returns the intermediate hash value.
+  public:
+    static size_t initialize() { return initialize(DEFAULT_SEED); }
+
+    /// Initialize the hash using the specified seed.
+    static size_t initialize(size_t seed) { return seed; }
+
+    /// Update the intermediate hash value for the next input {@code value}.
+    /// <param name="hash"> the intermediate hash value </param>
+    /// <param name="value"> the value to add to the current hash </param>
+    /// Returns the updated intermediate hash value.
+    static size_t update(size_t hash, size_t value);
+
+    /**
+     * Update the intermediate hash value for the next input {@code value}.
+     *
+     * @param hash the intermediate hash value
+     * @param value the value to add to the current hash
+     * @return the updated intermediate hash value
+     */
+    template <class T>
+    static size_t update(size_t hash, Ref<T> const& value) {
+      return update(hash, value != nullptr ? value->hashCode() : 0);
+    }
+
+    template <class T>
+    static size_t update(size_t hash, T *value) {
+      return update(hash, value != nullptr ? value->hashCode() : 0);
+    }
+
+    static size_t update(size_t hash, const void *data, size_t size);
+
+    template <typename T>
+    static size_t update(size_t hash, const T *data, size_t size) {
+      return update(hash, static_cast<const void*>(data), size * sizeof(std::remove_reference_t<T>));
+    }
+
+    /// <summary>
+    /// Apply the final computation steps to the intermediate value {@code hash}
+    /// to form the final result of the MurmurHash 3 hash function.
+    /// </summary>
+    /// <param name="hash"> the intermediate hash value </param>
+    /// <param name="entryCount"> the number of calls to update() before calling finish() </param>
+    /// <returns> the final hash result </returns>
+    static size_t finish(size_t hash, size_t entryCount);
+
+    /// Utility function to compute the hash code of an array using the MurmurHash3 algorithm.
+    ///
+    /// @param <T> the array element type </param>
+    /// <param name="data"> the array data </param>
+    /// <param name="seed"> the seed for the MurmurHash algorithm </param>
+    /// <returns> the hash code of the data </returns>
+    template<typename T> // where T is C array type
+    static size_t hashCode(const std::vector<Ref<T>> &data, size_t seed = DEFAULT_SEED) {
+      size_t hash = initialize(seed);
+      for (auto &entry : data) {
+        hash = update(hash, entry);
+      }
+      return finish(hash, data.size());
+    }
+
+    static size_t hashCode(const void *data, size_t size, size_t seed = DEFAULT_SEED) {
+      size_t hash = initialize(seed);
+      hash = update(hash, data, size);
+      return finish(hash, size);
+    }
+
+    template <typename T>
+    static size_t hashCode(const T *data, size_t size, size_t seed = DEFAULT_SEED) {
+      return hashCode(static_cast<const void*>(data), size * sizeof(std::remove_reference_t<T>), seed);
+    }
+
+  private:
+    MurmurHash() = delete;
+
+    MurmurHash(const MurmurHash&) = delete;
+
+    MurmurHash& operator=(const MurmurHash&) = delete;
+  };
+
+} // namespace atn
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Predicate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Predicate.cpp
new file mode 100644
index 0000000000..c35f1921c4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Predicate.cpp
@@ -0,0 +1,4 @@
+#include "misc/Predicate.h"
+
+antlr4::misc::Predicate::~Predicate() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Predicate.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Predicate.h
new file mode 100755
index 0000000000..1032d53fed
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/misc/Predicate.h
@@ -0,0 +1,21 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace misc {
+
+  class ANTLR4CPP_PUBLIC Predicate {
+  public:
+    virtual ~Predicate();
+
+    virtual bool test(tree::ParseTree *t) = 0;
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Any.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Any.cpp
new file mode 100644
index 0000000000..a1ed50d456
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Any.cpp
@@ -0,0 +1,8 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Any.h"
+
+using namespace antlrcpp;
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Any.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Any.h
new file mode 100644
index 0000000000..fa5df58946
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Any.h
@@ -0,0 +1,16 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+// A standard C++ class loosely modeled after boost::Any.
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlrcpp {
+
+  using Any = std::any;
+
+} // namespace antlrcpp
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Arrays.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Arrays.cpp
new file mode 100644
index 0000000000..b3c4f94f2f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Arrays.cpp
@@ -0,0 +1,43 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/ParseTree.h"
+#include "Exceptions.h"
+
+#include "support/Arrays.h"
+
+using namespace antlrcpp;
+
+std::string Arrays::listToString(const std::vector<std::string> &list, const std::string &separator)
+{
+  std::stringstream ss;
+  bool firstEntry = true;
+
+  ss << '[';
+  for (const auto &entry : list) {
+    ss << entry;
+    if (firstEntry) {
+      ss << separator;
+      firstEntry = false;
+    }
+  }
+
+  ss << ']';
+  return ss.str();
+}
+
+template <>
+std::string Arrays::toString(const std::vector<antlr4::tree::ParseTree*> &source) {
+  std::string result = "[";
+  bool firstEntry = true;
+  for (auto *value : source) {
+    result += value->toStringTree();
+    if (firstEntry) {
+      result += ", ";
+      firstEntry = false;
+    }
+  }
+  return result + "]";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Arrays.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Arrays.h
new file mode 100644
index 0000000000..04b852d986
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Arrays.h
@@ -0,0 +1,149 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlrcpp {
+
+  class ANTLR4CPP_PUBLIC Arrays {
+  public:
+
+    static std::string listToString(const std::vector<std::string> &list, const std::string &separator);
+
+    template <typename T>
+    static bool equals(const std::vector<T> &a, const std::vector<T> &b) {
+      if (a.size() != b.size())
+        return false;
+
+      for (size_t i = 0; i < a.size(); ++i)
+        if (!(a[i] == b[i]))
+          return false;
+
+      return true;
+    }
+
+    template <typename T>
+    static bool equals(const std::vector<T *> &a, const std::vector<T *> &b) {
+      if (a.size() != b.size())
+        return false;
+
+      for (size_t i = 0; i < a.size(); ++i) {
+        if (!a[i] && !b[i])
+          continue;
+        if (!a[i] || !b[i])
+          return false;
+        if (a[i] == b[i])
+          continue;
+
+        if (!(*a[i] == *b[i]))
+          return false;
+      }
+
+      return true;
+    }
+
+    template <typename T>
+    static bool equals(const std::vector<Ref<T>> &a, const std::vector<Ref<T>> &b) {
+      if (a.size() != b.size())
+        return false;
+
+      for (size_t i = 0; i < a.size(); ++i) {
+        if (!a[i] && !b[i])
+          continue;
+        if (!a[i] || !b[i])
+          return false;
+        if (a[i] == b[i])
+          continue;
+
+        if (!(*a[i] == *b[i]))
+          return false;
+      }
+
+      return true;
+    }
+
+    template <typename T>
+    static bool equals(const std::vector<std::unique_ptr<T>> &a, const std::vector<std::unique_ptr<T>> &b) {
+      if (a.size() != b.size())
+        return false;
+
+      for (size_t i = 0; i < a.size(); ++i) {
+        if (!a[i] && !b[i])
+          continue;
+        if (!a[i] || !b[i])
+          return false;
+        if (a[i] == b[i])
+          continue;
+
+        if (!(*a[i] == *b[i]))
+          return false;
+      }
+
+      return true;
+    }
+
+    template <typename T>
+    static std::string toString(const std::vector<T> &source) {
+      std::string result = "[";
+      bool firstEntry = true;
+      for (auto &value : source) {
+        result += value.toString();
+        if (firstEntry) {
+          result += ", ";
+          firstEntry = false;
+        }
+      }
+      return result + "]";
+    }
+
+    template <typename T>
+    static std::string toString(const std::vector<Ref<T>> &source) {
+      std::string result = "[";
+      bool firstEntry = true;
+      for (auto &value : source) {
+        result += value->toString();
+        if (firstEntry) {
+          result += ", ";
+          firstEntry = false;
+        }
+      }
+      return result + "]";
+    }
+
+    template <typename T>
+    static std::string toString(const std::vector<std::unique_ptr<T>> &source) {
+      std::string result = "[";
+      bool firstEntry = true;
+      for (auto &value : source) {
+        result += value->toString();
+        if (firstEntry) {
+          result += ", ";
+          firstEntry = false;
+        }
+      }
+      return result + "]";
+    }
+
+    template <typename T>
+    static std::string toString(const std::vector<T *> &source) {
+      std::string result = "[";
+      bool firstEntry = true;
+      for (auto value : source) {
+        result += value->toString();
+        if (firstEntry) {
+          result += ", ";
+          firstEntry = false;
+        }
+      }
+      return result + "]";
+    }
+
+  };
+
+  template <>
+  std::string Arrays::toString(const std::vector<antlr4::tree::ParseTree *> &source);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/BitSet.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/BitSet.h
new file mode 100644
index 0000000000..bb30364be0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/BitSet.h
@@ -0,0 +1,76 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlrcpp {
+
+  class ANTLR4CPP_PUBLIC BitSet : public std::bitset<2048> {
+  public:
+    size_t nextSetBit(size_t pos) const {
+      for (size_t i = pos; i < size(); i++){
+        if (test(i)) {
+          return i;
+        }
+      }
+
+      return INVALID_INDEX;
+    }
+
+    // Prints a list of every index for which the bitset contains a bit in true.
+    friend std::wostream& operator << (std::wostream& os, const BitSet& obj)
+    {
+      os << "{";
+      size_t total = obj.count();
+      for (size_t i = 0; i < obj.size(); i++){
+        if (obj.test(i)){
+          os << i;
+          --total;
+          if (total > 1){
+            os << ", ";
+          }
+        }
+      }
+
+      os << "}";
+      return os;
+    }
+
+    static std::string subStringRepresentation(const std::vector<BitSet>::iterator &begin,
+                                                const std::vector<BitSet>::iterator &end) {
+      std::string result;
+      std::vector<BitSet>::iterator vectorIterator;
+
+      for (vectorIterator = begin; vectorIterator != end; vectorIterator++) {
+        result += vectorIterator->toString();
+      }
+      // Grab the end
+      result += end->toString();
+
+      return result;
+    }
+
+    std::string toString() const {
+      std::stringstream stream;
+      stream << "{";
+      bool valueAdded = false;
+      for (size_t i = 0; i < size(); ++i){
+        if (test(i)){
+          if (valueAdded) {
+            stream << ", ";
+          }
+          stream << i;
+          valueAdded = true;
+        }
+      }
+
+      stream << "}";
+      return stream.str();
+    }
+
+  };
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/CPPUtils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/CPPUtils.cpp
new file mode 100755
index 0000000000..95321b3dc1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/CPPUtils.cpp
@@ -0,0 +1,207 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "support/CPPUtils.h"
+
+namespace antlrcpp {
+
+  std::string join(const std::vector<std::string> &strings, const std::string &separator) {
+    std::string str;
+    bool firstItem = true;
+    for (const std::string &s : strings) {
+      if (!firstItem) {
+        str.append(separator);
+      }
+      firstItem = false;
+      str.append(s);
+    }
+    return str;
+  }
+
+  std::map<std::string, size_t> toMap(const std::vector<std::string> &keys) {
+    std::map<std::string, size_t> result;
+    for (size_t i = 0; i < keys.size(); ++i) {
+      result.insert({ keys[i], i });
+    }
+    return result;
+  }
+
+  std::string escapeWhitespace(std::string str, bool escapeSpaces) {
+    std::string result;
+    for (auto c : str) {
+      switch (c) {
+        case '\n':
+          result += "\\n";
+          break;
+
+        case '\r':
+          result += "\\r";
+          break;
+
+        case '\t':
+          result += "\\t";
+          break;
+
+        case ' ':
+          if (escapeSpaces) {
+            result += "\u00B7";
+            break;
+          }
+          result += c;
+          break;
+
+        default:
+          result += c;
+          break;
+      }
+    }
+
+    return result;
+  }
+
+  std::string toHexString(const int t) {
+    std::stringstream stream;
+    stream << std::uppercase << std::hex << t;
+    return stream.str();
+  }
+
+  std::string arrayToString(const std::vector<std::string> &data) {
+    std::string answer;
+    size_t toReserve = 0;
+    for (const auto &sub : data) {
+      toReserve += sub.size();
+    }
+    answer.reserve(toReserve);
+    for (const auto &sub: data) {
+      answer.append(sub);
+    }
+    return answer;
+  }
+
+  std::string replaceString(const std::string &s, const std::string &from, const std::string &to) {
+    std::string::size_type p;
+    std::string ss, res;
+
+    ss = s;
+    p = ss.find(from);
+    while (p != std::string::npos) {
+      if (p > 0)
+        res.append(ss.substr(0, p)).append(to);
+      else
+        res.append(to);
+      ss = ss.substr(p + from.size());
+      p = ss.find(from);
+    }
+    res.append(ss);
+
+    return res;
+  }
+
+  std::vector<std::string> split(const std::string &s, const std::string &sep, int count) {
+    std::vector<std::string> parts;
+    std::string ss = s;
+
+    std::string::size_type p;
+
+    if (s.empty())
+      return parts;
+
+    if (count == 0)
+      count= -1;
+
+    p = ss.find(sep);
+    while (!ss.empty() && p != std::string::npos && (count < 0 || count > 0)) {
+      parts.push_back(ss.substr(0, p));
+      ss = ss.substr(p+sep.size());
+
+      --count;
+      p = ss.find(sep);
+    }
+    parts.push_back(ss);
+
+    return parts;
+  }
+
+  //--------------------------------------------------------------------------------------------------
+
+  // Debugging helper. Adds indentation to all lines in the given string.
+  std::string indent(const std::string &s, const std::string &indentation, bool includingFirst) {
+    std::vector<std::string> parts = split(s, "\n", -1);
+    for (size_t i = 0; i < parts.size(); ++i) {
+      if (i == 0 && !includingFirst)
+        continue;
+      parts[i].insert(0, indentation);
+    }
+
+    return join(parts, "\n");
+  }
+
+  //--------------------------------------------------------------------------------------------------
+
+  // Recursively get the error from a, possibly nested, exception.
+#if defined(_MSC_FULL_VER) && _MSC_FULL_VER < 190023026
+  // No nested exceptions before VS 2015.
+  template <typename T>
+  std::exception_ptr get_nested(const T &/*e*/) {
+    try {
+      return nullptr;
+    }
+    catch (const std::bad_cast &) {
+      return nullptr;
+    }
+  }
+#else
+  template <typename T>
+  std::exception_ptr get_nested(const T &e) {
+    try {
+      auto nested = dynamic_cast<const std::nested_exception&>(e);
+      return nested.nested_ptr();
+    }
+    catch (const std::bad_cast &) {
+      return nullptr;
+    }
+  }
+#endif
+
+  std::string what(std::exception_ptr eptr) {
+    if (!eptr) {
+      throw std::bad_exception();
+    }
+
+    std::string result;
+    std::size_t nestCount = 0;
+
+    next: {
+      try {
+        std::exception_ptr yeptr;
+        std::swap(eptr, yeptr);
+        std::rethrow_exception(yeptr);
+      }
+      catch (const std::exception &e) {
+        result += e.what();
+        eptr = get_nested(e);
+      }
+      catch (const std::string &e) {
+        result += e;
+      }
+      catch (const char *e) {
+        result += e;
+      }
+      catch (...) {
+        result += "cannot be determined";
+      }
+
+      if (eptr) {
+        result += " (";
+        ++nestCount;
+        goto next;
+      }
+    }
+
+    result += std::string(nestCount, ')');
+    return result;
+  }
+
+} // namespace antlrcpp
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/CPPUtils.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/CPPUtils.h
new file mode 100644
index 0000000000..2eb1a36037
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/CPPUtils.h
@@ -0,0 +1,65 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlrcpp {
+
+  ANTLR4CPP_PUBLIC std::string join(const std::vector<std::string> &strings, const std::string &separator);
+  ANTLR4CPP_PUBLIC std::map<std::string, size_t> toMap(const std::vector<std::string> &keys);
+  ANTLR4CPP_PUBLIC std::string escapeWhitespace(std::string str, bool escapeSpaces);
+  ANTLR4CPP_PUBLIC std::string toHexString(const int t);
+  ANTLR4CPP_PUBLIC std::string arrayToString(const std::vector<std::string> &data);
+  ANTLR4CPP_PUBLIC std::string replaceString(const std::string &s, const std::string &from, const std::string &to);
+  ANTLR4CPP_PUBLIC std::vector<std::string> split(const std::string &s, const std::string &sep, int count);
+  ANTLR4CPP_PUBLIC std::string indent(const std::string &s, const std::string &indentation, bool includingFirst = true);
+
+  // Using RAII + a lambda to implement a "finally" replacement.
+  template <typename OnEnd>
+  struct FinalAction {
+    FinalAction(OnEnd f) : _cleanUp { std::move(f) } {}
+    FinalAction(FinalAction &&other) :
+	_cleanUp(std::move(other._cleanUp)), _enabled(other._enabled) {
+      other._enabled = false; // Don't trigger the lambda after ownership has moved.
+    }
+    ~FinalAction() { if (_enabled) _cleanUp(); }
+
+    void disable() { _enabled = false; }
+  private:
+    OnEnd _cleanUp;
+    bool _enabled {true};
+  };
+
+  template <typename OnEnd>
+  FinalAction<OnEnd> finally(OnEnd f) {
+    return FinalAction<OnEnd>(std::move(f));
+  }
+
+  // Convenience functions to avoid lengthy dynamic_cast() != nullptr checks in many places.
+  template <typename T1, typename T2>
+  inline bool is(T2 *obj) { // For pointer types.
+    return dynamic_cast<typename std::add_const<T1>::type>(obj) != nullptr;
+  }
+
+  template <typename T1, typename T2>
+  inline bool is(Ref<T2> const& obj) { // For shared pointers.
+    return dynamic_cast<T1 *>(obj.get()) != nullptr;
+  }
+
+  template <typename T>
+  std::string toString(const T &o) {
+    std::stringstream ss;
+    // typeid gives the mangled class name, but that's all what's possible
+    // in a portable way.
+    ss << typeid(o).name() << "@" << std::hex << reinterpret_cast<uintptr_t>(&o);
+    return ss.str();
+  }
+
+  // Get the error text from an exception pointer or the current exception.
+  ANTLR4CPP_PUBLIC std::string what(std::exception_ptr eptr = std::current_exception());
+
+} // namespace antlrcpp
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Casts.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Casts.h
new file mode 100644
index 0000000000..2ded955dcd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Casts.h
@@ -0,0 +1,34 @@
+/* Copyright (c) 2012-2021 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cassert>
+#include <memory>
+#include <type_traits>
+
+namespace antlrcpp {
+
+  template <typename To, typename From>
+  To downCast(From* from) {
+    static_assert(std::is_pointer_v<To>, "Target type not a pointer.");
+    static_assert(std::is_base_of_v<From, std::remove_pointer_t<To>>, "Target type not derived from source type.");
+  #if !defined(__GNUC__) || defined(__GXX_RTTI)
+    assert(from == nullptr || dynamic_cast<To>(from) != nullptr);
+  #endif
+    return static_cast<To>(from);
+  }
+
+  template <typename To, typename From>
+  To downCast(From& from) {
+    static_assert(std::is_lvalue_reference_v<To>, "Target type not a lvalue reference.");
+    static_assert(std::is_base_of_v<From, std::remove_reference_t<To>>, "Target type not derived from source type.");
+  #if !defined(__GNUC__) || defined(__GXX_RTTI)
+    assert(dynamic_cast<std::add_pointer_t<std::remove_reference_t<To>>>(std::addressof(from)) != nullptr);
+  #endif
+    return static_cast<To>(from);
+  }
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Declarations.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Declarations.h
new file mode 100644
index 0000000000..8e960676cf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Declarations.h
@@ -0,0 +1,161 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+namespace antlr4 {
+  class ANTLRErrorListener;
+  class ANTLRErrorStrategy;
+  class ANTLRFileStream;
+  class ANTLRInputStream;
+  class BailErrorStrategy;
+  class BaseErrorListener;
+  class BufferedTokenStream;
+  class CharStream;
+  class CommonToken;
+  class CommonTokenFactory;
+  class CommonTokenStream;
+  class ConsoleErrorListener;
+  class DefaultErrorStrategy;
+  class DiagnosticErrorListener;
+  class EmptyStackException;
+  class FailedPredicateException;
+  class IllegalArgumentException;
+  class IllegalStateException;
+  class InputMismatchException;
+  class IntStream;
+  class InterpreterRuleContext;
+  class Lexer;
+  class LexerInterpreter;
+  class LexerNoViableAltException;
+  class ListTokenSource;
+  class NoSuchElementException;
+  class NoViableAltException;
+  class NullPointerException;
+  class ParseCancellationException;
+  class Parser;
+  class ParserInterpreter;
+  class ParserRuleContext;
+  class ProxyErrorListener;
+  class RecognitionException;
+  class Recognizer;
+  class RuleContext;
+  class Token;
+  template<typename Symbol> class TokenFactory;
+  class TokenSource;
+  class TokenStream;
+  class TokenStreamRewriter;
+  class UnbufferedCharStream;
+  class UnbufferedTokenStream;
+  class WritableToken;
+
+  namespace misc {
+    class InterpreterDataReader;
+    class Interval;
+    class IntervalSet;
+    class MurmurHash;
+    class Utils;
+    class Predicate;
+  }
+  namespace atn {
+    class ATN;
+    class ATNConfig;
+    class ATNConfigSet;
+    class ATNDeserializationOptions;
+    class ATNDeserializer;
+    class ATNSerializer;
+    class ATNSimulator;
+    class ATNState;
+    enum class ATNType;
+    class ActionTransition;
+    class ArrayPredictionContext;
+    class AtomTransition;
+    class BasicBlockStartState;
+    class BasicState;
+    class BlockEndState;
+    class BlockStartState;
+    class DecisionState;
+    class EpsilonTransition;
+    class LL1Analyzer;
+    class LexerAction;
+    class LexerActionExecutor;
+    class LexerATNConfig;
+    class LexerATNSimulator;
+    class LexerMoreAction;
+    class LexerPopModeAction;
+    class LexerSkipAction;
+    class LookaheadEventInfo;
+    class LoopEndState;
+    class NotSetTransition;
+    class OrderedATNConfigSet;
+    class ParseInfo;
+    class ParserATNSimulator;
+    class PlusBlockStartState;
+    class PlusLoopbackState;
+    class PrecedencePredicateTransition;
+    class PredicateTransition;
+    class PredictionContext;
+    enum class PredictionMode;
+    class PredictionModeClass;
+    class RangeTransition;
+    class RuleStartState;
+    class RuleStopState;
+    class RuleTransition;
+    class SemanticContext;
+    class SetTransition;
+    class SingletonPredictionContext;
+    class StarBlockStartState;
+    class StarLoopEntryState;
+    class StarLoopbackState;
+    class TokensStartState;
+    class Transition;
+    class WildcardTransition;
+  }
+  namespace dfa {
+    class DFA;
+    class DFASerializer;
+    class DFAState;
+    class LexerDFASerializer;
+    class Vocabulary;
+  }
+  namespace tree {
+    class AbstractParseTreeVisitor;
+    class ErrorNode;
+    class ErrorNodeImpl;
+    class ParseTree;
+    class ParseTreeListener;
+    template<typename T> class ParseTreeProperty;
+    class ParseTreeVisitor;
+    class ParseTreeWalker;
+    class SyntaxTree;
+    class TerminalNode;
+    class TerminalNodeImpl;
+    class Tree;
+    class Trees;
+
+    namespace pattern {
+      class Chunk;
+      class ParseTreeMatch;
+      class ParseTreePattern;
+      class ParseTreePatternMatcher;
+      class RuleTagToken;
+      class TagChunk;
+      class TextChunk;
+      class TokenTagToken;
+    }
+
+    namespace xpath {
+      class XPath;
+      class XPathElement;
+      class XPathLexerErrorListener;
+      class XPathRuleAnywhereElement;
+      class XPathRuleElement;
+      class XPathTokenAnywhereElement;
+      class XPathTokenElement;
+      class XPathWildcardAnywhereElement;
+      class XPathWildcardElement;
+    }
+  }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/StringUtils.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/StringUtils.cpp
new file mode 100644
index 0000000000..9ee274c8de
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/StringUtils.cpp
@@ -0,0 +1,38 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "support/StringUtils.h"
+
+namespace antlrcpp {
+
+  std::string escapeWhitespace(std::string_view in) {
+    std::string out;
+    escapeWhitespace(out, in);
+    out.shrink_to_fit();
+    return out;
+  }
+
+  std::string& escapeWhitespace(std::string& out, std::string_view in) {
+    out.reserve(in.size());  // Best case, no escaping.
+    for (const auto &c : in) {
+      switch (c) {
+        case '\t':
+          out.append("\\t");
+          break;
+        case '\r':
+          out.append("\\r");
+          break;
+        case '\n':
+          out.append("\\n");
+          break;
+        default:
+          out.push_back(c);
+          break;
+      }
+    }
+    return out;
+  }
+
+} // namespace antrlcpp
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/StringUtils.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/StringUtils.h
new file mode 100644
index 0000000000..aee0d46d6e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/StringUtils.h
@@ -0,0 +1,16 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlrcpp {
+
+  ANTLR4CPP_PUBLIC std::string escapeWhitespace(std::string_view in);
+
+  ANTLR4CPP_PUBLIC std::string& escapeWhitespace(std::string& out, std::string_view in);
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Unicode.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Unicode.h
new file mode 100644
index 0000000000..f0f84375ad
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Unicode.h
@@ -0,0 +1,28 @@
+/* Copyright (c) 2021 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlrcpp {
+
+  class ANTLR4CPP_PUBLIC Unicode final {
+  public:
+    static constexpr char32_t REPLACEMENT_CHARACTER = 0xfffd;
+
+    static constexpr bool isValid(char32_t codePoint) {
+      return codePoint < 0xd800 || (codePoint > 0xdfff && codePoint <= 0x10ffff);
+    }
+
+  private:
+    Unicode() = delete;
+    Unicode(const Unicode&) = delete;
+    Unicode(Unicode&&) = delete;
+    Unicode& operator=(const Unicode&) = delete;
+    Unicode& operator=(Unicode&&) = delete;
+  };
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Utf8.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Utf8.cpp
new file mode 100644
index 0000000000..294e9f1b21
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Utf8.cpp
@@ -0,0 +1,242 @@
+/* Copyright (c) 2021 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include <cassert>
+#include <cstdint>
+
+#include "support/Utf8.h"
+#include "support/Unicode.h"
+
+// The below implementation is based off of https://github.com/google/cel-cpp/internal/utf8.cc,
+// which is itself based off of https://go.googlesource.com/go/+/refs/heads/master/src/unicode/utf8/utf8.go.
+// If for some reason you feel the need to copy this implementation, please retain a comment
+// referencing the two source files and giving credit, as well as maintaining any and all
+// obligations required by the BSD 3-clause license that governs this file.
+
+namespace antlrcpp {
+
+namespace {
+
+#undef SELF
+  constexpr uint8_t SELF = 0x80;
+
+#undef LOW
+  constexpr uint8_t LOW = 0x80;
+#undef HIGH
+  constexpr uint8_t HIGH = 0xbf;
+
+#undef MASKX
+  constexpr uint8_t MASKX = 0x3f;
+#undef MASK2
+  constexpr uint8_t MASK2 = 0x1f;
+#undef MASK3
+  constexpr uint8_t MASK3 = 0xf;
+#undef MASK4
+  constexpr uint8_t MASK4 = 0x7;
+
+#undef TX
+  constexpr uint8_t TX = 0x80;
+#undef T2
+  constexpr uint8_t T2 = 0xc0;
+#undef T3
+  constexpr uint8_t T3 = 0xe0;
+#undef T4
+  constexpr uint8_t T4 = 0xf0;
+
+#undef XX
+  constexpr uint8_t XX = 0xf1;
+#undef AS
+  constexpr uint8_t AS = 0xf0;
+#undef S1
+  constexpr uint8_t S1 = 0x02;
+#undef S2
+  constexpr uint8_t S2 = 0x13;
+#undef S3
+  constexpr uint8_t S3 = 0x03;
+#undef S4
+  constexpr uint8_t S4 = 0x23;
+#undef S5
+  constexpr uint8_t S5 = 0x34;
+#undef S6
+  constexpr uint8_t S6 = 0x04;
+#undef S7
+  constexpr uint8_t S7 = 0x44;
+
+  // NOLINTBEGIN
+  // clang-format off
+#undef LEADING
+  constexpr uint8_t LEADING[256] = {
+    //   1   2   3   4   5   6   7   8   9   A   B   C   D   E   F
+    AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, // 0x00-0x0F
+    AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, // 0x10-0x1F
+    AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, // 0x20-0x2F
+    AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, // 0x30-0x3F
+    AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, // 0x40-0x4F
+    AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, // 0x50-0x5F
+    AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, // 0x60-0x6F
+    AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, AS, // 0x70-0x7F
+    //   1   2   3   4   5   6   7   8   9   A   B   C   D   E   F
+    XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, // 0x80-0x8F
+    XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, // 0x90-0x9F
+    XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, // 0xA0-0xAF
+    XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, // 0xB0-0xBF
+    XX, XX, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, // 0xC0-0xCF
+    S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, S1, // 0xD0-0xDF
+    S2, S3, S3, S3, S3, S3, S3, S3, S3, S3, S3, S3, S3, S4, S3, S3, // 0xE0-0xEF
+    S5, S6, S6, S6, S7, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, // 0xF0-0xFF
+  };
+  // clang-format on
+  // NOLINTEND
+
+#undef ACCEPT
+  constexpr std::pair<uint8_t, uint8_t> ACCEPT[16] = {
+      {LOW, HIGH}, {0xa0, HIGH}, {LOW, 0x9f}, {0x90, HIGH},
+      {LOW, 0x8f}, {0x0, 0x0},   {0x0, 0x0},  {0x0, 0x0},
+      {0x0, 0x0},  {0x0, 0x0},   {0x0, 0x0},  {0x0, 0x0},
+      {0x0, 0x0},  {0x0, 0x0},   {0x0, 0x0},  {0x0, 0x0},
+  };
+
+}  // namespace
+
+  std::pair<char32_t, size_t> Utf8::decode(std::string_view input) {
+    assert(!input.empty());
+    const auto b = static_cast<uint8_t>(input.front());
+    input.remove_prefix(1);
+    if (b < SELF) {
+      return {static_cast<char32_t>(b), 1};
+    }
+    const auto leading = LEADING[b];
+    if (leading == XX) {
+      return {Unicode::REPLACEMENT_CHARACTER, 1};
+    }
+    auto size = static_cast<size_t>(leading & 7) - 1;
+    if (size > input.size()) {
+      return {Unicode::REPLACEMENT_CHARACTER, 1};
+    }
+    const auto& accept = ACCEPT[leading >> 4];
+    const auto b1 = static_cast<uint8_t>(input.front());
+    input.remove_prefix(1);
+    if (b1 < accept.first || b1 > accept.second) {
+      return {Unicode::REPLACEMENT_CHARACTER, 1};
+    }
+    if (size <= 1) {
+      return {(static_cast<char32_t>(b & MASK2) << 6) |
+                  static_cast<char32_t>(b1 & MASKX),
+              2};
+    }
+    const auto b2 = static_cast<uint8_t>(input.front());
+    input.remove_prefix(1);
+    if (b2 < LOW || b2 > HIGH) {
+      return {Unicode::REPLACEMENT_CHARACTER, 1};
+    }
+    if (size <= 2) {
+      return {(static_cast<char32_t>(b & MASK3) << 12) |
+                  (static_cast<char32_t>(b1 & MASKX) << 6) |
+                  static_cast<char32_t>(b2 & MASKX),
+              3};
+    }
+    const auto b3 = static_cast<uint8_t>(input.front());
+    input.remove_prefix(1);
+    if (b3 < LOW || b3 > HIGH) {
+      return {Unicode::REPLACEMENT_CHARACTER, 1};
+    }
+    return {(static_cast<char32_t>(b & MASK4) << 18) |
+                (static_cast<char32_t>(b1 & MASKX) << 12) |
+                (static_cast<char32_t>(b2 & MASKX) << 6) |
+                static_cast<char32_t>(b3 & MASKX),
+            4};
+  }
+
+  std::optional<std::u32string> Utf8::strictDecode(std::string_view input) {
+    std::u32string output;
+    char32_t codePoint;
+    size_t codeUnits;
+    output.reserve(input.size());  // Worst case is each byte is a single Unicode code point.
+    for (size_t index = 0; index < input.size(); index += codeUnits) {
+      std::tie(codePoint, codeUnits) = Utf8::decode(input.substr(index));
+      if (codePoint == Unicode::REPLACEMENT_CHARACTER && codeUnits == 1) {
+        // Condition is only met when an illegal byte sequence is encountered. See Utf8::decode.
+        return std::nullopt;
+      }
+      output.push_back(codePoint);
+    }
+    output.shrink_to_fit();
+    return output;
+  }
+
+  std::u32string Utf8::lenientDecode(std::string_view input) {
+    std::u32string output;
+    char32_t codePoint;
+    size_t codeUnits;
+    output.reserve(input.size());  // Worst case is each byte is a single Unicode code point.
+    for (size_t index = 0; index < input.size(); index += codeUnits) {
+      std::tie(codePoint, codeUnits) = Utf8::decode(input.substr(index));
+      output.push_back(codePoint);
+    }
+    output.shrink_to_fit();
+    return output;
+  }
+
+  std::string& Utf8::encode(std::string* buffer, char32_t codePoint) {
+    assert(buffer != nullptr);
+    if (!Unicode::isValid(codePoint)) {
+      codePoint = Unicode::REPLACEMENT_CHARACTER;
+    }
+    if (codePoint <= 0x7f) {
+      buffer->push_back(static_cast<char>(static_cast<uint8_t>(codePoint)));
+    } else if (codePoint <= 0x7ff) {
+      buffer->push_back(
+          static_cast<char>(T2 | static_cast<uint8_t>(codePoint >> 6)));
+      buffer->push_back(
+          static_cast<char>(TX | (static_cast<uint8_t>(codePoint) & MASKX)));
+    } else if (codePoint <= 0xffff) {
+      buffer->push_back(
+          static_cast<char>(T3 | static_cast<uint8_t>(codePoint >> 12)));
+      buffer->push_back(static_cast<char>(
+          TX | (static_cast<uint8_t>(codePoint >> 6) & MASKX)));
+      buffer->push_back(
+          static_cast<char>(TX | (static_cast<uint8_t>(codePoint) & MASKX)));
+    } else {
+      buffer->push_back(
+          static_cast<char>(T4 | static_cast<uint8_t>(codePoint >> 18)));
+      buffer->push_back(static_cast<char>(
+          TX | (static_cast<uint8_t>(codePoint >> 12) & MASKX)));
+      buffer->push_back(static_cast<char>(
+          TX | (static_cast<uint8_t>(codePoint >> 6) & MASKX)));
+      buffer->push_back(
+          static_cast<char>(TX | (static_cast<uint8_t>(codePoint) & MASKX)));
+    }
+    return *buffer;
+  }
+
+  std::optional<std::string> Utf8::strictEncode(std::u32string_view input) {
+    std::string output;
+    output.reserve(input.size() * 4);  // Worst case is each Unicode code point encodes to 4 bytes.
+    for (size_t index = 0; index < input.size(); index++) {
+      char32_t codePoint = input[index];
+      if (!Unicode::isValid(codePoint)) {
+        return std::nullopt;
+      }
+      Utf8::encode(&output, codePoint);
+    }
+    output.shrink_to_fit();
+    return output;
+  }
+
+  std::string Utf8::lenientEncode(std::u32string_view input) {
+    std::string output;
+    output.reserve(input.size() * 4);  // Worst case is each Unicode code point encodes to 4 bytes.
+    for (size_t index = 0; index < input.size(); index++) {
+      char32_t codePoint = input[index];
+      if (!Unicode::isValid(codePoint)) {
+        codePoint = Unicode::REPLACEMENT_CHARACTER;
+      }
+      Utf8::encode(&output, codePoint);
+    }
+    output.shrink_to_fit();
+    return output;
+  }
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Utf8.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Utf8.h
new file mode 100644
index 0000000000..e4828441cd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/support/Utf8.h
@@ -0,0 +1,54 @@
+/* Copyright (c) 2021 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <optional>
+#include <string>
+#include <string_view>
+#include <tuple>
+
+#include "antlr4-common.h"
+
+namespace antlrcpp {
+
+  class ANTLR4CPP_PUBLIC Utf8 final {
+  public:
+    // Decodes the next code point, returning the decoded code point and the number
+    // of code units (a.k.a. bytes) consumed. In the event that an invalid code unit
+    // sequence is returned the replacement character, U+FFFD, is returned with a
+    // code unit count of 1. As U+FFFD requires 3 code units when encoded, this can
+    // be used to differentiate valid input from malformed input.
+    static std::pair<char32_t, size_t> decode(std::string_view input);
+
+    // Decodes the given UTF-8 encoded input into a string of code points.
+    static std::optional<std::u32string> strictDecode(std::string_view input);
+
+    // Decodes the given UTF-8 encoded input into a string of code points. Unlike strictDecode(),
+    // each byte in an illegal byte sequence is replaced with the Unicode replacement character,
+    // U+FFFD.
+    static std::u32string lenientDecode(std::string_view input);
+
+    // Encodes the given code point and appends it to the buffer. If the code point
+    // is an unpaired surrogate or outside of the valid Unicode range it is replaced
+    // with the replacement character, U+FFFD.
+    static std::string& encode(std::string *buffer, char32_t codePoint);
+
+    // Encodes the given Unicode code point string as UTF-8.
+    static std::optional<std::string> strictEncode(std::u32string_view input);
+
+    // Encodes the given Unicode code point string as UTF-8. Unlike strictEncode(),
+    // each invalid Unicode code point is replaced with the Unicode replacement character, U+FFFD.
+    static std::string lenientEncode(std::u32string_view input);
+
+  private:
+    Utf8() = delete;
+    Utf8(const Utf8&) = delete;
+    Utf8(Utf8&&) = delete;
+    Utf8& operator=(const Utf8&) = delete;
+    Utf8& operator=(Utf8&&) = delete;
+  };
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/AbstractParseTreeVisitor.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/AbstractParseTreeVisitor.h
new file mode 100755
index 0000000000..37b80b3fbe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/AbstractParseTreeVisitor.h
@@ -0,0 +1,129 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "tree/ParseTree.h"
+#include "tree/ParseTreeVisitor.h"
+
+namespace antlr4 {
+namespace tree {
+
+  class ANTLR4CPP_PUBLIC AbstractParseTreeVisitor : public ParseTreeVisitor {
+  public:
+    /// The default implementation calls <seealso cref="ParseTree#accept"/> on the
+    /// specified tree.
+    virtual std::any visit(ParseTree *tree) override {
+      return tree->accept(this);
+    }
+
+    /**
+     * <p>The default implementation initializes the aggregate result to
+     * {@link #defaultResult defaultResult()}. Before visiting each child, it
+     * calls {@link #shouldVisitNextChild shouldVisitNextChild}; if the result
+     * is {@code false} no more children are visited and the current aggregate
+     * result is returned. After visiting a child, the aggregate result is
+     * updated by calling {@link #aggregateResult aggregateResult} with the
+     * previous aggregate result and the result of visiting the child.</p>
+     *
+     * <p>The default implementation is not safe for use in visitors that modify
+     * the tree structure. Visitors that modify the tree should override this
+     * method to behave properly in respect to the specific algorithm in use.</p>
+     */
+    virtual std::any visitChildren(ParseTree *node) override {
+      std::any result = defaultResult();
+      size_t n = node->children.size();
+      for (size_t i = 0; i < n; i++) {
+        if (!shouldVisitNextChild(node, result)) {
+          break;
+        }
+
+        std::any childResult = node->children[i]->accept(this);
+        result = aggregateResult(std::move(result), std::move(childResult));
+      }
+
+      return result;
+    }
+
+    /// The default implementation returns the result of
+    /// <seealso cref="#defaultResult defaultResult"/>.
+    virtual std::any visitTerminal(TerminalNode * /*node*/) override {
+      return defaultResult();
+    }
+
+    /// The default implementation returns the result of
+    /// <seealso cref="#defaultResult defaultResult"/>.
+    virtual std::any visitErrorNode(ErrorNode * /*node*/) override {
+      return defaultResult();
+    }
+
+  protected:
+    /// <summary>
+    /// Gets the default value returned by visitor methods. This value is
+    /// returned by the default implementations of
+    /// <seealso cref="#visitTerminal visitTerminal"/>, <seealso cref="#visitErrorNode visitErrorNode"/>.
+    /// The default implementation of <seealso cref="#visitChildren visitChildren"/>
+    /// initializes its aggregate result to this value.
+    /// <p/>
+    /// The base implementation returns {@code std::any()}.
+    /// </summary>
+    /// <returns> The default value returned by visitor methods. </returns>
+    virtual std::any defaultResult() {
+      return std::any();
+    }
+
+    /// <summary>
+    /// Aggregates the results of visiting multiple children of a node. After
+    /// either all children are visited or <seealso cref="#shouldVisitNextChild"/> returns
+    /// {@code false}, the aggregate value is returned as the result of
+    /// <seealso cref="#visitChildren"/>.
+    /// <p/>
+    /// The default implementation returns {@code nextResult}, meaning
+    /// <seealso cref="#visitChildren"/> will return the result of the last child visited
+    /// (or return the initial value if the node has no children).
+    /// </summary>
+    /// <param name="aggregate"> The previous aggregate value. In the default
+    /// implementation, the aggregate value is initialized to
+    /// <seealso cref="#defaultResult"/>, which is passed as the {@code aggregate} argument
+    /// to this method after the first child node is visited. </param>
+    /// <param name="nextResult"> The result of the immediately preceeding call to visit
+    /// a child node.
+    /// </param>
+    /// <returns> The updated aggregate result. </returns>
+    virtual std::any aggregateResult(std::any /*aggregate*/, std::any nextResult) {
+      return nextResult;
+    }
+
+    /// <summary>
+    /// This method is called after visiting each child in
+    /// <seealso cref="#visitChildren"/>. This method is first called before the first
+    /// child is visited; at that point {@code currentResult} will be the initial
+    /// value (in the default implementation, the initial value is returned by a
+    /// call to <seealso cref="#defaultResult"/>. This method is not called after the last
+    /// child is visited.
+    /// <p/>
+    /// The default implementation always returns {@code true}, indicating that
+    /// {@code visitChildren} should only return after all children are visited.
+    /// One reason to override this method is to provide a "short circuit"
+    /// evaluation option for situations where the result of visiting a single
+    /// child has the potential to determine the result of the visit operation as
+    /// a whole.
+    /// </summary>
+    /// <param name="node"> The <seealso cref="ParseTree"/> whose children are currently being
+    /// visited. </param>
+    /// <param name="currentResult"> The current aggregate result of the children visited
+    /// to the current point.
+    /// </param>
+    /// <returns> {@code true} to continue visiting children. Otherwise return
+    /// {@code false} to stop visiting children and immediately return the
+    /// current aggregate result from <seealso cref="#visitChildren"/>. </returns>
+    virtual bool shouldVisitNextChild(ParseTree * /*node*/, const std::any &/*currentResult*/) {
+      return true;
+    }
+
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ErrorNode.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ErrorNode.h
new file mode 100755
index 0000000000..c77a5a246a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ErrorNode.h
@@ -0,0 +1,24 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "tree/TerminalNode.h"
+
+namespace antlr4 {
+namespace tree {
+
+  class ANTLR4CPP_PUBLIC ErrorNode : public TerminalNode {
+  public:
+    static bool is(const tree::ParseTree &parseTree) { return parseTree.getTreeType() == tree::ParseTreeType::ERROR; }
+
+    static bool is(const tree::ParseTree *parseTree) { return parseTree != nullptr && is(*parseTree); }
+
+  protected:
+    using TerminalNode::TerminalNode;
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ErrorNodeImpl.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ErrorNodeImpl.cpp
new file mode 100755
index 0000000000..f13833fa5c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ErrorNodeImpl.cpp
@@ -0,0 +1,54 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/Interval.h"
+#include "Token.h"
+#include "RuleContext.h"
+#include "tree/ParseTreeVisitor.h"
+
+#include "tree/ErrorNodeImpl.h"
+
+using namespace antlr4;
+using namespace antlr4::tree;
+
+Token* ErrorNodeImpl::getSymbol() const {
+  return symbol;
+}
+
+void ErrorNodeImpl::setParent(RuleContext *parent_) {
+  this->parent = parent_;
+}
+
+misc::Interval ErrorNodeImpl::getSourceInterval() {
+  if (symbol == nullptr) {
+    return misc::Interval::INVALID;
+  }
+
+  size_t tokenIndex = symbol->getTokenIndex();
+  return misc::Interval(tokenIndex, tokenIndex);
+}
+
+std::any ErrorNodeImpl::accept(ParseTreeVisitor *visitor) {
+  return visitor->visitErrorNode(this);
+}
+
+std::string ErrorNodeImpl::getText() {
+  return symbol->getText();
+}
+
+std::string ErrorNodeImpl::toStringTree(Parser * /*parser*/, bool /*pretty*/) {
+  return toString();
+}
+
+std::string ErrorNodeImpl::toString() {
+  if (symbol->getType() == Token::EOF) {
+    return "<EOF>";
+  }
+  return symbol->getText();
+}
+
+std::string ErrorNodeImpl::toStringTree(bool /*pretty*/) {
+  return toString();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ErrorNodeImpl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ErrorNodeImpl.h
new file mode 100755
index 0000000000..dc9bd10587
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ErrorNodeImpl.h
@@ -0,0 +1,43 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "tree/ErrorNode.h"
+#include "tree/TerminalNodeImpl.h"
+#include "misc/Interval.h"
+
+#include "support/Any.h"
+
+namespace antlr4 {
+namespace tree {
+
+  /// <summary>
+  /// Represents a token that was consumed during resynchronization
+  ///  rather than during a valid match operation. For example,
+  ///  we will create this kind of a node during single token insertion
+  ///  and deletion as well as during "consume until error recovery set"
+  ///  upon no viable alternative exceptions.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC ErrorNodeImpl : public ErrorNode {
+  public:
+    Token *symbol;
+
+    explicit ErrorNodeImpl(Token *symbol) : ErrorNode(ParseTreeType::ERROR), symbol(symbol) {}
+
+    virtual Token* getSymbol() const override;
+    virtual void setParent(RuleContext *parent) override;
+    virtual misc::Interval getSourceInterval() override;
+
+    virtual std::any accept(ParseTreeVisitor *visitor) override;
+
+    virtual std::string getText() override;
+    virtual std::string toStringTree(Parser *parser, bool pretty = false) override;
+    virtual std::string toString() override;
+    virtual std::string toStringTree(bool pretty = false) override;
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/IterativeParseTreeWalker.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/IterativeParseTreeWalker.cpp
new file mode 100644
index 0000000000..83e6339518
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/IterativeParseTreeWalker.cpp
@@ -0,0 +1,66 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "support/CPPUtils.h"
+#include "support/Casts.h"
+
+#include "tree/ParseTreeListener.h"
+#include "tree/ParseTree.h"
+#include "tree/ErrorNode.h"
+
+#include "IterativeParseTreeWalker.h"
+
+using namespace antlr4::tree;
+using namespace antlrcpp;
+
+void IterativeParseTreeWalker::walk(ParseTreeListener *listener, ParseTree *t) const {
+  std::vector<std::pair<ParseTree*, size_t>> stack;
+  ParseTree *currentNode = t;
+  size_t currentIndex = 0;
+
+  while (currentNode != nullptr) {
+    // pre-order visit
+    if (ErrorNode::is(*currentNode)) {
+      listener->visitErrorNode(downCast<ErrorNode*>(currentNode));
+    } else if (TerminalNode::is(*currentNode)) {
+      listener->visitTerminal(downCast<TerminalNode*>(currentNode));
+    } else {
+      enterRule(listener, currentNode);
+    }
+
+    // Move down to first child, if it exists.
+    if (!currentNode->children.empty()) {
+      stack.push_back(std::make_pair(currentNode, currentIndex));
+      currentIndex = 0;
+      currentNode = currentNode->children[0];
+      continue;
+    }
+
+    // No child nodes, so walk tree.
+    do {
+      // post-order visit
+      if (!TerminalNode::is(*currentNode)) {
+        exitRule(listener, currentNode);
+      }
+
+      // No parent, so no siblings.
+      if (stack.empty()) {
+        currentNode = nullptr;
+        currentIndex = 0;
+        break;
+      }
+
+      // Move to next sibling if possible.
+      if (stack.back().first->children.size() > ++currentIndex) {
+        currentNode = stack.back().first->children[currentIndex];
+        break;
+      }
+
+      // No next sibling, so move up.
+      std::tie(currentNode, currentIndex) = stack.back();
+      stack.pop_back();
+    } while (currentNode != nullptr);
+  }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/IterativeParseTreeWalker.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/IterativeParseTreeWalker.h
new file mode 100644
index 0000000000..8957d87e44
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/IterativeParseTreeWalker.h
@@ -0,0 +1,53 @@
+/*
+ * [The "BSD license"]
+ *  Copyright (c) 2012 Terence Parr
+ *  Copyright (c) 2012 Sam Harwell
+ *  All rights reserved.
+ *
+ *  Redistribution and use in source and binary forms, with or without
+ *  modification, are permitted provided that the following conditions
+ *  are met:
+ *
+ *  1. Redistributions of source code must retain the above copyright
+ *     notice, this list of conditions and the following disclaimer.
+ *  2. Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *  3. The name of the author may not be used to endorse or promote products
+ *     derived from this software without specific prior written permission.
+ *
+ *  THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ *  IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ *  OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ *  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ *  NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ *  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+#include "tree/ParseTreeWalker.h"
+
+namespace antlr4 {
+namespace tree {
+
+  class ParseTreeListener;
+  
+  /**
+   * An iterative (read: non-recursive) pre-order and post-order tree walker that
+   * doesn't use the thread stack but heap-based stacks. Makes it possible to
+   * process deeply nested parse trees.
+   */
+  class ANTLR4CPP_PUBLIC IterativeParseTreeWalker : public ParseTreeWalker {
+  public:
+    virtual void walk(ParseTreeListener *listener, ParseTree *t) const override;
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTree.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTree.cpp
new file mode 100755
index 0000000000..2d529cb011
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTree.cpp
@@ -0,0 +1,12 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/ParseTree.h"
+
+using namespace antlr4::tree;
+
+bool ParseTree::operator == (const ParseTree &other) const {
+  return &other == this;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTree.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTree.h
new file mode 100755
index 0000000000..ad9aafd4f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTree.h
@@ -0,0 +1,111 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "support/Any.h"
+#include "tree/ParseTreeType.h"
+
+namespace antlr4 {
+namespace tree {
+
+  /// An interface to access the tree of <seealso cref="RuleContext"/> objects created
+  /// during a parse that makes the data structure look like a simple parse tree.
+  /// This node represents both internal nodes, rule invocations,
+  /// and leaf nodes, token matches.
+  ///
+  /// The payload is either a <seealso cref="Token"/> or a <seealso cref="RuleContext"/> object.
+  // ml: This class unites 4 Java classes: RuleNode, ParseTree, SyntaxTree and Tree.
+  class ANTLR4CPP_PUBLIC ParseTree {
+  public:
+    ParseTree(ParseTree const&) = delete;
+
+    virtual ~ParseTree() = default;
+
+    ParseTree& operator=(ParseTree const&) = delete;
+
+    /// The parent of this node. If the return value is null, then this
+    /// node is the root of the tree.
+    ParseTree *parent = nullptr;
+
+    /// If we are debugging or building a parse tree for a visitor,
+    /// we need to track all of the tokens and rule invocations associated
+    /// with this rule's context. This is empty for parsing w/o tree constr.
+    /// operation because we don't the need to track the details about
+    /// how we parse this rule.
+    // ml: memory is not managed here, but by the owning class. This is just for the structure.
+    std::vector<ParseTree *> children;
+
+    /// Print out a whole tree, not just a node, in LISP format
+    /// {@code (root child1 .. childN)}. Print just a node if this is a leaf.
+    virtual std::string toStringTree(bool pretty = false) = 0;
+    virtual std::string toString() = 0;
+
+    /// Specialize toStringTree so that it can print out more information
+    /// based upon the parser.
+    virtual std::string toStringTree(Parser *parser, bool pretty = false) = 0;
+
+    bool operator == (const ParseTree &other) const;
+
+    /// The <seealso cref="ParseTreeVisitor"/> needs a double dispatch method.
+    // ml: This has been changed to use Any instead of a template parameter, to avoid the need of a virtual template function.
+    virtual std::any accept(ParseTreeVisitor *visitor) = 0;
+
+    /// Return the combined text of all leaf nodes. Does not get any
+    /// off-channel tokens (if any) so won't return whitespace and
+    /// comments if they are sent to parser on hidden channel.
+    virtual std::string getText() = 0;
+
+    /**
+     * Return an {@link Interval} indicating the index in the
+     * {@link TokenStream} of the first and last token associated with this
+     * subtree. If this node is a leaf, then the interval represents a single
+     * token and has interval i..i for token index i.
+     *
+     * <p>An interval of i..i-1 indicates an empty interval at position
+     * i in the input stream, where 0 &lt;= i &lt;= the size of the input
+     * token stream.  Currently, the code base can only have i=0..n-1 but
+     * in concept one could have an empty interval after EOF. </p>
+     *
+     * <p>If source interval is unknown, this returns {@link Interval#INVALID}.</p>
+     *
+     * <p>As a weird special case, the source interval for rules matched after
+     * EOF is unspecified.</p>
+     */
+    virtual misc::Interval getSourceInterval() = 0;
+
+    ParseTreeType getTreeType() const { return _treeType; }
+
+  protected:
+    explicit ParseTree(ParseTreeType treeType) : _treeType(treeType) {}
+
+  private:
+    const ParseTreeType _treeType;
+  };
+
+  // A class to help managing ParseTree instances without the need of a shared_ptr.
+  class ANTLR4CPP_PUBLIC ParseTreeTracker {
+  public:
+    template<typename T, typename ... Args>
+    T* createInstance(Args&& ... args) {
+      static_assert(std::is_base_of<ParseTree, T>::value, "Argument must be a parse tree type");
+      T* result = new T(args...);
+      _allocated.push_back(result);
+      return result;
+    }
+
+    void reset() {
+      for (auto * entry : _allocated)
+        delete entry;
+      _allocated.clear();
+    }
+
+  private:
+    std::vector<ParseTree *> _allocated;
+  };
+
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeListener.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeListener.cpp
new file mode 100644
index 0000000000..ce12297586
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeListener.cpp
@@ -0,0 +1,9 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "ParseTreeListener.h"
+
+antlr4::tree::ParseTreeListener::~ParseTreeListener() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeListener.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeListener.h
new file mode 100755
index 0000000000..6a7f96a154
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeListener.h
@@ -0,0 +1,39 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace tree {
+
+  /** This interface describes the minimal core of methods triggered
+   *  by {@link ParseTreeWalker}. E.g.,
+   *
+   *  	ParseTreeWalker walker = new ParseTreeWalker();
+   *		walker.walk(myParseTreeListener, myParseTree); <-- triggers events in your listener
+   *
+   *  If you want to trigger events in multiple listeners during a single
+   *  tree walk, you can use the ParseTreeDispatcher object available at
+   *
+   * 		https://github.com/antlr/antlr4/issues/841
+   */
+  class ANTLR4CPP_PUBLIC ParseTreeListener {
+  public:
+    virtual ~ParseTreeListener();
+
+    virtual void visitTerminal(TerminalNode *node) = 0;
+    virtual void visitErrorNode(ErrorNode *node) = 0;
+    virtual void enterEveryRule(ParserRuleContext *ctx) = 0;
+    virtual void exitEveryRule(ParserRuleContext *ctx) = 0;
+
+    bool operator == (const ParseTreeListener &other) {
+      return this == &other;
+    }
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeProperty.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeProperty.h
new file mode 100755
index 0000000000..8669a1046e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeProperty.h
@@ -0,0 +1,50 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace tree {
+
+  /// <summary>
+  /// Associate a property with a parse tree node. Useful with parse tree listeners
+  /// that need to associate values with particular tree nodes, kind of like
+  /// specifying a return value for the listener event method that visited a
+  /// particular node. Example:
+  ///
+  /// <pre>
+  /// ParseTreeProperty&lt;Integer&gt; values = new ParseTreeProperty&lt;Integer&gt;();
+  /// values.put(tree, 36);
+  /// int x = values.get(tree);
+  /// values.removeFrom(tree);
+  /// </pre>
+  ///
+  /// You would make one decl (values here) in the listener and use lots of times
+  /// in your event methods.
+  /// </summary>
+  template<typename V>
+  class ANTLR4CPP_PUBLIC ParseTreeProperty {
+  public:
+    virtual ~ParseTreeProperty() {}
+    virtual V get(ParseTree *node) {
+      return _annotations[node];
+    }
+    virtual void put(ParseTree *node, V value) {
+      _annotations[node] = value;
+    }
+    virtual V removeFrom(ParseTree *node) {
+      auto value = _annotations[node];
+      _annotations.erase(node);
+      return value;
+    }
+
+  protected:
+    std::map<ParseTree*, V> _annotations;
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeType.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeType.h
new file mode 100644
index 0000000000..17e0512b00
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeType.h
@@ -0,0 +1,22 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include <cstddef>
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace tree {
+
+  enum class ParseTreeType : size_t {
+    TERMINAL = 1,
+    ERROR = 2,
+    RULE = 3,
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeVisitor.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeVisitor.cpp
new file mode 100644
index 0000000000..a329919c13
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeVisitor.cpp
@@ -0,0 +1,9 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "ParseTreeVisitor.h"
+
+antlr4::tree::ParseTreeVisitor::~ParseTreeVisitor() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeVisitor.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeVisitor.h
new file mode 100755
index 0000000000..d68311ba34
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeVisitor.h
@@ -0,0 +1,57 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "support/Any.h"
+
+namespace antlr4 {
+namespace tree {
+
+  /// <summary>
+  /// This interface defines the basic notion of a parse tree visitor. Generated
+  /// visitors implement this interface and the {@code XVisitor} interface for
+  /// grammar {@code X}.
+  /// </summary>
+  /// @param <T> The return type of the visit operation. Use <seealso cref="Void"/> for
+  /// operations with no return type. </param>
+  // ml: no template parameter here, to avoid the need for virtual template functions. Instead we have our Any class.
+  class ANTLR4CPP_PUBLIC ParseTreeVisitor {
+  public:
+    virtual ~ParseTreeVisitor();
+
+    /// <summary>
+    /// Visit a parse tree, and return a user-defined result of the operation.
+    /// </summary>
+    /// <param name="tree"> The <seealso cref="ParseTree"/> to visit. </param>
+    /// <returns> The result of visiting the parse tree. </returns>
+    virtual std::any visit(ParseTree *tree) = 0;
+
+    /// <summary>
+    /// Visit the children of a node, and return a user-defined result of the
+    /// operation.
+    /// </summary>
+    /// <param name="node"> The <seealso cref="ParseTree"/> whose children should be visited. </param>
+    /// <returns> The result of visiting the children of the node. </returns>
+    virtual std::any visitChildren(ParseTree *node) = 0;
+
+    /// <summary>
+    /// Visit a terminal node, and return a user-defined result of the operation.
+    /// </summary>
+    /// <param name="node"> The <seealso cref="TerminalNode"/> to visit. </param>
+    /// <returns> The result of visiting the node. </returns>
+    virtual std::any visitTerminal(TerminalNode *node) = 0;
+
+    /// <summary>
+    /// Visit an error node, and return a user-defined result of the operation.
+    /// </summary>
+    /// <param name="node"> The <seealso cref="ErrorNode"/> to visit. </param>
+    /// <returns> The result of visiting the node. </returns>
+    virtual std::any visitErrorNode(ErrorNode *node) = 0;
+
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeWalker.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeWalker.cpp
new file mode 100755
index 0000000000..1eeabff883
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeWalker.cpp
@@ -0,0 +1,48 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/ErrorNode.h"
+#include "ParserRuleContext.h"
+#include "tree/ParseTreeListener.h"
+#include "support/CPPUtils.h"
+#include "support/Casts.h"
+
+#include "tree/IterativeParseTreeWalker.h"
+#include "tree/ParseTreeWalker.h"
+
+using namespace antlr4::tree;
+using namespace antlrcpp;
+
+static IterativeParseTreeWalker defaultWalker;
+ParseTreeWalker &ParseTreeWalker::DEFAULT = defaultWalker;
+
+void ParseTreeWalker::walk(ParseTreeListener *listener, ParseTree *t) const {
+  if (ErrorNode::is(*t)) {
+    listener->visitErrorNode(downCast<ErrorNode*>(t));
+    return;
+  }
+  if (TerminalNode::is(*t)) {
+    listener->visitTerminal(downCast<TerminalNode*>(t));
+    return;
+  }
+
+  enterRule(listener, t);
+  for (auto &child : t->children) {
+    walk(listener, child);
+  }
+  exitRule(listener, t);
+}
+
+void ParseTreeWalker::enterRule(ParseTreeListener *listener, ParseTree *r) const {
+  auto *ctx = downCast<ParserRuleContext*>(r);
+  listener->enterEveryRule(ctx);
+  ctx->enterRule(listener);
+}
+
+void ParseTreeWalker::exitRule(ParseTreeListener *listener, ParseTree *r) const {
+  auto *ctx = downCast<ParserRuleContext*>(r);
+  ctx->exitRule(listener);
+  listener->exitEveryRule(ctx);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeWalker.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeWalker.h
new file mode 100755
index 0000000000..375e659785
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/ParseTreeWalker.h
@@ -0,0 +1,55 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace tree {
+
+  class ANTLR4CPP_PUBLIC ParseTreeWalker {
+  public:
+    static ParseTreeWalker &DEFAULT;
+
+    virtual ~ParseTreeWalker() = default;
+
+    /**
+    * <summary>
+    * Performs a walk on the given parse tree starting at the root and going down recursively
+	* with depth-first search. On each node, <seealso cref="ParseTreeWalker#enterRule"/> is called before
+    * recursively walking down into child nodes, then
+    * <seealso cref="ParseTreeWalker#exitRule"/> is called after the recursive call to wind up.
+	* </summary>
+    * <param name='listener'> The listener used by the walker to process grammar rules </param>
+	* <param name='t'> The parse tree to be walked on </param>
+    */
+    virtual void walk(ParseTreeListener *listener, ParseTree *t) const;
+
+  protected:
+
+    /**
+    * <summary>
+    * Enters a grammar rule by first triggering the generic event <seealso cref="ParseTreeListener#enterEveryRule"/>
+	* then by triggering the event specific to the given parse tree node
+	* </summary>
+    * <param name='listener'> The listener responding to the trigger events </param>
+	* <param name='r'> The grammar rule containing the rule context </param>
+    */
+    virtual void enterRule(ParseTreeListener *listener, ParseTree *r) const;
+
+    /**
+    * <summary>
+    * Exits a grammar rule by first triggering the event specific to the given parse tree node
+	* then by triggering the generic event <seealso cref="ParseTreeListener#exitEveryRule"/>
+	* </summary>
+    * <param name='listener'> The listener responding to the trigger events </param>
+	* <param name='r'> The grammar rule containing the rule context </param>
+    */
+    virtual void exitRule(ParseTreeListener *listener, ParseTree *r) const;
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/TerminalNode.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/TerminalNode.h
new file mode 100755
index 0000000000..421e7ad795
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/TerminalNode.h
@@ -0,0 +1,40 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "tree/ParseTree.h"
+
+namespace antlr4 {
+namespace tree {
+
+  class ANTLR4CPP_PUBLIC TerminalNode : public ParseTree {
+  public:
+    static bool is(const tree::ParseTree &parseTree) {
+      const auto treeType = parseTree.getTreeType();
+      return treeType == ParseTreeType::TERMINAL || treeType == ParseTreeType::ERROR;
+    }
+
+    static bool is(const tree::ParseTree *parseTree) { return parseTree != nullptr && is(*parseTree); }
+
+    virtual Token* getSymbol() const = 0;
+
+    /** Set the parent for this leaf node.
+     *
+     *  Technically, this is not backward compatible as it changes
+     *  the interface but no one was able to create custom
+     *  TerminalNodes anyway so I'm adding as it improves internal
+     *  code quality.
+     *
+     *  @since 4.7
+     */
+    virtual void setParent(RuleContext *parent) = 0;
+
+  protected:
+    using ParseTree::ParseTree;
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/TerminalNodeImpl.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/TerminalNodeImpl.cpp
new file mode 100755
index 0000000000..573b1faf23
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/TerminalNodeImpl.cpp
@@ -0,0 +1,54 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "misc/Interval.h"
+#include "Token.h"
+#include "RuleContext.h"
+#include "tree/ParseTreeVisitor.h"
+
+#include "tree/TerminalNodeImpl.h"
+
+using namespace antlr4;
+using namespace antlr4::tree;
+
+Token* TerminalNodeImpl::getSymbol() const {
+  return symbol;
+}
+
+void TerminalNodeImpl::setParent(RuleContext *parent_) {
+  this->parent = parent_;
+}
+
+misc::Interval TerminalNodeImpl::getSourceInterval() {
+  if (symbol == nullptr) {
+    return misc::Interval::INVALID;
+  }
+
+  size_t tokenIndex = symbol->getTokenIndex();
+  return misc::Interval(tokenIndex, tokenIndex);
+}
+
+std::any TerminalNodeImpl::accept(ParseTreeVisitor *visitor) {
+  return visitor->visitTerminal(this);
+}
+
+std::string TerminalNodeImpl::getText() {
+  return symbol->getText();
+}
+
+std::string TerminalNodeImpl::toStringTree(Parser * /*parser*/, bool /*pretty*/) {
+  return toString();
+}
+
+std::string TerminalNodeImpl::toString() {
+  if (symbol->getType() == Token::EOF) {
+    return "<EOF>";
+  }
+  return symbol->getText();
+}
+
+std::string TerminalNodeImpl::toStringTree(bool /*pretty*/) {
+  return toString();
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/TerminalNodeImpl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/TerminalNodeImpl.h
new file mode 100755
index 0000000000..ddd8f12881
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/TerminalNodeImpl.h
@@ -0,0 +1,32 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "tree/TerminalNode.h"
+
+namespace antlr4 {
+namespace tree {
+
+  class ANTLR4CPP_PUBLIC TerminalNodeImpl : public TerminalNode {
+  public:
+    Token *symbol;
+
+    explicit TerminalNodeImpl(Token *symbol) : TerminalNode(ParseTreeType::TERMINAL), symbol(symbol) {}
+
+    virtual Token* getSymbol() const override;
+    virtual void setParent(RuleContext *parent) override;
+    virtual misc::Interval getSourceInterval() override;
+
+    virtual std::any accept(ParseTreeVisitor *visitor) override;
+
+    virtual std::string getText() override;
+    virtual std::string toStringTree(Parser *parser, bool pretty = false) override;
+    virtual std::string toString() override;
+    virtual std::string toStringTree(bool pretty = false) override;
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/Trees.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/Trees.cpp
new file mode 100755
index 0000000000..34cfb74d70
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/Trees.cpp
@@ -0,0 +1,241 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/ErrorNode.h"
+#include "Parser.h"
+#include "ParserRuleContext.h"
+#include "support/CPPUtils.h"
+#include "tree/TerminalNodeImpl.h"
+#include "atn/ATN.h"
+#include "misc/Interval.h"
+#include "Token.h"
+#include "CommonToken.h"
+#include "misc/Predicate.h"
+
+#include "tree/Trees.h"
+
+using namespace antlr4;
+using namespace antlr4::misc;
+using namespace antlr4::tree;
+
+using namespace antlrcpp;
+
+Trees::Trees() {
+}
+
+std::string Trees::toStringTree(ParseTree *t, bool pretty) {
+  return toStringTree(t, nullptr, pretty);
+}
+
+std::string Trees::toStringTree(ParseTree *t, Parser *recog, bool pretty) {
+  if (recog == nullptr)
+    return toStringTree(t, std::vector<std::string>(), pretty);
+  return toStringTree(t, recog->getRuleNames(), pretty);
+}
+
+std::string Trees::toStringTree(ParseTree *t, const std::vector<std::string> &ruleNames, bool pretty) {
+  std::string temp = antlrcpp::escapeWhitespace(Trees::getNodeText(t, ruleNames), false);
+  if (t->children.empty()) {
+    return temp;
+  }
+
+  std::stringstream ss;
+  ss << "(" << temp << ' ';
+
+  // Implement the recursive walk as iteration to avoid trouble with deep nesting.
+  std::stack<size_t> stack;
+  size_t childIndex = 0;
+  ParseTree *run = t;
+  size_t indentationLevel = 1;
+  while (childIndex < run->children.size()) {
+    if (childIndex > 0) {
+      ss << ' ';
+    }
+    ParseTree *child = run->children[childIndex];
+    temp = antlrcpp::escapeWhitespace(Trees::getNodeText(child, ruleNames), false);
+    if (!child->children.empty()) {
+      // Go deeper one level.
+      stack.push(childIndex);
+      run = child;
+      childIndex = 0;
+      if (pretty) {
+        ++indentationLevel;
+        ss << std::endl;
+        for (size_t i = 0; i < indentationLevel; ++i) {
+          ss << "    ";
+        }
+      }
+      ss << "(" << temp << " ";
+    } else {
+      ss << temp;
+      while (++childIndex == run->children.size()) {
+        if (stack.size() > 0) {
+          // Reached the end of the current level. See if we can step up from here.
+          childIndex = stack.top();
+          stack.pop();
+          run = run->parent;
+          if (pretty) {
+            --indentationLevel;
+          }
+          ss << ")";
+        } else {
+          break;
+        }
+      }
+    }
+  }
+
+  ss << ")";
+  return ss.str();
+}
+
+std::string Trees::getNodeText(ParseTree *t, Parser *recog) {
+  return getNodeText(t, recog->getRuleNames());
+}
+
+std::string Trees::getNodeText(ParseTree *t, const std::vector<std::string> &ruleNames) {
+  if (ruleNames.size() > 0) {
+    if (is<RuleContext *>(t)) {
+      size_t ruleIndex = dynamic_cast<RuleContext *>(t)->getRuleIndex();
+      std::string ruleName = ruleNames[ruleIndex];
+      size_t altNumber = dynamic_cast<RuleContext *>(t)->getAltNumber();
+      if (altNumber != atn::ATN::INVALID_ALT_NUMBER) {
+        return ruleName + ":" + std::to_string(altNumber);
+      }
+      return ruleName;
+    } else if (is<ErrorNode *>(t)) {
+      return t->toString();
+    } else if (is<TerminalNode *>(t)) {
+      Token *symbol = dynamic_cast<TerminalNode *>(t)->getSymbol();
+      if (symbol != nullptr) {
+        std::string s = symbol->getText();
+        return s;
+      }
+    }
+  }
+  // no recog for rule names
+  if (is<RuleContext *>(t)) {
+    return dynamic_cast<RuleContext *>(t)->getText();
+  }
+
+  if (is<TerminalNodeImpl *>(t)) {
+    return dynamic_cast<TerminalNodeImpl *>(t)->getSymbol()->getText();
+  }
+
+  return "";
+}
+
+std::vector<ParseTree *> Trees::getAncestors(ParseTree *t) {
+  std::vector<ParseTree *> ancestors;
+  ParseTree *parent = t->parent;
+  while (parent != nullptr) {
+    ancestors.insert(ancestors.begin(), parent); // insert at start
+    parent = parent->parent;
+  }
+  return ancestors;
+}
+
+template<typename T>
+static void _findAllNodes(ParseTree *t, size_t index, bool findTokens, std::vector<T> &nodes) {
+  // check this node (the root) first
+  if (findTokens && is<TerminalNode *>(t)) {
+    TerminalNode *tnode = dynamic_cast<TerminalNode *>(t);
+    if (tnode->getSymbol()->getType() == index) {
+      nodes.push_back(t);
+    }
+  } else if (!findTokens && is<ParserRuleContext *>(t)) {
+    ParserRuleContext *ctx = dynamic_cast<ParserRuleContext *>(t);
+    if (ctx->getRuleIndex() == index) {
+      nodes.push_back(t);
+    }
+  }
+  // check children
+  for (size_t i = 0; i < t->children.size(); i++) {
+    _findAllNodes(t->children[i], index, findTokens, nodes);
+  }
+}
+
+bool Trees::isAncestorOf(ParseTree *t, ParseTree *u) {
+  if (t == nullptr || u == nullptr || t->parent == nullptr) {
+    return false;
+  }
+
+  ParseTree *p = u->parent;
+  while (p != nullptr) {
+    if (t == p) {
+      return true;
+    }
+    p = p->parent;
+  }
+  return false;
+}
+
+std::vector<ParseTree *> Trees::findAllTokenNodes(ParseTree *t, size_t ttype) {
+  return findAllNodes(t, ttype, true);
+}
+
+std::vector<ParseTree *> Trees::findAllRuleNodes(ParseTree *t, size_t ruleIndex) {
+  return findAllNodes(t, ruleIndex, false);
+}
+
+std::vector<ParseTree *> Trees::findAllNodes(ParseTree *t, size_t index, bool findTokens) {
+  std::vector<ParseTree *> nodes;
+  _findAllNodes<ParseTree *>(t, index, findTokens, nodes);
+  return nodes;
+}
+
+std::vector<ParseTree *> Trees::getDescendants(ParseTree *t) {
+  std::vector<ParseTree *> nodes;
+  nodes.push_back(t);
+  std::size_t n = t->children.size();
+  for (size_t i = 0 ; i < n ; i++) {
+    auto descentants = getDescendants(t->children[i]);
+    for (auto *entry: descentants) {
+      nodes.push_back(entry);
+    }
+  }
+  return nodes;
+}
+
+std::vector<ParseTree *> Trees::descendants(ParseTree *t) {
+  return getDescendants(t);
+}
+
+ParserRuleContext* Trees::getRootOfSubtreeEnclosingRegion(ParseTree *t, size_t startTokenIndex, size_t stopTokenIndex) {
+  size_t n = t->children.size();
+  for (size_t i = 0; i < n; i++) {
+    ParserRuleContext *r = getRootOfSubtreeEnclosingRegion(t->children[i], startTokenIndex, stopTokenIndex);
+    if (r != nullptr) {
+      return r;
+    }
+  }
+
+  if (is<ParserRuleContext *>(t)) {
+    ParserRuleContext *r = dynamic_cast<ParserRuleContext *>(t);
+    if (startTokenIndex >= r->getStart()->getTokenIndex() && // is range fully contained in t?
+        (r->getStop() == nullptr || stopTokenIndex <= r->getStop()->getTokenIndex())) {
+      // note: r.getStop()==null likely implies that we bailed out of parser and there's nothing to the right
+      return r;
+    }
+  }
+  return nullptr;
+}
+
+ParseTree * Trees::findNodeSuchThat(ParseTree *t, Ref<Predicate> const& pred) {
+  if (pred->test(t)) {
+    return t;
+  }
+
+  size_t n = t->children.size();
+  for (size_t i = 0 ; i < n ; ++i) {
+    ParseTree *u = findNodeSuchThat(t->children[i], pred);
+    if (u != nullptr) {
+      return u;
+    }
+  }
+
+  return nullptr;
+}
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/Trees.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/Trees.h
new file mode 100755
index 0000000000..d9d04624f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/Trees.h
@@ -0,0 +1,78 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "tree/TerminalNode.h"
+#include "ParserRuleContext.h"
+#include "Recognizer.h"
+
+namespace antlr4 {
+namespace tree {
+
+  /// A set of utility routines useful for all kinds of ANTLR trees.
+  class ANTLR4CPP_PUBLIC Trees {
+  public:
+    /// Print out a whole tree in LISP form. getNodeText is used on the
+    /// node payloads to get the text for the nodes.  Detect
+    /// parse trees and extract data appropriately.
+    static std::string toStringTree(ParseTree *t, bool pretty = false);
+
+    /// Print out a whole tree in LISP form. getNodeText is used on the
+    ///  node payloads to get the text for the nodes.  Detect
+    ///  parse trees and extract data appropriately.
+    static std::string toStringTree(ParseTree *t, Parser *recog, bool pretty = false);
+
+    /// Print out a whole tree in LISP form. getNodeText is used on the
+    /// node payloads to get the text for the nodes.  Detect
+    /// parse trees and extract data appropriately.
+    static std::string toStringTree(ParseTree *t, const std::vector<std::string> &ruleNames, bool pretty = false);
+    static std::string getNodeText(ParseTree *t, Parser *recog);
+    static std::string getNodeText(ParseTree *t, const std::vector<std::string> &ruleNames);
+
+    /// Return a list of all ancestors of this node.  The first node of
+    ///  list is the root and the last is the parent of this node.
+    static std::vector<ParseTree *> getAncestors(ParseTree *t);
+
+    /** Return true if t is u's parent or a node on path to root from u.
+     *  Use == not equals().
+     *
+     *  @since 4.5.1
+     */
+    static bool isAncestorOf(ParseTree *t, ParseTree *u);
+    static std::vector<ParseTree *> findAllTokenNodes(ParseTree *t, size_t ttype);
+    static std::vector<ParseTree *> findAllRuleNodes(ParseTree *t, size_t ruleIndex);
+    static std::vector<ParseTree *> findAllNodes(ParseTree *t, size_t index, bool findTokens);
+
+    /** Get all descendents; includes t itself.
+     *
+     * @since 4.5.1
+     */
+    static std::vector<ParseTree *> getDescendants(ParseTree *t);
+
+    /** @deprecated */
+    static std::vector<ParseTree *> descendants(ParseTree *t);
+
+    /** Find smallest subtree of t enclosing range startTokenIndex..stopTokenIndex
+     *  inclusively using postorder traversal.  Recursive depth-first-search.
+     *
+     *  @since 4.5.1
+     */
+    static ParserRuleContext* getRootOfSubtreeEnclosingRegion(ParseTree *t,
+                                                              size_t startTokenIndex, // inclusive
+                                                              size_t stopTokenIndex); // inclusive
+
+    /** Return first node satisfying the pred
+     *
+     *  @since 4.5.1
+     */
+    static ParseTree* findNodeSuchThat(ParseTree *t, Ref<misc::Predicate> const& pred);
+
+  private:
+    Trees();
+  };
+
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/Chunk.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/Chunk.cpp
new file mode 100644
index 0000000000..5320f910b9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/Chunk.cpp
@@ -0,0 +1,9 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/pattern/Chunk.h"
+
+antlr4::tree::pattern::Chunk::~Chunk() {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/Chunk.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/Chunk.h
new file mode 100755
index 0000000000..42e7838d47
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/Chunk.h
@@ -0,0 +1,44 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace tree {
+namespace pattern {
+
+  /// <summary>
+  /// A chunk is either a token tag, a rule tag, or a span of literal text within a
+  /// tree pattern.
+  /// <p/>
+  /// The method <seealso cref="ParseTreePatternMatcher#split(String)"/> returns a list of
+  /// chunks in preparation for creating a token stream by
+  /// <seealso cref="ParseTreePatternMatcher#tokenize(String)"/>. From there, we get a parse
+  /// tree from with <seealso cref="ParseTreePatternMatcher#compile(String, int)"/>. These
+  /// chunks are converted to <seealso cref="RuleTagToken"/>, <seealso cref="TokenTagToken"/>, or the
+  /// regular tokens of the text surrounding the tags.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC Chunk {
+  public:
+    Chunk() = default;
+    Chunk(Chunk const&) = default;
+    virtual ~Chunk();
+
+    Chunk& operator=(Chunk const&) = default;
+
+    /// This method returns a text representation of the tag chunk. Labeled tags
+    /// are returned in the form {@code label:tag}, and unlabeled tags are
+    /// returned as just the tag name.
+    virtual std::string toString() {
+      std::string str;
+      return str;
+    }
+  };
+
+} // namespace pattern
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreeMatch.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreeMatch.cpp
new file mode 100755
index 0000000000..ce34b3f227
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreeMatch.cpp
@@ -0,0 +1,69 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Exceptions.h"
+
+#include "tree/pattern/ParseTreeMatch.h"
+
+using namespace antlr4::tree;
+using namespace antlr4::tree::pattern;
+
+ParseTreeMatch::ParseTreeMatch(ParseTree *tree, const ParseTreePattern &pattern,
+                               const std::map<std::string, std::vector<ParseTree *>> &labels,
+                               ParseTree *mismatchedNode)
+  : _tree(tree), _pattern(pattern), _labels(labels), _mismatchedNode(mismatchedNode) {
+  if (tree == nullptr) {
+    throw IllegalArgumentException("tree cannot be nul");
+  }
+}
+
+ParseTreeMatch::~ParseTreeMatch() {
+}
+
+ParseTree* ParseTreeMatch::get(const std::string &label) {
+  auto iterator = _labels.find(label);
+  if (iterator == _labels.end() || iterator->second.empty()) {
+    return nullptr;
+  }
+
+  return iterator->second.back(); // return last if multiple
+}
+
+std::vector<ParseTree *> ParseTreeMatch::getAll(const std::string &label) {
+  auto iterator = _labels.find(label);
+  if (iterator == _labels.end()) {
+    return {};
+  }
+
+  return iterator->second;
+}
+
+std::map<std::string, std::vector<ParseTree *>>& ParseTreeMatch::getLabels() {
+  return _labels;
+}
+
+ParseTree *ParseTreeMatch::getMismatchedNode() {
+  return _mismatchedNode;
+}
+
+bool ParseTreeMatch::succeeded() {
+  return _mismatchedNode == nullptr;
+}
+
+const ParseTreePattern& ParseTreeMatch::getPattern() {
+  return _pattern;
+}
+
+ParseTree * ParseTreeMatch::getTree() {
+  return _tree;
+}
+
+std::string ParseTreeMatch::toString() {
+  if (succeeded()) {
+    return "Match succeeded; found " + std::to_string(_labels.size()) + " labels";
+  } else {
+    return "Match failed; found " + std::to_string(_labels.size()) + " labels";
+  }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreeMatch.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreeMatch.h
new file mode 100755
index 0000000000..eefde46c83
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreeMatch.h
@@ -0,0 +1,132 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace tree {
+namespace pattern {
+
+  /// Represents the result of matching a ParseTree against a tree pattern.
+  class ANTLR4CPP_PUBLIC ParseTreeMatch {
+  private:
+    /// This is the backing field for getTree().
+    ParseTree *_tree;
+
+    /// This is the backing field for getPattern().
+    const ParseTreePattern &_pattern;
+
+    /// This is the backing field for getLabels().
+    std::map<std::string, std::vector<ParseTree *>> _labels;
+
+    /// This is the backing field for getMismatchedNode().
+    ParseTree *_mismatchedNode;
+
+  public:
+    /// <summary>
+    /// Constructs a new instance of <seealso cref="ParseTreeMatch"/> from the specified
+    /// parse tree and pattern.
+    /// </summary>
+    /// <param name="tree"> The parse tree to match against the pattern. </param>
+    /// <param name="pattern"> The parse tree pattern. </param>
+    /// <param name="labels"> A mapping from label names to collections of
+    /// <seealso cref="ParseTree"/> objects located by the tree pattern matching process. </param>
+    /// <param name="mismatchedNode"> The first node which failed to match the tree
+    /// pattern during the matching process.
+    /// </param>
+    /// <exception cref="IllegalArgumentException"> if {@code tree} is {@code null} </exception>
+    /// <exception cref="IllegalArgumentException"> if {@code pattern} is {@code null} </exception>
+    /// <exception cref="IllegalArgumentException"> if {@code labels} is {@code null} </exception>
+    ParseTreeMatch(ParseTree *tree, ParseTreePattern const& pattern,
+                   const std::map<std::string, std::vector<ParseTree *>> &labels, ParseTree *mismatchedNode);
+    ParseTreeMatch(ParseTreeMatch const&) = default;
+    virtual ~ParseTreeMatch();
+
+    /// <summary>
+    /// Get the last node associated with a specific {@code label}.
+    /// <p/>
+    /// For example, for pattern {@code <id:ID>}, {@code get("id")} returns the
+    /// node matched for that {@code ID}. If more than one node
+    /// matched the specified label, only the last is returned. If there is
+    /// no node associated with the label, this returns {@code null}.
+    /// <p/>
+    /// Pattern tags like {@code <ID>} and {@code <expr>} without labels are
+    /// considered to be labeled with {@code ID} and {@code expr}, respectively.
+    /// </summary>
+    /// <param name="labe"> The label to check.
+    /// </param>
+    /// <returns> The last <seealso cref="ParseTree"/> to match a tag with the specified
+    /// label, or {@code null} if no parse tree matched a tag with the label. </returns>
+    virtual ParseTree* get(const std::string &label);
+
+    /// <summary>
+    /// Return all nodes matching a rule or token tag with the specified label.
+    /// <p/>
+    /// If the {@code label} is the name of a parser rule or token in the
+    /// grammar, the resulting list will contain both the parse trees matching
+    /// rule or tags explicitly labeled with the label and the complete set of
+    /// parse trees matching the labeled and unlabeled tags in the pattern for
+    /// the parser rule or token. For example, if {@code label} is {@code "foo"},
+    /// the result will contain <em>all</em> of the following.
+    ///
+    /// <ul>
+    /// <li>Parse tree nodes matching tags of the form {@code <foo:anyRuleName>} and
+    /// {@code <foo:AnyTokenName>}.</li>
+    /// <li>Parse tree nodes matching tags of the form {@code <anyLabel:foo>}.</li>
+    /// <li>Parse tree nodes matching tags of the form {@code <foo>}.</li>
+    /// </ul>
+    /// </summary>
+    /// <param name="labe"> The label.
+    /// </param>
+    /// <returns> A collection of all <seealso cref="ParseTree"/> nodes matching tags with
+    /// the specified {@code label}. If no nodes matched the label, an empty list
+    /// is returned. </returns>
+    virtual std::vector<ParseTree *> getAll(const std::string &label);
+
+    /// <summary>
+    /// Return a mapping from label &rarr; [list of nodes].
+    /// <p/>
+    /// The map includes special entries corresponding to the names of rules and
+    /// tokens referenced in tags in the original pattern. For additional
+    /// information, see the description of <seealso cref="#getAll(String)"/>.
+    /// </summary>
+    /// <returns> A mapping from labels to parse tree nodes. If the parse tree
+    /// pattern did not contain any rule or token tags, this map will be empty. </returns>
+    virtual std::map<std::string, std::vector<ParseTree *>>& getLabels();
+
+    /// <summary>
+    /// Get the node at which we first detected a mismatch.
+    /// </summary>
+    /// <returns> the node at which we first detected a mismatch, or {@code null}
+    /// if the match was successful. </returns>
+    virtual ParseTree* getMismatchedNode();
+
+    /// <summary>
+    /// Gets a value indicating whether the match operation succeeded.
+    /// </summary>
+    /// <returns> {@code true} if the match operation succeeded; otherwise,
+    /// {@code false}. </returns>
+    virtual bool succeeded();
+
+    /// <summary>
+    /// Get the tree pattern we are matching against.
+    /// </summary>
+    /// <returns> The tree pattern we are matching against. </returns>
+    virtual const ParseTreePattern& getPattern();
+
+    /// <summary>
+    /// Get the parse tree we are trying to match to a pattern.
+    /// </summary>
+    /// <returns> The <seealso cref="ParseTree"/> we are trying to match to a pattern. </returns>
+    virtual ParseTree* getTree();
+
+    virtual std::string toString();
+  };
+
+} // namespace pattern
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePattern.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePattern.cpp
new file mode 100755
index 0000000000..50f44c82cf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePattern.cpp
@@ -0,0 +1,64 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/ParseTree.h"
+#include "tree/pattern/ParseTreePatternMatcher.h"
+#include "tree/pattern/ParseTreeMatch.h"
+
+#include "tree/xpath/XPath.h"
+#include "tree/xpath/XPathElement.h"
+
+#include "tree/pattern/ParseTreePattern.h"
+
+using namespace antlr4::tree;
+using namespace antlr4::tree::pattern;
+
+using namespace antlrcpp;
+
+ParseTreePattern::ParseTreePattern(ParseTreePatternMatcher *matcher, const std::string &pattern, int patternRuleIndex_,
+                                   ParseTree *patternTree)
+  : patternRuleIndex(patternRuleIndex_), _pattern(pattern), _patternTree(patternTree), _matcher(matcher) {
+}
+
+ParseTreePattern::~ParseTreePattern() {
+}
+
+ParseTreeMatch ParseTreePattern::match(ParseTree *tree) {
+  return _matcher->match(tree, *this);
+}
+
+bool ParseTreePattern::matches(ParseTree *tree) {
+  return _matcher->match(tree, *this).succeeded();
+}
+
+std::vector<ParseTreeMatch> ParseTreePattern::findAll(ParseTree *tree, const std::string &xpath) {
+  xpath::XPath finder(_matcher->getParser(), xpath);
+  std::vector<ParseTree *> subtrees = finder.evaluate(tree);
+  std::vector<ParseTreeMatch> matches;
+  for (auto *t : subtrees) {
+    ParseTreeMatch aMatch = match(t);
+    if (aMatch.succeeded()) {
+      matches.push_back(aMatch);
+    }
+  }
+  return matches;
+}
+
+
+ParseTreePatternMatcher *ParseTreePattern::getMatcher() const {
+  return _matcher;
+}
+
+std::string ParseTreePattern::getPattern() const {
+  return _pattern;
+}
+
+int ParseTreePattern::getPatternRuleIndex() const {
+  return patternRuleIndex;
+}
+
+ParseTree* ParseTreePattern::getPatternTree() const {
+  return _patternTree;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePattern.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePattern.h
new file mode 100755
index 0000000000..d5b86ff473
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePattern.h
@@ -0,0 +1,105 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace tree {
+namespace pattern {
+
+  /// <summary>
+  /// A pattern like {@code <ID> = <expr>;} converted to a <seealso cref="ParseTree"/> by
+  /// <seealso cref="ParseTreePatternMatcher#compile(String, int)"/>.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC ParseTreePattern {
+  public:
+    /// <summary>
+    /// Construct a new instance of the <seealso cref="ParseTreePattern"/> class.
+    /// </summary>
+    /// <param name="matcher"> The <seealso cref="ParseTreePatternMatcher"/> which created this
+    /// tree pattern. </param>
+    /// <param name="pattern"> The tree pattern in concrete syntax form. </param>
+    /// <param name="patternRuleIndex"> The parser rule which serves as the root of the
+    /// tree pattern. </param>
+    /// <param name="patternTree"> The tree pattern in <seealso cref="ParseTree"/> form. </param>
+    ParseTreePattern(ParseTreePatternMatcher *matcher, const std::string &pattern, int patternRuleIndex,
+                     ParseTree *patternTree);
+    ParseTreePattern(ParseTreePattern const&) = default;
+    virtual ~ParseTreePattern();
+
+    /// <summary>
+    /// Match a specific parse tree against this tree pattern.
+    /// </summary>
+    /// <param name="tree"> The parse tree to match against this tree pattern. </param>
+    /// <returns> A <seealso cref="ParseTreeMatch"/> object describing the result of the
+    /// match operation. The <seealso cref="ParseTreeMatch#succeeded()"/> method can be
+    /// used to determine whether or not the match was successful. </returns>
+    virtual ParseTreeMatch match(ParseTree *tree);
+
+    /// <summary>
+    /// Determine whether or not a parse tree matches this tree pattern.
+    /// </summary>
+    /// <param name="tree"> The parse tree to match against this tree pattern. </param>
+    /// <returns> {@code true} if {@code tree} is a match for the current tree
+    /// pattern; otherwise, {@code false}. </returns>
+    virtual bool matches(ParseTree *tree);
+
+    /// Find all nodes using XPath and then try to match those subtrees against
+    /// this tree pattern.
+    /// @param tree The ParseTree to match against this pattern.
+    /// @param xpath An expression matching the nodes
+    ///
+    /// @returns A collection of ParseTreeMatch objects describing the
+    /// successful matches. Unsuccessful matches are omitted from the result,
+    /// regardless of the reason for the failure.
+    virtual std::vector<ParseTreeMatch> findAll(ParseTree *tree, const std::string &xpath);
+
+    /// <summary>
+    /// Get the <seealso cref="ParseTreePatternMatcher"/> which created this tree pattern.
+    /// </summary>
+    /// <returns> The <seealso cref="ParseTreePatternMatcher"/> which created this tree
+    /// pattern. </returns>
+    virtual ParseTreePatternMatcher *getMatcher() const;
+
+    /// <summary>
+    /// Get the tree pattern in concrete syntax form.
+    /// </summary>
+    /// <returns> The tree pattern in concrete syntax form. </returns>
+    virtual std::string getPattern() const;
+
+    /// <summary>
+    /// Get the parser rule which serves as the outermost rule for the tree
+    /// pattern.
+    /// </summary>
+    /// <returns> The parser rule which serves as the outermost rule for the tree
+    /// pattern. </returns>
+    virtual int getPatternRuleIndex() const;
+
+    /// <summary>
+    /// Get the tree pattern as a <seealso cref="ParseTree"/>. The rule and token tags from
+    /// the pattern are present in the parse tree as terminal nodes with a symbol
+    /// of type <seealso cref="RuleTagToken"/> or <seealso cref="TokenTagToken"/>.
+    /// </summary>
+    /// <returns> The tree pattern as a <seealso cref="ParseTree"/>. </returns>
+    virtual ParseTree* getPatternTree() const;
+
+  private:
+    const int patternRuleIndex;
+
+    /// This is the backing field for <seealso cref="#getPattern()"/>.
+    const std::string _pattern;
+
+    /// This is the backing field for <seealso cref="#getPatternTree()"/>.
+    ParseTree *_patternTree;
+
+    /// This is the backing field for <seealso cref="#getMatcher()"/>.
+    ParseTreePatternMatcher *const _matcher;
+  };
+
+} // namespace pattern
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePatternMatcher.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePatternMatcher.cpp
new file mode 100755
index 0000000000..cbc4076bae
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePatternMatcher.cpp
@@ -0,0 +1,370 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/pattern/ParseTreePattern.h"
+#include "tree/pattern/ParseTreeMatch.h"
+#include "tree/TerminalNode.h"
+#include "CommonTokenStream.h"
+#include "ParserInterpreter.h"
+#include "tree/pattern/TokenTagToken.h"
+#include "ParserRuleContext.h"
+#include "tree/pattern/RuleTagToken.h"
+#include "tree/pattern/TagChunk.h"
+#include "atn/ATN.h"
+#include "Lexer.h"
+#include "BailErrorStrategy.h"
+
+#include "ListTokenSource.h"
+#include "tree/pattern/TextChunk.h"
+#include "ANTLRInputStream.h"
+#include "support/Arrays.h"
+#include "Exceptions.h"
+#include "support/CPPUtils.h"
+
+#include "tree/pattern/ParseTreePatternMatcher.h"
+
+using namespace antlr4;
+using namespace antlr4::tree;
+using namespace antlr4::tree::pattern;
+using namespace antlrcpp;
+
+ParseTreePatternMatcher::CannotInvokeStartRule::CannotInvokeStartRule(const RuntimeException &e) : RuntimeException(e.what()) {
+}
+
+ParseTreePatternMatcher::CannotInvokeStartRule::~CannotInvokeStartRule() {
+}
+
+ParseTreePatternMatcher::StartRuleDoesNotConsumeFullPattern::~StartRuleDoesNotConsumeFullPattern() {
+}
+
+ParseTreePatternMatcher::ParseTreePatternMatcher(Lexer *lexer, Parser *parser) : _lexer(lexer), _parser(parser) {
+  InitializeInstanceFields();
+}
+
+ParseTreePatternMatcher::~ParseTreePatternMatcher() {
+}
+
+void ParseTreePatternMatcher::setDelimiters(const std::string &start, const std::string &stop, const std::string &escapeLeft) {
+  if (start.empty()) {
+    throw IllegalArgumentException("start cannot be null or empty");
+  }
+
+  if (stop.empty()) {
+    throw IllegalArgumentException("stop cannot be null or empty");
+  }
+
+ _start = start;
+  _stop = stop;
+  _escape = escapeLeft;
+}
+
+bool ParseTreePatternMatcher::matches(ParseTree *tree, const std::string &pattern, int patternRuleIndex) {
+  ParseTreePattern p = compile(pattern, patternRuleIndex);
+  return matches(tree, p);
+}
+
+bool ParseTreePatternMatcher::matches(ParseTree *tree, const ParseTreePattern &pattern) {
+  std::map<std::string, std::vector<ParseTree *>> labels;
+  ParseTree *mismatchedNode = matchImpl(tree, pattern.getPatternTree(), labels);
+  return mismatchedNode == nullptr;
+}
+
+ParseTreeMatch ParseTreePatternMatcher::match(ParseTree *tree, const std::string &pattern, int patternRuleIndex) {
+  ParseTreePattern p = compile(pattern, patternRuleIndex);
+  return match(tree, p);
+}
+
+ParseTreeMatch ParseTreePatternMatcher::match(ParseTree *tree, const ParseTreePattern &pattern) {
+  std::map<std::string, std::vector<ParseTree *>> labels;
+  tree::ParseTree *mismatchedNode = matchImpl(tree, pattern.getPatternTree(), labels);
+  return ParseTreeMatch(tree, pattern, labels, mismatchedNode);
+}
+
+ParseTreePattern ParseTreePatternMatcher::compile(const std::string &pattern, int patternRuleIndex) {
+  ListTokenSource tokenSrc(tokenize(pattern));
+  CommonTokenStream tokens(&tokenSrc);
+
+  ParserInterpreter parserInterp(_parser->getGrammarFileName(), _parser->getVocabulary(),
+                                 _parser->getRuleNames(), _parser->getATNWithBypassAlts(), &tokens);
+
+  ParserRuleContext *tree = nullptr;
+  try {
+    parserInterp.setErrorHandler(std::make_shared<BailErrorStrategy>());
+    tree = parserInterp.parse(patternRuleIndex);
+  } catch (ParseCancellationException &e) {
+#if defined(_MSC_FULL_VER) && _MSC_FULL_VER < 190023026
+    // rethrow_if_nested is not available before VS 2015.
+    throw e;
+#else
+    std::rethrow_if_nested(e); // Unwrap the nested exception.
+#endif
+  } catch (RecognitionException &re) {
+    throw re;
+#if defined(_MSC_FULL_VER) && _MSC_FULL_VER < 190023026
+  } catch (std::exception &e) {
+    // throw_with_nested is not available before VS 2015.
+    throw e;
+#else
+  } catch (std::exception & /*e*/) {
+    std::throw_with_nested(RuntimeException("Cannot invoke start rule")); // Wrap any other exception.
+#endif
+  }
+
+  // Make sure tree pattern compilation checks for a complete parse
+  if (tokens.LA(1) != Token::EOF) {
+    throw StartRuleDoesNotConsumeFullPattern();
+  }
+
+  return ParseTreePattern(this, pattern, patternRuleIndex, tree);
+}
+
+Lexer* ParseTreePatternMatcher::getLexer() {
+  return _lexer;
+}
+
+Parser* ParseTreePatternMatcher::getParser() {
+  return _parser;
+}
+
+ParseTree* ParseTreePatternMatcher::matchImpl(ParseTree *tree, ParseTree *patternTree,
+                                              std::map<std::string, std::vector<ParseTree *>> &labels) {
+  if (tree == nullptr) {
+    throw IllegalArgumentException("tree cannot be nul");
+  }
+
+  if (patternTree == nullptr) {
+    throw IllegalArgumentException("patternTree cannot be nul");
+  }
+
+  // x and <ID>, x and y, or x and x; or could be mismatched types
+  if (is<TerminalNode *>(tree) && is<TerminalNode *>(patternTree)) {
+    TerminalNode *t1 = dynamic_cast<TerminalNode *>(tree);
+    TerminalNode *t2 = dynamic_cast<TerminalNode *>(patternTree);
+
+    ParseTree *mismatchedNode = nullptr;
+    // both are tokens and they have same type
+    if (t1->getSymbol()->getType() == t2->getSymbol()->getType()) {
+      if (is<TokenTagToken *>(t2->getSymbol())) { // x and <ID>
+        TokenTagToken *tokenTagToken = dynamic_cast<TokenTagToken *>(t2->getSymbol());
+
+        // track label->list-of-nodes for both token name and label (if any)
+        labels[tokenTagToken->getTokenName()].push_back(tree);
+        if (tokenTagToken->getLabel() != "") {
+          labels[tokenTagToken->getLabel()].push_back(tree);
+        }
+      } else if (t1->getText() == t2->getText()) {
+        // x and x
+      } else {
+        // x and y
+        if (mismatchedNode == nullptr) {
+          mismatchedNode = t1;
+        }
+      }
+    } else {
+      if (mismatchedNode == nullptr) {
+        mismatchedNode = t1;
+      }
+    }
+
+    return mismatchedNode;
+  }
+
+  if (is<ParserRuleContext *>(tree) && is<ParserRuleContext *>(patternTree)) {
+    ParserRuleContext *r1 = dynamic_cast<ParserRuleContext *>(tree);
+    ParserRuleContext *r2 = dynamic_cast<ParserRuleContext *>(patternTree);
+    ParseTree *mismatchedNode = nullptr;
+
+    // (expr ...) and <expr>
+    RuleTagToken *ruleTagToken = getRuleTagToken(r2);
+    if (ruleTagToken != nullptr) {
+      //ParseTreeMatch *m = nullptr; // unused?
+      if (r1->getRuleIndex() == r2->getRuleIndex()) {
+        // track label->list-of-nodes for both rule name and label (if any)
+        labels[ruleTagToken->getRuleName()].push_back(tree);
+        if (ruleTagToken->getLabel() != "") {
+          labels[ruleTagToken->getLabel()].push_back(tree);
+        }
+      } else {
+        if (!mismatchedNode) {
+          mismatchedNode = r1;
+        }
+      }
+
+      return mismatchedNode;
+    }
+
+    // (expr ...) and (expr ...)
+    if (r1->children.size() != r2->children.size()) {
+      if (mismatchedNode == nullptr) {
+        mismatchedNode = r1;
+      }
+
+      return mismatchedNode;
+    }
+
+    std::size_t n = r1->children.size();
+    for (size_t i = 0; i < n; i++) {
+      ParseTree *childMatch = matchImpl(r1->children[i], patternTree->children[i], labels);
+      if (childMatch) {
+        return childMatch;
+      }
+    }
+
+    return mismatchedNode;
+  }
+
+  // if nodes aren't both tokens or both rule nodes, can't match
+  return tree;
+}
+
+RuleTagToken* ParseTreePatternMatcher::getRuleTagToken(ParseTree *t) {
+  if (t->children.size() == 1 && is<TerminalNode *>(t->children[0])) {
+    TerminalNode *c = dynamic_cast<TerminalNode *>(t->children[0]);
+    if (is<RuleTagToken *>(c->getSymbol())) {
+      return dynamic_cast<RuleTagToken *>(c->getSymbol());
+    }
+  }
+  return nullptr;
+}
+
+std::vector<std::unique_ptr<Token>> ParseTreePatternMatcher::tokenize(const std::string &pattern) {
+  // split pattern into chunks: sea (raw input) and islands (<ID>, <expr>)
+  std::vector<Chunk> chunks = split(pattern);
+
+  // create token stream from text and tags
+  std::vector<std::unique_ptr<Token>> tokens;
+  for (auto chunk : chunks) {
+    if (is<TagChunk *>(&chunk)) {
+      TagChunk &tagChunk = (TagChunk&)chunk;
+      // add special rule token or conjure up new token from name
+      if (isupper(tagChunk.getTag()[0])) {
+        size_t ttype = _parser->getTokenType(tagChunk.getTag());
+        if (ttype == Token::INVALID_TYPE) {
+          throw IllegalArgumentException("Unknown token " + tagChunk.getTag() + " in pattern: " + pattern);
+        }
+        tokens.emplace_back(new TokenTagToken(tagChunk.getTag(), (int)ttype, tagChunk.getLabel()));
+      } else if (islower(tagChunk.getTag()[0])) {
+        size_t ruleIndex = _parser->getRuleIndex(tagChunk.getTag());
+        if (ruleIndex == INVALID_INDEX) {
+          throw IllegalArgumentException("Unknown rule " + tagChunk.getTag() + " in pattern: " + pattern);
+        }
+        size_t ruleImaginaryTokenType = _parser->getATNWithBypassAlts().ruleToTokenType[ruleIndex];
+        tokens.emplace_back(new RuleTagToken(tagChunk.getTag(), ruleImaginaryTokenType, tagChunk.getLabel()));
+      } else {
+        throw IllegalArgumentException("invalid tag: " + tagChunk.getTag() + " in pattern: " + pattern);
+      }
+    } else {
+      TextChunk &textChunk = (TextChunk&)chunk;
+      ANTLRInputStream input(textChunk.getText());
+      _lexer->setInputStream(&input);
+      std::unique_ptr<Token> t(_lexer->nextToken());
+      while (t->getType() != Token::EOF) {
+        tokens.push_back(std::move(t));
+        t = _lexer->nextToken();
+      }
+      _lexer->setInputStream(nullptr);
+    }
+  }
+
+  return tokens;
+}
+
+std::vector<Chunk> ParseTreePatternMatcher::split(const std::string &pattern) {
+  size_t p = 0;
+  size_t n = pattern.length();
+  std::vector<Chunk> chunks;
+
+  // find all start and stop indexes first, then collect
+  std::vector<size_t> starts;
+  std::vector<size_t> stops;
+  while (p < n) {
+    if (p == pattern.find(_escape + _start,p)) {
+      p += _escape.length() + _start.length();
+    } else if (p == pattern.find(_escape + _stop,p)) {
+      p += _escape.length() + _stop.length();
+    } else if (p == pattern.find(_start,p)) {
+      starts.push_back(p);
+      p += _start.length();
+    } else if (p == pattern.find(_stop,p)) {
+      stops.push_back(p);
+      p += _stop.length();
+    } else {
+      p++;
+    }
+  }
+
+  if (starts.size() > stops.size()) {
+    throw IllegalArgumentException("unterminated tag in pattern: " + pattern);
+  }
+
+  if (starts.size() < stops.size()) {
+    throw IllegalArgumentException("missing start tag in pattern: " + pattern);
+  }
+
+  size_t ntags = starts.size();
+  for (size_t i = 0; i < ntags; i++) {
+    if (starts[i] >= stops[i]) {
+      throw IllegalArgumentException("tag delimiters out of order in pattern: " + pattern);
+    }
+  }
+
+  // collect into chunks now
+  if (ntags == 0) {
+    std::string text = pattern.substr(0, n);
+    chunks.push_back(TextChunk(text));
+  }
+
+  if (ntags > 0 && starts[0] > 0) { // copy text up to first tag into chunks
+    std::string text = pattern.substr(0, starts[0]);
+    chunks.push_back(TextChunk(text));
+  }
+
+  for (size_t i = 0; i < ntags; i++) {
+    // copy inside of <tag>
+    std::string tag = pattern.substr(starts[i] + _start.length(), stops[i] - (starts[i] + _start.length()));
+    std::string ruleOrToken = tag;
+    std::string label = "";
+    size_t colon = tag.find(':');
+    if (colon != std::string::npos) {
+      label = tag.substr(0,colon);
+      ruleOrToken = tag.substr(colon + 1, tag.length() - (colon + 1));
+    }
+    chunks.push_back(TagChunk(label, ruleOrToken));
+    if (i + 1 < ntags) {
+      // copy from end of <tag> to start of next
+      std::string text = pattern.substr(stops[i] + _stop.length(), starts[i + 1] - (stops[i] + _stop.length()));
+      chunks.push_back(TextChunk(text));
+    }
+  }
+
+  if (ntags > 0) {
+    size_t afterLastTag = stops[ntags - 1] + _stop.length();
+    if (afterLastTag < n) { // copy text from end of last tag to end
+      std::string text = pattern.substr(afterLastTag, n - afterLastTag);
+      chunks.push_back(TextChunk(text));
+    }
+  }
+
+  // strip out all backslashes from text chunks but not tags
+  for (size_t i = 0; i < chunks.size(); i++) {
+    Chunk &c = chunks[i];
+    if (is<TextChunk *>(&c)) {
+      TextChunk &tc = (TextChunk&)c;
+      std::string unescaped = tc.getText();
+      unescaped.erase(std::remove(unescaped.begin(), unescaped.end(), '\\'), unescaped.end());
+      if (unescaped.length() < tc.getText().length()) {
+        chunks[i] = TextChunk(unescaped);
+      }
+    }
+  }
+
+  return chunks;
+}
+
+void ParseTreePatternMatcher::InitializeInstanceFields() {
+  _start = "<";
+  _stop = ">";
+  _escape = "\\";
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePatternMatcher.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePatternMatcher.h
new file mode 100755
index 0000000000..e77c7bc5e2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/ParseTreePatternMatcher.h
@@ -0,0 +1,185 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Exceptions.h"
+
+namespace antlr4 {
+namespace tree {
+namespace pattern {
+
+  /// <summary>
+  /// A tree pattern matching mechanism for ANTLR <seealso cref="ParseTree"/>s.
+  /// <p/>
+  /// Patterns are strings of source input text with special tags representing
+  /// token or rule references such as:
+  /// <p/>
+  /// {@code <ID> = <expr>;}
+  /// <p/>
+  /// Given a pattern start rule such as {@code statement}, this object constructs
+  /// a <seealso cref="ParseTree"/> with placeholders for the {@code ID} and {@code expr}
+  /// subtree. Then the <seealso cref="#match"/> routines can compare an actual
+  /// <seealso cref="ParseTree"/> from a parse with this pattern. Tag {@code <ID>} matches
+  /// any {@code ID} token and tag {@code <expr>} references the result of the
+  /// {@code expr} rule (generally an instance of {@code ExprContext}.
+  /// <p/>
+  /// Pattern {@code x = 0;} is a similar pattern that matches the same pattern
+  /// except that it requires the identifier to be {@code x} and the expression to
+  /// be {@code 0}.
+  /// <p/>
+  /// The <seealso cref="#matches"/> routines return {@code true} or {@code false} based
+  /// upon a match for the tree rooted at the parameter sent in. The
+  /// <seealso cref="#match"/> routines return a <seealso cref="ParseTreeMatch"/> object that
+  /// contains the parse tree, the parse tree pattern, and a map from tag name to
+  /// matched nodes (more below). A subtree that fails to match, returns with
+  /// <seealso cref="ParseTreeMatch#mismatchedNode"/> set to the first tree node that did not
+  /// match.
+  /// <p/>
+  /// For efficiency, you can compile a tree pattern in string form to a
+  /// <seealso cref="ParseTreePattern"/> object.
+  /// <p/>
+  /// See {@code TestParseTreeMatcher} for lots of examples.
+  /// <seealso cref="ParseTreePattern"/> has two static helper methods:
+  /// <seealso cref="ParseTreePattern#findAll"/> and <seealso cref="ParseTreePattern#match"/> that
+  /// are easy to use but not super efficient because they create new
+  /// <seealso cref="ParseTreePatternMatcher"/> objects each time and have to compile the
+  /// pattern in string form before using it.
+  /// <p/>
+  /// The lexer and parser that you pass into the <seealso cref="ParseTreePatternMatcher"/>
+  /// constructor are used to parse the pattern in string form. The lexer converts
+  /// the {@code <ID> = <expr>;} into a sequence of four tokens (assuming lexer
+  /// throws out whitespace or puts it on a hidden channel). Be aware that the
+  /// input stream is reset for the lexer (but not the parser; a
+  /// <seealso cref="ParserInterpreter"/> is created to parse the input.). Any user-defined
+  /// fields you have put into the lexer might get changed when this mechanism asks
+  /// it to scan the pattern string.
+  /// <p/>
+  /// Normally a parser does not accept token {@code <expr>} as a valid
+  /// {@code expr} but, from the parser passed in, we create a special version of
+  /// the underlying grammar representation (an <seealso cref="ATN"/>) that allows imaginary
+  /// tokens representing rules ({@code <expr>}) to match entire rules. We call
+  /// these <em>bypass alternatives</em>.
+  /// <p/>
+  /// Delimiters are {@code <} and {@code >}, with {@code \} as the escape string
+  /// by default, but you can set them to whatever you want using
+  /// <seealso cref="#setDelimiters"/>. You must escape both start and stop strings
+  /// {@code \<} and {@code \>}.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC ParseTreePatternMatcher {
+  public:
+    class CannotInvokeStartRule : public RuntimeException {
+    public:
+      CannotInvokeStartRule(const RuntimeException &e);
+      ~CannotInvokeStartRule();
+    };
+
+    // Fixes https://github.com/antlr/antlr4/issues/413
+    // "Tree pattern compilation doesn't check for a complete parse"
+    class StartRuleDoesNotConsumeFullPattern : public RuntimeException {
+    public:
+      StartRuleDoesNotConsumeFullPattern() = default;
+      StartRuleDoesNotConsumeFullPattern(StartRuleDoesNotConsumeFullPattern const&) = default;
+      ~StartRuleDoesNotConsumeFullPattern();
+
+      StartRuleDoesNotConsumeFullPattern& operator=(StartRuleDoesNotConsumeFullPattern const&) = default;
+    };
+
+    /// Constructs a <seealso cref="ParseTreePatternMatcher"/> or from a <seealso cref="Lexer"/> and
+    /// <seealso cref="Parser"/> object. The lexer input stream is altered for tokenizing
+    /// the tree patterns. The parser is used as a convenient mechanism to get
+    /// the grammar name, plus token, rule names.
+    ParseTreePatternMatcher(Lexer *lexer, Parser *parser);
+    virtual ~ParseTreePatternMatcher();
+
+    /// <summary>
+    /// Set the delimiters used for marking rule and token tags within concrete
+    /// syntax used by the tree pattern parser.
+    /// </summary>
+    /// <param name="start"> The start delimiter. </param>
+    /// <param name="stop"> The stop delimiter. </param>
+    /// <param name="escapeLeft"> The escape sequence to use for escaping a start or stop delimiter.
+    /// </param>
+    /// <exception cref="IllegalArgumentException"> if {@code start} is {@code null} or empty. </exception>
+    /// <exception cref="IllegalArgumentException"> if {@code stop} is {@code null} or empty. </exception>
+    virtual void setDelimiters(const std::string &start, const std::string &stop, const std::string &escapeLeft);
+
+    /// <summary>
+    /// Does {@code pattern} matched as rule {@code patternRuleIndex} match {@code tree}? </summary>
+    virtual bool matches(ParseTree *tree, const std::string &pattern, int patternRuleIndex);
+
+    /// <summary>
+    /// Does {@code pattern} matched as rule patternRuleIndex match tree? Pass in a
+    ///  compiled pattern instead of a string representation of a tree pattern.
+    /// </summary>
+    virtual bool matches(ParseTree *tree, const ParseTreePattern &pattern);
+
+    /// <summary>
+    /// Compare {@code pattern} matched as rule {@code patternRuleIndex} against
+    /// {@code tree} and return a <seealso cref="ParseTreeMatch"/> object that contains the
+    /// matched elements, or the node at which the match failed.
+    /// </summary>
+    virtual ParseTreeMatch match(ParseTree *tree, const std::string &pattern, int patternRuleIndex);
+
+    /// <summary>
+    /// Compare {@code pattern} matched against {@code tree} and return a
+    /// <seealso cref="ParseTreeMatch"/> object that contains the matched elements, or the
+    /// node at which the match failed. Pass in a compiled pattern instead of a
+    /// string representation of a tree pattern.
+    /// </summary>
+    virtual ParseTreeMatch match(ParseTree *tree, const ParseTreePattern &pattern);
+
+    /// <summary>
+    /// For repeated use of a tree pattern, compile it to a
+    /// <seealso cref="ParseTreePattern"/> using this method.
+    /// </summary>
+    virtual ParseTreePattern compile(const std::string &pattern, int patternRuleIndex);
+
+    /// <summary>
+    /// Used to convert the tree pattern string into a series of tokens. The
+    /// input stream is reset.
+    /// </summary>
+    virtual Lexer* getLexer();
+
+    /// <summary>
+    /// Used to collect to the grammar file name, token names, rule names for
+    /// used to parse the pattern into a parse tree.
+    /// </summary>
+    virtual Parser* getParser();
+
+    // ---- SUPPORT CODE ----
+
+    virtual std::vector<std::unique_ptr<Token>> tokenize(const std::string &pattern);
+
+    /// Split "<ID> = <e:expr>;" into 4 chunks for tokenizing by tokenize().
+    virtual std::vector<Chunk> split(const std::string &pattern);
+
+  protected:
+    std::string _start;
+    std::string _stop;
+    std::string _escape; // e.g., \< and \> must escape BOTH!
+
+    /// Recursively walk {@code tree} against {@code patternTree}, filling
+    /// {@code match.}<seealso cref="ParseTreeMatch#labels labels"/>.
+    ///
+    /// <returns> the first node encountered in {@code tree} which does not match
+    /// a corresponding node in {@code patternTree}, or {@code null} if the match
+    /// was successful. The specific node returned depends on the matching
+    /// algorithm used by the implementation, and may be overridden. </returns>
+    virtual ParseTree* matchImpl(ParseTree *tree, ParseTree *patternTree, std::map<std::string, std::vector<ParseTree *>> &labels);
+
+    /// Is t <expr> subtree?
+    virtual RuleTagToken* getRuleTagToken(ParseTree *t);
+
+  private:
+    Lexer *_lexer;
+    Parser *_parser;
+
+    void InitializeInstanceFields();
+  };
+
+} // namespace pattern
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/RuleTagToken.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/RuleTagToken.cpp
new file mode 100755
index 0000000000..4e33f989d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/RuleTagToken.cpp
@@ -0,0 +1,77 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Exceptions.h"
+
+#include "tree/pattern/RuleTagToken.h"
+
+using namespace antlr4::tree::pattern;
+
+RuleTagToken::RuleTagToken(const std::string &/*ruleName*/, int _bypassTokenType) : bypassTokenType(_bypassTokenType) {
+}
+
+RuleTagToken::RuleTagToken(const std::string &ruleName, size_t bypassTokenType, const std::string &label)
+  : ruleName(ruleName), bypassTokenType(bypassTokenType), label(label) {
+  if (ruleName.empty()) {
+    throw IllegalArgumentException("ruleName cannot be null or empty.");
+  }
+
+}
+
+std::string RuleTagToken::getRuleName() const {
+  return ruleName;
+}
+
+std::string RuleTagToken::getLabel() const {
+  return label;
+}
+
+size_t RuleTagToken::getChannel() const {
+  return DEFAULT_CHANNEL;
+}
+
+std::string RuleTagToken::getText() const {
+  if (label != "") {
+    return std::string("<") + label + std::string(":") + ruleName + std::string(">");
+  }
+
+  return std::string("<") + ruleName + std::string(">");
+}
+
+size_t RuleTagToken::getType() const {
+  return bypassTokenType;
+}
+
+size_t RuleTagToken::getLine() const {
+  return 0;
+}
+
+size_t RuleTagToken::getCharPositionInLine() const {
+  return INVALID_INDEX;
+}
+
+size_t RuleTagToken::getTokenIndex() const {
+  return INVALID_INDEX;
+}
+
+size_t RuleTagToken::getStartIndex() const {
+  return INVALID_INDEX;
+}
+
+size_t RuleTagToken::getStopIndex() const {
+  return INVALID_INDEX;
+}
+
+antlr4::TokenSource *RuleTagToken::getTokenSource() const {
+  return nullptr;
+}
+
+antlr4::CharStream *RuleTagToken::getInputStream() const {
+  return nullptr;
+}
+
+std::string RuleTagToken::toString() const {
+  return ruleName + ":" + std::to_string(bypassTokenType);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/RuleTagToken.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/RuleTagToken.h
new file mode 100755
index 0000000000..368ae41b84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/RuleTagToken.h
@@ -0,0 +1,117 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Token.h"
+
+namespace antlr4 {
+namespace tree {
+namespace pattern {
+
+  /// <summary>
+  /// A <seealso cref="Token"/> object representing an entire subtree matched by a parser
+  /// rule; e.g., {@code <expr>}. These tokens are created for <seealso cref="TagChunk"/>
+  /// chunks where the tag corresponds to a parser rule.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC RuleTagToken : public Token {
+    /// <summary>
+    /// This is the backing field for <seealso cref="#getRuleName"/>.
+    /// </summary>
+  private:
+    const std::string ruleName;
+
+    /// The token type for the current token. This is the token type assigned to
+    /// the bypass alternative for the rule during ATN deserialization.
+    const size_t bypassTokenType;
+
+    /// This is the backing field for <seealso cref="#getLabe"/>.
+    const std::string label;
+
+  public:
+    /// <summary>
+    /// Constructs a new instance of <seealso cref="RuleTagToken"/> with the specified rule
+    /// name and bypass token type and no label.
+    /// </summary>
+    /// <param name="ruleName"> The name of the parser rule this rule tag matches. </param>
+    /// <param name="bypassTokenType"> The bypass token type assigned to the parser rule.
+    /// </param>
+    /// <exception cref="IllegalArgumentException"> if {@code ruleName} is {@code null}
+    /// or empty. </exception>
+    RuleTagToken(const std::string &ruleName, int bypassTokenType); //this(ruleName, bypassTokenType, nullptr);
+
+    /// <summary>
+    /// Constructs a new instance of <seealso cref="RuleTagToken"/> with the specified rule
+    /// name, bypass token type, and label.
+    /// </summary>
+    /// <param name="ruleName"> The name of the parser rule this rule tag matches. </param>
+    /// <param name="bypassTokenType"> The bypass token type assigned to the parser rule. </param>
+    /// <param name="label"> The label associated with the rule tag, or {@code null} if
+    /// the rule tag is unlabeled.
+    /// </param>
+    /// <exception cref="IllegalArgumentException"> if {@code ruleName} is {@code null}
+    /// or empty. </exception>
+    RuleTagToken(const std::string &ruleName, size_t bypassTokenType, const std::string &label);
+
+    /// <summary>
+    /// Gets the name of the rule associated with this rule tag.
+    /// </summary>
+    /// <returns> The name of the parser rule associated with this rule tag. </returns>
+    std::string getRuleName() const;
+
+    /// <summary>
+    /// Gets the label associated with the rule tag.
+    /// </summary>
+    /// <returns> The name of the label associated with the rule tag, or
+    /// {@code null} if this is an unlabeled rule tag. </returns>
+    std::string getLabel() const;
+
+    /// <summary>
+    /// {@inheritDoc}
+    /// <p/>
+    /// Rule tag tokens are always placed on the <seealso cref="#DEFAULT_CHANNE"/>.
+    /// </summary>
+    virtual size_t getChannel() const override;
+
+    /// <summary>
+    /// {@inheritDoc}
+    /// <p/>
+    /// This method returns the rule tag formatted with {@code <} and {@code >}
+    /// delimiters.
+    /// </summary>
+    virtual std::string getText() const override;
+
+    /// Rule tag tokens have types assigned according to the rule bypass
+    /// transitions created during ATN deserialization.
+    virtual size_t getType() const override;
+
+    /// The implementation for <seealso cref="RuleTagToken"/> always returns 0.
+    virtual size_t getLine() const override;
+
+    /// The implementation for <seealso cref="RuleTagToken"/> always returns INVALID_INDEX.
+    virtual size_t getCharPositionInLine() const override;
+
+    /// The implementation for <seealso cref="RuleTagToken"/> always returns INVALID_INDEX.
+    virtual size_t getTokenIndex() const override;
+
+    /// The implementation for <seealso cref="RuleTagToken"/> always returns INVALID_INDEX.
+    virtual size_t getStartIndex() const override;
+
+    /// The implementation for <seealso cref="RuleTagToken"/> always returns INVALID_INDEX.
+    virtual size_t getStopIndex() const override;
+
+    /// The implementation for <seealso cref="RuleTagToken"/> always returns {@code null}.
+    virtual TokenSource *getTokenSource() const override;
+
+    /// The implementation for <seealso cref="RuleTagToken"/> always returns {@code null}.
+    virtual CharStream *getInputStream() const override;
+
+    /// The implementation for <seealso cref="RuleTagToken"/> returns a string of the form {@code ruleName:bypassTokenType}.
+    virtual std::string toString() const override;
+  };
+
+} // namespace pattern
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TagChunk.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TagChunk.cpp
new file mode 100755
index 0000000000..77f2b4c9ca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TagChunk.cpp
@@ -0,0 +1,39 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Exceptions.h"
+
+#include "tree/pattern/TagChunk.h"
+
+using namespace antlr4::tree::pattern;
+
+TagChunk::TagChunk(const std::string &tag) : TagChunk("", tag) {
+}
+
+TagChunk::TagChunk(const std::string &label, const std::string &tag) : _tag(tag), _label(label) {
+  if (tag.empty()) {
+    throw IllegalArgumentException("tag cannot be null or empty");
+  }
+
+}
+
+TagChunk::~TagChunk() {
+}
+
+std::string TagChunk::getTag() {
+  return _tag;
+}
+
+std::string TagChunk::getLabel() {
+  return _label;
+}
+
+std::string TagChunk::toString() {
+  if (!_label.empty()) {
+    return _label + ":" + _tag;
+  }
+
+  return _tag;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TagChunk.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TagChunk.h
new file mode 100755
index 0000000000..3d0c9f8d84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TagChunk.h
@@ -0,0 +1,86 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Chunk.h"
+
+namespace antlr4 {
+namespace tree {
+namespace pattern {
+
+  /// <summary>
+  /// Represents a placeholder tag in a tree pattern. A tag can have any of the
+  /// following forms.
+  ///
+  /// <ul>
+  /// <li>{@code expr}: An unlabeled placeholder for a parser rule {@code expr}.</li>
+  /// <li>{@code ID}: An unlabeled placeholder for a token of type {@code ID}.</li>
+  /// <li>{@code e:expr}: A labeled placeholder for a parser rule {@code expr}.</li>
+  /// <li>{@code id:ID}: A labeled placeholder for a token of type {@code ID}.</li>
+  /// </ul>
+  ///
+  /// This class does not perform any validation on the tag or label names aside
+  /// from ensuring that the tag is a non-null, non-empty string.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC TagChunk : public Chunk {
+  public:
+    /// <summary>
+    /// Construct a new instance of <seealso cref="TagChunk"/> using the specified tag and
+    /// no label.
+    /// </summary>
+    /// <param name="tag"> The tag, which should be the name of a parser rule or token
+    /// type.
+    /// </param>
+    /// <exception cref="IllegalArgumentException"> if {@code tag} is {@code null} or
+    /// empty. </exception>
+    TagChunk(const std::string &tag);
+    virtual ~TagChunk();
+
+    /// <summary>
+    /// Construct a new instance of <seealso cref="TagChunk"/> using the specified label
+    /// and tag.
+    /// </summary>
+    /// <param name="label"> The label for the tag. If this is {@code null}, the
+    /// <seealso cref="TagChunk"/> represents an unlabeled tag. </param>
+    /// <param name="tag"> The tag, which should be the name of a parser rule or token
+    /// type.
+    /// </param>
+    /// <exception cref="IllegalArgumentException"> if {@code tag} is {@code null} or
+    /// empty. </exception>
+    TagChunk(const std::string &label, const std::string &tag);
+
+    /// <summary>
+    /// Get the tag for this chunk.
+    /// </summary>
+    /// <returns> The tag for the chunk. </returns>
+    std::string getTag();
+
+    /// <summary>
+    /// Get the label, if any, assigned to this chunk.
+    /// </summary>
+    /// <returns> The label assigned to this chunk, or {@code null} if no label is
+    /// assigned to the chunk. </returns>
+    std::string getLabel();
+
+    /// <summary>
+    /// This method returns a text representation of the tag chunk. Labeled tags
+    /// are returned in the form {@code label:tag}, and unlabeled tags are
+    /// returned as just the tag name.
+    /// </summary>
+    virtual std::string toString() override;
+
+  private:
+    /// This is the backing field for <seealso cref="#getTag"/>.
+    const std::string _tag;
+    /// <summary>
+    /// This is the backing field for <seealso cref="#getLabe"/>.
+    /// </summary>
+    const std::string _label;
+  };
+
+} // namespace pattern
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TextChunk.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TextChunk.cpp
new file mode 100755
index 0000000000..f8dcfb0df7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TextChunk.cpp
@@ -0,0 +1,28 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "Exceptions.h"
+
+#include "tree/pattern/TextChunk.h"
+
+using namespace antlr4::tree::pattern;
+
+TextChunk::TextChunk(const std::string &text) : text(text) {
+  if (text == "") {
+    throw IllegalArgumentException("text cannot be nul");
+  }
+
+}
+
+TextChunk::~TextChunk() {
+}
+
+std::string TextChunk::getText() {
+  return text;
+}
+
+std::string TextChunk::toString() {
+  return std::string("'") + text + std::string("'");
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TextChunk.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TextChunk.h
new file mode 100755
index 0000000000..1cbc0ddb2e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TextChunk.h
@@ -0,0 +1,51 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "Chunk.h"
+
+namespace antlr4 {
+namespace tree {
+namespace pattern {
+
+  /// <summary>
+  /// Represents a span of raw text (concrete syntax) between tags in a tree
+  /// pattern string.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC TextChunk : public Chunk {
+  private:
+    /// <summary>
+    /// This is the backing field for <seealso cref="#getText"/>.
+    /// </summary>
+    const std::string text;
+
+    /// <summary>
+    /// Constructs a new instance of <seealso cref="TextChunk"/> with the specified text.
+    /// </summary>
+    /// <param name="text"> The text of this chunk. </param>
+    /// <exception cref="IllegalArgumentException"> if {@code text} is {@code null}. </exception>
+  public:
+    TextChunk(const std::string &text);
+    virtual ~TextChunk();
+
+    /// <summary>
+    /// Gets the raw text of this chunk.
+    /// </summary>
+    /// <returns> The text of the chunk. </returns>
+    std::string getText();
+
+    /// <summary>
+    /// {@inheritDoc}
+    /// <p/>
+    /// The implementation for <seealso cref="TextChunk"/> returns the result of
+    /// <seealso cref="#getText()"/> in single quotes.
+    /// </summary>
+    virtual std::string toString() override;
+  };
+
+} // namespace pattern
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TokenTagToken.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TokenTagToken.cpp
new file mode 100755
index 0000000000..7d6cc9a9c7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TokenTagToken.cpp
@@ -0,0 +1,36 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/pattern/TokenTagToken.h"
+
+using namespace antlr4::tree::pattern;
+
+TokenTagToken::TokenTagToken(const std::string &/*tokenName*/, int type)
+  : CommonToken(type), tokenName(""), label("") {
+}
+
+TokenTagToken::TokenTagToken(const std::string &tokenName, int type, const std::string &label)
+  : CommonToken(type), tokenName(tokenName), label(label) {
+}
+
+std::string TokenTagToken::getTokenName() const {
+  return tokenName;
+}
+
+std::string TokenTagToken::getLabel() const {
+  return label;
+}
+
+std::string TokenTagToken::getText() const {
+  if (!label.empty()) {
+    return "<" + label + ":" + tokenName + ">";
+  }
+
+  return "<" + tokenName + ">";
+}
+
+std::string TokenTagToken::toString() const {
+  return tokenName + ":" + std::to_string(_type);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TokenTagToken.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TokenTagToken.h
new file mode 100755
index 0000000000..9013fb8c5e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/pattern/TokenTagToken.h
@@ -0,0 +1,80 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "CommonToken.h"
+
+namespace antlr4 {
+namespace tree {
+namespace pattern {
+
+  /// <summary>
+  /// A <seealso cref="Token"/> object representing a token of a particular type; e.g.,
+  /// {@code <ID>}. These tokens are created for <seealso cref="TagChunk"/> chunks where the
+  /// tag corresponds to a lexer rule or token type.
+  /// </summary>
+  class ANTLR4CPP_PUBLIC TokenTagToken : public CommonToken {
+    /// <summary>
+    /// This is the backing field for <seealso cref="#getTokenName"/>.
+    /// </summary>
+  private:
+    const std::string tokenName;
+    /// <summary>
+    /// This is the backing field for <seealso cref="#getLabe"/>.
+    /// </summary>
+    const std::string label;
+
+    /// <summary>
+    /// Constructs a new instance of <seealso cref="TokenTagToken"/> for an unlabeled tag
+    /// with the specified token name and type.
+    /// </summary>
+    /// <param name="tokenName"> The token name. </param>
+    /// <param name="type"> The token type. </param>
+  public:
+    TokenTagToken(const std::string &tokenName, int type); //this(tokenName, type, nullptr);
+
+    /// <summary>
+    /// Constructs a new instance of <seealso cref="TokenTagToken"/> with the specified
+    /// token name, type, and label.
+    /// </summary>
+    /// <param name="tokenName"> The token name. </param>
+    /// <param name="type"> The token type. </param>
+    /// <param name="label"> The label associated with the token tag, or {@code null} if
+    /// the token tag is unlabeled. </param>
+    TokenTagToken(const std::string &tokenName, int type, const std::string &label);
+
+    /// <summary>
+    /// Gets the token name. </summary>
+    /// <returns> The token name. </returns>
+    std::string getTokenName() const;
+
+    /// <summary>
+    /// Gets the label associated with the rule tag.
+    /// </summary>
+    /// <returns> The name of the label associated with the rule tag, or
+    /// {@code null} if this is an unlabeled rule tag. </returns>
+    std::string getLabel() const;
+
+    /// <summary>
+    /// {@inheritDoc}
+    /// <p/>
+    /// The implementation for <seealso cref="TokenTagToken"/> returns the token tag
+    /// formatted with {@code <} and {@code >} delimiters.
+    /// </summary>
+    virtual std::string getText() const override;
+
+    /// <summary>
+    /// {@inheritDoc}
+    /// <p/>
+    /// The implementation for <seealso cref="TokenTagToken"/> returns a string of the form
+    /// {@code tokenName:type}.
+    /// </summary>
+    virtual std::string toString() const override;
+  };
+
+} // namespace pattern
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPath.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPath.cpp
new file mode 100755
index 0000000000..c0398962ec
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPath.cpp
@@ -0,0 +1,154 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "XPathLexer.h"
+#include "XPathLexerErrorListener.h"
+#include "XPathElement.h"
+#include "XPathWildcardAnywhereElement.h"
+#include "XPathWildcardElement.h"
+#include "XPathTokenAnywhereElement.h"
+#include "XPathTokenElement.h"
+#include "XPathRuleAnywhereElement.h"
+#include "XPathRuleElement.h"
+
+#include "XPath.h"
+
+using namespace antlr4;
+using namespace antlr4::tree;
+using namespace antlr4::tree::xpath;
+
+const std::string XPath::WILDCARD = "*";
+const std::string XPath::NOT = "!";
+
+XPath::XPath(Parser *parser, const std::string &path) {
+  _parser = parser;
+  _path = path;
+}
+
+std::vector<std::unique_ptr<XPathElement>> XPath::split(const std::string &path) {
+  ANTLRInputStream in(path);
+  XPathLexer lexer(&in);
+  lexer.removeErrorListeners();
+  XPathLexerErrorListener listener;
+  lexer.addErrorListener(&listener);
+  CommonTokenStream tokenStream(&lexer);
+  try {
+    tokenStream.fill();
+  } catch (LexerNoViableAltException &) {
+    size_t pos = lexer.getCharPositionInLine();
+    std::string msg = "Invalid tokens or characters at index " + std::to_string(pos) + " in path '" + path + "'";
+    throw IllegalArgumentException(msg);
+  }
+
+  std::vector<Token *> tokens = tokenStream.getTokens();
+  std::vector<std::unique_ptr<XPathElement>> elements;
+  size_t n = tokens.size();
+  size_t i = 0;
+  bool done = false;
+  while (!done && i < n) {
+    Token *el = tokens[i];
+    Token *next = nullptr;
+    switch (el->getType()) {
+      case XPathLexer::ROOT:
+      case XPathLexer::ANYWHERE: {
+        bool anywhere = el->getType() == XPathLexer::ANYWHERE;
+        i++;
+        next = tokens[i];
+        bool invert = next->getType() == XPathLexer::BANG;
+        if (invert) {
+          i++;
+          next = tokens[i];
+        }
+        std::unique_ptr<XPathElement> pathElement = getXPathElement(next, anywhere);
+        pathElement->setInvert(invert);
+        elements.push_back(std::move(pathElement));
+        i++;
+        break;
+
+      }
+      case XPathLexer::TOKEN_REF:
+      case XPathLexer::RULE_REF:
+      case XPathLexer::WILDCARD:
+        elements.push_back(getXPathElement(el, false));
+        i++;
+        break;
+
+      case Token::EOF:
+        done = true;
+        break;
+
+      default :
+        throw IllegalArgumentException("Unknown path element " + el->toString());
+    }
+  }
+
+  return elements;
+}
+
+std::unique_ptr<XPathElement> XPath::getXPathElement(Token *wordToken, bool anywhere) {
+  if (wordToken->getType() == Token::EOF) {
+    throw IllegalArgumentException("Missing path element at end of path");
+  }
+
+  std::string word = wordToken->getText();
+  size_t ttype = _parser->getTokenType(word);
+  ssize_t ruleIndex = _parser->getRuleIndex(word);
+  switch (wordToken->getType()) {
+    case XPathLexer::WILDCARD :
+      if (anywhere)
+        return std::unique_ptr<XPathWildcardAnywhereElement>(new XPathWildcardAnywhereElement());
+      return std::unique_ptr<XPathWildcardElement>(new XPathWildcardElement());
+
+    case XPathLexer::TOKEN_REF:
+    case XPathLexer::STRING :
+      if (ttype == Token::INVALID_TYPE) {
+        throw IllegalArgumentException(word + " at index " + std::to_string(wordToken->getStartIndex()) + " isn't a valid token name");
+      }
+      if (anywhere)
+        return std::unique_ptr<XPathTokenAnywhereElement>(new XPathTokenAnywhereElement(word, (int)ttype));
+      return std::unique_ptr<XPathTokenElement>(new XPathTokenElement(word, (int)ttype));
+
+    default :
+      if (ruleIndex == -1) {
+        throw IllegalArgumentException(word + " at index " + std::to_string(wordToken->getStartIndex()) + " isn't a valid rule name");
+      }
+      if (anywhere)
+        return std::unique_ptr<XPathRuleAnywhereElement>(new XPathRuleAnywhereElement(word, (int)ruleIndex));
+      return std::unique_ptr<XPathRuleElement>(new XPathRuleElement(word, (int)ruleIndex));
+  }
+}
+
+static ParserRuleContext dummyRoot;
+
+std::vector<ParseTree *> XPath::findAll(ParseTree *tree, std::string const& xpath, Parser *parser) {
+  XPath p(parser, xpath);
+  return p.evaluate(tree);
+}
+
+std::vector<ParseTree *> XPath::evaluate(ParseTree *t) {
+  dummyRoot.children = { t }; // don't set t's parent.
+
+  std::vector<ParseTree *> work = { &dummyRoot };
+
+  size_t i = 0;
+  std::vector<std::unique_ptr<XPathElement>> elements = split(_path);
+
+  while (i < elements.size()) {
+    std::vector<ParseTree *> next;
+    for (auto *node : work) {
+      if (!node->children.empty()) {
+        // only try to match next element if it has children
+        // e.g., //func/*/stat might have a token node for which
+        // we can't go looking for stat nodes.
+        auto matching = elements[i]->evaluate(node);
+        next.insert(next.end(), matching.begin(), matching.end());
+      }
+    }
+    i++;
+    work = next;
+  }
+
+  return work;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPath.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPath.h
new file mode 100755
index 0000000000..e38d482d58
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPath.h
@@ -0,0 +1,86 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace tree {
+namespace xpath {
+
+  /// Represent a subset of XPath XML path syntax for use in identifying nodes in
+  /// parse trees.
+  ///
+  /// <para>
+  /// Split path into words and separators {@code /} and {@code //} via ANTLR
+  /// itself then walk path elements from left to right. At each separator-word
+  /// pair, find set of nodes. Next stage uses those as work list.</para>
+  ///
+  /// <para>
+  /// The basic interface is
+  /// <seealso cref="XPath#findAll ParseTree.findAll"/>{@code (tree, pathString, parser)}.
+  /// But that is just shorthand for:</para>
+  ///
+  /// <pre>
+  /// <seealso cref="XPath"/> p = new <seealso cref="XPath#XPath XPath"/>(parser, pathString);
+  /// return p.<seealso cref="#evaluate evaluate"/>(tree);
+  /// </pre>
+  ///
+  /// <para>
+  /// See {@code org.antlr.v4.test.TestXPath} for descriptions. In short, this
+  /// allows operators:</para>
+  ///
+  /// <dl>
+  /// <dt>/</dt> <dd>root</dd>
+  /// <dt>//</dt> <dd>anywhere</dd>
+  /// <dt>!</dt> <dd>invert; this must appear directly after root or anywhere
+  /// operator</dd>
+  /// </dl>
+  ///
+  /// <para>
+  /// and path elements:</para>
+  ///
+  /// <dl>
+  /// <dt>ID</dt> <dd>token name</dd>
+  /// <dt>'string'</dt> <dd>any string literal token from the grammar</dd>
+  /// <dt>expr</dt> <dd>rule name</dd>
+  /// <dt>*</dt> <dd>wildcard matching any node</dd>
+  /// </dl>
+  ///
+  /// <para>
+  /// Whitespace is not allowed.</para>
+
+  class ANTLR4CPP_PUBLIC XPath {
+  public:
+    static const std::string WILDCARD; // word not operator/separator
+    static const std::string NOT; // word for invert operator
+
+    XPath(Parser *parser, const std::string &path);
+    virtual ~XPath() {}
+
+    // TODO: check for invalid token/rule names, bad syntax
+    virtual std::vector<std::unique_ptr<XPathElement>> split(const std::string &path);
+
+    static std::vector<ParseTree *> findAll(ParseTree *tree, std::string const& xpath, Parser *parser);
+
+    /// Return a list of all nodes starting at {@code t} as root that satisfy the
+    /// path. The root {@code /} is relative to the node passed to
+    /// <seealso cref="#evaluate"/>.
+    virtual std::vector<ParseTree *> evaluate(ParseTree *t);
+
+  protected:
+    std::string _path;
+    Parser *_parser;
+
+    /// Convert word like {@code *} or {@code ID} or {@code expr} to a path
+    /// element. {@code anywhere} is {@code true} if {@code //} precedes the
+    /// word.
+    virtual std::unique_ptr<XPathElement> getXPathElement(Token *wordToken, bool anywhere);
+  };
+
+} // namespace xpath
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathElement.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathElement.cpp
new file mode 100755
index 0000000000..64b122df13
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathElement.cpp
@@ -0,0 +1,31 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "support/CPPUtils.h"
+
+#include "XPathElement.h"
+
+using namespace antlr4::tree;
+using namespace antlr4::tree::xpath;
+
+XPathElement::XPathElement(const std::string &nodeName) {
+  _nodeName = nodeName;
+}
+
+XPathElement::~XPathElement() {
+}
+
+std::vector<ParseTree *> XPathElement::evaluate(ParseTree * /*t*/) {
+  return {};
+}
+
+std::string XPathElement::toString() const {
+  std::string inv = _invert ? "!" : "";
+  return antlrcpp::toString(*this) + "[" + inv + _nodeName + "]";
+}
+
+void XPathElement::setInvert(bool value) {
+  _invert = value;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathElement.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathElement.h
new file mode 100755
index 0000000000..f339117d7f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathElement.h
@@ -0,0 +1,40 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "antlr4-common.h"
+
+namespace antlr4 {
+namespace tree {
+  class ParseTree;
+
+namespace xpath {
+
+  class ANTLR4CPP_PUBLIC XPathElement {
+  public:
+    /// Construct element like {@code /ID} or {@code ID} or {@code /*} etc...
+    ///  op is null if just node
+    XPathElement(const std::string &nodeName);
+    XPathElement(XPathElement const&) = default;
+    virtual ~XPathElement();
+
+    XPathElement& operator=(XPathElement const&) = default;
+
+    /// Given tree rooted at {@code t} return all nodes matched by this path
+    /// element.
+    virtual std::vector<ParseTree *> evaluate(ParseTree *t);
+    virtual std::string toString() const;
+
+    void setInvert(bool value);
+
+  protected:
+    std::string _nodeName;
+    bool _invert = false;
+  };
+
+} // namespace xpath
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.cpp
new file mode 100644
index 0000000000..4d7448a89b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.cpp
@@ -0,0 +1,180 @@
+
+// Generated from XPathLexer.g4 by ANTLR 4.13.0
+
+
+#include "XPathLexer.h"
+
+
+using namespace antlr4;
+
+
+
+using namespace antlr4;
+
+namespace {
+
+struct XPathLexerStaticData final {
+  XPathLexerStaticData(std::vector<std::string> ruleNames,
+                          std::vector<std::string> channelNames,
+                          std::vector<std::string> modeNames,
+                          std::vector<std::string> literalNames,
+                          std::vector<std::string> symbolicNames)
+      : ruleNames(std::move(ruleNames)), channelNames(std::move(channelNames)),
+        modeNames(std::move(modeNames)), literalNames(std::move(literalNames)),
+        symbolicNames(std::move(symbolicNames)),
+        vocabulary(this->literalNames, this->symbolicNames) {}
+
+  XPathLexerStaticData(const XPathLexerStaticData&) = delete;
+  XPathLexerStaticData(XPathLexerStaticData&&) = delete;
+  XPathLexerStaticData& operator=(const XPathLexerStaticData&) = delete;
+  XPathLexerStaticData& operator=(XPathLexerStaticData&&) = delete;
+
+  std::vector<antlr4::dfa::DFA> decisionToDFA;
+  antlr4::atn::PredictionContextCache sharedContextCache;
+  const std::vector<std::string> ruleNames;
+  const std::vector<std::string> channelNames;
+  const std::vector<std::string> modeNames;
+  const std::vector<std::string> literalNames;
+  const std::vector<std::string> symbolicNames;
+  const antlr4::dfa::Vocabulary vocabulary;
+  antlr4::atn::SerializedATNView serializedATN;
+  std::unique_ptr<antlr4::atn::ATN> atn;
+};
+
+::antlr4::internal::OnceFlag xpathlexerLexerOnceFlag;
+#if ANTLR4_USE_THREAD_LOCAL_CACHE
+static thread_local
+#endif
+XPathLexerStaticData *xpathlexerLexerStaticData = nullptr;
+
+void xpathlexerLexerInitialize() {
+#if ANTLR4_USE_THREAD_LOCAL_CACHE
+  if (xpathlexerLexerStaticData != nullptr) {
+    return;
+  }
+#else
+  assert(xpathlexerLexerStaticData == nullptr);
+#endif
+  auto staticData = std::make_unique<XPathLexerStaticData>(
+    std::vector<std::string>{
+      "ANYWHERE", "ROOT", "WILDCARD", "BANG", "ID", "NameChar", "NameStartChar", 
+      "STRING"
+    },
+    std::vector<std::string>{
+      "DEFAULT_TOKEN_CHANNEL", "HIDDEN"
+    },
+    std::vector<std::string>{
+      "DEFAULT_MODE"
+    },
+    std::vector<std::string>{
+      "", "", "", "'//'", "'/'", "'*'", "'!'"
+    },
+    std::vector<std::string>{
+      "", "TOKEN_REF", "RULE_REF", "ANYWHERE", "ROOT", "WILDCARD", "BANG", 
+      "ID", "STRING"
+    }
+  );
+  static const int32_t serializedATNSegment[] = {
+  	4,0,8,50,6,-1,2,0,7,0,2,1,7,1,2,2,7,2,2,3,7,3,2,4,7,4,2,5,7,5,2,6,7,6,
+  	2,7,7,7,1,0,1,0,1,0,1,1,1,1,1,2,1,2,1,3,1,3,1,4,1,4,5,4,29,8,4,10,4,12,
+  	4,32,9,4,1,4,1,4,1,5,1,5,3,5,38,8,5,1,6,1,6,1,7,1,7,5,7,44,8,7,10,7,12,
+  	7,47,9,7,1,7,1,7,1,45,0,8,1,3,3,4,5,5,7,6,9,7,11,0,13,0,15,8,1,0,2,5,
+  	0,48,57,95,95,183,183,768,879,8255,8256,13,0,65,90,97,122,192,214,216,
+  	246,248,767,880,893,895,8191,8204,8205,8304,8591,11264,12271,12289,55295,
+  	63744,64975,65008,65535,50,0,1,1,0,0,0,0,3,1,0,0,0,0,5,1,0,0,0,0,7,1,
+  	0,0,0,0,9,1,0,0,0,0,15,1,0,0,0,1,17,1,0,0,0,3,20,1,0,0,0,5,22,1,0,0,0,
+  	7,24,1,0,0,0,9,26,1,0,0,0,11,37,1,0,0,0,13,39,1,0,0,0,15,41,1,0,0,0,17,
+  	18,5,47,0,0,18,19,5,47,0,0,19,2,1,0,0,0,20,21,5,47,0,0,21,4,1,0,0,0,22,
+  	23,5,42,0,0,23,6,1,0,0,0,24,25,5,33,0,0,25,8,1,0,0,0,26,30,3,13,6,0,27,
+  	29,3,11,5,0,28,27,1,0,0,0,29,32,1,0,0,0,30,28,1,0,0,0,30,31,1,0,0,0,31,
+  	33,1,0,0,0,32,30,1,0,0,0,33,34,6,4,0,0,34,10,1,0,0,0,35,38,3,13,6,0,36,
+  	38,7,0,0,0,37,35,1,0,0,0,37,36,1,0,0,0,38,12,1,0,0,0,39,40,7,1,0,0,40,
+  	14,1,0,0,0,41,45,5,39,0,0,42,44,9,0,0,0,43,42,1,0,0,0,44,47,1,0,0,0,45,
+  	46,1,0,0,0,45,43,1,0,0,0,46,48,1,0,0,0,47,45,1,0,0,0,48,49,5,39,0,0,49,
+  	16,1,0,0,0,4,0,30,37,45,1,1,4,0
+  };
+  staticData->serializedATN = antlr4::atn::SerializedATNView(serializedATNSegment, sizeof(serializedATNSegment) / sizeof(serializedATNSegment[0]));
+
+  antlr4::atn::ATNDeserializer deserializer;
+  staticData->atn = deserializer.deserialize(staticData->serializedATN);
+
+  const size_t count = staticData->atn->getNumberOfDecisions();
+  staticData->decisionToDFA.reserve(count);
+  for (size_t i = 0; i < count; i++) { 
+    staticData->decisionToDFA.emplace_back(staticData->atn->getDecisionState(i), i);
+  }
+  xpathlexerLexerStaticData = staticData.release();
+}
+
+}
+
+XPathLexer::XPathLexer(CharStream *input) : Lexer(input) {
+  XPathLexer::initialize();
+  _interpreter = new atn::LexerATNSimulator(this, *xpathlexerLexerStaticData->atn, xpathlexerLexerStaticData->decisionToDFA, xpathlexerLexerStaticData->sharedContextCache);
+}
+
+XPathLexer::~XPathLexer() {
+  delete _interpreter;
+}
+
+std::string XPathLexer::getGrammarFileName() const {
+  return "XPathLexer.g4";
+}
+
+const std::vector<std::string>& XPathLexer::getRuleNames() const {
+  return xpathlexerLexerStaticData->ruleNames;
+}
+
+const std::vector<std::string>& XPathLexer::getChannelNames() const {
+  return xpathlexerLexerStaticData->channelNames;
+}
+
+const std::vector<std::string>& XPathLexer::getModeNames() const {
+  return xpathlexerLexerStaticData->modeNames;
+}
+
+const dfa::Vocabulary& XPathLexer::getVocabulary() const {
+  return xpathlexerLexerStaticData->vocabulary;
+}
+
+antlr4::atn::SerializedATNView XPathLexer::getSerializedATN() const {
+  return xpathlexerLexerStaticData->serializedATN;
+}
+
+const atn::ATN& XPathLexer::getATN() const {
+  return *xpathlexerLexerStaticData->atn;
+}
+
+
+void XPathLexer::action(RuleContext *context, size_t ruleIndex, size_t actionIndex) {
+  switch (ruleIndex) {
+    case 4: IDAction(antlrcpp::downCast<antlr4::RuleContext *>(context), actionIndex); break;
+
+  default:
+    break;
+  }
+}
+
+void XPathLexer::IDAction(antlr4::RuleContext *context, size_t actionIndex) {
+  switch (actionIndex) {
+    case 0: 
+    				if (isupper(getText()[0]))
+    				  setType(TOKEN_REF);
+    				else
+    				  setType(RULE_REF);
+    				 break;
+
+  default:
+    break;
+  }
+}
+
+
+
+void XPathLexer::initialize() {
+#if ANTLR4_USE_THREAD_LOCAL_CACHE
+  xpathlexerLexerInitialize();
+#else
+  ::antlr4::internal::call_once(xpathlexerLexerOnceFlag, xpathlexerLexerInitialize);
+#endif
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.g4 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.g4
new file mode 100644
index 0000000000..14bcf5ab73
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.g4
@@ -0,0 +1,64 @@
+lexer grammar XPathLexer;
+
+tokens { TOKEN_REF, RULE_REF }
+
+/*
+path : separator? word (separator word)* EOF ;
+
+separator
+	:	'/'  '!'
+	|	'//' '!'
+	|	'/'
+	|	'//'
+	;
+
+word:	TOKEN_REF
+	|	RULE_REF
+	|	STRING
+	|	'*'
+	;
+*/
+
+ANYWHERE : '//' ;
+ROOT	 : '/' ;
+WILDCARD : '*' ;
+BANG	 : '!' ;
+
+ID			:	NameStartChar NameChar*
+				{
+				if (isupper(getText()[0]))
+				  setType(TOKEN_REF);
+				else
+				  setType(RULE_REF);
+				}
+			;
+
+fragment
+NameChar    :   NameStartChar
+            |   '0'..'9'
+            |   '_'
+            |   '\u00B7'
+            |   '\u0300'..'\u036F'
+            |   '\u203F'..'\u2040'
+            ;
+
+fragment
+NameStartChar
+            :   'A'..'Z' | 'a'..'z'
+            |   '\u00C0'..'\u00D6'
+            |   '\u00D8'..'\u00F6'
+            |   '\u00F8'..'\u02FF'
+            |   '\u0370'..'\u037D'
+            |   '\u037F'..'\u1FFF'
+            |   '\u200C'..'\u200D'
+            |   '\u2070'..'\u218F'
+            |   '\u2C00'..'\u2FEF'
+            |   '\u3001'..'\uD7FF'
+            |   '\uF900'..'\uFDCF'
+            |   '\uFDF0'..'\uFFFF' // implicitly includes ['\u10000-'\uEFFFF]
+            ;
+
+STRING : '\'' .*? '\'';
+
+//WS : [ \t\r\n]+ -> skip ;
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.h
new file mode 100644
index 0000000000..8757bf2a51
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.h
@@ -0,0 +1,53 @@
+
+// Generated from XPathLexer.g4 by ANTLR 4.13.0
+
+#pragma once
+
+
+#include "antlr4-runtime.h"
+
+
+
+
+class  XPathLexer : public antlr4::Lexer {
+public:
+  enum {
+    TOKEN_REF = 1, RULE_REF = 2, ANYWHERE = 3, ROOT = 4, WILDCARD = 5, BANG = 6, 
+    ID = 7, STRING = 8
+  };
+
+  explicit XPathLexer(antlr4::CharStream *input);
+
+  ~XPathLexer() override;
+
+
+  std::string getGrammarFileName() const override;
+
+  const std::vector<std::string>& getRuleNames() const override;
+
+  const std::vector<std::string>& getChannelNames() const override;
+
+  const std::vector<std::string>& getModeNames() const override;
+
+  const antlr4::dfa::Vocabulary& getVocabulary() const override;
+
+  antlr4::atn::SerializedATNView getSerializedATN() const override;
+
+  const antlr4::atn::ATN& getATN() const override;
+
+  void action(antlr4::RuleContext *context, size_t ruleIndex, size_t actionIndex) override;
+
+  // By default the static state used to implement the lexer is lazily initialized during the first
+  // call to the constructor. You can call this function if you wish to initialize the static state
+  // ahead of time.
+  static void initialize();
+
+private:
+
+  // Individual action functions triggered by action() above.
+  void IDAction(antlr4::RuleContext *context, size_t actionIndex);
+
+  // Individual semantic predicate functions triggered by sempred() above.
+
+};
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.tokens b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.tokens
new file mode 100644
index 0000000000..5bf699ec93
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexer.tokens
@@ -0,0 +1,12 @@
+TOKEN_REF=1
+RULE_REF=2
+ANYWHERE=3
+ROOT=4
+WILDCARD=5
+BANG=6
+ID=7
+STRING=8
+'//'=3
+'/'=4
+'*'=5
+'!'=6
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexerErrorListener.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexerErrorListener.cpp
new file mode 100755
index 0000000000..2804c8ee3d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexerErrorListener.cpp
@@ -0,0 +1,13 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "XPathLexerErrorListener.h"
+
+using namespace antlr4;
+using namespace antlr4::tree::xpath;
+
+void XPathLexerErrorListener::syntaxError(Recognizer * /*recognizer*/, Token * /*offendingSymbol*/,
+  size_t /*line*/, size_t /*charPositionInLine*/, const std::string &/*msg*/, std::exception_ptr /*e*/) {
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexerErrorListener.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexerErrorListener.h
new file mode 100755
index 0000000000..c0c3eaaca7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathLexerErrorListener.h
@@ -0,0 +1,22 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "BaseErrorListener.h"
+
+namespace antlr4 {
+namespace tree {
+namespace xpath {
+
+  class ANTLR4CPP_PUBLIC XPathLexerErrorListener : public BaseErrorListener {
+  public:
+    virtual void syntaxError(Recognizer *recognizer, Token *offendingSymbol, size_t line,
+      size_t charPositionInLine, const std::string &msg, std::exception_ptr e) override;
+  };
+
+} // namespace xpath
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleAnywhereElement.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleAnywhereElement.cpp
new file mode 100755
index 0000000000..9ca910df2e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleAnywhereElement.cpp
@@ -0,0 +1,20 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/ParseTree.h"
+#include "tree/Trees.h"
+
+#include "tree/xpath/XPathRuleAnywhereElement.h"
+
+using namespace antlr4::tree;
+using namespace antlr4::tree::xpath;
+
+XPathRuleAnywhereElement::XPathRuleAnywhereElement(const std::string &ruleName, int ruleIndex) : XPathElement(ruleName) {
+  _ruleIndex = ruleIndex;
+}
+
+std::vector<ParseTree *> XPathRuleAnywhereElement::evaluate(ParseTree *t) {
+  return Trees::findAllRuleNodes(t, _ruleIndex);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleAnywhereElement.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleAnywhereElement.h
new file mode 100755
index 0000000000..2ceb75ceed
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleAnywhereElement.h
@@ -0,0 +1,27 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "XPathElement.h"
+
+namespace antlr4 {
+namespace tree {
+namespace xpath {
+
+  /// Either {@code ID} at start of path or {@code ...//ID} in middle of path.
+  class ANTLR4CPP_PUBLIC XPathRuleAnywhereElement : public XPathElement {
+  public:
+    XPathRuleAnywhereElement(const std::string &ruleName, int ruleIndex);
+
+    virtual std::vector<ParseTree *> evaluate(ParseTree *t) override;
+
+  protected:
+    int _ruleIndex = 0;
+  };
+
+} // namespace xpath
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleElement.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleElement.cpp
new file mode 100755
index 0000000000..1d145fb575
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleElement.cpp
@@ -0,0 +1,30 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/ParseTree.h"
+#include "tree/Trees.h"
+
+#include "XPathRuleElement.h"
+
+using namespace antlr4::tree;
+using namespace antlr4::tree::xpath;
+
+XPathRuleElement::XPathRuleElement(const std::string &ruleName, size_t ruleIndex) : XPathElement(ruleName) {
+  _ruleIndex = ruleIndex;
+}
+
+std::vector<ParseTree *> XPathRuleElement::evaluate(ParseTree *t) {
+  // return all children of t that match nodeName
+  std::vector<ParseTree *> nodes;
+  for (auto *c : t->children) {
+    if (antlrcpp::is<ParserRuleContext *>(c)) {
+      ParserRuleContext *ctx = dynamic_cast<ParserRuleContext *>(c);
+      if ((ctx->getRuleIndex() == _ruleIndex && !_invert) || (ctx->getRuleIndex() != _ruleIndex && _invert)) {
+        nodes.push_back(ctx);
+      }
+    }
+  }
+  return nodes;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleElement.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleElement.h
new file mode 100755
index 0000000000..b57276f033
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathRuleElement.h
@@ -0,0 +1,26 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "XPathElement.h"
+
+namespace antlr4 {
+namespace tree {
+namespace xpath {
+
+  class ANTLR4CPP_PUBLIC XPathRuleElement : public XPathElement {
+  public:
+    XPathRuleElement(const std::string &ruleName, size_t ruleIndex);
+
+    virtual std::vector<ParseTree *> evaluate(ParseTree *t) override;
+
+  protected:
+    size_t _ruleIndex = 0;
+  };
+
+} // namespace xpath
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenAnywhereElement.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenAnywhereElement.cpp
new file mode 100755
index 0000000000..c557c9d675
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenAnywhereElement.cpp
@@ -0,0 +1,20 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/ParseTree.h"
+#include "tree/Trees.h"
+
+#include "XPathTokenAnywhereElement.h"
+
+using namespace antlr4::tree;
+using namespace antlr4::tree::xpath;
+
+XPathTokenAnywhereElement::XPathTokenAnywhereElement(const std::string &tokenName, int tokenType) : XPathElement(tokenName) {
+  this->tokenType = tokenType;
+}
+
+std::vector<ParseTree *> XPathTokenAnywhereElement::evaluate(ParseTree *t) {
+  return Trees::findAllTokenNodes(t, tokenType);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenAnywhereElement.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenAnywhereElement.h
new file mode 100755
index 0000000000..2045d91b32
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenAnywhereElement.h
@@ -0,0 +1,25 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "XPathElement.h"
+
+namespace antlr4 {
+namespace tree {
+namespace xpath {
+
+  class ANTLR4CPP_PUBLIC XPathTokenAnywhereElement : public XPathElement {
+  protected:
+    int tokenType = 0;
+  public:
+    XPathTokenAnywhereElement(const std::string &tokenName, int tokenType);
+
+    virtual std::vector<ParseTree *> evaluate(ParseTree *t) override;
+  };
+
+} // namespace xpath
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenElement.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenElement.cpp
new file mode 100755
index 0000000000..d52fc26afd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenElement.cpp
@@ -0,0 +1,33 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "tree/ParseTree.h"
+#include "tree/Trees.h"
+#include "support/CPPUtils.h"
+#include "Token.h"
+
+#include "XPathTokenElement.h"
+
+using namespace antlr4;
+using namespace antlr4::tree;
+using namespace antlr4::tree::xpath;
+
+XPathTokenElement::XPathTokenElement(const std::string &tokenName, size_t tokenType) : XPathElement(tokenName) {
+  _tokenType = tokenType;
+}
+
+std::vector<ParseTree *> XPathTokenElement::evaluate(ParseTree *t) {
+  // return all children of t that match nodeName
+  std::vector<ParseTree *> nodes;
+  for (auto *c : t->children) {
+    if (antlrcpp::is<TerminalNode *>(c)) {
+      TerminalNode *tnode = dynamic_cast<TerminalNode *>(c);
+      if ((tnode->getSymbol()->getType() == _tokenType && !_invert) || (tnode->getSymbol()->getType() != _tokenType && _invert)) {
+        nodes.push_back(tnode);
+      }
+    }
+  }
+  return nodes;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenElement.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenElement.h
new file mode 100755
index 0000000000..7221530ce6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathTokenElement.h
@@ -0,0 +1,26 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "XPathElement.h"
+
+namespace antlr4 {
+namespace tree {
+namespace xpath {
+
+  class ANTLR4CPP_PUBLIC XPathTokenElement : public XPathElement {
+  public:
+    XPathTokenElement(const std::string &tokenName, size_t tokenType);
+
+    virtual std::vector<ParseTree *> evaluate(ParseTree *t) override;
+
+  protected:
+    size_t _tokenType = 0;
+  };
+
+} // namespace xpath
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardAnywhereElement.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardAnywhereElement.cpp
new file mode 100755
index 0000000000..4ff424f056
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardAnywhereElement.cpp
@@ -0,0 +1,23 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "XPath.h"
+#include "tree/ParseTree.h"
+#include "tree/Trees.h"
+
+#include "XPathWildcardAnywhereElement.h"
+
+using namespace antlr4::tree;
+using namespace antlr4::tree::xpath;
+
+XPathWildcardAnywhereElement::XPathWildcardAnywhereElement() : XPathElement(XPath::WILDCARD) {
+}
+
+std::vector<ParseTree *> XPathWildcardAnywhereElement::evaluate(ParseTree *t) {
+  if (_invert) {
+    return {}; // !* is weird but valid (empty)
+  }
+  return Trees::getDescendants(t);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardAnywhereElement.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardAnywhereElement.h
new file mode 100755
index 0000000000..dc5d1e5a29
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardAnywhereElement.h
@@ -0,0 +1,23 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "XPathElement.h"
+
+namespace antlr4 {
+namespace tree {
+namespace xpath {
+
+  class ANTLR4CPP_PUBLIC XPathWildcardAnywhereElement : public XPathElement {
+  public:
+    XPathWildcardAnywhereElement();
+
+    virtual std::vector<ParseTree *> evaluate(ParseTree *t) override;
+  };
+
+} // namespace xpath
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardElement.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardElement.cpp
new file mode 100755
index 0000000000..aabda5a9be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardElement.cpp
@@ -0,0 +1,24 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#include "XPath.h"
+#include "tree/ParseTree.h"
+#include "tree/Trees.h"
+
+#include "XPathWildcardElement.h"
+
+using namespace antlr4::tree;
+using namespace antlr4::tree::xpath;
+
+XPathWildcardElement::XPathWildcardElement() : XPathElement(XPath::WILDCARD) {
+}
+
+std::vector<ParseTree *> XPathWildcardElement::evaluate(ParseTree *t) {
+  if (_invert) {
+    return {}; // !* is weird but valid (empty)
+  }
+
+  return t->children;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardElement.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardElement.h
new file mode 100755
index 0000000000..accb461de2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/antlr4_runtime/src/tree/xpath/XPathWildcardElement.h
@@ -0,0 +1,23 @@
+/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+ * Use of this file is governed by the BSD 3-clause license that
+ * can be found in the LICENSE.txt file in the project root.
+ */
+
+#pragma once
+
+#include "XPathElement.h"
+
+namespace antlr4 {
+namespace tree {
+namespace xpath {
+
+  class ANTLR4CPP_PUBLIC XPathWildcardElement : public XPathElement {
+  public:
+    XPathWildcardElement();
+
+    virtual std::vector<ParseTree *> evaluate(ParseTree *t) override;
+  };
+
+} // namespace xpath
+} // namespace tree
+} // namespace antlr4
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/CHANGELOG.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/CHANGELOG.md
new file mode 100644
index 0000000000..91e5005edb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/CHANGELOG.md
@@ -0,0 +1,258 @@
+# Changelog
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
+and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
+
+## Unreleased
+
+## [1.1.0] - 2023-08-28
+
+### Added
+ - decoder: `BrotliDecoderAttachDictionary`
+ - decoder: `BrotliDecoderOnFinish` callback behind `BROTLI_REPORTING`
+ - decoder: `BrotliDecoderSetMetadataCallbacks`
+ - encoder: `BrotliEncoderPrepareDictionary`,
+            `BrotliEncoderDestroyPreparedDictionary`,
+            `BrotliEncoderAttachPreparedDictionary`
+ - decoder: `BrotliEncoderOnFinish` callback behind `BROTLI_REPORTING`
+ - common: `BrotliSharedDictionaryCreateInstance`,
+           `BrotliSharedDictionaryDestroyInstance`,
+           `BrotliSharedDictionaryAttach`
+ - CLI: `--dictionary` option
+ - java: encoder wrapper: `Parameters.mode`
+ - java: `Brotli{Input|Output}Stream.attachDictionary`
+ - java: wrapper: partial byte array input
+ - typescript: decoder (transpiled from Java)
+
+### Removed
+ - build: `BROTLI_BUILD_PORTABLE` option
+
+### Fixed
+ - java: JNI decoder failed sometimes on power of 2 payloads
+
+### Improved
+ - java / js: smaller decoder footprint
+ - decoder: faster decoding
+ - encoder: faster encoding
+ - encoder: smaller stack frames
+
+
+## [1.0.9] - 2020-08-27
+
+Re-release of 1.0.8.
+
+
+## [1.0.8] - 2020-08-27
+
+### SECURITY
+ - CVE-2020-8927: potential overflow when input chunk is >2GiB
+
+### Added
+ - encoder: `BROTLI_PARAM_STREAM_OFFSET`
+
+### Improved
+ - CLI: better reporting
+ - CLI: workaround for "lying feof"
+ - java: faster decoding
+ - java: support "large window"
+ - encoder: use less memory
+ - release: filter sources for the tarball
+
+
+## [1.0.7] - 2018-10-23
+
+### Improved
+ - decoder: faster decoding on ARM CPU
+
+
+## [1.0.6] - 2018-09-13
+
+### Fixed
+ - build: AutoMake and CMake build
+ - java: JDK 8<->9 incompatibility
+
+
+## [1.0.5] - 2018-06-27
+
+### Added
+ - scripts: extraction of static dictionary from RFC
+
+### Improved
+ - encoder: better compression at quality 1
+ - encoder: better compression with "large window"
+
+
+## [1.0.4] - 2018-03-29
+
+### Added
+ - encoder: `BROTLI_PARAM_NPOSTFIX`, `BROTLI_PARAM_NDIRECT`
+ - CLI: `--large_window` option
+
+### Improved
+ - encoder: better compression
+
+
+## [1.0.3] - 2018-03-02
+
+### Added
+ - decoder: `BROTLI_DECODER_PARAM_LARGE_WINDOW` enum
+ - encoder: `BROTLI_PARAM_LARGE_WINDOW` enum
+ - java: `BrotliInputStream.setEager`
+
+### Fixed
+ - build: AutoMake build in some environments
+ - encoder: fix one-shot q=10 1-byte input compression
+
+### Improved
+ - encoder: better font compression
+
+
+## [1.0.2] - 2017-11-28
+
+### Added
+ - build: AutoMake
+ - research: better dictionary generators
+
+
+## [1.0.1] - 2017-09-22
+
+### Changed
+ - clarifications in `README.md`
+
+
+## [1.0.0] - 2017-09-20
+
+### Added
+ - decoder: `BrotliDecoderSetParameter`
+ - csharp: decoder (transpiled from Java)
+ - java: JNI wrappers
+ - javascript: decoder (transpiled from Java)
+ - python: streaming decompression
+ - research: dictionary generator
+
+### Changed
+ - CLI: rename `bro` to `brotli`
+
+### Removed
+ - decoder: `BrotliDecoderSetCustomDictionary`
+ - encoder: `BrotliEncoderSetCustomDictionary`
+
+### Improved
+ - java: faster decoding
+ - encoder: faster compression
+
+
+## [0.6.0] - 2017-04-10
+
+### Added
+ - CLI: `--no-copy-stat option
+ - java: pure java decoder
+ - build: fuzzers
+ - research: `brotlidump` tool to explore brotli streams
+ - go: wrapper
+
+### Removed
+ - decoder: API with plain `Brotli` prefix
+
+### Deprecated
+ - encoder: `BrotliEncoderInputBlockSize`, `BrotliEncoderCopyInputToRingBuffer`,
+            `BrotliEncoderWriteData`
+
+### Improved
+ - encoder: faster compression
+ - encoder: denser compression
+ - decoder: faster decompression
+ - python: release GIL
+ - python: use zero-copy API
+
+
+## [0.5.2] - 2016-08-11
+
+### Added
+ - common: `BROTLI_BOOL`, `BROTLI_TRUE`, `BROTLI_FALSE`
+ - decoder: API with `BrotliDecoder` prefix instead of plain `Brotli`
+ - build: Bazel, CMake
+
+### Deprecated
+ - decoder: API with plain `Brotli` prefix
+
+### Changed
+ - boolean argument / result types are re-branded as `BROTLI_BOOL`
+
+### Improved
+ - build: reduced amount of warnings in various build environments
+ - encoder: faster compression
+ - encoder: lower memory usage
+
+
+## [0.5.0] - 2016-06-15
+
+### Added
+ - common: library has been assembled from shared parts of decoder and encoder
+ - encoder: C API
+
+### Removed
+ - encoder: C++ API
+
+
+## [0.4.0] - 2016-06-14
+
+### Added
+ - encoder: faster compression modes (quality 0 and 1)
+ - decoder: `BrotliGetErrorCode`, `BrotliErrorString` and
+            `BROTLI_ERROR_CODES_LIST`
+
+### Removed
+ - decoder: deprecated streaming API (using `BrotliInput`)
+
+### Fixed
+ - decoder: possible pointer underflow
+
+### Improved
+ - encoder: faster compression
+
+
+## [0.3.0] - 2015-12-22
+
+### LICENSE
+License have been upgraded to more permissive MIT.
+
+### Added
+ - CLI: `--window` option
+ - `tools/version.h` file
+ - decoder: low level streaming API
+ - decoder: custom memory manager API
+
+### Deprecated
+ - decoder: streaming API using `BrotliInput` struct
+
+### Fixed
+ - decoder: processing of uncompressed blocks
+ - encoder: possible division by zero
+
+### Improved
+ - encoder: faster decompression
+ - build: more portable builds for various CPU architectures
+
+
+## [0.2.0] - 2015-09-01
+
+### Added
+ - CLI: `--verbose` and `--repeat` options
+
+### Fixed
+ - decoder: processing of uncompressed blocks
+ - encoder: block stitching on quality 10 / 11
+
+### Improved
+ - build: CI/CD integration
+ - build: better test coverage
+ - encoder: better compression of UTF-8 content
+ - encoder: faster decompression
+
+
+## [0.1.0] - 2015-08-11
+
+Initial release.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/CMakeLists.txt
new file mode 100644
index 0000000000..f38c78c114
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/CMakeLists.txt
@@ -0,0 +1,355 @@
+# Available CMake versions:
+#  - Ubuntu  20.04 LTS   : 3.16.3
+#  - Solaris 11.4 SRU 15 : 3.15
+cmake_minimum_required(VERSION 3.15)
+
+# Since this project's version is loaded from other files, this policy
+# will help suppress the warning generated by cmake.
+# This policy is set because we can't provide "VERSION" in "project" command.
+# Use `cmake --help-policy CMP0048` for more information.
+cmake_policy(SET CMP0048 NEW)
+project(brotli C)
+
+option(BUILD_SHARED_LIBS "Build shared libraries" OFF)
+set(BROTLI_BUILD_TOOLS OFF CACHE BOOL "Build/install CLI tools")
+
+if(NOT CMAKE_BUILD_TYPE AND NOT CMAKE_CONFIGURATION_TYPES)
+  message(STATUS "Setting build type to Release as none was specified.")
+  set(CMAKE_BUILD_TYPE "Release" CACHE STRING "Choose the type of build" FORCE)
+else()
+  message(STATUS "Build type is '${CMAKE_BUILD_TYPE}'")
+endif()
+
+include(CheckCSourceCompiles)
+check_c_source_compiles(
+  "#if defined(__EMSCRIPTEN__)
+   int main() {return 0;}
+   #endif"
+  BROTLI_EMSCRIPTEN
+)
+if (BROTLI_EMSCRIPTEN)
+  message("-- Compiler is EMSCRIPTEN")
+else()
+  message("-- Compiler is not EMSCRIPTEN")
+endif()
+
+# If Brotli is being bundled in another project, we don't want to
+# install anything.  However, we want to let people override this, so
+# we'll use the BROTLI_BUNDLED_MODE variable to let them do that; just
+# set it to OFF in your project before you add_subdirectory(brotli).
+get_directory_property(BROTLI_PARENT_DIRECTORY PARENT_DIRECTORY)
+if(NOT DEFINED BROTLI_BUNDLED_MODE)
+  # Bundled mode hasn't been set one way or the other, set the default
+  # depending on whether or not we are the top-level project.
+  if(BROTLI_PARENT_DIRECTORY)
+    set(BROTLI_BUNDLED_MODE ON)
+  else()
+    set(BROTLI_BUNDLED_MODE OFF)
+  endif()
+endif()
+mark_as_advanced(BROTLI_BUNDLED_MODE)
+
+include(GNUInstallDirs)
+
+# Reads macro from .h file; it is expected to be a single-line define.
+function(read_macro PATH MACRO OUTPUT)
+  file(STRINGS ${PATH} _line REGEX "^#define +${MACRO} +(.+)$")
+  string(REGEX REPLACE "^#define +${MACRO} +(.+)$" "\\1" _val "${_line}")
+  set(${OUTPUT} ${_val} PARENT_SCOPE)
+endfunction(read_macro)
+
+# Version information
+read_macro("c/common/version.h" "BROTLI_VERSION_MAJOR" BROTLI_VERSION_MAJOR)
+read_macro("c/common/version.h" "BROTLI_VERSION_MINOR" BROTLI_VERSION_MINOR)
+read_macro("c/common/version.h" "BROTLI_VERSION_PATCH" BROTLI_VERSION_PATCH)
+set(BROTLI_VERSION "${BROTLI_VERSION_MAJOR}.${BROTLI_VERSION_MINOR}.${BROTLI_VERSION_PATCH}")
+mark_as_advanced(BROTLI_VERSION BROTLI_VERSION_MAJOR BROTLI_VERSION_MINOR BROTLI_VERSION_PATCH)
+
+# ABI Version information
+read_macro("c/common/version.h" "BROTLI_ABI_CURRENT" BROTLI_ABI_CURRENT)
+read_macro("c/common/version.h" "BROTLI_ABI_REVISION" BROTLI_ABI_REVISION)
+read_macro("c/common/version.h" "BROTLI_ABI_AGE" BROTLI_ABI_AGE)
+math(EXPR BROTLI_ABI_COMPATIBILITY "${BROTLI_ABI_CURRENT} - ${BROTLI_ABI_AGE}")
+mark_as_advanced(BROTLI_ABI_CURRENT BROTLI_ABI_REVISION BROTLI_ABI_AGE BROTLI_ABI_COMPATIBILITY)
+
+if (ENABLE_SANITIZER)
+  set(CMAKE_C_FLAGS " ${CMAKE_C_FLAGS} -fsanitize=${ENABLE_SANITIZER}")
+  set(CMAKE_CXX_FLAGS " ${CMAKE_CXX_FLAGS} -fsanitize=${ENABLE_SANITIZER}")
+  set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -fsanitize=${ENABLE_SANITIZER}")
+endif ()
+
+include(CheckLibraryExists)
+set(LIBM_LIBRARY)
+CHECK_LIBRARY_EXISTS(m log2 "" HAVE_LIB_M)
+if(HAVE_LIB_M)
+  set(LIBM_LIBRARY "m")
+endif()
+
+set(BROTLI_INCLUDE_DIRS "${CMAKE_CURRENT_SOURCE_DIR}/c/include")
+mark_as_advanced(BROTLI_INCLUDE_DIRS)
+
+set(BROTLI_LIBRARIES_CORE brotlienc brotlidec brotlicommon)
+set(BROTLI_LIBRARIES ${BROTLI_LIBRARIES_CORE} ${LIBM_LIBRARY})
+mark_as_advanced(BROTLI_LIBRARIES)
+
+if(${CMAKE_SYSTEM_NAME} MATCHES "Linux")
+  add_definitions(-DOS_LINUX)
+elseif(${CMAKE_SYSTEM_NAME} MATCHES "FreeBSD")
+  add_definitions(-DOS_FREEBSD)
+elseif(${CMAKE_SYSTEM_NAME} MATCHES "Darwin")
+  add_definitions(-DOS_MACOSX)
+  set(CMAKE_MACOS_RPATH TRUE)
+  set(CMAKE_INSTALL_NAME_DIR "${CMAKE_INSTALL_FULL_LIBDIR}")
+endif()
+
+if(BROTLI_EMSCRIPTEN)
+  set(BUILD_SHARED_LIBS OFF)
+endif()
+
+file(GLOB_RECURSE BROTLI_COMMON_SOURCES RELATIVE ${CMAKE_CURRENT_SOURCE_DIR} c/common/*.c)
+add_library(brotlicommon ${BROTLI_COMMON_SOURCES})
+
+file(GLOB_RECURSE BROTLI_DEC_SOURCES RELATIVE ${CMAKE_CURRENT_SOURCE_DIR} c/dec/*.c)
+add_library(brotlidec ${BROTLI_DEC_SOURCES})
+
+file(GLOB_RECURSE BROTLI_ENC_SOURCES RELATIVE ${CMAKE_CURRENT_SOURCE_DIR} c/enc/*.c)
+add_library(brotlienc ${BROTLI_ENC_SOURCES})
+
+# Older CMake versions does not understand INCLUDE_DIRECTORIES property.
+include_directories(${BROTLI_INCLUDE_DIRS})
+
+if(BUILD_SHARED_LIBS)
+  foreach(lib ${BROTLI_LIBRARIES_CORE})
+    target_compile_definitions(${lib} PUBLIC "BROTLI_SHARED_COMPILATION" )
+    string(TOUPPER "${lib}" LIB)
+    set_target_properties (${lib} PROPERTIES DEFINE_SYMBOL "${LIB}_SHARED_COMPILATION")
+  endforeach()
+endif()
+
+foreach(lib ${BROTLI_LIBRARIES_CORE})
+  target_link_libraries(${lib} ${LIBM_LIBRARY})
+  set_property(TARGET ${lib} APPEND PROPERTY INCLUDE_DIRECTORIES ${BROTLI_INCLUDE_DIRS})
+  set_target_properties(${lib} PROPERTIES
+    VERSION "${BROTLI_ABI_COMPATIBILITY}.${BROTLI_ABI_AGE}.${BROTLI_ABI_REVISION}"
+    SOVERSION "${BROTLI_ABI_COMPATIBILITY}")
+  if(NOT BROTLI_EMSCRIPTEN)
+    set_target_properties(${lib} PROPERTIES POSITION_INDEPENDENT_CODE TRUE)
+  endif()
+  set_property(TARGET ${lib} APPEND PROPERTY INTERFACE_INCLUDE_DIRECTORIES "$<BUILD_INTERFACE:${BROTLI_INCLUDE_DIRS}>")
+endforeach()
+
+if(NOT BROTLI_EMSCRIPTEN)
+  target_link_libraries(brotlidec brotlicommon)
+  target_link_libraries(brotlienc brotlicommon)
+endif()
+
+# For projects stuck on older versions of CMake, this will set the
+# BROTLI_INCLUDE_DIRS and BROTLI_LIBRARIES variables so they still
+# have a relatively easy way to use Brotli:
+#
+#   include_directories(${BROTLI_INCLUDE_DIRS})
+#   target_link_libraries(foo ${BROTLI_LIBRARIES})
+if(BROTLI_PARENT_DIRECTORY)
+  set(BROTLI_INCLUDE_DIRS "${BROTLI_INCLUDE_DIRS}" PARENT_SCOPE)
+  set(BROTLI_LIBRARIES "${BROTLI_LIBRARIES}" PARENT_SCOPE)
+endif()
+
+# Build the brotli executable
+if(BROTLI_BUILD_TOOLS)
+  add_executable(brotli c/tools/brotli.c)
+  target_link_libraries(brotli ${BROTLI_LIBRARIES})
+endif()
+
+# Installation
+if(NOT BROTLI_BUNDLED_MODE)
+  if (BROTLI_BUILD_TOOLS)
+    install(
+      TARGETS brotli
+      RUNTIME DESTINATION "${CMAKE_INSTALL_BINDIR}"
+    )
+  endif()
+
+  install(
+    TARGETS ${BROTLI_LIBRARIES_CORE}
+    ARCHIVE DESTINATION "${CMAKE_INSTALL_LIBDIR}"
+    LIBRARY DESTINATION "${CMAKE_INSTALL_LIBDIR}"
+    RUNTIME DESTINATION "${CMAKE_INSTALL_BINDIR}"
+  )
+
+  install(
+    DIRECTORY ${BROTLI_INCLUDE_DIRS}/brotli
+    DESTINATION "${CMAKE_INSTALL_INCLUDEDIR}"
+  )
+endif()  # BROTLI_BUNDLED_MODE
+
+# Tests
+
+# Integration tests, those depend on `brotli` binary
+if(NOT BROTLI_DISABLE_TESTS AND BROTLI_BUILD_TOOLS)
+  # If we're targeting Windows but not running on Windows, we need Wine
+  # to run the tests...
+  if(WIN32 AND NOT CMAKE_HOST_WIN32)
+    find_program(BROTLI_WRAPPER NAMES wine)
+
+    if(NOT BROTLI_WRAPPER)
+      message(STATUS "wine not found, disabling tests")
+      set(BROTLI_DISABLE_TESTS TRUE)
+    endif()
+  endif()
+  # If our compiler is a cross-compiler that we know about (arm/aarch64),
+  # then we need to use qemu to execute the tests.
+  if ("${CMAKE_C_COMPILER}" MATCHES "^.*/arm-linux-gnueabihf-.*$")
+    message(STATUS "Detected arm-linux-gnueabihf cross-compilation")
+    set(BROTLI_WRAPPER "qemu-arm")
+    set(BROTLI_WRAPPER_LD_PREFIX "/usr/arm-linux-gnueabihf")
+  endif()
+
+  if ("${CMAKE_C_COMPILER}" MATCHES "^.*/arm-linux-gnueabi-.*$")
+    message(STATUS "Detected arm-linux-gnueabi cross-compilation")
+    set(BROTLI_WRAPPER "qemu-arm")
+    set(BROTLI_WRAPPER_LD_PREFIX "/usr/arm-linux-gnueabi")
+  endif()
+
+  if ("${CMAKE_C_COMPILER}" MATCHES "^.*/aarch64-linux-gnu-.*$")
+    message(STATUS "Detected aarch64-linux-gnu cross-compilation")
+    set(BROTLI_WRAPPER "qemu-aarch64")
+    set(BROTLI_WRAPPER_LD_PREFIX "/usr/aarch64-linux-gnu")
+  endif()
+
+  include(CTest)
+  enable_testing()
+
+  set(ROUNDTRIP_INPUTS
+    tests/testdata/alice29.txt
+    tests/testdata/asyoulik.txt
+    tests/testdata/lcet10.txt
+    tests/testdata/plrabn12.txt
+    c/enc/encode.c
+    c/common/dictionary.h
+    c/dec/decode.c)
+
+  foreach(INPUT ${ROUNDTRIP_INPUTS})
+    get_filename_component(OUTPUT_NAME "${INPUT}" NAME)
+
+    set(OUTPUT_FILE "${CMAKE_CURRENT_BINARY_DIR}/${OUTPUT_NAME}")
+    set(INPUT_FILE "${CMAKE_CURRENT_SOURCE_DIR}/${INPUT}")
+
+    if (EXISTS "${INPUT_FILE}")
+      foreach(quality 1 6 9 11)
+        add_test(NAME "${BROTLI_TEST_PREFIX}roundtrip/${INPUT}/${quality}"
+          COMMAND "${CMAKE_COMMAND}"
+            -DBROTLI_WRAPPER=${BROTLI_WRAPPER}
+            -DBROTLI_WRAPPER_LD_PREFIX=${BROTLI_WRAPPER_LD_PREFIX}
+            -DBROTLI_CLI=$<TARGET_FILE:brotli>
+            -DQUALITY=${quality}
+            -DINPUT=${INPUT_FILE}
+            -DOUTPUT=${OUTPUT_FILE}.${quality}
+            -P ${CMAKE_CURRENT_SOURCE_DIR}/tests/run-roundtrip-test.cmake)
+      endforeach()
+    else()
+      message(NOTICE "Test file ${INPUT} does not exist; OK on tarball builds; consider running scripts/download_testdata.sh before configuring.")
+    endif()
+  endforeach()
+
+  file(GLOB_RECURSE
+    COMPATIBILITY_INPUTS
+    RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
+    tests/testdata/*.compressed*)
+
+  foreach(INPUT ${COMPATIBILITY_INPUTS})
+    add_test(NAME "${BROTLI_TEST_PREFIX}compatibility/${INPUT}"
+      COMMAND "${CMAKE_COMMAND}"
+        -DBROTLI_WRAPPER=${BROTLI_WRAPPER}
+        -DBROTLI_WRAPPER_LD_PREFIX=${BROTLI_WRAPPER_LD_PREFIX}
+        -DBROTLI_CLI=$<TARGET_FILE:brotli>
+        -DINPUT=${CMAKE_CURRENT_SOURCE_DIR}/${INPUT}
+        -P ${CMAKE_CURRENT_SOURCE_DIR}/tests/run-compatibility-test.cmake)
+  endforeach()
+endif()  # BROTLI_DISABLE_TESTS
+
+# Generate a pkg-config files
+
+function(generate_pkg_config_path outvar path)
+  string(LENGTH "${path}" path_length)
+
+  set(path_args ${ARGV})
+  list(REMOVE_AT path_args 0 1)
+  list(LENGTH path_args path_args_remaining)
+
+  set("${outvar}" "${path}")
+
+  while(path_args_remaining GREATER 1)
+    list(GET path_args 0 name)
+    list(GET path_args 1 value)
+
+    get_filename_component(value_full "${value}" ABSOLUTE)
+    string(LENGTH "${value}" value_length)
+
+    if(path_length EQUAL value_length AND path STREQUAL value)
+      set("${outvar}" "\${${name}}")
+      break()
+    elseif(path_length GREATER value_length)
+      # We might be in a subdirectory of the value, but we have to be
+      # careful about a prefix matching but not being a subdirectory
+      # (for example, /usr/lib64 is not a subdirectory of /usr/lib).
+      # We'll do this by making sure the next character is a directory
+      # separator.
+      string(SUBSTRING "${path}" ${value_length} 1 sep)
+      if(sep STREQUAL "/")
+        string(SUBSTRING "${path}" 0 ${value_length} s)
+        if(s STREQUAL value)
+          string(SUBSTRING "${path}" "${value_length}" -1 suffix)
+          set("${outvar}" "\${${name}}${suffix}")
+          break()
+        endif()
+      endif()
+    endif()
+
+    list(REMOVE_AT path_args 0 1)
+    list(LENGTH path_args path_args_remaining)
+  endwhile()
+
+  set("${outvar}" "${${outvar}}" PARENT_SCOPE)
+endfunction(generate_pkg_config_path)
+
+function(transform_pc_file INPUT_FILE OUTPUT_FILE VERSION)
+  file(READ ${INPUT_FILE} TEXT)
+
+  set(PREFIX "${CMAKE_INSTALL_PREFIX}")
+  string(REGEX REPLACE "@prefix@" "${PREFIX}" TEXT ${TEXT})
+  string(REGEX REPLACE "@exec_prefix@" "${PREFIX}" TEXT ${TEXT})
+
+  generate_pkg_config_path(LIBDIR "${CMAKE_INSTALL_FULL_LIBDIR}" prefix "${PREFIX}")
+  string(REGEX REPLACE "@libdir@" "${LIBDIR}" TEXT ${TEXT})
+
+  generate_pkg_config_path(INCLUDEDIR "${CMAKE_INSTALL_FULL_INCLUDEDIR}" prefix "${PREFIX}")
+  string(REGEX REPLACE "@includedir@" "${INCLUDEDIR}" TEXT ${TEXT})
+
+  string(REGEX REPLACE "@PACKAGE_VERSION@" "${VERSION}" TEXT ${TEXT})
+
+  file(WRITE ${OUTPUT_FILE} ${TEXT})
+endfunction()
+
+transform_pc_file("scripts/libbrotlicommon.pc.in" "${CMAKE_CURRENT_BINARY_DIR}/libbrotlicommon.pc" "${BROTLI_VERSION}")
+
+transform_pc_file("scripts/libbrotlidec.pc.in" "${CMAKE_CURRENT_BINARY_DIR}/libbrotlidec.pc" "${BROTLI_VERSION}")
+
+transform_pc_file("scripts/libbrotlienc.pc.in" "${CMAKE_CURRENT_BINARY_DIR}/libbrotlienc.pc" "${BROTLI_VERSION}")
+
+if(NOT BROTLI_BUNDLED_MODE)
+  install(FILES "${CMAKE_CURRENT_BINARY_DIR}/libbrotlicommon.pc"
+    DESTINATION "${CMAKE_INSTALL_LIBDIR}/pkgconfig")
+  install(FILES "${CMAKE_CURRENT_BINARY_DIR}/libbrotlidec.pc"
+    DESTINATION "${CMAKE_INSTALL_LIBDIR}/pkgconfig")
+  install(FILES "${CMAKE_CURRENT_BINARY_DIR}/libbrotlienc.pc"
+    DESTINATION "${CMAKE_INSTALL_LIBDIR}/pkgconfig")
+endif()  # BROTLI_BUNDLED_MODE
+
+if (BROTLI_BUILD_TOOLS)
+  install(FILES "docs/brotli.1"
+    DESTINATION "${CMAKE_INSTALL_FULL_MANDIR}/man1")
+endif()
+
+if (ENABLE_COVERAGE STREQUAL "yes")
+  setup_target_for_coverage(coverage test coverage)
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/CONTRIBUTING.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/CONTRIBUTING.md
new file mode 100644
index 0000000000..b34ee15be1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/CONTRIBUTING.md
@@ -0,0 +1,32 @@
+Want to contribute? Great! First, read this page (including the small print at
+the end).
+
+### Before you contribute
+Before we can use your code, you must sign the
+[Google Individual Contributor License Agreement]
+(https://cla.developers.google.com/about/google-individual)
+(CLA), which you can do online. The CLA is necessary mainly because you own the
+copyright to your changes, even after your contribution becomes part of our
+codebase, so we need your permission to use and distribute your code. We also
+need to be sure of various other things—for instance that you'll tell us if you
+know that your code infringes on other people's patents. You don't have to sign
+the CLA until after you've submitted your code for review and a member has
+approved it, but you must do it before we can put your code into our codebase.
+Before you start working on a larger contribution, you should get in touch with
+us first through the issue tracker with your idea so that we can help out and
+possibly guide you. Coordinating up front makes it much easier to avoid
+frustration later on.
+
+### Code reviews
+All submissions, including submissions by project members, require review. We
+use Github pull requests for this purpose.
+
+### Code style
+Code should follow applicable formatting and style guides described in
+[Google Style Guides](https://google.github.io/styleguide/). C code should be
+C89 compatible.
+
+### The small print
+Contributions made by corporations are covered by a different agreement than
+the one above, the [Software Grant and Corporate Contributor License Agreement]
+(https://cla.developers.google.com/about/google-corporate).
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/LICENSE
new file mode 100644
index 0000000000..33b7cdd2db
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/LICENSE
@@ -0,0 +1,19 @@
+Copyright (c) 2009, 2010, 2013-2016 by the Brotli Authors.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/README b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/README
new file mode 100644
index 0000000000..dea7291306
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/README
@@ -0,0 +1,15 @@
+BROTLI DATA COMPRESSION LIBRARY
+
+Brotli is a generic-purpose lossless compression algorithm that compresses data
+using a combination of a modern variant of the LZ77 algorithm, Huffman coding
+and 2nd order context modeling, with a compression ratio comparable to the best
+currently available general-purpose compression methods. It is similar in speed
+with deflate but offers more dense compression.
+
+The specification of the Brotli Compressed Data Format is defined in RFC 7932
+https://tools.ietf.org/html/rfc7932
+
+Brotli is open-sourced under the MIT License, see the LICENSE file.
+
+Brotli mailing list:
+https://groups.google.com/forum/#!forum/brotli
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/README.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/README.md
new file mode 100644
index 0000000000..67bf4d94a0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/README.md
@@ -0,0 +1,95 @@
+<p align="center">
+  <img src="https://github.com/google/brotli/actions/workflows/build_test.yml/badge.svg" alt="GitHub Actions Build Status" href="https://github.com/google/brotli/actions?query=branch%3Amaster">
+  <img src="https://oss-fuzz-build-logs.storage.googleapis.com/badges/brotli.svg" alt="Fuzzing Status" href="https://oss-fuzz-build-logs.storage.googleapis.com/index.html#brotli">
+</p>
+<p align="center"><img src="https://brotli.org/brotli.svg" alt="Brotli" width="64"></p>
+
+### Introduction
+
+Brotli is a generic-purpose lossless compression algorithm that compresses data
+using a combination of a modern variant of the LZ77 algorithm, Huffman coding
+and 2nd order context modeling, with a compression ratio comparable to the best
+currently available general-purpose compression methods. It is similar in speed
+with deflate but offers more dense compression.
+
+The specification of the Brotli Compressed Data Format is defined in [RFC 7932](https://tools.ietf.org/html/rfc7932).
+
+Brotli is open-sourced under the MIT License, see the LICENSE file.
+
+> **Please note:** brotli is a "stream" format; it does not contain
+> meta-information, like checksums or uncompresssed data length. It is possible
+> to modify "raw" ranges of the compressed stream and the decoder will not
+> notice that.
+
+### Build instructions
+
+#### Vcpkg
+
+You can download and install brotli using the [vcpkg](https://github.com/Microsoft/vcpkg/) dependency manager:
+
+    git clone https://github.com/Microsoft/vcpkg.git
+    cd vcpkg
+    ./bootstrap-vcpkg.sh
+    ./vcpkg integrate install
+    ./vcpkg install brotli
+
+The brotli port in vcpkg is kept up to date by Microsoft team members and community contributors. If the version is out of date, please [create an issue or pull request](https://github.com/Microsoft/vcpkg) on the vcpkg repository.
+
+#### Bazel
+
+See [Bazel](http://www.bazel.build/)
+
+#### CMake
+
+The basic commands to build and install brotli are:
+
+    $ mkdir out && cd out
+    $ cmake -DCMAKE_BUILD_TYPE=Release -DCMAKE_INSTALL_PREFIX=./installed ..
+    $ cmake --build . --config Release --target install
+
+You can use other [CMake](https://cmake.org/) configuration.
+
+#### Python
+
+To install the latest release of the Python module, run the following:
+
+    $ pip install brotli
+
+To install the tip-of-the-tree version, run:
+
+    $ pip install --upgrade git+https://github.com/google/brotli
+
+See the [Python readme](python/README.md) for more details on installing
+from source, development, and testing.
+
+### Contributing
+
+We glad to answer/library related questions in
+[brotli mailing list](https://groups.google.com/forum/#!forum/brotli).
+
+Regular issues / feature requests should be reported in
+[issue tracker](https://github.com/google/brotli/issues).
+
+For reporting vulnerability please read [SECURITY](SECURITY.md).
+
+For contributing changes please read [CONTRIBUTING](CONTRIBUTING.md).
+
+### Benchmarks
+* [Squash Compression Benchmark](https://quixdb.github.io/squash-benchmark/) / [Unstable Squash Compression Benchmark](https://quixdb.github.io/squash-benchmark/unstable/)
+* [Large Text Compression Benchmark](http://mattmahoney.net/dc/text.html)
+* [Lzturbo Benchmark](https://sites.google.com/site/powturbo/home/benchmark)
+
+### Related projects
+> **Disclaimer:** Brotli authors take no responsibility for the third party projects mentioned in this section.
+
+Independent [decoder](https://github.com/madler/brotli) implementation by Mark Adler, based entirely on format specification.
+
+JavaScript port of brotli [decoder](https://github.com/devongovett/brotli.js). Could be used directly via `npm install brotli`
+
+Hand ported [decoder / encoder](https://github.com/dominikhlbg/BrotliHaxe) in haxe by Dominik Homberger. Output source code: JavaScript, PHP, Python, Java and C#
+
+7Zip [plugin](https://github.com/mcmilk/7-Zip-Zstd)
+
+Dart [native bindings](https://github.com/thosakwe/brotli)
+
+Dart compression framework with [fast FFI-based Brotli implementation](https://pub.dev/documentation/es_compression/latest/brotli/brotli-library.html) with ready-to-use prebuilt binaries for Win/Linux/Mac
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/SECURITY.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/SECURITY.md
new file mode 100644
index 0000000000..c2a44c6666
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/SECURITY.md
@@ -0,0 +1,6 @@
+### Reporting
+
+To report a security issue, please use [https://g.co/vulnz](https://g.co/vulnz).
+We use g.co/vulnz for our intake, and do coordination and disclosure here on
+GitHub (including using GitHub Security Advisory). The Google Security Team will
+respond within 5 working days of your report on g.co/vulnz.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/constants.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/constants.c
new file mode 100644
index 0000000000..89866b1505
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/constants.c
@@ -0,0 +1,15 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include "constants.h"
+
+const BrotliPrefixCodeRange
+    _kBrotliPrefixCodeRanges[BROTLI_NUM_BLOCK_LEN_SYMBOLS] = {
+        {1, 2},     {5, 2},     {9, 2},   {13, 2},    {17, 3},    {25, 3},
+        {33, 3},    {41, 3},    {49, 4},  {65, 4},    {81, 4},    {97, 4},
+        {113, 5},   {145, 5},   {177, 5}, {209, 5},   {241, 6},   {305, 6},
+        {369, 7},   {497, 8},   {753, 9}, {1265, 10}, {2289, 11}, {4337, 12},
+        {8433, 13}, {16625, 24}};
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/constants.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/constants.h
new file mode 100644
index 0000000000..31e5bd376e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/constants.h
@@ -0,0 +1,201 @@
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/**
+ * @file
+ * Common constants used in decoder and encoder API.
+ */
+
+#ifndef BROTLI_COMMON_CONSTANTS_H_
+#define BROTLI_COMMON_CONSTANTS_H_
+
+#include <brotli/port.h>
+#include <brotli/types.h>
+
+#include "platform.h"
+
+/* Specification: 7.3. Encoding of the context map */
+#define BROTLI_CONTEXT_MAP_MAX_RLE 16
+
+/* Specification: 2. Compressed representation overview */
+#define BROTLI_MAX_NUMBER_OF_BLOCK_TYPES 256
+
+/* Specification: 3.3. Alphabet sizes: insert-and-copy length */
+#define BROTLI_NUM_LITERAL_SYMBOLS 256
+#define BROTLI_NUM_COMMAND_SYMBOLS 704
+#define BROTLI_NUM_BLOCK_LEN_SYMBOLS 26
+#define BROTLI_MAX_CONTEXT_MAP_SYMBOLS (BROTLI_MAX_NUMBER_OF_BLOCK_TYPES + \
+                                        BROTLI_CONTEXT_MAP_MAX_RLE)
+#define BROTLI_MAX_BLOCK_TYPE_SYMBOLS (BROTLI_MAX_NUMBER_OF_BLOCK_TYPES + 2)
+
+/* Specification: 3.5. Complex prefix codes */
+#define BROTLI_REPEAT_PREVIOUS_CODE_LENGTH 16
+#define BROTLI_REPEAT_ZERO_CODE_LENGTH 17
+#define BROTLI_CODE_LENGTH_CODES (BROTLI_REPEAT_ZERO_CODE_LENGTH + 1)
+/* "code length of 8 is repeated" */
+#define BROTLI_INITIAL_REPEATED_CODE_LENGTH 8
+
+/* "Large Window Brotli" */
+
+/**
+ * The theoretical maximum number of distance bits specified for large window
+ * brotli, for 64-bit encoders and decoders. Even when in practice 32-bit
+ * encoders and decoders only support up to 30 max distance bits, the value is
+ * set to 62 because it affects the large window brotli file format.
+ * Specifically, it affects the encoding of simple huffman tree for distances,
+ * see Specification RFC 7932 chapter 3.4.
+ */
+#define BROTLI_LARGE_MAX_DISTANCE_BITS 62U
+#define BROTLI_LARGE_MIN_WBITS 10
+/**
+ * The maximum supported large brotli window bits by the encoder and decoder.
+ * Large window brotli allows up to 62 bits, however the current encoder and
+ * decoder, designed for 32-bit integers, only support up to 30 bits maximum.
+ */
+#define BROTLI_LARGE_MAX_WBITS 30
+
+/* Specification: 4. Encoding of distances */
+#define BROTLI_NUM_DISTANCE_SHORT_CODES 16
+/**
+ * Maximal number of "postfix" bits.
+ *
+ * Number of "postfix" bits is stored as 2 bits in meta-block header.
+ */
+#define BROTLI_MAX_NPOSTFIX 3
+#define BROTLI_MAX_NDIRECT 120
+#define BROTLI_MAX_DISTANCE_BITS 24U
+#define BROTLI_DISTANCE_ALPHABET_SIZE(NPOSTFIX, NDIRECT, MAXNBITS) ( \
+    BROTLI_NUM_DISTANCE_SHORT_CODES + (NDIRECT) +                    \
+    ((MAXNBITS) << ((NPOSTFIX) + 1)))
+/* BROTLI_NUM_DISTANCE_SYMBOLS == 1128 */
+#define BROTLI_NUM_DISTANCE_SYMBOLS \
+    BROTLI_DISTANCE_ALPHABET_SIZE(  \
+        BROTLI_MAX_NDIRECT, BROTLI_MAX_NPOSTFIX, BROTLI_LARGE_MAX_DISTANCE_BITS)
+
+/* ((1 << 26) - 4) is the maximal distance that can be expressed in RFC 7932
+   brotli stream using NPOSTFIX = 0 and NDIRECT = 0. With other NPOSTFIX and
+   NDIRECT values distances up to ((1 << 29) + 88) could be expressed. */
+#define BROTLI_MAX_DISTANCE 0x3FFFFFC
+
+/* ((1 << 31) - 4) is the safe distance limit. Using this number as a limit
+   allows safe distance calculation without overflows, given the distance
+   alphabet size is limited to corresponding size
+   (see kLargeWindowDistanceCodeLimits). */
+#define BROTLI_MAX_ALLOWED_DISTANCE 0x7FFFFFFC
+
+
+/* Specification: 4. Encoding of Literal Insertion Lengths and Copy Lengths */
+#define BROTLI_NUM_INS_COPY_CODES 24
+
+/* 7.1. Context modes and context ID lookup for literals */
+/* "context IDs for literals are in the range of 0..63" */
+#define BROTLI_LITERAL_CONTEXT_BITS 6
+
+/* 7.2. Context ID for distances */
+#define BROTLI_DISTANCE_CONTEXT_BITS 2
+
+/* 9.1. Format of the Stream Header */
+/* Number of slack bytes for window size. Don't confuse
+   with BROTLI_NUM_DISTANCE_SHORT_CODES. */
+#define BROTLI_WINDOW_GAP 16
+#define BROTLI_MAX_BACKWARD_LIMIT(W) (((size_t)1 << (W)) - BROTLI_WINDOW_GAP)
+
+typedef struct BrotliDistanceCodeLimit {
+  uint32_t max_alphabet_size;
+  uint32_t max_distance;
+} BrotliDistanceCodeLimit;
+
+/* This function calculates maximal size of distance alphabet, such that the
+   distances greater than the given values can not be represented.
+
+   This limits are designed to support fast and safe 32-bit decoders.
+   "32-bit" means that signed integer values up to ((1 << 31) - 1) could be
+   safely expressed.
+
+   Brotli distance alphabet symbols do not represent consecutive distance
+   ranges. Each distance alphabet symbol (excluding direct distances and short
+   codes), represent interleaved (for NPOSTFIX > 0) range of distances.
+   A "group" of consecutive (1 << NPOSTFIX) symbols represent non-interleaved
+   range. Two consecutive groups require the same amount of "extra bits".
+
+   It is important that distance alphabet represents complete "groups".
+   To avoid complex logic on encoder side about interleaved ranges
+   it was decided to restrict both sides to complete distance code "groups".
+ */
+BROTLI_UNUSED_FUNCTION BrotliDistanceCodeLimit BrotliCalculateDistanceCodeLimit(
+    uint32_t max_distance, uint32_t npostfix, uint32_t ndirect) {
+  BrotliDistanceCodeLimit result;
+  /* Marking this function as unused, because not all files
+     including "constants.h" use it -> compiler warns about that. */
+  BROTLI_UNUSED(&BrotliCalculateDistanceCodeLimit);
+  if (max_distance <= ndirect) {
+    /* This case never happens / exists only for the sake of completeness. */
+    result.max_alphabet_size = max_distance + BROTLI_NUM_DISTANCE_SHORT_CODES;
+    result.max_distance = max_distance;
+    return result;
+  } else {
+    /* The first prohibited value. */
+    uint32_t forbidden_distance = max_distance + 1;
+    /* Subtract "directly" encoded region. */
+    uint32_t offset = forbidden_distance - ndirect - 1;
+    uint32_t ndistbits = 0;
+    uint32_t tmp;
+    uint32_t half;
+    uint32_t group;
+    /* Postfix for the last dcode in the group. */
+    uint32_t postfix = (1u << npostfix) - 1;
+    uint32_t extra;
+    uint32_t start;
+    /* Remove postfix and "head-start". */
+    offset = (offset >> npostfix) + 4;
+    /* Calculate the number of distance bits. */
+    tmp = offset / 2;
+    /* Poor-man's log2floor, to avoid extra dependencies. */
+    while (tmp != 0) {ndistbits++; tmp = tmp >> 1;}
+    /* One bit is covered with subrange addressing ("half"). */
+    ndistbits--;
+    /* Find subrange. */
+    half = (offset >> ndistbits) & 1;
+    /* Calculate the "group" part of dcode. */
+    group = ((ndistbits - 1) << 1) | half;
+    /* Calculated "group" covers the prohibited distance value. */
+    if (group == 0) {
+      /* This case is added for correctness; does not occur for limit > 128. */
+      result.max_alphabet_size = ndirect + BROTLI_NUM_DISTANCE_SHORT_CODES;
+      result.max_distance = ndirect;
+      return result;
+    }
+    /* Decrement "group", so it is the last permitted "group". */
+    group--;
+    /* After group was decremented, ndistbits and half must be recalculated. */
+    ndistbits = (group >> 1) + 1;
+    /* The last available distance in the subrange has all extra bits set. */
+    extra = (1u << ndistbits) - 1;
+    /* Calculate region start. NB: ndistbits >= 1. */
+    start = (1u << (ndistbits + 1)) - 4;
+    /* Move to subregion. */
+    start += (group & 1) << ndistbits;
+    /* Calculate the alphabet size. */
+    result.max_alphabet_size = ((group << npostfix) | postfix) + ndirect +
+        BROTLI_NUM_DISTANCE_SHORT_CODES + 1;
+    /* Calculate the maximal distance representable by alphabet. */
+    result.max_distance = ((start + extra) << npostfix) + postfix + ndirect + 1;
+    return result;
+  }
+}
+
+/* Represents the range of values belonging to a prefix code:
+   [offset, offset + 2^nbits) */
+typedef struct {
+  uint16_t offset;
+  uint8_t nbits;
+} BrotliPrefixCodeRange;
+
+/* "Soft-private", it is exported, but not "advertised" as API. */
+BROTLI_COMMON_API extern const BrotliPrefixCodeRange
+    _kBrotliPrefixCodeRanges[BROTLI_NUM_BLOCK_LEN_SYMBOLS];
+
+#endif  /* BROTLI_COMMON_CONSTANTS_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/context.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/context.c
new file mode 100644
index 0000000000..7f9c958699
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/context.c
@@ -0,0 +1,156 @@
+#include "context.h"
+
+#include <brotli/types.h>
+
+/* Common context lookup table for all context modes. */
+const uint8_t _kBrotliContextLookupTable[2048] = {
+  /* CONTEXT_LSB6, last byte. */
+   0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
+  16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
+  32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
+  48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
+   0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
+  16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
+  32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
+  48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
+   0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
+  16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
+  32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
+  48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
+   0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
+  16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
+  32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
+  48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
+
+  /* CONTEXT_LSB6, second last byte, */
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+
+  /* CONTEXT_MSB6, last byte. */
+   0,  0,  0,  0,  1,  1,  1,  1,  2,  2,  2,  2,  3,  3,  3,  3,
+   4,  4,  4,  4,  5,  5,  5,  5,  6,  6,  6,  6,  7,  7,  7,  7,
+   8,  8,  8,  8,  9,  9,  9,  9, 10, 10, 10, 10, 11, 11, 11, 11,
+  12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15,
+  16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19,
+  20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23,
+  24, 24, 24, 24, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 27, 27,
+  28, 28, 28, 28, 29, 29, 29, 29, 30, 30, 30, 30, 31, 31, 31, 31,
+  32, 32, 32, 32, 33, 33, 33, 33, 34, 34, 34, 34, 35, 35, 35, 35,
+  36, 36, 36, 36, 37, 37, 37, 37, 38, 38, 38, 38, 39, 39, 39, 39,
+  40, 40, 40, 40, 41, 41, 41, 41, 42, 42, 42, 42, 43, 43, 43, 43,
+  44, 44, 44, 44, 45, 45, 45, 45, 46, 46, 46, 46, 47, 47, 47, 47,
+  48, 48, 48, 48, 49, 49, 49, 49, 50, 50, 50, 50, 51, 51, 51, 51,
+  52, 52, 52, 52, 53, 53, 53, 53, 54, 54, 54, 54, 55, 55, 55, 55,
+  56, 56, 56, 56, 57, 57, 57, 57, 58, 58, 58, 58, 59, 59, 59, 59,
+  60, 60, 60, 60, 61, 61, 61, 61, 62, 62, 62, 62, 63, 63, 63, 63,
+
+  /* CONTEXT_MSB6, second last byte, */
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+
+  /* CONTEXT_UTF8, last byte. */
+  /* ASCII range. */
+   0,  0,  0,  0,  0,  0,  0,  0,  0,  4,  4,  0,  0,  4,  0,  0,
+   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
+   8, 12, 16, 12, 12, 20, 12, 16, 24, 28, 12, 12, 32, 12, 36, 12,
+  44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 32, 32, 24, 40, 28, 12,
+  12, 48, 52, 52, 52, 48, 52, 52, 52, 48, 52, 52, 52, 52, 52, 48,
+  52, 52, 52, 52, 52, 48, 52, 52, 52, 52, 52, 24, 12, 28, 12, 12,
+  12, 56, 60, 60, 60, 56, 60, 60, 60, 56, 60, 60, 60, 60, 60, 56,
+  60, 60, 60, 60, 60, 56, 60, 60, 60, 60, 60, 24, 12, 28, 12,  0,
+  /* UTF8 continuation byte range. */
+  0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,
+  0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,
+  0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,
+  0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,
+  /* UTF8 lead byte range. */
+  2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,
+  2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,
+  2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,
+  2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,
+
+  /* CONTEXT_UTF8 second last byte. */
+  /* ASCII range. */
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+  2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1,
+  1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+  2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1,
+  1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+  3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 0,
+  /* UTF8 continuation byte range. */
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  /* UTF8 lead byte range. */
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+  2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+
+  /* CONTEXT_SIGNED, last byte, same as the above values shifted by 3 bits. */
+   0, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+  16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
+  16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
+  16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
+  32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
+  32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
+  32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
+  40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
+  40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
+  40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
+  48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 56,
+
+  /* CONTEXT_SIGNED, second last byte. */
+  0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+  2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+  2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+  2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+  3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+  3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+  3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+  3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+  4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+  4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+  4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+  4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+  5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+  5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+  5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+  6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7,
+};
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/context.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/context.h
new file mode 100644
index 0000000000..685a279dc0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/context.h
@@ -0,0 +1,113 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Lookup table to map the previous two bytes to a context id.
+
+  There are four different context modeling modes defined here:
+    CONTEXT_LSB6: context id is the least significant 6 bits of the last byte,
+    CONTEXT_MSB6: context id is the most significant 6 bits of the last byte,
+    CONTEXT_UTF8: second-order context model tuned for UTF8-encoded text,
+    CONTEXT_SIGNED: second-order context model tuned for signed integers.
+
+  If |p1| and |p2| are the previous two bytes, and |mode| is current context
+  mode, we calculate the context as:
+
+    context = ContextLut(mode)[p1] | ContextLut(mode)[p2 + 256].
+
+  For CONTEXT_UTF8 mode, if the previous two bytes are ASCII characters
+  (i.e. < 128), this will be equivalent to
+
+    context = 4 * context1(p1) + context2(p2),
+
+  where context1 is based on the previous byte in the following way:
+
+    0  : non-ASCII control
+    1  : \t, \n, \r
+    2  : space
+    3  : other punctuation
+    4  : " '
+    5  : %
+    6  : ( < [ {
+    7  : ) > ] }
+    8  : , ; :
+    9  : .
+    10 : =
+    11 : number
+    12 : upper-case vowel
+    13 : upper-case consonant
+    14 : lower-case vowel
+    15 : lower-case consonant
+
+  and context2 is based on the second last byte:
+
+    0 : control, space
+    1 : punctuation
+    2 : upper-case letter, number
+    3 : lower-case letter
+
+  If the last byte is ASCII, and the second last byte is not (in a valid UTF8
+  stream it will be a continuation byte, value between 128 and 191), the
+  context is the same as if the second last byte was an ASCII control or space.
+
+  If the last byte is a UTF8 lead byte (value >= 192), then the next byte will
+  be a continuation byte and the context id is 2 or 3 depending on the LSB of
+  the last byte and to a lesser extent on the second last byte if it is ASCII.
+
+  If the last byte is a UTF8 continuation byte, the second last byte can be:
+    - continuation byte: the next byte is probably ASCII or lead byte (assuming
+      4-byte UTF8 characters are rare) and the context id is 0 or 1.
+    - lead byte (192 - 207): next byte is ASCII or lead byte, context is 0 or 1
+    - lead byte (208 - 255): next byte is continuation byte, context is 2 or 3
+
+  The possible value combinations of the previous two bytes, the range of
+  context ids and the type of the next byte is summarized in the table below:
+
+  |--------\-----------------------------------------------------------------|
+  |         \                         Last byte                              |
+  | Second   \---------------------------------------------------------------|
+  | last byte \    ASCII            |   cont. byte        |   lead byte      |
+  |            \   (0-127)          |   (128-191)         |   (192-)         |
+  |=============|===================|=====================|==================|
+  |  ASCII      | next: ASCII/lead  |  not valid          |  next: cont.     |
+  |  (0-127)    | context: 4 - 63   |                     |  context: 2 - 3  |
+  |-------------|-------------------|---------------------|------------------|
+  |  cont. byte | next: ASCII/lead  |  next: ASCII/lead   |  next: cont.     |
+  |  (128-191)  | context: 4 - 63   |  context: 0 - 1     |  context: 2 - 3  |
+  |-------------|-------------------|---------------------|------------------|
+  |  lead byte  | not valid         |  next: ASCII/lead   |  not valid       |
+  |  (192-207)  |                   |  context: 0 - 1     |                  |
+  |-------------|-------------------|---------------------|------------------|
+  |  lead byte  | not valid         |  next: cont.        |  not valid       |
+  |  (208-)     |                   |  context: 2 - 3     |                  |
+  |-------------|-------------------|---------------------|------------------|
+*/
+
+#ifndef BROTLI_COMMON_CONTEXT_H_
+#define BROTLI_COMMON_CONTEXT_H_
+
+#include <brotli/port.h>
+#include <brotli/types.h>
+
+typedef enum ContextType {
+  CONTEXT_LSB6 = 0,
+  CONTEXT_MSB6 = 1,
+  CONTEXT_UTF8 = 2,
+  CONTEXT_SIGNED = 3
+} ContextType;
+
+/* "Soft-private", it is exported, but not "advertised" as API. */
+/* Common context lookup table for all context modes. */
+BROTLI_COMMON_API extern const uint8_t _kBrotliContextLookupTable[2048];
+
+typedef const uint8_t* ContextLut;
+
+/* typeof(MODE) == ContextType; returns ContextLut */
+#define BROTLI_CONTEXT_LUT(MODE) (&_kBrotliContextLookupTable[(MODE) << 9])
+
+/* typeof(LUT) == ContextLut */
+#define BROTLI_CONTEXT(P1, P2, LUT) ((LUT)[P1] | ((LUT) + 256)[P2])
+
+#endif  /* BROTLI_COMMON_CONTEXT_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.bin b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.bin
new file mode 100644
index 0000000000..a585c0e292
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.bin
@@ -0,0 +1,432 @@
+timedownlifeleftbackcodedatashowonlysitecityopenjustlikefreeworktextyearoverbodyloveformbookplaylivelinehelphomesidemorewordlongthemviewfindpagedaysfullheadtermeachareafromtruemarkableuponhighdatelandnewsevennextcasebothpostusedmadehandherewhatnameLinkblogsizebaseheldmakemainuser') +holdendswithNewsreadweresigntakehavegameseencallpathwellplusmenufilmpartjointhislistgoodneedwayswestjobsmindalsologorichuseslastteamarmyfoodkingwilleastwardbestfirePageknowaway.pngmovethanloadgiveselfnotemuchfeedmanyrockicononcelookhidediedHomerulehostajaxinfoclublawslesshalfsomesuchzone100%onescareTimeracebluefourweekfacehopegavehardlostwhenparkkeptpassshiproomHTMLplanTypedonesavekeepflaglinksoldfivetookratetownjumpthusdarkcardfilefearstaykillthatfallautoever.comtalkshopvotedeepmoderestturnbornbandfellroseurl(skinrolecomeactsagesmeetgold.jpgitemvaryfeltthensenddropViewcopy1.0"</a>stopelseliestourpack.gifpastcss?graymean&gt;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:�*/
+ 100hall.
+
+A7px;pushchat0px;crew*/</hash75pxflatrare && tellcampontolaidmissskiptentfinemalegetsplot400,
+
+coolfeet.php<br>ericmostguidbelldeschairmathatom/img&#82luckcent000;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
+|}
+%C3%:34ZjeffEXPIcashvisagolfsnowzh:�quer.csssickmeatmin.binddellhirepicsrent:36ZHTTP-201fotowolfEND xbox:54ZBODYdick;
+}
+exit:35Zvarsbeat'});diet999;anne}}</[i].Langkm²wiretoysaddssealalex;
+	}echonine.org005)tonyjewssandlegsroof000) 200winegeardogsbootgarycutstyletemption.xmlcockgang$('.50pxPh.Dmiscalanloandeskmileryanunixdisc);}
+dustclip).
+
+70px-200DVDs7]><tapedemoi++)wageeurophiloptsholeFAQsasin-26TlabspetsURL bulkcook;}
+HEAD[0])abbrjuan(198leshtwin</i>sonyguysfuckpipe|-
+!002)ndow[1];[];
+Log salt
+		bangtrimbath){
+00px
+});ko:�feesad>
s:// [];tollplug(){
+{
+ .js'200pdualboat.JPG);
+}quot);
+
+');
+
+}
201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037201320122011201020092008200720062005200420032002200120001999199819971996199519941993199219911990198919881987198619851984198319821981198019791978197719761975197419731972197119701969196819671966196519641963196219611960195919581957195619551954195319521951195010001024139400009999comomásesteestaperotodohacecadaañobiendíaasívidacasootroforosolootracualdijosidograntipotemadebealgoquéestonadatrespococasabajotodasinoaguapuesunosantediceluisellamayozonaamorpisoobraclicellodioshoracasiзанаомрарутанепоотизнодотожеонихНаеебымыВысовывоНообПолиниРФНеМытыОнимдаЗаДаНуОбтеИзейнуммТыужفيأنمامعكلأورديافىهولملكاولهبسالإنهيأيقدهلثمبهلوليبلايبكشيامأمنتبيلنحبهممشوشfirstvideolightworldmediawhitecloseblackrightsmallbooksplacemusicfieldorderpointvalueleveltableboardhousegroupworksyearsstatetodaywaterstartstyledeathpowerphonenighterrorinputabouttermstitletoolseventlocaltimeslargewordsgamesshortspacefocusclearmodelblockguideradiosharewomenagainmoneyimagenamesyounglineslatercolorgreenfront&amp;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&#39;200px_namelatinenjoyajax.ationsmithU.S. holdspeterindianav">chainscorecomesdoingpriorShare1990sromanlistsjapanfallstrialowneragree</h2>abusealertopera"-//WcardshillsteamsPhototruthclean.php?saintmetallouismeantproofbriefrow">genretrucklooksValueFrame.net/-->
+<try {
+var makescostsplainadultquesttrainlaborhelpscausemagicmotortheir250pxleaststepsCountcouldglasssidesfundshotelawardmouthmovesparisgivesdutchtexasfruitnull,||[];top">
+<!--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});
+bandsqueue= {};80px;cking{
+		aheadclockirishlike ratiostatsForm"yahoo)[0];Aboutfinds</h1>debugtasksURL =cells})();12px;primetellsturns0x600.jpg"spainbeachtaxesmicroangel--></giftssteve-linkbody.});
+	mount (199FAQ</rogerfrankClass28px;feeds<h1><scotttests22px;drink) || lewisshall#039; for lovedwaste00px;ja:�simon<fontreplymeetsuntercheaptightBrand) != dressclipsroomsonkeymobilmain.Name platefunnytreescom/"1.jpgwmodeparamSTARTleft idden, 201);
+}
+form.viruschairtransworstPagesitionpatch<!--
+o-cacfirmstours,000 asiani++){adobe')[0]id=10both;menu .2.mi.png"kevincoachChildbruce2.jpgURL)+.jpg|suitesliceharry120" sweettr>
+name=diegopage swiss-->
+
+#fff;">Log.com"treatsheet) && 14px;sleepntentfiledja:�id="cName"worseshots-box-delta
+&lt;bears:48Z<data-rural</a> spendbakershops= "";php">ction13px;brianhellosize=o=%2F joinmaybe<img img">, fjsimg" ")[0]MTopBType"newlyDanskczechtrailknows</h5>faq">zh-cn10);
+-1");type=bluestrulydavis.js';>
+<!steel you h2>
+form jesus100% menu.
+	
+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&quot;domaincommonstatuseventsmastersystemactionbannerremovescrollupdateglobalmediumfilternumberchangeresultpublicscreenchoosenormaltravelissuessourcetargetspringmodulemobileswitchphotosborderregionitselfsocialactivecolumnrecordfollowtitle>eitherlengthfamilyfriendlayoutauthorcreatereviewsummerserverplayedplayerexpandpolicyformatdoublepointsseriespersonlivingdesignmonthsforcesuniqueweightpeopleenergynaturesearchfigurehavingcustomoffsetletterwindowsubmitrendergroupsuploadhealthmethodvideosschoolfutureshadowdebatevaluesObjectothersrightsleaguechromesimplenoticesharedendingseasonreportonlinesquarebuttonimagesenablemovinglatestwinterFranceperiodstrongrepeatLondondetailformeddemandsecurepassedtoggleplacesdevicestaticcitiesstreamyellowattackstreetflighthiddeninfo">openedusefulvalleycausesleadersecretseconddamagesportsexceptratingsignedthingseffectfieldsstatesofficevisualeditorvolumeReportmuseummoviesparentaccessmostlymother" id="marketgroundchancesurveybeforesymbolmomentspeechmotioninsidematterCenterobjectexistsmiddleEuropegrowthlegacymannerenoughcareeransweroriginportalclientselectrandomclosedtopicscomingfatheroptionsimplyraisedescapechosenchurchdefinereasoncorneroutputmemoryiframepolicemodelsNumberduringoffersstyleskilledlistedcalledsilvermargindeletebetterbrowselimitsGlobalsinglewidgetcenterbudgetnowrapcreditclaimsenginesafetychoicespirit-stylespreadmakingneededrussiapleaseextentScriptbrokenallowschargedividefactormember-basedtheoryconfigaroundworkedhelpedChurchimpactshouldalwayslogo" bottomlist">){var prefixorangeHeader.push(couplegardenbridgelaunchReviewtakingvisionlittledatingButtonbeautythemesforgotSearchanchoralmostloadedChangereturnstringreloadMobileincomesupplySourceordersviewed&nbsp;courseAbout island<html cookiename="amazonmodernadvicein</a>: The dialoghousesBEGIN MexicostartscentreheightaddingIslandassetsEmpireSchooleffortdirectnearlymanualSelect.
+
+Onejoinedmenu">PhilipawardshandleimportOfficeregardskillsnationSportsdegreeweekly (e.g.behinddoctorloggedunited</b></beginsplantsassistartistissued300px|canadaagencyschemeremainBrazilsamplelogo">beyond-scaleacceptservedmarineFootercamera</h1>
+_form"leavesstress" />
+.gif" onloadloaderOxfordsistersurvivlistenfemaleDesignsize="appealtext">levelsthankshigherforcedanimalanyoneAfricaagreedrecentPeople<br />wonderpricesturned|| {};main">inlinesundaywrap">failedcensusminutebeaconquotes150px|estateremoteemail"linkedright;signalformal1.htmlsignupprincefloat:.png" forum.AccesspaperssoundsextendHeightsliderUTF-8"&amp; Before. WithstudioownersmanageprofitjQueryannualparamsboughtfamousgooglelongeri++) {israelsayingdecidehome">headerensurebranchpiecesblock;statedtop"><racingresize--&gt;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">
+* TheThoughseeingjerseyNews</verifyexpertinjurywidth=CookieSTART across_imagethreadnativepocketbox">
+System DavidcancertablesprovedApril reallydriveritem">more">boardscolorscampusfirst || [];media.guitarfinishwidth:showedOther .php" assumelayerswilsonstoresreliefswedenCustomeasily your String
+
+Whiltaylorclear:resortfrenchthough") + "<body>buyingbrandsMembername">oppingsector5px;">vspacepostermajor coffeemartinmaturehappen</nav>kansaslink">Images=falsewhile hspace0&amp; 
+
+In  powerPolski-colorjordanBottomStart -count2.htmlnews">01.jpgOnline-rightmillerseniorISBN 00,000 guidesvalue)ectionrepair.xml"  rights.html-blockregExp:hoverwithinvirginphones</tr>
using 
+	var >');
+	</td>
+</tr>
+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&quot;,journalprojectsurfaces&quot;expiresreviewsbalanceEnglishContentthroughPlease opinioncontactaverageprimaryvillageSpanishgallerydeclinemeetingmissionpopularqualitymeasuregeneralspeciessessionsectionwriterscounterinitialreportsfiguresmembersholdingdisputeearlierexpressdigitalpictureAnothermarriedtrafficleadingchangedcentralvictoryimages/reasonsstudiesfeaturelistingmust beschoolsVersionusuallyepisodeplayinggrowingobviousoverlaypresentactions</ul>
+wrapperalreadycertainrealitystorageanotherdesktopofferedpatternunusualDigitalcapitalWebsitefailureconnectreducedAndroiddecadesregular &amp; animalsreleaseAutomatgettingmethodsnothingPopularcaptionletterscapturesciencelicensechangesEngland=1&amp;History = new CentralupdatedSpecialNetworkrequirecommentwarningCollegetoolbarremainsbecauseelectedDeutschfinanceworkersquicklybetweenexactlysettingdiseaseSocietyweaponsexhibit&lt;!--Controlclassescoveredoutlineattacksdevices(windowpurposetitle="Mobile killingshowingItaliandroppedheavilyeffects-1']);
+confirmCurrentadvancesharingopeningdrawingbillionorderedGermanyrelated</form>includewhetherdefinedSciencecatalogArticlebuttonslargestuniformjourneysidebarChicagoholidayGeneralpassage,&quot;animatefeelingarrivedpassingnaturalroughly.
+
+The but notdensityBritainChineselack oftributeIreland" data-factorsreceivethat isLibraryhusbandin factaffairsCharlesradicalbroughtfindinglanding:lang="return leadersplannedpremiumpackageAmericaEdition]&quot;Messageneed tovalue="complexlookingstationbelievesmaller-mobilerecordswant tokind ofFirefoxyou aresimilarstudiedmaximumheadingrapidlyclimatekingdomemergedamountsfoundedpioneerformuladynastyhow to SupportrevenueeconomyResultsbrothersoldierlargelycalling.&quot;AccountEdward segmentRobert effortsPacificlearnedup withheight:we haveAngelesnations_searchappliedacquiremassivegranted: falsetreatedbiggestbenefitdrivingStudiesminimumperhapsmorningsellingis usedreversevariant role="missingachievepromotestudentsomeoneextremerestorebottom:evolvedall thesitemapenglishway to  AugustsymbolsCompanymattersmusicalagainstserving})();
+paymenttroubleconceptcompareparentsplayersregionsmonitor ''The winningexploreadaptedGalleryproduceabilityenhancecareers). The collectSearch ancientexistedfooter handlerprintedconsoleEasternexportswindowsChannelillegalneutralsuggest_headersigning.html">settledwesterncausing-webkitclaimedJusticechaptervictimsThomas mozillapromisepartieseditionoutside:false,hundredOlympic_buttonauthorsreachedchronicdemandssecondsprotectadoptedprepareneithergreatlygreateroverallimprovecommandspecialsearch.worshipfundingthoughthighestinsteadutilityquarterCulturetestingclearlyexposedBrowserliberal} catchProjectexamplehide();FloridaanswersallowedEmperordefenseseriousfreedomSeveral-buttonFurtherout of != nulltrainedDenmarkvoid(0)/all.jspreventRequestStephen
+
+When observe</h2>
+Modern provide" alt="borders.
+
+For 
+
+Many artistspoweredperformfictiontype ofmedicalticketsopposedCouncilwitnessjusticeGeorge Belgium...</a>twitternotablywaitingwarfare Other rankingphrasesmentionsurvivescholar</p>
+ Countryignoredloss ofjust asGeorgiastrange<head><stopped1']);
+islandsnotableborder:list ofcarried100,000</h3>
+ severalbecomesselect wedding00.htmlmonarchoff theteacherhighly biologylife ofor evenrise of&raquo;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(})();
+
+burningoperatedegreessource=Richardcloselyplasticentries</tr>
+color:#ul id="possessrollingphysicsfailingexecutecontestlink toDefault<br />
+: true,chartertourismclassicproceedexplain</h1>
+online.?xml vehelpingdiamonduse theairlineend -->).attr(readershosting#ffffffrealizeVincentsignals src="/ProductdespitediversetellingPublic held inJoseph theatreaffects<style>a largedoesn'tlater, ElementfaviconcreatorHungaryAirportsee theso thatMichaelSystemsPrograms, and  width=e&quot;tradingleft">
+personsGolden Affairsgrammarformingdestroyidea ofcase ofoldest this is.src = cartoonregistrCommonsMuslimsWhat isin manymarkingrevealsIndeed,equally/show_aoutdoorescape(Austriageneticsystem,In the sittingHe alsoIslandsAcademy
+		<!--Daniel bindingblock">imposedutilizeAbraham(except{width:putting).html(|| [];
+DATA[ *kitchenmountedactual dialectmainly _blank'installexpertsif(typeIt also&copy; ">Termsborn inOptionseasterntalkingconcerngained ongoingjustifycriticsfactoryits ownassaultinvitedlastinghis ownhref="/" rel="developconcertdiagramdollarsclusterphp?id=alcohol);})();using a><span>vesselsrevivalAddressamateurandroidallegedillnesswalkingcentersqualifymatchesunifiedextinctDefensedied in
+	<!-- customslinkingLittle Book ofeveningmin.js?are thekontakttoday's.html" target=wearingAll Rig;
+})();raising Also, crucialabout">declare-->
+<scfirefoxas muchappliesindex, s, but type = 
+
+<!--towardsRecordsPrivateForeignPremierchoicesVirtualreturnsCommentPoweredinline;povertychamberLiving volumesAnthonylogin" RelatedEconomyreachescuttinggravitylife inChapter-shadowNotable</td>
+ returnstadiumwidgetsvaryingtravelsheld bywho arework infacultyangularwho hadairporttown of
+
+Some 'click'chargeskeywordit willcity of(this);Andrew unique checkedor more300px; return;rsion="pluginswithin herselfStationFederalventurepublishsent totensionactresscome tofingersDuke ofpeople,exploitwhat isharmonya major":"httpin his menu">
+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>
+evidentbe usedkeyCodesixteenIslamic#000000entire widely active (typeofone cancolor =speakerextendsPhysicsterrain<tbody>funeralviewingmiddle cricketprophetshifteddoctorsRussell targetcompactalgebrasocial-bulk ofman and</td>
+ he left).val()false);logicalbankinghome tonaming Arizonacredits);
+});
+founderin turnCollinsbefore But thechargedTitle">CaptainspelledgoddessTag -->Adding:but wasRecent patientback in=false&Lincolnwe knowCounterJudaismscript altered']);
+  has theunclearEvent',both innot all
+
+<!-- placinghard to centersort ofclientsstreetsBernardassertstend tofantasydown inharbourFreedomjewelry/about..searchlegendsis mademodern only ononly toimage" linear painterand notrarely acronymdelivershorter00&amp;as manywidth="/* <![Ctitle =of the lowest picked escapeduses ofpeoples PublicMatthewtacticsdamagedway forlaws ofeasy to windowstrong  simple}catch(seventhinfoboxwent topaintedcitizenI don'tretreat. Some ww.");
+bombingmailto:made in. Many carries||{};wiwork ofsynonymdefeatsfavoredopticalpageTraunless sendingleft"><comScorAll thejQuery.touristClassicfalse" Wilhelmsuburbsgenuinebishops.split(global followsbody ofnominalContactsecularleft tochiefly-hidden-banner</li>
+
+. When in bothdismissExplorealways via thespañolwelfareruling arrangecaptainhis sonrule ofhe tookitself,=0&amp;(calledsamplesto makecom/pagMartin Kennedyacceptsfull ofhandledBesides//--></able totargetsessencehim to its by common.mineralto takeways tos.org/ladvisedpenaltysimple:if theyLettersa shortHerbertstrikes groups.lengthflightsoverlapslowly lesser social </p>
+		it intoranked rate oful>
+  attemptpair ofmake itKontaktAntoniohaving ratings activestreamstrapped").css(hostilelead tolittle groups,Picture-->
+
+ rows=" objectinverse<footerCustomV><\/scrsolvingChamberslaverywoundedwhereas!= 'undfor allpartly -right:Arabianbacked centuryunit ofmobile-Europe,is homerisk ofdesiredClintoncost ofage of become none ofp&quot;Middle ead')[0Criticsstudios>&copy;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(" />
+		here isencoded.  The balloondone by/commonbgcolorlaw of Indianaavoidedbut the2px 3pxjquery.after apolicy.men andfooter-= true;for usescreen.Indian image =family,http:// &nbsp;driverseternalsame asnoticedviewers})();
+ 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});
+  immensetime inset outsatisfyto finddown tolot of Playersin Junequantumnot thetime todistantFinnishsrc = (single help ofGerman law andlabeledforestscookingspace">header-well asStanleybridges/globalCroatia About [0];
+  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']);
+  marketwho is ("DOMComanagedone fortypeof Kingdomprofitsproposeto showcenter;made itdressedwere inmixtureprecisearisingsrc = 'make a securedBaptistvoting 
+		var March 2grew upClimate.removeskilledway the</head>face ofacting right">to workreduceshas haderectedshow();action=book ofan area== "htt<header
+<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&quot;px;">
+pushed abandonnumeralCertainIn thismore inor somename isand, incrownedISBN 0-createsOctobermay notcenter late inDefenceenactedwish tobroadlycoolingonload=it. TherecoverMembersheight assumes<html>
+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&amp;lasinglesthreatsintegertake onrefusedcalled =US&ampSee thenativesby thissystem.head of:hover,lesbiansurnameand allcommon/header__paramsHarvard/pixel.removalso longrole ofjointlyskyscraUnicodebr />
+AtlantanucleusCounty,purely count">easily build aonclicka givenpointerh&quot;events else {
+ditionsnow the, with man whoorg/Webone andcavalryHe diedseattle00,000 {windowhave toif(windand itssolely m&quot;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 >
+
+
+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">
+();" rea place\u003Caabout atr>
+		ccount gives a<SCRIPTRailwaythemes/toolboxById("xhumans,watchesin some if (wicoming formats Under but hashanded made bythan infear ofdenoted/iframeleft involtagein eacha&quot;base ofIn manyundergoregimesaction </p>
+<ustomVa;&gt;</importsor thatmostly &amp;re size="</a></ha classpassiveHost = WhetherfertileVarious=[];(fucameras/></td>acts asIn some>
+
+<!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: &quot;extendedpreviousSoftwarecustomerdecisionstrengthdetailedslightlyplanningtextareacurrencyeveryonestraighttransferpositiveproducedheritageshippingabsolutereceivedrelevantbutton" violenceanywherebenefitslaunchedrecentlyalliancefollowedmultiplebulletinincludedoccurredinternal$(this).republic><tr><tdcongressrecordedultimatesolution<ul id="discoverHome</a>websitesnetworksalthoughentirelymemorialmessagescontinueactive">somewhatvictoriaWestern  title="LocationcontractvisitorsDownloadwithout right">
+measureswidth = variableinvolvedvirginianormallyhappenedaccountsstandingnationalRegisterpreparedcontrolsaccuratebirthdaystrategyofficialgraphicscriminalpossiblyconsumerPersonalspeakingvalidateachieved.jpg" />machines</h2>
+  keywordsfriendlybrotherscombinedoriginalcomposedexpectedadequatepakistanfollow" valuable</label>relativebringingincreasegovernorplugins/List of Header">" name=" (&quot;graduate</head>
+commercemalaysiadirectormaintain;height:schedulechangingback to catholicpatternscolor: #greatestsuppliesreliable</ul>
+		<select citizensclothingwatching<li id="specificcarryingsentence<center>contrastthinkingcatch(e)southernMichael merchantcarouselpadding:interior.split("lizationOctober ){returnimproved--&gt;
+
+coveragechairman.png" />subjectsRichard whateverprobablyrecoverybaseballjudgmentconnect..css" /> websitereporteddefault"/></a>
+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&hellip;new Date" size="pageNamemiddle" " /></a>hidden">sequencepersonaloverflowopinionsillinoislinks">
+	<title>versionssaturdayterminalitempropengineersectionsdesignerproposal="false"Españolreleasessubmit" er&quot;additionsymptomsorientedresourceright"><pleasurestationshistory.leaving  border=contentscenter">.
+
+Some directedsuitablebulgaria.show();designedGeneral conceptsExampleswilliamsOriginal"><span>search">operatorrequestsa &quot;allowingDocumentrevision. 
+
+The yourselfContact michiganEnglish columbiapriorityprintingdrinkingfacilityreturnedContent officersRussian generate-8859-1"indicatefamiliar qualitymargin:0 contentviewportcontacts-title">portable.length eligibleinvolvesatlanticonload="default.suppliedpaymentsglossary
+
+After guidance</td><tdencodingmiddle">came to displaysscottishjonathanmajoritywidgets.clinicalthailandteachers<head>
+	affectedsupportspointer;toString</small>oklahomawill be investor0" alt="holidaysResourcelicensed (which . After considervisitingexplorerprimary search" android"quickly meetingsestimate;return ;color:# height=approval, &quot; checked.min.js"magnetic></a></hforecast. While thursdaydvertise&eacute;hasClassevaluateorderingexistingpatients Online coloradoOptions"campbell<!-- end</span><<br />
+_popups|sciences,&quot; quality Windows assignedheight: <b classle&quot; value=" Companyexamples<iframe believespresentsmarshallpart of properly).
+
+The taxonomymuch of </span>
+" data-srtuguêsscrollTo project<head>
+attorneyemphasissponsorsfancyboxworld's wildlifechecked=sessionsprogrammpx;font- Projectjournalsbelievedvacationthompsonlightingand the special border=0checking</tbody><button Completeclearfix
+<head>
+article <sectionfindingsrole in popular  Octoberwebsite exposureused to  changesoperatedclickingenteringcommandsinformed numbers  </div>creatingonSubmitmarylandcollegesanalyticlistingscontact.loggedInadvisorysiblingscontent"s&quot;)s. This packagescheckboxsuggestspregnanttomorrowspacing=icon.pngjapanesecodebasebutton">gamblingsuch as , while </span> missourisportingtop:1px .</span>tensionswidth="2lazyloadnovemberused in height="cript">
+&nbsp;</<tr><td height:2/productcountry include footer" &lt;!-- title"></jquery.</form>
+(简体)(繁體)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годаеслиестьбылобытьэтомЕслитогоменявсехэтойдажебылигодуденьэтотбыласебяодинсебенадосайтфотонегосвоисвойигрытожевсемсвоюлишьэтихпокаднейдомамиралиботемухотядвухсетилюдиделомиретебясвоевидечегоэтимсчеттемыценысталведьтемеводытебевышенамитипатомуправлицаоднагодызнаюмогудругвсейидеткиноодноделаделесрокиюнявесьЕстьразанашиاللهالتيجميعخاصةالذيعليهجديدالآنالردتحكمصفحةكانتاللييكونشبكةفيهابناتحواءأكثرخلالالحبدليلدروساضغطتكونهناكساحةناديالطبعليكشكرايمكنمنهاشركةرئيسنشيطماذاالفنشبابتعبررحمةكافةيقولمركزكلمةأحمدقلبييعنيصورةطريقشاركجوالأخرىمعناابحثعروضبشكلمسجلبنانخالدكتابكليةبدونأيضايوجدفريقكتبتأفضلمطبخاكثرباركافضلاحلىنفسهأيامردودأنهاديناالانمعرضتعلمداخلممكن





	
+


+	��������


��

��

resourcescountriesquestionsequipmentcommunityavailablehighlightDTD/xhtmlmarketingknowledgesomethingcontainerdirectionsubscribeadvertisecharacter" value="</select>Australia" class="situationauthorityfollowingprimarilyoperationchallengedevelopedanonymousfunction functionscompaniesstructureagreement" title="potentialeducationargumentssecondarycopyrightlanguagesexclusivecondition</form>
+statementattentionBiography} else {
+solutionswhen the Analyticstemplatesdangeroussatellitedocumentspublisherimportantprototypeinfluence&raquo;</effectivegenerallytransformbeautifultransportorganizedpublishedprominentuntil thethumbnailNational .focus();over the migrationannouncedfooter">
+exceptionless thanexpensiveformationframeworkterritoryndicationcurrentlyclassNamecriticismtraditionelsewhereAlexanderappointedmaterialsbroadcastmentionedaffiliate</option>treatmentdifferent/default.Presidentonclick="biographyotherwisepermanentFrançaisHollywoodexpansionstandards</style>
+reductionDecember preferredCambridgeopponentsBusiness confusion>
+<title>presentedexplaineddoes not worldwideinterfacepositionsnewspaper</table>
+mountainslike the essentialfinancialselectionaction="/abandonedEducationparseInt(stabilityunable to</title>
+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>
+suspectedmargin: 0spiritual</head>
+
+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>
+	sponsoreddocument.or &quot;there arethose whomovementsprocessesdifficultsubmittedrecommendconvincedpromoting" width=".replace(classicalcoalitionhis firstdecisionsassistantindicatedevolution-wrapper"enough toalong thedelivered-->
+<!--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 --&gt;
+
+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>
+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-->
+<!-- interviewWith the copies ofconsensuswas builtVenezuela(formerlythe statepersonnelstrategicfavour ofinventionWikipediacontinentvirtuallywhich wasprincipleComplete identicalshow thatprimitiveaway frommolecularpreciselydissolvedUnder theversion=">&nbsp;</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">
+residenceleave thecontent">are often  })();
+probably Professor-button" respondedsays thathad to beplaced inHungarianstatus ofserves asUniversalexecutionaggregatefor whichinfectionagreed tohowever, popular">placed onconstructelectoralsymbol ofincludingreturn toarchitectChristianprevious living ineasier toprofessor
+&lt;!-- effect ofanalyticswas takenwhere thetook overbelief inAfrikaansas far aspreventedwork witha special<fieldsetChristmasRetrieved
+
+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 &quot;engage inrecently,few yearswere also
+<head>
+<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>
+</a></td>depend onsearch">
+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.
+
+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
+<title>= window.determineer&quot; played byand early</center>from thisthe threepower andof &quot;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>
+Copyright javascriptconditionseverything<p class="technologybackground<a class="management&copy; 201javaScriptcharactersbreadcrumbthemselveshorizontalgovernmentCaliforniaactivitiesdiscoveredNavigationtransitionconnectionnavigationappearance</title><mcheckbox" techniquesprotectionapparentlyas well asunt', 'UA-resolutionoperationstelevisiontranslatedWashingtonnavigator. = window.impression&lt;br&gt;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">
+membershiplinguisticpx;paddingphilosophyassistanceuniversityfacilitiesrecognizedpreferenceif (typeofmaintainedvocabularyhypothesis.submit();&amp;nbsp;annotationbehind theFoundationpublisher"assumptionintroducedcorruptionscientistsexplicitlyinstead ofdimensions onClick="considereddepartmentoccupationsoon afterinvestmentpronouncedidentifiedexperimentManagementgeographic" height="link rel=".replace(/depressionconferencepunishmenteliminatedresistanceadaptationoppositionwell knownsupplementdeterminedh1 class="0px;marginmechanicalstatisticscelebratedGovernment
+
+During tdevelopersartificialequivalentoriginatedCommissionattachment<span id="there wereNederlandsbeyond theregisteredjournalistfrequentlyall of thelang="en" </style>
+absolute; supportingextremely mainstream</strong> popularityemployment</table>
+ colspan="</form>
+  conversionabout the </p></div>integrated" lang="enPortuguesesubstituteindividualimpossiblemultimediaalmost allpx solid #apart fromsubject toin Englishcriticizedexcept forguidelinesoriginallyremarkablethe secondh2 class="<a title="(includingparametersprohibited= "http://dictionaryperceptionrevolutionfoundationpx;height:successfulsupportersmillenniumhis fatherthe &quot;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>&nbsp;
+function it was theConventionautomobileProtestantaggressiveafter the Similarly," /></div>collection
+functionvisibilitythe use ofvolunteersattractionunder the threatened*<![CDATA[importancein generalthe latter</form>
+</.indexOf('i = 0; i <differencedevoted totraditionssearch forultimatelytournamentattributesso-called }
+</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>
+	diplomaticcontainingperformingextensionsmay not beconcept of onclick="It is alsofinancial making theLuxembourgadditionalare calledengaged in"script");but it waselectroniconsubmit="
+<!-- End electricalofficiallysuggestiontop of theunlike theAustralianOriginallyreferences
+</head>
+recognisedinitializelimited toAlexandriaretirementAdventuresfour years
+
+&lt;!-- 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
+<head>
+<mLaboratoryNovember 2exceptionsIndustrialvariety offloat: lefDuring theassessmenthave been deals withStatisticsoccurrence/ul></div>clearfix">the publicmany yearswhich wereover time,synonymouscontent">
+presumablyhis familyuserAgent.unexpectedincluding challengeda minorityundefined"belongs totaken fromin Octoberposition: said to bereligious Federation rowspan="only a fewmeant thatled to the-->
+<div <fieldset>Archbishop class="nobeing usedapproachesprivilegesnoscript>
+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>
+		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>
+percentagebest-knowncreating a" dir="ltrLieutenant
+<div id="they wouldability ofmade up ofnoted thatclear thatargue thatto anotherchildren'spurpose offormulatedbased uponthe regionsubject ofpassengerspossession.
+
+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&quot; 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->
+<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>
+ occasionalbecause itstarted tophysically></div>
+  created byCurrently, bgcolor="tabindex="disastrousAnalytics also has a><div id="</style>
+<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&amp;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
+
+However, compositionclear:both;cooperationwithin the label for="border-top:New Zealandrecommendedphotographyinteresting&lt;sup&gt;controversyNetherlandsalternativemaxlength="switzerlandDevelopmentessentially
+
+Although </textarea>thunderbirdrepresented&amp;ndash;speculationcommunitieslegislationelectronics
+	<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">
+<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
+<div id="the largestdeclarationregulationsInformationtranslationdocumentaryin order to">
+<head>
+<" 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>
+</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>
+ 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>
+having been
+<head>
+< &quot;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
+
+<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>
+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">
+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&amp;times;account foralign=rightthe companyalways beenreturned toinvolvementBecause thethis period" name="q" confined toa result ofvalue="" />is actuallyEnvironment
+</head>
+Conversely,>
+<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
+	</div>
+
+</script>faster thanmajority ofafter whichcomparativeto maintainimprove theawarded theer" class="frameborderrestorationin the sameanalysis oftheir firstDuring the continentalsequence offunction(){font-size: work on the</script>
+<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 &quot;the can be madewas able towhich meansbut did notonMouseOveras possibleoperated bycoming fromthe primaryaddition offor severaltransferreda period ofare able tohowever, itshould havemuch larger
+	</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>
+  they can beback to thesome of hisexposure toare similarform of theaddFavoritecitizenshippart in thepeople within practiceto continue&amp;minus;approved by the first allowed theand for thefunctioningplaying thesolution toheight="0" in his bookmore than afollows thecreated thepresence in&nbsp;</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&quot;may includethe world'scan lead torefers to aborder="0" government winning theresulted in while the Washington,the subjectcity in the></div>
+		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&quot;. 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>
+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[
+Organizationdistribution0px; height:relationshipdevice-width<div class="<label for="registration</noscript>
+/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="&lt;/sup&gt;dealing withphiladelphiahistorically);</script>
+padding-top:experimentalgetAttributeinstructionstechnologiespart of the =function(){subscriptionl.dtd">
+<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&lt;math&gt;presentationoccasionally<img width="navigation">compensationchampionshipmedia="all" violation ofreference toreturn true;Strict//EN" transactionsinterventionverificationInformation difficultiesChampionshipcapabilities<![endif]-->}
+</script>
+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,
+.nontouch observations</a>
+</div>
+f (document.border: 1px {font-size:1treatment of0" height="1modificationIndependencedivided intogreater thanachievementsestablishingJavaScript" neverthelesssignificanceBroadcasting>&nbsp;</td>container">
+such as the influence ofa particularsrc='http://navigation" half of the substantial &nbsp;</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
+		<a href="close to theexamples of is about the(see below)." id="searchprofessionalis availablethe official		</script>
+
+		<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>
+consider thean estimatedthe National<div id="pagresulting incommissionedanalogous toare required/ul>
+</div>
+was based onand became a&nbsp;&nbsp;t" value="" was capturedno more thanrespectivelycontinue to >
+<head>
+<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
+</script>
+
+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>
+thought thaton the basiscellpadding=image of thereturning toinformation,separated byassassinateds" content="authority ofnorthwestern</div>
+<div "></div>
+  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&lt;/math&gt;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>
+</div>
+philosophicallocation.hrefwas publishedSan Francisco(function(){
+<div id="mainsophisticatedmathematical /head>
+<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
+	<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&nbsp;|&nbsp;&nbsp;</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>
+<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]-->
+Institute of into a singlerespectively.and thereforeproperties ofis located insome of whichThere is alsocontinued to appearance of &amp;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=&quot;several timesrepresent thebody>
+</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 &amp;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&nbsp;&nbsp;<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
+<div class="input class="replaced withis one of theeducation andinfluenced byreputation as
+<meta name="accommodation</div>
+</div>large part ofInstitute forthe so-called against the In this case,was appointedclaimed to beHowever, thisDepartment ofthe remainingeffect on theparticularly deal with the
+<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;
+</script>
+<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]-->
+</><meta name="implementationinfrastructurerepresentationborder-bottom:</head>
+<body>=http%3A%2F%2F<form method="method="post" /favicon.ico" });
+</script>
+.setAttribute(Administration= new Array();<![endif]-->
+display:block;Unfortunately,">&nbsp;</div>/favicon.ico">='stylesheet' identification, for example,<li><a href="/an alternativeas a result ofpt"></script>
+type="submit" 
+(function() {recommendationform action="/transformationreconstruction.style.display According to hidden" name="along with thedocument.body.approximately Communicationspost" action="meaning &quot;--<![endif]-->Prime Ministercharacteristic</a> <a class=the history of onmouseover="the governmenthref="https://was originallywas introducedclassificationrepresentativeare considered<![endif]-->
+
+depends on theUniversity of in contrast to placeholder="in the case ofinternational constitutionalstyle="border-: function() {Because of the-strict.dtd">
+<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>
+</li>
+<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
+
+<div class="class="search-/body>
+</html>opportunity tocommunications</head>
+<body style="width:Tiếng Việtchanges in theborder-color:#0" border="0" </span></div><was discovered" type="text" );
+</script>
+
+Department of ecclesiasticalthere has beenresulting from</body></html>has never beenthe first timein response toautomatically </div>
+
+<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
+<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>
+<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
+	<div class="possibility ofsometimes usedappear to havesuccess of theintended to bepresent in thestyle="clear:b
+</script>
+<was founded ininterview with_id" content="capital of the
+<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
+</head>
+<bodylocated on theis referred to(including theconcentrationsthe individualamong the mostthan any other/>
+<link rel=" return false;the purpose ofthe ability to;color:#fff}
+.
+<span class="the subject ofdefinitions of>
+<link rel="claim that thehave developed<table width="celebration ofFollowing the to distinguish<span class="btakes place inunder the namenoted that the><![endif]-->
+style="margin-instead of theintroduced thethe process ofincreasing thedifferences inestimated thatespecially the/div><div id="was eventuallythroughout histhe differencesomething thatspan></span></significantly ></script>
+
+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>
+<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);
+</script>
+<philosophical srpskohrvatskitiếng ViệtРусскийрусскийinvestigaciónparticipaciónкоторыеобластикоторыйчеловексистемыНовостикоторыхобластьвременикотораясегодняскачатьновостиУкраинывопросыкоторойсделатьпомощьюсредствобразомстороныучастиетечениеГлавнаяисториисистемарешенияСкачатьпоэтомуследуетсказатьтоваровконечнорешениекотороеоргановкоторомРекламаالمنتدىمنتدياتالموضوعالبرامجالمواقعالرسائلمشاركاتالأعضاءالرياضةالتصميمالاعضاءالنتائجالألعابالتسجيلالأقسامالضغطاتالفيديوالترحيبالجديدةالتعليمالأخبارالافلامالأفلامالتاريخالتقنيةالالعابالخواطرالمجتمعالديكورالسياحةعبداللهالتربيةالروابطالأدبيةالاخبارالمتحدةالاغانيcursor:pointer;</title>
+<meta " href="http://"><span class="members of the window.locationvertical-align:/a> | <a href="<!doctype html>media="screen" <option value="favicon.ico" />
+		<div class="characteristics" method="get" /body>
+</html>
+shortcut icon" document.write(padding-bottom:representativessubmit" value="align="center" throughout the science fiction
+  <div class="submit" class="one of the most valign="top"><was established);
+</script>
+return false;">).style.displaybecause of the document.cookie<form action="/}body{margin:0;Encyclopedia ofversion of the .createElement(name" content="</div>
+</div>
+
+administrative </body>
+</html>history of the "><input type="portion of the as part of the &nbsp;<a href="other countries">
+<div class="</span></span><In other words,display: block;control of the introduction of/>
+<meta name="as well as the in recent years
+	<div class="</div>
+	</div>
+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 />
+<link rel="swas one of the until his death})();
+</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 &quot;a comprehensiveHistory of the were consideredreturned to theare referred toUnsourced image>
+	<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&amp;mdash; thethe applicationjs"></script>
+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>
+<" method="post" </span></a></li>vertical-align:t/jquery.min.js">.click(function( style="padding-})();
+</script>
+</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>
+</html>
+overflow:hidden;img src="http://addEventListenerresponsible for s.js"></script>
+/favicon.ico" />operating system" style="width:1target="_blank">State Universitytext-align:left;
+document.write(, including the around the world);
+</script>
+<" style="height:;overflow:hiddenmore informationan internationala member of the one of the firstcan be found in </div>
+		</div>
+display: none;">" />
+<link rel="
+  (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>
+	sByTagName(s)[0]js"></script>
+<.js"></script>
+link rel="icon" ' alt='' class='formation of theversions of the </a></div></div>/page>
+  <page>
+<div class="contbecame the firstbahasa Indonesiaenglish (simple)ΕλληνικάхрватскикомпанииявляетсяДобавитьчеловекаразвитияИнтернетОтветитьнапримеринтернеткоторогостраницыкачествеусловияхпроблемыполучитьявляютсянаиболеекомпаниявниманиесредстваالمواضيعالرئيسيةالانتقالمشاركاتكالسياراتالمكتوبةالسعوديةاحصائياتالعالميةالصوتياتالانترنتالتصاميمالإسلاميالمشاركةالمرئياتrobots" content="<div id="footer">the United States<img src="http://.jpg|right|thumb|.js"></script>
+<location.protocolframeborder="0" s" />
+<meta name="</a></div></div><font-weight:bold;&quot; and &quot;depending on the margin:0;padding:" rel="nofollow" President of the twentieth centuryevision>
+  </pageInternet Explorera.async = true;
+information about<div id="header">" action="http://<a href="https://<div id="content"</div>
+</div>
+<derived from the <img src='http://according to the 
+</body>
+</html>
+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">
+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>
+</div>
+
+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>
+</html>
Ελληνικά
+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">
+the InternationalAccording to the pe="text/css" />
+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>
+</html>
+<img src="http://s;text-align:centerfont-weight: bold; According to the difference between" frameborder="0" " style="position:link href="http://html4/loose.dtd">
+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>
+<&nbsp;&nbsp;&nbsp;"><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>
+</div>
+
+<a href="index.phpwas established inmin.js"></script>
+participate in thea strong influencestyle="margin-top:represented by thegraduated from theTraditionally, theElement("script");However, since the/div>
+</div>
+<div left; margin-left:protection against0; vertical-align:Unfortunately, thetype="image/x-icon/div>
+<div class=" class="clearfix"><div class="footer		</div>
+		</div>
+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://
+<script language="//EN" "http://www.wencodeURIComponent(" href="javascript:<div class="contentdocument.write('<scposition: absolute;script src="http:// style="margin-top:.min.js"></script>
+</div>
+<div class="w3.org/1999/xhtml" 
+
+</body>
+</html>distinction between/" target="_blank"><link href="http://encoding="utf-8"?>
+w.addEventListener?action="http://www.icon" href="http:// style="background:type="text/css" />
+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>
+
+<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:Български
+ type="text" name=">Privacy Policy</a>administered by theenableSingleRequeststyle=&quot;margin:</div></div></div><><img src="http://i style=&quot;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
+</script>
+<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:-->
+<script type="t<a href='http://www.hortcut icon" href="</div>
+<div class="<script src="http://" rel="stylesheet" t</div>
+<script type=/a> <a href="http:// allowTransparency="X-UA-Compatible" conrelationship between
+</script>
+<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
+<meta http-equiv="></span><span class="0" cellspacing="0">;
+</script>
+<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>
+<scriptthroughout the worldcommon misconceptionassociation with the</div>
+</div>
+<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
+</div>
+<div class="&amp;nbsp;&amp;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" />
+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>
+<li class="css" type="text/css" <form action="http://xt/css" href="http://link rel="alternate" 
+<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>
+</div>
+</div>
+establishment of the </div></div></div></d#viewport{min-height:
+<script src="http://option><option value=often referred to as /option>
+<option valu<!DOCTYPE html>
+<!--[International Airport>
+<a href="http://www</a><a href="http://wภาษาไทยქართული正體中文 (繁體)निर्देशडाउनलोडक्षेत्रजानकारीसंबंधितस्थापनास्वीकारसंस्करणसामग्रीचिट्ठोंविज्ञानअमेरिकाविभिन्नगाडियाँक्योंकिसुरक्षापहुँचतीप्रबंधनटिप्पणीक्रिकेटप्रारंभप्राप्तमालिकोंरफ़्तारनिर्माणलिमिटेडdescription" content="document.location.prot.getElementsByTagName(<!DOCTYPE html>
+<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>&nbsp;<span role="s
+<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" 
+body, tr, input, textmeta name="robots" conmethod="post" action=">
+<a href="http://www.css" rel="stylesheet" </div></div><div classlanguage="javascript">aria-hidden="true">·<ript" type="text/javasl=0;})();
+(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>
+<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" />
+link rel="shortcut icon<link rel="stylesheet" </script>
+<script type== document.createElemen<a target="_blank" href= document.getElementsBinput type="text" name=a.type = 'text/javascrinput type="hidden" namehtml; charset=utf-8" />dtd">
+<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">
+
+<style type="text/css">ional.dtd">
+<html xmlns=http-equiv="Content-Typeding="0" cellspacing="0"html; charset=utf-8" />
+ style="display:none;"><<li><a href="http://www. type='text/javascript'>деятельностисоответствиипроизводствабезопасностиपुस्तिकाकांग्रेसउन्होंनेविधानसभाफिक्सिंगसुरक्षितकॉपीराइटविज्ञापनकार्रवाईसक्रियता
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.bin.br b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.bin.br
new file mode 100644
index 0000000000..6a55d420a8
Binary files /dev/null and b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.bin.br differ
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.c
new file mode 100644
index 0000000000..7c015ab0ba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.c
@@ -0,0 +1,5916 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include "dictionary.h"
+#include "platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#if !defined(BROTLI_EXTERNAL_DICTIONARY_DATA)
+static const uint8_t kBrotliDictionaryData[] =
+/* GENERATED CODE START */
+{
+116,105,109,101,100,111,119,110,108,105,102,101,108,101,102,116,98,97,99,107,99,
+111,100,101,100,97,116,97,115,104,111,119,111,110,108,121,115,105,116,101,99,105
+,116,121,111,112,101,110,106,117,115,116,108,105,107,101,102,114,101,101,119,111
+,114,107,116,101,120,116,121,101,97,114,111,118,101,114,98,111,100,121,108,111,
+118,101,102,111,114,109,98,111,111,107,112,108,97,121,108,105,118,101,108,105,
+110,101,104,101,108,112,104,111,109,101,115,105,100,101,109,111,114,101,119,111,
+114,100,108,111,110,103,116,104,101,109,118,105,101,119,102,105,110,100,112,97,
+103,101,100,97,121,115,102,117,108,108,104,101,97,100,116,101,114,109,101,97,99,
+104,97,114,101,97,102,114,111,109,116,114,117,101,109,97,114,107,97,98,108,101,
+117,112,111,110,104,105,103,104,100,97,116,101,108,97,110,100,110,101,119,115,
+101,118,101,110,110,101,120,116,99,97,115,101,98,111,116,104,112,111,115,116,117
+,115,101,100,109,97,100,101,104,97,110,100,104,101,114,101,119,104,97,116,110,97
+,109,101,76,105,110,107,98,108,111,103,115,105,122,101,98,97,115,101,104,101,108
+,100,109,97,107,101,109,97,105,110,117,115,101,114,39,41,32,43,104,111,108,100,
+101,110,100,115,119,105,116,104,78,101,119,115,114,101,97,100,119,101,114,101,
+115,105,103,110,116,97,107,101,104,97,118,101,103,97,109,101,115,101,101,110,99,
+97,108,108,112,97,116,104,119,101,108,108,112,108,117,115,109,101,110,117,102,
+105,108,109,112,97,114,116,106,111,105,110,116,104,105,115,108,105,115,116,103,
+111,111,100,110,101,101,100,119,97,121,115,119,101,115,116,106,111,98,115,109,
+105,110,100,97,108,115,111,108,111,103,111,114,105,99,104,117,115,101,115,108,97
+,115,116,116,101,97,109,97,114,109,121,102,111,111,100,107,105,110,103,119,105,
+108,108,101,97,115,116,119,97,114,100,98,101,115,116,102,105,114,101,80,97,103,
+101,107,110,111,119,97,119,97,121,46,112,110,103,109,111,118,101,116,104,97,110,
+108,111,97,100,103,105,118,101,115,101,108,102,110,111,116,101,109,117,99,104,
+102,101,101,100,109,97,110,121,114,111,99,107,105,99,111,110,111,110,99,101,108,
+111,111,107,104,105,100,101,100,105,101,100,72,111,109,101,114,117,108,101,104,
+111,115,116,97,106,97,120,105,110,102,111,99,108,117,98,108,97,119,115,108,101,
+115,115,104,97,108,102,115,111,109,101,115,117,99,104,122,111,110,101,49,48,48,
+37,111,110,101,115,99,97,114,101,84,105,109,101,114,97,99,101,98,108,117,101,102
+,111,117,114,119,101,101,107,102,97,99,101,104,111,112,101,103,97,118,101,104,97
+,114,100,108,111,115,116,119,104,101,110,112,97,114,107,107,101,112,116,112,97,
+115,115,115,104,105,112,114,111,111,109,72,84,77,76,112,108,97,110,84,121,112,
+101,100,111,110,101,115,97,118,101,107,101,101,112,102,108,97,103,108,105,110,
+107,115,111,108,100,102,105,118,101,116,111,111,107,114,97,116,101,116,111,119,
+110,106,117,109,112,116,104,117,115,100,97,114,107,99,97,114,100,102,105,108,101
+,102,101,97,114,115,116,97,121,107,105,108,108,116,104,97,116,102,97,108,108,97,
+117,116,111,101,118,101,114,46,99,111,109,116,97,108,107,115,104,111,112,118,111
+,116,101,100,101,101,112,109,111,100,101,114,101,115,116,116,117,114,110,98,111,
+114,110,98,97,110,100,102,101,108,108,114,111,115,101,117,114,108,40,115,107,105
+,110,114,111,108,101,99,111,109,101,97,99,116,115,97,103,101,115,109,101,101,116
+,103,111,108,100,46,106,112,103,105,116,101,109,118,97,114,121,102,101,108,116,
+116,104,101,110,115,101,110,100,100,114,111,112,86,105,101,119,99,111,112,121,49
+,46,48,34,60,47,97,62,115,116,111,112,101,108,115,101,108,105,101,115,116,111,
+117,114,112,97,99,107,46,103,105,102,112,97,115,116,99,115,115,63,103,114,97,121
+,109,101,97,110,38,103,116,59,114,105,100,101,115,104,111,116,108,97,116,101,115
+,97,105,100,114,111,97,100,118,97,114,32,102,101,101,108,106,111,104,110,114,105
+,99,107,112,111,114,116,102,97,115,116,39,85,65,45,100,101,97,100,60,47,98,62,
+112,111,111,114,98,105,108,108,116,121,112,101,85,46,83,46,119,111,111,100,109,
+117,115,116,50,112,120,59,73,110,102,111,114,97,110,107,119,105,100,101,119,97,
+110,116,119,97,108,108,108,101,97,100,91,48,93,59,112,97,117,108,119,97,118,101,
+115,117,114,101,36,40,39,35,119,97,105,116,109,97,115,115,97,114,109,115,103,111
+,101,115,103,97,105,110,108,97,110,103,112,97,105,100,33,45,45,32,108,111,99,107
+,117,110,105,116,114,111,111,116,119,97,108,107,102,105,114,109,119,105,102,101,
+120,109,108,34,115,111,110,103,116,101,115,116,50,48,112,120,107,105,110,100,114
+,111,119,115,116,111,111,108,102,111,110,116,109,97,105,108,115,97,102,101,115,
+116,97,114,109,97,112,115,99,111,114,101,114,97,105,110,102,108,111,119,98,97,98
+,121,115,112,97,110,115,97,121,115,52,112,120,59,54,112,120,59,97,114,116,115,
+102,111,111,116,114,101,97,108,119,105,107,105,104,101,97,116,115,116,101,112,
+116,114,105,112,111,114,103,47,108,97,107,101,119,101,97,107,116,111,108,100,70,
+111,114,109,99,97,115,116,102,97,110,115,98,97,110,107,118,101,114,121,114,117,
+110,115,106,117,108,121,116,97,115,107,49,112,120,59,103,111,97,108,103,114,101,
+119,115,108,111,119,101,100,103,101,105,100,61,34,115,101,116,115,53,112,120,59,
+46,106,115,63,52,48,112,120,105,102,32,40,115,111,111,110,115,101,97,116,110,111
+,110,101,116,117,98,101,122,101,114,111,115,101,110,116,114,101,101,100,102,97,
+99,116,105,110,116,111,103,105,102,116,104,97,114,109,49,56,112,120,99,97,109,
+101,104,105,108,108,98,111,108,100,122,111,111,109,118,111,105,100,101,97,115,
+121,114,105,110,103,102,105,108,108,112,101,97,107,105,110,105,116,99,111,115,
+116,51,112,120,59,106,97,99,107,116,97,103,115,98,105,116,115,114,111,108,108,
+101,100,105,116,107,110,101,119,110,101,97,114,60,33,45,45,103,114,111,119,74,83
+,79,78,100,117,116,121,78,97,109,101,115,97,108,101,121,111,117,32,108,111,116,
+115,112,97,105,110,106,97,122,122,99,111,108,100,101,121,101,115,102,105,115,104
+,119,119,119,46,114,105,115,107,116,97,98,115,112,114,101,118,49,48,112,120,114,
+105,115,101,50,53,112,120,66,108,117,101,100,105,110,103,51,48,48,44,98,97,108,
+108,102,111,114,100,101,97,114,110,119,105,108,100,98,111,120,46,102,97,105,114,
+108,97,99,107,118,101,114,115,112,97,105,114,106,117,110,101,116,101,99,104,105,
+102,40,33,112,105,99,107,101,118,105,108,36,40,34,35,119,97,114,109,108,111,114,
+100,100,111,101,115,112,117,108,108,44,48,48,48,105,100,101,97,100,114,97,119,
+104,117,103,101,115,112,111,116,102,117,110,100,98,117,114,110,104,114,101,102,
+99,101,108,108,107,101,121,115,116,105,99,107,104,111,117,114,108,111,115,115,
+102,117,101,108,49,50,112,120,115,117,105,116,100,101,97,108,82,83,83,34,97,103,
+101,100,103,114,101,121,71,69,84,34,101,97,115,101,97,105,109,115,103,105,114,
+108,97,105,100,115,56,112,120,59,110,97,118,121,103,114,105,100,116,105,112,115,
+35,57,57,57,119,97,114,115,108,97,100,121,99,97,114,115,41,59,32,125,112,104,112
+,63,104,101,108,108,116,97,108,108,119,104,111,109,122,104,58,229,42,47,13,10,32
+,49,48,48,104,97,108,108,46,10,10,65,55,112,120,59,112,117,115,104,99,104,97,116
+,48,112,120,59,99,114,101,119,42,47,60,47,104,97,115,104,55,53,112,120,102,108,
+97,116,114,97,114,101,32,38,38,32,116,101,108,108,99,97,109,112,111,110,116,111,
+108,97,105,100,109,105,115,115,115,107,105,112,116,101,110,116,102,105,110,101,
+109,97,108,101,103,101,116,115,112,108,111,116,52,48,48,44,13,10,13,10,99,111,
+111,108,102,101,101,116,46,112,104,112,60,98,114,62,101,114,105,99,109,111,115,
+116,103,117,105,100,98,101,108,108,100,101,115,99,104,97,105,114,109,97,116,104,
+97,116,111,109,47,105,109,103,38,35,56,50,108,117,99,107,99,101,110,116,48,48,48
+,59,116,105,110,121,103,111,110,101,104,116,109,108,115,101,108,108,100,114,117,
+103,70,82,69,69,110,111,100,101,110,105,99,107,63,105,100,61,108,111,115,101,110
+,117,108,108,118,97,115,116,119,105,110,100,82,83,83,32,119,101,97,114,114,101,
+108,121,98,101,101,110,115,97,109,101,100,117,107,101,110,97,115,97,99,97,112,
+101,119,105,115,104,103,117,108,102,84,50,51,58,104,105,116,115,115,108,111,116,
+103,97,116,101,107,105,99,107,98,108,117,114,116,104,101,121,49,53,112,120,39,39
+,41,59,41,59,34,62,109,115,105,101,119,105,110,115,98,105,114,100,115,111,114,
+116,98,101,116,97,115,101,101,107,84,49,56,58,111,114,100,115,116,114,101,101,
+109,97,108,108,54,48,112,120,102,97,114,109,226,128,153,115,98,111,121,115,91,48
+,93,46,39,41,59,34,80,79,83,84,98,101,97,114,107,105,100,115,41,59,125,125,109,
+97,114,121,116,101,110,100,40,85,75,41,113,117,97,100,122,104,58,230,45,115,105,
+122,45,45,45,45,112,114,111,112,39,41,59,13,108,105,102,116,84,49,57,58,118,105,
+99,101,97,110,100,121,100,101,98,116,62,82,83,83,112,111,111,108,110,101,99,107,
+98,108,111,119,84,49,54,58,100,111,111,114,101,118,97,108,84,49,55,58,108,101,
+116,115,102,97,105,108,111,114,97,108,112,111,108,108,110,111,118,97,99,111,108,
+115,103,101,110,101,32,226,128,148,115,111,102,116,114,111,109,101,116,105,108,
+108,114,111,115,115,60,104,51,62,112,111,117,114,102,97,100,101,112,105,110,107,
+60,116,114,62,109,105,110,105,41,124,33,40,109,105,110,101,122,104,58,232,98,97,
+114,115,104,101,97,114,48,48,41,59,109,105,108,107,32,45,45,62,105,114,111,110,
+102,114,101,100,100,105,115,107,119,101,110,116,115,111,105,108,112,117,116,115,
+47,106,115,47,104,111,108,121,84,50,50,58,73,83,66,78,84,50,48,58,97,100,97,109,
+115,101,101,115,60,104,50,62,106,115,111,110,39,44,32,39,99,111,110,116,84,50,49
+,58,32,82,83,83,108,111,111,112,97,115,105,97,109,111,111,110,60,47,112,62,115,
+111,117,108,76,73,78,69,102,111,114,116,99,97,114,116,84,49,52,58,60,104,49,62,
+56,48,112,120,33,45,45,60,57,112,120,59,84,48,52,58,109,105,107,101,58,52,54,90,
+110,105,99,101,105,110,99,104,89,111,114,107,114,105,99,101,122,104,58,228,39,41
+,41,59,112,117,114,101,109,97,103,101,112,97,114,97,116,111,110,101,98,111,110,
+100,58,51,55,90,95,111,102,95,39,93,41,59,48,48,48,44,122,104,58,231,116,97,110,
+107,121,97,114,100,98,111,119,108,98,117,115,104,58,53,54,90,74,97,118,97,51,48,
+112,120,10,124,125,10,37,67,51,37,58,51,52,90,106,101,102,102,69,88,80,73,99,97,
+115,104,118,105,115,97,103,111,108,102,115,110,111,119,122,104,58,233,113,117,
+101,114,46,99,115,115,115,105,99,107,109,101,97,116,109,105,110,46,98,105,110,
+100,100,101,108,108,104,105,114,101,112,105,99,115,114,101,110,116,58,51,54,90,
+72,84,84,80,45,50,48,49,102,111,116,111,119,111,108,102,69,78,68,32,120,98,111,
+120,58,53,52,90,66,79,68,89,100,105,99,107,59,10,125,10,101,120,105,116,58,51,53
+,90,118,97,114,115,98,101,97,116,39,125,41,59,100,105,101,116,57,57,57,59,97,110
+,110,101,125,125,60,47,91,105,93,46,76,97,110,103,107,109,194,178,119,105,114,
+101,116,111,121,115,97,100,100,115,115,101,97,108,97,108,101,120,59,10,9,125,101
+,99,104,111,110,105,110,101,46,111,114,103,48,48,53,41,116,111,110,121,106,101,
+119,115,115,97,110,100,108,101,103,115,114,111,111,102,48,48,48,41,32,50,48,48,
+119,105,110,101,103,101,97,114,100,111,103,115,98,111,111,116,103,97,114,121,99,
+117,116,115,116,121,108,101,116,101,109,112,116,105,111,110,46,120,109,108,99,
+111,99,107,103,97,110,103,36,40,39,46,53,48,112,120,80,104,46,68,109,105,115,99,
+97,108,97,110,108,111,97,110,100,101,115,107,109,105,108,101,114,121,97,110,117,
+110,105,120,100,105,115,99,41,59,125,10,100,117,115,116,99,108,105,112,41,46,10,
+10,55,48,112,120,45,50,48,48,68,86,68,115,55,93,62,60,116,97,112,101,100,101,109
+,111,105,43,43,41,119,97,103,101,101,117,114,111,112,104,105,108,111,112,116,115
+,104,111,108,101,70,65,81,115,97,115,105,110,45,50,54,84,108,97,98,115,112,101,
+116,115,85,82,76,32,98,117,108,107,99,111,111,107,59,125,13,10,72,69,65,68,91,48
+,93,41,97,98,98,114,106,117,97,110,40,49,57,56,108,101,115,104,116,119,105,110,
+60,47,105,62,115,111,110,121,103,117,121,115,102,117,99,107,112,105,112,101,124,
+45,10,33,48,48,50,41,110,100,111,119,91,49,93,59,91,93,59,10,76,111,103,32,115,
+97,108,116,13,10,9,9,98,97,110,103,116,114,105,109,98,97,116,104,41,123,13,10,48
+,48,112,120,10,125,41,59,107,111,58,236,102,101,101,115,97,100,62,13,115,58,47,
+47,32,91,93,59,116,111,108,108,112,108,117,103,40,41,123,10,123,13,10,32,46,106,
+115,39,50,48,48,112,100,117,97,108,98,111,97,116,46,74,80,71,41,59,10,125,113,
+117,111,116,41,59,10,10,39,41,59,10,13,10,125,13,50,48,49,52,50,48,49,53,50,48,
+49,54,50,48,49,55,50,48,49,56,50,48,49,57,50,48,50,48,50,48,50,49,50,48,50,50,50
+,48,50,51,50,48,50,52,50,48,50,53,50,48,50,54,50,48,50,55,50,48,50,56,50,48,50,
+57,50,48,51,48,50,48,51,49,50,48,51,50,50,48,51,51,50,48,51,52,50,48,51,53,50,48
+,51,54,50,48,51,55,50,48,49,51,50,48,49,50,50,48,49,49,50,48,49,48,50,48,48,57,
+50,48,48,56,50,48,48,55,50,48,48,54,50,48,48,53,50,48,48,52,50,48,48,51,50,48,48
+,50,50,48,48,49,50,48,48,48,49,57,57,57,49,57,57,56,49,57,57,55,49,57,57,54,49,
+57,57,53,49,57,57,52,49,57,57,51,49,57,57,50,49,57,57,49,49,57,57,48,49,57,56,57
+,49,57,56,56,49,57,56,55,49,57,56,54,49,57,56,53,49,57,56,52,49,57,56,51,49,57,
+56,50,49,57,56,49,49,57,56,48,49,57,55,57,49,57,55,56,49,57,55,55,49,57,55,54,49
+,57,55,53,49,57,55,52,49,57,55,51,49,57,55,50,49,57,55,49,49,57,55,48,49,57,54,
+57,49,57,54,56,49,57,54,55,49,57,54,54,49,57,54,53,49,57,54,52,49,57,54,51,49,57
+,54,50,49,57,54,49,49,57,54,48,49,57,53,57,49,57,53,56,49,57,53,55,49,57,53,54,
+49,57,53,53,49,57,53,52,49,57,53,51,49,57,53,50,49,57,53,49,49,57,53,48,49,48,48
+,48,49,48,50,52,49,51,57,52,48,48,48,48,57,57,57,57,99,111,109,111,109,195,161,
+115,101,115,116,101,101,115,116,97,112,101,114,111,116,111,100,111,104,97,99,101
+,99,97,100,97,97,195,177,111,98,105,101,110,100,195,173,97,97,115,195,173,118,
+105,100,97,99,97,115,111,111,116,114,111,102,111,114,111,115,111,108,111,111,116
+,114,97,99,117,97,108,100,105,106,111,115,105,100,111,103,114,97,110,116,105,112
+,111,116,101,109,97,100,101,98,101,97,108,103,111,113,117,195,169,101,115,116,
+111,110,97,100,97,116,114,101,115,112,111,99,111,99,97,115,97,98,97,106,111,116,
+111,100,97,115,105,110,111,97,103,117,97,112,117,101,115,117,110,111,115,97,110,
+116,101,100,105,99,101,108,117,105,115,101,108,108,97,109,97,121,111,122,111,110
+,97,97,109,111,114,112,105,115,111,111,98,114,97,99,108,105,99,101,108,108,111,
+100,105,111,115,104,111,114,97,99,97,115,105,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,180,102,105,114,115,116,118,105,100,101
+,111,108,105,103,104,116,119,111,114,108,100,109,101,100,105,97,119,104,105,116,
+101,99,108,111,115,101,98,108,97,99,107,114,105,103,104,116,115,109,97,108,108,
+98,111,111,107,115,112,108,97,99,101,109,117,115,105,99,102,105,101,108,100,111,
+114,100,101,114,112,111,105,110,116,118,97,108,117,101,108,101,118,101,108,116,
+97,98,108,101,98,111,97,114,100,104,111,117,115,101,103,114,111,117,112,119,111,
+114,107,115,121,101,97,114,115,115,116,97,116,101,116,111,100,97,121,119,97,116,
+101,114,115,116,97,114,116,115,116,121,108,101,100,101,97,116,104,112,111,119,
+101,114,112,104,111,110,101,110,105,103,104,116,101,114,114,111,114,105,110,112,
+117,116,97,98,111,117,116,116,101,114,109,115,116,105,116,108,101,116,111,111,
+108,115,101,118,101,110,116,108,111,99,97,108,116,105,109,101,115,108,97,114,103
+,101,119,111,114,100,115,103,97,109,101,115,115,104,111,114,116,115,112,97,99,
+101,102,111,99,117,115,99,108,101,97,114,109,111,100,101,108,98,108,111,99,107,
+103,117,105,100,101,114,97,100,105,111,115,104,97,114,101,119,111,109,101,110,97
+,103,97,105,110,109,111,110,101,121,105,109,97,103,101,110,97,109,101,115,121,
+111,117,110,103,108,105,110,101,115,108,97,116,101,114,99,111,108,111,114,103,
+114,101,101,110,102,114,111,110,116,38,97,109,112,59,119,97,116,99,104,102,111,
+114,99,101,112,114,105,99,101,114,117,108,101,115,98,101,103,105,110,97,102,116,
+101,114,118,105,115,105,116,105,115,115,117,101,97,114,101,97,115,98,101,108,111
+,119,105,110,100,101,120,116,111,116,97,108,104,111,117,114,115,108,97,98,101,
+108,112,114,105,110,116,112,114,101,115,115,98,117,105,108,116,108,105,110,107,
+115,115,112,101,101,100,115,116,117,100,121,116,114,97,100,101,102,111,117,110,
+100,115,101,110,115,101,117,110,100,101,114,115,104,111,119,110,102,111,114,109,
+115,114,97,110,103,101,97,100,100,101,100,115,116,105,108,108,109,111,118,101,
+100,116,97,107,101,110,97,98,111,118,101,102,108,97,115,104,102,105,120,101,100,
+111,102,116,101,110,111,116,104,101,114,118,105,101,119,115,99,104,101,99,107,
+108,101,103,97,108,114,105,118,101,114,105,116,101,109,115,113,117,105,99,107,
+115,104,97,112,101,104,117,109,97,110,101,120,105,115,116,103,111,105,110,103,
+109,111,118,105,101,116,104,105,114,100,98,97,115,105,99,112,101,97,99,101,115,
+116,97,103,101,119,105,100,116,104,108,111,103,105,110,105,100,101,97,115,119,
+114,111,116,101,112,97,103,101,115,117,115,101,114,115,100,114,105,118,101,115,
+116,111,114,101,98,114,101,97,107,115,111,117,116,104,118,111,105,99,101,115,105
+,116,101,115,109,111,110,116,104,119,104,101,114,101,98,117,105,108,100,119,104,
+105,99,104,101,97,114,116,104,102,111,114,117,109,116,104,114,101,101,115,112,
+111,114,116,112,97,114,116,121,67,108,105,99,107,108,111,119,101,114,108,105,118
+,101,115,99,108,97,115,115,108,97,121,101,114,101,110,116,114,121,115,116,111,
+114,121,117,115,97,103,101,115,111,117,110,100,99,111,117,114,116,121,111,117,
+114,32,98,105,114,116,104,112,111,112,117,112,116,121,112,101,115,97,112,112,108
+,121,73,109,97,103,101,98,101,105,110,103,117,112,112,101,114,110,111,116,101,
+115,101,118,101,114,121,115,104,111,119,115,109,101,97,110,115,101,120,116,114,
+97,109,97,116,99,104,116,114,97,99,107,107,110,111,119,110,101,97,114,108,121,98
+,101,103,97,110,115,117,112,101,114,112,97,112,101,114,110,111,114,116,104,108,
+101,97,114,110,103,105,118,101,110,110,97,109,101,100,101,110,100,101,100,84,101
+,114,109,115,112,97,114,116,115,71,114,111,117,112,98,114,97,110,100,117,115,105
+,110,103,119,111,109,97,110,102,97,108,115,101,114,101,97,100,121,97,117,100,105
+,111,116,97,107,101,115,119,104,105,108,101,46,99,111,109,47,108,105,118,101,100
+,99,97,115,101,115,100,97,105,108,121,99,104,105,108,100,103,114,101,97,116,106,
+117,100,103,101,116,104,111,115,101,117,110,105,116,115,110,101,118,101,114,98,
+114,111,97,100,99,111,97,115,116,99,111,118,101,114,97,112,112,108,101,102,105,
+108,101,115,99,121,99,108,101,115,99,101,110,101,112,108,97,110,115,99,108,105,
+99,107,119,114,105,116,101,113,117,101,101,110,112,105,101,99,101,101,109,97,105
+,108,102,114,97,109,101,111,108,100,101,114,112,104,111,116,111,108,105,109,105,
+116,99,97,99,104,101,99,105,118,105,108,115,99,97,108,101,101,110,116,101,114,
+116,104,101,109,101,116,104,101,114,101,116,111,117,99,104,98,111,117,110,100,
+114,111,121,97,108,97,115,107,101,100,119,104,111,108,101,115,105,110,99,101,115
+,116,111,99,107,32,110,97,109,101,102,97,105,116,104,104,101,97,114,116,101,109,
+112,116,121,111,102,102,101,114,115,99,111,112,101,111,119,110,101,100,109,105,
+103,104,116,97,108,98,117,109,116,104,105,110,107,98,108,111,111,100,97,114,114,
+97,121,109,97,106,111,114,116,114,117,115,116,99,97,110,111,110,117,110,105,111,
+110,99,111,117,110,116,118,97,108,105,100,115,116,111,110,101,83,116,121,108,101
+,76,111,103,105,110,104,97,112,112,121,111,99,99,117,114,108,101,102,116,58,102,
+114,101,115,104,113,117,105,116,101,102,105,108,109,115,103,114,97,100,101,110,
+101,101,100,115,117,114,98,97,110,102,105,103,104,116,98,97,115,105,115,104,111,
+118,101,114,97,117,116,111,59,114,111,117,116,101,46,104,116,109,108,109,105,120
+,101,100,102,105,110,97,108,89,111,117,114,32,115,108,105,100,101,116,111,112,
+105,99,98,114,111,119,110,97,108,111,110,101,100,114,97,119,110,115,112,108,105,
+116,114,101,97,99,104,82,105,103,104,116,100,97,116,101,115,109,97,114,99,104,
+113,117,111,116,101,103,111,111,100,115,76,105,110,107,115,100,111,117,98,116,97
+,115,121,110,99,116,104,117,109,98,97,108,108,111,119,99,104,105,101,102,121,111
+,117,116,104,110,111,118,101,108,49,48,112,120,59,115,101,114,118,101,117,110,
+116,105,108,104,97,110,100,115,67,104,101,99,107,83,112,97,99,101,113,117,101,
+114,121,106,97,109,101,115,101,113,117,97,108,116,119,105,99,101,48,44,48,48,48,
+83,116,97,114,116,112,97,110,101,108,115,111,110,103,115,114,111,117,110,100,101
+,105,103,104,116,115,104,105,102,116,119,111,114,116,104,112,111,115,116,115,108
+,101,97,100,115,119,101,101,107,115,97,118,111,105,100,116,104,101,115,101,109,
+105,108,101,115,112,108,97,110,101,115,109,97,114,116,97,108,112,104,97,112,108,
+97,110,116,109,97,114,107,115,114,97,116,101,115,112,108,97,121,115,99,108,97,
+105,109,115,97,108,101,115,116,101,120,116,115,115,116,97,114,115,119,114,111,
+110,103,60,47,104,51,62,116,104,105,110,103,46,111,114,103,47,109,117,108,116,
+105,104,101,97,114,100,80,111,119,101,114,115,116,97,110,100,116,111,107,101,110
+,115,111,108,105,100,40,116,104,105,115,98,114,105,110,103,115,104,105,112,115,
+115,116,97,102,102,116,114,105,101,100,99,97,108,108,115,102,117,108,108,121,102
+,97,99,116,115,97,103,101,110,116,84,104,105,115,32,47,47,45,45,62,97,100,109,
+105,110,101,103,121,112,116,69,118,101,110,116,49,53,112,120,59,69,109,97,105,
+108,116,114,117,101,34,99,114,111,115,115,115,112,101,110,116,98,108,111,103,115
+,98,111,120,34,62,110,111,116,101,100,108,101,97,118,101,99,104,105,110,97,115,
+105,122,101,115,103,117,101,115,116,60,47,104,52,62,114,111,98,111,116,104,101,
+97,118,121,116,114,117,101,44,115,101,118,101,110,103,114,97,110,100,99,114,105,
+109,101,115,105,103,110,115,97,119,97,114,101,100,97,110,99,101,112,104,97,115,
+101,62,60,33,45,45,101,110,95,85,83,38,35,51,57,59,50,48,48,112,120,95,110,97,
+109,101,108,97,116,105,110,101,110,106,111,121,97,106,97,120,46,97,116,105,111,
+110,115,109,105,116,104,85,46,83,46,32,104,111,108,100,115,112,101,116,101,114,
+105,110,100,105,97,110,97,118,34,62,99,104,97,105,110,115,99,111,114,101,99,111,
+109,101,115,100,111,105,110,103,112,114,105,111,114,83,104,97,114,101,49,57,57,
+48,115,114,111,109,97,110,108,105,115,116,115,106,97,112,97,110,102,97,108,108,
+115,116,114,105,97,108,111,119,110,101,114,97,103,114,101,101,60,47,104,50,62,97
+,98,117,115,101,97,108,101,114,116,111,112,101,114,97,34,45,47,47,87,99,97,114,
+100,115,104,105,108,108,115,116,101,97,109,115,80,104,111,116,111,116,114,117,
+116,104,99,108,101,97,110,46,112,104,112,63,115,97,105,110,116,109,101,116,97,
+108,108,111,117,105,115,109,101,97,110,116,112,114,111,111,102,98,114,105,101,
+102,114,111,119,34,62,103,101,110,114,101,116,114,117,99,107,108,111,111,107,115
+,86,97,108,117,101,70,114,97,109,101,46,110,101,116,47,45,45,62,10,60,116,114,
+121,32,123,10,118,97,114,32,109,97,107,101,115,99,111,115,116,115,112,108,97,105
+,110,97,100,117,108,116,113,117,101,115,116,116,114,97,105,110,108,97,98,111,114
+,104,101,108,112,115,99,97,117,115,101,109,97,103,105,99,109,111,116,111,114,116
+,104,101,105,114,50,53,48,112,120,108,101,97,115,116,115,116,101,112,115,67,111,
+117,110,116,99,111,117,108,100,103,108,97,115,115,115,105,100,101,115,102,117,
+110,100,115,104,111,116,101,108,97,119,97,114,100,109,111,117,116,104,109,111,
+118,101,115,112,97,114,105,115,103,105,118,101,115,100,117,116,99,104,116,101,
+120,97,115,102,114,117,105,116,110,117,108,108,44,124,124,91,93,59,116,111,112,
+34,62,10,60,33,45,45,80,79,83,84,34,111,99,101,97,110,60,98,114,47,62,102,108,
+111,111,114,115,112,101,97,107,100,101,112,116,104,32,115,105,122,101,98,97,110,
+107,115,99,97,116,99,104,99,104,97,114,116,50,48,112,120,59,97,108,105,103,110,
+100,101,97,108,115,119,111,117,108,100,53,48,112,120,59,117,114,108,61,34,112,97
+,114,107,115,109,111,117,115,101,77,111,115,116,32,46,46,46,60,47,97,109,111,110
+,103,98,114,97,105,110,98,111,100,121,32,110,111,110,101,59,98,97,115,101,100,99
+,97,114,114,121,100,114,97,102,116,114,101,102,101,114,112,97,103,101,95,104,111
+,109,101,46,109,101,116,101,114,100,101,108,97,121,100,114,101,97,109,112,114,
+111,118,101,106,111,105,110,116,60,47,116,114,62,100,114,117,103,115,60,33,45,45
+,32,97,112,114,105,108,105,100,101,97,108,97,108,108,101,110,101,120,97,99,116,
+102,111,114,116,104,99,111,100,101,115,108,111,103,105,99,86,105,101,119,32,115,
+101,101,109,115,98,108,97,110,107,112,111,114,116,115,32,40,50,48,48,115,97,118,
+101,100,95,108,105,110,107,103,111,97,108,115,103,114,97,110,116,103,114,101,101
+,107,104,111,109,101,115,114,105,110,103,115,114,97,116,101,100,51,48,112,120,59
+,119,104,111,115,101,112,97,114,115,101,40,41,59,34,32,66,108,111,99,107,108,105
+,110,117,120,106,111,110,101,115,112,105,120,101,108,39,41,59,34,62,41,59,105,
+102,40,45,108,101,102,116,100,97,118,105,100,104,111,114,115,101,70,111,99,117,
+115,114,97,105,115,101,98,111,120,101,115,84,114,97,99,107,101,109,101,110,116,
+60,47,101,109,62,98,97,114,34,62,46,115,114,99,61,116,111,119,101,114,97,108,116
+,61,34,99,97,98,108,101,104,101,110,114,121,50,52,112,120,59,115,101,116,117,112
+,105,116,97,108,121,115,104,97,114,112,109,105,110,111,114,116,97,115,116,101,
+119,97,110,116,115,116,104,105,115,46,114,101,115,101,116,119,104,101,101,108,
+103,105,114,108,115,47,99,115,115,47,49,48,48,37,59,99,108,117,98,115,115,116,
+117,102,102,98,105,98,108,101,118,111,116,101,115,32,49,48,48,48,107,111,114,101
+,97,125,41,59,13,10,98,97,110,100,115,113,117,101,117,101,61,32,123,125,59,56,48
+,112,120,59,99,107,105,110,103,123,13,10,9,9,97,104,101,97,100,99,108,111,99,107
+,105,114,105,115,104,108,105,107,101,32,114,97,116,105,111,115,116,97,116,115,70
+,111,114,109,34,121,97,104,111,111,41,91,48,93,59,65,98,111,117,116,102,105,110,
+100,115,60,47,104,49,62,100,101,98,117,103,116,97,115,107,115,85,82,76,32,61,99,
+101,108,108,115,125,41,40,41,59,49,50,112,120,59,112,114,105,109,101,116,101,108
+,108,115,116,117,114,110,115,48,120,54,48,48,46,106,112,103,34,115,112,97,105,
+110,98,101,97,99,104,116,97,120,101,115,109,105,99,114,111,97,110,103,101,108,45
+,45,62,60,47,103,105,102,116,115,115,116,101,118,101,45,108,105,110,107,98,111,
+100,121,46,125,41,59,10,9,109,111,117,110,116,32,40,49,57,57,70,65,81,60,47,114,
+111,103,101,114,102,114,97,110,107,67,108,97,115,115,50,56,112,120,59,102,101,
+101,100,115,60,104,49,62,60,115,99,111,116,116,116,101,115,116,115,50,50,112,120
+,59,100,114,105,110,107,41,32,124,124,32,108,101,119,105,115,115,104,97,108,108,
+35,48,51,57,59,32,102,111,114,32,108,111,118,101,100,119,97,115,116,101,48,48,
+112,120,59,106,97,58,227,130,115,105,109,111,110,60,102,111,110,116,114,101,112,
+108,121,109,101,101,116,115,117,110,116,101,114,99,104,101,97,112,116,105,103,
+104,116,66,114,97,110,100,41,32,33,61,32,100,114,101,115,115,99,108,105,112,115,
+114,111,111,109,115,111,110,107,101,121,109,111,98,105,108,109,97,105,110,46,78,
+97,109,101,32,112,108,97,116,101,102,117,110,110,121,116,114,101,101,115,99,111,
+109,47,34,49,46,106,112,103,119,109,111,100,101,112,97,114,97,109,83,84,65,82,84
+,108,101,102,116,32,105,100,100,101,110,44,32,50,48,49,41,59,10,125,10,102,111,
+114,109,46,118,105,114,117,115,99,104,97,105,114,116,114,97,110,115,119,111,114,
+115,116,80,97,103,101,115,105,116,105,111,110,112,97,116,99,104,60,33,45,45,10,
+111,45,99,97,99,102,105,114,109,115,116,111,117,114,115,44,48,48,48,32,97,115,
+105,97,110,105,43,43,41,123,97,100,111,98,101,39,41,91,48,93,105,100,61,49,48,98
+,111,116,104,59,109,101,110,117,32,46,50,46,109,105,46,112,110,103,34,107,101,
+118,105,110,99,111,97,99,104,67,104,105,108,100,98,114,117,99,101,50,46,106,112,
+103,85,82,76,41,43,46,106,112,103,124,115,117,105,116,101,115,108,105,99,101,104
+,97,114,114,121,49,50,48,34,32,115,119,101,101,116,116,114,62,13,10,110,97,109,
+101,61,100,105,101,103,111,112,97,103,101,32,115,119,105,115,115,45,45,62,10,10,
+35,102,102,102,59,34,62,76,111,103,46,99,111,109,34,116,114,101,97,116,115,104,
+101,101,116,41,32,38,38,32,49,52,112,120,59,115,108,101,101,112,110,116,101,110,
+116,102,105,108,101,100,106,97,58,227,131,105,100,61,34,99,78,97,109,101,34,119,
+111,114,115,101,115,104,111,116,115,45,98,111,120,45,100,101,108,116,97,10,38,
+108,116,59,98,101,97,114,115,58,52,56,90,60,100,97,116,97,45,114,117,114,97,108,
+60,47,97,62,32,115,112,101,110,100,98,97,107,101,114,115,104,111,112,115,61,32,
+34,34,59,112,104,112,34,62,99,116,105,111,110,49,51,112,120,59,98,114,105,97,110
+,104,101,108,108,111,115,105,122,101,61,111,61,37,50,70,32,106,111,105,110,109,
+97,121,98,101,60,105,109,103,32,105,109,103,34,62,44,32,102,106,115,105,109,103,
+34,32,34,41,91,48,93,77,84,111,112,66,84,121,112,101,34,110,101,119,108,121,68,
+97,110,115,107,99,122,101,99,104,116,114,97,105,108,107,110,111,119,115,60,47,
+104,53,62,102,97,113,34,62,122,104,45,99,110,49,48,41,59,10,45,49,34,41,59,116,
+121,112,101,61,98,108,117,101,115,116,114,117,108,121,100,97,118,105,115,46,106,
+115,39,59,62,13,10,60,33,115,116,101,101,108,32,121,111,117,32,104,50,62,13,10,
+102,111,114,109,32,106,101,115,117,115,49,48,48,37,32,109,101,110,117,46,13,10,9
+,13,10,119,97,108,101,115,114,105,115,107,115,117,109,101,110,116,100,100,105,
+110,103,98,45,108,105,107,116,101,97,99,104,103,105,102,34,32,118,101,103,97,115
+,100,97,110,115,107,101,101,115,116,105,115,104,113,105,112,115,117,111,109,105,
+115,111,98,114,101,100,101,115,100,101,101,110,116,114,101,116,111,100,111,115,
+112,117,101,100,101,97,195,177,111,115,101,115,116,195,161,116,105,101,110,101,
+104,97,115,116,97,111,116,114,111,115,112,97,114,116,101,100,111,110,100,101,110
+,117,101,118,111,104,97,99,101,114,102,111,114,109,97,109,105,115,109,111,109,
+101,106,111,114,109,117,110,100,111,97,113,117,195,173,100,195,173,97,115,115,
+195,179,108,111,97,121,117,100,97,102,101,99,104,97,116,111,100,97,115,116,97,
+110,116,111,109,101,110,111,115,100,97,116,111,115,111,116,114,97,115,115,105,
+116,105,111,109,117,99,104,111,97,104,111,114,97,108,117,103,97,114,109,97,121,
+111,114,101,115,116,111,115,104,111,114,97,115,116,101,110,101,114,97,110,116,
+101,115,102,111,116,111,115,101,115,116,97,115,112,97,195,173,115,110,117,101,
+118,97,115,97,108,117,100,102,111,114,111,115,109,101,100,105,111,113,117,105,
+101,110,109,101,115,101,115,112,111,100,101,114,99,104,105,108,101,115,101,114,
+195,161,118,101,99,101,115,100,101,99,105,114,106,111,115,195,169,101,115,116,97
+,114,118,101,110,116,97,103,114,117,112,111,104,101,99,104,111,101,108,108,111,
+115,116,101,110,103,111,97,109,105,103,111,99,111,115,97,115,110,105,118,101,108
+,103,101,110,116,101,109,105,115,109,97,97,105,114,101,115,106,117,108,105,111,
+116,101,109,97,115,104,97,99,105,97,102,97,118,111,114,106,117,110,105,111,108,
+105,98,114,101,112,117,110,116,111,98,117,101,110,111,97,117,116,111,114,97,98,
+114,105,108,98,117,101,110,97,116,101,120,116,111,109,97,114,122,111,115,97,98,
+101,114,108,105,115,116,97,108,117,101,103,111,99,195,179,109,111,101,110,101,
+114,111,106,117,101,103,111,112,101,114,195,186,104,97,98,101,114,101,115,116,
+111,121,110,117,110,99,97,109,117,106,101,114,118,97,108,111,114,102,117,101,114
+,97,108,105,98,114,111,103,117,115,116,97,105,103,117,97,108,118,111,116,111,115
+,99,97,115,111,115,103,117,195,173,97,112,117,101,100,111,115,111,109,111,115,97
+,118,105,115,111,117,115,116,101,100,100,101,98,101,110,110,111,99,104,101,98,
+117,115,99,97,102,97,108,116,97,101,117,114,111,115,115,101,114,105,101,100,105,
+99,104,111,99,117,114,115,111,99,108,97,118,101,99,97,115,97,115,108,101,195,179
+,110,112,108,97,122,111,108,97,114,103,111,111,98,114,97,115,118,105,115,116,97,
+97,112,111,121,111,106,117,110,116,111,116,114,97,116,97,118,105,115,116,111,99,
+114,101,97,114,99,97,109,112,111,104,101,109,111,115,99,105,110,99,111,99,97,114
+,103,111,112,105,115,111,115,111,114,100,101,110,104,97,99,101,110,195,161,114,
+101,97,100,105,115,99,111,112,101,100,114,111,99,101,114,99,97,112,117,101,100,
+97,112,97,112,101,108,109,101,110,111,114,195,186,116,105,108,99,108,97,114,111,
+106,111,114,103,101,99,97,108,108,101,112,111,110,101,114,116,97,114,100,101,110
+,97,100,105,101,109,97,114,99,97,115,105,103,117,101,101,108,108,97,115,115,105,
+103,108,111,99,111,99,104,101,109,111,116,111,115,109,97,100,114,101,99,108,97,
+115,101,114,101,115,116,111,110,105,195,177,111,113,117,101,100,97,112,97,115,97
+,114,98,97,110,99,111,104,105,106,111,115,118,105,97,106,101,112,97,98,108,111,
+195,169,115,116,101,118,105,101,110,101,114,101,105,110,111,100,101,106,97,114,
+102,111,110,100,111,99,97,110,97,108,110,111,114,116,101,108,101,116,114,97,99,
+97,117,115,97,116,111,109,97,114,109,97,110,111,115,108,117,110,101,115,97,117,
+116,111,115,118,105,108,108,97,118,101,110,100,111,112,101,115,97,114,116,105,
+112,111,115,116,101,110,103,97,109,97,114,99,111,108,108,101,118,97,112,97,100,
+114,101,117,110,105,100,111,118,97,109,111,115,122,111,110,97,115,97,109,98,111,
+115,98,97,110,100,97,109,97,114,105,97,97,98,117,115,111,109,117,99,104,97,115,
+117,98,105,114,114,105,111,106,97,118,105,118,105,114,103,114,97,100,111,99,104,
+105,99,97,97,108,108,195,173,106,111,118,101,110,100,105,99,104,97,101,115,116,
+97,110,116,97,108,101,115,115,97,108,105,114,115,117,101,108,111,112,101,115,111
+,115,102,105,110,101,115,108,108,97,109,97,98,117,115,99,111,195,169,115,116,97,
+108,108,101,103,97,110,101,103,114,111,112,108,97,122,97,104,117,109,111,114,112
+,97,103,97,114,106,117,110,116,97,100,111,98,108,101,105,115,108,97,115,98,111,
+108,115,97,98,97,195,177,111,104,97,98,108,97,108,117,99,104,97,195,129,114,101,
+97,100,105,99,101,110,106,117,103,97,114,110,111,116,97,115,118,97,108,108,101,
+97,108,108,195,161,99,97,114,103,97,100,111,108,111,114,97,98,97,106,111,101,115
+,116,195,169,103,117,115,116,111,109,101,110,116,101,109,97,114,105,111,102,105,
+114,109,97,99,111,115,116,111,102,105,99,104,97,112,108,97,116,97,104,111,103,97
+,114,97,114,116,101,115,108,101,121,101,115,97,113,117,101,108,109,117,115,101,
+111,98,97,115,101,115,112,111,99,111,115,109,105,116,97,100,99,105,101,108,111,
+99,104,105,99,111,109,105,101,100,111,103,97,110,97,114,115,97,110,116,111,101,
+116,97,112,97,100,101,98,101,115,112,108,97,121,97,114,101,100,101,115,115,105,
+101,116,101,99,111,114,116,101,99,111,114,101,97,100,117,100,97,115,100,101,115,
+101,111,118,105,101,106,111,100,101,115,101,97,97,103,117,97,115,38,113,117,111,
+116,59,100,111,109,97,105,110,99,111,109,109,111,110,115,116,97,116,117,115,101,
+118,101,110,116,115,109,97,115,116,101,114,115,121,115,116,101,109,97,99,116,105
+,111,110,98,97,110,110,101,114,114,101,109,111,118,101,115,99,114,111,108,108,
+117,112,100,97,116,101,103,108,111,98,97,108,109,101,100,105,117,109,102,105,108
+,116,101,114,110,117,109,98,101,114,99,104,97,110,103,101,114,101,115,117,108,
+116,112,117,98,108,105,99,115,99,114,101,101,110,99,104,111,111,115,101,110,111,
+114,109,97,108,116,114,97,118,101,108,105,115,115,117,101,115,115,111,117,114,99
+,101,116,97,114,103,101,116,115,112,114,105,110,103,109,111,100,117,108,101,109,
+111,98,105,108,101,115,119,105,116,99,104,112,104,111,116,111,115,98,111,114,100
+,101,114,114,101,103,105,111,110,105,116,115,101,108,102,115,111,99,105,97,108,
+97,99,116,105,118,101,99,111,108,117,109,110,114,101,99,111,114,100,102,111,108,
+108,111,119,116,105,116,108,101,62,101,105,116,104,101,114,108,101,110,103,116,
+104,102,97,109,105,108,121,102,114,105,101,110,100,108,97,121,111,117,116,97,117
+,116,104,111,114,99,114,101,97,116,101,114,101,118,105,101,119,115,117,109,109,
+101,114,115,101,114,118,101,114,112,108,97,121,101,100,112,108,97,121,101,114,
+101,120,112,97,110,100,112,111,108,105,99,121,102,111,114,109,97,116,100,111,117
+,98,108,101,112,111,105,110,116,115,115,101,114,105,101,115,112,101,114,115,111,
+110,108,105,118,105,110,103,100,101,115,105,103,110,109,111,110,116,104,115,102,
+111,114,99,101,115,117,110,105,113,117,101,119,101,105,103,104,116,112,101,111,
+112,108,101,101,110,101,114,103,121,110,97,116,117,114,101,115,101,97,114,99,104
+,102,105,103,117,114,101,104,97,118,105,110,103,99,117,115,116,111,109,111,102,
+102,115,101,116,108,101,116,116,101,114,119,105,110,100,111,119,115,117,98,109,
+105,116,114,101,110,100,101,114,103,114,111,117,112,115,117,112,108,111,97,100,
+104,101,97,108,116,104,109,101,116,104,111,100,118,105,100,101,111,115,115,99,
+104,111,111,108,102,117,116,117,114,101,115,104,97,100,111,119,100,101,98,97,116
+,101,118,97,108,117,101,115,79,98,106,101,99,116,111,116,104,101,114,115,114,105
+,103,104,116,115,108,101,97,103,117,101,99,104,114,111,109,101,115,105,109,112,
+108,101,110,111,116,105,99,101,115,104,97,114,101,100,101,110,100,105,110,103,
+115,101,97,115,111,110,114,101,112,111,114,116,111,110,108,105,110,101,115,113,
+117,97,114,101,98,117,116,116,111,110,105,109,97,103,101,115,101,110,97,98,108,
+101,109,111,118,105,110,103,108,97,116,101,115,116,119,105,110,116,101,114,70,
+114,97,110,99,101,112,101,114,105,111,100,115,116,114,111,110,103,114,101,112,
+101,97,116,76,111,110,100,111,110,100,101,116,97,105,108,102,111,114,109,101,100
+,100,101,109,97,110,100,115,101,99,117,114,101,112,97,115,115,101,100,116,111,
+103,103,108,101,112,108,97,99,101,115,100,101,118,105,99,101,115,116,97,116,105,
+99,99,105,116,105,101,115,115,116,114,101,97,109,121,101,108,108,111,119,97,116,
+116,97,99,107,115,116,114,101,101,116,102,108,105,103,104,116,104,105,100,100,
+101,110,105,110,102,111,34,62,111,112,101,110,101,100,117,115,101,102,117,108,
+118,97,108,108,101,121,99,97,117,115,101,115,108,101,97,100,101,114,115,101,99,
+114,101,116,115,101,99,111,110,100,100,97,109,97,103,101,115,112,111,114,116,115
+,101,120,99,101,112,116,114,97,116,105,110,103,115,105,103,110,101,100,116,104,
+105,110,103,115,101,102,102,101,99,116,102,105,101,108,100,115,115,116,97,116,
+101,115,111,102,102,105,99,101,118,105,115,117,97,108,101,100,105,116,111,114,
+118,111,108,117,109,101,82,101,112,111,114,116,109,117,115,101,117,109,109,111,
+118,105,101,115,112,97,114,101,110,116,97,99,99,101,115,115,109,111,115,116,108,
+121,109,111,116,104,101,114,34,32,105,100,61,34,109,97,114,107,101,116,103,114,
+111,117,110,100,99,104,97,110,99,101,115,117,114,118,101,121,98,101,102,111,114,
+101,115,121,109,98,111,108,109,111,109,101,110,116,115,112,101,101,99,104,109,
+111,116,105,111,110,105,110,115,105,100,101,109,97,116,116,101,114,67,101,110,
+116,101,114,111,98,106,101,99,116,101,120,105,115,116,115,109,105,100,100,108,
+101,69,117,114,111,112,101,103,114,111,119,116,104,108,101,103,97,99,121,109,97,
+110,110,101,114,101,110,111,117,103,104,99,97,114,101,101,114,97,110,115,119,101
+,114,111,114,105,103,105,110,112,111,114,116,97,108,99,108,105,101,110,116,115,
+101,108,101,99,116,114,97,110,100,111,109,99,108,111,115,101,100,116,111,112,105
+,99,115,99,111,109,105,110,103,102,97,116,104,101,114,111,112,116,105,111,110,
+115,105,109,112,108,121,114,97,105,115,101,100,101,115,99,97,112,101,99,104,111,
+115,101,110,99,104,117,114,99,104,100,101,102,105,110,101,114,101,97,115,111,110
+,99,111,114,110,101,114,111,117,116,112,117,116,109,101,109,111,114,121,105,102,
+114,97,109,101,112,111,108,105,99,101,109,111,100,101,108,115,78,117,109,98,101,
+114,100,117,114,105,110,103,111,102,102,101,114,115,115,116,121,108,101,115,107,
+105,108,108,101,100,108,105,115,116,101,100,99,97,108,108,101,100,115,105,108,
+118,101,114,109,97,114,103,105,110,100,101,108,101,116,101,98,101,116,116,101,
+114,98,114,111,119,115,101,108,105,109,105,116,115,71,108,111,98,97,108,115,105,
+110,103,108,101,119,105,100,103,101,116,99,101,110,116,101,114,98,117,100,103,
+101,116,110,111,119,114,97,112,99,114,101,100,105,116,99,108,97,105,109,115,101,
+110,103,105,110,101,115,97,102,101,116,121,99,104,111,105,99,101,115,112,105,114
+,105,116,45,115,116,121,108,101,115,112,114,101,97,100,109,97,107,105,110,103,
+110,101,101,100,101,100,114,117,115,115,105,97,112,108,101,97,115,101,101,120,
+116,101,110,116,83,99,114,105,112,116,98,114,111,107,101,110,97,108,108,111,119,
+115,99,104,97,114,103,101,100,105,118,105,100,101,102,97,99,116,111,114,109,101,
+109,98,101,114,45,98,97,115,101,100,116,104,101,111,114,121,99,111,110,102,105,
+103,97,114,111,117,110,100,119,111,114,107,101,100,104,101,108,112,101,100,67,
+104,117,114,99,104,105,109,112,97,99,116,115,104,111,117,108,100,97,108,119,97,
+121,115,108,111,103,111,34,32,98,111,116,116,111,109,108,105,115,116,34,62,41,
+123,118,97,114,32,112,114,101,102,105,120,111,114,97,110,103,101,72,101,97,100,
+101,114,46,112,117,115,104,40,99,111,117,112,108,101,103,97,114,100,101,110,98,
+114,105,100,103,101,108,97,117,110,99,104,82,101,118,105,101,119,116,97,107,105,
+110,103,118,105,115,105,111,110,108,105,116,116,108,101,100,97,116,105,110,103,
+66,117,116,116,111,110,98,101,97,117,116,121,116,104,101,109,101,115,102,111,114
+,103,111,116,83,101,97,114,99,104,97,110,99,104,111,114,97,108,109,111,115,116,
+108,111,97,100,101,100,67,104,97,110,103,101,114,101,116,117,114,110,115,116,114
+,105,110,103,114,101,108,111,97,100,77,111,98,105,108,101,105,110,99,111,109,101
+,115,117,112,112,108,121,83,111,117,114,99,101,111,114,100,101,114,115,118,105,
+101,119,101,100,38,110,98,115,112,59,99,111,117,114,115,101,65,98,111,117,116,32
+,105,115,108,97,110,100,60,104,116,109,108,32,99,111,111,107,105,101,110,97,109,
+101,61,34,97,109,97,122,111,110,109,111,100,101,114,110,97,100,118,105,99,101,
+105,110,60,47,97,62,58,32,84,104,101,32,100,105,97,108,111,103,104,111,117,115,
+101,115,66,69,71,73,78,32,77,101,120,105,99,111,115,116,97,114,116,115,99,101,
+110,116,114,101,104,101,105,103,104,116,97,100,100,105,110,103,73,115,108,97,110
+,100,97,115,115,101,116,115,69,109,112,105,114,101,83,99,104,111,111,108,101,102
+,102,111,114,116,100,105,114,101,99,116,110,101,97,114,108,121,109,97,110,117,97
+,108,83,101,108,101,99,116,46,10,10,79,110,101,106,111,105,110,101,100,109,101,
+110,117,34,62,80,104,105,108,105,112,97,119,97,114,100,115,104,97,110,100,108,
+101,105,109,112,111,114,116,79,102,102,105,99,101,114,101,103,97,114,100,115,107
+,105,108,108,115,110,97,116,105,111,110,83,112,111,114,116,115,100,101,103,114,
+101,101,119,101,101,107,108,121,32,40,101,46,103,46,98,101,104,105,110,100,100,
+111,99,116,111,114,108,111,103,103,101,100,117,110,105,116,101,100,60,47,98,62,
+60,47,98,101,103,105,110,115,112,108,97,110,116,115,97,115,115,105,115,116,97,
+114,116,105,115,116,105,115,115,117,101,100,51,48,48,112,120,124,99,97,110,97,
+100,97,97,103,101,110,99,121,115,99,104,101,109,101,114,101,109,97,105,110,66,
+114,97,122,105,108,115,97,109,112,108,101,108,111,103,111,34,62,98,101,121,111,
+110,100,45,115,99,97,108,101,97,99,99,101,112,116,115,101,114,118,101,100,109,97
+,114,105,110,101,70,111,111,116,101,114,99,97,109,101,114,97,60,47,104,49,62,10,
+95,102,111,114,109,34,108,101,97,118,101,115,115,116,114,101,115,115,34,32,47,62
+,13,10,46,103,105,102,34,32,111,110,108,111,97,100,108,111,97,100,101,114,79,120
+,102,111,114,100,115,105,115,116,101,114,115,117,114,118,105,118,108,105,115,116
+,101,110,102,101,109,97,108,101,68,101,115,105,103,110,115,105,122,101,61,34,97,
+112,112,101,97,108,116,101,120,116,34,62,108,101,118,101,108,115,116,104,97,110,
+107,115,104,105,103,104,101,114,102,111,114,99,101,100,97,110,105,109,97,108,97,
+110,121,111,110,101,65,102,114,105,99,97,97,103,114,101,101,100,114,101,99,101,
+110,116,80,101,111,112,108,101,60,98,114,32,47,62,119,111,110,100,101,114,112,
+114,105,99,101,115,116,117,114,110,101,100,124,124,32,123,125,59,109,97,105,110,
+34,62,105,110,108,105,110,101,115,117,110,100,97,121,119,114,97,112,34,62,102,97
+,105,108,101,100,99,101,110,115,117,115,109,105,110,117,116,101,98,101,97,99,111
+,110,113,117,111,116,101,115,49,53,48,112,120,124,101,115,116,97,116,101,114,101
+,109,111,116,101,101,109,97,105,108,34,108,105,110,107,101,100,114,105,103,104,
+116,59,115,105,103,110,97,108,102,111,114,109,97,108,49,46,104,116,109,108,115,
+105,103,110,117,112,112,114,105,110,99,101,102,108,111,97,116,58,46,112,110,103,
+34,32,102,111,114,117,109,46,65,99,99,101,115,115,112,97,112,101,114,115,115,111
+,117,110,100,115,101,120,116,101,110,100,72,101,105,103,104,116,115,108,105,100,
+101,114,85,84,70,45,56,34,38,97,109,112,59,32,66,101,102,111,114,101,46,32,87,
+105,116,104,115,116,117,100,105,111,111,119,110,101,114,115,109,97,110,97,103,
+101,112,114,111,102,105,116,106,81,117,101,114,121,97,110,110,117,97,108,112,97,
+114,97,109,115,98,111,117,103,104,116,102,97,109,111,117,115,103,111,111,103,108
+,101,108,111,110,103,101,114,105,43,43,41,32,123,105,115,114,97,101,108,115,97,
+121,105,110,103,100,101,99,105,100,101,104,111,109,101,34,62,104,101,97,100,101,
+114,101,110,115,117,114,101,98,114,97,110,99,104,112,105,101,99,101,115,98,108,
+111,99,107,59,115,116,97,116,101,100,116,111,112,34,62,60,114,97,99,105,110,103,
+114,101,115,105,122,101,45,45,38,103,116,59,112,97,99,105,116,121,115,101,120,
+117,97,108,98,117,114,101,97,117,46,106,112,103,34,32,49,48,44,48,48,48,111,98,
+116,97,105,110,116,105,116,108,101,115,97,109,111,117,110,116,44,32,73,110,99,46
+,99,111,109,101,100,121,109,101,110,117,34,32,108,121,114,105,99,115,116,111,100
+,97,121,46,105,110,100,101,101,100,99,111,117,110,116,121,95,108,111,103,111,46,
+70,97,109,105,108,121,108,111,111,107,101,100,77,97,114,107,101,116,108,115,101,
+32,105,102,80,108,97,121,101,114,116,117,114,107,101,121,41,59,118,97,114,32,102
+,111,114,101,115,116,103,105,118,105,110,103,101,114,114,111,114,115,68,111,109,
+97,105,110,125,101,108,115,101,123,105,110,115,101,114,116,66,108,111,103,60,47,
+102,111,111,116,101,114,108,111,103,105,110,46,102,97,115,116,101,114,97,103,101
+,110,116,115,60,98,111,100,121,32,49,48,112,120,32,48,112,114,97,103,109,97,102,
+114,105,100,97,121,106,117,110,105,111,114,100,111,108,108,97,114,112,108,97,99,
+101,100,99,111,118,101,114,115,112,108,117,103,105,110,53,44,48,48,48,32,112,97,
+103,101,34,62,98,111,115,116,111,110,46,116,101,115,116,40,97,118,97,116,97,114,
+116,101,115,116,101,100,95,99,111,117,110,116,102,111,114,117,109,115,115,99,104
+,101,109,97,105,110,100,101,120,44,102,105,108,108,101,100,115,104,97,114,101,
+115,114,101,97,100,101,114,97,108,101,114,116,40,97,112,112,101,97,114,83,117,98
+,109,105,116,108,105,110,101,34,62,98,111,100,121,34,62,10,42,32,84,104,101,84,
+104,111,117,103,104,115,101,101,105,110,103,106,101,114,115,101,121,78,101,119,
+115,60,47,118,101,114,105,102,121,101,120,112,101,114,116,105,110,106,117,114,
+121,119,105,100,116,104,61,67,111,111,107,105,101,83,84,65,82,84,32,97,99,114,
+111,115,115,95,105,109,97,103,101,116,104,114,101,97,100,110,97,116,105,118,101,
+112,111,99,107,101,116,98,111,120,34,62,10,83,121,115,116,101,109,32,68,97,118,
+105,100,99,97,110,99,101,114,116,97,98,108,101,115,112,114,111,118,101,100,65,
+112,114,105,108,32,114,101,97,108,108,121,100,114,105,118,101,114,105,116,101,
+109,34,62,109,111,114,101,34,62,98,111,97,114,100,115,99,111,108,111,114,115,99,
+97,109,112,117,115,102,105,114,115,116,32,124,124,32,91,93,59,109,101,100,105,97
+,46,103,117,105,116,97,114,102,105,110,105,115,104,119,105,100,116,104,58,115,
+104,111,119,101,100,79,116,104,101,114,32,46,112,104,112,34,32,97,115,115,117,
+109,101,108,97,121,101,114,115,119,105,108,115,111,110,115,116,111,114,101,115,
+114,101,108,105,101,102,115,119,101,100,101,110,67,117,115,116,111,109,101,97,
+115,105,108,121,32,121,111,117,114,32,83,116,114,105,110,103,10,10,87,104,105,
+108,116,97,121,108,111,114,99,108,101,97,114,58,114,101,115,111,114,116,102,114,
+101,110,99,104,116,104,111,117,103,104,34,41,32,43,32,34,60,98,111,100,121,62,98
+,117,121,105,110,103,98,114,97,110,100,115,77,101,109,98,101,114,110,97,109,101,
+34,62,111,112,112,105,110,103,115,101,99,116,111,114,53,112,120,59,34,62,118,115
+,112,97,99,101,112,111,115,116,101,114,109,97,106,111,114,32,99,111,102,102,101,
+101,109,97,114,116,105,110,109,97,116,117,114,101,104,97,112,112,101,110,60,47,
+110,97,118,62,107,97,110,115,97,115,108,105,110,107,34,62,73,109,97,103,101,115,
+61,102,97,108,115,101,119,104,105,108,101,32,104,115,112,97,99,101,48,38,97,109,
+112,59,32,10,10,73,110,32,32,112,111,119,101,114,80,111,108,115,107,105,45,99,
+111,108,111,114,106,111,114,100,97,110,66,111,116,116,111,109,83,116,97,114,116,
+32,45,99,111,117,110,116,50,46,104,116,109,108,110,101,119,115,34,62,48,49,46,
+106,112,103,79,110,108,105,110,101,45,114,105,103,104,116,109,105,108,108,101,
+114,115,101,110,105,111,114,73,83,66,78,32,48,48,44,48,48,48,32,103,117,105,100,
+101,115,118,97,108,117,101,41,101,99,116,105,111,110,114,101,112,97,105,114,46,
+120,109,108,34,32,32,114,105,103,104,116,115,46,104,116,109,108,45,98,108,111,99
+,107,114,101,103,69,120,112,58,104,111,118,101,114,119,105,116,104,105,110,118,
+105,114,103,105,110,112,104,111,110,101,115,60,47,116,114,62,13,117,115,105,110,
+103,32,10,9,118,97,114,32,62,39,41,59,10,9,60,47,116,100,62,10,60,47,116,114,62,
+10,98,97,104,97,115,97,98,114,97,115,105,108,103,97,108,101,103,111,109,97,103,
+121,97,114,112,111,108,115,107,105,115,114,112,115,107,105,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,141,99,117,97,110,100,111,101,110,118,
+105,97,114,109,97,100,114,105,100,98,117,115,99,97,114,105,110,105,99,105,111,
+116,105,101,109,112,111,112,111,114,113,117,101,99,117,101,110,116,97,101,115,
+116,97,100,111,112,117,101,100,101,110,106,117,101,103,111,115,99,111,110,116,
+114,97,101,115,116,195,161,110,110,111,109,98,114,101,116,105,101,110,101,110,
+112,101,114,102,105,108,109,97,110,101,114,97,97,109,105,103,111,115,99,105,117,
+100,97,100,99,101,110,116,114,111,97,117,110,113,117,101,112,117,101,100,101,115
+,100,101,110,116,114,111,112,114,105,109,101,114,112,114,101,99,105,111,115,101,
+103,195,186,110,98,117,101,110,111,115,118,111,108,118,101,114,112,117,110,116,
+111,115,115,101,109,97,110,97,104,97,98,195,173,97,97,103,111,115,116,111,110,
+117,101,118,111,115,117,110,105,100,111,115,99,97,114,108,111,115,101,113,117,
+105,112,111,110,105,195,177,111,115,109,117,99,104,111,115,97,108,103,117,110,97
+,99,111,114,114,101,111,105,109,97,103,101,110,112,97,114,116,105,114,97,114,114
+,105,98,97,109,97,114,195,173,97,104,111,109,98,114,101,101,109,112,108,101,111,
+118,101,114,100,97,100,99,97,109,98,105,111,109,117,99,104,97,115,102,117,101,
+114,111,110,112,97,115,97,100,111,108,195,173,110,101,97,112,97,114,101,99,101,
+110,117,101,118,97,115,99,117,114,115,111,115,101,115,116,97,98,97,113,117,105,
+101,114,111,108,105,98,114,111,115,99,117,97,110,116,111,97,99,99,101,115,111,
+109,105,103,117,101,108,118,97,114,105,111,115,99,117,97,116,114,111,116,105,101
+,110,101,115,103,114,117,112,111,115,115,101,114,195,161,110,101,117,114,111,112
+,97,109,101,100,105,111,115,102,114,101,110,116,101,97,99,101,114,99,97,100,101,
+109,195,161,115,111,102,101,114,116,97,99,111,99,104,101,115,109,111,100,101,108
+,111,105,116,97,108,105,97,108,101,116,114,97,115,97,108,103,195,186,110,99,111,
+109,112,114,97,99,117,97,108,101,115,101,120,105,115,116,101,99,117,101,114,112,
+111,115,105,101,110,100,111,112,114,101,110,115,97,108,108,101,103,97,114,118,
+105,97,106,101,115,100,105,110,101,114,111,109,117,114,99,105,97,112,111,100,114
+,195,161,112,117,101,115,116,111,100,105,97,114,105,111,112,117,101,98,108,111,
+113,117,105,101,114,101,109,97,110,117,101,108,112,114,111,112,105,111,99,114,
+105,115,105,115,99,105,101,114,116,111,115,101,103,117,114,111,109,117,101,114,
+116,101,102,117,101,110,116,101,99,101,114,114,97,114,103,114,97,110,100,101,101
+,102,101,99,116,111,112,97,114,116,101,115,109,101,100,105,100,97,112,114,111,
+112,105,97,111,102,114,101,99,101,116,105,101,114,114,97,101,45,109,97,105,108,
+118,97,114,105,97,115,102,111,114,109,97,115,102,117,116,117,114,111,111,98,106,
+101,116,111,115,101,103,117,105,114,114,105,101,115,103,111,110,111,114,109,97,
+115,109,105,115,109,111,115,195,186,110,105,99,111,99,97,109,105,110,111,115,105
+,116,105,111,115,114,97,122,195,179,110,100,101,98,105,100,111,112,114,117,101,
+98,97,116,111,108,101,100,111,116,101,110,195,173,97,106,101,115,195,186,115,101
+,115,112,101,114,111,99,111,99,105,110,97,111,114,105,103,101,110,116,105,101,
+110,100,97,99,105,101,110,116,111,99,195,161,100,105,122,104,97,98,108,97,114,
+115,101,114,195,173,97,108,97,116,105,110,97,102,117,101,114,122,97,101,115,116,
+105,108,111,103,117,101,114,114,97,101,110,116,114,97,114,195,169,120,105,116,
+111,108,195,179,112,101,122,97,103,101,110,100,97,118,195,173,100,101,111,101,
+118,105,116,97,114,112,97,103,105,110,97,109,101,116,114,111,115,106,97,118,105,
+101,114,112,97,100,114,101,115,102,195,161,99,105,108,99,97,98,101,122,97,195,
+161,114,101,97,115,115,97,108,105,100,97,101,110,118,195,173,111,106,97,112,195,
+179,110,97,98,117,115,111,115,98,105,101,110,101,115,116,101,120,116,111,115,108
+,108,101,118,97,114,112,117,101,100,97,110,102,117,101,114,116,101,99,111,109,
+195,186,110,99,108,97,115,101,115,104,117,109,97,110,111,116,101,110,105,100,111
+,98,105,108,98,97,111,117,110,105,100,97,100,101,115,116,195,161,115,101,100,105
+,116,97,114,99,114,101,97,100,111,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,190,106,
+97,103,114,97,110,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,168,112,114,111,102,105,108,101,115,101,
+114,118,105,99,101,100,101,102,97,117,108,116,104,105,109,115,101,108,102,100,
+101,116,97,105,108,115,99,111,110,116,101,110,116,115,117,112,112,111,114,116,
+115,116,97,114,116,101,100,109,101,115,115,97,103,101,115,117,99,99,101,115,115,
+102,97,115,104,105,111,110,60,116,105,116,108,101,62,99,111,117,110,116,114,121,
+97,99,99,111,117,110,116,99,114,101,97,116,101,100,115,116,111,114,105,101,115,
+114,101,115,117,108,116,115,114,117,110,110,105,110,103,112,114,111,99,101,115,
+115,119,114,105,116,105,110,103,111,98,106,101,99,116,115,118,105,115,105,98,108
+,101,119,101,108,99,111,109,101,97,114,116,105,99,108,101,117,110,107,110,111,
+119,110,110,101,116,119,111,114,107,99,111,109,112,97,110,121,100,121,110,97,109
+,105,99,98,114,111,119,115,101,114,112,114,105,118,97,99,121,112,114,111,98,108,
+101,109,83,101,114,118,105,99,101,114,101,115,112,101,99,116,100,105,115,112,108
+,97,121,114,101,113,117,101,115,116,114,101,115,101,114,118,101,119,101,98,115,
+105,116,101,104,105,115,116,111,114,121,102,114,105,101,110,100,115,111,112,116,
+105,111,110,115,119,111,114,107,105,110,103,118,101,114,115,105,111,110,109,105,
+108,108,105,111,110,99,104,97,110,110,101,108,119,105,110,100,111,119,46,97,100,
+100,114,101,115,115,118,105,115,105,116,101,100,119,101,97,116,104,101,114,99,
+111,114,114,101,99,116,112,114,111,100,117,99,116,101,100,105,114,101,99,116,102
+,111,114,119,97,114,100,121,111,117,32,99,97,110,114,101,109,111,118,101,100,115
+,117,98,106,101,99,116,99,111,110,116,114,111,108,97,114,99,104,105,118,101,99,
+117,114,114,101,110,116,114,101,97,100,105,110,103,108,105,98,114,97,114,121,108
+,105,109,105,116,101,100,109,97,110,97,103,101,114,102,117,114,116,104,101,114,
+115,117,109,109,97,114,121,109,97,99,104,105,110,101,109,105,110,117,116,101,115
+,112,114,105,118,97,116,101,99,111,110,116,101,120,116,112,114,111,103,114,97,
+109,115,111,99,105,101,116,121,110,117,109,98,101,114,115,119,114,105,116,116,
+101,110,101,110,97,98,108,101,100,116,114,105,103,103,101,114,115,111,117,114,99
+,101,115,108,111,97,100,105,110,103,101,108,101,109,101,110,116,112,97,114,116,
+110,101,114,102,105,110,97,108,108,121,112,101,114,102,101,99,116,109,101,97,110
+,105,110,103,115,121,115,116,101,109,115,107,101,101,112,105,110,103,99,117,108,
+116,117,114,101,38,113,117,111,116,59,44,106,111,117,114,110,97,108,112,114,111,
+106,101,99,116,115,117,114,102,97,99,101,115,38,113,117,111,116,59,101,120,112,
+105,114,101,115,114,101,118,105,101,119,115,98,97,108,97,110,99,101,69,110,103,
+108,105,115,104,67,111,110,116,101,110,116,116,104,114,111,117,103,104,80,108,
+101,97,115,101,32,111,112,105,110,105,111,110,99,111,110,116,97,99,116,97,118,
+101,114,97,103,101,112,114,105,109,97,114,121,118,105,108,108,97,103,101,83,112,
+97,110,105,115,104,103,97,108,108,101,114,121,100,101,99,108,105,110,101,109,101
+,101,116,105,110,103,109,105,115,115,105,111,110,112,111,112,117,108,97,114,113,
+117,97,108,105,116,121,109,101,97,115,117,114,101,103,101,110,101,114,97,108,115
+,112,101,99,105,101,115,115,101,115,115,105,111,110,115,101,99,116,105,111,110,
+119,114,105,116,101,114,115,99,111,117,110,116,101,114,105,110,105,116,105,97,
+108,114,101,112,111,114,116,115,102,105,103,117,114,101,115,109,101,109,98,101,
+114,115,104,111,108,100,105,110,103,100,105,115,112,117,116,101,101,97,114,108,
+105,101,114,101,120,112,114,101,115,115,100,105,103,105,116,97,108,112,105,99,
+116,117,114,101,65,110,111,116,104,101,114,109,97,114,114,105,101,100,116,114,97
+,102,102,105,99,108,101,97,100,105,110,103,99,104,97,110,103,101,100,99,101,110,
+116,114,97,108,118,105,99,116,111,114,121,105,109,97,103,101,115,47,114,101,97,
+115,111,110,115,115,116,117,100,105,101,115,102,101,97,116,117,114,101,108,105,
+115,116,105,110,103,109,117,115,116,32,98,101,115,99,104,111,111,108,115,86,101,
+114,115,105,111,110,117,115,117,97,108,108,121,101,112,105,115,111,100,101,112,
+108,97,121,105,110,103,103,114,111,119,105,110,103,111,98,118,105,111,117,115,
+111,118,101,114,108,97,121,112,114,101,115,101,110,116,97,99,116,105,111,110,115
+,60,47,117,108,62,13,10,119,114,97,112,112,101,114,97,108,114,101,97,100,121,99,
+101,114,116,97,105,110,114,101,97,108,105,116,121,115,116,111,114,97,103,101,97,
+110,111,116,104,101,114,100,101,115,107,116,111,112,111,102,102,101,114,101,100,
+112,97,116,116,101,114,110,117,110,117,115,117,97,108,68,105,103,105,116,97,108,
+99,97,112,105,116,97,108,87,101,98,115,105,116,101,102,97,105,108,117,114,101,99
+,111,110,110,101,99,116,114,101,100,117,99,101,100,65,110,100,114,111,105,100,
+100,101,99,97,100,101,115,114,101,103,117,108,97,114,32,38,97,109,112,59,32,97,
+110,105,109,97,108,115,114,101,108,101,97,115,101,65,117,116,111,109,97,116,103,
+101,116,116,105,110,103,109,101,116,104,111,100,115,110,111,116,104,105,110,103,
+80,111,112,117,108,97,114,99,97,112,116,105,111,110,108,101,116,116,101,114,115,
+99,97,112,116,117,114,101,115,99,105,101,110,99,101,108,105,99,101,110,115,101,
+99,104,97,110,103,101,115,69,110,103,108,97,110,100,61,49,38,97,109,112,59,72,
+105,115,116,111,114,121,32,61,32,110,101,119,32,67,101,110,116,114,97,108,117,
+112,100,97,116,101,100,83,112,101,99,105,97,108,78,101,116,119,111,114,107,114,
+101,113,117,105,114,101,99,111,109,109,101,110,116,119,97,114,110,105,110,103,67
+,111,108,108,101,103,101,116,111,111,108,98,97,114,114,101,109,97,105,110,115,98
+,101,99,97,117,115,101,101,108,101,99,116,101,100,68,101,117,116,115,99,104,102,
+105,110,97,110,99,101,119,111,114,107,101,114,115,113,117,105,99,107,108,121,98,
+101,116,119,101,101,110,101,120,97,99,116,108,121,115,101,116,116,105,110,103,
+100,105,115,101,97,115,101,83,111,99,105,101,116,121,119,101,97,112,111,110,115,
+101,120,104,105,98,105,116,38,108,116,59,33,45,45,67,111,110,116,114,111,108,99,
+108,97,115,115,101,115,99,111,118,101,114,101,100,111,117,116,108,105,110,101,97
+,116,116,97,99,107,115,100,101,118,105,99,101,115,40,119,105,110,100,111,119,112
+,117,114,112,111,115,101,116,105,116,108,101,61,34,77,111,98,105,108,101,32,107,
+105,108,108,105,110,103,115,104,111,119,105,110,103,73,116,97,108,105,97,110,100
+,114,111,112,112,101,100,104,101,97,118,105,108,121,101,102,102,101,99,116,115,
+45,49,39,93,41,59,10,99,111,110,102,105,114,109,67,117,114,114,101,110,116,97,
+100,118,97,110,99,101,115,104,97,114,105,110,103,111,112,101,110,105,110,103,100
+,114,97,119,105,110,103,98,105,108,108,105,111,110,111,114,100,101,114,101,100,
+71,101,114,109,97,110,121,114,101,108,97,116,101,100,60,47,102,111,114,109,62,
+105,110,99,108,117,100,101,119,104,101,116,104,101,114,100,101,102,105,110,101,
+100,83,99,105,101,110,99,101,99,97,116,97,108,111,103,65,114,116,105,99,108,101,
+98,117,116,116,111,110,115,108,97,114,103,101,115,116,117,110,105,102,111,114,
+109,106,111,117,114,110,101,121,115,105,100,101,98,97,114,67,104,105,99,97,103,
+111,104,111,108,105,100,97,121,71,101,110,101,114,97,108,112,97,115,115,97,103,
+101,44,38,113,117,111,116,59,97,110,105,109,97,116,101,102,101,101,108,105,110,
+103,97,114,114,105,118,101,100,112,97,115,115,105,110,103,110,97,116,117,114,97,
+108,114,111,117,103,104,108,121,46,10,10,84,104,101,32,98,117,116,32,110,111,116
+,100,101,110,115,105,116,121,66,114,105,116,97,105,110,67,104,105,110,101,115,
+101,108,97,99,107,32,111,102,116,114,105,98,117,116,101,73,114,101,108,97,110,
+100,34,32,100,97,116,97,45,102,97,99,116,111,114,115,114,101,99,101,105,118,101,
+116,104,97,116,32,105,115,76,105,98,114,97,114,121,104,117,115,98,97,110,100,105
+,110,32,102,97,99,116,97,102,102,97,105,114,115,67,104,97,114,108,101,115,114,97
+,100,105,99,97,108,98,114,111,117,103,104,116,102,105,110,100,105,110,103,108,97
+,110,100,105,110,103,58,108,97,110,103,61,34,114,101,116,117,114,110,32,108,101,
+97,100,101,114,115,112,108,97,110,110,101,100,112,114,101,109,105,117,109,112,97
+,99,107,97,103,101,65,109,101,114,105,99,97,69,100,105,116,105,111,110,93,38,113
+,117,111,116,59,77,101,115,115,97,103,101,110,101,101,100,32,116,111,118,97,108,
+117,101,61,34,99,111,109,112,108,101,120,108,111,111,107,105,110,103,115,116,97,
+116,105,111,110,98,101,108,105,101,118,101,115,109,97,108,108,101,114,45,109,111
+,98,105,108,101,114,101,99,111,114,100,115,119,97,110,116,32,116,111,107,105,110
+,100,32,111,102,70,105,114,101,102,111,120,121,111,117,32,97,114,101,115,105,109
+,105,108,97,114,115,116,117,100,105,101,100,109,97,120,105,109,117,109,104,101,
+97,100,105,110,103,114,97,112,105,100,108,121,99,108,105,109,97,116,101,107,105,
+110,103,100,111,109,101,109,101,114,103,101,100,97,109,111,117,110,116,115,102,
+111,117,110,100,101,100,112,105,111,110,101,101,114,102,111,114,109,117,108,97,
+100,121,110,97,115,116,121,104,111,119,32,116,111,32,83,117,112,112,111,114,116,
+114,101,118,101,110,117,101,101,99,111,110,111,109,121,82,101,115,117,108,116,
+115,98,114,111,116,104,101,114,115,111,108,100,105,101,114,108,97,114,103,101,
+108,121,99,97,108,108,105,110,103,46,38,113,117,111,116,59,65,99,99,111,117,110,
+116,69,100,119,97,114,100,32,115,101,103,109,101,110,116,82,111,98,101,114,116,
+32,101,102,102,111,114,116,115,80,97,99,105,102,105,99,108,101,97,114,110,101,
+100,117,112,32,119,105,116,104,104,101,105,103,104,116,58,119,101,32,104,97,118,
+101,65,110,103,101,108,101,115,110,97,116,105,111,110,115,95,115,101,97,114,99,
+104,97,112,112,108,105,101,100,97,99,113,117,105,114,101,109,97,115,115,105,118,
+101,103,114,97,110,116,101,100,58,32,102,97,108,115,101,116,114,101,97,116,101,
+100,98,105,103,103,101,115,116,98,101,110,101,102,105,116,100,114,105,118,105,
+110,103,83,116,117,100,105,101,115,109,105,110,105,109,117,109,112,101,114,104,
+97,112,115,109,111,114,110,105,110,103,115,101,108,108,105,110,103,105,115,32,
+117,115,101,100,114,101,118,101,114,115,101,118,97,114,105,97,110,116,32,114,111
+,108,101,61,34,109,105,115,115,105,110,103,97,99,104,105,101,118,101,112,114,111
+,109,111,116,101,115,116,117,100,101,110,116,115,111,109,101,111,110,101,101,120
+,116,114,101,109,101,114,101,115,116,111,114,101,98,111,116,116,111,109,58,101,
+118,111,108,118,101,100,97,108,108,32,116,104,101,115,105,116,101,109,97,112,101
+,110,103,108,105,115,104,119,97,121,32,116,111,32,32,65,117,103,117,115,116,115,
+121,109,98,111,108,115,67,111,109,112,97,110,121,109,97,116,116,101,114,115,109,
+117,115,105,99,97,108,97,103,97,105,110,115,116,115,101,114,118,105,110,103,125,
+41,40,41,59,13,10,112,97,121,109,101,110,116,116,114,111,117,98,108,101,99,111,
+110,99,101,112,116,99,111,109,112,97,114,101,112,97,114,101,110,116,115,112,108,
+97,121,101,114,115,114,101,103,105,111,110,115,109,111,110,105,116,111,114,32,39
+,39,84,104,101,32,119,105,110,110,105,110,103,101,120,112,108,111,114,101,97,100
+,97,112,116,101,100,71,97,108,108,101,114,121,112,114,111,100,117,99,101,97,98,
+105,108,105,116,121,101,110,104,97,110,99,101,99,97,114,101,101,114,115,41,46,32
+,84,104,101,32,99,111,108,108,101,99,116,83,101,97,114,99,104,32,97,110,99,105,
+101,110,116,101,120,105,115,116,101,100,102,111,111,116,101,114,32,104,97,110,
+100,108,101,114,112,114,105,110,116,101,100,99,111,110,115,111,108,101,69,97,115
+,116,101,114,110,101,120,112,111,114,116,115,119,105,110,100,111,119,115,67,104,
+97,110,110,101,108,105,108,108,101,103,97,108,110,101,117,116,114,97,108,115,117
+,103,103,101,115,116,95,104,101,97,100,101,114,115,105,103,110,105,110,103,46,
+104,116,109,108,34,62,115,101,116,116,108,101,100,119,101,115,116,101,114,110,99
+,97,117,115,105,110,103,45,119,101,98,107,105,116,99,108,97,105,109,101,100,74,
+117,115,116,105,99,101,99,104,97,112,116,101,114,118,105,99,116,105,109,115,84,
+104,111,109,97,115,32,109,111,122,105,108,108,97,112,114,111,109,105,115,101,112
+,97,114,116,105,101,115,101,100,105,116,105,111,110,111,117,116,115,105,100,101,
+58,102,97,108,115,101,44,104,117,110,100,114,101,100,79,108,121,109,112,105,99,
+95,98,117,116,116,111,110,97,117,116,104,111,114,115,114,101,97,99,104,101,100,
+99,104,114,111,110,105,99,100,101,109,97,110,100,115,115,101,99,111,110,100,115,
+112,114,111,116,101,99,116,97,100,111,112,116,101,100,112,114,101,112,97,114,101
+,110,101,105,116,104,101,114,103,114,101,97,116,108,121,103,114,101,97,116,101,
+114,111,118,101,114,97,108,108,105,109,112,114,111,118,101,99,111,109,109,97,110
+,100,115,112,101,99,105,97,108,115,101,97,114,99,104,46,119,111,114,115,104,105,
+112,102,117,110,100,105,110,103,116,104,111,117,103,104,116,104,105,103,104,101,
+115,116,105,110,115,116,101,97,100,117,116,105,108,105,116,121,113,117,97,114,
+116,101,114,67,117,108,116,117,114,101,116,101,115,116,105,110,103,99,108,101,97
+,114,108,121,101,120,112,111,115,101,100,66,114,111,119,115,101,114,108,105,98,
+101,114,97,108,125,32,99,97,116,99,104,80,114,111,106,101,99,116,101,120,97,109,
+112,108,101,104,105,100,101,40,41,59,70,108,111,114,105,100,97,97,110,115,119,
+101,114,115,97,108,108,111,119,101,100,69,109,112,101,114,111,114,100,101,102,
+101,110,115,101,115,101,114,105,111,117,115,102,114,101,101,100,111,109,83,101,
+118,101,114,97,108,45,98,117,116,116,111,110,70,117,114,116,104,101,114,111,117,
+116,32,111,102,32,33,61,32,110,117,108,108,116,114,97,105,110,101,100,68,101,110
+,109,97,114,107,118,111,105,100,40,48,41,47,97,108,108,46,106,115,112,114,101,
+118,101,110,116,82,101,113,117,101,115,116,83,116,101,112,104,101,110,10,10,87,
+104,101,110,32,111,98,115,101,114,118,101,60,47,104,50,62,13,10,77,111,100,101,
+114,110,32,112,114,111,118,105,100,101,34,32,97,108,116,61,34,98,111,114,100,101
+,114,115,46,10,10,70,111,114,32,10,10,77,97,110,121,32,97,114,116,105,115,116,
+115,112,111,119,101,114,101,100,112,101,114,102,111,114,109,102,105,99,116,105,
+111,110,116,121,112,101,32,111,102,109,101,100,105,99,97,108,116,105,99,107,101,
+116,115,111,112,112,111,115,101,100,67,111,117,110,99,105,108,119,105,116,110,
+101,115,115,106,117,115,116,105,99,101,71,101,111,114,103,101,32,66,101,108,103,
+105,117,109,46,46,46,60,47,97,62,116,119,105,116,116,101,114,110,111,116,97,98,
+108,121,119,97,105,116,105,110,103,119,97,114,102,97,114,101,32,79,116,104,101,
+114,32,114,97,110,107,105,110,103,112,104,114,97,115,101,115,109,101,110,116,105
+,111,110,115,117,114,118,105,118,101,115,99,104,111,108,97,114,60,47,112,62,13,
+10,32,67,111,117,110,116,114,121,105,103,110,111,114,101,100,108,111,115,115,32,
+111,102,106,117,115,116,32,97,115,71,101,111,114,103,105,97,115,116,114,97,110,
+103,101,60,104,101,97,100,62,60,115,116,111,112,112,101,100,49,39,93,41,59,13,10
+,105,115,108,97,110,100,115,110,111,116,97,98,108,101,98,111,114,100,101,114,58,
+108,105,115,116,32,111,102,99,97,114,114,105,101,100,49,48,48,44,48,48,48,60,47,
+104,51,62,10,32,115,101,118,101,114,97,108,98,101,99,111,109,101,115,115,101,108
+,101,99,116,32,119,101,100,100,105,110,103,48,48,46,104,116,109,108,109,111,110,
+97,114,99,104,111,102,102,32,116,104,101,116,101,97,99,104,101,114,104,105,103,
+104,108,121,32,98,105,111,108,111,103,121,108,105,102,101,32,111,102,111,114,32,
+101,118,101,110,114,105,115,101,32,111,102,38,114,97,113,117,111,59,112,108,117,
+115,111,110,101,104,117,110,116,105,110,103,40,116,104,111,117,103,104,68,111,
+117,103,108,97,115,106,111,105,110,105,110,103,99,105,114,99,108,101,115,70,111,
+114,32,116,104,101,65,110,99,105,101,110,116,86,105,101,116,110,97,109,118,101,
+104,105,99,108,101,115,117,99,104,32,97,115,99,114,121,115,116,97,108,118,97,108
+,117,101,32,61,87,105,110,100,111,119,115,101,110,106,111,121,101,100,97,32,115,
+109,97,108,108,97,115,115,117,109,101,100,60,97,32,105,100,61,34,102,111,114,101
+,105,103,110,32,65,108,108,32,114,105,104,111,119,32,116,104,101,68,105,115,112,
+108,97,121,114,101,116,105,114,101,100,104,111,119,101,118,101,114,104,105,100,
+100,101,110,59,98,97,116,116,108,101,115,115,101,101,107,105,110,103,99,97,98,
+105,110,101,116,119,97,115,32,110,111,116,108,111,111,107,32,97,116,99,111,110,
+100,117,99,116,103,101,116,32,116,104,101,74,97,110,117,97,114,121,104,97,112,
+112,101,110,115,116,117,114,110,105,110,103,97,58,104,111,118,101,114,79,110,108
+,105,110,101,32,70,114,101,110,99,104,32,108,97,99,107,105,110,103,116,121,112,
+105,99,97,108,101,120,116,114,97,99,116,101,110,101,109,105,101,115,101,118,101,
+110,32,105,102,103,101,110,101,114,97,116,100,101,99,105,100,101,100,97,114,101,
+32,110,111,116,47,115,101,97,114,99,104,98,101,108,105,101,102,115,45,105,109,97
+,103,101,58,108,111,99,97,116,101,100,115,116,97,116,105,99,46,108,111,103,105,
+110,34,62,99,111,110,118,101,114,116,118,105,111,108,101,110,116,101,110,116,101
+,114,101,100,102,105,114,115,116,34,62,99,105,114,99,117,105,116,70,105,110,108,
+97,110,100,99,104,101,109,105,115,116,115,104,101,32,119,97,115,49,48,112,120,59
+,34,62,97,115,32,115,117,99,104,100,105,118,105,100,101,100,60,47,115,112,97,110
+,62,119,105,108,108,32,98,101,108,105,110,101,32,111,102,97,32,103,114,101,97,
+116,109,121,115,116,101,114,121,47,105,110,100,101,120,46,102,97,108,108,105,110
+,103,100,117,101,32,116,111,32,114,97,105,108,119,97,121,99,111,108,108,101,103,
+101,109,111,110,115,116,101,114,100,101,115,99,101,110,116,105,116,32,119,105,
+116,104,110,117,99,108,101,97,114,74,101,119,105,115,104,32,112,114,111,116,101,
+115,116,66,114,105,116,105,115,104,102,108,111,119,101,114,115,112,114,101,100,
+105,99,116,114,101,102,111,114,109,115,98,117,116,116,111,110,32,119,104,111,32,
+119,97,115,108,101,99,116,117,114,101,105,110,115,116,97,110,116,115,117,105,99,
+105,100,101,103,101,110,101,114,105,99,112,101,114,105,111,100,115,109,97,114,
+107,101,116,115,83,111,99,105,97,108,32,102,105,115,104,105,110,103,99,111,109,
+98,105,110,101,103,114,97,112,104,105,99,119,105,110,110,101,114,115,60,98,114,
+32,47,62,60,98,121,32,116,104,101,32,78,97,116,117,114,97,108,80,114,105,118,97,
+99,121,99,111,111,107,105,101,115,111,117,116,99,111,109,101,114,101,115,111,108
+,118,101,83,119,101,100,105,115,104,98,114,105,101,102,108,121,80,101,114,115,
+105,97,110,115,111,32,109,117,99,104,67,101,110,116,117,114,121,100,101,112,105,
+99,116,115,99,111,108,117,109,110,115,104,111,117,115,105,110,103,115,99,114,105
+,112,116,115,110,101,120,116,32,116,111,98,101,97,114,105,110,103,109,97,112,112
+,105,110,103,114,101,118,105,115,101,100,106,81,117,101,114,121,40,45,119,105,
+100,116,104,58,116,105,116,108,101,34,62,116,111,111,108,116,105,112,83,101,99,
+116,105,111,110,100,101,115,105,103,110,115,84,117,114,107,105,115,104,121,111,
+117,110,103,101,114,46,109,97,116,99,104,40,125,41,40,41,59,10,10,98,117,114,110
+,105,110,103,111,112,101,114,97,116,101,100,101,103,114,101,101,115,115,111,117,
+114,99,101,61,82,105,99,104,97,114,100,99,108,111,115,101,108,121,112,108,97,115
+,116,105,99,101,110,116,114,105,101,115,60,47,116,114,62,13,10,99,111,108,111,
+114,58,35,117,108,32,105,100,61,34,112,111,115,115,101,115,115,114,111,108,108,
+105,110,103,112,104,121,115,105,99,115,102,97,105,108,105,110,103,101,120,101,99
+,117,116,101,99,111,110,116,101,115,116,108,105,110,107,32,116,111,68,101,102,97
+,117,108,116,60,98,114,32,47,62,10,58,32,116,114,117,101,44,99,104,97,114,116,
+101,114,116,111,117,114,105,115,109,99,108,97,115,115,105,99,112,114,111,99,101,
+101,100,101,120,112,108,97,105,110,60,47,104,49,62,13,10,111,110,108,105,110,101
+,46,63,120,109,108,32,118,101,104,101,108,112,105,110,103,100,105,97,109,111,110
+,100,117,115,101,32,116,104,101,97,105,114,108,105,110,101,101,110,100,32,45,45,
+62,41,46,97,116,116,114,40,114,101,97,100,101,114,115,104,111,115,116,105,110,
+103,35,102,102,102,102,102,102,114,101,97,108,105,122,101,86,105,110,99,101,110,
+116,115,105,103,110,97,108,115,32,115,114,99,61,34,47,80,114,111,100,117,99,116,
+100,101,115,112,105,116,101,100,105,118,101,114,115,101,116,101,108,108,105,110,
+103,80,117,98,108,105,99,32,104,101,108,100,32,105,110,74,111,115,101,112,104,32
+,116,104,101,97,116,114,101,97,102,102,101,99,116,115,60,115,116,121,108,101,62,
+97,32,108,97,114,103,101,100,111,101,115,110,39,116,108,97,116,101,114,44,32,69,
+108,101,109,101,110,116,102,97,118,105,99,111,110,99,114,101,97,116,111,114,72,
+117,110,103,97,114,121,65,105,114,112,111,114,116,115,101,101,32,116,104,101,115
+,111,32,116,104,97,116,77,105,99,104,97,101,108,83,121,115,116,101,109,115,80,
+114,111,103,114,97,109,115,44,32,97,110,100,32,32,119,105,100,116,104,61,101,38,
+113,117,111,116,59,116,114,97,100,105,110,103,108,101,102,116,34,62,10,112,101,
+114,115,111,110,115,71,111,108,100,101,110,32,65,102,102,97,105,114,115,103,114,
+97,109,109,97,114,102,111,114,109,105,110,103,100,101,115,116,114,111,121,105,
+100,101,97,32,111,102,99,97,115,101,32,111,102,111,108,100,101,115,116,32,116,
+104,105,115,32,105,115,46,115,114,99,32,61,32,99,97,114,116,111,111,110,114,101,
+103,105,115,116,114,67,111,109,109,111,110,115,77,117,115,108,105,109,115,87,104
+,97,116,32,105,115,105,110,32,109,97,110,121,109,97,114,107,105,110,103,114,101,
+118,101,97,108,115,73,110,100,101,101,100,44,101,113,117,97,108,108,121,47,115,
+104,111,119,95,97,111,117,116,100,111,111,114,101,115,99,97,112,101,40,65,117,
+115,116,114,105,97,103,101,110,101,116,105,99,115,121,115,116,101,109,44,73,110,
+32,116,104,101,32,115,105,116,116,105,110,103,72,101,32,97,108,115,111,73,115,
+108,97,110,100,115,65,99,97,100,101,109,121,10,9,9,60,33,45,45,68,97,110,105,101
+,108,32,98,105,110,100,105,110,103,98,108,111,99,107,34,62,105,109,112,111,115,
+101,100,117,116,105,108,105,122,101,65,98,114,97,104,97,109,40,101,120,99,101,
+112,116,123,119,105,100,116,104,58,112,117,116,116,105,110,103,41,46,104,116,109
+,108,40,124,124,32,91,93,59,10,68,65,84,65,91,32,42,107,105,116,99,104,101,110,
+109,111,117,110,116,101,100,97,99,116,117,97,108,32,100,105,97,108,101,99,116,
+109,97,105,110,108,121,32,95,98,108,97,110,107,39,105,110,115,116,97,108,108,101
+,120,112,101,114,116,115,105,102,40,116,121,112,101,73,116,32,97,108,115,111,38,
+99,111,112,121,59,32,34,62,84,101,114,109,115,98,111,114,110,32,105,110,79,112,
+116,105,111,110,115,101,97,115,116,101,114,110,116,97,108,107,105,110,103,99,111
+,110,99,101,114,110,103,97,105,110,101,100,32,111,110,103,111,105,110,103,106,
+117,115,116,105,102,121,99,114,105,116,105,99,115,102,97,99,116,111,114,121,105,
+116,115,32,111,119,110,97,115,115,97,117,108,116,105,110,118,105,116,101,100,108
+,97,115,116,105,110,103,104,105,115,32,111,119,110,104,114,101,102,61,34,47,34,
+32,114,101,108,61,34,100,101,118,101,108,111,112,99,111,110,99,101,114,116,100,
+105,97,103,114,97,109,100,111,108,108,97,114,115,99,108,117,115,116,101,114,112,
+104,112,63,105,100,61,97,108,99,111,104,111,108,41,59,125,41,40,41,59,117,115,
+105,110,103,32,97,62,60,115,112,97,110,62,118,101,115,115,101,108,115,114,101,
+118,105,118,97,108,65,100,100,114,101,115,115,97,109,97,116,101,117,114,97,110,
+100,114,111,105,100,97,108,108,101,103,101,100,105,108,108,110,101,115,115,119,
+97,108,107,105,110,103,99,101,110,116,101,114,115,113,117,97,108,105,102,121,109
+,97,116,99,104,101,115,117,110,105,102,105,101,100,101,120,116,105,110,99,116,68
+,101,102,101,110,115,101,100,105,101,100,32,105,110,10,9,60,33,45,45,32,99,117,
+115,116,111,109,115,108,105,110,107,105,110,103,76,105,116,116,108,101,32,66,111
+,111,107,32,111,102,101,118,101,110,105,110,103,109,105,110,46,106,115,63,97,114
+,101,32,116,104,101,107,111,110,116,97,107,116,116,111,100,97,121,39,115,46,104,
+116,109,108,34,32,116,97,114,103,101,116,61,119,101,97,114,105,110,103,65,108,
+108,32,82,105,103,59,10,125,41,40,41,59,114,97,105,115,105,110,103,32,65,108,115
+,111,44,32,99,114,117,99,105,97,108,97,98,111,117,116,34,62,100,101,99,108,97,
+114,101,45,45,62,10,60,115,99,102,105,114,101,102,111,120,97,115,32,109,117,99,
+104,97,112,112,108,105,101,115,105,110,100,101,120,44,32,115,44,32,98,117,116,32
+,116,121,112,101,32,61,32,10,13,10,60,33,45,45,116,111,119,97,114,100,115,82,101
+,99,111,114,100,115,80,114,105,118,97,116,101,70,111,114,101,105,103,110,80,114,
+101,109,105,101,114,99,104,111,105,99,101,115,86,105,114,116,117,97,108,114,101,
+116,117,114,110,115,67,111,109,109,101,110,116,80,111,119,101,114,101,100,105,
+110,108,105,110,101,59,112,111,118,101,114,116,121,99,104,97,109,98,101,114,76,
+105,118,105,110,103,32,118,111,108,117,109,101,115,65,110,116,104,111,110,121,
+108,111,103,105,110,34,32,82,101,108,97,116,101,100,69,99,111,110,111,109,121,
+114,101,97,99,104,101,115,99,117,116,116,105,110,103,103,114,97,118,105,116,121,
+108,105,102,101,32,105,110,67,104,97,112,116,101,114,45,115,104,97,100,111,119,
+78,111,116,97,98,108,101,60,47,116,100,62,13,10,32,114,101,116,117,114,110,115,
+116,97,100,105,117,109,119,105,100,103,101,116,115,118,97,114,121,105,110,103,
+116,114,97,118,101,108,115,104,101,108,100,32,98,121,119,104,111,32,97,114,101,
+119,111,114,107,32,105,110,102,97,99,117,108,116,121,97,110,103,117,108,97,114,
+119,104,111,32,104,97,100,97,105,114,112,111,114,116,116,111,119,110,32,111,102,
+10,10,83,111,109,101,32,39,99,108,105,99,107,39,99,104,97,114,103,101,115,107,
+101,121,119,111,114,100,105,116,32,119,105,108,108,99,105,116,121,32,111,102,40,
+116,104,105,115,41,59,65,110,100,114,101,119,32,117,110,105,113,117,101,32,99,
+104,101,99,107,101,100,111,114,32,109,111,114,101,51,48,48,112,120,59,32,114,101
+,116,117,114,110,59,114,115,105,111,110,61,34,112,108,117,103,105,110,115,119,
+105,116,104,105,110,32,104,101,114,115,101,108,102,83,116,97,116,105,111,110,70,
+101,100,101,114,97,108,118,101,110,116,117,114,101,112,117,98,108,105,115,104,
+115,101,110,116,32,116,111,116,101,110,115,105,111,110,97,99,116,114,101,115,115
+,99,111,109,101,32,116,111,102,105,110,103,101,114,115,68,117,107,101,32,111,102
+,112,101,111,112,108,101,44,101,120,112,108,111,105,116,119,104,97,116,32,105,
+115,104,97,114,109,111,110,121,97,32,109,97,106,111,114,34,58,34,104,116,116,112
+,105,110,32,104,105,115,32,109,101,110,117,34,62,10,109,111,110,116,104,108,121,
+111,102,102,105,99,101,114,99,111,117,110,99,105,108,103,97,105,110,105,110,103,
+101,118,101,110,32,105,110,83,117,109,109,97,114,121,100,97,116,101,32,111,102,
+108,111,121,97,108,116,121,102,105,116,110,101,115,115,97,110,100,32,119,97,115,
+101,109,112,101,114,111,114,115,117,112,114,101,109,101,83,101,99,111,110,100,32
+,104,101,97,114,105,110,103,82,117,115,115,105,97,110,108,111,110,103,101,115,
+116,65,108,98,101,114,116,97,108,97,116,101,114,97,108,115,101,116,32,111,102,32
+,115,109,97,108,108,34,62,46,97,112,112,101,110,100,100,111,32,119,105,116,104,
+102,101,100,101,114,97,108,98,97,110,107,32,111,102,98,101,110,101,97,116,104,68
+,101,115,112,105,116,101,67,97,112,105,116,97,108,103,114,111,117,110,100,115,41
+,44,32,97,110,100,32,112,101,114,99,101,110,116,105,116,32,102,114,111,109,99,
+108,111,115,105,110,103,99,111,110,116,97,105,110,73,110,115,116,101,97,100,102,
+105,102,116,101,101,110,97,115,32,119,101,108,108,46,121,97,104,111,111,46,114,
+101,115,112,111,110,100,102,105,103,104,116,101,114,111,98,115,99,117,114,101,
+114,101,102,108,101,99,116,111,114,103,97,110,105,99,61,32,77,97,116,104,46,101,
+100,105,116,105,110,103,111,110,108,105,110,101,32,112,97,100,100,105,110,103,97
+,32,119,104,111,108,101,111,110,101,114,114,111,114,121,101,97,114,32,111,102,
+101,110,100,32,111,102,32,98,97,114,114,105,101,114,119,104,101,110,32,105,116,
+104,101,97,100,101,114,32,104,111,109,101,32,111,102,114,101,115,117,109,101,100
+,114,101,110,97,109,101,100,115,116,114,111,110,103,62,104,101,97,116,105,110,
+103,114,101,116,97,105,110,115,99,108,111,117,100,102,114,119,97,121,32,111,102,
+32,77,97,114,99,104,32,49,107,110,111,119,105,110,103,105,110,32,112,97,114,116,
+66,101,116,119,101,101,110,108,101,115,115,111,110,115,99,108,111,115,101,115,
+116,118,105,114,116,117,97,108,108,105,110,107,115,34,62,99,114,111,115,115,101,
+100,69,78,68,32,45,45,62,102,97,109,111,117,115,32,97,119,97,114,100,101,100,76,
+105,99,101,110,115,101,72,101,97,108,116,104,32,102,97,105,114,108,121,32,119,
+101,97,108,116,104,121,109,105,110,105,109,97,108,65,102,114,105,99,97,110,99,
+111,109,112,101,116,101,108,97,98,101,108,34,62,115,105,110,103,105,110,103,102,
+97,114,109,101,114,115,66,114,97,115,105,108,41,100,105,115,99,117,115,115,114,
+101,112,108,97,99,101,71,114,101,103,111,114,121,102,111,110,116,32,99,111,112,
+117,114,115,117,101,100,97,112,112,101,97,114,115,109,97,107,101,32,117,112,114,
+111,117,110,100,101,100,98,111,116,104,32,111,102,98,108,111,99,107,101,100,115,
+97,119,32,116,104,101,111,102,102,105,99,101,115,99,111,108,111,117,114,115,105,
+102,40,100,111,99,117,119,104,101,110,32,104,101,101,110,102,111,114,99,101,112,
+117,115,104,40,102,117,65,117,103,117,115,116,32,85,84,70,45,56,34,62,70,97,110,
+116,97,115,121,105,110,32,109,111,115,116,105,110,106,117,114,101,100,85,115,117
+,97,108,108,121,102,97,114,109,105,110,103,99,108,111,115,117,114,101,111,98,106
+,101,99,116,32,100,101,102,101,110,99,101,117,115,101,32,111,102,32,77,101,100,
+105,99,97,108,60,98,111,100,121,62,10,101,118,105,100,101,110,116,98,101,32,117,
+115,101,100,107,101,121,67,111,100,101,115,105,120,116,101,101,110,73,115,108,97
+,109,105,99,35,48,48,48,48,48,48,101,110,116,105,114,101,32,119,105,100,101,108,
+121,32,97,99,116,105,118,101,32,40,116,121,112,101,111,102,111,110,101,32,99,97,
+110,99,111,108,111,114,32,61,115,112,101,97,107,101,114,101,120,116,101,110,100,
+115,80,104,121,115,105,99,115,116,101,114,114,97,105,110,60,116,98,111,100,121,
+62,102,117,110,101,114,97,108,118,105,101,119,105,110,103,109,105,100,100,108,
+101,32,99,114,105,99,107,101,116,112,114,111,112,104,101,116,115,104,105,102,116
+,101,100,100,111,99,116,111,114,115,82,117,115,115,101,108,108,32,116,97,114,103
+,101,116,99,111,109,112,97,99,116,97,108,103,101,98,114,97,115,111,99,105,97,108
+,45,98,117,108,107,32,111,102,109,97,110,32,97,110,100,60,47,116,100,62,10,32,
+104,101,32,108,101,102,116,41,46,118,97,108,40,41,102,97,108,115,101,41,59,108,
+111,103,105,99,97,108,98,97,110,107,105,110,103,104,111,109,101,32,116,111,110,
+97,109,105,110,103,32,65,114,105,122,111,110,97,99,114,101,100,105,116,115,41,59
+,10,125,41,59,10,102,111,117,110,100,101,114,105,110,32,116,117,114,110,67,111,
+108,108,105,110,115,98,101,102,111,114,101,32,66,117,116,32,116,104,101,99,104,
+97,114,103,101,100,84,105,116,108,101,34,62,67,97,112,116,97,105,110,115,112,101
+,108,108,101,100,103,111,100,100,101,115,115,84,97,103,32,45,45,62,65,100,100,
+105,110,103,58,98,117,116,32,119,97,115,82,101,99,101,110,116,32,112,97,116,105,
+101,110,116,98,97,99,107,32,105,110,61,102,97,108,115,101,38,76,105,110,99,111,
+108,110,119,101,32,107,110,111,119,67,111,117,110,116,101,114,74,117,100,97,105,
+115,109,115,99,114,105,112,116,32,97,108,116,101,114,101,100,39,93,41,59,10,32,
+32,104,97,115,32,116,104,101,117,110,99,108,101,97,114,69,118,101,110,116,39,44,
+98,111,116,104,32,105,110,110,111,116,32,97,108,108,10,10,60,33,45,45,32,112,108
+,97,99,105,110,103,104,97,114,100,32,116,111,32,99,101,110,116,101,114,115,111,
+114,116,32,111,102,99,108,105,101,110,116,115,115,116,114,101,101,116,115,66,101
+,114,110,97,114,100,97,115,115,101,114,116,115,116,101,110,100,32,116,111,102,97
+,110,116,97,115,121,100,111,119,110,32,105,110,104,97,114,98,111,117,114,70,114,
+101,101,100,111,109,106,101,119,101,108,114,121,47,97,98,111,117,116,46,46,115,
+101,97,114,99,104,108,101,103,101,110,100,115,105,115,32,109,97,100,101,109,111,
+100,101,114,110,32,111,110,108,121,32,111,110,111,110,108,121,32,116,111,105,109
+,97,103,101,34,32,108,105,110,101,97,114,32,112,97,105,110,116,101,114,97,110,
+100,32,110,111,116,114,97,114,101,108,121,32,97,99,114,111,110,121,109,100,101,
+108,105,118,101,114,115,104,111,114,116,101,114,48,48,38,97,109,112,59,97,115,32
+,109,97,110,121,119,105,100,116,104,61,34,47,42,32,60,33,91,67,116,105,116,108,
+101,32,61,111,102,32,116,104,101,32,108,111,119,101,115,116,32,112,105,99,107,
+101,100,32,101,115,99,97,112,101,100,117,115,101,115,32,111,102,112,101,111,112,
+108,101,115,32,80,117,98,108,105,99,77,97,116,116,104,101,119,116,97,99,116,105,
+99,115,100,97,109,97,103,101,100,119,97,121,32,102,111,114,108,97,119,115,32,111
+,102,101,97,115,121,32,116,111,32,119,105,110,100,111,119,115,116,114,111,110,
+103,32,32,115,105,109,112,108,101,125,99,97,116,99,104,40,115,101,118,101,110,
+116,104,105,110,102,111,98,111,120,119,101,110,116,32,116,111,112,97,105,110,116
+,101,100,99,105,116,105,122,101,110,73,32,100,111,110,39,116,114,101,116,114,101
+,97,116,46,32,83,111,109,101,32,119,119,46,34,41,59,10,98,111,109,98,105,110,103
+,109,97,105,108,116,111,58,109,97,100,101,32,105,110,46,32,77,97,110,121,32,99,
+97,114,114,105,101,115,124,124,123,125,59,119,105,119,111,114,107,32,111,102,115
+,121,110,111,110,121,109,100,101,102,101,97,116,115,102,97,118,111,114,101,100,
+111,112,116,105,99,97,108,112,97,103,101,84,114,97,117,110,108,101,115,115,32,
+115,101,110,100,105,110,103,108,101,102,116,34,62,60,99,111,109,83,99,111,114,65
+,108,108,32,116,104,101,106,81,117,101,114,121,46,116,111,117,114,105,115,116,67
+,108,97,115,115,105,99,102,97,108,115,101,34,32,87,105,108,104,101,108,109,115,
+117,98,117,114,98,115,103,101,110,117,105,110,101,98,105,115,104,111,112,115,46,
+115,112,108,105,116,40,103,108,111,98,97,108,32,102,111,108,108,111,119,115,98,
+111,100,121,32,111,102,110,111,109,105,110,97,108,67,111,110,116,97,99,116,115,
+101,99,117,108,97,114,108,101,102,116,32,116,111,99,104,105,101,102,108,121,45,
+104,105,100,100,101,110,45,98,97,110,110,101,114,60,47,108,105,62,10,10,46,32,87
+,104,101,110,32,105,110,32,98,111,116,104,100,105,115,109,105,115,115,69,120,112
+,108,111,114,101,97,108,119,97,121,115,32,118,105,97,32,116,104,101,115,112,97,
+195,177,111,108,119,101,108,102,97,114,101,114,117,108,105,110,103,32,97,114,114
+,97,110,103,101,99,97,112,116,97,105,110,104,105,115,32,115,111,110,114,117,108,
+101,32,111,102,104,101,32,116,111,111,107,105,116,115,101,108,102,44,61,48,38,97
+,109,112,59,40,99,97,108,108,101,100,115,97,109,112,108,101,115,116,111,32,109,
+97,107,101,99,111,109,47,112,97,103,77,97,114,116,105,110,32,75,101,110,110,101,
+100,121,97,99,99,101,112,116,115,102,117,108,108,32,111,102,104,97,110,100,108,
+101,100,66,101,115,105,100,101,115,47,47,45,45,62,60,47,97,98,108,101,32,116,111
+,116,97,114,103,101,116,115,101,115,115,101,110,99,101,104,105,109,32,116,111,32
+,105,116,115,32,98,121,32,99,111,109,109,111,110,46,109,105,110,101,114,97,108,
+116,111,32,116,97,107,101,119,97,121,115,32,116,111,115,46,111,114,103,47,108,97
+,100,118,105,115,101,100,112,101,110,97,108,116,121,115,105,109,112,108,101,58,
+105,102,32,116,104,101,121,76,101,116,116,101,114,115,97,32,115,104,111,114,116,
+72,101,114,98,101,114,116,115,116,114,105,107,101,115,32,103,114,111,117,112,115
+,46,108,101,110,103,116,104,102,108,105,103,104,116,115,111,118,101,114,108,97,
+112,115,108,111,119,108,121,32,108,101,115,115,101,114,32,115,111,99,105,97,108,
+32,60,47,112,62,10,9,9,105,116,32,105,110,116,111,114,97,110,107,101,100,32,114,
+97,116,101,32,111,102,117,108,62,13,10,32,32,97,116,116,101,109,112,116,112,97,
+105,114,32,111,102,109,97,107,101,32,105,116,75,111,110,116,97,107,116,65,110,
+116,111,110,105,111,104,97,118,105,110,103,32,114,97,116,105,110,103,115,32,97,
+99,116,105,118,101,115,116,114,101,97,109,115,116,114,97,112,112,101,100,34,41,
+46,99,115,115,40,104,111,115,116,105,108,101,108,101,97,100,32,116,111,108,105,
+116,116,108,101,32,103,114,111,117,112,115,44,80,105,99,116,117,114,101,45,45,62
+,13,10,13,10,32,114,111,119,115,61,34,32,111,98,106,101,99,116,105,110,118,101,
+114,115,101,60,102,111,111,116,101,114,67,117,115,116,111,109,86,62,60,92,47,115
+,99,114,115,111,108,118,105,110,103,67,104,97,109,98,101,114,115,108,97,118,101,
+114,121,119,111,117,110,100,101,100,119,104,101,114,101,97,115,33,61,32,39,117,
+110,100,102,111,114,32,97,108,108,112,97,114,116,108,121,32,45,114,105,103,104,
+116,58,65,114,97,98,105,97,110,98,97,99,107,101,100,32,99,101,110,116,117,114,
+121,117,110,105,116,32,111,102,109,111,98,105,108,101,45,69,117,114,111,112,101,
+44,105,115,32,104,111,109,101,114,105,115,107,32,111,102,100,101,115,105,114,101
+,100,67,108,105,110,116,111,110,99,111,115,116,32,111,102,97,103,101,32,111,102,
+32,98,101,99,111,109,101,32,110,111,110,101,32,111,102,112,38,113,117,111,116,59
+,77,105,100,100,108,101,32,101,97,100,39,41,91,48,67,114,105,116,105,99,115,115,
+116,117,100,105,111,115,62,38,99,111,112,121,59,103,114,111,117,112,34,62,97,115
+,115,101,109,98,108,109,97,107,105,110,103,32,112,114,101,115,115,101,100,119,
+105,100,103,101,116,46,112,115,58,34,32,63,32,114,101,98,117,105,108,116,98,121,
+32,115,111,109,101,70,111,114,109,101,114,32,101,100,105,116,111,114,115,100,101
+,108,97,121,101,100,67,97,110,111,110,105,99,104,97,100,32,116,104,101,112,117,
+115,104,105,110,103,99,108,97,115,115,61,34,98,117,116,32,97,114,101,112,97,114,
+116,105,97,108,66,97,98,121,108,111,110,98,111,116,116,111,109,32,99,97,114,114,
+105,101,114,67,111,109,109,97,110,100,105,116,115,32,117,115,101,65,115,32,119,
+105,116,104,99,111,117,114,115,101,115,97,32,116,104,105,114,100,100,101,110,111
+,116,101,115,97,108,115,111,32,105,110,72,111,117,115,116,111,110,50,48,112,120,
+59,34,62,97,99,99,117,115,101,100,100,111,117,98,108,101,32,103,111,97,108,32,
+111,102,70,97,109,111,117,115,32,41,46,98,105,110,100,40,112,114,105,101,115,116
+,115,32,79,110,108,105,110,101,105,110,32,74,117,108,121,115,116,32,43,32,34,103
+,99,111,110,115,117,108,116,100,101,99,105,109,97,108,104,101,108,112,102,117,
+108,114,101,118,105,118,101,100,105,115,32,118,101,114,121,114,39,43,39,105,112,
+116,108,111,115,105,110,103,32,102,101,109,97,108,101,115,105,115,32,97,108,115,
+111,115,116,114,105,110,103,115,100,97,121,115,32,111,102,97,114,114,105,118,97,
+108,102,117,116,117,114,101,32,60,111,98,106,101,99,116,102,111,114,99,105,110,
+103,83,116,114,105,110,103,40,34,32,47,62,10,9,9,104,101,114,101,32,105,115,101,
+110,99,111,100,101,100,46,32,32,84,104,101,32,98,97,108,108,111,111,110,100,111,
+110,101,32,98,121,47,99,111,109,109,111,110,98,103,99,111,108,111,114,108,97,119
+,32,111,102,32,73,110,100,105,97,110,97,97,118,111,105,100,101,100,98,117,116,32
+,116,104,101,50,112,120,32,51,112,120,106,113,117,101,114,121,46,97,102,116,101,
+114,32,97,112,111,108,105,99,121,46,109,101,110,32,97,110,100,102,111,111,116,
+101,114,45,61,32,116,114,117,101,59,102,111,114,32,117,115,101,115,99,114,101,
+101,110,46,73,110,100,105,97,110,32,105,109,97,103,101,32,61,102,97,109,105,108,
+121,44,104,116,116,112,58,47,47,32,38,110,98,115,112,59,100,114,105,118,101,114,
+115,101,116,101,114,110,97,108,115,97,109,101,32,97,115,110,111,116,105,99,101,
+100,118,105,101,119,101,114,115,125,41,40,41,59,10,32,105,115,32,109,111,114,101
+,115,101,97,115,111,110,115,102,111,114,109,101,114,32,116,104,101,32,110,101,
+119,105,115,32,106,117,115,116,99,111,110,115,101,110,116,32,83,101,97,114,99,
+104,119,97,115,32,116,104,101,119,104,121,32,116,104,101,115,104,105,112,112,101
+,100,98,114,62,60,98,114,62,119,105,100,116,104,58,32,104,101,105,103,104,116,61
+,109,97,100,101,32,111,102,99,117,105,115,105,110,101,105,115,32,116,104,97,116,
+97,32,118,101,114,121,32,65,100,109,105,114,97,108,32,102,105,120,101,100,59,110
+,111,114,109,97,108,32,77,105,115,115,105,111,110,80,114,101,115,115,44,32,111,
+110,116,97,114,105,111,99,104,97,114,115,101,116,116,114,121,32,116,111,32,105,
+110,118,97,100,101,100,61,34,116,114,117,101,34,115,112,97,99,105,110,103,105,
+115,32,109,111,115,116,97,32,109,111,114,101,32,116,111,116,97,108,108,121,102,
+97,108,108,32,111,102,125,41,59,13,10,32,32,105,109,109,101,110,115,101,116,105,
+109,101,32,105,110,115,101,116,32,111,117,116,115,97,116,105,115,102,121,116,111
+,32,102,105,110,100,100,111,119,110,32,116,111,108,111,116,32,111,102,32,80,108,
+97,121,101,114,115,105,110,32,74,117,110,101,113,117,97,110,116,117,109,110,111,
+116,32,116,104,101,116,105,109,101,32,116,111,100,105,115,116,97,110,116,70,105,
+110,110,105,115,104,115,114,99,32,61,32,40,115,105,110,103,108,101,32,104,101,
+108,112,32,111,102,71,101,114,109,97,110,32,108,97,119,32,97,110,100,108,97,98,
+101,108,101,100,102,111,114,101,115,116,115,99,111,111,107,105,110,103,115,112,
+97,99,101,34,62,104,101,97,100,101,114,45,119,101,108,108,32,97,115,83,116,97,
+110,108,101,121,98,114,105,100,103,101,115,47,103,108,111,98,97,108,67,114,111,
+97,116,105,97,32,65,98,111,117,116,32,91,48,93,59,10,32,32,105,116,44,32,97,110,
+100,103,114,111,117,112,101,100,98,101,105,110,103,32,97,41,123,116,104,114,111,
+119,104,101,32,109,97,100,101,108,105,103,104,116,101,114,101,116,104,105,99,97,
+108,70,70,70,70,70,70,34,98,111,116,116,111,109,34,108,105,107,101,32,97,32,101,
+109,112,108,111,121,115,108,105,118,101,32,105,110,97,115,32,115,101,101,110,112
+,114,105,110,116,101,114,109,111,115,116,32,111,102,117,98,45,108,105,110,107,
+114,101,106,101,99,116,115,97,110,100,32,117,115,101,105,109,97,103,101,34,62,
+115,117,99,99,101,101,100,102,101,101,100,105,110,103,78,117,99,108,101,97,114,
+105,110,102,111,114,109,97,116,111,32,104,101,108,112,87,111,109,101,110,39,115,
+78,101,105,116,104,101,114,77,101,120,105,99,97,110,112,114,111,116,101,105,110,
+60,116,97,98,108,101,32,98,121,32,109,97,110,121,104,101,97,108,116,104,121,108,
+97,119,115,117,105,116,100,101,118,105,115,101,100,46,112,117,115,104,40,123,115
+,101,108,108,101,114,115,115,105,109,112,108,121,32,84,104,114,111,117,103,104,
+46,99,111,111,107,105,101,32,73,109,97,103,101,40,111,108,100,101,114,34,62,117,
+115,46,106,115,34,62,32,83,105,110,99,101,32,117,110,105,118,101,114,115,108,97,
+114,103,101,114,32,111,112,101,110,32,116,111,33,45,45,32,101,110,100,108,105,
+101,115,32,105,110,39,93,41,59,13,10,32,32,109,97,114,107,101,116,119,104,111,32
+,105,115,32,40,34,68,79,77,67,111,109,97,110,97,103,101,100,111,110,101,32,102,
+111,114,116,121,112,101,111,102,32,75,105,110,103,100,111,109,112,114,111,102,
+105,116,115,112,114,111,112,111,115,101,116,111,32,115,104,111,119,99,101,110,
+116,101,114,59,109,97,100,101,32,105,116,100,114,101,115,115,101,100,119,101,114
+,101,32,105,110,109,105,120,116,117,114,101,112,114,101,99,105,115,101,97,114,
+105,115,105,110,103,115,114,99,32,61,32,39,109,97,107,101,32,97,32,115,101,99,
+117,114,101,100,66,97,112,116,105,115,116,118,111,116,105,110,103,32,10,9,9,118,
+97,114,32,77,97,114,99,104,32,50,103,114,101,119,32,117,112,67,108,105,109,97,
+116,101,46,114,101,109,111,118,101,115,107,105,108,108,101,100,119,97,121,32,116
+,104,101,60,47,104,101,97,100,62,102,97,99,101,32,111,102,97,99,116,105,110,103,
+32,114,105,103,104,116,34,62,116,111,32,119,111,114,107,114,101,100,117,99,101,
+115,104,97,115,32,104,97,100,101,114,101,99,116,101,100,115,104,111,119,40,41,59
+,97,99,116,105,111,110,61,98,111,111,107,32,111,102,97,110,32,97,114,101,97,61,
+61,32,34,104,116,116,60,104,101,97,100,101,114,10,60,104,116,109,108,62,99,111,
+110,102,111,114,109,102,97,99,105,110,103,32,99,111,111,107,105,101,46,114,101,
+108,121,32,111,110,104,111,115,116,101,100,32,46,99,117,115,116,111,109,104,101,
+32,119,101,110,116,98,117,116,32,102,111,114,115,112,114,101,97,100,32,70,97,109
+,105,108,121,32,97,32,109,101,97,110,115,111,117,116,32,116,104,101,102,111,114,
+117,109,115,46,102,111,111,116,97,103,101,34,62,77,111,98,105,108,67,108,101,109
+,101,110,116,115,34,32,105,100,61,34,97,115,32,104,105,103,104,105,110,116,101,
+110,115,101,45,45,62,60,33,45,45,102,101,109,97,108,101,32,105,115,32,115,101,
+101,110,105,109,112,108,105,101,100,115,101,116,32,116,104,101,97,32,115,116,97,
+116,101,97,110,100,32,104,105,115,102,97,115,116,101,115,116,98,101,115,105,100,
+101,115,98,117,116,116,111,110,95,98,111,117,110,100,101,100,34,62,60,105,109,
+103,32,73,110,102,111,98,111,120,101,118,101,110,116,115,44,97,32,121,111,117,
+110,103,97,110,100,32,97,114,101,78,97,116,105,118,101,32,99,104,101,97,112,101,
+114,84,105,109,101,111,117,116,97,110,100,32,104,97,115,101,110,103,105,110,101,
+115,119,111,110,32,116,104,101,40,109,111,115,116,108,121,114,105,103,104,116,58
+,32,102,105,110,100,32,97,32,45,98,111,116,116,111,109,80,114,105,110,99,101,32,
+97,114,101,97,32,111,102,109,111,114,101,32,111,102,115,101,97,114,99,104,95,110
+,97,116,117,114,101,44,108,101,103,97,108,108,121,112,101,114,105,111,100,44,108
+,97,110,100,32,111,102,111,114,32,119,105,116,104,105,110,100,117,99,101,100,112
+,114,111,118,105,110,103,109,105,115,115,105,108,101,108,111,99,97,108,108,121,
+65,103,97,105,110,115,116,116,104,101,32,119,97,121,107,38,113,117,111,116,59,
+112,120,59,34,62,13,10,112,117,115,104,101,100,32,97,98,97,110,100,111,110,110,
+117,109,101,114,97,108,67,101,114,116,97,105,110,73,110,32,116,104,105,115,109,
+111,114,101,32,105,110,111,114,32,115,111,109,101,110,97,109,101,32,105,115,97,
+110,100,44,32,105,110,99,114,111,119,110,101,100,73,83,66,78,32,48,45,99,114,101
+,97,116,101,115,79,99,116,111,98,101,114,109,97,121,32,110,111,116,99,101,110,
+116,101,114,32,108,97,116,101,32,105,110,68,101,102,101,110,99,101,101,110,97,99
+,116,101,100,119,105,115,104,32,116,111,98,114,111,97,100,108,121,99,111,111,108
+,105,110,103,111,110,108,111,97,100,61,105,116,46,32,84,104,101,114,101,99,111,
+118,101,114,77,101,109,98,101,114,115,104,101,105,103,104,116,32,97,115,115,117,
+109,101,115,60,104,116,109,108,62,10,112,101,111,112,108,101,46,105,110,32,111,
+110,101,32,61,119,105,110,100,111,119,102,111,111,116,101,114,95,97,32,103,111,
+111,100,32,114,101,107,108,97,109,97,111,116,104,101,114,115,44,116,111,32,116,
+104,105,115,95,99,111,111,107,105,101,112,97,110,101,108,34,62,76,111,110,100,
+111,110,44,100,101,102,105,110,101,115,99,114,117,115,104,101,100,98,97,112,116,
+105,115,109,99,111,97,115,116,97,108,115,116,97,116,117,115,32,116,105,116,108,
+101,34,32,109,111,118,101,32,116,111,108,111,115,116,32,105,110,98,101,116,116,
+101,114,32,105,109,112,108,105,101,115,114,105,118,97,108,114,121,115,101,114,
+118,101,114,115,32,83,121,115,116,101,109,80,101,114,104,97,112,115,101,115,32,
+97,110,100,32,99,111,110,116,101,110,100,102,108,111,119,105,110,103,108,97,115,
+116,101,100,32,114,105,115,101,32,105,110,71,101,110,101,115,105,115,118,105,101
+,119,32,111,102,114,105,115,105,110,103,32,115,101,101,109,32,116,111,98,117,116
+,32,105,110,32,98,97,99,107,105,110,103,104,101,32,119,105,108,108,103,105,118,
+101,110,32,97,103,105,118,105,110,103,32,99,105,116,105,101,115,46,102,108,111,
+119,32,111,102,32,76,97,116,101,114,32,97,108,108,32,98,117,116,72,105,103,104,
+119,97,121,111,110,108,121,32,98,121,115,105,103,110,32,111,102,104,101,32,100,
+111,101,115,100,105,102,102,101,114,115,98,97,116,116,101,114,121,38,97,109,112,
+59,108,97,115,105,110,103,108,101,115,116,104,114,101,97,116,115,105,110,116,101
+,103,101,114,116,97,107,101,32,111,110,114,101,102,117,115,101,100,99,97,108,108
+,101,100,32,61,85,83,38,97,109,112,83,101,101,32,116,104,101,110,97,116,105,118,
+101,115,98,121,32,116,104,105,115,115,121,115,116,101,109,46,104,101,97,100,32,
+111,102,58,104,111,118,101,114,44,108,101,115,98,105,97,110,115,117,114,110,97,
+109,101,97,110,100,32,97,108,108,99,111,109,109,111,110,47,104,101,97,100,101,
+114,95,95,112,97,114,97,109,115,72,97,114,118,97,114,100,47,112,105,120,101,108,
+46,114,101,109,111,118,97,108,115,111,32,108,111,110,103,114,111,108,101,32,111,
+102,106,111,105,110,116,108,121,115,107,121,115,99,114,97,85,110,105,99,111,100,
+101,98,114,32,47,62,13,10,65,116,108,97,110,116,97,110,117,99,108,101,117,115,67
+,111,117,110,116,121,44,112,117,114,101,108,121,32,99,111,117,110,116,34,62,101,
+97,115,105,108,121,32,98,117,105,108,100,32,97,111,110,99,108,105,99,107,97,32,
+103,105,118,101,110,112,111,105,110,116,101,114,104,38,113,117,111,116,59,101,
+118,101,110,116,115,32,101,108,115,101,32,123,10,100,105,116,105,111,110,115,110
+,111,119,32,116,104,101,44,32,119,105,116,104,32,109,97,110,32,119,104,111,111,
+114,103,47,87,101,98,111,110,101,32,97,110,100,99,97,118,97,108,114,121,72,101,
+32,100,105,101,100,115,101,97,116,116,108,101,48,48,44,48,48,48,32,123,119,105,
+110,100,111,119,104,97,118,101,32,116,111,105,102,40,119,105,110,100,97,110,100,
+32,105,116,115,115,111,108,101,108,121,32,109,38,113,117,111,116,59,114,101,110,
+101,119,101,100,68,101,116,114,111,105,116,97,109,111,110,103,115,116,101,105,
+116,104,101,114,32,116,104,101,109,32,105,110,83,101,110,97,116,111,114,85,115,
+60,47,97,62,60,75,105,110,103,32,111,102,70,114,97,110,99,105,115,45,112,114,111
+,100,117,99,104,101,32,117,115,101,100,97,114,116,32,97,110,100,104,105,109,32,
+97,110,100,117,115,101,100,32,98,121,115,99,111,114,105,110,103,97,116,32,104,
+111,109,101,116,111,32,104,97,118,101,114,101,108,97,116,101,115,105,98,105,108,
+105,116,121,102,97,99,116,105,111,110,66,117,102,102,97,108,111,108,105,110,107,
+34,62,60,119,104,97,116,32,104,101,102,114,101,101,32,116,111,67,105,116,121,32,
+111,102,99,111,109,101,32,105,110,115,101,99,116,111,114,115,99,111,117,110,116,
+101,100,111,110,101,32,100,97,121,110,101,114,118,111,117,115,115,113,117,97,114
+,101,32,125,59,105,102,40,103,111,105,110,32,119,104,97,116,105,109,103,34,32,97
+,108,105,115,32,111,110,108,121,115,101,97,114,99,104,47,116,117,101,115,100,97,
+121,108,111,111,115,101,108,121,83,111,108,111,109,111,110,115,101,120,117,97,
+108,32,45,32,60,97,32,104,114,109,101,100,105,117,109,34,68,79,32,78,79,84,32,70
+,114,97,110,99,101,44,119,105,116,104,32,97,32,119,97,114,32,97,110,100,115,101,
+99,111,110,100,32,116,97,107,101,32,97,32,62,13,10,13,10,13,10,109,97,114,107,
+101,116,46,104,105,103,104,119,97,121,100,111,110,101,32,105,110,99,116,105,118,
+105,116,121,34,108,97,115,116,34,62,111,98,108,105,103,101,100,114,105,115,101,
+32,116,111,34,117,110,100,101,102,105,109,97,100,101,32,116,111,32,69,97,114,108
+,121,32,112,114,97,105,115,101,100,105,110,32,105,116,115,32,102,111,114,32,104,
+105,115,97,116,104,108,101,116,101,74,117,112,105,116,101,114,89,97,104,111,111,
+33,32,116,101,114,109,101,100,32,115,111,32,109,97,110,121,114,101,97,108,108,
+121,32,115,46,32,84,104,101,32,97,32,119,111,109,97,110,63,118,97,108,117,101,61
+,100,105,114,101,99,116,32,114,105,103,104,116,34,32,98,105,99,121,99,108,101,97
+,99,105,110,103,61,34,100,97,121,32,97,110,100,115,116,97,116,105,110,103,82,97,
+116,104,101,114,44,104,105,103,104,101,114,32,79,102,102,105,99,101,32,97,114,
+101,32,110,111,119,116,105,109,101,115,44,32,119,104,101,110,32,97,32,112,97,121
+,32,102,111,114,111,110,32,116,104,105,115,45,108,105,110,107,34,62,59,98,111,
+114,100,101,114,97,114,111,117,110,100,32,97,110,110,117,97,108,32,116,104,101,
+32,78,101,119,112,117,116,32,116,104,101,46,99,111,109,34,32,116,97,107,105,110,
+32,116,111,97,32,98,114,105,101,102,40,105,110,32,116,104,101,103,114,111,117,
+112,115,46,59,32,119,105,100,116,104,101,110,122,121,109,101,115,115,105,109,112
+,108,101,32,105,110,32,108,97,116,101,123,114,101,116,117,114,110,116,104,101,
+114,97,112,121,97,32,112,111,105,110,116,98,97,110,110,105,110,103,105,110,107,
+115,34,62,10,40,41,59,34,32,114,101,97,32,112,108,97,99,101,92,117,48,48,51,67,
+97,97,98,111,117,116,32,97,116,114,62,13,10,9,9,99,99,111,117,110,116,32,103,105
+,118,101,115,32,97,60,83,67,82,73,80,84,82,97,105,108,119,97,121,116,104,101,109
+,101,115,47,116,111,111,108,98,111,120,66,121,73,100,40,34,120,104,117,109,97,
+110,115,44,119,97,116,99,104,101,115,105,110,32,115,111,109,101,32,105,102,32,40
+,119,105,99,111,109,105,110,103,32,102,111,114,109,97,116,115,32,85,110,100,101,
+114,32,98,117,116,32,104,97,115,104,97,110,100,101,100,32,109,97,100,101,32,98,
+121,116,104,97,110,32,105,110,102,101,97,114,32,111,102,100,101,110,111,116,101,
+100,47,105,102,114,97,109,101,108,101,102,116,32,105,110,118,111,108,116,97,103,
+101,105,110,32,101,97,99,104,97,38,113,117,111,116,59,98,97,115,101,32,111,102,
+73,110,32,109,97,110,121,117,110,100,101,114,103,111,114,101,103,105,109,101,115
+,97,99,116,105,111,110,32,60,47,112,62,13,10,60,117,115,116,111,109,86,97,59,38,
+103,116,59,60,47,105,109,112,111,114,116,115,111,114,32,116,104,97,116,109,111,
+115,116,108,121,32,38,97,109,112,59,114,101,32,115,105,122,101,61,34,60,47,97,62
+,60,47,104,97,32,99,108,97,115,115,112,97,115,115,105,118,101,72,111,115,116,32,
+61,32,87,104,101,116,104,101,114,102,101,114,116,105,108,101,86,97,114,105,111,
+117,115,61,91,93,59,40,102,117,99,97,109,101,114,97,115,47,62,60,47,116,100,62,
+97,99,116,115,32,97,115,73,110,32,115,111,109,101,62,13,10,13,10,60,33,111,114,
+103,97,110,105,115,32,60,98,114,32,47,62,66,101,105,106,105,110,103,99,97,116,97
+,108,195,160,100,101,117,116,115,99,104,101,117,114,111,112,101,117,101,117,115,
+107,97,114,97,103,97,101,105,108,103,101,115,118,101,110,115,107,97,101,115,112,
+97,195,177,97,109,101,110,115,97,106,101,117,115,117,97,114,105,111,116,114,97,
+98,97,106,111,109,195,169,120,105,99,111,112,195,161,103,105,110,97,115,105,101,
+109,112,114,101,115,105,115,116,101,109,97,111,99,116,117,98,114,101,100,117,114
+,97,110,116,101,97,195,177,97,100,105,114,101,109,112,114,101,115,97,109,111,109
+,101,110,116,111,110,117,101,115,116,114,111,112,114,105,109,101,114,97,116,114,
+97,118,195,169,115,103,114,97,99,105,97,115,110,117,101,115,116,114,97,112,114,
+111,99,101,115,111,101,115,116,97,100,111,115,99,97,108,105,100,97,100,112,101,
+114,115,111,110,97,110,195,186,109,101,114,111,97,99,117,101,114,100,111,109,195
+,186,115,105,99,97,109,105,101,109,98,114,111,111,102,101,114,116,97,115,97,108,
+103,117,110,111,115,112,97,195,173,115,101,115,101,106,101,109,112,108,111,100,
+101,114,101,99,104,111,97,100,101,109,195,161,115,112,114,105,118,97,100,111,97,
+103,114,101,103,97,114,101,110,108,97,99,101,115,112,111,115,105,98,108,101,104,
+111,116,101,108,101,115,115,101,118,105,108,108,97,112,114,105,109,101,114,111,
+195,186,108,116,105,109,111,101,118,101,110,116,111,115,97,114,99,104,105,118,
+111,99,117,108,116,117,114,97,109,117,106,101,114,101,115,101,110,116,114,97,100
+,97,97,110,117,110,99,105,111,101,109,98,97,114,103,111,109,101,114,99,97,100,
+111,103,114,97,110,100,101,115,101,115,116,117,100,105,111,109,101,106,111,114,
+101,115,102,101,98,114,101,114,111,100,105,115,101,195,177,111,116,117,114,105,
+115,109,111,99,195,179,100,105,103,111,112,111,114,116,97,100,97,101,115,112,97,
+99,105,111,102,97,109,105,108,105,97,97,110,116,111,110,105,111,112,101,114,109,
+105,116,101,103,117,97,114,100,97,114,97,108,103,117,110,97,115,112,114,101,99,
+105,111,115,97,108,103,117,105,101,110,115,101,110,116,105,100,111,118,105,115,
+105,116,97,115,116,195,173,116,117,108,111,99,111,110,111,99,101,114,115,101,103
+,117,110,100,111,99,111,110,115,101,106,111,102,114,97,110,99,105,97,109,105,110
+,117,116,111,115,115,101,103,117,110,100,97,116,101,110,101,109,111,115,101,102,
+101,99,116,111,115,109,195,161,108,97,103,97,115,101,115,105,195,179,110,114,101
+,118,105,115,116,97,103,114,97,110,97,100,97,99,111,109,112,114,97,114,105,110,
+103,114,101,115,111,103,97,114,99,195,173,97,97,99,99,105,195,179,110,101,99,117
+,97,100,111,114,113,117,105,101,110,101,115,105,110,99,108,117,115,111,100,101,
+98,101,114,195,161,109,97,116,101,114,105,97,104,111,109,98,114,101,115,109,117,
+101,115,116,114,97,112,111,100,114,195,173,97,109,97,195,177,97,110,97,195,186,
+108,116,105,109,97,101,115,116,97,109,111,115,111,102,105,99,105,97,108,116,97,
+109,98,105,101,110,110,105,110,103,195,186,110,115,97,108,117,100,111,115,112,
+111,100,101,109,111,115,109,101,106,111,114,97,114,112,111,115,105,116,105,111,
+110,98,117,115,105,110,101,115,115,104,111,109,101,112,97,103,101,115,101,99,117
+,114,105,116,121,108,97,110,103,117,97,103,101,115,116,97,110,100,97,114,100,99,
+97,109,112,97,105,103,110,102,101,97,116,117,114,101,115,99,97,116,101,103,111,
+114,121,101,120,116,101,114,110,97,108,99,104,105,108,100,114,101,110,114,101,
+115,101,114,118,101,100,114,101,115,101,97,114,99,104,101,120,99,104,97,110,103,
+101,102,97,118,111,114,105,116,101,116,101,109,112,108,97,116,101,109,105,108,
+105,116,97,114,121,105,110,100,117,115,116,114,121,115,101,114,118,105,99,101,
+115,109,97,116,101,114,105,97,108,112,114,111,100,117,99,116,115,122,45,105,110,
+100,101,120,58,99,111,109,109,101,110,116,115,115,111,102,116,119,97,114,101,99,
+111,109,112,108,101,116,101,99,97,108,101,110,100,97,114,112,108,97,116,102,111,
+114,109,97,114,116,105,99,108,101,115,114,101,113,117,105,114,101,100,109,111,
+118,101,109,101,110,116,113,117,101,115,116,105,111,110,98,117,105,108,100,105,
+110,103,112,111,108,105,116,105,99,115,112,111,115,115,105,98,108,101,114,101,
+108,105,103,105,111,110,112,104,121,115,105,99,97,108,102,101,101,100,98,97,99,
+107,114,101,103,105,115,116,101,114,112,105,99,116,117,114,101,115,100,105,115,
+97,98,108,101,100,112,114,111,116,111,99,111,108,97,117,100,105,101,110,99,101,
+115,101,116,116,105,110,103,115,97,99,116,105,118,105,116,121,101,108,101,109,
+101,110,116,115,108,101,97,114,110,105,110,103,97,110,121,116,104,105,110,103,97
+,98,115,116,114,97,99,116,112,114,111,103,114,101,115,115,111,118,101,114,118,
+105,101,119,109,97,103,97,122,105,110,101,101,99,111,110,111,109,105,99,116,114,
+97,105,110,105,110,103,112,114,101,115,115,117,114,101,118,97,114,105,111,117,
+115,32,60,115,116,114,111,110,103,62,112,114,111,112,101,114,116,121,115,104,111
+,112,112,105,110,103,116,111,103,101,116,104,101,114,97,100,118,97,110,99,101,
+100,98,101,104,97,118,105,111,114,100,111,119,110,108,111,97,100,102,101,97,116,
+117,114,101,100,102,111,111,116,98,97,108,108,115,101,108,101,99,116,101,100,76,
+97,110,103,117,97,103,101,100,105,115,116,97,110,99,101,114,101,109,101,109,98,
+101,114,116,114,97,99,107,105,110,103,112,97,115,115,119,111,114,100,109,111,100
+,105,102,105,101,100,115,116,117,100,101,110,116,115,100,105,114,101,99,116,108,
+121,102,105,103,104,116,105,110,103,110,111,114,116,104,101,114,110,100,97,116,
+97,98,97,115,101,102,101,115,116,105,118,97,108,98,114,101,97,107,105,110,103,
+108,111,99,97,116,105,111,110,105,110,116,101,114,110,101,116,100,114,111,112,
+100,111,119,110,112,114,97,99,116,105,99,101,101,118,105,100,101,110,99,101,102,
+117,110,99,116,105,111,110,109,97,114,114,105,97,103,101,114,101,115,112,111,110
+,115,101,112,114,111,98,108,101,109,115,110,101,103,97,116,105,118,101,112,114,
+111,103,114,97,109,115,97,110,97,108,121,115,105,115,114,101,108,101,97,115,101,
+100,98,97,110,110,101,114,34,62,112,117,114,99,104,97,115,101,112,111,108,105,99
+,105,101,115,114,101,103,105,111,110,97,108,99,114,101,97,116,105,118,101,97,114
+,103,117,109,101,110,116,98,111,111,107,109,97,114,107,114,101,102,101,114,114,
+101,114,99,104,101,109,105,99,97,108,100,105,118,105,115,105,111,110,99,97,108,
+108,98,97,99,107,115,101,112,97,114,97,116,101,112,114,111,106,101,99,116,115,99
+,111,110,102,108,105,99,116,104,97,114,100,119,97,114,101,105,110,116,101,114,
+101,115,116,100,101,108,105,118,101,114,121,109,111,117,110,116,97,105,110,111,
+98,116,97,105,110,101,100,61,32,102,97,108,115,101,59,102,111,114,40,118,97,114,
+32,97,99,99,101,112,116,101,100,99,97,112,97,99,105,116,121,99,111,109,112,117,
+116,101,114,105,100,101,110,116,105,116,121,97,105,114,99,114,97,102,116,101,109
+,112,108,111,121,101,100,112,114,111,112,111,115,101,100,100,111,109,101,115,116
+,105,99,105,110,99,108,117,100,101,115,112,114,111,118,105,100,101,100,104,111,
+115,112,105,116,97,108,118,101,114,116,105,99,97,108,99,111,108,108,97,112,115,
+101,97,112,112,114,111,97,99,104,112,97,114,116,110,101,114,115,108,111,103,111,
+34,62,60,97,100,97,117,103,104,116,101,114,97,117,116,104,111,114,34,32,99,117,
+108,116,117,114,97,108,102,97,109,105,108,105,101,115,47,105,109,97,103,101,115,
+47,97,115,115,101,109,98,108,121,112,111,119,101,114,102,117,108,116,101,97,99,
+104,105,110,103,102,105,110,105,115,104,101,100,100,105,115,116,114,105,99,116,
+99,114,105,116,105,99,97,108,99,103,105,45,98,105,110,47,112,117,114,112,111,115
+,101,115,114,101,113,117,105,114,101,115,101,108,101,99,116,105,111,110,98,101,
+99,111,109,105,110,103,112,114,111,118,105,100,101,115,97,99,97,100,101,109,105,
+99,101,120,101,114,99,105,115,101,97,99,116,117,97,108,108,121,109,101,100,105,
+99,105,110,101,99,111,110,115,116,97,110,116,97,99,99,105,100,101,110,116,77,97,
+103,97,122,105,110,101,100,111,99,117,109,101,110,116,115,116,97,114,116,105,110
+,103,98,111,116,116,111,109,34,62,111,98,115,101,114,118,101,100,58,32,38,113,
+117,111,116,59,101,120,116,101,110,100,101,100,112,114,101,118,105,111,117,115,
+83,111,102,116,119,97,114,101,99,117,115,116,111,109,101,114,100,101,99,105,115,
+105,111,110,115,116,114,101,110,103,116,104,100,101,116,97,105,108,101,100,115,
+108,105,103,104,116,108,121,112,108,97,110,110,105,110,103,116,101,120,116,97,
+114,101,97,99,117,114,114,101,110,99,121,101,118,101,114,121,111,110,101,115,116
+,114,97,105,103,104,116,116,114,97,110,115,102,101,114,112,111,115,105,116,105,
+118,101,112,114,111,100,117,99,101,100,104,101,114,105,116,97,103,101,115,104,
+105,112,112,105,110,103,97,98,115,111,108,117,116,101,114,101,99,101,105,118,101
+,100,114,101,108,101,118,97,110,116,98,117,116,116,111,110,34,32,118,105,111,108
+,101,110,99,101,97,110,121,119,104,101,114,101,98,101,110,101,102,105,116,115,
+108,97,117,110,99,104,101,100,114,101,99,101,110,116,108,121,97,108,108,105,97,
+110,99,101,102,111,108,108,111,119,101,100,109,117,108,116,105,112,108,101,98,
+117,108,108,101,116,105,110,105,110,99,108,117,100,101,100,111,99,99,117,114,114
+,101,100,105,110,116,101,114,110,97,108,36,40,116,104,105,115,41,46,114,101,112,
+117,98,108,105,99,62,60,116,114,62,60,116,100,99,111,110,103,114,101,115,115,114
+,101,99,111,114,100,101,100,117,108,116,105,109,97,116,101,115,111,108,117,116,
+105,111,110,60,117,108,32,105,100,61,34,100,105,115,99,111,118,101,114,72,111,
+109,101,60,47,97,62,119,101,98,115,105,116,101,115,110,101,116,119,111,114,107,
+115,97,108,116,104,111,117,103,104,101,110,116,105,114,101,108,121,109,101,109,
+111,114,105,97,108,109,101,115,115,97,103,101,115,99,111,110,116,105,110,117,101
+,97,99,116,105,118,101,34,62,115,111,109,101,119,104,97,116,118,105,99,116,111,
+114,105,97,87,101,115,116,101,114,110,32,32,116,105,116,108,101,61,34,76,111,99,
+97,116,105,111,110,99,111,110,116,114,97,99,116,118,105,115,105,116,111,114,115,
+68,111,119,110,108,111,97,100,119,105,116,104,111,117,116,32,114,105,103,104,116
+,34,62,10,109,101,97,115,117,114,101,115,119,105,100,116,104,32,61,32,118,97,114
+,105,97,98,108,101,105,110,118,111,108,118,101,100,118,105,114,103,105,110,105,
+97,110,111,114,109,97,108,108,121,104,97,112,112,101,110,101,100,97,99,99,111,
+117,110,116,115,115,116,97,110,100,105,110,103,110,97,116,105,111,110,97,108,82,
+101,103,105,115,116,101,114,112,114,101,112,97,114,101,100,99,111,110,116,114,
+111,108,115,97,99,99,117,114,97,116,101,98,105,114,116,104,100,97,121,115,116,
+114,97,116,101,103,121,111,102,102,105,99,105,97,108,103,114,97,112,104,105,99,
+115,99,114,105,109,105,110,97,108,112,111,115,115,105,98,108,121,99,111,110,115,
+117,109,101,114,80,101,114,115,111,110,97,108,115,112,101,97,107,105,110,103,118
+,97,108,105,100,97,116,101,97,99,104,105,101,118,101,100,46,106,112,103,34,32,47
+,62,109,97,99,104,105,110,101,115,60,47,104,50,62,10,32,32,107,101,121,119,111,
+114,100,115,102,114,105,101,110,100,108,121,98,114,111,116,104,101,114,115,99,
+111,109,98,105,110,101,100,111,114,105,103,105,110,97,108,99,111,109,112,111,115
+,101,100,101,120,112,101,99,116,101,100,97,100,101,113,117,97,116,101,112,97,107
+,105,115,116,97,110,102,111,108,108,111,119,34,32,118,97,108,117,97,98,108,101,
+60,47,108,97,98,101,108,62,114,101,108,97,116,105,118,101,98,114,105,110,103,105
+,110,103,105,110,99,114,101,97,115,101,103,111,118,101,114,110,111,114,112,108,
+117,103,105,110,115,47,76,105,115,116,32,111,102,32,72,101,97,100,101,114,34,62,
+34,32,110,97,109,101,61,34,32,40,38,113,117,111,116,59,103,114,97,100,117,97,116
+,101,60,47,104,101,97,100,62,10,99,111,109,109,101,114,99,101,109,97,108,97,121,
+115,105,97,100,105,114,101,99,116,111,114,109,97,105,110,116,97,105,110,59,104,
+101,105,103,104,116,58,115,99,104,101,100,117,108,101,99,104,97,110,103,105,110,
+103,98,97,99,107,32,116,111,32,99,97,116,104,111,108,105,99,112,97,116,116,101,
+114,110,115,99,111,108,111,114,58,32,35,103,114,101,97,116,101,115,116,115,117,
+112,112,108,105,101,115,114,101,108,105,97,98,108,101,60,47,117,108,62,10,9,9,60
+,115,101,108,101,99,116,32,99,105,116,105,122,101,110,115,99,108,111,116,104,105
+,110,103,119,97,116,99,104,105,110,103,60,108,105,32,105,100,61,34,115,112,101,
+99,105,102,105,99,99,97,114,114,121,105,110,103,115,101,110,116,101,110,99,101,
+60,99,101,110,116,101,114,62,99,111,110,116,114,97,115,116,116,104,105,110,107,
+105,110,103,99,97,116,99,104,40,101,41,115,111,117,116,104,101,114,110,77,105,99
+,104,97,101,108,32,109,101,114,99,104,97,110,116,99,97,114,111,117,115,101,108,
+112,97,100,100,105,110,103,58,105,110,116,101,114,105,111,114,46,115,112,108,105
+,116,40,34,108,105,122,97,116,105,111,110,79,99,116,111,98,101,114,32,41,123,114
+,101,116,117,114,110,105,109,112,114,111,118,101,100,45,45,38,103,116,59,10,10,
+99,111,118,101,114,97,103,101,99,104,97,105,114,109,97,110,46,112,110,103,34,32,
+47,62,115,117,98,106,101,99,116,115,82,105,99,104,97,114,100,32,119,104,97,116,
+101,118,101,114,112,114,111,98,97,98,108,121,114,101,99,111,118,101,114,121,98,
+97,115,101,98,97,108,108,106,117,100,103,109,101,110,116,99,111,110,110,101,99,
+116,46,46,99,115,115,34,32,47,62,32,119,101,98,115,105,116,101,114,101,112,111,
+114,116,101,100,100,101,102,97,117,108,116,34,47,62,60,47,97,62,13,10,101,108,
+101,99,116,114,105,99,115,99,111,116,108,97,110,100,99,114,101,97,116,105,111,
+110,113,117,97,110,116,105,116,121,46,32,73,83,66,78,32,48,100,105,100,32,110,
+111,116,32,105,110,115,116,97,110,99,101,45,115,101,97,114,99,104,45,34,32,108,
+97,110,103,61,34,115,112,101,97,107,101,114,115,67,111,109,112,117,116,101,114,
+99,111,110,116,97,105,110,115,97,114,99,104,105,118,101,115,109,105,110,105,115,
+116,101,114,114,101,97,99,116,105,111,110,100,105,115,99,111,117,110,116,73,116,
+97,108,105,97,110,111,99,114,105,116,101,114,105,97,115,116,114,111,110,103,108,
+121,58,32,39,104,116,116,112,58,39,115,99,114,105,112,116,39,99,111,118,101,114,
+105,110,103,111,102,102,101,114,105,110,103,97,112,112,101,97,114,101,100,66,114
+,105,116,105,115,104,32,105,100,101,110,116,105,102,121,70,97,99,101,98,111,111,
+107,110,117,109,101,114,111,117,115,118,101,104,105,99,108,101,115,99,111,110,99
+,101,114,110,115,65,109,101,114,105,99,97,110,104,97,110,100,108,105,110,103,100
+,105,118,32,105,100,61,34,87,105,108,108,105,97,109,32,112,114,111,118,105,100,
+101,114,95,99,111,110,116,101,110,116,97,99,99,117,114,97,99,121,115,101,99,116,
+105,111,110,32,97,110,100,101,114,115,111,110,102,108,101,120,105,98,108,101,67,
+97,116,101,103,111,114,121,108,97,119,114,101,110,99,101,60,115,99,114,105,112,
+116,62,108,97,121,111,117,116,61,34,97,112,112,114,111,118,101,100,32,109,97,120
+,105,109,117,109,104,101,97,100,101,114,34,62,60,47,116,97,98,108,101,62,83,101,
+114,118,105,99,101,115,104,97,109,105,108,116,111,110,99,117,114,114,101,110,116
+,32,99,97,110,97,100,105,97,110,99,104,97,110,110,101,108,115,47,116,104,101,109
+,101,115,47,47,97,114,116,105,99,108,101,111,112,116,105,111,110,97,108,112,111,
+114,116,117,103,97,108,118,97,108,117,101,61,34,34,105,110,116,101,114,118,97,
+108,119,105,114,101,108,101,115,115,101,110,116,105,116,108,101,100,97,103,101,
+110,99,105,101,115,83,101,97,114,99,104,34,32,109,101,97,115,117,114,101,100,116
+,104,111,117,115,97,110,100,115,112,101,110,100,105,110,103,38,104,101,108,108,
+105,112,59,110,101,119,32,68,97,116,101,34,32,115,105,122,101,61,34,112,97,103,
+101,78,97,109,101,109,105,100,100,108,101,34,32,34,32,47,62,60,47,97,62,104,105,
+100,100,101,110,34,62,115,101,113,117,101,110,99,101,112,101,114,115,111,110,97,
+108,111,118,101,114,102,108,111,119,111,112,105,110,105,111,110,115,105,108,108,
+105,110,111,105,115,108,105,110,107,115,34,62,10,9,60,116,105,116,108,101,62,118
+,101,114,115,105,111,110,115,115,97,116,117,114,100,97,121,116,101,114,109,105,
+110,97,108,105,116,101,109,112,114,111,112,101,110,103,105,110,101,101,114,115,
+101,99,116,105,111,110,115,100,101,115,105,103,110,101,114,112,114,111,112,111,
+115,97,108,61,34,102,97,108,115,101,34,69,115,112,97,195,177,111,108,114,101,108
+,101,97,115,101,115,115,117,98,109,105,116,34,32,101,114,38,113,117,111,116,59,
+97,100,100,105,116,105,111,110,115,121,109,112,116,111,109,115,111,114,105,101,
+110,116,101,100,114,101,115,111,117,114,99,101,114,105,103,104,116,34,62,60,112,
+108,101,97,115,117,114,101,115,116,97,116,105,111,110,115,104,105,115,116,111,
+114,121,46,108,101,97,118,105,110,103,32,32,98,111,114,100,101,114,61,99,111,110
+,116,101,110,116,115,99,101,110,116,101,114,34,62,46,10,10,83,111,109,101,32,100
+,105,114,101,99,116,101,100,115,117,105,116,97,98,108,101,98,117,108,103,97,114,
+105,97,46,115,104,111,119,40,41,59,100,101,115,105,103,110,101,100,71,101,110,
+101,114,97,108,32,99,111,110,99,101,112,116,115,69,120,97,109,112,108,101,115,
+119,105,108,108,105,97,109,115,79,114,105,103,105,110,97,108,34,62,60,115,112,97
+,110,62,115,101,97,114,99,104,34,62,111,112,101,114,97,116,111,114,114,101,113,
+117,101,115,116,115,97,32,38,113,117,111,116,59,97,108,108,111,119,105,110,103,
+68,111,99,117,109,101,110,116,114,101,118,105,115,105,111,110,46,32,10,10,84,104
+,101,32,121,111,117,114,115,101,108,102,67,111,110,116,97,99,116,32,109,105,99,
+104,105,103,97,110,69,110,103,108,105,115,104,32,99,111,108,117,109,98,105,97,
+112,114,105,111,114,105,116,121,112,114,105,110,116,105,110,103,100,114,105,110,
+107,105,110,103,102,97,99,105,108,105,116,121,114,101,116,117,114,110,101,100,67
+,111,110,116,101,110,116,32,111,102,102,105,99,101,114,115,82,117,115,115,105,97
+,110,32,103,101,110,101,114,97,116,101,45,56,56,53,57,45,49,34,105,110,100,105,
+99,97,116,101,102,97,109,105,108,105,97,114,32,113,117,97,108,105,116,121,109,97
+,114,103,105,110,58,48,32,99,111,110,116,101,110,116,118,105,101,119,112,111,114
+,116,99,111,110,116,97,99,116,115,45,116,105,116,108,101,34,62,112,111,114,116,
+97,98,108,101,46,108,101,110,103,116,104,32,101,108,105,103,105,98,108,101,105,
+110,118,111,108,118,101,115,97,116,108,97,110,116,105,99,111,110,108,111,97,100,
+61,34,100,101,102,97,117,108,116,46,115,117,112,112,108,105,101,100,112,97,121,
+109,101,110,116,115,103,108,111,115,115,97,114,121,10,10,65,102,116,101,114,32,
+103,117,105,100,97,110,99,101,60,47,116,100,62,60,116,100,101,110,99,111,100,105
+,110,103,109,105,100,100,108,101,34,62,99,97,109,101,32,116,111,32,100,105,115,
+112,108,97,121,115,115,99,111,116,116,105,115,104,106,111,110,97,116,104,97,110,
+109,97,106,111,114,105,116,121,119,105,100,103,101,116,115,46,99,108,105,110,105
+,99,97,108,116,104,97,105,108,97,110,100,116,101,97,99,104,101,114,115,60,104,
+101,97,100,62,10,9,97,102,102,101,99,116,101,100,115,117,112,112,111,114,116,115
+,112,111,105,110,116,101,114,59,116,111,83,116,114,105,110,103,60,47,115,109,97,
+108,108,62,111,107,108,97,104,111,109,97,119,105,108,108,32,98,101,32,105,110,
+118,101,115,116,111,114,48,34,32,97,108,116,61,34,104,111,108,105,100,97,121,115
+,82,101,115,111,117,114,99,101,108,105,99,101,110,115,101,100,32,40,119,104,105,
+99,104,32,46,32,65,102,116,101,114,32,99,111,110,115,105,100,101,114,118,105,115
+,105,116,105,110,103,101,120,112,108,111,114,101,114,112,114,105,109,97,114,121,
+32,115,101,97,114,99,104,34,32,97,110,100,114,111,105,100,34,113,117,105,99,107,
+108,121,32,109,101,101,116,105,110,103,115,101,115,116,105,109,97,116,101,59,114
+,101,116,117,114,110,32,59,99,111,108,111,114,58,35,32,104,101,105,103,104,116,
+61,97,112,112,114,111,118,97,108,44,32,38,113,117,111,116,59,32,99,104,101,99,
+107,101,100,46,109,105,110,46,106,115,34,109,97,103,110,101,116,105,99,62,60,47,
+97,62,60,47,104,102,111,114,101,99,97,115,116,46,32,87,104,105,108,101,32,116,
+104,117,114,115,100,97,121,100,118,101,114,116,105,115,101,38,101,97,99,117,116,
+101,59,104,97,115,67,108,97,115,115,101,118,97,108,117,97,116,101,111,114,100,
+101,114,105,110,103,101,120,105,115,116,105,110,103,112,97,116,105,101,110,116,
+115,32,79,110,108,105,110,101,32,99,111,108,111,114,97,100,111,79,112,116,105,
+111,110,115,34,99,97,109,112,98,101,108,108,60,33,45,45,32,101,110,100,60,47,115
+,112,97,110,62,60,60,98,114,32,47,62,13,10,95,112,111,112,117,112,115,124,115,99
+,105,101,110,99,101,115,44,38,113,117,111,116,59,32,113,117,97,108,105,116,121,
+32,87,105,110,100,111,119,115,32,97,115,115,105,103,110,101,100,104,101,105,103,
+104,116,58,32,60,98,32,99,108,97,115,115,108,101,38,113,117,111,116,59,32,118,97
+,108,117,101,61,34,32,67,111,109,112,97,110,121,101,120,97,109,112,108,101,115,
+60,105,102,114,97,109,101,32,98,101,108,105,101,118,101,115,112,114,101,115,101,
+110,116,115,109,97,114,115,104,97,108,108,112,97,114,116,32,111,102,32,112,114,
+111,112,101,114,108,121,41,46,10,10,84,104,101,32,116,97,120,111,110,111,109,121
+,109,117,99,104,32,111,102,32,60,47,115,112,97,110,62,10,34,32,100,97,116,97,45,
+115,114,116,117,103,117,195,170,115,115,99,114,111,108,108,84,111,32,112,114,111
+,106,101,99,116,60,104,101,97,100,62,13,10,97,116,116,111,114,110,101,121,101,
+109,112,104,97,115,105,115,115,112,111,110,115,111,114,115,102,97,110,99,121,98,
+111,120,119,111,114,108,100,39,115,32,119,105,108,100,108,105,102,101,99,104,101
+,99,107,101,100,61,115,101,115,115,105,111,110,115,112,114,111,103,114,97,109,
+109,112,120,59,102,111,110,116,45,32,80,114,111,106,101,99,116,106,111,117,114,
+110,97,108,115,98,101,108,105,101,118,101,100,118,97,99,97,116,105,111,110,116,
+104,111,109,112,115,111,110,108,105,103,104,116,105,110,103,97,110,100,32,116,
+104,101,32,115,112,101,99,105,97,108,32,98,111,114,100,101,114,61,48,99,104,101,
+99,107,105,110,103,60,47,116,98,111,100,121,62,60,98,117,116,116,111,110,32,67,
+111,109,112,108,101,116,101,99,108,101,97,114,102,105,120,10,60,104,101,97,100,
+62,10,97,114,116,105,99,108,101,32,60,115,101,99,116,105,111,110,102,105,110,100
+,105,110,103,115,114,111,108,101,32,105,110,32,112,111,112,117,108,97,114,32,32,
+79,99,116,111,98,101,114,119,101,98,115,105,116,101,32,101,120,112,111,115,117,
+114,101,117,115,101,100,32,116,111,32,32,99,104,97,110,103,101,115,111,112,101,
+114,97,116,101,100,99,108,105,99,107,105,110,103,101,110,116,101,114,105,110,103
+,99,111,109,109,97,110,100,115,105,110,102,111,114,109,101,100,32,110,117,109,98
+,101,114,115,32,32,60,47,100,105,118,62,99,114,101,97,116,105,110,103,111,110,83
+,117,98,109,105,116,109,97,114,121,108,97,110,100,99,111,108,108,101,103,101,115
+,97,110,97,108,121,116,105,99,108,105,115,116,105,110,103,115,99,111,110,116,97,
+99,116,46,108,111,103,103,101,100,73,110,97,100,118,105,115,111,114,121,115,105,
+98,108,105,110,103,115,99,111,110,116,101,110,116,34,115,38,113,117,111,116,59,
+41,115,46,32,84,104,105,115,32,112,97,99,107,97,103,101,115,99,104,101,99,107,98
+,111,120,115,117,103,103,101,115,116,115,112,114,101,103,110,97,110,116,116,111,
+109,111,114,114,111,119,115,112,97,99,105,110,103,61,105,99,111,110,46,112,110,
+103,106,97,112,97,110,101,115,101,99,111,100,101,98,97,115,101,98,117,116,116,
+111,110,34,62,103,97,109,98,108,105,110,103,115,117,99,104,32,97,115,32,44,32,
+119,104,105,108,101,32,60,47,115,112,97,110,62,32,109,105,115,115,111,117,114,
+105,115,112,111,114,116,105,110,103,116,111,112,58,49,112,120,32,46,60,47,115,
+112,97,110,62,116,101,110,115,105,111,110,115,119,105,100,116,104,61,34,50,108,
+97,122,121,108,111,97,100,110,111,118,101,109,98,101,114,117,115,101,100,32,105,
+110,32,104,101,105,103,104,116,61,34,99,114,105,112,116,34,62,10,38,110,98,115,
+112,59,60,47,60,116,114,62,60,116,100,32,104,101,105,103,104,116,58,50,47,112,
+114,111,100,117,99,116,99,111,117,110,116,114,121,32,105,110,99,108,117,100,101,
+32,102,111,111,116,101,114,34,32,38,108,116,59,33,45,45,32,116,105,116,108,101,
+34,62,60,47,106,113,117,101,114,121,46,60,47,102,111,114,109,62,10,40,231,174,
+128,228,189,147,41,40,231,185,129,233,171,148,41,104,114,118,97,116,115,107,105,
+105,116,97,108,105,97,110,111,114,111,109,195,162,110,196,131,116,195,188,114,
+107,195,167,101,216,167,216,177,216,175,217,136,116,97,109,98,105,195,169,110,
+110,111,116,105,99,105,97,115,109,101,110,115,97,106,101,115,112,101,114,115,111
+,110,97,115,100,101,114,101,99,104,111,115,110,97,99,105,111,110,97,108,115,101,
+114,118,105,99,105,111,99,111,110,116,97,99,116,111,117,115,117,97,114,105,111,
+115,112,114,111,103,114,97,109,97,103,111,98,105,101,114,110,111,101,109,112,114
+,101,115,97,115,97,110,117,110,99,105,111,115,118,97,108,101,110,99,105,97,99,
+111,108,111,109,98,105,97,100,101,115,112,117,195,169,115,100,101,112,111,114,
+116,101,115,112,114,111,121,101,99,116,111,112,114,111,100,117,99,116,111,112,
+195,186,98,108,105,99,111,110,111,115,111,116,114,111,115,104,105,115,116,111,
+114,105,97,112,114,101,115,101,110,116,101,109,105,108,108,111,110,101,115,109,
+101,100,105,97,110,116,101,112,114,101,103,117,110,116,97,97,110,116,101,114,105
+,111,114,114,101,99,117,114,115,111,115,112,114,111,98,108,101,109,97,115,97,110
+,116,105,97,103,111,110,117,101,115,116,114,111,115,111,112,105,110,105,195,179,
+110,105,109,112,114,105,109,105,114,109,105,101,110,116,114,97,115,97,109,195,
+169,114,105,99,97,118,101,110,100,101,100,111,114,115,111,99,105,101,100,97,100,
+114,101,115,112,101,99,116,111,114,101,97,108,105,122,97,114,114,101,103,105,115
+,116,114,111,112,97,108,97,98,114,97,115,105,110,116,101,114,195,169,115,101,110
+,116,111,110,99,101,115,101,115,112,101,99,105,97,108,109,105,101,109,98,114,111
+,115,114,101,97,108,105,100,97,100,99,195,179,114,100,111,98,97,122,97,114,97,
+103,111,122,97,112,195,161,103,105,110,97,115,115,111,99,105,97,108,101,115,98,
+108,111,113,117,101,97,114,103,101,115,116,105,195,179,110,97,108,113,117,105,
+108,101,114,115,105,115,116,101,109,97,115,99,105,101,110,99,105,97,115,99,111,
+109,112,108,101,116,111,118,101,114,115,105,195,179,110,99,111,109,112,108,101,
+116,97,101,115,116,117,100,105,111,115,112,195,186,98,108,105,99,97,111,98,106,
+101,116,105,118,111,97,108,105,99,97,110,116,101,98,117,115,99,97,100,111,114,99
+,97,110,116,105,100,97,100,101,110,116,114,97,100,97,115,97,99,99,105,111,110,
+101,115,97,114,99,104,105,118,111,115,115,117,112,101,114,105,111,114,109,97,121
+,111,114,195,173,97,97,108,101,109,97,110,105,97,102,117,110,99,105,195,179,110,
+195,186,108,116,105,109,111,115,104,97,99,105,101,110,100,111,97,113,117,101,108
+,108,111,115,101,100,105,99,105,195,179,110,102,101,114,110,97,110,100,111,97,
+109,98,105,101,110,116,101,102,97,99,101,98,111,111,107,110,117,101,115,116,114,
+97,115,99,108,105,101,110,116,101,115,112,114,111,99,101,115,111,115,98,97,115,
+116,97,110,116,101,112,114,101,115,101,110,116,97,114,101,112,111,114,116,97,114
+,99,111,110,103,114,101,115,111,112,117,98,108,105,99,97,114,99,111,109,101,114,
+99,105,111,99,111,110,116,114,97,116,111,106,195,179,118,101,110,101,115,100,105
+,115,116,114,105,116,111,116,195,169,99,110,105,99,97,99,111,110,106,117,110,116
+,111,101,110,101,114,103,195,173,97,116,114,97,98,97,106,97,114,97,115,116,117,
+114,105,97,115,114,101,99,105,101,110,116,101,117,116,105,108,105,122,97,114,98,
+111,108,101,116,195,173,110,115,97,108,118,97,100,111,114,99,111,114,114,101,99,
+116,97,116,114,97,98,97,106,111,115,112,114,105,109,101,114,111,115,110,101,103,
+111,99,105,111,115,108,105,98,101,114,116,97,100,100,101,116,97,108,108,101,115,
+112,97,110,116,97,108,108,97,112,114,195,179,120,105,109,111,97,108,109,101,114,
+195,173,97,97,110,105,109,97,108,101,115,113,117,105,195,169,110,101,115,99,111,
+114,97,122,195,179,110,115,101,99,99,105,195,179,110,98,117,115,99,97,110,100,
+111,111,112,99,105,111,110,101,115,101,120,116,101,114,105,111,114,99,111,110,99
+,101,112,116,111,116,111,100,97,118,195,173,97,103,97,108,101,114,195,173,97,101
+,115,99,114,105,98,105,114,109,101,100,105,99,105,110,97,108,105,99,101,110,99,
+105,97,99,111,110,115,117,108,116,97,97,115,112,101,99,116,111,115,99,114,195,
+173,116,105,99,97,100,195,179,108,97,114,101,115,106,117,115,116,105,99,105,97,
+100,101,98,101,114,195,161,110,112,101,114,195,173,111,100,111,110,101,99,101,
+115,105,116,97,109,97,110,116,101,110,101,114,112,101,113,117,101,195,177,111,
+114,101,99,105,98,105,100,97,116,114,105,98,117,110,97,108,116,101,110,101,114,
+105,102,101,99,97,110,99,105,195,179,110,99,97,110,97,114,105,97,115,100,101,115
+,99,97,114,103,97,100,105,118,101,114,115,111,115,109,97,108,108,111,114,99,97,
+114,101,113,117,105,101,114,101,116,195,169,99,110,105,99,111,100,101,98,101,114
+,195,173,97,118,105,118,105,101,110,100,97,102,105,110,97,110,122,97,115,97,100,
+101,108,97,110,116,101,102,117,110,99,105,111,110,97,99,111,110,115,101,106,111,
+115,100,105,102,195,173,99,105,108,99,105,117,100,97,100,101,115,97,110,116,105,
+103,117,97,115,97,118,97,110,122,97,100,97,116,195,169,114,109,105,110,111,117,
+110,105,100,97,100,101,115,115,195,161,110,99,104,101,122,99,97,109,112,97,195,
+177,97,115,111,102,116,111,110,105,99,114,101,118,105,115,116,97,115,99,111,110,
+116,105,101,110,101,115,101,99,116,111,114,101,115,109,111,109,101,110,116,111,
+115,102,97,99,117,108,116,97,100,99,114,195,169,100,105,116,111,100,105,118,101,
+114,115,97,115,115,117,112,117,101,115,116,111,102,97,99,116,111,114,101,115,115
+,101,103,117,110,100,111,115,112,101,113,117,101,195,177,97,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,0,0,
+0,0,0,0,0,0,1,0,1,0,1,0,1,0,2,0,2,0,2,0,2,0,4,0,4,0,4,0,4,0,0,1,2,3,4,5,6,7,7,6,
+5,4,3,2,1,0,8,9,10,11,12,13,14,15,15,14,13,12,11,10,9,8,16,17,18,19,20,21,22,23,
+23,22,21,20,19,18,17,16,24,25,26,27,28,29,30,31,31,30,29,28,27,26,25,24,255,255,
+255,255,0,0,0,0,0,0,0,0,255,255,255,255,1,0,0,0,2,0,0,0,2,0,0,0,1,0,0,0,1,0,0,0,
+3,0,0,0,255,255,0,1,0,0,0,1,0,0,255,255,0,1,0,0,0,8,0,8,0,8,0,8,0,0,0,1,0,2,0,3,
+0,4,0,5,0,6,0,7,114,101,115,111,117,114,99,101,115,99,111,117,110,116,114,105,
+101,115,113,117,101,115,116,105,111,110,115,101,113,117,105,112,109,101,110,116,
+99,111,109,109,117,110,105,116,121,97,118,97,105,108,97,98,108,101,104,105,103,
+104,108,105,103,104,116,68,84,68,47,120,104,116,109,108,109,97,114,107,101,116,
+105,110,103,107,110,111,119,108,101,100,103,101,115,111,109,101,116,104,105,110,
+103,99,111,110,116,97,105,110,101,114,100,105,114,101,99,116,105,111,110,115,117
+,98,115,99,114,105,98,101,97,100,118,101,114,116,105,115,101,99,104,97,114,97,99
+,116,101,114,34,32,118,97,108,117,101,61,34,60,47,115,101,108,101,99,116,62,65,
+117,115,116,114,97,108,105,97,34,32,99,108,97,115,115,61,34,115,105,116,117,97,
+116,105,111,110,97,117,116,104,111,114,105,116,121,102,111,108,108,111,119,105,
+110,103,112,114,105,109,97,114,105,108,121,111,112,101,114,97,116,105,111,110,99
+,104,97,108,108,101,110,103,101,100,101,118,101,108,111,112,101,100,97,110,111,
+110,121,109,111,117,115,102,117,110,99,116,105,111,110,32,102,117,110,99,116,105
+,111,110,115,99,111,109,112,97,110,105,101,115,115,116,114,117,99,116,117,114,
+101,97,103,114,101,101,109,101,110,116,34,32,116,105,116,108,101,61,34,112,111,
+116,101,110,116,105,97,108,101,100,117,99,97,116,105,111,110,97,114,103,117,109,
+101,110,116,115,115,101,99,111,110,100,97,114,121,99,111,112,121,114,105,103,104
+,116,108,97,110,103,117,97,103,101,115,101,120,99,108,117,115,105,118,101,99,111
+,110,100,105,116,105,111,110,60,47,102,111,114,109,62,13,10,115,116,97,116,101,
+109,101,110,116,97,116,116,101,110,116,105,111,110,66,105,111,103,114,97,112,104
+,121,125,32,101,108,115,101,32,123,10,115,111,108,117,116,105,111,110,115,119,
+104,101,110,32,116,104,101,32,65,110,97,108,121,116,105,99,115,116,101,109,112,
+108,97,116,101,115,100,97,110,103,101,114,111,117,115,115,97,116,101,108,108,105
+,116,101,100,111,99,117,109,101,110,116,115,112,117,98,108,105,115,104,101,114,
+105,109,112,111,114,116,97,110,116,112,114,111,116,111,116,121,112,101,105,110,
+102,108,117,101,110,99,101,38,114,97,113,117,111,59,60,47,101,102,102,101,99,116
+,105,118,101,103,101,110,101,114,97,108,108,121,116,114,97,110,115,102,111,114,
+109,98,101,97,117,116,105,102,117,108,116,114,97,110,115,112,111,114,116,111,114
+,103,97,110,105,122,101,100,112,117,98,108,105,115,104,101,100,112,114,111,109,
+105,110,101,110,116,117,110,116,105,108,32,116,104,101,116,104,117,109,98,110,97
+,105,108,78,97,116,105,111,110,97,108,32,46,102,111,99,117,115,40,41,59,111,118,
+101,114,32,116,104,101,32,109,105,103,114,97,116,105,111,110,97,110,110,111,117,
+110,99,101,100,102,111,111,116,101,114,34,62,10,101,120,99,101,112,116,105,111,
+110,108,101,115,115,32,116,104,97,110,101,120,112,101,110,115,105,118,101,102,
+111,114,109,97,116,105,111,110,102,114,97,109,101,119,111,114,107,116,101,114,
+114,105,116,111,114,121,110,100,105,99,97,116,105,111,110,99,117,114,114,101,110
+,116,108,121,99,108,97,115,115,78,97,109,101,99,114,105,116,105,99,105,115,109,
+116,114,97,100,105,116,105,111,110,101,108,115,101,119,104,101,114,101,65,108,
+101,120,97,110,100,101,114,97,112,112,111,105,110,116,101,100,109,97,116,101,114
+,105,97,108,115,98,114,111,97,100,99,97,115,116,109,101,110,116,105,111,110,101,
+100,97,102,102,105,108,105,97,116,101,60,47,111,112,116,105,111,110,62,116,114,
+101,97,116,109,101,110,116,100,105,102,102,101,114,101,110,116,47,100,101,102,97
+,117,108,116,46,80,114,101,115,105,100,101,110,116,111,110,99,108,105,99,107,61,
+34,98,105,111,103,114,97,112,104,121,111,116,104,101,114,119,105,115,101,112,101
+,114,109,97,110,101,110,116,70,114,97,110,195,167,97,105,115,72,111,108,108,121,
+119,111,111,100,101,120,112,97,110,115,105,111,110,115,116,97,110,100,97,114,100
+,115,60,47,115,116,121,108,101,62,10,114,101,100,117,99,116,105,111,110,68,101,
+99,101,109,98,101,114,32,112,114,101,102,101,114,114,101,100,67,97,109,98,114,
+105,100,103,101,111,112,112,111,110,101,110,116,115,66,117,115,105,110,101,115,
+115,32,99,111,110,102,117,115,105,111,110,62,10,60,116,105,116,108,101,62,112,
+114,101,115,101,110,116,101,100,101,120,112,108,97,105,110,101,100,100,111,101,
+115,32,110,111,116,32,119,111,114,108,100,119,105,100,101,105,110,116,101,114,
+102,97,99,101,112,111,115,105,116,105,111,110,115,110,101,119,115,112,97,112,101
+,114,60,47,116,97,98,108,101,62,10,109,111,117,110,116,97,105,110,115,108,105,
+107,101,32,116,104,101,32,101,115,115,101,110,116,105,97,108,102,105,110,97,110,
+99,105,97,108,115,101,108,101,99,116,105,111,110,97,99,116,105,111,110,61,34,47,
+97,98,97,110,100,111,110,101,100,69,100,117,99,97,116,105,111,110,112,97,114,115
+,101,73,110,116,40,115,116,97,98,105,108,105,116,121,117,110,97,98,108,101,32,
+116,111,60,47,116,105,116,108,101,62,10,114,101,108,97,116,105,111,110,115,78,
+111,116,101,32,116,104,97,116,101,102,102,105,99,105,101,110,116,112,101,114,102
+,111,114,109,101,100,116,119,111,32,121,101,97,114,115,83,105,110,99,101,32,116,
+104,101,116,104,101,114,101,102,111,114,101,119,114,97,112,112,101,114,34,62,97,
+108,116,101,114,110,97,116,101,105,110,99,114,101,97,115,101,100,66,97,116,116,
+108,101,32,111,102,112,101,114,99,101,105,118,101,100,116,114,121,105,110,103,32
+,116,111,110,101,99,101,115,115,97,114,121,112,111,114,116,114,97,121,101,100,
+101,108,101,99,116,105,111,110,115,69,108,105,122,97,98,101,116,104,60,47,105,
+102,114,97,109,101,62,100,105,115,99,111,118,101,114,121,105,110,115,117,114,97,
+110,99,101,115,46,108,101,110,103,116,104,59,108,101,103,101,110,100,97,114,121,
+71,101,111,103,114,97,112,104,121,99,97,110,100,105,100,97,116,101,99,111,114,
+112,111,114,97,116,101,115,111,109,101,116,105,109,101,115,115,101,114,118,105,
+99,101,115,46,105,110,104,101,114,105,116,101,100,60,47,115,116,114,111,110,103,
+62,67,111,109,109,117,110,105,116,121,114,101,108,105,103,105,111,117,115,108,
+111,99,97,116,105,111,110,115,67,111,109,109,105,116,116,101,101,98,117,105,108,
+100,105,110,103,115,116,104,101,32,119,111,114,108,100,110,111,32,108,111,110,
+103,101,114,98,101,103,105,110,110,105,110,103,114,101,102,101,114,101,110,99,
+101,99,97,110,110,111,116,32,98,101,102,114,101,113,117,101,110,99,121,116,121,
+112,105,99,97,108,108,121,105,110,116,111,32,116,104,101,32,114,101,108,97,116,
+105,118,101,59,114,101,99,111,114,100,105,110,103,112,114,101,115,105,100,101,
+110,116,105,110,105,116,105,97,108,108,121,116,101,99,104,110,105,113,117,101,
+116,104,101,32,111,116,104,101,114,105,116,32,99,97,110,32,98,101,101,120,105,
+115,116,101,110,99,101,117,110,100,101,114,108,105,110,101,116,104,105,115,32,
+116,105,109,101,116,101,108,101,112,104,111,110,101,105,116,101,109,115,99,111,
+112,101,112,114,97,99,116,105,99,101,115,97,100,118,97,110,116,97,103,101,41,59,
+114,101,116,117,114,110,32,70,111,114,32,111,116,104,101,114,112,114,111,118,105
+,100,105,110,103,100,101,109,111,99,114,97,99,121,98,111,116,104,32,116,104,101,
+32,101,120,116,101,110,115,105,118,101,115,117,102,102,101,114,105,110,103,115,
+117,112,112,111,114,116,101,100,99,111,109,112,117,116,101,114,115,32,102,117,
+110,99,116,105,111,110,112,114,97,99,116,105,99,97,108,115,97,105,100,32,116,104
+,97,116,105,116,32,109,97,121,32,98,101,69,110,103,108,105,115,104,60,47,102,114
+,111,109,32,116,104,101,32,115,99,104,101,100,117,108,101,100,100,111,119,110,
+108,111,97,100,115,60,47,108,97,98,101,108,62,10,115,117,115,112,101,99,116,101,
+100,109,97,114,103,105,110,58,32,48,115,112,105,114,105,116,117,97,108,60,47,104
+,101,97,100,62,10,10,109,105,99,114,111,115,111,102,116,103,114,97,100,117,97,
+108,108,121,100,105,115,99,117,115,115,101,100,104,101,32,98,101,99,97,109,101,
+101,120,101,99,117,116,105,118,101,106,113,117,101,114,121,46,106,115,104,111,
+117,115,101,104,111,108,100,99,111,110,102,105,114,109,101,100,112,117,114,99,
+104,97,115,101,100,108,105,116,101,114,97,108,108,121,100,101,115,116,114,111,
+121,101,100,117,112,32,116,111,32,116,104,101,118,97,114,105,97,116,105,111,110,
+114,101,109,97,105,110,105,110,103,105,116,32,105,115,32,110,111,116,99,101,110,
+116,117,114,105,101,115,74,97,112,97,110,101,115,101,32,97,109,111,110,103,32,
+116,104,101,99,111,109,112,108,101,116,101,100,97,108,103,111,114,105,116,104,
+109,105,110,116,101,114,101,115,116,115,114,101,98,101,108,108,105,111,110,117,
+110,100,101,102,105,110,101,100,101,110,99,111,117,114,97,103,101,114,101,115,
+105,122,97,98,108,101,105,110,118,111,108,118,105,110,103,115,101,110,115,105,
+116,105,118,101,117,110,105,118,101,114,115,97,108,112,114,111,118,105,115,105,
+111,110,40,97,108,116,104,111,117,103,104,102,101,97,116,117,114,105,110,103,99,
+111,110,100,117,99,116,101,100,41,44,32,119,104,105,99,104,32,99,111,110,116,105
+,110,117,101,100,45,104,101,97,100,101,114,34,62,70,101,98,114,117,97,114,121,32
+,110,117,109,101,114,111,117,115,32,111,118,101,114,102,108,111,119,58,99,111,
+109,112,111,110,101,110,116,102,114,97,103,109,101,110,116,115,101,120,99,101,
+108,108,101,110,116,99,111,108,115,112,97,110,61,34,116,101,99,104,110,105,99,97
+,108,110,101,97,114,32,116,104,101,32,65,100,118,97,110,99,101,100,32,115,111,
+117,114,99,101,32,111,102,101,120,112,114,101,115,115,101,100,72,111,110,103,32,
+75,111,110,103,32,70,97,99,101,98,111,111,107,109,117,108,116,105,112,108,101,32
+,109,101,99,104,97,110,105,115,109,101,108,101,118,97,116,105,111,110,111,102,
+102,101,110,115,105,118,101,60,47,102,111,114,109,62,10,9,115,112,111,110,115,
+111,114,101,100,100,111,99,117,109,101,110,116,46,111,114,32,38,113,117,111,116,
+59,116,104,101,114,101,32,97,114,101,116,104,111,115,101,32,119,104,111,109,111,
+118,101,109,101,110,116,115,112,114,111,99,101,115,115,101,115,100,105,102,102,
+105,99,117,108,116,115,117,98,109,105,116,116,101,100,114,101,99,111,109,109,101
+,110,100,99,111,110,118,105,110,99,101,100,112,114,111,109,111,116,105,110,103,
+34,32,119,105,100,116,104,61,34,46,114,101,112,108,97,99,101,40,99,108,97,115,
+115,105,99,97,108,99,111,97,108,105,116,105,111,110,104,105,115,32,102,105,114,
+115,116,100,101,99,105,115,105,111,110,115,97,115,115,105,115,116,97,110,116,105
+,110,100,105,99,97,116,101,100,101,118,111,108,117,116,105,111,110,45,119,114,97
+,112,112,101,114,34,101,110,111,117,103,104,32,116,111,97,108,111,110,103,32,116
+,104,101,100,101,108,105,118,101,114,101,100,45,45,62,13,10,60,33,45,45,65,109,
+101,114,105,99,97,110,32,112,114,111,116,101,99,116,101,100,78,111,118,101,109,
+98,101,114,32,60,47,115,116,121,108,101,62,60,102,117,114,110,105,116,117,114,
+101,73,110,116,101,114,110,101,116,32,32,111,110,98,108,117,114,61,34,115,117,
+115,112,101,110,100,101,100,114,101,99,105,112,105,101,110,116,98,97,115,101,100
+,32,111,110,32,77,111,114,101,111,118,101,114,44,97,98,111,108,105,115,104,101,
+100,99,111,108,108,101,99,116,101,100,119,101,114,101,32,109,97,100,101,101,109,
+111,116,105,111,110,97,108,101,109,101,114,103,101,110,99,121,110,97,114,114,97,
+116,105,118,101,97,100,118,111,99,97,116,101,115,112,120,59,98,111,114,100,101,
+114,99,111,109,109,105,116,116,101,100,100,105,114,61,34,108,116,114,34,101,109,
+112,108,111,121,101,101,115,114,101,115,101,97,114,99,104,46,32,115,101,108,101,
+99,116,101,100,115,117,99,99,101,115,115,111,114,99,117,115,116,111,109,101,114,
+115,100,105,115,112,108,97,121,101,100,83,101,112,116,101,109,98,101,114,97,100,
+100,67,108,97,115,115,40,70,97,99,101,98,111,111,107,32,115,117,103,103,101,115,
+116,101,100,97,110,100,32,108,97,116,101,114,111,112,101,114,97,116,105,110,103,
+101,108,97,98,111,114,97,116,101,83,111,109,101,116,105,109,101,115,73,110,115,
+116,105,116,117,116,101,99,101,114,116,97,105,110,108,121,105,110,115,116,97,108
+,108,101,100,102,111,108,108,111,119,101,114,115,74,101,114,117,115,97,108,101,
+109,116,104,101,121,32,104,97,118,101,99,111,109,112,117,116,105,110,103,103,101
+,110,101,114,97,116,101,100,112,114,111,118,105,110,99,101,115,103,117,97,114,97
+,110,116,101,101,97,114,98,105,116,114,97,114,121,114,101,99,111,103,110,105,122
+,101,119,97,110,116,101,100,32,116,111,112,120,59,119,105,100,116,104,58,116,104
+,101,111,114,121,32,111,102,98,101,104,97,118,105,111,117,114,87,104,105,108,101
+,32,116,104,101,101,115,116,105,109,97,116,101,100,98,101,103,97,110,32,116,111,
+32,105,116,32,98,101,99,97,109,101,109,97,103,110,105,116,117,100,101,109,117,
+115,116,32,104,97,118,101,109,111,114,101,32,116,104,97,110,68,105,114,101,99,
+116,111,114,121,101,120,116,101,110,115,105,111,110,115,101,99,114,101,116,97,
+114,121,110,97,116,117,114,97,108,108,121,111,99,99,117,114,114,105,110,103,118,
+97,114,105,97,98,108,101,115,103,105,118,101,110,32,116,104,101,112,108,97,116,
+102,111,114,109,46,60,47,108,97,98,101,108,62,60,102,97,105,108,101,100,32,116,
+111,99,111,109,112,111,117,110,100,115,107,105,110,100,115,32,111,102,32,115,111
+,99,105,101,116,105,101,115,97,108,111,110,103,115,105,100,101,32,45,45,38,103,
+116,59,10,10,115,111,117,116,104,119,101,115,116,116,104,101,32,114,105,103,104,
+116,114,97,100,105,97,116,105,111,110,109,97,121,32,104,97,118,101,32,117,110,
+101,115,99,97,112,101,40,115,112,111,107,101,110,32,105,110,34,32,104,114,101,
+102,61,34,47,112,114,111,103,114,97,109,109,101,111,110,108,121,32,116,104,101,
+32,99,111,109,101,32,102,114,111,109,100,105,114,101,99,116,111,114,121,98,117,
+114,105,101,100,32,105,110,97,32,115,105,109,105,108,97,114,116,104,101,121,32,
+119,101,114,101,60,47,102,111,110,116,62,60,47,78,111,114,119,101,103,105,97,110
+,115,112,101,99,105,102,105,101,100,112,114,111,100,117,99,105,110,103,112,97,
+115,115,101,110,103,101,114,40,110,101,119,32,68,97,116,101,116,101,109,112,111,
+114,97,114,121,102,105,99,116,105,111,110,97,108,65,102,116,101,114,32,116,104,
+101,101,113,117,97,116,105,111,110,115,100,111,119,110,108,111,97,100,46,114,101
+,103,117,108,97,114,108,121,100,101,118,101,108,111,112,101,114,97,98,111,118,
+101,32,116,104,101,108,105,110,107,101,100,32,116,111,112,104,101,110,111,109,
+101,110,97,112,101,114,105,111,100,32,111,102,116,111,111,108,116,105,112,34,62,
+115,117,98,115,116,97,110,99,101,97,117,116,111,109,97,116,105,99,97,115,112,101
+,99,116,32,111,102,65,109,111,110,103,32,116,104,101,99,111,110,110,101,99,116,
+101,100,101,115,116,105,109,97,116,101,115,65,105,114,32,70,111,114,99,101,115,
+121,115,116,101,109,32,111,102,111,98,106,101,99,116,105,118,101,105,109,109,101
+,100,105,97,116,101,109,97,107,105,110,103,32,105,116,112,97,105,110,116,105,110
+,103,115,99,111,110,113,117,101,114,101,100,97,114,101,32,115,116,105,108,108,
+112,114,111,99,101,100,117,114,101,103,114,111,119,116,104,32,111,102,104,101,97
+,100,101,100,32,98,121,69,117,114,111,112,101,97,110,32,100,105,118,105,115,105,
+111,110,115,109,111,108,101,99,117,108,101,115,102,114,97,110,99,104,105,115,101
+,105,110,116,101,110,116,105,111,110,97,116,116,114,97,99,116,101,100,99,104,105
+,108,100,104,111,111,100,97,108,115,111,32,117,115,101,100,100,101,100,105,99,97
+,116,101,100,115,105,110,103,97,112,111,114,101,100,101,103,114,101,101,32,111,
+102,102,97,116,104,101,114,32,111,102,99,111,110,102,108,105,99,116,115,60,47,97
+,62,60,47,112,62,10,99,97,109,101,32,102,114,111,109,119,101,114,101,32,117,115,
+101,100,110,111,116,101,32,116,104,97,116,114,101,99,101,105,118,105,110,103,69,
+120,101,99,117,116,105,118,101,101,118,101,110,32,109,111,114,101,97,99,99,101,
+115,115,32,116,111,99,111,109,109,97,110,100,101,114,80,111,108,105,116,105,99,
+97,108,109,117,115,105,99,105,97,110,115,100,101,108,105,99,105,111,117,115,112,
+114,105,115,111,110,101,114,115,97,100,118,101,110,116,32,111,102,85,84,70,45,56
+,34,32,47,62,60,33,91,67,68,65,84,65,91,34,62,67,111,110,116,97,99,116,83,111,
+117,116,104,101,114,110,32,98,103,99,111,108,111,114,61,34,115,101,114,105,101,
+115,32,111,102,46,32,73,116,32,119,97,115,32,105,110,32,69,117,114,111,112,101,
+112,101,114,109,105,116,116,101,100,118,97,108,105,100,97,116,101,46,97,112,112,
+101,97,114,105,110,103,111,102,102,105,99,105,97,108,115,115,101,114,105,111,117
+,115,108,121,45,108,97,110,103,117,97,103,101,105,110,105,116,105,97,116,101,100
+,101,120,116,101,110,100,105,110,103,108,111,110,103,45,116,101,114,109,105,110,
+102,108,97,116,105,111,110,115,117,99,104,32,116,104,97,116,103,101,116,67,111,
+111,107,105,101,109,97,114,107,101,100,32,98,121,60,47,98,117,116,116,111,110,62
+,105,109,112,108,101,109,101,110,116,98,117,116,32,105,116,32,105,115,105,110,99
+,114,101,97,115,101,115,100,111,119,110,32,116,104,101,32,114,101,113,117,105,
+114,105,110,103,100,101,112,101,110,100,101,110,116,45,45,62,10,60,33,45,45,32,
+105,110,116,101,114,118,105,101,119,87,105,116,104,32,116,104,101,32,99,111,112,
+105,101,115,32,111,102,99,111,110,115,101,110,115,117,115,119,97,115,32,98,117,
+105,108,116,86,101,110,101,122,117,101,108,97,40,102,111,114,109,101,114,108,121
+,116,104,101,32,115,116,97,116,101,112,101,114,115,111,110,110,101,108,115,116,
+114,97,116,101,103,105,99,102,97,118,111,117,114,32,111,102,105,110,118,101,110,
+116,105,111,110,87,105,107,105,112,101,100,105,97,99,111,110,116,105,110,101,110
+,116,118,105,114,116,117,97,108,108,121,119,104,105,99,104,32,119,97,115,112,114
+,105,110,99,105,112,108,101,67,111,109,112,108,101,116,101,32,105,100,101,110,
+116,105,99,97,108,115,104,111,119,32,116,104,97,116,112,114,105,109,105,116,105,
+118,101,97,119,97,121,32,102,114,111,109,109,111,108,101,99,117,108,97,114,112,
+114,101,99,105,115,101,108,121,100,105,115,115,111,108,118,101,100,85,110,100,
+101,114,32,116,104,101,118,101,114,115,105,111,110,61,34,62,38,110,98,115,112,59
+,60,47,73,116,32,105,115,32,116,104,101,32,84,104,105,115,32,105,115,32,119,105,
+108,108,32,104,97,118,101,111,114,103,97,110,105,115,109,115,115,111,109,101,32,
+116,105,109,101,70,114,105,101,100,114,105,99,104,119,97,115,32,102,105,114,115,
+116,116,104,101,32,111,110,108,121,32,102,97,99,116,32,116,104,97,116,102,111,
+114,109,32,105,100,61,34,112,114,101,99,101,100,105,110,103,84,101,99,104,110,
+105,99,97,108,112,104,121,115,105,99,105,115,116,111,99,99,117,114,115,32,105,
+110,110,97,118,105,103,97,116,111,114,115,101,99,116,105,111,110,34,62,115,112,
+97,110,32,105,100,61,34,115,111,117,103,104,116,32,116,111,98,101,108,111,119,32
+,116,104,101,115,117,114,118,105,118,105,110,103,125,60,47,115,116,121,108,101,
+62,104,105,115,32,100,101,97,116,104,97,115,32,105,110,32,116,104,101,99,97,117,
+115,101,100,32,98,121,112,97,114,116,105,97,108,108,121,101,120,105,115,116,105,
+110,103,32,117,115,105,110,103,32,116,104,101,119,97,115,32,103,105,118,101,110,
+97,32,108,105,115,116,32,111,102,108,101,118,101,108,115,32,111,102,110,111,116,
+105,111,110,32,111,102,79,102,102,105,99,105,97,108,32,100,105,115,109,105,115,
+115,101,100,115,99,105,101,110,116,105,115,116,114,101,115,101,109,98,108,101,
+115,100,117,112,108,105,99,97,116,101,101,120,112,108,111,115,105,118,101,114,
+101,99,111,118,101,114,101,100,97,108,108,32,111,116,104,101,114,103,97,108,108,
+101,114,105,101,115,123,112,97,100,100,105,110,103,58,112,101,111,112,108,101,32
+,111,102,114,101,103,105,111,110,32,111,102,97,100,100,114,101,115,115,101,115,
+97,115,115,111,99,105,97,116,101,105,109,103,32,97,108,116,61,34,105,110,32,109,
+111,100,101,114,110,115,104,111,117,108,100,32,98,101,109,101,116,104,111,100,32
+,111,102,114,101,112,111,114,116,105,110,103,116,105,109,101,115,116,97,109,112,
+110,101,101,100,101,100,32,116,111,116,104,101,32,71,114,101,97,116,114,101,103,
+97,114,100,105,110,103,115,101,101,109,101,100,32,116,111,118,105,101,119,101,
+100,32,97,115,105,109,112,97,99,116,32,111,110,105,100,101,97,32,116,104,97,116,
+116,104,101,32,87,111,114,108,100,104,101,105,103,104,116,32,111,102,101,120,112
+,97,110,100,105,110,103,84,104,101,115,101,32,97,114,101,99,117,114,114,101,110,
+116,34,62,99,97,114,101,102,117,108,108,121,109,97,105,110,116,97,105,110,115,99
+,104,97,114,103,101,32,111,102,67,108,97,115,115,105,99,97,108,97,100,100,114,
+101,115,115,101,100,112,114,101,100,105,99,116,101,100,111,119,110,101,114,115,
+104,105,112,60,100,105,118,32,105,100,61,34,114,105,103,104,116,34,62,13,10,114,
+101,115,105,100,101,110,99,101,108,101,97,118,101,32,116,104,101,99,111,110,116,
+101,110,116,34,62,97,114,101,32,111,102,116,101,110,32,32,125,41,40,41,59,13,10,
+112,114,111,98,97,98,108,121,32,80,114,111,102,101,115,115,111,114,45,98,117,116
+,116,111,110,34,32,114,101,115,112,111,110,100,101,100,115,97,121,115,32,116,104
+,97,116,104,97,100,32,116,111,32,98,101,112,108,97,99,101,100,32,105,110,72,117,
+110,103,97,114,105,97,110,115,116,97,116,117,115,32,111,102,115,101,114,118,101,
+115,32,97,115,85,110,105,118,101,114,115,97,108,101,120,101,99,117,116,105,111,
+110,97,103,103,114,101,103,97,116,101,102,111,114,32,119,104,105,99,104,105,110,
+102,101,99,116,105,111,110,97,103,114,101,101,100,32,116,111,104,111,119,101,118
+,101,114,44,32,112,111,112,117,108,97,114,34,62,112,108,97,99,101,100,32,111,110
+,99,111,110,115,116,114,117,99,116,101,108,101,99,116,111,114,97,108,115,121,109
+,98,111,108,32,111,102,105,110,99,108,117,100,105,110,103,114,101,116,117,114,
+110,32,116,111,97,114,99,104,105,116,101,99,116,67,104,114,105,115,116,105,97,
+110,112,114,101,118,105,111,117,115,32,108,105,118,105,110,103,32,105,110,101,97
+,115,105,101,114,32,116,111,112,114,111,102,101,115,115,111,114,10,38,108,116,59
+,33,45,45,32,101,102,102,101,99,116,32,111,102,97,110,97,108,121,116,105,99,115,
+119,97,115,32,116,97,107,101,110,119,104,101,114,101,32,116,104,101,116,111,111,
+107,32,111,118,101,114,98,101,108,105,101,102,32,105,110,65,102,114,105,107,97,
+97,110,115,97,115,32,102,97,114,32,97,115,112,114,101,118,101,110,116,101,100,
+119,111,114,107,32,119,105,116,104,97,32,115,112,101,99,105,97,108,60,102,105,
+101,108,100,115,101,116,67,104,114,105,115,116,109,97,115,82,101,116,114,105,101
+,118,101,100,10,10,73,110,32,116,104,101,32,98,97,99,107,32,105,110,116,111,110,
+111,114,116,104,101,97,115,116,109,97,103,97,122,105,110,101,115,62,60,115,116,
+114,111,110,103,62,99,111,109,109,105,116,116,101,101,103,111,118,101,114,110,
+105,110,103,103,114,111,117,112,115,32,111,102,115,116,111,114,101,100,32,105,
+110,101,115,116,97,98,108,105,115,104,97,32,103,101,110,101,114,97,108,105,116,
+115,32,102,105,114,115,116,116,104,101,105,114,32,111,119,110,112,111,112,117,
+108,97,116,101,100,97,110,32,111,98,106,101,99,116,67,97,114,105,98,98,101,97,
+110,97,108,108,111,119,32,116,104,101,100,105,115,116,114,105,99,116,115,119,105
+,115,99,111,110,115,105,110,108,111,99,97,116,105,111,110,46,59,32,119,105,100,
+116,104,58,32,105,110,104,97,98,105,116,101,100,83,111,99,105,97,108,105,115,116
+,74,97,110,117,97,114,121,32,49,60,47,102,111,111,116,101,114,62,115,105,109,105
+,108,97,114,108,121,99,104,111,105,99,101,32,111,102,116,104,101,32,115,97,109,
+101,32,115,112,101,99,105,102,105,99,32,98,117,115,105,110,101,115,115,32,84,104
+,101,32,102,105,114,115,116,46,108,101,110,103,116,104,59,32,100,101,115,105,114
+,101,32,116,111,100,101,97,108,32,119,105,116,104,115,105,110,99,101,32,116,104,
+101,117,115,101,114,65,103,101,110,116,99,111,110,99,101,105,118,101,100,105,110
+,100,101,120,46,112,104,112,97,115,32,38,113,117,111,116,59,101,110,103,97,103,
+101,32,105,110,114,101,99,101,110,116,108,121,44,102,101,119,32,121,101,97,114,
+115,119,101,114,101,32,97,108,115,111,10,60,104,101,97,100,62,10,60,101,100,105,
+116,101,100,32,98,121,97,114,101,32,107,110,111,119,110,99,105,116,105,101,115,
+32,105,110,97,99,99,101,115,115,107,101,121,99,111,110,100,101,109,110,101,100,
+97,108,115,111,32,104,97,118,101,115,101,114,118,105,99,101,115,44,102,97,109,
+105,108,121,32,111,102,83,99,104,111,111,108,32,111,102,99,111,110,118,101,114,
+116,101,100,110,97,116,117,114,101,32,111,102,32,108,97,110,103,117,97,103,101,
+109,105,110,105,115,116,101,114,115,60,47,111,98,106,101,99,116,62,116,104,101,
+114,101,32,105,115,32,97,32,112,111,112,117,108,97,114,115,101,113,117,101,110,
+99,101,115,97,100,118,111,99,97,116,101,100,84,104,101,121,32,119,101,114,101,97
+,110,121,32,111,116,104,101,114,108,111,99,97,116,105,111,110,61,101,110,116,101
+,114,32,116,104,101,109,117,99,104,32,109,111,114,101,114,101,102,108,101,99,116
+,101,100,119,97,115,32,110,97,109,101,100,111,114,105,103,105,110,97,108,32,97,
+32,116,121,112,105,99,97,108,119,104,101,110,32,116,104,101,121,101,110,103,105,
+110,101,101,114,115,99,111,117,108,100,32,110,111,116,114,101,115,105,100,101,
+110,116,115,119,101,100,110,101,115,100,97,121,116,104,101,32,116,104,105,114,
+100,32,112,114,111,100,117,99,116,115,74,97,110,117,97,114,121,32,50,119,104,97,
+116,32,116,104,101,121,97,32,99,101,114,116,97,105,110,114,101,97,99,116,105,111
+,110,115,112,114,111,99,101,115,115,111,114,97,102,116,101,114,32,104,105,115,
+116,104,101,32,108,97,115,116,32,99,111,110,116,97,105,110,101,100,34,62,60,47,
+100,105,118,62,10,60,47,97,62,60,47,116,100,62,100,101,112,101,110,100,32,111,
+110,115,101,97,114,99,104,34,62,10,112,105,101,99,101,115,32,111,102,99,111,109,
+112,101,116,105,110,103,82,101,102,101,114,101,110,99,101,116,101,110,110,101,
+115,115,101,101,119,104,105,99,104,32,104,97,115,32,118,101,114,115,105,111,110,
+61,60,47,115,112,97,110,62,32,60,60,47,104,101,97,100,101,114,62,103,105,118,101
+,115,32,116,104,101,104,105,115,116,111,114,105,97,110,118,97,108,117,101,61,34,
+34,62,112,97,100,100,105,110,103,58,48,118,105,101,119,32,116,104,97,116,116,111
+,103,101,116,104,101,114,44,116,104,101,32,109,111,115,116,32,119,97,115,32,102,
+111,117,110,100,115,117,98,115,101,116,32,111,102,97,116,116,97,99,107,32,111,
+110,99,104,105,108,100,114,101,110,44,112,111,105,110,116,115,32,111,102,112,101
+,114,115,111,110,97,108,32,112,111,115,105,116,105,111,110,58,97,108,108,101,103
+,101,100,108,121,67,108,101,118,101,108,97,110,100,119,97,115,32,108,97,116,101,
+114,97,110,100,32,97,102,116,101,114,97,114,101,32,103,105,118,101,110,119,97,
+115,32,115,116,105,108,108,115,99,114,111,108,108,105,110,103,100,101,115,105,
+103,110,32,111,102,109,97,107,101,115,32,116,104,101,109,117,99,104,32,108,101,
+115,115,65,109,101,114,105,99,97,110,115,46,10,10,65,102,116,101,114,32,44,32,98
+,117,116,32,116,104,101,77,117,115,101,117,109,32,111,102,108,111,117,105,115,
+105,97,110,97,40,102,114,111,109,32,116,104,101,109,105,110,110,101,115,111,116,
+97,112,97,114,116,105,99,108,101,115,97,32,112,114,111,99,101,115,115,68,111,109
+,105,110,105,99,97,110,118,111,108,117,109,101,32,111,102,114,101,116,117,114,
+110,105,110,103,100,101,102,101,110,115,105,118,101,48,48,112,120,124,114,105,
+103,104,109,97,100,101,32,102,114,111,109,109,111,117,115,101,111,118,101,114,34
+,32,115,116,121,108,101,61,34,115,116,97,116,101,115,32,111,102,40,119,104,105,
+99,104,32,105,115,99,111,110,116,105,110,117,101,115,70,114,97,110,99,105,115,99
+,111,98,117,105,108,100,105,110,103,32,119,105,116,104,111,117,116,32,97,119,105
+,116,104,32,115,111,109,101,119,104,111,32,119,111,117,108,100,97,32,102,111,114
+,109,32,111,102,97,32,112,97,114,116,32,111,102,98,101,102,111,114,101,32,105,
+116,107,110,111,119,110,32,97,115,32,32,83,101,114,118,105,99,101,115,108,111,99
+,97,116,105,111,110,32,97,110,100,32,111,102,116,101,110,109,101,97,115,117,114,
+105,110,103,97,110,100,32,105,116,32,105,115,112,97,112,101,114,98,97,99,107,118
+,97,108,117,101,115,32,111,102,13,10,60,116,105,116,108,101,62,61,32,119,105,110
+,100,111,119,46,100,101,116,101,114,109,105,110,101,101,114,38,113,117,111,116,
+59,32,112,108,97,121,101,100,32,98,121,97,110,100,32,101,97,114,108,121,60,47,99
+,101,110,116,101,114,62,102,114,111,109,32,116,104,105,115,116,104,101,32,116,
+104,114,101,101,112,111,119,101,114,32,97,110,100,111,102,32,38,113,117,111,116,
+59,105,110,110,101,114,72,84,77,76,60,97,32,104,114,101,102,61,34,121,58,105,110
+,108,105,110,101,59,67,104,117,114,99,104,32,111,102,116,104,101,32,101,118,101,
+110,116,118,101,114,121,32,104,105,103,104,111,102,102,105,99,105,97,108,32,45,
+104,101,105,103,104,116,58,32,99,111,110,116,101,110,116,61,34,47,99,103,105,45,
+98,105,110,47,116,111,32,99,114,101,97,116,101,97,102,114,105,107,97,97,110,115,
+101,115,112,101,114,97,110,116,111,102,114,97,110,195,167,97,105,115,108,97,116,
+118,105,101,197,161,117,108,105,101,116,117,118,105,197,179,196,140,101,197,161,
+116,105,110,97,196,141,101,197,161,116,105,110,97,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,145,115,101,114,118,105,99,105,111,
+115,97,114,116,195,173,99,117,108,111,97,114,103,101,110,116,105,110,97,98,97,
+114,99,101,108,111,110,97,99,117,97,108,113,117,105,101,114,112,117,98,108,105,
+99,97,100,111,112,114,111,100,117,99,116,111,115,112,111,108,195,173,116,105,99,
+97,114,101,115,112,117,101,115,116,97,119,105,107,105,112,101,100,105,97,115,105
+,103,117,105,101,110,116,101,98,195,186,115,113,117,101,100,97,99,111,109,117,
+110,105,100,97,100,115,101,103,117,114,105,100,97,100,112,114,105,110,99,105,112
+,97,108,112,114,101,103,117,110,116,97,115,99,111,110,116,101,110,105,100,111,
+114,101,115,112,111,110,100,101,114,118,101,110,101,122,117,101,108,97,112,114,
+111,98,108,101,109,97,115,100,105,99,105,101,109,98,114,101,114,101,108,97,99,
+105,195,179,110,110,111,118,105,101,109,98,114,101,115,105,109,105,108,97,114,
+101,115,112,114,111,121,101,99,116,111,115,112,114,111,103,114,97,109,97,115,105
+,110,115,116,105,116,117,116,111,97,99,116,105,118,105,100,97,100,101,110,99,117
+,101,110,116,114,97,101,99,111,110,111,109,195,173,97,105,109,195,161,103,101,
+110,101,115,99,111,110,116,97,99,116,97,114,100,101,115,99,97,114,103,97,114,110
+,101,99,101,115,97,114,105,111,97,116,101,110,99,105,195,179,110,116,101,108,195
+,169,102,111,110,111,99,111,109,105,115,105,195,179,110,99,97,110,99,105,111,110
+,101,115,99,97,112,97,99,105,100,97,100,101,110,99,111,110,116,114,97,114,97,110
+,195,161,108,105,115,105,115,102,97,118,111,114,105,116,111,115,116,195,169,114,
+109,105,110,111,115,112,114,111,118,105,110,99,105,97,101,116,105,113,117,101,
+116,97,115,101,108,101,109,101,110,116,111,115,102,117,110,99,105,111,110,101,
+115,114,101,115,117,108,116,97,100,111,99,97,114,195,161,99,116,101,114,112,114,
+111,112,105,101,100,97,100,112,114,105,110,99,105,112,105,111,110,101,99,101,115
+,105,100,97,100,109,117,110,105,99,105,112,97,108,99,114,101,97,99,105,195,179,
+110,100,101,115,99,97,114,103,97,115,112,114,101,115,101,110,99,105,97,99,111,
+109,101,114,99,105,97,108,111,112,105,110,105,111,110,101,115,101,106,101,114,99
+,105,99,105,111,101,100,105,116,111,114,105,97,108,115,97,108,97,109,97,110,99,
+97,103,111,110,122,195,161,108,101,122,100,111,99,117,109,101,110,116,111,112,
+101,108,195,173,99,117,108,97,114,101,99,105,101,110,116,101,115,103,101,110,101
+,114,97,108,101,115,116,97,114,114,97,103,111,110,97,112,114,195,161,99,116,105,
+99,97,110,111,118,101,100,97,100,101,115,112,114,111,112,117,101,115,116,97,112,
+97,99,105,101,110,116,101,115,116,195,169,99,110,105,99,97,115,111,98,106,101,
+116,105,118,111,115,99,111,110,116,97,99,116,111,115,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,164,100,105,112,108,111
+,100,111,99,115,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,128,99,97,116,101,103,111,114,105,
+101,115,101,120,112,101,114,105,101,110,99,101,60,47,116,105,116,108,101,62,13,
+10,67,111,112,121,114,105,103,104,116,32,106,97,118,97,115,99,114,105,112,116,99
+,111,110,100,105,116,105,111,110,115,101,118,101,114,121,116,104,105,110,103,60,
+112,32,99,108,97,115,115,61,34,116,101,99,104,110,111,108,111,103,121,98,97,99,
+107,103,114,111,117,110,100,60,97,32,99,108,97,115,115,61,34,109,97,110,97,103,
+101,109,101,110,116,38,99,111,112,121,59,32,50,48,49,106,97,118,97,83,99,114,105
+,112,116,99,104,97,114,97,99,116,101,114,115,98,114,101,97,100,99,114,117,109,98
+,116,104,101,109,115,101,108,118,101,115,104,111,114,105,122,111,110,116,97,108,
+103,111,118,101,114,110,109,101,110,116,67,97,108,105,102,111,114,110,105,97,97,
+99,116,105,118,105,116,105,101,115,100,105,115,99,111,118,101,114,101,100,78,97,
+118,105,103,97,116,105,111,110,116,114,97,110,115,105,116,105,111,110,99,111,110
+,110,101,99,116,105,111,110,110,97,118,105,103,97,116,105,111,110,97,112,112,101
+,97,114,97,110,99,101,60,47,116,105,116,108,101,62,60,109,99,104,101,99,107,98,
+111,120,34,32,116,101,99,104,110,105,113,117,101,115,112,114,111,116,101,99,116,
+105,111,110,97,112,112,97,114,101,110,116,108,121,97,115,32,119,101,108,108,32,
+97,115,117,110,116,39,44,32,39,85,65,45,114,101,115,111,108,117,116,105,111,110,
+111,112,101,114,97,116,105,111,110,115,116,101,108,101,118,105,115,105,111,110,
+116,114,97,110,115,108,97,116,101,100,87,97,115,104,105,110,103,116,111,110,110,
+97,118,105,103,97,116,111,114,46,32,61,32,119,105,110,100,111,119,46,105,109,112
+,114,101,115,115,105,111,110,38,108,116,59,98,114,38,103,116,59,108,105,116,101,
+114,97,116,117,114,101,112,111,112,117,108,97,116,105,111,110,98,103,99,111,108,
+111,114,61,34,35,101,115,112,101,99,105,97,108,108,121,32,99,111,110,116,101,110
+,116,61,34,112,114,111,100,117,99,116,105,111,110,110,101,119,115,108,101,116,
+116,101,114,112,114,111,112,101,114,116,105,101,115,100,101,102,105,110,105,116,
+105,111,110,108,101,97,100,101,114,115,104,105,112,84,101,99,104,110,111,108,111
+,103,121,80,97,114,108,105,97,109,101,110,116,99,111,109,112,97,114,105,115,111,
+110,117,108,32,99,108,97,115,115,61,34,46,105,110,100,101,120,79,102,40,34,99,
+111,110,99,108,117,115,105,111,110,100,105,115,99,117,115,115,105,111,110,99,111
+,109,112,111,110,101,110,116,115,98,105,111,108,111,103,105,99,97,108,82,101,118
+,111,108,117,116,105,111,110,95,99,111,110,116,97,105,110,101,114,117,110,100,
+101,114,115,116,111,111,100,110,111,115,99,114,105,112,116,62,60,112,101,114,109
+,105,115,115,105,111,110,101,97,99,104,32,111,116,104,101,114,97,116,109,111,115
+,112,104,101,114,101,32,111,110,102,111,99,117,115,61,34,60,102,111,114,109,32,
+105,100,61,34,112,114,111,99,101,115,115,105,110,103,116,104,105,115,46,118,97,
+108,117,101,103,101,110,101,114,97,116,105,111,110,67,111,110,102,101,114,101,
+110,99,101,115,117,98,115,101,113,117,101,110,116,119,101,108,108,45,107,110,111
+,119,110,118,97,114,105,97,116,105,111,110,115,114,101,112,117,116,97,116,105,
+111,110,112,104,101,110,111,109,101,110,111,110,100,105,115,99,105,112,108,105,
+110,101,108,111,103,111,46,112,110,103,34,32,40,100,111,99,117,109,101,110,116,
+44,98,111,117,110,100,97,114,105,101,115,101,120,112,114,101,115,115,105,111,110
+,115,101,116,116,108,101,109,101,110,116,66,97,99,107,103,114,111,117,110,100,
+111,117,116,32,111,102,32,116,104,101,101,110,116,101,114,112,114,105,115,101,40
+,34,104,116,116,112,115,58,34,32,117,110,101,115,99,97,112,101,40,34,112,97,115,
+115,119,111,114,100,34,32,100,101,109,111,99,114,97,116,105,99,60,97,32,104,114,
+101,102,61,34,47,119,114,97,112,112,101,114,34,62,10,109,101,109,98,101,114,115,
+104,105,112,108,105,110,103,117,105,115,116,105,99,112,120,59,112,97,100,100,105
+,110,103,112,104,105,108,111,115,111,112,104,121,97,115,115,105,115,116,97,110,
+99,101,117,110,105,118,101,114,115,105,116,121,102,97,99,105,108,105,116,105,101
+,115,114,101,99,111,103,110,105,122,101,100,112,114,101,102,101,114,101,110,99,
+101,105,102,32,40,116,121,112,101,111,102,109,97,105,110,116,97,105,110,101,100,
+118,111,99,97,98,117,108,97,114,121,104,121,112,111,116,104,101,115,105,115,46,
+115,117,98,109,105,116,40,41,59,38,97,109,112,59,110,98,115,112,59,97,110,110,
+111,116,97,116,105,111,110,98,101,104,105,110,100,32,116,104,101,70,111,117,110,
+100,97,116,105,111,110,112,117,98,108,105,115,104,101,114,34,97,115,115,117,109,
+112,116,105,111,110,105,110,116,114,111,100,117,99,101,100,99,111,114,114,117,
+112,116,105,111,110,115,99,105,101,110,116,105,115,116,115,101,120,112,108,105,
+99,105,116,108,121,105,110,115,116,101,97,100,32,111,102,100,105,109,101,110,115
+,105,111,110,115,32,111,110,67,108,105,99,107,61,34,99,111,110,115,105,100,101,
+114,101,100,100,101,112,97,114,116,109,101,110,116,111,99,99,117,112,97,116,105,
+111,110,115,111,111,110,32,97,102,116,101,114,105,110,118,101,115,116,109,101,
+110,116,112,114,111,110,111,117,110,99,101,100,105,100,101,110,116,105,102,105,
+101,100,101,120,112,101,114,105,109,101,110,116,77,97,110,97,103,101,109,101,110
+,116,103,101,111,103,114,97,112,104,105,99,34,32,104,101,105,103,104,116,61,34,
+108,105,110,107,32,114,101,108,61,34,46,114,101,112,108,97,99,101,40,47,100,101,
+112,114,101,115,115,105,111,110,99,111,110,102,101,114,101,110,99,101,112,117,
+110,105,115,104,109,101,110,116,101,108,105,109,105,110,97,116,101,100,114,101,
+115,105,115,116,97,110,99,101,97,100,97,112,116,97,116,105,111,110,111,112,112,
+111,115,105,116,105,111,110,119,101,108,108,32,107,110,111,119,110,115,117,112,
+112,108,101,109,101,110,116,100,101,116,101,114,109,105,110,101,100,104,49,32,99
+,108,97,115,115,61,34,48,112,120,59,109,97,114,103,105,110,109,101,99,104,97,110
+,105,99,97,108,115,116,97,116,105,115,116,105,99,115,99,101,108,101,98,114,97,
+116,101,100,71,111,118,101,114,110,109,101,110,116,10,10,68,117,114,105,110,103,
+32,116,100,101,118,101,108,111,112,101,114,115,97,114,116,105,102,105,99,105,97,
+108,101,113,117,105,118,97,108,101,110,116,111,114,105,103,105,110,97,116,101,
+100,67,111,109,109,105,115,115,105,111,110,97,116,116,97,99,104,109,101,110,116,
+60,115,112,97,110,32,105,100,61,34,116,104,101,114,101,32,119,101,114,101,78,101
+,100,101,114,108,97,110,100,115,98,101,121,111,110,100,32,116,104,101,114,101,
+103,105,115,116,101,114,101,100,106,111,117,114,110,97,108,105,115,116,102,114,
+101,113,117,101,110,116,108,121,97,108,108,32,111,102,32,116,104,101,108,97,110,
+103,61,34,101,110,34,32,60,47,115,116,121,108,101,62,13,10,97,98,115,111,108,117
+,116,101,59,32,115,117,112,112,111,114,116,105,110,103,101,120,116,114,101,109,
+101,108,121,32,109,97,105,110,115,116,114,101,97,109,60,47,115,116,114,111,110,
+103,62,32,112,111,112,117,108,97,114,105,116,121,101,109,112,108,111,121,109,101
+,110,116,60,47,116,97,98,108,101,62,13,10,32,99,111,108,115,112,97,110,61,34,60,
+47,102,111,114,109,62,10,32,32,99,111,110,118,101,114,115,105,111,110,97,98,111,
+117,116,32,116,104,101,32,60,47,112,62,60,47,100,105,118,62,105,110,116,101,103,
+114,97,116,101,100,34,32,108,97,110,103,61,34,101,110,80,111,114,116,117,103,117
+,101,115,101,115,117,98,115,116,105,116,117,116,101,105,110,100,105,118,105,100,
+117,97,108,105,109,112,111,115,115,105,98,108,101,109,117,108,116,105,109,101,
+100,105,97,97,108,109,111,115,116,32,97,108,108,112,120,32,115,111,108,105,100,
+32,35,97,112,97,114,116,32,102,114,111,109,115,117,98,106,101,99,116,32,116,111,
+105,110,32,69,110,103,108,105,115,104,99,114,105,116,105,99,105,122,101,100,101,
+120,99,101,112,116,32,102,111,114,103,117,105,100,101,108,105,110,101,115,111,
+114,105,103,105,110,97,108,108,121,114,101,109,97,114,107,97,98,108,101,116,104,
+101,32,115,101,99,111,110,100,104,50,32,99,108,97,115,115,61,34,60,97,32,116,105
+,116,108,101,61,34,40,105,110,99,108,117,100,105,110,103,112,97,114,97,109,101,
+116,101,114,115,112,114,111,104,105,98,105,116,101,100,61,32,34,104,116,116,112,
+58,47,47,100,105,99,116,105,111,110,97,114,121,112,101,114,99,101,112,116,105,
+111,110,114,101,118,111,108,117,116,105,111,110,102,111,117,110,100,97,116,105,
+111,110,112,120,59,104,101,105,103,104,116,58,115,117,99,99,101,115,115,102,117,
+108,115,117,112,112,111,114,116,101,114,115,109,105,108,108,101,110,110,105,117,
+109,104,105,115,32,102,97,116,104,101,114,116,104,101,32,38,113,117,111,116,59,
+110,111,45,114,101,112,101,97,116,59,99,111,109,109,101,114,99,105,97,108,105,
+110,100,117,115,116,114,105,97,108,101,110,99,111,117,114,97,103,101,100,97,109,
+111,117,110,116,32,111,102,32,117,110,111,102,102,105,99,105,97,108,101,102,102,
+105,99,105,101,110,99,121,82,101,102,101,114,101,110,99,101,115,99,111,111,114,
+100,105,110,97,116,101,100,105,115,99,108,97,105,109,101,114,101,120,112,101,100
+,105,116,105,111,110,100,101,118,101,108,111,112,105,110,103,99,97,108,99,117,
+108,97,116,101,100,115,105,109,112,108,105,102,105,101,100,108,101,103,105,116,
+105,109,97,116,101,115,117,98,115,116,114,105,110,103,40,48,34,32,99,108,97,115,
+115,61,34,99,111,109,112,108,101,116,101,108,121,105,108,108,117,115,116,114,97,
+116,101,102,105,118,101,32,121,101,97,114,115,105,110,115,116,114,117,109,101,
+110,116,80,117,98,108,105,115,104,105,110,103,49,34,32,99,108,97,115,115,61,34,
+112,115,121,99,104,111,108,111,103,121,99,111,110,102,105,100,101,110,99,101,110
+,117,109,98,101,114,32,111,102,32,97,98,115,101,110,99,101,32,111,102,102,111,99
+,117,115,101,100,32,111,110,106,111,105,110,101,100,32,116,104,101,115,116,114,
+117,99,116,117,114,101,115,112,114,101,118,105,111,117,115,108,121,62,60,47,105,
+102,114,97,109,101,62,111,110,99,101,32,97,103,97,105,110,98,117,116,32,114,97,
+116,104,101,114,105,109,109,105,103,114,97,110,116,115,111,102,32,99,111,117,114
+,115,101,44,97,32,103,114,111,117,112,32,111,102,76,105,116,101,114,97,116,117,
+114,101,85,110,108,105,107,101,32,116,104,101,60,47,97,62,38,110,98,115,112,59,
+10,102,117,110,99,116,105,111,110,32,105,116,32,119,97,115,32,116,104,101,67,111
+,110,118,101,110,116,105,111,110,97,117,116,111,109,111,98,105,108,101,80,114,
+111,116,101,115,116,97,110,116,97,103,103,114,101,115,115,105,118,101,97,102,116
+,101,114,32,116,104,101,32,83,105,109,105,108,97,114,108,121,44,34,32,47,62,60,
+47,100,105,118,62,99,111,108,108,101,99,116,105,111,110,13,10,102,117,110,99,116
+,105,111,110,118,105,115,105,98,105,108,105,116,121,116,104,101,32,117,115,101,
+32,111,102,118,111,108,117,110,116,101,101,114,115,97,116,116,114,97,99,116,105,
+111,110,117,110,100,101,114,32,116,104,101,32,116,104,114,101,97,116,101,110,101
+,100,42,60,33,91,67,68,65,84,65,91,105,109,112,111,114,116,97,110,99,101,105,110
+,32,103,101,110,101,114,97,108,116,104,101,32,108,97,116,116,101,114,60,47,102,
+111,114,109,62,10,60,47,46,105,110,100,101,120,79,102,40,39,105,32,61,32,48,59,
+32,105,32,60,100,105,102,102,101,114,101,110,99,101,100,101,118,111,116,101,100,
+32,116,111,116,114,97,100,105,116,105,111,110,115,115,101,97,114,99,104,32,102,
+111,114,117,108,116,105,109,97,116,101,108,121,116,111,117,114,110,97,109,101,
+110,116,97,116,116,114,105,98,117,116,101,115,115,111,45,99,97,108,108,101,100,
+32,125,10,60,47,115,116,121,108,101,62,101,118,97,108,117,97,116,105,111,110,101
+,109,112,104,97,115,105,122,101,100,97,99,99,101,115,115,105,98,108,101,60,47,
+115,101,99,116,105,111,110,62,115,117,99,99,101,115,115,105,111,110,97,108,111,
+110,103,32,119,105,116,104,77,101,97,110,119,104,105,108,101,44,105,110,100,117,
+115,116,114,105,101,115,60,47,97,62,60,98,114,32,47,62,104,97,115,32,98,101,99,
+111,109,101,97,115,112,101,99,116,115,32,111,102,84,101,108,101,118,105,115,105,
+111,110,115,117,102,102,105,99,105,101,110,116,98,97,115,107,101,116,98,97,108,
+108,98,111,116,104,32,115,105,100,101,115,99,111,110,116,105,110,117,105,110,103
+,97,110,32,97,114,116,105,99,108,101,60,105,109,103,32,97,108,116,61,34,97,100,
+118,101,110,116,117,114,101,115,104,105,115,32,109,111,116,104,101,114,109,97,
+110,99,104,101,115,116,101,114,112,114,105,110,99,105,112,108,101,115,112,97,114
+,116,105,99,117,108,97,114,99,111,109,109,101,110,116,97,114,121,101,102,102,101
+,99,116,115,32,111,102,100,101,99,105,100,101,100,32,116,111,34,62,60,115,116,
+114,111,110,103,62,112,117,98,108,105,115,104,101,114,115,74,111,117,114,110,97,
+108,32,111,102,100,105,102,102,105,99,117,108,116,121,102,97,99,105,108,105,116,
+97,116,101,97,99,99,101,112,116,97,98,108,101,115,116,121,108,101,46,99,115,115,
+34,9,102,117,110,99,116,105,111,110,32,105,110,110,111,118,97,116,105,111,110,62
+,67,111,112,121,114,105,103,104,116,115,105,116,117,97,116,105,111,110,115,119,
+111,117,108,100,32,104,97,118,101,98,117,115,105,110,101,115,115,101,115,68,105,
+99,116,105,111,110,97,114,121,115,116,97,116,101,109,101,110,116,115,111,102,116
+,101,110,32,117,115,101,100,112,101,114,115,105,115,116,101,110,116,105,110,32,
+74,97,110,117,97,114,121,99,111,109,112,114,105,115,105,110,103,60,47,116,105,
+116,108,101,62,10,9,100,105,112,108,111,109,97,116,105,99,99,111,110,116,97,105,
+110,105,110,103,112,101,114,102,111,114,109,105,110,103,101,120,116,101,110,115,
+105,111,110,115,109,97,121,32,110,111,116,32,98,101,99,111,110,99,101,112,116,32
+,111,102,32,111,110,99,108,105,99,107,61,34,73,116,32,105,115,32,97,108,115,111,
+102,105,110,97,110,99,105,97,108,32,109,97,107,105,110,103,32,116,104,101,76,117
+,120,101,109,98,111,117,114,103,97,100,100,105,116,105,111,110,97,108,97,114,101
+,32,99,97,108,108,101,100,101,110,103,97,103,101,100,32,105,110,34,115,99,114,
+105,112,116,34,41,59,98,117,116,32,105,116,32,119,97,115,101,108,101,99,116,114,
+111,110,105,99,111,110,115,117,98,109,105,116,61,34,10,60,33,45,45,32,69,110,100
+,32,101,108,101,99,116,114,105,99,97,108,111,102,102,105,99,105,97,108,108,121,
+115,117,103,103,101,115,116,105,111,110,116,111,112,32,111,102,32,116,104,101,
+117,110,108,105,107,101,32,116,104,101,65,117,115,116,114,97,108,105,97,110,79,
+114,105,103,105,110,97,108,108,121,114,101,102,101,114,101,110,99,101,115,10,60,
+47,104,101,97,100,62,13,10,114,101,99,111,103,110,105,115,101,100,105,110,105,
+116,105,97,108,105,122,101,108,105,109,105,116,101,100,32,116,111,65,108,101,120
+,97,110,100,114,105,97,114,101,116,105,114,101,109,101,110,116,65,100,118,101,
+110,116,117,114,101,115,102,111,117,114,32,121,101,97,114,115,10,10,38,108,116,
+59,33,45,45,32,105,110,99,114,101,97,115,105,110,103,100,101,99,111,114,97,116,
+105,111,110,104,51,32,99,108,97,115,115,61,34,111,114,105,103,105,110,115,32,111
+,102,111,98,108,105,103,97,116,105,111,110,114,101,103,117,108,97,116,105,111,
+110,99,108,97,115,115,105,102,105,101,100,40,102,117,110,99,116,105,111,110,40,
+97,100,118,97,110,116,97,103,101,115,98,101,105,110,103,32,116,104,101,32,104,
+105,115,116,111,114,105,97,110,115,60,98,97,115,101,32,104,114,101,102,114,101,
+112,101,97,116,101,100,108,121,119,105,108,108,105,110,103,32,116,111,99,111,109
+,112,97,114,97,98,108,101,100,101,115,105,103,110,97,116,101,100,110,111,109,105
+,110,97,116,105,111,110,102,117,110,99,116,105,111,110,97,108,105,110,115,105,
+100,101,32,116,104,101,114,101,118,101,108,97,116,105,111,110,101,110,100,32,111
+,102,32,116,104,101,115,32,102,111,114,32,116,104,101,32,97,117,116,104,111,114,
+105,122,101,100,114,101,102,117,115,101,100,32,116,111,116,97,107,101,32,112,108
+,97,99,101,97,117,116,111,110,111,109,111,117,115,99,111,109,112,114,111,109,105
+,115,101,112,111,108,105,116,105,99,97,108,32,114,101,115,116,97,117,114,97,110,
+116,116,119,111,32,111,102,32,116,104,101,70,101,98,114,117,97,114,121,32,50,113
+,117,97,108,105,116,121,32,111,102,115,119,102,111,98,106,101,99,116,46,117,110,
+100,101,114,115,116,97,110,100,110,101,97,114,108,121,32,97,108,108,119,114,105,
+116,116,101,110,32,98,121,105,110,116,101,114,118,105,101,119,115,34,32,119,105,
+100,116,104,61,34,49,119,105,116,104,100,114,97,119,97,108,102,108,111,97,116,58
+,108,101,102,116,105,115,32,117,115,117,97,108,108,121,99,97,110,100,105,100,97,
+116,101,115,110,101,119,115,112,97,112,101,114,115,109,121,115,116,101,114,105,
+111,117,115,68,101,112,97,114,116,109,101,110,116,98,101,115,116,32,107,110,111,
+119,110,112,97,114,108,105,97,109,101,110,116,115,117,112,112,114,101,115,115,
+101,100,99,111,110,118,101,110,105,101,110,116,114,101,109,101,109,98,101,114,
+101,100,100,105,102,102,101,114,101,110,116,32,115,121,115,116,101,109,97,116,
+105,99,104,97,115,32,108,101,100,32,116,111,112,114,111,112,97,103,97,110,100,97
+,99,111,110,116,114,111,108,108,101,100,105,110,102,108,117,101,110,99,101,115,
+99,101,114,101,109,111,110,105,97,108,112,114,111,99,108,97,105,109,101,100,80,
+114,111,116,101,99,116,105,111,110,108,105,32,99,108,97,115,115,61,34,83,99,105,
+101,110,116,105,102,105,99,99,108,97,115,115,61,34,110,111,45,116,114,97,100,101
+,109,97,114,107,115,109,111,114,101,32,116,104,97,110,32,119,105,100,101,115,112
+,114,101,97,100,76,105,98,101,114,97,116,105,111,110,116,111,111,107,32,112,108,
+97,99,101,100,97,121,32,111,102,32,116,104,101,97,115,32,108,111,110,103,32,97,
+115,105,109,112,114,105,115,111,110,101,100,65,100,100,105,116,105,111,110,97,
+108,10,60,104,101,97,100,62,10,60,109,76,97,98,111,114,97,116,111,114,121,78,111
+,118,101,109,98,101,114,32,50,101,120,99,101,112,116,105,111,110,115,73,110,100,
+117,115,116,114,105,97,108,118,97,114,105,101,116,121,32,111,102,102,108,111,97,
+116,58,32,108,101,102,68,117,114,105,110,103,32,116,104,101,97,115,115,101,115,
+115,109,101,110,116,104,97,118,101,32,98,101,101,110,32,100,101,97,108,115,32,
+119,105,116,104,83,116,97,116,105,115,116,105,99,115,111,99,99,117,114,114,101,
+110,99,101,47,117,108,62,60,47,100,105,118,62,99,108,101,97,114,102,105,120,34,
+62,116,104,101,32,112,117,98,108,105,99,109,97,110,121,32,121,101,97,114,115,119
+,104,105,99,104,32,119,101,114,101,111,118,101,114,32,116,105,109,101,44,115,121
+,110,111,110,121,109,111,117,115,99,111,110,116,101,110,116,34,62,10,112,114,101
+,115,117,109,97,98,108,121,104,105,115,32,102,97,109,105,108,121,117,115,101,114
+,65,103,101,110,116,46,117,110,101,120,112,101,99,116,101,100,105,110,99,108,117
+,100,105,110,103,32,99,104,97,108,108,101,110,103,101,100,97,32,109,105,110,111,
+114,105,116,121,117,110,100,101,102,105,110,101,100,34,98,101,108,111,110,103,
+115,32,116,111,116,97,107,101,110,32,102,114,111,109,105,110,32,79,99,116,111,98
+,101,114,112,111,115,105,116,105,111,110,58,32,115,97,105,100,32,116,111,32,98,
+101,114,101,108,105,103,105,111,117,115,32,70,101,100,101,114,97,116,105,111,110
+,32,114,111,119,115,112,97,110,61,34,111,110,108,121,32,97,32,102,101,119,109,
+101,97,110,116,32,116,104,97,116,108,101,100,32,116,111,32,116,104,101,45,45,62,
+13,10,60,100,105,118,32,60,102,105,101,108,100,115,101,116,62,65,114,99,104,98,
+105,115,104,111,112,32,99,108,97,115,115,61,34,110,111,98,101,105,110,103,32,117
+,115,101,100,97,112,112,114,111,97,99,104,101,115,112,114,105,118,105,108,101,
+103,101,115,110,111,115,99,114,105,112,116,62,10,114,101,115,117,108,116,115,32,
+105,110,109,97,121,32,98,101,32,116,104,101,69,97,115,116,101,114,32,101,103,103
+,109,101,99,104,97,110,105,115,109,115,114,101,97,115,111,110,97,98,108,101,80,
+111,112,117,108,97,116,105,111,110,67,111,108,108,101,99,116,105,111,110,115,101
+,108,101,99,116,101,100,34,62,110,111,115,99,114,105,112,116,62,13,47,105,110,
+100,101,120,46,112,104,112,97,114,114,105,118,97,108,32,111,102,45,106,115,115,
+100,107,39,41,41,59,109,97,110,97,103,101,100,32,116,111,105,110,99,111,109,112,
+108,101,116,101,99,97,115,117,97,108,116,105,101,115,99,111,109,112,108,101,116,
+105,111,110,67,104,114,105,115,116,105,97,110,115,83,101,112,116,101,109,98,101,
+114,32,97,114,105,116,104,109,101,116,105,99,112,114,111,99,101,100,117,114,101,
+115,109,105,103,104,116,32,104,97,118,101,80,114,111,100,117,99,116,105,111,110,
+105,116,32,97,112,112,101,97,114,115,80,104,105,108,111,115,111,112,104,121,102,
+114,105,101,110,100,115,104,105,112,108,101,97,100,105,110,103,32,116,111,103,
+105,118,105,110,103,32,116,104,101,116,111,119,97,114,100,32,116,104,101,103,117
+,97,114,97,110,116,101,101,100,100,111,99,117,109,101,110,116,101,100,99,111,108
+,111,114,58,35,48,48,48,118,105,100,101,111,32,103,97,109,101,99,111,109,109,105
+,115,115,105,111,110,114,101,102,108,101,99,116,105,110,103,99,104,97,110,103,
+101,32,116,104,101,97,115,115,111,99,105,97,116,101,100,115,97,110,115,45,115,
+101,114,105,102,111,110,107,101,121,112,114,101,115,115,59,32,112,97,100,100,105
+,110,103,58,72,101,32,119,97,115,32,116,104,101,117,110,100,101,114,108,121,105,
+110,103,116,121,112,105,99,97,108,108,121,32,44,32,97,110,100,32,116,104,101,32,
+115,114,99,69,108,101,109,101,110,116,115,117,99,99,101,115,115,105,118,101,115,
+105,110,99,101,32,116,104,101,32,115,104,111,117,108,100,32,98,101,32,110,101,
+116,119,111,114,107,105,110,103,97,99,99,111,117,110,116,105,110,103,117,115,101
+,32,111,102,32,116,104,101,108,111,119,101,114,32,116,104,97,110,115,104,111,119
+,115,32,116,104,97,116,60,47,115,112,97,110,62,10,9,9,99,111,109,112,108,97,105,
+110,116,115,99,111,110,116,105,110,117,111,117,115,113,117,97,110,116,105,116,
+105,101,115,97,115,116,114,111,110,111,109,101,114,104,101,32,100,105,100,32,110
+,111,116,100,117,101,32,116,111,32,105,116,115,97,112,112,108,105,101,100,32,116
+,111,97,110,32,97,118,101,114,97,103,101,101,102,102,111,114,116,115,32,116,111,
+116,104,101,32,102,117,116,117,114,101,97,116,116,101,109,112,116,32,116,111,84,
+104,101,114,101,102,111,114,101,44,99,97,112,97,98,105,108,105,116,121,82,101,
+112,117,98,108,105,99,97,110,119,97,115,32,102,111,114,109,101,100,69,108,101,99
+,116,114,111,110,105,99,107,105,108,111,109,101,116,101,114,115,99,104,97,108,
+108,101,110,103,101,115,112,117,98,108,105,115,104,105,110,103,116,104,101,32,
+102,111,114,109,101,114,105,110,100,105,103,101,110,111,117,115,100,105,114,101,
+99,116,105,111,110,115,115,117,98,115,105,100,105,97,114,121,99,111,110,115,112,
+105,114,97,99,121,100,101,116,97,105,108,115,32,111,102,97,110,100,32,105,110,32
+,116,104,101,97,102,102,111,114,100,97,98,108,101,115,117,98,115,116,97,110,99,
+101,115,114,101,97,115,111,110,32,102,111,114,99,111,110,118,101,110,116,105,111
+,110,105,116,101,109,116,121,112,101,61,34,97,98,115,111,108,117,116,101,108,121
+,115,117,112,112,111,115,101,100,108,121,114,101,109,97,105,110,101,100,32,97,97
+,116,116,114,97,99,116,105,118,101,116,114,97,118,101,108,108,105,110,103,115,
+101,112,97,114,97,116,101,108,121,102,111,99,117,115,101,115,32,111,110,101,108,
+101,109,101,110,116,97,114,121,97,112,112,108,105,99,97,98,108,101,102,111,117,
+110,100,32,116,104,97,116,115,116,121,108,101,115,104,101,101,116,109,97,110,117
+,115,99,114,105,112,116,115,116,97,110,100,115,32,102,111,114,32,110,111,45,114,
+101,112,101,97,116,40,115,111,109,101,116,105,109,101,115,67,111,109,109,101,114
+,99,105,97,108,105,110,32,65,109,101,114,105,99,97,117,110,100,101,114,116,97,
+107,101,110,113,117,97,114,116,101,114,32,111,102,97,110,32,101,120,97,109,112,
+108,101,112,101,114,115,111,110,97,108,108,121,105,110,100,101,120,46,112,104,
+112,63,60,47,98,117,116,116,111,110,62,10,112,101,114,99,101,110,116,97,103,101,
+98,101,115,116,45,107,110,111,119,110,99,114,101,97,116,105,110,103,32,97,34,32,
+100,105,114,61,34,108,116,114,76,105,101,117,116,101,110,97,110,116,10,60,100,
+105,118,32,105,100,61,34,116,104,101,121,32,119,111,117,108,100,97,98,105,108,
+105,116,121,32,111,102,109,97,100,101,32,117,112,32,111,102,110,111,116,101,100,
+32,116,104,97,116,99,108,101,97,114,32,116,104,97,116,97,114,103,117,101,32,116,
+104,97,116,116,111,32,97,110,111,116,104,101,114,99,104,105,108,100,114,101,110,
+39,115,112,117,114,112,111,115,101,32,111,102,102,111,114,109,117,108,97,116,101
+,100,98,97,115,101,100,32,117,112,111,110,116,104,101,32,114,101,103,105,111,110
+,115,117,98,106,101,99,116,32,111,102,112,97,115,115,101,110,103,101,114,115,112
+,111,115,115,101,115,115,105,111,110,46,10,10,73,110,32,116,104,101,32,66,101,
+102,111,114,101,32,116,104,101,97,102,116,101,114,119,97,114,100,115,99,117,114,
+114,101,110,116,108,121,32,97,99,114,111,115,115,32,116,104,101,115,99,105,101,
+110,116,105,102,105,99,99,111,109,109,117,110,105,116,121,46,99,97,112,105,116,
+97,108,105,115,109,105,110,32,71,101,114,109,97,110,121,114,105,103,104,116,45,
+119,105,110,103,116,104,101,32,115,121,115,116,101,109,83,111,99,105,101,116,121
+,32,111,102,112,111,108,105,116,105,99,105,97,110,100,105,114,101,99,116,105,111
+,110,58,119,101,110,116,32,111,110,32,116,111,114,101,109,111,118,97,108,32,111,
+102,32,78,101,119,32,89,111,114,107,32,97,112,97,114,116,109,101,110,116,115,105
+,110,100,105,99,97,116,105,111,110,100,117,114,105,110,103,32,116,104,101,117,
+110,108,101,115,115,32,116,104,101,104,105,115,116,111,114,105,99,97,108,104,97,
+100,32,98,101,101,110,32,97,100,101,102,105,110,105,116,105,118,101,105,110,103,
+114,101,100,105,101,110,116,97,116,116,101,110,100,97,110,99,101,67,101,110,116,
+101,114,32,102,111,114,112,114,111,109,105,110,101,110,99,101,114,101,97,100,121
+,83,116,97,116,101,115,116,114,97,116,101,103,105,101,115,98,117,116,32,105,110,
+32,116,104,101,97,115,32,112,97,114,116,32,111,102,99,111,110,115,116,105,116,
+117,116,101,99,108,97,105,109,32,116,104,97,116,108,97,98,111,114,97,116,111,114
+,121,99,111,109,112,97,116,105,98,108,101,102,97,105,108,117,114,101,32,111,102,
+44,32,115,117,99,104,32,97,115,32,98,101,103,97,110,32,119,105,116,104,117,115,
+105,110,103,32,116,104,101,32,116,111,32,112,114,111,118,105,100,101,102,101,97,
+116,117,114,101,32,111,102,102,114,111,109,32,119,104,105,99,104,47,34,32,99,108
+,97,115,115,61,34,103,101,111,108,111,103,105,99,97,108,115,101,118,101,114,97,
+108,32,111,102,100,101,108,105,98,101,114,97,116,101,105,109,112,111,114,116,97,
+110,116,32,104,111,108,100,115,32,116,104,97,116,105,110,103,38,113,117,111,116,
+59,32,118,97,108,105,103,110,61,116,111,112,116,104,101,32,71,101,114,109,97,110
+,111,117,116,115,105,100,101,32,111,102,110,101,103,111,116,105,97,116,101,100,
+104,105,115,32,99,97,114,101,101,114,115,101,112,97,114,97,116,105,111,110,105,
+100,61,34,115,101,97,114,99,104,119,97,115,32,99,97,108,108,101,100,116,104,101,
+32,102,111,117,114,116,104,114,101,99,114,101,97,116,105,111,110,111,116,104,101
+,114,32,116,104,97,110,112,114,101,118,101,110,116,105,111,110,119,104,105,108,
+101,32,116,104,101,32,101,100,117,99,97,116,105,111,110,44,99,111,110,110,101,99
+,116,105,110,103,97,99,99,117,114,97,116,101,108,121,119,101,114,101,32,98,117,
+105,108,116,119,97,115,32,107,105,108,108,101,100,97,103,114,101,101,109,101,110
+,116,115,109,117,99,104,32,109,111,114,101,32,68,117,101,32,116,111,32,116,104,
+101,119,105,100,116,104,58,32,49,48,48,115,111,109,101,32,111,116,104,101,114,75
+,105,110,103,100,111,109,32,111,102,116,104,101,32,101,110,116,105,114,101,102,
+97,109,111,117,115,32,102,111,114,116,111,32,99,111,110,110,101,99,116,111,98,
+106,101,99,116,105,118,101,115,116,104,101,32,70,114,101,110,99,104,112,101,111,
+112,108,101,32,97,110,100,102,101,97,116,117,114,101,100,34,62,105,115,32,115,97
+,105,100,32,116,111,115,116,114,117,99,116,117,114,97,108,114,101,102,101,114,
+101,110,100,117,109,109,111,115,116,32,111,102,116,101,110,97,32,115,101,112,97,
+114,97,116,101,45,62,10,60,100,105,118,32,105,100,32,79,102,102,105,99,105,97,
+108,32,119,111,114,108,100,119,105,100,101,46,97,114,105,97,45,108,97,98,101,108
+,116,104,101,32,112,108,97,110,101,116,97,110,100,32,105,116,32,119,97,115,100,
+34,32,118,97,108,117,101,61,34,108,111,111,107,105,110,103,32,97,116,98,101,110,
+101,102,105,99,105,97,108,97,114,101,32,105,110,32,116,104,101,109,111,110,105,
+116,111,114,105,110,103,114,101,112,111,114,116,101,100,108,121,116,104,101,32,
+109,111,100,101,114,110,119,111,114,107,105,110,103,32,111,110,97,108,108,111,
+119,101,100,32,116,111,119,104,101,114,101,32,116,104,101,32,105,110,110,111,118
+,97,116,105,118,101,60,47,97,62,60,47,100,105,118,62,115,111,117,110,100,116,114
+,97,99,107,115,101,97,114,99,104,70,111,114,109,116,101,110,100,32,116,111,32,98
+,101,105,110,112,117,116,32,105,100,61,34,111,112,101,110,105,110,103,32,111,102
+,114,101,115,116,114,105,99,116,101,100,97,100,111,112,116,101,100,32,98,121,97,
+100,100,114,101,115,115,105,110,103,116,104,101,111,108,111,103,105,97,110,109,
+101,116,104,111,100,115,32,111,102,118,97,114,105,97,110,116,32,111,102,67,104,
+114,105,115,116,105,97,110,32,118,101,114,121,32,108,97,114,103,101,97,117,116,
+111,109,111,116,105,118,101,98,121,32,102,97,114,32,116,104,101,114,97,110,103,
+101,32,102,114,111,109,112,117,114,115,117,105,116,32,111,102,102,111,108,108,
+111,119,32,116,104,101,98,114,111,117,103,104,116,32,116,111,105,110,32,69,110,
+103,108,97,110,100,97,103,114,101,101,32,116,104,97,116,97,99,99,117,115,101,100
+,32,111,102,99,111,109,101,115,32,102,114,111,109,112,114,101,118,101,110,116,
+105,110,103,100,105,118,32,115,116,121,108,101,61,104,105,115,32,111,114,32,104,
+101,114,116,114,101,109,101,110,100,111,117,115,102,114,101,101,100,111,109,32,
+111,102,99,111,110,99,101,114,110,105,110,103,48,32,49,101,109,32,49,101,109,59,
+66,97,115,107,101,116,98,97,108,108,47,115,116,121,108,101,46,99,115,115,97,110,
+32,101,97,114,108,105,101,114,101,118,101,110,32,97,102,116,101,114,47,34,32,116
+,105,116,108,101,61,34,46,99,111,109,47,105,110,100,101,120,116,97,107,105,110,
+103,32,116,104,101,112,105,116,116,115,98,117,114,103,104,99,111,110,116,101,110
+,116,34,62,13,60,115,99,114,105,112,116,62,40,102,116,117,114,110,101,100,32,111
+,117,116,104,97,118,105,110,103,32,116,104,101,60,47,115,112,97,110,62,13,10,32,
+111,99,99,97,115,105,111,110,97,108,98,101,99,97,117,115,101,32,105,116,115,116,
+97,114,116,101,100,32,116,111,112,104,121,115,105,99,97,108,108,121,62,60,47,100
+,105,118,62,10,32,32,99,114,101,97,116,101,100,32,98,121,67,117,114,114,101,110,
+116,108,121,44,32,98,103,99,111,108,111,114,61,34,116,97,98,105,110,100,101,120,
+61,34,100,105,115,97,115,116,114,111,117,115,65,110,97,108,121,116,105,99,115,32
+,97,108,115,111,32,104,97,115,32,97,62,60,100,105,118,32,105,100,61,34,60,47,115
+,116,121,108,101,62,10,60,99,97,108,108,101,100,32,102,111,114,115,105,110,103,
+101,114,32,97,110,100,46,115,114,99,32,61,32,34,47,47,118,105,111,108,97,116,105
+,111,110,115,116,104,105,115,32,112,111,105,110,116,99,111,110,115,116,97,110,
+116,108,121,105,115,32,108,111,99,97,116,101,100,114,101,99,111,114,100,105,110,
+103,115,100,32,102,114,111,109,32,116,104,101,110,101,100,101,114,108,97,110,100
+,115,112,111,114,116,117,103,117,195,170,115,215,162,215,145,215,168,215,153,215
+,170,217,129,216,167,216,177,216,179,219,140,100,101,115,97,114,114,111,108,108,
+111,99,111,109,101,110,116,97,114,105,111,101,100,117,99,97,99,105,195,179,110,
+115,101,112,116,105,101,109,98,114,101,114,101,103,105,115,116,114,97,100,111,
+100,105,114,101,99,99,105,195,179,110,117,98,105,99,97,99,105,195,179,110,112,
+117,98,108,105,99,105,100,97,100,114,101,115,112,117,101,115,116,97,115,114,101,
+115,117,108,116,97,100,111,115,105,109,112,111,114,116,97,110,116,101,114,101,
+115,101,114,118,97,100,111,115,97,114,116,195,173,99,117,108,111,115,100,105,102
+,101,114,101,110,116,101,115,115,105,103,117,105,101,110,116,101,115,114,101,112
+,195,186,98,108,105,99,97,115,105,116,117,97,99,105,195,179,110,109,105,110,105,
+115,116,101,114,105,111,112,114,105,118,97,99,105,100,97,100,100,105,114,101,99,
+116,111,114,105,111,102,111,114,109,97,99,105,195,179,110,112,111,98,108,97,99,
+105,195,179,110,112,114,101,115,105,100,101,110,116,101,99,111,110,116,101,110,
+105,100,111,115,97,99,99,101,115,111,114,105,111,115,116,101,99,104,110,111,114,
+97,116,105,112,101,114,115,111,110,97,108,101,115,99,97,116,101,103,111,114,195,
+173,97,101,115,112,101,99,105,97,108,101,115,100,105,115,112,111,110,105,98,108,
+101,97,99,116,117,97,108,105,100,97,100,114,101,102,101,114,101,110,99,105,97,
+118,97,108,108,97,100,111,108,105,100,98,105,98,108,105,111,116,101,99,97,114,
+101,108,97,99,105,111,110,101,115,99,97,108,101,110,100,97,114,105,111,112,111,
+108,195,173,116,105,99,97,115,97,110,116,101,114,105,111,114,101,115,100,111,99,
+117,109,101,110,116,111,115,110,97,116,117,114,97,108,101,122,97,109,97,116,101,
+114,105,97,108,101,115,100,105,102,101,114,101,110,99,105,97,101,99,111,110,195,
+179,109,105,99,97,116,114,97,110,115,112,111,114,116,101,114,111,100,114,195,173
+,103,117,101,122,112,97,114,116,105,99,105,112,97,114,101,110,99,117,101,110,116
+,114,97,110,100,105,115,99,117,115,105,195,179,110,101,115,116,114,117,99,116,
+117,114,97,102,117,110,100,97,99,105,195,179,110,102,114,101,99,117,101,110,116,
+101,115,112,101,114,109,97,110,101,110,116,101,116,111,116,97,108,109,101,110,
+116,101,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,131,115,66,121,84,97,103,78,97,109,101,40,46,106,112,103,34,32,97,108,116,61
+,34,49,112,120,32,115,111,108,105,100,32,35,46,103,105,102,34,32,97,108,116,61,
+34,116,114,97,110,115,112,97,114,101,110,116,105,110,102,111,114,109,97,116,105,
+111,110,97,112,112,108,105,99,97,116,105,111,110,34,32,111,110,99,108,105,99,107
+,61,34,101,115,116,97,98,108,105,115,104,101,100,97,100,118,101,114,116,105,115,
+105,110,103,46,112,110,103,34,32,97,108,116,61,34,101,110,118,105,114,111,110,
+109,101,110,116,112,101,114,102,111,114,109,97,110,99,101,97,112,112,114,111,112
+,114,105,97,116,101,38,97,109,112,59,109,100,97,115,104,59,105,109,109,101,100,
+105,97,116,101,108,121,60,47,115,116,114,111,110,103,62,60,47,114,97,116,104,101
+,114,32,116,104,97,110,116,101,109,112,101,114,97,116,117,114,101,100,101,118,
+101,108,111,112,109,101,110,116,99,111,109,112,101,116,105,116,105,111,110,112,
+108,97,99,101,104,111,108,100,101,114,118,105,115,105,98,105,108,105,116,121,58,
+99,111,112,121,114,105,103,104,116,34,62,48,34,32,104,101,105,103,104,116,61,34,
+101,118,101,110,32,116,104,111,117,103,104,114,101,112,108,97,99,101,109,101,110
+,116,100,101,115,116,105,110,97,116,105,111,110,67,111,114,112,111,114,97,116,
+105,111,110,60,117,108,32,99,108,97,115,115,61,34,65,115,115,111,99,105,97,116,
+105,111,110,105,110,100,105,118,105,100,117,97,108,115,112,101,114,115,112,101,
+99,116,105,118,101,115,101,116,84,105,109,101,111,117,116,40,117,114,108,40,104,
+116,116,112,58,47,47,109,97,116,104,101,109,97,116,105,99,115,109,97,114,103,105
+,110,45,116,111,112,58,101,118,101,110,116,117,97,108,108,121,32,100,101,115,99,
+114,105,112,116,105,111,110,41,32,110,111,45,114,101,112,101,97,116,99,111,108,
+108,101,99,116,105,111,110,115,46,74,80,71,124,116,104,117,109,98,124,112,97,114
+,116,105,99,105,112,97,116,101,47,104,101,97,100,62,60,98,111,100,121,102,108,
+111,97,116,58,108,101,102,116,59,60,108,105,32,99,108,97,115,115,61,34,104,117,
+110,100,114,101,100,115,32,111,102,10,10,72,111,119,101,118,101,114,44,32,99,111
+,109,112,111,115,105,116,105,111,110,99,108,101,97,114,58,98,111,116,104,59,99,
+111,111,112,101,114,97,116,105,111,110,119,105,116,104,105,110,32,116,104,101,32
+,108,97,98,101,108,32,102,111,114,61,34,98,111,114,100,101,114,45,116,111,112,58
+,78,101,119,32,90,101,97,108,97,110,100,114,101,99,111,109,109,101,110,100,101,
+100,112,104,111,116,111,103,114,97,112,104,121,105,110,116,101,114,101,115,116,
+105,110,103,38,108,116,59,115,117,112,38,103,116,59,99,111,110,116,114,111,118,
+101,114,115,121,78,101,116,104,101,114,108,97,110,100,115,97,108,116,101,114,110
+,97,116,105,118,101,109,97,120,108,101,110,103,116,104,61,34,115,119,105,116,122
+,101,114,108,97,110,100,68,101,118,101,108,111,112,109,101,110,116,101,115,115,
+101,110,116,105,97,108,108,121,10,10,65,108,116,104,111,117,103,104,32,60,47,116
+,101,120,116,97,114,101,97,62,116,104,117,110,100,101,114,98,105,114,100,114,101
+,112,114,101,115,101,110,116,101,100,38,97,109,112,59,110,100,97,115,104,59,115,
+112,101,99,117,108,97,116,105,111,110,99,111,109,109,117,110,105,116,105,101,115
+,108,101,103,105,115,108,97,116,105,111,110,101,108,101,99,116,114,111,110,105,
+99,115,10,9,60,100,105,118,32,105,100,61,34,105,108,108,117,115,116,114,97,116,
+101,100,101,110,103,105,110,101,101,114,105,110,103,116,101,114,114,105,116,111,
+114,105,101,115,97,117,116,104,111,114,105,116,105,101,115,100,105,115,116,114,
+105,98,117,116,101,100,54,34,32,104,101,105,103,104,116,61,34,115,97,110,115,45,
+115,101,114,105,102,59,99,97,112,97,98,108,101,32,111,102,32,100,105,115,97,112,
+112,101,97,114,101,100,105,110,116,101,114,97,99,116,105,118,101,108,111,111,107
+,105,110,103,32,102,111,114,105,116,32,119,111,117,108,100,32,98,101,65,102,103,
+104,97,110,105,115,116,97,110,119,97,115,32,99,114,101,97,116,101,100,77,97,116,
+104,46,102,108,111,111,114,40,115,117,114,114,111,117,110,100,105,110,103,99,97,
+110,32,97,108,115,111,32,98,101,111,98,115,101,114,118,97,116,105,111,110,109,97
+,105,110,116,101,110,97,110,99,101,101,110,99,111,117,110,116,101,114,101,100,60
+,104,50,32,99,108,97,115,115,61,34,109,111,114,101,32,114,101,99,101,110,116,105
+,116,32,104,97,115,32,98,101,101,110,105,110,118,97,115,105,111,110,32,111,102,
+41,46,103,101,116,84,105,109,101,40,41,102,117,110,100,97,109,101,110,116,97,108
+,68,101,115,112,105,116,101,32,116,104,101,34,62,60,100,105,118,32,105,100,61,34
+,105,110,115,112,105,114,97,116,105,111,110,101,120,97,109,105,110,97,116,105,
+111,110,112,114,101,112,97,114,97,116,105,111,110,101,120,112,108,97,110,97,116,
+105,111,110,60,105,110,112,117,116,32,105,100,61,34,60,47,97,62,60,47,115,112,97
+,110,62,118,101,114,115,105,111,110,115,32,111,102,105,110,115,116,114,117,109,
+101,110,116,115,98,101,102,111,114,101,32,116,104,101,32,32,61,32,39,104,116,116
+,112,58,47,47,68,101,115,99,114,105,112,116,105,111,110,114,101,108,97,116,105,
+118,101,108,121,32,46,115,117,98,115,116,114,105,110,103,40,101,97,99,104,32,111
+,102,32,116,104,101,101,120,112,101,114,105,109,101,110,116,115,105,110,102,108,
+117,101,110,116,105,97,108,105,110,116,101,103,114,97,116,105,111,110,109,97,110
+,121,32,112,101,111,112,108,101,100,117,101,32,116,111,32,116,104,101,32,99,111,
+109,98,105,110,97,116,105,111,110,100,111,32,110,111,116,32,104,97,118,101,77,
+105,100,100,108,101,32,69,97,115,116,60,110,111,115,99,114,105,112,116,62,60,99,
+111,112,121,114,105,103,104,116,34,32,112,101,114,104,97,112,115,32,116,104,101,
+105,110,115,116,105,116,117,116,105,111,110,105,110,32,68,101,99,101,109,98,101,
+114,97,114,114,97,110,103,101,109,101,110,116,109,111,115,116,32,102,97,109,111,
+117,115,112,101,114,115,111,110,97,108,105,116,121,99,114,101,97,116,105,111,110
+,32,111,102,108,105,109,105,116,97,116,105,111,110,115,101,120,99,108,117,115,
+105,118,101,108,121,115,111,118,101,114,101,105,103,110,116,121,45,99,111,110,
+116,101,110,116,34,62,10,60,116,100,32,99,108,97,115,115,61,34,117,110,100,101,
+114,103,114,111,117,110,100,112,97,114,97,108,108,101,108,32,116,111,100,111,99,
+116,114,105,110,101,32,111,102,111,99,99,117,112,105,101,100,32,98,121,116,101,
+114,109,105,110,111,108,111,103,121,82,101,110,97,105,115,115,97,110,99,101,97,
+32,110,117,109,98,101,114,32,111,102,115,117,112,112,111,114,116,32,102,111,114,
+101,120,112,108,111,114,97,116,105,111,110,114,101,99,111,103,110,105,116,105,
+111,110,112,114,101,100,101,99,101,115,115,111,114,60,105,109,103,32,115,114,99,
+61,34,47,60,104,49,32,99,108,97,115,115,61,34,112,117,98,108,105,99,97,116,105,
+111,110,109,97,121,32,97,108,115,111,32,98,101,115,112,101,99,105,97,108,105,122
+,101,100,60,47,102,105,101,108,100,115,101,116,62,112,114,111,103,114,101,115,
+115,105,118,101,109,105,108,108,105,111,110,115,32,111,102,115,116,97,116,101,
+115,32,116,104,97,116,101,110,102,111,114,99,101,109,101,110,116,97,114,111,117,
+110,100,32,116,104,101,32,111,110,101,32,97,110,111,116,104,101,114,46,112,97,
+114,101,110,116,78,111,100,101,97,103,114,105,99,117,108,116,117,114,101,65,108,
+116,101,114,110,97,116,105,118,101,114,101,115,101,97,114,99,104,101,114,115,116
+,111,119,97,114,100,115,32,116,104,101,77,111,115,116,32,111,102,32,116,104,101,
+109,97,110,121,32,111,116,104,101,114,32,40,101,115,112,101,99,105,97,108,108,
+121,60,116,100,32,119,105,100,116,104,61,34,59,119,105,100,116,104,58,49,48,48,
+37,105,110,100,101,112,101,110,100,101,110,116,60,104,51,32,99,108,97,115,115,61
+,34,32,111,110,99,104,97,110,103,101,61,34,41,46,97,100,100,67,108,97,115,115,40
+,105,110,116,101,114,97,99,116,105,111,110,79,110,101,32,111,102,32,116,104,101,
+32,100,97,117,103,104,116,101,114,32,111,102,97,99,99,101,115,115,111,114,105,
+101,115,98,114,97,110,99,104,101,115,32,111,102,13,10,60,100,105,118,32,105,100,
+61,34,116,104,101,32,108,97,114,103,101,115,116,100,101,99,108,97,114,97,116,105
+,111,110,114,101,103,117,108,97,116,105,111,110,115,73,110,102,111,114,109,97,
+116,105,111,110,116,114,97,110,115,108,97,116,105,111,110,100,111,99,117,109,101
+,110,116,97,114,121,105,110,32,111,114,100,101,114,32,116,111,34,62,10,60,104,
+101,97,100,62,10,60,34,32,104,101,105,103,104,116,61,34,49,97,99,114,111,115,115
+,32,116,104,101,32,111,114,105,101,110,116,97,116,105,111,110,41,59,60,47,115,99
+,114,105,112,116,62,105,109,112,108,101,109,101,110,116,101,100,99,97,110,32,98,
+101,32,115,101,101,110,116,104,101,114,101,32,119,97,115,32,97,100,101,109,111,
+110,115,116,114,97,116,101,99,111,110,116,97,105,110,101,114,34,62,99,111,110,
+110,101,99,116,105,111,110,115,116,104,101,32,66,114,105,116,105,115,104,119,97,
+115,32,119,114,105,116,116,101,110,33,105,109,112,111,114,116,97,110,116,59,112,
+120,59,32,109,97,114,103,105,110,45,102,111,108,108,111,119,101,100,32,98,121,97
+,98,105,108,105,116,121,32,116,111,32,99,111,109,112,108,105,99,97,116,101,100,
+100,117,114,105,110,103,32,116,104,101,32,105,109,109,105,103,114,97,116,105,111
+,110,97,108,115,111,32,99,97,108,108,101,100,60,104,52,32,99,108,97,115,115,61,
+34,100,105,115,116,105,110,99,116,105,111,110,114,101,112,108,97,99,101,100,32,
+98,121,103,111,118,101,114,110,109,101,110,116,115,108,111,99,97,116,105,111,110
+,32,111,102,105,110,32,78,111,118,101,109,98,101,114,119,104,101,116,104,101,114
+,32,116,104,101,60,47,112,62,10,60,47,100,105,118,62,97,99,113,117,105,115,105,
+116,105,111,110,99,97,108,108,101,100,32,116,104,101,32,112,101,114,115,101,99,
+117,116,105,111,110,100,101,115,105,103,110,97,116,105,111,110,123,102,111,110,
+116,45,115,105,122,101,58,97,112,112,101,97,114,101,100,32,105,110,105,110,118,
+101,115,116,105,103,97,116,101,101,120,112,101,114,105,101,110,99,101,100,109,
+111,115,116,32,108,105,107,101,108,121,119,105,100,101,108,121,32,117,115,101,
+100,100,105,115,99,117,115,115,105,111,110,115,112,114,101,115,101,110,99,101,32
+,111,102,32,40,100,111,99,117,109,101,110,116,46,101,120,116,101,110,115,105,118
+,101,108,121,73,116,32,104,97,115,32,98,101,101,110,105,116,32,100,111,101,115,
+32,110,111,116,99,111,110,116,114,97,114,121,32,116,111,105,110,104,97,98,105,
+116,97,110,116,115,105,109,112,114,111,118,101,109,101,110,116,115,99,104,111,
+108,97,114,115,104,105,112,99,111,110,115,117,109,112,116,105,111,110,105,110,
+115,116,114,117,99,116,105,111,110,102,111,114,32,101,120,97,109,112,108,101,111
+,110,101,32,111,114,32,109,111,114,101,112,120,59,32,112,97,100,100,105,110,103,
+116,104,101,32,99,117,114,114,101,110,116,97,32,115,101,114,105,101,115,32,111,
+102,97,114,101,32,117,115,117,97,108,108,121,114,111,108,101,32,105,110,32,116,
+104,101,112,114,101,118,105,111,117,115,108,121,32,100,101,114,105,118,97,116,
+105,118,101,115,101,118,105,100,101,110,99,101,32,111,102,101,120,112,101,114,
+105,101,110,99,101,115,99,111,108,111,114,115,99,104,101,109,101,115,116,97,116,
+101,100,32,116,104,97,116,99,101,114,116,105,102,105,99,97,116,101,60,47,97,62,
+60,47,100,105,118,62,10,32,115,101,108,101,99,116,101,100,61,34,104,105,103,104,
+32,115,99,104,111,111,108,114,101,115,112,111,110,115,101,32,116,111,99,111,109,
+102,111,114,116,97,98,108,101,97,100,111,112,116,105,111,110,32,111,102,116,104,
+114,101,101,32,121,101,97,114,115,116,104,101,32,99,111,117,110,116,114,121,105,
+110,32,70,101,98,114,117,97,114,121,115,111,32,116,104,97,116,32,116,104,101,112
+,101,111,112,108,101,32,119,104,111,32,112,114,111,118,105,100,101,100,32,98,121
+,60,112,97,114,97,109,32,110,97,109,101,97,102,102,101,99,116,101,100,32,98,121,
+105,110,32,116,101,114,109,115,32,111,102,97,112,112,111,105,110,116,109,101,110
+,116,73,83,79,45,56,56,53,57,45,49,34,119,97,115,32,98,111,114,110,32,105,110,
+104,105,115,116,111,114,105,99,97,108,32,114,101,103,97,114,100,101,100,32,97,
+115,109,101,97,115,117,114,101,109,101,110,116,105,115,32,98,97,115,101,100,32,
+111,110,32,97,110,100,32,111,116,104,101,114,32,58,32,102,117,110,99,116,105,111
+,110,40,115,105,103,110,105,102,105,99,97,110,116,99,101,108,101,98,114,97,116,
+105,111,110,116,114,97,110,115,109,105,116,116,101,100,47,106,115,47,106,113,117
+,101,114,121,46,105,115,32,107,110,111,119,110,32,97,115,116,104,101,111,114,101
+,116,105,99,97,108,32,116,97,98,105,110,100,101,120,61,34,105,116,32,99,111,117,
+108,100,32,98,101,60,110,111,115,99,114,105,112,116,62,10,104,97,118,105,110,103
+,32,98,101,101,110,13,10,60,104,101,97,100,62,13,10,60,32,38,113,117,111,116,59,
+84,104,101,32,99,111,109,112,105,108,97,116,105,111,110,104,101,32,104,97,100,32
+,98,101,101,110,112,114,111,100,117,99,101,100,32,98,121,112,104,105,108,111,115
+,111,112,104,101,114,99,111,110,115,116,114,117,99,116,101,100,105,110,116,101,
+110,100,101,100,32,116,111,97,109,111,110,103,32,111,116,104,101,114,99,111,109,
+112,97,114,101,100,32,116,111,116,111,32,115,97,121,32,116,104,97,116,69,110,103
+,105,110,101,101,114,105,110,103,97,32,100,105,102,102,101,114,101,110,116,114,
+101,102,101,114,114,101,100,32,116,111,100,105,102,102,101,114,101,110,99,101,
+115,98,101,108,105,101,102,32,116,104,97,116,112,104,111,116,111,103,114,97,112,
+104,115,105,100,101,110,116,105,102,121,105,110,103,72,105,115,116,111,114,121,
+32,111,102,32,82,101,112,117,98,108,105,99,32,111,102,110,101,99,101,115,115,97,
+114,105,108,121,112,114,111,98,97,98,105,108,105,116,121,116,101,99,104,110,105,
+99,97,108,108,121,108,101,97,118,105,110,103,32,116,104,101,115,112,101,99,116,
+97,99,117,108,97,114,102,114,97,99,116,105,111,110,32,111,102,101,108,101,99,116
+,114,105,99,105,116,121,104,101,97,100,32,111,102,32,116,104,101,114,101,115,116
+,97,117,114,97,110,116,115,112,97,114,116,110,101,114,115,104,105,112,101,109,
+112,104,97,115,105,115,32,111,110,109,111,115,116,32,114,101,99,101,110,116,115,
+104,97,114,101,32,119,105,116,104,32,115,97,121,105,110,103,32,116,104,97,116,
+102,105,108,108,101,100,32,119,105,116,104,100,101,115,105,103,110,101,100,32,
+116,111,105,116,32,105,115,32,111,102,116,101,110,34,62,60,47,105,102,114,97,109
+,101,62,97,115,32,102,111,108,108,111,119,115,58,109,101,114,103,101,100,32,119,
+105,116,104,116,104,114,111,117,103,104,32,116,104,101,99,111,109,109,101,114,99
+,105,97,108,32,112,111,105,110,116,101,100,32,111,117,116,111,112,112,111,114,
+116,117,110,105,116,121,118,105,101,119,32,111,102,32,116,104,101,114,101,113,
+117,105,114,101,109,101,110,116,100,105,118,105,115,105,111,110,32,111,102,112,
+114,111,103,114,97,109,109,105,110,103,104,101,32,114,101,99,101,105,118,101,100
+,115,101,116,73,110,116,101,114,118,97,108,34,62,60,47,115,112,97,110,62,60,47,
+105,110,32,78,101,119,32,89,111,114,107,97,100,100,105,116,105,111,110,97,108,32
+,99,111,109,112,114,101,115,115,105,111,110,10,10,60,100,105,118,32,105,100,61,
+34,105,110,99,111,114,112,111,114,97,116,101,59,60,47,115,99,114,105,112,116,62,
+60,97,116,116,97,99,104,69,118,101,110,116,98,101,99,97,109,101,32,116,104,101,
+32,34,32,116,97,114,103,101,116,61,34,95,99,97,114,114,105,101,100,32,111,117,
+116,83,111,109,101,32,111,102,32,116,104,101,115,99,105,101,110,99,101,32,97,110
+,100,116,104,101,32,116,105,109,101,32,111,102,67,111,110,116,97,105,110,101,114
+,34,62,109,97,105,110,116,97,105,110,105,110,103,67,104,114,105,115,116,111,112,
+104,101,114,77,117,99,104,32,111,102,32,116,104,101,119,114,105,116,105,110,103,
+115,32,111,102,34,32,104,101,105,103,104,116,61,34,50,115,105,122,101,32,111,102
+,32,116,104,101,118,101,114,115,105,111,110,32,111,102,32,109,105,120,116,117,
+114,101,32,111,102,32,98,101,116,119,101,101,110,32,116,104,101,69,120,97,109,
+112,108,101,115,32,111,102,101,100,117,99,97,116,105,111,110,97,108,99,111,109,
+112,101,116,105,116,105,118,101,32,111,110,115,117,98,109,105,116,61,34,100,105,
+114,101,99,116,111,114,32,111,102,100,105,115,116,105,110,99,116,105,118,101,47,
+68,84,68,32,88,72,84,77,76,32,114,101,108,97,116,105,110,103,32,116,111,116,101,
+110,100,101,110,99,121,32,116,111,112,114,111,118,105,110,99,101,32,111,102,119,
+104,105,99,104,32,119,111,117,108,100,100,101,115,112,105,116,101,32,116,104,101
+,115,99,105,101,110,116,105,102,105,99,32,108,101,103,105,115,108,97,116,117,114
+,101,46,105,110,110,101,114,72,84,77,76,32,97,108,108,101,103,97,116,105,111,110
+,115,65,103,114,105,99,117,108,116,117,114,101,119,97,115,32,117,115,101,100,32,
+105,110,97,112,112,114,111,97,99,104,32,116,111,105,110,116,101,108,108,105,103,
+101,110,116,121,101,97,114,115,32,108,97,116,101,114,44,115,97,110,115,45,115,
+101,114,105,102,100,101,116,101,114,109,105,110,105,110,103,80,101,114,102,111,
+114,109,97,110,99,101,97,112,112,101,97,114,97,110,99,101,115,44,32,119,104,105,
+99,104,32,105,115,32,102,111,117,110,100,97,116,105,111,110,115,97,98,98,114,101
+,118,105,97,116,101,100,104,105,103,104,101,114,32,116,104,97,110,115,32,102,114
+,111,109,32,116,104,101,32,105,110,100,105,118,105,100,117,97,108,32,99,111,109,
+112,111,115,101,100,32,111,102,115,117,112,112,111,115,101,100,32,116,111,99,108
+,97,105,109,115,32,116,104,97,116,97,116,116,114,105,98,117,116,105,111,110,102,
+111,110,116,45,115,105,122,101,58,49,101,108,101,109,101,110,116,115,32,111,102,
+72,105,115,116,111,114,105,99,97,108,32,104,105,115,32,98,114,111,116,104,101,
+114,97,116,32,116,104,101,32,116,105,109,101,97,110,110,105,118,101,114,115,97,
+114,121,103,111,118,101,114,110,101,100,32,98,121,114,101,108,97,116,101,100,32,
+116,111,32,117,108,116,105,109,97,116,101,108,121,32,105,110,110,111,118,97,116,
+105,111,110,115,105,116,32,105,115,32,115,116,105,108,108,99,97,110,32,111,110,
+108,121,32,98,101,100,101,102,105,110,105,116,105,111,110,115,116,111,71,77,84,
+83,116,114,105,110,103,65,32,110,117,109,98,101,114,32,111,102,105,109,103,32,99
+,108,97,115,115,61,34,69,118,101,110,116,117,97,108,108,121,44,119,97,115,32,99,
+104,97,110,103,101,100,111,99,99,117,114,114,101,100,32,105,110,110,101,105,103,
+104,98,111,114,105,110,103,100,105,115,116,105,110,103,117,105,115,104,119,104,
+101,110,32,104,101,32,119,97,115,105,110,116,114,111,100,117,99,105,110,103,116,
+101,114,114,101,115,116,114,105,97,108,77,97,110,121,32,111,102,32,116,104,101,
+97,114,103,117,101,115,32,116,104,97,116,97,110,32,65,109,101,114,105,99,97,110,
+99,111,110,113,117,101,115,116,32,111,102,119,105,100,101,115,112,114,101,97,100
+,32,119,101,114,101,32,107,105,108,108,101,100,115,99,114,101,101,110,32,97,110,
+100,32,73,110,32,111,114,100,101,114,32,116,111,101,120,112,101,99,116,101,100,
+32,116,111,100,101,115,99,101,110,100,97,110,116,115,97,114,101,32,108,111,99,97
+,116,101,100,108,101,103,105,115,108,97,116,105,118,101,103,101,110,101,114,97,
+116,105,111,110,115,32,98,97,99,107,103,114,111,117,110,100,109,111,115,116,32,
+112,101,111,112,108,101,121,101,97,114,115,32,97,102,116,101,114,116,104,101,114
+,101,32,105,115,32,110,111,116,104,101,32,104,105,103,104,101,115,116,102,114,
+101,113,117,101,110,116,108,121,32,116,104,101,121,32,100,111,32,110,111,116,97,
+114,103,117,101,100,32,116,104,97,116,115,104,111,119,101,100,32,116,104,97,116,
+112,114,101,100,111,109,105,110,97,110,116,116,104,101,111,108,111,103,105,99,97
+,108,98,121,32,116,104,101,32,116,105,109,101,99,111,110,115,105,100,101,114,105
+,110,103,115,104,111,114,116,45,108,105,118,101,100,60,47,115,112,97,110,62,60,
+47,97,62,99,97,110,32,98,101,32,117,115,101,100,118,101,114,121,32,108,105,116,
+116,108,101,111,110,101,32,111,102,32,116,104,101,32,104,97,100,32,97,108,114,
+101,97,100,121,105,110,116,101,114,112,114,101,116,101,100,99,111,109,109,117,
+110,105,99,97,116,101,102,101,97,116,117,114,101,115,32,111,102,103,111,118,101,
+114,110,109,101,110,116,44,60,47,110,111,115,99,114,105,112,116,62,101,110,116,
+101,114,101,100,32,116,104,101,34,32,104,101,105,103,104,116,61,34,51,73,110,100
+,101,112,101,110,100,101,110,116,112,111,112,117,108,97,116,105,111,110,115,108,
+97,114,103,101,45,115,99,97,108,101,46,32,65,108,116,104,111,117,103,104,32,117,
+115,101,100,32,105,110,32,116,104,101,100,101,115,116,114,117,99,116,105,111,110
+,112,111,115,115,105,98,105,108,105,116,121,115,116,97,114,116,105,110,103,32,
+105,110,116,119,111,32,111,114,32,109,111,114,101,101,120,112,114,101,115,115,
+105,111,110,115,115,117,98,111,114,100,105,110,97,116,101,108,97,114,103,101,114
+,32,116,104,97,110,104,105,115,116,111,114,121,32,97,110,100,60,47,111,112,116,
+105,111,110,62,13,10,67,111,110,116,105,110,101,110,116,97,108,101,108,105,109,
+105,110,97,116,105,110,103,119,105,108,108,32,110,111,116,32,98,101,112,114,97,
+99,116,105,99,101,32,111,102,105,110,32,102,114,111,110,116,32,111,102,115,105,
+116,101,32,111,102,32,116,104,101,101,110,115,117,114,101,32,116,104,97,116,116,
+111,32,99,114,101,97,116,101,32,97,109,105,115,115,105,115,115,105,112,112,105,
+112,111,116,101,110,116,105,97,108,108,121,111,117,116,115,116,97,110,100,105,
+110,103,98,101,116,116,101,114,32,116,104,97,110,119,104,97,116,32,105,115,32,
+110,111,119,115,105,116,117,97,116,101,100,32,105,110,109,101,116,97,32,110,97,
+109,101,61,34,84,114,97,100,105,116,105,111,110,97,108,115,117,103,103,101,115,
+116,105,111,110,115,84,114,97,110,115,108,97,116,105,111,110,116,104,101,32,102,
+111,114,109,32,111,102,97,116,109,111,115,112,104,101,114,105,99,105,100,101,111
+,108,111,103,105,99,97,108,101,110,116,101,114,112,114,105,115,101,115,99,97,108
+,99,117,108,97,116,105,110,103,101,97,115,116,32,111,102,32,116,104,101,114,101,
+109,110,97,110,116,115,32,111,102,112,108,117,103,105,110,115,112,97,103,101,47,
+105,110,100,101,120,46,112,104,112,63,114,101,109,97,105,110,101,100,32,105,110,
+116,114,97,110,115,102,111,114,109,101,100,72,101,32,119,97,115,32,97,108,115,
+111,119,97,115,32,97,108,114,101,97,100,121,115,116,97,116,105,115,116,105,99,97
+,108,105,110,32,102,97,118,111,114,32,111,102,77,105,110,105,115,116,114,121,32,
+111,102,109,111,118,101,109,101,110,116,32,111,102,102,111,114,109,117,108,97,
+116,105,111,110,105,115,32,114,101,113,117,105,114,101,100,60,108,105,110,107,32
+,114,101,108,61,34,84,104,105,115,32,105,115,32,116,104,101,32,60,97,32,104,114,
+101,102,61,34,47,112,111,112,117,108,97,114,105,122,101,100,105,110,118,111,108,
+118,101,100,32,105,110,97,114,101,32,117,115,101,100,32,116,111,97,110,100,32,
+115,101,118,101,114,97,108,109,97,100,101,32,98,121,32,116,104,101,115,101,101,
+109,115,32,116,111,32,98,101,108,105,107,101,108,121,32,116,104,97,116,80,97,108
+,101,115,116,105,110,105,97,110,110,97,109,101,100,32,97,102,116,101,114,105,116
+,32,104,97,100,32,98,101,101,110,109,111,115,116,32,99,111,109,109,111,110,116,
+111,32,114,101,102,101,114,32,116,111,98,117,116,32,116,104,105,115,32,105,115,
+99,111,110,115,101,99,117,116,105,118,101,116,101,109,112,111,114,97,114,105,108
+,121,73,110,32,103,101,110,101,114,97,108,44,99,111,110,118,101,110,116,105,111,
+110,115,116,97,107,101,115,32,112,108,97,99,101,115,117,98,100,105,118,105,115,
+105,111,110,116,101,114,114,105,116,111,114,105,97,108,111,112,101,114,97,116,
+105,111,110,97,108,112,101,114,109,97,110,101,110,116,108,121,119,97,115,32,108,
+97,114,103,101,108,121,111,117,116,98,114,101,97,107,32,111,102,105,110,32,116,
+104,101,32,112,97,115,116,102,111,108,108,111,119,105,110,103,32,97,32,120,109,
+108,110,115,58,111,103,61,34,62,60,97,32,99,108,97,115,115,61,34,99,108,97,115,
+115,61,34,116,101,120,116,67,111,110,118,101,114,115,105,111,110,32,109,97,121,
+32,98,101,32,117,115,101,100,109,97,110,117,102,97,99,116,117,114,101,97,102,116
+,101,114,32,98,101,105,110,103,99,108,101,97,114,102,105,120,34,62,10,113,117,
+101,115,116,105,111,110,32,111,102,119,97,115,32,101,108,101,99,116,101,100,116,
+111,32,98,101,99,111,109,101,32,97,98,101,99,97,117,115,101,32,111,102,32,115,
+111,109,101,32,112,101,111,112,108,101,105,110,115,112,105,114,101,100,32,98,121
+,115,117,99,99,101,115,115,102,117,108,32,97,32,116,105,109,101,32,119,104,101,
+110,109,111,114,101,32,99,111,109,109,111,110,97,109,111,110,103,115,116,32,116,
+104,101,97,110,32,111,102,102,105,99,105,97,108,119,105,100,116,104,58,49,48,48,
+37,59,116,101,99,104,110,111,108,111,103,121,44,119,97,115,32,97,100,111,112,116
+,101,100,116,111,32,107,101,101,112,32,116,104,101,115,101,116,116,108,101,109,
+101,110,116,115,108,105,118,101,32,98,105,114,116,104,115,105,110,100,101,120,46
+,104,116,109,108,34,67,111,110,110,101,99,116,105,99,117,116,97,115,115,105,103,
+110,101,100,32,116,111,38,97,109,112,59,116,105,109,101,115,59,97,99,99,111,117,
+110,116,32,102,111,114,97,108,105,103,110,61,114,105,103,104,116,116,104,101,32,
+99,111,109,112,97,110,121,97,108,119,97,121,115,32,98,101,101,110,114,101,116,
+117,114,110,101,100,32,116,111,105,110,118,111,108,118,101,109,101,110,116,66,
+101,99,97,117,115,101,32,116,104,101,116,104,105,115,32,112,101,114,105,111,100,
+34,32,110,97,109,101,61,34,113,34,32,99,111,110,102,105,110,101,100,32,116,111,
+97,32,114,101,115,117,108,116,32,111,102,118,97,108,117,101,61,34,34,32,47,62,
+105,115,32,97,99,116,117,97,108,108,121,69,110,118,105,114,111,110,109,101,110,
+116,13,10,60,47,104,101,97,100,62,13,10,67,111,110,118,101,114,115,101,108,121,
+44,62,10,60,100,105,118,32,105,100,61,34,48,34,32,119,105,100,116,104,61,34,49,
+105,115,32,112,114,111,98,97,98,108,121,104,97,118,101,32,98,101,99,111,109,101,
+99,111,110,116,114,111,108,108,105,110,103,116,104,101,32,112,114,111,98,108,101
+,109,99,105,116,105,122,101,110,115,32,111,102,112,111,108,105,116,105,99,105,97
+,110,115,114,101,97,99,104,101,100,32,116,104,101,97,115,32,101,97,114,108,121,
+32,97,115,58,110,111,110,101,59,32,111,118,101,114,60,116,97,98,108,101,32,99,
+101,108,108,118,97,108,105,100,105,116,121,32,111,102,100,105,114,101,99,116,108
+,121,32,116,111,111,110,109,111,117,115,101,100,111,119,110,119,104,101,114,101,
+32,105,116,32,105,115,119,104,101,110,32,105,116,32,119,97,115,109,101,109,98,
+101,114,115,32,111,102,32,114,101,108,97,116,105,111,110,32,116,111,97,99,99,111
+,109,109,111,100,97,116,101,97,108,111,110,103,32,119,105,116,104,32,73,110,32,
+116,104,101,32,108,97,116,101,116,104,101,32,69,110,103,108,105,115,104,100,101,
+108,105,99,105,111,117,115,34,62,116,104,105,115,32,105,115,32,110,111,116,116,
+104,101,32,112,114,101,115,101,110,116,105,102,32,116,104,101,121,32,97,114,101,
+97,110,100,32,102,105,110,97,108,108,121,97,32,109,97,116,116,101,114,32,111,102
+,13,10,9,60,47,100,105,118,62,13,10,13,10,60,47,115,99,114,105,112,116,62,102,97
+,115,116,101,114,32,116,104,97,110,109,97,106,111,114,105,116,121,32,111,102,97,
+102,116,101,114,32,119,104,105,99,104,99,111,109,112,97,114,97,116,105,118,101,
+116,111,32,109,97,105,110,116,97,105,110,105,109,112,114,111,118,101,32,116,104,
+101,97,119,97,114,100,101,100,32,116,104,101,101,114,34,32,99,108,97,115,115,61,
+34,102,114,97,109,101,98,111,114,100,101,114,114,101,115,116,111,114,97,116,105,
+111,110,105,110,32,116,104,101,32,115,97,109,101,97,110,97,108,121,115,105,115,
+32,111,102,116,104,101,105,114,32,102,105,114,115,116,68,117,114,105,110,103,32,
+116,104,101,32,99,111,110,116,105,110,101,110,116,97,108,115,101,113,117,101,110
+,99,101,32,111,102,102,117,110,99,116,105,111,110,40,41,123,102,111,110,116,45,
+115,105,122,101,58,32,119,111,114,107,32,111,110,32,116,104,101,60,47,115,99,114
+,105,112,116,62,10,60,98,101,103,105,110,115,32,119,105,116,104,106,97,118,97,
+115,99,114,105,112,116,58,99,111,110,115,116,105,116,117,101,110,116,119,97,115,
+32,102,111,117,110,100,101,100,101,113,117,105,108,105,98,114,105,117,109,97,115
+,115,117,109,101,32,116,104,97,116,105,115,32,103,105,118,101,110,32,98,121,110,
+101,101,100,115,32,116,111,32,98,101,99,111,111,114,100,105,110,97,116,101,115,
+116,104,101,32,118,97,114,105,111,117,115,97,114,101,32,112,97,114,116,32,111,
+102,111,110,108,121,32,105,110,32,116,104,101,115,101,99,116,105,111,110,115,32,
+111,102,105,115,32,97,32,99,111,109,109,111,110,116,104,101,111,114,105,101,115,
+32,111,102,100,105,115,99,111,118,101,114,105,101,115,97,115,115,111,99,105,97,
+116,105,111,110,101,100,103,101,32,111,102,32,116,104,101,115,116,114,101,110,
+103,116,104,32,111,102,112,111,115,105,116,105,111,110,32,105,110,112,114,101,
+115,101,110,116,45,100,97,121,117,110,105,118,101,114,115,97,108,108,121,116,111
+,32,102,111,114,109,32,116,104,101,98,117,116,32,105,110,115,116,101,97,100,99,
+111,114,112,111,114,97,116,105,111,110,97,116,116,97,99,104,101,100,32,116,111,
+105,115,32,99,111,109,109,111,110,108,121,114,101,97,115,111,110,115,32,102,111,
+114,32,38,113,117,111,116,59,116,104,101,32,99,97,110,32,98,101,32,109,97,100,
+101,119,97,115,32,97,98,108,101,32,116,111,119,104,105,99,104,32,109,101,97,110,
+115,98,117,116,32,100,105,100,32,110,111,116,111,110,77,111,117,115,101,79,118,
+101,114,97,115,32,112,111,115,115,105,98,108,101,111,112,101,114,97,116,101,100,
+32,98,121,99,111,109,105,110,103,32,102,114,111,109,116,104,101,32,112,114,105,
+109,97,114,121,97,100,100,105,116,105,111,110,32,111,102,102,111,114,32,115,101,
+118,101,114,97,108,116,114,97,110,115,102,101,114,114,101,100,97,32,112,101,114,
+105,111,100,32,111,102,97,114,101,32,97,98,108,101,32,116,111,104,111,119,101,
+118,101,114,44,32,105,116,115,104,111,117,108,100,32,104,97,118,101,109,117,99,
+104,32,108,97,114,103,101,114,10,9,60,47,115,99,114,105,112,116,62,97,100,111,
+112,116,101,100,32,116,104,101,112,114,111,112,101,114,116,121,32,111,102,100,
+105,114,101,99,116,101,100,32,98,121,101,102,102,101,99,116,105,118,101,108,121,
+119,97,115,32,98,114,111,117,103,104,116,99,104,105,108,100,114,101,110,32,111,
+102,80,114,111,103,114,97,109,109,105,110,103,108,111,110,103,101,114,32,116,104
+,97,110,109,97,110,117,115,99,114,105,112,116,115,119,97,114,32,97,103,97,105,
+110,115,116,98,121,32,109,101,97,110,115,32,111,102,97,110,100,32,109,111,115,
+116,32,111,102,115,105,109,105,108,97,114,32,116,111,32,112,114,111,112,114,105,
+101,116,97,114,121,111,114,105,103,105,110,97,116,105,110,103,112,114,101,115,
+116,105,103,105,111,117,115,103,114,97,109,109,97,116,105,99,97,108,101,120,112,
+101,114,105,101,110,99,101,46,116,111,32,109,97,107,101,32,116,104,101,73,116,32
+,119,97,115,32,97,108,115,111,105,115,32,102,111,117,110,100,32,105,110,99,111,
+109,112,101,116,105,116,111,114,115,105,110,32,116,104,101,32,85,46,83,46,114,
+101,112,108,97,99,101,32,116,104,101,98,114,111,117,103,104,116,32,116,104,101,
+99,97,108,99,117,108,97,116,105,111,110,102,97,108,108,32,111,102,32,116,104,101
+,116,104,101,32,103,101,110,101,114,97,108,112,114,97,99,116,105,99,97,108,108,
+121,105,110,32,104,111,110,111,114,32,111,102,114,101,108,101,97,115,101,100,32,
+105,110,114,101,115,105,100,101,110,116,105,97,108,97,110,100,32,115,111,109,101
+,32,111,102,107,105,110,103,32,111,102,32,116,104,101,114,101,97,99,116,105,111,
+110,32,116,111,49,115,116,32,69,97,114,108,32,111,102,99,117,108,116,117,114,101
+,32,97,110,100,112,114,105,110,99,105,112,97,108,108,121,60,47,116,105,116,108,
+101,62,10,32,32,116,104,101,121,32,99,97,110,32,98,101,98,97,99,107,32,116,111,
+32,116,104,101,115,111,109,101,32,111,102,32,104,105,115,101,120,112,111,115,117
+,114,101,32,116,111,97,114,101,32,115,105,109,105,108,97,114,102,111,114,109,32,
+111,102,32,116,104,101,97,100,100,70,97,118,111,114,105,116,101,99,105,116,105,
+122,101,110,115,104,105,112,112,97,114,116,32,105,110,32,116,104,101,112,101,111
+,112,108,101,32,119,105,116,104,105,110,32,112,114,97,99,116,105,99,101,116,111,
+32,99,111,110,116,105,110,117,101,38,97,109,112,59,109,105,110,117,115,59,97,112
+,112,114,111,118,101,100,32,98,121,32,116,104,101,32,102,105,114,115,116,32,97,
+108,108,111,119,101,100,32,116,104,101,97,110,100,32,102,111,114,32,116,104,101,
+102,117,110,99,116,105,111,110,105,110,103,112,108,97,121,105,110,103,32,116,104
+,101,115,111,108,117,116,105,111,110,32,116,111,104,101,105,103,104,116,61,34,48
+,34,32,105,110,32,104,105,115,32,98,111,111,107,109,111,114,101,32,116,104,97,
+110,32,97,102,111,108,108,111,119,115,32,116,104,101,99,114,101,97,116,101,100,
+32,116,104,101,112,114,101,115,101,110,99,101,32,105,110,38,110,98,115,112,59,60
+,47,116,100,62,110,97,116,105,111,110,97,108,105,115,116,116,104,101,32,105,100,
+101,97,32,111,102,97,32,99,104,97,114,97,99,116,101,114,119,101,114,101,32,102,
+111,114,99,101,100,32,99,108,97,115,115,61,34,98,116,110,100,97,121,115,32,111,
+102,32,116,104,101,102,101,97,116,117,114,101,100,32,105,110,115,104,111,119,105
+,110,103,32,116,104,101,105,110,116,101,114,101,115,116,32,105,110,105,110,32,
+112,108,97,99,101,32,111,102,116,117,114,110,32,111,102,32,116,104,101,116,104,
+101,32,104,101,97,100,32,111,102,76,111,114,100,32,111,102,32,116,104,101,112,
+111,108,105,116,105,99,97,108,108,121,104,97,115,32,105,116,115,32,111,119,110,
+69,100,117,99,97,116,105,111,110,97,108,97,112,112,114,111,118,97,108,32,111,102
+,115,111,109,101,32,111,102,32,116,104,101,101,97,99,104,32,111,116,104,101,114,
+44,98,101,104,97,118,105,111,114,32,111,102,97,110,100,32,98,101,99,97,117,115,
+101,97,110,100,32,97,110,111,116,104,101,114,97,112,112,101,97,114,101,100,32,
+111,110,114,101,99,111,114,100,101,100,32,105,110,98,108,97,99,107,38,113,117,
+111,116,59,109,97,121,32,105,110,99,108,117,100,101,116,104,101,32,119,111,114,
+108,100,39,115,99,97,110,32,108,101,97,100,32,116,111,114,101,102,101,114,115,32
+,116,111,32,97,98,111,114,100,101,114,61,34,48,34,32,103,111,118,101,114,110,109
+,101,110,116,32,119,105,110,110,105,110,103,32,116,104,101,114,101,115,117,108,
+116,101,100,32,105,110,32,119,104,105,108,101,32,116,104,101,32,87,97,115,104,
+105,110,103,116,111,110,44,116,104,101,32,115,117,98,106,101,99,116,99,105,116,
+121,32,105,110,32,116,104,101,62,60,47,100,105,118,62,13,10,9,9,114,101,102,108,
+101,99,116,32,116,104,101,116,111,32,99,111,109,112,108,101,116,101,98,101,99,97
+,109,101,32,109,111,114,101,114,97,100,105,111,97,99,116,105,118,101,114,101,106
+,101,99,116,101,100,32,98,121,119,105,116,104,111,117,116,32,97,110,121,104,105,
+115,32,102,97,116,104,101,114,44,119,104,105,99,104,32,99,111,117,108,100,99,111
+,112,121,32,111,102,32,116,104,101,116,111,32,105,110,100,105,99,97,116,101,97,
+32,112,111,108,105,116,105,99,97,108,97,99,99,111,117,110,116,115,32,111,102,99,
+111,110,115,116,105,116,117,116,101,115,119,111,114,107,101,100,32,119,105,116,
+104,101,114,60,47,97,62,60,47,108,105,62,111,102,32,104,105,115,32,108,105,102,
+101,97,99,99,111,109,112,97,110,105,101,100,99,108,105,101,110,116,87,105,100,
+116,104,112,114,101,118,101,110,116,32,116,104,101,76,101,103,105,115,108,97,116
+,105,118,101,100,105,102,102,101,114,101,110,116,108,121,116,111,103,101,116,104
+,101,114,32,105,110,104,97,115,32,115,101,118,101,114,97,108,102,111,114,32,97,
+110,111,116,104,101,114,116,101,120,116,32,111,102,32,116,104,101,102,111,117,
+110,100,101,100,32,116,104,101,101,32,119,105,116,104,32,116,104,101,32,105,115,
+32,117,115,101,100,32,102,111,114,99,104,97,110,103,101,100,32,116,104,101,117,
+115,117,97,108,108,121,32,116,104,101,112,108,97,99,101,32,119,104,101,114,101,
+119,104,101,114,101,97,115,32,116,104,101,62,32,60,97,32,104,114,101,102,61,34,
+34,62,60,97,32,104,114,101,102,61,34,116,104,101,109,115,101,108,118,101,115,44,
+97,108,116,104,111,117,103,104,32,104,101,116,104,97,116,32,99,97,110,32,98,101,
+116,114,97,100,105,116,105,111,110,97,108,114,111,108,101,32,111,102,32,116,104,
+101,97,115,32,97,32,114,101,115,117,108,116,114,101,109,111,118,101,67,104,105,
+108,100,100,101,115,105,103,110,101,100,32,98,121,119,101,115,116,32,111,102,32,
+116,104,101,83,111,109,101,32,112,101,111,112,108,101,112,114,111,100,117,99,116
+,105,111,110,44,115,105,100,101,32,111,102,32,116,104,101,110,101,119,115,108,
+101,116,116,101,114,115,117,115,101,100,32,98,121,32,116,104,101,100,111,119,110
+,32,116,111,32,116,104,101,97,99,99,101,112,116,101,100,32,98,121,108,105,118,
+101,32,105,110,32,116,104,101,97,116,116,101,109,112,116,115,32,116,111,111,117,
+116,115,105,100,101,32,116,104,101,102,114,101,113,117,101,110,99,105,101,115,72
+,111,119,101,118,101,114,44,32,105,110,112,114,111,103,114,97,109,109,101,114,
+115,97,116,32,108,101,97,115,116,32,105,110,97,112,112,114,111,120,105,109,97,
+116,101,97,108,116,104,111,117,103,104,32,105,116,119,97,115,32,112,97,114,116,
+32,111,102,97,110,100,32,118,97,114,105,111,117,115,71,111,118,101,114,110,111,
+114,32,111,102,116,104,101,32,97,114,116,105,99,108,101,116,117,114,110,101,100,
+32,105,110,116,111,62,60,97,32,104,114,101,102,61,34,47,116,104,101,32,101,99,
+111,110,111,109,121,105,115,32,116,104,101,32,109,111,115,116,109,111,115,116,32
+,119,105,100,101,108,121,119,111,117,108,100,32,108,97,116,101,114,97,110,100,32
+,112,101,114,104,97,112,115,114,105,115,101,32,116,111,32,116,104,101,111,99,99,
+117,114,115,32,119,104,101,110,117,110,100,101,114,32,119,104,105,99,104,99,111,
+110,100,105,116,105,111,110,115,46,116,104,101,32,119,101,115,116,101,114,110,
+116,104,101,111,114,121,32,116,104,97,116,105,115,32,112,114,111,100,117,99,101,
+100,116,104,101,32,99,105,116,121,32,111,102,105,110,32,119,104,105,99,104,32,
+104,101,115,101,101,110,32,105,110,32,116,104,101,116,104,101,32,99,101,110,116,
+114,97,108,98,117,105,108,100,105,110,103,32,111,102,109,97,110,121,32,111,102,
+32,104,105,115,97,114,101,97,32,111,102,32,116,104,101,105,115,32,116,104,101,32
+,111,110,108,121,109,111,115,116,32,111,102,32,116,104,101,109,97,110,121,32,111
+,102,32,116,104,101,116,104,101,32,87,101,115,116,101,114,110,84,104,101,114,101
+,32,105,115,32,110,111,101,120,116,101,110,100,101,100,32,116,111,83,116,97,116,
+105,115,116,105,99,97,108,99,111,108,115,112,97,110,61,50,32,124,115,104,111,114
+,116,32,115,116,111,114,121,112,111,115,115,105,98,108,101,32,116,111,116,111,
+112,111,108,111,103,105,99,97,108,99,114,105,116,105,99,97,108,32,111,102,114,
+101,112,111,114,116,101,100,32,116,111,97,32,67,104,114,105,115,116,105,97,110,
+100,101,99,105,115,105,111,110,32,116,111,105,115,32,101,113,117,97,108,32,116,
+111,112,114,111,98,108,101,109,115,32,111,102,84,104,105,115,32,99,97,110,32,98,
+101,109,101,114,99,104,97,110,100,105,115,101,102,111,114,32,109,111,115,116,32,
+111,102,110,111,32,101,118,105,100,101,110,99,101,101,100,105,116,105,111,110,
+115,32,111,102,101,108,101,109,101,110,116,115,32,105,110,38,113,117,111,116,59,
+46,32,84,104,101,99,111,109,47,105,109,97,103,101,115,47,119,104,105,99,104,32,
+109,97,107,101,115,116,104,101,32,112,114,111,99,101,115,115,114,101,109,97,105,
+110,115,32,116,104,101,108,105,116,101,114,97,116,117,114,101,44,105,115,32,97,
+32,109,101,109,98,101,114,116,104,101,32,112,111,112,117,108,97,114,116,104,101,
+32,97,110,99,105,101,110,116,112,114,111,98,108,101,109,115,32,105,110,116,105,
+109,101,32,111,102,32,116,104,101,100,101,102,101,97,116,101,100,32,98,121,98,
+111,100,121,32,111,102,32,116,104,101,97,32,102,101,119,32,121,101,97,114,115,
+109,117,99,104,32,111,102,32,116,104,101,116,104,101,32,119,111,114,107,32,111,
+102,67,97,108,105,102,111,114,110,105,97,44,115,101,114,118,101,100,32,97,115,32
+,97,103,111,118,101,114,110,109,101,110,116,46,99,111,110,99,101,112,116,115,32,
+111,102,109,111,118,101,109,101,110,116,32,105,110,9,9,60,100,105,118,32,105,100
+,61,34,105,116,34,32,118,97,108,117,101,61,34,108,97,110,103,117,97,103,101,32,
+111,102,97,115,32,116,104,101,121,32,97,114,101,112,114,111,100,117,99,101,100,
+32,105,110,105,115,32,116,104,97,116,32,116,104,101,101,120,112,108,97,105,110,
+32,116,104,101,100,105,118,62,60,47,100,105,118,62,10,72,111,119,101,118,101,114
+,32,116,104,101,108,101,97,100,32,116,111,32,116,104,101,9,60,97,32,104,114,101,
+102,61,34,47,119,97,115,32,103,114,97,110,116,101,100,112,101,111,112,108,101,32
+,104,97,118,101,99,111,110,116,105,110,117,97,108,108,121,119,97,115,32,115,101,
+101,110,32,97,115,97,110,100,32,114,101,108,97,116,101,100,116,104,101,32,114,
+111,108,101,32,111,102,112,114,111,112,111,115,101,100,32,98,121,111,102,32,116,
+104,101,32,98,101,115,116,101,97,99,104,32,111,116,104,101,114,46,67,111,110,115
+,116,97,110,116,105,110,101,112,101,111,112,108,101,32,102,114,111,109,100,105,
+97,108,101,99,116,115,32,111,102,116,111,32,114,101,118,105,115,105,111,110,119,
+97,115,32,114,101,110,97,109,101,100,97,32,115,111,117,114,99,101,32,111,102,116
+,104,101,32,105,110,105,116,105,97,108,108,97,117,110,99,104,101,100,32,105,110,
+112,114,111,118,105,100,101,32,116,104,101,116,111,32,116,104,101,32,119,101,115
+,116,119,104,101,114,101,32,116,104,101,114,101,97,110,100,32,115,105,109,105,
+108,97,114,98,101,116,119,101,101,110,32,116,119,111,105,115,32,97,108,115,111,
+32,116,104,101,69,110,103,108,105,115,104,32,97,110,100,99,111,110,100,105,116,
+105,111,110,115,44,116,104,97,116,32,105,116,32,119,97,115,101,110,116,105,116,
+108,101,100,32,116,111,116,104,101,109,115,101,108,118,101,115,46,113,117,97,110
+,116,105,116,121,32,111,102,114,97,110,115,112,97,114,101,110,99,121,116,104,101
+,32,115,97,109,101,32,97,115,116,111,32,106,111,105,110,32,116,104,101,99,111,
+117,110,116,114,121,32,97,110,100,116,104,105,115,32,105,115,32,116,104,101,84,
+104,105,115,32,108,101,100,32,116,111,97,32,115,116,97,116,101,109,101,110,116,
+99,111,110,116,114,97,115,116,32,116,111,108,97,115,116,73,110,100,101,120,79,
+102,116,104,114,111,117,103,104,32,104,105,115,105,115,32,100,101,115,105,103,
+110,101,100,116,104,101,32,116,101,114,109,32,105,115,105,115,32,112,114,111,118
+,105,100,101,100,112,114,111,116,101,99,116,32,116,104,101,110,103,60,47,97,62,
+60,47,108,105,62,84,104,101,32,99,117,114,114,101,110,116,116,104,101,32,115,105
+,116,101,32,111,102,115,117,98,115,116,97,110,116,105,97,108,101,120,112,101,114
+,105,101,110,99,101,44,105,110,32,116,104,101,32,87,101,115,116,116,104,101,121,
+32,115,104,111,117,108,100,115,108,111,118,101,110,196,141,105,110,97,99,111,109
+,101,110,116,97,114,105,111,115,117,110,105,118,101,114,115,105,100,97,100,99,
+111,110,100,105,99,105,111,110,101,115,97,99,116,105,118,105,100,97,100,101,115,
+101,120,112,101,114,105,101,110,99,105,97,116,101,99,110,111,108,111,103,195,173
+,97,112,114,111,100,117,99,99,105,195,179,110,112,117,110,116,117,97,99,105,195,
+179,110,97,112,108,105,99,97,99,105,195,179,110,99,111,110,116,114,97,115,101,
+195,177,97,99,97,116,101,103,111,114,195,173,97,115,114,101,103,105,115,116,114,
+97,114,115,101,112,114,111,102,101,115,105,111,110,97,108,116,114,97,116,97,109,
+105,101,110,116,111,114,101,103,195,173,115,116,114,97,116,101,115,101,99,114,
+101,116,97,114,195,173,97,112,114,105,110,99,105,112,97,108,101,115,112,114,111,
+116,101,99,99,105,195,179,110,105,109,112,111,114,116,97,110,116,101,115,105,109
+,112,111,114,116,97,110,99,105,97,112,111,115,105,98,105,108,105,100,97,100,105,
+110,116,101,114,101,115,97,110,116,101,99,114,101,99,105,109,105,101,110,116,111
+,110,101,99,101,115,105,100,97,100,101,115,115,117,115,99,114,105,98,105,114,115
+,101,97,115,111,99,105,97,99,105,195,179,110,100,105,115,112,111,110,105,98,108,
+101,115,101,118,97,108,117,97,99,105,195,179,110,101,115,116,117,100,105,97,110,
+116,101,115,114,101,115,112,111,110,115,97,98,108,101,114,101,115,111,108,117,99
+,105,195,179,110,103,117,97,100,97,108,97,106,97,114,97,114,101,103,105,115,116,
+114,97,100,111,115,111,112,111,114,116,117,110,105,100,97,100,99,111,109,101,114
+,99,105,97,108,101,115,102,111,116,111,103,114,97,102,195,173,97,97,117,116,111,
+114,105,100,97,100,101,115,105,110,103,101,110,105,101,114,195,173,97,116,101,
+108,101,118,105,115,105,195,179,110,99,111,109,112,101,116,101,110,99,105,97,111
+,112,101,114,97,99,105,111,110,101,115,101,115,116,97,98,108,101,99,105,100,111,
+115,105,109,112,108,101,109,101,110,116,101,97,99,116,117,97,108,109,101,110,116
+,101,110,97,118,101,103,97,99,105,195,179,110,99,111,110,102,111,114,109,105,100
+,97,100,108,105,110,101,45,104,101,105,103,104,116,58,102,111,110,116,45,102,97,
+109,105,108,121,58,34,32,58,32,34,104,116,116,112,58,47,47,97,112,112,108,105,99
+,97,116,105,111,110,115,108,105,110,107,34,32,104,114,101,102,61,34,115,112,101,
+99,105,102,105,99,97,108,108,121,47,47,60,33,91,67,68,65,84,65,91,10,79,114,103,
+97,110,105,122,97,116,105,111,110,100,105,115,116,114,105,98,117,116,105,111,110
+,48,112,120,59,32,104,101,105,103,104,116,58,114,101,108,97,116,105,111,110,115,
+104,105,112,100,101,118,105,99,101,45,119,105,100,116,104,60,100,105,118,32,99,
+108,97,115,115,61,34,60,108,97,98,101,108,32,102,111,114,61,34,114,101,103,105,
+115,116,114,97,116,105,111,110,60,47,110,111,115,99,114,105,112,116,62,10,47,105
+,110,100,101,120,46,104,116,109,108,34,119,105,110,100,111,119,46,111,112,101,
+110,40,32,33,105,109,112,111,114,116,97,110,116,59,97,112,112,108,105,99,97,116,
+105,111,110,47,105,110,100,101,112,101,110,100,101,110,99,101,47,47,119,119,119,
+46,103,111,111,103,108,101,111,114,103,97,110,105,122,97,116,105,111,110,97,117,
+116,111,99,111,109,112,108,101,116,101,114,101,113,117,105,114,101,109,101,110,
+116,115,99,111,110,115,101,114,118,97,116,105,118,101,60,102,111,114,109,32,110,
+97,109,101,61,34,105,110,116,101,108,108,101,99,116,117,97,108,109,97,114,103,
+105,110,45,108,101,102,116,58,49,56,116,104,32,99,101,110,116,117,114,121,97,110
+,32,105,109,112,111,114,116,97,110,116,105,110,115,116,105,116,117,116,105,111,
+110,115,97,98,98,114,101,118,105,97,116,105,111,110,60,105,109,103,32,99,108,97,
+115,115,61,34,111,114,103,97,110,105,115,97,116,105,111,110,99,105,118,105,108,
+105,122,97,116,105,111,110,49,57,116,104,32,99,101,110,116,117,114,121,97,114,99
+,104,105,116,101,99,116,117,114,101,105,110,99,111,114,112,111,114,97,116,101,
+100,50,48,116,104,32,99,101,110,116,117,114,121,45,99,111,110,116,97,105,110,101
+,114,34,62,109,111,115,116,32,110,111,116,97,98,108,121,47,62,60,47,97,62,60,47,
+100,105,118,62,110,111,116,105,102,105,99,97,116,105,111,110,39,117,110,100,101,
+102,105,110,101,100,39,41,70,117,114,116,104,101,114,109,111,114,101,44,98,101,
+108,105,101,118,101,32,116,104,97,116,105,110,110,101,114,72,84,77,76,32,61,32,
+112,114,105,111,114,32,116,111,32,116,104,101,100,114,97,109,97,116,105,99,97,
+108,108,121,114,101,102,101,114,114,105,110,103,32,116,111,110,101,103,111,116,
+105,97,116,105,111,110,115,104,101,97,100,113,117,97,114,116,101,114,115,83,111,
+117,116,104,32,65,102,114,105,99,97,117,110,115,117,99,99,101,115,115,102,117,
+108,80,101,110,110,115,121,108,118,97,110,105,97,65,115,32,97,32,114,101,115,117
+,108,116,44,60,104,116,109,108,32,108,97,110,103,61,34,38,108,116,59,47,115,117,
+112,38,103,116,59,100,101,97,108,105,110,103,32,119,105,116,104,112,104,105,108,
+97,100,101,108,112,104,105,97,104,105,115,116,111,114,105,99,97,108,108,121,41,
+59,60,47,115,99,114,105,112,116,62,10,112,97,100,100,105,110,103,45,116,111,112,
+58,101,120,112,101,114,105,109,101,110,116,97,108,103,101,116,65,116,116,114,105
+,98,117,116,101,105,110,115,116,114,117,99,116,105,111,110,115,116,101,99,104,
+110,111,108,111,103,105,101,115,112,97,114,116,32,111,102,32,116,104,101,32,61,
+102,117,110,99,116,105,111,110,40,41,123,115,117,98,115,99,114,105,112,116,105,
+111,110,108,46,100,116,100,34,62,13,10,60,104,116,103,101,111,103,114,97,112,104
+,105,99,97,108,67,111,110,115,116,105,116,117,116,105,111,110,39,44,32,102,117,
+110,99,116,105,111,110,40,115,117,112,112,111,114,116,101,100,32,98,121,97,103,
+114,105,99,117,108,116,117,114,97,108,99,111,110,115,116,114,117,99,116,105,111,
+110,112,117,98,108,105,99,97,116,105,111,110,115,102,111,110,116,45,115,105,122,
+101,58,32,49,97,32,118,97,114,105,101,116,121,32,111,102,60,100,105,118,32,115,
+116,121,108,101,61,34,69,110,99,121,99,108,111,112,101,100,105,97,105,102,114,97
+,109,101,32,115,114,99,61,34,100,101,109,111,110,115,116,114,97,116,101,100,97,
+99,99,111,109,112,108,105,115,104,101,100,117,110,105,118,101,114,115,105,116,
+105,101,115,68,101,109,111,103,114,97,112,104,105,99,115,41,59,60,47,115,99,114,
+105,112,116,62,60,100,101,100,105,99,97,116,101,100,32,116,111,107,110,111,119,
+108,101,100,103,101,32,111,102,115,97,116,105,115,102,97,99,116,105,111,110,112,
+97,114,116,105,99,117,108,97,114,108,121,60,47,100,105,118,62,60,47,100,105,118,
+62,69,110,103,108,105,115,104,32,40,85,83,41,97,112,112,101,110,100,67,104,105,
+108,100,40,116,114,97,110,115,109,105,115,115,105,111,110,115,46,32,72,111,119,
+101,118,101,114,44,32,105,110,116,101,108,108,105,103,101,110,99,101,34,32,116,
+97,98,105,110,100,101,120,61,34,102,108,111,97,116,58,114,105,103,104,116,59,67,
+111,109,109,111,110,119,101,97,108,116,104,114,97,110,103,105,110,103,32,102,114
+,111,109,105,110,32,119,104,105,99,104,32,116,104,101,97,116,32,108,101,97,115,
+116,32,111,110,101,114,101,112,114,111,100,117,99,116,105,111,110,101,110,99,121
+,99,108,111,112,101,100,105,97,59,102,111,110,116,45,115,105,122,101,58,49,106,
+117,114,105,115,100,105,99,116,105,111,110,97,116,32,116,104,97,116,32,116,105,
+109,101,34,62,60,97,32,99,108,97,115,115,61,34,73,110,32,97,100,100,105,116,105,
+111,110,44,100,101,115,99,114,105,112,116,105,111,110,43,99,111,110,118,101,114,
+115,97,116,105,111,110,99,111,110,116,97,99,116,32,119,105,116,104,105,115,32,
+103,101,110,101,114,97,108,108,121,114,34,32,99,111,110,116,101,110,116,61,34,
+114,101,112,114,101,115,101,110,116,105,110,103,38,108,116,59,109,97,116,104,38,
+103,116,59,112,114,101,115,101,110,116,97,116,105,111,110,111,99,99,97,115,105,
+111,110,97,108,108,121,60,105,109,103,32,119,105,100,116,104,61,34,110,97,118,
+105,103,97,116,105,111,110,34,62,99,111,109,112,101,110,115,97,116,105,111,110,
+99,104,97,109,112,105,111,110,115,104,105,112,109,101,100,105,97,61,34,97,108,
+108,34,32,118,105,111,108,97,116,105,111,110,32,111,102,114,101,102,101,114,101,
+110,99,101,32,116,111,114,101,116,117,114,110,32,116,114,117,101,59,83,116,114,
+105,99,116,47,47,69,78,34,32,116,114,97,110,115,97,99,116,105,111,110,115,105,
+110,116,101,114,118,101,110,116,105,111,110,118,101,114,105,102,105,99,97,116,
+105,111,110,73,110,102,111,114,109,97,116,105,111,110,32,100,105,102,102,105,99,
+117,108,116,105,101,115,67,104,97,109,112,105,111,110,115,104,105,112,99,97,112,
+97,98,105,108,105,116,105,101,115,60,33,91,101,110,100,105,102,93,45,45,62,125,
+10,60,47,115,99,114,105,112,116,62,10,67,104,114,105,115,116,105,97,110,105,116,
+121,102,111,114,32,101,120,97,109,112,108,101,44,80,114,111,102,101,115,115,105,
+111,110,97,108,114,101,115,116,114,105,99,116,105,111,110,115,115,117,103,103,
+101,115,116,32,116,104,97,116,119,97,115,32,114,101,108,101,97,115,101,100,40,
+115,117,99,104,32,97,115,32,116,104,101,114,101,109,111,118,101,67,108,97,115,
+115,40,117,110,101,109,112,108,111,121,109,101,110,116,116,104,101,32,65,109,101
+,114,105,99,97,110,115,116,114,117,99,116,117,114,101,32,111,102,47,105,110,100,
+101,120,46,104,116,109,108,32,112,117,98,108,105,115,104,101,100,32,105,110,115,
+112,97,110,32,99,108,97,115,115,61,34,34,62,60,97,32,104,114,101,102,61,34,47,
+105,110,116,114,111,100,117,99,116,105,111,110,98,101,108,111,110,103,105,110,
+103,32,116,111,99,108,97,105,109,101,100,32,116,104,97,116,99,111,110,115,101,
+113,117,101,110,99,101,115,60,109,101,116,97,32,110,97,109,101,61,34,71,117,105,
+100,101,32,116,111,32,116,104,101,111,118,101,114,119,104,101,108,109,105,110,
+103,97,103,97,105,110,115,116,32,116,104,101,32,99,111,110,99,101,110,116,114,97
+,116,101,100,44,10,46,110,111,110,116,111,117,99,104,32,111,98,115,101,114,118,
+97,116,105,111,110,115,60,47,97,62,10,60,47,100,105,118,62,10,102,32,40,100,111,
+99,117,109,101,110,116,46,98,111,114,100,101,114,58,32,49,112,120,32,123,102,111
+,110,116,45,115,105,122,101,58,49,116,114,101,97,116,109,101,110,116,32,111,102,
+48,34,32,104,101,105,103,104,116,61,34,49,109,111,100,105,102,105,99,97,116,105,
+111,110,73,110,100,101,112,101,110,100,101,110,99,101,100,105,118,105,100,101,
+100,32,105,110,116,111,103,114,101,97,116,101,114,32,116,104,97,110,97,99,104,
+105,101,118,101,109,101,110,116,115,101,115,116,97,98,108,105,115,104,105,110,
+103,74,97,118,97,83,99,114,105,112,116,34,32,110,101,118,101,114,116,104,101,108
+,101,115,115,115,105,103,110,105,102,105,99,97,110,99,101,66,114,111,97,100,99,
+97,115,116,105,110,103,62,38,110,98,115,112,59,60,47,116,100,62,99,111,110,116,
+97,105,110,101,114,34,62,10,115,117,99,104,32,97,115,32,116,104,101,32,105,110,
+102,108,117,101,110,99,101,32,111,102,97,32,112,97,114,116,105,99,117,108,97,114
+,115,114,99,61,39,104,116,116,112,58,47,47,110,97,118,105,103,97,116,105,111,110
+,34,32,104,97,108,102,32,111,102,32,116,104,101,32,115,117,98,115,116,97,110,116
+,105,97,108,32,38,110,98,115,112,59,60,47,100,105,118,62,97,100,118,97,110,116,
+97,103,101,32,111,102,100,105,115,99,111,118,101,114,121,32,111,102,102,117,110,
+100,97,109,101,110,116,97,108,32,109,101,116,114,111,112,111,108,105,116,97,110,
+116,104,101,32,111,112,112,111,115,105,116,101,34,32,120,109,108,58,108,97,110,
+103,61,34,100,101,108,105,98,101,114,97,116,101,108,121,97,108,105,103,110,61,99
+,101,110,116,101,114,101,118,111,108,117,116,105,111,110,32,111,102,112,114,101,
+115,101,114,118,97,116,105,111,110,105,109,112,114,111,118,101,109,101,110,116,
+115,98,101,103,105,110,110,105,110,103,32,105,110,74,101,115,117,115,32,67,104,
+114,105,115,116,80,117,98,108,105,99,97,116,105,111,110,115,100,105,115,97,103,
+114,101,101,109,101,110,116,116,101,120,116,45,97,108,105,103,110,58,114,44,32,
+102,117,110,99,116,105,111,110,40,41,115,105,109,105,108,97,114,105,116,105,101,
+115,98,111,100,121,62,60,47,104,116,109,108,62,105,115,32,99,117,114,114,101,110
+,116,108,121,97,108,112,104,97,98,101,116,105,99,97,108,105,115,32,115,111,109,
+101,116,105,109,101,115,116,121,112,101,61,34,105,109,97,103,101,47,109,97,110,
+121,32,111,102,32,116,104,101,32,102,108,111,119,58,104,105,100,100,101,110,59,
+97,118,97,105,108,97,98,108,101,32,105,110,100,101,115,99,114,105,98,101,32,116,
+104,101,101,120,105,115,116,101,110,99,101,32,111,102,97,108,108,32,111,118,101,
+114,32,116,104,101,116,104,101,32,73,110,116,101,114,110,101,116,9,60,117,108,32
+,99,108,97,115,115,61,34,105,110,115,116,97,108,108,97,116,105,111,110,110,101,
+105,103,104,98,111,114,104,111,111,100,97,114,109,101,100,32,102,111,114,99,101,
+115,114,101,100,117,99,105,110,103,32,116,104,101,99,111,110,116,105,110,117,101
+,115,32,116,111,78,111,110,101,116,104,101,108,101,115,115,44,116,101,109,112,
+101,114,97,116,117,114,101,115,10,9,9,60,97,32,104,114,101,102,61,34,99,108,111,
+115,101,32,116,111,32,116,104,101,101,120,97,109,112,108,101,115,32,111,102,32,
+105,115,32,97,98,111,117,116,32,116,104,101,40,115,101,101,32,98,101,108,111,119
+,41,46,34,32,105,100,61,34,115,101,97,114,99,104,112,114,111,102,101,115,115,105
+,111,110,97,108,105,115,32,97,118,97,105,108,97,98,108,101,116,104,101,32,111,
+102,102,105,99,105,97,108,9,9,60,47,115,99,114,105,112,116,62,10,10,9,9,60,100,
+105,118,32,105,100,61,34,97,99,99,101,108,101,114,97,116,105,111,110,116,104,114
+,111,117,103,104,32,116,104,101,32,72,97,108,108,32,111,102,32,70,97,109,101,100
+,101,115,99,114,105,112,116,105,111,110,115,116,114,97,110,115,108,97,116,105,
+111,110,115,105,110,116,101,114,102,101,114,101,110,99,101,32,116,121,112,101,61
+,39,116,101,120,116,47,114,101,99,101,110,116,32,121,101,97,114,115,105,110,32,
+116,104,101,32,119,111,114,108,100,118,101,114,121,32,112,111,112,117,108,97,114
+,123,98,97,99,107,103,114,111,117,110,100,58,116,114,97,100,105,116,105,111,110,
+97,108,32,115,111,109,101,32,111,102,32,116,104,101,32,99,111,110,110,101,99,116
+,101,100,32,116,111,101,120,112,108,111,105,116,97,116,105,111,110,101,109,101,
+114,103,101,110,99,101,32,111,102,99,111,110,115,116,105,116,117,116,105,111,110
+,65,32,72,105,115,116,111,114,121,32,111,102,115,105,103,110,105,102,105,99,97,
+110,116,32,109,97,110,117,102,97,99,116,117,114,101,100,101,120,112,101,99,116,
+97,116,105,111,110,115,62,60,110,111,115,99,114,105,112,116,62,60,99,97,110,32,
+98,101,32,102,111,117,110,100,98,101,99,97,117,115,101,32,116,104,101,32,104,97,
+115,32,110,111,116,32,98,101,101,110,110,101,105,103,104,98,111,117,114,105,110,
+103,119,105,116,104,111,117,116,32,116,104,101,32,97,100,100,101,100,32,116,111,
+32,116,104,101,9,60,108,105,32,99,108,97,115,115,61,34,105,110,115,116,114,117,
+109,101,110,116,97,108,83,111,118,105,101,116,32,85,110,105,111,110,97,99,107,
+110,111,119,108,101,100,103,101,100,119,104,105,99,104,32,99,97,110,32,98,101,
+110,97,109,101,32,102,111,114,32,116,104,101,97,116,116,101,110,116,105,111,110,
+32,116,111,97,116,116,101,109,112,116,115,32,116,111,32,100,101,118,101,108,111,
+112,109,101,110,116,115,73,110,32,102,97,99,116,44,32,116,104,101,60,108,105,32,
+99,108,97,115,115,61,34,97,105,109,112,108,105,99,97,116,105,111,110,115,115,117
+,105,116,97,98,108,101,32,102,111,114,109,117,99,104,32,111,102,32,116,104,101,
+32,99,111,108,111,110,105,122,97,116,105,111,110,112,114,101,115,105,100,101,110
+,116,105,97,108,99,97,110,99,101,108,66,117,98,98,108,101,32,73,110,102,111,114,
+109,97,116,105,111,110,109,111,115,116,32,111,102,32,116,104,101,32,105,115,32,
+100,101,115,99,114,105,98,101,100,114,101,115,116,32,111,102,32,116,104,101,32,
+109,111,114,101,32,111,114,32,108,101,115,115,105,110,32,83,101,112,116,101,109,
+98,101,114,73,110,116,101,108,108,105,103,101,110,99,101,115,114,99,61,34,104,
+116,116,112,58,47,47,112,120,59,32,104,101,105,103,104,116,58,32,97,118,97,105,
+108,97,98,108,101,32,116,111,109,97,110,117,102,97,99,116,117,114,101,114,104,
+117,109,97,110,32,114,105,103,104,116,115,108,105,110,107,32,104,114,101,102,61,
+34,47,97,118,97,105,108,97,98,105,108,105,116,121,112,114,111,112,111,114,116,
+105,111,110,97,108,111,117,116,115,105,100,101,32,116,104,101,32,97,115,116,114,
+111,110,111,109,105,99,97,108,104,117,109,97,110,32,98,101,105,110,103,115,110,
+97,109,101,32,111,102,32,116,104,101,32,97,114,101,32,102,111,117,110,100,32,105
+,110,97,114,101,32,98,97,115,101,100,32,111,110,115,109,97,108,108,101,114,32,
+116,104,97,110,97,32,112,101,114,115,111,110,32,119,104,111,101,120,112,97,110,
+115,105,111,110,32,111,102,97,114,103,117,105,110,103,32,116,104,97,116,110,111,
+119,32,107,110,111,119,110,32,97,115,73,110,32,116,104,101,32,101,97,114,108,121
+,105,110,116,101,114,109,101,100,105,97,116,101,100,101,114,105,118,101,100,32,
+102,114,111,109,83,99,97,110,100,105,110,97,118,105,97,110,60,47,97,62,60,47,100
+,105,118,62,13,10,99,111,110,115,105,100,101,114,32,116,104,101,97,110,32,101,
+115,116,105,109,97,116,101,100,116,104,101,32,78,97,116,105,111,110,97,108,60,
+100,105,118,32,105,100,61,34,112,97,103,114,101,115,117,108,116,105,110,103,32,
+105,110,99,111,109,109,105,115,115,105,111,110,101,100,97,110,97,108,111,103,111
+,117,115,32,116,111,97,114,101,32,114,101,113,117,105,114,101,100,47,117,108,62,
+10,60,47,100,105,118,62,10,119,97,115,32,98,97,115,101,100,32,111,110,97,110,100
+,32,98,101,99,97,109,101,32,97,38,110,98,115,112,59,38,110,98,115,112,59,116,34,
+32,118,97,108,117,101,61,34,34,32,119,97,115,32,99,97,112,116,117,114,101,100,
+110,111,32,109,111,114,101,32,116,104,97,110,114,101,115,112,101,99,116,105,118,
+101,108,121,99,111,110,116,105,110,117,101,32,116,111,32,62,13,10,60,104,101,97,
+100,62,13,10,60,119,101,114,101,32,99,114,101,97,116,101,100,109,111,114,101,32,
+103,101,110,101,114,97,108,105,110,102,111,114,109,97,116,105,111,110,32,117,115
+,101,100,32,102,111,114,32,116,104,101,105,110,100,101,112,101,110,100,101,110,
+116,32,116,104,101,32,73,109,112,101,114,105,97,108,99,111,109,112,111,110,101,
+110,116,32,111,102,116,111,32,116,104,101,32,110,111,114,116,104,105,110,99,108,
+117,100,101,32,116,104,101,32,67,111,110,115,116,114,117,99,116,105,111,110,115,
+105,100,101,32,111,102,32,116,104,101,32,119,111,117,108,100,32,110,111,116,32,
+98,101,102,111,114,32,105,110,115,116,97,110,99,101,105,110,118,101,110,116,105,
+111,110,32,111,102,109,111,114,101,32,99,111,109,112,108,101,120,99,111,108,108,
+101,99,116,105,118,101,108,121,98,97,99,107,103,114,111,117,110,100,58,32,116,
+101,120,116,45,97,108,105,103,110,58,32,105,116,115,32,111,114,105,103,105,110,
+97,108,105,110,116,111,32,97,99,99,111,117,110,116,116,104,105,115,32,112,114,
+111,99,101,115,115,97,110,32,101,120,116,101,110,115,105,118,101,104,111,119,101
+,118,101,114,44,32,116,104,101,116,104,101,121,32,97,114,101,32,110,111,116,114,
+101,106,101,99,116,101,100,32,116,104,101,99,114,105,116,105,99,105,115,109,32,
+111,102,100,117,114,105,110,103,32,119,104,105,99,104,112,114,111,98,97,98,108,
+121,32,116,104,101,116,104,105,115,32,97,114,116,105,99,108,101,40,102,117,110,
+99,116,105,111,110,40,41,123,73,116,32,115,104,111,117,108,100,32,98,101,97,110,
+32,97,103,114,101,101,109,101,110,116,97,99,99,105,100,101,110,116,97,108,108,
+121,100,105,102,102,101,114,115,32,102,114,111,109,65,114,99,104,105,116,101,99,
+116,117,114,101,98,101,116,116,101,114,32,107,110,111,119,110,97,114,114,97,110,
+103,101,109,101,110,116,115,105,110,102,108,117,101,110,99,101,32,111,110,97,116
+,116,101,110,100,101,100,32,116,104,101,105,100,101,110,116,105,99,97,108,32,116
+,111,115,111,117,116,104,32,111,102,32,116,104,101,112,97,115,115,32,116,104,114
+,111,117,103,104,120,109,108,34,32,116,105,116,108,101,61,34,119,101,105,103,104
+,116,58,98,111,108,100,59,99,114,101,97,116,105,110,103,32,116,104,101,100,105,
+115,112,108,97,121,58,110,111,110,101,114,101,112,108,97,99,101,100,32,116,104,
+101,60,105,109,103,32,115,114,99,61,34,47,105,104,116,116,112,115,58,47,47,119,
+119,119,46,87,111,114,108,100,32,87,97,114,32,73,73,116,101,115,116,105,109,111,
+110,105,97,108,115,102,111,117,110,100,32,105,110,32,116,104,101,114,101,113,117
+,105,114,101,100,32,116,111,32,97,110,100,32,116,104,97,116,32,116,104,101,98,
+101,116,119,101,101,110,32,116,104,101,32,119,97,115,32,100,101,115,105,103,110,
+101,100,99,111,110,115,105,115,116,115,32,111,102,32,99,111,110,115,105,100,101,
+114,97,98,108,121,112,117,98,108,105,115,104,101,100,32,98,121,116,104,101,32,
+108,97,110,103,117,97,103,101,67,111,110,115,101,114,118,97,116,105,111,110,99,
+111,110,115,105,115,116,101,100,32,111,102,114,101,102,101,114,32,116,111,32,116
+,104,101,98,97,99,107,32,116,111,32,116,104,101,32,99,115,115,34,32,109,101,100,
+105,97,61,34,80,101,111,112,108,101,32,102,114,111,109,32,97,118,97,105,108,97,
+98,108,101,32,111,110,112,114,111,118,101,100,32,116,111,32,98,101,115,117,103,
+103,101,115,116,105,111,110,115,34,119,97,115,32,107,110,111,119,110,32,97,115,
+118,97,114,105,101,116,105,101,115,32,111,102,108,105,107,101,108,121,32,116,111
+,32,98,101,99,111,109,112,114,105,115,101,100,32,111,102,115,117,112,112,111,114
+,116,32,116,104,101,32,104,97,110,100,115,32,111,102,32,116,104,101,99,111,117,
+112,108,101,100,32,119,105,116,104,99,111,110,110,101,99,116,32,97,110,100,32,98
+,111,114,100,101,114,58,110,111,110,101,59,112,101,114,102,111,114,109,97,110,99
+,101,115,98,101,102,111,114,101,32,98,101,105,110,103,108,97,116,101,114,32,98,
+101,99,97,109,101,99,97,108,99,117,108,97,116,105,111,110,115,111,102,116,101,
+110,32,99,97,108,108,101,100,114,101,115,105,100,101,110,116,115,32,111,102,109,
+101,97,110,105,110,103,32,116,104,97,116,62,60,108,105,32,99,108,97,115,115,61,
+34,101,118,105,100,101,110,99,101,32,102,111,114,101,120,112,108,97,110,97,116,
+105,111,110,115,101,110,118,105,114,111,110,109,101,110,116,115,34,62,60,47,97,
+62,60,47,100,105,118,62,119,104,105,99,104,32,97,108,108,111,119,115,73,110,116,
+114,111,100,117,99,116,105,111,110,100,101,118,101,108,111,112,101,100,32,98,121
+,97,32,119,105,100,101,32,114,97,110,103,101,111,110,32,98,101,104,97,108,102,32
+,111,102,118,97,108,105,103,110,61,34,116,111,112,34,112,114,105,110,99,105,112,
+108,101,32,111,102,97,116,32,116,104,101,32,116,105,109,101,44,60,47,110,111,115
+,99,114,105,112,116,62,13,115,97,105,100,32,116,111,32,104,97,118,101,105,110,32
+,116,104,101,32,102,105,114,115,116,119,104,105,108,101,32,111,116,104,101,114,
+115,104,121,112,111,116,104,101,116,105,99,97,108,112,104,105,108,111,115,111,
+112,104,101,114,115,112,111,119,101,114,32,111,102,32,116,104,101,99,111,110,116
+,97,105,110,101,100,32,105,110,112,101,114,102,111,114,109,101,100,32,98,121,105
+,110,97,98,105,108,105,116,121,32,116,111,119,101,114,101,32,119,114,105,116,116
+,101,110,115,112,97,110,32,115,116,121,108,101,61,34,105,110,112,117,116,32,110,
+97,109,101,61,34,116,104,101,32,113,117,101,115,116,105,111,110,105,110,116,101,
+110,100,101,100,32,102,111,114,114,101,106,101,99,116,105,111,110,32,111,102,105
+,109,112,108,105,101,115,32,116,104,97,116,105,110,118,101,110,116,101,100,32,
+116,104,101,116,104,101,32,115,116,97,110,100,97,114,100,119,97,115,32,112,114,
+111,98,97,98,108,121,108,105,110,107,32,98,101,116,119,101,101,110,112,114,111,
+102,101,115,115,111,114,32,111,102,105,110,116,101,114,97,99,116,105,111,110,115
+,99,104,97,110,103,105,110,103,32,116,104,101,73,110,100,105,97,110,32,79,99,101
+,97,110,32,99,108,97,115,115,61,34,108,97,115,116,119,111,114,107,105,110,103,32
+,119,105,116,104,39,104,116,116,112,58,47,47,119,119,119,46,121,101,97,114,115,
+32,98,101,102,111,114,101,84,104,105,115,32,119,97,115,32,116,104,101,114,101,99
+,114,101,97,116,105,111,110,97,108,101,110,116,101,114,105,110,103,32,116,104,
+101,109,101,97,115,117,114,101,109,101,110,116,115,97,110,32,101,120,116,114,101
+,109,101,108,121,118,97,108,117,101,32,111,102,32,116,104,101,115,116,97,114,116
+,32,111,102,32,116,104,101,10,60,47,115,99,114,105,112,116,62,10,10,97,110,32,
+101,102,102,111,114,116,32,116,111,105,110,99,114,101,97,115,101,32,116,104,101,
+116,111,32,116,104,101,32,115,111,117,116,104,115,112,97,99,105,110,103,61,34,48
+,34,62,115,117,102,102,105,99,105,101,110,116,108,121,116,104,101,32,69,117,114,
+111,112,101,97,110,99,111,110,118,101,114,116,101,100,32,116,111,99,108,101,97,
+114,84,105,109,101,111,117,116,100,105,100,32,110,111,116,32,104,97,118,101,99,
+111,110,115,101,113,117,101,110,116,108,121,102,111,114,32,116,104,101,32,110,
+101,120,116,101,120,116,101,110,115,105,111,110,32,111,102,101,99,111,110,111,
+109,105,99,32,97,110,100,97,108,116,104,111,117,103,104,32,116,104,101,97,114,
+101,32,112,114,111,100,117,99,101,100,97,110,100,32,119,105,116,104,32,116,104,
+101,105,110,115,117,102,102,105,99,105,101,110,116,103,105,118,101,110,32,98,121
+,32,116,104,101,115,116,97,116,105,110,103,32,116,104,97,116,101,120,112,101,110
+,100,105,116,117,114,101,115,60,47,115,112,97,110,62,60,47,97,62,10,116,104,111,
+117,103,104,116,32,116,104,97,116,111,110,32,116,104,101,32,98,97,115,105,115,99
+,101,108,108,112,97,100,100,105,110,103,61,105,109,97,103,101,32,111,102,32,116,
+104,101,114,101,116,117,114,110,105,110,103,32,116,111,105,110,102,111,114,109,
+97,116,105,111,110,44,115,101,112,97,114,97,116,101,100,32,98,121,97,115,115,97,
+115,115,105,110,97,116,101,100,115,34,32,99,111,110,116,101,110,116,61,34,97,117
+,116,104,111,114,105,116,121,32,111,102,110,111,114,116,104,119,101,115,116,101,
+114,110,60,47,100,105,118,62,10,60,100,105,118,32,34,62,60,47,100,105,118,62,13,
+10,32,32,99,111,110,115,117,108,116,97,116,105,111,110,99,111,109,109,117,110,
+105,116,121,32,111,102,116,104,101,32,110,97,116,105,111,110,97,108,105,116,32,
+115,104,111,117,108,100,32,98,101,112,97,114,116,105,99,105,112,97,110,116,115,
+32,97,108,105,103,110,61,34,108,101,102,116,116,104,101,32,103,114,101,97,116,
+101,115,116,115,101,108,101,99,116,105,111,110,32,111,102,115,117,112,101,114,
+110,97,116,117,114,97,108,100,101,112,101,110,100,101,110,116,32,111,110,105,115
+,32,109,101,110,116,105,111,110,101,100,97,108,108,111,119,105,110,103,32,116,
+104,101,119,97,115,32,105,110,118,101,110,116,101,100,97,99,99,111,109,112,97,
+110,121,105,110,103,104,105,115,32,112,101,114,115,111,110,97,108,97,118,97,105,
+108,97,98,108,101,32,97,116,115,116,117,100,121,32,111,102,32,116,104,101,111,
+110,32,116,104,101,32,111,116,104,101,114,101,120,101,99,117,116,105,111,110,32,
+111,102,72,117,109,97,110,32,82,105,103,104,116,115,116,101,114,109,115,32,111,
+102,32,116,104,101,97,115,115,111,99,105,97,116,105,111,110,115,114,101,115,101,
+97,114,99,104,32,97,110,100,115,117,99,99,101,101,100,101,100,32,98,121,100,101,
+102,101,97,116,101,100,32,116,104,101,97,110,100,32,102,114,111,109,32,116,104,
+101,98,117,116,32,116,104,101,121,32,97,114,101,99,111,109,109,97,110,100,101,
+114,32,111,102,115,116,97,116,101,32,111,102,32,116,104,101,121,101,97,114,115,
+32,111,102,32,97,103,101,116,104,101,32,115,116,117,100,121,32,111,102,60,117,
+108,32,99,108,97,115,115,61,34,115,112,108,97,99,101,32,105,110,32,116,104,101,
+119,104,101,114,101,32,104,101,32,119,97,115,60,108,105,32,99,108,97,115,115,61,
+34,102,116,104,101,114,101,32,97,114,101,32,110,111,119,104,105,99,104,32,98,101
+,99,97,109,101,104,101,32,112,117,98,108,105,115,104,101,100,101,120,112,114,101
+,115,115,101,100,32,105,110,116,111,32,119,104,105,99,104,32,116,104,101,99,111,
+109,109,105,115,115,105,111,110,101,114,102,111,110,116,45,119,101,105,103,104,
+116,58,116,101,114,114,105,116,111,114,121,32,111,102,101,120,116,101,110,115,
+105,111,110,115,34,62,82,111,109,97,110,32,69,109,112,105,114,101,101,113,117,97
+,108,32,116,111,32,116,104,101,73,110,32,99,111,110,116,114,97,115,116,44,104,
+111,119,101,118,101,114,44,32,97,110,100,105,115,32,116,121,112,105,99,97,108,
+108,121,97,110,100,32,104,105,115,32,119,105,102,101,40,97,108,115,111,32,99,97,
+108,108,101,100,62,60,117,108,32,99,108,97,115,115,61,34,101,102,102,101,99,116,
+105,118,101,108,121,32,101,118,111,108,118,101,100,32,105,110,116,111,115,101,
+101,109,32,116,111,32,104,97,118,101,119,104,105,99,104,32,105,115,32,116,104,
+101,116,104,101,114,101,32,119,97,115,32,110,111,97,110,32,101,120,99,101,108,
+108,101,110,116,97,108,108,32,111,102,32,116,104,101,115,101,100,101,115,99,114,
+105,98,101,100,32,98,121,73,110,32,112,114,97,99,116,105,99,101,44,98,114,111,97
+,100,99,97,115,116,105,110,103,99,104,97,114,103,101,100,32,119,105,116,104,114,
+101,102,108,101,99,116,101,100,32,105,110,115,117,98,106,101,99,116,101,100,32,
+116,111,109,105,108,105,116,97,114,121,32,97,110,100,116,111,32,116,104,101,32,
+112,111,105,110,116,101,99,111,110,111,109,105,99,97,108,108,121,115,101,116,84,
+97,114,103,101,116,105,110,103,97,114,101,32,97,99,116,117,97,108,108,121,118,
+105,99,116,111,114,121,32,111,118,101,114,40,41,59,60,47,115,99,114,105,112,116,
+62,99,111,110,116,105,110,117,111,117,115,108,121,114,101,113,117,105,114,101,
+100,32,102,111,114,101,118,111,108,117,116,105,111,110,97,114,121,97,110,32,101,
+102,102,101,99,116,105,118,101,110,111,114,116,104,32,111,102,32,116,104,101,44,
+32,119,104,105,99,104,32,119,97,115,32,102,114,111,110,116,32,111,102,32,116,104
+,101,111,114,32,111,116,104,101,114,119,105,115,101,115,111,109,101,32,102,111,
+114,109,32,111,102,104,97,100,32,110,111,116,32,98,101,101,110,103,101,110,101,
+114,97,116,101,100,32,98,121,105,110,102,111,114,109,97,116,105,111,110,46,112,
+101,114,109,105,116,116,101,100,32,116,111,105,110,99,108,117,100,101,115,32,116
+,104,101,100,101,118,101,108,111,112,109,101,110,116,44,101,110,116,101,114,101,
+100,32,105,110,116,111,116,104,101,32,112,114,101,118,105,111,117,115,99,111,110
+,115,105,115,116,101,110,116,108,121,97,114,101,32,107,110,111,119,110,32,97,115
+,116,104,101,32,102,105,101,108,100,32,111,102,116,104,105,115,32,116,121,112,
+101,32,111,102,103,105,118,101,110,32,116,111,32,116,104,101,116,104,101,32,116,
+105,116,108,101,32,111,102,99,111,110,116,97,105,110,115,32,116,104,101,105,110,
+115,116,97,110,99,101,115,32,111,102,105,110,32,116,104,101,32,110,111,114,116,
+104,100,117,101,32,116,111,32,116,104,101,105,114,97,114,101,32,100,101,115,105,
+103,110,101,100,99,111,114,112,111,114,97,116,105,111,110,115,119,97,115,32,116,
+104,97,116,32,116,104,101,111,110,101,32,111,102,32,116,104,101,115,101,109,111,
+114,101,32,112,111,112,117,108,97,114,115,117,99,99,101,101,100,101,100,32,105,
+110,115,117,112,112,111,114,116,32,102,114,111,109,105,110,32,100,105,102,102,
+101,114,101,110,116,100,111,109,105,110,97,116,101,100,32,98,121,100,101,115,105
+,103,110,101,100,32,102,111,114,111,119,110,101,114,115,104,105,112,32,111,102,
+97,110,100,32,112,111,115,115,105,98,108,121,115,116,97,110,100,97,114,100,105,
+122,101,100,114,101,115,112,111,110,115,101,84,101,120,116,119,97,115,32,105,110
+,116,101,110,100,101,100,114,101,99,101,105,118,101,100,32,116,104,101,97,115,
+115,117,109,101,100,32,116,104,97,116,97,114,101,97,115,32,111,102,32,116,104,
+101,112,114,105,109,97,114,105,108,121,32,105,110,116,104,101,32,98,97,115,105,
+115,32,111,102,105,110,32,116,104,101,32,115,101,110,115,101,97,99,99,111,117,
+110,116,115,32,102,111,114,100,101,115,116,114,111,121,101,100,32,98,121,97,116,
+32,108,101,97,115,116,32,116,119,111,119,97,115,32,100,101,99,108,97,114,101,100
+,99,111,117,108,100,32,110,111,116,32,98,101,83,101,99,114,101,116,97,114,121,32
+,111,102,97,112,112,101,97,114,32,116,111,32,98,101,109,97,114,103,105,110,45,
+116,111,112,58,49,47,94,92,115,43,124,92,115,43,36,47,103,101,41,123,116,104,114
+,111,119,32,101,125,59,116,104,101,32,115,116,97,114,116,32,111,102,116,119,111,
+32,115,101,112,97,114,97,116,101,108,97,110,103,117,97,103,101,32,97,110,100,119
+,104,111,32,104,97,100,32,98,101,101,110,111,112,101,114,97,116,105,111,110,32,
+111,102,100,101,97,116,104,32,111,102,32,116,104,101,114,101,97,108,32,110,117,
+109,98,101,114,115,9,60,108,105,110,107,32,114,101,108,61,34,112,114,111,118,105
+,100,101,100,32,116,104,101,116,104,101,32,115,116,111,114,121,32,111,102,99,111
+,109,112,101,116,105,116,105,111,110,115,101,110,103,108,105,115,104,32,40,85,75
+,41,101,110,103,108,105,115,104,32,40,85,83,41,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,132,
+105,110,102,111,114,109,97,99,105,195,179,110,104,101,114,114,97,109,105,101,110
+,116,97,115,101,108,101,99,116,114,195,179,110,105,99,111,100,101,115,99,114,105
+,112,99,105,195,179,110,99,108,97,115,105,102,105,99,97,100,111,115,99,111,110,
+111,99,105,109,105,101,110,116,111,112,117,98,108,105,99,97,99,105,195,179,110,
+114,101,108,97,99,105,111,110,97,100,97,115,105,110,102,111,114,109,195,161,116,
+105,99,97,114,101,108,97,99,105,111,110,97,100,111,115,100,101,112,97,114,116,97
+,109,101,110,116,111,116,114,97,98,97,106,97,100,111,114,101,115,100,105,114,101
+,99,116,97,109,101,110,116,101,97,121,117,110,116,97,109,105,101,110,116,111,109
+,101,114,99,97,100,111,76,105,98,114,101,99,111,110,116,195,161,99,116,101,110,
+111,115,104,97,98,105,116,97,99,105,111,110,101,115,99,117,109,112,108,105,109,
+105,101,110,116,111,114,101,115,116,97,117,114,97,110,116,101,115,100,105,115,
+112,111,115,105,99,105,195,179,110,99,111,110,115,101,99,117,101,110,99,105,97,
+101,108,101,99,116,114,195,179,110,105,99,97,97,112,108,105,99,97,99,105,111,110
+,101,115,100,101,115,99,111,110,101,99,116,97,100,111,105,110,115,116,97,108,97,
+99,105,195,179,110,114,101,97,108,105,122,97,99,105,195,179,110,117,116,105,108,
+105,122,97,99,105,195,179,110,101,110,99,105,99,108,111,112,101,100,105,97,101,
+110,102,101,114,109,101,100,97,100,101,115,105,110,115,116,114,117,109,101,110,
+116,111,115,101,120,112,101,114,105,101,110,99,105,97,115,105,110,115,116,105,
+116,117,99,105,195,179,110,112,97,114,116,105,99,117,108,97,114,101,115,115,117,
+98,99,97,116,101,103,111,114,105,97,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,133,101,110,116,101,114,116,97,105,110,109,101,
+110,116,117,110,100,101,114,115,116,97,110,100,105,110,103,32,61,32,102,117,110,
+99,116,105,111,110,40,41,46,106,112,103,34,32,119,105,100,116,104,61,34,99,111,
+110,102,105,103,117,114,97,116,105,111,110,46,112,110,103,34,32,119,105,100,116,
+104,61,34,60,98,111,100,121,32,99,108,97,115,115,61,34,77,97,116,104,46,114,97,
+110,100,111,109,40,41,99,111,110,116,101,109,112,111,114,97,114,121,32,85,110,
+105,116,101,100,32,83,116,97,116,101,115,99,105,114,99,117,109,115,116,97,110,99
+,101,115,46,97,112,112,101,110,100,67,104,105,108,100,40,111,114,103,97,110,105,
+122,97,116,105,111,110,115,60,115,112,97,110,32,99,108,97,115,115,61,34,34,62,60
+,105,109,103,32,115,114,99,61,34,47,100,105,115,116,105,110,103,117,105,115,104,
+101,100,116,104,111,117,115,97,110,100,115,32,111,102,32,99,111,109,109,117,110,
+105,99,97,116,105,111,110,99,108,101,97,114,34,62,60,47,100,105,118,62,105,110,
+118,101,115,116,105,103,97,116,105,111,110,102,97,118,105,99,111,110,46,105,99,
+111,34,32,109,97,114,103,105,110,45,114,105,103,104,116,58,98,97,115,101,100,32,
+111,110,32,116,104,101,32,77,97,115,115,97,99,104,117,115,101,116,116,115,116,97
+,98,108,101,32,98,111,114,100,101,114,61,105,110,116,101,114,110,97,116,105,111,
+110,97,108,97,108,115,111,32,107,110,111,119,110,32,97,115,112,114,111,110,117,
+110,99,105,97,116,105,111,110,98,97,99,107,103,114,111,117,110,100,58,35,102,112
+,97,100,100,105,110,103,45,108,101,102,116,58,70,111,114,32,101,120,97,109,112,
+108,101,44,32,109,105,115,99,101,108,108,97,110,101,111,117,115,38,108,116,59,47
+,109,97,116,104,38,103,116,59,112,115,121,99,104,111,108,111,103,105,99,97,108,
+105,110,32,112,97,114,116,105,99,117,108,97,114,101,97,114,99,104,34,32,116,121,
+112,101,61,34,102,111,114,109,32,109,101,116,104,111,100,61,34,97,115,32,111,112
+,112,111,115,101,100,32,116,111,83,117,112,114,101,109,101,32,67,111,117,114,116
+,111,99,99,97,115,105,111,110,97,108,108,121,32,65,100,100,105,116,105,111,110,
+97,108,108,121,44,78,111,114,116,104,32,65,109,101,114,105,99,97,112,120,59,98,
+97,99,107,103,114,111,117,110,100,111,112,112,111,114,116,117,110,105,116,105,
+101,115,69,110,116,101,114,116,97,105,110,109,101,110,116,46,116,111,76,111,119,
+101,114,67,97,115,101,40,109,97,110,117,102,97,99,116,117,114,105,110,103,112,
+114,111,102,101,115,115,105,111,110,97,108,32,99,111,109,98,105,110,101,100,32,
+119,105,116,104,70,111,114,32,105,110,115,116,97,110,99,101,44,99,111,110,115,
+105,115,116,105,110,103,32,111,102,34,32,109,97,120,108,101,110,103,116,104,61,
+34,114,101,116,117,114,110,32,102,97,108,115,101,59,99,111,110,115,99,105,111,
+117,115,110,101,115,115,77,101,100,105,116,101,114,114,97,110,101,97,110,101,120
+,116,114,97,111,114,100,105,110,97,114,121,97,115,115,97,115,115,105,110,97,116,
+105,111,110,115,117,98,115,101,113,117,101,110,116,108,121,32,98,117,116,116,111
+,110,32,116,121,112,101,61,34,116,104,101,32,110,117,109,98,101,114,32,111,102,
+116,104,101,32,111,114,105,103,105,110,97,108,32,99,111,109,112,114,101,104,101,
+110,115,105,118,101,114,101,102,101,114,115,32,116,111,32,116,104,101,60,47,117,
+108,62,10,60,47,100,105,118,62,10,112,104,105,108,111,115,111,112,104,105,99,97,
+108,108,111,99,97,116,105,111,110,46,104,114,101,102,119,97,115,32,112,117,98,
+108,105,115,104,101,100,83,97,110,32,70,114,97,110,99,105,115,99,111,40,102,117,
+110,99,116,105,111,110,40,41,123,10,60,100,105,118,32,105,100,61,34,109,97,105,
+110,115,111,112,104,105,115,116,105,99,97,116,101,100,109,97,116,104,101,109,97,
+116,105,99,97,108,32,47,104,101,97,100,62,13,10,60,98,111,100,121,115,117,103,
+103,101,115,116,115,32,116,104,97,116,100,111,99,117,109,101,110,116,97,116,105,
+111,110,99,111,110,99,101,110,116,114,97,116,105,111,110,114,101,108,97,116,105,
+111,110,115,104,105,112,115,109,97,121,32,104,97,118,101,32,98,101,101,110,40,
+102,111,114,32,101,120,97,109,112,108,101,44,84,104,105,115,32,97,114,116,105,99
+,108,101,32,105,110,32,115,111,109,101,32,99,97,115,101,115,112,97,114,116,115,
+32,111,102,32,116,104,101,32,100,101,102,105,110,105,116,105,111,110,32,111,102,
+71,114,101,97,116,32,66,114,105,116,97,105,110,32,99,101,108,108,112,97,100,100,
+105,110,103,61,101,113,117,105,118,97,108,101,110,116,32,116,111,112,108,97,99,
+101,104,111,108,100,101,114,61,34,59,32,102,111,110,116,45,115,105,122,101,58,32
+,106,117,115,116,105,102,105,99,97,116,105,111,110,98,101,108,105,101,118,101,
+100,32,116,104,97,116,115,117,102,102,101,114,101,100,32,102,114,111,109,97,116,
+116,101,109,112,116,101,100,32,116,111,32,108,101,97,100,101,114,32,111,102,32,
+116,104,101,99,114,105,112,116,34,32,115,114,99,61,34,47,40,102,117,110,99,116,
+105,111,110,40,41,32,123,97,114,101,32,97,118,97,105,108,97,98,108,101,10,9,60,
+108,105,110,107,32,114,101,108,61,34,32,115,114,99,61,39,104,116,116,112,58,47,
+47,105,110,116,101,114,101,115,116,101,100,32,105,110,99,111,110,118,101,110,116
+,105,111,110,97,108,32,34,32,97,108,116,61,34,34,32,47,62,60,47,97,114,101,32,
+103,101,110,101,114,97,108,108,121,104,97,115,32,97,108,115,111,32,98,101,101,
+110,109,111,115,116,32,112,111,112,117,108,97,114,32,99,111,114,114,101,115,112,
+111,110,100,105,110,103,99,114,101,100,105,116,101,100,32,119,105,116,104,116,
+121,108,101,61,34,98,111,114,100,101,114,58,60,47,97,62,60,47,115,112,97,110,62,
+60,47,46,103,105,102,34,32,119,105,100,116,104,61,34,60,105,102,114,97,109,101,
+32,115,114,99,61,34,116,97,98,108,101,32,99,108,97,115,115,61,34,105,110,108,105
+,110,101,45,98,108,111,99,107,59,97,99,99,111,114,100,105,110,103,32,116,111,32,
+116,111,103,101,116,104,101,114,32,119,105,116,104,97,112,112,114,111,120,105,
+109,97,116,101,108,121,112,97,114,108,105,97,109,101,110,116,97,114,121,109,111,
+114,101,32,97,110,100,32,109,111,114,101,100,105,115,112,108,97,121,58,110,111,
+110,101,59,116,114,97,100,105,116,105,111,110,97,108,108,121,112,114,101,100,111
+,109,105,110,97,110,116,108,121,38,110,98,115,112,59,124,38,110,98,115,112,59,38
+,110,98,115,112,59,60,47,115,112,97,110,62,32,99,101,108,108,115,112,97,99,105,
+110,103,61,60,105,110,112,117,116,32,110,97,109,101,61,34,111,114,34,32,99,111,
+110,116,101,110,116,61,34,99,111,110,116,114,111,118,101,114,115,105,97,108,112,
+114,111,112,101,114,116,121,61,34,111,103,58,47,120,45,115,104,111,99,107,119,97
+,118,101,45,100,101,109,111,110,115,116,114,97,116,105,111,110,115,117,114,114,
+111,117,110,100,101,100,32,98,121,78,101,118,101,114,116,104,101,108,101,115,115
+,44,119,97,115,32,116,104,101,32,102,105,114,115,116,99,111,110,115,105,100,101,
+114,97,98,108,101,32,65,108,116,104,111,117,103,104,32,116,104,101,32,99,111,108
+,108,97,98,111,114,97,116,105,111,110,115,104,111,117,108,100,32,110,111,116,32,
+98,101,112,114,111,112,111,114,116,105,111,110,32,111,102,60,115,112,97,110,32,
+115,116,121,108,101,61,34,107,110,111,119,110,32,97,115,32,116,104,101,32,115,
+104,111,114,116,108,121,32,97,102,116,101,114,102,111,114,32,105,110,115,116,97,
+110,99,101,44,100,101,115,99,114,105,98,101,100,32,97,115,32,47,104,101,97,100,
+62,10,60,98,111,100,121,32,115,116,97,114,116,105,110,103,32,119,105,116,104,105
+,110,99,114,101,97,115,105,110,103,108,121,32,116,104,101,32,102,97,99,116,32,
+116,104,97,116,100,105,115,99,117,115,115,105,111,110,32,111,102,109,105,100,100
+,108,101,32,111,102,32,116,104,101,97,110,32,105,110,100,105,118,105,100,117,97,
+108,100,105,102,102,105,99,117,108,116,32,116,111,32,112,111,105,110,116,32,111,
+102,32,118,105,101,119,104,111,109,111,115,101,120,117,97,108,105,116,121,97,99,
+99,101,112,116,97,110,99,101,32,111,102,60,47,115,112,97,110,62,60,47,100,105,
+118,62,109,97,110,117,102,97,99,116,117,114,101,114,115,111,114,105,103,105,110,
+32,111,102,32,116,104,101,99,111,109,109,111,110,108,121,32,117,115,101,100,105,
+109,112,111,114,116,97,110,99,101,32,111,102,100,101,110,111,109,105,110,97,116,
+105,111,110,115,98,97,99,107,103,114,111,117,110,100,58,32,35,108,101,110,103,
+116,104,32,111,102,32,116,104,101,100,101,116,101,114,109,105,110,97,116,105,111
+,110,97,32,115,105,103,110,105,102,105,99,97,110,116,34,32,98,111,114,100,101,
+114,61,34,48,34,62,114,101,118,111,108,117,116,105,111,110,97,114,121,112,114,
+105,110,99,105,112,108,101,115,32,111,102,105,115,32,99,111,110,115,105,100,101,
+114,101,100,119,97,115,32,100,101,118,101,108,111,112,101,100,73,110,100,111,45,
+69,117,114,111,112,101,97,110,118,117,108,110,101,114,97,98,108,101,32,116,111,
+112,114,111,112,111,110,101,110,116,115,32,111,102,97,114,101,32,115,111,109,101
+,116,105,109,101,115,99,108,111,115,101,114,32,116,111,32,116,104,101,78,101,119
+,32,89,111,114,107,32,67,105,116,121,32,110,97,109,101,61,34,115,101,97,114,99,
+104,97,116,116,114,105,98,117,116,101,100,32,116,111,99,111,117,114,115,101,32,
+111,102,32,116,104,101,109,97,116,104,101,109,97,116,105,99,105,97,110,98,121,32
+,116,104,101,32,101,110,100,32,111,102,97,116,32,116,104,101,32,101,110,100,32,
+111,102,34,32,98,111,114,100,101,114,61,34,48,34,32,116,101,99,104,110,111,108,
+111,103,105,99,97,108,46,114,101,109,111,118,101,67,108,97,115,115,40,98,114,97,
+110,99,104,32,111,102,32,116,104,101,101,118,105,100,101,110,99,101,32,116,104,
+97,116,33,91,101,110,100,105,102,93,45,45,62,13,10,73,110,115,116,105,116,117,
+116,101,32,111,102,32,105,110,116,111,32,97,32,115,105,110,103,108,101,114,101,
+115,112,101,99,116,105,118,101,108,121,46,97,110,100,32,116,104,101,114,101,102,
+111,114,101,112,114,111,112,101,114,116,105,101,115,32,111,102,105,115,32,108,
+111,99,97,116,101,100,32,105,110,115,111,109,101,32,111,102,32,119,104,105,99,
+104,84,104,101,114,101,32,105,115,32,97,108,115,111,99,111,110,116,105,110,117,
+101,100,32,116,111,32,97,112,112,101,97,114,97,110,99,101,32,111,102,32,38,97,
+109,112,59,110,100,97,115,104,59,32,100,101,115,99,114,105,98,101,115,32,116,104
+,101,99,111,110,115,105,100,101,114,97,116,105,111,110,97,117,116,104,111,114,32
+,111,102,32,116,104,101,105,110,100,101,112,101,110,100,101,110,116,108,121,101,
+113,117,105,112,112,101,100,32,119,105,116,104,100,111,101,115,32,110,111,116,32
+,104,97,118,101,60,47,97,62,60,97,32,104,114,101,102,61,34,99,111,110,102,117,
+115,101,100,32,119,105,116,104,60,108,105,110,107,32,104,114,101,102,61,34,47,97
+,116,32,116,104,101,32,97,103,101,32,111,102,97,112,112,101,97,114,32,105,110,32
+,116,104,101,84,104,101,115,101,32,105,110,99,108,117,100,101,114,101,103,97,114
+,100,108,101,115,115,32,111,102,99,111,117,108,100,32,98,101,32,117,115,101,100,
+32,115,116,121,108,101,61,38,113,117,111,116,59,115,101,118,101,114,97,108,32,
+116,105,109,101,115,114,101,112,114,101,115,101,110,116,32,116,104,101,98,111,
+100,121,62,10,60,47,104,116,109,108,62,116,104,111,117,103,104,116,32,116,111,32
+,98,101,112,111,112,117,108,97,116,105,111,110,32,111,102,112,111,115,115,105,98
+,105,108,105,116,105,101,115,112,101,114,99,101,110,116,97,103,101,32,111,102,97
+,99,99,101,115,115,32,116,111,32,116,104,101,97,110,32,97,116,116,101,109,112,
+116,32,116,111,112,114,111,100,117,99,116,105,111,110,32,111,102,106,113,117,101
+,114,121,47,106,113,117,101,114,121,116,119,111,32,100,105,102,102,101,114,101,
+110,116,98,101,108,111,110,103,32,116,111,32,116,104,101,101,115,116,97,98,108,
+105,115,104,109,101,110,116,114,101,112,108,97,99,105,110,103,32,116,104,101,100
+,101,115,99,114,105,112,116,105,111,110,34,32,100,101,116,101,114,109,105,110,
+101,32,116,104,101,97,118,97,105,108,97,98,108,101,32,102,111,114,65,99,99,111,
+114,100,105,110,103,32,116,111,32,119,105,100,101,32,114,97,110,103,101,32,111,
+102,9,60,100,105,118,32,99,108,97,115,115,61,34,109,111,114,101,32,99,111,109,
+109,111,110,108,121,111,114,103,97,110,105,115,97,116,105,111,110,115,102,117,
+110,99,116,105,111,110,97,108,105,116,121,119,97,115,32,99,111,109,112,108,101,
+116,101,100,32,38,97,109,112,59,109,100,97,115,104,59,32,112,97,114,116,105,99,
+105,112,97,116,105,111,110,116,104,101,32,99,104,97,114,97,99,116,101,114,97,110
+,32,97,100,100,105,116,105,111,110,97,108,97,112,112,101,97,114,115,32,116,111,
+32,98,101,102,97,99,116,32,116,104,97,116,32,116,104,101,97,110,32,101,120,97,
+109,112,108,101,32,111,102,115,105,103,110,105,102,105,99,97,110,116,108,121,111
+,110,109,111,117,115,101,111,118,101,114,61,34,98,101,99,97,117,115,101,32,116,
+104,101,121,32,97,115,121,110,99,32,61,32,116,114,117,101,59,112,114,111,98,108,
+101,109,115,32,119,105,116,104,115,101,101,109,115,32,116,111,32,104,97,118,101,
+116,104,101,32,114,101,115,117,108,116,32,111,102,32,115,114,99,61,34,104,116,
+116,112,58,47,47,102,97,109,105,108,105,97,114,32,119,105,116,104,112,111,115,
+115,101,115,115,105,111,110,32,111,102,102,117,110,99,116,105,111,110,32,40,41,
+32,123,116,111,111,107,32,112,108,97,99,101,32,105,110,97,110,100,32,115,111,109
+,101,116,105,109,101,115,115,117,98,115,116,97,110,116,105,97,108,108,121,60,115
+,112,97,110,62,60,47,115,112,97,110,62,105,115,32,111,102,116,101,110,32,117,115
+,101,100,105,110,32,97,110,32,97,116,116,101,109,112,116,103,114,101,97,116,32,
+100,101,97,108,32,111,102,69,110,118,105,114,111,110,109,101,110,116,97,108,115,
+117,99,99,101,115,115,102,117,108,108,121,32,118,105,114,116,117,97,108,108,121,
+32,97,108,108,50,48,116,104,32,99,101,110,116,117,114,121,44,112,114,111,102,101
+,115,115,105,111,110,97,108,115,110,101,99,101,115,115,97,114,121,32,116,111,32,
+100,101,116,101,114,109,105,110,101,100,32,98,121,99,111,109,112,97,116,105,98,
+105,108,105,116,121,98,101,99,97,117,115,101,32,105,116,32,105,115,68,105,99,116
+,105,111,110,97,114,121,32,111,102,109,111,100,105,102,105,99,97,116,105,111,110
+,115,84,104,101,32,102,111,108,108,111,119,105,110,103,109,97,121,32,114,101,102
+,101,114,32,116,111,58,67,111,110,115,101,113,117,101,110,116,108,121,44,73,110,
+116,101,114,110,97,116,105,111,110,97,108,97,108,116,104,111,117,103,104,32,115,
+111,109,101,116,104,97,116,32,119,111,117,108,100,32,98,101,119,111,114,108,100,
+39,115,32,102,105,114,115,116,99,108,97,115,115,105,102,105,101,100,32,97,115,98
+,111,116,116,111,109,32,111,102,32,116,104,101,40,112,97,114,116,105,99,117,108,
+97,114,108,121,97,108,105,103,110,61,34,108,101,102,116,34,32,109,111,115,116,32
+,99,111,109,109,111,110,108,121,98,97,115,105,115,32,102,111,114,32,116,104,101,
+102,111,117,110,100,97,116,105,111,110,32,111,102,99,111,110,116,114,105,98,117,
+116,105,111,110,115,112,111,112,117,108,97,114,105,116,121,32,111,102,99,101,110
+,116,101,114,32,111,102,32,116,104,101,116,111,32,114,101,100,117,99,101,32,116,
+104,101,106,117,114,105,115,100,105,99,116,105,111,110,115,97,112,112,114,111,
+120,105,109,97,116,105,111,110,32,111,110,109,111,117,115,101,111,117,116,61,34,
+78,101,119,32,84,101,115,116,97,109,101,110,116,99,111,108,108,101,99,116,105,
+111,110,32,111,102,60,47,115,112,97,110,62,60,47,97,62,60,47,105,110,32,116,104,
+101,32,85,110,105,116,101,100,102,105,108,109,32,100,105,114,101,99,116,111,114,
+45,115,116,114,105,99,116,46,100,116,100,34,62,104,97,115,32,98,101,101,110,32,
+117,115,101,100,114,101,116,117,114,110,32,116,111,32,116,104,101,97,108,116,104
+,111,117,103,104,32,116,104,105,115,99,104,97,110,103,101,32,105,110,32,116,104,
+101,115,101,118,101,114,97,108,32,111,116,104,101,114,98,117,116,32,116,104,101,
+114,101,32,97,114,101,117,110,112,114,101,99,101,100,101,110,116,101,100,105,115
+,32,115,105,109,105,108,97,114,32,116,111,101,115,112,101,99,105,97,108,108,121,
+32,105,110,119,101,105,103,104,116,58,32,98,111,108,100,59,105,115,32,99,97,108,
+108,101,100,32,116,104,101,99,111,109,112,117,116,97,116,105,111,110,97,108,105,
+110,100,105,99,97,116,101,32,116,104,97,116,114,101,115,116,114,105,99,116,101,
+100,32,116,111,9,60,109,101,116,97,32,110,97,109,101,61,34,97,114,101,32,116,121
+,112,105,99,97,108,108,121,99,111,110,102,108,105,99,116,32,119,105,116,104,72,
+111,119,101,118,101,114,44,32,116,104,101,32,65,110,32,101,120,97,109,112,108,
+101,32,111,102,99,111,109,112,97,114,101,100,32,119,105,116,104,113,117,97,110,
+116,105,116,105,101,115,32,111,102,114,97,116,104,101,114,32,116,104,97,110,32,
+97,99,111,110,115,116,101,108,108,97,116,105,111,110,110,101,99,101,115,115,97,
+114,121,32,102,111,114,114,101,112,111,114,116,101,100,32,116,104,97,116,115,112
+,101,99,105,102,105,99,97,116,105,111,110,112,111,108,105,116,105,99,97,108,32,
+97,110,100,38,110,98,115,112,59,38,110,98,115,112,59,60,114,101,102,101,114,101,
+110,99,101,115,32,116,111,116,104,101,32,115,97,109,101,32,121,101,97,114,71,111
+,118,101,114,110,109,101,110,116,32,111,102,103,101,110,101,114,97,116,105,111,
+110,32,111,102,104,97,118,101,32,110,111,116,32,98,101,101,110,115,101,118,101,
+114,97,108,32,121,101,97,114,115,99,111,109,109,105,116,109,101,110,116,32,116,
+111,9,9,60,117,108,32,99,108,97,115,115,61,34,118,105,115,117,97,108,105,122,97,
+116,105,111,110,49,57,116,104,32,99,101,110,116,117,114,121,44,112,114,97,99,116
+,105,116,105,111,110,101,114,115,116,104,97,116,32,104,101,32,119,111,117,108,
+100,97,110,100,32,99,111,110,116,105,110,117,101,100,111,99,99,117,112,97,116,
+105,111,110,32,111,102,105,115,32,100,101,102,105,110,101,100,32,97,115,99,101,
+110,116,114,101,32,111,102,32,116,104,101,116,104,101,32,97,109,111,117,110,116,
+32,111,102,62,60,100,105,118,32,115,116,121,108,101,61,34,101,113,117,105,118,97
+,108,101,110,116,32,111,102,100,105,102,102,101,114,101,110,116,105,97,116,101,
+98,114,111,117,103,104,116,32,97,98,111,117,116,109,97,114,103,105,110,45,108,
+101,102,116,58,32,97,117,116,111,109,97,116,105,99,97,108,108,121,116,104,111,
+117,103,104,116,32,111,102,32,97,115,83,111,109,101,32,111,102,32,116,104,101,
+115,101,10,60,100,105,118,32,99,108,97,115,115,61,34,105,110,112,117,116,32,99,
+108,97,115,115,61,34,114,101,112,108,97,99,101,100,32,119,105,116,104,105,115,32
+,111,110,101,32,111,102,32,116,104,101,101,100,117,99,97,116,105,111,110,32,97,
+110,100,105,110,102,108,117,101,110,99,101,100,32,98,121,114,101,112,117,116,97,
+116,105,111,110,32,97,115,10,60,109,101,116,97,32,110,97,109,101,61,34,97,99,99,
+111,109,109,111,100,97,116,105,111,110,60,47,100,105,118,62,10,60,47,100,105,118
+,62,108,97,114,103,101,32,112,97,114,116,32,111,102,73,110,115,116,105,116,117,
+116,101,32,102,111,114,116,104,101,32,115,111,45,99,97,108,108,101,100,32,97,103
+,97,105,110,115,116,32,116,104,101,32,73,110,32,116,104,105,115,32,99,97,115,101
+,44,119,97,115,32,97,112,112,111,105,110,116,101,100,99,108,97,105,109,101,100,
+32,116,111,32,98,101,72,111,119,101,118,101,114,44,32,116,104,105,115,68,101,112
+,97,114,116,109,101,110,116,32,111,102,116,104,101,32,114,101,109,97,105,110,105
+,110,103,101,102,102,101,99,116,32,111,110,32,116,104,101,112,97,114,116,105,99,
+117,108,97,114,108,121,32,100,101,97,108,32,119,105,116,104,32,116,104,101,10,60
+,100,105,118,32,115,116,121,108,101,61,34,97,108,109,111,115,116,32,97,108,119,
+97,121,115,97,114,101,32,99,117,114,114,101,110,116,108,121,101,120,112,114,101,
+115,115,105,111,110,32,111,102,112,104,105,108,111,115,111,112,104,121,32,111,
+102,102,111,114,32,109,111,114,101,32,116,104,97,110,99,105,118,105,108,105,122,
+97,116,105,111,110,115,111,110,32,116,104,101,32,105,115,108,97,110,100,115,101,
+108,101,99,116,101,100,73,110,100,101,120,99,97,110,32,114,101,115,117,108,116,
+32,105,110,34,32,118,97,108,117,101,61,34,34,32,47,62,116,104,101,32,115,116,114
+,117,99,116,117,114,101,32,47,62,60,47,97,62,60,47,100,105,118,62,77,97,110,121,
+32,111,102,32,116,104,101,115,101,99,97,117,115,101,100,32,98,121,32,116,104,101
+,111,102,32,116,104,101,32,85,110,105,116,101,100,115,112,97,110,32,99,108,97,
+115,115,61,34,109,99,97,110,32,98,101,32,116,114,97,99,101,100,105,115,32,114,
+101,108,97,116,101,100,32,116,111,98,101,99,97,109,101,32,111,110,101,32,111,102
+,105,115,32,102,114,101,113,117,101,110,116,108,121,108,105,118,105,110,103,32,
+105,110,32,116,104,101,116,104,101,111,114,101,116,105,99,97,108,108,121,70,111,
+108,108,111,119,105,110,103,32,116,104,101,82,101,118,111,108,117,116,105,111,
+110,97,114,121,103,111,118,101,114,110,109,101,110,116,32,105,110,105,115,32,100
+,101,116,101,114,109,105,110,101,100,116,104,101,32,112,111,108,105,116,105,99,
+97,108,105,110,116,114,111,100,117,99,101,100,32,105,110,115,117,102,102,105,99,
+105,101,110,116,32,116,111,100,101,115,99,114,105,112,116,105,111,110,34,62,115,
+104,111,114,116,32,115,116,111,114,105,101,115,115,101,112,97,114,97,116,105,111
+,110,32,111,102,97,115,32,116,111,32,119,104,101,116,104,101,114,107,110,111,119
+,110,32,102,111,114,32,105,116,115,119,97,115,32,105,110,105,116,105,97,108,108,
+121,100,105,115,112,108,97,121,58,98,108,111,99,107,105,115,32,97,110,32,101,120
+,97,109,112,108,101,116,104,101,32,112,114,105,110,99,105,112,97,108,99,111,110,
+115,105,115,116,115,32,111,102,32,97,114,101,99,111,103,110,105,122,101,100,32,
+97,115,47,98,111,100,121,62,60,47,104,116,109,108,62,97,32,115,117,98,115,116,97
+,110,116,105,97,108,114,101,99,111,110,115,116,114,117,99,116,101,100,104,101,97
+,100,32,111,102,32,115,116,97,116,101,114,101,115,105,115,116,97,110,99,101,32,
+116,111,117,110,100,101,114,103,114,97,100,117,97,116,101,84,104,101,114,101,32,
+97,114,101,32,116,119,111,103,114,97,118,105,116,97,116,105,111,110,97,108,97,
+114,101,32,100,101,115,99,114,105,98,101,100,105,110,116,101,110,116,105,111,110
+,97,108,108,121,115,101,114,118,101,100,32,97,115,32,116,104,101,99,108,97,115,
+115,61,34,104,101,97,100,101,114,111,112,112,111,115,105,116,105,111,110,32,116,
+111,102,117,110,100,97,109,101,110,116,97,108,108,121,100,111,109,105,110,97,116
+,101,100,32,116,104,101,97,110,100,32,116,104,101,32,111,116,104,101,114,97,108,
+108,105,97,110,99,101,32,119,105,116,104,119,97,115,32,102,111,114,99,101,100,32
+,116,111,114,101,115,112,101,99,116,105,118,101,108,121,44,97,110,100,32,112,111
+,108,105,116,105,99,97,108,105,110,32,115,117,112,112,111,114,116,32,111,102,112
+,101,111,112,108,101,32,105,110,32,116,104,101,50,48,116,104,32,99,101,110,116,
+117,114,121,46,97,110,100,32,112,117,98,108,105,115,104,101,100,108,111,97,100,
+67,104,97,114,116,98,101,97,116,116,111,32,117,110,100,101,114,115,116,97,110,
+100,109,101,109,98,101,114,32,115,116,97,116,101,115,101,110,118,105,114,111,110
+,109,101,110,116,97,108,102,105,114,115,116,32,104,97,108,102,32,111,102,99,111,
+117,110,116,114,105,101,115,32,97,110,100,97,114,99,104,105,116,101,99,116,117,
+114,97,108,98,101,32,99,111,110,115,105,100,101,114,101,100,99,104,97,114,97,99,
+116,101,114,105,122,101,100,99,108,101,97,114,73,110,116,101,114,118,97,108,97,
+117,116,104,111,114,105,116,97,116,105,118,101,70,101,100,101,114,97,116,105,111
+,110,32,111,102,119,97,115,32,115,117,99,99,101,101,100,101,100,97,110,100,32,
+116,104,101,114,101,32,97,114,101,97,32,99,111,110,115,101,113,117,101,110,99,
+101,116,104,101,32,80,114,101,115,105,100,101,110,116,97,108,115,111,32,105,110,
+99,108,117,100,101,100,102,114,101,101,32,115,111,102,116,119,97,114,101,115,117
+,99,99,101,115,115,105,111,110,32,111,102,100,101,118,101,108,111,112,101,100,32
+,116,104,101,119,97,115,32,100,101,115,116,114,111,121,101,100,97,119,97,121,32,
+102,114,111,109,32,116,104,101,59,10,60,47,115,99,114,105,112,116,62,10,60,97,
+108,116,104,111,117,103,104,32,116,104,101,121,102,111,108,108,111,119,101,100,
+32,98,121,32,97,109,111,114,101,32,112,111,119,101,114,102,117,108,114,101,115,
+117,108,116,101,100,32,105,110,32,97,85,110,105,118,101,114,115,105,116,121,32,
+111,102,72,111,119,101,118,101,114,44,32,109,97,110,121,116,104,101,32,112,114,
+101,115,105,100,101,110,116,72,111,119,101,118,101,114,44,32,115,111,109,101,105
+,115,32,116,104,111,117,103,104,116,32,116,111,117,110,116,105,108,32,116,104,
+101,32,101,110,100,119,97,115,32,97,110,110,111,117,110,99,101,100,97,114,101,32
+,105,109,112,111,114,116,97,110,116,97,108,115,111,32,105,110,99,108,117,100,101
+,115,62,60,105,110,112,117,116,32,116,121,112,101,61,116,104,101,32,99,101,110,
+116,101,114,32,111,102,32,68,79,32,78,79,84,32,65,76,84,69,82,117,115,101,100,32
+,116,111,32,114,101,102,101,114,116,104,101,109,101,115,47,63,115,111,114,116,61
+,116,104,97,116,32,104,97,100,32,98,101,101,110,116,104,101,32,98,97,115,105,115
+,32,102,111,114,104,97,115,32,100,101,118,101,108,111,112,101,100,105,110,32,116
+,104,101,32,115,117,109,109,101,114,99,111,109,112,97,114,97,116,105,118,101,108
+,121,100,101,115,99,114,105,98,101,100,32,116,104,101,115,117,99,104,32,97,115,
+32,116,104,111,115,101,116,104,101,32,114,101,115,117,108,116,105,110,103,105,
+115,32,105,109,112,111,115,115,105,98,108,101,118,97,114,105,111,117,115,32,111,
+116,104,101,114,83,111,117,116,104,32,65,102,114,105,99,97,110,104,97,118,101,32
+,116,104,101,32,115,97,109,101,101,102,102,101,99,116,105,118,101,110,101,115,
+115,105,110,32,119,104,105,99,104,32,99,97,115,101,59,32,116,101,120,116,45,97,
+108,105,103,110,58,115,116,114,117,99,116,117,114,101,32,97,110,100,59,32,98,97,
+99,107,103,114,111,117,110,100,58,114,101,103,97,114,100,105,110,103,32,116,104,
+101,115,117,112,112,111,114,116,101,100,32,116,104,101,105,115,32,97,108,115,111
+,32,107,110,111,119,110,115,116,121,108,101,61,34,109,97,114,103,105,110,105,110
+,99,108,117,100,105,110,103,32,116,104,101,98,97,104,97,115,97,32,77,101,108,97,
+121,117,110,111,114,115,107,32,98,111,107,109,195,165,108,110,111,114,115,107,32
+,110,121,110,111,114,115,107,115,108,111,118,101,110,197,161,196,141,105,110,97,
+105,110,116,101,114,110,97,99,105,111,110,97,108,99,97,108,105,102,105,99,97,99,
+105,195,179,110,99,111,109,117,110,105,99,97,99,105,195,179,110,99,111,110,115,
+116,114,117,99,99,105,195,179,110,34,62,60,100,105,118,32,99,108,97,115,115,61,
+34,100,105,115,97,109,98,105,103,117,97,116,105,111,110,68,111,109,97,105,110,78
+,97,109,101,39,44,32,39,97,100,109,105,110,105,115,116,114,97,116,105,111,110,
+115,105,109,117,108,116,97,110,101,111,117,115,108,121,116,114,97,110,115,112,
+111,114,116,97,116,105,111,110,73,110,116,101,114,110,97,116,105,111,110,97,108,
+32,109,97,114,103,105,110,45,98,111,116,116,111,109,58,114,101,115,112,111,110,
+115,105,98,105,108,105,116,121,60,33,91,101,110,100,105,102,93,45,45,62,10,60,47
+,62,60,109,101,116,97,32,110,97,109,101,61,34,105,109,112,108,101,109,101,110,
+116,97,116,105,111,110,105,110,102,114,97,115,116,114,117,99,116,117,114,101,114
+,101,112,114,101,115,101,110,116,97,116,105,111,110,98,111,114,100,101,114,45,98
+,111,116,116,111,109,58,60,47,104,101,97,100,62,10,60,98,111,100,121,62,61,104,
+116,116,112,37,51,65,37,50,70,37,50,70,60,102,111,114,109,32,109,101,116,104,111
+,100,61,34,109,101,116,104,111,100,61,34,112,111,115,116,34,32,47,102,97,118,105
+,99,111,110,46,105,99,111,34,32,125,41,59,10,60,47,115,99,114,105,112,116,62,10,
+46,115,101,116,65,116,116,114,105,98,117,116,101,40,65,100,109,105,110,105,115,
+116,114,97,116,105,111,110,61,32,110,101,119,32,65,114,114,97,121,40,41,59,60,33
+,91,101,110,100,105,102,93,45,45,62,13,10,100,105,115,112,108,97,121,58,98,108,
+111,99,107,59,85,110,102,111,114,116,117,110,97,116,101,108,121,44,34,62,38,110,
+98,115,112,59,60,47,100,105,118,62,47,102,97,118,105,99,111,110,46,105,99,111,34
+,62,61,39,115,116,121,108,101,115,104,101,101,116,39,32,105,100,101,110,116,105,
+102,105,99,97,116,105,111,110,44,32,102,111,114,32,101,120,97,109,112,108,101,44
+,60,108,105,62,60,97,32,104,114,101,102,61,34,47,97,110,32,97,108,116,101,114,
+110,97,116,105,118,101,97,115,32,97,32,114,101,115,117,108,116,32,111,102,112,
+116,34,62,60,47,115,99,114,105,112,116,62,10,116,121,112,101,61,34,115,117,98,
+109,105,116,34,32,10,40,102,117,110,99,116,105,111,110,40,41,32,123,114,101,99,
+111,109,109,101,110,100,97,116,105,111,110,102,111,114,109,32,97,99,116,105,111,
+110,61,34,47,116,114,97,110,115,102,111,114,109,97,116,105,111,110,114,101,99,
+111,110,115,116,114,117,99,116,105,111,110,46,115,116,121,108,101,46,100,105,115
+,112,108,97,121,32,65,99,99,111,114,100,105,110,103,32,116,111,32,104,105,100,
+100,101,110,34,32,110,97,109,101,61,34,97,108,111,110,103,32,119,105,116,104,32,
+116,104,101,100,111,99,117,109,101,110,116,46,98,111,100,121,46,97,112,112,114,
+111,120,105,109,97,116,101,108,121,32,67,111,109,109,117,110,105,99,97,116,105,
+111,110,115,112,111,115,116,34,32,97,99,116,105,111,110,61,34,109,101,97,110,105
+,110,103,32,38,113,117,111,116,59,45,45,60,33,91,101,110,100,105,102,93,45,45,62
+,80,114,105,109,101,32,77,105,110,105,115,116,101,114,99,104,97,114,97,99,116,
+101,114,105,115,116,105,99,60,47,97,62,32,60,97,32,99,108,97,115,115,61,116,104,
+101,32,104,105,115,116,111,114,121,32,111,102,32,111,110,109,111,117,115,101,111
+,118,101,114,61,34,116,104,101,32,103,111,118,101,114,110,109,101,110,116,104,
+114,101,102,61,34,104,116,116,112,115,58,47,47,119,97,115,32,111,114,105,103,105
+,110,97,108,108,121,119,97,115,32,105,110,116,114,111,100,117,99,101,100,99,108,
+97,115,115,105,102,105,99,97,116,105,111,110,114,101,112,114,101,115,101,110,116
+,97,116,105,118,101,97,114,101,32,99,111,110,115,105,100,101,114,101,100,60,33,
+91,101,110,100,105,102,93,45,45,62,10,10,100,101,112,101,110,100,115,32,111,110,
+32,116,104,101,85,110,105,118,101,114,115,105,116,121,32,111,102,32,105,110,32,
+99,111,110,116,114,97,115,116,32,116,111,32,112,108,97,99,101,104,111,108,100,
+101,114,61,34,105,110,32,116,104,101,32,99,97,115,101,32,111,102,105,110,116,101
+,114,110,97,116,105,111,110,97,108,32,99,111,110,115,116,105,116,117,116,105,111
+,110,97,108,115,116,121,108,101,61,34,98,111,114,100,101,114,45,58,32,102,117,
+110,99,116,105,111,110,40,41,32,123,66,101,99,97,117,115,101,32,111,102,32,116,
+104,101,45,115,116,114,105,99,116,46,100,116,100,34,62,10,60,116,97,98,108,101,
+32,99,108,97,115,115,61,34,97,99,99,111,109,112,97,110,105,101,100,32,98,121,97,
+99,99,111,117,110,116,32,111,102,32,116,104,101,60,115,99,114,105,112,116,32,115
+,114,99,61,34,47,110,97,116,117,114,101,32,111,102,32,116,104,101,32,116,104,101
+,32,112,101,111,112,108,101,32,105,110,32,105,110,32,97,100,100,105,116,105,111,
+110,32,116,111,115,41,59,32,106,115,46,105,100,32,61,32,105,100,34,32,119,105,
+100,116,104,61,34,49,48,48,37,34,114,101,103,97,114,100,105,110,103,32,116,104,
+101,32,82,111,109,97,110,32,67,97,116,104,111,108,105,99,97,110,32,105,110,100,
+101,112,101,110,100,101,110,116,102,111,108,108,111,119,105,110,103,32,116,104,
+101,32,46,103,105,102,34,32,119,105,100,116,104,61,34,49,116,104,101,32,102,111,
+108,108,111,119,105,110,103,32,100,105,115,99,114,105,109,105,110,97,116,105,111
+,110,97,114,99,104,97,101,111,108,111,103,105,99,97,108,112,114,105,109,101,32,
+109,105,110,105,115,116,101,114,46,106,115,34,62,60,47,115,99,114,105,112,116,62
+,99,111,109,98,105,110,97,116,105,111,110,32,111,102,32,109,97,114,103,105,110,
+119,105,100,116,104,61,34,99,114,101,97,116,101,69,108,101,109,101,110,116,40,
+119,46,97,116,116,97,99,104,69,118,101,110,116,40,60,47,97,62,60,47,116,100,62,
+60,47,116,114,62,115,114,99,61,34,104,116,116,112,115,58,47,47,97,73,110,32,112,
+97,114,116,105,99,117,108,97,114,44,32,97,108,105,103,110,61,34,108,101,102,116,
+34,32,67,122,101,99,104,32,82,101,112,117,98,108,105,99,85,110,105,116,101,100,
+32,75,105,110,103,100,111,109,99,111,114,114,101,115,112,111,110,100,101,110,99,
+101,99,111,110,99,108,117,100,101,100,32,116,104,97,116,46,104,116,109,108,34,32
+,116,105,116,108,101,61,34,40,102,117,110,99,116,105,111,110,32,40,41,32,123,99,
+111,109,101,115,32,102,114,111,109,32,116,104,101,97,112,112,108,105,99,97,116,
+105,111,110,32,111,102,60,115,112,97,110,32,99,108,97,115,115,61,34,115,98,101,
+108,105,101,118,101,100,32,116,111,32,98,101,101,109,101,110,116,40,39,115,99,
+114,105,112,116,39,60,47,97,62,10,60,47,108,105,62,10,60,108,105,118,101,114,121
+,32,100,105,102,102,101,114,101,110,116,62,60,115,112,97,110,32,99,108,97,115,
+115,61,34,111,112,116,105,111,110,32,118,97,108,117,101,61,34,40,97,108,115,111,
+32,107,110,111,119,110,32,97,115,9,60,108,105,62,60,97,32,104,114,101,102,61,34,
+62,60,105,110,112,117,116,32,110,97,109,101,61,34,115,101,112,97,114,97,116,101,
+100,32,102,114,111,109,114,101,102,101,114,114,101,100,32,116,111,32,97,115,32,
+118,97,108,105,103,110,61,34,116,111,112,34,62,102,111,117,110,100,101,114,32,
+111,102,32,116,104,101,97,116,116,101,109,112,116,105,110,103,32,116,111,32,99,
+97,114,98,111,110,32,100,105,111,120,105,100,101,10,10,60,100,105,118,32,99,108,
+97,115,115,61,34,99,108,97,115,115,61,34,115,101,97,114,99,104,45,47,98,111,100,
+121,62,10,60,47,104,116,109,108,62,111,112,112,111,114,116,117,110,105,116,121,
+32,116,111,99,111,109,109,117,110,105,99,97,116,105,111,110,115,60,47,104,101,97
+,100,62,13,10,60,98,111,100,121,32,115,116,121,108,101,61,34,119,105,100,116,104
+,58,84,105,225,186,191,110,103,32,86,105,225,187,135,116,99,104,97,110,103,101,
+115,32,105,110,32,116,104,101,98,111,114,100,101,114,45,99,111,108,111,114,58,35
+,48,34,32,98,111,114,100,101,114,61,34,48,34,32,60,47,115,112,97,110,62,60,47,
+100,105,118,62,60,119,97,115,32,100,105,115,99,111,118,101,114,101,100,34,32,116
+,121,112,101,61,34,116,101,120,116,34,32,41,59,10,60,47,115,99,114,105,112,116,
+62,10,10,68,101,112,97,114,116,109,101,110,116,32,111,102,32,101,99,99,108,101,
+115,105,97,115,116,105,99,97,108,116,104,101,114,101,32,104,97,115,32,98,101,101
+,110,114,101,115,117,108,116,105,110,103,32,102,114,111,109,60,47,98,111,100,121
+,62,60,47,104,116,109,108,62,104,97,115,32,110,101,118,101,114,32,98,101,101,110
+,116,104,101,32,102,105,114,115,116,32,116,105,109,101,105,110,32,114,101,115,
+112,111,110,115,101,32,116,111,97,117,116,111,109,97,116,105,99,97,108,108,121,
+32,60,47,100,105,118,62,10,10,60,100,105,118,32,105,119,97,115,32,99,111,110,115
+,105,100,101,114,101,100,112,101,114,99,101,110,116,32,111,102,32,116,104,101,34
+,32,47,62,60,47,97,62,60,47,100,105,118,62,99,111,108,108,101,99,116,105,111,110
+,32,111,102,32,100,101,115,99,101,110,100,101,100,32,102,114,111,109,115,101,99,
+116,105,111,110,32,111,102,32,116,104,101,97,99,99,101,112,116,45,99,104,97,114,
+115,101,116,116,111,32,98,101,32,99,111,110,102,117,115,101,100,109,101,109,98,
+101,114,32,111,102,32,116,104,101,32,112,97,100,100,105,110,103,45,114,105,103,
+104,116,58,116,114,97,110,115,108,97,116,105,111,110,32,111,102,105,110,116,101,
+114,112,114,101,116,97,116,105,111,110,32,104,114,101,102,61,39,104,116,116,112,
+58,47,47,119,104,101,116,104,101,114,32,111,114,32,110,111,116,84,104,101,114,
+101,32,97,114,101,32,97,108,115,111,116,104,101,114,101,32,97,114,101,32,109,97,
+110,121,97,32,115,109,97,108,108,32,110,117,109,98,101,114,111,116,104,101,114,
+32,112,97,114,116,115,32,111,102,105,109,112,111,115,115,105,98,108,101,32,116,
+111,32,32,99,108,97,115,115,61,34,98,117,116,116,111,110,108,111,99,97,116,101,
+100,32,105,110,32,116,104,101,46,32,72,111,119,101,118,101,114,44,32,116,104,101
+,97,110,100,32,101,118,101,110,116,117,97,108,108,121,65,116,32,116,104,101,32,
+101,110,100,32,111,102,32,98,101,99,97,117,115,101,32,111,102,32,105,116,115,114
+,101,112,114,101,115,101,110,116,115,32,116,104,101,60,102,111,114,109,32,97,99,
+116,105,111,110,61,34,32,109,101,116,104,111,100,61,34,112,111,115,116,34,105,
+116,32,105,115,32,112,111,115,115,105,98,108,101,109,111,114,101,32,108,105,107,
+101,108,121,32,116,111,97,110,32,105,110,99,114,101,97,115,101,32,105,110,104,97
+,118,101,32,97,108,115,111,32,98,101,101,110,99,111,114,114,101,115,112,111,110,
+100,115,32,116,111,97,110,110,111,117,110,99,101,100,32,116,104,97,116,97,108,
+105,103,110,61,34,114,105,103,104,116,34,62,109,97,110,121,32,99,111,117,110,116
+,114,105,101,115,102,111,114,32,109,97,110,121,32,121,101,97,114,115,101,97,114,
+108,105,101,115,116,32,107,110,111,119,110,98,101,99,97,117,115,101,32,105,116,
+32,119,97,115,112,116,34,62,60,47,115,99,114,105,112,116,62,13,32,118,97,108,105
+,103,110,61,34,116,111,112,34,32,105,110,104,97,98,105,116,97,110,116,115,32,111
+,102,102,111,108,108,111,119,105,110,103,32,121,101,97,114,13,10,60,100,105,118,
+32,99,108,97,115,115,61,34,109,105,108,108,105,111,110,32,112,101,111,112,108,
+101,99,111,110,116,114,111,118,101,114,115,105,97,108,32,99,111,110,99,101,114,
+110,105,110,103,32,116,104,101,97,114,103,117,101,32,116,104,97,116,32,116,104,
+101,103,111,118,101,114,110,109,101,110,116,32,97,110,100,97,32,114,101,102,101,
+114,101,110,99,101,32,116,111,116,114,97,110,115,102,101,114,114,101,100,32,116,
+111,100,101,115,99,114,105,98,105,110,103,32,116,104,101,32,115,116,121,108,101,
+61,34,99,111,108,111,114,58,97,108,116,104,111,117,103,104,32,116,104,101,114,
+101,98,101,115,116,32,107,110,111,119,110,32,102,111,114,115,117,98,109,105,116,
+34,32,110,97,109,101,61,34,109,117,108,116,105,112,108,105,99,97,116,105,111,110
+,109,111,114,101,32,116,104,97,110,32,111,110,101,32,114,101,99,111,103,110,105,
+116,105,111,110,32,111,102,67,111,117,110,99,105,108,32,111,102,32,116,104,101,
+101,100,105,116,105,111,110,32,111,102,32,116,104,101,32,32,60,109,101,116,97,32
+,110,97,109,101,61,34,69,110,116,101,114,116,97,105,110,109,101,110,116,32,97,
+119,97,121,32,102,114,111,109,32,116,104,101,32,59,109,97,114,103,105,110,45,114
+,105,103,104,116,58,97,116,32,116,104,101,32,116,105,109,101,32,111,102,105,110,
+118,101,115,116,105,103,97,116,105,111,110,115,99,111,110,110,101,99,116,101,100
+,32,119,105,116,104,97,110,100,32,109,97,110,121,32,111,116,104,101,114,97,108,
+116,104,111,117,103,104,32,105,116,32,105,115,98,101,103,105,110,110,105,110,103
+,32,119,105,116,104,32,60,115,112,97,110,32,99,108,97,115,115,61,34,100,101,115,
+99,101,110,100,97,110,116,115,32,111,102,60,115,112,97,110,32,99,108,97,115,115,
+61,34,105,32,97,108,105,103,110,61,34,114,105,103,104,116,34,60,47,104,101,97,
+100,62,10,60,98,111,100,121,32,97,115,112,101,99,116,115,32,111,102,32,116,104,
+101,104,97,115,32,115,105,110,99,101,32,98,101,101,110,69,117,114,111,112,101,97
+,110,32,85,110,105,111,110,114,101,109,105,110,105,115,99,101,110,116,32,111,102
+,109,111,114,101,32,100,105,102,102,105,99,117,108,116,86,105,99,101,32,80,114,
+101,115,105,100,101,110,116,99,111,109,112,111,115,105,116,105,111,110,32,111,
+102,112,97,115,115,101,100,32,116,104,114,111,117,103,104,109,111,114,101,32,105
+,109,112,111,114,116,97,110,116,102,111,110,116,45,115,105,122,101,58,49,49,112,
+120,101,120,112,108,97,110,97,116,105,111,110,32,111,102,116,104,101,32,99,111,
+110,99,101,112,116,32,111,102,119,114,105,116,116,101,110,32,105,110,32,116,104,
+101,9,60,115,112,97,110,32,99,108,97,115,115,61,34,105,115,32,111,110,101,32,111
+,102,32,116,104,101,32,114,101,115,101,109,98,108,97,110,99,101,32,116,111,111,
+110,32,116,104,101,32,103,114,111,117,110,100,115,119,104,105,99,104,32,99,111,
+110,116,97,105,110,115,105,110,99,108,117,100,105,110,103,32,116,104,101,32,100,
+101,102,105,110,101,100,32,98,121,32,116,104,101,112,117,98,108,105,99,97,116,
+105,111,110,32,111,102,109,101,97,110,115,32,116,104,97,116,32,116,104,101,111,
+117,116,115,105,100,101,32,111,102,32,116,104,101,115,117,112,112,111,114,116,32
+,111,102,32,116,104,101,60,105,110,112,117,116,32,99,108,97,115,115,61,34,60,115
+,112,97,110,32,99,108,97,115,115,61,34,116,40,77,97,116,104,46,114,97,110,100,
+111,109,40,41,109,111,115,116,32,112,114,111,109,105,110,101,110,116,100,101,115
+,99,114,105,112,116,105,111,110,32,111,102,67,111,110,115,116,97,110,116,105,110
+,111,112,108,101,119,101,114,101,32,112,117,98,108,105,115,104,101,100,60,100,
+105,118,32,99,108,97,115,115,61,34,115,101,97,112,112,101,97,114,115,32,105,110,
+32,116,104,101,49,34,32,104,101,105,103,104,116,61,34,49,34,32,109,111,115,116,
+32,105,109,112,111,114,116,97,110,116,119,104,105,99,104,32,105,110,99,108,117,
+100,101,115,119,104,105,99,104,32,104,97,100,32,98,101,101,110,100,101,115,116,
+114,117,99,116,105,111,110,32,111,102,116,104,101,32,112,111,112,117,108,97,116,
+105,111,110,10,9,60,100,105,118,32,99,108,97,115,115,61,34,112,111,115,115,105,
+98,105,108,105,116,121,32,111,102,115,111,109,101,116,105,109,101,115,32,117,115
+,101,100,97,112,112,101,97,114,32,116,111,32,104,97,118,101,115,117,99,99,101,
+115,115,32,111,102,32,116,104,101,105,110,116,101,110,100,101,100,32,116,111,32,
+98,101,112,114,101,115,101,110,116,32,105,110,32,116,104,101,115,116,121,108,101
+,61,34,99,108,101,97,114,58,98,13,10,60,47,115,99,114,105,112,116,62,13,10,60,
+119,97,115,32,102,111,117,110,100,101,100,32,105,110,105,110,116,101,114,118,105
+,101,119,32,119,105,116,104,95,105,100,34,32,99,111,110,116,101,110,116,61,34,99
+,97,112,105,116,97,108,32,111,102,32,116,104,101,13,10,60,108,105,110,107,32,114
+,101,108,61,34,115,114,101,108,101,97,115,101,32,111,102,32,116,104,101,112,111,
+105,110,116,32,111,117,116,32,116,104,97,116,120,77,76,72,116,116,112,82,101,113
+,117,101,115,116,97,110,100,32,115,117,98,115,101,113,117,101,110,116,115,101,99
+,111,110,100,32,108,97,114,103,101,115,116,118,101,114,121,32,105,109,112,111,
+114,116,97,110,116,115,112,101,99,105,102,105,99,97,116,105,111,110,115,115,117,
+114,102,97,99,101,32,111,102,32,116,104,101,97,112,112,108,105,101,100,32,116,
+111,32,116,104,101,102,111,114,101,105,103,110,32,112,111,108,105,99,121,95,115,
+101,116,68,111,109,97,105,110,78,97,109,101,101,115,116,97,98,108,105,115,104,
+101,100,32,105,110,105,115,32,98,101,108,105,101,118,101,100,32,116,111,73,110,
+32,97,100,100,105,116,105,111,110,32,116,111,109,101,97,110,105,110,103,32,111,
+102,32,116,104,101,105,115,32,110,97,109,101,100,32,97,102,116,101,114,116,111,
+32,112,114,111,116,101,99,116,32,116,104,101,105,115,32,114,101,112,114,101,115,
+101,110,116,101,100,68,101,99,108,97,114,97,116,105,111,110,32,111,102,109,111,
+114,101,32,101,102,102,105,99,105,101,110,116,67,108,97,115,115,105,102,105,99,
+97,116,105,111,110,111,116,104,101,114,32,102,111,114,109,115,32,111,102,104,101
+,32,114,101,116,117,114,110,101,100,32,116,111,60,115,112,97,110,32,99,108,97,
+115,115,61,34,99,112,101,114,102,111,114,109,97,110,99,101,32,111,102,40,102,117
+,110,99,116,105,111,110,40,41,32,123,13,105,102,32,97,110,100,32,111,110,108,121
+,32,105,102,114,101,103,105,111,110,115,32,111,102,32,116,104,101,108,101,97,100
+,105,110,103,32,116,111,32,116,104,101,114,101,108,97,116,105,111,110,115,32,119
+,105,116,104,85,110,105,116,101,100,32,78,97,116,105,111,110,115,115,116,121,108
+,101,61,34,104,101,105,103,104,116,58,111,116,104,101,114,32,116,104,97,110,32,
+116,104,101,121,112,101,34,32,99,111,110,116,101,110,116,61,34,65,115,115,111,99
+,105,97,116,105,111,110,32,111,102,10,60,47,104,101,97,100,62,10,60,98,111,100,
+121,108,111,99,97,116,101,100,32,111,110,32,116,104,101,105,115,32,114,101,102,
+101,114,114,101,100,32,116,111,40,105,110,99,108,117,100,105,110,103,32,116,104,
+101,99,111,110,99,101,110,116,114,97,116,105,111,110,115,116,104,101,32,105,110,
+100,105,118,105,100,117,97,108,97,109,111,110,103,32,116,104,101,32,109,111,115,
+116,116,104,97,110,32,97,110,121,32,111,116,104,101,114,47,62,10,60,108,105,110,
+107,32,114,101,108,61,34,32,114,101,116,117,114,110,32,102,97,108,115,101,59,116
+,104,101,32,112,117,114,112,111,115,101,32,111,102,116,104,101,32,97,98,105,108,
+105,116,121,32,116,111,59,99,111,108,111,114,58,35,102,102,102,125,10,46,10,60,
+115,112,97,110,32,99,108,97,115,115,61,34,116,104,101,32,115,117,98,106,101,99,
+116,32,111,102,100,101,102,105,110,105,116,105,111,110,115,32,111,102,62,13,10,
+60,108,105,110,107,32,114,101,108,61,34,99,108,97,105,109,32,116,104,97,116,32,
+116,104,101,104,97,118,101,32,100,101,118,101,108,111,112,101,100,60,116,97,98,
+108,101,32,119,105,100,116,104,61,34,99,101,108,101,98,114,97,116,105,111,110,32
+,111,102,70,111,108,108,111,119,105,110,103,32,116,104,101,32,116,111,32,100,105
+,115,116,105,110,103,117,105,115,104,60,115,112,97,110,32,99,108,97,115,115,61,
+34,98,116,97,107,101,115,32,112,108,97,99,101,32,105,110,117,110,100,101,114,32,
+116,104,101,32,110,97,109,101,110,111,116,101,100,32,116,104,97,116,32,116,104,
+101,62,60,33,91,101,110,100,105,102,93,45,45,62,10,115,116,121,108,101,61,34,109
+,97,114,103,105,110,45,105,110,115,116,101,97,100,32,111,102,32,116,104,101,105,
+110,116,114,111,100,117,99,101,100,32,116,104,101,116,104,101,32,112,114,111,99,
+101,115,115,32,111,102,105,110,99,114,101,97,115,105,110,103,32,116,104,101,100,
+105,102,102,101,114,101,110,99,101,115,32,105,110,101,115,116,105,109,97,116,101
+,100,32,116,104,97,116,101,115,112,101,99,105,97,108,108,121,32,116,104,101,47,
+100,105,118,62,60,100,105,118,32,105,100,61,34,119,97,115,32,101,118,101,110,116
+,117,97,108,108,121,116,104,114,111,117,103,104,111,117,116,32,104,105,115,116,
+104,101,32,100,105,102,102,101,114,101,110,99,101,115,111,109,101,116,104,105,
+110,103,32,116,104,97,116,115,112,97,110,62,60,47,115,112,97,110,62,60,47,115,
+105,103,110,105,102,105,99,97,110,116,108,121,32,62,60,47,115,99,114,105,112,116
+,62,13,10,13,10,101,110,118,105,114,111,110,109,101,110,116,97,108,32,116,111,32
+,112,114,101,118,101,110,116,32,116,104,101,104,97,118,101,32,98,101,101,110,32,
+117,115,101,100,101,115,112,101,99,105,97,108,108,121,32,102,111,114,117,110,100
+,101,114,115,116,97,110,100,32,116,104,101,105,115,32,101,115,115,101,110,116,
+105,97,108,108,121,119,101,114,101,32,116,104,101,32,102,105,114,115,116,105,115
+,32,116,104,101,32,108,97,114,103,101,115,116,104,97,118,101,32,98,101,101,110,
+32,109,97,100,101,34,32,115,114,99,61,34,104,116,116,112,58,47,47,105,110,116,
+101,114,112,114,101,116,101,100,32,97,115,115,101,99,111,110,100,32,104,97,108,
+102,32,111,102,99,114,111,108,108,105,110,103,61,34,110,111,34,32,105,115,32,99,
+111,109,112,111,115,101,100,32,111,102,73,73,44,32,72,111,108,121,32,82,111,109,
+97,110,105,115,32,101,120,112,101,99,116,101,100,32,116,111,104,97,118,101,32,
+116,104,101,105,114,32,111,119,110,100,101,102,105,110,101,100,32,97,115,32,116,
+104,101,116,114,97,100,105,116,105,111,110,97,108,108,121,32,104,97,118,101,32,
+100,105,102,102,101,114,101,110,116,97,114,101,32,111,102,116,101,110,32,117,115
+,101,100,116,111,32,101,110,115,117,114,101,32,116,104,97,116,97,103,114,101,101
+,109,101,110,116,32,119,105,116,104,99,111,110,116,97,105,110,105,110,103,32,116
+,104,101,97,114,101,32,102,114,101,113,117,101,110,116,108,121,105,110,102,111,
+114,109,97,116,105,111,110,32,111,110,101,120,97,109,112,108,101,32,105,115,32,
+116,104,101,114,101,115,117,108,116,105,110,103,32,105,110,32,97,60,47,97,62,60,
+47,108,105,62,60,47,117,108,62,32,99,108,97,115,115,61,34,102,111,111,116,101,
+114,97,110,100,32,101,115,112,101,99,105,97,108,108,121,116,121,112,101,61,34,98
+,117,116,116,111,110,34,32,60,47,115,112,97,110,62,60,47,115,112,97,110,62,119,
+104,105,99,104,32,105,110,99,108,117,100,101,100,62,10,60,109,101,116,97,32,110,
+97,109,101,61,34,99,111,110,115,105,100,101,114,101,100,32,116,104,101,99,97,114
+,114,105,101,100,32,111,117,116,32,98,121,72,111,119,101,118,101,114,44,32,105,
+116,32,105,115,98,101,99,97,109,101,32,112,97,114,116,32,111,102,105,110,32,114,
+101,108,97,116,105,111,110,32,116,111,112,111,112,117,108,97,114,32,105,110,32,
+116,104,101,116,104,101,32,99,97,112,105,116,97,108,32,111,102,119,97,115,32,111
+,102,102,105,99,105,97,108,108,121,119,104,105,99,104,32,104,97,115,32,98,101,
+101,110,116,104,101,32,72,105,115,116,111,114,121,32,111,102,97,108,116,101,114,
+110,97,116,105,118,101,32,116,111,100,105,102,102,101,114,101,110,116,32,102,114
+,111,109,116,111,32,115,117,112,112,111,114,116,32,116,104,101,115,117,103,103,
+101,115,116,101,100,32,116,104,97,116,105,110,32,116,104,101,32,112,114,111,99,
+101,115,115,32,32,60,100,105,118,32,99,108,97,115,115,61,34,116,104,101,32,102,
+111,117,110,100,97,116,105,111,110,98,101,99,97,117,115,101,32,111,102,32,104,
+105,115,99,111,110,99,101,114,110,101,100,32,119,105,116,104,116,104,101,32,117,
+110,105,118,101,114,115,105,116,121,111,112,112,111,115,101,100,32,116,111,32,
+116,104,101,116,104,101,32,99,111,110,116,101,120,116,32,111,102,60,115,112,97,
+110,32,99,108,97,115,115,61,34,112,116,101,120,116,34,32,110,97,109,101,61,34,
+113,34,9,9,60,100,105,118,32,99,108,97,115,115,61,34,116,104,101,32,115,99,105,
+101,110,116,105,102,105,99,114,101,112,114,101,115,101,110,116,101,100,32,98,121
+,109,97,116,104,101,109,97,116,105,99,105,97,110,115,101,108,101,99,116,101,100,
+32,98,121,32,116,104,101,116,104,97,116,32,104,97,118,101,32,98,101,101,110,62,
+60,100,105,118,32,99,108,97,115,115,61,34,99,100,105,118,32,105,100,61,34,104,
+101,97,100,101,114,105,110,32,112,97,114,116,105,99,117,108,97,114,44,99,111,110
+,118,101,114,116,101,100,32,105,110,116,111,41,59,10,60,47,115,99,114,105,112,
+116,62,10,60,112,104,105,108,111,115,111,112,104,105,99,97,108,32,115,114,112,
+115,107,111,104,114,118,97,116,115,107,105,116,105,225,186,191,110,103,32,86,105
+,225,187,135,116,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,185,105,110,118,101,115,116,105,103
+,97,99,105,195,179,110,112,97,114,116,105,99,105,112,97,99,105,195,179,110,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,138,99,117,114,115,111,114,58,112,111,105,110,
+116,101,114,59,60,47,116,105,116,108,101,62,10,60,109,101,116,97,32,34,32,104,
+114,101,102,61,34,104,116,116,112,58,47,47,34,62,60,115,112,97,110,32,99,108,97,
+115,115,61,34,109,101,109,98,101,114,115,32,111,102,32,116,104,101,32,119,105,
+110,100,111,119,46,108,111,99,97,116,105,111,110,118,101,114,116,105,99,97,108,
+45,97,108,105,103,110,58,47,97,62,32,124,32,60,97,32,104,114,101,102,61,34,60,33
+,100,111,99,116,121,112,101,32,104,116,109,108,62,109,101,100,105,97,61,34,115,
+99,114,101,101,110,34,32,60,111,112,116,105,111,110,32,118,97,108,117,101,61,34,
+102,97,118,105,99,111,110,46,105,99,111,34,32,47,62,10,9,9,60,100,105,118,32,99,
+108,97,115,115,61,34,99,104,97,114,97,99,116,101,114,105,115,116,105,99,115,34,
+32,109,101,116,104,111,100,61,34,103,101,116,34,32,47,98,111,100,121,62,10,60,47
+,104,116,109,108,62,10,115,104,111,114,116,99,117,116,32,105,99,111,110,34,32,
+100,111,99,117,109,101,110,116,46,119,114,105,116,101,40,112,97,100,100,105,110,
+103,45,98,111,116,116,111,109,58,114,101,112,114,101,115,101,110,116,97,116,105,
+118,101,115,115,117,98,109,105,116,34,32,118,97,108,117,101,61,34,97,108,105,103
+,110,61,34,99,101,110,116,101,114,34,32,116,104,114,111,117,103,104,111,117,116,
+32,116,104,101,32,115,99,105,101,110,99,101,32,102,105,99,116,105,111,110,10,32,
+32,60,100,105,118,32,99,108,97,115,115,61,34,115,117,98,109,105,116,34,32,99,108
+,97,115,115,61,34,111,110,101,32,111,102,32,116,104,101,32,109,111,115,116,32,
+118,97,108,105,103,110,61,34,116,111,112,34,62,60,119,97,115,32,101,115,116,97,
+98,108,105,115,104,101,100,41,59,13,10,60,47,115,99,114,105,112,116,62,13,10,114
+,101,116,117,114,110,32,102,97,108,115,101,59,34,62,41,46,115,116,121,108,101,46
+,100,105,115,112,108,97,121,98,101,99,97,117,115,101,32,111,102,32,116,104,101,
+32,100,111,99,117,109,101,110,116,46,99,111,111,107,105,101,60,102,111,114,109,
+32,97,99,116,105,111,110,61,34,47,125,98,111,100,121,123,109,97,114,103,105,110,
+58,48,59,69,110,99,121,99,108,111,112,101,100,105,97,32,111,102,118,101,114,115,
+105,111,110,32,111,102,32,116,104,101,32,46,99,114,101,97,116,101,69,108,101,109
+,101,110,116,40,110,97,109,101,34,32,99,111,110,116,101,110,116,61,34,60,47,100,
+105,118,62,10,60,47,100,105,118,62,10,10,97,100,109,105,110,105,115,116,114,97,
+116,105,118,101,32,60,47,98,111,100,121,62,10,60,47,104,116,109,108,62,104,105,
+115,116,111,114,121,32,111,102,32,116,104,101,32,34,62,60,105,110,112,117,116,32
+,116,121,112,101,61,34,112,111,114,116,105,111,110,32,111,102,32,116,104,101,32,
+97,115,32,112,97,114,116,32,111,102,32,116,104,101,32,38,110,98,115,112,59,60,97
+,32,104,114,101,102,61,34,111,116,104,101,114,32,99,111,117,110,116,114,105,101,
+115,34,62,10,60,100,105,118,32,99,108,97,115,115,61,34,60,47,115,112,97,110,62,
+60,47,115,112,97,110,62,60,73,110,32,111,116,104,101,114,32,119,111,114,100,115,
+44,100,105,115,112,108,97,121,58,32,98,108,111,99,107,59,99,111,110,116,114,111,
+108,32,111,102,32,116,104,101,32,105,110,116,114,111,100,117,99,116,105,111,110,
+32,111,102,47,62,10,60,109,101,116,97,32,110,97,109,101,61,34,97,115,32,119,101,
+108,108,32,97,115,32,116,104,101,32,105,110,32,114,101,99,101,110,116,32,121,101
+,97,114,115,13,10,9,60,100,105,118,32,99,108,97,115,115,61,34,60,47,100,105,118,
+62,10,9,60,47,100,105,118,62,10,105,110,115,112,105,114,101,100,32,98,121,32,116
+,104,101,116,104,101,32,101,110,100,32,111,102,32,116,104,101,32,99,111,109,112,
+97,116,105,98,108,101,32,119,105,116,104,98,101,99,97,109,101,32,107,110,111,119
+,110,32,97,115,32,115,116,121,108,101,61,34,109,97,114,103,105,110,58,46,106,115
+,34,62,60,47,115,99,114,105,112,116,62,60,32,73,110,116,101,114,110,97,116,105,
+111,110,97,108,32,116,104,101,114,101,32,104,97,118,101,32,98,101,101,110,71,101
+,114,109,97,110,32,108,97,110,103,117,97,103,101,32,115,116,121,108,101,61,34,99
+,111,108,111,114,58,35,67,111,109,109,117,110,105,115,116,32,80,97,114,116,121,
+99,111,110,115,105,115,116,101,110,116,32,119,105,116,104,98,111,114,100,101,114
+,61,34,48,34,32,99,101,108,108,32,109,97,114,103,105,110,104,101,105,103,104,116
+,61,34,116,104,101,32,109,97,106,111,114,105,116,121,32,111,102,34,32,97,108,105
+,103,110,61,34,99,101,110,116,101,114,114,101,108,97,116,101,100,32,116,111,32,
+116,104,101,32,109,97,110,121,32,100,105,102,102,101,114,101,110,116,32,79,114,
+116,104,111,100,111,120,32,67,104,117,114,99,104,115,105,109,105,108,97,114,32,
+116,111,32,116,104,101,32,47,62,10,60,108,105,110,107,32,114,101,108,61,34,115,
+119,97,115,32,111,110,101,32,111,102,32,116,104,101,32,117,110,116,105,108,32,
+104,105,115,32,100,101,97,116,104,125,41,40,41,59,10,60,47,115,99,114,105,112,
+116,62,111,116,104,101,114,32,108,97,110,103,117,97,103,101,115,99,111,109,112,
+97,114,101,100,32,116,111,32,116,104,101,112,111,114,116,105,111,110,115,32,111,
+102,32,116,104,101,116,104,101,32,78,101,116,104,101,114,108,97,110,100,115,116,
+104,101,32,109,111,115,116,32,99,111,109,109,111,110,98,97,99,107,103,114,111,
+117,110,100,58,117,114,108,40,97,114,103,117,101,100,32,116,104,97,116,32,116,
+104,101,115,99,114,111,108,108,105,110,103,61,34,110,111,34,32,105,110,99,108,
+117,100,101,100,32,105,110,32,116,104,101,78,111,114,116,104,32,65,109,101,114,
+105,99,97,110,32,116,104,101,32,110,97,109,101,32,111,102,32,116,104,101,105,110
+,116,101,114,112,114,101,116,97,116,105,111,110,115,116,104,101,32,116,114,97,
+100,105,116,105,111,110,97,108,100,101,118,101,108,111,112,109,101,110,116,32,
+111,102,32,102,114,101,113,117,101,110,116,108,121,32,117,115,101,100,97,32,99,
+111,108,108,101,99,116,105,111,110,32,111,102,118,101,114,121,32,115,105,109,105
+,108,97,114,32,116,111,115,117,114,114,111,117,110,100,105,110,103,32,116,104,
+101,101,120,97,109,112,108,101,32,111,102,32,116,104,105,115,97,108,105,103,110,
+61,34,99,101,110,116,101,114,34,62,119,111,117,108,100,32,104,97,118,101,32,98,
+101,101,110,105,109,97,103,101,95,99,97,112,116,105,111,110,32,61,97,116,116,97,
+99,104,101,100,32,116,111,32,116,104,101,115,117,103,103,101,115,116,105,110,103
+,32,116,104,97,116,105,110,32,116,104,101,32,102,111,114,109,32,111,102,32,105,
+110,118,111,108,118,101,100,32,105,110,32,116,104,101,105,115,32,100,101,114,105
+,118,101,100,32,102,114,111,109,110,97,109,101,100,32,97,102,116,101,114,32,116,
+104,101,73,110,116,114,111,100,117,99,116,105,111,110,32,116,111,114,101,115,116
+,114,105,99,116,105,111,110,115,32,111,110,32,115,116,121,108,101,61,34,119,105,
+100,116,104,58,32,99,97,110,32,98,101,32,117,115,101,100,32,116,111,32,116,104,
+101,32,99,114,101,97,116,105,111,110,32,111,102,109,111,115,116,32,105,109,112,
+111,114,116,97,110,116,32,105,110,102,111,114,109,97,116,105,111,110,32,97,110,
+100,114,101,115,117,108,116,101,100,32,105,110,32,116,104,101,99,111,108,108,97,
+112,115,101,32,111,102,32,116,104,101,84,104,105,115,32,109,101,97,110,115,32,
+116,104,97,116,101,108,101,109,101,110,116,115,32,111,102,32,116,104,101,119,97,
+115,32,114,101,112,108,97,99,101,100,32,98,121,97,110,97,108,121,115,105,115,32,
+111,102,32,116,104,101,105,110,115,112,105,114,97,116,105,111,110,32,102,111,114
+,114,101,103,97,114,100,101,100,32,97,115,32,116,104,101,109,111,115,116,32,115,
+117,99,99,101,115,115,102,117,108,107,110,111,119,110,32,97,115,32,38,113,117,
+111,116,59,97,32,99,111,109,112,114,101,104,101,110,115,105,118,101,72,105,115,
+116,111,114,121,32,111,102,32,116,104,101,32,119,101,114,101,32,99,111,110,115,
+105,100,101,114,101,100,114,101,116,117,114,110,101,100,32,116,111,32,116,104,
+101,97,114,101,32,114,101,102,101,114,114,101,100,32,116,111,85,110,115,111,117,
+114,99,101,100,32,105,109,97,103,101,62,10,9,60,100,105,118,32,99,108,97,115,115
+,61,34,99,111,110,115,105,115,116,115,32,111,102,32,116,104,101,115,116,111,112,
+80,114,111,112,97,103,97,116,105,111,110,105,110,116,101,114,101,115,116,32,105,
+110,32,116,104,101,97,118,97,105,108,97,98,105,108,105,116,121,32,111,102,97,112
+,112,101,97,114,115,32,116,111,32,104,97,118,101,101,108,101,99,116,114,111,109,
+97,103,110,101,116,105,99,101,110,97,98,108,101,83,101,114,118,105,99,101,115,40
+,102,117,110,99,116,105,111,110,32,111,102,32,116,104,101,73,116,32,105,115,32,
+105,109,112,111,114,116,97,110,116,60,47,115,99,114,105,112,116,62,60,47,100,105
+,118,62,102,117,110,99,116,105,111,110,40,41,123,118,97,114,32,114,101,108,97,
+116,105,118,101,32,116,111,32,116,104,101,97,115,32,97,32,114,101,115,117,108,
+116,32,111,102,32,116,104,101,32,112,111,115,105,116,105,111,110,32,111,102,70,
+111,114,32,101,120,97,109,112,108,101,44,32,105,110,32,109,101,116,104,111,100,
+61,34,112,111,115,116,34,32,119,97,115,32,102,111,108,108,111,119,101,100,32,98,
+121,38,97,109,112,59,109,100,97,115,104,59,32,116,104,101,116,104,101,32,97,112,
+112,108,105,99,97,116,105,111,110,106,115,34,62,60,47,115,99,114,105,112,116,62,
+13,10,117,108,62,60,47,100,105,118,62,60,47,100,105,118,62,97,102,116,101,114,32
+,116,104,101,32,100,101,97,116,104,119,105,116,104,32,114,101,115,112,101,99,116
+,32,116,111,115,116,121,108,101,61,34,112,97,100,100,105,110,103,58,105,115,32,
+112,97,114,116,105,99,117,108,97,114,108,121,100,105,115,112,108,97,121,58,105,
+110,108,105,110,101,59,32,116,121,112,101,61,34,115,117,98,109,105,116,34,32,105
+,115,32,100,105,118,105,100,101,100,32,105,110,116,111,228,184,173,230,150,135,
+32,40,231,174,128,228,189,147,41,114,101,115,112,111,110,115,97,98,105,108,105,
+100,97,100,97,100,109,105,110,105,115,116,114,97,99,105,195,179,110,105,110,116,
+101,114,110,97,99,105,111,110,97,108,101,115,99,111,114,114,101,115,112,111,110,
+100,105,101,110,116,101,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,135,114,115,115,43,120,109,108,34,32,116
+,105,116,108,101,61,34,45,116,121,112,101,34,32,99,111,110,116,101,110,116,61,34
+,116,105,116,108,101,34,32,99,111,110,116,101,110,116,61,34,97,116,32,116,104,
+101,32,115,97,109,101,32,116,105,109,101,46,106,115,34,62,60,47,115,99,114,105,
+112,116,62,10,60,34,32,109,101,116,104,111,100,61,34,112,111,115,116,34,32,60,47
+,115,112,97,110,62,60,47,97,62,60,47,108,105,62,118,101,114,116,105,99,97,108,45
+,97,108,105,103,110,58,116,47,106,113,117,101,114,121,46,109,105,110,46,106,115,
+34,62,46,99,108,105,99,107,40,102,117,110,99,116,105,111,110,40,32,115,116,121,
+108,101,61,34,112,97,100,100,105,110,103,45,125,41,40,41,59,10,60,47,115,99,114,
+105,112,116,62,10,60,47,115,112,97,110,62,60,97,32,104,114,101,102,61,34,60,97,
+32,104,114,101,102,61,34,104,116,116,112,58,47,47,41,59,32,114,101,116,117,114,
+110,32,102,97,108,115,101,59,116,101,120,116,45,100,101,99,111,114,97,116,105,
+111,110,58,32,115,99,114,111,108,108,105,110,103,61,34,110,111,34,32,98,111,114,
+100,101,114,45,99,111,108,108,97,112,115,101,58,97,115,115,111,99,105,97,116,101
+,100,32,119,105,116,104,32,66,97,104,97,115,97,32,73,110,100,111,110,101,115,105
+,97,69,110,103,108,105,115,104,32,108,97,110,103,117,97,103,101,60,116,101,120,
+116,32,120,109,108,58,115,112,97,99,101,61,46,103,105,102,34,32,98,111,114,100,
+101,114,61,34,48,34,60,47,98,111,100,121,62,10,60,47,104,116,109,108,62,10,111,
+118,101,114,102,108,111,119,58,104,105,100,100,101,110,59,105,109,103,32,115,114
+,99,61,34,104,116,116,112,58,47,47,97,100,100,69,118,101,110,116,76,105,115,116,
+101,110,101,114,114,101,115,112,111,110,115,105,98,108,101,32,102,111,114,32,115
+,46,106,115,34,62,60,47,115,99,114,105,112,116,62,10,47,102,97,118,105,99,111,
+110,46,105,99,111,34,32,47,62,111,112,101,114,97,116,105,110,103,32,115,121,115,
+116,101,109,34,32,115,116,121,108,101,61,34,119,105,100,116,104,58,49,116,97,114
+,103,101,116,61,34,95,98,108,97,110,107,34,62,83,116,97,116,101,32,85,110,105,
+118,101,114,115,105,116,121,116,101,120,116,45,97,108,105,103,110,58,108,101,102
+,116,59,10,100,111,99,117,109,101,110,116,46,119,114,105,116,101,40,44,32,105,
+110,99,108,117,100,105,110,103,32,116,104,101,32,97,114,111,117,110,100,32,116,
+104,101,32,119,111,114,108,100,41,59,13,10,60,47,115,99,114,105,112,116,62,13,10
+,60,34,32,115,116,121,108,101,61,34,104,101,105,103,104,116,58,59,111,118,101,
+114,102,108,111,119,58,104,105,100,100,101,110,109,111,114,101,32,105,110,102,
+111,114,109,97,116,105,111,110,97,110,32,105,110,116,101,114,110,97,116,105,111,
+110,97,108,97,32,109,101,109,98,101,114,32,111,102,32,116,104,101,32,111,110,101
+,32,111,102,32,116,104,101,32,102,105,114,115,116,99,97,110,32,98,101,32,102,111
+,117,110,100,32,105,110,32,60,47,100,105,118,62,10,9,9,60,47,100,105,118,62,10,
+100,105,115,112,108,97,121,58,32,110,111,110,101,59,34,62,34,32,47,62,10,60,108,
+105,110,107,32,114,101,108,61,34,10,32,32,40,102,117,110,99,116,105,111,110,40,
+41,32,123,116,104,101,32,49,53,116,104,32,99,101,110,116,117,114,121,46,112,114,
+101,118,101,110,116,68,101,102,97,117,108,116,40,108,97,114,103,101,32,110,117,
+109,98,101,114,32,111,102,32,66,121,122,97,110,116,105,110,101,32,69,109,112,105
+,114,101,46,106,112,103,124,116,104,117,109,98,124,108,101,102,116,124,118,97,
+115,116,32,109,97,106,111,114,105,116,121,32,111,102,109,97,106,111,114,105,116,
+121,32,111,102,32,116,104,101,32,32,97,108,105,103,110,61,34,99,101,110,116,101,
+114,34,62,85,110,105,118,101,114,115,105,116,121,32,80,114,101,115,115,100,111,
+109,105,110,97,116,101,100,32,98,121,32,116,104,101,83,101,99,111,110,100,32,87,
+111,114,108,100,32,87,97,114,100,105,115,116,114,105,98,117,116,105,111,110,32,
+111,102,32,115,116,121,108,101,61,34,112,111,115,105,116,105,111,110,58,116,104,
+101,32,114,101,115,116,32,111,102,32,116,104,101,32,99,104,97,114,97,99,116,101,
+114,105,122,101,100,32,98,121,32,114,101,108,61,34,110,111,102,111,108,108,111,
+119,34,62,100,101,114,105,118,101,115,32,102,114,111,109,32,116,104,101,114,97,
+116,104,101,114,32,116,104,97,110,32,116,104,101,32,97,32,99,111,109,98,105,110,
+97,116,105,111,110,32,111,102,115,116,121,108,101,61,34,119,105,100,116,104,58,
+49,48,48,69,110,103,108,105,115,104,45,115,112,101,97,107,105,110,103,99,111,109
+,112,117,116,101,114,32,115,99,105,101,110,99,101,98,111,114,100,101,114,61,34,
+48,34,32,97,108,116,61,34,116,104,101,32,101,120,105,115,116,101,110,99,101,32,
+111,102,68,101,109,111,99,114,97,116,105,99,32,80,97,114,116,121,34,32,115,116,
+121,108,101,61,34,109,97,114,103,105,110,45,70,111,114,32,116,104,105,115,32,114
+,101,97,115,111,110,44,46,106,115,34,62,60,47,115,99,114,105,112,116,62,10,9,115
+,66,121,84,97,103,78,97,109,101,40,115,41,91,48,93,106,115,34,62,60,47,115,99,
+114,105,112,116,62,13,10,60,46,106,115,34,62,60,47,115,99,114,105,112,116,62,13,
+10,108,105,110,107,32,114,101,108,61,34,105,99,111,110,34,32,39,32,97,108,116,61
+,39,39,32,99,108,97,115,115,61,39,102,111,114,109,97,116,105,111,110,32,111,102,
+32,116,104,101,118,101,114,115,105,111,110,115,32,111,102,32,116,104,101,32,60,
+47,97,62,60,47,100,105,118,62,60,47,100,105,118,62,47,112,97,103,101,62,10,32,32
+,60,112,97,103,101,62,10,60,100,105,118,32,99,108,97,115,115,61,34,99,111,110,
+116,98,101,99,97,109,101,32,116,104,101,32,102,105,114,115,116,98,97,104,97,115,
+97,32,73,110,100,111,110,101,115,105,97,101,110,103,108,105,115,104,32,40,115,
+105,109,112,108,101,41,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,170,114,111,
+98,111,116,115,34,32,99,111,110,116,101,110,116,61,34,60,100,105,118,32,105,100,
+61,34,102,111,111,116,101,114,34,62,116,104,101,32,85,110,105,116,101,100,32,83,
+116,97,116,101,115,60,105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,
+46,106,112,103,124,114,105,103,104,116,124,116,104,117,109,98,124,46,106,115,34,
+62,60,47,115,99,114,105,112,116,62,13,10,60,108,111,99,97,116,105,111,110,46,112
+,114,111,116,111,99,111,108,102,114,97,109,101,98,111,114,100,101,114,61,34,48,
+34,32,115,34,32,47,62,10,60,109,101,116,97,32,110,97,109,101,61,34,60,47,97,62,
+60,47,100,105,118,62,60,47,100,105,118,62,60,102,111,110,116,45,119,101,105,103,
+104,116,58,98,111,108,100,59,38,113,117,111,116,59,32,97,110,100,32,38,113,117,
+111,116,59,100,101,112,101,110,100,105,110,103,32,111,110,32,116,104,101,32,109,
+97,114,103,105,110,58,48,59,112,97,100,100,105,110,103,58,34,32,114,101,108,61,
+34,110,111,102,111,108,108,111,119,34,32,80,114,101,115,105,100,101,110,116,32,
+111,102,32,116,104,101,32,116,119,101,110,116,105,101,116,104,32,99,101,110,116,
+117,114,121,101,118,105,115,105,111,110,62,10,32,32,60,47,112,97,103,101,73,110,
+116,101,114,110,101,116,32,69,120,112,108,111,114,101,114,97,46,97,115,121,110,
+99,32,61,32,116,114,117,101,59,13,10,105,110,102,111,114,109,97,116,105,111,110,
+32,97,98,111,117,116,60,100,105,118,32,105,100,61,34,104,101,97,100,101,114,34,
+62,34,32,97,99,116,105,111,110,61,34,104,116,116,112,58,47,47,60,97,32,104,114,
+101,102,61,34,104,116,116,112,115,58,47,47,60,100,105,118,32,105,100,61,34,99,
+111,110,116,101,110,116,34,60,47,100,105,118,62,13,10,60,47,100,105,118,62,13,10
+,60,100,101,114,105,118,101,100,32,102,114,111,109,32,116,104,101,32,60,105,109,
+103,32,115,114,99,61,39,104,116,116,112,58,47,47,97,99,99,111,114,100,105,110,
+103,32,116,111,32,116,104,101,32,10,60,47,98,111,100,121,62,10,60,47,104,116,109
+,108,62,10,115,116,121,108,101,61,34,102,111,110,116,45,115,105,122,101,58,115,
+99,114,105,112,116,32,108,97,110,103,117,97,103,101,61,34,65,114,105,97,108,44,
+32,72,101,108,118,101,116,105,99,97,44,60,47,97,62,60,115,112,97,110,32,99,108,
+97,115,115,61,34,60,47,115,99,114,105,112,116,62,60,115,99,114,105,112,116,32,
+112,111,108,105,116,105,99,97,108,32,112,97,114,116,105,101,115,116,100,62,60,47
+,116,114,62,60,47,116,97,98,108,101,62,60,104,114,101,102,61,34,104,116,116,112,
+58,47,47,119,119,119,46,105,110,116,101,114,112,114,101,116,97,116,105,111,110,
+32,111,102,114,101,108,61,34,115,116,121,108,101,115,104,101,101,116,34,32,100,
+111,99,117,109,101,110,116,46,119,114,105,116,101,40,39,60,99,104,97,114,115,101
+,116,61,34,117,116,102,45,56,34,62,10,98,101,103,105,110,110,105,110,103,32,111,
+102,32,116,104,101,32,114,101,118,101,97,108,101,100,32,116,104,97,116,32,116,
+104,101,116,101,108,101,118,105,115,105,111,110,32,115,101,114,105,101,115,34,32
+,114,101,108,61,34,110,111,102,111,108,108,111,119,34,62,32,116,97,114,103,101,
+116,61,34,95,98,108,97,110,107,34,62,99,108,97,105,109,105,110,103,32,116,104,97
+,116,32,116,104,101,104,116,116,112,37,51,65,37,50,70,37,50,70,119,119,119,46,
+109,97,110,105,102,101,115,116,97,116,105,111,110,115,32,111,102,80,114,105,109,
+101,32,77,105,110,105,115,116,101,114,32,111,102,105,110,102,108,117,101,110,99,
+101,100,32,98,121,32,116,104,101,99,108,97,115,115,61,34,99,108,101,97,114,102,
+105,120,34,62,47,100,105,118,62,13,10,60,47,100,105,118,62,13,10,13,10,116,104,
+114,101,101,45,100,105,109,101,110,115,105,111,110,97,108,67,104,117,114,99,104,
+32,111,102,32,69,110,103,108,97,110,100,111,102,32,78,111,114,116,104,32,67,97,
+114,111,108,105,110,97,115,113,117,97,114,101,32,107,105,108,111,109,101,116,114
+,101,115,46,97,100,100,69,118,101,110,116,76,105,115,116,101,110,101,114,100,105
+,115,116,105,110,99,116,32,102,114,111,109,32,116,104,101,99,111,109,109,111,110
+,108,121,32,107,110,111,119,110,32,97,115,80,104,111,110,101,116,105,99,32,65,
+108,112,104,97,98,101,116,100,101,99,108,97,114,101,100,32,116,104,97,116,32,116
+,104,101,99,111,110,116,114,111,108,108,101,100,32,98,121,32,116,104,101,66,101,
+110,106,97,109,105,110,32,70,114,97,110,107,108,105,110,114,111,108,101,45,112,
+108,97,121,105,110,103,32,103,97,109,101,116,104,101,32,85,110,105,118,101,114,
+115,105,116,121,32,111,102,105,110,32,87,101,115,116,101,114,110,32,69,117,114,
+111,112,101,112,101,114,115,111,110,97,108,32,99,111,109,112,117,116,101,114,80,
+114,111,106,101,99,116,32,71,117,116,101,110,98,101,114,103,114,101,103,97,114,
+100,108,101,115,115,32,111,102,32,116,104,101,104,97,115,32,98,101,101,110,32,
+112,114,111,112,111,115,101,100,116,111,103,101,116,104,101,114,32,119,105,116,
+104,32,116,104,101,62,60,47,108,105,62,60,108,105,32,99,108,97,115,115,61,34,105
+,110,32,115,111,109,101,32,99,111,117,110,116,114,105,101,115,109,105,110,46,106
+,115,34,62,60,47,115,99,114,105,112,116,62,111,102,32,116,104,101,32,112,111,112
+,117,108,97,116,105,111,110,111,102,102,105,99,105,97,108,32,108,97,110,103,117,
+97,103,101,60,105,109,103,32,115,114,99,61,34,105,109,97,103,101,115,47,105,100,
+101,110,116,105,102,105,101,100,32,98,121,32,116,104,101,110,97,116,117,114,97,
+108,32,114,101,115,111,117,114,99,101,115,99,108,97,115,115,105,102,105,99,97,
+116,105,111,110,32,111,102,99,97,110,32,98,101,32,99,111,110,115,105,100,101,114
+,101,100,113,117,97,110,116,117,109,32,109,101,99,104,97,110,105,99,115,78,101,
+118,101,114,116,104,101,108,101,115,115,44,32,116,104,101,109,105,108,108,105,
+111,110,32,121,101,97,114,115,32,97,103,111,60,47,98,111,100,121,62,13,10,60,47,
+104,116,109,108,62,13,206,149,206,187,206,187,206,183,206,189,206,185,206,186,
+206,172,10,116,97,107,101,32,97,100,118,97,110,116,97,103,101,32,111,102,97,110,
+100,44,32,97,99,99,111,114,100,105,110,103,32,116,111,97,116,116,114,105,98,117,
+116,101,100,32,116,111,32,116,104,101,77,105,99,114,111,115,111,102,116,32,87,
+105,110,100,111,119,115,116,104,101,32,102,105,114,115,116,32,99,101,110,116,117
+,114,121,117,110,100,101,114,32,116,104,101,32,99,111,110,116,114,111,108,100,
+105,118,32,99,108,97,115,115,61,34,104,101,97,100,101,114,115,104,111,114,116,
+108,121,32,97,102,116,101,114,32,116,104,101,110,111,116,97,98,108,101,32,101,
+120,99,101,112,116,105,111,110,116,101,110,115,32,111,102,32,116,104,111,117,115
+,97,110,100,115,115,101,118,101,114,97,108,32,100,105,102,102,101,114,101,110,
+116,97,114,111,117,110,100,32,116,104,101,32,119,111,114,108,100,46,114,101,97,
+99,104,105,110,103,32,109,105,108,105,116,97,114,121,105,115,111,108,97,116,101,
+100,32,102,114,111,109,32,116,104,101,111,112,112,111,115,105,116,105,111,110,32
+,116,111,32,116,104,101,116,104,101,32,79,108,100,32,84,101,115,116,97,109,101,
+110,116,65,102,114,105,99,97,110,32,65,109,101,114,105,99,97,110,115,105,110,115
+,101,114,116,101,100,32,105,110,116,111,32,116,104,101,115,101,112,97,114,97,116
+,101,32,102,114,111,109,32,116,104,101,109,101,116,114,111,112,111,108,105,116,
+97,110,32,97,114,101,97,109,97,107,101,115,32,105,116,32,112,111,115,115,105,98,
+108,101,97,99,107,110,111,119,108,101,100,103,101,100,32,116,104,97,116,97,114,
+103,117,97,98,108,121,32,116,104,101,32,109,111,115,116,116,121,112,101,61,34,
+116,101,120,116,47,99,115,115,34,62,10,116,104,101,32,73,110,116,101,114,110,97,
+116,105,111,110,97,108,65,99,99,111,114,100,105,110,103,32,116,111,32,116,104,
+101,32,112,101,61,34,116,101,120,116,47,99,115,115,34,32,47,62,10,99,111,105,110
+,99,105,100,101,32,119,105,116,104,32,116,104,101,116,119,111,45,116,104,105,114
+,100,115,32,111,102,32,116,104,101,68,117,114,105,110,103,32,116,104,105,115,32,
+116,105,109,101,44,100,117,114,105,110,103,32,116,104,101,32,112,101,114,105,111
+,100,97,110,110,111,117,110,99,101,100,32,116,104,97,116,32,104,101,116,104,101,
+32,105,110,116,101,114,110,97,116,105,111,110,97,108,97,110,100,32,109,111,114,
+101,32,114,101,99,101,110,116,108,121,98,101,108,105,101,118,101,100,32,116,104,
+97,116,32,116,104,101,99,111,110,115,99,105,111,117,115,110,101,115,115,32,97,
+110,100,102,111,114,109,101,114,108,121,32,107,110,111,119,110,32,97,115,115,117
+,114,114,111,117,110,100,101,100,32,98,121,32,116,104,101,102,105,114,115,116,32
+,97,112,112,101,97,114,101,100,32,105,110,111,99,99,97,115,105,111,110,97,108,
+108,121,32,117,115,101,100,112,111,115,105,116,105,111,110,58,97,98,115,111,108,
+117,116,101,59,34,32,116,97,114,103,101,116,61,34,95,98,108,97,110,107,34,32,112
+,111,115,105,116,105,111,110,58,114,101,108,97,116,105,118,101,59,116,101,120,
+116,45,97,108,105,103,110,58,99,101,110,116,101,114,59,106,97,120,47,108,105,98,
+115,47,106,113,117,101,114,121,47,49,46,98,97,99,107,103,114,111,117,110,100,45,
+99,111,108,111,114,58,35,116,121,112,101,61,34,97,112,112,108,105,99,97,116,105,
+111,110,47,97,110,103,117,97,103,101,34,32,99,111,110,116,101,110,116,61,34,60,
+109,101,116,97,32,104,116,116,112,45,101,113,117,105,118,61,34,80,114,105,118,97
+,99,121,32,80,111,108,105,99,121,60,47,97,62,101,40,34,37,51,67,115,99,114,105,
+112,116,32,115,114,99,61,39,34,32,116,97,114,103,101,116,61,34,95,98,108,97,110,
+107,34,62,79,110,32,116,104,101,32,111,116,104,101,114,32,104,97,110,100,44,46,
+106,112,103,124,116,104,117,109,98,124,114,105,103,104,116,124,50,60,47,100,105,
+118,62,60,100,105,118,32,99,108,97,115,115,61,34,60,100,105,118,32,115,116,121,
+108,101,61,34,102,108,111,97,116,58,110,105,110,101,116,101,101,110,116,104,32,
+99,101,110,116,117,114,121,60,47,98,111,100,121,62,13,10,60,47,104,116,109,108,
+62,13,10,60,105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,115,59,116,
+101,120,116,45,97,108,105,103,110,58,99,101,110,116,101,114,102,111,110,116,45,
+119,101,105,103,104,116,58,32,98,111,108,100,59,32,65,99,99,111,114,100,105,110,
+103,32,116,111,32,116,104,101,32,100,105,102,102,101,114,101,110,99,101,32,98,
+101,116,119,101,101,110,34,32,102,114,97,109,101,98,111,114,100,101,114,61,34,48
+,34,32,34,32,115,116,121,108,101,61,34,112,111,115,105,116,105,111,110,58,108,
+105,110,107,32,104,114,101,102,61,34,104,116,116,112,58,47,47,104,116,109,108,52
+,47,108,111,111,115,101,46,100,116,100,34,62,10,100,117,114,105,110,103,32,116,
+104,105,115,32,112,101,114,105,111,100,60,47,116,100,62,60,47,116,114,62,60,47,
+116,97,98,108,101,62,99,108,111,115,101,108,121,32,114,101,108,97,116,101,100,32
+,116,111,102,111,114,32,116,104,101,32,102,105,114,115,116,32,116,105,109,101,59
+,102,111,110,116,45,119,101,105,103,104,116,58,98,111,108,100,59,105,110,112,117
+,116,32,116,121,112,101,61,34,116,101,120,116,34,32,60,115,112,97,110,32,115,116
+,121,108,101,61,34,102,111,110,116,45,111,110,114,101,97,100,121,115,116,97,116,
+101,99,104,97,110,103,101,9,60,100,105,118,32,99,108,97,115,115,61,34,99,108,101
+,97,114,100,111,99,117,109,101,110,116,46,108,111,99,97,116,105,111,110,46,32,70
+,111,114,32,101,120,97,109,112,108,101,44,32,116,104,101,32,97,32,119,105,100,
+101,32,118,97,114,105,101,116,121,32,111,102,32,60,33,68,79,67,84,89,80,69,32,
+104,116,109,108,62,13,10,60,38,110,98,115,112,59,38,110,98,115,112,59,38,110,98,
+115,112,59,34,62,60,97,32,104,114,101,102,61,34,104,116,116,112,58,47,47,115,116
+,121,108,101,61,34,102,108,111,97,116,58,108,101,102,116,59,99,111,110,99,101,
+114,110,101,100,32,119,105,116,104,32,116,104,101,61,104,116,116,112,37,51,65,37
+,50,70,37,50,70,119,119,119,46,105,110,32,112,111,112,117,108,97,114,32,99,117,
+108,116,117,114,101,116,121,112,101,61,34,116,101,120,116,47,99,115,115,34,32,47
+,62,105,116,32,105,115,32,112,111,115,115,105,98,108,101,32,116,111,32,72,97,114
+,118,97,114,100,32,85,110,105,118,101,114,115,105,116,121,116,121,108,101,115,
+104,101,101,116,34,32,104,114,101,102,61,34,47,116,104,101,32,109,97,105,110,32,
+99,104,97,114,97,99,116,101,114,79,120,102,111,114,100,32,85,110,105,118,101,114
+,115,105,116,121,32,32,110,97,109,101,61,34,107,101,121,119,111,114,100,115,34,
+32,99,115,116,121,108,101,61,34,116,101,120,116,45,97,108,105,103,110,58,116,104
+,101,32,85,110,105,116,101,100,32,75,105,110,103,100,111,109,102,101,100,101,114
+,97,108,32,103,111,118,101,114,110,109,101,110,116,60,100,105,118,32,115,116,121
+,108,101,61,34,109,97,114,103,105,110,32,100,101,112,101,110,100,105,110,103,32,
+111,110,32,116,104,101,32,100,101,115,99,114,105,112,116,105,111,110,32,111,102,
+32,116,104,101,60,100,105,118,32,99,108,97,115,115,61,34,104,101,97,100,101,114,
+46,109,105,110,46,106,115,34,62,60,47,115,99,114,105,112,116,62,100,101,115,116,
+114,117,99,116,105,111,110,32,111,102,32,116,104,101,115,108,105,103,104,116,108
+,121,32,100,105,102,102,101,114,101,110,116,105,110,32,97,99,99,111,114,100,97,
+110,99,101,32,119,105,116,104,116,101,108,101,99,111,109,109,117,110,105,99,97,
+116,105,111,110,115,105,110,100,105,99,97,116,101,115,32,116,104,97,116,32,116,
+104,101,115,104,111,114,116,108,121,32,116,104,101,114,101,97,102,116,101,114,
+101,115,112,101,99,105,97,108,108,121,32,105,110,32,116,104,101,32,69,117,114,
+111,112,101,97,110,32,99,111,117,110,116,114,105,101,115,72,111,119,101,118,101,
+114,44,32,116,104,101,114,101,32,97,114,101,115,114,99,61,34,104,116,116,112,58,
+47,47,115,116,97,116,105,99,115,117,103,103,101,115,116,101,100,32,116,104,97,
+116,32,116,104,101,34,32,115,114,99,61,34,104,116,116,112,58,47,47,119,119,119,
+46,97,32,108,97,114,103,101,32,110,117,109,98,101,114,32,111,102,32,84,101,108,
+101,99,111,109,109,117,110,105,99,97,116,105,111,110,115,34,32,114,101,108,61,34
+,110,111,102,111,108,108,111,119,34,32,116,72,111,108,121,32,82,111,109,97,110,
+32,69,109,112,101,114,111,114,97,108,109,111,115,116,32,101,120,99,108,117,115,
+105,118,101,108,121,34,32,98,111,114,100,101,114,61,34,48,34,32,97,108,116,61,34
+,83,101,99,114,101,116,97,114,121,32,111,102,32,83,116,97,116,101,99,117,108,109
+,105,110,97,116,105,110,103,32,105,110,32,116,104,101,67,73,65,32,87,111,114,108
+,100,32,70,97,99,116,98,111,111,107,116,104,101,32,109,111,115,116,32,105,109,
+112,111,114,116,97,110,116,97,110,110,105,118,101,114,115,97,114,121,32,111,102,
+32,116,104,101,115,116,121,108,101,61,34,98,97,99,107,103,114,111,117,110,100,45
+,60,108,105,62,60,101,109,62,60,97,32,104,114,101,102,61,34,47,116,104,101,32,65
+,116,108,97,110,116,105,99,32,79,99,101,97,110,115,116,114,105,99,116,108,121,32
+,115,112,101,97,107,105,110,103,44,115,104,111,114,116,108,121,32,98,101,102,111
+,114,101,32,116,104,101,100,105,102,102,101,114,101,110,116,32,116,121,112,101,
+115,32,111,102,116,104,101,32,79,116,116,111,109,97,110,32,69,109,112,105,114,
+101,62,60,105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,65,110,32,73,
+110,116,114,111,100,117,99,116,105,111,110,32,116,111,99,111,110,115,101,113,117
+,101,110,99,101,32,111,102,32,116,104,101,100,101,112,97,114,116,117,114,101,32,
+102,114,111,109,32,116,104,101,67,111,110,102,101,100,101,114,97,116,101,32,83,
+116,97,116,101,115,105,110,100,105,103,101,110,111,117,115,32,112,101,111,112,
+108,101,115,80,114,111,99,101,101,100,105,110,103,115,32,111,102,32,116,104,101,
+105,110,102,111,114,109,97,116,105,111,110,32,111,110,32,116,104,101,116,104,101
+,111,114,105,101,115,32,104,97,118,101,32,98,101,101,110,105,110,118,111,108,118
+,101,109,101,110,116,32,105,110,32,116,104,101,100,105,118,105,100,101,100,32,
+105,110,116,111,32,116,104,114,101,101,97,100,106,97,99,101,110,116,32,99,111,
+117,110,116,114,105,101,115,105,115,32,114,101,115,112,111,110,115,105,98,108,
+101,32,102,111,114,100,105,115,115,111,108,117,116,105,111,110,32,111,102,32,116
+,104,101,99,111,108,108,97,98,111,114,97,116,105,111,110,32,119,105,116,104,119,
+105,100,101,108,121,32,114,101,103,97,114,100,101,100,32,97,115,104,105,115,32,
+99,111,110,116,101,109,112,111,114,97,114,105,101,115,102,111,117,110,100,105,
+110,103,32,109,101,109,98,101,114,32,111,102,68,111,109,105,110,105,99,97,110,32
+,82,101,112,117,98,108,105,99,103,101,110,101,114,97,108,108,121,32,97,99,99,101
+,112,116,101,100,116,104,101,32,112,111,115,115,105,98,105,108,105,116,121,32,
+111,102,97,114,101,32,97,108,115,111,32,97,118,97,105,108,97,98,108,101,117,110,
+100,101,114,32,99,111,110,115,116,114,117,99,116,105,111,110,114,101,115,116,111
+,114,97,116,105,111,110,32,111,102,32,116,104,101,116,104,101,32,103,101,110,101
+,114,97,108,32,112,117,98,108,105,99,105,115,32,97,108,109,111,115,116,32,101,
+110,116,105,114,101,108,121,112,97,115,115,101,115,32,116,104,114,111,117,103,
+104,32,116,104,101,104,97,115,32,98,101,101,110,32,115,117,103,103,101,115,116,
+101,100,99,111,109,112,117,116,101,114,32,97,110,100,32,118,105,100,101,111,71,
+101,114,109,97,110,105,99,32,108,97,110,103,117,97,103,101,115,32,97,99,99,111,
+114,100,105,110,103,32,116,111,32,116,104,101,32,100,105,102,102,101,114,101,110
+,116,32,102,114,111,109,32,116,104,101,115,104,111,114,116,108,121,32,97,102,116
+,101,114,119,97,114,100,115,104,114,101,102,61,34,104,116,116,112,115,58,47,47,
+119,119,119,46,114,101,99,101,110,116,32,100,101,118,101,108,111,112,109,101,110
+,116,66,111,97,114,100,32,111,102,32,68,105,114,101,99,116,111,114,115,60,100,
+105,118,32,99,108,97,115,115,61,34,115,101,97,114,99,104,124,32,60,97,32,104,114
+,101,102,61,34,104,116,116,112,58,47,47,73,110,32,112,97,114,116,105,99,117,108,
+97,114,44,32,116,104,101,77,117,108,116,105,112,108,101,32,102,111,111,116,110,
+111,116,101,115,111,114,32,111,116,104,101,114,32,115,117,98,115,116,97,110,99,
+101,116,104,111,117,115,97,110,100,115,32,111,102,32,121,101,97,114,115,116,114,
+97,110,115,108,97,116,105,111,110,32,111,102,32,116,104,101,60,47,100,105,118,62
+,13,10,60,47,100,105,118,62,13,10,13,10,60,97,32,104,114,101,102,61,34,105,110,
+100,101,120,46,112,104,112,119,97,115,32,101,115,116,97,98,108,105,115,104,101,
+100,32,105,110,109,105,110,46,106,115,34,62,60,47,115,99,114,105,112,116,62,10,
+112,97,114,116,105,99,105,112,97,116,101,32,105,110,32,116,104,101,97,32,115,116
+,114,111,110,103,32,105,110,102,108,117,101,110,99,101,115,116,121,108,101,61,34
+,109,97,114,103,105,110,45,116,111,112,58,114,101,112,114,101,115,101,110,116,
+101,100,32,98,121,32,116,104,101,103,114,97,100,117,97,116,101,100,32,102,114,
+111,109,32,116,104,101,84,114,97,100,105,116,105,111,110,97,108,108,121,44,32,
+116,104,101,69,108,101,109,101,110,116,40,34,115,99,114,105,112,116,34,41,59,72,
+111,119,101,118,101,114,44,32,115,105,110,99,101,32,116,104,101,47,100,105,118,
+62,10,60,47,100,105,118,62,10,60,100,105,118,32,108,101,102,116,59,32,109,97,114
+,103,105,110,45,108,101,102,116,58,112,114,111,116,101,99,116,105,111,110,32,97,
+103,97,105,110,115,116,48,59,32,118,101,114,116,105,99,97,108,45,97,108,105,103,
+110,58,85,110,102,111,114,116,117,110,97,116,101,108,121,44,32,116,104,101,116,
+121,112,101,61,34,105,109,97,103,101,47,120,45,105,99,111,110,47,100,105,118,62,
+10,60,100,105,118,32,99,108,97,115,115,61,34,32,99,108,97,115,115,61,34,99,108,
+101,97,114,102,105,120,34,62,60,100,105,118,32,99,108,97,115,115,61,34,102,111,
+111,116,101,114,9,9,60,47,100,105,118,62,10,9,9,60,47,100,105,118,62,10,116,104,
+101,32,109,111,116,105,111,110,32,112,105,99,116,117,114,101,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,170,107,101,121
+,119,111,114,100,115,34,32,99,111,110,116,101,110,116,61,34,119,51,46,111,114,
+103,47,49,57,57,57,47,120,104,116,109,108,34,62,60,97,32,116,97,114,103,101,116,
+61,34,95,98,108,97,110,107,34,32,116,101,120,116,47,104,116,109,108,59,32,99,104
+,97,114,115,101,116,61,34,32,116,97,114,103,101,116,61,34,95,98,108,97,110,107,
+34,62,60,116,97,98,108,101,32,99,101,108,108,112,97,100,100,105,110,103,61,34,97
+,117,116,111,99,111,109,112,108,101,116,101,61,34,111,102,102,34,32,116,101,120,
+116,45,97,108,105,103,110,58,32,99,101,110,116,101,114,59,116,111,32,108,97,115,
+116,32,118,101,114,115,105,111,110,32,98,121,32,98,97,99,107,103,114,111,117,110
+,100,45,99,111,108,111,114,58,32,35,34,32,104,114,101,102,61,34,104,116,116,112,
+58,47,47,119,119,119,46,47,100,105,118,62,60,47,100,105,118,62,60,100,105,118,32
+,105,100,61,60,97,32,104,114,101,102,61,34,35,34,32,99,108,97,115,115,61,34,34,
+62,60,105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,99,114,105,112,
+116,34,32,115,114,99,61,34,104,116,116,112,58,47,47,10,60,115,99,114,105,112,116
+,32,108,97,110,103,117,97,103,101,61,34,47,47,69,78,34,32,34,104,116,116,112,58,
+47,47,119,119,119,46,119,101,110,99,111,100,101,85,82,73,67,111,109,112,111,110,
+101,110,116,40,34,32,104,114,101,102,61,34,106,97,118,97,115,99,114,105,112,116,
+58,60,100,105,118,32,99,108,97,115,115,61,34,99,111,110,116,101,110,116,100,111,
+99,117,109,101,110,116,46,119,114,105,116,101,40,39,60,115,99,112,111,115,105,
+116,105,111,110,58,32,97,98,115,111,108,117,116,101,59,115,99,114,105,112,116,32
+,115,114,99,61,34,104,116,116,112,58,47,47,32,115,116,121,108,101,61,34,109,97,
+114,103,105,110,45,116,111,112,58,46,109,105,110,46,106,115,34,62,60,47,115,99,
+114,105,112,116,62,10,60,47,100,105,118,62,10,60,100,105,118,32,99,108,97,115,
+115,61,34,119,51,46,111,114,103,47,49,57,57,57,47,120,104,116,109,108,34,32,10,
+13,10,60,47,98,111,100,121,62,13,10,60,47,104,116,109,108,62,100,105,115,116,105
+,110,99,116,105,111,110,32,98,101,116,119,101,101,110,47,34,32,116,97,114,103,
+101,116,61,34,95,98,108,97,110,107,34,62,60,108,105,110,107,32,104,114,101,102,
+61,34,104,116,116,112,58,47,47,101,110,99,111,100,105,110,103,61,34,117,116,102,
+45,56,34,63,62,10,119,46,97,100,100,69,118,101,110,116,76,105,115,116,101,110,
+101,114,63,97,99,116,105,111,110,61,34,104,116,116,112,58,47,47,119,119,119,46,
+105,99,111,110,34,32,104,114,101,102,61,34,104,116,116,112,58,47,47,32,115,116,
+121,108,101,61,34,98,97,99,107,103,114,111,117,110,100,58,116,121,112,101,61,34,
+116,101,120,116,47,99,115,115,34,32,47,62,10,109,101,116,97,32,112,114,111,112,
+101,114,116,121,61,34,111,103,58,116,60,105,110,112,117,116,32,116,121,112,101,
+61,34,116,101,120,116,34,32,32,115,116,121,108,101,61,34,116,101,120,116,45,97,
+108,105,103,110,58,116,104,101,32,100,101,118,101,108,111,112,109,101,110,116,32
+,111,102,32,116,121,108,101,115,104,101,101,116,34,32,116,121,112,101,61,34,116,
+101,104,116,109,108,59,32,99,104,97,114,115,101,116,61,117,116,102,45,56,105,115
+,32,99,111,110,115,105,100,101,114,101,100,32,116,111,32,98,101,116,97,98,108,
+101,32,119,105,100,116,104,61,34,49,48,48,37,34,32,73,110,32,97,100,100,105,116,
+105,111,110,32,116,111,32,116,104,101,32,99,111,110,116,114,105,98,117,116,101,
+100,32,116,111,32,116,104,101,32,100,105,102,102,101,114,101,110,99,101,115,32,
+98,101,116,119,101,101,110,100,101,118,101,108,111,112,109,101,110,116,32,111,
+102,32,116,104,101,32,73,116,32,105,115,32,105,109,112,111,114,116,97,110,116,32
+,116,111,32,60,47,115,99,114,105,112,116,62,10,10,60,115,99,114,105,112,116,32,
+32,115,116,121,108,101,61,34,102,111,110,116,45,115,105,122,101,58,49,62,60,47,
+115,112,97,110,62,60,115,112,97,110,32,105,100,61,103,98,76,105,98,114,97,114,
+121,32,111,102,32,67,111,110,103,114,101,115,115,60,105,109,103,32,115,114,99,61
+,34,104,116,116,112,58,47,47,105,109,69,110,103,108,105,115,104,32,116,114,97,
+110,115,108,97,116,105,111,110,65,99,97,100,101,109,121,32,111,102,32,83,99,105,
+101,110,99,101,115,100,105,118,32,115,116,121,108,101,61,34,100,105,115,112,108,
+97,121,58,99,111,110,115,116,114,117,99,116,105,111,110,32,111,102,32,116,104,
+101,46,103,101,116,69,108,101,109,101,110,116,66,121,73,100,40,105,100,41,105,
+110,32,99,111,110,106,117,110,99,116,105,111,110,32,119,105,116,104,69,108,101,
+109,101,110,116,40,39,115,99,114,105,112,116,39,41,59,32,60,109,101,116,97,32,
+112,114,111,112,101,114,116,121,61,34,111,103,58,208,145,209,138,208,187,208,179
+,208,176,209,128,209,129,208,186,208,184,10,32,116,121,112,101,61,34,116,101,120
+,116,34,32,110,97,109,101,61,34,62,80,114,105,118,97,99,121,32,80,111,108,105,99
+,121,60,47,97,62,97,100,109,105,110,105,115,116,101,114,101,100,32,98,121,32,116
+,104,101,101,110,97,98,108,101,83,105,110,103,108,101,82,101,113,117,101,115,116
+,115,116,121,108,101,61,38,113,117,111,116,59,109,97,114,103,105,110,58,60,47,
+100,105,118,62,60,47,100,105,118,62,60,47,100,105,118,62,60,62,60,105,109,103,32
+,115,114,99,61,34,104,116,116,112,58,47,47,105,32,115,116,121,108,101,61,38,113,
+117,111,116,59,102,108,111,97,116,58,114,101,102,101,114,114,101,100,32,116,111,
+32,97,115,32,116,104,101,32,116,111,116,97,108,32,112,111,112,117,108,97,116,105
+,111,110,32,111,102,105,110,32,87,97,115,104,105,110,103,116,111,110,44,32,68,46
+,67,46,32,115,116,121,108,101,61,34,98,97,99,107,103,114,111,117,110,100,45,97,
+109,111,110,103,32,111,116,104,101,114,32,116,104,105,110,103,115,44,111,114,103
+,97,110,105,122,97,116,105,111,110,32,111,102,32,116,104,101,112,97,114,116,105,
+99,105,112,97,116,101,100,32,105,110,32,116,104,101,116,104,101,32,105,110,116,
+114,111,100,117,99,116,105,111,110,32,111,102,105,100,101,110,116,105,102,105,
+101,100,32,119,105,116,104,32,116,104,101,102,105,99,116,105,111,110,97,108,32,
+99,104,97,114,97,99,116,101,114,32,79,120,102,111,114,100,32,85,110,105,118,101,
+114,115,105,116,121,32,109,105,115,117,110,100,101,114,115,116,97,110,100,105,
+110,103,32,111,102,84,104,101,114,101,32,97,114,101,44,32,104,111,119,101,118,
+101,114,44,115,116,121,108,101,115,104,101,101,116,34,32,104,114,101,102,61,34,
+47,67,111,108,117,109,98,105,97,32,85,110,105,118,101,114,115,105,116,121,101,
+120,112,97,110,100,101,100,32,116,111,32,105,110,99,108,117,100,101,117,115,117,
+97,108,108,121,32,114,101,102,101,114,114,101,100,32,116,111,105,110,100,105,99,
+97,116,105,110,103,32,116,104,97,116,32,116,104,101,104,97,118,101,32,115,117,
+103,103,101,115,116,101,100,32,116,104,97,116,97,102,102,105,108,105,97,116,101,
+100,32,119,105,116,104,32,116,104,101,99,111,114,114,101,108,97,116,105,111,110,
+32,98,101,116,119,101,101,110,110,117,109,98,101,114,32,111,102,32,100,105,102,
+102,101,114,101,110,116,62,60,47,116,100,62,60,47,116,114,62,60,47,116,97,98,108
+,101,62,82,101,112,117,98,108,105,99,32,111,102,32,73,114,101,108,97,110,100,10,
+60,47,115,99,114,105,112,116,62,10,60,115,99,114,105,112,116,32,117,110,100,101,
+114,32,116,104,101,32,105,110,102,108,117,101,110,99,101,99,111,110,116,114,105,
+98,117,116,105,111,110,32,116,111,32,116,104,101,79,102,102,105,99,105,97,108,32
+,119,101,98,115,105,116,101,32,111,102,104,101,97,100,113,117,97,114,116,101,114
+,115,32,111,102,32,116,104,101,99,101,110,116,101,114,101,100,32,97,114,111,117,
+110,100,32,116,104,101,105,109,112,108,105,99,97,116,105,111,110,115,32,111,102,
+32,116,104,101,104,97,118,101,32,98,101,101,110,32,100,101,118,101,108,111,112,
+101,100,70,101,100,101,114,97,108,32,82,101,112,117,98,108,105,99,32,111,102,98,
+101,99,97,109,101,32,105,110,99,114,101,97,115,105,110,103,108,121,99,111,110,
+116,105,110,117,97,116,105,111,110,32,111,102,32,116,104,101,78,111,116,101,44,
+32,104,111,119,101,118,101,114,44,32,116,104,97,116,115,105,109,105,108,97,114,
+32,116,111,32,116,104,97,116,32,111,102,32,99,97,112,97,98,105,108,105,116,105,
+101,115,32,111,102,32,116,104,101,97,99,99,111,114,100,97,110,99,101,32,119,105,
+116,104,32,116,104,101,112,97,114,116,105,99,105,112,97,110,116,115,32,105,110,
+32,116,104,101,102,117,114,116,104,101,114,32,100,101,118,101,108,111,112,109,
+101,110,116,117,110,100,101,114,32,116,104,101,32,100,105,114,101,99,116,105,111
+,110,105,115,32,111,102,116,101,110,32,99,111,110,115,105,100,101,114,101,100,
+104,105,115,32,121,111,117,110,103,101,114,32,98,114,111,116,104,101,114,60,47,
+116,100,62,60,47,116,114,62,60,47,116,97,98,108,101,62,60,97,32,104,116,116,112,
+45,101,113,117,105,118,61,34,88,45,85,65,45,112,104,121,115,105,99,97,108,32,112
+,114,111,112,101,114,116,105,101,115,111,102,32,66,114,105,116,105,115,104,32,67
+,111,108,117,109,98,105,97,104,97,115,32,98,101,101,110,32,99,114,105,116,105,99
+,105,122,101,100,40,119,105,116,104,32,116,104,101,32,101,120,99,101,112,116,105
+,111,110,113,117,101,115,116,105,111,110,115,32,97,98,111,117,116,32,116,104,101
+,112,97,115,115,105,110,103,32,116,104,114,111,117,103,104,32,116,104,101,48,34,
+32,99,101,108,108,112,97,100,100,105,110,103,61,34,48,34,32,116,104,111,117,115,
+97,110,100,115,32,111,102,32,112,101,111,112,108,101,114,101,100,105,114,101,99,
+116,115,32,104,101,114,101,46,32,70,111,114,104,97,118,101,32,99,104,105,108,100
+,114,101,110,32,117,110,100,101,114,37,51,69,37,51,67,47,115,99,114,105,112,116,
+37,51,69,34,41,41,59,60,97,32,104,114,101,102,61,34,104,116,116,112,58,47,47,119
+,119,119,46,60,108,105,62,60,97,32,104,114,101,102,61,34,104,116,116,112,58,47,
+47,115,105,116,101,95,110,97,109,101,34,32,99,111,110,116,101,110,116,61,34,116,
+101,120,116,45,100,101,99,111,114,97,116,105,111,110,58,110,111,110,101,115,116,
+121,108,101,61,34,100,105,115,112,108,97,121,58,32,110,111,110,101,60,109,101,
+116,97,32,104,116,116,112,45,101,113,117,105,118,61,34,88,45,110,101,119,32,68,
+97,116,101,40,41,46,103,101,116,84,105,109,101,40,41,32,116,121,112,101,61,34,
+105,109,97,103,101,47,120,45,105,99,111,110,34,60,47,115,112,97,110,62,60,115,
+112,97,110,32,99,108,97,115,115,61,34,108,97,110,103,117,97,103,101,61,34,106,97
+,118,97,115,99,114,105,112,116,119,105,110,100,111,119,46,108,111,99,97,116,105,
+111,110,46,104,114,101,102,60,97,32,104,114,101,102,61,34,106,97,118,97,115,99,
+114,105,112,116,58,45,45,62,13,10,60,115,99,114,105,112,116,32,116,121,112,101,
+61,34,116,60,97,32,104,114,101,102,61,39,104,116,116,112,58,47,47,119,119,119,46
+,104,111,114,116,99,117,116,32,105,99,111,110,34,32,104,114,101,102,61,34,60,47,
+100,105,118,62,13,10,60,100,105,118,32,99,108,97,115,115,61,34,60,115,99,114,105
+,112,116,32,115,114,99,61,34,104,116,116,112,58,47,47,34,32,114,101,108,61,34,
+115,116,121,108,101,115,104,101,101,116,34,32,116,60,47,100,105,118,62,10,60,115
+,99,114,105,112,116,32,116,121,112,101,61,47,97,62,32,60,97,32,104,114,101,102,
+61,34,104,116,116,112,58,47,47,32,97,108,108,111,119,84,114,97,110,115,112,97,
+114,101,110,99,121,61,34,88,45,85,65,45,67,111,109,112,97,116,105,98,108,101,34,
+32,99,111,110,114,101,108,97,116,105,111,110,115,104,105,112,32,98,101,116,119,
+101,101,110,10,60,47,115,99,114,105,112,116,62,13,10,60,115,99,114,105,112,116,
+32,60,47,97,62,60,47,108,105,62,60,47,117,108,62,60,47,100,105,118,62,97,115,115
+,111,99,105,97,116,101,100,32,119,105,116,104,32,116,104,101,32,112,114,111,103,
+114,97,109,109,105,110,103,32,108,97,110,103,117,97,103,101,60,47,97,62,60,97,32
+,104,114,101,102,61,34,104,116,116,112,58,47,47,60,47,97,62,60,47,108,105,62,60,
+108,105,32,99,108,97,115,115,61,34,102,111,114,109,32,97,99,116,105,111,110,61,
+34,104,116,116,112,58,47,47,60,100,105,118,32,115,116,121,108,101,61,34,100,105,
+115,112,108,97,121,58,116,121,112,101,61,34,116,101,120,116,34,32,110,97,109,101
+,61,34,113,34,60,116,97,98,108,101,32,119,105,100,116,104,61,34,49,48,48,37,34,
+32,98,97,99,107,103,114,111,117,110,100,45,112,111,115,105,116,105,111,110,58,34
+,32,98,111,114,100,101,114,61,34,48,34,32,119,105,100,116,104,61,34,114,101,108,
+61,34,115,104,111,114,116,99,117,116,32,105,99,111,110,34,32,104,54,62,60,117,
+108,62,60,108,105,62,60,97,32,104,114,101,102,61,34,32,32,60,109,101,116,97,32,
+104,116,116,112,45,101,113,117,105,118,61,34,99,115,115,34,32,109,101,100,105,97
+,61,34,115,99,114,101,101,110,34,32,114,101,115,112,111,110,115,105,98,108,101,
+32,102,111,114,32,116,104,101,32,34,32,116,121,112,101,61,34,97,112,112,108,105,
+99,97,116,105,111,110,47,34,32,115,116,121,108,101,61,34,98,97,99,107,103,114,
+111,117,110,100,45,104,116,109,108,59,32,99,104,97,114,115,101,116,61,117,116,
+102,45,56,34,32,97,108,108,111,119,116,114,97,110,115,112,97,114,101,110,99,121,
+61,34,115,116,121,108,101,115,104,101,101,116,34,32,116,121,112,101,61,34,116,
+101,13,10,60,109,101,116,97,32,104,116,116,112,45,101,113,117,105,118,61,34,62,
+60,47,115,112,97,110,62,60,115,112,97,110,32,99,108,97,115,115,61,34,48,34,32,99
+,101,108,108,115,112,97,99,105,110,103,61,34,48,34,62,59,10,60,47,115,99,114,105
+,112,116,62,10,60,115,99,114,105,112,116,32,115,111,109,101,116,105,109,101,115,
+32,99,97,108,108,101,100,32,116,104,101,100,111,101,115,32,110,111,116,32,110,
+101,99,101,115,115,97,114,105,108,121,70,111,114,32,109,111,114,101,32,105,110,
+102,111,114,109,97,116,105,111,110,97,116,32,116,104,101,32,98,101,103,105,110,
+110,105,110,103,32,111,102,32,60,33,68,79,67,84,89,80,69,32,104,116,109,108,62,
+60,104,116,109,108,112,97,114,116,105,99,117,108,97,114,108,121,32,105,110,32,
+116,104,101,32,116,121,112,101,61,34,104,105,100,100,101,110,34,32,110,97,109,
+101,61,34,106,97,118,97,115,99,114,105,112,116,58,118,111,105,100,40,48,41,59,34
+,101,102,102,101,99,116,105,118,101,110,101,115,115,32,111,102,32,116,104,101,32
+,97,117,116,111,99,111,109,112,108,101,116,101,61,34,111,102,102,34,32,103,101,
+110,101,114,97,108,108,121,32,99,111,110,115,105,100,101,114,101,100,62,60,105,
+110,112,117,116,32,116,121,112,101,61,34,116,101,120,116,34,32,34,62,60,47,115,
+99,114,105,112,116,62,13,10,60,115,99,114,105,112,116,116,104,114,111,117,103,
+104,111,117,116,32,116,104,101,32,119,111,114,108,100,99,111,109,109,111,110,32,
+109,105,115,99,111,110,99,101,112,116,105,111,110,97,115,115,111,99,105,97,116,
+105,111,110,32,119,105,116,104,32,116,104,101,60,47,100,105,118,62,10,60,47,100,
+105,118,62,10,60,100,105,118,32,99,100,117,114,105,110,103,32,104,105,115,32,108
+,105,102,101,116,105,109,101,44,99,111,114,114,101,115,112,111,110,100,105,110,
+103,32,116,111,32,116,104,101,116,121,112,101,61,34,105,109,97,103,101,47,120,45
+,105,99,111,110,34,32,97,110,32,105,110,99,114,101,97,115,105,110,103,32,110,117
+,109,98,101,114,100,105,112,108,111,109,97,116,105,99,32,114,101,108,97,116,105,
+111,110,115,97,114,101,32,111,102,116,101,110,32,99,111,110,115,105,100,101,114,
+101,100,109,101,116,97,32,99,104,97,114,115,101,116,61,34,117,116,102,45,56,34,
+32,60,105,110,112,117,116,32,116,121,112,101,61,34,116,101,120,116,34,32,101,120
+,97,109,112,108,101,115,32,105,110,99,108,117,100,101,32,116,104,101,34,62,60,
+105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,105,112,97,114,116,105,
+99,105,112,97,116,105,111,110,32,105,110,32,116,104,101,116,104,101,32,101,115,
+116,97,98,108,105,115,104,109,101,110,116,32,111,102,10,60,47,100,105,118,62,10,
+60,100,105,118,32,99,108,97,115,115,61,34,38,97,109,112,59,110,98,115,112,59,38,
+97,109,112,59,110,98,115,112,59,116,111,32,100,101,116,101,114,109,105,110,101,
+32,119,104,101,116,104,101,114,113,117,105,116,101,32,100,105,102,102,101,114,
+101,110,116,32,102,114,111,109,109,97,114,107,101,100,32,116,104,101,32,98,101,
+103,105,110,110,105,110,103,100,105,115,116,97,110,99,101,32,98,101,116,119,101,
+101,110,32,116,104,101,99,111,110,116,114,105,98,117,116,105,111,110,115,32,116,
+111,32,116,104,101,99,111,110,102,108,105,99,116,32,98,101,116,119,101,101,110,
+32,116,104,101,119,105,100,101,108,121,32,99,111,110,115,105,100,101,114,101,100
+,32,116,111,119,97,115,32,111,110,101,32,111,102,32,116,104,101,32,102,105,114,
+115,116,119,105,116,104,32,118,97,114,121,105,110,103,32,100,101,103,114,101,101
+,115,104,97,118,101,32,115,112,101,99,117,108,97,116,101,100,32,116,104,97,116,
+40,100,111,99,117,109,101,110,116,46,103,101,116,69,108,101,109,101,110,116,112,
+97,114,116,105,99,105,112,97,116,105,110,103,32,105,110,32,116,104,101,111,114,
+105,103,105,110,97,108,108,121,32,100,101,118,101,108,111,112,101,100,101,116,97
+,32,99,104,97,114,115,101,116,61,34,117,116,102,45,56,34,62,32,116,121,112,101,
+61,34,116,101,120,116,47,99,115,115,34,32,47,62,10,105,110,116,101,114,99,104,97
+,110,103,101,97,98,108,121,32,119,105,116,104,109,111,114,101,32,99,108,111,115,
+101,108,121,32,114,101,108,97,116,101,100,115,111,99,105,97,108,32,97,110,100,32
+,112,111,108,105,116,105,99,97,108,116,104,97,116,32,119,111,117,108,100,32,111,
+116,104,101,114,119,105,115,101,112,101,114,112,101,110,100,105,99,117,108,97,
+114,32,116,111,32,116,104,101,115,116,121,108,101,32,116,121,112,101,61,34,116,
+101,120,116,47,99,115,115,116,121,112,101,61,34,115,117,98,109,105,116,34,32,110
+,97,109,101,61,34,102,97,109,105,108,105,101,115,32,114,101,115,105,100,105,110,
+103,32,105,110,100,101,118,101,108,111,112,105,110,103,32,99,111,117,110,116,114
+,105,101,115,99,111,109,112,117,116,101,114,32,112,114,111,103,114,97,109,109,
+105,110,103,101,99,111,110,111,109,105,99,32,100,101,118,101,108,111,112,109,101
+,110,116,100,101,116,101,114,109,105,110,97,116,105,111,110,32,111,102,32,116,
+104,101,102,111,114,32,109,111,114,101,32,105,110,102,111,114,109,97,116,105,111
+,110,111,110,32,115,101,118,101,114,97,108,32,111,99,99,97,115,105,111,110,115,
+112,111,114,116,117,103,117,195,170,115,32,40,69,117,114,111,112,101,117,41,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,170,104,
+116,109,108,59,32,99,104,97,114,115,101,116,61,85,84,70,45,56,34,32,115,101,116,
+84,105,109,101,111,117,116,40,102,117,110,99,116,105,111,110,40,41,100,105,115,
+112,108,97,121,58,105,110,108,105,110,101,45,98,108,111,99,107,59,60,105,110,112
+,117,116,32,116,121,112,101,61,34,115,117,98,109,105,116,34,32,116,121,112,101,
+32,61,32,39,116,101,120,116,47,106,97,118,97,115,99,114,105,60,105,109,103,32,
+115,114,99,61,34,104,116,116,112,58,47,47,119,119,119,46,34,32,34,104,116,116,
+112,58,47,47,119,119,119,46,119,51,46,111,114,103,47,115,104,111,114,116,99,117,
+116,32,105,99,111,110,34,32,104,114,101,102,61,34,34,32,97,117,116,111,99,111,
+109,112,108,101,116,101,61,34,111,102,102,34,32,60,47,97,62,60,47,100,105,118,62
+,60,100,105,118,32,99,108,97,115,115,61,60,47,97,62,60,47,108,105,62,10,60,108,
+105,32,99,108,97,115,115,61,34,99,115,115,34,32,116,121,112,101,61,34,116,101,
+120,116,47,99,115,115,34,32,60,102,111,114,109,32,97,99,116,105,111,110,61,34,
+104,116,116,112,58,47,47,120,116,47,99,115,115,34,32,104,114,101,102,61,34,104,
+116,116,112,58,47,47,108,105,110,107,32,114,101,108,61,34,97,108,116,101,114,110
+,97,116,101,34,32,13,10,60,115,99,114,105,112,116,32,116,121,112,101,61,34,116,
+101,120,116,47,32,111,110,99,108,105,99,107,61,34,106,97,118,97,115,99,114,105,
+112,116,58,40,110,101,119,32,68,97,116,101,41,46,103,101,116,84,105,109,101,40,
+41,125,104,101,105,103,104,116,61,34,49,34,32,119,105,100,116,104,61,34,49,34,32
+,80,101,111,112,108,101,39,115,32,82,101,112,117,98,108,105,99,32,111,102,32,32,
+60,97,32,104,114,101,102,61,34,104,116,116,112,58,47,47,119,119,119,46,116,101,
+120,116,45,100,101,99,111,114,97,116,105,111,110,58,117,110,100,101,114,116,104,
+101,32,98,101,103,105,110,110,105,110,103,32,111,102,32,116,104,101,32,60,47,100
+,105,118,62,10,60,47,100,105,118,62,10,60,47,100,105,118,62,10,101,115,116,97,98
+,108,105,115,104,109,101,110,116,32,111,102,32,116,104,101,32,60,47,100,105,118,
+62,60,47,100,105,118,62,60,47,100,105,118,62,60,47,100,35,118,105,101,119,112,
+111,114,116,123,109,105,110,45,104,101,105,103,104,116,58,10,60,115,99,114,105,
+112,116,32,115,114,99,61,34,104,116,116,112,58,47,47,111,112,116,105,111,110,62,
+60,111,112,116,105,111,110,32,118,97,108,117,101,61,111,102,116,101,110,32,114,
+101,102,101,114,114,101,100,32,116,111,32,97,115,32,47,111,112,116,105,111,110,
+62,10,60,111,112,116,105,111,110,32,118,97,108,117,60,33,68,79,67,84,89,80,69,32
+,104,116,109,108,62,10,60,33,45,45,91,73,110,116,101,114,110,97,116,105,111,110,
+97,108,32,65,105,114,112,111,114,116,62,10,60,97,32,104,114,101,102,61,34,104,
+116,116,112,58,47,47,119,119,119,60,47,97,62,60,97,32,104,114,101,102,61,34,104,
+116,116,112,58,47,47,119,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
+,32,40,231,185,129,233,171,148,41,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,161,100,101,115,99,114,
+105,112,116,105,111,110,34,32,99,111,110,116,101,110,116,61,34,100,111,99,117,
+109,101,110,116,46,108,111,99,97,116,105,111,110,46,112,114,111,116,46,103,101,
+116,69,108,101,109,101,110,116,115,66,121,84,97,103,78,97,109,101,40,60,33,68,79
+,67,84,89,80,69,32,104,116,109,108,62,10,60,104,116,109,108,32,60,109,101,116,97
+,32,99,104,97,114,115,101,116,61,34,117,116,102,45,56,34,62,58,117,114,108,34,32
+,99,111,110,116,101,110,116,61,34,104,116,116,112,58,47,47,46,99,115,115,34,32,
+114,101,108,61,34,115,116,121,108,101,115,104,101,101,116,34,115,116,121,108,101
+,32,116,121,112,101,61,34,116,101,120,116,47,99,115,115,34,62,116,121,112,101,61
+,34,116,101,120,116,47,99,115,115,34,32,104,114,101,102,61,34,119,51,46,111,114,
+103,47,49,57,57,57,47,120,104,116,109,108,34,32,120,109,108,116,121,112,101,61,
+34,116,101,120,116,47,106,97,118,97,115,99,114,105,112,116,34,32,109,101,116,104
+,111,100,61,34,103,101,116,34,32,97,99,116,105,111,110,61,34,108,105,110,107,32,
+114,101,108,61,34,115,116,121,108,101,115,104,101,101,116,34,32,32,61,32,100,111
+,99,117,109,101,110,116,46,103,101,116,69,108,101,109,101,110,116,116,121,112,
+101,61,34,105,109,97,103,101,47,120,45,105,99,111,110,34,32,47,62,99,101,108,108
+,112,97,100,100,105,110,103,61,34,48,34,32,99,101,108,108,115,112,46,99,115,115,
+34,32,116,121,112,101,61,34,116,101,120,116,47,99,115,115,34,32,60,47,97,62,60,
+47,108,105,62,60,108,105,62,60,97,32,104,114,101,102,61,34,34,32,119,105,100,116
+,104,61,34,49,34,32,104,101,105,103,104,116,61,34,49,34,34,62,60,97,32,104,114,
+101,102,61,34,104,116,116,112,58,47,47,119,119,119,46,115,116,121,108,101,61,34,
+100,105,115,112,108,97,121,58,110,111,110,101,59,34,62,97,108,116,101,114,110,97
+,116,101,34,32,116,121,112,101,61,34,97,112,112,108,105,45,47,47,87,51,67,47,47,
+68,84,68,32,88,72,84,77,76,32,49,46,48,32,101,108,108,115,112,97,99,105,110,103,
+61,34,48,34,32,99,101,108,108,112,97,100,32,116,121,112,101,61,34,104,105,100,
+100,101,110,34,32,118,97,108,117,101,61,34,47,97,62,38,110,98,115,112,59,60,115,
+112,97,110,32,114,111,108,101,61,34,115,10,60,105,110,112,117,116,32,116,121,112
+,101,61,34,104,105,100,100,101,110,34,32,108,97,110,103,117,97,103,101,61,34,74,
+97,118,97,83,99,114,105,112,116,34,32,32,100,111,99,117,109,101,110,116,46,103,
+101,116,69,108,101,109,101,110,116,115,66,103,61,34,48,34,32,99,101,108,108,115,
+112,97,99,105,110,103,61,34,48,34,32,121,112,101,61,34,116,101,120,116,47,99,115
+,115,34,32,109,101,100,105,97,61,34,116,121,112,101,61,39,116,101,120,116,47,106
+,97,118,97,115,99,114,105,112,116,39,119,105,116,104,32,116,104,101,32,101,120,
+99,101,112,116,105,111,110,32,111,102,32,121,112,101,61,34,116,101,120,116,47,99
+,115,115,34,32,114,101,108,61,34,115,116,32,104,101,105,103,104,116,61,34,49,34,
+32,119,105,100,116,104,61,34,49,34,32,61,39,43,101,110,99,111,100,101,85,82,73,
+67,111,109,112,111,110,101,110,116,40,60,108,105,110,107,32,114,101,108,61,34,97
+,108,116,101,114,110,97,116,101,34,32,10,98,111,100,121,44,32,116,114,44,32,105,
+110,112,117,116,44,32,116,101,120,116,109,101,116,97,32,110,97,109,101,61,34,114
+,111,98,111,116,115,34,32,99,111,110,109,101,116,104,111,100,61,34,112,111,115,
+116,34,32,97,99,116,105,111,110,61,34,62,10,60,97,32,104,114,101,102,61,34,104,
+116,116,112,58,47,47,119,119,119,46,99,115,115,34,32,114,101,108,61,34,115,116,
+121,108,101,115,104,101,101,116,34,32,60,47,100,105,118,62,60,47,100,105,118,62,
+60,100,105,118,32,99,108,97,115,115,108,97,110,103,117,97,103,101,61,34,106,97,
+118,97,115,99,114,105,112,116,34,62,97,114,105,97,45,104,105,100,100,101,110,61,
+34,116,114,117,101,34,62,194,183,60,114,105,112,116,34,32,116,121,112,101,61,34,
+116,101,120,116,47,106,97,118,97,115,108,61,48,59,125,41,40,41,59,10,40,102,117,
+110,99,116,105,111,110,40,41,123,98,97,99,107,103,114,111,117,110,100,45,105,109
+,97,103,101,58,32,117,114,108,40,47,97,62,60,47,108,105,62,60,108,105,62,60,97,
+32,104,114,101,102,61,34,104,9,9,60,108,105,62,60,97,32,104,114,101,102,61,34,
+104,116,116,112,58,47,47,97,116,111,114,34,32,97,114,105,97,45,104,105,100,100,
+101,110,61,34,116,114,117,62,32,60,97,32,104,114,101,102,61,34,104,116,116,112,
+58,47,47,119,119,119,46,108,97,110,103,117,97,103,101,61,34,106,97,118,97,115,99
+,114,105,112,116,34,32,47,111,112,116,105,111,110,62,10,60,111,112,116,105,111,
+110,32,118,97,108,117,101,47,100,105,118,62,60,47,100,105,118,62,60,100,105,118,
+32,99,108,97,115,115,61,114,97,116,111,114,34,32,97,114,105,97,45,104,105,100,
+100,101,110,61,34,116,114,101,61,40,110,101,119,32,68,97,116,101,41,46,103,101,
+116,84,105,109,101,40,41,112,111,114,116,117,103,117,195,170,115,32,40,100,111,
+32,66,114,97,115,105,108,41,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,60,
+33,68,79,67,84,89,80,69,32,104,116,109,108,32,80,85,66,76,73,67,32,34,110,116,45
+,84,121,112,101,34,32,99,111,110,116,101,110,116,61,34,116,101,120,116,47,60,109
+,101,116,97,32,104,116,116,112,45,101,113,117,105,118,61,34,67,111,110,116,101,
+114,97,110,115,105,116,105,111,110,97,108,47,47,69,78,34,32,34,104,116,116,112,
+58,60,104,116,109,108,32,120,109,108,110,115,61,34,104,116,116,112,58,47,47,119,
+119,119,45,47,47,87,51,67,47,47,68,84,68,32,88,72,84,77,76,32,49,46,48,32,84,68,
+84,68,47,120,104,116,109,108,49,45,116,114,97,110,115,105,116,105,111,110,97,108
+,47,47,119,119,119,46,119,51,46,111,114,103,47,84,82,47,120,104,116,109,108,49,
+47,112,101,32,61,32,39,116,101,120,116,47,106,97,118,97,115,99,114,105,112,116,
+39,59,60,109,101,116,97,32,110,97,109,101,61,34,100,101,115,99,114,105,112,116,
+105,111,110,112,97,114,101,110,116,78,111,100,101,46,105,110,115,101,114,116,66,
+101,102,111,114,101,60,105,110,112,117,116,32,116,121,112,101,61,34,104,105,100,
+100,101,110,34,32,110,97,106,115,34,32,116,121,112,101,61,34,116,101,120,116,47,
+106,97,118,97,115,99,114,105,40,100,111,99,117,109,101,110,116,41,46,114,101,97,
+100,121,40,102,117,110,99,116,105,115,99,114,105,112,116,32,116,121,112,101,61,
+34,116,101,120,116,47,106,97,118,97,115,105,109,97,103,101,34,32,99,111,110,116,
+101,110,116,61,34,104,116,116,112,58,47,47,85,65,45,67,111,109,112,97,116,105,98
+,108,101,34,32,99,111,110,116,101,110,116,61,116,109,108,59,32,99,104,97,114,115
+,101,116,61,117,116,102,45,56,34,32,47,62,10,108,105,110,107,32,114,101,108,61,
+34,115,104,111,114,116,99,117,116,32,105,99,111,110,60,108,105,110,107,32,114,
+101,108,61,34,115,116,121,108,101,115,104,101,101,116,34,32,60,47,115,99,114,105
+,112,116,62,10,60,115,99,114,105,112,116,32,116,121,112,101,61,61,32,100,111,99,
+117,109,101,110,116,46,99,114,101,97,116,101,69,108,101,109,101,110,60,97,32,116
+,97,114,103,101,116,61,34,95,98,108,97,110,107,34,32,104,114,101,102,61,32,100,
+111,99,117,109,101,110,116,46,103,101,116,69,108,101,109,101,110,116,115,66,105,
+110,112,117,116,32,116,121,112,101,61,34,116,101,120,116,34,32,110,97,109,101,61
+,97,46,116,121,112,101,32,61,32,39,116,101,120,116,47,106,97,118,97,115,99,114,
+105,110,112,117,116,32,116,121,112,101,61,34,104,105,100,100,101,110,34,32,110,
+97,109,101,104,116,109,108,59,32,99,104,97,114,115,101,116,61,117,116,102,45,56,
+34,32,47,62,100,116,100,34,62,10,60,104,116,109,108,32,120,109,108,110,115,61,34
+,104,116,116,112,45,47,47,87,51,67,47,47,68,84,68,32,72,84,77,76,32,52,46,48,49,
+32,84,101,110,116,115,66,121,84,97,103,78,97,109,101,40,39,115,99,114,105,112,
+116,39,41,105,110,112,117,116,32,116,121,112,101,61,34,104,105,100,100,101,110,
+34,32,110,97,109,60,115,99,114,105,112,116,32,116,121,112,101,61,34,116,101,120,
+116,47,106,97,118,97,115,34,32,115,116,121,108,101,61,34,100,105,115,112,108,97,
+121,58,110,111,110,101,59,34,62,100,111,99,117,109,101,110,116,46,103,101,116,69
+,108,101,109,101,110,116,66,121,73,100,40,61,100,111,99,117,109,101,110,116,46,
+99,114,101,97,116,101,69,108,101,109,101,110,116,40,39,32,116,121,112,101,61,39,
+116,101,120,116,47,106,97,118,97,115,99,114,105,112,116,39,105,110,112,117,116,
+32,116,121,112,101,61,34,116,101,120,116,34,32,110,97,109,101,61,34,100,46,103,
+101,116,69,108,101,109,101,110,116,115,66,121,84,97,103,78,97,109,101,40,115,110
+,105,99,97,108,34,32,104,114,101,102,61,34,104,116,116,112,58,47,47,119,119,119,
+46,67,47,47,68,84,68,32,72,84,77,76,32,52,46,48,49,32,84,114,97,110,115,105,116,
+60,115,116,121,108,101,32,116,121,112,101,61,34,116,101,120,116,47,99,115,115,34
+,62,10,10,60,115,116,121,108,101,32,116,121,112,101,61,34,116,101,120,116,47,99,
+115,115,34,62,105,111,110,97,108,46,100,116,100,34,62,10,60,104,116,109,108,32,
+120,109,108,110,115,61,104,116,116,112,45,101,113,117,105,118,61,34,67,111,110,
+116,101,110,116,45,84,121,112,101,100,105,110,103,61,34,48,34,32,99,101,108,108,
+115,112,97,99,105,110,103,61,34,48,34,104,116,109,108,59,32,99,104,97,114,115,
+101,116,61,117,116,102,45,56,34,32,47,62,10,32,115,116,121,108,101,61,34,100,105
+,115,112,108,97,121,58,110,111,110,101,59,34,62,60,60,108,105,62,60,97,32,104,
+114,101,102,61,34,104,116,116,112,58,47,47,119,119,119,46,32,116,121,112,101,61,
+39,116,101,120,116,47,106,97,118,97,115,99,114,105,112,116,39,62,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
+}
+/* GENERATED CODE END */
+;
+#endif  /* !BROTLI_EXTERNAL_DICTIONARY_DATA */
+
+#if !defined(BROTLI_EXTERNAL_DICTIONARY_DATA)
+static const BrotliDictionary kBrotliDictionary = {
+#else
+static BrotliDictionary kBrotliDictionary = {
+#endif
+  /* size_bits_by_length */
+  {
+    0, 0, 0, 0, 10, 10, 11, 11,
+    10, 10, 10, 10, 10, 9, 9, 8,
+    7, 7, 8, 7, 7, 6, 6, 5,
+    5, 0, 0, 0, 0, 0, 0, 0
+  },
+
+  /* offsets_by_length */
+  {
+    0, 0, 0, 0, 0, 4096, 9216, 21504,
+    35840, 44032, 53248, 63488, 74752, 87040, 93696, 100864,
+    104704, 106752, 108928, 113536, 115968, 118528, 119872, 121280,
+    122016, 122784, 122784, 122784, 122784, 122784, 122784, 122784
+  },
+
+  /* data_size ==  sizeof(kBrotliDictionaryData) */
+  122784,
+
+  /* data */
+#if defined(BROTLI_EXTERNAL_DICTIONARY_DATA)
+  NULL
+#else
+  kBrotliDictionaryData
+#endif
+};
+
+const BrotliDictionary* BrotliGetDictionary(void) {
+  return &kBrotliDictionary;
+}
+
+void BrotliSetDictionaryData(const uint8_t* data) {
+#if defined(BROTLI_EXTERNAL_DICTIONARY_DATA)
+  if (!!data && !kBrotliDictionary.data) {
+    kBrotliDictionary.data = data;
+  }
+#else
+  BROTLI_UNUSED(data);  // Appease -Werror=unused-parameter
+#endif
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.h
new file mode 100644
index 0000000000..b1c6f7f580
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/dictionary.h
@@ -0,0 +1,64 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Collection of static dictionary words. */
+
+#ifndef BROTLI_COMMON_DICTIONARY_H_
+#define BROTLI_COMMON_DICTIONARY_H_
+
+#include <brotli/port.h>
+#include <brotli/types.h>
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+typedef struct BrotliDictionary {
+  /**
+   * Number of bits to encode index of dictionary word in a bucket.
+   *
+   * Specification: Appendix A. Static Dictionary Data
+   *
+   * Words in a dictionary are bucketed by length.
+   * @c 0 means that there are no words of a given length.
+   * Dictionary consists of words with length of [4..24] bytes.
+   * Values at [0..3] and [25..31] indices should not be addressed.
+   */
+  uint8_t size_bits_by_length[32];
+
+  /* assert(offset[i + 1] == offset[i] + (bits[i] ? (i << bits[i]) : 0)) */
+  uint32_t offsets_by_length[32];
+
+  /* assert(data_size == offsets_by_length[31]) */
+  size_t data_size;
+
+  /* Data array is not bound, and should obey to size_bits_by_length values.
+     Specified size matches default (RFC 7932) dictionary. Its size is
+     defined by data_size */
+  const uint8_t* data;
+} BrotliDictionary;
+
+BROTLI_COMMON_API const BrotliDictionary* BrotliGetDictionary(void);
+
+/**
+ * Sets dictionary data.
+ *
+ * When dictionary data is already set / present, this method is no-op.
+ *
+ * Dictionary data MUST be provided before BrotliGetDictionary is invoked.
+ * This method is used ONLY in multi-client environment (e.g. C + Java),
+ * to reduce storage by sharing single dictionary between implementations.
+ */
+BROTLI_COMMON_API void BrotliSetDictionaryData(const uint8_t* data);
+
+#define BROTLI_MIN_DICTIONARY_WORD_LENGTH 4
+#define BROTLI_MAX_DICTIONARY_WORD_LENGTH 24
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_COMMON_DICTIONARY_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/platform.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/platform.c
new file mode 100644
index 0000000000..25d84a9467
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/platform.c
@@ -0,0 +1,23 @@
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include <stdlib.h>
+
+#include <brotli/types.h>
+
+#include "platform.h"
+
+/* Default brotli_alloc_func */
+void* BrotliDefaultAllocFunc(void* opaque, size_t size) {
+  BROTLI_UNUSED(opaque);
+  return malloc(size);
+}
+
+/* Default brotli_free_func */
+void BrotliDefaultFreeFunc(void* opaque, void* address) {
+  BROTLI_UNUSED(opaque);
+  free(address);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/platform.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/platform.h
new file mode 100644
index 0000000000..dbba9424d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/platform.h
@@ -0,0 +1,524 @@
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Macros for compiler / platform specific features and build options.
+
+   Build options are:
+    * BROTLI_BUILD_32_BIT disables 64-bit optimizations
+    * BROTLI_BUILD_64_BIT forces to use 64-bit optimizations
+    * BROTLI_BUILD_BIG_ENDIAN forces to use big-endian optimizations
+    * BROTLI_BUILD_ENDIAN_NEUTRAL disables endian-aware optimizations
+    * BROTLI_BUILD_LITTLE_ENDIAN forces to use little-endian optimizations
+    * BROTLI_BUILD_NO_RBIT disables "rbit" optimization for ARM CPUs
+    * BROTLI_BUILD_NO_UNALIGNED_READ_FAST forces off the fast-unaligned-read
+      optimizations (mainly for testing purposes)
+    * BROTLI_DEBUG dumps file name and line number when decoder detects stream
+      or memory error
+    * BROTLI_ENABLE_LOG enables asserts and dumps various state information
+    * BROTLI_ENABLE_DUMP overrides default "dump" behaviour
+*/
+
+#ifndef BROTLI_COMMON_PLATFORM_H_
+#define BROTLI_COMMON_PLATFORM_H_
+
+#include <string.h>  /* memcpy */
+
+#include <brotli/port.h>
+#include <brotli/types.h>
+
+#include <sys/types.h>  /* should include endian.h for us */
+
+#if BROTLI_MSVC_VERSION_CHECK(18, 0, 0)
+#include <intrin.h>
+#endif
+
+#if defined(BROTLI_ENABLE_LOG) || defined(BROTLI_DEBUG)
+#include <assert.h>
+#include <stdio.h>
+#endif
+
+/* The following macros were borrowed from https://github.com/nemequ/hedley
+ * with permission of original author - Evan Nemerson <evan@nemerson.com> */
+
+/* >>> >>> >>> hedley macros */
+
+/* Define "BROTLI_PREDICT_TRUE" and "BROTLI_PREDICT_FALSE" macros for capable
+   compilers.
+
+To apply compiler hint, enclose the branching condition into macros, like this:
+
+  if (BROTLI_PREDICT_TRUE(zero == 0)) {
+    // main execution path
+  } else {
+    // compiler should place this code outside of main execution path
+  }
+
+OR:
+
+  if (BROTLI_PREDICT_FALSE(something_rare_or_unexpected_happens)) {
+    // compiler should place this code outside of main execution path
+  }
+
+*/
+#if BROTLI_GNUC_HAS_BUILTIN(__builtin_expect, 3, 0, 0) || \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0) ||               \
+    BROTLI_SUNPRO_VERSION_CHECK(5, 15, 0) ||              \
+    BROTLI_ARM_VERSION_CHECK(4, 1, 0) ||                  \
+    BROTLI_IBM_VERSION_CHECK(10, 1, 0) ||                 \
+    BROTLI_TI_VERSION_CHECK(7, 3, 0) ||                   \
+    BROTLI_TINYC_VERSION_CHECK(0, 9, 27)
+#define BROTLI_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
+#define BROTLI_PREDICT_FALSE(x) (__builtin_expect(x, 0))
+#else
+#define BROTLI_PREDICT_FALSE(x) (x)
+#define BROTLI_PREDICT_TRUE(x) (x)
+#endif
+
+#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) && \
+    !defined(__cplusplus)
+#define BROTLI_RESTRICT restrict
+#elif BROTLI_GNUC_VERSION_CHECK(3, 1, 0) ||                         \
+    BROTLI_MSVC_VERSION_CHECK(14, 0, 0) ||                          \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0) ||                         \
+    BROTLI_ARM_VERSION_CHECK(4, 1, 0) ||                            \
+    BROTLI_IBM_VERSION_CHECK(10, 1, 0) ||                           \
+    BROTLI_PGI_VERSION_CHECK(17, 10, 0) ||                          \
+    BROTLI_TI_VERSION_CHECK(8, 0, 0) ||                             \
+    BROTLI_IAR_VERSION_CHECK(8, 0, 0) ||                            \
+    (BROTLI_SUNPRO_VERSION_CHECK(5, 14, 0) && defined(__cplusplus))
+#define BROTLI_RESTRICT __restrict
+#elif BROTLI_SUNPRO_VERSION_CHECK(5, 3, 0) && !defined(__cplusplus)
+#define BROTLI_RESTRICT _Restrict
+#else
+#define BROTLI_RESTRICT
+#endif
+
+#if (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) || \
+    (defined(__cplusplus) && (__cplusplus >= 199711L))
+#define BROTLI_MAYBE_INLINE inline
+#elif defined(__GNUC_STDC_INLINE__) || defined(__GNUC_GNU_INLINE__) || \
+    BROTLI_ARM_VERSION_CHECK(6, 2, 0)
+#define BROTLI_MAYBE_INLINE __inline__
+#elif BROTLI_MSVC_VERSION_CHECK(12, 0, 0) || \
+    BROTLI_ARM_VERSION_CHECK(4, 1, 0) || BROTLI_TI_VERSION_CHECK(8, 0, 0)
+#define BROTLI_MAYBE_INLINE __inline
+#else
+#define BROTLI_MAYBE_INLINE
+#endif
+
+#if BROTLI_GNUC_HAS_ATTRIBUTE(always_inline, 4, 0, 0) ||                       \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0) ||                                    \
+    BROTLI_SUNPRO_VERSION_CHECK(5, 11, 0) ||                                   \
+    BROTLI_ARM_VERSION_CHECK(4, 1, 0) ||                                       \
+    BROTLI_IBM_VERSION_CHECK(10, 1, 0) ||                                      \
+    BROTLI_TI_VERSION_CHECK(8, 0, 0) ||                                        \
+    (BROTLI_TI_VERSION_CHECK(7, 3, 0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__))
+#define BROTLI_INLINE BROTLI_MAYBE_INLINE __attribute__((__always_inline__))
+#elif BROTLI_MSVC_VERSION_CHECK(12, 0, 0)
+#define BROTLI_INLINE BROTLI_MAYBE_INLINE __forceinline
+#elif BROTLI_TI_VERSION_CHECK(7, 0, 0) && defined(__cplusplus)
+#define BROTLI_INLINE BROTLI_MAYBE_INLINE _Pragma("FUNC_ALWAYS_INLINE;")
+#elif BROTLI_IAR_VERSION_CHECK(8, 0, 0)
+#define BROTLI_INLINE BROTLI_MAYBE_INLINE _Pragma("inline=forced")
+#else
+#define BROTLI_INLINE BROTLI_MAYBE_INLINE
+#endif
+
+#if BROTLI_GNUC_HAS_ATTRIBUTE(noinline, 4, 0, 0) ||                            \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0) ||                                    \
+    BROTLI_SUNPRO_VERSION_CHECK(5, 11, 0) ||                                   \
+    BROTLI_ARM_VERSION_CHECK(4, 1, 0) ||                                       \
+    BROTLI_IBM_VERSION_CHECK(10, 1, 0) ||                                      \
+    BROTLI_TI_VERSION_CHECK(8, 0, 0) ||                                        \
+    (BROTLI_TI_VERSION_CHECK(7, 3, 0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__))
+#define BROTLI_NOINLINE __attribute__((__noinline__))
+#elif BROTLI_MSVC_VERSION_CHECK(13, 10, 0)
+#define BROTLI_NOINLINE __declspec(noinline)
+#elif BROTLI_PGI_VERSION_CHECK(10, 2, 0)
+#define BROTLI_NOINLINE _Pragma("noinline")
+#elif BROTLI_TI_VERSION_CHECK(6, 0, 0) && defined(__cplusplus)
+#define BROTLI_NOINLINE _Pragma("FUNC_CANNOT_INLINE;")
+#elif BROTLI_IAR_VERSION_CHECK(8, 0, 0)
+#define BROTLI_NOINLINE _Pragma("inline=never")
+#else
+#define BROTLI_NOINLINE
+#endif
+
+/* <<< <<< <<< end of hedley macros. */
+
+#if BROTLI_GNUC_HAS_ATTRIBUTE(unused, 2, 7, 0) || \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0)
+#define BROTLI_UNUSED_FUNCTION static BROTLI_INLINE __attribute__ ((unused))
+#else
+#define BROTLI_UNUSED_FUNCTION static BROTLI_INLINE
+#endif
+
+#if BROTLI_GNUC_HAS_ATTRIBUTE(aligned, 2, 7, 0)
+#define BROTLI_ALIGNED(N) __attribute__((aligned(N)))
+#else
+#define BROTLI_ALIGNED(N)
+#endif
+
+#if (defined(__ARM_ARCH) && (__ARM_ARCH == 7)) || \
+    (defined(M_ARM) && (M_ARM == 7))
+#define BROTLI_TARGET_ARMV7
+#endif  /* ARMv7 */
+
+#if (defined(__ARM_ARCH) && (__ARM_ARCH == 8)) || \
+    defined(__aarch64__) || defined(__ARM64_ARCH_8__)
+#define BROTLI_TARGET_ARMV8_ANY
+
+#if defined(__ARM_32BIT_STATE)
+#define BROTLI_TARGET_ARMV8_32
+#elif defined(__ARM_64BIT_STATE)
+#define BROTLI_TARGET_ARMV8_64
+#endif
+
+#endif  /* ARMv8 */
+
+#if defined(__ARM_NEON__) || defined(__ARM_NEON)
+#define BROTLI_TARGET_NEON
+#endif
+
+#if defined(__i386) || defined(_M_IX86)
+#define BROTLI_TARGET_X86
+#endif
+
+#if defined(__x86_64__) || defined(_M_X64)
+#define BROTLI_TARGET_X64
+#endif
+
+#if defined(__PPC64__)
+#define BROTLI_TARGET_POWERPC64
+#endif
+
+#if defined(__riscv) && defined(__riscv_xlen) && __riscv_xlen == 64
+#define BROTLI_TARGET_RISCV64
+#endif
+
+#if defined(__loongarch_lp64)
+#define BROTLI_TARGET_LOONGARCH64
+#endif
+
+#if defined(BROTLI_TARGET_X64) || defined(BROTLI_TARGET_ARMV8_64) || \
+    defined(BROTLI_TARGET_POWERPC64) || defined(BROTLI_TARGET_RISCV64) || \
+    defined(BROTLI_TARGET_LOONGARCH64)
+#define BROTLI_TARGET_64_BITS 1
+#else
+#define BROTLI_TARGET_64_BITS 0
+#endif
+
+#if defined(BROTLI_BUILD_64_BIT)
+#define BROTLI_64_BITS 1
+#elif defined(BROTLI_BUILD_32_BIT)
+#define BROTLI_64_BITS 0
+#else
+#define BROTLI_64_BITS BROTLI_TARGET_64_BITS
+#endif
+
+#if (BROTLI_64_BITS)
+#define brotli_reg_t uint64_t
+#else
+#define brotli_reg_t uint32_t
+#endif
+
+#if defined(BROTLI_BUILD_BIG_ENDIAN)
+#define BROTLI_BIG_ENDIAN 1
+#elif defined(BROTLI_BUILD_LITTLE_ENDIAN)
+#define BROTLI_LITTLE_ENDIAN 1
+#elif defined(BROTLI_BUILD_ENDIAN_NEUTRAL)
+/* Just break elif chain. */
+#elif defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)
+#define BROTLI_LITTLE_ENDIAN 1
+#elif defined(_WIN32) || defined(BROTLI_TARGET_X64)
+/* Win32 & x64 can currently always be assumed to be little endian */
+#define BROTLI_LITTLE_ENDIAN 1
+#elif defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)
+#define BROTLI_BIG_ENDIAN 1
+/* Likely target platform is iOS / OSX. */
+#elif defined(BYTE_ORDER) && (BYTE_ORDER == LITTLE_ENDIAN)
+#define BROTLI_LITTLE_ENDIAN 1
+#elif defined(BYTE_ORDER) && (BYTE_ORDER == BIG_ENDIAN)
+#define BROTLI_BIG_ENDIAN 1
+#endif
+
+#if !defined(BROTLI_LITTLE_ENDIAN)
+#define BROTLI_LITTLE_ENDIAN 0
+#endif
+
+#if !defined(BROTLI_BIG_ENDIAN)
+#define BROTLI_BIG_ENDIAN 0
+#endif
+
+#if defined(BROTLI_BUILD_NO_UNALIGNED_READ_FAST)
+#define BROTLI_UNALIGNED_READ_FAST (!!0)
+#elif defined(BROTLI_TARGET_X86) || defined(BROTLI_TARGET_X64) ||       \
+    defined(BROTLI_TARGET_ARMV7) || defined(BROTLI_TARGET_ARMV8_ANY) || \
+    defined(BROTLI_TARGET_RISCV64) || defined(BROTLI_TARGET_LOONGARCH64)
+/* These targets are known to generate efficient code for unaligned reads
+ * (e.g. a single instruction, not multiple 1-byte loads, shifted and or'd
+ * together). */
+#define BROTLI_UNALIGNED_READ_FAST (!!1)
+#else
+#define BROTLI_UNALIGNED_READ_FAST (!!0)
+#endif
+
+/* Portable unaligned memory access: read / write values via memcpy. */
+static BROTLI_INLINE uint16_t BrotliUnalignedRead16(const void* p) {
+  uint16_t t;
+  memcpy(&t, p, sizeof t);
+  return t;
+}
+static BROTLI_INLINE uint32_t BrotliUnalignedRead32(const void* p) {
+  uint32_t t;
+  memcpy(&t, p, sizeof t);
+  return t;
+}
+static BROTLI_INLINE uint64_t BrotliUnalignedRead64(const void* p) {
+  uint64_t t;
+  memcpy(&t, p, sizeof t);
+  return t;
+}
+static BROTLI_INLINE void BrotliUnalignedWrite64(void* p, uint64_t v) {
+  memcpy(p, &v, sizeof v);
+}
+
+#if BROTLI_LITTLE_ENDIAN
+/* Straight endianness. Just read / write values. */
+#define BROTLI_UNALIGNED_LOAD16LE BrotliUnalignedRead16
+#define BROTLI_UNALIGNED_LOAD32LE BrotliUnalignedRead32
+#define BROTLI_UNALIGNED_LOAD64LE BrotliUnalignedRead64
+#define BROTLI_UNALIGNED_STORE64LE BrotliUnalignedWrite64
+#elif BROTLI_BIG_ENDIAN  /* BROTLI_LITTLE_ENDIAN */
+/* Explain compiler to byte-swap values. */
+#define BROTLI_BSWAP16_(V) ((uint16_t)( \
+  (((V) & 0xFFU) << 8) | \
+  (((V) >> 8) & 0xFFU)))
+static BROTLI_INLINE uint16_t BROTLI_UNALIGNED_LOAD16LE(const void* p) {
+  uint16_t value = BrotliUnalignedRead16(p);
+  return BROTLI_BSWAP16_(value);
+}
+#define BROTLI_BSWAP32_(V) ( \
+  (((V) & 0xFFU) << 24) | (((V) & 0xFF00U) << 8) | \
+  (((V) >> 8) & 0xFF00U) | (((V) >> 24) & 0xFFU))
+static BROTLI_INLINE uint32_t BROTLI_UNALIGNED_LOAD32LE(const void* p) {
+  uint32_t value = BrotliUnalignedRead32(p);
+  return BROTLI_BSWAP32_(value);
+}
+#define BROTLI_BSWAP64_(V) ( \
+  (((V) & 0xFFU) << 56) | (((V) & 0xFF00U) << 40) | \
+  (((V) & 0xFF0000U) << 24) | (((V) & 0xFF000000U) << 8) | \
+  (((V) >> 8) & 0xFF000000U) | (((V) >> 24) & 0xFF0000U) | \
+  (((V) >> 40) & 0xFF00U) | (((V) >> 56) & 0xFFU))
+static BROTLI_INLINE uint64_t BROTLI_UNALIGNED_LOAD64LE(const void* p) {
+  uint64_t value = BrotliUnalignedRead64(p);
+  return BROTLI_BSWAP64_(value);
+}
+static BROTLI_INLINE void BROTLI_UNALIGNED_STORE64LE(void* p, uint64_t v) {
+  uint64_t value = BROTLI_BSWAP64_(v);
+  BrotliUnalignedWrite64(p, value);
+}
+#else  /* BROTLI_LITTLE_ENDIAN */
+/* Read / store values byte-wise; hopefully compiler will understand. */
+static BROTLI_INLINE uint16_t BROTLI_UNALIGNED_LOAD16LE(const void* p) {
+  const uint8_t* in = (const uint8_t*)p;
+  return (uint16_t)(in[0] | (in[1] << 8));
+}
+static BROTLI_INLINE uint32_t BROTLI_UNALIGNED_LOAD32LE(const void* p) {
+  const uint8_t* in = (const uint8_t*)p;
+  uint32_t value = (uint32_t)(in[0]);
+  value |= (uint32_t)(in[1]) << 8;
+  value |= (uint32_t)(in[2]) << 16;
+  value |= (uint32_t)(in[3]) << 24;
+  return value;
+}
+static BROTLI_INLINE uint64_t BROTLI_UNALIGNED_LOAD64LE(const void* p) {
+  const uint8_t* in = (const uint8_t*)p;
+  uint64_t value = (uint64_t)(in[0]);
+  value |= (uint64_t)(in[1]) << 8;
+  value |= (uint64_t)(in[2]) << 16;
+  value |= (uint64_t)(in[3]) << 24;
+  value |= (uint64_t)(in[4]) << 32;
+  value |= (uint64_t)(in[5]) << 40;
+  value |= (uint64_t)(in[6]) << 48;
+  value |= (uint64_t)(in[7]) << 56;
+  return value;
+}
+static BROTLI_INLINE void BROTLI_UNALIGNED_STORE64LE(void* p, uint64_t v) {
+  uint8_t* out = (uint8_t*)p;
+  out[0] = (uint8_t)v;
+  out[1] = (uint8_t)(v >> 8);
+  out[2] = (uint8_t)(v >> 16);
+  out[3] = (uint8_t)(v >> 24);
+  out[4] = (uint8_t)(v >> 32);
+  out[5] = (uint8_t)(v >> 40);
+  out[6] = (uint8_t)(v >> 48);
+  out[7] = (uint8_t)(v >> 56);
+}
+#endif  /* BROTLI_LITTLE_ENDIAN */
+
+static BROTLI_INLINE void* BROTLI_UNALIGNED_LOAD_PTR(const void* p) {
+  void* v;
+  memcpy(&v, p, sizeof(void*));
+  return v;
+}
+
+static BROTLI_INLINE void BROTLI_UNALIGNED_STORE_PTR(void* p, const void* v) {
+  memcpy(p, &v, sizeof(void*));
+}
+
+/* BROTLI_IS_CONSTANT macros returns true for compile-time constants. */
+#if BROTLI_GNUC_HAS_BUILTIN(__builtin_constant_p, 3, 0, 1) || \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0)
+#define BROTLI_IS_CONSTANT(x) (!!__builtin_constant_p(x))
+#else
+#define BROTLI_IS_CONSTANT(x) (!!0)
+#endif
+
+#if defined(BROTLI_TARGET_ARMV7) || defined(BROTLI_TARGET_ARMV8_ANY)
+#define BROTLI_HAS_UBFX (!!1)
+#else
+#define BROTLI_HAS_UBFX (!!0)
+#endif
+
+#if defined(BROTLI_ENABLE_LOG)
+#define BROTLI_LOG(x) printf x
+#else
+#define BROTLI_LOG(x)
+#endif
+
+#if defined(BROTLI_DEBUG) || defined(BROTLI_ENABLE_LOG)
+#define BROTLI_ENABLE_DUMP_DEFAULT 1
+#define BROTLI_DCHECK(x) assert(x)
+#else
+#define BROTLI_ENABLE_DUMP_DEFAULT 0
+#define BROTLI_DCHECK(x)
+#endif
+
+#if !defined(BROTLI_ENABLE_DUMP)
+#define BROTLI_ENABLE_DUMP BROTLI_ENABLE_DUMP_DEFAULT
+#endif
+
+#if BROTLI_ENABLE_DUMP
+static BROTLI_INLINE void BrotliDump(const char* f, int l, const char* fn) {
+  fprintf(stderr, "%s:%d (%s)\n", f, l, fn);
+  fflush(stderr);
+}
+#define BROTLI_DUMP() BrotliDump(__FILE__, __LINE__, __FUNCTION__)
+#else
+#define BROTLI_DUMP() (void)(0)
+#endif
+
+/* BrotliRBit assumes brotli_reg_t fits native CPU register type. */
+#if (BROTLI_64_BITS == BROTLI_TARGET_64_BITS)
+/* TODO(eustas): add appropriate icc/sunpro/arm/ibm/ti checks. */
+#if (BROTLI_GNUC_VERSION_CHECK(3, 0, 0) || defined(__llvm__)) && \
+    !defined(BROTLI_BUILD_NO_RBIT)
+#if defined(BROTLI_TARGET_ARMV7) || defined(BROTLI_TARGET_ARMV8_ANY)
+/* TODO(eustas): detect ARMv6T2 and enable this code for it. */
+static BROTLI_INLINE brotli_reg_t BrotliRBit(brotli_reg_t input) {
+  brotli_reg_t output;
+  __asm__("rbit %0, %1\n" : "=r"(output) : "r"(input));
+  return output;
+}
+#define BROTLI_RBIT(x) BrotliRBit(x)
+#endif  /* armv7 / armv8 */
+#endif  /* gcc || clang */
+#endif  /* brotli_reg_t is native */
+#if !defined(BROTLI_RBIT)
+static BROTLI_INLINE void BrotliRBit(void) { /* Should break build if used. */ }
+#endif  /* BROTLI_RBIT */
+
+#define BROTLI_REPEAT_4(X) {X; X; X; X;}
+#define BROTLI_REPEAT_5(X) {X; X; X; X; X;}
+#define BROTLI_REPEAT_6(X) {X; X; X; X; X; X;}
+
+#define BROTLI_UNUSED(X) (void)(X)
+
+#define BROTLI_MIN_MAX(T)                                                      \
+  static BROTLI_INLINE T brotli_min_ ## T (T a, T b) { return a < b ? a : b; } \
+  static BROTLI_INLINE T brotli_max_ ## T (T a, T b) { return a > b ? a : b; }
+BROTLI_MIN_MAX(double) BROTLI_MIN_MAX(float) BROTLI_MIN_MAX(int)
+BROTLI_MIN_MAX(size_t) BROTLI_MIN_MAX(uint32_t) BROTLI_MIN_MAX(uint8_t)
+#undef BROTLI_MIN_MAX
+#define BROTLI_MIN(T, A, B) (brotli_min_ ## T((A), (B)))
+#define BROTLI_MAX(T, A, B) (brotli_max_ ## T((A), (B)))
+
+#define BROTLI_SWAP(T, A, I, J) { \
+  T __brotli_swap_tmp = (A)[(I)]; \
+  (A)[(I)] = (A)[(J)];            \
+  (A)[(J)] = __brotli_swap_tmp;   \
+}
+
+#if BROTLI_64_BITS
+#if BROTLI_GNUC_HAS_BUILTIN(__builtin_ctzll, 3, 4, 0) || \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0)
+#define BROTLI_TZCNT64 __builtin_ctzll
+#elif BROTLI_MSVC_VERSION_CHECK(18, 0, 0)
+#if defined(BROTLI_TARGET_X64) && !defined(_M_ARM64EC)
+#define BROTLI_TZCNT64 _tzcnt_u64
+#else /* BROTLI_TARGET_X64 */
+static BROTLI_INLINE uint32_t BrotliBsf64Msvc(uint64_t x) {
+  uint32_t lsb;
+  _BitScanForward64(&lsb, x);
+  return lsb;
+}
+#define BROTLI_TZCNT64 BrotliBsf64Msvc
+#endif /* BROTLI_TARGET_X64 */
+#endif /* __builtin_ctzll */
+#endif /* BROTLI_64_BITS */
+
+#if BROTLI_GNUC_HAS_BUILTIN(__builtin_clz, 3, 4, 0) || \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0)
+#define BROTLI_BSR32(x) (31u ^ (uint32_t)__builtin_clz(x))
+#elif BROTLI_MSVC_VERSION_CHECK(18, 0, 0)
+static BROTLI_INLINE uint32_t BrotliBsr32Msvc(uint32_t x) {
+  unsigned long msb;
+  _BitScanReverse(&msb, x);
+  return (uint32_t)msb;
+}
+#define BROTLI_BSR32 BrotliBsr32Msvc
+#endif /* __builtin_clz */
+
+/* Default brotli_alloc_func */
+BROTLI_COMMON_API void* BrotliDefaultAllocFunc(void* opaque, size_t size);
+
+/* Default brotli_free_func */
+BROTLI_COMMON_API void BrotliDefaultFreeFunc(void* opaque, void* address);
+
+BROTLI_UNUSED_FUNCTION void BrotliSuppressUnusedFunctions(void) {
+  BROTLI_UNUSED(&BrotliSuppressUnusedFunctions);
+  BROTLI_UNUSED(&BrotliUnalignedRead16);
+  BROTLI_UNUSED(&BrotliUnalignedRead32);
+  BROTLI_UNUSED(&BrotliUnalignedRead64);
+  BROTLI_UNUSED(&BrotliUnalignedWrite64);
+  BROTLI_UNUSED(&BROTLI_UNALIGNED_LOAD16LE);
+  BROTLI_UNUSED(&BROTLI_UNALIGNED_LOAD32LE);
+  BROTLI_UNUSED(&BROTLI_UNALIGNED_LOAD64LE);
+  BROTLI_UNUSED(&BROTLI_UNALIGNED_STORE64LE);
+  BROTLI_UNUSED(&BROTLI_UNALIGNED_LOAD_PTR);
+  BROTLI_UNUSED(&BROTLI_UNALIGNED_STORE_PTR);
+  BROTLI_UNUSED(&BrotliRBit);
+  BROTLI_UNUSED(&brotli_min_double);
+  BROTLI_UNUSED(&brotli_max_double);
+  BROTLI_UNUSED(&brotli_min_float);
+  BROTLI_UNUSED(&brotli_max_float);
+  BROTLI_UNUSED(&brotli_min_int);
+  BROTLI_UNUSED(&brotli_max_int);
+  BROTLI_UNUSED(&brotli_min_size_t);
+  BROTLI_UNUSED(&brotli_max_size_t);
+  BROTLI_UNUSED(&brotli_min_uint32_t);
+  BROTLI_UNUSED(&brotli_max_uint32_t);
+  BROTLI_UNUSED(&brotli_min_uint8_t);
+  BROTLI_UNUSED(&brotli_max_uint8_t);
+  BROTLI_UNUSED(&BrotliDefaultAllocFunc);
+  BROTLI_UNUSED(&BrotliDefaultFreeFunc);
+#if BROTLI_ENABLE_DUMP
+  BROTLI_UNUSED(&BrotliDump);
+#endif
+}
+
+#endif  /* BROTLI_COMMON_PLATFORM_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/shared_dictionary.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/shared_dictionary.c
new file mode 100644
index 0000000000..49f1c9b075
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/shared_dictionary.c
@@ -0,0 +1,521 @@
+/* Copyright 2017 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Shared Dictionary definition and utilities. */
+
+#include <brotli/shared_dictionary.h>
+
+#include <memory.h>
+#include <stdlib.h>  /* malloc, free */
+#include <stdio.h>
+
+#include "dictionary.h"
+#include "platform.h"
+#include "shared_dictionary_internal.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#if defined(BROTLI_EXPERIMENTAL)
+
+#define BROTLI_NUM_ENCODED_LENGTHS (SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH \
+    - SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH + 1)
+
+/* Max allowed by spec */
+#define BROTLI_MAX_SIZE_BITS 15u
+
+/* Returns BROTLI_TRUE on success, BROTLI_FALSE on failure. */
+static BROTLI_BOOL ReadBool(const uint8_t* encoded, size_t size, size_t* pos,
+    BROTLI_BOOL* result) {
+  uint8_t value;
+  size_t position = *pos;
+  if (position >= size) return BROTLI_FALSE;  /* past file end */
+  value = encoded[position++];
+  if (value > 1) return BROTLI_FALSE;  /* invalid bool */
+  *result = TO_BROTLI_BOOL(value);
+  *pos = position;
+  return BROTLI_TRUE;  /* success */
+}
+
+/* Returns BROTLI_TRUE on success, BROTLI_FALSE on failure. */
+static BROTLI_BOOL ReadUint8(const uint8_t* encoded, size_t size, size_t* pos,
+    uint8_t* result) {
+  size_t position = *pos;
+  if (position + sizeof(uint8_t) > size) return BROTLI_FALSE;
+  *result = encoded[position++];
+  *pos = position;
+  return BROTLI_TRUE;
+}
+
+/* Returns BROTLI_TRUE on success, BROTLI_FALSE on failure. */
+static BROTLI_BOOL ReadUint16(const uint8_t* encoded, size_t size, size_t* pos,
+    uint16_t* result) {
+  size_t position = *pos;
+  if (position + sizeof(uint16_t) > size) return BROTLI_FALSE;
+  *result = BROTLI_UNALIGNED_LOAD16LE(&encoded[position]);
+  position += 2;
+  *pos = position;
+  return BROTLI_TRUE;
+}
+
+/* Reads a varint into a uint32_t, and returns error if it's too large */
+/* Returns BROTLI_TRUE on success, BROTLI_FALSE on failure. */
+static BROTLI_BOOL ReadVarint32(const uint8_t* encoded, size_t size,
+    size_t* pos, uint32_t* result) {
+  int num = 0;
+  uint8_t byte;
+  *result = 0;
+  for (;;) {
+    if (*pos >= size) return BROTLI_FALSE;
+    byte = encoded[(*pos)++];
+    if (num == 4 && byte > 15) return BROTLI_FALSE;
+    *result |= (uint32_t)(byte & 127) << (num * 7);
+    if (byte < 128) return BROTLI_TRUE;
+    num++;
+  }
+}
+
+/* Returns the total length of word list. */
+static size_t BrotliSizeBitsToOffsets(const uint8_t* size_bits_by_length,
+    uint32_t* offsets_by_length) {
+  uint32_t pos = 0;
+  uint32_t i;
+  for (i = 0; i <= SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH; i++) {
+    offsets_by_length[i] = pos;
+    if (size_bits_by_length[i] != 0) {
+      pos += i << size_bits_by_length[i];
+    }
+  }
+  return pos;
+}
+
+static BROTLI_BOOL ParseWordList(size_t size, const uint8_t* encoded,
+    size_t* pos, BrotliDictionary* out) {
+  size_t offset;
+  size_t i;
+  size_t position = *pos;
+  if (position + BROTLI_NUM_ENCODED_LENGTHS > size) {
+    return BROTLI_FALSE;
+  }
+
+  memset(out->size_bits_by_length, 0, SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH);
+  memcpy(out->size_bits_by_length + SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH,
+      &encoded[position], BROTLI_NUM_ENCODED_LENGTHS);
+  for (i = SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH;
+      i <= SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH; i++) {
+    if (out->size_bits_by_length[i] > BROTLI_MAX_SIZE_BITS) {
+      return BROTLI_FALSE;
+    }
+  }
+  position += BROTLI_NUM_ENCODED_LENGTHS;
+  offset = BrotliSizeBitsToOffsets(
+      out->size_bits_by_length, out->offsets_by_length);
+
+  out->data = &encoded[position];
+  out->data_size = offset;
+  position += offset;
+  if (position > size) return BROTLI_FALSE;
+  *pos = position;
+  return BROTLI_TRUE;
+}
+
+/* Computes the cutOffTransforms of a BrotliTransforms which already has the
+   transforms data correctly filled in. */
+static void ComputeCutoffTransforms(BrotliTransforms* transforms) {
+  uint32_t i;
+  for (i = 0; i < BROTLI_TRANSFORMS_MAX_CUT_OFF + 1; i++) {
+    transforms->cutOffTransforms[i] = -1;
+  }
+  for (i = 0; i < transforms->num_transforms; i++) {
+    const uint8_t* prefix = BROTLI_TRANSFORM_PREFIX(transforms, i);
+    uint8_t type = BROTLI_TRANSFORM_TYPE(transforms, i);
+    const uint8_t* suffix = BROTLI_TRANSFORM_SUFFIX(transforms, i);
+    if (type <= BROTLI_TRANSFORM_OMIT_LAST_9 && *prefix == 0 && *suffix == 0 &&
+        transforms->cutOffTransforms[type] == -1) {
+      transforms->cutOffTransforms[type] = (int16_t)i;
+    }
+  }
+}
+
+static BROTLI_BOOL ParsePrefixSuffixTable(size_t size, const uint8_t* encoded,
+    size_t* pos, BrotliTransforms* out, uint16_t* out_table,
+    size_t* out_table_size) {
+  size_t position = *pos;
+  size_t offset = 0;
+  size_t stringlet_count = 0;  /* NUM_PREFIX_SUFFIX */
+  size_t data_length = 0;
+
+  /* PREFIX_SUFFIX_LENGTH */
+  if (!ReadUint16(encoded, size, &position, &out->prefix_suffix_size)) {
+    return BROTLI_FALSE;
+  }
+  data_length = out->prefix_suffix_size;
+
+  /* Must at least have space for null terminator. */
+  if (data_length < 1) return BROTLI_FALSE;
+  out->prefix_suffix = &encoded[position];
+  if (position + data_length >= size) return BROTLI_FALSE;
+  while (BROTLI_TRUE) {
+    /* STRING_LENGTH */
+    size_t stringlet_len = encoded[position + offset];
+    out_table[stringlet_count] = (uint16_t)offset;
+    stringlet_count++;
+    offset++;
+    if (stringlet_len == 0) {
+      if (offset == data_length) {
+        break;
+      } else {
+        return BROTLI_FALSE;
+      }
+    }
+    if (stringlet_count > 255) return BROTLI_FALSE;
+    offset += stringlet_len;
+    if (offset >= data_length) return BROTLI_FALSE;
+  }
+
+  position += data_length;
+  *pos = position;
+  *out_table_size = (uint16_t)stringlet_count;
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL ParseTransformsList(size_t size, const uint8_t* encoded,
+    size_t* pos, BrotliTransforms* out, uint16_t* prefix_suffix_table,
+    size_t* prefix_suffix_count) {
+  uint32_t i;
+  BROTLI_BOOL has_params = BROTLI_FALSE;
+  BROTLI_BOOL prefix_suffix_ok = BROTLI_FALSE;
+  size_t position = *pos;
+  size_t stringlet_cnt = 0;
+  if (position >= size) return BROTLI_FALSE;
+
+  prefix_suffix_ok = ParsePrefixSuffixTable(
+      size, encoded, &position, out, prefix_suffix_table, &stringlet_cnt);
+  if (!prefix_suffix_ok) return BROTLI_FALSE;
+  out->prefix_suffix_map = prefix_suffix_table;
+  *prefix_suffix_count = stringlet_cnt;
+
+  out->num_transforms = encoded[position++];
+  out->transforms = &encoded[position];
+  position += (size_t)out->num_transforms * 3;
+  if (position > size) return BROTLI_FALSE;
+  /* Check for errors and read extra parameters. */
+  for (i = 0; i < out->num_transforms; i++) {
+    uint8_t prefix_id = BROTLI_TRANSFORM_PREFIX_ID(out, i);
+    uint8_t type = BROTLI_TRANSFORM_TYPE(out, i);
+    uint8_t suffix_id = BROTLI_TRANSFORM_SUFFIX_ID(out, i);
+    if (prefix_id >= stringlet_cnt) return BROTLI_FALSE;
+    if (type >= BROTLI_NUM_TRANSFORM_TYPES) return BROTLI_FALSE;
+    if (suffix_id >= stringlet_cnt) return BROTLI_FALSE;
+    if (type == BROTLI_TRANSFORM_SHIFT_FIRST ||
+        type == BROTLI_TRANSFORM_SHIFT_ALL) {
+      has_params = BROTLI_TRUE;
+    }
+  }
+  if (has_params) {
+    out->params = &encoded[position];
+    position += (size_t)out->num_transforms * 2;
+    if (position > size) return BROTLI_FALSE;
+    for (i = 0; i < out->num_transforms; i++) {
+      uint8_t type = BROTLI_TRANSFORM_TYPE(out, i);
+      if (type != BROTLI_TRANSFORM_SHIFT_FIRST &&
+          type != BROTLI_TRANSFORM_SHIFT_ALL) {
+        if (out->params[i * 2] != 0 || out->params[i * 2 + 1] != 0) {
+          return BROTLI_FALSE;
+        }
+      }
+    }
+  } else {
+    out->params = NULL;
+  }
+  ComputeCutoffTransforms(out);
+  *pos = position;
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL DryParseDictionary(const uint8_t* encoded,
+    size_t size, uint32_t* num_prefix, BROTLI_BOOL* is_custom_static_dict) {
+  size_t pos = 0;
+  uint32_t chunk_size = 0;
+  uint8_t num_word_lists;
+  uint8_t num_transform_lists;
+  *is_custom_static_dict = BROTLI_FALSE;
+  *num_prefix = 0;
+
+  /* Skip magic header bytes. */
+  pos += 2;
+
+  /* LZ77_DICTIONARY_LENGTH */
+  if (!ReadVarint32(encoded, size, &pos, &chunk_size)) return BROTLI_FALSE;
+  if (chunk_size != 0) {
+    /* This limitation is not specified but the 32-bit Brotli decoder for now */
+    if (chunk_size > 1073741823) return BROTLI_FALSE;
+    *num_prefix = 1;
+    if (pos + chunk_size > size) return BROTLI_FALSE;
+    pos += chunk_size;
+  }
+
+  if (!ReadUint8(encoded, size, &pos, &num_word_lists)) {
+    return BROTLI_FALSE;
+  }
+  if (!ReadUint8(encoded, size, &pos, &num_transform_lists)) {
+    return BROTLI_FALSE;
+  }
+
+  if (num_word_lists > 0 || num_transform_lists > 0) {
+    *is_custom_static_dict = BROTLI_TRUE;
+  }
+
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL ParseDictionary(const uint8_t* encoded, size_t size,
+    BrotliSharedDictionary* dict) {
+  uint32_t i;
+  size_t pos = 0;
+  uint32_t chunk_size = 0;
+  size_t total_prefix_suffix_count = 0;
+  size_t trasform_list_start[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];
+  uint16_t temporary_prefix_suffix_table[256];
+
+  /* Skip magic header bytes. */
+  pos += 2;
+
+  /* LZ77_DICTIONARY_LENGTH */
+  if (!ReadVarint32(encoded, size, &pos, &chunk_size)) return BROTLI_FALSE;
+  if (chunk_size != 0) {
+    if (pos + chunk_size > size) return BROTLI_FALSE;
+    dict->prefix_size[dict->num_prefix] = chunk_size;
+    dict->prefix[dict->num_prefix] = &encoded[pos];
+    dict->num_prefix++;
+    /* LZ77_DICTIONARY_LENGTH bytes. */
+    pos += chunk_size;
+  }
+
+  /* NUM_WORD_LISTS */
+  if (!ReadUint8(encoded, size, &pos, &dict->num_word_lists)) {
+    return BROTLI_FALSE;
+  }
+  if (dict->num_word_lists > SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS) {
+    return BROTLI_FALSE;
+  }
+
+  if (dict->num_word_lists != 0) {
+    dict->words_instances = (BrotliDictionary*)dict->alloc_func(
+        dict->memory_manager_opaque,
+        dict->num_word_lists * sizeof(*dict->words_instances));
+    if (!dict->words_instances) return BROTLI_FALSE;  /* OOM */
+  }
+  for (i = 0; i < dict->num_word_lists; i++) {
+    if (!ParseWordList(size, encoded, &pos, &dict->words_instances[i])) {
+      return BROTLI_FALSE;
+    }
+  }
+
+  /* NUM_TRANSFORM_LISTS */
+  if (!ReadUint8(encoded, size, &pos, &dict->num_transform_lists)) {
+    return BROTLI_FALSE;
+  }
+  if (dict->num_transform_lists > SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS) {
+    return BROTLI_FALSE;
+  }
+
+  if (dict->num_transform_lists != 0) {
+    dict->transforms_instances = (BrotliTransforms*)dict->alloc_func(
+        dict->memory_manager_opaque,
+        dict->num_transform_lists * sizeof(*dict->transforms_instances));
+    if (!dict->transforms_instances) return BROTLI_FALSE;  /* OOM */
+  }
+  for (i = 0; i < dict->num_transform_lists; i++) {
+    BROTLI_BOOL ok = BROTLI_FALSE;
+    size_t prefix_suffix_count = 0;
+    trasform_list_start[i] = pos;
+    dict->transforms_instances[i].prefix_suffix_map =
+        temporary_prefix_suffix_table;
+    ok = ParseTransformsList(
+        size, encoded, &pos, &dict->transforms_instances[i],
+        temporary_prefix_suffix_table, &prefix_suffix_count);
+    if (!ok) return BROTLI_FALSE;
+    total_prefix_suffix_count += prefix_suffix_count;
+  }
+  if (total_prefix_suffix_count != 0) {
+    dict->prefix_suffix_maps = (uint16_t*)dict->alloc_func(
+        dict->memory_manager_opaque,
+        total_prefix_suffix_count * sizeof(*dict->prefix_suffix_maps));
+    if (!dict->prefix_suffix_maps) return BROTLI_FALSE;  /* OOM */
+  }
+  total_prefix_suffix_count = 0;
+  for (i = 0; i < dict->num_transform_lists; i++) {
+    size_t prefix_suffix_count = 0;
+    size_t position = trasform_list_start[i];
+    uint16_t* prefix_suffix_map =
+      &dict->prefix_suffix_maps[total_prefix_suffix_count];
+    BROTLI_BOOL ok = ParsePrefixSuffixTable(
+        size, encoded, &position, &dict->transforms_instances[i],
+        prefix_suffix_map, &prefix_suffix_count);
+    if (!ok) return BROTLI_FALSE;
+    dict->transforms_instances[i].prefix_suffix_map = prefix_suffix_map;
+    total_prefix_suffix_count += prefix_suffix_count;
+  }
+
+  if (dict->num_word_lists != 0 || dict->num_transform_lists != 0) {
+    if (!ReadUint8(encoded, size, &pos, &dict->num_dictionaries)) {
+      return BROTLI_FALSE;
+    }
+    if (dict->num_dictionaries == 0 ||
+        dict->num_dictionaries > SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS) {
+      return BROTLI_FALSE;
+    }
+    for (i = 0; i < dict->num_dictionaries; i++) {
+      uint8_t words_index;
+      uint8_t transforms_index;
+      if (!ReadUint8(encoded, size, &pos, &words_index)) {
+        return BROTLI_FALSE;
+      }
+      if (words_index > dict->num_word_lists) return BROTLI_FALSE;
+      if (!ReadUint8(encoded, size, &pos, &transforms_index)) {
+        return BROTLI_FALSE;
+      }
+      if (transforms_index > dict->num_transform_lists) return BROTLI_FALSE;
+      dict->words[i] = words_index == dict->num_word_lists ?
+          BrotliGetDictionary() : &dict->words_instances[words_index];
+      dict->transforms[i] = transforms_index == dict->num_transform_lists ?
+          BrotliGetTransforms(): &dict->transforms_instances[transforms_index];
+    }
+    /* CONTEXT_ENABLED */
+    if (!ReadBool(encoded, size, &pos, &dict->context_based)) {
+      return BROTLI_FALSE;
+    }
+
+    /* CONTEXT_MAP */
+    if (dict->context_based) {
+      for (i = 0; i < SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS; i++) {
+        if (!ReadUint8(encoded, size, &pos, &dict->context_map[i])) {
+          return BROTLI_FALSE;
+        }
+        if (dict->context_map[i] >= dict->num_dictionaries) {
+          return BROTLI_FALSE;
+        }
+      }
+    }
+  } else {
+    dict->context_based = BROTLI_FALSE;
+    dict->num_dictionaries = 1;
+    dict->words[0] = BrotliGetDictionary();
+    dict->transforms[0] = BrotliGetTransforms();
+  }
+
+  return BROTLI_TRUE;
+}
+
+/* Decodes shared dictionary and verifies correctness.
+   Returns BROTLI_TRUE if dictionary is valid, BROTLI_FALSE otherwise.
+   The BrotliSharedDictionary must already have been initialized. If the
+   BrotliSharedDictionary already contains data, compound dictionaries
+   will be appended, but an error will be returned if it already has
+   custom words or transforms.
+   TODO(lode): link to RFC for shared brotli once published. */
+static BROTLI_BOOL DecodeSharedDictionary(
+    const uint8_t* encoded, size_t size, BrotliSharedDictionary* dict) {
+  uint32_t num_prefix = 0;
+  BROTLI_BOOL is_custom_static_dict = BROTLI_FALSE;
+  BROTLI_BOOL has_custom_static_dict =
+      dict->num_word_lists > 0 || dict->num_transform_lists > 0;
+
+  /* Check magic header bytes. */
+  if (size < 2) return BROTLI_FALSE;
+  if (encoded[0] != 0x91 || encoded[1] != 0) return BROTLI_FALSE;
+
+  if (!DryParseDictionary(encoded, size, &num_prefix, &is_custom_static_dict)) {
+    return BROTLI_FALSE;
+  }
+
+  if (num_prefix + dict->num_prefix > SHARED_BROTLI_MAX_COMPOUND_DICTS) {
+    return BROTLI_FALSE;
+  }
+
+  /* Cannot combine different static dictionaries, only prefix dictionaries */
+  if (has_custom_static_dict && is_custom_static_dict) return BROTLI_FALSE;
+
+  return ParseDictionary(encoded, size, dict);
+}
+
+#endif  /* BROTLI_EXPERIMENTAL */
+
+void BrotliSharedDictionaryDestroyInstance(
+    BrotliSharedDictionary* dict) {
+  if (!dict) {
+    return;
+  } else {
+    brotli_free_func free_func = dict->free_func;
+    void* opaque = dict->memory_manager_opaque;
+    /* Cleanup. */
+    free_func(opaque, dict->words_instances);
+    free_func(opaque, dict->transforms_instances);
+    free_func(opaque, dict->prefix_suffix_maps);
+    /* Self-destruction. */
+    free_func(opaque, dict);
+  }
+}
+
+BROTLI_BOOL BrotliSharedDictionaryAttach(
+    BrotliSharedDictionary* dict, BrotliSharedDictionaryType type,
+    size_t data_size, const uint8_t data[BROTLI_ARRAY_PARAM(data_size)]) {
+  if (!dict) {
+    return BROTLI_FALSE;
+  }
+#if defined(BROTLI_EXPERIMENTAL)
+  if (type == BROTLI_SHARED_DICTIONARY_SERIALIZED) {
+    return DecodeSharedDictionary(data, data_size, dict);
+  }
+#endif  /* BROTLI_EXPERIMENTAL */
+  if (type == BROTLI_SHARED_DICTIONARY_RAW) {
+    if (dict->num_prefix >= SHARED_BROTLI_MAX_COMPOUND_DICTS) {
+      return BROTLI_FALSE;
+    }
+    dict->prefix_size[dict->num_prefix] = data_size;
+    dict->prefix[dict->num_prefix] = data;
+    dict->num_prefix++;
+    return BROTLI_TRUE;
+  }
+  return BROTLI_FALSE;
+}
+
+BrotliSharedDictionary* BrotliSharedDictionaryCreateInstance(
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {
+  BrotliSharedDictionary* dict = 0;
+  if (!alloc_func && !free_func) {
+    dict = (BrotliSharedDictionary*)malloc(sizeof(BrotliSharedDictionary));
+  } else if (alloc_func && free_func) {
+    dict = (BrotliSharedDictionary*)alloc_func(
+        opaque, sizeof(BrotliSharedDictionary));
+  }
+  if (dict == 0) {
+    return 0;
+  }
+
+  /* TODO(eustas): explicitly initialize all the fields? */
+  memset(dict, 0, sizeof(BrotliSharedDictionary));
+
+  dict->context_based = BROTLI_FALSE;
+  dict->num_dictionaries = 1;
+  dict->num_word_lists = 0;
+  dict->num_transform_lists = 0;
+
+  dict->words[0] = BrotliGetDictionary();
+  dict->transforms[0] = BrotliGetTransforms();
+
+  dict->alloc_func = alloc_func ? alloc_func : BrotliDefaultAllocFunc;
+  dict->free_func = free_func ? free_func : BrotliDefaultFreeFunc;
+  dict->memory_manager_opaque = opaque;
+
+  return dict;
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/shared_dictionary_internal.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/shared_dictionary_internal.h
new file mode 100644
index 0000000000..963762e432
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/shared_dictionary_internal.h
@@ -0,0 +1,75 @@
+/* Copyright 2017 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* (Transparent) Shared Dictionary definition. */
+
+#ifndef BROTLI_COMMON_SHARED_DICTIONARY_INTERNAL_H_
+#define BROTLI_COMMON_SHARED_DICTIONARY_INTERNAL_H_
+
+#include <brotli/shared_dictionary.h>
+#include <brotli/types.h>
+
+#include "dictionary.h"
+#include "transform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+struct BrotliSharedDictionaryStruct {
+  /* LZ77 prefixes (compound dictionary). */
+  uint32_t num_prefix;  /* max SHARED_BROTLI_MAX_COMPOUND_DICTS */
+  size_t prefix_size[SHARED_BROTLI_MAX_COMPOUND_DICTS];
+  const uint8_t* prefix[SHARED_BROTLI_MAX_COMPOUND_DICTS];
+
+  /* If set, the context map is used to select word and transform list from 64
+     contexts, if not set, the context map is not used and only words[0] and
+     transforms[0] are to be used. */
+  BROTLI_BOOL context_based;
+
+  uint8_t context_map[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];
+
+  /* Amount of word_list+transform_list combinations. */
+  uint8_t num_dictionaries;
+
+  /* Must use num_dictionaries values. */
+  const BrotliDictionary* words[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];
+
+  /* Must use num_dictionaries values. */
+  const BrotliTransforms* transforms[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];
+
+  /* Amount of custom word lists. May be 0 if only Brotli's built-in is used */
+  uint8_t num_word_lists;
+
+  /* Contents of the custom words lists. Must be NULL if num_word_lists is 0. */
+  BrotliDictionary* words_instances;
+
+  /* Amount of custom transform lists. May be 0 if only Brotli's built-in is
+     used */
+  uint8_t num_transform_lists;
+
+  /* Contents of the custom transform lists. Must be NULL if num_transform_lists
+     is 0. */
+  BrotliTransforms* transforms_instances;
+
+  /* Concatenated prefix_suffix_maps of the custom transform lists. Must be NULL
+     if num_transform_lists is 0. */
+  uint16_t* prefix_suffix_maps;
+
+  /* Memory management */
+  brotli_alloc_func alloc_func;
+  brotli_free_func free_func;
+  void* memory_manager_opaque;
+};
+
+typedef struct BrotliSharedDictionaryStruct BrotliSharedDictionaryInternal;
+#define BrotliSharedDictionary BrotliSharedDictionaryInternal
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_COMMON_SHARED_DICTIONARY_INTERNAL_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/transform.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/transform.c
new file mode 100644
index 0000000000..49455fc496
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/transform.c
@@ -0,0 +1,291 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include "transform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* RFC 7932 transforms string data */
+static const char kPrefixSuffix[217] =
+      "\1 \2, \10 of the \4 of \2s \1.\5 and \4 "
+/* 0x  _0 _2  __5        _E    _3  _6 _8     _E */
+      "in \1\"\4 to \2\">\1\n\2. \1]\5 for \3 a \6 "
+/* 2x     _3_ _5    _A_  _D_ _F  _2 _4     _A   _E */
+      "that \1\'\6 with \6 from \4 by \1(\6. T"
+/* 4x       _5_ _7      _E      _5    _A _C */
+      "he \4 on \4 as \4 is \4ing \2\n\t\1:\3ed "
+/* 6x     _3    _8    _D    _2    _7_ _ _A _C */
+      "\2=\"\4 at \3ly \1,\2=\'\5.com/\7. This \5"
+/* 8x  _0 _ _3    _8   _C _E _ _1     _7       _F */
+      " not \3er \3al \4ful \4ive \5less \4es"
+/* Ax       _5   _9   _D    _2    _7     _D */
+      "t \4ize \2\xc2\xa0\4ous \5 the \2e "; /* \0 - implicit trailing zero. */
+/* Cx    _2    _7___ ___ _A    _F     _5        _8 */
+
+static const uint16_t kPrefixSuffixMap[50] = {
+  0x00, 0x02, 0x05, 0x0E, 0x13, 0x16, 0x18, 0x1E, 0x23, 0x25,
+  0x2A, 0x2D, 0x2F, 0x32, 0x34, 0x3A, 0x3E, 0x45, 0x47, 0x4E,
+  0x55, 0x5A, 0x5C, 0x63, 0x68, 0x6D, 0x72, 0x77, 0x7A, 0x7C,
+  0x80, 0x83, 0x88, 0x8C, 0x8E, 0x91, 0x97, 0x9F, 0xA5, 0xA9,
+  0xAD, 0xB2, 0xB7, 0xBD, 0xC2, 0xC7, 0xCA, 0xCF, 0xD5, 0xD8
+};
+
+/* RFC 7932 transforms */
+static const uint8_t kTransformsData[] = {
+  49, BROTLI_TRANSFORM_IDENTITY, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 0,
+   0, BROTLI_TRANSFORM_IDENTITY, 0,
+  49, BROTLI_TRANSFORM_OMIT_FIRST_1, 49,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 0,
+  49, BROTLI_TRANSFORM_IDENTITY, 47,
+   0, BROTLI_TRANSFORM_IDENTITY, 49,
+   4, BROTLI_TRANSFORM_IDENTITY, 0,
+  49, BROTLI_TRANSFORM_IDENTITY, 3,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 6,
+  49, BROTLI_TRANSFORM_OMIT_FIRST_2, 49,
+  49, BROTLI_TRANSFORM_OMIT_LAST_1, 49,
+   1, BROTLI_TRANSFORM_IDENTITY, 0,
+  49, BROTLI_TRANSFORM_IDENTITY, 1,
+   0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 0,
+  49, BROTLI_TRANSFORM_IDENTITY, 7,
+  49, BROTLI_TRANSFORM_IDENTITY, 9,
+  48, BROTLI_TRANSFORM_IDENTITY, 0,
+  49, BROTLI_TRANSFORM_IDENTITY, 8,
+  49, BROTLI_TRANSFORM_IDENTITY, 5,
+  49, BROTLI_TRANSFORM_IDENTITY, 10,
+  49, BROTLI_TRANSFORM_IDENTITY, 11,
+  49, BROTLI_TRANSFORM_OMIT_LAST_3, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 13,
+  49, BROTLI_TRANSFORM_IDENTITY, 14,
+  49, BROTLI_TRANSFORM_OMIT_FIRST_3, 49,
+  49, BROTLI_TRANSFORM_OMIT_LAST_2, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 15,
+  49, BROTLI_TRANSFORM_IDENTITY, 16,
+   0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 12,
+   5, BROTLI_TRANSFORM_IDENTITY, 49,
+   0, BROTLI_TRANSFORM_IDENTITY, 1,
+  49, BROTLI_TRANSFORM_OMIT_FIRST_4, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 18,
+  49, BROTLI_TRANSFORM_IDENTITY, 17,
+  49, BROTLI_TRANSFORM_IDENTITY, 19,
+  49, BROTLI_TRANSFORM_IDENTITY, 20,
+  49, BROTLI_TRANSFORM_OMIT_FIRST_5, 49,
+  49, BROTLI_TRANSFORM_OMIT_FIRST_6, 49,
+  47, BROTLI_TRANSFORM_IDENTITY, 49,
+  49, BROTLI_TRANSFORM_OMIT_LAST_4, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 22,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 23,
+  49, BROTLI_TRANSFORM_IDENTITY, 24,
+  49, BROTLI_TRANSFORM_IDENTITY, 25,
+  49, BROTLI_TRANSFORM_OMIT_LAST_7, 49,
+  49, BROTLI_TRANSFORM_OMIT_LAST_1, 26,
+  49, BROTLI_TRANSFORM_IDENTITY, 27,
+  49, BROTLI_TRANSFORM_IDENTITY, 28,
+   0, BROTLI_TRANSFORM_IDENTITY, 12,
+  49, BROTLI_TRANSFORM_IDENTITY, 29,
+  49, BROTLI_TRANSFORM_OMIT_FIRST_9, 49,
+  49, BROTLI_TRANSFORM_OMIT_FIRST_7, 49,
+  49, BROTLI_TRANSFORM_OMIT_LAST_6, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 21,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 1,
+  49, BROTLI_TRANSFORM_OMIT_LAST_8, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 31,
+  49, BROTLI_TRANSFORM_IDENTITY, 32,
+  47, BROTLI_TRANSFORM_IDENTITY, 3,
+  49, BROTLI_TRANSFORM_OMIT_LAST_5, 49,
+  49, BROTLI_TRANSFORM_OMIT_LAST_9, 49,
+   0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 1,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 8,
+   5, BROTLI_TRANSFORM_IDENTITY, 21,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 0,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 10,
+  49, BROTLI_TRANSFORM_IDENTITY, 30,
+   0, BROTLI_TRANSFORM_IDENTITY, 5,
+  35, BROTLI_TRANSFORM_IDENTITY, 49,
+  47, BROTLI_TRANSFORM_IDENTITY, 2,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 17,
+  49, BROTLI_TRANSFORM_IDENTITY, 36,
+  49, BROTLI_TRANSFORM_IDENTITY, 33,
+   5, BROTLI_TRANSFORM_IDENTITY, 0,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 21,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 5,
+  49, BROTLI_TRANSFORM_IDENTITY, 37,
+   0, BROTLI_TRANSFORM_IDENTITY, 30,
+  49, BROTLI_TRANSFORM_IDENTITY, 38,
+   0, BROTLI_TRANSFORM_UPPERCASE_ALL, 0,
+  49, BROTLI_TRANSFORM_IDENTITY, 39,
+   0, BROTLI_TRANSFORM_UPPERCASE_ALL, 49,
+  49, BROTLI_TRANSFORM_IDENTITY, 34,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 8,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 12,
+   0, BROTLI_TRANSFORM_IDENTITY, 21,
+  49, BROTLI_TRANSFORM_IDENTITY, 40,
+   0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 12,
+  49, BROTLI_TRANSFORM_IDENTITY, 41,
+  49, BROTLI_TRANSFORM_IDENTITY, 42,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 17,
+  49, BROTLI_TRANSFORM_IDENTITY, 43,
+   0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 5,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 10,
+   0, BROTLI_TRANSFORM_IDENTITY, 34,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 33,
+  49, BROTLI_TRANSFORM_IDENTITY, 44,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 5,
+  45, BROTLI_TRANSFORM_IDENTITY, 49,
+   0, BROTLI_TRANSFORM_IDENTITY, 33,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 30,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 30,
+  49, BROTLI_TRANSFORM_IDENTITY, 46,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 1,
+  49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 34,
+   0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 33,
+   0, BROTLI_TRANSFORM_UPPERCASE_ALL, 30,
+   0, BROTLI_TRANSFORM_UPPERCASE_ALL, 1,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 33,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 21,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 12,
+   0, BROTLI_TRANSFORM_UPPERCASE_ALL, 5,
+  49, BROTLI_TRANSFORM_UPPERCASE_ALL, 34,
+   0, BROTLI_TRANSFORM_UPPERCASE_ALL, 12,
+   0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 30,
+   0, BROTLI_TRANSFORM_UPPERCASE_ALL, 34,
+   0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 34,
+};
+
+static const BrotliTransforms kBrotliTransforms = {
+  sizeof(kPrefixSuffix),
+  (const uint8_t*)kPrefixSuffix,
+  kPrefixSuffixMap,
+  sizeof(kTransformsData) / (3 * sizeof(kTransformsData[0])),
+  kTransformsData,
+  NULL,  /* no extra parameters */
+  {0, 12, 27, 23, 42, 63, 56, 48, 59, 64}
+};
+
+const BrotliTransforms* BrotliGetTransforms(void) {
+  return &kBrotliTransforms;
+}
+
+static int ToUpperCase(uint8_t* p) {
+  if (p[0] < 0xC0) {
+    if (p[0] >= 'a' && p[0] <= 'z') {
+      p[0] ^= 32;
+    }
+    return 1;
+  }
+  /* An overly simplified uppercasing model for UTF-8. */
+  if (p[0] < 0xE0) {
+    p[1] ^= 32;
+    return 2;
+  }
+  /* An arbitrary transform for three byte characters. */
+  p[2] ^= 5;
+  return 3;
+}
+
+static int Shift(uint8_t* word, int word_len, uint16_t parameter) {
+  /* Limited sign extension: scalar < (1 << 24). */
+  uint32_t scalar =
+      (parameter & 0x7FFFu) + (0x1000000u - (parameter & 0x8000u));
+  if (word[0] < 0x80) {
+    /* 1-byte rune / 0sssssss / 7 bit scalar (ASCII). */
+    scalar += (uint32_t)word[0];
+    word[0] = (uint8_t)(scalar & 0x7Fu);
+    return 1;
+  } else if (word[0] < 0xC0) {
+    /* Continuation / 10AAAAAA. */
+    return 1;
+  } else if (word[0] < 0xE0) {
+    /* 2-byte rune / 110sssss AAssssss / 11 bit scalar. */
+    if (word_len < 2) return 1;
+    scalar += (uint32_t)((word[1] & 0x3Fu) | ((word[0] & 0x1Fu) << 6u));
+    word[0] = (uint8_t)(0xC0 | ((scalar >> 6u) & 0x1F));
+    word[1] = (uint8_t)((word[1] & 0xC0) | (scalar & 0x3F));
+    return 2;
+  } else if (word[0] < 0xF0) {
+    /* 3-byte rune / 1110ssss AAssssss BBssssss / 16 bit scalar. */
+    if (word_len < 3) return word_len;
+    scalar += (uint32_t)((word[2] & 0x3Fu) | ((word[1] & 0x3Fu) << 6u) |
+        ((word[0] & 0x0Fu) << 12u));
+    word[0] = (uint8_t)(0xE0 | ((scalar >> 12u) & 0x0F));
+    word[1] = (uint8_t)((word[1] & 0xC0) | ((scalar >> 6u) & 0x3F));
+    word[2] = (uint8_t)((word[2] & 0xC0) | (scalar & 0x3F));
+    return 3;
+  } else if (word[0] < 0xF8) {
+    /* 4-byte rune / 11110sss AAssssss BBssssss CCssssss / 21 bit scalar. */
+    if (word_len < 4) return word_len;
+    scalar += (uint32_t)((word[3] & 0x3Fu) | ((word[2] & 0x3Fu) << 6u) |
+        ((word[1] & 0x3Fu) << 12u) | ((word[0] & 0x07u) << 18u));
+    word[0] = (uint8_t)(0xF0 | ((scalar >> 18u) & 0x07));
+    word[1] = (uint8_t)((word[1] & 0xC0) | ((scalar >> 12u) & 0x3F));
+    word[2] = (uint8_t)((word[2] & 0xC0) | ((scalar >> 6u) & 0x3F));
+    word[3] = (uint8_t)((word[3] & 0xC0) | (scalar & 0x3F));
+    return 4;
+  }
+  return 1;
+}
+
+int BrotliTransformDictionaryWord(uint8_t* dst, const uint8_t* word, int len,
+    const BrotliTransforms* transforms, int transform_idx) {
+  int idx = 0;
+  const uint8_t* prefix = BROTLI_TRANSFORM_PREFIX(transforms, transform_idx);
+  uint8_t type = BROTLI_TRANSFORM_TYPE(transforms, transform_idx);
+  const uint8_t* suffix = BROTLI_TRANSFORM_SUFFIX(transforms, transform_idx);
+  {
+    int prefix_len = *prefix++;
+    while (prefix_len--) { dst[idx++] = *prefix++; }
+  }
+  {
+    const int t = type;
+    int i = 0;
+    if (t <= BROTLI_TRANSFORM_OMIT_LAST_9) {
+      len -= t;
+    } else if (t >= BROTLI_TRANSFORM_OMIT_FIRST_1
+        && t <= BROTLI_TRANSFORM_OMIT_FIRST_9) {
+      int skip = t - (BROTLI_TRANSFORM_OMIT_FIRST_1 - 1);
+      word += skip;
+      len -= skip;
+    }
+    while (i < len) { dst[idx++] = word[i++]; }
+    if (t == BROTLI_TRANSFORM_UPPERCASE_FIRST) {
+      ToUpperCase(&dst[idx - len]);
+    } else if (t == BROTLI_TRANSFORM_UPPERCASE_ALL) {
+      uint8_t* uppercase = &dst[idx - len];
+      while (len > 0) {
+        int step = ToUpperCase(uppercase);
+        uppercase += step;
+        len -= step;
+      }
+    } else if (t == BROTLI_TRANSFORM_SHIFT_FIRST) {
+      uint16_t param = (uint16_t)(transforms->params[transform_idx * 2]
+          + (transforms->params[transform_idx * 2 + 1] << 8u));
+      Shift(&dst[idx - len], len, param);
+    } else if (t == BROTLI_TRANSFORM_SHIFT_ALL) {
+      uint16_t param = (uint16_t)(transforms->params[transform_idx * 2]
+          + (transforms->params[transform_idx * 2 + 1] << 8u));
+      uint8_t* shift = &dst[idx - len];
+      while (len > 0) {
+        int step = Shift(shift, len, param);
+        shift += step;
+        len -= step;
+      }
+    }
+  }
+  {
+    int suffix_len = *suffix++;
+    while (suffix_len--) { dst[idx++] = *suffix++; }
+    return idx;
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/transform.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/transform.h
new file mode 100644
index 0000000000..b6f86cc7d5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/transform.h
@@ -0,0 +1,85 @@
+/* transforms is a part of ABI, but not API.
+
+   It means that there are some functions that are supposed to be in "common"
+   library, but header itself is not placed into include/brotli. This way,
+   aforementioned functions will be available only to brotli internals.
+ */
+
+#ifndef BROTLI_COMMON_TRANSFORM_H_
+#define BROTLI_COMMON_TRANSFORM_H_
+
+#include <brotli/port.h>
+#include <brotli/types.h>
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+enum BrotliWordTransformType {
+  BROTLI_TRANSFORM_IDENTITY = 0,
+  BROTLI_TRANSFORM_OMIT_LAST_1 = 1,
+  BROTLI_TRANSFORM_OMIT_LAST_2 = 2,
+  BROTLI_TRANSFORM_OMIT_LAST_3 = 3,
+  BROTLI_TRANSFORM_OMIT_LAST_4 = 4,
+  BROTLI_TRANSFORM_OMIT_LAST_5 = 5,
+  BROTLI_TRANSFORM_OMIT_LAST_6 = 6,
+  BROTLI_TRANSFORM_OMIT_LAST_7 = 7,
+  BROTLI_TRANSFORM_OMIT_LAST_8 = 8,
+  BROTLI_TRANSFORM_OMIT_LAST_9 = 9,
+  BROTLI_TRANSFORM_UPPERCASE_FIRST = 10,
+  BROTLI_TRANSFORM_UPPERCASE_ALL = 11,
+  BROTLI_TRANSFORM_OMIT_FIRST_1 = 12,
+  BROTLI_TRANSFORM_OMIT_FIRST_2 = 13,
+  BROTLI_TRANSFORM_OMIT_FIRST_3 = 14,
+  BROTLI_TRANSFORM_OMIT_FIRST_4 = 15,
+  BROTLI_TRANSFORM_OMIT_FIRST_5 = 16,
+  BROTLI_TRANSFORM_OMIT_FIRST_6 = 17,
+  BROTLI_TRANSFORM_OMIT_FIRST_7 = 18,
+  BROTLI_TRANSFORM_OMIT_FIRST_8 = 19,
+  BROTLI_TRANSFORM_OMIT_FIRST_9 = 20,
+  BROTLI_TRANSFORM_SHIFT_FIRST = 21,
+  BROTLI_TRANSFORM_SHIFT_ALL = 22,
+  BROTLI_NUM_TRANSFORM_TYPES  /* Counts transforms, not a transform itself. */
+};
+
+#define BROTLI_TRANSFORMS_MAX_CUT_OFF BROTLI_TRANSFORM_OMIT_LAST_9
+
+typedef struct BrotliTransforms {
+  uint16_t prefix_suffix_size;
+  /* Last character must be null, so prefix_suffix_size must be at least 1. */
+  const uint8_t* prefix_suffix;
+  const uint16_t* prefix_suffix_map;
+  uint32_t num_transforms;
+  /* Each entry is a [prefix_id, transform, suffix_id] triplet. */
+  const uint8_t* transforms;
+  /* Shift for BROTLI_TRANSFORM_SHIFT_FIRST and BROTLI_TRANSFORM_SHIFT_ALL,
+     must be NULL if and only if no such transforms are present. */
+  const uint8_t* params;
+  /* Indices of transforms like ["", BROTLI_TRANSFORM_OMIT_LAST_#, ""].
+     0-th element corresponds to ["", BROTLI_TRANSFORM_IDENTITY, ""].
+     -1, if cut-off transform does not exist. */
+  int16_t cutOffTransforms[BROTLI_TRANSFORMS_MAX_CUT_OFF + 1];
+} BrotliTransforms;
+
+/* T is BrotliTransforms*; result is uint8_t. */
+#define BROTLI_TRANSFORM_PREFIX_ID(T, I) ((T)->transforms[((I) * 3) + 0])
+#define BROTLI_TRANSFORM_TYPE(T, I)      ((T)->transforms[((I) * 3) + 1])
+#define BROTLI_TRANSFORM_SUFFIX_ID(T, I) ((T)->transforms[((I) * 3) + 2])
+
+/* T is BrotliTransforms*; result is const uint8_t*. */
+#define BROTLI_TRANSFORM_PREFIX(T, I) (&(T)->prefix_suffix[ \
+    (T)->prefix_suffix_map[BROTLI_TRANSFORM_PREFIX_ID(T, I)]])
+#define BROTLI_TRANSFORM_SUFFIX(T, I) (&(T)->prefix_suffix[ \
+    (T)->prefix_suffix_map[BROTLI_TRANSFORM_SUFFIX_ID(T, I)]])
+
+BROTLI_COMMON_API const BrotliTransforms* BrotliGetTransforms(void);
+
+BROTLI_COMMON_API int BrotliTransformDictionaryWord(
+    uint8_t* dst, const uint8_t* word, int len,
+    const BrotliTransforms* transforms, int transform_idx);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_COMMON_TRANSFORM_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/version.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/version.h
new file mode 100644
index 0000000000..8098040f64
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/common/version.h
@@ -0,0 +1,51 @@
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Version definition. */
+
+#ifndef BROTLI_COMMON_VERSION_H_
+#define BROTLI_COMMON_VERSION_H_
+
+/* Compose 3 components into a single number. In a hexadecimal representation
+   B and C components occupy exactly 3 digits. */
+#define BROTLI_MAKE_HEX_VERSION(A, B, C) ((A << 24) | (B << 12) | C)
+
+/* Those macros should only be used when library is compiled together with
+   the client. If library is dynamically linked, use BrotliDecoderVersion and
+   BrotliEncoderVersion methods. */
+
+#define BROTLI_VERSION_MAJOR 1
+#define BROTLI_VERSION_MINOR 1
+#define BROTLI_VERSION_PATCH 0
+
+#define BROTLI_VERSION BROTLI_MAKE_HEX_VERSION(                     \
+  BROTLI_VERSION_MAJOR, BROTLI_VERSION_MINOR, BROTLI_VERSION_PATCH)
+
+/* This macro is used by build system to produce Libtool-friendly soname. See
+   https://www.gnu.org/software/libtool/manual/html_node/Libtool-versioning.html
+   Version evolution rules:
+    - interfaces added (or change is compatible)      -> current+1:0:age+1
+    - interfaces removed (or changed is incompatible) -> current+1:0:0
+    - interfaces not changed                          -> current:revision+1:age
+ */
+
+#define BROTLI_ABI_CURRENT  2
+#define BROTLI_ABI_REVISION 0
+#define BROTLI_ABI_AGE      1
+
+#if BROTLI_VERSION_MAJOR != (BROTLI_ABI_CURRENT - BROTLI_ABI_AGE)
+#error ABI/API version inconsistency
+#endif
+
+#if BROTLI_VERSION_MINOR != BROTLI_ABI_AGE
+#error ABI/API version inconsistency
+#endif
+
+#if BROTLI_VERSION_PATCH != BROTLI_ABI_REVISION
+#error ABI/API version inconsistency
+#endif
+
+#endif  /* BROTLI_COMMON_VERSION_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/bit_reader.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/bit_reader.c
new file mode 100644
index 0000000000..35101ddc1a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/bit_reader.c
@@ -0,0 +1,78 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Bit reading helpers */
+
+#include "bit_reader.h"
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+const brotli_reg_t kBrotliBitMask[33] = {   0x00000000,
+    0x00000001, 0x00000003, 0x00000007, 0x0000000F,
+    0x0000001F, 0x0000003F, 0x0000007F, 0x000000FF,
+    0x000001FF, 0x000003FF, 0x000007FF, 0x00000FFF,
+    0x00001FFF, 0x00003FFF, 0x00007FFF, 0x0000FFFF,
+    0x0001FFFF, 0x0003FFFF, 0x0007FFFF, 0x000FFFFF,
+    0x001FFFFF, 0x003FFFFF, 0x007FFFFF, 0x00FFFFFF,
+    0x01FFFFFF, 0x03FFFFFF, 0x07FFFFFF, 0x0FFFFFFF,
+    0x1FFFFFFF, 0x3FFFFFFF, 0x7FFFFFFF, 0xFFFFFFFF
+};
+
+void BrotliInitBitReader(BrotliBitReader* const br) {
+  br->val_ = 0;
+  br->bit_pos_ = 0;
+}
+
+BROTLI_BOOL BrotliWarmupBitReader(BrotliBitReader* const br) {
+  size_t aligned_read_mask = (sizeof(br->val_) >> 1) - 1;
+  /* Fixing alignment after unaligned BrotliFillWindow would result accumulator
+     overflow. If unalignment is caused by BrotliSafeReadBits, then there is
+     enough space in accumulator to fix alignment. */
+  if (BROTLI_UNALIGNED_READ_FAST) {
+    aligned_read_mask = 0;
+  }
+  if (BrotliGetAvailableBits(br) == 0) {
+    br->val_ = 0;
+    if (!BrotliPullByte(br)) {
+      return BROTLI_FALSE;
+    }
+  }
+
+  while ((((size_t)br->next_in) & aligned_read_mask) != 0) {
+    if (!BrotliPullByte(br)) {
+      /* If we consumed all the input, we don't care about the alignment. */
+      return BROTLI_TRUE;
+    }
+  }
+  return BROTLI_TRUE;
+}
+
+BROTLI_BOOL BrotliSafeReadBits32Slow(BrotliBitReader* const br,
+    brotli_reg_t n_bits, brotli_reg_t* val) {
+  brotli_reg_t low_val;
+  brotli_reg_t high_val;
+  BrotliBitReaderState memento;
+  BROTLI_DCHECK(n_bits <= 32);
+  BROTLI_DCHECK(n_bits > 24);
+  BrotliBitReaderSaveState(br, &memento);
+  if (!BrotliSafeReadBits(br, 16, &low_val) ||
+      !BrotliSafeReadBits(br, n_bits - 16, &high_val)) {
+    BrotliBitReaderRestoreState(br, &memento);
+    return BROTLI_FALSE;
+  }
+  *val = low_val | (high_val << 16);
+  return BROTLI_TRUE;
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/bit_reader.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/bit_reader.h
new file mode 100644
index 0000000000..930dc60f1d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/bit_reader.h
@@ -0,0 +1,423 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Bit reading helpers */
+
+#ifndef BROTLI_DEC_BIT_READER_H_
+#define BROTLI_DEC_BIT_READER_H_
+
+#include <string.h>  /* memcpy */
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define BROTLI_SHORT_FILL_BIT_WINDOW_READ (sizeof(brotli_reg_t) >> 1)
+
+/* 162 bits + 7 bytes */
+#define BROTLI_FAST_INPUT_SLACK 28
+
+BROTLI_INTERNAL extern const brotli_reg_t kBrotliBitMask[33];
+
+static BROTLI_INLINE brotli_reg_t BitMask(brotli_reg_t n) {
+  if (BROTLI_IS_CONSTANT(n) || BROTLI_HAS_UBFX) {
+    /* Masking with this expression turns to a single
+       "Unsigned Bit Field Extract" UBFX instruction on ARM. */
+    return ~(~((brotli_reg_t)0) << n);
+  } else {
+    return kBrotliBitMask[n];
+  }
+}
+
+typedef struct {
+  brotli_reg_t val_;       /* pre-fetched bits */
+  brotli_reg_t bit_pos_;   /* current bit-reading position in val_ */
+  const uint8_t* next_in;  /* the byte we're reading from */
+  const uint8_t* guard_in; /* position from which "fast-path" is prohibited */
+  const uint8_t* last_in;  /* == next_in + avail_in */
+} BrotliBitReader;
+
+typedef struct {
+  brotli_reg_t val_;
+  brotli_reg_t bit_pos_;
+  const uint8_t* next_in;
+  size_t avail_in;
+} BrotliBitReaderState;
+
+/* Initializes the BrotliBitReader fields. */
+BROTLI_INTERNAL void BrotliInitBitReader(BrotliBitReader* br);
+
+/* Ensures that accumulator is not empty.
+   May consume up to sizeof(brotli_reg_t) - 1 bytes of input.
+   Returns BROTLI_FALSE if data is required but there is no input available.
+   For !BROTLI_UNALIGNED_READ_FAST this function also prepares bit reader for
+   aligned reading. */
+BROTLI_INTERNAL BROTLI_BOOL BrotliWarmupBitReader(BrotliBitReader* br);
+
+/* Fallback for BrotliSafeReadBits32. Extracted as noninlined method to unburden
+   the main code-path. Never called for RFC brotli streams, required only for
+   "large-window" mode and other extensions. */
+BROTLI_INTERNAL BROTLI_NOINLINE BROTLI_BOOL BrotliSafeReadBits32Slow(
+    BrotliBitReader* br, brotli_reg_t n_bits, brotli_reg_t* val);
+
+static BROTLI_INLINE size_t
+BrotliBitReaderGetAvailIn(BrotliBitReader* const br) {
+  return (size_t)(br->last_in - br->next_in);
+}
+
+static BROTLI_INLINE void BrotliBitReaderSaveState(
+    BrotliBitReader* const from, BrotliBitReaderState* to) {
+  to->val_ = from->val_;
+  to->bit_pos_ = from->bit_pos_;
+  to->next_in = from->next_in;
+  to->avail_in = BrotliBitReaderGetAvailIn(from);
+}
+
+static BROTLI_INLINE void BrotliBitReaderSetInput(
+    BrotliBitReader* const br, const uint8_t* next_in, size_t avail_in) {
+  br->next_in = next_in;
+  br->last_in = (avail_in == 0) ? next_in : (next_in + avail_in);
+  if (avail_in + 1 > BROTLI_FAST_INPUT_SLACK) {
+    br->guard_in = next_in + (avail_in + 1 - BROTLI_FAST_INPUT_SLACK);
+  } else {
+    br->guard_in = next_in;
+  }
+}
+
+static BROTLI_INLINE void BrotliBitReaderRestoreState(
+    BrotliBitReader* const to, BrotliBitReaderState* from) {
+  to->val_ = from->val_;
+  to->bit_pos_ = from->bit_pos_;
+  to->next_in = from->next_in;
+  BrotliBitReaderSetInput(to, from->next_in, from->avail_in);
+}
+
+static BROTLI_INLINE brotli_reg_t BrotliGetAvailableBits(
+    const BrotliBitReader* br) {
+  return br->bit_pos_;
+}
+
+/* Returns amount of unread bytes the bit reader still has buffered from the
+   BrotliInput, including whole bytes in br->val_. Result is capped with
+   maximal ring-buffer size (larger number won't be utilized anyway). */
+static BROTLI_INLINE size_t BrotliGetRemainingBytes(BrotliBitReader* br) {
+  static const size_t kCap = (size_t)1 << BROTLI_LARGE_MAX_WBITS;
+  size_t avail_in = BrotliBitReaderGetAvailIn(br);
+  if (avail_in > kCap) return kCap;
+  return avail_in + (BrotliGetAvailableBits(br) >> 3);
+}
+
+/* Checks if there is at least |num| bytes left in the input ring-buffer
+   (excluding the bits remaining in br->val_). */
+static BROTLI_INLINE BROTLI_BOOL BrotliCheckInputAmount(
+    BrotliBitReader* const br) {
+  return TO_BROTLI_BOOL(br->next_in < br->guard_in);
+}
+
+/* Load more bits into accumulator. */
+static BROTLI_INLINE brotli_reg_t BrotliBitReaderLoadBits(brotli_reg_t val,
+                                                          brotli_reg_t new_bits,
+                                                          brotli_reg_t count,
+                                                          brotli_reg_t offset) {
+  BROTLI_DCHECK(
+      !((val >> offset) & ~new_bits & ~(~((brotli_reg_t)0) << count)));
+  (void)count;
+  return val | (new_bits << offset);
+}
+
+/* Guarantees that there are at least |n_bits| + 1 bits in accumulator.
+   Precondition: accumulator contains at least 1 bit.
+   |n_bits| should be in the range [1..24] for regular build. For portable
+   non-64-bit little-endian build only 16 bits are safe to request. */
+static BROTLI_INLINE void BrotliFillBitWindow(
+    BrotliBitReader* const br, brotli_reg_t n_bits) {
+#if (BROTLI_64_BITS)
+  if (BROTLI_UNALIGNED_READ_FAST && BROTLI_IS_CONSTANT(n_bits) &&
+      (n_bits <= 8)) {
+    brotli_reg_t bit_pos = br->bit_pos_;
+    if (bit_pos <= 8) {
+      br->val_ = BrotliBitReaderLoadBits(br->val_,
+          BROTLI_UNALIGNED_LOAD64LE(br->next_in), 56, bit_pos);
+      br->bit_pos_ = bit_pos + 56;
+      br->next_in += 7;
+    }
+  } else if (BROTLI_UNALIGNED_READ_FAST && BROTLI_IS_CONSTANT(n_bits) &&
+             (n_bits <= 16)) {
+    brotli_reg_t bit_pos = br->bit_pos_;
+    if (bit_pos <= 16) {
+      br->val_ = BrotliBitReaderLoadBits(br->val_,
+          BROTLI_UNALIGNED_LOAD64LE(br->next_in), 48, bit_pos);
+      br->bit_pos_ = bit_pos + 48;
+      br->next_in += 6;
+    }
+  } else {
+    brotli_reg_t bit_pos = br->bit_pos_;
+    if (bit_pos <= 32) {
+      br->val_ = BrotliBitReaderLoadBits(br->val_,
+          (uint64_t)BROTLI_UNALIGNED_LOAD32LE(br->next_in), 32, bit_pos);
+      br->bit_pos_ = bit_pos + 32;
+      br->next_in += BROTLI_SHORT_FILL_BIT_WINDOW_READ;
+    }
+  }
+#else
+  if (BROTLI_UNALIGNED_READ_FAST && BROTLI_IS_CONSTANT(n_bits) &&
+      (n_bits <= 8)) {
+    brotli_reg_t bit_pos = br->bit_pos_;
+    if (bit_pos <= 8) {
+      br->val_ = BrotliBitReaderLoadBits(br->val_,
+          BROTLI_UNALIGNED_LOAD32LE(br->next_in), 24, bit_pos);
+      br->bit_pos_ = bit_pos + 24;
+      br->next_in += 3;
+    }
+  } else {
+    brotli_reg_t bit_pos = br->bit_pos_;
+    if (bit_pos <= 16) {
+      br->val_ = BrotliBitReaderLoadBits(br->val_,
+          (uint32_t)BROTLI_UNALIGNED_LOAD16LE(br->next_in), 16, bit_pos);
+      br->bit_pos_ = bit_pos + 16;
+      br->next_in += BROTLI_SHORT_FILL_BIT_WINDOW_READ;
+    }
+  }
+#endif
+}
+
+/* Mostly like BrotliFillBitWindow, but guarantees only 16 bits and reads no
+   more than BROTLI_SHORT_FILL_BIT_WINDOW_READ bytes of input. */
+static BROTLI_INLINE void BrotliFillBitWindow16(BrotliBitReader* const br) {
+  BrotliFillBitWindow(br, 17);
+}
+
+/* Tries to pull one byte of input to accumulator.
+   Returns BROTLI_FALSE if there is no input available. */
+static BROTLI_INLINE BROTLI_BOOL BrotliPullByte(BrotliBitReader* const br) {
+  if (br->next_in == br->last_in) {
+    return BROTLI_FALSE;
+  }
+  br->val_ = BrotliBitReaderLoadBits(br->val_,
+      (brotli_reg_t)*br->next_in, 8, br->bit_pos_);
+  br->bit_pos_ += 8;
+  ++br->next_in;
+  return BROTLI_TRUE;
+}
+
+/* Returns currently available bits.
+   The number of valid bits could be calculated by BrotliGetAvailableBits. */
+static BROTLI_INLINE brotli_reg_t BrotliGetBitsUnmasked(
+    BrotliBitReader* const br) {
+  return br->val_;
+}
+
+/* Like BrotliGetBits, but does not mask the result.
+   The result contains at least 16 valid bits. */
+static BROTLI_INLINE brotli_reg_t BrotliGet16BitsUnmasked(
+    BrotliBitReader* const br) {
+  BrotliFillBitWindow(br, 16);
+  return (brotli_reg_t)BrotliGetBitsUnmasked(br);
+}
+
+/* Returns the specified number of bits from |br| without advancing bit
+   position. */
+static BROTLI_INLINE brotli_reg_t BrotliGetBits(
+    BrotliBitReader* const br, brotli_reg_t n_bits) {
+  BrotliFillBitWindow(br, n_bits);
+  return BrotliGetBitsUnmasked(br) & BitMask(n_bits);
+}
+
+/* Tries to peek the specified amount of bits. Returns BROTLI_FALSE, if there
+   is not enough input. */
+static BROTLI_INLINE BROTLI_BOOL BrotliSafeGetBits(
+    BrotliBitReader* const br, brotli_reg_t n_bits, brotli_reg_t* val) {
+  while (BrotliGetAvailableBits(br) < n_bits) {
+    if (!BrotliPullByte(br)) {
+      return BROTLI_FALSE;
+    }
+  }
+  *val = BrotliGetBitsUnmasked(br) & BitMask(n_bits);
+  return BROTLI_TRUE;
+}
+
+/* Advances the bit pos by |n_bits|. */
+static BROTLI_INLINE void BrotliDropBits(
+    BrotliBitReader* const br, brotli_reg_t n_bits) {
+  br->bit_pos_ -= n_bits;
+  br->val_ >>= n_bits;
+}
+
+/* Make sure that there are no spectre bits in accumulator.
+   This is important for the cases when some bytes are skipped
+   (i.e. never placed into accumulator). */
+static BROTLI_INLINE void BrotliBitReaderNormalize(BrotliBitReader* br) {
+  /* Actually, it is enough to normalize when br->bit_pos_ == 0 */
+  if (br->bit_pos_ < (sizeof(brotli_reg_t) << 3u)) {
+    br->val_ &= (((brotli_reg_t)1) << br->bit_pos_) - 1;
+  }
+}
+
+static BROTLI_INLINE void BrotliBitReaderUnload(BrotliBitReader* br) {
+  brotli_reg_t unused_bytes = BrotliGetAvailableBits(br) >> 3;
+  brotli_reg_t unused_bits = unused_bytes << 3;
+  br->next_in =
+      (unused_bytes == 0) ? br->next_in : (br->next_in - unused_bytes);
+  br->bit_pos_ -= unused_bits;
+  BrotliBitReaderNormalize(br);
+}
+
+/* Reads the specified number of bits from |br| and advances the bit pos.
+   Precondition: accumulator MUST contain at least |n_bits|. */
+static BROTLI_INLINE void BrotliTakeBits(BrotliBitReader* const br,
+                                         brotli_reg_t n_bits,
+                                         brotli_reg_t* val) {
+  *val = BrotliGetBitsUnmasked(br) & BitMask(n_bits);
+  BROTLI_LOG(("[BrotliTakeBits]  %d %d %d val: %6x\n",
+              (int)BrotliBitReaderGetAvailIn(br), (int)br->bit_pos_,
+              (int)n_bits, (int)*val));
+  BrotliDropBits(br, n_bits);
+}
+
+/* Reads the specified number of bits from |br| and advances the bit pos.
+   Assumes that there is enough input to perform BrotliFillBitWindow.
+   Up to 24 bits are allowed to be requested from this method. */
+static BROTLI_INLINE brotli_reg_t BrotliReadBits24(
+    BrotliBitReader* const br, brotli_reg_t n_bits) {
+  BROTLI_DCHECK(n_bits <= 24);
+  if (BROTLI_64_BITS || (n_bits <= 16)) {
+    brotli_reg_t val;
+    BrotliFillBitWindow(br, n_bits);
+    BrotliTakeBits(br, n_bits, &val);
+    return val;
+  } else {
+    brotli_reg_t low_val;
+    brotli_reg_t high_val;
+    BrotliFillBitWindow(br, 16);
+    BrotliTakeBits(br, 16, &low_val);
+    BrotliFillBitWindow(br, 8);
+    BrotliTakeBits(br, n_bits - 16, &high_val);
+    return low_val | (high_val << 16);
+  }
+}
+
+/* Same as BrotliReadBits24, but allows reading up to 32 bits. */
+static BROTLI_INLINE brotli_reg_t BrotliReadBits32(
+    BrotliBitReader* const br, brotli_reg_t n_bits) {
+  BROTLI_DCHECK(n_bits <= 32);
+  if (BROTLI_64_BITS || (n_bits <= 16)) {
+    brotli_reg_t val;
+    BrotliFillBitWindow(br, n_bits);
+    BrotliTakeBits(br, n_bits, &val);
+    return val;
+  } else {
+    brotli_reg_t low_val;
+    brotli_reg_t high_val;
+    BrotliFillBitWindow(br, 16);
+    BrotliTakeBits(br, 16, &low_val);
+    BrotliFillBitWindow(br, 16);
+    BrotliTakeBits(br, n_bits - 16, &high_val);
+    return low_val | (high_val << 16);
+  }
+}
+
+/* Tries to read the specified amount of bits. Returns BROTLI_FALSE, if there
+   is not enough input. |n_bits| MUST be positive.
+   Up to 24 bits are allowed to be requested from this method. */
+static BROTLI_INLINE BROTLI_BOOL BrotliSafeReadBits(
+    BrotliBitReader* const br, brotli_reg_t n_bits, brotli_reg_t* val) {
+  BROTLI_DCHECK(n_bits <= 24);
+  while (BrotliGetAvailableBits(br) < n_bits) {
+    if (!BrotliPullByte(br)) {
+      return BROTLI_FALSE;
+    }
+  }
+  BrotliTakeBits(br, n_bits, val);
+  return BROTLI_TRUE;
+}
+
+/* Same as BrotliSafeReadBits, but allows reading up to 32 bits. */
+static BROTLI_INLINE BROTLI_BOOL BrotliSafeReadBits32(
+    BrotliBitReader* const br, brotli_reg_t n_bits, brotli_reg_t* val) {
+  BROTLI_DCHECK(n_bits <= 32);
+  if (BROTLI_64_BITS || (n_bits <= 24)) {
+    while (BrotliGetAvailableBits(br) < n_bits) {
+      if (!BrotliPullByte(br)) {
+        return BROTLI_FALSE;
+      }
+    }
+    BrotliTakeBits(br, n_bits, val);
+    return BROTLI_TRUE;
+  } else {
+    return BrotliSafeReadBits32Slow(br, n_bits, val);
+  }
+}
+
+/* Advances the bit reader position to the next byte boundary and verifies
+   that any skipped bits are set to zero. */
+static BROTLI_INLINE BROTLI_BOOL BrotliJumpToByteBoundary(BrotliBitReader* br) {
+  brotli_reg_t pad_bits_count = BrotliGetAvailableBits(br) & 0x7;
+  brotli_reg_t pad_bits = 0;
+  if (pad_bits_count != 0) {
+    BrotliTakeBits(br, pad_bits_count, &pad_bits);
+  }
+  BrotliBitReaderNormalize(br);
+  return TO_BROTLI_BOOL(pad_bits == 0);
+}
+
+static BROTLI_INLINE void BrotliDropBytes(BrotliBitReader* br, size_t num) {
+  /* Check detour is legal: accumulator must to be empty. */
+  BROTLI_DCHECK(br->bit_pos_ == 0);
+  BROTLI_DCHECK(br->val_ == 0);
+  br->next_in += num;
+}
+
+/* Copies remaining input bytes stored in the bit reader to the output. Value
+   |num| may not be larger than BrotliGetRemainingBytes. The bit reader must be
+   warmed up again after this. */
+static BROTLI_INLINE void BrotliCopyBytes(uint8_t* dest,
+                                          BrotliBitReader* br, size_t num) {
+  while (BrotliGetAvailableBits(br) >= 8 && num > 0) {
+    *dest = (uint8_t)BrotliGetBitsUnmasked(br);
+    BrotliDropBits(br, 8);
+    ++dest;
+    --num;
+  }
+  BrotliBitReaderNormalize(br);
+  if (num > 0) {
+    memcpy(dest, br->next_in, num);
+    BrotliDropBytes(br, num);
+  }
+}
+
+BROTLI_UNUSED_FUNCTION void BrotliBitReaderSuppressUnusedFunctions(void) {
+  BROTLI_UNUSED(&BrotliBitReaderSuppressUnusedFunctions);
+
+  BROTLI_UNUSED(&BrotliBitReaderGetAvailIn);
+  BROTLI_UNUSED(&BrotliBitReaderLoadBits);
+  BROTLI_UNUSED(&BrotliBitReaderRestoreState);
+  BROTLI_UNUSED(&BrotliBitReaderSaveState);
+  BROTLI_UNUSED(&BrotliBitReaderSetInput);
+  BROTLI_UNUSED(&BrotliBitReaderUnload);
+  BROTLI_UNUSED(&BrotliCheckInputAmount);
+  BROTLI_UNUSED(&BrotliCopyBytes);
+  BROTLI_UNUSED(&BrotliFillBitWindow16);
+  BROTLI_UNUSED(&BrotliGet16BitsUnmasked);
+  BROTLI_UNUSED(&BrotliGetBits);
+  BROTLI_UNUSED(&BrotliGetRemainingBytes);
+  BROTLI_UNUSED(&BrotliJumpToByteBoundary);
+  BROTLI_UNUSED(&BrotliReadBits24);
+  BROTLI_UNUSED(&BrotliReadBits32);
+  BROTLI_UNUSED(&BrotliSafeGetBits);
+  BROTLI_UNUSED(&BrotliSafeReadBits);
+  BROTLI_UNUSED(&BrotliSafeReadBits32);
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_DEC_BIT_READER_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/decode.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/decode.c
new file mode 100644
index 0000000000..220c7e85c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/decode.c
@@ -0,0 +1,2875 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include <brotli/decode.h>
+
+#include <stdlib.h>  /* free, malloc */
+#include <string.h>  /* memcpy, memset */
+
+#include "../common/constants.h"
+#include "../common/context.h"
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "../common/shared_dictionary_internal.h"
+#include "../common/transform.h"
+#include "../common/version.h"
+#include "bit_reader.h"
+#include "huffman.h"
+#include "prefix.h"
+#include "state.h"
+
+#if defined(BROTLI_TARGET_NEON)
+#include <arm_neon.h>
+#endif
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define BROTLI_FAILURE(CODE) (BROTLI_DUMP(), CODE)
+
+#define BROTLI_LOG_UINT(name)                                       \
+  BROTLI_LOG(("[%s] %s = %lu\n", __func__, #name, (unsigned long)(name)))
+#define BROTLI_LOG_ARRAY_INDEX(array_name, idx)                     \
+  BROTLI_LOG(("[%s] %s[%lu] = %lu\n", __func__, #array_name,        \
+         (unsigned long)(idx), (unsigned long)array_name[idx]))
+
+#define HUFFMAN_TABLE_BITS 8U
+#define HUFFMAN_TABLE_MASK 0xFF
+
+/* We need the slack region for the following reasons:
+    - doing up to two 16-byte copies for fast backward copying
+    - inserting transformed dictionary word:
+        255 prefix + 32 base + 255 suffix */
+static const brotli_reg_t kRingBufferWriteAheadSlack = 542;
+
+static const uint8_t kCodeLengthCodeOrder[BROTLI_CODE_LENGTH_CODES] = {
+  1, 2, 3, 4, 0, 5, 17, 6, 16, 7, 8, 9, 10, 11, 12, 13, 14, 15,
+};
+
+/* Static prefix code for the complex code length code lengths. */
+static const uint8_t kCodeLengthPrefixLength[16] = {
+  2, 2, 2, 3, 2, 2, 2, 4, 2, 2, 2, 3, 2, 2, 2, 4,
+};
+
+static const uint8_t kCodeLengthPrefixValue[16] = {
+  0, 4, 3, 2, 0, 4, 3, 1, 0, 4, 3, 2, 0, 4, 3, 5,
+};
+
+BROTLI_BOOL BrotliDecoderSetParameter(
+    BrotliDecoderState* state, BrotliDecoderParameter p, uint32_t value) {
+  if (state->state != BROTLI_STATE_UNINITED) return BROTLI_FALSE;
+  switch (p) {
+    case BROTLI_DECODER_PARAM_DISABLE_RING_BUFFER_REALLOCATION:
+      state->canny_ringbuffer_allocation = !!value ? 0 : 1;
+      return BROTLI_TRUE;
+
+    case BROTLI_DECODER_PARAM_LARGE_WINDOW:
+      state->large_window = TO_BROTLI_BOOL(!!value);
+      return BROTLI_TRUE;
+
+    default: return BROTLI_FALSE;
+  }
+}
+
+BrotliDecoderState* BrotliDecoderCreateInstance(
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {
+  BrotliDecoderState* state = 0;
+  if (!alloc_func && !free_func) {
+    state = (BrotliDecoderState*)malloc(sizeof(BrotliDecoderState));
+  } else if (alloc_func && free_func) {
+    state = (BrotliDecoderState*)alloc_func(opaque, sizeof(BrotliDecoderState));
+  }
+  if (state == 0) {
+    BROTLI_DUMP();
+    return 0;
+  }
+  if (!BrotliDecoderStateInit(state, alloc_func, free_func, opaque)) {
+    BROTLI_DUMP();
+    if (!alloc_func && !free_func) {
+      free(state);
+    } else if (alloc_func && free_func) {
+      free_func(opaque, state);
+    }
+    return 0;
+  }
+  return state;
+}
+
+/* Deinitializes and frees BrotliDecoderState instance. */
+void BrotliDecoderDestroyInstance(BrotliDecoderState* state) {
+  if (!state) {
+    return;
+  } else {
+    brotli_free_func free_func = state->free_func;
+    void* opaque = state->memory_manager_opaque;
+    BrotliDecoderStateCleanup(state);
+    free_func(opaque, state);
+  }
+}
+
+/* Saves error code and converts it to BrotliDecoderResult. */
+static BROTLI_NOINLINE BrotliDecoderResult SaveErrorCode(
+    BrotliDecoderState* s, BrotliDecoderErrorCode e, size_t consumed_input) {
+  s->error_code = (int)e;
+  s->used_input += consumed_input;
+  if ((s->buffer_length != 0) && (s->br.next_in == s->br.last_in)) {
+    /* If internal buffer is depleted at last, reset it. */
+    s->buffer_length = 0;
+  }
+  switch (e) {
+    case BROTLI_DECODER_SUCCESS:
+      return BROTLI_DECODER_RESULT_SUCCESS;
+
+    case BROTLI_DECODER_NEEDS_MORE_INPUT:
+      return BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT;
+
+    case BROTLI_DECODER_NEEDS_MORE_OUTPUT:
+      return BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT;
+
+    default:
+      return BROTLI_DECODER_RESULT_ERROR;
+  }
+}
+
+/* Decodes WBITS by reading 1 - 7 bits, or 0x11 for "Large Window Brotli".
+   Precondition: bit-reader accumulator has at least 8 bits. */
+static BrotliDecoderErrorCode DecodeWindowBits(BrotliDecoderState* s,
+                                               BrotliBitReader* br) {
+  brotli_reg_t n;
+  BROTLI_BOOL large_window = s->large_window;
+  s->large_window = BROTLI_FALSE;
+  BrotliTakeBits(br, 1, &n);
+  if (n == 0) {
+    s->window_bits = 16;
+    return BROTLI_DECODER_SUCCESS;
+  }
+  BrotliTakeBits(br, 3, &n);
+  if (n != 0) {
+    s->window_bits = (17u + n) & 63u;
+    return BROTLI_DECODER_SUCCESS;
+  }
+  BrotliTakeBits(br, 3, &n);
+  if (n == 1) {
+    if (large_window) {
+      BrotliTakeBits(br, 1, &n);
+      if (n == 1) {
+        return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_WINDOW_BITS);
+      }
+      s->large_window = BROTLI_TRUE;
+      return BROTLI_DECODER_SUCCESS;
+    } else {
+      return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_WINDOW_BITS);
+    }
+  }
+  if (n != 0) {
+    s->window_bits = (8u + n) & 63u;
+    return BROTLI_DECODER_SUCCESS;
+  }
+  s->window_bits = 17;
+  return BROTLI_DECODER_SUCCESS;
+}
+
+static BROTLI_INLINE void memmove16(uint8_t* dst, uint8_t* src) {
+#if defined(BROTLI_TARGET_NEON)
+  vst1q_u8(dst, vld1q_u8(src));
+#else
+  uint32_t buffer[4];
+  memcpy(buffer, src, 16);
+  memcpy(dst, buffer, 16);
+#endif
+}
+
+/* Decodes a number in the range [0..255], by reading 1 - 11 bits. */
+static BROTLI_NOINLINE BrotliDecoderErrorCode DecodeVarLenUint8(
+    BrotliDecoderState* s, BrotliBitReader* br, brotli_reg_t* value) {
+  brotli_reg_t bits;
+  switch (s->substate_decode_uint8) {
+    case BROTLI_STATE_DECODE_UINT8_NONE:
+      if (BROTLI_PREDICT_FALSE(!BrotliSafeReadBits(br, 1, &bits))) {
+        return BROTLI_DECODER_NEEDS_MORE_INPUT;
+      }
+      if (bits == 0) {
+        *value = 0;
+        return BROTLI_DECODER_SUCCESS;
+      }
+    /* Fall through. */
+
+    case BROTLI_STATE_DECODE_UINT8_SHORT:
+      if (BROTLI_PREDICT_FALSE(!BrotliSafeReadBits(br, 3, &bits))) {
+        s->substate_decode_uint8 = BROTLI_STATE_DECODE_UINT8_SHORT;
+        return BROTLI_DECODER_NEEDS_MORE_INPUT;
+      }
+      if (bits == 0) {
+        *value = 1;
+        s->substate_decode_uint8 = BROTLI_STATE_DECODE_UINT8_NONE;
+        return BROTLI_DECODER_SUCCESS;
+      }
+      /* Use output value as a temporary storage. It MUST be persisted. */
+      *value = bits;
+    /* Fall through. */
+
+    case BROTLI_STATE_DECODE_UINT8_LONG:
+      if (BROTLI_PREDICT_FALSE(!BrotliSafeReadBits(br, *value, &bits))) {
+        s->substate_decode_uint8 = BROTLI_STATE_DECODE_UINT8_LONG;
+        return BROTLI_DECODER_NEEDS_MORE_INPUT;
+      }
+      *value = (1U << *value) + bits;
+      s->substate_decode_uint8 = BROTLI_STATE_DECODE_UINT8_NONE;
+      return BROTLI_DECODER_SUCCESS;
+
+    default:
+      return
+          BROTLI_FAILURE(BROTLI_DECODER_ERROR_UNREACHABLE);  /* COV_NF_LINE */
+  }
+}
+
+/* Decodes a metablock length and flags by reading 2 - 31 bits. */
+static BrotliDecoderErrorCode BROTLI_NOINLINE DecodeMetaBlockLength(
+    BrotliDecoderState* s, BrotliBitReader* br) {
+  brotli_reg_t bits;
+  int i;
+  for (;;) {
+    switch (s->substate_metablock_header) {
+      case BROTLI_STATE_METABLOCK_HEADER_NONE:
+        if (!BrotliSafeReadBits(br, 1, &bits)) {
+          return BROTLI_DECODER_NEEDS_MORE_INPUT;
+        }
+        s->is_last_metablock = bits ? 1 : 0;
+        s->meta_block_remaining_len = 0;
+        s->is_uncompressed = 0;
+        s->is_metadata = 0;
+        if (!s->is_last_metablock) {
+          s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_NIBBLES;
+          break;
+        }
+        s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_EMPTY;
+      /* Fall through. */
+
+      case BROTLI_STATE_METABLOCK_HEADER_EMPTY:
+        if (!BrotliSafeReadBits(br, 1, &bits)) {
+          return BROTLI_DECODER_NEEDS_MORE_INPUT;
+        }
+        if (bits) {
+          s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_NONE;
+          return BROTLI_DECODER_SUCCESS;
+        }
+        s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_NIBBLES;
+      /* Fall through. */
+
+      case BROTLI_STATE_METABLOCK_HEADER_NIBBLES:
+        if (!BrotliSafeReadBits(br, 2, &bits)) {
+          return BROTLI_DECODER_NEEDS_MORE_INPUT;
+        }
+        s->size_nibbles = (uint8_t)(bits + 4);
+        s->loop_counter = 0;
+        if (bits == 3) {
+          s->is_metadata = 1;
+          s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_RESERVED;
+          break;
+        }
+        s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_SIZE;
+      /* Fall through. */
+
+      case BROTLI_STATE_METABLOCK_HEADER_SIZE:
+        i = s->loop_counter;
+        for (; i < (int)s->size_nibbles; ++i) {
+          if (!BrotliSafeReadBits(br, 4, &bits)) {
+            s->loop_counter = i;
+            return BROTLI_DECODER_NEEDS_MORE_INPUT;
+          }
+          if (i + 1 == (int)s->size_nibbles && s->size_nibbles > 4 &&
+              bits == 0) {
+            return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_EXUBERANT_NIBBLE);
+          }
+          s->meta_block_remaining_len |= (int)(bits << (i * 4));
+        }
+        s->substate_metablock_header =
+            BROTLI_STATE_METABLOCK_HEADER_UNCOMPRESSED;
+      /* Fall through. */
+
+      case BROTLI_STATE_METABLOCK_HEADER_UNCOMPRESSED:
+        if (!s->is_last_metablock) {
+          if (!BrotliSafeReadBits(br, 1, &bits)) {
+            return BROTLI_DECODER_NEEDS_MORE_INPUT;
+          }
+          s->is_uncompressed = bits ? 1 : 0;
+        }
+        ++s->meta_block_remaining_len;
+        s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_NONE;
+        return BROTLI_DECODER_SUCCESS;
+
+      case BROTLI_STATE_METABLOCK_HEADER_RESERVED:
+        if (!BrotliSafeReadBits(br, 1, &bits)) {
+          return BROTLI_DECODER_NEEDS_MORE_INPUT;
+        }
+        if (bits != 0) {
+          return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_RESERVED);
+        }
+        s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_BYTES;
+      /* Fall through. */
+
+      case BROTLI_STATE_METABLOCK_HEADER_BYTES:
+        if (!BrotliSafeReadBits(br, 2, &bits)) {
+          return BROTLI_DECODER_NEEDS_MORE_INPUT;
+        }
+        if (bits == 0) {
+          s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_NONE;
+          return BROTLI_DECODER_SUCCESS;
+        }
+        s->size_nibbles = (uint8_t)bits;
+        s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_METADATA;
+      /* Fall through. */
+
+      case BROTLI_STATE_METABLOCK_HEADER_METADATA:
+        i = s->loop_counter;
+        for (; i < (int)s->size_nibbles; ++i) {
+          if (!BrotliSafeReadBits(br, 8, &bits)) {
+            s->loop_counter = i;
+            return BROTLI_DECODER_NEEDS_MORE_INPUT;
+          }
+          if (i + 1 == (int)s->size_nibbles && s->size_nibbles > 1 &&
+              bits == 0) {
+            return BROTLI_FAILURE(
+                BROTLI_DECODER_ERROR_FORMAT_EXUBERANT_META_NIBBLE);
+          }
+          s->meta_block_remaining_len |= (int)(bits << (i * 8));
+        }
+        ++s->meta_block_remaining_len;
+        s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_NONE;
+        return BROTLI_DECODER_SUCCESS;
+
+      default:
+        return
+            BROTLI_FAILURE(BROTLI_DECODER_ERROR_UNREACHABLE);  /* COV_NF_LINE */
+    }
+  }
+}
+
+/* Decodes the Huffman code.
+   This method doesn't read data from the bit reader, BUT drops the amount of
+   bits that correspond to the decoded symbol.
+   bits MUST contain at least 15 (BROTLI_HUFFMAN_MAX_CODE_LENGTH) valid bits. */
+static BROTLI_INLINE brotli_reg_t DecodeSymbol(brotli_reg_t bits,
+                                               const HuffmanCode* table,
+                                               BrotliBitReader* br) {
+  BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(table);
+  BROTLI_HC_ADJUST_TABLE_INDEX(table, bits & HUFFMAN_TABLE_MASK);
+  if (BROTLI_HC_FAST_LOAD_BITS(table) > HUFFMAN_TABLE_BITS) {
+    brotli_reg_t nbits = BROTLI_HC_FAST_LOAD_BITS(table) - HUFFMAN_TABLE_BITS;
+    BrotliDropBits(br, HUFFMAN_TABLE_BITS);
+    BROTLI_HC_ADJUST_TABLE_INDEX(table,
+        BROTLI_HC_FAST_LOAD_VALUE(table) +
+        ((bits >> HUFFMAN_TABLE_BITS) & BitMask(nbits)));
+  }
+  BrotliDropBits(br, BROTLI_HC_FAST_LOAD_BITS(table));
+  return BROTLI_HC_FAST_LOAD_VALUE(table);
+}
+
+/* Reads and decodes the next Huffman code from bit-stream.
+   This method peeks 16 bits of input and drops 0 - 15 of them. */
+static BROTLI_INLINE brotli_reg_t ReadSymbol(const HuffmanCode* table,
+                                             BrotliBitReader* br) {
+  return DecodeSymbol(BrotliGet16BitsUnmasked(br), table, br);
+}
+
+/* Same as DecodeSymbol, but it is known that there is less than 15 bits of
+   input are currently available. */
+static BROTLI_NOINLINE BROTLI_BOOL SafeDecodeSymbol(
+    const HuffmanCode* table, BrotliBitReader* br, brotli_reg_t* result) {
+  brotli_reg_t val;
+  brotli_reg_t available_bits = BrotliGetAvailableBits(br);
+  BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(table);
+  if (available_bits == 0) {
+    if (BROTLI_HC_FAST_LOAD_BITS(table) == 0) {
+      *result = BROTLI_HC_FAST_LOAD_VALUE(table);
+      return BROTLI_TRUE;
+    }
+    return BROTLI_FALSE;  /* No valid bits at all. */
+  }
+  val = BrotliGetBitsUnmasked(br);
+  BROTLI_HC_ADJUST_TABLE_INDEX(table, val & HUFFMAN_TABLE_MASK);
+  if (BROTLI_HC_FAST_LOAD_BITS(table) <= HUFFMAN_TABLE_BITS) {
+    if (BROTLI_HC_FAST_LOAD_BITS(table) <= available_bits) {
+      BrotliDropBits(br, BROTLI_HC_FAST_LOAD_BITS(table));
+      *result = BROTLI_HC_FAST_LOAD_VALUE(table);
+      return BROTLI_TRUE;
+    } else {
+      return BROTLI_FALSE;  /* Not enough bits for the first level. */
+    }
+  }
+  if (available_bits <= HUFFMAN_TABLE_BITS) {
+    return BROTLI_FALSE;  /* Not enough bits to move to the second level. */
+  }
+
+  /* Speculatively drop HUFFMAN_TABLE_BITS. */
+  val = (val & BitMask(BROTLI_HC_FAST_LOAD_BITS(table))) >> HUFFMAN_TABLE_BITS;
+  available_bits -= HUFFMAN_TABLE_BITS;
+  BROTLI_HC_ADJUST_TABLE_INDEX(table, BROTLI_HC_FAST_LOAD_VALUE(table) + val);
+  if (available_bits < BROTLI_HC_FAST_LOAD_BITS(table)) {
+    return BROTLI_FALSE;  /* Not enough bits for the second level. */
+  }
+
+  BrotliDropBits(br, HUFFMAN_TABLE_BITS + BROTLI_HC_FAST_LOAD_BITS(table));
+  *result = BROTLI_HC_FAST_LOAD_VALUE(table);
+  return BROTLI_TRUE;
+}
+
+static BROTLI_INLINE BROTLI_BOOL SafeReadSymbol(
+    const HuffmanCode* table, BrotliBitReader* br, brotli_reg_t* result) {
+  brotli_reg_t val;
+  if (BROTLI_PREDICT_TRUE(BrotliSafeGetBits(br, 15, &val))) {
+    *result = DecodeSymbol(val, table, br);
+    return BROTLI_TRUE;
+  }
+  return SafeDecodeSymbol(table, br, result);
+}
+
+/* Makes a look-up in first level Huffman table. Peeks 8 bits. */
+static BROTLI_INLINE void PreloadSymbol(int safe,
+                                        const HuffmanCode* table,
+                                        BrotliBitReader* br,
+                                        brotli_reg_t* bits,
+                                        brotli_reg_t* value) {
+  if (safe) {
+    return;
+  }
+  BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(table);
+  BROTLI_HC_ADJUST_TABLE_INDEX(table, BrotliGetBits(br, HUFFMAN_TABLE_BITS));
+  *bits = BROTLI_HC_FAST_LOAD_BITS(table);
+  *value = BROTLI_HC_FAST_LOAD_VALUE(table);
+}
+
+/* Decodes the next Huffman code using data prepared by PreloadSymbol.
+   Reads 0 - 15 bits. Also peeks 8 following bits. */
+static BROTLI_INLINE brotli_reg_t ReadPreloadedSymbol(const HuffmanCode* table,
+                                                  BrotliBitReader* br,
+                                                  brotli_reg_t* bits,
+                                                  brotli_reg_t* value) {
+  brotli_reg_t result = *value;
+  if (BROTLI_PREDICT_FALSE(*bits > HUFFMAN_TABLE_BITS)) {
+    brotli_reg_t val = BrotliGet16BitsUnmasked(br);
+    const HuffmanCode* ext = table + (val & HUFFMAN_TABLE_MASK) + *value;
+    brotli_reg_t mask = BitMask((*bits - HUFFMAN_TABLE_BITS));
+    BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(ext);
+    BrotliDropBits(br, HUFFMAN_TABLE_BITS);
+    BROTLI_HC_ADJUST_TABLE_INDEX(ext, (val >> HUFFMAN_TABLE_BITS) & mask);
+    BrotliDropBits(br, BROTLI_HC_FAST_LOAD_BITS(ext));
+    result = BROTLI_HC_FAST_LOAD_VALUE(ext);
+  } else {
+    BrotliDropBits(br, *bits);
+  }
+  PreloadSymbol(0, table, br, bits, value);
+  return result;
+}
+
+static BROTLI_INLINE brotli_reg_t Log2Floor(brotli_reg_t x) {
+  brotli_reg_t result = 0;
+  while (x) {
+    x >>= 1;
+    ++result;
+  }
+  return result;
+}
+
+/* Reads (s->symbol + 1) symbols.
+   Totally 1..4 symbols are read, 1..11 bits each.
+   The list of symbols MUST NOT contain duplicates. */
+static BrotliDecoderErrorCode ReadSimpleHuffmanSymbols(
+    brotli_reg_t alphabet_size_max, brotli_reg_t alphabet_size_limit,
+    BrotliDecoderState* s) {
+  /* max_bits == 1..11; symbol == 0..3; 1..44 bits will be read. */
+  BrotliBitReader* br = &s->br;
+  BrotliMetablockHeaderArena* h = &s->arena.header;
+  brotli_reg_t max_bits = Log2Floor(alphabet_size_max - 1);
+  brotli_reg_t i = h->sub_loop_counter;
+  brotli_reg_t num_symbols = h->symbol;
+  while (i <= num_symbols) {
+    brotli_reg_t v;
+    if (BROTLI_PREDICT_FALSE(!BrotliSafeReadBits(br, max_bits, &v))) {
+      h->sub_loop_counter = i;
+      h->substate_huffman = BROTLI_STATE_HUFFMAN_SIMPLE_READ;
+      return BROTLI_DECODER_NEEDS_MORE_INPUT;
+    }
+    if (v >= alphabet_size_limit) {
+      return
+          BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_SIMPLE_HUFFMAN_ALPHABET);
+    }
+    h->symbols_lists_array[i] = (uint16_t)v;
+    BROTLI_LOG_UINT(h->symbols_lists_array[i]);
+    ++i;
+  }
+
+  for (i = 0; i < num_symbols; ++i) {
+    brotli_reg_t k = i + 1;
+    for (; k <= num_symbols; ++k) {
+      if (h->symbols_lists_array[i] == h->symbols_lists_array[k]) {
+        return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_SIMPLE_HUFFMAN_SAME);
+      }
+    }
+  }
+
+  return BROTLI_DECODER_SUCCESS;
+}
+
+/* Process single decoded symbol code length:
+    A) reset the repeat variable
+    B) remember code length (if it is not 0)
+    C) extend corresponding index-chain
+    D) reduce the Huffman space
+    E) update the histogram */
+static BROTLI_INLINE void ProcessSingleCodeLength(brotli_reg_t code_len,
+    brotli_reg_t* symbol, brotli_reg_t* repeat, brotli_reg_t* space,
+    brotli_reg_t* prev_code_len, uint16_t* symbol_lists,
+    uint16_t* code_length_histo, int* next_symbol) {
+  *repeat = 0;
+  if (code_len != 0) {  /* code_len == 1..15 */
+    symbol_lists[next_symbol[code_len]] = (uint16_t)(*symbol);
+    next_symbol[code_len] = (int)(*symbol);
+    *prev_code_len = code_len;
+    *space -= 32768U >> code_len;
+    code_length_histo[code_len]++;
+    BROTLI_LOG(("[ReadHuffmanCode] code_length[%d] = %d\n",
+        (int)*symbol, (int)code_len));
+  }
+  (*symbol)++;
+}
+
+/* Process repeated symbol code length.
+    A) Check if it is the extension of previous repeat sequence; if the decoded
+       value is not BROTLI_REPEAT_PREVIOUS_CODE_LENGTH, then it is a new
+       symbol-skip
+    B) Update repeat variable
+    C) Check if operation is feasible (fits alphabet)
+    D) For each symbol do the same operations as in ProcessSingleCodeLength
+
+   PRECONDITION: code_len == BROTLI_REPEAT_PREVIOUS_CODE_LENGTH or
+                 code_len == BROTLI_REPEAT_ZERO_CODE_LENGTH */
+static BROTLI_INLINE void ProcessRepeatedCodeLength(brotli_reg_t code_len,
+    brotli_reg_t repeat_delta, brotli_reg_t alphabet_size, brotli_reg_t* symbol,
+    brotli_reg_t* repeat, brotli_reg_t* space, brotli_reg_t* prev_code_len,
+    brotli_reg_t* repeat_code_len, uint16_t* symbol_lists,
+    uint16_t* code_length_histo, int* next_symbol) {
+  brotli_reg_t old_repeat;
+  brotli_reg_t extra_bits = 3;  /* for BROTLI_REPEAT_ZERO_CODE_LENGTH */
+  brotli_reg_t new_len = 0;  /* for BROTLI_REPEAT_ZERO_CODE_LENGTH */
+  if (code_len == BROTLI_REPEAT_PREVIOUS_CODE_LENGTH) {
+    new_len = *prev_code_len;
+    extra_bits = 2;
+  }
+  if (*repeat_code_len != new_len) {
+    *repeat = 0;
+    *repeat_code_len = new_len;
+  }
+  old_repeat = *repeat;
+  if (*repeat > 0) {
+    *repeat -= 2;
+    *repeat <<= extra_bits;
+  }
+  *repeat += repeat_delta + 3U;
+  repeat_delta = *repeat - old_repeat;
+  if (*symbol + repeat_delta > alphabet_size) {
+    BROTLI_DUMP();
+    *symbol = alphabet_size;
+    *space = 0xFFFFF;
+    return;
+  }
+  BROTLI_LOG(("[ReadHuffmanCode] code_length[%d..%d] = %d\n",
+      (int)*symbol, (int)(*symbol + repeat_delta - 1), (int)*repeat_code_len));
+  if (*repeat_code_len != 0) {
+    brotli_reg_t last = *symbol + repeat_delta;
+    int next = next_symbol[*repeat_code_len];
+    do {
+      symbol_lists[next] = (uint16_t)*symbol;
+      next = (int)*symbol;
+    } while (++(*symbol) != last);
+    next_symbol[*repeat_code_len] = next;
+    *space -= repeat_delta << (15 - *repeat_code_len);
+    code_length_histo[*repeat_code_len] =
+        (uint16_t)(code_length_histo[*repeat_code_len] + repeat_delta);
+  } else {
+    *symbol += repeat_delta;
+  }
+}
+
+/* Reads and decodes symbol codelengths. */
+static BrotliDecoderErrorCode ReadSymbolCodeLengths(
+    brotli_reg_t alphabet_size, BrotliDecoderState* s) {
+  BrotliBitReader* br = &s->br;
+  BrotliMetablockHeaderArena* h = &s->arena.header;
+  brotli_reg_t symbol = h->symbol;
+  brotli_reg_t repeat = h->repeat;
+  brotli_reg_t space = h->space;
+  brotli_reg_t prev_code_len = h->prev_code_len;
+  brotli_reg_t repeat_code_len = h->repeat_code_len;
+  uint16_t* symbol_lists = h->symbol_lists;
+  uint16_t* code_length_histo = h->code_length_histo;
+  int* next_symbol = h->next_symbol;
+  if (!BrotliWarmupBitReader(br)) {
+    return BROTLI_DECODER_NEEDS_MORE_INPUT;
+  }
+  while (symbol < alphabet_size && space > 0) {
+    const HuffmanCode* p = h->table;
+    brotli_reg_t code_len;
+    BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(p);
+    if (!BrotliCheckInputAmount(br)) {
+      h->symbol = symbol;
+      h->repeat = repeat;
+      h->prev_code_len = prev_code_len;
+      h->repeat_code_len = repeat_code_len;
+      h->space = space;
+      return BROTLI_DECODER_NEEDS_MORE_INPUT;
+    }
+    BrotliFillBitWindow16(br);
+    BROTLI_HC_ADJUST_TABLE_INDEX(p, BrotliGetBitsUnmasked(br) &
+        BitMask(BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH));
+    BrotliDropBits(br, BROTLI_HC_FAST_LOAD_BITS(p));  /* Use 1..5 bits. */
+    code_len = BROTLI_HC_FAST_LOAD_VALUE(p);  /* code_len == 0..17 */
+    if (code_len < BROTLI_REPEAT_PREVIOUS_CODE_LENGTH) {
+      ProcessSingleCodeLength(code_len, &symbol, &repeat, &space,
+          &prev_code_len, symbol_lists, code_length_histo, next_symbol);
+    } else {  /* code_len == 16..17, extra_bits == 2..3 */
+      brotli_reg_t extra_bits =
+          (code_len == BROTLI_REPEAT_PREVIOUS_CODE_LENGTH) ? 2 : 3;
+      brotli_reg_t repeat_delta =
+          BrotliGetBitsUnmasked(br) & BitMask(extra_bits);
+      BrotliDropBits(br, extra_bits);
+      ProcessRepeatedCodeLength(code_len, repeat_delta, alphabet_size,
+          &symbol, &repeat, &space, &prev_code_len, &repeat_code_len,
+          symbol_lists, code_length_histo, next_symbol);
+    }
+  }
+  h->space = space;
+  return BROTLI_DECODER_SUCCESS;
+}
+
+static BrotliDecoderErrorCode SafeReadSymbolCodeLengths(
+    brotli_reg_t alphabet_size, BrotliDecoderState* s) {
+  BrotliBitReader* br = &s->br;
+  BrotliMetablockHeaderArena* h = &s->arena.header;
+  BROTLI_BOOL get_byte = BROTLI_FALSE;
+  while (h->symbol < alphabet_size && h->space > 0) {
+    const HuffmanCode* p = h->table;
+    brotli_reg_t code_len;
+    brotli_reg_t available_bits;
+    brotli_reg_t bits = 0;
+    BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(p);
+    if (get_byte && !BrotliPullByte(br)) return BROTLI_DECODER_NEEDS_MORE_INPUT;
+    get_byte = BROTLI_FALSE;
+    available_bits = BrotliGetAvailableBits(br);
+    if (available_bits != 0) {
+      bits = (uint32_t)BrotliGetBitsUnmasked(br);
+    }
+    BROTLI_HC_ADJUST_TABLE_INDEX(p,
+        bits & BitMask(BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH));
+    if (BROTLI_HC_FAST_LOAD_BITS(p) > available_bits) {
+      get_byte = BROTLI_TRUE;
+      continue;
+    }
+    code_len = BROTLI_HC_FAST_LOAD_VALUE(p);  /* code_len == 0..17 */
+    if (code_len < BROTLI_REPEAT_PREVIOUS_CODE_LENGTH) {
+      BrotliDropBits(br, BROTLI_HC_FAST_LOAD_BITS(p));
+      ProcessSingleCodeLength(code_len, &h->symbol, &h->repeat, &h->space,
+          &h->prev_code_len, h->symbol_lists, h->code_length_histo,
+          h->next_symbol);
+    } else {  /* code_len == 16..17, extra_bits == 2..3 */
+      brotli_reg_t extra_bits = code_len - 14U;
+      brotli_reg_t repeat_delta = (bits >> BROTLI_HC_FAST_LOAD_BITS(p)) &
+          BitMask(extra_bits);
+      if (available_bits < BROTLI_HC_FAST_LOAD_BITS(p) + extra_bits) {
+        get_byte = BROTLI_TRUE;
+        continue;
+      }
+      BrotliDropBits(br, BROTLI_HC_FAST_LOAD_BITS(p) + extra_bits);
+      ProcessRepeatedCodeLength(code_len, repeat_delta, alphabet_size,
+          &h->symbol, &h->repeat, &h->space, &h->prev_code_len,
+          &h->repeat_code_len, h->symbol_lists, h->code_length_histo,
+          h->next_symbol);
+    }
+  }
+  return BROTLI_DECODER_SUCCESS;
+}
+
+/* Reads and decodes 15..18 codes using static prefix code.
+   Each code is 2..4 bits long. In total 30..72 bits are used. */
+static BrotliDecoderErrorCode ReadCodeLengthCodeLengths(BrotliDecoderState* s) {
+  BrotliBitReader* br = &s->br;
+  BrotliMetablockHeaderArena* h = &s->arena.header;
+  brotli_reg_t num_codes = h->repeat;
+  brotli_reg_t space = h->space;
+  brotli_reg_t i = h->sub_loop_counter;
+  for (; i < BROTLI_CODE_LENGTH_CODES; ++i) {
+    const uint8_t code_len_idx = kCodeLengthCodeOrder[i];
+    brotli_reg_t ix;
+    brotli_reg_t v;
+    if (BROTLI_PREDICT_FALSE(!BrotliSafeGetBits(br, 4, &ix))) {
+      brotli_reg_t available_bits = BrotliGetAvailableBits(br);
+      if (available_bits != 0) {
+        ix = BrotliGetBitsUnmasked(br) & 0xF;
+      } else {
+        ix = 0;
+      }
+      if (kCodeLengthPrefixLength[ix] > available_bits) {
+        h->sub_loop_counter = i;
+        h->repeat = num_codes;
+        h->space = space;
+        h->substate_huffman = BROTLI_STATE_HUFFMAN_COMPLEX;
+        return BROTLI_DECODER_NEEDS_MORE_INPUT;
+      }
+    }
+    v = kCodeLengthPrefixValue[ix];
+    BrotliDropBits(br, kCodeLengthPrefixLength[ix]);
+    h->code_length_code_lengths[code_len_idx] = (uint8_t)v;
+    BROTLI_LOG_ARRAY_INDEX(h->code_length_code_lengths, code_len_idx);
+    if (v != 0) {
+      space = space - (32U >> v);
+      ++num_codes;
+      ++h->code_length_histo[v];
+      if (space - 1U >= 32U) {
+        /* space is 0 or wrapped around. */
+        break;
+      }
+    }
+  }
+  if (!(num_codes == 1 || space == 0)) {
+    return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_CL_SPACE);
+  }
+  return BROTLI_DECODER_SUCCESS;
+}
+
+/* Decodes the Huffman tables.
+   There are 2 scenarios:
+    A) Huffman code contains only few symbols (1..4). Those symbols are read
+       directly; their code lengths are defined by the number of symbols.
+       For this scenario 4 - 49 bits will be read.
+
+    B) 2-phase decoding:
+    B.1) Small Huffman table is decoded; it is specified with code lengths
+         encoded with predefined entropy code. 32 - 74 bits are used.
+    B.2) Decoded table is used to decode code lengths of symbols in resulting
+         Huffman table. In worst case 3520 bits are read. */
+static BrotliDecoderErrorCode ReadHuffmanCode(brotli_reg_t alphabet_size_max,
+                                              brotli_reg_t alphabet_size_limit,
+                                              HuffmanCode* table,
+                                              brotli_reg_t* opt_table_size,
+                                              BrotliDecoderState* s) {
+  BrotliBitReader* br = &s->br;
+  BrotliMetablockHeaderArena* h = &s->arena.header;
+  /* State machine. */
+  for (;;) {
+    switch (h->substate_huffman) {
+      case BROTLI_STATE_HUFFMAN_NONE:
+        if (!BrotliSafeReadBits(br, 2, &h->sub_loop_counter)) {
+          return BROTLI_DECODER_NEEDS_MORE_INPUT;
+        }
+        BROTLI_LOG_UINT(h->sub_loop_counter);
+        /* The value is used as follows:
+           1 for simple code;
+           0 for no skipping, 2 skips 2 code lengths, 3 skips 3 code lengths */
+        if (h->sub_loop_counter != 1) {
+          h->space = 32;
+          h->repeat = 0;  /* num_codes */
+          memset(&h->code_length_histo[0], 0, sizeof(h->code_length_histo[0]) *
+              (BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH + 1));
+          memset(&h->code_length_code_lengths[0], 0,
+              sizeof(h->code_length_code_lengths));
+          h->substate_huffman = BROTLI_STATE_HUFFMAN_COMPLEX;
+          continue;
+        }
+      /* Fall through. */
+
+      case BROTLI_STATE_HUFFMAN_SIMPLE_SIZE:
+        /* Read symbols, codes & code lengths directly. */
+        if (!BrotliSafeReadBits(br, 2, &h->symbol)) {  /* num_symbols */
+          h->substate_huffman = BROTLI_STATE_HUFFMAN_SIMPLE_SIZE;
+          return BROTLI_DECODER_NEEDS_MORE_INPUT;
+        }
+        h->sub_loop_counter = 0;
+      /* Fall through. */
+
+      case BROTLI_STATE_HUFFMAN_SIMPLE_READ: {
+        BrotliDecoderErrorCode result =
+            ReadSimpleHuffmanSymbols(alphabet_size_max, alphabet_size_limit, s);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          return result;
+        }
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_HUFFMAN_SIMPLE_BUILD: {
+        brotli_reg_t table_size;
+        if (h->symbol == 3) {
+          brotli_reg_t bits;
+          if (!BrotliSafeReadBits(br, 1, &bits)) {
+            h->substate_huffman = BROTLI_STATE_HUFFMAN_SIMPLE_BUILD;
+            return BROTLI_DECODER_NEEDS_MORE_INPUT;
+          }
+          h->symbol += bits;
+        }
+        BROTLI_LOG_UINT(h->symbol);
+        table_size = BrotliBuildSimpleHuffmanTable(table, HUFFMAN_TABLE_BITS,
+                                                   h->symbols_lists_array,
+                                                   (uint32_t)h->symbol);
+        if (opt_table_size) {
+          *opt_table_size = table_size;
+        }
+        h->substate_huffman = BROTLI_STATE_HUFFMAN_NONE;
+        return BROTLI_DECODER_SUCCESS;
+      }
+
+      /* Decode Huffman-coded code lengths. */
+      case BROTLI_STATE_HUFFMAN_COMPLEX: {
+        brotli_reg_t i;
+        BrotliDecoderErrorCode result = ReadCodeLengthCodeLengths(s);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          return result;
+        }
+        BrotliBuildCodeLengthsHuffmanTable(h->table,
+                                           h->code_length_code_lengths,
+                                           h->code_length_histo);
+        memset(&h->code_length_histo[0], 0, sizeof(h->code_length_histo));
+        for (i = 0; i <= BROTLI_HUFFMAN_MAX_CODE_LENGTH; ++i) {
+          h->next_symbol[i] = (int)i - (BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1);
+          h->symbol_lists[h->next_symbol[i]] = 0xFFFF;
+        }
+
+        h->symbol = 0;
+        h->prev_code_len = BROTLI_INITIAL_REPEATED_CODE_LENGTH;
+        h->repeat = 0;
+        h->repeat_code_len = 0;
+        h->space = 32768;
+        h->substate_huffman = BROTLI_STATE_HUFFMAN_LENGTH_SYMBOLS;
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_HUFFMAN_LENGTH_SYMBOLS: {
+        brotli_reg_t table_size;
+        BrotliDecoderErrorCode result = ReadSymbolCodeLengths(
+            alphabet_size_limit, s);
+        if (result == BROTLI_DECODER_NEEDS_MORE_INPUT) {
+          result = SafeReadSymbolCodeLengths(alphabet_size_limit, s);
+        }
+        if (result != BROTLI_DECODER_SUCCESS) {
+          return result;
+        }
+
+        if (h->space != 0) {
+          BROTLI_LOG(("[ReadHuffmanCode] space = %d\n", (int)h->space));
+          return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_HUFFMAN_SPACE);
+        }
+        table_size = BrotliBuildHuffmanTable(
+            table, HUFFMAN_TABLE_BITS, h->symbol_lists, h->code_length_histo);
+        if (opt_table_size) {
+          *opt_table_size = table_size;
+        }
+        h->substate_huffman = BROTLI_STATE_HUFFMAN_NONE;
+        return BROTLI_DECODER_SUCCESS;
+      }
+
+      default:
+        return
+            BROTLI_FAILURE(BROTLI_DECODER_ERROR_UNREACHABLE);  /* COV_NF_LINE */
+    }
+  }
+}
+
+/* Decodes a block length by reading 3..39 bits. */
+static BROTLI_INLINE brotli_reg_t ReadBlockLength(const HuffmanCode* table,
+                                                  BrotliBitReader* br) {
+  brotli_reg_t code;
+  brotli_reg_t nbits;
+  code = ReadSymbol(table, br);
+  nbits = _kBrotliPrefixCodeRanges[code].nbits;  /* nbits == 2..24 */
+  return _kBrotliPrefixCodeRanges[code].offset + BrotliReadBits24(br, nbits);
+}
+
+/* WARNING: if state is not BROTLI_STATE_READ_BLOCK_LENGTH_NONE, then
+   reading can't be continued with ReadBlockLength. */
+static BROTLI_INLINE BROTLI_BOOL SafeReadBlockLength(
+    BrotliDecoderState* s, brotli_reg_t* result, const HuffmanCode* table,
+    BrotliBitReader* br) {
+  brotli_reg_t index;
+  if (s->substate_read_block_length == BROTLI_STATE_READ_BLOCK_LENGTH_NONE) {
+    if (!SafeReadSymbol(table, br, &index)) {
+      return BROTLI_FALSE;
+    }
+  } else {
+    index = s->block_length_index;
+  }
+  {
+    brotli_reg_t bits;
+    brotli_reg_t nbits = _kBrotliPrefixCodeRanges[index].nbits;
+    brotli_reg_t offset = _kBrotliPrefixCodeRanges[index].offset;
+    if (!BrotliSafeReadBits(br, nbits, &bits)) {
+      s->block_length_index = index;
+      s->substate_read_block_length = BROTLI_STATE_READ_BLOCK_LENGTH_SUFFIX;
+      return BROTLI_FALSE;
+    }
+    *result = offset + bits;
+    s->substate_read_block_length = BROTLI_STATE_READ_BLOCK_LENGTH_NONE;
+    return BROTLI_TRUE;
+  }
+}
+
+/* Transform:
+    1) initialize list L with values 0, 1,... 255
+    2) For each input element X:
+    2.1) let Y = L[X]
+    2.2) remove X-th element from L
+    2.3) prepend Y to L
+    2.4) append Y to output
+
+   In most cases max(Y) <= 7, so most of L remains intact.
+   To reduce the cost of initialization, we reuse L, remember the upper bound
+   of Y values, and reinitialize only first elements in L.
+
+   Most of input values are 0 and 1. To reduce number of branches, we replace
+   inner for loop with do-while. */
+static BROTLI_NOINLINE void InverseMoveToFrontTransform(
+    uint8_t* v, brotli_reg_t v_len, BrotliDecoderState* state) {
+  /* Reinitialize elements that could have been changed. */
+  brotli_reg_t i = 1;
+  brotli_reg_t upper_bound = state->mtf_upper_bound;
+  uint32_t* mtf = &state->mtf[1];  /* Make mtf[-1] addressable. */
+  uint8_t* mtf_u8 = (uint8_t*)mtf;
+  /* Load endian-aware constant. */
+  const uint8_t b0123[4] = {0, 1, 2, 3};
+  uint32_t pattern;
+  memcpy(&pattern, &b0123, 4);
+
+  /* Initialize list using 4 consequent values pattern. */
+  mtf[0] = pattern;
+  do {
+    pattern += 0x04040404;  /* Advance all 4 values by 4. */
+    mtf[i] = pattern;
+    i++;
+  } while (i <= upper_bound);
+
+  /* Transform the input. */
+  upper_bound = 0;
+  for (i = 0; i < v_len; ++i) {
+    int index = v[i];
+    uint8_t value = mtf_u8[index];
+    upper_bound |= v[i];
+    v[i] = value;
+    mtf_u8[-1] = value;
+    do {
+      index--;
+      mtf_u8[index + 1] = mtf_u8[index];
+    } while (index >= 0);
+  }
+  /* Remember amount of elements to be reinitialized. */
+  state->mtf_upper_bound = upper_bound >> 2;
+}
+
+/* Decodes a series of Huffman table using ReadHuffmanCode function. */
+static BrotliDecoderErrorCode HuffmanTreeGroupDecode(
+    HuffmanTreeGroup* group, BrotliDecoderState* s) {
+  BrotliMetablockHeaderArena* h = &s->arena.header;
+  if (h->substate_tree_group != BROTLI_STATE_TREE_GROUP_LOOP) {
+    h->next = group->codes;
+    h->htree_index = 0;
+    h->substate_tree_group = BROTLI_STATE_TREE_GROUP_LOOP;
+  }
+  while (h->htree_index < group->num_htrees) {
+    brotli_reg_t table_size;
+    BrotliDecoderErrorCode result = ReadHuffmanCode(group->alphabet_size_max,
+        group->alphabet_size_limit, h->next, &table_size, s);
+    if (result != BROTLI_DECODER_SUCCESS) return result;
+    group->htrees[h->htree_index] = h->next;
+    h->next += table_size;
+    ++h->htree_index;
+  }
+  h->substate_tree_group = BROTLI_STATE_TREE_GROUP_NONE;
+  return BROTLI_DECODER_SUCCESS;
+}
+
+/* Decodes a context map.
+   Decoding is done in 4 phases:
+    1) Read auxiliary information (6..16 bits) and allocate memory.
+       In case of trivial context map, decoding is finished at this phase.
+    2) Decode Huffman table using ReadHuffmanCode function.
+       This table will be used for reading context map items.
+    3) Read context map items; "0" values could be run-length encoded.
+    4) Optionally, apply InverseMoveToFront transform to the resulting map. */
+static BrotliDecoderErrorCode DecodeContextMap(brotli_reg_t context_map_size,
+                                               brotli_reg_t* num_htrees,
+                                               uint8_t** context_map_arg,
+                                               BrotliDecoderState* s) {
+  BrotliBitReader* br = &s->br;
+  BrotliDecoderErrorCode result = BROTLI_DECODER_SUCCESS;
+  BrotliMetablockHeaderArena* h = &s->arena.header;
+
+  switch ((int)h->substate_context_map) {
+    case BROTLI_STATE_CONTEXT_MAP_NONE:
+      result = DecodeVarLenUint8(s, br, num_htrees);
+      if (result != BROTLI_DECODER_SUCCESS) {
+        return result;
+      }
+      (*num_htrees)++;
+      h->context_index = 0;
+      BROTLI_LOG_UINT(context_map_size);
+      BROTLI_LOG_UINT(*num_htrees);
+      *context_map_arg =
+          (uint8_t*)BROTLI_DECODER_ALLOC(s, (size_t)context_map_size);
+      if (*context_map_arg == 0) {
+        return BROTLI_FAILURE(BROTLI_DECODER_ERROR_ALLOC_CONTEXT_MAP);
+      }
+      if (*num_htrees <= 1) {
+        memset(*context_map_arg, 0, (size_t)context_map_size);
+        return BROTLI_DECODER_SUCCESS;
+      }
+      h->substate_context_map = BROTLI_STATE_CONTEXT_MAP_READ_PREFIX;
+    /* Fall through. */
+
+    case BROTLI_STATE_CONTEXT_MAP_READ_PREFIX: {
+      brotli_reg_t bits;
+      /* In next stage ReadHuffmanCode uses at least 4 bits, so it is safe
+         to peek 4 bits ahead. */
+      if (!BrotliSafeGetBits(br, 5, &bits)) {
+        return BROTLI_DECODER_NEEDS_MORE_INPUT;
+      }
+      if ((bits & 1) != 0) { /* Use RLE for zeros. */
+        h->max_run_length_prefix = (bits >> 1) + 1;
+        BrotliDropBits(br, 5);
+      } else {
+        h->max_run_length_prefix = 0;
+        BrotliDropBits(br, 1);
+      }
+      BROTLI_LOG_UINT(h->max_run_length_prefix);
+      h->substate_context_map = BROTLI_STATE_CONTEXT_MAP_HUFFMAN;
+    }
+    /* Fall through. */
+
+    case BROTLI_STATE_CONTEXT_MAP_HUFFMAN: {
+      brotli_reg_t alphabet_size = *num_htrees + h->max_run_length_prefix;
+      result = ReadHuffmanCode(alphabet_size, alphabet_size,
+                               h->context_map_table, NULL, s);
+      if (result != BROTLI_DECODER_SUCCESS) return result;
+      h->code = 0xFFFF;
+      h->substate_context_map = BROTLI_STATE_CONTEXT_MAP_DECODE;
+    }
+    /* Fall through. */
+
+    case BROTLI_STATE_CONTEXT_MAP_DECODE: {
+      brotli_reg_t context_index = h->context_index;
+      brotli_reg_t max_run_length_prefix = h->max_run_length_prefix;
+      uint8_t* context_map = *context_map_arg;
+      brotli_reg_t code = h->code;
+      BROTLI_BOOL skip_preamble = (code != 0xFFFF);
+      while (context_index < context_map_size || skip_preamble) {
+        if (!skip_preamble) {
+          if (!SafeReadSymbol(h->context_map_table, br, &code)) {
+            h->code = 0xFFFF;
+            h->context_index = context_index;
+            return BROTLI_DECODER_NEEDS_MORE_INPUT;
+          }
+          BROTLI_LOG_UINT(code);
+
+          if (code == 0) {
+            context_map[context_index++] = 0;
+            continue;
+          }
+          if (code > max_run_length_prefix) {
+            context_map[context_index++] =
+                (uint8_t)(code - max_run_length_prefix);
+            continue;
+          }
+        } else {
+          skip_preamble = BROTLI_FALSE;
+        }
+        /* RLE sub-stage. */
+        {
+          brotli_reg_t reps;
+          if (!BrotliSafeReadBits(br, code, &reps)) {
+            h->code = code;
+            h->context_index = context_index;
+            return BROTLI_DECODER_NEEDS_MORE_INPUT;
+          }
+          reps += 1U << code;
+          BROTLI_LOG_UINT(reps);
+          if (context_index + reps > context_map_size) {
+            return
+                BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_CONTEXT_MAP_REPEAT);
+          }
+          do {
+            context_map[context_index++] = 0;
+          } while (--reps);
+        }
+      }
+    }
+    /* Fall through. */
+
+    case BROTLI_STATE_CONTEXT_MAP_TRANSFORM: {
+      brotli_reg_t bits;
+      if (!BrotliSafeReadBits(br, 1, &bits)) {
+        h->substate_context_map = BROTLI_STATE_CONTEXT_MAP_TRANSFORM;
+        return BROTLI_DECODER_NEEDS_MORE_INPUT;
+      }
+      if (bits != 0) {
+        InverseMoveToFrontTransform(*context_map_arg, context_map_size, s);
+      }
+      h->substate_context_map = BROTLI_STATE_CONTEXT_MAP_NONE;
+      return BROTLI_DECODER_SUCCESS;
+    }
+
+    default:
+      return
+          BROTLI_FAILURE(BROTLI_DECODER_ERROR_UNREACHABLE);  /* COV_NF_LINE */
+  }
+}
+
+/* Decodes a command or literal and updates block type ring-buffer.
+   Reads 3..54 bits. */
+static BROTLI_INLINE BROTLI_BOOL DecodeBlockTypeAndLength(
+    int safe, BrotliDecoderState* s, int tree_type) {
+  brotli_reg_t max_block_type = s->num_block_types[tree_type];
+  const HuffmanCode* type_tree = &s->block_type_trees[
+      tree_type * BROTLI_HUFFMAN_MAX_SIZE_258];
+  const HuffmanCode* len_tree = &s->block_len_trees[
+      tree_type * BROTLI_HUFFMAN_MAX_SIZE_26];
+  BrotliBitReader* br = &s->br;
+  brotli_reg_t* ringbuffer = &s->block_type_rb[tree_type * 2];
+  brotli_reg_t block_type;
+  if (max_block_type <= 1) {
+    return BROTLI_FALSE;
+  }
+
+  /* Read 0..15 + 3..39 bits. */
+  if (!safe) {
+    block_type = ReadSymbol(type_tree, br);
+    s->block_length[tree_type] = ReadBlockLength(len_tree, br);
+  } else {
+    BrotliBitReaderState memento;
+    BrotliBitReaderSaveState(br, &memento);
+    if (!SafeReadSymbol(type_tree, br, &block_type)) return BROTLI_FALSE;
+    if (!SafeReadBlockLength(s, &s->block_length[tree_type], len_tree, br)) {
+      s->substate_read_block_length = BROTLI_STATE_READ_BLOCK_LENGTH_NONE;
+      BrotliBitReaderRestoreState(br, &memento);
+      return BROTLI_FALSE;
+    }
+  }
+
+  if (block_type == 1) {
+    block_type = ringbuffer[1] + 1;
+  } else if (block_type == 0) {
+    block_type = ringbuffer[0];
+  } else {
+    block_type -= 2;
+  }
+  if (block_type >= max_block_type) {
+    block_type -= max_block_type;
+  }
+  ringbuffer[0] = ringbuffer[1];
+  ringbuffer[1] = block_type;
+  return BROTLI_TRUE;
+}
+
+static BROTLI_INLINE void DetectTrivialLiteralBlockTypes(
+    BrotliDecoderState* s) {
+  size_t i;
+  for (i = 0; i < 8; ++i) s->trivial_literal_contexts[i] = 0;
+  for (i = 0; i < s->num_block_types[0]; i++) {
+    size_t offset = i << BROTLI_LITERAL_CONTEXT_BITS;
+    size_t error = 0;
+    size_t sample = s->context_map[offset];
+    size_t j;
+    for (j = 0; j < (1u << BROTLI_LITERAL_CONTEXT_BITS);) {
+      /* NOLINTNEXTLINE(bugprone-macro-repeated-side-effects) */
+      BROTLI_REPEAT_4({ error |= s->context_map[offset + j++] ^ sample; })
+    }
+    if (error == 0) {
+      s->trivial_literal_contexts[i >> 5] |= 1u << (i & 31);
+    }
+  }
+}
+
+static BROTLI_INLINE void PrepareLiteralDecoding(BrotliDecoderState* s) {
+  uint8_t context_mode;
+  size_t trivial;
+  brotli_reg_t block_type = s->block_type_rb[1];
+  brotli_reg_t context_offset = block_type << BROTLI_LITERAL_CONTEXT_BITS;
+  s->context_map_slice = s->context_map + context_offset;
+  trivial = s->trivial_literal_contexts[block_type >> 5];
+  s->trivial_literal_context = (trivial >> (block_type & 31)) & 1;
+  s->literal_htree = s->literal_hgroup.htrees[s->context_map_slice[0]];
+  context_mode = s->context_modes[block_type] & 3;
+  s->context_lookup = BROTLI_CONTEXT_LUT(context_mode);
+}
+
+/* Decodes the block type and updates the state for literal context.
+   Reads 3..54 bits. */
+static BROTLI_INLINE BROTLI_BOOL DecodeLiteralBlockSwitchInternal(
+    int safe, BrotliDecoderState* s) {
+  if (!DecodeBlockTypeAndLength(safe, s, 0)) {
+    return BROTLI_FALSE;
+  }
+  PrepareLiteralDecoding(s);
+  return BROTLI_TRUE;
+}
+
+static void BROTLI_NOINLINE DecodeLiteralBlockSwitch(BrotliDecoderState* s) {
+  DecodeLiteralBlockSwitchInternal(0, s);
+}
+
+static BROTLI_BOOL BROTLI_NOINLINE SafeDecodeLiteralBlockSwitch(
+    BrotliDecoderState* s) {
+  return DecodeLiteralBlockSwitchInternal(1, s);
+}
+
+/* Block switch for insert/copy length.
+   Reads 3..54 bits. */
+static BROTLI_INLINE BROTLI_BOOL DecodeCommandBlockSwitchInternal(
+    int safe, BrotliDecoderState* s) {
+  if (!DecodeBlockTypeAndLength(safe, s, 1)) {
+    return BROTLI_FALSE;
+  }
+  s->htree_command = s->insert_copy_hgroup.htrees[s->block_type_rb[3]];
+  return BROTLI_TRUE;
+}
+
+static void BROTLI_NOINLINE DecodeCommandBlockSwitch(BrotliDecoderState* s) {
+  DecodeCommandBlockSwitchInternal(0, s);
+}
+
+static BROTLI_BOOL BROTLI_NOINLINE SafeDecodeCommandBlockSwitch(
+    BrotliDecoderState* s) {
+  return DecodeCommandBlockSwitchInternal(1, s);
+}
+
+/* Block switch for distance codes.
+   Reads 3..54 bits. */
+static BROTLI_INLINE BROTLI_BOOL DecodeDistanceBlockSwitchInternal(
+    int safe, BrotliDecoderState* s) {
+  if (!DecodeBlockTypeAndLength(safe, s, 2)) {
+    return BROTLI_FALSE;
+  }
+  s->dist_context_map_slice = s->dist_context_map +
+      (s->block_type_rb[5] << BROTLI_DISTANCE_CONTEXT_BITS);
+  s->dist_htree_index = s->dist_context_map_slice[s->distance_context];
+  return BROTLI_TRUE;
+}
+
+static void BROTLI_NOINLINE DecodeDistanceBlockSwitch(BrotliDecoderState* s) {
+  DecodeDistanceBlockSwitchInternal(0, s);
+}
+
+static BROTLI_BOOL BROTLI_NOINLINE SafeDecodeDistanceBlockSwitch(
+    BrotliDecoderState* s) {
+  return DecodeDistanceBlockSwitchInternal(1, s);
+}
+
+static size_t UnwrittenBytes(const BrotliDecoderState* s, BROTLI_BOOL wrap) {
+  size_t pos = wrap && s->pos > s->ringbuffer_size ?
+      (size_t)s->ringbuffer_size : (size_t)(s->pos);
+  size_t partial_pos_rb = (s->rb_roundtrips * (size_t)s->ringbuffer_size) + pos;
+  return partial_pos_rb - s->partial_pos_out;
+}
+
+/* Dumps output.
+   Returns BROTLI_DECODER_NEEDS_MORE_OUTPUT only if there is more output to push
+   and either ring-buffer is as big as window size, or |force| is true. */
+static BrotliDecoderErrorCode BROTLI_NOINLINE WriteRingBuffer(
+    BrotliDecoderState* s, size_t* available_out, uint8_t** next_out,
+    size_t* total_out, BROTLI_BOOL force) {
+  uint8_t* start =
+      s->ringbuffer + (s->partial_pos_out & (size_t)s->ringbuffer_mask);
+  size_t to_write = UnwrittenBytes(s, BROTLI_TRUE);
+  size_t num_written = *available_out;
+  if (num_written > to_write) {
+    num_written = to_write;
+  }
+  if (s->meta_block_remaining_len < 0) {
+    return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_BLOCK_LENGTH_1);
+  }
+  if (next_out && !*next_out) {
+    *next_out = start;
+  } else {
+    if (next_out) {
+      memcpy(*next_out, start, num_written);
+      *next_out += num_written;
+    }
+  }
+  *available_out -= num_written;
+  BROTLI_LOG_UINT(to_write);
+  BROTLI_LOG_UINT(num_written);
+  s->partial_pos_out += num_written;
+  if (total_out) {
+    *total_out = s->partial_pos_out;
+  }
+  if (num_written < to_write) {
+    if (s->ringbuffer_size == (1 << s->window_bits) || force) {
+      return BROTLI_DECODER_NEEDS_MORE_OUTPUT;
+    } else {
+      return BROTLI_DECODER_SUCCESS;
+    }
+  }
+  /* Wrap ring buffer only if it has reached its maximal size. */
+  if (s->ringbuffer_size == (1 << s->window_bits) &&
+      s->pos >= s->ringbuffer_size) {
+    s->pos -= s->ringbuffer_size;
+    s->rb_roundtrips++;
+    s->should_wrap_ringbuffer = (size_t)s->pos != 0 ? 1 : 0;
+  }
+  return BROTLI_DECODER_SUCCESS;
+}
+
+static void BROTLI_NOINLINE WrapRingBuffer(BrotliDecoderState* s) {
+  if (s->should_wrap_ringbuffer) {
+    memcpy(s->ringbuffer, s->ringbuffer_end, (size_t)s->pos);
+    s->should_wrap_ringbuffer = 0;
+  }
+}
+
+/* Allocates ring-buffer.
+
+   s->ringbuffer_size MUST be updated by BrotliCalculateRingBufferSize before
+   this function is called.
+
+   Last two bytes of ring-buffer are initialized to 0, so context calculation
+   could be done uniformly for the first two and all other positions. */
+static BROTLI_BOOL BROTLI_NOINLINE BrotliEnsureRingBuffer(
+    BrotliDecoderState* s) {
+  uint8_t* old_ringbuffer = s->ringbuffer;
+  if (s->ringbuffer_size == s->new_ringbuffer_size) {
+    return BROTLI_TRUE;
+  }
+
+  s->ringbuffer = (uint8_t*)BROTLI_DECODER_ALLOC(s,
+      (size_t)(s->new_ringbuffer_size) + kRingBufferWriteAheadSlack);
+  if (s->ringbuffer == 0) {
+    /* Restore previous value. */
+    s->ringbuffer = old_ringbuffer;
+    return BROTLI_FALSE;
+  }
+  s->ringbuffer[s->new_ringbuffer_size - 2] = 0;
+  s->ringbuffer[s->new_ringbuffer_size - 1] = 0;
+
+  if (!!old_ringbuffer) {
+    memcpy(s->ringbuffer, old_ringbuffer, (size_t)s->pos);
+    BROTLI_DECODER_FREE(s, old_ringbuffer);
+  }
+
+  s->ringbuffer_size = s->new_ringbuffer_size;
+  s->ringbuffer_mask = s->new_ringbuffer_size - 1;
+  s->ringbuffer_end = s->ringbuffer + s->ringbuffer_size;
+
+  return BROTLI_TRUE;
+}
+
+static BrotliDecoderErrorCode BROTLI_NOINLINE
+SkipMetadataBlock(BrotliDecoderState* s) {
+  BrotliBitReader* br = &s->br;
+
+  if (s->meta_block_remaining_len == 0) {
+    return BROTLI_DECODER_SUCCESS;
+  }
+
+  BROTLI_DCHECK((BrotliGetAvailableBits(br) & 7) == 0);
+
+  /* Drain accumulator. */
+  if (BrotliGetAvailableBits(br) >= 8) {
+    uint8_t buffer[8];
+    int nbytes = (int)(BrotliGetAvailableBits(br)) >> 3;
+    BROTLI_DCHECK(nbytes <= 8);
+    if (nbytes > s->meta_block_remaining_len) {
+      nbytes = s->meta_block_remaining_len;
+    }
+    BrotliCopyBytes(buffer, br, (size_t)nbytes);
+    if (s->metadata_chunk_func) {
+      s->metadata_chunk_func(s->metadata_callback_opaque, buffer,
+                             (size_t)nbytes);
+    }
+    s->meta_block_remaining_len -= nbytes;
+    if (s->meta_block_remaining_len == 0) {
+      return BROTLI_DECODER_SUCCESS;
+    }
+  }
+
+  /* Direct access to metadata is possible. */
+  int nbytes = (int)BrotliGetRemainingBytes(br);
+  if (nbytes > s->meta_block_remaining_len) {
+    nbytes = s->meta_block_remaining_len;
+  }
+  if (nbytes > 0) {
+    if (s->metadata_chunk_func) {
+      s->metadata_chunk_func(s->metadata_callback_opaque, br->next_in,
+                             (size_t)nbytes);
+    }
+    BrotliDropBytes(br, (size_t)nbytes);
+    s->meta_block_remaining_len -= nbytes;
+    if (s->meta_block_remaining_len == 0) {
+      return BROTLI_DECODER_SUCCESS;
+    }
+  }
+
+  BROTLI_DCHECK(BrotliGetRemainingBytes(br) == 0);
+
+  return BROTLI_DECODER_NEEDS_MORE_INPUT;
+}
+
+static BrotliDecoderErrorCode BROTLI_NOINLINE CopyUncompressedBlockToOutput(
+    size_t* available_out, uint8_t** next_out, size_t* total_out,
+    BrotliDecoderState* s) {
+  /* TODO(eustas): avoid allocation for single uncompressed block. */
+  if (!BrotliEnsureRingBuffer(s)) {
+    return BROTLI_FAILURE(BROTLI_DECODER_ERROR_ALLOC_RING_BUFFER_1);
+  }
+
+  /* State machine */
+  for (;;) {
+    switch (s->substate_uncompressed) {
+      case BROTLI_STATE_UNCOMPRESSED_NONE: {
+        int nbytes = (int)BrotliGetRemainingBytes(&s->br);
+        if (nbytes > s->meta_block_remaining_len) {
+          nbytes = s->meta_block_remaining_len;
+        }
+        if (s->pos + nbytes > s->ringbuffer_size) {
+          nbytes = s->ringbuffer_size - s->pos;
+        }
+        /* Copy remaining bytes from s->br.buf_ to ring-buffer. */
+        BrotliCopyBytes(&s->ringbuffer[s->pos], &s->br, (size_t)nbytes);
+        s->pos += nbytes;
+        s->meta_block_remaining_len -= nbytes;
+        if (s->pos < 1 << s->window_bits) {
+          if (s->meta_block_remaining_len == 0) {
+            return BROTLI_DECODER_SUCCESS;
+          }
+          return BROTLI_DECODER_NEEDS_MORE_INPUT;
+        }
+        s->substate_uncompressed = BROTLI_STATE_UNCOMPRESSED_WRITE;
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_UNCOMPRESSED_WRITE: {
+        BrotliDecoderErrorCode result;
+        result = WriteRingBuffer(
+            s, available_out, next_out, total_out, BROTLI_FALSE);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          return result;
+        }
+        if (s->ringbuffer_size == 1 << s->window_bits) {
+          s->max_distance = s->max_backward_distance;
+        }
+        s->substate_uncompressed = BROTLI_STATE_UNCOMPRESSED_NONE;
+        break;
+      }
+    }
+  }
+  BROTLI_DCHECK(0);  /* Unreachable */
+}
+
+static BROTLI_BOOL AttachCompoundDictionary(
+    BrotliDecoderState* state, const uint8_t* data, size_t size) {
+  BrotliDecoderCompoundDictionary* addon = state->compound_dictionary;
+  if (state->state != BROTLI_STATE_UNINITED) return BROTLI_FALSE;
+  if (!addon) {
+    addon = (BrotliDecoderCompoundDictionary*)BROTLI_DECODER_ALLOC(
+        state, sizeof(BrotliDecoderCompoundDictionary));
+    if (!addon) return BROTLI_FALSE;
+    addon->num_chunks = 0;
+    addon->total_size = 0;
+    addon->br_length = 0;
+    addon->br_copied = 0;
+    addon->block_bits = -1;
+    addon->chunk_offsets[0] = 0;
+    state->compound_dictionary = addon;
+  }
+  if (addon->num_chunks == 15) return BROTLI_FALSE;
+  addon->chunks[addon->num_chunks] = data;
+  addon->num_chunks++;
+  addon->total_size += (int)size;
+  addon->chunk_offsets[addon->num_chunks] = addon->total_size;
+  return BROTLI_TRUE;
+}
+
+static void EnsureCoumpoundDictionaryInitialized(BrotliDecoderState* state) {
+  BrotliDecoderCompoundDictionary* addon = state->compound_dictionary;
+  /* 256 = (1 << 8) slots in block map. */
+  int block_bits = 8;
+  int cursor = 0;
+  int index = 0;
+  if (addon->block_bits != -1) return;
+  while (((addon->total_size - 1) >> block_bits) != 0) block_bits++;
+  block_bits -= 8;
+  addon->block_bits = block_bits;
+  while (cursor < addon->total_size) {
+    while (addon->chunk_offsets[index + 1] < cursor) index++;
+    addon->block_map[cursor >> block_bits] = (uint8_t)index;
+    cursor += 1 << block_bits;
+  }
+}
+
+static BROTLI_BOOL InitializeCompoundDictionaryCopy(BrotliDecoderState* s,
+    int address, int length) {
+  BrotliDecoderCompoundDictionary* addon = s->compound_dictionary;
+  int index;
+  EnsureCoumpoundDictionaryInitialized(s);
+  index = addon->block_map[address >> addon->block_bits];
+  while (address >= addon->chunk_offsets[index + 1]) index++;
+  if (addon->total_size < address + length) return BROTLI_FALSE;
+  /* Update the recent distances cache. */
+  s->dist_rb[s->dist_rb_idx & 3] = s->distance_code;
+  ++s->dist_rb_idx;
+  s->meta_block_remaining_len -= length;
+  addon->br_index = index;
+  addon->br_offset = address - addon->chunk_offsets[index];
+  addon->br_length = length;
+  addon->br_copied = 0;
+  return BROTLI_TRUE;
+}
+
+static int GetCompoundDictionarySize(BrotliDecoderState* s) {
+  return s->compound_dictionary ? s->compound_dictionary->total_size : 0;
+}
+
+static int CopyFromCompoundDictionary(BrotliDecoderState* s, int pos) {
+  BrotliDecoderCompoundDictionary* addon = s->compound_dictionary;
+  int orig_pos = pos;
+  while (addon->br_length != addon->br_copied) {
+    uint8_t* copy_dst = &s->ringbuffer[pos];
+    const uint8_t* copy_src =
+        addon->chunks[addon->br_index] + addon->br_offset;
+    int space = s->ringbuffer_size - pos;
+    int rem_chunk_length = (addon->chunk_offsets[addon->br_index + 1] -
+        addon->chunk_offsets[addon->br_index]) - addon->br_offset;
+    int length = addon->br_length - addon->br_copied;
+    if (length > rem_chunk_length) length = rem_chunk_length;
+    if (length > space) length = space;
+    memcpy(copy_dst, copy_src, (size_t)length);
+    pos += length;
+    addon->br_offset += length;
+    addon->br_copied += length;
+    if (length == rem_chunk_length) {
+      addon->br_index++;
+      addon->br_offset = 0;
+    }
+    if (pos == s->ringbuffer_size) break;
+  }
+  return pos - orig_pos;
+}
+
+BROTLI_BOOL BrotliDecoderAttachDictionary(
+    BrotliDecoderState* state, BrotliSharedDictionaryType type,
+    size_t data_size, const uint8_t data[BROTLI_ARRAY_PARAM(data_size)]) {
+  brotli_reg_t i;
+  brotli_reg_t num_prefix_before = state->dictionary->num_prefix;
+  if (state->state != BROTLI_STATE_UNINITED) return BROTLI_FALSE;
+  if (!BrotliSharedDictionaryAttach(state->dictionary, type, data_size, data)) {
+    return BROTLI_FALSE;
+  }
+  for (i = num_prefix_before; i < state->dictionary->num_prefix; i++) {
+    if (!AttachCompoundDictionary(
+        state, state->dictionary->prefix[i],
+        state->dictionary->prefix_size[i])) {
+      return BROTLI_FALSE;
+    }
+  }
+  return BROTLI_TRUE;
+}
+
+/* Calculates the smallest feasible ring buffer.
+
+   If we know the data size is small, do not allocate more ring buffer
+   size than needed to reduce memory usage.
+
+   When this method is called, metablock size and flags MUST be decoded. */
+static void BROTLI_NOINLINE BrotliCalculateRingBufferSize(
+    BrotliDecoderState* s) {
+  int window_size = 1 << s->window_bits;
+  int new_ringbuffer_size = window_size;
+  /* We need at least 2 bytes of ring buffer size to get the last two
+     bytes for context from there */
+  int min_size = s->ringbuffer_size ? s->ringbuffer_size : 1024;
+  int output_size;
+
+  /* If maximum is already reached, no further extension is retired. */
+  if (s->ringbuffer_size == window_size) {
+    return;
+  }
+
+  /* Metadata blocks does not touch ring buffer. */
+  if (s->is_metadata) {
+    return;
+  }
+
+  if (!s->ringbuffer) {
+    output_size = 0;
+  } else {
+    output_size = s->pos;
+  }
+  output_size += s->meta_block_remaining_len;
+  min_size = min_size < output_size ? output_size : min_size;
+
+  if (!!s->canny_ringbuffer_allocation) {
+    /* Reduce ring buffer size to save memory when server is unscrupulous.
+       In worst case memory usage might be 1.5x bigger for a short period of
+       ring buffer reallocation. */
+    while ((new_ringbuffer_size >> 1) >= min_size) {
+      new_ringbuffer_size >>= 1;
+    }
+  }
+
+  s->new_ringbuffer_size = new_ringbuffer_size;
+}
+
+/* Reads 1..256 2-bit context modes. */
+static BrotliDecoderErrorCode ReadContextModes(BrotliDecoderState* s) {
+  BrotliBitReader* br = &s->br;
+  int i = s->loop_counter;
+
+  while (i < (int)s->num_block_types[0]) {
+    brotli_reg_t bits;
+    if (!BrotliSafeReadBits(br, 2, &bits)) {
+      s->loop_counter = i;
+      return BROTLI_DECODER_NEEDS_MORE_INPUT;
+    }
+    s->context_modes[i] = (uint8_t)bits;
+    BROTLI_LOG_ARRAY_INDEX(s->context_modes, i);
+    i++;
+  }
+  return BROTLI_DECODER_SUCCESS;
+}
+
+static BROTLI_INLINE void TakeDistanceFromRingBuffer(BrotliDecoderState* s) {
+  int offset = s->distance_code - 3;
+  if (s->distance_code <= 3) {
+    /* Compensate double distance-ring-buffer roll for dictionary items. */
+    s->distance_context = 1 >> s->distance_code;
+    s->distance_code = s->dist_rb[(s->dist_rb_idx - offset) & 3];
+    s->dist_rb_idx -= s->distance_context;
+  } else {
+    int index_delta = 3;
+    int delta;
+    int base = s->distance_code - 10;
+    if (s->distance_code < 10) {
+      base = s->distance_code - 4;
+    } else {
+      index_delta = 2;
+    }
+    /* Unpack one of six 4-bit values. */
+    delta = ((0x605142 >> (4 * base)) & 0xF) - 3;
+    s->distance_code = s->dist_rb[(s->dist_rb_idx + index_delta) & 0x3] + delta;
+    if (s->distance_code <= 0) {
+      /* A huge distance will cause a BROTLI_FAILURE() soon.
+         This is a little faster than failing here. */
+      s->distance_code = 0x7FFFFFFF;
+    }
+  }
+}
+
+static BROTLI_INLINE BROTLI_BOOL SafeReadBits(
+    BrotliBitReader* const br, brotli_reg_t n_bits, brotli_reg_t* val) {
+  if (n_bits != 0) {
+    return BrotliSafeReadBits(br, n_bits, val);
+  } else {
+    *val = 0;
+    return BROTLI_TRUE;
+  }
+}
+
+static BROTLI_INLINE BROTLI_BOOL SafeReadBits32(
+    BrotliBitReader* const br, brotli_reg_t n_bits, brotli_reg_t* val) {
+  if (n_bits != 0) {
+    return BrotliSafeReadBits32(br, n_bits, val);
+  } else {
+    *val = 0;
+    return BROTLI_TRUE;
+  }
+}
+
+/*
+   RFC 7932 Section 4 with "..." shortenings and "[]" emendations.
+
+   Each distance ... is represented with a pair <distance code, extra bits>...
+   The distance code is encoded using a prefix code... The number of extra bits
+   can be 0..24... Two additional parameters: NPOSTFIX (0..3), and ...
+   NDIRECT (0..120) ... are encoded in the meta-block header...
+
+   The first 16 distance symbols ... reference past distances... ring buffer ...
+   Next NDIRECT distance symbols ... represent distances from 1 to NDIRECT...
+   [For] distance symbols 16 + NDIRECT and greater ... the number of extra bits
+   ... is given by the following formula:
+
+   [ xcode = dcode - NDIRECT - 16 ]
+   ndistbits = 1 + [ xcode ] >> (NPOSTFIX + 1)
+
+   ...
+*/
+
+/*
+   RFC 7932 Section 9.2 with "..." shortenings and "[]" emendations.
+
+   ... to get the actual value of the parameter NDIRECT, left-shift this
+   four-bit number by NPOSTFIX bits ...
+*/
+
+/* Remaining formulas from RFC 7932 Section 4 could be rewritten as following:
+
+     alphabet_size = 16 + NDIRECT + (max_distbits << (NPOSTFIX + 1))
+
+     half = ((xcode >> NPOSTFIX) & 1) << ndistbits
+     postfix = xcode & ((1 << NPOSTFIX) - 1)
+     range_start = 2 * (1 << ndistbits - 1 - 1)
+
+     distance = (range_start + half + extra) << NPOSTFIX + postfix + NDIRECT + 1
+
+   NB: ndistbits >= 1 -> range_start >= 0
+   NB: range_start has factor 2, as the range is covered by 2 "halves"
+   NB: extra -1 offset in range_start formula covers the absence of
+       ndistbits = 0 case
+   NB: when NPOSTFIX = 0, NDIRECT is not greater than 15
+
+   In other words, xcode has the following binary structure - XXXHPPP:
+    - XXX represent the number of extra distance bits
+    - H selects upper / lower range of distances
+    - PPP represent "postfix"
+
+  "Regular" distance encoding has NPOSTFIX = 0; omitting the postfix part
+  simplifies distance calculation.
+
+  Using NPOSTFIX > 0 allows cheaper encoding of regular structures, e.g. where
+  most of distances have the same reminder of division by 2/4/8. For example,
+  the table of int32_t values that come from different sources; if it is likely
+  that 3 highest bytes of values from the same source are the same, then
+  copy distance often looks like 4x + y.
+
+  Distance calculation could be rewritten to:
+
+    ndistbits = NDISTBITS(NDIRECT, NPOSTFIX)[dcode]
+    distance = OFFSET(NDIRECT, NPOSTFIX)[dcode] + extra << NPOSTFIX
+
+  NDISTBITS and OFFSET could be pre-calculated, as NDIRECT and NPOSTFIX could
+  change only once per meta-block.
+*/
+
+/* Calculates distance lookup table.
+   NB: it is possible to have all 64 tables precalculated. */
+static void CalculateDistanceLut(BrotliDecoderState* s) {
+  BrotliMetablockBodyArena* b = &s->arena.body;
+  brotli_reg_t npostfix = s->distance_postfix_bits;
+  brotli_reg_t ndirect = s->num_direct_distance_codes;
+  brotli_reg_t alphabet_size_limit = s->distance_hgroup.alphabet_size_limit;
+  brotli_reg_t postfix = 1u << npostfix;
+  brotli_reg_t j;
+  brotli_reg_t bits = 1;
+  brotli_reg_t half = 0;
+
+  /* Skip short codes. */
+  brotli_reg_t i = BROTLI_NUM_DISTANCE_SHORT_CODES;
+
+  /* Fill direct codes. */
+  for (j = 0; j < ndirect; ++j) {
+    b->dist_extra_bits[i] = 0;
+    b->dist_offset[i] = j + 1;
+    ++i;
+  }
+
+  /* Fill regular distance codes. */
+  while (i < alphabet_size_limit) {
+    brotli_reg_t base = ndirect + ((((2 + half) << bits) - 4) << npostfix) + 1;
+    /* Always fill the complete group. */
+    for (j = 0; j < postfix; ++j) {
+      b->dist_extra_bits[i] = (uint8_t)bits;
+      b->dist_offset[i] = base + j;
+      ++i;
+    }
+    bits = bits + half;
+    half = half ^ 1;
+  }
+}
+
+/* Precondition: s->distance_code < 0. */
+static BROTLI_INLINE BROTLI_BOOL ReadDistanceInternal(
+    int safe, BrotliDecoderState* s, BrotliBitReader* br) {
+  BrotliMetablockBodyArena* b = &s->arena.body;
+  brotli_reg_t code;
+  brotli_reg_t bits;
+  BrotliBitReaderState memento;
+  HuffmanCode* distance_tree = s->distance_hgroup.htrees[s->dist_htree_index];
+  if (!safe) {
+    code = ReadSymbol(distance_tree, br);
+  } else {
+    BrotliBitReaderSaveState(br, &memento);
+    if (!SafeReadSymbol(distance_tree, br, &code)) {
+      return BROTLI_FALSE;
+    }
+  }
+  --s->block_length[2];
+  /* Convert the distance code to the actual distance by possibly
+     looking up past distances from the s->dist_rb. */
+  s->distance_context = 0;
+  if ((code & ~0xFu) == 0) {
+    s->distance_code = (int)code;
+    TakeDistanceFromRingBuffer(s);
+    return BROTLI_TRUE;
+  }
+  if (!safe) {
+    bits = BrotliReadBits32(br, b->dist_extra_bits[code]);
+  } else {
+    if (!SafeReadBits32(br, b->dist_extra_bits[code], &bits)) {
+      ++s->block_length[2];
+      BrotliBitReaderRestoreState(br, &memento);
+      return BROTLI_FALSE;
+    }
+  }
+  s->distance_code =
+      (int)(b->dist_offset[code] + (bits << s->distance_postfix_bits));
+  return BROTLI_TRUE;
+}
+
+static BROTLI_INLINE void ReadDistance(
+    BrotliDecoderState* s, BrotliBitReader* br) {
+  ReadDistanceInternal(0, s, br);
+}
+
+static BROTLI_INLINE BROTLI_BOOL SafeReadDistance(
+    BrotliDecoderState* s, BrotliBitReader* br) {
+  return ReadDistanceInternal(1, s, br);
+}
+
+static BROTLI_INLINE BROTLI_BOOL ReadCommandInternal(
+    int safe, BrotliDecoderState* s, BrotliBitReader* br, int* insert_length) {
+  brotli_reg_t cmd_code;
+  brotli_reg_t insert_len_extra = 0;
+  brotli_reg_t copy_length;
+  CmdLutElement v;
+  BrotliBitReaderState memento;
+  if (!safe) {
+    cmd_code = ReadSymbol(s->htree_command, br);
+  } else {
+    BrotliBitReaderSaveState(br, &memento);
+    if (!SafeReadSymbol(s->htree_command, br, &cmd_code)) {
+      return BROTLI_FALSE;
+    }
+  }
+  v = kCmdLut[cmd_code];
+  s->distance_code = v.distance_code;
+  s->distance_context = v.context;
+  s->dist_htree_index = s->dist_context_map_slice[s->distance_context];
+  *insert_length = v.insert_len_offset;
+  if (!safe) {
+    if (BROTLI_PREDICT_FALSE(v.insert_len_extra_bits != 0)) {
+      insert_len_extra = BrotliReadBits24(br, v.insert_len_extra_bits);
+    }
+    copy_length = BrotliReadBits24(br, v.copy_len_extra_bits);
+  } else {
+    if (!SafeReadBits(br, v.insert_len_extra_bits, &insert_len_extra) ||
+        !SafeReadBits(br, v.copy_len_extra_bits, &copy_length)) {
+      BrotliBitReaderRestoreState(br, &memento);
+      return BROTLI_FALSE;
+    }
+  }
+  s->copy_length = (int)copy_length + v.copy_len_offset;
+  --s->block_length[1];
+  *insert_length += (int)insert_len_extra;
+  return BROTLI_TRUE;
+}
+
+static BROTLI_INLINE void ReadCommand(
+    BrotliDecoderState* s, BrotliBitReader* br, int* insert_length) {
+  ReadCommandInternal(0, s, br, insert_length);
+}
+
+static BROTLI_INLINE BROTLI_BOOL SafeReadCommand(
+    BrotliDecoderState* s, BrotliBitReader* br, int* insert_length) {
+  return ReadCommandInternal(1, s, br, insert_length);
+}
+
+static BROTLI_INLINE BROTLI_BOOL CheckInputAmount(
+    int safe, BrotliBitReader* const br) {
+  if (safe) {
+    return BROTLI_TRUE;
+  }
+  return BrotliCheckInputAmount(br);
+}
+
+#define BROTLI_SAFE(METHOD)                       \
+  {                                               \
+    if (safe) {                                   \
+      if (!Safe##METHOD) {                        \
+        result = BROTLI_DECODER_NEEDS_MORE_INPUT; \
+        goto saveStateAndReturn;                  \
+      }                                           \
+    } else {                                      \
+      METHOD;                                     \
+    }                                             \
+  }
+
+static BROTLI_INLINE BrotliDecoderErrorCode ProcessCommandsInternal(
+    int safe, BrotliDecoderState* s) {
+  int pos = s->pos;
+  int i = s->loop_counter;
+  BrotliDecoderErrorCode result = BROTLI_DECODER_SUCCESS;
+  BrotliBitReader* br = &s->br;
+  int compound_dictionary_size = GetCompoundDictionarySize(s);
+
+  if (!CheckInputAmount(safe, br)) {
+    result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+    goto saveStateAndReturn;
+  }
+  if (!safe) {
+    BROTLI_UNUSED(BrotliWarmupBitReader(br));
+  }
+
+  /* Jump into state machine. */
+  if (s->state == BROTLI_STATE_COMMAND_BEGIN) {
+    goto CommandBegin;
+  } else if (s->state == BROTLI_STATE_COMMAND_INNER) {
+    goto CommandInner;
+  } else if (s->state == BROTLI_STATE_COMMAND_POST_DECODE_LITERALS) {
+    goto CommandPostDecodeLiterals;
+  } else if (s->state == BROTLI_STATE_COMMAND_POST_WRAP_COPY) {
+    goto CommandPostWrapCopy;
+  } else {
+    return BROTLI_FAILURE(BROTLI_DECODER_ERROR_UNREACHABLE);  /* COV_NF_LINE */
+  }
+
+CommandBegin:
+  if (safe) {
+    s->state = BROTLI_STATE_COMMAND_BEGIN;
+  }
+  if (!CheckInputAmount(safe, br)) {
+    s->state = BROTLI_STATE_COMMAND_BEGIN;
+    result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+    goto saveStateAndReturn;
+  }
+  if (BROTLI_PREDICT_FALSE(s->block_length[1] == 0)) {
+    BROTLI_SAFE(DecodeCommandBlockSwitch(s));
+    goto CommandBegin;
+  }
+  /* Read the insert/copy length in the command. */
+  BROTLI_SAFE(ReadCommand(s, br, &i));
+  BROTLI_LOG(("[ProcessCommandsInternal] pos = %d insert = %d copy = %d\n",
+              pos, i, s->copy_length));
+  if (i == 0) {
+    goto CommandPostDecodeLiterals;
+  }
+  s->meta_block_remaining_len -= i;
+
+CommandInner:
+  if (safe) {
+    s->state = BROTLI_STATE_COMMAND_INNER;
+  }
+  /* Read the literals in the command. */
+  if (s->trivial_literal_context) {
+    brotli_reg_t bits;
+    brotli_reg_t value;
+    PreloadSymbol(safe, s->literal_htree, br, &bits, &value);
+    do {
+      if (!CheckInputAmount(safe, br)) {
+        s->state = BROTLI_STATE_COMMAND_INNER;
+        result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+        goto saveStateAndReturn;
+      }
+      if (BROTLI_PREDICT_FALSE(s->block_length[0] == 0)) {
+        goto NextLiteralBlock;
+      }
+      if (!safe) {
+        s->ringbuffer[pos] =
+            (uint8_t)ReadPreloadedSymbol(s->literal_htree, br, &bits, &value);
+      } else {
+        brotli_reg_t literal;
+        if (!SafeReadSymbol(s->literal_htree, br, &literal)) {
+          result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+          goto saveStateAndReturn;
+        }
+        s->ringbuffer[pos] = (uint8_t)literal;
+      }
+      --s->block_length[0];
+      BROTLI_LOG_ARRAY_INDEX(s->ringbuffer, pos);
+      ++pos;
+      if (BROTLI_PREDICT_FALSE(pos == s->ringbuffer_size)) {
+        s->state = BROTLI_STATE_COMMAND_INNER_WRITE;
+        --i;
+        goto saveStateAndReturn;
+      }
+    } while (--i != 0);
+  } else {
+    uint8_t p1 = s->ringbuffer[(pos - 1) & s->ringbuffer_mask];
+    uint8_t p2 = s->ringbuffer[(pos - 2) & s->ringbuffer_mask];
+    do {
+      const HuffmanCode* hc;
+      uint8_t context;
+      if (!CheckInputAmount(safe, br)) {
+        s->state = BROTLI_STATE_COMMAND_INNER;
+        result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+        goto saveStateAndReturn;
+      }
+      if (BROTLI_PREDICT_FALSE(s->block_length[0] == 0)) {
+        goto NextLiteralBlock;
+      }
+      context = BROTLI_CONTEXT(p1, p2, s->context_lookup);
+      BROTLI_LOG_UINT(context);
+      hc = s->literal_hgroup.htrees[s->context_map_slice[context]];
+      p2 = p1;
+      if (!safe) {
+        p1 = (uint8_t)ReadSymbol(hc, br);
+      } else {
+        brotli_reg_t literal;
+        if (!SafeReadSymbol(hc, br, &literal)) {
+          result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+          goto saveStateAndReturn;
+        }
+        p1 = (uint8_t)literal;
+      }
+      s->ringbuffer[pos] = p1;
+      --s->block_length[0];
+      BROTLI_LOG_UINT(s->context_map_slice[context]);
+      BROTLI_LOG_ARRAY_INDEX(s->ringbuffer, pos & s->ringbuffer_mask);
+      ++pos;
+      if (BROTLI_PREDICT_FALSE(pos == s->ringbuffer_size)) {
+        s->state = BROTLI_STATE_COMMAND_INNER_WRITE;
+        --i;
+        goto saveStateAndReturn;
+      }
+    } while (--i != 0);
+  }
+  BROTLI_LOG_UINT(s->meta_block_remaining_len);
+  if (BROTLI_PREDICT_FALSE(s->meta_block_remaining_len <= 0)) {
+    s->state = BROTLI_STATE_METABLOCK_DONE;
+    goto saveStateAndReturn;
+  }
+
+CommandPostDecodeLiterals:
+  if (safe) {
+    s->state = BROTLI_STATE_COMMAND_POST_DECODE_LITERALS;
+  }
+  if (s->distance_code >= 0) {
+    /* Implicit distance case. */
+    s->distance_context = s->distance_code ? 0 : 1;
+    --s->dist_rb_idx;
+    s->distance_code = s->dist_rb[s->dist_rb_idx & 3];
+  } else {
+    /* Read distance code in the command, unless it was implicitly zero. */
+    if (BROTLI_PREDICT_FALSE(s->block_length[2] == 0)) {
+      BROTLI_SAFE(DecodeDistanceBlockSwitch(s));
+    }
+    BROTLI_SAFE(ReadDistance(s, br));
+  }
+  BROTLI_LOG(("[ProcessCommandsInternal] pos = %d distance = %d\n",
+              pos, s->distance_code));
+  if (s->max_distance != s->max_backward_distance) {
+    s->max_distance =
+        (pos < s->max_backward_distance) ? pos : s->max_backward_distance;
+  }
+  i = s->copy_length;
+  /* Apply copy of LZ77 back-reference, or static dictionary reference if
+     the distance is larger than the max LZ77 distance */
+  if (s->distance_code > s->max_distance) {
+    /* The maximum allowed distance is BROTLI_MAX_ALLOWED_DISTANCE = 0x7FFFFFFC.
+       With this choice, no signed overflow can occur after decoding
+       a special distance code (e.g., after adding 3 to the last distance). */
+    if (s->distance_code > BROTLI_MAX_ALLOWED_DISTANCE) {
+      BROTLI_LOG(("Invalid backward reference. pos: %d distance: %d "
+          "len: %d bytes left: %d\n",
+          pos, s->distance_code, i, s->meta_block_remaining_len));
+      return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_DISTANCE);
+    }
+    if (s->distance_code - s->max_distance - 1 < compound_dictionary_size) {
+      int address = compound_dictionary_size -
+          (s->distance_code - s->max_distance);
+      if (!InitializeCompoundDictionaryCopy(s, address, i)) {
+        return BROTLI_FAILURE(BROTLI_DECODER_ERROR_COMPOUND_DICTIONARY);
+      }
+      pos += CopyFromCompoundDictionary(s, pos);
+      if (pos >= s->ringbuffer_size) {
+        s->state = BROTLI_STATE_COMMAND_POST_WRITE_1;
+        goto saveStateAndReturn;
+      }
+    } else if (i >= SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH &&
+               i <= SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH) {
+      uint8_t p1 = s->ringbuffer[(pos - 1) & s->ringbuffer_mask];
+      uint8_t p2 = s->ringbuffer[(pos - 2) & s->ringbuffer_mask];
+      uint8_t dict_id = s->dictionary->context_based ?
+          s->dictionary->context_map[BROTLI_CONTEXT(p1, p2, s->context_lookup)]
+          : 0;
+      const BrotliDictionary* words = s->dictionary->words[dict_id];
+      const BrotliTransforms* transforms = s->dictionary->transforms[dict_id];
+      int offset = (int)words->offsets_by_length[i];
+      brotli_reg_t shift = words->size_bits_by_length[i];
+      int address =
+          s->distance_code - s->max_distance - 1 - compound_dictionary_size;
+      int mask = (int)BitMask(shift);
+      int word_idx = address & mask;
+      int transform_idx = address >> shift;
+      /* Compensate double distance-ring-buffer roll. */
+      s->dist_rb_idx += s->distance_context;
+      offset += word_idx * i;
+      /* If the distance is out of bound, select a next static dictionary if
+         there exist multiple. */
+      if ((transform_idx >= (int)transforms->num_transforms ||
+          words->size_bits_by_length[i] == 0) &&
+          s->dictionary->num_dictionaries > 1) {
+        uint8_t dict_id2;
+        int dist_remaining = address -
+            (int)(((1u << shift) & ~1u)) * (int)transforms->num_transforms;
+        for (dict_id2 = 0; dict_id2 < s->dictionary->num_dictionaries;
+            dict_id2++) {
+          const BrotliDictionary* words2 = s->dictionary->words[dict_id2];
+          if (dict_id2 != dict_id && words2->size_bits_by_length[i] != 0) {
+            const BrotliTransforms* transforms2 =
+                s->dictionary->transforms[dict_id2];
+            brotli_reg_t shift2 = words2->size_bits_by_length[i];
+            int num = (int)((1u << shift2) & ~1u) *
+                (int)transforms2->num_transforms;
+            if (dist_remaining < num) {
+              dict_id = dict_id2;
+              words = words2;
+              transforms = transforms2;
+              address = dist_remaining;
+              shift = shift2;
+              mask = (int)BitMask(shift);
+              word_idx = address & mask;
+              transform_idx = address >> shift;
+              offset = (int)words->offsets_by_length[i] + word_idx * i;
+              break;
+            }
+            dist_remaining -= num;
+          }
+        }
+      }
+      if (BROTLI_PREDICT_FALSE(words->size_bits_by_length[i] == 0)) {
+        BROTLI_LOG(("Invalid backward reference. pos: %d distance: %d "
+            "len: %d bytes left: %d\n",
+            pos, s->distance_code, i, s->meta_block_remaining_len));
+        return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_DICTIONARY);
+      }
+      if (BROTLI_PREDICT_FALSE(!words->data)) {
+        return BROTLI_FAILURE(BROTLI_DECODER_ERROR_DICTIONARY_NOT_SET);
+      }
+      if (transform_idx < (int)transforms->num_transforms) {
+        const uint8_t* word = &words->data[offset];
+        int len = i;
+        if (transform_idx == transforms->cutOffTransforms[0]) {
+          memcpy(&s->ringbuffer[pos], word, (size_t)len);
+          BROTLI_LOG(("[ProcessCommandsInternal] dictionary word: [%.*s]\n",
+                      len, word));
+        } else {
+          len = BrotliTransformDictionaryWord(&s->ringbuffer[pos], word, len,
+              transforms, transform_idx);
+          BROTLI_LOG(("[ProcessCommandsInternal] dictionary word: [%.*s],"
+                      " transform_idx = %d, transformed: [%.*s]\n",
+                      i, word, transform_idx, len, &s->ringbuffer[pos]));
+          if (len == 0 && s->distance_code <= 120) {
+            BROTLI_LOG(("Invalid length-0 dictionary word after transform\n"));
+            return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_TRANSFORM);
+          }
+        }
+        pos += len;
+        s->meta_block_remaining_len -= len;
+        if (pos >= s->ringbuffer_size) {
+          s->state = BROTLI_STATE_COMMAND_POST_WRITE_1;
+          goto saveStateAndReturn;
+        }
+      } else {
+        BROTLI_LOG(("Invalid backward reference. pos: %d distance: %d "
+            "len: %d bytes left: %d\n",
+            pos, s->distance_code, i, s->meta_block_remaining_len));
+        return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_TRANSFORM);
+      }
+    } else {
+      BROTLI_LOG(("Invalid backward reference. pos: %d distance: %d "
+          "len: %d bytes left: %d\n",
+          pos, s->distance_code, i, s->meta_block_remaining_len));
+      return BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_DICTIONARY);
+    }
+  } else {
+    int src_start = (pos - s->distance_code) & s->ringbuffer_mask;
+    uint8_t* copy_dst = &s->ringbuffer[pos];
+    uint8_t* copy_src = &s->ringbuffer[src_start];
+    int dst_end = pos + i;
+    int src_end = src_start + i;
+    /* Update the recent distances cache. */
+    s->dist_rb[s->dist_rb_idx & 3] = s->distance_code;
+    ++s->dist_rb_idx;
+    s->meta_block_remaining_len -= i;
+    /* There are 32+ bytes of slack in the ring-buffer allocation.
+       Also, we have 16 short codes, that make these 16 bytes irrelevant
+       in the ring-buffer. Let's copy over them as a first guess. */
+    memmove16(copy_dst, copy_src);
+    if (src_end > pos && dst_end > src_start) {
+      /* Regions intersect. */
+      goto CommandPostWrapCopy;
+    }
+    if (dst_end >= s->ringbuffer_size || src_end >= s->ringbuffer_size) {
+      /* At least one region wraps. */
+      goto CommandPostWrapCopy;
+    }
+    pos += i;
+    if (i > 16) {
+      if (i > 32) {
+        memcpy(copy_dst + 16, copy_src + 16, (size_t)(i - 16));
+      } else {
+        /* This branch covers about 45% cases.
+           Fixed size short copy allows more compiler optimizations. */
+        memmove16(copy_dst + 16, copy_src + 16);
+      }
+    }
+  }
+  BROTLI_LOG_UINT(s->meta_block_remaining_len);
+  if (s->meta_block_remaining_len <= 0) {
+    /* Next metablock, if any. */
+    s->state = BROTLI_STATE_METABLOCK_DONE;
+    goto saveStateAndReturn;
+  } else {
+    goto CommandBegin;
+  }
+CommandPostWrapCopy:
+  {
+    int wrap_guard = s->ringbuffer_size - pos;
+    while (--i >= 0) {
+      s->ringbuffer[pos] =
+          s->ringbuffer[(pos - s->distance_code) & s->ringbuffer_mask];
+      ++pos;
+      if (BROTLI_PREDICT_FALSE(--wrap_guard == 0)) {
+        s->state = BROTLI_STATE_COMMAND_POST_WRITE_2;
+        goto saveStateAndReturn;
+      }
+    }
+  }
+  if (s->meta_block_remaining_len <= 0) {
+    /* Next metablock, if any. */
+    s->state = BROTLI_STATE_METABLOCK_DONE;
+    goto saveStateAndReturn;
+  } else {
+    goto CommandBegin;
+  }
+
+NextLiteralBlock:
+  BROTLI_SAFE(DecodeLiteralBlockSwitch(s));
+  goto CommandInner;
+
+saveStateAndReturn:
+  s->pos = pos;
+  s->loop_counter = i;
+  return result;
+}
+
+#undef BROTLI_SAFE
+
+static BROTLI_NOINLINE BrotliDecoderErrorCode ProcessCommands(
+    BrotliDecoderState* s) {
+  return ProcessCommandsInternal(0, s);
+}
+
+static BROTLI_NOINLINE BrotliDecoderErrorCode SafeProcessCommands(
+    BrotliDecoderState* s) {
+  return ProcessCommandsInternal(1, s);
+}
+
+BrotliDecoderResult BrotliDecoderDecompress(
+    size_t encoded_size,
+    const uint8_t encoded_buffer[BROTLI_ARRAY_PARAM(encoded_size)],
+    size_t* decoded_size,
+    uint8_t decoded_buffer[BROTLI_ARRAY_PARAM(*decoded_size)]) {
+  BrotliDecoderState s;
+  BrotliDecoderResult result;
+  size_t total_out = 0;
+  size_t available_in = encoded_size;
+  const uint8_t* next_in = encoded_buffer;
+  size_t available_out = *decoded_size;
+  uint8_t* next_out = decoded_buffer;
+  if (!BrotliDecoderStateInit(&s, 0, 0, 0)) {
+    return BROTLI_DECODER_RESULT_ERROR;
+  }
+  result = BrotliDecoderDecompressStream(
+      &s, &available_in, &next_in, &available_out, &next_out, &total_out);
+  *decoded_size = total_out;
+  BrotliDecoderStateCleanup(&s);
+  if (result != BROTLI_DECODER_RESULT_SUCCESS) {
+    result = BROTLI_DECODER_RESULT_ERROR;
+  }
+  return result;
+}
+
+/* Invariant: input stream is never overconsumed:
+    - invalid input implies that the whole stream is invalid -> any amount of
+      input could be read and discarded
+    - when result is "needs more input", then at least one more byte is REQUIRED
+      to complete decoding; all input data MUST be consumed by decoder, so
+      client could swap the input buffer
+    - when result is "needs more output" decoder MUST ensure that it doesn't
+      hold more than 7 bits in bit reader; this saves client from swapping input
+      buffer ahead of time
+    - when result is "success" decoder MUST return all unused data back to input
+      buffer; this is possible because the invariant is held on enter */
+BrotliDecoderResult BrotliDecoderDecompressStream(
+    BrotliDecoderState* s, size_t* available_in, const uint8_t** next_in,
+    size_t* available_out, uint8_t** next_out, size_t* total_out) {
+  BrotliDecoderErrorCode result = BROTLI_DECODER_SUCCESS;
+  BrotliBitReader* br = &s->br;
+  size_t input_size = *available_in;
+#define BROTLI_SAVE_ERROR_CODE(code) \
+    SaveErrorCode(s, (code), input_size - *available_in)
+  /* Ensure that |total_out| is set, even if no data will ever be pushed out. */
+  if (total_out) {
+    *total_out = s->partial_pos_out;
+  }
+  /* Do not try to process further in a case of unrecoverable error. */
+  if ((int)s->error_code < 0) {
+    return BROTLI_DECODER_RESULT_ERROR;
+  }
+  if (*available_out && (!next_out || !*next_out)) {
+    return BROTLI_SAVE_ERROR_CODE(
+        BROTLI_FAILURE(BROTLI_DECODER_ERROR_INVALID_ARGUMENTS));
+  }
+  if (!*available_out) next_out = 0;
+  if (s->buffer_length == 0) {  /* Just connect bit reader to input stream. */
+    BrotliBitReaderSetInput(br, *next_in, *available_in);
+  } else {
+    /* At least one byte of input is required. More than one byte of input may
+       be required to complete the transaction -> reading more data must be
+       done in a loop -> do it in a main loop. */
+    result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+    BrotliBitReaderSetInput(br, &s->buffer.u8[0], s->buffer_length);
+  }
+  /* State machine */
+  for (;;) {
+    if (result != BROTLI_DECODER_SUCCESS) {
+      /* Error, needs more input/output. */
+      if (result == BROTLI_DECODER_NEEDS_MORE_INPUT) {
+        if (s->ringbuffer != 0) {  /* Pro-actively push output. */
+          BrotliDecoderErrorCode intermediate_result = WriteRingBuffer(s,
+              available_out, next_out, total_out, BROTLI_TRUE);
+          /* WriteRingBuffer checks s->meta_block_remaining_len validity. */
+          if ((int)intermediate_result < 0) {
+            result = intermediate_result;
+            break;
+          }
+        }
+        if (s->buffer_length != 0) {  /* Used with internal buffer. */
+          if (br->next_in == br->last_in) {
+            /* Successfully finished read transaction.
+               Accumulator contains less than 8 bits, because internal buffer
+               is expanded byte-by-byte until it is enough to complete read. */
+            s->buffer_length = 0;
+            /* Switch to input stream and restart. */
+            result = BROTLI_DECODER_SUCCESS;
+            BrotliBitReaderSetInput(br, *next_in, *available_in);
+            continue;
+          } else if (*available_in != 0) {
+            /* Not enough data in buffer, but can take one more byte from
+               input stream. */
+            result = BROTLI_DECODER_SUCCESS;
+            BROTLI_DCHECK(s->buffer_length < 8);
+            s->buffer.u8[s->buffer_length] = **next_in;
+            s->buffer_length++;
+            BrotliBitReaderSetInput(br, &s->buffer.u8[0], s->buffer_length);
+            (*next_in)++;
+            (*available_in)--;
+            /* Retry with more data in buffer. */
+            continue;
+          }
+          /* Can't finish reading and no more input. */
+          break;
+        } else {  /* Input stream doesn't contain enough input. */
+          /* Copy tail to internal buffer and return. */
+          *next_in = br->next_in;
+          *available_in = BrotliBitReaderGetAvailIn(br);
+          while (*available_in) {
+            s->buffer.u8[s->buffer_length] = **next_in;
+            s->buffer_length++;
+            (*next_in)++;
+            (*available_in)--;
+          }
+          break;
+        }
+        /* Unreachable. */
+      }
+
+      /* Fail or needs more output. */
+
+      if (s->buffer_length != 0) {
+        /* Just consumed the buffered input and produced some output. Otherwise
+           it would result in "needs more input". Reset internal buffer. */
+        s->buffer_length = 0;
+      } else {
+        /* Using input stream in last iteration. When decoder switches to input
+           stream it has less than 8 bits in accumulator, so it is safe to
+           return unused accumulator bits there. */
+        BrotliBitReaderUnload(br);
+        *available_in = BrotliBitReaderGetAvailIn(br);
+        *next_in = br->next_in;
+      }
+      break;
+    }
+    switch (s->state) {
+      case BROTLI_STATE_UNINITED:
+        /* Prepare to the first read. */
+        if (!BrotliWarmupBitReader(br)) {
+          result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+          break;
+        }
+        /* Decode window size. */
+        result = DecodeWindowBits(s, br);  /* Reads 1..8 bits. */
+        if (result != BROTLI_DECODER_SUCCESS) {
+          break;
+        }
+        if (s->large_window) {
+          s->state = BROTLI_STATE_LARGE_WINDOW_BITS;
+          break;
+        }
+        s->state = BROTLI_STATE_INITIALIZE;
+        break;
+
+      case BROTLI_STATE_LARGE_WINDOW_BITS: {
+        brotli_reg_t bits;
+        if (!BrotliSafeReadBits(br, 6, &bits)) {
+          result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+          break;
+        }
+        s->window_bits = bits & 63u;
+        if (s->window_bits < BROTLI_LARGE_MIN_WBITS ||
+            s->window_bits > BROTLI_LARGE_MAX_WBITS) {
+          result = BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_WINDOW_BITS);
+          break;
+        }
+        s->state = BROTLI_STATE_INITIALIZE;
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_INITIALIZE:
+        BROTLI_LOG_UINT(s->window_bits);
+        /* Maximum distance, see section 9.1. of the spec. */
+        s->max_backward_distance = (1 << s->window_bits) - BROTLI_WINDOW_GAP;
+
+        /* Allocate memory for both block_type_trees and block_len_trees. */
+        s->block_type_trees = (HuffmanCode*)BROTLI_DECODER_ALLOC(s,
+            sizeof(HuffmanCode) * 3 *
+                (BROTLI_HUFFMAN_MAX_SIZE_258 + BROTLI_HUFFMAN_MAX_SIZE_26));
+        if (s->block_type_trees == 0) {
+          result = BROTLI_FAILURE(BROTLI_DECODER_ERROR_ALLOC_BLOCK_TYPE_TREES);
+          break;
+        }
+        s->block_len_trees =
+            s->block_type_trees + 3 * BROTLI_HUFFMAN_MAX_SIZE_258;
+
+        s->state = BROTLI_STATE_METABLOCK_BEGIN;
+      /* Fall through. */
+
+      case BROTLI_STATE_METABLOCK_BEGIN:
+        BrotliDecoderStateMetablockBegin(s);
+        BROTLI_LOG_UINT(s->pos);
+        s->state = BROTLI_STATE_METABLOCK_HEADER;
+      /* Fall through. */
+
+      case BROTLI_STATE_METABLOCK_HEADER:
+        result = DecodeMetaBlockLength(s, br);  /* Reads 2 - 31 bits. */
+        if (result != BROTLI_DECODER_SUCCESS) {
+          break;
+        }
+        BROTLI_LOG_UINT(s->is_last_metablock);
+        BROTLI_LOG_UINT(s->meta_block_remaining_len);
+        BROTLI_LOG_UINT(s->is_metadata);
+        BROTLI_LOG_UINT(s->is_uncompressed);
+        if (s->is_metadata || s->is_uncompressed) {
+          if (!BrotliJumpToByteBoundary(br)) {
+            result = BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_PADDING_1);
+            break;
+          }
+        }
+        if (s->is_metadata) {
+          s->state = BROTLI_STATE_METADATA;
+          if (s->metadata_start_func) {
+            s->metadata_start_func(s->metadata_callback_opaque,
+                                   (size_t)s->meta_block_remaining_len);
+          }
+          break;
+        }
+        if (s->meta_block_remaining_len == 0) {
+          s->state = BROTLI_STATE_METABLOCK_DONE;
+          break;
+        }
+        BrotliCalculateRingBufferSize(s);
+        if (s->is_uncompressed) {
+          s->state = BROTLI_STATE_UNCOMPRESSED;
+          break;
+        }
+        s->state = BROTLI_STATE_BEFORE_COMPRESSED_METABLOCK_HEADER;
+      /* Fall through. */
+
+      case BROTLI_STATE_BEFORE_COMPRESSED_METABLOCK_HEADER: {
+        BrotliMetablockHeaderArena* h = &s->arena.header;
+        s->loop_counter = 0;
+        /* Initialize compressed metablock header arena. */
+        h->sub_loop_counter = 0;
+        /* Make small negative indexes addressable. */
+        h->symbol_lists =
+            &h->symbols_lists_array[BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1];
+        h->substate_huffman = BROTLI_STATE_HUFFMAN_NONE;
+        h->substate_tree_group = BROTLI_STATE_TREE_GROUP_NONE;
+        h->substate_context_map = BROTLI_STATE_CONTEXT_MAP_NONE;
+        s->state = BROTLI_STATE_HUFFMAN_CODE_0;
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_HUFFMAN_CODE_0:
+        if (s->loop_counter >= 3) {
+          s->state = BROTLI_STATE_METABLOCK_HEADER_2;
+          break;
+        }
+        /* Reads 1..11 bits. */
+        result = DecodeVarLenUint8(s, br, &s->num_block_types[s->loop_counter]);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          break;
+        }
+        s->num_block_types[s->loop_counter]++;
+        BROTLI_LOG_UINT(s->num_block_types[s->loop_counter]);
+        if (s->num_block_types[s->loop_counter] < 2) {
+          s->loop_counter++;
+          break;
+        }
+        s->state = BROTLI_STATE_HUFFMAN_CODE_1;
+      /* Fall through. */
+
+      case BROTLI_STATE_HUFFMAN_CODE_1: {
+        brotli_reg_t alphabet_size = s->num_block_types[s->loop_counter] + 2;
+        int tree_offset = s->loop_counter * BROTLI_HUFFMAN_MAX_SIZE_258;
+        result = ReadHuffmanCode(alphabet_size, alphabet_size,
+            &s->block_type_trees[tree_offset], NULL, s);
+        if (result != BROTLI_DECODER_SUCCESS) break;
+        s->state = BROTLI_STATE_HUFFMAN_CODE_2;
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_HUFFMAN_CODE_2: {
+        brotli_reg_t alphabet_size = BROTLI_NUM_BLOCK_LEN_SYMBOLS;
+        int tree_offset = s->loop_counter * BROTLI_HUFFMAN_MAX_SIZE_26;
+        result = ReadHuffmanCode(alphabet_size, alphabet_size,
+            &s->block_len_trees[tree_offset], NULL, s);
+        if (result != BROTLI_DECODER_SUCCESS) break;
+        s->state = BROTLI_STATE_HUFFMAN_CODE_3;
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_HUFFMAN_CODE_3: {
+        int tree_offset = s->loop_counter * BROTLI_HUFFMAN_MAX_SIZE_26;
+        if (!SafeReadBlockLength(s, &s->block_length[s->loop_counter],
+            &s->block_len_trees[tree_offset], br)) {
+          result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+          break;
+        }
+        BROTLI_LOG_UINT(s->block_length[s->loop_counter]);
+        s->loop_counter++;
+        s->state = BROTLI_STATE_HUFFMAN_CODE_0;
+        break;
+      }
+
+      case BROTLI_STATE_UNCOMPRESSED: {
+        result = CopyUncompressedBlockToOutput(
+            available_out, next_out, total_out, s);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          break;
+        }
+        s->state = BROTLI_STATE_METABLOCK_DONE;
+        break;
+      }
+
+      case BROTLI_STATE_METADATA:
+        result = SkipMetadataBlock(s);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          break;
+        }
+        s->state = BROTLI_STATE_METABLOCK_DONE;
+        break;
+
+      case BROTLI_STATE_METABLOCK_HEADER_2: {
+        brotli_reg_t bits;
+        if (!BrotliSafeReadBits(br, 6, &bits)) {
+          result = BROTLI_DECODER_NEEDS_MORE_INPUT;
+          break;
+        }
+        s->distance_postfix_bits = bits & BitMask(2);
+        bits >>= 2;
+        s->num_direct_distance_codes = bits << s->distance_postfix_bits;
+        BROTLI_LOG_UINT(s->num_direct_distance_codes);
+        BROTLI_LOG_UINT(s->distance_postfix_bits);
+        s->context_modes =
+            (uint8_t*)BROTLI_DECODER_ALLOC(s, (size_t)s->num_block_types[0]);
+        if (s->context_modes == 0) {
+          result = BROTLI_FAILURE(BROTLI_DECODER_ERROR_ALLOC_CONTEXT_MODES);
+          break;
+        }
+        s->loop_counter = 0;
+        s->state = BROTLI_STATE_CONTEXT_MODES;
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_CONTEXT_MODES:
+        result = ReadContextModes(s);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          break;
+        }
+        s->state = BROTLI_STATE_CONTEXT_MAP_1;
+      /* Fall through. */
+
+      case BROTLI_STATE_CONTEXT_MAP_1:
+        result = DecodeContextMap(
+            s->num_block_types[0] << BROTLI_LITERAL_CONTEXT_BITS,
+            &s->num_literal_htrees, &s->context_map, s);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          break;
+        }
+        DetectTrivialLiteralBlockTypes(s);
+        s->state = BROTLI_STATE_CONTEXT_MAP_2;
+      /* Fall through. */
+
+      case BROTLI_STATE_CONTEXT_MAP_2: {
+        brotli_reg_t npostfix = s->distance_postfix_bits;
+        brotli_reg_t ndirect = s->num_direct_distance_codes;
+        brotli_reg_t distance_alphabet_size_max = BROTLI_DISTANCE_ALPHABET_SIZE(
+            npostfix, ndirect, BROTLI_MAX_DISTANCE_BITS);
+        brotli_reg_t distance_alphabet_size_limit = distance_alphabet_size_max;
+        BROTLI_BOOL allocation_success = BROTLI_TRUE;
+        if (s->large_window) {
+          BrotliDistanceCodeLimit limit = BrotliCalculateDistanceCodeLimit(
+              BROTLI_MAX_ALLOWED_DISTANCE, (uint32_t)npostfix,
+              (uint32_t)ndirect);
+          distance_alphabet_size_max = BROTLI_DISTANCE_ALPHABET_SIZE(
+              npostfix, ndirect, BROTLI_LARGE_MAX_DISTANCE_BITS);
+          distance_alphabet_size_limit = limit.max_alphabet_size;
+        }
+        result = DecodeContextMap(
+            s->num_block_types[2] << BROTLI_DISTANCE_CONTEXT_BITS,
+            &s->num_dist_htrees, &s->dist_context_map, s);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          break;
+        }
+        allocation_success &= BrotliDecoderHuffmanTreeGroupInit(
+            s, &s->literal_hgroup, BROTLI_NUM_LITERAL_SYMBOLS,
+            BROTLI_NUM_LITERAL_SYMBOLS, s->num_literal_htrees);
+        allocation_success &= BrotliDecoderHuffmanTreeGroupInit(
+            s, &s->insert_copy_hgroup, BROTLI_NUM_COMMAND_SYMBOLS,
+            BROTLI_NUM_COMMAND_SYMBOLS, s->num_block_types[1]);
+        allocation_success &= BrotliDecoderHuffmanTreeGroupInit(
+            s, &s->distance_hgroup, distance_alphabet_size_max,
+            distance_alphabet_size_limit, s->num_dist_htrees);
+        if (!allocation_success) {
+          return BROTLI_SAVE_ERROR_CODE(
+              BROTLI_FAILURE(BROTLI_DECODER_ERROR_ALLOC_TREE_GROUPS));
+        }
+        s->loop_counter = 0;
+        s->state = BROTLI_STATE_TREE_GROUP;
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_TREE_GROUP: {
+        HuffmanTreeGroup* hgroup = NULL;
+        switch (s->loop_counter) {
+          case 0: hgroup = &s->literal_hgroup; break;
+          case 1: hgroup = &s->insert_copy_hgroup; break;
+          case 2: hgroup = &s->distance_hgroup; break;
+          default: return BROTLI_SAVE_ERROR_CODE(BROTLI_FAILURE(
+              BROTLI_DECODER_ERROR_UNREACHABLE));  /* COV_NF_LINE */
+        }
+        result = HuffmanTreeGroupDecode(hgroup, s);
+        if (result != BROTLI_DECODER_SUCCESS) break;
+        s->loop_counter++;
+        if (s->loop_counter < 3) {
+          break;
+        }
+        s->state = BROTLI_STATE_BEFORE_COMPRESSED_METABLOCK_BODY;
+      }
+      /* Fall through. */
+
+      case BROTLI_STATE_BEFORE_COMPRESSED_METABLOCK_BODY:
+        PrepareLiteralDecoding(s);
+        s->dist_context_map_slice = s->dist_context_map;
+        s->htree_command = s->insert_copy_hgroup.htrees[0];
+        if (!BrotliEnsureRingBuffer(s)) {
+          result = BROTLI_FAILURE(BROTLI_DECODER_ERROR_ALLOC_RING_BUFFER_2);
+          break;
+        }
+        CalculateDistanceLut(s);
+        s->state = BROTLI_STATE_COMMAND_BEGIN;
+      /* Fall through. */
+
+      case BROTLI_STATE_COMMAND_BEGIN:
+      /* Fall through. */
+      case BROTLI_STATE_COMMAND_INNER:
+      /* Fall through. */
+      case BROTLI_STATE_COMMAND_POST_DECODE_LITERALS:
+      /* Fall through. */
+      case BROTLI_STATE_COMMAND_POST_WRAP_COPY:
+        result = ProcessCommands(s);
+        if (result == BROTLI_DECODER_NEEDS_MORE_INPUT) {
+          result = SafeProcessCommands(s);
+        }
+        break;
+
+      case BROTLI_STATE_COMMAND_INNER_WRITE:
+      /* Fall through. */
+      case BROTLI_STATE_COMMAND_POST_WRITE_1:
+      /* Fall through. */
+      case BROTLI_STATE_COMMAND_POST_WRITE_2:
+        result = WriteRingBuffer(
+            s, available_out, next_out, total_out, BROTLI_FALSE);
+        if (result != BROTLI_DECODER_SUCCESS) {
+          break;
+        }
+        WrapRingBuffer(s);
+        if (s->ringbuffer_size == 1 << s->window_bits) {
+          s->max_distance = s->max_backward_distance;
+        }
+        if (s->state == BROTLI_STATE_COMMAND_POST_WRITE_1) {
+          BrotliDecoderCompoundDictionary* addon = s->compound_dictionary;
+          if (addon && (addon->br_length != addon->br_copied)) {
+            s->pos += CopyFromCompoundDictionary(s, s->pos);
+            if (s->pos >= s->ringbuffer_size) continue;
+          }
+          if (s->meta_block_remaining_len == 0) {
+            /* Next metablock, if any. */
+            s->state = BROTLI_STATE_METABLOCK_DONE;
+          } else {
+            s->state = BROTLI_STATE_COMMAND_BEGIN;
+          }
+          break;
+        } else if (s->state == BROTLI_STATE_COMMAND_POST_WRITE_2) {
+          s->state = BROTLI_STATE_COMMAND_POST_WRAP_COPY;
+        } else {  /* BROTLI_STATE_COMMAND_INNER_WRITE */
+          if (s->loop_counter == 0) {
+            if (s->meta_block_remaining_len == 0) {
+              s->state = BROTLI_STATE_METABLOCK_DONE;
+            } else {
+              s->state = BROTLI_STATE_COMMAND_POST_DECODE_LITERALS;
+            }
+            break;
+          }
+          s->state = BROTLI_STATE_COMMAND_INNER;
+        }
+        break;
+
+      case BROTLI_STATE_METABLOCK_DONE:
+        if (s->meta_block_remaining_len < 0) {
+          result = BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_BLOCK_LENGTH_2);
+          break;
+        }
+        BrotliDecoderStateCleanupAfterMetablock(s);
+        if (!s->is_last_metablock) {
+          s->state = BROTLI_STATE_METABLOCK_BEGIN;
+          break;
+        }
+        if (!BrotliJumpToByteBoundary(br)) {
+          result = BROTLI_FAILURE(BROTLI_DECODER_ERROR_FORMAT_PADDING_2);
+          break;
+        }
+        if (s->buffer_length == 0) {
+          BrotliBitReaderUnload(br);
+          *available_in = BrotliBitReaderGetAvailIn(br);
+          *next_in = br->next_in;
+        }
+        s->state = BROTLI_STATE_DONE;
+      /* Fall through. */
+
+      case BROTLI_STATE_DONE:
+        if (s->ringbuffer != 0) {
+          result = WriteRingBuffer(
+              s, available_out, next_out, total_out, BROTLI_TRUE);
+          if (result != BROTLI_DECODER_SUCCESS) {
+            break;
+          }
+        }
+        return BROTLI_SAVE_ERROR_CODE(result);
+    }
+  }
+  return BROTLI_SAVE_ERROR_CODE(result);
+#undef BROTLI_SAVE_ERROR_CODE
+}
+
+BROTLI_BOOL BrotliDecoderHasMoreOutput(const BrotliDecoderState* s) {
+  /* After unrecoverable error remaining output is considered nonsensical. */
+  if ((int)s->error_code < 0) {
+    return BROTLI_FALSE;
+  }
+  return TO_BROTLI_BOOL(
+      s->ringbuffer != 0 && UnwrittenBytes(s, BROTLI_FALSE) != 0);
+}
+
+const uint8_t* BrotliDecoderTakeOutput(BrotliDecoderState* s, size_t* size) {
+  uint8_t* result = 0;
+  size_t available_out = *size ? *size : 1u << 24;
+  size_t requested_out = available_out;
+  BrotliDecoderErrorCode status;
+  if ((s->ringbuffer == 0) || ((int)s->error_code < 0)) {
+    *size = 0;
+    return 0;
+  }
+  WrapRingBuffer(s);
+  status = WriteRingBuffer(s, &available_out, &result, 0, BROTLI_TRUE);
+  /* Either WriteRingBuffer returns those "success" codes... */
+  if (status == BROTLI_DECODER_SUCCESS ||
+      status == BROTLI_DECODER_NEEDS_MORE_OUTPUT) {
+    *size = requested_out - available_out;
+  } else {
+    /* ... or stream is broken. Normally this should be caught by
+       BrotliDecoderDecompressStream, this is just a safeguard. */
+    if ((int)status < 0) SaveErrorCode(s, status, 0);
+    *size = 0;
+    result = 0;
+  }
+  return result;
+}
+
+BROTLI_BOOL BrotliDecoderIsUsed(const BrotliDecoderState* s) {
+  return TO_BROTLI_BOOL(s->state != BROTLI_STATE_UNINITED ||
+      BrotliGetAvailableBits(&s->br) != 0);
+}
+
+BROTLI_BOOL BrotliDecoderIsFinished(const BrotliDecoderState* s) {
+  return TO_BROTLI_BOOL(s->state == BROTLI_STATE_DONE) &&
+      !BrotliDecoderHasMoreOutput(s);
+}
+
+BrotliDecoderErrorCode BrotliDecoderGetErrorCode(const BrotliDecoderState* s) {
+  return (BrotliDecoderErrorCode)s->error_code;
+}
+
+const char* BrotliDecoderErrorString(BrotliDecoderErrorCode c) {
+  switch (c) {
+#define BROTLI_ERROR_CODE_CASE_(PREFIX, NAME, CODE) \
+    case BROTLI_DECODER ## PREFIX ## NAME: return #PREFIX #NAME;
+#define BROTLI_NOTHING_
+    BROTLI_DECODER_ERROR_CODES_LIST(BROTLI_ERROR_CODE_CASE_, BROTLI_NOTHING_)
+#undef BROTLI_ERROR_CODE_CASE_
+#undef BROTLI_NOTHING_
+    default: return "INVALID";
+  }
+}
+
+uint32_t BrotliDecoderVersion(void) {
+  return BROTLI_VERSION;
+}
+
+void BrotliDecoderSetMetadataCallbacks(
+    BrotliDecoderState* state,
+    brotli_decoder_metadata_start_func start_func,
+    brotli_decoder_metadata_chunk_func chunk_func, void* opaque) {
+  state->metadata_start_func = start_func;
+  state->metadata_chunk_func = chunk_func;
+  state->metadata_callback_opaque = opaque;
+}
+
+/* Escalate internal functions visibility; for testing purposes only. */
+#if defined(BROTLI_TEST)
+BROTLI_BOOL SafeReadSymbolForTest(
+    const HuffmanCode*, BrotliBitReader*, brotli_reg_t*);
+BROTLI_BOOL SafeReadSymbolForTest(
+    const HuffmanCode* table, BrotliBitReader* br, brotli_reg_t* result) {
+  return SafeReadSymbol(table, br, result);
+}
+
+void InverseMoveToFrontTransformForTest(
+    uint8_t*, brotli_reg_t, BrotliDecoderState*);
+void InverseMoveToFrontTransformForTest(
+    uint8_t* v, brotli_reg_t l, BrotliDecoderState* s) {
+  InverseMoveToFrontTransform(v, l, s);
+}
+#endif
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/huffman.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/huffman.c
new file mode 100644
index 0000000000..3806454864
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/huffman.c
@@ -0,0 +1,342 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Utilities for building Huffman decoding tables. */
+
+#include "huffman.h"
+
+#include <string.h>  /* memcpy, memset */
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define BROTLI_REVERSE_BITS_MAX 8
+
+#if defined(BROTLI_RBIT)
+#define BROTLI_REVERSE_BITS_BASE \
+  ((sizeof(brotli_reg_t) << 3) - BROTLI_REVERSE_BITS_MAX)
+#else
+#define BROTLI_REVERSE_BITS_BASE 0
+static uint8_t kReverseBits[1 << BROTLI_REVERSE_BITS_MAX] = {
+  0x00, 0x80, 0x40, 0xC0, 0x20, 0xA0, 0x60, 0xE0,
+  0x10, 0x90, 0x50, 0xD0, 0x30, 0xB0, 0x70, 0xF0,
+  0x08, 0x88, 0x48, 0xC8, 0x28, 0xA8, 0x68, 0xE8,
+  0x18, 0x98, 0x58, 0xD8, 0x38, 0xB8, 0x78, 0xF8,
+  0x04, 0x84, 0x44, 0xC4, 0x24, 0xA4, 0x64, 0xE4,
+  0x14, 0x94, 0x54, 0xD4, 0x34, 0xB4, 0x74, 0xF4,
+  0x0C, 0x8C, 0x4C, 0xCC, 0x2C, 0xAC, 0x6C, 0xEC,
+  0x1C, 0x9C, 0x5C, 0xDC, 0x3C, 0xBC, 0x7C, 0xFC,
+  0x02, 0x82, 0x42, 0xC2, 0x22, 0xA2, 0x62, 0xE2,
+  0x12, 0x92, 0x52, 0xD2, 0x32, 0xB2, 0x72, 0xF2,
+  0x0A, 0x8A, 0x4A, 0xCA, 0x2A, 0xAA, 0x6A, 0xEA,
+  0x1A, 0x9A, 0x5A, 0xDA, 0x3A, 0xBA, 0x7A, 0xFA,
+  0x06, 0x86, 0x46, 0xC6, 0x26, 0xA6, 0x66, 0xE6,
+  0x16, 0x96, 0x56, 0xD6, 0x36, 0xB6, 0x76, 0xF6,
+  0x0E, 0x8E, 0x4E, 0xCE, 0x2E, 0xAE, 0x6E, 0xEE,
+  0x1E, 0x9E, 0x5E, 0xDE, 0x3E, 0xBE, 0x7E, 0xFE,
+  0x01, 0x81, 0x41, 0xC1, 0x21, 0xA1, 0x61, 0xE1,
+  0x11, 0x91, 0x51, 0xD1, 0x31, 0xB1, 0x71, 0xF1,
+  0x09, 0x89, 0x49, 0xC9, 0x29, 0xA9, 0x69, 0xE9,
+  0x19, 0x99, 0x59, 0xD9, 0x39, 0xB9, 0x79, 0xF9,
+  0x05, 0x85, 0x45, 0xC5, 0x25, 0xA5, 0x65, 0xE5,
+  0x15, 0x95, 0x55, 0xD5, 0x35, 0xB5, 0x75, 0xF5,
+  0x0D, 0x8D, 0x4D, 0xCD, 0x2D, 0xAD, 0x6D, 0xED,
+  0x1D, 0x9D, 0x5D, 0xDD, 0x3D, 0xBD, 0x7D, 0xFD,
+  0x03, 0x83, 0x43, 0xC3, 0x23, 0xA3, 0x63, 0xE3,
+  0x13, 0x93, 0x53, 0xD3, 0x33, 0xB3, 0x73, 0xF3,
+  0x0B, 0x8B, 0x4B, 0xCB, 0x2B, 0xAB, 0x6B, 0xEB,
+  0x1B, 0x9B, 0x5B, 0xDB, 0x3B, 0xBB, 0x7B, 0xFB,
+  0x07, 0x87, 0x47, 0xC7, 0x27, 0xA7, 0x67, 0xE7,
+  0x17, 0x97, 0x57, 0xD7, 0x37, 0xB7, 0x77, 0xF7,
+  0x0F, 0x8F, 0x4F, 0xCF, 0x2F, 0xAF, 0x6F, 0xEF,
+  0x1F, 0x9F, 0x5F, 0xDF, 0x3F, 0xBF, 0x7F, 0xFF
+};
+#endif  /* BROTLI_RBIT */
+
+#define BROTLI_REVERSE_BITS_LOWEST \
+  ((brotli_reg_t)1 << (BROTLI_REVERSE_BITS_MAX - 1 + BROTLI_REVERSE_BITS_BASE))
+
+/* Returns reverse(num >> BROTLI_REVERSE_BITS_BASE, BROTLI_REVERSE_BITS_MAX),
+   where reverse(value, len) is the bit-wise reversal of the len least
+   significant bits of value. */
+static BROTLI_INLINE brotli_reg_t BrotliReverseBits(brotli_reg_t num) {
+#if defined(BROTLI_RBIT)
+  return BROTLI_RBIT(num);
+#else
+  return kReverseBits[num];
+#endif
+}
+
+/* Stores code in table[0], table[step], table[2*step], ..., table[end] */
+/* Assumes that end is an integer multiple of step */
+static BROTLI_INLINE void ReplicateValue(HuffmanCode* table,
+                                         int step, int end,
+                                         HuffmanCode code) {
+  do {
+    end -= step;
+    table[end] = code;
+  } while (end > 0);
+}
+
+/* Returns the table width of the next 2nd level table. |count| is the histogram
+   of bit lengths for the remaining symbols, |len| is the code length of the
+   next processed symbol. */
+static BROTLI_INLINE int NextTableBitSize(const uint16_t* const count,
+                                          int len, int root_bits) {
+  int left = 1 << (len - root_bits);
+  while (len < BROTLI_HUFFMAN_MAX_CODE_LENGTH) {
+    left -= count[len];
+    if (left <= 0) break;
+    ++len;
+    left <<= 1;
+  }
+  return len - root_bits;
+}
+
+void BrotliBuildCodeLengthsHuffmanTable(HuffmanCode* table,
+                                        const uint8_t* const code_lengths,
+                                        uint16_t* count) {
+  HuffmanCode code;       /* current table entry */
+  int symbol;             /* symbol index in original or sorted table */
+  brotli_reg_t key;       /* prefix code */
+  brotli_reg_t key_step;  /* prefix code addend */
+  int step;               /* step size to replicate values in current table */
+  int table_size;         /* size of current table */
+  int sorted[BROTLI_CODE_LENGTH_CODES];  /* symbols sorted by code length */
+  /* offsets in sorted table for each length */
+  int offset[BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH + 1];
+  int bits;
+  int bits_count;
+  BROTLI_DCHECK(BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH <=
+                BROTLI_REVERSE_BITS_MAX);
+  BROTLI_DCHECK(BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH == 5);
+
+  /* Generate offsets into sorted symbol table by code length. */
+  symbol = -1;
+  bits = 1;
+  /* BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH == 5 */
+  BROTLI_REPEAT_5({
+    symbol += count[bits];
+    offset[bits] = symbol;
+    bits++;
+  });
+  /* Symbols with code length 0 are placed after all other symbols. */
+  offset[0] = BROTLI_CODE_LENGTH_CODES - 1;
+
+  /* Sort symbols by length, by symbol order within each length. */
+  symbol = BROTLI_CODE_LENGTH_CODES;
+  do {
+    BROTLI_REPEAT_6({
+      symbol--;
+      sorted[offset[code_lengths[symbol]]--] = symbol;
+    });
+  } while (symbol != 0);
+
+  table_size = 1 << BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH;
+
+  /* Special case: all symbols but one have 0 code length. */
+  if (offset[0] == 0) {
+    code = ConstructHuffmanCode(0, (uint16_t)sorted[0]);
+    for (key = 0; key < (brotli_reg_t)table_size; ++key) {
+      table[key] = code;
+    }
+    return;
+  }
+
+  /* Fill in table. */
+  key = 0;
+  key_step = BROTLI_REVERSE_BITS_LOWEST;
+  symbol = 0;
+  bits = 1;
+  step = 2;
+  do {
+    for (bits_count = count[bits]; bits_count != 0; --bits_count) {
+      code = ConstructHuffmanCode((uint8_t)bits, (uint16_t)sorted[symbol++]);
+      ReplicateValue(&table[BrotliReverseBits(key)], step, table_size, code);
+      key += key_step;
+    }
+    step <<= 1;
+    key_step >>= 1;
+  } while (++bits <= BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH);
+}
+
+uint32_t BrotliBuildHuffmanTable(HuffmanCode* root_table,
+                                 int root_bits,
+                                 const uint16_t* const symbol_lists,
+                                 uint16_t* count) {
+  HuffmanCode code;       /* current table entry */
+  HuffmanCode* table;     /* next available space in table */
+  int len;                /* current code length */
+  int symbol;             /* symbol index in original or sorted table */
+  brotli_reg_t key;       /* prefix code */
+  brotli_reg_t key_step;  /* prefix code addend */
+  brotli_reg_t sub_key;   /* 2nd level table prefix code */
+  brotli_reg_t sub_key_step;  /* 2nd level table prefix code addend */
+  int step;               /* step size to replicate values in current table */
+  int table_bits;         /* key length of current table */
+  int table_size;         /* size of current table */
+  int total_size;         /* sum of root table size and 2nd level table sizes */
+  int max_length = -1;
+  int bits;
+  int bits_count;
+
+  BROTLI_DCHECK(root_bits <= BROTLI_REVERSE_BITS_MAX);
+  BROTLI_DCHECK(BROTLI_HUFFMAN_MAX_CODE_LENGTH - root_bits <=
+                BROTLI_REVERSE_BITS_MAX);
+
+  while (symbol_lists[max_length] == 0xFFFF) max_length--;
+  max_length += BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1;
+
+  table = root_table;
+  table_bits = root_bits;
+  table_size = 1 << table_bits;
+  total_size = table_size;
+
+  /* Fill in the root table. Reduce the table size to if possible,
+     and create the repetitions by memcpy. */
+  if (table_bits > max_length) {
+    table_bits = max_length;
+    table_size = 1 << table_bits;
+  }
+  key = 0;
+  key_step = BROTLI_REVERSE_BITS_LOWEST;
+  bits = 1;
+  step = 2;
+  do {
+    symbol = bits - (BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1);
+    for (bits_count = count[bits]; bits_count != 0; --bits_count) {
+      symbol = symbol_lists[symbol];
+      code = ConstructHuffmanCode((uint8_t)bits, (uint16_t)symbol);
+      ReplicateValue(&table[BrotliReverseBits(key)], step, table_size, code);
+      key += key_step;
+    }
+    step <<= 1;
+    key_step >>= 1;
+  } while (++bits <= table_bits);
+
+  /* If root_bits != table_bits then replicate to fill the remaining slots. */
+  while (total_size != table_size) {
+    memcpy(&table[table_size], &table[0],
+           (size_t)table_size * sizeof(table[0]));
+    table_size <<= 1;
+  }
+
+  /* Fill in 2nd level tables and add pointers to root table. */
+  key_step = BROTLI_REVERSE_BITS_LOWEST >> (root_bits - 1);
+  sub_key = (BROTLI_REVERSE_BITS_LOWEST << 1);
+  sub_key_step = BROTLI_REVERSE_BITS_LOWEST;
+  for (len = root_bits + 1, step = 2; len <= max_length; ++len) {
+    symbol = len - (BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1);
+    for (; count[len] != 0; --count[len]) {
+      if (sub_key == (BROTLI_REVERSE_BITS_LOWEST << 1U)) {
+        table += table_size;
+        table_bits = NextTableBitSize(count, len, root_bits);
+        table_size = 1 << table_bits;
+        total_size += table_size;
+        sub_key = BrotliReverseBits(key);
+        key += key_step;
+        root_table[sub_key] = ConstructHuffmanCode(
+            (uint8_t)(table_bits + root_bits),
+            (uint16_t)(((size_t)(table - root_table)) - sub_key));
+        sub_key = 0;
+      }
+      symbol = symbol_lists[symbol];
+      code = ConstructHuffmanCode((uint8_t)(len - root_bits), (uint16_t)symbol);
+      ReplicateValue(
+          &table[BrotliReverseBits(sub_key)], step, table_size, code);
+      sub_key += sub_key_step;
+    }
+    step <<= 1;
+    sub_key_step >>= 1;
+  }
+  return (uint32_t)total_size;
+}
+
+uint32_t BrotliBuildSimpleHuffmanTable(HuffmanCode* table,
+                                       int root_bits,
+                                       uint16_t* val,
+                                       uint32_t num_symbols) {
+  uint32_t table_size = 1;
+  const uint32_t goal_size = 1U << root_bits;
+  switch (num_symbols) {
+    case 0:
+      table[0] = ConstructHuffmanCode(0, val[0]);
+      break;
+    case 1:
+      if (val[1] > val[0]) {
+        table[0] = ConstructHuffmanCode(1, val[0]);
+        table[1] = ConstructHuffmanCode(1, val[1]);
+      } else {
+        table[0] = ConstructHuffmanCode(1, val[1]);
+        table[1] = ConstructHuffmanCode(1, val[0]);
+      }
+      table_size = 2;
+      break;
+    case 2:
+      table[0] = ConstructHuffmanCode(1, val[0]);
+      table[2] = ConstructHuffmanCode(1, val[0]);
+      if (val[2] > val[1]) {
+        table[1] = ConstructHuffmanCode(2, val[1]);
+        table[3] = ConstructHuffmanCode(2, val[2]);
+      } else {
+        table[1] = ConstructHuffmanCode(2, val[2]);
+        table[3] = ConstructHuffmanCode(2, val[1]);
+      }
+      table_size = 4;
+      break;
+    case 3: {
+      int i, k;
+      for (i = 0; i < 3; ++i) {
+        for (k = i + 1; k < 4; ++k) {
+          if (val[k] < val[i]) {
+            uint16_t t = val[k];
+            val[k] = val[i];
+            val[i] = t;
+          }
+        }
+      }
+      table[0] = ConstructHuffmanCode(2, val[0]);
+      table[2] = ConstructHuffmanCode(2, val[1]);
+      table[1] = ConstructHuffmanCode(2, val[2]);
+      table[3] = ConstructHuffmanCode(2, val[3]);
+      table_size = 4;
+      break;
+    }
+    case 4: {
+      if (val[3] < val[2]) {
+        uint16_t t = val[3];
+        val[3] = val[2];
+        val[2] = t;
+      }
+      table[0] = ConstructHuffmanCode(1, val[0]);
+      table[1] = ConstructHuffmanCode(2, val[1]);
+      table[2] = ConstructHuffmanCode(1, val[0]);
+      table[3] = ConstructHuffmanCode(3, val[2]);
+      table[4] = ConstructHuffmanCode(1, val[0]);
+      table[5] = ConstructHuffmanCode(2, val[1]);
+      table[6] = ConstructHuffmanCode(1, val[0]);
+      table[7] = ConstructHuffmanCode(3, val[3]);
+      table_size = 8;
+      break;
+    }
+  }
+  while (table_size != goal_size) {
+    memcpy(&table[table_size], &table[0],
+           (size_t)table_size * sizeof(table[0]));
+    table_size <<= 1;
+  }
+  return goal_size;
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/huffman.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/huffman.h
new file mode 100644
index 0000000000..50360962c7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/huffman.h
@@ -0,0 +1,122 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Utilities for building Huffman decoding tables. */
+
+#ifndef BROTLI_DEC_HUFFMAN_H_
+#define BROTLI_DEC_HUFFMAN_H_
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define BROTLI_HUFFMAN_MAX_CODE_LENGTH 15
+
+/* BROTLI_NUM_BLOCK_LEN_SYMBOLS == 26 */
+#define BROTLI_HUFFMAN_MAX_SIZE_26 396
+/* BROTLI_MAX_BLOCK_TYPE_SYMBOLS == 258 */
+#define BROTLI_HUFFMAN_MAX_SIZE_258 632
+/* BROTLI_MAX_CONTEXT_MAP_SYMBOLS == 272 */
+#define BROTLI_HUFFMAN_MAX_SIZE_272 646
+
+#define BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH 5
+
+#if ((defined(BROTLI_TARGET_ARMV7) || defined(BROTLI_TARGET_ARMV8_32)) && \
+  BROTLI_GNUC_HAS_ATTRIBUTE(aligned, 2, 7, 0))
+#define BROTLI_HUFFMAN_CODE_FAST_LOAD
+#endif
+
+#if !defined(BROTLI_HUFFMAN_CODE_FAST_LOAD)
+/* Do not create this struct directly - use the ConstructHuffmanCode
+ * constructor below! */
+typedef struct {
+  uint8_t bits;    /* number of bits used for this symbol */
+  uint16_t value;  /* symbol value or table offset */
+} HuffmanCode;
+
+static BROTLI_INLINE HuffmanCode ConstructHuffmanCode(const uint8_t bits,
+    const uint16_t value) {
+  HuffmanCode h;
+  h.bits = bits;
+  h.value = value;
+  return h;
+}
+
+/* Please use the following macros to optimize HuffmanCode accesses in hot
+ * paths.
+ *
+ * For example, assuming |table| contains a HuffmanCode pointer:
+ *
+ *   BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(table);
+ *   BROTLI_HC_ADJUST_TABLE_INDEX(table, index_into_table);
+ *   *bits = BROTLI_HC_GET_BITS(table);
+ *   *value = BROTLI_HC_GET_VALUE(table);
+ *   BROTLI_HC_ADJUST_TABLE_INDEX(table, offset);
+ *   *bits2 = BROTLI_HC_GET_BITS(table);
+ *   *value2 = BROTLI_HC_GET_VALUE(table);
+ *
+ */
+
+#define BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(H)
+#define BROTLI_HC_ADJUST_TABLE_INDEX(H, V) H += (V)
+
+/* These must be given a HuffmanCode pointer! */
+#define BROTLI_HC_FAST_LOAD_BITS(H) (H->bits)
+#define BROTLI_HC_FAST_LOAD_VALUE(H) (H->value)
+
+#else /* BROTLI_HUFFMAN_CODE_FAST_LOAD */
+
+typedef BROTLI_ALIGNED(4) uint32_t HuffmanCode;
+
+static BROTLI_INLINE HuffmanCode ConstructHuffmanCode(const uint8_t bits,
+    const uint16_t value) {
+  return (HuffmanCode) ((value & 0xFFFF) << 16) | (bits & 0xFF);
+}
+
+#define BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(H) uint32_t __fastload_##H = (*H)
+#define BROTLI_HC_ADJUST_TABLE_INDEX(H, V) H += (V); __fastload_##H = (*H)
+
+/* These must be given a HuffmanCode pointer! */
+#define BROTLI_HC_FAST_LOAD_BITS(H) ((__fastload_##H) & 0xFF)
+#define BROTLI_HC_FAST_LOAD_VALUE(H) ((__fastload_##H) >> 16)
+#endif /* BROTLI_HUFFMAN_CODE_FAST_LOAD */
+
+/* Builds Huffman lookup table assuming code lengths are in symbol order. */
+BROTLI_INTERNAL void BrotliBuildCodeLengthsHuffmanTable(HuffmanCode* root_table,
+    const uint8_t* const code_lengths, uint16_t* count);
+
+/* Builds Huffman lookup table assuming code lengths are in symbol order.
+   Returns size of resulting table. */
+BROTLI_INTERNAL uint32_t BrotliBuildHuffmanTable(HuffmanCode* root_table,
+    int root_bits, const uint16_t* const symbol_lists, uint16_t* count);
+
+/* Builds a simple Huffman table. The |num_symbols| parameter is to be
+   interpreted as follows: 0 means 1 symbol, 1 means 2 symbols,
+   2 means 3 symbols, 3 means 4 symbols with lengths [2, 2, 2, 2],
+   4 means 4 symbols with lengths [1, 2, 3, 3]. */
+BROTLI_INTERNAL uint32_t BrotliBuildSimpleHuffmanTable(HuffmanCode* table,
+    int root_bits, uint16_t* symbols, uint32_t num_symbols);
+
+/* Contains a collection of Huffman trees with the same alphabet size. */
+/* alphabet_size_limit is needed due to simple codes, since
+   log2(alphabet_size_max) could be greater than log2(alphabet_size_limit). */
+typedef struct {
+  HuffmanCode** htrees;
+  HuffmanCode* codes;
+  uint16_t alphabet_size_max;
+  uint16_t alphabet_size_limit;
+  uint16_t num_htrees;
+} HuffmanTreeGroup;
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_DEC_HUFFMAN_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/prefix.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/prefix.h
new file mode 100644
index 0000000000..e8acf07740
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/prefix.h
@@ -0,0 +1,733 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Lookup tables to map prefix codes to value ranges. This is used during
+   decoding of the block lengths, literal insertion lengths and copy lengths. */
+
+#ifndef BROTLI_DEC_PREFIX_H_
+#define BROTLI_DEC_PREFIX_H_
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+
+typedef struct CmdLutElement {
+  uint8_t insert_len_extra_bits;
+  uint8_t copy_len_extra_bits;
+  int8_t distance_code;
+  uint8_t context;
+  uint16_t insert_len_offset;
+  uint16_t copy_len_offset;
+} CmdLutElement;
+
+static const CmdLutElement kCmdLut[BROTLI_NUM_COMMAND_SYMBOLS] = {
+  { 0x00, 0x00, 0, 0x00, 0x0000, 0x0002 },
+  { 0x00, 0x00, 0, 0x01, 0x0000, 0x0003 },
+  { 0x00, 0x00, 0, 0x02, 0x0000, 0x0004 },
+  { 0x00, 0x00, 0, 0x03, 0x0000, 0x0005 },
+  { 0x00, 0x00, 0, 0x03, 0x0000, 0x0006 },
+  { 0x00, 0x00, 0, 0x03, 0x0000, 0x0007 },
+  { 0x00, 0x00, 0, 0x03, 0x0000, 0x0008 },
+  { 0x00, 0x00, 0, 0x03, 0x0000, 0x0009 },
+  { 0x00, 0x00, 0, 0x00, 0x0001, 0x0002 },
+  { 0x00, 0x00, 0, 0x01, 0x0001, 0x0003 },
+  { 0x00, 0x00, 0, 0x02, 0x0001, 0x0004 },
+  { 0x00, 0x00, 0, 0x03, 0x0001, 0x0005 },
+  { 0x00, 0x00, 0, 0x03, 0x0001, 0x0006 },
+  { 0x00, 0x00, 0, 0x03, 0x0001, 0x0007 },
+  { 0x00, 0x00, 0, 0x03, 0x0001, 0x0008 },
+  { 0x00, 0x00, 0, 0x03, 0x0001, 0x0009 },
+  { 0x00, 0x00, 0, 0x00, 0x0002, 0x0002 },
+  { 0x00, 0x00, 0, 0x01, 0x0002, 0x0003 },
+  { 0x00, 0x00, 0, 0x02, 0x0002, 0x0004 },
+  { 0x00, 0x00, 0, 0x03, 0x0002, 0x0005 },
+  { 0x00, 0x00, 0, 0x03, 0x0002, 0x0006 },
+  { 0x00, 0x00, 0, 0x03, 0x0002, 0x0007 },
+  { 0x00, 0x00, 0, 0x03, 0x0002, 0x0008 },
+  { 0x00, 0x00, 0, 0x03, 0x0002, 0x0009 },
+  { 0x00, 0x00, 0, 0x00, 0x0003, 0x0002 },
+  { 0x00, 0x00, 0, 0x01, 0x0003, 0x0003 },
+  { 0x00, 0x00, 0, 0x02, 0x0003, 0x0004 },
+  { 0x00, 0x00, 0, 0x03, 0x0003, 0x0005 },
+  { 0x00, 0x00, 0, 0x03, 0x0003, 0x0006 },
+  { 0x00, 0x00, 0, 0x03, 0x0003, 0x0007 },
+  { 0x00, 0x00, 0, 0x03, 0x0003, 0x0008 },
+  { 0x00, 0x00, 0, 0x03, 0x0003, 0x0009 },
+  { 0x00, 0x00, 0, 0x00, 0x0004, 0x0002 },
+  { 0x00, 0x00, 0, 0x01, 0x0004, 0x0003 },
+  { 0x00, 0x00, 0, 0x02, 0x0004, 0x0004 },
+  { 0x00, 0x00, 0, 0x03, 0x0004, 0x0005 },
+  { 0x00, 0x00, 0, 0x03, 0x0004, 0x0006 },
+  { 0x00, 0x00, 0, 0x03, 0x0004, 0x0007 },
+  { 0x00, 0x00, 0, 0x03, 0x0004, 0x0008 },
+  { 0x00, 0x00, 0, 0x03, 0x0004, 0x0009 },
+  { 0x00, 0x00, 0, 0x00, 0x0005, 0x0002 },
+  { 0x00, 0x00, 0, 0x01, 0x0005, 0x0003 },
+  { 0x00, 0x00, 0, 0x02, 0x0005, 0x0004 },
+  { 0x00, 0x00, 0, 0x03, 0x0005, 0x0005 },
+  { 0x00, 0x00, 0, 0x03, 0x0005, 0x0006 },
+  { 0x00, 0x00, 0, 0x03, 0x0005, 0x0007 },
+  { 0x00, 0x00, 0, 0x03, 0x0005, 0x0008 },
+  { 0x00, 0x00, 0, 0x03, 0x0005, 0x0009 },
+  { 0x01, 0x00, 0, 0x00, 0x0006, 0x0002 },
+  { 0x01, 0x00, 0, 0x01, 0x0006, 0x0003 },
+  { 0x01, 0x00, 0, 0x02, 0x0006, 0x0004 },
+  { 0x01, 0x00, 0, 0x03, 0x0006, 0x0005 },
+  { 0x01, 0x00, 0, 0x03, 0x0006, 0x0006 },
+  { 0x01, 0x00, 0, 0x03, 0x0006, 0x0007 },
+  { 0x01, 0x00, 0, 0x03, 0x0006, 0x0008 },
+  { 0x01, 0x00, 0, 0x03, 0x0006, 0x0009 },
+  { 0x01, 0x00, 0, 0x00, 0x0008, 0x0002 },
+  { 0x01, 0x00, 0, 0x01, 0x0008, 0x0003 },
+  { 0x01, 0x00, 0, 0x02, 0x0008, 0x0004 },
+  { 0x01, 0x00, 0, 0x03, 0x0008, 0x0005 },
+  { 0x01, 0x00, 0, 0x03, 0x0008, 0x0006 },
+  { 0x01, 0x00, 0, 0x03, 0x0008, 0x0007 },
+  { 0x01, 0x00, 0, 0x03, 0x0008, 0x0008 },
+  { 0x01, 0x00, 0, 0x03, 0x0008, 0x0009 },
+  { 0x00, 0x01, 0, 0x03, 0x0000, 0x000a },
+  { 0x00, 0x01, 0, 0x03, 0x0000, 0x000c },
+  { 0x00, 0x02, 0, 0x03, 0x0000, 0x000e },
+  { 0x00, 0x02, 0, 0x03, 0x0000, 0x0012 },
+  { 0x00, 0x03, 0, 0x03, 0x0000, 0x0016 },
+  { 0x00, 0x03, 0, 0x03, 0x0000, 0x001e },
+  { 0x00, 0x04, 0, 0x03, 0x0000, 0x0026 },
+  { 0x00, 0x04, 0, 0x03, 0x0000, 0x0036 },
+  { 0x00, 0x01, 0, 0x03, 0x0001, 0x000a },
+  { 0x00, 0x01, 0, 0x03, 0x0001, 0x000c },
+  { 0x00, 0x02, 0, 0x03, 0x0001, 0x000e },
+  { 0x00, 0x02, 0, 0x03, 0x0001, 0x0012 },
+  { 0x00, 0x03, 0, 0x03, 0x0001, 0x0016 },
+  { 0x00, 0x03, 0, 0x03, 0x0001, 0x001e },
+  { 0x00, 0x04, 0, 0x03, 0x0001, 0x0026 },
+  { 0x00, 0x04, 0, 0x03, 0x0001, 0x0036 },
+  { 0x00, 0x01, 0, 0x03, 0x0002, 0x000a },
+  { 0x00, 0x01, 0, 0x03, 0x0002, 0x000c },
+  { 0x00, 0x02, 0, 0x03, 0x0002, 0x000e },
+  { 0x00, 0x02, 0, 0x03, 0x0002, 0x0012 },
+  { 0x00, 0x03, 0, 0x03, 0x0002, 0x0016 },
+  { 0x00, 0x03, 0, 0x03, 0x0002, 0x001e },
+  { 0x00, 0x04, 0, 0x03, 0x0002, 0x0026 },
+  { 0x00, 0x04, 0, 0x03, 0x0002, 0x0036 },
+  { 0x00, 0x01, 0, 0x03, 0x0003, 0x000a },
+  { 0x00, 0x01, 0, 0x03, 0x0003, 0x000c },
+  { 0x00, 0x02, 0, 0x03, 0x0003, 0x000e },
+  { 0x00, 0x02, 0, 0x03, 0x0003, 0x0012 },
+  { 0x00, 0x03, 0, 0x03, 0x0003, 0x0016 },
+  { 0x00, 0x03, 0, 0x03, 0x0003, 0x001e },
+  { 0x00, 0x04, 0, 0x03, 0x0003, 0x0026 },
+  { 0x00, 0x04, 0, 0x03, 0x0003, 0x0036 },
+  { 0x00, 0x01, 0, 0x03, 0x0004, 0x000a },
+  { 0x00, 0x01, 0, 0x03, 0x0004, 0x000c },
+  { 0x00, 0x02, 0, 0x03, 0x0004, 0x000e },
+  { 0x00, 0x02, 0, 0x03, 0x0004, 0x0012 },
+  { 0x00, 0x03, 0, 0x03, 0x0004, 0x0016 },
+  { 0x00, 0x03, 0, 0x03, 0x0004, 0x001e },
+  { 0x00, 0x04, 0, 0x03, 0x0004, 0x0026 },
+  { 0x00, 0x04, 0, 0x03, 0x0004, 0x0036 },
+  { 0x00, 0x01, 0, 0x03, 0x0005, 0x000a },
+  { 0x00, 0x01, 0, 0x03, 0x0005, 0x000c },
+  { 0x00, 0x02, 0, 0x03, 0x0005, 0x000e },
+  { 0x00, 0x02, 0, 0x03, 0x0005, 0x0012 },
+  { 0x00, 0x03, 0, 0x03, 0x0005, 0x0016 },
+  { 0x00, 0x03, 0, 0x03, 0x0005, 0x001e },
+  { 0x00, 0x04, 0, 0x03, 0x0005, 0x0026 },
+  { 0x00, 0x04, 0, 0x03, 0x0005, 0x0036 },
+  { 0x01, 0x01, 0, 0x03, 0x0006, 0x000a },
+  { 0x01, 0x01, 0, 0x03, 0x0006, 0x000c },
+  { 0x01, 0x02, 0, 0x03, 0x0006, 0x000e },
+  { 0x01, 0x02, 0, 0x03, 0x0006, 0x0012 },
+  { 0x01, 0x03, 0, 0x03, 0x0006, 0x0016 },
+  { 0x01, 0x03, 0, 0x03, 0x0006, 0x001e },
+  { 0x01, 0x04, 0, 0x03, 0x0006, 0x0026 },
+  { 0x01, 0x04, 0, 0x03, 0x0006, 0x0036 },
+  { 0x01, 0x01, 0, 0x03, 0x0008, 0x000a },
+  { 0x01, 0x01, 0, 0x03, 0x0008, 0x000c },
+  { 0x01, 0x02, 0, 0x03, 0x0008, 0x000e },
+  { 0x01, 0x02, 0, 0x03, 0x0008, 0x0012 },
+  { 0x01, 0x03, 0, 0x03, 0x0008, 0x0016 },
+  { 0x01, 0x03, 0, 0x03, 0x0008, 0x001e },
+  { 0x01, 0x04, 0, 0x03, 0x0008, 0x0026 },
+  { 0x01, 0x04, 0, 0x03, 0x0008, 0x0036 },
+  { 0x00, 0x00, -1, 0x00, 0x0000, 0x0002 },
+  { 0x00, 0x00, -1, 0x01, 0x0000, 0x0003 },
+  { 0x00, 0x00, -1, 0x02, 0x0000, 0x0004 },
+  { 0x00, 0x00, -1, 0x03, 0x0000, 0x0005 },
+  { 0x00, 0x00, -1, 0x03, 0x0000, 0x0006 },
+  { 0x00, 0x00, -1, 0x03, 0x0000, 0x0007 },
+  { 0x00, 0x00, -1, 0x03, 0x0000, 0x0008 },
+  { 0x00, 0x00, -1, 0x03, 0x0000, 0x0009 },
+  { 0x00, 0x00, -1, 0x00, 0x0001, 0x0002 },
+  { 0x00, 0x00, -1, 0x01, 0x0001, 0x0003 },
+  { 0x00, 0x00, -1, 0x02, 0x0001, 0x0004 },
+  { 0x00, 0x00, -1, 0x03, 0x0001, 0x0005 },
+  { 0x00, 0x00, -1, 0x03, 0x0001, 0x0006 },
+  { 0x00, 0x00, -1, 0x03, 0x0001, 0x0007 },
+  { 0x00, 0x00, -1, 0x03, 0x0001, 0x0008 },
+  { 0x00, 0x00, -1, 0x03, 0x0001, 0x0009 },
+  { 0x00, 0x00, -1, 0x00, 0x0002, 0x0002 },
+  { 0x00, 0x00, -1, 0x01, 0x0002, 0x0003 },
+  { 0x00, 0x00, -1, 0x02, 0x0002, 0x0004 },
+  { 0x00, 0x00, -1, 0x03, 0x0002, 0x0005 },
+  { 0x00, 0x00, -1, 0x03, 0x0002, 0x0006 },
+  { 0x00, 0x00, -1, 0x03, 0x0002, 0x0007 },
+  { 0x00, 0x00, -1, 0x03, 0x0002, 0x0008 },
+  { 0x00, 0x00, -1, 0x03, 0x0002, 0x0009 },
+  { 0x00, 0x00, -1, 0x00, 0x0003, 0x0002 },
+  { 0x00, 0x00, -1, 0x01, 0x0003, 0x0003 },
+  { 0x00, 0x00, -1, 0x02, 0x0003, 0x0004 },
+  { 0x00, 0x00, -1, 0x03, 0x0003, 0x0005 },
+  { 0x00, 0x00, -1, 0x03, 0x0003, 0x0006 },
+  { 0x00, 0x00, -1, 0x03, 0x0003, 0x0007 },
+  { 0x00, 0x00, -1, 0x03, 0x0003, 0x0008 },
+  { 0x00, 0x00, -1, 0x03, 0x0003, 0x0009 },
+  { 0x00, 0x00, -1, 0x00, 0x0004, 0x0002 },
+  { 0x00, 0x00, -1, 0x01, 0x0004, 0x0003 },
+  { 0x00, 0x00, -1, 0x02, 0x0004, 0x0004 },
+  { 0x00, 0x00, -1, 0x03, 0x0004, 0x0005 },
+  { 0x00, 0x00, -1, 0x03, 0x0004, 0x0006 },
+  { 0x00, 0x00, -1, 0x03, 0x0004, 0x0007 },
+  { 0x00, 0x00, -1, 0x03, 0x0004, 0x0008 },
+  { 0x00, 0x00, -1, 0x03, 0x0004, 0x0009 },
+  { 0x00, 0x00, -1, 0x00, 0x0005, 0x0002 },
+  { 0x00, 0x00, -1, 0x01, 0x0005, 0x0003 },
+  { 0x00, 0x00, -1, 0x02, 0x0005, 0x0004 },
+  { 0x00, 0x00, -1, 0x03, 0x0005, 0x0005 },
+  { 0x00, 0x00, -1, 0x03, 0x0005, 0x0006 },
+  { 0x00, 0x00, -1, 0x03, 0x0005, 0x0007 },
+  { 0x00, 0x00, -1, 0x03, 0x0005, 0x0008 },
+  { 0x00, 0x00, -1, 0x03, 0x0005, 0x0009 },
+  { 0x01, 0x00, -1, 0x00, 0x0006, 0x0002 },
+  { 0x01, 0x00, -1, 0x01, 0x0006, 0x0003 },
+  { 0x01, 0x00, -1, 0x02, 0x0006, 0x0004 },
+  { 0x01, 0x00, -1, 0x03, 0x0006, 0x0005 },
+  { 0x01, 0x00, -1, 0x03, 0x0006, 0x0006 },
+  { 0x01, 0x00, -1, 0x03, 0x0006, 0x0007 },
+  { 0x01, 0x00, -1, 0x03, 0x0006, 0x0008 },
+  { 0x01, 0x00, -1, 0x03, 0x0006, 0x0009 },
+  { 0x01, 0x00, -1, 0x00, 0x0008, 0x0002 },
+  { 0x01, 0x00, -1, 0x01, 0x0008, 0x0003 },
+  { 0x01, 0x00, -1, 0x02, 0x0008, 0x0004 },
+  { 0x01, 0x00, -1, 0x03, 0x0008, 0x0005 },
+  { 0x01, 0x00, -1, 0x03, 0x0008, 0x0006 },
+  { 0x01, 0x00, -1, 0x03, 0x0008, 0x0007 },
+  { 0x01, 0x00, -1, 0x03, 0x0008, 0x0008 },
+  { 0x01, 0x00, -1, 0x03, 0x0008, 0x0009 },
+  { 0x00, 0x01, -1, 0x03, 0x0000, 0x000a },
+  { 0x00, 0x01, -1, 0x03, 0x0000, 0x000c },
+  { 0x00, 0x02, -1, 0x03, 0x0000, 0x000e },
+  { 0x00, 0x02, -1, 0x03, 0x0000, 0x0012 },
+  { 0x00, 0x03, -1, 0x03, 0x0000, 0x0016 },
+  { 0x00, 0x03, -1, 0x03, 0x0000, 0x001e },
+  { 0x00, 0x04, -1, 0x03, 0x0000, 0x0026 },
+  { 0x00, 0x04, -1, 0x03, 0x0000, 0x0036 },
+  { 0x00, 0x01, -1, 0x03, 0x0001, 0x000a },
+  { 0x00, 0x01, -1, 0x03, 0x0001, 0x000c },
+  { 0x00, 0x02, -1, 0x03, 0x0001, 0x000e },
+  { 0x00, 0x02, -1, 0x03, 0x0001, 0x0012 },
+  { 0x00, 0x03, -1, 0x03, 0x0001, 0x0016 },
+  { 0x00, 0x03, -1, 0x03, 0x0001, 0x001e },
+  { 0x00, 0x04, -1, 0x03, 0x0001, 0x0026 },
+  { 0x00, 0x04, -1, 0x03, 0x0001, 0x0036 },
+  { 0x00, 0x01, -1, 0x03, 0x0002, 0x000a },
+  { 0x00, 0x01, -1, 0x03, 0x0002, 0x000c },
+  { 0x00, 0x02, -1, 0x03, 0x0002, 0x000e },
+  { 0x00, 0x02, -1, 0x03, 0x0002, 0x0012 },
+  { 0x00, 0x03, -1, 0x03, 0x0002, 0x0016 },
+  { 0x00, 0x03, -1, 0x03, 0x0002, 0x001e },
+  { 0x00, 0x04, -1, 0x03, 0x0002, 0x0026 },
+  { 0x00, 0x04, -1, 0x03, 0x0002, 0x0036 },
+  { 0x00, 0x01, -1, 0x03, 0x0003, 0x000a },
+  { 0x00, 0x01, -1, 0x03, 0x0003, 0x000c },
+  { 0x00, 0x02, -1, 0x03, 0x0003, 0x000e },
+  { 0x00, 0x02, -1, 0x03, 0x0003, 0x0012 },
+  { 0x00, 0x03, -1, 0x03, 0x0003, 0x0016 },
+  { 0x00, 0x03, -1, 0x03, 0x0003, 0x001e },
+  { 0x00, 0x04, -1, 0x03, 0x0003, 0x0026 },
+  { 0x00, 0x04, -1, 0x03, 0x0003, 0x0036 },
+  { 0x00, 0x01, -1, 0x03, 0x0004, 0x000a },
+  { 0x00, 0x01, -1, 0x03, 0x0004, 0x000c },
+  { 0x00, 0x02, -1, 0x03, 0x0004, 0x000e },
+  { 0x00, 0x02, -1, 0x03, 0x0004, 0x0012 },
+  { 0x00, 0x03, -1, 0x03, 0x0004, 0x0016 },
+  { 0x00, 0x03, -1, 0x03, 0x0004, 0x001e },
+  { 0x00, 0x04, -1, 0x03, 0x0004, 0x0026 },
+  { 0x00, 0x04, -1, 0x03, 0x0004, 0x0036 },
+  { 0x00, 0x01, -1, 0x03, 0x0005, 0x000a },
+  { 0x00, 0x01, -1, 0x03, 0x0005, 0x000c },
+  { 0x00, 0x02, -1, 0x03, 0x0005, 0x000e },
+  { 0x00, 0x02, -1, 0x03, 0x0005, 0x0012 },
+  { 0x00, 0x03, -1, 0x03, 0x0005, 0x0016 },
+  { 0x00, 0x03, -1, 0x03, 0x0005, 0x001e },
+  { 0x00, 0x04, -1, 0x03, 0x0005, 0x0026 },
+  { 0x00, 0x04, -1, 0x03, 0x0005, 0x0036 },
+  { 0x01, 0x01, -1, 0x03, 0x0006, 0x000a },
+  { 0x01, 0x01, -1, 0x03, 0x0006, 0x000c },
+  { 0x01, 0x02, -1, 0x03, 0x0006, 0x000e },
+  { 0x01, 0x02, -1, 0x03, 0x0006, 0x0012 },
+  { 0x01, 0x03, -1, 0x03, 0x0006, 0x0016 },
+  { 0x01, 0x03, -1, 0x03, 0x0006, 0x001e },
+  { 0x01, 0x04, -1, 0x03, 0x0006, 0x0026 },
+  { 0x01, 0x04, -1, 0x03, 0x0006, 0x0036 },
+  { 0x01, 0x01, -1, 0x03, 0x0008, 0x000a },
+  { 0x01, 0x01, -1, 0x03, 0x0008, 0x000c },
+  { 0x01, 0x02, -1, 0x03, 0x0008, 0x000e },
+  { 0x01, 0x02, -1, 0x03, 0x0008, 0x0012 },
+  { 0x01, 0x03, -1, 0x03, 0x0008, 0x0016 },
+  { 0x01, 0x03, -1, 0x03, 0x0008, 0x001e },
+  { 0x01, 0x04, -1, 0x03, 0x0008, 0x0026 },
+  { 0x01, 0x04, -1, 0x03, 0x0008, 0x0036 },
+  { 0x02, 0x00, -1, 0x00, 0x000a, 0x0002 },
+  { 0x02, 0x00, -1, 0x01, 0x000a, 0x0003 },
+  { 0x02, 0x00, -1, 0x02, 0x000a, 0x0004 },
+  { 0x02, 0x00, -1, 0x03, 0x000a, 0x0005 },
+  { 0x02, 0x00, -1, 0x03, 0x000a, 0x0006 },
+  { 0x02, 0x00, -1, 0x03, 0x000a, 0x0007 },
+  { 0x02, 0x00, -1, 0x03, 0x000a, 0x0008 },
+  { 0x02, 0x00, -1, 0x03, 0x000a, 0x0009 },
+  { 0x02, 0x00, -1, 0x00, 0x000e, 0x0002 },
+  { 0x02, 0x00, -1, 0x01, 0x000e, 0x0003 },
+  { 0x02, 0x00, -1, 0x02, 0x000e, 0x0004 },
+  { 0x02, 0x00, -1, 0x03, 0x000e, 0x0005 },
+  { 0x02, 0x00, -1, 0x03, 0x000e, 0x0006 },
+  { 0x02, 0x00, -1, 0x03, 0x000e, 0x0007 },
+  { 0x02, 0x00, -1, 0x03, 0x000e, 0x0008 },
+  { 0x02, 0x00, -1, 0x03, 0x000e, 0x0009 },
+  { 0x03, 0x00, -1, 0x00, 0x0012, 0x0002 },
+  { 0x03, 0x00, -1, 0x01, 0x0012, 0x0003 },
+  { 0x03, 0x00, -1, 0x02, 0x0012, 0x0004 },
+  { 0x03, 0x00, -1, 0x03, 0x0012, 0x0005 },
+  { 0x03, 0x00, -1, 0x03, 0x0012, 0x0006 },
+  { 0x03, 0x00, -1, 0x03, 0x0012, 0x0007 },
+  { 0x03, 0x00, -1, 0x03, 0x0012, 0x0008 },
+  { 0x03, 0x00, -1, 0x03, 0x0012, 0x0009 },
+  { 0x03, 0x00, -1, 0x00, 0x001a, 0x0002 },
+  { 0x03, 0x00, -1, 0x01, 0x001a, 0x0003 },
+  { 0x03, 0x00, -1, 0x02, 0x001a, 0x0004 },
+  { 0x03, 0x00, -1, 0x03, 0x001a, 0x0005 },
+  { 0x03, 0x00, -1, 0x03, 0x001a, 0x0006 },
+  { 0x03, 0x00, -1, 0x03, 0x001a, 0x0007 },
+  { 0x03, 0x00, -1, 0x03, 0x001a, 0x0008 },
+  { 0x03, 0x00, -1, 0x03, 0x001a, 0x0009 },
+  { 0x04, 0x00, -1, 0x00, 0x0022, 0x0002 },
+  { 0x04, 0x00, -1, 0x01, 0x0022, 0x0003 },
+  { 0x04, 0x00, -1, 0x02, 0x0022, 0x0004 },
+  { 0x04, 0x00, -1, 0x03, 0x0022, 0x0005 },
+  { 0x04, 0x00, -1, 0x03, 0x0022, 0x0006 },
+  { 0x04, 0x00, -1, 0x03, 0x0022, 0x0007 },
+  { 0x04, 0x00, -1, 0x03, 0x0022, 0x0008 },
+  { 0x04, 0x00, -1, 0x03, 0x0022, 0x0009 },
+  { 0x04, 0x00, -1, 0x00, 0x0032, 0x0002 },
+  { 0x04, 0x00, -1, 0x01, 0x0032, 0x0003 },
+  { 0x04, 0x00, -1, 0x02, 0x0032, 0x0004 },
+  { 0x04, 0x00, -1, 0x03, 0x0032, 0x0005 },
+  { 0x04, 0x00, -1, 0x03, 0x0032, 0x0006 },
+  { 0x04, 0x00, -1, 0x03, 0x0032, 0x0007 },
+  { 0x04, 0x00, -1, 0x03, 0x0032, 0x0008 },
+  { 0x04, 0x00, -1, 0x03, 0x0032, 0x0009 },
+  { 0x05, 0x00, -1, 0x00, 0x0042, 0x0002 },
+  { 0x05, 0x00, -1, 0x01, 0x0042, 0x0003 },
+  { 0x05, 0x00, -1, 0x02, 0x0042, 0x0004 },
+  { 0x05, 0x00, -1, 0x03, 0x0042, 0x0005 },
+  { 0x05, 0x00, -1, 0x03, 0x0042, 0x0006 },
+  { 0x05, 0x00, -1, 0x03, 0x0042, 0x0007 },
+  { 0x05, 0x00, -1, 0x03, 0x0042, 0x0008 },
+  { 0x05, 0x00, -1, 0x03, 0x0042, 0x0009 },
+  { 0x05, 0x00, -1, 0x00, 0x0062, 0x0002 },
+  { 0x05, 0x00, -1, 0x01, 0x0062, 0x0003 },
+  { 0x05, 0x00, -1, 0x02, 0x0062, 0x0004 },
+  { 0x05, 0x00, -1, 0x03, 0x0062, 0x0005 },
+  { 0x05, 0x00, -1, 0x03, 0x0062, 0x0006 },
+  { 0x05, 0x00, -1, 0x03, 0x0062, 0x0007 },
+  { 0x05, 0x00, -1, 0x03, 0x0062, 0x0008 },
+  { 0x05, 0x00, -1, 0x03, 0x0062, 0x0009 },
+  { 0x02, 0x01, -1, 0x03, 0x000a, 0x000a },
+  { 0x02, 0x01, -1, 0x03, 0x000a, 0x000c },
+  { 0x02, 0x02, -1, 0x03, 0x000a, 0x000e },
+  { 0x02, 0x02, -1, 0x03, 0x000a, 0x0012 },
+  { 0x02, 0x03, -1, 0x03, 0x000a, 0x0016 },
+  { 0x02, 0x03, -1, 0x03, 0x000a, 0x001e },
+  { 0x02, 0x04, -1, 0x03, 0x000a, 0x0026 },
+  { 0x02, 0x04, -1, 0x03, 0x000a, 0x0036 },
+  { 0x02, 0x01, -1, 0x03, 0x000e, 0x000a },
+  { 0x02, 0x01, -1, 0x03, 0x000e, 0x000c },
+  { 0x02, 0x02, -1, 0x03, 0x000e, 0x000e },
+  { 0x02, 0x02, -1, 0x03, 0x000e, 0x0012 },
+  { 0x02, 0x03, -1, 0x03, 0x000e, 0x0016 },
+  { 0x02, 0x03, -1, 0x03, 0x000e, 0x001e },
+  { 0x02, 0x04, -1, 0x03, 0x000e, 0x0026 },
+  { 0x02, 0x04, -1, 0x03, 0x000e, 0x0036 },
+  { 0x03, 0x01, -1, 0x03, 0x0012, 0x000a },
+  { 0x03, 0x01, -1, 0x03, 0x0012, 0x000c },
+  { 0x03, 0x02, -1, 0x03, 0x0012, 0x000e },
+  { 0x03, 0x02, -1, 0x03, 0x0012, 0x0012 },
+  { 0x03, 0x03, -1, 0x03, 0x0012, 0x0016 },
+  { 0x03, 0x03, -1, 0x03, 0x0012, 0x001e },
+  { 0x03, 0x04, -1, 0x03, 0x0012, 0x0026 },
+  { 0x03, 0x04, -1, 0x03, 0x0012, 0x0036 },
+  { 0x03, 0x01, -1, 0x03, 0x001a, 0x000a },
+  { 0x03, 0x01, -1, 0x03, 0x001a, 0x000c },
+  { 0x03, 0x02, -1, 0x03, 0x001a, 0x000e },
+  { 0x03, 0x02, -1, 0x03, 0x001a, 0x0012 },
+  { 0x03, 0x03, -1, 0x03, 0x001a, 0x0016 },
+  { 0x03, 0x03, -1, 0x03, 0x001a, 0x001e },
+  { 0x03, 0x04, -1, 0x03, 0x001a, 0x0026 },
+  { 0x03, 0x04, -1, 0x03, 0x001a, 0x0036 },
+  { 0x04, 0x01, -1, 0x03, 0x0022, 0x000a },
+  { 0x04, 0x01, -1, 0x03, 0x0022, 0x000c },
+  { 0x04, 0x02, -1, 0x03, 0x0022, 0x000e },
+  { 0x04, 0x02, -1, 0x03, 0x0022, 0x0012 },
+  { 0x04, 0x03, -1, 0x03, 0x0022, 0x0016 },
+  { 0x04, 0x03, -1, 0x03, 0x0022, 0x001e },
+  { 0x04, 0x04, -1, 0x03, 0x0022, 0x0026 },
+  { 0x04, 0x04, -1, 0x03, 0x0022, 0x0036 },
+  { 0x04, 0x01, -1, 0x03, 0x0032, 0x000a },
+  { 0x04, 0x01, -1, 0x03, 0x0032, 0x000c },
+  { 0x04, 0x02, -1, 0x03, 0x0032, 0x000e },
+  { 0x04, 0x02, -1, 0x03, 0x0032, 0x0012 },
+  { 0x04, 0x03, -1, 0x03, 0x0032, 0x0016 },
+  { 0x04, 0x03, -1, 0x03, 0x0032, 0x001e },
+  { 0x04, 0x04, -1, 0x03, 0x0032, 0x0026 },
+  { 0x04, 0x04, -1, 0x03, 0x0032, 0x0036 },
+  { 0x05, 0x01, -1, 0x03, 0x0042, 0x000a },
+  { 0x05, 0x01, -1, 0x03, 0x0042, 0x000c },
+  { 0x05, 0x02, -1, 0x03, 0x0042, 0x000e },
+  { 0x05, 0x02, -1, 0x03, 0x0042, 0x0012 },
+  { 0x05, 0x03, -1, 0x03, 0x0042, 0x0016 },
+  { 0x05, 0x03, -1, 0x03, 0x0042, 0x001e },
+  { 0x05, 0x04, -1, 0x03, 0x0042, 0x0026 },
+  { 0x05, 0x04, -1, 0x03, 0x0042, 0x0036 },
+  { 0x05, 0x01, -1, 0x03, 0x0062, 0x000a },
+  { 0x05, 0x01, -1, 0x03, 0x0062, 0x000c },
+  { 0x05, 0x02, -1, 0x03, 0x0062, 0x000e },
+  { 0x05, 0x02, -1, 0x03, 0x0062, 0x0012 },
+  { 0x05, 0x03, -1, 0x03, 0x0062, 0x0016 },
+  { 0x05, 0x03, -1, 0x03, 0x0062, 0x001e },
+  { 0x05, 0x04, -1, 0x03, 0x0062, 0x0026 },
+  { 0x05, 0x04, -1, 0x03, 0x0062, 0x0036 },
+  { 0x00, 0x05, -1, 0x03, 0x0000, 0x0046 },
+  { 0x00, 0x05, -1, 0x03, 0x0000, 0x0066 },
+  { 0x00, 0x06, -1, 0x03, 0x0000, 0x0086 },
+  { 0x00, 0x07, -1, 0x03, 0x0000, 0x00c6 },
+  { 0x00, 0x08, -1, 0x03, 0x0000, 0x0146 },
+  { 0x00, 0x09, -1, 0x03, 0x0000, 0x0246 },
+  { 0x00, 0x0a, -1, 0x03, 0x0000, 0x0446 },
+  { 0x00, 0x18, -1, 0x03, 0x0000, 0x0846 },
+  { 0x00, 0x05, -1, 0x03, 0x0001, 0x0046 },
+  { 0x00, 0x05, -1, 0x03, 0x0001, 0x0066 },
+  { 0x00, 0x06, -1, 0x03, 0x0001, 0x0086 },
+  { 0x00, 0x07, -1, 0x03, 0x0001, 0x00c6 },
+  { 0x00, 0x08, -1, 0x03, 0x0001, 0x0146 },
+  { 0x00, 0x09, -1, 0x03, 0x0001, 0x0246 },
+  { 0x00, 0x0a, -1, 0x03, 0x0001, 0x0446 },
+  { 0x00, 0x18, -1, 0x03, 0x0001, 0x0846 },
+  { 0x00, 0x05, -1, 0x03, 0x0002, 0x0046 },
+  { 0x00, 0x05, -1, 0x03, 0x0002, 0x0066 },
+  { 0x00, 0x06, -1, 0x03, 0x0002, 0x0086 },
+  { 0x00, 0x07, -1, 0x03, 0x0002, 0x00c6 },
+  { 0x00, 0x08, -1, 0x03, 0x0002, 0x0146 },
+  { 0x00, 0x09, -1, 0x03, 0x0002, 0x0246 },
+  { 0x00, 0x0a, -1, 0x03, 0x0002, 0x0446 },
+  { 0x00, 0x18, -1, 0x03, 0x0002, 0x0846 },
+  { 0x00, 0x05, -1, 0x03, 0x0003, 0x0046 },
+  { 0x00, 0x05, -1, 0x03, 0x0003, 0x0066 },
+  { 0x00, 0x06, -1, 0x03, 0x0003, 0x0086 },
+  { 0x00, 0x07, -1, 0x03, 0x0003, 0x00c6 },
+  { 0x00, 0x08, -1, 0x03, 0x0003, 0x0146 },
+  { 0x00, 0x09, -1, 0x03, 0x0003, 0x0246 },
+  { 0x00, 0x0a, -1, 0x03, 0x0003, 0x0446 },
+  { 0x00, 0x18, -1, 0x03, 0x0003, 0x0846 },
+  { 0x00, 0x05, -1, 0x03, 0x0004, 0x0046 },
+  { 0x00, 0x05, -1, 0x03, 0x0004, 0x0066 },
+  { 0x00, 0x06, -1, 0x03, 0x0004, 0x0086 },
+  { 0x00, 0x07, -1, 0x03, 0x0004, 0x00c6 },
+  { 0x00, 0x08, -1, 0x03, 0x0004, 0x0146 },
+  { 0x00, 0x09, -1, 0x03, 0x0004, 0x0246 },
+  { 0x00, 0x0a, -1, 0x03, 0x0004, 0x0446 },
+  { 0x00, 0x18, -1, 0x03, 0x0004, 0x0846 },
+  { 0x00, 0x05, -1, 0x03, 0x0005, 0x0046 },
+  { 0x00, 0x05, -1, 0x03, 0x0005, 0x0066 },
+  { 0x00, 0x06, -1, 0x03, 0x0005, 0x0086 },
+  { 0x00, 0x07, -1, 0x03, 0x0005, 0x00c6 },
+  { 0x00, 0x08, -1, 0x03, 0x0005, 0x0146 },
+  { 0x00, 0x09, -1, 0x03, 0x0005, 0x0246 },
+  { 0x00, 0x0a, -1, 0x03, 0x0005, 0x0446 },
+  { 0x00, 0x18, -1, 0x03, 0x0005, 0x0846 },
+  { 0x01, 0x05, -1, 0x03, 0x0006, 0x0046 },
+  { 0x01, 0x05, -1, 0x03, 0x0006, 0x0066 },
+  { 0x01, 0x06, -1, 0x03, 0x0006, 0x0086 },
+  { 0x01, 0x07, -1, 0x03, 0x0006, 0x00c6 },
+  { 0x01, 0x08, -1, 0x03, 0x0006, 0x0146 },
+  { 0x01, 0x09, -1, 0x03, 0x0006, 0x0246 },
+  { 0x01, 0x0a, -1, 0x03, 0x0006, 0x0446 },
+  { 0x01, 0x18, -1, 0x03, 0x0006, 0x0846 },
+  { 0x01, 0x05, -1, 0x03, 0x0008, 0x0046 },
+  { 0x01, 0x05, -1, 0x03, 0x0008, 0x0066 },
+  { 0x01, 0x06, -1, 0x03, 0x0008, 0x0086 },
+  { 0x01, 0x07, -1, 0x03, 0x0008, 0x00c6 },
+  { 0x01, 0x08, -1, 0x03, 0x0008, 0x0146 },
+  { 0x01, 0x09, -1, 0x03, 0x0008, 0x0246 },
+  { 0x01, 0x0a, -1, 0x03, 0x0008, 0x0446 },
+  { 0x01, 0x18, -1, 0x03, 0x0008, 0x0846 },
+  { 0x06, 0x00, -1, 0x00, 0x0082, 0x0002 },
+  { 0x06, 0x00, -1, 0x01, 0x0082, 0x0003 },
+  { 0x06, 0x00, -1, 0x02, 0x0082, 0x0004 },
+  { 0x06, 0x00, -1, 0x03, 0x0082, 0x0005 },
+  { 0x06, 0x00, -1, 0x03, 0x0082, 0x0006 },
+  { 0x06, 0x00, -1, 0x03, 0x0082, 0x0007 },
+  { 0x06, 0x00, -1, 0x03, 0x0082, 0x0008 },
+  { 0x06, 0x00, -1, 0x03, 0x0082, 0x0009 },
+  { 0x07, 0x00, -1, 0x00, 0x00c2, 0x0002 },
+  { 0x07, 0x00, -1, 0x01, 0x00c2, 0x0003 },
+  { 0x07, 0x00, -1, 0x02, 0x00c2, 0x0004 },
+  { 0x07, 0x00, -1, 0x03, 0x00c2, 0x0005 },
+  { 0x07, 0x00, -1, 0x03, 0x00c2, 0x0006 },
+  { 0x07, 0x00, -1, 0x03, 0x00c2, 0x0007 },
+  { 0x07, 0x00, -1, 0x03, 0x00c2, 0x0008 },
+  { 0x07, 0x00, -1, 0x03, 0x00c2, 0x0009 },
+  { 0x08, 0x00, -1, 0x00, 0x0142, 0x0002 },
+  { 0x08, 0x00, -1, 0x01, 0x0142, 0x0003 },
+  { 0x08, 0x00, -1, 0x02, 0x0142, 0x0004 },
+  { 0x08, 0x00, -1, 0x03, 0x0142, 0x0005 },
+  { 0x08, 0x00, -1, 0x03, 0x0142, 0x0006 },
+  { 0x08, 0x00, -1, 0x03, 0x0142, 0x0007 },
+  { 0x08, 0x00, -1, 0x03, 0x0142, 0x0008 },
+  { 0x08, 0x00, -1, 0x03, 0x0142, 0x0009 },
+  { 0x09, 0x00, -1, 0x00, 0x0242, 0x0002 },
+  { 0x09, 0x00, -1, 0x01, 0x0242, 0x0003 },
+  { 0x09, 0x00, -1, 0x02, 0x0242, 0x0004 },
+  { 0x09, 0x00, -1, 0x03, 0x0242, 0x0005 },
+  { 0x09, 0x00, -1, 0x03, 0x0242, 0x0006 },
+  { 0x09, 0x00, -1, 0x03, 0x0242, 0x0007 },
+  { 0x09, 0x00, -1, 0x03, 0x0242, 0x0008 },
+  { 0x09, 0x00, -1, 0x03, 0x0242, 0x0009 },
+  { 0x0a, 0x00, -1, 0x00, 0x0442, 0x0002 },
+  { 0x0a, 0x00, -1, 0x01, 0x0442, 0x0003 },
+  { 0x0a, 0x00, -1, 0x02, 0x0442, 0x0004 },
+  { 0x0a, 0x00, -1, 0x03, 0x0442, 0x0005 },
+  { 0x0a, 0x00, -1, 0x03, 0x0442, 0x0006 },
+  { 0x0a, 0x00, -1, 0x03, 0x0442, 0x0007 },
+  { 0x0a, 0x00, -1, 0x03, 0x0442, 0x0008 },
+  { 0x0a, 0x00, -1, 0x03, 0x0442, 0x0009 },
+  { 0x0c, 0x00, -1, 0x00, 0x0842, 0x0002 },
+  { 0x0c, 0x00, -1, 0x01, 0x0842, 0x0003 },
+  { 0x0c, 0x00, -1, 0x02, 0x0842, 0x0004 },
+  { 0x0c, 0x00, -1, 0x03, 0x0842, 0x0005 },
+  { 0x0c, 0x00, -1, 0x03, 0x0842, 0x0006 },
+  { 0x0c, 0x00, -1, 0x03, 0x0842, 0x0007 },
+  { 0x0c, 0x00, -1, 0x03, 0x0842, 0x0008 },
+  { 0x0c, 0x00, -1, 0x03, 0x0842, 0x0009 },
+  { 0x0e, 0x00, -1, 0x00, 0x1842, 0x0002 },
+  { 0x0e, 0x00, -1, 0x01, 0x1842, 0x0003 },
+  { 0x0e, 0x00, -1, 0x02, 0x1842, 0x0004 },
+  { 0x0e, 0x00, -1, 0x03, 0x1842, 0x0005 },
+  { 0x0e, 0x00, -1, 0x03, 0x1842, 0x0006 },
+  { 0x0e, 0x00, -1, 0x03, 0x1842, 0x0007 },
+  { 0x0e, 0x00, -1, 0x03, 0x1842, 0x0008 },
+  { 0x0e, 0x00, -1, 0x03, 0x1842, 0x0009 },
+  { 0x18, 0x00, -1, 0x00, 0x5842, 0x0002 },
+  { 0x18, 0x00, -1, 0x01, 0x5842, 0x0003 },
+  { 0x18, 0x00, -1, 0x02, 0x5842, 0x0004 },
+  { 0x18, 0x00, -1, 0x03, 0x5842, 0x0005 },
+  { 0x18, 0x00, -1, 0x03, 0x5842, 0x0006 },
+  { 0x18, 0x00, -1, 0x03, 0x5842, 0x0007 },
+  { 0x18, 0x00, -1, 0x03, 0x5842, 0x0008 },
+  { 0x18, 0x00, -1, 0x03, 0x5842, 0x0009 },
+  { 0x02, 0x05, -1, 0x03, 0x000a, 0x0046 },
+  { 0x02, 0x05, -1, 0x03, 0x000a, 0x0066 },
+  { 0x02, 0x06, -1, 0x03, 0x000a, 0x0086 },
+  { 0x02, 0x07, -1, 0x03, 0x000a, 0x00c6 },
+  { 0x02, 0x08, -1, 0x03, 0x000a, 0x0146 },
+  { 0x02, 0x09, -1, 0x03, 0x000a, 0x0246 },
+  { 0x02, 0x0a, -1, 0x03, 0x000a, 0x0446 },
+  { 0x02, 0x18, -1, 0x03, 0x000a, 0x0846 },
+  { 0x02, 0x05, -1, 0x03, 0x000e, 0x0046 },
+  { 0x02, 0x05, -1, 0x03, 0x000e, 0x0066 },
+  { 0x02, 0x06, -1, 0x03, 0x000e, 0x0086 },
+  { 0x02, 0x07, -1, 0x03, 0x000e, 0x00c6 },
+  { 0x02, 0x08, -1, 0x03, 0x000e, 0x0146 },
+  { 0x02, 0x09, -1, 0x03, 0x000e, 0x0246 },
+  { 0x02, 0x0a, -1, 0x03, 0x000e, 0x0446 },
+  { 0x02, 0x18, -1, 0x03, 0x000e, 0x0846 },
+  { 0x03, 0x05, -1, 0x03, 0x0012, 0x0046 },
+  { 0x03, 0x05, -1, 0x03, 0x0012, 0x0066 },
+  { 0x03, 0x06, -1, 0x03, 0x0012, 0x0086 },
+  { 0x03, 0x07, -1, 0x03, 0x0012, 0x00c6 },
+  { 0x03, 0x08, -1, 0x03, 0x0012, 0x0146 },
+  { 0x03, 0x09, -1, 0x03, 0x0012, 0x0246 },
+  { 0x03, 0x0a, -1, 0x03, 0x0012, 0x0446 },
+  { 0x03, 0x18, -1, 0x03, 0x0012, 0x0846 },
+  { 0x03, 0x05, -1, 0x03, 0x001a, 0x0046 },
+  { 0x03, 0x05, -1, 0x03, 0x001a, 0x0066 },
+  { 0x03, 0x06, -1, 0x03, 0x001a, 0x0086 },
+  { 0x03, 0x07, -1, 0x03, 0x001a, 0x00c6 },
+  { 0x03, 0x08, -1, 0x03, 0x001a, 0x0146 },
+  { 0x03, 0x09, -1, 0x03, 0x001a, 0x0246 },
+  { 0x03, 0x0a, -1, 0x03, 0x001a, 0x0446 },
+  { 0x03, 0x18, -1, 0x03, 0x001a, 0x0846 },
+  { 0x04, 0x05, -1, 0x03, 0x0022, 0x0046 },
+  { 0x04, 0x05, -1, 0x03, 0x0022, 0x0066 },
+  { 0x04, 0x06, -1, 0x03, 0x0022, 0x0086 },
+  { 0x04, 0x07, -1, 0x03, 0x0022, 0x00c6 },
+  { 0x04, 0x08, -1, 0x03, 0x0022, 0x0146 },
+  { 0x04, 0x09, -1, 0x03, 0x0022, 0x0246 },
+  { 0x04, 0x0a, -1, 0x03, 0x0022, 0x0446 },
+  { 0x04, 0x18, -1, 0x03, 0x0022, 0x0846 },
+  { 0x04, 0x05, -1, 0x03, 0x0032, 0x0046 },
+  { 0x04, 0x05, -1, 0x03, 0x0032, 0x0066 },
+  { 0x04, 0x06, -1, 0x03, 0x0032, 0x0086 },
+  { 0x04, 0x07, -1, 0x03, 0x0032, 0x00c6 },
+  { 0x04, 0x08, -1, 0x03, 0x0032, 0x0146 },
+  { 0x04, 0x09, -1, 0x03, 0x0032, 0x0246 },
+  { 0x04, 0x0a, -1, 0x03, 0x0032, 0x0446 },
+  { 0x04, 0x18, -1, 0x03, 0x0032, 0x0846 },
+  { 0x05, 0x05, -1, 0x03, 0x0042, 0x0046 },
+  { 0x05, 0x05, -1, 0x03, 0x0042, 0x0066 },
+  { 0x05, 0x06, -1, 0x03, 0x0042, 0x0086 },
+  { 0x05, 0x07, -1, 0x03, 0x0042, 0x00c6 },
+  { 0x05, 0x08, -1, 0x03, 0x0042, 0x0146 },
+  { 0x05, 0x09, -1, 0x03, 0x0042, 0x0246 },
+  { 0x05, 0x0a, -1, 0x03, 0x0042, 0x0446 },
+  { 0x05, 0x18, -1, 0x03, 0x0042, 0x0846 },
+  { 0x05, 0x05, -1, 0x03, 0x0062, 0x0046 },
+  { 0x05, 0x05, -1, 0x03, 0x0062, 0x0066 },
+  { 0x05, 0x06, -1, 0x03, 0x0062, 0x0086 },
+  { 0x05, 0x07, -1, 0x03, 0x0062, 0x00c6 },
+  { 0x05, 0x08, -1, 0x03, 0x0062, 0x0146 },
+  { 0x05, 0x09, -1, 0x03, 0x0062, 0x0246 },
+  { 0x05, 0x0a, -1, 0x03, 0x0062, 0x0446 },
+  { 0x05, 0x18, -1, 0x03, 0x0062, 0x0846 },
+  { 0x06, 0x01, -1, 0x03, 0x0082, 0x000a },
+  { 0x06, 0x01, -1, 0x03, 0x0082, 0x000c },
+  { 0x06, 0x02, -1, 0x03, 0x0082, 0x000e },
+  { 0x06, 0x02, -1, 0x03, 0x0082, 0x0012 },
+  { 0x06, 0x03, -1, 0x03, 0x0082, 0x0016 },
+  { 0x06, 0x03, -1, 0x03, 0x0082, 0x001e },
+  { 0x06, 0x04, -1, 0x03, 0x0082, 0x0026 },
+  { 0x06, 0x04, -1, 0x03, 0x0082, 0x0036 },
+  { 0x07, 0x01, -1, 0x03, 0x00c2, 0x000a },
+  { 0x07, 0x01, -1, 0x03, 0x00c2, 0x000c },
+  { 0x07, 0x02, -1, 0x03, 0x00c2, 0x000e },
+  { 0x07, 0x02, -1, 0x03, 0x00c2, 0x0012 },
+  { 0x07, 0x03, -1, 0x03, 0x00c2, 0x0016 },
+  { 0x07, 0x03, -1, 0x03, 0x00c2, 0x001e },
+  { 0x07, 0x04, -1, 0x03, 0x00c2, 0x0026 },
+  { 0x07, 0x04, -1, 0x03, 0x00c2, 0x0036 },
+  { 0x08, 0x01, -1, 0x03, 0x0142, 0x000a },
+  { 0x08, 0x01, -1, 0x03, 0x0142, 0x000c },
+  { 0x08, 0x02, -1, 0x03, 0x0142, 0x000e },
+  { 0x08, 0x02, -1, 0x03, 0x0142, 0x0012 },
+  { 0x08, 0x03, -1, 0x03, 0x0142, 0x0016 },
+  { 0x08, 0x03, -1, 0x03, 0x0142, 0x001e },
+  { 0x08, 0x04, -1, 0x03, 0x0142, 0x0026 },
+  { 0x08, 0x04, -1, 0x03, 0x0142, 0x0036 },
+  { 0x09, 0x01, -1, 0x03, 0x0242, 0x000a },
+  { 0x09, 0x01, -1, 0x03, 0x0242, 0x000c },
+  { 0x09, 0x02, -1, 0x03, 0x0242, 0x000e },
+  { 0x09, 0x02, -1, 0x03, 0x0242, 0x0012 },
+  { 0x09, 0x03, -1, 0x03, 0x0242, 0x0016 },
+  { 0x09, 0x03, -1, 0x03, 0x0242, 0x001e },
+  { 0x09, 0x04, -1, 0x03, 0x0242, 0x0026 },
+  { 0x09, 0x04, -1, 0x03, 0x0242, 0x0036 },
+  { 0x0a, 0x01, -1, 0x03, 0x0442, 0x000a },
+  { 0x0a, 0x01, -1, 0x03, 0x0442, 0x000c },
+  { 0x0a, 0x02, -1, 0x03, 0x0442, 0x000e },
+  { 0x0a, 0x02, -1, 0x03, 0x0442, 0x0012 },
+  { 0x0a, 0x03, -1, 0x03, 0x0442, 0x0016 },
+  { 0x0a, 0x03, -1, 0x03, 0x0442, 0x001e },
+  { 0x0a, 0x04, -1, 0x03, 0x0442, 0x0026 },
+  { 0x0a, 0x04, -1, 0x03, 0x0442, 0x0036 },
+  { 0x0c, 0x01, -1, 0x03, 0x0842, 0x000a },
+  { 0x0c, 0x01, -1, 0x03, 0x0842, 0x000c },
+  { 0x0c, 0x02, -1, 0x03, 0x0842, 0x000e },
+  { 0x0c, 0x02, -1, 0x03, 0x0842, 0x0012 },
+  { 0x0c, 0x03, -1, 0x03, 0x0842, 0x0016 },
+  { 0x0c, 0x03, -1, 0x03, 0x0842, 0x001e },
+  { 0x0c, 0x04, -1, 0x03, 0x0842, 0x0026 },
+  { 0x0c, 0x04, -1, 0x03, 0x0842, 0x0036 },
+  { 0x0e, 0x01, -1, 0x03, 0x1842, 0x000a },
+  { 0x0e, 0x01, -1, 0x03, 0x1842, 0x000c },
+  { 0x0e, 0x02, -1, 0x03, 0x1842, 0x000e },
+  { 0x0e, 0x02, -1, 0x03, 0x1842, 0x0012 },
+  { 0x0e, 0x03, -1, 0x03, 0x1842, 0x0016 },
+  { 0x0e, 0x03, -1, 0x03, 0x1842, 0x001e },
+  { 0x0e, 0x04, -1, 0x03, 0x1842, 0x0026 },
+  { 0x0e, 0x04, -1, 0x03, 0x1842, 0x0036 },
+  { 0x18, 0x01, -1, 0x03, 0x5842, 0x000a },
+  { 0x18, 0x01, -1, 0x03, 0x5842, 0x000c },
+  { 0x18, 0x02, -1, 0x03, 0x5842, 0x000e },
+  { 0x18, 0x02, -1, 0x03, 0x5842, 0x0012 },
+  { 0x18, 0x03, -1, 0x03, 0x5842, 0x0016 },
+  { 0x18, 0x03, -1, 0x03, 0x5842, 0x001e },
+  { 0x18, 0x04, -1, 0x03, 0x5842, 0x0026 },
+  { 0x18, 0x04, -1, 0x03, 0x5842, 0x0036 },
+  { 0x06, 0x05, -1, 0x03, 0x0082, 0x0046 },
+  { 0x06, 0x05, -1, 0x03, 0x0082, 0x0066 },
+  { 0x06, 0x06, -1, 0x03, 0x0082, 0x0086 },
+  { 0x06, 0x07, -1, 0x03, 0x0082, 0x00c6 },
+  { 0x06, 0x08, -1, 0x03, 0x0082, 0x0146 },
+  { 0x06, 0x09, -1, 0x03, 0x0082, 0x0246 },
+  { 0x06, 0x0a, -1, 0x03, 0x0082, 0x0446 },
+  { 0x06, 0x18, -1, 0x03, 0x0082, 0x0846 },
+  { 0x07, 0x05, -1, 0x03, 0x00c2, 0x0046 },
+  { 0x07, 0x05, -1, 0x03, 0x00c2, 0x0066 },
+  { 0x07, 0x06, -1, 0x03, 0x00c2, 0x0086 },
+  { 0x07, 0x07, -1, 0x03, 0x00c2, 0x00c6 },
+  { 0x07, 0x08, -1, 0x03, 0x00c2, 0x0146 },
+  { 0x07, 0x09, -1, 0x03, 0x00c2, 0x0246 },
+  { 0x07, 0x0a, -1, 0x03, 0x00c2, 0x0446 },
+  { 0x07, 0x18, -1, 0x03, 0x00c2, 0x0846 },
+  { 0x08, 0x05, -1, 0x03, 0x0142, 0x0046 },
+  { 0x08, 0x05, -1, 0x03, 0x0142, 0x0066 },
+  { 0x08, 0x06, -1, 0x03, 0x0142, 0x0086 },
+  { 0x08, 0x07, -1, 0x03, 0x0142, 0x00c6 },
+  { 0x08, 0x08, -1, 0x03, 0x0142, 0x0146 },
+  { 0x08, 0x09, -1, 0x03, 0x0142, 0x0246 },
+  { 0x08, 0x0a, -1, 0x03, 0x0142, 0x0446 },
+  { 0x08, 0x18, -1, 0x03, 0x0142, 0x0846 },
+  { 0x09, 0x05, -1, 0x03, 0x0242, 0x0046 },
+  { 0x09, 0x05, -1, 0x03, 0x0242, 0x0066 },
+  { 0x09, 0x06, -1, 0x03, 0x0242, 0x0086 },
+  { 0x09, 0x07, -1, 0x03, 0x0242, 0x00c6 },
+  { 0x09, 0x08, -1, 0x03, 0x0242, 0x0146 },
+  { 0x09, 0x09, -1, 0x03, 0x0242, 0x0246 },
+  { 0x09, 0x0a, -1, 0x03, 0x0242, 0x0446 },
+  { 0x09, 0x18, -1, 0x03, 0x0242, 0x0846 },
+  { 0x0a, 0x05, -1, 0x03, 0x0442, 0x0046 },
+  { 0x0a, 0x05, -1, 0x03, 0x0442, 0x0066 },
+  { 0x0a, 0x06, -1, 0x03, 0x0442, 0x0086 },
+  { 0x0a, 0x07, -1, 0x03, 0x0442, 0x00c6 },
+  { 0x0a, 0x08, -1, 0x03, 0x0442, 0x0146 },
+  { 0x0a, 0x09, -1, 0x03, 0x0442, 0x0246 },
+  { 0x0a, 0x0a, -1, 0x03, 0x0442, 0x0446 },
+  { 0x0a, 0x18, -1, 0x03, 0x0442, 0x0846 },
+  { 0x0c, 0x05, -1, 0x03, 0x0842, 0x0046 },
+  { 0x0c, 0x05, -1, 0x03, 0x0842, 0x0066 },
+  { 0x0c, 0x06, -1, 0x03, 0x0842, 0x0086 },
+  { 0x0c, 0x07, -1, 0x03, 0x0842, 0x00c6 },
+  { 0x0c, 0x08, -1, 0x03, 0x0842, 0x0146 },
+  { 0x0c, 0x09, -1, 0x03, 0x0842, 0x0246 },
+  { 0x0c, 0x0a, -1, 0x03, 0x0842, 0x0446 },
+  { 0x0c, 0x18, -1, 0x03, 0x0842, 0x0846 },
+  { 0x0e, 0x05, -1, 0x03, 0x1842, 0x0046 },
+  { 0x0e, 0x05, -1, 0x03, 0x1842, 0x0066 },
+  { 0x0e, 0x06, -1, 0x03, 0x1842, 0x0086 },
+  { 0x0e, 0x07, -1, 0x03, 0x1842, 0x00c6 },
+  { 0x0e, 0x08, -1, 0x03, 0x1842, 0x0146 },
+  { 0x0e, 0x09, -1, 0x03, 0x1842, 0x0246 },
+  { 0x0e, 0x0a, -1, 0x03, 0x1842, 0x0446 },
+  { 0x0e, 0x18, -1, 0x03, 0x1842, 0x0846 },
+  { 0x18, 0x05, -1, 0x03, 0x5842, 0x0046 },
+  { 0x18, 0x05, -1, 0x03, 0x5842, 0x0066 },
+  { 0x18, 0x06, -1, 0x03, 0x5842, 0x0086 },
+  { 0x18, 0x07, -1, 0x03, 0x5842, 0x00c6 },
+  { 0x18, 0x08, -1, 0x03, 0x5842, 0x0146 },
+  { 0x18, 0x09, -1, 0x03, 0x5842, 0x0246 },
+  { 0x18, 0x0a, -1, 0x03, 0x5842, 0x0446 },
+  { 0x18, 0x18, -1, 0x03, 0x5842, 0x0846 },
+};
+
+#endif  /* BROTLI_DEC_PREFIX_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/state.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/state.c
new file mode 100644
index 0000000000..be6a26680b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/state.c
@@ -0,0 +1,183 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include "state.h"
+
+#include <stdlib.h>  /* free, malloc */
+
+#include <brotli/types.h>
+
+#include "../common/dictionary.h"
+#include "huffman.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+BROTLI_BOOL BrotliDecoderStateInit(BrotliDecoderState* s,
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {
+  if (!alloc_func) {
+    s->alloc_func = BrotliDefaultAllocFunc;
+    s->free_func = BrotliDefaultFreeFunc;
+    s->memory_manager_opaque = 0;
+  } else {
+    s->alloc_func = alloc_func;
+    s->free_func = free_func;
+    s->memory_manager_opaque = opaque;
+  }
+
+  s->error_code = 0; /* BROTLI_DECODER_NO_ERROR */
+
+  BrotliInitBitReader(&s->br);
+  s->state = BROTLI_STATE_UNINITED;
+  s->large_window = 0;
+  s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_NONE;
+  s->substate_uncompressed = BROTLI_STATE_UNCOMPRESSED_NONE;
+  s->substate_decode_uint8 = BROTLI_STATE_DECODE_UINT8_NONE;
+  s->substate_read_block_length = BROTLI_STATE_READ_BLOCK_LENGTH_NONE;
+
+  s->buffer_length = 0;
+  s->loop_counter = 0;
+  s->pos = 0;
+  s->rb_roundtrips = 0;
+  s->partial_pos_out = 0;
+  s->used_input = 0;
+
+  s->block_type_trees = NULL;
+  s->block_len_trees = NULL;
+  s->ringbuffer = NULL;
+  s->ringbuffer_size = 0;
+  s->new_ringbuffer_size = 0;
+  s->ringbuffer_mask = 0;
+
+  s->context_map = NULL;
+  s->context_modes = NULL;
+  s->dist_context_map = NULL;
+  s->context_map_slice = NULL;
+  s->dist_context_map_slice = NULL;
+
+  s->literal_hgroup.codes = NULL;
+  s->literal_hgroup.htrees = NULL;
+  s->insert_copy_hgroup.codes = NULL;
+  s->insert_copy_hgroup.htrees = NULL;
+  s->distance_hgroup.codes = NULL;
+  s->distance_hgroup.htrees = NULL;
+
+  s->is_last_metablock = 0;
+  s->is_uncompressed = 0;
+  s->is_metadata = 0;
+  s->should_wrap_ringbuffer = 0;
+  s->canny_ringbuffer_allocation = 1;
+
+  s->window_bits = 0;
+  s->max_distance = 0;
+  s->dist_rb[0] = 16;
+  s->dist_rb[1] = 15;
+  s->dist_rb[2] = 11;
+  s->dist_rb[3] = 4;
+  s->dist_rb_idx = 0;
+  s->block_type_trees = NULL;
+  s->block_len_trees = NULL;
+
+  s->mtf_upper_bound = 63;
+
+  s->compound_dictionary = NULL;
+  s->dictionary =
+      BrotliSharedDictionaryCreateInstance(alloc_func, free_func, opaque);
+  if (!s->dictionary) return BROTLI_FALSE;
+
+  s->metadata_start_func = NULL;
+  s->metadata_chunk_func = NULL;
+  s->metadata_callback_opaque = 0;
+
+  return BROTLI_TRUE;
+}
+
+void BrotliDecoderStateMetablockBegin(BrotliDecoderState* s) {
+  s->meta_block_remaining_len = 0;
+  s->block_length[0] = BROTLI_BLOCK_SIZE_CAP;
+  s->block_length[1] = BROTLI_BLOCK_SIZE_CAP;
+  s->block_length[2] = BROTLI_BLOCK_SIZE_CAP;
+  s->num_block_types[0] = 1;
+  s->num_block_types[1] = 1;
+  s->num_block_types[2] = 1;
+  s->block_type_rb[0] = 1;
+  s->block_type_rb[1] = 0;
+  s->block_type_rb[2] = 1;
+  s->block_type_rb[3] = 0;
+  s->block_type_rb[4] = 1;
+  s->block_type_rb[5] = 0;
+  s->context_map = NULL;
+  s->context_modes = NULL;
+  s->dist_context_map = NULL;
+  s->context_map_slice = NULL;
+  s->literal_htree = NULL;
+  s->dist_context_map_slice = NULL;
+  s->dist_htree_index = 0;
+  s->context_lookup = NULL;
+  s->literal_hgroup.codes = NULL;
+  s->literal_hgroup.htrees = NULL;
+  s->insert_copy_hgroup.codes = NULL;
+  s->insert_copy_hgroup.htrees = NULL;
+  s->distance_hgroup.codes = NULL;
+  s->distance_hgroup.htrees = NULL;
+}
+
+void BrotliDecoderStateCleanupAfterMetablock(BrotliDecoderState* s) {
+  BROTLI_DECODER_FREE(s, s->context_modes);
+  BROTLI_DECODER_FREE(s, s->context_map);
+  BROTLI_DECODER_FREE(s, s->dist_context_map);
+  BROTLI_DECODER_FREE(s, s->literal_hgroup.htrees);
+  BROTLI_DECODER_FREE(s, s->insert_copy_hgroup.htrees);
+  BROTLI_DECODER_FREE(s, s->distance_hgroup.htrees);
+}
+
+#ifdef BROTLI_REPORTING
+/* When BROTLI_REPORTING is defined extra reporting module have to be linked. */
+void BrotliDecoderOnFinish(const BrotliDecoderState* s);
+#define BROTLI_DECODER_ON_FINISH(s) BrotliDecoderOnFinish(s);
+#else
+#if !defined(BROTLI_DECODER_ON_FINISH)
+#define BROTLI_DECODER_ON_FINISH(s) (void)(s);
+#endif
+#endif
+
+void BrotliDecoderStateCleanup(BrotliDecoderState* s) {
+  BrotliDecoderStateCleanupAfterMetablock(s);
+
+  BROTLI_DECODER_ON_FINISH(s);
+
+  BROTLI_DECODER_FREE(s, s->compound_dictionary);
+  BrotliSharedDictionaryDestroyInstance(s->dictionary);
+  s->dictionary = NULL;
+  BROTLI_DECODER_FREE(s, s->ringbuffer);
+  BROTLI_DECODER_FREE(s, s->block_type_trees);
+}
+
+BROTLI_BOOL BrotliDecoderHuffmanTreeGroupInit(BrotliDecoderState* s,
+    HuffmanTreeGroup* group, brotli_reg_t alphabet_size_max,
+    brotli_reg_t alphabet_size_limit, brotli_reg_t ntrees) {
+  /* 376 = 256 (1-st level table) + 4 + 7 + 15 + 31 + 63 (2-nd level mix-tables)
+     This number is discovered "unlimited" "enough" calculator; it is actually
+     a wee bigger than required in several cases (especially for alphabets with
+     less than 16 symbols). */
+  const size_t max_table_size = alphabet_size_limit + 376;
+  const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size;
+  const size_t htree_size = sizeof(HuffmanCode*) * ntrees;
+  /* Pointer alignment is, hopefully, wider than sizeof(HuffmanCode). */
+  HuffmanCode** p = (HuffmanCode**)BROTLI_DECODER_ALLOC(s,
+      code_size + htree_size);
+  group->alphabet_size_max = (uint16_t)alphabet_size_max;
+  group->alphabet_size_limit = (uint16_t)alphabet_size_limit;
+  group->num_htrees = (uint16_t)ntrees;
+  group->htrees = p;
+  group->codes = (HuffmanCode*)(&p[ntrees]);
+  return !!p;
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/state.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/state.h
new file mode 100644
index 0000000000..fd250b6842
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/dec/state.h
@@ -0,0 +1,400 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Brotli state for partial streaming decoding. */
+
+#ifndef BROTLI_DEC_STATE_H_
+#define BROTLI_DEC_STATE_H_
+
+#include <brotli/decode.h>
+#include <brotli/shared_dictionary.h>
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "../common/transform.h"
+#include "bit_reader.h"
+#include "huffman.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* Graphviz diagram that describes state transitions:
+
+digraph States {
+  graph [compound=true]
+  concentrate=true
+  node [shape="box"]
+
+  UNINITED -> {LARGE_WINDOW_BITS -> INITIALIZE}
+  subgraph cluster_metablock_workflow {
+    style="rounded"
+    label=< <B>METABLOCK CYCLE</B> >
+    METABLOCK_BEGIN -> METABLOCK_HEADER
+    METABLOCK_HEADER:sw -> METADATA
+    METABLOCK_HEADER:s -> UNCOMPRESSED
+    METABLOCK_HEADER:se -> METABLOCK_DONE:ne
+    METADATA:s -> METABLOCK_DONE:w
+    UNCOMPRESSED:s -> METABLOCK_DONE:n
+    METABLOCK_DONE:e -> METABLOCK_BEGIN:e [constraint="false"]
+  }
+  INITIALIZE -> METABLOCK_BEGIN
+  METABLOCK_DONE -> DONE
+
+  subgraph cluster_compressed_metablock {
+    style="rounded"
+    label=< <B>COMPRESSED METABLOCK</B> >
+
+    subgraph cluster_command {
+      style="rounded"
+      label=< <B>HOT LOOP</B> >
+
+      _METABLOCK_DONE_PORT_ [shape=point style=invis]
+
+      {
+        // Set different shape for nodes returning from "compressed metablock".
+        node [shape=invhouse]; CMD_INNER CMD_POST_DECODE_LITERALS;
+        CMD_POST_WRAP_COPY; CMD_INNER_WRITE; CMD_POST_WRITE_1;
+      }
+
+      CMD_BEGIN -> CMD_INNER -> CMD_POST_DECODE_LITERALS -> CMD_POST_WRAP_COPY
+
+      // IO ("write") nodes are not in the hot loop!
+      CMD_INNER_WRITE [style=dashed]
+      CMD_INNER -> CMD_INNER_WRITE
+      CMD_POST_WRITE_1 [style=dashed]
+      CMD_POST_DECODE_LITERALS -> CMD_POST_WRITE_1
+      CMD_POST_WRITE_2 [style=dashed]
+      CMD_POST_WRAP_COPY -> CMD_POST_WRITE_2
+
+      CMD_POST_WRITE_1 -> CMD_BEGIN:s [constraint="false"]
+      CMD_INNER_WRITE -> {CMD_INNER CMD_POST_DECODE_LITERALS}
+          [constraint="false"]
+      CMD_BEGIN:ne -> CMD_POST_DECODE_LITERALS [constraint="false"]
+      CMD_POST_WRAP_COPY -> CMD_BEGIN [constraint="false"]
+      CMD_POST_DECODE_LITERALS -> CMD_BEGIN:ne [constraint="false"]
+      CMD_POST_WRITE_2 -> CMD_POST_WRAP_COPY [constraint="false"]
+      {rank=same; CMD_BEGIN; CMD_INNER; CMD_POST_DECODE_LITERALS;
+          CMD_POST_WRAP_COPY}
+      {rank=same; CMD_INNER_WRITE; CMD_POST_WRITE_1; CMD_POST_WRITE_2}
+
+      {CMD_INNER CMD_POST_DECODE_LITERALS CMD_POST_WRAP_COPY} ->
+          _METABLOCK_DONE_PORT_ [style=invis]
+      {CMD_INNER_WRITE CMD_POST_WRITE_1} -> _METABLOCK_DONE_PORT_
+          [constraint="false" style=invis]
+    }
+
+    BEFORE_COMPRESSED_METABLOCK_HEADER:s -> HUFFMAN_CODE_0:n
+    HUFFMAN_CODE_0 -> HUFFMAN_CODE_1 -> HUFFMAN_CODE_2 -> HUFFMAN_CODE_3
+    HUFFMAN_CODE_0 -> METABLOCK_HEADER_2 -> CONTEXT_MODES -> CONTEXT_MAP_1
+    CONTEXT_MAP_1 -> CONTEXT_MAP_2 -> TREE_GROUP
+    TREE_GROUP -> BEFORE_COMPRESSED_METABLOCK_BODY:e
+    BEFORE_COMPRESSED_METABLOCK_BODY:s -> CMD_BEGIN:n
+
+    HUFFMAN_CODE_3:e -> HUFFMAN_CODE_0:ne [constraint="false"]
+    {rank=same; HUFFMAN_CODE_0; HUFFMAN_CODE_1; HUFFMAN_CODE_2; HUFFMAN_CODE_3}
+    {rank=same; METABLOCK_HEADER_2; CONTEXT_MODES; CONTEXT_MAP_1; CONTEXT_MAP_2;
+        TREE_GROUP}
+  }
+  METABLOCK_HEADER:e -> BEFORE_COMPRESSED_METABLOCK_HEADER:n
+
+  _METABLOCK_DONE_PORT_ -> METABLOCK_DONE:se
+      [constraint="false" ltail=cluster_command]
+
+  UNINITED [shape=Mdiamond];
+  DONE [shape=Msquare];
+}
+
+
+ */
+
+typedef enum {
+  BROTLI_STATE_UNINITED,
+  BROTLI_STATE_LARGE_WINDOW_BITS,
+  BROTLI_STATE_INITIALIZE,
+  BROTLI_STATE_METABLOCK_BEGIN,
+  BROTLI_STATE_METABLOCK_HEADER,
+  BROTLI_STATE_METABLOCK_HEADER_2,
+  BROTLI_STATE_CONTEXT_MODES,
+  BROTLI_STATE_COMMAND_BEGIN,
+  BROTLI_STATE_COMMAND_INNER,
+  BROTLI_STATE_COMMAND_POST_DECODE_LITERALS,
+  BROTLI_STATE_COMMAND_POST_WRAP_COPY,
+  BROTLI_STATE_UNCOMPRESSED,
+  BROTLI_STATE_METADATA,
+  BROTLI_STATE_COMMAND_INNER_WRITE,
+  BROTLI_STATE_METABLOCK_DONE,
+  BROTLI_STATE_COMMAND_POST_WRITE_1,
+  BROTLI_STATE_COMMAND_POST_WRITE_2,
+  BROTLI_STATE_BEFORE_COMPRESSED_METABLOCK_HEADER,
+  BROTLI_STATE_HUFFMAN_CODE_0,
+  BROTLI_STATE_HUFFMAN_CODE_1,
+  BROTLI_STATE_HUFFMAN_CODE_2,
+  BROTLI_STATE_HUFFMAN_CODE_3,
+  BROTLI_STATE_CONTEXT_MAP_1,
+  BROTLI_STATE_CONTEXT_MAP_2,
+  BROTLI_STATE_TREE_GROUP,
+  BROTLI_STATE_BEFORE_COMPRESSED_METABLOCK_BODY,
+  BROTLI_STATE_DONE
+} BrotliRunningState;
+
+typedef enum {
+  BROTLI_STATE_METABLOCK_HEADER_NONE,
+  BROTLI_STATE_METABLOCK_HEADER_EMPTY,
+  BROTLI_STATE_METABLOCK_HEADER_NIBBLES,
+  BROTLI_STATE_METABLOCK_HEADER_SIZE,
+  BROTLI_STATE_METABLOCK_HEADER_UNCOMPRESSED,
+  BROTLI_STATE_METABLOCK_HEADER_RESERVED,
+  BROTLI_STATE_METABLOCK_HEADER_BYTES,
+  BROTLI_STATE_METABLOCK_HEADER_METADATA
+} BrotliRunningMetablockHeaderState;
+
+typedef enum {
+  BROTLI_STATE_UNCOMPRESSED_NONE,
+  BROTLI_STATE_UNCOMPRESSED_WRITE
+} BrotliRunningUncompressedState;
+
+typedef enum {
+  BROTLI_STATE_TREE_GROUP_NONE,
+  BROTLI_STATE_TREE_GROUP_LOOP
+} BrotliRunningTreeGroupState;
+
+typedef enum {
+  BROTLI_STATE_CONTEXT_MAP_NONE,
+  BROTLI_STATE_CONTEXT_MAP_READ_PREFIX,
+  BROTLI_STATE_CONTEXT_MAP_HUFFMAN,
+  BROTLI_STATE_CONTEXT_MAP_DECODE,
+  BROTLI_STATE_CONTEXT_MAP_TRANSFORM
+} BrotliRunningContextMapState;
+
+typedef enum {
+  BROTLI_STATE_HUFFMAN_NONE,
+  BROTLI_STATE_HUFFMAN_SIMPLE_SIZE,
+  BROTLI_STATE_HUFFMAN_SIMPLE_READ,
+  BROTLI_STATE_HUFFMAN_SIMPLE_BUILD,
+  BROTLI_STATE_HUFFMAN_COMPLEX,
+  BROTLI_STATE_HUFFMAN_LENGTH_SYMBOLS
+} BrotliRunningHuffmanState;
+
+typedef enum {
+  BROTLI_STATE_DECODE_UINT8_NONE,
+  BROTLI_STATE_DECODE_UINT8_SHORT,
+  BROTLI_STATE_DECODE_UINT8_LONG
+} BrotliRunningDecodeUint8State;
+
+typedef enum {
+  BROTLI_STATE_READ_BLOCK_LENGTH_NONE,
+  BROTLI_STATE_READ_BLOCK_LENGTH_SUFFIX
+} BrotliRunningReadBlockLengthState;
+
+/* BrotliDecoderState addon, used for Compound Dictionary functionality. */
+typedef struct BrotliDecoderCompoundDictionary {
+  int num_chunks;
+  int total_size;
+  int br_index;
+  int br_offset;
+  int br_length;
+  int br_copied;
+  const uint8_t* chunks[16];
+  int chunk_offsets[16];
+  int block_bits;
+  uint8_t block_map[256];
+} BrotliDecoderCompoundDictionary;
+
+typedef struct BrotliMetablockHeaderArena {
+  BrotliRunningTreeGroupState substate_tree_group;
+  BrotliRunningContextMapState substate_context_map;
+  BrotliRunningHuffmanState substate_huffman;
+
+  brotli_reg_t sub_loop_counter;
+
+  brotli_reg_t repeat_code_len;
+  brotli_reg_t prev_code_len;
+
+  /* For ReadHuffmanCode. */
+  brotli_reg_t symbol;
+  brotli_reg_t repeat;
+  brotli_reg_t space;
+
+  /* Huffman table for "histograms". */
+  HuffmanCode table[32];
+  /* List of heads of symbol chains. */
+  uint16_t* symbol_lists;
+  /* Storage from symbol_lists. */
+  uint16_t symbols_lists_array[BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1 +
+                               BROTLI_NUM_COMMAND_SYMBOLS];
+  /* Tails of symbol chains. */
+  int next_symbol[32];
+  uint8_t code_length_code_lengths[BROTLI_CODE_LENGTH_CODES];
+  /* Population counts for the code lengths. */
+  uint16_t code_length_histo[16];
+  /* TODO(eustas): +2 bytes padding */
+
+  /* For HuffmanTreeGroupDecode. */
+  int htree_index;
+  HuffmanCode* next;
+
+  /* For DecodeContextMap. */
+  brotli_reg_t context_index;
+  brotli_reg_t max_run_length_prefix;
+  brotli_reg_t code;
+  HuffmanCode context_map_table[BROTLI_HUFFMAN_MAX_SIZE_272];
+} BrotliMetablockHeaderArena;
+
+typedef struct BrotliMetablockBodyArena {
+  uint8_t dist_extra_bits[544];
+  brotli_reg_t dist_offset[544];
+} BrotliMetablockBodyArena;
+
+struct BrotliDecoderStateStruct {
+  BrotliRunningState state;
+
+  /* This counter is reused for several disjoint loops. */
+  int loop_counter;
+
+  BrotliBitReader br;
+
+  brotli_alloc_func alloc_func;
+  brotli_free_func free_func;
+  void* memory_manager_opaque;
+
+  /* Temporary storage for remaining input. Brotli stream format is designed in
+     a way, that 64 bits are enough to make progress in decoding. */
+  union {
+    uint64_t u64;
+    uint8_t u8[8];
+  } buffer;
+  brotli_reg_t buffer_length;
+
+  int pos;
+  int max_backward_distance;
+  int max_distance;
+  int ringbuffer_size;
+  int ringbuffer_mask;
+  int dist_rb_idx;
+  int dist_rb[4];
+  int error_code;
+  int meta_block_remaining_len;
+
+  uint8_t* ringbuffer;
+  uint8_t* ringbuffer_end;
+  HuffmanCode* htree_command;
+  const uint8_t* context_lookup;
+  uint8_t* context_map_slice;
+  uint8_t* dist_context_map_slice;
+
+  /* This ring buffer holds a few past copy distances that will be used by
+     some special distance codes. */
+  HuffmanTreeGroup literal_hgroup;
+  HuffmanTreeGroup insert_copy_hgroup;
+  HuffmanTreeGroup distance_hgroup;
+  HuffmanCode* block_type_trees;
+  HuffmanCode* block_len_trees;
+  /* This is true if the literal context map histogram type always matches the
+     block type. It is then not needed to keep the context (faster decoding). */
+  int trivial_literal_context;
+  /* Distance context is actual after command is decoded and before distance is
+     computed. After distance computation it is used as a temporary variable. */
+  int distance_context;
+  brotli_reg_t block_length[3];
+  brotli_reg_t block_length_index;
+  brotli_reg_t num_block_types[3];
+  brotli_reg_t block_type_rb[6];
+  brotli_reg_t distance_postfix_bits;
+  brotli_reg_t num_direct_distance_codes;
+  brotli_reg_t num_dist_htrees;
+  uint8_t* dist_context_map;
+  HuffmanCode* literal_htree;
+
+  /* For partial write operations. */
+  size_t rb_roundtrips;  /* how many times we went around the ring-buffer */
+  size_t partial_pos_out;  /* how much output to the user in total */
+
+  /* For InverseMoveToFrontTransform. */
+  brotli_reg_t mtf_upper_bound;
+  uint32_t mtf[64 + 1];
+
+  int copy_length;
+  int distance_code;
+
+  uint8_t dist_htree_index;
+  /* TODO(eustas): +3 bytes padding */
+
+  /* Less used attributes are at the end of this struct. */
+
+  brotli_decoder_metadata_start_func metadata_start_func;
+  brotli_decoder_metadata_chunk_func metadata_chunk_func;
+  void* metadata_callback_opaque;
+
+  /* For reporting. */
+  uint64_t used_input;  /* how many bytes of input are consumed */
+
+  /* States inside function calls. */
+  BrotliRunningMetablockHeaderState substate_metablock_header;
+  BrotliRunningUncompressedState substate_uncompressed;
+  BrotliRunningDecodeUint8State substate_decode_uint8;
+  BrotliRunningReadBlockLengthState substate_read_block_length;
+
+  int new_ringbuffer_size;
+  /* TODO(eustas): +4 bytes padding */
+
+  unsigned int is_last_metablock : 1;
+  unsigned int is_uncompressed : 1;
+  unsigned int is_metadata : 1;
+  unsigned int should_wrap_ringbuffer : 1;
+  unsigned int canny_ringbuffer_allocation : 1;
+  unsigned int large_window : 1;
+  unsigned int window_bits : 6;
+  unsigned int size_nibbles : 8;
+  /* TODO(eustas): +12 bits padding */
+
+  brotli_reg_t num_literal_htrees;
+  uint8_t* context_map;
+  uint8_t* context_modes;
+
+  BrotliSharedDictionary* dictionary;
+  BrotliDecoderCompoundDictionary* compound_dictionary;
+
+  uint32_t trivial_literal_contexts[8];  /* 256 bits */
+
+  union {
+    BrotliMetablockHeaderArena header;
+    BrotliMetablockBodyArena body;
+  } arena;
+};
+
+typedef struct BrotliDecoderStateStruct BrotliDecoderStateInternal;
+#define BrotliDecoderState BrotliDecoderStateInternal
+
+BROTLI_INTERNAL BROTLI_BOOL BrotliDecoderStateInit(BrotliDecoderState* s,
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);
+BROTLI_INTERNAL void BrotliDecoderStateCleanup(BrotliDecoderState* s);
+BROTLI_INTERNAL void BrotliDecoderStateMetablockBegin(BrotliDecoderState* s);
+BROTLI_INTERNAL void BrotliDecoderStateCleanupAfterMetablock(
+    BrotliDecoderState* s);
+BROTLI_INTERNAL BROTLI_BOOL BrotliDecoderHuffmanTreeGroupInit(
+    BrotliDecoderState* s, HuffmanTreeGroup* group,
+    brotli_reg_t alphabet_size_max, brotli_reg_t alphabet_size_limit,
+    brotli_reg_t ntrees);
+
+#define BROTLI_DECODER_ALLOC(S, L) S->alloc_func(S->memory_manager_opaque, L)
+
+#define BROTLI_DECODER_FREE(S, X) {          \
+  S->free_func(S->memory_manager_opaque, X); \
+  X = NULL;                                  \
+}
+
+/* Literal/Command/Distance block size maximum; same as maximum metablock size;
+   used as block size when there is no block switching. */
+#define BROTLI_BLOCK_SIZE_CAP (1U << 24)
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_DEC_STATE_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references.c
new file mode 100644
index 0000000000..f600e6452f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references.c
@@ -0,0 +1,207 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Function to find backward reference copies. */
+
+#include "backward_references.h"
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "command.h"
+#include "compound_dictionary.h"
+#include "dictionary_hash.h"
+#include "encoder_dict.h"
+#include "memory.h"
+#include "quality.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static BROTLI_INLINE size_t ComputeDistanceCode(size_t distance,
+                                                size_t max_distance,
+                                                const int* dist_cache) {
+  if (distance <= max_distance) {
+    size_t distance_plus_3 = distance + 3;
+    size_t offset0 = distance_plus_3 - (size_t)dist_cache[0];
+    size_t offset1 = distance_plus_3 - (size_t)dist_cache[1];
+    if (distance == (size_t)dist_cache[0]) {
+      return 0;
+    } else if (distance == (size_t)dist_cache[1]) {
+      return 1;
+    } else if (offset0 < 7) {
+      return (0x9750468 >> (4 * offset0)) & 0xF;
+    } else if (offset1 < 7) {
+      return (0xFDB1ACE >> (4 * offset1)) & 0xF;
+    } else if (distance == (size_t)dist_cache[2]) {
+      return 2;
+    } else if (distance == (size_t)dist_cache[3]) {
+      return 3;
+    }
+  }
+  return distance + BROTLI_NUM_DISTANCE_SHORT_CODES - 1;
+}
+
+#define EXPAND_CAT(a, b) CAT(a, b)
+#define CAT(a, b) a ## b
+#define FN(X) EXPAND_CAT(X, HASHER())
+#define EXPORT_FN(X) EXPAND_CAT(X, EXPAND_CAT(PREFIX(), HASHER()))
+
+#define PREFIX() N
+#define ENABLE_COMPOUND_DICTIONARY 0
+
+#define HASHER() H2
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H3
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H4
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H5
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H6
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H40
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H41
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H42
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H54
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H35
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H55
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#define HASHER() H65
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#undef ENABLE_COMPOUND_DICTIONARY
+#undef PREFIX
+#define PREFIX() D
+#define ENABLE_COMPOUND_DICTIONARY 1
+
+#define HASHER() H5
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+#define HASHER() H6
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+#define HASHER() H40
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+#define HASHER() H41
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+#define HASHER() H42
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+#define HASHER() H55
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+#define HASHER() H65
+/* NOLINTNEXTLINE(build/include) */
+#include "backward_references_inc.h"
+#undef HASHER
+
+#undef ENABLE_COMPOUND_DICTIONARY
+#undef PREFIX
+
+#undef EXPORT_FN
+#undef FN
+#undef CAT
+#undef EXPAND_CAT
+
+void BrotliCreateBackwardReferences(size_t num_bytes,
+    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    ContextLut literal_context_lut, const BrotliEncoderParams* params,
+    Hasher* hasher, int* dist_cache, size_t* last_insert_len,
+    Command* commands, size_t* num_commands, size_t* num_literals) {
+  if (params->dictionary.compound.num_chunks != 0) {
+    switch (params->hasher.type) {
+#define CASE_(N)                                                    \
+      case N:                                                       \
+        CreateBackwardReferencesDH ## N(num_bytes,                  \
+            position, ringbuffer, ringbuffer_mask,                  \
+            literal_context_lut, params, hasher, dist_cache,        \
+            last_insert_len, commands, num_commands, num_literals); \
+        return;
+      CASE_(5)
+      CASE_(6)
+      CASE_(40)
+      CASE_(41)
+      CASE_(42)
+      CASE_(55)
+      CASE_(65)
+#undef CASE_
+      default:
+        BROTLI_DCHECK(false);
+        break;
+    }
+  }
+
+  switch (params->hasher.type) {
+#define CASE_(N)                                                  \
+    case N:                                                       \
+      CreateBackwardReferencesNH ## N(num_bytes,                  \
+          position, ringbuffer, ringbuffer_mask,                  \
+          literal_context_lut, params, hasher, dist_cache,        \
+          last_insert_len, commands, num_commands, num_literals); \
+      return;
+    FOR_GENERIC_HASHERS(CASE_)
+#undef CASE_
+    default:
+      BROTLI_DCHECK(false);
+      break;
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references.h
new file mode 100644
index 0000000000..20fb98a4d8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references.h
@@ -0,0 +1,40 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Function to find backward reference copies. */
+
+#ifndef BROTLI_ENC_BACKWARD_REFERENCES_H_
+#define BROTLI_ENC_BACKWARD_REFERENCES_H_
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/context.h"
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "command.h"
+#include "hash.h"
+#include "quality.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* "commands" points to the next output command to write to, "*num_commands" is
+   initially the total amount of commands output by previous
+   CreateBackwardReferences calls, and must be incremented by the amount written
+   by this call. */
+BROTLI_INTERNAL void BrotliCreateBackwardReferences(size_t num_bytes,
+    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    ContextLut literal_context_lut, const BrotliEncoderParams* params,
+    Hasher* hasher, int* dist_cache, size_t* last_insert_len,
+    Command* commands, size_t* num_commands, size_t* num_literals);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_BACKWARD_REFERENCES_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references_hq.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references_hq.c
new file mode 100644
index 0000000000..6325032e1c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references_hq.c
@@ -0,0 +1,939 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Function to find backward reference copies. */
+
+#include "backward_references_hq.h"
+
+#include <string.h>  /* memcpy, memset */
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+#include "command.h"
+#include "compound_dictionary.h"
+#include "encoder_dict.h"
+#include "fast_log.h"
+#include "find_match_length.h"
+#include "literal_cost.h"
+#include "memory.h"
+#include "params.h"
+#include "prefix.h"
+#include "quality.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* BrotliCalculateDistanceCodeLimit(BROTLI_MAX_ALLOWED_DISTANCE, 3, 120). */
+#define BROTLI_MAX_EFFECTIVE_DISTANCE_ALPHABET_SIZE 544
+
+static const float kInfinity = 1.7e38f;  /* ~= 2 ^ 127 */
+
+static const uint32_t kDistanceCacheIndex[] = {
+  0, 1, 2, 3, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1,
+};
+static const int kDistanceCacheOffset[] = {
+  0, 0, 0, 0, -1, 1, -2, 2, -3, 3, -1, 1, -2, 2, -3, 3
+};
+
+void BrotliInitZopfliNodes(ZopfliNode* array, size_t length) {
+  ZopfliNode stub;
+  size_t i;
+  stub.length = 1;
+  stub.distance = 0;
+  stub.dcode_insert_length = 0;
+  stub.u.cost = kInfinity;
+  for (i = 0; i < length; ++i) array[i] = stub;
+}
+
+static BROTLI_INLINE uint32_t ZopfliNodeCopyLength(const ZopfliNode* self) {
+  return self->length & 0x1FFFFFF;
+}
+
+static BROTLI_INLINE uint32_t ZopfliNodeLengthCode(const ZopfliNode* self) {
+  const uint32_t modifier = self->length >> 25;
+  return ZopfliNodeCopyLength(self) + 9u - modifier;
+}
+
+static BROTLI_INLINE uint32_t ZopfliNodeCopyDistance(const ZopfliNode* self) {
+  return self->distance;
+}
+
+static BROTLI_INLINE uint32_t ZopfliNodeDistanceCode(const ZopfliNode* self) {
+  const uint32_t short_code = self->dcode_insert_length >> 27;
+  return short_code == 0 ?
+      ZopfliNodeCopyDistance(self) + BROTLI_NUM_DISTANCE_SHORT_CODES - 1 :
+      short_code - 1;
+}
+
+static BROTLI_INLINE uint32_t ZopfliNodeCommandLength(const ZopfliNode* self) {
+  return ZopfliNodeCopyLength(self) + (self->dcode_insert_length & 0x7FFFFFF);
+}
+
+/* Temporary data for ZopfliCostModelSetFromCommands. */
+typedef struct ZopfliCostModelArena {
+  uint32_t histogram_literal[BROTLI_NUM_LITERAL_SYMBOLS];
+  uint32_t histogram_cmd[BROTLI_NUM_COMMAND_SYMBOLS];
+  uint32_t histogram_dist[BROTLI_MAX_EFFECTIVE_DISTANCE_ALPHABET_SIZE];
+  float cost_literal[BROTLI_NUM_LITERAL_SYMBOLS];
+} ZopfliCostModelArena;
+
+/* Histogram based cost model for zopflification. */
+typedef struct ZopfliCostModel {
+  /* The insert and copy length symbols. */
+  float cost_cmd_[BROTLI_NUM_COMMAND_SYMBOLS];
+  float* cost_dist_;
+  uint32_t distance_histogram_size;
+  /* Cumulative costs of literals per position in the stream. */
+  float* literal_costs_;
+  float min_cost_cmd_;
+  size_t num_bytes_;
+
+  /* Temporary data. */
+  union {
+    size_t literal_histograms[3 * 256];
+    ZopfliCostModelArena arena;
+  };
+} ZopfliCostModel;
+
+static void InitZopfliCostModel(
+    MemoryManager* m, ZopfliCostModel* self, const BrotliDistanceParams* dist,
+    size_t num_bytes) {
+  self->num_bytes_ = num_bytes;
+  self->literal_costs_ = BROTLI_ALLOC(m, float, num_bytes + 2);
+  self->cost_dist_ = BROTLI_ALLOC(m, float, dist->alphabet_size_limit);
+  self->distance_histogram_size = dist->alphabet_size_limit;
+  if (BROTLI_IS_OOM(m)) return;
+}
+
+static void CleanupZopfliCostModel(MemoryManager* m, ZopfliCostModel* self) {
+  BROTLI_FREE(m, self->literal_costs_);
+  BROTLI_FREE(m, self->cost_dist_);
+}
+
+static void SetCost(const uint32_t* histogram, size_t histogram_size,
+                    BROTLI_BOOL literal_histogram, float* cost) {
+  size_t sum = 0;
+  size_t missing_symbol_sum;
+  float log2sum;
+  float missing_symbol_cost;
+  size_t i;
+  for (i = 0; i < histogram_size; i++) {
+    sum += histogram[i];
+  }
+  log2sum = (float)FastLog2(sum);
+  missing_symbol_sum = sum;
+  if (!literal_histogram) {
+    for (i = 0; i < histogram_size; i++) {
+      if (histogram[i] == 0) missing_symbol_sum++;
+    }
+  }
+  missing_symbol_cost = (float)FastLog2(missing_symbol_sum) + 2;
+  for (i = 0; i < histogram_size; i++) {
+    if (histogram[i] == 0) {
+      cost[i] = missing_symbol_cost;
+      continue;
+    }
+
+    /* Shannon bits for this symbol. */
+    cost[i] = log2sum - (float)FastLog2(histogram[i]);
+
+    /* Cannot be coded with less than 1 bit */
+    if (cost[i] < 1) cost[i] = 1;
+  }
+}
+
+static void ZopfliCostModelSetFromCommands(ZopfliCostModel* self,
+                                           size_t position,
+                                           const uint8_t* ringbuffer,
+                                           size_t ringbuffer_mask,
+                                           const Command* commands,
+                                           size_t num_commands,
+                                           size_t last_insert_len) {
+  ZopfliCostModelArena* arena = &self->arena;
+  size_t pos = position - last_insert_len;
+  float min_cost_cmd = kInfinity;
+  size_t i;
+  float* cost_cmd = self->cost_cmd_;
+
+  memset(arena->histogram_literal, 0, sizeof(arena->histogram_literal));
+  memset(arena->histogram_cmd, 0, sizeof(arena->histogram_cmd));
+  memset(arena->histogram_dist, 0, sizeof(arena->histogram_dist));
+
+  for (i = 0; i < num_commands; i++) {
+    size_t inslength = commands[i].insert_len_;
+    size_t copylength = CommandCopyLen(&commands[i]);
+    size_t distcode = commands[i].dist_prefix_ & 0x3FF;
+    size_t cmdcode = commands[i].cmd_prefix_;
+    size_t j;
+
+    arena->histogram_cmd[cmdcode]++;
+    if (cmdcode >= 128) arena->histogram_dist[distcode]++;
+
+    for (j = 0; j < inslength; j++) {
+      arena->histogram_literal[ringbuffer[(pos + j) & ringbuffer_mask]]++;
+    }
+
+    pos += inslength + copylength;
+  }
+
+  SetCost(arena->histogram_literal, BROTLI_NUM_LITERAL_SYMBOLS, BROTLI_TRUE,
+          arena->cost_literal);
+  SetCost(arena->histogram_cmd, BROTLI_NUM_COMMAND_SYMBOLS, BROTLI_FALSE,
+          cost_cmd);
+  SetCost(arena->histogram_dist, self->distance_histogram_size, BROTLI_FALSE,
+          self->cost_dist_);
+
+  for (i = 0; i < BROTLI_NUM_COMMAND_SYMBOLS; ++i) {
+    min_cost_cmd = BROTLI_MIN(float, min_cost_cmd, cost_cmd[i]);
+  }
+  self->min_cost_cmd_ = min_cost_cmd;
+
+  {
+    float* literal_costs = self->literal_costs_;
+    float literal_carry = 0.0;
+    size_t num_bytes = self->num_bytes_;
+    literal_costs[0] = 0.0;
+    for (i = 0; i < num_bytes; ++i) {
+      literal_carry +=
+          arena->cost_literal[ringbuffer[(position + i) & ringbuffer_mask]];
+      literal_costs[i + 1] = literal_costs[i] + literal_carry;
+      literal_carry -= literal_costs[i + 1] - literal_costs[i];
+    }
+  }
+}
+
+static void ZopfliCostModelSetFromLiteralCosts(ZopfliCostModel* self,
+                                               size_t position,
+                                               const uint8_t* ringbuffer,
+                                               size_t ringbuffer_mask) {
+  float* literal_costs = self->literal_costs_;
+  float literal_carry = 0.0;
+  float* cost_dist = self->cost_dist_;
+  float* cost_cmd = self->cost_cmd_;
+  size_t num_bytes = self->num_bytes_;
+  size_t i;
+  BrotliEstimateBitCostsForLiterals(position, num_bytes, ringbuffer_mask,
+                                    ringbuffer, self->literal_histograms,
+                                    &literal_costs[1]);
+  literal_costs[0] = 0.0;
+  for (i = 0; i < num_bytes; ++i) {
+    literal_carry += literal_costs[i + 1];
+    literal_costs[i + 1] = literal_costs[i] + literal_carry;
+    literal_carry -= literal_costs[i + 1] - literal_costs[i];
+  }
+  for (i = 0; i < BROTLI_NUM_COMMAND_SYMBOLS; ++i) {
+    cost_cmd[i] = (float)FastLog2(11 + (uint32_t)i);
+  }
+  for (i = 0; i < self->distance_histogram_size; ++i) {
+    cost_dist[i] = (float)FastLog2(20 + (uint32_t)i);
+  }
+  self->min_cost_cmd_ = (float)FastLog2(11);
+}
+
+static BROTLI_INLINE float ZopfliCostModelGetCommandCost(
+    const ZopfliCostModel* self, uint16_t cmdcode) {
+  return self->cost_cmd_[cmdcode];
+}
+
+static BROTLI_INLINE float ZopfliCostModelGetDistanceCost(
+    const ZopfliCostModel* self, size_t distcode) {
+  return self->cost_dist_[distcode];
+}
+
+static BROTLI_INLINE float ZopfliCostModelGetLiteralCosts(
+    const ZopfliCostModel* self, size_t from, size_t to) {
+  return self->literal_costs_[to] - self->literal_costs_[from];
+}
+
+static BROTLI_INLINE float ZopfliCostModelGetMinCostCmd(
+    const ZopfliCostModel* self) {
+  return self->min_cost_cmd_;
+}
+
+/* REQUIRES: len >= 2, start_pos <= pos */
+/* REQUIRES: cost < kInfinity, nodes[start_pos].cost < kInfinity */
+/* Maintains the "ZopfliNode array invariant". */
+static BROTLI_INLINE void UpdateZopfliNode(ZopfliNode* nodes, size_t pos,
+    size_t start_pos, size_t len, size_t len_code, size_t dist,
+    size_t short_code, float cost) {
+  ZopfliNode* next = &nodes[pos + len];
+  next->length = (uint32_t)(len | ((len + 9u - len_code) << 25));
+  next->distance = (uint32_t)dist;
+  next->dcode_insert_length = (uint32_t)(
+      (short_code << 27) | (pos - start_pos));
+  next->u.cost = cost;
+}
+
+typedef struct PosData {
+  size_t pos;
+  int distance_cache[4];
+  float costdiff;
+  float cost;
+} PosData;
+
+/* Maintains the smallest 8 cost difference together with their positions */
+typedef struct StartPosQueue {
+  PosData q_[8];
+  size_t idx_;
+} StartPosQueue;
+
+static BROTLI_INLINE void InitStartPosQueue(StartPosQueue* self) {
+  self->idx_ = 0;
+}
+
+static size_t StartPosQueueSize(const StartPosQueue* self) {
+  return BROTLI_MIN(size_t, self->idx_, 8);
+}
+
+static void StartPosQueuePush(StartPosQueue* self, const PosData* posdata) {
+  size_t offset = ~(self->idx_++) & 7;
+  size_t len = StartPosQueueSize(self);
+  size_t i;
+  PosData* q = self->q_;
+  q[offset] = *posdata;
+  /* Restore the sorted order. In the list of |len| items at most |len - 1|
+     adjacent element comparisons / swaps are required. */
+  for (i = 1; i < len; ++i) {
+    if (q[offset & 7].costdiff > q[(offset + 1) & 7].costdiff) {
+      BROTLI_SWAP(PosData, q, offset & 7, (offset + 1) & 7);
+    }
+    ++offset;
+  }
+}
+
+static const PosData* StartPosQueueAt(const StartPosQueue* self, size_t k) {
+  return &self->q_[(k - self->idx_) & 7];
+}
+
+/* Returns the minimum possible copy length that can improve the cost of any */
+/* future position. */
+static size_t ComputeMinimumCopyLength(const float start_cost,
+                                       const ZopfliNode* nodes,
+                                       const size_t num_bytes,
+                                       const size_t pos) {
+  /* Compute the minimum possible cost of reaching any future position. */
+  float min_cost = start_cost;
+  size_t len = 2;
+  size_t next_len_bucket = 4;
+  size_t next_len_offset = 10;
+  while (pos + len <= num_bytes && nodes[pos + len].u.cost <= min_cost) {
+    /* We already reached (pos + len) with no more cost than the minimum
+       possible cost of reaching anything from this pos, so there is no point in
+       looking for lengths <= len. */
+    ++len;
+    if (len == next_len_offset) {
+      /* We reached the next copy length code bucket, so we add one more
+         extra bit to the minimum cost. */
+      min_cost += 1.0f;
+      next_len_offset += next_len_bucket;
+      next_len_bucket *= 2;
+    }
+  }
+  return len;
+}
+
+/* REQUIRES: nodes[pos].cost < kInfinity
+   REQUIRES: nodes[0..pos] satisfies that "ZopfliNode array invariant". */
+static uint32_t ComputeDistanceShortcut(const size_t block_start,
+                                        const size_t pos,
+                                        const size_t max_backward_limit,
+                                        const size_t gap,
+                                        const ZopfliNode* nodes) {
+  const size_t clen = ZopfliNodeCopyLength(&nodes[pos]);
+  const size_t ilen = nodes[pos].dcode_insert_length & 0x7FFFFFF;
+  const size_t dist = ZopfliNodeCopyDistance(&nodes[pos]);
+  /* Since |block_start + pos| is the end position of the command, the copy part
+     starts from |block_start + pos - clen|. Distances that are greater than
+     this or greater than |max_backward_limit| + |gap| are static dictionary
+     references, and do not update the last distances.
+     Also distance code 0 (last distance) does not update the last distances. */
+  if (pos == 0) {
+    return 0;
+  } else if (dist + clen <= block_start + pos + gap &&
+             dist <= max_backward_limit + gap &&
+             ZopfliNodeDistanceCode(&nodes[pos]) > 0) {
+    return (uint32_t)pos;
+  } else {
+    return nodes[pos - clen - ilen].u.shortcut;
+  }
+}
+
+/* Fills in dist_cache[0..3] with the last four distances (as defined by
+   Section 4. of the Spec) that would be used at (block_start + pos) if we
+   used the shortest path of commands from block_start, computed from
+   nodes[0..pos]. The last four distances at block_start are in
+   starting_dist_cache[0..3].
+   REQUIRES: nodes[pos].cost < kInfinity
+   REQUIRES: nodes[0..pos] satisfies that "ZopfliNode array invariant". */
+static void ComputeDistanceCache(const size_t pos,
+                                 const int* starting_dist_cache,
+                                 const ZopfliNode* nodes,
+                                 int* dist_cache) {
+  int idx = 0;
+  size_t p = nodes[pos].u.shortcut;
+  while (idx < 4 && p > 0) {
+    const size_t ilen = nodes[p].dcode_insert_length & 0x7FFFFFF;
+    const size_t clen = ZopfliNodeCopyLength(&nodes[p]);
+    const size_t dist = ZopfliNodeCopyDistance(&nodes[p]);
+    dist_cache[idx++] = (int)dist;
+    /* Because of prerequisite, p >= clen + ilen >= 2. */
+    p = nodes[p - clen - ilen].u.shortcut;
+  }
+  for (; idx < 4; ++idx) {
+    dist_cache[idx] = *starting_dist_cache++;
+  }
+}
+
+/* Maintains "ZopfliNode array invariant" and pushes node to the queue, if it
+   is eligible. */
+static void EvaluateNode(
+    const size_t block_start, const size_t pos, const size_t max_backward_limit,
+    const size_t gap, const int* starting_dist_cache,
+    const ZopfliCostModel* model, StartPosQueue* queue, ZopfliNode* nodes) {
+  /* Save cost, because ComputeDistanceCache invalidates it. */
+  float node_cost = nodes[pos].u.cost;
+  nodes[pos].u.shortcut = ComputeDistanceShortcut(
+      block_start, pos, max_backward_limit, gap, nodes);
+  if (node_cost <= ZopfliCostModelGetLiteralCosts(model, 0, pos)) {
+    PosData posdata;
+    posdata.pos = pos;
+    posdata.cost = node_cost;
+    posdata.costdiff = node_cost -
+        ZopfliCostModelGetLiteralCosts(model, 0, pos);
+    ComputeDistanceCache(
+        pos, starting_dist_cache, nodes, posdata.distance_cache);
+    StartPosQueuePush(queue, &posdata);
+  }
+}
+
+/* Returns longest copy length. */
+static size_t UpdateNodes(
+    const size_t num_bytes, const size_t block_start, const size_t pos,
+    const uint8_t* ringbuffer, const size_t ringbuffer_mask,
+    const BrotliEncoderParams* params, const size_t max_backward_limit,
+    const int* starting_dist_cache, const size_t num_matches,
+    const BackwardMatch* matches, const ZopfliCostModel* model,
+    StartPosQueue* queue, ZopfliNode* nodes) {
+  const size_t stream_offset = params->stream_offset;
+  const size_t cur_ix = block_start + pos;
+  const size_t cur_ix_masked = cur_ix & ringbuffer_mask;
+  const size_t max_distance = BROTLI_MIN(size_t, cur_ix, max_backward_limit);
+  const size_t dictionary_start = BROTLI_MIN(size_t,
+      cur_ix + stream_offset, max_backward_limit);
+  const size_t max_len = num_bytes - pos;
+  const size_t max_zopfli_len = MaxZopfliLen(params);
+  const size_t max_iters = MaxZopfliCandidates(params);
+  size_t min_len;
+  size_t result = 0;
+  size_t k;
+  const CompoundDictionary* addon = &params->dictionary.compound;
+  size_t gap = addon->total_size;
+
+  EvaluateNode(block_start + stream_offset, pos, max_backward_limit, gap,
+      starting_dist_cache, model, queue, nodes);
+
+  {
+    const PosData* posdata = StartPosQueueAt(queue, 0);
+    float min_cost = (posdata->cost + ZopfliCostModelGetMinCostCmd(model) +
+        ZopfliCostModelGetLiteralCosts(model, posdata->pos, pos));
+    min_len = ComputeMinimumCopyLength(min_cost, nodes, num_bytes, pos);
+  }
+
+  /* Go over the command starting positions in order of increasing cost
+     difference. */
+  for (k = 0; k < max_iters && k < StartPosQueueSize(queue); ++k) {
+    const PosData* posdata = StartPosQueueAt(queue, k);
+    const size_t start = posdata->pos;
+    const uint16_t inscode = GetInsertLengthCode(pos - start);
+    const float start_costdiff = posdata->costdiff;
+    const float base_cost = start_costdiff + (float)GetInsertExtra(inscode) +
+        ZopfliCostModelGetLiteralCosts(model, 0, pos);
+
+    /* Look for last distance matches using the distance cache from this
+       starting position. */
+    size_t best_len = min_len - 1;
+    size_t j = 0;
+    for (; j < BROTLI_NUM_DISTANCE_SHORT_CODES && best_len < max_len; ++j) {
+      const size_t idx = kDistanceCacheIndex[j];
+      const size_t backward =
+          (size_t)(posdata->distance_cache[idx] + kDistanceCacheOffset[j]);
+      size_t prev_ix = cur_ix - backward;
+      size_t len = 0;
+      uint8_t continuation = ringbuffer[cur_ix_masked + best_len];
+      if (cur_ix_masked + best_len > ringbuffer_mask) {
+        break;
+      }
+      if (BROTLI_PREDICT_FALSE(backward > dictionary_start + gap)) {
+        /* Word dictionary -> ignore. */
+        continue;
+      }
+      if (backward <= max_distance) {
+        /* Regular backward reference. */
+        if (prev_ix >= cur_ix) {
+          continue;
+        }
+
+        prev_ix &= ringbuffer_mask;
+        if (prev_ix + best_len > ringbuffer_mask ||
+            continuation != ringbuffer[prev_ix + best_len]) {
+          continue;
+        }
+        len = FindMatchLengthWithLimit(&ringbuffer[prev_ix],
+                                       &ringbuffer[cur_ix_masked],
+                                       max_len);
+      } else if (backward > dictionary_start) {
+        size_t d = 0;
+        size_t offset;
+        size_t limit;
+        const uint8_t* source;
+        offset = dictionary_start + 1 + addon->total_size - 1;
+        while (offset >= backward + addon->chunk_offsets[d + 1]) d++;
+        source = addon->chunk_source[d];
+        offset = offset - addon->chunk_offsets[d] - backward;
+        limit = addon->chunk_offsets[d + 1] - addon->chunk_offsets[d] - offset;
+        limit = limit > max_len ? max_len : limit;
+        if (best_len >= limit ||
+            continuation != source[offset + best_len]) {
+          continue;
+        }
+        len = FindMatchLengthWithLimit(&source[offset],
+                                       &ringbuffer[cur_ix_masked],
+                                       limit);
+      } else {
+        /* "Gray" area. It is addressable by decoder, but this encoder
+           instance does not have that data -> should not touch it. */
+        continue;
+      }
+      {
+        const float dist_cost = base_cost +
+            ZopfliCostModelGetDistanceCost(model, j);
+        size_t l;
+        for (l = best_len + 1; l <= len; ++l) {
+          const uint16_t copycode = GetCopyLengthCode(l);
+          const uint16_t cmdcode =
+              CombineLengthCodes(inscode, copycode, j == 0);
+          const float cost = (cmdcode < 128 ? base_cost : dist_cost) +
+              (float)GetCopyExtra(copycode) +
+              ZopfliCostModelGetCommandCost(model, cmdcode);
+          if (cost < nodes[pos + l].u.cost) {
+            UpdateZopfliNode(nodes, pos, start, l, l, backward, j + 1, cost);
+            result = BROTLI_MAX(size_t, result, l);
+          }
+          best_len = l;
+        }
+      }
+    }
+
+    /* At higher iterations look only for new last distance matches, since
+       looking only for new command start positions with the same distances
+       does not help much. */
+    if (k >= 2) continue;
+
+    {
+      /* Loop through all possible copy lengths at this position. */
+      size_t len = min_len;
+      for (j = 0; j < num_matches; ++j) {
+        BackwardMatch match = matches[j];
+        size_t dist = match.distance;
+        BROTLI_BOOL is_dictionary_match =
+            TO_BROTLI_BOOL(dist > dictionary_start + gap);
+        /* We already tried all possible last distance matches, so we can use
+           normal distance code here. */
+        size_t dist_code = dist + BROTLI_NUM_DISTANCE_SHORT_CODES - 1;
+        uint16_t dist_symbol;
+        uint32_t distextra;
+        uint32_t distnumextra;
+        float dist_cost;
+        size_t max_match_len;
+        PrefixEncodeCopyDistance(
+            dist_code, params->dist.num_direct_distance_codes,
+            params->dist.distance_postfix_bits, &dist_symbol, &distextra);
+        distnumextra = dist_symbol >> 10;
+        dist_cost = base_cost + (float)distnumextra +
+            ZopfliCostModelGetDistanceCost(model, dist_symbol & 0x3FF);
+
+        /* Try all copy lengths up until the maximum copy length corresponding
+           to this distance. If the distance refers to the static dictionary, or
+           the maximum length is long enough, try only one maximum length. */
+        max_match_len = BackwardMatchLength(&match);
+        if (len < max_match_len &&
+            (is_dictionary_match || max_match_len > max_zopfli_len)) {
+          len = max_match_len;
+        }
+        for (; len <= max_match_len; ++len) {
+          const size_t len_code =
+              is_dictionary_match ? BackwardMatchLengthCode(&match) : len;
+          const uint16_t copycode = GetCopyLengthCode(len_code);
+          const uint16_t cmdcode = CombineLengthCodes(inscode, copycode, 0);
+          const float cost = dist_cost + (float)GetCopyExtra(copycode) +
+              ZopfliCostModelGetCommandCost(model, cmdcode);
+          if (cost < nodes[pos + len].u.cost) {
+            UpdateZopfliNode(nodes, pos, start, len, len_code, dist, 0, cost);
+            result = BROTLI_MAX(size_t, result, len);
+          }
+        }
+      }
+    }
+  }
+  return result;
+}
+
+static size_t ComputeShortestPathFromNodes(size_t num_bytes,
+    ZopfliNode* nodes) {
+  size_t index = num_bytes;
+  size_t num_commands = 0;
+  while ((nodes[index].dcode_insert_length & 0x7FFFFFF) == 0 &&
+      nodes[index].length == 1) --index;
+  nodes[index].u.next = BROTLI_UINT32_MAX;
+  while (index != 0) {
+    size_t len = ZopfliNodeCommandLength(&nodes[index]);
+    index -= len;
+    nodes[index].u.next = (uint32_t)len;
+    num_commands++;
+  }
+  return num_commands;
+}
+
+/* REQUIRES: nodes != NULL and len(nodes) >= num_bytes + 1 */
+void BrotliZopfliCreateCommands(const size_t num_bytes,
+    const size_t block_start, const ZopfliNode* nodes, int* dist_cache,
+    size_t* last_insert_len, const BrotliEncoderParams* params,
+    Command* commands, size_t* num_literals) {
+  const size_t stream_offset = params->stream_offset;
+  const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);
+  size_t pos = 0;
+  uint32_t offset = nodes[0].u.next;
+  size_t i;
+  size_t gap = params->dictionary.compound.total_size;
+  for (i = 0; offset != BROTLI_UINT32_MAX; i++) {
+    const ZopfliNode* next = &nodes[pos + offset];
+    size_t copy_length = ZopfliNodeCopyLength(next);
+    size_t insert_length = next->dcode_insert_length & 0x7FFFFFF;
+    pos += insert_length;
+    offset = next->u.next;
+    if (i == 0) {
+      insert_length += *last_insert_len;
+      *last_insert_len = 0;
+    }
+    {
+      size_t distance = ZopfliNodeCopyDistance(next);
+      size_t len_code = ZopfliNodeLengthCode(next);
+      size_t dictionary_start = BROTLI_MIN(size_t,
+          block_start + pos + stream_offset, max_backward_limit);
+      BROTLI_BOOL is_dictionary =
+          TO_BROTLI_BOOL(distance > dictionary_start + gap);
+      size_t dist_code = ZopfliNodeDistanceCode(next);
+      InitCommand(&commands[i], &params->dist, insert_length,
+          copy_length, (int)len_code - (int)copy_length, dist_code);
+
+      if (!is_dictionary && dist_code > 0) {
+        dist_cache[3] = dist_cache[2];
+        dist_cache[2] = dist_cache[1];
+        dist_cache[1] = dist_cache[0];
+        dist_cache[0] = (int)distance;
+      }
+    }
+
+    *num_literals += insert_length;
+    pos += copy_length;
+  }
+  *last_insert_len += num_bytes - pos;
+}
+
+static size_t ZopfliIterate(size_t num_bytes, size_t position,
+    const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    const BrotliEncoderParams* params, const size_t gap, const int* dist_cache,
+    const ZopfliCostModel* model, const uint32_t* num_matches,
+    const BackwardMatch* matches, ZopfliNode* nodes) {
+  const size_t stream_offset = params->stream_offset;
+  const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);
+  const size_t max_zopfli_len = MaxZopfliLen(params);
+  StartPosQueue queue;
+  size_t cur_match_pos = 0;
+  size_t i;
+  nodes[0].length = 0;
+  nodes[0].u.cost = 0;
+  InitStartPosQueue(&queue);
+  for (i = 0; i + 3 < num_bytes; i++) {
+    size_t skip = UpdateNodes(num_bytes, position, i, ringbuffer,
+        ringbuffer_mask, params, max_backward_limit, dist_cache,
+        num_matches[i], &matches[cur_match_pos], model, &queue, nodes);
+    if (skip < BROTLI_LONG_COPY_QUICK_STEP) skip = 0;
+    cur_match_pos += num_matches[i];
+    if (num_matches[i] == 1 &&
+        BackwardMatchLength(&matches[cur_match_pos - 1]) > max_zopfli_len) {
+      skip = BROTLI_MAX(size_t,
+          BackwardMatchLength(&matches[cur_match_pos - 1]), skip);
+    }
+    if (skip > 1) {
+      skip--;
+      while (skip) {
+        i++;
+        if (i + 3 >= num_bytes) break;
+        EvaluateNode(position + stream_offset, i, max_backward_limit, gap,
+            dist_cache, model, &queue, nodes);
+        cur_match_pos += num_matches[i];
+        skip--;
+      }
+    }
+  }
+  return ComputeShortestPathFromNodes(num_bytes, nodes);
+}
+
+static void MergeMatches(BackwardMatch* dst,
+    BackwardMatch* src1, size_t len1, BackwardMatch* src2, size_t len2) {
+  while (len1 > 0 && len2 > 0) {
+    size_t l1 = BackwardMatchLength(src1);
+    size_t l2 = BackwardMatchLength(src2);
+    if (l1 < l2 || ((l1 == l2) && (src1->distance < src2->distance))) {
+      *dst++ = *src1++;
+      len1--;
+    } else {
+      *dst++ = *src2++;
+      len2--;
+    }
+  }
+  while (len1-- > 0) *dst++ = *src1++;
+  while (len2-- > 0) *dst++ = *src2++;
+}
+
+/* REQUIRES: nodes != NULL and len(nodes) >= num_bytes + 1 */
+size_t BrotliZopfliComputeShortestPath(MemoryManager* m, size_t num_bytes,
+    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    ContextLut literal_context_lut, const BrotliEncoderParams* params,
+    const int* dist_cache, Hasher* hasher, ZopfliNode* nodes) {
+  const size_t stream_offset = params->stream_offset;
+  const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);
+  const size_t max_zopfli_len = MaxZopfliLen(params);
+  StartPosQueue queue;
+  BackwardMatch* BROTLI_RESTRICT matches =
+      BROTLI_ALLOC(m, BackwardMatch, 2 * (MAX_NUM_MATCHES_H10 + 64));
+  const size_t store_end = num_bytes >= StoreLookaheadH10() ?
+      position + num_bytes - StoreLookaheadH10() + 1 : position;
+  size_t i;
+  const CompoundDictionary* addon = &params->dictionary.compound;
+  size_t gap = addon->total_size;
+  size_t lz_matches_offset =
+      (addon->num_chunks != 0) ? (MAX_NUM_MATCHES_H10 + 128) : 0;
+  ZopfliCostModel* model = BROTLI_ALLOC(m, ZopfliCostModel, 1);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(model) || BROTLI_IS_NULL(matches)) {
+    return 0;
+  }
+  nodes[0].length = 0;
+  nodes[0].u.cost = 0;
+  InitZopfliCostModel(m, model, &params->dist, num_bytes);
+  if (BROTLI_IS_OOM(m)) return 0;
+  ZopfliCostModelSetFromLiteralCosts(
+      model, position, ringbuffer, ringbuffer_mask);
+  InitStartPosQueue(&queue);
+  for (i = 0; i + HashTypeLengthH10() - 1 < num_bytes; i++) {
+    const size_t pos = position + i;
+    const size_t max_distance = BROTLI_MIN(size_t, pos, max_backward_limit);
+    const size_t dictionary_start = BROTLI_MIN(size_t,
+        pos + stream_offset, max_backward_limit);
+    size_t skip;
+    size_t num_matches;
+    int dict_id = 0;
+    if (params->dictionary.contextual.context_based) {
+      uint8_t p1 = pos >= 1 ?
+          ringbuffer[(size_t)(pos - 1) & ringbuffer_mask] : 0;
+      uint8_t p2 = pos >= 2 ?
+          ringbuffer[(size_t)(pos - 2) & ringbuffer_mask] : 0;
+      dict_id = params->dictionary.contextual.context_map[
+          BROTLI_CONTEXT(p1, p2, literal_context_lut)];
+    }
+    num_matches = FindAllMatchesH10(&hasher->privat._H10,
+        params->dictionary.contextual.dict[dict_id],
+        ringbuffer, ringbuffer_mask, pos, num_bytes - i, max_distance,
+        dictionary_start + gap, params, &matches[lz_matches_offset]);
+    if (addon->num_chunks != 0) {
+      size_t cd_matches = LookupAllCompoundDictionaryMatches(addon,
+          ringbuffer, ringbuffer_mask, pos, 3, num_bytes - i,
+          dictionary_start, params->dist.max_distance,
+          &matches[lz_matches_offset - 64], 64);
+      MergeMatches(matches, &matches[lz_matches_offset - 64], cd_matches,
+          &matches[lz_matches_offset], num_matches);
+      num_matches += cd_matches;
+    }
+    if (num_matches > 0 &&
+        BackwardMatchLength(&matches[num_matches - 1]) > max_zopfli_len) {
+      matches[0] = matches[num_matches - 1];
+      num_matches = 1;
+    }
+    skip = UpdateNodes(num_bytes, position, i, ringbuffer, ringbuffer_mask,
+        params, max_backward_limit, dist_cache, num_matches, matches, model,
+        &queue, nodes);
+    if (skip < BROTLI_LONG_COPY_QUICK_STEP) skip = 0;
+    if (num_matches == 1 && BackwardMatchLength(&matches[0]) > max_zopfli_len) {
+      skip = BROTLI_MAX(size_t, BackwardMatchLength(&matches[0]), skip);
+    }
+    if (skip > 1) {
+      /* Add the tail of the copy to the hasher. */
+      StoreRangeH10(&hasher->privat._H10,
+          ringbuffer, ringbuffer_mask, pos + 1, BROTLI_MIN(
+          size_t, pos + skip, store_end));
+      skip--;
+      while (skip) {
+        i++;
+        if (i + HashTypeLengthH10() - 1 >= num_bytes) break;
+        EvaluateNode(position + stream_offset, i, max_backward_limit, gap,
+            dist_cache, model, &queue, nodes);
+        skip--;
+      }
+    }
+  }
+  CleanupZopfliCostModel(m, model);
+  BROTLI_FREE(m, model);
+  BROTLI_FREE(m, matches);
+  return ComputeShortestPathFromNodes(num_bytes, nodes);
+}
+
+void BrotliCreateZopfliBackwardReferences(MemoryManager* m, size_t num_bytes,
+    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    ContextLut literal_context_lut, const BrotliEncoderParams* params,
+    Hasher* hasher, int* dist_cache, size_t* last_insert_len,
+    Command* commands, size_t* num_commands, size_t* num_literals) {
+  ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, num_bytes + 1);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(nodes)) return;
+  BrotliInitZopfliNodes(nodes, num_bytes + 1);
+  *num_commands += BrotliZopfliComputeShortestPath(m, num_bytes,
+      position, ringbuffer, ringbuffer_mask, literal_context_lut, params,
+      dist_cache, hasher, nodes);
+  if (BROTLI_IS_OOM(m)) return;
+  BrotliZopfliCreateCommands(num_bytes, position, nodes, dist_cache,
+      last_insert_len, params, commands, num_literals);
+  BROTLI_FREE(m, nodes);
+}
+
+void BrotliCreateHqZopfliBackwardReferences(MemoryManager* m, size_t num_bytes,
+    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    ContextLut literal_context_lut, const BrotliEncoderParams* params,
+    Hasher* hasher, int* dist_cache, size_t* last_insert_len,
+    Command* commands, size_t* num_commands, size_t* num_literals) {
+  const size_t stream_offset = params->stream_offset;
+  const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);
+  uint32_t* num_matches = BROTLI_ALLOC(m, uint32_t, num_bytes);
+  size_t matches_size = 4 * num_bytes;
+  const size_t store_end = num_bytes >= StoreLookaheadH10() ?
+      position + num_bytes - StoreLookaheadH10() + 1 : position;
+  size_t cur_match_pos = 0;
+  size_t i;
+  size_t orig_num_literals;
+  size_t orig_last_insert_len;
+  int orig_dist_cache[4];
+  size_t orig_num_commands;
+  ZopfliCostModel* model = BROTLI_ALLOC(m, ZopfliCostModel, 1);
+  ZopfliNode* nodes;
+  BackwardMatch* matches = BROTLI_ALLOC(m, BackwardMatch, matches_size);
+  const CompoundDictionary* addon = &params->dictionary.compound;
+  size_t gap = addon->total_size;
+  size_t shadow_matches =
+      (addon->num_chunks != 0) ? (MAX_NUM_MATCHES_H10 + 128) : 0;
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(model) ||
+      BROTLI_IS_NULL(num_matches) || BROTLI_IS_NULL(matches)) {
+    return;
+  }
+  for (i = 0; i + HashTypeLengthH10() - 1 < num_bytes; ++i) {
+    const size_t pos = position + i;
+    size_t max_distance = BROTLI_MIN(size_t, pos, max_backward_limit);
+    size_t dictionary_start = BROTLI_MIN(size_t,
+        pos + stream_offset, max_backward_limit);
+    size_t max_length = num_bytes - i;
+    size_t num_found_matches;
+    size_t cur_match_end;
+    size_t j;
+    int dict_id = 0;
+    if (params->dictionary.contextual.context_based) {
+      uint8_t p1 = pos >= 1 ?
+          ringbuffer[(size_t)(pos - 1) & ringbuffer_mask] : 0;
+      uint8_t p2 = pos >= 2 ?
+          ringbuffer[(size_t)(pos - 2) & ringbuffer_mask] : 0;
+      dict_id = params->dictionary.contextual.context_map[
+          BROTLI_CONTEXT(p1, p2, literal_context_lut)];
+    }
+    /* Ensure that we have enough free slots. */
+    BROTLI_ENSURE_CAPACITY(m, BackwardMatch, matches, matches_size,
+        cur_match_pos + MAX_NUM_MATCHES_H10 + shadow_matches);
+    if (BROTLI_IS_OOM(m)) return;
+    num_found_matches = FindAllMatchesH10(&hasher->privat._H10,
+        params->dictionary.contextual.dict[dict_id],
+        ringbuffer, ringbuffer_mask, pos, max_length,
+        max_distance, dictionary_start + gap, params,
+        &matches[cur_match_pos + shadow_matches]);
+    if (addon->num_chunks != 0) {
+      size_t cd_matches = LookupAllCompoundDictionaryMatches(addon,
+          ringbuffer, ringbuffer_mask, pos, 3, max_length,
+          dictionary_start, params->dist.max_distance,
+          &matches[cur_match_pos + shadow_matches - 64], 64);
+      MergeMatches(&matches[cur_match_pos],
+          &matches[cur_match_pos + shadow_matches - 64], cd_matches,
+          &matches[cur_match_pos + shadow_matches], num_found_matches);
+      num_found_matches += cd_matches;
+    }
+    cur_match_end = cur_match_pos + num_found_matches;
+    for (j = cur_match_pos; j + 1 < cur_match_end; ++j) {
+      BROTLI_DCHECK(BackwardMatchLength(&matches[j]) <=
+          BackwardMatchLength(&matches[j + 1]));
+    }
+    num_matches[i] = (uint32_t)num_found_matches;
+    if (num_found_matches > 0) {
+      const size_t match_len = BackwardMatchLength(&matches[cur_match_end - 1]);
+      if (match_len > MAX_ZOPFLI_LEN_QUALITY_11) {
+        const size_t skip = match_len - 1;
+        matches[cur_match_pos++] = matches[cur_match_end - 1];
+        num_matches[i] = 1;
+        /* Add the tail of the copy to the hasher. */
+        StoreRangeH10(&hasher->privat._H10,
+                      ringbuffer, ringbuffer_mask, pos + 1,
+                      BROTLI_MIN(size_t, pos + match_len, store_end));
+        memset(&num_matches[i + 1], 0, skip * sizeof(num_matches[0]));
+        i += skip;
+      } else {
+        cur_match_pos = cur_match_end;
+      }
+    }
+  }
+  orig_num_literals = *num_literals;
+  orig_last_insert_len = *last_insert_len;
+  memcpy(orig_dist_cache, dist_cache, 4 * sizeof(dist_cache[0]));
+  orig_num_commands = *num_commands;
+  nodes = BROTLI_ALLOC(m, ZopfliNode, num_bytes + 1);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(nodes)) return;
+  InitZopfliCostModel(m, model, &params->dist, num_bytes);
+  if (BROTLI_IS_OOM(m)) return;
+  for (i = 0; i < 2; i++) {
+    BrotliInitZopfliNodes(nodes, num_bytes + 1);
+    if (i == 0) {
+      ZopfliCostModelSetFromLiteralCosts(
+          model, position, ringbuffer, ringbuffer_mask);
+    } else {
+      ZopfliCostModelSetFromCommands(model, position, ringbuffer,
+          ringbuffer_mask, commands, *num_commands - orig_num_commands,
+          orig_last_insert_len);
+    }
+    *num_commands = orig_num_commands;
+    *num_literals = orig_num_literals;
+    *last_insert_len = orig_last_insert_len;
+    memcpy(dist_cache, orig_dist_cache, 4 * sizeof(dist_cache[0]));
+    *num_commands += ZopfliIterate(num_bytes, position, ringbuffer,
+        ringbuffer_mask, params, gap, dist_cache, model, num_matches, matches,
+        nodes);
+    BrotliZopfliCreateCommands(num_bytes, position, nodes, dist_cache,
+        last_insert_len, params, commands, num_literals);
+  }
+  CleanupZopfliCostModel(m, model);
+  BROTLI_FREE(m, model);
+  BROTLI_FREE(m, nodes);
+  BROTLI_FREE(m, matches);
+  BROTLI_FREE(m, num_matches);
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references_hq.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references_hq.h
new file mode 100644
index 0000000000..8acf975ab9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references_hq.h
@@ -0,0 +1,96 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Function to find backward reference copies. */
+
+#ifndef BROTLI_ENC_BACKWARD_REFERENCES_HQ_H_
+#define BROTLI_ENC_BACKWARD_REFERENCES_HQ_H_
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/context.h"
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "command.h"
+#include "hash.h"
+#include "memory.h"
+#include "quality.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+BROTLI_INTERNAL void BrotliCreateZopfliBackwardReferences(MemoryManager* m,
+    size_t num_bytes,
+    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    ContextLut literal_context_lut, const BrotliEncoderParams* params,
+    Hasher* hasher, int* dist_cache, size_t* last_insert_len,
+    Command* commands, size_t* num_commands, size_t* num_literals);
+
+BROTLI_INTERNAL void BrotliCreateHqZopfliBackwardReferences(MemoryManager* m,
+    size_t num_bytes,
+    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    ContextLut literal_context_lut, const BrotliEncoderParams* params,
+    Hasher* hasher, int* dist_cache, size_t* last_insert_len,
+    Command* commands, size_t* num_commands, size_t* num_literals);
+
+typedef struct ZopfliNode {
+  /* Best length to get up to this byte (not including this byte itself)
+     highest 7 bit is used to reconstruct the length code. */
+  uint32_t length;
+  /* Distance associated with the length. */
+  uint32_t distance;
+  /* Number of literal inserts before this copy; highest 5 bits contain
+     distance short code + 1 (or zero if no short code). */
+  uint32_t dcode_insert_length;
+
+  /* This union holds information used by dynamic-programming. During forward
+     pass |cost| it used to store the goal function. When node is processed its
+     |cost| is invalidated in favor of |shortcut|. On path back-tracing pass
+     |next| is assigned the offset to next node on the path. */
+  union {
+    /* Smallest cost to get to this byte from the beginning, as found so far. */
+    float cost;
+    /* Offset to the next node on the path. Equals to command_length() of the
+       next node on the path. For last node equals to BROTLI_UINT32_MAX */
+    uint32_t next;
+    /* Node position that provides next distance for distance cache. */
+    uint32_t shortcut;
+  } u;
+} ZopfliNode;
+
+BROTLI_INTERNAL void BrotliInitZopfliNodes(ZopfliNode* array, size_t length);
+
+/* Computes the shortest path of commands from position to at most
+   position + num_bytes.
+
+   On return, path->size() is the number of commands found and path[i] is the
+   length of the i-th command (copy length plus insert length).
+   Note that the sum of the lengths of all commands can be less than num_bytes.
+
+   On return, the nodes[0..num_bytes] array will have the following
+   "ZopfliNode array invariant":
+   For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
+     (1) nodes[i].copy_length() >= 2
+     (2) nodes[i].command_length() <= i and
+     (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
+BROTLI_INTERNAL size_t BrotliZopfliComputeShortestPath(
+    MemoryManager* m, size_t num_bytes,
+    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    ContextLut literal_context_lut, const BrotliEncoderParams* params,
+    const int* dist_cache, Hasher* hasher, ZopfliNode* nodes);
+
+BROTLI_INTERNAL void BrotliZopfliCreateCommands(
+    const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes,
+    int* dist_cache, size_t* last_insert_len, const BrotliEncoderParams* params,
+    Command* commands, size_t* num_literals);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_BACKWARD_REFERENCES_HQ_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references_inc.h
new file mode 100644
index 0000000000..752c12e9fd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/backward_references_inc.h
@@ -0,0 +1,189 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: EXPORT_FN, FN */
+
+static BROTLI_NOINLINE void EXPORT_FN(CreateBackwardReferences)(
+    size_t num_bytes, size_t position,
+    const uint8_t* ringbuffer, size_t ringbuffer_mask,
+    ContextLut literal_context_lut, const BrotliEncoderParams* params,
+    Hasher* hasher, int* dist_cache, size_t* last_insert_len,
+    Command* commands, size_t* num_commands, size_t* num_literals) {
+  HASHER()* privat = &hasher->privat.FN(_);
+  /* Set maximum distance, see section 9.1. of the spec. */
+  const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);
+  const size_t position_offset = params->stream_offset;
+
+  const Command* const orig_commands = commands;
+  size_t insert_length = *last_insert_len;
+  const size_t pos_end = position + num_bytes;
+  const size_t store_end = num_bytes >= FN(StoreLookahead)() ?
+      position + num_bytes - FN(StoreLookahead)() + 1 : position;
+
+  /* For speed up heuristics for random data. */
+  const size_t random_heuristics_window_size =
+      LiteralSpreeLengthForSparseSearch(params);
+  size_t apply_random_heuristics = position + random_heuristics_window_size;
+  const size_t gap = params->dictionary.compound.total_size;
+
+  /* Minimum score to accept a backward reference. */
+  const score_t kMinScore = BROTLI_SCORE_BASE + 100;
+
+  FN(PrepareDistanceCache)(privat, dist_cache);
+
+  while (position + FN(HashTypeLength)() < pos_end) {
+    size_t max_length = pos_end - position;
+    size_t max_distance = BROTLI_MIN(size_t, position, max_backward_limit);
+    size_t dictionary_start = BROTLI_MIN(size_t,
+        position + position_offset, max_backward_limit);
+    HasherSearchResult sr;
+    int dict_id = 0;
+    uint8_t p1 = 0;
+    uint8_t p2 = 0;
+    if (params->dictionary.contextual.context_based) {
+      p1 = position >= 1 ?
+          ringbuffer[(size_t)(position - 1) & ringbuffer_mask] : 0;
+      p2 = position >= 2 ?
+          ringbuffer[(size_t)(position - 2) & ringbuffer_mask] : 0;
+      dict_id = params->dictionary.contextual.context_map[
+          BROTLI_CONTEXT(p1, p2, literal_context_lut)];
+    }
+    sr.len = 0;
+    sr.len_code_delta = 0;
+    sr.distance = 0;
+    sr.score = kMinScore;
+    FN(FindLongestMatch)(privat, params->dictionary.contextual.dict[dict_id],
+        ringbuffer, ringbuffer_mask, dist_cache, position, max_length,
+        max_distance, dictionary_start + gap, params->dist.max_distance, &sr);
+    if (ENABLE_COMPOUND_DICTIONARY) {
+      LookupCompoundDictionaryMatch(&params->dictionary.compound, ringbuffer,
+          ringbuffer_mask, dist_cache, position, max_length,
+          dictionary_start, params->dist.max_distance, &sr);
+    }
+    if (sr.score > kMinScore) {
+      /* Found a match. Let's look for something even better ahead. */
+      int delayed_backward_references_in_row = 0;
+      --max_length;
+      for (;; --max_length) {
+        const score_t cost_diff_lazy = 175;
+        HasherSearchResult sr2;
+        sr2.len = params->quality < MIN_QUALITY_FOR_EXTENSIVE_REFERENCE_SEARCH ?
+            BROTLI_MIN(size_t, sr.len - 1, max_length) : 0;
+        sr2.len_code_delta = 0;
+        sr2.distance = 0;
+        sr2.score = kMinScore;
+        max_distance = BROTLI_MIN(size_t, position + 1, max_backward_limit);
+        dictionary_start = BROTLI_MIN(size_t,
+            position + 1 + position_offset, max_backward_limit);
+        if (params->dictionary.contextual.context_based) {
+          p2 = p1;
+          p1 = ringbuffer[position & ringbuffer_mask];
+          dict_id = params->dictionary.contextual.context_map[
+              BROTLI_CONTEXT(p1, p2, literal_context_lut)];
+        }
+        FN(FindLongestMatch)(privat,
+            params->dictionary.contextual.dict[dict_id],
+            ringbuffer, ringbuffer_mask, dist_cache, position + 1, max_length,
+            max_distance, dictionary_start + gap, params->dist.max_distance,
+            &sr2);
+        if (ENABLE_COMPOUND_DICTIONARY) {
+          LookupCompoundDictionaryMatch(
+              &params->dictionary.compound, ringbuffer,
+              ringbuffer_mask, dist_cache, position + 1, max_length,
+              dictionary_start, params->dist.max_distance, &sr2);
+        }
+        if (sr2.score >= sr.score + cost_diff_lazy) {
+          /* Ok, let's just write one byte for now and start a match from the
+             next byte. */
+          ++position;
+          ++insert_length;
+          sr = sr2;
+          if (++delayed_backward_references_in_row < 4 &&
+              position + FN(HashTypeLength)() < pos_end) {
+            continue;
+          }
+        }
+        break;
+      }
+      apply_random_heuristics =
+          position + 2 * sr.len + random_heuristics_window_size;
+      dictionary_start = BROTLI_MIN(size_t,
+          position + position_offset, max_backward_limit);
+      {
+        /* The first 16 codes are special short-codes,
+           and the minimum offset is 1. */
+        size_t distance_code = ComputeDistanceCode(
+            sr.distance, dictionary_start + gap, dist_cache);
+        if ((sr.distance <= (dictionary_start + gap)) && distance_code > 0) {
+          dist_cache[3] = dist_cache[2];
+          dist_cache[2] = dist_cache[1];
+          dist_cache[1] = dist_cache[0];
+          dist_cache[0] = (int)sr.distance;
+          FN(PrepareDistanceCache)(privat, dist_cache);
+        }
+        InitCommand(commands++, &params->dist, insert_length,
+            sr.len, sr.len_code_delta, distance_code);
+      }
+      *num_literals += insert_length;
+      insert_length = 0;
+      /* Put the hash keys into the table, if there are enough bytes left.
+         Depending on the hasher implementation, it can push all positions
+         in the given range or only a subset of them.
+         Avoid hash poisoning with RLE data. */
+      {
+        size_t range_start = position + 2;
+        size_t range_end = BROTLI_MIN(size_t, position + sr.len, store_end);
+        if (sr.distance < (sr.len >> 2)) {
+          range_start = BROTLI_MIN(size_t, range_end, BROTLI_MAX(size_t,
+              range_start, position + sr.len - (sr.distance << 2)));
+        }
+        FN(StoreRange)(privat, ringbuffer, ringbuffer_mask, range_start,
+                       range_end);
+      }
+      position += sr.len;
+    } else {
+      ++insert_length;
+      ++position;
+      /* If we have not seen matches for a long time, we can skip some
+         match lookups. Unsuccessful match lookups are very very expensive
+         and this kind of a heuristic speeds up compression quite
+         a lot. */
+      if (position > apply_random_heuristics) {
+        /* Going through uncompressible data, jump. */
+        if (position >
+            apply_random_heuristics + 4 * random_heuristics_window_size) {
+          /* It is quite a long time since we saw a copy, so we assume
+             that this data is not compressible, and store hashes less
+             often. Hashes of non compressible data are less likely to
+             turn out to be useful in the future, too, so we store less of
+             them to not to flood out the hash table of good compressible
+             data. */
+          const size_t kMargin =
+              BROTLI_MAX(size_t, FN(StoreLookahead)() - 1, 4);
+          size_t pos_jump =
+              BROTLI_MIN(size_t, position + 16, pos_end - kMargin);
+          for (; position < pos_jump; position += 4) {
+            FN(Store)(privat, ringbuffer, ringbuffer_mask, position);
+            insert_length += 4;
+          }
+        } else {
+          const size_t kMargin =
+              BROTLI_MAX(size_t, FN(StoreLookahead)() - 1, 2);
+          size_t pos_jump =
+              BROTLI_MIN(size_t, position + 8, pos_end - kMargin);
+          for (; position < pos_jump; position += 2) {
+            FN(Store)(privat, ringbuffer, ringbuffer_mask, position);
+            insert_length += 2;
+          }
+        }
+      }
+    }
+  }
+  insert_length += pos_end - position;
+  *last_insert_len = insert_length;
+  *num_commands += (size_t)(commands - orig_commands);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/bit_cost.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/bit_cost.c
new file mode 100644
index 0000000000..6b7c904ced
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/bit_cost.c
@@ -0,0 +1,36 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Functions to estimate the bit cost of Huffman trees. */
+
+#include "bit_cost.h"
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+#include "fast_log.h"
+#include "histogram.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define FN(X) X ## Literal
+#include "bit_cost_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#define FN(X) X ## Command
+#include "bit_cost_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#define FN(X) X ## Distance
+#include "bit_cost_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/bit_cost.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/bit_cost.h
new file mode 100644
index 0000000000..f6f2773994
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/bit_cost.h
@@ -0,0 +1,64 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Functions to estimate the bit cost of Huffman trees. */
+
+#ifndef BROTLI_ENC_BIT_COST_H_
+#define BROTLI_ENC_BIT_COST_H_
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+#include "fast_log.h"
+#include "histogram.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static BROTLI_INLINE double ShannonEntropy(
+    const uint32_t* population, size_t size, size_t* total) {
+  size_t sum = 0;
+  double retval = 0;
+  const uint32_t* population_end = population + size;
+  size_t p;
+  if (size & 1) {
+    goto odd_number_of_elements_left;
+  }
+  while (population < population_end) {
+    p = *population++;
+    sum += p;
+    retval -= (double)p * FastLog2(p);
+ odd_number_of_elements_left:
+    p = *population++;
+    sum += p;
+    retval -= (double)p * FastLog2(p);
+  }
+  if (sum) retval += (double)sum * FastLog2(sum);
+  *total = sum;
+  return retval;
+}
+
+static BROTLI_INLINE double BitsEntropy(
+    const uint32_t* population, size_t size) {
+  size_t sum;
+  double retval = ShannonEntropy(population, size, &sum);
+  if (retval < (double)sum) {
+    /* At least one bit per literal is needed. */
+    retval = (double)sum;
+  }
+  return retval;
+}
+
+BROTLI_INTERNAL double BrotliPopulationCostLiteral(const HistogramLiteral*);
+BROTLI_INTERNAL double BrotliPopulationCostCommand(const HistogramCommand*);
+BROTLI_INTERNAL double BrotliPopulationCostDistance(const HistogramDistance*);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_BIT_COST_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/bit_cost_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/bit_cost_inc.h
new file mode 100644
index 0000000000..453c226042
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/bit_cost_inc.h
@@ -0,0 +1,127 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN */
+
+#define HistogramType FN(Histogram)
+
+double FN(BrotliPopulationCost)(const HistogramType* histogram) {
+  static const double kOneSymbolHistogramCost = 12;
+  static const double kTwoSymbolHistogramCost = 20;
+  static const double kThreeSymbolHistogramCost = 28;
+  static const double kFourSymbolHistogramCost = 37;
+  const size_t data_size = FN(HistogramDataSize)();
+  int count = 0;
+  size_t s[5];
+  double bits = 0.0;
+  size_t i;
+  if (histogram->total_count_ == 0) {
+    return kOneSymbolHistogramCost;
+  }
+  for (i = 0; i < data_size; ++i) {
+    if (histogram->data_[i] > 0) {
+      s[count] = i;
+      ++count;
+      if (count > 4) break;
+    }
+  }
+  if (count == 1) {
+    return kOneSymbolHistogramCost;
+  }
+  if (count == 2) {
+    return (kTwoSymbolHistogramCost + (double)histogram->total_count_);
+  }
+  if (count == 3) {
+    const uint32_t histo0 = histogram->data_[s[0]];
+    const uint32_t histo1 = histogram->data_[s[1]];
+    const uint32_t histo2 = histogram->data_[s[2]];
+    const uint32_t histomax =
+        BROTLI_MAX(uint32_t, histo0, BROTLI_MAX(uint32_t, histo1, histo2));
+    return (kThreeSymbolHistogramCost +
+            2 * (histo0 + histo1 + histo2) - histomax);
+  }
+  if (count == 4) {
+    uint32_t histo[4];
+    uint32_t h23;
+    uint32_t histomax;
+    for (i = 0; i < 4; ++i) {
+      histo[i] = histogram->data_[s[i]];
+    }
+    /* Sort */
+    for (i = 0; i < 4; ++i) {
+      size_t j;
+      for (j = i + 1; j < 4; ++j) {
+        if (histo[j] > histo[i]) {
+          BROTLI_SWAP(uint32_t, histo, j, i);
+        }
+      }
+    }
+    h23 = histo[2] + histo[3];
+    histomax = BROTLI_MAX(uint32_t, h23, histo[0]);
+    return (kFourSymbolHistogramCost +
+            3 * h23 + 2 * (histo[0] + histo[1]) - histomax);
+  }
+
+  {
+    /* In this loop we compute the entropy of the histogram and simultaneously
+       build a simplified histogram of the code length codes where we use the
+       zero repeat code 17, but we don't use the non-zero repeat code 16. */
+    size_t max_depth = 1;
+    uint32_t depth_histo[BROTLI_CODE_LENGTH_CODES] = { 0 };
+    const double log2total = FastLog2(histogram->total_count_);
+    for (i = 0; i < data_size;) {
+      if (histogram->data_[i] > 0) {
+        /* Compute -log2(P(symbol)) = -log2(count(symbol)/total_count) =
+                                    = log2(total_count) - log2(count(symbol)) */
+        double log2p = log2total - FastLog2(histogram->data_[i]);
+        /* Approximate the bit depth by round(-log2(P(symbol))) */
+        size_t depth = (size_t)(log2p + 0.5);
+        bits += histogram->data_[i] * log2p;
+        if (depth > 15) {
+          depth = 15;
+        }
+        if (depth > max_depth) {
+          max_depth = depth;
+        }
+        ++depth_histo[depth];
+        ++i;
+      } else {
+        /* Compute the run length of zeros and add the appropriate number of 0
+           and 17 code length codes to the code length code histogram. */
+        uint32_t reps = 1;
+        size_t k;
+        for (k = i + 1; k < data_size && histogram->data_[k] == 0; ++k) {
+          ++reps;
+        }
+        i += reps;
+        if (i == data_size) {
+          /* Don't add any cost for the last zero run, since these are encoded
+             only implicitly. */
+          break;
+        }
+        if (reps < 3) {
+          depth_histo[0] += reps;
+        } else {
+          reps -= 2;
+          while (reps > 0) {
+            ++depth_histo[BROTLI_REPEAT_ZERO_CODE_LENGTH];
+            /* Add the 3 extra bits for the 17 code length code. */
+            bits += 3;
+            reps >>= 3;
+          }
+        }
+      }
+    }
+    /* Add the estimated encoding cost of the code length code histogram. */
+    bits += (double)(18 + 2 * max_depth);
+    /* Add the entropy of the code length code histogram. */
+    bits += BitsEntropy(depth_histo, BROTLI_CODE_LENGTH_CODES);
+  }
+  return bits;
+}
+
+#undef HistogramType
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_encoder_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_encoder_inc.h
new file mode 100644
index 0000000000..8cbd5eac67
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_encoder_inc.h
@@ -0,0 +1,34 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2014 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN */
+
+#define HistogramType FN(Histogram)
+
+/* Creates entropy codes for all block types and stores them to the bit
+   stream. */
+static void FN(BuildAndStoreEntropyCodes)(MemoryManager* m, BlockEncoder* self,
+    const HistogramType* histograms, const size_t histograms_size,
+    const size_t alphabet_size, HuffmanTree* tree,
+    size_t* storage_ix, uint8_t* storage) {
+  const size_t table_size = histograms_size * self->histogram_length_;
+  self->depths_ = BROTLI_ALLOC(m, uint8_t, table_size);
+  self->bits_ = BROTLI_ALLOC(m, uint16_t, table_size);
+  if (BROTLI_IS_OOM(m)) return;
+
+  {
+    size_t i;
+    for (i = 0; i < histograms_size; ++i) {
+      size_t ix = i * self->histogram_length_;
+      BuildAndStoreHuffmanTree(&histograms[i].data_[0], self->histogram_length_,
+          alphabet_size, tree, &self->depths_[ix], &self->bits_[ix],
+          storage_ix, storage);
+    }
+  }
+}
+
+#undef HistogramType
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_splitter.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_splitter.c
new file mode 100644
index 0000000000..eba1b691e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_splitter.c
@@ -0,0 +1,217 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Block split point selection utilities. */
+
+#include "block_splitter.h"
+
+#include <string.h>  /* memcpy, memset */
+
+#include "../common/platform.h"
+#include "bit_cost.h"
+#include "cluster.h"
+#include "command.h"
+#include "fast_log.h"
+#include "histogram.h"
+#include "memory.h"
+#include "quality.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static const size_t kMaxLiteralHistograms = 100;
+static const size_t kMaxCommandHistograms = 50;
+static const double kLiteralBlockSwitchCost = 28.1;
+static const double kCommandBlockSwitchCost = 13.5;
+static const double kDistanceBlockSwitchCost = 14.6;
+static const size_t kLiteralStrideLength = 70;
+static const size_t kCommandStrideLength = 40;
+static const size_t kDistanceStrideLength = 40;
+static const size_t kSymbolsPerLiteralHistogram = 544;
+static const size_t kSymbolsPerCommandHistogram = 530;
+static const size_t kSymbolsPerDistanceHistogram = 544;
+static const size_t kMinLengthForBlockSplitting = 128;
+static const size_t kIterMulForRefining = 2;
+static const size_t kMinItersForRefining = 100;
+
+static size_t CountLiterals(const Command* cmds, const size_t num_commands) {
+  /* Count how many we have. */
+  size_t total_length = 0;
+  size_t i;
+  for (i = 0; i < num_commands; ++i) {
+    total_length += cmds[i].insert_len_;
+  }
+  return total_length;
+}
+
+static void CopyLiteralsToByteArray(const Command* cmds,
+                                    const size_t num_commands,
+                                    const uint8_t* data,
+                                    const size_t offset,
+                                    const size_t mask,
+                                    uint8_t* literals) {
+  size_t pos = 0;
+  size_t from_pos = offset & mask;
+  size_t i;
+  for (i = 0; i < num_commands; ++i) {
+    size_t insert_len = cmds[i].insert_len_;
+    if (from_pos + insert_len > mask) {
+      size_t head_size = mask + 1 - from_pos;
+      memcpy(literals + pos, data + from_pos, head_size);
+      from_pos = 0;
+      pos += head_size;
+      insert_len -= head_size;
+    }
+    if (insert_len > 0) {
+      memcpy(literals + pos, data + from_pos, insert_len);
+      pos += insert_len;
+    }
+    from_pos = (from_pos + insert_len + CommandCopyLen(&cmds[i])) & mask;
+  }
+}
+
+static BROTLI_INLINE uint32_t MyRand(uint32_t* seed) {
+  /* Initial seed should be 7. In this case, loop length is (1 << 29). */
+  *seed *= 16807U;
+  return *seed;
+}
+
+static BROTLI_INLINE double BitCost(size_t count) {
+  return count == 0 ? -2.0 : FastLog2(count);
+}
+
+#define HISTOGRAMS_PER_BATCH 64
+#define CLUSTERS_PER_BATCH 16
+
+#define FN(X) X ## Literal
+#define DataType uint8_t
+/* NOLINTNEXTLINE(build/include) */
+#include "block_splitter_inc.h"
+#undef DataType
+#undef FN
+
+#define FN(X) X ## Command
+#define DataType uint16_t
+/* NOLINTNEXTLINE(build/include) */
+#include "block_splitter_inc.h"
+#undef FN
+
+#define FN(X) X ## Distance
+/* NOLINTNEXTLINE(build/include) */
+#include "block_splitter_inc.h"
+#undef DataType
+#undef FN
+
+void BrotliInitBlockSplit(BlockSplit* self) {
+  self->num_types = 0;
+  self->num_blocks = 0;
+  self->types = 0;
+  self->lengths = 0;
+  self->types_alloc_size = 0;
+  self->lengths_alloc_size = 0;
+}
+
+void BrotliDestroyBlockSplit(MemoryManager* m, BlockSplit* self) {
+  BROTLI_FREE(m, self->types);
+  BROTLI_FREE(m, self->lengths);
+}
+
+/* Extracts literals, command distance and prefix codes, then applies
+ * SplitByteVector to create partitioning. */
+void BrotliSplitBlock(MemoryManager* m,
+                      const Command* cmds,
+                      const size_t num_commands,
+                      const uint8_t* data,
+                      const size_t pos,
+                      const size_t mask,
+                      const BrotliEncoderParams* params,
+                      BlockSplit* literal_split,
+                      BlockSplit* insert_and_copy_split,
+                      BlockSplit* dist_split) {
+  {
+    size_t literals_count = CountLiterals(cmds, num_commands);
+    uint8_t* literals = BROTLI_ALLOC(m, uint8_t, literals_count);
+    if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(literals)) return;
+    /* Create a continuous array of literals. */
+    CopyLiteralsToByteArray(cmds, num_commands, data, pos, mask, literals);
+    /* Create the block split on the array of literals.
+     * Literal histograms can have alphabet size up to 256.
+     * Though, to accomodate context modeling, less than half of maximum size
+     * is allowed. */
+    SplitByteVectorLiteral(
+        m, literals, literals_count,
+        kSymbolsPerLiteralHistogram, kMaxLiteralHistograms,
+        kLiteralStrideLength, kLiteralBlockSwitchCost, params,
+        literal_split);
+    if (BROTLI_IS_OOM(m)) return;
+    BROTLI_FREE(m, literals);
+    /* NB: this might be a good place for injecting extra splitting without
+     *     increasing encoder complexity; however, output parition would be less
+     *     optimal than one produced with forced splitting inside
+     *     SplitByteVector (FindBlocks / ClusterBlocks). */
+  }
+
+  {
+    /* Compute prefix codes for commands. */
+    uint16_t* insert_and_copy_codes = BROTLI_ALLOC(m, uint16_t, num_commands);
+    size_t i;
+    if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(insert_and_copy_codes)) return;
+    for (i = 0; i < num_commands; ++i) {
+      insert_and_copy_codes[i] = cmds[i].cmd_prefix_;
+    }
+    /* Create the block split on the array of command prefixes. */
+    SplitByteVectorCommand(
+        m, insert_and_copy_codes, num_commands,
+        kSymbolsPerCommandHistogram, kMaxCommandHistograms,
+        kCommandStrideLength, kCommandBlockSwitchCost, params,
+        insert_and_copy_split);
+    if (BROTLI_IS_OOM(m)) return;
+    /* TODO(eustas): reuse for distances? */
+    BROTLI_FREE(m, insert_and_copy_codes);
+  }
+
+  {
+    /* Create a continuous array of distance prefixes. */
+    uint16_t* distance_prefixes = BROTLI_ALLOC(m, uint16_t, num_commands);
+    size_t j = 0;
+    size_t i;
+    if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(distance_prefixes)) return;
+    for (i = 0; i < num_commands; ++i) {
+      const Command* cmd = &cmds[i];
+      if (CommandCopyLen(cmd) && cmd->cmd_prefix_ >= 128) {
+        distance_prefixes[j++] = cmd->dist_prefix_ & 0x3FF;
+      }
+    }
+    /* Create the block split on the array of distance prefixes. */
+    SplitByteVectorDistance(
+        m, distance_prefixes, j,
+        kSymbolsPerDistanceHistogram, kMaxCommandHistograms,
+        kDistanceStrideLength, kDistanceBlockSwitchCost, params,
+        dist_split);
+    if (BROTLI_IS_OOM(m)) return;
+    BROTLI_FREE(m, distance_prefixes);
+  }
+}
+
+#if defined(BROTLI_TEST)
+size_t CountLiteralsForTest(const Command*, const size_t);
+size_t CountLiteralsForTest(const Command* cmds, const size_t num_commands) {
+  return CountLiterals(cmds, num_commands);
+}
+
+void CopyLiteralsToByteArrayForTest(const Command*,
+    const size_t, const uint8_t*, const size_t, const size_t, uint8_t*);
+void CopyLiteralsToByteArrayForTest(const Command* cmds,
+    const size_t num_commands, const uint8_t* data, const size_t offset,
+    const size_t mask, uint8_t* literals) {
+  CopyLiteralsToByteArray(cmds, num_commands, data, offset, mask, literals);
+}
+#endif
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_splitter.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_splitter.h
new file mode 100644
index 0000000000..6046b90a5d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_splitter.h
@@ -0,0 +1,52 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Block split point selection utilities. */
+
+#ifndef BROTLI_ENC_BLOCK_SPLITTER_H_
+#define BROTLI_ENC_BLOCK_SPLITTER_H_
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+#include "command.h"
+#include "memory.h"
+#include "quality.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+typedef struct BlockSplit {
+  size_t num_types;  /* Amount of distinct types */
+  size_t num_blocks;  /* Amount of values in types and length */
+  uint8_t* types;
+  uint32_t* lengths;
+
+  size_t types_alloc_size;
+  size_t lengths_alloc_size;
+} BlockSplit;
+
+BROTLI_INTERNAL void BrotliInitBlockSplit(BlockSplit* self);
+BROTLI_INTERNAL void BrotliDestroyBlockSplit(MemoryManager* m,
+                                             BlockSplit* self);
+
+BROTLI_INTERNAL void BrotliSplitBlock(MemoryManager* m,
+                                      const Command* cmds,
+                                      const size_t num_commands,
+                                      const uint8_t* data,
+                                      const size_t offset,
+                                      const size_t mask,
+                                      const BrotliEncoderParams* params,
+                                      BlockSplit* literal_split,
+                                      BlockSplit* insert_and_copy_split,
+                                      BlockSplit* dist_split);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_BLOCK_SPLITTER_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_splitter_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_splitter_inc.h
new file mode 100644
index 0000000000..aa40bfd329
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/block_splitter_inc.h
@@ -0,0 +1,481 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN, DataType */
+
+#define HistogramType FN(Histogram)
+
+static void FN(InitialEntropyCodes)(const DataType* data, size_t length,
+                                    size_t stride,
+                                    size_t num_histograms,
+                                    HistogramType* histograms) {
+  uint32_t seed = 7;
+  size_t block_length = length / num_histograms;
+  size_t i;
+  FN(ClearHistograms)(histograms, num_histograms);
+  for (i = 0; i < num_histograms; ++i) {
+    size_t pos = length * i / num_histograms;
+    if (i != 0) {
+      pos += MyRand(&seed) % block_length;
+    }
+    if (pos + stride >= length) {
+      pos = length - stride - 1;
+    }
+    FN(HistogramAddVector)(&histograms[i], data + pos, stride);
+  }
+}
+
+static void FN(RandomSample)(uint32_t* seed,
+                             const DataType* data,
+                             size_t length,
+                             size_t stride,
+                             HistogramType* sample) {
+  size_t pos = 0;
+  if (stride >= length) {
+    stride = length;
+  } else {
+    pos = MyRand(seed) % (length - stride + 1);
+  }
+  FN(HistogramAddVector)(sample, data + pos, stride);
+}
+
+static void FN(RefineEntropyCodes)(const DataType* data, size_t length,
+                                   size_t stride,
+                                   size_t num_histograms,
+                                   HistogramType* histograms,
+                                   HistogramType* tmp) {
+  size_t iters =
+      kIterMulForRefining * length / stride + kMinItersForRefining;
+  uint32_t seed = 7;
+  size_t iter;
+  iters = ((iters + num_histograms - 1) / num_histograms) * num_histograms;
+  for (iter = 0; iter < iters; ++iter) {
+    FN(HistogramClear)(tmp);
+    FN(RandomSample)(&seed, data, length, stride, tmp);
+    FN(HistogramAddHistogram)(&histograms[iter % num_histograms], tmp);
+  }
+}
+
+/* Assigns a block id from the range [0, num_histograms) to each data element
+   in data[0..length) and fills in block_id[0..length) with the assigned values.
+   Returns the number of blocks, i.e. one plus the number of block switches. */
+static size_t FN(FindBlocks)(const DataType* data, const size_t length,
+                             const double block_switch_bitcost,
+                             const size_t num_histograms,
+                             const HistogramType* histograms,
+                             double* insert_cost,
+                             double* cost,
+                             uint8_t* switch_signal,
+                             uint8_t* block_id) {
+  const size_t alphabet_size = FN(HistogramDataSize)();
+  const size_t bitmap_len = (num_histograms + 7) >> 3;
+  size_t num_blocks = 1;
+  size_t byte_ix;
+  size_t i;
+  size_t j;
+  BROTLI_DCHECK(num_histograms <= 256);
+
+  /* Trivial case: single historgram -> single block type. */
+  if (num_histograms <= 1) {
+    for (i = 0; i < length; ++i) {
+      block_id[i] = 0;
+    }
+    return 1;
+  }
+
+  /* Fill bitcost for each symbol of all histograms.
+   * Non-existing symbol cost: 2 + log2(total_count).
+   * Regular symbol cost: -log2(symbol_count / total_count). */
+  memset(insert_cost, 0,
+         sizeof(insert_cost[0]) * alphabet_size * num_histograms);
+  for (i = 0; i < num_histograms; ++i) {
+    insert_cost[i] = FastLog2((uint32_t)histograms[i].total_count_);
+  }
+  for (i = alphabet_size; i != 0;) {
+    /* Reverse order to use the 0-th row as a temporary storage. */
+    --i;
+    for (j = 0; j < num_histograms; ++j) {
+      insert_cost[i * num_histograms + j] =
+          insert_cost[j] - BitCost(histograms[j].data_[i]);
+    }
+  }
+
+  /* After each iteration of this loop, cost[k] will contain the difference
+     between the minimum cost of arriving at the current byte position using
+     entropy code k, and the minimum cost of arriving at the current byte
+     position. This difference is capped at the block switch cost, and if it
+     reaches block switch cost, it means that when we trace back from the last
+     position, we need to switch here. */
+  memset(cost, 0, sizeof(cost[0]) * num_histograms);
+  memset(switch_signal, 0, sizeof(switch_signal[0]) * length * bitmap_len);
+  for (byte_ix = 0; byte_ix < length; ++byte_ix) {
+    size_t ix = byte_ix * bitmap_len;
+    size_t symbol = data[byte_ix];
+    size_t insert_cost_ix = symbol * num_histograms;
+    double min_cost = 1e99;
+    double block_switch_cost = block_switch_bitcost;
+    size_t k;
+    for (k = 0; k < num_histograms; ++k) {
+      /* We are coding the symbol with entropy code k. */
+      cost[k] += insert_cost[insert_cost_ix + k];
+      if (cost[k] < min_cost) {
+        min_cost = cost[k];
+        block_id[byte_ix] = (uint8_t)k;
+      }
+    }
+    /* More blocks for the beginning. */
+    if (byte_ix < 2000) {
+      block_switch_cost *= 0.77 + 0.07 * (double)byte_ix / 2000;
+    }
+    for (k = 0; k < num_histograms; ++k) {
+      cost[k] -= min_cost;
+      if (cost[k] >= block_switch_cost) {
+        const uint8_t mask = (uint8_t)(1u << (k & 7));
+        cost[k] = block_switch_cost;
+        BROTLI_DCHECK((k >> 3) < bitmap_len);
+        switch_signal[ix + (k >> 3)] |= mask;
+      }
+    }
+  }
+
+  byte_ix = length - 1;
+  {  /* Trace back from the last position and switch at the marked places. */
+    size_t ix = byte_ix * bitmap_len;
+    uint8_t cur_id = block_id[byte_ix];
+    while (byte_ix > 0) {
+      const uint8_t mask = (uint8_t)(1u << (cur_id & 7));
+      BROTLI_DCHECK(((size_t)cur_id >> 3) < bitmap_len);
+      --byte_ix;
+      ix -= bitmap_len;
+      if (switch_signal[ix + (cur_id >> 3)] & mask) {
+        if (cur_id != block_id[byte_ix]) {
+          cur_id = block_id[byte_ix];
+          ++num_blocks;
+        }
+      }
+      block_id[byte_ix] = cur_id;
+    }
+  }
+  return num_blocks;
+}
+
+static size_t FN(RemapBlockIds)(uint8_t* block_ids, const size_t length,
+                                uint16_t* new_id, const size_t num_histograms) {
+  static const uint16_t kInvalidId = 256;
+  uint16_t next_id = 0;
+  size_t i;
+  for (i = 0; i < num_histograms; ++i) {
+    new_id[i] = kInvalidId;
+  }
+  for (i = 0; i < length; ++i) {
+    BROTLI_DCHECK(block_ids[i] < num_histograms);
+    if (new_id[block_ids[i]] == kInvalidId) {
+      new_id[block_ids[i]] = next_id++;
+    }
+  }
+  for (i = 0; i < length; ++i) {
+    block_ids[i] = (uint8_t)new_id[block_ids[i]];
+    BROTLI_DCHECK(block_ids[i] < num_histograms);
+  }
+  BROTLI_DCHECK(next_id <= num_histograms);
+  return next_id;
+}
+
+static void FN(BuildBlockHistograms)(const DataType* data, const size_t length,
+                                     const uint8_t* block_ids,
+                                     const size_t num_histograms,
+                                     HistogramType* histograms) {
+  size_t i;
+  FN(ClearHistograms)(histograms, num_histograms);
+  for (i = 0; i < length; ++i) {
+    FN(HistogramAdd)(&histograms[block_ids[i]], data[i]);
+  }
+}
+
+/* Given the initial partitioning build partitioning with limited number
+ * of histograms (and block types). */
+static void FN(ClusterBlocks)(MemoryManager* m,
+                              const DataType* data, const size_t length,
+                              const size_t num_blocks,
+                              uint8_t* block_ids,
+                              BlockSplit* split) {
+  uint32_t* histogram_symbols = BROTLI_ALLOC(m, uint32_t, num_blocks);
+  uint32_t* u32 =
+      BROTLI_ALLOC(m, uint32_t, num_blocks + 4 * HISTOGRAMS_PER_BATCH);
+  const size_t expected_num_clusters = CLUSTERS_PER_BATCH *
+      (num_blocks + HISTOGRAMS_PER_BATCH - 1) / HISTOGRAMS_PER_BATCH;
+  size_t all_histograms_size = 0;
+  size_t all_histograms_capacity = expected_num_clusters;
+  HistogramType* all_histograms =
+      BROTLI_ALLOC(m, HistogramType, all_histograms_capacity);
+  size_t cluster_size_size = 0;
+  size_t cluster_size_capacity = expected_num_clusters;
+  uint32_t* cluster_size = BROTLI_ALLOC(m, uint32_t, cluster_size_capacity);
+  size_t num_clusters = 0;
+  HistogramType* histograms = BROTLI_ALLOC(m, HistogramType,
+      BROTLI_MIN(size_t, num_blocks, HISTOGRAMS_PER_BATCH));
+  size_t max_num_pairs =
+      HISTOGRAMS_PER_BATCH * HISTOGRAMS_PER_BATCH / 2;
+  size_t pairs_capacity = max_num_pairs + 1;
+  HistogramPair* pairs = BROTLI_ALLOC(m, HistogramPair, pairs_capacity);
+  size_t pos = 0;
+  uint32_t* clusters;
+  size_t num_final_clusters;
+  static const uint32_t kInvalidIndex = BROTLI_UINT32_MAX;
+  uint32_t* new_index;
+  size_t i;
+  uint32_t* BROTLI_RESTRICT const sizes = u32 + 0 * HISTOGRAMS_PER_BATCH;
+  uint32_t* BROTLI_RESTRICT const new_clusters = u32 + 1 * HISTOGRAMS_PER_BATCH;
+  uint32_t* BROTLI_RESTRICT const symbols = u32 + 2 * HISTOGRAMS_PER_BATCH;
+  uint32_t* BROTLI_RESTRICT const remap = u32 + 3 * HISTOGRAMS_PER_BATCH;
+  uint32_t* BROTLI_RESTRICT const block_lengths =
+      u32 + 4 * HISTOGRAMS_PER_BATCH;
+  /* TODO(eustas): move to arena? */
+  HistogramType* tmp = BROTLI_ALLOC(m, HistogramType, 2);
+
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(histogram_symbols) ||
+      BROTLI_IS_NULL(u32) || BROTLI_IS_NULL(all_histograms) ||
+      BROTLI_IS_NULL(cluster_size) || BROTLI_IS_NULL(histograms) ||
+      BROTLI_IS_NULL(pairs) || BROTLI_IS_NULL(tmp)) {
+    return;
+  }
+
+  memset(u32, 0, (num_blocks + 4 * HISTOGRAMS_PER_BATCH) * sizeof(uint32_t));
+
+  /* Calculate block lengths (convert repeating values -> series length). */
+  {
+    size_t block_idx = 0;
+    for (i = 0; i < length; ++i) {
+      BROTLI_DCHECK(block_idx < num_blocks);
+      ++block_lengths[block_idx];
+      if (i + 1 == length || block_ids[i] != block_ids[i + 1]) {
+        ++block_idx;
+      }
+    }
+    BROTLI_DCHECK(block_idx == num_blocks);
+  }
+
+  /* Pre-cluster blocks (cluster batches). */
+  for (i = 0; i < num_blocks; i += HISTOGRAMS_PER_BATCH) {
+    const size_t num_to_combine =
+        BROTLI_MIN(size_t, num_blocks - i, HISTOGRAMS_PER_BATCH);
+    size_t num_new_clusters;
+    size_t j;
+    for (j = 0; j < num_to_combine; ++j) {
+      size_t k;
+      size_t block_length = block_lengths[i + j];
+      FN(HistogramClear)(&histograms[j]);
+      for (k = 0; k < block_length; ++k) {
+        FN(HistogramAdd)(&histograms[j], data[pos++]);
+      }
+      histograms[j].bit_cost_ = FN(BrotliPopulationCost)(&histograms[j]);
+      new_clusters[j] = (uint32_t)j;
+      symbols[j] = (uint32_t)j;
+      sizes[j] = 1;
+    }
+    num_new_clusters = FN(BrotliHistogramCombine)(
+        histograms, tmp, sizes, symbols, new_clusters, pairs, num_to_combine,
+        num_to_combine, HISTOGRAMS_PER_BATCH, max_num_pairs);
+    BROTLI_ENSURE_CAPACITY(m, HistogramType, all_histograms,
+        all_histograms_capacity, all_histograms_size + num_new_clusters);
+    BROTLI_ENSURE_CAPACITY(m, uint32_t, cluster_size,
+        cluster_size_capacity, cluster_size_size + num_new_clusters);
+    if (BROTLI_IS_OOM(m)) return;
+    for (j = 0; j < num_new_clusters; ++j) {
+      all_histograms[all_histograms_size++] = histograms[new_clusters[j]];
+      cluster_size[cluster_size_size++] = sizes[new_clusters[j]];
+      remap[new_clusters[j]] = (uint32_t)j;
+    }
+    for (j = 0; j < num_to_combine; ++j) {
+      histogram_symbols[i + j] = (uint32_t)num_clusters + remap[symbols[j]];
+    }
+    num_clusters += num_new_clusters;
+    BROTLI_DCHECK(num_clusters == cluster_size_size);
+    BROTLI_DCHECK(num_clusters == all_histograms_size);
+  }
+  BROTLI_FREE(m, histograms);
+
+  /* Final clustering. */
+  max_num_pairs =
+      BROTLI_MIN(size_t, 64 * num_clusters, (num_clusters / 2) * num_clusters);
+  if (pairs_capacity < max_num_pairs + 1) {
+    BROTLI_FREE(m, pairs);
+    pairs = BROTLI_ALLOC(m, HistogramPair, max_num_pairs + 1);
+    if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(pairs)) return;
+  }
+  clusters = BROTLI_ALLOC(m, uint32_t, num_clusters);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(clusters)) return;
+  for (i = 0; i < num_clusters; ++i) {
+    clusters[i] = (uint32_t)i;
+  }
+  num_final_clusters = FN(BrotliHistogramCombine)(
+      all_histograms, tmp, cluster_size, histogram_symbols, clusters, pairs,
+      num_clusters, num_blocks, BROTLI_MAX_NUMBER_OF_BLOCK_TYPES,
+      max_num_pairs);
+  BROTLI_FREE(m, pairs);
+  BROTLI_FREE(m, cluster_size);
+
+  /* Assign blocks to final histograms. */
+  new_index = BROTLI_ALLOC(m, uint32_t, num_clusters);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(new_index)) return;
+  for (i = 0; i < num_clusters; ++i) new_index[i] = kInvalidIndex;
+  pos = 0;
+  {
+    uint32_t next_index = 0;
+    for (i = 0; i < num_blocks; ++i) {
+      size_t j;
+      uint32_t best_out;
+      double best_bits;
+      FN(HistogramClear)(tmp);
+      for (j = 0; j < block_lengths[i]; ++j) {
+        FN(HistogramAdd)(tmp, data[pos++]);
+      }
+      /* Among equally good histograms prefer last used. */
+      /* TODO(eustas): should we give a block-switch discount here? */
+      best_out = (i == 0) ? histogram_symbols[0] : histogram_symbols[i - 1];
+      best_bits = FN(BrotliHistogramBitCostDistance)(
+          tmp, &all_histograms[best_out], tmp + 1);
+      for (j = 0; j < num_final_clusters; ++j) {
+        const double cur_bits = FN(BrotliHistogramBitCostDistance)(
+            tmp, &all_histograms[clusters[j]], tmp + 1);
+        if (cur_bits < best_bits) {
+          best_bits = cur_bits;
+          best_out = clusters[j];
+        }
+      }
+      histogram_symbols[i] = best_out;
+      if (new_index[best_out] == kInvalidIndex) {
+        new_index[best_out] = next_index++;
+      }
+    }
+  }
+  BROTLI_FREE(m, tmp);
+  BROTLI_FREE(m, clusters);
+  BROTLI_FREE(m, all_histograms);
+  BROTLI_ENSURE_CAPACITY(
+      m, uint8_t, split->types, split->types_alloc_size, num_blocks);
+  BROTLI_ENSURE_CAPACITY(
+      m, uint32_t, split->lengths, split->lengths_alloc_size, num_blocks);
+  if (BROTLI_IS_OOM(m)) return;
+
+  /* Rewrite final assignment to block-split. There might be less blocks
+   * than |num_blocks| due to clustering. */
+  {
+    uint32_t cur_length = 0;
+    size_t block_idx = 0;
+    uint8_t max_type = 0;
+    for (i = 0; i < num_blocks; ++i) {
+      cur_length += block_lengths[i];
+      if (i + 1 == num_blocks ||
+          histogram_symbols[i] != histogram_symbols[i + 1]) {
+        const uint8_t id = (uint8_t)new_index[histogram_symbols[i]];
+        split->types[block_idx] = id;
+        split->lengths[block_idx] = cur_length;
+        max_type = BROTLI_MAX(uint8_t, max_type, id);
+        cur_length = 0;
+        ++block_idx;
+      }
+    }
+    split->num_blocks = block_idx;
+    split->num_types = (size_t)max_type + 1;
+  }
+  BROTLI_FREE(m, new_index);
+  BROTLI_FREE(m, u32);
+  BROTLI_FREE(m, histogram_symbols);
+}
+
+/* Create BlockSplit (partitioning) given the limits, estimates and "effort"
+ * parameters.
+ *
+ * NB: max_histograms is often less than number of histograms allowed by format;
+ *     this is done intentionally, to save some "space" for context-aware
+ *     clustering (here entropy is estimated for context-free symbols). */
+static void FN(SplitByteVector)(MemoryManager* m,
+                                const DataType* data, const size_t length,
+                                const size_t symbols_per_histogram,
+                                const size_t max_histograms,
+                                const size_t sampling_stride_length,
+                                const double block_switch_cost,
+                                const BrotliEncoderParams* params,
+                                BlockSplit* split) {
+  const size_t data_size = FN(HistogramDataSize)();
+  HistogramType* histograms;
+  HistogramType* tmp;
+  /* Calculate number of histograms; initial estimate is one histogram per
+   * specified amount of symbols; however, this value is capped. */
+  size_t num_histograms = length / symbols_per_histogram + 1;
+  if (num_histograms > max_histograms) {
+    num_histograms = max_histograms;
+  }
+
+  /* Corner case: no input. */
+  if (length == 0) {
+    split->num_types = 1;
+    return;
+  }
+
+  if (length < kMinLengthForBlockSplitting) {
+    BROTLI_ENSURE_CAPACITY(m, uint8_t,
+        split->types, split->types_alloc_size, split->num_blocks + 1);
+    BROTLI_ENSURE_CAPACITY(m, uint32_t,
+        split->lengths, split->lengths_alloc_size, split->num_blocks + 1);
+    if (BROTLI_IS_OOM(m)) return;
+    split->num_types = 1;
+    split->types[split->num_blocks] = 0;
+    split->lengths[split->num_blocks] = (uint32_t)length;
+    split->num_blocks++;
+    return;
+  }
+  histograms = BROTLI_ALLOC(m, HistogramType, num_histograms + 1);
+  tmp = histograms + num_histograms;
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(histograms)) return;
+  /* Find good entropy codes. */
+  FN(InitialEntropyCodes)(data, length,
+                          sampling_stride_length,
+                          num_histograms, histograms);
+  FN(RefineEntropyCodes)(data, length,
+                         sampling_stride_length,
+                         num_histograms, histograms, tmp);
+  {
+    /* Find a good path through literals with the good entropy codes. */
+    uint8_t* block_ids = BROTLI_ALLOC(m, uint8_t, length);
+    size_t num_blocks = 0;
+    const size_t bitmaplen = (num_histograms + 7) >> 3;
+    double* insert_cost = BROTLI_ALLOC(m, double, data_size * num_histograms);
+    double* cost = BROTLI_ALLOC(m, double, num_histograms);
+    uint8_t* switch_signal = BROTLI_ALLOC(m, uint8_t, length * bitmaplen);
+    uint16_t* new_id = BROTLI_ALLOC(m, uint16_t, num_histograms);
+    const size_t iters = params->quality < HQ_ZOPFLIFICATION_QUALITY ? 3 : 10;
+    size_t i;
+    if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(block_ids) ||
+        BROTLI_IS_NULL(insert_cost) || BROTLI_IS_NULL(cost) ||
+        BROTLI_IS_NULL(switch_signal) || BROTLI_IS_NULL(new_id)) {
+      return;
+    }
+    for (i = 0; i < iters; ++i) {
+      num_blocks = FN(FindBlocks)(data, length,
+                                  block_switch_cost,
+                                  num_histograms, histograms,
+                                  insert_cost, cost, switch_signal,
+                                  block_ids);
+      num_histograms = FN(RemapBlockIds)(block_ids, length,
+                                         new_id, num_histograms);
+      FN(BuildBlockHistograms)(data, length, block_ids,
+                               num_histograms, histograms);
+    }
+    BROTLI_FREE(m, insert_cost);
+    BROTLI_FREE(m, cost);
+    BROTLI_FREE(m, switch_signal);
+    BROTLI_FREE(m, new_id);
+    BROTLI_FREE(m, histograms);
+    FN(ClusterBlocks)(m, data, length, num_blocks, block_ids, split);
+    if (BROTLI_IS_OOM(m)) return;
+    BROTLI_FREE(m, block_ids);
+  }
+}
+
+#undef HistogramType
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/brotli_bit_stream.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/brotli_bit_stream.c
new file mode 100644
index 0000000000..5fa0c69aa8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/brotli_bit_stream.c
@@ -0,0 +1,1336 @@
+/* Copyright 2014 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Brotli bit stream functions to support the low level format. There are no
+   compression algorithms here, just the right ordering of bits to match the
+   specs. */
+
+#include "brotli_bit_stream.h"
+
+#include <string.h>  /* memcpy, memset */
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/context.h"
+#include "../common/platform.h"
+#include "entropy_encode.h"
+#include "entropy_encode_static.h"
+#include "fast_log.h"
+#include "histogram.h"
+#include "memory.h"
+#include "write_bits.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define MAX_HUFFMAN_TREE_SIZE (2 * BROTLI_NUM_COMMAND_SYMBOLS + 1)
+/* The maximum size of Huffman dictionary for distances assuming that
+   NPOSTFIX = 0 and NDIRECT = 0. */
+#define MAX_SIMPLE_DISTANCE_ALPHABET_SIZE \
+  BROTLI_DISTANCE_ALPHABET_SIZE(0, 0, BROTLI_LARGE_MAX_DISTANCE_BITS)
+/* MAX_SIMPLE_DISTANCE_ALPHABET_SIZE == 140 */
+
+static BROTLI_INLINE uint32_t BlockLengthPrefixCode(uint32_t len) {
+  uint32_t code = (len >= 177) ? (len >= 753 ? 20 : 14) : (len >= 41 ? 7 : 0);
+  while (code < (BROTLI_NUM_BLOCK_LEN_SYMBOLS - 1) &&
+      len >= _kBrotliPrefixCodeRanges[code + 1].offset) ++code;
+  return code;
+}
+
+static BROTLI_INLINE void GetBlockLengthPrefixCode(uint32_t len, size_t* code,
+    uint32_t* n_extra, uint32_t* extra) {
+  *code = BlockLengthPrefixCode(len);
+  *n_extra = _kBrotliPrefixCodeRanges[*code].nbits;
+  *extra = len - _kBrotliPrefixCodeRanges[*code].offset;
+}
+
+typedef struct BlockTypeCodeCalculator {
+  size_t last_type;
+  size_t second_last_type;
+} BlockTypeCodeCalculator;
+
+static void InitBlockTypeCodeCalculator(BlockTypeCodeCalculator* self) {
+  self->last_type = 1;
+  self->second_last_type = 0;
+}
+
+static BROTLI_INLINE size_t NextBlockTypeCode(
+    BlockTypeCodeCalculator* calculator, uint8_t type) {
+  size_t type_code = (type == calculator->last_type + 1) ? 1u :
+      (type == calculator->second_last_type) ? 0u : type + 2u;
+  calculator->second_last_type = calculator->last_type;
+  calculator->last_type = type;
+  return type_code;
+}
+
+/* |nibblesbits| represents the 2 bits to encode MNIBBLES (0-3)
+   REQUIRES: length > 0
+   REQUIRES: length <= (1 << 24) */
+static void BrotliEncodeMlen(size_t length, uint64_t* bits,
+                             size_t* numbits, uint64_t* nibblesbits) {
+  size_t lg = (length == 1) ? 1 : Log2FloorNonZero((uint32_t)(length - 1)) + 1;
+  size_t mnibbles = (lg < 16 ? 16 : (lg + 3)) / 4;
+  BROTLI_DCHECK(length > 0);
+  BROTLI_DCHECK(length <= (1 << 24));
+  BROTLI_DCHECK(lg <= 24);
+  *nibblesbits = mnibbles - 4;
+  *numbits = mnibbles * 4;
+  *bits = length - 1;
+}
+
+static BROTLI_INLINE void StoreCommandExtra(
+    const Command* cmd, size_t* storage_ix, uint8_t* storage) {
+  uint32_t copylen_code = CommandCopyLenCode(cmd);
+  uint16_t inscode = GetInsertLengthCode(cmd->insert_len_);
+  uint16_t copycode = GetCopyLengthCode(copylen_code);
+  uint32_t insnumextra = GetInsertExtra(inscode);
+  uint64_t insextraval = cmd->insert_len_ - GetInsertBase(inscode);
+  uint64_t copyextraval = copylen_code - GetCopyBase(copycode);
+  uint64_t bits = (copyextraval << insnumextra) | insextraval;
+  BrotliWriteBits(
+      insnumextra + GetCopyExtra(copycode), bits, storage_ix, storage);
+}
+
+/* Data structure that stores almost everything that is needed to encode each
+   block switch command. */
+typedef struct BlockSplitCode {
+  BlockTypeCodeCalculator type_code_calculator;
+  uint8_t type_depths[BROTLI_MAX_BLOCK_TYPE_SYMBOLS];
+  uint16_t type_bits[BROTLI_MAX_BLOCK_TYPE_SYMBOLS];
+  uint8_t length_depths[BROTLI_NUM_BLOCK_LEN_SYMBOLS];
+  uint16_t length_bits[BROTLI_NUM_BLOCK_LEN_SYMBOLS];
+} BlockSplitCode;
+
+/* Stores a number between 0 and 255. */
+static void StoreVarLenUint8(size_t n, size_t* storage_ix, uint8_t* storage) {
+  if (n == 0) {
+    BrotliWriteBits(1, 0, storage_ix, storage);
+  } else {
+    size_t nbits = Log2FloorNonZero(n);
+    BrotliWriteBits(1, 1, storage_ix, storage);
+    BrotliWriteBits(3, nbits, storage_ix, storage);
+    BrotliWriteBits(nbits, n - ((size_t)1 << nbits), storage_ix, storage);
+  }
+}
+
+/* Stores the compressed meta-block header.
+   REQUIRES: length > 0
+   REQUIRES: length <= (1 << 24) */
+static void StoreCompressedMetaBlockHeader(BROTLI_BOOL is_final_block,
+                                           size_t length,
+                                           size_t* storage_ix,
+                                           uint8_t* storage) {
+  uint64_t lenbits;
+  size_t nlenbits;
+  uint64_t nibblesbits;
+
+  /* Write ISLAST bit. */
+  BrotliWriteBits(1, (uint64_t)is_final_block, storage_ix, storage);
+  /* Write ISEMPTY bit. */
+  if (is_final_block) {
+    BrotliWriteBits(1, 0, storage_ix, storage);
+  }
+
+  BrotliEncodeMlen(length, &lenbits, &nlenbits, &nibblesbits);
+  BrotliWriteBits(2, nibblesbits, storage_ix, storage);
+  BrotliWriteBits(nlenbits, lenbits, storage_ix, storage);
+
+  if (!is_final_block) {
+    /* Write ISUNCOMPRESSED bit. */
+    BrotliWriteBits(1, 0, storage_ix, storage);
+  }
+}
+
+/* Stores the uncompressed meta-block header.
+   REQUIRES: length > 0
+   REQUIRES: length <= (1 << 24) */
+static void BrotliStoreUncompressedMetaBlockHeader(size_t length,
+                                                   size_t* storage_ix,
+                                                   uint8_t* storage) {
+  uint64_t lenbits;
+  size_t nlenbits;
+  uint64_t nibblesbits;
+
+  /* Write ISLAST bit.
+     Uncompressed block cannot be the last one, so set to 0. */
+  BrotliWriteBits(1, 0, storage_ix, storage);
+  BrotliEncodeMlen(length, &lenbits, &nlenbits, &nibblesbits);
+  BrotliWriteBits(2, nibblesbits, storage_ix, storage);
+  BrotliWriteBits(nlenbits, lenbits, storage_ix, storage);
+  /* Write ISUNCOMPRESSED bit. */
+  BrotliWriteBits(1, 1, storage_ix, storage);
+}
+
+static void BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask(
+    const int num_codes, const uint8_t* code_length_bitdepth,
+    size_t* storage_ix, uint8_t* storage) {
+  static const uint8_t kStorageOrder[BROTLI_CODE_LENGTH_CODES] = {
+    1, 2, 3, 4, 0, 5, 17, 6, 16, 7, 8, 9, 10, 11, 12, 13, 14, 15
+  };
+  /* The bit lengths of the Huffman code over the code length alphabet
+     are compressed with the following static Huffman code:
+       Symbol   Code
+       ------   ----
+       0          00
+       1        1110
+       2         110
+       3          01
+       4          10
+       5        1111 */
+  static const uint8_t kHuffmanBitLengthHuffmanCodeSymbols[6] = {
+     0, 7, 3, 2, 1, 15
+  };
+  static const uint8_t kHuffmanBitLengthHuffmanCodeBitLengths[6] = {
+    2, 4, 3, 2, 2, 4
+  };
+
+  size_t skip_some = 0;  /* skips none. */
+
+  /* Throw away trailing zeros: */
+  size_t codes_to_store = BROTLI_CODE_LENGTH_CODES;
+  if (num_codes > 1) {
+    for (; codes_to_store > 0; --codes_to_store) {
+      if (code_length_bitdepth[kStorageOrder[codes_to_store - 1]] != 0) {
+        break;
+      }
+    }
+  }
+  if (code_length_bitdepth[kStorageOrder[0]] == 0 &&
+      code_length_bitdepth[kStorageOrder[1]] == 0) {
+    skip_some = 2;  /* skips two. */
+    if (code_length_bitdepth[kStorageOrder[2]] == 0) {
+      skip_some = 3;  /* skips three. */
+    }
+  }
+  BrotliWriteBits(2, skip_some, storage_ix, storage);
+  {
+    size_t i;
+    for (i = skip_some; i < codes_to_store; ++i) {
+      size_t l = code_length_bitdepth[kStorageOrder[i]];
+      BrotliWriteBits(kHuffmanBitLengthHuffmanCodeBitLengths[l],
+          kHuffmanBitLengthHuffmanCodeSymbols[l], storage_ix, storage);
+    }
+  }
+}
+
+static void BrotliStoreHuffmanTreeToBitMask(
+    const size_t huffman_tree_size, const uint8_t* huffman_tree,
+    const uint8_t* huffman_tree_extra_bits, const uint8_t* code_length_bitdepth,
+    const uint16_t* code_length_bitdepth_symbols,
+    size_t* BROTLI_RESTRICT storage_ix, uint8_t* BROTLI_RESTRICT storage) {
+  size_t i;
+  for (i = 0; i < huffman_tree_size; ++i) {
+    size_t ix = huffman_tree[i];
+    BrotliWriteBits(code_length_bitdepth[ix], code_length_bitdepth_symbols[ix],
+                    storage_ix, storage);
+    /* Extra bits */
+    switch (ix) {
+      case BROTLI_REPEAT_PREVIOUS_CODE_LENGTH:
+        BrotliWriteBits(2, huffman_tree_extra_bits[i], storage_ix, storage);
+        break;
+      case BROTLI_REPEAT_ZERO_CODE_LENGTH:
+        BrotliWriteBits(3, huffman_tree_extra_bits[i], storage_ix, storage);
+        break;
+    }
+  }
+}
+
+static void StoreSimpleHuffmanTree(const uint8_t* depths,
+                                   size_t symbols[4],
+                                   size_t num_symbols,
+                                   size_t max_bits,
+                                   size_t* storage_ix, uint8_t* storage) {
+  /* value of 1 indicates a simple Huffman code */
+  BrotliWriteBits(2, 1, storage_ix, storage);
+  BrotliWriteBits(2, num_symbols - 1, storage_ix, storage);  /* NSYM - 1 */
+
+  {
+    /* Sort */
+    size_t i;
+    for (i = 0; i < num_symbols; i++) {
+      size_t j;
+      for (j = i + 1; j < num_symbols; j++) {
+        if (depths[symbols[j]] < depths[symbols[i]]) {
+          BROTLI_SWAP(size_t, symbols, j, i);
+        }
+      }
+    }
+  }
+
+  if (num_symbols == 2) {
+    BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);
+    BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);
+  } else if (num_symbols == 3) {
+    BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);
+    BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);
+    BrotliWriteBits(max_bits, symbols[2], storage_ix, storage);
+  } else {
+    BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);
+    BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);
+    BrotliWriteBits(max_bits, symbols[2], storage_ix, storage);
+    BrotliWriteBits(max_bits, symbols[3], storage_ix, storage);
+    /* tree-select */
+    BrotliWriteBits(1, depths[symbols[0]] == 1 ? 1 : 0, storage_ix, storage);
+  }
+}
+
+/* num = alphabet size
+   depths = symbol depths */
+void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num,
+                            HuffmanTree* tree,
+                            size_t* storage_ix, uint8_t* storage) {
+  /* Write the Huffman tree into the brotli-representation.
+     The command alphabet is the largest, so this allocation will fit all
+     alphabets. */
+  /* TODO(eustas): fix me */
+  uint8_t huffman_tree[BROTLI_NUM_COMMAND_SYMBOLS];
+  uint8_t huffman_tree_extra_bits[BROTLI_NUM_COMMAND_SYMBOLS];
+  size_t huffman_tree_size = 0;
+  uint8_t code_length_bitdepth[BROTLI_CODE_LENGTH_CODES] = { 0 };
+  uint16_t code_length_bitdepth_symbols[BROTLI_CODE_LENGTH_CODES];
+  uint32_t huffman_tree_histogram[BROTLI_CODE_LENGTH_CODES] = { 0 };
+  size_t i;
+  int num_codes = 0;
+  size_t code = 0;
+
+  BROTLI_DCHECK(num <= BROTLI_NUM_COMMAND_SYMBOLS);
+
+  BrotliWriteHuffmanTree(depths, num, &huffman_tree_size, huffman_tree,
+                         huffman_tree_extra_bits);
+
+  /* Calculate the statistics of the Huffman tree in brotli-representation. */
+  for (i = 0; i < huffman_tree_size; ++i) {
+    ++huffman_tree_histogram[huffman_tree[i]];
+  }
+
+  for (i = 0; i < BROTLI_CODE_LENGTH_CODES; ++i) {
+    if (huffman_tree_histogram[i]) {
+      if (num_codes == 0) {
+        code = i;
+        num_codes = 1;
+      } else if (num_codes == 1) {
+        num_codes = 2;
+        break;
+      }
+    }
+  }
+
+  /* Calculate another Huffman tree to use for compressing both the
+     earlier Huffman tree with. */
+  BrotliCreateHuffmanTree(huffman_tree_histogram, BROTLI_CODE_LENGTH_CODES,
+                          5, tree, code_length_bitdepth);
+  BrotliConvertBitDepthsToSymbols(code_length_bitdepth,
+                                  BROTLI_CODE_LENGTH_CODES,
+                                  code_length_bitdepth_symbols);
+
+  /* Now, we have all the data, let's start storing it */
+  BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask(num_codes, code_length_bitdepth,
+                                               storage_ix, storage);
+
+  if (num_codes == 1) {
+    code_length_bitdepth[code] = 0;
+  }
+
+  /* Store the real Huffman tree now. */
+  BrotliStoreHuffmanTreeToBitMask(huffman_tree_size,
+                                  huffman_tree,
+                                  huffman_tree_extra_bits,
+                                  code_length_bitdepth,
+                                  code_length_bitdepth_symbols,
+                                  storage_ix, storage);
+}
+
+/* Builds a Huffman tree from histogram[0:length] into depth[0:length] and
+   bits[0:length] and stores the encoded tree to the bit stream. */
+static void BuildAndStoreHuffmanTree(const uint32_t* histogram,
+                                     const size_t histogram_length,
+                                     const size_t alphabet_size,
+                                     HuffmanTree* tree,
+                                     uint8_t* depth,
+                                     uint16_t* bits,
+                                     size_t* storage_ix,
+                                     uint8_t* storage) {
+  size_t count = 0;
+  size_t s4[4] = { 0 };
+  size_t i;
+  size_t max_bits = 0;
+  for (i = 0; i < histogram_length; i++) {
+    if (histogram[i]) {
+      if (count < 4) {
+        s4[count] = i;
+      } else if (count > 4) {
+        break;
+      }
+      count++;
+    }
+  }
+
+  {
+    size_t max_bits_counter = alphabet_size - 1;
+    while (max_bits_counter) {
+      max_bits_counter >>= 1;
+      ++max_bits;
+    }
+  }
+
+  if (count <= 1) {
+    BrotliWriteBits(4, 1, storage_ix, storage);
+    BrotliWriteBits(max_bits, s4[0], storage_ix, storage);
+    depth[s4[0]] = 0;
+    bits[s4[0]] = 0;
+    return;
+  }
+
+  memset(depth, 0, histogram_length * sizeof(depth[0]));
+  BrotliCreateHuffmanTree(histogram, histogram_length, 15, tree, depth);
+  BrotliConvertBitDepthsToSymbols(depth, histogram_length, bits);
+
+  if (count <= 4) {
+    StoreSimpleHuffmanTree(depth, s4, count, max_bits, storage_ix, storage);
+  } else {
+    BrotliStoreHuffmanTree(depth, histogram_length, tree, storage_ix, storage);
+  }
+}
+
+static BROTLI_INLINE BROTLI_BOOL SortHuffmanTree(
+    const HuffmanTree* v0, const HuffmanTree* v1) {
+  return TO_BROTLI_BOOL(v0->total_count_ < v1->total_count_);
+}
+
+void BrotliBuildAndStoreHuffmanTreeFast(HuffmanTree* tree,
+                                        const uint32_t* histogram,
+                                        const size_t histogram_total,
+                                        const size_t max_bits,
+                                        uint8_t* depth, uint16_t* bits,
+                                        size_t* storage_ix,
+                                        uint8_t* storage) {
+  size_t count = 0;
+  size_t symbols[4] = { 0 };
+  size_t length = 0;
+  size_t total = histogram_total;
+  while (total != 0) {
+    if (histogram[length]) {
+      if (count < 4) {
+        symbols[count] = length;
+      }
+      ++count;
+      total -= histogram[length];
+    }
+    ++length;
+  }
+
+  if (count <= 1) {
+    BrotliWriteBits(4, 1, storage_ix, storage);
+    BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);
+    depth[symbols[0]] = 0;
+    bits[symbols[0]] = 0;
+    return;
+  }
+
+  memset(depth, 0, length * sizeof(depth[0]));
+  {
+    uint32_t count_limit;
+    for (count_limit = 1; ; count_limit *= 2) {
+      HuffmanTree* node = tree;
+      size_t l;
+      for (l = length; l != 0;) {
+        --l;
+        if (histogram[l]) {
+          if (BROTLI_PREDICT_TRUE(histogram[l] >= count_limit)) {
+            InitHuffmanTree(node, histogram[l], -1, (int16_t)l);
+          } else {
+            InitHuffmanTree(node, count_limit, -1, (int16_t)l);
+          }
+          ++node;
+        }
+      }
+      {
+        const int n = (int)(node - tree);
+        HuffmanTree sentinel;
+        int i = 0;      /* Points to the next leaf node. */
+        int j = n + 1;  /* Points to the next non-leaf node. */
+        int k;
+
+        SortHuffmanTreeItems(tree, (size_t)n, SortHuffmanTree);
+        /* The nodes are:
+           [0, n): the sorted leaf nodes that we start with.
+           [n]: we add a sentinel here.
+           [n + 1, 2n): new parent nodes are added here, starting from
+                        (n+1). These are naturally in ascending order.
+           [2n]: we add a sentinel at the end as well.
+           There will be (2n+1) elements at the end. */
+        InitHuffmanTree(&sentinel, BROTLI_UINT32_MAX, -1, -1);
+        *node++ = sentinel;
+        *node++ = sentinel;
+
+        for (k = n - 1; k > 0; --k) {
+          int left, right;
+          if (tree[i].total_count_ <= tree[j].total_count_) {
+            left = i;
+            ++i;
+          } else {
+            left = j;
+            ++j;
+          }
+          if (tree[i].total_count_ <= tree[j].total_count_) {
+            right = i;
+            ++i;
+          } else {
+            right = j;
+            ++j;
+          }
+          /* The sentinel node becomes the parent node. */
+          node[-1].total_count_ =
+              tree[left].total_count_ + tree[right].total_count_;
+          node[-1].index_left_ = (int16_t)left;
+          node[-1].index_right_or_value_ = (int16_t)right;
+          /* Add back the last sentinel node. */
+          *node++ = sentinel;
+        }
+        if (BrotliSetDepth(2 * n - 1, tree, depth, 14)) {
+          /* We need to pack the Huffman tree in 14 bits. If this was not
+             successful, add fake entities to the lowest values and retry. */
+          break;
+        }
+      }
+    }
+  }
+  BrotliConvertBitDepthsToSymbols(depth, length, bits);
+  if (count <= 4) {
+    size_t i;
+    /* value of 1 indicates a simple Huffman code */
+    BrotliWriteBits(2, 1, storage_ix, storage);
+    BrotliWriteBits(2, count - 1, storage_ix, storage);  /* NSYM - 1 */
+
+    /* Sort */
+    for (i = 0; i < count; i++) {
+      size_t j;
+      for (j = i + 1; j < count; j++) {
+        if (depth[symbols[j]] < depth[symbols[i]]) {
+          BROTLI_SWAP(size_t, symbols, j, i);
+        }
+      }
+    }
+
+    if (count == 2) {
+      BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);
+      BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);
+    } else if (count == 3) {
+      BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);
+      BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);
+      BrotliWriteBits(max_bits, symbols[2], storage_ix, storage);
+    } else {
+      BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);
+      BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);
+      BrotliWriteBits(max_bits, symbols[2], storage_ix, storage);
+      BrotliWriteBits(max_bits, symbols[3], storage_ix, storage);
+      /* tree-select */
+      BrotliWriteBits(1, depth[symbols[0]] == 1 ? 1 : 0, storage_ix, storage);
+    }
+  } else {
+    uint8_t previous_value = 8;
+    size_t i;
+    /* Complex Huffman Tree */
+    StoreStaticCodeLengthCode(storage_ix, storage);
+
+    /* Actual RLE coding. */
+    for (i = 0; i < length;) {
+      const uint8_t value = depth[i];
+      size_t reps = 1;
+      size_t k;
+      for (k = i + 1; k < length && depth[k] == value; ++k) {
+        ++reps;
+      }
+      i += reps;
+      if (value == 0) {
+        BrotliWriteBits(kZeroRepsDepth[reps], kZeroRepsBits[reps],
+                        storage_ix, storage);
+      } else {
+        if (previous_value != value) {
+          BrotliWriteBits(kCodeLengthDepth[value], kCodeLengthBits[value],
+                          storage_ix, storage);
+          --reps;
+        }
+        if (reps < 3) {
+          while (reps != 0) {
+            reps--;
+            BrotliWriteBits(kCodeLengthDepth[value], kCodeLengthBits[value],
+                            storage_ix, storage);
+          }
+        } else {
+          reps -= 3;
+          BrotliWriteBits(kNonZeroRepsDepth[reps], kNonZeroRepsBits[reps],
+                          storage_ix, storage);
+        }
+        previous_value = value;
+      }
+    }
+  }
+}
+
+static size_t IndexOf(const uint8_t* v, size_t v_size, uint8_t value) {
+  size_t i = 0;
+  for (; i < v_size; ++i) {
+    if (v[i] == value) return i;
+  }
+  return i;
+}
+
+static void MoveToFront(uint8_t* v, size_t index) {
+  uint8_t value = v[index];
+  size_t i;
+  for (i = index; i != 0; --i) {
+    v[i] = v[i - 1];
+  }
+  v[0] = value;
+}
+
+static void MoveToFrontTransform(const uint32_t* BROTLI_RESTRICT v_in,
+                                 const size_t v_size,
+                                 uint32_t* v_out) {
+  size_t i;
+  uint8_t mtf[256];
+  uint32_t max_value;
+  if (v_size == 0) {
+    return;
+  }
+  max_value = v_in[0];
+  for (i = 1; i < v_size; ++i) {
+    if (v_in[i] > max_value) max_value = v_in[i];
+  }
+  BROTLI_DCHECK(max_value < 256u);
+  for (i = 0; i <= max_value; ++i) {
+    mtf[i] = (uint8_t)i;
+  }
+  {
+    size_t mtf_size = max_value + 1;
+    for (i = 0; i < v_size; ++i) {
+      size_t index = IndexOf(mtf, mtf_size, (uint8_t)v_in[i]);
+      BROTLI_DCHECK(index < mtf_size);
+      v_out[i] = (uint32_t)index;
+      MoveToFront(mtf, index);
+    }
+  }
+}
+
+/* Finds runs of zeros in v[0..in_size) and replaces them with a prefix code of
+   the run length plus extra bits (lower 9 bits is the prefix code and the rest
+   are the extra bits). Non-zero values in v[] are shifted by
+   *max_length_prefix. Will not create prefix codes bigger than the initial
+   value of *max_run_length_prefix. The prefix code of run length L is simply
+   Log2Floor(L) and the number of extra bits is the same as the prefix code. */
+static void RunLengthCodeZeros(const size_t in_size,
+    uint32_t* BROTLI_RESTRICT v, size_t* BROTLI_RESTRICT out_size,
+    uint32_t* BROTLI_RESTRICT max_run_length_prefix) {
+  uint32_t max_reps = 0;
+  size_t i;
+  uint32_t max_prefix;
+  for (i = 0; i < in_size;) {
+    uint32_t reps = 0;
+    for (; i < in_size && v[i] != 0; ++i) ;
+    for (; i < in_size && v[i] == 0; ++i) {
+      ++reps;
+    }
+    max_reps = BROTLI_MAX(uint32_t, reps, max_reps);
+  }
+  max_prefix = max_reps > 0 ? Log2FloorNonZero(max_reps) : 0;
+  max_prefix = BROTLI_MIN(uint32_t, max_prefix, *max_run_length_prefix);
+  *max_run_length_prefix = max_prefix;
+  *out_size = 0;
+  for (i = 0; i < in_size;) {
+    BROTLI_DCHECK(*out_size <= i);
+    if (v[i] != 0) {
+      v[*out_size] = v[i] + *max_run_length_prefix;
+      ++i;
+      ++(*out_size);
+    } else {
+      uint32_t reps = 1;
+      size_t k;
+      for (k = i + 1; k < in_size && v[k] == 0; ++k) {
+        ++reps;
+      }
+      i += reps;
+      while (reps != 0) {
+        if (reps < (2u << max_prefix)) {
+          uint32_t run_length_prefix = Log2FloorNonZero(reps);
+          const uint32_t extra_bits = reps - (1u << run_length_prefix);
+          v[*out_size] = run_length_prefix + (extra_bits << 9);
+          ++(*out_size);
+          break;
+        } else {
+          const uint32_t extra_bits = (1u << max_prefix) - 1u;
+          v[*out_size] = max_prefix + (extra_bits << 9);
+          reps -= (2u << max_prefix) - 1u;
+          ++(*out_size);
+        }
+      }
+    }
+  }
+}
+
+#define SYMBOL_BITS 9
+
+typedef struct EncodeContextMapArena {
+  uint32_t histogram[BROTLI_MAX_CONTEXT_MAP_SYMBOLS];
+  uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS];
+  uint16_t bits[BROTLI_MAX_CONTEXT_MAP_SYMBOLS];
+} EncodeContextMapArena;
+
+static void EncodeContextMap(MemoryManager* m,
+                             EncodeContextMapArena* arena,
+                             const uint32_t* context_map,
+                             size_t context_map_size,
+                             size_t num_clusters,
+                             HuffmanTree* tree,
+                             size_t* storage_ix, uint8_t* storage) {
+  size_t i;
+  uint32_t* rle_symbols;
+  uint32_t max_run_length_prefix = 6;
+  size_t num_rle_symbols = 0;
+  uint32_t* BROTLI_RESTRICT const histogram = arena->histogram;
+  static const uint32_t kSymbolMask = (1u << SYMBOL_BITS) - 1u;
+  uint8_t* BROTLI_RESTRICT const depths = arena->depths;
+  uint16_t* BROTLI_RESTRICT const bits = arena->bits;
+
+  StoreVarLenUint8(num_clusters - 1, storage_ix, storage);
+
+  if (num_clusters == 1) {
+    return;
+  }
+
+  rle_symbols = BROTLI_ALLOC(m, uint32_t, context_map_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(rle_symbols)) return;
+  MoveToFrontTransform(context_map, context_map_size, rle_symbols);
+  RunLengthCodeZeros(context_map_size, rle_symbols,
+                     &num_rle_symbols, &max_run_length_prefix);
+  memset(histogram, 0, sizeof(arena->histogram));
+  for (i = 0; i < num_rle_symbols; ++i) {
+    ++histogram[rle_symbols[i] & kSymbolMask];
+  }
+  {
+    BROTLI_BOOL use_rle = TO_BROTLI_BOOL(max_run_length_prefix > 0);
+    BrotliWriteBits(1, (uint64_t)use_rle, storage_ix, storage);
+    if (use_rle) {
+      BrotliWriteBits(4, max_run_length_prefix - 1, storage_ix, storage);
+    }
+  }
+  BuildAndStoreHuffmanTree(histogram, num_clusters + max_run_length_prefix,
+                           num_clusters + max_run_length_prefix,
+                           tree, depths, bits, storage_ix, storage);
+  for (i = 0; i < num_rle_symbols; ++i) {
+    const uint32_t rle_symbol = rle_symbols[i] & kSymbolMask;
+    const uint32_t extra_bits_val = rle_symbols[i] >> SYMBOL_BITS;
+    BrotliWriteBits(depths[rle_symbol], bits[rle_symbol], storage_ix, storage);
+    if (rle_symbol > 0 && rle_symbol <= max_run_length_prefix) {
+      BrotliWriteBits(rle_symbol, extra_bits_val, storage_ix, storage);
+    }
+  }
+  BrotliWriteBits(1, 1, storage_ix, storage);  /* use move-to-front */
+  BROTLI_FREE(m, rle_symbols);
+}
+
+/* Stores the block switch command with index block_ix to the bit stream. */
+static BROTLI_INLINE void StoreBlockSwitch(BlockSplitCode* code,
+                                           const uint32_t block_len,
+                                           const uint8_t block_type,
+                                           BROTLI_BOOL is_first_block,
+                                           size_t* storage_ix,
+                                           uint8_t* storage) {
+  size_t typecode = NextBlockTypeCode(&code->type_code_calculator, block_type);
+  size_t lencode;
+  uint32_t len_nextra;
+  uint32_t len_extra;
+  if (!is_first_block) {
+    BrotliWriteBits(code->type_depths[typecode], code->type_bits[typecode],
+                    storage_ix, storage);
+  }
+  GetBlockLengthPrefixCode(block_len, &lencode, &len_nextra, &len_extra);
+
+  BrotliWriteBits(code->length_depths[lencode], code->length_bits[lencode],
+                  storage_ix, storage);
+  BrotliWriteBits(len_nextra, len_extra, storage_ix, storage);
+}
+
+/* Builds a BlockSplitCode data structure from the block split given by the
+   vector of block types and block lengths and stores it to the bit stream. */
+static void BuildAndStoreBlockSplitCode(const uint8_t* types,
+                                        const uint32_t* lengths,
+                                        const size_t num_blocks,
+                                        const size_t num_types,
+                                        HuffmanTree* tree,
+                                        BlockSplitCode* code,
+                                        size_t* storage_ix,
+                                        uint8_t* storage) {
+  uint32_t type_histo[BROTLI_MAX_BLOCK_TYPE_SYMBOLS];
+  uint32_t length_histo[BROTLI_NUM_BLOCK_LEN_SYMBOLS];
+  size_t i;
+  BlockTypeCodeCalculator type_code_calculator;
+  memset(type_histo, 0, (num_types + 2) * sizeof(type_histo[0]));
+  memset(length_histo, 0, sizeof(length_histo));
+  InitBlockTypeCodeCalculator(&type_code_calculator);
+  for (i = 0; i < num_blocks; ++i) {
+    size_t type_code = NextBlockTypeCode(&type_code_calculator, types[i]);
+    if (i != 0) ++type_histo[type_code];
+    ++length_histo[BlockLengthPrefixCode(lengths[i])];
+  }
+  StoreVarLenUint8(num_types - 1, storage_ix, storage);
+  if (num_types > 1) {  /* TODO(eustas): else? could StoreBlockSwitch occur? */
+    BuildAndStoreHuffmanTree(&type_histo[0], num_types + 2, num_types + 2, tree,
+                             &code->type_depths[0], &code->type_bits[0],
+                             storage_ix, storage);
+    BuildAndStoreHuffmanTree(&length_histo[0], BROTLI_NUM_BLOCK_LEN_SYMBOLS,
+                             BROTLI_NUM_BLOCK_LEN_SYMBOLS,
+                             tree, &code->length_depths[0],
+                             &code->length_bits[0], storage_ix, storage);
+    StoreBlockSwitch(code, lengths[0], types[0], 1, storage_ix, storage);
+  }
+}
+
+/* Stores a context map where the histogram type is always the block type. */
+static void StoreTrivialContextMap(EncodeContextMapArena* arena,
+                                   size_t num_types,
+                                   size_t context_bits,
+                                   HuffmanTree* tree,
+                                   size_t* storage_ix,
+                                   uint8_t* storage) {
+  StoreVarLenUint8(num_types - 1, storage_ix, storage);
+  if (num_types > 1) {
+    size_t repeat_code = context_bits - 1u;
+    size_t repeat_bits = (1u << repeat_code) - 1u;
+    size_t alphabet_size = num_types + repeat_code;
+    uint32_t* BROTLI_RESTRICT const histogram = arena->histogram;
+    uint8_t* BROTLI_RESTRICT const depths = arena->depths;
+    uint16_t* BROTLI_RESTRICT const bits = arena->bits;
+    size_t i;
+    memset(histogram, 0, alphabet_size * sizeof(histogram[0]));
+    /* Write RLEMAX. */
+    BrotliWriteBits(1, 1, storage_ix, storage);
+    BrotliWriteBits(4, repeat_code - 1, storage_ix, storage);
+    histogram[repeat_code] = (uint32_t)num_types;
+    histogram[0] = 1;
+    for (i = context_bits; i < alphabet_size; ++i) {
+      histogram[i] = 1;
+    }
+    BuildAndStoreHuffmanTree(histogram, alphabet_size, alphabet_size,
+                             tree, depths, bits, storage_ix, storage);
+    for (i = 0; i < num_types; ++i) {
+      size_t code = (i == 0 ? 0 : i + context_bits - 1);
+      BrotliWriteBits(depths[code], bits[code], storage_ix, storage);
+      BrotliWriteBits(
+          depths[repeat_code], bits[repeat_code], storage_ix, storage);
+      BrotliWriteBits(repeat_code, repeat_bits, storage_ix, storage);
+    }
+    /* Write IMTF (inverse-move-to-front) bit. */
+    BrotliWriteBits(1, 1, storage_ix, storage);
+  }
+}
+
+/* Manages the encoding of one block category (literal, command or distance). */
+typedef struct BlockEncoder {
+  size_t histogram_length_;
+  size_t num_block_types_;
+  const uint8_t* block_types_;  /* Not owned. */
+  const uint32_t* block_lengths_;  /* Not owned. */
+  size_t num_blocks_;
+  BlockSplitCode block_split_code_;
+  size_t block_ix_;
+  size_t block_len_;
+  size_t entropy_ix_;
+  uint8_t* depths_;
+  uint16_t* bits_;
+} BlockEncoder;
+
+static void InitBlockEncoder(BlockEncoder* self, size_t histogram_length,
+    size_t num_block_types, const uint8_t* block_types,
+    const uint32_t* block_lengths, const size_t num_blocks) {
+  self->histogram_length_ = histogram_length;
+  self->num_block_types_ = num_block_types;
+  self->block_types_ = block_types;
+  self->block_lengths_ = block_lengths;
+  self->num_blocks_ = num_blocks;
+  InitBlockTypeCodeCalculator(&self->block_split_code_.type_code_calculator);
+  self->block_ix_ = 0;
+  self->block_len_ = num_blocks == 0 ? 0 : block_lengths[0];
+  self->entropy_ix_ = 0;
+  self->depths_ = 0;
+  self->bits_ = 0;
+}
+
+static void CleanupBlockEncoder(MemoryManager* m, BlockEncoder* self) {
+  BROTLI_FREE(m, self->depths_);
+  BROTLI_FREE(m, self->bits_);
+}
+
+/* Creates entropy codes of block lengths and block types and stores them
+   to the bit stream. */
+static void BuildAndStoreBlockSwitchEntropyCodes(BlockEncoder* self,
+    HuffmanTree* tree, size_t* storage_ix, uint8_t* storage) {
+  BuildAndStoreBlockSplitCode(self->block_types_, self->block_lengths_,
+      self->num_blocks_, self->num_block_types_, tree, &self->block_split_code_,
+      storage_ix, storage);
+}
+
+/* Stores the next symbol with the entropy code of the current block type.
+   Updates the block type and block length at block boundaries. */
+static void StoreSymbol(BlockEncoder* self, size_t symbol, size_t* storage_ix,
+    uint8_t* storage) {
+  if (self->block_len_ == 0) {
+    size_t block_ix = ++self->block_ix_;
+    uint32_t block_len = self->block_lengths_[block_ix];
+    uint8_t block_type = self->block_types_[block_ix];
+    self->block_len_ = block_len;
+    self->entropy_ix_ = block_type * self->histogram_length_;
+    StoreBlockSwitch(&self->block_split_code_, block_len, block_type, 0,
+        storage_ix, storage);
+  }
+  --self->block_len_;
+  {
+    size_t ix = self->entropy_ix_ + symbol;
+    BrotliWriteBits(self->depths_[ix], self->bits_[ix], storage_ix, storage);
+  }
+}
+
+/* Stores the next symbol with the entropy code of the current block type and
+   context value.
+   Updates the block type and block length at block boundaries. */
+static void StoreSymbolWithContext(BlockEncoder* self, size_t symbol,
+    size_t context, const uint32_t* context_map, size_t* storage_ix,
+    uint8_t* storage, const size_t context_bits) {
+  if (self->block_len_ == 0) {
+    size_t block_ix = ++self->block_ix_;
+    uint32_t block_len = self->block_lengths_[block_ix];
+    uint8_t block_type = self->block_types_[block_ix];
+    self->block_len_ = block_len;
+    self->entropy_ix_ = (size_t)block_type << context_bits;
+    StoreBlockSwitch(&self->block_split_code_, block_len, block_type, 0,
+        storage_ix, storage);
+  }
+  --self->block_len_;
+  {
+    size_t histo_ix = context_map[self->entropy_ix_ + context];
+    size_t ix = histo_ix * self->histogram_length_ + symbol;
+    BrotliWriteBits(self->depths_[ix], self->bits_[ix], storage_ix, storage);
+  }
+}
+
+#define FN(X) X ## Literal
+/* NOLINTNEXTLINE(build/include) */
+#include "block_encoder_inc.h"
+#undef FN
+
+#define FN(X) X ## Command
+/* NOLINTNEXTLINE(build/include) */
+#include "block_encoder_inc.h"
+#undef FN
+
+#define FN(X) X ## Distance
+/* NOLINTNEXTLINE(build/include) */
+#include "block_encoder_inc.h"
+#undef FN
+
+static void JumpToByteBoundary(size_t* storage_ix, uint8_t* storage) {
+  *storage_ix = (*storage_ix + 7u) & ~7u;
+  storage[*storage_ix >> 3] = 0;
+}
+
+typedef struct StoreMetablockArena {
+  BlockEncoder literal_enc;
+  BlockEncoder command_enc;
+  BlockEncoder distance_enc;
+  EncodeContextMapArena context_map_arena;
+} StoreMetablockArena;
+
+void BrotliStoreMetaBlock(MemoryManager* m,
+    const uint8_t* input, size_t start_pos, size_t length, size_t mask,
+    uint8_t prev_byte, uint8_t prev_byte2, BROTLI_BOOL is_last,
+    const BrotliEncoderParams* params, ContextType literal_context_mode,
+    const Command* commands, size_t n_commands, const MetaBlockSplit* mb,
+    size_t* storage_ix, uint8_t* storage) {
+
+  size_t pos = start_pos;
+  size_t i;
+  uint32_t num_distance_symbols = params->dist.alphabet_size_max;
+  uint32_t num_effective_distance_symbols = params->dist.alphabet_size_limit;
+  HuffmanTree* tree;
+  ContextLut literal_context_lut = BROTLI_CONTEXT_LUT(literal_context_mode);
+  StoreMetablockArena* arena = NULL;
+  BlockEncoder* literal_enc = NULL;
+  BlockEncoder* command_enc = NULL;
+  BlockEncoder* distance_enc = NULL;
+  const BrotliDistanceParams* dist = &params->dist;
+  BROTLI_DCHECK(
+      num_effective_distance_symbols <= BROTLI_NUM_HISTOGRAM_DISTANCE_SYMBOLS);
+
+  StoreCompressedMetaBlockHeader(is_last, length, storage_ix, storage);
+
+  tree = BROTLI_ALLOC(m, HuffmanTree, MAX_HUFFMAN_TREE_SIZE);
+  arena = BROTLI_ALLOC(m, StoreMetablockArena, 1);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(tree) || BROTLI_IS_NULL(arena)) return;
+  literal_enc = &arena->literal_enc;
+  command_enc = &arena->command_enc;
+  distance_enc = &arena->distance_enc;
+  InitBlockEncoder(literal_enc, BROTLI_NUM_LITERAL_SYMBOLS,
+      mb->literal_split.num_types, mb->literal_split.types,
+      mb->literal_split.lengths, mb->literal_split.num_blocks);
+  InitBlockEncoder(command_enc, BROTLI_NUM_COMMAND_SYMBOLS,
+      mb->command_split.num_types, mb->command_split.types,
+      mb->command_split.lengths, mb->command_split.num_blocks);
+  InitBlockEncoder(distance_enc, num_effective_distance_symbols,
+      mb->distance_split.num_types, mb->distance_split.types,
+      mb->distance_split.lengths, mb->distance_split.num_blocks);
+
+  BuildAndStoreBlockSwitchEntropyCodes(literal_enc, tree, storage_ix, storage);
+  BuildAndStoreBlockSwitchEntropyCodes(command_enc, tree, storage_ix, storage);
+  BuildAndStoreBlockSwitchEntropyCodes(distance_enc, tree, storage_ix, storage);
+
+  BrotliWriteBits(2, dist->distance_postfix_bits, storage_ix, storage);
+  BrotliWriteBits(
+      4, dist->num_direct_distance_codes >> dist->distance_postfix_bits,
+      storage_ix, storage);
+  for (i = 0; i < mb->literal_split.num_types; ++i) {
+    BrotliWriteBits(2, literal_context_mode, storage_ix, storage);
+  }
+
+  if (mb->literal_context_map_size == 0) {
+    StoreTrivialContextMap(
+        &arena->context_map_arena, mb->literal_histograms_size,
+        BROTLI_LITERAL_CONTEXT_BITS, tree, storage_ix, storage);
+  } else {
+    EncodeContextMap(m, &arena->context_map_arena,
+        mb->literal_context_map, mb->literal_context_map_size,
+        mb->literal_histograms_size, tree, storage_ix, storage);
+    if (BROTLI_IS_OOM(m)) return;
+  }
+
+  if (mb->distance_context_map_size == 0) {
+    StoreTrivialContextMap(
+        &arena->context_map_arena, mb->distance_histograms_size,
+        BROTLI_DISTANCE_CONTEXT_BITS, tree, storage_ix, storage);
+  } else {
+    EncodeContextMap(m, &arena->context_map_arena,
+        mb->distance_context_map, mb->distance_context_map_size,
+        mb->distance_histograms_size, tree, storage_ix, storage);
+    if (BROTLI_IS_OOM(m)) return;
+  }
+
+  BuildAndStoreEntropyCodesLiteral(m, literal_enc, mb->literal_histograms,
+      mb->literal_histograms_size, BROTLI_NUM_LITERAL_SYMBOLS, tree,
+      storage_ix, storage);
+  if (BROTLI_IS_OOM(m)) return;
+  BuildAndStoreEntropyCodesCommand(m, command_enc, mb->command_histograms,
+      mb->command_histograms_size, BROTLI_NUM_COMMAND_SYMBOLS, tree,
+      storage_ix, storage);
+  if (BROTLI_IS_OOM(m)) return;
+  BuildAndStoreEntropyCodesDistance(m, distance_enc, mb->distance_histograms,
+      mb->distance_histograms_size, num_distance_symbols, tree,
+      storage_ix, storage);
+  if (BROTLI_IS_OOM(m)) return;
+  BROTLI_FREE(m, tree);
+
+  for (i = 0; i < n_commands; ++i) {
+    const Command cmd = commands[i];
+    size_t cmd_code = cmd.cmd_prefix_;
+    StoreSymbol(command_enc, cmd_code, storage_ix, storage);
+    StoreCommandExtra(&cmd, storage_ix, storage);
+    if (mb->literal_context_map_size == 0) {
+      size_t j;
+      for (j = cmd.insert_len_; j != 0; --j) {
+        StoreSymbol(literal_enc, input[pos & mask], storage_ix, storage);
+        ++pos;
+      }
+    } else {
+      size_t j;
+      for (j = cmd.insert_len_; j != 0; --j) {
+        size_t context =
+            BROTLI_CONTEXT(prev_byte, prev_byte2, literal_context_lut);
+        uint8_t literal = input[pos & mask];
+        StoreSymbolWithContext(literal_enc, literal, context,
+            mb->literal_context_map, storage_ix, storage,
+            BROTLI_LITERAL_CONTEXT_BITS);
+        prev_byte2 = prev_byte;
+        prev_byte = literal;
+        ++pos;
+      }
+    }
+    pos += CommandCopyLen(&cmd);
+    if (CommandCopyLen(&cmd)) {
+      prev_byte2 = input[(pos - 2) & mask];
+      prev_byte = input[(pos - 1) & mask];
+      if (cmd.cmd_prefix_ >= 128) {
+        size_t dist_code = cmd.dist_prefix_ & 0x3FF;
+        uint32_t distnumextra = cmd.dist_prefix_ >> 10;
+        uint64_t distextra = cmd.dist_extra_;
+        if (mb->distance_context_map_size == 0) {
+          StoreSymbol(distance_enc, dist_code, storage_ix, storage);
+        } else {
+          size_t context = CommandDistanceContext(&cmd);
+          StoreSymbolWithContext(distance_enc, dist_code, context,
+              mb->distance_context_map, storage_ix, storage,
+              BROTLI_DISTANCE_CONTEXT_BITS);
+        }
+        BrotliWriteBits(distnumextra, distextra, storage_ix, storage);
+      }
+    }
+  }
+  CleanupBlockEncoder(m, distance_enc);
+  CleanupBlockEncoder(m, command_enc);
+  CleanupBlockEncoder(m, literal_enc);
+  BROTLI_FREE(m, arena);
+  if (is_last) {
+    JumpToByteBoundary(storage_ix, storage);
+  }
+}
+
+static void BuildHistograms(const uint8_t* input,
+                            size_t start_pos,
+                            size_t mask,
+                            const Command* commands,
+                            size_t n_commands,
+                            HistogramLiteral* lit_histo,
+                            HistogramCommand* cmd_histo,
+                            HistogramDistance* dist_histo) {
+  size_t pos = start_pos;
+  size_t i;
+  for (i = 0; i < n_commands; ++i) {
+    const Command cmd = commands[i];
+    size_t j;
+    HistogramAddCommand(cmd_histo, cmd.cmd_prefix_);
+    for (j = cmd.insert_len_; j != 0; --j) {
+      HistogramAddLiteral(lit_histo, input[pos & mask]);
+      ++pos;
+    }
+    pos += CommandCopyLen(&cmd);
+    if (CommandCopyLen(&cmd) && cmd.cmd_prefix_ >= 128) {
+      HistogramAddDistance(dist_histo, cmd.dist_prefix_ & 0x3FF);
+    }
+  }
+}
+
+static void StoreDataWithHuffmanCodes(const uint8_t* input,
+                                      size_t start_pos,
+                                      size_t mask,
+                                      const Command* commands,
+                                      size_t n_commands,
+                                      const uint8_t* lit_depth,
+                                      const uint16_t* lit_bits,
+                                      const uint8_t* cmd_depth,
+                                      const uint16_t* cmd_bits,
+                                      const uint8_t* dist_depth,
+                                      const uint16_t* dist_bits,
+                                      size_t* storage_ix,
+                                      uint8_t* storage) {
+  size_t pos = start_pos;
+  size_t i;
+  for (i = 0; i < n_commands; ++i) {
+    const Command cmd = commands[i];
+    const size_t cmd_code = cmd.cmd_prefix_;
+    size_t j;
+    BrotliWriteBits(
+        cmd_depth[cmd_code], cmd_bits[cmd_code], storage_ix, storage);
+    StoreCommandExtra(&cmd, storage_ix, storage);
+    for (j = cmd.insert_len_; j != 0; --j) {
+      const uint8_t literal = input[pos & mask];
+      BrotliWriteBits(
+          lit_depth[literal], lit_bits[literal], storage_ix, storage);
+      ++pos;
+    }
+    pos += CommandCopyLen(&cmd);
+    if (CommandCopyLen(&cmd) && cmd.cmd_prefix_ >= 128) {
+      const size_t dist_code = cmd.dist_prefix_ & 0x3FF;
+      const uint32_t distnumextra = cmd.dist_prefix_ >> 10;
+      const uint32_t distextra = cmd.dist_extra_;
+      BrotliWriteBits(dist_depth[dist_code], dist_bits[dist_code],
+                      storage_ix, storage);
+      BrotliWriteBits(distnumextra, distextra, storage_ix, storage);
+    }
+  }
+}
+
+/* TODO(eustas): pull alloc/dealloc to caller? */
+typedef struct MetablockArena {
+  HistogramLiteral lit_histo;
+  HistogramCommand cmd_histo;
+  HistogramDistance dist_histo;
+  /* TODO(eustas): merge bits and depth? */
+  uint8_t lit_depth[BROTLI_NUM_LITERAL_SYMBOLS];
+  uint16_t lit_bits[BROTLI_NUM_LITERAL_SYMBOLS];
+  uint8_t cmd_depth[BROTLI_NUM_COMMAND_SYMBOLS];
+  uint16_t cmd_bits[BROTLI_NUM_COMMAND_SYMBOLS];
+  uint8_t dist_depth[MAX_SIMPLE_DISTANCE_ALPHABET_SIZE];
+  uint16_t dist_bits[MAX_SIMPLE_DISTANCE_ALPHABET_SIZE];
+  HuffmanTree tree[MAX_HUFFMAN_TREE_SIZE];
+} MetablockArena;
+
+void BrotliStoreMetaBlockTrivial(MemoryManager* m,
+    const uint8_t* input, size_t start_pos, size_t length, size_t mask,
+    BROTLI_BOOL is_last, const BrotliEncoderParams* params,
+    const Command* commands, size_t n_commands,
+    size_t* storage_ix, uint8_t* storage) {
+  MetablockArena* arena = BROTLI_ALLOC(m, MetablockArena, 1);
+  uint32_t num_distance_symbols = params->dist.alphabet_size_max;
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(arena)) return;
+
+  StoreCompressedMetaBlockHeader(is_last, length, storage_ix, storage);
+
+  HistogramClearLiteral(&arena->lit_histo);
+  HistogramClearCommand(&arena->cmd_histo);
+  HistogramClearDistance(&arena->dist_histo);
+
+  BuildHistograms(input, start_pos, mask, commands, n_commands,
+                  &arena->lit_histo, &arena->cmd_histo, &arena->dist_histo);
+
+  BrotliWriteBits(13, 0, storage_ix, storage);
+
+  BuildAndStoreHuffmanTree(arena->lit_histo.data_, BROTLI_NUM_LITERAL_SYMBOLS,
+                           BROTLI_NUM_LITERAL_SYMBOLS, arena->tree,
+                           arena->lit_depth, arena->lit_bits,
+                           storage_ix, storage);
+  BuildAndStoreHuffmanTree(arena->cmd_histo.data_, BROTLI_NUM_COMMAND_SYMBOLS,
+                           BROTLI_NUM_COMMAND_SYMBOLS, arena->tree,
+                           arena->cmd_depth, arena->cmd_bits,
+                           storage_ix, storage);
+  BuildAndStoreHuffmanTree(arena->dist_histo.data_,
+                           MAX_SIMPLE_DISTANCE_ALPHABET_SIZE,
+                           num_distance_symbols, arena->tree,
+                           arena->dist_depth, arena->dist_bits,
+                           storage_ix, storage);
+  StoreDataWithHuffmanCodes(input, start_pos, mask, commands,
+                            n_commands, arena->lit_depth, arena->lit_bits,
+                            arena->cmd_depth, arena->cmd_bits,
+                            arena->dist_depth, arena->dist_bits,
+                            storage_ix, storage);
+  BROTLI_FREE(m, arena);
+  if (is_last) {
+    JumpToByteBoundary(storage_ix, storage);
+  }
+}
+
+void BrotliStoreMetaBlockFast(MemoryManager* m,
+    const uint8_t* input, size_t start_pos, size_t length, size_t mask,
+    BROTLI_BOOL is_last, const BrotliEncoderParams* params,
+    const Command* commands, size_t n_commands,
+    size_t* storage_ix, uint8_t* storage) {
+  MetablockArena* arena = BROTLI_ALLOC(m, MetablockArena, 1);
+  uint32_t num_distance_symbols = params->dist.alphabet_size_max;
+  uint32_t distance_alphabet_bits =
+      Log2FloorNonZero(num_distance_symbols - 1) + 1;
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(arena)) return;
+
+  StoreCompressedMetaBlockHeader(is_last, length, storage_ix, storage);
+
+  BrotliWriteBits(13, 0, storage_ix, storage);
+
+  if (n_commands <= 128) {
+    uint32_t histogram[BROTLI_NUM_LITERAL_SYMBOLS] = { 0 };
+    size_t pos = start_pos;
+    size_t num_literals = 0;
+    size_t i;
+    for (i = 0; i < n_commands; ++i) {
+      const Command cmd = commands[i];
+      size_t j;
+      for (j = cmd.insert_len_; j != 0; --j) {
+        ++histogram[input[pos & mask]];
+        ++pos;
+      }
+      num_literals += cmd.insert_len_;
+      pos += CommandCopyLen(&cmd);
+    }
+    BrotliBuildAndStoreHuffmanTreeFast(arena->tree, histogram, num_literals,
+                                       /* max_bits = */ 8,
+                                       arena->lit_depth, arena->lit_bits,
+                                       storage_ix, storage);
+    StoreStaticCommandHuffmanTree(storage_ix, storage);
+    StoreStaticDistanceHuffmanTree(storage_ix, storage);
+    StoreDataWithHuffmanCodes(input, start_pos, mask, commands,
+                              n_commands, arena->lit_depth, arena->lit_bits,
+                              kStaticCommandCodeDepth,
+                              kStaticCommandCodeBits,
+                              kStaticDistanceCodeDepth,
+                              kStaticDistanceCodeBits,
+                              storage_ix, storage);
+  } else {
+    HistogramClearLiteral(&arena->lit_histo);
+    HistogramClearCommand(&arena->cmd_histo);
+    HistogramClearDistance(&arena->dist_histo);
+    BuildHistograms(input, start_pos, mask, commands, n_commands,
+                    &arena->lit_histo, &arena->cmd_histo, &arena->dist_histo);
+    BrotliBuildAndStoreHuffmanTreeFast(arena->tree, arena->lit_histo.data_,
+                                       arena->lit_histo.total_count_,
+                                       /* max_bits = */ 8,
+                                       arena->lit_depth, arena->lit_bits,
+                                       storage_ix, storage);
+    BrotliBuildAndStoreHuffmanTreeFast(arena->tree, arena->cmd_histo.data_,
+                                       arena->cmd_histo.total_count_,
+                                       /* max_bits = */ 10,
+                                       arena->cmd_depth, arena->cmd_bits,
+                                       storage_ix, storage);
+    BrotliBuildAndStoreHuffmanTreeFast(arena->tree, arena->dist_histo.data_,
+                                       arena->dist_histo.total_count_,
+                                       /* max_bits = */
+                                       distance_alphabet_bits,
+                                       arena->dist_depth, arena->dist_bits,
+                                       storage_ix, storage);
+    StoreDataWithHuffmanCodes(input, start_pos, mask, commands,
+                              n_commands, arena->lit_depth, arena->lit_bits,
+                              arena->cmd_depth, arena->cmd_bits,
+                              arena->dist_depth, arena->dist_bits,
+                              storage_ix, storage);
+  }
+
+  BROTLI_FREE(m, arena);
+
+  if (is_last) {
+    JumpToByteBoundary(storage_ix, storage);
+  }
+}
+
+/* This is for storing uncompressed blocks (simple raw storage of
+   bytes-as-bytes). */
+void BrotliStoreUncompressedMetaBlock(BROTLI_BOOL is_final_block,
+                                      const uint8_t* BROTLI_RESTRICT input,
+                                      size_t position, size_t mask,
+                                      size_t len,
+                                      size_t* BROTLI_RESTRICT storage_ix,
+                                      uint8_t* BROTLI_RESTRICT storage) {
+  size_t masked_pos = position & mask;
+  BrotliStoreUncompressedMetaBlockHeader(len, storage_ix, storage);
+  JumpToByteBoundary(storage_ix, storage);
+
+  if (masked_pos + len > mask + 1) {
+    size_t len1 = mask + 1 - masked_pos;
+    memcpy(&storage[*storage_ix >> 3], &input[masked_pos], len1);
+    *storage_ix += len1 << 3;
+    len -= len1;
+    masked_pos = 0;
+  }
+  memcpy(&storage[*storage_ix >> 3], &input[masked_pos], len);
+  *storage_ix += len << 3;
+
+  /* We need to clear the next 4 bytes to continue to be
+     compatible with BrotliWriteBits. */
+  BrotliWriteBitsPrepareStorage(*storage_ix, storage);
+
+  /* Since the uncompressed block itself may not be the final block, add an
+     empty one after this. */
+  if (is_final_block) {
+    BrotliWriteBits(1, 1, storage_ix, storage);  /* islast */
+    BrotliWriteBits(1, 1, storage_ix, storage);  /* isempty */
+    JumpToByteBoundary(storage_ix, storage);
+  }
+}
+
+#if defined(BROTLI_TEST)
+void GetBlockLengthPrefixCodeForTest(uint32_t len, size_t* code,
+                                     uint32_t* n_extra, uint32_t* extra) {
+  GetBlockLengthPrefixCode(len, code, n_extra, extra);
+}
+#endif
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/brotli_bit_stream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/brotli_bit_stream.h
new file mode 100644
index 0000000000..a289509af3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/brotli_bit_stream.h
@@ -0,0 +1,89 @@
+/* Copyright 2014 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Functions to convert brotli-related data structures into the
+   brotli bit stream. The functions here operate under
+   assumption that there is enough space in the storage, i.e., there are
+   no out-of-range checks anywhere.
+
+   These functions do bit addressing into a byte array. The byte array
+   is called "storage" and the index to the bit is called storage_ix
+   in function arguments. */
+
+#ifndef BROTLI_ENC_BROTLI_BIT_STREAM_H_
+#define BROTLI_ENC_BROTLI_BIT_STREAM_H_
+
+#include <brotli/types.h>
+
+#include "../common/context.h"
+#include "../common/platform.h"
+#include "command.h"
+#include "entropy_encode.h"
+#include "memory.h"
+#include "metablock.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* All Store functions here will use a storage_ix, which is always the bit
+   position for the current storage. */
+
+BROTLI_INTERNAL void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num,
+    HuffmanTree* tree, size_t* storage_ix, uint8_t* storage);
+
+BROTLI_INTERNAL void BrotliBuildAndStoreHuffmanTreeFast(
+    HuffmanTree* tree, const uint32_t* histogram, const size_t histogram_total,
+    const size_t max_bits, uint8_t* depth, uint16_t* bits, size_t* storage_ix,
+    uint8_t* storage);
+
+/* REQUIRES: length > 0 */
+/* REQUIRES: length <= (1 << 24) */
+BROTLI_INTERNAL void BrotliStoreMetaBlock(MemoryManager* m,
+    const uint8_t* input, size_t start_pos, size_t length, size_t mask,
+    uint8_t prev_byte, uint8_t prev_byte2, BROTLI_BOOL is_last,
+    const BrotliEncoderParams* params, ContextType literal_context_mode,
+    const Command* commands, size_t n_commands, const MetaBlockSplit* mb,
+    size_t* storage_ix, uint8_t* storage);
+
+/* Stores the meta-block without doing any block splitting, just collects
+   one histogram per block category and uses that for entropy coding.
+   REQUIRES: length > 0
+   REQUIRES: length <= (1 << 24) */
+BROTLI_INTERNAL void BrotliStoreMetaBlockTrivial(MemoryManager* m,
+    const uint8_t* input, size_t start_pos, size_t length, size_t mask,
+    BROTLI_BOOL is_last, const BrotliEncoderParams* params,
+    const Command* commands, size_t n_commands,
+    size_t* storage_ix, uint8_t* storage);
+
+/* Same as above, but uses static prefix codes for histograms with a only a few
+   symbols, and uses static code length prefix codes for all other histograms.
+   REQUIRES: length > 0
+   REQUIRES: length <= (1 << 24) */
+BROTLI_INTERNAL void BrotliStoreMetaBlockFast(MemoryManager* m,
+    const uint8_t* input, size_t start_pos, size_t length, size_t mask,
+    BROTLI_BOOL is_last, const BrotliEncoderParams* params,
+    const Command* commands, size_t n_commands,
+    size_t* storage_ix, uint8_t* storage);
+
+/* This is for storing uncompressed blocks (simple raw storage of
+   bytes-as-bytes).
+   REQUIRES: length > 0
+   REQUIRES: length <= (1 << 24) */
+BROTLI_INTERNAL void BrotliStoreUncompressedMetaBlock(
+    BROTLI_BOOL is_final_block, const uint8_t* BROTLI_RESTRICT input,
+    size_t position, size_t mask, size_t len,
+    size_t* BROTLI_RESTRICT storage_ix, uint8_t* BROTLI_RESTRICT storage);
+
+#if defined(BROTLI_TEST)
+void GetBlockLengthPrefixCodeForTest(uint32_t, size_t*, uint32_t*, uint32_t*);
+#endif
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_BROTLI_BIT_STREAM_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/cluster.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/cluster.c
new file mode 100644
index 0000000000..b0faf8114c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/cluster.c
@@ -0,0 +1,57 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Functions for clustering similar histograms together. */
+
+#include "cluster.h"
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+#include "bit_cost.h"  /* BrotliPopulationCost */
+#include "fast_log.h"
+#include "histogram.h"
+#include "memory.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static BROTLI_INLINE BROTLI_BOOL HistogramPairIsLess(
+    const HistogramPair* p1, const HistogramPair* p2) {
+  if (p1->cost_diff != p2->cost_diff) {
+    return TO_BROTLI_BOOL(p1->cost_diff > p2->cost_diff);
+  }
+  return TO_BROTLI_BOOL((p1->idx2 - p1->idx1) > (p2->idx2 - p2->idx1));
+}
+
+/* Returns entropy reduction of the context map when we combine two clusters. */
+static BROTLI_INLINE double ClusterCostDiff(size_t size_a, size_t size_b) {
+  size_t size_c = size_a + size_b;
+  return (double)size_a * FastLog2(size_a) +
+    (double)size_b * FastLog2(size_b) -
+    (double)size_c * FastLog2(size_c);
+}
+
+#define CODE(X) X
+
+#define FN(X) X ## Literal
+#include "cluster_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#define FN(X) X ## Command
+#include "cluster_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#define FN(X) X ## Distance
+#include "cluster_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#undef CODE
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/cluster.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/cluster.h
new file mode 100644
index 0000000000..013629c6d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/cluster.h
@@ -0,0 +1,49 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Functions for clustering similar histograms together. */
+
+#ifndef BROTLI_ENC_CLUSTER_H_
+#define BROTLI_ENC_CLUSTER_H_
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+#include "histogram.h"
+#include "memory.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+typedef struct HistogramPair {
+  uint32_t idx1;
+  uint32_t idx2;
+  double cost_combo;
+  double cost_diff;
+} HistogramPair;
+
+#define CODE(X) /* Declaration */;
+
+#define FN(X) X ## Literal
+#include "cluster_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#define FN(X) X ## Command
+#include "cluster_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#define FN(X) X ## Distance
+#include "cluster_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#undef CODE
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_CLUSTER_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/cluster_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/cluster_inc.h
new file mode 100644
index 0000000000..d6215ef06e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/cluster_inc.h
@@ -0,0 +1,325 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN, CODE */
+
+#define HistogramType FN(Histogram)
+
+/* Computes the bit cost reduction by combining out[idx1] and out[idx2] and if
+   it is below a threshold, stores the pair (idx1, idx2) in the *pairs queue. */
+BROTLI_INTERNAL void FN(BrotliCompareAndPushToQueue)(
+    const HistogramType* out, HistogramType* tmp, const uint32_t* cluster_size,
+    uint32_t idx1, uint32_t idx2, size_t max_num_pairs, HistogramPair* pairs,
+    size_t* num_pairs) CODE({
+  BROTLI_BOOL is_good_pair = BROTLI_FALSE;
+  HistogramPair p;
+  p.idx1 = p.idx2 = 0;
+  p.cost_diff = p.cost_combo = 0;
+  if (idx1 == idx2) {
+    return;
+  }
+  if (idx2 < idx1) {
+    uint32_t t = idx2;
+    idx2 = idx1;
+    idx1 = t;
+  }
+  p.idx1 = idx1;
+  p.idx2 = idx2;
+  p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]);
+  p.cost_diff -= out[idx1].bit_cost_;
+  p.cost_diff -= out[idx2].bit_cost_;
+
+  if (out[idx1].total_count_ == 0) {
+    p.cost_combo = out[idx2].bit_cost_;
+    is_good_pair = BROTLI_TRUE;
+  } else if (out[idx2].total_count_ == 0) {
+    p.cost_combo = out[idx1].bit_cost_;
+    is_good_pair = BROTLI_TRUE;
+  } else {
+    double threshold = *num_pairs == 0 ? 1e99 :
+        BROTLI_MAX(double, 0.0, pairs[0].cost_diff);
+    double cost_combo;
+    *tmp = out[idx1];
+    FN(HistogramAddHistogram)(tmp, &out[idx2]);
+    cost_combo = FN(BrotliPopulationCost)(tmp);
+    if (cost_combo < threshold - p.cost_diff) {
+      p.cost_combo = cost_combo;
+      is_good_pair = BROTLI_TRUE;
+    }
+  }
+  if (is_good_pair) {
+    p.cost_diff += p.cost_combo;
+    if (*num_pairs > 0 && HistogramPairIsLess(&pairs[0], &p)) {
+      /* Replace the top of the queue if needed. */
+      if (*num_pairs < max_num_pairs) {
+        pairs[*num_pairs] = pairs[0];
+        ++(*num_pairs);
+      }
+      pairs[0] = p;
+    } else if (*num_pairs < max_num_pairs) {
+      pairs[*num_pairs] = p;
+      ++(*num_pairs);
+    }
+  }
+})
+
+BROTLI_INTERNAL size_t FN(BrotliHistogramCombine)(HistogramType* out,
+                                                  HistogramType* tmp,
+                                                  uint32_t* cluster_size,
+                                                  uint32_t* symbols,
+                                                  uint32_t* clusters,
+                                                  HistogramPair* pairs,
+                                                  size_t num_clusters,
+                                                  size_t symbols_size,
+                                                  size_t max_clusters,
+                                                  size_t max_num_pairs) CODE({
+  double cost_diff_threshold = 0.0;
+  size_t min_cluster_size = 1;
+  size_t num_pairs = 0;
+
+  {
+    /* We maintain a vector of histogram pairs, with the property that the pair
+       with the maximum bit cost reduction is the first. */
+    size_t idx1;
+    for (idx1 = 0; idx1 < num_clusters; ++idx1) {
+      size_t idx2;
+      for (idx2 = idx1 + 1; idx2 < num_clusters; ++idx2) {
+        FN(BrotliCompareAndPushToQueue)(out, tmp, cluster_size, clusters[idx1],
+            clusters[idx2], max_num_pairs, &pairs[0], &num_pairs);
+      }
+    }
+  }
+
+  while (num_clusters > min_cluster_size) {
+    uint32_t best_idx1;
+    uint32_t best_idx2;
+    size_t i;
+    if (pairs[0].cost_diff >= cost_diff_threshold) {
+      cost_diff_threshold = 1e99;
+      min_cluster_size = max_clusters;
+      continue;
+    }
+    /* Take the best pair from the top of heap. */
+    best_idx1 = pairs[0].idx1;
+    best_idx2 = pairs[0].idx2;
+    FN(HistogramAddHistogram)(&out[best_idx1], &out[best_idx2]);
+    out[best_idx1].bit_cost_ = pairs[0].cost_combo;
+    cluster_size[best_idx1] += cluster_size[best_idx2];
+    for (i = 0; i < symbols_size; ++i) {
+      if (symbols[i] == best_idx2) {
+        symbols[i] = best_idx1;
+      }
+    }
+    for (i = 0; i < num_clusters; ++i) {
+      if (clusters[i] == best_idx2) {
+        memmove(&clusters[i], &clusters[i + 1],
+                (num_clusters - i - 1) * sizeof(clusters[0]));
+        break;
+      }
+    }
+    --num_clusters;
+    {
+      /* Remove pairs intersecting the just combined best pair. */
+      size_t copy_to_idx = 0;
+      for (i = 0; i < num_pairs; ++i) {
+        HistogramPair* p = &pairs[i];
+        if (p->idx1 == best_idx1 || p->idx2 == best_idx1 ||
+            p->idx1 == best_idx2 || p->idx2 == best_idx2) {
+          /* Remove invalid pair from the queue. */
+          continue;
+        }
+        if (HistogramPairIsLess(&pairs[0], p)) {
+          /* Replace the top of the queue if needed. */
+          HistogramPair front = pairs[0];
+          pairs[0] = *p;
+          pairs[copy_to_idx] = front;
+        } else {
+          pairs[copy_to_idx] = *p;
+        }
+        ++copy_to_idx;
+      }
+      num_pairs = copy_to_idx;
+    }
+
+    /* Push new pairs formed with the combined histogram to the heap. */
+    for (i = 0; i < num_clusters; ++i) {
+      FN(BrotliCompareAndPushToQueue)(out, tmp, cluster_size, best_idx1,
+          clusters[i], max_num_pairs, &pairs[0], &num_pairs);
+    }
+  }
+  return num_clusters;
+})
+
+/* What is the bit cost of moving histogram from cur_symbol to candidate. */
+BROTLI_INTERNAL double FN(BrotliHistogramBitCostDistance)(
+    const HistogramType* histogram, const HistogramType* candidate,
+    HistogramType* tmp) CODE({
+  if (histogram->total_count_ == 0) {
+    return 0.0;
+  } else {
+    *tmp = *histogram;
+    FN(HistogramAddHistogram)(tmp, candidate);
+    return FN(BrotliPopulationCost)(tmp) - candidate->bit_cost_;
+  }
+})
+
+/* Find the best 'out' histogram for each of the 'in' histograms.
+   When called, clusters[0..num_clusters) contains the unique values from
+   symbols[0..in_size), but this property is not preserved in this function.
+   Note: we assume that out[]->bit_cost_ is already up-to-date. */
+BROTLI_INTERNAL void FN(BrotliHistogramRemap)(const HistogramType* in,
+    size_t in_size, const uint32_t* clusters, size_t num_clusters,
+    HistogramType* out, HistogramType* tmp, uint32_t* symbols) CODE({
+  size_t i;
+  for (i = 0; i < in_size; ++i) {
+    uint32_t best_out = i == 0 ? symbols[0] : symbols[i - 1];
+    double best_bits =
+        FN(BrotliHistogramBitCostDistance)(&in[i], &out[best_out], tmp);
+    size_t j;
+    for (j = 0; j < num_clusters; ++j) {
+      const double cur_bits =
+          FN(BrotliHistogramBitCostDistance)(&in[i], &out[clusters[j]], tmp);
+      if (cur_bits < best_bits) {
+        best_bits = cur_bits;
+        best_out = clusters[j];
+      }
+    }
+    symbols[i] = best_out;
+  }
+
+  /* Recompute each out based on raw and symbols. */
+  for (i = 0; i < num_clusters; ++i) {
+    FN(HistogramClear)(&out[clusters[i]]);
+  }
+  for (i = 0; i < in_size; ++i) {
+    FN(HistogramAddHistogram)(&out[symbols[i]], &in[i]);
+  }
+})
+
+/* Reorders elements of the out[0..length) array and changes values in
+   symbols[0..length) array in the following way:
+     * when called, symbols[] contains indexes into out[], and has N unique
+       values (possibly N < length)
+     * on return, symbols'[i] = f(symbols[i]) and
+                  out'[symbols'[i]] = out[symbols[i]], for each 0 <= i < length,
+       where f is a bijection between the range of symbols[] and [0..N), and
+       the first occurrences of values in symbols'[i] come in consecutive
+       increasing order.
+   Returns N, the number of unique values in symbols[]. */
+BROTLI_INTERNAL size_t FN(BrotliHistogramReindex)(MemoryManager* m,
+    HistogramType* out, uint32_t* symbols, size_t length) CODE({
+  static const uint32_t kInvalidIndex = BROTLI_UINT32_MAX;
+  uint32_t* new_index = BROTLI_ALLOC(m, uint32_t, length);
+  uint32_t next_index;
+  HistogramType* tmp;
+  size_t i;
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(new_index)) return 0;
+  for (i = 0; i < length; ++i) {
+      new_index[i] = kInvalidIndex;
+  }
+  next_index = 0;
+  for (i = 0; i < length; ++i) {
+    if (new_index[symbols[i]] == kInvalidIndex) {
+      new_index[symbols[i]] = next_index;
+      ++next_index;
+    }
+  }
+  /* TODO(eustas): by using idea of "cycle-sort" we can avoid allocation of
+     tmp and reduce the number of copying by the factor of 2. */
+  tmp = BROTLI_ALLOC(m, HistogramType, next_index);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(tmp)) return 0;
+  next_index = 0;
+  for (i = 0; i < length; ++i) {
+    if (new_index[symbols[i]] == next_index) {
+      tmp[next_index] = out[symbols[i]];
+      ++next_index;
+    }
+    symbols[i] = new_index[symbols[i]];
+  }
+  BROTLI_FREE(m, new_index);
+  for (i = 0; i < next_index; ++i) {
+    out[i] = tmp[i];
+  }
+  BROTLI_FREE(m, tmp);
+  return next_index;
+})
+
+BROTLI_INTERNAL void FN(BrotliClusterHistograms)(
+    MemoryManager* m, const HistogramType* in, const size_t in_size,
+    size_t max_histograms, HistogramType* out, size_t* out_size,
+    uint32_t* histogram_symbols) CODE({
+  uint32_t* cluster_size = BROTLI_ALLOC(m, uint32_t, in_size);
+  uint32_t* clusters = BROTLI_ALLOC(m, uint32_t, in_size);
+  size_t num_clusters = 0;
+  const size_t max_input_histograms = 64;
+  size_t pairs_capacity = max_input_histograms * max_input_histograms / 2;
+  /* For the first pass of clustering, we allow all pairs. */
+  HistogramPair* pairs = BROTLI_ALLOC(m, HistogramPair, pairs_capacity + 1);
+  /* TODO(eustas): move to "persistent" arena? */
+  HistogramType* tmp = BROTLI_ALLOC(m, HistogramType, 1);
+  size_t i;
+
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(cluster_size) ||
+      BROTLI_IS_NULL(clusters) || BROTLI_IS_NULL(pairs)|| BROTLI_IS_NULL(tmp)) {
+    return;
+  }
+
+  for (i = 0; i < in_size; ++i) {
+    cluster_size[i] = 1;
+  }
+
+  for (i = 0; i < in_size; ++i) {
+    out[i] = in[i];
+    out[i].bit_cost_ = FN(BrotliPopulationCost)(&in[i]);
+    histogram_symbols[i] = (uint32_t)i;
+  }
+
+  for (i = 0; i < in_size; i += max_input_histograms) {
+    size_t num_to_combine =
+        BROTLI_MIN(size_t, in_size - i, max_input_histograms);
+    size_t num_new_clusters;
+    size_t j;
+    for (j = 0; j < num_to_combine; ++j) {
+      clusters[num_clusters + j] = (uint32_t)(i + j);
+    }
+    num_new_clusters =
+        FN(BrotliHistogramCombine)(out, tmp, cluster_size,
+                                   &histogram_symbols[i],
+                                   &clusters[num_clusters], pairs,
+                                   num_to_combine, num_to_combine,
+                                   max_histograms, pairs_capacity);
+    num_clusters += num_new_clusters;
+  }
+
+  {
+    /* For the second pass, we limit the total number of histogram pairs.
+       After this limit is reached, we only keep searching for the best pair. */
+    size_t max_num_pairs = BROTLI_MIN(size_t,
+        64 * num_clusters, (num_clusters / 2) * num_clusters);
+    BROTLI_ENSURE_CAPACITY(
+        m, HistogramPair, pairs, pairs_capacity, max_num_pairs + 1);
+    if (BROTLI_IS_OOM(m)) return;
+
+    /* Collapse similar histograms. */
+    num_clusters = FN(BrotliHistogramCombine)(out, tmp, cluster_size,
+                                              histogram_symbols, clusters,
+                                              pairs, num_clusters, in_size,
+                                              max_histograms, max_num_pairs);
+  }
+  BROTLI_FREE(m, pairs);
+  BROTLI_FREE(m, cluster_size);
+  /* Find the optimal map from original histograms to the final ones. */
+  FN(BrotliHistogramRemap)(in, in_size, clusters, num_clusters,
+                           out, tmp, histogram_symbols);
+  BROTLI_FREE(m, tmp);
+  BROTLI_FREE(m, clusters);
+  /* Convert the context map to a canonical form. */
+  *out_size = FN(BrotliHistogramReindex)(m, out, histogram_symbols, in_size);
+  if (BROTLI_IS_OOM(m)) return;
+})
+
+#undef HistogramType
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/command.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/command.c
new file mode 100644
index 0000000000..bf80561bca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/command.c
@@ -0,0 +1,28 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include "command.h"
+
+#include <brotli/types.h>
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+const uint32_t kBrotliInsBase[BROTLI_NUM_INS_COPY_CODES] = {
+    0,  1,  2,  3,  4,   5,   6,   8,   10,   14,   18,   26,
+    34, 50, 66, 98, 130, 194, 322, 578, 1090, 2114, 6210, 22594};
+const uint32_t kBrotliInsExtra[BROTLI_NUM_INS_COPY_CODES] = {
+    0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 10, 12, 14, 24};
+const uint32_t kBrotliCopyBase[BROTLI_NUM_INS_COPY_CODES] = {
+    2,  3,  4,  5,  6,  7,   8,   9,   10,  12,  14,   18,
+    22, 30, 38, 54, 70, 102, 134, 198, 326, 582, 1094, 2118};
+const uint32_t kBrotliCopyExtra[BROTLI_NUM_INS_COPY_CODES] = {
+    0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 10, 24};
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/command.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/command.h
new file mode 100644
index 0000000000..ba4de7eab3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/command.h
@@ -0,0 +1,191 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* This class models a sequence of literals and a backward reference copy. */
+
+#ifndef BROTLI_ENC_COMMAND_H_
+#define BROTLI_ENC_COMMAND_H_
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+#include "fast_log.h"
+#include "params.h"
+#include "prefix.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+BROTLI_INTERNAL extern const uint32_t
+    kBrotliInsBase[BROTLI_NUM_INS_COPY_CODES];
+BROTLI_INTERNAL extern const uint32_t
+    kBrotliInsExtra[BROTLI_NUM_INS_COPY_CODES];
+BROTLI_INTERNAL extern const uint32_t
+    kBrotliCopyBase[BROTLI_NUM_INS_COPY_CODES];
+BROTLI_INTERNAL extern const uint32_t
+    kBrotliCopyExtra[BROTLI_NUM_INS_COPY_CODES];
+
+static BROTLI_INLINE uint16_t GetInsertLengthCode(size_t insertlen) {
+  if (insertlen < 6) {
+    return (uint16_t)insertlen;
+  } else if (insertlen < 130) {
+    uint32_t nbits = Log2FloorNonZero(insertlen - 2) - 1u;
+    return (uint16_t)((nbits << 1) + ((insertlen - 2) >> nbits) + 2);
+  } else if (insertlen < 2114) {
+    return (uint16_t)(Log2FloorNonZero(insertlen - 66) + 10);
+  } else if (insertlen < 6210) {
+    return 21u;
+  } else if (insertlen < 22594) {
+    return 22u;
+  } else {
+    return 23u;
+  }
+}
+
+static BROTLI_INLINE uint16_t GetCopyLengthCode(size_t copylen) {
+  if (copylen < 10) {
+    return (uint16_t)(copylen - 2);
+  } else if (copylen < 134) {
+    uint32_t nbits = Log2FloorNonZero(copylen - 6) - 1u;
+    return (uint16_t)((nbits << 1) + ((copylen - 6) >> nbits) + 4);
+  } else if (copylen < 2118) {
+    return (uint16_t)(Log2FloorNonZero(copylen - 70) + 12);
+  } else {
+    return 23u;
+  }
+}
+
+static BROTLI_INLINE uint16_t CombineLengthCodes(
+    uint16_t inscode, uint16_t copycode, BROTLI_BOOL use_last_distance) {
+  uint16_t bits64 =
+      (uint16_t)((copycode & 0x7u) | ((inscode & 0x7u) << 3u));
+  if (use_last_distance && inscode < 8u && copycode < 16u) {
+    return (copycode < 8u) ? bits64 : (bits64 | 64u);
+  } else {
+    /* Specification: 5 Encoding of ... (last table) */
+    /* offset = 2 * index, where index is in range [0..8] */
+    uint32_t offset = 2u * ((copycode >> 3u) + 3u * (inscode >> 3u));
+    /* All values in specification are K * 64,
+       where   K = [2, 3, 6, 4, 5, 8, 7, 9, 10],
+           i + 1 = [1, 2, 3, 4, 5, 6, 7, 8,  9],
+       K - i - 1 = [1, 1, 3, 0, 0, 2, 0, 1,  2] = D.
+       All values in D require only 2 bits to encode.
+       Magic constant is shifted 6 bits left, to avoid final multiplication. */
+    offset = (offset << 5u) + 0x40u + ((0x520D40u >> offset) & 0xC0u);
+    return (uint16_t)(offset | bits64);
+  }
+}
+
+static BROTLI_INLINE void GetLengthCode(size_t insertlen, size_t copylen,
+                                        BROTLI_BOOL use_last_distance,
+                                        uint16_t* code) {
+  uint16_t inscode = GetInsertLengthCode(insertlen);
+  uint16_t copycode = GetCopyLengthCode(copylen);
+  *code = CombineLengthCodes(inscode, copycode, use_last_distance);
+}
+
+static BROTLI_INLINE uint32_t GetInsertBase(uint16_t inscode) {
+  return kBrotliInsBase[inscode];
+}
+
+static BROTLI_INLINE uint32_t GetInsertExtra(uint16_t inscode) {
+  return kBrotliInsExtra[inscode];
+}
+
+static BROTLI_INLINE uint32_t GetCopyBase(uint16_t copycode) {
+  return kBrotliCopyBase[copycode];
+}
+
+static BROTLI_INLINE uint32_t GetCopyExtra(uint16_t copycode) {
+  return kBrotliCopyExtra[copycode];
+}
+
+typedef struct Command {
+  uint32_t insert_len_;
+  /* Stores copy_len in low 25 bits and copy_code - copy_len in high 7 bit. */
+  uint32_t copy_len_;
+  /* Stores distance extra bits. */
+  uint32_t dist_extra_;
+  uint16_t cmd_prefix_;
+  /* Stores distance code in low 10 bits
+     and number of extra bits in high 6 bits. */
+  uint16_t dist_prefix_;
+} Command;
+
+/* distance_code is e.g. 0 for same-as-last short code, or 16 for offset 1. */
+static BROTLI_INLINE void InitCommand(Command* self,
+    const BrotliDistanceParams* dist, size_t insertlen,
+    size_t copylen, int copylen_code_delta, size_t distance_code) {
+  /* Don't rely on signed int representation, use honest casts. */
+  uint32_t delta = (uint8_t)((int8_t)copylen_code_delta);
+  self->insert_len_ = (uint32_t)insertlen;
+  self->copy_len_ = (uint32_t)(copylen | (delta << 25));
+  /* The distance prefix and extra bits are stored in this Command as if
+     npostfix and ndirect were 0, they are only recomputed later after the
+     clustering if needed. */
+  PrefixEncodeCopyDistance(
+      distance_code, dist->num_direct_distance_codes,
+      dist->distance_postfix_bits, &self->dist_prefix_, &self->dist_extra_);
+  GetLengthCode(
+      insertlen, (size_t)((int)copylen + copylen_code_delta),
+      TO_BROTLI_BOOL((self->dist_prefix_ & 0x3FF) == 0), &self->cmd_prefix_);
+}
+
+static BROTLI_INLINE void InitInsertCommand(Command* self, size_t insertlen) {
+  self->insert_len_ = (uint32_t)insertlen;
+  self->copy_len_ = 4 << 25;
+  self->dist_extra_ = 0;
+  self->dist_prefix_ = BROTLI_NUM_DISTANCE_SHORT_CODES;
+  GetLengthCode(insertlen, 4, BROTLI_FALSE, &self->cmd_prefix_);
+}
+
+static BROTLI_INLINE uint32_t CommandRestoreDistanceCode(
+    const Command* self, const BrotliDistanceParams* dist) {
+  if ((self->dist_prefix_ & 0x3FFu) <
+      BROTLI_NUM_DISTANCE_SHORT_CODES + dist->num_direct_distance_codes) {
+    return self->dist_prefix_ & 0x3FFu;
+  } else {
+    uint32_t dcode = self->dist_prefix_ & 0x3FFu;
+    uint32_t nbits = self->dist_prefix_ >> 10;
+    uint32_t extra = self->dist_extra_;
+    uint32_t postfix_mask = (1U << dist->distance_postfix_bits) - 1U;
+    uint32_t hcode = (dcode - dist->num_direct_distance_codes -
+        BROTLI_NUM_DISTANCE_SHORT_CODES) >>
+        dist->distance_postfix_bits;
+    uint32_t lcode = (dcode - dist->num_direct_distance_codes -
+        BROTLI_NUM_DISTANCE_SHORT_CODES) & postfix_mask;
+    uint32_t offset = ((2U + (hcode & 1U)) << nbits) - 4U;
+    return ((offset + extra) << dist->distance_postfix_bits) + lcode +
+        dist->num_direct_distance_codes + BROTLI_NUM_DISTANCE_SHORT_CODES;
+  }
+}
+
+static BROTLI_INLINE uint32_t CommandDistanceContext(const Command* self) {
+  uint32_t r = self->cmd_prefix_ >> 6;
+  uint32_t c = self->cmd_prefix_ & 7;
+  if ((r == 0 || r == 2 || r == 4 || r == 7) && (c <= 2)) {
+    return c;
+  }
+  return 3;
+}
+
+static BROTLI_INLINE uint32_t CommandCopyLen(const Command* self) {
+  return self->copy_len_ & 0x1FFFFFF;
+}
+
+static BROTLI_INLINE uint32_t CommandCopyLenCode(const Command* self) {
+  uint32_t modifier = self->copy_len_ >> 25;
+  int32_t delta = (int8_t)((uint8_t)(modifier | ((modifier & 0x40) << 1)));
+  return (uint32_t)((int32_t)(self->copy_len_ & 0x1FFFFFF) + delta);
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_COMMAND_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compound_dictionary.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compound_dictionary.c
new file mode 100644
index 0000000000..a3b5e6933d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compound_dictionary.c
@@ -0,0 +1,207 @@
+/* Copyright 2017 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include "compound_dictionary.h"
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+#include "memory.h"
+#include "quality.h"
+
+static PreparedDictionary* CreatePreparedDictionaryWithParams(MemoryManager* m,
+    const uint8_t* source, size_t source_size, uint32_t bucket_bits,
+    uint32_t slot_bits, uint32_t hash_bits, uint16_t bucket_limit) {
+  /* Step 1: create "bloated" hasher. */
+  uint32_t num_slots = 1u << slot_bits;
+  uint32_t num_buckets = 1u << bucket_bits;
+  uint32_t hash_shift = 64u - bucket_bits;
+  uint64_t hash_mask = (~((uint64_t)0U)) >> (64 - hash_bits);
+  uint32_t slot_mask = num_slots - 1;
+  size_t alloc_size = (sizeof(uint32_t) << slot_bits) +
+      (sizeof(uint32_t) << slot_bits) +
+      (sizeof(uint16_t) << bucket_bits) +
+      (sizeof(uint32_t) << bucket_bits) +
+      (sizeof(uint32_t) * source_size);
+  uint8_t* flat = NULL;
+  PreparedDictionary* result = NULL;
+  uint16_t* num = NULL;
+  uint32_t* bucket_heads = NULL;
+  uint32_t* next_bucket = NULL;
+  uint32_t* slot_offsets = NULL;
+  uint16_t* heads = NULL;
+  uint32_t* items = NULL;
+  uint8_t** source_ref = NULL;
+  uint32_t i;
+  uint32_t* slot_size = NULL;
+  uint32_t* slot_limit = NULL;
+  uint32_t total_items = 0;
+  if (slot_bits > 16) return NULL;
+  if (slot_bits > bucket_bits) return NULL;
+  if (bucket_bits - slot_bits >= 16) return NULL;
+
+  flat = BROTLI_ALLOC(m, uint8_t, alloc_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(flat)) return NULL;
+
+  slot_size = (uint32_t*)flat;
+  slot_limit = (uint32_t*)(&slot_size[num_slots]);
+  num = (uint16_t*)(&slot_limit[num_slots]);
+  bucket_heads = (uint32_t*)(&num[num_buckets]);
+  next_bucket = (uint32_t*)(&bucket_heads[num_buckets]);
+  memset(num, 0, num_buckets * sizeof(num[0]));
+
+  /* TODO(eustas): apply custom "store" order. */
+  for (i = 0; i + 7 < source_size; ++i) {
+    const uint64_t h = (BROTLI_UNALIGNED_LOAD64LE(&source[i]) & hash_mask) *
+        kPreparedDictionaryHashMul64Long;
+    const uint32_t key = (uint32_t)(h >> hash_shift);
+    uint16_t count = num[key];
+    next_bucket[i] = (count == 0) ? ((uint32_t)(-1)) : bucket_heads[key];
+    bucket_heads[key] = i;
+    count++;
+    if (count > bucket_limit) count = bucket_limit;
+    num[key] = count;
+  }
+
+  /* Step 2: find slot limits. */
+  for (i = 0; i < num_slots; ++i) {
+    BROTLI_BOOL overflow = BROTLI_FALSE;
+    slot_limit[i] = bucket_limit;
+    while (BROTLI_TRUE) {
+      uint32_t limit = slot_limit[i];
+      size_t j;
+      uint32_t count = 0;
+      overflow = BROTLI_FALSE;
+      for (j = i; j < num_buckets; j += num_slots) {
+        uint32_t size = num[j];
+        /* Last chain may span behind 64K limit; overflow happens only if
+           we are about to use 0xFFFF+ as item offset. */
+        if (count >= 0xFFFF) {
+          overflow = BROTLI_TRUE;
+          break;
+        }
+        if (size > limit) size = limit;
+        count += size;
+      }
+      if (!overflow) {
+        slot_size[i] = count;
+        total_items += count;
+        break;
+      }
+      slot_limit[i]--;
+    }
+  }
+
+  /* Step 3: transfer data to "slim" hasher. */
+  alloc_size = sizeof(PreparedDictionary) + (sizeof(uint32_t) << slot_bits) +
+      (sizeof(uint16_t) << bucket_bits) + (sizeof(uint32_t) * total_items) +
+      sizeof(uint8_t*);
+
+  result = (PreparedDictionary*)BROTLI_ALLOC(m, uint8_t, alloc_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(result)) {
+    BROTLI_FREE(m, flat);
+    return NULL;
+  }
+  slot_offsets = (uint32_t*)(&result[1]);
+  heads = (uint16_t*)(&slot_offsets[num_slots]);
+  items = (uint32_t*)(&heads[num_buckets]);
+  source_ref = (uint8_t**)(&items[total_items]);
+
+  result->magic = kLeanPreparedDictionaryMagic;
+  result->num_items = total_items;
+  result->source_size = (uint32_t)source_size;
+  result->hash_bits = hash_bits;
+  result->bucket_bits = bucket_bits;
+  result->slot_bits = slot_bits;
+  BROTLI_UNALIGNED_STORE_PTR(source_ref, source);
+
+  total_items = 0;
+  for (i = 0; i < num_slots; ++i) {
+    slot_offsets[i] = total_items;
+    total_items += slot_size[i];
+    slot_size[i] = 0;
+  }
+  for (i = 0; i < num_buckets; ++i) {
+    uint32_t slot = i & slot_mask;
+    uint32_t count = num[i];
+    uint32_t pos;
+    size_t j;
+    size_t cursor = slot_size[slot];
+    if (count > slot_limit[slot]) count = slot_limit[slot];
+    if (count == 0) {
+      heads[i] = 0xFFFF;
+      continue;
+    }
+    heads[i] = (uint16_t)cursor;
+    cursor += slot_offsets[slot];
+    slot_size[slot] += count;
+    pos = bucket_heads[i];
+    for (j = 0; j < count; j++) {
+      items[cursor++] = pos;
+      pos = next_bucket[pos];
+    }
+    items[cursor - 1] |= 0x80000000;
+  }
+
+  BROTLI_FREE(m, flat);
+  return result;
+}
+
+PreparedDictionary* CreatePreparedDictionary(MemoryManager* m,
+    const uint8_t* source, size_t source_size) {
+  uint32_t bucket_bits = 17;
+  uint32_t slot_bits = 7;
+  uint32_t hash_bits = 40;
+  uint16_t bucket_limit = 32;
+  size_t volume = 16u << bucket_bits;
+  /* Tune parameters to fit dictionary size. */
+  while (volume < source_size && bucket_bits < 22) {
+    bucket_bits++;
+    slot_bits++;
+    volume <<= 1;
+  }
+  return CreatePreparedDictionaryWithParams(m,
+      source, source_size, bucket_bits, slot_bits, hash_bits, bucket_limit);
+}
+
+void DestroyPreparedDictionary(MemoryManager* m,
+    PreparedDictionary* dictionary) {
+  if (!dictionary) return;
+  BROTLI_FREE(m, dictionary);
+}
+
+BROTLI_BOOL AttachPreparedDictionary(
+    CompoundDictionary* compound, const PreparedDictionary* dictionary) {
+  size_t length = 0;
+  size_t index = 0;
+
+  if (compound->num_chunks == SHARED_BROTLI_MAX_COMPOUND_DICTS) {
+    return BROTLI_FALSE;
+  }
+
+  if (!dictionary) return BROTLI_FALSE;
+
+  length = dictionary->source_size;
+  index = compound->num_chunks;
+  compound->total_size += length;
+  compound->chunks[index] = dictionary;
+  compound->chunk_offsets[index + 1] = compound->total_size;
+  {
+    uint32_t* slot_offsets = (uint32_t*)(&dictionary[1]);
+    uint16_t* heads = (uint16_t*)(&slot_offsets[1u << dictionary->slot_bits]);
+    uint32_t* items = (uint32_t*)(&heads[1u << dictionary->bucket_bits]);
+    const void* tail = (void*)&items[dictionary->num_items];
+    if (dictionary->magic == kPreparedDictionaryMagic) {
+      compound->chunk_source[index] = (const uint8_t*)tail;
+    } else {
+      /* dictionary->magic == kLeanPreparedDictionaryMagic */
+      compound->chunk_source[index] =
+          (const uint8_t*)BROTLI_UNALIGNED_LOAD_PTR((const uint8_t**)tail);
+    }
+  }
+  compound->num_chunks++;
+  return BROTLI_TRUE;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compound_dictionary.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compound_dictionary.h
new file mode 100644
index 0000000000..9c531d5b19
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compound_dictionary.h
@@ -0,0 +1,74 @@
+/* Copyright 2017 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#ifndef BROTLI_ENC_PREPARED_DICTIONARY_H_
+#define BROTLI_ENC_PREPARED_DICTIONARY_H_
+
+#include <brotli/shared_dictionary.h>
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+#include "../common/constants.h"
+#include "memory.h"
+
+/* "Fat" prepared dictionary, could be cooked outside of C implementation,
+ * e.g. on Java side. LZ77 data is copied inside PreparedDictionary struct. */
+static const uint32_t kPreparedDictionaryMagic = 0xDEBCEDE0;
+
+static const uint32_t kSharedDictionaryMagic = 0xDEBCEDE1;
+
+static const uint32_t kManagedDictionaryMagic = 0xDEBCEDE2;
+
+/* "Lean" prepared dictionary. LZ77 data is referenced. It is the responsibility
+ * of caller of "prepare dictionary" to keep the LZ77 data while prepared
+ * dictionary is in use. */
+static const uint32_t kLeanPreparedDictionaryMagic = 0xDEBCEDE3;
+
+static const uint64_t kPreparedDictionaryHashMul64Long =
+    BROTLI_MAKE_UINT64_T(0x1FE35A7Bu, 0xD3579BD3u);
+
+typedef struct PreparedDictionary {
+  uint32_t magic;
+  uint32_t num_items;
+  uint32_t source_size;
+  uint32_t hash_bits;
+  uint32_t bucket_bits;
+  uint32_t slot_bits;
+
+  /* --- Dynamic size members --- */
+
+  /* uint32_t slot_offsets[1 << slot_bits]; */
+  /* uint16_t heads[1 << bucket_bits]; */
+  /* uint32_t items[variable]; */
+
+  /* [maybe] uint8_t* source_ref, depending on magic. */
+  /* [maybe] uint8_t source[source_size], depending on magic. */
+} PreparedDictionary;
+
+BROTLI_INTERNAL PreparedDictionary* CreatePreparedDictionary(MemoryManager* m,
+    const uint8_t* source, size_t source_size);
+
+BROTLI_INTERNAL void DestroyPreparedDictionary(MemoryManager* m,
+    PreparedDictionary* dictionary);
+
+typedef struct CompoundDictionary {
+  /* LZ77 prefix, compound dictionary */
+  size_t num_chunks;
+  size_t total_size;
+  /* Client instances. */
+  const PreparedDictionary* chunks[SHARED_BROTLI_MAX_COMPOUND_DICTS + 1];
+  const uint8_t* chunk_source[SHARED_BROTLI_MAX_COMPOUND_DICTS + 1];
+  size_t chunk_offsets[SHARED_BROTLI_MAX_COMPOUND_DICTS + 1];
+
+  size_t num_prepared_instances_;
+  /* Owned instances. */
+  PreparedDictionary* prepared_instances_[SHARED_BROTLI_MAX_COMPOUND_DICTS + 1];
+} CompoundDictionary;
+
+BROTLI_INTERNAL BROTLI_BOOL AttachPreparedDictionary(
+    CompoundDictionary* compound, const PreparedDictionary* dictionary);
+
+#endif /* BROTLI_ENC_PREPARED_DICTIONARY */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment.c
new file mode 100644
index 0000000000..13890eabf6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment.c
@@ -0,0 +1,800 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Function for fast encoding of an input fragment, independently from the input
+   history. This function uses one-pass processing: when we find a backward
+   match, we immediately emit the corresponding command and literal codes to
+   the bit stream.
+
+   Adapted from the CompressFragment() function in
+   https://github.com/google/snappy/blob/master/snappy.cc */
+
+#include "compress_fragment.h"
+
+#include <string.h>  /* memcmp, memcpy, memset */
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+#include "brotli_bit_stream.h"
+#include "entropy_encode.h"
+#include "fast_log.h"
+#include "find_match_length.h"
+#include "write_bits.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define MAX_DISTANCE (long)BROTLI_MAX_BACKWARD_LIMIT(18)
+
+/* kHashMul32 multiplier has these properties:
+   * The multiplier must be odd. Otherwise we may lose the highest bit.
+   * No long streaks of ones or zeros.
+   * There is no effort to ensure that it is a prime, the oddity is enough
+     for this use.
+   * The number has been tuned heuristically against compression benchmarks. */
+static const uint32_t kHashMul32 = 0x1E35A7BD;
+
+static BROTLI_INLINE uint32_t Hash(const uint8_t* p, size_t shift) {
+  const uint64_t h = (BROTLI_UNALIGNED_LOAD64LE(p) << 24) * kHashMul32;
+  return (uint32_t)(h >> shift);
+}
+
+static BROTLI_INLINE uint32_t HashBytesAtOffset(
+    uint64_t v, int offset, size_t shift) {
+  BROTLI_DCHECK(offset >= 0);
+  BROTLI_DCHECK(offset <= 3);
+  {
+    const uint64_t h = ((v >> (8 * offset)) << 24) * kHashMul32;
+    return (uint32_t)(h >> shift);
+  }
+}
+
+static BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2) {
+  return TO_BROTLI_BOOL(
+      BrotliUnalignedRead32(p1) == BrotliUnalignedRead32(p2) &&
+      p1[4] == p2[4]);
+}
+
+/* Builds a literal prefix code into "depths" and "bits" based on the statistics
+   of the "input" string and stores it into the bit stream.
+   Note that the prefix code here is built from the pre-LZ77 input, therefore
+   we can only approximate the statistics of the actual literal stream.
+   Moreover, for long inputs we build a histogram from a sample of the input
+   and thus have to assign a non-zero depth for each literal.
+   Returns estimated compression ratio millibytes/char for encoding given input
+   with generated code. */
+static size_t BuildAndStoreLiteralPrefixCode(BrotliOnePassArena* s,
+                                             const uint8_t* input,
+                                             const size_t input_size,
+                                             uint8_t depths[256],
+                                             uint16_t bits[256],
+                                             size_t* storage_ix,
+                                             uint8_t* storage) {
+  uint32_t* BROTLI_RESTRICT const histogram = s->histogram;
+  size_t histogram_total;
+  size_t i;
+  memset(histogram, 0, sizeof(s->histogram));
+
+  if (input_size < (1 << 15)) {
+    for (i = 0; i < input_size; ++i) {
+      ++histogram[input[i]];
+    }
+    histogram_total = input_size;
+    for (i = 0; i < 256; ++i) {
+      /* We weigh the first 11 samples with weight 3 to account for the
+         balancing effect of the LZ77 phase on the histogram. */
+      const uint32_t adjust = 2 * BROTLI_MIN(uint32_t, histogram[i], 11u);
+      histogram[i] += adjust;
+      histogram_total += adjust;
+    }
+  } else {
+    static const size_t kSampleRate = 29;
+    for (i = 0; i < input_size; i += kSampleRate) {
+      ++histogram[input[i]];
+    }
+    histogram_total = (input_size + kSampleRate - 1) / kSampleRate;
+    for (i = 0; i < 256; ++i) {
+      /* We add 1 to each population count to avoid 0 bit depths (since this is
+         only a sample and we don't know if the symbol appears or not), and we
+         weigh the first 11 samples with weight 3 to account for the balancing
+         effect of the LZ77 phase on the histogram (more frequent symbols are
+         more likely to be in backward references instead as literals). */
+      const uint32_t adjust = 1 + 2 * BROTLI_MIN(uint32_t, histogram[i], 11u);
+      histogram[i] += adjust;
+      histogram_total += adjust;
+    }
+  }
+  BrotliBuildAndStoreHuffmanTreeFast(s->tree, histogram, histogram_total,
+                                     /* max_bits = */ 8,
+                                     depths, bits, storage_ix, storage);
+  {
+    size_t literal_ratio = 0;
+    for (i = 0; i < 256; ++i) {
+      if (histogram[i]) literal_ratio += histogram[i] * depths[i];
+    }
+    /* Estimated encoding ratio, millibytes per symbol. */
+    return (literal_ratio * 125) / histogram_total;
+  }
+}
+
+/* Builds a command and distance prefix code (each 64 symbols) into "depth" and
+   "bits" based on "histogram" and stores it into the bit stream. */
+static void BuildAndStoreCommandPrefixCode(BrotliOnePassArena* s,
+    size_t* storage_ix, uint8_t* storage) {
+  const uint32_t* const histogram = s->cmd_histo;
+  uint8_t* const depth = s->cmd_depth;
+  uint16_t* const bits = s->cmd_bits;
+  uint8_t* BROTLI_RESTRICT const tmp_depth = s->tmp_depth;
+  uint16_t* BROTLI_RESTRICT const tmp_bits = s->tmp_bits;
+  /* TODO(eustas): do only once on initialization. */
+  memset(tmp_depth, 0, BROTLI_NUM_COMMAND_SYMBOLS);
+
+  BrotliCreateHuffmanTree(histogram, 64, 15, s->tree, depth);
+  BrotliCreateHuffmanTree(&histogram[64], 64, 14, s->tree, &depth[64]);
+  /* We have to jump through a few hoops here in order to compute
+     the command bits because the symbols are in a different order than in
+     the full alphabet. This looks complicated, but having the symbols
+     in this order in the command bits saves a few branches in the Emit*
+     functions. */
+  memcpy(tmp_depth, depth, 24);
+  memcpy(tmp_depth + 24, depth + 40, 8);
+  memcpy(tmp_depth + 32, depth + 24, 8);
+  memcpy(tmp_depth + 40, depth + 48, 8);
+  memcpy(tmp_depth + 48, depth + 32, 8);
+  memcpy(tmp_depth + 56, depth + 56, 8);
+  BrotliConvertBitDepthsToSymbols(tmp_depth, 64, tmp_bits);
+  memcpy(bits, tmp_bits, 48);
+  memcpy(bits + 24, tmp_bits + 32, 16);
+  memcpy(bits + 32, tmp_bits + 48, 16);
+  memcpy(bits + 40, tmp_bits + 24, 16);
+  memcpy(bits + 48, tmp_bits + 40, 16);
+  memcpy(bits + 56, tmp_bits + 56, 16);
+  BrotliConvertBitDepthsToSymbols(&depth[64], 64, &bits[64]);
+  {
+    /* Create the bit length array for the full command alphabet. */
+    size_t i;
+    memset(tmp_depth, 0, 64);  /* only 64 first values were used */
+    memcpy(tmp_depth, depth, 8);
+    memcpy(tmp_depth + 64, depth + 8, 8);
+    memcpy(tmp_depth + 128, depth + 16, 8);
+    memcpy(tmp_depth + 192, depth + 24, 8);
+    memcpy(tmp_depth + 384, depth + 32, 8);
+    for (i = 0; i < 8; ++i) {
+      tmp_depth[128 + 8 * i] = depth[40 + i];
+      tmp_depth[256 + 8 * i] = depth[48 + i];
+      tmp_depth[448 + 8 * i] = depth[56 + i];
+    }
+    /* TODO(eustas): could/should full-length machinery be avoided? */
+    BrotliStoreHuffmanTree(
+        tmp_depth, BROTLI_NUM_COMMAND_SYMBOLS, s->tree, storage_ix, storage);
+  }
+  BrotliStoreHuffmanTree(&depth[64], 64, s->tree, storage_ix, storage);
+}
+
+/* REQUIRES: insertlen < 6210 */
+static BROTLI_INLINE void EmitInsertLen(size_t insertlen,
+                                        const uint8_t depth[128],
+                                        const uint16_t bits[128],
+                                        uint32_t histo[128],
+                                        size_t* storage_ix,
+                                        uint8_t* storage) {
+  if (insertlen < 6) {
+    const size_t code = insertlen + 40;
+    BrotliWriteBits(depth[code], bits[code], storage_ix, storage);
+    ++histo[code];
+  } else if (insertlen < 130) {
+    const size_t tail = insertlen - 2;
+    const uint32_t nbits = Log2FloorNonZero(tail) - 1u;
+    const size_t prefix = tail >> nbits;
+    const size_t inscode = (nbits << 1) + prefix + 42;
+    BrotliWriteBits(depth[inscode], bits[inscode], storage_ix, storage);
+    BrotliWriteBits(nbits, tail - (prefix << nbits), storage_ix, storage);
+    ++histo[inscode];
+  } else if (insertlen < 2114) {
+    const size_t tail = insertlen - 66;
+    const uint32_t nbits = Log2FloorNonZero(tail);
+    const size_t code = nbits + 50;
+    BrotliWriteBits(depth[code], bits[code], storage_ix, storage);
+    BrotliWriteBits(nbits, tail - ((size_t)1 << nbits), storage_ix, storage);
+    ++histo[code];
+  } else {
+    BrotliWriteBits(depth[61], bits[61], storage_ix, storage);
+    BrotliWriteBits(12, insertlen - 2114, storage_ix, storage);
+    ++histo[61];
+  }
+}
+
+static BROTLI_INLINE void EmitLongInsertLen(size_t insertlen,
+                                            const uint8_t depth[128],
+                                            const uint16_t bits[128],
+                                            uint32_t histo[128],
+                                            size_t* storage_ix,
+                                            uint8_t* storage) {
+  if (insertlen < 22594) {
+    BrotliWriteBits(depth[62], bits[62], storage_ix, storage);
+    BrotliWriteBits(14, insertlen - 6210, storage_ix, storage);
+    ++histo[62];
+  } else {
+    BrotliWriteBits(depth[63], bits[63], storage_ix, storage);
+    BrotliWriteBits(24, insertlen - 22594, storage_ix, storage);
+    ++histo[63];
+  }
+}
+
+static BROTLI_INLINE void EmitCopyLen(size_t copylen,
+                                      const uint8_t depth[128],
+                                      const uint16_t bits[128],
+                                      uint32_t histo[128],
+                                      size_t* storage_ix,
+                                      uint8_t* storage) {
+  if (copylen < 10) {
+    BrotliWriteBits(
+        depth[copylen + 14], bits[copylen + 14], storage_ix, storage);
+    ++histo[copylen + 14];
+  } else if (copylen < 134) {
+    const size_t tail = copylen - 6;
+    const uint32_t nbits = Log2FloorNonZero(tail) - 1u;
+    const size_t prefix = tail >> nbits;
+    const size_t code = (nbits << 1) + prefix + 20;
+    BrotliWriteBits(depth[code], bits[code], storage_ix, storage);
+    BrotliWriteBits(nbits, tail - (prefix << nbits), storage_ix, storage);
+    ++histo[code];
+  } else if (copylen < 2118) {
+    const size_t tail = copylen - 70;
+    const uint32_t nbits = Log2FloorNonZero(tail);
+    const size_t code = nbits + 28;
+    BrotliWriteBits(depth[code], bits[code], storage_ix, storage);
+    BrotliWriteBits(nbits, tail - ((size_t)1 << nbits), storage_ix, storage);
+    ++histo[code];
+  } else {
+    BrotliWriteBits(depth[39], bits[39], storage_ix, storage);
+    BrotliWriteBits(24, copylen - 2118, storage_ix, storage);
+    ++histo[39];
+  }
+}
+
+static BROTLI_INLINE void EmitCopyLenLastDistance(size_t copylen,
+                                                  const uint8_t depth[128],
+                                                  const uint16_t bits[128],
+                                                  uint32_t histo[128],
+                                                  size_t* storage_ix,
+                                                  uint8_t* storage) {
+  if (copylen < 12) {
+    BrotliWriteBits(depth[copylen - 4], bits[copylen - 4], storage_ix, storage);
+    ++histo[copylen - 4];
+  } else if (copylen < 72) {
+    const size_t tail = copylen - 8;
+    const uint32_t nbits = Log2FloorNonZero(tail) - 1;
+    const size_t prefix = tail >> nbits;
+    const size_t code = (nbits << 1) + prefix + 4;
+    BrotliWriteBits(depth[code], bits[code], storage_ix, storage);
+    BrotliWriteBits(nbits, tail - (prefix << nbits), storage_ix, storage);
+    ++histo[code];
+  } else if (copylen < 136) {
+    const size_t tail = copylen - 8;
+    const size_t code = (tail >> 5) + 30;
+    BrotliWriteBits(depth[code], bits[code], storage_ix, storage);
+    BrotliWriteBits(5, tail & 31, storage_ix, storage);
+    BrotliWriteBits(depth[64], bits[64], storage_ix, storage);
+    ++histo[code];
+    ++histo[64];
+  } else if (copylen < 2120) {
+    const size_t tail = copylen - 72;
+    const uint32_t nbits = Log2FloorNonZero(tail);
+    const size_t code = nbits + 28;
+    BrotliWriteBits(depth[code], bits[code], storage_ix, storage);
+    BrotliWriteBits(nbits, tail - ((size_t)1 << nbits), storage_ix, storage);
+    BrotliWriteBits(depth[64], bits[64], storage_ix, storage);
+    ++histo[code];
+    ++histo[64];
+  } else {
+    BrotliWriteBits(depth[39], bits[39], storage_ix, storage);
+    BrotliWriteBits(24, copylen - 2120, storage_ix, storage);
+    BrotliWriteBits(depth[64], bits[64], storage_ix, storage);
+    ++histo[39];
+    ++histo[64];
+  }
+}
+
+static BROTLI_INLINE void EmitDistance(size_t distance,
+                                       const uint8_t depth[128],
+                                       const uint16_t bits[128],
+                                       uint32_t histo[128],
+                                       size_t* storage_ix, uint8_t* storage) {
+  const size_t d = distance + 3;
+  const uint32_t nbits = Log2FloorNonZero(d) - 1u;
+  const size_t prefix = (d >> nbits) & 1;
+  const size_t offset = (2 + prefix) << nbits;
+  const size_t distcode = 2 * (nbits - 1) + prefix + 80;
+  BrotliWriteBits(depth[distcode], bits[distcode], storage_ix, storage);
+  BrotliWriteBits(nbits, d - offset, storage_ix, storage);
+  ++histo[distcode];
+}
+
+static BROTLI_INLINE void EmitLiterals(const uint8_t* input, const size_t len,
+                                       const uint8_t depth[256],
+                                       const uint16_t bits[256],
+                                       size_t* storage_ix, uint8_t* storage) {
+  size_t j;
+  for (j = 0; j < len; j++) {
+    const uint8_t lit = input[j];
+    BrotliWriteBits(depth[lit], bits[lit], storage_ix, storage);
+  }
+}
+
+/* REQUIRES: len <= 1 << 24. */
+static void BrotliStoreMetaBlockHeader(
+    size_t len, BROTLI_BOOL is_uncompressed, size_t* storage_ix,
+    uint8_t* storage) {
+  size_t nibbles = 6;
+  /* ISLAST */
+  BrotliWriteBits(1, 0, storage_ix, storage);
+  if (len <= (1U << 16)) {
+    nibbles = 4;
+  } else if (len <= (1U << 20)) {
+    nibbles = 5;
+  }
+  BrotliWriteBits(2, nibbles - 4, storage_ix, storage);
+  BrotliWriteBits(nibbles * 4, len - 1, storage_ix, storage);
+  /* ISUNCOMPRESSED */
+  BrotliWriteBits(1, (uint64_t)is_uncompressed, storage_ix, storage);
+}
+
+static void UpdateBits(size_t n_bits, uint32_t bits, size_t pos,
+    uint8_t* array) {
+  while (n_bits > 0) {
+    size_t byte_pos = pos >> 3;
+    size_t n_unchanged_bits = pos & 7;
+    size_t n_changed_bits = BROTLI_MIN(size_t, n_bits, 8 - n_unchanged_bits);
+    size_t total_bits = n_unchanged_bits + n_changed_bits;
+    uint32_t mask =
+        (~((1u << total_bits) - 1u)) | ((1u << n_unchanged_bits) - 1u);
+    uint32_t unchanged_bits = array[byte_pos] & mask;
+    uint32_t changed_bits = bits & ((1u << n_changed_bits) - 1u);
+    array[byte_pos] =
+        (uint8_t)((changed_bits << n_unchanged_bits) | unchanged_bits);
+    n_bits -= n_changed_bits;
+    bits >>= n_changed_bits;
+    pos += n_changed_bits;
+  }
+}
+
+static void RewindBitPosition(const size_t new_storage_ix,
+                              size_t* storage_ix, uint8_t* storage) {
+  const size_t bitpos = new_storage_ix & 7;
+  const size_t mask = (1u << bitpos) - 1;
+  storage[new_storage_ix >> 3] &= (uint8_t)mask;
+  *storage_ix = new_storage_ix;
+}
+
+static BROTLI_BOOL ShouldMergeBlock(BrotliOnePassArena* s,
+    const uint8_t* data, size_t len, const uint8_t* depths) {
+  uint32_t* BROTLI_RESTRICT const histo = s->histogram;
+  static const size_t kSampleRate = 43;
+  size_t i;
+  memset(histo, 0, sizeof(s->histogram));
+  for (i = 0; i < len; i += kSampleRate) {
+    ++histo[data[i]];
+  }
+  {
+    const size_t total = (len + kSampleRate - 1) / kSampleRate;
+    double r = (FastLog2(total) + 0.5) * (double)total + 200;
+    for (i = 0; i < 256; ++i) {
+      r -= (double)histo[i] * (depths[i] + FastLog2(histo[i]));
+    }
+    return TO_BROTLI_BOOL(r >= 0.0);
+  }
+}
+
+/* Acceptable loss for uncompressible speedup is 2% */
+#define MIN_RATIO 980
+
+static BROTLI_INLINE BROTLI_BOOL ShouldUseUncompressedMode(
+    const uint8_t* metablock_start, const uint8_t* next_emit,
+    const size_t insertlen, const size_t literal_ratio) {
+  const size_t compressed = (size_t)(next_emit - metablock_start);
+  if (compressed * 50 > insertlen) {
+    return BROTLI_FALSE;
+  } else {
+    return TO_BROTLI_BOOL(literal_ratio > MIN_RATIO);
+  }
+}
+
+static void EmitUncompressedMetaBlock(const uint8_t* begin, const uint8_t* end,
+                                      const size_t storage_ix_start,
+                                      size_t* storage_ix, uint8_t* storage) {
+  const size_t len = (size_t)(end - begin);
+  RewindBitPosition(storage_ix_start, storage_ix, storage);
+  BrotliStoreMetaBlockHeader(len, 1, storage_ix, storage);
+  *storage_ix = (*storage_ix + 7u) & ~7u;
+  memcpy(&storage[*storage_ix >> 3], begin, len);
+  *storage_ix += len << 3;
+  storage[*storage_ix >> 3] = 0;
+}
+
+static uint32_t kCmdHistoSeed[128] = {
+  0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1,
+  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1,
+  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+  1, 1, 1, 1, 0, 0, 0, 0,
+};
+
+static BROTLI_INLINE void BrotliCompressFragmentFastImpl(
+    BrotliOnePassArena* s, const uint8_t* input, size_t input_size,
+    BROTLI_BOOL is_last, int* table, size_t table_bits,
+    size_t* storage_ix, uint8_t* storage) {
+  uint8_t* BROTLI_RESTRICT const cmd_depth = s->cmd_depth;
+  uint16_t* BROTLI_RESTRICT const cmd_bits = s->cmd_bits;
+  uint32_t* BROTLI_RESTRICT const cmd_histo = s->cmd_histo;
+  uint8_t* BROTLI_RESTRICT const lit_depth = s->lit_depth;
+  uint16_t* BROTLI_RESTRICT const lit_bits = s->lit_bits;
+  const uint8_t* ip_end;
+
+  /* "next_emit" is a pointer to the first byte that is not covered by a
+     previous copy. Bytes between "next_emit" and the start of the next copy or
+     the end of the input will be emitted as literal bytes. */
+  const uint8_t* next_emit = input;
+  /* Save the start of the first block for position and distance computations.
+  */
+  const uint8_t* base_ip = input;
+
+  static const size_t kFirstBlockSize = 3 << 15;
+  static const size_t kMergeBlockSize = 1 << 16;
+
+  const size_t kInputMarginBytes = BROTLI_WINDOW_GAP;
+  const size_t kMinMatchLen = 5;
+
+  const uint8_t* metablock_start = input;
+  size_t block_size = BROTLI_MIN(size_t, input_size, kFirstBlockSize);
+  size_t total_block_size = block_size;
+  /* Save the bit position of the MLEN field of the meta-block header, so that
+     we can update it later if we decide to extend this meta-block. */
+  size_t mlen_storage_ix = *storage_ix + 3;
+
+  size_t literal_ratio;
+
+  const uint8_t* ip;
+  int last_distance;
+
+  const size_t shift = 64u - table_bits;
+
+  BrotliStoreMetaBlockHeader(block_size, 0, storage_ix, storage);
+  /* No block splits, no contexts. */
+  BrotliWriteBits(13, 0, storage_ix, storage);
+
+  literal_ratio = BuildAndStoreLiteralPrefixCode(
+      s, input, block_size, s->lit_depth, s->lit_bits, storage_ix, storage);
+
+  {
+    /* Store the pre-compressed command and distance prefix codes. */
+    size_t i;
+    for (i = 0; i + 7 < s->cmd_code_numbits; i += 8) {
+      BrotliWriteBits(8, s->cmd_code[i >> 3], storage_ix, storage);
+    }
+  }
+  BrotliWriteBits(s->cmd_code_numbits & 7,
+                  s->cmd_code[s->cmd_code_numbits >> 3], storage_ix, storage);
+
+ emit_commands:
+  /* Initialize the command and distance histograms. We will gather
+     statistics of command and distance codes during the processing
+     of this block and use it to update the command and distance
+     prefix codes for the next block. */
+  memcpy(s->cmd_histo, kCmdHistoSeed, sizeof(kCmdHistoSeed));
+
+  /* "ip" is the input pointer. */
+  ip = input;
+  last_distance = -1;
+  ip_end = input + block_size;
+
+  if (BROTLI_PREDICT_TRUE(block_size >= kInputMarginBytes)) {
+    /* For the last block, we need to keep a 16 bytes margin so that we can be
+       sure that all distances are at most window size - 16.
+       For all other blocks, we only need to keep a margin of 5 bytes so that
+       we don't go over the block size with a copy. */
+    const size_t len_limit = BROTLI_MIN(size_t, block_size - kMinMatchLen,
+                                        input_size - kInputMarginBytes);
+    const uint8_t* ip_limit = input + len_limit;
+
+    uint32_t next_hash;
+    for (next_hash = Hash(++ip, shift); ; ) {
+      /* Step 1: Scan forward in the input looking for a 5-byte-long match.
+         If we get close to exhausting the input then goto emit_remainder.
+
+         Heuristic match skipping: If 32 bytes are scanned with no matches
+         found, start looking only at every other byte. If 32 more bytes are
+         scanned, look at every third byte, etc.. When a match is found,
+         immediately go back to looking at every byte. This is a small loss
+         (~5% performance, ~0.1% density) for compressible data due to more
+         bookkeeping, but for non-compressible data (such as JPEG) it's a huge
+         win since the compressor quickly "realizes" the data is incompressible
+         and doesn't bother looking for matches everywhere.
+
+         The "skip" variable keeps track of how many bytes there are since the
+         last match; dividing it by 32 (i.e. right-shifting by five) gives the
+         number of bytes to move ahead for each iteration. */
+      uint32_t skip = 32;
+
+      const uint8_t* next_ip = ip;
+      const uint8_t* candidate;
+      BROTLI_DCHECK(next_emit < ip);
+trawl:
+      do {
+        uint32_t hash = next_hash;
+        uint32_t bytes_between_hash_lookups = skip++ >> 5;
+        BROTLI_DCHECK(hash == Hash(next_ip, shift));
+        ip = next_ip;
+        next_ip = ip + bytes_between_hash_lookups;
+        if (BROTLI_PREDICT_FALSE(next_ip > ip_limit)) {
+          goto emit_remainder;
+        }
+        next_hash = Hash(next_ip, shift);
+        candidate = ip - last_distance;
+        if (IsMatch(ip, candidate)) {
+          if (BROTLI_PREDICT_TRUE(candidate < ip)) {
+            table[hash] = (int)(ip - base_ip);
+            break;
+          }
+        }
+        candidate = base_ip + table[hash];
+        BROTLI_DCHECK(candidate >= base_ip);
+        BROTLI_DCHECK(candidate < ip);
+
+        table[hash] = (int)(ip - base_ip);
+      } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate)));
+
+      /* Check copy distance. If candidate is not feasible, continue search.
+         Checking is done outside of hot loop to reduce overhead. */
+      if (ip - candidate > MAX_DISTANCE) goto trawl;
+
+      /* Step 2: Emit the found match together with the literal bytes from
+         "next_emit" to the bit stream, and then see if we can find a next match
+         immediately afterwards. Repeat until we find no match for the input
+         without emitting some literal bytes. */
+
+      {
+        /* We have a 5-byte match at ip, and we need to emit bytes in
+           [next_emit, ip). */
+        const uint8_t* base = ip;
+        size_t matched = 5 + FindMatchLengthWithLimit(
+            candidate + 5, ip + 5, (size_t)(ip_end - ip) - 5);
+        int distance = (int)(base - candidate);  /* > 0 */
+        size_t insert = (size_t)(base - next_emit);
+        ip += matched;
+        BROTLI_LOG(("[CompressFragment] pos = %d insert = %lu copy = %d\n",
+                    (int)(next_emit - base_ip), (unsigned long)insert, 2));
+        BROTLI_DCHECK(0 == memcmp(base, candidate, matched));
+        if (BROTLI_PREDICT_TRUE(insert < 6210)) {
+          EmitInsertLen(insert, cmd_depth, cmd_bits, cmd_histo,
+                        storage_ix, storage);
+        } else if (ShouldUseUncompressedMode(metablock_start, next_emit, insert,
+                                             literal_ratio)) {
+          EmitUncompressedMetaBlock(metablock_start, base, mlen_storage_ix - 3,
+                                    storage_ix, storage);
+          input_size -= (size_t)(base - input);
+          input = base;
+          next_emit = input;
+          goto next_block;
+        } else {
+          EmitLongInsertLen(insert, cmd_depth, cmd_bits, cmd_histo,
+                            storage_ix, storage);
+        }
+        EmitLiterals(next_emit, insert, lit_depth, lit_bits,
+                     storage_ix, storage);
+        if (distance == last_distance) {
+          BrotliWriteBits(cmd_depth[64], cmd_bits[64], storage_ix, storage);
+          ++cmd_histo[64];
+        } else {
+          EmitDistance((size_t)distance, cmd_depth, cmd_bits,
+                       cmd_histo, storage_ix, storage);
+          last_distance = distance;
+        }
+        EmitCopyLenLastDistance(matched, cmd_depth, cmd_bits, cmd_histo,
+                                storage_ix, storage);
+        BROTLI_LOG(("[CompressFragment] pos = %d distance = %d\n"
+                    "[CompressFragment] pos = %d insert = %d copy = %d\n"
+                    "[CompressFragment] pos = %d distance = %d\n",
+                    (int)(base - base_ip), (int)distance,
+                    (int)(base - base_ip) + 2, 0, (int)matched - 2,
+                    (int)(base - base_ip) + 2, (int)distance));
+
+        next_emit = ip;
+        if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {
+          goto emit_remainder;
+        }
+        /* We could immediately start working at ip now, but to improve
+           compression we first update "table" with the hashes of some positions
+           within the last copy. */
+        {
+          uint64_t input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);
+          uint32_t prev_hash = HashBytesAtOffset(input_bytes, 0, shift);
+          uint32_t cur_hash = HashBytesAtOffset(input_bytes, 3, shift);
+          table[prev_hash] = (int)(ip - base_ip - 3);
+          prev_hash = HashBytesAtOffset(input_bytes, 1, shift);
+          table[prev_hash] = (int)(ip - base_ip - 2);
+          prev_hash = HashBytesAtOffset(input_bytes, 2, shift);
+          table[prev_hash] = (int)(ip - base_ip - 1);
+
+          candidate = base_ip + table[cur_hash];
+          table[cur_hash] = (int)(ip - base_ip);
+        }
+      }
+
+      while (IsMatch(ip, candidate)) {
+        /* We have a 5-byte match at ip, and no need to emit any literal bytes
+           prior to ip. */
+        const uint8_t* base = ip;
+        size_t matched = 5 + FindMatchLengthWithLimit(
+            candidate + 5, ip + 5, (size_t)(ip_end - ip) - 5);
+        if (ip - candidate > MAX_DISTANCE) break;
+        ip += matched;
+        last_distance = (int)(base - candidate);  /* > 0 */
+        BROTLI_DCHECK(0 == memcmp(base, candidate, matched));
+        EmitCopyLen(matched, cmd_depth, cmd_bits, cmd_histo,
+                    storage_ix, storage);
+        EmitDistance((size_t)last_distance, cmd_depth, cmd_bits,
+                     cmd_histo, storage_ix, storage);
+        BROTLI_LOG(("[CompressFragment] pos = %d insert = %d copy = %d\n"
+                    "[CompressFragment] pos = %d distance = %d\n",
+                    (int)(base - base_ip), 0, (int)matched,
+                    (int)(base - base_ip), (int)last_distance));
+
+        next_emit = ip;
+        if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {
+          goto emit_remainder;
+        }
+        /* We could immediately start working at ip now, but to improve
+           compression we first update "table" with the hashes of some positions
+           within the last copy. */
+        {
+          uint64_t input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);
+          uint32_t prev_hash = HashBytesAtOffset(input_bytes, 0, shift);
+          uint32_t cur_hash = HashBytesAtOffset(input_bytes, 3, shift);
+          table[prev_hash] = (int)(ip - base_ip - 3);
+          prev_hash = HashBytesAtOffset(input_bytes, 1, shift);
+          table[prev_hash] = (int)(ip - base_ip - 2);
+          prev_hash = HashBytesAtOffset(input_bytes, 2, shift);
+          table[prev_hash] = (int)(ip - base_ip - 1);
+
+          candidate = base_ip + table[cur_hash];
+          table[cur_hash] = (int)(ip - base_ip);
+        }
+      }
+
+      next_hash = Hash(++ip, shift);
+    }
+  }
+
+ emit_remainder:
+  BROTLI_DCHECK(next_emit <= ip_end);
+  input += block_size;
+  input_size -= block_size;
+  block_size = BROTLI_MIN(size_t, input_size, kMergeBlockSize);
+
+  /* Decide if we want to continue this meta-block instead of emitting the
+     last insert-only command. */
+  if (input_size > 0 &&
+      total_block_size + block_size <= (1 << 20) &&
+      ShouldMergeBlock(s, input, block_size, lit_depth)) {
+    BROTLI_DCHECK(total_block_size > (1 << 16));
+    /* Update the size of the current meta-block and continue emitting commands.
+       We can do this because the current size and the new size both have 5
+       nibbles. */
+    total_block_size += block_size;
+    UpdateBits(20, (uint32_t)(total_block_size - 1), mlen_storage_ix, storage);
+    goto emit_commands;
+  }
+
+  /* Emit the remaining bytes as literals. */
+  if (next_emit < ip_end) {
+    const size_t insert = (size_t)(ip_end - next_emit);
+    BROTLI_LOG(("[CompressFragment] pos = %d insert = %lu copy = %d\n",
+                (int)(next_emit - base_ip), (unsigned long)insert, 2));
+    if (BROTLI_PREDICT_TRUE(insert < 6210)) {
+      EmitInsertLen(insert, cmd_depth, cmd_bits, cmd_histo,
+                    storage_ix, storage);
+      EmitLiterals(next_emit, insert, lit_depth, lit_bits, storage_ix, storage);
+    } else if (ShouldUseUncompressedMode(metablock_start, next_emit, insert,
+                                         literal_ratio)) {
+      EmitUncompressedMetaBlock(metablock_start, ip_end, mlen_storage_ix - 3,
+                                storage_ix, storage);
+    } else {
+      EmitLongInsertLen(insert, cmd_depth, cmd_bits, cmd_histo,
+                        storage_ix, storage);
+      EmitLiterals(next_emit, insert, lit_depth, lit_bits,
+                   storage_ix, storage);
+    }
+  }
+  next_emit = ip_end;
+
+next_block:
+  /* If we have more data, write a new meta-block header and prefix codes and
+     then continue emitting commands. */
+  if (input_size > 0) {
+    metablock_start = input;
+    block_size = BROTLI_MIN(size_t, input_size, kFirstBlockSize);
+    total_block_size = block_size;
+    /* Save the bit position of the MLEN field of the meta-block header, so that
+       we can update it later if we decide to extend this meta-block. */
+    mlen_storage_ix = *storage_ix + 3;
+    BrotliStoreMetaBlockHeader(block_size, 0, storage_ix, storage);
+    /* No block splits, no contexts. */
+    BrotliWriteBits(13, 0, storage_ix, storage);
+    literal_ratio = BuildAndStoreLiteralPrefixCode(
+        s, input, block_size, lit_depth, lit_bits, storage_ix, storage);
+    BuildAndStoreCommandPrefixCode(s, storage_ix, storage);
+    goto emit_commands;
+  }
+
+  if (!is_last) {
+    /* If this is not the last block, update the command and distance prefix
+       codes for the next block and store the compressed forms. */
+    s->cmd_code[0] = 0;
+    s->cmd_code_numbits = 0;
+    BuildAndStoreCommandPrefixCode(s, &s->cmd_code_numbits, s->cmd_code);
+  }
+}
+
+#define FOR_TABLE_BITS_(X) X(9) X(11) X(13) X(15)
+
+#define BAKE_METHOD_PARAM_(B) \
+static BROTLI_NOINLINE void BrotliCompressFragmentFastImpl ## B(             \
+    BrotliOnePassArena* s, const uint8_t* input, size_t input_size,          \
+    BROTLI_BOOL is_last, int* table, size_t* storage_ix, uint8_t* storage) { \
+  BrotliCompressFragmentFastImpl(s, input, input_size, is_last, table, B,    \
+      storage_ix, storage);                                                  \
+}
+FOR_TABLE_BITS_(BAKE_METHOD_PARAM_)
+#undef BAKE_METHOD_PARAM_
+
+void BrotliCompressFragmentFast(
+    BrotliOnePassArena* s, const uint8_t* input, size_t input_size,
+    BROTLI_BOOL is_last, int* table, size_t table_size,
+    size_t* storage_ix, uint8_t* storage) {
+  const size_t initial_storage_ix = *storage_ix;
+  const size_t table_bits = Log2FloorNonZero(table_size);
+
+  if (input_size == 0) {
+    BROTLI_DCHECK(is_last);
+    BrotliWriteBits(1, 1, storage_ix, storage);  /* islast */
+    BrotliWriteBits(1, 1, storage_ix, storage);  /* isempty */
+    *storage_ix = (*storage_ix + 7u) & ~7u;
+    return;
+  }
+
+  switch (table_bits) {
+#define CASE_(B)                                                     \
+    case B:                                                          \
+      BrotliCompressFragmentFastImpl ## B(                           \
+          s, input, input_size, is_last, table, storage_ix, storage);\
+      break;
+    FOR_TABLE_BITS_(CASE_)
+#undef CASE_
+    default: BROTLI_DCHECK(0); break;
+  }
+
+  /* If output is larger than single uncompressed block, rewrite it. */
+  if (*storage_ix - initial_storage_ix > 31 + (input_size << 3)) {
+    EmitUncompressedMetaBlock(input, input + input_size, initial_storage_ix,
+                              storage_ix, storage);
+  }
+
+  if (is_last) {
+    BrotliWriteBits(1, 1, storage_ix, storage);  /* islast */
+    BrotliWriteBits(1, 1, storage_ix, storage);  /* isempty */
+    *storage_ix = (*storage_ix + 7u) & ~7u;
+  }
+}
+
+#undef FOR_TABLE_BITS_
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment.h
new file mode 100644
index 0000000000..9c0780f8c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment.h
@@ -0,0 +1,86 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Function for fast encoding of an input fragment, independently from the input
+   history. This function uses one-pass processing: when we find a backward
+   match, we immediately emit the corresponding command and literal codes to
+   the bit stream. */
+
+#ifndef BROTLI_ENC_COMPRESS_FRAGMENT_H_
+#define BROTLI_ENC_COMPRESS_FRAGMENT_H_
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+#include "entropy_encode.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+typedef struct BrotliOnePassArena {
+  uint8_t lit_depth[256];
+  uint16_t lit_bits[256];
+
+  /* Command and distance prefix codes (each 64 symbols, stored back-to-back)
+     used for the next block. The command prefix code is over a smaller alphabet
+     with the following 64 symbols:
+        0 - 15: insert length code 0, copy length code 0 - 15, same distance
+       16 - 39: insert length code 0, copy length code 0 - 23
+       40 - 63: insert length code 0 - 23, copy length code 0
+     Note that symbols 16 and 40 represent the same code in the full alphabet,
+     but we do not use either of them. */
+  uint8_t cmd_depth[128];
+  uint16_t cmd_bits[128];
+  uint32_t cmd_histo[128];
+
+  /* The compressed form of the command and distance prefix codes for the next
+     block. */
+  uint8_t cmd_code[512];
+  size_t cmd_code_numbits;
+
+  HuffmanTree tree[2 * BROTLI_NUM_LITERAL_SYMBOLS + 1];
+  uint32_t histogram[256];
+  uint8_t tmp_depth[BROTLI_NUM_COMMAND_SYMBOLS];
+  uint16_t tmp_bits[64];
+} BrotliOnePassArena;
+
+/* Compresses "input" string to the "*storage" buffer as one or more complete
+   meta-blocks, and updates the "*storage_ix" bit position.
+
+   If "is_last" is 1, emits an additional empty last meta-block.
+
+   "cmd_depth" and "cmd_bits" contain the command and distance prefix codes
+   (see comment in encode.h) used for the encoding of this input fragment.
+   If "is_last" is 0, they are updated to reflect the statistics
+   of this input fragment, to be used for the encoding of the next fragment.
+
+   "*cmd_code_numbits" is the number of bits of the compressed representation
+   of the command and distance prefix codes, and "cmd_code" is an array of
+   at least "(*cmd_code_numbits + 7) >> 3" size that contains the compressed
+   command and distance prefix codes. If "is_last" is 0, these are also
+   updated to represent the updated "cmd_depth" and "cmd_bits".
+
+   REQUIRES: "input_size" is greater than zero, or "is_last" is 1.
+   REQUIRES: "input_size" is less or equal to maximal metablock size (1 << 24).
+   REQUIRES: All elements in "table[0..table_size-1]" are initialized to zero.
+   REQUIRES: "table_size" is an odd (9, 11, 13, 15) power of two
+   OUTPUT: maximal copy distance <= |input_size|
+   OUTPUT: maximal copy distance <= BROTLI_MAX_BACKWARD_LIMIT(18) */
+BROTLI_INTERNAL void BrotliCompressFragmentFast(BrotliOnePassArena* s,
+                                                const uint8_t* input,
+                                                size_t input_size,
+                                                BROTLI_BOOL is_last,
+                                                int* table, size_t table_size,
+                                                size_t* storage_ix,
+                                                uint8_t* storage);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_COMPRESS_FRAGMENT_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment_two_pass.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment_two_pass.c
new file mode 100644
index 0000000000..a762679c1f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment_two_pass.c
@@ -0,0 +1,657 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Function for fast encoding of an input fragment, independently from the input
+   history. This function uses two-pass processing: in the first pass we save
+   the found backward matches and literal bytes into a buffer, and in the
+   second pass we emit them into the bit stream using prefix codes built based
+   on the actual command and literal byte histograms. */
+
+#include "compress_fragment_two_pass.h"
+
+#include <string.h>  /* memcmp, memcpy, memset */
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+#include "bit_cost.h"
+#include "brotli_bit_stream.h"
+#include "entropy_encode.h"
+#include "fast_log.h"
+#include "find_match_length.h"
+#include "write_bits.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define MAX_DISTANCE (long)BROTLI_MAX_BACKWARD_LIMIT(18)
+
+/* kHashMul32 multiplier has these properties:
+   * The multiplier must be odd. Otherwise we may lose the highest bit.
+   * No long streaks of ones or zeros.
+   * There is no effort to ensure that it is a prime, the oddity is enough
+     for this use.
+   * The number has been tuned heuristically against compression benchmarks. */
+static const uint32_t kHashMul32 = 0x1E35A7BD;
+
+static BROTLI_INLINE uint32_t Hash(const uint8_t* p,
+    size_t shift, size_t length) {
+  const uint64_t h =
+      (BROTLI_UNALIGNED_LOAD64LE(p) << ((8 - length) * 8)) * kHashMul32;
+  return (uint32_t)(h >> shift);
+}
+
+static BROTLI_INLINE uint32_t HashBytesAtOffset(uint64_t v, size_t offset,
+    size_t shift, size_t length) {
+  BROTLI_DCHECK(offset <= 8 - length);
+  {
+    const uint64_t h = ((v >> (8 * offset)) << ((8 - length) * 8)) * kHashMul32;
+    return (uint32_t)(h >> shift);
+  }
+}
+
+static BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2,
+    size_t length) {
+  if (BrotliUnalignedRead32(p1) == BrotliUnalignedRead32(p2)) {
+    if (length == 4) return BROTLI_TRUE;
+    return TO_BROTLI_BOOL(p1[4] == p2[4] && p1[5] == p2[5]);
+  }
+  return BROTLI_FALSE;
+}
+
+/* Builds a command and distance prefix code (each 64 symbols) into "depth" and
+   "bits" based on "histogram" and stores it into the bit stream. */
+static void BuildAndStoreCommandPrefixCode(BrotliTwoPassArena* s,
+                                           size_t* storage_ix,
+                                           uint8_t* storage) {
+  /* Tree size for building a tree over 64 symbols is 2 * 64 + 1. */
+  /* TODO(eustas): initialize once. */
+  memset(s->tmp_depth, 0, sizeof(s->tmp_depth));
+  BrotliCreateHuffmanTree(s->cmd_histo, 64, 15, s->tmp_tree, s->cmd_depth);
+  BrotliCreateHuffmanTree(&s->cmd_histo[64], 64, 14, s->tmp_tree,
+                          &s->cmd_depth[64]);
+  /* We have to jump through a few hoops here in order to compute
+     the command bits because the symbols are in a different order than in
+     the full alphabet. This looks complicated, but having the symbols
+     in this order in the command bits saves a few branches in the Emit*
+     functions. */
+  memcpy(s->tmp_depth, s->cmd_depth + 24, 24);
+  memcpy(s->tmp_depth + 24, s->cmd_depth, 8);
+  memcpy(s->tmp_depth + 32, s->cmd_depth + 48, 8);
+  memcpy(s->tmp_depth + 40, s->cmd_depth + 8, 8);
+  memcpy(s->tmp_depth + 48, s->cmd_depth + 56, 8);
+  memcpy(s->tmp_depth + 56, s->cmd_depth + 16, 8);
+  BrotliConvertBitDepthsToSymbols(s->tmp_depth, 64, s->tmp_bits);
+  memcpy(s->cmd_bits, s->tmp_bits + 24, 16);
+  memcpy(s->cmd_bits + 8, s->tmp_bits + 40, 16);
+  memcpy(s->cmd_bits + 16, s->tmp_bits + 56, 16);
+  memcpy(s->cmd_bits + 24, s->tmp_bits, 48);
+  memcpy(s->cmd_bits + 48, s->tmp_bits + 32, 16);
+  memcpy(s->cmd_bits + 56, s->tmp_bits + 48, 16);
+  BrotliConvertBitDepthsToSymbols(&s->cmd_depth[64], 64, &s->cmd_bits[64]);
+  {
+    /* Create the bit length array for the full command alphabet. */
+    size_t i;
+    memset(s->tmp_depth, 0, 64); /* only 64 first values were used */
+    memcpy(s->tmp_depth, s->cmd_depth + 24, 8);
+    memcpy(s->tmp_depth + 64, s->cmd_depth + 32, 8);
+    memcpy(s->tmp_depth + 128, s->cmd_depth + 40, 8);
+    memcpy(s->tmp_depth + 192, s->cmd_depth + 48, 8);
+    memcpy(s->tmp_depth + 384, s->cmd_depth + 56, 8);
+    for (i = 0; i < 8; ++i) {
+      s->tmp_depth[128 + 8 * i] = s->cmd_depth[i];
+      s->tmp_depth[256 + 8 * i] = s->cmd_depth[8 + i];
+      s->tmp_depth[448 + 8 * i] = s->cmd_depth[16 + i];
+    }
+    BrotliStoreHuffmanTree(s->tmp_depth, BROTLI_NUM_COMMAND_SYMBOLS,
+                           s->tmp_tree, storage_ix, storage);
+  }
+  BrotliStoreHuffmanTree(&s->cmd_depth[64], 64, s->tmp_tree, storage_ix,
+                         storage);
+}
+
+static BROTLI_INLINE void EmitInsertLen(
+    uint32_t insertlen, uint32_t** commands) {
+  if (insertlen < 6) {
+    **commands = insertlen;
+  } else if (insertlen < 130) {
+    const uint32_t tail = insertlen - 2;
+    const uint32_t nbits = Log2FloorNonZero(tail) - 1u;
+    const uint32_t prefix = tail >> nbits;
+    const uint32_t inscode = (nbits << 1) + prefix + 2;
+    const uint32_t extra = tail - (prefix << nbits);
+    **commands = inscode | (extra << 8);
+  } else if (insertlen < 2114) {
+    const uint32_t tail = insertlen - 66;
+    const uint32_t nbits = Log2FloorNonZero(tail);
+    const uint32_t code = nbits + 10;
+    const uint32_t extra = tail - (1u << nbits);
+    **commands = code | (extra << 8);
+  } else if (insertlen < 6210) {
+    const uint32_t extra = insertlen - 2114;
+    **commands = 21 | (extra << 8);
+  } else if (insertlen < 22594) {
+    const uint32_t extra = insertlen - 6210;
+    **commands = 22 | (extra << 8);
+  } else {
+    const uint32_t extra = insertlen - 22594;
+    **commands = 23 | (extra << 8);
+  }
+  ++(*commands);
+}
+
+static BROTLI_INLINE void EmitCopyLen(size_t copylen, uint32_t** commands) {
+  if (copylen < 10) {
+    **commands = (uint32_t)(copylen + 38);
+  } else if (copylen < 134) {
+    const size_t tail = copylen - 6;
+    const size_t nbits = Log2FloorNonZero(tail) - 1;
+    const size_t prefix = tail >> nbits;
+    const size_t code = (nbits << 1) + prefix + 44;
+    const size_t extra = tail - (prefix << nbits);
+    **commands = (uint32_t)(code | (extra << 8));
+  } else if (copylen < 2118) {
+    const size_t tail = copylen - 70;
+    const size_t nbits = Log2FloorNonZero(tail);
+    const size_t code = nbits + 52;
+    const size_t extra = tail - ((size_t)1 << nbits);
+    **commands = (uint32_t)(code | (extra << 8));
+  } else {
+    const size_t extra = copylen - 2118;
+    **commands = (uint32_t)(63 | (extra << 8));
+  }
+  ++(*commands);
+}
+
+static BROTLI_INLINE void EmitCopyLenLastDistance(
+    size_t copylen, uint32_t** commands) {
+  if (copylen < 12) {
+    **commands = (uint32_t)(copylen + 20);
+    ++(*commands);
+  } else if (copylen < 72) {
+    const size_t tail = copylen - 8;
+    const size_t nbits = Log2FloorNonZero(tail) - 1;
+    const size_t prefix = tail >> nbits;
+    const size_t code = (nbits << 1) + prefix + 28;
+    const size_t extra = tail - (prefix << nbits);
+    **commands = (uint32_t)(code | (extra << 8));
+    ++(*commands);
+  } else if (copylen < 136) {
+    const size_t tail = copylen - 8;
+    const size_t code = (tail >> 5) + 54;
+    const size_t extra = tail & 31;
+    **commands = (uint32_t)(code | (extra << 8));
+    ++(*commands);
+    **commands = 64;
+    ++(*commands);
+  } else if (copylen < 2120) {
+    const size_t tail = copylen - 72;
+    const size_t nbits = Log2FloorNonZero(tail);
+    const size_t code = nbits + 52;
+    const size_t extra = tail - ((size_t)1 << nbits);
+    **commands = (uint32_t)(code | (extra << 8));
+    ++(*commands);
+    **commands = 64;
+    ++(*commands);
+  } else {
+    const size_t extra = copylen - 2120;
+    **commands = (uint32_t)(63 | (extra << 8));
+    ++(*commands);
+    **commands = 64;
+    ++(*commands);
+  }
+}
+
+static BROTLI_INLINE void EmitDistance(uint32_t distance, uint32_t** commands) {
+  uint32_t d = distance + 3;
+  uint32_t nbits = Log2FloorNonZero(d) - 1;
+  const uint32_t prefix = (d >> nbits) & 1;
+  const uint32_t offset = (2 + prefix) << nbits;
+  const uint32_t distcode = 2 * (nbits - 1) + prefix + 80;
+  uint32_t extra = d - offset;
+  **commands = distcode | (extra << 8);
+  ++(*commands);
+}
+
+/* REQUIRES: len <= 1 << 24. */
+static void BrotliStoreMetaBlockHeader(
+    size_t len, BROTLI_BOOL is_uncompressed, size_t* storage_ix,
+    uint8_t* storage) {
+  size_t nibbles = 6;
+  /* ISLAST */
+  BrotliWriteBits(1, 0, storage_ix, storage);
+  if (len <= (1U << 16)) {
+    nibbles = 4;
+  } else if (len <= (1U << 20)) {
+    nibbles = 5;
+  }
+  BrotliWriteBits(2, nibbles - 4, storage_ix, storage);
+  BrotliWriteBits(nibbles * 4, len - 1, storage_ix, storage);
+  /* ISUNCOMPRESSED */
+  BrotliWriteBits(1, (uint64_t)is_uncompressed, storage_ix, storage);
+}
+
+static BROTLI_INLINE void CreateCommands(const uint8_t* input,
+    size_t block_size, size_t input_size, const uint8_t* base_ip, int* table,
+    size_t table_bits, size_t min_match,
+    uint8_t** literals, uint32_t** commands) {
+  /* "ip" is the input pointer. */
+  const uint8_t* ip = input;
+  const size_t shift = 64u - table_bits;
+  const uint8_t* ip_end = input + block_size;
+  /* "next_emit" is a pointer to the first byte that is not covered by a
+     previous copy. Bytes between "next_emit" and the start of the next copy or
+     the end of the input will be emitted as literal bytes. */
+  const uint8_t* next_emit = input;
+
+  int last_distance = -1;
+  const size_t kInputMarginBytes = BROTLI_WINDOW_GAP;
+
+  if (BROTLI_PREDICT_TRUE(block_size >= kInputMarginBytes)) {
+    /* For the last block, we need to keep a 16 bytes margin so that we can be
+       sure that all distances are at most window size - 16.
+       For all other blocks, we only need to keep a margin of 5 bytes so that
+       we don't go over the block size with a copy. */
+    const size_t len_limit = BROTLI_MIN(size_t, block_size - min_match,
+                                        input_size - kInputMarginBytes);
+    const uint8_t* ip_limit = input + len_limit;
+
+    uint32_t next_hash;
+    for (next_hash = Hash(++ip, shift, min_match); ; ) {
+      /* Step 1: Scan forward in the input looking for a 6-byte-long match.
+         If we get close to exhausting the input then goto emit_remainder.
+
+         Heuristic match skipping: If 32 bytes are scanned with no matches
+         found, start looking only at every other byte. If 32 more bytes are
+         scanned, look at every third byte, etc.. When a match is found,
+         immediately go back to looking at every byte. This is a small loss
+         (~5% performance, ~0.1% density) for compressible data due to more
+         bookkeeping, but for non-compressible data (such as JPEG) it's a huge
+         win since the compressor quickly "realizes" the data is incompressible
+         and doesn't bother looking for matches everywhere.
+
+         The "skip" variable keeps track of how many bytes there are since the
+         last match; dividing it by 32 (ie. right-shifting by five) gives the
+         number of bytes to move ahead for each iteration. */
+      uint32_t skip = 32;
+
+      const uint8_t* next_ip = ip;
+      const uint8_t* candidate;
+
+      BROTLI_DCHECK(next_emit < ip);
+trawl:
+      do {
+        uint32_t hash = next_hash;
+        uint32_t bytes_between_hash_lookups = skip++ >> 5;
+        ip = next_ip;
+        BROTLI_DCHECK(hash == Hash(ip, shift, min_match));
+        next_ip = ip + bytes_between_hash_lookups;
+        if (BROTLI_PREDICT_FALSE(next_ip > ip_limit)) {
+          goto emit_remainder;
+        }
+        next_hash = Hash(next_ip, shift, min_match);
+        candidate = ip - last_distance;
+        if (IsMatch(ip, candidate, min_match)) {
+          if (BROTLI_PREDICT_TRUE(candidate < ip)) {
+            table[hash] = (int)(ip - base_ip);
+            break;
+          }
+        }
+        candidate = base_ip + table[hash];
+        BROTLI_DCHECK(candidate >= base_ip);
+        BROTLI_DCHECK(candidate < ip);
+
+        table[hash] = (int)(ip - base_ip);
+      } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match)));
+
+      /* Check copy distance. If candidate is not feasible, continue search.
+         Checking is done outside of hot loop to reduce overhead. */
+      if (ip - candidate > MAX_DISTANCE) goto trawl;
+
+      /* Step 2: Emit the found match together with the literal bytes from
+         "next_emit", and then see if we can find a next match immediately
+         afterwards. Repeat until we find no match for the input
+         without emitting some literal bytes. */
+
+      {
+        /* We have a 6-byte match at ip, and we need to emit bytes in
+           [next_emit, ip). */
+        const uint8_t* base = ip;
+        size_t matched = min_match + FindMatchLengthWithLimit(
+            candidate + min_match, ip + min_match,
+            (size_t)(ip_end - ip) - min_match);
+        int distance = (int)(base - candidate);  /* > 0 */
+        int insert = (int)(base - next_emit);
+        ip += matched;
+        BROTLI_DCHECK(0 == memcmp(base, candidate, matched));
+        EmitInsertLen((uint32_t)insert, commands);
+        BROTLI_LOG(("[CompressFragment] pos = %d insert = %d copy = %d\n",
+                    (int)(next_emit - base_ip), insert, 2));
+        memcpy(*literals, next_emit, (size_t)insert);
+        *literals += insert;
+        if (distance == last_distance) {
+          **commands = 64;
+          ++(*commands);
+        } else {
+          EmitDistance((uint32_t)distance, commands);
+          last_distance = distance;
+        }
+        EmitCopyLenLastDistance(matched, commands);
+        BROTLI_LOG(("[CompressFragment] pos = %d distance = %d\n"
+                    "[CompressFragment] pos = %d insert = %d copy = %d\n"
+                    "[CompressFragment] pos = %d distance = %d\n",
+                    (int)(base - base_ip), (int)distance,
+                    (int)(base - base_ip) + 2, 0, (int)matched - 2,
+                    (int)(base - base_ip) + 2, (int)distance));
+
+        next_emit = ip;
+        if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {
+          goto emit_remainder;
+        }
+        {
+          /* We could immediately start working at ip now, but to improve
+             compression we first update "table" with the hashes of some
+             positions within the last copy. */
+          uint64_t input_bytes;
+          uint32_t cur_hash;
+          uint32_t prev_hash;
+          if (min_match == 4) {
+            input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);
+            cur_hash = HashBytesAtOffset(input_bytes, 3, shift, min_match);
+            prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 3);
+            prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 2);
+            prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 1);
+          } else {
+            input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 5);
+            prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 5);
+            prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 4);
+            prev_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 3);
+            input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 2);
+            cur_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);
+            prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 2);
+            prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 1);
+          }
+
+          candidate = base_ip + table[cur_hash];
+          table[cur_hash] = (int)(ip - base_ip);
+        }
+      }
+
+      while (ip - candidate <= MAX_DISTANCE &&
+          IsMatch(ip, candidate, min_match)) {
+        /* We have a 6-byte match at ip, and no need to emit any
+           literal bytes prior to ip. */
+        const uint8_t* base = ip;
+        size_t matched = min_match + FindMatchLengthWithLimit(
+            candidate + min_match, ip + min_match,
+            (size_t)(ip_end - ip) - min_match);
+        ip += matched;
+        last_distance = (int)(base - candidate);  /* > 0 */
+        BROTLI_DCHECK(0 == memcmp(base, candidate, matched));
+        EmitCopyLen(matched, commands);
+        EmitDistance((uint32_t)last_distance, commands);
+        BROTLI_LOG(("[CompressFragment] pos = %d insert = %d copy = %d\n"
+                    "[CompressFragment] pos = %d distance = %d\n",
+                    (int)(base - base_ip), 0, (int)matched,
+                    (int)(base - base_ip), (int)last_distance));
+
+        next_emit = ip;
+        if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {
+          goto emit_remainder;
+        }
+        {
+          /* We could immediately start working at ip now, but to improve
+             compression we first update "table" with the hashes of some
+             positions within the last copy. */
+          uint64_t input_bytes;
+          uint32_t cur_hash;
+          uint32_t prev_hash;
+          if (min_match == 4) {
+            input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);
+            cur_hash = HashBytesAtOffset(input_bytes, 3, shift, min_match);
+            prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 3);
+            prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 2);
+            prev_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 1);
+          } else {
+            input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 5);
+            prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 5);
+            prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 4);
+            prev_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 3);
+            input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 2);
+            cur_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);
+            prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 2);
+            prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);
+            table[prev_hash] = (int)(ip - base_ip - 1);
+          }
+
+          candidate = base_ip + table[cur_hash];
+          table[cur_hash] = (int)(ip - base_ip);
+        }
+      }
+
+      next_hash = Hash(++ip, shift, min_match);
+    }
+  }
+
+emit_remainder:
+  BROTLI_DCHECK(next_emit <= ip_end);
+  /* Emit the remaining bytes as literals. */
+  if (next_emit < ip_end) {
+    const uint32_t insert = (uint32_t)(ip_end - next_emit);
+    EmitInsertLen(insert, commands);
+    BROTLI_LOG(("[CompressFragment] pos = %d insert = %d copy = %d\n",
+                (int)(next_emit - base_ip), insert, 2));
+    memcpy(*literals, next_emit, insert);
+    *literals += insert;
+  }
+}
+
+static void StoreCommands(BrotliTwoPassArena* s,
+                          const uint8_t* literals, const size_t num_literals,
+                          const uint32_t* commands, const size_t num_commands,
+                          size_t* storage_ix, uint8_t* storage) {
+  static const uint32_t kNumExtraBits[128] = {
+      0,  0,  0,  0,  0,  0,  1,  1,  2,  2,  3,  3,  4,  4,  5,  5,
+      6,  7,  8,  9,  10, 12, 14, 24, 0,  0,  0,  0,  0,  0,  0,  0,
+      1,  1,  2,  2,  3,  3,  4,  4,  0,  0,  0,  0,  0,  0,  0,  0,
+      1,  1,  2,  2,  3,  3,  4,  4,  5,  5,  6,  7,  8,  9,  10, 24,
+      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
+      1,  1,  2,  2,  3,  3,  4,  4,  5,  5,  6,  6,  7,  7,  8,  8,
+      9,  9,  10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16,
+      17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24,
+  };
+  static const uint32_t kInsertOffset[24] = {
+      0,  1,  2,  3,  4,   5,   6,   8,   10,   14,   18,   26,
+      34, 50, 66, 98, 130, 194, 322, 578, 1090, 2114, 6210, 22594,
+  };
+
+  size_t i;
+  memset(s->lit_histo, 0, sizeof(s->lit_histo));
+  /* TODO(eustas): is that necessary? */
+  memset(s->cmd_depth, 0, sizeof(s->cmd_depth));
+  /* TODO(eustas): is that necessary? */
+  memset(s->cmd_bits, 0, sizeof(s->cmd_bits));
+  memset(s->cmd_histo, 0, sizeof(s->cmd_histo));
+  for (i = 0; i < num_literals; ++i) {
+    ++s->lit_histo[literals[i]];
+  }
+  BrotliBuildAndStoreHuffmanTreeFast(s->tmp_tree, s->lit_histo, num_literals,
+                                     /* max_bits = */ 8, s->lit_depth,
+                                     s->lit_bits, storage_ix, storage);
+
+  for (i = 0; i < num_commands; ++i) {
+    const uint32_t code = commands[i] & 0xFF;
+    BROTLI_DCHECK(code < 128);
+    ++s->cmd_histo[code];
+  }
+  s->cmd_histo[1] += 1;
+  s->cmd_histo[2] += 1;
+  s->cmd_histo[64] += 1;
+  s->cmd_histo[84] += 1;
+  BuildAndStoreCommandPrefixCode(s, storage_ix, storage);
+
+  for (i = 0; i < num_commands; ++i) {
+    const uint32_t cmd = commands[i];
+    const uint32_t code = cmd & 0xFF;
+    const uint32_t extra = cmd >> 8;
+    BROTLI_DCHECK(code < 128);
+    BrotliWriteBits(s->cmd_depth[code], s->cmd_bits[code], storage_ix, storage);
+    BrotliWriteBits(kNumExtraBits[code], extra, storage_ix, storage);
+    if (code < 24) {
+      const uint32_t insert = kInsertOffset[code] + extra;
+      uint32_t j;
+      for (j = 0; j < insert; ++j) {
+        const uint8_t lit = *literals;
+        BrotliWriteBits(s->lit_depth[lit], s->lit_bits[lit], storage_ix,
+                        storage);
+        ++literals;
+      }
+    }
+  }
+}
+
+/* Acceptable loss for uncompressible speedup is 2% */
+#define MIN_RATIO 0.98
+#define SAMPLE_RATE 43
+
+static BROTLI_BOOL ShouldCompress(BrotliTwoPassArena* s,
+    const uint8_t* input, size_t input_size, size_t num_literals) {
+  double corpus_size = (double)input_size;
+  if ((double)num_literals < MIN_RATIO * corpus_size) {
+    return BROTLI_TRUE;
+  } else {
+    const double max_total_bit_cost = corpus_size * 8 * MIN_RATIO / SAMPLE_RATE;
+    size_t i;
+    memset(s->lit_histo, 0, sizeof(s->lit_histo));
+    for (i = 0; i < input_size; i += SAMPLE_RATE) {
+      ++s->lit_histo[input[i]];
+    }
+    return TO_BROTLI_BOOL(BitsEntropy(s->lit_histo, 256) < max_total_bit_cost);
+  }
+}
+
+static void RewindBitPosition(const size_t new_storage_ix,
+                              size_t* storage_ix, uint8_t* storage) {
+  const size_t bitpos = new_storage_ix & 7;
+  const size_t mask = (1u << bitpos) - 1;
+  storage[new_storage_ix >> 3] &= (uint8_t)mask;
+  *storage_ix = new_storage_ix;
+}
+
+static void EmitUncompressedMetaBlock(const uint8_t* input, size_t input_size,
+                                      size_t* storage_ix, uint8_t* storage) {
+  BrotliStoreMetaBlockHeader(input_size, 1, storage_ix, storage);
+  *storage_ix = (*storage_ix + 7u) & ~7u;
+  memcpy(&storage[*storage_ix >> 3], input, input_size);
+  *storage_ix += input_size << 3;
+  storage[*storage_ix >> 3] = 0;
+}
+
+static BROTLI_INLINE void BrotliCompressFragmentTwoPassImpl(
+    BrotliTwoPassArena* s, const uint8_t* input, size_t input_size,
+    BROTLI_BOOL is_last, uint32_t* command_buf, uint8_t* literal_buf,
+    int* table, size_t table_bits, size_t min_match,
+    size_t* storage_ix, uint8_t* storage) {
+  /* Save the start of the first block for position and distance computations.
+  */
+  const uint8_t* base_ip = input;
+  BROTLI_UNUSED(is_last);
+
+  while (input_size > 0) {
+    size_t block_size =
+        BROTLI_MIN(size_t, input_size, kCompressFragmentTwoPassBlockSize);
+    uint32_t* commands = command_buf;
+    uint8_t* literals = literal_buf;
+    size_t num_literals;
+    CreateCommands(input, block_size, input_size, base_ip, table,
+                   table_bits, min_match, &literals, &commands);
+    num_literals = (size_t)(literals - literal_buf);
+    if (ShouldCompress(s, input, block_size, num_literals)) {
+      const size_t num_commands = (size_t)(commands - command_buf);
+      BrotliStoreMetaBlockHeader(block_size, 0, storage_ix, storage);
+      /* No block splits, no contexts. */
+      BrotliWriteBits(13, 0, storage_ix, storage);
+      StoreCommands(s, literal_buf, num_literals, command_buf, num_commands,
+                    storage_ix, storage);
+    } else {
+      /* Since we did not find many backward references and the entropy of
+         the data is close to 8 bits, we can simply emit an uncompressed block.
+         This makes compression speed of uncompressible data about 3x faster. */
+      EmitUncompressedMetaBlock(input, block_size, storage_ix, storage);
+    }
+    input += block_size;
+    input_size -= block_size;
+  }
+}
+
+#define FOR_TABLE_BITS_(X) \
+  X(8) X(9) X(10) X(11) X(12) X(13) X(14) X(15) X(16) X(17)
+
+#define BAKE_METHOD_PARAM_(B)                                                  \
+static BROTLI_NOINLINE void BrotliCompressFragmentTwoPassImpl ## B(            \
+    BrotliTwoPassArena* s, const uint8_t* input, size_t input_size,            \
+    BROTLI_BOOL is_last, uint32_t* command_buf, uint8_t* literal_buf,          \
+    int* table, size_t* storage_ix, uint8_t* storage) {                        \
+  size_t min_match = (B <= 15) ? 4 : 6;                                        \
+  BrotliCompressFragmentTwoPassImpl(s, input, input_size, is_last, command_buf,\
+      literal_buf, table, B, min_match, storage_ix, storage);                  \
+}
+FOR_TABLE_BITS_(BAKE_METHOD_PARAM_)
+#undef BAKE_METHOD_PARAM_
+
+void BrotliCompressFragmentTwoPass(
+    BrotliTwoPassArena* s, const uint8_t* input, size_t input_size,
+    BROTLI_BOOL is_last, uint32_t* command_buf, uint8_t* literal_buf,
+    int* table, size_t table_size, size_t* storage_ix, uint8_t* storage) {
+  const size_t initial_storage_ix = *storage_ix;
+  const size_t table_bits = Log2FloorNonZero(table_size);
+  switch (table_bits) {
+#define CASE_(B)                                      \
+    case B:                                           \
+      BrotliCompressFragmentTwoPassImpl ## B(         \
+          s, input, input_size, is_last, command_buf, \
+          literal_buf, table, storage_ix, storage);   \
+      break;
+    FOR_TABLE_BITS_(CASE_)
+#undef CASE_
+    default: BROTLI_DCHECK(0); break;
+  }
+
+  /* If output is larger than single uncompressed block, rewrite it. */
+  if (*storage_ix - initial_storage_ix > 31 + (input_size << 3)) {
+    RewindBitPosition(initial_storage_ix, storage_ix, storage);
+    EmitUncompressedMetaBlock(input, input_size, storage_ix, storage);
+  }
+
+  if (is_last) {
+    BrotliWriteBits(1, 1, storage_ix, storage);  /* islast */
+    BrotliWriteBits(1, 1, storage_ix, storage);  /* isempty */
+    *storage_ix = (*storage_ix + 7u) & ~7u;
+  }
+}
+
+#undef FOR_TABLE_BITS_
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment_two_pass.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment_two_pass.h
new file mode 100644
index 0000000000..6d28d9bb78
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/compress_fragment_two_pass.h
@@ -0,0 +1,72 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Function for fast encoding of an input fragment, independently from the input
+   history. This function uses two-pass processing: in the first pass we save
+   the found backward matches and literal bytes into a buffer, and in the
+   second pass we emit them into the bit stream using prefix codes built based
+   on the actual command and literal byte histograms. */
+
+#ifndef BROTLI_ENC_COMPRESS_FRAGMENT_TWO_PASS_H_
+#define BROTLI_ENC_COMPRESS_FRAGMENT_TWO_PASS_H_
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+#include "entropy_encode.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* TODO(eustas): turn to macro. */
+static const size_t kCompressFragmentTwoPassBlockSize = 1 << 17;
+
+typedef struct BrotliTwoPassArena {
+  uint32_t lit_histo[256];
+  uint8_t lit_depth[256];
+  uint16_t lit_bits[256];
+
+  uint32_t cmd_histo[128];
+  uint8_t cmd_depth[128];
+  uint16_t cmd_bits[128];
+
+  /* BuildAndStoreCommandPrefixCode */
+  HuffmanTree tmp_tree[2 * BROTLI_NUM_LITERAL_SYMBOLS + 1];
+  uint8_t tmp_depth[BROTLI_NUM_COMMAND_SYMBOLS];
+  uint16_t tmp_bits[64];
+} BrotliTwoPassArena;
+
+/* Compresses "input" string to the "*storage" buffer as one or more complete
+   meta-blocks, and updates the "*storage_ix" bit position.
+
+   If "is_last" is 1, emits an additional empty last meta-block.
+
+   REQUIRES: "input_size" is greater than zero, or "is_last" is 1.
+   REQUIRES: "input_size" is less or equal to maximal metablock size (1 << 24).
+   REQUIRES: "command_buf" and "literal_buf" point to at least
+              kCompressFragmentTwoPassBlockSize long arrays.
+   REQUIRES: All elements in "table[0..table_size-1]" are initialized to zero.
+   REQUIRES: "table_size" is a power of two
+   OUTPUT: maximal copy distance <= |input_size|
+   OUTPUT: maximal copy distance <= BROTLI_MAX_BACKWARD_LIMIT(18) */
+BROTLI_INTERNAL void BrotliCompressFragmentTwoPass(BrotliTwoPassArena* s,
+                                                   const uint8_t* input,
+                                                   size_t input_size,
+                                                   BROTLI_BOOL is_last,
+                                                   uint32_t* command_buf,
+                                                   uint8_t* literal_buf,
+                                                   int* table,
+                                                   size_t table_size,
+                                                   size_t* storage_ix,
+                                                   uint8_t* storage);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_COMPRESS_FRAGMENT_TWO_PASS_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/dictionary_hash.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/dictionary_hash.c
new file mode 100644
index 0000000000..1a60eb3cda
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/dictionary_hash.c
@@ -0,0 +1,1848 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Hash table on the 4-byte prefixes of static dictionary words. */
+
+#include "../common/platform.h"
+#include "dictionary_hash.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* GENERATED CODE START */
+BROTLI_INTERNAL const uint16_t kStaticDictionaryHashWords[32768] = {
+1002,0,0,0,0,0,0,0,0,683,0,0,0,0,0,0,0,1265,0,0,0,0,0,1431,0,0,0,0,0,0,40,0,0,0,
+0,155,8,741,0,624,0,0,0,0,0,0,0,0,0,0,0,0,66,503,0,0,0,451,0,0,0,0,0,0,0,835,70,
+0,0,539,0,0,0,0,0,0,0,0,0,113,0,0,0,0,718,0,0,0,0,0,0,520,0,1070,0,0,0,0,0,1515,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,78,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,610,0,0,750,0,0,0,307,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,964,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,999,0,0,0,0,0,0,0,0,
+645,75,0,649,52,282,0,200,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1621,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,211,225,0,0,687,718,0,0,110,0,58,0,0,0,0,0,0,345,0,0,301,0,0,
+0,203,0,0,1154,674,1949,0,0,0,0,0,0,0,0,0,259,0,0,0,0,0,0,0,1275,0,0,0,1231,254,
+0,0,0,0,0,0,0,277,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,248,0,0,800,0,0,0,29,
+116,100,490,0,0,0,0,0,1641,0,543,0,0,0,0,41,181,0,657,0,0,202,25,0,0,0,0,0,0,0,
+0,0,0,423,0,0,0,113,0,0,0,927,963,0,976,0,206,0,0,0,0,0,0,0,0,0,2002,0,0,0,0,0,
+0,0,0,0,0,0,696,0,1170,0,0,0,0,226,13,0,769,678,551,0,0,0,0,0,0,57,0,0,0,10,188,
+0,0,0,624,0,0,0,0,0,0,0,0,0,1941,130,0,0,0,0,378,269,0,0,528,0,1146,0,0,0,1105,
+0,1616,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,656,0,1940,0,0,0,0,0,173,0,0,0,0,0,0,0,0,0,
+0,0,457,342,810,0,0,0,0,620,0,0,0,0,0,0,0,967,95,447,406,0,0,0,477,0,1268,944,
+1941,0,0,0,629,0,0,0,0,0,375,0,0,0,1636,0,0,0,0,774,0,1,1034,0,0,0,0,0,824,0,0,
+0,0,0,118,0,0,560,296,0,0,0,0,0,0,0,0,1009,894,0,0,0,0,0,0,0,0,0,0,0,0,0,1474,
+366,0,0,0,0,0,0,0,0,0,79,1723,0,0,200,0,0,0,0,0,0,0,0,1759,372,0,16,0,943,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,258,0,0,900,1839,707,30,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,2004,0,0,10,115,0,50,0,0,0,0,0,0,0,0,0,0,520,1,0,738,98,482,0,0,0,0,
+0,0,0,0,0,0,701,2,0,0,0,0,0,0,0,0,557,0,0,0,0,0,0,0,0,0,347,0,0,0,0,572,0,0,0,0,
+0,0,0,0,0,832,0,0,797,809,0,0,0,0,0,0,0,0,0,0,0,528,0,0,0,861,0,0,294,0,0,0,109,
+0,0,0,0,0,0,0,0,1187,290,266,0,0,0,0,49,50,748,0,0,466,399,0,0,0,0,0,0,0,378,0,
+519,0,0,0,0,0,0,0,0,0,0,0,0,667,351,902,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,180,
+0,0,869,0,0,0,0,0,0,0,260,0,0,0,0,0,0,0,0,0,0,523,36,0,0,587,510,809,29,260,0,0,
+0,0,0,0,0,0,570,0,565,0,1464,0,0,0,0,0,0,10,0,0,787,399,380,200,0,0,0,0,516,0,
+844,887,0,0,0,0,0,0,0,44,0,0,0,305,1655,0,0,0,0,0,0,0,0,0,0,0,0,0,0,786,10,0,0,
+0,0,0,0,0,0,0,2031,0,0,0,0,0,684,0,0,0,0,0,1480,0,0,0,27,0,0,0,395,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,813,511,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,56,0,0,0,206,
+496,0,0,0,0,0,909,0,891,0,0,0,0,0,0,0,0,0,687,0,0,0,1342,0,0,0,0,0,0,0,0,0,0,
+160,41,0,0,0,0,0,0,0,0,0,0,0,1718,778,0,0,0,0,0,0,0,0,0,0,1610,0,0,0,0,0,115,0,
+0,0,0,314,294,0,0,0,983,178,193,0,0,0,0,0,0,0,0,0,174,0,0,0,0,0,0,0,0,0,0,848,
+1796,0,0,0,0,0,0,221,0,687,1660,0,0,0,0,262,0,0,179,0,0,0,0,0,66,0,773,0,352,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,35,0,152,0,0,1197,0,0,0,0,0,0,0,0,0,0,0,0,560,0,0,
+564,0,0,0,797,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,556,0,819,0,0,0,0,0,0,0,0,719,544,
+637,5,0,0,0,0,0,0,0,0,0,0,0,101,0,1441,0,0,0,893,0,0,0,0,0,0,0,0,0,238,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,1296,0,0,969,1729,314,60,0,0,0,0,0,1144,0,1147,0,0,0,0,0,
+0,0,0,0,0,437,1853,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,828,0,176,0,0,0,0,0,0,434,39,0,
+0,0,0,0,159,0,0,0,902,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,270,0,0,0,0,801,556,0,0,
+0,0,0,0,0,416,19,197,369,0,0,0,0,0,0,0,0,0,28,34,0,757,0,0,898,1553,0,721,0,0,0,
+0,1012,0,0,0,0,1102,0,898,183,0,0,0,0,0,0,0,136,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,247,277,0,0,0,435,0,0,0,0,0,1311,0,0,0,0,
+0,0,211,437,0,0,0,28,0,0,750,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2012,0,702,
+0,808,0,0,0,0,739,166,0,0,0,0,0,0,719,170,500,0,0,0,0,0,0,0,0,1500,327,0,0,450,
+0,0,0,1318,0,0,0,1602,0,0,331,754,0,0,0,0,0,1368,0,0,557,0,0,0,799,850,0,0,0,0,
+0,0,0,0,908,0,0,0,0,0,19,62,459,0,0,0,0,0,0,0,0,0,0,0,0,1802,0,0,0,0,0,0,0,0,0,
+1397,0,0,0,0,120,238,0,0,0,0,0,0,0,0,0,0,0,1324,0,0,0,0,0,0,0,0,602,201,0,0,164,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,615,0,0,0,0,0,0,0,0,0,0,0,0,0,1243,0,0,0,0,968,0,0,
+0,0,0,0,882,0,0,0,907,329,100,0,0,0,0,0,0,0,0,0,0,0,176,26,9,0,0,265,256,0,0,0,
+0,0,0,0,0,0,643,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,127,610,0,0,0,0,973,2001,0,
+0,0,0,0,0,522,0,0,0,0,0,0,0,0,0,0,0,553,0,0,0,0,0,0,1582,0,1578,0,0,0,0,0,0,0,0,
+0,0,0,795,0,0,0,432,0,0,0,0,0,0,84,126,0,0,0,0,790,0,377,64,0,1529,0,0,0,0,530,
+1857,539,1104,0,0,0,0,0,0,0,0,0,0,0,0,977,0,0,0,34,0,0,0,0,0,0,0,0,0,0,0,24,26,
+0,0,918,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,183,379,0,0,0,0,0,0,0,792,
+0,0,0,0,0,0,0,0,0,1920,0,0,0,0,0,0,0,0,0,771,0,0,0,1979,0,901,254,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,140,0,0,0,0,0,440,37,0,
+508,0,0,0,513,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,533,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,752,920,0,1048,0,153,0,
+0,391,0,0,1952,0,0,0,0,0,0,0,0,0,0,126,0,0,0,0,640,0,483,69,1616,0,0,0,0,0,734,
+0,0,0,0,0,0,480,0,495,0,472,0,0,0,0,0,0,0,0,874,229,0,0,0,0,948,0,0,0,0,0,0,0,0,
+1009,748,0,555,0,0,0,0,0,0,193,0,653,0,0,0,0,0,0,0,0,0,0,984,0,0,0,172,0,0,0,0,
+0,0,0,0,83,1568,0,0,384,0,0,0,0,0,0,0,164,880,0,0,0,0,0,0,0,0,0,0,0,367,121,0,0,
+828,0,0,0,0,0,0,0,1541,0,0,0,0,0,0,0,343,0,0,0,0,0,0,0,0,561,57,0,0,0,0,0,0,0,
+926,0,0,0,0,827,0,194,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,22,0,0,0,0,0,0,0,
+0,0,0,896,1249,0,0,0,0,0,1614,0,0,0,860,0,0,0,0,0,0,0,0,964,102,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,899,0,569,0,0,0,0,795,2045,0,0,0,
+0,0,0,104,52,0,0,0,0,0,604,0,0,0,0,779,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,
+494,0,677,0,0,0,0,0,0,0,508,0,0,0,0,0,0,0,0,0,1014,0,957,0,0,630,310,0,0,0,570,
+0,0,449,0,64,537,0,0,0,0,0,0,0,244,0,0,0,0,0,0,0,0,0,0,0,0,0,0,702,1650,49,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,338,0,0,0,0,1279,0,0,0,0,0,0,0,896,0,0,
+178,0,0,0,0,0,0,0,0,0,0,0,0,0,808,695,0,0,0,0,539,1117,0,0,0,0,0,0,0,0,257,0,
+1003,0,0,0,1,448,0,516,0,0,960,0,125,4,0,1268,30,748,0,0,852,0,0,0,6,0,0,848,
+236,1385,862,1811,0,0,0,0,698,803,0,0,0,0,0,0,0,610,992,0,0,878,0,1847,0,0,0,0,
+0,0,0,383,0,1404,0,0,0,0,986,0,347,0,0,0,0,0,0,0,0,0,0,0,592,572,0,1411,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,606,0,0,0,0,0,0,
+0,0,0,0,0,0,0,1829,0,0,0,0,0,0,0,0,0,0,0,0,700,748,0,0,0,0,0,0,365,0,0,127,0,0,
+83,198,0,0,0,0,0,0,864,55,0,0,0,0,726,1752,0,0,0,0,0,0,0,0,0,0,0,0,0,1066,0,764,
+0,0,0,0,683,0,550,309,0,0,874,1212,0,0,0,1364,0,986,381,723,0,0,0,1573,0,0,0,0,
+0,1025,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1559,0,0,0,0,493,133,0,0,0,0,148,
+119,0,0,0,0,0,0,537,14,541,0,635,126,0,0,0,495,0,0,0,0,861,998,1009,0,0,0,0,0,0,
+0,359,368,0,0,0,0,304,1577,0,0,0,0,0,1107,0,0,0,0,0,929,0,0,0,1142,0,0,0,0,289,
+175,0,432,0,219,0,0,0,0,0,785,0,0,595,0,0,0,0,0,0,0,0,0,0,0,0,0,80,0,0,0,0,0,0,
+931,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1323,0,0,0,0,290,0,559,1751,127,0,0,0,
+934,1167,0,963,0,260,0,0,0,573,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+580,1689,0,0,0,0,0,0,0,0,0,1164,0,0,982,1922,0,63,0,0,0,0,0,793,0,0,0,0,0,0,0,0,
+0,0,0,0,0,67,790,0,0,0,0,0,0,0,0,0,0,391,443,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,271,0,0,0,0,0,0,0,0,0,0,0,1140,0,0,0,0,340,300,0,897,0,0,0,0,0,0,
+0,0,0,0,890,0,0,0,0,818,321,53,0,0,0,0,0,0,0,0,0,468,0,243,0,870,0,0,0,1765,121,
+0,0,0,180,518,0,822,419,634,0,0,0,0,0,0,0,0,0,898,0,0,0,0,454,36,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,806,0,0,0,0,0,0,0,0,0,0,0,0,1326,0,104,0,0,0,0,0,0,0,
+0,0,260,0,0,0,0,0,0,0,0,0,0,0,0,542,45,0,0,263,1516,42,0,0,0,0,0,468,0,1005,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,87,0,0,0,0,0,0,0,0,502,988,133,0,0,0,0,0,0,
+141,0,0,872,1842,0,0,0,0,0,0,0,0,261,619,0,0,0,0,189,246,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,678,0,0,0,0,0,0,0,0,0,0,0,0,285,35,0,517,0,0,0,0,0,0,0,0,0,0,
+540,214,667,0,74,0,0,125,0,0,0,0,0,761,131,0,0,0,0,0,0,0,0,0,0,0,0,0,333,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1338,94,0,0,0,0,0,0,0,0,0,0,0,0,449,0,646,103,
+86,641,2028,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,869,87,277,117,39,0,0,0,0,0,0,0,0,938,
+297,0,0,0,0,558,464,0,0,0,0,0,0,0,0,0,0,731,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1608,0,
+0,0,0,0,0,0,1429,0,0,733,1010,0,0,338,1656,0,0,0,1038,979,2010,0,0,0,0,0,0,0,
+1005,0,0,121,0,0,0,219,20,0,0,0,0,0,0,872,1440,0,0,0,683,0,1070,0,0,522,0,0,0,0,
+439,669,0,0,0,0,0,0,0,0,1245,0,0,0,0,0,1218,0,0,547,233,0,0,0,0,0,0,0,0,0,482,0,
+0,0,0,0,0,0,886,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,795,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,371,0,0,0,0,0,0,0,0,0,0,0,0,0,622,0,625,0,0,0,339,29,0,0,338,0,0,0,
+0,130,0,0,0,0,0,0,0,0,0,307,0,0,0,0,0,0,0,0,0,0,2044,0,0,0,0,0,0,0,0,308,770,0,
+0,0,0,0,1266,0,0,0,0,0,0,0,0,0,400,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,690,739,0,0,
+0,0,0,0,0,990,0,0,0,1831,0,0,0,0,0,0,0,0,0,0,0,0,0,613,0,0,0,0,0,0,0,0,0,0,0,0,
+0,763,0,878,0,0,0,977,0,100,0,0,0,0,0,0,0,0,0,463,0,0,0,0,623,318,0,0,296,463,
+137,0,0,454,0,0,0,1527,58,0,0,0,0,0,0,0,18,48,0,0,0,0,0,729,0,0,0,442,0,0,0,0,
+40,449,0,853,0,0,0,0,0,0,227,0,0,0,0,0,0,1491,0,0,0,0,0,0,0,0,0,0,161,55,0,450,
+0,1174,62,0,207,0,0,0,0,0,0,0,0,869,0,0,0,0,80,213,0,0,0,0,0,0,0,0,0,0,354,820,
+0,0,747,0,0,0,954,0,0,1073,0,556,0,0,0,692,0,191,0,804,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,831,162,0,0,35,0,0,0,0,0,0,0,0,1235,0,0,0,0,0,1234,0,0,
+0,0,0,0,0,0,0,0,96,0,0,0,0,0,0,0,149,0,0,0,902,204,0,0,833,0,287,366,0,0,0,0,0,
+0,992,2020,0,0,0,0,0,0,0,0,0,0,0,356,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,784,0,0,567,
+630,0,0,0,539,0,0,27,0,0,0,0,0,0,0,0,0,0,755,0,0,0,0,0,0,0,0,0,0,0,0,814,0,0,0,
+0,0,0,0,0,0,0,0,0,0,987,0,0,255,761,194,0,1086,0,0,0,0,0,0,1016,0,0,1396,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,562,271,913,0,0,0,0,0,0,0,0,320,153,45,475,0,0,
+0,0,0,0,0,713,0,327,0,0,0,0,0,0,604,552,3,359,0,0,0,0,853,80,0,0,0,0,0,0,0,2016,
+6,887,0,0,0,0,975,0,961,0,0,0,0,0,916,1891,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,100,101,390,708,0,0,0,587,983,512,0,0,0,0,0,0,0,0,0,0,0,645,0,0,0,851,0,0,0,
+0,0,498,140,217,0,0,0,1448,0,0,0,0,0,0,0,0,0,905,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+643,105,0,792,0,0,0,0,0,0,0,0,0,0,0,0,56,0,0,0,0,0,0,0,0,0,0,535,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1748,0,0,0,0,0,754,0,0,0,0,0,0,0,0,0,0,0,0,91,0,0,1565,0,91,792,
+939,3,370,0,0,0,0,95,0,0,0,0,551,7,619,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1150,0,
+0,0,0,0,0,0,0,0,0,0,0,0,671,0,0,0,0,0,888,368,149,0,0,105,1134,0,983,0,0,458,31,
+0,643,0,0,0,312,0,740,0,0,0,1642,0,0,0,0,0,0,0,236,0,0,0,0,0,0,0,59,68,0,0,0,0,
+0,867,795,0,0,0,0,970,1977,0,0,0,0,0,0,0,1148,0,775,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,970,0,0,0,0,0,0,0,0,0,665,71,0,0,0,0,827,0,0,0,0,0,0,0,0,0,
+0,479,0,0,0,0,0,0,0,0,99,607,0,0,0,0,0,0,0,1960,0,0,0,793,0,0,871,41,0,0,241,94,
+0,0,0,0,209,0,0,1497,0,0,0,0,0,0,0,0,0,98,0,0,0,463,0,0,0,0,291,0,0,0,0,0,0,0,0,
+0,0,984,0,0,0,0,0,205,0,0,0,0,0,0,205,42,0,801,0,0,0,0,0,635,0,0,533,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,371,0,1282,0,0,0,825,0,0,0,0,0,0,0,0,0,357,879,467,0,317,0,0,
+0,0,0,0,0,924,0,0,0,0,849,1795,0,0,0,0,895,1799,43,0,0,0,0,0,0,0,0,0,0,1820,0,0,
+0,0,0,0,0,525,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,110,0,493,0,174,417,0,0,
+0,0,0,583,733,0,0,0,0,0,0,481,215,0,0,0,0,477,0,0,0,0,0,0,0,0,308,0,0,0,0,0,0,0,
+0,297,126,0,0,361,1551,0,0,0,0,0,0,871,1807,0,0,0,0,0,1307,0,685,0,0,0,0,0,0,0,
+797,0,858,0,565,0,0,0,0,0,0,0,0,0,0,0,0,434,252,826,0,0,0,0,0,0,791,0,0,0,0,509,
+231,178,601,0,0,0,0,0,0,0,0,43,1591,0,0,0,0,0,1683,0,0,0,0,45,0,0,0,0,0,0,0,0,0,
+0,1120,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,556,494,0,398,0,0,0,1030,0,0,0,0,0,0,
+168,0,0,0,0,0,0,0,0,0,0,973,0,642,0,0,0,0,0,0,0,0,0,1615,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,378,594,0,1093,0,679,112,0,0,0,0,1492,540,1374,714,
+1486,0,0,0,0,825,1511,0,0,0,0,0,0,0,0,0,0,0,0,0,952,0,0,736,143,0,700,0,1540,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1557,0,0,0,860,990,0,0,0,807,0,0,0,0,0,131,
+515,0,646,0,0,0,0,117,728,508,121,0,0,0,0,0,0,357,0,0,0,0,0,0,237,0,0,0,0,0,0,0,
+0,0,1784,0,0,0,0,0,0,0,0,0,0,0,713,348,1536,0,738,0,0,0,0,0,0,0,434,0,0,0,0,0,0,
+366,1877,39,0,0,0,0,0,0,580,0,0,0,0,0,0,0,0,0,0,0,0,0,0,873,0,0,0,0,171,0,625,
+550,107,343,943,0,0,0,0,0,0,0,768,0,0,0,0,0,0,0,799,0,0,0,894,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1673,0,0,0,0,0,0,0,0,0,0,0,1052,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+272,0,441,0,0,3,9,0,0,0,1182,0,1346,0,0,0,0,0,0,0,0,682,0,0,1004,24,0,0,968,0,0,
+0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,185,0,0,0,578,
+474,0,0,0,0,0,0,0,0,0,0,0,0,0,0,113,530,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,556,0,0,0,0,0,0,16,1317,0,0,97,0,0,0,703,0,0,0,0,0,0,0,0,892,0,0,0,1571,0,0,
+426,186,0,1101,0,0,0,0,0,0,0,0,937,585,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,644,291,
+0,0,0,0,749,0,162,0,0,381,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,762,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,628,21,0,0,0,0,0,0,0,0,919,0,0,0,0,0,0,0,0,0,
+633,0,0,0,0,332,0,0,0,0,0,0,0,0,0,1489,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,832,398,0,645,0,0,0,13,0,0,0,0,0,0,0,0,0,0,20,0,800,0,0,0,0,0,0,0,0,0,
+0,0,0,0,1993,0,0,0,0,769,0,0,0,665,0,0,0,0,0,0,0,0,0,0,1426,0,0,0,0,60,0,0,0,
+641,1874,0,644,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1757,0,0,0,0,0,937,0,1652,0,654,0,
+0,0,0,0,0,0,527,0,0,0,0,0,0,0,0,0,0,0,0,0,226,0,0,0,0,0,1486,0,0,0,0,0,0,0,0,0,
+0,0,325,0,0,0,0,0,0,0,1345,0,0,91,0,404,0,0,0,0,0,0,0,0,0,0,0,0,973,0,0,0,0,0,0,
+0,1176,0,549,0,0,0,0,0,0,0,0,0,0,976,0,0,0,0,0,21,0,0,0,0,0,51,0,0,0,0,314,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,198,6,0,1093,0,0,0,0,0,0,0,0,0,
+0,0,0,0,1776,0,0,0,0,0,1528,0,419,0,0,0,0,0,0,0,0,76,138,0,0,0,0,638,29,0,0,0,0,
+0,0,0,1418,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1710,0,0,0,0,0,
+0,0,0,0,0,0,0,532,23,0,0,0,0,0,0,0,862,0,0,946,592,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,70,0,0,0,0,0,0,0,0,0,812,0,0,0,76,0,0,988,0,442,0,0,0,896,0,0,0,0,0,0,
+483,0,0,0,0,1709,0,0,0,0,0,0,119,0,0,0,117,0,309,0,0,0,0,0,596,976,0,0,0,0,0,0,
+0,0,0,0,0,768,0,0,0,0,0,0,0,0,0,518,0,0,0,0,0,0,0,0,0,0,0,0,0,0,863,0,0,0,24,
+145,1020,0,0,1984,0,0,0,0,0,0,0,658,0,0,0,0,0,0,0,0,0,0,106,1827,0,1010,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,582,87,0,0,0,0,0,0,0,267,0,0,0,703,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,496,0,0,0,0,1121,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,249,561,0,0,0,0,0,
+0,0,760,0,0,154,0,0,0,255,0,419,323,0,0,0,0,0,368,0,0,0,0,0,0,0,0,0,0,522,0,0,0,
+0,0,0,0,551,562,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,92,0,0,0,0,
+0,0,0,284,525,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,958,0,0,594,0,0,0,0,0,0,6,479,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,61,0,0,0,0,0,0,0,820,1641,0,1556,0,0,0,0,0,0,0,302,0,0,
+0,0,0,148,0,0,676,0,0,0,0,0,0,1674,0,0,0,0,0,0,178,0,0,0,0,0,0,0,94,389,0,0,0,0,
+91,8,0,0,0,0,0,0,0,0,0,0,112,0,0,0,0,0,0,0,0,0,0,747,0,0,0,0,0,0,0,1746,0,0,0,0,
+0,24,0,1352,158,1530,0,0,718,130,280,1401,0,0,0,0,0,1946,8,0,0,0,0,1607,0,0,0,0,
+0,0,882,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,417,0,0,0,1597,633,433,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,234,0,0,0,0,0,0,0,0,680,1950,0,0,0,0,249,5,0,0,0,
+0,0,0,0,0,0,1216,0,1773,0,0,0,0,0,0,0,0,0,0,0,0,0,0,509,180,0,0,0,0,0,0,0,1002,
+0,0,0,0,0,0,0,0,0,0,0,0,0,931,0,0,0,0,0,0,0,0,747,943,0,1837,0,0,0,0,0,0,0,641,
+0,0,0,0,280,0,0,0,5,0,0,0,0,0,72,545,0,0,0,0,0,0,0,0,0,742,0,0,254,151,872,0,0,
+0,0,0,0,0,0,0,0,0,0,921,0,0,517,833,0,1680,0,0,436,251,584,0,0,0,0,0,0,0,0,0,0,
+0,24,500,0,0,0,0,0,0,0,0,195,1775,514,389,0,0,0,0,0,0,0,743,0,0,0,0,0,0,292,0,0,
+0,227,1283,774,1805,0,0,0,0,0,0,0,0,0,0,119,81,0,0,0,0,0,0,0,0,0,0,0,0,0,0,913,
+1910,0,0,0,1826,490,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1162,700,30,
+0,0,0,721,839,0,0,0,617,0,0,0,0,0,0,0,0,0,169,428,0,0,0,0,0,1648,637,1205,0,0,0,
+1596,0,0,4,266,0,0,0,0,0,0,0,0,0,0,0,862,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,
+0,279,157,391,604,0,0,713,945,877,973,0,0,0,0,0,0,0,0,0,0,0,0,0,0,859,567,628,
+1846,0,0,0,0,0,0,0,0,0,762,0,0,191,0,0,0,0,298,0,0,767,909,0,0,0,0,0,0,0,795,0,
+0,301,0,0,1970,0,0,0,0,0,0,0,0,0,1236,0,0,0,0,0,0,644,369,15,0,160,71,0,0,0,0,0,
+1447,0,0,0,0,0,0,0,0,735,1255,76,0,0,0,0,0,0,0,0,0,0,474,0,0,0,0,0,0,0,0,0,0,
+841,0,0,0,0,0,0,0,0,0,0,836,0,0,0,0,0,1622,0,0,735,0,0,0,0,1601,804,1390,394,0,
+0,0,0,0,0,96,0,289,0,0,35,688,0,0,0,667,0,513,0,0,0,0,0,0,0,2034,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,704,0,1524,0,1078,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,306,
+0,0,0,0,0,0,0,431,0,1196,0,0,54,0,15,1448,0,1418,0,0,0,0,0,0,0,0,0,907,0,0,0,0,
+0,0,194,1767,0,0,0,0,0,840,0,900,0,0,0,0,0,0,0,0,0,0,0,1436,0,0,0,0,642,1560,0,
+0,0,0,0,0,94,386,0,0,0,0,0,0,0,0,0,0,830,416,0,0,20,731,0,0,0,0,0,0,0,0,697,0,0,
+662,0,0,0,0,0,0,0,0,0,861,0,0,0,0,0,0,0,871,671,864,0,928,7,0,332,0,0,0,0,1055,
+0,0,0,0,0,0,986,0,0,0,0,0,44,76,0,0,0,0,0,0,0,0,0,0,300,0,0,0,0,0,0,0,175,518,
+831,1108,0,0,0,836,0,1852,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,843,1804,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,246,0,0,0,610,202,0,0,36,0,0,0,240,654,13,0,0,0,0,0,0,0,
+0,391,0,403,0,0,0,0,0,0,0,0,0,0,75,0,366,815,0,0,631,0,0,0,0,0,0,0,0,345,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,952,0,0,0,0,0,0,0,0,0,0,0,673,35,662,0,287,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,5,34,0,0,0,0,0,0,0,0,151,0,427,0,0,382,0,0,0,329,0,0,279,0,0,0,
+0,0,0,0,0,0,0,906,0,0,366,843,0,1443,0,1372,992,0,36,123,0,649,0,0,0,0,0,767,0,
+1018,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,995,0,0,0,0,0,0,0,72,368,0,0,1345,0,0,0,
+589,0,0,0,0,0,0,0,0,0,1988,0,0,220,541,0,0,0,686,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,32,196,0,0,0,0,0,0,0,0,0,0,0,0,0,381,0,0,0,0,0,0,0,0,0,1452,0,
+0,0,616,0,0,0,0,0,0,0,0,0,1229,0,0,0,0,0,0,0,0,0,0,667,120,0,0,0,0,0,0,0,1146,0,
+0,0,0,0,0,0,0,0,0,0,352,0,0,0,0,0,293,0,0,0,0,0,0,0,0,0,0,0,0,0,935,0,1050,0,
+147,88,0,0,923,0,0,0,0,0,934,0,0,0,0,0,0,0,0,114,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,341,222,0,0,0,0,0,0,0,0,0,0,293,0,0,0,0,0,0,0,0,0,0,0,0,
+637,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1159,0,0,0,847,0,0,0,0,0,0,683,0,867,944,0,0,
+0,0,0,1809,0,0,0,0,0,0,0,0,0,0,395,170,0,0,0,0,0,0,0,0,0,0,618,535,0,1625,0,0,0,
+0,0,0,0,0,23,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,778,0,0,0,0,0,46,0,2032,0,0,37,
+1458,0,938,363,34,0,0,0,0,0,0,0,0,0,0,0,0,0,0,314,0,0,0,0,0,0,889,0,0,0,0,0,0,0,
+0,0,0,0,462,0,0,0,0,525,0,0,23,0,0,0,0,0,0,0,0,0,0,0,676,0,0,0,0,0,0,0,0,0,0,0,
+0,498,725,0,0,0,0,7,0,0,0,0,773,0,0,0,164,0,0,0,0,0,0,0,0,936,583,659,1462,0,
+220,0,0,0,0,803,0,0,544,119,0,0,0,0,0,0,0,0,0,0,0,181,176,0,1192,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,1878,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,26,0,0,0,0,0,0,
+944,0,0,0,0,0,0,0,273,0,0,0,0,0,855,0,0,0,0,5,127,0,0,0,0,0,0,0,0,752,230,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,68,162,0,654,48,156,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,240,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,197,
+0,0,0,0,0,0,0,963,0,0,0,0,0,0,0,0,0,0,858,0,0,0,0,0,0,0,0,0,0,676,1978,0,0,102,
+972,0,0,0,0,0,0,0,361,0,461,0,0,0,472,0,0,0,0,0,0,0,0,0,0,0,0,0,0,747,905,0,0,0,
+155,0,0,0,0,0,0,0,0,0,0,319,163,0,0,0,0,0,0,0,0,0,848,0,0,36,631,0,0,0,0,0,1769,
+0,0,0,0,0,144,0,0,0,0,0,0,0,0,0,0,369,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,555,247,0,0,
+996,0,0,189,0,0,0,0,0,0,0,0,0,0,280,0,0,0,0,0,0,0,0,0,0,0,526,746,0,0,345,0,0,0,
+1017,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,651,428,0,0,0,1162,230,327,546,792,0,0,0,
+1203,0,0,0,0,0,0,0,0,0,672,189,0,0,0,0,0,0,99,0,0,0,298,0,0,0,0,0,0,555,397,0,0,
+0,0,0,1157,0,0,0,0,0,0,0,0,0,0,398,1523,0,366,0,0,787,0,0,0,282,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,157,0,941,0,0,0,0,0,1336,0,0,116,0,0,0,0,0,0,787,0,0,0,0,0,0,0,0,0,
+0,170,160,0,1815,0,0,0,0,0,866,0,0,0,0,0,0,0,0,0,689,0,0,0,0,820,0,498,108,0,0,
+0,1119,0,0,0,244,609,1005,0,581,0,0,0,0,0,895,0,0,0,1898,0,0,0,0,0,926,0,0,0,0,
+0,0,0,0,0,0,0,0,0,538,496,294,301,0,0,0,18,0,0,757,0,0,0,0,0,1263,0,820,0,722,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2028,0,0,0,0,124,1875,0,0,0,881,0,0,0,1348,
+0,0,0,0,0,0,0,911,0,954,0,0,0,0,414,0,0,0,0,517,0,0,0,0,0,816,0,0,0,0,0,0,0,0,
+713,0,0,0,0,0,0,0,33,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,593,150,0,0,0,0,
+0,553,0,0,0,0,0,0,0,0,0,0,108,0,0,0,0,420,0,0,0,0,0,0,0,0,0,0,0,1777,0,0,55,493,
+0,0,81,0,321,980,0,0,0,0,0,0,0,0,0,0,0,0,0,0,362,112,0,74,0,0,0,0,0,0,0,625,0,0,
+0,0,0,0,377,16,0,0,61,281,0,0,0,0,0,0,0,0,0,0,0,0,0,0,224,1031,0,0,0,0,0,0,51,0,
+0,0,0,0,0,0,211,309,15,125,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,789,173,0,439,9,648,
+0,0,294,0,0,0,0,0,0,0,374,8,0,1099,0,0,0,0,0,0,0,575,0,0,0,518,0,0,0,702,0,0,0,
+0,0,0,87,0,0,0,438,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,464,122,0,0,0,1802,0,0,0,0,
+0,0,499,0,0,0,87,476,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,840,283,0,0,0,0,1620,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,609,1160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,600,
+323,372,0,0,0,0,471,722,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,
+477,1304,0,1774,0,0,88,0,438,12,0,0,0,0,0,0,0,0,671,997,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,639,22,0,0,782,681,0,0,0,0,0,0,0,0,0,0,1013,664,0,942,0,1349,0,0,0,0,0,0,0,
+0,0,0,0,0,356,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,215,289,0,1975,
+109,450,0,0,0,0,0,0,0,0,0,0,705,0,0,664,0,0,0,0,0,0,0,1238,0,0,318,0,0,0,0,0,0,
+0,0,0,0,0,0,0,960,1872,0,0,0,0,0,0,0,0,0,0,0,0,0,0,103,0,0,0,0,0,0,0,0,0,239,
+777,0,26,0,0,0,0,0,0,0,0,0,0,0,0,375,414,0,17,0,0,0,1350,0,955,0,0,0,0,0,0,0,0,
+887,960,0,0,0,0,0,0,0,0,0,0,708,710,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,919,0,0,0,
+0,502,280,7,45,0,0,0,0,777,0,0,0,0,410,0,1110,0,0,0,0,0,0,414,341,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,787,0,0,0,436,0,0,0,0,0,0,0,1707,613,377,96,0,0,0,0,451,
+0,0,0,0,0,0,0,0,0,0,0,0,0,680,0,483,916,0,0,0,0,0,0,937,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,739,0,0,0,0,0,0,0,0,82,0,0,663,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,128,0,0,0,0,0,0,0,0,1087,0,0,0,0,0,0,0,503,0,0,0,0,0,0,9,113,104,324,0,460,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,935,702,434,485,1014,949,423,0,900,
+0,0,0,0,0,0,0,2018,574,0,0,0,0,0,0,0,0,0,0,0,0,1206,0,0,0,0,0,0,0,0,38,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1022,0,0,0,0,143,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,2029,0,0,0,0,0,0,0,0,0,0,0,0,523,0,0,0,0,0,0,625,0,0,425,37,0,0,0,1943,0,0,0,
+0,0,765,0,0,0,0,0,0,0,0,0,0,551,0,0,0,0,0,0,0,0,0,0,0,0,168,0,0,1010,0,0,1994,0,
+0,0,91,0,0,0,0,532,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1884,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,240,15,0,0,0,1227,0,1534,0,0,0,0,0,0,0,0,0,0,0,0,0,0,392,0,
+0,0,0,0,0,0,0,0,0,0,0,655,562,395,0,0,0,501,1019,0,0,0,0,509,267,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1099,0,0,0,0,0,0,948,0,0,0,0,0,0,0,
+462,114,0,0,258,404,0,1717,0,0,0,0,82,1061,0,724,0,0,0,0,0,1133,0,0,0,0,0,0,
+1021,841,0,1021,0,0,0,0,0,0,0,0,0,0,488,373,37,0,0,0,0,564,0,0,0,0,0,513,0,0,0,
+825,0,0,899,0,0,778,0,0,12,1417,0,1116,0,0,0,0,0,0,0,0,0,0,0,0,0,0,114,545,0,5,
+0,0,0,0,0,0,0,192,0,0,763,0,0,0,0,0,0,0,755,759,0,0,0,0,0,0,0,0,0,370,0,1237,0,
+0,0,0,0,0,298,87,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,31,0,0,
+0,0,0,0,814,991,0,757,57,0,0,0,0,0,0,0,0,0,540,0,0,0,0,608,0,0,0,0,0,0,0,0,1014,
+0,0,0,902,0,0,0,0,553,1668,0,0,0,0,0,0,0,0,0,559,60,0,0,0,0,0,511,0,0,675,0,0,
+156,0,0,0,0,0,0,709,0,698,0,0,0,1745,0,0,0,0,0,0,0,0,0,714,0,0,0,0,0,0,0,0,206,
+8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,776,0,0,0,0,0,0,0,0,0,1272,0,0,
+0,0,0,1059,0,0,0,0,0,0,406,0,0,0,0,0,0,0,0,0,0,947,0,0,0,0,0,0,168,0,0,0,0,0,0,
+870,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,554,0,0,0,0,784,908,0,0,0,0,0,0,
+0,396,358,0,0,0,0,0,0,0,0,2,228,0,0,0,0,0,0,0,0,0,0,0,845,14,0,716,1820,594,0,
+81,1428,0,161,0,782,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,998,0,
+0,0,0,0,0,0,0,0,0,0,0,1043,0,1496,0,0,0,0,0,0,0,0,781,0,0,0,0,0,0,0,817,1114,0,
+1814,958,0,0,0,0,812,0,0,0,0,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,0,236,643,0,0,0,0,0,0,0,0,0,1172,0,0,0,0,0,0,0,0,0,1338,0,0,0,
+0,0,0,0,0,0,0,0,54,0,0,0,256,0,0,351,0,955,1885,0,469,0,0,0,1270,0,744,0,313,0,
+0,0,0,0,0,0,0,402,969,0,0,0,0,0,0,50,0,0,0,0,572,0,0,0,0,847,0,0,0,0,0,0,0,248,
+43,0,369,0,0,0,0,0,0,0,0,0,0,0,0,0,766,0,363,0,0,0,0,0,0,0,0,0,0,0,678,0,0,409,
+258,82,249,0,0,0,0,0,0,0,0,0,0,0,0,32,393,0,788,0,0,0,1281,509,1968,0,0,0,0,39,
+291,0,0,0,589,0,0,54,1059,0,0,0,0,0,0,824,0,0,0,0,0,0,0,0,0,0,1005,0,1598,0,0,0,
+0,0,919,0,0,0,0,0,0,0,0,52,132,0,0,0,0,0,328,0,0,0,0,173,0,0,0,0,0,65,1411,0,0,
+0,0,0,0,0,0,0,0,442,0,842,0,0,0,0,0,0,0,0,0,534,0,0,0,0,0,0,0,0,0,0,0,0,0,845,
+210,0,0,0,0,0,0,0,0,892,0,0,223,0,0,0,0,529,0,0,0,807,0,137,218,0,1444,0,0,0,0,
+0,332,661,0,0,0,0,0,0,0,76,1517,0,0,0,0,0,0,0,0,0,0,0,418,0,0,0,0,0,0,0,0,481,
+379,0,0,0,0,0,149,18,0,0,0,0,0,0,0,0,742,304,142,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,799,925,195,51,0,0,0,0,688,0,0,0,0,697,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1169,751,0,0,0,452,929,0,221,0,1437,0,0,0,0,955,1251,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,192,0,132,0,0,0,0,0,865,0,0,0,0,0,0,0,767,
+672,42,0,0,0,1050,0,0,0,0,0,0,0,0,368,44,0,0,0,0,0,0,0,570,29,0,0,0,0,0,0,227,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,522,0,0,0,0,0,0,0,1529,0,0,0,0,0,0,739,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1667,0,0,0,0,0,0,132,511,0,138,208,1020,0,0,23,565,0,344,0,0,0,
+0,0,922,0,0,0,0,0,0,0,240,0,0,415,171,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,402,0,0,754,31,716,0,982,731,0,0,0,0,0,0,0,888,0,0,0,803,847,0,0,823,
+0,0,0,0,0,0,785,0,0,2,0,0,0,0,0,0,0,532,0,0,681,0,0,314,0,384,684,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,649,447,0,1818,1007,0,321,0,66,360,0,0,0,385,0,0,0,0,0,0,
+0,900,73,254,0,0,0,0,683,1959,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,86,0,0,725,0,0,0,0,0,196,0,0,0,0,0,831,0,0,0,0,723,0,0,0,0,0,994,627,0,0,
+0,0,0,0,0,0,0,0,764,66,0,0,0,0,205,36,0,0,0,0,0,0,0,950,0,0,0,887,111,0,0,831,
+388,165,0,0,0,0,0,155,0,0,0,0,0,0,0,0,0,0,0,0,0,0,780,755,0,0,0,0,898,146,0,0,0,
+0,0,0,0,45,7,0,0,0,0,0,0,0,0,607,0,0,0,0,0,0,65,0,0,0,0,0,0,0,0,0,88,0,0,0,0,0,
+621,600,0,367,0,0,0,0,0,0,0,561,0,559,0,585,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+287,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,672,157,0,0,0,0,714,0,0,0,
+0,0,456,0,925,0,0,0,0,0,0,0,0,19,0,0,0,0,1473,0,0,0,0,0,0,0,0,0,0,113,0,0,0,0,0,
+0,0,0,0,0,0,0,0,69,463,0,0,82,193,2,471,0,0,0,0,633,0,0,0,0,0,0,1148,129,1392,
+542,803,0,0,0,0,0,0,0,0,0,0,0,0,438,0,0,0,0,0,0,875,0,0,0,0,0,237,0,0,0,0,0,0,0,
+65,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,563,0,0,0,9,444,0,0,43,1260,0,0,0,0,0,0,
+971,0,0,699,0,0,0,0,0,1116,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,829,242,0,
+0,593,0,0,0,0,0,0,0,0,201,36,224,0,0,0,0,0,0,1430,0,1806,0,523,0,0,212,1889,0,0,
+0,827,0,0,0,0,0,2043,136,242,0,0,0,0,0,0,284,148,10,0,0,0,0,0,0,1249,0,0,0,807,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,94,0,0,0,494,0,0,0,0,0,0,0,0,1510,0,0,0,0,0,
+0,0,0,0,0,505,1306,0,0,764,268,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1703,0,0,0,0,159,964,583,0,0,0,
+0,0,0,515,0,0,854,0,0,0,0,0,0,0,0,0,0,0,0,1123,0,0,0,0,0,0,0,136,0,0,0,0,0,1782,
+0,0,44,1287,0,0,0,0,0,732,0,0,0,0,313,679,0,0,316,0,0,0,0,595,0,0,0,0,0,0,753,
+147,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,137,0,0,0,0,414,0,1762,0,0,0,0,0,0,0,0,
+0,0,0,599,0,0,0,0,0,0,0,0,0,1749,0,0,0,1627,0,488,0,0,0,0,0,83,0,0,0,0,676,0,0,
+1639,0,0,0,0,0,0,0,0,0,278,0,0,0,0,0,0,97,0,14,1085,0,0,0,0,0,0,781,388,0,849,
+59,229,0,0,0,0,0,1115,0,0,0,0,108,0,0,0,0,700,0,0,0,0,0,0,0,0,0,1414,0,0,0,0,0,
+0,0,0,0,0,0,0,0,660,737,1035,0,0,0,0,0,0,521,690,0,0,0,0,0,0,0,0,0,0,0,0,272,0,
+0,0,0,0,0,0,0,0,0,1744,0,0,0,0,0,0,128,733,0,0,277,0,0,0,0,0,0,0,0,0,4,0,0,0,0,
+0,0,0,0,0,0,0,0,0,936,1981,40,0,0,0,0,0,0,0,0,775,0,0,0,0,0,0,0,0,0,306,0,0,0,0,
+0,0,0,979,0,0,0,0,0,611,0,0,0,0,0,178,0,0,0,1969,0,0,0,0,0,0,0,664,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,390,0,0,0,1510,0,0,0,0,0,0,0,0,0,0,0,493,0,0,37,0,0,0,0,724,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,96,1537,0,0,168,473,0,0,0,105,0,0,0,0,
+627,438,0,0,0,0,0,0,0,0,0,0,11,1256,0,0,0,1626,0,779,0,0,0,0,25,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,308,0,0,0,0,0,741,0,671,0,0,0,0,649,150,0,0,99,521,0,0,3,339,0,0,0,
+543,0,0,0,0,0,0,0,0,0,1358,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,234,155,
+0,0,0,0,0,0,0,1628,0,766,0,0,0,0,0,0,0,0,0,0,0,0,0,829,0,0,0,1445,0,0,0,486,0,0,
+0,0,2,1635,0,0,0,0,558,0,0,0,0,0,0,0,0,0,0,1461,0,0,0,0,0,599,0,0,0,0,0,0,0,0,0,
+1376,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,93,0,0,0,0,0,0,447,0,0,66,1432,0,0,0,0,
+0,0,307,0,413,609,0,0,0,930,0,0,0,0,21,939,0,0,0,0,0,962,4,651,0,0,0,0,15,579,0,
+0,0,0,0,597,0,0,0,0,0,981,0,0,0,545,0,0,0,0,0,0,0,1558,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,800,17,0,0,17,0,907,0,0,0,110,0,0,0,53,458,0,1983,0,0,0,0,0,0,0,0,0,0,443,0,
+0,0,0,0,0,0,0,0,0,0,924,1844,0,1232,0,0,0,0,70,519,0,993,0,0,0,0,0,0,14,530,0,
+907,0,0,0,0,0,733,0,0,0,0,0,0,0,0,55,0,188,531,56,0,0,1693,0,0,0,0,0,0,0,0,441,
+0,192,928,0,0,0,0,0,241,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1525,0,259,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,512,185,0,464,1603,0,0,0,0,0,0,0,0,0,0,0,1113,
+284,720,0,0,722,0,0,0,0,0,13,0,0,0,0,0,0,0,4,289,43,0,0,0,0,0,0,1694,0,0,0,0,
+193,0,0,0,0,409,0,0,0,0,0,0,0,0,0,0,0,0,308,0,0,1863,0,0,0,0,0,0,0,0,0,790,0,0,
+745,1002,0,0,0,0,0,0,0,0,0,289,68,477,13,0,0,0,0,0,0,0,0,0,0,609,0,0,0,0,0,0,0,
+0,0,0,0,367,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,528,0,0,0,0,0,0,0,0,0,694,58,
+548,0,0,0,0,0,0,687,0,0,0,0,1749,0,0,0,0,0,0,0,0,1004,661,0,0,0,0,0,0,445,0,0,0,
+74,0,0,0,0,213,0,0,0,0,0,0,0,0,0,0,0,0,0,834,0,0,189,1672,0,0,0,0,0,0,0,1548,
+192,0,0,0,0,0,0,0,0,0,0,0,0,0,32,751,0,78,0,0,0,0,0,0,544,1602,105,473,0,0,0,0,
+0,0,156,1949,0,1779,0,0,0,0,0,0,0,0,0,0,0,763,0,0,0,0,0,0,0,0,29,0,0,0,0,0,0,0,
+0,0,0,883,0,0,0,0,0,0,0,488,0,617,0,0,50,0,694,1518,785,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,546,0,0,0,0,0,0,0,0,0,0,22,0,0,0,0,1016,0,0,0,577,0,0,0,0,0,0,
+184,935,114,720,0,0,100,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,95,14,0,969,0,0,0,0,0,0,0,
+727,0,1021,0,0,0,0,0,1190,0,0,0,0,0,0,0,0,0,0,0,0,0,153,0,0,0,0,0,0,0,0,0,798,0,
+587,0,0,695,42,0,1929,141,957,0,465,7,908,0,0,450,148,0,0,0,1166,0,0,0,0,0,0,0,
+0,0,0,0,0,253,0,1003,0,0,0,0,0,0,0,0,0,0,0,46,0,0,879,0,806,0,1868,0,0,0,0,0,
+1846,0,0,0,730,0,0,0,0,0,0,0,965,0,0,0,0,506,0,0,0,10,0,0,0,22,0,0,0,0,0,0,0,0,
+0,0,0,0,0,960,296,0,0,0,0,0,0,0,0,0,0,0,587,0,0,0,0,20,0,0,0,32,982,0,0,0,0,0,0,
+0,0,0,0,941,0,0,0,0,435,0,0,0,0,0,0,71,419,0,0,0,0,0,0,688,740,94,345,0,0,679,
+582,0,0,0,0,0,0,0,945,0,0,0,0,0,0,0,0,0,0,0,0,539,0,684,1993,0,0,0,659,0,583,0,
+803,0,704,0,0,0,0,0,198,181,347,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,481,405,203,0,0,99,826,0,0,0,0,0,0,0,492,0,408,0,0,0,0,0,0,0,0,0,0,4,0,0,
+0,0,665,349,137,0,0,0,0,612,1270,0,0,0,0,0,371,0,0,0,826,0,0,0,0,21,1535,858,
+374,0,0,0,0,0,0,311,0,0,0,991,1968,0,0,0,0,494,1647,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,769,0,0,0,0,0,642,0,0,157,123,0,0,0,1435,0,0,0,0,0,0,0,0,0,0,79,0,0,0,
+0,0,0,1425,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,106,393,486,1690,0,0,0,0,
+0,0,0,0,0,0,0,0,756,184,0,0,0,1382,0,0,0,175,0,1493,0,1007,0,0,0,0,0,0,0,0,0,0,
+0,219,0,0,0,0,515,99,0,851,0,0,0,0,0,1278,0,0,0,0,0,0,0,1000,982,0,762,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,910,1819,0,0,0,0,0,0,906,0,0,0,0,0,0,0,0,0,0,1730,0,0,
+0,0,0,0,0,0,0,0,0,1185,0,0,0,0,0,0,0,0,40,0,0,0,147,0,0,0,0,0,0,0,0,0,0,0,0,0,
+650,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,56,30,0,553,0,0,20,597,0,1614,0,0,0,0,0,327,
+49,0,0,0,0,0,0,0,78,0,0,786,134,0,0,0,12,496,0,0,0,0,0,0,0,0,0,0,42,204,0,614,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,147,247,0,0,0,0,942,0,0,2023,0,0,0,0,
+0,0,67,285,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1309,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,41,532,0,0,0,0,0,0,0,
+1692,0,0,0,0,55,1704,0,0,0,0,988,0,0,0,223,0,0,0,0,0,0,0,57,1123,0,0,0,0,0,1764,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2015,0,0,0,1599,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,129,0,0,0,0,0,0,0,0,0,0,0,534,0,0,0,0,0,0,0,0,0,0,0,
+0,0,504,621,1248,321,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1397,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,441,75,0,0,0,0,0,0,0,0,0,0,841,0,0,0,0,0,693,0,650,314,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,913,0,0,0,0,0,0,0,0,0,0,0,0,0,0,880,0,475,0,
+0,1016,179,602,111,329,0,0,0,1864,0,0,0,0,846,1888,0,0,780,0,0,0,82,0,0,0,0,821,
+0,0,0,0,0,0,0,0,0,0,0,956,112,0,0,0,261,455,0,0,0,0,0,0,337,385,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,184,1865,0,0,721,16,0,486,0,0,0,265,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,621,0,0,0,0,0,0,0,0,234,0,0,815,0,0,743,
+1987,205,197,0,0,0,0,0,0,0,0,0,314,0,0,0,0,0,0,0,0,0,0,0,0,0,0,219,452,589,0,
+176,333,0,0,0,0,0,0,0,1110,47,0,0,0,0,0,0,0,0,0,0,0,864,0,0,300,0,1237,0,0,0,0,
+0,0,0,0,0,0,0,1685,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,135,395,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,631,0,0,0,0,0,0,835,0,0,0,606,459,0,979,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,612,0,0,0,0,0,0,0,0,158,372,0,854,0,0,0,0,0,
+0,0,1492,0,0,0,833,0,0,0,0,0,0,0,1739,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+195,0,0,0,0,0,0,0,0,730,1997,0,0,0,0,0,0,0,0,61,0,0,0,0,0,0,0,266,751,0,0,0,0,0,
+0,0,821,0,0,0,715,0,0,0,868,0,959,0,0,0,0,0,0,0,0,0,0,0,1053,0,0,0,950,0,1081,0,
+1595,0,0,0,0,59,0,0,0,0,0,0,0,0,0,0,47,684,0,0,0,0,0,0,1606,0,777,0,1020,0,0,0,
+1094,0,0,0,0,0,0,0,350,0,0,0,0,0,0,242,1812,0,0,0,967,0,0,0,473,286,0,0,0,0,0,0,
+798,629,222,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,513,337,306,0,0,0,0,0,0,0,0,0,
+146,0,0,1646,0,0,0,0,0,465,0,0,0,525,0,0,0,0,0,0,299,165,0,0,0,0,0,0,0,1064,0,0,
+0,0,0,596,0,0,0,0,0,0,0,0,0,0,0,0,0,0,238,1741,0,1233,451,1824,0,0,0,0,733,495,
+0,0,0,0,0,1204,0,0,0,559,341,0,224,21,0,0,0,0,0,0,0,0,97,1446,0,0,0,0,0,0,0,729,
+0,0,565,727,0,1948,0,0,0,519,0,0,0,0,0,0,0,0,0,1193,0,0,0,0,0,0,790,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,323,2,201,0,0,59,0,0,34,0,896,961,0,1285,0,0,46,0,479,0,0,
+0,0,549,0,663,0,0,0,0,0,783,65,682,0,0,0,0,0,11,0,0,0,0,0,522,0,0,0,52,0,0,0,0,
+0,383,0,0,0,0,0,0,0,0,127,0,0,0,0,0,397,194,0,0,635,0,0,0,0,0,0,0,0,0,0,975,0,0,
+0,0,0,0,0,0,0,0,116,0,51,0,0,858,0,1075,535,448,0,0,0,0,0,610,0,0,0,0,0,0,0,0,0,
+0,191,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,267,673,319,94,92,0,551,0,0,218,
+1406,69,256,0,0,952,1980,0,833,0,0,0,0,0,0,0,0,0,0,0,0,39,0,0,0,0,0,0,0,81,0,0,
+0,352,634,0,0,0,0,0,618,0,0,0,0,0,0,73,339,0,0,0,0,0,0,0,0,0,0,0,0,0,0,169,759,
+0,0,0,0,0,0,0,0,0,0,0,0,0,1075,0,0,0,0,0,0,482,649,0,0,0,0,0,0,0,0,386,336,0,0,
+0,1035,0,0,0,0,0,0,0,0,0,0,0,924,0,73,0,0,0,0,0,1971,0,0,0,0,0,0,0,0,0,1344,0,
+501,0,0,0,0,0,0,0,0,46,799,0,0,0,0,0,0,0,276,0,0,0,0,0,0,0,770,0,0,0,0,0,0,0,0,
+0,0,0,0,0,158,0,0,0,0,0,1432,0,0,0,0,0,0,0,0,0,0,25,0,0,2001,0,0,0,0,0,0,0,0,0,
+0,0,0,0,478,0,0,0,0,0,0,91,1461,211,602,0,0,0,0,0,0,0,0,0,1068,0,0,124,567,0,0,
+0,1006,0,0,0,0,0,0,0,0,0,735,812,0,0,323,0,0,0,304,0,0,0,0,0,0,0,0,0,148,0,0,0,
+0,0,0,0,0,0,523,0,0,144,730,0,0,981,0,0,111,0,0,132,0,0,0,0,0,0,890,0,0,0,0,0,
+444,0,1787,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,2041,932,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,937,0,995,0,0,255,0,0,138,863,965,0,0,631,0,0,0,0,1394,16,652,0,0,0,0,0,0,
+0,0,0,0,0,0,0,897,0,321,0,0,0,0,0,922,0,619,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,844,0,0,0,0,0,0,1659,0,1100,0,0,0,1173,0,1930,268,251,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,390,711,0,0,0,0,0,0,0,0,0,0,0,0,0,744,0,0,0,0,0,0,0,0,0,624,0,0,0,
+1998,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1125,0,0,0,594,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,268,0,0,0,0,0,0,0,563,0,0,0,0,0,0,0,0,2,39,0,0,0,1332,0,0,0,0,0,
+0,0,508,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,66,796,0,0,0,0,527,0,0,0,0,98,0,0,576,0,
+0,0,0,0,122,0,276,37,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,645,0,0,0,0,
+0,0,0,0,0,0,0,290,0,0,762,1292,0,0,0,1315,0,1955,0,0,0,0,0,0,0,0,0,0,210,131,0,
+0,0,0,797,0,38,0,11,488,0,936,0,441,0,0,0,0,0,595,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+991,0,0,0,0,0,0,0,0,0,0,0,653,0,523,0,0,0,903,0,0,0,0,0,0,0,0,0,0,0,0,80,0,0,0,
+0,0,0,0,0,0,432,0,0,314,0,0,0,0,232,1368,534,0,0,0,0,0,27,0,0,0,12,0,0,0,0,0,0,
+0,0,0,264,736,0,1657,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1117,0,127,0,0,0,1208,0,1294,
+0,0,0,0,364,0,0,0,0,0,125,1334,0,0,0,0,0,0,0,0,0,0,0,0,0,0,792,0,0,0,0,0,0,0,
+849,699,0,0,0,0,0,968,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1446,
+124,397,0,0,0,0,0,0,0,0,0,0,0,641,0,0,0,0,0,0,0,0,0,0,0,0,127,346,0,0,517,75,0,
+0,0,0,0,0,0,0,83,0,0,0,0,0,0,1031,0,0,0,0,0,0,0,1470,0,954,0,0,345,304,410,0,0,
+0,0,734,0,0,0,0,0,1822,0,0,0,1798,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,161,
+1865,69,0,0,0,0,0,0,922,0,0,0,0,0,0,0,0,0,0,0,541,0,627,0,0,0,0,0,0,0,0,0,166,0,
+0,0,0,0,0,0,0,0,849,0,0,0,0,0,0,0,717,0,0,0,0,0,0,0,0,0,0,0,0,0,0,600,0,0,0,0,0,
+0,654,0,0,188,273,0,0,0,543,0,410,87,0,0,941,0,0,186,250,0,1785,0,0,0,0,0,1339,
+462,961,0,780,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,529,0,0,0,0,0,0,474,1276,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,24,948,0,0,0,0,657,753,0,0,0,0,941,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,706,985,837,0,1861,0,0,0,0,0,0,0,0,0,0,0,0,0,0,292,933,0,0,0,0,0,
+0,0,0,0,767,0,0,0,0,0,0,0,641,0,0,0,1233,114,0,883,0,274,2008,0,1794,285,0,0,
+571,0,0,0,0,0,0,0,0,0,0,823,960,16,617,0,431,0,0,0,0,0,0,0,0,0,0,567,0,401,0,2,
+781,424,33,0,2006,0,0,274,0,0,1882,0,794,0,0,0,1848,0,0,0,0,0,0,448,47,0,0,0,
+1199,0,0,0,0,0,0,0,0,417,0,0,0,0,0,0,0,0,0,0,295,0,0,0,0,0,0,0,1019,0,0,0,0,0,0,
+0,0,0,0,0,0,0,620,0,0,0,0,464,0,0,0,0,208,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,442,0,930,0,0,0,0,0,516,68,0,0,0,0,0,1128,104,0,0,0,0,0,0,0,0,787,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,491,0,0,0,0,0,0,711,0,0,9,0,101,441,0,0,0,0,0,0,0,0,
+0,0,160,396,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,679,326,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,1128,0,0,0,0,0,737,0,1796,0,0,0,0,0,0,0,0,0,0,0,0,338,574,0,0,
+0,0,0,1096,491,405,0,0,0,0,0,1081,0,0,0,0,0,0,0,0,0,0,0,0,0,1676,0,1207,0,0,0,0,
+0,0,969,354,0,0,0,0,598,0,297,0,0,0,0,0,0,0,0,1772,751,0,37,0,0,1828,0,0,0,0,0,
+0,0,0,0,257,191,582,0,0,0,0,0,0,790,0,0,0,0,0,47,0,0,0,0,0,0,0,449,306,1011,0,0,
+0,0,0,299,0,0,0,0,0,0,837,0,0,0,0,0,0,10,329,0,0,0,0,0,1320,0,0,0,0,0,0,158,657,
+0,1191,0,0,0,0,0,0,7,0,974,1939,0,1665,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,288,
+66,0,0,0,0,494,175,0,1643,0,0,0,0,0,0,0,0,570,750,719,0,0,0,0,0,0,0,0,0,0,0,0,0,
+13,0,0,1247,0,0,221,356,0,0,0,0,0,0,0,0,0,0,694,1809,0,0,0,0,0,0,0,411,0,44,31,
+0,0,0,0,669,0,673,0,0,0,0,0,0,0,0,0,1303,704,299,0,0,0,275,0,0,216,1761,0,0,0,0,
+0,0,0,0,0,0,0,1319,0,0,428,0,0,0,0,0,0,0,0,0,0,514,0,0,0,0,0,0,49,55,102,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,364,0,0,0,0,379,0,921,971,52,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1258,0,0,0,1058,0,0,0,0,0,656,0,0,0,0,0,144,0,0,0,0,0,0,0,0,0,0,
+0,1373,10,605,0,0,0,0,0,0,0,838,0,1012,0,0,0,0,0,0,0,0,0,0,0,0,0,0,154,365,0,0,
+0,0,0,0,0,0,0,340,0,0,0,0,0,810,0,0,0,0,0,0,495,0,0,0,0,0,0,0,0,0,261,0,535,248,
+0,358,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,567,445,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,697,0,0,0,1336,0,0,0,0,0,0,0,0,917,174,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,972,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,351,0,0,0,0,0,0,0,0,0,0,
+0,0,0,286,0,0,56,438,0,0,0,0,0,1950,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,738,0,0,0,0,0,
+0,0,0,0,0,969,2047,0,0,0,0,0,0,0,818,0,0,0,0,0,0,0,866,0,0,0,0,0,0,0,1467,0,0,0,
+0,0,0,0,0,0,0,0,0,0,972,0,355,0,0,0,116,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,267,189,104,0,0,0,0,1613,0,0,0,0,0,0,0,116,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,886,0,86,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,45,0,0,863,0,0,0,0,0,
+0,0,1953,450,1773,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,381,0,0,0,0,0,0,0,
+0,0,0,0,0,1142,0,1189,0,0,0,663,0,0,0,0,0,0,0,846,0,0,528,0,393,378,0,0,0,0,0,0,
+325,899,680,1880,0,1770,0,0,0,0,0,648,0,0,0,0,0,0,185,167,0,2046,0,0,0,0,0,0,
+249,1645,0,152,0,0,0,1733,0,0,0,0,0,1006,0,0,0,0,0,420,0,0,0,832,0,0,0,0,0,351,
+0,0,0,0,6,40,0,0,60,0,0,0,0,1354,745,724,0,0,0,0,0,0,0,0,772,1951,275,108,639,0,
+0,0,0,0,0,0,0,0,500,1758,0,0,0,0,0,0,0,0,0,0,0,1886,711,205,0,0,965,865,0,0,0,
+534,0,0,0,0,691,0,0,0,237,443,0,878,0,0,0,0,0,1410,0,0,0,0,0,0,0,0,0,0,0,0,0,
+995,0,0,0,0,0,0,0,0,0,0,0,0,0,578,0,0,0,0,881,0,0,0,0,0,0,0,0,822,0,923,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,924,0,0,0,665,0,0,0,0,0,1901,0,0,0,0,0,950,498,93,
+0,0,0,1451,0,0,0,0,0,747,828,788,400,184,0,198,0,0,0,0,0,0,0,0,0,0,0,994,0,0,0,
+0,0,0,0,0,615,320,0,0,0,978,843,905,0,0,0,0,0,0,0,0,850,974,0,0,0,0,6,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,509,0,0,0,0,0,273,0,0,0,0,0,0,0,0,0,0,0,0,0,
+201,0,0,0,1041,0,0,0,1040,0,0,0,0,0,0,0,0,0,693,234,774,0,336,0,1399,22,0,805,
+802,777,167,789,0,0,1705,0,0,0,0,0,0,0,0,0,0,0,10,13,11,0,0,204,264,0,0,56,0,0,
+1917,0,470,0,0,0,0,0,0,0,0,0,0,0,1198,0,0,0,0,0,0,0,0,0,0,1015,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,715,0,0,1002,0,0,0,298,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,867,0,0,724,0,0,0,0,0,0,0,0,0,0,0,0,768,0,0,0,0,0,1066,0,0,0,0,67,0,174,948,
+0,0,0,0,0,0,0,0,0,0,0,0,0,764,0,0,0,0,75,137,0,756,0,0,0,0,0,0,1008,842,643,0,0,
+0,67,0,0,0,0,0,0,0,0,0,0,0,135,821,0,0,0,0,0,0,0,0,736,0,389,355,0,0,786,0,0,0,
+0,0,0,2044,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1030,0,0,0,1083,0,0,0,0,0,
+1226,0,0,0,0,356,319,8,389,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,474,0,0,0,427,
+0,413,0,730,0,0,0,0,0,373,0,0,0,0,0,0,0,0,0,799,0,0,0,1793,0,0,0,322,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,89,290,2,0,0,0,0,0,0,0,0,0,0,672,
+699,1860,0,0,0,737,0,0,0,1612,0,0,0,0,0,0,0,0,0,0,0,145,124,884,0,0,0,0,0,387,0,
+0,0,0,0,0,0,0,0,0,0,679,0,550,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1305,0,0,0,0,0,0,0,
+576,0,0,0,0,0,0,0,686,0,607,0,0,37,0,0,0,0,0,0,0,0,0,101,1726,0,0,0,0,0,958,0,0,
+0,903,0,0,0,0,147,0,0,0,0,0,0,0,0,0,0,0,367,0,0,0,0,690,0,705,273,0,0,887,0,0,0,
+0,0,0,0,0,0,0,0,90,0,0,0,0,0,0,0,908,0,0,0,0,0,0,0,1261,0,0,497,1235,0,429,0,0,
+0,0,904,0,12,125,0,0,0,841,0,0,0,0,0,860,946,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,768,0,770,160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,271,0,0,0,0,0,0,0,719,0,699,581,0,0,0,0,0,0,0,0,0,0,862,304,0,631,0,0,0,0,880,
+1513,0,0,0,0,0,981,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,434,0,0,0,0,0,550,0,0,476,930,
+824,553,0,0,452,0,151,0,0,0,0,0,0,772,0,292,135,0,0,0,0,0,0,0,504,0,0,1089,0,0,
+0,0,0,0,0,0,0,0,0,783,0,0,0,0,0,0,206,393,0,0,0,0,0,0,0,0,232,912,0,0,0,0,0,977,
+0,0,716,98,0,0,0,0,0,733,0,0,0,0,0,0,0,0,19,0,0,0,0,668,0,360,0,0,0,0,0,0,656,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,726,0,0,0,0,0,0,0,0,0,0,0,0,72,0,0,1269,0,0,463,0,
+0,0,0,0,0,1454,0,1287,245,0,989,0,0,0,0,0,0,0,0,0,107,164,0,0,0,0,0,0,0,1061,0,
+0,0,0,2,484,0,0,0,0,0,0,0,1127,0,0,0,0,0,0,0,460,0,0,0,0,0,932,0,0,0,0,0,0,0,
+588,625,0,0,0,0,76,92,0,0,0,0,0,0,0,0,0,0,0,0,0,104,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+763,0,622,0,0,0,253,0,546,0,0,110,0,256,916,0,0,35,212,0,0,746,0,0,0,150,0,0,
+1466,0,0,0,1299,0,0,0,0,0,0,0,0,0,1518,0,0,0,0,0,0,0,0,0,0,0,0,0,1229,0,0,0,816,
+0,0,0,0,0,0,159,0,0,0,0,0,734,869,126,1716,0,0,0,0,0,0,202,232,0,0,0,0,212,0,0,
+0,0,0,111,1003,0,0,0,0,0,0,0,0,0,0,0,1712,0,0,216,0,0,0,0,516,0,0,0,0,0,650,0,0,
+0,0,57,99,0,0,0,0,300,574,0,0,0,0,1023,0,0,302,0,1871,0,728,252,0,0,461,0,0,0,
+323,0,0,0,0,0,0,775,461,0,0,0,0,0,0,172,0,0,464,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,73,727,0,1023,0,0,0,0,0,0,0,0,0,0,577,0,0,0,0,0,0,0,0,1037,0,0,0,0,0,0,
+0,0,280,677,0,0,0,0,0,0,0,0,0,0,0,799,0,0,0,0,159,0,446,1730,0,0,0,0,0,0,0,0,0,
+395,0,0,0,0,145,0,0,0,0,0,0,0,20,0,0,426,608,0,0,0,0,0,977,0,250,0,0,0,0,0,100,
+0,0,0,0,1982,0,0,0,0,0,476,0,0,0,0,0,0,594,76,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,447,0,0,0,0,526,0,0,14,1124,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,188,0,0,0,0,0,0,0,0,362,301,0,0,0,1743,0,178,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,872,0,831,0,0,208,202,0,0,0,0,0,0,0,1954,0,
+0,0,0,516,872,0,0,313,224,0,0,24,0,11,546,0,0,0,1937,242,241,46,0,0,0,830,1273,
+0,0,0,0,0,0,0,825,327,1006,0,0,0,0,0,1580,516,366,0,0,0,0,0,1736,0,0,0,0,0,0,0,
+0,0,0,0,1935,0,826,0,0,0,0,139,331,0,0,0,0,0,0,0,0,0,0,0,288,0,916,0,0,0,0,0,
+1888,0,0,0,0,0,0,0,1471,0,1570,0,394,0,0,0,0,0,0,0,1931,0,1719,0,658,228,0,0,0,
+0,0,374,0,0,0,0,735,0,0,0,0,0,0,323,498,0,1063,0,0,0,0,155,0,0,0,0,0,0,0,0,906,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1139,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,108,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,616,
+902,0,0,0,0,0,692,0,0,0,0,0,0,823,0,0,0,305,0,0,0,0,0,0,0,681,0,0,0,0,0,214,
+1004,0,0,0,0,0,0,0,23,0,0,1703,0,0,0,0,0,0,0,0,0,1443,0,0,19,714,0,0,0,0,64,737,
+0,0,345,1758,0,0,579,47,0,0,539,139,0,0,0,0,388,0,0,0,0,253,0,0,0,0,0,0,252,0,
+745,0,0,0,0,0,0,0,0,0,0,0,504,107,0,871,0,0,0,229,0,0,0,0,0,903,0,0,71,0,0,549,
+6,47,0,0,0,0,0,0,0,0,0,980,865,705,0,0,0,161,0,0,0,0,143,1331,0,0,0,1388,33,724,
+0,0,0,19,0,0,0,395,0,0,0,0,0,846,210,0,0,0,122,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,695,937,497,0,0,0,0,0,718,0,0,0,0,0,0,0,1581,0,
+0,0,0,0,0,161,49,0,0,0,0,0,0,0,0,0,597,0,0,0,1094,0,0,0,811,908,0,0,0,0,0,0,0,0,
+0,0,1471,0,0,0,0,0,0,0,0,0,0,42,1935,0,0,0,2014,66,2007,0,0,586,0,0,0,0,0,0,0,0,
+0,28,1077,0,0,0,1221,0,0,62,0,0,0,0,0,0,0,0,0,0,1766,0,0,0,0,0,0,0,0,0,0,0,0,25,
+0,499,1388,0,0,97,10,0,0,0,0,0,481,0,0,0,0,0,0,0,0,0,0,37,134,155,486,0,1442,0,
+0,0,0,0,591,0,0,0,0,0,0,310,1173,0,0,0,0,409,1156,0,0,0,482,0,0,263,926,0,0,0,0,
+0,0,0,0,0,0,0,0,0,804,0,0,0,0,0,0,0,0,0,0,0,0,0,1265,0,415,0,348,0,0,0,1012,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,165,1803,0,0,0,0,0,0,0,408,
+0,0,0,0,0,0,257,1321,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1138,0,0,0,249,0,
+0,0,576,0,0,0,0,231,0,0,0,288,0,0,0,0,0,0,0,0,0,433,1487,569,1678,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,87,0,0,0,0,0,779,538,0,0,0,413,0,0,0,
+0,0,0,0,0,0,0,495,0,0,0,0,0,191,54,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,530,567,
+0,0,0,0,0,1484,0,0,0,0,0,0,815,609,0,0,0,0,0,484,0,0,0,0,0,0,0,0,0,0,900,0,0,0,
+0,1335,0,1724,0,0,0,0,0,0,0,0,0,0,0,640,0,0,0,0,0,0,0,0,0,0,0,1831,0,0,0,0,0,0,
+0,0,0,0,0,0,0,474,0,0,0,0,0,0,0,0,0,1103,0,1504,655,1034,0,0,0,0,0,305,0,0,0,0,
+0,0,0,0,0,1236,0,0,429,217,0,0,0,0,739,278,0,0,0,0,0,0,0,708,0,0,0,0,0,1840,233,
+0,0,0,0,0,0,0,0,2017,0,0,0,0,0,1488,0,0,0,1590,0,0,0,0,0,1800,28,0,0,0,0,0,0,0,
+0,0,45,0,36,0,22,1442,378,0,0,0,0,0,0,1507,0,0,0,0,0,0,0,0,0,0,39,0,0,1054,725,
+1955,0,2036,0,0,0,0,0,0,0,0,0,0,896,1871,0,0,0,0,0,0,0,0,0,0,805,0,0,0,0,2046,0,
+0,0,0,17,712,0,617,55,320,271,0,0,0,0,0,0,0,0,0,445,0,184,103,0,0,0,0,0,0,0,0,
+659,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,676,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+337,0,0,0,506,0,0,0,0,0,843,77,0,458,0,0,0,0,0,1420,382,109,142,330,0,0,0,0,0,0,
+0,0,0,0,0,0,87,0,0,0,492,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1239,0,0,0,0,0,0,
+211,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1049,0,321,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,1985,0,0,122,0,0,234,0,0,0,1098,0,0,0,0,0,0,549,253,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,522,131,0,0,149,0,0,0,0,0,0,0,0,0,0,0,0,0,0,507,0,0,0,0,811,630,0,0,0,343,
+0,0,0,0,0,448,591,455,0,1381,0,0,0,0,0,0,0,575,0,0,0,0,0,1175,0,0,0,0,0,0,0,0,0,
+653,0,0,0,1761,0,1198,0,0,0,0,297,1127,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,678,0,0,
+164,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,35,0,45,0,0,0,0,0,121,0,0,0,0,0,0,
+0,0,125,0,0,0,1622,0,0,0,0,0,721,145,0,0,0,970,792,0,0,0,715,0,0,0,0,0,1999,0,0,
+74,531,0,0,65,0,0,0,105,220,0,0,0,0,0,0,0,960,0,0,0,0,0,0,428,19,0,0,401,96,0,0,
+0,0,0,1595,116,0,1021,0,0,0,0,0,750,1961,0,0,148,0,0,0,0,0,0,0,0,0,0,0,0,0,75,0,
+0,1383,0,0,0,0,0,0,0,0,0,0,0,0,0,0,779,0,0,0,0,0,0,0,0,598,0,424,0,0,0,0,0,0,0,
+1222,0,0,0,876,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,133,0,0,0,0,187,0,8,0,0,0,0,0,
+0,0,429,0,685,0,0,0,0,0,0,0,0,0,0,0,132,472,0,0,0,0,0,0,0,0,0,938,0,0,874,0,0,0,
+0,0,774,0,0,0,0,0,92,0,0,0,0,0,0,830,701,0,0,0,0,0,426,350,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,603,59,0,0,0,0,0,0,0,0,0,0,293,0,0,0,0,0,0,0,0,0,0,0,0,0,0,441,163,4,0,
+0,0,0,0,0,0,0,0,806,0,0,0,0,0,0,233,0,0,0,0,1994,0,1739,0,0,393,0,47,1038,0,0,0,
+309,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,363,0,0,0,175,0,0,0,0,0,0,0,666,
+0,0,1675,0,1600,0,0,0,808,0,0,0,0,0,0,0,0,0,0,0,280,54,0,0,0,0,0,0,0,0,421,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,249,0,0,103,254,0,262,1,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,805,0,0,0,0,0,0,0,0,0,1630,0,0,0,0,0,0,0,0,0,0,0,0,0,671,972,989,0,0,
+0,0,0,0,0,889,0,0,0,1382,0,0,0,0,0,0,0,775,0,0,0,0,0,0,0,0,0,0,388,202,0,0,0,0,
+16,560,0,0,0,841,0,0,566,0,0,0,938,0,0,0,0,0,0,0,0,0,0,912,0,0,0,1361,0,0,0,0,0,
+0,618,236,0,1854,0,0,318,190,0,1376,0,0,0,0,0,0,0,349,0,0,0,0,951,1972,0,0,0,0,
+0,0,344,0,0,0,0,0,0,0,0,850,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,910,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,163,85,0,487,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,145,0,83,0,0,1013,0,0,0,1922,0,0,169,557,66,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,1193,82,0,352,454,57,0,0,1333,396,107,0,370,0,0,0,0,0,0,0,0,0,204,0,0,0,
+0,0,1706,0,0,0,0,0,0,0,0,0,0,0,0,394,1204,0,0,0,0,0,1007,0,0,0,1696,0,1519,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,981,0,0,0,0,1072,0,0,0,712,0,1629,0,0,0,0,0,0,0,728,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1271,0,0,0,1608,16,0,0,0,0,485,0,0,0,0,0,0,
+153,27,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1991,0,0,0,0,0,0,0,0,52,0,21,0,
+0,0,0,0,0,0,0,0,819,0,0,0,0,0,917,0,0,0,0,784,0,0,0,0,135,0,0,0,0,0,454,0,0,0,0,
+0,0,0,0,0,852,1719,0,0,0,0,0,852,0,0,0,0,0,952,0,0,0,0,568,0,0,0,0,0,448,0,0,0,
+67,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1826,657,0,729,666,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+669,0,0,0,0,0,0,0,402,0,0,152,0,0,0,0,912,0,0,0,0,0,0,51,320,0,445,0,0,0,0,308,
+0,0,0,0,0,386,0,0,239,0,0,130,83,0,143,0,348,0,0,0,0,0,0,0,958,0,0,0,0,0,210,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,430,0,0,0,0,0,0,0,0,0,0,0,0,7,213,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,801,0,0,0,0,0,0,0,0,0,936,0,108,0,0,
+0,0,0,0,0,0,0,885,587,219,398,364,0,1165,0,0,342,241,303,0,0,0,0,0,0,0,0,0,0,
+1454,0,0,0,0,0,0,0,0,0,0,254,562,0,786,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1294,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,493,216,0,0,0,0,219,341,0,0,0,0,0,
+0,0,0,0,0,130,1734,154,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,701,604,0,0,879,0,195,
+666,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1669,0,0,0,1791,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1228,0,0,0,0,0,623,0,0,0,0,0,0,0,798,0,0,0,0,0,0,0,0,0,0,0,0,84,
+122,0,0,0,837,0,0,0,0,0,0,1013,0,0,577,0,0,0,460,932,0,0,0,0,0,0,0,0,0,0,0,31,
+131,0,0,0,605,0,0,0,1246,0,0,0,0,68,278,165,307,781,0,0,0,0,0,0,33,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,1113,0,0,720,1953,203,0,0,0,0,0,0,0,425,326,0,0,0,0,0,
+0,0,0,0,0,241,1316,0,0,0,0,0,416,0,0,0,1300,0,847,0,0,662,358,0,0,0,0,839,1823,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,654,1522,0,0,0,0,0,0,163,0,0,0,0,0,314,978,0,0,0,
+601,0,0,0,0,0,946,434,0,0,0,402,411,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,1467,
+410,0,0,0,0,0,0,0,0,0,0,0,0,0,0,483,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,677,0,0,0,0,0,0,0,0,0,0,0,0,70,0,0,0,0,1405,0,0,0,0,0,0,108,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,777,0,0,0,0,0,747,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,68,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,505,0,326,0,0,164,628,654,0,0,0,
+37,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,668,152,0,0,0,0,0,0,0,0,0,0,0,581,
+0,0,0,0,44,126,89,0,0,0,0,0,0,0,0,1531,0,0,0,0,0,0,0,0,203,1167,0,0,0,0,0,0,0,0,
+531,1232,0,0,0,0,0,943,0,670,231,880,0,1617,0,0,0,1957,0,0,0,0,0,0,0,975,0,0,0,
+0,0,0,0,0,0,0,0,242,0,0,0,0,0,0,0,0,0,421,0,0,14,834,0,0,0,0,0,0,0,0,0,0,0,0,
+465,0,0,0,0,0,834,688,413,855,0,0,0,590,0,0,0,0,0,0,0,0,114,0,0,0,0,0,0,0,0,0,0,
+0,45,169,0,0,0,0,0,0,0,0,0,0,0,198,0,0,565,585,0,0,0,0,0,0,0,0,0,0,0,0,0,691,0,
+0,0,593,0,0,0,0,0,0,0,0,0,913,116,0,0,0,0,1360,0,0,0,802,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,673,308,0,709,1006,1895,0,228,0,0,0,1840,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,608,0,0,0,0,0,0,0,0,0,1573,0,2039,136,540,0,0,0,0,0,0,0,
+897,0,0,938,1878,0,0,0,0,0,0,0,0,0,1469,0,999,0,299,0,0,0,0,0,0,0,578,0,0,0,0,0,
+456,0,0,0,1679,163,693,0,0,0,0,0,0,48,755,0,0,0,0,0,0,0,0,0,0,0,0,338,0,0,0,0,
+1091,0,0,0,0,695,0,0,1464,0,0,0,0,0,975,0,0,335,0,0,1979,0,0,0,0,269,1566,630,
+396,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1815,634,0,0,0,966,0,0,0,0,0,0,0,9,
+412,0,958,0,0,579,382,0,212,0,0,0,0,965,681,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,655,
+0,0,0,0,67,0,0,0,0,0,0,751,0,0,0,0,423,231,0,0,1016,300,0,0,0,0,100,237,0,0,0,
+1370,0,0,0,1208,0,0,0,0,0,1219,129,0,0,0,0,0,0,0,0,0,0,0,0,0,0,199,0,0,427,0,0,
+0,0,949,665,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,712,0,0,0,0,0,1186,0,0,0,0,0,0,0,0,0,0,295,312,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+151,0,0,0,0,588,4,0,0,0,0,0,414,104,0,0,757,263,0,561,0,0,0,320,0,0,0,0,0,0,0,0,
+0,0,0,225,0,0,0,0,37,817,0,974,0,0,0,0,0,0,0,0,0,0,0,0,0,2026,131,235,16,0,590,
+1157,0,0,0,0,0,0,0,0,221,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,140,390,0,0,0,0,
+0,0,0,1144,0,0,0,464,0,0,0,0,0,0,0,0,0,0,0,0,204,407,303,1218,0,0,0,0,5,325,0,0,
+0,0,12,800,0,1783,0,0,0,0,0,0,0,0,0,0,504,621,0,0,0,0,0,0,0,0,0,920,0,376,0,0,0,
+0,0,218,580,0,768,454,0,0,0,0,0,0,0,0,0,0,0,0,676,0,0,0,0,0,0,164,0,0,0,0,0,0,0,
+0,50,0,0,0,0,0,0,0,0,0,0,0,0,0,120,285,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,226,343,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,29,0,0,1812,0,0,8,0,0,0,21,1125,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,1327,0,0,0,0,575,1598,0,0,0,0,0,0,0,0,0,895,0,0,0,959,0,0,
+0,0,0,1759,173,0,0,0,0,266,261,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1427,0,0,300,1033,0,0,0,0,0,0,0,0,0,0,0,584,0,0,0,0,52,734,
+0,0,217,239,0,1129,0,0,0,0,0,0,0,0,732,20,0,0,0,0,0,0,0,0,0,0,0,418,0,0,0,613,0,
+0,0,0,0,0,0,0,0,632,0,0,85,984,0,0,0,0,909,694,7,1109,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,167,0,0,0,0,280,62,0,0,33,0,0,359,186,980,0,0,0,0,0,0,0,0,0,0,0,585,0,0,0,
+211,0,0,336,145,0,1130,0,873,0,0,840,263,0,0,0,0,0,0,0,0,0,916,0,0,0,0,0,0,0,0,
+0,0,155,0,0,0,461,97,0,0,0,0,0,1356,0,0,0,0,0,0,0,593,0,0,0,0,0,1392,0,0,0,0,
+126,0,0,0,0,1179,0,0,0,0,0,162,0,0,0,0,0,765,0,187,0,1286,0,0,0,0,0,0,0,0,0,635,
+0,0,23,215,0,0,0,1306,0,0,97,716,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,657,0,
+0,0,0,0,0,0,0,299,0,0,0,0,0,0,134,0,0,0,0,0,0,0,0,0,0,0,658,1082,0,0,0,0,0,2002,
+0,0,0,0,0,0,833,248,0,0,0,0,0,1654,0,0,531,0,0,0,0,0,0,634,0,0,0,0,0,0,0,0,0,
+853,573,249,0,0,0,0,0,0,0,0,527,0,0,0,0,1419,0,0,0,0,0,0,20,49,0,0,0,992,0,0,0,
+728,0,0,0,0,0,0,0,0,0,0,0,0,497,1579,0,0,0,0,62,268,0,0,0,0,0,0,0,1201,0,0,0,0,
+0,0,0,0,0,0,0,0,495,193,0,0,0,0,106,0,0,859,0,0,23,0,0,0,0,0,0,0,813,925,0,0,
+223,613,953,0,0,0,0,0,0,0,0,666,0,0,0,0,0,0,0,0,0,670,0,0,40,216,0,0,0,0,0,0,
+259,0,0,0,440,1114,0,0,0,0,0,0,0,0,74,475,0,0,188,139,0,797,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,1572,0,0,0,0,39,0,0,0,0,0,0,0,0,0,0,0,0,1594,0,0,0,0,0,0,0,290,0,232,
+0,0,887,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,521,14,0,0,0,0,0,741,0,0,0,992,0,
+0,0,0,0,0,0,0,111,0,0,425,0,0,0,0,0,789,0,0,0,1593,0,1768,0,0,233,0,0,0,0,943,0,
+0,0,0,0,0,0,955,225,245,0,0,0,0,0,0,241,0,0,0,0,1943,0,0,0,1284,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,709,0,0,0,0,0,0,554,0,0,0,0,0,0,0,0,1564,0,0,0,
+443,0,0,0,0,0,0,280,0,0,0,0,0,0,0,0,729,0,0,0,348,0,0,0,0,0,0,0,758,848,298,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,829,1422,189,121,0,0,632,812,0,0,556,0,0,0,0,0,436,172,
+530,844,232,984,0,0,0,0,0,0,0,0,0,0,147,0,0,0,0,0,0,0,0,537,0,0,0,0,0,859,0,0,
+842,0,0,0,0,0,0,0,0,0,0,1291,0,0,0,0,0,0,0,0,0,0,0,1482,612,392,0,0,0,262,31,0,
+0,0,0,0,0,0,0,0,0,753,549,0,0,0,0,0,0,696,0,0,0,0,0,0,0,834,0,0,0,0,0,771,0,0,0,
+0,0,0,0,0,0,0,0,0,0,921,0,0,0,674,0,0,0,0,0,0,0,0,0,0,308,444,0,0,0,0,0,0,805,
+180,0,0,278,271,0,0,214,505,0,1215,0,0,0,0,0,0,387,271,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,1645,42,92,0,459,0,0,330,1557,0,0,0,0,0,0,0,0,113,18,0,0,0,
+1742,0,0,0,965,0,0,0,0,0,0,0,0,0,0,0,0,0,182,0,0,65,0,0,0,0,0,0,0,0,0,0,0,0,973,
+0,0,0,0,0,328,0,0,588,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1786,
+0,0,962,1985,0,0,0,308,508,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,588,0,0,0,0,0,0,614,793,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,290,0,0,0,0,0,0,0,0,0,0,1136,0,0,0,0,0,0,0,0,0,0,796,719,0,0,
+326,210,0,0,0,701,758,472,0,0,0,1947,278,1079,0,0,0,0,0,0,497,41,0,0,634,46,961,
+0,810,524,0,0,33,0,0,0,0,0,0,0,0,0,0,0,0,532,0,997,0,0,0,0,0,0,0,0,0,0,0,1301,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1298,0,671,0,0,0,306,0,0,0,0,0,0,0,0,0,0,
+693,1823,0,0,0,759,0,0,0,0,0,1932,0,0,0,0,0,0,0,0,0,0,0,0,0,0,88,182,0,0,0,1964,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,521,0,0,0,0,0,0,424,857,0,0,0,0,671,328,0,
+529,0,0,0,0,0,716,0,1509,80,67,0,0,0,0,59,141,0,0,0,0,0,0,783,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1498,0,0,0,0,343,430,803,1183,677,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1357,53,0,0,0,0,590,0,0,0,0,0,0,0,0,0,0,
+0,0,0,329,0,0,0,0,0,0,0,469,0,0,0,0,0,0,0,0,0,0,460,0,0,1743,0,0,963,340,0,0,0,
+0,0,1603,0,0,250,0,0,0,0,0,646,218,0,1794,0,0,0,571,0,455,0,0,0,1012,0,0,0,0,0,
+0,0,0,0,0,0,0,597,161,0,349,0,524,0,0,0,0,0,0,0,0,0,0,0,0,322,432,0,0,0,0,0,0,
+325,223,0,0,0,0,0,566,0,0,0,1394,481,436,0,48,457,610,756,618,0,0,0,755,0,1217,
+0,0,0,0,0,197,0,0,0,0,0,0,0,0,0,0,0,0,0,0,544,492,107,414,0,0,0,0,0,0,0,0,0,0,0,
+1007,0,0,0,0,5,0,0,1580,0,0,0,0,0,0,0,0,0,0,0,0,0,673,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,1843,0,0,0,0,0,0,0,0,0,165,0,0,0,0,0,0,809,885,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,498,0,0,0,306,9,0,0,0,0,0,0,0,437,721,146,0,0,0,0,0,0,0,0,0,0,0,177,0,0,0,0,
+0,0,0,1377,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,200,0,959,0,0,0,1928,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1435,0,481,0,0,0,0,0,0,142,84,0,0,0,0,0,
+1015,0,0,0,315,0,0,0,0,0,0,759,0,0,0,0,0,0,0,0,712,0,0,0,1722,0,0,0,0,0,0,0,0,0,
+0,0,0,222,0,985,1414,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1273,
+538,706,0,0,0,0,0,0,0,0,115,0,0,0,0,0,0,0,0,0,0,1781,0,0,0,0,0,431,97,665,42,
+237,0,0,0,264,0,0,213,0,0,0,0,0,0,0,455,0,0,0,906,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+624,0,574,0,0,0,0,0,0,0,0,0,0,0,0,354,0,0,0,1558,0,0,0,0,0,0,0,0,0,0,0,0,0,0,68,
+235,723,1813,0,0,0,957,0,830,0,0,0,0,0,0,0,0,0,0,0,0,23,0,0,496,0,0,0,0,0,0,0,
+547,239,88,0,0,0,0,0,0,0,0,0,1310,0,0,0,0,0,0,0,0,80,1076,0,0,118,0,0,0,479,274,
+0,0,0,0,0,0,0,0,0,0,0,497,0,0,669,261,0,0,0,0,13,0,0,0,0,0,0,791,250,642,0,0,0,
+1429,939,949,0,0,0,0,0,0,0,0,0,0,0,0,0,818,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,982,330,0,0,0,0,545,0,0,0,0,0,0,947,0,1188,0,0,0,0,0,904,0,0,0,0,0,1372,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,693,377,0,0,0,0,0,0,0,0,0,0,0,0,0,0,695,0,0,
+713,386,0,0,0,0,128,1575,0,0,0,0,0,0,424,893,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,904,0,0,0,0,0,552,322,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,28,1808,49,0,0,0,0,
+1832,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,421,0,0,442,415,0,0,289,
+0,0,0,0,0,206,110,0,0,0,0,0,205,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+19,1539,0,0,0,0,0,1340,0,1194,0,0,0,0,0,0,0,0,549,0,0,0,0,0,0,0,0,1720,0,0,0,0,
+0,0,0,0,0,319,0,0,0,0,112,1180,0,0,0,0,0,0,0,0,0,0,0,967,0,0,0,0,0,0,0,0,0,1940,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,735,0,0,0,0,0,0,0,0,0,897,132,0,0,0,0,0,0,0,
+0,0,0,38,838,0,0,0,379,218,8,660,1017,0,0,0,0,0,0,111,387,647,877,0,0,53,790,0,
+0,0,0,0,0,0,0,458,0,0,0,0,0,0,954,0,0,0,394,0,1367,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,882,0,0,0,0,0,0,0,1409,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,38,124,342,199,0,0,0,0,
+0,0,0,0,0,0,724,628,0,0,0,0,804,266,0,0,0,0,0,208,0,79,0,0,0,0,0,0,0,0,741,0,0,
+0,0,0,0,0,0,0,0,606,0,1494,821,1553,0,0,135,405,0,0,178,100,0,0,0,0,0,0,0,0,0,0,
+0,0,0,481,0,0,0,1378,0,0,0,0,0,0,0,0,0,0,0,0,0,791,33,1227,857,0,467,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,447,0,0,0,0,0,0,86,128,0,0,0,0,0,0,587,0,0,0,692,1018,0,
+195,0,0,0,0,0,0,0,1546,0,0,0,0,0,0,0,0,0,0,0,684,0,0,345,0,0,0,0,0,0,365,0,1683,
+0,0,472,0,433,0,0,0,0,0,0,0,28,0,0,0,997,0,705,3,0,0,0,0,0,0,0,0,0,229,0,0,0,0,
+102,0,0,0,0,866,1022,0,0,0,0,0,0,0,0,0,55,0,115,0,0,0,0,933,0,0,0,0,0,0,0,702,0,
+0,0,0,0,0,0,1728,26,484,0,0,0,185,618,417,0,803,0,0,0,0,0,0,0,0,0,0,0,1262,0,0,
+0,0,0,0,0,0,0,0,0,0,0,633,0,0,0,0,0,0,0,0,0,0,0,0,0,479,262,0,0,0,0,0,0,830,0,0,
+0,0,26,70,0,0,0,0,0,0,0,0,217,0,640,51,0,0,360,1586,0,0,0,0,0,652,0,0,0,0,0,766,
+0,0,0,0,298,737,0,0,0,0,0,0,0,0,0,0,655,222,906,0,0,1013,991,2009,0,0,0,0,503,0,
+0,0,216,154,0,0,0,716,0,844,0,0,0,0,621,252,0,0,0,0,748,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,103,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,576,0,0,0,648,0,0,0,331,0,0,0,
+0,0,0,0,0,0,0,0,0,632,0,0,0,518,107,0,0,0,0,0,0,0,0,851,0,0,0,0,504,0,0,0,0,0,0,
+0,0,0,0,0,0,7,883,0,0,0,0,0,0,0,922,0,0,0,0,0,0,0,0,91,993,0,0,0,0,0,0,200,131,
+10,0,0,0,0,0,0,0,0,0,0,0,0,0,365,1433,0,0,0,0,28,103,0,0,798,1013,0,0,0,0,0,0,0,
+0,39,1925,0,853,0,0,271,519,0,0,0,0,338,0,0,300,470,419,0,0,0,0,0,0,836,0,0,0,0,
+0,0,1937,0,0,0,0,0,393,0,0,357,0,0,0,0,0,703,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,387,0,0,0,0,0,0,75,708,453,1351,0,303,0,0,772,0,0,0,0,0,0,0,0,749,0,0,
+0,0,0,0,0,0,0,0,0,0,0,1065,0,0,717,226,0,0,0,0,0,890,431,626,0,0,0,0,706,0,0,0,
+51,698,0,0,0,0,0,0,0,0,0,0,0,828,0,0,17,0,0,0,0,1929,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,84,0,0,0,0,0,0,0,0,0,0,0,0,0,0,27,871,498,0,101,1793,0,0,0,0,0,0,435,0,
+0,0,0,0,966,0,129,1644,0,0,0,0,0,0,0,0,0,0,0,0,0,997,502,0,0,0,0,0,0,0,0,0,0,0,
+0,823,0,1927,0,0,0,0,98,1756,0,0,0,0,0,0,0,0,0,0,0,0,8,0,160,1046,0,492,0,0,0,0,
+0,0,129,45,0,0,0,0,0,0,353,558,0,0,0,0,0,785,0,0,0,1145,189,0,0,0,26,353,0,0,0,
+0,0,2024,0,0,0,606,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,855,0,0,0,0,0,0,0,0,0,0,0,
+0,0,2011,0,0,5,4,0,0,461,764,0,0,0,1449,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1445,0,0,
+0,1168,0,0,0,233,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,255,0,0,216,0,0,0,286,0,0,0,
+3,0,0,0,723,536,0,0,0,0,0,285,0,0,0,560,0,0,0,0,0,690,0,0,0,0,0,1246,0,0,63,0,
+33,0,0,0,0,0,520,1862,0,0,0,0,0,0,0,0,0,0,0,0,630,0,0,0,0,554,0,0,0,0,0,1001,0,
+0,0,0,0,446,0,0,0,0,0,0,0,1313,0,0,837,636,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,278,
+0,0,0,0,0,0,0,0,868,0,0,0,0,1010,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1231,0,304,0,506,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,26,0,93,1408,794,
+843,704,0,285,114,485,898,145,0,19,2035,0,0,0,1933,0,0,0,0,0,0,0,1728,0,0,0,0,0,
+0,0,0,746,0,0,0,0,0,0,0,995,1964,0,0,0,0,0,0,0,0,0,0,0,1550,0,874,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,1018,0,0,0,814,126,0,0,1264,0,0,814,955,0,0,0,0,0,0,
+0,981,0,0,0,0,0,0,0,0,915,56,0,0,100,0,0,0,0,0,0,0,0,0,638,0,0,0,0,738,0,0,0,0,
+0,0,0,0,0,758,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1112,0,0,214,0,0,0,133,0,196,
+168,0,0,0,0,0,1152,0,1245,0,0,538,169,871,1816,0,0,413,133,0,0,0,978,0,0,43,93,
+371,0,0,0,0,0,0,526,25,0,754,335,0,0,0,0,182,0,0,0,0,0,0,0,0,0,0,0,39,601,0,0,0,
+0,0,0,0,181,370,0,0,1652,358,0,0,0,0,0,0,0,0,0,176,286,0,788,0,0,0,0,0,1223,780,
+254,1003,896,0,0,0,1447,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,744,0,0,0,0,0,126,0,
+41,788,0,0,0,629,0,0,0,0,0,0,0,0,0,0,0,293,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,420,37,1900,0,0,0,0,542,1570,957,0,0,0,0,0,0,
+0,373,31,0,0,0,0,125,325,0,0,0,0,0,0,323,0,0,1547,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1216,0,0,0,0,0,0,198,1905,629,15,0,0,0,0,0,0,20,75,543,1353,0,0,0,533,0,0,6,0,0,
+0,0,0,0,538,0,0,0,0,0,0,0,0,0,0,0,338,0,0,0,0,11,0,0,0,284,659,0,989,0,0,0,0,0,
+0,0,0,0,848,0,0,507,0,0,0,0,0,0,0,0,188,991,884,0,0,0,0,60,959,0,0,0,0,0,1653,0,
+0,922,337,0,638,0,0,500,0,0,0,0,0,0,0,0,0,0,0,166,0,0,0,0,0,0,0,0,0,0,0,0,418,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,760,0,0,0,0,0,0,1277,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,770,0,0,0,0,0,0,0,243,89,0,0,0,0,0,0,0,0,0,1396,0,
+560,0,0,3,1658,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,586,0,0,1271,0,0,0,505,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,637,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1947,
+41,445,0,0,0,0,0,0,0,0,57,189,0,0,371,0,0,0,0,552,0,883,0,923,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,875,0,0,0,1788,49,0,0,0,0,0,
+0,0,0,0,0,0,661,0,0,1945,0,0,0,0,0,794,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,1135,0,0,0,745,0,0,0,0,0,0,0,84,0,0,0,0,0,0,0,410,0,976,0,0,0,0,0,703,0,0,
+0,0,0,0,187,322,0,0,0,227,0,0,0,0,560,0,31,1395,0,0,0,0,0,466,0,0,0,0,643,167,0,
+0,0,1428,0,412,0,0,0,0,0,0,0,0,0,1118,562,0,0,0,0,0,256,0,0,0,0,0,0,1771,0,0,0,
+0,0,1190,132,0,66,0,0,0,0,0,0,0,0,0,0,317,0,0,0,63,0,0,0,0,0,0,0,1475,0,0,0,0,0,
+0,0,288,0,0,0,0,608,0,0,0,0,0,0,0,0,1225,0,1189,0,0,0,0,0,0,0,1468,0,0,0,0,0,
+689,120,0,0,0,0,0,0,0,1,0,329,0,0,0,0,226,0,0,0,0,0,1855,0,0,461,0,0,0,0,1346,0,
+0,0,0,0,85,0,0,299,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1171,0,0,
+0,980,0,0,0,0,0,0,0,0,637,279,0,0,0,0,0,293,0,0,0,0,528,17,0,0,0,0,5,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,601,0,0,0,0,0,0,779,0,
+196,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1322,737,752,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,412,192,80,0,0,8,1470,0,0,0,0,0,0,0,0,0,873,0,0,0,0,0,835,0,0,0,0,256,
+38,986,0,0,0,0,0,0,0,0,0,91,257,278,911,0,0,0,0,0,0,0,0,749,151,0,0,0,0,0,0,0,0,
+0,0,0,0,989,0,0,990,0,0,90,194,0,0,0,0,0,425,0,0,0,0,0,774,0,0,0,0,0,0,0,0,0,0,
+646,827,752,0,0,0,662,0,22,21,0,0,0,0,0,0,95,239,0,0,0,431,0,0,0,0,0,874,0,0,
+265,65,0,0,0,1350,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1887,0,0,0,0,0,0,0,809,
+0,696,0,1074,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,630,0,0,802,0,0,0,56,776,0,
+970,0,0,797,0,0,0,0,0,400,0,0,1951,0,0,41,0,11,118,0,0,0,0,0,0,0,0,251,615,0,0,
+0,1044,0,0,0,0,0,0,0,0,0,0,0,225,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,370,0,0,0,0,
+104,48,209,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,930,0,0,0,0,
+0,0,0,0,0,0,0,1286,0,759,0,120,385,0,0,0,429,0,0,0,0,0,0,0,0,820,0,0,0,0,0,0,
+199,0,10,151,0,0,0,761,365,0,0,0,0,0,0,0,0,0,46,1086,0,0,0,0,11,1624,58,344,0,0,
+1008,1868,0,0,0,888,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,711,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,440,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,914,1913,0,958,0,885,0,0,0,0,0,0,0,0,0,0,0,
+0,0,847,276,0,302,65,0,0,0,510,0,1514,0,0,0,0,0,0,152,291,0,0,0,0,0,0,0,0,0,0,0,
+0,282,589,0,0,0,0,0,0,0,0,0,0,0,0,0,130,0,0,463,42,0,0,0,0,0,372,0,0,0,0,0,0,0,
+0,0,680,0,0,0,0,0,0,0,0,977,1997,0,0,0,810,0,0,0,0,0,0,0,0,0,1390,0,0,0,644,0,0,
+867,982,0,0,0,0,0,0,0,540,0,123,0,0,0,1978,0,0,0,0,789,623,0,1723,0,1220,0,0,0,
+0,0,0,0,480,0,0,0,0,0,0,0,0,0,0,0,888,0,0,0,0,0,0,0,0,0,0,0,0,299,1995,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,788,179,0,0,0,0,0,0,431,156,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1373,39,80,196,0,0,507,0,0,0,646,0,0,0,0,
+0,1214,0,0,0,0,926,0,0,0,1,114,0,0,0,0,0,446,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,490,0,0,0,491,0,1584,0,0,507,250,0,0,0,158,
+10,362,1,0,0,0,0,0,0,0,0,0,408,228,860,480,0,779,0,0,0,557,0,0,142,197,0,0,0,0,
+0,0,0,0,0,0,0,1490,11,378,316,1057,0,0,18,579,299,1546,0,177,0,0,0,0,0,0,0,0,0,
+411,0,0,0,0,727,439,0,0,0,0,0,1528,0,0,0,0,0,0,58,0,482,0,0,0,505,1952,0,0,0,0,
+0,0,0,0,0,0,0,242,0,0,0,0,0,0,0,953,0,0,0,0,802,0,0,0,0,0,0,0,0,0,0,290,0,0,791,
+52,0,0,0,0,0,0,0,0,0,0,0,112,0,0,0,0,0,1028,0,0,138,0,0,0,0,1811,0,0,0,0,0,0,
+934,1821,0,0,0,0,371,38,0,0,0,1296,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,723,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1330,0,0,0,0,0,0,0,1255,296,109,0,0,0,0,0,660,0,0,0,0,270,591,0,
+0,0,0,0,0,0,1090,81,0,0,0,0,391,0,0,0,0,249,322,0,0,0,0,0,0,0,1412,0,0,0,0,0,0,
+0,0,0,0,526,632,0,0,0,0,0,0,235,144,0,0,0,0,0,940,0,0,0,52,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,309,196,0,0,0,0,0,1912,0,1290,0,686,0,0,625,0,0,0,0,0,0,0,0,0,0,0,412,0,
+0,0,0,43,0,0,0,0,11,967,758,0,0,0,0,0,0,0,0,0,0,0,0,0,0,220,0,0,0,0,0,0,0,0,0,0,
+873,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,890,0,0,2,0,0,0,0,0,0,0,0,1774,
+393,263,0,0,0,0,0,0,818,456,0,0,251,178,393,97,0,0,0,0,0,674,168,0,0,0,0,0,0,0,
+159,1639,0,0,0,0,0,0,0,0,59,934,0,191,0,0,0,0,346,165,0,877,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,128,0,0,0,0,0,0,1297,0,0,0,0,0,0,164,0,0,0,15,132,241,1073,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,228,324,53,0,0,910,0,0,0,0,0,0,0,0,734,705,
+217,73,0,0,0,0,0,0,0,0,636,389,0,1409,0,0,0,0,0,893,0,0,0,0,21,0,0,0,0,0,0,0,0,
+0,0,0,0,0,721,0,0,0,959,0,0,0,0,1433,0,0,0,0,0,0,0,0,0,0,0,0,174,189,0,0,0,0,0,
+0,0,0,0,0,22,2,0,0,815,354,0,0,0,0,425,0,411,60,13,1611,0,0,0,0,0,0,0,0,0,0,0,0,
+0,1478,596,0,0,398,0,50,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,192,1159,0,0,0,0,0,
+592,223,0,0,0,0,0,0,0,245,64,0,0,0,0,278,0,604,0,0,1502,265,0,0,0,0,0,0,0,310,
+1763,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,129,0,0,0,0,0,0,0,0,0,1356,0,0,0,0,0,0,0,
+0,505,0,0,0,0,0,0,0,1000,0,0,966,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,839,0,0,0,0,0,0,
+0,0,0,0,0,0,0,637,0,0,0,0,0,0,0,0,0,0,0,0,0,0,590,0,0,0,0,280,0,0,0,1386,0,0,0,
+281,0,1064,0,0,0,0,0,917,0,0,15,555,0,0,1014,1883,0,0,0,965,0,0,117,33,0,0,0,
+801,0,0,0,0,0,877,0,824,0,0,0,0,0,0,0,0,0,0,0,365,0,0,0,0,0,0,774,7,0,430,0,0,
+231,360,0,0,0,0,0,0,0,0,822,740,0,0,929,1485,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,852,0,0,0,0,17,0,0,0,0,0,0,1001,0,0,0,0,35,831,0,0,384,457,0,0,0,1351,0,27,
+0,0,984,0,264,552,0,401,0,0,0,710,0,1211,0,0,11,205,0,0,0,0,0,0,0,0,0,0,0,0,5,
+579,0,717,0,0,1011,0,0,0,0,0,0,0,0,0,0,0,0,0,0,805,0,0,0,0,0,0,0,0,0,0,0,489,0,
+0,0,1024,0,0,0,0,0,0,0,0,0,892,0,0,0,0,0,0,0,0,0,0,0,0,473,0,0,0,659,864,0,0,0,
+0,0,0,152,819,0,51,0,0,0,0,0,0,0,0,0,0,130,0,0,0,0,0,229,0,0,0,0,674,0,0,0,0,0,
+0,0,0,0,770,52,79,0,0,0,1666,0,409,0,0,0,0,0,0,0,195,0,688,0,0,0,0,0,0,0,0,0,0,
+0,889,174,160,0,0,0,0,0,0,0,0,0,0,0,0,0,872,0,918,569,268,0,0,0,1224,0,1361,0,0,
+0,0,0,0,0,0,0,374,0,0,0,0,0,731,0,0,0,0,190,0,0,0,0,0,0,0,202,506,444,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,835,0,17,1526,0,0,0,0,0,477,0,0,
+994,1374,76,0,0,0,0,0,0,0,355,287,0,1389,0,0,0,0,0,0,455,384,0,0,0,264,0,0,0,0,
+0,0,0,0,0,0,0,0,1001,0,0,0,0,0,0,0,0,0,0,0,0,28,0,0,0,851,175,359,0,0,0,0,0,0,0,
+0,287,740,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,857,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+819,1402,0,0,0,0,0,0,174,224,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1649,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,655,573,0,0,0,0,0,0,0,0,128,351,0,0,0,0,0,0,
+0,0,0,0,0,918,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,687,0,0,0,0,0,0,0,0,0,1525,
+0,0,0,1009,0,0,0,0,0,0,0,340,0,0,0,0,0,0,0,0,0,0,861,0,176,0,0,0,0,0,0,0,0,0,96,
+985,0,615,0,0,0,0,0,0,0,1919,0,0,0,0,0,1131,0,0,0,0,0,0,0,247,0,0,0,0,27,23,0,0,
+0,0,0,0,0,0,38,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1015,0,0,0,0,0,1088,0,0,
+0,0,0,1585,0,0,0,0,227,0,0,0,478,360,0,0,0,95,0,0,0,0,0,0,699,0,0,0,26,0,0,0,0,
+1119,0,0,0,739,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,741,67,0,0,0,0,0,0,464,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,42,0,96,0,0,0,26,342,0,0,0,0,0,0,203,0,0,449,0,
+0,0,0,0,0,0,0,0,0,256,311,0,0,0,0,0,0,758,0,0,0,0,0,0,0,0,827,0,0,0,0,581,64,0,
+1047,0,0,0,0,0,288,0,0,0,0,0,1375,0,0,0,0,0,0,0,0,0,0,0,1309,0,0,0,0,0,0,0,0,
+376,12,0,0,0,0,0,154,0,1520,0,1753,95,502,0,0,0,0,0,0,0,269,291,1197,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15,0,0,0,0,1341,0,1017,0,0,0,0,0,0,0,
+0,857,1810,533,0,0,1453,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,836,211,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,19,0,156,0,0,0,0,1009,0,0,0,0,0,0,0,0,0,0,0,0,0,820,0,0,
+0,0,0,0,0,0,0,228,0,0,0,1131,0,1276,0,0,0,0,0,0,0,0,0,0,0,0,849,1792,0,0,389,
+291,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,525,0,0,
+0,453,0,0,0,0,666,0,0,0,422,0,355,0,0,0,0,165,0,260,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,865,0,0,0,0,0,0,0,1625,0,0,0,234,0,1383,0,0,0,0,0,0,0,0,306,0,0,0,802,1921,
+0,0,0,0,0,0,180,0,0,0,0,1312,814,0,0,0,0,0,0,0,0,0,0,707,0,0,0,1493,11,61,733,0,
+0,0,341,0,0,0,98,0,0,0,0,0,0,0,0,0,0,0,1014,0,0,0,0,0,0,0,142,102,0,0,30,0,0,
+823,0,1045,0,0,0,1930,0,1512,0,0,0,0,0,0,0,87,0,1243,245,0,0,0,0,0,0,0,48,68,0,
+0,0,0,0,0,0,0,126,77,625,938,0,0,351,0,0,0,174,1668,0,707,0,0,0,0,0,0,0,0,0,0,0,
+403,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,282,0,0,0,0,0,0,8,44,0,0,363,115,0,0,0,0,0,0,
+0,0,0,0,0,0,545,761,0,0,835,1254,0,0,0,0,930,1936,0,0,0,0,0,0,0,0,653,0,0,0,0,0,
+344,0,0,1483,673,185,0,0,460,93,753,478,0,0,0,0,0,1020,0,0,0,0,0,0,0,103,0,0,0,
+499,0,0,0,0,0,0,207,0,0,0,0,0,0,0,0,0,0,0,0,0,0,96,0,968,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,3,0,0,0,0,399,0,0,0,0,224,563,0,0,0,0,0,704,0,0,0,0,0,0,0,0,0,0,0,
+1559,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,861,0,0,0,0,946,333,746,0,0,0,0,0,
+0,0,910,0,0,0,0,0,0,0,0,0,0,0,0,0,652,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1393,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1514,0,0,0,0,201,0,510,717,0,0,528,0,0,0,0,
+20,0,0,0,1251,0,0,0,1163,0,0,0,307,0,0,0,0,0,1091,0,0,0,0,0,0,0,0,0,0,0,429,0,0,
+0,881,0,0,0,0,0,621,0,0,0,0,0,0,0,736,0,348,0,868,0,0,0,0,433,0,0,0,771,1495,0,
+0,0,0,215,0,0,0,0,0,124,0,0,0,0,0,0,0,0,0,0,0,55,0,0,0,0,0,0,0,112,62,0,856,270,
+0,572,0,0,0,0,939,0,0,0,0,0,0,0,352,0,0,0,0,0,0,0,0,0,647,0,0,0,0,10,0,0,0,0,0,
+0,0,220,0,0,0,0,0,0,0,0,0,0,0,0,0,464,0,0,109,0,0,0,1746,0,0,0,515,0,0,0,566,0,
+0,0,0,0,0,67,40,0,0,722,992,0,0,923,0,0,0,0,0,0,1145,0,0,0,0,0,0,0,0,0,0,0,568,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,247,0,0,0,0,645,0,0,328,0,0,0,0,0,0,0,0,0,0,0,0,
+1363,0,0,0,0,0,1280,0,0,0,0,0,0,0,0,0,0,7,28,360,162,0,0,0,0,0,0,0,0,0,0,0,764,
+0,0,833,862,0,856,0,0,0,0,0,0,736,92,0,0,948,1944,0,1479,63,590,0,0,0,1521,0,0,
+0,709,0,0,61,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,483,0,0,0,0,1213,
+0,0,0,0,29,1022,0,1712,0,466,0,0,0,0,0,0,0,0,0,0,0,0,0,731,0,0,0,0,0,0,171,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,241,0,0,0,0,0,0,0,0,0,0,0,964,2005,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1100,0,0,0,954,0,0,0,0,0,0,0,0,0,1958,0,0,34,549,994,0,0,449,
+137,850,0,0,670,146,0,0,0,0,518,159,0,0,0,0,0,0,0,0,151,0,0,1027,0,0,0,0,0,0,0,
+0,0,0,983,0,0,0,0,993,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,141,501,0,0,0,
+0,0,0,0,0,0,452,0,0,0,0,0,0,0,0,0,0,233,149,0,0,0,0,0,0,0,0,582,0,0,0,801,0,0,0,
+0,0,0,70,0,0,369,0,36,0,0,0,0,0,0,0,204,721,430,241,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1817,16,1078,1021,0,0,
+406,0,0,0,0,0,69,0,0,0,0,0,1830,0,0,0,824,0,0,0,0,0,0,0,0,0,826,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,816,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1000,717,1845,0,423,0,0,
+0,0,0,0,0,0,510,0,0,1048,0,0,0,618,0,0,0,520,0,0,0,0,990,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,321,0,0,0,0,0,0,0,1135,0,0,921,0,0,0,24,397,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,856,0,0,0,139,282,981,0,288,0,0,0,1890,651,56,0,0,0,0,0,0,0,
+0,261,0,0,0,0,0,0,0,0,0,0,0,617,1403,0,1205,0,0,563,0,0,0,0,0,0,0,0,333,0,0,0,0,
+0,369,0,0,0,0,0,0,0,0,0,622,0,0,0,1407,0,0,0,0,0,0,0,0,0,0,0,0,624,160,0,363,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,619,0,174,292,0,0,656,616,0,0,0,685,0,0,0,0,0,0,0,0,0,0,0,0,0,647,0,0,0,631,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1267,0,0,0,1797,0,0,0,1684,0,0,469,0,531,
+1230,73,0,0,0,0,0,0,0,0,0,268,0,0,0,0,0,102,558,109,65,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,595,0,0,0,0,0,374,1832,0,0,0,0,0,0,16,0,405,6,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,881,0,1495,0,0,0,0,0,0,0,0,0,142,0,0,0,0,0,0,0,0,0,0,21,466,23,
+257,0,0,0,0,0,0,77,404,0,0,0,0,0,0,712,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,860,
+1848,0,0,652,629,0,0,0,0,13,377,0,1842,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1501,0,
+0,0,1906,0,0,0,0,0,0,0,0,0,0,0,0,0,491,234,171,0,0,0,0,631,1186,0,0,0,0,0,0,0,0,
+0,0,0,0,931,0,170,0,0,0,0,0,0,0,0,0,0,1587,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+765,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,424,0,0,714,0,0,0,0,685,0,0,0,0,0,
+0,285,0,0,0,0,0,0,429,0,0,0,0,0,0,0,0,0,0,71,18,0,0,0,0,0,0,0,0,0,0,116,828,0,0,
+0,0,0,0,289,0,0,0,0,0,0,0,0,675,0,0,0,1424,0,0,0,0,0,647,0,0,0,1334,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,36,209,0,0,0,0,0,0,0,342,0,0,0,928,0,0,0,0,0,1838,118,856,654,
+318,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,915,895,454,0,0,513,1425,0,0,
+0,0,0,0,791,0,153,0,0,0,0,0,0,796,909,445,345,0,0,0,0,0,0,0,0,578,0,0,0,1387,0,
+0,0,555,0,0,0,0,0,0,766,0,0,0,0,0,0,0,0,0,0,541,0,0,0,0,0,0,0,0,0,0,0,0,0,880,0,
+0,0,0,0,1506,0,0,983,0,768,0,0,0,0,584,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,737,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,226,30,426,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+117,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,462,0,0,0,385,0,398,0,0,0,0,0,0,
+0,0,0,347,0,0,0,0,125,1259,644,136,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,469,0,0,0,0,0,
+1367,0,0,0,0,0,0,0,0,0,0,0,719,0,0,0,0,0,0,0,0,0,0,0,0,0,1423,0,0,0,0,0,0,0,0,0,
+749,0,0,0,0,546,645,0,0,0,0,0,0,277,0,0,1275,0,0,0,0,0,0,0,453,536,555,0,0,987,
+1107,0,0,90,0,0,0,0,0,0,0,0,860,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+257,0,1768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1071,0,0,0,0,0,0,0,0,0,0,0,0,0,83,
+0,835,0,0,0,0,0,0,0,2006,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,696,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,95,1718,0,0,0,0,0,0,0,26,0,550,0,0,0,0,0,901,0,0,0,0,0,
+0,822,0,0,122,0,0,0,807,0,0,0,0,0,262,0,620,601,34,0,0,170,0,0,0,0,537,0,0,0,0,
+0,0,0,0,0,332,0,0,208,1909,182,261,0,0,0,1721,0,0,0,0,0,933,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,1609,0,895,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,812,0,0,942,1916,0,0,0,0,
+0,0,0,778,0,0,0,137,0,1314,0,0,0,0,0,0,0,1661,0,0,0,0,0,0,0,1591,0,0,0,0,0,0,
+820,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,185,89,0,1160,230,6,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,63,29,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1740,0,0,177,
+170,0,1961,0,0,0,0,0,0,0,0,0,0,0,0,91,0,17,44,0,0,0,0,0,0,0,0,0,270,0,296,0,0,0,
+0,0,0,0,1523,0,0,0,0,0,0,0,0,0,0,757,7,0,0,0,0,0,0,0,0,0,0,530,588,0,0,0,0,0,0,
+0,0,0,786,0,0,0,0,0,580,627,88,447,57,0,0,0,0,0,0,0,0,845,735,0,0,0,0,0,31,15,0,
+460,521,12,424,0,0,0,1302,0,0,0,0,0,0,0,595,0,0,0,13,548,97,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,1472,452,1767,0,0,0,0,0,0,0,0,0,0,115,0,0,0,0,0,0,1543,0,1111,0,0,0,0,
+1,0,359,488,0,267,0,0,0,1983,0,0,0,0,0,0,0,1155,0,1575,0,1438,31,0,0,377,101,0,
+0,0,0,0,0,0,0,0,0,0,0,0,476,0,0,0,0,0,0,0,0,2023,0,0,0,0,0,1836,0,0,0,0,35,843,
+0,0,0,0,0,0,0,554,0,0,0,536,625,207,0,1371,0,0,0,424,785,336,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,896,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,27,750,0,0,0,0,238,0,0,
+0,0,0,383,0,0,0,0,0,0,0,0,603,725,11,0,0,0,0,0,0,0,0,0,476,0,0,0,0,0,1552,0,0,0,
+0,0,0,0,680,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,435,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1431,0,0,13,112,0,0,356,0,0,0,0,0,0,0,0,0,0,1963,0,0,0,1244,18,0,0,0,0,0,0,867,
+0,0,0,0,0,0,50,708,73,592,0,502,0,0,0,0,0,0,161,347,0,0,0,0,470,33,0,246,571,10,
+0,465,614,0,237,0,0,0,0,0,24,18,0,506,0,0,0,0,0,0,33,309,0,0,0,0,0,0,0,0,0,0,
+140,0,0,0,0,1056,0,0,0,1704,0,0,0,0,0,0,0,1036,0,0,0,0,0,0,0,0,0,1315,432,86,
+264,524,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,107,0,0,0,0,0,123,927,0,0,957,1149,0,0,
+0,0,0,778,0,502,196,0,0,0,0,1312,0,0,0,0,0,0,0,855,0,0,0,0,0,0,0,0,0,0,45,1400,
+0,0,0,1003,0,0,0,0,0,1097,0,0,0,0,0,0,0,0,545,612,0,0,0,0,0,0,0,0,0,0,0,0,54,0,
+0,0,0,172,0,0,0,1029,0,0,0,0,0,0,0,0,0,568,0,0,0,732,617,0,0,974,94,989,733,0,0,
+0,0,0,0,1789,0,0,665,2015,0,0,0,0,0,0,806,287,0,0,0,0,0,1539,0,0,0,0,0,0,0,0,0,
+0,182,1563,0,0,0,0,0,0,0,0,0,484,0,0,0,0,0,1623,0,0,0,0,0,0,0,0,878,1833,0,1569,
+0,0,0,0,0,0,0,0,93,0,715,994,0,0,0,0,0,63,0,591,0,0,0,0,0,0,0,749,0,0,0,0,547,
+366,0,0,0,1747,0,0,0,0,0,0,0,89,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1463,0,772,
+893,0,0,0,48,0,0,941,0,0,690,1785,106,440,0,0,0,0,0,0,0,0,0,0,32,0,332,216,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,852,0,
+0,416,564,0,918,0,1764,0,0,3,0,0,274,0,0,0,0,501,0,0,0,0,0,0,0,851,743,0,49,0,
+879,0,0,47,0,0,0,0,0,0,865,0,1202,0,0,0,0,0,0,47,272,0,0,0,0,0,0,0,0,0,0,0,1455,
+0,0,0,0,891,1911,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,761,0,0,0,0,0,0,0,0,0,407,0,
+183,0,0,490,0,0,0,0,0,0,0,35,731,0,0,0,0,0,0,0,819,0,0,0,0,0,0,0,0,0,0,0,0,0,
+575,0,0,0,0,45,818,0,0,77,222,0,0,0,0,849,1880,0,0,0,633,0,1308,0,0,0,0,0,0,0,0,
+0,0,86,0,0,0,0,0,0,0,0,0,0,0,0,0,0,817,0,0,0,0,0,0,0,0,0,882,0,0,0,914,0,0,0,0,
+0,0,0,0,0,0,865,0,0,426,399,58,0,0,0,0,0,0,538,102,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,876,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,139,566,0,63,12,0,0,0,
+0,0,0,0,0,0,0,0,0,0,3,114,0,0,0,0,0,0,0,0,576,0,0,0,0,0,0,0,0,933,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,692,0,0,0,0,0,0,0,0,0,0,0,0,752,0,0,0,0,
+0,0,0,0,375,0,1011,0,0,96,0,0,0,0,0,0,0,0,0,148,0,0,0,0,0,0,0,0,0,0,0,337,56,
+666,0,246,394,0,0,0,0,0,0,0,0,437,0,0,0,506,0,0,0,0,1003,0,1163,0,328,0,0,0,0,0,
+0,0,0,1000,0,0,0,0,0,744,101,0,0,0,0,0,726,0,0,176,0,146,9,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,839,0,0,0,0,0,0,223,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,246,1931,29,0,0,1771,0,0,0,0,0,846,6,157,0,0,0,0,0,0,0,0,0,875,0,0,477,
+773,177,639,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1747,0,0,0,0,158,873,0,659,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,391,0,0,0,0,0,0,0,0,0,0,0,0,668,883,0,78,628,0,0,0,
+0,0,0,0,0,0,0,0,0,1460,0,962,0,0,0,0,0,460,0,0,0,0,0,0,0,0,0,0,0,0,0,0,34,199,0,
+0,0,388,474,0,271,0,333,608,0,0,0,0,0,0,49,0,988,0,707,617,0,0,0,0,0,0,0,756,0,
+0,0,0,0,1583,0,0,0,0,0,0,0,0,0,0,285,0,0,0,0,0,0,0,0,0,0,0,0,0,0,344,0,0,0,0,0,
+0,0,0,515,1709,0,0,0,0,0,0,0,0,404,0,0,0,0,500,0,0,0,0,0,0,0,0,0,68,216,0,0,0,0,
+0,0,0,488,353,0,0,177,236,0,0,458,490,0,0,0,0,0,0,756,1504,0,757,0,1735,0,0,108,
+598,0,0,0,0};
+BROTLI_INTERNAL const uint8_t kStaticDictionaryHashLengths[32768] = {
+8,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,0,0,12,0,0,0,0,4,22,5,0,
+4,0,0,0,0,0,0,0,0,0,0,0,0,14,6,0,0,0,5,0,0,0,0,0,0,0,7,13,0,0,4,0,0,0,0,0,0,0,0,
+0,6,0,0,0,0,8,0,0,0,0,0,0,7,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,4,0,0,0,4,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,10,4,0,5,13,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,8,7,0,0,9,0,8,0,0,0,0,0,0,6,0,
+0,9,0,0,0,11,0,0,6,8,7,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,7,0,0,0,6,8,0,0,0,0,0,
+0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,9,0,0,0,8,4,13,7,0,0,0,0,0,
+7,0,5,0,0,0,0,8,5,0,5,0,0,8,7,0,0,0,0,0,0,0,0,0,0,9,0,0,0,8,0,0,0,10,4,0,5,0,4,
+0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,8,7,0,4,9,4,0,0,0,0,0,0,
+9,0,0,0,8,5,0,0,0,6,0,0,0,0,0,0,0,0,0,7,18,0,0,0,0,4,9,0,0,4,0,6,0,0,0,6,0,6,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,5,8,7,0,0,0,
+0,9,0,0,0,0,0,0,0,8,6,10,6,0,0,0,4,0,6,8,6,0,0,0,4,0,0,0,0,0,5,0,0,0,6,0,0,0,0,
+10,0,12,7,0,0,0,0,0,4,0,0,0,0,0,5,0,0,8,7,0,0,0,0,0,0,0,0,9,5,0,0,0,0,0,0,0,0,0,
+0,0,0,0,6,11,0,0,0,0,0,0,0,0,0,8,7,0,0,10,0,0,0,0,0,0,0,0,6,10,0,17,0,8,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,8,6,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+7,0,0,11,4,0,5,0,0,0,0,0,0,0,0,0,0,10,5,0,6,8,5,0,0,0,0,0,0,0,0,0,0,11,5,0,0,0,
+0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,9,0,0,0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,8,7,0,0,0,0,0,
+0,0,0,0,0,0,5,0,0,0,6,0,0,10,0,0,0,20,0,0,0,0,0,0,0,0,6,9,5,0,0,0,0,10,4,8,0,0,
+4,13,0,0,0,0,0,0,0,9,0,9,0,0,0,0,0,0,0,0,0,0,0,0,4,8,6,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,12,0,0,4,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,12,5,0,0,10,4,10,7,13,
+0,0,0,0,0,0,0,0,6,0,6,0,6,0,0,0,0,0,0,19,0,0,4,12,6,9,0,0,0,0,4,0,4,11,0,0,0,0,
+0,0,0,12,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,4,0,0,0,0,0,0,0,0,0,6,0,0,0,0,
+0,5,0,0,0,0,0,6,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,8,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,9,6,0,0,0,0,0,4,0,4,0,0,0,0,0,0,0,0,0,4,0,0,0,
+6,0,0,0,0,0,0,0,0,0,0,13,6,0,0,0,0,0,0,0,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,0,6,0,0,
+0,0,0,5,0,0,0,0,14,4,0,0,0,4,12,5,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,8,6,0,
+0,0,0,0,0,12,0,9,6,0,0,0,0,13,0,0,5,0,0,0,0,0,4,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,13,0,9,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,5,0,0,0,6,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,8,7,8,4,0,0,0,0,0,0,0,0,0,0,0,7,0,7,0,0,0,4,0,
+0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,6,8,4,0,0,0,0,0,6,0,7,0,
+0,0,0,0,0,0,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,7,0,0,0,0,0,0,9,5,0,0,
+0,0,0,7,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,9,4,0,0,0,0,0,0,0,4,
+12,5,11,0,0,0,0,0,0,0,0,0,8,7,0,5,0,0,8,7,0,5,0,0,0,0,8,0,0,0,0,7,0,4,10,0,0,0,
+0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+13,5,0,0,0,4,0,0,0,0,0,6,0,0,0,0,0,0,14,5,0,0,0,7,0,0,10,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,6,0,4,0,5,0,0,0,0,8,5,0,0,0,0,0,0,9,5,9,0,0,0,0,0,0,0,0,6,9,0,
+0,4,0,0,0,7,0,0,0,6,0,0,10,4,0,0,0,0,0,6,0,0,10,0,0,0,8,5,0,0,0,0,0,0,0,0,10,0,
+0,0,0,0,18,4,12,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,8,7,0,0,0,
+0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,8,4,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,
+0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,8,0,0,0,0,0,0,6,0,0,0,4,10,5,0,0,0,0,0,0,0,0,0,0,
+0,4,8,7,0,0,8,6,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,
+0,0,0,8,6,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,6,0,7,0,0,0,0,0,0,
+0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,8,7,0,0,0,0,8,0,12,6,0,6,0,0,0,0,9,7,11,7,0,0,0,
+0,0,0,0,0,0,0,0,0,11,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,10,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,
+0,0,0,6,0,0,0,7,0,4,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,14,0,0,0,0,0,8,4,0,4,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,20,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,12,5,0,7,0,5,0,0,10,0,0,7,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,6,0,4,9,7,0,0,0,
+0,0,7,0,0,0,0,0,0,10,0,9,0,9,0,0,0,0,0,0,0,0,4,9,0,0,0,0,6,0,0,0,0,0,0,0,0,11,4,
+0,6,0,0,0,0,0,0,8,0,8,0,0,0,0,0,0,0,0,0,0,4,0,0,0,5,0,0,0,0,0,0,0,0,13,6,0,0,11,
+0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,0,0,0,0,6,18,0,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,
+0,5,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,6,0,0,0,0,9,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,11,
+4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,4,0,0,0,0,8,
+6,0,0,0,0,0,0,9,6,0,0,0,0,0,4,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,0,0,
+0,6,0,6,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,6,0,6,0,0,10,6,0,0,0,7,0,0,8,0,8,7,0,
+0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,20,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,9,0,0,0,0,6,0,0,0,0,0,0,0,5,0,0,18,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,
+0,0,0,8,7,0,0,0,0,0,0,0,0,12,0,12,0,0,0,11,6,0,5,0,0,12,0,12,5,0,7,11,6,0,0,11,
+0,0,0,12,0,0,4,12,7,8,6,0,0,0,0,8,5,0,0,0,0,0,0,0,4,11,0,0,6,0,7,0,0,0,0,0,0,0,
+5,0,6,0,0,0,0,8,0,10,0,0,0,0,0,0,0,0,0,0,0,9,7,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,
+0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,0,0,10,0,0,5,0,0,12,6,0,0,0,0,0,0,10,6,0,0,0,0,8,
+6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,5,0,0,0,0,11,0,10,6,0,0,8,6,0,0,0,6,0,7,10,6,0,
+0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,10,7,0,0,0,0,
+10,6,0,0,0,0,0,0,8,5,11,0,8,4,0,0,0,4,0,0,0,0,9,4,8,0,0,0,0,0,0,0,11,6,0,0,0,0,
+10,7,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,7,0,0,0,0,9,6,0,5,0,7,0,0,0,0,0,7,0,0,11,0,0,
+0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,
+0,0,0,0,13,0,8,6,13,0,0,0,11,7,0,7,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,6,0,0,9,6,0,6,0,0,0,0,0,5,0,0,0,0,0,0,0,0,
+0,0,0,0,0,5,9,0,0,0,0,0,0,0,0,0,0,4,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,9,7,0,7,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,
+5,11,5,0,0,0,0,0,0,0,0,0,4,0,7,0,6,0,0,0,6,20,0,0,0,10,7,0,5,14,4,0,0,0,0,0,0,0,
+0,0,6,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,
+0,0,6,0,4,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,9,7,0,0,11,6,15,0,0,0,0,0,
+10,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,7,0,0,0,0,0,0,0,0,9,7,13,0,0,0,0,0,
+0,7,0,0,8,6,0,0,0,0,0,0,0,0,9,4,0,0,0,0,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,5,0,0,0,0,0,0,0,0,0,0,0,0,8,5,0,4,0,0,0,0,0,0,0,0,0,0,12,6,8,0,12,0,0,7,0,0,0,
+0,0,5,10,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,
+14,0,0,0,0,0,0,0,0,0,0,0,0,5,0,5,8,7,10,7,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,18,6,
+14,7,0,0,0,0,0,0,0,0,11,6,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,11,7,0,0,10,7,0,0,0,6,8,6,0,0,0,0,0,0,0,6,0,0,
+19,0,0,0,9,5,0,0,0,0,0,0,11,7,0,0,0,7,0,6,0,0,11,0,0,0,0,4,8,0,0,0,0,0,0,0,0,6,
+0,0,0,0,0,6,0,0,8,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,7,
+0,7,0,0,0,7,15,0,0,5,0,0,0,0,10,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,7,0,0,
+0,0,0,0,0,0,9,6,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+11,7,0,0,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,
+0,0,5,0,4,0,0,0,4,0,4,0,0,0,0,0,0,0,0,0,6,0,0,0,0,11,6,0,0,8,5,14,0,0,4,0,0,0,7,
+17,0,0,0,0,0,0,0,13,5,0,0,0,0,0,5,0,0,0,5,0,0,0,0,16,6,0,4,0,0,0,0,0,0,12,0,0,0,
+0,0,0,6,0,0,0,0,0,0,0,0,0,0,12,5,0,5,0,6,10,0,12,0,0,0,0,0,0,0,0,7,0,0,0,0,8,4,
+0,0,0,0,0,0,0,0,0,0,8,7,0,0,8,0,0,0,8,0,0,6,0,7,0,0,0,5,0,6,0,4,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,22,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,
+0,0,0,0,0,0,0,13,0,0,0,0,0,0,0,18,0,0,0,9,4,0,0,8,0,9,7,0,0,0,0,0,0,8,6,0,0,0,0,
+0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,9,7,0,0,0,6,0,0,14,0,0,0,0,
+0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,7,10,4,
+0,6,0,0,0,0,0,0,8,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,9,6,0,0,0,0,0,0,
+0,0,11,6,12,7,0,0,0,0,0,0,0,6,0,5,0,0,0,0,0,0,9,6,11,6,0,0,0,0,9,5,0,0,0,0,0,0,
+0,6,8,5,0,0,0,0,8,0,10,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,
+5,10,7,0,0,0,5,8,7,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,4,8,7,0,0,0,6,0,0,
+0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,22,
+0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,5,0,0,0,0,0,0,0,
+0,0,0,0,0,17,0,0,6,0,6,12,4,19,6,0,0,0,0,16,0,0,0,0,7,15,7,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,4,10,4,0,0,8,7,0,7,0,0,9,
+4,0,6,0,0,0,4,0,5,0,0,0,7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,7,10,0,0,0,0,0,11,7,0,0,
+0,0,12,6,0,0,0,0,0,0,0,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,
+0,0,0,0,0,0,0,0,0,10,4,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,8,7,0,0,
+0,0,0,0,0,6,0,0,0,4,0,0,11,4,0,0,12,7,0,0,0,0,9,0,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,
+4,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,0,0,9,4,0,6,0,0,0,0,0,4,
+0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,6,0,0,0,5,0,0,0,0,0,0,0,0,0,7,9,6,0,7,0,
+0,0,0,0,0,0,6,0,0,0,0,8,6,0,0,0,0,10,6,11,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,5,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,5,0,4,8,0,0,0,0,0,9,7,0,0,0,0,0,0,
+13,5,0,0,0,0,8,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,8,5,0,0,11,7,0,0,0,0,0,0,8,6,0,
+0,0,0,0,7,0,4,0,0,0,0,0,0,0,5,0,6,0,5,0,0,0,0,0,0,0,0,0,0,0,0,10,4,9,0,0,0,0,0,
+0,4,0,0,0,0,10,5,10,7,0,0,0,0,0,0,0,0,16,7,0,0,0,0,0,7,0,0,0,0,11,0,0,0,0,0,0,0,
+0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,5,0,4,0,0,0,7,0,0,0,0,0,0,13,0,0,
+0,0,0,0,0,0,0,0,7,0,4,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,13,7,0,7,0,4,16,0,0,0,0,6,8,7,9,7,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,
+0,6,0,0,8,5,0,4,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,5,11,7,0,0,11,
+0,0,0,0,0,9,5,0,4,0,0,0,0,9,7,8,6,0,0,0,0,0,0,10,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,
+0,7,0,0,0,0,0,0,0,0,0,0,0,4,10,6,0,7,0,0,0,0,0,0,0,5,0,0,0,0,0,0,10,7,10,0,0,0,
+0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,7,0,6,8,7,12,4,0,0,0,0,0,0,0,5,14,
+0,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,
+6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,4,0,0,20,4,0,0,0,7,0,6,0,0,0,0,0,0,0,0,8,0,
+0,6,15,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,12,0,0,0,9,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,5,0,0,0,0,0,0,8,6,0,0,18,0,0,0,10,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,9,6,0,
+6,0,0,0,0,0,0,0,0,9,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,9,0,9,0,0,4,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,9,5,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,10,0,0,0,0,7,0,0,0,0,0,0,0,0,0,7,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,8,0,8,0,0,0,16,0,0,0,0,0,0,0,
+0,0,0,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,8,0,0,0,11,0,0,0,0,0,0,0,0,0,0,
+6,0,0,0,0,11,0,0,0,9,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,7,0,7,0,6,
+0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,
+0,0,0,0,0,0,0,6,0,0,18,0,8,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,7,0,4,0,0,0,
+0,0,0,0,0,0,0,8,0,0,0,0,0,16,0,0,0,0,0,16,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,18,0,0,0,0,0,0,0,0,0,9,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,4,0,
+0,0,0,0,0,0,0,9,4,0,0,0,0,12,5,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,12,5,0,0,0,0,0,0,0,5,0,0,10,6,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,9,0,0,0,11,0,0,6,0,6,0,0,
+0,7,0,0,0,0,0,0,8,0,0,0,0,6,0,0,0,0,0,0,19,0,0,0,12,0,9,0,0,0,0,0,10,7,0,0,0,0,
+0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,16,7,12,
+0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,12,6,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,10,5,0,0,0,0,0,0,0,4,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,7,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,4,0,0,0,0,0,0,0,4,0,0,9,0,0,0,8,0,12,4,0,0,0,0,
+0,4,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,5,0,
+0,0,0,0,0,13,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,0,0,8,6,0,6,0,0,0,0,0,0,
+0,4,0,0,0,0,0,6,0,0,9,0,0,0,0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,0,0,10,6,0,0,0,0,8,
+6,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,7,0,0,0,0,0,7,0,6,
+10,7,0,0,10,5,11,6,0,0,0,0,0,7,16,0,0,0,0,6,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,5,0,0,0,7,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,
+0,0,0,0,0,8,7,0,0,0,0,11,6,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+8,7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,12,7,0,7,0,0,0,
+0,0,0,0,6,0,0,0,0,9,0,0,0,23,0,0,0,0,0,10,5,0,0,0,0,0,0,0,0,0,4,0,0,11,7,10,0,0,
+0,0,0,0,0,0,0,0,0,0,6,0,0,8,7,0,7,0,0,8,7,8,0,0,0,0,0,0,0,0,0,0,0,14,5,0,0,0,0,
+0,0,0,0,18,6,8,7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,11,0,0,0,9,7,12,6,0,0,0,0,0,0,0,0,
+0,0,12,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,7,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,6,8,7,0,0,0,6,10,0,0,0,9,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,6,
+10,7,0,0,0,7,0,0,8,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,19,0,0,0,0,0,0,
+0,0,0,8,7,8,6,0,0,11,7,10,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,4,8,7,0,0,0,0,0,0,0,0,
+0,5,0,0,13,0,0,0,0,5,0,0,9,7,0,0,0,0,0,0,0,4,0,0,11,0,0,7,0,0,0,0,0,0,0,0,0,6,0,
+0,0,0,0,0,12,7,19,0,8,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,10,6,8,0,0,0,0,0,0,0,0,0,0,
+6,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,7,0,0,12,0,0,0,0,6,9,6,
+14,0,0,0,0,0,0,6,0,5,0,0,8,7,0,0,0,6,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,4,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,5,0,
+7,0,0,10,0,9,7,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,12,6,0,0,0,0,0,5,0,6,0,0,0,0,
+0,0,0,0,0,0,0,6,0,0,0,0,9,7,0,0,0,0,0,0,11,6,0,0,0,0,0,0,0,0,0,0,11,7,0,0,13,7,
+0,0,0,0,0,0,0,0,12,0,0,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,6,11,5,0,5,13,0,8,0,
+0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,11,5,
+9,6,0,0,0,4,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,10,0,0,0,8,5,0,0,9,0,0,0,8,7,9,0,0,0,0,0,0,0,0,7,0,6,0,0,0,0,0,0,0,0,0,
+0,11,0,13,6,0,0,9,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,
+0,0,0,0,0,5,21,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24,5,0,0,0,0,0,0,0,0,10,0,8,0,
+0,6,0,0,0,4,0,0,9,0,0,0,0,0,0,0,0,0,0,4,0,0,8,6,0,6,0,7,10,0,8,4,0,4,0,0,0,0,0,
+5,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,6,12,0,0,7,0,0,0,5,0,0,
+0,0,0,0,0,0,0,6,0,0,8,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+15,7,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,24,7,0,0,0,0,0,0,0,0,0,
+7,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,6,0,
+0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,4,12,0,0,7,0,0,0,0,0,5,0,0,0,0,0,0,0,0,15,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,8,0,0,0,
+0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,9,0,9,6,
+0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,8,4,0,7,0,0,0,0,0,0,0,0,
+22,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,4,0,7,0,0,21,7,0,7,9,6,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,8,0,0,6,
+0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,23,0,0,0,0,7,0,0,0,
+4,0,0,0,0,0,0,0,0,9,4,11,7,0,5,0,0,0,0,11,0,0,4,20,0,0,0,0,0,0,0,0,0,0,0,11,5,0,
+7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+21,0,0,0,0,0,0,7,0,0,0,0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,11,6,0,0,0,0,0,0,0,0,9,6,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,5,0,4,9,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,
+0,0,0,10,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,8,7,0,0,11,7,0,0,0,0,0,0,0,4,
+0,4,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,8,7,0,
+0,0,0,0,0,0,0,0,6,0,0,21,6,0,0,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,14,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,8,0,0,7,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,
+0,0,0,8,7,0,0,11,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,0,0,7,13,7,10,4,0,
+0,0,6,0,0,0,0,0,0,0,0,0,5,10,0,0,0,0,0,0,5,0,0,0,7,0,0,0,0,0,0,8,4,0,0,0,0,0,6,
+0,0,0,0,0,0,0,0,0,0,12,7,0,6,0,0,10,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,6,0,
+0,0,0,0,7,0,0,8,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,10,5,0,6,0,0,0,0,0,4,0,0,0,0,
+0,0,0,0,0,4,0,0,0,0,9,0,11,4,0,0,0,6,0,0,0,5,12,7,0,5,0,0,0,0,0,4,0,0,0,7,0,0,0,
+0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,13,6,10,0,0,0,17,0,0,4,0,0,0,0,0,6,0,4,0,5,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,11,7,0,0,0,7,0,0,0,6,0,0,0,0,0,0,
+0,6,0,4,0,0,0,0,8,0,0,0,0,5,0,0,0,0,0,4,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,9,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,12,0,0,
+0,0,7,0,0,0,0,0,0,0,0,0,0,0,7,0,0,16,4,0,0,11,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+8,7,0,4,0,0,0,0,0,0,0,4,0,0,0,0,0,0,8,6,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,
+7,0,0,0,0,0,0,9,0,0,0,0,0,0,0,12,5,10,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,
+5,18,7,0,0,14,0,0,0,0,0,0,0,9,4,0,7,0,0,0,0,0,0,0,5,0,0,0,6,0,0,0,6,0,0,0,0,0,0,
+8,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,0,0,7,0,0,0,0,0,0,11,0,0,0,
+10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,14,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+11,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,14,6,0,0,0,0,11,4,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,10,7,0,6,0,0,9,0,9,5,0,0,0,0,0,
+0,0,0,10,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,8,5,0,0,0,0,0,0,0,0,0,0,11,4,0,6,
+0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,12,4,0,6,8,6,0,0,0,0,0,0,0,0,0,0,8,0,0,5,0,0,0,0,0,0,0,7,0,0,13,0,0,0,0,0,0,0,
+0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,12,7,0,6,0,0,0,
+0,0,0,0,0,0,0,0,0,13,4,0,7,0,0,0,7,0,7,0,0,0,0,0,0,0,0,10,4,0,0,0,0,0,0,0,0,0,0,
+9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,10,6,21,5,0,0,0,0,8,0,0,0,0,4,0,
+7,0,0,0,0,0,0,11,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,4,0,0,0,0,0,0,
+0,7,9,6,11,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,7,10,0,0,0,0,0,0,6,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,19,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,18,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,7,0,0,0,0,0,0,9,4,10,4,0,7,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,9,7,9,7,10,4,0,7,0,0,0,0,0,0,0,6,12,0,
+0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,20,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,
+0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,8,0,
+0,0,0,0,0,5,0,0,8,7,0,0,0,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,
+0,0,0,0,4,0,0,8,0,0,6,0,0,0,7,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,7,9,7,0,0,0,4,8,0,0,0,0,6,11,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,10,0,0,0,0,0,0,0,13,4,0,0,
+12,6,0,6,0,0,0,0,8,7,0,7,0,0,0,0,0,6,0,0,0,0,0,0,12,6,0,4,0,0,0,0,0,0,0,0,0,0,9,
+7,22,0,0,0,0,4,0,0,0,0,0,6,0,0,0,4,0,0,9,0,0,6,0,0,24,7,0,7,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,10,6,0,5,0,0,0,0,0,0,0,7,0,0,8,0,0,0,0,0,0,0,10,5,0,0,0,0,0,0,0,0,0,7,0,
+7,0,0,0,0,0,0,13,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,0,
+0,0,0,0,0,7,12,0,9,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,8,0,0,0,0,0,0,0,0,4,0,0,0,7,0,
+0,0,0,8,7,0,0,0,0,0,0,0,0,0,4,18,0,0,0,0,0,10,0,0,5,0,0,11,0,0,0,0,0,0,5,0,6,0,
+0,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,
+4,0,0,0,0,0,0,10,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,
+0,0,0,5,8,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,20,7,0,0,0,0,0,0,0,0,0,0,0,4,9,0,12,
+6,8,0,14,7,0,5,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,10,0,0,
+0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,9,6,0,7,12,0,0,0,0,4,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,
+0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,4,0,0,9,0,
+12,6,0,5,0,0,0,6,0,4,0,6,0,0,0,0,0,0,0,0,10,7,0,0,0,0,0,0,8,0,0,0,0,4,0,0,0,0,
+10,0,0,0,0,0,0,0,8,6,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,5,0,0,0,0,0,0,0,0,0,0,0,
+6,0,0,12,6,20,5,0,0,0,0,0,0,0,0,0,0,0,0,9,5,0,5,0,0,0,6,13,7,0,0,0,0,15,6,0,0,0,
+6,0,0,13,7,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,5,0,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,
+10,6,0,0,0,0,0,6,0,0,0,0,9,0,0,0,0,0,19,6,0,0,0,0,0,0,0,0,0,0,13,0,11,0,0,0,0,0,
+0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,0,0,10,0,0,6,0,0,0,0,8,0,0,
+0,9,0,15,4,0,6,0,0,0,0,0,6,12,0,0,0,0,0,0,0,14,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,
+0,0,0,0,0,8,7,0,0,0,0,0,6,10,0,0,0,0,0,0,0,0,7,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,7,10,5,0,0,0,0,8,0,0,0,0,4,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,6,12,0,0,0,10,7,0,5,0,6,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,6,0,4,0,0,0,0,0,7,0,0,0,0,0,0,0,4,9,6,0,0,0,7,0,0,0,0,0,0,0,0,8,6,0,0,
+0,0,0,0,0,4,12,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,7,0,
+0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,12,6,0,6,9,4,0,0,8,4,0,6,
+0,0,0,0,0,4,0,0,0,0,0,0,0,6,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,8,0,0,6,13,4,0,5,8,0,0,0,0,0,0,0,8,0,0,0,10,5,0,0,9,0,0,0,0,0,0,6,0,0,
+24,0,0,0,0,0,0,0,8,0,0,7,0,0,12,0,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,7,0,
+6,8,0,10,0,9,7,0,0,0,5,0,0,0,0,0,0,0,4,8,5,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,0,4,0,0,0,0,0,6,0,0,0,0,0,5,0,0,0,0,8,0,0,
+0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,10,4,0,0,0,0,0,0,0,6,0,0,0,4,20,0,0,7,
+10,6,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,0,0,0,9,6,0,0,0,0,0,0,0,4,
+12,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,9,4,0,5,0,0,
+0,0,0,0,0,6,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,6,9,0,0,0,0,7,0,0,0,0,0,6,0,5,0,0,0,0,0,0,0,0,9,0,0,0,
+0,6,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,17,7,0,0,13,6,14,6,0,0,0,0,
+8,0,0,0,0,0,0,7,12,7,8,7,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,4,0,0,0,0,0,4,0,
+0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,12,4,0,0,10,7,0,0,0,
+0,0,0,10,0,0,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,12,0,0,6,
+0,0,0,0,0,0,0,0,8,7,12,0,0,0,0,0,0,6,0,6,0,4,0,0,18,6,0,0,0,6,0,0,0,0,0,6,10,6,
+0,0,0,0,0,0,8,7,14,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,
+0,0,0,8,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,8,7,0,0,10,5,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,
+0,0,9,4,8,0,0,0,0,0,0,4,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,4,0,0,0,0,
+0,6,0,0,9,7,0,0,0,0,0,5,0,0,0,0,8,7,0,0,14,0,0,0,0,6,0,0,0,0,0,0,9,6,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,5,0,7,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,
+0,0,0,6,0,0,0,6,0,4,0,0,0,0,0,4,0,0,0,0,12,0,0,7,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,
+0,12,0,16,6,0,0,0,0,0,0,11,7,0,4,8,7,0,0,0,0,0,6,0,0,0,0,16,0,0,0,0,6,0,0,0,0,0,
+0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,10,7,0,0,0,0,0,0,12,7,0,0,0,0,0,0,0,0,0,0,
+0,0,10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,13,4,0,0,10,0,0,0,0,0,0,0,0,0,19,0,0,0,
+0,0,0,0,0,0,0,0,0,0,8,6,22,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,
+5,0,0,0,0,0,5,0,0,0,0,0,5,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+4,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,7,0,0,18,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,14,7,0,0,11,5,0,0,0,5,0,0,0,0,12,5,0,0,0,0,0,0,0,0,0,0,24,6,0,0,
+0,7,0,4,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,7,0,4,0,0,0,0,8,7,0,0,
+9,6,0,0,14,5,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,12,6,0,0,0,0,0,0,0,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,7,0,0,0,5,0,0,
+0,0,12,7,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,6,0,0,13,7,0,0,0,0,0,0,14,0,11,4,0,
+0,0,4,0,0,0,0,14,5,0,0,0,0,0,5,11,5,0,0,0,0,22,5,0,0,0,0,0,7,0,0,0,0,0,4,0,0,0,
+4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,17,0,10,0,0,0,8,0,0,0,19,
+5,18,7,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,10,6,0,6,0,0,0,0,10,4,0,4,0,
+0,0,0,0,0,14,7,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,8,0,9,6,12,0,0,6,0,0,0,0,0,0,0,0,
+12,0,10,6,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,4,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,5,13,0,9,7,0,0,0,0,0,0,0,0,0,0,0,7,9,7,0,0,8,0,0,0,0,0,
+22,0,0,0,0,0,0,0,23,6,14,0,0,0,0,0,0,7,0,0,0,0,11,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,
+0,0,10,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,8,5,0,0,0,0,0,0,0,0,0,7,11,6,21,0,0,0,0,0,
+0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,
+0,0,0,0,0,0,0,4,9,7,0,0,0,0,0,0,12,0,0,0,0,7,0,0,0,0,0,0,0,0,10,4,0,0,0,0,0,0,9,
+0,0,0,20,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,11,7,0,0,0,0,0,0,0,6,15,0,0,
+0,0,0,0,0,0,0,0,0,0,0,12,4,0,5,0,0,0,0,0,0,11,7,17,6,0,0,0,0,0,0,15,6,0,7,0,0,0,
+0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,6,0,5,
+0,0,11,0,11,7,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,
+17,0,0,0,0,6,0,0,0,5,0,0,0,0,0,0,8,7,9,6,0,0,14,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,
+8,7,0,4,0,0,0,0,0,0,0,6,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,
+0,0,0,5,0,4,0,0,8,7,0,6,12,5,0,7,18,7,0,0,8,5,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,
+10,0,11,0,0,0,0,0,0,0,0,0,0,0,9,0,0,4,0,6,0,7,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,
+7,0,0,0,0,8,0,0,0,15,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,0,0,0,
+0,0,6,0,0,0,0,23,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,5,0,0,0,0,0,0,8,6,0,0,
+0,0,0,0,12,7,9,7,0,0,10,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,9,0,8,7,0,0,0,
+6,0,6,0,4,0,5,0,0,0,0,0,5,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,7,10,5,0,0,11,6,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,4,9,7,0,
+0,0,0,11,7,0,0,0,0,0,5,0,0,0,7,0,0,0,0,23,6,11,4,0,0,0,0,0,0,9,0,0,0,10,6,0,0,0,
+0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,10,6,0,0,0,7,0,0,
+0,0,0,0,0,0,0,0,20,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,
+6,11,7,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,0,0,6,0,0,0,5,0,6,0,6,0,0,0,0,0,0,0,0,0,0,
+0,6,0,0,0,0,8,7,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,4,10,0,8,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,10,6,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,
+0,0,0,0,0,0,10,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,11,6,0,4,0,0,14,5,0,7,0,0,0,0,0,6,16,0,0,0,0,0,0,0,10,0,0,7,15,0,0,0,11,7,0,0,
+0,0,0,0,0,0,0,0,8,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,5,0,0,0,
+0,8,0,0,6,0,0,0,0,0,0,9,5,0,0,23,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,6,0,
+0,0,0,0,0,0,7,0,0,0,0,15,7,0,0,0,0,8,0,0,0,14,0,0,0,0,0,0,0,16,7,0,0,0,0,0,7,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,12,6,11,7,
+9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,
+7,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,12,0,10,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,8,0,0,5,8,7,10,6,0,0,0,7,0,0,0,0,12,6,
+0,0,9,0,0,0,12,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,4,10,0,0,0,10,5,0,0,0,0,0,0,9,6,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,6,0,0,9,5,0,4,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,9,0,0,5,0,0,8,7,8,
+6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,10,0,9,4,0,0,0,0,0,0,0,6,
+11,0,0,0,0,0,0,0,0,0,0,0,8,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,8,7,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,
+0,0,0,10,0,0,0,8,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,
+0,0,8,4,0,5,0,0,0,0,0,0,0,7,0,0,0,6,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,22,0,0,0,0,0,0,0,8,5,0,0,0,
+0,0,0,0,7,0,0,0,6,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,5,0,6,0,7,0,0,0,0,
+20,0,0,0,0,0,0,0,0,0,0,7,9,0,0,0,0,0,0,6,0,6,0,7,0,0,0,7,0,0,0,0,0,0,0,4,0,0,0,
+0,0,0,14,7,0,0,0,5,0,0,22,4,10,0,0,0,0,0,0,4,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,11,5,13,0,0,0,0,0,0,0,0,0,8,0,0,7,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,0,10,7,0,
+0,0,0,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,7,0,7,14,6,0,0,0,0,9,5,
+0,0,0,0,0,6,0,0,0,5,10,0,8,6,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,6,0,0,8,4,0,6,0,
+0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,
+14,0,0,5,0,0,18,0,8,4,0,6,0,0,20,0,13,0,0,0,0,7,0,4,0,0,0,0,0,4,8,4,0,0,0,0,0,6,
+0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,4,0,0,0,0,0,0,0,0,14,0,0,0,0,0,9,7,0,0,9,0,0,0,0,
+0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,20,0,14,0,0,4,0,6,8,5,0,0,0,0,0,7,0,0,0,0,0,0,
+0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,10,4,12,7,0,6,0,0,9,7,10,5,
+0,0,8,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,0,0,18,0,0,0,14,7,0,0,0,0,0,4,
+0,0,0,0,0,0,17,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,4,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,
+0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,8,5,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,5,0,7,0,0,0,0,0,
+7,0,0,0,0,0,0,0,0,0,7,0,6,0,0,0,0,0,0,0,0,8,5,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,5,0,
+0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,23,0,0,7,0,0,0,0,0,0,
+0,0,0,0,0,0,0,4,0,0,0,0,0,0,12,7,8,4,0,0,0,0,0,0,0,0,0,6,0,0,9,5,0,0,0,7,0,0,0,
+0,0,0,0,0,0,4,10,0,0,7,0,0,0,5,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,5,0,0,18,7,
+0,0,8,0,0,5,0,0,10,0,0,0,0,0,0,6,0,0,0,0,0,5,0,7,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,
+6,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,6,0,0,10,0,0,5,10,4,0,0,12,0,0,0,0,
+6,22,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,5,0,0,0,0,0,7,0,5,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,6,0,7,0,0,0,6,0,6,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,7,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,
+0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,16,6,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,12,7,0,0,0,0,9,0,0,0,0,6,0,0,11,0,0,0,0,0,13,0,9,6,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,4,0,0,10,7,0,0,0,7,0,6,0,
+0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,11,0,15,0,22,7,0,4,0,6,0,0,0,0,0,7,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,4,0,7,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,
+18,0,0,0,0,0,0,0,0,0,14,0,0,4,0,0,0,0,8,7,9,0,0,0,0,0,9,0,0,0,14,0,0,0,0,0,0,0,
+0,0,11,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,7,0,0,0,6,0,6,0,0,0,0,8,0,0,0,0,
+0,11,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,9,4,0,0,0,0,0,4,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,8,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,
+0,0,0,0,0,0,8,6,0,0,9,5,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,5,0,
+0,10,6,9,0,0,0,0,6,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,
+11,7,12,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,4,0,5,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,
+0,0,0,0,6,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,5,0,0,10,6,
+0,0,0,4,0,7,13,0,0,4,0,0,11,4,0,6,0,0,0,0,0,6,8,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,5,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,20,5,0,0,0,0,12,6,0,0,0,0,
+11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,11,5,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,
+7,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,4,0,0,0,6,17,0,9,0,10,6,0,6,12,0,0,4,0,0,0,
+0,0,0,0,0,0,0,8,5,12,7,0,4,0,0,0,0,0,0,0,0,0,0,11,0,9,0,10,6,11,5,0,7,0,0,8,0,0,
+7,0,4,0,0,0,7,0,0,0,0,0,0,8,6,0,0,0,6,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,6,0,
+0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,11,0,0,0,0,6,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,10,0,0,0,0,0,8,6,0,0,0,0,0,6,12,0,0,0,0,0,
+0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,6,0,0,16,0,11,5,0,0,0,0,0,
+0,0,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,9,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,6,10,
+7,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,6,0,0,0,0,0,0,9,5,0,0,0,0,8,0,9,0,0,
+0,0,0,0,0,0,7,10,0,13,0,0,6,0,0,0,0,0,0,0,0,0,6,9,4,0,0,0,0,0,0,10,0,0,0,0,0,10,
+0,0,0,0,0,0,0,10,6,11,0,0,0,0,0,9,0,0,0,0,0,0,4,0,0,0,0,0,0,10,5,0,0,0,0,0,6,0,
+0,0,0,0,0,18,4,0,7,0,0,0,0,0,0,24,0,8,6,0,7,0,0,0,0,15,0,0,0,0,0,0,0,0,0,0,0,0,
+0,8,5,0,0,0,0,10,7,0,6,0,0,0,0,0,0,0,0,8,5,10,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,
+6,0,0,8,7,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,4,0,5,15,0,0,0,0,7,0,7,0,0,0,0,
+0,0,0,0,0,6,10,5,0,0,0,6,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,7,0,0,12,0,0,0,0,0,0,0,0,
+0,0,5,0,0,0,0,0,0,14,4,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,11,0,10,4,9,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,7,0,0,0,
+0,0,0,0,0,0,0,0,7,13,7,0,0,0,0,0,0,0,5,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,
+0,0,0,0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,8,0,10,6,0,4,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,
+0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,9,7,0,0,0,0,0,6,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,0,6,0,0,0,
+0,0,0,0,5,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,6,0,0,0,5,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,11,0,0,0,0,6,0,0,0,0,0,0,0,6,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,22,0,0,
+6,0,0,0,0,0,0,0,6,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,
+0,0,0,0,0,0,0,6,0,6,0,0,0,5,0,0,0,0,0,0,0,5,0,0,10,0,11,5,0,0,0,0,0,0,14,7,9,7,
+0,6,0,0,0,0,0,4,0,0,0,0,0,0,11,7,0,6,0,0,0,0,0,0,9,7,0,4,0,0,0,7,0,0,0,0,0,5,0,
+0,0,0,0,5,0,0,0,7,0,0,0,0,0,5,0,0,0,0,17,5,0,0,8,0,0,0,0,6,9,4,0,0,0,0,0,0,0,0,
+8,7,11,7,9,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,6,9,5,0,0,8,6,0,0,0,5,0,
+0,0,0,9,0,0,0,9,6,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,
+0,0,0,0,4,0,0,0,0,10,0,0,0,0,0,0,0,0,4,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,4,0,0,0,5,0,0,0,0,0,7,0,0,0,0,0,7,13,5,0,0,0,7,0,0,0,0,0,7,9,6,11,7,0,7,0,0,0,
+0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,8,5,0,0,0,5,9,4,0,0,0,0,0,0,0,0,8,4,0,0,0,0,
+24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,
+0,0,0,0,6,0,0,0,7,0,0,0,6,0,0,0,0,0,0,0,0,0,5,11,6,0,4,0,7,20,0,8,5,9,5,9,0,0,6,
+0,0,0,0,0,0,0,0,0,0,0,7,23,5,0,0,8,4,0,0,10,0,0,6,0,5,0,0,0,0,0,0,0,0,0,0,0,7,0,
+0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,9,0,0,0,
+10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,
+6,0,0,0,0,14,0,18,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,9,6,0,4,0,0,0,0,0,0,8,4,
+11,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,0,0,0,12,0,10,7,0,0,10,0,0,0,0,
+0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,6,0,0,0,0,8,
+6,10,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,4,0,6,0,4,0,0,0,0,0,5,0,0,
+0,0,0,0,0,0,0,7,0,0,0,7,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,17,7,11,0,0,0,0,0,0,0,0,0,0,4,12,6,0,0,0,5,0,0,0,6,0,0,0,0,0,0,0,0,0,0,
+0,5,12,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,6,0,6,0,0,20,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,4,
+0,0,0,5,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,6,0,4,13,0,0,7,0,0,0,0,0,0,
+0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,12,6,0,7,0,0,0,0,10,0,23,6,0,0,
+0,4,0,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+10,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,11,0,9,7,0,0,
+0,0,0,0,0,0,0,0,9,7,0,4,0,0,0,0,8,7,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,
+0,0,0,0,0,6,0,0,10,7,10,5,0,0,8,0,8,0,0,0,0,0,0,4,0,5,10,0,0,0,0,0,0,0,9,0,0,6,
+0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,11,7,0,0,0,0,0,0,0,0,9,4,0,0,0,0,0,6,0,0,8,
+7,0,0,0,0,0,5,0,0,0,0,0,0,0,0,10,0,0,0,0,5,0,4,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,24,7,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,6,0,0,9,0,0,0,0,0,0,7,0,6,13,0,8,
+0,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,6,0,0,0,0,8,5,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,
+4,0,0,0,0,0,4,0,0,0,0,0,0,0,6,8,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,4,0,4,0,0,0,5,0,7,0,0,10,0,10,7,0,0,12,5,0,0,9,0,0,0,10,0,
+0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,5,0,0,0,0,0,0,
+12,0,0,0,0,0,8,5,13,6,0,0,0,0,0,0,9,4,0,0,0,0,8,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,
+0,0,6,0,0,14,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,17,6,0,0,0,0,12,6,0,0,0,0,8,0,0,7,0,
+7,0,4,9,0,0,6,0,0,0,6,0,0,0,0,0,0,8,7,0,0,0,0,0,0,11,0,0,4,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,18,7,0,4,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,6,0,0,0,0,0,
+0,0,0,12,5,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,8,0,11,7,0,0,0,0,0,0,0,0,0,4,0,0,0,0,
+11,0,0,0,0,0,0,0,21,0,0,6,10,0,0,0,0,0,9,0,10,0,0,0,0,0,11,0,0,0,0,6,0,0,0,0,0,
+5,0,0,0,0,0,0,10,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,4,0,0,23,7,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,9,7,0,0,0,7,
+0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,6,0,0,
+11,6,0,0,0,0,0,0,0,6,0,0,0,0,10,7,0,0,9,4,0,0,11,0,8,5,0,0,0,7,8,5,22,0,0,0,9,6,
+0,0,0,0,0,0,0,6,10,4,0,0,0,0,0,7,9,4,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,4,0,
+0,0,0,11,6,0,0,0,0,0,0,0,0,0,0,0,7,0,6,0,0,0,0,0,7,0,0,0,0,0,0,0,6,0,6,0,4,0,0,
+0,0,0,0,0,7,0,7,0,4,13,0,0,0,0,0,8,0,0,0,0,7,0,0,0,0,0,0,11,6,0,7,0,0,0,0,9,0,0,
+0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,4,8,0,0,0,0,0,8,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,6,0,0,0,0,13,5,8,0,0,
+0,0,0,0,0,14,0,0,6,0,0,0,0,0,0,0,0,0,7,0,0,17,6,0,0,0,0,13,4,0,0,9,6,0,0,10,5,0,
+0,10,5,0,0,0,0,13,0,0,0,0,6,0,0,0,0,0,0,10,0,12,0,0,0,0,0,0,0,0,0,0,0,8,4,0,4,0,
+0,0,4,0,0,0,0,0,4,0,0,12,0,0,5,9,4,0,0,0,0,0,0,0,0,0,5,8,5,0,0,0,7,0,0,0,0,8,7,
+0,0,0,6,12,5,0,0,0,5,0,0,0,5,0,0,0,0,0,4,12,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,8,7,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,
+0,9,6,0,0,0,0,0,0,0,0,0,4,0,0,0,6,0,0,0,4,11,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,
+0,0,0,0,12,7,0,0,0,7,10,7,0,0,11,0,0,0,0,0,0,0,0,0,11,7,0,0,0,6,0,0,11,0,0,0,0,
+0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,22,0,10,7,0,0,8,5,0,0,0,0,0,5,0,0,0,0,0,0,
+0,0,0,0,9,6,8,7,0,6,0,0,0,0,0,5,0,0,0,0,0,0,8,7,0,0,0,0,9,7,0,0,0,6,0,0,8,7,0,0,
+0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,4,0,5,0,0,0,4,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,6,0,0,0,0,0,0,0,4,0,0,0,0,0,0,9,
+6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,5,0,0,0,0,14,0,0,0,
+9,0,0,0,0,0,0,0,0,0,9,7,12,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,12,0,0,0,0,0,12,7,0,0,0,5,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,10,7,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,6,0,0,0,0,0,0,9,6,0,0,0,0,0,6,0,0,0,0,0,
+0,0,0,0,0,9,0,0,0,0,7,0,6,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,
+0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,6,0,7,12,6,0,0,0,0,0,5,0,0,0,0,0,0,0,0,
+0,7,0,0,8,6,0,0,0,0,10,7,0,0,0,0,0,0,0,6,0,0,0,0,0,6,12,0,0,0,0,0,0,0,0,6,0,0,0,
+0,0,6,0,0,0,6,0,0,0,0,0,6,16,0,0,0,0,0,0,0,0,0,9,0,17,0,14,7,8,0,0,0,0,0,0,6,0,
+0,0,0,0,0,0,0,0,0,11,0,0,6,8,7,0,6,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,0,0,0,
+9,0,0,0,0,7,0,0,0,0,11,5,0,4,9,6,8,0,0,0,0,0,0,0,0,0,10,0,11,7,0,0,0,0,0,0,0,0,
+9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,
+0,0,0,12,0,0,0,0,0,10,5,0,4,0,0,0,0,0,7,10,6,11,6,0,0,0,0,0,0,0,0,0,0,0,0,17,0,
+0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,8,0,0,4,0,0,0,6,0,0,0,
+0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,4,0,0,0,0,9,6,0,0,0,4,0,0,0,0,0,4,10,7,0,7,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,
+0,0,0,0,0,0,6,0,0,0,6,0,6,0,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,18,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,13,0,0,0,0,0,10,0,0,0,0,0,0,0,0,4,
+0,0,0,6,0,0,0,0,0,4,8,0,0,0,11,7,0,0,0,4,0,0,0,0,0,7,0,0,8,5,0,0,16,0,0,0,13,6,
+0,0,0,0,0,0,0,6,0,0,0,0,20,0,11,6,0,0,8,7,0,0,0,0,0,6,17,0,8,0,0,0,0,0,8,7,0,0,
+9,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,
+0,0,4,0,7,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,8,
+0,8,0,0,0,0,0,0,0,11,0,8,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,6,0,0,9,0,
+0,0,0,0,8,0,0,0,0,0,18,0,0,0,0,0,0,4,9,0,0,0,0,0,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,9,6,0,0,0,0,0,0,0,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,8,7,0,0,0,0,0,0,0,0,
+0,4,0,0,0,0,0,0,14,0,0,0,0,7,0,6,0,0,8,0,20,7,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,8,0,0,0,14,0,0,0,0,0,0,0,8,0,0,7,0,6,0,0,0,7,0,0,0,0,0,0,0,0,
+0,0,0,4,12,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,10,6,0,
+5,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,
+0,0,0,5,8,4,0,0,0,0,0,0,0,4,0,0,0,7,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,12,7,0,
+0,0,0,13,6,0,0,0,7,0,0,8,0,0,0,8,0,0,0,0,0,0,0,0,0,0,5,0,0,0,7,0,0,0,0,0,0,11,5,
+0,6,0,0,8,5,0,7,0,0,0,0,0,0,0,7,0,0,0,0,8,6,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,4,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+14,0,10,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,19,0,0,4,0,0,0,7,
+0,0,11,5,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,16,0,10,5,18,0,0,7,9,6,0,5,0,0,0,0,0,
+0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,5,0,0,0,7,0,6,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,6,0,0,0,4,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,6,0,0,0,7,23,0,0,0,0,5,0,0,0,0,0,0,8,5,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,14,0,20,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,
+11,0,0,0,0,7,0,0,0,0,15,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,7,0,0,0,0,
+0,4,0,0,0,0,10,0,0,0,0,0,9,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,10,0,11,6,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,5,0,0,11,0,0,0,0,7,0,0,0,0,0,0,8,7,0,
+4,0,0,0,0,11,0,0,0,0,0,11,0,0,5,0,0,8,7,0,4,0,7,0,0,0,0,0,0,0,6,0,0,0,0,0,4,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,6,0,5,0,0,0,0,0,0,0,
+0,0,4,11,5,10,7,0,7,0,0,9,6,9,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,9,4,0,4,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,8,6,0,0,0,0,11,7,0,0,0,0,0,0,0,0,0,0,11,7,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,8,5,0,0,8,0,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,4,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,
+10,7,0,0,0,6,0,0,0,0,0,0,8,0,0,6,0,0,0,6,10,0,0,0,0,0,0,0,0,0,0,0,8,5,0,0,0,6,0,
+0,0,6,0,0,0,0,9,5,8,5,8,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,
+0,8,7,10,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,0,5,0,0,0,6,0,7,0,0,
+10,5,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,11,0,0,0,0,0,13,4,
+0,0,0,4,0,0,0,0,0,5,8,0,0,0,12,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,7,14,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,7,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,4,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,5,0,0,15,6,10,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,14,6,10,0,0,0,0,0,0,0,0,6,0,
+0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,6,0,5,11,4,0,6,0,0,0,7,0,0,0,0,
+0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,5,0,0,8,5,0,0,0,0,0,0,0,0,0,0,
+0,0,10,0,0,0,0,0,9,6,9,4,0,0,0,4,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,8,5,0,
+0,0,0,0,0,0,0,0,0,0,4,0,0,11,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,5,0,0,0,0,0,0,
+0,0,0,7,12,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,
+4,9,6,0,4,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,6,0,
+7,8,6,0,0,0,0,0,0,0,4,0,0,9,6,0,0,0,0,0,0,0,0,0,6,0,5,0,4,0,0,0,0,0,0,0,5,0,0,0,
+0,0,5,0,0,0,7,12,7,0,0,0,0,0,0,18,4,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,6,0,0,0,
+0,12,0,0,7,0,0,0,0,0,7,0,0,13,0,0,6,0,0,0,0,8,7,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,7,10,5,0,0,8,0,0,0,0,0,0,0,8,6,0,7,0,0,8,4,0,4,0,0,0,0,10,4,0,0,14,0,
+0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,17,0,0,0,0,0,0,6,0,0,0,0,8,6,0,0,10,5,0,0,0,0,8,
+6,0,0,0,6,0,0,0,7,0,0,0,0,0,6,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,12,0,0,0,0,6,
+8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,
+0,0,0,6,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,4,24,0,0,
+0,0,0,12,6,0,0,10,6,0,5,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,17,7,0,5,0,0,0,
+0,0,0,0,0,0,0,0,0,0,6,11,5,9,0,8,7,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,10,7,0,0,0,0,0,0,0,7,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,5,8,7,0,0,0,
+0,8,5,0,0,0,0,10,7,0,7,0,0,0,0,0,0,0,0,0,0,13,6,0,0,0,0,0,0,0,0,0,6,0,4,0,0,0,0,
+0,6,12,0,8,7,0,0,0,0,0,0,0,0,0,0,16,0,10,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,22,0,0,0,
+0,0,0,0,0,0,0,0,0,0,13,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,22,0,0,6,0,0,21,0,0,0,22,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+6,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,6,0,0,0,5,0,0,0,0,0,7,8,0,0,0,0,6,14,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,6,0,0,0,0,0,0,
+0,0,0,0,0,6,0,0,0,0,8,5,0,0,11,7,0,6,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,
+6,0,0,0,5,0,0,0,0,0,0,0,0,0,4,0,0,8,7,0,0,0,0,8,5,11,7,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,4,0,0,0,0,8,5,0,0,10,0,0,4,13,7,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,5,0,0,13,6,
+0,6,0,7,0,0,8,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,15,0,0,0,10,7,0,0,0,0,0,
+7,0,0,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,19,0,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,6,0,5,
+0,7,0,0,0,0,0,0,0,0,0,6,0,0,11,4,0,0,0,6,0,0,13,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,8,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,
+0,7,0,0,0,0,0,0,11,7,0,0,0,0,0,6,0,0,10,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,5,11,6,
+0,0,0,0,0,0,0,0,10,0,0,0,0,6,0,0,0,0,0,0,8,7,0,0,0,5,0,0,0,5,0,0,0,0,0,0,0,0,0,
+0,0,0,8,7,0,0,0,0,9,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,0,0,0,10,0,
+0,6,0,0,13,0,0,0,0,0,0,0,9,6,0,0,8,6,8,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,4,0,
+0,9,7,0,0,0,0,0,0,11,0,0,0,10,7,0,0,0,0,0,0,0,0,9,6,0,0,12,4,0,4,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,6,0,0,0,0,21,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,5,0,0,
+9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,
+16,0,0,4,0,0,0,0,0,7,0,0,0,6,0,6,0,0,11,0,0,0,0,5,0,0,0,0,0,0,0,4,8,5,0,0,0,0,0,
+0,14,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,
+0,0,8,0,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,4,0,0,0,4,0,0,0,
+0,0,0,0,6,9,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,14,7,0,0,9,7,0,0,11,0,0,0,0,0,10,
+4,11,5,13,6,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,5,0,0,0,0,0,4,0,0,9,0,0,0,0,
+0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,6,12,5,0,0,0,6,14,0,0,0,0,0,0,0,0,0,0,4,9,4,
+0,0,0,0,0,5,0,0,0,0,0,0,0,4,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,5,0,0,
+0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,11,6,0,0,13,7,0,0,13,6,0,7,0,0,0,0,0,0,8,6,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,10,6,0,4,0,0,12,6,0,0,0,0,0,0,0,0,10,6,
+0,0,0,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,6,0,
+0,0,0,0,7,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,6,0,
+0,0,7,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,
+0,0,0,5,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,
+0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,8,7,0,0,8,5,0,0,0,4,9,5,0,0,0,7,10,6,0,0,
+0,0,0,0,9,7,0,0,8,5,8,0,8,4,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,5,0,5,0,0,0,0,0,0,0,
+0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,
+0,11,7,0,0,0,7,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,5,0,0,0,7,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,9,7,0,0,0,0,8,5,0,4,0,0,0,0,0,6,0,6,14,
+6,0,0,0,0,9,6,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,6,0,0,0,0,14,7,9,7,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,16,
+0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,14,0,
+0,6,0,0,8,6,0,0,0,0,0,6,0,0,12,0,0,0,0,0,8,5,0,7,11,0,0,5,0,4,0,0,0,6,0,0,0,0,0,
+0,0,0,0,0,0,0,9,6,0,4,0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,6,0,0,0,0,0,0,10,5,0,0,0,0,
+0,4,0,0,0,7,11,6,0,4,8,5,9,5,0,0,0,5,0,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,8,5,14,7,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,16,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,9,6,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,9,0,0,0,12,5,0,0,0,0,0,0,0,4,10,5,0,0,0,0,0,0,0,0,0,0,0,6,0,
+0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,4,0,0,0,6,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,10,4,0,0,0,0,0,5,0,0,0,4,
+0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,8,0,10,7,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,10,7,0,0,0,0,0,0,0,0,15,0,0,0,
+0,0,0,0,0,0,0,7,0,0,0,0,0,7,10,7,9,7,0,0,0,7,0,0,8,0,0,0,0,0,0,0,9,0,0,0,8,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,8,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,7,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,15,7,12,6,0,0,0,7,0,5,0,0,0,0,0,0,0,0,0,0,0,0,18,0,0,5,0,0,0,0,
+0,0,0,6,9,5,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,9,7,0,0,14,0,0,0,11,7,0,0,0,0,0,
+0,0,0,0,0,0,4,0,0,11,7,0,0,0,0,8,0,0,0,0,0,0,6,8,7,0,0,0,7,10,4,0,0,0,0,0,0,0,0,
+0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,10,0,0,0,0,0,0,
+6,0,6,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,11,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,7,0,0,10,7,0,0,0,0,9,7,0,0,0,0,0,0,13,7,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,12,0,
+0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,9,6,0,0,11,0,0,
+0,0,0,14,4,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,23,7,0,0,
+0,0,0,6,0,7,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,0,20,
+7,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,8,0,0,0,0,0,0,0,0,0,11,5,0,0,0,0,0,0,0,0,0,0,10,4,0,0,0,5,8,5,10,4,0,0,0,0,0,
+0,13,6,9,7,0,0,10,7,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,6,0,0,0,7,0,6,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,10,7,0,0,
+0,0,0,0,0,0,0,0,12,4,0,0,0,0,8,7,0,0,0,0,0,7,0,6,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,
+0,0,0,0,6,0,6,9,6,0,0,12,5,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,6,0,0,0,0,
+0,0,0,0,0,0,0,0,0,5,8,7,9,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,11,
+4,0,0,0,0,0,0,8,0,0,0,10,7,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,0,
+0,0,0,0,0,5,0,6,0,0,10,0,14,0,0,0,0,0,0,0,23,0,0,0,12,0,10,5,0,0,0,0,0,0,0,0,0,
+5,0,0,0,0,8,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,22,0,8,0,0,0,0,6,0,0,0,0,0,0,0,5,0,0,
+0,0,0,0,0,6,18,4,0,0,0,7,10,6,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,
+0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,7,10,0,0,0,0,0,0,6,0,0,0,0,11,5,0,0,0,0,0,0,0,0,
+15,0,8,6,0,0,13,7,0,0,0,0,0,7,0,0,0,0,0,7,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,9,5,9,
+0,0,6,8,6,0,0,0,0,10,0,0,0,18,5,0,0,0,5,0,7,0,0,0,0,8,6,0,0,0,0,9,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,14,0,23,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,6,0,0,0,5,0,
+0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,8,5,0,0,0,0,0,0,0,0,9,0,0,0,0,4,0,0,0,0,0,0,0,0,
+0,0,0,0,20,5,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,9,5,0,0,0,0,0,0,8,4,24,0,0,0,0,0,0,
+0,0,0,0,0,0,0,9,7,0,0,0,0,10,5,0,0,8,5,0,0,0,0,0,0,0,0,12,7,0,6,0,0,10,6,0,0,0,
+0,14,0,0,4,9,5,0,0,0,0,0,0,9,0,0,0,0,0,0,6,0,0,0,0,0,4,0,0,8,0,0,0,0,0,11,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,8,5,11,7,0,4,0,0,10,0,0,0,0,
+0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,11,6,0,0,0,0,0,5,14,6,0,0,0,0,10,0,0,
+0,13,4,0,0,0,0,0,0,0,0,0,0,0,6,0,0,10,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,7,12,0,10,6,0,0,0,0,0,0,10,0,0,0,0,0,10,0,9,
+7,0,0,0,0,0,0,0,0,0,0,0,0,0,7,8,0,0,0,0,0,0,0,0,0,0,0,0,4,0,7,0,0,0,0,9,7,0,0,0,
+0,0,0,0,0,0,0,0,0,24,0,11,7,0,7,0,0,0,0,0,0,8,6,0,0,0,0,0,0,8,7,0,0,0,0,0,5,0,0,
+0,6,9,0,0,0,23,5,0,0,0,0,0,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,7,0,0,0,
+0,0,0,0,0,0,0,0,0,0,6,0,0,18,4,0,0,11,7,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,
+0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,9,0,0,0,11,0,0,0,23,0,0,
+0,10,4,0,0,0,0,0,7,0,0,0,7,0,0,0,0,0,4,0,0,0,0,0,7,0,0,19,0,11,0,0,0,0,0,12,7,0,
+0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,5,0,0,0,0,0,5,0,0,0,0,0,5,0,0,0,0,0,0,0,6,0,0,
+9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,4,0,0,0,0,10,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,4,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,22,0,8,7,10,4,11,0,13,5,8,7,9,0,8,7,0,0,0,7,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,
+0,8,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,4,0,0,0,4,11,0,0,6,0,0,8,5,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,8,5,0,0,
+20,0,0,0,0,0,0,0,0,0,11,0,0,0,0,5,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,7,0,0,14,0,0,0,9,0,13,7,0,0,0,0,0,6,0,7,0,0,8,6,10,6,0,0,8,6,0,0,0,6,0,
+0,12,6,9,0,0,0,0,0,0,5,9,0,12,4,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,8,5,0,0,0,0,0,
+0,0,4,8,0,0,6,8,0,0,0,0,0,0,0,0,0,13,6,0,7,0,0,0,0,0,6,8,7,8,6,0,0,0,7,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,18,0,11,4,0,0,0,5,0,0,0,0,0,0,0,0,0,0,
+0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,14,
+6,0,0,0,0,12,7,8,0,0,0,0,0,0,0,8,7,0,0,0,0,10,4,0,0,0,0,0,0,10,0,0,6,0,0,0,0,0,
+0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,15,6,9,7,0,0,0,0,0,0,15,6,11,7,0,0,0,7,0,0,21,0,0,
+0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,17,6,0,0,10,5,0,5,0,0,0,0,0,0,0,0,0,7,
+0,0,10,0,0,0,0,0,0,0,0,4,11,5,0,0,0,0,16,7,0,0,0,0,0,6,0,0,8,7,0,4,0,0,10,0,0,0,
+0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,8,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,
+0,0,0,10,4,0,0,0,0,0,0,0,0,0,6,0,5,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,
+0,7,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,6,10,7,0,0,0,0,0,0,0,0,8,4,0,0,10,0,0,0,0,4,0,6,0,6,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,7,17,0,0,0,0,0,
+0,0,0,0,0,0,10,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+6,0,0,0,5,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,5,0,4,0,0,0,0,0,6,0,0,0,0,0,0,10,5,0,0,
+0,5,0,0,0,0,9,0,19,7,0,0,0,0,0,7,0,0,0,0,10,6,0,0,0,6,0,5,0,0,0,0,0,0,0,0,0,6,8,
+0,0,0,0,0,11,0,0,0,0,0,0,6,0,0,0,0,0,7,9,0,15,0,0,0,0,0,0,0,0,0,0,4,0,0,0,5,0,0,
+0,0,0,0,0,6,0,0,0,0,0,0,0,4,0,0,0,0,9,0,0,0,0,0,0,0,0,6,0,7,0,0,0,0,0,0,0,6,0,0,
+0,0,0,6,10,0,0,0,0,0,0,0,23,0,14,0,0,0,0,7,0,0,0,0,0,7,0,0,9,0,0,0,0,7,0,0,0,0,
+0,6,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,
+0,0,0,0,0,9,5,0,0,0,0,0,4,0,0,0,0,9,5,0,0,0,0,22,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,22,0,0,0,0,0,0,0,10,0,0,0,0,0,0,5,0,4,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,6,11,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,14,7,0,0,12,7,0,0,0,
+0,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,8,6,10,0,0,0,0,0,0,0,0,0,10,7,8,5,0,0,0,0,0,0,
+0,0,8,4,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,5,0,0,9,5,0,0,0,0,0,5,0,0,0,0,0,4,0,0,0,
+0,0,0,0,0,0,0,12,4,11,0,0,0,9,0,11,7,0,0,0,0,0,0,10,6,0,0,0,6,0,0,0,0,15,5,0,0,
+11,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,4,0,4,0,6,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,8,0,0,0,19,7,0,4,0,0,9,0,0,0,0,0,10,0,
+0,6,0,0,13,0,12,6,0,0,0,0,0,0,0,0,10,7,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,13,7,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,4,9,0,0,0,10,0,0,0,0,0,0,0,
+0,5,0,0,0,0,0,0,10,0,23,6,0,0,0,6,8,0,0,0,0,0,0,0,0,0,17,7,0,0,0,0,11,6,22,5,0,
+0,9,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,5,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,4,11,0,9,4,0,0,
+0,7,0,7,0,0,0,0,0,0,12,4,0,0,0,0,0,0,0,0,0,0,0,0,11,4,0,0,0,0,0,0,0,0,0,0,0,0,0,
+4,0,0,11,5,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,8,6,0,0,0,4,0,0,0,0,
+0,0,0,0,0,7,0,0,0,4,0,0,10,4,0,0,0,0,0,0,0,7,0,7,0,0,0,6,0,0,0,0,8,6,0,6,0,6,0,
+0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,6,22,6,12,0,0,6,0,0,0,6,0,0,0,0,0,7,0,0,0,0,11,0,0,0,
+9,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,6,0,0,0,6,0,6,0,0,8,7,0,0,0,4,9,7,19,0,0,0,0,0,0,0,0,0,9,6,10,6,0,6,0,0,0,
+4,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,6,16,7,10,6,0,0,23,6,11,7,0,4,0,0,0,0,0,0,0,0,0,
+5,0,0,0,0,10,7,0,0,0,0,0,7,0,0,0,0,0,0,15,0,10,0,0,0,14,6,0,0,0,0,0,0,0,0,0,0,0,
+5,0,0,0,0,0,0,0,5,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,5,0,0,11,5,0,0,0,0,0,0,0,0,0,0,
+0,4,0,0,0,0,0,6,0,0,10,0,0,0,0,7,0,0,0,0,0,0,10,6,0,0,0,0,8,4,0,0,0,7,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,7,12,5,0,0,0,0,
+0,6,0,0,0,0,9,6,0,0,0,0,0,0,0,6,9,0,0,0,0,6,0,0,0,0,8,7,0,0,0,0,0,0,0,6,0,0,0,0,
+0,0,0,0,0,0,10,5,0,0,0,0,0,0,8,6,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,8,5,0,0,0,0,0,7,0,7,0,4,0,0,10,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,5,0,0,0,0,13,
+7,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,7,0,0,13,0,0,0,0,0,0,0,0,7,10,5,0,0,0,0,0,0,9,7,0,0,8,6,9,
+5,0,0,0,0,0,6,12,0,0,0,0,0,0,0,18,6,0,0,0,0,0,0,0,0,19,7,0,4,0,0,0,0,9,5,0,5,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,7,0,0,0,0,0,0,14,0,0,0,23,7,8,7,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,22,0,0,7,0,0,0,0,0,0,0,0,9,7,8,4,0,
+0,0,0,0,0,0,0,8,5,0,6,0,0,0,0,0,6,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,
+8,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,12,5,0,0,0,0,0,0,0,0,0,0,8,6,0,0,11,7,0,0,0,
+0,12,0,8,6,19,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,11,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,11,7,0,0,0,0,0,4,10,0,0,0,0,0,0,0,8,7,0,0,0,0,14,0,8,0,0,6,10,0,0,
+0,0,0,0,0,12,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,0,0,
+0,0,0,0,13,0,0,0,0,0,0,0,11,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,
+0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,5,0,0,0,6,0,0,0,5,0,7,0,0,0,
+0,0,6,0,0,21,7,0,0,9,6,0,0,0,6,0,0,13,7,0,0,0,5,0,0,0,0,0,4,0,6,0,0,0,0,0,0,0,0,
+0,0,0,4,0,0,0,0,0,0,11,5,0,6,0,0,10,5,0,0,0,0,0,0,0,0,9,6,0,0,8,7,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,9,0,0,0,0,0,0,6,0,0,0,0,15,4,0,0,12,7,0,0,0,6,
+0,7,0,0,8,0,9,5,0,4,0,0,0,6,0,6,0,0,23,4,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,4,0,0,8,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,6,0,0,0,0,0,0,0,0,0,
+7,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,12,6,0,0,0,0,0,0,10,7,0,7,0,0,0,0,0,0,0,0,0,0,
+9,0,0,0,0,0,8,0,0,0,0,4,0,0,0,0,0,0,0,0,0,4,11,5,0,0,0,6,0,6,0,0,0,0,0,0,0,6,0,
+4,0,0,0,0,0,0,0,0,0,0,0,5,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,8,7,0,0,0,6,0,6,0,
+0,0,0,0,0,0,0,0,5,0,0,0,0,0,5,0,0,0,0,11,0,0,0,0,0,0,0,10,5,9,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,23,7,0,0,0,0,0,7,0,0,10,6,18,0,0,0,
+0,0,0,0,8,7,0,6,0,0,0,0,0,0,8,5,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,
+0,0,0,0,0,6,0,0,0,4,12,7,0,0,0,0,0,0,0,0,10,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,13,5,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,0,0,0,
+11,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,
+0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,10,0,11,0,0,0,0,0,0,0,0,0,
+17,5,0,4,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,4,0,0,0,0,8,7,0,0,0,0,0,0,0,
+0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,
+10,0,0,0,8,6,0,0,0,7,0,0,0,0,0,0,8,0,0,0,14,0,0,0,0,7,0,0,0,4,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,9,4,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,
+10,0,0,0,16,5,0,0,0,0,0,0,8,0,0,4,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,10,0,0,0,
+0,0,0,0,0,5,0,0,0,0,12,5,0,7,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,7,0,
+0,0,0,0,0,0,0,12,6,0,0,0,0,0,7,0,6,0,6,12,6,0,0,0,0,0,0,0,4,8,7,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,20,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,10,6,8,0,0,
+6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+16,0,8,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,23,5,0,0,0,7,0,6,0,
+0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,14,0,0,0,0,7,0,0,0,4,17,5,0,0,0,0,11,0,9,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,6,0,0,0,5,0,7,0,0,0,0,0,0,0,0,8,0,0,0,
+12,6,0,0,0,0,0,0,13,0,0,0,0,7,9,0,0,0,0,0,0,0,0,0,0,5,0,0,0,7,10,7,12,0,0,0,9,0,
+0,0,14,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,15,6,0,0,23,0,0,7,0,6,0,0,0,7,0,6,
+0,0,0,0,0,0,0,6,0,6,9,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,8,7,9,4,0,0,10,0,0,0,10,
+6,0,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,23,0,0,6,0,0,0,0,0,0,9,4,
+0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,9,7,0,0,9,6,0,0,0,0,8,6,0,0,0,0,0,0,0,0,12,0,0,
+0,0,0,8,0,0,6,11,6,0,0,8,7,8,5,0,0,0,0,0,5,0,0,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,0,
+10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,
+7,0,0,0,0,9,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,8,0,0,0,0,6,12,5,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,10,0,10,
+7,0,0,8,0,0,0,0,4,0,0,0,6,0,0,0,6,0,0,0,6,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,5,0,
+0,0,4,0,0,0,0,0,4,0,0,0,0,0,0,0,6,0,6,0,5,0,0,0,0,8,0,0,0,10,7,0,0,0,0,10,0,0,0,
+0,0,13,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,19,7,0,4,12,0,8,0,0,0,0,6,0,0,0,0,
+0,0,0,6,0,0,0,0,0,0,0,0,0,4,0,0,0,0,18,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,
+0,14,0,0,4,0,0,0,6,0,0,0,6,0,0,0,7,0,0,0,0,0,0,10,4,0,0,9,7,0,0,11,0,0,0,0,0,0,
+7,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,4,0,0,12,0,0,0,
+0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,22,5,9,7,0,0,0,0,0,0,0,0,0,
+0,0,6,0,0,9,6,0,5,0,0,0,0,0,0,10,5,0,0,8,6,0,6,10,5,0,0,0,6,0,0,0,6,0,0,20,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,6,0,0,0,0,17,4,0,7,0,6,
+0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,
+0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,
+0,0,7,0,0,8,6,12,0,0,7,18,7,0,0,8,4,0,0,0,0,9,6,0,0,0,0,0,0,0,0,13,0,0,6,0,0,0,
+0,0,0,0,0,0,0,10,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,0,
+0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,8,5,0,0,0,0,0,0,0,0,12,0,0,0,8,0,0,0,0,0,0,
+4,0,0,10,0,16,0,0,0,0,0,0,0,12,7,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,16,6,10,0,0,5,0,0,0,0,0,6,0,0,0,0,
+0,7,0,0,0,7,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,5,8,7,0,7,0,0,0,0,0,0,0,0,8,0,0,6,0,0,0,6,0,0,0,4,0,0,0,0,
+8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,7,0,0,8,0,0,0,
+9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,7,13,5,0,5,0,0,0,7,8,4,0,0,0,0,0,0,0,
+0,12,0,0,0,0,0,0,0,0,0,0,0,8,6,0,6,0,0,11,0,0,0,0,0,0,0,0,6,0,0,0,0,0,4,0,0,0,0,
+0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,11,6,0,0,10,6,0,0,
+0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,
+0,0,0,6,0,0,0,7,0,0,9,0,8,7,11,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,9,6,10,5,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,10,7,0,0,0,0,0,0,11,0,9,6,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,5,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,15,5,12,5,
+0,0,0,0,0,0,12,7,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,12,6,0,
+0,0,0,24,4,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,0,0,
+0,0,0,4,10,4,0,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,9,0,11,0,0,0,0,0,0,0,0,0,0,6,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,
+0,0,8,0,0,0,0,7,0,0,0,0,0,0,10,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,10,7,0,0,0,0,0,
+0,0,0,0,0,14,7,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,4,0,0,0,6,0,0,0,0,0,6,0,0,0,6,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,11,6,0,0,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,7,20,7,11,4,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,7,9,6,0,0,12,7,0,0,0,0,0,0,10,0,12,0,
+0,0,0,0,0,4,9,6,13,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,5,0,0,0,0,0,0,8,0,0,0,0,0,0,
+0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,11,0,9,0,0,0,0,4,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,8,5,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,
+0,4,0,5,0,0,0,0,0,0,0,0,0,4,0,0,0,0,9,7,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,
+0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,
+0,0,0,0,8,7,0,0,0,0,0,0,12,0,0,6,0,0,0,0,0,0,0,6,8,4,0,0,10,7,0,0,10,0,0,0,0,0,
+0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,7,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,5,
+0,4,0,0,0,0,0,6,0,0,0,0,0,0,8,0,0,6,0,0,0,6,0,0,0,0,0,7,0,5,8,4,0,0,9,0,0,0,0,4,
+0,0,0,0,0,0,0,0,0,5,0,0,15,6,8,6,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,9,6,0,0,0,0,0,0,0,7,0,0,0,4,0,
+6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,9,5,0,6,12,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,6,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,0,12,7,0,0,0,0,
+0,0,0,0,0,5,0,5,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,11,4,0,0,0,0,0,0,0,0,0,0,10,
+7,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,7,8,7,9,6,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,5,12,0,
+10,5,12,6,0,0,0,7,0,0,0,0,0,0,0,5,0,0,0,5,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,
+11,7,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,0,6,0,7,0,0,0,0,8,0,8,5,0,6,0,0,0,6,0,0,0,
+0,0,0,0,6,0,6,0,6,9,0,0,5,17,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,7,0,0,
+0,0,0,7,0,0,0,0,16,5,0,0,0,0,0,0,0,4,0,0,0,5,11,5,0,7,0,0,0,4,8,7,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,12,0,0,0,
+0,0,12,0,0,0,0,0,0,0,0,4,10,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,0,0,0,4,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,20,5,0,0,
+10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,12,0,0,0,0,0,0,6,0,0,0,0,0,0,9,4,10,7,0,4,0,0,
+0,0,0,0,10,6,0,0,0,0,8,4,0,7,8,6,0,6,8,0,10,0,0,0,0,0,13,5,0,6,0,0,0,0,0,0,22,4,
+0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,10,
+5,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,10,4,0,0,10,7,0,0,0,0,0,5,0,
+5,8,0,0,0,0,6,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,10,7,0,0,0,4,0,0,0,0,0,6,0,0,
+0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,7,0,0,0,6,0,0,0,0,0,0,0,0,0,
+4,0,0,0,4,10,0,0,6,13,7,8,0,0,0,0,0,0,7,0,0,12,7,0,0,0,0,0,0,10,5,0,0,0,0,0,6,0,
+0,0,0,0,0,0,0,0,0,13,7,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,8,6,0,6,
+0,0,0,0,0,0,0,0,12,0,8,4,0,0,0,0,0,4,0,4,0,0,0,0,0,0,0,5,0,0,0,0,12,5,0,0,0,7,0,
+0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,10,0,0,0,20,0,0,5,0,0,10,
+7,11,7,0,0,0,0,0,0,0,0,0,0,17,0,9,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,10,7,0,4,0,6,0,0,24,0,0,5,0,0,0,0,8,0,0,
+0,0,0,0,0,10,5,0,4,0,6,0,0,8,0,0,0,0,0,0,4,0,6,0,0,0,0,0,0,9,5,0,0,0,0,0,0,0,0,
+0,0,0,6,0,0,0,0,9,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,4,0,7,
+0,0,13,0,0,0,0,0,0,0,11,6,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,
+17,7,0,0,11,6,0,0,0,0,12,6,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,5,0,0,0,6,0,0,0,0,0,0,0,0,0,0,10,0,0,4,8,6,0,0,0,
+0,0,0,9,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,9,5,0,7,18,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,8,0,0,0,
+0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,
+0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,4,0,6,0,0,9,0,0,0,0,0,0,0,0,0,13,0,0,0,0,0,0,0,0,
+0,0,0,8,7,10,0,8,5,0,0,0,0,0,0,0,0,9,0,0,0,10,0,0,0,0,6,0,7,0,4,0,0,0,0,0,0,0,0,
+8,0,0,0,0,0,8,4,0,0,0,0,0,5,0,0,10,0,12,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+4,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,6,11,0,0,
+7,0,0,0,0,0,6,10,5,0,0,0,0,0,0,0,0,0,5,0,0,9,5,12,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,6,0,0,0,0,13,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,
+0,0,0,8,4,0,6,12,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,11,4,0,0,0,6,14,0,11,0,9,6,0,0,0,0,0,0,22,0,12,0,8,6,0,0,0,0,0,0,0,6,0,
+0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,
+10,7,0,0,0,0,0,0,0,0,9,0,0,0,0,4,0,0,0,0,0,0,0,0,0,5,11,0,0,0,0,0,0,0,8,6,0,0,9,
+7,0,0,12,4,0,0,0,0,0,0,12,6,0,6,0,7,0,0,8,5,0,0,0,0};
+/* GENERATED CODE END */
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/dictionary_hash.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/dictionary_hash.h
new file mode 100644
index 0000000000..e553ea5d4e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/dictionary_hash.h
@@ -0,0 +1,25 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Hash table on the 4-byte prefixes of static dictionary words. */
+
+#ifndef BROTLI_ENC_DICTIONARY_HASH_H_
+#define BROTLI_ENC_DICTIONARY_HASH_H_
+
+#include <brotli/types.h>
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+extern const uint16_t kStaticDictionaryHashWords[32768];
+extern const uint8_t kStaticDictionaryHashLengths[32768];
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_DICTIONARY_HASH_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/encode.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/encode.c
new file mode 100644
index 0000000000..491361b82c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/encode.c
@@ -0,0 +1,1997 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Implementation of Brotli compressor. */
+
+#include <brotli/encode.h>
+#include <brotli/shared_dictionary.h>
+#include <brotli/types.h>
+
+#include <stdlib.h>  /* free, malloc */
+#include <string.h>  /* memcpy, memset */
+
+#include "../common/constants.h"
+#include "../common/context.h"
+#include "../common/platform.h"
+#include "../common/version.h"
+#include "backward_references.h"
+#include "backward_references_hq.h"
+#include "bit_cost.h"
+#include "brotli_bit_stream.h"
+#include "compress_fragment.h"
+#include "compress_fragment_two_pass.h"
+#include "dictionary_hash.h"
+#include "encoder_dict.h"
+#include "entropy_encode.h"
+#include "fast_log.h"
+#include "hash.h"
+#include "histogram.h"
+#include "memory.h"
+#include "metablock.h"
+#include "prefix.h"
+#include "state.h"
+#include "quality.h"
+#include "ringbuffer.h"
+#include "utf8_util.h"
+#include "write_bits.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define COPY_ARRAY(dst, src) memcpy(dst, src, sizeof(src));
+
+static size_t InputBlockSize(BrotliEncoderState* s) {
+  return (size_t)1 << s->params.lgblock;
+}
+
+static uint64_t UnprocessedInputSize(BrotliEncoderState* s) {
+  return s->input_pos_ - s->last_processed_pos_;
+}
+
+static size_t RemainingInputBlockSize(BrotliEncoderState* s) {
+  const uint64_t delta = UnprocessedInputSize(s);
+  size_t block_size = InputBlockSize(s);
+  if (delta >= block_size) return 0;
+  return block_size - (size_t)delta;
+}
+
+BROTLI_BOOL BrotliEncoderSetParameter(
+    BrotliEncoderState* state, BrotliEncoderParameter p, uint32_t value) {
+  /* Changing parameters on the fly is not implemented yet. */
+  if (state->is_initialized_) return BROTLI_FALSE;
+  /* TODO(eustas): Validate/clamp parameters here. */
+  switch (p) {
+    case BROTLI_PARAM_MODE:
+      state->params.mode = (BrotliEncoderMode)value;
+      return BROTLI_TRUE;
+
+    case BROTLI_PARAM_QUALITY:
+      state->params.quality = (int)value;
+      return BROTLI_TRUE;
+
+    case BROTLI_PARAM_LGWIN:
+      state->params.lgwin = (int)value;
+      return BROTLI_TRUE;
+
+    case BROTLI_PARAM_LGBLOCK:
+      state->params.lgblock = (int)value;
+      return BROTLI_TRUE;
+
+    case BROTLI_PARAM_DISABLE_LITERAL_CONTEXT_MODELING:
+      if ((value != 0) && (value != 1)) return BROTLI_FALSE;
+      state->params.disable_literal_context_modeling = TO_BROTLI_BOOL(!!value);
+      return BROTLI_TRUE;
+
+    case BROTLI_PARAM_SIZE_HINT:
+      state->params.size_hint = value;
+      return BROTLI_TRUE;
+
+    case BROTLI_PARAM_LARGE_WINDOW:
+      state->params.large_window = TO_BROTLI_BOOL(!!value);
+      return BROTLI_TRUE;
+
+    case BROTLI_PARAM_NPOSTFIX:
+      state->params.dist.distance_postfix_bits = value;
+      return BROTLI_TRUE;
+
+    case BROTLI_PARAM_NDIRECT:
+      state->params.dist.num_direct_distance_codes = value;
+      return BROTLI_TRUE;
+
+    case BROTLI_PARAM_STREAM_OFFSET:
+      if (value > (1u << 30)) return BROTLI_FALSE;
+      state->params.stream_offset = value;
+      return BROTLI_TRUE;
+
+    default: return BROTLI_FALSE;
+  }
+}
+
+/* Wraps 64-bit input position to 32-bit ring-buffer position preserving
+   "not-a-first-lap" feature. */
+static uint32_t WrapPosition(uint64_t position) {
+  uint32_t result = (uint32_t)position;
+  uint64_t gb = position >> 30;
+  if (gb > 2) {
+    /* Wrap every 2GiB; The first 3GB are continuous. */
+    result = (result & ((1u << 30) - 1)) | ((uint32_t)((gb - 1) & 1) + 1) << 30;
+  }
+  return result;
+}
+
+static uint8_t* GetBrotliStorage(BrotliEncoderState* s, size_t size) {
+  MemoryManager* m = &s->memory_manager_;
+  if (s->storage_size_ < size) {
+    BROTLI_FREE(m, s->storage_);
+    s->storage_ = BROTLI_ALLOC(m, uint8_t, size);
+    if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(s->storage_)) return NULL;
+    s->storage_size_ = size;
+  }
+  return s->storage_;
+}
+
+static size_t HashTableSize(size_t max_table_size, size_t input_size) {
+  size_t htsize = 256;
+  while (htsize < max_table_size && htsize < input_size) {
+    htsize <<= 1;
+  }
+  return htsize;
+}
+
+static int* GetHashTable(BrotliEncoderState* s, int quality,
+                         size_t input_size, size_t* table_size) {
+  /* Use smaller hash table when input.size() is smaller, since we
+     fill the table, incurring O(hash table size) overhead for
+     compression, and if the input is short, we won't need that
+     many hash table entries anyway. */
+  MemoryManager* m = &s->memory_manager_;
+  const size_t max_table_size = MaxHashTableSize(quality);
+  size_t htsize = HashTableSize(max_table_size, input_size);
+  int* table;
+  BROTLI_DCHECK(max_table_size >= 256);
+  if (quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {
+    /* Only odd shifts are supported by fast-one-pass. */
+    if ((htsize & 0xAAAAA) == 0) {
+      htsize <<= 1;
+    }
+  }
+
+  if (htsize <= sizeof(s->small_table_) / sizeof(s->small_table_[0])) {
+    table = s->small_table_;
+  } else {
+    if (htsize > s->large_table_size_) {
+      s->large_table_size_ = htsize;
+      BROTLI_FREE(m, s->large_table_);
+      s->large_table_ = BROTLI_ALLOC(m, int, htsize);
+      if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(s->large_table_)) return 0;
+    }
+    table = s->large_table_;
+  }
+
+  *table_size = htsize;
+  memset(table, 0, htsize * sizeof(*table));
+  return table;
+}
+
+static void EncodeWindowBits(int lgwin, BROTLI_BOOL large_window,
+    uint16_t* last_bytes, uint8_t* last_bytes_bits) {
+  if (large_window) {
+    *last_bytes = (uint16_t)(((lgwin & 0x3F) << 8) | 0x11);
+    *last_bytes_bits = 14;
+  } else {
+    if (lgwin == 16) {
+      *last_bytes = 0;
+      *last_bytes_bits = 1;
+    } else if (lgwin == 17) {
+      *last_bytes = 1;
+      *last_bytes_bits = 7;
+    } else if (lgwin > 17) {
+      *last_bytes = (uint16_t)(((lgwin - 17) << 1) | 0x01);
+      *last_bytes_bits = 4;
+    } else {
+      *last_bytes = (uint16_t)(((lgwin - 8) << 4) | 0x01);
+      *last_bytes_bits = 7;
+    }
+  }
+}
+
+/* TODO(eustas): move to compress_fragment.c? */
+/* Initializes the command and distance prefix codes for the first block. */
+static void InitCommandPrefixCodes(BrotliOnePassArena* s) {
+  static const uint8_t kDefaultCommandDepths[128] = {
+    0, 4, 4, 5, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8,
+    0, 0, 0, 4, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7,
+    7, 7, 10, 10, 10, 10, 10, 10, 0, 4, 4, 5, 5, 5, 6, 6,
+    7, 8, 8, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
+    5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4,
+    4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 7, 7, 7, 8, 10,
+    12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
+  };
+  static const uint16_t kDefaultCommandBits[128] = {
+    0,   0,   8,   9,   3,  35,   7,   71,
+    39, 103,  23,  47, 175, 111, 239,   31,
+    0,   0,   0,   4,  12,   2,  10,    6,
+    13,  29,  11,  43,  27,  59,  87,   55,
+    15,  79, 319, 831, 191, 703, 447,  959,
+    0,  14,   1,  25,   5,  21,  19,   51,
+    119, 159,  95, 223, 479, 991,  63,  575,
+    127, 639, 383, 895, 255, 767, 511, 1023,
+    14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    27, 59, 7, 39, 23, 55, 30, 1, 17, 9, 25, 5, 0, 8, 4, 12,
+    2, 10, 6, 21, 13, 29, 3, 19, 11, 15, 47, 31, 95, 63, 127, 255,
+    767, 2815, 1791, 3839, 511, 2559, 1535, 3583, 1023, 3071, 2047, 4095,
+  };
+  static const uint8_t kDefaultCommandCode[] = {
+    0xff, 0x77, 0xd5, 0xbf, 0xe7, 0xde, 0xea, 0x9e, 0x51, 0x5d, 0xde, 0xc6,
+    0x70, 0x57, 0xbc, 0x58, 0x58, 0x58, 0xd8, 0xd8, 0x58, 0xd5, 0xcb, 0x8c,
+    0xea, 0xe0, 0xc3, 0x87, 0x1f, 0x83, 0xc1, 0x60, 0x1c, 0x67, 0xb2, 0xaa,
+    0x06, 0x83, 0xc1, 0x60, 0x30, 0x18, 0xcc, 0xa1, 0xce, 0x88, 0x54, 0x94,
+    0x46, 0xe1, 0xb0, 0xd0, 0x4e, 0xb2, 0xf7, 0x04, 0x00,
+  };
+  static const size_t kDefaultCommandCodeNumBits = 448;
+  COPY_ARRAY(s->cmd_depth, kDefaultCommandDepths);
+  COPY_ARRAY(s->cmd_bits, kDefaultCommandBits);
+
+  /* Initialize the pre-compressed form of the command and distance prefix
+     codes. */
+  COPY_ARRAY(s->cmd_code, kDefaultCommandCode);
+  s->cmd_code_numbits = kDefaultCommandCodeNumBits;
+}
+
+/* Decide about the context map based on the ability of the prediction
+   ability of the previous byte UTF8-prefix on the next byte. The
+   prediction ability is calculated as Shannon entropy. Here we need
+   Shannon entropy instead of 'BitsEntropy' since the prefix will be
+   encoded with the remaining 6 bits of the following byte, and
+   BitsEntropy will assume that symbol to be stored alone using Huffman
+   coding. */
+static void ChooseContextMap(int quality,
+                             uint32_t* bigram_histo,
+                             size_t* num_literal_contexts,
+                             const uint32_t** literal_context_map) {
+  static const uint32_t kStaticContextMapContinuation[64] = {
+    1, 1, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  };
+  static const uint32_t kStaticContextMapSimpleUTF8[64] = {
+    0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  };
+
+  uint32_t monogram_histo[3] = { 0 };
+  uint32_t two_prefix_histo[6] = { 0 };
+  size_t total;
+  size_t i;
+  size_t sink;
+  double entropy[4];
+  for (i = 0; i < 9; ++i) {
+    monogram_histo[i % 3] += bigram_histo[i];
+    two_prefix_histo[i % 6] += bigram_histo[i];
+  }
+  entropy[1] = ShannonEntropy(monogram_histo, 3, &sink);
+  entropy[2] = (ShannonEntropy(two_prefix_histo, 3, &sink) +
+                ShannonEntropy(two_prefix_histo + 3, 3, &sink));
+  entropy[3] = 0;
+  for (i = 0; i < 3; ++i) {
+    entropy[3] += ShannonEntropy(bigram_histo + 3 * i, 3, &sink);
+  }
+
+  total = monogram_histo[0] + monogram_histo[1] + monogram_histo[2];
+  BROTLI_DCHECK(total != 0);
+  entropy[0] = 1.0 / (double)total;
+  entropy[1] *= entropy[0];
+  entropy[2] *= entropy[0];
+  entropy[3] *= entropy[0];
+
+  if (quality < MIN_QUALITY_FOR_HQ_CONTEXT_MODELING) {
+    /* 3 context models is a bit slower, don't use it at lower qualities. */
+    entropy[3] = entropy[1] * 10;
+  }
+  /* If expected savings by symbol are less than 0.2 bits, skip the
+     context modeling -- in exchange for faster decoding speed. */
+  if (entropy[1] - entropy[2] < 0.2 &&
+      entropy[1] - entropy[3] < 0.2) {
+    *num_literal_contexts = 1;
+  } else if (entropy[2] - entropy[3] < 0.02) {
+    *num_literal_contexts = 2;
+    *literal_context_map = kStaticContextMapSimpleUTF8;
+  } else {
+    *num_literal_contexts = 3;
+    *literal_context_map = kStaticContextMapContinuation;
+  }
+}
+
+/* Decide if we want to use a more complex static context map containing 13
+   context values, based on the entropy reduction of histograms over the
+   first 5 bits of literals. */
+static BROTLI_BOOL ShouldUseComplexStaticContextMap(const uint8_t* input,
+    size_t start_pos, size_t length, size_t mask, int quality, size_t size_hint,
+    size_t* num_literal_contexts, const uint32_t** literal_context_map,
+    uint32_t* arena) {
+  static const uint32_t kStaticContextMapComplexUTF8[64] = {
+    11, 11, 12, 12, /* 0 special */
+    0, 0, 0, 0, /* 4 lf */
+    1, 1, 9, 9, /* 8 space */
+    2, 2, 2, 2, /* !, first after space/lf and after something else. */
+    1, 1, 1, 1, /* " */
+    8, 3, 3, 3, /* % */
+    1, 1, 1, 1, /* ({[ */
+    2, 2, 2, 2, /* }]) */
+    8, 4, 4, 4, /* :; */
+    8, 7, 4, 4, /* . */
+    8, 0, 0, 0, /* > */
+    3, 3, 3, 3, /* [0..9] */
+    5, 5, 10, 5, /* [A-Z] */
+    5, 5, 10, 5,
+    6, 6, 6, 6, /* [a-z] */
+    6, 6, 6, 6,
+  };
+  BROTLI_UNUSED(quality);
+  /* Try the more complex static context map only for long data. */
+  if (size_hint < (1 << 20)) {
+    return BROTLI_FALSE;
+  } else {
+    const size_t end_pos = start_pos + length;
+    /* To make entropy calculations faster, we collect histograms
+       over the 5 most significant bits of literals. One histogram
+       without context and 13 additional histograms for each context value. */
+    uint32_t* BROTLI_RESTRICT const combined_histo = arena;
+    uint32_t* BROTLI_RESTRICT const context_histo = arena + 32;
+    uint32_t total = 0;
+    double entropy[3];
+    size_t sink;
+    size_t i;
+    ContextLut utf8_lut = BROTLI_CONTEXT_LUT(CONTEXT_UTF8);
+    memset(arena, 0, sizeof(arena[0]) * 32 * (BROTLI_MAX_STATIC_CONTEXTS + 1));
+    for (; start_pos + 64 <= end_pos; start_pos += 4096) {
+      const size_t stride_end_pos = start_pos + 64;
+      uint8_t prev2 = input[start_pos & mask];
+      uint8_t prev1 = input[(start_pos + 1) & mask];
+      size_t pos;
+      /* To make the analysis of the data faster we only examine 64 byte long
+         strides at every 4kB intervals. */
+      for (pos = start_pos + 2; pos < stride_end_pos; ++pos) {
+        const uint8_t literal = input[pos & mask];
+        const uint8_t context = (uint8_t)kStaticContextMapComplexUTF8[
+            BROTLI_CONTEXT(prev1, prev2, utf8_lut)];
+        ++total;
+        ++combined_histo[literal >> 3];
+        ++context_histo[(context << 5) + (literal >> 3)];
+        prev2 = prev1;
+        prev1 = literal;
+      }
+    }
+    entropy[1] = ShannonEntropy(combined_histo, 32, &sink);
+    entropy[2] = 0;
+    for (i = 0; i < BROTLI_MAX_STATIC_CONTEXTS; ++i) {
+      entropy[2] += ShannonEntropy(context_histo + (i << 5), 32, &sink);
+    }
+    entropy[0] = 1.0 / (double)total;
+    entropy[1] *= entropy[0];
+    entropy[2] *= entropy[0];
+    /* The triggering heuristics below were tuned by compressing the individual
+       files of the silesia corpus. If we skip this kind of context modeling
+       for not very well compressible input (i.e. entropy using context modeling
+       is 60% of maximal entropy) or if expected savings by symbol are less
+       than 0.2 bits, then in every case when it triggers, the final compression
+       ratio is improved. Note however that this heuristics might be too strict
+       for some cases and could be tuned further. */
+    if (entropy[2] > 3.0 || entropy[1] - entropy[2] < 0.2) {
+      return BROTLI_FALSE;
+    } else {
+      *num_literal_contexts = BROTLI_MAX_STATIC_CONTEXTS;
+      *literal_context_map = kStaticContextMapComplexUTF8;
+      return BROTLI_TRUE;
+    }
+  }
+}
+
+static void DecideOverLiteralContextModeling(const uint8_t* input,
+    size_t start_pos, size_t length, size_t mask, int quality, size_t size_hint,
+    size_t* num_literal_contexts, const uint32_t** literal_context_map,
+    uint32_t* arena) {
+  if (quality < MIN_QUALITY_FOR_CONTEXT_MODELING || length < 64) {
+    return;
+  } else if (ShouldUseComplexStaticContextMap(
+      input, start_pos, length, mask, quality, size_hint,
+      num_literal_contexts, literal_context_map, arena)) {
+    /* Context map was already set, nothing else to do. */
+  } else {
+    /* Gather bi-gram data of the UTF8 byte prefixes. To make the analysis of
+       UTF8 data faster we only examine 64 byte long strides at every 4kB
+       intervals. */
+    const size_t end_pos = start_pos + length;
+    uint32_t* BROTLI_RESTRICT const bigram_prefix_histo = arena;
+    memset(bigram_prefix_histo, 0, sizeof(arena[0]) * 9);
+    for (; start_pos + 64 <= end_pos; start_pos += 4096) {
+      static const int lut[4] = { 0, 0, 1, 2 };
+      const size_t stride_end_pos = start_pos + 64;
+      int prev = lut[input[start_pos & mask] >> 6] * 3;
+      size_t pos;
+      for (pos = start_pos + 1; pos < stride_end_pos; ++pos) {
+        const uint8_t literal = input[pos & mask];
+        ++bigram_prefix_histo[prev + lut[literal >> 6]];
+        prev = lut[literal >> 6] * 3;
+      }
+    }
+    ChooseContextMap(quality, &bigram_prefix_histo[0], num_literal_contexts,
+                     literal_context_map);
+  }
+}
+
+static BROTLI_BOOL ShouldCompress(
+    const uint8_t* data, const size_t mask, const uint64_t last_flush_pos,
+    const size_t bytes, const size_t num_literals, const size_t num_commands) {
+  /* TODO(eustas): find more precise minimal block overhead. */
+  if (bytes <= 2) return BROTLI_FALSE;
+  if (num_commands < (bytes >> 8) + 2) {
+    if ((double)num_literals > 0.99 * (double)bytes) {
+      uint32_t literal_histo[256] = { 0 };
+      static const uint32_t kSampleRate = 13;
+      static const double kMinEntropy = 7.92;
+      const double bit_cost_threshold =
+          (double)bytes * kMinEntropy / kSampleRate;
+      size_t t = (bytes + kSampleRate - 1) / kSampleRate;
+      uint32_t pos = (uint32_t)last_flush_pos;
+      size_t i;
+      for (i = 0; i < t; i++) {
+        ++literal_histo[data[pos & mask]];
+        pos += kSampleRate;
+      }
+      if (BitsEntropy(literal_histo, 256) > bit_cost_threshold) {
+        return BROTLI_FALSE;
+      }
+    }
+  }
+  return BROTLI_TRUE;
+}
+
+/* Chooses the literal context mode for a metablock */
+static ContextType ChooseContextMode(const BrotliEncoderParams* params,
+    const uint8_t* data, const size_t pos, const size_t mask,
+    const size_t length) {
+  /* We only do the computation for the option of something else than
+     CONTEXT_UTF8 for the highest qualities */
+  if (params->quality >= MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING &&
+      !BrotliIsMostlyUTF8(data, pos, mask, length, kMinUTF8Ratio)) {
+    return CONTEXT_SIGNED;
+  }
+  return CONTEXT_UTF8;
+}
+
+static void WriteMetaBlockInternal(MemoryManager* m,
+                                   const uint8_t* data,
+                                   const size_t mask,
+                                   const uint64_t last_flush_pos,
+                                   const size_t bytes,
+                                   const BROTLI_BOOL is_last,
+                                   ContextType literal_context_mode,
+                                   const BrotliEncoderParams* params,
+                                   const uint8_t prev_byte,
+                                   const uint8_t prev_byte2,
+                                   const size_t num_literals,
+                                   const size_t num_commands,
+                                   Command* commands,
+                                   const int* saved_dist_cache,
+                                   int* dist_cache,
+                                   size_t* storage_ix,
+                                   uint8_t* storage) {
+  const uint32_t wrapped_last_flush_pos = WrapPosition(last_flush_pos);
+  uint16_t last_bytes;
+  uint8_t last_bytes_bits;
+  ContextLut literal_context_lut = BROTLI_CONTEXT_LUT(literal_context_mode);
+  BrotliEncoderParams block_params = *params;
+
+  if (bytes == 0) {
+    /* Write the ISLAST and ISEMPTY bits. */
+    BrotliWriteBits(2, 3, storage_ix, storage);
+    *storage_ix = (*storage_ix + 7u) & ~7u;
+    return;
+  }
+
+  if (!ShouldCompress(data, mask, last_flush_pos, bytes,
+                      num_literals, num_commands)) {
+    /* Restore the distance cache, as its last update by
+       CreateBackwardReferences is now unused. */
+    memcpy(dist_cache, saved_dist_cache, 4 * sizeof(dist_cache[0]));
+    BrotliStoreUncompressedMetaBlock(is_last, data,
+                                     wrapped_last_flush_pos, mask, bytes,
+                                     storage_ix, storage);
+    return;
+  }
+
+  BROTLI_DCHECK(*storage_ix <= 14);
+  last_bytes = (uint16_t)((storage[1] << 8) | storage[0]);
+  last_bytes_bits = (uint8_t)(*storage_ix);
+  if (params->quality <= MAX_QUALITY_FOR_STATIC_ENTROPY_CODES) {
+    BrotliStoreMetaBlockFast(m, data, wrapped_last_flush_pos,
+                             bytes, mask, is_last, params,
+                             commands, num_commands,
+                             storage_ix, storage);
+    if (BROTLI_IS_OOM(m)) return;
+  } else if (params->quality < MIN_QUALITY_FOR_BLOCK_SPLIT) {
+    BrotliStoreMetaBlockTrivial(m, data, wrapped_last_flush_pos,
+                                bytes, mask, is_last, params,
+                                commands, num_commands,
+                                storage_ix, storage);
+    if (BROTLI_IS_OOM(m)) return;
+  } else {
+    MetaBlockSplit mb;
+    InitMetaBlockSplit(&mb);
+    if (params->quality < MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING) {
+      size_t num_literal_contexts = 1;
+      const uint32_t* literal_context_map = NULL;
+      if (!params->disable_literal_context_modeling) {
+        /* TODO(eustas): pull to higher level and reuse. */
+        uint32_t* arena =
+            BROTLI_ALLOC(m, uint32_t, 32 * (BROTLI_MAX_STATIC_CONTEXTS + 1));
+        if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(arena)) return;
+        DecideOverLiteralContextModeling(
+            data, wrapped_last_flush_pos, bytes, mask, params->quality,
+            params->size_hint, &num_literal_contexts,
+            &literal_context_map, arena);
+        BROTLI_FREE(m, arena);
+      }
+      BrotliBuildMetaBlockGreedy(m, data, wrapped_last_flush_pos, mask,
+          prev_byte, prev_byte2, literal_context_lut, num_literal_contexts,
+          literal_context_map, commands, num_commands, &mb);
+      if (BROTLI_IS_OOM(m)) return;
+    } else {
+      BrotliBuildMetaBlock(m, data, wrapped_last_flush_pos, mask, &block_params,
+                           prev_byte, prev_byte2,
+                           commands, num_commands,
+                           literal_context_mode,
+                           &mb);
+      if (BROTLI_IS_OOM(m)) return;
+    }
+    if (params->quality >= MIN_QUALITY_FOR_OPTIMIZE_HISTOGRAMS) {
+      /* The number of distance symbols effectively used for distance
+         histograms. It might be less than distance alphabet size
+         for "Large Window Brotli" (32-bit). */
+      BrotliOptimizeHistograms(block_params.dist.alphabet_size_limit, &mb);
+    }
+    BrotliStoreMetaBlock(m, data, wrapped_last_flush_pos, bytes, mask,
+                         prev_byte, prev_byte2,
+                         is_last,
+                         &block_params,
+                         literal_context_mode,
+                         commands, num_commands,
+                         &mb,
+                         storage_ix, storage);
+    if (BROTLI_IS_OOM(m)) return;
+    DestroyMetaBlockSplit(m, &mb);
+  }
+  if (bytes + 4 < (*storage_ix >> 3)) {
+    /* Restore the distance cache and last byte. */
+    memcpy(dist_cache, saved_dist_cache, 4 * sizeof(dist_cache[0]));
+    storage[0] = (uint8_t)last_bytes;
+    storage[1] = (uint8_t)(last_bytes >> 8);
+    *storage_ix = last_bytes_bits;
+    BrotliStoreUncompressedMetaBlock(is_last, data,
+                                     wrapped_last_flush_pos, mask,
+                                     bytes, storage_ix, storage);
+  }
+}
+
+static void ChooseDistanceParams(BrotliEncoderParams* params) {
+  uint32_t distance_postfix_bits = 0;
+  uint32_t num_direct_distance_codes = 0;
+
+  if (params->quality >= MIN_QUALITY_FOR_NONZERO_DISTANCE_PARAMS) {
+    uint32_t ndirect_msb;
+    if (params->mode == BROTLI_MODE_FONT) {
+      distance_postfix_bits = 1;
+      num_direct_distance_codes = 12;
+    } else {
+      distance_postfix_bits = params->dist.distance_postfix_bits;
+      num_direct_distance_codes = params->dist.num_direct_distance_codes;
+    }
+    ndirect_msb = (num_direct_distance_codes >> distance_postfix_bits) & 0x0F;
+    if (distance_postfix_bits > BROTLI_MAX_NPOSTFIX ||
+        num_direct_distance_codes > BROTLI_MAX_NDIRECT ||
+        (ndirect_msb << distance_postfix_bits) != num_direct_distance_codes) {
+      distance_postfix_bits = 0;
+      num_direct_distance_codes = 0;
+    }
+  }
+
+  BrotliInitDistanceParams(&params->dist, distance_postfix_bits,
+                           num_direct_distance_codes, params->large_window);
+}
+
+static BROTLI_BOOL EnsureInitialized(BrotliEncoderState* s) {
+  MemoryManager* m = &s->memory_manager_;
+  if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+  if (s->is_initialized_) return BROTLI_TRUE;
+
+  s->last_bytes_bits_ = 0;
+  s->last_bytes_ = 0;
+  s->flint_ = BROTLI_FLINT_DONE;
+  s->remaining_metadata_bytes_ = BROTLI_UINT32_MAX;
+
+  SanitizeParams(&s->params);
+  s->params.lgblock = ComputeLgBlock(&s->params);
+  ChooseDistanceParams(&s->params);
+
+  if (s->params.stream_offset != 0) {
+    s->flint_ = BROTLI_FLINT_NEEDS_2_BYTES;
+    /* Poison the distance cache. -16 +- 3 is still less than zero (invalid). */
+    s->dist_cache_[0] = -16;
+    s->dist_cache_[1] = -16;
+    s->dist_cache_[2] = -16;
+    s->dist_cache_[3] = -16;
+    memcpy(s->saved_dist_cache_, s->dist_cache_, sizeof(s->saved_dist_cache_));
+  }
+
+  RingBufferSetup(&s->params, &s->ringbuffer_);
+
+  /* Initialize last byte with stream header. */
+  {
+    int lgwin = s->params.lgwin;
+    if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||
+        s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {
+      lgwin = BROTLI_MAX(int, lgwin, 18);
+    }
+    if (s->params.stream_offset == 0) {
+      EncodeWindowBits(lgwin, s->params.large_window,
+                       &s->last_bytes_, &s->last_bytes_bits_);
+    } else {
+      /* Bigger values have the same effect, but could cause overflows. */
+      s->params.stream_offset = BROTLI_MIN(size_t,
+          s->params.stream_offset, BROTLI_MAX_BACKWARD_LIMIT(lgwin));
+    }
+  }
+
+  if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {
+    s->one_pass_arena_ = BROTLI_ALLOC(m, BrotliOnePassArena, 1);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    InitCommandPrefixCodes(s->one_pass_arena_);
+  } else if (s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {
+    s->two_pass_arena_ = BROTLI_ALLOC(m, BrotliTwoPassArena, 1);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+  }
+
+  s->is_initialized_ = BROTLI_TRUE;
+  return BROTLI_TRUE;
+}
+
+static void BrotliEncoderInitParams(BrotliEncoderParams* params) {
+  params->mode = BROTLI_DEFAULT_MODE;
+  params->large_window = BROTLI_FALSE;
+  params->quality = BROTLI_DEFAULT_QUALITY;
+  params->lgwin = BROTLI_DEFAULT_WINDOW;
+  params->lgblock = 0;
+  params->stream_offset = 0;
+  params->size_hint = 0;
+  params->disable_literal_context_modeling = BROTLI_FALSE;
+  BrotliInitSharedEncoderDictionary(&params->dictionary);
+  params->dist.distance_postfix_bits = 0;
+  params->dist.num_direct_distance_codes = 0;
+  params->dist.alphabet_size_max =
+      BROTLI_DISTANCE_ALPHABET_SIZE(0, 0, BROTLI_MAX_DISTANCE_BITS);
+  params->dist.alphabet_size_limit = params->dist.alphabet_size_max;
+  params->dist.max_distance = BROTLI_MAX_DISTANCE;
+}
+
+static void BrotliEncoderCleanupParams(MemoryManager* m,
+    BrotliEncoderParams* params) {
+  BrotliCleanupSharedEncoderDictionary(m, &params->dictionary);
+}
+
+static void BrotliEncoderInitState(BrotliEncoderState* s) {
+  BrotliEncoderInitParams(&s->params);
+  s->input_pos_ = 0;
+  s->num_commands_ = 0;
+  s->num_literals_ = 0;
+  s->last_insert_len_ = 0;
+  s->last_flush_pos_ = 0;
+  s->last_processed_pos_ = 0;
+  s->prev_byte_ = 0;
+  s->prev_byte2_ = 0;
+  s->storage_size_ = 0;
+  s->storage_ = 0;
+  HasherInit(&s->hasher_);
+  s->large_table_ = NULL;
+  s->large_table_size_ = 0;
+  s->one_pass_arena_ = NULL;
+  s->two_pass_arena_ = NULL;
+  s->command_buf_ = NULL;
+  s->literal_buf_ = NULL;
+  s->total_in_ = 0;
+  s->next_out_ = NULL;
+  s->available_out_ = 0;
+  s->total_out_ = 0;
+  s->stream_state_ = BROTLI_STREAM_PROCESSING;
+  s->is_last_block_emitted_ = BROTLI_FALSE;
+  s->is_initialized_ = BROTLI_FALSE;
+
+  RingBufferInit(&s->ringbuffer_);
+
+  s->commands_ = 0;
+  s->cmd_alloc_size_ = 0;
+
+  /* Initialize distance cache. */
+  s->dist_cache_[0] = 4;
+  s->dist_cache_[1] = 11;
+  s->dist_cache_[2] = 15;
+  s->dist_cache_[3] = 16;
+  /* Save the state of the distance cache in case we need to restore it for
+     emitting an uncompressed block. */
+  memcpy(s->saved_dist_cache_, s->dist_cache_, sizeof(s->saved_dist_cache_));
+}
+
+BrotliEncoderState* BrotliEncoderCreateInstance(
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {
+  BrotliEncoderState* state = (BrotliEncoderState*)BrotliBootstrapAlloc(
+      sizeof(BrotliEncoderState), alloc_func, free_func, opaque);
+  if (state == NULL) {
+    /* BROTLI_DUMP(); */
+    return 0;
+  }
+  BrotliInitMemoryManager(
+      &state->memory_manager_, alloc_func, free_func, opaque);
+  BrotliEncoderInitState(state);
+  return state;
+}
+
+#ifdef BROTLI_REPORTING
+/* When BROTLI_REPORTING is defined extra reporting module have to be linked. */
+void BrotliEncoderOnFinish(const BrotliEncoderState* s);
+#define BROTLI_ENCODER_ON_FINISH(s) BrotliEncoderOnFinish(s);
+#else
+#if !defined(BROTLI_ENCODER_ON_FINISH)
+#define BROTLI_ENCODER_ON_FINISH(s) (void)(s);
+#endif
+#endif
+
+static void BrotliEncoderCleanupState(BrotliEncoderState* s) {
+  MemoryManager* m = &s->memory_manager_;
+
+  BROTLI_ENCODER_ON_FINISH(s);
+
+  if (BROTLI_IS_OOM(m)) {
+    BrotliWipeOutMemoryManager(m);
+    return;
+  }
+
+  BROTLI_FREE(m, s->storage_);
+  BROTLI_FREE(m, s->commands_);
+  RingBufferFree(m, &s->ringbuffer_);
+  DestroyHasher(m, &s->hasher_);
+  BROTLI_FREE(m, s->large_table_);
+  BROTLI_FREE(m, s->one_pass_arena_);
+  BROTLI_FREE(m, s->two_pass_arena_);
+  BROTLI_FREE(m, s->command_buf_);
+  BROTLI_FREE(m, s->literal_buf_);
+  BrotliEncoderCleanupParams(m, &s->params);
+}
+
+/* Deinitializes and frees BrotliEncoderState instance. */
+void BrotliEncoderDestroyInstance(BrotliEncoderState* state) {
+  if (!state) {
+    return;
+  } else {
+    BrotliEncoderCleanupState(state);
+    BrotliBootstrapFree(state, &state->memory_manager_);
+  }
+}
+
+/*
+   Copies the given input data to the internal ring buffer of the compressor.
+   No processing of the data occurs at this time and this function can be
+   called multiple times before calling WriteBrotliData() to process the
+   accumulated input. At most input_block_size() bytes of input data can be
+   copied to the ring buffer, otherwise the next WriteBrotliData() will fail.
+ */
+static void CopyInputToRingBuffer(BrotliEncoderState* s,
+                                  const size_t input_size,
+                                  const uint8_t* input_buffer) {
+  RingBuffer* ringbuffer_ = &s->ringbuffer_;
+  MemoryManager* m = &s->memory_manager_;
+  RingBufferWrite(m, input_buffer, input_size, ringbuffer_);
+  if (BROTLI_IS_OOM(m)) return;
+  s->input_pos_ += input_size;
+
+  /* TL;DR: If needed, initialize 7 more bytes in the ring buffer to make the
+     hashing not depend on uninitialized data. This makes compression
+     deterministic and it prevents uninitialized memory warnings in Valgrind.
+     Even without erasing, the output would be valid (but nondeterministic).
+
+     Background information: The compressor stores short (at most 8 bytes)
+     substrings of the input already read in a hash table, and detects
+     repetitions by looking up such substrings in the hash table. If it
+     can find a substring, it checks whether the substring is really there
+     in the ring buffer (or it's just a hash collision). Should the hash
+     table become corrupt, this check makes sure that the output is
+     still valid, albeit the compression ratio would be bad.
+
+     The compressor populates the hash table from the ring buffer as it's
+     reading new bytes from the input. However, at the last few indexes of
+     the ring buffer, there are not enough bytes to build full-length
+     substrings from. Since the hash table always contains full-length
+     substrings, we overwrite with zeros here to make sure that those
+     substrings will contain zeros at the end instead of uninitialized
+     data.
+
+     Please note that erasing is not necessary (because the
+     memory region is already initialized since he ring buffer
+     has a `tail' that holds a copy of the beginning,) so we
+     skip erasing if we have already gone around at least once in
+     the ring buffer.
+
+     Only clear during the first round of ring-buffer writes. On
+     subsequent rounds data in the ring-buffer would be affected. */
+  if (ringbuffer_->pos_ <= ringbuffer_->mask_) {
+    /* This is the first time when the ring buffer is being written.
+       We clear 7 bytes just after the bytes that have been copied from
+       the input buffer.
+
+       The ring-buffer has a "tail" that holds a copy of the beginning,
+       but only once the ring buffer has been fully written once, i.e.,
+       pos <= mask. For the first time, we need to write values
+       in this tail (where index may be larger than mask), so that
+       we have exactly defined behavior and don't read uninitialized
+       memory. Due to performance reasons, hashing reads data using a
+       LOAD64, which can go 7 bytes beyond the bytes written in the
+       ring-buffer. */
+    memset(ringbuffer_->buffer_ + ringbuffer_->pos_, 0, 7);
+  }
+}
+
+/* Marks all input as processed.
+   Returns true if position wrapping occurs. */
+static BROTLI_BOOL UpdateLastProcessedPos(BrotliEncoderState* s) {
+  uint32_t wrapped_last_processed_pos = WrapPosition(s->last_processed_pos_);
+  uint32_t wrapped_input_pos = WrapPosition(s->input_pos_);
+  s->last_processed_pos_ = s->input_pos_;
+  return TO_BROTLI_BOOL(wrapped_input_pos < wrapped_last_processed_pos);
+}
+
+static void ExtendLastCommand(BrotliEncoderState* s, uint32_t* bytes,
+                              uint32_t* wrapped_last_processed_pos) {
+  Command* last_command = &s->commands_[s->num_commands_ - 1];
+  const uint8_t* data = s->ringbuffer_.buffer_;
+  const uint32_t mask = s->ringbuffer_.mask_;
+  uint64_t max_backward_distance =
+      (((uint64_t)1) << s->params.lgwin) - BROTLI_WINDOW_GAP;
+  uint64_t last_copy_len = last_command->copy_len_ & 0x1FFFFFF;
+  uint64_t last_processed_pos = s->last_processed_pos_ - last_copy_len;
+  uint64_t max_distance = last_processed_pos < max_backward_distance ?
+      last_processed_pos : max_backward_distance;
+  uint64_t cmd_dist = (uint64_t)s->dist_cache_[0];
+  uint32_t distance_code = CommandRestoreDistanceCode(last_command,
+                                                      &s->params.dist);
+  const CompoundDictionary* dict = &s->params.dictionary.compound;
+  size_t compound_dictionary_size = dict->total_size;
+  if (distance_code < BROTLI_NUM_DISTANCE_SHORT_CODES ||
+      distance_code - (BROTLI_NUM_DISTANCE_SHORT_CODES - 1) == cmd_dist) {
+    if (cmd_dist <= max_distance) {
+      while (*bytes != 0 && data[*wrapped_last_processed_pos & mask] ==
+             data[(*wrapped_last_processed_pos - cmd_dist) & mask]) {
+        last_command->copy_len_++;
+        (*bytes)--;
+        (*wrapped_last_processed_pos)++;
+      }
+    } else {
+      if ((cmd_dist - max_distance - 1) < compound_dictionary_size &&
+          last_copy_len < cmd_dist - max_distance) {
+        size_t address =
+            compound_dictionary_size - (size_t)(cmd_dist - max_distance) +
+            (size_t)last_copy_len;
+        size_t br_index = 0;
+        size_t br_offset;
+        const uint8_t* chunk;
+        size_t chunk_length;
+        while (address >= dict->chunk_offsets[br_index + 1]) br_index++;
+        br_offset = address - dict->chunk_offsets[br_index];
+        chunk = dict->chunk_source[br_index];
+        chunk_length =
+            dict->chunk_offsets[br_index + 1] - dict->chunk_offsets[br_index];
+        while (*bytes != 0 && data[*wrapped_last_processed_pos & mask] ==
+               chunk[br_offset]) {
+          last_command->copy_len_++;
+          (*bytes)--;
+          (*wrapped_last_processed_pos)++;
+          if (++br_offset == chunk_length) {
+            br_index++;
+            br_offset = 0;
+            if (br_index != dict->num_chunks) {
+              chunk = dict->chunk_source[br_index];
+              chunk_length = dict->chunk_offsets[br_index + 1] -
+                  dict->chunk_offsets[br_index];
+            } else {
+              break;
+            }
+          }
+        }
+      }
+    }
+    /* The copy length is at most the metablock size, and thus expressible. */
+    GetLengthCode(last_command->insert_len_,
+                  (size_t)((int)(last_command->copy_len_ & 0x1FFFFFF) +
+                           (int)(last_command->copy_len_ >> 25)),
+                  TO_BROTLI_BOOL((last_command->dist_prefix_ & 0x3FF) == 0),
+                  &last_command->cmd_prefix_);
+  }
+}
+
+/*
+   Processes the accumulated input data and sets |*out_size| to the length of
+   the new output meta-block, or to zero if no new output meta-block has been
+   created (in this case the processed input data is buffered internally).
+   If |*out_size| is positive, |*output| points to the start of the output
+   data. If |is_last| or |force_flush| is BROTLI_TRUE, an output meta-block is
+   always created. However, until |is_last| is BROTLI_TRUE encoder may retain up
+   to 7 bits of the last byte of output. Byte-alignment could be enforced by
+   emitting an empty meta-data block.
+   Returns BROTLI_FALSE if the size of the input data is larger than
+   input_block_size().
+ */
+static BROTLI_BOOL EncodeData(
+    BrotliEncoderState* s, const BROTLI_BOOL is_last,
+    const BROTLI_BOOL force_flush, size_t* out_size, uint8_t** output) {
+  const uint64_t delta = UnprocessedInputSize(s);
+  uint32_t bytes = (uint32_t)delta;
+  uint32_t wrapped_last_processed_pos = WrapPosition(s->last_processed_pos_);
+  uint8_t* data;
+  uint32_t mask;
+  MemoryManager* m = &s->memory_manager_;
+  ContextType literal_context_mode;
+  ContextLut literal_context_lut;
+  BROTLI_BOOL fast_compress =
+      s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||
+      s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY;
+
+  data = s->ringbuffer_.buffer_;
+  mask = s->ringbuffer_.mask_;
+
+  if (delta == 0) {  /* No new input; still might want to flush or finish. */
+    if (!data) {  /* No input has been processed so far. */
+      if (is_last) {  /* Emit complete finalized stream. */
+        BROTLI_DCHECK(s->last_bytes_bits_ <= 14);
+        s->last_bytes_ |= (uint16_t)(3u << s->last_bytes_bits_);
+        s->last_bytes_bits_ = (uint8_t)(s->last_bytes_bits_ + 2u);
+        s->tiny_buf_.u8[0] = (uint8_t)s->last_bytes_;
+        s->tiny_buf_.u8[1] = (uint8_t)(s->last_bytes_ >> 8);
+        *output = s->tiny_buf_.u8;
+        *out_size = (s->last_bytes_bits_ + 7u) >> 3u;
+        return BROTLI_TRUE;
+      } else {  /* No data, not last -> no-op. */
+        *out_size = 0;
+        return BROTLI_TRUE;
+      }
+    } else {
+      /* Fast compress performs flush every block -> flush is no-op. */
+      if (!is_last && (!force_flush || fast_compress)) {  /* Another no-op. */
+        *out_size = 0;
+        return BROTLI_TRUE;
+      }
+    }
+  }
+  BROTLI_DCHECK(data);
+
+  if (s->params.quality > s->params.dictionary.max_quality) return BROTLI_FALSE;
+  /* Adding more blocks after "last" block is forbidden. */
+  if (s->is_last_block_emitted_) return BROTLI_FALSE;
+  if (is_last) s->is_last_block_emitted_ = BROTLI_TRUE;
+
+  if (delta > InputBlockSize(s)) {
+    return BROTLI_FALSE;
+  }
+  if (s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY &&
+      !s->command_buf_) {
+    s->command_buf_ =
+        BROTLI_ALLOC(m, uint32_t, kCompressFragmentTwoPassBlockSize);
+    s->literal_buf_ =
+        BROTLI_ALLOC(m, uint8_t, kCompressFragmentTwoPassBlockSize);
+    if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(s->command_buf_) ||
+        BROTLI_IS_NULL(s->literal_buf_)) {
+      return BROTLI_FALSE;
+    }
+  }
+
+  if (fast_compress) {
+    uint8_t* storage;
+    size_t storage_ix = s->last_bytes_bits_;
+    size_t table_size;
+    int* table;
+
+    storage = GetBrotliStorage(s, 2 * bytes + 503);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    storage[0] = (uint8_t)s->last_bytes_;
+    storage[1] = (uint8_t)(s->last_bytes_ >> 8);
+    table = GetHashTable(s, s->params.quality, bytes, &table_size);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {
+      BrotliCompressFragmentFast(
+          s->one_pass_arena_, &data[wrapped_last_processed_pos & mask],
+          bytes, is_last,
+          table, table_size,
+          &storage_ix, storage);
+      if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    } else {
+      BrotliCompressFragmentTwoPass(
+          s->two_pass_arena_, &data[wrapped_last_processed_pos & mask],
+          bytes, is_last,
+          s->command_buf_, s->literal_buf_,
+          table, table_size,
+          &storage_ix, storage);
+      if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    }
+    s->last_bytes_ = (uint16_t)(storage[storage_ix >> 3]);
+    s->last_bytes_bits_ = storage_ix & 7u;
+    UpdateLastProcessedPos(s);
+    *output = &storage[0];
+    *out_size = storage_ix >> 3;
+    return BROTLI_TRUE;
+  }
+
+  {
+    /* Theoretical max number of commands is 1 per 2 bytes. */
+    size_t newsize = s->num_commands_ + bytes / 2 + 1;
+    if (newsize > s->cmd_alloc_size_) {
+      Command* new_commands;
+      /* Reserve a bit more memory to allow merging with a next block
+         without reallocation: that would impact speed. */
+      newsize += (bytes / 4) + 16;
+      s->cmd_alloc_size_ = newsize;
+      new_commands = BROTLI_ALLOC(m, Command, newsize);
+      if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(new_commands)) return BROTLI_FALSE;
+      if (s->commands_) {
+        memcpy(new_commands, s->commands_, sizeof(Command) * s->num_commands_);
+        BROTLI_FREE(m, s->commands_);
+      }
+      s->commands_ = new_commands;
+    }
+  }
+
+  InitOrStitchToPreviousBlock(m, &s->hasher_, data, mask, &s->params,
+      wrapped_last_processed_pos, bytes, is_last);
+
+  literal_context_mode = ChooseContextMode(
+      &s->params, data, WrapPosition(s->last_flush_pos_),
+      mask, (size_t)(s->input_pos_ - s->last_flush_pos_));
+  literal_context_lut = BROTLI_CONTEXT_LUT(literal_context_mode);
+
+  if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+
+  if (s->num_commands_ && s->last_insert_len_ == 0) {
+    ExtendLastCommand(s, &bytes, &wrapped_last_processed_pos);
+  }
+
+  if (s->params.quality == ZOPFLIFICATION_QUALITY) {
+    BROTLI_DCHECK(s->params.hasher.type == 10);
+    BrotliCreateZopfliBackwardReferences(m, bytes, wrapped_last_processed_pos,
+        data, mask, literal_context_lut, &s->params,
+        &s->hasher_, s->dist_cache_,
+        &s->last_insert_len_, &s->commands_[s->num_commands_],
+        &s->num_commands_, &s->num_literals_);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+  } else if (s->params.quality == HQ_ZOPFLIFICATION_QUALITY) {
+    BROTLI_DCHECK(s->params.hasher.type == 10);
+    BrotliCreateHqZopfliBackwardReferences(m, bytes, wrapped_last_processed_pos,
+        data, mask, literal_context_lut, &s->params,
+        &s->hasher_, s->dist_cache_,
+        &s->last_insert_len_, &s->commands_[s->num_commands_],
+        &s->num_commands_, &s->num_literals_);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+  } else {
+    BrotliCreateBackwardReferences(bytes, wrapped_last_processed_pos,
+        data, mask, literal_context_lut, &s->params,
+        &s->hasher_, s->dist_cache_,
+        &s->last_insert_len_, &s->commands_[s->num_commands_],
+        &s->num_commands_, &s->num_literals_);
+  }
+
+  {
+    const size_t max_length = MaxMetablockSize(&s->params);
+    const size_t max_literals = max_length / 8;
+    const size_t max_commands = max_length / 8;
+    const size_t processed_bytes = (size_t)(s->input_pos_ - s->last_flush_pos_);
+    /* If maximal possible additional block doesn't fit metablock, flush now. */
+    /* TODO(eustas): Postpone decision until next block arrives? */
+    const BROTLI_BOOL next_input_fits_metablock = TO_BROTLI_BOOL(
+        processed_bytes + InputBlockSize(s) <= max_length);
+    /* If block splitting is not used, then flush as soon as there is some
+       amount of commands / literals produced. */
+    const BROTLI_BOOL should_flush = TO_BROTLI_BOOL(
+        s->params.quality < MIN_QUALITY_FOR_BLOCK_SPLIT &&
+        s->num_literals_ + s->num_commands_ >= MAX_NUM_DELAYED_SYMBOLS);
+    if (!is_last && !force_flush && !should_flush &&
+        next_input_fits_metablock &&
+        s->num_literals_ < max_literals &&
+        s->num_commands_ < max_commands) {
+      /* Merge with next input block. Everything will happen later. */
+      if (UpdateLastProcessedPos(s)) {
+        HasherReset(&s->hasher_);
+      }
+      *out_size = 0;
+      return BROTLI_TRUE;
+    }
+  }
+
+  /* Create the last insert-only command. */
+  if (s->last_insert_len_ > 0) {
+    InitInsertCommand(&s->commands_[s->num_commands_++], s->last_insert_len_);
+    s->num_literals_ += s->last_insert_len_;
+    s->last_insert_len_ = 0;
+  }
+
+  if (!is_last && s->input_pos_ == s->last_flush_pos_) {
+    /* We have no new input data and we don't have to finish the stream, so
+       nothing to do. */
+    *out_size = 0;
+    return BROTLI_TRUE;
+  }
+  BROTLI_DCHECK(s->input_pos_ >= s->last_flush_pos_);
+  BROTLI_DCHECK(s->input_pos_ > s->last_flush_pos_ || is_last);
+  BROTLI_DCHECK(s->input_pos_ - s->last_flush_pos_ <= 1u << 24);
+  {
+    const uint32_t metablock_size =
+        (uint32_t)(s->input_pos_ - s->last_flush_pos_);
+    uint8_t* storage = GetBrotliStorage(s, 2 * metablock_size + 503);
+    size_t storage_ix = s->last_bytes_bits_;
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    storage[0] = (uint8_t)s->last_bytes_;
+    storage[1] = (uint8_t)(s->last_bytes_ >> 8);
+    WriteMetaBlockInternal(
+        m, data, mask, s->last_flush_pos_, metablock_size, is_last,
+        literal_context_mode, &s->params, s->prev_byte_, s->prev_byte2_,
+        s->num_literals_, s->num_commands_, s->commands_, s->saved_dist_cache_,
+        s->dist_cache_, &storage_ix, storage);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    s->last_bytes_ = (uint16_t)(storage[storage_ix >> 3]);
+    s->last_bytes_bits_ = storage_ix & 7u;
+    s->last_flush_pos_ = s->input_pos_;
+    if (UpdateLastProcessedPos(s)) {
+      HasherReset(&s->hasher_);
+    }
+    if (s->last_flush_pos_ > 0) {
+      s->prev_byte_ = data[((uint32_t)s->last_flush_pos_ - 1) & mask];
+    }
+    if (s->last_flush_pos_ > 1) {
+      s->prev_byte2_ = data[(uint32_t)(s->last_flush_pos_ - 2) & mask];
+    }
+    s->num_commands_ = 0;
+    s->num_literals_ = 0;
+    /* Save the state of the distance cache in case we need to restore it for
+       emitting an uncompressed block. */
+    memcpy(s->saved_dist_cache_, s->dist_cache_, sizeof(s->saved_dist_cache_));
+    *output = &storage[0];
+    *out_size = storage_ix >> 3;
+    return BROTLI_TRUE;
+  }
+}
+
+/* Dumps remaining output bits and metadata header to |header|.
+   Returns number of produced bytes.
+   REQUIRED: |header| should be 8-byte aligned and at least 16 bytes long.
+   REQUIRED: |block_size| <= (1 << 24). */
+static size_t WriteMetadataHeader(
+    BrotliEncoderState* s, const size_t block_size, uint8_t* header) {
+  size_t storage_ix;
+  storage_ix = s->last_bytes_bits_;
+  header[0] = (uint8_t)s->last_bytes_;
+  header[1] = (uint8_t)(s->last_bytes_ >> 8);
+  s->last_bytes_ = 0;
+  s->last_bytes_bits_ = 0;
+
+  BrotliWriteBits(1, 0, &storage_ix, header);
+  BrotliWriteBits(2, 3, &storage_ix, header);
+  BrotliWriteBits(1, 0, &storage_ix, header);
+  if (block_size == 0) {
+    BrotliWriteBits(2, 0, &storage_ix, header);
+  } else {
+    uint32_t nbits = (block_size == 1) ? 1 :
+        (Log2FloorNonZero((uint32_t)block_size - 1) + 1);
+    uint32_t nbytes = (nbits + 7) / 8;
+    BrotliWriteBits(2, nbytes, &storage_ix, header);
+    BrotliWriteBits(8 * nbytes, block_size - 1, &storage_ix, header);
+  }
+  return (storage_ix + 7u) >> 3;
+}
+
+size_t BrotliEncoderMaxCompressedSize(size_t input_size) {
+  /* [window bits / empty metadata] + N * [uncompressed] + [last empty] */
+  size_t num_large_blocks = input_size >> 14;
+  size_t overhead = 2 + (4 * num_large_blocks) + 3 + 1;
+  size_t result = input_size + overhead;
+  if (input_size == 0) return 2;
+  return (result < input_size) ? 0 : result;
+}
+
+/* Wraps data to uncompressed brotli stream with minimal window size.
+   |output| should point at region with at least BrotliEncoderMaxCompressedSize
+   addressable bytes.
+   Returns the length of stream. */
+static size_t MakeUncompressedStream(
+    const uint8_t* input, size_t input_size, uint8_t* output) {
+  size_t size = input_size;
+  size_t result = 0;
+  size_t offset = 0;
+  if (input_size == 0) {
+    output[0] = 6;
+    return 1;
+  }
+  output[result++] = 0x21;  /* window bits = 10, is_last = false */
+  output[result++] = 0x03;  /* empty metadata, padding */
+  while (size > 0) {
+    uint32_t nibbles = 0;
+    uint32_t chunk_size;
+    uint32_t bits;
+    chunk_size = (size > (1u << 24)) ? (1u << 24) : (uint32_t)size;
+    if (chunk_size > (1u << 16)) nibbles = (chunk_size > (1u << 20)) ? 2 : 1;
+    bits =
+        (nibbles << 1) | ((chunk_size - 1) << 3) | (1u << (19 + 4 * nibbles));
+    output[result++] = (uint8_t)bits;
+    output[result++] = (uint8_t)(bits >> 8);
+    output[result++] = (uint8_t)(bits >> 16);
+    if (nibbles == 2) output[result++] = (uint8_t)(bits >> 24);
+    memcpy(&output[result], &input[offset], chunk_size);
+    result += chunk_size;
+    offset += chunk_size;
+    size -= chunk_size;
+  }
+  output[result++] = 3;
+  return result;
+}
+
+BROTLI_BOOL BrotliEncoderCompress(
+    int quality, int lgwin, BrotliEncoderMode mode, size_t input_size,
+    const uint8_t input_buffer[BROTLI_ARRAY_PARAM(input_size)],
+    size_t* encoded_size,
+    uint8_t encoded_buffer[BROTLI_ARRAY_PARAM(*encoded_size)]) {
+  BrotliEncoderState* s;
+  size_t out_size = *encoded_size;
+  const uint8_t* input_start = input_buffer;
+  uint8_t* output_start = encoded_buffer;
+  size_t max_out_size = BrotliEncoderMaxCompressedSize(input_size);
+  if (out_size == 0) {
+    /* Output buffer needs at least one byte. */
+    return BROTLI_FALSE;
+  }
+  if (input_size == 0) {
+    /* Handle the special case of empty input. */
+    *encoded_size = 1;
+    *encoded_buffer = 6;
+    return BROTLI_TRUE;
+  }
+
+  s = BrotliEncoderCreateInstance(0, 0, 0);
+  if (!s) {
+    return BROTLI_FALSE;
+  } else {
+    size_t available_in = input_size;
+    const uint8_t* next_in = input_buffer;
+    size_t available_out = *encoded_size;
+    uint8_t* next_out = encoded_buffer;
+    size_t total_out = 0;
+    BROTLI_BOOL result = BROTLI_FALSE;
+    /* TODO(eustas): check that parameters are sane. */
+    BrotliEncoderSetParameter(s, BROTLI_PARAM_QUALITY, (uint32_t)quality);
+    BrotliEncoderSetParameter(s, BROTLI_PARAM_LGWIN, (uint32_t)lgwin);
+    BrotliEncoderSetParameter(s, BROTLI_PARAM_MODE, (uint32_t)mode);
+    BrotliEncoderSetParameter(s, BROTLI_PARAM_SIZE_HINT, (uint32_t)input_size);
+    if (lgwin > BROTLI_MAX_WINDOW_BITS) {
+      BrotliEncoderSetParameter(s, BROTLI_PARAM_LARGE_WINDOW, BROTLI_TRUE);
+    }
+    result = BrotliEncoderCompressStream(s, BROTLI_OPERATION_FINISH,
+        &available_in, &next_in, &available_out, &next_out, &total_out);
+    if (!BrotliEncoderIsFinished(s)) result = 0;
+    *encoded_size = total_out;
+    BrotliEncoderDestroyInstance(s);
+    if (!result || (max_out_size && *encoded_size > max_out_size)) {
+      goto fallback;
+    }
+    return BROTLI_TRUE;
+  }
+fallback:
+  *encoded_size = 0;
+  if (!max_out_size) return BROTLI_FALSE;
+  if (out_size >= max_out_size) {
+    *encoded_size =
+        MakeUncompressedStream(input_start, input_size, output_start);
+    return BROTLI_TRUE;
+  }
+  return BROTLI_FALSE;
+}
+
+static void InjectBytePaddingBlock(BrotliEncoderState* s) {
+  uint32_t seal = s->last_bytes_;
+  size_t seal_bits = s->last_bytes_bits_;
+  uint8_t* destination;
+  s->last_bytes_ = 0;
+  s->last_bytes_bits_ = 0;
+  /* is_last = 0, data_nibbles = 11, reserved = 0, meta_nibbles = 00 */
+  seal |= 0x6u << seal_bits;
+  seal_bits += 6;
+  /* If we have already created storage, then append to it.
+     Storage is valid until next block is being compressed. */
+  if (s->next_out_) {
+    destination = s->next_out_ + s->available_out_;
+  } else {
+    destination = s->tiny_buf_.u8;
+    s->next_out_ = destination;
+  }
+  destination[0] = (uint8_t)seal;
+  if (seal_bits > 8) destination[1] = (uint8_t)(seal >> 8);
+  if (seal_bits > 16) destination[2] = (uint8_t)(seal >> 16);
+  s->available_out_ += (seal_bits + 7) >> 3;
+}
+
+/* Fills the |total_out|, if it is not NULL. */
+static void SetTotalOut(BrotliEncoderState* s, size_t* total_out) {
+  if (total_out) {
+    /* Saturating conversion uint64_t -> size_t */
+    size_t result = (size_t)-1;
+    if (s->total_out_ < result) {
+      result = (size_t)s->total_out_;
+    }
+    *total_out = result;
+  }
+}
+
+/* Injects padding bits or pushes compressed data to output.
+   Returns false if nothing is done. */
+static BROTLI_BOOL InjectFlushOrPushOutput(BrotliEncoderState* s,
+    size_t* available_out, uint8_t** next_out, size_t* total_out) {
+  if (s->stream_state_ == BROTLI_STREAM_FLUSH_REQUESTED &&
+      s->last_bytes_bits_ != 0) {
+    InjectBytePaddingBlock(s);
+    return BROTLI_TRUE;
+  }
+
+  if (s->available_out_ != 0 && *available_out != 0) {
+    size_t copy_output_size =
+        BROTLI_MIN(size_t, s->available_out_, *available_out);
+    memcpy(*next_out, s->next_out_, copy_output_size);
+    *next_out += copy_output_size;
+    *available_out -= copy_output_size;
+    s->next_out_ += copy_output_size;
+    s->available_out_ -= copy_output_size;
+    s->total_out_ += copy_output_size;
+    SetTotalOut(s, total_out);
+    return BROTLI_TRUE;
+  }
+
+  return BROTLI_FALSE;
+}
+
+static void CheckFlushComplete(BrotliEncoderState* s) {
+  if (s->stream_state_ == BROTLI_STREAM_FLUSH_REQUESTED &&
+      s->available_out_ == 0) {
+    s->stream_state_ = BROTLI_STREAM_PROCESSING;
+    s->next_out_ = 0;
+  }
+}
+
+static BROTLI_BOOL BrotliEncoderCompressStreamFast(
+    BrotliEncoderState* s, BrotliEncoderOperation op, size_t* available_in,
+    const uint8_t** next_in, size_t* available_out, uint8_t** next_out,
+    size_t* total_out) {
+  const size_t block_size_limit = (size_t)1 << s->params.lgwin;
+  const size_t buf_size = BROTLI_MIN(size_t, kCompressFragmentTwoPassBlockSize,
+      BROTLI_MIN(size_t, *available_in, block_size_limit));
+  uint32_t* tmp_command_buf = NULL;
+  uint32_t* command_buf = NULL;
+  uint8_t* tmp_literal_buf = NULL;
+  uint8_t* literal_buf = NULL;
+  MemoryManager* m = &s->memory_manager_;
+  if (s->params.quality != FAST_ONE_PASS_COMPRESSION_QUALITY &&
+      s->params.quality != FAST_TWO_PASS_COMPRESSION_QUALITY) {
+    return BROTLI_FALSE;
+  }
+  if (s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {
+    if (!s->command_buf_ && buf_size == kCompressFragmentTwoPassBlockSize) {
+      s->command_buf_ =
+          BROTLI_ALLOC(m, uint32_t, kCompressFragmentTwoPassBlockSize);
+      s->literal_buf_ =
+          BROTLI_ALLOC(m, uint8_t, kCompressFragmentTwoPassBlockSize);
+      if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(s->command_buf_) ||
+          BROTLI_IS_NULL(s->literal_buf_)) {
+        return BROTLI_FALSE;
+      }
+    }
+    if (s->command_buf_) {
+      command_buf = s->command_buf_;
+      literal_buf = s->literal_buf_;
+    } else {
+      tmp_command_buf = BROTLI_ALLOC(m, uint32_t, buf_size);
+      tmp_literal_buf = BROTLI_ALLOC(m, uint8_t, buf_size);
+      if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(tmp_command_buf) ||
+          BROTLI_IS_NULL(tmp_literal_buf)) {
+        return BROTLI_FALSE;
+      }
+      command_buf = tmp_command_buf;
+      literal_buf = tmp_literal_buf;
+    }
+  }
+
+  while (BROTLI_TRUE) {
+    if (InjectFlushOrPushOutput(s, available_out, next_out, total_out)) {
+      continue;
+    }
+
+    /* Compress block only when internal output buffer is empty, stream is not
+       finished, there is no pending flush request, and there is either
+       additional input or pending operation. */
+    if (s->available_out_ == 0 &&
+        s->stream_state_ == BROTLI_STREAM_PROCESSING &&
+        (*available_in != 0 || op != BROTLI_OPERATION_PROCESS)) {
+      size_t block_size = BROTLI_MIN(size_t, block_size_limit, *available_in);
+      BROTLI_BOOL is_last =
+          (*available_in == block_size) && (op == BROTLI_OPERATION_FINISH);
+      BROTLI_BOOL force_flush =
+          (*available_in == block_size) && (op == BROTLI_OPERATION_FLUSH);
+      size_t max_out_size = 2 * block_size + 503;
+      BROTLI_BOOL inplace = BROTLI_TRUE;
+      uint8_t* storage = NULL;
+      size_t storage_ix = s->last_bytes_bits_;
+      size_t table_size;
+      int* table;
+
+      if (force_flush && block_size == 0) {
+        s->stream_state_ = BROTLI_STREAM_FLUSH_REQUESTED;
+        continue;
+      }
+      if (max_out_size <= *available_out) {
+        storage = *next_out;
+      } else {
+        inplace = BROTLI_FALSE;
+        storage = GetBrotliStorage(s, max_out_size);
+        if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+      }
+      storage[0] = (uint8_t)s->last_bytes_;
+      storage[1] = (uint8_t)(s->last_bytes_ >> 8);
+      table = GetHashTable(s, s->params.quality, block_size, &table_size);
+      if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+
+      if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {
+        BrotliCompressFragmentFast(s->one_pass_arena_, *next_in, block_size,
+            is_last, table, table_size, &storage_ix, storage);
+        if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+      } else {
+        BrotliCompressFragmentTwoPass(s->two_pass_arena_, *next_in, block_size,
+            is_last, command_buf, literal_buf, table, table_size,
+            &storage_ix, storage);
+        if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+      }
+      if (block_size != 0) {
+        *next_in += block_size;
+        *available_in -= block_size;
+        s->total_in_ += block_size;
+      }
+      if (inplace) {
+        size_t out_bytes = storage_ix >> 3;
+        BROTLI_DCHECK(out_bytes <= *available_out);
+        BROTLI_DCHECK((storage_ix & 7) == 0 || out_bytes < *available_out);
+        *next_out += out_bytes;
+        *available_out -= out_bytes;
+        s->total_out_ += out_bytes;
+        SetTotalOut(s, total_out);
+      } else {
+        size_t out_bytes = storage_ix >> 3;
+        s->next_out_ = storage;
+        s->available_out_ = out_bytes;
+      }
+      s->last_bytes_ = (uint16_t)(storage[storage_ix >> 3]);
+      s->last_bytes_bits_ = storage_ix & 7u;
+
+      if (force_flush) s->stream_state_ = BROTLI_STREAM_FLUSH_REQUESTED;
+      if (is_last) s->stream_state_ = BROTLI_STREAM_FINISHED;
+      continue;
+    }
+    break;
+  }
+  BROTLI_FREE(m, tmp_command_buf);
+  BROTLI_FREE(m, tmp_literal_buf);
+  CheckFlushComplete(s);
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL ProcessMetadata(
+    BrotliEncoderState* s, size_t* available_in, const uint8_t** next_in,
+    size_t* available_out, uint8_t** next_out, size_t* total_out) {
+  if (*available_in > (1u << 24)) return BROTLI_FALSE;
+  /* Switch to metadata block workflow, if required. */
+  if (s->stream_state_ == BROTLI_STREAM_PROCESSING) {
+    s->remaining_metadata_bytes_ = (uint32_t)*available_in;
+    s->stream_state_ = BROTLI_STREAM_METADATA_HEAD;
+  }
+  if (s->stream_state_ != BROTLI_STREAM_METADATA_HEAD &&
+      s->stream_state_ != BROTLI_STREAM_METADATA_BODY) {
+    return BROTLI_FALSE;
+  }
+
+  while (BROTLI_TRUE) {
+    if (InjectFlushOrPushOutput(s, available_out, next_out, total_out)) {
+      continue;
+    }
+    if (s->available_out_ != 0) break;
+
+    if (s->input_pos_ != s->last_flush_pos_) {
+      BROTLI_BOOL result = EncodeData(s, BROTLI_FALSE, BROTLI_TRUE,
+          &s->available_out_, &s->next_out_);
+      if (!result) return BROTLI_FALSE;
+      continue;
+    }
+
+    if (s->stream_state_ == BROTLI_STREAM_METADATA_HEAD) {
+      s->next_out_ = s->tiny_buf_.u8;
+      s->available_out_ =
+          WriteMetadataHeader(s, s->remaining_metadata_bytes_, s->next_out_);
+      s->stream_state_ = BROTLI_STREAM_METADATA_BODY;
+      continue;
+    } else {
+      /* Exit workflow only when there is no more input and no more output.
+         Otherwise client may continue producing empty metadata blocks. */
+      if (s->remaining_metadata_bytes_ == 0) {
+        s->remaining_metadata_bytes_ = BROTLI_UINT32_MAX;
+        s->stream_state_ = BROTLI_STREAM_PROCESSING;
+        break;
+      }
+      if (*available_out) {
+        /* Directly copy input to output. */
+        uint32_t copy = (uint32_t)BROTLI_MIN(
+            size_t, s->remaining_metadata_bytes_, *available_out);
+        memcpy(*next_out, *next_in, copy);
+        *next_in += copy;
+        *available_in -= copy;
+        s->total_in_ += copy;  /* not actually data input, though */
+        s->remaining_metadata_bytes_ -= copy;
+        *next_out += copy;
+        *available_out -= copy;
+      } else {
+        /* This guarantees progress in "TakeOutput" workflow. */
+        uint32_t copy = BROTLI_MIN(uint32_t, s->remaining_metadata_bytes_, 16);
+        s->next_out_ = s->tiny_buf_.u8;
+        memcpy(s->next_out_, *next_in, copy);
+        *next_in += copy;
+        *available_in -= copy;
+        s->total_in_ += copy;  /* not actually data input, though */
+        s->remaining_metadata_bytes_ -= copy;
+        s->available_out_ = copy;
+      }
+      continue;
+    }
+  }
+
+  return BROTLI_TRUE;
+}
+
+static void UpdateSizeHint(BrotliEncoderState* s, size_t available_in) {
+  if (s->params.size_hint == 0) {
+    uint64_t delta = UnprocessedInputSize(s);
+    uint64_t tail = available_in;
+    uint32_t limit = 1u << 30;
+    uint32_t total;
+    if ((delta >= limit) || (tail >= limit) || ((delta + tail) >= limit)) {
+      total = limit;
+    } else {
+      total = (uint32_t)(delta + tail);
+    }
+    s->params.size_hint = total;
+  }
+}
+
+BROTLI_BOOL BrotliEncoderCompressStream(
+    BrotliEncoderState* s, BrotliEncoderOperation op, size_t* available_in,
+    const uint8_t** next_in, size_t* available_out, uint8_t** next_out,
+    size_t* total_out) {
+  if (!EnsureInitialized(s)) return BROTLI_FALSE;
+
+  /* Unfinished metadata block; check requirements. */
+  if (s->remaining_metadata_bytes_ != BROTLI_UINT32_MAX) {
+    if (*available_in != s->remaining_metadata_bytes_) return BROTLI_FALSE;
+    if (op != BROTLI_OPERATION_EMIT_METADATA) return BROTLI_FALSE;
+  }
+
+  if (op == BROTLI_OPERATION_EMIT_METADATA) {
+    UpdateSizeHint(s, 0);  /* First data metablock might be emitted here. */
+    return ProcessMetadata(
+        s, available_in, next_in, available_out, next_out, total_out);
+  }
+
+  if (s->stream_state_ == BROTLI_STREAM_METADATA_HEAD ||
+      s->stream_state_ == BROTLI_STREAM_METADATA_BODY) {
+    return BROTLI_FALSE;
+  }
+
+  if (s->stream_state_ != BROTLI_STREAM_PROCESSING && *available_in != 0) {
+    return BROTLI_FALSE;
+  }
+  if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||
+      s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {
+    return BrotliEncoderCompressStreamFast(s, op, available_in, next_in,
+        available_out, next_out, total_out);
+  }
+  while (BROTLI_TRUE) {
+    size_t remaining_block_size = RemainingInputBlockSize(s);
+    /* Shorten input to flint size. */
+    if (s->flint_ >= 0 && remaining_block_size > (size_t)s->flint_) {
+      remaining_block_size = (size_t)s->flint_;
+    }
+
+    if (remaining_block_size != 0 && *available_in != 0) {
+      size_t copy_input_size =
+          BROTLI_MIN(size_t, remaining_block_size, *available_in);
+      CopyInputToRingBuffer(s, copy_input_size, *next_in);
+      *next_in += copy_input_size;
+      *available_in -= copy_input_size;
+      s->total_in_ += copy_input_size;
+      if (s->flint_ > 0) s->flint_ = (int8_t)(s->flint_ - (int)copy_input_size);
+      continue;
+    }
+
+    if (InjectFlushOrPushOutput(s, available_out, next_out, total_out)) {
+      /* Exit the "emit flint" workflow. */
+      if (s->flint_ == BROTLI_FLINT_WAITING_FOR_FLUSHING) {
+        CheckFlushComplete(s);
+        if (s->stream_state_ == BROTLI_STREAM_PROCESSING) {
+          s->flint_ = BROTLI_FLINT_DONE;
+        }
+      }
+      continue;
+    }
+
+    /* Compress data only when internal output buffer is empty, stream is not
+       finished and there is no pending flush request. */
+    if (s->available_out_ == 0 &&
+        s->stream_state_ == BROTLI_STREAM_PROCESSING) {
+      if (remaining_block_size == 0 || op != BROTLI_OPERATION_PROCESS) {
+        BROTLI_BOOL is_last = TO_BROTLI_BOOL(
+            (*available_in == 0) && op == BROTLI_OPERATION_FINISH);
+        BROTLI_BOOL force_flush = TO_BROTLI_BOOL(
+            (*available_in == 0) && op == BROTLI_OPERATION_FLUSH);
+        BROTLI_BOOL result;
+        /* Force emitting (uncompressed) piece containing flint. */
+        if (!is_last && s->flint_ == 0) {
+          s->flint_ = BROTLI_FLINT_WAITING_FOR_FLUSHING;
+          force_flush = BROTLI_TRUE;
+        }
+        UpdateSizeHint(s, *available_in);
+        result = EncodeData(s, is_last, force_flush,
+            &s->available_out_, &s->next_out_);
+        if (!result) return BROTLI_FALSE;
+        if (force_flush) s->stream_state_ = BROTLI_STREAM_FLUSH_REQUESTED;
+        if (is_last) s->stream_state_ = BROTLI_STREAM_FINISHED;
+        continue;
+      }
+    }
+    break;
+  }
+  CheckFlushComplete(s);
+  return BROTLI_TRUE;
+}
+
+BROTLI_BOOL BrotliEncoderIsFinished(BrotliEncoderState* s) {
+  return TO_BROTLI_BOOL(s->stream_state_ == BROTLI_STREAM_FINISHED &&
+      !BrotliEncoderHasMoreOutput(s));
+}
+
+BROTLI_BOOL BrotliEncoderHasMoreOutput(BrotliEncoderState* s) {
+  return TO_BROTLI_BOOL(s->available_out_ != 0);
+}
+
+const uint8_t* BrotliEncoderTakeOutput(BrotliEncoderState* s, size_t* size) {
+  size_t consumed_size = s->available_out_;
+  uint8_t* result = s->next_out_;
+  if (*size) {
+    consumed_size = BROTLI_MIN(size_t, *size, s->available_out_);
+  }
+  if (consumed_size) {
+    s->next_out_ += consumed_size;
+    s->available_out_ -= consumed_size;
+    s->total_out_ += consumed_size;
+    CheckFlushComplete(s);
+    *size = consumed_size;
+  } else {
+    *size = 0;
+    result = 0;
+  }
+  return result;
+}
+
+uint32_t BrotliEncoderVersion(void) {
+  return BROTLI_VERSION;
+}
+
+BrotliEncoderPreparedDictionary* BrotliEncoderPrepareDictionary(
+    BrotliSharedDictionaryType type, size_t size,
+    const uint8_t data[BROTLI_ARRAY_PARAM(size)], int quality,
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {
+  ManagedDictionary* managed_dictionary = NULL;
+  BROTLI_BOOL type_is_known = BROTLI_FALSE;
+  type_is_known |= (type == BROTLI_SHARED_DICTIONARY_RAW);
+#if defined(BROTLI_EXPERIMENTAL)
+  type_is_known |= (type == BROTLI_SHARED_DICTIONARY_SERIALIZED);
+#endif  /* BROTLI_EXPERIMENTAL */
+  if (!type_is_known) {
+    return NULL;
+  }
+  managed_dictionary =
+      BrotliCreateManagedDictionary(alloc_func, free_func, opaque);
+  if (managed_dictionary == NULL) {
+    return NULL;
+  }
+  if (type == BROTLI_SHARED_DICTIONARY_RAW) {
+    managed_dictionary->dictionary = (uint32_t*)CreatePreparedDictionary(
+        &managed_dictionary->memory_manager_, data, size);
+  }
+#if defined(BROTLI_EXPERIMENTAL)
+  if (type == BROTLI_SHARED_DICTIONARY_SERIALIZED) {
+    SharedEncoderDictionary* dict = (SharedEncoderDictionary*)BrotliAllocate(
+        &managed_dictionary->memory_manager_, sizeof(SharedEncoderDictionary));
+    managed_dictionary->dictionary = (uint32_t*)dict;
+    if (dict != NULL) {
+      BROTLI_BOOL ok = BrotliInitCustomSharedEncoderDictionary(
+          &managed_dictionary->memory_manager_, data, size, quality, dict);
+      if (!ok) {
+        BrotliFree(&managed_dictionary->memory_manager_, dict);
+        managed_dictionary->dictionary = NULL;
+      }
+    }
+  }
+#else  /* BROTLI_EXPERIMENTAL */
+  (void)quality;
+#endif  /* BROTLI_EXPERIMENTAL */
+  if (managed_dictionary->dictionary == NULL) {
+    BrotliDestroyManagedDictionary(managed_dictionary);
+    return NULL;
+  }
+  return (BrotliEncoderPreparedDictionary*)managed_dictionary;
+}
+
+void BrotliEncoderDestroyPreparedDictionary(
+    BrotliEncoderPreparedDictionary* dictionary) {
+  ManagedDictionary* dict = (ManagedDictionary*)dictionary;
+  if (!dictionary) return;
+  /* First field of dictionary structs. */
+  /* Only managed dictionaries are eligible for destruction by this method. */
+  if (dict->magic != kManagedDictionaryMagic) {
+    return;
+  }
+  if (dict->dictionary == NULL) {
+    /* This should never ever happen. */
+  } else if (*dict->dictionary == kLeanPreparedDictionaryMagic) {
+    DestroyPreparedDictionary(
+        &dict->memory_manager_, (PreparedDictionary*)dict->dictionary);
+  } else if (*dict->dictionary == kSharedDictionaryMagic) {
+    BrotliCleanupSharedEncoderDictionary(&dict->memory_manager_,
+        (SharedEncoderDictionary*)dict->dictionary);
+    BrotliFree(&dict->memory_manager_, dict->dictionary);
+  } else {
+    /* There is also kPreparedDictionaryMagic, but such instances should be
+     * constructed and destroyed by different means. */
+  }
+  dict->dictionary = NULL;
+  BrotliDestroyManagedDictionary(dict);
+}
+
+BROTLI_BOOL BrotliEncoderAttachPreparedDictionary(BrotliEncoderState* state,
+    const BrotliEncoderPreparedDictionary* dictionary) {
+  /* First field of dictionary structs */
+  const BrotliEncoderPreparedDictionary* dict = dictionary;
+  uint32_t magic = *((const uint32_t*)dict);
+  SharedEncoderDictionary* current = NULL;
+  if (magic == kManagedDictionaryMagic) {
+    /* Unwrap managed dictionary. */
+    ManagedDictionary* managed_dictionary = (ManagedDictionary*)dict;
+    magic = *managed_dictionary->dictionary;
+    dict = (BrotliEncoderPreparedDictionary*)managed_dictionary->dictionary;
+  }
+  current = &state->params.dictionary;
+  if (magic == kPreparedDictionaryMagic ||
+      magic == kLeanPreparedDictionaryMagic) {
+    const PreparedDictionary* prepared = (const PreparedDictionary*)dict;
+    if (!AttachPreparedDictionary(&current->compound, prepared)) {
+      return BROTLI_FALSE;
+    }
+  } else if (magic == kSharedDictionaryMagic) {
+    const SharedEncoderDictionary* attached =
+        (const SharedEncoderDictionary*)dict;
+    BROTLI_BOOL was_default = !current->contextual.context_based &&
+        current->contextual.num_dictionaries == 1 &&
+        current->contextual.dict[0]->hash_table_words ==
+        kStaticDictionaryHashWords &&
+        current->contextual.dict[0]->hash_table_lengths ==
+        kStaticDictionaryHashLengths;
+    BROTLI_BOOL new_default = !attached->contextual.context_based &&
+        attached->contextual.num_dictionaries == 1 &&
+        attached->contextual.dict[0]->hash_table_words ==
+        kStaticDictionaryHashWords &&
+        attached->contextual.dict[0]->hash_table_lengths ==
+        kStaticDictionaryHashLengths;
+    size_t i;
+    if (state->is_initialized_) return BROTLI_FALSE;
+    current->max_quality =
+        BROTLI_MIN(int, current->max_quality, attached->max_quality);
+    for (i = 0; i < attached->compound.num_chunks; i++) {
+      if (!AttachPreparedDictionary(&current->compound,
+          attached->compound.chunks[i])) {
+        return BROTLI_FALSE;
+      }
+    }
+    if (!new_default) {
+      if (!was_default) return BROTLI_FALSE;
+      /* Copy by value, but then set num_instances_ to 0 because their memory
+      is managed by attached, not by current */
+      current->contextual = attached->contextual;
+      current->contextual.num_instances_ = 0;
+    }
+  } else {
+    return BROTLI_FALSE;
+  }
+  return BROTLI_TRUE;
+}
+
+size_t BrotliEncoderEstimatePeakMemoryUsage(int quality, int lgwin,
+                                            size_t input_size) {
+  BrotliEncoderParams params;
+  size_t memory_manager_slots = BROTLI_ENCODER_MEMORY_MANAGER_SLOTS;
+  size_t memory_manager_size = memory_manager_slots * sizeof(void*);
+  BrotliEncoderInitParams(&params);
+  params.quality = quality;
+  params.lgwin = lgwin;
+  params.size_hint = input_size;
+  params.large_window = lgwin > BROTLI_MAX_WINDOW_BITS;
+  SanitizeParams(&params);
+  params.lgblock = ComputeLgBlock(&params);
+  ChooseHasher(&params, &params.hasher);
+  if (params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||
+      params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {
+    size_t state_size = sizeof(BrotliEncoderState);
+    size_t block_size = BROTLI_MIN(size_t, input_size, (1ul << params.lgwin));
+    size_t hash_table_size =
+        HashTableSize(MaxHashTableSize(params.quality), block_size);
+    size_t hash_size =
+        (hash_table_size < (1u << 10)) ? 0 : sizeof(int) * hash_table_size;
+    size_t cmdbuf_size = params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY ?
+        5 * BROTLI_MIN(size_t, block_size, 1ul << 17) : 0;
+    if (params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {
+      state_size += sizeof(BrotliOnePassArena);
+    } else {
+      state_size += sizeof(BrotliTwoPassArena);
+    }
+    return hash_size + cmdbuf_size + state_size;
+  } else {
+    size_t short_ringbuffer_size = (size_t)1 << params.lgblock;
+    int ringbuffer_bits = ComputeRbBits(&params);
+    size_t ringbuffer_size = input_size < short_ringbuffer_size ?
+        input_size : (1u << ringbuffer_bits) + short_ringbuffer_size;
+    size_t hash_size[4] = {0};
+    size_t metablock_size =
+        BROTLI_MIN(size_t, input_size, MaxMetablockSize(&params));
+    size_t inputblock_size =
+        BROTLI_MIN(size_t, input_size, (size_t)1 << params.lgblock);
+    size_t cmdbuf_size = metablock_size * 2 + inputblock_size * 6;
+    size_t outbuf_size = metablock_size * 2 + 503;
+    size_t histogram_size = 0;
+    HasherSize(&params, BROTLI_TRUE, input_size, hash_size);
+    if (params.quality < MIN_QUALITY_FOR_BLOCK_SPLIT) {
+      cmdbuf_size = BROTLI_MIN(size_t, cmdbuf_size,
+          MAX_NUM_DELAYED_SYMBOLS * sizeof(Command) + inputblock_size * 12);
+    }
+    if (params.quality >= MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING) {
+      /* Only a very rough estimation, based on enwik8. */
+      histogram_size = 200 << 20;
+    } else if (params.quality >= MIN_QUALITY_FOR_BLOCK_SPLIT) {
+      size_t literal_histograms =
+          BROTLI_MIN(size_t, metablock_size / 6144, 256);
+      size_t command_histograms =
+          BROTLI_MIN(size_t, metablock_size / 6144, 256);
+      size_t distance_histograms =
+          BROTLI_MIN(size_t, metablock_size / 6144, 256);
+      histogram_size = literal_histograms * sizeof(HistogramLiteral) +
+                       command_histograms * sizeof(HistogramCommand) +
+                       distance_histograms * sizeof(HistogramDistance);
+    }
+    return (memory_manager_size + ringbuffer_size +
+            hash_size[0] + hash_size[1] + hash_size[2] + hash_size[3] +
+            cmdbuf_size +
+            outbuf_size +
+            histogram_size);
+  }
+}
+size_t BrotliEncoderGetPreparedDictionarySize(
+    const BrotliEncoderPreparedDictionary* prepared_dictionary) {
+  /* First field of dictionary structs */
+  const BrotliEncoderPreparedDictionary* prepared = prepared_dictionary;
+  uint32_t magic = *((const uint32_t*)prepared);
+  size_t overhead = 0;
+  if (magic == kManagedDictionaryMagic) {
+    const ManagedDictionary* managed = (const ManagedDictionary*)prepared;
+    overhead = sizeof(ManagedDictionary);
+    magic = *managed->dictionary;
+    prepared = (const BrotliEncoderPreparedDictionary*)managed->dictionary;
+  }
+
+  if (magic == kPreparedDictionaryMagic) {
+    const PreparedDictionary* dictionary =
+        (const PreparedDictionary*)prepared;
+    /* Keep in sync with step 3 of CreatePreparedDictionary */
+    return sizeof(PreparedDictionary) + dictionary->source_size +
+        (sizeof(uint32_t) << dictionary->slot_bits) +
+        (sizeof(uint16_t) << dictionary->bucket_bits) +
+        (sizeof(uint32_t) * dictionary->num_items) + overhead;
+  } else if (magic == kLeanPreparedDictionaryMagic) {
+    const PreparedDictionary* dictionary =
+        (const PreparedDictionary*)prepared;
+    /* Keep in sync with step 3 of CreatePreparedDictionary */
+    return sizeof(PreparedDictionary) + sizeof(uint8_t*) +
+        (sizeof(uint32_t) << dictionary->slot_bits) +
+        (sizeof(uint16_t) << dictionary->bucket_bits) +
+        (sizeof(uint32_t) * dictionary->num_items) + overhead;
+  } else if (magic == kSharedDictionaryMagic) {
+    const SharedEncoderDictionary* dictionary =
+        (const SharedEncoderDictionary*)prepared;
+    const CompoundDictionary* compound = &dictionary->compound;
+    const ContextualEncoderDictionary* contextual = &dictionary->contextual;
+    size_t result = sizeof(*dictionary);
+    size_t i;
+    size_t num_instances;
+    const BrotliEncoderDictionary* instances;
+    for (i = 0; i < compound->num_prepared_instances_; i++) {
+      size_t size = BrotliEncoderGetPreparedDictionarySize(
+          (const BrotliEncoderPreparedDictionary*)
+          compound->prepared_instances_[i]);
+      if (!size) return 0;  /* error */
+      result += size;
+    }
+    if (contextual->context_based) {
+      num_instances = contextual->num_instances_;
+      instances = contextual->instances_;
+      result += sizeof(*instances) * num_instances;
+    } else {
+      num_instances = 1;
+      instances = &contextual->instance_;
+    }
+    for (i = 0; i < num_instances; i++) {
+      const BrotliEncoderDictionary* dict = &instances[i];
+      result += dict->trie.pool_capacity * sizeof(BrotliTrieNode);
+      if (dict->hash_table_data_words_) {
+        result += sizeof(kStaticDictionaryHashWords);
+      }
+      if (dict->hash_table_data_lengths_) {
+        result += sizeof(kStaticDictionaryHashLengths);
+      }
+      if (dict->buckets_data_) {
+        result += sizeof(*dict->buckets_data_) * dict->buckets_alloc_size_;
+      }
+      if (dict->dict_words_data_) {
+        result += sizeof(*dict->dict_words) * dict->dict_words_alloc_size_;
+      }
+      if (dict->words_instance_) {
+        result += sizeof(*dict->words_instance_);
+        /* data_size not added here: it is never allocated by the
+           SharedEncoderDictionary, instead it always points to the file
+           already loaded in memory. So if the caller wants to include
+           this memory as well, add the size of the loaded dictionary
+           file to this. */
+      }
+    }
+    return result + overhead;
+  }
+  return 0;  /* error */
+}
+
+#if defined(BROTLI_TEST)
+size_t MakeUncompressedStreamForTest(const uint8_t*, size_t, uint8_t*);
+size_t MakeUncompressedStreamForTest(
+    const uint8_t* input, size_t input_size, uint8_t* output) {
+  return MakeUncompressedStream(input, input_size, output);
+}
+#endif
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/encoder_dict.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/encoder_dict.c
new file mode 100644
index 0000000000..0984281c00
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/encoder_dict.c
@@ -0,0 +1,640 @@
+/* Copyright 2017 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include "encoder_dict.h"
+
+#include <stdlib.h>  /* malloc, free */
+
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "../common/shared_dictionary_internal.h"
+#include "../common/transform.h"
+#include "compound_dictionary.h"
+#include "dictionary_hash.h"
+#include "memory.h"
+#include "quality.h"
+#include "hash.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define NUM_HASH_BITS 15u
+#define NUM_HASH_BUCKETS (1u << NUM_HASH_BITS)
+
+static void BrotliTrieInit(BrotliTrie* trie) {
+  trie->pool_capacity = 0;
+  trie->pool_size = 0;
+  trie->pool = 0;
+
+  /* Set up the root node */
+  trie->root.single = 0;
+  trie->root.len_ = 0;
+  trie->root.idx_ = 0;
+  trie->root.sub = 0;
+}
+
+static void BrotliTrieFree(MemoryManager* m, BrotliTrie* trie) {
+  BrotliFree(m, trie->pool);
+}
+
+/* Initializes to RFC 7932 static dictionary / transforms. */
+static void InitEncoderDictionary(BrotliEncoderDictionary* dict) {
+  dict->words = BrotliGetDictionary();
+  dict->num_transforms = (uint32_t)BrotliGetTransforms()->num_transforms;
+
+  dict->hash_table_words = kStaticDictionaryHashWords;
+  dict->hash_table_lengths = kStaticDictionaryHashLengths;
+  dict->buckets = kStaticDictionaryBuckets;
+  dict->dict_words = kStaticDictionaryWords;
+
+  dict->cutoffTransformsCount = kCutoffTransformsCount;
+  dict->cutoffTransforms = kCutoffTransforms;
+
+  dict->parent = 0;
+
+  dict->hash_table_data_words_ = 0;
+  dict->hash_table_data_lengths_ = 0;
+  dict->buckets_alloc_size_ = 0;
+  dict->buckets_data_ = 0;
+  dict->dict_words_alloc_size_ = 0;
+  dict->dict_words_data_ = 0;
+  dict->words_instance_ = 0;
+  dict->has_words_heavy = BROTLI_FALSE;
+  BrotliTrieInit(&dict->trie);
+}
+
+static void BrotliDestroyEncoderDictionary(MemoryManager* m,
+    BrotliEncoderDictionary* dict) {
+  BrotliFree(m, dict->hash_table_data_words_);
+  BrotliFree(m, dict->hash_table_data_lengths_);
+  BrotliFree(m, dict->buckets_data_);
+  BrotliFree(m, dict->dict_words_data_);
+  BrotliFree(m, dict->words_instance_);
+  BrotliTrieFree(m, &dict->trie);
+}
+
+#if defined(BROTLI_EXPERIMENTAL)
+/* Word length must be at least 4 bytes */
+static uint32_t Hash(const uint8_t* data, int bits) {
+  uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;
+  /* The higher bits contain more mixture from the multiplication,
+     so we take our results from there. */
+  return h >> (32 - bits);
+}
+
+/* Theoretical max possible word size after transform */
+#define kTransformedBufferSize \
+    (256 + 256 + SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH)
+
+/* To be safe buffer must have at least kTransformedBufferSize */
+static void TransformedDictionaryWord(uint32_t word_idx, int len, int transform,
+    const BrotliTransforms* transforms,
+    const BrotliEncoderDictionary* dict,
+    uint8_t* buffer, size_t* size) {
+  const uint8_t* dict_word = &dict->words->data[
+      dict->words->offsets_by_length[len] + (uint32_t)len * word_idx];
+  *size = (size_t)BrotliTransformDictionaryWord(buffer, dict_word, len,
+      transforms, transform);
+}
+
+static DictWord MakeDictWord(uint8_t len, uint8_t transform, uint16_t idx) {
+  DictWord result;
+  result.len = len;
+  result.transform = transform;
+  result.idx = idx;
+  return result;
+}
+
+static uint32_t BrotliTrieAlloc(MemoryManager* m, size_t num, BrotliTrie* trie,
+                                BrotliTrieNode** keep) {
+  uint32_t result;
+  uint32_t keep_index = 0;
+  if (keep && *keep != &trie->root) {
+    /* Optional node to keep, since address may change after re-allocating */
+    keep_index = (uint32_t)(*keep - trie->pool);
+  }
+  if (trie->pool_size == 0) {
+    /* Have a placeholder node in the front. We do not want the result to be 0,
+       it must be at least 1, 0 represents "null pointer" */
+    trie->pool_size = 1;
+  }
+  BROTLI_ENSURE_CAPACITY(m, BrotliTrieNode, trie->pool, trie->pool_capacity,
+                         trie->pool_size + num);
+  if (BROTLI_IS_OOM(m)) return 0;
+  /* Init the new nodes to empty */
+  memset(trie->pool + trie->pool_size, 0, sizeof(*trie->pool) * num);
+  result = (uint32_t)trie->pool_size;
+  trie->pool_size += num;
+  if (keep && *keep != &trie->root) {
+    *keep = trie->pool + keep_index;
+  }
+  return result;
+}
+
+/**
+ * len and idx: payload for last node
+ * word, size: the string
+ * index: position in the string
+ */
+static BROTLI_BOOL BrotliTrieNodeAdd(MemoryManager* m, uint8_t len,
+    uint32_t idx, const uint8_t* word, size_t size, int index,
+    BrotliTrieNode* node, BrotliTrie* trie) {
+  BrotliTrieNode* child = 0;
+  uint8_t c;
+  if ((size_t)index == size) {
+    if (!node->len_ || idx < node->idx_) {
+      node->len_ = len;
+      node->idx_ = idx;
+    }
+    return BROTLI_TRUE;
+  }
+  c = word[index];
+  if (node->single && c != node->c) {
+    BrotliTrieNode old = trie->pool[node->sub];
+    uint32_t new_nodes = BrotliTrieAlloc(m, 32, trie, &node);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    node->single = 0;
+    node->sub = new_nodes;
+    trie->pool[node->sub + (node->c >> 4)].sub = new_nodes + 16;
+    trie->pool[trie->pool[node->sub + (node->c >> 4)].sub + (node->c & 15)] =
+        old;
+  }
+  if (!node->sub) {
+    uint32_t new_node = BrotliTrieAlloc(m, 1, trie, &node);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    node->single = 1;
+    node->c = c;
+    node->sub = new_node;
+  }
+  if (node->single) {
+    child = &trie->pool[node->sub];
+  } else {
+    if (!trie->pool[node->sub + (c >> 4)].sub) {
+      uint32_t new_nodes = BrotliTrieAlloc(m, 16, trie, &node);
+      if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+      trie->pool[node->sub + (c >> 4)].sub = new_nodes;
+    }
+    child = &trie->pool[trie->pool[node->sub + (c >> 4)].sub + (c & 15)];
+  }
+  return BrotliTrieNodeAdd(m, len, idx, word, size, index + 1, child, trie);
+}
+
+static BROTLI_BOOL BrotliTrieAdd(MemoryManager* m, uint8_t len, uint32_t idx,
+                          const uint8_t* word, size_t size, BrotliTrie* trie) {
+  return BrotliTrieNodeAdd(m, len, idx, word, size, 0, &trie->root, trie);
+}
+
+const BrotliTrieNode* BrotliTrieSub(const BrotliTrie* trie,
+                                    const BrotliTrieNode* node, uint8_t c) {
+  BrotliTrieNode* temp_node;
+  if (node->single) {
+    if (node->c == c) return &trie->pool[node->sub];
+    return 0;
+  }
+  if (!node->sub) return 0;
+  temp_node = &trie->pool[node->sub + (c >> 4)];
+  if (!temp_node->sub) return 0;
+  return &trie->pool[temp_node->sub + (c & 15)];
+}
+
+static const BrotliTrieNode* BrotliTrieFind(const BrotliTrie* trie,
+                                            const uint8_t* word, size_t size) {
+  const BrotliTrieNode* node = &trie->root;
+  size_t i;
+  for (i = 0; i < size; i++) {
+    node = BrotliTrieSub(trie, node, word[i]);
+    if (!node) return 0;
+  }
+  return node;
+}
+
+static BROTLI_BOOL BuildDictionaryLut(MemoryManager* m,
+    const BrotliTransforms* transforms,
+    BrotliEncoderDictionary* dict) {
+  uint32_t i;
+  DictWord* dict_words;
+  uint16_t* buckets;
+  DictWord** words_by_hash;
+  size_t* words_by_hash_size;
+  size_t* words_by_hash_capacity;
+  BrotliTrie dedup;
+  uint8_t word[kTransformedBufferSize];
+  size_t word_size;
+  size_t total = 0;
+  uint8_t l;
+  uint16_t idx;
+
+  BrotliTrieInit(&dedup);
+
+  words_by_hash = (DictWord**)BrotliAllocate(m,
+      sizeof(*words_by_hash) * NUM_HASH_BUCKETS);
+  words_by_hash_size = (size_t*)BrotliAllocate(m,
+      sizeof(*words_by_hash_size) * NUM_HASH_BUCKETS);
+  words_by_hash_capacity = (size_t*)BrotliAllocate(m,
+      sizeof(*words_by_hash_capacity) * NUM_HASH_BUCKETS);
+  if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+  memset(words_by_hash, 0, sizeof(*words_by_hash) * NUM_HASH_BUCKETS);
+  memset(words_by_hash_size, 0, sizeof(*words_by_hash_size) * NUM_HASH_BUCKETS);
+  memset(words_by_hash_capacity, 0,
+         sizeof(*words_by_hash_capacity) * NUM_HASH_BUCKETS);
+
+  if (transforms->num_transforms > 0) {
+    for (l = SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH;
+        l <= SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH; ++l) {
+      uint16_t n = dict->words->size_bits_by_length[l] ?
+          (uint16_t)(1 << dict->words->size_bits_by_length[l]) : 0u;
+      for (idx = 0; idx < n; ++idx) {
+        uint32_t key;
+        /* First transform (usually identity) */
+        TransformedDictionaryWord(idx, l, 0, transforms, dict, word,
+                                  &word_size);
+        /* Cannot hash words smaller than 4 bytes */
+        if (word_size < 4) {
+          /* Break instead of continue, all next words of this length will have
+             same length after transform */
+          break;
+        }
+        if (!BrotliTrieAdd(m, 0, idx, word, word_size, &dedup)) {
+          return BROTLI_FALSE;
+        }
+        key = Hash(word, NUM_HASH_BITS);
+        BROTLI_ENSURE_CAPACITY_APPEND(m, DictWord, words_by_hash[key],
+            words_by_hash_capacity[key], words_by_hash_size[key],
+            MakeDictWord(l, 0, idx));
+        ++total;
+      }
+    }
+  }
+
+  /* These LUT transforms only supported if no custom transforms. This is
+     ok, we will use the heavy trie instead. */
+  if (transforms == BrotliGetTransforms()) {
+    for (l = SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH;
+        l <= SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH; ++l) {
+      uint16_t n = dict->words->size_bits_by_length[l] ?
+          (uint16_t)(1 << dict->words->size_bits_by_length[l]) : 0u;
+      for (idx = 0; idx < n; ++idx) {
+        int k;
+        BROTLI_BOOL is_ascii = BROTLI_TRUE;
+        size_t offset = dict->words->offsets_by_length[l] + (size_t)l * idx;
+        const uint8_t* data = &dict->words->data[offset];
+        for (k = 0; k < l; ++k) {
+          if (data[k] >= 128) is_ascii = BROTLI_FALSE;
+        }
+        if (data[0] < 128) {
+          int transform = 9;  /* {empty, uppercase first, empty} */
+          uint32_t ix = idx + (uint32_t)transform * n;
+          const BrotliTrieNode* it;
+          TransformedDictionaryWord(idx, l, transform, transforms,
+                                   dict, word, &word_size);
+          it = BrotliTrieFind(&dedup, word, word_size);
+          if (!it || it->idx_ > ix) {
+            uint32_t key = Hash(word, NUM_HASH_BITS);
+            if (!BrotliTrieAdd(m, 0, ix, word, word_size, &dedup)) {
+              return BROTLI_FALSE;
+            }
+            BROTLI_ENSURE_CAPACITY_APPEND(m, DictWord, words_by_hash[key],
+                words_by_hash_capacity[key], words_by_hash_size[key],
+                MakeDictWord(l, BROTLI_TRANSFORM_UPPERCASE_FIRST, idx));
+            ++total;
+          }
+        }
+        if (is_ascii) {
+          int transform = 44;  /* {empty, uppercase all, empty} */
+          uint32_t ix = idx + (uint32_t)transform * n;
+          const BrotliTrieNode* it;
+          TransformedDictionaryWord(idx, l, transform, transforms,
+                                    dict, word, &word_size);
+          it = BrotliTrieFind(&dedup, word, word_size);
+          if (!it || it->idx_ > ix) {
+            uint32_t key = Hash(word, NUM_HASH_BITS);
+            if (!BrotliTrieAdd(m, 0, ix, word, word_size, &dedup)) {
+              return BROTLI_FALSE;
+            }
+            BROTLI_ENSURE_CAPACITY_APPEND(m, DictWord, words_by_hash[key],
+                words_by_hash_capacity[key], words_by_hash_size[key],
+                MakeDictWord(l, BROTLI_TRANSFORM_UPPERCASE_ALL, idx));
+            ++total;
+          }
+        }
+      }
+    }
+  }
+
+  dict_words = (DictWord*)BrotliAllocate(m,
+      sizeof(*dict->dict_words) * (total + 1));
+  buckets = (uint16_t*)BrotliAllocate(m,
+      sizeof(*dict->buckets) * NUM_HASH_BUCKETS);
+  if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+  dict->dict_words_alloc_size_ = total + 1;
+  dict->dict_words = dict->dict_words_data_ = dict_words;
+  dict->buckets_alloc_size_ = NUM_HASH_BUCKETS;
+  dict->buckets = dict->buckets_data_ = buckets;
+
+  /* Unused; makes offsets start from 1. */
+  dict_words[0] = MakeDictWord(0, 0, 0);
+  total = 1;
+  for (i = 0; i < NUM_HASH_BUCKETS; ++i) {
+    size_t num_words = words_by_hash_size[i];
+    if (num_words > 0) {
+      buckets[i] = (uint16_t)(total);
+      memcpy(&dict_words[total], &words_by_hash[i][0],
+          sizeof(dict_words[0]) * num_words);
+      total += num_words;
+      dict_words[total - 1].len |= 0x80;
+    } else {
+      buckets[i] = 0;
+    }
+  }
+
+  for (i = 0; i < NUM_HASH_BUCKETS; ++i) {
+    BrotliFree(m, words_by_hash[i]);
+  }
+  BrotliFree(m, words_by_hash);
+  BrotliFree(m, words_by_hash_size);
+  BrotliFree(m, words_by_hash_capacity);
+  BrotliTrieFree(m, &dedup);
+
+  return BROTLI_TRUE;
+}
+
+static void BuildDictionaryHashTable(uint16_t* hash_table_words,
+    uint8_t* hash_table_lengths, const BrotliDictionary* dict) {
+  int j, len;
+  /* The order of the loops is such that in case of collision, words with
+     shorter length are preferred, and in case of same length, words with
+     smaller index. There is only a single word per bucket. */
+  /* TODO(lode): consider adding optional user-supplied frequency_map to use
+     for preferred words instead, this can make the encoder better for
+     quality 9 and below without affecting the decoder */
+  memset(hash_table_words, 0, sizeof(kStaticDictionaryHashWords));
+  memset(hash_table_lengths, 0, sizeof(kStaticDictionaryHashLengths));
+  for (len = SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH;
+      len >= SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH; --len) {
+    const size_t num_words = dict->size_bits_by_length[len] ?
+        (1u << dict->size_bits_by_length[len]) : 0;
+    for (j = (int)num_words - 1; j >= 0; --j) {
+      size_t offset = dict->offsets_by_length[len] +
+          (size_t)len * (size_t)j;
+      const uint8_t* word = &dict->data[offset];
+      const uint32_t key = Hash(word, 14);
+      int idx = (int)(key << 1) + (len < 8 ? 1 : 0);
+      BROTLI_DCHECK(idx < (int)NUM_HASH_BUCKETS);
+      hash_table_words[idx] = (uint16_t)j;
+      hash_table_lengths[idx] = (uint8_t)len;
+    }
+  }
+}
+
+static BROTLI_BOOL GenerateWordsHeavy(MemoryManager* m,
+    const BrotliTransforms* transforms,
+    BrotliEncoderDictionary* dict) {
+  int i, j, l;
+  for (j = (int)transforms->num_transforms - 1; j >= 0 ; --j) {
+    for (l = 0; l < 32; l++) {
+      int num = (int)((1u << dict->words->size_bits_by_length[l]) & ~1u);
+      for (i = 0; i < num; i++) {
+        uint8_t transformed[kTransformedBufferSize];
+        size_t size;
+        TransformedDictionaryWord(
+            (uint32_t)i, l, j, transforms, dict, transformed, &size);
+        if (size < 4) continue;
+        if (!BrotliTrieAdd(m, (uint8_t)l, (uint32_t)(i + num * j),
+            transformed, size, &dict->trie)) {
+          return BROTLI_FALSE;
+        }
+      }
+    }
+  }
+  return BROTLI_TRUE;
+}
+
+/* Computes cutoffTransformsCount (in count) and cutoffTransforms (in data) for
+   the custom transforms, where possible within the limits of the
+   cutoffTransforms encoding. The fast encoder uses this to do fast lookup for
+   transforms that remove the N last characters (OmitLast). */
+static void ComputeCutoffTransforms(
+    const BrotliTransforms* transforms,
+    uint32_t* count, uint64_t* data) {
+  int i;
+  /* The encoding in a 64-bit integer of transform N in the data is: (N << 2) +
+     ((cutoffTransforms >> (N * 6)) & 0x3F), so for example the identity
+     transform code must be 0-63, for N=1 the transform code must be 4-67, ...,
+     for N=9 it must be 36-99.
+     TODO(lode): consider a simple flexible uint8_t[10] instead of the uint64_t
+     for the cutoff transforms, so that shared dictionaries can have the
+     OmitLast transforms anywhere without loss. */
+  *count = 0;
+  *data = 0;
+  for (i = 0; i < BROTLI_TRANSFORMS_MAX_CUT_OFF + 1; i++) {
+    int idx = transforms->cutOffTransforms[i];
+    if (idx == -1) break;  /* Not found */
+    if (idx < (i << 2)) break;  /* Too small for the encoding */
+    if (idx >= (i << 2) + 64) break;  /* Too large for the encoding */
+    (*count)++;
+    *data |= (uint64_t)(((uint64_t)idx -
+        ((uint64_t)i << 2u)) << ((uint64_t)i * 6u));
+  }
+}
+
+static BROTLI_BOOL ComputeDictionary(MemoryManager* m, int quality,
+    const BrotliTransforms* transforms,
+    BrotliEncoderDictionary* current) {
+  int default_words = current->words == BrotliGetDictionary();
+  int default_transforms = transforms == BrotliGetTransforms();
+
+  if (default_words && default_transforms) {
+    /* hashes are already set to Brotli defaults */
+    return BROTLI_TRUE;
+  }
+
+  current->hash_table_data_words_ = (uint16_t*)BrotliAllocate(
+      m, sizeof(kStaticDictionaryHashWords));
+  current->hash_table_data_lengths_ = (uint8_t*)BrotliAllocate(
+      m, sizeof(kStaticDictionaryHashLengths));
+  if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+  current->hash_table_words = current->hash_table_data_words_;
+  current->hash_table_lengths = current->hash_table_data_lengths_;
+
+  BuildDictionaryHashTable(current->hash_table_data_words_,
+      current->hash_table_data_lengths_, current->words);
+
+  ComputeCutoffTransforms(transforms,
+      &current->cutoffTransformsCount, &current->cutoffTransforms);
+
+  /* Only compute the data for slow encoder if the requested quality is high
+     enough to need it */
+  if (quality >= ZOPFLIFICATION_QUALITY) {
+    if (!BuildDictionaryLut(m, transforms, current)) return BROTLI_FALSE;
+
+    /* For the built-in Brotli transforms, there is a hard-coded function to
+       handle all transforms, but for custom transforms, we use the following
+       large hammer instead */
+    current->has_words_heavy = !default_transforms;
+    if (current->has_words_heavy) {
+      if (!GenerateWordsHeavy(m, transforms, current)) return BROTLI_FALSE;
+    }
+  }
+
+  return BROTLI_TRUE;
+}
+#endif  /* BROTLI_EXPERIMENTAL */
+
+void BrotliInitSharedEncoderDictionary(SharedEncoderDictionary* dict) {
+  dict->magic = kSharedDictionaryMagic;
+
+  dict->compound.num_chunks = 0;
+  dict->compound.total_size = 0;
+  dict->compound.chunk_offsets[0] = 0;
+  dict->compound.num_prepared_instances_ = 0;
+
+  dict->contextual.context_based = 0;
+  dict->contextual.num_dictionaries = 1;
+  dict->contextual.instances_ = 0;
+  dict->contextual.num_instances_ = 1;  /* The instance_ field */
+  dict->contextual.dict[0] = &dict->contextual.instance_;
+  InitEncoderDictionary(&dict->contextual.instance_);
+  dict->contextual.instance_.parent = &dict->contextual;
+
+  dict->max_quality = BROTLI_MAX_QUALITY;
+}
+
+#if defined(BROTLI_EXPERIMENTAL)
+/* TODO(eustas): make sure that tooling will warn user if not all the cutoff
+   transforms are available (for low-quality encoder). */
+static BROTLI_BOOL InitCustomSharedEncoderDictionary(
+    MemoryManager* m, const BrotliSharedDictionary* decoded_dict,
+    int quality, SharedEncoderDictionary* dict) {
+  ContextualEncoderDictionary* contextual;
+  CompoundDictionary* compound;
+  BrotliEncoderDictionary* instances;
+  int i;
+  BrotliInitSharedEncoderDictionary(dict);
+
+  contextual = &dict->contextual;
+  compound = &dict->compound;
+
+  for (i = 0; i < (int)decoded_dict->num_prefix; i++) {
+    PreparedDictionary* prepared = CreatePreparedDictionary(m,
+        decoded_dict->prefix[i], decoded_dict->prefix_size[i]);
+    AttachPreparedDictionary(compound, prepared);
+    /* remember for cleanup */
+    compound->prepared_instances_[
+        compound->num_prepared_instances_++] = prepared;
+  }
+
+  dict->max_quality = quality;
+  contextual->context_based = decoded_dict->context_based;
+  if (decoded_dict->context_based) {
+    memcpy(contextual->context_map, decoded_dict->context_map,
+        SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS);
+  }
+
+  contextual->num_dictionaries = decoded_dict->num_dictionaries;
+  contextual->num_instances_ = decoded_dict->num_dictionaries;
+  if (contextual->num_instances_ == 1) {
+    instances = &contextual->instance_;
+  } else {
+    contextual->instances_ = (BrotliEncoderDictionary*)
+        BrotliAllocate(m, sizeof(*contextual->instances_) *
+        contextual->num_instances_);
+    if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+    instances = contextual->instances_;
+  }
+  for (i = 0; i < (int)contextual->num_instances_; i++) {
+    BrotliEncoderDictionary* current = &instances[i];
+    InitEncoderDictionary(current);
+    current->parent = &dict->contextual;
+    if (decoded_dict->words[i] == BrotliGetDictionary()) {
+      current->words = BrotliGetDictionary();
+    } else {
+      current->words_instance_ = (BrotliDictionary*)BrotliAllocate(
+          m, sizeof(BrotliDictionary));
+      if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;
+      *current->words_instance_ = *decoded_dict->words[i];
+      current->words = current->words_instance_;
+    }
+    current->num_transforms =
+        (uint32_t)decoded_dict->transforms[i]->num_transforms;
+    if (!ComputeDictionary(
+        m, quality, decoded_dict->transforms[i], current)) {
+      return BROTLI_FALSE;
+    }
+
+    contextual->dict[i] = current;
+  }
+
+  return BROTLI_TRUE;  /* success */
+}
+
+BROTLI_BOOL BrotliInitCustomSharedEncoderDictionary(
+    MemoryManager* m, const uint8_t* encoded_dict, size_t size,
+    int quality, SharedEncoderDictionary* dict) {
+  BROTLI_BOOL success = BROTLI_FALSE;
+  BrotliSharedDictionary* decoded_dict = BrotliSharedDictionaryCreateInstance(
+      m->alloc_func, m->free_func, m->opaque);
+  if (!decoded_dict) {  /* OOM */
+    return BROTLI_FALSE;
+  }
+  success = BrotliSharedDictionaryAttach(
+      decoded_dict, BROTLI_SHARED_DICTIONARY_SERIALIZED, size, encoded_dict);
+  if (success) {
+    success = InitCustomSharedEncoderDictionary(m,
+        decoded_dict, quality, dict);
+  }
+  BrotliSharedDictionaryDestroyInstance(decoded_dict);
+  return success;
+}
+#endif  /* BROTLI_EXPERIMENTAL */
+
+void BrotliCleanupSharedEncoderDictionary(MemoryManager* m,
+                                          SharedEncoderDictionary* dict) {
+  size_t i;
+  for (i = 0; i < dict->compound.num_prepared_instances_; i++) {
+    DestroyPreparedDictionary(m,
+        (PreparedDictionary*)dict->compound.prepared_instances_[i]);
+  }
+  if (dict->contextual.num_instances_ == 1) {
+    BrotliDestroyEncoderDictionary(m, &dict->contextual.instance_);
+  } else if (dict->contextual.num_instances_ > 1) {
+    for (i = 0; i < dict->contextual.num_instances_; i++) {
+      BrotliDestroyEncoderDictionary(m, &dict->contextual.instances_[i]);
+    }
+    BrotliFree(m, dict->contextual.instances_);
+  }
+}
+
+ManagedDictionary* BrotliCreateManagedDictionary(
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {
+  ManagedDictionary* result = (ManagedDictionary*)BrotliBootstrapAlloc(
+      sizeof(ManagedDictionary), alloc_func, free_func, opaque);
+  if (result == NULL) return NULL;
+
+  result->magic = kManagedDictionaryMagic;
+  BrotliInitMemoryManager(
+      &result->memory_manager_, alloc_func, free_func, opaque);
+  result->dictionary = NULL;
+
+  return result;
+}
+
+void BrotliDestroyManagedDictionary(ManagedDictionary* dictionary) {
+  if (!dictionary) return;
+  BrotliBootstrapFree(dictionary, &dictionary->memory_manager_);
+}
+
+/* Escalate internal functions visibility; for testing purposes only. */
+#if defined(BROTLI_TEST)
+void InitEncoderDictionaryForTest(BrotliEncoderDictionary*);
+void InitEncoderDictionaryForTest(BrotliEncoderDictionary* d) {
+  InitEncoderDictionary(d);
+}
+#endif
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/encoder_dict.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/encoder_dict.h
new file mode 100644
index 0000000000..27dcbcd2f3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/encoder_dict.h
@@ -0,0 +1,157 @@
+/* Copyright 2017 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#ifndef BROTLI_ENC_ENCODER_DICT_H_
+#define BROTLI_ENC_ENCODER_DICT_H_
+
+#include <brotli/shared_dictionary.h>
+#include <brotli/types.h>
+
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "compound_dictionary.h"
+#include "memory.h"
+#include "static_dict_lut.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/*
+Dictionary hierarchy for Encoder:
+-SharedEncoderDictionary
+--CompoundDictionary
+---PreparedDictionary [up to 15x]
+   = prefix dictionary with precomputed hashes
+--ContextualEncoderDictionary
+---BrotliEncoderDictionary [up to 64x]
+   = for each context, precomputed static dictionary with words + transforms
+
+Dictionary hiearchy from common: similar, but without precomputed hashes
+-BrotliSharedDictionary
+--BrotliDictionary [up to 64x]
+--BrotliTransforms [up to 64x]
+--const uint8_t* prefix [up to 15x]: compound dictionaries
+*/
+
+typedef struct BrotliTrieNode {
+  uint8_t single;  /* if 1, sub is a single node for c instead of 256 */
+  uint8_t c;
+  uint8_t len_;  /* untransformed length */
+  uint32_t idx_;  /* word index + num words * transform index */
+  uint32_t sub;  /* index of sub node(s) in the pool */
+} BrotliTrieNode;
+
+typedef struct BrotliTrie {
+  BrotliTrieNode* pool;
+  size_t pool_capacity;
+  size_t pool_size;
+  BrotliTrieNode root;
+} BrotliTrie;
+
+#if defined(BROTLI_EXPERIMENTAL)
+BROTLI_INTERNAL const BrotliTrieNode* BrotliTrieSub(const BrotliTrie* trie,
+    const BrotliTrieNode* node, uint8_t c);
+#endif  /* BROTLI_EXPERIMENTAL */
+
+/* Dictionary data (words and transforms) for 1 possible context */
+typedef struct BrotliEncoderDictionary {
+  const BrotliDictionary* words;
+  uint32_t num_transforms;
+
+  /* cut off for fast encoder */
+  uint32_t cutoffTransformsCount;
+  uint64_t cutoffTransforms;
+
+  /* from dictionary_hash.h, for fast encoder */
+  const uint16_t* hash_table_words;
+  const uint8_t* hash_table_lengths;
+
+  /* from static_dict_lut.h, for slow encoder */
+  const uint16_t* buckets;
+  const DictWord* dict_words;
+  /* Heavy version, for use by slow encoder when there are custom transforms.
+     Contains every possible transformed dictionary word in a trie. It encodes
+     about as fast as the non-heavy encoder but consumes a lot of memory and
+     takes time to build. */
+  BrotliTrie trie;
+  BROTLI_BOOL has_words_heavy;
+
+  /* Reference to other dictionaries. */
+  const struct ContextualEncoderDictionary* parent;
+
+  /* Allocated memory, used only when not using the Brotli defaults */
+  uint16_t* hash_table_data_words_;
+  uint8_t* hash_table_data_lengths_;
+  size_t buckets_alloc_size_;
+  uint16_t* buckets_data_;
+  size_t dict_words_alloc_size_;
+  DictWord* dict_words_data_;
+  BrotliDictionary* words_instance_;
+} BrotliEncoderDictionary;
+
+/* Dictionary data for all 64 contexts */
+typedef struct ContextualEncoderDictionary {
+  BROTLI_BOOL context_based;
+  uint8_t num_dictionaries;
+  uint8_t context_map[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];
+  const BrotliEncoderDictionary* dict[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];
+
+  /* If num_instances_ is 1, instance_ is used, else dynamic allocation with
+     instances_ is used. */
+  size_t num_instances_;
+  BrotliEncoderDictionary instance_;
+  BrotliEncoderDictionary* instances_;
+} ContextualEncoderDictionary;
+
+typedef struct SharedEncoderDictionary {
+  /* Magic value to distinguish this struct from PreparedDictionary for
+     certain external usages. */
+  uint32_t magic;
+
+  /* LZ77 prefix, compound dictionary */
+  CompoundDictionary compound;
+
+  /* Custom static dictionary (optionally context-based) */
+  ContextualEncoderDictionary contextual;
+
+  /* The maximum quality the dictionary was computed for */
+  int max_quality;
+} SharedEncoderDictionary;
+
+typedef struct ManagedDictionary {
+  uint32_t magic;
+  MemoryManager memory_manager_;
+  uint32_t* dictionary;
+} ManagedDictionary;
+
+/* Initializes to the brotli built-in dictionary */
+BROTLI_INTERNAL void BrotliInitSharedEncoderDictionary(
+    SharedEncoderDictionary* dict);
+
+#if defined(BROTLI_EXPERIMENTAL)
+/* Initializes to shared dictionary that will be parsed from
+   encoded_dict. Requires that you keep the encoded_dict buffer
+   around, parts of data will point to it. */
+BROTLI_INTERNAL BROTLI_BOOL BrotliInitCustomSharedEncoderDictionary(
+    MemoryManager* m, const uint8_t* encoded_dict, size_t size,
+    int quality, SharedEncoderDictionary* dict);
+#endif  /* BROTLI_EXPERIMENTAL */
+
+BROTLI_INTERNAL void BrotliCleanupSharedEncoderDictionary(
+    MemoryManager* m, SharedEncoderDictionary* dict);
+
+BROTLI_INTERNAL ManagedDictionary* BrotliCreateManagedDictionary(
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);
+
+BROTLI_INTERNAL void BrotliDestroyManagedDictionary(
+    ManagedDictionary* dictionary);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_ENCODER_DICT_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/entropy_encode.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/entropy_encode.c
new file mode 100644
index 0000000000..9aed43b6eb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/entropy_encode.c
@@ -0,0 +1,504 @@
+/* Copyright 2010 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Entropy encoding (Huffman) utilities. */
+
+#include "entropy_encode.h"
+
+#include <string.h>  /* memset */
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+const size_t kBrotliShellGaps[] = {132, 57, 23, 10, 4, 1};
+
+BROTLI_BOOL BrotliSetDepth(
+    int p0, HuffmanTree* pool, uint8_t* depth, int max_depth) {
+  int stack[16];
+  int level = 0;
+  int p = p0;
+  BROTLI_DCHECK(max_depth <= 15);
+  stack[0] = -1;
+  while (BROTLI_TRUE) {
+    if (pool[p].index_left_ >= 0) {
+      level++;
+      if (level > max_depth) return BROTLI_FALSE;
+      stack[level] = pool[p].index_right_or_value_;
+      p = pool[p].index_left_;
+      continue;
+    } else {
+      depth[pool[p].index_right_or_value_] = (uint8_t)level;
+    }
+    while (level >= 0 && stack[level] == -1) level--;
+    if (level < 0) return BROTLI_TRUE;
+    p = stack[level];
+    stack[level] = -1;
+  }
+}
+
+/* Sort the root nodes, least popular first. */
+static BROTLI_INLINE BROTLI_BOOL SortHuffmanTree(
+    const HuffmanTree* v0, const HuffmanTree* v1) {
+  if (v0->total_count_ != v1->total_count_) {
+    return TO_BROTLI_BOOL(v0->total_count_ < v1->total_count_);
+  }
+  return TO_BROTLI_BOOL(v0->index_right_or_value_ > v1->index_right_or_value_);
+}
+
+/* This function will create a Huffman tree.
+
+   The catch here is that the tree cannot be arbitrarily deep.
+   Brotli specifies a maximum depth of 15 bits for "code trees"
+   and 7 bits for "code length code trees."
+
+   count_limit is the value that is to be faked as the minimum value
+   and this minimum value is raised until the tree matches the
+   maximum length requirement.
+
+   This algorithm is not of excellent performance for very long data blocks,
+   especially when population counts are longer than 2**tree_limit, but
+   we are not planning to use this with extremely long blocks.
+
+   See http://en.wikipedia.org/wiki/Huffman_coding */
+void BrotliCreateHuffmanTree(const uint32_t* data,
+                             const size_t length,
+                             const int tree_limit,
+                             HuffmanTree* tree,
+                             uint8_t* depth) {
+  uint32_t count_limit;
+  HuffmanTree sentinel;
+  InitHuffmanTree(&sentinel, BROTLI_UINT32_MAX, -1, -1);
+  /* For block sizes below 64 kB, we never need to do a second iteration
+     of this loop. Probably all of our block sizes will be smaller than
+     that, so this loop is mostly of academic interest. If we actually
+     would need this, we would be better off with the Katajainen algorithm. */
+  for (count_limit = 1; ; count_limit *= 2) {
+    size_t n = 0;
+    size_t i;
+    size_t j;
+    size_t k;
+    for (i = length; i != 0;) {
+      --i;
+      if (data[i]) {
+        const uint32_t count = BROTLI_MAX(uint32_t, data[i], count_limit);
+        InitHuffmanTree(&tree[n++], count, -1, (int16_t)i);
+      }
+    }
+
+    if (n == 1) {
+      depth[tree[0].index_right_or_value_] = 1;  /* Only one element. */
+      break;
+    }
+
+    SortHuffmanTreeItems(tree, n, SortHuffmanTree);
+
+    /* The nodes are:
+       [0, n): the sorted leaf nodes that we start with.
+       [n]: we add a sentinel here.
+       [n + 1, 2n): new parent nodes are added here, starting from
+                    (n+1). These are naturally in ascending order.
+       [2n]: we add a sentinel at the end as well.
+       There will be (2n+1) elements at the end. */
+    tree[n] = sentinel;
+    tree[n + 1] = sentinel;
+
+    i = 0;      /* Points to the next leaf node. */
+    j = n + 1;  /* Points to the next non-leaf node. */
+    for (k = n - 1; k != 0; --k) {
+      size_t left, right;
+      if (tree[i].total_count_ <= tree[j].total_count_) {
+        left = i;
+        ++i;
+      } else {
+        left = j;
+        ++j;
+      }
+      if (tree[i].total_count_ <= tree[j].total_count_) {
+        right = i;
+        ++i;
+      } else {
+        right = j;
+        ++j;
+      }
+
+      {
+        /* The sentinel node becomes the parent node. */
+        size_t j_end = 2 * n - k;
+        tree[j_end].total_count_ =
+            tree[left].total_count_ + tree[right].total_count_;
+        tree[j_end].index_left_ = (int16_t)left;
+        tree[j_end].index_right_or_value_ = (int16_t)right;
+
+        /* Add back the last sentinel node. */
+        tree[j_end + 1] = sentinel;
+      }
+    }
+    if (BrotliSetDepth((int)(2 * n - 1), &tree[0], depth, tree_limit)) {
+      /* We need to pack the Huffman tree in tree_limit bits. If this was not
+         successful, add fake entities to the lowest values and retry. */
+      break;
+    }
+  }
+}
+
+static void Reverse(uint8_t* v, size_t start, size_t end) {
+  --end;
+  while (start < end) {
+    uint8_t tmp = v[start];
+    v[start] = v[end];
+    v[end] = tmp;
+    ++start;
+    --end;
+  }
+}
+
+static void BrotliWriteHuffmanTreeRepetitions(
+    const uint8_t previous_value,
+    const uint8_t value,
+    size_t repetitions,
+    size_t* tree_size,
+    uint8_t* tree,
+    uint8_t* extra_bits_data) {
+  BROTLI_DCHECK(repetitions > 0);
+  if (previous_value != value) {
+    tree[*tree_size] = value;
+    extra_bits_data[*tree_size] = 0;
+    ++(*tree_size);
+    --repetitions;
+  }
+  if (repetitions == 7) {
+    tree[*tree_size] = value;
+    extra_bits_data[*tree_size] = 0;
+    ++(*tree_size);
+    --repetitions;
+  }
+  if (repetitions < 3) {
+    size_t i;
+    for (i = 0; i < repetitions; ++i) {
+      tree[*tree_size] = value;
+      extra_bits_data[*tree_size] = 0;
+      ++(*tree_size);
+    }
+  } else {
+    size_t start = *tree_size;
+    repetitions -= 3;
+    while (BROTLI_TRUE) {
+      tree[*tree_size] = BROTLI_REPEAT_PREVIOUS_CODE_LENGTH;
+      extra_bits_data[*tree_size] = repetitions & 0x3;
+      ++(*tree_size);
+      repetitions >>= 2;
+      if (repetitions == 0) {
+        break;
+      }
+      --repetitions;
+    }
+    Reverse(tree, start, *tree_size);
+    Reverse(extra_bits_data, start, *tree_size);
+  }
+}
+
+static void BrotliWriteHuffmanTreeRepetitionsZeros(
+    size_t repetitions,
+    size_t* tree_size,
+    uint8_t* tree,
+    uint8_t* extra_bits_data) {
+  if (repetitions == 11) {
+    tree[*tree_size] = 0;
+    extra_bits_data[*tree_size] = 0;
+    ++(*tree_size);
+    --repetitions;
+  }
+  if (repetitions < 3) {
+    size_t i;
+    for (i = 0; i < repetitions; ++i) {
+      tree[*tree_size] = 0;
+      extra_bits_data[*tree_size] = 0;
+      ++(*tree_size);
+    }
+  } else {
+    size_t start = *tree_size;
+    repetitions -= 3;
+    while (BROTLI_TRUE) {
+      tree[*tree_size] = BROTLI_REPEAT_ZERO_CODE_LENGTH;
+      extra_bits_data[*tree_size] = repetitions & 0x7;
+      ++(*tree_size);
+      repetitions >>= 3;
+      if (repetitions == 0) {
+        break;
+      }
+      --repetitions;
+    }
+    Reverse(tree, start, *tree_size);
+    Reverse(extra_bits_data, start, *tree_size);
+  }
+}
+
+void BrotliOptimizeHuffmanCountsForRle(size_t length, uint32_t* counts,
+                                       uint8_t* good_for_rle) {
+  size_t nonzero_count = 0;
+  size_t stride;
+  size_t limit;
+  size_t sum;
+  const size_t streak_limit = 1240;
+  /* Let's make the Huffman code more compatible with RLE encoding. */
+  size_t i;
+  for (i = 0; i < length; i++) {
+    if (counts[i]) {
+      ++nonzero_count;
+    }
+  }
+  if (nonzero_count < 16) {
+    return;
+  }
+  while (length != 0 && counts[length - 1] == 0) {
+    --length;
+  }
+  if (length == 0) {
+    return;  /* All zeros. */
+  }
+  /* Now counts[0..length - 1] does not have trailing zeros. */
+  {
+    size_t nonzeros = 0;
+    uint32_t smallest_nonzero = 1 << 30;
+    for (i = 0; i < length; ++i) {
+      if (counts[i] != 0) {
+        ++nonzeros;
+        if (smallest_nonzero > counts[i]) {
+          smallest_nonzero = counts[i];
+        }
+      }
+    }
+    if (nonzeros < 5) {
+      /* Small histogram will model it well. */
+      return;
+    }
+    if (smallest_nonzero < 4) {
+      size_t zeros = length - nonzeros;
+      if (zeros < 6) {
+        for (i = 1; i < length - 1; ++i) {
+          if (counts[i - 1] != 0 && counts[i] == 0 && counts[i + 1] != 0) {
+            counts[i] = 1;
+          }
+        }
+      }
+    }
+    if (nonzeros < 28) {
+      return;
+    }
+  }
+  /* 2) Let's mark all population counts that already can be encoded
+     with an RLE code. */
+  memset(good_for_rle, 0, length);
+  {
+    /* Let's not spoil any of the existing good RLE codes.
+       Mark any seq of 0's that is longer as 5 as a good_for_rle.
+       Mark any seq of non-0's that is longer as 7 as a good_for_rle. */
+    uint32_t symbol = counts[0];
+    size_t step = 0;
+    for (i = 0; i <= length; ++i) {
+      if (i == length || counts[i] != symbol) {
+        if ((symbol == 0 && step >= 5) ||
+            (symbol != 0 && step >= 7)) {
+          size_t k;
+          for (k = 0; k < step; ++k) {
+            good_for_rle[i - k - 1] = 1;
+          }
+        }
+        step = 1;
+        if (i != length) {
+          symbol = counts[i];
+        }
+      } else {
+        ++step;
+      }
+    }
+  }
+  /* 3) Let's replace those population counts that lead to more RLE codes.
+     Math here is in 24.8 fixed point representation. */
+  stride = 0;
+  limit = 256 * (counts[0] + counts[1] + counts[2]) / 3 + 420;
+  sum = 0;
+  for (i = 0; i <= length; ++i) {
+    if (i == length || good_for_rle[i] ||
+        (i != 0 && good_for_rle[i - 1]) ||
+        (256 * counts[i] - limit + streak_limit) >= 2 * streak_limit) {
+      if (stride >= 4 || (stride >= 3 && sum == 0)) {
+        size_t k;
+        /* The stride must end, collapse what we have, if we have enough (4). */
+        size_t count = (sum + stride / 2) / stride;
+        if (count == 0) {
+          count = 1;
+        }
+        if (sum == 0) {
+          /* Don't make an all zeros stride to be upgraded to ones. */
+          count = 0;
+        }
+        for (k = 0; k < stride; ++k) {
+          /* We don't want to change value at counts[i],
+             that is already belonging to the next stride. Thus - 1. */
+          counts[i - k - 1] = (uint32_t)count;
+        }
+      }
+      stride = 0;
+      sum = 0;
+      if (i < length - 2) {
+        /* All interesting strides have a count of at least 4, */
+        /* at least when non-zeros. */
+        limit = 256 * (counts[i] + counts[i + 1] + counts[i + 2]) / 3 + 420;
+      } else if (i < length) {
+        limit = 256 * counts[i];
+      } else {
+        limit = 0;
+      }
+    }
+    ++stride;
+    if (i != length) {
+      sum += counts[i];
+      if (stride >= 4) {
+        limit = (256 * sum + stride / 2) / stride;
+      }
+      if (stride == 4) {
+        limit += 120;
+      }
+    }
+  }
+}
+
+static void DecideOverRleUse(const uint8_t* depth, const size_t length,
+                             BROTLI_BOOL* use_rle_for_non_zero,
+                             BROTLI_BOOL* use_rle_for_zero) {
+  size_t total_reps_zero = 0;
+  size_t total_reps_non_zero = 0;
+  size_t count_reps_zero = 1;
+  size_t count_reps_non_zero = 1;
+  size_t i;
+  for (i = 0; i < length;) {
+    const uint8_t value = depth[i];
+    size_t reps = 1;
+    size_t k;
+    for (k = i + 1; k < length && depth[k] == value; ++k) {
+      ++reps;
+    }
+    if (reps >= 3 && value == 0) {
+      total_reps_zero += reps;
+      ++count_reps_zero;
+    }
+    if (reps >= 4 && value != 0) {
+      total_reps_non_zero += reps;
+      ++count_reps_non_zero;
+    }
+    i += reps;
+  }
+  *use_rle_for_non_zero =
+      TO_BROTLI_BOOL(total_reps_non_zero > count_reps_non_zero * 2);
+  *use_rle_for_zero = TO_BROTLI_BOOL(total_reps_zero > count_reps_zero * 2);
+}
+
+void BrotliWriteHuffmanTree(const uint8_t* depth,
+                            size_t length,
+                            size_t* tree_size,
+                            uint8_t* tree,
+                            uint8_t* extra_bits_data) {
+  uint8_t previous_value = BROTLI_INITIAL_REPEATED_CODE_LENGTH;
+  size_t i;
+  BROTLI_BOOL use_rle_for_non_zero = BROTLI_FALSE;
+  BROTLI_BOOL use_rle_for_zero = BROTLI_FALSE;
+
+  /* Throw away trailing zeros. */
+  size_t new_length = length;
+  for (i = 0; i < length; ++i) {
+    if (depth[length - i - 1] == 0) {
+      --new_length;
+    } else {
+      break;
+    }
+  }
+
+  /* First gather statistics on if it is a good idea to do RLE. */
+  if (length > 50) {
+    /* Find RLE coding for longer codes.
+       Shorter codes seem not to benefit from RLE. */
+    DecideOverRleUse(depth, new_length,
+                     &use_rle_for_non_zero, &use_rle_for_zero);
+  }
+
+  /* Actual RLE coding. */
+  for (i = 0; i < new_length;) {
+    const uint8_t value = depth[i];
+    size_t reps = 1;
+    if ((value != 0 && use_rle_for_non_zero) ||
+        (value == 0 && use_rle_for_zero)) {
+      size_t k;
+      for (k = i + 1; k < new_length && depth[k] == value; ++k) {
+        ++reps;
+      }
+    }
+    if (value == 0) {
+      BrotliWriteHuffmanTreeRepetitionsZeros(
+          reps, tree_size, tree, extra_bits_data);
+    } else {
+      BrotliWriteHuffmanTreeRepetitions(previous_value,
+                                        value, reps, tree_size,
+                                        tree, extra_bits_data);
+      previous_value = value;
+    }
+    i += reps;
+  }
+}
+
+static uint16_t BrotliReverseBits(size_t num_bits, uint16_t bits) {
+  static const size_t kLut[16] = {  /* Pre-reversed 4-bit values. */
+    0x00, 0x08, 0x04, 0x0C, 0x02, 0x0A, 0x06, 0x0E,
+    0x01, 0x09, 0x05, 0x0D, 0x03, 0x0B, 0x07, 0x0F
+  };
+  size_t retval = kLut[bits & 0x0F];
+  size_t i;
+  for (i = 4; i < num_bits; i += 4) {
+    retval <<= 4;
+    bits = (uint16_t)(bits >> 4);
+    retval |= kLut[bits & 0x0F];
+  }
+  retval >>= ((0 - num_bits) & 0x03);
+  return (uint16_t)retval;
+}
+
+/* 0..15 are values for bits */
+#define MAX_HUFFMAN_BITS 16
+
+void BrotliConvertBitDepthsToSymbols(const uint8_t* depth,
+                                     size_t len,
+                                     uint16_t* bits) {
+  /* In Brotli, all bit depths are [1..15]
+     0 bit depth means that the symbol does not exist. */
+  uint16_t bl_count[MAX_HUFFMAN_BITS] = { 0 };
+  uint16_t next_code[MAX_HUFFMAN_BITS];
+  size_t i;
+  int code = 0;
+  for (i = 0; i < len; ++i) {
+    ++bl_count[depth[i]];
+  }
+  bl_count[0] = 0;
+  next_code[0] = 0;
+  for (i = 1; i < MAX_HUFFMAN_BITS; ++i) {
+    code = (code + bl_count[i - 1]) << 1;
+    next_code[i] = (uint16_t)code;
+  }
+  for (i = 0; i < len; ++i) {
+    if (depth[i]) {
+      bits[i] = BrotliReverseBits(depth[i], next_code[depth[i]]++);
+    }
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/entropy_encode.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/entropy_encode.h
new file mode 100644
index 0000000000..e1c779cc6f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/entropy_encode.h
@@ -0,0 +1,123 @@
+/* Copyright 2010 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Entropy encoding (Huffman) utilities. */
+
+#ifndef BROTLI_ENC_ENTROPY_ENCODE_H_
+#define BROTLI_ENC_ENTROPY_ENCODE_H_
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* A node of a Huffman tree. */
+typedef struct HuffmanTree {
+  uint32_t total_count_;
+  int16_t index_left_;
+  int16_t index_right_or_value_;
+} HuffmanTree;
+
+static BROTLI_INLINE void InitHuffmanTree(HuffmanTree* self, uint32_t count,
+    int16_t left, int16_t right) {
+  self->total_count_ = count;
+  self->index_left_ = left;
+  self->index_right_or_value_ = right;
+}
+
+/* Returns 1 is assignment of depths succeeded, otherwise 0. */
+BROTLI_INTERNAL BROTLI_BOOL BrotliSetDepth(
+    int p, HuffmanTree* pool, uint8_t* depth, int max_depth);
+
+/* This function will create a Huffman tree.
+
+   The (data,length) contains the population counts.
+   The tree_limit is the maximum bit depth of the Huffman codes.
+
+   The depth contains the tree, i.e., how many bits are used for
+   the symbol.
+
+   The actual Huffman tree is constructed in the tree[] array, which has to
+   be at least 2 * length + 1 long.
+
+   See http://en.wikipedia.org/wiki/Huffman_coding */
+BROTLI_INTERNAL void BrotliCreateHuffmanTree(const uint32_t* data,
+                                             const size_t length,
+                                             const int tree_limit,
+                                             HuffmanTree* tree,
+                                             uint8_t* depth);
+
+/* Change the population counts in a way that the consequent
+   Huffman tree compression, especially its RLE-part will be more
+   likely to compress this data more efficiently.
+
+   length contains the size of the histogram.
+   counts contains the population counts.
+   good_for_rle is a buffer of at least length size */
+BROTLI_INTERNAL void BrotliOptimizeHuffmanCountsForRle(
+    size_t length, uint32_t* counts, uint8_t* good_for_rle);
+
+/* Write a Huffman tree from bit depths into the bit-stream representation
+   of a Huffman tree. The generated Huffman tree is to be compressed once
+   more using a Huffman tree */
+BROTLI_INTERNAL void BrotliWriteHuffmanTree(const uint8_t* depth,
+                                            size_t num,
+                                            size_t* tree_size,
+                                            uint8_t* tree,
+                                            uint8_t* extra_bits_data);
+
+/* Get the actual bit values for a tree of bit depths. */
+BROTLI_INTERNAL void BrotliConvertBitDepthsToSymbols(const uint8_t* depth,
+                                                     size_t len,
+                                                     uint16_t* bits);
+
+BROTLI_INTERNAL extern const size_t kBrotliShellGaps[6];
+/* Input size optimized Shell sort. */
+typedef BROTLI_BOOL (*HuffmanTreeComparator)(
+    const HuffmanTree*, const HuffmanTree*);
+static BROTLI_INLINE void SortHuffmanTreeItems(HuffmanTree* items,
+    const size_t n, HuffmanTreeComparator comparator) {
+  if (n < 13) {
+    /* Insertion sort. */
+    size_t i;
+    for (i = 1; i < n; ++i) {
+      HuffmanTree tmp = items[i];
+      size_t k = i;
+      size_t j = i - 1;
+      while (comparator(&tmp, &items[j])) {
+        items[k] = items[j];
+        k = j;
+        if (!j--) break;
+      }
+      items[k] = tmp;
+    }
+    return;
+  } else {
+    /* Shell sort. */
+    int g = n < 57 ? 2 : 0;
+    for (; g < 6; ++g) {
+      size_t gap = kBrotliShellGaps[g];
+      size_t i;
+      for (i = gap; i < n; ++i) {
+        size_t j = i;
+        HuffmanTree tmp = items[i];
+        for (; j >= gap && comparator(&tmp, &items[j - gap]); j -= gap) {
+          items[j] = items[j - gap];
+        }
+        items[j] = tmp;
+      }
+    }
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_ENTROPY_ENCODE_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/entropy_encode_static.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/entropy_encode_static.h
new file mode 100644
index 0000000000..ecff1fe9ee
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/entropy_encode_static.h
@@ -0,0 +1,542 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Static entropy codes used for faster meta-block encoding. */
+
+#ifndef BROTLI_ENC_ENTROPY_ENCODE_STATIC_H_
+#define BROTLI_ENC_ENTROPY_ENCODE_STATIC_H_
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+#include "write_bits.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static const uint8_t kCodeLengthDepth[18] = {
+  4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 0, 4, 4,
+};
+
+static const uint8_t kStaticCommandCodeDepth[BROTLI_NUM_COMMAND_SYMBOLS] = {
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+   9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,  9,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+  11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+};
+
+static const uint8_t kStaticDistanceCodeDepth[64] = {
+  6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+  6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+  6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+  6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+};
+
+/* GENERATED CODE START */
+static const uint32_t kCodeLengthBits[18] = {
+  0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 15, 31, 0, 11, 7,
+};
+
+static BROTLI_INLINE void StoreStaticCodeLengthCode(
+    size_t* storage_ix, uint8_t* storage) {
+  BrotliWriteBits(
+      40, BROTLI_MAKE_UINT64_T(0x0000FFu, 0x55555554u), storage_ix, storage);
+}
+
+static const uint64_t kZeroRepsBits[BROTLI_NUM_COMMAND_SYMBOLS] = {
+  0x00000000, 0x00000000, 0x00000000, 0x00000007, 0x00000017, 0x00000027,
+  0x00000037, 0x00000047, 0x00000057, 0x00000067, 0x00000077, 0x00000770,
+  0x00000b87, 0x00001387, 0x00001b87, 0x00002387, 0x00002b87, 0x00003387,
+  0x00003b87, 0x00000397, 0x00000b97, 0x00001397, 0x00001b97, 0x00002397,
+  0x00002b97, 0x00003397, 0x00003b97, 0x000003a7, 0x00000ba7, 0x000013a7,
+  0x00001ba7, 0x000023a7, 0x00002ba7, 0x000033a7, 0x00003ba7, 0x000003b7,
+  0x00000bb7, 0x000013b7, 0x00001bb7, 0x000023b7, 0x00002bb7, 0x000033b7,
+  0x00003bb7, 0x000003c7, 0x00000bc7, 0x000013c7, 0x00001bc7, 0x000023c7,
+  0x00002bc7, 0x000033c7, 0x00003bc7, 0x000003d7, 0x00000bd7, 0x000013d7,
+  0x00001bd7, 0x000023d7, 0x00002bd7, 0x000033d7, 0x00003bd7, 0x000003e7,
+  0x00000be7, 0x000013e7, 0x00001be7, 0x000023e7, 0x00002be7, 0x000033e7,
+  0x00003be7, 0x000003f7, 0x00000bf7, 0x000013f7, 0x00001bf7, 0x000023f7,
+  0x00002bf7, 0x000033f7, 0x00003bf7, 0x0001c387, 0x0005c387, 0x0009c387,
+  0x000dc387, 0x0011c387, 0x0015c387, 0x0019c387, 0x001dc387, 0x0001cb87,
+  0x0005cb87, 0x0009cb87, 0x000dcb87, 0x0011cb87, 0x0015cb87, 0x0019cb87,
+  0x001dcb87, 0x0001d387, 0x0005d387, 0x0009d387, 0x000dd387, 0x0011d387,
+  0x0015d387, 0x0019d387, 0x001dd387, 0x0001db87, 0x0005db87, 0x0009db87,
+  0x000ddb87, 0x0011db87, 0x0015db87, 0x0019db87, 0x001ddb87, 0x0001e387,
+  0x0005e387, 0x0009e387, 0x000de387, 0x0011e387, 0x0015e387, 0x0019e387,
+  0x001de387, 0x0001eb87, 0x0005eb87, 0x0009eb87, 0x000deb87, 0x0011eb87,
+  0x0015eb87, 0x0019eb87, 0x001deb87, 0x0001f387, 0x0005f387, 0x0009f387,
+  0x000df387, 0x0011f387, 0x0015f387, 0x0019f387, 0x001df387, 0x0001fb87,
+  0x0005fb87, 0x0009fb87, 0x000dfb87, 0x0011fb87, 0x0015fb87, 0x0019fb87,
+  0x001dfb87, 0x0001c397, 0x0005c397, 0x0009c397, 0x000dc397, 0x0011c397,
+  0x0015c397, 0x0019c397, 0x001dc397, 0x0001cb97, 0x0005cb97, 0x0009cb97,
+  0x000dcb97, 0x0011cb97, 0x0015cb97, 0x0019cb97, 0x001dcb97, 0x0001d397,
+  0x0005d397, 0x0009d397, 0x000dd397, 0x0011d397, 0x0015d397, 0x0019d397,
+  0x001dd397, 0x0001db97, 0x0005db97, 0x0009db97, 0x000ddb97, 0x0011db97,
+  0x0015db97, 0x0019db97, 0x001ddb97, 0x0001e397, 0x0005e397, 0x0009e397,
+  0x000de397, 0x0011e397, 0x0015e397, 0x0019e397, 0x001de397, 0x0001eb97,
+  0x0005eb97, 0x0009eb97, 0x000deb97, 0x0011eb97, 0x0015eb97, 0x0019eb97,
+  0x001deb97, 0x0001f397, 0x0005f397, 0x0009f397, 0x000df397, 0x0011f397,
+  0x0015f397, 0x0019f397, 0x001df397, 0x0001fb97, 0x0005fb97, 0x0009fb97,
+  0x000dfb97, 0x0011fb97, 0x0015fb97, 0x0019fb97, 0x001dfb97, 0x0001c3a7,
+  0x0005c3a7, 0x0009c3a7, 0x000dc3a7, 0x0011c3a7, 0x0015c3a7, 0x0019c3a7,
+  0x001dc3a7, 0x0001cba7, 0x0005cba7, 0x0009cba7, 0x000dcba7, 0x0011cba7,
+  0x0015cba7, 0x0019cba7, 0x001dcba7, 0x0001d3a7, 0x0005d3a7, 0x0009d3a7,
+  0x000dd3a7, 0x0011d3a7, 0x0015d3a7, 0x0019d3a7, 0x001dd3a7, 0x0001dba7,
+  0x0005dba7, 0x0009dba7, 0x000ddba7, 0x0011dba7, 0x0015dba7, 0x0019dba7,
+  0x001ddba7, 0x0001e3a7, 0x0005e3a7, 0x0009e3a7, 0x000de3a7, 0x0011e3a7,
+  0x0015e3a7, 0x0019e3a7, 0x001de3a7, 0x0001eba7, 0x0005eba7, 0x0009eba7,
+  0x000deba7, 0x0011eba7, 0x0015eba7, 0x0019eba7, 0x001deba7, 0x0001f3a7,
+  0x0005f3a7, 0x0009f3a7, 0x000df3a7, 0x0011f3a7, 0x0015f3a7, 0x0019f3a7,
+  0x001df3a7, 0x0001fba7, 0x0005fba7, 0x0009fba7, 0x000dfba7, 0x0011fba7,
+  0x0015fba7, 0x0019fba7, 0x001dfba7, 0x0001c3b7, 0x0005c3b7, 0x0009c3b7,
+  0x000dc3b7, 0x0011c3b7, 0x0015c3b7, 0x0019c3b7, 0x001dc3b7, 0x0001cbb7,
+  0x0005cbb7, 0x0009cbb7, 0x000dcbb7, 0x0011cbb7, 0x0015cbb7, 0x0019cbb7,
+  0x001dcbb7, 0x0001d3b7, 0x0005d3b7, 0x0009d3b7, 0x000dd3b7, 0x0011d3b7,
+  0x0015d3b7, 0x0019d3b7, 0x001dd3b7, 0x0001dbb7, 0x0005dbb7, 0x0009dbb7,
+  0x000ddbb7, 0x0011dbb7, 0x0015dbb7, 0x0019dbb7, 0x001ddbb7, 0x0001e3b7,
+  0x0005e3b7, 0x0009e3b7, 0x000de3b7, 0x0011e3b7, 0x0015e3b7, 0x0019e3b7,
+  0x001de3b7, 0x0001ebb7, 0x0005ebb7, 0x0009ebb7, 0x000debb7, 0x0011ebb7,
+  0x0015ebb7, 0x0019ebb7, 0x001debb7, 0x0001f3b7, 0x0005f3b7, 0x0009f3b7,
+  0x000df3b7, 0x0011f3b7, 0x0015f3b7, 0x0019f3b7, 0x001df3b7, 0x0001fbb7,
+  0x0005fbb7, 0x0009fbb7, 0x000dfbb7, 0x0011fbb7, 0x0015fbb7, 0x0019fbb7,
+  0x001dfbb7, 0x0001c3c7, 0x0005c3c7, 0x0009c3c7, 0x000dc3c7, 0x0011c3c7,
+  0x0015c3c7, 0x0019c3c7, 0x001dc3c7, 0x0001cbc7, 0x0005cbc7, 0x0009cbc7,
+  0x000dcbc7, 0x0011cbc7, 0x0015cbc7, 0x0019cbc7, 0x001dcbc7, 0x0001d3c7,
+  0x0005d3c7, 0x0009d3c7, 0x000dd3c7, 0x0011d3c7, 0x0015d3c7, 0x0019d3c7,
+  0x001dd3c7, 0x0001dbc7, 0x0005dbc7, 0x0009dbc7, 0x000ddbc7, 0x0011dbc7,
+  0x0015dbc7, 0x0019dbc7, 0x001ddbc7, 0x0001e3c7, 0x0005e3c7, 0x0009e3c7,
+  0x000de3c7, 0x0011e3c7, 0x0015e3c7, 0x0019e3c7, 0x001de3c7, 0x0001ebc7,
+  0x0005ebc7, 0x0009ebc7, 0x000debc7, 0x0011ebc7, 0x0015ebc7, 0x0019ebc7,
+  0x001debc7, 0x0001f3c7, 0x0005f3c7, 0x0009f3c7, 0x000df3c7, 0x0011f3c7,
+  0x0015f3c7, 0x0019f3c7, 0x001df3c7, 0x0001fbc7, 0x0005fbc7, 0x0009fbc7,
+  0x000dfbc7, 0x0011fbc7, 0x0015fbc7, 0x0019fbc7, 0x001dfbc7, 0x0001c3d7,
+  0x0005c3d7, 0x0009c3d7, 0x000dc3d7, 0x0011c3d7, 0x0015c3d7, 0x0019c3d7,
+  0x001dc3d7, 0x0001cbd7, 0x0005cbd7, 0x0009cbd7, 0x000dcbd7, 0x0011cbd7,
+  0x0015cbd7, 0x0019cbd7, 0x001dcbd7, 0x0001d3d7, 0x0005d3d7, 0x0009d3d7,
+  0x000dd3d7, 0x0011d3d7, 0x0015d3d7, 0x0019d3d7, 0x001dd3d7, 0x0001dbd7,
+  0x0005dbd7, 0x0009dbd7, 0x000ddbd7, 0x0011dbd7, 0x0015dbd7, 0x0019dbd7,
+  0x001ddbd7, 0x0001e3d7, 0x0005e3d7, 0x0009e3d7, 0x000de3d7, 0x0011e3d7,
+  0x0015e3d7, 0x0019e3d7, 0x001de3d7, 0x0001ebd7, 0x0005ebd7, 0x0009ebd7,
+  0x000debd7, 0x0011ebd7, 0x0015ebd7, 0x0019ebd7, 0x001debd7, 0x0001f3d7,
+  0x0005f3d7, 0x0009f3d7, 0x000df3d7, 0x0011f3d7, 0x0015f3d7, 0x0019f3d7,
+  0x001df3d7, 0x0001fbd7, 0x0005fbd7, 0x0009fbd7, 0x000dfbd7, 0x0011fbd7,
+  0x0015fbd7, 0x0019fbd7, 0x001dfbd7, 0x0001c3e7, 0x0005c3e7, 0x0009c3e7,
+  0x000dc3e7, 0x0011c3e7, 0x0015c3e7, 0x0019c3e7, 0x001dc3e7, 0x0001cbe7,
+  0x0005cbe7, 0x0009cbe7, 0x000dcbe7, 0x0011cbe7, 0x0015cbe7, 0x0019cbe7,
+  0x001dcbe7, 0x0001d3e7, 0x0005d3e7, 0x0009d3e7, 0x000dd3e7, 0x0011d3e7,
+  0x0015d3e7, 0x0019d3e7, 0x001dd3e7, 0x0001dbe7, 0x0005dbe7, 0x0009dbe7,
+  0x000ddbe7, 0x0011dbe7, 0x0015dbe7, 0x0019dbe7, 0x001ddbe7, 0x0001e3e7,
+  0x0005e3e7, 0x0009e3e7, 0x000de3e7, 0x0011e3e7, 0x0015e3e7, 0x0019e3e7,
+  0x001de3e7, 0x0001ebe7, 0x0005ebe7, 0x0009ebe7, 0x000debe7, 0x0011ebe7,
+  0x0015ebe7, 0x0019ebe7, 0x001debe7, 0x0001f3e7, 0x0005f3e7, 0x0009f3e7,
+  0x000df3e7, 0x0011f3e7, 0x0015f3e7, 0x0019f3e7, 0x001df3e7, 0x0001fbe7,
+  0x0005fbe7, 0x0009fbe7, 0x000dfbe7, 0x0011fbe7, 0x0015fbe7, 0x0019fbe7,
+  0x001dfbe7, 0x0001c3f7, 0x0005c3f7, 0x0009c3f7, 0x000dc3f7, 0x0011c3f7,
+  0x0015c3f7, 0x0019c3f7, 0x001dc3f7, 0x0001cbf7, 0x0005cbf7, 0x0009cbf7,
+  0x000dcbf7, 0x0011cbf7, 0x0015cbf7, 0x0019cbf7, 0x001dcbf7, 0x0001d3f7,
+  0x0005d3f7, 0x0009d3f7, 0x000dd3f7, 0x0011d3f7, 0x0015d3f7, 0x0019d3f7,
+  0x001dd3f7, 0x0001dbf7, 0x0005dbf7, 0x0009dbf7, 0x000ddbf7, 0x0011dbf7,
+  0x0015dbf7, 0x0019dbf7, 0x001ddbf7, 0x0001e3f7, 0x0005e3f7, 0x0009e3f7,
+  0x000de3f7, 0x0011e3f7, 0x0015e3f7, 0x0019e3f7, 0x001de3f7, 0x0001ebf7,
+  0x0005ebf7, 0x0009ebf7, 0x000debf7, 0x0011ebf7, 0x0015ebf7, 0x0019ebf7,
+  0x001debf7, 0x0001f3f7, 0x0005f3f7, 0x0009f3f7, 0x000df3f7, 0x0011f3f7,
+  0x0015f3f7, 0x0019f3f7, 0x001df3f7, 0x0001fbf7, 0x0005fbf7, 0x0009fbf7,
+  0x000dfbf7, 0x0011fbf7, 0x0015fbf7, 0x0019fbf7, 0x001dfbf7, 0x00e1c387,
+  0x02e1c387, 0x04e1c387, 0x06e1c387, 0x08e1c387, 0x0ae1c387, 0x0ce1c387,
+  0x0ee1c387, 0x00e5c387, 0x02e5c387, 0x04e5c387, 0x06e5c387, 0x08e5c387,
+  0x0ae5c387, 0x0ce5c387, 0x0ee5c387, 0x00e9c387, 0x02e9c387, 0x04e9c387,
+  0x06e9c387, 0x08e9c387, 0x0ae9c387, 0x0ce9c387, 0x0ee9c387, 0x00edc387,
+  0x02edc387, 0x04edc387, 0x06edc387, 0x08edc387, 0x0aedc387, 0x0cedc387,
+  0x0eedc387, 0x00f1c387, 0x02f1c387, 0x04f1c387, 0x06f1c387, 0x08f1c387,
+  0x0af1c387, 0x0cf1c387, 0x0ef1c387, 0x00f5c387, 0x02f5c387, 0x04f5c387,
+  0x06f5c387, 0x08f5c387, 0x0af5c387, 0x0cf5c387, 0x0ef5c387, 0x00f9c387,
+  0x02f9c387, 0x04f9c387, 0x06f9c387, 0x08f9c387, 0x0af9c387, 0x0cf9c387,
+  0x0ef9c387, 0x00fdc387, 0x02fdc387, 0x04fdc387, 0x06fdc387, 0x08fdc387,
+  0x0afdc387, 0x0cfdc387, 0x0efdc387, 0x00e1cb87, 0x02e1cb87, 0x04e1cb87,
+  0x06e1cb87, 0x08e1cb87, 0x0ae1cb87, 0x0ce1cb87, 0x0ee1cb87, 0x00e5cb87,
+  0x02e5cb87, 0x04e5cb87, 0x06e5cb87, 0x08e5cb87, 0x0ae5cb87, 0x0ce5cb87,
+  0x0ee5cb87, 0x00e9cb87, 0x02e9cb87, 0x04e9cb87, 0x06e9cb87, 0x08e9cb87,
+  0x0ae9cb87, 0x0ce9cb87, 0x0ee9cb87, 0x00edcb87, 0x02edcb87, 0x04edcb87,
+  0x06edcb87, 0x08edcb87, 0x0aedcb87, 0x0cedcb87, 0x0eedcb87, 0x00f1cb87,
+  0x02f1cb87, 0x04f1cb87, 0x06f1cb87, 0x08f1cb87, 0x0af1cb87, 0x0cf1cb87,
+  0x0ef1cb87, 0x00f5cb87, 0x02f5cb87, 0x04f5cb87, 0x06f5cb87, 0x08f5cb87,
+  0x0af5cb87, 0x0cf5cb87, 0x0ef5cb87, 0x00f9cb87, 0x02f9cb87, 0x04f9cb87,
+  0x06f9cb87, 0x08f9cb87,
+};
+
+static const uint32_t kZeroRepsDepth[BROTLI_NUM_COMMAND_SYMBOLS] = {
+   0,  4,  8,  7,  7,  7,  7,  7,  7,  7,  7, 11, 14, 14, 14, 14,
+  14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
+  14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
+  14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
+  14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+  21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 28, 28, 28, 28, 28,
+  28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+  28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+  28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+  28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+  28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+  28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+  28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+};
+
+static const uint64_t kNonZeroRepsBits[BROTLI_NUM_COMMAND_SYMBOLS] = {
+  0x0000000b, 0x0000001b, 0x0000002b, 0x0000003b, 0x000002cb, 0x000006cb,
+  0x00000acb, 0x00000ecb, 0x000002db, 0x000006db, 0x00000adb, 0x00000edb,
+  0x000002eb, 0x000006eb, 0x00000aeb, 0x00000eeb, 0x000002fb, 0x000006fb,
+  0x00000afb, 0x00000efb, 0x0000b2cb, 0x0001b2cb, 0x0002b2cb, 0x0003b2cb,
+  0x0000b6cb, 0x0001b6cb, 0x0002b6cb, 0x0003b6cb, 0x0000bacb, 0x0001bacb,
+  0x0002bacb, 0x0003bacb, 0x0000becb, 0x0001becb, 0x0002becb, 0x0003becb,
+  0x0000b2db, 0x0001b2db, 0x0002b2db, 0x0003b2db, 0x0000b6db, 0x0001b6db,
+  0x0002b6db, 0x0003b6db, 0x0000badb, 0x0001badb, 0x0002badb, 0x0003badb,
+  0x0000bedb, 0x0001bedb, 0x0002bedb, 0x0003bedb, 0x0000b2eb, 0x0001b2eb,
+  0x0002b2eb, 0x0003b2eb, 0x0000b6eb, 0x0001b6eb, 0x0002b6eb, 0x0003b6eb,
+  0x0000baeb, 0x0001baeb, 0x0002baeb, 0x0003baeb, 0x0000beeb, 0x0001beeb,
+  0x0002beeb, 0x0003beeb, 0x0000b2fb, 0x0001b2fb, 0x0002b2fb, 0x0003b2fb,
+  0x0000b6fb, 0x0001b6fb, 0x0002b6fb, 0x0003b6fb, 0x0000bafb, 0x0001bafb,
+  0x0002bafb, 0x0003bafb, 0x0000befb, 0x0001befb, 0x0002befb, 0x0003befb,
+  0x002cb2cb, 0x006cb2cb, 0x00acb2cb, 0x00ecb2cb, 0x002db2cb, 0x006db2cb,
+  0x00adb2cb, 0x00edb2cb, 0x002eb2cb, 0x006eb2cb, 0x00aeb2cb, 0x00eeb2cb,
+  0x002fb2cb, 0x006fb2cb, 0x00afb2cb, 0x00efb2cb, 0x002cb6cb, 0x006cb6cb,
+  0x00acb6cb, 0x00ecb6cb, 0x002db6cb, 0x006db6cb, 0x00adb6cb, 0x00edb6cb,
+  0x002eb6cb, 0x006eb6cb, 0x00aeb6cb, 0x00eeb6cb, 0x002fb6cb, 0x006fb6cb,
+  0x00afb6cb, 0x00efb6cb, 0x002cbacb, 0x006cbacb, 0x00acbacb, 0x00ecbacb,
+  0x002dbacb, 0x006dbacb, 0x00adbacb, 0x00edbacb, 0x002ebacb, 0x006ebacb,
+  0x00aebacb, 0x00eebacb, 0x002fbacb, 0x006fbacb, 0x00afbacb, 0x00efbacb,
+  0x002cbecb, 0x006cbecb, 0x00acbecb, 0x00ecbecb, 0x002dbecb, 0x006dbecb,
+  0x00adbecb, 0x00edbecb, 0x002ebecb, 0x006ebecb, 0x00aebecb, 0x00eebecb,
+  0x002fbecb, 0x006fbecb, 0x00afbecb, 0x00efbecb, 0x002cb2db, 0x006cb2db,
+  0x00acb2db, 0x00ecb2db, 0x002db2db, 0x006db2db, 0x00adb2db, 0x00edb2db,
+  0x002eb2db, 0x006eb2db, 0x00aeb2db, 0x00eeb2db, 0x002fb2db, 0x006fb2db,
+  0x00afb2db, 0x00efb2db, 0x002cb6db, 0x006cb6db, 0x00acb6db, 0x00ecb6db,
+  0x002db6db, 0x006db6db, 0x00adb6db, 0x00edb6db, 0x002eb6db, 0x006eb6db,
+  0x00aeb6db, 0x00eeb6db, 0x002fb6db, 0x006fb6db, 0x00afb6db, 0x00efb6db,
+  0x002cbadb, 0x006cbadb, 0x00acbadb, 0x00ecbadb, 0x002dbadb, 0x006dbadb,
+  0x00adbadb, 0x00edbadb, 0x002ebadb, 0x006ebadb, 0x00aebadb, 0x00eebadb,
+  0x002fbadb, 0x006fbadb, 0x00afbadb, 0x00efbadb, 0x002cbedb, 0x006cbedb,
+  0x00acbedb, 0x00ecbedb, 0x002dbedb, 0x006dbedb, 0x00adbedb, 0x00edbedb,
+  0x002ebedb, 0x006ebedb, 0x00aebedb, 0x00eebedb, 0x002fbedb, 0x006fbedb,
+  0x00afbedb, 0x00efbedb, 0x002cb2eb, 0x006cb2eb, 0x00acb2eb, 0x00ecb2eb,
+  0x002db2eb, 0x006db2eb, 0x00adb2eb, 0x00edb2eb, 0x002eb2eb, 0x006eb2eb,
+  0x00aeb2eb, 0x00eeb2eb, 0x002fb2eb, 0x006fb2eb, 0x00afb2eb, 0x00efb2eb,
+  0x002cb6eb, 0x006cb6eb, 0x00acb6eb, 0x00ecb6eb, 0x002db6eb, 0x006db6eb,
+  0x00adb6eb, 0x00edb6eb, 0x002eb6eb, 0x006eb6eb, 0x00aeb6eb, 0x00eeb6eb,
+  0x002fb6eb, 0x006fb6eb, 0x00afb6eb, 0x00efb6eb, 0x002cbaeb, 0x006cbaeb,
+  0x00acbaeb, 0x00ecbaeb, 0x002dbaeb, 0x006dbaeb, 0x00adbaeb, 0x00edbaeb,
+  0x002ebaeb, 0x006ebaeb, 0x00aebaeb, 0x00eebaeb, 0x002fbaeb, 0x006fbaeb,
+  0x00afbaeb, 0x00efbaeb, 0x002cbeeb, 0x006cbeeb, 0x00acbeeb, 0x00ecbeeb,
+  0x002dbeeb, 0x006dbeeb, 0x00adbeeb, 0x00edbeeb, 0x002ebeeb, 0x006ebeeb,
+  0x00aebeeb, 0x00eebeeb, 0x002fbeeb, 0x006fbeeb, 0x00afbeeb, 0x00efbeeb,
+  0x002cb2fb, 0x006cb2fb, 0x00acb2fb, 0x00ecb2fb, 0x002db2fb, 0x006db2fb,
+  0x00adb2fb, 0x00edb2fb, 0x002eb2fb, 0x006eb2fb, 0x00aeb2fb, 0x00eeb2fb,
+  0x002fb2fb, 0x006fb2fb, 0x00afb2fb, 0x00efb2fb, 0x002cb6fb, 0x006cb6fb,
+  0x00acb6fb, 0x00ecb6fb, 0x002db6fb, 0x006db6fb, 0x00adb6fb, 0x00edb6fb,
+  0x002eb6fb, 0x006eb6fb, 0x00aeb6fb, 0x00eeb6fb, 0x002fb6fb, 0x006fb6fb,
+  0x00afb6fb, 0x00efb6fb, 0x002cbafb, 0x006cbafb, 0x00acbafb, 0x00ecbafb,
+  0x002dbafb, 0x006dbafb, 0x00adbafb, 0x00edbafb, 0x002ebafb, 0x006ebafb,
+  0x00aebafb, 0x00eebafb, 0x002fbafb, 0x006fbafb, 0x00afbafb, 0x00efbafb,
+  0x002cbefb, 0x006cbefb, 0x00acbefb, 0x00ecbefb, 0x002dbefb, 0x006dbefb,
+  0x00adbefb, 0x00edbefb, 0x002ebefb, 0x006ebefb, 0x00aebefb, 0x00eebefb,
+  0x002fbefb, 0x006fbefb, 0x00afbefb, 0x00efbefb, 0x0b2cb2cb, 0x1b2cb2cb,
+  0x2b2cb2cb, 0x3b2cb2cb, 0x0b6cb2cb, 0x1b6cb2cb, 0x2b6cb2cb, 0x3b6cb2cb,
+  0x0bacb2cb, 0x1bacb2cb, 0x2bacb2cb, 0x3bacb2cb, 0x0becb2cb, 0x1becb2cb,
+  0x2becb2cb, 0x3becb2cb, 0x0b2db2cb, 0x1b2db2cb, 0x2b2db2cb, 0x3b2db2cb,
+  0x0b6db2cb, 0x1b6db2cb, 0x2b6db2cb, 0x3b6db2cb, 0x0badb2cb, 0x1badb2cb,
+  0x2badb2cb, 0x3badb2cb, 0x0bedb2cb, 0x1bedb2cb, 0x2bedb2cb, 0x3bedb2cb,
+  0x0b2eb2cb, 0x1b2eb2cb, 0x2b2eb2cb, 0x3b2eb2cb, 0x0b6eb2cb, 0x1b6eb2cb,
+  0x2b6eb2cb, 0x3b6eb2cb, 0x0baeb2cb, 0x1baeb2cb, 0x2baeb2cb, 0x3baeb2cb,
+  0x0beeb2cb, 0x1beeb2cb, 0x2beeb2cb, 0x3beeb2cb, 0x0b2fb2cb, 0x1b2fb2cb,
+  0x2b2fb2cb, 0x3b2fb2cb, 0x0b6fb2cb, 0x1b6fb2cb, 0x2b6fb2cb, 0x3b6fb2cb,
+  0x0bafb2cb, 0x1bafb2cb, 0x2bafb2cb, 0x3bafb2cb, 0x0befb2cb, 0x1befb2cb,
+  0x2befb2cb, 0x3befb2cb, 0x0b2cb6cb, 0x1b2cb6cb, 0x2b2cb6cb, 0x3b2cb6cb,
+  0x0b6cb6cb, 0x1b6cb6cb, 0x2b6cb6cb, 0x3b6cb6cb, 0x0bacb6cb, 0x1bacb6cb,
+  0x2bacb6cb, 0x3bacb6cb, 0x0becb6cb, 0x1becb6cb, 0x2becb6cb, 0x3becb6cb,
+  0x0b2db6cb, 0x1b2db6cb, 0x2b2db6cb, 0x3b2db6cb, 0x0b6db6cb, 0x1b6db6cb,
+  0x2b6db6cb, 0x3b6db6cb, 0x0badb6cb, 0x1badb6cb, 0x2badb6cb, 0x3badb6cb,
+  0x0bedb6cb, 0x1bedb6cb, 0x2bedb6cb, 0x3bedb6cb, 0x0b2eb6cb, 0x1b2eb6cb,
+  0x2b2eb6cb, 0x3b2eb6cb, 0x0b6eb6cb, 0x1b6eb6cb, 0x2b6eb6cb, 0x3b6eb6cb,
+  0x0baeb6cb, 0x1baeb6cb, 0x2baeb6cb, 0x3baeb6cb, 0x0beeb6cb, 0x1beeb6cb,
+  0x2beeb6cb, 0x3beeb6cb, 0x0b2fb6cb, 0x1b2fb6cb, 0x2b2fb6cb, 0x3b2fb6cb,
+  0x0b6fb6cb, 0x1b6fb6cb, 0x2b6fb6cb, 0x3b6fb6cb, 0x0bafb6cb, 0x1bafb6cb,
+  0x2bafb6cb, 0x3bafb6cb, 0x0befb6cb, 0x1befb6cb, 0x2befb6cb, 0x3befb6cb,
+  0x0b2cbacb, 0x1b2cbacb, 0x2b2cbacb, 0x3b2cbacb, 0x0b6cbacb, 0x1b6cbacb,
+  0x2b6cbacb, 0x3b6cbacb, 0x0bacbacb, 0x1bacbacb, 0x2bacbacb, 0x3bacbacb,
+  0x0becbacb, 0x1becbacb, 0x2becbacb, 0x3becbacb, 0x0b2dbacb, 0x1b2dbacb,
+  0x2b2dbacb, 0x3b2dbacb, 0x0b6dbacb, 0x1b6dbacb, 0x2b6dbacb, 0x3b6dbacb,
+  0x0badbacb, 0x1badbacb, 0x2badbacb, 0x3badbacb, 0x0bedbacb, 0x1bedbacb,
+  0x2bedbacb, 0x3bedbacb, 0x0b2ebacb, 0x1b2ebacb, 0x2b2ebacb, 0x3b2ebacb,
+  0x0b6ebacb, 0x1b6ebacb, 0x2b6ebacb, 0x3b6ebacb, 0x0baebacb, 0x1baebacb,
+  0x2baebacb, 0x3baebacb, 0x0beebacb, 0x1beebacb, 0x2beebacb, 0x3beebacb,
+  0x0b2fbacb, 0x1b2fbacb, 0x2b2fbacb, 0x3b2fbacb, 0x0b6fbacb, 0x1b6fbacb,
+  0x2b6fbacb, 0x3b6fbacb, 0x0bafbacb, 0x1bafbacb, 0x2bafbacb, 0x3bafbacb,
+  0x0befbacb, 0x1befbacb, 0x2befbacb, 0x3befbacb, 0x0b2cbecb, 0x1b2cbecb,
+  0x2b2cbecb, 0x3b2cbecb, 0x0b6cbecb, 0x1b6cbecb, 0x2b6cbecb, 0x3b6cbecb,
+  0x0bacbecb, 0x1bacbecb, 0x2bacbecb, 0x3bacbecb, 0x0becbecb, 0x1becbecb,
+  0x2becbecb, 0x3becbecb, 0x0b2dbecb, 0x1b2dbecb, 0x2b2dbecb, 0x3b2dbecb,
+  0x0b6dbecb, 0x1b6dbecb, 0x2b6dbecb, 0x3b6dbecb, 0x0badbecb, 0x1badbecb,
+  0x2badbecb, 0x3badbecb, 0x0bedbecb, 0x1bedbecb, 0x2bedbecb, 0x3bedbecb,
+  0x0b2ebecb, 0x1b2ebecb, 0x2b2ebecb, 0x3b2ebecb, 0x0b6ebecb, 0x1b6ebecb,
+  0x2b6ebecb, 0x3b6ebecb, 0x0baebecb, 0x1baebecb, 0x2baebecb, 0x3baebecb,
+  0x0beebecb, 0x1beebecb, 0x2beebecb, 0x3beebecb, 0x0b2fbecb, 0x1b2fbecb,
+  0x2b2fbecb, 0x3b2fbecb, 0x0b6fbecb, 0x1b6fbecb, 0x2b6fbecb, 0x3b6fbecb,
+  0x0bafbecb, 0x1bafbecb, 0x2bafbecb, 0x3bafbecb, 0x0befbecb, 0x1befbecb,
+  0x2befbecb, 0x3befbecb, 0x0b2cb2db, 0x1b2cb2db, 0x2b2cb2db, 0x3b2cb2db,
+  0x0b6cb2db, 0x1b6cb2db, 0x2b6cb2db, 0x3b6cb2db, 0x0bacb2db, 0x1bacb2db,
+  0x2bacb2db, 0x3bacb2db, 0x0becb2db, 0x1becb2db, 0x2becb2db, 0x3becb2db,
+  0x0b2db2db, 0x1b2db2db, 0x2b2db2db, 0x3b2db2db, 0x0b6db2db, 0x1b6db2db,
+  0x2b6db2db, 0x3b6db2db, 0x0badb2db, 0x1badb2db, 0x2badb2db, 0x3badb2db,
+  0x0bedb2db, 0x1bedb2db, 0x2bedb2db, 0x3bedb2db, 0x0b2eb2db, 0x1b2eb2db,
+  0x2b2eb2db, 0x3b2eb2db, 0x0b6eb2db, 0x1b6eb2db, 0x2b6eb2db, 0x3b6eb2db,
+  0x0baeb2db, 0x1baeb2db, 0x2baeb2db, 0x3baeb2db, 0x0beeb2db, 0x1beeb2db,
+  0x2beeb2db, 0x3beeb2db, 0x0b2fb2db, 0x1b2fb2db, 0x2b2fb2db, 0x3b2fb2db,
+  0x0b6fb2db, 0x1b6fb2db, 0x2b6fb2db, 0x3b6fb2db, 0x0bafb2db, 0x1bafb2db,
+  0x2bafb2db, 0x3bafb2db, 0x0befb2db, 0x1befb2db, 0x2befb2db, 0x3befb2db,
+  0x0b2cb6db, 0x1b2cb6db, 0x2b2cb6db, 0x3b2cb6db, 0x0b6cb6db, 0x1b6cb6db,
+  0x2b6cb6db, 0x3b6cb6db, 0x0bacb6db, 0x1bacb6db, 0x2bacb6db, 0x3bacb6db,
+  0x0becb6db, 0x1becb6db, 0x2becb6db, 0x3becb6db, 0x0b2db6db, 0x1b2db6db,
+  0x2b2db6db, 0x3b2db6db, 0x0b6db6db, 0x1b6db6db, 0x2b6db6db, 0x3b6db6db,
+  0x0badb6db, 0x1badb6db, 0x2badb6db, 0x3badb6db, 0x0bedb6db, 0x1bedb6db,
+  0x2bedb6db, 0x3bedb6db, 0x0b2eb6db, 0x1b2eb6db, 0x2b2eb6db, 0x3b2eb6db,
+  0x0b6eb6db, 0x1b6eb6db, 0x2b6eb6db, 0x3b6eb6db, 0x0baeb6db, 0x1baeb6db,
+  0x2baeb6db, 0x3baeb6db,
+};
+
+static const uint32_t kNonZeroRepsDepth[BROTLI_NUM_COMMAND_SYMBOLS] = {
+   6,  6,  6,  6, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
+  12, 12, 12, 12, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+  18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+  18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+  18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+  18, 18, 18, 18, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+  24, 24, 24, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+  30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
+};
+
+static const uint16_t kStaticCommandCodeBits[BROTLI_NUM_COMMAND_SYMBOLS] = {
+    0,  256,  128,  384,   64,  320,  192,  448,
+   32,  288,  160,  416,   96,  352,  224,  480,
+   16,  272,  144,  400,   80,  336,  208,  464,
+   48,  304,  176,  432,  112,  368,  240,  496,
+    8,  264,  136,  392,   72,  328,  200,  456,
+   40,  296,  168,  424,  104,  360,  232,  488,
+   24,  280,  152,  408,   88,  344,  216,  472,
+   56,  312,  184,  440,  120,  376,  248,  504,
+    4,  260,  132,  388,   68,  324,  196,  452,
+   36,  292,  164,  420,  100,  356,  228,  484,
+   20,  276,  148,  404,   84,  340,  212,  468,
+   52,  308,  180,  436,  116,  372,  244,  500,
+   12,  268,  140,  396,   76,  332,  204,  460,
+   44,  300,  172,  428,  108,  364,  236,  492,
+   28,  284,  156,  412,   92,  348,  220,  476,
+   60,  316,  188,  444,  124,  380,  252,  508,
+    2,  258,  130,  386,   66,  322,  194,  450,
+   34,  290,  162,  418,   98,  354,  226,  482,
+   18,  274,  146,  402,   82,  338,  210,  466,
+   50,  306,  178,  434,  114,  370,  242,  498,
+   10,  266,  138,  394,   74,  330,  202,  458,
+   42,  298,  170,  426,  106,  362,  234,  490,
+   26,  282,  154,  410,   90,  346,  218,  474,
+   58,  314,  186,  442,  122,  378,  250,  506,
+    6,  262,  134,  390,   70,  326,  198,  454,
+   38,  294,  166,  422,  102,  358,  230,  486,
+   22,  278,  150,  406,   86,  342,  214,  470,
+   54,  310,  182,  438,  118,  374,  246,  502,
+   14,  270,  142,  398,   78,  334,  206,  462,
+   46,  302,  174,  430,  110,  366,  238,  494,
+   30,  286,  158,  414,   94,  350,  222,  478,
+   62,  318,  190,  446,  126,  382,  254,  510,
+    1,  257,  129,  385,   65,  321,  193,  449,
+   33,  289,  161,  417,   97,  353,  225,  481,
+   17,  273,  145,  401,   81,  337,  209,  465,
+   49,  305,  177,  433,  113,  369,  241,  497,
+    9,  265,  137,  393,   73,  329,  201,  457,
+   41,  297,  169,  425,  105,  361,  233,  489,
+   25,  281,  153,  409,   89,  345,  217,  473,
+   57,  313,  185,  441,  121,  377,  249,  505,
+    5,  261,  133,  389,   69,  325,  197,  453,
+   37,  293,  165,  421,  101,  357,  229,  485,
+   21,  277,  149,  405,   85,  341,  213,  469,
+   53,  309,  181,  437,  117,  373,  245,  501,
+   13,  269,  141,  397,   77,  333,  205,  461,
+   45,  301,  173,  429,  109,  365,  237,  493,
+   29,  285,  157,  413,   93,  349,  221,  477,
+   61,  317,  189,  445,  125,  381,  253,  509,
+    3,  259,  131,  387,   67,  323,  195,  451,
+   35,  291,  163,  419,   99,  355,  227,  483,
+   19,  275,  147,  403,   83,  339,  211,  467,
+   51,  307,  179,  435,  115,  371,  243,  499,
+   11,  267,  139,  395,   75,  331,  203,  459,
+   43,  299,  171,  427,  107,  363,  235,  491,
+   27,  283,  155,  411,   91,  347,  219,  475,
+   59,  315,  187,  443,  123,  379,  251,  507,
+    7, 1031,  519, 1543,  263, 1287,  775, 1799,
+  135, 1159,  647, 1671,  391, 1415,  903, 1927,
+   71, 1095,  583, 1607,  327, 1351,  839, 1863,
+  199, 1223,  711, 1735,  455, 1479,  967, 1991,
+   39, 1063,  551, 1575,  295, 1319,  807, 1831,
+  167, 1191,  679, 1703,  423, 1447,  935, 1959,
+  103, 1127,  615, 1639,  359, 1383,  871, 1895,
+  231, 1255,  743, 1767,  487, 1511,  999, 2023,
+   23, 1047,  535, 1559,  279, 1303,  791, 1815,
+  151, 1175,  663, 1687,  407, 1431,  919, 1943,
+   87, 1111,  599, 1623,  343, 1367,  855, 1879,
+  215, 1239,  727, 1751,  471, 1495,  983, 2007,
+   55, 1079,  567, 1591,  311, 1335,  823, 1847,
+  183, 1207,  695, 1719,  439, 1463,  951, 1975,
+  119, 1143,  631, 1655,  375, 1399,  887, 1911,
+  247, 1271,  759, 1783,  503, 1527, 1015, 2039,
+   15, 1039,  527, 1551,  271, 1295,  783, 1807,
+  143, 1167,  655, 1679,  399, 1423,  911, 1935,
+   79, 1103,  591, 1615,  335, 1359,  847, 1871,
+  207, 1231,  719, 1743,  463, 1487,  975, 1999,
+   47, 1071,  559, 1583,  303, 1327,  815, 1839,
+  175, 1199,  687, 1711,  431, 1455,  943, 1967,
+  111, 1135,  623, 1647,  367, 1391,  879, 1903,
+  239, 1263,  751, 1775,  495, 1519, 1007, 2031,
+   31, 1055,  543, 1567,  287, 1311,  799, 1823,
+  159, 1183,  671, 1695,  415, 1439,  927, 1951,
+   95, 1119,  607, 1631,  351, 1375,  863, 1887,
+  223, 1247,  735, 1759,  479, 1503,  991, 2015,
+   63, 1087,  575, 1599,  319, 1343,  831, 1855,
+  191, 1215,  703, 1727,  447, 1471,  959, 1983,
+  127, 1151,  639, 1663,  383, 1407,  895, 1919,
+  255, 1279,  767, 1791,  511, 1535, 1023, 2047,
+};
+
+static BROTLI_INLINE void StoreStaticCommandHuffmanTree(
+    size_t* storage_ix, uint8_t* storage) {
+  BrotliWriteBits(
+      56, BROTLI_MAKE_UINT64_T(0x926244U, 0x16307003U), storage_ix, storage);
+  BrotliWriteBits(3, 0x00000000U, storage_ix, storage);
+}
+
+static const uint16_t kStaticDistanceCodeBits[64] = {
+   0, 32, 16, 48,  8, 40, 24, 56,  4, 36, 20, 52, 12, 44, 28, 60,
+   2, 34, 18, 50, 10, 42, 26, 58,  6, 38, 22, 54, 14, 46, 30, 62,
+   1, 33, 17, 49,  9, 41, 25, 57,  5, 37, 21, 53, 13, 45, 29, 61,
+   3, 35, 19, 51, 11, 43, 27, 59,  7, 39, 23, 55, 15, 47, 31, 63,
+};
+
+static BROTLI_INLINE void StoreStaticDistanceHuffmanTree(
+    size_t* storage_ix, uint8_t* storage) {
+  BrotliWriteBits(28, 0x0369DC03u, storage_ix, storage);
+}
+/* GENERATED CODE END */
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_ENTROPY_ENCODE_STATIC_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/fast_log.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/fast_log.c
new file mode 100644
index 0000000000..2fa0efcf86
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/fast_log.c
@@ -0,0 +1,105 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include "fast_log.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* ", ".join(["%.16ff" % x for x in [0.0]+[log2(x) for x in range(1, 256)]]) */
+const double kBrotliLog2Table[BROTLI_LOG2_TABLE_SIZE] = {
+  0.0000000000000000f, 0.0000000000000000f, 1.0000000000000000f,
+  1.5849625007211563f, 2.0000000000000000f, 2.3219280948873622f,
+  2.5849625007211561f, 2.8073549220576042f, 3.0000000000000000f,
+  3.1699250014423126f, 3.3219280948873626f, 3.4594316186372978f,
+  3.5849625007211565f, 3.7004397181410922f, 3.8073549220576037f,
+  3.9068905956085187f, 4.0000000000000000f, 4.0874628412503400f,
+  4.1699250014423122f, 4.2479275134435852f, 4.3219280948873626f,
+  4.3923174227787607f, 4.4594316186372973f, 4.5235619560570131f,
+  4.5849625007211570f, 4.6438561897747244f, 4.7004397181410926f,
+  4.7548875021634691f, 4.8073549220576037f, 4.8579809951275728f,
+  4.9068905956085187f, 4.9541963103868758f, 5.0000000000000000f,
+  5.0443941193584534f, 5.0874628412503400f, 5.1292830169449664f,
+  5.1699250014423122f, 5.2094533656289501f, 5.2479275134435852f,
+  5.2854022188622487f, 5.3219280948873626f, 5.3575520046180838f,
+  5.3923174227787607f, 5.4262647547020979f, 5.4594316186372973f,
+  5.4918530963296748f, 5.5235619560570131f, 5.5545888516776376f,
+  5.5849625007211570f, 5.6147098441152083f, 5.6438561897747244f,
+  5.6724253419714961f, 5.7004397181410926f, 5.7279204545631996f,
+  5.7548875021634691f, 5.7813597135246599f, 5.8073549220576046f,
+  5.8328900141647422f, 5.8579809951275719f, 5.8826430493618416f,
+  5.9068905956085187f, 5.9307373375628867f, 5.9541963103868758f,
+  5.9772799234999168f, 6.0000000000000000f, 6.0223678130284544f,
+  6.0443941193584534f, 6.0660891904577721f, 6.0874628412503400f,
+  6.1085244567781700f, 6.1292830169449672f, 6.1497471195046822f,
+  6.1699250014423122f, 6.1898245588800176f, 6.2094533656289510f,
+  6.2288186904958804f, 6.2479275134435861f, 6.2667865406949019f,
+  6.2854022188622487f, 6.3037807481771031f, 6.3219280948873617f,
+  6.3398500028846252f, 6.3575520046180847f, 6.3750394313469254f,
+  6.3923174227787598f, 6.4093909361377026f, 6.4262647547020979f,
+  6.4429434958487288f, 6.4594316186372982f, 6.4757334309663976f,
+  6.4918530963296748f, 6.5077946401986964f, 6.5235619560570131f,
+  6.5391588111080319f, 6.5545888516776376f, 6.5698556083309478f,
+  6.5849625007211561f, 6.5999128421871278f, 6.6147098441152092f,
+  6.6293566200796095f, 6.6438561897747253f, 6.6582114827517955f,
+  6.6724253419714952f, 6.6865005271832185f, 6.7004397181410917f,
+  6.7142455176661224f, 6.7279204545631988f, 6.7414669864011465f,
+  6.7548875021634691f, 6.7681843247769260f, 6.7813597135246599f,
+  6.7944158663501062f, 6.8073549220576037f, 6.8201789624151887f,
+  6.8328900141647422f, 6.8454900509443757f, 6.8579809951275719f,
+  6.8703647195834048f, 6.8826430493618416f, 6.8948177633079437f,
+  6.9068905956085187f, 6.9188632372745955f, 6.9307373375628867f,
+  6.9425145053392399f, 6.9541963103868758f, 6.9657842846620879f,
+  6.9772799234999168f, 6.9886846867721664f, 7.0000000000000000f,
+  7.0112272554232540f, 7.0223678130284544f, 7.0334230015374501f,
+  7.0443941193584534f, 7.0552824355011898f, 7.0660891904577721f,
+  7.0768155970508317f, 7.0874628412503400f, 7.0980320829605272f,
+  7.1085244567781700f, 7.1189410727235076f, 7.1292830169449664f,
+  7.1395513523987937f, 7.1497471195046822f, 7.1598713367783891f,
+  7.1699250014423130f, 7.1799090900149345f, 7.1898245588800176f,
+  7.1996723448363644f, 7.2094533656289492f, 7.2191685204621621f,
+  7.2288186904958804f, 7.2384047393250794f, 7.2479275134435861f,
+  7.2573878426926521f, 7.2667865406949019f, 7.2761244052742384f,
+  7.2854022188622487f, 7.2946207488916270f, 7.3037807481771031f,
+  7.3128829552843557f, 7.3219280948873617f, 7.3309168781146177f,
+  7.3398500028846243f, 7.3487281542310781f, 7.3575520046180847f,
+  7.3663222142458151f, 7.3750394313469254f, 7.3837042924740528f,
+  7.3923174227787607f, 7.4008794362821844f, 7.4093909361377026f,
+  7.4178525148858991f, 7.4262647547020979f, 7.4346282276367255f,
+  7.4429434958487288f, 7.4512111118323299f, 7.4594316186372973f,
+  7.4676055500829976f, 7.4757334309663976f, 7.4838157772642564f,
+  7.4918530963296748f, 7.4998458870832057f, 7.5077946401986964f,
+  7.5156998382840436f, 7.5235619560570131f, 7.5313814605163119f,
+  7.5391588111080319f, 7.5468944598876373f, 7.5545888516776376f,
+  7.5622424242210728f, 7.5698556083309478f, 7.5774288280357487f,
+  7.5849625007211561f, 7.5924570372680806f, 7.5999128421871278f,
+  7.6073303137496113f, 7.6147098441152075f, 7.6220518194563764f,
+  7.6293566200796095f, 7.6366246205436488f, 7.6438561897747244f,
+  7.6510516911789290f, 7.6582114827517955f, 7.6653359171851765f,
+  7.6724253419714952f, 7.6794800995054464f, 7.6865005271832185f,
+  7.6934869574993252f, 7.7004397181410926f, 7.7073591320808825f,
+  7.7142455176661224f, 7.7210991887071856f, 7.7279204545631996f,
+  7.7347096202258392f, 7.7414669864011465f, 7.7481928495894596f,
+  7.7548875021634691f, 7.7615512324444795f, 7.7681843247769260f,
+  7.7747870596011737f, 7.7813597135246608f, 7.7879025593914317f,
+  7.7944158663501062f, 7.8008998999203047f, 7.8073549220576037f,
+  7.8137811912170374f, 7.8201789624151887f, 7.8265484872909159f,
+  7.8328900141647422f, 7.8392037880969445f, 7.8454900509443757f,
+  7.8517490414160571f, 7.8579809951275719f, 7.8641861446542798f,
+  7.8703647195834048f, 7.8765169465650002f, 7.8826430493618425f,
+  7.8887432488982601f, 7.8948177633079446f, 7.9008668079807496f,
+  7.9068905956085187f, 7.9128893362299619f, 7.9188632372745955f,
+  7.9248125036057813f, 7.9307373375628867f, 7.9366379390025719f,
+  7.9425145053392399f, 7.9483672315846778f, 7.9541963103868758f,
+  7.9600019320680806f, 7.9657842846620870f, 7.9715435539507720f,
+  7.9772799234999168f, 7.9829935746943104f, 7.9886846867721664f,
+  7.9943534368588578f
+};
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/fast_log.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/fast_log.h
new file mode 100644
index 0000000000..f82f4cffc8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/fast_log.h
@@ -0,0 +1,67 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Utilities for fast computation of logarithms. */
+
+#ifndef BROTLI_ENC_FAST_LOG_H_
+#define BROTLI_ENC_FAST_LOG_H_
+
+#include <math.h>
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static BROTLI_INLINE uint32_t Log2FloorNonZero(size_t n) {
+#if defined(BROTLI_BSR32)
+  return BROTLI_BSR32((uint32_t)n);
+#else
+  uint32_t result = 0;
+  while (n >>= 1) result++;
+  return result;
+#endif
+}
+
+#define BROTLI_LOG2_TABLE_SIZE 256
+
+/* A lookup table for small values of log2(int) to be used in entropy
+   computation. */
+BROTLI_INTERNAL extern const double kBrotliLog2Table[BROTLI_LOG2_TABLE_SIZE];
+
+/* Visual Studio 2012 and Android API levels < 18 do not have the log2()
+ * function defined, so we use log() and a multiplication instead. */
+#if !defined(BROTLI_HAVE_LOG2)
+#if ((defined(_MSC_VER) && _MSC_VER <= 1700) || \
+     (defined(__ANDROID_API__) && __ANDROID_API__ < 18))
+#define BROTLI_HAVE_LOG2 0
+#else
+#define BROTLI_HAVE_LOG2 1
+#endif
+#endif
+
+#define LOG_2_INV 1.4426950408889634
+
+/* Faster logarithm for small integers, with the property of log2(0) == 0. */
+static BROTLI_INLINE double FastLog2(size_t v) {
+  if (v < BROTLI_LOG2_TABLE_SIZE) {
+    return kBrotliLog2Table[v];
+  }
+#if !(BROTLI_HAVE_LOG2)
+  return log((double)v) * LOG_2_INV;
+#else
+  return log2((double)v);
+#endif
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_FAST_LOG_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/find_match_length.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/find_match_length.h
new file mode 100644
index 0000000000..f3de0bdb6b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/find_match_length.h
@@ -0,0 +1,72 @@
+/* Copyright 2010 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Function to find maximal matching prefixes of strings. */
+
+#ifndef BROTLI_ENC_FIND_MATCH_LENGTH_H_
+#define BROTLI_ENC_FIND_MATCH_LENGTH_H_
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* Separate implementation for little-endian 64-bit targets, for speed. */
+#if defined(BROTLI_TZCNT64) && BROTLI_64_BITS && BROTLI_LITTLE_ENDIAN
+static BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1,
+                                                     const uint8_t* s2,
+                                                     size_t limit) {
+  const uint8_t *s1_orig = s1;
+  for (; limit >= 8; limit -= 8) {
+    uint64_t x = BROTLI_UNALIGNED_LOAD64LE(s2) ^
+                 BROTLI_UNALIGNED_LOAD64LE(s1);
+    s2 += 8;
+    if (x != 0) {
+      size_t matching_bits = (size_t)BROTLI_TZCNT64(x);
+      return (size_t)(s1 - s1_orig) + (matching_bits >> 3);
+    }
+    s1 += 8;
+  }
+  while (limit && *s1 == *s2) {
+    limit--;
+    ++s2;
+    ++s1;
+  }
+  return (size_t)(s1 - s1_orig);
+}
+#else
+static BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1,
+                                                     const uint8_t* s2,
+                                                     size_t limit) {
+  size_t matched = 0;
+  const uint8_t* s2_limit = s2 + limit;
+  const uint8_t* s2_ptr = s2;
+  /* Find out how long the match is. We loop over the data 32 bits at a
+     time until we find a 32-bit block that doesn't match; then we find
+     the first non-matching bit and use that to calculate the total
+     length of the match. */
+  while (s2_ptr <= s2_limit - 4 &&
+         BrotliUnalignedRead32(s2_ptr) ==
+         BrotliUnalignedRead32(s1 + matched)) {
+    s2_ptr += 4;
+    matched += 4;
+  }
+  while ((s2_ptr < s2_limit) && (s1[matched] == *s2_ptr)) {
+    ++s2_ptr;
+    ++matched;
+  }
+  return matched;
+}
+#endif
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_FIND_MATCH_LENGTH_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash.h
new file mode 100644
index 0000000000..ba9b0d8204
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash.h
@@ -0,0 +1,734 @@
+/* Copyright 2010 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* A (forgetful) hash table to the data seen by the compressor, to
+   help create backward references to previous data. */
+
+#ifndef BROTLI_ENC_HASH_H_
+#define BROTLI_ENC_HASH_H_
+
+#include <stdlib.h>  /* exit */
+#include <string.h>  /* memcmp, memset */
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "compound_dictionary.h"
+#include "encoder_dict.h"
+#include "fast_log.h"
+#include "find_match_length.h"
+#include "memory.h"
+#include "quality.h"
+#include "static_dict.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+typedef struct {
+  /**
+   * Dynamically allocated areas; regular hasher uses one or two allocations;
+   * "composite" hasher uses up to 4 allocations.
+   */
+  void* extra[4];
+
+  /**
+   * False before the fisrt invocation of HasherSetup (where "extra" memory)
+   * is allocated.
+   */
+  BROTLI_BOOL is_setup_;
+
+  size_t dict_num_lookups;
+  size_t dict_num_matches;
+
+  BrotliHasherParams params;
+
+  /**
+   * False if hasher needs to be "prepared" before use (before the first
+   * invocation of HasherSetup or after HasherReset). "preparation" is hasher
+   * data initialization (using input ringbuffer).
+   */
+  BROTLI_BOOL is_prepared_;
+} HasherCommon;
+
+#define score_t size_t
+
+static const uint32_t kCutoffTransformsCount = 10;
+/*   0,  12,   27,    23,    42,    63,    56,    48,    59,    64 */
+/* 0+0, 4+8, 8+19, 12+11, 16+26, 20+43, 24+32, 28+20, 32+27, 36+28 */
+static const uint64_t kCutoffTransforms =
+    BROTLI_MAKE_UINT64_T(0x071B520A, 0xDA2D3200);
+
+typedef struct HasherSearchResult {
+  size_t len;
+  size_t distance;
+  score_t score;
+  int len_code_delta; /* == len_code - len */
+} HasherSearchResult;
+
+/* kHashMul32 multiplier has these properties:
+   * The multiplier must be odd. Otherwise we may lose the highest bit.
+   * No long streaks of ones or zeros.
+   * There is no effort to ensure that it is a prime, the oddity is enough
+     for this use.
+   * The number has been tuned heuristically against compression benchmarks. */
+static const uint32_t kHashMul32 = 0x1E35A7BD;
+static const uint64_t kHashMul64 =
+    BROTLI_MAKE_UINT64_T(0x1FE35A7Bu, 0xD3579BD3u);
+
+static BROTLI_INLINE uint32_t Hash14(const uint8_t* data) {
+  uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;
+  /* The higher bits contain more mixture from the multiplication,
+     so we take our results from there. */
+  return h >> (32 - 14);
+}
+
+static BROTLI_INLINE void PrepareDistanceCache(
+    int* BROTLI_RESTRICT distance_cache, const int num_distances) {
+  if (num_distances > 4) {
+    int last_distance = distance_cache[0];
+    distance_cache[4] = last_distance - 1;
+    distance_cache[5] = last_distance + 1;
+    distance_cache[6] = last_distance - 2;
+    distance_cache[7] = last_distance + 2;
+    distance_cache[8] = last_distance - 3;
+    distance_cache[9] = last_distance + 3;
+    if (num_distances > 10) {
+      int next_last_distance = distance_cache[1];
+      distance_cache[10] = next_last_distance - 1;
+      distance_cache[11] = next_last_distance + 1;
+      distance_cache[12] = next_last_distance - 2;
+      distance_cache[13] = next_last_distance + 2;
+      distance_cache[14] = next_last_distance - 3;
+      distance_cache[15] = next_last_distance + 3;
+    }
+  }
+}
+
+#define BROTLI_LITERAL_BYTE_SCORE 135
+#define BROTLI_DISTANCE_BIT_PENALTY 30
+/* Score must be positive after applying maximal penalty. */
+#define BROTLI_SCORE_BASE (BROTLI_DISTANCE_BIT_PENALTY * 8 * sizeof(size_t))
+
+/* Usually, we always choose the longest backward reference. This function
+   allows for the exception of that rule.
+
+   If we choose a backward reference that is further away, it will
+   usually be coded with more bits. We approximate this by assuming
+   log2(distance). If the distance can be expressed in terms of the
+   last four distances, we use some heuristic constants to estimate
+   the bits cost. For the first up to four literals we use the bit
+   cost of the literals from the literal cost model, after that we
+   use the average bit cost of the cost model.
+
+   This function is used to sometimes discard a longer backward reference
+   when it is not much longer and the bit cost for encoding it is more
+   than the saved literals.
+
+   backward_reference_offset MUST be positive. */
+static BROTLI_INLINE score_t BackwardReferenceScore(
+    size_t copy_length, size_t backward_reference_offset) {
+  return BROTLI_SCORE_BASE + BROTLI_LITERAL_BYTE_SCORE * (score_t)copy_length -
+      BROTLI_DISTANCE_BIT_PENALTY * Log2FloorNonZero(backward_reference_offset);
+}
+
+static BROTLI_INLINE score_t BackwardReferenceScoreUsingLastDistance(
+    size_t copy_length) {
+  return BROTLI_LITERAL_BYTE_SCORE * (score_t)copy_length +
+      BROTLI_SCORE_BASE + 15;
+}
+
+static BROTLI_INLINE score_t BackwardReferencePenaltyUsingLastDistance(
+    size_t distance_short_code) {
+  return (score_t)39 + ((0x1CA10 >> (distance_short_code & 0xE)) & 0xE);
+}
+
+static BROTLI_INLINE BROTLI_BOOL TestStaticDictionaryItem(
+    const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx,
+    const uint8_t* data, size_t max_length, size_t max_backward,
+    size_t max_distance, HasherSearchResult* out) {
+  size_t offset;
+  size_t matchlen;
+  size_t backward;
+  score_t score;
+  offset = dictionary->words->offsets_by_length[len] + len * word_idx;
+  if (len > max_length) {
+    return BROTLI_FALSE;
+  }
+
+  matchlen =
+      FindMatchLengthWithLimit(data, &dictionary->words->data[offset], len);
+  if (matchlen + dictionary->cutoffTransformsCount <= len || matchlen == 0) {
+    return BROTLI_FALSE;
+  }
+  {
+    size_t cut = len - matchlen;
+    size_t transform_id = (cut << 2) +
+        (size_t)((dictionary->cutoffTransforms >> (cut * 6)) & 0x3F);
+    backward = max_backward + 1 + word_idx +
+        (transform_id << dictionary->words->size_bits_by_length[len]);
+  }
+  if (backward > max_distance) {
+    return BROTLI_FALSE;
+  }
+  score = BackwardReferenceScore(matchlen, backward);
+  if (score < out->score) {
+    return BROTLI_FALSE;
+  }
+  out->len = matchlen;
+  out->len_code_delta = (int)len - (int)matchlen;
+  out->distance = backward;
+  out->score = score;
+  return BROTLI_TRUE;
+}
+
+static BROTLI_INLINE void SearchInStaticDictionary(
+    const BrotliEncoderDictionary* dictionary,
+    HasherCommon* common, const uint8_t* data, size_t max_length,
+    size_t max_backward, size_t max_distance,
+    HasherSearchResult* out, BROTLI_BOOL shallow) {
+  size_t key;
+  size_t i;
+  if (common->dict_num_matches < (common->dict_num_lookups >> 7)) {
+    return;
+  }
+  key = Hash14(data) << 1;
+  for (i = 0; i < (shallow ? 1u : 2u); ++i, ++key) {
+    common->dict_num_lookups++;
+    if (dictionary->hash_table_lengths[key] != 0) {
+      BROTLI_BOOL item_matches = TestStaticDictionaryItem(
+          dictionary, dictionary->hash_table_lengths[key],
+          dictionary->hash_table_words[key], data,
+          max_length, max_backward, max_distance, out);
+      if (item_matches) {
+        common->dict_num_matches++;
+      }
+    }
+  }
+}
+
+typedef struct BackwardMatch {
+  uint32_t distance;
+  uint32_t length_and_code;
+} BackwardMatch;
+
+static BROTLI_INLINE void InitBackwardMatch(BackwardMatch* self,
+    size_t dist, size_t len) {
+  self->distance = (uint32_t)dist;
+  self->length_and_code = (uint32_t)(len << 5);
+}
+
+static BROTLI_INLINE void InitDictionaryBackwardMatch(BackwardMatch* self,
+    size_t dist, size_t len, size_t len_code) {
+  self->distance = (uint32_t)dist;
+  self->length_and_code =
+      (uint32_t)((len << 5) | (len == len_code ? 0 : len_code));
+}
+
+static BROTLI_INLINE size_t BackwardMatchLength(const BackwardMatch* self) {
+  return self->length_and_code >> 5;
+}
+
+static BROTLI_INLINE size_t BackwardMatchLengthCode(const BackwardMatch* self) {
+  size_t code = self->length_and_code & 31;
+  return code ? code : BackwardMatchLength(self);
+}
+
+#define EXPAND_CAT(a, b) CAT(a, b)
+#define CAT(a, b) a ## b
+#define FN(X) EXPAND_CAT(X, HASHER())
+
+#define HASHER() H10
+#define BUCKET_BITS 17
+#define MAX_TREE_SEARCH_DEPTH 64
+#define MAX_TREE_COMP_LENGTH 128
+#include "hash_to_binary_tree_inc.h"  /* NOLINT(build/include) */
+#undef MAX_TREE_SEARCH_DEPTH
+#undef MAX_TREE_COMP_LENGTH
+#undef BUCKET_BITS
+#undef HASHER
+/* MAX_NUM_MATCHES == 64 + MAX_TREE_SEARCH_DEPTH */
+#define MAX_NUM_MATCHES_H10 128
+
+/* For BUCKET_SWEEP_BITS == 0, enabling the dictionary lookup makes compression
+   a little faster (0.5% - 1%) and it compresses 0.15% better on small text
+   and HTML inputs. */
+
+#define HASHER() H2
+#define BUCKET_BITS 16
+#define BUCKET_SWEEP_BITS 0
+#define HASH_LEN 5
+#define USE_DICTIONARY 1
+#include "hash_longest_match_quickly_inc.h"  /* NOLINT(build/include) */
+#undef BUCKET_SWEEP_BITS
+#undef USE_DICTIONARY
+#undef HASHER
+
+#define HASHER() H3
+#define BUCKET_SWEEP_BITS 1
+#define USE_DICTIONARY 0
+#include "hash_longest_match_quickly_inc.h"  /* NOLINT(build/include) */
+#undef USE_DICTIONARY
+#undef BUCKET_SWEEP_BITS
+#undef BUCKET_BITS
+#undef HASHER
+
+#define HASHER() H4
+#define BUCKET_BITS 17
+#define BUCKET_SWEEP_BITS 2
+#define USE_DICTIONARY 1
+#include "hash_longest_match_quickly_inc.h"  /* NOLINT(build/include) */
+#undef USE_DICTIONARY
+#undef HASH_LEN
+#undef BUCKET_SWEEP_BITS
+#undef BUCKET_BITS
+#undef HASHER
+
+#define HASHER() H5
+#include "hash_longest_match_inc.h"  /* NOLINT(build/include) */
+#undef HASHER
+
+#define HASHER() H6
+#include "hash_longest_match64_inc.h"  /* NOLINT(build/include) */
+#undef HASHER
+
+#define BUCKET_BITS 15
+
+#define NUM_LAST_DISTANCES_TO_CHECK 4
+#define NUM_BANKS 1
+#define BANK_BITS 16
+#define HASHER() H40
+#include "hash_forgetful_chain_inc.h"  /* NOLINT(build/include) */
+#undef HASHER
+#undef NUM_LAST_DISTANCES_TO_CHECK
+
+#define NUM_LAST_DISTANCES_TO_CHECK 10
+#define HASHER() H41
+#include "hash_forgetful_chain_inc.h"  /* NOLINT(build/include) */
+#undef HASHER
+#undef NUM_LAST_DISTANCES_TO_CHECK
+#undef NUM_BANKS
+#undef BANK_BITS
+
+#define NUM_LAST_DISTANCES_TO_CHECK 16
+#define NUM_BANKS 512
+#define BANK_BITS 9
+#define HASHER() H42
+#include "hash_forgetful_chain_inc.h"  /* NOLINT(build/include) */
+#undef HASHER
+#undef NUM_LAST_DISTANCES_TO_CHECK
+#undef NUM_BANKS
+#undef BANK_BITS
+
+#undef BUCKET_BITS
+
+#define HASHER() H54
+#define BUCKET_BITS 20
+#define BUCKET_SWEEP_BITS 2
+#define HASH_LEN 7
+#define USE_DICTIONARY 0
+#include "hash_longest_match_quickly_inc.h"  /* NOLINT(build/include) */
+#undef USE_DICTIONARY
+#undef HASH_LEN
+#undef BUCKET_SWEEP_BITS
+#undef BUCKET_BITS
+#undef HASHER
+
+/* fast large window hashers */
+
+#define HASHER() HROLLING_FAST
+#define CHUNKLEN 32
+#define JUMP 4
+#define NUMBUCKETS 16777216
+#define MASK ((NUMBUCKETS * 64) - 1)
+#include "hash_rolling_inc.h"  /* NOLINT(build/include) */
+#undef JUMP
+#undef HASHER
+
+
+#define HASHER() HROLLING
+#define JUMP 1
+#include "hash_rolling_inc.h"  /* NOLINT(build/include) */
+#undef MASK
+#undef NUMBUCKETS
+#undef JUMP
+#undef CHUNKLEN
+#undef HASHER
+
+#define HASHER() H35
+#define HASHER_A H3
+#define HASHER_B HROLLING_FAST
+#include "hash_composite_inc.h"  /* NOLINT(build/include) */
+#undef HASHER_A
+#undef HASHER_B
+#undef HASHER
+
+#define HASHER() H55
+#define HASHER_A H54
+#define HASHER_B HROLLING_FAST
+#include "hash_composite_inc.h"  /* NOLINT(build/include) */
+#undef HASHER_A
+#undef HASHER_B
+#undef HASHER
+
+#define HASHER() H65
+#define HASHER_A H6
+#define HASHER_B HROLLING
+#include "hash_composite_inc.h"  /* NOLINT(build/include) */
+#undef HASHER_A
+#undef HASHER_B
+#undef HASHER
+
+#undef FN
+#undef CAT
+#undef EXPAND_CAT
+
+#define FOR_SIMPLE_HASHERS(H) H(2) H(3) H(4) H(5) H(6) H(40) H(41) H(42) H(54)
+#define FOR_COMPOSITE_HASHERS(H) H(35) H(55) H(65)
+#define FOR_GENERIC_HASHERS(H) FOR_SIMPLE_HASHERS(H) FOR_COMPOSITE_HASHERS(H)
+#define FOR_ALL_HASHERS(H) FOR_GENERIC_HASHERS(H) H(10)
+
+typedef struct {
+  HasherCommon common;
+
+  union {
+#define MEMBER_(N) \
+    H ## N _H ## N;
+    FOR_ALL_HASHERS(MEMBER_)
+#undef MEMBER_
+  } privat;
+} Hasher;
+
+/* MUST be invoked before any other method. */
+static BROTLI_INLINE void HasherInit(Hasher* hasher) {
+  hasher->common.is_setup_ = BROTLI_FALSE;
+  hasher->common.extra[0] = NULL;
+  hasher->common.extra[1] = NULL;
+  hasher->common.extra[2] = NULL;
+  hasher->common.extra[3] = NULL;
+}
+
+static BROTLI_INLINE void DestroyHasher(MemoryManager* m, Hasher* hasher) {
+  if (hasher->common.extra[0] != NULL) BROTLI_FREE(m, hasher->common.extra[0]);
+  if (hasher->common.extra[1] != NULL) BROTLI_FREE(m, hasher->common.extra[1]);
+  if (hasher->common.extra[2] != NULL) BROTLI_FREE(m, hasher->common.extra[2]);
+  if (hasher->common.extra[3] != NULL) BROTLI_FREE(m, hasher->common.extra[3]);
+}
+
+static BROTLI_INLINE void HasherReset(Hasher* hasher) {
+  hasher->common.is_prepared_ = BROTLI_FALSE;
+}
+
+static BROTLI_INLINE void HasherSize(const BrotliEncoderParams* params,
+    BROTLI_BOOL one_shot, const size_t input_size, size_t* alloc_size) {
+  switch (params->hasher.type) {
+#define SIZE_(N)                                                           \
+    case N:                                                                \
+      HashMemAllocInBytesH ## N(params, one_shot, input_size, alloc_size); \
+      break;
+    FOR_ALL_HASHERS(SIZE_)
+#undef SIZE_
+    default:
+      break;
+  }
+}
+
+static BROTLI_INLINE void HasherSetup(MemoryManager* m, Hasher* hasher,
+    BrotliEncoderParams* params, const uint8_t* data, size_t position,
+    size_t input_size, BROTLI_BOOL is_last) {
+  BROTLI_BOOL one_shot = (position == 0 && is_last);
+  if (!hasher->common.is_setup_) {
+    size_t alloc_size[4] = {0};
+    size_t i;
+    ChooseHasher(params, &params->hasher);
+    hasher->common.params = params->hasher;
+    hasher->common.dict_num_lookups = 0;
+    hasher->common.dict_num_matches = 0;
+    HasherSize(params, one_shot, input_size, alloc_size);
+    for (i = 0; i < 4; ++i) {
+      if (alloc_size[i] == 0) continue;
+      hasher->common.extra[i] = BROTLI_ALLOC(m, uint8_t, alloc_size[i]);
+      if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(hasher->common.extra[i])) return;
+    }
+    switch (hasher->common.params.type) {
+#define INITIALIZE_(N)                        \
+      case N:                                 \
+        InitializeH ## N(&hasher->common,     \
+            &hasher->privat._H ## N, params); \
+        break;
+      FOR_ALL_HASHERS(INITIALIZE_);
+#undef INITIALIZE_
+      default:
+        break;
+    }
+    HasherReset(hasher);
+    hasher->common.is_setup_ = BROTLI_TRUE;
+  }
+
+  if (!hasher->common.is_prepared_) {
+    switch (hasher->common.params.type) {
+#define PREPARE_(N)                      \
+      case N:                            \
+        PrepareH ## N(                   \
+            &hasher->privat._H ## N,     \
+            one_shot, input_size, data); \
+        break;
+      FOR_ALL_HASHERS(PREPARE_)
+#undef PREPARE_
+      default: break;
+    }
+    hasher->common.is_prepared_ = BROTLI_TRUE;
+  }
+}
+
+static BROTLI_INLINE void InitOrStitchToPreviousBlock(
+    MemoryManager* m, Hasher* hasher, const uint8_t* data, size_t mask,
+    BrotliEncoderParams* params, size_t position, size_t input_size,
+    BROTLI_BOOL is_last) {
+  HasherSetup(m, hasher, params, data, position, input_size, is_last);
+  if (BROTLI_IS_OOM(m)) return;
+  switch (hasher->common.params.type) {
+#define INIT_(N)                             \
+    case N:                                  \
+      StitchToPreviousBlockH ## N(           \
+          &hasher->privat._H ## N,           \
+          input_size, position, data, mask); \
+    break;
+    FOR_ALL_HASHERS(INIT_)
+#undef INIT_
+    default: break;
+  }
+}
+
+/* NB: when seamless dictionary-ring-buffer copies are implemented, don't forget
+       to add proper guards for non-zero-BROTLI_PARAM_STREAM_OFFSET. */
+static BROTLI_INLINE void FindCompoundDictionaryMatch(
+    const PreparedDictionary* self, const uint8_t* BROTLI_RESTRICT data,
+    const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache,
+    const size_t cur_ix, const size_t max_length, const size_t distance_offset,
+    const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) {
+  const uint32_t source_size = self->source_size;
+  const size_t boundary = distance_offset - source_size;
+  const uint32_t hash_bits = self->hash_bits;
+  const uint32_t bucket_bits = self->bucket_bits;
+  const uint32_t slot_bits = self->slot_bits;
+
+  const uint32_t hash_shift = 64u - bucket_bits;
+  const uint32_t slot_mask = (~((uint32_t)0U)) >> (32 - slot_bits);
+  const uint64_t hash_mask = (~((uint64_t)0U)) >> (64 - hash_bits);
+
+  const uint32_t* slot_offsets = (uint32_t*)(&self[1]);
+  const uint16_t* heads = (uint16_t*)(&slot_offsets[1u << slot_bits]);
+  const uint32_t* items = (uint32_t*)(&heads[1u << bucket_bits]);
+  const uint8_t* source = NULL;
+
+  const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
+  score_t best_score = out->score;
+  size_t best_len = out->len;
+  size_t i;
+  const uint64_t h =
+      (BROTLI_UNALIGNED_LOAD64LE(&data[cur_ix_masked]) & hash_mask) *
+      kPreparedDictionaryHashMul64Long;
+  const uint32_t key = (uint32_t)(h >> hash_shift);
+  const uint32_t slot = key & slot_mask;
+  const uint32_t head = heads[key];
+  const uint32_t* BROTLI_RESTRICT chain = &items[slot_offsets[slot] + head];
+  uint32_t item = (head == 0xFFFF) ? 1 : 0;
+
+  const void* tail = (void*)&items[self->num_items];
+  if (self->magic == kPreparedDictionaryMagic) {
+    source = (const uint8_t*)tail;
+  } else {
+    /* kLeanPreparedDictionaryMagic */
+    source = (const uint8_t*)BROTLI_UNALIGNED_LOAD_PTR((const uint8_t**)tail);
+  }
+
+  for (i = 0; i < 4; ++i) {
+    const size_t distance = (size_t)distance_cache[i];
+    size_t offset;
+    size_t limit;
+    size_t len;
+    if (distance <= boundary || distance > distance_offset) continue;
+    offset = distance_offset - distance;
+    limit = source_size - offset;
+    limit = limit > max_length ? max_length : limit;
+    len = FindMatchLengthWithLimit(&source[offset], &data[cur_ix_masked],
+                                   limit);
+    if (len >= 2) {
+      score_t score = BackwardReferenceScoreUsingLastDistance(len);
+      if (best_score < score) {
+        if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);
+        if (best_score < score) {
+          best_score = score;
+          if (len > best_len) best_len = len;
+          out->len = len;
+          out->len_code_delta = 0;
+          out->distance = distance;
+          out->score = best_score;
+        }
+      }
+    }
+  }
+  /* we require matches of len >4, so increase best_len to 3, so we can compare
+   * 4 bytes all the time. */
+  if (best_len < 3) {
+    best_len = 3;
+  }
+  while (item == 0) {
+    size_t offset;
+    size_t distance;
+    size_t limit;
+    item = *chain;
+    chain++;
+    offset = item & 0x7FFFFFFF;
+    item &= 0x80000000;
+    distance = distance_offset - offset;
+    limit = source_size - offset;
+    limit = (limit > max_length) ? max_length : limit;
+    if (distance > max_distance) continue;
+    if (cur_ix_masked + best_len > ring_buffer_mask || best_len >= limit ||
+        /* compare 4 bytes ending at best_len + 1 */
+        BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=
+            BrotliUnalignedRead32(&source[offset + best_len - 3])) {
+      continue;
+    }
+    {
+      const size_t len = FindMatchLengthWithLimit(&source[offset],
+                                                  &data[cur_ix_masked],
+                                                  limit);
+      if (len >= 4) {
+        score_t score = BackwardReferenceScore(len, distance);
+        if (best_score < score) {
+          best_score = score;
+          best_len = len;
+          out->len = best_len;
+          out->len_code_delta = 0;
+          out->distance = distance;
+          out->score = best_score;
+        }
+      }
+    }
+  }
+}
+
+/* NB: when seamless dictionary-ring-buffer copies are implemented, don't forget
+       to add proper guards for non-zero-BROTLI_PARAM_STREAM_OFFSET. */
+static BROTLI_INLINE size_t FindAllCompoundDictionaryMatches(
+    const PreparedDictionary* self, const uint8_t* BROTLI_RESTRICT data,
+    const size_t ring_buffer_mask, const size_t cur_ix, const size_t min_length,
+    const size_t max_length, const size_t distance_offset,
+    const size_t max_distance, BackwardMatch* matches, size_t match_limit) {
+  const uint32_t source_size = self->source_size;
+  const uint32_t hash_bits = self->hash_bits;
+  const uint32_t bucket_bits = self->bucket_bits;
+  const uint32_t slot_bits = self->slot_bits;
+
+  const uint32_t hash_shift = 64u - bucket_bits;
+  const uint32_t slot_mask = (~((uint32_t)0U)) >> (32 - slot_bits);
+  const uint64_t hash_mask = (~((uint64_t)0U)) >> (64 - hash_bits);
+
+  const uint32_t* slot_offsets = (uint32_t*)(&self[1]);
+  const uint16_t* heads = (uint16_t*)(&slot_offsets[1u << slot_bits]);
+  const uint32_t* items = (uint32_t*)(&heads[1u << bucket_bits]);
+  const uint8_t* source = NULL;
+
+  const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
+  size_t best_len = min_length;
+  const uint64_t h =
+      (BROTLI_UNALIGNED_LOAD64LE(&data[cur_ix_masked]) & hash_mask) *
+      kPreparedDictionaryHashMul64Long;
+  const uint32_t key = (uint32_t)(h >> hash_shift);
+  const uint32_t slot = key & slot_mask;
+  const uint32_t head = heads[key];
+  const uint32_t* BROTLI_RESTRICT chain = &items[slot_offsets[slot] + head];
+  uint32_t item = (head == 0xFFFF) ? 1 : 0;
+  size_t found = 0;
+
+  const void* tail = (void*)&items[self->num_items];
+  if (self->magic == kPreparedDictionaryMagic) {
+    source = (const uint8_t*)tail;
+  } else {
+    /* kLeanPreparedDictionaryMagic */
+    source = (const uint8_t*)BROTLI_UNALIGNED_LOAD_PTR((const uint8_t**)tail);
+  }
+
+  while (item == 0) {
+    size_t offset;
+    size_t distance;
+    size_t limit;
+    size_t len;
+    item = *chain;
+    chain++;
+    offset = item & 0x7FFFFFFF;
+    item &= 0x80000000;
+    distance = distance_offset - offset;
+    limit = source_size - offset;
+    limit = (limit > max_length) ? max_length : limit;
+    if (distance > max_distance) continue;
+    if (cur_ix_masked + best_len > ring_buffer_mask ||
+        best_len >= limit ||
+        data[cur_ix_masked + best_len] != source[offset + best_len]) {
+      continue;
+    }
+    len = FindMatchLengthWithLimit(
+        &source[offset], &data[cur_ix_masked], limit);
+    if (len > best_len) {
+      best_len = len;
+      InitBackwardMatch(matches++, distance, len);
+      found++;
+      if (found == match_limit) break;
+    }
+  }
+  return found;
+}
+
+static BROTLI_INLINE void LookupCompoundDictionaryMatch(
+    const CompoundDictionary* addon, const uint8_t* BROTLI_RESTRICT data,
+    const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache,
+    const size_t cur_ix, const size_t max_length,
+    const size_t max_ring_buffer_distance, const size_t max_distance,
+    HasherSearchResult* sr) {
+  size_t base_offset = max_ring_buffer_distance + 1 + addon->total_size - 1;
+  size_t d;
+  for (d = 0; d < addon->num_chunks; ++d) {
+    /* Only one prepared dictionary type is currently supported. */
+    FindCompoundDictionaryMatch(
+        (const PreparedDictionary*)addon->chunks[d], data, ring_buffer_mask,
+        distance_cache, cur_ix, max_length,
+        base_offset - addon->chunk_offsets[d], max_distance, sr);
+  }
+}
+
+static BROTLI_INLINE size_t LookupAllCompoundDictionaryMatches(
+    const CompoundDictionary* addon, const uint8_t* BROTLI_RESTRICT data,
+    const size_t ring_buffer_mask, const size_t cur_ix, size_t min_length,
+    const size_t max_length, const size_t max_ring_buffer_distance,
+    const size_t max_distance, BackwardMatch* matches,
+    size_t match_limit) {
+  size_t base_offset = max_ring_buffer_distance + 1 + addon->total_size - 1;
+  size_t d;
+  size_t total_found = 0;
+  for (d = 0; d < addon->num_chunks; ++d) {
+    /* Only one prepared dictionary type is currently supported. */
+    total_found += FindAllCompoundDictionaryMatches(
+        (const PreparedDictionary*)addon->chunks[d], data, ring_buffer_mask,
+        cur_ix, min_length, max_length, base_offset - addon->chunk_offsets[d],
+        max_distance, matches + total_found, match_limit - total_found);
+    if (total_found == match_limit) break;
+    if (total_found > 0) {
+      min_length = BackwardMatchLength(&matches[total_found - 1]);
+    }
+  }
+  return total_found;
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_HASH_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_composite_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_composite_inc.h
new file mode 100644
index 0000000000..3923bc72c8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_composite_inc.h
@@ -0,0 +1,140 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2018 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN, HASHER_A, HASHER_B */
+
+/* Composite hasher: This hasher allows to combine two other hashers, HASHER_A
+   and HASHER_B. */
+
+#define HashComposite HASHER()
+
+#define FN_A(X) EXPAND_CAT(X, HASHER_A)
+#define FN_B(X) EXPAND_CAT(X, HASHER_B)
+
+static BROTLI_INLINE size_t FN(HashTypeLength)(void) {
+  size_t a =  FN_A(HashTypeLength)();
+  size_t b =  FN_B(HashTypeLength)();
+  return a > b ? a : b;
+}
+
+static BROTLI_INLINE size_t FN(StoreLookahead)(void) {
+  size_t a =  FN_A(StoreLookahead)();
+  size_t b =  FN_B(StoreLookahead)();
+  return a > b ? a : b;
+}
+
+typedef struct HashComposite {
+  HASHER_A ha;
+  HASHER_B hb;
+  HasherCommon ha_common;
+  HasherCommon hb_common;
+
+  /* Shortcuts. */
+  HasherCommon* common;
+
+  BROTLI_BOOL fresh;
+  const BrotliEncoderParams* params;
+} HashComposite;
+
+static void FN(Initialize)(HasherCommon* common,
+    HashComposite* BROTLI_RESTRICT self, const BrotliEncoderParams* params) {
+  self->common = common;
+
+  self->ha_common = *self->common;
+  self->hb_common = *self->common;
+  self->fresh = BROTLI_TRUE;
+  self->params = params;
+  /* TODO(lode): Initialize of the hashers is deferred to Prepare (and params
+     remembered here) because we don't get the one_shot and input_size params
+     here that are needed to know the memory size of them. Instead provide
+     those params to all hashers FN(Initialize) */
+}
+
+static void FN(Prepare)(
+    HashComposite* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,
+    size_t input_size, const uint8_t* BROTLI_RESTRICT data) {
+  if (self->fresh) {
+    self->fresh = BROTLI_FALSE;
+    self->ha_common.extra[0] = self->common->extra[0];
+    self->ha_common.extra[1] = self->common->extra[1];
+    self->ha_common.extra[2] = NULL;
+    self->ha_common.extra[3] = NULL;
+    self->hb_common.extra[0] = self->common->extra[2];
+    self->hb_common.extra[1] = self->common->extra[3];
+    self->hb_common.extra[2] = NULL;
+    self->hb_common.extra[3] = NULL;
+
+    FN_A(Initialize)(&self->ha_common, &self->ha, self->params);
+    FN_B(Initialize)(&self->hb_common, &self->hb, self->params);
+  }
+  FN_A(Prepare)(&self->ha, one_shot, input_size, data);
+  FN_B(Prepare)(&self->hb, one_shot, input_size, data);
+}
+
+static BROTLI_INLINE void FN(HashMemAllocInBytes)(
+    const BrotliEncoderParams* params, BROTLI_BOOL one_shot,
+    size_t input_size, size_t* alloc_size) {
+  size_t alloc_size_a[4] = {0};
+  size_t alloc_size_b[4] = {0};
+  FN_A(HashMemAllocInBytes)(params, one_shot, input_size, alloc_size_a);
+  FN_B(HashMemAllocInBytes)(params, one_shot, input_size, alloc_size_b);
+  /* Should never happen. */
+  if (alloc_size_a[2] != 0 || alloc_size_a[3] != 0) exit(EXIT_FAILURE);
+  if (alloc_size_b[2] != 0 || alloc_size_b[3] != 0) exit(EXIT_FAILURE);
+  alloc_size[0] = alloc_size_a[0];
+  alloc_size[1] = alloc_size_a[1];
+  alloc_size[2] = alloc_size_b[0];
+  alloc_size[3] = alloc_size_b[1];
+}
+
+static BROTLI_INLINE void FN(Store)(HashComposite* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) {
+  FN_A(Store)(&self->ha, data, mask, ix);
+  FN_B(Store)(&self->hb, data, mask, ix);
+}
+
+static BROTLI_INLINE void FN(StoreRange)(
+    HashComposite* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,
+    const size_t mask, const size_t ix_start,
+    const size_t ix_end) {
+  FN_A(StoreRange)(&self->ha, data, mask, ix_start, ix_end);
+  FN_B(StoreRange)(&self->hb, data, mask, ix_start, ix_end);
+}
+
+static BROTLI_INLINE void FN(StitchToPreviousBlock)(
+    HashComposite* BROTLI_RESTRICT self,
+    size_t num_bytes, size_t position, const uint8_t* ringbuffer,
+    size_t ring_buffer_mask) {
+  FN_A(StitchToPreviousBlock)(&self->ha, num_bytes, position,
+      ringbuffer, ring_buffer_mask);
+  FN_B(StitchToPreviousBlock)(&self->hb, num_bytes, position,
+      ringbuffer, ring_buffer_mask);
+}
+
+static BROTLI_INLINE void FN(PrepareDistanceCache)(
+    HashComposite* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) {
+  FN_A(PrepareDistanceCache)(&self->ha, distance_cache);
+  FN_B(PrepareDistanceCache)(&self->hb, distance_cache);
+}
+
+static BROTLI_INLINE void FN(FindLongestMatch)(
+    HashComposite* BROTLI_RESTRICT self,
+    const BrotliEncoderDictionary* dictionary,
+    const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,
+    const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,
+    const size_t max_length, const size_t max_backward,
+    const size_t dictionary_distance, const size_t max_distance,
+    HasherSearchResult* BROTLI_RESTRICT out) {
+  FN_A(FindLongestMatch)(&self->ha, dictionary, data, ring_buffer_mask,
+      distance_cache, cur_ix, max_length, max_backward, dictionary_distance,
+      max_distance, out);
+  FN_B(FindLongestMatch)(&self->hb, dictionary, data, ring_buffer_mask,
+      distance_cache, cur_ix, max_length, max_backward, dictionary_distance,
+      max_distance, out);
+}
+
+#undef HashComposite
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_forgetful_chain_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_forgetful_chain_inc.h
new file mode 100644
index 0000000000..9a8efeb6c0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_forgetful_chain_inc.h
@@ -0,0 +1,302 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN, BUCKET_BITS, NUM_BANKS, BANK_BITS,
+                        NUM_LAST_DISTANCES_TO_CHECK */
+
+/* A (forgetful) hash table to the data seen by the compressor, to
+   help create backward references to previous data.
+
+   Hashes are stored in chains which are bucketed to groups. Group of chains
+   share a storage "bank". When more than "bank size" chain nodes are added,
+   oldest nodes are replaced; this way several chains may share a tail. */
+
+#define HashForgetfulChain HASHER()
+
+#define BANK_SIZE (1 << BANK_BITS)
+
+/* Number of hash buckets. */
+#define BUCKET_SIZE (1 << BUCKET_BITS)
+
+#define CAPPED_CHAINS 0
+
+static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }
+static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; }
+
+/* HashBytes is the function that chooses the bucket to place the address in.*/
+static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) {
+  const uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;
+  /* The higher bits contain more mixture from the multiplication,
+     so we take our results from there. */
+  return h >> (32 - BUCKET_BITS);
+}
+
+typedef struct FN(Slot) {
+  uint16_t delta;
+  uint16_t next;
+} FN(Slot);
+
+typedef struct FN(Bank) {
+  FN(Slot) slots[BANK_SIZE];
+} FN(Bank);
+
+typedef struct HashForgetfulChain {
+  uint16_t free_slot_idx[NUM_BANKS];  /* Up to 1KiB. Move to dynamic? */
+  size_t max_hops;
+
+  /* Shortcuts. */
+  void* extra[2];
+  HasherCommon* common;
+
+  /* --- Dynamic size members --- */
+
+  /* uint32_t addr[BUCKET_SIZE]; */
+
+  /* uint16_t head[BUCKET_SIZE]; */
+
+  /* Truncated hash used for quick rejection of "distance cache" candidates. */
+  /* uint8_t tiny_hash[65536];*/
+
+  /* FN(Bank) banks[NUM_BANKS]; */
+} HashForgetfulChain;
+
+static uint32_t* FN(Addr)(void* extra) {
+  return (uint32_t*)extra;
+}
+
+static uint16_t* FN(Head)(void* extra) {
+  return (uint16_t*)(&FN(Addr)(extra)[BUCKET_SIZE]);
+}
+
+static uint8_t* FN(TinyHash)(void* extra) {
+  return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]);
+}
+
+static FN(Bank)* FN(Banks)(void* extra) {
+  return (FN(Bank)*)(extra);
+}
+
+static void FN(Initialize)(
+    HasherCommon* common, HashForgetfulChain* BROTLI_RESTRICT self,
+    const BrotliEncoderParams* params) {
+  self->common = common;
+  self->extra[0] = common->extra[0];
+  self->extra[1] = common->extra[1];
+
+  self->max_hops = (params->quality > 6 ? 7u : 8u) << (params->quality - 4);
+}
+
+static void FN(Prepare)(
+    HashForgetfulChain* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,
+    size_t input_size, const uint8_t* BROTLI_RESTRICT data) {
+  uint32_t* BROTLI_RESTRICT addr = FN(Addr)(self->extra[0]);
+  uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra[0]);
+  uint8_t* BROTLI_RESTRICT tiny_hash = FN(TinyHash)(self->extra[0]);
+  /* Partial preparation is 100 times slower (per socket). */
+  size_t partial_prepare_threshold = BUCKET_SIZE >> 6;
+  if (one_shot && input_size <= partial_prepare_threshold) {
+    size_t i;
+    for (i = 0; i < input_size; ++i) {
+      size_t bucket = FN(HashBytes)(&data[i]);
+      /* See InitEmpty comment. */
+      addr[bucket] = 0xCCCCCCCC;
+      head[bucket] = 0xCCCC;
+    }
+  } else {
+    /* Fill |addr| array with 0xCCCCCCCC value. Because of wrapping, position
+       processed by hasher never reaches 3GB + 64M; this makes all new chains
+       to be terminated after the first node. */
+    memset(addr, 0xCC, sizeof(uint32_t) * BUCKET_SIZE);
+    memset(head, 0, sizeof(uint16_t) * BUCKET_SIZE);
+  }
+  memset(tiny_hash, 0, sizeof(uint8_t) * 65536);
+  memset(self->free_slot_idx, 0, sizeof(self->free_slot_idx));
+}
+
+static BROTLI_INLINE void FN(HashMemAllocInBytes)(
+    const BrotliEncoderParams* params, BROTLI_BOOL one_shot,
+    size_t input_size, size_t* alloc_size) {
+  BROTLI_UNUSED(params);
+  BROTLI_UNUSED(one_shot);
+  BROTLI_UNUSED(input_size);
+  alloc_size[0] = sizeof(uint32_t) * BUCKET_SIZE +
+                  sizeof(uint16_t) * BUCKET_SIZE + sizeof(uint8_t) * 65536;
+  alloc_size[1] = sizeof(FN(Bank)) * NUM_BANKS;
+}
+
+/* Look at 4 bytes at &data[ix & mask]. Compute a hash from these, and prepend
+   node to corresponding chain; also update tiny_hash for current position. */
+static BROTLI_INLINE void FN(Store)(HashForgetfulChain* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) {
+  uint32_t* BROTLI_RESTRICT addr = FN(Addr)(self->extra[0]);
+  uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra[0]);
+  uint8_t* BROTLI_RESTRICT tiny_hash = FN(TinyHash)(self->extra[0]);
+  FN(Bank)* BROTLI_RESTRICT banks = FN(Banks)(self->extra[1]);
+  const size_t key = FN(HashBytes)(&data[ix & mask]);
+  const size_t bank = key & (NUM_BANKS - 1);
+  const size_t idx = self->free_slot_idx[bank]++ & (BANK_SIZE - 1);
+  size_t delta = ix - addr[key];
+  tiny_hash[(uint16_t)ix] = (uint8_t)key;
+  if (delta > 0xFFFF) delta = CAPPED_CHAINS ? 0 : 0xFFFF;
+  banks[bank].slots[idx].delta = (uint16_t)delta;
+  banks[bank].slots[idx].next = head[key];
+  addr[key] = (uint32_t)ix;
+  head[key] = (uint16_t)idx;
+}
+
+static BROTLI_INLINE void FN(StoreRange)(
+    HashForgetfulChain* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask,
+    const size_t ix_start, const size_t ix_end) {
+  size_t i;
+  for (i = ix_start; i < ix_end; ++i) {
+    FN(Store)(self, data, mask, i);
+  }
+}
+
+static BROTLI_INLINE void FN(StitchToPreviousBlock)(
+    HashForgetfulChain* BROTLI_RESTRICT self,
+    size_t num_bytes, size_t position, const uint8_t* ringbuffer,
+    size_t ring_buffer_mask) {
+  if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {
+    /* Prepare the hashes for three last bytes of the last write.
+       These could not be calculated before, since they require knowledge
+       of both the previous and the current block. */
+    FN(Store)(self, ringbuffer, ring_buffer_mask, position - 3);
+    FN(Store)(self, ringbuffer, ring_buffer_mask, position - 2);
+    FN(Store)(self, ringbuffer, ring_buffer_mask, position - 1);
+  }
+}
+
+static BROTLI_INLINE void FN(PrepareDistanceCache)(
+    HashForgetfulChain* BROTLI_RESTRICT self,
+    int* BROTLI_RESTRICT distance_cache) {
+  BROTLI_UNUSED(self);
+  PrepareDistanceCache(distance_cache, NUM_LAST_DISTANCES_TO_CHECK);
+}
+
+/* Find a longest backward match of &data[cur_ix] up to the length of
+   max_length and stores the position cur_ix in the hash table.
+
+   REQUIRES: FN(PrepareDistanceCache) must be invoked for current distance cache
+             values; if this method is invoked repeatedly with the same distance
+             cache values, it is enough to invoke FN(PrepareDistanceCache) once.
+
+   Does not look for matches longer than max_length.
+   Does not look for matches further away than max_backward.
+   Writes the best match into |out|.
+   |out|->score is updated only if a better match is found. */
+static BROTLI_INLINE void FN(FindLongestMatch)(
+    HashForgetfulChain* BROTLI_RESTRICT self,
+    const BrotliEncoderDictionary* dictionary,
+    const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,
+    const int* BROTLI_RESTRICT distance_cache,
+    const size_t cur_ix, const size_t max_length, const size_t max_backward,
+    const size_t dictionary_distance, const size_t max_distance,
+    HasherSearchResult* BROTLI_RESTRICT out) {
+  uint32_t* BROTLI_RESTRICT addr = FN(Addr)(self->extra[0]);
+  uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra[0]);
+  uint8_t* BROTLI_RESTRICT tiny_hashes = FN(TinyHash)(self->extra[0]);
+  FN(Bank)* BROTLI_RESTRICT banks = FN(Banks)(self->extra[1]);
+  const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
+  /* Don't accept a short copy from far away. */
+  score_t min_score = out->score;
+  score_t best_score = out->score;
+  size_t best_len = out->len;
+  size_t i;
+  const size_t key = FN(HashBytes)(&data[cur_ix_masked]);
+  const uint8_t tiny_hash = (uint8_t)(key);
+  out->len = 0;
+  out->len_code_delta = 0;
+  /* Try last distance first. */
+  for (i = 0; i < NUM_LAST_DISTANCES_TO_CHECK; ++i) {
+    const size_t backward = (size_t)distance_cache[i];
+    size_t prev_ix = (cur_ix - backward);
+    /* For distance code 0 we want to consider 2-byte matches. */
+    if (i > 0 && tiny_hashes[(uint16_t)prev_ix] != tiny_hash) continue;
+    if (prev_ix >= cur_ix || backward > max_backward) {
+      continue;
+    }
+    prev_ix &= ring_buffer_mask;
+    {
+      const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
+                                                  &data[cur_ix_masked],
+                                                  max_length);
+      if (len >= 2) {
+        score_t score = BackwardReferenceScoreUsingLastDistance(len);
+        if (best_score < score) {
+          if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);
+          if (best_score < score) {
+            best_score = score;
+            best_len = len;
+            out->len = best_len;
+            out->distance = backward;
+            out->score = best_score;
+          }
+        }
+      }
+    }
+  }
+  /* we require matches of len >4, so increase best_len to 3, so we can compare
+   * 4 bytes all the time. */
+  if (best_len < 3) {
+    best_len = 3;
+  }
+  {
+    const size_t bank = key & (NUM_BANKS - 1);
+    size_t backward = 0;
+    size_t hops = self->max_hops;
+    size_t delta = cur_ix - addr[key];
+    size_t slot = head[key];
+    while (hops--) {
+      size_t prev_ix;
+      size_t last = slot;
+      backward += delta;
+      if (backward > max_backward || (CAPPED_CHAINS && !delta)) break;
+      prev_ix = (cur_ix - backward) & ring_buffer_mask;
+      slot = banks[bank].slots[last].next;
+      delta = banks[bank].slots[last].delta;
+      if (cur_ix_masked + best_len > ring_buffer_mask ||
+          prev_ix + best_len > ring_buffer_mask ||
+          /* compare 4 bytes ending at best_len + 1 */
+          BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=
+              BrotliUnalignedRead32(&data[prev_ix + best_len - 3])) {
+        continue;
+      }
+      {
+        const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
+                                                    &data[cur_ix_masked],
+                                                    max_length);
+        if (len >= 4) {
+          /* Comparing for >= 3 does not change the semantics, but just saves
+             for a few unnecessary binary logarithms in backward reference
+             score, since we are not interested in such short matches. */
+          score_t score = BackwardReferenceScore(len, backward);
+          if (best_score < score) {
+            best_score = score;
+            best_len = len;
+            out->len = best_len;
+            out->distance = backward;
+            out->score = best_score;
+          }
+        }
+      }
+    }
+    FN(Store)(self, data, ring_buffer_mask, cur_ix);
+  }
+  if (out->score == min_score) {
+    SearchInStaticDictionary(dictionary,
+        self->common, &data[cur_ix_masked], max_length, dictionary_distance,
+        max_distance, out, BROTLI_FALSE);
+  }
+}
+
+#undef BANK_SIZE
+#undef BUCKET_SIZE
+#undef CAPPED_CHAINS
+
+#undef HashForgetfulChain
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_longest_match64_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_longest_match64_inc.h
new file mode 100644
index 0000000000..8f825de6fd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_longest_match64_inc.h
@@ -0,0 +1,269 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2010 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN */
+
+/* A (forgetful) hash table to the data seen by the compressor, to
+   help create backward references to previous data.
+
+   This is a hash map of fixed size (bucket_size_) to a ring buffer of
+   fixed size (block_size_). The ring buffer contains the last block_size_
+   index positions of the given hash key in the compressed data. */
+
+#define HashLongestMatch HASHER()
+
+static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; }
+static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 8; }
+
+/* HashBytes is the function that chooses the bucket to place the address in. */
+static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data,
+                                          uint64_t hash_mul) {
+  const uint64_t h = BROTLI_UNALIGNED_LOAD64LE(data) * hash_mul;
+  /* The higher bits contain more mixture from the multiplication,
+     so we take our results from there. */
+  return (size_t)(h >> (64 - 15));
+}
+
+typedef struct HashLongestMatch {
+  /* Number of hash buckets. */
+  size_t bucket_size_;
+  /* Only block_size_ newest backward references are kept,
+     and the older are forgotten. */
+  size_t block_size_;
+  /* Hash multiplier tuned to match length. */
+  uint64_t hash_mul_;
+  /* Mask for accessing entries in a block (in a ring-buffer manner). */
+  uint32_t block_mask_;
+
+  int block_bits_;
+  int num_last_distances_to_check_;
+
+  /* Shortcuts. */
+  HasherCommon* common_;
+
+  /* --- Dynamic size members --- */
+
+  /* Number of entries in a particular bucket. */
+  uint16_t* num_;  /* uint16_t[bucket_size]; */
+
+  /* Buckets containing block_size_ of backward references. */
+  uint32_t* buckets_;  /* uint32_t[bucket_size * block_size]; */
+} HashLongestMatch;
+
+static void FN(Initialize)(
+    HasherCommon* common, HashLongestMatch* BROTLI_RESTRICT self,
+    const BrotliEncoderParams* params) {
+  self->common_ = common;
+
+  BROTLI_UNUSED(params);
+  self->hash_mul_ = kHashMul64 << (64 - 5 * 8);
+  BROTLI_DCHECK(common->params.bucket_bits == 15);
+  self->bucket_size_ = (size_t)1 << common->params.bucket_bits;
+  self->block_bits_ = common->params.block_bits;
+  self->block_size_ = (size_t)1 << common->params.block_bits;
+  self->block_mask_ = (uint32_t)(self->block_size_ - 1);
+  self->num_last_distances_to_check_ =
+      common->params.num_last_distances_to_check;
+  self->num_ = (uint16_t*)common->extra[0];
+  self->buckets_ = (uint32_t*)common->extra[1];
+}
+
+static void FN(Prepare)(
+    HashLongestMatch* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,
+    size_t input_size, const uint8_t* BROTLI_RESTRICT data) {
+  uint16_t* BROTLI_RESTRICT num = self->num_;
+  /* Partial preparation is 100 times slower (per socket). */
+  size_t partial_prepare_threshold = self->bucket_size_ >> 6;
+  if (one_shot && input_size <= partial_prepare_threshold) {
+    size_t i;
+    for (i = 0; i < input_size; ++i) {
+      const size_t key = FN(HashBytes)(&data[i], self->hash_mul_);
+      num[key] = 0;
+    }
+  } else {
+    memset(num, 0, self->bucket_size_ * sizeof(num[0]));
+  }
+}
+
+static BROTLI_INLINE void FN(HashMemAllocInBytes)(
+    const BrotliEncoderParams* params, BROTLI_BOOL one_shot,
+    size_t input_size, size_t* alloc_size) {
+  size_t bucket_size = (size_t)1 << params->hasher.bucket_bits;
+  size_t block_size = (size_t)1 << params->hasher.block_bits;
+  BROTLI_UNUSED(one_shot);
+  BROTLI_UNUSED(input_size);
+  alloc_size[0] = sizeof(uint16_t) * bucket_size;
+  alloc_size[1] = sizeof(uint32_t) * bucket_size * block_size;
+}
+
+/* Look at 4 bytes at &data[ix & mask].
+   Compute a hash from these, and store the value of ix at that position. */
+static BROTLI_INLINE void FN(Store)(
+    HashLongestMatch* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,
+    const size_t mask, const size_t ix) {
+  uint16_t* BROTLI_RESTRICT num = self->num_;
+  uint32_t* BROTLI_RESTRICT buckets = self->buckets_;
+  const size_t key = FN(HashBytes)(&data[ix & mask], self->hash_mul_);
+  const size_t minor_ix = num[key] & self->block_mask_;
+  const size_t offset = minor_ix + (key << self->block_bits_);
+  ++num[key];
+  buckets[offset] = (uint32_t)ix;
+}
+
+static BROTLI_INLINE void FN(StoreRange)(HashLongestMatch* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask,
+    const size_t ix_start, const size_t ix_end) {
+  size_t i;
+  for (i = ix_start; i < ix_end; ++i) {
+    FN(Store)(self, data, mask, i);
+  }
+}
+
+static BROTLI_INLINE void FN(StitchToPreviousBlock)(
+    HashLongestMatch* BROTLI_RESTRICT self,
+    size_t num_bytes, size_t position, const uint8_t* ringbuffer,
+    size_t ringbuffer_mask) {
+  if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {
+    /* Prepare the hashes for three last bytes of the last write.
+       These could not be calculated before, since they require knowledge
+       of both the previous and the current block. */
+    FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);
+    FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);
+    FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);
+  }
+}
+
+static BROTLI_INLINE void FN(PrepareDistanceCache)(
+    HashLongestMatch* BROTLI_RESTRICT self,
+    int* BROTLI_RESTRICT distance_cache) {
+  PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_);
+}
+
+/* Find a longest backward match of &data[cur_ix] up to the length of
+   max_length and stores the position cur_ix in the hash table.
+
+   REQUIRES: FN(PrepareDistanceCache) must be invoked for current distance cache
+             values; if this method is invoked repeatedly with the same distance
+             cache values, it is enough to invoke FN(PrepareDistanceCache) once.
+
+   Does not look for matches longer than max_length.
+   Does not look for matches further away than max_backward.
+   Writes the best match into |out|.
+   |out|->score is updated only if a better match is found. */
+static BROTLI_INLINE void FN(FindLongestMatch)(
+    HashLongestMatch* BROTLI_RESTRICT self,
+    const BrotliEncoderDictionary* dictionary,
+    const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,
+    const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,
+    const size_t max_length, const size_t max_backward,
+    const size_t dictionary_distance, const size_t max_distance,
+    HasherSearchResult* BROTLI_RESTRICT out) {
+  uint16_t* BROTLI_RESTRICT num = self->num_;
+  uint32_t* BROTLI_RESTRICT buckets = self->buckets_;
+  const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
+  /* Don't accept a short copy from far away. */
+  score_t min_score = out->score;
+  score_t best_score = out->score;
+  size_t best_len = out->len;
+  size_t i;
+  out->len = 0;
+  out->len_code_delta = 0;
+  /* Try last distance first. */
+  for (i = 0; i < (size_t)self->num_last_distances_to_check_; ++i) {
+    const size_t backward = (size_t)distance_cache[i];
+    size_t prev_ix = (size_t)(cur_ix - backward);
+    if (prev_ix >= cur_ix) {
+      continue;
+    }
+    if (BROTLI_PREDICT_FALSE(backward > max_backward)) {
+      continue;
+    }
+    prev_ix &= ring_buffer_mask;
+
+    if (cur_ix_masked + best_len > ring_buffer_mask ||
+        prev_ix + best_len > ring_buffer_mask ||
+        data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {
+      continue;
+    }
+    {
+      const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
+                                                  &data[cur_ix_masked],
+                                                  max_length);
+      if (len >= 3 || (len == 2 && i < 2)) {
+        /* Comparing for >= 2 does not change the semantics, but just saves for
+           a few unnecessary binary logarithms in backward reference score,
+           since we are not interested in such short matches. */
+        score_t score = BackwardReferenceScoreUsingLastDistance(len);
+        if (best_score < score) {
+          if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);
+          if (best_score < score) {
+            best_score = score;
+            best_len = len;
+            out->len = best_len;
+            out->distance = backward;
+            out->score = best_score;
+          }
+        }
+      }
+    }
+  }
+  /* we require matches of len >4, so increase best_len to 3, so we can compare
+   * 4 bytes all the time. */
+  if (best_len < 3) {
+    best_len = 3;
+  }
+  {
+    const size_t key = FN(HashBytes)(&data[cur_ix_masked], self->hash_mul_);
+    uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_];
+    const size_t down =
+        (num[key] > self->block_size_) ?
+        (num[key] - self->block_size_) : 0u;
+    const uint32_t first4 = BrotliUnalignedRead32(data + cur_ix_masked);
+    const size_t max_length_m4 = max_length - 4;
+    i = num[key];
+    for (; i > down;) {
+      size_t prev_ix = bucket[--i & self->block_mask_];
+      uint32_t current4;
+      const size_t backward = cur_ix - prev_ix;
+      if (BROTLI_PREDICT_FALSE(backward > max_backward)) {
+        break;
+      }
+      prev_ix &= ring_buffer_mask;
+      if (cur_ix_masked + best_len > ring_buffer_mask ||
+          prev_ix + best_len > ring_buffer_mask ||
+          /* compare 4 bytes ending at best_len + 1 */
+          BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=
+              BrotliUnalignedRead32(&data[prev_ix + best_len - 3])) {
+        continue;
+      }
+      current4 = BrotliUnalignedRead32(data + prev_ix);
+      if (first4 != current4) continue;
+      {
+        const size_t len = FindMatchLengthWithLimit(&data[prev_ix + 4],
+                                                    &data[cur_ix_masked + 4],
+                                                    max_length_m4) + 4;
+        const score_t score = BackwardReferenceScore(len, backward);
+        if (best_score < score) {
+          best_score = score;
+          best_len = len;
+          out->len = best_len;
+          out->distance = backward;
+          out->score = best_score;
+        }
+      }
+    }
+    bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix;
+    ++num[key];
+  }
+  if (min_score == out->score) {
+    SearchInStaticDictionary(dictionary,
+        self->common_, &data[cur_ix_masked], max_length, dictionary_distance,
+        max_distance, out, BROTLI_FALSE);
+  }
+}
+
+#undef HashLongestMatch
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_longest_match_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_longest_match_inc.h
new file mode 100644
index 0000000000..c25cdb0b98
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_longest_match_inc.h
@@ -0,0 +1,267 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2010 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN */
+
+/* A (forgetful) hash table to the data seen by the compressor, to
+   help create backward references to previous data.
+
+   This is a hash map of fixed size (bucket_size_) to a ring buffer of
+   fixed size (block_size_). The ring buffer contains the last block_size_
+   index positions of the given hash key in the compressed data. */
+
+#define HashLongestMatch HASHER()
+
+static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }
+static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; }
+
+/* HashBytes is the function that chooses the bucket to place the address in. */
+static uint32_t FN(HashBytes)(
+    const uint8_t* BROTLI_RESTRICT data, const int shift) {
+  uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;
+  /* The higher bits contain more mixture from the multiplication,
+     so we take our results from there. */
+  return (uint32_t)(h >> shift);
+}
+
+typedef struct HashLongestMatch {
+  /* Number of hash buckets. */
+  size_t bucket_size_;
+  /* Only block_size_ newest backward references are kept,
+     and the older are forgotten. */
+  size_t block_size_;
+  /* Left-shift for computing hash bucket index from hash value. */
+  int hash_shift_;
+  /* Mask for accessing entries in a block (in a ring-buffer manner). */
+  uint32_t block_mask_;
+
+  int block_bits_;
+  int num_last_distances_to_check_;
+
+  /* Shortcuts. */
+  HasherCommon* common_;
+
+  /* --- Dynamic size members --- */
+
+  /* Number of entries in a particular bucket. */
+  uint16_t* num_;  /* uint16_t[bucket_size]; */
+
+  /* Buckets containing block_size_ of backward references. */
+  uint32_t* buckets_;  /* uint32_t[bucket_size * block_size]; */
+} HashLongestMatch;
+
+static void FN(Initialize)(
+    HasherCommon* common, HashLongestMatch* BROTLI_RESTRICT self,
+    const BrotliEncoderParams* params) {
+  self->common_ = common;
+
+  BROTLI_UNUSED(params);
+  self->hash_shift_ = 32 - common->params.bucket_bits;
+  self->bucket_size_ = (size_t)1 << common->params.bucket_bits;
+  self->block_size_ = (size_t)1 << common->params.block_bits;
+  self->block_mask_ = (uint32_t)(self->block_size_ - 1);
+  self->num_ = (uint16_t*)common->extra[0];
+  self->buckets_ = (uint32_t*)common->extra[1];
+  self->block_bits_ = common->params.block_bits;
+  self->num_last_distances_to_check_ =
+      common->params.num_last_distances_to_check;
+}
+
+static void FN(Prepare)(
+    HashLongestMatch* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,
+    size_t input_size, const uint8_t* BROTLI_RESTRICT data) {
+  uint16_t* BROTLI_RESTRICT num = self->num_;
+  /* Partial preparation is 100 times slower (per socket). */
+  size_t partial_prepare_threshold = self->bucket_size_ >> 6;
+  if (one_shot && input_size <= partial_prepare_threshold) {
+    size_t i;
+    for (i = 0; i < input_size; ++i) {
+      const uint32_t key = FN(HashBytes)(&data[i], self->hash_shift_);
+      num[key] = 0;
+    }
+  } else {
+    memset(num, 0, self->bucket_size_ * sizeof(num[0]));
+  }
+}
+
+static BROTLI_INLINE void FN(HashMemAllocInBytes)(
+    const BrotliEncoderParams* params, BROTLI_BOOL one_shot,
+    size_t input_size, size_t* alloc_size) {
+  size_t bucket_size = (size_t)1 << params->hasher.bucket_bits;
+  size_t block_size = (size_t)1 << params->hasher.block_bits;
+  BROTLI_UNUSED(one_shot);
+  BROTLI_UNUSED(input_size);
+  alloc_size[0] = sizeof(uint16_t) * bucket_size;
+  alloc_size[1] = sizeof(uint32_t) * bucket_size * block_size;
+}
+
+/* Look at 4 bytes at &data[ix & mask].
+   Compute a hash from these, and store the value of ix at that position. */
+static BROTLI_INLINE void FN(Store)(
+    HashLongestMatch* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,
+    const size_t mask, const size_t ix) {
+  uint16_t* BROTLI_RESTRICT num = self->num_;
+  uint32_t* BROTLI_RESTRICT buckets = self->buckets_;
+  const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_shift_);
+  const size_t minor_ix = num[key] & self->block_mask_;
+  const size_t offset = minor_ix + (key << self->block_bits_);
+  ++num[key];
+  buckets[offset] = (uint32_t)ix;
+}
+
+static BROTLI_INLINE void FN(StoreRange)(HashLongestMatch* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask,
+    const size_t ix_start, const size_t ix_end) {
+  size_t i;
+  for (i = ix_start; i < ix_end; ++i) {
+    FN(Store)(self, data, mask, i);
+  }
+}
+
+static BROTLI_INLINE void FN(StitchToPreviousBlock)(
+    HashLongestMatch* BROTLI_RESTRICT self,
+    size_t num_bytes, size_t position, const uint8_t* ringbuffer,
+    size_t ringbuffer_mask) {
+  if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {
+    /* Prepare the hashes for three last bytes of the last write.
+       These could not be calculated before, since they require knowledge
+       of both the previous and the current block. */
+    FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);
+    FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);
+    FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);
+  }
+}
+
+static BROTLI_INLINE void FN(PrepareDistanceCache)(
+    HashLongestMatch* BROTLI_RESTRICT self,
+    int* BROTLI_RESTRICT distance_cache) {
+  PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_);
+}
+
+/* Find a longest backward match of &data[cur_ix] up to the length of
+   max_length and stores the position cur_ix in the hash table.
+
+   REQUIRES: FN(PrepareDistanceCache) must be invoked for current distance cache
+             values; if this method is invoked repeatedly with the same distance
+             cache values, it is enough to invoke FN(PrepareDistanceCache) once.
+
+   Does not look for matches longer than max_length.
+   Does not look for matches further away than max_backward.
+   Writes the best match into |out|.
+   |out|->score is updated only if a better match is found. */
+static BROTLI_INLINE void FN(FindLongestMatch)(
+    HashLongestMatch* BROTLI_RESTRICT self,
+    const BrotliEncoderDictionary* dictionary,
+    const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,
+    const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,
+    const size_t max_length, const size_t max_backward,
+    const size_t dictionary_distance, const size_t max_distance,
+    HasherSearchResult* BROTLI_RESTRICT out) {
+  uint16_t* BROTLI_RESTRICT num = self->num_;
+  uint32_t* BROTLI_RESTRICT buckets = self->buckets_;
+  const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
+  /* Don't accept a short copy from far away. */
+  score_t min_score = out->score;
+  score_t best_score = out->score;
+  size_t best_len = out->len;
+  size_t i;
+  out->len = 0;
+  out->len_code_delta = 0;
+  /* Try last distance first. */
+  for (i = 0; i < (size_t)self->num_last_distances_to_check_; ++i) {
+    const size_t backward = (size_t)distance_cache[i];
+    size_t prev_ix = (size_t)(cur_ix - backward);
+    if (prev_ix >= cur_ix) {
+      continue;
+    }
+    if (BROTLI_PREDICT_FALSE(backward > max_backward)) {
+      continue;
+    }
+    prev_ix &= ring_buffer_mask;
+
+    if (cur_ix_masked + best_len > ring_buffer_mask ||
+        prev_ix + best_len > ring_buffer_mask ||
+        data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {
+      continue;
+    }
+    {
+      const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
+                                                  &data[cur_ix_masked],
+                                                  max_length);
+      if (len >= 3 || (len == 2 && i < 2)) {
+        /* Comparing for >= 2 does not change the semantics, but just saves for
+           a few unnecessary binary logarithms in backward reference score,
+           since we are not interested in such short matches. */
+        score_t score = BackwardReferenceScoreUsingLastDistance(len);
+        if (best_score < score) {
+          if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);
+          if (best_score < score) {
+            best_score = score;
+            best_len = len;
+            out->len = best_len;
+            out->distance = backward;
+            out->score = best_score;
+          }
+        }
+      }
+    }
+  }
+  /* we require matches of len >4, so increase best_len to 3, so we can compare
+   * 4 bytes all the time. */
+  if (best_len < 3) {
+    best_len = 3;
+  }
+  {
+    const uint32_t key =
+        FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_);
+    uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_];
+    const size_t down =
+        (num[key] > self->block_size_) ? (num[key] - self->block_size_) : 0u;
+    for (i = num[key]; i > down;) {
+      size_t prev_ix = bucket[--i & self->block_mask_];
+      const size_t backward = cur_ix - prev_ix;
+      if (BROTLI_PREDICT_FALSE(backward > max_backward)) {
+        break;
+      }
+      prev_ix &= ring_buffer_mask;
+      if (cur_ix_masked + best_len > ring_buffer_mask ||
+          prev_ix + best_len > ring_buffer_mask ||
+          /* compare 4 bytes ending at best_len + 1 */
+          BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=
+              BrotliUnalignedRead32(&data[prev_ix + best_len - 3])) {
+        continue;
+      }
+      {
+        const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
+                                                    &data[cur_ix_masked],
+                                                    max_length);
+        if (len >= 4) {
+          /* Comparing for >= 3 does not change the semantics, but just saves
+             for a few unnecessary binary logarithms in backward reference
+             score, since we are not interested in such short matches. */
+          score_t score = BackwardReferenceScore(len, backward);
+          if (best_score < score) {
+            best_score = score;
+            best_len = len;
+            out->len = best_len;
+            out->distance = backward;
+            out->score = best_score;
+          }
+        }
+      }
+    }
+    bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix;
+    ++num[key];
+  }
+  if (min_score == out->score) {
+    SearchInStaticDictionary(dictionary,
+        self->common_, &data[cur_ix_masked], max_length, dictionary_distance,
+        max_distance, out, BROTLI_FALSE);
+  }
+}
+
+#undef HashLongestMatch
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_longest_match_quickly_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_longest_match_quickly_inc.h
new file mode 100644
index 0000000000..1f36022844
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_longest_match_quickly_inc.h
@@ -0,0 +1,267 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2010 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN, BUCKET_BITS, BUCKET_SWEEP_BITS, HASH_LEN,
+                        USE_DICTIONARY
+ */
+
+#define HashLongestMatchQuickly HASHER()
+
+#define BUCKET_SIZE (1 << BUCKET_BITS)
+#define BUCKET_MASK (BUCKET_SIZE - 1)
+#define BUCKET_SWEEP (1 << BUCKET_SWEEP_BITS)
+#define BUCKET_SWEEP_MASK ((BUCKET_SWEEP - 1) << 3)
+
+static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; }
+static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 8; }
+
+/* HashBytes is the function that chooses the bucket to place
+   the address in. The HashLongestMatch and HashLongestMatchQuickly
+   classes have separate, different implementations of hashing. */
+static uint32_t FN(HashBytes)(const uint8_t* data) {
+  const uint64_t h = ((BROTLI_UNALIGNED_LOAD64LE(data) << (64 - 8 * HASH_LEN)) *
+                      kHashMul64);
+  /* The higher bits contain more mixture from the multiplication,
+     so we take our results from there. */
+  return (uint32_t)(h >> (64 - BUCKET_BITS));
+}
+
+/* A (forgetful) hash table to the data seen by the compressor, to
+   help create backward references to previous data.
+
+   This is a hash map of fixed size (BUCKET_SIZE). */
+typedef struct HashLongestMatchQuickly {
+  /* Shortcuts. */
+  HasherCommon* common;
+
+  /* --- Dynamic size members --- */
+
+  uint32_t* buckets_;  /* uint32_t[BUCKET_SIZE]; */
+} HashLongestMatchQuickly;
+
+static void FN(Initialize)(
+    HasherCommon* common, HashLongestMatchQuickly* BROTLI_RESTRICT self,
+    const BrotliEncoderParams* params) {
+  self->common = common;
+
+  BROTLI_UNUSED(params);
+  self->buckets_ = (uint32_t*)common->extra[0];
+}
+
+static void FN(Prepare)(
+    HashLongestMatchQuickly* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,
+    size_t input_size, const uint8_t* BROTLI_RESTRICT data) {
+  uint32_t* BROTLI_RESTRICT buckets = self->buckets_;
+  /* Partial preparation is 100 times slower (per socket). */
+  size_t partial_prepare_threshold = BUCKET_SIZE >> 5;
+  if (one_shot && input_size <= partial_prepare_threshold) {
+    size_t i;
+    for (i = 0; i < input_size; ++i) {
+      const uint32_t key = FN(HashBytes)(&data[i]);
+      if (BUCKET_SWEEP == 1) {
+        buckets[key] = 0;
+      } else {
+        uint32_t j;
+        for (j = 0; j < BUCKET_SWEEP; ++j) {
+          buckets[(key + (j << 3)) & BUCKET_MASK] = 0;
+        }
+      }
+    }
+  } else {
+    /* It is not strictly necessary to fill this buffer here, but
+       not filling will make the results of the compression stochastic
+       (but correct). This is because random data would cause the
+       system to find accidentally good backward references here and there. */
+    memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE);
+  }
+}
+
+static BROTLI_INLINE void FN(HashMemAllocInBytes)(
+    const BrotliEncoderParams* params, BROTLI_BOOL one_shot,
+    size_t input_size, size_t* alloc_size) {
+  BROTLI_UNUSED(params);
+  BROTLI_UNUSED(one_shot);
+  BROTLI_UNUSED(input_size);
+  alloc_size[0] = sizeof(uint32_t) * BUCKET_SIZE;
+}
+
+/* Look at 5 bytes at &data[ix & mask].
+   Compute a hash from these, and store the value somewhere within
+   [ix .. ix+3]. */
+static BROTLI_INLINE void FN(Store)(
+    HashLongestMatchQuickly* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) {
+  const uint32_t key = FN(HashBytes)(&data[ix & mask]);
+  if (BUCKET_SWEEP == 1) {
+    self->buckets_[key] = (uint32_t)ix;
+  } else {
+    /* Wiggle the value with the bucket sweep range. */
+    const uint32_t off = ix & BUCKET_SWEEP_MASK;
+    self->buckets_[(key + off) & BUCKET_MASK] = (uint32_t)ix;
+  }
+}
+
+static BROTLI_INLINE void FN(StoreRange)(
+    HashLongestMatchQuickly* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask,
+    const size_t ix_start, const size_t ix_end) {
+  size_t i;
+  for (i = ix_start; i < ix_end; ++i) {
+    FN(Store)(self, data, mask, i);
+  }
+}
+
+static BROTLI_INLINE void FN(StitchToPreviousBlock)(
+    HashLongestMatchQuickly* BROTLI_RESTRICT self,
+    size_t num_bytes, size_t position,
+    const uint8_t* ringbuffer, size_t ringbuffer_mask) {
+  if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {
+    /* Prepare the hashes for three last bytes of the last write.
+       These could not be calculated before, since they require knowledge
+       of both the previous and the current block. */
+    FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);
+    FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);
+    FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);
+  }
+}
+
+static BROTLI_INLINE void FN(PrepareDistanceCache)(
+    HashLongestMatchQuickly* BROTLI_RESTRICT self,
+    int* BROTLI_RESTRICT distance_cache) {
+  BROTLI_UNUSED(self);
+  BROTLI_UNUSED(distance_cache);
+}
+
+/* Find a longest backward match of &data[cur_ix & ring_buffer_mask]
+   up to the length of max_length and stores the position cur_ix in the
+   hash table.
+
+   Does not look for matches longer than max_length.
+   Does not look for matches further away than max_backward.
+   Writes the best match into |out|.
+   |out|->score is updated only if a better match is found. */
+static BROTLI_INLINE void FN(FindLongestMatch)(
+    HashLongestMatchQuickly* BROTLI_RESTRICT self,
+    const BrotliEncoderDictionary* dictionary,
+    const uint8_t* BROTLI_RESTRICT data,
+    const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache,
+    const size_t cur_ix, const size_t max_length, const size_t max_backward,
+    const size_t dictionary_distance, const size_t max_distance,
+    HasherSearchResult* BROTLI_RESTRICT out) {
+  uint32_t* BROTLI_RESTRICT buckets = self->buckets_;
+  const size_t best_len_in = out->len;
+  const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
+  /* TODO: compare 4 bytes at once (and set the minimum best len to 4) */
+  int compare_char = data[cur_ix_masked + best_len_in];
+  size_t key = FN(HashBytes)(&data[cur_ix_masked]);
+  size_t key_out;
+  score_t min_score = out->score;
+  score_t best_score = out->score;
+  size_t best_len = best_len_in;
+  size_t cached_backward = (size_t)distance_cache[0];
+  size_t prev_ix = cur_ix - cached_backward;
+  out->len_code_delta = 0;
+  if (prev_ix < cur_ix) {
+    prev_ix &= (uint32_t)ring_buffer_mask;
+    if (compare_char == data[prev_ix + best_len]) {
+      const size_t len = FindMatchLengthWithLimit(
+          &data[prev_ix], &data[cur_ix_masked], max_length);
+      if (len >= 4) {
+        const score_t score = BackwardReferenceScoreUsingLastDistance(len);
+        if (best_score < score) {
+          out->len = len;
+          out->distance = cached_backward;
+          out->score = score;
+          if (BUCKET_SWEEP == 1) {
+            buckets[key] = (uint32_t)cur_ix;
+            return;
+          } else {
+            best_len = len;
+            best_score = score;
+            compare_char = data[cur_ix_masked + len];
+          }
+        }
+      }
+    }
+  }
+  if (BUCKET_SWEEP == 1) {
+    size_t backward;
+    size_t len;
+    /* Only one to look for, don't bother to prepare for a loop. */
+    prev_ix = buckets[key];
+    buckets[key] = (uint32_t)cur_ix;
+    backward = cur_ix - prev_ix;
+    prev_ix &= (uint32_t)ring_buffer_mask;
+    if (compare_char != data[prev_ix + best_len_in]) {
+      return;
+    }
+    if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) {
+      return;
+    }
+    len = FindMatchLengthWithLimit(&data[prev_ix],
+                                   &data[cur_ix_masked],
+                                   max_length);
+    if (len >= 4) {
+      const score_t score = BackwardReferenceScore(len, backward);
+      if (best_score < score) {
+        out->len = len;
+        out->distance = backward;
+        out->score = score;
+        return;
+      }
+    }
+  } else {
+    size_t keys[BUCKET_SWEEP];
+    size_t i;
+    for (i = 0; i < BUCKET_SWEEP; ++i) {
+      keys[i] = (key + (i << 3)) & BUCKET_MASK;
+    }
+    key_out = keys[(cur_ix & BUCKET_SWEEP_MASK) >> 3];
+    for (i = 0; i < BUCKET_SWEEP; ++i) {
+      size_t len;
+      size_t backward;
+      prev_ix = buckets[keys[i]];
+      backward = cur_ix - prev_ix;
+      prev_ix &= (uint32_t)ring_buffer_mask;
+      if (compare_char != data[prev_ix + best_len]) {
+        continue;
+      }
+      if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) {
+        continue;
+      }
+      len = FindMatchLengthWithLimit(&data[prev_ix],
+                                     &data[cur_ix_masked],
+                                     max_length);
+      if (len >= 4) {
+        const score_t score = BackwardReferenceScore(len, backward);
+        if (best_score < score) {
+          best_len = len;
+          out->len = len;
+          compare_char = data[cur_ix_masked + len];
+          best_score = score;
+          out->score = score;
+          out->distance = backward;
+        }
+      }
+    }
+  }
+  if (USE_DICTIONARY && min_score == out->score) {
+    SearchInStaticDictionary(dictionary,
+        self->common, &data[cur_ix_masked], max_length, dictionary_distance,
+        max_distance, out, BROTLI_TRUE);
+  }
+  if (BUCKET_SWEEP != 1) {
+    buckets[key_out] = (uint32_t)cur_ix;
+  }
+}
+
+#undef BUCKET_SWEEP_MASK
+#undef BUCKET_SWEEP
+#undef BUCKET_MASK
+#undef BUCKET_SIZE
+
+#undef HashLongestMatchQuickly
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_rolling_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_rolling_inc.h
new file mode 100644
index 0000000000..4c7a6b199a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_rolling_inc.h
@@ -0,0 +1,212 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2018 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN, JUMP, NUMBUCKETS, MASK, CHUNKLEN */
+/* NUMBUCKETS / (MASK + 1) = probability of storing and using hash code. */
+/* JUMP = skip bytes for speedup */
+
+/* Rolling hash for long distance long string matches. Stores one position
+   per bucket, bucket key is computed over a long region. */
+
+#define HashRolling HASHER()
+
+static const uint32_t FN(kRollingHashMul32) = 69069;
+static const uint32_t FN(kInvalidPos) = 0xffffffff;
+
+/* This hasher uses a longer forward length, but returning a higher value here
+   will hurt compression by the main hasher when combined with a composite
+   hasher. The hasher tests for forward itself instead. */
+static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }
+static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; }
+
+/* Computes a code from a single byte. A lookup table of 256 values could be
+   used, but simply adding 1 works about as good. */
+static uint32_t FN(HashByte)(uint8_t byte) {
+  return (uint32_t)byte + 1u;
+}
+
+static uint32_t FN(HashRollingFunctionInitial)(uint32_t state, uint8_t add,
+                                               uint32_t factor) {
+  return (uint32_t)(factor * state + FN(HashByte)(add));
+}
+
+static uint32_t FN(HashRollingFunction)(uint32_t state, uint8_t add,
+                                        uint8_t rem, uint32_t factor,
+                                        uint32_t factor_remove) {
+  return (uint32_t)(factor * state +
+      FN(HashByte)(add) - factor_remove * FN(HashByte)(rem));
+}
+
+typedef struct HashRolling {
+  uint32_t state;
+  uint32_t* table;
+  size_t next_ix;
+
+  uint32_t chunk_len;
+  uint32_t factor;
+  uint32_t factor_remove;
+} HashRolling;
+
+static void FN(Initialize)(
+    HasherCommon* common, HashRolling* BROTLI_RESTRICT self,
+    const BrotliEncoderParams* params) {
+  size_t i;
+  self->state = 0;
+  self->next_ix = 0;
+
+  self->factor = FN(kRollingHashMul32);
+
+  /* Compute the factor of the oldest byte to remove: factor**steps modulo
+     0xffffffff (the multiplications rely on 32-bit overflow) */
+  self->factor_remove = 1;
+  for (i = 0; i < CHUNKLEN; i += JUMP) {
+    self->factor_remove *= self->factor;
+  }
+
+  self->table = (uint32_t*)common->extra[0];
+  for (i = 0; i < NUMBUCKETS; i++) {
+    self->table[i] = FN(kInvalidPos);
+  }
+
+  BROTLI_UNUSED(params);
+}
+
+static void FN(Prepare)(HashRolling* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,
+    size_t input_size, const uint8_t* BROTLI_RESTRICT data) {
+  size_t i;
+  /* Too small size, cannot use this hasher. */
+  if (input_size < CHUNKLEN) return;
+  self->state = 0;
+  for (i = 0; i < CHUNKLEN; i += JUMP) {
+    self->state = FN(HashRollingFunctionInitial)(
+        self->state, data[i], self->factor);
+  }
+  BROTLI_UNUSED(one_shot);
+}
+
+static BROTLI_INLINE void FN(HashMemAllocInBytes)(
+    const BrotliEncoderParams* params, BROTLI_BOOL one_shot,
+    size_t input_size, size_t* alloc_size) {
+  BROTLI_UNUSED(params);
+  BROTLI_UNUSED(one_shot);
+  BROTLI_UNUSED(input_size);
+  alloc_size[0] = NUMBUCKETS * sizeof(uint32_t);
+}
+
+static BROTLI_INLINE void FN(Store)(HashRolling* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) {
+  BROTLI_UNUSED(self);
+  BROTLI_UNUSED(data);
+  BROTLI_UNUSED(mask);
+  BROTLI_UNUSED(ix);
+}
+
+static BROTLI_INLINE void FN(StoreRange)(HashRolling* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask,
+    const size_t ix_start, const size_t ix_end) {
+  BROTLI_UNUSED(self);
+  BROTLI_UNUSED(data);
+  BROTLI_UNUSED(mask);
+  BROTLI_UNUSED(ix_start);
+  BROTLI_UNUSED(ix_end);
+}
+
+static BROTLI_INLINE void FN(StitchToPreviousBlock)(
+    HashRolling* BROTLI_RESTRICT self,
+    size_t num_bytes, size_t position, const uint8_t* ringbuffer,
+    size_t ring_buffer_mask) {
+  /* In this case we must re-initialize the hasher from scratch from the
+     current position. */
+  size_t position_masked;
+  size_t available = num_bytes;
+  if ((position & (JUMP - 1)) != 0) {
+    size_t diff = JUMP - (position & (JUMP - 1));
+    available = (diff > available) ? 0 : (available - diff);
+    position += diff;
+  }
+  position_masked = position & ring_buffer_mask;
+  /* wrapping around ringbuffer not handled. */
+  if (available > ring_buffer_mask - position_masked) {
+    available = ring_buffer_mask - position_masked;
+  }
+
+  FN(Prepare)(self, BROTLI_FALSE, available,
+      ringbuffer + (position & ring_buffer_mask));
+  self->next_ix = position;
+  BROTLI_UNUSED(num_bytes);
+}
+
+static BROTLI_INLINE void FN(PrepareDistanceCache)(
+    HashRolling* BROTLI_RESTRICT self,
+    int* BROTLI_RESTRICT distance_cache) {
+  BROTLI_UNUSED(self);
+  BROTLI_UNUSED(distance_cache);
+}
+
+static BROTLI_INLINE void FN(FindLongestMatch)(
+    HashRolling* BROTLI_RESTRICT self,
+    const BrotliEncoderDictionary* dictionary,
+    const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,
+    const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,
+    const size_t max_length, const size_t max_backward,
+    const size_t dictionary_distance, const size_t max_distance,
+    HasherSearchResult* BROTLI_RESTRICT out) {
+  const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
+  size_t pos;
+
+  if ((cur_ix & (JUMP - 1)) != 0) return;
+
+  /* Not enough lookahead */
+  if (max_length < CHUNKLEN) return;
+
+  for (pos = self->next_ix; pos <= cur_ix; pos += JUMP) {
+    uint32_t code = self->state & MASK;
+
+    uint8_t rem = data[pos & ring_buffer_mask];
+    uint8_t add = data[(pos + CHUNKLEN) & ring_buffer_mask];
+    size_t found_ix = FN(kInvalidPos);
+
+    self->state = FN(HashRollingFunction)(
+        self->state, add, rem, self->factor, self->factor_remove);
+
+    if (code < NUMBUCKETS) {
+      found_ix = self->table[code];
+      self->table[code] = (uint32_t)pos;
+      if (pos == cur_ix && found_ix != FN(kInvalidPos)) {
+        /* The cast to 32-bit makes backward distances up to 4GB work even
+           if cur_ix is above 4GB, despite using 32-bit values in the table. */
+        size_t backward = (uint32_t)(cur_ix - found_ix);
+        if (backward <= max_backward) {
+          const size_t found_ix_masked = found_ix & ring_buffer_mask;
+          const size_t len = FindMatchLengthWithLimit(&data[found_ix_masked],
+                                                      &data[cur_ix_masked],
+                                                      max_length);
+          if (len >= 4 && len > out->len) {
+            score_t score = BackwardReferenceScore(len, backward);
+            if (score > out->score) {
+              out->len = len;
+              out->distance = backward;
+              out->score = score;
+              out->len_code_delta = 0;
+            }
+          }
+        }
+      }
+    }
+  }
+
+  self->next_ix = cur_ix + JUMP;
+
+  /* NOTE: this hasher does not search in the dictionary. It is used as
+     backup-hasher, the main hasher already searches in it. */
+  BROTLI_UNUSED(dictionary);
+  BROTLI_UNUSED(distance_cache);
+  BROTLI_UNUSED(dictionary_distance);
+  BROTLI_UNUSED(max_distance);
+}
+
+#undef HashRolling
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_to_binary_tree_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_to_binary_tree_inc.h
new file mode 100644
index 0000000000..a639d2d4b0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/hash_to_binary_tree_inc.h
@@ -0,0 +1,330 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN, BUCKET_BITS, MAX_TREE_COMP_LENGTH,
+                        MAX_TREE_SEARCH_DEPTH */
+
+/* A (forgetful) hash table where each hash bucket contains a binary tree of
+   sequences whose first 4 bytes share the same hash code.
+   Each sequence is MAX_TREE_COMP_LENGTH long and is identified by its starting
+   position in the input data. The binary tree is sorted by the lexicographic
+   order of the sequences, and it is also a max-heap with respect to the
+   starting positions. */
+
+#define HashToBinaryTree HASHER()
+
+#define BUCKET_SIZE (1 << BUCKET_BITS)
+
+static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }
+static BROTLI_INLINE size_t FN(StoreLookahead)(void) {
+  return MAX_TREE_COMP_LENGTH;
+}
+
+static uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) {
+  uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;
+  /* The higher bits contain more mixture from the multiplication,
+     so we take our results from there. */
+  return h >> (32 - BUCKET_BITS);
+}
+
+typedef struct HashToBinaryTree {
+  /* The window size minus 1 */
+  size_t window_mask_;
+
+  /* Hash table that maps the 4-byte hashes of the sequence to the last
+     position where this hash was found, which is the root of the binary
+     tree of sequences that share this hash bucket. */
+  uint32_t* buckets_;  /* uint32_t[BUCKET_SIZE]; */
+
+  /* A position used to mark a non-existent sequence, i.e. a tree is empty if
+     its root is at invalid_pos_ and a node is a leaf if both its children
+     are at invalid_pos_. */
+  uint32_t invalid_pos_;
+
+  /* --- Dynamic size members --- */
+
+  /* The union of the binary trees of each hash bucket. The root of the tree
+     corresponding to a hash is a sequence starting at buckets_[hash] and
+     the left and right children of a sequence starting at pos are
+     forest_[2 * pos] and forest_[2 * pos + 1]. */
+  uint32_t* forest_;  /* uint32_t[2 * num_nodes] */
+} HashToBinaryTree;
+
+static void FN(Initialize)(
+    HasherCommon* common, HashToBinaryTree* BROTLI_RESTRICT self,
+    const BrotliEncoderParams* params) {
+  self->buckets_ = (uint32_t*)common->extra[0];
+  self->forest_ = (uint32_t*)common->extra[1];
+
+  self->window_mask_ = (1u << params->lgwin) - 1u;
+  self->invalid_pos_ = (uint32_t)(0 - self->window_mask_);
+}
+
+static void FN(Prepare)
+    (HashToBinaryTree* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,
+    size_t input_size, const uint8_t* BROTLI_RESTRICT data) {
+  uint32_t invalid_pos = self->invalid_pos_;
+  uint32_t i;
+  uint32_t* BROTLI_RESTRICT buckets = self->buckets_;
+  BROTLI_UNUSED(data);
+  BROTLI_UNUSED(one_shot);
+  BROTLI_UNUSED(input_size);
+  for (i = 0; i < BUCKET_SIZE; i++) {
+    buckets[i] = invalid_pos;
+  }
+}
+
+static BROTLI_INLINE void FN(HashMemAllocInBytes)(
+    const BrotliEncoderParams* params, BROTLI_BOOL one_shot,
+    size_t input_size, size_t* alloc_size) {
+  size_t num_nodes = (size_t)1 << params->lgwin;
+  if (one_shot && input_size < num_nodes) {
+    num_nodes = input_size;
+  }
+  alloc_size[0] = sizeof(uint32_t) * BUCKET_SIZE;
+  alloc_size[1] = 2 * sizeof(uint32_t) * num_nodes;
+}
+
+static BROTLI_INLINE size_t FN(LeftChildIndex)(
+    HashToBinaryTree* BROTLI_RESTRICT self,
+    const size_t pos) {
+  return 2 * (pos & self->window_mask_);
+}
+
+static BROTLI_INLINE size_t FN(RightChildIndex)(
+    HashToBinaryTree* BROTLI_RESTRICT self,
+    const size_t pos) {
+  return 2 * (pos & self->window_mask_) + 1;
+}
+
+/* Stores the hash of the next 4 bytes and in a single tree-traversal, the
+   hash bucket's binary tree is searched for matches and is re-rooted at the
+   current position.
+
+   If less than MAX_TREE_COMP_LENGTH data is available, the hash bucket of the
+   current position is searched for matches, but the state of the hash table
+   is not changed, since we can not know the final sorting order of the
+   current (incomplete) sequence.
+
+   This function must be called with increasing cur_ix positions. */
+static BROTLI_INLINE BackwardMatch* FN(StoreAndFindMatches)(
+    HashToBinaryTree* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,
+    const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length,
+    const size_t max_backward, size_t* const BROTLI_RESTRICT best_len,
+    BackwardMatch* BROTLI_RESTRICT matches) {
+  const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
+  const size_t max_comp_len =
+      BROTLI_MIN(size_t, max_length, MAX_TREE_COMP_LENGTH);
+  const BROTLI_BOOL should_reroot_tree =
+      TO_BROTLI_BOOL(max_length >= MAX_TREE_COMP_LENGTH);
+  const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]);
+  uint32_t* BROTLI_RESTRICT buckets = self->buckets_;
+  uint32_t* BROTLI_RESTRICT forest = self->forest_;
+  size_t prev_ix = buckets[key];
+  /* The forest index of the rightmost node of the left subtree of the new
+     root, updated as we traverse and re-root the tree of the hash bucket. */
+  size_t node_left = FN(LeftChildIndex)(self, cur_ix);
+  /* The forest index of the leftmost node of the right subtree of the new
+     root, updated as we traverse and re-root the tree of the hash bucket. */
+  size_t node_right = FN(RightChildIndex)(self, cur_ix);
+  /* The match length of the rightmost node of the left subtree of the new
+     root, updated as we traverse and re-root the tree of the hash bucket. */
+  size_t best_len_left = 0;
+  /* The match length of the leftmost node of the right subtree of the new
+     root, updated as we traverse and re-root the tree of the hash bucket. */
+  size_t best_len_right = 0;
+  size_t depth_remaining;
+  if (should_reroot_tree) {
+    buckets[key] = (uint32_t)cur_ix;
+  }
+  for (depth_remaining = MAX_TREE_SEARCH_DEPTH; ; --depth_remaining) {
+    const size_t backward = cur_ix - prev_ix;
+    const size_t prev_ix_masked = prev_ix & ring_buffer_mask;
+    if (backward == 0 || backward > max_backward || depth_remaining == 0) {
+      if (should_reroot_tree) {
+        forest[node_left] = self->invalid_pos_;
+        forest[node_right] = self->invalid_pos_;
+      }
+      break;
+    }
+    {
+      const size_t cur_len = BROTLI_MIN(size_t, best_len_left, best_len_right);
+      size_t len;
+      BROTLI_DCHECK(cur_len <= MAX_TREE_COMP_LENGTH);
+      len = cur_len +
+          FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len],
+                                   &data[prev_ix_masked + cur_len],
+                                   max_length - cur_len);
+      BROTLI_DCHECK(
+          0 == memcmp(&data[cur_ix_masked], &data[prev_ix_masked], len));
+      if (matches && len > *best_len) {
+        *best_len = len;
+        InitBackwardMatch(matches++, backward, len);
+      }
+      if (len >= max_comp_len) {
+        if (should_reroot_tree) {
+          forest[node_left] = forest[FN(LeftChildIndex)(self, prev_ix)];
+          forest[node_right] = forest[FN(RightChildIndex)(self, prev_ix)];
+        }
+        break;
+      }
+      if (data[cur_ix_masked + len] > data[prev_ix_masked + len]) {
+        best_len_left = len;
+        if (should_reroot_tree) {
+          forest[node_left] = (uint32_t)prev_ix;
+        }
+        node_left = FN(RightChildIndex)(self, prev_ix);
+        prev_ix = forest[node_left];
+      } else {
+        best_len_right = len;
+        if (should_reroot_tree) {
+          forest[node_right] = (uint32_t)prev_ix;
+        }
+        node_right = FN(LeftChildIndex)(self, prev_ix);
+        prev_ix = forest[node_right];
+      }
+    }
+  }
+  return matches;
+}
+
+/* Finds all backward matches of &data[cur_ix & ring_buffer_mask] up to the
+   length of max_length and stores the position cur_ix in the hash table.
+
+   Sets *num_matches to the number of matches found, and stores the found
+   matches in matches[0] to matches[*num_matches - 1]. The matches will be
+   sorted by strictly increasing length and (non-strictly) increasing
+   distance. */
+static BROTLI_INLINE size_t FN(FindAllMatches)(
+    HashToBinaryTree* BROTLI_RESTRICT self,
+    const BrotliEncoderDictionary* dictionary,
+    const uint8_t* BROTLI_RESTRICT data,
+    const size_t ring_buffer_mask, const size_t cur_ix,
+    const size_t max_length, const size_t max_backward,
+    const size_t dictionary_distance, const BrotliEncoderParams* params,
+    BackwardMatch* matches) {
+  BackwardMatch* const orig_matches = matches;
+  const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
+  size_t best_len = 1;
+  const size_t short_match_max_backward =
+      params->quality != HQ_ZOPFLIFICATION_QUALITY ? 16 : 64;
+  size_t stop = cur_ix - short_match_max_backward;
+  uint32_t dict_matches[BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1];
+  size_t i;
+  if (cur_ix < short_match_max_backward) { stop = 0; }
+  for (i = cur_ix - 1; i > stop && best_len <= 2; --i) {
+    size_t prev_ix = i;
+    const size_t backward = cur_ix - prev_ix;
+    if (BROTLI_PREDICT_FALSE(backward > max_backward)) {
+      break;
+    }
+    prev_ix &= ring_buffer_mask;
+    if (data[cur_ix_masked] != data[prev_ix] ||
+        data[cur_ix_masked + 1] != data[prev_ix + 1]) {
+      continue;
+    }
+    {
+      const size_t len =
+          FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked],
+                                   max_length);
+      if (len > best_len) {
+        best_len = len;
+        InitBackwardMatch(matches++, backward, len);
+      }
+    }
+  }
+  if (best_len < max_length) {
+    matches = FN(StoreAndFindMatches)(self, data, cur_ix,
+        ring_buffer_mask, max_length, max_backward, &best_len, matches);
+  }
+  for (i = 0; i <= BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN; ++i) {
+    dict_matches[i] = kInvalidMatch;
+  }
+  {
+    size_t minlen = BROTLI_MAX(size_t, 4, best_len + 1);
+    if (BrotliFindAllStaticDictionaryMatches(dictionary,
+        &data[cur_ix_masked], minlen, max_length, &dict_matches[0])) {
+      size_t maxlen = BROTLI_MIN(
+          size_t, BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN, max_length);
+      size_t l;
+      for (l = minlen; l <= maxlen; ++l) {
+        uint32_t dict_id = dict_matches[l];
+        if (dict_id < kInvalidMatch) {
+          size_t distance = dictionary_distance + (dict_id >> 5) + 1;
+          if (distance <= params->dist.max_distance) {
+            InitDictionaryBackwardMatch(matches++, distance, l, dict_id & 31);
+          }
+        }
+      }
+    }
+  }
+  return (size_t)(matches - orig_matches);
+}
+
+/* Stores the hash of the next 4 bytes and re-roots the binary tree at the
+   current sequence, without returning any matches.
+   REQUIRES: ix + MAX_TREE_COMP_LENGTH <= end-of-current-block */
+static BROTLI_INLINE void FN(Store)(HashToBinaryTree* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data,
+    const size_t mask, const size_t ix) {
+  /* Maximum distance is window size - 16, see section 9.1. of the spec. */
+  const size_t max_backward = self->window_mask_ - BROTLI_WINDOW_GAP + 1;
+  FN(StoreAndFindMatches)(self, data, ix, mask, MAX_TREE_COMP_LENGTH,
+      max_backward, NULL, NULL);
+}
+
+static BROTLI_INLINE void FN(StoreRange)(HashToBinaryTree* BROTLI_RESTRICT self,
+    const uint8_t* BROTLI_RESTRICT data, const size_t mask,
+    const size_t ix_start, const size_t ix_end) {
+  size_t i = ix_start;
+  size_t j = ix_start;
+  if (ix_start + 63 <= ix_end) {
+    i = ix_end - 63;
+  }
+  if (ix_start + 512 <= i) {
+    for (; j < i; j += 8) {
+      FN(Store)(self, data, mask, j);
+    }
+  }
+  for (; i < ix_end; ++i) {
+    FN(Store)(self, data, mask, i);
+  }
+}
+
+static BROTLI_INLINE void FN(StitchToPreviousBlock)(
+    HashToBinaryTree* BROTLI_RESTRICT self,
+    size_t num_bytes, size_t position, const uint8_t* ringbuffer,
+    size_t ringbuffer_mask) {
+  if (num_bytes >= FN(HashTypeLength)() - 1 &&
+      position >= MAX_TREE_COMP_LENGTH) {
+    /* Store the last `MAX_TREE_COMP_LENGTH - 1` positions in the hasher.
+       These could not be calculated before, since they require knowledge
+       of both the previous and the current block. */
+    const size_t i_start = position - MAX_TREE_COMP_LENGTH + 1;
+    const size_t i_end = BROTLI_MIN(size_t, position, i_start + num_bytes);
+    size_t i;
+    for (i = i_start; i < i_end; ++i) {
+      /* Maximum distance is window size - 16, see section 9.1. of the spec.
+         Furthermore, we have to make sure that we don't look further back
+         from the start of the next block than the window size, otherwise we
+         could access already overwritten areas of the ring-buffer. */
+      const size_t max_backward =
+          self->window_mask_ - BROTLI_MAX(size_t,
+                                          BROTLI_WINDOW_GAP - 1,
+                                          position - i);
+      /* We know that i + MAX_TREE_COMP_LENGTH <= position + num_bytes, i.e. the
+         end of the current block and that we have at least
+         MAX_TREE_COMP_LENGTH tail in the ring-buffer. */
+      FN(StoreAndFindMatches)(self, ringbuffer, i, ringbuffer_mask,
+          MAX_TREE_COMP_LENGTH, max_backward, NULL, NULL);
+    }
+  }
+}
+
+#undef BUCKET_SIZE
+
+#undef HashToBinaryTree
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/histogram.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/histogram.c
new file mode 100644
index 0000000000..4dbb87f907
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/histogram.c
@@ -0,0 +1,100 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Build per-context histograms of literals, commands and distance codes. */
+
+#include "histogram.h"
+
+#include "../common/context.h"
+#include "block_splitter.h"
+#include "command.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+typedef struct BlockSplitIterator {
+  const BlockSplit* split_;  /* Not owned. */
+  size_t idx_;
+  size_t type_;
+  size_t length_;
+} BlockSplitIterator;
+
+static void InitBlockSplitIterator(BlockSplitIterator* self,
+    const BlockSplit* split) {
+  self->split_ = split;
+  self->idx_ = 0;
+  self->type_ = 0;
+  self->length_ = split->lengths ? split->lengths[0] : 0;
+}
+
+static void BlockSplitIteratorNext(BlockSplitIterator* self) {
+  if (self->length_ == 0) {
+    ++self->idx_;
+    self->type_ = self->split_->types[self->idx_];
+    self->length_ = self->split_->lengths[self->idx_];
+  }
+  --self->length_;
+}
+
+void BrotliBuildHistogramsWithContext(
+    const Command* cmds, const size_t num_commands,
+    const BlockSplit* literal_split, const BlockSplit* insert_and_copy_split,
+    const BlockSplit* dist_split, const uint8_t* ringbuffer, size_t start_pos,
+    size_t mask, uint8_t prev_byte, uint8_t prev_byte2,
+    const ContextType* context_modes, HistogramLiteral* literal_histograms,
+    HistogramCommand* insert_and_copy_histograms,
+    HistogramDistance* copy_dist_histograms) {
+  size_t pos = start_pos;
+  BlockSplitIterator literal_it;
+  BlockSplitIterator insert_and_copy_it;
+  BlockSplitIterator dist_it;
+  size_t i;
+
+  InitBlockSplitIterator(&literal_it, literal_split);
+  InitBlockSplitIterator(&insert_and_copy_it, insert_and_copy_split);
+  InitBlockSplitIterator(&dist_it, dist_split);
+  for (i = 0; i < num_commands; ++i) {
+    const Command* cmd = &cmds[i];
+    size_t j;
+    BlockSplitIteratorNext(&insert_and_copy_it);
+    HistogramAddCommand(&insert_and_copy_histograms[insert_and_copy_it.type_],
+        cmd->cmd_prefix_);
+    /* TODO(eustas): unwrap iterator blocks. */
+    for (j = cmd->insert_len_; j != 0; --j) {
+      size_t context;
+      BlockSplitIteratorNext(&literal_it);
+      context = literal_it.type_;
+      if (context_modes) {
+        ContextLut lut = BROTLI_CONTEXT_LUT(context_modes[context]);
+        context = (context << BROTLI_LITERAL_CONTEXT_BITS) +
+            BROTLI_CONTEXT(prev_byte, prev_byte2, lut);
+      }
+      HistogramAddLiteral(&literal_histograms[context],
+          ringbuffer[pos & mask]);
+      prev_byte2 = prev_byte;
+      prev_byte = ringbuffer[pos & mask];
+      ++pos;
+    }
+    pos += CommandCopyLen(cmd);
+    if (CommandCopyLen(cmd)) {
+      prev_byte2 = ringbuffer[(pos - 2) & mask];
+      prev_byte = ringbuffer[(pos - 1) & mask];
+      if (cmd->cmd_prefix_ >= 128) {
+        size_t context;
+        BlockSplitIteratorNext(&dist_it);
+        context = (dist_it.type_ << BROTLI_DISTANCE_CONTEXT_BITS) +
+            CommandDistanceContext(cmd);
+        HistogramAddDistance(&copy_dist_histograms[context],
+            cmd->dist_prefix_ & 0x3FF);
+      }
+    }
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/histogram.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/histogram.h
new file mode 100644
index 0000000000..d1abd973c1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/histogram.h
@@ -0,0 +1,64 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Models the histograms of literals, commands and distance codes. */
+
+#ifndef BROTLI_ENC_HISTOGRAM_H_
+#define BROTLI_ENC_HISTOGRAM_H_
+
+#include <string.h>  /* memset */
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/context.h"
+#include "../common/platform.h"
+#include "block_splitter.h"
+#include "command.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* The distance symbols effectively used by "Large Window Brotli" (32-bit). */
+#define BROTLI_NUM_HISTOGRAM_DISTANCE_SYMBOLS 544
+
+#define FN(X) X ## Literal
+#define DATA_SIZE BROTLI_NUM_LITERAL_SYMBOLS
+#define DataType uint8_t
+#include "histogram_inc.h"  /* NOLINT(build/include) */
+#undef DataType
+#undef DATA_SIZE
+#undef FN
+
+#define FN(X) X ## Command
+#define DataType uint16_t
+#define DATA_SIZE BROTLI_NUM_COMMAND_SYMBOLS
+#include "histogram_inc.h"  /* NOLINT(build/include) */
+#undef DATA_SIZE
+#undef FN
+
+#define FN(X) X ## Distance
+#define DATA_SIZE BROTLI_NUM_HISTOGRAM_DISTANCE_SYMBOLS
+#include "histogram_inc.h"  /* NOLINT(build/include) */
+#undef DataType
+#undef DATA_SIZE
+#undef FN
+
+BROTLI_INTERNAL void BrotliBuildHistogramsWithContext(
+    const Command* cmds, const size_t num_commands,
+    const BlockSplit* literal_split, const BlockSplit* insert_and_copy_split,
+    const BlockSplit* dist_split, const uint8_t* ringbuffer, size_t pos,
+    size_t mask, uint8_t prev_byte, uint8_t prev_byte2,
+    const ContextType* context_modes, HistogramLiteral* literal_histograms,
+    HistogramCommand* insert_and_copy_histograms,
+    HistogramDistance* copy_dist_histograms);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_HISTOGRAM_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/histogram_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/histogram_inc.h
new file mode 100644
index 0000000000..50eaf7468d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/histogram_inc.h
@@ -0,0 +1,51 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: Histogram, DATA_SIZE, DataType */
+
+/* A simple container for histograms of data in blocks. */
+
+typedef struct FN(Histogram) {
+  uint32_t data_[DATA_SIZE];
+  size_t total_count_;
+  double bit_cost_;
+} FN(Histogram);
+
+static BROTLI_INLINE void FN(HistogramClear)(FN(Histogram)* self) {
+  memset(self->data_, 0, sizeof(self->data_));
+  self->total_count_ = 0;
+  self->bit_cost_ = HUGE_VAL;
+}
+
+static BROTLI_INLINE void FN(ClearHistograms)(
+    FN(Histogram)* array, size_t length) {
+  size_t i;
+  for (i = 0; i < length; ++i) FN(HistogramClear)(array + i);
+}
+
+static BROTLI_INLINE void FN(HistogramAdd)(FN(Histogram)* self, size_t val) {
+  ++self->data_[val];
+  ++self->total_count_;
+}
+
+static BROTLI_INLINE void FN(HistogramAddVector)(FN(Histogram)* self,
+    const DataType* p, size_t n) {
+  self->total_count_ += n;
+  n += 1;
+  while (--n) ++self->data_[*p++];
+}
+
+static BROTLI_INLINE void FN(HistogramAddHistogram)(FN(Histogram)* self,
+    const FN(Histogram)* v) {
+  size_t i;
+  self->total_count_ += v->total_count_;
+  for (i = 0; i < DATA_SIZE; ++i) {
+    self->data_[i] += v->data_[i];
+  }
+}
+
+static BROTLI_INLINE size_t FN(HistogramDataSize)(void) { return DATA_SIZE; }
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/literal_cost.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/literal_cost.c
new file mode 100644
index 0000000000..2ac847f3c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/literal_cost.c
@@ -0,0 +1,180 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Literal cost model to allow backward reference replacement to be efficient.
+*/
+
+#include "literal_cost.h"
+
+#include <string.h>  /* memset */
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+#include "fast_log.h"
+#include "utf8_util.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static size_t UTF8Position(size_t last, size_t c, size_t clamp) {
+  if (c < 128) {
+    return 0;  /* Next one is the 'Byte 1' again. */
+  } else if (c >= 192) {  /* Next one is the 'Byte 2' of utf-8 encoding. */
+    return BROTLI_MIN(size_t, 1, clamp);
+  } else {
+    /* Let's decide over the last byte if this ends the sequence. */
+    if (last < 0xE0) {
+      return 0;  /* Completed two or three byte coding. */
+    } else {  /* Next one is the 'Byte 3' of utf-8 encoding. */
+      return BROTLI_MIN(size_t, 2, clamp);
+    }
+  }
+}
+
+static size_t DecideMultiByteStatsLevel(size_t pos, size_t len, size_t mask,
+                                        const uint8_t* data) {
+  size_t counts[3] = { 0 };
+  size_t max_utf8 = 1;  /* should be 2, but 1 compresses better. */
+  size_t last_c = 0;
+  size_t i;
+  for (i = 0; i < len; ++i) {
+    size_t c = data[(pos + i) & mask];
+    ++counts[UTF8Position(last_c, c, 2)];
+    last_c = c;
+  }
+  if (counts[2] < 500) {
+    max_utf8 = 1;
+  }
+  if (counts[1] + counts[2] < 25) {
+    max_utf8 = 0;
+  }
+  return max_utf8;
+}
+
+static void EstimateBitCostsForLiteralsUTF8(size_t pos, size_t len, size_t mask,
+                                            const uint8_t* data,
+                                            size_t* histogram, float* cost) {
+  /* max_utf8 is 0 (normal ASCII single byte modeling),
+     1 (for 2-byte UTF-8 modeling), or 2 (for 3-byte UTF-8 modeling). */
+  const size_t max_utf8 = DecideMultiByteStatsLevel(pos, len, mask, data);
+  size_t window_half = 495;
+  size_t in_window = BROTLI_MIN(size_t, window_half, len);
+  size_t in_window_utf8[3] = { 0 };
+  size_t i;
+  memset(histogram, 0, 3 * 256 * sizeof(histogram[0]));
+
+  {  /* Bootstrap histograms. */
+    size_t last_c = 0;
+    size_t utf8_pos = 0;
+    for (i = 0; i < in_window; ++i) {
+      size_t c = data[(pos + i) & mask];
+      ++histogram[256 * utf8_pos + c];
+      ++in_window_utf8[utf8_pos];
+      utf8_pos = UTF8Position(last_c, c, max_utf8);
+      last_c = c;
+    }
+  }
+
+  /* Compute bit costs with sliding window. */
+  for (i = 0; i < len; ++i) {
+    if (i >= window_half) {
+      /* Remove a byte in the past. */
+      size_t c =
+          i < window_half + 1 ? 0 : data[(pos + i - window_half - 1) & mask];
+      size_t last_c =
+          i < window_half + 2 ? 0 : data[(pos + i - window_half - 2) & mask];
+      size_t utf8_pos2 = UTF8Position(last_c, c, max_utf8);
+      --histogram[256 * utf8_pos2 + data[(pos + i - window_half) & mask]];
+      --in_window_utf8[utf8_pos2];
+    }
+    if (i + window_half < len) {
+      /* Add a byte in the future. */
+      size_t c = data[(pos + i + window_half - 1) & mask];
+      size_t last_c = data[(pos + i + window_half - 2) & mask];
+      size_t utf8_pos2 = UTF8Position(last_c, c, max_utf8);
+      ++histogram[256 * utf8_pos2 + data[(pos + i + window_half) & mask]];
+      ++in_window_utf8[utf8_pos2];
+    }
+    {
+      size_t c = i < 1 ? 0 : data[(pos + i - 1) & mask];
+      size_t last_c = i < 2 ? 0 : data[(pos + i - 2) & mask];
+      size_t utf8_pos = UTF8Position(last_c, c, max_utf8);
+      size_t masked_pos = (pos + i) & mask;
+      size_t histo = histogram[256 * utf8_pos + data[masked_pos]];
+      double lit_cost;
+      if (histo == 0) {
+        histo = 1;
+      }
+      lit_cost = FastLog2(in_window_utf8[utf8_pos]) - FastLog2(histo);
+      lit_cost += 0.02905;
+      if (lit_cost < 1.0) {
+        lit_cost *= 0.5;
+        lit_cost += 0.5;
+      }
+      /* Make the first bytes more expensive -- seems to help, not sure why.
+         Perhaps because the entropy source is changing its properties
+         rapidly in the beginning of the file, perhaps because the beginning
+         of the data is a statistical "anomaly". */
+      if (i < 2000) {
+        lit_cost += 0.7 - ((double)(2000 - i) / 2000.0 * 0.35);
+      }
+      cost[i] = (float)lit_cost;
+    }
+  }
+}
+
+void BrotliEstimateBitCostsForLiterals(size_t pos, size_t len, size_t mask,
+                                       const uint8_t* data,
+                                       size_t* histogram, float* cost) {
+  if (BrotliIsMostlyUTF8(data, pos, mask, len, kMinUTF8Ratio)) {
+    EstimateBitCostsForLiteralsUTF8(pos, len, mask, data, histogram, cost);
+    return;
+  } else {
+    size_t window_half = 2000;
+    size_t in_window = BROTLI_MIN(size_t, window_half, len);
+    size_t i;
+    memset(histogram, 0, 256 * sizeof(histogram[0]));
+
+    /* Bootstrap histogram. */
+    for (i = 0; i < in_window; ++i) {
+      ++histogram[data[(pos + i) & mask]];
+    }
+
+    /* Compute bit costs with sliding window. */
+    for (i = 0; i < len; ++i) {
+      size_t histo;
+      if (i >= window_half) {
+        /* Remove a byte in the past. */
+        --histogram[data[(pos + i - window_half) & mask]];
+        --in_window;
+      }
+      if (i + window_half < len) {
+        /* Add a byte in the future. */
+        ++histogram[data[(pos + i + window_half) & mask]];
+        ++in_window;
+      }
+      histo = histogram[data[(pos + i) & mask]];
+      if (histo == 0) {
+        histo = 1;
+      }
+      {
+        double lit_cost = FastLog2(in_window) - FastLog2(histo);
+        lit_cost += 0.029;
+        if (lit_cost < 1.0) {
+          lit_cost *= 0.5;
+          lit_cost += 0.5;
+        }
+        cost[i] = (float)lit_cost;
+      }
+    }
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/literal_cost.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/literal_cost.h
new file mode 100644
index 0000000000..284a8e5af7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/literal_cost.h
@@ -0,0 +1,32 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Literal cost model to allow backward reference replacement to be efficient.
+*/
+
+#ifndef BROTLI_ENC_LITERAL_COST_H_
+#define BROTLI_ENC_LITERAL_COST_H_
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* Estimates how many bits the literals in the interval [pos, pos + len) in the
+   ring-buffer (data, mask) will take entropy coded and writes these estimates
+   to the cost[0..len) array. */
+BROTLI_INTERNAL void BrotliEstimateBitCostsForLiterals(
+    size_t pos, size_t len, size_t mask, const uint8_t* data, size_t* histogram,
+    float* cost);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_LITERAL_COST_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/memory.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/memory.c
new file mode 100644
index 0000000000..bb5e364198
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/memory.c
@@ -0,0 +1,194 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Algorithms for distributing the literals and commands of a metablock between
+   block types and contexts. */
+
+#include "memory.h"
+
+#include <stdlib.h>  /* exit, free, malloc */
+#include <string.h>  /* memcpy */
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define MAX_NEW_ALLOCATED (BROTLI_ENCODER_MEMORY_MANAGER_SLOTS >> 2)
+#define MAX_NEW_FREED (BROTLI_ENCODER_MEMORY_MANAGER_SLOTS >> 2)
+#define MAX_PERM_ALLOCATED (BROTLI_ENCODER_MEMORY_MANAGER_SLOTS >> 1)
+
+#define PERM_ALLOCATED_OFFSET 0
+#define NEW_ALLOCATED_OFFSET MAX_PERM_ALLOCATED
+#define NEW_FREED_OFFSET (MAX_PERM_ALLOCATED + MAX_NEW_ALLOCATED)
+
+void BrotliInitMemoryManager(
+    MemoryManager* m, brotli_alloc_func alloc_func, brotli_free_func free_func,
+    void* opaque) {
+  if (!alloc_func) {
+    m->alloc_func = BrotliDefaultAllocFunc;
+    m->free_func = BrotliDefaultFreeFunc;
+    m->opaque = 0;
+  } else {
+    m->alloc_func = alloc_func;
+    m->free_func = free_func;
+    m->opaque = opaque;
+  }
+#if !defined(BROTLI_ENCODER_EXIT_ON_OOM)
+  m->is_oom = BROTLI_FALSE;
+  m->perm_allocated = 0;
+  m->new_allocated = 0;
+  m->new_freed = 0;
+#endif  /* BROTLI_ENCODER_EXIT_ON_OOM */
+}
+
+#if defined(BROTLI_ENCODER_EXIT_ON_OOM)
+
+void* BrotliAllocate(MemoryManager* m, size_t n) {
+  void* result = m->alloc_func(m->opaque, n);
+  if (!result) exit(EXIT_FAILURE);
+  return result;
+}
+
+void BrotliFree(MemoryManager* m, void* p) {
+  m->free_func(m->opaque, p);
+}
+
+void BrotliWipeOutMemoryManager(MemoryManager* m) {
+  BROTLI_UNUSED(m);
+}
+
+#else  /* BROTLI_ENCODER_EXIT_ON_OOM */
+
+static void SortPointers(void** items, const size_t n) {
+  /* Shell sort. */
+  /* TODO(eustas): fine-tune for "many slots" case */
+  static const size_t gaps[] = {23, 10, 4, 1};
+  int g = 0;
+  for (; g < 4; ++g) {
+    size_t gap = gaps[g];
+    size_t i;
+    for (i = gap; i < n; ++i) {
+      size_t j = i;
+      void* tmp = items[i];
+      for (; j >= gap && tmp < items[j - gap]; j -= gap) {
+        items[j] = items[j - gap];
+      }
+      items[j] = tmp;
+    }
+  }
+}
+
+static size_t Annihilate(void** a, size_t a_len, void** b, size_t b_len) {
+  size_t a_read_index = 0;
+  size_t b_read_index = 0;
+  size_t a_write_index = 0;
+  size_t b_write_index = 0;
+  size_t annihilated = 0;
+  while (a_read_index < a_len && b_read_index < b_len) {
+    if (a[a_read_index] == b[b_read_index]) {
+      a_read_index++;
+      b_read_index++;
+      annihilated++;
+    } else if (a[a_read_index] < b[b_read_index]) {
+      a[a_write_index++] = a[a_read_index++];
+    } else {
+      b[b_write_index++] = b[b_read_index++];
+    }
+  }
+  while (a_read_index < a_len) a[a_write_index++] = a[a_read_index++];
+  while (b_read_index < b_len) b[b_write_index++] = b[b_read_index++];
+  return annihilated;
+}
+
+static void CollectGarbagePointers(MemoryManager* m) {
+  size_t annihilated;
+  SortPointers(m->pointers + NEW_ALLOCATED_OFFSET, m->new_allocated);
+  SortPointers(m->pointers + NEW_FREED_OFFSET, m->new_freed);
+  annihilated = Annihilate(
+      m->pointers + NEW_ALLOCATED_OFFSET, m->new_allocated,
+      m->pointers + NEW_FREED_OFFSET, m->new_freed);
+  m->new_allocated -= annihilated;
+  m->new_freed -= annihilated;
+
+  if (m->new_freed != 0) {
+    annihilated = Annihilate(
+        m->pointers + PERM_ALLOCATED_OFFSET, m->perm_allocated,
+        m->pointers + NEW_FREED_OFFSET, m->new_freed);
+    m->perm_allocated -= annihilated;
+    m->new_freed -= annihilated;
+    BROTLI_DCHECK(m->new_freed == 0);
+  }
+
+  if (m->new_allocated != 0) {
+    BROTLI_DCHECK(m->perm_allocated + m->new_allocated <= MAX_PERM_ALLOCATED);
+    memcpy(m->pointers + PERM_ALLOCATED_OFFSET + m->perm_allocated,
+           m->pointers + NEW_ALLOCATED_OFFSET,
+           sizeof(void*) * m->new_allocated);
+    m->perm_allocated += m->new_allocated;
+    m->new_allocated = 0;
+    SortPointers(m->pointers + PERM_ALLOCATED_OFFSET, m->perm_allocated);
+  }
+}
+
+void* BrotliAllocate(MemoryManager* m, size_t n) {
+  void* result = m->alloc_func(m->opaque, n);
+  if (!result) {
+    m->is_oom = BROTLI_TRUE;
+    return NULL;
+  }
+  if (m->new_allocated == MAX_NEW_ALLOCATED) CollectGarbagePointers(m);
+  m->pointers[NEW_ALLOCATED_OFFSET + (m->new_allocated++)] = result;
+  return result;
+}
+
+void BrotliFree(MemoryManager* m, void* p) {
+  if (!p) return;
+  m->free_func(m->opaque, p);
+  if (m->new_freed == MAX_NEW_FREED) CollectGarbagePointers(m);
+  m->pointers[NEW_FREED_OFFSET + (m->new_freed++)] = p;
+}
+
+void BrotliWipeOutMemoryManager(MemoryManager* m) {
+  size_t i;
+  CollectGarbagePointers(m);
+  /* Now all unfreed pointers are in perm-allocated list. */
+  for (i = 0; i < m->perm_allocated; ++i) {
+    m->free_func(m->opaque, m->pointers[PERM_ALLOCATED_OFFSET + i]);
+  }
+  m->perm_allocated = 0;
+}
+
+#endif  /* BROTLI_ENCODER_EXIT_ON_OOM */
+
+void* BrotliBootstrapAlloc(size_t size,
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {
+  if (!alloc_func && !free_func) {
+    return malloc(size);
+  } else if (alloc_func && free_func) {
+    return alloc_func(opaque, size);
+  }
+  return NULL;
+}
+
+void BrotliBootstrapFree(void* address, MemoryManager* m) {
+  if (!address) {
+    /* Should not happen! */
+    return;
+  } else {
+    /* Copy values, as those would be freed. */
+    brotli_free_func free_func = m->free_func;
+    void* opaque = m->opaque;
+    free_func(opaque, address);
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/memory.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/memory.h
new file mode 100644
index 0000000000..a4417df4cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/memory.h
@@ -0,0 +1,131 @@
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Macros for memory management. */
+
+#ifndef BROTLI_ENC_MEMORY_H_
+#define BROTLI_ENC_MEMORY_H_
+
+#include <string.h>  /* memcpy */
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#if !defined(BROTLI_ENCODER_CLEANUP_ON_OOM) && \
+    !defined(BROTLI_ENCODER_EXIT_ON_OOM)
+#define BROTLI_ENCODER_EXIT_ON_OOM
+#endif
+
+#if !defined(BROTLI_ENCODER_EXIT_ON_OOM)
+#if defined(BROTLI_EXPERIMENTAL)
+#define BROTLI_ENCODER_MEMORY_MANAGER_SLOTS (48*1024)
+#else  /* BROTLI_EXPERIMENTAL */
+#define BROTLI_ENCODER_MEMORY_MANAGER_SLOTS 256
+#endif  /* BROTLI_EXPERIMENTAL */
+#else /* BROTLI_ENCODER_EXIT_ON_OOM */
+#define BROTLI_ENCODER_MEMORY_MANAGER_SLOTS 0
+#endif  /* BROTLI_ENCODER_EXIT_ON_OOM */
+
+typedef struct MemoryManager {
+  brotli_alloc_func alloc_func;
+  brotli_free_func free_func;
+  void* opaque;
+#if !defined(BROTLI_ENCODER_EXIT_ON_OOM)
+  BROTLI_BOOL is_oom;
+  size_t perm_allocated;
+  size_t new_allocated;
+  size_t new_freed;
+  void* pointers[BROTLI_ENCODER_MEMORY_MANAGER_SLOTS];
+#endif  /* BROTLI_ENCODER_EXIT_ON_OOM */
+} MemoryManager;
+
+BROTLI_INTERNAL void BrotliInitMemoryManager(
+    MemoryManager* m, brotli_alloc_func alloc_func, brotli_free_func free_func,
+    void* opaque);
+
+BROTLI_INTERNAL void* BrotliAllocate(MemoryManager* m, size_t n);
+#define BROTLI_ALLOC(M, T, N)                               \
+  ((N) > 0 ? ((T*)BrotliAllocate((M), (N) * sizeof(T))) : NULL)
+
+BROTLI_INTERNAL void BrotliFree(MemoryManager* m, void* p);
+#define BROTLI_FREE(M, P) { \
+  BrotliFree((M), (P));     \
+  P = NULL;                 \
+}
+
+#if defined(BROTLI_ENCODER_EXIT_ON_OOM)
+#define BROTLI_IS_OOM(M) (!!0)
+#else  /* BROTLI_ENCODER_EXIT_ON_OOM */
+#define BROTLI_IS_OOM(M) (!!(M)->is_oom)
+#endif  /* BROTLI_ENCODER_EXIT_ON_OOM */
+
+/*
+BROTLI_IS_NULL is a fake check, BROTLI_IS_OOM does the heavy lifting.
+The only purpose of it is to explain static analyzers the state of things.
+NB: use ONLY together with BROTLI_IS_OOM
+    AND ONLY for allocations in the current scope.
+ */
+#if defined(__clang_analyzer__) && !defined(BROTLI_ENCODER_EXIT_ON_OOM)
+#define BROTLI_IS_NULL(A) ((A) == nullptr)
+#else  /* defined(__clang_analyzer__) */
+#define BROTLI_IS_NULL(A) (!!0)
+#endif  /* defined(__clang_analyzer__) */
+
+BROTLI_INTERNAL void BrotliWipeOutMemoryManager(MemoryManager* m);
+
+/*
+Dynamically grows array capacity to at least the requested size
+M: MemoryManager
+T: data type
+A: array
+C: capacity
+R: requested size
+*/
+#define BROTLI_ENSURE_CAPACITY(M, T, A, C, R) {                    \
+  if (C < (R)) {                                                   \
+    size_t _new_size = (C == 0) ? (R) : C;                         \
+    T* new_array;                                                  \
+    while (_new_size < (R)) _new_size *= 2;                        \
+    new_array = BROTLI_ALLOC((M), T, _new_size);                   \
+    if (!BROTLI_IS_OOM(M) && !BROTLI_IS_NULL(new_array) && C != 0) \
+      memcpy(new_array, A, C * sizeof(T));                         \
+    BROTLI_FREE((M), A);                                           \
+    A = new_array;                                                 \
+    C = _new_size;                                                 \
+  }                                                                \
+}
+
+/*
+Appends value and dynamically grows array capacity when needed
+M: MemoryManager
+T: data type
+A: array
+C: array capacity
+S: array size
+V: value to append
+*/
+#define BROTLI_ENSURE_CAPACITY_APPEND(M, T, A, C, S, V) { \
+  (S)++;                                                  \
+  BROTLI_ENSURE_CAPACITY(M, T, A, C, S);                  \
+  A[(S) - 1] = (V);                                       \
+}
+
+/* "Bootstrap" allocations are not tracked by memory manager; should be used
+   only to allocate MemoryManager itself (or structure containing it). */
+BROTLI_INTERNAL void* BrotliBootstrapAlloc(size_t size,
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);
+BROTLI_INTERNAL void BrotliBootstrapFree(void* address, MemoryManager* m);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_MEMORY_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/metablock.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/metablock.c
new file mode 100644
index 0000000000..5fe43a589a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/metablock.c
@@ -0,0 +1,675 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Algorithms for distributing the literals and commands of a metablock between
+   block types and contexts. */
+
+#include "metablock.h"
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/context.h"
+#include "../common/platform.h"
+#include "bit_cost.h"
+#include "block_splitter.h"
+#include "cluster.h"
+#include "entropy_encode.h"
+#include "histogram.h"
+#include "memory.h"
+#include "quality.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+void BrotliInitDistanceParams(BrotliDistanceParams* dist_params,
+    uint32_t npostfix, uint32_t ndirect, BROTLI_BOOL large_window) {
+  uint32_t alphabet_size_max;
+  uint32_t alphabet_size_limit;
+  uint32_t max_distance;
+
+  dist_params->distance_postfix_bits = npostfix;
+  dist_params->num_direct_distance_codes = ndirect;
+
+  alphabet_size_max = BROTLI_DISTANCE_ALPHABET_SIZE(
+      npostfix, ndirect, BROTLI_MAX_DISTANCE_BITS);
+  alphabet_size_limit = alphabet_size_max;
+  max_distance = ndirect + (1U << (BROTLI_MAX_DISTANCE_BITS + npostfix + 2)) -
+      (1U << (npostfix + 2));
+
+  if (large_window) {
+    BrotliDistanceCodeLimit limit = BrotliCalculateDistanceCodeLimit(
+        BROTLI_MAX_ALLOWED_DISTANCE, npostfix, ndirect);
+    alphabet_size_max = BROTLI_DISTANCE_ALPHABET_SIZE(
+        npostfix, ndirect, BROTLI_LARGE_MAX_DISTANCE_BITS);
+    alphabet_size_limit = limit.max_alphabet_size;
+    max_distance = limit.max_distance;
+  }
+
+  dist_params->alphabet_size_max = alphabet_size_max;
+  dist_params->alphabet_size_limit = alphabet_size_limit;
+  dist_params->max_distance = max_distance;
+}
+
+static void RecomputeDistancePrefixes(Command* cmds,
+                                      size_t num_commands,
+                                      const BrotliDistanceParams* orig_params,
+                                      const BrotliDistanceParams* new_params) {
+  size_t i;
+
+  if (orig_params->distance_postfix_bits == new_params->distance_postfix_bits &&
+      orig_params->num_direct_distance_codes ==
+      new_params->num_direct_distance_codes) {
+    return;
+  }
+
+  for (i = 0; i < num_commands; ++i) {
+    Command* cmd = &cmds[i];
+    if (CommandCopyLen(cmd) && cmd->cmd_prefix_ >= 128) {
+      PrefixEncodeCopyDistance(CommandRestoreDistanceCode(cmd, orig_params),
+                               new_params->num_direct_distance_codes,
+                               new_params->distance_postfix_bits,
+                               &cmd->dist_prefix_,
+                               &cmd->dist_extra_);
+    }
+  }
+}
+
+static BROTLI_BOOL ComputeDistanceCost(const Command* cmds,
+                                       size_t num_commands,
+                                       const BrotliDistanceParams* orig_params,
+                                       const BrotliDistanceParams* new_params,
+                                       double* cost,
+                                       HistogramDistance* tmp) {
+  size_t i;
+  BROTLI_BOOL equal_params = BROTLI_FALSE;
+  uint16_t dist_prefix;
+  uint32_t dist_extra;
+  double extra_bits = 0.0;
+  HistogramClearDistance(tmp);
+
+  if (orig_params->distance_postfix_bits == new_params->distance_postfix_bits &&
+      orig_params->num_direct_distance_codes ==
+      new_params->num_direct_distance_codes) {
+    equal_params = BROTLI_TRUE;
+  }
+
+  for (i = 0; i < num_commands; i++) {
+    const Command* cmd = &cmds[i];
+    if (CommandCopyLen(cmd) && cmd->cmd_prefix_ >= 128) {
+      if (equal_params) {
+        dist_prefix = cmd->dist_prefix_;
+      } else {
+        uint32_t distance = CommandRestoreDistanceCode(cmd, orig_params);
+        if (distance > new_params->max_distance) {
+          return BROTLI_FALSE;
+        }
+        PrefixEncodeCopyDistance(distance,
+                                 new_params->num_direct_distance_codes,
+                                 new_params->distance_postfix_bits,
+                                 &dist_prefix,
+                                 &dist_extra);
+      }
+      HistogramAddDistance(tmp, dist_prefix & 0x3FF);
+      extra_bits += dist_prefix >> 10;
+    }
+  }
+
+  *cost = BrotliPopulationCostDistance(tmp) + extra_bits;
+  return BROTLI_TRUE;
+}
+
+void BrotliBuildMetaBlock(MemoryManager* m,
+                          const uint8_t* ringbuffer,
+                          const size_t pos,
+                          const size_t mask,
+                          BrotliEncoderParams* params,
+                          uint8_t prev_byte,
+                          uint8_t prev_byte2,
+                          Command* cmds,
+                          size_t num_commands,
+                          ContextType literal_context_mode,
+                          MetaBlockSplit* mb) {
+  /* Histogram ids need to fit in one byte. */
+  static const size_t kMaxNumberOfHistograms = 256;
+  HistogramDistance* distance_histograms;
+  HistogramLiteral* literal_histograms;
+  ContextType* literal_context_modes = NULL;
+  size_t literal_histograms_size;
+  size_t distance_histograms_size;
+  size_t i;
+  size_t literal_context_multiplier = 1;
+  uint32_t npostfix;
+  uint32_t ndirect_msb = 0;
+  BROTLI_BOOL check_orig = BROTLI_TRUE;
+  double best_dist_cost = 1e99;
+  BrotliDistanceParams orig_params = params->dist;
+  BrotliDistanceParams new_params = params->dist;
+  HistogramDistance* tmp = BROTLI_ALLOC(m, HistogramDistance, 1);
+
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(tmp)) return;
+
+  for (npostfix = 0; npostfix <= BROTLI_MAX_NPOSTFIX; npostfix++) {
+    for (; ndirect_msb < 16; ndirect_msb++) {
+      uint32_t ndirect = ndirect_msb << npostfix;
+      BROTLI_BOOL skip;
+      double dist_cost;
+      BrotliInitDistanceParams(&new_params, npostfix, ndirect,
+                               params->large_window);
+      if (npostfix == orig_params.distance_postfix_bits &&
+          ndirect == orig_params.num_direct_distance_codes) {
+        check_orig = BROTLI_FALSE;
+      }
+      skip = !ComputeDistanceCost(
+          cmds, num_commands, &orig_params, &new_params, &dist_cost, tmp);
+      if (skip || (dist_cost > best_dist_cost)) {
+        break;
+      }
+      best_dist_cost = dist_cost;
+      params->dist = new_params;
+    }
+    if (ndirect_msb > 0) ndirect_msb--;
+    ndirect_msb /= 2;
+  }
+  if (check_orig) {
+    double dist_cost;
+    ComputeDistanceCost(cmds, num_commands, &orig_params, &orig_params,
+                        &dist_cost, tmp);
+    if (dist_cost < best_dist_cost) {
+      /* NB: currently unused; uncomment when more param tuning is added. */
+      /* best_dist_cost = dist_cost; */
+      params->dist = orig_params;
+    }
+  }
+  BROTLI_FREE(m, tmp);
+  RecomputeDistancePrefixes(cmds, num_commands, &orig_params, &params->dist);
+
+  BrotliSplitBlock(m, cmds, num_commands,
+                   ringbuffer, pos, mask, params,
+                   &mb->literal_split,
+                   &mb->command_split,
+                   &mb->distance_split);
+  if (BROTLI_IS_OOM(m)) return;
+
+  if (!params->disable_literal_context_modeling) {
+    literal_context_multiplier = 1 << BROTLI_LITERAL_CONTEXT_BITS;
+    literal_context_modes =
+        BROTLI_ALLOC(m, ContextType, mb->literal_split.num_types);
+    if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(literal_context_modes)) return;
+    for (i = 0; i < mb->literal_split.num_types; ++i) {
+      literal_context_modes[i] = literal_context_mode;
+    }
+  }
+
+  literal_histograms_size =
+      mb->literal_split.num_types * literal_context_multiplier;
+  literal_histograms =
+      BROTLI_ALLOC(m, HistogramLiteral, literal_histograms_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(literal_histograms)) return;
+  ClearHistogramsLiteral(literal_histograms, literal_histograms_size);
+
+  distance_histograms_size =
+      mb->distance_split.num_types << BROTLI_DISTANCE_CONTEXT_BITS;
+  distance_histograms =
+      BROTLI_ALLOC(m, HistogramDistance, distance_histograms_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(distance_histograms)) return;
+  ClearHistogramsDistance(distance_histograms, distance_histograms_size);
+
+  BROTLI_DCHECK(mb->command_histograms == 0);
+  mb->command_histograms_size = mb->command_split.num_types;
+  mb->command_histograms =
+      BROTLI_ALLOC(m, HistogramCommand, mb->command_histograms_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->command_histograms)) return;
+  ClearHistogramsCommand(mb->command_histograms, mb->command_histograms_size);
+
+  BrotliBuildHistogramsWithContext(cmds, num_commands,
+      &mb->literal_split, &mb->command_split, &mb->distance_split,
+      ringbuffer, pos, mask, prev_byte, prev_byte2, literal_context_modes,
+      literal_histograms, mb->command_histograms, distance_histograms);
+  BROTLI_FREE(m, literal_context_modes);
+
+  BROTLI_DCHECK(mb->literal_context_map == 0);
+  mb->literal_context_map_size =
+      mb->literal_split.num_types << BROTLI_LITERAL_CONTEXT_BITS;
+  mb->literal_context_map =
+      BROTLI_ALLOC(m, uint32_t, mb->literal_context_map_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->literal_context_map)) return;
+
+  BROTLI_DCHECK(mb->literal_histograms == 0);
+  mb->literal_histograms_size = mb->literal_context_map_size;
+  mb->literal_histograms =
+      BROTLI_ALLOC(m, HistogramLiteral, mb->literal_histograms_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->literal_histograms)) return;
+
+  BrotliClusterHistogramsLiteral(m, literal_histograms, literal_histograms_size,
+      kMaxNumberOfHistograms, mb->literal_histograms,
+      &mb->literal_histograms_size, mb->literal_context_map);
+  if (BROTLI_IS_OOM(m)) return;
+  BROTLI_FREE(m, literal_histograms);
+
+  if (params->disable_literal_context_modeling) {
+    /* Distribute assignment to all contexts. */
+    for (i = mb->literal_split.num_types; i != 0;) {
+      size_t j = 0;
+      i--;
+      for (; j < (1 << BROTLI_LITERAL_CONTEXT_BITS); j++) {
+        mb->literal_context_map[(i << BROTLI_LITERAL_CONTEXT_BITS) + j] =
+            mb->literal_context_map[i];
+      }
+    }
+  }
+
+  BROTLI_DCHECK(mb->distance_context_map == 0);
+  mb->distance_context_map_size =
+      mb->distance_split.num_types << BROTLI_DISTANCE_CONTEXT_BITS;
+  mb->distance_context_map =
+      BROTLI_ALLOC(m, uint32_t, mb->distance_context_map_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->distance_context_map)) return;
+
+  BROTLI_DCHECK(mb->distance_histograms == 0);
+  mb->distance_histograms_size = mb->distance_context_map_size;
+  mb->distance_histograms =
+      BROTLI_ALLOC(m, HistogramDistance, mb->distance_histograms_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->distance_histograms)) return;
+
+  BrotliClusterHistogramsDistance(m, distance_histograms,
+                                  mb->distance_context_map_size,
+                                  kMaxNumberOfHistograms,
+                                  mb->distance_histograms,
+                                  &mb->distance_histograms_size,
+                                  mb->distance_context_map);
+  if (BROTLI_IS_OOM(m)) return;
+  BROTLI_FREE(m, distance_histograms);
+}
+
+#define FN(X) X ## Literal
+#include "metablock_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#define FN(X) X ## Command
+#include "metablock_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+#define FN(X) X ## Distance
+#include "metablock_inc.h"  /* NOLINT(build/include) */
+#undef FN
+
+/* Greedy block splitter for one block category (literal, command or distance).
+   Gathers histograms for all context buckets. */
+typedef struct ContextBlockSplitter {
+  /* Alphabet size of particular block category. */
+  size_t alphabet_size_;
+  size_t num_contexts_;
+  size_t max_block_types_;
+  /* We collect at least this many symbols for each block. */
+  size_t min_block_size_;
+  /* We merge histograms A and B if
+       entropy(A+B) < entropy(A) + entropy(B) + split_threshold_,
+     where A is the current histogram and B is the histogram of the last or the
+     second last block type. */
+  double split_threshold_;
+
+  size_t num_blocks_;
+  BlockSplit* split_;  /* not owned */
+  HistogramLiteral* histograms_;  /* not owned */
+  size_t* histograms_size_;  /* not owned */
+
+  /* The number of symbols that we want to collect before deciding on whether
+     or not to merge the block with a previous one or emit a new block. */
+  size_t target_block_size_;
+  /* The number of symbols in the current histogram. */
+  size_t block_size_;
+  /* Offset of the current histogram. */
+  size_t curr_histogram_ix_;
+  /* Offset of the histograms of the previous two block types. */
+  size_t last_histogram_ix_[2];
+  /* Entropy of the previous two block types. */
+  double last_entropy_[2 * BROTLI_MAX_STATIC_CONTEXTS];
+  /* The number of times we merged the current block with the last one. */
+  size_t merge_last_count_;
+} ContextBlockSplitter;
+
+static void InitContextBlockSplitter(
+    MemoryManager* m, ContextBlockSplitter* self, size_t alphabet_size,
+    size_t num_contexts, size_t min_block_size, double split_threshold,
+    size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms,
+    size_t* histograms_size) {
+  size_t max_num_blocks = num_symbols / min_block_size + 1;
+  size_t max_num_types;
+  BROTLI_DCHECK(num_contexts <= BROTLI_MAX_STATIC_CONTEXTS);
+
+  self->alphabet_size_ = alphabet_size;
+  self->num_contexts_ = num_contexts;
+  self->max_block_types_ = BROTLI_MAX_NUMBER_OF_BLOCK_TYPES / num_contexts;
+  self->min_block_size_ = min_block_size;
+  self->split_threshold_ = split_threshold;
+  self->num_blocks_ = 0;
+  self->split_ = split;
+  self->histograms_size_ = histograms_size;
+  self->target_block_size_ = min_block_size;
+  self->block_size_ = 0;
+  self->curr_histogram_ix_ = 0;
+  self->merge_last_count_ = 0;
+
+  /* We have to allocate one more histogram than the maximum number of block
+     types for the current histogram when the meta-block is too big. */
+  max_num_types =
+      BROTLI_MIN(size_t, max_num_blocks, self->max_block_types_ + 1);
+  BROTLI_ENSURE_CAPACITY(m, uint8_t,
+      split->types, split->types_alloc_size, max_num_blocks);
+  BROTLI_ENSURE_CAPACITY(m, uint32_t,
+      split->lengths, split->lengths_alloc_size, max_num_blocks);
+  if (BROTLI_IS_OOM(m)) return;
+  split->num_blocks = max_num_blocks;
+  if (BROTLI_IS_OOM(m)) return;
+  BROTLI_DCHECK(*histograms == 0);
+  *histograms_size = max_num_types * num_contexts;
+  *histograms = BROTLI_ALLOC(m, HistogramLiteral, *histograms_size);
+  self->histograms_ = *histograms;
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(*histograms)) return;
+  /* Clear only current histogram. */
+  ClearHistogramsLiteral(&self->histograms_[0], num_contexts);
+  self->last_histogram_ix_[0] = self->last_histogram_ix_[1] = 0;
+}
+
+/* Does either of three things:
+     (1) emits the current block with a new block type;
+     (2) emits the current block with the type of the second last block;
+     (3) merges the current block with the last block. */
+static void ContextBlockSplitterFinishBlock(
+    ContextBlockSplitter* self, MemoryManager* m, BROTLI_BOOL is_final) {
+  BlockSplit* split = self->split_;
+  const size_t num_contexts = self->num_contexts_;
+  double* last_entropy = self->last_entropy_;
+  HistogramLiteral* histograms = self->histograms_;
+
+  if (self->block_size_ < self->min_block_size_) {
+    self->block_size_ = self->min_block_size_;
+  }
+  if (self->num_blocks_ == 0) {
+    size_t i;
+    /* Create first block. */
+    split->lengths[0] = (uint32_t)self->block_size_;
+    split->types[0] = 0;
+
+    for (i = 0; i < num_contexts; ++i) {
+      last_entropy[i] =
+          BitsEntropy(histograms[i].data_, self->alphabet_size_);
+      last_entropy[num_contexts + i] = last_entropy[i];
+    }
+    ++self->num_blocks_;
+    ++split->num_types;
+    self->curr_histogram_ix_ += num_contexts;
+    if (self->curr_histogram_ix_ < *self->histograms_size_) {
+      ClearHistogramsLiteral(
+          &self->histograms_[self->curr_histogram_ix_], self->num_contexts_);
+    }
+    self->block_size_ = 0;
+  } else if (self->block_size_ > 0) {
+    /* Try merging the set of histograms for the current block type with the
+       respective set of histograms for the last and second last block types.
+       Decide over the split based on the total reduction of entropy across
+       all contexts. */
+    double entropy[BROTLI_MAX_STATIC_CONTEXTS];
+    HistogramLiteral* combined_histo =
+        BROTLI_ALLOC(m, HistogramLiteral, 2 * num_contexts);
+    double combined_entropy[2 * BROTLI_MAX_STATIC_CONTEXTS];
+    double diff[2] = { 0.0 };
+    size_t i;
+    if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(combined_histo)) return;
+    for (i = 0; i < num_contexts; ++i) {
+      size_t curr_histo_ix = self->curr_histogram_ix_ + i;
+      size_t j;
+      entropy[i] = BitsEntropy(histograms[curr_histo_ix].data_,
+                               self->alphabet_size_);
+      for (j = 0; j < 2; ++j) {
+        size_t jx = j * num_contexts + i;
+        size_t last_histogram_ix = self->last_histogram_ix_[j] + i;
+        combined_histo[jx] = histograms[curr_histo_ix];
+        HistogramAddHistogramLiteral(&combined_histo[jx],
+            &histograms[last_histogram_ix]);
+        combined_entropy[jx] = BitsEntropy(
+            &combined_histo[jx].data_[0], self->alphabet_size_);
+        diff[j] += combined_entropy[jx] - entropy[i] - last_entropy[jx];
+      }
+    }
+
+    if (split->num_types < self->max_block_types_ &&
+        diff[0] > self->split_threshold_ &&
+        diff[1] > self->split_threshold_) {
+      /* Create new block. */
+      split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;
+      split->types[self->num_blocks_] = (uint8_t)split->num_types;
+      self->last_histogram_ix_[1] = self->last_histogram_ix_[0];
+      self->last_histogram_ix_[0] = split->num_types * num_contexts;
+      for (i = 0; i < num_contexts; ++i) {
+        last_entropy[num_contexts + i] = last_entropy[i];
+        last_entropy[i] = entropy[i];
+      }
+      ++self->num_blocks_;
+      ++split->num_types;
+      self->curr_histogram_ix_ += num_contexts;
+      if (self->curr_histogram_ix_ < *self->histograms_size_) {
+        ClearHistogramsLiteral(
+            &self->histograms_[self->curr_histogram_ix_], self->num_contexts_);
+      }
+      self->block_size_ = 0;
+      self->merge_last_count_ = 0;
+      self->target_block_size_ = self->min_block_size_;
+    } else if (diff[1] < diff[0] - 20.0) {
+      /* Combine this block with second last block. */
+      split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;
+      split->types[self->num_blocks_] = split->types[self->num_blocks_ - 2];
+      BROTLI_SWAP(size_t, self->last_histogram_ix_, 0, 1);
+      for (i = 0; i < num_contexts; ++i) {
+        histograms[self->last_histogram_ix_[0] + i] =
+            combined_histo[num_contexts + i];
+        last_entropy[num_contexts + i] = last_entropy[i];
+        last_entropy[i] = combined_entropy[num_contexts + i];
+        HistogramClearLiteral(&histograms[self->curr_histogram_ix_ + i]);
+      }
+      ++self->num_blocks_;
+      self->block_size_ = 0;
+      self->merge_last_count_ = 0;
+      self->target_block_size_ = self->min_block_size_;
+    } else {
+      /* Combine this block with last block. */
+      split->lengths[self->num_blocks_ - 1] += (uint32_t)self->block_size_;
+      for (i = 0; i < num_contexts; ++i) {
+        histograms[self->last_histogram_ix_[0] + i] = combined_histo[i];
+        last_entropy[i] = combined_entropy[i];
+        if (split->num_types == 1) {
+          last_entropy[num_contexts + i] = last_entropy[i];
+        }
+        HistogramClearLiteral(&histograms[self->curr_histogram_ix_ + i]);
+      }
+      self->block_size_ = 0;
+      if (++self->merge_last_count_ > 1) {
+        self->target_block_size_ += self->min_block_size_;
+      }
+    }
+    BROTLI_FREE(m, combined_histo);
+  }
+  if (is_final) {
+    *self->histograms_size_ = split->num_types * num_contexts;
+    split->num_blocks = self->num_blocks_;
+  }
+}
+
+/* Adds the next symbol to the current block type and context. When the
+   current block reaches the target size, decides on merging the block. */
+static void ContextBlockSplitterAddSymbol(
+    ContextBlockSplitter* self, MemoryManager* m,
+    size_t symbol, size_t context) {
+  HistogramAddLiteral(&self->histograms_[self->curr_histogram_ix_ + context],
+      symbol);
+  ++self->block_size_;
+  if (self->block_size_ == self->target_block_size_) {
+    ContextBlockSplitterFinishBlock(self, m, /* is_final = */ BROTLI_FALSE);
+    if (BROTLI_IS_OOM(m)) return;
+  }
+}
+
+static void MapStaticContexts(MemoryManager* m,
+                              size_t num_contexts,
+                              const uint32_t* static_context_map,
+                              MetaBlockSplit* mb) {
+  size_t i;
+  BROTLI_DCHECK(mb->literal_context_map == 0);
+  mb->literal_context_map_size =
+      mb->literal_split.num_types << BROTLI_LITERAL_CONTEXT_BITS;
+  mb->literal_context_map =
+      BROTLI_ALLOC(m, uint32_t, mb->literal_context_map_size);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->literal_context_map)) return;
+
+  for (i = 0; i < mb->literal_split.num_types; ++i) {
+    uint32_t offset = (uint32_t)(i * num_contexts);
+    size_t j;
+    for (j = 0; j < (1u << BROTLI_LITERAL_CONTEXT_BITS); ++j) {
+      mb->literal_context_map[(i << BROTLI_LITERAL_CONTEXT_BITS) + j] =
+          offset + static_context_map[j];
+    }
+  }
+}
+
+typedef struct GreedyMetablockArena {
+  union {
+    BlockSplitterLiteral plain;
+    ContextBlockSplitter ctx;
+  } lit_blocks;
+  BlockSplitterCommand cmd_blocks;
+  BlockSplitterDistance dist_blocks;
+} GreedyMetablockArena;
+
+static BROTLI_INLINE void BrotliBuildMetaBlockGreedyInternal(
+    MemoryManager* m, GreedyMetablockArena* arena, const uint8_t* ringbuffer,
+    size_t pos, size_t mask, uint8_t prev_byte, uint8_t prev_byte2,
+    ContextLut literal_context_lut, const size_t num_contexts,
+    const uint32_t* static_context_map, const Command* commands,
+    size_t n_commands, MetaBlockSplit* mb) {
+  size_t num_literals = 0;
+  size_t i;
+  for (i = 0; i < n_commands; ++i) {
+    num_literals += commands[i].insert_len_;
+  }
+
+  if (num_contexts == 1) {
+    InitBlockSplitterLiteral(m, &arena->lit_blocks.plain, 256, 512, 400.0,
+        num_literals, &mb->literal_split, &mb->literal_histograms,
+        &mb->literal_histograms_size);
+  } else {
+    InitContextBlockSplitter(m, &arena->lit_blocks.ctx, 256, num_contexts, 512,
+        400.0, num_literals, &mb->literal_split, &mb->literal_histograms,
+        &mb->literal_histograms_size);
+  }
+  if (BROTLI_IS_OOM(m)) return;
+  InitBlockSplitterCommand(m, &arena->cmd_blocks, BROTLI_NUM_COMMAND_SYMBOLS,
+      1024, 500.0, n_commands, &mb->command_split, &mb->command_histograms,
+      &mb->command_histograms_size);
+  if (BROTLI_IS_OOM(m)) return;
+  InitBlockSplitterDistance(m, &arena->dist_blocks, 64, 512, 100.0, n_commands,
+      &mb->distance_split, &mb->distance_histograms,
+      &mb->distance_histograms_size);
+  if (BROTLI_IS_OOM(m)) return;
+
+  for (i = 0; i < n_commands; ++i) {
+    const Command cmd = commands[i];
+    size_t j;
+    BlockSplitterAddSymbolCommand(&arena->cmd_blocks, cmd.cmd_prefix_);
+    for (j = cmd.insert_len_; j != 0; --j) {
+      uint8_t literal = ringbuffer[pos & mask];
+      if (num_contexts == 1) {
+        BlockSplitterAddSymbolLiteral(&arena->lit_blocks.plain, literal);
+      } else {
+        size_t context =
+            BROTLI_CONTEXT(prev_byte, prev_byte2, literal_context_lut);
+        ContextBlockSplitterAddSymbol(&arena->lit_blocks.ctx, m, literal,
+                                      static_context_map[context]);
+        if (BROTLI_IS_OOM(m)) return;
+      }
+      prev_byte2 = prev_byte;
+      prev_byte = literal;
+      ++pos;
+    }
+    pos += CommandCopyLen(&cmd);
+    if (CommandCopyLen(&cmd)) {
+      prev_byte2 = ringbuffer[(pos - 2) & mask];
+      prev_byte = ringbuffer[(pos - 1) & mask];
+      if (cmd.cmd_prefix_ >= 128) {
+        BlockSplitterAddSymbolDistance(
+            &arena->dist_blocks, cmd.dist_prefix_ & 0x3FF);
+      }
+    }
+  }
+
+  if (num_contexts == 1) {
+    BlockSplitterFinishBlockLiteral(
+        &arena->lit_blocks.plain, /* is_final = */ BROTLI_TRUE);
+  } else {
+    ContextBlockSplitterFinishBlock(
+        &arena->lit_blocks.ctx, m, /* is_final = */ BROTLI_TRUE);
+    if (BROTLI_IS_OOM(m)) return;
+  }
+  BlockSplitterFinishBlockCommand(
+      &arena->cmd_blocks, /* is_final = */ BROTLI_TRUE);
+  BlockSplitterFinishBlockDistance(
+      &arena->dist_blocks, /* is_final = */ BROTLI_TRUE);
+
+  if (num_contexts > 1) {
+    MapStaticContexts(m, num_contexts, static_context_map, mb);
+  }
+}
+
+void BrotliBuildMetaBlockGreedy(MemoryManager* m,
+                                const uint8_t* ringbuffer,
+                                size_t pos,
+                                size_t mask,
+                                uint8_t prev_byte,
+                                uint8_t prev_byte2,
+                                ContextLut literal_context_lut,
+                                size_t num_contexts,
+                                const uint32_t* static_context_map,
+                                const Command* commands,
+                                size_t n_commands,
+                                MetaBlockSplit* mb) {
+  GreedyMetablockArena* arena = BROTLI_ALLOC(m, GreedyMetablockArena, 1);
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(arena)) return;
+  if (num_contexts == 1) {
+    BrotliBuildMetaBlockGreedyInternal(m, arena, ringbuffer, pos, mask,
+        prev_byte, prev_byte2, literal_context_lut, 1, NULL, commands,
+        n_commands, mb);
+  } else {
+    BrotliBuildMetaBlockGreedyInternal(m, arena, ringbuffer, pos, mask,
+        prev_byte, prev_byte2, literal_context_lut, num_contexts,
+        static_context_map, commands, n_commands, mb);
+  }
+  BROTLI_FREE(m, arena);
+}
+
+void BrotliOptimizeHistograms(uint32_t num_distance_codes,
+                              MetaBlockSplit* mb) {
+  uint8_t good_for_rle[BROTLI_NUM_COMMAND_SYMBOLS];
+  size_t i;
+  for (i = 0; i < mb->literal_histograms_size; ++i) {
+    BrotliOptimizeHuffmanCountsForRle(256, mb->literal_histograms[i].data_,
+                                      good_for_rle);
+  }
+  for (i = 0; i < mb->command_histograms_size; ++i) {
+    BrotliOptimizeHuffmanCountsForRle(BROTLI_NUM_COMMAND_SYMBOLS,
+                                      mb->command_histograms[i].data_,
+                                      good_for_rle);
+  }
+  for (i = 0; i < mb->distance_histograms_size; ++i) {
+    BrotliOptimizeHuffmanCountsForRle(num_distance_codes,
+                                      mb->distance_histograms[i].data_,
+                                      good_for_rle);
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/metablock.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/metablock.h
new file mode 100644
index 0000000000..e574baea6b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/metablock.h
@@ -0,0 +1,108 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Algorithms for distributing the literals and commands of a metablock between
+   block types and contexts. */
+
+#ifndef BROTLI_ENC_METABLOCK_H_
+#define BROTLI_ENC_METABLOCK_H_
+
+#include <brotli/types.h>
+
+#include "../common/context.h"
+#include "../common/platform.h"
+#include "block_splitter.h"
+#include "command.h"
+#include "histogram.h"
+#include "memory.h"
+#include "quality.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define BROTLI_MAX_STATIC_CONTEXTS 13
+
+typedef struct MetaBlockSplit {
+  BlockSplit literal_split;
+  BlockSplit command_split;
+  BlockSplit distance_split;
+  uint32_t* literal_context_map;
+  size_t literal_context_map_size;
+  uint32_t* distance_context_map;
+  size_t distance_context_map_size;
+  HistogramLiteral* literal_histograms;
+  size_t literal_histograms_size;
+  HistogramCommand* command_histograms;
+  size_t command_histograms_size;
+  HistogramDistance* distance_histograms;
+  size_t distance_histograms_size;
+} MetaBlockSplit;
+
+static BROTLI_INLINE void InitMetaBlockSplit(MetaBlockSplit* mb) {
+  BrotliInitBlockSplit(&mb->literal_split);
+  BrotliInitBlockSplit(&mb->command_split);
+  BrotliInitBlockSplit(&mb->distance_split);
+  mb->literal_context_map = 0;
+  mb->literal_context_map_size = 0;
+  mb->distance_context_map = 0;
+  mb->distance_context_map_size = 0;
+  mb->literal_histograms = 0;
+  mb->literal_histograms_size = 0;
+  mb->command_histograms = 0;
+  mb->command_histograms_size = 0;
+  mb->distance_histograms = 0;
+  mb->distance_histograms_size = 0;
+}
+
+static BROTLI_INLINE void DestroyMetaBlockSplit(
+    MemoryManager* m, MetaBlockSplit* mb) {
+  BrotliDestroyBlockSplit(m, &mb->literal_split);
+  BrotliDestroyBlockSplit(m, &mb->command_split);
+  BrotliDestroyBlockSplit(m, &mb->distance_split);
+  BROTLI_FREE(m, mb->literal_context_map);
+  BROTLI_FREE(m, mb->distance_context_map);
+  BROTLI_FREE(m, mb->literal_histograms);
+  BROTLI_FREE(m, mb->command_histograms);
+  BROTLI_FREE(m, mb->distance_histograms);
+}
+
+/* Uses the slow shortest-path block splitter and does context clustering.
+   The distance parameters are dynamically selected based on the commands
+   which get recomputed under the new distance parameters. The new distance
+   parameters are stored into *params. */
+BROTLI_INTERNAL void BrotliBuildMetaBlock(MemoryManager* m,
+                                          const uint8_t* ringbuffer,
+                                          const size_t pos,
+                                          const size_t mask,
+                                          BrotliEncoderParams* params,
+                                          uint8_t prev_byte,
+                                          uint8_t prev_byte2,
+                                          Command* cmds,
+                                          size_t num_commands,
+                                          ContextType literal_context_mode,
+                                          MetaBlockSplit* mb);
+
+/* Uses a fast greedy block splitter that tries to merge current block with the
+   last or the second last block and uses a static context clustering which
+   is the same for all block types. */
+BROTLI_INTERNAL void BrotliBuildMetaBlockGreedy(
+    MemoryManager* m, const uint8_t* ringbuffer, size_t pos, size_t mask,
+    uint8_t prev_byte, uint8_t prev_byte2, ContextLut literal_context_lut,
+    size_t num_contexts, const uint32_t* static_context_map,
+    const Command* commands, size_t n_commands, MetaBlockSplit* mb);
+
+BROTLI_INTERNAL void BrotliOptimizeHistograms(uint32_t num_distance_codes,
+                                              MetaBlockSplit* mb);
+
+BROTLI_INTERNAL void BrotliInitDistanceParams(BrotliDistanceParams* params,
+    uint32_t npostfix, uint32_t ndirect, BROTLI_BOOL large_window);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_METABLOCK_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/metablock_inc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/metablock_inc.h
new file mode 100644
index 0000000000..f9393869ab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/metablock_inc.h
@@ -0,0 +1,185 @@
+/* NOLINT(build/header_guard) */
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* template parameters: FN */
+
+#define HistogramType FN(Histogram)
+
+/* Greedy block splitter for one block category (literal, command or distance).
+*/
+typedef struct FN(BlockSplitter) {
+  /* Alphabet size of particular block category. */
+  size_t alphabet_size_;
+  /* We collect at least this many symbols for each block. */
+  size_t min_block_size_;
+  /* We merge histograms A and B if
+       entropy(A+B) < entropy(A) + entropy(B) + split_threshold_,
+     where A is the current histogram and B is the histogram of the last or the
+     second last block type. */
+  double split_threshold_;
+
+  size_t num_blocks_;
+  BlockSplit* split_;  /* not owned */
+  HistogramType* histograms_;  /* not owned */
+  size_t* histograms_size_;  /* not owned */
+
+  /* Temporary storage for BlockSplitterFinishBlock. */
+  HistogramType combined_histo[2];
+
+  /* The number of symbols that we want to collect before deciding on whether
+     or not to merge the block with a previous one or emit a new block. */
+  size_t target_block_size_;
+  /* The number of symbols in the current histogram. */
+  size_t block_size_;
+  /* Offset of the current histogram. */
+  size_t curr_histogram_ix_;
+  /* Offset of the histograms of the previous two block types. */
+  size_t last_histogram_ix_[2];
+  /* Entropy of the previous two block types. */
+  double last_entropy_[2];
+  /* The number of times we merged the current block with the last one. */
+  size_t merge_last_count_;
+} FN(BlockSplitter);
+
+static void FN(InitBlockSplitter)(
+    MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size,
+    size_t min_block_size, double split_threshold, size_t num_symbols,
+    BlockSplit* split, HistogramType** histograms, size_t* histograms_size) {
+  size_t max_num_blocks = num_symbols / min_block_size + 1;
+  /* We have to allocate one more histogram than the maximum number of block
+     types for the current histogram when the meta-block is too big. */
+  size_t max_num_types =
+      BROTLI_MIN(size_t, max_num_blocks, BROTLI_MAX_NUMBER_OF_BLOCK_TYPES + 1);
+  self->alphabet_size_ = alphabet_size;
+  self->min_block_size_ = min_block_size;
+  self->split_threshold_ = split_threshold;
+  self->num_blocks_ = 0;
+  self->split_ = split;
+  self->histograms_size_ = histograms_size;
+  self->target_block_size_ = min_block_size;
+  self->block_size_ = 0;
+  self->curr_histogram_ix_ = 0;
+  self->merge_last_count_ = 0;
+  BROTLI_ENSURE_CAPACITY(m, uint8_t,
+      split->types, split->types_alloc_size, max_num_blocks);
+  BROTLI_ENSURE_CAPACITY(m, uint32_t,
+      split->lengths, split->lengths_alloc_size, max_num_blocks);
+  if (BROTLI_IS_OOM(m)) return;
+  self->split_->num_blocks = max_num_blocks;
+  BROTLI_DCHECK(*histograms == 0);
+  *histograms_size = max_num_types;
+  *histograms = BROTLI_ALLOC(m, HistogramType, *histograms_size);
+  self->histograms_ = *histograms;
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(*histograms)) return;
+  /* Clear only current histogram. */
+  FN(HistogramClear)(&self->histograms_[0]);
+  self->last_histogram_ix_[0] = self->last_histogram_ix_[1] = 0;
+}
+
+/* Does either of three things:
+     (1) emits the current block with a new block type;
+     (2) emits the current block with the type of the second last block;
+     (3) merges the current block with the last block. */
+static void FN(BlockSplitterFinishBlock)(
+    FN(BlockSplitter)* self, BROTLI_BOOL is_final) {
+  BlockSplit* split = self->split_;
+  double* last_entropy = self->last_entropy_;
+  HistogramType* histograms = self->histograms_;
+  self->block_size_ =
+      BROTLI_MAX(size_t, self->block_size_, self->min_block_size_);
+  if (self->num_blocks_ == 0) {
+    /* Create first block. */
+    split->lengths[0] = (uint32_t)self->block_size_;
+    split->types[0] = 0;
+    last_entropy[0] =
+        BitsEntropy(histograms[0].data_, self->alphabet_size_);
+    last_entropy[1] = last_entropy[0];
+    ++self->num_blocks_;
+    ++split->num_types;
+    ++self->curr_histogram_ix_;
+    if (self->curr_histogram_ix_ < *self->histograms_size_)
+      FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);
+    self->block_size_ = 0;
+  } else if (self->block_size_ > 0) {
+    double entropy = BitsEntropy(histograms[self->curr_histogram_ix_].data_,
+                                 self->alphabet_size_);
+    double combined_entropy[2];
+    double diff[2];
+    size_t j;
+    for (j = 0; j < 2; ++j) {
+      size_t last_histogram_ix = self->last_histogram_ix_[j];
+      self->combined_histo[j] = histograms[self->curr_histogram_ix_];
+      FN(HistogramAddHistogram)(&self->combined_histo[j],
+          &histograms[last_histogram_ix]);
+      combined_entropy[j] = BitsEntropy(
+          &self->combined_histo[j].data_[0], self->alphabet_size_);
+      diff[j] = combined_entropy[j] - entropy - last_entropy[j];
+    }
+
+    if (split->num_types < BROTLI_MAX_NUMBER_OF_BLOCK_TYPES &&
+        diff[0] > self->split_threshold_ &&
+        diff[1] > self->split_threshold_) {
+      /* Create new block. */
+      split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;
+      split->types[self->num_blocks_] = (uint8_t)split->num_types;
+      self->last_histogram_ix_[1] = self->last_histogram_ix_[0];
+      self->last_histogram_ix_[0] = (uint8_t)split->num_types;
+      last_entropy[1] = last_entropy[0];
+      last_entropy[0] = entropy;
+      ++self->num_blocks_;
+      ++split->num_types;
+      ++self->curr_histogram_ix_;
+      if (self->curr_histogram_ix_ < *self->histograms_size_)
+        FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);
+      self->block_size_ = 0;
+      self->merge_last_count_ = 0;
+      self->target_block_size_ = self->min_block_size_;
+    } else if (diff[1] < diff[0] - 20.0) {
+      /* Combine this block with second last block. */
+      split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;
+      split->types[self->num_blocks_] = split->types[self->num_blocks_ - 2];
+      BROTLI_SWAP(size_t, self->last_histogram_ix_, 0, 1);
+      histograms[self->last_histogram_ix_[0]] = self->combined_histo[1];
+      last_entropy[1] = last_entropy[0];
+      last_entropy[0] = combined_entropy[1];
+      ++self->num_blocks_;
+      self->block_size_ = 0;
+      FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);
+      self->merge_last_count_ = 0;
+      self->target_block_size_ = self->min_block_size_;
+    } else {
+      /* Combine this block with last block. */
+      split->lengths[self->num_blocks_ - 1] += (uint32_t)self->block_size_;
+      histograms[self->last_histogram_ix_[0]] = self->combined_histo[0];
+      last_entropy[0] = combined_entropy[0];
+      if (split->num_types == 1) {
+        last_entropy[1] = last_entropy[0];
+      }
+      self->block_size_ = 0;
+      FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);
+      if (++self->merge_last_count_ > 1) {
+        self->target_block_size_ += self->min_block_size_;
+      }
+    }
+  }
+  if (is_final) {
+    *self->histograms_size_ = split->num_types;
+    split->num_blocks = self->num_blocks_;
+  }
+}
+
+/* Adds the next symbol to the current histogram. When the current histogram
+   reaches the target size, decides on merging the block. */
+static void FN(BlockSplitterAddSymbol)(FN(BlockSplitter)* self, size_t symbol) {
+  FN(HistogramAdd)(&self->histograms_[self->curr_histogram_ix_], symbol);
+  ++self->block_size_;
+  if (self->block_size_ == self->target_block_size_) {
+    FN(BlockSplitterFinishBlock)(self, /* is_final = */ BROTLI_FALSE);
+  }
+}
+
+#undef HistogramType
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/params.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/params.h
new file mode 100644
index 0000000000..78b2ab6082
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/params.h
@@ -0,0 +1,47 @@
+/* Copyright 2017 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Parameters for the Brotli encoder with chosen quality levels. */
+
+#ifndef BROTLI_ENC_PARAMS_H_
+#define BROTLI_ENC_PARAMS_H_
+
+#include <brotli/encode.h>
+
+#include "encoder_dict.h"
+
+typedef struct BrotliHasherParams {
+  int type;
+  int bucket_bits;
+  int block_bits;
+  int num_last_distances_to_check;
+} BrotliHasherParams;
+
+typedef struct BrotliDistanceParams {
+  uint32_t distance_postfix_bits;
+  uint32_t num_direct_distance_codes;
+  uint32_t alphabet_size_max;
+  uint32_t alphabet_size_limit;
+  size_t max_distance;
+} BrotliDistanceParams;
+
+/* Encoding parameters */
+typedef struct BrotliEncoderParams {
+  BrotliEncoderMode mode;
+  int quality;
+  int lgwin;
+  int lgblock;
+  size_t stream_offset;
+  size_t size_hint;
+  BROTLI_BOOL disable_literal_context_modeling;
+  BROTLI_BOOL large_window;
+  BrotliHasherParams hasher;
+  BrotliDistanceParams dist;
+  /* TODO(eustas): rename to BrotliShared... */
+  SharedEncoderDictionary dictionary;
+} BrotliEncoderParams;
+
+#endif  /* BROTLI_ENC_PARAMS_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/prefix.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/prefix.h
new file mode 100644
index 0000000000..0f006f1614
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/prefix.h
@@ -0,0 +1,54 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Functions for encoding of integers into prefix codes the amount of extra
+   bits, and the actual values of the extra bits. */
+
+#ifndef BROTLI_ENC_PREFIX_H_
+#define BROTLI_ENC_PREFIX_H_
+
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/platform.h"
+#include "fast_log.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* Here distance_code is an intermediate code, i.e. one of the special codes or
+   the actual distance increased by BROTLI_NUM_DISTANCE_SHORT_CODES - 1. */
+static BROTLI_INLINE void PrefixEncodeCopyDistance(size_t distance_code,
+                                                   size_t num_direct_codes,
+                                                   size_t postfix_bits,
+                                                   uint16_t* code,
+                                                   uint32_t* extra_bits) {
+  if (distance_code < BROTLI_NUM_DISTANCE_SHORT_CODES + num_direct_codes) {
+    *code = (uint16_t)distance_code;
+    *extra_bits = 0;
+    return;
+  } else {
+    size_t dist = ((size_t)1 << (postfix_bits + 2u)) +
+        (distance_code - BROTLI_NUM_DISTANCE_SHORT_CODES - num_direct_codes);
+    size_t bucket = Log2FloorNonZero(dist) - 1;
+    size_t postfix_mask = (1u << postfix_bits) - 1;
+    size_t postfix = dist & postfix_mask;
+    size_t prefix = (dist >> bucket) & 1;
+    size_t offset = (2 + prefix) << bucket;
+    size_t nbits = bucket - postfix_bits;
+    *code = (uint16_t)((nbits << 10) |
+        (BROTLI_NUM_DISTANCE_SHORT_CODES + num_direct_codes +
+         ((2 * (nbits - 1) + prefix) << postfix_bits) + postfix));
+    *extra_bits = (uint32_t)((dist - offset) >> postfix_bits);
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_PREFIX_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/quality.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/quality.h
new file mode 100644
index 0000000000..ffdfd72fb4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/quality.h
@@ -0,0 +1,202 @@
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Constants and formulas that affect speed-ratio trade-offs and thus define
+   quality levels. */
+
+#ifndef BROTLI_ENC_QUALITY_H_
+#define BROTLI_ENC_QUALITY_H_
+
+#include <brotli/encode.h>
+
+#include "../common/platform.h"
+#include "params.h"
+
+#define FAST_ONE_PASS_COMPRESSION_QUALITY 0
+#define FAST_TWO_PASS_COMPRESSION_QUALITY 1
+#define ZOPFLIFICATION_QUALITY 10
+#define HQ_ZOPFLIFICATION_QUALITY 11
+
+#define MAX_QUALITY_FOR_STATIC_ENTROPY_CODES 2
+#define MIN_QUALITY_FOR_BLOCK_SPLIT 4
+#define MIN_QUALITY_FOR_NONZERO_DISTANCE_PARAMS 4
+#define MIN_QUALITY_FOR_OPTIMIZE_HISTOGRAMS 4
+#define MIN_QUALITY_FOR_EXTENSIVE_REFERENCE_SEARCH 5
+#define MIN_QUALITY_FOR_CONTEXT_MODELING 5
+#define MIN_QUALITY_FOR_HQ_CONTEXT_MODELING 7
+#define MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING 10
+
+/* For quality below MIN_QUALITY_FOR_BLOCK_SPLIT there is no block splitting,
+   so we buffer at most this much literals and commands. */
+#define MAX_NUM_DELAYED_SYMBOLS 0x2FFF
+
+/* Returns hash-table size for quality levels 0 and 1. */
+static BROTLI_INLINE size_t MaxHashTableSize(int quality) {
+  return quality == FAST_ONE_PASS_COMPRESSION_QUALITY ? 1 << 15 : 1 << 17;
+}
+
+/* The maximum length for which the zopflification uses distinct distances. */
+#define MAX_ZOPFLI_LEN_QUALITY_10 150
+#define MAX_ZOPFLI_LEN_QUALITY_11 325
+
+/* Do not thoroughly search when a long copy is found. */
+#define BROTLI_LONG_COPY_QUICK_STEP 16384
+
+static BROTLI_INLINE size_t MaxZopfliLen(const BrotliEncoderParams* params) {
+  return params->quality <= 10 ?
+      MAX_ZOPFLI_LEN_QUALITY_10 :
+      MAX_ZOPFLI_LEN_QUALITY_11;
+}
+
+/* Number of best candidates to evaluate to expand Zopfli chain. */
+static BROTLI_INLINE size_t MaxZopfliCandidates(
+  const BrotliEncoderParams* params) {
+  return params->quality <= 10 ? 1 : 5;
+}
+
+static BROTLI_INLINE void SanitizeParams(BrotliEncoderParams* params) {
+  params->quality = BROTLI_MIN(int, BROTLI_MAX_QUALITY,
+      BROTLI_MAX(int, BROTLI_MIN_QUALITY, params->quality));
+  if (params->quality <= MAX_QUALITY_FOR_STATIC_ENTROPY_CODES) {
+    params->large_window = BROTLI_FALSE;
+  }
+  if (params->lgwin < BROTLI_MIN_WINDOW_BITS) {
+    params->lgwin = BROTLI_MIN_WINDOW_BITS;
+  } else {
+    int max_lgwin = params->large_window ? BROTLI_LARGE_MAX_WINDOW_BITS :
+                                           BROTLI_MAX_WINDOW_BITS;
+    if (params->lgwin > max_lgwin) params->lgwin = max_lgwin;
+  }
+}
+
+/* Returns optimized lg_block value. */
+static BROTLI_INLINE int ComputeLgBlock(const BrotliEncoderParams* params) {
+  int lgblock = params->lgblock;
+  if (params->quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||
+      params->quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {
+    lgblock = params->lgwin;
+  } else if (params->quality < MIN_QUALITY_FOR_BLOCK_SPLIT) {
+    lgblock = 14;
+  } else if (lgblock == 0) {
+    lgblock = 16;
+    if (params->quality >= 9 && params->lgwin > lgblock) {
+      lgblock = BROTLI_MIN(int, 18, params->lgwin);
+    }
+  } else {
+    lgblock = BROTLI_MIN(int, BROTLI_MAX_INPUT_BLOCK_BITS,
+        BROTLI_MAX(int, BROTLI_MIN_INPUT_BLOCK_BITS, lgblock));
+  }
+  return lgblock;
+}
+
+/* Returns log2 of the size of main ring buffer area.
+   Allocate at least lgwin + 1 bits for the ring buffer so that the newly
+   added block fits there completely and we still get lgwin bits and at least
+   read_block_size_bits + 1 bits because the copy tail length needs to be
+   smaller than ring-buffer size. */
+static BROTLI_INLINE int ComputeRbBits(const BrotliEncoderParams* params) {
+  return 1 + BROTLI_MAX(int, params->lgwin, params->lgblock);
+}
+
+static BROTLI_INLINE size_t MaxMetablockSize(
+    const BrotliEncoderParams* params) {
+  int bits =
+      BROTLI_MIN(int, ComputeRbBits(params), BROTLI_MAX_INPUT_BLOCK_BITS);
+  return (size_t)1 << bits;
+}
+
+/* When searching for backward references and have not seen matches for a long
+   time, we can skip some match lookups. Unsuccessful match lookups are very
+   expensive and this kind of a heuristic speeds up compression quite a lot.
+   At first 8 byte strides are taken and every second byte is put to hasher.
+   After 4x more literals stride by 16 bytes, every put 4-th byte to hasher.
+   Applied only to qualities 2 to 9. */
+static BROTLI_INLINE size_t LiteralSpreeLengthForSparseSearch(
+    const BrotliEncoderParams* params) {
+  return params->quality < 9 ? 64 : 512;
+}
+
+/* Quality to hasher mapping:
+
+   - q02: h02 (longest_match_quickly), b16, l5
+
+   - q03: h03 (longest_match_quickly), b17, l5
+
+   - q04: h04 (longest_match_quickly), b17, l5
+   - q04: h54 (longest_match_quickly), b20, l7 | for large files
+
+   - q05: h05 (longest_match        ), b14, l4
+   - q05: h06 (longest_match64      ), b15, l5 | for large files
+   - q05: h40 (forgetful_chain      ), b15, l4 | for small window
+
+   - q06: h05 (longest_match        ), b14, l4
+   - q06: h06 (longest_match64      ), b15, l5 | for large files
+   - q06: h40 (forgetful_chain      ), b15, l4 | for small window
+
+   - q07: h05 (longest_match        ), b15, l4
+   - q07: h06 (longest_match64      ), b15, l5 | for large files
+   - q07: h41 (forgetful_chain      ), b15, l4 | for small window
+
+   - q08: h05 (longest_match        ), b15, l4
+   - q08: h06 (longest_match64      ), b15, l5 | for large files
+   - q08: h41 (forgetful_chain      ), b15, l4 | for small window
+
+   - q09: h05 (longest_match        ), b15, l4
+   - q09: h06 (longest_match64      ), b15, l5 | for large files
+   - q09: h42 (forgetful_chain      ), b15, l4 | for small window
+
+   - q10: t10 (to_binary_tree       ), b17, l128
+
+   - q11: t10 (to_binary_tree       ), b17, l128
+
+  Where "q" is quality, "h" is hasher type, "b" is bucket bits,
+  "l" is source len. */
+static BROTLI_INLINE void ChooseHasher(const BrotliEncoderParams* params,
+                                       BrotliHasherParams* hparams) {
+  if (params->quality > 9) {
+    hparams->type = 10;
+  } else if (params->quality == 4 && params->size_hint >= (1 << 20)) {
+    hparams->type = 54;
+  } else if (params->quality < 5) {
+    hparams->type = params->quality;
+  } else if (params->lgwin <= 16) {
+    hparams->type = params->quality < 7 ? 40 : params->quality < 9 ? 41 : 42;
+  } else if (params->size_hint >= (1 << 20) && params->lgwin >= 19) {
+    hparams->type = 6;
+    hparams->block_bits = params->quality - 1;
+    hparams->bucket_bits = 15;
+    hparams->num_last_distances_to_check =
+        params->quality < 7 ? 4 : params->quality < 9 ? 10 : 16;
+  } else {
+    /* TODO(eustas): often previous setting (H6) is faster and denser; consider
+                     adding an option to use it. */
+    hparams->type = 5;
+    hparams->block_bits = params->quality - 1;
+    hparams->bucket_bits = params->quality < 7 ? 14 : 15;
+    hparams->num_last_distances_to_check =
+        params->quality < 7 ? 4 : params->quality < 9 ? 10 : 16;
+  }
+
+  if (params->lgwin > 24) {
+    /* Different hashers for large window brotli: not for qualities <= 2,
+       these are too fast for large window. Not for qualities >= 10: their
+       hasher already works well with large window. So the changes are:
+       H3 --> H35: for quality 3.
+       H54 --> H55: for quality 4 with size hint > 1MB
+       H6 --> H65: for qualities 5, 6, 7, 8, 9. */
+    if (hparams->type == 3) {
+      hparams->type = 35;
+    }
+    if (hparams->type == 54) {
+      hparams->type = 55;
+    }
+    if (hparams->type == 6) {
+      hparams->type = 65;
+    }
+  }
+}
+
+#endif  /* BROTLI_ENC_QUALITY_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/ringbuffer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/ringbuffer.h
new file mode 100644
index 0000000000..27245b7f39
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/ringbuffer.h
@@ -0,0 +1,168 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Sliding window over the input data. */
+
+#ifndef BROTLI_ENC_RINGBUFFER_H_
+#define BROTLI_ENC_RINGBUFFER_H_
+
+#include <string.h>  /* memcpy */
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+#include "memory.h"
+#include "quality.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* A RingBuffer(window_bits, tail_bits) contains `1 << window_bits' bytes of
+   data in a circular manner: writing a byte writes it to:
+     `position() % (1 << window_bits)'.
+   For convenience, the RingBuffer array contains another copy of the
+   first `1 << tail_bits' bytes:
+     buffer_[i] == buffer_[i + (1 << window_bits)], if i < (1 << tail_bits),
+   and another copy of the last two bytes:
+     buffer_[-1] == buffer_[(1 << window_bits) - 1] and
+     buffer_[-2] == buffer_[(1 << window_bits) - 2]. */
+typedef struct RingBuffer {
+  /* Size of the ring-buffer is (1 << window_bits) + tail_size_. */
+  const uint32_t size_;
+  const uint32_t mask_;
+  const uint32_t tail_size_;
+  const uint32_t total_size_;
+
+  uint32_t cur_size_;
+  /* Position to write in the ring buffer. */
+  uint32_t pos_;
+  /* The actual ring buffer containing the copy of the last two bytes, the data,
+     and the copy of the beginning as a tail. */
+  uint8_t* data_;
+  /* The start of the ring-buffer. */
+  uint8_t* buffer_;
+} RingBuffer;
+
+static BROTLI_INLINE void RingBufferInit(RingBuffer* rb) {
+  rb->cur_size_ = 0;
+  rb->pos_ = 0;
+  rb->data_ = 0;
+  rb->buffer_ = 0;
+}
+
+static BROTLI_INLINE void RingBufferSetup(
+    const BrotliEncoderParams* params, RingBuffer* rb) {
+  int window_bits = ComputeRbBits(params);
+  int tail_bits = params->lgblock;
+  *(uint32_t*)&rb->size_ = 1u << window_bits;
+  *(uint32_t*)&rb->mask_ = (1u << window_bits) - 1;
+  *(uint32_t*)&rb->tail_size_ = 1u << tail_bits;
+  *(uint32_t*)&rb->total_size_ = rb->size_ + rb->tail_size_;
+}
+
+static BROTLI_INLINE void RingBufferFree(MemoryManager* m, RingBuffer* rb) {
+  BROTLI_FREE(m, rb->data_);
+}
+
+/* Allocates or re-allocates data_ to the given length + plus some slack
+   region before and after. Fills the slack regions with zeros. */
+static BROTLI_INLINE void RingBufferInitBuffer(
+    MemoryManager* m, const uint32_t buflen, RingBuffer* rb) {
+  static const size_t kSlackForEightByteHashingEverywhere = 7;
+  uint8_t* new_data = BROTLI_ALLOC(
+      m, uint8_t, 2 + buflen + kSlackForEightByteHashingEverywhere);
+  size_t i;
+  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(new_data)) return;
+  if (rb->data_) {
+    memcpy(new_data, rb->data_,
+        2 + rb->cur_size_ + kSlackForEightByteHashingEverywhere);
+    BROTLI_FREE(m, rb->data_);
+  }
+  rb->data_ = new_data;
+  rb->cur_size_ = buflen;
+  rb->buffer_ = rb->data_ + 2;
+  rb->buffer_[-2] = rb->buffer_[-1] = 0;
+  for (i = 0; i < kSlackForEightByteHashingEverywhere; ++i) {
+    rb->buffer_[rb->cur_size_ + i] = 0;
+  }
+}
+
+static BROTLI_INLINE void RingBufferWriteTail(
+    const uint8_t* bytes, size_t n, RingBuffer* rb) {
+  const size_t masked_pos = rb->pos_ & rb->mask_;
+  if (BROTLI_PREDICT_FALSE(masked_pos < rb->tail_size_)) {
+    /* Just fill the tail buffer with the beginning data. */
+    const size_t p = rb->size_ + masked_pos;
+    memcpy(&rb->buffer_[p], bytes,
+        BROTLI_MIN(size_t, n, rb->tail_size_ - masked_pos));
+  }
+}
+
+/* Push bytes into the ring buffer. */
+static BROTLI_INLINE void RingBufferWrite(
+    MemoryManager* m, const uint8_t* bytes, size_t n, RingBuffer* rb) {
+  if (rb->pos_ == 0 && n < rb->tail_size_) {
+    /* Special case for the first write: to process the first block, we don't
+       need to allocate the whole ring-buffer and we don't need the tail
+       either. However, we do this memory usage optimization only if the
+       first write is less than the tail size, which is also the input block
+       size, otherwise it is likely that other blocks will follow and we
+       will need to reallocate to the full size anyway. */
+    rb->pos_ = (uint32_t)n;
+    RingBufferInitBuffer(m, rb->pos_, rb);
+    if (BROTLI_IS_OOM(m)) return;
+    memcpy(rb->buffer_, bytes, n);
+    return;
+  }
+  if (rb->cur_size_ < rb->total_size_) {
+    /* Lazily allocate the full buffer. */
+    RingBufferInitBuffer(m, rb->total_size_, rb);
+    if (BROTLI_IS_OOM(m)) return;
+    /* Initialize the last two bytes to zero, so that we don't have to worry
+       later when we copy the last two bytes to the first two positions. */
+    rb->buffer_[rb->size_ - 2] = 0;
+    rb->buffer_[rb->size_ - 1] = 0;
+    /* Initialize tail; might be touched by "best_len++" optimization when
+       ring buffer is "full". */
+    rb->buffer_[rb->size_] = 241;
+  }
+  {
+    const size_t masked_pos = rb->pos_ & rb->mask_;
+    /* The length of the writes is limited so that we do not need to worry
+       about a write */
+    RingBufferWriteTail(bytes, n, rb);
+    if (BROTLI_PREDICT_TRUE(masked_pos + n <= rb->size_)) {
+      /* A single write fits. */
+      memcpy(&rb->buffer_[masked_pos], bytes, n);
+    } else {
+      /* Split into two writes.
+         Copy into the end of the buffer, including the tail buffer. */
+      memcpy(&rb->buffer_[masked_pos], bytes,
+             BROTLI_MIN(size_t, n, rb->total_size_ - masked_pos));
+      /* Copy into the beginning of the buffer */
+      memcpy(&rb->buffer_[0], bytes + (rb->size_ - masked_pos),
+             n - (rb->size_ - masked_pos));
+    }
+  }
+  {
+    BROTLI_BOOL not_first_lap = (rb->pos_ & (1u << 31)) != 0;
+    uint32_t rb_pos_mask = (1u << 31) - 1;
+    rb->buffer_[-2] = rb->buffer_[rb->size_ - 2];
+    rb->buffer_[-1] = rb->buffer_[rb->size_ - 1];
+    rb->pos_ = (rb->pos_ & rb_pos_mask) + (uint32_t)(n & rb_pos_mask);
+    if (not_first_lap) {
+      /* Wrap, but preserve not-a-first-lap feature. */
+      rb->pos_ |= 1u << 31;
+    }
+  }
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_RINGBUFFER_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/state.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/state.h
new file mode 100644
index 0000000000..cb82987701
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/state.h
@@ -0,0 +1,104 @@
+/* Copyright 2022 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Encoder state. */
+
+#ifndef BROTLI_ENC_STATE_H_
+#define BROTLI_ENC_STATE_H_
+
+#include <brotli/types.h>
+
+#include "command.h"
+#include "compress_fragment.h"
+#include "compress_fragment_two_pass.h"
+#include "hash.h"
+#include "memory.h"
+#include "params.h"
+#include "ringbuffer.h"
+
+typedef enum BrotliEncoderStreamState {
+  /* Default state. */
+  BROTLI_STREAM_PROCESSING = 0,
+  /* Intermediate state; after next block is emitted, byte-padding should be
+     performed before getting back to default state. */
+  BROTLI_STREAM_FLUSH_REQUESTED = 1,
+  /* Last metablock was produced; no more input is acceptable. */
+  BROTLI_STREAM_FINISHED = 2,
+  /* Flushing compressed block and writing meta-data block header. */
+  BROTLI_STREAM_METADATA_HEAD = 3,
+  /* Writing metadata block body. */
+  BROTLI_STREAM_METADATA_BODY = 4
+} BrotliEncoderStreamState;
+
+typedef enum BrotliEncoderFlintState {
+  BROTLI_FLINT_NEEDS_2_BYTES = 2,
+  BROTLI_FLINT_NEEDS_1_BYTE = 1,
+  BROTLI_FLINT_WAITING_FOR_PROCESSING = 0,
+  BROTLI_FLINT_WAITING_FOR_FLUSHING = -1,
+  BROTLI_FLINT_DONE = -2
+} BrotliEncoderFlintState;
+
+typedef struct BrotliEncoderStateStruct {
+  BrotliEncoderParams params;
+
+  MemoryManager memory_manager_;
+
+  uint64_t input_pos_;
+  RingBuffer ringbuffer_;
+  size_t cmd_alloc_size_;
+  Command* commands_;
+  size_t num_commands_;
+  size_t num_literals_;
+  size_t last_insert_len_;
+  uint64_t last_flush_pos_;
+  uint64_t last_processed_pos_;
+  int dist_cache_[BROTLI_NUM_DISTANCE_SHORT_CODES];
+  int saved_dist_cache_[4];
+  uint16_t last_bytes_;
+  uint8_t last_bytes_bits_;
+  /* "Flint" is a tiny uncompressed block emitted before the continuation
+     block to unwire literal context from previous data. Despite being int8_t,
+     field is actually BrotliEncoderFlintState enum. */
+  int8_t flint_;
+  uint8_t prev_byte_;
+  uint8_t prev_byte2_;
+  size_t storage_size_;
+  uint8_t* storage_;
+
+  Hasher hasher_;
+
+  /* Hash table for FAST_ONE_PASS_COMPRESSION_QUALITY mode. */
+  int small_table_[1 << 10];  /* 4KiB */
+  int* large_table_;          /* Allocated only when needed */
+  size_t large_table_size_;
+
+  BrotliOnePassArena* one_pass_arena_;
+  BrotliTwoPassArena* two_pass_arena_;
+
+  /* Command and literal buffers for FAST_TWO_PASS_COMPRESSION_QUALITY. */
+  uint32_t* command_buf_;
+  uint8_t* literal_buf_;
+
+  uint64_t total_in_;
+  uint8_t* next_out_;
+  size_t available_out_;
+  uint64_t total_out_;
+  /* Temporary buffer for padding flush bits or metadata block header / body. */
+  union {
+    uint64_t u64[2];
+    uint8_t u8[16];
+  } tiny_buf_;
+  uint32_t remaining_metadata_bytes_;
+  BrotliEncoderStreamState stream_state_;
+
+  BROTLI_BOOL is_last_block_emitted_;
+  BROTLI_BOOL is_initialized_;
+} BrotliEncoderStateStruct;
+
+typedef struct BrotliEncoderStateStruct BrotliEncoderStateInternal;
+#define BrotliEncoderState BrotliEncoderStateInternal
+
+#endif  // BROTLI_ENC_STATE_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/static_dict.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/static_dict.c
new file mode 100644
index 0000000000..291d283354
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/static_dict.c
@@ -0,0 +1,542 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+#include "static_dict.h"
+
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "../common/transform.h"
+#include "encoder_dict.h"
+#include "find_match_length.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static BROTLI_INLINE uint32_t Hash(const uint8_t* data) {
+  uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kDictHashMul32;
+  /* The higher bits contain more mixture from the multiplication,
+     so we take our results from there. */
+  return h >> (32 - kDictNumBits);
+}
+
+static BROTLI_INLINE void AddMatch(size_t distance, size_t len, size_t len_code,
+                                   uint32_t* matches) {
+  uint32_t match = (uint32_t)((distance << 5) + len_code);
+  matches[len] = BROTLI_MIN(uint32_t, matches[len], match);
+}
+
+static BROTLI_INLINE size_t DictMatchLength(const BrotliDictionary* dictionary,
+                                            const uint8_t* data,
+                                            size_t id,
+                                            size_t len,
+                                            size_t maxlen) {
+  const size_t offset = dictionary->offsets_by_length[len] + len * id;
+  return FindMatchLengthWithLimit(&dictionary->data[offset], data,
+                                  BROTLI_MIN(size_t, len, maxlen));
+}
+
+static BROTLI_INLINE BROTLI_BOOL IsMatch(const BrotliDictionary* dictionary,
+    DictWord w, const uint8_t* data, size_t max_length) {
+  if (w.len > max_length) {
+    return BROTLI_FALSE;
+  } else {
+    const size_t offset = dictionary->offsets_by_length[w.len] +
+        (size_t)w.len * (size_t)w.idx;
+    const uint8_t* dict = &dictionary->data[offset];
+    if (w.transform == 0) {
+      /* Match against base dictionary word. */
+      return
+          TO_BROTLI_BOOL(FindMatchLengthWithLimit(dict, data, w.len) == w.len);
+    } else if (w.transform == 10) {
+      /* Match against uppercase first transform.
+         Note that there are only ASCII uppercase words in the lookup table. */
+      return TO_BROTLI_BOOL(dict[0] >= 'a' && dict[0] <= 'z' &&
+              (dict[0] ^ 32) == data[0] &&
+              FindMatchLengthWithLimit(&dict[1], &data[1], w.len - 1u) ==
+              w.len - 1u);
+    } else {
+      /* Match against uppercase all transform.
+         Note that there are only ASCII uppercase words in the lookup table. */
+      size_t i;
+      for (i = 0; i < w.len; ++i) {
+        if (dict[i] >= 'a' && dict[i] <= 'z') {
+          if ((dict[i] ^ 32) != data[i]) return BROTLI_FALSE;
+        } else {
+          if (dict[i] != data[i]) return BROTLI_FALSE;
+        }
+      }
+      return BROTLI_TRUE;
+    }
+  }
+}
+
+/* Finds matches for a single static dictionary */
+static BROTLI_BOOL BrotliFindAllStaticDictionaryMatchesFor(
+    const BrotliEncoderDictionary* dictionary, const uint8_t* data,
+    size_t min_length, size_t max_length, uint32_t* matches) {
+  BROTLI_BOOL has_found_match = BROTLI_FALSE;
+#if defined(BROTLI_EXPERIMENTAL)
+  if (dictionary->has_words_heavy) {
+    const BrotliTrieNode* node = &dictionary->trie.root;
+    size_t l = 0;
+    while (node && l < max_length) {
+      uint8_t c;
+      if (l >= min_length && node->len_) {
+        AddMatch(node->idx_, l, node->len_, matches);
+        has_found_match = BROTLI_TRUE;
+      }
+      c = data[l++];
+      node = BrotliTrieSub(&dictionary->trie, node, c);
+    }
+    return has_found_match;
+  }
+#endif  /* BROTLI_EXPERIMENTAL */
+  {
+    size_t offset = dictionary->buckets[Hash(data)];
+    BROTLI_BOOL end = !offset;
+    while (!end) {
+      DictWord w = dictionary->dict_words[offset++];
+      const size_t l = w.len & 0x1F;
+      const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];
+      const size_t id = w.idx;
+      end = !!(w.len & 0x80);
+      w.len = (uint8_t)l;
+      if (w.transform == 0) {
+        const size_t matchlen =
+            DictMatchLength(dictionary->words, data, id, l, max_length);
+        const uint8_t* s;
+        size_t minlen;
+        size_t maxlen;
+        size_t len;
+        /* Transform "" + BROTLI_TRANSFORM_IDENTITY + "" */
+        if (matchlen == l) {
+          AddMatch(id, l, l, matches);
+          has_found_match = BROTLI_TRUE;
+        }
+        /* Transforms "" + BROTLI_TRANSFORM_OMIT_LAST_1 + "" and
+                      "" + BROTLI_TRANSFORM_OMIT_LAST_1 + "ing " */
+        if (matchlen >= l - 1) {
+          AddMatch(id + 12 * n, l - 1, l, matches);
+          if (l + 2 < max_length &&
+              data[l - 1] == 'i' && data[l] == 'n' && data[l + 1] == 'g' &&
+              data[l + 2] == ' ') {
+            AddMatch(id + 49 * n, l + 3, l, matches);
+          }
+          has_found_match = BROTLI_TRUE;
+        }
+        /* Transform "" + BROTLI_TRANSFORM_OMIT_LAST_# + "" (# = 2 .. 9) */
+        minlen = min_length;
+        if (l > 9) minlen = BROTLI_MAX(size_t, minlen, l - 9);
+        maxlen = BROTLI_MIN(size_t, matchlen, l - 2);
+        for (len = minlen; len <= maxlen; ++len) {
+          size_t cut = l - len;
+          size_t transform_id = (cut << 2) +
+              (size_t)((dictionary->cutoffTransforms >> (cut * 6)) & 0x3F);
+          AddMatch(id + transform_id * n, len, l, matches);
+          has_found_match = BROTLI_TRUE;
+        }
+        if (matchlen < l || l + 6 >= max_length) {
+          continue;
+        }
+        s = &data[l];
+        /* Transforms "" + BROTLI_TRANSFORM_IDENTITY + <suffix> */
+        if (s[0] == ' ') {
+          AddMatch(id + n, l + 1, l, matches);
+          if (s[1] == 'a') {
+            if (s[2] == ' ') {
+              AddMatch(id + 28 * n, l + 3, l, matches);
+            } else if (s[2] == 's') {
+              if (s[3] == ' ') AddMatch(id + 46 * n, l + 4, l, matches);
+            } else if (s[2] == 't') {
+              if (s[3] == ' ') AddMatch(id + 60 * n, l + 4, l, matches);
+            } else if (s[2] == 'n') {
+              if (s[3] == 'd' && s[4] == ' ') {
+                AddMatch(id + 10 * n, l + 5, l, matches);
+              }
+            }
+          } else if (s[1] == 'b') {
+            if (s[2] == 'y' && s[3] == ' ') {
+              AddMatch(id + 38 * n, l + 4, l, matches);
+            }
+          } else if (s[1] == 'i') {
+            if (s[2] == 'n') {
+              if (s[3] == ' ') AddMatch(id + 16 * n, l + 4, l, matches);
+            } else if (s[2] == 's') {
+              if (s[3] == ' ') AddMatch(id + 47 * n, l + 4, l, matches);
+            }
+          } else if (s[1] == 'f') {
+            if (s[2] == 'o') {
+              if (s[3] == 'r' && s[4] == ' ') {
+                AddMatch(id + 25 * n, l + 5, l, matches);
+              }
+            } else if (s[2] == 'r') {
+              if (s[3] == 'o' && s[4] == 'm' && s[5] == ' ') {
+                AddMatch(id + 37 * n, l + 6, l, matches);
+              }
+            }
+          } else if (s[1] == 'o') {
+            if (s[2] == 'f') {
+              if (s[3] == ' ') AddMatch(id + 8 * n, l + 4, l, matches);
+            } else if (s[2] == 'n') {
+              if (s[3] == ' ') AddMatch(id + 45 * n, l + 4, l, matches);
+            }
+          } else if (s[1] == 'n') {
+            if (s[2] == 'o' && s[3] == 't' && s[4] == ' ') {
+              AddMatch(id + 80 * n, l + 5, l, matches);
+            }
+          } else if (s[1] == 't') {
+            if (s[2] == 'h') {
+              if (s[3] == 'e') {
+                if (s[4] == ' ') AddMatch(id + 5 * n, l + 5, l, matches);
+              } else if (s[3] == 'a') {
+                if (s[4] == 't' && s[5] == ' ') {
+                  AddMatch(id + 29 * n, l + 6, l, matches);
+                }
+              }
+            } else if (s[2] == 'o') {
+              if (s[3] == ' ') AddMatch(id + 17 * n, l + 4, l, matches);
+            }
+          } else if (s[1] == 'w') {
+            if (s[2] == 'i' && s[3] == 't' && s[4] == 'h' && s[5] == ' ') {
+              AddMatch(id + 35 * n, l + 6, l, matches);
+            }
+          }
+        } else if (s[0] == '"') {
+          AddMatch(id + 19 * n, l + 1, l, matches);
+          if (s[1] == '>') {
+            AddMatch(id + 21 * n, l + 2, l, matches);
+          }
+        } else if (s[0] == '.') {
+          AddMatch(id + 20 * n, l + 1, l, matches);
+          if (s[1] == ' ') {
+            AddMatch(id + 31 * n, l + 2, l, matches);
+            if (s[2] == 'T' && s[3] == 'h') {
+              if (s[4] == 'e') {
+                if (s[5] == ' ') AddMatch(id + 43 * n, l + 6, l, matches);
+              } else if (s[4] == 'i') {
+                if (s[5] == 's' && s[6] == ' ') {
+                  AddMatch(id + 75 * n, l + 7, l, matches);
+                }
+              }
+            }
+          }
+        } else if (s[0] == ',') {
+          AddMatch(id + 76 * n, l + 1, l, matches);
+          if (s[1] == ' ') {
+            AddMatch(id + 14 * n, l + 2, l, matches);
+          }
+        } else if (s[0] == '\n') {
+          AddMatch(id + 22 * n, l + 1, l, matches);
+          if (s[1] == '\t') {
+            AddMatch(id + 50 * n, l + 2, l, matches);
+          }
+        } else if (s[0] == ']') {
+          AddMatch(id + 24 * n, l + 1, l, matches);
+        } else if (s[0] == '\'') {
+          AddMatch(id + 36 * n, l + 1, l, matches);
+        } else if (s[0] == ':') {
+          AddMatch(id + 51 * n, l + 1, l, matches);
+        } else if (s[0] == '(') {
+          AddMatch(id + 57 * n, l + 1, l, matches);
+        } else if (s[0] == '=') {
+          if (s[1] == '"') {
+            AddMatch(id + 70 * n, l + 2, l, matches);
+          } else if (s[1] == '\'') {
+            AddMatch(id + 86 * n, l + 2, l, matches);
+          }
+        } else if (s[0] == 'a') {
+          if (s[1] == 'l' && s[2] == ' ') {
+            AddMatch(id + 84 * n, l + 3, l, matches);
+          }
+        } else if (s[0] == 'e') {
+          if (s[1] == 'd') {
+            if (s[2] == ' ') AddMatch(id + 53 * n, l + 3, l, matches);
+          } else if (s[1] == 'r') {
+            if (s[2] == ' ') AddMatch(id + 82 * n, l + 3, l, matches);
+          } else if (s[1] == 's') {
+            if (s[2] == 't' && s[3] == ' ') {
+              AddMatch(id + 95 * n, l + 4, l, matches);
+            }
+          }
+        } else if (s[0] == 'f') {
+          if (s[1] == 'u' && s[2] == 'l' && s[3] == ' ') {
+            AddMatch(id + 90 * n, l + 4, l, matches);
+          }
+        } else if (s[0] == 'i') {
+          if (s[1] == 'v') {
+            if (s[2] == 'e' && s[3] == ' ') {
+              AddMatch(id + 92 * n, l + 4, l, matches);
+            }
+          } else if (s[1] == 'z') {
+            if (s[2] == 'e' && s[3] == ' ') {
+              AddMatch(id + 100 * n, l + 4, l, matches);
+            }
+          }
+        } else if (s[0] == 'l') {
+          if (s[1] == 'e') {
+            if (s[2] == 's' && s[3] == 's' && s[4] == ' ') {
+              AddMatch(id + 93 * n, l + 5, l, matches);
+            }
+          } else if (s[1] == 'y') {
+            if (s[2] == ' ') AddMatch(id + 61 * n, l + 3, l, matches);
+          }
+        } else if (s[0] == 'o') {
+          if (s[1] == 'u' && s[2] == 's' && s[3] == ' ') {
+            AddMatch(id + 106 * n, l + 4, l, matches);
+          }
+        }
+      } else {
+        /* Set is_all_caps=0 for BROTLI_TRANSFORM_UPPERCASE_FIRST and
+               is_all_caps=1 otherwise (BROTLI_TRANSFORM_UPPERCASE_ALL)
+           transform. */
+        const BROTLI_BOOL is_all_caps =
+            TO_BROTLI_BOOL(w.transform != BROTLI_TRANSFORM_UPPERCASE_FIRST);
+        const uint8_t* s;
+        if (!IsMatch(dictionary->words, w, data, max_length)) {
+          continue;
+        }
+        /* Transform "" + kUppercase{First,All} + "" */
+        AddMatch(id + (is_all_caps ? 44 : 9) * n, l, l, matches);
+        has_found_match = BROTLI_TRUE;
+        if (l + 1 >= max_length) {
+          continue;
+        }
+        /* Transforms "" + kUppercase{First,All} + <suffix> */
+        s = &data[l];
+        if (s[0] == ' ') {
+          AddMatch(id + (is_all_caps ? 68 : 4) * n, l + 1, l, matches);
+        } else if (s[0] == '"') {
+          AddMatch(id + (is_all_caps ? 87 : 66) * n, l + 1, l, matches);
+          if (s[1] == '>') {
+            AddMatch(id + (is_all_caps ? 97 : 69) * n, l + 2, l, matches);
+          }
+        } else if (s[0] == '.') {
+          AddMatch(id + (is_all_caps ? 101 : 79) * n, l + 1, l, matches);
+          if (s[1] == ' ') {
+            AddMatch(id + (is_all_caps ? 114 : 88) * n, l + 2, l, matches);
+          }
+        } else if (s[0] == ',') {
+          AddMatch(id + (is_all_caps ? 112 : 99) * n, l + 1, l, matches);
+          if (s[1] == ' ') {
+            AddMatch(id + (is_all_caps ? 107 : 58) * n, l + 2, l, matches);
+          }
+        } else if (s[0] == '\'') {
+          AddMatch(id + (is_all_caps ? 94 : 74) * n, l + 1, l, matches);
+        } else if (s[0] == '(') {
+          AddMatch(id + (is_all_caps ? 113 : 78) * n, l + 1, l, matches);
+        } else if (s[0] == '=') {
+          if (s[1] == '"') {
+            AddMatch(id + (is_all_caps ? 105 : 104) * n, l + 2, l, matches);
+          } else if (s[1] == '\'') {
+            AddMatch(id + (is_all_caps ? 116 : 108) * n, l + 2, l, matches);
+          }
+        }
+      }
+    }
+  }
+  /* Transforms with prefixes " " and "." */
+  if (max_length >= 5 && (data[0] == ' ' || data[0] == '.')) {
+    BROTLI_BOOL is_space = TO_BROTLI_BOOL(data[0] == ' ');
+    size_t offset = dictionary->buckets[Hash(&data[1])];
+    BROTLI_BOOL end = !offset;
+    while (!end) {
+      DictWord w = dictionary->dict_words[offset++];
+      const size_t l = w.len & 0x1F;
+      const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];
+      const size_t id = w.idx;
+      end = !!(w.len & 0x80);
+      w.len = (uint8_t)l;
+      if (w.transform == 0) {
+        const uint8_t* s;
+        if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {
+          continue;
+        }
+        /* Transforms " " + BROTLI_TRANSFORM_IDENTITY + "" and
+                      "." + BROTLI_TRANSFORM_IDENTITY + "" */
+        AddMatch(id + (is_space ? 6 : 32) * n, l + 1, l, matches);
+        has_found_match = BROTLI_TRUE;
+        if (l + 2 >= max_length) {
+          continue;
+        }
+        /* Transforms " " + BROTLI_TRANSFORM_IDENTITY + <suffix> and
+                      "." + BROTLI_TRANSFORM_IDENTITY + <suffix>
+        */
+        s = &data[l + 1];
+        if (s[0] == ' ') {
+          AddMatch(id + (is_space ? 2 : 77) * n, l + 2, l, matches);
+        } else if (s[0] == '(') {
+          AddMatch(id + (is_space ? 89 : 67) * n, l + 2, l, matches);
+        } else if (is_space) {
+          if (s[0] == ',') {
+            AddMatch(id + 103 * n, l + 2, l, matches);
+            if (s[1] == ' ') {
+              AddMatch(id + 33 * n, l + 3, l, matches);
+            }
+          } else if (s[0] == '.') {
+            AddMatch(id + 71 * n, l + 2, l, matches);
+            if (s[1] == ' ') {
+              AddMatch(id + 52 * n, l + 3, l, matches);
+            }
+          } else if (s[0] == '=') {
+            if (s[1] == '"') {
+              AddMatch(id + 81 * n, l + 3, l, matches);
+            } else if (s[1] == '\'') {
+              AddMatch(id + 98 * n, l + 3, l, matches);
+            }
+          }
+        }
+      } else if (is_space) {
+        /* Set is_all_caps=0 for BROTLI_TRANSFORM_UPPERCASE_FIRST and
+               is_all_caps=1 otherwise (BROTLI_TRANSFORM_UPPERCASE_ALL)
+           transform. */
+        const BROTLI_BOOL is_all_caps =
+            TO_BROTLI_BOOL(w.transform != BROTLI_TRANSFORM_UPPERCASE_FIRST);
+        const uint8_t* s;
+        if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {
+          continue;
+        }
+        /* Transforms " " + kUppercase{First,All} + "" */
+        AddMatch(id + (is_all_caps ? 85 : 30) * n, l + 1, l, matches);
+        has_found_match = BROTLI_TRUE;
+        if (l + 2 >= max_length) {
+          continue;
+        }
+        /* Transforms " " + kUppercase{First,All} + <suffix> */
+        s = &data[l + 1];
+        if (s[0] == ' ') {
+          AddMatch(id + (is_all_caps ? 83 : 15) * n, l + 2, l, matches);
+        } else if (s[0] == ',') {
+          if (!is_all_caps) {
+            AddMatch(id + 109 * n, l + 2, l, matches);
+          }
+          if (s[1] == ' ') {
+            AddMatch(id + (is_all_caps ? 111 : 65) * n, l + 3, l, matches);
+          }
+        } else if (s[0] == '.') {
+          AddMatch(id + (is_all_caps ? 115 : 96) * n, l + 2, l, matches);
+          if (s[1] == ' ') {
+            AddMatch(id + (is_all_caps ? 117 : 91) * n, l + 3, l, matches);
+          }
+        } else if (s[0] == '=') {
+          if (s[1] == '"') {
+            AddMatch(id + (is_all_caps ? 110 : 118) * n, l + 3, l, matches);
+          } else if (s[1] == '\'') {
+            AddMatch(id + (is_all_caps ? 119 : 120) * n, l + 3, l, matches);
+          }
+        }
+      }
+    }
+  }
+  if (max_length >= 6) {
+    /* Transforms with prefixes "e ", "s ", ", " and "\xC2\xA0" */
+    if ((data[1] == ' ' &&
+         (data[0] == 'e' || data[0] == 's' || data[0] == ',')) ||
+        (data[0] == 0xC2 && data[1] == 0xA0)) {
+      size_t offset = dictionary->buckets[Hash(&data[2])];
+      BROTLI_BOOL end = !offset;
+      while (!end) {
+        DictWord w = dictionary->dict_words[offset++];
+        const size_t l = w.len & 0x1F;
+        const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];
+        const size_t id = w.idx;
+        end = !!(w.len & 0x80);
+        w.len = (uint8_t)l;
+        if (w.transform == 0 &&
+            IsMatch(dictionary->words, w, &data[2], max_length - 2)) {
+          if (data[0] == 0xC2) {
+            AddMatch(id + 102 * n, l + 2, l, matches);
+            has_found_match = BROTLI_TRUE;
+          } else if (l + 2 < max_length && data[l + 2] == ' ') {
+            size_t t = data[0] == 'e' ? 18 : (data[0] == 's' ? 7 : 13);
+            AddMatch(id + t * n, l + 3, l, matches);
+            has_found_match = BROTLI_TRUE;
+          }
+        }
+      }
+    }
+  }
+  if (max_length >= 9) {
+    /* Transforms with prefixes " the " and ".com/" */
+    if ((data[0] == ' ' && data[1] == 't' && data[2] == 'h' &&
+         data[3] == 'e' && data[4] == ' ') ||
+        (data[0] == '.' && data[1] == 'c' && data[2] == 'o' &&
+         data[3] == 'm' && data[4] == '/')) {
+      size_t offset = dictionary->buckets[Hash(&data[5])];
+      BROTLI_BOOL end = !offset;
+      while (!end) {
+        DictWord w = dictionary->dict_words[offset++];
+        const size_t l = w.len & 0x1F;
+        const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];
+        const size_t id = w.idx;
+        end = !!(w.len & 0x80);
+        w.len = (uint8_t)l;
+        if (w.transform == 0 &&
+            IsMatch(dictionary->words, w, &data[5], max_length - 5)) {
+          AddMatch(id + (data[0] == ' ' ? 41 : 72) * n, l + 5, l, matches);
+          has_found_match = BROTLI_TRUE;
+          if (l + 5 < max_length) {
+            const uint8_t* s = &data[l + 5];
+            if (data[0] == ' ') {
+              if (l + 8 < max_length &&
+                  s[0] == ' ' && s[1] == 'o' && s[2] == 'f' && s[3] == ' ') {
+                AddMatch(id + 62 * n, l + 9, l, matches);
+                if (l + 12 < max_length &&
+                    s[4] == 't' && s[5] == 'h' && s[6] == 'e' && s[7] == ' ') {
+                  AddMatch(id + 73 * n, l + 13, l, matches);
+                }
+              }
+            }
+          }
+        }
+      }
+    }
+  }
+  return has_found_match;
+}
+
+/* Finds matches for one or more dictionaries, if multiple are present
+   in the contextual dictionary */
+BROTLI_BOOL BrotliFindAllStaticDictionaryMatches(
+    const BrotliEncoderDictionary* dictionary, const uint8_t* data,
+    size_t min_length, size_t max_length, uint32_t* matches) {
+  BROTLI_BOOL has_found_match =
+      BrotliFindAllStaticDictionaryMatchesFor(
+          dictionary, data, min_length, max_length, matches);
+
+  if (!!dictionary->parent && dictionary->parent->num_dictionaries > 1) {
+    uint32_t matches2[BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1];
+    int l;
+    const BrotliEncoderDictionary* dictionary2 = dictionary->parent->dict[0];
+    if (dictionary2 == dictionary) {
+      dictionary2 = dictionary->parent->dict[1];
+    }
+
+    for (l = 0; l < BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1; l++) {
+      matches2[l] = kInvalidMatch;
+    }
+
+    has_found_match |= BrotliFindAllStaticDictionaryMatchesFor(
+        dictionary2, data, min_length, max_length, matches2);
+
+    for (l = 0; l < BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1; l++) {
+      if (matches2[l] != kInvalidMatch) {
+        uint32_t dist = (uint32_t)(matches2[l] >> 5);
+        uint32_t len_code = matches2[l] & 31;
+        uint32_t skipdist = (uint32_t)((uint32_t)(1 << dictionary->words->
+            size_bits_by_length[len_code]) & ~1u) *
+            (uint32_t)dictionary->num_transforms;
+        /* TODO(lode): check for dist overflow */
+        dist += skipdist;
+        AddMatch(dist, (size_t)l, len_code, matches);
+      }
+    }
+  }
+  return has_found_match;
+}
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/static_dict.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/static_dict.h
new file mode 100644
index 0000000000..ab832207d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/static_dict.h
@@ -0,0 +1,41 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Class to model the static dictionary. */
+
+#ifndef BROTLI_ENC_STATIC_DICT_H_
+#define BROTLI_ENC_STATIC_DICT_H_
+
+#include <brotli/types.h>
+
+#include "../common/dictionary.h"
+#include "../common/platform.h"
+#include "encoder_dict.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN 37
+static const uint32_t kInvalidMatch = 0xFFFFFFF;
+
+/* Matches data against static dictionary words, and for each length l,
+   for which a match is found, updates matches[l] to be the minimum possible
+     (distance << 5) + len_code.
+   Returns 1 if matches have been found, otherwise 0.
+   Prerequisites:
+     matches array is at least BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1 long
+     all elements are initialized to kInvalidMatch */
+BROTLI_INTERNAL BROTLI_BOOL BrotliFindAllStaticDictionaryMatches(
+    const BrotliEncoderDictionary* dictionary,
+    const uint8_t* data, size_t min_length, size_t max_length,
+    uint32_t* matches);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_STATIC_DICT_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/static_dict_lut.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/static_dict_lut.h
new file mode 100644
index 0000000000..a465ffde74
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/static_dict_lut.h
@@ -0,0 +1,5866 @@
+/* Copyright 2015 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Lookup table for static dictionary and transforms. */
+
+#ifndef BROTLI_ENC_STATIC_DICT_LUT_H_
+#define BROTLI_ENC_STATIC_DICT_LUT_H_
+
+#include <brotli/types.h>
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+typedef struct DictWord {
+  /* Highest bit is used to indicate end of bucket. */
+  uint8_t len;
+  uint8_t transform;
+  uint16_t idx;
+} DictWord;
+
+/* GENERATED CODE START */
+static const int kDictNumBits = 15;
+static const uint32_t kDictHashMul32 = 0x1E35A7BD;
+
+static const uint16_t kStaticDictionaryBuckets[32768] = {
+1,0,0,0,0,0,0,0,0,3,6,0,0,0,0,0,20,0,0,0,21,0,22,0,0,0,0,0,0,0,0,23,0,0,25,0,29,
+0,53,0,0,0,0,0,0,55,0,0,0,0,0,0,61,76,0,0,0,94,0,0,0,0,0,0,96,0,97,0,98,0,0,0,0,
+0,0,0,99,101,106,108,0,0,0,0,0,110,0,111,112,0,113,118,124,0,0,0,0,0,125,128,0,0
+,0,0,129,0,0,131,0,0,0,0,0,0,132,0,0,135,0,0,0,137,0,0,0,0,0,138,139,0,0,0,0,0,0
+,0,142,143,144,0,0,0,0,0,145,0,0,0,146,149,151,152,0,0,153,0,0,0,0,0,0,0,0,0,0,0
+,0,0,0,0,154,0,0,0,0,0,0,155,0,0,0,0,160,182,0,0,0,0,0,0,183,0,0,0,188,189,0,0,
+192,0,0,0,0,0,0,194,0,0,0,0,0,0,0,0,197,202,209,0,0,210,0,224,0,0,0,225,0,0,0,0,
+0,0,0,0,0,0,231,0,0,0,232,0,240,0,0,242,0,0,0,0,0,0,0,0,0,0,0,244,0,0,0,246,0,0,
+249,251,253,0,0,0,0,0,258,0,0,261,263,0,0,0,267,0,0,268,0,269,0,0,0,0,0,0,0,0,0,
+271,0,0,0,0,0,0,272,0,273,0,277,0,278,286,0,0,0,0,287,0,289,290,291,0,0,0,295,0,
+0,296,297,0,0,0,0,0,0,0,0,0,0,298,0,0,0,299,0,0,305,0,324,0,0,0,0,0,327,0,328,
+329,0,0,0,0,336,0,0,340,0,341,342,343,0,0,346,0,348,0,0,0,0,0,0,349,351,0,0,355,
+0,363,0,364,0,368,369,0,370,0,0,0,0,0,0,0,372,0,0,0,0,0,0,0,0,0,0,0,373,0,375,0,
+0,0,0,376,377,0,0,394,395,396,0,0,398,0,0,0,0,400,0,0,408,0,0,0,0,420,0,0,0,0,0,
+0,421,0,0,422,423,0,0,429,435,436,442,0,0,443,0,444,445,453,456,0,457,0,0,0,0,0,
+458,0,0,0,459,0,0,0,460,0,462,463,465,0,0,0,0,0,0,466,469,0,0,0,0,0,0,470,0,0,0,
+474,0,476,0,0,0,0,483,0,485,0,0,0,486,0,0,488,491,492,0,0,497,499,500,0,501,0,0,
+0,505,0,0,506,0,0,0,507,0,0,0,509,0,0,0,0,511,512,519,0,0,0,0,0,0,529,530,0,0,0,
+534,0,0,0,0,543,0,0,0,0,0,0,0,0,0,553,0,0,0,0,557,560,0,0,0,0,0,0,561,0,564,0,0,
+0,0,0,0,565,566,0,575,0,619,0,620,0,0,623,624,0,0,0,625,0,0,626,627,0,0,628,0,0,
+0,0,630,0,631,0,0,0,0,0,0,0,0,0,641,0,0,0,0,643,656,668,0,0,0,673,0,0,0,674,0,0,
+0,0,0,0,0,0,682,0,687,0,690,0,693,699,700,0,0,0,0,0,0,704,705,0,0,0,0,707,710,0,
+711,0,0,0,0,726,0,0,729,0,0,0,730,731,0,0,0,0,0,752,0,0,0,762,0,763,0,0,767,0,0,
+0,770,774,0,0,775,0,0,0,0,0,0,0,0,0,0,776,0,0,0,777,783,0,0,0,785,788,0,0,0,0,
+790,0,0,0,793,0,0,0,0,794,0,0,804,819,821,0,827,0,0,0,834,0,0,835,0,0,0,841,0,
+844,0,850,851,859,0,860,0,0,0,0,0,0,0,874,0,876,0,877,890,0,0,0,0,0,0,0,0,893,
+894,898,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,899,0,0,0,900,904,906,0,0,0,907,0,908,909,
+0,910,0,0,0,0,911,0,0,0,0,0,916,0,0,0,922,925,0,930,0,934,0,0,0,0,0,943,0,0,944,
+0,953,954,0,0,0,0,0,0,955,0,962,963,0,0,976,0,0,977,978,979,980,0,981,0,0,0,0,
+984,0,0,985,0,0,987,989,991,0,0,0,0,0,0,0,0,0,992,0,0,0,993,0,0,0,0,0,0,996,0,0,
+0,1000,0,0,0,0,0,1002,0,0,0,0,1005,1007,0,0,0,1009,0,0,0,1010,0,0,0,0,0,0,1011,0
+,1012,0,0,0,0,1014,1016,0,0,0,1020,0,1021,0,0,0,0,1022,0,0,0,1024,0,0,0,0,0,0,
+1025,0,0,1026,1027,0,0,0,0,0,1031,0,1033,0,0,0,0,1034,0,0,0,1037,1040,0,0,0,1042
+,1043,0,0,1053,0,1054,0,0,1057,0,0,0,1058,0,0,1060,0,0,0,0,0,0,0,1061,0,0,1062,0
+,0,0,0,1063,0,0,0,0,1064,0,0,0,0,0,1065,0,0,0,0,1066,1067,0,0,0,1069,1070,1072,0
+,0,0,0,0,0,1073,0,1075,0,0,0,0,0,0,1080,1084,0,0,0,0,1088,0,0,0,0,0,0,1094,0,
+1095,0,1107,0,0,0,1112,1114,0,1119,0,1122,0,0,1126,0,1129,0,1130,0,0,0,0,0,1132,
+0,0,0,0,0,0,1144,0,0,1145,1146,0,1148,1149,0,0,1150,1151,0,0,0,0,1152,0,1153,0,0
+,0,0,0,1154,0,1163,0,0,0,1164,0,0,0,0,0,1165,0,1167,0,1170,0,0,0,0,0,1171,1172,0
+,0,0,0,0,0,0,0,1173,1175,1177,0,1186,0,0,0,0,0,0,0,0,0,0,1195,0,0,1221,0,0,1224,
+0,0,1227,0,0,0,0,0,1228,1229,0,0,1230,0,0,0,0,0,0,0,0,0,1231,0,0,0,1233,0,0,1243
+,1244,1246,1248,0,0,0,0,1254,1255,1258,1259,0,0,0,1260,0,0,1261,0,0,0,1262,1264,
+0,0,1265,0,0,0,0,0,0,0,0,0,0,0,0,1266,0,1267,0,0,0,0,1273,1274,1276,1289,0,0,
+1291,1292,1293,0,0,1294,1295,1296,0,0,0,0,1302,0,1304,0,0,0,0,0,0,0,0,0,1311,
+1312,0,1314,0,1316,1320,1321,0,0,0,0,0,0,0,1322,1323,1324,0,1335,0,1336,0,0,0,0,
+1341,1342,0,1346,0,1357,0,0,0,1358,1360,0,0,0,0,0,0,1361,0,0,0,1362,1365,0,1366,
+0,0,0,0,0,0,0,1379,0,0,0,0,0,0,0,0,0,0,0,0,1386,0,1388,0,0,0,0,0,0,0,0,0,0,0,0,0
+,0,1395,0,0,0,0,1403,0,1405,0,0,1407,0,0,0,0,0,1408,1409,0,1410,0,0,0,1412,1413,
+1416,0,0,1429,1451,0,0,1454,0,0,0,0,0,0,0,1455,0,0,0,0,0,0,0,1456,0,0,0,0,1459,
+1460,1461,1475,0,0,0,0,0,0,1477,0,1480,0,1481,0,0,1486,0,0,1495,0,0,0,1496,0,0,
+1498,1499,1501,1520,1521,0,0,0,1526,0,0,0,0,1528,1529,0,1533,1536,0,0,0,1537,
+1538,1549,0,1550,1558,1559,1572,0,1573,0,0,0,0,0,0,0,0,0,1575,0,0,0,0,0,1579,0,
+1599,0,1603,0,1604,0,1605,0,0,0,0,0,1608,1610,0,0,0,0,1611,0,1615,0,1616,1618,0,
+1619,0,0,1622,0,0,0,0,1634,0,0,0,1635,0,0,0,1641,0,0,0,0,0,0,0,0,0,1643,0,0,0,
+1650,0,0,1652,0,0,0,0,0,1653,0,0,0,1654,0,0,0,0,1655,0,1662,0,0,1663,1664,0,0,
+1668,0,0,1669,1670,0,1672,1673,0,0,0,0,0,1674,0,0,0,1675,1676,1680,0,1682,0,0,
+1687,0,0,0,0,0,1704,0,0,1705,0,0,1721,0,0,0,0,1734,1735,0,0,0,0,1737,0,0,0,0,
+1739,0,0,1740,0,0,0,0,0,0,0,0,0,0,1741,1743,0,0,0,0,1745,0,0,0,1749,0,0,0,1751,0
+,0,0,0,0,0,1760,0,0,0,0,1765,0,0,0,0,0,1784,0,1785,1787,0,0,0,0,1788,1789,0,0,0,
+0,1790,1791,1793,0,1798,1799,0,0,0,0,1801,0,1803,1805,0,0,0,1806,1811,0,1812,
+1814,0,1821,0,0,0,0,0,1822,1833,0,0,0,0,0,0,1848,0,0,0,0,0,0,1857,0,0,0,1859,0,0
+,0,0,1861,0,0,0,0,0,0,0,1866,0,1921,1925,0,0,0,1929,1930,0,0,0,0,0,0,0,0,0,1931,
+0,0,0,0,1932,0,0,0,1934,0,0,0,0,0,0,0,0,1946,0,0,1948,0,0,0,0,1950,0,1957,0,1958
+,0,0,0,0,0,1965,1967,0,0,0,0,1968,0,1969,0,1971,1972,0,0,0,0,0,0,0,0,0,0,0,0,0,0
+,0,1973,0,0,0,0,1975,0,0,0,0,1976,1979,0,1982,0,0,0,0,1984,1988,0,0,0,0,1990,
+2004,2008,0,0,0,2012,2013,0,0,0,0,0,0,0,0,0,0,2015,0,2016,2017,0,0,0,0,2021,0,0,
+2025,0,0,0,0,0,2029,2036,2040,0,2042,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2043,0,0,0,0,0,
+2045,0,0,0,0,0,0,0,2046,2047,0,2048,2049,0,2059,0,0,2063,0,2064,2065,0,0,2066,0,
+0,0,0,0,0,2069,0,0,0,0,2070,0,2071,0,2072,0,0,0,0,2080,2082,2083,0,0,0,0,0,2085,
+0,2086,2088,2089,2105,0,0,0,0,2107,0,0,2116,2117,0,2120,0,0,2122,0,0,0,0,0,2123,
+0,0,2125,2127,2128,0,0,0,2130,0,0,0,2137,2139,2140,2141,0,0,0,0,0,0,0,0,0,2144,
+2145,0,0,2146,2149,0,0,0,0,2150,0,0,2151,2158,0,2159,0,2160,0,0,0,0,0,0,2161,
+2162,0,0,2194,2202,0,0,0,0,0,0,2205,2217,0,2220,0,2221,0,2222,2224,0,0,0,0,2237,
+0,0,0,0,0,2238,0,2239,2241,0,0,2242,0,0,0,0,0,2243,0,0,0,0,0,0,2252,0,0,2253,0,0
+,0,2257,2258,0,0,0,2260,0,0,0,0,0,0,0,2262,0,2264,0,0,0,0,0,2269,2270,0,0,0,0,0,
+0,0,0,0,2271,0,2273,0,0,0,0,2277,0,0,0,0,2278,0,0,0,0,2279,0,2280,0,2283,0,0,0,0
+,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2287,0,0,0,0,0,0,0,2289,2290,0,0,0,0,2291,0,2292,0,
+0,0,2293,2295,2296,0,0,0,0,0,0,0,2298,0,0,0,0,0,2303,0,2305,0,0,2306,0,2307,0,0,
+0,0,0,0,0,0,0,0,0,0,2313,2314,2315,2316,0,0,2318,0,2319,0,2322,0,0,2323,0,2324,0
+,2326,0,0,0,0,0,0,0,2335,0,2336,2338,2339,0,2340,0,0,0,2355,0,2375,0,2382,2386,0
+,2387,0,0,2394,0,0,0,0,2395,0,2397,0,0,0,0,0,2398,0,0,0,0,0,0,0,2399,2402,2404,
+2408,2411,0,0,0,2413,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2415,0,0,2416,2417,2419,0,2420,
+0,0,0,0,0,2425,0,0,0,2426,0,0,0,0,0,0,0,0,0,0,0,0,2427,2428,0,2429,0,0,2430,2434
+,0,2436,0,0,0,0,0,0,2441,2442,0,2445,0,0,2446,2457,0,2459,0,0,2462,0,2464,0,2477
+,0,2478,2486,0,0,0,2491,0,0,2493,0,0,2494,0,2495,0,2513,2523,0,0,0,0,2524,0,0,0,
+0,0,0,2528,2529,2530,0,0,2531,0,2533,0,0,2534,2535,0,2536,2537,0,2538,0,2539,
+2540,0,0,0,2545,2546,0,0,0,0,0,0,0,2548,0,0,2549,0,2550,2555,0,0,0,0,0,2557,0,
+2560,0,0,0,0,0,0,0,0,0,0,0,2561,0,2576,0,0,0,0,0,0,0,0,0,2577,2578,0,0,0,2579,0,
+0,0,0,0,0,0,2580,0,0,0,0,2581,0,0,0,0,2583,0,2584,0,2588,2590,0,0,0,2591,0,0,0,0
+,2593,2594,0,2595,0,2601,2602,0,0,2603,0,2605,0,0,0,2606,2607,2611,0,2615,0,0,0,
+2617,0,0,0,0,0,0,0,0,0,0,0,0,0,2619,0,0,2620,0,0,0,2621,0,2623,0,2625,0,0,2628,
+2629,0,0,2635,2636,2637,0,0,2639,0,0,0,2642,0,0,0,0,2643,0,2644,0,2649,0,0,0,0,0
+,0,2655,2656,0,0,2657,0,0,0,0,0,2658,0,0,0,0,0,2659,0,0,0,0,2664,2685,0,2687,0,
+2688,0,0,2689,0,0,2694,0,2695,0,0,2698,0,2701,2706,0,0,0,2707,0,2709,2710,2711,0
+,0,0,2720,2730,2735,0,0,0,0,2738,2740,0,0,0,0,2747,0,0,0,0,0,0,2748,0,0,2749,0,0
+,0,0,0,2750,0,0,2752,2754,0,0,0,0,0,2758,0,0,0,0,2762,0,0,0,0,2763,0,0,0,0,0,0,0
+,2764,2767,0,0,0,0,2768,0,0,2770,0,0,0,0,0,0,0,2771,0,0,0,0,0,0,0,0,0,2772,0,0,0
+,0,0,2773,2776,0,0,2783,0,0,2784,0,2789,0,2790,0,0,0,2792,0,0,0,0,0,0,0,0,0,0,
+2793,2795,0,0,0,0,0,0,2796,0,0,0,0,0,0,2797,2799,0,0,0,0,2803,0,0,0,0,2806,0,
+2807,2808,2817,2819,0,0,0,0,0,2821,0,0,0,0,2822,2823,0,0,0,0,0,0,0,2824,0,0,2828
+,0,2834,0,0,0,0,0,0,2836,0,2838,0,0,2839,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2841,
+0,0,0,2842,0,0,0,0,0,2843,2844,0,0,0,0,2846,0,0,2847,0,2849,0,2853,0,0,0,0,0,
+2857,0,0,0,0,2858,0,2859,0,0,2860,0,2862,2868,0,0,0,0,2875,0,2876,0,0,2877,2878,
+2884,2889,2890,0,0,2891,0,0,2892,0,0,0,2906,2912,0,2913,0,0,0,0,0,0,0,0,2916,0,
+2934,0,0,0,0,0,2935,0,0,0,0,2939,0,2940,0,0,0,0,0,0,0,2941,0,0,0,2946,0,2949,0,0
+,2950,2954,2955,0,0,0,2959,2961,0,0,2962,0,2963,0,0,0,0,0,0,2964,2965,2966,2967,
+0,0,0,0,0,0,0,2969,0,0,0,0,0,2970,2975,0,2982,2983,2984,0,0,0,0,0,2989,0,0,2990,
+0,0,0,0,0,0,0,2991,0,0,0,0,0,0,0,0,2998,0,3000,3001,0,0,3002,0,0,0,3003,0,0,3012
+,0,0,3022,0,0,3024,0,0,3025,3027,0,0,0,3030,0,0,0,0,3034,3035,0,0,3036,0,3039,0,
+3049,0,0,3050,0,0,0,0,0,0,3051,0,3053,0,0,0,0,3057,0,3058,0,0,0,0,0,0,0,0,3063,0
+,0,3073,3074,3078,3079,0,3080,3086,0,0,0,0,0,0,0,0,3087,0,3092,0,3095,0,3099,0,0
+,0,3100,0,3101,3102,0,3122,0,0,0,3124,0,3125,0,0,0,0,0,0,3132,3134,0,0,3136,0,0,
+0,0,0,0,0,3147,0,0,3149,0,0,0,0,0,3150,3151,3152,0,0,0,0,3158,0,0,3160,0,0,3161,
+0,0,3162,0,3163,3166,3168,0,0,3169,3170,0,0,3171,0,0,0,0,0,0,0,3182,0,3184,0,0,
+3188,0,0,3194,0,0,0,0,0,0,3204,0,0,0,0,3209,0,0,0,0,0,0,0,0,0,0,0,3216,3217,0,0,
+0,0,0,0,0,3219,0,0,3220,3222,0,3223,0,0,0,0,3224,0,3225,3226,0,3228,3233,0,3239,
+3241,3242,0,0,3251,3252,3253,3255,0,0,0,0,0,0,0,0,3260,0,0,3261,0,0,0,3267,0,0,0
+,0,0,0,0,0,3271,0,0,0,3278,0,3282,0,0,0,3284,0,0,0,3285,3286,0,0,0,0,0,0,0,3287,
+3292,0,0,0,0,3294,3296,0,0,3299,3300,3301,0,3302,0,0,0,0,0,3304,3306,0,0,0,0,0,0
+,3308,0,0,0,0,0,0,0,0,0,3311,0,0,0,0,0,0,0,0,3312,3314,3315,0,3318,0,0,0,0,0,0,0
+,0,3319,0,0,0,0,0,3321,0,0,0,0,0,0,0,0,0,3322,0,0,3324,3325,0,0,3326,0,0,3328,
+3329,3331,0,0,3335,0,0,3337,0,3338,0,0,0,0,3343,3347,0,0,0,3348,0,0,3351,0,0,0,0
+,0,0,3354,0,0,0,0,0,0,0,0,0,0,3355,0,0,3365,3366,3367,0,0,0,0,0,0,3368,3369,0,
+3370,0,0,3373,0,0,3376,0,0,3377,0,3379,3387,0,0,0,0,0,3390,0,0,0,0,0,0,0,3402,0,
+3403,3436,3437,3439,0,0,3441,0,0,0,3442,0,0,3449,0,0,0,3450,0,0,0,0,0,0,0,3451,0
+,0,3452,0,3453,3456,0,3457,0,0,3458,0,3459,0,0,0,0,0,0,0,0,0,3460,0,0,3469,3470,
+0,0,3475,0,0,0,3480,3487,3489,0,3490,0,0,3491,3499,0,3500,0,0,3501,0,0,0,3502,0,
+3514,0,0,0,3516,3517,0,0,0,3518,0,0,0,0,3520,3521,3522,0,0,3526,3530,0,0,0,0,
+3531,0,0,0,0,3536,0,0,0,0,0,0,0,3539,3541,0,0,3542,3544,0,3547,3548,0,0,3550,0,
+3553,0,0,0,0,0,0,0,3554,0,3555,0,3558,0,3559,0,0,0,0,0,0,0,0,3563,0,3581,0,0,0,
+3599,0,0,0,3600,0,3601,0,3602,3603,0,0,3606,3608,0,3610,3611,0,0,0,0,0,0,0,0,0,
+3612,3616,3619,0,0,0,0,0,0,0,0,0,0,0,0,0,3624,3628,0,3629,3634,3635,0,0,0,0,0,0,
+3636,0,3637,0,0,3638,3651,0,0,0,0,0,0,3652,3653,0,0,0,0,3656,3657,0,0,0,0,0,3658
+,0,0,0,0,3659,0,3661,3663,3664,0,3665,0,3692,0,0,0,3694,3696,0,0,0,0,0,0,0,0,0,0
+,0,0,3698,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3700,0,0,3701,0,0,0,3708,3709,0,0,0,3711
+,3712,0,0,0,0,0,3723,0,3724,3725,0,0,3726,0,0,0,0,0,0,3728,3729,0,3734,3735,3737
+,0,0,0,3743,0,3745,0,0,3746,0,0,3747,3748,0,3757,0,3759,3766,3767,0,3768,0,0,0,0
+,3769,0,0,3771,0,3774,0,0,0,0,0,0,3775,0,0,0,0,0,0,3776,0,3777,3786,0,3788,3789,
+0,0,0,0,0,0,0,0,0,3791,0,3811,0,0,0,0,0,3814,3815,3816,3820,0,0,0,0,0,0,0,3821,0
+,0,3825,0,0,0,0,3835,0,0,3848,3849,0,0,0,0,3850,3851,3853,0,0,0,0,3859,0,3860,
+3862,0,0,0,0,0,3863,0,0,0,0,0,0,0,0,3873,0,3874,0,3875,3886,0,3887,0,0,0,0,3892,
+3913,0,3914,0,0,0,3925,3931,0,0,0,0,3934,3941,3942,0,0,0,0,3943,0,0,0,3944,0,0,0
+,0,0,3945,0,3947,0,0,0,3956,3957,0,0,0,0,0,0,0,0,0,3958,0,3959,3965,0,0,0,0,3966
+,0,0,0,3967,0,0,0,3968,3974,0,0,0,0,0,3975,3977,3978,0,0,0,0,3980,0,3985,0,0,0,0
+,0,0,0,0,3986,4011,0,0,4017,0,0,0,0,0,0,0,0,0,0,0,4018,0,0,0,0,4019,0,4023,0,0,0
+,4027,4028,0,0,0,0,0,0,0,0,4031,4034,0,0,4035,4037,4039,4040,0,0,0,0,0,4059,0,
+4060,4061,0,4062,4063,4066,0,0,4072,0,0,0,0,0,0,0,0,0,0,0,0,0,4088,0,0,0,0,0,
+4091,0,0,0,0,4094,4095,0,0,4096,0,0,0,0,0,4098,4099,0,0,0,4101,0,4104,0,0,0,4105
+,4108,0,4113,0,0,4115,4116,0,4126,0,0,4127,0,0,0,0,0,0,0,4128,4132,4133,0,4134,0
+,0,0,4137,0,0,4141,0,0,0,0,4144,4146,4147,0,0,0,0,4148,0,0,4311,0,0,0,4314,4329,
+0,4331,4332,0,4333,0,4334,0,0,0,4335,0,4336,0,0,0,4337,0,0,0,4342,4345,4346,4350
+,0,4351,4352,0,4354,4355,0,0,4364,0,0,0,0,4369,0,0,0,4373,0,4374,0,0,0,0,4377,0,
+0,0,0,4378,0,0,0,4380,0,0,0,4381,4382,0,0,0,0,0,0,0,4384,0,0,0,0,4385,0,0,0,4386
+,0,0,0,4391,4398,0,0,0,0,4407,4409,0,0,0,0,4410,0,0,4411,0,4414,4415,4418,0,4427
+,4428,4430,0,4431,0,4448,0,0,0,0,0,4449,0,0,0,4451,4452,0,4453,4454,0,4456,0,0,0
+,0,0,0,0,4459,0,4463,0,0,0,0,0,4466,0,4467,0,4469,0,0,0,0,0,0,0,0,0,0,0,0,0,4470
+,4471,0,4473,0,0,4475,0,0,0,0,4477,4478,0,0,0,4479,4481,0,4482,0,4484,0,0,0,0,0,
+0,0,4486,0,0,4488,0,0,4497,0,4508,0,0,4510,4511,0,4520,4523,0,4524,0,4525,0,4527
+,0,0,4528,0,0,0,0,4530,0,4531,0,0,4532,0,0,0,4533,0,0,0,0,0,4535,0,0,0,4536,0,0,
+0,0,0,4541,4543,4544,4545,4547,0,4548,0,0,0,0,4550,4551,0,4553,0,0,0,0,4562,0,0,
+4571,0,0,0,4574,0,0,0,4575,0,4576,0,4577,0,0,0,4581,0,0,0,0,0,4582,0,0,4586,0,0,
+0,4588,0,0,4597,0,4598,0,0,0,0,4616,4617,0,4618,0,0,0,0,4619,0,4620,0,0,4621,0,
+4624,0,0,0,0,0,4625,0,0,0,0,4657,0,4659,0,4667,0,0,0,4668,4670,0,4672,0,0,0,0,0,
+4673,4676,0,0,0,0,4687,0,0,0,0,4697,0,0,0,0,4699,0,4701,0,0,0,0,4702,0,0,4706,0,
+0,4713,0,0,0,4714,4715,4716,0,0,0,0,0,0,0,0,0,0,0,0,4717,0,0,4720,0,4721,4729,
+4735,0,0,0,4737,0,0,0,4739,0,0,0,4740,0,0,0,4741,0,0,0,0,0,4742,0,4745,4746,4747
+,0,0,0,0,0,0,0,0,4748,0,0,0,4749,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4751,
+4786,0,4787,0,4788,4796,0,0,4797,4798,0,4799,4806,4807,0,0,0,0,4809,4810,0,0,0,0
+,0,0,4811,0,0,0,0,0,4812,0,4813,0,0,4815,0,4821,4822,0,0,0,0,4823,0,0,0,0,0,0,0,
+0,0,0,4824,0,0,0,0,4826,0,0,0,4828,0,4829,0,0,0,4843,0,0,4847,0,4853,4855,4858,0
+,0,0,0,0,4859,0,4864,0,0,4879,0,0,0,0,4880,0,0,0,0,4881,0,4882,0,0,0,0,0,0,0,0,0
+,4883,0,0,0,0,4884,0,0,0,0,0,4886,4887,4888,4894,4896,0,4902,0,0,4905,0,0,4915,0
+,0,0,0,0,0,0,4916,4917,4919,4921,0,0,0,0,0,4926,0,0,0,0,4927,0,0,0,0,0,0,0,0,
+4929,0,4930,4931,0,4938,0,4952,0,4953,4957,4960,4964,0,0,0,0,0,0,0,5019,5020,
+5022,0,0,0,0,0,5023,0,0,0,5024,0,0,0,5025,0,0,0,0,5028,0,0,0,0,5029,5030,5031,0,
+5033,0,0,0,0,0,0,0,0,0,5034,5035,0,5036,0,0,5037,0,0,0,0,5038,0,0,5039,0,0,0,
+5041,5042,0,0,0,0,5044,5049,5054,0,5055,0,5057,0,0,0,5060,0,0,0,0,0,5063,0,5064,
+5065,0,5067,0,0,0,5068,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5076,0,0,0,0,0,0,
+0,5077,0,0,5078,5080,0,0,5083,0,0,0,0,0,0,0,0,5085,0,0,0,0,0,0,5098,5099,5101,
+5105,5107,0,5108,0,5109,0,0,0,0,0,0,0,5110,0,0,0,0,0,5117,5118,0,5121,0,5122,0,0
+,5130,0,0,0,5137,0,0,0,5148,0,0,0,0,0,0,0,5151,5154,0,0,0,5155,0,0,5156,5159,
+5161,0,0,0,0,5162,0,0,0,0,5163,5164,0,5166,0,0,0,0,0,0,0,0,0,0,5167,0,0,0,5172,0
+,0,0,0,0,0,5178,5179,0,0,5190,0,0,5191,5192,5194,0,0,5198,5201,0,0,0,0,0,5203,0,
+5206,5209,0,0,0,0,0,0,5213,0,5214,5216,0,0,0,0,0,5217,0,0,0,0,0,0,0,0,5218,5219,
+0,5231,0,0,5244,5249,0,5254,0,5255,0,0,5257,0,0,0,0,0,5258,0,5260,5270,0,5277,0,
+0,0,0,0,0,5280,5281,5282,5283,0,0,0,0,0,5284,0,5285,0,0,0,0,0,5287,5288,0,0,0,0,
+0,0,0,0,0,0,5289,5291,0,0,5294,0,0,5295,0,0,0,0,0,0,0,5304,0,0,5306,5307,5308,0,
+5309,0,0,5310,0,0,0,0,5311,5312,0,5313,0,0,0,0,0,5316,0,0,0,5317,0,0,0,0,0,0,0,0
+,0,5325,0,0,0,0,0,0,5326,0,5327,5329,0,5332,0,0,0,0,5338,0,0,0,0,0,0,0,0,5340,0,
+0,5341,0,0,0,5342,0,5343,5344,0,0,5345,0,0,0,0,0,0,5347,5348,0,0,0,0,0,0,0,0,0,
+5349,0,5350,0,5354,0,0,0,0,5358,0,0,5359,0,0,5361,0,0,5365,0,5367,0,5373,0,0,0,
+5379,0,0,0,5380,0,0,0,5382,0,5384,0,0,0,0,0,0,5385,0,0,0,0,5387,0,0,0,0,0,0,5388
+,5390,5393,0,0,0,0,0,0,0,0,0,0,0,5396,0,0,0,0,5397,5402,0,0,0,0,0,5403,0,0,0,
+5404,5405,0,0,0,0,0,0,0,0,0,0,0,0,5406,0,0,0,0,5410,0,0,5411,0,5415,0,0,0,0,5416
+,5434,0,0,0,0,0,0,0,0,0,0,0,5438,0,5440,0,0,0,0,0,0,5441,5442,0,0,0,5443,5444,
+5447,0,0,5448,5449,5451,0,0,0,5456,5457,0,0,0,5459,0,0,0,5461,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,5464,0,5466,0,0,5467,0,5470,0,0,5473,0,0,5474,0,0,5476,0,0,0,0,0,0,0,0
+,0,0,0,5477,0,0,0,0,0,0,0,5484,0,0,5485,5486,0,0,0,0,0,5488,0,0,0,0,0,0,0,5489,0
+,0,0,0,0,5507,0,0,0,5510,0,5511,0,0,5512,0,0,0,5513,0,5515,0,0,5516,5517,0,5518,
+0,0,5522,0,0,0,0,0,5534,5535,0,0,5536,0,5538,0,0,5543,0,5544,0,0,5545,0,5547,0,
+5557,0,0,5558,0,5560,5567,0,0,0,0,5568,0,0,0,5571,5573,0,5574,0,5575,0,0,0,0,
+5577,0,0,5598,0,0,0,0,0,0,0,0,0,5600,5609,0,0,0,0,5610,0,0,5612,0,5624,0,5625,0,
+0,0,5629,0,5641,0,5642,5643,0,0,0,0,0,0,5651,0,0,0,5652,5653,0,5661,5662,5678,0,
+5679,0,0,0,0,5685,5686,0,0,0,0,0,5690,5692,0,5703,0,0,0,0,0,5706,0,0,0,0,5707,0,
+0,0,0,0,0,5708,0,0,5709,0,5710,0,0,0,5712,0,5733,0,5734,5735,0,0,5744,5751,0,0,0
+,0,0,0,0,0,0,0,0,0,5752,0,5754,0,0,0,0,0,0,5757,5758,0,5760,5761,0,0,0,0,5763,
+5764,5765,0,5766,0,5767,5768,0,5770,0,0,0,0,5776,5780,0,0,0,0,5782,0,0,0,0,5784,
+0,0,5788,0,0,0,0,0,0,0,0,0,0,0,5797,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5799,0,0,5801,
+0,0,0,5811,0,0,0,0,0,0,5816,0,0,5827,0,0,0,0,0,0,0,0,5830,5831,0,0,5832,0,0,5833
+,0,5835,5844,5845,0,5846,0,0,0,0,0,5850,0,0,0,0,0,5852,0,5855,5857,0,0,5859,0,
+5861,0,0,5863,0,5865,0,0,0,5873,5875,0,0,0,5877,0,5879,0,0,0,5888,0,0,5889,5891,
+0,5894,0,0,0,0,0,0,5895,0,5897,0,0,0,0,0,0,5907,0,5911,0,0,5912,0,5913,5922,5924
+,0,5927,5928,0,0,0,0,5929,5930,0,5933,0,0,0,0,5949,0,0,5951,0,0,0,0,0,0,0,0,5953
+,0,0,5954,0,5959,5960,5961,0,5964,0,0,0,5976,5978,5987,5990,0,0,0,0,0,5991,0,
+5992,0,0,0,5994,5995,0,0,5996,0,0,6001,6003,0,0,0,0,6007,0,0,0,0,0,6008,0,0,6009
+,0,6010,0,0,0,6011,6015,0,6017,0,6019,0,6023,0,0,0,0,0,0,0,6025,0,0,0,0,0,0,0,0,
+0,0,6026,0,6030,0,0,6032,0,0,0,6033,6038,6040,0,0,0,6041,6045,0,0,6046,0,0,6053,
+0,0,6054,0,6055,0,0,0,0,0,0,6057,0,6063,0,0,0,6064,0,6066,6071,6072,0,0,0,0,0,0,
+6075,6076,0,0,6077,0,0,0,0,0,0,0,0,0,6078,6079,0,0,0,0,0,0,0,0,6080,0,6083,0,0,0
+,0,0,6084,0,0,6088,0,6089,0,0,6093,6105,0,0,6107,0,6110,0,0,0,6111,6125,6126,0,0
+,0,6129,0,0,0,0,6130,0,0,0,6131,6134,0,0,0,0,0,0,6142,0,0,0,0,0,6144,0,0,6146,
+6151,6153,0,6156,0,6163,0,6180,6181,0,0,0,0,0,6182,0,0,0,0,6184,6195,0,0,6206,0,
+6208,0,0,6212,6213,6214,0,6215,0,0,0,6228,0,0,0,6234,0,0,0,0,0,0,6235,6240,0,
+6242,6243,6244,0,6250,6255,0,0,0,0,0,6257,0,0,0,6258,6278,0,6284,0,0,0,6285,0,0,
+0,0,0,0,0,0,6286,0,0,0,6320,0,0,6322,6332,0,0,0,0,0,0,0,0,6334,0,0,0,0,0,0,0,
+6335,0,0,6337,0,6338,0,6339,6340,0,0,6356,6357,6369,0,0,0,6370,6371,6372,0,6373,
+0,0,0,0,0,6376,0,0,0,0,0,6382,6383,6384,0,0,0,0,6386,0,6389,6397,6400,6411,0,
+6414,0,0,0,0,0,0,0,6415,6416,0,0,0,0,0,0,6417,0,0,0,0,6418,0,0,0,0,0,0,0,6420,0,
+6421,6423,6425,0,6429,6430,0,6433,6438,0,0,0,0,0,0,0,0,0,0,6439,6440,0,0,6441,0,
+0,6444,0,0,0,0,6446,0,0,0,0,6447,6448,0,0,6450,0,0,0,6454,0,0,6455,0,6461,0,0,0,
+0,0,0,6462,0,0,6463,0,6464,0,6465,6467,0,0,0,6468,0,6479,6480,0,0,0,0,0,0,0,6481
+,0,0,6485,6487,0,0,0,0,0,0,6493,0,0,0,0,0,0,0,0,6494,6495,6496,0,0,0,0,0,6498,0,
+0,0,6507,6508,0,0,0,0,0,0,0,0,0,0,6511,6512,0,0,0,0,6513,0,0,0,6514,0,0,0,0,0,
+6516,0,0,6517,6518,0,0,0,6519,6520,6521,0,6523,0,0,0,0,6524,6528,0,6530,0,0,6532
+,0,6578,0,0,0,6583,0,6584,0,0,0,6587,0,0,0,6590,0,6591,0,0,0,0,0,6592,0,0,0,0,
+6593,6594,0,0,0,0,0,6599,6600,0,0,6601,6602,6604,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+6608,0,0,0,0,0,0,0,0,6610,6611,0,6615,0,6616,6618,6620,0,6637,0,0,0,0,6639,0,0,0
+,0,6641,0,6642,0,0,0,6647,0,6660,6663,0,6664,0,6666,6669,0,6675,6676,6677,0,0,0,
+0,0,0,0,0,0,6678,0,0,0,6679,0,6680,0,0,0,0,0,0,0,6693,0,0,0,0,0,0,0,0,0,6704,
+6705,6706,0,0,6711,6713,0,0,0,0,0,6716,0,0,0,6717,0,6719,6724,0,0,0,0,0,0,0,0,
+6725,6726,0,0,0,0,0,6728,6729,6735,0,6737,6742,0,0,6743,6750,0,6751,0,0,6752,
+6753,0,0,0,0,0,0,6754,0,0,0,0,0,6756,0,0,0,0,0,0,6763,0,0,6764,6765,0,0,0,6770,0
+,0,0,6776,6780,0,6781,0,0,0,6783,0,6784,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+6785,0,0,0,6792,0,0,0,6793,0,0,6802,0,0,0,0,0,6803,0,0,0,6804,0,0,0,6812,0,0,
+6823,0,6824,6839,0,0,0,0,6852,0,0,6854,0,6856,6857,0,0,0,0,0,0,0,0,0,6867,0,6868
+,6870,6872,0,0,0,6873,6874,0,0,0,0,0,6875,0,0,6877,0,0,0,0,0,0,0,6878,0,0,0,6879
+,0,6880,0,0,0,0,0,0,0,0,0,0,6887,0,6888,6891,6893,0,6895,0,0,0,0,0,0,0,0,6899,0,
+0,0,0,6901,0,0,0,0,6910,0,6911,0,0,6912,0,0,6913,6914,0,0,0,6915,0,0,0,6916,6919
+,0,0,0,0,0,0,6924,0,6925,0,0,0,6926,6927,6928,0,6929,0,6930,0,0,6931,6935,0,6936
+,0,0,0,0,6939,6940,6941,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6942,6948,6949,0,0,0,0,0,0
+,0,6952,6954,6963,6965,6966,0,0,6967,6968,0,0,0,0,0,0,0,0,0,6969,0,0,6970,6979,0
+,0,6980,0,0,6983,0,0,0,0,0,6984,0,0,0,0,0,0,0,6988,6990,6992,0,0,0,0,0,0,0,6995,
+0,0,0,7012,0,0,0,0,0,0,0,0,0,7019,0,0,0,0,0,0,0,0,7021,0,0,7022,7023,7028,0,7030
+,7033,0,0,0,0,0,0,7038,0,0,0,0,0,0,0,0,0,0,7039,0,0,0,0,0,7046,0,7047,0,0,0,0,0,
+0,0,0,0,0,0,7048,7052,0,0,0,0,0,7054,0,7060,0,0,0,0,7061,0,7065,0,0,0,0,7067,
+7069,0,7070,7071,7072,0,0,7078,0,7080,7081,0,7083,0,0,0,7084,7087,7088,0,0,7090,
+0,7093,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7107,0,0,7108,0,0,0,0,0,0,0,0,7110,0,7114,0
+,0,0,0,0,0,0,7115,0,7116,0,0,0,0,0,7117,0,0,7118,0,0,7124,0,7125,0,0,7126,0,0,0,
+0,7128,0,0,0,0,0,7129,0,7130,0,7132,7133,0,0,7134,0,0,7139,0,7148,7150,0,0,0,0,
+7152,0,0,0,7153,7156,7157,0,0,0,0,0,7158,0,0,0,0,0,0,0,0,0,0,7163,7165,7169,0,
+7171,0,0,0,0,0,0,0,0,0,7172,0,7173,7181,0,0,0,0,0,7182,7185,0,0,0,0,7187,0,7201,
+7204,0,0,0,0,0,7206,7207,0,0,0,0,7211,7216,0,7218,0,0,0,0,7226,7228,7230,7232,
+7233,7235,7237,0,0,0,0,7238,7241,0,7242,0,0,7247,0,0,0,7266,0,0,0,0,0,0,0,7289,0
+,0,7290,7291,0,0,7292,0,7297,0,0,0,0,0,0,0,0,0,0,7300,0,7301,0,0,0,0,0,0,0,0,0,0
+,0,0,7302,0,0,0,0,7305,0,0,0,0,7307,0,7308,0,7310,0,7335,0,0,0,0,0,0,0,7337,0,
+7343,7347,0,0,0,0,0,7348,0,7349,7350,7352,7354,0,0,0,0,7357,0,7358,7366,0,7367,
+7368,0,0,7373,0,0,0,7374,0,0,0,0,0,0,0,7376,0,0,0,7377,0,0,0,0,0,7378,0,7379,
+7380,0,0,0,0,0,7383,0,0,7386,0,0,0,0,7398,0,0,0,7399,7400,0,7401,0,0,0,0,0,0,0,
+7402,0,0,0,0,0,7405,0,0,0,0,0,7406,0,0,0,0,0,0,0,0,7421,7427,7429,0,0,0,7435,0,0
+,7436,0,0,0,7437,0,0,0,0,0,0,7438,7443,0,7446,0,7448,0,0,0,0,0,0,0,0,0,0,7456,0,
+0,0,0,0,7457,0,0,7461,0,0,0,0,0,7462,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7463,7466,7472,
+0,7476,0,0,7490,0,7491,0,0,7493,0,0,0,7498,7499,0,0,7508,0,0,0,0,0,7512,0,0,0,
+7513,7514,7516,0,0,0,0,7518,0,0,7519,7521,7522,0,0,0,7526,0,0,7529,0,0,7531,0,
+7536,0,7538,0,7539,0,0,7541,7542,7546,0,0,0,0,0,7547,0,7548,0,0,0,0,0,7550,0,0,
+7552,7553,0,0,0,0,0,0,0,0,0,0,7554,7563,0,7573,0,0,0,0,0,0,7574,7576,0,7578,7581
+,7583,0,0,0,7584,0,7587,0,0,0,0,0,7589,0,0,0,7594,0,0,7595,0,0,7600,7602,7610,0,
+0,0,0,0,7612,0,7613,7614,0,0,7615,0,0,7616,0,7620,0,7621,7622,0,7623,0,0,0,0,
+7626,0,0,0,0,7627,7629,7631,0,0,7633,0,0,0,0,0,7639,0,7640,7642,0,0,7643,0,0,0,0
+,7644,0,0,0,0,0,0,0,7645,0,0,0,0,0,7661,7662,7663,7665,0,7666,0,7667,0,7684,7688
+,7690,0,7691,0,0,0,0,0,0,7692,0,0,7700,0,7707,0,7708,0,7709,0,7721,0,0,0,7722,0,
+7724,0,0,0,0,0,0,7729,7731,0,7732,0,7733,7735,0,0,0,0,0,0,0,7739,0,0,7741,7745,0
+,7748,0,0,0,7751,0,0,0,7752,0,0,0,0,0,0,0,7753,0,0,7756,0,7757,0,7759,0,7760,0,0
+,0,0,7761,7768,0,0,7769,0,0,7770,0,0,7771,0,0,7772,0,0,7773,0,0,0,0,0,7778,7783,
+0,0,0,0,0,7784,7785,0,7790,0,0,0,0,7792,0,7798,0,0,0,0,0,7799,0,7810,0,0,7813,0,
+7814,0,7816,0,7818,7824,7825,7826,0,7828,7830,0,0,0,7840,0,7842,0,7843,0,0,0,0,
+7844,0,0,0,0,0,0,0,7846,0,0,0,0,0,7856,7857,7858,7862,0,7865,0,0,7866,0,0,7913,0
+,0,0,0,7914,0,0,7915,7917,7918,7919,0,7920,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7921,
+7922,0,7924,0,0,7925,0,0,7927,0,7930,7935,0,0,7937,0,0,0,0,0,0,7939,0,7940,0,0,0
+,0,0,7941,0,0,0,0,7945,0,0,0,0,7949,0,0,0,0,0,0,0,0,7950,0,7953,0,0,0,0,0,0,0,
+7968,0,0,0,0,7969,7972,7992,0,7993,0,0,0,0,0,0,0,0,0,0,0,7994,0,0,0,0,8007,8008,
+0,0,0,0,0,0,0,0,0,0,0,0,8010,0,0,0,8012,0,0,0,0,0,0,0,0,8018,0,8028,8029,0,0,
+8030,0,0,8032,8033,0,0,8034,8036,0,0,0,0,0,0,0,0,0,0,8037,0,0,0,8043,8052,8059,
+8060,0,0,8061,0,0,0,8062,0,8063,0,8064,0,8066,8068,0,0,0,8080,8081,0,8089,0,0,0,
+0,0,8092,0,0,0,0,0,0,8093,8110,0,0,0,0,0,0,0,8111,0,0,0,0,0,8112,8115,0,8117,0,0
+,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8120,8121,8122,8128,8129,8130,8131,0,0,8139,0,0,
+8144,0,0,0,0,8145,8146,8153,0,0,0,0,0,0,0,0,8154,0,8157,8160,8162,0,8164,8165,0,
+0,0,0,8166,8167,0,0,8179,0,0,0,8185,0,0,0,8186,0,0,8187,0,0,0,8188,0,0,0,0,0,
+8204,0,0,0,0,8210,0,0,0,0,0,8213,0,8214,0,0,8215,0,0,0,0,0,0,8218,0,0,0,0,0,0,0,
+0,0,8219,0,8221,0,0,8222,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8225,0,0,0,8233,0,0,
+8242,0,0,0,0,0,0,0,0,0,0,0,8247,0,8248,8252,0,8256,8257,0,0,8261,0,8264,8265,0,0
+,0,0,8267,0,0,0,8269,0,0,0,0,0,0,0,0,0,8270,0,0,0,8278,0,8279,8283,0,0,8285,8286
+,8289,8292,0,0,0,0,8293,8295,8299,8300,8301,0,0,0,0,0,0,8304,8307,0,0,0,0,0,0,0,
+8321,0,0,0,8322,8323,8325,8326,8327,0,0,8332,8338,0,0,8340,0,0,0,0,0,8350,0,0,
+8351,0,8354,8355,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8360,8372,0,0,0,0,0,0,0,0,8377,0,0,
+0,0,8380,0,0,0,8383,0,8384,0,0,0,0,8386,8392,0,0,8394,0,0,0,0,0,0,0,8396,8397,0,
+8398,0,8399,0,0,0,0,0,8400,0,8401,8410,8411,0,8412,8413,8422,0,0,0,0,8423,0,0,0,
+0,8424,0,0,8425,0,0,0,0,0,0,0,8441,8442,0,0,0,0,0,0,8443,0,0,8444,0,8447,0,0,0,0
+,8451,0,8458,0,8462,0,0,8468,0,8469,0,0,0,8470,0,8473,8479,8480,0,0,0,0,8481,
+8483,0,0,0,0,0,0,0,0,0,8484,0,0,8490,0,0,0,0,0,0,8491,8493,8494,0,8528,0,0,0,0,0
+,0,0,8530,0,0,0,0,0,0,0,0,8534,8538,8540,0,0,8541,0,0,8545,0,8557,0,0,8569,8570,
+0,0,8571,8574,8575,8579,0,8583,0,0,0,0,8591,0,0,0,0,0,0,0,0,8606,0,8607,0,0,0,0,
+0,0,0,0,0,8608,0,0,8609,0,0,0,8610,0,0,0,8611,0,0,8613,8617,8621,0,0,8622,0,8623
+,0,8624,8625,0,0,0,0,0,0,0,0,0,8637,8638,8639,8650,0,0,0,0,8652,8654,8655,0,0,0,
+0,0,0,0,0,0,0,8656,0,0,0,0,0,8657,0,0,0,0,0,0,0,0,0,8658,0,0,8659,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,8660,0,0,0,0,0,0,8661,8663,8664,0,0,0,0,8665,0,8669,0,
+0,0,0,0,0,0,8671,8674,0,8684,0,8686,0,0,0,8689,0,0,0,8690,0,8706,0,0,0,0,0,0,0,0
+,0,0,0,8710,0,8711,8713,8714,8724,8727,8728,8733,8736,0,8737,8739,0,0,0,0,8742,
+8743,8745,8754,0,0,0,0,8756,0,0,0,0,0,0,8757,8760,0,0,0,0,0,8762,8763,8764,0,
+8766,8769,8770,8773,0,8774,0,8779,0,0,0,0,8780,0,0,8781,0,0,8783,0,0,0,0,0,0,0,0
+,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8784,0,0,0,0,0,0,0,0,8785,0,0,0,0,8786,0,0,0,0,8788
+,8790,0,0,0,8803,0,8813,8814,0,0,0,0,0,8815,8816,0,0,0,0,8818,0,0,0,0,8822,8828,
+8829,0,8831,0,0,0,0,8833,0,0,0,8834,0,0,0,8835,0,8836,0,0,0,8837,0,0,0,0,0,0,
+8838,8839,0,0,0,0,0,0,0,0,0,0,0,8840,0,0,0,8841,0,8842,0,0,0,8846,0,0,0,0,0,0,0,
+8847,0,8848,0,0,8864,0,0,8866,0,0,8870,8872,0,0,8873,8874,0,0,0,0,0,0,8875,0,
+8876,0,0,0,0,8896,8900,0,0,0,0,8901,0,0,0,0,0,8904,0,8907,0,0,0,0,8911,8912,8913
+,0,0,0,8914,0,8915,0,0,0,0,0,0,0,0,0,0,0,0,8916,0,0,0,8929,0,0,0,0,0,0,0,0,0,0,
+8930,0,8932,0,8943,0,0,0,8945,8947,0,0,0,0,8949,0,8950,0,8954,8957,0,0,8970,0,0,
+0,0,8971,0,8996,0,0,0,0,8997,9000,0,0,0,0,9001,9002,0,9004,9009,9024,0,0,0,0,0,0
+,0,0,0,0,0,0,9027,9082,0,0,9083,9089,0,0,0,0,0,0,9090,0,0,0,9092,0,0,9093,0,9095
+,0,0,9096,9097,9101,9102,0,0,0,0,0,0,0,0,9112,0,0,0,0,0,0,9114,0,0,9120,0,9121,
+9122,0,0,0,9123,9124,0,0,9125,0,0,9126,0,9127,0,0,9129,9131,0,0,0,9132,0,0,9136,
+0,9144,0,0,9148,0,0,0,0,0,0,9149,0,9152,9163,0,0,9165,0,0,0,0,0,0,0,0,0,0,0,0,0,
+9166,0,9169,0,0,0,0,0,0,0,9170,0,0,0,0,9172,0,9174,9175,9176,0,9177,0,0,0,0,0,0,
+0,0,9186,0,9187,0,0,0,9188,9189,0,0,9190,0,0,0,0,9191,0,0,0,9193,0,0,0,0,9197,
+9198,0,0,0,9208,9211,0,0,0,0,9216,9217,0,9220,0,0,0,0,9221,9222,9223,0,9224,9225
+,0,0,9227,0,9228,9229,0,0,9230,0,9232,0,9233,0,0,0,0,0,9234,9235,0,0,9237,0,0,0,
+0,0,0,0,0,9238,9240,0,0,9241,0,0,0,0,9244,0,0,0,0,9247,0,0,0,0,0,0,0,0,0,0,9248,
+0,0,0,9249,0,0,0,0,0,9250,0,0,0,0,9251,0,0,9252,9255,0,0,0,9256,0,0,0,0,0,0,0,
+9257,0,0,9258,0,0,0,0,0,0,9259,0,0,0,0,0,9262,9263,0,0,9265,9266,0,0,0,0,0,0,0,0
+,9268,9271,0,0,0,0,0,0,0,0,0,9273,0,0,0,9276,9277,9279,0,0,0,0,0,0,0,9280,0,0,
+9293,0,0,0,0,0,9297,9301,0,0,0,0,0,0,0,0,0,0,0,9308,9309,9313,9321,9322,0,9326,
+9327,0,0,9477,0,9479,0,0,0,0,9482,0,0,0,9483,0,9484,0,0,0,0,0,0,0,0,0,9485,0,0,
+9486,0,0,0,9489,0,0,0,0,9490,9491,0,0,0,0,9493,0,9495,9496,0,0,0,0,0,0,0,0,9500,
+0,9502,0,0,0,0,0,9504,9507,0,9509,0,9511,0,0,9513,0,0,0,0,0,0,0,0,9515,0,0,0,0,0
+,0,9516,9517,0,0,0,0,9532,0,0,9533,0,0,9538,0,9539,9540,0,0,0,0,9541,0,0,0,9542,
+0,0,0,0,0,0,0,0,9544,9545,0,9546,0,0,0,0,0,0,9547,9548,0,0,0,9550,0,9557,0,9558,
+0,9561,0,9563,9570,0,9572,9574,9575,0,0,0,9577,9592,0,0,9596,0,0,0,9598,0,9600,0
+,9601,0,0,0,0,0,0,9608,0,9638,9639,0,0,0,0,0,0,0,9641,0,0,9643,9644,9645,9646,0,
+0,0,9648,0,0,0,0,0,0,0,9650,9654,0,0,0,0,0,0,0,0,9655,0,0,0,0,0,9656,0,9657,0,0,
+0,0,9658,0,0,9659,0,0,9664,0,0,9665,0,9667,9669,0,0,0,0,0,0,0,0,0,0,0,0,9671,0,
+9673,9681,0,0,0,0,9682,9683,9684,0,0,0,0,9686,9698,0,0,9700,9701,9702,0,9703,
+9717,0,0,0,0,9718,0,9726,0,0,0,0,9727,0,0,0,9728,0,9742,0,9744,0,0,0,9750,0,9754
+,9755,0,0,0,0,0,9756,0,9757,9768,0,9769,0,0,0,9770,9771,0,9773,0,9774,0,9775,0,0
+,0,9776,9777,9784,0,0,0,9786,0,9789,0,0,0,0,9793,9794,0,0,0,9808,0,0,0,0,0,9811,
+0,0,0,0,0,0,0,0,0,0,0,0,9812,0,9820,0,9823,0,9828,0,0,0,0,9830,0,0,9833,9836,0,0
+,0,9840,0,0,0,9841,0,0,9842,0,9845,0,0,0,9847,9848,0,0,9855,0,0,0,0,0,0,9856,
+9863,9865,0,0,0,0,0,0,0,0,9866,9867,9868,9873,9875,0,0,0,0,0,0,9880,0,9886,0,0,0
+,9887,0,0,9891,0,0,0,0,0,0,0,9906,9907,9908,0,0,0,9909,0,0,0,0,0,0,9910,0,0,0,0,
+9913,0,0,0,0,9914,0,0,0,0,0,9922,0,0,0,0,9923,9925,0,0,0,0,0,0,9930,0,0,0,9931,0
+,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9932,0,9939,0,0,9940,9962,9966,0,9969,9970,0,0,9974
+,0,9979,9981,9982,0,0,0,9985,0,0,0,0,0,0,9987,0,0,0,0,0,0,0,9988,9993,0,0,9994,0
+,0,0,9997,0,10004,0,0,0,0,0,10007,10019,10020,10022,0,0,0,10031,0,0,0,0,0,10032,
+0,0,10034,0,10036,0,0,0,0,10038,0,10039,10040,10041,10042,0,0,0,0,0,10043,0,0,0,
+0,0,10045,10054,0,0,0,0,10055,0,0,10057,10058,0,0,0,0,0,0,10059,0,0,0,0,0,0,0,
+10060,0,0,0,0,0,0,0,10063,0,10066,0,0,0,10070,0,10072,0,0,10076,10077,0,0,10084,
+0,10087,10090,10091,0,0,0,10094,10097,0,0,0,0,0,0,10098,0,0,0,0,0,0,10103,0,
+10104,0,10108,0,0,0,0,0,0,0,0,10120,0,0,0,10122,0,0,10125,0,0,0,0,10127,10128,0,
+0,10134,0,10135,10136,0,10137,0,0,10147,0,10149,10150,0,0,10156,0,10158,10159,
+10160,10168,0,0,10171,0,10173,0,0,0,10176,0,0,0,0,10177,0,0,0,0,10178,0,0,0,0,
+10194,0,10202,0,0,10203,10204,0,10205,10206,0,10207,0,0,0,0,10209,0,0,0,0,0,0,0,
+10213,0,0,0,0,0,0,10217,0,10229,0,10230,10231,0,0,10232,0,0,10237,10238,10244,0,
+0,0,0,0,10250,0,10252,0,0,0,0,0,0,10255,0,0,10257,0,0,0,0,0,0,10258,0,10259,0,0,
+0,0,0,0,0,0,10260,0,0,0,0,0,0,0,10284,10288,10289,0,0,0,10290,0,10296,0,0,0,0,0,
+10297,0,0,0,0,0,0,10298,0,0,0,0,10299,10303,0,0,0,0,0,10306,0,0,0,10307,0,10308,
+0,0,0,0,10311,0,0,0,0,0,0,0,10315,10317,0,0,0,10318,10319,0,10321,0,10326,0,
+10328,0,0,0,0,10329,0,0,10331,0,10332,0,0,0,0,0,0,10334,0,0,10335,10338,0,0,0,0,
+0,10339,10349,0,0,0,0,0,0,10351,0,10353,0,0,0,0,0,0,10362,0,10368,0,10369,0,0,0,
+10372,10373,0,0,0,0,0,10374,0,0,0,10375,0,10376,0,0,10386,10388,10390,0,0,0,0,0,
+0,0,10391,0,0,10392,10394,0,0,10396,0,10397,0,10403,0,0,0,0,0,0,0,0,10404,0,
+10405,10410,0,0,10411,0,10412,0,0,0,0,0,0,0,10421,10422,10423,0,0,0,0,0,0,0,0,0,
+10425,0,0,10427,0,0,10430,0,0,0,0,0,10432,0,10433,10434,0,0,0,0,10436,10437,0,
+10438,0,10439,0,10444,10446,0,0,0,0,0,10448,0,0,0,0,0,10449,0,0,0,0,0,0,0,10451,
+0,10453,0,0,0,10454,10457,0,0,10459,0,10469,0,0,0,0,0,10472,10481,0,0,0,0,0,
+10482,10483,0,10492,0,0,0,0,0,0,0,0,0,0,10499,0,0,0,10502,0,0,10510,0,10521,
+10524,0,0,10525,10526,10528,0,0,0,0,0,0,0,0,10530,0,0,0,0,10533,0,10534,0,0,0,0,
+0,0,0,0,0,0,10535,10536,0,0,10544,0,10553,10556,0,10557,10559,0,0,0,0,0,10562,
+10563,10564,0,10565,0,0,0,10566,0,10567,0,0,0,0,10575,0,0,10576,0,10578,0,0,0,0,
+0,0,0,0,0,0,10585,10586,10587,10589,0,10590,0,0,10594,0,0,0,0,0,10598,0,0,10601,
+0,0,0,10602,0,10603,0,10604,0,10605,0,0,10607,0,10626,0,10627,0,0,0,0,0,10629,
+10630,10631,0,0,0,10646,0,0,0,10647,0,10650,0,10651,0,0,0,10652,10653,10655,0,
+10658,0,0,10659,0,10667,0,0,0,0,10669,0,0,0,0,0,0,0,0,0,10670,0,0,0,10671,0,0,0,
+0,10672,10673,0,10674,0,0,0,10676,0,0,0,0,0,0,10678,0,10682,0,0,10692,0,10697,0,
+0,0,0,10698,0,0,0,10700,0,0,0,0,0,10703,0,10704,0,0,0,0,0,0,0,10705,0,10715,
+10718,10720,0,0,10722,0,0,0,0,0,0,0,0,10723,0,0,0,0,10726,0,0,0,0,0,10727,10730,
+10743,0,0,0,0,0,0,10744,0,0,10745,0,0,0,0,0,0,10748,0,0,0,0,10750,0,0,10752,
+10753,0,0,0,10756,0,0,0,0,0,0,10758,0,0,0,10759,0,10769,0,0,10772,0,0,0,0,0,0,
+10773,0,0,0,10777,0,0,10779,0,0,0,0,0,0,0,0,10780,10784,0,0,0,10789,0,0,0,10791,
+0,0,0,0,0,0,0,0,0,10795,0,0,10796,0,10808,0,10809,0,0,0,10810,0,0,0,10812,0,0,
+10814,0,0,0,0,0,0,0,0,0,10815,0,0,0,0,10816,10817,0,0,0,0,10819,0,10820,0,0,0,0,
+10821,10822,10823,0,10826,10849,0,0,0,0,10850,0,0,10852,0,10853,0,0,10856,0,0,
+10857,10858,10859,10860,0,0,0,0,0,0,10863,0,10866,10867,10872,10890,0,0,10891,
+10892,0,0,0,0,0,10893,0,0,0,10896,10899,0,0,10900,10902,0,0,0,0,0,10903,0,0,0,0,
+0,0,0,0,0,0,0,0,10905,0,10906,0,0,0,0,10908,10911,0,10912,0,0,10916,0,0,0,0,0,
+10917,0,10918,0,0,0,10923,0,0,0,0,0,10924,0,0,10928,10929,0,0,10930,0,0,0,10932,
+0,0,0,0,10939,0,0,10945,0,0,0,10947,0,0,10948,0,0,0,0,0,0,0,0,0,0,0,0,10958,0,
+10960,10962,0,0,10964,0,0,0,10966,0,0,0,0,0,0,0,0,0,0,10967,0,0,0,10968,0,0,0,
+10973,0,0,0,0,0,10975,0,0,0,10976,10978,0,0,10982,10984,10987,0,0,10988,0,10989,
+0,0,10991,0,0,0,0,10992,0,0,0,10993,0,10995,0,0,0,10996,10997,0,0,0,10998,0,
+10999,0,11001,0,0,0,0,0,0,11010,11012,0,11013,11016,11017,0,0,11019,11020,11021,
+0,0,0,0,0,0,0,0,0,0,0,0,11022,0,0,11023,11029,0,0,0,0,11031,0,0,0,11034,0,0,0,0,
+11055,0,0,0,0,0,11056,11060,0,0,0,0,0,0,11061,0,0,11064,11065,0,11066,0,11069,0,
+11085,0,0,0,0,0,11086,0,0,0,11088,0,0,0,11094,0,0,0,11095,11096,0,0,0,0,0,0,
+11097,11098,0,0,0,0,0,0,11099,0,0,11102,11108,0,0,0,11109,0,11114,11119,0,11131,
+0,0,0,11142,0,0,11143,0,11146,0,11147,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11148,0,
+11149,11152,11153,11154,0,11156,0,11157,0,0,0,11158,0,0,11159,11160,0,0,0,0,0,0,
+0,0,0,0,0,0,11163,0,0,11164,11166,0,0,0,11172,11174,0,0,0,11176,0,0,0,0,0,11182,
+11183,0,0,0,11184,11187,0,0,11188,11189,0,0,0,0,0,0,11194,0,0,0,0,0,0,0,11200,
+11202,0,0,0,0,0,0,11203,0,11204,0,0,0,0,0,11205,0,0,0,11206,0,11207,0,0,11209,0,
+11211,0,11214,0,0,11231,0,0,0,11293,11295,0,0,11296,11297,11302,0,0,0,11307,0,0,
+0,0,11309,11310,0,11311,0,0,0,11313,0,11314,0,0,0,0,11334,0,11338,0,0,0,11339,0,
+0,0,0,0,11340,0,11341,11342,0,11344,0,11345,0,0,0,11348,11349,0,0,11350,0,0,0,
+11355,0,0,0,0,0,0,11356,0,11357,11370,0,0,11371,0,11374,11376,0,0,0,11377,0,0,
+11378,11383,0,11386,11399,0,11400,11406,0,0,0,11408,0,0,11409,11412,0,0,0,0,
+11417,0,0,0,11418,0,11421,0,11426,11429,0,0,0,0,0,11430,0,11437,0,11438,0,0,0,0,
+0,11440,11453,0,0,0,0,0,0,11454,0,0,0,0,11455,0,0,11456,11460,11461,11463,0,
+11469,0,11473,0,0,0,0,11474,0,0,0,11475,0,11476,11477,11480,0,0,0,0,11481,0,0,
+11484,0,0,11487,0,0,0,0,0,0,0,0,0,0,11497,0,0,11502,0,11509,0,0,11510,11511,
+11513,0,0,0,0,0,0,0,0,0,0,11515,0,0,0,0,11516,0,11520,11521,0,0,0,0,0,0,0,0,0,0,
+0,11529,11530,11531,11534,0,0,11543,0,0,0,0,0,11547,0,11548,0,0,0,0,0,11552,
+11556,0,11557,0,0,11559,0,11560,0,0,0,0,0,0,11561,0,0,11563,11564,0,11565,0,0,0,
+0,11567,0,0,0,11569,0,11574,0,11575,0,0,0,11577,0,11578,0,0,0,11580,11581,0,0,0,
+11582,11584,0,0,0,0,0,0,0,11587,0,11588,11591,0,11595,0,0,0,0,0,0,0,0,11596,0,
+11597,0,0,0,0,11598,11601,0,0,0,11602,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11603,
+11604,0,11606,0,0,11608,0,0,0,0,11610,0,0,11611,0,0,0,0,11613,0,11622,0,0,0,
+11623,0,0,0,0,11625,0,0,11626,11627,11628,11630,0,0,0,0,0,0,11639,0,0,11646,0,
+11648,11649,0,11650,0,0,0,0,0,0,0,0,0,11651,0,0,11652,11653,11656,0,0,11677,
+11679,0,0,0,0,11680,0,0,11681,0,11685,0,0,0,0,0,0,0,0,11688,0,0,0,11716,0,11719,
+0,0,0,0,0,11721,0,0,11724,11743,0,0,0,0,0,0,0,0,11745,11748,11750,0,0,0,0,0,
+11751,0,0,0,11752,11754,0,11755,0,0,0,0,0,0,0,11759,0,0,0,0,0,0,11760,0,0,0,
+11761,0,0,0,0,0,0,11766,11767,0,11772,11773,0,11774,0,0,11775,0,11777,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,11778,11780,0,0,0,0,0,0,0,11783,0,11784,0,0,0,11785,
+0,0,0,11786,0,0,0,0,11788,0,0,11789,11791,11792,0,0,0,0,11795,11834,11835,11836,
+0,0,11837,0,0,0,11838,0,0,11846,11851,0,11852,0,11869,0,0,0,11871,0,0,0,11872,
+11874,0,0,0,0,0,0,11875,0,11876,11877,0,0,0,0,0,0,0,0,0,0,11883,0,0,0,0,0,0,0,
+11884,0,11885,0,11886,0,0,11887,0,11894,11895,11897,11909,11910,0,11912,11918,0,
+0,11920,0,11922,11924,11927,11928,0,0,0,0,11929,0,11934,0,0,0,0,0,11941,11943,
+11944,0,11945,0,0,0,0,11948,11949,0,0,0,0,11953,0,11954,0,11955,0,11956,0,0,0,0,
+0,11957,0,0,11959,0,0,0,0,0,0,0,0,11961,0,0,0,0,0,11978,0,0,0,11979,11980,11986,
+11987,0,11992,0,0,0,0,0,11993,0,0,0,11994,0,11999,12004,12005,12006,0,0,0,0,0,
+12011,0,0,12012,12014,0,0,12015,0,0,12019,12028,0,0,12029,0,0,12032,12033,0,0,0,
+0,12034,0,12041,12043,0,0,12044,0,0,0,0,0,0,0,12046,0,0,0,0,0,0,0,12054,12055,0,
+12056,0,0,0,12060,12064,0,0,0,0,0,12065,12067,12068,0,0,0,0,0,0,0,0,12074,0,0,0,
+12075,12076,0,0,0,12079,0,12081,12086,12087,0,0,12088,0,0,0,0,12089,0,12092,0,0,
+0,0,12097,0,0,0,0,0,0,0,0,12098,0,0,0,0,0,0,0,0,0,0,0,0,0,12102,12103,12104,
+12111,0,0,12114,12116,0,0,0,12118,0,0,0,12119,12120,12128,0,0,0,0,12130,0,0,0,0,
+0,0,12131,0,0,0,12132,12134,0,0,0,0,12137,0,12139,0,12141,0,0,12142,0,0,0,12144,
+0,0,0,0,0,12145,0,12148,0,12153,0,0,0,0,12154,12171,12173,0,0,0,12175,0,0,0,0,
+12178,0,0,0,0,0,0,0,12183,0,0,0,0,0,0,0,0,12184,0,0,0,12186,0,0,0,0,0,12187,
+12188,0,0,12189,0,12196,0,12197,0,0,12198,0,12201,0,0,0,0,12203,0,12209,0,0,0,0,
+12210,12211,12212,12213,0,12217,12218,0,0,0,0,0,0,0,0,0,12222,0,0,0,0,0,0,0,
+12223,0,0,12229,0,0,0,0,12233,0,0,0,0,12234,0,0,12236,12242,0,0,0,12243,0,0,0,
+12244,12253,0,12254,12256,0,12257,0,0,12275,0,0,0,0,0,12277,0,0,0,0,0,12278,0,
+12289,0,0,12290,0,12292,12293,0,0,12294,0,12295,0,0,12296,0,12297,0,12298,0,0,0,
+0,12301,0,0,0,0,0,0,0,0,0,0,0,0,0,12309,0,12338,12340,0,0,0,0,12341,0,0,0,0,0,0,
+0,0,12342,12343,0,12344,0,0,0,0,0,0,0,0,0,12345,0,0,0,0,0,0,0,0,12346,0,0,0,0,
+12348,0,0,0,0,0,0,0,0,0,0,0,0,12350,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12351,0,12355,
+12356,12357,0,0,12367,12370,12371,0,0,0,0,0,12372,12376,0,0,0,0,0,0,0,0,12379,0,
+12382,0,12383,0,0,12384,0,0,0,0,12393,0,0,12394,0,0,0,0,12398,12403,0,0,12404,0,
+0,0,0,0,0,0,0,0,0,0,0,0,12410,0,0,0,12411,0,0,0,12412,0,0,0,0,12420,0,12421,0,0,
+0,0,0,12423,0,12425,12429,0,0,0,12431,12432,0,0,0,0,0,0,0,0,0,0,0,0,12434,0,0,0,
+0,0,12435,12436,0,0,0,0,0,0,0,0,12437,0,0,0,0,0,12438,0,0,0,0,0,0,0,0,12445,0,0,
+0,12450,12451,0,0,0,0,0,0,0,0,12452,12475,0,0,12493,12494,0,0,0,12495,0,0,0,0,
+12496,12502,12509,0,0,0,0,12510,0,12512,12513,0,0,0,0,12514,0,0,0,12515,0,12520,
+0,0,0,12524,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12527,0,0,0,12528,0,0,0,12529,0,0,0,
+0,0,12530,0,12535,0,0,12536,0,12538,0,0,0,0,0,0,0,0,0,0,0,0,12540,0,12548,0,0,0,
+0,0,12550,0,0,0,12551,12552,0,0,0,12554,0,0,0,0,0,0,0,0,12555,0,0,12562,0,12565,
+0,12566,0,0,0,0,0,0,0,0,0,0,0,0,12569,0,0,0,12571,12574,0,0,0,0,0,0,0,12577,0,0,
+0,0,0,0,0,12578,12579,12603,0,12608,0,0,12611,0,12612,0,12615,0,12625,0,0,0,0,
+12627,12646,0,12648,0,0,12657,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12670,0,0,12671,0,
+12673,12677,0,0,0,0,0,0,0,0,0,0,0,12679,0,12681,0,12682,12693,0,12694,0,12697,0,
+12701,0,0,0,12703,12704,0,0,0,0,12707,12737,0,0,12739,0,0,12740,0,0,12742,12743,
+0,0,0,0,0,0,0,0,0,12745,0,12746,12747,0,12748,0,0,12759,12767,0,0,0,0,12773,0,
+12774,12778,0,0,0,0,0,0,0,12779,0,0,0,0,0,12780,12793,0,12824,0,12825,0,12836,0,
+0,0,0,12839,0,12842,0,0,0,0,0,0,0,0,0,0,0,0,12843,12845,0,12846,0,0,0,0,12847,0,
+0,12850,12852,12853,0,0,0,12854,0,0,0,12855,0,12856,0,12858,0,0,12859,0,12862,0,
+12863,0,0,12866,0,12869,12872,12873,0,0,0,0,0,0,0,0,0,12875,0,12877,0,0,12878,0,
+0,0,0,0,0,0,0,0,12884,12885,12888,0,12889,0,0,0,0,12893,0,0,0,12895,12896,12898,
+0,0,0,0,0,0,0,12902,0,12909,12910,0,12926,0,12928,0,0,0,12929,0,12930,0,0,0,0,
+12931,0,12932,12933,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12934,0,12942,0,0,0,0,12944,
+0,0,0,0,0,0,0,0,12946,0,0,12948,0,0,12949,0,0,0,0,12950,0,0,0,0,12951,0,12952,0,
+12953,0,0,0,12954,12958,12959,0,0,0,0,0,12960,12964,0,0,0,0,0,12966,0,0,0,0,0,0,
+0,0,12970,0,12971,0,0,0,0,0,0,12972,0,0,12982,0,0,0,12984,12985,0,12986,12996,
+12997,13001,13002,0,0,0,0,13004,0,0,13005,0,0,13007,13009,0,13017,0,0,0,13020,0,
+13021,0,0,0,0,0,0,0,0,0,0,13022,0,0,0,0,0,0,0,0,13024,13027,0,0,0,0,0,13028,0,0,
+13029,0,0,0,0,0,0,0,13032,0,13037,0,0,0,0,0,0,13040,0,0,13041,0,0,0,13043,13044,
+13046,0,0,0,0,13047,0,0,0,0,0,0,0,13049,13054,0,13056,0,0,13060,13061,0,0,0,0,0,
+13067,0,0,13068,0,13071,0,0,0,0,0,13077,13078,0,0,0,0,0,13079,13080,13081,0,
+13082,0,0,0,13085,0,0,0,0,0,0,0,13086,0,13087,13088,0,0,0,0,0,13094,0,13099,0,
+13100,0,0,0,13101,0,13125,13126,13128,13129,0,0,13130,0,13131,0,0,0,0,0,0,13134,
+0,0,0,0,0,0,0,0,0,0,0,13150,0,13168,0,0,0,0,0,0,0,0,0,13169,0,0,13170,0,0,0,0,
+13174,0,0,0,13176,0,0,0,0,0,13177,0,13178,13183,13187,0,0,0,13189,0,0,13190,0,0,
+13191,0,0,13206,0,0,0,13207,0,0,0,0,0,0,0,0,0,0,13212,0,0,13219,13232,0,0,0,
+13241,0,13249,13253,0,0,0,0,0,13255,13259,0,13260,13261,0,13262,0,13272,0,0,0,0,
+13276,0,0,0,0,13277,13299,0,0,13301,13302,0,0,13303,0,0,13305,0,13310,0,0,0,
+13311,0,0,0,0,13325,0,13328,0,0,0,13329,0,0,0,0,0,0,13330,0,0,13331,0,13335,0,0,
+13342,0,0,0,0,0,13343,0,13354,0,13362,0,13366,13367,13369,0,0,13371,13372,0,
+13373,13374,0,13376,0,13380,13381,13386,0,13387,13388,0,13389,13391,13395,0,0,0,
+0,0,13401,13409,0,13410,0,0,0,0,13420,0,0,0,0,0,13422,0,0,0,0,13423,0,0,0,0,
+13425,0,0,0,0,0,13427,0,0,0,13428,0,0,13430,13438,0,13439,0,13445,0,13448,13449,
+0,0,0,0,0,0,13451,0,13457,0,0,0,0,13458,13459,0,13460,0,0,0,0,13464,13465,13466,
+13470,0,13471,13472,13474,13475,0,13476,0,0,13478,13479,0,13481,0,0,0,0,13487,0,
+13490,0,13493,0,0,13494,0,0,13495,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13496,13497,0,
+13500,0,0,13516,13522,0,0,13525,13528,0,0,0,13530,13535,0,13537,13539,0,13540,0,
+13543,0,13544,0,0,0,0,0,0,13545,0,0,0,0,0,0,13547,0,0,0,13549,13555,0,0,0,13556,
+13557,0,0,0,0,0,0,0,13558,0,13563,0,0,0,0,13564,0,0,0,0,0,0,0,0,13566,0,0,0,0,0,
+0,13569,0,0,13571,0,0,0,0,13573,0,0,0,0,0,0,13578,0,0,0,0,0,0,0,0,0,0,13581,0,
+13586,0,13595,0,13600,0,0,0,0,0,0,0,0,13601,13603,0,13604,13605,13606,13607,0,0,
+13617,13618,0,0,0,0,0,0,0,13623,0,13625,13627,0,0,0,0,0,0,0,0,13629,0,0,0,13634,
+0,0,0,13638,0,0,0,0,0,0,0,0,13654,0,0,0,0,0,0,0,0,0,0,13656,0,13659,0,0,13660,0,
+0,13662,0,0,0,13663,0,13664,0,0,0,0,0,13668,0,13669,13671,0,0,13672,0,0,0,0,0,0,
+13675,13685,0,13686,0,0,0,13687,0,0,0,13692,13694,13697,0,0,0,13702,0,0,0,0,0,
+13705,0,0,0,0,13707,0,0,0,13714,0,0,0,0,0,0,0,0,0,13715,0,13716,13717,0,0,13719,
+13724,13730,13731,0,0,0,0,0,0,0,0,13732,0,0,0,0,0,0,0,13734,0,13736,0,0,13737,
+13738,13747,0,13751,0,0,13752,0,0,0,13753,0,13757,0,0,13762,13763,0,13764,13765,
+0,13766,0,0,13767,0,0,0,13768,0,0,0,0,0,0,0,13769,0,0,13772,0,13775,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,13776,13778,13787,0,0,0,13797,0,13798,0,13801,0,13804,
+13806,0,0,0,0,13816,13817,0,0,0,0,0,0,0,0,0,0,0,0,0,13834,0,13836,0,0,13838,0,0,
+13839,0,13840,0,0,0,0,13842,0,0,0,0,0,0,13843,0,0,0,0,0,0,0,0,0,13845,0,0,0,0,0,
+13858,0,0,13860,0,0,13861,0,0,13862,13863,0,13868,0,13869,13870,0,0,0,0,0,0,0,0,
+0,0,13872,0,0,0,0,13873,13878,0,0,0,0,0,0,0,0,0,0,13886,0,13888,13889,13890,0,0,
+13891,13894,0,13897,13899,13900,13904,0,0,13906,0,0,0,13909,0,0,0,13910,0,0,0,
+13911,0,0,0,0,0,13912,13917,0,0,0,0,13918,0,13919,0,0,13920,0,0,0,13921,0,0,
+13922,0,0,0,0,0,0,0,13924,0,13927,0,0,0,0,0,13932,0,13933,0,13934,0,0,13935,0,
+13944,0,0,0,13954,0,0,13955,0,0,0,0,13956,0,13957,0,13967,13969,0,0,0,0,0,0,0,0,
+0,0,0,0,13970,13990,0,13991,13994,0,13995,0,0,0,0,13996,0,0,13999,0,0,0,14018,0,
+14019,0,14021,0,0,0,0,0,0,14041,0,0,0,0,0,0,0,0,14043,0,0,0,0,14046,0,0,0,14048,
+14049,0,0,0,0,0,0,0,0,0,0,14051,0,0,14052,14056,0,14063,0,14064,14066,0,0,14067,
+0,0,0,0,0,0,0,0,0,14068,0,0,0,14072,0,14074,14075,0,14076,14079,14085,14086,
+14087,14093,0,0,0,0,14095,0,0,0,0,0,0,14096,14097,0,0,0,0,0,0,0,14098,0,14102,0,
+0,0,0,0,14103,0,0,0,14104,0,0,14105,0,0,0,14107,14108,0,0,14109,0,0,0,0,0,0,0,0,
+14117,0,0,0,0,14118,0,0,0,0,14119,0,0,14120,0,0,14121,0,14122,14127,0,14128,
+14136,0,0,14138,0,14140,0,0,0,14141,14142,0,0,0,0,14146,0,0,14149,0,14151,0,0,0,
+14152,0,0,14153,0,0,0,0,0,0,0,0,0,14154,0,14156,14157,0,0,14159,0,14161,0,0,0,0,
+14162,0,0,0,0,0,0,14163,0,0,14173,0,0,0,0,0,0,14174,0,0,14176,0,0,14178,0,0,
+14179,14181,0,0,14182,14185,14187,0,14190,0,0,14197,0,0,0,0,0,0,0,0,0,0,0,0,
+14198,0,0,0,0,0,0,14199,14200,0,0,0,14204,0,0,14208,0,0,0,0,0,0,0,0,0,0,0,14231,
+0,0,0,0,0,0,0,0,0,14234,0,0,14235,0,0,0,14240,14241,0,0,0,14246,0,0,0,14247,0,
+14250,0,0,14251,0,0,14254,0,0,14256,0,0,0,14260,0,14261,0,0,0,0,14262,14267,
+14269,0,0,14277,0,0,14278,0,14279,14282,0,0,0,14283,0,0,0,14284,14285,0,0,0,0,
+14286,0,0,0,14288,0,0,0,14289,0,14290,0,14293,14301,14302,14304,14305,0,14307,0,
+14308,14309,0,0,0,0,0,0,0,0,0,0,0,14311,14312,0,0,14317,0,0,0,0,0,0,0,14318,0,0,
+0,0,14320,0,0,0,0,14321,14322,0,0,0,0,0,14326,14329,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+14330,14331,0,0,0,0,14332,0,0,0,14333,0,0,14337,14340,0,14341,0,0,14342,0,14345,
+14346,0,0,14347,0,14362,0,0,0,0,0,14364,14365,14371,0,14373,0,0,14374,0,14379,0,
+14400,0,0,0,0,0,14401,0,0,14405,0,14406,0,14408,14409,0,0,0,14417,0,0,14424,0,0,
+0,0,0,0,0,0,0,14430,0,0,0,14431,0,0,14435,0,14440,0,0,0,0,0,0,14442,0,0,14443,0,
+0,0,0,0,14446,0,0,0,0,0,0,0,14454,0,14457,0,14460,0,0,14466,0,0,0,0,0,14467,0,0,
+0,0,0,0,14469,0,14477,0,0,0,0,0,0,14478,14482,0,0,0,14483,0,0,0,14485,14486,0,0,
+0,14487,14488,14489,14492,14493,14494,14495,14496,14497,0,14499,0,14501,0,0,0,0,
+0,0,0,0,0,0,14502,0,14507,14512,14513,14514,0,0,0,0,0,0,0,0,0,0,0,14515,14526,
+14530,0,14537,0,14544,0,14547,0,0,14548,14550,14551,0,0,14552,0,0,0,14553,0,
+14554,0,0,0,0,14556,14564,0,0,14565,14566,0,0,0,0,0,0,14568,0,0,14569,0,0,0,
+14571,14576,0,0,14577,14578,14579,0,0,14580,0,0,0,0,14582,0,0,0,0,0,0,0,0,0,0,0,
+0,14583,0,0,0,0,0,14587,0,14588,0,0,14600,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,14601,0,0,14604,14605,14611,0,14613,0,0,0,0,14615,0,0,0,0,0,0,14627,0,14628,0,
+0,0,0,14631,0,14633,14634,0,0,0,0,14635,0,0,0,0,0,0,0,0,14636,0,0,14639,14642,0,
+0,0,0,14644,0,0,0,0,14645,14646,0,14653,0,0,14654,0,14658,0,14661,0,0,0,14665,0,
+0,0,14668,0,0,0,0,0,0,0,0,0,14669,0,0,14670,0,0,0,14680,0,0,14681,0,0,0,0,0,
+14682,14683,0,0,0,0,14686,0,0,0,0,14687,14697,0,0,0,0,14699,14705,14711,0,0,0,0,
+0,0,0,0,0,0,14712,0,0,0,14713,0,0,0,0,14719,0,14720,14721,14726,0,0,0,14728,
+14729,0,0,0,0,14731,0,0,0,0,0,0,0,14733,14736,14737,0,0,14740,14742,0,0,0,14744,
+14753,0,0,0,0,14755,14758,14760,0,0,0,0,0,14761,14762,14765,14771,0,14772,0,
+14773,14774,0,0,14775,0,0,14776,0,0,0,0,14777,0,14779,0,0,14782,0,0,14785,14786,
+14788,0,0,0,0,0,14795,0,0,0,0,0,0,14798,0,14803,14804,14806,0,0,0,14809,0,0,0,0,
+0,0,14810,0,0,0,0,14811,0,14812,0,0,0,0,0,14815,0,0,0,0,0,0,0,0,14816,0,14818,0,
+0,0,0,0,0,14819,0,14820,0,14823,0,0,0,14824,0,0,14826,14827,0,0,0,0,0,0,0,0,0,0,
+0,0,14830,0,0,0,0,0,14833,0,14845,0,0,0,0,0,14846,0,0,14847,14871,0,14873,0,
+14876,0,14877,14878,14880,0,0,0,0,0,14881,0,14882,14894,0,0,0,0,14895,0,14907,0,
+14908,0,0,0,0,0,0,0,14911,0,0,0,0,14920,0,0,14931,0,14932,14934,14935,0,0,14936,
+0,14945,0,0,0,0,0,0,0,14947,0,0,14948,14949,14951,0,0,14952,0,0,0,14964,14973,0,
+0,14990,0,0,0,0,14995,0,0,14998,15001,0,0,15002,15020,0,0,0,0,0,0,15021,0,15022,
+0,0,0,0,15023,0,0,15025,15029,15033,0,0,0,15034,0,0,0,15035,0,0,0,0,0,15043,
+15044,0,0,0,15045,15046,15048,15050,0,15065,0,0,0,0,15066,0,0,15075,15082,15084,
+0,0,15085,15086,0,0,0,0,0,0,0,0,15088,0,0,0,15089,0,0,0,0,15094,0,15096,0,15097,
+0,15100,0,0,15102,0,0,0,0,0,0,0,0,15105,0,0,15106,0,15109,15113,0,0,0,15115,0,
+15118,0,0,0,0,0,0,15119,0,0,15120,0,0,0,0,0,15123,15129,0,0,0,15130,0,15131,0,0,
+15134,0,15135,0,0,0,15137,15138,0,0,0,0,0,0,15139,0,0,0,0,0,15140,0,0,15154,
+15162,0,15169,15170,0,15175,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15177,0,15178,15179,0,
+0,0,0,0,15183,0,0,0,0,0,0,0,0,0,0,0,0,15185,15187,0,15194,15195,15196,0,0,0,0,0,
+0,0,15204,0,0,0,0,15206,0,0,0,0,0,15207,0,0,0,0,0,0,0,0,0,15213,0,15214,0,0,0,0,
+0,0,0,15232,0,0,0,0,15234,0,15238,15240,0,15248,0,0,0,0,15250,15251,0,0,0,0,0,0,
+0,15252,0,0,0,15255,15262,15266,0,0,0,15267,0,0,0,15277,15279,0,0,0,15280,15281,
+15282,0,0,0,0,0,15285,0,0,0,0,15289,0,0,15291,0,0,0,0,0,0,0,15296,15297,0,0,
+15304,0,0,0,0,15306,0,0,0,0,0,0,15307,15308,0,15309,0,0,15311,0,0,15312,15313,0,
+0,0,0,0,0,0,0,0,0,0,0,15314,15317,0,0,0,15318,15319,0,0,0,0,15320,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,15321,0,0,0,0,0,15324,0,15325,15326,0,15330,0,0,0,0,15334,0,
+15335,0,15341,0,0,15342,0,0,15343,15344,0,0,0,0,15345,0,0,0,0,15347,0,0,15348,
+15349,15350,0,15356,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15357,0,15358,0,0,0,0,0,0,0,
+15359,15360,15364,0,15380,0,0,0,0,0,15392,0,0,15393,0,15395,0,0,0,0,0,0,0,0,
+15396,0,0,15397,15398,0,0,0,0,0,0,0,0,0,15399,0,15400,0,0,0,15402,0,15405,15410,
+0,0,0,0,15411,0,0,0,15412,0,15416,0,0,0,0,0,0,0,15428,0,15435,0,0,15438,0,0,0,0,
+15439,0,0,0,15440,0,0,0,15441,15449,15451,0,0,0,0,0,0,0,15452,0,0,15455,0,0,0,
+15456,0,0,15458,0,15460,15461,0,0,0,0,0,15462,15464,0,15465,0,0,15466,0,0,15467,
+0,0,0,0,0,15468,0,0,0,0,15481,0,0,15484,0,15485,15486,0,0,0,15487,0,0,0,0,0,
+15488,0,15492,15498,0,0,0,15499,0,0,0,15500,0,15501,0,0,15512,0,15522,0,0,0,
+15524,0,15525,15526,0,0,15527,0,0,15545,15546,0,15548,15552,0,15553,0,0,0,15554,
+0,15555,0,15557,15565,15573,15577,15578,0,15582,0,15583,0,0,0,0,0,0,0,0,0,0,0,0,
+0,15586,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15588,0,0,0,0,0,15589,0,0,0,0,0,0,0,15593,
+15594,0,0,0,0,15595,0,0,0,0,0,0,15596,0,0,0,15597,0,0,0,0,15600,0,0,15601,0,0,0,
+0,15602,15603,0,0,0,0,0,0,15604,0,15609,0,0,15612,0,0,15613,0,0,15615,15617,
+15618,0,0,15620,0,15636,15637,0,0,15649,0,0,0,0,0,0,0,15650,0,0,15651,0,0,0,
+15656,0,15658,0,0,0,15664,0,0,15665,0,0,15668,0,0,0,0,0,15669,0,0,15674,0,0,
+15675,0,0,0,0,15676,0,0,0,0,0,0,0,0,0,0,0,15677,0,0,0,0,15678,0,0,0,0,0,15679,0,
+0,15681,0,15686,0,0,0,0,15687,0,15688,0,0,15690,0,0,0,15697,0,15699,15700,0,0,0,
+0,0,0,0,0,0,15701,0,15702,15703,0,15704,0,15705,0,15707,0,15709,0,15712,15716,0,
+15717,0,15718,15720,0,0,0,0,0,15724,0,0,0,15725,0,15726,0,0,0,15740,0,15745,
+15746,0,0,15747,0,15748,0,0,0,0,0,15749,0,0,0,15752,0,15753,0,0,0,0,0,0,15759,0,
+0,0,15765,0,0,0,0,0,0,0,0,0,15767,0,0,0,15771,0,0,15784,0,0,0,0,15785,15790,
+15791,0,0,15792,0,0,0,15807,0,15811,0,0,0,0,0,0,0,0,0,0,0,0,15818,0,0,0,15819,0,
+0,0,0,15821,0,0,0,0,0,15822,15824,0,0,15827,0,0,15829,15831,0,15832,0,0,15833,0,
+15835,15838,15839,15843,0,0,0,0,0,0,0,0,0,0,0,15844,0,0,0,0,15845,15851,15856,0,
+0,0,0,0,0,0,15858,15860,0,15861,0,0,0,15864,0,0,0,0,15865,0,0,0,0,0,0,15866,0,
+15872,0,0,15876,0,0,0,0,15877,15878,15883,15885,0,0,15888,0,0,0,0,0,15889,15890,
+0,0,0,0,0,0,0,0,15892,0,0,0,0,0,0,0,15893,0,0,15894,0,0,0,15895,0,15896,15897,0,
+15898,15901,15902,0,15911,15915,0,15916,0,15924,15935,0,15937,0,0,0,0,0,15950,0,
+0,0,0,0,0,0,15958,0,0,0,15961,0,0,15966,0,15967,0,0,15977,0,0,15978,0,0,15981,
+15982,15983,0,0,0,0,0,0,0,15986,0,0,0,15990,0,15991,15995,15998,0,15999,0,16000,
+0,0,0,0,16008,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16009,16011,0,16013,0,0,0,0,
+0,0,0,0,16014,0,0,16015,16023,16024,16025,0,0,16026,0,16030,0,16032,0,16033,0,0,
+0,0,0,0,16035,16036,16037,0,0,0,0,0,16039,0,0,0,0,16041,0,0,0,0,0,16043,16044,0,
+0,16047,0,0,0,16048,0,0,16049,16050,16052,0,0,0,0,0,16055,0,0,0,0,0,0,0,0,16056,
+0,0,0,0,0,0,0,16058,16060,16061,0,0,16063,0,0,16064,0,0,0,16067,16068,0,0,16069,
+16078,0,0,0,16079,0,0,0,16080,0,16081,0,0,0,16088,0,0,0,0,0,0,0,0,0,0,0,16089,
+16093,0,16097,0,16103,0,16104,16105,0,0,16256,0,0,16259,0,0,0,0,0,0,0,16260,
+16261,0,0,16262,0,0,16263,0,16268,0,0,0,0,0,0,0,16269,0,0,16270,16273,0,16274,0,
+0,0,0,16275,16276,16277,16280,0,0,0,16281,16284,0,0,0,16286,0,16289,0,0,0,0,0,0,
+0,0,0,16290,0,0,0,0,16291,0,0,0,0,0,0,0,16292,0,0,0,0,0,0,0,0,16293,16295,16297,
+0,16302,0,16304,0,16305,0,16306,0,0,0,0,0,0,0,0,0,0,0,0,16307,16308,16312,0,0,0,
+0,0,0,16313,16315,0,16318,0,0,0,16321,0,0,0,0,0,0,0,16326,16333,16336,0,0,0,0,
+16337,16340,0,0,0,0,0,16345,0,0,16346,0,0,0,0,0,0,0,0,0,16347,0,0,16348,0,0,0,0,
+16349,0,0,0,16350,0,16357,0,0,0,0,16359,16360,0,0,0,0,16362,16363,16364,16365,0,
+0,16366,0,0,0,0,16367,16368,0,16369,16374,0,0,0,0,0,0,0,16376,0,0,0,0,16378,
+16379,0,16380,0,0,0,16381,16383,0,0,0,0,0,16390,0,0,0,16399,0,16402,16404,16406,
+16407,0,0,0,16409,16411,0,0,0,0,16412,0,16413,16415,16423,0,0,0,0,0,16424,0,0,0,
+16428,16434,16435,16449,0,16450,16451,0,0,0,16453,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+16454,0,0,16456,16458,0,0,16459,0,0,16460,0,0,0,0,16462,0,16463,0,0,16466,0,0,0,
+0,0,16479,0,0,16480,0,16481,16484,0,0,0,0,0,0,0,0,0,0,16485,0,0,0,0,0,0,16489,0,
+0,0,0,0,16491,0,0,16498,0,0,16503,0,16505,0,0,0,0,0,0,0,0,16506,0,0,0,16508,
+16509,0,0,0,0,0,0,0,0,16511,16513,0,0,0,16516,0,16517,0,16519,0,16529,0,0,16531,
+0,0,0,0,0,0,16534,0,0,16541,16542,0,0,0,0,0,0,0,0,0,16543,16547,16548,0,0,0,
+16551,0,16552,0,0,0,16553,0,0,16558,0,0,16562,16565,0,0,0,16570,0,0,0,16573,
+16585,0,0,0,16586,16587,16595,0,16596,0,16598,0,0,0,16600,0,0,0,0,0,0,0,0,0,0,0,
+0,0,16601,0,0,0,0,16603,0,0,0,0,0,0,0,16604,16612,0,0,0,0,16613,0,16618,0,0,0,
+16640,0,0,16641,0,0,0,0,0,0,16645,0,0,0,0,16646,0,0,0,0,0,0,16651,0,0,0,0,16653,
+16654,0,0,0,16655,0,0,16656,16667,0,0,0,0,16671,0,16672,0,0,0,16673,0,0,0,0,0,
+16676,0,16686,0,0,0,0,16689,0,16690,0,16692,0,16693,0,16694,0,16696,0,0,0,16705,
+0,0,0,0,0,0,16707,0,0,0,16709,0,0,0,0,16711,0,16712,16713,0,0,0,16715,0,0,0,0,
+16716,0,0,0,0,0,0,0,0,0,16718,16724,0,0,16726,16727,0,0,0,0,0,0,0,16728,0,16729,
+0,0,16730,0,0,0,0,0,16731,0,0,0,16732,0,0,0,0,16734,16738,0,0,0,0,0,0,0,0,16743,
+0,0,16745,0,0,0,0,0,16749,0,16752,0,0,0,0,16756,0,0,16758,0,16759,0,0,0,0,0,
+16760,0,0,0,0,0,0,0,16762,0,16769,0,16770,0,16772,0,0,0,16777,16780,0,0,0,0,0,0,
+16781,0,0,16782,0,16784,0,0,16785,16787,16792,0,0,16794,0,0,0,16798,0,0,16809,0,
+0,16814,16816,16817,0,16819,0,0,0,0,0,0,0,0,0,0,16820,0,0,16836,16839,0,0,16841,
+16851,16857,0,0,16858,16859,0,0,16860,0,0,0,0,0,0,0,0,16862,0,16863,0,0,0,0,0,0,
+0,16864,0,0,0,0,0,0,0,16876,0,16881,16882,0,16885,16886,0,16887,0,0,0,16889,
+16891,0,0,0,0,0,16894,16895,0,0,0,0,0,0,0,0,0,0,0,16897,0,16898,0,0,0,0,0,16913,
+0,0,16924,16925,16926,0,0,16927,0,0,0,16937,16938,0,0,0,16940,16941,0,0,0,16942,
+16945,0,16946,16949,16950,0,0,0,16952,16955,0,0,0,16965,0,16969,0,0,16975,0,0,
+16976,0,0,0,0,16978,0,0,16981,0,16983,16989,0,0,0,0,16990,0,0,16991,0,0,0,16993,
+0,16994,16996,17000,0,0,0,0,0,17002,17004,0,17006,0,0,17007,0,0,0,0,17008,17013,
+17014,0,0,0,0,0,0,0,0,0,17021,0,17031,0,0,0,0,0,17033,17036,0,17038,0,0,17039,0,
+17045,0,0,17046,17047,0,0,0,0,17048,0,17049,17050,0,17051,17053,0,17054,0,17055,
+0,0,0,0,0,17063,0,0,17064,0,0,0,0,0,0,0,17065,0,0,17068,0,0,0,0,0,17072,0,0,0,0,
+0,0,17073,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17074,0,17080,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,17081,17083,17084,0,0,0,17085,0,0,0,0,17092,0,0,0,0,0,0,0,
+0,0,17093,0,17095,17102,0,0,0,0,0,0,17103,0,0,17105,0,17107,0,0,0,0,17114,0,0,0,
+0,0,17115,17125,17127,0,0,17128,0,0,0,17129,17130,0,17131,0,0,0,0,0,17132,17135,
+17145,0,0,0,0,0,0,0,0,17146,0,17147,0,17148,0,0,0,0,0,0,17149,17150,0,17151,
+17153,0,17155,0,0,0,0,17163,17171,0,17174,0,0,0,0,17179,0,0,17182,17185,0,0,0,0,
+0,17186,0,0,17188,0,0,0,0,0,0,0,17189,17191,0,17194,0,0,0,0,0,0,0,0,0,17195,
+17196,17203,17204,0,0,17205,17217,0,0,0,0,0,17218,0,0,0,0,17219,0,17220,0,17221,
+0,0,17230,0,0,0,0,0,17236,0,17238,17239,0,0,0,17241,17244,0,0,17245,0,17248,0,0,
+17251,0,17252,0,0,17264,0,17266,0,0,0,17268,0,0,0,0,17271,17272,0,17273,0,17295,
+0,17302,0,17305,0,0,0,17306,0,0,0,0,0,0,0,17308,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+17309,0,17310,17313,0,0,0,0,17314,17315,0,17317,0,0,0,0,17318,0,0,0,0,0,0,0,
+17320,0,0,0,0,0,0,17334,0,17344,17348,0,0,0,17350,17351,0,0,17353,0,0,17354,0,0,
+0,0,0,0,0,0,0,17355,0,0,0,0,0,0,17356,17357,0,0,17359,0,0,0,17371,0,17372,0,0,0,
+17393,0,0,0,0,17394,0,0,0,0,0,17395,0,0,17399,0,0,0,17401,17417,0,17418,0,17419,
+0,0,0,0,0,17422,17423,0,0,0,0,0,17424,0,0,0,0,0,17428,17429,17433,0,0,0,17437,0,
+0,17441,0,0,17442,0,0,17453,0,0,0,0,0,0,0,0,17454,17456,17462,0,0,17466,0,0,
+17468,0,0,17469,0,0,0,0,17470,0,17475,0,0,0,0,0,17479,0,0,0,17483,17484,0,17485,
+0,17486,0,17491,17492,0,0,17493,0,17494,17495,0,0,0,17496,0,0,0,17497,0,0,0,
+17502,0,0,0,0,0,17503,0,17505,0,17507,0,0,0,17512,17513,17514,0,0,17515,0,0,0,
+17519,0,0,0,17522,0,0,17523,0,0,0,0,0,0,0,0,0,17527,0,0,0,17528,0,0,0,17534,0,0,
+0,0,17536,0,0,0,17539,0,17540,17543,17549,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17556,
+0,0,17558,0,17559,0,0,17560,0,0,0,17563,0,0,0,0,0,0,17564,0,0,17565,17566,0,
+17567,0,0,0,0,0,0,17569,17570,0,17575,0,0,0,0,0,0,0,0,0,0,0,17581,0,0,0,17582,
+17583,0,17586,0,0,17587,0,0,0,0,0,0,0,17588,0,0,0,0,17596,17597,0,0,17598,17600,
+0,0,0,0,0,0,17601,0,0,0,17604,0,0,17605,0,0,17607,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,17612,0,0,17618,0,17621,17622,0,0,0,0,17623,0,0,17624,0,0,17630,0,0,
+17631,17633,17634,0,0,0,0,0,0,0,17635,0,0,17636,0,0,17637,0,17638,0,17640,0,0,0,
+0,0,0,0,0,0,0,17641,0,0,0,0,0,0,0,0,0,0,17643,0,0,0,0,17645,0,0,0,0,0,0,0,0,
+17646,17662,0,0,0,0,0,0,0,0,0,17663,17664,0,17665,17666,0,0,0,17669,17671,17673,
+0,17679,0,0,0,0,0,0,0,17684,0,0,0,17686,0,17714,0,0,17720,17722,17726,0,0,17728,
+0,0,17729,0,0,0,17732,0,17733,0,17734,0,0,0,17735,0,0,0,0,17737,0,0,0,0,17739,0,
+0,0,17741,17742,0,0,0,0,17743,17744,17745,0,0,0,17749,0,17750,17751,17752,17754,
+17761,17762,0,17763,0,17766,0,17772,0,0,0,0,0,17775,0,0,0,0,0,0,0,17776,0,0,
+17777,0,0,17778,17779,0,17782,17783,0,0,0,0,0,0,0,0,0,0,17784,0,0,0,0,0,0,0,
+17821,0,0,0,17822,0,0,0,17823,17825,0,0,0,0,0,17826,17831,17832,17833,0,0,17845,
+0,0,0,17846,0,0,0,17848,17850,17854,0,17855,0,0,17859,0,0,0,0,0,0,17860,17861,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17870,17871,0,0,0,0,0,0,17872,0,0,0,17879,0,
+0,0,17881,17883,0,17884,0,17885,0,0,17886,0,0,17887,17891,17953,0,0,0,0,17954,0,
+0,17955,0,17968,0,0,17972,0,0,0,0,0,17974,0,0,0,0,17976,17978,0,0,17983,0,0,0,0,
+18003,0,0,0,0,0,18007,0,0,0,0,0,18009,0,0,0,0,0,0,0,18010,0,0,0,0,0,0,18012,0,0,
+18014,0,0,0,18015,0,0,0,18016,0,18017,0,0,0,18030,0,0,0,0,0,0,0,18031,0,0,18036,
+18037,18038,0,0,18049,18056,0,18057,18058,0,18059,0,0,0,0,0,0,0,0,18062,0,0,0,0,
+18064,0,0,0,0,0,0,0,0,18067,0,0,0,18068,0,0,18075,0,0,18078,18093,18094,0,0,0,0,
+0,0,0,0,18097,0,0,0,0,0,18098,18100,0,0,0,18108,0,18111,0,0,18112,0,18113,0,0,
+18115,18116,0,18118,0,0,0,0,18121,0,0,0,0,18123,0,0,0,0,0,0,0,0,0,18124,0,0,0,0,
+18125,18126,0,18127,0,0,18128,18135,0,0,0,0,0,0,0,0,0,18150,0,0,0,0,0,18151,
+18152,0,0,18156,18164,0,18166,18171,0,0,0,0,0,0,0,0,0,18172,18183,0,18184,0,0,0,
+0,18185,0,18187,0,0,0,0,0,18188,0,0,0,0,0,0,0,0,18189,0,0,18190,0,0,18191,18192,
+0,0,18194,18195,18196,0,0,0,18197,0,18203,0,18204,0,0,0,0,18205,0,0,0,18207,
+18208,0,0,18214,0,0,0,18215,18216,0,0,0,18220,0,0,18222,0,0,0,0,0,18223,0,18225,
+18231,0,18234,0,18235,0,0,0,0,18240,0,0,18241,18242,0,0,0,0,0,18243,18251,0,
+18253,0,18254,0,0,0,18266,0,0,0,0,0,0,18269,18270,18271,18273,18281,0,0,0,0,0,0,
+0,0,0,0,0,0,18282,0,18283,0,18284,0,0,0,0,0,0,18285,0,18287,18289,0,0,18290,0,0,
+0,0,18308,0,0,0,18310,0,0,0,0,0,0,0,0,0,0,0,0,18311,0,18312,18313,0,18315,0,0,
+18316,18320,0,18331,0,18332,0,18336,0,0,0,0,18337,0,18340,0,0,0,0,0,0,0,0,0,
+18341,0,18344,18345,0,18346,0,0,0,0,0,18348,0,18351,0,0,18356,0,0,0,0,0,0,18357,
+0,0,0,0,0,18367,0,0,0,18368,0,18369,0,18370,18371,0,0,0,18437,18444,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,18445,18450,0,0,0,0,18451,0,18452,0,0,0,18453,0,0,0,0,0,18455,0,
+0,0,18456,0,18457,0,18460,0,0,18461,0,0,0,0,0,0,0,0,18466,0,0,18467,0,0,0,0,
+18473,0,0,0,18476,0,18477,0,0,0,18478,18479,18480,0,0,0,18485,0,0,0,18486,0,0,0,
+0,0,0,18488,18490,0,0,0,0,0,0,18491,0,0,0,0,0,18495,0,0,18496,0,0,0,0,0,0,18505,
+0,18521,0,18522,18523,0,0,0,18525,18526,0,0,0,0,0,18527,0,0,0,0,18532,18533,0,
+18534,0,0,0,0,0,0,18535,18537,0,18538,0,0,0,0,0,0,18540,18541,18542,18543,0,
+18546,0,0,0,0,18553,18556,0,0,18558,0,0,18569,18571,0,0,0,18572,0,18574,0,0,0,0,
+18586,0,0,0,0,0,18588,0,0,18589,0,0,0,0,0,0,18590,0,18592,0,0,0,0,18594,0,0,0,
+18596,0,0,18597,18598,0,0,18601,0,0,0,0,18602,0,0,0,18603,18604,0,18605,0,0,0,0,
+18608,0,0,18611,0,0,0,0,0,0,0,0,0,18612,0,18616,0,0,18617,18619,0,0,0,18628,0,0,
+0,18629,0,0,18630,0,0,0,0,0,0,0,18631,0,18632,0,0,18635,18637,0,0,0,0,0,0,18641,
+18643,18648,0,18652,0,0,18653,0,18655,18656,0,0,0,18657,0,0,18666,18674,0,0,0,0,
+18677,18684,18685,0,0,18686,0,0,18690,0,0,0,0,0,0,0,18695,18696,0,0,0,0,0,0,0,0,
+0,0,18697,0,0,18700,0,0,0,0,0,0,18702,0,18708,0,0,18709,0,18710,0,0,18711,0,
+18714,0,0,18718,0,0,0,0,0,0,18719,0,0,18722,0,18726,0,0,0,0,0,0,0,0,0,0,0,0,0,
+18731,0,0,0,0,0,18739,18741,0,0,18742,0,18743,18744,18746,18748,0,18752,18753,0,
+0,18754,18763,0,18765,0,0,0,18766,0,0,0,18769,0,0,0,0,0,18773,18778,18779,18781,
+0,0,18784,18787,0,18788,0,18793,0,0,0,0,0,0,18795,0,0,18800,0,0,0,0,0,18801,
+18804,0,0,0,0,0,0,0,18806,0,0,0,18811,18815,18816,0,0,0,0,18825,0,0,18827,18829,
+0,0,18830,0,0,0,0,18831,0,0,18832,0,0,0,0,18833,0,18840,0,18841,0,18842,0,0,0,0,
+18843,0,18844,0,0,0,0,0,0,18845,18846,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+18848,0,0,0,18853,18860,0,0,18862,18866,0,0,18867,18869,0,0,18874,18881,18891,0,
+0,0,0,0,0,0,0,0,0,18892,0,0,0,0,0,0,0,0,18895,0,18896,0,0,0,18900,0,0,0,18901,0,
+18902,18915,18916,0,0,0,0,0,0,0,0,18919,0,0,0,0,0,18920,0,0,0,18921,18929,0,0,0,
+0,18930,0,0,0,0,0,0,18932,0,0,0,0,18934,18942,0,0,0,18951,18957,0,0,0,0,18958,0,
+0,0,0,18959,18960,0,0,18961,0,0,18962,0,0,0,0,18963,18964,0,0,0,18965,0,18967,0,
+0,0,0,0,0,0,0,0,18968,0,18969,0,18970,18973,18976,0,0,0,0,0,0,18977,0,0,0,18981,
+0,0,0,18990,0,18998,0,0,0,0,0,18999,19003,0,0,19005,0,0,0,19006,0,0,0,0,0,0,
+19008,19011,0,0,19018,0,0,19019,0,19024,0,19031,19032,0,19039,0,19041,19050,0,0,
+0,19051,19055,19056,0,19059,19063,19064,0,0,19088,0,0,0,19093,19094,0,0,0,0,
+19095,0,19096,0,0,0,19097,0,0,19098,0,19099,19100,0,0,19103,0,0,0,0,0,0,0,19111,
+0,0,0,0,0,0,19112,0,0,0,19116,19117,0,19121,19122,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,19123,19124,0,0,0,0,0,0,0,19125,19126,0,19128,0,0,0,0,0,0,0,0,0,0,
+19129,19130,19131,19132,0,0,19146,0,0,19147,19156,19158,0,0,0,0,0,0,0,0,19182,
+19185,0,0,19187,0,0,0,19193,0,0,0,0,0,19194,0,19197,0,0,0,0,19198,0,0,0,0,0,0,0,
+0,0,0,19202,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19203,0,19205,19210,
+0,0,0,19213,0,19218,0,0,0,19223,19229,0,0,19230,0,0,19231,19232,19233,19239,0,0,
+0,0,0,19240,0,19248,19249,0,0,0,0,19254,0,19256,19258,19259,0,0,19261,0,19266,0,
+0,0,19272,0,19278,19281,19282,0,0,0,0,0,0,0,0,0,0,0,0,19283,0,0,19284,0,0,19285,
+19287,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19288,19291,0,19292,0,0,0,0,19297,0,19298,0,0,
+0,0,19302,19303,0,0,0,0,19304,19305,0,0,0,0,19314,0,0,19315,0,0,19321,0,0,0,0,0,
+0,0,19322,0,19333,0,19334,19335,0,19336,19337,0,0,0,0,0,0,0,0,0,0,0,19346,0,0,
+19353,0,19354,19362,0,19366,19367,0,0,19369,0,19375,0,19377,19380,19388,0,0,0,0,
+0,19389,19390,0,0,0,0,19392,0,0,0,0,0,19402,0,0,0,0,0,0,0,0,19412,0,0,19413,
+19422,0,19424,0,0,0,19425,0,0,0,19428,0,0,0,0,19431,0,0,0,0,0,19432,0,0,0,0,0,
+19448,19459,0,0,19461,0,19462,19463,0,19467,19474,19482,0,0,0,0,19494,0,0,0,0,
+19501,0,0,0,0,0,0,0,0,0,0,19502,19504,0,0,0,0,0,0,0,19505,0,0,0,0,19506,19507,0,
+0,0,19508,0,0,19511,0,0,19514,0,19515,0,19516,0,19518,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,19530,0,19537,19538,0,19543,19546,0,19547,19551,0,0,0,0,0,0,19552,
+19553,0,0,0,0,0,0,0,0,0,0,0,0,19555,0,0,19556,0,0,0,0,0,0,0,0,0,0,0,0,19560,
+19561,0,0,19562,0,0,0,0,0,0,19565,19567,0,19568,0,0,0,19569,19570,0,19578,0,0,0,
+0,19580,0,0,0,0,19581,19584,0,0,0,0,0,0,0,19585,19586,0,0,0,19587,19588,0,19589,
+0,0,0,0,0,0,19592,19593,19599,0,19600,0,0,19604,0,0,19605,0,19606,19608,19610,0,
+19613,19614,0,0,0,0,0,0,19616,19617,0,0,19618,0,0,19619,0,0,0,19620,19621,19631,
+0,0,19632,19634,19636,0,19643,0,0,19644,19658,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,19659,0,0,0,0,0,0,0,0,0,0,0,19675,19677,0,0,0,0,19679,0,19683,0,19684,0,0,
+0,0,0,0,19687,0,0,0,0,0,0,0,0,19688,19689,19692,0,0,0,0,0,0,0,19695,19697,0,0,0,
+0,0,19698,19699,0,0,19700,0,19702,0,0,19703,0,0,0,0,0,0,19704,19708,0,19710,0,
+19713,0,0,0,19715,0,0,0,0,19718,0,0,0,0,0,0,0,19720,0,19722,0,0,19725,0,0,0,0,0,
+0,0,0,0,0,0,0,0,19730,0,0,0,0,0,19731,0,19734,19735,19739,0,0,19740,0,19741,0,0,
+0,19746,0,0,19747,0,19771,0,0,0,0,0,0,0,0,19772,19775,0,0,0,0,0,0,19778,0,0,0,0,
+0,19779,0,0,19780,19790,0,19791,0,0,19792,0,0,0,19793,0,0,19796,19797,0,0,0,
+19799,0,0,0,19801,0,0,0,0,19803,0,19804,0,19805,0,0,19807,0,0,0,19808,0,0,0,0,0,
+0,19809,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19816,0,19821,0,19822,19830,19831,0,0,
+0,19833,0,0,0,0,0,0,0,0,0,0,19838,0,0,0,0,19839,0,0,19843,0,0,0,0,19845,0,0,0,0,
+19847,0,0,19848,0,19849,0,0,0,0,0,0,0,19851,0,0,0,19854,0,0,0,0,0,0,0,0,0,19864,
+0,19865,0,19866,0,0,0,0,0,0,0,19868,0,0,19870,0,0,19871,0,0,19872,19873,19875,0,
+19880,19882,19884,0,0,19885,19886,19888,0,0,0,0,0,0,0,0,0,0,0,0,19890,19892,
+19893,0,0,19894,0,0,0,19895,0,19896,19902,0,0,19903,0,0,19905,0,0,0,19906,0,
+19908,0,19909,19911,0,0,0,19913,19920,0,19938,19939,19940,0,0,0,0,0,0,0,19942,0,
+19943,0,19945,0,0,0,19951,19952,19954,19960,0,19965,0,19971,0,0,0,0,0,19975,0,
+19976,0,19990,0,0,19991,0,19993,0,19995,0,0,0,19998,19999,20001,0,20003,20005,0,
+20011,20012,0,0,0,0,0,0,20014,0,20020,0,0,0,0,20021,0,0,0,0,0,20023,20024,0,0,0,
+0,0,20025,0,0,20027,0,0,20029,0,0,20032,0,0,0,0,20044,20045,0,20048,20049,0,0,
+20050,0,20052,0,0,20054,20057,0,0,0,0,0,0,0,0,0,20059,0,0,20061,0,20062,0,20064,
+0,0,20066,0,0,20067,0,0,0,0,20069,0,0,0,0,0,0,20070,20071,0,0,0,0,0,0,0,0,0,0,0,
+20072,0,0,20073,20074,0,0,0,0,0,20075,0,20078,0,0,0,0,20080,0,20081,0,0,0,0,0,0,
+20095,0,20098,0,0,0,0,0,0,0,20107,0,0,0,0,0,0,0,0,20112,0,0,0,20113,20114,0,0,0,
+20115,20123,20124,0,0,0,20131,20133,20134,0,0,0,0,20136,0,0,20137,20138,20150,0,
+20152,0,0,0,20153,0,0,20154,0,0,0,20158,0,20163,0,0,20164,0,0,0,0,0,0,0,20166,0,
+20168,0,20170,0,20175,0,0,20178,0,0,0,0,20223,0,0,0,0,20224,0,20226,0,0,20230,0,
+20231,0,0,0,0,20232,0,0,20233,20234,0,20244,0,20247,0,0,0,0,0,0,20249,0,0,0,
+20250,0,0,0,0,20251,0,20253,0,20254,0,0,0,0,20256,0,0,20264,0,0,0,0,20266,0,0,0,
+20278,0,0,20279,20282,0,0,0,0,0,20283,0,20284,0,20285,0,20287,20290,0,0,0,0,
+20292,0,0,0,0,20293,20297,0,0,0,0,0,0,20299,0,20300,20303,0,0,0,0,0,0,20307,0,0,
+20308,0,20309,0,20310,0,0,0,0,0,0,20312,0,0,0,20314,0,0,0,0,20315,20316,0,20322,
+0,0,0,0,0,0,20339,0,0,0,20342,0,0,0,0,20352,0,0,0,0,0,0,0,0,0,0,20362,0,0,20365,
+0,20375,20377,0,0,0,0,0,0,0,0,0,0,0,20378,20379,0,20380,0,0,20381,0,20382,0,
+20383,0,20388,0,0,0,0,0,0,0,0,0,0,0,0,0,0,20390,20392,20393,0,0,20395,0,0,0,0,0,
+20396,0,0,0,0,0,0,0,0,20398,20415,0,0,0,20417,0,0,20420,0,0,20426,20428,0,20431,
+0,0,20432,0,20433,20434,20435,0,0,0,0,20440,0,0,0,0,0,20442,0,20443,0,20446,0,0,
+0,0,20448,0,20451,0,0,0,0,0,0,0,0,0,20452,20453,0,0,20454,0,0,0,0,0,0,20457,0,
+20458,0,0,0,20465,0,0,0,0,0,20469,0,0,0,20473,0,20476,0,0,0,0,0,0,0,0,20477,0,0,
+20485,0,0,20486,0,0,20487,0,20496,0,20497,0,0,20498,0,0,0,0,0,0,0,0,0,0,20499,
+20500,0,20501,0,0,0,0,0,20520,20527,0,20529,0,0,0,0,20539,0,0,20540,0,0,0,20543,
+0,0,0,20546,0,0,0,0,0,20548,0,0,20563,0,0,20564,0,20566,0,0,0,0,0,20589,0,0,0,0,
+20590,0,0,20593,20594,0,0,0,0,20595,0,20597,20598,0,0,0,20618,20620,0,0,0,0,
+20621,0,0,0,0,20627,0,0,0,0,0,20628,0,0,0,20629,0,20630,0,0,20639,0,0,0,0,0,
+20707,0,0,20709,0,0,0,20713,20714,0,0,0,0,0,20724,20725,0,0,0,0,20726,20728,
+20729,0,20733,0,20734,0,20735,20736,0,20737,0,0,20744,0,20745,0,20748,0,0,20749,
+0,0,0,0,0,0,0,0,20750,0,0,0,0,20754,0,0,0,20761,0,0,20763,0,0,0,0,0,0,0,20766,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,20767,0,0,0,0,20768,0,20769,20777,0,0,0,0,0,0,20785,0,
+0,0,20786,20795,20801,0,20802,0,20807,0,0,20808,0,0,20810,0,0,20811,0,20812,0,0,
+0,0,0,20813,0,0,20818,20820,20821,0,0,0,20822,0,20823,0,0,0,20826,0,0,0,0,0,0,0,
+20829,20830,20831,0,20832,20836,0,0,20839,0,0,20840,20842,0,20843,0,20844,0,
+20854,0,0,0,20855,0,0,0,0,20856,0,0,0,20869,0,0,20871,0,0,0,0,0,0,0,20873,0,0,0,
+0,0,20876,0,0,0,0,0,20880,0,0,20882,0,0,0,0,20883,20884,0,0,20890,0,0,0,0,0,0,0,
+0,0,20891,0,0,0,0,0,20905,0,20906,20910,0,0,20912,20915,0,0,0,0,0,20916,0,20917,
+0,20919,20920,20922,0,20927,0,20928,20929,20930,0,0,20935,0,0,20939,0,0,20941,0,
+0,0,20943,0,0,0,20946,20947,0,0,0,0,0,20950,0,20954,0,0,20955,20964,0,0,20967,0,
+0,0,0,0,20973,20975,0,0,0,20984,0,20987,20988,0,0,0,0,0,20989,0,0,0,20995,0,
+20998,0,20999,0,0,0,0,21000,21001,0,0,0,0,21008,0,21010,0,21016,0,0,0,21017,
+21018,0,0,0,0,0,21021,21026,21027,21028,0,0,21029,0,0,0,0,0,21030,0,0,0,0,0,0,0,
+0,0,0,0,0,0,21031,21032,0,0,0,0,0,21037,0,0,21038,0,0,0,0,0,0,0,0,0,21039,0,
+21041,0,21046,21047,0,0,0,21049,21053,0,0,21057,21064,21065,0,0,21066,21067,0,0,
+0,21069,0,0,0,21071,21072,0,0,21073,0,21074,0,0,21078,0,0,0,0,21079,0,0,21080,
+21081,0,0,21086,21087,0,21089,0,0,0,0,0,0,0,21091,0,21093,0,21094,0,0,0,0,0,0,0,
+0,21095,0,0,0,0,0,21096,0,21098,0,0,0,0,0,0,0,21099,0,0,21100,21101,21102,0,0,0,
+0,0,21103,0,21104,0,0,0,0,0,21105,21108,21109,0,0,21112,21113,0,0,0,0,0,0,21115,
+21122,21123,0,0,0,0,0,21125,0,0,0,0,0,0,0,0,21129,21131,0,0,21134,0,0,0,21137,
+21142,0,21143,0,0,21144,0,21145,21146,0,21152,21154,21155,21156,0,0,0,21160,0,0,
+0,0,0,0,21161,0,21164,0,21166,0,0,0,0,21170,0,0,0,0,21171,0,0,21172,0,21174,0,
+21175,0,0,0,0,0,21176,21179,21188,0,0,0,21189,0,0,21190,0,0,0,21192,0,0,21193,0,
+0,0,21198,0,21212,0,0,21213,0,0,0,0,0,0,21215,21216,0,0,21223,21225,0,21226,0,0,
+0,0,21227,21228,0,0,21229,0,0,0,0,21230,21236,0,0,0,0,0,0,0,0,0,0,0,0,0,21237,0,
+0,21238,21239,0,0,0,0,21256,0,0,0,0,0,21257,0,0,0,0,0,0,0,21259,0,0,0,21263,0,
+21272,0,21274,0,21282,0,0,0,0,0,0,0,0,21283,0,0,0,0,0,0,0,0,21294,0,0,21297,0,0,
+0,0,21298,0,0,0,21299,0,21300,21302,0,21316,0,21318,21322,21323,0,21324,0,21326,
+0,0,0,21327,21328,0,0,0,21352,0,0,21354,21361,0,0,0,0,0,0,0,0,0,0,0,0,0,21362,0,
+0,0,21363,0,0,0,0,0,0,0,0,0,21366,0,0,21367,21372,21374,0,0,0,21375,21377,0,
+21378,0,0,0,21380,0,0,0,0,0,0,0,0,0,0,21381,0,0,0,0,0,0,21382,0,21383,0,0,21384,
+0,0,21385,0,0,0,0,21389,21390,0,0,0,0,0,0,0,0,0,0,0,0,0,21397,21398,0,0,0,0,0,0,
+0,0,0,0,21399,0,21400,0,0,0,0,21402,0,0,0,21403,21404,0,21405,21406,0,0,0,21407,
+0,0,0,0,0,0,0,0,0,0,0,0,21408,0,0,0,0,21409,0,21421,0,21422,0,0,0,21425,21428,0,
+0,0,0,21429,0,0,0,0,0,21433,0,0,0,0,0,0,0,0,0,0,21434,0,21443,0,21444,21449,0,
+21452,0,21453,21454,0,0,0,21457,0,0,21458,0,0,0,21460,21461,0,0,21464,0,0,0,
+21473,21478,0,0,21479,0,0,21481,21483,0,0,0,0,0,0,0,0,21484,0,0,21485,21486,0,0,
+21488,0,0,0,0,0,0,21523,0,0,21525,0,0,0,0,0,0,0,21526,0,0,0,0,0,0,21529,21530,0,
+0,21531,0,0,21533,0,0,21539,21564,0,21567,0,0,0,0,0,0,0,0,21575,0,0,0,0,21577,0,
+0,0,0,0,21591,0,0,21604,0,0,0,0,0,0,0,0,0,21605,0,21606,0,0,21617,21618,21619,
+21620,0,0,0,0,0,0,0,0,0,0,0,0,0,21623,0,0,0,0,21631,0,21635,0,0,0,0,21639,21646,
+21653,21662,0,0,21663,21664,0,21666,0,0,21667,0,21670,21672,21673,0,21674,21683,
+0,0,0,0,0,21684,0,21694,0,0,0,0,21695,21700,0,21703,0,21704,0,0,21709,0,0,0,
+21710,0,0,0,0,0,0,0,0,21711,0,0,0,21712,0,21717,0,21730,0,0,0,21731,21733,0,0,0,
+0,21737,21741,21742,0,21747,0,0,0,21749,0,0,0,0,0,0,0,0,0,0,0,0,0,21750,0,0,0,0,
+0,21752,0,0,0,0,21753,0,0,0,0,0,0,21755,21756,0,21757,0,0,0,0,0,0,21760,0,0,
+21763,0,0,0,0,0,0,0,0,0,21764,0,0,21766,0,0,21767,0,0,0,0,0,0,0,0,0,21773,0,
+21774,0,0,21775,0,0,0,0,21776,0,0,21777,0,0,0,0,0,0,0,0,0,21780,21787,21788,
+21791,0,0,0,21797,0,0,0,0,0,21805,0,0,0,0,21806,0,21807,21809,0,21810,21811,0,
+21817,21819,21820,0,21823,0,21824,0,0,21825,0,0,21826,21832,0,0,0,0,0,21833,
+21848,21849,0,0,21867,21870,21871,21873,0,0,0,21874,0,0,0,0,0,0,0,0,0,21875,0,
+21878,0,0,0,21879,0,21881,21886,0,0,0,0,21887,0,0,21888,21894,21895,21897,0,
+21901,0,21904,0,0,21906,0,0,0,21909,21910,21911,0,0,21912,0,0,21913,21914,21915,
+0,21919,0,0,0,0,0,0,0,21921,0,0,21922,21933,21939,0,0,0,0,0,0,0,0,0,0,0,21944,0,
+0,0,0,0,21945,0,21947,0,0,0,0,0,0,0,0,0,0,21949,0,0,0,21950,0,0,0,0,0,0,0,0,0,0,
+0,0,0,21951,0,21952,0,0,0,0,0,0,0,0,0,21954,21957,0,0,0,0,21958,0,21959,0,0,0,0,
+0,0,21962,21963,0,0,0,0,0,0,0,0,21964,21965,0,0,21969,21970,0,0,0,21974,0,0,
+21980,21981,0,21982,0,0,0,0,0,21985,0,21988,0,21992,0,21999,0,0,0,0,0,0,22001,0,
+22002,0,0,0,0,0,0,22003,0,0,0,0,0,22004,0,0,0,22008,0,22009,22015,0,0,22016,0,0,
+0,22017,22019,0,0,0,0,0,0,0,0,0,22020,0,0,0,0,0,0,0,0,0,0,22021,22037,0,22039,0,
+0,0,22040,0,0,0,22048,22049,0,0,22053,22055,22056,22059,0,0,22060,22061,0,0,
+22064,0,0,0,0,22066,0,0,0,0,0,0,0,22073,0,0,0,22074,22075,0,0,0,0,0,0,0,22076,0,
+0,0,0,22077,22084,22099,0,0,0,0,0,0,0,22104,0,0,22107,0,22108,0,22109,0,22110,0,
+0,0,0,0,0,0,22111,22119,0,22120,22122,0,0,0,0,22125,0,0,0,22128,22129,0,0,0,0,0,
+0,22141,0,0,0,22142,0,0,22144,22146,0,22148,22149,22151,22154,0,0,0,22162,0,0,0,
+0,22164,22177,0,0,0,0,22179,0,22182,22183,0,0,22184,22188,0,0,0,0,0,0,0,0,22190,
+0,22194,22201,0,0,22208,0,22209,0,22212,0,0,22215,0,22223,22231,0,0,22232,0,
+22234,0,0,22235,22236,0,22237,0,22240,0,0,0,0,0,22241,0,0,0,22242,22246,22247,0,
+0,0,22259,22268,0,22269,0,0,0,0,0,0,0,22270,0,0,0,0,22271,0,22272,0,22277,0,0,0,
+0,0,22278,22280,22283,22286,0,0,22287,22289,0,0,22290,0,22293,0,0,0,0,0,0,0,0,0,
+0,22295,0,22301,22302,0,0,0,22305,0,22308,0,0,0,0,0,0,0,0,0,0,22315,0,0,0,22317,
+0,22334,0,0,0,22335,0,0,0,0,0,22336,0,22338,22344,0,22347,22349,0,22350,0,0,0,0,
+0,0,0,22357,0,0,0,0,0,22358,0,0,0,0,0,0,0,0,0,0,22359,22360,0,0,0,0,0,0,0,0,
+22361,22366,0,0,22369,0,22370,22373,0,0,0,0,0,22375,0,22377,0,0,0,0,0,22378,0,0,
+0,0,22381,0,0,0,0,22382,0,22383,0,0,0,0,0,0,0,0,0,22391,0,0,22392,22395,22396,
+22402,0,0,0,0,0,0,0,0,0,0,0,0,0,22405,0,0,22406,0,0,22408,0,0,22409,22410,0,0,0,
+0,0,0,22424,0,0,0,0,22426,0,0,0,22427,0,22428,0,22432,0,22435,22442,22443,0,0,0,
+0,22444,0,0,0,0,0,22446,0,22454,0,22455,0,0,0,22465,0,22470,0,22471,0,0,0,0,
+22472,22473,0,22487,0,0,0,22488,0,0,0,0,22489,0,0,22499,0,0,0,0,0,0,22514,0,0,
+22515,0,0,0,0,0,0,0,22516,0,0,0,22517,22520,0,0,0,22534,0,0,22535,0,0,22536,0,
+22540,22553,0,22555,0,0,0,0,22561,0,0,22562,0,0,0,0,0,0,0,0,0,0,0,22566,0,0,0,0,
+22567,22568,0,0,22575,0,22579,0,22582,22583,22585,0,0,0,0,0,22586,0,0,22587,0,0,
+22590,0,0,0,0,0,22591,0,22592,0,0,0,0,0,22593,0,22602,0,0,22604,0,0,22609,0,0,
+22618,0,0,0,0,0,0,22619,0,22624,22625,0,0,22638,0,0,0,0,0,22639,0,0,22640,0,0,0,
+0,0,0,0,22644,0,22645,22647,0,0,0,0,22652,22653,0,0,0,22654,0,22655,0,0,0,22656,
+0,0,0,0,0,0,0,0,0,0,22673,22675,22676,0,0,22678,22679,0,22691,0,0,0,0,0,0,0,
+22693,0,0,22696,0,22699,22707,22708,0,0,0,0,0,0,0,0,22718,0,22719,0,0,0,0,22723,
+0,0,0,22724,22725,0,0,0,0,0,0,0,0,0,0,0,0,0,0,22726,22728,0,0,0,0,0,0,0,0,22729,
+0,0,22731,0,0,0,0,22732,22735,22736,0,0,0,0,22739,0,22749,0,0,22751,0,0,0,0,0,0,
+0,0,0,0,0,22758,0,0,0,0,0,22760,0,0,0,0,0,22764,22765,22766,0,22768,0,0,0,0,0,
+22769,22770,0,0,0,0,0,0,22771,0,0,22772,22775,0,22776,22777,22780,0,0,22782,
+22784,0,22787,0,22789,22796,0,0,0,0,0,22798,0,0,0,0,0,0,22802,0,22803,22804,0,0,
+0,0,0,0,0,0,0,0,22805,0,0,22810,22811,22814,22816,0,22825,22826,0,22831,22833,0,
+0,0,0,0,0,0,0,0,22834,0,22836,22838,0,22839,0,0,0,0,0,22840,0,22847,0,0,0,0,0,
+22856,22857,0,22858,22859,0,0,22862,0,0,22864,0,0,0,0,22865,0,0,0,0,0,0,0,0,0,0,
+0,22866,0,22867,22868,0,0,0,0,22869,0,22871,0,22872,0,22873,22881,22882,22884,
+22885,0,0,0,0,0,0,0,22886,22887,0,22894,0,22895,0,0,0,22900,0,22901,0,0,0,0,
+22904,0,0,0,0,22905,22907,0,0,0,22915,22917,0,0,22918,0,0,0,22920,0,0,0,22929,
+22930,0,0,0,22941,22942,0,0,0,22943,0,0,0,22944,0,0,0,0,0,0,0,22946,0,22947,0,0,
+22954,0,22956,0,0,22962,0,0,0,0,0,0,0,22963,0,0,22964,0,0,0,0,0,0,0,22965,0,
+22968,0,0,0,22969,0,0,0,0,0,22970,0,22971,0,0,0,0,0,22978,0,0,22979,0,22987,0,0,
+22989,0,0,0,0,0,0,22990,0,23005,0,0,0,0,0,0,0,23006,23007,23008,0,0,23023,23024,
+23029,0,0,0,0,23030,0,0,0,0,0,23032,0,0,0,0,0,23035,0,0,0,0,23038,0,0,0,23048,0,
+23049,23052,23053,23060,23061,0,23063,0,0,0,0,23067,23068,0,0,0,23069,23073,0,0,
+0,23127,0,23128,0,0,0,0,0,23129,0,23138,23141,0,23149,0,0,23150,0,0,0,23152,0,0,
+0,0,0,0,0,0,23154,0,0,0,0,23157,23159,23160,0,0,0,0,0,0,0,0,0,0,0,0,23180,0,0,0,
+0,23181,0,0,23188,0,23189,0,0,0,0,0,0,0,0,0,0,0,0,23195,0,0,23196,23199,0,0,0,0,
+0,0,0,0,0,23202,0,23204,0,23207,0,23209,23210,0,0,0,0,0,0,23227,23229,0,0,23230,
+23234,23238,0,0,0,23245,23246,23248,0,0,0,0,23249,23254,0,0,0,23265,0,0,0,0,0,0,
+0,23268,0,23276,0,0,0,0,23277,0,23297,0,23298,0,0,0,0,23299,0,23302,0,0,23303,
+23312,0,0,23314,0,23320,0,0,0,0,23324,0,23325,0,23328,0,23334,0,0,0,23337,0,0,0,
+0,23343,23344,23346,0,23348,0,0,0,0,0,0,0,0,23353,0,0,0,0,23355,0,23356,23358,0,
+0,0,23359,23360,0,23361,0,23367,0,23369,0,0,23373,0,23378,23379,0,23382,23383,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,23387,0,0,0,0,0,0,23388,23390,0,0,23393,23398,0,0,0,
+23399,0,0,0,23400,0,0,0,0,23401,0,0,0,23415,0,0,0,0,0,0,0,0,23416,0,23422,0,
+23443,23444,0,0,0,0,23448,0,23454,0,0,0,0,0,0,23456,0,0,23458,23464,0,0,0,0,0,0,
+23465,0,0,0,23470,23471,0,0,23472,0,0,0,23473,23496,0,0,0,0,0,0,0,0,23497,0,
+23499,0,0,23502,0,0,23503,0,0,23513,0,0,23515,0,0,0,23517,0,0,0,0,23518,23519,
+23521,23524,0,23525,23528,23539,0,0,0,0,0,23541,0,0,23544,0,0,23556,0,0,23557,0,
+0,0,0,0,0,0,0,0,0,0,0,0,23559,0,23560,0,0,23561,0,0,23566,0,0,0,0,0,23568,23569,
+23570,0,0,0,0,23571,0,23574,0,0,0,0,0,0,0,0,0,0,0,23575,0,23579,0,0,23581,0,0,0,
+0,0,0,23587,0,0,0,0,0,0,0,23596,23598,0,0,0,0,23602,23606,0,0,23607,0,23608,0,0,
+0,23614,23616,0,0,0,0,0,23618,0,0,23619,0,0,0,0,23621,23626,0,23627,0,0,0,0,0,0,
+0,23629,0,23630,0,0,0,0,23634,0,23636,0,0,0,0,0,0,23638,0,0,0,0,23640,23667,0,
+23669,0,0,0,23681,0,0,0,0,0,0,0,23682,0,23683,0,0,0,0,0,23684,0,0,0,23685,23689,
+0,23693,23694,23700,0,23702,0,23709,0,0,0,0,0,0,0,23712,0,0,0,0,0,23714,0,0,
+23715,0,0,0,0,23718,0,0,23720,0,0,0,0,23722,0,0,0,23726,23729,0,23741,23746,0,
+23748,0,0,0,0,23749,0,0,0,0,0,23750,0,0,0,0,23751,0,23753,0,0,0,0,23757,23765,0,
+0,0,23770,0,0,0,0,0,0,0,23771,0,23772,23781,0,0,23796,0,0,0,0,23798,0,23799,0,0,
+0,23802,0,0,23806,0,23807,0,0,23808,0,23809,0,23819,0,0,0,23821,0,23827,0,0,0,
+23829,0,0,0,0,0,0,0,23830,0,0,0,0,0,0,23832,23833,23834,23835,0,0,0,0,23837,
+23838,0,0,0,0,0,23846,0,0,0,0,0,0,23847,0,0,0,0,0,23879,23881,0,0,23882,23883,
+23895,0,23899,0,0,0,0,23901,0,0,0,0,0,0,23902,0,0,0,0,0,23903,23905,0,23906,0,
+23907,23918,23919,23920,0,23922,0,23924,0,23927,0,23934,0,23937,23941,0,23942,
+23946,0,0,0,0,0,23955,23956,23958,0,0,0,0,0,0,23959,0,23962,23965,0,23966,0,0,0,
+0,23967,23968,0,0,23973,0,0,23974,0,0,0,0,23975,0,23976,0,0,0,0,0,0,0,0,0,0,0,0,
+0,23977,0,0,0,0,0,0,0,0,23980,0,0,23984,0,23985,0,0,23987,0,0,23988,23990,23991,
+0,0,0,0,0,0,23992,0,0,0,0,0,0,0,0,23994,0,0,0,23998,0,0,0,0,0,0,0,0,0,23999,0,0,
+24003,0,24004,0,24006,0,0,0,24007,0,0,24008,0,0,0,0,0,0,0,24009,0,0,24010,0,0,
+24011,0,0,24013,24014,0,0,24015,24016,24027,0,24028,24029,0,24030,0,0,0,0,0,
+24033,24034,0,24035,0,0,24036,0,0,24044,0,24048,24049,24063,24067,0,24068,24070,
+0,0,24071,24078,24087,0,24090,0,0,0,24095,0,24098,24101,24104,24106,0,24107,0,0,
+0,24108,0,0,0,0,24110,24111,0,24113,0,0,24115,24120,0,0,0,0,0,0,24124,0,24125,0,
+24126,0,24127,0,0,0,0,0,24135,0,0,24136,0,24137,24142,0,0,0,24146,0,0,24147,
+24149,24154,0,24163,0,0,0,24165,24166,24167,0,0,0,0,0,0,0,0,0,0,24169,24170,
+24175,0,0,0,24178,0,0,24179,0,0,24181,0,24184,24197,0,24201,24204,0,0,0,0,0,0,
+24206,24212,24220,0,0,0,24224,0,0,0,0,0,0,0,0,24226,0,24234,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,24235,0,24236,0,0,0,0,0,24239,24240,24241,0,0,24248,0,0,24249,0,
+24251,0,0,0,0,0,0,24253,0,24268,0,0,0,24269,0,24271,24272,0,0,0,0,24273,0,0,
+24274,0,0,24279,0,0,0,0,0,0,0,24280,0,24293,24294,0,0,0,0,0,0,24296,0,0,24323,0,
+0,0,24329,24330,24331,24339,0,24351,0,0,24369,24370,0,0,0,24371,0,0,0,0,24372,
+24373,24374,0,0,0,0,0,24378,0,0,0,0,24379,0,24381,0,24383,24389,0,24390,0,0,
+24394,24395,24400,0,0,0,24401,24402,0,24406,0,0,0,24411,0,0,0,24415,0,24416,0,0,
+0,0,0,24417,0,24419,0,24422,0,24423,24428,0,24435,0,0,0,24439,0,0,0,24440,24442,
+24446,0,0,0,24447,24448,24449,24452,0,0,0,0,24453,24457,0,0,24458,24459,24460,0,
+24465,0,0,0,0,0,0,0,24470,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24471,0,24473,
+24474,24475,24476,0,24478,0,0,0,0,24480,0,0,0,0,0,0,0,0,0,0,24481,0,0,0,0,0,0,0,
+0,0,0,24482,24485,0,0,0,0,24486,0,0,0,24488,0,0,0,24494,0,0,0,0,24497,0,0,24498,
+0,0,0,24499,24506,0,0,0,24507,0,0,24511,0,0,24513,24514,0,0,0,0,0,24517,0,24518,
+0,24520,0,24521,24524,24525,0,0,0,0,0,24527,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24528,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24537,24539,0,24540,0,0,0,24548,0,0,0,0,0,24549,
+24550,0,0,0,24553,24554,0,24555,0,24556,0,24558,0,0,0,0,0,24560,0,0,0,24561,0,0,
+0,0,0,24562,0,0,0,0,0,0,0,0,0,0,0,0,0,24567,0,0,0,0,0,24569,0,0,0,24574,0,24575,
+0,0,0,0,0,0,0,0,0,0,0,24577,24581,0,24584,0,0,0,0,0,24585,0,0,0,0,0,24586,0,0,
+24587,0,24588,0,0,0,0,0,0,0,0,0,0,24590,24591,0,0,0,0,24592,0,0,0,0,0,0,0,24594,
+0,0,0,0,0,0,0,24596,24597,0,0,0,0,24602,24603,0,0,0,0,24604,0,0,24605,0,24610,0,
+0,24611,0,0,0,0,24612,24615,24616,24624,0,0,0,24627,0,24638,24639,0,0,0,0,24640,
+0,0,0,24655,24656,24657,0,0,0,0,0,0,0,0,24662,0,24663,24664,0,0,0,0,0,24665,0,0,
+0,0,24667,0,0,0,0,0,0,24668,24669,0,24670,24674,0,0,0,24675,0,24678,0,0,24679,0,
+0,0,24681,0,24683,0,0,0,0,24684,0,24685,0,0,24686,0,0,24688,24689,0,0,0,0,24690,
+24691,0,0,0,0,0,0,0,24697,0,24698,0,0,0,0,0,0,0,0,24709,0,0,0,0,0,24710,0,24712,
+0,0,0,0,0,0,24713,24714,0,24715,0,24716,24718,0,24719,0,0,0,0,24720,0,0,24725,0,
+0,24738,0,24749,24750,0,0,0,24752,0,0,0,24753,0,0,0,24758,0,0,0,0,0,24762,0,
+24763,0,0,0,0,0,0,0,24764,0,0,0,0,0,24765,24767,24768,0,24772,0,0,0,0,24773,0,0,
+0,0,24777,0,0,0,0,0,24785,0,24786,24788,0,0,0,24789,0,0,0,0,24794,24798,0,24799,
+24800,0,0,0,24803,0,24804,24806,0,24807,0,0,0,24810,0,0,0,0,0,0,24827,24828,0,
+24835,0,0,0,0,0,0,24836,0,0,0,0,0,24839,0,24843,24844,0,0,0,0,0,0,0,0,0,0,24847,
+0,0,24848,0,0,0,0,0,0,24849,0,24850,24851,0,0,0,24852,0,24853,0,0,0,0,0,0,0,0,0,
+24854,0,24855,0,0,24868,0,0,0,24883,0,0,0,24884,0,24895,24897,0,0,0,0,0,24899,0,
+0,0,0,0,24900,0,24913,0,0,0,0,0,0,24914,0,0,24917,24930,24931,0,0,0,24932,0,0,
+24939,0,0,24942,0,0,0,0,0,0,0,0,0,24945,24950,0,24951,0,0,24953,0,0,0,24954,0,
+24959,0,0,0,24961,0,0,24962,0,24964,24968,24970,24972,0,0,0,0,0,24976,0,0,0,
+24977,0,24982,0,0,24983,0,0,24984,0,0,0,24993,0,0,0,24994,0,0,25001,0,0,0,25003,
+0,0,25018,0,0,25023,0,0,0,25034,0,0,25035,25036,0,25037,0,0,0,0,0,0,0,25039,0,0,
+0,0,0,25040,0,0,0,0,0,0,0,25042,0,0,25043,25045,0,0,0,0,0,0,25049,0,0,25051,0,
+25052,25053,0,0,25054,0,0,0,25055,0,0,0,0,25057,25059,0,0,25060,25064,0,25065,
+25069,25070,0,0,0,0,25072,0,25073,0,25090,0,0,25092,25093,25101,0,0,0,0,0,0,
+25105,25108,0,0,25113,0,0,25115,25116,0,0,0,0,0,0,25117,0,0,0,25120,25121,0,0,0,
+0,0,0,0,25125,0,0,0,25126,0,25130,25134,0,25139,0,25143,0,0,0,25151,0,25161,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,25163,0,0,0,0,0,0,0,25174,0,25175,0,25207,0,0,
+0,25209,0,0,0,0,25213,0,25219,0,25223,0,25225,0,0,0,25227,0,0,0,25228,0,0,0,
+25229,0,0,0,0,0,0,0,25231,25233,0,0,0,0,25237,25239,0,0,0,25243,0,0,0,25252,0,
+25257,25258,0,0,0,0,25260,25265,0,25268,0,0,25273,25324,0,25325,0,25326,0,0,0,0,
+0,0,0,0,25327,0,0,0,0,0,25328,0,0,0,0,0,0,25332,0,0,0,25333,0,0,0,25336,25337,
+25338,0,0,25343,0,25350,0,0,0,0,0,0,0,25352,0,25354,0,25375,0,25379,0,0,0,0,
+25384,0,0,0,0,0,0,0,0,0,25386,0,25388,0,25390,0,0,25399,0,0,25401,0,0,0,25402,0,
+0,0,25407,0,0,0,0,0,0,0,0,0,0,0,25413,25415,0,0,25417,0,0,0,0,0,0,0,25419,0,0,0,
+25421,0,0,0,25424,0,0,0,0,25433,0,0,0,0,0,0,0,0,0,25435,0,0,0,0,0,0,25436,0,0,0,
+25437,0,0,25440,0,0,0,0,0,0,25442,0,0,25443,0,25446,0,0,25449,0,0,0,25450,0,0,0,
+0,25452,0,25453,25454,25455,0,0,0,25456,0,25457,0,0,0,25459,0,25461,0,25468,0,0,
+0,0,0,0,0,0,25469,0,0,0,0,0,25471,0,0,0,0,0,25474,0,0,0,0,0,0,0,0,25475,0,0,0,0,
+25477,0,0,0,0,25483,0,0,0,0,0,25484,0,0,0,0,0,0,0,0,0,0,0,0,25485,0,25497,0,0,
+25498,0,25504,0,25510,0,25512,0,0,25513,25514,0,0,0,0,0,0,25517,25518,25519,0,
+25520,0,0,0,0,0,0,0,25521,0,25522,25527,25534,0,25536,0,25537,0,0,25548,25550,0,
+0,25551,0,25552,0,0,0,0,0,25554,0,25555,0,25556,25557,25568,0,0,0,25570,25571,0,
+0,0,0,0,0,25574,0,0,0,0,25579,0,0,0,25581,0,0,0,25582,0,0,0,0,0,0,0,0,0,25588,0,
+0,0,0,25589,0,0,0,0,25590,0,25591,25592,25593,0,25594,0,0,0,25596,0,25597,25615,
+0,0,0,0,0,25618,0,0,0,0,25619,25623,0,0,25629,0,0,25631,0,0,0,25635,25636,0,0,
+25649,0,0,0,0,25654,0,0,0,25661,25663,0,0,25671,0,0,25678,25698,0,25699,25702,
+25703,0,0,0,0,0,0,0,0,25704,0,0,0,0,0,25706,0,0,25710,0,25711,0,25712,0,25715,
+25716,25717,0,0,25718,25728,25732,0,0,0,25734,0,0,0,0,0,0,0,0,0,25737,0,0,25739,
+0,0,0,25740,0,25741,25745,0,25746,0,25748,25772,25778,0,0,0,0,0,25780,0,0,0,0,
+25781,0,25782,25784,25785,0,0,0,25789,0,0,0,0,0,0,25797,25801,0,0,0,25808,25809,
+0,0,25811,25814,25815,0,0,25817,0,0,0,0,0,0,0,0,25820,0,0,0,0,25832,25833,0,0,0,
+25846,0,0,0,25847,25848,0,0,0,0,0,0,0,0,0,25849,25850,0,0,25851,0,0,25852,0,
+25862,0,0,0,25863,25865,0,0,0,0,0,0,0,25867,25868,0,25869,25874,0,25875,0,25876,
+25877,0,0,0,0,25878,25902,0,0,0,0,0,0,0,25903,25904,25905,0,0,0,25908,25909,0,0,
+0,0,25910,0,0,0,0,0,0,0,25912,0,25913,0,0,0,0,0,0,0,0,25914,0,0,25916,0,0,0,0,0,
+25917,25927,0,0,0,0,25928,0,0,25930,0,0,0,25933,0,0,25938,25942,0,0,0,0,0,0,0,
+25945,0,25950,0,25956,0,0,25961,25962,0,0,25963,0,25964,25965,25966,0,0,0,0,0,
+25967,0,0,0,0,25968,0,0,0,25969,25971,0,0,0,0,0,25973,25975,0,0,0,0,0,0,0,25978,
+0,25981,0,0,0,25982,0,0,0,25984,0,0,0,0,0,0,0,25993,0,0,0,0,0,0,0,0,0,0,0,0,0,
+26002,0,0,0,26005,0,0,0,26006,26007,0,0,26014,26015,26016,0,0,0,0,0,0,26017,
+26018,26020,0,26022,26023,0,0,0,26024,26028,0,26029,26033,26034,26044,0,0,0,0,0,
+26046,0,0,26047,0,0,26049,0,26050,0,26051,0,0,0,0,0,26053,0,0,0,0,26054,26059,0,
+0,0,0,0,0,26060,0,26066,0,0,0,0,0,0,0,0,0,0,0,0,26067,0,26069,0,0,26071,0,0,0,
+26073,0,26074,26077,0,0,0,0,26078,0,0,0,26079,0,26090,0,0,26094,0,0,0,0,0,0,0,0,
+26095,0,0,0,0,0,0,0,0,0,0,0,26096,26101,0,26107,26122,0,26124,0,0,26125,0,0,0,0,
+0,0,26136,26141,26155,0,0,0,0,0,0,0,0,0,26164,26166,0,0,0,26167,0,26170,26171,0,
+0,26172,0,0,26174,0,0,0,0,0,0,0,0,0,0,0,0,0,26175,0,0,0,26176,26177,0,26321,
+26322,0,26323,0,0,26324,0,0,0,0,0,0,0,26325,0,26331,0,0,0,0,0,0,26335,0,0,0,
+26350,0,0,0,26379,0,0,26382,26383,26385,0,0,26392,26406,0,0,0,0,26411,0,0,0,0,0,
+26412,0,0,26420,0,0,26423,0,26424,26426,26432,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+26435,0,26436,0,0,0,0,0,26441,0,26444,0,0,0,26446,0,0,0,0,26447,0,0,0,0,26449,0,
+26450,26452,0,26453,26454,0,0,0,26455,0,0,0,26456,0,0,26458,0,0,26460,0,26463,0,
+0,0,0,0,0,0,0,26464,26470,0,0,0,0,0,0,0,0,0,26473,0,0,26474,0,0,0,0,0,0,0,26475,
+0,0,0,0,0,0,0,26477,0,26485,0,0,26486,0,26487,0,0,26488,26493,26494,0,0,26495,0,
+26497,26504,26506,0,0,0,0,0,26507,0,0,0,0,0,26509,0,0,26510,0,0,0,0,0,0,0,0,0,0,
+0,0,0,26512,0,26513,26515,0,0,0,26518,0,0,0,26519,0,26524,26526,0,0,0,26527,0,
+26532,0,26533,26537,26558,0,0,0,26559,0,0,0,26571,0,0,26573,0,26588,0,26593,0,0,
+0,0,0,0,26603,0,26604,0,0,0,0,0,0,0,0,0,0,26606,0,0,0,0,0,0,0,26607,26609,26611,
+26614,0,0,0,26616,26620,0,26621,0,0,0,0,0,26627,0,26629,0,0,26630,0,0,26632,
+26643,0,0,0,26644,0,0,0,0,0,0,0,0,0,26646,26647,0,0,0,26650,0,0,26656,0,0,0,0,
+26663,26670,26671,0,0,0,26685,26686,26687,0,26689,0,0,0,0,26744,0,26745,0,26747,
+26748,0,26749,26750,26751,0,0,0,0,26752,26755,0,0,0,26756,26769,0,0,0,26774,0,0,
+0,0,0,26775,0,26777,26778,0,26786,0,0,0,26787,0,0,0,0,0,0,0,0,0,0,0,0,0,26788,0,
+0,26789,0,0,0,0,0,26791,0,26792,26793,0,0,0,26794,0,26797,26798,0,0,0,26800,0,0,
+26803,0,26804,0,0,0,0,0,0,0,0,0,26805,0,0,26808,0,0,26809,0,0,0,0,0,0,0,26812,0,
+26825,0,0,0,0,0,0,0,26826,0,0,26827,26829,26834,0,0,0,0,26835,0,0,26849,0,26851,
+0,0,0,0,0,0,0,0,0,26852,0,26853,26857,0,26858,0,26859,0,0,0,0,0,0,0,26876,0,
+26878,26882,26883,0,0,0,0,26890,26894,0,0,0,0,26895,26896,0,0,0,0,0,26900,0,0,0,
+0,0,0,0,26911,26913,26914,26915,26916,26919,0,0,0,26921,26922,0,0,26925,0,0,0,
+26928,0,0,26929,26930,0,0,0,26931,0,26932,0,0,0,0,0,26933,0,0,0,0,0,0,26937,0,0,
+26943,0,0,26944,0,0,0,26946,0,0,0,0,0,0,0,26956,0,26958,0,0,26963,0,0,0,0,0,0,0,
+26965,0,26969,26970,26972,0,0,0,0,0,26973,0,26974,0,26978,0,26980,0,0,0,0,0,0,
+26982,0,26986,26987,0,26990,0,0,0,0,27003,27006,0,0,27007,27010,27012,27013,0,0,
+0,0,0,0,0,0,27014,27015,27018,0,27019,0,0,0,0,0,27025,0,0,0,27026,0,0,0,0,27029,
+27030,27031,27034,0,0,27036,27037,0,0,0,27038,27042,0,0,0,27044,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,27045,0,0,0,0,0,0,0,27046,0,0,0,0,0,0,0,27047,27049,0,27050,0,0,0,
+27051,27052,0,27055,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,27056,27058,27059,0,
+27061,0,27064,0,0,0,0,0,27069,0,0,27070,0,0,0,0,0,0,0,27072,0,0,0,0,0,0,0,0,
+27076,0,0,0,0,0,27078,0,27079,0,0,0,27081,0,0,0,0,0,0,27082,0,27083,27086,0,0,0,
+0,27087,0,0,0,0,0,27088,27090,0,27094,0,0,27095,0,27099,27102,0,0,0,27103,0,0,0,
+0,27105,0,0,0,27106,0,0,0,0,0,0,27107,0,0,0,0,27108,27117,0,0,0,0,27118,0,0,
+27124,0,27126,0,0,27130,27131,0,0,0,0,0,0,27147,0,0,0,0,27148,27149,0,0,0,0,
+27150,27151,0,27152,0,27159,0,0,0,27164,0,0,0,0,0,0,0,27175,0,27189,0,0,27191,0,
+27193,0,27195,0,27198,0,0,0,0,0,27200,0,0,0,0,27202,0,0,0,0,27203,0,0,27204,0,0,
+27206,0,27207,0,0,0,0,27209,0,0,0,27213,0,0,27216,27219,27220,27222,27223,0,
+27224,0,27225,27226,0,0,27233,0,0,0,0,27235,0,27237,0,27238,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,27239,0,27242,27243,0,27250,0,0,0,27251,0,27253,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,27254,27255,27258,0,0,0,27259,0,0,0,0,0,0,27267,0,27276,27278,
+0,0,0,0,0,0,0,0,0,27296,27297,27301,0,0,0,0,0,0,27302,0,0,0,0,0,0,27312,27313,0,
+0,0,0,0,27318,0,27320,0,27329,0,27330,27331,0,27332,0,0,0,0,27340,0,0,0,27348,0,
+0,0,0,0,0,27350,0,27351,0,0,0,0,27355,0,0,27358,27359,27361,0,0,0,27365,0,27367,
+0,27376,27378,0,0,27379,0,0,0,0,0,0,27396,0,27397,27404,0,0,0,0,0,27408,0,0,0,0,
+27453,0,0,0,27456,0,0,0,27458,0,0,0,0,0,0,0,27459,0,0,0,27460,0,0,27461,0,27465,
+27467,0,0,27469,0,27470,0,27471,0,27477,27482,0,0,0,0,0,0,27484,0,0,0,0,0,0,
+27485,0,0,0,0,0,27493,0,27494,27502,0,0,0,0,0,0,0,0,0,0,0,0,27511,27532,0,0,0,
+27533,27545,0,0,0,27546,0,0,0,0,0,0,0,0,0,0,27547,0,0,27549,27550,0,27551,0,0,0,
+0,0,0,0,27555,0,0,27571,0,27573,27574,27575,27577,0,27578,0,0,27579,27585,0,0,0,
+0,0,27586,0,0,27588,27589,0,0,0,0,27596,0,0,27600,0,0,0,0,0,0,0,0,0,0,0,27608,0,
+0,0,0,0,0,0,0,0,0,0,27610,0,0,0,27618,0,0,27620,0,0,0,27631,0,0,27632,27634,0,
+27636,27638,0,0,0,27643,0,27644,27649,0,0,0,0,0,0,0,0,0,0,0,0,0,27651,27660,0,
+27661,0,0,0,0,0,0,0,27662,0,0,27664,0,27665,0,0,0,27669,0,27671,0,0,0,27673,
+27674,0,0,0,27682,0,0,0,27711,0,27712,27713,27719,27720,0,0,27728,0,27729,0,0,0,
+0,0,0,0,0,0,27731,0,0,27732,0,27733,0,27738,0,0,0,27742,0,0,0,27743,27744,0,0,0,
+0,0,0,27745,27746,0,0,0,27747,27748,27751,27752,0,0,0,27768,27770,0,0,0,27774,
+27775,0,27776,27777,0,0,27781,0,27784,0,27786,0,0,27791,0,27792,27793,27804,0,
+27812,27813,0,0,0,0,0,0,0,0,27814,0,27825,0,27827,0,0,0,0,27828,27861,27862,0,0,
+0,27864,0,0,0,27865,27884,0,27889,0,0,0,0,0,27890,0,27891,0,0,0,27892,0,0,0,0,0,
+27897,27898,0,0,27899,0,0,0,27901,27905,0,0,27920,0,0,27921,0,27922,0,0,0,27931,
+27934,0,0,0,0,0,0,0,0,0,0,27941,0,27942,0,27945,0,27947,27954,0,0,0,0,27960,
+27963,0,0,0,0,0,0,0,0,27964,27965,0,0,0,27967,0,27969,27975,0,27976,27977,0,
+27981,0,27983,28051,28052,0,0,0,0,0,28056,0,0,0,0,0,0,28058,28059,0,0,28061,0,0,
+0,0,0,0,0,28063,0,0,0,0,0,0,28066,0,0,0,0,0,0,28069,28070,28072,0,28073,0,0,
+28074,0,0,0,0,28075,0,0,0,0,0,0,0,28078,0,0,0,0,28085,0,0,0,0,28086,0,0,0,0,0,0,
+28088,0,0,0,0,0,0,0,0,28090,0,28097,28114,28115,0,0,0,0,0,0,0,28116,0,0,0,0,0,
+28118,0,28129,0,28131,0,0,28135,0,0,0,28140,28141,0,0,0,28146,0,0,0,0,28152,0,0,
+0,0,28155,28157,28161,0,0,0,0,28166,0,28167,0,0,0,0,0,0,0,0,0,0,0,28172,0,0,0,0,
+0,0,28173,0,0,28175,0,0,0,0,0,0,0,0,0,28178,28188,0,28190,0,0,0,0,0,28191,0,
+28193,28206,0,0,28207,28209,0,28211,0,28213,0,0,0,28215,28216,28217,0,28222,0,
+28223,28225,0,0,0,28226,0,28227,28229,28232,0,0,0,0,0,0,0,0,0,28235,0,28241,0,0,
+28242,0,0,0,0,28243,0,0,0,28245,0,0,0,28248,28250,0,28251,28252,0,0,0,0,0,0,
+28253,0,0,28254,28255,0,0,28256,0,0,28258,0,0,0,0,0,28259,0,0,28260,0,0,28261,0,
+0,0,0,28262,28263,0,0,28264,0,0,0,28266,0,28268,28269,0,28270,28272,28274,0,
+28277,28278,0,0,0,28279,0,28280,28281,28283,0,28292,0,28294,0,28297,0,0,0,0,
+28299,0,0,0,0,0,28300,0,0,0,0,0,0,0,28301,0,0,0,0,0,0,0,0,0,0,0,0,0,28302,28303,
+0,0,0,0,28304,0,0,28305,0,28312,0,28313,28314,0,0,0,0,0,0,28315,0,0,0,28320,
+28321,0,0,28328,0,0,0,28329,28338,0,28339,0,0,28344,0,0,0,0,0,0,0,0,28347,0,0,0,
+0,0,0,0,0,28348,0,0,0,0,0,28411,0,28412,28413,0,28416,0,0,0,28420,0,0,0,0,0,
+28421,0,0,0,0,28423,0,0,0,28424,0,0,28428,0,0,0,0,0,28429,0,0,0,28431,28434,0,
+28458,0,0,0,0,0,0,0,0,0,0,0,28464,0,0,0,0,28465,0,28467,0,0,0,0,0,0,28471,0,0,0,
+0,28474,0,28480,0,28481,0,0,28485,0,0,0,0,28486,28488,0,0,28489,0,0,0,0,28492,0,
+0,0,28495,0,28497,0,28499,0,0,0,0,28500,0,0,28502,28503,0,0,0,28508,0,0,0,28510,
+0,0,28512,28513,28514,28521,0,28526,0,28527,28528,0,0,0,0,28529,0,0,28532,0,0,
+28537,28538,0,0,0,28539,0,28548,0,28553,28554,0,0,0,0,0,0,0,0,0,0,0,0,28560,
+28563,0,0,28564,0,0,0,0,28565,0,0,0,0,0,0,0,28566,28568,0,0,0,0,0,0,28569,0,0,0,
+28570,0,28572,28573,0,0,0,0,28575,0,0,0,0,28576,28581,28588,0,0,28589,0,0,0,
+28590,28595,0,28598,0,0,28601,0,0,28605,0,0,0,0,28614,28615,28619,0,0,0,0,0,0,
+28620,0,28626,0,0,28628,0,28631,0,28632,0,0,0,0,0,0,28635,0,0,0,28637,28638,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,28639,0,28643,0,0,28652,0,0,0,28662,0,
+28670,28671,0,0,0,0,0,0,0,0,0,28672,28673,28675,28676,0,0,0,0,0,0,0,28691,0,0,0,
+28695,0,0,0,28696,0,28697,28698,0,28705,0,28707,28708,28710,0,0,0,0,0,0,0,28711,
+28728,0,0,0,28736,0,0,0,28737,0,0,0,0,0,0,0,0,0,28738,0,28739,0,28741,0,0,28742,
+0,0,0,0,0,0,0,0,0,0,0,28745,0,0,0,0,0,0,28749,28750,28752,28754,28756,0,28757,0,
+0,0,0,28759,28760,0,0,0,0,0,0,28762,0,0,0,28764,0,0,0,0,0,0,28766,0,28767,28768,
+0,0,0,0,28769,28770,0,0,0,0,0,0,0,0,0,0,0,0,0,28771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,28772,0,28773,0,28782,0,0,0,0,0,0,28784,0,28785,0,28786,0,0,0,28787,0,0,0,
+28797,0,0,0,0,0,0,28799,0,0,28801,0,0,0,0,28802,0,28805,0,0,28806,0,0,28807,0,0,
+0,0,0,0,0,28808,0,0,0,0,0,28810,28812,0,0,28816,28819,0,0,28821,0,28826,0,0,0,
+28842,28852,0,0,28853,0,28854,28855,0,0,0,28857,0,0,0,28858,0,28867,28868,28869,
+0,0,0,28874,28880,28882,28890,28892,0,0,0,0,0,0,0,28895,0,0,0,28898,28899,0,0,0,
+28900,0,0,28904,0,28906,0,0,0,0,28907,0,0,0,0,0,0,28908,0,0,0,28910,0,28914,0,0,
+0,0,0,0,0,28915,28916,28919,0,0,28920,0,28921,0,0,0,0,0,0,0,0,28924,0,0,0,0,
+28926,28929,0,0,0,28930,0,28936,0,28939,0,0,0,0,28942,0,0,0,0,0,0,28956,0,0,0,
+28966,0,0,0,0,28967,0,0,0,0,0,0,0,0,0,28968,0,28971,0,28975,28976,0,28982,28983,
+0,0,28984,28989,28996,28997,28998,0,0,0,0,0,0,28999,0,0,0,0,0,29000,0,29001,0,0,
+0,29009,0,0,29011,0,0,29021,0,0,0,0,29024,0,29025,0,0,0,0,0,29026,0,0,0,29036,0,
+0,0,29037,0,0,0,0,29038,0,29045,0,29047,0,0,0,0,0,0,0,0,0,29051,0,0,0,29054,
+29056,29062,0,29070,29082,0,0,0,29083,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29084,0,0,
+0,0,29085,29088,0,0,0,0,0,0,0,29090,29097,0,0,0,29103,0,0,0,0,0,0,0,0,29105,0,0,
+0,0,0,29107,0,29109,0,0,0,29115,0,0,29120,0,0,29138,29140,0,0,0,0,0,0,0,0,0,
+29152,0,29160,29174,0,29176,0,0,29180,0,29181,0,0,0,0,0,0,0,0,29228,0,0,29229,0,
+0,29230,0,0,0,0,0,0,0,0,0,0,29234,0,0,0,29241,0,29245,0,29248,0,29250,29256,
+29280,0,29282,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29285,0,0,29286,29291,29292,0,0,0,0,
+29294,0,29295,0,0,0,0,0,29296,29297,29298,29300,0,29302,0,0,29304,29307,0,29312,
+0,0,0,29322,0,0,29323,0,0,29324,29326,29328,0,29335,0,0,0,0,0,0,0,29338,29339,0,
+0,0,0,0,29341,29343,0,0,0,0,29344,0,0,0,0,0,29345,0,0,0,0,29346,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,29347,29348,29349,0,0,29354,0,0,29355,0,0,0,0,0,0,0,0,29357,0,0,
+0,0,29364,0,29365,0,0,0,0,0,0,0,29366,0,0,29368,0,0,0,0,0,0,0,0,29378,0,29381,0,
+0,0,0,0,0,0,0,29386,0,0,0,0,0,0,29389,0,0,0,29390,0,0,29391,29397,0,29398,29412,
+29414,29418,29419,0,0,0,0,0,0,0,29420,0,0,0,0,0,0,0,29423,0,0,0,29435,0,0,0,
+29437,0,0,29439,0,29441,0,0,0,0,29443,0,29446,29450,29452,0,0,0,0,0,29456,0,0,0,
+0,0,29461,0,0,0,29464,0,0,0,0,0,0,0,0,29468,0,29473,0,0,0,29486,0,0,0,29490,0,0,
+0,29491,29492,0,0,29497,0,0,0,29498,0,29499,0,29502,29505,0,29509,0,0,0,29510,0,
+0,0,29512,0,0,0,29516,0,0,0,0,0,0,0,0,29518,0,29519,0,0,0,0,0,29520,29521,29529,
+0,0,0,0,0,0,0,0,29530,0,0,29531,29538,0,29540,0,0,0,29542,0,29543,29544,29547,0,
+0,29548,0,0,0,29549,0,0,0,29550,0,0,29552,0,0,0,0,29558,29561,0,29562,29564,0,0,
+29565,0,0,29566,0,0,0,0,0,0,0,0,0,0,29578,29584,29586,29591,0,0,0,0,29593,29594,
+0,0,29597,0,0,29613,0,29614,0,29615,0,0,0,0,29616,29617,0,0,29625,0,0,0,29632,0,
+0,0,0,0,0,0,29633,0,0,0,0,0,29634,29635,29637,0,29638,0,29641,29643,0,0,0,0,0,0,
+29644,0,29645,0,29649,0,0,0,29650,0,29653,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29656,
+29659,0,0,29660,0,0,0,29661,0,0,0,0,0,29664,0,0,0,29671,29673,0,0,0,0,0,0,0,
+29675,0,29677,29679,0,0,29684,0,0,0,0,0,29685,0,0,0,29687,0,0,0,29688,0,29689,
+29690,29700,0,29701,0,0,0,29702,0,29706,0,0,0,0,0,0,0,29720,0,29721,0,29727,0,
+29733,29734,0,29750,29761,0,29763,0,0,0,0,0,29764,0,0,29765,0,0,0,29771,0,0,0,0,
+0,0,0,0,0,0,0,0,29772,0,0,0,29773,29774,29775,0,0,0,0,0,0,0,0,0,0,0,29822,0,0,0,
+29824,0,29825,0,0,0,0,0,29827,0,0,0,0,0,0,0,0,29829,0,29832,29834,0,0,29835,0,0,
+29837,29838,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29843,0,0,0,0,29844,29845,0,0,0,
+0,0,0,0,0,0,29849,0,0,29869,29872,29890,29905,0,0,0,0,0,29907,29921,0,29922,0,0,
+29923,29926,29944,29946,0,0,0,0,0,0,0,29947,29948,0,0,0,29951,0,0,0,0,0,29953,0,
+0,29956,0,29957,0,0,29962,0,0,0,0,29971,0,0,0,29972,0,0,0,0,0,29978,0,29979,
+29992,30007,30008,30010,0,0,0,30013,0,0,0,0,30014,30016,0,0,0,0,0,0,0,0,0,0,0,
+30017,0,0,0,0,0,30023,30031,0,0,30033,0,0,0,0,0,0,0,0,0,0,30034,0,30038,0,30039,
+0,30040,0,0,0,0,0,0,30067,30068,0,0,0,30069,0,30072,0,0,0,30073,0,0,0,0,30075,0,
+0,0,0,0,0,30079,0,0,30080,0,0,0,0,0,30082,0,0,0,0,0,0,0,0,0,0,0,30084,30090,0,0,
+30091,0,0,0,0,30098,30118,0,30119,0,30121,30130,0,0,0,0,0,0,0,0,0,0,0,0,0,30131,
+30132,30133,0,0,0,0,0,0,30135,0,0,0,0,0,0,0,0,0,0,0,30136,0,0,30137,30138,0,0,0,
+30139,30146,0,0,0,0,0,30147,0,0,30148,30151,0,0,0,30168,0,30172,30173,0,0,0,0,0,
+0,0,0,30180,30181,0,30192,0,0,0,0,0,0,0,30194,30196,0,0,30199,0,0,30202,0,0,0,0,
+30203,0,0,0,0,0,0,0,0,0,0,30213,0,0,0,30216,0,0,30217,0,0,0,30218,0,0,0,0,30219,
+0,30220,0,30222,30227,0,0,0,0,0,30231,0,0,30233,30235,0,0,0,0,30238,0,30240,
+30243,30245,0,30250,30252,0,0,0,30269,0,0,30271,30272,0,0,0,30278,30280,0,0,
+30282,0,30284,0,30294,0,0,0,0,30295,30296,0,0,0,0,0,30298,30299,30302,30304,
+30306,0,0,0,0,0,0,30316,30317,0,0,0,30318,0,0,0,30319,0,30320,30322,30326,0,0,0,
+0,0,30327,0,30332,30348,30349,0,0,30356,0,0,0,0,0,0,0,0,30357,0,30358,0,30359,
+30360,0,0,30365,30366,30378,0,0,0,0,30379,0,0,30381,0,30385,0,30388,30397,0,0,0,
+30401,0,0,0,0,30403,0,0,0,0,0,30404,0,0,30405,0,30406,30408,0,30409,0,30410,0,0,
+0,30417,0,0,30418,30419,0,30420,0,30424,0,0,0,30427,30430,30432,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,30433,0,0,0,0,0,0,0,30436,0,30437,30438,0,30441,30442,0,0,
+0,30445,0,0,0,0,30452,30456,30457,0,0,0,30458,0,30464,0,0,0,0,0,0,30467,0,30469,
+0,0,0,0,0,30477,0,0,30484,0,0,0,0,0,30485,0,0,0,0,0,30486,30487,30497,30498,0,0,
+0,0,0,0,0,0,0,0,30505,0,30508,0,0,0,30509,30510,0,30514,30516,0,0,0,0,0,0,0,0,0,
+0,0,30523,0,30524,0,30525,0,0,0,0,30537,0,0,30538,0,0,0,0,0,30553,0,0,30555,
+30556,30558,30559,30560,0,0,30561,0,30562,0,0,0,0,0,0,0,0,30563,30570,30571,0,
+30586,30587,0,0,30590,0,0,30594,0,0,0,0,30611,30612,30623,30634,0,0,30636,30640,
+30655,30656,0,30657,0,0,30658,30669,0,30670,0,30676,30678,0,0,0,0,0,0,0,30679,0,
+0,0,0,0,0,0,0,0,0,0,30695,0,0,30698,0,0,0,0,30700,0,0,0,0,30701,0,30702,30703,0,
+0,0,0,30707,0,0,0,30709,0,0,30710,30719,30729,0,0,0,0,0,0,0,0,0,30731,0,0,30733,
+0,0,0,30734,0,0,0,0,0,30736,30737,0,0,0,30740,0,0,0,30743,0,30746,0,30747,30748,
+0,0,30751,30752,30753,0,0,0,30754,0,0,30760,0,0,0,0,0,0,0,30763,0,30764,0,0,
+30766,0,30769,30770,30771,30774,30777,0,0,30779,30780,30781,0,0,0,0,30790,0,0,0,
+30792,0,0,0,0,30810,0,0,0,0,0,0,0,30812,30819,0,0,30823,30824,0,30825,0,30827,0,
+0,0,0,0,0,30828,0,0,30830,0,0,0,30834,0,30835,0,30837,30838,0,30845,0,0,0,0,0,
+30846,30847,0,0,30849,0,30851,0,0,0,0,0,30852,30858,0,0,30859,0,30865,0,0,30866,
+0,0,30868,0,0,30869,0,0,0,30881,30883,0,0,0,0,0,30889,0,30891,0,0,0,0,30894,0,
+30895,0,30897,0,30898,0,0,0,30904,30906,0,30909,0,0,0,0,0,0,30910,0,0,0,30915,
+30933,30942,0,0,0,0,30943,0,0,30945,0,0,0,0,0,0,30946,0,0,30947,0,0,30955,30956,
+0,0,30960,0,0,30961,30962,30966,0,0,30969,30974,0,0,0,30976,0,0,30977,0,30978,
+30982,0,0,0,0,0,0,0,30994,30995,30998,0,31000,0,0,31001,0,0,31003,31005,0,0,
+31006,31011,0,0,31014,0,31016,0,0,0,0,31018,0,0,31020,31023,31024,31025,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,31027,31028,31029,0,0,0,0,0,0,31032,0,0,0,0,0,0,0,0,0,0,0,
+31036,31037,31038,0,0,0,31041,31043,31045,0,31047,0,0,0,31048,0,31049,0,0,0,
+31053,31054,31055,0,0,31063,0,0,0,0,0,31066,0,31068,31071,0,0,0,31072,31073,0,0,
+0,0,31075,0,0,31076,0,0,0,31077,31079,0,31080,0,0,0,0,0,0,0,0,0,0,31087,0,31142,
+0,31144,0,0,31145,31146,31147,0,0,0,0,0,0,0,0,0,0,0,0,0,0,31149,0,31151,31152,0,
+0,0,0,0,0,0,31162,31171,31174,31175,0,0,0,31176,0,0,0,0,0,0,0,31179,0,0,0,31186,
+0,0,0,31192,31195,0,0,31196,0,0,0,0,0,0,0,0,31198,0,0,0,0,0,31199,0,0,0,31205,0,
+0,0,0,31211,31215,0,0,0,0,31231,0,31232,0,0,0,0,0,0,0,0,0,0,31233,31236,31253,0,
+31254,0,0,0,0,0,0,31255,0,0,31257,0,0,0,0,0,0,0,0,0,31258,31259,0,0,31260,0,
+31261,0,0,0,0,0,31262,31263,0,0,31264,0,31266,0,31267,0,0,0,0,0,31281,0,31282,0,
+31284,0,0,31285,31287,31288,0,0,31290,0,0,0,31292,31295,0,31299,0,31300,0,0,0,0,
+0,31302,0,0,0,0,31303,0,0,0,0,0,0,31304,0,0,0,0,0,31305,31308,31309,31315,0,
+31317,0,0,0,0,0,31323,0,31324,0,0,0,0,0,31325,31327,0,0,31331,0,0,0,0,0,31333,0,
+0,0,0,0,31336,0,0,31337,0,0,0,0,0,0,31338,0,0,0,0,0,0,0,0,0,0,0,0,31339,0,0,0,0,
+0,0,0,31342,0,0,0,0,31345,0,0,0,0,0,0,0,0,31347,0,0,0,0,0,0,31348,0,0,31350,
+31351,0,31352,0,0,31354,0,0,0,0,31355,0,0,31356,0,0,0,0,0,0,0,0,0,0,31363,0,
+31372,0,0,31373,0,0,0,0,0,0,0,0,0,31376,0,31388,0,31389,0,31392,0,31401,0,31405,
+31407,31408,0,31409,0,0,0,0,0,0,31413,31415,0,0,0,31416,31418,0,0,0,0,0,0,31422,
+31423,0,0,31424,0,31425,31432,0,0,0,0,0,0,0,0,0,31433,0,0,0,0,0,0,0,0,31434,0,0,
+0,0,0,0,31435,0,0,0,0,31438,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,31442,0,31444,0,
+31448,0,0,31451,0,0,0,0,31452,0,31461,31465,0,0,31466,0,0,31467,0,0,31468,0,0,0,
+31469,31473,0,31476,0,0,0,0,31489,31490,0,0,0,0,0,0,0,31492,31493,31494,0,0,0,0,
+31501,31504,31505,0,0,0,0,0,0,0,0,0,31509,0,0,0,0,31510,0,0,31511,0,0,31513,0,0,
+0,0,0,0,0,0,0,31514,0,31522,31536,31539,31540,0,31541,0,0,0,0,0,0,31546,31553,
+31559,0,0,0,31560,31561,31562,0,0,31564,31567,0,31569,0,0,0,31570,0,0,0,0,31571,
+0,0,0,0,0,0,31572,31574,31580,31581,0,0,31582,31584,31585,31586,31595,0,31596,0,
+0,0,0,31597,0,31599,0,31600,31601,0,0,31603,31604,0,0,31608,31610,0,0,0,31611,0,
+31615,0,0,0,0,31616,0,0,0,0,0,0,31617,0,0,0,0,0,31618,0,0,0,0,0,0,31621,0,0,0,0,
+0,0,0,0,0,31622,31625,0,0,0,0,31627,0,31641,0,0,31642,0,0,31643,0,0,0,0,0,0,0,0,
+0,31644,0,31646,0,0,0,0,31648,0,0,0,31652,0,0,0,31657,0,0,31676,0,0,0,0,0,0,0,
+31689,31691,31692,0,31694,0,0,0,31696,0,31702,0,31703,0};
+
+static const DictWord kStaticDictionaryWords[31705] = {
+{0,0,0},{8,0,1002},{136,0,1015},{4,0,683},{4,10,325},{138,10,125},{7,11,572},{9,
+11,592},{11,11,680},{11,11,842},{11,11,924},{12,11,356},{12,11,550},{13,11,317},
+{13,11,370},{13,11,469},{13,11,471},{14,11,397},{18,11,69},{146,11,145},{134,0,
+1265},{136,11,534},{134,0,1431},{11,0,138},{140,0,40},{4,0,155},{7,0,1689},{4,10
+,718},{135,10,1216},{4,0,245},{5,0,151},{5,0,741},{6,0,1147},{7,0,498},{7,0,870}
+,{7,0,1542},{12,0,213},{14,0,36},{14,0,391},{17,0,111},{18,0,6},{18,0,46},{18,0,
+151},{19,0,36},{20,0,32},{20,0,56},{20,0,69},{20,0,102},{21,0,4},{22,0,8},{22,0,
+10},{22,0,14},{150,0,31},{4,0,624},{135,0,1752},{5,10,124},{5,10,144},{6,10,548}
+,{7,10,15},{7,10,153},{137,10,629},{6,0,503},{9,0,586},{13,0,468},{14,0,66},{16,
+0,58},{7,10,1531},{8,10,416},{9,10,275},{10,10,100},{11,10,658},{11,10,979},{12,
+10,86},{14,10,207},{15,10,20},{143,10,25},{5,0,603},{7,0,1212},{9,0,565},{14,0,
+301},{5,10,915},{6,10,1783},{7,10,211},{7,10,1353},{9,10,83},{10,10,376},{10,10,
+431},{11,10,543},{12,10,664},{13,10,280},{13,10,428},{14,10,128},{17,10,52},{145
+,10,81},{4,0,492},{133,0,451},{135,0,835},{141,0,70},{132,0,539},{7,11,748},{139
+,11,700},{7,11,1517},{11,11,597},{14,11,76},{14,11,335},{148,11,33},{6,0,113},{
+135,0,436},{4,10,338},{133,10,400},{136,0,718},{133,11,127},{133,11,418},{6,0,
+1505},{7,0,520},{6,11,198},{11,10,892},{140,11,83},{4,10,221},{5,10,659},{5,10,
+989},{7,10,697},{7,10,1211},{138,10,284},{135,0,1070},{5,11,276},{6,11,55},{135,
+11,1369},{134,0,1515},{6,11,1752},{136,11,726},{138,10,507},{15,0,78},{4,10,188}
+,{135,10,805},{5,10,884},{139,10,991},{133,11,764},{134,10,1653},{6,11,309},{7,
+11,331},{138,11,550},{135,11,1861},{132,11,348},{135,11,986},{135,11,1573},{12,0
+,610},{13,0,431},{144,0,59},{9,11,799},{140,10,166},{134,0,1530},{132,0,750},{
+132,0,307},{133,0,964},{6,11,194},{7,11,133},{10,11,493},{10,11,570},{139,11,664
+},{5,11,24},{5,11,569},{6,11,3},{6,11,119},{6,11,143},{6,11,440},{7,11,295},{7,
+11,599},{7,11,1686},{7,11,1854},{8,11,424},{9,11,43},{9,11,584},{9,11,760},{10,
+11,148},{10,11,328},{11,11,159},{11,11,253},{11,11,506},{12,11,487},{12,11,531},
+{144,11,33},{136,10,760},{5,11,14},{5,11,892},{6,11,283},{7,11,234},{136,11,537}
+,{135,11,1251},{4,11,126},{8,11,635},{147,11,34},{4,11,316},{135,11,1561},{6,0,
+999},{6,0,1310},{137,11,861},{4,11,64},{5,11,352},{5,11,720},{6,11,368},{139,11,
+359},{4,0,75},{5,0,180},{6,0,500},{7,0,58},{7,0,710},{10,0,645},{136,10,770},{
+133,0,649},{6,0,276},{7,0,282},{7,0,879},{7,0,924},{8,0,459},{9,0,599},{9,0,754}
+,{11,0,574},{12,0,128},{12,0,494},{13,0,52},{13,0,301},{15,0,30},{143,0,132},{
+132,0,200},{4,10,89},{5,10,489},{6,10,315},{7,10,553},{7,10,1745},{138,10,243},{
+135,11,1050},{7,0,1621},{6,10,1658},{9,10,3},{10,10,154},{11,10,641},{13,10,85},
+{13,10,201},{141,10,346},{6,11,175},{137,11,289},{5,11,432},{133,11,913},{6,0,
+225},{137,0,211},{7,0,718},{8,0,687},{139,0,374},{4,10,166},{133,10,505},{9,0,
+110},{134,10,1670},{8,0,58},{9,0,724},{11,0,809},{13,0,113},{145,0,72},{6,0,345}
+,{7,0,1247},{144,11,82},{5,11,931},{134,11,1698},{8,0,767},{8,0,803},{9,0,301},{
+137,0,903},{139,0,203},{134,0,1154},{7,0,1949},{136,0,674},{134,0,259},{135,0,
+1275},{5,11,774},{6,11,1637},{6,11,1686},{134,11,1751},{134,0,1231},{7,10,445},{
+8,10,307},{8,10,704},{10,10,41},{10,10,439},{11,10,237},{11,10,622},{140,10,201}
+,{136,0,254},{6,11,260},{135,11,1484},{139,0,277},{135,10,1977},{4,10,189},{5,10
+,713},{6,11,573},{136,10,57},{138,10,371},{132,10,552},{134,11,344},{133,0,248},
+{9,0,800},{10,0,693},{11,0,482},{11,0,734},{11,0,789},{134,11,240},{4,0,116},{5,
+0,95},{5,0,445},{7,0,1688},{8,0,29},{9,0,272},{11,0,509},{11,0,915},{4,11,292},{
+4,11,736},{5,11,871},{6,11,171},{6,11,1689},{7,11,1324},{7,11,1944},{9,11,415},{
+9,11,580},{14,11,230},{146,11,68},{7,0,490},{13,0,100},{143,0,75},{135,0,1641},{
+133,0,543},{7,11,209},{8,11,661},{10,11,42},{11,11,58},{12,11,58},{12,11,118},{
+141,11,32},{5,0,181},{8,0,41},{6,11,63},{135,11,920},{133,0,657},{133,11,793},{
+138,0,709},{7,0,25},{8,0,202},{138,0,536},{5,11,665},{135,10,1788},{145,10,49},{
+9,0,423},{140,0,89},{5,11,67},{6,11,62},{6,11,374},{135,11,1391},{8,0,113},{9,0,
+877},{10,0,554},{11,0,83},{12,0,136},{19,0,109},{9,11,790},{140,11,47},{138,10,
+661},{4,0,963},{10,0,927},{14,0,442},{135,10,1945},{133,0,976},{132,0,206},{4,11
+,391},{135,11,1169},{134,0,2002},{6,0,696},{134,0,1008},{134,0,1170},{132,11,271
+},{7,0,13},{8,0,226},{10,0,537},{11,0,570},{11,0,605},{11,0,799},{11,0,804},{12,
+0,85},{12,0,516},{12,0,623},{13,0,112},{13,0,361},{14,0,77},{14,0,78},{17,0,28},
+{19,0,110},{140,11,314},{132,0,769},{134,0,1544},{4,0,551},{137,0,678},{5,10,84}
+,{134,10,163},{9,0,57},{9,0,459},{10,0,425},{11,0,119},{12,0,184},{12,0,371},{13
+,0,358},{145,0,51},{5,0,188},{5,0,814},{8,0,10},{9,0,421},{9,0,729},{10,0,609},{
+11,0,689},{4,11,253},{5,10,410},{5,11,544},{7,11,300},{137,11,340},{134,0,624},{
+138,11,321},{135,0,1941},{18,0,130},{5,10,322},{8,10,186},{9,10,262},{10,10,187}
+,{142,10,208},{5,11,53},{5,11,541},{6,11,94},{6,11,499},{7,11,230},{139,11,321},
+{133,10,227},{4,0,378},{4,11,920},{5,11,25},{5,11,790},{6,11,457},{135,11,853},{
+137,0,269},{132,0,528},{134,0,1146},{7,10,1395},{8,10,486},{9,10,236},{9,10,878}
+,{10,10,218},{11,10,95},{19,10,17},{147,10,31},{7,10,2043},{8,10,672},{141,10,
+448},{134,0,1105},{134,0,1616},{134,11,1765},{140,11,163},{5,10,412},{133,11,822
+},{132,11,634},{6,0,656},{134,11,1730},{134,0,1940},{5,0,104},{6,0,173},{135,0,
+1631},{136,10,562},{6,11,36},{7,11,658},{8,11,454},{147,11,86},{5,0,457},{134,10
+,1771},{7,0,810},{8,0,138},{8,0,342},{9,0,84},{10,0,193},{11,0,883},{140,0,359},
+{9,0,620},{135,10,1190},{137,10,132},{7,11,975},{137,11,789},{6,0,95},{6,0,1934}
+,{136,0,967},{141,11,335},{6,0,406},{10,0,409},{10,0,447},{11,0,44},{140,0,100},
+{4,10,317},{135,10,1279},{132,0,477},{134,0,1268},{6,0,1941},{8,0,944},{5,10,63}
+,{133,10,509},{132,0,629},{132,11,104},{4,0,246},{133,0,375},{6,0,1636},{132,10,
+288},{135,11,1614},{9,0,49},{10,0,774},{8,10,89},{8,10,620},{11,10,628},{12,10,
+322},{143,10,124},{4,0,282},{7,0,1034},{11,0,398},{11,0,634},{12,0,1},{12,0,79},
+{12,0,544},{14,0,237},{17,0,10},{146,0,20},{132,0,824},{7,11,45},{9,11,542},{9,
+11,566},{138,11,728},{5,0,118},{5,0,499},{6,0,476},{6,0,665},{6,0,1176},{6,0,
+1196},{7,0,600},{7,0,888},{135,0,1096},{7,0,296},{7,0,596},{8,0,560},{8,0,586},{
+9,0,612},{11,0,304},{12,0,46},{13,0,89},{14,0,112},{145,0,122},{5,0,894},{6,0,
+1772},{9,0,1009},{138,10,120},{5,11,533},{7,11,755},{138,11,780},{151,10,1},{6,0
+,1474},{7,11,87},{142,11,288},{139,0,366},{137,10,461},{7,11,988},{7,11,1939},{9
+,11,64},{9,11,502},{12,11,7},{12,11,34},{13,11,12},{13,11,234},{147,11,77},{7,0,
+1599},{7,0,1723},{8,0,79},{8,0,106},{8,0,190},{8,0,302},{8,0,383},{8,0,713},{9,0
+,119},{9,0,233},{9,0,419},{9,0,471},{10,0,181},{10,0,406},{11,0,57},{11,0,85},{
+11,0,120},{11,0,177},{11,0,296},{11,0,382},{11,0,454},{11,0,758},{11,0,999},{12,
+0,27},{12,0,98},{12,0,131},{12,0,245},{12,0,312},{12,0,446},{12,0,454},{13,0,25}
+,{13,0,98},{13,0,426},{13,0,508},{14,0,70},{14,0,163},{14,0,272},{14,0,277},{14,
+0,370},{15,0,95},{15,0,138},{15,0,167},{17,0,38},{148,0,96},{135,10,1346},{10,0,
+200},{19,0,2},{151,0,22},{135,11,141},{134,10,85},{134,0,1759},{138,0,372},{145,
+0,16},{8,0,943},{132,11,619},{139,11,88},{5,11,246},{8,11,189},{9,11,355},{9,11,
+512},{10,11,124},{10,11,453},{11,11,143},{11,11,416},{11,11,859},{141,11,341},{5
+,0,258},{134,0,719},{6,0,1798},{6,0,1839},{8,0,900},{10,0,874},{10,0,886},{12,0,
+698},{12,0,732},{12,0,770},{16,0,106},{18,0,163},{18,0,170},{18,0,171},{152,0,20
+},{9,0,707},{11,0,326},{11,0,339},{12,0,423},{12,0,502},{20,0,62},{9,11,707},{11
+,11,326},{11,11,339},{12,11,423},{12,11,502},{148,11,62},{5,0,30},{7,0,495},{8,0
+,134},{9,0,788},{140,0,438},{133,11,678},{5,10,279},{6,10,235},{7,10,468},{8,10,
+446},{9,10,637},{10,10,717},{11,10,738},{140,10,514},{5,11,35},{6,11,287},{7,11,
+862},{7,11,1886},{138,11,179},{7,0,1948},{7,0,2004},{132,11,517},{5,10,17},{6,10
+,371},{137,10,528},{4,0,115},{5,0,669},{6,0,407},{8,0,311},{11,0,10},{141,0,5},{
+137,0,381},{5,0,50},{6,0,439},{7,0,780},{135,0,1040},{136,11,667},{11,11,403},{
+146,11,83},{5,0,1},{6,0,81},{138,0,520},{134,0,738},{5,0,482},{8,0,98},{9,0,172}
+,{10,0,360},{10,0,700},{10,0,822},{11,0,302},{11,0,778},{12,0,50},{12,0,127},{12
+,0,396},{13,0,62},{13,0,328},{14,0,122},{147,0,72},{9,11,157},{10,11,131},{140,
+11,72},{135,11,714},{135,11,539},{5,0,2},{6,0,512},{7,0,797},{7,0,1494},{8,0,253
+},{8,0,589},{9,0,77},{10,0,1},{10,0,129},{10,0,225},{11,0,118},{11,0,226},{11,0,
+251},{11,0,430},{11,0,701},{11,0,974},{11,0,982},{12,0,64},{12,0,260},{12,0,488}
+,{140,0,690},{5,11,394},{7,11,367},{7,11,487},{7,11,857},{7,11,1713},{8,11,246},
+{9,11,537},{10,11,165},{12,11,219},{140,11,561},{136,0,557},{5,10,779},{5,10,807
+},{6,10,1655},{134,10,1676},{4,10,196},{5,10,558},{133,10,949},{11,11,827},{12,
+11,56},{14,11,34},{143,11,148},{137,0,347},{133,0,572},{134,0,832},{4,0,12},{7,0
+,504},{7,0,522},{7,0,809},{8,0,797},{141,0,88},{4,10,752},{133,11,449},{7,11,86}
+,{8,11,103},{145,11,69},{7,11,2028},{138,11,641},{5,0,528},{6,11,1},{142,11,2},{
+134,0,861},{10,0,294},{4,10,227},{5,10,159},{5,10,409},{7,10,80},{10,10,479},{12
+,10,418},{14,10,50},{14,10,249},{142,10,295},{7,10,1470},{8,10,66},{8,10,137},{8
+,10,761},{9,10,638},{11,10,80},{11,10,212},{11,10,368},{11,10,418},{12,10,8},{13
+,10,15},{16,10,61},{17,10,59},{19,10,28},{148,10,84},{20,0,109},{135,11,1148},{6
+,11,277},{7,11,1274},{7,11,1386},{7,11,1392},{12,11,129},{146,11,87},{6,11,187},
+{7,11,39},{7,11,1203},{8,11,380},{8,11,542},{14,11,117},{149,11,28},{134,0,1187}
+,{5,0,266},{9,0,290},{9,0,364},{10,0,293},{11,0,606},{142,0,45},{6,11,297},{7,11
+,793},{139,11,938},{4,0,50},{6,0,594},{9,0,121},{10,0,49},{10,0,412},{139,0,834}
+,{136,0,748},{7,11,464},{8,11,438},{11,11,105},{11,11,363},{12,11,231},{14,11,
+386},{15,11,102},{148,11,75},{132,0,466},{13,0,399},{14,0,337},{6,10,38},{7,10,
+1220},{8,10,185},{8,10,256},{9,10,22},{9,10,331},{10,10,738},{11,10,205},{11,10,
+540},{11,10,746},{13,10,465},{142,10,194},{9,0,378},{141,0,162},{137,0,519},{4,
+10,159},{6,10,115},{7,10,252},{7,10,257},{7,10,1928},{8,10,69},{9,10,384},{10,10
+,91},{10,10,615},{12,10,375},{14,10,235},{18,10,117},{147,10,123},{5,11,604},{5,
+10,911},{136,10,278},{132,0,667},{8,0,351},{9,0,322},{4,10,151},{135,10,1567},{
+134,0,902},{133,10,990},{12,0,180},{5,10,194},{7,10,1662},{137,10,90},{4,0,869},
+{134,0,1996},{134,0,813},{133,10,425},{137,11,761},{132,0,260},{133,10,971},{5,
+11,20},{6,11,298},{7,11,659},{7,11,1366},{137,11,219},{4,0,39},{5,0,36},{7,0,
+1843},{8,0,407},{11,0,144},{140,0,523},{4,0,510},{10,0,587},{139,10,752},{7,0,29
+},{7,0,66},{7,0,1980},{10,0,487},{138,0,809},{13,0,260},{14,0,82},{18,0,63},{137
+,10,662},{5,10,72},{6,10,264},{7,10,21},{7,10,46},{7,10,2013},{8,10,215},{8,10,
+513},{10,10,266},{139,10,22},{134,0,570},{6,0,565},{7,0,1667},{4,11,439},{10,10,
+95},{11,10,603},{12,11,242},{13,10,443},{14,10,160},{143,10,4},{134,0,1464},{134
+,10,431},{9,0,372},{15,0,2},{19,0,10},{19,0,18},{5,10,874},{6,10,1677},{143,10,0
+},{132,0,787},{6,0,380},{12,0,399},{21,0,19},{7,10,939},{7,10,1172},{7,10,1671},
+{9,10,540},{10,10,696},{11,10,265},{11,10,732},{11,10,928},{11,10,937},{141,10,
+438},{137,0,200},{132,11,233},{132,0,516},{134,11,577},{132,0,844},{11,0,887},{
+14,0,365},{142,0,375},{132,11,482},{8,0,821},{140,0,44},{7,0,1655},{136,0,305},{
+5,10,682},{135,10,1887},{135,11,346},{132,10,696},{4,0,10},{7,0,917},{139,0,786}
+,{5,11,795},{6,11,1741},{8,11,417},{137,11,782},{4,0,1016},{134,0,2031},{5,0,684
+},{4,10,726},{133,10,630},{6,0,1021},{134,0,1480},{8,10,802},{136,10,838},{134,0
+,27},{134,0,395},{135,11,622},{7,11,625},{135,11,1750},{4,11,203},{135,11,1936},
+{6,10,118},{7,10,215},{7,10,1521},{140,10,11},{132,0,813},{136,0,511},{7,10,615}
+,{138,10,251},{135,10,1044},{145,0,56},{133,10,225},{6,0,342},{6,0,496},{8,0,275
+},{137,0,206},{4,0,909},{133,0,940},{132,0,891},{7,11,311},{9,11,308},{140,11,
+255},{4,10,370},{5,10,756},{135,10,1326},{4,0,687},{134,0,1596},{134,0,1342},{6,
+10,1662},{7,10,48},{8,10,771},{10,10,116},{13,10,104},{14,10,105},{14,10,184},{
+15,10,168},{19,10,92},{148,10,68},{138,10,209},{4,11,400},{5,11,267},{135,11,232
+},{151,11,12},{6,0,41},{141,0,160},{141,11,314},{134,0,1718},{136,0,778},{142,11
+,261},{134,0,1610},{133,0,115},{132,0,294},{14,0,314},{132,10,120},{132,0,983},{
+5,0,193},{140,0,178},{138,10,429},{5,10,820},{135,10,931},{6,0,994},{6,0,1051},{
+6,0,1439},{7,0,174},{133,11,732},{4,11,100},{7,11,679},{8,11,313},{138,10,199},{
+6,10,151},{6,10,1675},{7,10,383},{151,10,10},{6,0,1796},{8,0,848},{8,0,867},{8,0
+,907},{10,0,855},{140,0,703},{140,0,221},{4,0,122},{5,0,796},{5,0,952},{6,0,1660
+},{6,0,1671},{8,0,567},{9,0,687},{9,0,742},{10,0,686},{11,0,682},{11,0,909},{140
+,0,281},{5,11,362},{5,11,443},{6,11,318},{7,11,1019},{139,11,623},{5,11,463},{
+136,11,296},{11,0,583},{13,0,262},{6,10,1624},{12,10,422},{142,10,360},{5,0,179}
+,{7,0,1095},{135,0,1213},{4,10,43},{4,11,454},{5,10,344},{133,10,357},{4,0,66},{
+7,0,722},{135,0,904},{134,0,773},{7,0,352},{133,10,888},{5,11,48},{5,11,404},{6,
+11,557},{7,11,458},{8,11,597},{10,11,455},{10,11,606},{11,11,49},{11,11,548},{12
+,11,476},{13,11,18},{141,11,450},{134,11,418},{132,10,711},{5,11,442},{135,11,
+1984},{141,0,35},{137,0,152},{134,0,1197},{135,11,1093},{137,11,203},{137,10,440
+},{10,0,592},{10,0,753},{12,0,317},{12,0,355},{12,0,465},{12,0,469},{12,0,560},{
+12,0,578},{141,0,243},{133,0,564},{134,0,797},{5,10,958},{133,10,987},{5,11,55},
+{7,11,376},{140,11,161},{133,11,450},{134,0,556},{134,0,819},{11,10,276},{142,10
+,293},{7,0,544},{138,0,61},{8,0,719},{4,10,65},{5,10,479},{5,10,1004},{7,10,1913
+},{8,10,317},{9,10,302},{10,10,612},{141,10,22},{4,0,5},{5,0,498},{8,0,637},{9,0
+,521},{4,11,213},{4,10,261},{7,11,223},{7,10,510},{136,11,80},{5,0,927},{7,0,101
+},{4,10,291},{7,11,381},{7,11,806},{7,11,820},{8,11,354},{8,11,437},{8,11,787},{
+9,10,515},{9,11,657},{10,11,58},{10,11,339},{10,11,749},{11,11,914},{12,10,152},
+{12,11,162},{12,10,443},{13,11,75},{13,10,392},{14,11,106},{14,11,198},{14,11,
+320},{14,10,357},{14,11,413},{146,11,43},{6,0,1153},{7,0,1441},{136,11,747},{4,0
+,893},{5,0,780},{133,0,893},{138,11,654},{133,11,692},{133,0,238},{134,11,191},{
+4,10,130},{135,10,843},{6,0,1296},{5,10,42},{5,10,879},{7,10,245},{7,10,324},{7,
+10,1532},{11,10,463},{11,10,472},{13,10,363},{144,10,52},{134,0,1729},{6,0,1999}
+,{136,0,969},{4,10,134},{133,10,372},{4,0,60},{7,0,941},{7,0,1800},{8,0,314},{9,
+0,700},{139,0,487},{134,0,1144},{6,11,162},{7,11,1960},{136,11,831},{132,11,706}
+,{135,0,1147},{138,11,426},{138,11,89},{7,0,1853},{138,0,437},{136,0,419},{135,
+10,1634},{133,0,828},{5,0,806},{7,0,176},{7,0,178},{7,0,1240},{7,0,1976},{132,10
+,644},{135,11,1877},{5,11,420},{135,11,1449},{4,0,51},{5,0,39},{6,0,4},{7,0,591}
+,{7,0,849},{7,0,951},{7,0,1613},{7,0,1760},{7,0,1988},{9,0,434},{10,0,754},{11,0
+,25},{139,0,37},{10,11,57},{138,11,277},{135,10,540},{132,11,204},{135,0,159},{
+139,11,231},{133,0,902},{7,0,928},{7,11,366},{9,11,287},{12,11,199},{12,11,556},
+{140,11,577},{6,10,623},{136,10,789},{4,10,908},{5,10,359},{5,10,508},{6,10,1723
+},{7,10,343},{7,10,1996},{135,10,2026},{134,0,270},{4,10,341},{135,10,480},{5,11
+,356},{135,11,224},{11,11,588},{11,11,864},{11,11,968},{143,11,160},{132,0,556},
+{137,0,801},{132,0,416},{142,0,372},{5,0,152},{5,0,197},{7,0,340},{7,0,867},{10,
+0,548},{10,0,581},{11,0,6},{12,0,3},{12,0,19},{14,0,110},{142,0,289},{139,0,369}
+,{7,11,630},{9,11,567},{11,11,150},{11,11,444},{141,11,119},{134,11,539},{7,10,
+1995},{8,10,299},{11,10,890},{140,10,674},{7,0,34},{7,0,190},{8,0,28},{8,0,141},
+{8,0,444},{8,0,811},{9,0,468},{11,0,334},{12,0,24},{12,0,386},{140,0,576},{133,0
+,757},{7,0,1553},{136,0,898},{133,0,721},{136,0,1012},{4,0,789},{5,0,647},{135,0
+,1102},{132,0,898},{10,0,183},{4,10,238},{5,10,503},{6,10,179},{7,10,2003},{8,10
+,381},{8,10,473},{9,10,149},{10,10,788},{15,10,45},{15,10,86},{20,10,110},{150,
+10,57},{9,0,136},{19,0,107},{4,10,121},{5,10,156},{5,10,349},{10,10,605},{142,10
+,342},{4,11,235},{135,11,255},{4,11,194},{5,11,584},{6,11,384},{7,11,583},{10,11
+,761},{11,11,760},{139,11,851},{6,10,80},{6,10,1694},{7,10,173},{7,10,1974},{9,
+10,547},{10,10,730},{14,10,18},{150,10,39},{4,10,923},{134,10,1711},{5,0,277},{
+141,0,247},{132,0,435},{133,11,562},{134,0,1311},{5,11,191},{137,11,271},{132,10
+,595},{7,11,1537},{14,11,96},{143,11,73},{5,0,437},{7,0,502},{7,0,519},{7,0,1122
+},{7,0,1751},{14,0,211},{6,10,459},{7,10,1753},{7,10,1805},{8,10,658},{9,10,1},{
+11,10,959},{141,10,446},{6,0,814},{4,11,470},{5,11,473},{6,11,153},{7,11,1503},{
+7,11,1923},{10,11,701},{11,11,132},{11,11,168},{11,11,227},{11,11,320},{11,11,
+436},{11,11,525},{11,11,855},{12,11,41},{12,11,286},{13,11,103},{13,11,284},{14,
+11,255},{14,11,262},{15,11,117},{143,11,127},{5,0,265},{6,0,212},{135,0,28},{138
+,0,750},{133,11,327},{6,11,552},{7,11,1754},{137,11,604},{134,0,2012},{132,0,702
+},{5,11,80},{6,11,405},{7,11,403},{7,11,1502},{7,11,1626},{8,11,456},{9,11,487},
+{9,11,853},{9,11,889},{10,11,309},{11,11,721},{11,11,994},{12,11,430},{141,11,
+165},{5,0,808},{135,0,2045},{5,0,166},{8,0,739},{140,0,511},{134,10,490},{4,11,
+453},{5,11,887},{6,11,535},{8,11,6},{136,11,543},{4,0,119},{5,0,170},{5,0,447},{
+7,0,1708},{7,0,1889},{9,0,357},{9,0,719},{12,0,486},{140,0,596},{137,0,500},{7,
+10,250},{136,10,507},{132,10,158},{6,0,809},{134,0,1500},{9,0,327},{11,0,350},{
+11,0,831},{13,0,352},{4,10,140},{7,10,362},{8,10,209},{9,10,10},{9,10,503},{9,10
+,614},{10,10,689},{11,10,327},{11,10,725},{12,10,252},{12,10,583},{13,10,192},{
+14,10,269},{14,10,356},{148,10,50},{135,11,741},{4,0,450},{7,0,1158},{19,10,1},{
+19,10,26},{150,10,9},{6,0,597},{135,0,1318},{134,0,1602},{6,10,228},{7,10,1341},
+{9,10,408},{138,10,343},{7,0,1375},{7,0,1466},{138,0,331},{132,0,754},{132,10,
+557},{5,11,101},{6,11,88},{6,11,543},{7,11,1677},{9,11,100},{10,11,677},{14,11,
+169},{14,11,302},{14,11,313},{15,11,48},{143,11,84},{134,0,1368},{4,11,310},{9,
+11,795},{10,11,733},{11,11,451},{12,11,249},{14,11,115},{14,11,286},{143,11,100}
+,{132,10,548},{10,0,557},{7,10,197},{8,10,142},{8,10,325},{9,10,150},{9,10,596},
+{10,10,353},{11,10,74},{11,10,315},{12,10,662},{12,10,681},{14,10,423},{143,10,
+141},{133,11,587},{5,0,850},{136,0,799},{10,0,908},{12,0,701},{12,0,757},{142,0,
+466},{4,0,62},{5,0,275},{18,0,19},{6,10,399},{6,10,579},{7,10,692},{7,10,846},{7
+,10,1015},{7,10,1799},{8,10,403},{9,10,394},{10,10,133},{12,10,4},{12,10,297},{
+12,10,452},{16,10,81},{18,10,25},{21,10,14},{22,10,12},{151,10,18},{12,0,459},{7
+,10,1546},{11,10,299},{142,10,407},{132,10,177},{132,11,498},{7,11,217},{8,11,
+140},{138,11,610},{5,10,411},{135,10,653},{134,0,1802},{7,10,439},{10,10,727},{
+11,10,260},{139,10,684},{133,11,905},{11,11,580},{142,11,201},{134,0,1397},{5,10
+,208},{7,10,753},{135,10,1528},{7,0,238},{7,0,2033},{8,0,120},{8,0,188},{8,0,659
+},{9,0,598},{10,0,466},{12,0,342},{12,0,588},{13,0,503},{14,0,246},{143,0,92},{
+135,11,1041},{4,11,456},{7,11,105},{7,11,358},{7,11,1637},{8,11,643},{139,11,483
+},{6,0,1318},{134,0,1324},{4,0,201},{7,0,1744},{8,0,602},{11,0,247},{11,0,826},{
+17,0,65},{133,10,242},{8,0,164},{146,0,62},{133,10,953},{139,10,802},{133,0,615}
+,{7,11,1566},{8,11,269},{9,11,212},{9,11,718},{14,11,15},{14,11,132},{142,11,227
+},{133,10,290},{132,10,380},{5,10,52},{7,10,277},{9,10,368},{139,10,791},{135,0,
+1243},{133,11,539},{11,11,919},{141,11,409},{136,0,968},{133,11,470},{134,0,882}
+,{132,0,907},{5,0,100},{10,0,329},{12,0,416},{149,0,29},{10,10,138},{139,10,476}
+,{5,10,725},{5,10,727},{6,11,91},{7,11,435},{135,10,1811},{4,11,16},{5,11,316},{
+5,11,842},{6,11,370},{6,11,1778},{8,11,166},{11,11,812},{12,11,206},{12,11,351},
+{14,11,418},{16,11,15},{16,11,34},{18,11,3},{19,11,3},{19,11,7},{20,11,4},{149,
+11,21},{132,0,176},{5,0,636},{5,0,998},{7,0,9},{7,0,1508},{8,0,26},{9,0,317},{9,
+0,358},{10,0,210},{10,0,292},{10,0,533},{11,0,555},{12,0,526},{12,0,607},{13,0,
+263},{13,0,459},{142,0,271},{6,0,256},{8,0,265},{4,10,38},{7,10,307},{7,10,999},
+{7,10,1481},{7,10,1732},{7,10,1738},{9,10,414},{11,10,316},{12,10,52},{13,10,420
+},{147,10,100},{135,10,1296},{4,11,611},{133,11,606},{4,0,643},{142,11,21},{133,
+11,715},{133,10,723},{6,0,610},{135,11,597},{10,0,127},{141,0,27},{6,0,1995},{6,
+0,2001},{8,0,119},{136,0,973},{4,11,149},{138,11,368},{12,0,522},{4,11,154},{5,
+10,109},{6,10,1784},{7,11,1134},{7,10,1895},{8,11,105},{12,10,296},{140,10,302},
+{4,11,31},{6,11,429},{7,11,962},{9,11,458},{139,11,691},{10,0,553},{11,0,876},{
+13,0,193},{13,0,423},{14,0,166},{19,0,84},{4,11,312},{5,10,216},{7,10,1879},{9,
+10,141},{9,10,270},{9,10,679},{10,10,159},{11,10,197},{12,10,538},{12,10,559},{
+14,10,144},{14,10,167},{143,10,67},{134,0,1582},{7,0,1578},{135,11,1578},{137,10
+,81},{132,11,236},{134,10,391},{134,0,795},{7,10,322},{136,10,249},{5,11,836},{5
+,11,857},{6,11,1680},{7,11,59},{147,11,53},{135,0,432},{10,11,68},{139,11,494},{
+4,11,81},{139,11,867},{7,0,126},{136,0,84},{142,11,280},{5,11,282},{8,11,650},{9
+,11,295},{9,11,907},{138,11,443},{136,0,790},{5,10,632},{138,10,526},{6,0,64},{
+12,0,377},{13,0,309},{14,0,141},{14,0,429},{14,11,141},{142,11,429},{134,0,1529}
+,{6,0,321},{7,0,1857},{9,0,530},{19,0,99},{7,10,948},{7,10,1042},{8,10,235},{8,
+10,461},{9,10,453},{10,10,354},{145,10,77},{7,0,1104},{11,0,269},{11,0,539},{11,
+0,627},{11,0,706},{11,0,975},{12,0,248},{12,0,434},{12,0,600},{12,0,622},{13,0,
+297},{13,0,485},{14,0,69},{14,0,409},{143,0,108},{4,10,362},{7,10,52},{7,10,303}
+,{10,11,70},{12,11,26},{14,11,17},{14,11,178},{15,11,34},{149,11,12},{11,0,977},
+{141,0,507},{9,0,34},{139,0,484},{5,10,196},{6,10,486},{7,10,212},{8,10,309},{
+136,10,346},{6,0,1700},{7,0,26},{7,0,293},{7,0,382},{7,0,1026},{7,0,1087},{7,0,
+2027},{8,0,24},{8,0,114},{8,0,252},{8,0,727},{8,0,729},{9,0,30},{9,0,199},{9,0,
+231},{9,0,251},{9,0,334},{9,0,361},{9,0,712},{10,0,55},{10,0,60},{10,0,232},{10,
+0,332},{10,0,384},{10,0,396},{10,0,504},{10,0,542},{10,0,652},{11,0,20},{11,0,48
+},{11,0,207},{11,0,291},{11,0,298},{11,0,342},{11,0,365},{11,0,394},{11,0,620},{
+11,0,705},{11,0,1017},{12,0,123},{12,0,340},{12,0,406},{12,0,643},{13,0,61},{13,
+0,269},{13,0,311},{13,0,319},{13,0,486},{14,0,234},{15,0,62},{15,0,85},{16,0,71}
+,{18,0,119},{20,0,105},{135,10,1912},{4,11,71},{5,11,376},{7,11,119},{138,11,665
+},{10,0,918},{10,0,926},{4,10,686},{136,11,55},{138,10,625},{136,10,706},{132,11
+,479},{4,10,30},{133,10,43},{6,0,379},{7,0,270},{8,0,176},{8,0,183},{9,0,432},{9
+,0,661},{12,0,247},{12,0,617},{18,0,125},{7,11,607},{8,11,99},{152,11,4},{5,0,
+792},{133,0,900},{4,11,612},{133,11,561},{4,11,41},{4,10,220},{5,11,74},{7,10,
+1535},{7,11,1627},{11,11,871},{140,11,619},{135,0,1920},{7,11,94},{11,11,329},{
+11,11,965},{12,11,241},{14,11,354},{15,11,22},{148,11,63},{9,11,209},{137,11,300
+},{134,0,771},{135,0,1979},{4,0,901},{133,0,776},{142,0,254},{133,11,98},{9,11,
+16},{141,11,386},{133,11,984},{4,11,182},{6,11,205},{135,11,220},{7,10,1725},{7,
+10,1774},{138,10,393},{5,10,263},{134,10,414},{4,11,42},{9,11,205},{9,11,786},{
+138,11,659},{14,0,140},{148,0,41},{8,0,440},{10,0,359},{6,10,178},{6,11,289},{6,
+10,1750},{7,11,1670},{9,10,690},{10,10,155},{10,10,373},{11,10,698},{12,11,57},{
+13,10,155},{20,10,93},{151,11,4},{4,0,37},{5,0,334},{7,0,1253},{151,11,25},{4,0,
+508},{4,11,635},{5,10,97},{137,10,393},{139,11,533},{4,0,640},{133,0,513},{134,
+10,1639},{132,11,371},{4,11,272},{7,11,836},{7,11,1651},{145,11,89},{5,11,825},{
+6,11,444},{6,11,1640},{136,11,308},{4,10,191},{7,10,934},{8,10,647},{145,10,97},
+{12,0,246},{15,0,162},{19,0,64},{20,0,8},{20,0,95},{22,0,24},{152,0,17},{4,0,533
+},{5,10,165},{9,10,346},{138,10,655},{5,11,737},{139,10,885},{133,10,877},{8,10,
+128},{139,10,179},{137,11,307},{140,0,752},{133,0,920},{135,0,1048},{5,0,153},{6
+,0,580},{6,10,1663},{7,10,132},{7,10,1154},{7,10,1415},{7,10,1507},{12,10,493},{
+15,10,105},{151,10,15},{5,10,459},{7,10,1073},{8,10,241},{136,10,334},{138,0,391
+},{135,0,1952},{133,11,525},{8,11,641},{11,11,388},{140,11,580},{142,0,126},{134
+,0,640},{132,0,483},{7,0,1616},{9,0,69},{6,10,324},{6,10,520},{7,10,338},{7,10,
+1729},{8,10,228},{139,10,750},{5,11,493},{134,11,528},{135,0,734},{4,11,174},{
+135,11,911},{138,0,480},{9,0,495},{146,0,104},{135,10,705},{9,0,472},{4,10,73},{
+6,10,612},{7,10,927},{7,10,1330},{7,10,1822},{8,10,217},{9,10,765},{9,10,766},{
+10,10,408},{11,10,51},{11,10,793},{12,10,266},{15,10,158},{20,10,89},{150,10,32}
+,{7,11,548},{137,11,58},{4,11,32},{5,11,215},{6,11,269},{7,11,1782},{7,11,1892},
+{10,11,16},{11,11,822},{11,11,954},{141,11,481},{132,0,874},{9,0,229},{5,10,389}
+,{136,10,636},{7,11,1749},{136,11,477},{134,0,948},{5,11,308},{135,11,1088},{4,0
+,748},{139,0,1009},{136,10,21},{6,0,555},{135,0,485},{5,11,126},{8,11,297},{9,11
+,366},{9,11,445},{12,11,53},{12,11,374},{141,11,492},{7,11,1551},{139,11,361},{
+136,0,193},{136,0,472},{8,0,653},{13,0,93},{147,0,14},{132,0,984},{132,11,175},{
+5,0,172},{6,0,1971},{132,11,685},{149,11,8},{133,11,797},{13,0,83},{5,10,189},{7
+,10,442},{7,10,443},{8,10,281},{12,10,174},{141,10,261},{134,0,1568},{133,11,565
+},{139,0,384},{133,0,260},{7,0,758},{7,0,880},{7,0,1359},{9,0,164},{9,0,167},{10
+,0,156},{10,0,588},{12,0,101},{14,0,48},{15,0,70},{6,10,2},{7,10,1262},{7,10,
+1737},{8,10,22},{8,10,270},{8,10,612},{9,10,312},{9,10,436},{10,10,311},{10,10,
+623},{11,10,72},{11,10,330},{11,10,455},{12,10,321},{12,10,504},{12,10,530},{12,
+10,543},{13,10,17},{13,10,156},{13,10,334},{17,10,60},{148,10,64},{4,11,252},{7,
+11,1068},{10,11,434},{11,11,228},{11,11,426},{13,11,231},{18,11,106},{148,11,87}
+,{7,10,354},{10,10,410},{139,10,815},{6,0,367},{7,10,670},{7,10,1327},{8,10,411}
+,{8,10,435},{9,10,653},{9,10,740},{10,10,385},{11,10,222},{11,10,324},{11,10,829
+},{140,10,611},{7,0,1174},{6,10,166},{135,10,374},{146,0,121},{132,0,828},{5,11,
+231},{138,11,509},{7,11,601},{9,11,277},{9,11,674},{10,11,178},{10,11,257},{10,
+11,418},{11,11,531},{11,11,544},{11,11,585},{12,11,113},{12,11,475},{13,11,99},{
+142,11,428},{134,0,1541},{135,11,1779},{5,0,343},{134,10,398},{135,10,50},{135,
+11,1683},{4,0,440},{7,0,57},{8,0,167},{8,0,375},{9,0,82},{9,0,561},{9,0,744},{10
+,0,620},{137,11,744},{134,0,926},{6,10,517},{7,10,1159},{10,10,621},{139,10,192}
+,{137,0,827},{8,0,194},{136,0,756},{10,10,223},{139,10,645},{7,10,64},{136,10,
+245},{4,11,399},{5,11,119},{5,11,494},{7,11,751},{137,11,556},{132,0,808},{135,0
+,22},{7,10,1763},{140,10,310},{5,0,639},{7,0,1249},{11,0,896},{134,11,584},{134,
+0,1614},{135,0,860},{135,11,1121},{5,10,129},{6,10,61},{135,10,947},{4,0,102},{7
+,0,815},{7,0,1699},{139,0,964},{13,10,505},{141,10,506},{139,10,1000},{132,11,
+679},{132,0,899},{132,0,569},{5,11,694},{137,11,714},{136,0,795},{6,0,2045},{139
+,11,7},{6,0,52},{9,0,104},{9,0,559},{12,0,308},{147,0,87},{4,0,301},{132,0,604},
+{133,10,637},{136,0,779},{5,11,143},{5,11,769},{6,11,1760},{7,11,682},{7,11,1992
+},{136,11,736},{137,10,590},{147,0,32},{137,11,527},{5,10,280},{135,10,1226},{
+134,0,494},{6,0,677},{6,0,682},{134,0,1044},{133,10,281},{135,10,1064},{7,0,508}
+,{133,11,860},{6,11,422},{7,11,0},{7,11,1544},{9,11,577},{11,11,990},{12,11,141}
+,{12,11,453},{13,11,47},{141,11,266},{134,0,1014},{5,11,515},{137,11,131},{134,0
+,957},{132,11,646},{6,0,310},{7,0,1849},{8,0,72},{8,0,272},{8,0,431},{9,0,12},{9
+,0,376},{10,0,563},{10,0,630},{10,0,796},{10,0,810},{11,0,367},{11,0,599},{11,0,
+686},{140,0,672},{7,0,570},{4,11,396},{7,10,120},{7,11,728},{8,10,489},{9,11,117
+},{9,10,319},{10,10,820},{11,10,1004},{12,10,379},{12,10,679},{13,10,117},{13,11
+,202},{13,10,412},{14,10,25},{15,10,52},{15,10,161},{16,10,47},{20,11,51},{149,
+10,2},{6,11,121},{6,11,124},{6,11,357},{7,11,1138},{7,11,1295},{8,11,162},{139,
+11,655},{8,0,449},{4,10,937},{5,10,801},{136,11,449},{139,11,958},{6,0,181},{7,0
+,537},{8,0,64},{9,0,127},{10,0,496},{12,0,510},{141,0,384},{138,11,253},{4,0,244
+},{135,0,233},{133,11,237},{132,10,365},{6,0,1650},{10,0,702},{139,0,245},{5,10,
+7},{139,10,774},{13,0,463},{20,0,49},{13,11,463},{148,11,49},{4,10,734},{5,10,
+662},{134,10,430},{4,10,746},{135,10,1090},{5,10,360},{136,10,237},{137,0,338},{
+143,11,10},{7,11,571},{138,11,366},{134,0,1279},{9,11,513},{10,11,22},{10,11,39}
+,{12,11,122},{140,11,187},{133,0,896},{146,0,178},{134,0,695},{137,0,808},{134,
+11,587},{7,11,107},{7,11,838},{8,11,550},{138,11,401},{7,0,1117},{136,0,539},{4,
+10,277},{5,10,608},{6,10,493},{7,10,457},{140,10,384},{133,11,768},{12,0,257},{7
+,10,27},{135,10,316},{140,0,1003},{4,0,207},{5,0,586},{5,0,676},{6,0,448},{8,0,
+244},{11,0,1},{13,0,3},{16,0,54},{17,0,4},{18,0,13},{133,10,552},{4,10,401},{137
+,10,264},{5,0,516},{7,0,1883},{135,11,1883},{12,0,960},{132,11,894},{5,0,4},{5,0
+,810},{6,0,13},{6,0,538},{6,0,1690},{6,0,1726},{7,0,499},{7,0,1819},{8,0,148},{8
+,0,696},{8,0,791},{12,0,125},{143,0,9},{135,0,1268},{11,0,30},{14,0,315},{9,10,
+543},{10,10,524},{12,10,524},{16,10,18},{20,10,26},{148,10,65},{6,0,748},{4,10,
+205},{5,10,623},{7,10,104},{136,10,519},{11,0,542},{139,0,852},{140,0,6},{132,0,
+848},{7,0,1385},{11,0,582},{11,0,650},{11,0,901},{11,0,949},{12,0,232},{12,0,236
+},{13,0,413},{13,0,501},{18,0,116},{7,10,579},{9,10,41},{9,10,244},{9,10,669},{
+10,10,5},{11,10,861},{11,10,951},{139,10,980},{4,0,945},{6,0,1811},{6,0,1845},{6
+,0,1853},{6,0,1858},{8,0,862},{12,0,782},{12,0,788},{18,0,160},{148,0,117},{132,
+10,717},{4,0,925},{5,0,803},{8,0,698},{138,0,828},{134,0,1416},{132,0,610},{139,
+0,992},{6,0,878},{134,0,1477},{135,0,1847},{138,11,531},{137,11,539},{134,11,272
+},{133,0,383},{134,0,1404},{132,10,489},{4,11,9},{5,11,128},{7,11,368},{11,11,
+480},{148,11,3},{136,0,986},{9,0,660},{138,0,347},{135,10,892},{136,11,682},{7,0
+,572},{9,0,592},{11,0,680},{12,0,356},{140,0,550},{7,0,1411},{138,11,527},{4,11,
+2},{7,11,545},{135,11,894},{137,10,473},{11,0,64},{7,11,481},{7,10,819},{9,10,26
+},{9,10,392},{9,11,792},{10,10,152},{10,10,226},{12,10,276},{12,10,426},{12,10,
+589},{13,10,460},{15,10,97},{19,10,48},{148,10,104},{135,10,51},{136,11,445},{
+136,11,646},{135,0,606},{132,10,674},{6,0,1829},{134,0,1830},{132,10,770},{5,10,
+79},{7,10,1027},{7,10,1477},{139,10,52},{5,11,530},{142,11,113},{134,10,1666},{7
+,0,748},{139,0,700},{134,10,195},{133,10,789},{9,0,87},{10,0,365},{4,10,251},{4,
+10,688},{7,10,513},{135,10,1284},{136,11,111},{133,0,127},{6,0,198},{140,0,83},{
+133,11,556},{133,10,889},{4,10,160},{5,10,330},{7,10,1434},{136,10,174},{5,0,276
+},{6,0,55},{7,0,1369},{138,0,864},{8,11,16},{140,11,568},{6,0,1752},{136,0,726},
+{135,0,1066},{133,0,764},{6,11,186},{137,11,426},{11,0,683},{139,11,683},{6,0,
+309},{7,0,331},{138,0,550},{133,10,374},{6,0,1212},{6,0,1852},{7,0,1062},{8,0,
+874},{8,0,882},{138,0,936},{132,11,585},{134,0,1364},{7,0,986},{133,10,731},{6,0
+,723},{6,0,1408},{138,0,381},{135,0,1573},{134,0,1025},{4,10,626},{5,10,642},{6,
+10,425},{10,10,202},{139,10,141},{4,11,93},{5,11,252},{6,11,229},{7,11,291},{9,
+11,550},{139,11,644},{137,11,749},{137,11,162},{132,11,381},{135,0,1559},{6,0,
+194},{7,0,133},{10,0,493},{10,0,570},{139,0,664},{5,0,24},{5,0,569},{6,0,3},{6,0
+,119},{6,0,143},{6,0,440},{7,0,295},{7,0,599},{7,0,1686},{7,0,1854},{8,0,424},{9
+,0,43},{9,0,584},{9,0,760},{10,0,148},{10,0,328},{11,0,159},{11,0,253},{11,0,506
+},{12,0,487},{140,0,531},{6,0,661},{134,0,1517},{136,10,835},{151,10,17},{5,0,14
+},{5,0,892},{6,0,283},{7,0,234},{136,0,537},{139,0,541},{4,0,126},{8,0,635},{147
+,0,34},{4,0,316},{4,0,495},{135,0,1561},{4,11,187},{5,11,184},{5,11,690},{7,11,
+1869},{138,11,756},{139,11,783},{4,0,998},{137,0,861},{136,0,1009},{139,11,292},
+{5,11,21},{6,11,77},{6,11,157},{7,11,974},{7,11,1301},{7,11,1339},{7,11,1490},{7
+,11,1873},{137,11,628},{7,11,1283},{9,11,227},{9,11,499},{10,11,341},{11,11,325}
+,{11,11,408},{14,11,180},{15,11,144},{18,11,47},{147,11,49},{4,0,64},{5,0,352},{
+5,0,720},{6,0,368},{139,0,359},{5,10,384},{8,10,455},{140,10,48},{5,10,264},{134
+,10,184},{7,0,1577},{10,0,304},{10,0,549},{12,0,365},{13,0,220},{13,0,240},{142,
+0,33},{134,0,1107},{134,0,929},{135,0,1142},{6,0,175},{137,0,289},{5,0,432},{133
+,0,913},{6,0,279},{7,0,219},{5,10,633},{135,10,1323},{7,0,785},{7,10,359},{8,10,
+243},{140,10,175},{139,0,595},{132,10,105},{8,11,398},{9,11,681},{139,11,632},{
+140,0,80},{5,0,931},{134,0,1698},{142,11,241},{134,11,20},{134,0,1323},{11,0,526
+},{11,0,939},{141,0,290},{5,0,774},{6,0,780},{6,0,1637},{6,0,1686},{6,0,1751},{8
+,0,559},{141,0,109},{141,0,127},{7,0,1167},{11,0,934},{13,0,391},{17,0,76},{135,
+11,709},{135,0,963},{6,0,260},{135,0,1484},{134,0,573},{4,10,758},{139,11,941},{
+135,10,1649},{145,11,36},{4,0,292},{137,0,580},{4,0,736},{5,0,871},{6,0,1689},{
+135,0,1944},{7,11,945},{11,11,713},{139,11,744},{134,0,1164},{135,11,937},{6,0,
+1922},{9,0,982},{15,0,173},{15,0,178},{15,0,200},{18,0,189},{18,0,207},{21,0,47}
+,{135,11,1652},{7,0,1695},{139,10,128},{6,0,63},{135,0,920},{133,0,793},{143,11,
+134},{133,10,918},{5,0,67},{6,0,62},{6,0,374},{135,0,1391},{9,0,790},{12,0,47},{
+4,11,579},{5,11,226},{5,11,323},{135,11,960},{10,11,784},{141,11,191},{4,0,391},
+{135,0,1169},{137,0,443},{13,11,232},{146,11,35},{132,10,340},{132,0,271},{137,
+11,313},{5,11,973},{137,11,659},{134,0,1140},{6,11,135},{135,11,1176},{4,0,253},
+{5,0,544},{7,0,300},{137,0,340},{7,0,897},{5,10,985},{7,10,509},{145,10,96},{138
+,11,735},{135,10,1919},{138,0,890},{5,0,818},{134,0,1122},{5,0,53},{5,0,541},{6,
+0,94},{6,0,499},{7,0,230},{139,0,321},{4,0,920},{5,0,25},{5,0,790},{6,0,457},{7,
+0,853},{8,0,788},{142,11,31},{132,10,247},{135,11,314},{132,0,468},{7,0,243},{6,
+10,337},{7,10,494},{8,10,27},{8,10,599},{138,10,153},{4,10,184},{5,10,390},{7,10
+,618},{7,10,1456},{139,10,710},{134,0,870},{134,0,1238},{134,0,1765},{10,0,853},
+{10,0,943},{14,0,437},{14,0,439},{14,0,443},{14,0,446},{14,0,452},{14,0,469},{14
+,0,471},{14,0,473},{16,0,93},{16,0,102},{16,0,110},{148,0,121},{4,0,605},{7,0,
+518},{7,0,1282},{7,0,1918},{10,0,180},{139,0,218},{133,0,822},{4,0,634},{11,0,
+916},{142,0,419},{6,11,281},{7,11,6},{8,11,282},{8,11,480},{8,11,499},{9,11,198}
+,{10,11,143},{10,11,169},{10,11,211},{10,11,417},{10,11,574},{11,11,147},{11,11,
+395},{12,11,75},{12,11,407},{12,11,608},{13,11,500},{142,11,251},{134,0,898},{6,
+0,36},{7,0,658},{8,0,454},{150,11,48},{133,11,674},{135,11,1776},{4,11,419},{10,
+10,227},{11,10,497},{11,10,709},{140,10,415},{6,10,360},{7,10,1664},{136,10,478}
+,{137,0,806},{12,11,508},{14,11,102},{14,11,226},{144,11,57},{135,11,1123},{4,11
+,138},{7,11,1012},{7,11,1280},{137,11,76},{5,11,29},{140,11,638},{136,10,699},{
+134,0,1326},{132,0,104},{135,11,735},{132,10,739},{134,0,1331},{7,0,260},{135,11
+,260},{135,11,1063},{7,0,45},{9,0,542},{9,0,566},{10,0,728},{137,10,869},{4,10,
+67},{5,10,422},{7,10,1037},{7,10,1289},{7,10,1555},{9,10,741},{145,10,108},{139,
+0,263},{134,0,1516},{14,0,146},{15,0,42},{16,0,23},{17,0,86},{146,0,17},{138,0,
+468},{136,0,1005},{4,11,17},{5,11,23},{7,11,995},{11,11,383},{11,11,437},{12,11,
+460},{140,11,532},{7,0,87},{142,0,288},{138,10,96},{135,11,626},{144,10,26},{7,0
+,988},{7,0,1939},{9,0,64},{9,0,502},{12,0,22},{12,0,34},{13,0,12},{13,0,234},{
+147,0,77},{13,0,133},{8,10,203},{11,10,823},{11,10,846},{12,10,482},{13,10,277},
+{13,10,302},{13,10,464},{14,10,205},{142,10,221},{4,10,449},{133,10,718},{135,0,
+141},{6,0,1842},{136,0,872},{8,11,70},{12,11,171},{141,11,272},{4,10,355},{6,10,
+311},{9,10,256},{138,10,404},{132,0,619},{137,0,261},{10,11,233},{10,10,758},{
+139,11,76},{5,0,246},{8,0,189},{9,0,355},{9,0,512},{10,0,124},{10,0,453},{11,0,
+143},{11,0,416},{11,0,859},{141,0,341},{134,11,442},{133,10,827},{5,10,64},{140,
+10,581},{4,10,442},{7,10,1047},{7,10,1352},{135,10,1643},{134,11,1709},{5,0,678}
+,{6,0,305},{7,0,775},{7,0,1065},{133,10,977},{11,11,69},{12,11,105},{12,11,117},
+{13,11,213},{14,11,13},{14,11,62},{14,11,177},{14,11,421},{15,11,19},{146,11,141
+},{137,11,309},{5,0,35},{7,0,862},{7,0,1886},{138,0,179},{136,0,285},{132,0,517}
+,{7,11,976},{9,11,146},{10,11,206},{10,11,596},{13,11,218},{142,11,153},{132,10,
+254},{6,0,214},{12,0,540},{4,10,275},{7,10,1219},{140,10,376},{8,0,667},{11,0,
+403},{146,0,83},{12,0,74},{10,11,648},{11,11,671},{143,11,46},{135,0,125},{134,
+10,1753},{133,0,761},{6,0,912},{4,11,518},{6,10,369},{6,10,502},{7,10,1036},{7,
+11,1136},{8,10,348},{9,10,452},{10,10,26},{11,10,224},{11,10,387},{11,10,772},{
+12,10,95},{12,10,629},{13,10,195},{13,10,207},{13,10,241},{14,10,260},{14,10,270
+},{143,10,140},{10,0,131},{140,0,72},{132,10,269},{5,10,480},{7,10,532},{7,10,
+1197},{7,10,1358},{8,10,291},{11,10,349},{142,10,396},{8,11,689},{137,11,863},{8
+,0,333},{138,0,182},{4,11,18},{7,11,145},{7,11,444},{7,11,1278},{8,11,49},{8,11,
+400},{9,11,71},{9,11,250},{10,11,459},{12,11,160},{144,11,24},{14,11,35},{142,11
+,191},{135,11,1864},{135,0,1338},{148,10,15},{14,0,94},{15,0,65},{16,0,4},{16,0,
+77},{16,0,80},{145,0,5},{12,11,82},{143,11,36},{133,11,1010},{133,0,449},{133,0,
+646},{7,0,86},{8,0,103},{135,10,657},{7,0,2028},{138,0,641},{136,10,533},{134,0,
+1},{139,11,970},{5,11,87},{7,11,313},{7,11,1103},{10,11,112},{10,11,582},{11,11,
+389},{11,11,813},{12,11,385},{13,11,286},{14,11,124},{146,11,108},{6,0,869},{132
+,11,267},{6,0,277},{7,0,1274},{7,0,1386},{146,0,87},{6,0,187},{7,0,39},{7,0,1203
+},{8,0,380},{14,0,117},{149,0,28},{4,10,211},{4,10,332},{5,10,335},{6,10,238},{7
+,10,269},{7,10,811},{7,10,1797},{8,10,836},{9,10,507},{141,10,242},{4,0,785},{5,
+0,368},{6,0,297},{7,0,793},{139,0,938},{7,0,464},{8,0,558},{11,0,105},{12,0,231}
+,{14,0,386},{15,0,102},{148,0,75},{133,10,1009},{8,0,877},{140,0,731},{139,11,
+289},{10,11,249},{139,11,209},{132,11,561},{134,0,1608},{132,11,760},{134,0,1429
+},{9,11,154},{140,11,485},{5,10,228},{6,10,203},{7,10,156},{8,10,347},{137,10,
+265},{7,0,1010},{11,0,733},{11,0,759},{13,0,34},{14,0,427},{146,0,45},{7,10,1131
+},{135,10,1468},{136,11,255},{7,0,1656},{9,0,369},{10,0,338},{10,0,490},{11,0,
+154},{11,0,545},{11,0,775},{13,0,77},{141,0,274},{133,11,621},{134,0,1038},{4,11
+,368},{135,11,641},{6,0,2010},{8,0,979},{8,0,985},{10,0,951},{138,0,1011},{134,0
+,1005},{19,0,121},{5,10,291},{5,10,318},{7,10,765},{9,10,389},{140,10,548},{5,0,
+20},{6,0,298},{7,0,659},{137,0,219},{7,0,1440},{11,0,854},{11,0,872},{11,0,921},
+{12,0,551},{13,0,472},{142,0,367},{5,0,490},{6,0,615},{6,0,620},{135,0,683},{6,0
+,1070},{134,0,1597},{139,0,522},{132,0,439},{136,0,669},{6,0,766},{6,0,1143},{6,
+0,1245},{10,10,525},{139,10,82},{9,11,92},{147,11,91},{6,0,668},{134,0,1218},{6,
+11,525},{9,11,876},{140,11,284},{132,0,233},{136,0,547},{132,10,422},{5,10,355},
+{145,10,0},{6,11,300},{135,11,1515},{4,0,482},{137,10,905},{4,0,886},{7,0,346},{
+133,11,594},{133,10,865},{5,10,914},{134,10,1625},{135,0,334},{5,0,795},{6,0,
+1741},{133,10,234},{135,10,1383},{6,11,1641},{136,11,820},{135,0,371},{7,11,1313
+},{138,11,660},{135,10,1312},{135,0,622},{7,0,625},{135,0,1750},{135,0,339},{4,0
+,203},{135,0,1936},{15,0,29},{16,0,38},{15,11,29},{144,11,38},{5,0,338},{135,0,
+1256},{135,10,1493},{10,0,130},{6,10,421},{7,10,61},{7,10,1540},{138,10,501},{6,
+11,389},{7,11,149},{9,11,142},{138,11,94},{137,10,341},{11,0,678},{12,0,307},{
+142,10,98},{6,11,8},{7,11,1881},{136,11,91},{135,0,2044},{6,0,770},{6,0,802},{6,
+0,812},{7,0,311},{9,0,308},{12,0,255},{6,10,102},{7,10,72},{15,10,142},{147,10,
+67},{151,10,30},{135,10,823},{135,0,1266},{135,11,1746},{135,10,1870},{4,0,400},
+{5,0,267},{135,0,232},{7,11,24},{11,11,542},{139,11,852},{135,11,1739},{4,11,503
+},{135,11,1661},{5,11,130},{7,11,1314},{9,11,610},{10,11,718},{11,11,601},{11,11
+,819},{11,11,946},{140,11,536},{10,11,149},{11,11,280},{142,11,336},{7,0,739},{
+11,0,690},{7,11,1946},{8,10,48},{8,10,88},{8,10,582},{8,10,681},{9,10,373},{9,10
+,864},{11,10,157},{11,10,843},{148,10,27},{134,0,990},{4,10,88},{5,10,137},{5,10
+,174},{5,10,777},{6,10,1664},{6,10,1725},{7,10,77},{7,10,426},{7,10,1317},{7,10,
+1355},{8,10,126},{8,10,563},{9,10,523},{9,10,750},{10,10,310},{10,10,836},{11,10
+,42},{11,10,318},{11,10,731},{12,10,68},{12,10,92},{12,10,507},{12,10,692},{13,
+10,81},{13,10,238},{13,10,374},{14,10,436},{18,10,138},{19,10,78},{19,10,111},{
+20,10,55},{20,10,77},{148,10,92},{141,10,418},{7,0,1831},{132,10,938},{6,0,776},
+{134,0,915},{138,10,351},{5,11,348},{6,11,522},{6,10,1668},{7,10,1499},{8,10,117
+},{9,10,314},{138,10,174},{135,10,707},{132,0,613},{133,10,403},{132,11,392},{5,
+11,433},{9,11,633},{139,11,629},{133,0,763},{132,0,878},{132,0,977},{132,0,100},
+{6,0,463},{4,10,44},{5,10,311},{7,10,639},{7,10,762},{7,10,1827},{9,10,8},{9,10,
+462},{148,10,83},{134,11,234},{4,10,346},{7,10,115},{9,10,180},{9,10,456},{138,
+10,363},{5,0,362},{5,0,443},{6,0,318},{7,0,1019},{139,0,623},{5,0,463},{8,0,296}
+,{7,11,140},{7,11,1950},{8,11,680},{11,11,817},{147,11,88},{7,11,1222},{138,11,
+386},{142,0,137},{132,0,454},{7,0,1914},{6,11,5},{7,10,1051},{9,10,545},{11,11,
+249},{12,11,313},{16,11,66},{145,11,26},{135,0,1527},{145,0,58},{148,11,59},{5,0
+,48},{5,0,404},{6,0,557},{7,0,458},{8,0,597},{10,0,455},{10,0,606},{11,0,49},{11
+,0,548},{12,0,476},{13,0,18},{141,0,450},{5,11,963},{134,11,1773},{133,0,729},{
+138,11,586},{5,0,442},{135,0,1984},{134,0,449},{144,0,40},{4,0,853},{7,11,180},{
+8,11,509},{136,11,792},{6,10,185},{7,10,1899},{9,10,875},{139,10,673},{134,11,
+524},{12,0,227},{4,10,327},{5,10,478},{7,10,1332},{136,10,753},{6,0,1491},{5,10,
+1020},{133,10,1022},{4,10,103},{133,10,401},{132,11,931},{4,10,499},{135,10,1421
+},{5,0,55},{7,0,376},{140,0,161},{133,0,450},{6,0,1174},{134,0,1562},{10,0,62},{
+13,0,400},{135,11,1837},{140,0,207},{135,0,869},{4,11,773},{5,11,618},{137,11,
+756},{132,10,96},{4,0,213},{7,0,223},{8,0,80},{135,10,968},{4,11,90},{5,11,337},
+{5,11,545},{7,11,754},{9,11,186},{10,11,72},{10,11,782},{11,11,513},{11,11,577},
+{11,11,610},{11,11,889},{11,11,961},{12,11,354},{12,11,362},{12,11,461},{12,11,
+595},{13,11,79},{143,11,121},{7,0,381},{7,0,806},{7,0,820},{8,0,354},{8,0,437},{
+8,0,787},{9,0,657},{10,0,58},{10,0,339},{10,0,749},{11,0,914},{12,0,162},{13,0,
+75},{14,0,106},{14,0,198},{14,0,320},{14,0,413},{146,0,43},{136,0,747},{136,0,
+954},{134,0,1073},{135,0,556},{7,11,151},{9,11,329},{139,11,254},{5,0,692},{134,
+0,1395},{6,10,563},{137,10,224},{134,0,191},{132,0,804},{9,11,187},{10,11,36},{
+17,11,44},{146,11,64},{7,11,165},{7,11,919},{136,11,517},{4,11,506},{5,11,295},{
+7,11,1680},{15,11,14},{144,11,5},{4,0,706},{6,0,162},{7,0,1960},{136,0,831},{135
+,11,1376},{7,11,987},{9,11,688},{10,11,522},{11,11,788},{140,11,566},{150,0,35},
+{138,0,426},{135,0,1235},{135,11,1741},{7,11,389},{7,11,700},{7,11,940},{8,11,
+514},{9,11,116},{9,11,535},{10,11,118},{11,11,107},{11,11,148},{11,11,922},{12,
+11,254},{12,11,421},{142,11,238},{134,0,1234},{132,11,743},{4,10,910},{5,10,832}
+,{135,11,1335},{141,0,96},{135,11,185},{146,0,149},{4,0,204},{137,0,902},{4,11,
+784},{133,11,745},{136,0,833},{136,0,949},{7,0,366},{9,0,287},{12,0,199},{12,0,
+556},{12,0,577},{5,11,81},{7,11,146},{7,11,1342},{7,11,1446},{8,11,53},{8,11,561
+},{8,11,694},{8,11,754},{9,11,97},{9,11,115},{9,11,894},{10,11,462},{10,11,813},
+{11,11,230},{11,11,657},{11,11,699},{11,11,748},{12,11,119},{12,11,200},{12,11,
+283},{14,11,273},{145,11,15},{5,11,408},{137,11,747},{9,11,498},{140,11,181},{6,
+0,2020},{136,0,992},{5,0,356},{135,0,224},{134,0,784},{7,0,630},{9,0,567},{11,0,
+150},{11,0,444},{13,0,119},{8,10,528},{137,10,348},{134,0,539},{4,10,20},{133,10
+,616},{142,0,27},{7,11,30},{8,11,86},{8,11,315},{8,11,700},{9,11,576},{9,11,858}
+,{11,11,310},{11,11,888},{11,11,904},{12,11,361},{141,11,248},{138,11,839},{134,
+0,755},{134,0,1063},{7,10,1091},{135,10,1765},{134,11,428},{7,11,524},{8,11,169}
+,{8,11,234},{9,11,480},{138,11,646},{139,0,814},{7,11,1462},{139,11,659},{4,10,
+26},{5,10,429},{6,10,245},{7,10,704},{7,10,1379},{135,10,1474},{7,11,1205},{138,
+11,637},{139,11,803},{132,10,621},{136,0,987},{4,11,266},{8,11,4},{9,11,39},{10,
+11,166},{11,11,918},{12,11,635},{20,11,10},{22,11,27},{150,11,43},{4,0,235},{135
+,0,255},{4,0,194},{5,0,584},{6,0,384},{7,0,583},{10,0,761},{11,0,760},{139,0,851
+},{133,10,542},{134,0,1086},{133,10,868},{8,0,1016},{136,0,1018},{7,0,1396},{7,
+11,1396},{136,10,433},{135,10,1495},{138,10,215},{141,10,124},{7,11,157},{8,11,
+279},{9,11,759},{16,11,31},{16,11,39},{16,11,75},{18,11,24},{20,11,42},{152,11,1
+},{5,0,562},{134,11,604},{134,0,913},{5,0,191},{137,0,271},{4,0,470},{6,0,153},{
+7,0,1503},{7,0,1923},{10,0,701},{11,0,132},{11,0,227},{11,0,320},{11,0,436},{11,
+0,525},{11,0,855},{11,0,873},{12,0,41},{12,0,286},{13,0,103},{13,0,284},{14,0,
+255},{14,0,262},{15,0,117},{143,0,127},{7,0,475},{12,0,45},{147,10,112},{132,11,
+567},{137,11,859},{6,0,713},{6,0,969},{6,0,1290},{134,0,1551},{133,0,327},{6,0,
+552},{6,0,1292},{7,0,1754},{137,0,604},{4,0,223},{6,0,359},{11,0,3},{13,0,108},{
+14,0,89},{16,0,22},{5,11,762},{7,11,1880},{9,11,680},{139,11,798},{5,0,80},{6,0,
+405},{7,0,403},{7,0,1502},{8,0,456},{9,0,487},{9,0,853},{9,0,889},{10,0,309},{11
+,0,721},{11,0,994},{12,0,430},{141,0,165},{133,11,298},{132,10,647},{134,0,2016}
+,{18,10,10},{146,11,10},{4,0,453},{5,0,887},{6,0,535},{8,0,6},{8,0,543},{136,0,
+826},{136,0,975},{10,0,961},{138,0,962},{138,10,220},{6,0,1891},{6,0,1893},{9,0,
+916},{9,0,965},{9,0,972},{12,0,801},{12,0,859},{12,0,883},{15,0,226},{149,0,51},
+{132,10,109},{135,11,267},{7,11,92},{7,11,182},{8,11,453},{9,11,204},{11,11,950}
+,{12,11,94},{12,11,644},{16,11,20},{16,11,70},{16,11,90},{147,11,55},{134,10,
+1746},{6,11,71},{7,11,845},{7,11,1308},{8,11,160},{137,11,318},{5,0,101},{6,0,88
+},{7,0,263},{7,0,628},{7,0,1677},{8,0,349},{9,0,100},{10,0,677},{14,0,169},{14,0
+,302},{14,0,313},{15,0,48},{15,0,84},{7,11,237},{8,11,664},{9,11,42},{9,11,266},
+{9,11,380},{9,11,645},{10,11,177},{138,11,276},{138,11,69},{4,0,310},{7,0,708},{
+7,0,996},{9,0,795},{10,0,390},{10,0,733},{11,0,451},{12,0,249},{14,0,115},{14,0,
+286},{143,0,100},{5,0,587},{4,10,40},{10,10,67},{11,10,117},{11,10,768},{139,10,
+935},{6,0,1942},{7,0,512},{136,0,983},{7,10,992},{8,10,301},{9,10,722},{12,10,63
+},{13,10,29},{14,10,161},{143,10,18},{136,11,76},{139,10,923},{134,0,645},{134,0
+,851},{4,0,498},{132,11,293},{7,0,217},{8,0,140},{10,0,610},{14,11,352},{17,11,
+53},{18,11,146},{18,11,152},{19,11,11},{150,11,54},{134,0,1448},{138,11,841},{
+133,0,905},{4,11,605},{7,11,518},{7,11,1282},{7,11,1918},{10,11,180},{139,11,218
+},{139,11,917},{135,10,825},{140,10,328},{4,0,456},{7,0,105},{7,0,358},{7,0,1637
+},{8,0,643},{139,0,483},{134,0,792},{6,11,96},{135,11,1426},{137,11,691},{4,11,
+651},{133,11,289},{7,11,688},{8,11,35},{9,11,511},{10,11,767},{147,11,118},{150,
+0,56},{5,0,243},{5,0,535},{6,10,204},{10,10,320},{10,10,583},{13,10,502},{14,10,
+72},{14,10,274},{14,10,312},{14,10,344},{15,10,159},{16,10,62},{16,10,69},{17,10
+,30},{18,10,42},{18,10,53},{18,10,84},{18,10,140},{19,10,68},{19,10,85},{20,10,5
+},{20,10,45},{20,10,101},{22,10,7},{150,10,20},{4,10,558},{6,10,390},{7,10,162},
+{7,10,689},{9,10,360},{138,10,653},{146,11,23},{135,0,1748},{5,10,856},{6,10,
+1672},{6,10,1757},{134,10,1781},{5,0,539},{5,0,754},{6,0,876},{132,11,704},{135,
+11,1078},{5,10,92},{10,10,736},{140,10,102},{17,0,91},{5,10,590},{137,10,213},{
+134,0,1565},{6,0,91},{135,0,435},{4,0,939},{140,0,792},{134,0,1399},{4,0,16},{5,
+0,316},{5,0,842},{6,0,370},{6,0,1778},{8,0,166},{11,0,812},{12,0,206},{12,0,351}
+,{14,0,418},{16,0,15},{16,0,34},{18,0,3},{19,0,3},{19,0,7},{20,0,4},{21,0,21},{4
+,11,720},{133,11,306},{144,0,95},{133,11,431},{132,11,234},{135,0,551},{4,0,999}
+,{6,0,1966},{134,0,2042},{7,0,619},{10,0,547},{11,0,122},{12,0,601},{15,0,7},{
+148,0,20},{5,11,464},{6,11,236},{7,11,276},{7,11,696},{7,11,914},{7,11,1108},{7,
+11,1448},{9,11,15},{9,11,564},{10,11,14},{12,11,565},{13,11,449},{14,11,53},{15,
+11,13},{16,11,64},{145,11,41},{6,0,884},{6,0,1019},{134,0,1150},{6,11,1767},{12,
+11,194},{145,11,107},{136,10,503},{133,11,840},{7,0,671},{134,10,466},{132,0,888
+},{4,0,149},{138,0,368},{4,0,154},{7,0,1134},{136,0,105},{135,0,983},{9,11,642},
+{11,11,236},{142,11,193},{4,0,31},{6,0,429},{7,0,962},{9,0,458},{139,0,691},{6,0
+,643},{134,0,1102},{132,0,312},{4,11,68},{5,11,634},{6,11,386},{7,11,794},{8,11,
+273},{9,11,563},{10,11,105},{10,11,171},{11,11,94},{139,11,354},{133,0,740},{135
+,0,1642},{4,11,95},{7,11,416},{8,11,211},{139,11,830},{132,0,236},{138,10,241},{
+7,11,731},{13,11,20},{143,11,11},{5,0,836},{5,0,857},{6,0,1680},{135,0,59},{10,0
+,68},{11,0,494},{152,11,6},{4,0,81},{139,0,867},{135,0,795},{133,11,689},{4,0,
+1001},{5,0,282},{6,0,1932},{6,0,1977},{6,0,1987},{6,0,1992},{8,0,650},{8,0,919},
+{8,0,920},{8,0,923},{8,0,926},{8,0,927},{8,0,931},{8,0,939},{8,0,947},{8,0,956},
+{8,0,997},{9,0,907},{10,0,950},{10,0,953},{10,0,954},{10,0,956},{10,0,958},{10,0
+,959},{10,0,964},{10,0,970},{10,0,972},{10,0,973},{10,0,975},{10,0,976},{10,0,
+980},{10,0,981},{10,0,984},{10,0,988},{10,0,990},{10,0,995},{10,0,999},{10,0,
+1002},{10,0,1003},{10,0,1005},{10,0,1006},{10,0,1008},{10,0,1009},{10,0,1012},{
+10,0,1014},{10,0,1015},{10,0,1019},{10,0,1020},{10,0,1022},{12,0,959},{12,0,961}
+,{12,0,962},{12,0,963},{12,0,964},{12,0,965},{12,0,967},{12,0,968},{12,0,969},{
+12,0,970},{12,0,971},{12,0,972},{12,0,973},{12,0,974},{12,0,975},{12,0,976},{12,
+0,977},{12,0,979},{12,0,981},{12,0,982},{12,0,983},{12,0,984},{12,0,985},{12,0,
+986},{12,0,987},{12,0,989},{12,0,990},{12,0,992},{12,0,993},{12,0,995},{12,0,998
+},{12,0,999},{12,0,1000},{12,0,1001},{12,0,1002},{12,0,1004},{12,0,1005},{12,0,
+1006},{12,0,1007},{12,0,1008},{12,0,1009},{12,0,1010},{12,0,1011},{12,0,1012},{
+12,0,1014},{12,0,1015},{12,0,1016},{12,0,1017},{12,0,1018},{12,0,1019},{12,0,
+1022},{12,0,1023},{14,0,475},{14,0,477},{14,0,478},{14,0,479},{14,0,480},{14,0,
+482},{14,0,483},{14,0,484},{14,0,485},{14,0,486},{14,0,487},{14,0,488},{14,0,489
+},{14,0,490},{14,0,491},{14,0,492},{14,0,493},{14,0,494},{14,0,495},{14,0,496},{
+14,0,497},{14,0,498},{14,0,499},{14,0,500},{14,0,501},{14,0,502},{14,0,503},{14,
+0,504},{14,0,506},{14,0,507},{14,0,508},{14,0,509},{14,0,510},{14,0,511},{16,0,
+113},{16,0,114},{16,0,115},{16,0,117},{16,0,118},{16,0,119},{16,0,121},{16,0,122
+},{16,0,123},{16,0,124},{16,0,125},{16,0,126},{16,0,127},{18,0,242},{18,0,243},{
+18,0,244},{18,0,245},{18,0,248},{18,0,249},{18,0,250},{18,0,251},{18,0,252},{18,
+0,253},{18,0,254},{18,0,255},{20,0,125},{20,0,126},{148,0,127},{7,11,1717},{7,11
+,1769},{138,11,546},{7,11,1127},{7,11,1572},{10,11,297},{10,11,422},{11,11,764},
+{11,11,810},{12,11,264},{13,11,102},{13,11,300},{13,11,484},{14,11,147},{14,11,
+229},{17,11,71},{18,11,118},{147,11,120},{6,0,1148},{134,0,1586},{132,0,775},{
+135,10,954},{133,11,864},{133,11,928},{138,11,189},{135,10,1958},{6,10,549},{8,
+10,34},{8,10,283},{9,10,165},{138,10,475},{5,10,652},{5,10,701},{135,10,449},{
+135,11,695},{4,10,655},{7,10,850},{17,10,75},{146,10,137},{140,11,682},{133,11,
+523},{8,0,970},{136,10,670},{136,11,555},{7,11,76},{8,11,44},{9,11,884},{10,11,
+580},{11,11,399},{11,11,894},{15,11,122},{18,11,144},{147,11,61},{6,10,159},{6,
+10,364},{7,10,516},{7,10,1439},{137,10,518},{4,0,71},{5,0,376},{7,0,119},{138,0,
+665},{141,10,151},{11,0,827},{14,0,34},{143,0,148},{133,11,518},{4,0,479},{135,
+11,1787},{135,11,1852},{135,10,993},{7,0,607},{136,0,99},{134,0,1960},{132,0,793
+},{4,0,41},{5,0,74},{7,0,1627},{11,0,871},{140,0,619},{7,0,94},{11,0,329},{11,0,
+965},{12,0,241},{14,0,354},{15,0,22},{148,0,63},{7,10,501},{9,10,111},{10,10,141
+},{11,10,332},{13,10,43},{13,10,429},{14,10,130},{14,10,415},{145,10,102},{9,0,
+209},{137,0,300},{134,0,1497},{138,11,255},{4,11,934},{5,11,138},{136,11,610},{
+133,0,98},{6,0,1316},{10,11,804},{138,11,832},{8,11,96},{9,11,36},{10,11,607},{
+11,11,423},{11,11,442},{12,11,309},{14,11,199},{15,11,90},{145,11,110},{132,0,
+463},{5,10,149},{136,10,233},{133,10,935},{4,11,652},{8,11,320},{9,11,13},{9,11,
+398},{9,11,727},{10,11,75},{10,11,184},{10,11,230},{10,11,564},{10,11,569},{11,
+11,973},{12,11,70},{12,11,189},{13,11,57},{13,11,257},{22,11,6},{150,11,16},{142
+,0,291},{12,10,582},{146,10,131},{136,10,801},{133,0,984},{145,11,116},{4,11,692
+},{133,11,321},{4,0,182},{6,0,205},{135,0,220},{4,0,42},{9,0,205},{9,0,786},{138
+,0,659},{6,0,801},{11,11,130},{140,11,609},{132,0,635},{5,11,345},{135,11,1016},
+{139,0,533},{132,0,371},{4,0,272},{135,0,836},{6,0,1282},{135,11,1100},{5,0,825}
+,{134,0,1640},{135,11,1325},{133,11,673},{4,11,287},{133,11,1018},{135,0,357},{6
+,0,467},{137,0,879},{7,0,317},{135,0,569},{6,0,924},{134,0,1588},{5,11,34},{5,10
+,406},{10,11,724},{12,11,444},{13,11,354},{18,11,32},{23,11,24},{23,11,31},{152,
+11,5},{6,0,1795},{6,0,1835},{6,0,1836},{6,0,1856},{8,0,844},{8,0,849},{8,0,854},
+{8,0,870},{8,0,887},{10,0,852},{138,0,942},{6,10,69},{135,10,117},{137,0,307},{4
+,0,944},{6,0,1799},{6,0,1825},{10,0,848},{10,0,875},{10,0,895},{10,0,899},{10,0,
+902},{140,0,773},{11,0,43},{13,0,72},{141,0,142},{135,10,1830},{134,11,382},{4,
+10,432},{135,10,824},{132,11,329},{7,0,1820},{139,11,124},{133,10,826},{133,0,
+525},{132,11,906},{7,11,1940},{136,11,366},{138,11,10},{4,11,123},{4,11,649},{5,
+11,605},{7,11,1509},{136,11,36},{6,0,110},{135,0,1681},{133,0,493},{133,11,767},
+{4,0,174},{135,0,911},{138,11,786},{8,0,417},{137,0,782},{133,10,1000},{7,0,733}
+,{137,0,583},{4,10,297},{6,10,529},{7,10,152},{7,10,713},{7,10,1845},{8,10,710},
+{8,10,717},{12,10,639},{140,10,685},{4,0,32},{5,0,215},{6,0,269},{7,0,1782},{7,0
+,1892},{10,0,16},{11,0,822},{11,0,954},{141,0,481},{4,11,273},{5,11,658},{133,11
+,995},{136,0,477},{134,11,72},{135,11,1345},{5,0,308},{7,0,1088},{4,10,520},{135
+,10,575},{133,11,589},{5,0,126},{8,0,297},{9,0,366},{140,0,374},{7,0,1551},{139,
+0,361},{5,11,117},{6,11,514},{6,11,541},{7,11,1164},{7,11,1436},{8,11,220},{8,11
+,648},{10,11,688},{139,11,560},{133,11,686},{4,0,946},{6,0,1807},{8,0,871},{10,0
+,854},{10,0,870},{10,0,888},{10,0,897},{10,0,920},{12,0,722},{12,0,761},{12,0,
+763},{12,0,764},{14,0,454},{14,0,465},{16,0,107},{18,0,167},{18,0,168},{146,0,
+172},{132,0,175},{135,0,1307},{132,0,685},{135,11,1834},{133,0,797},{6,0,745},{6
+,0,858},{134,0,963},{133,0,565},{5,10,397},{6,10,154},{7,11,196},{7,10,676},{8,
+10,443},{8,10,609},{9,10,24},{9,10,325},{10,10,35},{10,11,765},{11,11,347},{11,
+10,535},{11,11,552},{11,11,576},{11,10,672},{11,11,790},{11,10,1018},{12,11,263}
+,{12,10,637},{13,11,246},{13,11,270},{13,11,395},{14,11,74},{14,11,176},{14,11,
+190},{14,11,398},{14,11,412},{15,11,32},{15,11,63},{16,10,30},{16,11,88},{147,11
+,105},{13,11,84},{141,11,122},{4,0,252},{7,0,1068},{10,0,434},{11,0,228},{11,0,
+426},{13,0,231},{18,0,106},{148,0,87},{137,0,826},{4,11,589},{139,11,282},{5,11,
+381},{135,11,1792},{132,0,791},{5,0,231},{10,0,509},{133,10,981},{7,0,601},{9,0,
+277},{9,0,674},{10,0,178},{10,0,418},{10,0,571},{11,0,531},{12,0,113},{12,0,475}
+,{13,0,99},{142,0,428},{4,10,56},{7,11,616},{7,10,1791},{8,10,607},{8,10,651},{
+10,11,413},{11,10,465},{11,10,835},{12,10,337},{141,10,480},{7,0,1591},{144,0,43
+},{9,10,158},{138,10,411},{135,0,1683},{8,0,289},{11,0,45},{12,0,278},{140,0,537
+},{6,11,120},{7,11,1188},{7,11,1710},{8,11,286},{9,11,667},{11,11,592},{139,11,
+730},{136,10,617},{135,0,1120},{135,11,1146},{139,10,563},{4,11,352},{4,10,369},
+{135,11,687},{143,11,38},{4,0,399},{5,0,119},{5,0,494},{7,0,751},{9,0,556},{14,
+11,179},{15,11,151},{150,11,11},{4,11,192},{5,11,49},{6,11,200},{6,11,293},{6,11
+,1696},{135,11,488},{4,0,398},{133,0,660},{7,0,1030},{134,10,622},{135,11,595},{
+141,0,168},{132,11,147},{7,0,973},{10,10,624},{142,10,279},{132,10,363},{132,0,
+642},{133,11,934},{134,0,1615},{7,11,505},{135,11,523},{7,0,594},{7,0,851},{7,0,
+1858},{9,0,411},{9,0,574},{9,0,666},{9,0,737},{10,0,346},{10,0,712},{11,0,246},{
+11,0,432},{11,0,517},{11,0,647},{11,0,679},{11,0,727},{12,0,304},{12,0,305},{12,
+0,323},{12,0,483},{12,0,572},{12,0,593},{12,0,602},{13,0,95},{13,0,101},{13,0,
+171},{13,0,315},{13,0,378},{13,0,425},{13,0,475},{14,0,63},{14,0,380},{14,0,384}
+,{15,0,133},{18,0,112},{148,0,72},{135,0,1093},{132,0,679},{8,0,913},{10,0,903},
+{10,0,915},{12,0,648},{12,0,649},{14,0,455},{16,0,112},{138,11,438},{137,0,203},
+{134,10,292},{134,0,1492},{7,0,1374},{8,0,540},{5,10,177},{6,10,616},{7,10,827},
+{9,10,525},{138,10,656},{135,0,1486},{9,0,714},{138,10,31},{136,0,825},{134,0,
+1511},{132,11,637},{134,0,952},{4,10,161},{133,10,631},{5,0,143},{5,0,769},{6,0,
+1760},{7,0,682},{7,0,1992},{136,0,736},{132,0,700},{134,0,1540},{132,11,777},{9,
+11,867},{138,11,837},{7,0,1557},{135,10,1684},{133,0,860},{6,0,422},{7,0,0},{7,0
+,1544},{9,0,605},{11,0,990},{12,0,235},{12,0,453},{13,0,47},{13,0,266},{9,10,469
+},{9,10,709},{12,10,512},{14,10,65},{145,10,12},{11,0,807},{10,10,229},{11,10,73
+},{139,10,376},{6,11,170},{7,11,1080},{8,11,395},{8,11,487},{11,11,125},{141,11,
+147},{5,0,515},{137,0,131},{7,0,1605},{11,0,962},{146,0,139},{132,0,646},{4,0,
+396},{7,0,728},{9,0,117},{13,0,202},{148,0,51},{6,0,121},{6,0,124},{6,0,357},{7,
+0,1138},{7,0,1295},{8,0,162},{8,0,508},{11,0,655},{4,11,535},{6,10,558},{7,10,
+651},{8,11,618},{9,10,0},{10,10,34},{139,10,1008},{135,11,1245},{138,0,357},{150
+,11,23},{133,0,237},{135,0,1784},{7,10,1832},{138,10,374},{132,0,713},{132,11,46
+},{6,0,1536},{10,0,348},{5,11,811},{6,11,1679},{6,11,1714},{135,11,2032},{11,11,
+182},{142,11,195},{6,0,523},{7,0,738},{7,10,771},{7,10,1731},{9,10,405},{138,10,
+421},{7,11,1458},{9,11,407},{139,11,15},{6,11,34},{7,11,69},{7,11,640},{7,11,
+1089},{8,11,708},{8,11,721},{9,11,363},{9,11,643},{10,11,628},{148,11,98},{133,0
+,434},{135,0,1877},{7,0,571},{138,0,366},{5,10,881},{133,10,885},{9,0,513},{10,0
+,25},{10,0,39},{12,0,122},{140,0,187},{132,0,580},{5,10,142},{134,10,546},{132,
+11,462},{137,0,873},{5,10,466},{11,10,571},{12,10,198},{13,10,283},{14,10,186},{
+15,10,21},{143,10,103},{7,0,171},{4,10,185},{5,10,257},{5,10,839},{5,10,936},{9,
+10,399},{10,10,258},{10,10,395},{10,10,734},{11,10,1014},{12,10,23},{13,10,350},
+{14,10,150},{147,10,6},{134,0,625},{7,0,107},{7,0,838},{8,0,550},{138,0,401},{5,
+11,73},{6,11,23},{134,11,338},{4,0,943},{6,0,1850},{12,0,713},{142,0,434},{11,0,
+588},{11,0,864},{11,0,936},{11,0,968},{12,0,73},{12,0,343},{12,0,394},{13,0,275}
+,{14,0,257},{15,0,160},{7,10,404},{7,10,1377},{7,10,1430},{7,10,2017},{8,10,149}
+,{8,10,239},{8,10,512},{8,10,793},{8,10,818},{9,10,474},{9,10,595},{10,10,122},{
+10,10,565},{10,10,649},{10,10,783},{11,10,239},{11,10,295},{11,10,447},{11,10,
+528},{11,10,639},{11,10,800},{12,10,25},{12,10,157},{12,10,316},{12,10,390},{12,
+10,391},{12,10,395},{12,10,478},{12,10,503},{12,10,592},{12,10,680},{13,10,50},{
+13,10,53},{13,10,132},{13,10,198},{13,10,322},{13,10,415},{13,10,511},{14,10,71}
+,{14,10,395},{15,10,71},{15,10,136},{17,10,123},{18,10,93},{147,10,58},{133,0,
+768},{11,0,103},{142,0,0},{136,10,712},{132,0,799},{132,0,894},{7,11,725},{8,11,
+498},{139,11,268},{135,11,1798},{135,11,773},{141,11,360},{4,10,377},{152,10,13}
+,{135,0,1673},{132,11,583},{134,0,1052},{133,11,220},{140,11,69},{132,11,544},{4
+,10,180},{135,10,1906},{134,0,272},{4,0,441},{134,0,1421},{4,0,9},{5,0,128},{7,0
+,368},{11,0,480},{148,0,3},{5,11,176},{6,11,437},{6,11,564},{11,11,181},{141,11,
+183},{132,10,491},{7,0,1182},{141,11,67},{6,0,1346},{4,10,171},{138,10,234},{4,
+10,586},{7,10,1186},{138,10,631},{136,0,682},{134,0,1004},{15,0,24},{143,11,24},
+{134,0,968},{4,0,2},{6,0,742},{6,0,793},{7,0,545},{7,0,894},{9,10,931},{10,10,
+334},{148,10,71},{136,11,600},{133,10,765},{9,0,769},{140,0,185},{4,11,790},{5,
+11,273},{134,11,394},{7,0,474},{137,0,578},{4,11,135},{6,11,127},{7,11,1185},{7,
+11,1511},{8,11,613},{11,11,5},{12,11,133},{12,11,495},{12,11,586},{14,11,385},{
+15,11,118},{17,11,20},{146,11,98},{133,10,424},{5,0,530},{142,0,113},{6,11,230},
+{7,11,961},{7,11,1085},{136,11,462},{7,11,1954},{137,11,636},{136,10,714},{149,
+11,6},{135,10,685},{9,10,420},{10,10,269},{10,10,285},{10,10,576},{11,10,397},{
+13,10,175},{145,10,90},{132,10,429},{5,0,556},{5,11,162},{136,11,68},{132,11,654
+},{4,11,156},{7,11,998},{7,11,1045},{7,11,1860},{9,11,48},{9,11,692},{11,11,419}
+,{139,11,602},{6,0,1317},{8,0,16},{9,0,825},{12,0,568},{7,11,1276},{8,11,474},{
+137,11,652},{18,0,97},{7,10,18},{7,10,699},{7,10,1966},{8,10,752},{9,10,273},{9,
+10,412},{9,10,703},{10,10,71},{10,10,427},{138,10,508},{10,0,703},{7,11,1454},{
+138,11,703},{4,10,53},{5,10,186},{135,10,752},{134,0,892},{134,0,1571},{8,10,575
+},{10,10,289},{139,10,319},{6,0,186},{137,0,426},{134,0,1101},{132,10,675},{132,
+0,585},{6,0,1870},{137,0,937},{152,11,10},{9,11,197},{10,11,300},{12,11,473},{13
+,11,90},{141,11,405},{4,0,93},{5,0,252},{6,0,229},{7,0,291},{9,0,550},{139,0,644
+},{137,0,749},{9,0,162},{6,10,209},{8,10,468},{9,10,210},{11,10,36},{12,10,28},{
+12,10,630},{13,10,21},{13,10,349},{14,10,7},{145,10,13},{132,0,381},{132,11,606}
+,{4,10,342},{135,10,1179},{7,11,1587},{7,11,1707},{10,11,528},{139,11,504},{12,
+11,39},{13,11,265},{141,11,439},{4,10,928},{133,10,910},{7,10,1838},{7,11,1978},
+{136,11,676},{6,0,762},{6,0,796},{134,0,956},{4,10,318},{4,10,496},{7,10,856},{
+139,10,654},{137,11,242},{4,11,361},{133,11,315},{132,11,461},{132,11,472},{132,
+0,857},{5,0,21},{6,0,77},{6,0,157},{7,0,974},{7,0,1301},{7,0,1339},{7,0,1490},{7
+,0,1873},{9,0,628},{7,10,915},{8,10,247},{147,10,0},{4,10,202},{5,10,382},{6,10,
+454},{7,10,936},{7,10,1803},{8,10,758},{9,10,375},{9,10,895},{10,10,743},{10,10,
+792},{11,10,978},{11,10,1012},{142,10,109},{7,11,617},{10,11,498},{11,11,501},{
+12,11,16},{140,11,150},{7,10,1150},{7,10,1425},{7,10,1453},{10,11,747},{140,10,
+513},{133,11,155},{11,0,919},{141,0,409},{138,10,791},{10,0,633},{139,11,729},{7
+,11,163},{8,11,319},{9,11,402},{10,11,24},{10,11,681},{11,11,200},{11,11,567},{
+12,11,253},{12,11,410},{142,11,219},{5,11,475},{7,11,1780},{9,11,230},{11,11,297
+},{11,11,558},{14,11,322},{147,11,76},{7,0,332},{6,10,445},{137,10,909},{135,11,
+1956},{136,11,274},{134,10,578},{135,0,1489},{135,11,1848},{5,11,944},{134,11,
+1769},{132,11,144},{136,10,766},{4,0,832},{135,10,541},{8,0,398},{9,0,681},{139,
+0,632},{136,0,645},{9,0,791},{10,0,93},{16,0,13},{17,0,23},{18,0,135},{19,0,12},
+{20,0,1},{20,0,12},{148,0,14},{6,11,247},{137,11,555},{134,0,20},{132,0,800},{
+135,0,1841},{139,10,983},{137,10,768},{132,10,584},{141,11,51},{6,0,1993},{4,11,
+620},{138,11,280},{136,0,769},{11,0,290},{11,0,665},{7,11,1810},{11,11,866},{12,
+11,103},{13,11,495},{17,11,67},{147,11,74},{134,0,1426},{139,0,60},{4,10,326},{
+135,10,1770},{7,0,1874},{9,0,641},{132,10,226},{6,0,644},{5,10,426},{8,10,30},{9
+,10,2},{11,10,549},{147,10,122},{5,11,428},{138,11,442},{135,11,1871},{135,0,
+1757},{147,10,117},{135,0,937},{135,0,1652},{6,0,654},{134,0,1476},{133,11,99},{
+135,0,527},{132,10,345},{4,10,385},{4,11,397},{7,10,265},{135,10,587},{4,0,579},
+{5,0,226},{5,0,323},{135,0,960},{134,0,1486},{8,11,502},{144,11,9},{4,10,347},{5
+,10,423},{5,10,996},{135,10,1329},{7,11,727},{146,11,73},{4,11,485},{7,11,353},{
+7,10,1259},{7,11,1523},{9,10,125},{139,10,65},{6,0,325},{5,10,136},{6,11,366},{7
+,11,1384},{7,11,1601},{136,10,644},{138,11,160},{6,0,1345},{137,11,282},{18,0,91
+},{147,0,70},{136,0,404},{4,11,157},{133,11,471},{133,0,973},{6,0,135},{135,0,
+1176},{8,11,116},{11,11,551},{142,11,159},{4,0,549},{4,10,433},{133,10,719},{136
+,0,976},{5,11,160},{7,11,363},{7,11,589},{10,11,170},{141,11,55},{144,0,21},{144
+,0,51},{135,0,314},{135,10,1363},{4,11,108},{7,11,405},{10,11,491},{139,11,498},
+{146,0,4},{4,10,555},{8,10,536},{10,10,288},{139,10,1005},{135,11,1005},{6,0,281
+},{7,0,6},{8,0,282},{8,0,480},{8,0,499},{9,0,198},{10,0,143},{10,0,169},{10,0,
+211},{10,0,417},{10,0,574},{11,0,147},{11,0,395},{12,0,75},{12,0,407},{12,0,608}
+,{13,0,500},{142,0,251},{6,0,1093},{6,0,1405},{9,10,370},{138,10,90},{4,11,926},
+{133,11,983},{135,0,1776},{134,0,1528},{132,0,419},{132,11,538},{6,11,294},{7,11
+,1267},{136,11,624},{135,11,1772},{138,11,301},{4,10,257},{135,10,2031},{4,0,138
+},{7,0,1012},{7,0,1280},{9,0,76},{135,10,1768},{132,11,757},{5,0,29},{140,0,638}
+,{7,11,655},{135,11,1844},{7,0,1418},{6,11,257},{135,11,1522},{8,11,469},{138,11
+,47},{142,11,278},{6,10,83},{6,10,1733},{135,10,1389},{11,11,204},{11,11,243},{
+140,11,293},{135,11,1875},{6,0,1710},{135,0,2038},{137,11,299},{4,0,17},{5,0,23}
+,{7,0,995},{11,0,383},{11,0,437},{12,0,460},{140,0,532},{133,0,862},{137,10,696}
+,{6,0,592},{138,0,946},{138,11,599},{7,10,1718},{9,10,95},{9,10,274},{10,10,279}
+,{10,10,317},{10,10,420},{11,10,303},{11,10,808},{12,10,134},{12,10,367},{13,10,
+149},{13,10,347},{14,10,349},{14,10,406},{18,10,22},{18,10,89},{18,10,122},{147,
+10,47},{8,0,70},{12,0,171},{141,0,272},{133,10,26},{132,10,550},{137,0,812},{10,
+0,233},{139,0,76},{134,0,988},{134,0,442},{136,10,822},{7,0,896},{4,10,902},{5,
+10,809},{134,10,122},{5,11,150},{7,11,106},{8,11,603},{9,11,593},{9,11,634},{10,
+11,44},{10,11,173},{11,11,462},{11,11,515},{13,11,216},{13,11,288},{142,11,400},
+{136,0,483},{135,10,262},{6,0,1709},{133,10,620},{4,10,34},{5,10,574},{7,10,279}
+,{7,10,1624},{136,10,601},{137,10,170},{147,0,119},{12,11,108},{141,11,291},{11,
+0,69},{12,0,105},{12,0,117},{13,0,213},{14,0,13},{14,0,62},{14,0,177},{14,0,421}
+,{15,0,19},{146,0,141},{137,0,309},{11,11,278},{142,11,73},{7,0,608},{7,0,976},{
+9,0,146},{10,0,206},{10,0,596},{13,0,218},{142,0,153},{133,10,332},{6,10,261},{8
+,10,182},{139,10,943},{4,11,493},{144,11,55},{134,10,1721},{132,0,768},{4,10,933
+},{133,10,880},{7,11,555},{7,11,1316},{7,11,1412},{7,11,1839},{9,11,192},{9,11,
+589},{11,11,241},{11,11,676},{11,11,811},{11,11,891},{12,11,140},{12,11,346},{12
+,11,479},{13,11,30},{13,11,49},{13,11,381},{14,11,188},{15,11,150},{16,11,76},{
+18,11,30},{148,11,52},{4,0,518},{135,0,1136},{6,11,568},{7,11,112},{7,11,1804},{
+8,11,362},{8,11,410},{8,11,830},{9,11,514},{11,11,649},{142,11,157},{135,11,673}
+,{8,0,689},{137,0,863},{4,0,18},{7,0,145},{7,0,444},{7,0,1278},{8,0,49},{8,0,400
+},{9,0,71},{9,0,250},{10,0,459},{12,0,160},{16,0,24},{132,11,625},{140,0,1020},{
+4,0,997},{6,0,1946},{6,0,1984},{134,0,1998},{6,11,16},{6,11,158},{7,11,43},{7,11
+,129},{7,11,181},{8,11,276},{8,11,377},{10,11,523},{11,11,816},{12,11,455},{13,
+11,303},{142,11,135},{133,10,812},{134,0,658},{4,11,1},{7,11,1143},{7,11,1463},{
+8,11,61},{9,11,207},{9,11,390},{9,11,467},{139,11,836},{150,11,26},{140,0,106},{
+6,0,1827},{10,0,931},{18,0,166},{20,0,114},{4,10,137},{7,10,1178},{7,11,1319},{
+135,10,1520},{133,0,1010},{4,11,723},{5,11,895},{7,11,1031},{8,11,199},{8,11,340
+},{9,11,153},{9,11,215},{10,11,21},{10,11,59},{10,11,80},{10,11,224},{11,11,229}
+,{11,11,652},{12,11,192},{13,11,146},{142,11,91},{132,11,295},{6,11,619},{7,11,
+898},{7,11,1092},{8,11,485},{18,11,28},{147,11,116},{137,11,51},{6,10,1661},{7,
+10,1975},{7,10,2009},{135,10,2011},{5,11,309},{140,11,211},{5,0,87},{7,0,313},{7
+,0,1103},{10,0,208},{10,0,582},{11,0,389},{11,0,813},{12,0,385},{13,0,286},{14,0
+,124},{146,0,108},{5,11,125},{8,11,77},{138,11,15},{132,0,267},{133,0,703},{137,
+11,155},{133,11,439},{11,11,164},{140,11,76},{9,0,496},{5,10,89},{7,10,1915},{9,
+10,185},{9,10,235},{10,10,64},{10,10,270},{10,10,403},{10,10,469},{10,10,529},{
+10,10,590},{11,10,140},{11,10,860},{13,10,1},{13,10,422},{14,10,341},{14,10,364}
+,{17,10,93},{18,10,113},{19,10,97},{147,10,113},{133,10,695},{135,0,1121},{5,10,
+6},{6,10,183},{7,10,680},{7,10,978},{7,10,1013},{7,10,1055},{12,10,230},{13,10,
+172},{146,10,29},{4,11,8},{7,11,1152},{7,11,1153},{7,11,1715},{9,11,374},{10,11,
+478},{139,11,648},{135,11,1099},{6,10,29},{139,10,63},{4,0,561},{10,0,249},{139,
+0,209},{132,0,760},{7,11,799},{138,11,511},{136,11,87},{9,0,154},{140,0,485},{
+136,0,255},{132,0,323},{140,0,419},{132,10,311},{134,10,1740},{4,0,368},{135,0,
+641},{7,10,170},{8,10,90},{8,10,177},{8,10,415},{11,10,714},{142,10,281},{4,11,
+69},{5,11,122},{9,11,656},{138,11,464},{5,11,849},{134,11,1633},{8,0,522},{142,0
+,328},{11,10,91},{13,10,129},{15,10,101},{145,10,125},{7,0,562},{8,0,551},{4,10,
+494},{6,10,74},{7,10,44},{11,11,499},{12,10,17},{15,10,5},{148,10,11},{4,10,276}
+,{133,10,296},{9,0,92},{147,0,91},{4,10,7},{5,10,90},{5,10,158},{6,10,542},{7,10
+,221},{7,10,1574},{9,10,490},{10,10,540},{11,10,443},{139,10,757},{6,0,525},{6,0
+,1976},{8,0,806},{9,0,876},{140,0,284},{5,11,859},{7,10,588},{7,11,1160},{8,11,
+107},{9,10,175},{9,11,291},{9,11,439},{10,10,530},{10,11,663},{11,11,609},{140,
+11,197},{7,11,168},{13,11,196},{141,11,237},{139,0,958},{133,0,594},{135,10,580}
+,{7,10,88},{136,10,627},{6,0,479},{6,0,562},{7,0,1060},{13,0,6},{5,10,872},{6,10
+,57},{7,10,471},{9,10,447},{137,10,454},{136,11,413},{145,11,19},{4,11,117},{6,
+11,372},{7,11,1905},{142,11,323},{4,11,722},{139,11,471},{17,0,61},{5,10,31},{
+134,10,614},{8,10,330},{140,10,477},{7,10,1200},{138,10,460},{6,10,424},{135,10,
+1866},{6,0,1641},{136,0,820},{6,0,1556},{134,0,1618},{9,11,5},{12,11,216},{12,11
+,294},{12,11,298},{12,11,400},{12,11,518},{13,11,229},{143,11,139},{15,11,155},{
+144,11,79},{4,0,302},{135,0,1766},{5,10,13},{134,10,142},{6,0,148},{7,0,1313},{7
+,10,116},{8,10,322},{8,10,755},{9,10,548},{10,10,714},{11,10,884},{141,10,324},{
+137,0,676},{9,11,88},{139,11,270},{5,11,12},{7,11,375},{137,11,438},{134,0,1674}
+,{7,10,1472},{135,10,1554},{11,0,178},{7,10,1071},{7,10,1541},{7,10,1767},{7,10,
+1806},{11,10,162},{11,10,242},{12,10,605},{15,10,26},{144,10,44},{6,0,389},{7,0,
+149},{9,0,142},{138,0,94},{140,11,71},{145,10,115},{6,0,8},{7,0,1881},{8,0,91},{
+11,11,966},{12,11,287},{13,11,342},{13,11,402},{15,11,110},{143,11,163},{4,11,
+258},{136,11,639},{6,11,22},{7,11,903},{138,11,577},{133,11,681},{135,10,1111},{
+135,11,1286},{9,0,112},{8,10,1},{138,10,326},{5,10,488},{6,10,527},{7,10,489},{7
+,10,1636},{8,10,121},{8,10,144},{8,10,359},{9,10,193},{9,10,241},{9,10,336},{9,
+10,882},{11,10,266},{11,10,372},{11,10,944},{12,10,401},{140,10,641},{4,11,664},
+{133,11,804},{6,0,747},{134,0,1015},{135,0,1746},{9,10,31},{10,10,244},{10,10,
+699},{12,10,149},{141,10,497},{133,10,377},{135,0,24},{6,0,1352},{5,11,32},{145,
+10,101},{7,0,1530},{10,0,158},{13,0,13},{13,0,137},{13,0,258},{14,0,111},{14,0,
+225},{14,0,253},{14,0,304},{14,0,339},{14,0,417},{146,0,33},{4,0,503},{135,0,
+1661},{5,0,130},{6,0,845},{7,0,1314},{9,0,610},{10,0,718},{11,0,601},{11,0,819},
+{11,0,946},{140,0,536},{10,0,149},{11,0,280},{142,0,336},{134,0,1401},{135,0,
+1946},{8,0,663},{144,0,8},{134,0,1607},{135,10,2023},{4,11,289},{7,11,629},{7,11
+,1698},{7,11,1711},{140,11,215},{6,11,450},{136,11,109},{10,0,882},{10,0,883},{
+10,0,914},{138,0,928},{133,10,843},{136,11,705},{132,10,554},{133,10,536},{5,0,
+417},{9,10,79},{11,10,625},{145,10,7},{7,11,1238},{142,11,37},{4,0,392},{135,0,
+1597},{5,0,433},{9,0,633},{11,0,629},{132,10,424},{7,10,336},{136,10,785},{134,
+11,355},{6,0,234},{7,0,769},{9,0,18},{138,0,358},{4,10,896},{134,10,1777},{138,
+11,323},{7,0,140},{7,0,1950},{8,0,680},{11,0,817},{147,0,88},{7,0,1222},{138,0,
+386},{139,11,908},{11,0,249},{12,0,313},{16,0,66},{145,0,26},{134,0,5},{7,10,750
+},{9,10,223},{11,10,27},{11,10,466},{12,10,624},{14,10,265},{146,10,61},{134,11,
+26},{134,0,1216},{5,0,963},{134,0,1773},{4,11,414},{5,11,467},{9,11,654},{10,11,
+451},{12,11,59},{141,11,375},{135,11,17},{4,10,603},{133,10,661},{4,10,11},{6,10
+,128},{7,10,231},{7,10,1533},{138,10,725},{135,11,955},{7,0,180},{8,0,509},{136,
+0,792},{132,10,476},{132,0,1002},{133,11,538},{135,10,1807},{132,0,931},{7,0,943
+},{11,0,614},{140,0,747},{135,0,1837},{9,10,20},{10,10,324},{10,10,807},{139,10,
+488},{134,0,641},{6,11,280},{10,11,502},{11,11,344},{140,11,38},{5,11,45},{7,11,
+1161},{11,11,448},{11,11,880},{13,11,139},{13,11,407},{15,11,16},{17,11,95},{18,
+11,66},{18,11,88},{18,11,123},{149,11,7},{9,0,280},{138,0,134},{22,0,22},{23,0,5
+},{151,0,29},{136,11,777},{4,0,90},{5,0,545},{7,0,754},{9,0,186},{10,0,72},{10,0
+,782},{11,0,577},{11,0,610},{11,0,960},{12,0,354},{12,0,362},{12,0,595},{4,11,
+410},{135,11,521},{135,11,1778},{5,10,112},{6,10,103},{134,10,150},{138,10,356},
+{132,0,742},{7,0,151},{9,0,329},{139,0,254},{8,0,853},{8,0,881},{8,0,911},{8,0,
+912},{10,0,872},{12,0,741},{12,0,742},{152,0,18},{4,11,573},{136,11,655},{6,0,
+921},{134,0,934},{9,0,187},{10,0,36},{11,0,1016},{17,0,44},{146,0,64},{7,0,833},
+{136,0,517},{4,0,506},{5,0,295},{135,0,1680},{4,10,708},{8,10,15},{9,10,50},{9,
+10,386},{11,10,18},{11,10,529},{140,10,228},{7,0,251},{7,0,1701},{8,0,436},{4,10
+,563},{7,10,592},{7,10,637},{7,10,770},{8,10,463},{9,10,60},{9,10,335},{9,10,904
+},{10,10,73},{11,10,434},{12,10,585},{13,10,331},{18,10,110},{148,10,60},{132,10
+,502},{136,0,584},{6,10,347},{138,10,161},{7,0,987},{9,0,688},{10,0,522},{11,0,
+788},{12,0,137},{12,0,566},{14,0,9},{14,0,24},{14,0,64},{7,11,899},{142,11,325},
+{4,0,214},{5,0,500},{5,10,102},{6,10,284},{7,10,1079},{7,10,1423},{7,10,1702},{8
+,10,470},{9,10,554},{9,10,723},{139,10,333},{7,10,246},{135,10,840},{6,10,10},{8
+,10,571},{9,10,739},{143,10,91},{133,10,626},{146,0,195},{134,0,1775},{7,0,389},
+{7,0,700},{7,0,940},{8,0,514},{9,0,116},{9,0,535},{10,0,118},{11,0,107},{11,0,
+148},{11,0,922},{12,0,254},{12,0,421},{142,0,238},{5,10,18},{6,10,526},{13,10,24
+},{13,10,110},{19,10,5},{147,10,44},{132,0,743},{11,0,292},{4,10,309},{5,10,462}
+,{7,10,970},{135,10,1097},{22,10,30},{150,10,33},{139,11,338},{135,11,1598},{7,0
+,1283},{9,0,227},{11,0,325},{11,0,408},{14,0,180},{146,0,47},{4,0,953},{6,0,1805
+},{6,0,1814},{6,0,1862},{140,0,774},{6,11,611},{135,11,1733},{135,11,1464},{5,0,
+81},{7,0,146},{7,0,1342},{8,0,53},{8,0,561},{8,0,694},{8,0,754},{9,0,115},{9,0,
+179},{9,0,894},{10,0,462},{10,0,813},{11,0,230},{11,0,657},{11,0,699},{11,0,748}
+,{12,0,119},{12,0,200},{12,0,283},{142,0,273},{5,0,408},{6,0,789},{6,0,877},{6,0
+,1253},{6,0,1413},{137,0,747},{134,10,1704},{135,11,663},{6,0,1910},{6,0,1915},{
+6,0,1923},{9,0,913},{9,0,928},{9,0,950},{9,0,954},{9,0,978},{9,0,993},{12,0,812}
+,{12,0,819},{12,0,831},{12,0,833},{12,0,838},{12,0,909},{12,0,928},{12,0,931},{
+12,0,950},{15,0,186},{15,0,187},{15,0,195},{15,0,196},{15,0,209},{15,0,215},{15,
+0,236},{15,0,241},{15,0,249},{15,0,253},{18,0,180},{18,0,221},{18,0,224},{18,0,
+227},{18,0,229},{149,0,60},{7,0,1826},{135,0,1938},{11,0,490},{18,0,143},{5,10,
+86},{7,10,743},{9,10,85},{10,10,281},{10,10,432},{12,10,251},{13,10,118},{142,10
+,378},{5,10,524},{133,10,744},{141,11,442},{10,10,107},{140,10,436},{135,11,503}
+,{134,0,1162},{132,10,927},{7,0,30},{8,0,86},{8,0,315},{8,0,700},{9,0,576},{9,0,
+858},{10,0,414},{11,0,310},{11,0,888},{11,0,904},{12,0,361},{13,0,248},{13,0,371
+},{14,0,142},{12,10,670},{146,10,94},{134,0,721},{4,11,113},{5,11,163},{5,11,735
+},{7,11,1009},{7,10,1149},{9,11,9},{9,10,156},{9,11,771},{12,11,90},{13,11,138},
+{13,11,410},{143,11,128},{138,0,839},{133,10,778},{137,0,617},{133,10,502},{8,10
+,196},{10,10,283},{139,10,406},{6,0,428},{7,0,524},{8,0,169},{8,0,234},{9,0,480}
+,{138,0,646},{133,10,855},{134,0,1648},{7,0,1205},{138,0,637},{7,0,1596},{4,11,
+935},{133,11,823},{5,11,269},{7,11,434},{7,11,891},{8,11,339},{9,11,702},{11,11,
+594},{11,11,718},{145,11,100},{7,11,878},{9,11,485},{141,11,264},{4,0,266},{8,0,
+4},{9,0,39},{10,0,166},{11,0,918},{12,0,635},{20,0,10},{22,0,27},{22,0,43},{22,0
+,52},{134,11,1713},{7,10,1400},{9,10,446},{138,10,45},{135,11,900},{132,0,862},{
+134,0,1554},{135,11,1033},{19,0,16},{147,11,16},{135,11,1208},{7,0,157},{136,0,
+279},{6,0,604},{136,0,391},{13,10,455},{15,10,99},{15,10,129},{144,10,68},{135,
+10,172},{7,0,945},{11,0,713},{139,0,744},{4,0,973},{10,0,877},{10,0,937},{10,0,
+938},{140,0,711},{139,0,1022},{132,10,568},{142,11,143},{4,0,567},{9,0,859},{132
+,10,732},{7,0,1846},{136,0,628},{136,10,733},{133,0,762},{4,10,428},{135,10,1789
+},{10,0,784},{13,0,191},{7,10,2015},{140,10,665},{133,0,298},{7,0,633},{7,0,905}
+,{7,0,909},{7,0,1538},{9,0,767},{140,0,636},{138,10,806},{132,0,795},{139,0,301}
+,{135,0,1970},{5,11,625},{135,11,1617},{135,11,275},{7,11,37},{8,11,425},{8,11,
+693},{9,11,720},{10,11,380},{10,11,638},{11,11,273},{11,11,307},{11,11,473},{12,
+11,61},{143,11,43},{135,11,198},{134,0,1236},{7,0,369},{12,0,644},{12,0,645},{
+144,0,90},{19,0,15},{149,0,27},{6,0,71},{7,0,845},{8,0,160},{9,0,318},{6,10,1623
+},{134,10,1681},{134,0,1447},{134,0,1255},{138,0,735},{8,0,76},{132,11,168},{6,
+10,1748},{8,10,715},{9,10,802},{10,10,46},{10,10,819},{13,10,308},{14,10,351},{
+14,10,363},{146,10,67},{135,11,91},{6,0,474},{4,10,63},{133,10,347},{133,10,749}
+,{138,0,841},{133,10,366},{6,0,836},{132,11,225},{135,0,1622},{135,10,89},{140,0
+,735},{134,0,1601},{138,11,145},{6,0,1390},{137,0,804},{142,0,394},{6,11,15},{7,
+11,70},{10,11,240},{147,11,93},{6,0,96},{135,0,1426},{4,0,651},{133,0,289},{7,11
+,956},{7,10,977},{7,11,1157},{7,11,1506},{7,11,1606},{7,11,1615},{7,11,1619},{7,
+11,1736},{7,11,1775},{8,11,590},{9,11,324},{9,11,736},{9,11,774},{9,11,776},{9,
+11,784},{10,11,567},{10,11,708},{11,11,518},{11,11,613},{11,11,695},{11,11,716},
+{11,11,739},{11,11,770},{11,11,771},{11,11,848},{11,11,857},{11,11,931},{11,11,
+947},{12,11,326},{12,11,387},{12,11,484},{12,11,528},{12,11,552},{12,11,613},{13
+,11,189},{13,11,256},{13,11,340},{13,11,432},{13,11,436},{13,11,440},{13,11,454}
+,{14,11,174},{14,11,220},{14,11,284},{14,11,390},{145,11,121},{7,0,688},{8,0,35}
+,{9,0,511},{10,0,767},{147,0,118},{134,0,667},{4,0,513},{5,10,824},{133,10,941},
+{7,10,440},{8,10,230},{139,10,106},{134,0,2034},{135,11,1399},{143,11,66},{135,
+11,1529},{4,11,145},{6,11,176},{7,11,395},{9,11,562},{144,11,28},{132,11,501},{
+132,0,704},{134,0,1524},{7,0,1078},{134,11,464},{6,11,509},{10,11,82},{20,11,91}
+,{151,11,13},{4,0,720},{133,0,306},{133,0,431},{7,0,1196},{4,10,914},{5,10,800},
+{133,10,852},{135,11,1189},{10,0,54},{141,10,115},{7,10,564},{142,10,168},{5,0,
+464},{6,0,236},{7,0,696},{7,0,914},{7,0,1108},{7,0,1448},{9,0,15},{9,0,564},{10,
+0,14},{12,0,565},{13,0,449},{14,0,53},{15,0,13},{16,0,64},{17,0,41},{4,10,918},{
+133,10,876},{6,0,1418},{134,10,1764},{4,10,92},{133,10,274},{134,0,907},{4,11,
+114},{8,10,501},{9,11,492},{13,11,462},{142,11,215},{4,11,77},{5,11,361},{6,11,
+139},{6,11,401},{6,11,404},{7,11,413},{7,11,715},{7,11,1716},{11,11,279},{12,11,
+179},{12,11,258},{13,11,244},{142,11,358},{6,0,1767},{12,0,194},{145,0,107},{134
+,11,1717},{5,10,743},{142,11,329},{4,10,49},{7,10,280},{135,10,1633},{5,0,840},{
+7,11,1061},{8,11,82},{11,11,250},{12,11,420},{141,11,184},{135,11,724},{134,0,
+900},{136,10,47},{134,0,1436},{144,11,0},{6,0,675},{7,0,1008},{7,0,1560},{9,0,
+642},{11,0,236},{14,0,193},{5,10,272},{5,10,908},{5,10,942},{8,10,197},{9,10,47}
+,{11,10,538},{139,10,742},{4,0,68},{5,0,628},{5,0,634},{6,0,386},{7,0,794},{8,0,
+273},{9,0,563},{10,0,105},{10,0,171},{11,0,94},{139,0,354},{135,10,1911},{137,10
+,891},{4,0,95},{6,0,1297},{6,0,1604},{7,0,416},{139,0,830},{6,11,513},{135,11,
+1052},{7,0,731},{13,0,20},{143,0,11},{137,11,899},{10,0,850},{140,0,697},{4,0,
+662},{7,11,1417},{12,11,382},{17,11,48},{152,11,12},{133,0,736},{132,0,861},{4,
+10,407},{132,10,560},{141,10,490},{6,11,545},{7,11,565},{7,11,1669},{10,11,114},
+{11,11,642},{140,11,618},{6,0,871},{134,0,1000},{5,0,864},{10,0,648},{11,0,671},
+{15,0,46},{133,11,5},{133,0,928},{11,0,90},{13,0,7},{4,10,475},{11,10,35},{13,10
+,71},{13,10,177},{142,10,422},{136,0,332},{135,11,192},{134,0,1055},{136,11,763}
+,{11,0,986},{140,0,682},{7,0,76},{8,0,44},{9,0,884},{10,0,580},{11,0,399},{11,0,
+894},{143,0,122},{135,11,1237},{135,10,636},{11,0,300},{6,10,222},{7,10,1620},{8
+,10,409},{137,10,693},{4,11,87},{5,11,250},{10,11,601},{13,11,298},{13,11,353},{
+141,11,376},{5,0,518},{10,0,340},{11,0,175},{149,0,16},{140,0,771},{6,0,1108},{
+137,0,831},{132,0,836},{135,0,1852},{4,0,957},{6,0,1804},{8,0,842},{8,0,843},{8,
+0,851},{8,0,855},{140,0,767},{135,11,814},{4,11,57},{7,11,1195},{7,11,1438},{7,
+11,1548},{7,11,1835},{7,11,1904},{9,11,757},{10,11,604},{139,11,519},{133,10,882
+},{138,0,246},{4,0,934},{5,0,202},{8,0,610},{7,11,1897},{12,11,290},{13,11,80},{
+13,11,437},{145,11,74},{8,0,96},{9,0,36},{10,0,607},{10,0,804},{10,0,832},{11,0,
+423},{11,0,442},{12,0,309},{14,0,199},{15,0,90},{145,0,110},{132,10,426},{7,0,
+654},{8,0,240},{6,10,58},{7,10,745},{7,10,1969},{8,10,675},{9,10,479},{9,10,731}
+,{10,10,330},{10,10,593},{10,10,817},{11,10,32},{11,10,133},{11,10,221},{145,10,
+68},{9,0,13},{9,0,398},{9,0,727},{10,0,75},{10,0,184},{10,0,230},{10,0,564},{10,
+0,569},{11,0,973},{12,0,70},{12,0,189},{13,0,57},{141,0,257},{4,11,209},{135,11,
+902},{7,0,391},{137,10,538},{134,0,403},{6,11,303},{7,11,335},{7,11,1437},{7,11,
+1668},{8,11,553},{8,11,652},{8,11,656},{9,11,558},{11,11,743},{149,11,18},{132,
+11,559},{11,0,75},{142,0,267},{6,0,815},{141,11,2},{141,0,366},{137,0,631},{133,
+11,1017},{5,0,345},{135,0,1016},{133,11,709},{134,11,1745},{133,10,566},{7,0,952
+},{6,10,48},{9,10,139},{10,10,399},{11,10,469},{12,10,634},{141,10,223},{133,0,
+673},{9,0,850},{7,11,8},{136,11,206},{6,0,662},{149,0,35},{4,0,287},{133,0,1018}
+,{6,10,114},{7,10,1224},{7,10,1556},{136,10,3},{8,10,576},{137,10,267},{4,0,884}
+,{5,0,34},{10,0,724},{12,0,444},{13,0,354},{18,0,32},{23,0,24},{23,0,31},{152,0,
+5},{133,10,933},{132,11,776},{138,0,151},{136,0,427},{134,0,382},{132,0,329},{9,
+0,846},{10,0,827},{138,11,33},{9,0,279},{10,0,407},{14,0,84},{22,0,18},{135,11,
+1297},{136,11,406},{132,0,906},{136,0,366},{134,0,843},{134,0,1443},{135,0,1372}
+,{138,0,992},{4,0,123},{5,0,605},{7,0,1509},{136,0,36},{132,0,649},{8,11,175},{
+10,11,168},{138,11,573},{133,0,767},{134,0,1018},{135,11,1305},{12,10,30},{13,10
+,148},{14,10,87},{14,10,182},{16,10,42},{148,10,70},{134,11,607},{4,0,273},{5,0,
+658},{133,0,995},{6,0,72},{139,11,174},{10,0,483},{12,0,368},{7,10,56},{7,10,
+1989},{8,10,337},{8,10,738},{9,10,600},{13,10,447},{142,10,92},{5,11,784},{138,
+10,666},{135,0,1345},{139,11,882},{134,0,1293},{133,0,589},{134,0,1988},{5,0,117
+},{6,0,514},{6,0,541},{7,0,1164},{7,0,1436},{8,0,220},{8,0,648},{10,0,688},{139,
+0,560},{136,0,379},{5,0,686},{7,10,866},{135,10,1163},{132,10,328},{9,11,14},{9,
+11,441},{10,11,306},{139,11,9},{4,10,101},{135,10,1171},{5,10,833},{136,10,744},
+{5,11,161},{7,11,839},{135,11,887},{7,0,196},{10,0,765},{11,0,347},{11,0,552},{
+11,0,790},{12,0,263},{13,0,246},{13,0,270},{13,0,395},{14,0,176},{14,0,190},{14,
+0,398},{14,0,412},{15,0,32},{15,0,63},{16,0,88},{147,0,105},{6,10,9},{6,10,397},
+{7,10,53},{7,10,1742},{10,10,632},{11,10,828},{140,10,146},{5,0,381},{135,0,1792
+},{134,0,1452},{135,11,429},{8,0,367},{10,0,760},{14,0,79},{20,0,17},{152,0,0},{
+7,0,616},{138,0,413},{11,10,417},{12,10,223},{140,10,265},{7,11,1611},{13,11,14}
+,{15,11,44},{19,11,13},{148,11,76},{135,0,1229},{6,0,120},{7,0,1188},{7,0,1710},
+{8,0,286},{9,0,667},{11,0,592},{139,0,730},{135,11,1814},{135,0,1146},{4,10,186}
+,{5,10,157},{8,10,168},{138,10,6},{4,0,352},{135,0,687},{4,0,192},{5,0,49},{6,0,
+200},{6,0,293},{6,0,1696},{135,0,1151},{133,10,875},{5,10,773},{5,10,991},{6,10,
+1635},{134,10,1788},{7,10,111},{136,10,581},{6,0,935},{134,0,1151},{134,0,1050},
+{132,0,650},{132,0,147},{11,0,194},{12,0,62},{12,0,88},{11,11,194},{12,11,62},{
+140,11,88},{6,0,339},{135,0,923},{134,10,1747},{7,11,643},{136,11,236},{133,0,
+934},{7,10,1364},{7,10,1907},{141,10,158},{132,10,659},{4,10,404},{135,10,675},{
+7,11,581},{9,11,644},{137,11,699},{13,0,211},{14,0,133},{14,0,204},{15,0,64},{15
+,0,69},{15,0,114},{16,0,10},{19,0,23},{19,0,35},{19,0,39},{19,0,51},{19,0,71},{
+19,0,75},{152,0,15},{133,10,391},{5,11,54},{135,11,1513},{7,0,222},{8,0,341},{5,
+10,540},{134,10,1697},{134,10,78},{132,11,744},{136,0,293},{137,11,701},{7,11,
+930},{10,11,402},{10,11,476},{13,11,452},{18,11,55},{147,11,104},{132,0,637},{
+133,10,460},{8,11,50},{137,11,624},{132,11,572},{134,0,1159},{4,10,199},{139,10,
+34},{134,0,847},{134,10,388},{6,11,43},{7,11,38},{8,11,248},{9,11,504},{138,11,
+513},{9,0,683},{4,10,511},{6,10,608},{9,10,333},{10,10,602},{11,10,441},{11,10,
+723},{11,10,976},{140,10,357},{9,0,867},{138,0,837},{6,0,944},{135,11,326},{135,
+0,1809},{5,10,938},{7,11,783},{136,10,707},{133,11,766},{133,11,363},{6,0,170},{
+7,0,1080},{8,0,395},{8,0,487},{141,0,147},{6,11,258},{140,11,409},{4,0,535},{8,0
+,618},{5,11,249},{148,11,82},{6,0,1379},{149,11,15},{135,0,1625},{150,0,23},{5,
+11,393},{6,11,378},{7,11,1981},{9,11,32},{9,11,591},{10,11,685},{10,11,741},{142
+,11,382},{133,11,788},{7,11,1968},{10,11,19},{139,11,911},{7,11,1401},{135,11,
+1476},{4,11,61},{5,11,58},{5,11,171},{5,11,635},{5,11,683},{5,11,700},{6,11,291}
+,{6,11,566},{7,11,1650},{11,11,523},{12,11,273},{12,11,303},{15,11,39},{143,11,
+111},{6,10,469},{7,10,1709},{138,10,515},{4,0,778},{134,11,589},{132,0,46},{5,0,
+811},{6,0,1679},{6,0,1714},{135,0,2032},{7,0,1458},{9,0,407},{11,0,15},{12,0,651
+},{149,0,37},{7,0,938},{132,10,500},{6,0,34},{7,0,69},{7,0,1089},{7,0,1281},{8,0
+,708},{8,0,721},{9,0,363},{148,0,98},{10,11,231},{147,11,124},{7,11,726},{152,11
+,9},{5,10,68},{134,10,383},{136,11,583},{4,11,917},{133,11,1005},{11,10,216},{
+139,10,340},{135,11,1675},{8,0,441},{10,0,314},{143,0,3},{132,11,919},{4,10,337}
+,{6,10,353},{7,10,1934},{8,10,488},{137,10,429},{7,0,889},{7,10,1795},{8,10,259}
+,{9,10,135},{9,10,177},{9,10,860},{10,10,825},{11,10,115},{11,10,370},{11,10,405
+},{11,10,604},{12,10,10},{12,10,667},{12,10,669},{13,10,76},{14,10,310},{15,10,
+76},{15,10,147},{148,10,23},{4,10,15},{4,11,255},{5,10,22},{5,11,302},{6,11,132}
+,{6,10,244},{7,10,40},{7,11,128},{7,10,200},{7,11,283},{7,10,906},{7,10,1199},{7
+,11,1299},{9,10,616},{10,11,52},{10,11,514},{10,10,716},{11,10,635},{11,10,801},
+{11,11,925},{12,10,458},{13,11,92},{142,11,309},{132,0,462},{137,11,173},{135,10
+,1735},{8,0,525},{5,10,598},{7,10,791},{8,10,108},{137,10,123},{5,0,73},{6,0,23}
+,{134,0,338},{132,0,676},{132,10,683},{7,0,725},{8,0,498},{139,0,268},{12,0,21},
+{151,0,7},{135,0,773},{4,10,155},{135,10,1689},{4,0,164},{5,0,730},{5,10,151},{5
+,10,741},{6,11,210},{7,10,498},{7,10,870},{7,10,1542},{12,10,213},{14,10,36},{14
+,10,391},{17,10,111},{18,10,6},{18,10,46},{18,10,151},{19,10,36},{20,10,32},{20,
+10,56},{20,10,69},{20,10,102},{21,10,4},{22,10,8},{22,10,10},{22,10,14},{150,10,
+31},{4,10,624},{135,10,1752},{4,0,583},{9,0,936},{15,0,214},{18,0,199},{24,0,26}
+,{134,11,588},{7,0,1462},{11,0,659},{4,11,284},{134,11,223},{133,0,220},{139,0,
+803},{132,0,544},{4,10,492},{133,10,451},{16,0,98},{148,0,119},{4,11,218},{7,11,
+526},{143,11,137},{135,10,835},{4,11,270},{5,11,192},{6,11,332},{7,11,1322},{13,
+11,9},{13,10,70},{14,11,104},{142,11,311},{132,10,539},{140,11,661},{5,0,176},{6
+,0,437},{6,0,564},{11,0,181},{141,0,183},{135,0,1192},{6,10,113},{135,10,436},{
+136,10,718},{135,10,520},{135,0,1878},{140,11,196},{7,11,379},{8,11,481},{137,11
+,377},{5,11,1003},{6,11,149},{137,11,746},{8,11,262},{9,11,627},{10,11,18},{11,
+11,214},{11,11,404},{11,11,457},{11,11,780},{11,11,849},{11,11,913},{13,11,330},
+{13,11,401},{142,11,200},{149,0,26},{136,11,304},{132,11,142},{135,0,944},{4,0,
+790},{5,0,273},{134,0,394},{134,0,855},{4,0,135},{6,0,127},{7,0,1185},{7,0,1511}
+,{8,0,613},{11,0,5},{12,0,336},{12,0,495},{12,0,586},{12,0,660},{12,0,668},{14,0
+,385},{15,0,118},{17,0,20},{146,0,98},{6,0,230},{9,0,752},{18,0,109},{12,10,610}
+,{13,10,431},{144,10,59},{7,0,1954},{135,11,925},{4,11,471},{5,11,51},{6,11,602}
+,{8,11,484},{10,11,195},{140,11,159},{132,10,307},{136,11,688},{132,11,697},{7,
+11,812},{7,11,1261},{7,11,1360},{9,11,632},{140,11,352},{5,0,162},{8,0,68},{133,
+10,964},{4,0,654},{136,11,212},{4,0,156},{7,0,998},{7,0,1045},{7,0,1860},{9,0,48
+},{9,0,692},{11,0,419},{139,0,602},{133,11,221},{4,11,373},{5,11,283},{6,11,480}
+,{135,11,609},{142,11,216},{132,0,240},{6,11,192},{9,11,793},{145,11,55},{4,10,
+75},{5,10,180},{6,10,500},{7,10,58},{7,10,710},{138,10,645},{4,11,132},{5,11,69}
+,{5,10,649},{135,11,1242},{6,10,276},{7,10,282},{7,10,879},{7,10,924},{8,10,459}
+,{9,10,599},{9,10,754},{11,10,574},{12,10,128},{12,10,494},{13,10,52},{13,10,301
+},{15,10,30},{143,10,132},{132,10,200},{4,11,111},{135,11,302},{9,0,197},{10,0,
+300},{12,0,473},{13,0,90},{141,0,405},{132,11,767},{6,11,42},{7,11,1416},{7,11,
+1590},{7,11,2005},{8,11,131},{8,11,466},{9,11,672},{13,11,252},{148,11,103},{8,0
+,958},{8,0,999},{10,0,963},{138,0,1001},{135,10,1621},{135,0,858},{4,0,606},{137
+,11,444},{6,11,44},{136,11,368},{139,11,172},{4,11,570},{133,11,120},{139,11,624
+},{7,0,1978},{8,0,676},{6,10,225},{137,10,211},{7,0,972},{11,0,102},{136,10,687}
+,{6,11,227},{135,11,1589},{8,10,58},{9,10,724},{11,10,809},{13,10,113},{145,10,
+72},{4,0,361},{133,0,315},{132,0,461},{6,10,345},{135,10,1247},{132,0,472},{8,10
+,767},{8,10,803},{9,10,301},{137,10,903},{135,11,1333},{135,11,477},{7,10,1949},
+{136,10,674},{6,0,905},{138,0,747},{133,0,155},{134,10,259},{7,0,163},{8,0,319},
+{9,0,402},{10,0,24},{10,0,681},{11,0,200},{12,0,253},{12,0,410},{142,0,219},{5,0
+,475},{7,0,1780},{9,0,230},{11,0,297},{11,0,558},{14,0,322},{19,0,76},{6,11,1667
+},{7,11,2036},{138,11,600},{136,10,254},{6,0,848},{135,0,1956},{6,11,511},{140,
+11,132},{5,11,568},{6,11,138},{135,11,1293},{6,0,631},{137,0,838},{149,0,36},{4,
+11,565},{8,11,23},{136,11,827},{5,0,944},{134,0,1769},{4,0,144},{6,0,842},{6,0,
+1400},{4,11,922},{133,11,1023},{133,10,248},{9,10,800},{10,10,693},{11,10,482},{
+11,10,734},{139,10,789},{7,11,1002},{139,11,145},{4,10,116},{5,10,95},{5,10,445}
+,{7,10,1688},{8,10,29},{9,10,272},{11,10,509},{139,10,915},{14,0,369},{146,0,72}
+,{135,10,1641},{132,11,740},{133,10,543},{140,11,116},{6,0,247},{9,0,555},{5,10,
+181},{136,10,41},{133,10,657},{136,0,996},{138,10,709},{7,0,189},{8,10,202},{138
+,10,536},{136,11,402},{4,11,716},{141,11,31},{10,0,280},{138,0,797},{9,10,423},{
+140,10,89},{8,10,113},{9,10,877},{10,10,554},{11,10,83},{12,10,136},{147,10,109}
+,{133,10,976},{7,0,746},{132,10,206},{136,0,526},{139,0,345},{136,0,1017},{8,11,
+152},{9,11,53},{9,11,268},{9,11,901},{10,11,518},{10,11,829},{11,11,188},{13,11,
+74},{14,11,46},{15,11,17},{15,11,33},{17,11,40},{18,11,36},{19,11,20},{22,11,1},
+{152,11,2},{133,11,736},{136,11,532},{5,0,428},{138,0,651},{135,11,681},{135,0,
+1162},{7,0,327},{13,0,230},{17,0,113},{8,10,226},{10,10,537},{11,10,570},{11,10,
+605},{11,10,799},{11,10,804},{12,10,85},{12,10,516},{12,10,623},{12,11,677},{13,
+10,361},{14,10,77},{14,10,78},{147,10,110},{4,0,792},{7,0,1717},{10,0,546},{132,
+10,769},{4,11,684},{136,11,384},{132,10,551},{134,0,1203},{9,10,57},{9,10,459},{
+10,10,425},{11,10,119},{12,10,184},{12,10,371},{13,10,358},{145,10,51},{5,0,672}
+,{5,10,814},{8,10,10},{9,10,421},{9,10,729},{10,10,609},{139,10,689},{138,0,189}
+,{134,10,624},{7,11,110},{7,11,188},{8,11,290},{8,11,591},{9,11,382},{9,11,649},
+{11,11,71},{11,11,155},{11,11,313},{12,11,5},{13,11,325},{142,11,287},{133,0,99}
+,{6,0,1053},{135,0,298},{7,11,360},{7,11,425},{9,11,66},{9,11,278},{138,11,644},
+{4,0,397},{136,0,555},{137,10,269},{132,10,528},{4,11,900},{133,11,861},{6,0,
+1157},{5,11,254},{7,11,985},{136,11,73},{7,11,1959},{136,11,683},{12,0,398},{20,
+0,39},{21,0,11},{150,0,41},{4,0,485},{7,0,353},{135,0,1523},{6,0,366},{7,0,1384}
+,{135,0,1601},{138,0,787},{137,0,282},{5,10,104},{6,10,173},{135,10,1631},{139,
+11,146},{4,0,157},{133,0,471},{134,0,941},{132,11,725},{7,0,1336},{8,10,138},{8,
+10,342},{9,10,84},{10,10,193},{11,10,883},{140,10,359},{134,11,196},{136,0,116},
+{133,11,831},{134,0,787},{134,10,95},{6,10,406},{10,10,409},{10,10,447},{11,10,
+44},{140,10,100},{5,0,160},{7,0,363},{7,0,589},{10,0,170},{141,0,55},{134,0,1815
+},{132,0,866},{6,0,889},{6,0,1067},{6,0,1183},{4,11,321},{134,11,569},{5,11,848}
+,{134,11,66},{4,11,36},{6,10,1636},{7,11,1387},{10,11,205},{11,11,755},{141,11,
+271},{132,0,689},{9,0,820},{4,10,282},{7,10,1034},{11,10,398},{11,10,634},{12,10
+,1},{12,10,79},{12,10,544},{14,10,237},{17,10,10},{146,10,20},{4,0,108},{7,0,804
+},{139,0,498},{132,11,887},{6,0,1119},{135,11,620},{6,11,165},{138,11,388},{5,0,
+244},{5,10,499},{6,10,476},{7,10,600},{7,10,888},{135,10,1096},{140,0,609},{135,
+0,1005},{4,0,412},{133,0,581},{4,11,719},{135,11,155},{7,10,296},{7,10,596},{8,
+10,560},{8,10,586},{9,10,612},{11,10,304},{12,10,46},{13,10,89},{14,10,112},{145
+,10,122},{4,0,895},{133,0,772},{142,11,307},{135,0,1898},{4,0,926},{133,0,983},{
+4,11,353},{6,11,146},{6,11,1789},{7,11,288},{7,11,990},{7,11,1348},{9,11,665},{9
+,11,898},{11,11,893},{142,11,212},{132,0,538},{133,11,532},{6,0,294},{7,0,1267},
+{8,0,624},{141,0,496},{7,0,1325},{4,11,45},{135,11,1257},{138,0,301},{9,0,298},{
+12,0,291},{13,0,276},{14,0,6},{17,0,18},{21,0,32},{7,10,1599},{7,10,1723},{8,10,
+79},{8,10,106},{8,10,190},{8,10,302},{8,10,383},{8,10,713},{9,10,119},{9,10,233}
+,{9,10,419},{9,10,471},{10,10,181},{10,10,406},{11,10,57},{11,10,85},{11,10,120}
+,{11,10,177},{11,10,296},{11,10,382},{11,10,454},{11,10,758},{11,10,999},{12,10,
+27},{12,10,131},{12,10,245},{12,10,312},{12,10,446},{12,10,454},{13,10,98},{13,
+10,426},{13,10,508},{14,10,163},{14,10,272},{14,10,277},{14,10,370},{15,10,95},{
+15,10,138},{15,10,167},{17,10,38},{148,10,96},{132,0,757},{134,0,1263},{4,0,820}
+,{134,10,1759},{133,0,722},{136,11,816},{138,10,372},{145,10,16},{134,0,1039},{4
+,0,991},{134,0,2028},{133,10,258},{7,0,1875},{139,0,124},{6,11,559},{6,11,1691},
+{135,11,586},{5,0,324},{7,0,881},{8,10,134},{9,10,788},{140,10,438},{7,11,1823},
+{139,11,693},{6,0,1348},{134,0,1545},{134,0,911},{132,0,954},{8,0,329},{8,0,414}
+,{7,10,1948},{135,10,2004},{5,0,517},{6,10,439},{7,10,780},{135,10,1040},{132,0,
+816},{5,10,1},{6,10,81},{138,10,520},{9,0,713},{10,0,222},{5,10,482},{8,10,98},{
+10,10,700},{10,10,822},{11,10,302},{11,10,778},{12,10,50},{12,10,127},{12,10,396
+},{13,10,62},{13,10,328},{14,10,122},{147,10,72},{137,0,33},{5,10,2},{7,10,1494}
+,{136,10,589},{6,10,512},{7,10,797},{8,10,253},{9,10,77},{10,10,1},{10,11,108},{
+10,10,129},{10,10,225},{11,11,116},{11,10,118},{11,10,226},{11,10,251},{11,10,
+430},{11,10,701},{11,10,974},{11,10,982},{12,10,64},{12,10,260},{12,10,488},{140
+,10,690},{134,11,456},{133,11,925},{5,0,150},{7,0,106},{7,0,774},{8,0,603},{9,0,
+593},{9,0,634},{10,0,44},{10,0,173},{11,0,462},{11,0,515},{13,0,216},{13,0,288},
+{142,0,400},{137,10,347},{5,0,748},{134,0,553},{12,0,108},{141,0,291},{7,0,420},
+{4,10,12},{7,10,522},{7,10,809},{8,10,797},{141,10,88},{6,11,193},{7,11,240},{7,
+11,1682},{10,11,51},{10,11,640},{11,11,410},{13,11,82},{14,11,247},{14,11,331},{
+142,11,377},{133,10,528},{135,0,1777},{4,0,493},{144,0,55},{136,11,633},{139,0,
+81},{6,0,980},{136,0,321},{148,10,109},{5,10,266},{9,10,290},{9,10,364},{10,10,
+293},{11,10,606},{142,10,45},{6,0,568},{7,0,112},{7,0,1804},{8,0,362},{8,0,410},
+{8,0,830},{9,0,514},{11,0,649},{142,0,157},{4,0,74},{6,0,510},{6,10,594},{9,10,
+121},{10,10,49},{10,10,412},{139,10,834},{134,0,838},{136,10,748},{132,10,466},{
+132,0,625},{135,11,1443},{4,11,237},{135,11,514},{9,10,378},{141,10,162},{6,0,16
+},{6,0,158},{7,0,43},{7,0,129},{7,0,181},{8,0,276},{8,0,377},{10,0,523},{11,0,
+816},{12,0,455},{13,0,303},{142,0,135},{135,0,281},{4,0,1},{7,0,1143},{7,0,1463}
+,{8,0,61},{9,0,207},{9,0,390},{9,0,467},{139,0,836},{6,11,392},{7,11,65},{135,11
+,2019},{132,10,667},{4,0,723},{5,0,895},{7,0,1031},{8,0,199},{8,0,340},{9,0,153}
+,{9,0,215},{10,0,21},{10,0,59},{10,0,80},{10,0,224},{10,0,838},{11,0,229},{11,0,
+652},{12,0,192},{13,0,146},{142,0,91},{132,0,295},{137,0,51},{9,11,222},{10,11,
+43},{139,11,900},{5,0,309},{140,0,211},{5,0,125},{8,0,77},{138,0,15},{136,11,604
+},{138,0,789},{5,0,173},{4,10,39},{7,10,1843},{8,10,407},{11,10,144},{140,10,523
+},{138,11,265},{133,0,439},{132,10,510},{7,0,648},{7,0,874},{11,0,164},{12,0,76}
+,{18,0,9},{7,10,1980},{10,10,487},{138,10,809},{12,0,111},{14,0,294},{19,0,45},{
+13,10,260},{146,10,63},{133,11,549},{134,10,570},{4,0,8},{7,0,1152},{7,0,1153},{
+7,0,1715},{9,0,374},{10,0,478},{139,0,648},{135,0,1099},{5,0,575},{6,0,354},{135
+,0,701},{7,11,36},{8,11,201},{136,11,605},{4,10,787},{136,11,156},{6,0,518},{149
+,11,13},{140,11,224},{134,0,702},{132,10,516},{5,11,724},{10,11,305},{11,11,151}
+,{12,11,33},{12,11,121},{12,11,381},{17,11,3},{17,11,27},{17,11,78},{18,11,18},{
+19,11,54},{149,11,5},{8,0,87},{4,11,523},{5,11,638},{11,10,887},{14,10,365},{142
+,10,375},{138,0,438},{136,10,821},{135,11,1908},{6,11,242},{7,11,227},{7,11,1581
+},{8,11,104},{9,11,113},{9,11,220},{9,11,427},{10,11,74},{10,11,239},{11,11,579}
+,{11,11,1023},{13,11,4},{13,11,204},{13,11,316},{18,11,95},{148,11,86},{4,0,69},
+{5,0,122},{5,0,849},{6,0,1633},{9,0,656},{138,0,464},{7,0,1802},{4,10,10},{139,
+10,786},{135,11,861},{139,0,499},{7,0,476},{7,0,1592},{138,0,87},{133,10,684},{4
+,0,840},{134,10,27},{142,0,283},{6,0,1620},{7,11,1328},{136,11,494},{5,0,859},{7
+,0,1160},{8,0,107},{9,0,291},{9,0,439},{10,0,663},{11,0,609},{140,0,197},{7,11,
+1306},{8,11,505},{9,11,482},{10,11,126},{11,11,225},{12,11,347},{12,11,449},{13,
+11,19},{142,11,218},{5,11,268},{10,11,764},{12,11,120},{13,11,39},{145,11,127},{
+145,10,56},{7,11,1672},{10,11,472},{11,11,189},{143,11,51},{6,10,342},{6,10,496}
+,{8,10,275},{137,10,206},{133,0,600},{4,0,117},{6,0,372},{7,0,1905},{142,0,323},
+{4,10,909},{5,10,940},{135,11,1471},{132,10,891},{4,0,722},{139,0,471},{4,11,384
+},{135,11,1022},{132,10,687},{9,0,5},{12,0,216},{12,0,294},{12,0,298},{12,0,400}
+,{12,0,518},{13,0,229},{143,0,139},{135,11,1703},{7,11,1602},{10,11,698},{12,11,
+212},{141,11,307},{6,10,41},{141,10,160},{135,11,1077},{9,11,159},{11,11,28},{
+140,11,603},{4,0,514},{7,0,1304},{138,0,477},{134,0,1774},{9,0,88},{139,0,270},{
+5,0,12},{7,0,375},{9,0,438},{134,10,1718},{132,11,515},{136,10,778},{8,11,632},{
+8,11,697},{137,11,854},{6,0,362},{6,0,997},{146,0,51},{7,0,816},{7,0,1241},{9,0,
+283},{9,0,520},{10,0,213},{10,0,307},{10,0,463},{10,0,671},{10,0,746},{11,0,401}
+,{11,0,794},{12,0,517},{18,0,107},{147,0,115},{133,10,115},{150,11,28},{4,11,136
+},{133,11,551},{142,10,314},{132,0,258},{6,0,22},{7,0,903},{7,0,1963},{8,0,639},
+{138,0,577},{5,0,681},{8,0,782},{13,0,130},{17,0,84},{5,10,193},{140,10,178},{9,
+11,17},{138,11,291},{7,11,1287},{9,11,44},{10,11,552},{10,11,642},{11,11,839},{
+12,11,274},{12,11,275},{12,11,372},{13,11,91},{142,11,125},{135,10,174},{4,0,664
+},{5,0,804},{139,0,1013},{134,0,942},{6,0,1349},{6,0,1353},{6,0,1450},{7,11,1518
+},{139,11,694},{11,0,356},{4,10,122},{5,10,796},{5,10,952},{6,10,1660},{6,10,
+1671},{8,10,567},{9,10,687},{9,10,742},{10,10,686},{11,10,682},{140,10,281},{5,0
+,32},{6,11,147},{7,11,886},{9,11,753},{138,11,268},{5,10,179},{7,10,1095},{135,
+10,1213},{4,10,66},{7,10,722},{135,10,904},{135,10,352},{9,11,245},{138,11,137},
+{4,0,289},{7,0,629},{7,0,1698},{7,0,1711},{12,0,215},{133,11,414},{6,0,1975},{
+135,11,1762},{6,0,450},{136,0,109},{141,10,35},{134,11,599},{136,0,705},{133,0,
+664},{134,11,1749},{11,11,402},{12,11,109},{12,11,431},{13,11,179},{13,11,206},{
+14,11,175},{14,11,217},{16,11,3},{148,11,53},{135,0,1238},{134,11,1627},{132,11,
+488},{13,0,318},{10,10,592},{10,10,753},{12,10,317},{12,10,355},{12,10,465},{12,
+10,469},{12,10,560},{140,10,578},{133,10,564},{132,11,83},{140,11,676},{6,0,1872
+},{6,0,1906},{6,0,1907},{9,0,934},{9,0,956},{9,0,960},{9,0,996},{12,0,794},{12,0
+,876},{12,0,880},{12,0,918},{15,0,230},{18,0,234},{18,0,238},{21,0,38},{149,0,62
+},{134,10,556},{134,11,278},{137,0,103},{7,10,544},{8,10,719},{138,10,61},{4,10,
+5},{5,10,498},{8,10,637},{137,10,521},{7,0,777},{12,0,229},{12,0,239},{15,0,12},
+{12,11,229},{12,11,239},{143,11,12},{6,0,26},{7,11,388},{7,11,644},{139,11,781},
+{7,11,229},{8,11,59},{9,11,190},{9,11,257},{10,11,378},{140,11,191},{133,10,927}
+,{135,10,1441},{4,10,893},{5,10,780},{133,10,893},{4,0,414},{5,0,467},{9,0,654},
+{10,0,451},{12,0,59},{141,0,375},{142,0,173},{135,0,17},{7,0,1350},{133,10,238},
+{135,0,955},{4,0,960},{10,0,887},{12,0,753},{18,0,161},{18,0,162},{152,0,19},{
+136,11,344},{6,10,1729},{137,11,288},{132,11,660},{4,0,217},{5,0,710},{7,0,760},
+{7,0,1926},{9,0,428},{9,0,708},{10,0,254},{10,0,296},{10,0,720},{11,0,109},{11,0
+,255},{12,0,165},{12,0,315},{13,0,107},{13,0,203},{14,0,54},{14,0,99},{14,0,114}
+,{14,0,388},{16,0,85},{17,0,9},{17,0,33},{20,0,25},{20,0,28},{20,0,29},{21,0,9},
+{21,0,10},{21,0,34},{22,0,17},{4,10,60},{7,10,1800},{8,10,314},{9,10,700},{139,
+10,487},{7,11,1035},{138,11,737},{7,11,690},{9,11,217},{9,11,587},{140,11,521},{
+6,0,919},{7,11,706},{7,11,1058},{138,11,538},{7,10,1853},{138,10,437},{136,10,
+419},{6,0,280},{10,0,502},{11,0,344},{140,0,38},{5,0,45},{7,0,1161},{11,0,448},{
+11,0,880},{13,0,139},{13,0,407},{15,0,16},{17,0,95},{18,0,66},{18,0,88},{18,0,
+123},{149,0,7},{11,11,92},{11,11,196},{11,11,409},{11,11,450},{11,11,666},{11,11
+,777},{12,11,262},{13,11,385},{13,11,393},{15,11,115},{16,11,45},{145,11,82},{
+136,0,777},{134,11,1744},{4,0,410},{7,0,521},{133,10,828},{134,0,673},{7,0,1110}
+,{7,0,1778},{7,10,176},{135,10,178},{5,10,806},{7,11,268},{7,10,1976},{136,11,
+569},{4,11,733},{9,11,194},{10,11,92},{11,11,198},{12,11,84},{12,11,87},{13,11,
+128},{144,11,74},{5,0,341},{7,0,1129},{11,0,414},{4,10,51},{6,10,4},{7,10,591},{
+7,10,849},{7,10,951},{7,10,1613},{7,10,1760},{7,10,1988},{9,10,434},{10,10,754},
+{11,10,25},{139,10,37},{133,10,902},{135,10,928},{135,0,787},{132,0,436},{134,10
+,270},{7,0,1587},{135,0,1707},{6,0,377},{7,0,1025},{9,0,613},{145,0,104},{7,11,
+982},{7,11,1361},{10,11,32},{143,11,56},{139,0,96},{132,0,451},{132,10,416},{142
+,10,372},{5,10,152},{5,10,197},{7,11,306},{7,10,340},{7,10,867},{10,10,548},{10,
+10,581},{11,10,6},{12,10,3},{12,10,19},{14,10,110},{142,10,289},{134,0,680},{134
+,11,609},{7,0,483},{7,10,190},{8,10,28},{8,10,141},{8,10,444},{8,10,811},{9,10,
+468},{11,10,334},{12,10,24},{12,10,386},{140,10,576},{10,0,916},{133,10,757},{5,
+10,721},{135,10,1553},{133,11,178},{134,0,937},{132,10,898},{133,0,739},{147,0,
+82},{135,0,663},{146,0,128},{5,10,277},{141,10,247},{134,0,1087},{132,10,435},{6
+,11,381},{7,11,645},{7,11,694},{136,11,546},{7,0,503},{135,0,1885},{6,0,1965},{8
+,0,925},{138,0,955},{4,0,113},{5,0,163},{5,0,735},{7,0,1009},{9,0,9},{9,0,771},{
+12,0,90},{13,0,138},{13,0,410},{143,0,128},{4,0,324},{138,0,104},{7,0,460},{5,10
+,265},{134,10,212},{133,11,105},{7,11,261},{7,11,1107},{7,11,1115},{7,11,1354},{
+7,11,1588},{7,11,1705},{7,11,1902},{9,11,465},{10,11,248},{10,11,349},{10,11,647
+},{11,11,527},{11,11,660},{11,11,669},{12,11,529},{141,11,305},{5,11,438},{9,11,
+694},{12,11,627},{141,11,210},{152,11,11},{4,0,935},{133,0,823},{132,10,702},{5,
+0,269},{7,0,434},{7,0,891},{8,0,339},{9,0,702},{11,0,594},{11,0,718},{17,0,100},
+{5,10,808},{135,10,2045},{7,0,1014},{9,0,485},{141,0,264},{134,0,1713},{7,0,1810
+},{11,0,866},{12,0,103},{13,0,495},{140,11,233},{4,0,423},{10,0,949},{138,0,1013
+},{135,0,900},{8,11,25},{138,11,826},{5,10,166},{8,10,739},{140,10,511},{134,0,
+2018},{7,11,1270},{139,11,612},{4,10,119},{5,10,170},{5,10,447},{7,10,1708},{7,
+10,1889},{9,10,357},{9,10,719},{12,10,486},{140,10,596},{12,0,574},{140,11,574},
+{132,11,308},{6,0,964},{6,0,1206},{134,0,1302},{4,10,450},{135,10,1158},{135,11,
+150},{136,11,649},{14,0,213},{148,0,38},{9,11,45},{9,11,311},{141,11,42},{134,11
+,521},{7,10,1375},{7,10,1466},{138,10,331},{132,10,754},{5,11,339},{7,11,1442},{
+14,11,3},{15,11,41},{147,11,66},{136,11,378},{134,0,1022},{5,10,850},{136,10,799
+},{142,0,143},{135,0,2029},{134,11,1628},{8,0,523},{150,0,34},{5,0,625},{135,0,
+1617},{7,0,275},{7,10,238},{7,10,2033},{8,10,120},{8,10,188},{8,10,659},{9,10,
+598},{10,10,466},{12,10,342},{12,10,588},{13,10,503},{14,10,246},{143,10,92},{7,
+0,37},{8,0,425},{8,0,693},{9,0,720},{10,0,380},{10,0,638},{11,0,273},{11,0,473},
+{12,0,61},{143,0,43},{135,11,829},{135,0,1943},{132,0,765},{5,11,486},{135,11,
+1349},{7,11,1635},{8,11,17},{10,11,217},{138,11,295},{4,10,201},{7,10,1744},{8,
+10,602},{11,10,247},{11,10,826},{145,10,65},{138,11,558},{11,0,551},{142,0,159},
+{8,10,164},{146,10,62},{139,11,176},{132,0,168},{136,0,1010},{134,0,1994},{135,0
+,91},{138,0,532},{135,10,1243},{135,0,1884},{132,10,907},{5,10,100},{10,10,329},
+{12,10,416},{149,10,29},{134,11,447},{132,10,176},{5,10,636},{5,10,998},{7,10,9}
+,{7,10,1508},{8,10,26},{9,10,317},{9,10,358},{10,10,210},{10,10,292},{10,10,533}
+,{11,10,555},{12,10,526},{12,10,607},{13,10,263},{13,10,459},{142,10,271},{4,11,
+609},{135,11,756},{6,0,15},{7,0,70},{10,0,240},{147,0,93},{4,11,930},{133,11,947
+},{134,0,1227},{134,0,1534},{133,11,939},{133,11,962},{5,11,651},{8,11,170},{9,
+11,61},{9,11,63},{10,11,23},{10,11,37},{10,11,834},{11,11,4},{11,11,187},{11,11,
+281},{11,11,503},{11,11,677},{12,11,96},{12,11,130},{12,11,244},{14,11,5},{14,11
+,40},{14,11,162},{14,11,202},{146,11,133},{4,11,406},{5,11,579},{12,11,492},{150
+,11,15},{139,0,392},{6,10,610},{10,10,127},{141,10,27},{7,0,655},{7,0,1844},{136
+,10,119},{4,0,145},{6,0,176},{7,0,395},{137,0,562},{132,0,501},{140,11,145},{136
+,0,1019},{134,0,509},{139,0,267},{6,11,17},{7,11,16},{7,11,1001},{7,11,1982},{9,
+11,886},{10,11,489},{10,11,800},{11,11,782},{12,11,320},{13,11,467},{14,11,145},
+{14,11,387},{143,11,119},{145,11,17},{6,0,1099},{133,11,458},{7,11,1983},{8,11,0
+},{8,11,171},{9,11,120},{9,11,732},{10,11,473},{11,11,656},{11,11,998},{18,11,0}
+,{18,11,2},{147,11,21},{12,11,427},{146,11,38},{10,0,948},{138,0,968},{7,10,126}
+,{136,10,84},{136,10,790},{4,0,114},{9,0,492},{13,0,462},{142,0,215},{6,10,64},{
+12,10,377},{141,10,309},{4,0,77},{5,0,361},{6,0,139},{6,0,401},{6,0,404},{7,0,
+413},{7,0,715},{7,0,1716},{11,0,279},{12,0,179},{12,0,258},{13,0,244},{142,0,358
+},{134,0,1717},{7,0,772},{7,0,1061},{7,0,1647},{8,0,82},{11,0,250},{11,0,607},{
+12,0,311},{12,0,420},{13,0,184},{13,0,367},{7,10,1104},{11,10,269},{11,10,539},{
+11,10,627},{11,10,706},{11,10,975},{12,10,248},{12,10,434},{12,10,600},{12,10,
+622},{13,10,297},{13,10,485},{14,10,69},{14,10,409},{143,10,108},{135,0,724},{4,
+11,512},{4,11,519},{133,11,342},{134,0,1133},{145,11,29},{11,10,977},{141,10,507
+},{6,0,841},{6,0,1042},{6,0,1194},{10,0,993},{140,0,1021},{6,11,31},{7,11,491},{
+7,11,530},{8,11,592},{9,10,34},{11,11,53},{11,10,484},{11,11,779},{12,11,167},{
+12,11,411},{14,11,14},{14,11,136},{15,11,72},{16,11,17},{144,11,72},{4,0,1021},{
+6,0,2037},{133,11,907},{7,0,373},{8,0,335},{8,0,596},{9,0,488},{6,10,1700},{7,10
+,293},{7,10,382},{7,10,1026},{7,10,1087},{7,10,2027},{8,10,252},{8,10,727},{8,10
+,729},{9,10,30},{9,10,199},{9,10,231},{9,10,251},{9,10,334},{9,10,361},{9,10,712
+},{10,10,55},{10,10,60},{10,10,232},{10,10,332},{10,10,384},{10,10,396},{10,10,
+504},{10,10,542},{10,10,652},{11,10,20},{11,10,48},{11,10,207},{11,10,291},{11,
+10,298},{11,10,342},{11,10,365},{11,10,394},{11,10,620},{11,10,705},{11,10,1017}
+,{12,10,123},{12,10,340},{12,10,406},{12,10,643},{13,10,61},{13,10,269},{13,10,
+311},{13,10,319},{13,10,486},{14,10,234},{15,10,62},{15,10,85},{16,10,71},{18,10
+,119},{148,10,105},{150,0,37},{4,11,208},{5,11,106},{6,11,531},{8,11,408},{9,11,
+188},{138,11,572},{132,0,564},{6,0,513},{135,0,1052},{132,0,825},{9,0,899},{140,
+11,441},{134,0,778},{133,11,379},{7,0,1417},{12,0,382},{17,0,48},{152,0,12},{132
+,11,241},{7,0,1116},{6,10,379},{7,10,270},{8,10,176},{8,10,183},{9,10,432},{9,10
+,661},{12,10,247},{12,10,617},{146,10,125},{5,10,792},{133,10,900},{6,0,545},{7,
+0,565},{7,0,1669},{10,0,114},{11,0,642},{140,0,618},{133,0,5},{138,11,7},{132,11
+,259},{135,0,192},{134,0,701},{136,0,763},{135,10,1979},{4,10,901},{133,10,776},
+{10,0,755},{147,0,29},{133,0,759},{4,11,173},{5,11,312},{5,11,512},{135,11,1285}
+,{7,11,1603},{7,11,1691},{9,11,464},{11,11,195},{12,11,279},{12,11,448},{14,11,
+11},{147,11,102},{7,0,370},{7,0,1007},{7,0,1177},{135,0,1565},{135,0,1237},{4,0,
+87},{5,0,250},{141,0,298},{4,11,452},{5,11,583},{5,11,817},{6,11,433},{7,11,593}
+,{7,11,720},{7,11,1378},{8,11,161},{9,11,284},{10,11,313},{139,11,886},{4,11,547
+},{135,11,1409},{136,11,722},{4,10,37},{5,10,334},{135,10,1253},{132,10,508},{12
+,0,107},{146,0,31},{8,11,420},{139,11,193},{135,0,814},{135,11,409},{140,0,991},
+{4,0,57},{7,0,1195},{7,0,1438},{7,0,1548},{7,0,1835},{7,0,1904},{9,0,757},{10,0,
+604},{139,0,519},{132,0,540},{138,11,308},{132,10,533},{136,0,608},{144,11,65},{
+4,0,1014},{134,0,2029},{4,0,209},{7,0,902},{5,11,1002},{136,11,745},{134,0,2030}
+,{6,0,303},{7,0,335},{7,0,1437},{7,0,1668},{8,0,553},{8,0,652},{8,0,656},{9,0,
+558},{11,0,743},{149,0,18},{5,11,575},{6,11,354},{135,11,701},{4,11,239},{6,11,
+477},{7,11,1607},{11,11,68},{139,11,617},{132,0,559},{8,0,527},{18,0,60},{147,0,
+24},{133,10,920},{138,0,511},{133,0,1017},{133,0,675},{138,10,391},{11,0,156},{
+135,10,1952},{138,11,369},{132,11,367},{133,0,709},{6,0,698},{134,0,887},{142,10
+,126},{134,0,1745},{132,10,483},{13,11,299},{142,11,75},{133,0,714},{7,0,8},{136
+,0,206},{138,10,480},{4,11,694},{9,10,495},{146,10,104},{7,11,1248},{11,11,621},
+{139,11,702},{140,11,687},{132,0,776},{139,10,1009},{135,0,1272},{134,0,1059},{8
+,10,653},{13,10,93},{147,10,14},{135,11,213},{136,0,406},{133,10,172},{132,0,947
+},{8,0,175},{10,0,168},{138,0,573},{132,0,870},{6,0,1567},{151,11,28},{134,11,
+472},{5,10,260},{136,11,132},{4,11,751},{11,11,390},{140,11,32},{4,11,409},{133,
+11,78},{12,0,554},{6,11,473},{145,11,105},{133,0,784},{8,0,908},{136,11,306},{
+139,0,882},{6,0,358},{7,0,1393},{8,0,396},{10,0,263},{14,0,154},{16,0,48},{17,0,
+8},{7,11,1759},{8,11,396},{10,11,263},{14,11,154},{16,11,48},{145,11,8},{13,11,
+163},{13,11,180},{18,11,78},{148,11,35},{14,0,32},{18,0,85},{20,0,2},{152,0,16},
+{7,0,228},{10,0,770},{8,10,167},{8,10,375},{9,10,82},{9,10,561},{138,10,620},{
+132,0,845},{9,0,14},{9,0,441},{10,0,306},{139,0,9},{11,0,966},{12,0,287},{13,0,
+342},{13,0,402},{15,0,110},{15,0,163},{8,10,194},{136,10,756},{134,0,1578},{4,0,
+967},{6,0,1820},{6,0,1847},{140,0,716},{136,0,594},{7,0,1428},{7,0,1640},{7,0,
+1867},{9,0,169},{9,0,182},{9,0,367},{9,0,478},{9,0,506},{9,0,551},{9,0,557},{9,0
+,648},{9,0,697},{9,0,705},{9,0,725},{9,0,787},{9,0,794},{10,0,198},{10,0,214},{
+10,0,267},{10,0,275},{10,0,456},{10,0,551},{10,0,561},{10,0,613},{10,0,627},{10,
+0,668},{10,0,675},{10,0,691},{10,0,695},{10,0,707},{10,0,715},{11,0,183},{11,0,
+201},{11,0,244},{11,0,262},{11,0,352},{11,0,439},{11,0,493},{11,0,572},{11,0,591
+},{11,0,608},{11,0,611},{11,0,646},{11,0,674},{11,0,711},{11,0,751},{11,0,761},{
+11,0,776},{11,0,785},{11,0,850},{11,0,853},{11,0,862},{11,0,865},{11,0,868},{11,
+0,875},{11,0,898},{11,0,902},{11,0,903},{11,0,910},{11,0,932},{11,0,942},{11,0,
+957},{11,0,967},{11,0,972},{12,0,148},{12,0,195},{12,0,220},{12,0,237},{12,0,318
+},{12,0,339},{12,0,393},{12,0,445},{12,0,450},{12,0,474},{12,0,505},{12,0,509},{
+12,0,533},{12,0,591},{12,0,594},{12,0,597},{12,0,621},{12,0,633},{12,0,642},{13,
+0,59},{13,0,60},{13,0,145},{13,0,239},{13,0,250},{13,0,329},{13,0,344},{13,0,365
+},{13,0,372},{13,0,387},{13,0,403},{13,0,414},{13,0,456},{13,0,470},{13,0,478},{
+13,0,483},{13,0,489},{14,0,55},{14,0,57},{14,0,81},{14,0,90},{14,0,148},{14,0,
+239},{14,0,266},{14,0,321},{14,0,326},{14,0,327},{14,0,330},{14,0,347},{14,0,355
+},{14,0,401},{14,0,404},{14,0,411},{14,0,414},{14,0,416},{14,0,420},{15,0,61},{
+15,0,74},{15,0,87},{15,0,88},{15,0,94},{15,0,96},{15,0,116},{15,0,149},{15,0,154
+},{16,0,50},{16,0,63},{16,0,73},{17,0,2},{17,0,66},{17,0,92},{17,0,103},{17,0,
+112},{17,0,120},{18,0,50},{18,0,54},{18,0,82},{18,0,86},{18,0,90},{18,0,111},{18
+,0,115},{18,0,156},{19,0,40},{19,0,79},{20,0,78},{21,0,22},{135,11,883},{5,0,161
+},{135,0,839},{4,0,782},{13,11,293},{142,11,56},{133,11,617},{139,11,50},{135,10
+,22},{145,0,64},{5,10,639},{7,10,1249},{139,10,896},{138,0,998},{135,11,2042},{4
+,11,546},{142,11,233},{6,0,1043},{134,0,1574},{134,0,1496},{4,10,102},{7,10,815}
+,{7,10,1699},{139,10,964},{12,0,781},{142,0,461},{4,11,313},{133,11,577},{6,0,
+639},{6,0,1114},{137,0,817},{8,11,184},{141,11,433},{7,0,1814},{135,11,935},{10,
+0,997},{140,0,958},{4,0,812},{137,11,625},{132,10,899},{136,10,795},{5,11,886},{
+6,11,46},{6,11,1790},{7,11,14},{7,11,732},{7,11,1654},{8,11,95},{8,11,327},{8,11
+,616},{10,11,598},{10,11,769},{11,11,134},{11,11,747},{12,11,378},{142,11,97},{
+136,0,139},{6,10,52},{9,10,104},{9,10,559},{12,10,308},{147,10,87},{133,11,1021}
+,{132,10,604},{132,10,301},{136,10,779},{7,0,643},{136,0,236},{132,11,153},{134,
+0,1172},{147,10,32},{133,11,798},{6,0,1338},{132,11,587},{6,11,598},{7,11,42},{8
+,11,695},{10,11,212},{11,11,158},{14,11,196},{145,11,85},{135,10,508},{5,11,957}
+,{5,11,1008},{135,11,249},{4,11,129},{135,11,465},{5,0,54},{7,11,470},{7,11,1057
+},{7,11,1201},{9,11,755},{11,11,906},{140,11,527},{7,11,908},{146,11,7},{5,11,
+148},{136,11,450},{144,11,1},{4,0,256},{135,0,1488},{9,0,351},{6,10,310},{7,10,
+1849},{8,10,72},{8,10,272},{8,10,431},{9,10,12},{10,10,563},{10,10,630},{10,10,
+796},{10,10,810},{11,10,367},{11,10,599},{11,10,686},{140,10,672},{6,0,1885},{6,
+0,1898},{6,0,1899},{140,0,955},{4,0,714},{133,0,469},{6,0,1270},{134,0,1456},{
+132,0,744},{6,0,313},{7,10,537},{8,10,64},{9,10,127},{10,10,496},{12,10,510},{
+141,10,384},{4,11,217},{4,10,244},{5,11,710},{7,10,233},{7,11,1926},{9,11,428},{
+9,11,708},{10,11,254},{10,11,296},{10,11,720},{11,11,109},{11,11,255},{12,11,165
+},{12,11,315},{13,11,107},{13,11,203},{14,11,54},{14,11,99},{14,11,114},{14,11,
+388},{16,11,85},{17,11,9},{17,11,33},{20,11,25},{20,11,28},{20,11,29},{21,11,9},
+{21,11,10},{21,11,34},{150,11,17},{138,0,402},{7,0,969},{146,0,55},{8,0,50},{137
+,0,624},{134,0,1355},{132,0,572},{134,10,1650},{10,10,702},{139,10,245},{10,0,
+847},{142,0,445},{6,0,43},{7,0,38},{8,0,248},{138,0,513},{133,0,369},{137,10,338
+},{133,0,766},{133,0,363},{133,10,896},{8,11,392},{11,11,54},{13,11,173},{13,11,
+294},{148,11,7},{134,0,678},{7,11,1230},{136,11,531},{6,0,258},{140,0,409},{5,0,
+249},{148,0,82},{7,10,1117},{136,10,539},{5,0,393},{6,0,378},{7,0,1981},{9,0,32}
+,{9,0,591},{10,0,685},{10,0,741},{142,0,382},{133,0,788},{134,0,1281},{134,0,
+1295},{7,0,1968},{141,0,509},{4,0,61},{5,0,58},{5,0,171},{5,0,683},{6,0,291},{6,
+0,566},{7,0,1650},{11,0,523},{12,0,273},{12,0,303},{15,0,39},{143,0,111},{6,0,
+706},{134,0,1283},{134,0,589},{135,11,1433},{133,11,435},{7,0,1059},{13,0,54},{5
+,10,4},{5,10,810},{6,10,13},{6,10,538},{6,10,1690},{6,10,1726},{7,10,1819},{8,10
+,148},{8,10,696},{8,10,791},{12,10,125},{143,10,9},{135,10,1268},{5,11,85},{6,11
+,419},{7,11,134},{7,11,305},{7,11,361},{7,11,1337},{8,11,71},{140,11,519},{137,0
+,824},{140,11,688},{5,11,691},{7,11,345},{7,10,1385},{9,11,94},{11,10,582},{11,
+10,650},{11,10,901},{11,10,949},{12,11,169},{12,10,232},{12,10,236},{13,10,413},
+{13,10,501},{146,10,116},{4,0,917},{133,0,1005},{7,0,1598},{5,11,183},{6,11,582}
+,{9,11,344},{10,11,679},{140,11,435},{4,10,925},{5,10,803},{8,10,698},{138,10,
+828},{132,0,919},{135,11,511},{139,10,992},{4,0,255},{5,0,302},{6,0,132},{7,0,
+128},{7,0,283},{7,0,1299},{10,0,52},{10,0,514},{11,0,925},{13,0,92},{142,0,309},
+{134,0,1369},{135,10,1847},{134,0,328},{7,11,1993},{136,11,684},{133,10,383},{
+137,0,173},{134,11,583},{134,0,1411},{19,0,65},{5,11,704},{8,11,357},{10,11,745}
+,{14,11,426},{17,11,94},{147,11,57},{9,10,660},{138,10,347},{4,11,179},{5,11,198
+},{133,11,697},{7,11,347},{7,11,971},{8,11,181},{138,11,711},{141,0,442},{11,0,
+842},{11,0,924},{13,0,317},{13,0,370},{13,0,469},{13,0,471},{14,0,397},{18,0,69}
+,{18,0,145},{7,10,572},{9,10,592},{11,10,680},{12,10,356},{140,10,550},{14,11,19
+},{14,11,28},{144,11,29},{136,0,534},{4,11,243},{5,11,203},{7,11,19},{7,11,71},{
+7,11,113},{10,11,405},{11,11,357},{142,11,240},{6,0,210},{10,0,845},{138,0,862},
+{7,11,1351},{9,11,581},{10,11,639},{11,11,453},{140,11,584},{7,11,1450},{139,11,
+99},{10,0,892},{12,0,719},{144,0,105},{4,0,284},{6,0,223},{134,11,492},{5,11,134
+},{6,11,408},{6,11,495},{135,11,1593},{136,0,529},{137,0,807},{4,0,218},{7,0,526
+},{143,0,137},{6,0,1444},{142,11,4},{132,11,665},{4,0,270},{5,0,192},{6,0,332},{
+7,0,1322},{4,11,248},{7,11,137},{137,11,349},{140,0,661},{7,0,1517},{11,0,597},{
+14,0,76},{14,0,335},{20,0,33},{7,10,748},{139,10,700},{5,11,371},{135,11,563},{
+146,11,57},{133,10,127},{133,0,418},{4,11,374},{7,11,547},{7,11,1700},{7,11,1833
+},{139,11,858},{6,10,198},{140,10,83},{7,11,1812},{13,11,259},{13,11,356},{14,11
+,242},{147,11,114},{7,0,379},{8,0,481},{9,0,377},{5,10,276},{6,10,55},{135,10,
+1369},{138,11,286},{5,0,1003},{6,0,149},{6,10,1752},{136,10,726},{8,0,262},{9,0,
+627},{10,0,18},{11,0,214},{11,0,404},{11,0,457},{11,0,780},{11,0,913},{13,0,401}
+,{14,0,200},{6,11,1647},{7,11,1552},{7,11,2010},{9,11,494},{137,11,509},{135,0,
+742},{136,0,304},{132,0,142},{133,10,764},{6,10,309},{7,10,331},{138,10,550},{
+135,10,1062},{6,11,123},{7,11,214},{7,10,986},{9,11,728},{10,11,157},{11,11,346}
+,{11,11,662},{143,11,106},{135,10,1573},{7,0,925},{137,0,799},{4,0,471},{5,0,51}
+,{6,0,602},{8,0,484},{138,0,195},{136,0,688},{132,0,697},{6,0,1169},{6,0,1241},{
+6,10,194},{7,10,133},{10,10,493},{10,10,570},{139,10,664},{140,0,751},{7,0,929},
+{10,0,452},{11,0,878},{16,0,33},{5,10,24},{5,10,569},{6,10,3},{6,10,119},{6,10,
+143},{6,10,440},{7,10,599},{7,10,1686},{7,10,1854},{8,10,424},{9,10,43},{9,10,
+584},{9,10,760},{10,10,328},{11,10,159},{11,10,253},{12,10,487},{140,10,531},{4,
+11,707},{13,11,106},{18,11,49},{147,11,41},{5,0,221},{5,11,588},{134,11,393},{
+134,0,1437},{6,11,211},{7,11,1690},{11,11,486},{140,11,369},{5,10,14},{5,10,892}
+,{6,10,283},{7,10,234},{136,10,537},{4,0,988},{136,0,955},{135,0,1251},{4,10,126
+},{8,10,635},{147,10,34},{4,10,316},{135,10,1561},{137,10,861},{4,10,64},{5,10,
+352},{5,10,720},{6,10,368},{139,10,359},{134,0,192},{4,0,132},{5,0,69},{135,0,
+1242},{7,10,1577},{10,10,304},{10,10,549},{12,10,365},{13,10,220},{13,10,240},{
+142,10,33},{4,0,111},{7,0,865},{134,11,219},{5,11,582},{6,11,1646},{7,11,99},{7,
+11,1962},{7,11,1986},{8,11,515},{8,11,773},{9,11,23},{9,11,491},{12,11,620},{14,
+11,52},{145,11,50},{132,0,767},{7,11,568},{148,11,21},{6,0,42},{7,0,1416},{7,0,
+2005},{8,0,131},{8,0,466},{9,0,672},{13,0,252},{20,0,103},{133,11,851},{135,0,
+1050},{6,10,175},{137,10,289},{5,10,432},{133,10,913},{6,0,44},{136,0,368},{135,
+11,784},{132,0,570},{133,0,120},{139,10,595},{140,0,29},{6,0,227},{135,0,1589},{
+4,11,98},{7,11,1365},{9,11,422},{9,11,670},{10,11,775},{11,11,210},{13,11,26},{
+13,11,457},{141,11,476},{140,10,80},{5,10,931},{134,10,1698},{133,0,522},{134,0,
+1120},{135,0,1529},{12,0,739},{14,0,448},{142,0,467},{11,10,526},{11,10,939},{
+141,10,290},{5,10,774},{6,10,1637},{6,10,1686},{134,10,1751},{6,0,1667},{135,0,
+2036},{7,10,1167},{11,10,934},{13,10,391},{145,10,76},{137,11,147},{6,10,260},{7
+,10,1484},{11,11,821},{12,11,110},{12,11,153},{18,11,41},{150,11,19},{6,0,511},{
+12,0,132},{134,10,573},{5,0,568},{6,0,138},{135,0,1293},{132,0,1020},{8,0,258},{
+9,0,208},{137,0,359},{4,0,565},{8,0,23},{136,0,827},{134,0,344},{4,0,922},{5,0,
+1023},{13,11,477},{14,11,120},{148,11,61},{134,0,240},{5,11,209},{6,11,30},{11,
+11,56},{139,11,305},{6,0,171},{7,0,1002},{7,0,1324},{9,0,415},{14,0,230},{18,0,
+68},{4,10,292},{4,10,736},{5,10,871},{6,10,1689},{7,10,1944},{137,10,580},{9,11,
+635},{139,11,559},{4,11,150},{5,11,303},{134,11,327},{6,10,63},{135,10,920},{133
+,10,793},{8,11,192},{10,11,78},{10,11,555},{11,11,308},{13,11,359},{147,11,95},{
+135,11,786},{135,11,1712},{136,0,402},{6,0,754},{6,11,1638},{7,11,79},{7,11,496}
+,{9,11,138},{10,11,336},{11,11,12},{12,11,412},{12,11,440},{142,11,305},{4,0,716
+},{141,0,31},{133,0,982},{8,0,691},{8,0,731},{5,10,67},{6,10,62},{6,10,374},{135
+,10,1391},{9,10,790},{140,10,47},{139,11,556},{151,11,1},{7,11,204},{7,11,415},{
+8,11,42},{10,11,85},{11,11,33},{11,11,564},{12,11,571},{149,11,1},{8,0,888},{7,
+11,610},{135,11,1501},{4,10,391},{135,10,1169},{5,0,847},{9,0,840},{138,0,803},{
+137,0,823},{134,0,785},{8,0,152},{9,0,53},{9,0,268},{9,0,901},{10,0,518},{10,0,
+829},{11,0,188},{13,0,74},{14,0,46},{15,0,17},{15,0,33},{17,0,40},{18,0,36},{19,
+0,20},{22,0,1},{152,0,2},{4,11,3},{5,11,247},{5,11,644},{7,11,744},{7,11,1207},{
+7,11,1225},{7,11,1909},{146,11,147},{136,0,532},{135,0,681},{132,10,271},{140,0,
+314},{140,0,677},{4,0,684},{136,0,384},{5,11,285},{9,11,67},{13,11,473},{143,11,
+82},{4,10,253},{5,10,544},{7,10,300},{137,10,340},{7,0,110},{7,0,447},{8,0,290},
+{8,0,591},{9,0,382},{9,0,649},{11,0,71},{11,0,155},{11,0,313},{12,0,5},{13,0,325
+},{142,0,287},{134,0,1818},{136,0,1007},{138,0,321},{7,0,360},{7,0,425},{9,0,66}
+,{9,0,278},{138,0,644},{133,10,818},{5,0,385},{5,10,541},{6,10,94},{6,10,499},{7
+,10,230},{139,10,321},{4,10,920},{5,10,25},{5,10,790},{6,10,457},{7,10,853},{136
+,10,788},{4,0,900},{133,0,861},{5,0,254},{7,0,985},{136,0,73},{7,0,1959},{136,0,
+683},{134,10,1765},{133,10,822},{132,10,634},{4,11,29},{6,11,532},{7,11,1628},{7
+,11,1648},{9,11,303},{9,11,350},{10,11,433},{11,11,97},{11,11,557},{11,11,745},{
+12,11,289},{12,11,335},{12,11,348},{12,11,606},{13,11,116},{13,11,233},{13,11,
+466},{14,11,181},{14,11,209},{14,11,232},{14,11,236},{14,11,300},{16,11,41},{148
+,11,97},{19,0,86},{6,10,36},{7,10,658},{136,10,454},{135,11,1692},{132,0,725},{5
+,11,501},{7,11,1704},{9,11,553},{11,11,520},{12,11,557},{141,11,249},{134,0,196}
+,{133,0,831},{136,0,723},{7,0,1897},{13,0,80},{13,0,437},{145,0,74},{4,0,992},{6
+,0,627},{136,0,994},{135,11,1294},{132,10,104},{5,0,848},{6,0,66},{136,0,764},{4
+,0,36},{7,0,1387},{10,0,205},{139,0,755},{6,0,1046},{134,0,1485},{134,0,950},{
+132,0,887},{14,0,450},{148,0,111},{7,0,620},{7,0,831},{9,10,542},{9,10,566},{138
+,10,728},{6,0,165},{138,0,388},{139,10,263},{4,0,719},{135,0,155},{138,10,468},{
+6,11,453},{144,11,36},{134,11,129},{5,0,533},{7,0,755},{138,0,780},{134,0,1465},
+{4,0,353},{6,0,146},{6,0,1789},{7,0,427},{7,0,990},{7,0,1348},{9,0,665},{9,0,898
+},{11,0,893},{142,0,212},{7,10,87},{142,10,288},{4,0,45},{135,0,1257},{12,0,7},{
+7,10,988},{7,10,1939},{9,10,64},{9,10,502},{12,10,34},{13,10,12},{13,10,234},{
+147,10,77},{4,0,607},{5,11,60},{6,11,504},{7,11,614},{7,11,1155},{140,11,0},{135
+,10,141},{8,11,198},{11,11,29},{140,11,534},{140,0,65},{136,0,816},{132,10,619},
+{139,0,88},{5,10,246},{8,10,189},{9,10,355},{9,10,512},{10,10,124},{10,10,453},{
+11,10,143},{11,10,416},{11,10,859},{141,10,341},{4,11,379},{135,11,1397},{4,0,
+600},{137,0,621},{133,0,367},{134,0,561},{6,0,559},{134,0,1691},{6,0,585},{134,
+11,585},{135,11,1228},{4,11,118},{5,10,678},{6,11,274},{6,11,361},{7,11,75},{141
+,11,441},{135,11,1818},{137,11,841},{5,0,573},{6,0,287},{7,10,862},{7,10,1886},{
+138,10,179},{132,10,517},{140,11,693},{5,11,314},{6,11,221},{7,11,419},{10,11,
+650},{11,11,396},{12,11,156},{13,11,369},{14,11,333},{145,11,47},{140,10,540},{
+136,10,667},{11,10,403},{146,10,83},{6,0,672},{133,10,761},{9,0,157},{10,10,131}
+,{140,10,72},{7,0,714},{134,11,460},{134,0,456},{133,0,925},{5,11,682},{135,11,
+1887},{136,11,510},{136,11,475},{133,11,1016},{9,0,19},{7,11,602},{8,11,179},{10
+,11,781},{140,11,126},{6,11,329},{138,11,111},{6,0,822},{134,0,1473},{144,11,86}
+,{11,0,113},{139,11,113},{5,11,821},{134,11,1687},{133,10,449},{7,0,463},{17,0,
+69},{136,10,103},{7,10,2028},{138,10,641},{6,0,193},{7,0,240},{7,0,1682},{10,0,
+51},{10,0,640},{11,0,410},{13,0,82},{14,0,247},{14,0,331},{142,0,377},{6,0,471},
+{11,0,411},{142,0,2},{5,11,71},{7,11,1407},{9,11,388},{9,11,704},{10,11,261},{10
+,11,619},{11,11,547},{11,11,619},{143,11,157},{136,0,633},{135,0,1148},{6,0,554}
+,{7,0,1392},{12,0,129},{7,10,1274},{7,10,1386},{7,11,2008},{9,11,337},{10,11,517
+},{146,10,87},{7,0,803},{8,0,542},{6,10,187},{7,10,1203},{8,10,380},{14,10,117},
+{149,10,28},{6,10,297},{7,10,793},{139,10,938},{8,0,438},{11,0,363},{7,10,464},{
+11,10,105},{12,10,231},{14,10,386},{15,10,102},{148,10,75},{5,11,16},{6,11,86},{
+6,11,603},{7,11,292},{7,11,561},{8,11,257},{8,11,382},{9,11,721},{9,11,778},{11,
+11,581},{140,11,466},{6,0,717},{4,11,486},{133,11,491},{132,0,875},{132,11,72},{
+6,11,265},{135,11,847},{4,0,237},{135,0,514},{6,0,392},{7,0,65},{135,0,2019},{
+140,11,261},{135,11,922},{137,11,404},{12,0,563},{14,0,101},{18,0,129},{7,10,
+1010},{11,10,733},{11,10,759},{13,10,34},{146,10,45},{7,10,1656},{9,10,369},{10,
+10,338},{10,10,490},{11,10,154},{11,10,545},{11,10,775},{13,10,77},{141,10,274},
+{4,0,444},{10,0,146},{140,0,9},{139,11,163},{7,0,1260},{135,0,1790},{9,0,222},{
+10,0,43},{139,0,900},{137,11,234},{138,0,971},{137,0,761},{134,0,699},{136,11,
+434},{6,0,1116},{7,0,1366},{5,10,20},{6,11,197},{6,10,298},{7,10,659},{8,11,205}
+,{137,10,219},{132,11,490},{11,11,820},{150,11,51},{7,10,1440},{11,10,854},{11,
+10,872},{11,10,921},{12,10,551},{13,10,472},{142,10,367},{140,11,13},{132,0,829}
+,{12,0,242},{132,10,439},{136,10,669},{6,0,593},{6,11,452},{7,11,312},{138,11,
+219},{4,11,333},{9,11,176},{12,11,353},{141,11,187},{7,0,36},{8,0,201},{136,0,
+605},{140,0,224},{132,10,233},{134,0,1430},{134,0,1806},{4,0,523},{133,0,638},{6
+,0,1889},{9,0,958},{9,0,971},{9,0,976},{12,0,796},{12,0,799},{12,0,808},{12,0,
+835},{12,0,836},{12,0,914},{12,0,946},{15,0,216},{15,0,232},{18,0,183},{18,0,187
+},{18,0,194},{18,0,212},{18,0,232},{149,0,49},{132,10,482},{6,0,827},{134,0,1434
+},{135,10,346},{134,0,2043},{6,0,242},{7,0,227},{7,0,1581},{8,0,104},{9,0,113},{
+9,0,220},{9,0,427},{10,0,136},{10,0,239},{11,0,579},{11,0,1023},{13,0,4},{13,0,
+204},{13,0,316},{148,0,86},{134,11,1685},{7,0,148},{8,0,284},{141,0,63},{142,0,
+10},{135,11,584},{134,0,1249},{7,0,861},{135,10,334},{5,10,795},{6,10,1741},{137
+,11,70},{132,0,807},{7,11,135},{8,11,7},{8,11,62},{9,11,243},{10,11,658},{10,11,
+697},{11,11,456},{139,11,756},{9,11,395},{138,11,79},{137,11,108},{147,0,94},{
+136,0,494},{135,11,631},{135,10,622},{7,0,1510},{135,10,1750},{4,10,203},{135,10
+,1936},{7,11,406},{7,11,459},{8,11,606},{139,11,726},{7,0,1306},{8,0,505},{9,0,
+482},{10,0,126},{11,0,225},{12,0,347},{12,0,449},{13,0,19},{14,0,218},{142,0,435
+},{5,0,268},{10,0,764},{12,0,120},{13,0,39},{145,0,127},{142,11,68},{11,10,678},
+{140,10,307},{12,11,268},{12,11,640},{142,11,119},{135,10,2044},{133,11,612},{4,
+11,372},{7,11,482},{8,11,158},{9,11,602},{9,11,615},{10,11,245},{10,11,678},{10,
+11,744},{11,11,248},{139,11,806},{7,10,311},{9,10,308},{140,10,255},{4,0,384},{
+135,0,1022},{5,11,854},{135,11,1991},{135,10,1266},{4,10,400},{5,10,267},{135,10
+,232},{135,0,1703},{9,0,159},{11,0,661},{140,0,603},{4,0,964},{14,0,438},{14,0,
+444},{14,0,456},{22,0,60},{22,0,63},{9,11,106},{9,11,163},{9,11,296},{10,11,167}
+,{10,11,172},{10,11,777},{139,11,16},{136,0,583},{132,0,515},{8,0,632},{8,0,697}
+,{137,0,854},{5,11,195},{135,11,1685},{6,0,1123},{134,0,1365},{134,11,328},{7,11
+,1997},{8,11,730},{139,11,1006},{4,0,136},{133,0,551},{134,0,1782},{7,0,1287},{9
+,0,44},{10,0,552},{10,0,642},{11,0,839},{12,0,274},{12,0,275},{12,0,372},{13,0,
+91},{142,0,125},{5,11,751},{11,11,797},{140,11,203},{133,0,732},{7,0,679},{8,0,
+313},{4,10,100},{135,11,821},{10,0,361},{142,0,316},{134,0,595},{6,0,147},{7,0,
+886},{9,0,753},{138,0,268},{5,10,362},{5,10,443},{6,10,318},{7,10,1019},{139,10,
+623},{5,10,463},{136,10,296},{4,10,454},{5,11,950},{5,11,994},{134,11,351},{138,
+0,137},{5,10,48},{5,10,404},{6,10,557},{7,10,458},{8,10,597},{10,10,455},{10,10,
+606},{11,10,49},{11,10,548},{12,10,476},{13,10,18},{141,10,450},{133,0,414},{135
+,0,1762},{5,11,421},{135,11,47},{5,10,442},{135,10,1984},{134,0,599},{134,0,1749
+},{134,0,1627},{4,0,488},{132,11,350},{137,11,751},{132,0,83},{140,0,676},{133,
+11,967},{7,0,1639},{5,10,55},{140,10,161},{4,11,473},{7,11,623},{8,11,808},{9,11
+,871},{9,11,893},{11,11,38},{11,11,431},{12,11,112},{12,11,217},{12,11,243},{12,
+11,562},{12,11,683},{13,11,141},{13,11,197},{13,11,227},{13,11,406},{13,11,487},
+{14,11,156},{14,11,203},{14,11,224},{14,11,256},{18,11,58},{150,11,0},{133,10,
+450},{7,11,736},{139,11,264},{134,0,278},{4,11,222},{7,11,286},{136,11,629},{135
+,10,869},{140,0,97},{144,0,14},{134,0,1085},{4,10,213},{7,10,223},{136,10,80},{7
+,0,388},{7,0,644},{139,0,781},{132,0,849},{7,0,229},{8,0,59},{9,0,190},{10,0,378
+},{140,0,191},{7,10,381},{7,10,806},{7,10,820},{8,10,354},{8,10,437},{8,10,787},
+{9,10,657},{10,10,58},{10,10,339},{10,10,749},{11,10,914},{12,10,162},{13,10,75}
+,{14,10,106},{14,10,198},{14,10,320},{14,10,413},{146,10,43},{141,11,306},{136,
+10,747},{134,0,1115},{16,0,94},{16,0,108},{136,11,146},{6,0,700},{6,0,817},{134,
+0,1002},{133,10,692},{4,11,465},{135,11,1663},{134,10,191},{6,0,1414},{135,11,
+913},{132,0,660},{7,0,1035},{138,0,737},{6,10,162},{7,10,1960},{136,10,831},{132
+,10,706},{7,0,690},{9,0,217},{9,0,587},{140,0,521},{138,10,426},{135,10,1235},{6
+,11,82},{7,11,138},{7,11,517},{9,11,673},{139,11,238},{138,0,272},{5,11,495},{7,
+11,834},{9,11,733},{139,11,378},{134,0,1744},{132,0,1011},{7,11,828},{142,11,116
+},{4,0,733},{9,0,194},{10,0,92},{11,0,198},{12,0,84},{13,0,128},{133,11,559},{10
+,0,57},{10,0,277},{6,11,21},{6,11,1737},{7,11,1444},{136,11,224},{4,10,204},{137
+,10,902},{136,10,833},{11,0,348},{12,0,99},{18,0,1},{18,0,11},{19,0,4},{7,10,366
+},{9,10,287},{12,10,199},{12,10,556},{140,10,577},{6,0,1981},{136,0,936},{21,0,
+33},{150,0,40},{5,11,519},{138,11,204},{5,10,356},{135,10,224},{134,0,775},{135,
+0,306},{7,10,630},{9,10,567},{11,10,150},{11,10,444},{141,10,119},{5,0,979},{134
+,10,539},{133,0,611},{4,11,402},{135,11,1679},{5,0,178},{7,11,2},{8,11,323},{136
+,11,479},{5,11,59},{135,11,672},{4,0,1010},{6,0,1969},{138,11,237},{133,11,412},
+{146,11,34},{7,11,1740},{146,11,48},{134,0,664},{139,10,814},{4,11,85},{135,11,
+549},{133,11,94},{133,11,457},{132,0,390},{134,0,1510},{4,10,235},{135,10,255},{
+4,10,194},{5,10,584},{6,11,11},{6,10,384},{7,11,187},{7,10,583},{10,10,761},{11,
+10,760},{139,10,851},{4,11,522},{139,11,802},{135,0,493},{10,11,776},{13,11,345}
+,{142,11,425},{146,0,37},{4,11,52},{135,11,661},{134,0,724},{134,0,829},{133,11,
+520},{133,10,562},{4,11,281},{5,11,38},{7,11,194},{7,11,668},{7,11,1893},{137,11
+,397},{5,10,191},{137,10,271},{7,0,1537},{14,0,96},{143,0,73},{5,0,473},{11,0,
+168},{4,10,470},{6,10,153},{7,10,1503},{7,10,1923},{10,10,701},{11,10,132},{11,
+10,227},{11,10,320},{11,10,436},{11,10,525},{11,10,855},{12,10,41},{12,10,286},{
+13,10,103},{13,10,284},{14,10,255},{14,10,262},{15,10,117},{143,10,127},{133,0,
+105},{5,0,438},{9,0,694},{12,0,627},{141,0,210},{133,10,327},{6,10,552},{7,10,
+1754},{137,10,604},{134,0,1256},{152,0,11},{5,11,448},{11,11,98},{139,11,524},{7
+,0,1626},{5,10,80},{6,10,405},{7,10,403},{7,10,1502},{8,10,456},{9,10,487},{9,10
+,853},{9,10,889},{10,10,309},{11,10,721},{11,10,994},{12,10,430},{13,10,165},{14
+,11,16},{146,11,44},{132,0,779},{8,0,25},{138,0,826},{4,10,453},{5,10,887},{6,10
+,535},{8,10,6},{8,10,543},{136,10,826},{137,11,461},{140,11,632},{132,0,308},{
+135,0,741},{132,0,671},{7,0,150},{8,0,649},{136,0,1020},{9,0,99},{6,11,336},{8,
+11,552},{9,11,285},{10,11,99},{139,11,568},{134,0,521},{5,0,339},{14,0,3},{15,0,
+41},{15,0,166},{147,0,66},{6,11,423},{7,11,665},{7,11,1210},{9,11,218},{141,11,
+222},{6,0,543},{5,10,101},{5,11,256},{6,10,88},{7,10,1677},{9,10,100},{10,10,677
+},{14,10,169},{14,10,302},{14,10,313},{15,10,48},{143,10,84},{4,10,310},{7,10,
+708},{7,10,996},{9,10,795},{10,10,390},{10,10,733},{11,10,451},{12,10,249},{14,
+10,115},{14,10,286},{143,10,100},{133,10,587},{13,11,417},{14,11,129},{143,11,15
+},{134,0,1358},{136,11,554},{132,10,498},{7,10,217},{8,10,140},{138,10,610},{135
+,11,989},{135,11,634},{6,0,155},{140,0,234},{135,11,462},{132,11,618},{134,0,
+1628},{132,0,766},{4,11,339},{5,10,905},{135,11,259},{135,0,829},{4,11,759},{141
+,11,169},{7,0,1445},{4,10,456},{7,10,358},{7,10,1637},{8,10,643},{139,10,483},{5
+,0,486},{135,0,1349},{5,11,688},{135,11,712},{7,0,1635},{8,0,17},{10,0,217},{10,
+0,295},{12,0,2},{140,11,2},{138,0,558},{150,10,56},{4,11,278},{5,11,465},{135,11
+,1367},{136,11,482},{133,10,535},{6,0,1362},{6,0,1461},{10,11,274},{10,11,625},{
+139,11,530},{5,0,599},{5,11,336},{6,11,341},{6,11,478},{6,11,1763},{136,11,386},
+{7,10,1748},{137,11,151},{134,0,1376},{133,10,539},{135,11,73},{135,11,1971},{
+139,11,283},{9,0,93},{139,0,474},{6,10,91},{135,10,435},{6,0,447},{5,11,396},{
+134,11,501},{4,10,16},{5,10,316},{5,10,842},{6,10,370},{6,10,1778},{8,10,166},{
+11,10,812},{12,10,206},{12,10,351},{14,10,418},{16,10,15},{16,10,34},{18,10,3},{
+19,10,3},{19,10,7},{20,10,4},{149,10,21},{7,0,577},{7,0,1432},{9,0,475},{9,0,505
+},{9,0,526},{9,0,609},{9,0,689},{9,0,726},{9,0,735},{9,0,738},{10,0,556},{10,0,
+674},{10,0,684},{11,0,89},{11,0,202},{11,0,272},{11,0,380},{11,0,415},{11,0,505}
+,{11,0,537},{11,0,550},{11,0,562},{11,0,640},{11,0,667},{11,0,688},{11,0,847},{
+11,0,927},{11,0,930},{11,0,940},{12,0,144},{12,0,325},{12,0,329},{12,0,389},{12,
+0,403},{12,0,451},{12,0,515},{12,0,604},{12,0,616},{12,0,626},{13,0,66},{13,0,
+131},{13,0,167},{13,0,236},{13,0,368},{13,0,411},{13,0,434},{13,0,453},{13,0,461
+},{13,0,474},{14,0,59},{14,0,60},{14,0,139},{14,0,152},{14,0,276},{14,0,353},{14
+,0,402},{15,0,28},{15,0,81},{15,0,123},{15,0,152},{18,0,136},{148,0,88},{4,11,
+929},{133,11,799},{136,11,46},{142,0,307},{4,0,609},{7,0,756},{9,0,544},{11,0,
+413},{144,0,25},{10,0,687},{7,10,619},{10,10,547},{11,10,122},{140,10,601},{4,0,
+930},{133,0,947},{133,0,939},{142,0,21},{4,11,892},{133,11,770},{133,0,962},{5,0
+,651},{8,0,170},{9,0,61},{9,0,63},{10,0,23},{10,0,37},{10,0,834},{11,0,4},{11,0,
+187},{11,0,281},{11,0,503},{11,0,677},{12,0,96},{12,0,130},{12,0,244},{14,0,5},{
+14,0,40},{14,0,162},{14,0,202},{146,0,133},{4,0,406},{5,0,579},{12,0,492},{150,0
+,15},{135,11,158},{135,0,597},{132,0,981},{132,10,888},{4,10,149},{138,10,368},{
+132,0,545},{4,10,154},{7,10,1134},{136,10,105},{135,11,2001},{134,0,1558},{4,10,
+31},{6,10,429},{7,10,962},{9,10,458},{139,10,691},{132,10,312},{135,10,1642},{6,
+0,17},{6,0,1304},{7,0,16},{7,0,1001},{9,0,886},{10,0,489},{10,0,800},{11,0,782},
+{12,0,320},{13,0,467},{14,0,145},{14,0,387},{143,0,119},{135,0,1982},{17,0,17},{
+7,11,1461},{140,11,91},{4,10,236},{132,11,602},{138,0,907},{136,0,110},{7,0,272}
+,{19,0,53},{5,10,836},{5,10,857},{134,10,1680},{5,0,458},{7,11,1218},{136,11,303
+},{7,0,1983},{8,0,0},{8,0,171},{9,0,120},{9,0,732},{10,0,473},{11,0,656},{11,0,
+998},{18,0,0},{18,0,2},{19,0,21},{10,10,68},{139,10,494},{137,11,662},{4,11,13},
+{5,11,567},{7,11,1498},{9,11,124},{11,11,521},{140,11,405},{4,10,81},{139,10,867
+},{135,11,1006},{7,11,800},{7,11,1783},{138,11,12},{9,0,295},{10,0,443},{5,10,
+282},{8,10,650},{137,10,907},{132,11,735},{4,11,170},{4,10,775},{135,11,323},{6,
+0,1844},{10,0,924},{11,11,844},{12,11,104},{140,11,625},{5,11,304},{7,11,1403},{
+140,11,498},{134,0,1232},{4,0,519},{10,0,70},{12,0,26},{14,0,17},{14,0,178},{15,
+0,34},{149,0,12},{132,0,993},{4,11,148},{133,11,742},{6,0,31},{7,0,491},{7,0,530
+},{8,0,592},{11,0,53},{11,0,779},{12,0,167},{12,0,411},{14,0,14},{14,0,136},{15,
+0,72},{16,0,17},{144,0,72},{133,0,907},{134,0,733},{133,11,111},{4,10,71},{5,10,
+376},{7,10,119},{138,10,665},{136,0,55},{8,0,430},{136,11,430},{4,0,208},{5,0,
+106},{6,0,531},{8,0,408},{9,0,188},{138,0,572},{12,0,56},{11,10,827},{14,10,34},
+{143,10,148},{134,0,1693},{133,11,444},{132,10,479},{140,0,441},{9,0,449},{10,0,
+192},{138,0,740},{134,0,928},{4,0,241},{7,10,607},{136,10,99},{8,11,123},{15,11,
+6},{144,11,7},{6,11,285},{8,11,654},{11,11,749},{12,11,190},{12,11,327},{13,11,
+120},{13,11,121},{13,11,327},{15,11,47},{146,11,40},{4,10,41},{5,10,74},{7,10,
+1627},{11,10,871},{140,10,619},{7,0,1525},{11,10,329},{11,10,965},{12,10,241},{
+14,10,354},{15,10,22},{148,10,63},{132,0,259},{135,11,183},{9,10,209},{137,10,
+300},{5,11,937},{135,11,100},{133,10,98},{4,0,173},{5,0,312},{5,0,512},{135,0,
+1285},{141,0,185},{7,0,1603},{7,0,1691},{9,0,464},{11,0,195},{12,0,279},{12,0,
+448},{14,0,11},{147,0,102},{135,0,1113},{133,10,984},{4,0,452},{5,0,583},{135,0,
+720},{4,0,547},{5,0,817},{6,0,433},{7,0,593},{7,0,1378},{8,0,161},{9,0,284},{10,
+0,313},{139,0,886},{8,0,722},{4,10,182},{6,10,205},{135,10,220},{150,0,13},{4,10
+,42},{9,10,205},{9,10,786},{138,10,659},{6,0,289},{7,0,1670},{12,0,57},{151,0,4}
+,{132,10,635},{14,0,43},{146,0,21},{139,10,533},{135,0,1694},{8,0,420},{139,0,
+193},{135,0,409},{132,10,371},{4,10,272},{135,10,836},{5,10,825},{134,10,1640},{
+5,11,251},{5,11,956},{8,11,268},{9,11,214},{146,11,142},{138,0,308},{6,0,1863},{
+141,11,37},{137,10,879},{7,10,317},{135,10,569},{132,11,294},{134,0,790},{5,0,
+1002},{136,0,745},{5,11,346},{5,11,711},{136,11,390},{135,0,289},{5,0,504},{11,0
+,68},{137,10,307},{4,0,239},{6,0,477},{7,0,1607},{139,0,617},{149,0,13},{133,0,
+609},{133,11,624},{5,11,783},{7,11,1998},{135,11,2047},{133,10,525},{132,0,367},
+{132,11,594},{6,0,528},{133,10,493},{4,10,174},{135,10,911},{8,10,417},{137,10,
+782},{132,0,694},{7,0,548},{137,0,58},{4,10,32},{5,10,215},{6,10,269},{7,10,1782
+},{7,10,1892},{10,10,16},{11,10,822},{11,10,954},{141,10,481},{140,0,687},{7,0,
+1749},{136,10,477},{132,11,569},{133,10,308},{135,10,1088},{4,0,661},{138,0,1004
+},{5,11,37},{6,11,39},{6,11,451},{7,11,218},{7,11,667},{7,11,1166},{7,11,1687},{
+8,11,662},{144,11,2},{9,0,445},{12,0,53},{13,0,492},{5,10,126},{8,10,297},{9,10,
+366},{140,10,374},{7,10,1551},{139,10,361},{148,0,74},{134,11,508},{135,0,213},{
+132,10,175},{132,10,685},{6,0,760},{6,0,834},{134,0,1248},{7,11,453},{7,11,635},
+{7,11,796},{8,11,331},{9,11,328},{9,11,330},{9,11,865},{10,11,119},{10,11,235},{
+11,11,111},{11,11,129},{11,11,240},{12,11,31},{12,11,66},{12,11,222},{12,11,269}
+,{12,11,599},{12,11,689},{13,11,186},{13,11,364},{142,11,345},{7,0,1672},{139,0,
+189},{133,10,797},{133,10,565},{6,0,1548},{6,11,98},{7,11,585},{135,11,702},{9,0
+,968},{15,0,192},{149,0,56},{4,10,252},{6,11,37},{7,11,299},{7,10,1068},{7,11,
+1666},{8,11,195},{8,11,316},{9,11,178},{9,11,276},{9,11,339},{9,11,536},{10,11,
+102},{10,11,362},{10,10,434},{10,11,785},{11,11,55},{11,11,149},{11,10,228},{11,
+10,426},{11,11,773},{13,10,231},{13,11,416},{13,11,419},{14,11,38},{14,11,41},{
+14,11,210},{18,10,106},{148,10,87},{4,0,751},{11,0,390},{140,0,32},{4,0,409},{
+133,0,78},{11,11,458},{12,11,15},{140,11,432},{7,0,1602},{10,0,257},{10,0,698},{
+11,0,544},{11,0,585},{12,0,212},{13,0,307},{5,10,231},{7,10,601},{9,10,277},{9,
+10,674},{10,10,178},{10,10,418},{10,10,509},{11,10,531},{12,10,113},{12,10,475},
+{13,10,99},{142,10,428},{6,0,473},{145,0,105},{6,0,1949},{15,0,156},{133,11,645}
+,{7,10,1591},{144,10,43},{135,0,1779},{135,10,1683},{4,11,290},{135,11,1356},{
+134,0,763},{6,11,70},{7,11,1292},{10,11,762},{139,11,288},{142,0,29},{140,11,428
+},{7,0,883},{7,11,131},{7,11,422},{8,11,210},{140,11,573},{134,0,488},{4,10,399}
+,{5,10,119},{5,10,494},{7,10,751},{137,10,556},{133,0,617},{132,11,936},{139,0,
+50},{7,0,1518},{139,0,694},{137,0,785},{4,0,546},{135,0,2042},{7,11,716},{13,11,
+97},{141,11,251},{132,11,653},{145,0,22},{134,0,1016},{4,0,313},{133,0,577},{136
+,11,657},{8,0,184},{141,0,433},{135,0,935},{6,0,720},{9,0,114},{146,11,80},{12,0
+,186},{12,0,292},{14,0,100},{18,0,70},{7,10,594},{7,10,851},{7,10,1858},{9,10,
+411},{9,10,574},{9,10,666},{9,10,737},{10,10,346},{10,10,712},{11,10,246},{11,10
+,432},{11,10,517},{11,10,647},{11,10,679},{11,10,727},{12,10,304},{12,10,305},{
+12,10,323},{12,10,483},{12,10,572},{12,10,593},{12,10,602},{13,10,95},{13,10,101
+},{13,10,171},{13,10,315},{13,10,378},{13,10,425},{13,10,475},{14,10,63},{14,10,
+380},{14,10,384},{15,10,133},{18,10,112},{148,10,72},{135,10,1093},{135,11,1836}
+,{132,10,679},{137,10,203},{11,0,402},{12,0,109},{12,0,431},{13,0,179},{13,0,206
+},{14,0,217},{16,0,3},{148,0,53},{7,11,1368},{8,11,232},{8,11,361},{10,11,682},{
+138,11,742},{137,10,714},{5,0,886},{6,0,46},{6,0,1790},{7,0,14},{7,0,732},{7,0,
+1654},{8,0,95},{8,0,327},{8,0,616},{9,0,892},{10,0,598},{10,0,769},{11,0,134},{
+11,0,747},{12,0,378},{14,0,97},{137,11,534},{4,0,969},{136,10,825},{137,11,27},{
+6,0,727},{142,11,12},{133,0,1021},{134,0,1190},{134,11,1657},{5,10,143},{5,10,
+769},{6,10,1760},{7,10,682},{7,10,1992},{136,10,736},{132,0,153},{135,11,127},{
+133,0,798},{132,0,587},{6,0,598},{7,0,42},{8,0,695},{10,0,212},{11,0,158},{14,0,
+196},{145,0,85},{133,10,860},{6,0,1929},{134,0,1933},{5,0,957},{5,0,1008},{9,0,
+577},{12,0,141},{6,10,422},{7,10,0},{7,10,1544},{8,11,364},{11,10,990},{12,10,
+453},{13,10,47},{141,10,266},{134,0,1319},{4,0,129},{135,0,465},{7,0,470},{7,0,
+1057},{7,0,1201},{9,0,755},{11,0,906},{140,0,527},{7,0,908},{146,0,7},{5,0,148},
+{136,0,450},{5,10,515},{137,10,131},{7,10,1605},{11,10,962},{146,10,139},{132,10
+,646},{134,0,1166},{4,10,396},{7,10,728},{9,10,117},{13,10,202},{148,10,51},{6,
+10,121},{6,10,124},{6,10,357},{7,10,1138},{7,10,1295},{8,10,162},{139,10,655},{
+14,0,374},{142,11,374},{138,0,253},{139,0,1003},{5,11,909},{9,11,849},{138,11,
+805},{133,10,237},{7,11,525},{7,11,1579},{8,11,497},{136,11,573},{137,0,46},{132
+,0,879},{134,0,806},{135,0,1868},{6,0,1837},{134,0,1846},{6,0,730},{134,0,881},{
+7,0,965},{7,0,1460},{7,0,1604},{7,11,193},{7,11,397},{7,11,1105},{8,11,124},{8,
+11,619},{9,11,305},{10,11,264},{11,11,40},{12,11,349},{13,11,134},{13,11,295},{
+14,11,155},{15,11,120},{146,11,105},{136,0,506},{143,0,10},{4,11,262},{7,11,342}
+,{7,10,571},{7,10,1877},{10,10,366},{141,11,23},{133,11,641},{10,0,22},{9,10,513
+},{10,10,39},{12,10,122},{140,10,187},{135,11,1431},{150,11,49},{4,11,99},{6,11,
+250},{6,11,346},{8,11,127},{138,11,81},{6,0,2014},{8,0,928},{10,0,960},{10,0,979
+},{140,0,996},{134,0,296},{132,11,915},{5,11,75},{9,11,517},{10,11,470},{12,11,
+155},{141,11,224},{137,10,873},{4,0,854},{140,11,18},{134,0,587},{7,10,107},{7,
+10,838},{8,10,550},{138,10,401},{11,0,636},{15,0,145},{17,0,34},{19,0,50},{23,0,
+20},{11,10,588},{11,10,864},{11,10,968},{143,10,160},{135,11,216},{7,0,982},{10,
+0,32},{143,0,56},{133,10,768},{133,11,954},{6,11,304},{7,11,1114},{8,11,418},{10
+,11,345},{11,11,341},{11,11,675},{141,11,40},{9,11,410},{139,11,425},{136,0,941}
+,{5,0,435},{132,10,894},{5,0,85},{6,0,419},{7,0,134},{7,0,305},{7,0,361},{7,0,
+1337},{8,0,71},{140,0,519},{140,0,688},{135,0,740},{5,0,691},{7,0,345},{9,0,94},
+{140,0,169},{5,0,183},{6,0,582},{10,0,679},{140,0,435},{134,11,14},{6,0,945},{
+135,0,511},{134,11,1708},{5,11,113},{6,11,243},{7,11,1865},{11,11,161},{16,11,37
+},{145,11,99},{132,11,274},{137,0,539},{7,0,1993},{8,0,684},{134,10,272},{6,0,
+659},{134,0,982},{4,10,9},{5,10,128},{7,10,368},{11,10,480},{148,10,3},{134,0,
+583},{132,0,803},{133,0,704},{4,0,179},{5,0,198},{133,0,697},{7,0,347},{7,0,971}
+,{8,0,181},{10,0,711},{135,11,166},{136,10,682},{4,10,2},{7,10,545},{7,10,894},{
+136,11,521},{135,0,481},{132,0,243},{5,0,203},{7,0,19},{7,0,71},{7,0,113},{10,0,
+405},{11,0,357},{142,0,240},{5,11,725},{5,11,727},{135,11,1811},{6,0,826},{137,
+11,304},{7,0,1450},{139,0,99},{133,11,654},{134,0,492},{5,0,134},{6,0,408},{6,0,
+495},{7,0,1593},{6,11,273},{10,11,188},{13,11,377},{146,11,77},{9,10,769},{140,
+10,185},{135,11,410},{142,0,4},{4,0,665},{134,11,1785},{4,0,248},{7,0,137},{137,
+0,349},{5,10,530},{142,10,113},{7,0,1270},{139,0,612},{132,11,780},{5,0,371},{
+135,0,563},{135,0,826},{6,0,1535},{23,0,21},{151,0,23},{4,0,374},{7,0,547},{7,0,
+1700},{7,0,1833},{139,0,858},{133,10,556},{7,11,612},{8,11,545},{8,11,568},{8,11
+,642},{9,11,717},{10,11,541},{10,11,763},{11,11,449},{12,11,489},{13,11,153},{13
+,11,296},{14,11,138},{14,11,392},{15,11,50},{16,11,6},{16,11,12},{148,11,9},{9,0
+,311},{141,0,42},{8,10,16},{140,10,568},{6,0,1968},{6,0,2027},{138,0,991},{6,0,
+1647},{7,0,1552},{7,0,2010},{9,0,494},{137,0,509},{133,11,948},{6,10,186},{137,
+10,426},{134,0,769},{134,0,642},{132,10,585},{6,0,123},{7,0,214},{9,0,728},{10,0
+,157},{11,0,346},{11,0,662},{143,0,106},{142,11,381},{135,0,1435},{4,11,532},{5,
+11,706},{135,11,662},{5,11,837},{134,11,1651},{4,10,93},{5,10,252},{6,10,229},{7
+,10,291},{9,10,550},{139,10,644},{148,0,79},{137,10,749},{134,0,1425},{137,10,
+162},{4,11,362},{7,11,52},{7,11,303},{140,11,166},{132,10,381},{4,11,330},{7,11,
+933},{7,11,2012},{136,11,292},{135,11,767},{4,0,707},{5,0,588},{6,0,393},{13,0,
+106},{18,0,49},{147,0,41},{6,0,211},{7,0,1690},{11,0,486},{140,0,369},{137,11,
+883},{4,11,703},{135,11,207},{4,0,187},{5,0,184},{5,0,690},{7,0,1869},{10,0,756}
+,{139,0,783},{132,11,571},{134,0,1382},{5,0,175},{6,10,77},{6,10,157},{7,10,974}
+,{7,10,1301},{7,10,1339},{7,10,1490},{7,10,1873},{137,10,628},{134,0,1493},{5,11
+,873},{133,11,960},{134,0,1007},{12,11,93},{12,11,501},{13,11,362},{14,11,151},{
+15,11,40},{15,11,59},{16,11,46},{17,11,25},{18,11,14},{18,11,134},{19,11,25},{19
+,11,69},{20,11,16},{20,11,19},{20,11,66},{21,11,23},{21,11,25},{150,11,42},{11,
+10,919},{141,10,409},{134,0,219},{5,0,582},{6,0,1646},{7,0,99},{7,0,1962},{7,0,
+1986},{8,0,515},{8,0,773},{9,0,23},{9,0,491},{12,0,620},{142,0,93},{133,0,851},{
+5,11,33},{134,11,470},{135,11,1291},{134,0,1278},{135,11,1882},{135,10,1489},{
+132,0,1000},{138,0,982},{8,0,762},{8,0,812},{137,0,910},{6,11,47},{7,11,90},{7,
+11,664},{7,11,830},{7,11,1380},{7,11,2025},{8,11,448},{136,11,828},{4,0,98},{4,0
+,940},{6,0,1819},{6,0,1834},{6,0,1841},{7,0,1365},{8,0,859},{8,0,897},{8,0,918},
+{9,0,422},{9,0,670},{10,0,775},{10,0,894},{10,0,909},{10,0,910},{10,0,935},{11,0
+,210},{12,0,750},{12,0,755},{13,0,26},{13,0,457},{13,0,476},{16,0,100},{16,0,109
+},{18,0,173},{18,0,175},{8,10,398},{9,10,681},{139,10,632},{9,11,417},{137,11,
+493},{136,10,645},{138,0,906},{134,0,1730},{134,10,20},{133,11,1019},{134,0,1185
+},{10,0,40},{136,10,769},{9,0,147},{134,11,208},{140,0,650},{5,0,209},{6,0,30},{
+11,0,56},{139,0,305},{132,0,553},{138,11,344},{6,11,68},{7,11,398},{7,11,448},{7
+,11,1629},{7,11,1813},{8,11,387},{8,11,442},{9,11,710},{10,11,282},{138,11,722},
+{5,0,597},{14,0,20},{142,11,20},{135,0,1614},{135,10,1757},{4,0,150},{5,0,303},{
+6,0,327},{135,10,937},{16,0,49},{7,10,1652},{144,11,49},{8,0,192},{10,0,78},{141
+,0,359},{135,0,786},{143,0,134},{6,0,1638},{7,0,79},{7,0,496},{9,0,138},{10,0,
+336},{11,0,12},{12,0,412},{12,0,440},{142,0,305},{136,11,491},{4,10,579},{5,10,
+226},{5,10,323},{135,10,960},{7,0,204},{7,0,415},{8,0,42},{10,0,85},{139,0,564},
+{132,0,614},{4,11,403},{5,11,441},{7,11,450},{11,11,101},{12,11,193},{141,11,430
+},{135,11,1927},{135,11,1330},{4,0,3},{5,0,247},{5,0,644},{7,0,744},{7,0,1207},{
+7,0,1225},{7,0,1909},{146,0,147},{136,0,942},{4,0,1019},{134,0,2023},{5,11,679},
+{133,10,973},{5,0,285},{9,0,67},{13,0,473},{143,0,82},{7,11,328},{137,11,326},{
+151,0,8},{6,10,135},{135,10,1176},{135,11,1128},{134,0,1309},{135,11,1796},{135,
+10,314},{4,11,574},{7,11,350},{7,11,1024},{8,11,338},{9,11,677},{10,11,808},{139
+,11,508},{7,11,818},{17,11,14},{17,11,45},{18,11,75},{148,11,18},{146,10,4},{135
+,11,1081},{4,0,29},{6,0,532},{7,0,1628},{7,0,1648},{9,0,350},{10,0,433},{11,0,97
+},{11,0,557},{11,0,745},{12,0,289},{12,0,335},{12,0,348},{12,0,606},{13,0,116},{
+13,0,233},{13,0,466},{14,0,181},{14,0,209},{14,0,232},{14,0,236},{14,0,300},{16,
+0,41},{148,0,97},{7,0,318},{6,10,281},{8,10,282},{8,10,480},{8,10,499},{9,10,198
+},{10,10,143},{10,10,169},{10,10,211},{10,10,417},{10,10,574},{11,10,147},{11,10
+,395},{12,10,75},{12,10,407},{12,10,608},{13,10,500},{142,10,251},{135,11,1676},
+{135,11,2037},{135,0,1692},{5,0,501},{7,0,1704},{9,0,553},{11,0,520},{12,0,557},
+{141,0,249},{6,0,1527},{14,0,324},{15,0,55},{15,0,80},{14,11,324},{15,11,55},{
+143,11,80},{135,10,1776},{8,0,988},{137,11,297},{132,10,419},{142,0,223},{139,11
+,234},{7,0,1123},{12,0,508},{14,0,102},{14,0,226},{144,0,57},{4,10,138},{7,10,
+1012},{7,10,1280},{137,10,76},{7,0,1764},{5,10,29},{140,10,638},{134,0,2015},{
+134,0,1599},{138,11,56},{6,11,306},{7,11,1140},{7,11,1340},{8,11,133},{138,11,
+449},{139,11,1011},{6,10,1710},{135,10,2038},{7,11,1763},{140,11,310},{6,0,129},
+{4,10,17},{5,10,23},{7,10,995},{11,10,383},{11,10,437},{12,10,460},{140,10,532},
+{5,11,329},{136,11,260},{133,10,862},{132,0,534},{6,0,811},{135,0,626},{132,11,
+657},{4,0,25},{5,0,60},{6,0,504},{7,0,614},{7,0,1155},{12,0,0},{152,11,7},{7,0,
+1248},{11,0,621},{139,0,702},{137,0,321},{8,10,70},{12,10,171},{141,10,272},{10,
+10,233},{139,10,76},{4,0,379},{7,0,1397},{134,10,442},{5,11,66},{7,11,1896},{136
+,11,288},{134,11,1643},{134,10,1709},{4,11,21},{5,11,91},{5,11,570},{5,11,648},{
+5,11,750},{5,11,781},{6,11,54},{6,11,112},{6,11,402},{6,11,1732},{7,11,315},{7,
+11,749},{7,11,1347},{7,11,1900},{9,11,78},{9,11,508},{10,11,611},{11,11,510},{11
+,11,728},{13,11,36},{14,11,39},{16,11,83},{17,11,124},{148,11,30},{4,0,118},{6,0
+,274},{6,0,361},{7,0,75},{141,0,441},{10,11,322},{10,11,719},{139,11,407},{147,
+10,119},{12,11,549},{14,11,67},{147,11,60},{11,10,69},{12,10,105},{12,10,117},{
+13,10,213},{14,10,13},{14,10,62},{14,10,177},{14,10,421},{15,10,19},{146,10,141}
+,{9,0,841},{137,10,309},{7,10,608},{7,10,976},{8,11,125},{8,11,369},{8,11,524},{
+9,10,146},{10,10,206},{10,11,486},{10,10,596},{11,11,13},{11,11,381},{11,11,736}
+,{11,11,766},{11,11,845},{13,11,114},{13,10,218},{13,11,292},{14,11,47},{142,10,
+153},{12,0,693},{135,11,759},{5,0,314},{6,0,221},{7,0,419},{10,0,650},{11,0,396}
+,{12,0,156},{13,0,369},{14,0,333},{145,0,47},{6,11,1684},{6,11,1731},{7,11,356},
+{7,11,1932},{8,11,54},{8,11,221},{9,11,225},{9,11,356},{10,11,77},{10,11,446},{
+10,11,731},{12,11,404},{141,11,491},{132,11,375},{4,10,518},{135,10,1136},{4,0,
+913},{4,11,411},{11,11,643},{140,11,115},{4,11,80},{133,11,44},{8,10,689},{137,
+10,863},{138,0,880},{4,10,18},{7,10,145},{7,10,444},{7,10,1278},{8,10,49},{8,10,
+400},{9,10,71},{9,10,250},{10,10,459},{12,10,160},{144,10,24},{136,0,475},{5,0,
+1016},{5,11,299},{135,11,1083},{7,0,602},{8,0,179},{10,0,781},{140,0,126},{6,0,
+329},{138,0,111},{135,0,1864},{4,11,219},{7,11,1761},{137,11,86},{6,0,1888},{6,0
+,1892},{6,0,1901},{6,0,1904},{9,0,953},{9,0,985},{9,0,991},{9,0,1001},{12,0,818}
+,{12,0,846},{12,0,847},{12,0,861},{12,0,862},{12,0,873},{12,0,875},{12,0,877},{
+12,0,879},{12,0,881},{12,0,884},{12,0,903},{12,0,915},{12,0,926},{12,0,939},{15,
+0,182},{15,0,219},{15,0,255},{18,0,191},{18,0,209},{18,0,211},{149,0,41},{5,11,
+328},{135,11,918},{137,0,780},{12,0,82},{143,0,36},{133,10,1010},{5,0,821},{134,
+0,1687},{133,11,514},{132,0,956},{134,0,1180},{10,0,112},{5,10,87},{7,10,313},{7
+,10,1103},{10,10,582},{11,10,389},{11,10,813},{12,10,385},{13,10,286},{14,10,124
+},{146,10,108},{5,0,71},{7,0,1407},{9,0,704},{10,0,261},{10,0,619},{11,0,547},{
+11,0,619},{143,0,157},{4,0,531},{5,0,455},{5,11,301},{6,11,571},{14,11,49},{146,
+11,102},{132,10,267},{6,0,385},{7,0,2008},{9,0,337},{138,0,517},{133,11,726},{
+133,11,364},{4,11,76},{7,11,1550},{9,11,306},{9,11,430},{9,11,663},{10,11,683},{
+11,11,427},{11,11,753},{12,11,334},{12,11,442},{14,11,258},{14,11,366},{143,11,
+131},{6,0,1865},{6,0,1879},{6,0,1881},{6,0,1894},{6,0,1908},{9,0,915},{9,0,926},
+{9,0,940},{9,0,943},{9,0,966},{9,0,980},{9,0,989},{9,0,1005},{9,0,1010},{12,0,
+813},{12,0,817},{12,0,840},{12,0,843},{12,0,855},{12,0,864},{12,0,871},{12,0,872
+},{12,0,899},{12,0,905},{12,0,924},{15,0,171},{15,0,181},{15,0,224},{15,0,235},{
+15,0,251},{146,0,184},{137,11,52},{5,0,16},{6,0,86},{6,0,603},{7,0,292},{7,0,561
+},{8,0,257},{8,0,382},{9,0,721},{9,0,778},{11,0,581},{140,0,466},{4,0,486},{5,0,
+491},{135,10,1121},{4,0,72},{6,0,265},{135,0,1300},{135,11,1183},{10,10,249},{
+139,10,209},{132,10,561},{137,11,519},{4,11,656},{4,10,760},{135,11,779},{9,10,
+154},{140,10,485},{135,11,1793},{135,11,144},{136,10,255},{133,0,621},{4,10,368}
+,{135,10,641},{135,11,1373},{7,11,554},{7,11,605},{141,11,10},{137,0,234},{5,0,
+815},{6,0,1688},{134,0,1755},{5,11,838},{5,11,841},{134,11,1649},{7,0,1987},{7,0
+,2040},{136,0,743},{133,11,1012},{6,0,197},{136,0,205},{6,0,314},{134,11,314},{
+144,11,53},{6,11,251},{7,11,365},{7,11,1357},{7,11,1497},{8,11,154},{141,11,281}
+,{133,11,340},{6,0,452},{7,0,312},{138,0,219},{138,0,589},{4,0,333},{9,0,176},{
+12,0,353},{141,0,187},{9,10,92},{147,10,91},{134,0,1110},{11,0,47},{139,11,495},
+{6,10,525},{8,10,806},{9,10,876},{140,10,284},{8,11,261},{9,11,144},{9,11,466},{
+10,11,370},{12,11,470},{13,11,144},{142,11,348},{137,11,897},{8,0,863},{8,0,864}
+,{8,0,868},{8,0,884},{10,0,866},{10,0,868},{10,0,873},{10,0,911},{10,0,912},{10,
+0,944},{12,0,727},{6,11,248},{9,11,546},{10,11,535},{11,11,681},{141,11,135},{6,
+0,300},{135,0,1515},{134,0,1237},{139,10,958},{133,10,594},{140,11,250},{134,0,
+1685},{134,11,567},{7,0,135},{8,0,7},{8,0,62},{9,0,243},{10,0,658},{10,0,697},{
+11,0,456},{139,0,756},{9,0,395},{138,0,79},{6,10,1641},{136,10,820},{4,10,302},{
+135,10,1766},{134,11,174},{135,10,1313},{135,0,631},{134,10,1674},{134,11,395},{
+138,0,835},{7,0,406},{7,0,459},{8,0,606},{139,0,726},{134,11,617},{134,0,979},{6
+,10,389},{7,10,149},{9,10,142},{138,10,94},{5,11,878},{133,11,972},{6,10,8},{7,
+10,1881},{8,10,91},{136,11,511},{133,0,612},{132,11,351},{4,0,372},{7,0,482},{8,
+0,158},{9,0,602},{9,0,615},{10,0,245},{10,0,678},{10,0,744},{11,0,248},{139,0,
+806},{5,0,854},{135,0,1991},{132,11,286},{135,11,344},{7,11,438},{7,11,627},{7,
+11,1516},{8,11,40},{9,11,56},{9,11,294},{10,11,30},{10,11,259},{11,11,969},{146,
+11,148},{135,0,1492},{5,11,259},{7,11,414},{7,11,854},{142,11,107},{135,10,1746}
+,{6,0,833},{134,0,998},{135,10,24},{6,0,750},{135,0,1739},{4,10,503},{135,10,
+1661},{5,10,130},{7,10,1314},{9,10,610},{10,10,718},{11,10,601},{11,10,819},{11,
+10,946},{140,10,536},{10,10,149},{11,10,280},{142,10,336},{132,11,738},{135,10,
+1946},{5,0,195},{135,0,1685},{7,0,1997},{8,0,730},{139,0,1006},{151,11,17},{133,
+11,866},{14,0,463},{14,0,470},{150,0,61},{5,0,751},{8,0,266},{11,0,578},{4,10,
+392},{135,10,1597},{5,10,433},{9,10,633},{139,10,629},{135,0,821},{6,0,715},{134
+,0,1325},{133,11,116},{6,0,868},{132,11,457},{134,0,959},{6,10,234},{138,11,199}
+,{7,0,1053},{7,10,1950},{8,10,680},{11,10,817},{147,10,88},{7,10,1222},{138,10,
+386},{5,0,950},{5,0,994},{6,0,351},{134,0,1124},{134,0,1081},{7,0,1595},{6,10,5}
+,{11,10,249},{12,10,313},{16,10,66},{145,10,26},{148,0,59},{5,11,527},{6,11,189}
+,{135,11,859},{5,10,963},{6,10,1773},{11,11,104},{11,11,554},{15,11,60},{143,11,
+125},{135,0,47},{137,0,684},{134,11,116},{134,0,1606},{134,0,777},{7,0,1020},{8,
+10,509},{136,10,792},{135,0,1094},{132,0,350},{133,11,487},{4,11,86},{5,11,667},
+{5,11,753},{6,11,316},{6,11,455},{135,11,946},{7,0,1812},{13,0,259},{13,0,356},{
+14,0,242},{147,0,114},{132,10,931},{133,0,967},{4,0,473},{7,0,623},{8,0,808},{9,
+0,871},{9,0,893},{11,0,38},{11,0,431},{12,0,112},{12,0,217},{12,0,243},{12,0,562
+},{12,0,663},{12,0,683},{13,0,141},{13,0,197},{13,0,227},{13,0,406},{13,0,487},{
+14,0,156},{14,0,203},{14,0,224},{14,0,256},{18,0,58},{150,0,0},{138,0,286},{7,10
+,943},{139,10,614},{135,10,1837},{150,11,45},{132,0,798},{4,0,222},{7,0,286},{
+136,0,629},{4,11,79},{7,11,1773},{10,11,450},{11,11,589},{13,11,332},{13,11,493}
+,{14,11,183},{14,11,334},{14,11,362},{14,11,368},{14,11,376},{14,11,379},{19,11,
+90},{19,11,103},{19,11,127},{148,11,90},{5,0,337},{11,0,513},{11,0,889},{11,0,
+961},{12,0,461},{13,0,79},{15,0,121},{4,10,90},{5,10,545},{7,10,754},{9,10,186},
+{10,10,72},{10,10,782},{11,10,577},{11,10,610},{12,10,354},{12,10,362},{140,10,
+595},{141,0,306},{136,0,146},{7,0,1646},{9,10,329},{11,10,254},{141,11,124},{4,0
+,465},{135,0,1663},{132,0,525},{133,11,663},{10,0,299},{18,0,74},{9,10,187},{11,
+10,1016},{145,10,44},{7,0,165},{7,0,919},{4,10,506},{136,10,517},{5,10,295},{135
+,10,1680},{133,11,846},{134,0,1064},{5,11,378},{7,11,1402},{7,11,1414},{8,11,465
+},{9,11,286},{10,11,185},{10,11,562},{10,11,635},{11,11,31},{11,11,393},{12,11,
+456},{13,11,312},{18,11,65},{18,11,96},{147,11,89},{132,0,596},{7,10,987},{9,10,
+688},{10,10,522},{11,10,788},{140,10,566},{6,0,82},{7,0,138},{7,0,517},{7,0,1741
+},{11,0,238},{4,11,648},{134,10,1775},{7,0,1233},{7,10,700},{7,10,940},{8,10,514
+},{9,10,116},{9,10,535},{10,10,118},{11,10,107},{11,10,148},{11,10,922},{12,10,
+254},{12,10,421},{142,10,238},{4,0,962},{6,0,1824},{8,0,894},{12,0,708},{12,0,
+725},{14,0,451},{20,0,94},{22,0,59},{150,0,62},{5,11,945},{6,11,1656},{6,11,1787
+},{7,11,167},{8,11,824},{9,11,391},{10,11,375},{139,11,185},{5,0,495},{7,0,834},
+{9,0,733},{139,0,378},{4,10,743},{135,11,1273},{6,0,1204},{7,11,1645},{8,11,352}
+,{137,11,249},{139,10,292},{133,0,559},{132,11,152},{9,0,499},{10,0,341},{15,0,
+144},{19,0,49},{7,10,1283},{9,10,227},{11,10,325},{11,10,408},{14,10,180},{146,
+10,47},{6,0,21},{6,0,1737},{7,0,1444},{136,0,224},{133,11,1006},{7,0,1446},{9,0,
+97},{17,0,15},{5,10,81},{7,10,146},{7,10,1342},{8,10,53},{8,10,561},{8,10,694},{
+8,10,754},{9,10,115},{9,10,894},{10,10,462},{10,10,813},{11,10,230},{11,10,657},
+{11,10,699},{11,10,748},{12,10,119},{12,10,200},{12,10,283},{142,10,273},{5,10,
+408},{137,10,747},{135,11,431},{135,11,832},{6,0,729},{134,0,953},{4,0,727},{8,0
+,565},{5,11,351},{7,11,264},{136,11,565},{134,0,1948},{5,0,519},{5,11,40},{7,11,
+598},{7,11,1638},{8,11,78},{9,11,166},{9,11,640},{9,11,685},{9,11,773},{11,11,
+215},{13,11,65},{14,11,172},{14,11,317},{145,11,6},{8,11,60},{9,11,343},{139,11,
+769},{137,11,455},{134,0,1193},{140,0,790},{7,11,1951},{8,11,765},{8,11,772},{
+140,11,671},{7,11,108},{8,11,219},{8,11,388},{9,11,639},{9,11,775},{11,11,275},{
+140,11,464},{132,11,468},{7,10,30},{8,10,86},{8,10,315},{8,10,700},{9,10,576},{9
+,10,858},{11,10,310},{11,10,888},{11,10,904},{12,10,361},{141,10,248},{5,11,15},
+{6,11,56},{7,11,1758},{8,11,500},{9,11,730},{11,11,331},{13,11,150},{142,11,282}
+,{4,0,402},{7,0,2},{8,0,323},{136,0,479},{138,10,839},{11,0,580},{142,0,201},{5,
+0,59},{135,0,672},{137,10,617},{146,0,34},{134,11,1886},{4,0,961},{136,0,896},{6
+,0,1285},{5,11,205},{6,11,438},{137,11,711},{134,10,428},{7,10,524},{8,10,169},{
+8,10,234},{9,10,480},{138,10,646},{148,0,46},{141,0,479},{133,11,534},{6,0,2019}
+,{134,10,1648},{4,0,85},{7,0,549},{7,10,1205},{138,10,637},{4,0,663},{5,0,94},{7
+,11,235},{7,11,1475},{15,11,68},{146,11,120},{6,11,443},{9,11,237},{9,11,571},{9
+,11,695},{10,11,139},{11,11,715},{12,11,417},{141,11,421},{132,0,783},{4,0,682},
+{8,0,65},{9,10,39},{10,10,166},{11,10,918},{12,10,635},{20,10,10},{22,10,27},{22
+,10,43},{150,10,52},{6,0,11},{135,0,187},{132,0,522},{4,0,52},{135,0,661},{4,0,
+383},{133,0,520},{135,11,546},{11,0,343},{142,0,127},{4,11,578},{7,10,157},{7,11
+,624},{7,11,916},{8,10,279},{10,11,256},{11,11,87},{139,11,703},{134,10,604},{4,
+0,281},{5,0,38},{7,0,194},{7,0,668},{7,0,1893},{137,0,397},{7,10,945},{11,10,713
+},{139,10,744},{139,10,1022},{9,0,635},{139,0,559},{5,11,923},{7,11,490},{12,11,
+553},{13,11,100},{14,11,118},{143,11,75},{132,0,975},{132,10,567},{137,10,859},{
+7,10,1846},{7,11,1846},{8,10,628},{136,11,628},{148,0,116},{138,11,750},{14,0,51
+},{14,11,51},{15,11,7},{148,11,20},{132,0,858},{134,0,1075},{4,11,924},{133,10,
+762},{136,0,535},{133,0,448},{10,10,784},{141,10,191},{133,10,298},{7,0,610},{
+135,0,1501},{7,10,633},{7,10,905},{7,10,909},{7,10,1538},{9,10,767},{140,10,636}
+,{4,11,265},{7,11,807},{135,11,950},{5,11,93},{12,11,267},{144,11,26},{136,0,191
+},{139,10,301},{135,10,1970},{135,0,267},{4,0,319},{5,0,699},{138,0,673},{6,0,
+336},{7,0,92},{7,0,182},{8,0,453},{8,0,552},{9,0,204},{9,0,285},{10,0,99},{11,0,
+568},{11,0,950},{12,0,94},{16,0,20},{16,0,70},{19,0,55},{12,10,644},{144,10,90},
+{6,0,551},{7,0,1308},{7,10,845},{7,11,994},{8,10,160},{137,10,318},{19,11,1},{19
+,11,26},{150,11,9},{7,0,1406},{9,0,218},{141,0,222},{5,0,256},{138,0,69},{5,11,
+233},{5,11,320},{6,11,140},{7,11,330},{136,11,295},{6,0,1980},{136,0,952},{4,0,
+833},{137,11,678},{133,11,978},{4,11,905},{6,11,1701},{137,11,843},{138,10,735},
+{136,10,76},{17,0,39},{148,0,36},{18,0,81},{146,11,81},{14,0,352},{17,0,53},{18,
+0,146},{18,0,152},{19,0,11},{150,0,54},{135,0,634},{138,10,841},{132,0,618},{4,0
+,339},{7,0,259},{17,0,73},{4,11,275},{140,11,376},{132,11,509},{7,11,273},{139,
+11,377},{4,0,759},{13,0,169},{137,10,804},{6,10,96},{135,10,1426},{4,10,651},{
+133,10,289},{7,0,1075},{8,10,35},{9,10,511},{10,10,767},{147,10,118},{6,0,649},{
+6,0,670},{136,0,482},{5,0,336},{6,0,341},{6,0,478},{6,0,1763},{136,0,386},{5,11,
+802},{7,11,2021},{8,11,805},{14,11,94},{15,11,65},{16,11,4},{16,11,77},{16,11,80
+},{145,11,5},{6,0,1035},{5,11,167},{5,11,899},{6,11,410},{137,11,777},{134,11,
+1705},{5,0,924},{133,0,969},{132,10,704},{135,0,73},{135,11,10},{135,10,1078},{5
+,11,11},{6,11,117},{6,11,485},{7,11,1133},{9,11,582},{9,11,594},{11,11,21},{11,
+11,818},{12,11,535},{141,11,86},{135,0,1971},{4,11,264},{7,11,1067},{8,11,204},{
+8,11,385},{139,11,953},{6,0,1458},{135,0,1344},{5,0,396},{134,0,501},{4,10,720},
+{133,10,306},{4,0,929},{5,0,799},{8,0,46},{8,0,740},{133,10,431},{7,11,646},{7,
+11,1730},{11,11,446},{141,11,178},{7,0,276},{5,10,464},{6,10,236},{7,10,696},{7,
+10,914},{7,10,1108},{7,10,1448},{9,10,15},{9,10,564},{10,10,14},{12,10,565},{13,
+10,449},{14,10,53},{15,10,13},{16,10,64},{145,10,41},{4,0,892},{133,0,770},{6,10
+,1767},{12,10,194},{145,10,107},{135,0,158},{5,10,840},{138,11,608},{134,0,1432}
+,{138,11,250},{8,11,794},{9,11,400},{10,11,298},{142,11,228},{151,0,25},{7,11,
+1131},{135,11,1468},{135,0,2001},{9,10,642},{11,10,236},{142,10,193},{4,10,68},{
+5,10,634},{6,10,386},{7,10,794},{8,10,273},{9,10,563},{10,10,105},{10,10,171},{
+11,10,94},{139,10,354},{136,11,724},{132,0,478},{11,11,512},{13,11,205},{19,11,
+30},{22,11,36},{151,11,19},{7,0,1461},{140,0,91},{6,11,190},{7,11,768},{135,11,
+1170},{4,0,602},{8,0,211},{4,10,95},{7,10,416},{139,10,830},{7,10,731},{13,10,20
+},{143,10,11},{6,0,1068},{135,0,1872},{4,0,13},{5,0,567},{7,0,1498},{9,0,124},{
+11,0,521},{12,0,405},{135,11,1023},{135,0,1006},{132,0,735},{138,0,812},{4,0,170
+},{135,0,323},{6,11,137},{9,11,75},{9,11,253},{10,11,194},{138,11,444},{5,0,304}
+,{7,0,1403},{5,10,864},{10,10,648},{11,10,671},{143,10,46},{135,11,1180},{133,10
+,928},{4,0,148},{133,0,742},{11,10,986},{140,10,682},{133,0,523},{135,11,1743},{
+7,0,730},{18,0,144},{19,0,61},{8,10,44},{9,10,884},{10,10,580},{11,10,399},{11,
+10,894},{143,10,122},{5,11,760},{7,11,542},{8,11,135},{136,11,496},{136,0,981},{
+133,0,111},{10,0,132},{11,0,191},{11,0,358},{139,0,460},{7,11,319},{7,11,355},{7
+,11,763},{10,11,389},{145,11,43},{134,0,890},{134,0,1420},{136,11,557},{133,10,
+518},{133,0,444},{135,0,1787},{135,10,1852},{8,0,123},{15,0,6},{144,0,7},{6,0,
+2041},{10,11,38},{139,11,784},{136,0,932},{5,0,937},{135,0,100},{6,0,995},{4,11,
+58},{5,11,286},{6,11,319},{7,11,402},{7,11,1254},{7,11,1903},{8,11,356},{140,11,
+408},{4,11,389},{9,11,181},{9,11,255},{10,11,8},{10,11,29},{10,11,816},{11,11,
+311},{11,11,561},{12,11,67},{141,11,181},{138,0,255},{5,0,138},{4,10,934},{136,
+10,610},{4,0,965},{10,0,863},{138,0,898},{10,10,804},{138,10,832},{12,0,631},{8,
+10,96},{9,10,36},{10,10,607},{11,10,423},{11,10,442},{12,10,309},{14,10,199},{15
+,10,90},{145,10,110},{134,0,1394},{4,0,652},{8,0,320},{22,0,6},{22,0,16},{9,10,
+13},{9,10,398},{9,10,727},{10,10,75},{10,10,184},{10,10,230},{10,10,564},{10,10,
+569},{11,10,973},{12,10,70},{12,10,189},{13,10,57},{141,10,257},{6,0,897},{134,0
+,1333},{4,0,692},{133,0,321},{133,11,373},{135,0,922},{5,0,619},{133,0,698},{137
+,10,631},{5,10,345},{135,10,1016},{9,0,957},{9,0,1018},{12,0,828},{12,0,844},{12
+,0,897},{12,0,901},{12,0,943},{15,0,180},{18,0,197},{18,0,200},{18,0,213},{18,0,
+214},{146,0,226},{5,0,917},{134,0,1659},{135,0,1100},{134,0,1173},{134,0,1930},{
+5,0,251},{5,0,956},{8,0,268},{9,0,214},{146,0,142},{133,10,673},{137,10,850},{4,
+10,287},{133,10,1018},{132,11,672},{5,0,346},{5,0,711},{8,0,390},{11,11,752},{
+139,11,885},{5,10,34},{10,10,724},{12,10,444},{13,10,354},{18,10,32},{23,10,24},
+{23,10,31},{152,10,5},{4,11,710},{134,11,606},{134,0,744},{134,10,382},{133,11,
+145},{4,10,329},{7,11,884},{140,11,124},{4,11,467},{5,11,405},{134,11,544},{9,10
+,846},{138,10,827},{133,0,624},{9,11,372},{15,11,2},{19,11,10},{147,11,18},{4,11
+,387},{135,11,1288},{5,0,783},{7,0,1998},{135,0,2047},{132,10,906},{136,10,366},
+{135,11,550},{4,10,123},{4,10,649},{5,10,605},{7,10,1509},{136,10,36},{134,0,
+1125},{132,0,594},{133,10,767},{135,11,1227},{136,11,467},{4,11,576},{135,11,
+1263},{4,0,268},{7,0,1534},{135,11,1534},{4,10,273},{5,10,658},{5,11,919},{5,10,
+995},{134,11,1673},{133,0,563},{134,10,72},{135,10,1345},{4,11,82},{5,11,333},{5
+,11,904},{6,11,207},{7,11,325},{7,11,1726},{8,11,101},{10,11,778},{139,11,220},{
+5,0,37},{6,0,39},{6,0,451},{7,0,218},{7,0,667},{7,0,1166},{7,0,1687},{8,0,662},{
+16,0,2},{133,10,589},{134,0,1332},{133,11,903},{134,0,508},{5,10,117},{6,10,514}
+,{6,10,541},{7,10,1164},{7,10,1436},{8,10,220},{8,10,648},{10,10,688},{11,10,560
+},{140,11,147},{6,11,555},{135,11,485},{133,10,686},{7,0,453},{7,0,635},{7,0,796
+},{8,0,331},{9,0,330},{9,0,865},{10,0,119},{10,0,235},{11,0,111},{11,0,129},{11,
+0,240},{12,0,31},{12,0,66},{12,0,222},{12,0,269},{12,0,599},{12,0,684},{12,0,689
+},{12,0,691},{142,0,345},{135,0,1834},{4,11,705},{7,11,615},{138,11,251},{136,11
+,345},{137,0,527},{6,0,98},{7,0,702},{135,0,991},{11,0,576},{14,0,74},{7,10,196}
+,{10,10,765},{11,10,347},{11,10,552},{11,10,790},{12,10,263},{13,10,246},{13,10,
+270},{13,10,395},{14,10,176},{14,10,190},{14,10,398},{14,10,412},{15,10,32},{15,
+10,63},{16,10,88},{147,10,105},{134,11,90},{13,0,84},{141,0,122},{6,0,37},{7,0,
+299},{7,0,1666},{8,0,195},{8,0,316},{9,0,178},{9,0,276},{9,0,339},{9,0,536},{10,
+0,102},{10,0,362},{10,0,785},{11,0,55},{11,0,149},{11,0,773},{13,0,416},{13,0,
+419},{14,0,38},{14,0,41},{142,0,210},{5,10,381},{135,10,1792},{7,11,813},{12,11,
+497},{141,11,56},{7,10,616},{138,10,413},{133,0,645},{6,11,125},{135,11,1277},{
+132,0,290},{6,0,70},{7,0,1292},{10,0,762},{139,0,288},{6,10,120},{7,10,1188},{7,
+10,1710},{8,10,286},{9,10,667},{11,10,592},{139,10,730},{135,11,1784},{7,0,1315}
+,{135,11,1315},{134,0,1955},{135,10,1146},{7,0,131},{7,0,422},{8,0,210},{140,0,
+573},{4,10,352},{135,10,687},{139,0,797},{143,0,38},{14,0,179},{15,0,151},{150,0
+,11},{7,0,488},{4,10,192},{5,10,49},{6,10,200},{6,10,293},{134,10,1696},{132,0,
+936},{135,11,703},{6,11,160},{7,11,1106},{9,11,770},{10,11,618},{11,11,112},{140
+,11,413},{5,0,453},{134,0,441},{135,0,595},{132,10,650},{132,10,147},{6,0,991},{
+6,0,1182},{12,11,271},{145,11,109},{133,10,934},{140,11,221},{132,0,653},{7,0,
+505},{135,0,523},{134,0,903},{135,11,479},{7,11,304},{9,11,646},{9,11,862},{10,
+11,262},{11,11,696},{12,11,208},{15,11,79},{147,11,108},{146,0,80},{135,11,981},
+{142,0,432},{132,0,314},{137,11,152},{7,0,1368},{8,0,232},{8,0,361},{10,0,682},{
+138,0,742},{135,11,1586},{9,0,534},{4,11,434},{11,11,663},{12,11,210},{13,11,166
+},{13,11,310},{14,11,373},{147,11,43},{7,11,1091},{135,11,1765},{6,11,550},{135,
+11,652},{137,0,27},{142,0,12},{4,10,637},{5,11,553},{7,11,766},{138,11,824},{7,
+11,737},{8,11,298},{136,11,452},{7,0,736},{139,0,264},{134,0,1657},{133,11,292},
+{138,11,135},{6,0,844},{134,0,1117},{135,0,127},{9,10,867},{138,10,837},{6,0,
+1184},{134,0,1208},{134,0,1294},{136,0,364},{6,0,1415},{7,0,1334},{11,0,125},{6,
+10,170},{7,11,393},{8,10,395},{8,10,487},{10,11,603},{11,11,206},{141,10,147},{
+137,11,748},{4,11,912},{137,11,232},{4,10,535},{136,10,618},{137,0,792},{7,11,
+1973},{136,11,716},{135,11,98},{5,0,909},{9,0,849},{138,0,805},{4,0,630},{132,0,
+699},{5,11,733},{14,11,103},{150,10,23},{12,11,158},{18,11,8},{19,11,62},{20,11,
+6},{22,11,4},{23,11,2},{151,11,9},{132,0,968},{132,10,778},{132,10,46},{5,10,811
+},{6,10,1679},{6,10,1714},{135,10,2032},{6,0,1446},{7,10,1458},{9,10,407},{139,
+10,15},{7,0,206},{7,0,397},{7,0,621},{7,0,640},{8,0,124},{8,0,619},{9,0,305},{9,
+0,643},{10,0,264},{10,0,628},{11,0,40},{12,0,349},{13,0,134},{13,0,295},{14,0,
+155},{15,0,120},{18,0,105},{6,10,34},{7,10,1089},{8,10,708},{8,10,721},{9,10,363
+},{148,10,98},{4,0,262},{5,0,641},{135,0,342},{137,11,72},{4,0,99},{6,0,250},{6,
+0,346},{8,0,127},{138,0,81},{132,0,915},{5,0,75},{9,0,517},{10,0,470},{12,0,155}
+,{141,0,224},{132,10,462},{11,11,600},{11,11,670},{141,11,245},{142,0,83},{5,10,
+73},{6,10,23},{134,10,338},{6,0,1031},{139,11,923},{7,11,164},{7,11,1571},{9,11,
+107},{140,11,225},{134,0,1470},{133,0,954},{6,0,304},{8,0,418},{10,0,345},{11,0,
+341},{139,0,675},{9,0,410},{139,0,425},{4,11,27},{5,11,484},{5,11,510},{6,11,434
+},{7,11,1000},{7,11,1098},{8,11,2},{136,11,200},{134,0,734},{140,11,257},{7,10,
+725},{8,10,498},{139,10,268},{134,0,1822},{135,0,1798},{135,10,773},{132,11,460}
+,{4,11,932},{133,11,891},{134,0,14},{132,10,583},{7,10,1462},{8,11,625},{139,10,
+659},{5,0,113},{6,0,243},{6,0,1708},{7,0,1865},{11,0,161},{16,0,37},{17,0,99},{
+133,10,220},{134,11,76},{5,11,461},{135,11,1925},{140,0,69},{8,11,92},{137,11,
+221},{139,10,803},{132,10,544},{4,0,274},{134,0,922},{132,0,541},{5,0,627},{6,10
+,437},{6,10,564},{11,10,181},{141,10,183},{135,10,1192},{7,0,166},{132,11,763},{
+133,11,253},{134,0,849},{9,11,73},{10,11,110},{14,11,185},{145,11,119},{5,11,212
+},{12,11,35},{141,11,382},{133,0,717},{137,0,304},{136,0,600},{133,0,654},{6,0,
+273},{10,0,188},{13,0,377},{146,0,77},{4,10,790},{5,10,273},{134,10,394},{132,0,
+543},{135,0,410},{11,0,98},{11,0,524},{141,0,87},{132,0,941},{135,11,1175},{4,0,
+250},{7,0,1612},{11,0,186},{12,0,133},{6,10,127},{7,10,1511},{8,10,613},{12,10,
+495},{12,10,586},{12,10,660},{12,10,668},{14,10,385},{15,10,118},{17,10,20},{146
+,10,98},{6,0,1785},{133,11,816},{134,0,1339},{7,0,961},{7,0,1085},{7,0,1727},{8,
+0,462},{6,10,230},{135,11,1727},{9,0,636},{135,10,1954},{132,0,780},{5,11,869},{
+5,11,968},{6,11,1626},{8,11,734},{136,11,784},{4,11,542},{6,11,1716},{6,11,1727}
+,{7,11,1082},{7,11,1545},{8,11,56},{8,11,118},{8,11,412},{8,11,564},{9,11,888},{
+9,11,908},{10,11,50},{10,11,423},{11,11,685},{11,11,697},{11,11,933},{12,11,299}
+,{13,11,126},{13,11,136},{13,11,170},{141,11,190},{134,11,226},{4,11,232},{9,11,
+202},{10,11,474},{140,11,433},{137,11,500},{5,0,529},{136,10,68},{132,10,654},{4
+,10,156},{7,10,998},{7,10,1045},{7,10,1860},{9,10,48},{9,10,692},{11,10,419},{
+139,10,602},{7,0,1276},{8,0,474},{9,0,652},{6,11,108},{7,11,1003},{7,11,1181},{
+136,11,343},{7,11,1264},{7,11,1678},{11,11,945},{12,11,341},{12,11,471},{140,11,
+569},{134,11,1712},{5,0,948},{12,0,468},{19,0,96},{148,0,24},{4,11,133},{7,11,
+711},{7,11,1298},{7,11,1585},{135,11,1929},{6,0,753},{140,0,657},{139,0,941},{6,
+11,99},{7,11,1808},{145,11,57},{6,11,574},{7,11,428},{7,11,1250},{10,11,669},{11
+,11,485},{11,11,840},{12,11,300},{142,11,250},{4,0,532},{5,0,706},{135,0,662},{5
+,0,837},{6,0,1651},{139,0,985},{7,0,1861},{9,10,197},{10,10,300},{12,10,473},{13
+,10,90},{141,10,405},{137,11,252},{6,11,323},{135,11,1564},{4,0,330},{4,0,863},{
+7,0,933},{7,0,2012},{8,0,292},{7,11,461},{8,11,775},{138,11,435},{132,10,606},{4
+,11,655},{7,11,850},{17,11,75},{146,11,137},{135,0,767},{7,10,1978},{136,10,676}
+,{132,0,641},{135,11,1559},{134,0,1233},{137,0,242},{17,0,114},{4,10,361},{133,
+10,315},{137,0,883},{132,10,461},{138,0,274},{134,0,2008},{134,0,1794},{4,0,703}
+,{135,0,207},{12,0,285},{132,10,472},{132,0,571},{5,0,873},{5,0,960},{8,0,823},{
+9,0,881},{136,11,577},{7,0,617},{10,0,498},{11,0,501},{12,0,16},{140,0,150},{138
+,10,747},{132,0,431},{133,10,155},{11,0,283},{11,0,567},{7,10,163},{8,10,319},{9
+,10,402},{10,10,24},{10,10,681},{11,10,200},{12,10,253},{12,10,410},{142,10,219}
+,{4,11,413},{5,11,677},{8,11,432},{140,11,280},{9,0,401},{5,10,475},{7,10,1780},
+{11,10,297},{11,10,558},{14,10,322},{147,10,76},{6,0,781},{9,0,134},{10,0,2},{10
+,0,27},{10,0,333},{11,0,722},{143,0,1},{5,0,33},{6,0,470},{139,0,424},{135,0,
+2006},{12,0,783},{135,10,1956},{136,0,274},{135,0,1882},{132,0,794},{135,0,1848}
+,{5,10,944},{134,10,1769},{6,0,47},{7,0,90},{7,0,664},{7,0,830},{7,0,1380},{7,0,
+2025},{8,0,448},{136,0,828},{132,10,144},{134,0,1199},{4,11,395},{139,11,762},{
+135,11,1504},{9,0,417},{137,0,493},{9,11,174},{10,11,164},{11,11,440},{11,11,841
+},{143,11,98},{134,11,426},{139,11,1002},{134,0,295},{134,0,816},{6,10,247},{137
+,10,555},{133,0,1019},{4,0,620},{5,11,476},{10,10,280},{138,10,797},{139,0,464},
+{5,11,76},{6,11,458},{6,11,497},{7,11,764},{7,11,868},{9,11,658},{10,11,594},{11
+,11,173},{11,11,566},{12,11,20},{12,11,338},{141,11,200},{134,0,208},{4,11,526},
+{7,11,1029},{135,11,1054},{132,11,636},{6,11,233},{7,11,660},{7,11,1124},{17,11,
+31},{19,11,22},{151,11,14},{10,0,442},{133,10,428},{10,0,930},{140,0,778},{6,0,
+68},{7,0,448},{7,0,1629},{7,0,1769},{7,0,1813},{8,0,442},{8,0,516},{9,0,710},{10
+,0,282},{10,0,722},{7,10,1717},{138,10,546},{134,0,1128},{11,0,844},{12,0,104},{
+140,0,625},{4,11,432},{135,11,824},{138,10,189},{133,0,787},{133,10,99},{4,11,
+279},{7,11,301},{137,11,362},{8,0,491},{4,10,397},{136,10,555},{4,11,178},{133,
+11,399},{134,0,711},{144,0,9},{4,0,403},{5,0,441},{7,0,450},{10,0,840},{11,0,101
+},{12,0,193},{141,0,430},{135,11,1246},{12,10,398},{20,10,39},{21,10,11},{150,10
+,41},{4,10,485},{7,10,353},{135,10,1523},{6,10,366},{7,10,1384},{7,10,1601},{135
+,11,1912},{7,0,396},{10,0,160},{135,11,396},{137,10,282},{134,11,1692},{4,10,157
+},{5,10,471},{6,11,202},{10,11,448},{11,11,208},{12,11,360},{17,11,117},{17,11,
+118},{18,11,27},{148,11,67},{133,0,679},{137,0,326},{136,10,116},{7,11,872},{10,
+11,516},{139,11,167},{132,11,224},{5,11,546},{7,11,35},{8,11,11},{8,11,12},{9,11
+,315},{9,11,533},{10,11,802},{11,11,166},{12,11,525},{142,11,243},{7,0,1128},{
+135,11,1920},{5,11,241},{8,11,242},{9,11,451},{10,11,667},{11,11,598},{140,11,
+429},{6,0,737},{5,10,160},{7,10,363},{7,10,589},{10,10,170},{141,10,55},{135,0,
+1796},{142,11,254},{4,0,574},{7,0,350},{7,0,1024},{8,0,338},{9,0,677},{138,0,808
+},{134,0,1096},{137,11,516},{7,0,405},{10,0,491},{4,10,108},{4,11,366},{139,10,
+498},{11,11,337},{142,11,303},{134,11,1736},{7,0,1081},{140,11,364},{7,10,1005},
+{140,10,609},{7,0,1676},{4,10,895},{133,10,772},{135,0,2037},{6,0,1207},{11,11,
+916},{142,11,419},{14,11,140},{148,11,41},{6,11,331},{136,11,623},{9,0,944},{9,0
+,969},{9,0,1022},{12,0,913},{12,0,936},{15,0,177},{15,0,193},{4,10,926},{133,10,
+983},{5,0,354},{135,11,506},{8,0,598},{9,0,664},{138,0,441},{4,11,640},{133,11,
+513},{137,0,297},{132,10,538},{6,10,294},{7,10,1267},{136,10,624},{7,0,1772},{7,
+11,1888},{8,11,289},{11,11,45},{12,11,278},{140,11,537},{135,10,1325},{138,0,751
+},{141,0,37},{134,0,1828},{132,10,757},{132,11,394},{6,0,257},{135,0,1522},{4,0,
+582},{9,0,191},{135,11,1931},{7,11,574},{7,11,1719},{137,11,145},{132,11,658},{
+10,0,790},{132,11,369},{9,11,781},{10,11,144},{11,11,385},{13,11,161},{13,11,228
+},{13,11,268},{148,11,107},{8,0,469},{10,0,47},{136,11,374},{6,0,306},{7,0,1140}
+,{7,0,1340},{8,0,133},{138,0,449},{139,0,1011},{7,10,1875},{139,10,124},{4,11,
+344},{6,11,498},{139,11,323},{137,0,299},{132,0,837},{133,11,906},{5,0,329},{8,0
+,260},{138,0,10},{134,0,1320},{4,0,657},{146,0,158},{135,0,1191},{152,0,7},{6,0,
+1939},{8,0,974},{138,0,996},{135,0,1665},{11,11,126},{139,11,287},{143,0,8},{14,
+11,149},{14,11,399},{143,11,57},{5,0,66},{7,0,1896},{136,0,288},{7,0,175},{10,0,
+494},{5,10,150},{8,10,603},{9,10,593},{9,10,634},{10,10,173},{11,10,462},{11,10,
+515},{13,10,216},{13,10,288},{142,10,400},{134,0,1643},{136,11,21},{4,0,21},{5,0
+,91},{5,0,648},{5,0,750},{5,0,781},{6,0,54},{6,0,112},{6,0,402},{6,0,1732},{7,0,
+315},{7,0,749},{7,0,1427},{7,0,1900},{9,0,78},{9,0,508},{10,0,611},{10,0,811},{
+11,0,510},{11,0,728},{13,0,36},{14,0,39},{16,0,83},{17,0,124},{148,0,30},{4,0,
+668},{136,0,570},{10,0,322},{10,0,719},{139,0,407},{135,11,1381},{136,11,193},{
+12,10,108},{141,10,291},{132,11,616},{136,11,692},{8,0,125},{8,0,369},{8,0,524},
+{10,0,486},{11,0,13},{11,0,381},{11,0,736},{11,0,766},{11,0,845},{13,0,114},{13,
+0,292},{142,0,47},{134,0,1247},{6,0,1684},{6,0,1731},{7,0,356},{8,0,54},{8,0,221
+},{9,0,225},{9,0,356},{10,0,77},{10,0,446},{10,0,731},{12,0,404},{141,0,491},{
+135,10,1777},{4,11,305},{4,10,493},{144,10,55},{4,0,951},{6,0,1809},{6,0,1849},{
+8,0,846},{8,0,866},{8,0,899},{10,0,896},{12,0,694},{142,0,468},{5,11,214},{7,11,
+603},{8,11,611},{9,11,686},{10,11,88},{11,11,459},{11,11,496},{12,11,463},{12,11
+,590},{13,11,0},{142,11,214},{132,0,411},{4,0,80},{133,0,44},{140,11,74},{143,0,
+31},{7,0,669},{6,10,568},{7,10,1804},{8,10,362},{8,10,410},{8,10,830},{9,10,514}
+,{11,10,649},{142,10,157},{7,0,673},{134,11,1703},{132,10,625},{134,0,1303},{5,0
+,299},{135,0,1083},{138,0,704},{6,0,275},{7,0,408},{6,10,158},{7,10,129},{7,10,
+181},{8,10,276},{8,10,377},{10,10,523},{11,10,816},{12,10,455},{13,10,303},{142,
+10,135},{4,0,219},{7,0,367},{7,0,1713},{7,0,1761},{9,0,86},{9,0,537},{10,0,165},
+{12,0,219},{140,0,561},{8,0,216},{4,10,1},{4,11,737},{6,11,317},{7,10,1143},{7,
+10,1463},{9,10,207},{9,10,390},{9,10,467},{10,11,98},{11,11,294},{11,10,836},{12
+,11,60},{12,11,437},{13,11,64},{13,11,380},{142,11,430},{6,11,1758},{8,11,520},{
+9,11,345},{9,11,403},{142,11,350},{5,11,47},{10,11,242},{138,11,579},{5,11,139},
+{7,11,1168},{138,11,539},{135,0,1319},{4,10,295},{4,10,723},{5,10,895},{7,10,
+1031},{8,10,199},{8,10,340},{9,10,153},{9,10,215},{10,10,21},{10,10,59},{10,10,
+80},{10,10,224},{10,10,838},{11,10,229},{11,10,652},{12,10,192},{13,10,146},{142
+,10,91},{140,0,428},{137,10,51},{133,0,514},{5,10,309},{140,10,211},{6,0,1010},{
+5,10,125},{8,10,77},{138,10,15},{4,0,55},{5,0,301},{6,0,571},{142,0,49},{146,0,
+102},{136,11,370},{4,11,107},{7,11,613},{8,11,358},{8,11,439},{8,11,504},{9,11,
+501},{10,11,383},{139,11,477},{132,11,229},{133,0,364},{133,10,439},{4,11,903},{
+135,11,1816},{11,0,379},{140,10,76},{4,0,76},{4,0,971},{7,0,1550},{9,0,306},{9,0
+,430},{9,0,663},{10,0,683},{10,0,921},{11,0,427},{11,0,753},{12,0,334},{12,0,442
+},{14,0,258},{14,0,366},{143,0,131},{137,0,52},{4,11,47},{6,11,373},{7,11,452},{
+7,11,543},{7,11,1714},{7,11,1856},{9,11,6},{11,11,257},{139,11,391},{4,10,8},{7,
+10,1152},{7,10,1153},{7,10,1715},{9,10,374},{10,10,478},{139,10,648},{4,11,785},
+{133,11,368},{135,10,1099},{135,11,860},{5,11,980},{134,11,1754},{134,0,1258},{6
+,0,1058},{6,0,1359},{7,11,536},{7,11,1331},{136,11,143},{4,0,656},{135,0,779},{
+136,10,87},{5,11,19},{6,11,533},{146,11,126},{7,0,144},{138,10,438},{5,11,395},{
+5,11,951},{134,11,1776},{135,0,1373},{7,0,554},{7,0,605},{141,0,10},{4,10,69},{5
+,10,122},{9,10,656},{138,10,464},{5,10,849},{134,10,1633},{5,0,838},{5,0,841},{
+134,0,1649},{133,0,1012},{139,10,499},{7,10,476},{7,10,1592},{138,10,87},{6,0,
+251},{7,0,365},{7,0,1357},{7,0,1497},{8,0,154},{141,0,281},{132,11,441},{132,11,
+695},{7,11,497},{9,11,387},{147,11,81},{133,0,340},{14,10,283},{142,11,283},{134
+,0,810},{135,11,1894},{139,0,495},{5,11,284},{6,11,49},{6,11,350},{7,11,1},{7,11
+,377},{7,11,1693},{8,11,18},{8,11,678},{9,11,161},{9,11,585},{9,11,671},{9,11,
+839},{11,11,912},{141,11,427},{5,10,859},{7,10,1160},{8,10,107},{9,10,291},{9,10
+,439},{10,10,663},{11,10,609},{140,10,197},{8,0,261},{9,0,144},{9,0,466},{10,0,
+370},{12,0,470},{13,0,144},{142,0,348},{137,0,897},{6,0,248},{9,0,546},{10,0,535
+},{11,0,681},{141,0,135},{4,0,358},{135,0,1496},{134,0,567},{136,0,445},{4,10,
+117},{6,10,372},{7,10,1905},{142,10,323},{4,10,722},{139,10,471},{6,0,697},{134,
+0,996},{7,11,2007},{9,11,101},{9,11,450},{10,11,66},{10,11,842},{11,11,536},{140
+,11,587},{132,0,577},{134,0,1336},{9,10,5},{12,10,216},{12,10,294},{12,10,298},{
+12,10,400},{12,10,518},{13,10,229},{143,10,139},{6,0,174},{138,0,917},{134,10,
+1774},{5,10,12},{7,10,375},{9,10,88},{9,10,438},{11,11,62},{139,10,270},{134,11,
+1766},{6,11,0},{7,11,84},{7,10,816},{7,10,1241},{9,10,283},{9,10,520},{10,10,213
+},{10,10,307},{10,10,463},{10,10,671},{10,10,746},{11,10,401},{11,10,794},{11,11
+,895},{12,10,517},{17,11,11},{18,10,107},{147,10,115},{5,0,878},{133,0,972},{6,
+11,1665},{7,11,256},{7,11,1388},{138,11,499},{4,10,258},{136,10,639},{4,11,22},{
+5,11,10},{6,10,22},{7,11,848},{7,10,903},{7,10,1963},{8,11,97},{138,10,577},{5,
+10,681},{136,10,782},{133,11,481},{132,0,351},{4,10,664},{5,10,804},{139,10,1013
+},{6,11,134},{7,11,437},{7,11,959},{9,11,37},{14,11,285},{14,11,371},{144,11,60}
+,{7,11,486},{8,11,155},{11,11,93},{140,11,164},{132,0,286},{7,0,438},{7,0,627},{
+7,0,1516},{8,0,40},{9,0,56},{9,0,294},{10,0,30},{11,0,969},{11,0,995},{146,0,148
+},{5,11,591},{135,11,337},{134,0,1950},{133,10,32},{138,11,500},{5,11,380},{5,11
+,650},{136,11,310},{4,11,364},{7,11,1156},{7,11,1187},{137,11,409},{4,0,738},{
+134,11,482},{4,11,781},{6,11,487},{7,11,926},{8,11,263},{139,11,500},{135,11,418
+},{6,0,2047},{10,0,969},{4,10,289},{7,10,629},{7,10,1698},{7,10,1711},{140,10,
+215},{6,10,450},{136,10,109},{134,0,818},{136,10,705},{133,0,866},{4,11,94},{135
+,11,1265},{132,11,417},{134,0,1467},{135,10,1238},{4,0,972},{6,0,1851},{134,0,
+1857},{134,0,355},{133,0,116},{132,0,457},{135,11,1411},{4,11,408},{4,11,741},{
+135,11,500},{134,10,26},{142,11,137},{5,0,527},{6,0,189},{7,0,859},{136,0,267},{
+11,0,104},{11,0,554},{15,0,60},{143,0,125},{134,0,1613},{4,10,414},{5,10,467},{9
+,10,654},{10,10,451},{12,10,59},{141,10,375},{135,10,17},{134,0,116},{135,11,541
+},{135,10,955},{6,11,73},{135,11,177},{133,11,576},{134,0,886},{133,0,487},{4,0,
+86},{5,0,667},{5,0,753},{6,0,316},{6,0,455},{135,0,946},{142,11,231},{150,0,45},
+{134,0,863},{134,0,1953},{6,10,280},{10,10,502},{11,10,344},{140,10,38},{4,0,79}
+,{7,0,1773},{10,0,450},{11,0,589},{13,0,332},{13,0,493},{14,0,183},{14,0,334},{
+14,0,362},{14,0,368},{14,0,376},{14,0,379},{19,0,90},{19,0,103},{19,0,127},{148,
+0,90},{5,10,45},{7,10,1161},{11,10,448},{11,10,880},{13,10,139},{13,10,407},{15,
+10,16},{17,10,95},{18,10,66},{18,10,88},{18,10,123},{149,10,7},{136,10,777},{4,
+10,410},{135,10,521},{135,10,1778},{135,11,538},{142,0,381},{133,11,413},{134,0,
+1142},{6,0,1189},{136,11,495},{5,0,663},{6,0,1962},{134,0,2003},{7,11,54},{8,11,
+312},{10,11,191},{10,11,614},{140,11,567},{132,10,436},{133,0,846},{10,0,528},{
+11,0,504},{7,10,1587},{135,10,1707},{5,0,378},{8,0,465},{9,0,286},{10,0,185},{10
+,0,562},{10,0,635},{11,0,31},{11,0,393},{13,0,312},{18,0,65},{18,0,96},{147,0,89
+},{7,0,899},{14,0,325},{6,11,468},{7,11,567},{7,11,1478},{8,11,530},{142,11,290}
+,{7,0,1880},{9,0,680},{139,0,798},{134,0,1770},{132,0,648},{150,11,35},{5,0,945}
+,{6,0,1656},{6,0,1787},{7,0,167},{8,0,824},{9,0,391},{10,0,375},{139,0,185},{6,
+11,484},{135,11,822},{134,0,2046},{7,0,1645},{8,0,352},{137,0,249},{132,0,152},{
+6,0,611},{135,0,1733},{6,11,1724},{135,11,2022},{133,0,1006},{141,11,96},{5,0,
+420},{135,0,1449},{146,11,149},{135,0,832},{135,10,663},{133,0,351},{5,0,40},{7,
+0,598},{7,0,1638},{8,0,78},{9,0,166},{9,0,640},{9,0,685},{9,0,773},{11,0,215},{
+13,0,65},{14,0,172},{14,0,317},{145,0,6},{8,0,60},{9,0,343},{139,0,769},{134,0,
+1354},{132,0,724},{137,0,745},{132,11,474},{7,0,1951},{8,0,765},{8,0,772},{140,0
+,671},{7,0,108},{8,0,219},{8,0,388},{9,0,775},{11,0,275},{140,0,464},{137,0,639}
+,{135,10,503},{133,11,366},{5,0,15},{6,0,56},{7,0,1758},{8,0,500},{9,0,730},{11,
+0,331},{13,0,150},{14,0,282},{5,11,305},{9,11,560},{141,11,208},{4,10,113},{5,10
+,163},{5,10,735},{7,10,1009},{9,10,9},{9,10,771},{12,10,90},{13,10,138},{13,10,
+410},{143,10,128},{4,10,324},{138,10,104},{135,11,466},{142,11,27},{134,0,1886},
+{5,0,205},{6,0,438},{9,0,711},{4,11,480},{6,11,167},{6,11,302},{6,11,1642},{7,11
+,130},{7,11,656},{7,11,837},{7,11,1547},{7,11,1657},{8,11,429},{9,11,228},{10,11
+,643},{13,11,289},{13,11,343},{147,11,101},{134,0,865},{6,0,2025},{136,0,965},{7
+,11,278},{10,11,739},{11,11,708},{141,11,348},{133,0,534},{135,11,1922},{137,0,
+691},{4,10,935},{133,10,823},{6,0,443},{9,0,237},{9,0,571},{9,0,695},{10,0,139},
+{11,0,715},{12,0,417},{141,0,421},{5,10,269},{7,10,434},{7,10,891},{8,10,339},{9
+,10,702},{11,10,594},{11,10,718},{145,10,100},{6,0,1555},{7,0,878},{9,10,485},{
+141,10,264},{134,10,1713},{7,10,1810},{11,10,866},{12,10,103},{141,10,495},{135,
+10,900},{6,0,1410},{9,11,316},{139,11,256},{4,0,995},{135,0,1033},{132,0,578},{
+10,0,881},{12,0,740},{12,0,743},{140,0,759},{132,0,822},{133,0,923},{142,10,143}
+,{135,11,1696},{6,11,363},{7,11,1955},{136,11,725},{132,0,924},{133,0,665},{135,
+10,2029},{135,0,1901},{4,0,265},{6,0,1092},{6,0,1417},{7,0,807},{135,0,950},{5,0
+,93},{12,0,267},{141,0,498},{135,0,1451},{5,11,813},{135,11,2046},{5,10,625},{
+135,10,1617},{135,0,747},{6,0,788},{137,0,828},{7,0,184},{11,0,307},{11,0,400},{
+15,0,130},{5,11,712},{7,11,1855},{8,10,425},{8,10,693},{9,10,720},{10,10,380},{
+10,10,638},{11,11,17},{11,10,473},{12,10,61},{13,11,321},{144,11,67},{135,0,198}
+,{6,11,320},{7,11,781},{7,11,1921},{9,11,55},{10,11,186},{10,11,273},{10,11,664}
+,{10,11,801},{11,11,996},{11,11,997},{13,11,157},{142,11,170},{136,11,271},{135,
+0,994},{7,11,103},{7,11,863},{11,11,184},{14,11,299},{145,11,62},{11,10,551},{
+142,10,159},{5,0,233},{5,0,320},{6,0,140},{8,0,295},{8,0,615},{136,11,615},{133,
+0,978},{4,0,905},{6,0,1701},{137,0,843},{132,10,168},{4,0,974},{8,0,850},{12,0,
+709},{12,0,768},{140,0,786},{135,10,91},{152,0,6},{138,10,532},{135,10,1884},{
+132,0,509},{6,0,1307},{135,0,273},{5,11,77},{7,11,1455},{10,11,843},{19,11,73},{
+150,11,5},{132,11,458},{135,11,1420},{6,11,109},{138,11,382},{6,0,201},{6,11,330
+},{7,10,70},{7,11,1084},{10,10,240},{11,11,142},{147,10,93},{7,0,1041},{140,11,
+328},{133,11,354},{134,0,1040},{133,0,693},{134,0,774},{139,0,234},{132,0,336},{
+7,0,1399},{139,10,392},{20,0,22},{148,11,22},{5,0,802},{7,0,2021},{136,0,805},{5
+,0,167},{5,0,899},{6,0,410},{137,0,777},{137,0,789},{134,0,1705},{7,10,655},{135
+,10,1844},{4,10,145},{6,10,176},{7,10,395},{137,10,562},{132,10,501},{135,0,10},
+{5,0,11},{6,0,117},{6,0,485},{7,0,1133},{9,0,582},{9,0,594},{10,0,82},{11,0,21},
+{11,0,818},{12,0,535},{13,0,86},{20,0,91},{23,0,13},{134,10,509},{4,0,264},{7,0,
+1067},{8,0,204},{8,0,385},{139,0,953},{139,11,737},{138,0,56},{134,0,1917},{133,
+0,470},{10,11,657},{14,11,297},{142,11,361},{135,11,412},{7,0,1198},{7,11,1198},
+{8,11,556},{14,11,123},{14,11,192},{143,11,27},{7,11,1985},{14,11,146},{15,11,42
+},{16,11,23},{17,11,86},{146,11,17},{11,0,1015},{136,11,122},{4,10,114},{9,10,
+492},{13,10,462},{142,10,215},{4,10,77},{5,10,361},{6,10,139},{6,10,401},{6,10,
+404},{7,10,413},{7,10,715},{7,10,1716},{11,10,279},{12,10,179},{12,10,258},{13,
+10,244},{142,10,358},{134,10,1717},{7,10,1061},{8,10,82},{11,10,250},{12,10,420}
+,{141,10,184},{133,0,715},{135,10,724},{9,0,919},{9,0,922},{9,0,927},{9,0,933},{
+9,0,962},{9,0,1000},{9,0,1002},{9,0,1021},{12,0,890},{12,0,907},{12,0,930},{15,0
+,207},{15,0,228},{15,0,238},{149,0,61},{8,0,794},{9,0,400},{10,0,298},{142,0,228
+},{5,11,430},{5,11,932},{6,11,131},{7,11,417},{9,11,522},{11,11,314},{141,11,390
+},{132,0,867},{8,0,724},{132,11,507},{137,11,261},{4,11,343},{133,11,511},{6,0,
+190},{7,0,768},{135,0,1170},{6,10,513},{135,10,1052},{7,11,455},{138,11,591},{
+134,0,1066},{137,10,899},{14,0,67},{147,0,60},{4,0,948},{18,0,174},{146,0,176},{
+135,0,1023},{7,10,1417},{12,10,382},{17,10,48},{152,10,12},{134,11,575},{132,0,
+764},{6,10,545},{7,10,565},{7,10,1669},{10,10,114},{11,10,642},{140,10,618},{6,0
+,137},{9,0,75},{9,0,253},{10,0,194},{138,0,444},{4,0,756},{133,10,5},{8,0,1008},
+{135,10,192},{132,0,842},{11,0,643},{12,0,115},{136,10,763},{139,0,67},{133,10,
+759},{4,0,821},{5,0,760},{7,0,542},{8,0,135},{8,0,496},{135,11,580},{7,10,370},{
+7,10,1007},{7,10,1177},{135,10,1565},{135,10,1237},{140,0,736},{7,0,319},{7,0,
+355},{7,0,763},{10,0,389},{145,0,43},{8,11,333},{138,11,182},{4,10,87},{5,10,250
+},{141,10,298},{138,0,786},{134,0,2044},{8,11,330},{140,11,477},{135,11,1338},{
+132,11,125},{134,0,1030},{134,0,1083},{132,11,721},{135,10,814},{7,11,776},{8,11
+,145},{147,11,56},{134,0,1226},{4,10,57},{7,10,1195},{7,10,1438},{7,10,1548},{7,
+10,1835},{7,10,1904},{9,10,757},{10,10,604},{139,10,519},{7,11,792},{8,11,147},{
+10,11,821},{139,11,1021},{137,11,797},{4,0,58},{5,0,286},{6,0,319},{7,0,402},{7,
+0,1254},{7,0,1903},{8,0,356},{140,0,408},{4,0,389},{4,0,815},{9,0,181},{9,0,255}
+,{10,0,8},{10,0,29},{10,0,816},{11,0,311},{11,0,561},{12,0,67},{141,0,181},{7,11
+,1472},{135,11,1554},{7,11,1071},{7,11,1541},{7,11,1767},{7,11,1806},{7,11,1999}
+,{9,11,248},{10,11,400},{11,11,162},{11,11,178},{11,11,242},{12,11,605},{15,11,
+26},{144,11,44},{5,11,168},{5,11,930},{8,11,74},{9,11,623},{12,11,500},{12,11,
+579},{13,11,41},{143,11,93},{6,11,220},{7,11,1101},{141,11,105},{5,0,474},{7,0,
+507},{4,10,209},{7,11,507},{135,10,902},{132,0,427},{6,0,413},{7,10,335},{7,10,
+1437},{7,10,1668},{8,10,553},{8,10,652},{8,10,656},{9,10,558},{11,10,743},{149,
+10,18},{132,0,730},{6,11,19},{7,11,1413},{139,11,428},{133,0,373},{132,10,559},{
+7,11,96},{8,11,401},{137,11,896},{7,0,799},{7,0,1972},{5,10,1017},{138,10,511},{
+135,0,1793},{7,11,1961},{7,11,1965},{8,11,702},{136,11,750},{8,11,150},{8,11,737
+},{140,11,366},{132,0,322},{133,10,709},{8,11,800},{9,11,148},{9,11,872},{9,11,
+890},{11,11,309},{11,11,1001},{13,11,267},{141,11,323},{134,10,1745},{7,0,290},{
+136,10,206},{7,0,1651},{145,0,89},{139,0,2},{132,0,672},{6,0,1860},{8,0,905},{10
+,0,844},{10,0,846},{10,0,858},{12,0,699},{12,0,746},{140,0,772},{135,11,424},{
+133,11,547},{133,0,737},{5,11,490},{6,11,615},{6,11,620},{135,11,683},{6,0,746},
+{134,0,1612},{132,10,776},{9,11,385},{149,11,17},{133,0,145},{135,10,1272},{7,0,
+884},{140,0,124},{4,0,387},{135,0,1288},{5,11,133},{136,10,406},{136,11,187},{6,
+0,679},{8,11,8},{138,11,0},{135,0,550},{135,11,798},{136,11,685},{7,11,1086},{
+145,11,46},{8,10,175},{10,10,168},{138,10,573},{135,0,1305},{4,0,576},{135,0,
+1263},{6,0,686},{134,0,1563},{134,0,607},{5,0,919},{134,0,1673},{148,0,37},{8,11
+,774},{10,11,670},{140,11,51},{133,10,784},{139,10,882},{4,0,82},{5,0,333},{5,0,
+904},{6,0,207},{7,0,325},{7,0,1726},{8,0,101},{10,0,778},{139,0,220},{135,11,371
+},{132,0,958},{133,0,903},{4,11,127},{5,11,350},{6,11,356},{8,11,426},{9,11,572}
+,{10,11,247},{139,11,312},{140,0,147},{6,11,59},{7,11,885},{9,11,603},{141,11,
+397},{10,0,367},{9,10,14},{9,10,441},{139,10,9},{11,10,966},{12,10,287},{13,10,
+342},{13,10,402},{15,10,110},{143,10,163},{134,0,690},{132,0,705},{9,0,651},{11,
+0,971},{13,0,273},{7,10,1428},{7,10,1640},{7,10,1867},{9,10,169},{9,10,182},{9,
+10,367},{9,10,478},{9,10,506},{9,10,551},{9,10,557},{9,10,648},{9,10,697},{9,10,
+705},{9,10,725},{9,10,787},{9,10,794},{10,10,198},{10,10,214},{10,10,267},{10,10
+,275},{10,10,456},{10,10,551},{10,10,561},{10,10,613},{10,10,627},{10,10,668},{
+10,10,675},{10,10,691},{10,10,695},{10,10,707},{10,10,715},{11,10,183},{11,10,
+201},{11,10,262},{11,10,352},{11,10,439},{11,10,493},{11,10,572},{11,10,591},{11
+,10,608},{11,10,611},{11,10,646},{11,10,674},{11,10,711},{11,10,751},{11,10,761}
+,{11,10,776},{11,10,785},{11,10,850},{11,10,853},{11,10,862},{11,10,865},{11,10,
+868},{11,10,875},{11,10,898},{11,10,902},{11,10,903},{11,10,910},{11,10,932},{11
+,10,942},{11,10,957},{11,10,967},{11,10,972},{12,10,148},{12,10,195},{12,10,220}
+,{12,10,237},{12,10,318},{12,10,339},{12,10,393},{12,10,445},{12,10,450},{12,10,
+474},{12,10,505},{12,10,509},{12,10,533},{12,10,591},{12,10,594},{12,10,597},{12
+,10,621},{12,10,633},{12,10,642},{13,10,59},{13,10,60},{13,10,145},{13,10,239},{
+13,10,250},{13,10,329},{13,10,344},{13,10,365},{13,10,372},{13,10,387},{13,10,
+403},{13,10,414},{13,10,456},{13,10,470},{13,10,478},{13,10,483},{13,10,489},{14
+,10,55},{14,10,57},{14,10,81},{14,10,90},{14,10,148},{14,10,239},{14,10,266},{14
+,10,321},{14,10,326},{14,10,327},{14,10,330},{14,10,347},{14,10,355},{14,10,401}
+,{14,10,404},{14,10,411},{14,10,414},{14,10,416},{14,10,420},{15,10,61},{15,10,
+74},{15,10,87},{15,10,88},{15,10,94},{15,10,96},{15,10,116},{15,10,149},{15,10,
+154},{16,10,50},{16,10,63},{16,10,73},{17,10,2},{17,10,66},{17,10,92},{17,10,103
+},{17,10,112},{17,10,120},{18,10,50},{18,10,54},{18,10,82},{18,10,86},{18,10,90}
+,{18,10,111},{18,10,115},{18,10,156},{19,10,40},{19,10,79},{20,10,78},{149,10,22
+},{7,0,887},{5,10,161},{135,10,839},{142,11,98},{134,0,90},{138,11,356},{135,11,
+441},{6,11,111},{7,11,4},{8,11,163},{8,11,776},{138,11,566},{134,0,908},{134,0,
+1261},{7,0,813},{12,0,497},{141,0,56},{134,0,1235},{135,0,429},{135,11,1994},{
+138,0,904},{6,0,125},{7,0,1277},{137,0,772},{151,0,12},{4,0,841},{5,0,386},{133,
+11,386},{5,11,297},{135,11,1038},{6,0,860},{6,0,1069},{135,11,309},{136,0,946},{
+135,10,1814},{141,11,418},{136,11,363},{10,0,768},{139,0,787},{22,11,30},{150,11
+,33},{6,0,160},{7,0,1106},{9,0,770},{11,0,112},{140,0,413},{11,11,216},{139,11,
+340},{136,10,139},{135,11,1390},{135,11,808},{132,11,280},{12,0,271},{17,0,109},
+{7,10,643},{136,10,236},{140,11,54},{4,11,421},{133,11,548},{11,0,719},{12,0,36}
+,{141,0,337},{7,0,581},{9,0,644},{137,0,699},{11,11,511},{13,11,394},{14,11,298}
+,{14,11,318},{146,11,103},{7,0,304},{9,0,646},{9,0,862},{11,0,696},{12,0,208},{
+15,0,79},{147,0,108},{4,0,631},{7,0,1126},{135,0,1536},{135,11,1527},{8,0,880},{
+10,0,869},{138,0,913},{7,0,1513},{5,10,54},{6,11,254},{9,11,109},{138,11,103},{
+135,0,981},{133,11,729},{132,10,744},{132,0,434},{134,0,550},{7,0,930},{10,0,476
+},{13,0,452},{19,0,104},{6,11,1630},{10,10,402},{146,10,55},{5,0,553},{138,0,824
+},{136,0,452},{8,0,151},{137,10,624},{132,10,572},{132,0,772},{133,11,671},{133,
+0,292},{138,0,135},{132,11,889},{140,11,207},{9,0,504},{6,10,43},{7,10,38},{8,10
+,248},{138,10,513},{6,0,1089},{135,11,1910},{4,11,627},{133,11,775},{135,0,783},
+{133,10,766},{133,10,363},{7,0,387},{135,11,387},{7,0,393},{10,0,603},{11,0,206}
+,{7,11,202},{11,11,362},{11,11,948},{140,11,388},{6,11,507},{7,11,451},{8,11,389
+},{12,11,490},{13,11,16},{13,11,215},{13,11,351},{18,11,132},{147,11,125},{4,0,
+912},{9,0,232},{135,11,841},{6,10,258},{140,10,409},{5,10,249},{148,10,82},{136,
+11,566},{6,0,977},{135,11,1214},{7,0,1973},{136,0,716},{135,0,98},{133,0,733},{5
+,11,912},{134,11,1695},{5,10,393},{6,10,378},{7,10,1981},{9,10,32},{9,10,591},{
+10,10,685},{10,10,741},{142,10,382},{133,10,788},{10,0,19},{11,0,911},{7,10,1968
+},{141,10,509},{5,0,668},{5,11,236},{6,11,572},{8,11,492},{11,11,618},{144,11,56
+},{135,11,1789},{4,0,360},{5,0,635},{5,0,700},{5,10,58},{5,10,171},{5,10,683},{6
+,10,291},{6,10,566},{7,10,1650},{11,10,523},{12,10,273},{12,10,303},{15,10,39},{
+143,10,111},{133,0,901},{134,10,589},{5,11,190},{136,11,318},{140,0,656},{7,0,
+726},{152,0,9},{4,10,917},{133,10,1005},{135,10,1598},{134,11,491},{4,10,919},{
+133,11,434},{137,0,72},{6,0,1269},{6,0,1566},{134,0,1621},{9,0,463},{10,0,595},{
+4,10,255},{5,10,302},{6,10,132},{7,10,128},{7,10,283},{7,10,1299},{10,10,52},{10
+,10,514},{11,10,925},{13,10,92},{142,10,309},{135,0,1454},{134,0,1287},{11,0,600
+},{13,0,245},{137,10,173},{136,0,989},{7,0,164},{7,0,1571},{9,0,107},{140,0,225}
+,{6,0,1061},{141,10,442},{4,0,27},{5,0,484},{5,0,510},{6,0,434},{7,0,1000},{7,0,
+1098},{136,0,2},{7,11,85},{7,11,247},{8,11,585},{10,11,163},{138,11,316},{11,11,
+103},{142,11,0},{134,0,1127},{4,0,460},{134,0,852},{134,10,210},{4,0,932},{133,0
+,891},{6,0,588},{147,11,83},{8,0,625},{4,10,284},{134,10,223},{134,0,76},{8,0,92
+},{137,0,221},{4,11,124},{10,11,457},{11,11,121},{11,11,169},{11,11,422},{11,11,
+870},{12,11,214},{13,11,389},{14,11,187},{143,11,77},{9,11,618},{138,11,482},{4,
+10,218},{7,10,526},{143,10,137},{13,0,9},{14,0,104},{14,0,311},{4,10,270},{5,10,
+192},{6,10,332},{135,10,1322},{140,10,661},{135,11,1193},{6,11,107},{7,11,638},{
+7,11,1632},{137,11,396},{132,0,763},{4,0,622},{5,11,370},{134,11,1756},{133,0,
+253},{135,0,546},{9,0,73},{10,0,110},{14,0,185},{17,0,119},{133,11,204},{7,0,624
+},{7,0,916},{10,0,256},{139,0,87},{7,10,379},{8,10,481},{137,10,377},{5,0,212},{
+12,0,35},{13,0,382},{5,11,970},{134,11,1706},{9,0,746},{5,10,1003},{134,10,149},
+{10,0,150},{11,0,849},{13,0,330},{8,10,262},{9,10,627},{11,10,214},{11,10,404},{
+11,10,457},{11,10,780},{11,10,913},{13,10,401},{142,10,200},{134,0,1466},{135,11
+,3},{6,0,1299},{4,11,35},{5,11,121},{5,11,483},{5,11,685},{6,11,489},{7,11,1204}
+,{136,11,394},{135,10,742},{4,10,142},{136,10,304},{4,11,921},{133,11,1007},{134
+,0,1518},{6,0,1229},{135,0,1175},{133,0,816},{12,0,159},{4,10,471},{4,11,712},{5
+,10,51},{6,10,602},{7,10,925},{8,10,484},{138,10,195},{134,11,1629},{5,0,869},{5
+,0,968},{6,0,1626},{8,0,734},{136,0,784},{4,0,542},{6,0,1716},{6,0,1727},{7,0,
+1082},{7,0,1545},{8,0,56},{8,0,118},{8,0,412},{8,0,564},{9,0,888},{9,0,908},{10,
+0,50},{10,0,423},{11,0,685},{11,0,697},{11,0,933},{12,0,299},{13,0,126},{13,0,
+136},{13,0,170},{13,0,190},{136,10,688},{132,10,697},{4,0,232},{9,0,202},{10,0,
+474},{140,0,433},{136,0,212},{6,0,108},{7,0,1003},{7,0,1181},{8,0,111},{136,0,
+343},{5,10,221},{135,11,1255},{133,11,485},{134,0,1712},{142,0,216},{5,0,643},{6
+,0,516},{4,11,285},{5,11,317},{6,11,301},{7,11,7},{8,11,153},{10,11,766},{11,11,
+468},{12,11,467},{141,11,143},{4,0,133},{7,0,711},{7,0,1298},{135,0,1585},{134,0
+,650},{135,11,512},{6,0,99},{7,0,1808},{145,0,57},{6,0,246},{6,0,574},{7,0,428},
+{9,0,793},{10,0,669},{11,0,485},{11,0,840},{12,0,300},{14,0,250},{145,0,55},{4,
+10,132},{5,10,69},{135,10,1242},{136,0,1023},{7,0,302},{132,10,111},{135,0,1871}
+,{132,0,728},{9,0,252},{132,10,767},{6,0,461},{7,0,1590},{7,10,1416},{7,10,2005}
+,{8,10,131},{8,10,466},{9,10,672},{13,10,252},{148,10,103},{6,0,323},{135,0,1564
+},{7,0,461},{136,0,775},{6,10,44},{136,10,368},{139,0,172},{132,0,464},{4,10,570
+},{133,10,120},{137,11,269},{6,10,227},{135,10,1589},{6,11,1719},{6,11,1735},{7,
+11,2016},{7,11,2020},{8,11,837},{137,11,852},{7,0,727},{146,0,73},{132,0,1023},{
+135,11,852},{135,10,1529},{136,0,577},{138,11,568},{134,0,1037},{8,11,67},{138,
+11,419},{4,0,413},{5,0,677},{8,0,432},{140,0,280},{10,0,600},{6,10,1667},{7,11,
+967},{7,10,2036},{141,11,11},{6,10,511},{140,10,132},{6,0,799},{5,10,568},{6,10,
+138},{135,10,1293},{8,0,159},{4,10,565},{136,10,827},{7,0,646},{7,0,1730},{11,0,
+446},{141,0,178},{4,10,922},{133,10,1023},{135,11,11},{132,0,395},{11,0,145},{
+135,10,1002},{9,0,174},{10,0,164},{11,0,440},{11,0,514},{11,0,841},{15,0,98},{
+149,0,20},{134,0,426},{10,0,608},{139,0,1002},{7,11,320},{8,11,51},{12,11,481},{
+12,11,570},{148,11,106},{9,0,977},{9,0,983},{132,11,445},{138,0,250},{139,0,100}
+,{6,0,1982},{136,10,402},{133,11,239},{4,10,716},{141,10,31},{5,0,476},{7,11,83}
+,{7,11,1990},{8,11,130},{139,11,720},{8,10,691},{136,10,731},{5,11,123},{6,11,
+530},{7,11,348},{135,11,1419},{5,0,76},{6,0,458},{6,0,497},{7,0,868},{9,0,658},{
+10,0,594},{11,0,173},{11,0,566},{12,0,20},{12,0,338},{141,0,200},{9,11,139},{10,
+11,399},{11,11,469},{12,11,634},{141,11,223},{9,10,840},{138,10,803},{133,10,847
+},{11,11,223},{140,11,168},{132,11,210},{8,0,447},{9,10,53},{9,10,268},{9,10,901
+},{10,10,518},{10,10,829},{11,10,188},{13,10,74},{14,10,46},{15,10,17},{15,10,33
+},{17,10,40},{18,10,36},{19,10,20},{22,10,1},{152,10,2},{4,0,526},{7,0,1029},{
+135,0,1054},{19,11,59},{150,11,2},{4,0,636},{6,0,1875},{6,0,1920},{9,0,999},{12,
+0,807},{12,0,825},{15,0,179},{15,0,190},{18,0,182},{136,10,532},{6,0,1699},{7,0,
+660},{7,0,1124},{17,0,31},{19,0,22},{151,0,14},{135,10,681},{132,11,430},{140,10
+,677},{4,10,684},{136,10,384},{132,11,756},{133,11,213},{7,0,188},{7,10,110},{8,
+10,290},{8,10,591},{9,10,382},{9,10,649},{11,10,71},{11,10,155},{11,10,313},{12,
+10,5},{13,10,325},{142,10,287},{7,10,360},{7,10,425},{9,10,66},{9,10,278},{138,
+10,644},{142,11,164},{4,0,279},{7,0,301},{137,0,362},{134,11,586},{135,0,1743},{
+4,0,178},{133,0,399},{4,10,900},{133,10,861},{5,10,254},{7,10,985},{136,10,73},{
+133,11,108},{7,10,1959},{136,10,683},{133,11,219},{4,11,193},{5,11,916},{7,11,
+364},{10,11,398},{10,11,726},{11,11,317},{11,11,626},{12,11,142},{12,11,288},{12
+,11,678},{13,11,313},{15,11,113},{18,11,114},{21,11,30},{150,11,53},{6,11,241},{
+7,11,907},{8,11,832},{9,11,342},{10,11,729},{11,11,284},{11,11,445},{11,11,651},
+{11,11,863},{13,11,398},{146,11,99},{132,0,872},{134,0,831},{134,0,1692},{6,0,
+202},{6,0,1006},{9,0,832},{10,0,636},{11,0,208},{12,0,360},{17,0,118},{18,0,27},
+{20,0,67},{137,11,734},{132,10,725},{7,11,993},{138,11,666},{134,0,1954},{134,10
+,196},{7,0,872},{10,0,516},{139,0,167},{133,10,831},{4,11,562},{9,11,254},{139,
+11,879},{137,0,313},{4,0,224},{132,11,786},{11,0,24},{12,0,170},{136,10,723},{5,
+0,546},{7,0,35},{8,0,11},{8,0,12},{9,0,315},{9,0,533},{10,0,802},{11,0,166},{12,
+0,525},{142,0,243},{7,0,1937},{13,10,80},{13,10,437},{145,10,74},{5,0,241},{8,0,
+242},{9,0,451},{10,0,667},{11,0,598},{140,0,429},{150,0,46},{6,0,1273},{137,0,
+830},{5,10,848},{6,10,66},{136,10,764},{6,0,825},{134,0,993},{4,0,1006},{10,0,
+327},{13,0,271},{4,10,36},{7,10,1387},{139,10,755},{134,0,1023},{135,0,1580},{4,
+0,366},{137,0,516},{132,10,887},{6,0,1736},{135,0,1891},{6,11,216},{7,11,901},{7
+,11,1343},{136,11,493},{6,10,165},{138,10,388},{7,11,341},{139,11,219},{4,10,719
+},{135,10,155},{134,0,1935},{132,0,826},{6,0,331},{6,0,1605},{8,0,623},{11,0,139
+},{139,0,171},{135,11,1734},{10,11,115},{11,11,420},{12,11,154},{13,11,404},{14,
+11,346},{15,11,54},{143,11,112},{7,0,288},{4,10,353},{6,10,146},{6,10,1789},{7,
+10,990},{7,10,1348},{9,10,665},{9,10,898},{11,10,893},{142,10,212},{6,0,916},{
+134,0,1592},{7,0,1888},{4,10,45},{135,10,1257},{5,11,1011},{136,11,701},{139,11,
+596},{4,11,54},{5,11,666},{7,11,1039},{7,11,1130},{9,11,195},{138,11,302},{134,0
+,1471},{134,0,1570},{132,0,394},{140,10,65},{136,10,816},{135,0,1931},{7,0,574},
+{135,0,1719},{134,11,467},{132,0,658},{9,0,781},{10,0,144},{11,0,385},{13,0,161}
+,{13,0,228},{13,0,268},{20,0,107},{134,11,1669},{136,0,374},{135,0,735},{4,0,344
+},{6,0,498},{139,0,323},{7,0,586},{7,0,1063},{6,10,559},{134,10,1691},{137,0,155
+},{133,0,906},{7,11,122},{9,11,259},{10,11,84},{11,11,470},{12,11,541},{141,11,
+379},{134,0,1139},{10,0,108},{139,0,116},{134,10,456},{133,10,925},{5,11,82},{5,
+11,131},{7,11,1755},{8,11,31},{9,11,168},{9,11,764},{139,11,869},{134,11,605},{5
+,11,278},{137,11,68},{4,11,163},{5,11,201},{5,11,307},{5,11,310},{6,11,335},{7,
+11,284},{136,11,165},{135,11,1660},{6,11,33},{135,11,1244},{4,0,616},{136,11,483
+},{8,0,857},{8,0,902},{8,0,910},{10,0,879},{12,0,726},{4,11,199},{139,11,34},{
+136,0,692},{6,10,193},{7,10,240},{7,10,1682},{10,10,51},{10,10,640},{11,10,410},
+{13,10,82},{14,10,247},{14,10,331},{142,10,377},{6,0,823},{134,0,983},{139,10,
+411},{132,0,305},{136,10,633},{138,11,203},{134,0,681},{6,11,326},{7,11,677},{
+137,11,425},{5,0,214},{7,0,603},{8,0,611},{9,0,686},{10,0,88},{11,0,459},{11,0,
+496},{12,0,463},{12,0,590},{141,0,0},{136,0,1004},{142,0,23},{134,0,1703},{147,
+11,8},{145,11,56},{135,0,1443},{4,10,237},{135,10,514},{6,0,714},{145,0,19},{5,
+11,358},{7,11,473},{7,11,1184},{10,11,662},{13,11,212},{13,11,304},{13,11,333},{
+145,11,98},{4,0,737},{10,0,98},{11,0,294},{12,0,60},{12,0,437},{13,0,64},{13,0,
+380},{142,0,430},{6,10,392},{7,10,65},{135,10,2019},{6,0,1758},{8,0,520},{9,0,
+345},{9,0,403},{142,0,350},{5,0,47},{10,0,242},{138,0,579},{5,0,139},{7,0,1168},
+{138,0,539},{134,0,1459},{13,0,388},{141,11,388},{134,0,253},{7,10,1260},{135,10
+,1790},{10,0,252},{9,10,222},{139,10,900},{140,0,745},{133,11,946},{4,0,107},{7,
+0,613},{8,0,439},{8,0,504},{9,0,501},{10,0,383},{139,0,477},{135,11,1485},{132,0
+,871},{7,11,411},{7,11,590},{8,11,631},{9,11,323},{10,11,355},{11,11,491},{12,11
+,143},{12,11,402},{13,11,73},{14,11,408},{15,11,107},{146,11,71},{132,0,229},{
+132,0,903},{140,0,71},{133,0,549},{4,0,47},{6,0,373},{7,0,452},{7,0,543},{7,0,
+1828},{7,0,1856},{9,0,6},{11,0,257},{139,0,391},{7,11,1467},{8,11,328},{10,11,
+544},{11,11,955},{13,11,320},{145,11,83},{5,0,980},{134,0,1754},{136,0,865},{5,0
+,705},{137,0,606},{7,0,161},{8,10,201},{136,10,605},{143,11,35},{5,11,835},{6,11
+,483},{140,10,224},{7,0,536},{7,0,1331},{136,0,143},{134,0,1388},{5,0,724},{10,0
+,305},{11,0,151},{12,0,33},{12,0,121},{12,0,381},{17,0,3},{17,0,27},{17,0,78},{
+18,0,18},{19,0,54},{149,0,5},{4,10,523},{133,10,638},{5,0,19},{134,0,533},{5,0,
+395},{5,0,951},{134,0,1776},{135,0,1908},{132,0,846},{10,0,74},{11,0,663},{12,0,
+210},{13,0,166},{13,0,310},{14,0,373},{18,0,95},{19,0,43},{6,10,242},{7,10,227},
+{7,10,1581},{8,10,104},{9,10,113},{9,10,220},{9,10,427},{10,10,239},{11,10,579},
+{11,10,1023},{13,10,4},{13,10,204},{13,10,316},{148,10,86},{9,11,716},{11,11,108
+},{13,11,123},{14,11,252},{19,11,38},{21,11,3},{151,11,11},{8,0,372},{9,0,122},{
+138,0,175},{132,11,677},{7,11,1374},{136,11,540},{135,10,861},{132,0,695},{7,0,
+497},{9,0,387},{147,0,81},{136,0,937},{134,0,718},{7,0,1328},{136,10,494},{132,
+11,331},{6,0,1581},{133,11,747},{5,0,284},{6,0,49},{6,0,350},{7,0,1},{7,0,377},{
+7,0,1693},{8,0,18},{8,0,678},{9,0,161},{9,0,585},{9,0,671},{9,0,839},{11,0,912},
+{141,0,427},{7,10,1306},{8,10,505},{9,10,482},{10,10,126},{11,10,225},{12,10,347
+},{12,10,449},{13,10,19},{14,10,218},{142,10,435},{10,10,764},{12,10,120},{13,10
+,39},{145,10,127},{4,0,597},{133,10,268},{134,0,1094},{4,0,1008},{134,0,1973},{
+132,0,811},{139,0,908},{135,0,1471},{133,11,326},{4,10,384},{135,10,1022},{7,0,
+1935},{8,0,324},{12,0,42},{4,11,691},{7,11,1935},{8,11,324},{9,11,35},{10,11,680
+},{11,11,364},{12,11,42},{13,11,357},{146,11,16},{135,0,2014},{7,0,2007},{9,0,
+101},{9,0,450},{10,0,66},{10,0,842},{11,0,536},{12,0,587},{6,11,32},{7,11,385},{
+7,11,757},{7,11,1916},{8,11,37},{8,11,94},{8,11,711},{9,11,541},{10,11,162},{10,
+11,795},{11,11,989},{11,11,1010},{12,11,14},{142,11,308},{139,0,586},{135,10,
+1703},{7,0,1077},{11,0,28},{9,10,159},{140,10,603},{6,0,1221},{136,10,583},{6,11
+,152},{6,11,349},{6,11,1682},{7,11,1252},{8,11,112},{9,11,435},{9,11,668},{10,11
+,290},{10,11,319},{10,11,815},{11,11,180},{11,11,837},{12,11,240},{13,11,152},{
+13,11,219},{142,11,158},{139,0,62},{132,10,515},{8,10,632},{8,10,697},{137,10,
+854},{134,0,1766},{132,11,581},{6,11,126},{7,11,573},{8,11,397},{142,11,44},{150
+,0,28},{11,0,670},{22,0,25},{4,10,136},{133,10,551},{6,0,1665},{7,0,256},{7,0,
+1388},{138,0,499},{4,0,22},{5,0,10},{7,0,1576},{136,0,97},{134,10,1782},{5,0,481
+},{7,10,1287},{9,10,44},{10,10,552},{10,10,642},{11,10,839},{12,10,274},{12,10,
+275},{12,10,372},{13,10,91},{142,10,125},{133,11,926},{7,11,1232},{137,11,531},{
+6,0,134},{7,0,437},{7,0,1824},{9,0,37},{14,0,285},{142,0,371},{7,0,486},{8,0,155
+},{11,0,93},{140,0,164},{6,0,1391},{134,0,1442},{133,11,670},{133,0,591},{6,10,
+147},{7,10,886},{7,11,1957},{9,10,753},{138,10,268},{5,0,380},{5,0,650},{7,0,
+1173},{136,0,310},{4,0,364},{7,0,1156},{7,0,1187},{137,0,409},{135,11,1621},{134
+,0,482},{133,11,506},{4,0,781},{6,0,487},{7,0,926},{8,0,263},{139,0,500},{138,10
+,137},{135,11,242},{139,11,96},{133,10,414},{135,10,1762},{134,0,804},{5,11,834}
+,{7,11,1202},{8,11,14},{9,11,481},{137,11,880},{134,10,599},{4,0,94},{135,0,1265
+},{4,0,415},{132,0,417},{5,0,348},{6,0,522},{6,10,1749},{7,11,1526},{138,11,465}
+,{134,10,1627},{132,0,1012},{132,10,488},{4,11,357},{6,11,172},{7,11,143},{137,
+11,413},{4,10,83},{4,11,590},{146,11,76},{140,10,676},{7,11,287},{8,11,355},{9,
+11,293},{137,11,743},{134,10,278},{6,0,1803},{18,0,165},{24,0,21},{5,11,169},{7,
+11,333},{136,11,45},{12,10,97},{140,11,97},{4,0,408},{4,0,741},{135,0,500},{132,
+11,198},{7,10,388},{7,10,644},{139,10,781},{4,11,24},{5,11,140},{5,11,185},{7,11
+,1500},{11,11,565},{139,11,838},{6,0,1321},{9,0,257},{7,10,229},{8,10,59},{9,10,
+190},{10,10,378},{140,10,191},{4,11,334},{133,11,593},{135,11,1885},{134,0,1138}
+,{4,0,249},{6,0,73},{135,0,177},{133,0,576},{142,0,231},{137,0,288},{132,10,660}
+,{7,10,1035},{138,10,737},{135,0,1487},{6,0,989},{9,0,433},{7,10,690},{9,10,587}
+,{140,10,521},{7,0,1264},{7,0,1678},{11,0,945},{12,0,341},{12,0,471},{140,0,569}
+,{132,11,709},{133,11,897},{5,11,224},{13,11,174},{146,11,52},{135,11,1840},{134
+,10,1744},{12,0,87},{16,0,74},{4,10,733},{9,10,194},{10,10,92},{11,10,198},{12,
+10,84},{141,10,128},{140,0,779},{135,0,538},{4,11,608},{133,11,497},{133,0,413},
+{7,11,1375},{7,11,1466},{138,11,331},{136,0,495},{6,11,540},{136,11,136},{7,0,54
+},{8,0,312},{10,0,191},{10,0,614},{140,0,567},{6,0,468},{7,0,567},{7,0,1478},{8,
+0,530},{14,0,290},{133,11,999},{4,11,299},{7,10,306},{135,11,1004},{142,11,296},
+{134,0,1484},{133,10,979},{6,0,609},{9,0,815},{12,11,137},{14,11,9},{14,11,24},{
+142,11,64},{133,11,456},{6,0,484},{135,0,822},{133,10,178},{136,11,180},{132,11,
+755},{137,0,900},{135,0,1335},{6,0,1724},{135,0,2022},{135,11,1139},{5,0,640},{
+132,10,390},{6,0,1831},{138,11,633},{135,11,566},{4,11,890},{5,11,805},{5,11,819
+},{5,11,961},{6,11,396},{6,11,1631},{6,11,1678},{7,11,1967},{7,11,2041},{9,11,
+630},{11,11,8},{11,11,1019},{12,11,176},{13,11,225},{14,11,292},{149,11,24},{132
+,0,474},{134,0,1103},{135,0,1504},{134,0,1576},{6,0,961},{6,0,1034},{140,0,655},
+{11,11,514},{149,11,20},{5,0,305},{135,11,1815},{7,11,1505},{10,11,190},{10,11,
+634},{11,11,792},{12,11,358},{140,11,447},{5,11,0},{6,11,536},{7,11,604},{13,11,
+445},{145,11,126},{7,0,1236},{133,10,105},{4,0,480},{6,0,217},{6,0,302},{6,0,
+1642},{7,0,130},{7,0,837},{7,0,1321},{7,0,1547},{7,0,1657},{8,0,429},{9,0,228},{
+13,0,289},{13,0,343},{19,0,101},{6,11,232},{6,11,412},{7,11,1074},{8,11,9},{8,11
+,157},{8,11,786},{9,11,196},{9,11,352},{9,11,457},{10,11,337},{11,11,232},{11,11
+,877},{12,11,480},{140,11,546},{5,10,438},{7,11,958},{9,10,694},{12,10,627},{13,
+11,38},{141,10,210},{4,11,382},{136,11,579},{7,0,278},{10,0,739},{11,0,708},{141
+,0,348},{4,11,212},{135,11,1206},{135,11,1898},{6,0,708},{6,0,1344},{152,10,11},
+{137,11,768},{134,0,1840},{140,0,233},{8,10,25},{138,10,826},{6,0,2017},{133,11,
+655},{6,0,1488},{139,11,290},{132,10,308},{134,0,1590},{134,0,1800},{134,0,1259}
+,{16,0,28},{6,11,231},{7,11,95},{136,11,423},{133,11,300},{135,10,150},{136,10,
+649},{7,11,1874},{137,11,641},{6,11,237},{7,11,611},{8,11,100},{9,11,416},{11,11
+,335},{12,11,173},{146,11,101},{137,0,45},{134,10,521},{17,0,36},{14,11,26},{146
+,11,150},{7,0,1442},{14,0,22},{5,10,339},{15,10,41},{15,10,166},{147,10,66},{8,0
+,378},{6,11,581},{135,11,1119},{134,0,1507},{147,11,117},{139,0,39},{134,0,1054}
+,{6,0,363},{7,0,1955},{136,0,725},{134,0,2036},{133,11,199},{6,0,1871},{9,0,935}
+,{9,0,961},{9,0,1004},{9,0,1016},{12,0,805},{12,0,852},{12,0,853},{12,0,869},{12
+,0,882},{12,0,896},{12,0,906},{12,0,917},{12,0,940},{15,0,170},{15,0,176},{15,0,
+188},{15,0,201},{15,0,205},{15,0,212},{15,0,234},{15,0,244},{18,0,181},{18,0,193
+},{18,0,196},{18,0,201},{18,0,202},{18,0,210},{18,0,217},{18,0,235},{18,0,236},{
+18,0,237},{21,0,54},{21,0,55},{21,0,58},{21,0,59},{152,0,22},{134,10,1628},{137,
+0,805},{5,0,813},{135,0,2046},{142,11,42},{5,0,712},{6,0,1240},{11,0,17},{13,0,
+321},{144,0,67},{132,0,617},{135,10,829},{6,0,320},{7,0,781},{7,0,1921},{9,0,55}
+,{10,0,186},{10,0,273},{10,0,664},{10,0,801},{11,0,996},{11,0,997},{13,0,157},{
+142,0,170},{136,0,271},{5,10,486},{135,10,1349},{18,11,91},{147,11,70},{10,0,445
+},{7,10,1635},{8,10,17},{138,10,295},{136,11,404},{7,0,103},{7,0,863},{11,0,184}
+,{145,0,62},{138,10,558},{137,0,659},{6,11,312},{6,11,1715},{10,11,584},{11,11,
+546},{11,11,692},{12,11,259},{12,11,295},{13,11,46},{141,11,154},{134,0,676},{
+132,11,588},{4,11,231},{5,11,61},{6,11,104},{7,11,729},{7,11,964},{7,11,1658},{
+140,11,414},{6,11,263},{138,11,757},{11,0,337},{142,0,303},{135,11,1363},{132,11
+,320},{140,0,506},{134,10,447},{5,0,77},{7,0,1455},{10,0,843},{147,0,73},{7,10,
+577},{7,10,1432},{9,10,475},{9,10,505},{9,10,526},{9,10,609},{9,10,689},{9,10,
+726},{9,10,735},{9,10,738},{10,10,556},{10,10,674},{10,10,684},{11,10,89},{11,10
+,202},{11,10,272},{11,10,380},{11,10,415},{11,10,505},{11,10,537},{11,10,550},{
+11,10,562},{11,10,640},{11,10,667},{11,10,688},{11,10,847},{11,10,927},{11,10,
+930},{11,10,940},{12,10,144},{12,10,325},{12,10,329},{12,10,389},{12,10,403},{12
+,10,451},{12,10,515},{12,10,604},{12,10,616},{12,10,626},{13,10,66},{13,10,131},
+{13,10,167},{13,10,236},{13,10,368},{13,10,411},{13,10,434},{13,10,453},{13,10,
+461},{13,10,474},{14,10,59},{14,10,60},{14,10,139},{14,10,152},{14,10,276},{14,
+10,353},{14,10,402},{15,10,28},{15,10,81},{15,10,123},{15,10,152},{18,10,136},{
+148,10,88},{132,0,458},{135,0,1420},{6,0,109},{10,0,382},{4,11,405},{4,10,609},{
+7,10,756},{7,11,817},{9,10,544},{11,10,413},{14,11,58},{14,10,307},{16,10,25},{
+17,11,37},{146,11,124},{6,0,330},{7,0,1084},{11,0,142},{133,11,974},{4,10,930},{
+133,10,947},{5,10,939},{142,11,394},{16,0,91},{145,0,87},{5,11,235},{5,10,962},{
+7,11,1239},{11,11,131},{140,11,370},{11,0,492},{5,10,651},{8,10,170},{9,10,61},{
+9,10,63},{10,10,23},{10,10,37},{10,10,834},{11,10,4},{11,10,281},{11,10,503},{11
+,10,677},{12,10,96},{12,10,130},{12,10,244},{14,10,5},{14,10,40},{14,10,162},{14
+,10,202},{146,10,133},{4,10,406},{5,10,579},{12,10,492},{150,10,15},{9,11,137},{
+138,11,221},{134,0,1239},{11,0,211},{140,0,145},{7,11,390},{138,11,140},{135,11,
+1418},{135,11,1144},{134,0,1049},{7,0,321},{6,10,17},{7,10,1001},{7,10,1982},{9,
+10,886},{10,10,489},{10,10,800},{11,10,782},{12,10,320},{13,10,467},{14,10,145},
+{14,10,387},{143,10,119},{145,10,17},{5,11,407},{11,11,489},{19,11,37},{20,11,73
+},{150,11,38},{133,10,458},{135,0,1985},{7,10,1983},{8,10,0},{8,10,171},{9,10,
+120},{9,10,732},{10,10,473},{11,10,656},{11,10,998},{18,10,0},{18,10,2},{147,10,
+21},{5,11,325},{7,11,1483},{8,11,5},{8,11,227},{9,11,105},{10,11,585},{140,11,
+614},{136,0,122},{132,0,234},{135,11,1196},{6,0,976},{6,0,1098},{134,0,1441},{7,
+0,253},{136,0,549},{6,11,621},{13,11,504},{144,11,19},{132,10,519},{5,0,430},{5,
+0,932},{6,0,131},{7,0,417},{9,0,522},{11,0,314},{141,0,390},{14,0,149},{14,0,399
+},{143,0,57},{5,10,907},{6,10,31},{6,11,218},{7,10,491},{7,10,530},{8,10,592},{
+11,10,53},{11,10,779},{12,10,167},{12,10,411},{14,10,14},{14,10,136},{15,10,72},
+{16,10,17},{144,10,72},{140,11,330},{7,11,454},{7,11,782},{136,11,768},{132,0,
+507},{10,11,676},{140,11,462},{6,0,630},{9,0,811},{4,10,208},{5,10,106},{6,10,
+531},{8,10,408},{9,10,188},{138,10,572},{4,0,343},{5,0,511},{134,10,1693},{134,
+11,164},{132,0,448},{7,0,455},{138,0,591},{135,0,1381},{12,10,441},{150,11,50},{
+9,10,449},{10,10,192},{138,10,740},{6,0,575},{132,10,241},{134,0,1175},{134,0,
+653},{134,0,1761},{134,0,1198},{132,10,259},{6,11,343},{7,11,195},{9,11,226},{10
+,11,197},{10,11,575},{11,11,502},{139,11,899},{7,0,1127},{7,0,1572},{10,0,297},{
+10,0,422},{11,0,764},{11,0,810},{12,0,264},{13,0,102},{13,0,300},{13,0,484},{14,
+0,147},{14,0,229},{17,0,71},{18,0,118},{147,0,120},{135,11,666},{132,0,678},{4,
+10,173},{5,10,312},{5,10,512},{135,10,1285},{7,10,1603},{7,10,1691},{9,10,464},{
+11,10,195},{12,10,279},{12,10,448},{14,10,11},{147,10,102},{16,0,99},{146,0,164}
+,{7,11,1125},{9,11,143},{11,11,61},{14,11,405},{150,11,21},{137,11,260},{4,10,
+452},{5,10,583},{5,10,817},{6,10,433},{7,10,593},{7,10,720},{7,10,1378},{8,10,
+161},{9,10,284},{10,10,313},{139,10,886},{132,10,547},{136,10,722},{14,0,35},{
+142,0,191},{141,0,45},{138,0,121},{132,0,125},{134,0,1622},{133,11,959},{8,10,
+420},{139,10,193},{132,0,721},{135,10,409},{136,0,145},{7,0,792},{8,0,147},{10,0
+,821},{11,0,970},{11,0,1021},{136,11,173},{134,11,266},{132,0,715},{7,0,1999},{
+138,10,308},{133,0,531},{5,0,168},{5,0,930},{8,0,74},{9,0,623},{12,0,500},{140,0
+,579},{144,0,65},{138,11,246},{6,0,220},{7,0,1101},{13,0,105},{142,11,314},{5,10
+,1002},{136,10,745},{134,0,960},{20,0,0},{148,11,0},{4,0,1005},{4,10,239},{6,10,
+477},{7,10,1607},{11,10,68},{139,10,617},{6,0,19},{7,0,1413},{139,0,428},{149,10
+,13},{7,0,96},{8,0,401},{8,0,703},{9,0,896},{136,11,300},{134,0,1595},{145,0,116
+},{136,0,1021},{7,0,1961},{7,0,1965},{7,0,2030},{8,0,150},{8,0,702},{8,0,737},{8
+,0,750},{140,0,366},{11,11,75},{142,11,267},{132,10,367},{8,0,800},{9,0,148},{9,
+0,872},{9,0,890},{11,0,309},{11,0,1001},{13,0,267},{13,0,323},{5,11,427},{5,11,
+734},{7,11,478},{136,11,52},{7,11,239},{11,11,217},{142,11,165},{132,11,323},{
+140,11,419},{13,0,299},{142,0,75},{6,11,87},{6,11,1734},{7,11,20},{7,11,1056},{8
+,11,732},{9,11,406},{9,11,911},{138,11,694},{134,0,1383},{132,10,694},{133,11,
+613},{137,0,779},{4,0,598},{140,10,687},{6,0,970},{135,0,424},{133,0,547},{7,11,
+32},{7,11,984},{8,11,85},{8,11,709},{9,11,579},{9,11,847},{9,11,856},{10,11,799}
+,{11,11,258},{11,11,1007},{12,11,331},{12,11,615},{13,11,188},{13,11,435},{14,11
+,8},{15,11,165},{16,11,27},{148,11,40},{6,0,1222},{134,0,1385},{132,0,876},{138,
+11,151},{135,10,213},{4,11,167},{135,11,82},{133,0,133},{6,11,24},{7,11,74},{7,
+11,678},{137,11,258},{5,11,62},{6,11,534},{7,11,684},{7,11,1043},{7,11,1072},{8,
+11,280},{8,11,541},{8,11,686},{10,11,519},{11,11,252},{140,11,282},{136,0,187},{
+8,0,8},{10,0,0},{10,0,818},{139,0,988},{132,11,359},{11,0,429},{15,0,51},{135,10
+,1672},{136,0,685},{5,11,211},{7,11,88},{136,11,627},{134,0,472},{136,0,132},{6,
+11,145},{141,11,336},{4,10,751},{11,10,390},{140,10,32},{6,0,938},{6,0,1060},{4,
+11,263},{4,10,409},{133,10,78},{137,0,874},{8,0,774},{10,0,670},{12,0,51},{4,11,
+916},{6,10,473},{7,10,1602},{10,10,698},{12,10,212},{13,10,307},{145,10,105},{
+146,0,92},{143,10,156},{132,0,830},{137,0,701},{4,11,599},{6,11,1634},{7,11,5},{
+7,11,55},{7,11,67},{7,11,97},{7,11,691},{7,11,979},{7,11,1697},{8,11,207},{8,11,
+214},{8,11,231},{8,11,294},{8,11,336},{8,11,428},{8,11,451},{8,11,460},{8,11,471
+},{8,11,622},{8,11,626},{8,11,679},{8,11,759},{8,11,829},{9,11,11},{9,11,246},{9
+,11,484},{9,11,573},{9,11,706},{9,11,762},{9,11,798},{9,11,855},{9,11,870},{9,11
+,912},{10,11,303},{10,11,335},{10,11,424},{10,11,461},{10,11,543},{10,11,759},{
+10,11,814},{11,11,59},{11,11,199},{11,11,235},{11,11,475},{11,11,590},{11,11,929
+},{11,11,963},{12,11,114},{12,11,182},{12,11,226},{12,11,332},{12,11,439},{12,11
+,575},{12,11,598},{13,11,8},{13,11,125},{13,11,194},{13,11,287},{14,11,197},{14,
+11,383},{15,11,53},{17,11,63},{19,11,46},{19,11,98},{19,11,106},{148,11,85},{4,0
+,127},{5,0,350},{6,0,356},{8,0,426},{9,0,572},{10,0,247},{139,0,312},{134,0,1215
+},{6,0,59},{9,0,603},{13,0,397},{7,11,1853},{138,11,437},{134,0,1762},{147,11,
+126},{135,10,883},{13,0,293},{142,0,56},{133,10,617},{139,10,50},{5,11,187},{7,
+10,1518},{139,10,694},{135,0,441},{6,0,111},{7,0,4},{8,0,163},{8,0,776},{138,0,
+566},{132,0,806},{4,11,215},{9,11,38},{10,11,3},{11,11,23},{11,11,127},{139,11,
+796},{14,0,233},{4,10,546},{135,10,2042},{135,0,1994},{134,0,1739},{135,11,1530}
+,{136,0,393},{5,0,297},{7,0,1038},{14,0,359},{19,0,52},{148,0,47},{135,0,309},{4
+,10,313},{133,10,577},{8,10,184},{141,10,433},{135,10,935},{12,10,186},{12,10,
+292},{14,10,100},{146,10,70},{136,0,363},{14,0,175},{11,10,402},{12,10,109},{12,
+10,431},{13,10,179},{13,10,206},{14,10,217},{16,10,3},{148,10,53},{5,10,886},{6,
+10,46},{6,10,1790},{7,10,14},{7,10,732},{7,10,1654},{8,10,95},{8,10,327},{8,10,
+616},{9,10,892},{10,10,598},{10,10,769},{11,10,134},{11,10,747},{12,10,378},{142
+,10,97},{136,0,666},{135,0,1675},{6,0,655},{134,0,1600},{135,0,808},{133,10,1021
+},{4,11,28},{5,11,440},{7,11,248},{11,11,833},{140,11,344},{134,11,1654},{132,0,
+280},{140,0,54},{4,0,421},{133,0,548},{132,10,153},{6,11,339},{135,11,923},{133,
+11,853},{133,10,798},{132,10,587},{6,11,249},{7,11,1234},{139,11,573},{6,10,598}
+,{7,10,42},{8,10,695},{10,10,212},{11,10,158},{14,10,196},{145,10,85},{7,0,249},
+{5,10,957},{133,10,1008},{4,10,129},{135,10,465},{6,0,254},{7,0,842},{7,0,1659},
+{9,0,109},{10,0,103},{7,10,908},{7,10,1201},{9,10,755},{11,10,906},{12,10,527},{
+146,10,7},{5,0,262},{136,10,450},{144,0,1},{10,11,201},{142,11,319},{7,11,49},{7
+,11,392},{8,11,20},{8,11,172},{8,11,690},{9,11,383},{9,11,845},{10,11,48},{11,11
+,293},{11,11,832},{11,11,920},{141,11,221},{5,11,858},{133,11,992},{134,0,805},{
+139,10,1003},{6,0,1630},{134,11,307},{7,11,1512},{135,11,1794},{6,11,268},{137,
+11,62},{135,10,1868},{133,0,671},{4,0,989},{8,0,972},{136,0,998},{132,11,423},{
+132,0,889},{135,0,1382},{135,0,1910},{7,10,965},{7,10,1460},{135,10,1604},{4,0,
+627},{5,0,775},{138,11,106},{134,11,348},{7,0,202},{11,0,362},{11,0,948},{140,0,
+388},{138,11,771},{6,11,613},{136,11,223},{6,0,560},{7,0,451},{8,0,389},{12,0,
+490},{13,0,16},{13,0,215},{13,0,351},{18,0,132},{147,0,125},{135,0,841},{136,0,
+566},{136,0,938},{132,11,670},{5,0,912},{6,0,1695},{140,11,55},{9,11,40},{139,11
+,136},{7,0,1361},{7,10,982},{10,10,32},{143,10,56},{11,11,259},{140,11,270},{5,0
+,236},{6,0,572},{8,0,492},{11,0,618},{144,0,56},{8,11,572},{9,11,310},{9,11,682}
+,{137,11,698},{134,0,1854},{5,0,190},{136,0,318},{133,10,435},{135,0,1376},{4,11
+,296},{6,11,352},{7,11,401},{7,11,1410},{7,11,1594},{7,11,1674},{8,11,63},{8,11,
+660},{137,11,74},{7,0,349},{5,10,85},{6,10,419},{7,10,305},{7,10,361},{7,10,1337
+},{8,10,71},{140,10,519},{4,11,139},{4,11,388},{140,11,188},{6,0,1972},{6,0,2013
+},{8,0,951},{10,0,947},{10,0,974},{10,0,1018},{142,0,476},{140,10,688},{135,10,
+740},{5,10,691},{7,10,345},{9,10,94},{140,10,169},{9,0,344},{5,10,183},{6,10,582
+},{10,10,679},{140,10,435},{135,10,511},{132,0,850},{8,11,441},{10,11,314},{143,
+11,3},{7,10,1993},{136,10,684},{4,11,747},{6,11,290},{6,10,583},{7,11,649},{7,11
+,1479},{135,11,1583},{133,11,232},{133,10,704},{134,0,910},{4,10,179},{5,10,198}
+,{133,10,697},{7,10,347},{7,10,971},{8,10,181},{138,10,711},{136,11,525},{14,0,
+19},{14,0,28},{144,0,29},{7,0,85},{7,0,247},{8,0,585},{138,0,163},{4,0,487},{7,
+11,472},{7,11,1801},{10,11,748},{141,11,458},{4,10,243},{5,10,203},{7,10,19},{7,
+10,71},{7,10,113},{10,10,405},{11,10,357},{142,10,240},{7,10,1450},{139,10,99},{
+132,11,425},{138,0,145},{147,0,83},{6,10,492},{137,11,247},{4,0,1013},{134,0,
+2033},{5,10,134},{6,10,408},{6,10,495},{135,10,1593},{135,0,1922},{134,11,1768},
+{4,0,124},{10,0,457},{11,0,121},{11,0,169},{11,0,870},{11,0,874},{12,0,214},{14,
+0,187},{143,0,77},{5,0,557},{135,0,1457},{139,0,66},{5,11,943},{6,11,1779},{142,
+10,4},{4,10,248},{4,10,665},{7,10,137},{137,10,349},{7,0,1193},{5,11,245},{6,11,
+576},{7,11,582},{136,11,225},{144,0,82},{7,10,1270},{139,10,612},{5,0,454},{10,0
+,352},{138,11,352},{18,0,57},{5,10,371},{135,10,563},{135,0,1333},{6,0,107},{7,0
+,638},{7,0,1632},{9,0,396},{134,11,610},{5,0,370},{134,0,1756},{4,10,374},{7,10,
+547},{7,10,1700},{7,10,1833},{139,10,858},{133,0,204},{6,0,1305},{9,10,311},{141
+,10,42},{5,0,970},{134,0,1706},{6,10,1647},{7,10,1552},{7,10,2010},{9,10,494},{
+137,10,509},{13,11,455},{15,11,99},{15,11,129},{144,11,68},{135,0,3},{4,0,35},{5
+,0,121},{5,0,483},{5,0,685},{6,0,489},{6,0,782},{6,0,1032},{7,0,1204},{136,0,394
+},{4,0,921},{133,0,1007},{8,11,360},{138,11,63},{135,0,1696},{134,0,1519},{132,
+11,443},{135,11,944},{6,10,123},{7,10,214},{9,10,728},{10,10,157},{11,10,346},{
+11,10,662},{143,10,106},{137,0,981},{135,10,1435},{134,0,1072},{132,0,712},{134,
+0,1629},{134,0,728},{4,11,298},{137,11,483},{6,0,1177},{6,0,1271},{5,11,164},{7,
+11,121},{142,11,189},{7,0,1608},{4,10,707},{5,10,588},{6,10,393},{13,10,106},{18
+,10,49},{147,10,41},{23,0,16},{151,11,16},{6,10,211},{7,10,1690},{11,10,486},{
+140,10,369},{133,0,485},{19,11,15},{149,11,27},{4,11,172},{9,11,611},{10,11,436}
+,{12,11,673},{141,11,255},{5,11,844},{10,11,484},{11,11,754},{12,11,457},{14,11,
+171},{14,11,389},{146,11,153},{4,0,285},{5,0,27},{5,0,317},{6,0,301},{7,0,7},{8,
+0,153},{10,0,766},{11,0,468},{12,0,467},{141,0,143},{134,0,1462},{9,11,263},{10,
+11,147},{138,11,492},{133,11,537},{6,0,1945},{6,0,1986},{6,0,1991},{134,0,2038},
+{134,10,219},{137,11,842},{14,0,52},{17,0,50},{5,10,582},{6,10,1646},{7,10,99},{
+7,10,1962},{7,10,1986},{8,10,515},{8,10,773},{9,10,23},{9,10,491},{12,10,620},{
+142,10,93},{138,11,97},{20,0,21},{20,0,44},{133,10,851},{136,0,819},{139,0,917},
+{5,11,230},{5,11,392},{6,11,420},{8,10,762},{8,10,812},{9,11,568},{9,10,910},{
+140,11,612},{135,0,784},{15,0,135},{143,11,135},{10,0,454},{140,0,324},{4,11,0},
+{5,11,41},{7,11,1459},{7,11,1469},{7,11,1618},{7,11,1859},{9,11,549},{139,11,905
+},{4,10,98},{7,10,1365},{9,10,422},{9,10,670},{10,10,775},{11,10,210},{13,10,26}
+,{13,10,457},{141,10,476},{6,0,1719},{6,0,1735},{7,0,2016},{7,0,2020},{8,0,837},
+{137,0,852},{133,11,696},{135,0,852},{132,0,952},{134,10,1730},{132,11,771},{138
+,0,568},{137,0,448},{139,0,146},{8,0,67},{138,0,419},{133,11,921},{137,10,147},{
+134,0,1826},{10,0,657},{14,0,297},{142,0,361},{6,0,666},{6,0,767},{134,0,1542},{
+139,0,729},{6,11,180},{7,11,1137},{8,11,751},{139,11,805},{4,11,183},{7,11,271},
+{11,11,824},{11,11,952},{13,11,278},{13,11,339},{13,11,482},{14,11,424},{148,11,
+99},{4,0,669},{5,11,477},{5,11,596},{6,11,505},{7,11,1221},{11,11,907},{12,11,
+209},{141,11,214},{135,11,1215},{5,0,402},{6,10,30},{11,10,56},{139,10,305},{7,
+11,564},{142,11,168},{139,0,152},{7,0,912},{135,10,1614},{4,10,150},{5,10,303},{
+134,10,327},{7,0,320},{8,0,51},{9,0,868},{10,0,833},{12,0,481},{12,0,570},{148,0
+,106},{132,0,445},{7,11,274},{11,11,263},{11,11,479},{11,11,507},{140,11,277},{
+10,0,555},{11,0,308},{19,0,95},{6,11,1645},{8,10,192},{10,10,78},{141,10,359},{
+135,10,786},{6,11,92},{6,11,188},{7,11,1269},{7,11,1524},{7,11,1876},{10,11,228}
+,{139,11,1020},{4,11,459},{133,11,966},{11,0,386},{6,10,1638},{7,10,79},{7,10,
+496},{9,10,138},{10,10,336},{12,10,412},{12,10,440},{142,10,305},{133,0,239},{7,
+0,83},{7,0,1990},{8,0,130},{139,0,720},{138,11,709},{4,0,143},{5,0,550},{133,0,
+752},{5,0,123},{6,0,530},{7,0,348},{135,0,1419},{135,0,2024},{6,11,18},{7,11,179
+},{7,11,721},{7,11,932},{8,11,548},{8,11,757},{9,11,54},{9,11,65},{9,11,532},{9,
+11,844},{10,11,113},{10,11,117},{10,11,236},{10,11,315},{10,11,430},{10,11,798},
+{11,11,153},{11,11,351},{11,11,375},{12,11,78},{12,11,151},{12,11,392},{14,11,
+248},{143,11,23},{7,10,204},{7,10,415},{8,10,42},{10,10,85},{139,10,564},{134,0,
+958},{133,11,965},{132,0,210},{135,11,1429},{138,11,480},{134,11,182},{139,11,
+345},{10,11,65},{10,11,488},{138,11,497},{4,10,3},{5,10,247},{5,10,644},{7,10,
+744},{7,10,1207},{7,10,1225},{7,10,1909},{146,10,147},{132,0,430},{5,10,285},{9,
+10,67},{13,10,473},{143,10,82},{144,11,16},{7,11,1162},{9,11,588},{10,11,260},{
+151,10,8},{133,0,213},{138,0,7},{135,0,801},{134,11,1786},{135,11,308},{6,0,936}
+,{134,0,1289},{133,0,108},{132,0,885},{133,0,219},{139,0,587},{4,0,193},{5,0,916
+},{6,0,1041},{7,0,364},{10,0,398},{10,0,726},{11,0,317},{11,0,626},{12,0,142},{
+12,0,288},{12,0,678},{13,0,313},{15,0,113},{146,0,114},{135,0,1165},{6,0,241},{9
+,0,342},{10,0,729},{11,0,284},{11,0,445},{11,0,651},{11,0,863},{13,0,398},{146,0
+,99},{7,0,907},{136,0,832},{9,0,303},{4,10,29},{6,10,532},{7,10,1628},{7,10,1648
+},{9,10,350},{10,10,433},{11,10,97},{11,10,557},{11,10,745},{12,10,289},{12,10,
+335},{12,10,348},{12,10,606},{13,10,116},{13,10,233},{13,10,466},{14,10,181},{14
+,10,209},{14,10,232},{14,10,236},{14,10,300},{16,10,41},{148,10,97},{7,11,423},{
+7,10,1692},{136,11,588},{6,0,931},{134,0,1454},{5,10,501},{7,10,1704},{9,10,553}
+,{11,10,520},{12,10,557},{141,10,249},{136,11,287},{4,0,562},{9,0,254},{139,0,
+879},{132,0,786},{14,11,32},{18,11,85},{20,11,2},{152,11,16},{135,0,1294},{7,11,
+723},{135,11,1135},{6,0,216},{7,0,901},{7,0,1343},{8,0,493},{134,11,403},{7,11,
+719},{8,11,809},{136,11,834},{5,11,210},{6,11,213},{7,11,60},{10,11,364},{139,11
+,135},{7,0,341},{11,0,219},{5,11,607},{8,11,326},{136,11,490},{4,11,701},{5,11,
+472},{5,11,639},{7,11,1249},{9,11,758},{139,11,896},{135,11,380},{135,11,1947},{
+139,0,130},{135,0,1734},{10,0,115},{11,0,420},{12,0,154},{13,0,404},{14,0,346},{
+143,0,54},{134,10,129},{4,11,386},{7,11,41},{8,11,405},{9,11,497},{11,11,110},{
+11,11,360},{15,11,37},{144,11,84},{141,11,282},{5,11,46},{7,11,1452},{7,11,1480}
+,{8,11,634},{140,11,472},{4,11,524},{136,11,810},{10,11,238},{141,11,33},{133,0,
+604},{5,0,1011},{136,0,701},{8,0,856},{8,0,858},{8,0,879},{12,0,702},{142,0,447}
+,{4,0,54},{5,0,666},{7,0,1039},{7,0,1130},{9,0,195},{138,0,302},{4,10,25},{5,10,
+60},{6,10,504},{7,10,614},{7,10,1155},{140,10,0},{7,10,1248},{11,10,621},{139,10
+,702},{133,11,997},{137,10,321},{134,0,1669},{134,0,1791},{4,10,379},{135,10,
+1397},{138,11,372},{5,11,782},{5,11,829},{134,11,1738},{135,0,1228},{4,10,118},{
+6,10,274},{6,10,361},{7,10,75},{141,10,441},{132,0,623},{9,11,279},{10,11,407},{
+14,11,84},{150,11,18},{137,10,841},{135,0,798},{140,10,693},{5,10,314},{6,10,221
+},{7,10,419},{10,10,650},{11,10,396},{12,10,156},{13,10,369},{14,10,333},{145,10
+,47},{135,11,1372},{7,0,122},{9,0,259},{10,0,84},{11,0,470},{12,0,541},{141,0,
+379},{134,0,837},{8,0,1013},{4,11,78},{5,11,96},{5,11,182},{7,11,1724},{7,11,
+1825},{10,11,394},{10,11,471},{11,11,532},{14,11,340},{145,11,88},{134,0,577},{
+135,11,1964},{132,10,913},{134,0,460},{8,0,891},{10,0,901},{10,0,919},{10,0,932}
+,{12,0,715},{12,0,728},{12,0,777},{14,0,457},{144,0,103},{5,0,82},{5,0,131},{7,0
+,1755},{8,0,31},{9,0,168},{9,0,764},{139,0,869},{136,10,475},{6,0,605},{5,10,
+1016},{9,11,601},{9,11,619},{10,11,505},{10,11,732},{11,11,355},{140,11,139},{7,
+10,602},{8,10,179},{10,10,781},{140,10,126},{134,0,1246},{6,10,329},{138,10,111}
+,{6,11,215},{7,11,1028},{7,11,1473},{7,11,1721},{9,11,424},{138,11,779},{5,0,278
+},{137,0,68},{6,0,932},{6,0,1084},{144,0,86},{4,0,163},{5,0,201},{5,0,307},{5,0,
+310},{6,0,335},{7,0,284},{7,0,1660},{136,0,165},{136,0,781},{134,0,707},{6,0,33}
+,{135,0,1244},{5,10,821},{6,11,67},{6,10,1687},{7,11,258},{7,11,1630},{9,11,354}
+,{9,11,675},{10,11,830},{14,11,80},{145,11,80},{6,11,141},{7,11,225},{9,11,59},{
+9,11,607},{10,11,312},{11,11,687},{12,11,555},{13,11,373},{13,11,494},{148,11,58
+},{134,0,1113},{9,0,388},{5,10,71},{7,10,1407},{9,10,704},{10,10,261},{10,10,619
+},{11,10,547},{11,10,619},{143,10,157},{7,0,1953},{136,0,720},{138,0,203},{7,10,
+2008},{9,10,337},{138,10,517},{6,0,326},{7,0,677},{137,0,425},{139,11,81},{7,0,
+1316},{7,0,1412},{7,0,1839},{9,0,589},{11,0,241},{11,0,676},{11,0,811},{11,0,891
+},{12,0,140},{12,0,346},{12,0,479},{13,0,140},{13,0,381},{14,0,188},{18,0,30},{
+148,0,108},{5,0,416},{6,10,86},{6,10,603},{7,10,292},{7,10,561},{8,10,257},{8,10
+,382},{9,10,721},{9,10,778},{11,10,581},{140,10,466},{4,10,486},{133,10,491},{
+134,0,1300},{132,10,72},{7,0,847},{6,10,265},{7,11,430},{139,11,46},{5,11,602},{
+6,11,106},{7,11,1786},{7,11,1821},{7,11,2018},{9,11,418},{137,11,763},{5,0,358},
+{7,0,535},{7,0,1184},{10,0,662},{13,0,212},{13,0,304},{13,0,333},{145,0,98},{5,
+11,65},{6,11,416},{7,11,1720},{7,11,1924},{8,11,677},{10,11,109},{11,11,14},{11,
+11,70},{11,11,569},{11,11,735},{15,11,153},{148,11,80},{6,0,1823},{8,0,839},{8,0
+,852},{8,0,903},{10,0,940},{12,0,707},{140,0,775},{135,11,1229},{6,0,1522},{140,
+0,654},{136,11,595},{139,0,163},{141,0,314},{132,0,978},{4,0,601},{6,0,2035},{
+137,10,234},{5,10,815},{6,10,1688},{134,10,1755},{133,0,946},{136,0,434},{6,10,
+197},{136,10,205},{7,0,411},{7,0,590},{8,0,631},{9,0,323},{10,0,355},{11,0,491},
+{12,0,143},{12,0,402},{13,0,73},{14,0,408},{15,0,107},{146,0,71},{7,0,1467},{8,0
+,328},{10,0,544},{11,0,955},{12,0,13},{13,0,320},{145,0,83},{142,0,410},{11,0,
+511},{13,0,394},{14,0,298},{14,0,318},{146,0,103},{6,10,452},{7,10,312},{138,10,
+219},{138,10,589},{4,10,333},{9,10,176},{12,10,353},{141,10,187},{135,11,329},{
+132,11,469},{5,0,835},{134,0,483},{134,11,1743},{5,11,929},{6,11,340},{8,11,376}
+,{136,11,807},{134,10,1685},{132,0,677},{5,11,218},{7,11,1610},{138,11,83},{5,11
+,571},{135,11,1842},{132,11,455},{137,0,70},{135,0,1405},{7,10,135},{8,10,7},{8,
+10,62},{9,10,243},{10,10,658},{10,10,697},{11,10,456},{139,10,756},{9,10,395},{
+138,10,79},{137,0,108},{6,11,161},{7,11,372},{137,11,597},{132,11,349},{132,0,
+777},{132,0,331},{135,10,631},{133,0,747},{6,11,432},{6,11,608},{139,11,322},{
+138,10,835},{5,11,468},{7,11,1809},{10,11,325},{11,11,856},{12,11,345},{143,11,
+104},{133,11,223},{7,10,406},{7,10,459},{8,10,606},{139,10,726},{132,11,566},{
+142,0,68},{4,11,59},{135,11,1394},{6,11,436},{139,11,481},{4,11,48},{5,11,271},{
+135,11,953},{139,11,170},{5,11,610},{136,11,457},{133,11,755},{135,11,1217},{133
+,10,612},{132,11,197},{132,0,505},{4,10,372},{7,10,482},{8,10,158},{9,10,602},{9
+,10,615},{10,10,245},{10,10,678},{10,10,744},{11,10,248},{139,10,806},{133,0,326
+},{5,10,854},{135,10,1991},{4,0,691},{146,0,16},{6,0,628},{9,0,35},{10,0,680},{
+10,0,793},{11,0,364},{13,0,357},{143,0,164},{138,0,654},{6,0,32},{7,0,385},{7,0,
+757},{7,0,1916},{8,0,37},{8,0,94},{8,0,711},{9,0,541},{10,0,162},{10,0,795},{11,
+0,989},{11,0,1010},{12,0,14},{142,0,308},{133,11,217},{6,0,152},{6,0,349},{6,0,
+1682},{7,0,1252},{8,0,112},{9,0,435},{9,0,668},{10,0,290},{10,0,319},{10,0,815},
+{11,0,180},{11,0,837},{12,0,240},{13,0,152},{13,0,219},{142,0,158},{4,0,581},{
+134,0,726},{5,10,195},{135,10,1685},{6,0,126},{7,0,573},{8,0,397},{142,0,44},{
+138,0,89},{7,10,1997},{8,10,730},{139,10,1006},{134,0,1531},{134,0,1167},{5,0,
+926},{12,0,203},{133,10,751},{4,11,165},{7,11,1398},{135,11,1829},{7,0,1232},{
+137,0,531},{135,10,821},{134,0,943},{133,0,670},{4,0,880},{139,0,231},{134,0,
+1617},{135,0,1957},{5,11,9},{7,11,297},{7,11,966},{140,11,306},{6,0,975},{134,0,
+985},{5,10,950},{5,10,994},{134,10,351},{12,11,21},{151,11,7},{5,11,146},{6,11,
+411},{138,11,721},{7,0,242},{135,0,1942},{6,11,177},{135,11,467},{5,0,421},{7,10
+,47},{137,10,684},{5,0,834},{7,0,1202},{8,0,14},{9,0,481},{137,0,880},{138,0,465
+},{6,0,688},{9,0,834},{132,10,350},{132,0,855},{4,0,357},{6,0,172},{7,0,143},{
+137,0,413},{133,11,200},{132,0,590},{7,10,1812},{13,10,259},{13,10,356},{14,10,
+242},{147,10,114},{133,10,967},{11,0,114},{4,10,473},{7,10,623},{8,10,808},{9,10
+,871},{9,10,893},{11,10,431},{12,10,112},{12,10,217},{12,10,243},{12,10,562},{12
+,10,663},{12,10,683},{13,10,141},{13,10,197},{13,10,227},{13,10,406},{13,10,487}
+,{14,10,156},{14,10,203},{14,10,224},{14,10,256},{18,10,58},{150,10,0},{138,10,
+286},{4,10,222},{7,10,286},{136,10,629},{5,0,169},{7,0,333},{136,0,45},{134,11,
+481},{132,0,198},{4,0,24},{5,0,140},{5,0,185},{7,0,1500},{11,0,565},{11,0,838},{
+4,11,84},{7,11,1482},{10,11,76},{138,11,142},{133,0,585},{141,10,306},{133,11,
+1015},{4,11,315},{5,11,507},{135,11,1370},{136,10,146},{6,0,691},{134,0,1503},{4
+,0,334},{133,0,593},{4,10,465},{135,10,1663},{142,11,173},{135,0,913},{12,0,116}
+,{134,11,1722},{134,0,1360},{132,0,802},{8,11,222},{8,11,476},{9,11,238},{11,11,
+516},{11,11,575},{15,11,109},{146,11,100},{6,0,308},{9,0,673},{7,10,138},{7,10,
+517},{139,10,238},{132,0,709},{6,0,1876},{6,0,1895},{9,0,994},{9,0,1006},{12,0,
+829},{12,0,888},{12,0,891},{146,0,185},{148,10,94},{4,0,228},{133,0,897},{7,0,
+1840},{5,10,495},{7,10,834},{9,10,733},{139,10,378},{133,10,559},{6,10,21},{6,10
+,1737},{7,10,1444},{136,10,224},{4,0,608},{133,0,497},{6,11,40},{135,11,1781},{
+134,0,1573},{135,0,2039},{6,0,540},{136,0,136},{4,0,897},{5,0,786},{133,10,519},
+{6,0,1878},{6,0,1884},{9,0,938},{9,0,948},{9,0,955},{9,0,973},{9,0,1012},{12,0,
+895},{12,0,927},{143,0,254},{134,0,1469},{133,0,999},{4,0,299},{135,0,1004},{4,0
+,745},{133,0,578},{136,11,574},{133,0,456},{134,0,1457},{7,0,1679},{132,10,402},
+{7,0,693},{8,0,180},{12,0,163},{8,10,323},{136,10,479},{11,10,580},{142,10,201},
+{5,10,59},{135,10,672},{132,11,354},{146,10,34},{4,0,755},{135,11,1558},{7,0,
+1740},{146,0,48},{4,10,85},{135,10,549},{139,0,338},{133,10,94},{134,0,1091},{
+135,11,469},{12,0,695},{12,0,704},{20,0,113},{5,11,830},{14,11,338},{148,11,81},
+{135,0,1464},{6,10,11},{135,10,187},{135,0,975},{13,0,335},{132,10,522},{134,0,
+1979},{5,11,496},{135,11,203},{4,10,52},{135,10,661},{7,0,1566},{8,0,269},{9,0,
+212},{9,0,718},{14,0,15},{14,0,132},{142,0,227},{4,0,890},{5,0,805},{5,0,819},{5
+,0,961},{6,0,396},{6,0,1631},{6,0,1678},{7,0,1967},{7,0,2041},{9,0,630},{11,0,8}
+,{11,0,1019},{12,0,176},{13,0,225},{14,0,292},{21,0,24},{4,10,383},{133,10,520},
+{134,11,547},{135,11,1748},{5,11,88},{137,11,239},{146,11,128},{7,11,650},{135,
+11,1310},{4,10,281},{5,10,38},{7,10,194},{7,10,668},{7,10,1893},{137,10,397},{
+135,0,1815},{9,10,635},{139,10,559},{7,0,1505},{10,0,190},{10,0,634},{11,0,792},
+{12,0,358},{140,0,447},{5,0,0},{6,0,536},{7,0,604},{13,0,445},{145,0,126},{7,11,
+1076},{9,11,80},{11,11,78},{11,11,421},{11,11,534},{140,11,545},{8,0,966},{10,0,
+1023},{14,11,369},{146,11,72},{135,11,1641},{6,0,232},{6,0,412},{7,0,1074},{8,0,
+9},{8,0,157},{8,0,786},{9,0,196},{9,0,352},{9,0,457},{10,0,337},{11,0,232},{11,0
+,877},{12,0,480},{140,0,546},{135,0,958},{4,0,382},{136,0,579},{4,0,212},{135,0,
+1206},{4,11,497},{5,11,657},{135,11,1584},{132,0,681},{8,0,971},{138,0,965},{5,
+10,448},{136,10,535},{14,0,16},{146,0,44},{11,0,584},{11,0,616},{14,0,275},{11,
+11,584},{11,11,616},{142,11,275},{136,11,13},{7,10,610},{135,10,1501},{7,11,642}
+,{8,11,250},{11,11,123},{11,11,137},{13,11,48},{142,11,95},{133,0,655},{17,0,67}
+,{147,0,74},{134,0,751},{134,0,1967},{6,0,231},{136,0,423},{5,0,300},{138,0,1016
+},{4,10,319},{5,10,699},{138,10,673},{6,0,237},{7,0,611},{8,0,100},{9,0,416},{11
+,0,335},{12,0,173},{18,0,101},{6,10,336},{8,10,552},{9,10,285},{10,10,99},{139,
+10,568},{134,0,1370},{7,10,1406},{9,10,218},{141,10,222},{133,10,256},{135,0,
+1208},{14,11,213},{148,11,38},{6,0,1219},{135,11,1642},{13,0,417},{14,0,129},{
+143,0,15},{10,11,545},{140,11,301},{17,10,39},{148,10,36},{133,0,199},{4,11,904}
+,{133,11,794},{12,0,427},{146,0,38},{134,0,949},{8,0,665},{135,10,634},{132,10,
+618},{135,10,259},{132,10,339},{133,11,761},{141,10,169},{132,10,759},{5,0,688},
+{7,0,539},{135,0,712},{7,11,386},{138,11,713},{134,0,1186},{6,11,7},{6,11,35},{7
+,11,147},{7,11,1069},{7,11,1568},{7,11,1575},{7,11,1917},{8,11,43},{8,11,208},{9
+,11,128},{9,11,866},{10,11,20},{11,11,981},{147,11,33},{7,11,893},{8,10,482},{
+141,11,424},{6,0,312},{6,0,1715},{10,0,584},{11,0,546},{11,0,692},{12,0,259},{12
+,0,295},{13,0,46},{141,0,154},{5,10,336},{6,10,341},{6,10,478},{6,10,1763},{136,
+10,386},{137,0,151},{132,0,588},{152,0,4},{6,11,322},{9,11,552},{11,11,274},{13,
+11,209},{13,11,499},{14,11,85},{15,11,126},{145,11,70},{135,10,73},{4,0,231},{5,
+0,61},{6,0,104},{7,0,729},{7,0,964},{7,0,1658},{140,0,414},{6,0,263},{138,0,757}
+,{135,10,1971},{4,0,612},{133,0,561},{132,0,320},{135,10,1344},{8,11,83},{8,11,
+817},{9,11,28},{9,11,29},{9,11,885},{10,11,387},{11,11,633},{11,11,740},{13,11,
+235},{13,11,254},{15,11,143},{143,11,146},{5,10,396},{134,10,501},{140,11,49},{
+132,0,225},{4,10,929},{5,10,799},{8,10,46},{136,10,740},{4,0,405},{7,0,817},{14,
+0,58},{17,0,37},{146,0,124},{133,0,974},{4,11,412},{133,11,581},{4,10,892},{133,
+10,770},{4,0,996},{134,0,2026},{4,0,527},{5,0,235},{7,0,1239},{11,0,131},{140,0,
+370},{9,0,16},{13,0,386},{135,11,421},{7,0,956},{7,0,1157},{7,0,1506},{7,0,1606}
+,{7,0,1615},{7,0,1619},{7,0,1736},{7,0,1775},{8,0,590},{9,0,324},{9,0,736},{9,0,
+774},{9,0,776},{9,0,784},{10,0,567},{10,0,708},{11,0,518},{11,0,613},{11,0,695},
+{11,0,716},{11,0,739},{11,0,770},{11,0,771},{11,0,848},{11,0,857},{11,0,931},{11
+,0,947},{12,0,326},{12,0,387},{12,0,484},{12,0,528},{12,0,552},{12,0,613},{13,0,
+189},{13,0,256},{13,0,340},{13,0,432},{13,0,436},{13,0,440},{13,0,454},{14,0,174
+},{14,0,220},{14,0,284},{14,0,390},{145,0,121},{135,10,158},{9,0,137},{138,0,221
+},{4,11,110},{10,11,415},{10,11,597},{142,11,206},{141,11,496},{135,11,205},{151
+,10,25},{135,11,778},{7,11,1656},{7,10,2001},{9,11,369},{10,11,338},{10,11,490},
+{11,11,154},{11,11,545},{11,11,775},{13,11,77},{141,11,274},{4,11,444},{10,11,
+146},{140,11,9},{7,0,390},{138,0,140},{135,0,1144},{134,0,464},{7,10,1461},{140,
+10,91},{132,10,602},{4,11,283},{135,11,1194},{5,0,407},{11,0,204},{11,0,243},{11
+,0,489},{12,0,293},{19,0,37},{20,0,73},{150,0,38},{7,0,1218},{136,0,303},{5,0,
+325},{8,0,5},{8,0,227},{9,0,105},{10,0,585},{12,0,614},{4,10,13},{5,10,567},{7,
+10,1498},{9,10,124},{11,10,521},{140,10,405},{135,10,1006},{7,0,800},{10,0,12},{
+134,11,1720},{135,0,1783},{132,10,735},{138,10,812},{4,10,170},{135,10,323},{6,0
+,621},{13,0,504},{144,0,89},{5,10,304},{135,10,1403},{137,11,216},{6,0,920},{6,0
+,1104},{9,11,183},{139,11,286},{4,0,376},{133,10,742},{134,0,218},{8,0,641},{11,
+0,388},{140,0,580},{7,0,454},{7,0,782},{8,0,768},{140,0,686},{137,11,33},{133,10
+,111},{144,0,0},{10,0,676},{140,0,462},{6,0,164},{136,11,735},{133,10,444},{150,
+0,50},{7,11,1862},{12,11,491},{12,11,520},{13,11,383},{14,11,244},{146,11,12},{5
+,11,132},{9,11,486},{9,11,715},{10,11,458},{11,11,373},{11,11,668},{11,11,795},{
+11,11,897},{12,11,272},{12,11,424},{12,11,539},{12,11,558},{14,11,245},{14,11,
+263},{14,11,264},{14,11,393},{142,11,403},{8,10,123},{15,10,6},{144,10,7},{6,0,
+285},{8,0,654},{11,0,749},{12,0,190},{12,0,327},{13,0,120},{13,0,121},{13,0,327}
+,{15,0,47},{146,0,40},{5,11,8},{6,11,89},{6,11,400},{7,11,1569},{7,11,1623},{7,
+11,1850},{8,11,218},{8,11,422},{9,11,570},{138,11,626},{6,11,387},{7,11,882},{
+141,11,111},{6,0,343},{7,0,195},{9,0,226},{10,0,197},{10,0,575},{11,0,502},{11,0
+,899},{6,11,224},{7,11,877},{137,11,647},{5,10,937},{135,10,100},{135,11,790},{
+150,0,29},{147,0,8},{134,0,1812},{149,0,8},{135,11,394},{7,0,1125},{9,0,143},{11
+,0,61},{14,0,405},{150,0,21},{10,11,755},{147,11,29},{9,11,378},{141,11,162},{
+135,10,922},{5,10,619},{133,10,698},{134,0,1327},{6,0,1598},{137,0,575},{9,11,
+569},{12,11,12},{12,11,81},{12,11,319},{13,11,69},{14,11,259},{16,11,87},{17,11,
+1},{17,11,21},{17,11,24},{18,11,15},{18,11,56},{18,11,59},{18,11,127},{18,11,154
+},{19,11,19},{148,11,31},{6,0,895},{135,11,1231},{5,0,959},{7,11,124},{136,11,38
+},{5,11,261},{7,11,78},{7,11,199},{8,11,815},{9,11,126},{138,11,342},{5,10,917},
+{134,10,1659},{7,0,1759},{5,11,595},{135,11,1863},{136,0,173},{134,0,266},{142,0
+,261},{132,11,628},{5,10,251},{5,10,956},{8,10,268},{9,10,214},{146,10,142},{7,
+11,266},{136,11,804},{135,11,208},{6,11,79},{7,11,1021},{135,11,1519},{11,11,704
+},{141,11,396},{5,10,346},{5,10,711},{136,10,390},{136,11,741},{134,11,376},{134
+,0,1427},{6,0,1033},{6,0,1217},{136,0,300},{133,10,624},{6,11,100},{7,11,244},{7
+,11,632},{7,11,1609},{8,11,178},{8,11,638},{141,11,58},{6,0,584},{5,10,783},{7,
+10,1998},{135,10,2047},{5,0,427},{5,0,734},{7,0,478},{136,0,52},{7,0,239},{11,0,
+217},{142,0,165},{134,0,1129},{6,0,168},{6,0,1734},{7,0,20},{7,0,1056},{8,0,732}
+,{9,0,406},{9,0,911},{138,0,694},{132,10,594},{133,11,791},{7,11,686},{8,11,33},
+{8,11,238},{10,11,616},{11,11,467},{11,11,881},{13,11,217},{13,11,253},{142,11,
+268},{137,11,476},{134,0,418},{133,0,613},{132,0,632},{132,11,447},{7,0,32},{7,0
+,984},{8,0,85},{8,0,709},{9,0,579},{9,0,847},{9,0,856},{10,0,799},{11,0,258},{11
+,0,1007},{12,0,331},{12,0,615},{13,0,188},{13,0,435},{14,0,8},{15,0,165},{16,0,
+27},{20,0,40},{144,11,35},{4,11,128},{5,11,415},{6,11,462},{7,11,294},{7,11,578}
+,{10,11,710},{139,11,86},{5,0,694},{136,0,909},{7,0,1109},{11,0,7},{5,10,37},{6,
+10,39},{6,10,451},{7,10,218},{7,10,1166},{7,10,1687},{8,10,662},{144,10,2},{136,
+11,587},{6,11,427},{7,11,1018},{138,11,692},{4,11,195},{6,10,508},{135,11,802},{
+4,0,167},{135,0,82},{5,0,62},{6,0,24},{6,0,534},{7,0,74},{7,0,678},{7,0,684},{7,
+0,1043},{7,0,1072},{8,0,280},{8,0,541},{8,0,686},{9,0,258},{10,0,519},{11,0,252}
+,{140,0,282},{138,0,33},{4,0,359},{133,11,738},{7,0,980},{9,0,328},{13,0,186},{
+13,0,364},{7,10,635},{7,10,796},{8,10,331},{9,10,330},{9,10,865},{10,10,119},{10
+,10,235},{11,10,111},{11,10,129},{11,10,240},{12,10,31},{12,10,66},{12,10,222},{
+12,10,269},{12,10,599},{12,10,684},{12,10,689},{12,10,691},{142,10,345},{137,10,
+527},{6,0,596},{7,0,585},{135,10,702},{134,11,1683},{133,0,211},{6,0,145},{141,0
+,336},{134,0,1130},{7,0,873},{6,10,37},{7,10,1666},{8,10,195},{8,10,316},{9,10,
+178},{9,10,276},{9,10,339},{9,10,536},{10,10,102},{10,10,362},{10,10,785},{11,10
+,55},{11,10,149},{11,10,773},{13,10,416},{13,10,419},{14,10,38},{14,10,41},{142,
+10,210},{8,0,840},{136,0,841},{132,0,263},{5,11,3},{8,11,578},{9,11,118},{10,11,
+705},{12,11,383},{141,11,279},{132,0,916},{133,11,229},{133,10,645},{15,0,155},{
+16,0,79},{8,11,102},{10,11,578},{10,11,672},{12,11,496},{13,11,408},{14,11,121},
+{145,11,106},{4,0,599},{5,0,592},{6,0,1634},{7,0,5},{7,0,55},{7,0,67},{7,0,97},{
+7,0,691},{7,0,979},{7,0,1600},{7,0,1697},{8,0,207},{8,0,214},{8,0,231},{8,0,294}
+,{8,0,336},{8,0,428},{8,0,471},{8,0,622},{8,0,626},{8,0,679},{8,0,759},{8,0,829}
+,{9,0,11},{9,0,246},{9,0,484},{9,0,573},{9,0,706},{9,0,762},{9,0,798},{9,0,855},
+{9,0,870},{9,0,912},{10,0,303},{10,0,335},{10,0,424},{10,0,461},{10,0,543},{10,0
+,759},{10,0,814},{11,0,59},{11,0,199},{11,0,235},{11,0,590},{11,0,631},{11,0,929
+},{11,0,963},{11,0,987},{12,0,114},{12,0,182},{12,0,226},{12,0,332},{12,0,439},{
+12,0,575},{12,0,598},{12,0,675},{13,0,8},{13,0,125},{13,0,194},{13,0,287},{14,0,
+197},{14,0,383},{15,0,53},{17,0,63},{19,0,46},{19,0,98},{19,0,106},{148,0,85},{7
+,0,1356},{132,10,290},{6,10,70},{7,10,1292},{10,10,762},{139,10,288},{150,11,55}
+,{4,0,593},{8,11,115},{8,11,350},{9,11,489},{10,11,128},{11,11,306},{12,11,373},
+{14,11,30},{17,11,79},{147,11,80},{135,11,1235},{134,0,1392},{4,11,230},{133,11,
+702},{147,0,126},{7,10,131},{7,10,422},{8,10,210},{140,10,573},{134,0,1179},{139
+,11,435},{139,10,797},{134,11,1728},{4,0,162},{18,11,26},{19,11,42},{20,11,43},{
+21,11,0},{23,11,27},{152,11,14},{132,10,936},{6,0,765},{5,10,453},{134,10,441},{
+133,0,187},{135,0,1286},{6,0,635},{6,0,904},{6,0,1210},{134,0,1489},{4,0,215},{8
+,0,890},{9,0,38},{10,0,923},{11,0,23},{11,0,127},{139,0,796},{6,0,1165},{134,0,
+1306},{7,0,716},{13,0,97},{141,0,251},{132,10,653},{136,0,657},{146,10,80},{5,11
+,622},{7,11,1032},{11,11,26},{11,11,213},{11,11,707},{12,11,380},{13,11,226},{
+141,11,355},{6,0,299},{5,11,70},{6,11,334},{9,11,171},{11,11,637},{12,11,202},{
+14,11,222},{145,11,42},{142,0,134},{4,11,23},{5,11,313},{5,11,1014},{6,11,50},{6
+,11,51},{7,11,142},{7,11,384},{9,11,783},{139,11,741},{4,11,141},{7,11,559},{8,
+11,640},{9,11,460},{12,11,183},{141,11,488},{136,11,614},{7,10,1368},{8,10,232},
+{8,10,361},{10,10,682},{138,10,742},{137,10,534},{6,0,1082},{140,0,658},{137,10,
+27},{135,0,2002},{142,10,12},{4,0,28},{5,0,440},{7,0,248},{11,0,833},{140,0,344}
+,{7,10,736},{139,10,264},{134,10,1657},{134,0,1654},{138,0,531},{5,11,222},{9,11
+,140},{138,11,534},{6,0,634},{6,0,798},{134,0,840},{138,11,503},{135,10,127},{
+133,0,853},{5,11,154},{7,11,1491},{10,11,379},{138,11,485},{6,0,249},{7,0,1234},
+{139,0,573},{133,11,716},{7,11,1570},{140,11,542},{136,10,364},{138,0,527},{4,11
+,91},{5,11,388},{5,11,845},{6,11,206},{6,11,252},{6,11,365},{7,11,136},{7,11,531
+},{8,11,264},{136,11,621},{134,0,1419},{135,11,1441},{7,0,49},{7,0,392},{8,0,20}
+,{8,0,172},{8,0,690},{9,0,383},{9,0,845},{10,0,48},{11,0,293},{11,0,832},{11,0,
+920},{11,0,984},{141,0,221},{5,0,858},{133,0,992},{5,0,728},{137,10,792},{5,10,
+909},{9,10,849},{138,10,805},{7,0,525},{7,0,1579},{8,0,497},{136,0,573},{6,0,268
+},{137,0,62},{135,11,576},{134,0,1201},{5,11,771},{5,11,863},{5,11,898},{6,11,
+1632},{6,11,1644},{134,11,1780},{133,11,331},{7,0,193},{7,0,1105},{10,0,495},{7,
+10,397},{8,10,124},{8,10,619},{9,10,305},{11,10,40},{12,10,349},{13,10,134},{13,
+10,295},{14,10,155},{15,10,120},{146,10,105},{138,0,106},{6,0,859},{5,11,107},{7
+,11,201},{136,11,518},{6,11,446},{135,11,1817},{13,0,23},{4,10,262},{135,10,342}
+,{133,10,641},{137,11,851},{6,0,925},{137,0,813},{132,11,504},{6,0,613},{136,0,
+223},{4,10,99},{6,10,250},{6,10,346},{8,10,127},{138,10,81},{136,0,953},{132,10,
+915},{139,11,892},{5,10,75},{9,10,517},{10,10,470},{12,10,155},{141,10,224},{4,0
+,666},{7,0,1017},{7,11,996},{138,11,390},{5,11,883},{133,11,975},{14,10,83},{142
+,11,83},{4,0,670},{5,11,922},{134,11,1707},{135,0,216},{9,0,40},{11,0,136},{135,
+11,787},{5,10,954},{5,11,993},{7,11,515},{137,11,91},{139,0,259},{7,0,1114},{9,0
+,310},{9,0,682},{10,0,440},{13,0,40},{6,10,304},{8,10,418},{11,10,341},{139,10,
+675},{14,0,296},{9,10,410},{139,10,425},{10,11,377},{12,11,363},{13,11,68},{13,
+11,94},{14,11,108},{142,11,306},{7,0,1401},{135,0,1476},{4,0,296},{6,0,475},{7,0
+,401},{7,0,1410},{7,0,1594},{7,0,1674},{8,0,63},{8,0,660},{137,0,74},{4,0,139},{
+4,0,388},{140,0,188},{132,0,797},{132,11,766},{5,11,103},{7,11,921},{8,11,580},{
+8,11,593},{8,11,630},{138,11,28},{4,11,911},{5,11,867},{133,11,1013},{134,10,14}
+,{134,0,1572},{134,10,1708},{21,0,39},{5,10,113},{6,10,243},{7,10,1865},{11,10,
+161},{16,10,37},{145,10,99},{7,11,1563},{141,11,182},{5,11,135},{6,11,519},{7,11
+,1722},{10,11,271},{11,11,261},{145,11,54},{132,10,274},{134,0,1594},{4,11,300},
+{5,11,436},{135,11,484},{4,0,747},{6,0,290},{7,0,649},{7,0,1479},{135,0,1583},{
+133,11,535},{147,11,82},{133,0,232},{137,0,887},{135,10,166},{136,0,521},{4,0,14
+},{7,0,472},{7,0,1801},{10,0,748},{141,0,458},{134,0,741},{134,0,992},{16,0,111}
+,{137,10,304},{4,0,425},{5,11,387},{7,11,557},{12,11,547},{142,11,86},{135,11,
+1747},{5,10,654},{135,11,1489},{7,0,789},{4,11,6},{5,11,708},{136,11,75},{6,10,
+273},{10,10,188},{13,10,377},{146,10,77},{6,0,1593},{4,11,303},{7,11,619},{10,11
+,547},{10,11,687},{11,11,122},{140,11,601},{134,0,1768},{135,10,410},{138,11,772
+},{11,0,233},{139,10,524},{5,0,943},{134,0,1779},{134,10,1785},{136,11,529},{132
+,0,955},{5,0,245},{6,0,576},{7,0,582},{136,0,225},{132,10,780},{142,0,241},{134,
+0,1943},{4,11,106},{7,11,310},{7,11,1785},{10,11,690},{139,11,717},{134,0,1284},
+{5,11,890},{133,11,988},{6,11,626},{142,11,431},{10,11,706},{145,11,32},{137,11,
+332},{132,11,698},{135,0,709},{5,10,948},{138,11,17},{136,0,554},{134,0,1564},{
+139,10,941},{132,0,443},{134,0,909},{134,11,84},{142,0,280},{4,10,532},{5,10,706
+},{135,10,662},{132,0,729},{5,10,837},{6,10,1651},{139,10,985},{135,10,1861},{4,
+0,348},{152,11,3},{5,11,986},{6,11,130},{7,11,1582},{8,11,458},{10,11,101},{10,
+11,318},{138,11,823},{134,0,758},{4,0,298},{137,0,848},{4,10,330},{7,10,933},{7,
+10,2012},{136,10,292},{7,11,1644},{137,11,129},{6,0,1422},{9,0,829},{135,10,767}
+,{5,0,164},{7,0,121},{142,0,189},{7,0,812},{7,0,1261},{7,0,1360},{9,0,632},{140,
+0,352},{135,11,1788},{139,0,556},{135,11,997},{145,10,114},{4,0,172},{9,0,611},{
+10,0,436},{12,0,673},{13,0,255},{137,10,883},{11,0,530},{138,10,274},{133,0,844}
+,{134,0,984},{13,0,232},{18,0,35},{4,10,703},{135,10,207},{132,10,571},{9,0,263}
+,{10,0,147},{138,0,492},{7,11,1756},{137,11,98},{5,10,873},{5,10,960},{8,10,823}
+,{137,10,881},{133,0,537},{132,0,859},{7,11,1046},{139,11,160},{137,0,842},{139,
+10,283},{5,10,33},{6,10,470},{139,10,424},{6,11,45},{7,11,433},{8,11,129},{9,11,
+21},{10,11,392},{11,11,79},{12,11,499},{13,11,199},{141,11,451},{135,0,1291},{
+135,10,1882},{7,11,558},{136,11,353},{134,0,1482},{5,0,230},{5,0,392},{6,0,420},
+{9,0,568},{140,0,612},{6,0,262},{7,10,90},{7,10,664},{7,10,830},{7,10,1380},{7,
+10,2025},{8,11,81},{8,10,448},{8,10,828},{9,11,189},{9,11,201},{11,11,478},{11,
+11,712},{141,11,338},{142,0,31},{5,11,353},{151,11,26},{132,0,753},{4,0,0},{5,0,
+41},{7,0,1459},{7,0,1469},{7,0,1859},{9,0,549},{139,0,905},{9,10,417},{137,10,
+493},{135,11,1113},{133,0,696},{141,11,448},{134,10,295},{132,0,834},{4,0,771},{
+5,10,1019},{6,11,25},{7,11,855},{7,11,1258},{144,11,32},{134,0,1076},{133,0,921}
+,{133,0,674},{4,11,4},{7,11,1118},{7,11,1320},{7,11,1706},{8,11,277},{9,11,622},
+{10,11,9},{11,11,724},{12,11,350},{12,11,397},{13,11,28},{13,11,159},{15,11,89},
+{18,11,5},{19,11,9},{20,11,34},{150,11,47},{134,10,208},{6,0,444},{136,0,308},{6
+,0,180},{7,0,1137},{8,0,751},{139,0,805},{4,0,183},{7,0,271},{11,0,824},{11,0,
+952},{13,0,278},{13,0,339},{13,0,482},{14,0,424},{148,0,99},{7,11,317},{135,11,
+569},{4,0,19},{5,0,477},{5,0,596},{6,0,505},{7,0,1221},{11,0,907},{12,0,209},{
+141,0,214},{135,0,1215},{6,0,271},{7,0,398},{8,0,387},{10,0,344},{7,10,448},{7,
+10,1629},{7,10,1813},{8,10,442},{9,10,710},{10,10,282},{138,10,722},{11,10,844},
+{12,10,104},{140,10,625},{134,11,255},{133,10,787},{134,0,1645},{11,11,956},{151
+,11,3},{6,0,92},{6,0,188},{7,0,209},{7,0,1269},{7,0,1524},{7,0,1876},{8,0,661},{
+10,0,42},{10,0,228},{11,0,58},{11,0,1020},{12,0,58},{12,0,118},{141,0,32},{4,0,
+459},{133,0,966},{4,11,536},{7,11,1141},{10,11,723},{139,11,371},{140,0,330},{
+134,0,1557},{7,11,285},{135,11,876},{136,10,491},{135,11,560},{6,0,18},{7,0,179}
+,{7,0,932},{8,0,548},{8,0,757},{9,0,54},{9,0,65},{9,0,532},{9,0,844},{10,0,113},
+{10,0,117},{10,0,315},{10,0,560},{10,0,622},{10,0,798},{11,0,153},{11,0,351},{11
+,0,375},{12,0,78},{12,0,151},{12,0,392},{12,0,666},{14,0,248},{143,0,23},{6,0,
+1742},{132,11,690},{4,10,403},{5,10,441},{7,10,450},{10,10,840},{11,10,101},{12,
+10,193},{141,10,430},{133,0,965},{134,0,182},{10,0,65},{10,0,488},{138,0,497},{
+135,11,1346},{6,0,973},{6,0,1158},{10,11,200},{19,11,2},{151,11,22},{4,11,190},{
+133,11,554},{133,10,679},{7,0,328},{137,10,326},{133,11,1001},{9,0,588},{138,0,
+260},{133,11,446},{135,10,1128},{135,10,1796},{147,11,119},{134,0,1786},{6,0,
+1328},{6,0,1985},{8,0,962},{138,0,1017},{135,0,308},{11,0,508},{4,10,574},{7,10,
+350},{7,10,1024},{8,10,338},{9,10,677},{138,10,808},{138,11,752},{135,10,1081},{
+137,11,96},{7,10,1676},{135,10,2037},{136,0,588},{132,11,304},{133,0,614},{140,0
+,793},{136,0,287},{137,10,297},{141,10,37},{6,11,53},{6,11,199},{7,11,1408},{8,
+11,32},{8,11,93},{9,11,437},{10,11,397},{10,11,629},{11,11,593},{11,11,763},{13,
+11,326},{145,11,35},{134,11,105},{9,11,320},{10,11,506},{138,11,794},{5,11,114},
+{5,11,255},{141,11,285},{140,0,290},{7,11,2035},{8,11,19},{9,11,89},{138,11,831}
+,{134,0,1136},{7,0,719},{8,0,796},{8,0,809},{8,0,834},{6,10,306},{7,10,1140},{7,
+10,1340},{8,10,133},{138,10,449},{139,10,1011},{5,0,210},{6,0,213},{7,0,60},{10,
+0,364},{139,0,135},{5,0,607},{8,0,326},{136,0,490},{138,11,176},{132,0,701},{5,0
+,472},{7,0,380},{137,0,758},{135,0,1947},{6,0,1079},{138,0,278},{138,11,391},{5,
+10,329},{8,10,260},{139,11,156},{4,0,386},{7,0,41},{8,0,405},{8,0,728},{9,0,497}
+,{11,0,110},{11,0,360},{15,0,37},{144,0,84},{5,0,46},{7,0,1452},{7,0,1480},{8,0,
+634},{140,0,472},{136,0,961},{4,0,524},{136,0,810},{10,0,238},{141,0,33},{132,10
+,657},{152,10,7},{133,0,532},{5,0,997},{135,10,1665},{7,11,594},{7,11,851},{7,11
+,1858},{9,11,411},{9,11,574},{9,11,666},{9,11,737},{10,11,346},{10,11,712},{11,
+11,246},{11,11,432},{11,11,517},{11,11,647},{11,11,679},{11,11,727},{12,11,304},
+{12,11,305},{12,11,323},{12,11,483},{12,11,572},{12,11,593},{12,11,602},{13,11,
+95},{13,11,101},{13,11,171},{13,11,315},{13,11,378},{13,11,425},{13,11,475},{14,
+11,63},{14,11,380},{14,11,384},{15,11,133},{18,11,112},{148,11,72},{5,11,955},{
+136,11,814},{134,0,1301},{5,10,66},{7,10,1896},{136,10,288},{133,11,56},{134,10,
+1643},{6,0,1298},{148,11,100},{5,0,782},{5,0,829},{6,0,671},{6,0,1156},{6,0,1738
+},{137,11,621},{4,0,306},{5,0,570},{7,0,1347},{5,10,91},{5,10,648},{5,10,750},{5
+,10,781},{6,10,54},{6,10,112},{6,10,402},{6,10,1732},{7,10,315},{7,10,749},{7,10
+,1900},{9,10,78},{9,10,508},{10,10,611},{10,10,811},{11,10,510},{11,10,728},{13,
+10,36},{14,10,39},{16,10,83},{17,10,124},{148,10,30},{8,10,570},{9,11,477},{141,
+11,78},{4,11,639},{10,11,4},{10,10,322},{10,10,719},{11,10,407},{11,11,638},{12,
+11,177},{148,11,57},{7,0,1823},{139,0,693},{7,0,759},{5,11,758},{8,10,125},{8,10
+,369},{8,10,524},{10,10,486},{11,10,13},{11,10,381},{11,10,736},{11,10,766},{11,
+10,845},{13,10,114},{13,10,292},{142,10,47},{7,0,1932},{6,10,1684},{6,10,1731},{
+7,10,356},{8,10,54},{8,10,221},{9,10,225},{9,10,356},{10,10,77},{10,10,446},{10,
+10,731},{12,10,404},{141,10,491},{135,11,552},{135,11,1112},{4,0,78},{5,0,96},{5
+,0,182},{6,0,1257},{7,0,1724},{7,0,1825},{10,0,394},{10,0,471},{11,0,532},{14,0,
+340},{145,0,88},{139,11,328},{135,0,1964},{132,10,411},{4,10,80},{5,10,44},{137,
+11,133},{5,11,110},{6,11,169},{6,11,1702},{7,11,400},{8,11,538},{9,11,184},{9,11
+,524},{140,11,218},{4,0,521},{5,10,299},{7,10,1083},{140,11,554},{6,11,133},{9,
+11,353},{12,11,628},{146,11,79},{6,0,215},{7,0,584},{7,0,1028},{7,0,1473},{7,0,
+1721},{9,0,424},{138,0,779},{7,0,857},{7,0,1209},{7,10,1713},{9,10,537},{10,10,
+165},{12,10,219},{140,10,561},{4,10,219},{6,11,93},{7,11,1422},{7,10,1761},{7,11
+,1851},{8,11,673},{9,10,86},{9,11,529},{140,11,43},{137,11,371},{136,0,671},{5,0
+,328},{135,0,918},{132,0,529},{9,11,25},{10,11,467},{138,11,559},{4,11,335},{135
+,11,942},{134,0,716},{134,0,1509},{6,0,67},{7,0,258},{7,0,1630},{9,0,354},{9,0,
+675},{10,0,830},{14,0,80},{17,0,80},{140,10,428},{134,0,1112},{6,0,141},{7,0,225
+},{9,0,59},{9,0,607},{10,0,312},{11,0,687},{12,0,555},{13,0,373},{13,0,494},{148
+,0,58},{133,10,514},{8,11,39},{10,11,773},{11,11,84},{12,11,205},{142,11,1},{8,0
+,783},{5,11,601},{133,11,870},{136,11,594},{4,10,55},{5,10,301},{6,10,571},{14,
+10,49},{146,10,102},{132,11,181},{134,11,1652},{133,10,364},{4,11,97},{5,11,147}
+,{6,11,286},{7,11,1362},{141,11,176},{4,10,76},{7,10,1550},{9,10,306},{9,10,430}
+,{9,10,663},{10,10,683},{11,10,427},{11,10,753},{12,10,334},{12,10,442},{14,10,
+258},{14,10,366},{143,10,131},{137,10,52},{6,0,955},{134,0,1498},{6,11,375},{7,
+11,169},{7,11,254},{136,11,780},{7,0,430},{11,0,46},{14,0,343},{142,11,343},{135
+,0,1183},{5,0,602},{7,0,2018},{9,0,418},{9,0,803},{135,11,1447},{8,0,677},{135,
+11,1044},{139,11,285},{4,10,656},{135,10,779},{135,10,144},{5,11,629},{135,11,
+1549},{135,10,1373},{138,11,209},{7,10,554},{7,10,605},{141,10,10},{5,10,838},{5
+,10,841},{134,10,1649},{133,10,1012},{6,0,1357},{134,0,1380},{144,0,53},{6,0,590
+},{7,10,365},{7,10,1357},{7,10,1497},{8,10,154},{141,10,281},{133,10,340},{132,
+11,420},{135,0,329},{147,11,32},{4,0,469},{10,11,429},{139,10,495},{8,10,261},{9
+,10,144},{9,10,466},{10,10,370},{12,10,470},{13,10,144},{142,10,348},{142,0,460}
+,{4,11,325},{9,10,897},{138,11,125},{6,0,1743},{6,10,248},{9,10,546},{10,10,535}
+,{11,10,681},{141,10,135},{4,0,990},{5,0,929},{6,0,340},{8,0,376},{8,0,807},{8,0
+,963},{8,0,980},{138,0,1007},{134,0,1603},{140,0,250},{4,11,714},{133,11,469},{
+134,10,567},{136,10,445},{5,0,218},{7,0,1610},{8,0,646},{10,0,83},{11,11,138},{
+140,11,40},{7,0,1512},{135,0,1794},{135,11,1216},{11,0,0},{16,0,78},{132,11,718}
+,{133,0,571},{132,0,455},{134,0,1012},{5,11,124},{5,11,144},{6,11,548},{7,11,15}
+,{7,11,153},{137,11,629},{142,11,10},{6,11,75},{7,11,1531},{8,11,416},{9,11,240}
+,{9,11,275},{10,11,100},{11,11,658},{11,11,979},{12,11,86},{13,11,468},{14,11,66
+},{14,11,207},{15,11,20},{15,11,25},{144,11,58},{132,10,577},{5,11,141},{5,11,
+915},{6,11,1783},{7,11,211},{7,11,698},{7,11,1353},{9,11,83},{9,11,281},{10,11,
+376},{10,11,431},{11,11,543},{12,11,664},{13,11,280},{13,11,428},{14,11,61},{14,
+11,128},{17,11,52},{145,11,81},{6,0,161},{7,0,372},{137,0,597},{132,0,349},{10,
+11,702},{139,11,245},{134,0,524},{134,10,174},{6,0,432},{9,0,751},{139,0,322},{
+147,11,94},{4,11,338},{133,11,400},{5,0,468},{10,0,325},{11,0,856},{12,0,345},{
+143,0,104},{133,0,223},{132,0,566},{4,11,221},{5,11,659},{5,11,989},{7,11,697},{
+7,11,1211},{138,11,284},{135,11,1070},{4,0,59},{135,0,1394},{6,0,436},{11,0,481}
+,{5,10,878},{133,10,972},{4,0,48},{5,0,271},{135,0,953},{5,0,610},{136,0,457},{4
+,0,773},{5,0,618},{137,0,756},{133,0,755},{135,0,1217},{138,11,507},{132,10,351}
+,{132,0,197},{143,11,78},{4,11,188},{7,11,805},{11,11,276},{142,11,293},{5,11,
+884},{139,11,991},{132,10,286},{10,0,259},{10,0,428},{7,10,438},{7,10,627},{7,10
+,1516},{8,10,40},{9,10,56},{9,10,294},{11,10,969},{11,10,995},{146,10,148},{4,0,
+356},{5,0,217},{5,0,492},{5,0,656},{8,0,544},{136,11,544},{5,0,259},{6,0,1230},{
+7,0,414},{7,0,854},{142,0,107},{132,0,1007},{15,0,14},{144,0,5},{6,0,1580},{132,
+10,738},{132,11,596},{132,0,673},{133,10,866},{6,0,1843},{135,11,1847},{4,0,165}
+,{7,0,1398},{135,0,1829},{135,11,1634},{147,11,65},{6,0,885},{6,0,1009},{137,0,
+809},{133,10,116},{132,10,457},{136,11,770},{9,0,498},{12,0,181},{10,11,361},{
+142,11,316},{134,11,595},{5,0,9},{7,0,297},{7,0,966},{140,0,306},{4,11,89},{5,11
+,489},{6,11,315},{7,11,553},{7,11,1745},{138,11,243},{134,0,1487},{132,0,437},{5
+,0,146},{6,0,411},{138,0,721},{5,10,527},{6,10,189},{135,10,859},{11,10,104},{11
+,10,554},{15,10,60},{143,10,125},{6,11,1658},{9,11,3},{10,11,154},{11,11,641},{
+13,11,85},{13,11,201},{141,11,346},{6,0,177},{135,0,467},{134,0,1377},{134,10,
+116},{136,11,645},{4,11,166},{5,11,505},{6,11,1670},{137,11,110},{133,10,487},{4
+,10,86},{5,10,667},{5,10,753},{6,10,316},{6,10,455},{135,10,946},{133,0,200},{
+132,0,959},{6,0,1928},{134,0,1957},{139,11,203},{150,10,45},{4,10,79},{7,10,1773
+},{10,10,450},{11,10,589},{13,10,332},{13,10,493},{14,10,183},{14,10,334},{14,10
+,362},{14,10,368},{14,10,376},{14,10,379},{19,10,90},{19,10,103},{19,10,127},{
+148,10,90},{6,0,1435},{135,11,1275},{134,0,481},{7,11,445},{8,11,307},{8,11,704}
+,{10,11,41},{10,11,439},{11,11,237},{11,11,622},{140,11,201},{135,11,869},{4,0,
+84},{7,0,1482},{10,0,76},{138,0,142},{11,11,277},{144,11,14},{135,11,1977},{4,11
+,189},{5,11,713},{136,11,57},{133,0,1015},{138,11,371},{4,0,315},{5,0,507},{135,
+0,1370},{4,11,552},{142,10,381},{9,0,759},{16,0,31},{16,0,39},{16,0,75},{18,0,24
+},{20,0,42},{152,0,1},{134,0,712},{134,0,1722},{133,10,663},{133,10,846},{8,0,
+222},{8,0,476},{9,0,238},{11,0,516},{11,0,575},{15,0,109},{146,0,100},{7,0,1402}
+,{7,0,1414},{12,0,456},{5,10,378},{8,10,465},{9,10,286},{10,10,185},{10,10,562},
+{10,10,635},{11,10,31},{11,10,393},{13,10,312},{18,10,65},{18,10,96},{147,10,89}
+,{4,0,986},{6,0,1958},{6,0,2032},{8,0,934},{138,0,985},{7,10,1880},{9,10,680},{
+139,10,798},{134,10,1770},{145,11,49},{132,11,614},{132,10,648},{5,10,945},{6,10
+,1656},{6,10,1787},{7,10,167},{8,10,824},{9,10,391},{10,10,375},{139,10,185},{
+138,11,661},{7,0,1273},{135,11,1945},{7,0,706},{7,0,1058},{138,0,538},{7,10,1645
+},{8,10,352},{137,10,249},{132,10,152},{11,0,92},{11,0,196},{11,0,409},{11,0,450
+},{11,0,666},{11,0,777},{12,0,262},{13,0,385},{13,0,393},{15,0,115},{16,0,45},{
+145,0,82},{133,10,1006},{6,0,40},{135,0,1781},{9,11,614},{139,11,327},{5,10,420}
+,{135,10,1449},{135,0,431},{10,0,97},{135,10,832},{6,0,423},{7,0,665},{135,0,
+1210},{7,0,237},{8,0,664},{9,0,42},{9,0,266},{9,0,380},{9,0,645},{10,0,177},{138
+,0,276},{7,0,264},{133,10,351},{8,0,213},{5,10,40},{7,10,598},{7,10,1638},{9,10,
+166},{9,10,640},{9,10,685},{9,10,773},{11,10,215},{13,10,65},{14,10,172},{14,10,
+317},{145,10,6},{5,11,84},{134,11,163},{8,10,60},{9,10,343},{139,10,769},{137,0,
+455},{133,11,410},{8,0,906},{12,0,700},{12,0,706},{140,0,729},{21,11,33},{150,11
+,40},{7,10,1951},{8,10,765},{8,10,772},{140,10,671},{7,10,108},{8,10,219},{8,10,
+388},{9,10,639},{9,10,775},{11,10,275},{140,10,464},{5,11,322},{7,11,1941},{8,11
+,186},{9,11,262},{10,11,187},{14,11,208},{146,11,130},{139,0,624},{8,0,574},{5,
+11,227},{140,11,29},{7,11,1546},{11,11,299},{142,11,407},{5,10,15},{6,10,56},{7,
+10,1758},{8,10,500},{9,10,730},{11,10,331},{13,10,150},{142,10,282},{7,11,1395},
+{8,11,486},{9,11,236},{9,11,878},{10,11,218},{11,11,95},{19,11,17},{147,11,31},{
+135,11,2043},{4,0,354},{146,11,4},{140,11,80},{135,0,1558},{134,10,1886},{5,10,
+205},{6,10,438},{137,10,711},{133,11,522},{133,10,534},{7,0,235},{7,0,1475},{15,
+0,68},{146,0,120},{137,10,691},{4,0,942},{6,0,1813},{8,0,917},{10,0,884},{12,0,
+696},{12,0,717},{12,0,723},{12,0,738},{12,0,749},{12,0,780},{16,0,97},{146,0,169
+},{6,10,443},{8,11,562},{9,10,237},{9,10,571},{9,10,695},{10,10,139},{11,10,715}
+,{12,10,417},{141,10,421},{135,0,957},{133,0,830},{134,11,1771},{146,0,23},{5,0,
+496},{6,0,694},{7,0,203},{7,11,1190},{137,11,620},{137,11,132},{6,0,547},{134,0,
+1549},{8,11,258},{9,11,208},{137,11,359},{4,0,864},{5,0,88},{137,0,239},{135,11,
+493},{4,11,317},{135,11,1279},{132,11,477},{4,10,578},{5,11,63},{133,11,509},{7,
+0,650},{135,0,1310},{7,0,1076},{9,0,80},{11,0,78},{11,0,421},{11,0,534},{140,0,
+545},{132,11,288},{12,0,553},{14,0,118},{133,10,923},{7,0,274},{11,0,479},{139,0
+,507},{8,11,89},{8,11,620},{9,11,49},{10,11,774},{11,11,628},{12,11,322},{143,11
+,124},{4,0,497},{135,0,1584},{7,0,261},{7,0,1115},{7,0,1354},{7,0,1404},{7,0,
+1588},{7,0,1705},{7,0,1902},{9,0,465},{10,0,248},{10,0,349},{10,0,647},{11,0,527
+},{11,0,660},{11,0,669},{12,0,529},{13,0,305},{132,10,924},{133,10,665},{136,0,
+13},{6,0,791},{138,11,120},{7,0,642},{8,0,250},{11,0,123},{11,0,137},{13,0,48},{
+142,0,95},{4,10,265},{7,10,807},{135,10,950},{5,10,93},{140,10,267},{135,0,1429}
+,{4,0,949},{10,0,885},{10,0,891},{10,0,900},{10,0,939},{12,0,760},{142,0,449},{
+139,11,366},{132,0,818},{134,11,85},{135,10,994},{7,0,330},{5,10,233},{5,10,320}
+,{6,10,140},{136,10,295},{4,0,1004},{8,0,982},{136,0,993},{133,10,978},{4,10,905
+},{6,10,1701},{137,10,843},{10,0,545},{140,0,301},{6,0,947},{134,0,1062},{134,0,
+1188},{4,0,904},{5,0,794},{152,10,6},{134,0,1372},{135,11,608},{5,11,279},{6,11,
+235},{7,11,468},{8,11,446},{9,11,637},{10,11,717},{11,11,738},{140,11,514},{132,
+10,509},{5,11,17},{6,11,371},{137,11,528},{132,0,693},{4,11,115},{5,11,669},{6,
+11,407},{8,11,311},{11,11,10},{141,11,5},{11,0,377},{7,10,273},{137,11,381},{135
+,0,695},{7,0,386},{138,0,713},{135,10,1041},{134,0,1291},{6,0,7},{6,0,35},{7,0,
+147},{7,0,1069},{7,0,1568},{7,0,1575},{7,0,1917},{8,0,43},{8,0,208},{9,0,128},{9
+,0,866},{10,0,20},{11,0,981},{147,0,33},{7,0,893},{141,0,424},{139,10,234},{150,
+11,56},{5,11,779},{5,11,807},{6,11,1655},{134,11,1676},{5,10,802},{7,10,2021},{
+136,10,805},{4,11,196},{5,10,167},{5,11,558},{5,10,899},{5,11,949},{6,10,410},{
+137,10,777},{137,10,789},{134,10,1705},{8,0,904},{140,0,787},{6,0,322},{9,0,552}
+,{11,0,274},{13,0,209},{13,0,499},{14,0,85},{15,0,126},{145,0,70},{135,10,10},{5
+,10,11},{6,10,117},{6,10,485},{7,10,1133},{9,10,582},{9,10,594},{11,10,21},{11,
+10,818},{12,10,535},{141,10,86},{4,10,264},{7,10,1067},{8,10,204},{8,10,385},{
+139,10,953},{132,11,752},{138,10,56},{133,10,470},{6,0,1808},{8,0,83},{8,0,742},
+{8,0,817},{9,0,28},{9,0,29},{9,0,885},{10,0,387},{11,0,633},{11,0,740},{13,0,235
+},{13,0,254},{15,0,143},{143,0,146},{140,0,49},{134,0,1832},{4,11,227},{5,11,159
+},{5,11,409},{7,11,80},{10,11,294},{10,11,479},{12,11,418},{14,11,50},{14,11,249
+},{142,11,295},{7,11,1470},{8,11,66},{8,11,137},{8,11,761},{9,11,638},{11,11,80}
+,{11,11,212},{11,11,368},{11,11,418},{12,11,8},{13,11,15},{16,11,61},{17,11,59},
+{19,11,28},{148,11,84},{139,10,1015},{138,11,468},{135,0,421},{6,0,415},{7,0,
+1049},{137,0,442},{6,11,38},{7,11,1220},{8,11,185},{8,11,256},{9,11,22},{9,11,
+331},{10,11,738},{11,11,205},{11,11,540},{11,11,746},{13,11,399},{13,11,465},{14
+,11,88},{142,11,194},{139,0,289},{133,10,715},{4,0,110},{10,0,415},{10,0,597},{
+142,0,206},{4,11,159},{6,11,115},{7,11,252},{7,11,257},{7,11,1928},{8,11,69},{9,
+11,384},{10,11,91},{10,11,615},{12,11,375},{14,11,235},{18,11,117},{147,11,123},
+{5,11,911},{136,11,278},{7,0,205},{7,0,2000},{8,10,794},{9,10,400},{10,10,298},{
+142,10,228},{135,11,1774},{4,11,151},{7,11,1567},{8,11,351},{137,11,322},{136,10
+,724},{133,11,990},{7,0,1539},{11,0,512},{13,0,205},{19,0,30},{22,0,36},{23,0,19
+},{135,11,1539},{5,11,194},{7,11,1662},{9,11,90},{140,11,180},{6,10,190},{7,10,
+768},{135,10,1170},{134,0,1340},{4,0,283},{135,0,1194},{133,11,425},{133,11,971}
+,{12,0,549},{14,10,67},{147,10,60},{135,10,1023},{134,0,1720},{138,11,587},{5,11
+,72},{6,11,264},{7,11,21},{7,11,46},{7,11,2013},{8,11,215},{8,11,513},{10,11,266
+},{139,11,22},{5,0,319},{135,0,534},{6,10,137},{9,10,75},{9,10,253},{10,10,194},
+{138,10,444},{7,0,1180},{20,0,112},{6,11,239},{7,11,118},{10,11,95},{11,11,603},
+{13,11,443},{14,11,160},{143,11,4},{134,11,431},{5,11,874},{6,11,1677},{11,10,
+643},{12,10,115},{143,11,0},{134,0,967},{6,11,65},{7,11,939},{7,11,1172},{7,11,
+1671},{9,11,540},{10,11,696},{11,11,265},{11,11,732},{11,11,928},{11,11,937},{12
+,11,399},{13,11,438},{149,11,19},{137,11,200},{135,0,1940},{5,10,760},{7,10,542}
+,{8,10,135},{136,10,496},{140,11,44},{7,11,1655},{136,11,305},{7,10,319},{7,10,
+355},{7,10,763},{10,10,389},{145,10,43},{136,0,735},{138,10,786},{137,11,19},{
+132,11,696},{5,0,132},{9,0,486},{9,0,715},{10,0,458},{11,0,373},{11,0,668},{11,0
+,795},{11,0,897},{12,0,272},{12,0,424},{12,0,539},{12,0,558},{14,0,245},{14,0,
+263},{14,0,264},{14,0,393},{142,0,403},{10,0,38},{139,0,784},{132,0,838},{4,11,
+302},{135,11,1766},{133,0,379},{5,0,8},{6,0,89},{6,0,400},{7,0,1569},{7,0,1623},
+{7,0,1850},{8,0,218},{8,0,422},{9,0,570},{10,0,626},{4,11,726},{133,11,630},{4,0
+,1017},{138,0,660},{6,0,387},{7,0,882},{141,0,111},{6,0,224},{7,0,877},{137,0,
+647},{4,10,58},{5,10,286},{6,10,319},{7,10,402},{7,10,1254},{7,10,1903},{8,10,
+356},{140,10,408},{135,0,790},{9,0,510},{10,0,53},{4,10,389},{9,10,181},{10,10,
+29},{10,10,816},{11,10,311},{11,10,561},{12,10,67},{141,10,181},{142,0,458},{6,
+11,118},{7,11,215},{7,11,1521},{140,11,11},{134,0,954},{135,0,394},{134,0,1367},
+{5,11,225},{133,10,373},{132,0,882},{7,0,1409},{135,10,1972},{135,10,1793},{4,11
+,370},{5,11,756},{135,11,1326},{150,11,13},{7,11,354},{10,11,410},{139,11,815},{
+6,11,1662},{7,11,48},{8,11,771},{10,11,116},{13,11,104},{14,11,105},{14,11,184},
+{15,11,168},{19,11,92},{148,11,68},{7,0,124},{136,0,38},{5,0,261},{7,0,78},{7,0,
+199},{8,0,815},{9,0,126},{10,0,342},{140,0,647},{4,0,628},{140,0,724},{7,0,266},
+{8,0,804},{7,10,1651},{145,10,89},{135,0,208},{134,0,1178},{6,0,79},{135,0,1519}
+,{132,10,672},{133,10,737},{136,0,741},{132,11,120},{4,0,710},{6,0,376},{134,0,
+606},{134,0,1347},{134,0,1494},{6,0,850},{6,0,1553},{137,0,821},{5,10,145},{134,
+11,593},{7,0,1311},{140,0,135},{4,0,467},{5,0,405},{134,0,544},{5,11,820},{135,
+11,931},{6,0,100},{7,0,244},{7,0,632},{7,0,1609},{8,0,178},{8,0,638},{141,0,58},
+{4,10,387},{135,10,1288},{6,11,151},{6,11,1675},{7,11,383},{151,11,10},{132,0,
+481},{135,10,550},{134,0,1378},{6,11,1624},{11,11,11},{12,11,422},{13,11,262},{
+142,11,360},{133,0,791},{4,11,43},{5,11,344},{133,11,357},{7,0,1227},{140,0,978}
+,{7,0,686},{8,0,33},{8,0,238},{10,0,616},{11,0,467},{11,0,881},{13,0,217},{13,0,
+253},{142,0,268},{137,0,857},{8,0,467},{8,0,1006},{7,11,148},{8,11,284},{141,11,
+63},{4,10,576},{135,10,1263},{133,11,888},{5,10,919},{134,10,1673},{20,10,37},{
+148,11,37},{132,0,447},{132,11,711},{4,0,128},{5,0,415},{6,0,462},{7,0,294},{7,0
+,578},{10,0,710},{139,0,86},{4,10,82},{5,10,333},{5,10,904},{6,10,207},{7,10,325
+},{7,10,1726},{8,10,101},{10,10,778},{139,10,220},{136,0,587},{137,11,440},{133,
+10,903},{6,0,427},{7,0,1018},{138,0,692},{4,0,195},{135,0,802},{140,10,147},{134
+,0,1546},{134,0,684},{132,10,705},{136,0,345},{11,11,678},{140,11,307},{133,0,
+365},{134,0,1683},{4,11,65},{5,11,479},{5,11,1004},{7,11,1913},{8,11,317},{9,11,
+302},{10,11,612},{141,11,22},{138,0,472},{4,11,261},{135,11,510},{134,10,90},{
+142,0,433},{151,0,28},{4,11,291},{7,11,101},{9,11,515},{12,11,152},{12,11,443},{
+13,11,392},{142,11,357},{140,0,997},{5,0,3},{8,0,578},{9,0,118},{10,0,705},{141,
+0,279},{135,11,1266},{7,10,813},{12,10,497},{141,10,56},{133,0,229},{6,10,125},{
+135,10,1277},{8,0,102},{10,0,578},{10,0,672},{12,0,496},{13,0,408},{14,0,121},{
+17,0,106},{151,10,12},{6,0,866},{134,0,1080},{136,0,1022},{4,11,130},{135,11,843
+},{5,11,42},{5,11,879},{7,11,245},{7,11,324},{7,11,1532},{11,11,463},{11,11,472}
+,{13,11,363},{144,11,52},{150,0,55},{8,0,115},{8,0,350},{9,0,489},{10,0,128},{11
+,0,306},{12,0,373},{14,0,30},{17,0,79},{19,0,80},{4,11,134},{133,11,372},{134,0,
+657},{134,0,933},{135,11,1147},{4,0,230},{133,0,702},{134,0,1728},{4,0,484},{18,
+0,26},{19,0,42},{20,0,43},{21,0,0},{23,0,27},{152,0,14},{7,0,185},{135,0,703},{6
+,0,417},{10,0,618},{7,10,1106},{9,10,770},{11,10,112},{140,10,413},{134,0,803},{
+132,11,644},{134,0,1262},{7,11,540},{12,10,271},{145,10,109},{135,11,123},{132,0
+,633},{134,11,623},{4,11,908},{5,11,359},{5,11,508},{6,11,1723},{7,11,343},{7,11
+,1996},{135,11,2026},{135,0,479},{10,0,262},{7,10,304},{9,10,646},{9,10,862},{11
+,10,696},{12,10,208},{15,10,79},{147,10,108},{4,11,341},{135,11,480},{134,0,830}
+,{5,0,70},{5,0,622},{6,0,334},{7,0,1032},{9,0,171},{11,0,26},{11,0,213},{11,0,
+637},{11,0,707},{12,0,202},{12,0,380},{13,0,226},{13,0,355},{14,0,222},{145,0,42
+},{135,10,981},{143,0,217},{137,11,114},{4,0,23},{4,0,141},{5,0,313},{5,0,1014},
+{6,0,50},{6,0,51},{7,0,142},{7,0,384},{7,0,559},{8,0,640},{9,0,460},{9,0,783},{
+11,0,741},{12,0,183},{141,0,488},{141,0,360},{7,0,1586},{7,11,1995},{8,11,299},{
+11,11,890},{140,11,674},{132,10,434},{7,0,652},{134,10,550},{7,0,766},{5,10,553}
+,{138,10,824},{7,0,737},{8,0,298},{136,10,452},{4,11,238},{5,11,503},{6,11,179},
+{7,11,2003},{8,11,381},{8,11,473},{9,11,149},{10,11,183},{15,11,45},{143,11,86},
+{133,10,292},{5,0,222},{9,0,655},{138,0,534},{138,10,135},{4,11,121},{5,11,156},
+{5,11,349},{9,11,136},{10,11,605},{14,11,342},{147,11,107},{137,0,906},{6,0,1013
+},{134,0,1250},{6,0,1956},{6,0,2009},{8,0,991},{144,0,120},{135,11,1192},{138,0,
+503},{5,0,154},{7,0,1491},{10,0,379},{138,0,485},{6,0,1867},{6,0,1914},{6,0,1925
+},{9,0,917},{9,0,925},{9,0,932},{9,0,951},{9,0,1007},{9,0,1013},{12,0,806},{12,0
+,810},{12,0,814},{12,0,816},{12,0,824},{12,0,832},{12,0,837},{12,0,863},{12,0,
+868},{12,0,870},{12,0,889},{12,0,892},{12,0,900},{12,0,902},{12,0,908},{12,0,933
+},{12,0,942},{12,0,949},{12,0,954},{15,0,175},{15,0,203},{15,0,213},{15,0,218},{
+15,0,225},{15,0,231},{15,0,239},{15,0,248},{15,0,252},{18,0,190},{18,0,204},{18,
+0,215},{18,0,216},{18,0,222},{18,0,225},{18,0,230},{18,0,239},{18,0,241},{21,0,
+42},{21,0,43},{21,0,44},{21,0,45},{21,0,46},{21,0,53},{24,0,27},{152,0,31},{133,
+0,716},{135,0,844},{4,0,91},{5,0,388},{5,0,845},{6,0,206},{6,0,252},{6,0,365},{7
+,0,136},{7,0,531},{136,0,621},{7,10,393},{10,10,603},{139,10,206},{6,11,80},{6,
+11,1694},{7,11,173},{7,11,1974},{9,11,547},{10,11,730},{14,11,18},{150,11,39},{
+137,0,748},{4,11,923},{134,11,1711},{4,10,912},{137,10,232},{7,10,98},{7,10,1973
+},{136,10,716},{14,0,103},{133,10,733},{132,11,595},{12,0,158},{18,0,8},{19,0,62
+},{20,0,6},{22,0,4},{23,0,2},{23,0,9},{5,11,240},{6,11,459},{7,11,12},{7,11,114}
+,{7,11,502},{7,11,1751},{7,11,1753},{7,11,1805},{8,11,658},{9,11,1},{11,11,959},
+{13,11,446},{142,11,211},{135,0,576},{5,0,771},{5,0,863},{5,0,898},{6,0,648},{6,
+0,1632},{6,0,1644},{134,0,1780},{133,0,331},{7,11,633},{7,11,905},{7,11,909},{7,
+11,1538},{9,11,767},{140,11,636},{140,0,632},{5,0,107},{7,0,201},{136,0,518},{6,
+0,446},{7,0,1817},{134,11,490},{9,0,851},{141,0,510},{7,11,250},{8,11,506},{136,
+11,507},{4,0,504},{137,10,72},{132,11,158},{4,11,140},{7,11,362},{8,11,209},{9,
+11,10},{9,11,160},{9,11,503},{10,11,689},{11,11,350},{11,11,553},{11,11,725},{12
+,11,252},{12,11,583},{13,11,192},{13,11,352},{14,11,269},{14,11,356},{148,11,50}
+,{6,11,597},{135,11,1318},{135,10,1454},{5,0,883},{5,0,975},{8,0,392},{148,0,7},
+{6,11,228},{7,11,1341},{9,11,408},{138,11,343},{11,11,348},{11,10,600},{12,11,99
+},{13,10,245},{18,11,1},{18,11,11},{147,11,4},{134,11,296},{5,0,922},{134,0,1707
+},{132,11,557},{4,11,548},{7,10,164},{7,10,1571},{9,10,107},{140,10,225},{7,11,
+197},{8,11,142},{8,11,325},{9,11,150},{9,11,596},{10,11,350},{10,11,353},{11,11,
+74},{11,11,315},{14,11,423},{143,11,141},{5,0,993},{7,0,515},{137,0,91},{4,0,131
+},{8,0,200},{5,10,484},{5,10,510},{6,10,434},{7,10,1000},{7,10,1098},{136,10,2},
+{152,0,10},{4,11,62},{5,11,83},{6,11,399},{6,11,579},{7,11,692},{7,11,846},{7,11
+,1015},{7,11,1799},{8,11,403},{9,11,394},{10,11,133},{12,11,4},{12,11,297},{12,
+11,452},{16,11,81},{18,11,19},{18,11,25},{21,11,14},{22,11,12},{151,11,18},{140,
+11,459},{132,11,177},{7,0,1433},{9,0,365},{137,11,365},{132,10,460},{5,0,103},{6
+,0,2004},{7,0,921},{8,0,580},{8,0,593},{8,0,630},{10,0,28},{5,11,411},{135,11,
+653},{4,10,932},{133,10,891},{4,0,911},{5,0,867},{5,0,1013},{7,0,2034},{8,0,798}
+,{136,0,813},{7,11,439},{10,11,727},{11,11,260},{139,11,684},{136,10,625},{5,11,
+208},{7,11,753},{135,11,1528},{5,0,461},{7,0,1925},{12,0,39},{13,0,265},{13,0,
+439},{134,10,76},{6,0,853},{8,10,92},{137,10,221},{5,0,135},{6,0,519},{7,0,1722}
+,{10,0,271},{11,0,261},{145,0,54},{139,11,814},{14,0,338},{148,0,81},{4,0,300},{
+133,0,436},{5,0,419},{5,0,687},{7,0,864},{9,0,470},{135,11,864},{9,0,836},{133,
+11,242},{134,0,1937},{4,10,763},{133,11,953},{132,10,622},{132,0,393},{133,10,
+253},{8,0,357},{10,0,745},{14,0,426},{17,0,94},{19,0,57},{135,10,546},{5,11,615}
+,{146,11,37},{9,10,73},{10,10,110},{14,10,185},{145,10,119},{11,0,703},{7,10,624
+},{7,10,916},{10,10,256},{139,10,87},{133,11,290},{5,10,212},{12,10,35},{141,10,
+382},{132,11,380},{5,11,52},{7,11,277},{9,11,368},{139,11,791},{133,0,387},{10,
+11,138},{139,11,476},{4,0,6},{5,0,708},{136,0,75},{7,0,1351},{9,0,581},{10,0,639
+},{11,0,453},{140,0,584},{132,0,303},{138,0,772},{135,10,1175},{4,0,749},{5,10,
+816},{6,11,256},{7,11,307},{7,11,999},{7,11,1481},{7,11,1732},{7,11,1738},{8,11,
+265},{9,11,414},{11,11,316},{12,11,52},{13,11,420},{147,11,100},{135,11,1296},{6
+,0,1065},{5,10,869},{5,10,968},{6,10,1626},{8,10,734},{136,10,784},{4,10,542},{6
+,10,1716},{6,10,1727},{7,10,1082},{7,10,1545},{8,10,56},{8,10,118},{8,10,412},{8
+,10,564},{9,10,888},{9,10,908},{10,10,50},{10,10,423},{11,10,685},{11,10,697},{
+11,10,933},{12,10,299},{13,10,126},{13,10,136},{13,10,170},{141,10,190},{134,0,
+226},{4,0,106},{7,0,310},{11,0,717},{133,11,723},{5,0,890},{5,0,988},{4,10,232},
+{9,10,202},{10,10,474},{140,10,433},{6,0,626},{142,0,431},{10,0,706},{150,0,44},
+{13,0,51},{6,10,108},{7,10,1003},{7,10,1181},{8,10,111},{136,10,343},{132,0,698}
+,{5,11,109},{6,11,1784},{7,11,1895},{12,11,296},{140,11,302},{134,0,828},{134,10
+,1712},{138,0,17},{7,0,1929},{4,10,133},{5,11,216},{7,10,711},{7,10,1298},{7,10,
+1585},{7,11,1879},{9,11,141},{9,11,270},{9,11,679},{10,11,159},{10,11,553},{11,
+11,197},{11,11,438},{12,11,538},{12,11,559},{13,11,193},{13,11,423},{14,11,144},
+{14,11,166},{14,11,167},{15,11,67},{147,11,84},{141,11,127},{7,11,1872},{137,11,
+81},{6,10,99},{7,10,1808},{145,10,57},{134,11,391},{5,0,689},{6,0,84},{7,0,1250}
+,{6,10,574},{7,10,428},{10,10,669},{11,10,485},{11,10,840},{12,10,300},{142,10,
+250},{7,11,322},{136,11,249},{7,11,432},{135,11,1649},{135,10,1871},{137,10,252}
+,{6,11,155},{140,11,234},{7,0,871},{19,0,27},{147,11,27},{140,0,498},{5,0,986},{
+6,0,130},{138,0,823},{6,0,1793},{7,0,1582},{8,0,458},{10,0,101},{10,0,318},{10,0
+,945},{12,0,734},{16,0,104},{18,0,177},{6,10,323},{135,10,1564},{5,11,632},{138,
+11,526},{10,0,435},{7,10,461},{136,10,775},{6,11,144},{7,11,948},{7,11,1042},{7,
+11,1857},{8,11,235},{8,11,461},{9,11,453},{9,11,530},{10,11,354},{17,11,77},{19,
+11,99},{148,11,79},{138,0,966},{7,0,1644},{137,0,129},{135,0,997},{136,0,502},{5
+,11,196},{6,11,486},{7,11,212},{8,11,309},{136,11,346},{7,10,727},{146,10,73},{
+132,0,823},{132,11,686},{135,0,1927},{4,0,762},{7,0,1756},{137,0,98},{136,10,577
+},{24,0,8},{4,11,30},{5,11,43},{152,11,8},{7,0,1046},{139,0,160},{7,0,492},{4,10
+,413},{5,10,677},{7,11,492},{8,10,432},{140,10,280},{6,0,45},{7,0,433},{8,0,129}
+,{9,0,21},{10,0,392},{11,0,79},{12,0,499},{13,0,199},{141,0,451},{7,0,558},{136,
+0,353},{4,11,220},{7,11,1535},{9,11,93},{139,11,474},{7,10,646},{7,10,1730},{11,
+10,446},{141,10,178},{133,0,785},{134,0,1145},{8,0,81},{9,0,189},{9,0,201},{11,0
+,478},{11,0,712},{141,0,338},{5,0,353},{151,0,26},{11,0,762},{132,10,395},{134,0
+,2024},{4,0,611},{133,0,606},{9,10,174},{10,10,164},{11,10,440},{11,10,841},{143
+,10,98},{134,10,426},{10,10,608},{139,10,1002},{138,10,250},{6,0,25},{7,0,855},{
+7,0,1258},{144,0,32},{7,11,1725},{138,11,393},{5,11,263},{134,11,414},{6,0,2011}
+,{133,10,476},{4,0,4},{7,0,1118},{7,0,1320},{7,0,1706},{8,0,277},{9,0,622},{10,0
+,9},{11,0,724},{12,0,350},{12,0,397},{13,0,28},{13,0,159},{15,0,89},{18,0,5},{19
+,0,9},{20,0,34},{22,0,47},{6,11,178},{6,11,1750},{8,11,251},{9,11,690},{10,11,
+155},{10,11,196},{10,11,373},{11,11,698},{13,11,155},{148,11,93},{5,11,97},{137,
+11,393},{7,0,764},{11,0,461},{12,0,172},{5,10,76},{6,10,458},{6,10,497},{7,10,
+868},{9,10,658},{10,10,594},{11,10,566},{12,10,338},{141,10,200},{134,0,1449},{
+138,11,40},{134,11,1639},{134,0,1445},{6,0,1168},{4,10,526},{7,10,1029},{135,10,
+1054},{4,11,191},{7,11,934},{8,11,647},{145,11,97},{132,10,636},{6,0,233},{7,10,
+660},{7,10,1124},{17,10,31},{19,10,22},{151,10,14},{6,10,1699},{136,11,110},{12,
+11,246},{15,11,162},{19,11,64},{20,11,8},{20,11,95},{22,11,24},{152,11,17},{5,11
+,165},{9,11,346},{138,11,655},{5,11,319},{135,11,534},{134,0,255},{9,0,216},{8,
+11,128},{139,11,179},{9,0,183},{139,0,286},{11,0,956},{151,0,3},{4,0,536},{7,0,
+1141},{10,0,723},{139,0,371},{4,10,279},{7,10,301},{137,10,362},{7,0,285},{5,11,
+57},{6,11,101},{6,11,1663},{7,11,132},{7,11,1048},{7,11,1154},{7,11,1415},{7,11,
+1507},{12,11,493},{15,11,105},{151,11,15},{5,11,459},{7,11,1073},{7,10,1743},{8,
+11,241},{136,11,334},{4,10,178},{133,10,399},{135,0,560},{132,0,690},{135,0,1246
+},{18,0,157},{147,0,63},{10,0,599},{11,0,33},{12,0,571},{149,0,1},{6,11,324},{6,
+11,520},{7,11,338},{7,11,1616},{7,11,1729},{8,11,228},{9,11,69},{139,11,750},{7,
+0,1862},{12,0,491},{12,0,520},{13,0,383},{142,0,244},{135,11,734},{134,10,1692},
+{10,0,448},{11,0,630},{17,0,117},{6,10,202},{7,11,705},{12,10,360},{17,10,118},{
+18,10,27},{148,10,67},{4,11,73},{6,11,612},{7,11,927},{7,11,1822},{8,11,217},{9,
+11,472},{9,11,765},{9,11,766},{10,11,408},{11,11,51},{11,11,793},{12,11,266},{15
+,11,158},{20,11,89},{150,11,32},{4,0,190},{133,0,554},{133,0,1001},{5,11,389},{8
+,11,636},{137,11,229},{5,0,446},{7,10,872},{10,10,516},{139,10,167},{137,10,313}
+,{132,10,224},{134,0,1313},{5,10,546},{7,10,35},{8,10,11},{8,10,12},{9,10,315},{
+9,10,533},{10,10,802},{11,10,166},{12,10,525},{142,10,243},{6,0,636},{137,0,837}
+,{5,10,241},{8,10,242},{9,10,451},{10,10,667},{11,10,598},{140,10,429},{22,10,46
+},{150,11,46},{136,11,472},{11,0,278},{142,0,73},{141,11,185},{132,0,868},{134,0
+,972},{4,10,366},{137,10,516},{138,0,1010},{5,11,189},{6,10,1736},{7,11,442},{7,
+11,443},{8,11,281},{12,11,174},{13,11,83},{141,11,261},{139,11,384},{6,11,2},{7,
+11,191},{7,11,446},{7,11,758},{7,11,1262},{7,11,1737},{8,11,22},{8,11,270},{8,11
+,612},{9,11,4},{9,11,167},{9,11,312},{9,11,436},{10,11,156},{10,11,216},{10,11,
+311},{10,11,623},{11,11,72},{11,11,330},{11,11,455},{12,11,101},{12,11,321},{12,
+11,504},{12,11,530},{12,11,543},{13,11,17},{13,11,156},{13,11,334},{14,11,48},{
+15,11,70},{17,11,60},{148,11,64},{6,10,331},{136,10,623},{135,0,1231},{132,0,304
+},{6,11,60},{7,11,670},{7,11,1327},{8,11,411},{8,11,435},{9,11,653},{9,11,740},{
+10,11,385},{11,11,222},{11,11,324},{11,11,829},{140,11,611},{7,0,506},{6,11,166}
+,{7,11,374},{135,11,1174},{14,11,43},{146,11,21},{135,11,1694},{135,10,1888},{5,
+11,206},{134,11,398},{135,11,50},{150,0,26},{6,0,53},{6,0,199},{7,0,1408},{8,0,
+32},{8,0,93},{10,0,397},{10,0,629},{11,0,593},{11,0,763},{13,0,326},{145,0,35},{
+134,0,105},{132,10,394},{4,0,843},{138,0,794},{11,0,704},{141,0,396},{5,0,114},{
+5,0,255},{141,0,285},{6,0,619},{7,0,898},{7,0,1092},{8,0,485},{18,0,28},{19,0,
+116},{135,10,1931},{9,0,145},{7,10,574},{135,10,1719},{7,0,2035},{8,0,19},{9,0,
+89},{138,0,831},{132,10,658},{6,11,517},{7,11,1159},{10,11,621},{139,11,192},{7,
+0,1933},{7,11,1933},{9,10,781},{10,10,144},{11,10,385},{13,10,161},{13,10,228},{
+13,10,268},{148,10,107},{136,10,374},{10,11,223},{139,11,645},{135,0,1728},{7,11
+,64},{7,11,289},{136,11,245},{4,10,344},{6,10,498},{139,10,323},{136,0,746},{135
+,10,1063},{137,10,155},{4,0,987},{6,0,1964},{6,0,1974},{6,0,1990},{136,0,995},{
+133,11,609},{133,10,906},{134,0,1550},{134,0,874},{5,11,129},{6,11,61},{135,11,
+947},{4,0,1018},{6,0,1938},{6,0,2021},{134,0,2039},{132,0,814},{11,0,126},{139,0
+,287},{134,0,1264},{5,0,955},{136,0,814},{141,11,506},{132,11,314},{6,0,981},{
+139,11,1000},{5,0,56},{8,0,892},{8,0,915},{140,0,776},{148,0,100},{10,0,4},{10,0
+,13},{11,0,638},{148,0,57},{148,11,74},{5,0,738},{132,10,616},{133,11,637},{136,
+10,692},{133,0,758},{132,10,305},{137,11,590},{5,11,280},{135,11,1226},{134,11,
+494},{135,0,1112},{133,11,281},{13,0,44},{14,0,214},{5,10,214},{7,10,603},{8,10,
+611},{9,10,686},{10,10,88},{11,10,459},{11,10,496},{12,10,463},{140,10,590},{139
+,0,328},{135,11,1064},{137,0,133},{7,0,168},{13,0,196},{141,0,237},{134,10,1703}
+,{134,0,1152},{135,0,1245},{5,0,110},{6,0,169},{6,0,1702},{7,0,400},{8,0,538},{9
+,0,184},{9,0,524},{140,0,218},{6,0,1816},{10,0,871},{12,0,769},{140,0,785},{132,
+11,630},{7,11,33},{7,11,120},{8,11,489},{9,11,319},{10,11,820},{11,11,1004},{12,
+11,379},{13,11,117},{13,11,412},{14,11,25},{15,11,52},{15,11,161},{16,11,47},{
+149,11,2},{6,0,133},{8,0,413},{9,0,353},{139,0,993},{145,10,19},{4,11,937},{133,
+11,801},{134,0,978},{6,0,93},{6,0,1508},{7,0,1422},{7,0,1851},{8,0,673},{9,0,529
+},{140,0,43},{6,0,317},{10,0,512},{4,10,737},{11,10,294},{12,10,60},{12,10,437},
+{13,10,64},{13,10,380},{142,10,430},{9,0,371},{7,11,1591},{144,11,43},{6,10,1758
+},{8,10,520},{9,10,345},{9,10,403},{142,10,350},{5,0,526},{10,10,242},{138,10,
+579},{9,0,25},{10,0,467},{138,0,559},{5,10,139},{7,10,1168},{138,10,539},{4,0,
+335},{135,0,942},{140,0,754},{132,11,365},{11,0,182},{142,0,195},{142,11,29},{5,
+11,7},{139,11,774},{4,11,746},{135,11,1090},{8,0,39},{10,0,773},{11,0,84},{12,0,
+205},{142,0,1},{5,0,601},{5,0,870},{5,11,360},{136,11,237},{132,0,181},{136,0,
+370},{134,0,1652},{8,0,358},{4,10,107},{7,10,613},{8,10,439},{8,10,504},{9,10,
+501},{10,10,383},{139,10,477},{132,10,229},{137,11,785},{4,0,97},{5,0,147},{6,0,
+286},{7,0,1362},{141,0,176},{6,0,537},{7,0,788},{7,0,1816},{132,10,903},{140,10,
+71},{6,0,743},{134,0,1223},{6,0,375},{7,0,169},{7,0,254},{8,0,780},{135,11,1493}
+,{7,0,1714},{4,10,47},{6,10,373},{7,10,452},{7,10,543},{7,10,1856},{9,10,6},{11,
+10,257},{139,10,391},{6,0,896},{136,0,1003},{135,0,1447},{137,11,341},{5,10,980}
+,{134,10,1754},{145,11,22},{4,11,277},{5,11,608},{6,11,493},{7,11,457},{140,11,
+384},{7,10,536},{7,10,1331},{136,10,143},{140,0,744},{7,11,27},{135,11,316},{18,
+0,126},{5,10,19},{134,10,533},{4,0,788},{11,0,41},{5,11,552},{5,11,586},{5,11,
+676},{6,11,448},{8,11,244},{11,11,1},{11,11,41},{13,11,3},{16,11,54},{17,11,4},{
+146,11,13},{4,0,985},{6,0,1801},{4,11,401},{137,11,264},{5,10,395},{5,10,951},{
+134,10,1776},{5,0,629},{135,0,1549},{11,10,663},{12,10,210},{13,10,166},{13,10,
+310},{14,10,373},{147,10,43},{9,11,543},{10,11,524},{11,11,30},{12,11,524},{14,
+11,315},{16,11,18},{20,11,26},{148,11,65},{4,11,205},{5,11,623},{7,11,104},{136,
+11,519},{5,0,293},{134,0,601},{7,11,579},{9,11,41},{9,11,244},{9,11,669},{10,11,
+5},{11,11,861},{11,11,951},{139,11,980},{132,11,717},{132,10,695},{7,10,497},{9,
+10,387},{147,10,81},{132,0,420},{142,0,37},{6,0,1134},{6,0,1900},{12,0,830},{12,
+0,878},{12,0,894},{15,0,221},{143,0,245},{132,11,489},{7,0,1570},{140,0,542},{8,
+0,933},{136,0,957},{6,0,1371},{7,0,31},{8,0,373},{5,10,284},{6,10,49},{6,10,350}
+,{7,10,377},{7,10,1693},{8,10,678},{9,10,161},{9,10,585},{9,10,671},{9,10,839},{
+11,10,912},{141,10,427},{135,11,892},{4,0,325},{138,0,125},{139,11,47},{132,10,
+597},{138,0,323},{6,0,1547},{7,11,1605},{9,11,473},{11,11,962},{146,11,139},{139
+,10,908},{7,11,819},{9,11,26},{9,11,392},{10,11,152},{10,11,226},{11,11,19},{12,
+11,276},{12,11,426},{12,11,589},{13,11,460},{15,11,97},{19,11,48},{148,11,104},{
+135,11,51},{4,0,718},{135,0,1216},{6,0,1896},{6,0,1905},{6,0,1912},{9,0,947},{9,
+0,974},{12,0,809},{12,0,850},{12,0,858},{12,0,874},{12,0,887},{12,0,904},{12,0,
+929},{12,0,948},{12,0,952},{15,0,198},{15,0,206},{15,0,220},{15,0,227},{15,0,247
+},{18,0,188},{21,0,48},{21,0,50},{24,0,25},{24,0,29},{7,11,761},{7,11,1051},{137
+,11,545},{5,0,124},{5,0,144},{6,0,548},{7,0,15},{7,0,153},{137,0,629},{135,11,
+606},{135,10,2014},{7,10,2007},{9,11,46},{9,10,101},{9,10,450},{10,10,66},{10,10
+,842},{11,10,536},{140,10,587},{6,0,75},{7,0,1531},{8,0,416},{9,0,240},{9,0,275}
+,{10,0,100},{11,0,658},{11,0,979},{12,0,86},{14,0,207},{15,0,20},{143,0,25},{5,0
+,141},{5,0,915},{6,0,1783},{7,0,211},{7,0,698},{7,0,1353},{9,0,83},{9,0,281},{10
+,0,376},{10,0,431},{11,0,543},{12,0,664},{13,0,280},{13,0,428},{14,0,61},{14,0,
+128},{17,0,52},{145,0,81},{132,11,674},{135,0,533},{149,0,6},{132,11,770},{133,0
+,538},{5,11,79},{7,11,1027},{7,11,1477},{139,11,52},{139,10,62},{4,0,338},{133,0
+,400},{5,11,789},{134,11,195},{4,11,251},{4,11,688},{7,11,513},{7,11,1284},{9,11
+,87},{138,11,365},{134,10,1766},{6,0,0},{7,0,84},{11,0,895},{145,0,11},{139,0,
+892},{4,0,221},{5,0,659},{7,0,697},{7,0,1211},{138,0,284},{133,0,989},{133,11,
+889},{4,11,160},{5,11,330},{7,11,1434},{136,11,174},{6,10,1665},{7,10,256},{7,10
+,1388},{10,10,499},{139,10,670},{7,0,848},{4,10,22},{5,10,10},{136,10,97},{138,0
+,507},{133,10,481},{4,0,188},{135,0,805},{5,0,884},{6,0,732},{139,0,991},{135,11
+,968},{11,11,636},{15,11,145},{17,11,34},{19,11,50},{151,11,20},{7,0,959},{16,0,
+60},{6,10,134},{7,10,437},{9,10,37},{14,10,285},{142,10,371},{7,10,486},{8,10,
+155},{11,10,93},{140,10,164},{134,0,1653},{7,0,337},{133,10,591},{6,0,1989},{8,0
+,922},{8,0,978},{133,11,374},{132,0,638},{138,0,500},{133,11,731},{5,10,380},{5,
+10,650},{136,10,310},{138,11,381},{4,10,364},{7,10,1156},{7,10,1187},{137,10,409
+},{137,11,224},{140,0,166},{134,10,482},{4,11,626},{5,11,642},{6,11,425},{10,11,
+202},{139,11,141},{4,10,781},{6,10,487},{7,10,926},{8,10,263},{139,10,500},{135,
+0,418},{4,10,94},{135,10,1265},{136,0,760},{132,10,417},{136,11,835},{5,10,348},
+{134,10,522},{6,0,1277},{134,0,1538},{139,11,541},{135,11,1597},{5,11,384},{8,11
+,455},{140,11,48},{136,0,770},{5,11,264},{134,11,184},{4,0,89},{5,0,489},{6,0,
+315},{7,0,553},{7,0,1745},{138,0,243},{4,10,408},{4,10,741},{135,10,500},{134,0,
+1396},{133,0,560},{6,0,1658},{9,0,3},{10,0,154},{11,0,641},{13,0,85},{13,0,201},
+{141,0,346},{135,11,1595},{5,11,633},{6,11,28},{7,11,219},{135,11,1323},{9,11,
+769},{140,11,185},{135,11,785},{7,11,359},{8,11,243},{140,11,175},{138,0,586},{7
+,0,1271},{134,10,73},{132,11,105},{4,0,166},{5,0,505},{134,0,1670},{133,10,576},
+{4,11,324},{138,11,104},{142,10,231},{6,0,637},{7,10,1264},{7,10,1678},{11,10,
+945},{12,10,341},{12,10,471},{12,10,569},{23,11,21},{151,11,23},{8,11,559},{141,
+11,109},{134,0,1947},{7,0,445},{8,0,307},{8,0,704},{10,0,41},{10,0,439},{11,0,
+237},{11,0,622},{140,0,201},{135,11,963},{135,0,1977},{4,0,189},{5,0,713},{136,0
+,57},{138,0,371},{135,10,538},{132,0,552},{6,0,883},{133,10,413},{6,0,923},{132,
+11,758},{138,11,215},{136,10,495},{7,10,54},{8,10,312},{10,10,191},{10,10,614},{
+140,10,567},{7,11,351},{139,11,128},{7,0,875},{6,10,468},{7,10,1478},{8,10,530},
+{142,10,290},{135,0,1788},{17,0,49},{133,11,918},{12,11,398},{20,11,39},{21,11,
+11},{150,11,41},{10,0,661},{6,10,484},{135,10,822},{135,0,1945},{134,0,794},{137
+,10,900},{135,10,1335},{6,10,1724},{135,10,2022},{132,11,340},{134,0,1135},{4,0,
+784},{133,0,745},{5,0,84},{134,0,163},{133,0,410},{4,0,976},{5,11,985},{7,11,509
+},{7,11,529},{145,11,96},{132,10,474},{134,0,703},{135,11,1919},{5,0,322},{8,0,
+186},{9,0,262},{10,0,187},{142,0,208},{135,10,1504},{133,0,227},{9,0,560},{13,0,
+208},{133,10,305},{132,11,247},{7,0,1395},{8,0,486},{9,0,236},{9,0,878},{10,0,
+218},{11,0,95},{19,0,17},{147,0,31},{7,0,2043},{8,0,672},{141,0,448},{4,11,184},
+{5,11,390},{6,11,337},{7,11,23},{7,11,494},{7,11,618},{7,11,1456},{8,11,27},{8,
+11,599},{10,11,153},{139,11,710},{135,0,466},{135,10,1236},{6,0,167},{7,0,186},{
+7,0,656},{10,0,643},{4,10,480},{6,10,302},{6,10,1642},{7,10,837},{7,10,1547},{7,
+10,1657},{8,10,429},{9,10,228},{13,10,289},{13,10,343},{147,10,101},{134,0,1428}
+,{134,0,1440},{5,0,412},{7,10,278},{10,10,739},{11,10,708},{141,10,348},{134,0,
+1118},{136,0,562},{148,11,46},{9,0,316},{139,0,256},{134,0,1771},{135,0,1190},{
+137,0,132},{10,11,227},{11,11,497},{11,11,709},{140,11,415},{143,0,66},{6,11,360
+},{7,11,1664},{136,11,478},{144,10,28},{4,0,317},{135,0,1279},{5,0,63},{133,0,
+509},{136,11,699},{145,10,36},{134,0,1475},{11,11,343},{142,11,127},{132,11,739}
+,{132,0,288},{135,11,1757},{8,0,89},{8,0,620},{9,0,608},{11,0,628},{12,0,322},{
+143,0,124},{134,0,1225},{7,0,1189},{4,11,67},{5,11,422},{6,10,363},{7,11,1037},{
+7,11,1289},{7,11,1555},{7,10,1955},{8,10,725},{9,11,741},{145,11,108},{134,0,
+1468},{6,0,689},{134,0,1451},{138,0,120},{151,0,1},{137,10,805},{142,0,329},{5,
+10,813},{135,10,2046},{135,0,226},{138,11,96},{7,0,1855},{5,10,712},{11,10,17},{
+13,10,321},{144,10,67},{9,0,461},{6,10,320},{7,10,781},{7,10,1921},{9,10,55},{10
+,10,186},{10,10,273},{10,10,664},{10,10,801},{11,10,996},{11,10,997},{13,10,157}
+,{142,10,170},{8,11,203},{8,10,271},{11,11,823},{11,11,846},{12,11,482},{13,11,
+133},{13,11,277},{13,11,302},{13,11,464},{14,11,205},{142,11,221},{135,0,1346},{
+4,11,449},{133,11,718},{134,0,85},{14,0,299},{7,10,103},{7,10,863},{11,10,184},{
+145,10,62},{4,11,355},{6,11,311},{9,11,256},{138,11,404},{137,10,659},{138,11,
+758},{133,11,827},{5,11,64},{140,11,581},{134,0,1171},{4,11,442},{7,11,1047},{7,
+11,1352},{135,11,1643},{132,0,980},{5,11,977},{6,11,288},{7,11,528},{135,11,1065
+},{5,0,279},{6,0,235},{7,0,468},{8,0,446},{9,0,637},{10,0,717},{11,0,738},{140,0
+,514},{132,0,293},{11,10,337},{142,10,303},{136,11,285},{5,0,17},{6,0,371},{9,0,
+528},{12,0,364},{132,11,254},{5,10,77},{7,10,1455},{10,10,843},{147,10,73},{150,
+0,5},{132,10,458},{6,11,12},{7,11,1219},{145,11,73},{135,10,1420},{6,10,109},{
+138,10,382},{135,11,125},{6,10,330},{7,10,1084},{139,10,142},{6,11,369},{6,11,
+502},{7,11,1036},{8,11,348},{9,11,452},{10,11,26},{11,11,224},{11,11,387},{11,11
+,772},{12,11,95},{12,11,629},{13,11,195},{13,11,207},{13,11,241},{14,11,260},{14
+,11,270},{143,11,140},{132,11,269},{5,11,480},{7,11,532},{7,11,1197},{7,11,1358}
+,{8,11,291},{11,11,349},{142,11,396},{150,0,48},{10,0,601},{13,0,353},{141,0,376
+},{5,0,779},{5,0,807},{6,0,1655},{134,0,1676},{142,11,223},{4,0,196},{5,0,558},{
+133,0,949},{148,11,15},{135,11,1764},{134,0,1322},{132,0,752},{139,0,737},{135,
+11,657},{136,11,533},{135,0,412},{4,0,227},{5,0,159},{5,0,409},{7,0,80},{8,0,556
+},{10,0,479},{12,0,418},{14,0,50},{14,0,123},{14,0,192},{14,0,249},{14,0,295},{
+143,0,27},{7,0,1470},{8,0,66},{8,0,137},{8,0,761},{9,0,638},{11,0,80},{11,0,212}
+,{11,0,368},{11,0,418},{12,0,8},{13,0,15},{16,0,61},{17,0,59},{19,0,28},{148,0,
+84},{135,10,1985},{4,11,211},{4,11,332},{5,11,335},{6,11,238},{7,11,269},{7,11,
+811},{7,11,1797},{8,10,122},{8,11,836},{9,11,507},{141,11,242},{6,0,683},{134,0,
+1252},{4,0,873},{132,10,234},{134,0,835},{6,0,38},{7,0,1220},{8,0,185},{8,0,256}
+,{9,0,22},{9,0,331},{10,0,738},{11,0,205},{11,0,540},{11,0,746},{13,0,465},{14,0
+,88},{142,0,194},{138,0,986},{5,11,1009},{12,11,582},{146,11,131},{4,0,159},{6,0
+,115},{7,0,252},{7,0,257},{7,0,1928},{8,0,69},{9,0,384},{10,0,91},{10,0,615},{12
+,0,375},{14,0,235},{18,0,117},{147,0,123},{133,0,911},{136,0,278},{5,10,430},{5,
+10,932},{6,10,131},{7,10,417},{9,10,522},{11,10,314},{141,10,390},{14,10,149},{
+14,10,399},{143,10,57},{4,0,151},{7,0,1567},{136,0,749},{5,11,228},{6,11,203},{7
+,11,156},{8,11,347},{137,11,265},{132,10,507},{10,0,989},{140,0,956},{133,0,990}
+,{5,0,194},{6,0,927},{7,0,1662},{9,0,90},{140,0,564},{4,10,343},{133,10,511},{
+133,0,425},{7,10,455},{138,10,591},{4,0,774},{7,11,476},{7,11,1592},{138,11,87},
+{5,0,971},{135,10,1381},{5,11,318},{147,11,121},{5,11,291},{7,11,765},{9,11,389}
+,{140,11,548},{134,10,575},{4,0,827},{12,0,646},{12,0,705},{12,0,712},{140,0,714
+},{139,0,752},{137,0,662},{5,0,72},{6,0,264},{7,0,21},{7,0,46},{7,0,2013},{8,0,
+215},{8,0,513},{10,0,266},{139,0,22},{139,11,522},{6,0,239},{7,0,118},{10,0,95},
+{11,0,603},{13,0,443},{14,0,160},{143,0,4},{6,0,431},{134,0,669},{7,10,1127},{7,
+10,1572},{10,10,297},{10,10,422},{11,10,764},{11,10,810},{12,10,264},{13,10,102}
+,{13,10,300},{13,10,484},{14,10,147},{14,10,229},{17,10,71},{18,10,118},{147,10,
+120},{5,0,874},{6,0,1677},{15,0,0},{10,11,525},{139,11,82},{6,0,65},{7,0,939},{7
+,0,1172},{7,0,1671},{9,0,540},{10,0,696},{11,0,265},{11,0,732},{11,0,928},{11,0,
+937},{141,0,438},{134,0,1350},{136,11,547},{132,11,422},{5,11,355},{145,11,0},{
+137,11,905},{5,0,682},{135,0,1887},{132,0,809},{4,0,696},{133,11,865},{6,0,1074}
+,{6,0,1472},{14,10,35},{142,10,191},{5,11,914},{134,11,1625},{133,11,234},{135,
+11,1383},{137,11,780},{132,10,125},{4,0,726},{133,0,630},{8,0,802},{136,0,838},{
+132,10,721},{6,0,1337},{7,0,776},{19,0,56},{136,10,145},{132,0,970},{7,10,792},{
+8,10,147},{10,10,821},{139,10,1021},{139,10,970},{8,0,940},{137,0,797},{135,11,
+1312},{9,0,248},{10,0,400},{7,11,816},{7,11,1241},{7,10,1999},{9,11,283},{9,11,
+520},{10,11,213},{10,11,307},{10,11,463},{10,11,671},{10,11,746},{11,11,401},{11
+,11,794},{12,11,517},{18,11,107},{147,11,115},{6,0,1951},{134,0,2040},{135,11,
+339},{13,0,41},{15,0,93},{5,10,168},{5,10,930},{8,10,74},{9,10,623},{12,10,500},
+{140,10,579},{6,0,118},{7,0,215},{7,0,1521},{140,0,11},{6,10,220},{7,10,1101},{
+141,10,105},{6,11,421},{7,11,61},{7,11,1540},{10,11,11},{138,11,501},{7,0,615},{
+138,0,251},{140,11,631},{135,0,1044},{6,10,19},{7,10,1413},{139,10,428},{133,0,
+225},{7,10,96},{8,10,401},{8,10,703},{137,10,896},{145,10,116},{6,11,102},{7,11,
+72},{15,11,142},{147,11,67},{7,10,1961},{7,10,1965},{8,10,702},{136,10,750},{7,
+10,2030},{8,10,150},{8,10,737},{12,10,366},{151,11,30},{4,0,370},{5,0,756},{7,0,
+1326},{135,11,823},{8,10,800},{9,10,148},{9,10,872},{9,10,890},{11,10,309},{11,
+10,1001},{13,10,267},{141,10,323},{6,0,1662},{7,0,48},{8,0,771},{10,0,116},{13,0
+,104},{14,0,105},{14,0,184},{15,0,168},{19,0,92},{148,0,68},{10,0,209},{135,11,
+1870},{7,11,68},{8,11,48},{8,11,88},{8,11,582},{8,11,681},{9,11,373},{9,11,864},
+{11,11,157},{11,11,336},{11,11,843},{148,11,27},{134,0,930},{4,11,88},{5,11,137}
+,{5,11,174},{5,11,777},{6,11,1664},{6,11,1725},{7,11,77},{7,11,426},{7,11,1317},
+{7,11,1355},{8,11,126},{8,11,563},{9,11,523},{9,11,750},{10,11,310},{10,11,836},
+{11,11,42},{11,11,318},{11,11,731},{12,11,68},{12,11,92},{12,11,507},{12,11,692}
+,{13,11,81},{13,11,238},{13,11,374},{18,11,138},{19,11,78},{19,11,111},{20,11,55
+},{20,11,77},{148,11,92},{4,11,938},{135,11,1831},{5,10,547},{7,10,424},{8,11,
+617},{138,11,351},{6,0,1286},{6,11,1668},{7,11,1499},{8,11,117},{9,11,314},{138,
+11,174},{6,0,759},{6,0,894},{7,11,707},{139,11,563},{4,0,120},{135,0,1894},{9,0,
+385},{149,0,17},{138,0,429},{133,11,403},{5,0,820},{135,0,931},{10,0,199},{133,
+10,133},{6,0,151},{6,0,1675},{7,0,383},{151,0,10},{6,0,761},{136,10,187},{8,0,
+365},{10,10,0},{10,10,818},{139,10,988},{4,11,44},{5,11,311},{6,11,156},{7,11,
+639},{7,11,762},{7,11,1827},{9,11,8},{9,11,462},{148,11,83},{4,11,346},{7,11,115
+},{9,11,180},{9,11,456},{138,11,363},{136,10,685},{7,0,1086},{145,0,46},{6,0,
+1624},{11,0,11},{12,0,422},{13,0,444},{142,0,360},{6,0,1020},{6,0,1260},{134,0,
+1589},{4,0,43},{5,0,344},{5,0,357},{14,0,472},{150,0,58},{6,0,1864},{6,0,1866},{
+6,0,1868},{6,0,1869},{6,0,1874},{6,0,1877},{6,0,1903},{6,0,1911},{9,0,920},{9,0,
+921},{9,0,924},{9,0,946},{9,0,959},{9,0,963},{9,0,970},{9,0,997},{9,0,1008},{9,0
+,1017},{12,0,795},{12,0,797},{12,0,798},{12,0,800},{12,0,803},{12,0,811},{12,0,
+820},{12,0,821},{12,0,839},{12,0,841},{12,0,848},{12,0,911},{12,0,921},{12,0,922
+},{12,0,925},{12,0,937},{12,0,944},{12,0,945},{12,0,953},{15,0,184},{15,0,191},{
+15,0,199},{15,0,237},{15,0,240},{15,0,243},{15,0,246},{18,0,203},{21,0,40},{21,0
+,52},{21,0,57},{24,0,23},{24,0,28},{152,0,30},{134,0,725},{145,11,58},{133,0,888
+},{137,10,874},{4,0,711},{8,10,774},{10,10,670},{140,10,51},{144,11,40},{6,11,
+185},{7,11,1899},{139,11,673},{137,10,701},{137,0,440},{4,11,327},{5,11,478},{7,
+11,1332},{8,11,753},{140,11,227},{4,10,127},{5,10,350},{6,10,356},{8,10,426},{9,
+10,572},{10,10,247},{139,10,312},{5,11,1020},{133,11,1022},{4,11,103},{133,11,
+401},{6,0,1913},{6,0,1926},{6,0,1959},{9,0,914},{9,0,939},{9,0,952},{9,0,979},{9
+,0,990},{9,0,998},{9,0,1003},{9,0,1023},{12,0,827},{12,0,834},{12,0,845},{12,0,
+912},{12,0,935},{12,0,951},{15,0,172},{15,0,174},{18,0,198},{149,0,63},{5,0,958}
+,{5,0,987},{4,11,499},{135,11,1421},{7,0,885},{6,10,59},{6,10,1762},{9,10,603},{
+141,10,397},{10,11,62},{141,11,164},{4,0,847},{135,0,326},{11,0,276},{142,0,293}
+,{4,0,65},{5,0,479},{5,0,1004},{7,0,1913},{8,0,317},{9,0,302},{10,0,612},{13,0,
+22},{132,11,96},{4,0,261},{135,0,510},{135,0,1514},{6,10,111},{7,10,4},{8,10,163
+},{8,10,776},{138,10,566},{4,0,291},{9,0,515},{12,0,152},{12,0,443},{13,0,392},{
+142,0,357},{7,11,399},{135,11,1492},{4,0,589},{139,0,282},{6,11,563},{135,10,
+1994},{5,10,297},{135,10,1038},{4,0,130},{7,0,843},{135,0,1562},{5,0,42},{5,0,
+879},{7,0,245},{7,0,324},{7,0,1532},{11,0,463},{11,0,472},{13,0,363},{144,0,52},
+{4,0,134},{133,0,372},{133,0,680},{136,10,363},{6,0,1997},{8,0,935},{136,0,977},
+{4,0,810},{135,0,1634},{135,10,1675},{7,0,1390},{4,11,910},{133,11,832},{7,10,
+808},{8,11,266},{139,11,578},{132,0,644},{4,0,982},{138,0,867},{132,10,280},{135
+,0,540},{140,10,54},{135,0,123},{134,0,1978},{4,10,421},{133,10,548},{6,0,623},{
+136,0,789},{4,0,908},{5,0,359},{5,0,508},{6,0,1723},{7,0,343},{7,0,1996},{135,0,
+2026},{134,0,1220},{4,0,341},{135,0,480},{6,10,254},{9,10,109},{138,10,103},{134
+,0,888},{8,11,528},{137,11,348},{7,0,1995},{8,0,299},{11,0,890},{12,0,674},{4,11
+,20},{133,11,616},{135,11,1094},{134,10,1630},{4,0,238},{5,0,503},{6,0,179},{7,0
+,2003},{8,0,381},{8,0,473},{9,0,149},{10,0,788},{15,0,45},{15,0,86},{20,0,110},{
+150,0,57},{133,10,671},{4,11,26},{5,11,429},{6,11,245},{7,11,704},{7,11,1379},{
+135,11,1474},{4,0,121},{5,0,156},{5,0,349},{9,0,431},{10,0,605},{142,0,342},{7,
+11,943},{139,11,614},{132,10,889},{132,11,621},{7,10,1382},{7,11,1382},{135,10,
+1910},{132,10,627},{133,10,775},{133,11,542},{133,11,868},{136,11,433},{6,0,1373
+},{7,0,1011},{11,10,362},{11,10,948},{140,10,388},{6,0,80},{7,0,173},{9,0,547},{
+10,0,730},{14,0,18},{22,0,39},{135,11,1495},{6,0,1694},{135,0,1974},{140,0,196},
+{4,0,923},{6,0,507},{6,0,1711},{7,10,451},{8,10,389},{12,10,490},{13,10,16},{13,
+10,215},{13,10,351},{18,10,132},{147,10,125},{6,0,646},{134,0,1047},{135,10,841}
+,{136,10,566},{6,0,1611},{135,0,1214},{139,0,926},{132,11,525},{132,0,595},{5,0,
+240},{6,0,459},{7,0,12},{7,0,114},{7,0,949},{7,0,1753},{7,0,1805},{8,0,658},{9,0
+,1},{11,0,959},{141,0,446},{5,10,912},{134,10,1695},{132,0,446},{7,11,62},{12,11
+,45},{147,11,112},{5,10,236},{6,10,572},{8,10,492},{11,10,618},{144,10,56},{5,10
+,190},{136,10,318},{135,10,1376},{4,11,223},{6,11,359},{11,11,3},{13,11,108},{14
+,11,89},{144,11,22},{132,11,647},{134,0,490},{134,0,491},{134,0,1584},{135,11,
+685},{138,11,220},{7,0,250},{136,0,507},{132,0,158},{4,0,140},{7,0,362},{8,0,209
+},{9,0,10},{9,0,160},{9,0,503},{9,0,614},{10,0,689},{11,0,327},{11,0,553},{11,0,
+725},{11,0,767},{12,0,252},{12,0,583},{13,0,192},{14,0,269},{14,0,356},{148,0,50
+},{19,0,1},{19,0,26},{150,0,9},{132,11,109},{6,0,228},{7,0,1341},{9,0,408},{138,
+0,343},{4,0,373},{5,0,283},{6,0,480},{7,0,609},{10,0,860},{138,0,878},{6,0,779},
+{134,0,1209},{4,0,557},{7,11,263},{7,11,628},{136,11,349},{132,0,548},{7,0,197},
+{8,0,142},{8,0,325},{9,0,150},{9,0,596},{10,0,350},{10,0,353},{11,0,74},{11,0,
+315},{12,0,662},{12,0,681},{14,0,423},{143,0,141},{4,11,40},{10,11,67},{11,11,
+117},{11,11,768},{139,11,935},{7,11,992},{8,11,301},{9,11,722},{12,11,63},{13,11
+,29},{14,11,161},{143,11,18},{6,0,1490},{138,11,532},{5,0,580},{7,0,378},{7,0,
+674},{7,0,1424},{15,0,83},{16,0,11},{15,11,83},{144,11,11},{6,0,1057},{6,0,1335}
+,{10,0,316},{7,10,85},{7,10,247},{8,10,585},{138,10,163},{4,0,169},{5,0,83},{6,0
+,399},{6,0,579},{6,0,1513},{7,0,692},{7,0,846},{7,0,1015},{7,0,1799},{8,0,403},{
+9,0,394},{10,0,133},{12,0,4},{12,0,297},{12,0,452},{16,0,81},{18,0,25},{21,0,14}
+,{22,0,12},{151,0,18},{134,0,1106},{7,0,1546},{11,0,299},{142,0,407},{134,0,1192
+},{132,0,177},{5,0,411},{135,0,653},{7,0,439},{10,0,727},{11,0,260},{139,0,684},
+{138,10,145},{147,10,83},{5,0,208},{7,0,753},{135,0,1528},{137,11,617},{135,10,
+1922},{135,11,825},{11,0,422},{13,0,389},{4,10,124},{10,10,457},{11,10,121},{11,
+10,169},{11,10,870},{12,10,214},{14,10,187},{143,10,77},{11,0,615},{15,0,58},{11
+,11,615},{143,11,58},{9,0,618},{138,0,482},{6,0,1952},{6,0,1970},{142,0,505},{7,
+10,1193},{135,11,1838},{133,0,242},{135,10,1333},{6,10,107},{7,10,638},{7,10,
+1632},{137,10,396},{133,0,953},{5,10,370},{134,10,1756},{5,11,28},{6,11,204},{10
+,11,320},{10,11,583},{13,11,502},{14,11,72},{14,11,274},{14,11,312},{14,11,344},
+{15,11,159},{16,11,62},{16,11,69},{17,11,30},{18,11,42},{18,11,53},{18,11,84},{
+18,11,140},{19,11,68},{19,11,85},{20,11,5},{20,11,45},{20,11,101},{22,11,7},{150
+,11,20},{4,11,558},{6,11,390},{7,11,162},{7,11,689},{9,11,360},{138,11,653},{11,
+0,802},{141,0,67},{133,10,204},{133,0,290},{5,10,970},{134,10,1706},{132,0,380},
+{5,0,52},{7,0,277},{9,0,368},{139,0,791},{5,11,856},{6,11,1672},{6,11,1757},{6,
+11,1781},{7,11,1150},{7,11,1425},{7,11,1453},{140,11,513},{5,11,92},{7,10,3},{10
+,11,736},{140,11,102},{4,0,112},{5,0,653},{5,10,483},{5,10,685},{6,10,489},{7,10
+,1204},{136,10,394},{132,10,921},{6,0,1028},{133,10,1007},{5,11,590},{9,11,213},
+{145,11,91},{135,10,1696},{10,0,138},{139,0,476},{5,0,725},{5,0,727},{135,0,1811
+},{4,0,979},{6,0,1821},{6,0,1838},{8,0,876},{8,0,883},{8,0,889},{8,0,893},{8,0,
+895},{10,0,934},{12,0,720},{14,0,459},{148,0,123},{135,11,551},{4,0,38},{6,0,435
+},{7,0,307},{7,0,999},{7,0,1481},{7,0,1732},{7,0,1738},{8,0,371},{9,0,414},{11,0
+,316},{12,0,52},{13,0,420},{147,0,100},{135,0,1296},{132,10,712},{134,10,1629},{
+133,0,723},{134,0,651},{136,11,191},{9,11,791},{10,11,93},{11,11,301},{16,11,13}
+,{17,11,23},{18,11,135},{19,11,12},{20,11,1},{20,11,12},{148,11,14},{136,11,503}
+,{6,11,466},{135,11,671},{6,0,1200},{134,0,1330},{135,0,1255},{134,0,986},{5,0,
+109},{6,0,1784},{7,0,1895},{12,0,296},{140,0,302},{135,11,983},{133,10,485},{134
+,0,660},{134,0,800},{5,0,216},{5,0,294},{6,0,591},{7,0,1879},{9,0,141},{9,0,270}
+,{9,0,679},{10,0,159},{11,0,197},{11,0,438},{12,0,538},{12,0,559},{14,0,144},{14
+,0,167},{15,0,67},{4,10,285},{5,10,317},{6,10,301},{7,10,7},{8,10,153},{10,10,
+766},{11,10,468},{12,10,467},{141,10,143},{136,0,945},{134,0,1090},{137,0,81},{
+12,11,468},{19,11,96},{148,11,24},{134,0,391},{138,11,241},{7,0,322},{136,0,249}
+,{134,0,1412},{135,11,795},{5,0,632},{138,0,526},{136,10,819},{6,0,144},{7,0,948
+},{7,0,1042},{8,0,235},{8,0,461},{9,0,453},{9,0,796},{10,0,354},{17,0,77},{135,
+11,954},{139,10,917},{6,0,940},{134,0,1228},{4,0,362},{7,0,52},{135,0,303},{6,11
+,549},{8,11,34},{8,11,283},{9,11,165},{138,11,475},{7,11,370},{7,11,1007},{7,11,
+1177},{135,11,1565},{5,11,652},{5,11,701},{135,11,449},{5,0,196},{6,0,486},{7,0,
+212},{8,0,309},{136,0,346},{6,10,1719},{6,10,1735},{7,10,2016},{7,10,2020},{8,10
+,837},{137,10,852},{6,11,159},{6,11,364},{7,11,516},{7,11,1439},{137,11,518},{
+135,0,1912},{135,0,1290},{132,0,686},{141,11,151},{138,0,625},{136,0,706},{138,
+10,568},{139,0,412},{4,0,30},{133,0,43},{8,10,67},{138,10,419},{7,0,967},{141,0,
+11},{12,0,758},{14,0,441},{142,0,462},{10,10,657},{14,10,297},{142,10,361},{139,
+10,729},{4,0,220},{135,0,1535},{7,11,501},{9,11,111},{10,11,141},{11,11,332},{13
+,11,43},{13,11,429},{14,11,130},{14,11,415},{145,11,102},{4,0,950},{6,0,1859},{7
+,0,11},{8,0,873},{12,0,710},{12,0,718},{12,0,748},{12,0,765},{148,0,124},{5,11,
+149},{5,11,935},{136,11,233},{142,11,291},{134,0,1579},{7,0,890},{8,10,51},{9,10
+,868},{10,10,833},{12,10,481},{12,10,570},{148,10,106},{141,0,2},{132,10,445},{
+136,11,801},{135,0,1774},{7,0,1725},{138,0,393},{5,0,263},{134,0,414},{132,11,
+322},{133,10,239},{7,0,456},{7,10,1990},{8,10,130},{139,10,720},{137,0,818},{5,
+10,123},{6,10,530},{7,10,348},{135,10,1419},{135,10,2024},{6,0,178},{6,0,1750},{
+8,0,251},{9,0,690},{10,0,155},{10,0,196},{10,0,373},{11,0,698},{13,0,155},{148,0
+,93},{5,0,97},{137,0,393},{134,0,674},{11,0,223},{140,0,168},{132,10,210},{139,
+11,464},{6,0,1639},{146,0,159},{139,11,2},{7,0,934},{8,0,647},{17,0,97},{19,0,59
+},{150,0,2},{132,0,191},{5,0,165},{9,0,346},{10,0,655},{11,0,885},{4,10,430},{
+135,11,357},{133,0,877},{5,10,213},{133,11,406},{8,0,128},{139,0,179},{6,11,69},
+{135,11,117},{135,0,1297},{11,11,43},{13,11,72},{141,11,142},{135,11,1830},{142,
+0,164},{5,0,57},{6,0,101},{6,0,586},{6,0,1663},{7,0,132},{7,0,1154},{7,0,1415},{
+7,0,1507},{12,0,493},{15,0,105},{151,0,15},{5,0,459},{7,0,1073},{8,0,241},{136,0
+,334},{133,11,826},{133,10,108},{5,10,219},{10,11,132},{11,11,191},{11,11,358},{
+139,11,460},{6,0,324},{6,0,520},{7,0,338},{7,0,1729},{8,0,228},{139,0,750},{21,0
+,30},{22,0,53},{4,10,193},{5,10,916},{7,10,364},{10,10,398},{10,10,726},{11,10,
+317},{11,10,626},{12,10,142},{12,10,288},{12,10,678},{13,10,313},{15,10,113},{
+146,10,114},{6,11,110},{135,11,1681},{135,0,910},{6,10,241},{7,10,907},{8,10,832
+},{9,10,342},{10,10,729},{11,10,284},{11,10,445},{11,10,651},{11,10,863},{13,10,
+398},{146,10,99},{7,0,705},{9,0,734},{5,11,1000},{7,11,733},{137,11,583},{4,0,73
+},{6,0,612},{7,0,927},{7,0,1822},{8,0,217},{9,0,765},{9,0,766},{10,0,408},{11,0,
+51},{11,0,793},{12,0,266},{15,0,158},{20,0,89},{150,0,32},{7,0,1330},{4,11,297},
+{6,11,529},{7,11,152},{7,11,713},{7,11,1845},{8,11,710},{8,11,717},{140,11,639},
+{5,0,389},{136,0,636},{134,0,1409},{4,10,562},{9,10,254},{139,10,879},{134,0,893
+},{132,10,786},{4,11,520},{135,11,575},{136,0,21},{140,0,721},{136,0,959},{7,11,
+1428},{7,11,1640},{9,11,169},{9,11,182},{9,11,367},{9,11,478},{9,11,506},{9,11,
+551},{9,11,648},{9,11,651},{9,11,697},{9,11,705},{9,11,725},{9,11,787},{9,11,794
+},{10,11,198},{10,11,214},{10,11,267},{10,11,275},{10,11,456},{10,11,551},{10,11
+,561},{10,11,613},{10,11,627},{10,11,668},{10,11,675},{10,11,691},{10,11,695},{
+10,11,707},{10,11,715},{11,11,183},{11,11,201},{11,11,244},{11,11,262},{11,11,
+352},{11,11,439},{11,11,493},{11,11,572},{11,11,591},{11,11,608},{11,11,611},{11
+,11,646},{11,11,674},{11,11,711},{11,11,751},{11,11,761},{11,11,776},{11,11,785}
+,{11,11,850},{11,11,853},{11,11,862},{11,11,865},{11,11,868},{11,11,898},{11,11,
+902},{11,11,903},{11,11,910},{11,11,932},{11,11,942},{11,11,957},{11,11,967},{11
+,11,972},{12,11,148},{12,11,195},{12,11,220},{12,11,237},{12,11,318},{12,11,339}
+,{12,11,393},{12,11,445},{12,11,450},{12,11,474},{12,11,509},{12,11,533},{12,11,
+591},{12,11,594},{12,11,597},{12,11,621},{12,11,633},{12,11,642},{13,11,59},{13,
+11,60},{13,11,145},{13,11,239},{13,11,250},{13,11,273},{13,11,329},{13,11,344},{
+13,11,365},{13,11,372},{13,11,387},{13,11,403},{13,11,414},{13,11,456},{13,11,
+478},{13,11,483},{13,11,489},{14,11,55},{14,11,57},{14,11,81},{14,11,90},{14,11,
+148},{14,11,239},{14,11,266},{14,11,321},{14,11,326},{14,11,327},{14,11,330},{14
+,11,347},{14,11,355},{14,11,401},{14,11,411},{14,11,414},{14,11,416},{14,11,420}
+,{15,11,61},{15,11,74},{15,11,87},{15,11,88},{15,11,94},{15,11,96},{15,11,116},{
+15,11,149},{15,11,154},{16,11,50},{16,11,63},{16,11,73},{17,11,2},{17,11,66},{17
+,11,92},{17,11,103},{17,11,112},{18,11,50},{18,11,54},{18,11,82},{18,11,86},{18,
+11,90},{18,11,111},{18,11,115},{18,11,156},{19,11,40},{19,11,79},{20,11,78},{149
+,11,22},{137,11,170},{134,0,1433},{135,11,1307},{139,11,411},{5,0,189},{7,0,442}
+,{7,0,443},{8,0,281},{12,0,174},{141,0,261},{6,10,216},{7,10,901},{7,10,1343},{
+136,10,493},{5,11,397},{6,11,154},{7,10,341},{7,11,676},{8,11,443},{8,11,609},{9
+,11,24},{9,11,325},{10,11,35},{11,10,219},{11,11,535},{11,11,672},{11,11,1018},{
+12,11,637},{144,11,30},{6,0,2},{7,0,191},{7,0,446},{7,0,1262},{7,0,1737},{8,0,22
+},{8,0,270},{8,0,612},{9,0,4},{9,0,312},{9,0,436},{9,0,626},{10,0,216},{10,0,311
+},{10,0,521},{10,0,623},{11,0,72},{11,0,330},{11,0,455},{12,0,321},{12,0,504},{
+12,0,530},{12,0,543},{13,0,17},{13,0,156},{13,0,334},{14,0,131},{17,0,60},{148,0
+,64},{7,0,354},{10,0,410},{139,0,815},{139,10,130},{7,10,1734},{137,11,631},{12,
+0,425},{15,0,112},{10,10,115},{11,10,420},{13,10,404},{14,10,346},{143,10,54},{6
+,0,60},{6,0,166},{7,0,374},{7,0,670},{7,0,1327},{8,0,411},{8,0,435},{9,0,653},{9
+,0,740},{10,0,385},{11,0,222},{11,0,324},{11,0,829},{140,0,611},{7,0,1611},{13,0
+,14},{15,0,44},{19,0,13},{148,0,76},{133,11,981},{4,11,56},{7,11,1791},{8,11,607
+},{8,11,651},{11,11,465},{11,11,835},{12,11,337},{141,11,480},{6,0,1478},{5,10,
+1011},{136,10,701},{139,0,596},{5,0,206},{134,0,398},{4,10,54},{5,10,666},{7,10,
+1039},{7,10,1130},{9,10,195},{138,10,302},{7,0,50},{9,11,158},{138,11,411},{135,
+11,1120},{6,0,517},{7,0,1159},{10,0,621},{11,0,192},{134,10,1669},{4,0,592},{6,0
+,600},{135,0,1653},{10,0,223},{139,0,645},{136,11,139},{7,0,64},{136,0,245},{142
+,0,278},{6,11,622},{135,11,1030},{136,0,604},{134,0,1502},{138,0,265},{141,11,
+168},{7,0,1763},{140,0,310},{7,10,798},{139,11,719},{7,11,160},{10,11,624},{142,
+11,279},{132,11,363},{7,10,122},{9,10,259},{10,10,84},{11,10,470},{12,10,541},{
+141,10,379},{5,0,129},{6,0,61},{135,0,947},{134,0,1356},{135,11,1191},{13,0,505}
+,{141,0,506},{11,0,1000},{5,10,82},{5,10,131},{7,10,1755},{8,10,31},{9,10,168},{
+9,10,764},{139,10,869},{134,0,966},{134,10,605},{134,11,292},{5,11,177},{6,11,
+616},{7,11,827},{9,11,525},{138,11,656},{135,11,1486},{138,11,31},{5,10,278},{
+137,10,68},{4,10,163},{5,10,201},{5,10,307},{5,10,310},{6,10,335},{7,10,284},{
+136,10,165},{6,0,839},{135,10,1660},{136,10,781},{6,10,33},{135,10,1244},{133,0,
+637},{4,11,161},{133,11,631},{137,0,590},{7,10,1953},{136,10,720},{5,0,280},{7,0
+,1226},{138,10,203},{134,0,1386},{5,0,281},{6,0,1026},{6,10,326},{7,10,677},{137
+,10,425},{7,11,1557},{135,11,1684},{135,0,1064},{9,11,469},{9,11,709},{12,11,512
+},{14,11,65},{145,11,12},{134,0,917},{10,11,229},{11,11,73},{11,11,376},{139,11,
+433},{7,0,555},{9,0,192},{13,0,30},{13,0,49},{15,0,150},{16,0,76},{20,0,52},{7,
+10,1316},{7,10,1412},{7,10,1839},{9,10,589},{11,10,241},{11,10,676},{11,10,811},
+{11,10,891},{12,10,140},{12,10,346},{12,10,479},{13,10,381},{14,10,188},{146,10,
+30},{149,0,15},{6,0,1882},{6,0,1883},{6,0,1897},{9,0,945},{9,0,1014},{9,0,1020},
+{12,0,823},{12,0,842},{12,0,866},{12,0,934},{15,0,242},{146,0,208},{6,0,965},{
+134,0,1499},{7,0,33},{7,0,120},{8,0,489},{9,0,319},{10,0,820},{11,0,1004},{12,0,
+379},{12,0,679},{13,0,117},{13,0,412},{14,0,25},{15,0,52},{15,0,161},{16,0,47},{
+149,0,2},{6,11,558},{7,11,651},{8,11,421},{9,11,0},{138,11,34},{4,0,937},{5,0,
+801},{7,0,473},{5,10,358},{7,10,1184},{10,10,662},{13,10,212},{13,10,304},{13,10
+,333},{145,10,98},{132,0,877},{6,0,693},{134,0,824},{132,0,365},{7,11,1832},{138
+,11,374},{5,0,7},{139,0,774},{4,0,734},{5,0,662},{134,0,430},{4,0,746},{135,0,
+1090},{5,0,360},{8,0,237},{10,0,231},{147,0,124},{138,11,348},{6,11,6},{7,11,81}
+,{7,11,771},{7,11,1731},{9,11,405},{138,11,421},{6,0,740},{137,0,822},{133,10,
+946},{7,0,1485},{136,0,929},{7,10,411},{8,10,631},{9,10,323},{10,10,355},{11,10,
+491},{12,10,143},{12,10,402},{13,10,73},{14,10,408},{15,10,107},{146,10,71},{135
+,10,590},{5,11,881},{133,11,885},{150,11,25},{4,0,852},{5,11,142},{134,11,546},{
+7,10,1467},{8,10,328},{10,10,544},{11,10,955},{13,10,320},{145,10,83},{9,0,17},{
+10,0,291},{11,10,511},{13,10,394},{14,10,298},{14,10,318},{146,10,103},{5,11,466
+},{11,11,571},{12,11,198},{13,11,283},{14,11,186},{15,11,21},{143,11,103},{134,0
+,1001},{4,11,185},{5,11,257},{5,11,839},{5,11,936},{7,11,171},{9,11,399},{10,11,
+258},{10,11,395},{10,11,734},{11,11,1014},{12,11,23},{13,11,350},{14,11,150},{
+147,11,6},{143,0,35},{132,0,831},{5,10,835},{134,10,483},{4,0,277},{5,0,608},{6,
+0,493},{7,0,457},{12,0,384},{7,11,404},{7,11,1377},{7,11,1430},{7,11,2017},{8,11
+,149},{8,11,239},{8,11,512},{8,11,793},{8,11,818},{9,11,474},{9,11,595},{10,11,
+122},{10,11,565},{10,11,649},{10,11,783},{11,11,239},{11,11,295},{11,11,447},{11
+,11,528},{11,11,639},{11,11,800},{11,11,936},{12,11,25},{12,11,73},{12,11,77},{
+12,11,157},{12,11,316},{12,11,390},{12,11,391},{12,11,394},{12,11,395},{12,11,
+478},{12,11,503},{12,11,592},{12,11,680},{13,11,50},{13,11,53},{13,11,132},{13,
+11,198},{13,11,275},{13,11,322},{13,11,415},{14,11,71},{14,11,257},{14,11,395},{
+15,11,71},{15,11,136},{17,11,123},{18,11,93},{147,11,58},{134,0,1351},{7,0,27},{
+135,0,316},{136,11,712},{136,0,984},{133,0,552},{137,0,264},{132,0,401},{6,0,710
+},{6,0,1111},{134,0,1343},{134,0,1211},{9,0,543},{10,0,524},{11,0,108},{11,0,653
+},{12,0,524},{13,0,123},{14,0,252},{16,0,18},{19,0,38},{20,0,26},{20,0,65},{21,0
+,3},{151,0,11},{4,0,205},{5,0,623},{7,0,104},{8,0,519},{137,0,716},{132,10,677},
+{4,11,377},{152,11,13},{135,11,1673},{7,0,579},{9,0,41},{9,0,244},{9,0,669},{10,
+0,5},{11,0,861},{11,0,951},{139,0,980},{132,0,717},{136,0,1011},{132,0,805},{4,
+11,180},{135,11,1906},{132,10,777},{132,10,331},{132,0,489},{6,0,1024},{4,11,491
+},{133,10,747},{135,11,1182},{4,11,171},{138,11,234},{4,11,586},{7,11,1186},{138
+,11,631},{135,0,892},{135,11,336},{9,11,931},{10,11,334},{148,11,71},{137,0,473}
+,{6,0,864},{12,0,659},{139,11,926},{7,0,819},{9,0,26},{9,0,392},{10,0,152},{10,0
+,226},{11,0,19},{12,0,276},{12,0,426},{12,0,589},{13,0,460},{15,0,97},{19,0,48},
+{148,0,104},{135,0,51},{133,10,326},{4,10,691},{146,10,16},{9,0,130},{11,0,765},
+{10,10,680},{10,10,793},{141,10,357},{133,11,765},{8,0,229},{6,10,32},{7,10,385}
+,{7,10,757},{7,10,1916},{8,10,94},{8,10,711},{9,10,541},{10,10,162},{10,10,795},
+{11,10,989},{11,10,1010},{12,10,14},{142,10,308},{7,11,474},{137,11,578},{132,0,
+674},{132,0,770},{5,0,79},{7,0,1027},{7,0,1477},{139,0,52},{133,11,424},{134,0,
+1666},{6,0,409},{6,10,349},{6,10,1682},{7,10,1252},{8,10,112},{8,11,714},{9,10,
+435},{9,10,668},{10,10,290},{10,10,319},{10,10,815},{11,10,180},{11,10,837},{12,
+10,240},{13,10,152},{13,10,219},{142,10,158},{5,0,789},{134,0,195},{4,0,251},{4,
+0,688},{7,0,513},{135,0,1284},{132,10,581},{9,11,420},{10,11,269},{10,11,285},{
+10,11,576},{11,11,397},{13,11,175},{145,11,90},{6,10,126},{7,10,573},{8,10,397},
+{142,10,44},{132,11,429},{133,0,889},{4,0,160},{5,0,330},{7,0,1434},{136,0,174},
+{7,11,18},{7,11,699},{7,11,1966},{8,11,752},{9,11,273},{9,11,412},{9,11,703},{10
+,11,71},{10,11,427},{10,11,508},{146,11,97},{6,0,872},{134,0,899},{133,10,926},{
+134,0,1126},{134,0,918},{4,11,53},{5,11,186},{135,11,752},{7,0,268},{136,0,569},
+{134,0,1224},{6,0,1361},{7,10,1232},{137,10,531},{8,11,575},{10,11,289},{139,11,
+319},{133,10,670},{132,11,675},{133,0,374},{135,10,1957},{133,0,731},{11,0,190},
+{15,0,49},{11,11,190},{143,11,49},{4,0,626},{5,0,506},{5,0,642},{6,0,425},{10,0,
+202},{139,0,141},{137,0,444},{7,10,242},{135,10,1942},{6,11,209},{8,11,468},{9,
+11,210},{11,11,36},{12,11,28},{12,11,630},{13,11,21},{13,11,349},{14,11,7},{145,
+11,13},{4,11,342},{135,11,1179},{5,10,834},{7,10,1202},{8,10,14},{9,10,481},{137
+,10,880},{4,11,928},{133,11,910},{4,11,318},{4,11,496},{7,11,856},{139,11,654},{
+136,0,835},{7,0,1526},{138,10,465},{151,0,17},{135,0,477},{4,10,357},{6,10,172},
+{7,10,143},{137,10,413},{6,0,1374},{138,0,994},{18,0,76},{132,10,590},{7,0,287},
+{8,0,355},{9,0,293},{137,0,743},{134,0,1389},{7,11,915},{8,11,247},{147,11,0},{4
+,11,202},{5,11,382},{6,11,454},{7,11,936},{7,11,1803},{8,11,758},{9,11,375},{9,
+11,895},{10,11,743},{10,11,792},{11,11,978},{11,11,1012},{142,11,109},{5,0,384},
+{8,0,455},{140,0,48},{132,11,390},{5,10,169},{7,10,333},{136,10,45},{5,0,264},{
+134,0,184},{138,11,791},{133,11,717},{132,10,198},{6,11,445},{7,11,332},{137,11,
+909},{136,0,1001},{4,10,24},{5,10,140},{5,10,185},{7,10,1500},{11,10,565},{139,
+10,838},{134,11,578},{5,0,633},{6,0,28},{135,0,1323},{132,0,851},{136,11,267},{7
+,0,359},{8,0,243},{140,0,175},{4,10,334},{133,10,593},{141,11,87},{136,11,766},{
+10,0,287},{12,0,138},{10,11,287},{140,11,138},{4,0,105},{132,0,740},{140,10,116}
+,{134,0,857},{135,11,1841},{6,0,1402},{137,0,819},{132,11,584},{132,10,709},{133
+,10,897},{5,0,224},{13,0,174},{146,0,52},{135,10,1840},{4,10,608},{133,10,497},{
+139,11,60},{4,0,758},{135,0,1649},{4,11,226},{4,11,326},{135,11,1770},{5,11,426}
+,{8,11,30},{9,11,2},{11,11,549},{147,11,122},{135,10,2039},{6,10,540},{136,10,
+136},{4,0,573},{8,0,655},{4,10,897},{133,10,786},{7,0,351},{139,0,128},{133,10,
+999},{4,10,299},{135,10,1004},{133,0,918},{132,11,345},{4,11,385},{7,11,265},{
+135,11,587},{133,10,456},{136,10,180},{6,0,687},{134,0,1537},{4,11,347},{5,11,
+423},{5,11,996},{135,11,1329},{132,10,755},{7,11,1259},{9,11,125},{11,11,65},{
+140,11,285},{5,11,136},{6,11,136},{136,11,644},{134,0,1525},{4,0,1009},{135,0,
+1139},{139,10,338},{132,0,340},{135,10,1464},{8,0,847},{10,0,861},{10,0,876},{10
+,0,889},{10,0,922},{10,0,929},{10,0,933},{12,0,784},{140,0,791},{139,0,176},{9,
+11,134},{10,11,2},{10,11,27},{10,11,333},{11,11,722},{143,11,1},{4,11,433},{133,
+11,719},{5,0,985},{7,0,509},{7,0,529},{145,0,96},{132,0,615},{4,10,890},{5,10,
+805},{5,10,819},{5,10,961},{6,10,396},{6,10,1631},{6,10,1678},{7,10,1967},{7,10,
+2041},{9,10,630},{11,10,8},{11,10,1019},{12,10,176},{13,10,225},{14,10,292},{149
+,10,24},{135,0,1919},{134,0,1131},{144,11,21},{144,11,51},{135,10,1815},{4,0,247
+},{7,10,1505},{10,10,190},{10,10,634},{11,10,792},{12,10,358},{140,10,447},{5,10
+,0},{6,10,536},{7,10,604},{13,10,445},{145,10,126},{4,0,184},{5,0,390},{6,0,337}
+,{7,0,23},{7,0,494},{7,0,618},{7,0,1456},{8,0,27},{8,0,599},{10,0,153},{139,0,
+710},{6,10,232},{6,10,412},{7,10,1074},{8,10,9},{8,10,157},{8,10,786},{9,10,196}
+,{9,10,352},{9,10,457},{10,10,337},{11,10,232},{11,10,877},{12,10,480},{140,10,
+546},{13,0,38},{135,10,958},{4,10,382},{136,10,579},{4,10,212},{135,10,1206},{4,
+11,555},{8,11,536},{138,11,288},{11,11,139},{139,11,171},{9,11,370},{138,11,90},
+{132,0,1015},{134,0,1088},{5,10,655},{135,11,977},{134,0,1585},{17,10,67},{147,
+10,74},{10,0,227},{11,0,497},{11,0,709},{140,0,415},{6,0,360},{7,0,1664},{136,0,
+478},{7,0,95},{6,10,231},{136,10,423},{140,11,65},{4,11,257},{135,11,2031},{135,
+11,1768},{133,10,300},{139,11,211},{136,0,699},{6,10,237},{7,10,611},{8,10,100},
+{9,10,416},{11,10,335},{12,10,173},{146,10,101},{14,0,26},{146,0,150},{6,0,581},
+{135,0,1119},{135,10,1208},{132,0,739},{6,11,83},{6,11,1733},{135,11,1389},{137,
+0,869},{4,0,67},{5,0,422},{7,0,1037},{7,0,1289},{7,0,1555},{9,0,741},{145,0,108}
+,{133,10,199},{12,10,427},{146,10,38},{136,0,464},{142,0,42},{10,0,96},{8,11,501
+},{137,11,696},{134,11,592},{4,0,512},{4,0,966},{5,0,342},{6,0,1855},{8,0,869},{
+8,0,875},{8,0,901},{144,0,26},{8,0,203},{11,0,823},{11,0,846},{12,0,482},{13,0,
+277},{13,0,302},{13,0,464},{14,0,205},{142,0,221},{4,0,449},{133,0,718},{7,11,
+1718},{9,11,95},{9,11,274},{10,11,279},{10,11,317},{10,11,420},{11,11,303},{11,
+11,808},{12,11,134},{12,11,367},{13,11,149},{13,11,347},{14,11,349},{14,11,406},
+{18,11,22},{18,11,89},{18,11,122},{147,11,47},{133,11,26},{4,0,355},{6,0,311},{9
+,0,256},{138,0,404},{132,11,550},{10,0,758},{6,10,312},{6,10,1715},{10,10,584},{
+11,10,546},{11,10,692},{12,10,259},{12,10,295},{13,10,46},{141,10,154},{136,11,
+822},{5,0,827},{4,11,902},{5,11,809},{6,11,122},{135,11,896},{5,0,64},{140,0,581
+},{4,0,442},{6,0,739},{7,0,1047},{7,0,1352},{7,0,1643},{7,11,1911},{9,11,449},{
+10,11,192},{138,11,740},{135,11,262},{132,10,588},{133,11,620},{5,0,977},{6,0,
+288},{7,0,528},{4,11,34},{5,11,574},{7,11,279},{7,11,1624},{136,11,601},{6,0,
+1375},{4,10,231},{5,10,61},{6,10,104},{7,10,729},{7,10,964},{7,10,1658},{140,10,
+414},{6,10,263},{138,10,757},{132,10,320},{4,0,254},{7,0,1309},{5,11,332},{135,
+11,1309},{6,11,261},{8,11,182},{139,11,943},{132,10,225},{6,0,12},{135,0,1219},{
+4,0,275},{12,0,376},{6,11,1721},{141,11,490},{4,11,933},{133,11,880},{6,0,951},{
+6,0,1109},{6,0,1181},{7,0,154},{4,10,405},{7,10,817},{14,10,58},{17,10,37},{146,
+10,124},{6,0,1520},{133,10,974},{134,0,1753},{6,0,369},{6,0,502},{7,0,1036},{8,0
+,348},{9,0,452},{10,0,26},{11,0,224},{11,0,387},{11,0,772},{12,0,95},{12,0,629},
+{13,0,195},{13,0,207},{13,0,241},{14,0,260},{14,0,270},{143,0,140},{132,0,269},{
+5,0,480},{7,0,532},{7,0,1197},{7,0,1358},{8,0,291},{11,0,349},{142,0,396},{5,10,
+235},{7,10,1239},{11,10,131},{140,10,370},{7,10,956},{7,10,1157},{7,10,1506},{7,
+10,1606},{7,10,1615},{7,10,1619},{7,10,1736},{7,10,1775},{8,10,590},{9,10,324},{
+9,10,736},{9,10,774},{9,10,776},{9,10,784},{10,10,567},{10,10,708},{11,10,518},{
+11,10,613},{11,10,695},{11,10,716},{11,10,739},{11,10,770},{11,10,771},{11,10,
+848},{11,10,857},{11,10,931},{11,10,947},{12,10,326},{12,10,387},{12,10,484},{12
+,10,528},{12,10,552},{12,10,613},{13,10,189},{13,10,256},{13,10,340},{13,10,432}
+,{13,10,436},{13,10,440},{13,10,454},{14,10,174},{14,10,220},{14,10,284},{14,10,
+390},{145,10,121},{8,11,598},{9,11,664},{138,11,441},{9,10,137},{138,10,221},{
+133,11,812},{148,0,15},{134,0,1341},{6,0,1017},{4,11,137},{7,11,1178},{135,11,
+1520},{7,10,390},{138,10,140},{7,11,1260},{135,11,1790},{137,11,191},{135,10,
+1144},{6,0,1810},{7,0,657},{8,0,886},{10,0,857},{14,0,440},{144,0,96},{8,0,533},
+{6,11,1661},{7,11,1975},{7,11,2009},{135,11,2011},{6,0,1453},{134,10,464},{132,
+11,715},{5,10,407},{11,10,204},{11,10,243},{11,10,489},{12,10,293},{19,10,37},{
+20,10,73},{150,10,38},{133,11,703},{4,0,211},{7,0,1483},{5,10,325},{8,10,5},{8,
+10,227},{9,10,105},{10,10,585},{140,10,614},{4,0,332},{5,0,335},{6,0,238},{7,0,
+269},{7,0,811},{7,0,1797},{8,0,836},{9,0,507},{141,0,242},{5,11,89},{7,11,1915},
+{9,11,185},{9,11,235},{9,11,496},{10,11,64},{10,11,270},{10,11,403},{10,11,469},
+{10,11,529},{10,11,590},{11,11,140},{11,11,860},{13,11,1},{13,11,422},{14,11,341
+},{14,11,364},{17,11,93},{18,11,113},{19,11,97},{147,11,113},{133,11,695},{16,0,
+19},{5,11,6},{6,11,183},{6,10,621},{7,11,680},{7,11,978},{7,11,1013},{7,11,1055}
+,{12,11,230},{13,11,172},{13,10,504},{146,11,29},{136,0,156},{133,0,1009},{6,11,
+29},{139,11,63},{134,0,820},{134,10,218},{7,10,454},{7,10,782},{8,10,768},{140,
+10,686},{5,0,228},{6,0,203},{7,0,156},{8,0,347},{9,0,265},{18,0,39},{20,0,54},{
+21,0,31},{22,0,3},{23,0,0},{15,11,8},{18,11,39},{20,11,54},{21,11,31},{22,11,3},
+{151,11,0},{7,0,1131},{135,0,1468},{144,10,0},{134,0,1276},{10,10,676},{140,10,
+462},{132,11,311},{134,11,1740},{7,11,170},{8,11,90},{8,11,177},{8,11,415},{11,
+11,714},{142,11,281},{134,10,164},{6,0,1792},{138,0,849},{150,10,50},{5,0,291},{
+5,0,318},{7,0,765},{9,0,389},{12,0,548},{8,11,522},{142,11,328},{11,11,91},{13,
+11,129},{15,11,101},{145,11,125},{4,11,494},{6,11,74},{7,11,44},{7,11,407},{8,11
+,551},{12,11,17},{15,11,5},{148,11,11},{4,11,276},{133,11,296},{6,10,343},{7,10,
+195},{7,11,1777},{9,10,226},{10,10,197},{10,10,575},{11,10,502},{139,10,899},{10
+,0,525},{139,0,82},{14,0,453},{4,11,7},{5,11,90},{5,11,158},{6,11,542},{7,11,221
+},{7,11,1574},{9,11,490},{10,11,540},{11,11,443},{139,11,757},{135,0,666},{22,10
+,29},{150,11,29},{4,0,422},{147,10,8},{5,0,355},{145,0,0},{6,0,1873},{9,0,918},{
+7,11,588},{9,11,175},{138,11,530},{143,11,31},{11,0,165},{7,10,1125},{9,10,143},
+{14,10,405},{150,10,21},{9,0,260},{137,0,905},{5,11,872},{6,11,57},{6,11,479},{6
+,11,562},{7,11,471},{7,11,1060},{9,11,447},{9,11,454},{141,11,6},{138,11,704},{
+133,0,865},{5,0,914},{134,0,1625},{133,0,234},{7,0,1383},{5,11,31},{6,11,614},{
+145,11,61},{7,11,1200},{138,11,460},{6,11,424},{135,11,1866},{136,0,306},{5,10,
+959},{12,11,30},{13,11,148},{14,11,87},{14,11,182},{16,11,42},{18,11,92},{148,11
+,70},{6,0,1919},{6,0,1921},{9,0,923},{9,0,930},{9,0,941},{9,0,949},{9,0,987},{9,
+0,988},{9,0,992},{12,0,802},{12,0,815},{12,0,856},{12,0,885},{12,0,893},{12,0,
+898},{12,0,919},{12,0,920},{12,0,941},{12,0,947},{15,0,183},{15,0,185},{15,0,189
+},{15,0,197},{15,0,202},{15,0,233},{18,0,218},{18,0,219},{18,0,233},{143,11,156}
+,{135,10,1759},{136,10,173},{13,0,163},{13,0,180},{18,0,78},{20,0,35},{5,11,13},
+{134,11,142},{134,10,266},{6,11,97},{7,11,116},{8,11,322},{8,11,755},{9,11,548},
+{10,11,714},{11,11,884},{141,11,324},{135,0,1312},{9,0,814},{137,11,676},{133,0,
+707},{135,0,1493},{6,0,421},{7,0,61},{7,0,1540},{10,0,11},{138,0,501},{12,0,733}
+,{12,0,766},{7,11,866},{135,11,1163},{137,0,341},{142,0,98},{145,11,115},{135,11
+,1111},{136,10,300},{136,0,1014},{8,11,1},{9,11,112},{138,11,326},{132,11,730},{
+5,11,488},{6,11,527},{7,11,489},{7,11,1636},{8,11,121},{8,11,144},{8,11,359},{9,
+11,193},{9,11,241},{9,11,336},{9,11,882},{11,11,266},{11,11,372},{11,11,944},{12
+,11,401},{140,11,641},{6,0,971},{134,0,1121},{6,0,102},{7,0,72},{15,0,142},{147,
+0,67},{151,0,30},{135,0,823},{134,0,1045},{5,10,427},{5,10,734},{7,10,478},{136,
+10,52},{7,0,1930},{11,10,217},{142,10,165},{6,0,1512},{135,0,1870},{9,11,31},{10
+,11,244},{10,11,699},{12,11,149},{141,11,497},{133,11,377},{145,11,101},{10,11,
+158},{13,11,13},{13,11,137},{13,11,258},{14,11,111},{14,11,225},{14,11,253},{14,
+11,304},{14,11,339},{14,11,417},{146,11,33},{6,0,87},{6,10,1734},{7,10,20},{7,10
+,1056},{8,10,732},{9,10,406},{9,10,911},{138,10,694},{134,0,1243},{137,0,245},{7
+,0,68},{8,0,48},{8,0,88},{8,0,582},{8,0,681},{9,0,373},{9,0,864},{11,0,157},{11,
+0,336},{11,0,843},{148,0,27},{8,11,663},{144,11,8},{133,10,613},{4,0,88},{5,0,
+137},{5,0,174},{5,0,777},{6,0,1664},{6,0,1725},{7,0,77},{7,0,426},{7,0,1317},{7,
+0,1355},{8,0,126},{8,0,563},{9,0,523},{9,0,750},{10,0,310},{10,0,836},{11,0,42},
+{11,0,318},{11,0,731},{12,0,68},{12,0,92},{12,0,507},{12,0,692},{13,0,81},{13,0,
+238},{13,0,374},{14,0,436},{18,0,138},{19,0,78},{19,0,111},{20,0,55},{20,0,77},{
+148,0,92},{141,0,418},{4,0,938},{137,0,625},{138,0,351},{5,11,843},{7,10,32},{7,
+10,984},{8,10,85},{8,10,709},{9,10,579},{9,10,847},{9,10,856},{10,10,799},{11,10
+,258},{11,10,1007},{12,10,331},{12,10,615},{13,10,188},{13,10,435},{14,10,8},{15
+,10,165},{16,10,27},{148,10,40},{6,0,1668},{7,0,1499},{8,0,117},{9,0,314},{138,0
+,174},{135,0,707},{132,11,554},{133,11,536},{5,0,403},{5,11,207},{9,11,79},{11,
+11,625},{145,11,7},{132,11,424},{136,11,785},{4,10,167},{135,10,82},{9,0,7},{23,
+0,6},{9,11,7},{151,11,6},{6,0,282},{5,10,62},{6,10,534},{7,10,74},{7,10,678},{7,
+10,684},{7,10,1043},{7,10,1072},{8,10,280},{8,10,541},{8,10,686},{9,10,258},{10,
+10,519},{11,10,252},{140,10,282},{138,10,33},{132,10,359},{4,0,44},{5,0,311},{6,
+0,156},{7,0,639},{7,0,762},{7,0,1827},{9,0,8},{9,0,462},{148,0,83},{7,11,769},{9
+,11,18},{138,11,358},{4,0,346},{7,0,115},{9,0,180},{9,0,456},{10,0,363},{4,11,
+896},{134,11,1777},{133,10,211},{7,0,761},{7,0,1051},{137,0,545},{6,10,145},{141
+,10,336},{7,11,750},{9,11,223},{11,11,27},{11,11,466},{12,11,624},{14,11,265},{
+146,11,61},{6,0,752},{6,0,768},{6,0,1195},{6,0,1254},{6,0,1619},{137,0,835},{6,0
+,1936},{8,0,930},{136,0,960},{132,10,263},{132,11,249},{12,0,653},{132,10,916},{
+4,11,603},{133,11,661},{8,0,344},{4,11,11},{6,11,128},{7,11,231},{7,11,1533},{
+138,11,725},{134,0,1483},{134,0,875},{6,0,185},{7,0,1899},{9,0,875},{139,0,673},
+{15,10,155},{144,10,79},{7,0,93},{7,0,210},{7,0,1223},{8,0,451},{8,0,460},{11,0,
+353},{11,0,475},{4,10,599},{6,10,1634},{7,10,67},{7,10,691},{7,10,979},{7,10,
+1697},{8,10,207},{8,10,214},{8,10,231},{8,10,294},{8,10,336},{8,10,428},{8,10,
+471},{8,10,622},{8,10,626},{8,10,679},{8,10,759},{8,10,829},{9,10,11},{9,10,246}
+,{9,10,484},{9,10,573},{9,10,706},{9,10,762},{9,10,798},{9,10,855},{9,10,870},{9
+,10,912},{10,10,303},{10,10,335},{10,10,424},{10,10,461},{10,10,543},{10,10,759}
+,{10,10,814},{11,10,59},{11,10,235},{11,10,590},{11,10,929},{11,10,963},{11,10,
+987},{12,10,114},{12,10,182},{12,10,226},{12,10,332},{12,10,439},{12,10,575},{12
+,10,598},{12,10,675},{13,10,8},{13,10,125},{13,10,194},{13,10,287},{14,10,197},{
+14,10,383},{15,10,53},{17,10,63},{19,10,46},{19,10,98},{19,10,106},{148,10,85},{
+132,11,476},{4,0,327},{5,0,478},{7,0,1332},{136,0,753},{5,0,1020},{133,0,1022},{
+135,11,1807},{4,0,103},{133,0,401},{4,0,499},{135,0,1421},{10,0,207},{13,0,164},
+{147,10,126},{9,11,20},{10,11,324},{139,11,488},{132,0,96},{9,11,280},{138,11,
+134},{135,0,968},{133,10,187},{135,10,1286},{5,11,112},{6,11,103},{134,11,150},{
+8,0,914},{10,0,3},{4,10,215},{9,10,38},{11,10,23},{11,10,127},{139,10,796},{135,
+0,399},{6,0,563},{137,0,224},{6,0,704},{134,0,1214},{4,11,708},{8,11,15},{9,11,
+50},{9,11,386},{11,11,18},{11,11,529},{140,11,228},{4,11,563},{7,11,109},{7,11,
+592},{7,11,637},{7,11,770},{7,11,1701},{8,11,436},{8,11,463},{9,11,60},{9,11,335
+},{9,11,904},{10,11,73},{11,11,434},{12,11,585},{13,11,331},{18,11,110},{148,11,
+60},{134,0,1559},{132,11,502},{6,11,347},{138,11,161},{4,11,33},{5,11,102},{5,11
+,500},{6,11,284},{7,11,1079},{7,11,1423},{7,11,1702},{8,11,470},{9,11,554},{9,11
+,723},{139,11,333},{7,11,246},{135,11,840},{6,11,10},{8,11,571},{9,11,739},{143,
+11,91},{8,0,861},{10,0,905},{12,0,730},{12,0,789},{133,11,626},{134,0,946},{5,0,
+746},{12,0,333},{14,0,332},{12,11,333},{142,11,332},{5,11,18},{6,11,526},{13,11,
+24},{13,11,110},{19,11,5},{147,11,44},{4,0,910},{5,0,832},{135,10,2002},{10,11,
+768},{139,11,787},{4,11,309},{5,11,462},{7,11,970},{135,11,1097},{4,10,28},{5,10
+,440},{7,10,248},{11,10,833},{140,10,344},{134,10,1654},{6,0,632},{6,0,652},{6,0
+,1272},{6,0,1384},{134,0,1560},{134,11,1704},{6,0,1393},{133,10,853},{6,10,249},
+{7,10,1234},{139,10,573},{5,11,86},{7,11,743},{9,11,85},{10,11,281},{10,11,432},
+{11,11,490},{12,11,251},{13,11,118},{14,11,378},{146,11,143},{5,11,524},{133,11,
+744},{134,0,1514},{10,0,201},{142,0,319},{7,0,717},{10,0,510},{7,10,392},{8,10,
+20},{8,10,172},{8,10,690},{9,10,383},{9,10,845},{11,10,293},{11,10,832},{11,10,
+920},{11,10,984},{141,10,221},{134,0,1381},{5,10,858},{133,10,992},{8,0,528},{
+137,0,348},{10,11,107},{140,11,436},{4,0,20},{133,0,616},{134,0,1251},{132,11,
+927},{10,11,123},{12,11,670},{13,11,371},{14,11,142},{146,11,94},{134,0,1163},{7
+,11,1149},{137,11,156},{134,0,307},{133,11,778},{7,0,1091},{135,0,1765},{5,11,
+502},{6,10,268},{137,10,62},{8,11,196},{10,11,283},{139,11,406},{4,0,26},{5,0,
+429},{6,0,245},{7,0,704},{7,0,1379},{135,0,1474},{133,11,855},{132,0,881},{4,0,
+621},{135,11,1596},{7,11,1400},{9,11,446},{138,11,45},{6,0,736},{138,10,106},{
+133,0,542},{134,0,348},{133,0,868},{136,0,433},{135,0,1495},{138,0,771},{6,10,
+613},{136,10,223},{138,0,215},{141,0,124},{136,11,391},{135,11,172},{132,10,670}
+,{140,0,55},{9,10,40},{139,10,136},{7,0,62},{147,0,112},{132,0,856},{132,11,568}
+,{12,0,270},{139,10,259},{8,0,572},{137,0,698},{4,11,732},{9,10,310},{137,10,682
+},{142,10,296},{134,0,939},{136,11,733},{135,11,1435},{7,10,1401},{135,10,1476},
+{6,0,352},{4,10,296},{7,10,401},{7,10,1410},{7,10,1594},{7,10,1674},{8,10,63},{8
+,10,660},{137,10,74},{4,11,428},{133,11,668},{4,10,139},{4,10,388},{140,10,188},
+{7,11,2015},{140,11,665},{132,0,647},{146,0,10},{138,0,220},{142,0,464},{132,0,
+109},{134,0,1746},{6,0,515},{4,10,747},{6,11,1623},{6,11,1681},{7,10,649},{7,10,
+1479},{135,10,1583},{133,10,232},{135,0,566},{137,10,887},{4,0,40},{10,0,67},{11
+,0,117},{11,0,768},{139,0,935},{132,0,801},{7,0,992},{8,0,301},{9,0,722},{12,0,
+63},{13,0,29},{14,0,161},{143,0,18},{139,0,923},{6,11,1748},{8,11,715},{9,11,802
+},{10,11,46},{10,11,819},{13,11,308},{14,11,351},{14,11,363},{146,11,67},{137,11
+,745},{7,0,1145},{4,10,14},{7,10,1801},{10,10,748},{141,10,458},{4,11,63},{5,11,
+347},{134,11,474},{135,0,568},{4,10,425},{7,11,577},{7,11,1432},{9,11,475},{9,11
+,505},{9,11,526},{9,11,609},{9,11,689},{9,11,726},{9,11,735},{9,11,738},{10,11,
+556},{10,11,674},{10,11,684},{11,11,89},{11,11,202},{11,11,272},{11,11,380},{11,
+11,415},{11,11,505},{11,11,537},{11,11,550},{11,11,562},{11,11,640},{11,11,667},
+{11,11,688},{11,11,847},{11,11,927},{11,11,930},{11,11,940},{12,11,144},{12,11,
+325},{12,11,329},{12,11,389},{12,11,403},{12,11,451},{12,11,515},{12,11,604},{12
+,11,616},{12,11,626},{13,11,66},{13,11,131},{13,11,167},{13,11,236},{13,11,368},
+{13,11,411},{13,11,434},{13,11,453},{13,11,461},{13,11,474},{14,11,59},{14,11,60
+},{14,11,139},{14,11,152},{14,11,276},{14,11,353},{14,11,402},{15,11,28},{15,11,
+81},{15,11,123},{15,11,152},{18,11,136},{148,11,88},{137,0,247},{135,11,1622},{9
+,11,544},{11,11,413},{144,11,25},{4,0,645},{7,0,825},{6,10,1768},{135,11,89},{
+140,0,328},{5,10,943},{134,10,1779},{134,0,1363},{5,10,245},{6,10,576},{7,10,582
+},{136,10,225},{134,0,1280},{5,11,824},{133,11,941},{7,11,440},{8,11,230},{139,
+11,106},{5,0,28},{6,0,204},{10,0,320},{10,0,583},{13,0,502},{14,0,72},{14,0,274}
+,{14,0,312},{14,0,344},{15,0,159},{16,0,62},{16,0,69},{17,0,30},{18,0,42},{18,0,
+53},{18,0,84},{18,0,140},{19,0,68},{19,0,85},{20,0,5},{20,0,45},{20,0,101},{22,0
+,7},{150,0,20},{4,0,558},{6,0,390},{7,0,162},{7,0,689},{9,0,360},{138,0,653},{
+134,0,764},{6,0,862},{137,0,833},{5,0,856},{6,0,1672},{6,0,1757},{134,0,1781},{5
+,0,92},{10,0,736},{140,0,102},{6,0,1927},{6,0,1944},{8,0,924},{8,0,948},{10,0,
+967},{138,0,978},{134,0,1479},{5,0,590},{8,0,360},{9,0,213},{138,0,63},{134,0,
+1521},{6,0,709},{134,0,891},{132,10,443},{13,0,477},{14,0,120},{148,0,61},{4,11,
+914},{5,11,800},{133,11,852},{10,11,54},{141,11,115},{4,11,918},{133,11,876},{
+139,11,152},{4,11,92},{133,11,274},{135,11,1901},{9,11,800},{10,11,693},{11,11,
+482},{11,11,734},{139,11,789},{9,0,483},{132,10,298},{6,0,1213},{141,11,498},{
+135,11,1451},{133,11,743},{4,0,1022},{10,0,1000},{12,0,957},{12,0,980},{12,0,
+1013},{14,0,481},{144,0,116},{8,0,503},{17,0,29},{4,11,49},{7,11,280},{135,11,
+1633},{135,0,1712},{134,0,466},{136,11,47},{5,10,164},{7,10,121},{142,10,189},{7
+,10,812},{7,10,1261},{7,10,1360},{9,10,632},{140,10,352},{139,10,556},{132,0,731
+},{5,11,272},{5,11,908},{5,11,942},{7,11,1008},{7,11,1560},{8,11,197},{9,11,47},
+{11,11,538},{139,11,742},{4,10,172},{9,10,611},{10,10,436},{12,10,673},{141,10,
+255},{133,10,844},{10,0,484},{11,0,754},{12,0,457},{14,0,171},{14,0,389},{146,0,
+153},{9,10,263},{10,10,147},{138,10,492},{137,11,891},{138,0,241},{133,10,537},{
+6,0,2005},{136,0,964},{137,10,842},{151,11,8},{4,11,407},{132,11,560},{135,11,
+1884},{6,0,1100},{134,0,1242},{135,0,954},{5,10,230},{5,10,392},{6,10,420},{9,10
+,568},{140,10,612},{4,11,475},{11,11,35},{11,11,90},{13,11,7},{13,11,71},{13,11,
+177},{142,11,422},{136,11,332},{135,0,1958},{6,0,549},{8,0,34},{8,0,283},{9,0,
+165},{138,0,475},{10,0,952},{12,0,966},{140,0,994},{5,0,652},{5,0,701},{135,0,
+449},{4,0,655},{7,0,850},{17,0,75},{146,0,137},{4,0,146},{7,0,1618},{8,0,670},{5
+,10,41},{7,10,1459},{7,10,1469},{7,10,1859},{9,10,549},{139,10,905},{133,10,696}
+,{6,0,159},{6,0,364},{7,0,516},{137,0,518},{135,0,1439},{6,11,222},{7,11,636},{7
+,11,1620},{8,11,409},{9,11,693},{139,11,77},{13,0,151},{141,11,45},{6,0,1027},{4
+,11,336},{132,10,771},{139,11,392},{10,11,121},{11,11,175},{149,11,16},{8,0,950}
+,{138,0,983},{133,10,921},{135,0,993},{6,10,180},{7,10,1137},{8,10,751},{139,10,
+805},{7,0,501},{9,0,111},{10,0,141},{11,0,332},{13,0,43},{13,0,429},{14,0,130},{
+14,0,415},{145,0,102},{4,10,183},{5,11,882},{7,10,271},{11,10,824},{11,10,952},{
+13,10,278},{13,10,339},{13,10,482},{14,10,424},{148,10,99},{4,10,19},{5,10,477},
+{5,10,596},{6,10,505},{7,10,1221},{11,10,907},{12,10,209},{141,10,214},{135,10,
+1215},{133,0,452},{132,11,426},{5,0,149},{136,0,233},{133,0,935},{6,11,58},{7,11
+,654},{7,11,745},{7,11,1969},{8,11,240},{8,11,675},{9,11,479},{9,11,731},{10,11,
+330},{10,11,593},{10,11,817},{11,11,32},{11,11,133},{11,11,221},{145,11,68},{12,
+0,582},{18,0,131},{7,11,102},{137,11,538},{136,0,801},{134,10,1645},{132,0,70},{
+6,10,92},{6,10,188},{7,10,1269},{7,10,1524},{7,10,1876},{10,10,228},{139,10,1020
+},{4,10,459},{133,10,966},{138,0,369},{16,0,36},{140,10,330},{141,11,366},{7,0,
+721},{10,0,236},{12,0,204},{6,10,18},{7,10,932},{8,10,757},{9,10,54},{9,10,65},{
+9,10,844},{10,10,113},{10,10,315},{10,10,798},{11,10,153},{12,10,151},{12,10,392
+},{12,10,666},{142,10,248},{7,0,241},{10,0,430},{8,10,548},{9,10,532},{10,10,117
+},{11,10,351},{11,10,375},{143,10,23},{134,10,1742},{133,10,965},{133,11,566},{6
+,11,48},{135,11,63},{134,10,182},{10,10,65},{10,10,488},{138,10,497},{6,11,114},
+{7,11,1224},{7,11,1556},{136,11,3},{134,0,1817},{8,11,576},{137,11,267},{6,0,
+1078},{144,0,16},{9,10,588},{138,10,260},{138,0,1021},{5,0,406},{134,0,2022},{
+133,11,933},{6,0,69},{135,0,117},{7,0,1830},{136,11,427},{4,0,432},{135,0,824},{
+134,10,1786},{133,0,826},{139,11,67},{133,11,759},{135,10,308},{137,0,816},{133,
+0,1000},{4,0,297},{6,0,529},{7,0,152},{7,0,713},{7,0,1845},{8,0,710},{8,0,717},{
+12,0,639},{140,0,685},{7,0,423},{136,10,588},{136,10,287},{136,0,510},{134,0,
+1048},{6,0,618},{7,11,56},{7,11,1989},{8,11,337},{8,11,738},{9,11,600},{10,11,
+483},{12,11,37},{13,11,447},{142,11,92},{4,0,520},{135,0,575},{8,0,990},{138,0,
+977},{135,11,774},{9,11,347},{11,11,24},{140,11,170},{136,11,379},{140,10,290},{
+132,11,328},{4,0,321},{134,0,569},{4,11,101},{135,11,1171},{7,0,723},{7,0,1135},
+{5,11,833},{136,11,744},{7,10,719},{8,10,809},{136,10,834},{8,0,921},{136,10,796
+},{5,10,210},{6,10,213},{7,10,60},{10,10,364},{139,10,135},{5,0,397},{6,0,154},{
+7,0,676},{8,0,443},{8,0,609},{9,0,24},{9,0,325},{10,0,35},{11,0,535},{11,0,672},
+{11,0,1018},{12,0,637},{16,0,30},{5,10,607},{8,10,326},{136,10,490},{4,10,701},{
+5,10,472},{6,11,9},{6,11,397},{7,11,53},{7,11,1742},{9,10,758},{10,11,632},{11,
+11,828},{140,11,146},{135,10,380},{135,10,1947},{148,11,109},{10,10,278},{138,11
+,278},{134,0,856},{7,0,139},{4,10,386},{8,10,405},{8,10,728},{9,10,497},{11,10,
+110},{11,10,360},{15,10,37},{144,10,84},{141,0,282},{133,0,981},{5,0,288},{7,10,
+1452},{7,10,1480},{8,10,634},{140,10,472},{7,0,1890},{8,11,367},{10,11,760},{14,
+11,79},{20,11,17},{152,11,0},{4,10,524},{136,10,810},{4,0,56},{7,0,1791},{8,0,
+607},{8,0,651},{11,0,465},{11,0,835},{12,0,337},{141,0,480},{10,10,238},{141,10,
+33},{11,11,417},{12,11,223},{140,11,265},{9,0,158},{10,0,411},{140,0,261},{133,
+10,532},{133,10,997},{12,11,186},{12,11,292},{14,11,100},{146,11,70},{6,0,1403},
+{136,0,617},{134,0,1205},{139,0,563},{4,0,242},{134,0,333},{4,11,186},{5,11,157}
+,{8,11,168},{138,11,6},{132,0,369},{133,11,875},{5,10,782},{5,10,829},{134,10,
+1738},{134,0,622},{135,11,1272},{6,0,1407},{7,11,111},{136,11,581},{7,10,1823},{
+139,10,693},{7,0,160},{10,0,624},{142,0,279},{132,0,363},{10,11,589},{12,11,111}
+,{13,11,260},{14,11,82},{18,11,63},{147,11,45},{7,11,1364},{7,11,1907},{141,11,
+158},{4,11,404},{4,11,659},{135,11,675},{13,11,211},{14,11,133},{14,11,204},{15,
+11,64},{15,11,69},{15,11,114},{16,11,10},{19,11,23},{19,11,35},{19,11,39},{19,11
+,51},{19,11,71},{19,11,75},{152,11,15},{4,10,78},{5,10,96},{5,10,182},{7,10,1724
+},{7,10,1825},{10,10,394},{10,10,471},{11,10,532},{14,10,340},{145,10,88},{135,
+10,1964},{133,11,391},{11,11,887},{14,11,365},{142,11,375},{5,11,540},{6,11,1697
+},{7,11,222},{136,11,341},{134,11,78},{9,0,601},{9,0,619},{10,0,505},{10,0,732},
+{11,0,355},{140,0,139},{134,0,292},{139,0,174},{5,0,177},{6,0,616},{7,0,827},{9,
+0,525},{138,0,656},{10,0,31},{6,10,215},{7,10,1028},{7,10,1473},{7,10,1721},{9,
+10,424},{138,10,779},{135,10,584},{136,11,293},{134,0,685},{135,11,1868},{133,11
+,460},{7,0,647},{6,10,67},{7,10,1630},{9,10,354},{9,10,675},{10,10,830},{14,10,
+80},{145,10,80},{4,0,161},{133,0,631},{6,10,141},{7,10,225},{9,10,59},{9,10,607}
+,{10,10,312},{11,10,687},{12,10,555},{13,10,373},{13,10,494},{148,10,58},{7,11,
+965},{7,11,1460},{135,11,1604},{136,10,783},{134,11,388},{6,0,722},{6,0,1267},{4
+,11,511},{9,11,333},{9,11,379},{10,11,602},{11,11,441},{11,11,723},{11,11,976},{
+140,11,357},{134,0,1797},{135,0,1684},{9,0,469},{9,0,709},{12,0,512},{14,0,65},{
+17,0,12},{5,11,938},{136,11,707},{7,0,1230},{136,0,531},{10,0,229},{11,0,73},{11
+,0,376},{139,0,433},{12,0,268},{12,0,640},{142,0,119},{7,10,430},{139,10,46},{6,
+0,558},{7,0,651},{8,0,421},{9,0,0},{10,0,34},{139,0,1008},{6,0,106},{7,0,1786},{
+7,0,1821},{9,0,102},{9,0,763},{5,10,602},{7,10,2018},{137,10,418},{5,0,65},{6,0,
+416},{7,0,1720},{7,0,1924},{10,0,109},{11,0,14},{11,0,70},{11,0,569},{11,0,735},
+{15,0,153},{20,0,80},{136,10,677},{135,11,1625},{137,11,772},{136,0,595},{6,11,
+469},{7,11,1709},{138,11,515},{7,0,1832},{138,0,374},{9,0,106},{9,0,163},{9,0,
+296},{10,0,167},{10,0,172},{10,0,777},{139,0,16},{6,0,6},{7,0,81},{7,0,771},{7,0
+,1731},{9,0,405},{138,0,421},{4,11,500},{135,11,938},{5,11,68},{134,11,383},{5,0
+,881},{133,0,885},{6,0,854},{6,0,1132},{6,0,1495},{6,0,1526},{6,0,1533},{134,0,
+1577},{4,11,337},{6,11,353},{7,11,1934},{8,11,488},{137,11,429},{7,11,236},{7,11
+,1795},{8,11,259},{9,11,135},{9,11,177},{10,11,825},{11,11,115},{11,11,370},{11,
+11,405},{11,11,604},{12,11,10},{12,11,667},{12,11,669},{13,11,76},{14,11,310},{
+15,11,76},{15,11,147},{148,11,23},{5,0,142},{134,0,546},{4,11,15},{5,11,22},{6,
+11,244},{7,11,40},{7,11,200},{7,11,906},{7,11,1199},{9,11,616},{10,11,716},{11,
+11,635},{11,11,801},{140,11,458},{5,0,466},{11,0,571},{12,0,198},{13,0,283},{14,
+0,186},{15,0,21},{15,0,103},{135,10,329},{4,0,185},{5,0,257},{5,0,839},{5,0,936}
+,{9,0,399},{10,0,258},{10,0,395},{10,0,734},{11,0,1014},{12,0,23},{13,0,350},{14
+,0,150},{19,0,6},{135,11,1735},{12,11,36},{141,11,337},{5,11,598},{7,11,791},{8,
+11,108},{137,11,123},{132,10,469},{7,0,404},{7,0,1377},{7,0,1430},{7,0,2017},{8,
+0,149},{8,0,239},{8,0,512},{8,0,793},{8,0,818},{9,0,474},{9,0,595},{10,0,122},{
+10,0,565},{10,0,649},{10,0,783},{11,0,239},{11,0,295},{11,0,447},{11,0,528},{11,
+0,639},{11,0,800},{12,0,25},{12,0,77},{12,0,157},{12,0,256},{12,0,316},{12,0,390
+},{12,0,391},{12,0,395},{12,0,478},{12,0,503},{12,0,592},{12,0,680},{13,0,50},{
+13,0,53},{13,0,132},{13,0,198},{13,0,322},{13,0,415},{13,0,511},{14,0,71},{14,0,
+395},{15,0,71},{15,0,136},{17,0,123},{18,0,93},{147,0,58},{136,0,712},{134,10,
+1743},{5,10,929},{6,10,340},{8,10,376},{136,10,807},{6,0,1848},{8,0,860},{10,0,
+856},{10,0,859},{10,0,925},{10,0,941},{140,0,762},{6,0,629},{6,0,906},{9,0,810},
+{140,0,652},{5,10,218},{7,10,1610},{138,10,83},{7,10,1512},{135,10,1794},{4,0,
+377},{24,0,13},{4,11,155},{7,11,1689},{11,10,0},{144,10,78},{4,11,164},{5,11,151
+},{5,11,730},{5,11,741},{7,11,498},{7,11,870},{7,11,1542},{12,11,213},{14,11,36}
+,{14,11,391},{17,11,111},{18,11,6},{18,11,46},{18,11,151},{19,11,36},{20,11,32},
+{20,11,56},{20,11,69},{20,11,102},{21,11,4},{22,11,8},{22,11,10},{22,11,14},{150
+,11,31},{7,0,1842},{133,10,571},{4,10,455},{4,11,624},{135,11,1752},{134,0,1501}
+,{4,11,492},{5,11,451},{6,10,161},{7,10,372},{137,10,597},{132,10,349},{4,0,180}
+,{135,0,1906},{135,11,835},{141,11,70},{132,0,491},{137,10,751},{6,10,432},{139,
+10,322},{4,0,171},{138,0,234},{6,11,113},{135,11,436},{4,0,586},{7,0,1186},{138,
+0,631},{5,10,468},{10,10,325},{11,10,856},{12,10,345},{143,10,104},{5,10,223},{
+10,11,592},{10,11,753},{12,11,317},{12,11,355},{12,11,465},{12,11,469},{12,11,
+560},{12,11,578},{141,11,243},{132,10,566},{135,11,520},{4,10,59},{135,10,1394},
+{6,10,436},{139,10,481},{9,0,931},{10,0,334},{20,0,71},{4,10,48},{5,10,271},{7,
+10,953},{135,11,1878},{11,0,170},{5,10,610},{136,10,457},{133,10,755},{6,0,1587}
+,{135,10,1217},{4,10,197},{149,11,26},{133,11,585},{137,11,521},{133,0,765},{133
+,10,217},{139,11,586},{133,0,424},{9,11,752},{12,11,610},{13,11,431},{16,11,59},
+{146,11,109},{136,0,714},{7,0,685},{132,11,307},{9,0,420},{10,0,269},{10,0,285},
+{10,0,576},{11,0,397},{13,0,175},{145,0,90},{132,0,429},{133,11,964},{9,11,463},
+{138,11,595},{7,0,18},{7,0,699},{7,0,1966},{8,0,752},{9,0,273},{9,0,412},{9,0,
+703},{10,0,71},{10,0,427},{138,0,508},{4,10,165},{7,10,1398},{135,10,1829},{4,0,
+53},{5,0,186},{7,0,752},{7,0,828},{142,0,116},{8,0,575},{10,0,289},{139,0,319},{
+132,0,675},{134,0,1424},{4,11,75},{5,11,180},{6,11,500},{7,11,58},{7,11,710},{
+138,11,645},{133,11,649},{6,11,276},{7,11,282},{7,11,879},{7,11,924},{8,11,459},
+{9,11,599},{9,11,754},{11,11,574},{12,11,128},{12,11,494},{13,11,52},{13,11,301}
+,{15,11,30},{143,11,132},{6,0,647},{134,0,1095},{5,10,9},{7,10,297},{7,10,966},{
+140,10,306},{132,11,200},{134,0,1334},{5,10,146},{6,10,411},{138,10,721},{6,0,
+209},{6,0,1141},{6,0,1288},{8,0,468},{9,0,210},{11,0,36},{12,0,28},{12,0,630},{
+13,0,21},{13,0,349},{14,0,7},{145,0,13},{6,10,177},{135,10,467},{4,0,342},{135,0
+,1179},{10,11,454},{140,11,324},{4,0,928},{133,0,910},{7,0,1838},{6,11,225},{137
+,11,211},{16,0,101},{20,0,115},{20,0,118},{148,0,122},{4,0,496},{135,0,856},{4,0
+,318},{11,0,654},{7,11,718},{139,11,102},{8,11,58},{9,11,724},{11,11,809},{13,11
+,113},{145,11,72},{5,10,200},{6,11,345},{135,11,1247},{8,11,767},{8,11,803},{9,
+11,301},{137,11,903},{7,0,915},{8,0,247},{19,0,0},{7,11,1949},{136,11,674},{4,0,
+202},{5,0,382},{6,0,454},{7,0,936},{7,0,1803},{8,0,758},{9,0,375},{9,0,895},{10,
+0,743},{10,0,792},{11,0,978},{11,0,1012},{142,0,109},{7,0,1150},{7,0,1425},{7,0,
+1453},{140,0,513},{134,11,259},{138,0,791},{11,0,821},{12,0,110},{12,0,153},{18,
+0,41},{150,0,19},{134,10,481},{132,0,796},{6,0,445},{9,0,909},{136,11,254},{10,0
+,776},{13,0,345},{142,0,425},{4,10,84},{7,10,1482},{10,10,76},{138,10,142},{135,
+11,742},{6,0,578},{133,10,1015},{6,0,1387},{4,10,315},{5,10,507},{135,10,1370},{
+4,0,438},{133,0,555},{136,0,766},{133,11,248},{134,10,1722},{4,11,116},{5,11,95}
+,{5,11,445},{7,11,1688},{8,11,29},{9,11,272},{11,11,509},{139,11,915},{135,0,541
+},{133,11,543},{8,10,222},{8,10,476},{9,10,238},{11,10,516},{11,10,575},{15,10,
+109},{146,10,100},{6,0,880},{134,0,1191},{5,11,181},{136,11,41},{134,0,1506},{
+132,11,681},{7,11,25},{8,11,202},{138,11,536},{139,0,983},{137,0,768},{132,0,584
+},{9,11,423},{140,11,89},{8,11,113},{9,11,877},{10,11,554},{11,11,83},{12,11,136
+},{147,11,109},{7,10,706},{7,10,1058},{138,10,538},{133,11,976},{4,11,206},{135,
+11,746},{136,11,526},{140,0,737},{11,10,92},{11,10,196},{11,10,409},{11,10,450},
+{11,10,666},{11,10,777},{12,10,262},{13,10,385},{13,10,393},{15,10,115},{16,10,
+45},{145,10,82},{4,0,226},{4,0,326},{7,0,1770},{4,11,319},{5,11,699},{138,11,673
+},{6,10,40},{135,10,1781},{5,0,426},{8,0,30},{9,0,2},{11,0,549},{147,0,122},{6,0
+,1161},{134,0,1329},{138,10,97},{6,10,423},{7,10,665},{135,10,1210},{7,11,13},{8
+,11,226},{10,11,537},{11,11,570},{11,11,605},{11,11,799},{11,11,804},{12,11,85},
+{12,11,516},{12,11,623},{13,11,112},{13,11,361},{14,11,77},{14,11,78},{17,11,28}
+,{147,11,110},{132,11,769},{132,11,551},{132,11,728},{147,0,117},{9,11,57},{9,11
+,459},{10,11,425},{11,11,119},{12,11,184},{12,11,371},{13,11,358},{145,11,51},{5
+,11,188},{5,11,814},{8,11,10},{9,11,421},{9,11,729},{10,11,609},{139,11,689},{
+134,11,624},{135,11,298},{135,0,462},{4,0,345},{139,10,624},{136,10,574},{4,0,
+385},{7,0,265},{135,0,587},{6,0,808},{132,11,528},{133,0,398},{132,10,354},{4,0,
+347},{5,0,423},{5,0,996},{135,0,1329},{135,10,1558},{7,0,1259},{9,0,125},{139,0,
+65},{5,0,136},{6,0,136},{136,0,644},{5,11,104},{6,11,173},{135,11,1631},{135,0,
+469},{133,10,830},{4,0,278},{5,0,465},{135,0,1367},{7,11,810},{8,11,138},{8,11,
+342},{9,11,84},{10,11,193},{11,11,883},{140,11,359},{5,10,496},{135,10,203},{4,0
+,433},{133,0,719},{6,11,95},{134,10,547},{5,10,88},{137,10,239},{6,11,406},{10,
+11,409},{10,11,447},{11,11,44},{140,11,100},{134,0,1423},{7,10,650},{135,10,1310
+},{134,0,749},{135,11,1243},{135,0,1363},{6,0,381},{7,0,645},{7,0,694},{8,0,546}
+,{7,10,1076},{9,10,80},{11,10,78},{11,10,421},{11,10,534},{140,10,545},{134,11,
+1636},{135,11,1344},{12,0,277},{7,10,274},{11,10,479},{139,10,507},{6,0,705},{6,
+0,783},{6,0,1275},{6,0,1481},{4,11,282},{7,11,1034},{11,11,398},{11,11,634},{12,
+11,1},{12,11,79},{12,11,544},{14,11,237},{17,11,10},{146,11,20},{134,0,453},{4,0
+,555},{8,0,536},{10,0,288},{11,0,1005},{4,10,497},{135,10,1584},{5,11,118},{5,11
+,499},{6,11,476},{7,11,600},{7,11,888},{135,11,1096},{138,0,987},{7,0,1107},{7,
+10,261},{7,10,1115},{7,10,1354},{7,10,1588},{7,10,1705},{7,10,1902},{9,10,465},{
+10,10,248},{10,10,349},{10,10,647},{11,10,527},{11,10,660},{11,10,669},{12,10,
+529},{141,10,305},{7,11,296},{7,11,596},{8,11,560},{8,11,586},{9,11,612},{11,11,
+100},{11,11,304},{12,11,46},{13,11,89},{14,11,112},{145,11,122},{9,0,370},{138,0
+,90},{136,10,13},{132,0,860},{7,10,642},{8,10,250},{11,10,123},{11,10,137},{13,
+10,48},{142,10,95},{135,10,1429},{137,11,321},{132,0,257},{135,0,2031},{7,0,1768
+},{7,11,1599},{7,11,1723},{8,11,79},{8,11,106},{8,11,190},{8,11,302},{8,11,383},
+{9,11,119},{9,11,233},{9,11,298},{9,11,419},{9,11,471},{10,11,181},{10,11,406},{
+11,11,57},{11,11,85},{11,11,120},{11,11,177},{11,11,296},{11,11,382},{11,11,454}
+,{11,11,758},{11,11,999},{12,11,27},{12,11,98},{12,11,131},{12,11,245},{12,11,
+312},{12,11,446},{12,11,454},{13,11,25},{13,11,98},{13,11,426},{13,11,508},{14,
+11,6},{14,11,163},{14,11,272},{14,11,277},{14,11,370},{15,11,95},{15,11,138},{15
+,11,167},{17,11,18},{17,11,38},{20,11,96},{149,11,32},{5,11,722},{134,11,1759},{
+145,11,16},{6,0,1071},{134,0,1561},{10,10,545},{140,10,301},{6,0,83},{6,0,1733},
+{135,0,1389},{4,0,835},{135,0,1818},{133,11,258},{4,10,904},{133,10,794},{134,0,
+2006},{5,11,30},{7,11,495},{8,11,134},{9,11,788},{140,11,438},{135,11,2004},{137
+,0,696},{5,11,50},{6,11,439},{7,11,780},{135,11,1040},{7,11,772},{7,11,1104},{7,
+11,1647},{11,11,269},{11,11,539},{11,11,607},{11,11,627},{11,11,706},{11,11,975}
+,{12,11,248},{12,11,311},{12,11,434},{12,11,600},{12,11,622},{13,11,297},{13,11,
+367},{13,11,485},{14,11,69},{14,11,409},{143,11,108},{5,11,1},{6,11,81},{138,11,
+520},{7,0,1718},{9,0,95},{9,0,274},{10,0,279},{10,0,317},{10,0,420},{11,0,303},{
+11,0,808},{12,0,134},{12,0,367},{13,0,149},{13,0,347},{14,0,349},{14,0,406},{18,
+0,22},{18,0,89},{18,0,122},{147,0,47},{5,11,482},{8,11,98},{9,11,172},{10,11,222
+},{10,11,700},{10,11,822},{11,11,302},{11,11,778},{12,11,50},{12,11,127},{12,11,
+396},{13,11,62},{13,11,328},{14,11,122},{147,11,72},{7,10,386},{138,10,713},{6,
+10,7},{6,10,35},{7,10,147},{7,10,1069},{7,10,1568},{7,10,1575},{7,10,1917},{8,10
+,43},{8,10,208},{9,10,128},{9,10,866},{10,10,20},{11,10,981},{147,10,33},{133,0,
+26},{132,0,550},{5,11,2},{7,11,1494},{136,11,589},{6,11,512},{7,11,797},{8,11,
+253},{9,11,77},{10,11,1},{10,11,129},{10,11,225},{11,11,118},{11,11,226},{11,11,
+251},{11,11,430},{11,11,701},{11,11,974},{11,11,982},{12,11,64},{12,11,260},{12,
+11,488},{140,11,690},{7,10,893},{141,10,424},{134,0,901},{136,0,822},{4,0,902},{
+5,0,809},{134,0,122},{6,0,807},{134,0,1366},{7,0,262},{5,11,748},{134,11,553},{
+133,0,620},{4,0,34},{5,0,574},{7,0,279},{7,0,1624},{136,0,601},{9,0,170},{6,10,
+322},{9,10,552},{11,10,274},{13,10,209},{13,10,499},{14,10,85},{15,10,126},{145,
+10,70},{132,0,537},{4,11,12},{7,11,420},{7,11,522},{7,11,809},{8,11,797},{141,11
+,88},{133,0,332},{8,10,83},{8,10,742},{8,10,817},{9,10,28},{9,10,29},{9,10,885},
+{10,10,387},{11,10,633},{11,10,740},{13,10,235},{13,10,254},{15,10,143},{143,10,
+146},{6,0,1909},{9,0,964},{12,0,822},{12,0,854},{12,0,865},{12,0,910},{12,0,938}
+,{15,0,169},{15,0,208},{15,0,211},{18,0,205},{18,0,206},{18,0,220},{18,0,223},{
+152,0,24},{140,10,49},{5,11,528},{135,11,1580},{6,0,261},{8,0,182},{139,0,943},{
+134,0,1721},{4,0,933},{133,0,880},{136,11,321},{5,11,266},{9,11,290},{9,11,364},
+{10,11,293},{11,11,606},{142,11,45},{6,0,1609},{4,11,50},{6,11,510},{6,11,594},{
+9,11,121},{10,11,49},{10,11,412},{139,11,834},{7,0,895},{136,11,748},{132,11,466
+},{4,10,110},{10,10,415},{10,10,597},{142,10,206},{133,0,812},{135,11,281},{6,0,
+1890},{6,0,1902},{6,0,1916},{9,0,929},{9,0,942},{9,0,975},{9,0,984},{9,0,986},{9
+,0,1011},{9,0,1019},{12,0,804},{12,0,851},{12,0,867},{12,0,916},{12,0,923},{15,0
+,194},{15,0,204},{15,0,210},{15,0,222},{15,0,223},{15,0,229},{15,0,250},{18,0,
+179},{18,0,186},{18,0,192},{7,10,205},{135,10,2000},{132,11,667},{135,0,778},{4,
+0,137},{7,0,1178},{135,0,1520},{134,0,1314},{4,11,242},{134,11,333},{6,0,1661},{
+7,0,1975},{7,0,2009},{135,0,2011},{134,0,1591},{4,10,283},{135,10,1194},{11,0,
+820},{150,0,51},{4,11,39},{5,11,36},{7,11,1843},{8,11,407},{11,11,144},{140,11,
+523},{134,10,1720},{4,11,510},{7,11,29},{7,11,66},{7,11,1980},{10,11,487},{10,11
+,809},{146,11,9},{5,0,89},{7,0,1915},{9,0,185},{9,0,235},{10,0,64},{10,0,270},{
+10,0,403},{10,0,469},{10,0,529},{10,0,590},{11,0,140},{11,0,860},{13,0,1},{13,0,
+422},{14,0,341},{14,0,364},{17,0,93},{18,0,113},{19,0,97},{147,0,113},{133,0,695
+},{6,0,987},{134,0,1160},{5,0,6},{6,0,183},{7,0,680},{7,0,978},{7,0,1013},{7,0,
+1055},{12,0,230},{13,0,172},{146,0,29},{134,11,570},{132,11,787},{134,11,518},{6
+,0,29},{139,0,63},{132,11,516},{136,11,821},{132,0,311},{134,0,1740},{7,0,170},{
+8,0,90},{8,0,177},{8,0,415},{11,0,714},{14,0,281},{136,10,735},{134,0,1961},{135
+,11,1405},{4,11,10},{7,11,917},{139,11,786},{5,10,132},{9,10,486},{9,10,715},{10
+,10,458},{11,10,373},{11,10,668},{11,10,795},{11,10,897},{12,10,272},{12,10,424}
+,{12,10,539},{12,10,558},{14,10,245},{14,10,263},{14,10,264},{14,10,393},{142,10
+,403},{11,0,91},{13,0,129},{15,0,101},{145,0,125},{135,0,1132},{4,0,494},{6,0,74
+},{7,0,44},{7,0,407},{12,0,17},{15,0,5},{148,0,11},{133,10,379},{5,0,270},{5,11,
+684},{6,10,89},{6,10,400},{7,10,1569},{7,10,1623},{7,10,1850},{8,10,218},{8,10,
+422},{9,10,570},{138,10,626},{4,0,276},{133,0,296},{6,0,1523},{134,11,27},{6,10,
+387},{7,10,882},{141,10,111},{6,10,224},{7,10,877},{137,10,647},{135,10,790},{4,
+0,7},{5,0,90},{5,0,158},{6,0,542},{7,0,221},{7,0,1574},{9,0,490},{10,0,540},{11,
+0,443},{139,0,757},{7,0,588},{9,0,175},{138,0,530},{135,10,394},{142,11,23},{134
+,0,786},{135,0,580},{7,0,88},{136,0,627},{5,0,872},{6,0,57},{7,0,471},{9,0,447},
+{137,0,454},{6,11,342},{6,11,496},{8,11,275},{137,11,206},{4,11,909},{133,11,940
+},{6,0,735},{132,11,891},{8,0,845},{8,0,916},{135,10,1409},{5,0,31},{134,0,614},
+{11,0,458},{12,0,15},{140,0,432},{8,0,330},{140,0,477},{4,0,530},{5,0,521},{7,0,
+1200},{10,0,460},{132,11,687},{6,0,424},{135,0,1866},{9,0,569},{12,0,12},{12,0,
+81},{12,0,319},{13,0,69},{14,0,259},{16,0,87},{17,0,1},{17,0,21},{17,0,24},{18,0
+,15},{18,0,56},{18,0,59},{18,0,127},{18,0,154},{19,0,19},{148,0,31},{7,0,1302},{
+136,10,38},{134,11,253},{5,10,261},{7,10,78},{7,10,199},{8,10,815},{9,10,126},{
+138,10,342},{5,0,595},{135,0,1863},{6,11,41},{141,11,160},{5,0,13},{134,0,142},{
+6,0,97},{7,0,116},{8,0,322},{8,0,755},{9,0,548},{10,0,714},{11,0,884},{13,0,324}
+,{7,11,1304},{138,11,477},{132,10,628},{134,11,1718},{7,10,266},{136,10,804},{
+135,10,208},{7,0,1021},{6,10,79},{135,10,1519},{7,0,1472},{135,0,1554},{6,11,362
+},{146,11,51},{7,0,1071},{7,0,1541},{7,0,1767},{7,0,1806},{11,0,162},{11,0,242},
+{11,0,452},{12,0,605},{15,0,26},{144,0,44},{136,10,741},{133,11,115},{145,0,115}
+,{134,10,376},{6,0,1406},{134,0,1543},{5,11,193},{12,11,178},{13,11,130},{145,11
+,84},{135,0,1111},{8,0,1},{9,0,650},{10,0,326},{5,11,705},{137,11,606},{5,0,488}
+,{6,0,527},{7,0,489},{7,0,1636},{8,0,121},{8,0,144},{8,0,359},{9,0,193},{9,0,241
+},{9,0,336},{9,0,882},{11,0,266},{11,0,372},{11,0,944},{12,0,401},{140,0,641},{
+135,11,174},{6,0,267},{7,10,244},{7,10,632},{7,10,1609},{8,10,178},{8,10,638},{
+141,10,58},{134,0,1983},{134,0,1155},{134,0,1575},{134,0,1438},{9,0,31},{10,0,
+244},{10,0,699},{12,0,149},{141,0,497},{133,0,377},{4,11,122},{5,11,796},{5,11,
+952},{6,11,1660},{6,11,1671},{8,11,567},{9,11,687},{9,11,742},{10,11,686},{11,11
+,356},{11,11,682},{140,11,281},{145,0,101},{11,11,0},{144,11,78},{5,11,179},{5,
+10,791},{7,11,1095},{135,11,1213},{8,11,372},{9,11,122},{138,11,175},{7,10,686},
+{8,10,33},{8,10,238},{10,10,616},{11,10,467},{11,10,881},{13,10,217},{13,10,253}
+,{142,10,268},{9,0,476},{4,11,66},{7,11,722},{135,11,904},{7,11,352},{137,11,684
+},{135,0,2023},{135,0,1836},{132,10,447},{5,0,843},{144,0,35},{137,11,779},{141,
+11,35},{4,10,128},{5,10,415},{6,10,462},{7,10,294},{7,10,578},{10,10,710},{139,
+10,86},{132,0,554},{133,0,536},{136,10,587},{5,0,207},{9,0,79},{11,0,625},{145,0
+,7},{7,0,1371},{6,10,427},{138,10,692},{4,0,424},{4,10,195},{135,10,802},{8,0,
+785},{133,11,564},{135,0,336},{4,0,896},{6,0,1777},{134,11,556},{137,11,103},{
+134,10,1683},{7,11,544},{8,11,719},{138,11,61},{138,10,472},{4,11,5},{5,11,498},
+{136,11,637},{7,0,750},{9,0,223},{11,0,27},{11,0,466},{12,0,624},{14,0,265},{146
+,0,61},{12,0,238},{18,0,155},{12,11,238},{146,11,155},{151,10,28},{133,11,927},{
+12,0,383},{5,10,3},{8,10,578},{9,10,118},{10,10,705},{141,10,279},{4,11,893},{5,
+11,780},{133,11,893},{4,0,603},{133,0,661},{4,0,11},{6,0,128},{7,0,231},{7,0,
+1533},{10,0,725},{5,10,229},{5,11,238},{135,11,1350},{8,10,102},{10,10,578},{10,
+10,672},{12,10,496},{13,10,408},{14,10,121},{145,10,106},{132,0,476},{134,0,1552
+},{134,11,1729},{8,10,115},{8,10,350},{9,10,489},{10,10,128},{11,10,306},{12,10,
+373},{14,10,30},{17,10,79},{19,10,80},{150,10,55},{135,0,1807},{4,0,680},{4,11,
+60},{7,11,760},{7,11,1800},{8,11,314},{9,11,700},{139,11,487},{4,10,230},{5,10,
+702},{148,11,94},{132,11,228},{139,0,435},{9,0,20},{10,0,324},{10,0,807},{139,0,
+488},{6,10,1728},{136,11,419},{4,10,484},{18,10,26},{19,10,42},{20,10,43},{21,10
+,0},{23,10,27},{152,10,14},{135,0,1431},{133,11,828},{5,0,112},{6,0,103},{6,0,
+150},{7,0,1303},{9,0,292},{10,0,481},{20,0,13},{7,11,176},{7,11,178},{7,11,1110}
+,{10,11,481},{148,11,13},{138,0,356},{4,11,51},{5,11,39},{6,11,4},{7,11,591},{7,
+11,849},{7,11,951},{7,11,1129},{7,11,1613},{7,11,1760},{7,11,1988},{9,11,434},{
+10,11,754},{11,11,25},{11,11,37},{139,11,414},{6,0,1963},{134,0,2000},{132,10,
+633},{6,0,1244},{133,11,902},{135,11,928},{140,0,18},{138,0,204},{135,11,1173},{
+134,0,867},{4,0,708},{8,0,15},{9,0,50},{9,0,386},{11,0,18},{11,0,529},{140,0,228
+},{134,11,270},{4,0,563},{7,0,109},{7,0,592},{7,0,637},{7,0,770},{8,0,463},{9,0,
+60},{9,0,335},{9,0,904},{10,0,73},{11,0,434},{12,0,585},{13,0,331},{18,0,110},{
+148,0,60},{132,0,502},{14,11,359},{19,11,52},{148,11,47},{6,11,377},{7,11,1025},
+{9,11,613},{145,11,104},{6,0,347},{10,0,161},{5,10,70},{5,10,622},{6,10,334},{7,
+10,1032},{9,10,171},{11,10,26},{11,10,213},{11,10,637},{11,10,707},{12,10,202},{
+12,10,380},{13,10,226},{13,10,355},{14,10,222},{145,10,42},{132,11,416},{4,0,33}
+,{5,0,102},{6,0,284},{7,0,1079},{7,0,1423},{7,0,1702},{8,0,470},{9,0,554},{9,0,
+723},{11,0,333},{142,11,372},{5,11,152},{5,11,197},{7,11,340},{7,11,867},{10,11,
+548},{10,11,581},{11,11,6},{12,11,3},{12,11,19},{14,11,110},{142,11,289},{7,0,
+246},{135,0,840},{6,0,10},{8,0,571},{9,0,739},{143,0,91},{6,0,465},{7,0,1465},{4
+,10,23},{4,10,141},{5,10,313},{5,10,1014},{6,10,50},{7,10,142},{7,10,559},{8,10,
+640},{9,10,460},{9,10,783},{11,10,741},{12,10,183},{141,10,488},{133,0,626},{136
+,0,614},{138,0,237},{7,11,34},{7,11,190},{8,11,28},{8,11,141},{8,11,444},{8,11,
+811},{9,11,468},{11,11,334},{12,11,24},{12,11,386},{140,11,576},{133,11,757},{5,
+0,18},{6,0,526},{13,0,24},{13,0,110},{19,0,5},{147,0,44},{6,0,506},{134,11,506},
+{135,11,1553},{4,0,309},{5,0,462},{7,0,970},{7,0,1097},{22,0,30},{22,0,33},{7,11
+,1385},{11,11,582},{11,11,650},{11,11,901},{11,11,949},{12,11,232},{12,11,236},{
+13,11,413},{13,11,501},{146,11,116},{9,0,140},{5,10,222},{138,10,534},{6,0,1056}
+,{137,10,906},{134,0,1704},{138,10,503},{134,0,1036},{5,10,154},{7,10,1491},{10,
+10,379},{138,10,485},{4,11,383},{133,10,716},{134,0,1315},{5,0,86},{7,0,743},{9,
+0,85},{10,0,281},{10,0,432},{11,0,825},{12,0,251},{13,0,118},{142,0,378},{8,0,
+264},{4,10,91},{5,10,388},{5,10,845},{6,10,206},{6,10,252},{6,10,365},{7,10,136}
+,{7,10,531},{136,10,621},{5,0,524},{133,0,744},{5,11,277},{141,11,247},{132,11,
+435},{10,0,107},{140,0,436},{132,0,927},{10,0,123},{12,0,670},{146,0,94},{7,0,
+1149},{9,0,156},{138,0,957},{5,11,265},{6,11,212},{135,11,28},{133,0,778},{133,0
+,502},{8,0,196},{10,0,283},{139,0,406},{135,10,576},{136,11,535},{134,0,1312},{5
+,10,771},{5,10,863},{5,10,898},{6,10,1632},{6,10,1644},{134,10,1780},{5,0,855},{
+5,10,331},{135,11,1487},{132,11,702},{5,11,808},{135,11,2045},{7,0,1400},{9,0,
+446},{138,0,45},{140,10,632},{132,0,1003},{5,11,166},{8,11,739},{140,11,511},{5,
+10,107},{7,10,201},{136,10,518},{6,10,446},{135,10,1817},{134,0,1532},{134,0,
+1097},{4,11,119},{5,11,170},{5,11,447},{7,11,1708},{7,11,1889},{9,11,357},{9,11,
+719},{12,11,486},{140,11,596},{9,10,851},{141,10,510},{7,0,612},{8,0,545},{8,0,
+568},{8,0,642},{9,0,717},{10,0,541},{10,0,763},{11,0,449},{12,0,489},{13,0,153},
+{13,0,296},{14,0,138},{14,0,392},{15,0,50},{16,0,6},{16,0,12},{20,0,9},{132,10,
+504},{4,11,450},{135,11,1158},{11,0,54},{13,0,173},{13,0,294},{5,10,883},{5,10,
+975},{8,10,392},{148,10,7},{13,0,455},{15,0,99},{15,0,129},{144,0,68},{135,0,172
+},{132,11,754},{5,10,922},{134,10,1707},{134,0,1029},{17,11,39},{148,11,36},{4,0
+,568},{5,10,993},{7,10,515},{137,10,91},{132,0,732},{10,0,617},{138,11,617},{134
+,0,974},{7,0,989},{10,0,377},{12,0,363},{13,0,68},{13,0,94},{14,0,108},{142,0,
+306},{136,0,733},{132,0,428},{7,0,1789},{135,11,1062},{7,0,2015},{140,0,665},{
+135,10,1433},{5,0,287},{7,10,921},{8,10,580},{8,10,593},{8,10,630},{138,10,28},{
+138,0,806},{4,10,911},{5,10,867},{5,10,1013},{7,10,2034},{8,10,798},{136,10,813}
+,{134,0,1539},{8,11,523},{150,11,34},{135,11,740},{7,11,238},{7,11,2033},{8,11,
+120},{8,11,188},{8,11,659},{9,11,598},{10,11,466},{12,11,342},{12,11,588},{13,11
+,503},{14,11,246},{143,11,92},{7,0,1563},{141,0,182},{5,10,135},{6,10,519},{7,10
+,1722},{10,10,271},{11,10,261},{145,10,54},{14,10,338},{148,10,81},{7,0,484},{4,
+10,300},{133,10,436},{145,11,114},{6,0,1623},{134,0,1681},{133,11,640},{4,11,201
+},{7,11,1744},{8,11,602},{11,11,247},{11,11,826},{145,11,65},{8,11,164},{146,11,
+62},{6,0,1833},{6,0,1861},{136,0,878},{134,0,1569},{8,10,357},{10,10,745},{14,10
+,426},{17,10,94},{147,10,57},{12,0,93},{12,0,501},{13,0,362},{14,0,151},{15,0,40
+},{15,0,59},{16,0,46},{17,0,25},{18,0,14},{18,0,134},{19,0,25},{19,0,69},{20,0,
+16},{20,0,19},{20,0,66},{21,0,23},{21,0,25},{150,0,42},{6,0,1748},{8,0,715},{9,0
+,802},{10,0,46},{10,0,819},{13,0,308},{14,0,351},{14,0,363},{146,0,67},{132,0,
+994},{4,0,63},{133,0,347},{132,0,591},{133,0,749},{7,11,1577},{10,11,304},{10,11
+,549},{11,11,424},{12,11,365},{13,11,220},{13,11,240},{142,11,33},{133,0,366},{7
+,0,557},{12,0,547},{14,0,86},{133,10,387},{135,0,1747},{132,11,907},{5,11,100},{
+10,11,329},{12,11,416},{149,11,29},{4,10,6},{5,10,708},{136,10,75},{7,10,1351},{
+9,10,581},{10,10,639},{11,10,453},{140,10,584},{7,0,89},{132,10,303},{138,10,772
+},{132,11,176},{5,11,636},{5,11,998},{8,11,26},{137,11,358},{7,11,9},{7,11,1508}
+,{9,11,317},{10,11,210},{10,11,292},{10,11,533},{11,11,555},{12,11,526},{12,11,
+607},{13,11,263},{13,11,459},{142,11,271},{134,0,1463},{6,0,772},{6,0,1137},{139
+,11,595},{7,0,977},{139,11,66},{138,0,893},{20,0,48},{148,11,48},{5,0,824},{133,
+0,941},{134,11,295},{7,0,1543},{7,0,1785},{10,0,690},{4,10,106},{139,10,717},{7,
+0,440},{8,0,230},{139,0,106},{5,10,890},{133,10,988},{6,10,626},{142,10,431},{10
+,11,127},{141,11,27},{17,0,32},{10,10,706},{150,10,44},{132,0,216},{137,0,332},{
+4,10,698},{136,11,119},{139,11,267},{138,10,17},{11,11,526},{11,11,939},{141,11,
+290},{7,11,1167},{11,11,934},{13,11,391},{145,11,76},{139,11,39},{134,10,84},{4,
+0,914},{5,0,800},{133,0,852},{10,0,416},{141,0,115},{7,0,564},{142,0,168},{4,0,
+918},{133,0,876},{134,0,1764},{152,0,3},{4,0,92},{5,0,274},{7,11,126},{136,11,84
+},{140,10,498},{136,11,790},{8,0,501},{5,10,986},{6,10,130},{7,10,1582},{8,10,
+458},{10,10,101},{10,10,318},{138,10,823},{6,11,64},{12,11,377},{141,11,309},{5,
+0,743},{138,0,851},{4,0,49},{7,0,280},{135,0,1633},{134,0,879},{136,0,47},{7,10,
+1644},{137,10,129},{132,0,865},{134,0,1202},{9,11,34},{139,11,484},{135,10,997},
+{5,0,272},{5,0,908},{5,0,942},{8,0,197},{9,0,47},{11,0,538},{139,0,742},{6,11,
+1700},{7,11,26},{7,11,293},{7,11,382},{7,11,1026},{7,11,1087},{7,11,2027},{8,11,
+24},{8,11,114},{8,11,252},{8,11,727},{8,11,729},{9,11,30},{9,11,199},{9,11,231},
+{9,11,251},{9,11,334},{9,11,361},{9,11,488},{9,11,712},{10,11,55},{10,11,60},{10
+,11,232},{10,11,332},{10,11,384},{10,11,396},{10,11,504},{10,11,542},{10,11,652}
+,{11,11,20},{11,11,48},{11,11,207},{11,11,291},{11,11,298},{11,11,342},{11,11,
+365},{11,11,394},{11,11,620},{11,11,705},{11,11,1017},{12,11,123},{12,11,340},{
+12,11,406},{12,11,643},{13,11,61},{13,11,269},{13,11,311},{13,11,319},{13,11,486
+},{14,11,234},{15,11,62},{15,11,85},{16,11,71},{18,11,119},{148,11,105},{6,0,
+1455},{150,11,37},{135,10,1927},{135,0,1911},{137,0,891},{7,10,1756},{137,10,98}
+,{7,10,1046},{139,10,160},{132,0,761},{6,11,379},{7,11,270},{7,11,1116},{8,11,
+176},{8,11,183},{9,11,432},{9,11,661},{12,11,247},{12,11,617},{146,11,125},{6,10
+,45},{7,10,433},{8,10,129},{9,10,21},{10,10,392},{11,10,79},{12,10,499},{13,10,
+199},{141,10,451},{4,0,407},{5,11,792},{133,11,900},{132,0,560},{135,0,183},{13,
+0,490},{7,10,558},{136,10,353},{4,0,475},{6,0,731},{11,0,35},{13,0,71},{13,0,177
+},{14,0,422},{133,10,785},{8,10,81},{9,10,189},{9,10,201},{11,10,478},{11,10,712
+},{141,10,338},{4,0,418},{4,0,819},{133,10,353},{151,10,26},{4,11,901},{133,11,
+776},{132,0,575},{7,0,818},{16,0,92},{17,0,14},{17,0,45},{18,0,75},{148,0,18},{6
+,0,222},{7,0,636},{7,0,1620},{8,0,409},{9,0,693},{139,0,77},{6,10,25},{7,10,855}
+,{7,10,1258},{144,10,32},{6,0,1880},{6,0,1887},{6,0,1918},{6,0,1924},{9,0,967},{
+9,0,995},{9,0,1015},{12,0,826},{12,0,849},{12,0,857},{12,0,860},{12,0,886},{12,0
+,932},{18,0,228},{18,0,231},{146,0,240},{134,0,633},{134,0,1308},{4,11,37},{5,11
+,334},{135,11,1253},{10,0,86},{4,10,4},{7,10,1118},{7,10,1320},{7,10,1706},{8,10
+,277},{9,10,622},{11,10,724},{12,10,350},{12,10,397},{13,10,28},{13,10,159},{15,
+10,89},{18,10,5},{19,10,9},{20,10,34},{150,10,47},{132,11,508},{137,11,448},{12,
+11,107},{146,11,31},{132,0,817},{134,0,663},{133,0,882},{134,0,914},{132,11,540}
+,{132,11,533},{136,11,608},{8,0,885},{138,0,865},{132,0,426},{6,0,58},{7,0,745},
+{7,0,1969},{8,0,399},{8,0,675},{9,0,479},{9,0,731},{10,0,330},{10,0,593},{10,0,
+817},{11,0,32},{11,0,133},{11,0,221},{145,0,68},{134,10,255},{7,0,102},{137,0,
+538},{137,10,216},{7,11,253},{136,11,549},{135,11,912},{9,10,183},{139,10,286},{
+11,10,956},{151,10,3},{8,11,527},{18,11,60},{147,11,24},{4,10,536},{7,10,1141},{
+10,10,723},{139,10,371},{133,11,920},{7,0,876},{135,10,285},{135,10,560},{132,10
+,690},{142,11,126},{11,10,33},{12,10,571},{149,10,1},{133,0,566},{9,0,139},{10,0
+,399},{11,0,469},{12,0,634},{13,0,223},{132,11,483},{6,0,48},{135,0,63},{18,0,12
+},{7,10,1862},{12,10,491},{12,10,520},{13,10,383},{142,10,244},{135,11,1665},{
+132,11,448},{9,11,495},{146,11,104},{6,0,114},{7,0,1224},{7,0,1556},{136,0,3},{4
+,10,190},{133,10,554},{8,0,576},{9,0,267},{133,10,1001},{133,10,446},{133,0,933}
+,{139,11,1009},{8,11,653},{13,11,93},{147,11,14},{6,0,692},{6,0,821},{134,0,1077
+},{5,11,172},{135,11,801},{138,0,752},{4,0,375},{134,0,638},{134,0,1011},{140,11
+,540},{9,0,96},{133,11,260},{139,11,587},{135,10,1231},{12,0,30},{13,0,148},{14,
+0,87},{14,0,182},{16,0,42},{20,0,70},{132,10,304},{6,0,1398},{7,0,56},{7,0,1989}
+,{8,0,337},{8,0,738},{9,0,600},{12,0,37},{13,0,447},{142,0,92},{138,0,666},{5,0,
+394},{7,0,487},{136,0,246},{9,0,437},{6,10,53},{6,10,199},{7,10,1408},{8,10,32},
+{8,10,93},{10,10,397},{10,10,629},{11,10,593},{11,10,763},{13,10,326},{145,10,35
+},{134,10,105},{9,0,320},{10,0,506},{138,10,794},{7,11,57},{8,11,167},{8,11,375}
+,{9,11,82},{9,11,561},{10,11,620},{10,11,770},{11,10,704},{141,10,396},{6,0,1003
+},{5,10,114},{5,10,255},{141,10,285},{7,0,866},{135,0,1163},{133,11,531},{132,0,
+328},{7,10,2035},{8,10,19},{9,10,89},{138,10,831},{8,11,194},{136,11,756},{136,0
+,1000},{5,11,453},{134,11,441},{4,0,101},{5,0,833},{7,0,1171},{136,0,744},{133,0
+,726},{136,10,746},{138,0,176},{6,0,9},{6,0,397},{7,0,53},{7,0,1742},{10,0,632},
+{11,0,828},{140,0,146},{135,11,22},{145,11,64},{132,0,839},{11,0,417},{12,0,223}
+,{140,0,265},{4,11,102},{7,11,815},{7,11,1699},{139,11,964},{5,10,955},{136,10,
+814},{6,0,1931},{6,0,2007},{18,0,246},{146,0,247},{8,0,198},{11,0,29},{140,0,534
+},{135,0,1771},{6,0,846},{7,11,1010},{11,11,733},{11,11,759},{12,11,563},{13,11,
+34},{14,11,101},{18,11,45},{146,11,129},{4,0,186},{5,0,157},{8,0,168},{138,0,6},
+{132,11,899},{133,10,56},{148,10,100},{133,0,875},{5,0,773},{5,0,991},{6,0,1635}
+,{134,0,1788},{6,0,1274},{9,0,477},{141,0,78},{4,0,639},{7,0,111},{8,0,581},{12,
+0,177},{6,11,52},{9,11,104},{9,11,559},{10,10,4},{10,10,13},{11,10,638},{12,11,
+308},{19,11,87},{148,10,57},{132,11,604},{4,11,301},{133,10,738},{133,10,758},{
+134,0,1747},{7,11,1440},{11,11,854},{11,11,872},{11,11,921},{12,11,551},{13,11,
+472},{142,11,367},{7,0,1364},{7,0,1907},{141,0,158},{134,0,873},{4,0,404},{4,0,
+659},{7,0,552},{135,0,675},{135,10,1112},{139,10,328},{7,11,508},{137,10,133},{
+133,0,391},{5,10,110},{6,10,169},{6,10,1702},{7,10,400},{8,10,538},{9,10,184},{9
+,10,524},{140,10,218},{6,11,310},{7,11,1849},{8,11,72},{8,11,272},{8,11,431},{9,
+11,12},{9,11,351},{10,11,563},{10,11,630},{10,11,810},{11,11,367},{11,11,599},{
+11,11,686},{140,11,672},{5,0,540},{6,0,1697},{136,0,668},{132,0,883},{134,0,78},
+{12,0,628},{18,0,79},{6,10,133},{9,10,353},{139,10,993},{6,11,181},{7,11,537},{8
+,11,64},{9,11,127},{10,11,496},{12,11,510},{141,11,384},{6,10,93},{7,10,1422},{7
+,10,1851},{8,10,673},{9,10,529},{140,10,43},{137,10,371},{134,0,1460},{134,0,962
+},{4,11,244},{135,11,233},{9,10,25},{10,10,467},{138,10,559},{4,10,335},{135,10,
+942},{133,0,460},{135,11,334},{134,11,1650},{4,0,199},{139,0,34},{5,10,601},{8,
+10,39},{10,10,773},{11,10,84},{12,10,205},{142,10,1},{133,10,870},{134,0,388},{
+14,0,474},{148,0,120},{133,11,369},{139,0,271},{4,0,511},{9,0,333},{9,0,379},{10
+,0,602},{11,0,441},{11,0,723},{11,0,976},{12,0,357},{132,10,181},{134,0,608},{
+134,10,1652},{22,0,49},{137,11,338},{140,0,988},{134,0,617},{5,0,938},{136,0,707
+},{132,10,97},{5,10,147},{6,10,286},{7,10,1362},{141,10,176},{6,0,756},{134,0,
+1149},{133,11,896},{6,10,375},{7,10,169},{7,10,254},{136,10,780},{134,0,1583},{
+135,10,1447},{139,0,285},{7,11,1117},{8,11,393},{136,11,539},{135,0,344},{6,0,
+469},{7,0,1709},{138,0,515},{5,10,629},{135,10,1549},{5,11,4},{5,11,810},{6,11,
+13},{6,11,538},{6,11,1690},{6,11,1726},{7,11,499},{7,11,1819},{8,11,148},{8,11,
+696},{8,11,791},{12,11,125},{13,11,54},{143,11,9},{135,11,1268},{137,0,404},{132
+,0,500},{5,0,68},{134,0,383},{11,0,216},{139,0,340},{4,11,925},{5,11,803},{8,11,
+698},{138,11,828},{4,0,337},{6,0,353},{7,0,1934},{8,0,488},{137,0,429},{7,0,236}
+,{7,0,1795},{8,0,259},{9,0,135},{9,0,177},{9,0,860},{10,0,825},{11,0,115},{11,0,
+370},{11,0,405},{11,0,604},{12,0,10},{12,0,667},{12,0,669},{13,0,76},{14,0,310},
+{15,0,76},{15,0,147},{148,0,23},{4,0,15},{4,0,490},{5,0,22},{6,0,244},{7,0,40},{
+7,0,200},{7,0,906},{7,0,1199},{9,0,616},{10,0,716},{11,0,635},{11,0,801},{140,0,
+458},{12,0,756},{132,10,420},{134,0,1504},{6,0,757},{133,11,383},{6,0,1266},{135
+,0,1735},{5,0,598},{7,0,791},{8,0,108},{9,0,123},{7,10,1570},{140,10,542},{142,
+11,410},{9,11,660},{138,11,347}
+};
+/* GENERATED CODE END */
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_STATIC_DICT_LUT_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/utf8_util.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/utf8_util.c
new file mode 100644
index 0000000000..65ec3f5c8d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/utf8_util.c
@@ -0,0 +1,85 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Heuristics for deciding about the UTF8-ness of strings. */
+
+#include "utf8_util.h"
+
+#include <brotli/types.h>
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static size_t BrotliParseAsUTF8(
+    int* symbol, const uint8_t* input, size_t size) {
+  /* ASCII */
+  if ((input[0] & 0x80) == 0) {
+    *symbol = input[0];
+    if (*symbol > 0) {
+      return 1;
+    }
+  }
+  /* 2-byte UTF8 */
+  if (size > 1u &&
+      (input[0] & 0xE0) == 0xC0 &&
+      (input[1] & 0xC0) == 0x80) {
+    *symbol = (((input[0] & 0x1F) << 6) |
+               (input[1] & 0x3F));
+    if (*symbol > 0x7F) {
+      return 2;
+    }
+  }
+  /* 3-byte UFT8 */
+  if (size > 2u &&
+      (input[0] & 0xF0) == 0xE0 &&
+      (input[1] & 0xC0) == 0x80 &&
+      (input[2] & 0xC0) == 0x80) {
+    *symbol = (((input[0] & 0x0F) << 12) |
+               ((input[1] & 0x3F) << 6) |
+               (input[2] & 0x3F));
+    if (*symbol > 0x7FF) {
+      return 3;
+    }
+  }
+  /* 4-byte UFT8 */
+  if (size > 3u &&
+      (input[0] & 0xF8) == 0xF0 &&
+      (input[1] & 0xC0) == 0x80 &&
+      (input[2] & 0xC0) == 0x80 &&
+      (input[3] & 0xC0) == 0x80) {
+    *symbol = (((input[0] & 0x07) << 18) |
+               ((input[1] & 0x3F) << 12) |
+               ((input[2] & 0x3F) << 6) |
+               (input[3] & 0x3F));
+    if (*symbol > 0xFFFF && *symbol <= 0x10FFFF) {
+      return 4;
+    }
+  }
+  /* Not UTF8, emit a special symbol above the UTF8-code space */
+  *symbol = 0x110000 | input[0];
+  return 1;
+}
+
+/* Returns 1 if at least min_fraction of the data is UTF8-encoded.*/
+BROTLI_BOOL BrotliIsMostlyUTF8(
+    const uint8_t* data, const size_t pos, const size_t mask,
+    const size_t length, const double min_fraction) {
+  size_t size_utf8 = 0;
+  size_t i = 0;
+  while (i < length) {
+    int symbol;
+    size_t bytes_read =
+        BrotliParseAsUTF8(&symbol, &data[(pos + i) & mask], length - i);
+    i += bytes_read;
+    if (symbol < 0x110000) size_utf8 += bytes_read;
+  }
+  return TO_BROTLI_BOOL((double)size_utf8 > min_fraction * (double)length);
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/utf8_util.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/utf8_util.h
new file mode 100644
index 0000000000..a38a95383c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/utf8_util.h
@@ -0,0 +1,33 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Heuristics for deciding about the UTF8-ness of strings. */
+
+#ifndef BROTLI_ENC_UTF8_UTIL_H_
+#define BROTLI_ENC_UTF8_UTIL_H_
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+static const double kMinUTF8Ratio = 0.75;
+
+/* Returns 1 if at least min_fraction of the bytes between pos and
+   pos + length in the (data, mask) ring-buffer is UTF8-encoded, otherwise
+   returns 0. */
+BROTLI_INTERNAL BROTLI_BOOL BrotliIsMostlyUTF8(
+    const uint8_t* data, const size_t pos, const size_t mask,
+    const size_t length, const double min_fraction);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_UTF8_UTIL_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/write_bits.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/write_bits.h
new file mode 100644
index 0000000000..242754b0ee
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/enc/write_bits.h
@@ -0,0 +1,88 @@
+/* Copyright 2010 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Write bits into a byte array. */
+
+#ifndef BROTLI_ENC_WRITE_BITS_H_
+#define BROTLI_ENC_WRITE_BITS_H_
+
+#include <brotli/types.h>
+
+#include "../common/platform.h"
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* This function writes bits into bytes in increasing addresses, and within
+   a byte least-significant-bit first.
+
+   The function can write up to 56 bits in one go with WriteBits
+   Example: let's assume that 3 bits (Rs below) have been written already:
+
+   BYTE-0     BYTE+1       BYTE+2
+
+   0000 0RRR    0000 0000    0000 0000
+
+   Now, we could write 5 or less bits in MSB by just shifting by 3
+   and OR'ing to BYTE-0.
+
+   For n bits, we take the last 5 bits, OR that with high bits in BYTE-0,
+   and locate the rest in BYTE+1, BYTE+2, etc. */
+static BROTLI_INLINE void BrotliWriteBits(size_t n_bits,
+                                          uint64_t bits,
+                                          size_t* BROTLI_RESTRICT pos,
+                                          uint8_t* BROTLI_RESTRICT array) {
+  BROTLI_LOG(("WriteBits  %2d  0x%08x%08x  %10d\n", (int)n_bits,
+      (uint32_t)(bits >> 32), (uint32_t)(bits & 0xFFFFFFFF),
+      (int)*pos));
+  BROTLI_DCHECK((bits >> n_bits) == 0);
+  BROTLI_DCHECK(n_bits <= 56);
+#if defined(BROTLI_LITTLE_ENDIAN)
+  /* This branch of the code can write up to 56 bits at a time,
+     7 bits are lost by being perhaps already in *p and at least
+     1 bit is needed to initialize the bit-stream ahead (i.e. if 7
+     bits are in *p and we write 57 bits, then the next write will
+     access a byte that was never initialized). */
+  {
+    uint8_t* p = &array[*pos >> 3];
+    uint64_t v = (uint64_t)(*p);  /* Zero-extend 8 to 64 bits. */
+    v |= bits << (*pos & 7);
+    BROTLI_UNALIGNED_STORE64LE(p, v);  /* Set some bits. */
+    *pos += n_bits;
+  }
+#else
+  /* implicit & 0xFF is assumed for uint8_t arithmetics */
+  {
+    uint8_t* array_pos = &array[*pos >> 3];
+    const size_t bits_reserved_in_first_byte = (*pos & 7);
+    size_t bits_left_to_write;
+    bits <<= bits_reserved_in_first_byte;
+    *array_pos++ |= (uint8_t)bits;
+    for (bits_left_to_write = n_bits + bits_reserved_in_first_byte;
+         bits_left_to_write >= 9;
+         bits_left_to_write -= 8) {
+      bits >>= 8;
+      *array_pos++ = (uint8_t)bits;
+    }
+    *array_pos = 0;
+    *pos += n_bits;
+  }
+#endif
+}
+
+static BROTLI_INLINE void BrotliWriteBitsPrepareStorage(
+    size_t pos, uint8_t* array) {
+  BROTLI_LOG(("WriteBitsPrepareStorage            %10d\n", (int)pos));
+  BROTLI_DCHECK((pos & 7) == 0);
+  array[pos >> 3] = 0;
+}
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_WRITE_BITS_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/BUILD.bazel b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/BUILD.bazel
new file mode 100644
index 0000000000..7f56d96529
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/BUILD.bazel
@@ -0,0 +1,12 @@
+load("@rules_fuzzing//fuzzing:cc_defs.bzl", "cc_fuzz_test")
+
+package(default_visibility = ["//visibility:public"])
+
+licenses(["notice"])  # MIT
+
+# To start fuzzing run: bazel run --config=asan-libfuzzer //:fuzz_config_run
+cc_fuzz_test(
+    name = "decode_fuzzer",
+    srcs = ["decode_fuzzer.c"],
+    deps = ["@org_brotli//:brotlidec"],
+)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/WORKSPACE.bazel b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/WORKSPACE.bazel
new file mode 100644
index 0000000000..5c6e4729b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/WORKSPACE.bazel
@@ -0,0 +1,23 @@
+workspace(name = "org_brotli_fuzz")
+
+local_repository(
+    name = "org_brotli",
+    path = "../..",
+)
+
+load("@bazel_tools//tools/build_defs/repo:http.bzl", "http_archive")
+
+http_archive(
+    name = "rules_fuzzing",
+    sha256 = "d9002dd3cd6437017f08593124fdd1b13b3473c7b929ceb0e60d317cb9346118",
+    strip_prefix = "rules_fuzzing-0.3.2",
+    urls = ["https://github.com/bazelbuild/rules_fuzzing/archive/v0.3.2.zip"],
+)
+
+load("@rules_fuzzing//fuzzing:repositories.bzl", "rules_fuzzing_dependencies")
+
+rules_fuzzing_dependencies()
+
+load("@rules_fuzzing//fuzzing:init.bzl", "rules_fuzzing_init")
+
+rules_fuzzing_init()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/decode_fuzzer.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/decode_fuzzer.c
new file mode 100644
index 0000000000..697f9bf22c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/decode_fuzzer.c
@@ -0,0 +1,63 @@
+// Copyright 2015 The Chromium Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <stddef.h>
+#include <stdint.h>
+#include <stdlib.h>
+
+#include <brotli/decode.h>
+
+// Entry point for LibFuzzer.
+int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
+  size_t addend = 0;
+  if (size > 0)
+    addend = data[size - 1] & 7;
+  const uint8_t* next_in = data;
+
+  const int kBufferSize = 1024;
+  uint8_t* buffer = (uint8_t*) malloc(kBufferSize);
+  if (!buffer) {
+    // OOM is out-of-scope here.
+    return 0;
+  }
+  /* The biggest "magic number" in brotli is 16MiB - 16, so no need to check
+     the cases with much longer output. */
+  const size_t total_out_limit = (addend == 0) ? (1 << 26) : (1 << 24);
+  size_t total_out = 0;
+
+  BrotliDecoderState* state = BrotliDecoderCreateInstance(0, 0, 0);
+  if (!state) {
+    // OOM is out-of-scope here.
+    free(buffer);
+    return 0;
+  }
+
+  if (addend == 0)
+    addend = size;
+  /* Test both fast (addend == size) and slow (addend <= 7) decoding paths. */
+  for (size_t i = 0; i < size;) {
+    size_t next_i = i + addend;
+    if (next_i > size)
+      next_i = size;
+    size_t avail_in = next_i - i;
+    i = next_i;
+    BrotliDecoderResult result = BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT;
+    while (result == BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT) {
+      size_t avail_out = kBufferSize;
+      uint8_t* next_out = buffer;
+      result = BrotliDecoderDecompressStream(
+          state, &avail_in, &next_in, &avail_out, &next_out, &total_out);
+      if (total_out > total_out_limit)
+        break;
+    }
+    if (total_out > total_out_limit)
+      break;
+    if (result != BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT)
+      break;
+  }
+
+  BrotliDecoderDestroyInstance(state);
+  free(buffer);
+  return 0;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/run_decode_fuzzer.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/run_decode_fuzzer.c
new file mode 100644
index 0000000000..c84f98a32b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/run_decode_fuzzer.c
@@ -0,0 +1,44 @@
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Simple runner for decode_fuzzer.cc */
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <stdint.h>
+
+void LLVMFuzzerTestOneInput(const uint8_t* data, size_t size);
+
+int main(int argc, char* *argv) {
+  if (argc != 2) {
+    fprintf(stderr, "Exactly one argument is expected.\n");
+    exit(EXIT_FAILURE);
+  }
+
+  FILE* f = fopen(argv[1], "r");
+  if (!f) {
+    fprintf(stderr, "Failed to open input file.");
+    exit(EXIT_FAILURE);
+  }
+
+  size_t max_len = 1 << 20;
+  unsigned char* tmp = (unsigned char*)malloc(max_len);
+  size_t len = fread(tmp, 1, max_len, f);
+  if (ferror(f)) {
+    fclose(f);
+    fprintf(stderr, "Failed read input file.");
+    exit(EXIT_FAILURE);
+  }
+  /* Make data after the end "inaccessible". */
+  unsigned char* data = (unsigned char*)malloc(len);
+  memcpy(data, tmp, len);
+  free(tmp);
+
+  LLVMFuzzerTestOneInput(data, len);
+  free(data);
+  exit(EXIT_SUCCESS);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/test_fuzzer.sh b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/test_fuzzer.sh
new file mode 100755
index 0000000000..4b99947268
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/fuzz/test_fuzzer.sh
@@ -0,0 +1,33 @@
+#!/usr/bin/env bash
+set -e
+
+export CC=${CC:-cc}
+
+BROTLI="$( cd "$( dirname "${BASH_SOURCE[0]}" )/../.." && pwd )"
+SRC=$BROTLI/c
+
+cd $BROTLI
+
+rm -rf bin
+mkdir bin
+cd bin
+
+cmake $BROTLI -DCMAKE_C_COMPILER="$CC" \
+    -DBUILD_TESTING=OFF -DBUILD_SHARED_LIBS=OFF -DENABLE_SANITIZER=address
+make -j$(nproc) brotlidec
+
+${CC} -o run_decode_fuzzer -std=c99 -fsanitize=address -I$SRC/include \
+    $SRC/fuzz/decode_fuzzer.c $SRC/fuzz/run_decode_fuzzer.c \
+    ./libbrotlidec.a ./libbrotlicommon.a
+
+mkdir decode_corpora
+unzip $BROTLI/java/org/brotli/integration/fuzz_data.zip -d decode_corpora
+
+for f in `ls decode_corpora`
+do
+ echo "Testing $f"
+ ./run_decode_fuzzer decode_corpora/$f
+done
+
+cd $BROTLI
+rm -rf bin
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/decode.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/decode.h
new file mode 100644
index 0000000000..af1aa23f60
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/decode.h
@@ -0,0 +1,409 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/**
+ * @file
+ * API for Brotli decompression.
+ */
+
+#ifndef BROTLI_DEC_DECODE_H_
+#define BROTLI_DEC_DECODE_H_
+
+#include <brotli/port.h>
+#include <brotli/shared_dictionary.h>
+#include <brotli/types.h>
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/**
+ * Opaque structure that holds decoder state.
+ *
+ * Allocated and initialized with ::BrotliDecoderCreateInstance.
+ * Cleaned up and deallocated with ::BrotliDecoderDestroyInstance.
+ */
+typedef struct BrotliDecoderStateStruct BrotliDecoderState;
+
+/**
+ * Result type for ::BrotliDecoderDecompress and
+ * ::BrotliDecoderDecompressStream functions.
+ */
+typedef enum {
+  /** Decoding error, e.g. corrupted input or memory allocation problem. */
+  BROTLI_DECODER_RESULT_ERROR = 0,
+  /** Decoding successfully completed. */
+  BROTLI_DECODER_RESULT_SUCCESS = 1,
+  /** Partially done; should be called again with more input. */
+  BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT = 2,
+  /** Partially done; should be called again with more output. */
+  BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT = 3
+} BrotliDecoderResult;
+
+/**
+ * Template that evaluates items of ::BrotliDecoderErrorCode.
+ *
+ * Example: @code {.cpp}
+ * // Log Brotli error code.
+ * switch (brotliDecoderErrorCode) {
+ * #define CASE_(PREFIX, NAME, CODE) \
+ *   case BROTLI_DECODER ## PREFIX ## NAME: \
+ *     LOG(INFO) << "error code:" << #NAME; \
+ *     break;
+ * #define NEWLINE_
+ * BROTLI_DECODER_ERROR_CODES_LIST(CASE_, NEWLINE_)
+ * #undef CASE_
+ * #undef NEWLINE_
+ *   default: LOG(FATAL) << "unknown brotli error code";
+ * }
+ * @endcode
+ */
+#define BROTLI_DECODER_ERROR_CODES_LIST(BROTLI_ERROR_CODE, SEPARATOR)      \
+  BROTLI_ERROR_CODE(_, NO_ERROR, 0) SEPARATOR                              \
+  /* Same as BrotliDecoderResult values */                                 \
+  BROTLI_ERROR_CODE(_, SUCCESS, 1) SEPARATOR                               \
+  BROTLI_ERROR_CODE(_, NEEDS_MORE_INPUT, 2) SEPARATOR                      \
+  BROTLI_ERROR_CODE(_, NEEDS_MORE_OUTPUT, 3) SEPARATOR                     \
+                                                                           \
+  /* Errors caused by invalid input */                                     \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, EXUBERANT_NIBBLE, -1) SEPARATOR        \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, RESERVED, -2) SEPARATOR                \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, EXUBERANT_META_NIBBLE, -3) SEPARATOR   \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, SIMPLE_HUFFMAN_ALPHABET, -4) SEPARATOR \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, SIMPLE_HUFFMAN_SAME, -5) SEPARATOR     \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, CL_SPACE, -6) SEPARATOR                \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, HUFFMAN_SPACE, -7) SEPARATOR           \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, CONTEXT_MAP_REPEAT, -8) SEPARATOR      \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, BLOCK_LENGTH_1, -9) SEPARATOR          \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, BLOCK_LENGTH_2, -10) SEPARATOR         \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, TRANSFORM, -11) SEPARATOR              \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, DICTIONARY, -12) SEPARATOR             \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, WINDOW_BITS, -13) SEPARATOR            \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, PADDING_1, -14) SEPARATOR              \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, PADDING_2, -15) SEPARATOR              \
+  BROTLI_ERROR_CODE(_ERROR_FORMAT_, DISTANCE, -16) SEPARATOR               \
+                                                                           \
+  /* -17 code is reserved */                                               \
+                                                                           \
+  BROTLI_ERROR_CODE(_ERROR_, COMPOUND_DICTIONARY, -18) SEPARATOR           \
+  BROTLI_ERROR_CODE(_ERROR_, DICTIONARY_NOT_SET, -19) SEPARATOR            \
+  BROTLI_ERROR_CODE(_ERROR_, INVALID_ARGUMENTS, -20) SEPARATOR             \
+                                                                           \
+  /* Memory allocation problems */                                         \
+  BROTLI_ERROR_CODE(_ERROR_ALLOC_, CONTEXT_MODES, -21) SEPARATOR           \
+  /* Literal, insert and distance trees together */                        \
+  BROTLI_ERROR_CODE(_ERROR_ALLOC_, TREE_GROUPS, -22) SEPARATOR             \
+  /* -23..-24 codes are reserved for distinct tree groups */               \
+  BROTLI_ERROR_CODE(_ERROR_ALLOC_, CONTEXT_MAP, -25) SEPARATOR             \
+  BROTLI_ERROR_CODE(_ERROR_ALLOC_, RING_BUFFER_1, -26) SEPARATOR           \
+  BROTLI_ERROR_CODE(_ERROR_ALLOC_, RING_BUFFER_2, -27) SEPARATOR           \
+  /* -28..-29 codes are reserved for dynamic ring-buffer allocation */     \
+  BROTLI_ERROR_CODE(_ERROR_ALLOC_, BLOCK_TYPE_TREES, -30) SEPARATOR        \
+                                                                           \
+  /* "Impossible" states */                                                \
+  BROTLI_ERROR_CODE(_ERROR_, UNREACHABLE, -31)
+
+/**
+ * Error code for detailed logging / production debugging.
+ *
+ * See ::BrotliDecoderGetErrorCode and ::BROTLI_LAST_ERROR_CODE.
+ */
+typedef enum {
+#define BROTLI_COMMA_ ,
+#define BROTLI_ERROR_CODE_ENUM_ITEM_(PREFIX, NAME, CODE) \
+    BROTLI_DECODER ## PREFIX ## NAME = CODE
+  BROTLI_DECODER_ERROR_CODES_LIST(BROTLI_ERROR_CODE_ENUM_ITEM_, BROTLI_COMMA_)
+} BrotliDecoderErrorCode;
+#undef BROTLI_ERROR_CODE_ENUM_ITEM_
+#undef BROTLI_COMMA_
+
+/**
+ * The value of the last error code, negative integer.
+ *
+ * All other error code values are in the range from ::BROTLI_LAST_ERROR_CODE
+ * to @c -1. There are also 4 other possible non-error codes @c 0 .. @c 3 in
+ * ::BrotliDecoderErrorCode enumeration.
+ */
+#define BROTLI_LAST_ERROR_CODE BROTLI_DECODER_ERROR_UNREACHABLE
+
+/** Options to be used with ::BrotliDecoderSetParameter. */
+typedef enum BrotliDecoderParameter {
+  /**
+   * Disable "canny" ring buffer allocation strategy.
+   *
+   * Ring buffer is allocated according to window size, despite the real size of
+   * the content.
+   */
+  BROTLI_DECODER_PARAM_DISABLE_RING_BUFFER_REALLOCATION = 0,
+  /**
+   * Flag that determines if "Large Window Brotli" is used.
+   */
+  BROTLI_DECODER_PARAM_LARGE_WINDOW = 1
+} BrotliDecoderParameter;
+
+/**
+ * Sets the specified parameter to the given decoder instance.
+ *
+ * @param state decoder instance
+ * @param param parameter to set
+ * @param value new parameter value
+ * @returns ::BROTLI_FALSE if parameter is unrecognized, or value is invalid
+ * @returns ::BROTLI_TRUE if value is accepted
+ */
+BROTLI_DEC_API BROTLI_BOOL BrotliDecoderSetParameter(
+    BrotliDecoderState* state, BrotliDecoderParameter param, uint32_t value);
+
+/**
+ * Adds LZ77 prefix dictionary, adds or replaces built-in static dictionary and
+ * transforms.
+ *
+ * Attached dictionary ownership is not transferred.
+ * Data provided to this method should be kept accessible until
+ * decoding is finished and decoder instance is destroyed.
+ *
+ * @note Dictionaries can NOT be attached after actual decoding is started.
+ *
+ * @param state decoder instance
+ * @param type dictionary data format
+ * @param data_size length of memory region pointed by @p data
+ * @param data dictionary data in format corresponding to @p type
+ * @returns ::BROTLI_FALSE if dictionary is corrupted,
+ *          or dictionary count limit is reached
+ * @returns ::BROTLI_TRUE if dictionary is accepted / attached
+ */
+BROTLI_DEC_API BROTLI_BOOL BrotliDecoderAttachDictionary(
+    BrotliDecoderState* state, BrotliSharedDictionaryType type,
+    size_t data_size, const uint8_t data[BROTLI_ARRAY_PARAM(data_size)]);
+
+/**
+ * Creates an instance of ::BrotliDecoderState and initializes it.
+ *
+ * The instance can be used once for decoding and should then be destroyed with
+ * ::BrotliDecoderDestroyInstance, it cannot be reused for a new decoding
+ * session.
+ *
+ * @p alloc_func and @p free_func @b MUST be both zero or both non-zero. In the
+ * case they are both zero, default memory allocators are used. @p opaque is
+ * passed to @p alloc_func and @p free_func when they are called. @p free_func
+ * has to return without doing anything when asked to free a NULL pointer.
+ *
+ * @param alloc_func custom memory allocation function
+ * @param free_func custom memory free function
+ * @param opaque custom memory manager handle
+ * @returns @c 0 if instance can not be allocated or initialized
+ * @returns pointer to initialized ::BrotliDecoderState otherwise
+ */
+BROTLI_DEC_API BrotliDecoderState* BrotliDecoderCreateInstance(
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);
+
+/**
+ * Deinitializes and frees ::BrotliDecoderState instance.
+ *
+ * @param state decoder instance to be cleaned up and deallocated
+ */
+BROTLI_DEC_API void BrotliDecoderDestroyInstance(BrotliDecoderState* state);
+
+/**
+ * Performs one-shot memory-to-memory decompression.
+ *
+ * Decompresses the data in @p encoded_buffer into @p decoded_buffer, and sets
+ * @p *decoded_size to the decompressed length.
+ *
+ * @param encoded_size size of @p encoded_buffer
+ * @param encoded_buffer compressed data buffer with at least @p encoded_size
+ *        addressable bytes
+ * @param[in, out] decoded_size @b in: size of @p decoded_buffer; \n
+ *                 @b out: length of decompressed data written to
+ *                 @p decoded_buffer
+ * @param decoded_buffer decompressed data destination buffer
+ * @returns ::BROTLI_DECODER_RESULT_ERROR if input is corrupted, memory
+ *          allocation failed, or @p decoded_buffer is not large enough;
+ * @returns ::BROTLI_DECODER_RESULT_SUCCESS otherwise
+ */
+BROTLI_DEC_API BrotliDecoderResult BrotliDecoderDecompress(
+    size_t encoded_size,
+    const uint8_t encoded_buffer[BROTLI_ARRAY_PARAM(encoded_size)],
+    size_t* decoded_size,
+    uint8_t decoded_buffer[BROTLI_ARRAY_PARAM(*decoded_size)]);
+
+/**
+ * Decompresses the input stream to the output stream.
+ *
+ * The values @p *available_in and @p *available_out must specify the number of
+ * bytes addressable at @p *next_in and @p *next_out respectively.
+ * When @p *available_out is @c 0, @p next_out is allowed to be @c NULL.
+ *
+ * After each call, @p *available_in will be decremented by the amount of input
+ * bytes consumed, and the @p *next_in pointer will be incremented by that
+ * amount. Similarly, @p *available_out will be decremented by the amount of
+ * output bytes written, and the @p *next_out pointer will be incremented by
+ * that amount.
+ *
+ * @p total_out, if it is not a null-pointer, will be set to the number
+ * of bytes decompressed since the last @p state initialization.
+ *
+ * @note Input is never overconsumed, so @p next_in and @p available_in could be
+ * passed to the next consumer after decoding is complete.
+ *
+ * @param state decoder instance
+ * @param[in, out] available_in @b in: amount of available input; \n
+ *                 @b out: amount of unused input
+ * @param[in, out] next_in pointer to the next compressed byte
+ * @param[in, out] available_out @b in: length of output buffer; \n
+ *                 @b out: remaining size of output buffer
+ * @param[in, out] next_out output buffer cursor;
+ *                 can be @c NULL if @p available_out is @c 0
+ * @param[out] total_out number of bytes decompressed so far; can be @c NULL
+ * @returns ::BROTLI_DECODER_RESULT_ERROR if input is corrupted, memory
+ *          allocation failed, arguments were invalid, etc.;
+ *          use ::BrotliDecoderGetErrorCode to get detailed error code
+ * @returns ::BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT decoding is blocked until
+ *          more input data is provided
+ * @returns ::BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT decoding is blocked until
+ *          more output space is provided
+ * @returns ::BROTLI_DECODER_RESULT_SUCCESS decoding is finished, no more
+ *          input might be consumed and no more output will be produced
+ */
+BROTLI_DEC_API BrotliDecoderResult BrotliDecoderDecompressStream(
+  BrotliDecoderState* state, size_t* available_in, const uint8_t** next_in,
+  size_t* available_out, uint8_t** next_out, size_t* total_out);
+
+/**
+ * Checks if decoder has more output.
+ *
+ * @param state decoder instance
+ * @returns ::BROTLI_TRUE, if decoder has some unconsumed output
+ * @returns ::BROTLI_FALSE otherwise
+ */
+BROTLI_DEC_API BROTLI_BOOL BrotliDecoderHasMoreOutput(
+    const BrotliDecoderState* state);
+
+/**
+ * Acquires pointer to internal output buffer.
+ *
+ * This method is used to make language bindings easier and more efficient:
+ *  -# push data to ::BrotliDecoderDecompressStream,
+ *     until ::BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT is reported
+ *  -# use ::BrotliDecoderTakeOutput to peek bytes and copy to language-specific
+ *     entity
+ *
+ * Also this could be useful if there is an output stream that is able to
+ * consume all the provided data (e.g. when data is saved to file system).
+ *
+ * @attention After every call to ::BrotliDecoderTakeOutput @p *size bytes of
+ *            output are considered consumed for all consecutive calls to the
+ *            instance methods; returned pointer becomes invalidated as well.
+ *
+ * @note Decoder output is not guaranteed to be contiguous. This means that
+ *       after the size-unrestricted call to ::BrotliDecoderTakeOutput,
+ *       immediate next call to ::BrotliDecoderTakeOutput may return more data.
+ *
+ * @param state decoder instance
+ * @param[in, out] size @b in: number of bytes caller is ready to take, @c 0 if
+ *                 any amount could be handled; \n
+ *                 @b out: amount of data pointed by returned pointer and
+ *                 considered consumed; \n
+ *                 out value is never greater than in value, unless it is @c 0
+ * @returns pointer to output data
+ */
+BROTLI_DEC_API const uint8_t* BrotliDecoderTakeOutput(
+    BrotliDecoderState* state, size_t* size);
+
+/**
+ * Checks if instance has already consumed input.
+ *
+ * Instance that returns ::BROTLI_FALSE is considered "fresh" and could be
+ * reused.
+ *
+ * @param state decoder instance
+ * @returns ::BROTLI_TRUE if decoder has already used some input bytes
+ * @returns ::BROTLI_FALSE otherwise
+ */
+BROTLI_DEC_API BROTLI_BOOL BrotliDecoderIsUsed(const BrotliDecoderState* state);
+
+/**
+ * Checks if decoder instance reached the final state.
+ *
+ * @param state decoder instance
+ * @returns ::BROTLI_TRUE if decoder is in a state where it reached the end of
+ *          the input and produced all of the output
+ * @returns ::BROTLI_FALSE otherwise
+ */
+BROTLI_DEC_API BROTLI_BOOL BrotliDecoderIsFinished(
+    const BrotliDecoderState* state);
+
+/**
+ * Acquires a detailed error code.
+ *
+ * Should be used only after ::BrotliDecoderDecompressStream returns
+ * ::BROTLI_DECODER_RESULT_ERROR.
+ *
+ * See also ::BrotliDecoderErrorString
+ *
+ * @param state decoder instance
+ * @returns last saved error code
+ */
+BROTLI_DEC_API BrotliDecoderErrorCode BrotliDecoderGetErrorCode(
+    const BrotliDecoderState* state);
+
+/**
+ * Converts error code to a c-string.
+ */
+BROTLI_DEC_API const char* BrotliDecoderErrorString(BrotliDecoderErrorCode c);
+
+/**
+ * Gets a decoder library version.
+ *
+ * Look at BROTLI_MAKE_HEX_VERSION for more information.
+ */
+BROTLI_DEC_API uint32_t BrotliDecoderVersion(void);
+
+/**
+ * Callback to fire on metadata block start.
+ *
+ * After this callback is fired, if @p size is not @c 0, it is followed by
+ * ::brotli_decoder_metadata_chunk_func as more metadata block contents become
+ * accessible.
+ *
+ * @param opaque callback handle
+ * @param size size of metadata block
+ */
+typedef void (*brotli_decoder_metadata_start_func)(void* opaque, size_t size);
+
+/**
+ * Callback to fire on metadata block chunk becomes available.
+ *
+ * This function can be invoked multiple times per metadata block; block should
+ * be considered finished when sum of @p size matches the announced metadata
+ * block size. Chunks contents pointed by @p data are transient and shouln not
+ * be accessed after leaving the callback.
+ *
+ * @param opaque callback handle
+ * @param data pointer to metadata contents
+ * @param size size of metadata block chunk, at least @c 1
+ */
+typedef void (*brotli_decoder_metadata_chunk_func)(void* opaque,
+                                                   const uint8_t* data,
+                                                   size_t size);
+
+/**
+ * Sets callback for receiving metadata blocks.
+ *
+ * @param state decoder instance
+ * @param start_func callback on metadata block start
+ * @param chunk_func callback on metadata block chunk
+ * @param opaque callback handle
+ */
+BROTLI_DEC_API void BrotliDecoderSetMetadataCallbacks(
+    BrotliDecoderState* state,
+    brotli_decoder_metadata_start_func start_func,
+    brotli_decoder_metadata_chunk_func chunk_func, void* opaque);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+} /* extern "C" */
+#endif
+
+#endif  /* BROTLI_DEC_DECODE_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/encode.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/encode.h
new file mode 100644
index 0000000000..dea9931ebb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/encode.h
@@ -0,0 +1,501 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/**
+ * @file
+ * API for Brotli compression.
+ */
+
+#ifndef BROTLI_ENC_ENCODE_H_
+#define BROTLI_ENC_ENCODE_H_
+
+#include <brotli/port.h>
+#include <brotli/shared_dictionary.h>
+#include <brotli/types.h>
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/** Minimal value for ::BROTLI_PARAM_LGWIN parameter. */
+#define BROTLI_MIN_WINDOW_BITS 10
+/**
+ * Maximal value for ::BROTLI_PARAM_LGWIN parameter.
+ *
+ * @note equal to @c BROTLI_MAX_DISTANCE_BITS constant.
+ */
+#define BROTLI_MAX_WINDOW_BITS 24
+/**
+ * Maximal value for ::BROTLI_PARAM_LGWIN parameter
+ * in "Large Window Brotli" (32-bit).
+ */
+#define BROTLI_LARGE_MAX_WINDOW_BITS 30
+/** Minimal value for ::BROTLI_PARAM_LGBLOCK parameter. */
+#define BROTLI_MIN_INPUT_BLOCK_BITS 16
+/** Maximal value for ::BROTLI_PARAM_LGBLOCK parameter. */
+#define BROTLI_MAX_INPUT_BLOCK_BITS 24
+/** Minimal value for ::BROTLI_PARAM_QUALITY parameter. */
+#define BROTLI_MIN_QUALITY 0
+/** Maximal value for ::BROTLI_PARAM_QUALITY parameter. */
+#define BROTLI_MAX_QUALITY 11
+
+/** Options for ::BROTLI_PARAM_MODE parameter. */
+typedef enum BrotliEncoderMode {
+  /**
+   * Default compression mode.
+   *
+   * In this mode compressor does not know anything in advance about the
+   * properties of the input.
+   */
+  BROTLI_MODE_GENERIC = 0,
+  /** Compression mode for UTF-8 formatted text input. */
+  BROTLI_MODE_TEXT = 1,
+  /** Compression mode used in WOFF 2.0. */
+  BROTLI_MODE_FONT = 2
+} BrotliEncoderMode;
+
+/** Default value for ::BROTLI_PARAM_QUALITY parameter. */
+#define BROTLI_DEFAULT_QUALITY 11
+/** Default value for ::BROTLI_PARAM_LGWIN parameter. */
+#define BROTLI_DEFAULT_WINDOW 22
+/** Default value for ::BROTLI_PARAM_MODE parameter. */
+#define BROTLI_DEFAULT_MODE BROTLI_MODE_GENERIC
+
+/** Operations that can be performed by streaming encoder. */
+typedef enum BrotliEncoderOperation {
+  /**
+   * Process input.
+   *
+   * Encoder may postpone producing output, until it has processed enough input.
+   */
+  BROTLI_OPERATION_PROCESS = 0,
+  /**
+   * Produce output for all processed input.
+   *
+   * Actual flush is performed when input stream is depleted and there is enough
+   * space in output stream. This means that client should repeat
+   * ::BROTLI_OPERATION_FLUSH operation until @p available_in becomes @c 0, and
+   * ::BrotliEncoderHasMoreOutput returns ::BROTLI_FALSE. If output is acquired
+   * via ::BrotliEncoderTakeOutput, then operation should be repeated after
+   * output buffer is drained.
+   *
+   * @warning Until flush is complete, client @b SHOULD @b NOT swap,
+   *          reduce or extend input stream.
+   *
+   * When flush is complete, output data will be sufficient for decoder to
+   * reproduce all the given input.
+   */
+  BROTLI_OPERATION_FLUSH = 1,
+  /**
+   * Finalize the stream.
+   *
+   * Actual finalization is performed when input stream is depleted and there is
+   * enough space in output stream. This means that client should repeat
+   * ::BROTLI_OPERATION_FINISH operation until @p available_in becomes @c 0, and
+   * ::BrotliEncoderHasMoreOutput returns ::BROTLI_FALSE. If output is acquired
+   * via ::BrotliEncoderTakeOutput, then operation should be repeated after
+   * output buffer is drained.
+   *
+   * @warning Until finalization is complete, client @b SHOULD @b NOT swap,
+   *          reduce or extend input stream.
+   *
+   * Helper function ::BrotliEncoderIsFinished checks if stream is finalized and
+   * output fully dumped.
+   *
+   * Adding more input data to finalized stream is impossible.
+   */
+  BROTLI_OPERATION_FINISH = 2,
+  /**
+   * Emit metadata block to stream.
+   *
+   * Metadata is opaque to Brotli: neither encoder, nor decoder processes this
+   * data or relies on it. It may be used to pass some extra information from
+   * encoder client to decoder client without interfering with main data stream.
+   *
+   * @note Encoder may emit empty metadata blocks internally, to pad encoded
+   *       stream to byte boundary.
+   *
+   * @warning Until emitting metadata is complete client @b SHOULD @b NOT swap,
+   *          reduce or extend input stream.
+   *
+   * @warning The whole content of input buffer is considered to be the content
+   *          of metadata block. Do @b NOT @e append metadata to input stream,
+   *          before it is depleted with other operations.
+   *
+   * Stream is soft-flushed before metadata block is emitted. Metadata block
+   * @b MUST be no longer than than 16MiB.
+   */
+  BROTLI_OPERATION_EMIT_METADATA = 3
+} BrotliEncoderOperation;
+
+/** Options to be used with ::BrotliEncoderSetParameter. */
+typedef enum BrotliEncoderParameter {
+  /**
+   * Tune encoder for specific input.
+   *
+   * ::BrotliEncoderMode enumerates all available values.
+   */
+  BROTLI_PARAM_MODE = 0,
+  /**
+   * The main compression speed-density lever.
+   *
+   * The higher the quality, the slower the compression. Range is
+   * from ::BROTLI_MIN_QUALITY to ::BROTLI_MAX_QUALITY.
+   */
+  BROTLI_PARAM_QUALITY = 1,
+  /**
+   * Recommended sliding LZ77 window size.
+   *
+   * Encoder may reduce this value, e.g. if input is much smaller than
+   * window size.
+   *
+   * Window size is `(1 << value) - 16`.
+   *
+   * Range is from ::BROTLI_MIN_WINDOW_BITS to ::BROTLI_MAX_WINDOW_BITS.
+   */
+  BROTLI_PARAM_LGWIN = 2,
+  /**
+   * Recommended input block size.
+   *
+   * Encoder may reduce this value, e.g. if input is much smaller than input
+   * block size.
+   *
+   * Range is from ::BROTLI_MIN_INPUT_BLOCK_BITS to
+   * ::BROTLI_MAX_INPUT_BLOCK_BITS.
+   *
+   * @note Bigger input block size allows better compression, but consumes more
+   *       memory. \n The rough formula of memory used for temporary input
+   *       storage is `3 << lgBlock`.
+   */
+  BROTLI_PARAM_LGBLOCK = 3,
+  /**
+   * Flag that affects usage of "literal context modeling" format feature.
+   *
+   * This flag is a "decoding-speed vs compression ratio" trade-off.
+   */
+  BROTLI_PARAM_DISABLE_LITERAL_CONTEXT_MODELING = 4,
+  /**
+   * Estimated total input size for all ::BrotliEncoderCompressStream calls.
+   *
+   * The default value is 0, which means that the total input size is unknown.
+   */
+  BROTLI_PARAM_SIZE_HINT = 5,
+  /**
+   * Flag that determines if "Large Window Brotli" is used.
+   */
+  BROTLI_PARAM_LARGE_WINDOW = 6,
+  /**
+   * Recommended number of postfix bits (NPOSTFIX).
+   *
+   * Encoder may change this value.
+   *
+   * Range is from 0 to ::BROTLI_MAX_NPOSTFIX.
+   */
+  BROTLI_PARAM_NPOSTFIX = 7,
+  /**
+   * Recommended number of direct distance codes (NDIRECT).
+   *
+   * Encoder may change this value.
+   *
+   * Range is from 0 to (15 << NPOSTFIX) in steps of (1 << NPOSTFIX).
+   */
+  BROTLI_PARAM_NDIRECT = 8,
+  /**
+   * Number of bytes of input stream already processed by a different instance.
+   *
+   * @note It is important to configure all the encoder instances with same
+   *       parameters (except this one) in order to allow all the encoded parts
+   *       obey the same restrictions implied by header.
+   *
+   * If offset is not 0, then stream header is omitted.
+   * In any case output start is byte aligned, so for proper streams stitching
+   * "predecessor" stream must be flushed.
+   *
+   * Range is not artificially limited, but all the values greater or equal to
+   * maximal window size have the same effect. Values greater than 2**30 are not
+   * allowed.
+   */
+  BROTLI_PARAM_STREAM_OFFSET = 9
+} BrotliEncoderParameter;
+
+/**
+ * Opaque structure that holds encoder state.
+ *
+ * Allocated and initialized with ::BrotliEncoderCreateInstance.
+ * Cleaned up and deallocated with ::BrotliEncoderDestroyInstance.
+ */
+typedef struct BrotliEncoderStateStruct BrotliEncoderState;
+
+/**
+ * Sets the specified parameter to the given encoder instance.
+ *
+ * @param state encoder instance
+ * @param param parameter to set
+ * @param value new parameter value
+ * @returns ::BROTLI_FALSE if parameter is unrecognized, or value is invalid
+ * @returns ::BROTLI_FALSE if value of parameter can not be changed at current
+ *          encoder state (e.g. when encoding is started, window size might be
+ *          already encoded and therefore it is impossible to change it)
+ * @returns ::BROTLI_TRUE if value is accepted
+ * @warning invalid values might be accepted in case they would not break
+ *          encoding process.
+ */
+BROTLI_ENC_API BROTLI_BOOL BrotliEncoderSetParameter(
+    BrotliEncoderState* state, BrotliEncoderParameter param, uint32_t value);
+
+/**
+ * Creates an instance of ::BrotliEncoderState and initializes it.
+ *
+ * @p alloc_func and @p free_func @b MUST be both zero or both non-zero. In the
+ * case they are both zero, default memory allocators are used. @p opaque is
+ * passed to @p alloc_func and @p free_func when they are called. @p free_func
+ * has to return without doing anything when asked to free a NULL pointer.
+ *
+ * @param alloc_func custom memory allocation function
+ * @param free_func custom memory free function
+ * @param opaque custom memory manager handle
+ * @returns @c 0 if instance can not be allocated or initialized
+ * @returns pointer to initialized ::BrotliEncoderState otherwise
+ */
+BROTLI_ENC_API BrotliEncoderState* BrotliEncoderCreateInstance(
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);
+
+/**
+ * Deinitializes and frees ::BrotliEncoderState instance.
+ *
+ * @param state decoder instance to be cleaned up and deallocated
+ */
+BROTLI_ENC_API void BrotliEncoderDestroyInstance(BrotliEncoderState* state);
+
+/* Opaque type for pointer to different possible internal structures containing
+   dictionary prepared for the encoder */
+typedef struct BrotliEncoderPreparedDictionaryStruct
+    BrotliEncoderPreparedDictionary;
+
+/**
+ * Prepares a shared dictionary from the given file format for the encoder.
+ *
+ * @p alloc_func and @p free_func @b MUST be both zero or both non-zero. In the
+ * case they are both zero, default memory allocators are used. @p opaque is
+ * passed to @p alloc_func and @p free_func when they are called. @p free_func
+ * has to return without doing anything when asked to free a NULL pointer.
+ *
+ * @param type type of dictionary stored in data
+ * @param data_size size of @p data buffer
+ * @param data pointer to the dictionary data
+ * @param quality the maximum Brotli quality to prepare the dictionary for,
+ *        use BROTLI_MAX_QUALITY by default
+ * @param alloc_func custom memory allocation function
+ * @param free_func custom memory free function
+ * @param opaque custom memory manager handle
+ */
+BROTLI_ENC_API BrotliEncoderPreparedDictionary*
+BrotliEncoderPrepareDictionary(BrotliSharedDictionaryType type,
+    size_t data_size, const uint8_t data[BROTLI_ARRAY_PARAM(data_size)],
+    int quality,
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);
+
+BROTLI_ENC_API void BrotliEncoderDestroyPreparedDictionary(
+    BrotliEncoderPreparedDictionary* dictionary);
+
+/**
+ * Attaches a prepared dictionary of any type to the encoder. Can be used
+ * multiple times to attach multiple dictionaries. The dictionary type was
+ * determined by BrotliEncoderPrepareDictionary. Multiple raw prefix
+ * dictionaries and/or max 1 serialized dictionary with custom words can be
+ * attached.
+ *
+ * @returns ::BROTLI_FALSE in case of error
+ * @returns ::BROTLI_TRUE otherwise
+ */
+BROTLI_ENC_API BROTLI_BOOL BrotliEncoderAttachPreparedDictionary(
+    BrotliEncoderState* state,
+    const BrotliEncoderPreparedDictionary* dictionary);
+
+/**
+ * Calculates the output size bound for the given @p input_size.
+ *
+ * @warning Result is only valid if quality is at least @c 2 and, in
+ *          case ::BrotliEncoderCompressStream was used, no flushes
+ *          (::BROTLI_OPERATION_FLUSH) were performed.
+ *
+ * @param input_size size of projected input
+ * @returns @c 0 if result does not fit @c size_t
+ */
+BROTLI_ENC_API size_t BrotliEncoderMaxCompressedSize(size_t input_size);
+
+/**
+ * Performs one-shot memory-to-memory compression.
+ *
+ * Compresses the data in @p input_buffer into @p encoded_buffer, and sets
+ * @p *encoded_size to the compressed length.
+ *
+ * @note If ::BrotliEncoderMaxCompressedSize(@p input_size) returns non-zero
+ *       value, then output is guaranteed to be no longer than that.
+ *
+ * @note If @p lgwin is greater than ::BROTLI_MAX_WINDOW_BITS then resulting
+ *       stream might be incompatible with RFC 7932; to decode such streams,
+ *       decoder should be configured with
+ *       ::BROTLI_DECODER_PARAM_LARGE_WINDOW = @c 1
+ *
+ * @param quality quality parameter value, e.g. ::BROTLI_DEFAULT_QUALITY
+ * @param lgwin lgwin parameter value, e.g. ::BROTLI_DEFAULT_WINDOW
+ * @param mode mode parameter value, e.g. ::BROTLI_DEFAULT_MODE
+ * @param input_size size of @p input_buffer
+ * @param input_buffer input data buffer with at least @p input_size
+ *        addressable bytes
+ * @param[in, out] encoded_size @b in: size of @p encoded_buffer; \n
+ *                 @b out: length of compressed data written to
+ *                 @p encoded_buffer, or @c 0 if compression fails
+ * @param encoded_buffer compressed data destination buffer
+ * @returns ::BROTLI_FALSE in case of compression error
+ * @returns ::BROTLI_FALSE if output buffer is too small
+ * @returns ::BROTLI_TRUE otherwise
+ */
+BROTLI_ENC_API BROTLI_BOOL BrotliEncoderCompress(
+    int quality, int lgwin, BrotliEncoderMode mode, size_t input_size,
+    const uint8_t input_buffer[BROTLI_ARRAY_PARAM(input_size)],
+    size_t* encoded_size,
+    uint8_t encoded_buffer[BROTLI_ARRAY_PARAM(*encoded_size)]);
+
+/**
+ * Compresses input stream to output stream.
+ *
+ * The values @p *available_in and @p *available_out must specify the number of
+ * bytes addressable at @p *next_in and @p *next_out respectively.
+ * When @p *available_out is @c 0, @p next_out is allowed to be @c NULL.
+ *
+ * After each call, @p *available_in will be decremented by the amount of input
+ * bytes consumed, and the @p *next_in pointer will be incremented by that
+ * amount. Similarly, @p *available_out will be decremented by the amount of
+ * output bytes written, and the @p *next_out pointer will be incremented by
+ * that amount.
+ *
+ * @p total_out, if it is not a null-pointer, will be set to the number
+ * of bytes compressed since the last @p state initialization.
+ *
+ *
+ *
+ * Internally workflow consists of 3 tasks:
+ *  -# (optionally) copy input data to internal buffer
+ *  -# actually compress data and (optionally) store it to internal buffer
+ *  -# (optionally) copy compressed bytes from internal buffer to output stream
+ *
+ * Whenever all 3 tasks can't move forward anymore, or error occurs, this
+ * method returns the control flow to caller.
+ *
+ * @p op is used to perform flush, finish the stream, or inject metadata block.
+ * See ::BrotliEncoderOperation for more information.
+ *
+ * Flushing the stream means forcing encoding of all input passed to encoder and
+ * completing the current output block, so it could be fully decoded by stream
+ * decoder. To perform flush set @p op to ::BROTLI_OPERATION_FLUSH.
+ * Under some circumstances (e.g. lack of output stream capacity) this operation
+ * would require several calls to ::BrotliEncoderCompressStream. The method must
+ * be called again until both input stream is depleted and encoder has no more
+ * output (see ::BrotliEncoderHasMoreOutput) after the method is called.
+ *
+ * Finishing the stream means encoding of all input passed to encoder and
+ * adding specific "final" marks, so stream decoder could determine that stream
+ * is complete. To perform finish set @p op to ::BROTLI_OPERATION_FINISH.
+ * Under some circumstances (e.g. lack of output stream capacity) this operation
+ * would require several calls to ::BrotliEncoderCompressStream. The method must
+ * be called again until both input stream is depleted and encoder has no more
+ * output (see ::BrotliEncoderHasMoreOutput) after the method is called.
+ *
+ * @warning When flushing and finishing, @p op should not change until operation
+ *          is complete; input stream should not be swapped, reduced or
+ *          extended as well.
+ *
+ * @param state encoder instance
+ * @param op requested operation
+ * @param[in, out] available_in @b in: amount of available input; \n
+ *                 @b out: amount of unused input
+ * @param[in, out] next_in pointer to the next input byte
+ * @param[in, out] available_out @b in: length of output buffer; \n
+ *                 @b out: remaining size of output buffer
+ * @param[in, out] next_out compressed output buffer cursor;
+ *                 can be @c NULL if @p available_out is @c 0
+ * @param[out] total_out number of bytes produced so far; can be @c NULL
+ * @returns ::BROTLI_FALSE if there was an error
+ * @returns ::BROTLI_TRUE otherwise
+ */
+BROTLI_ENC_API BROTLI_BOOL BrotliEncoderCompressStream(
+    BrotliEncoderState* state, BrotliEncoderOperation op, size_t* available_in,
+    const uint8_t** next_in, size_t* available_out, uint8_t** next_out,
+    size_t* total_out);
+
+/**
+ * Checks if encoder instance reached the final state.
+ *
+ * @param state encoder instance
+ * @returns ::BROTLI_TRUE if encoder is in a state where it reached the end of
+ *          the input and produced all of the output
+ * @returns ::BROTLI_FALSE otherwise
+ */
+BROTLI_ENC_API BROTLI_BOOL BrotliEncoderIsFinished(BrotliEncoderState* state);
+
+/**
+ * Checks if encoder has more output.
+ *
+ * @param state encoder instance
+ * @returns ::BROTLI_TRUE, if encoder has some unconsumed output
+ * @returns ::BROTLI_FALSE otherwise
+ */
+BROTLI_ENC_API BROTLI_BOOL BrotliEncoderHasMoreOutput(
+    BrotliEncoderState* state);
+
+/**
+ * Acquires pointer to internal output buffer.
+ *
+ * This method is used to make language bindings easier and more efficient:
+ *  -# push data to ::BrotliEncoderCompressStream,
+ *     until ::BrotliEncoderHasMoreOutput returns BROTLI_TRUE
+ *  -# use ::BrotliEncoderTakeOutput to peek bytes and copy to language-specific
+ *     entity
+ *
+ * Also this could be useful if there is an output stream that is able to
+ * consume all the provided data (e.g. when data is saved to file system).
+ *
+ * @attention After every call to ::BrotliEncoderTakeOutput @p *size bytes of
+ *            output are considered consumed for all consecutive calls to the
+ *            instance methods; returned pointer becomes invalidated as well.
+ *
+ * @note Encoder output is not guaranteed to be contiguous. This means that
+ *       after the size-unrestricted call to ::BrotliEncoderTakeOutput,
+ *       immediate next call to ::BrotliEncoderTakeOutput may return more data.
+ *
+ * @param state encoder instance
+ * @param[in, out] size @b in: number of bytes caller is ready to take, @c 0 if
+ *                 any amount could be handled; \n
+ *                 @b out: amount of data pointed by returned pointer and
+ *                 considered consumed; \n
+ *                 out value is never greater than in value, unless it is @c 0
+ * @returns pointer to output data
+ */
+BROTLI_ENC_API const uint8_t* BrotliEncoderTakeOutput(
+    BrotliEncoderState* state, size_t* size);
+
+/* Returns the estimated peak memory usage (in bytes) of the BrotliCompress()
+   function, not counting the memory needed for the input and output. */
+BROTLI_ENC_EXTRA_API size_t BrotliEncoderEstimatePeakMemoryUsage(
+    int quality, int lgwin, size_t input_size);
+/* Returns 0 if dictionary is not valid; otherwise returns allocation size. */
+BROTLI_ENC_EXTRA_API size_t BrotliEncoderGetPreparedDictionarySize(
+    const BrotliEncoderPreparedDictionary* dictionary);
+
+/**
+ * Gets an encoder library version.
+ *
+ * Look at BROTLI_MAKE_HEX_VERSION for more information.
+ */
+BROTLI_ENC_API uint32_t BrotliEncoderVersion(void);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_ENC_ENCODE_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/port.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/port.h
new file mode 100644
index 0000000000..0d50019042
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/port.h
@@ -0,0 +1,305 @@
+/* Copyright 2016 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Macros for compiler / platform specific API declarations. */
+
+#ifndef BROTLI_COMMON_PORT_H_
+#define BROTLI_COMMON_PORT_H_
+
+/* The following macros were borrowed from https://github.com/nemequ/hedley
+ * with permission of original author - Evan Nemerson <evan@nemerson.com> */
+
+/* >>> >>> >>> hedley macros */
+
+#define BROTLI_MAKE_VERSION(major, minor, revision) \
+  (((major) * 1000000) + ((minor) * 1000) + (revision))
+
+#if defined(__GNUC__) && defined(__GNUC_PATCHLEVEL__)
+#define BROTLI_GNUC_VERSION \
+  BROTLI_MAKE_VERSION(__GNUC__, __GNUC_MINOR__, __GNUC_PATCHLEVEL__)
+#elif defined(__GNUC__)
+#define BROTLI_GNUC_VERSION BROTLI_MAKE_VERSION(__GNUC__, __GNUC_MINOR__, 0)
+#endif
+
+#if defined(BROTLI_GNUC_VERSION)
+#define BROTLI_GNUC_VERSION_CHECK(major, minor, patch) \
+  (BROTLI_GNUC_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))
+#else
+#define BROTLI_GNUC_VERSION_CHECK(major, minor, patch) (0)
+#endif
+
+#if defined(_MSC_FULL_VER) && (_MSC_FULL_VER >= 140000000)
+#define BROTLI_MSVC_VERSION                                \
+  BROTLI_MAKE_VERSION((_MSC_FULL_VER / 10000000),          \
+                      (_MSC_FULL_VER % 10000000) / 100000, \
+                      (_MSC_FULL_VER % 100000) / 100)
+#elif defined(_MSC_FULL_VER)
+#define BROTLI_MSVC_VERSION                              \
+  BROTLI_MAKE_VERSION((_MSC_FULL_VER / 1000000),         \
+                      (_MSC_FULL_VER % 1000000) / 10000, \
+                      (_MSC_FULL_VER % 10000) / 10)
+#elif defined(_MSC_VER)
+#define BROTLI_MSVC_VERSION \
+  BROTLI_MAKE_VERSION(_MSC_VER / 100, _MSC_VER % 100, 0)
+#endif
+
+#if !defined(_MSC_VER)
+#define BROTLI_MSVC_VERSION_CHECK(major, minor, patch) (0)
+#elif defined(_MSC_VER) && (_MSC_VER >= 1400)
+#define BROTLI_MSVC_VERSION_CHECK(major, minor, patch) \
+  (_MSC_FULL_VER >= ((major * 10000000) + (minor * 100000) + (patch)))
+#elif defined(_MSC_VER) && (_MSC_VER >= 1200)
+#define BROTLI_MSVC_VERSION_CHECK(major, minor, patch) \
+  (_MSC_FULL_VER >= ((major * 1000000) + (minor * 10000) + (patch)))
+#else
+#define BROTLI_MSVC_VERSION_CHECK(major, minor, patch) \
+  (_MSC_VER >= ((major * 100) + (minor)))
+#endif
+
+#if defined(__INTEL_COMPILER) && defined(__INTEL_COMPILER_UPDATE)
+#define BROTLI_INTEL_VERSION                   \
+  BROTLI_MAKE_VERSION(__INTEL_COMPILER / 100,  \
+                      __INTEL_COMPILER % 100,  \
+                      __INTEL_COMPILER_UPDATE)
+#elif defined(__INTEL_COMPILER)
+#define BROTLI_INTEL_VERSION \
+  BROTLI_MAKE_VERSION(__INTEL_COMPILER / 100, __INTEL_COMPILER % 100, 0)
+#endif
+
+#if defined(BROTLI_INTEL_VERSION)
+#define BROTLI_INTEL_VERSION_CHECK(major, minor, patch) \
+  (BROTLI_INTEL_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))
+#else
+#define BROTLI_INTEL_VERSION_CHECK(major, minor, patch) (0)
+#endif
+
+#if defined(__PGI) && \
+    defined(__PGIC__) && defined(__PGIC_MINOR__) && defined(__PGIC_PATCHLEVEL__)
+#define BROTLI_PGI_VERSION \
+  BROTLI_MAKE_VERSION(__PGIC__, __PGIC_MINOR__, __PGIC_PATCHLEVEL__)
+#endif
+
+#if defined(BROTLI_PGI_VERSION)
+#define BROTLI_PGI_VERSION_CHECK(major, minor, patch) \
+  (BROTLI_PGI_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))
+#else
+#define BROTLI_PGI_VERSION_CHECK(major, minor, patch) (0)
+#endif
+
+#if defined(__SUNPRO_C) && (__SUNPRO_C > 0x1000)
+#define BROTLI_SUNPRO_VERSION                                       \
+  BROTLI_MAKE_VERSION(                                              \
+    (((__SUNPRO_C >> 16) & 0xf) * 10) + ((__SUNPRO_C >> 12) & 0xf), \
+    (((__SUNPRO_C >> 8) & 0xf) * 10) + ((__SUNPRO_C >> 4) & 0xf),   \
+    (__SUNPRO_C & 0xf) * 10)
+#elif defined(__SUNPRO_C)
+#define BROTLI_SUNPRO_VERSION                  \
+  BROTLI_MAKE_VERSION((__SUNPRO_C >> 8) & 0xf, \
+                      (__SUNPRO_C >> 4) & 0xf, \
+                      (__SUNPRO_C) & 0xf)
+#elif defined(__SUNPRO_CC) && (__SUNPRO_CC > 0x1000)
+#define BROTLI_SUNPRO_VERSION                                         \
+  BROTLI_MAKE_VERSION(                                                \
+    (((__SUNPRO_CC >> 16) & 0xf) * 10) + ((__SUNPRO_CC >> 12) & 0xf), \
+    (((__SUNPRO_CC >> 8) & 0xf) * 10) + ((__SUNPRO_CC >> 4) & 0xf),   \
+    (__SUNPRO_CC & 0xf) * 10)
+#elif defined(__SUNPRO_CC)
+#define BROTLI_SUNPRO_VERSION                   \
+  BROTLI_MAKE_VERSION((__SUNPRO_CC >> 8) & 0xf, \
+                      (__SUNPRO_CC >> 4) & 0xf, \
+                      (__SUNPRO_CC) & 0xf)
+#endif
+
+#if defined(BROTLI_SUNPRO_VERSION)
+#define BROTLI_SUNPRO_VERSION_CHECK(major, minor, patch) \
+  (BROTLI_SUNPRO_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))
+#else
+#define BROTLI_SUNPRO_VERSION_CHECK(major, minor, patch) (0)
+#endif
+
+#if defined(__CC_ARM) && defined(__ARMCOMPILER_VERSION)
+#define BROTLI_ARM_VERSION                                       \
+  BROTLI_MAKE_VERSION((__ARMCOMPILER_VERSION / 1000000),         \
+                      (__ARMCOMPILER_VERSION % 1000000) / 10000, \
+                      (__ARMCOMPILER_VERSION % 10000) / 100)
+#elif defined(__CC_ARM) && defined(__ARMCC_VERSION)
+#define BROTLI_ARM_VERSION                                 \
+  BROTLI_MAKE_VERSION((__ARMCC_VERSION / 1000000),         \
+                      (__ARMCC_VERSION % 1000000) / 10000, \
+                      (__ARMCC_VERSION % 10000) / 100)
+#endif
+
+#if defined(BROTLI_ARM_VERSION)
+#define BROTLI_ARM_VERSION_CHECK(major, minor, patch) \
+  (BROTLI_ARM_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))
+#else
+#define BROTLI_ARM_VERSION_CHECK(major, minor, patch) (0)
+#endif
+
+#if defined(__ibmxl__)
+#define BROTLI_IBM_VERSION                    \
+  BROTLI_MAKE_VERSION(__ibmxl_version__,      \
+                      __ibmxl_release__,      \
+                      __ibmxl_modification__)
+#elif defined(__xlC__) && defined(__xlC_ver__)
+#define BROTLI_IBM_VERSION \
+  BROTLI_MAKE_VERSION(__xlC__ >> 8, __xlC__ & 0xff, (__xlC_ver__ >> 8) & 0xff)
+#elif defined(__xlC__)
+#define BROTLI_IBM_VERSION BROTLI_MAKE_VERSION(__xlC__ >> 8, __xlC__ & 0xff, 0)
+#endif
+
+#if defined(BROTLI_IBM_VERSION)
+#define BROTLI_IBM_VERSION_CHECK(major, minor, patch) \
+  (BROTLI_IBM_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))
+#else
+#define BROTLI_IBM_VERSION_CHECK(major, minor, patch) (0)
+#endif
+
+#if defined(__TI_COMPILER_VERSION__)
+#define BROTLI_TI_VERSION                                         \
+  BROTLI_MAKE_VERSION((__TI_COMPILER_VERSION__ / 1000000),        \
+                      (__TI_COMPILER_VERSION__ % 1000000) / 1000, \
+                      (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(BROTLI_TI_VERSION)
+#define BROTLI_TI_VERSION_CHECK(major, minor, patch) \
+  (BROTLI_TI_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))
+#else
+#define BROTLI_TI_VERSION_CHECK(major, minor, patch) (0)
+#endif
+
+#if defined(__IAR_SYSTEMS_ICC__)
+#if __VER__ > 1000
+#define BROTLI_IAR_VERSION                     \
+  BROTLI_MAKE_VERSION((__VER__ / 1000000),     \
+                      (__VER__ / 1000) % 1000, \
+                      (__VER__ % 1000))
+#else
+#define BROTLI_IAR_VERSION BROTLI_MAKE_VERSION(VER / 100, __VER__ % 100, 0)
+#endif
+#endif
+
+#if defined(BROTLI_IAR_VERSION)
+#define BROTLI_IAR_VERSION_CHECK(major, minor, patch) \
+  (BROTLI_IAR_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))
+#else
+#define BROTLI_IAR_VERSION_CHECK(major, minor, patch) (0)
+#endif
+
+#if defined(__TINYC__)
+#define BROTLI_TINYC_VERSION \
+  BROTLI_MAKE_VERSION(__TINYC__ / 1000, (__TINYC__ / 100) % 10, __TINYC__ % 100)
+#endif
+
+#if defined(BROTLI_TINYC_VERSION)
+#define BROTLI_TINYC_VERSION_CHECK(major, minor, patch) \
+  (BROTLI_TINYC_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))
+#else
+#define BROTLI_TINYC_VERSION_CHECK(major, minor, patch) (0)
+#endif
+
+#if defined(__has_attribute)
+#define BROTLI_GNUC_HAS_ATTRIBUTE(attribute, major, minor, patch) \
+  __has_attribute(attribute)
+#else
+#define BROTLI_GNUC_HAS_ATTRIBUTE(attribute, major, minor, patch) \
+  BROTLI_GNUC_VERSION_CHECK(major, minor, patch)
+#endif
+
+#if defined(__has_builtin)
+#define BROTLI_GNUC_HAS_BUILTIN(builtin, major, minor, patch) \
+  __has_builtin(builtin)
+#else
+#define BROTLI_GNUC_HAS_BUILTIN(builtin, major, minor, patch) \
+  BROTLI_GNUC_VERSION_CHECK(major, minor, patch)
+#endif
+
+#if defined(__has_feature)
+#define BROTLI_HAS_FEATURE(feature) __has_feature(feature)
+#else
+#define BROTLI_HAS_FEATURE(feature) (0)
+#endif
+
+#if defined(_WIN32) || defined(__CYGWIN__)
+#define BROTLI_PUBLIC
+#elif BROTLI_GNUC_VERSION_CHECK(3, 3, 0) ||                         \
+    BROTLI_TI_VERSION_CHECK(8, 0, 0) ||                             \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0) ||                         \
+    BROTLI_ARM_VERSION_CHECK(4, 1, 0) ||                            \
+    BROTLI_IBM_VERSION_CHECK(13, 1, 0) ||                           \
+    BROTLI_SUNPRO_VERSION_CHECK(5, 11, 0) ||                        \
+    (BROTLI_TI_VERSION_CHECK(7, 3, 0) &&                            \
+     defined(__TI_GNU_ATTRIBUTE_SUPPORT__) && defined(__TI_EABI__))
+#define BROTLI_PUBLIC __attribute__ ((visibility ("default")))
+#else
+#define BROTLI_PUBLIC
+#endif
+
+/* BROTLI_INTERNAL could be defined to override visibility, e.g. for tests. */
+#if !defined(BROTLI_INTERNAL)
+#if defined(_WIN32) || defined(__CYGWIN__)
+#define BROTLI_INTERNAL
+#elif BROTLI_GNUC_VERSION_CHECK(3, 3, 0) ||                         \
+    BROTLI_TI_VERSION_CHECK(8, 0, 0) ||                             \
+    BROTLI_INTEL_VERSION_CHECK(16, 0, 0) ||                         \
+    BROTLI_ARM_VERSION_CHECK(4, 1, 0) ||                            \
+    BROTLI_IBM_VERSION_CHECK(13, 1, 0) ||                           \
+    BROTLI_SUNPRO_VERSION_CHECK(5, 11, 0) ||                        \
+    (BROTLI_TI_VERSION_CHECK(7, 3, 0) &&                            \
+     defined(__TI_GNU_ATTRIBUTE_SUPPORT__) && defined(__TI_EABI__))
+#define BROTLI_INTERNAL __attribute__ ((visibility ("hidden")))
+#else
+#define BROTLI_INTERNAL
+#endif
+#endif
+
+#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) &&   \
+    !defined(__STDC_NO_VLA__) && !defined(__cplusplus) &&           \
+    !defined(__PGI) && !defined(__PGIC__) && !defined(__TINYC__) && \
+    !defined(__clang__)
+#define BROTLI_ARRAY_PARAM(name) (name)
+#else
+#define BROTLI_ARRAY_PARAM(name)
+#endif
+
+/* <<< <<< <<< end of hedley macros. */
+
+#if defined(BROTLI_SHARED_COMPILATION)
+#if defined(_WIN32)
+#if defined(BROTLICOMMON_SHARED_COMPILATION)
+#define BROTLI_COMMON_API __declspec(dllexport)
+#else
+#define BROTLI_COMMON_API __declspec(dllimport)
+#endif  /* BROTLICOMMON_SHARED_COMPILATION */
+#if defined(BROTLIDEC_SHARED_COMPILATION)
+#define BROTLI_DEC_API __declspec(dllexport)
+#else
+#define BROTLI_DEC_API __declspec(dllimport)
+#endif  /* BROTLIDEC_SHARED_COMPILATION */
+#if defined(BROTLIENC_SHARED_COMPILATION)
+#define BROTLI_ENC_API __declspec(dllexport)
+#else
+#define BROTLI_ENC_API __declspec(dllimport)
+#endif  /* BROTLIENC_SHARED_COMPILATION */
+#else  /* _WIN32 */
+#define BROTLI_COMMON_API BROTLI_PUBLIC
+#define BROTLI_DEC_API BROTLI_PUBLIC
+#define BROTLI_ENC_API BROTLI_PUBLIC
+#endif  /* _WIN32 */
+#else  /* BROTLI_SHARED_COMPILATION */
+#define BROTLI_COMMON_API
+#define BROTLI_DEC_API
+#define BROTLI_ENC_API
+#endif
+
+#if defined(BROTLI_BUILD_ENC_EXTRA_API)
+#define BROTLI_ENC_EXTRA_API BROTLI_ENC_API
+#else
+#define BROTLI_ENC_EXTRA_API BROTLI_INTERNAL
+#endif
+
+#endif  /* BROTLI_COMMON_PORT_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/shared_dictionary.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/shared_dictionary.h
new file mode 100644
index 0000000000..2970c2dcc9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/shared_dictionary.h
@@ -0,0 +1,100 @@
+/* Copyright 2017 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* (Opaque) Shared Dictionary definition and utilities. */
+
+#ifndef BROTLI_COMMON_SHARED_DICTIONARY_H_
+#define BROTLI_COMMON_SHARED_DICTIONARY_H_
+
+#include <brotli/port.h>
+#include <brotli/types.h>
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+#define SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH 4
+#define SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH 31
+#define SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS 64
+#define SHARED_BROTLI_MAX_COMPOUND_DICTS 15
+
+/**
+ * Opaque structure that holds shared dictionary data.
+ *
+ * Allocated and initialized with ::BrotliSharedDictionaryCreateInstance.
+ * Cleaned up and deallocated with ::BrotliSharedDictionaryDestroyInstance.
+ */
+typedef struct BrotliSharedDictionaryStruct BrotliSharedDictionary;
+
+/**
+ * Input data type for ::BrotliSharedDictionaryAttach.
+ */
+typedef enum BrotliSharedDictionaryType {
+  /** Raw LZ77 prefix dictionary. */
+  BROTLI_SHARED_DICTIONARY_RAW = 0,
+  /** Serialized shared dictionary.
+   *
+   * DO NOT USE: methods accepting this value will fail.
+   */
+  BROTLI_SHARED_DICTIONARY_SERIALIZED = 1
+} BrotliSharedDictionaryType;
+
+/**
+ * Creates an instance of ::BrotliSharedDictionary.
+ *
+ * Fresh instance has default word dictionary and transforms
+ * and no LZ77 prefix dictionary.
+ *
+ * @p alloc_func and @p free_func @b MUST be both zero or both non-zero. In the
+ * case they are both zero, default memory allocators are used. @p opaque is
+ * passed to @p alloc_func and @p free_func when they are called. @p free_func
+ * has to return without doing anything when asked to free a NULL pointer.
+ *
+ * @param alloc_func custom memory allocation function
+ * @param free_func custom memory free function
+ * @param opaque custom memory manager handle
+ * @returns @c 0 if instance can not be allocated or initialized
+ * @returns pointer to initialized ::BrotliSharedDictionary otherwise
+ */
+BROTLI_COMMON_API BrotliSharedDictionary* BrotliSharedDictionaryCreateInstance(
+    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);
+
+/**
+ * Deinitializes and frees ::BrotliSharedDictionary instance.
+ *
+ * @param dict shared dictionary instance to be cleaned up and deallocated
+ */
+BROTLI_COMMON_API void BrotliSharedDictionaryDestroyInstance(
+    BrotliSharedDictionary* dict);
+
+/**
+ * Attaches dictionary to a given instance of ::BrotliSharedDictionary.
+ *
+ * Dictionary to be attached is represented in a serialized format as a region
+ * of memory.
+ *
+ * Provided data it partially referenced by a resulting (compound) dictionary,
+ * and should be kept untouched, while at least one compound dictionary uses it.
+ * This way memory overhead is kept minimal by the cost of additional resource
+ * management.
+ *
+ * @param dict dictionary to extend
+ * @param type type of dictionary to attach
+ * @param data_size size of @p data
+ * @param data serialized dictionary of type @p type, with at least @p data_size
+ *        addressable bytes
+ * @returns ::BROTLI_TRUE if provided dictionary is successfully attached
+ * @returns ::BROTLI_FALSE otherwise
+ */
+BROTLI_COMMON_API BROTLI_BOOL BrotliSharedDictionaryAttach(
+    BrotliSharedDictionary* dict, BrotliSharedDictionaryType type,
+    size_t data_size, const uint8_t data[BROTLI_ARRAY_PARAM(data_size)]);
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}  /* extern "C" */
+#endif
+
+#endif  /* BROTLI_COMMON_SHARED_DICTIONARY_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/types.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/types.h
new file mode 100644
index 0000000000..eff1a3cd07
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/include/brotli/types.h
@@ -0,0 +1,83 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/**
+ * @file
+ * Common types used in decoder and encoder API.
+ */
+
+#ifndef BROTLI_COMMON_TYPES_H_
+#define BROTLI_COMMON_TYPES_H_
+
+#include <stddef.h>  /* for size_t */
+
+#if defined(_MSC_VER) && (_MSC_VER < 1600)
+typedef __int8 int8_t;
+typedef unsigned __int8 uint8_t;
+typedef __int16 int16_t;
+typedef unsigned __int16 uint16_t;
+typedef __int32 int32_t;
+typedef unsigned __int32 uint32_t;
+typedef unsigned __int64 uint64_t;
+typedef __int64 int64_t;
+#else
+#include <stdint.h>
+#endif  /* defined(_MSC_VER) && (_MSC_VER < 1600) */
+
+/**
+ * A portable @c bool replacement.
+ *
+ * ::BROTLI_BOOL is a "documentation" type: actually it is @c int, but in API it
+ * denotes a type, whose only values are ::BROTLI_TRUE and ::BROTLI_FALSE.
+ *
+ * ::BROTLI_BOOL values passed to Brotli should either be ::BROTLI_TRUE or
+ * ::BROTLI_FALSE, or be a result of ::TO_BROTLI_BOOL macros.
+ *
+ * ::BROTLI_BOOL values returned by Brotli should not be tested for equality
+ * with @c true, @c false, ::BROTLI_TRUE, ::BROTLI_FALSE, but rather should be
+ * evaluated, for example: @code{.cpp}
+ * if (SomeBrotliFunction(encoder, BROTLI_TRUE) &&
+ *     !OtherBrotliFunction(decoder, BROTLI_FALSE)) {
+ *   bool x = !!YetAnotherBrotliFunction(encoder, TO_BROLTI_BOOL(2 * 2 == 4));
+ *   DoSomething(x);
+ * }
+ * @endcode
+ */
+#define BROTLI_BOOL int
+/** Portable @c true replacement. */
+#define BROTLI_TRUE 1
+/** Portable @c false replacement. */
+#define BROTLI_FALSE 0
+/** @c bool to ::BROTLI_BOOL conversion macros. */
+#define TO_BROTLI_BOOL(X) (!!(X) ? BROTLI_TRUE : BROTLI_FALSE)
+
+#define BROTLI_MAKE_UINT64_T(high, low) ((((uint64_t)(high)) << 32) | low)
+
+#define BROTLI_UINT32_MAX (~((uint32_t)0))
+#define BROTLI_SIZE_MAX (~((size_t)0))
+
+/**
+ * Allocating function pointer type.
+ *
+ * @param opaque custom memory manager handle provided by client
+ * @param size requested memory region size; can not be @c 0
+ * @returns @c 0 in the case of failure
+ * @returns a valid pointer to a memory region of at least @p size bytes
+ *          long otherwise
+ */
+typedef void* (*brotli_alloc_func)(void* opaque, size_t size);
+
+/**
+ * Deallocating function pointer type.
+ *
+ * This function @b SHOULD do nothing if @p address is @c 0.
+ *
+ * @param opaque custom memory manager handle provided by client
+ * @param address memory region pointer returned by ::brotli_alloc_func, or @c 0
+ */
+typedef void (*brotli_free_func)(void* opaque, void* address);
+
+#endif  /* BROTLI_COMMON_TYPES_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/tools/brotli.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/tools/brotli.c
new file mode 100644
index 0000000000..0dc99bd3d4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/tools/brotli.c
@@ -0,0 +1,1559 @@
+/* Copyright 2014 Google Inc. All Rights Reserved.
+
+   Distributed under MIT license.
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+*/
+
+/* Command line interface for Brotli library. */
+
+/* Mute strerror/strcpy warnings. */
+#if !defined(_CRT_SECURE_NO_WARNINGS)
+#define _CRT_SECURE_NO_WARNINGS
+#endif
+
+#include <errno.h>
+#include <fcntl.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/stat.h>
+#include <sys/types.h>
+#include <time.h>
+
+#include <brotli/decode.h>
+#include <brotli/encode.h>
+#include <brotli/types.h>
+
+#include "../common/constants.h"
+#include "../common/version.h"
+
+#if defined(_WIN32)
+#include <io.h>
+#include <share.h>
+#include <sys/utime.h>
+
+#define MAKE_BINARY(FILENO) (_setmode((FILENO), _O_BINARY), (FILENO))
+
+#if !defined(__MINGW32__)
+#define STDIN_FILENO _fileno(stdin)
+#define STDOUT_FILENO _fileno(stdout)
+#define S_IRUSR S_IREAD
+#define S_IWUSR S_IWRITE
+#endif
+
+#define fdopen _fdopen
+#define isatty _isatty
+#define unlink _unlink
+#define utimbuf _utimbuf
+#define utime _utime
+
+#define fopen ms_fopen
+#define open ms_open
+
+#define chmod(F, P) (0)
+#define chown(F, O, G) (0)
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1400)
+#define fseek _fseeki64
+#define ftell _ftelli64
+#endif
+
+static FILE* ms_fopen(const char* filename, const char* mode) {
+  FILE* result = 0;
+  fopen_s(&result, filename, mode);
+  return result;
+}
+
+static int ms_open(const char* filename, int oflag, int pmode) {
+  int result = -1;
+  _sopen_s(&result, filename, oflag | O_BINARY, _SH_DENYNO, pmode);
+  return result;
+}
+#else  /* !defined(_WIN32) */
+#include <unistd.h>
+#include <utime.h>
+#define MAKE_BINARY(FILENO) (FILENO)
+#endif  /* defined(_WIN32) */
+
+#if defined(_POSIX_C_SOURCE) && (_POSIX_C_SOURCE >= 200809L)
+#define HAVE_UTIMENSAT 1
+#elif defined(_ATFILE_SOURCE)
+#define HAVE_UTIMENSAT 1
+#else
+#define HAVE_UTIMENSAT 0
+#endif
+
+#if HAVE_UTIMENSAT
+#if defined(__APPLE__)
+#define ATIME_NSEC(S) ((S)->st_atimespec.tv_nsec)
+#define MTIME_NSEC(S) ((S)->st_mtimespec.tv_nsec)
+#else  /* defined(__APPLE__) */
+#define ATIME_NSEC(S) ((S)->st_atim.tv_nsec)
+#define MTIME_NSEC(S) ((S)->st_mtim.tv_nsec)
+#endif
+#endif  /* HAVE_UTIMENSAT */
+
+typedef enum {
+  COMMAND_COMPRESS,
+  COMMAND_DECOMPRESS,
+  COMMAND_HELP,
+  COMMAND_INVALID,
+  COMMAND_TEST_INTEGRITY,
+  COMMAND_NOOP,
+  COMMAND_VERSION
+} Command;
+
+typedef enum {
+  COMMENT_INIT,
+  COMMENT_READ,
+  COMMENT_OK,
+  COMMENT_BAD,
+} CommentState;
+
+#define DEFAULT_LGWIN 24
+#define DEFAULT_SUFFIX ".br"
+#define MAX_OPTIONS 24
+#define MAX_COMMENT_LEN 80
+
+typedef struct {
+  /* Parameters */
+  int quality;
+  int lgwin;
+  int verbosity;
+  BROTLI_BOOL force_overwrite;
+  BROTLI_BOOL junk_source;
+  BROTLI_BOOL reject_uncompressible;
+  BROTLI_BOOL copy_stat;
+  BROTLI_BOOL write_to_stdout;
+  BROTLI_BOOL test_integrity;
+  BROTLI_BOOL decompress;
+  BROTLI_BOOL large_window;
+  BROTLI_BOOL allow_concatenated;
+  const char* output_path;
+  const char* dictionary_path;
+  const char* suffix;
+  uint8_t comment[MAX_COMMENT_LEN];
+  size_t comment_len;
+  size_t comment_pos;
+  CommentState comment_state;
+  int not_input_indices[MAX_OPTIONS];
+  size_t longest_path_len;
+  size_t input_count;
+
+  /* Inner state */
+  int argc;
+  char** argv;
+  uint8_t* dictionary;
+  size_t dictionary_size;
+  BrotliEncoderPreparedDictionary* prepared_dictionary;
+  BrotliDecoderState* decoder;
+  char* modified_path;  /* Storage for path with appended / cut suffix */
+  int iterator;
+  int ignore;
+  BROTLI_BOOL iterator_error;
+  uint8_t* buffer;
+  uint8_t* input;
+  uint8_t* output;
+  const char* current_input_path;
+  const char* current_output_path;
+  int64_t input_file_length;  /* -1, if impossible to calculate */
+  FILE* fin;
+  FILE* fout;
+
+  /* I/O buffers */
+  size_t available_in;
+  const uint8_t* next_in;
+  size_t available_out;
+  uint8_t* next_out;
+
+  /* Reporting */
+  /* size_t would be large enough,
+     until 4GiB+ files are compressed / decompressed on 32-bit CPUs. */
+  size_t total_in;
+  size_t total_out;
+  clock_t start_time;
+  clock_t end_time;
+} Context;
+
+/* Parse base 64 encoded string to buffer. Not performance-centric.
+   |out_len| as input is buffer size; |out_len| as output is decoded length.
+   Returns BROTLI_FALSE if either input is not (relaxed) base 64 conformant,
+   or output does not fit buffer. */
+static BROTLI_BOOL ParseBase64(const char* str, uint8_t* out, size_t* out_len) {
+  size_t in_len = strlen(str);
+  size_t max_out_len = *out_len;
+  size_t i;
+  size_t bit_count = 0;
+  uint32_t bits = 0;
+  size_t padding_count = 0;
+  size_t octet_count = 0;
+  for (i = 0; i < in_len; ++i) {
+    char c = str[i];
+    int sextet = 0;
+    if (c == 9 || c == 10 || c == 13 || c == ' ') {
+      continue;
+    }
+    if (c == '=') {
+      padding_count++;
+      continue;
+    }
+    if (padding_count) return BROTLI_FALSE;
+    if (c == '+' || c == '-') {
+      sextet = 62;
+    } else if (c == '/' || c == '_') {
+      sextet = 63;
+    } else if (c >= 'A' && c <= 'Z') {
+      sextet = c - 'A';
+    } else if (c >= 'a' && c <= 'z') {
+      sextet = c - 'a' + 26;
+    } else if (c >= '0' && c <= '9') {
+      sextet = c - '0' + 52;
+    } else {
+      return BROTLI_FALSE;
+    }
+    bits = (bits << 6) | (uint32_t)sextet;
+    bit_count += 6;
+    if (bit_count >= 8) {
+      if (octet_count == max_out_len) return BROTLI_FALSE;
+      bit_count -= 8;
+      out[octet_count++] = (bits >> bit_count) & 0xFF;
+    }
+  }
+  if (padding_count > 2) return BROTLI_FALSE;
+  *out_len = octet_count;
+  return BROTLI_TRUE;
+}
+
+/* Parse up to 5 decimal digits. */
+static BROTLI_BOOL ParseInt(const char* s, int low, int high, int* result) {
+  int value = 0;
+  int i;
+  for (i = 0; i < 5; ++i) {
+    char c = s[i];
+    if (c == 0) break;
+    if (s[i] < '0' || s[i] > '9') return BROTLI_FALSE;
+    value = (10 * value) + (c - '0');
+  }
+  if (i == 0) return BROTLI_FALSE;
+  if (i > 1 && s[0] == '0') return BROTLI_FALSE;
+  if (s[i] != 0) return BROTLI_FALSE;
+  if (value < low || value > high) return BROTLI_FALSE;
+  *result = value;
+  return BROTLI_TRUE;
+}
+
+/* Returns "base file name" or its tail, if it contains '/' or '\'. */
+static const char* FileName(const char* path) {
+  const char* separator_position = strrchr(path, '/');
+  if (separator_position) path = separator_position + 1;
+  separator_position = strrchr(path, '\\');
+  if (separator_position) path = separator_position + 1;
+  return path;
+}
+
+/* Detect if the program name is a special alias that infers a command type. */
+static BROTLI_BOOL CheckAlias(const char* name, const char* alias) {
+  /* TODO: cast name to lower case? */
+  size_t alias_len = strlen(alias);
+  name = FileName(name);
+  /* Partial comparison. On Windows there could be ".exe" suffix. */
+  if (strncmp(name, alias, alias_len) == 0) {
+    char terminator = name[alias_len];
+    if (terminator == 0 || terminator == '.') return BROTLI_TRUE;
+  }
+  return BROTLI_FALSE;
+}
+
+static Command ParseParams(Context* params) {
+  int argc = params->argc;
+  char** argv = params->argv;
+  int i;
+  int next_option_index = 0;
+  size_t input_count = 0;
+  size_t longest_path_len = 1;
+  BROTLI_BOOL command_set = BROTLI_FALSE;
+  BROTLI_BOOL quality_set = BROTLI_FALSE;
+  BROTLI_BOOL output_set = BROTLI_FALSE;
+  BROTLI_BOOL keep_set = BROTLI_FALSE;
+  BROTLI_BOOL squash_set = BROTLI_FALSE;
+  BROTLI_BOOL lgwin_set = BROTLI_FALSE;
+  BROTLI_BOOL suffix_set = BROTLI_FALSE;
+  BROTLI_BOOL after_dash_dash = BROTLI_FALSE;
+  BROTLI_BOOL comment_set = BROTLI_FALSE;
+  BROTLI_BOOL concatenated_set = BROTLI_FALSE;
+  Command command = COMMAND_COMPRESS;
+
+  if (CheckAlias(argv[0], "brcat")) {
+    command_set = BROTLI_TRUE;
+    command = COMMAND_DECOMPRESS;
+    concatenated_set = BROTLI_TRUE;
+    params->allow_concatenated = BROTLI_TRUE;
+    output_set = BROTLI_TRUE;
+    params->write_to_stdout = BROTLI_TRUE;
+  } else if (CheckAlias(argv[0], "unbrotli")) {
+    command_set = BROTLI_TRUE;
+    command = COMMAND_DECOMPRESS;
+  }
+
+  for (i = 1; i < argc; ++i) {
+    const char* arg = argv[i];
+    /* C99 5.1.2.2.1: "members argv[0] through argv[argc-1] inclusive shall
+       contain pointers to strings"; NULL and 0-length are not forbidden. */
+    size_t arg_len = arg ? strlen(arg) : 0;
+
+    if (arg_len == 0) {
+      params->not_input_indices[next_option_index++] = i;
+      continue;
+    }
+
+    /* Too many options. The expected longest option list is:
+       "-q 0 -w 10 -o f -D d -S b -d -f -k -n -v -K --", i.e. 17 items in total.
+       This check is an additional guard that is never triggered, but provides
+       a guard for future changes. */
+    if (next_option_index > (MAX_OPTIONS - 2)) {
+      fprintf(stderr, "too many options passed\n");
+      return COMMAND_INVALID;
+    }
+
+    /* Input file entry. */
+    if (after_dash_dash || arg[0] != '-' || arg_len == 1) {
+      input_count++;
+      if (longest_path_len < arg_len) longest_path_len = arg_len;
+      continue;
+    }
+
+    /* Not a file entry. */
+    params->not_input_indices[next_option_index++] = i;
+
+    /* '--' entry stop parsing arguments. */
+    if (arg_len == 2 && arg[1] == '-') {
+      after_dash_dash = BROTLI_TRUE;
+      continue;
+    }
+
+    /* Simple / coalesced options. */
+    if (arg[1] != '-') {
+      size_t j;
+      for (j = 1; j < arg_len; ++j) {
+        char c = arg[j];
+        if (c >= '0' && c <= '9') {
+          if (quality_set) {
+            fprintf(stderr, "quality already set\n");
+            return COMMAND_INVALID;
+          }
+          quality_set = BROTLI_TRUE;
+          params->quality = c - '0';
+          continue;
+        } else if (c == 'c') {
+          if (output_set) {
+            fprintf(stderr, "write to standard output already set\n");
+            return COMMAND_INVALID;
+          }
+          output_set = BROTLI_TRUE;
+          params->write_to_stdout = BROTLI_TRUE;
+          continue;
+        } else if (c == 'd') {
+          if (command_set) {
+            fprintf(stderr, "command already set when parsing -d\n");
+            return COMMAND_INVALID;
+          }
+          command_set = BROTLI_TRUE;
+          command = COMMAND_DECOMPRESS;
+          continue;
+        } else if (c == 'f') {
+          if (params->force_overwrite) {
+            fprintf(stderr, "force output overwrite already set\n");
+            return COMMAND_INVALID;
+          }
+          params->force_overwrite = BROTLI_TRUE;
+          continue;
+        } else if (c == 'h') {
+          /* Don't parse further. */
+          return COMMAND_HELP;
+        } else if (c == 'j' || c == 'k') {
+          if (keep_set) {
+            fprintf(stderr, "argument --rm / -j or --keep / -k already set\n");
+            return COMMAND_INVALID;
+          }
+          keep_set = BROTLI_TRUE;
+          params->junk_source = TO_BROTLI_BOOL(c == 'j');
+          continue;
+        } else if (c == 'n') {
+          if (!params->copy_stat) {
+            fprintf(stderr, "argument --no-copy-stat / -n already set\n");
+            return COMMAND_INVALID;
+          }
+          params->copy_stat = BROTLI_FALSE;
+          continue;
+        } else if (c == 's') {
+          if (squash_set) {
+            fprintf(stderr, "argument --squash / -s already set\n");
+            return COMMAND_INVALID;
+          }
+          squash_set = BROTLI_TRUE;
+          params->reject_uncompressible = BROTLI_TRUE;
+          continue;
+        } else if (c == 't') {
+          if (command_set) {
+            fprintf(stderr, "command already set when parsing -t\n");
+            return COMMAND_INVALID;
+          }
+          command_set = BROTLI_TRUE;
+          command = COMMAND_TEST_INTEGRITY;
+          continue;
+        } else if (c == 'v') {
+          if (params->verbosity > 0) {
+            fprintf(stderr, "argument --verbose / -v already set\n");
+            return COMMAND_INVALID;
+          }
+          params->verbosity = 1;
+          continue;
+        } else if (c == 'K') {
+          if (concatenated_set) {
+            fprintf(stderr, "argument -K / --concatenated already set\n");
+            return COMMAND_INVALID;
+          }
+          concatenated_set = BROTLI_TRUE;
+          params->allow_concatenated = BROTLI_TRUE;
+          continue;
+        } else if (c == 'V') {
+          /* Don't parse further. */
+          return COMMAND_VERSION;
+        } else if (c == 'Z') {
+          if (quality_set) {
+            fprintf(stderr, "quality already set\n");
+            return COMMAND_INVALID;
+          }
+          quality_set = BROTLI_TRUE;
+          params->quality = 11;
+          continue;
+        }
+        /* o/q/w/C/D/S with parameter is expected */
+        if (c != 'o' && c != 'q' && c != 'w' && c != 'C' && c != 'D' &&
+            c != 'S') {
+          fprintf(stderr, "invalid argument -%c\n", c);
+          return COMMAND_INVALID;
+        }
+        if (j + 1 != arg_len) {
+          fprintf(stderr, "expected parameter for argument -%c\n", c);
+          return COMMAND_INVALID;
+        }
+        i++;
+        if (i == argc || !argv[i] || argv[i][0] == 0) {
+          fprintf(stderr, "expected parameter for argument -%c\n", c);
+          return COMMAND_INVALID;
+        }
+        params->not_input_indices[next_option_index++] = i;
+        if (c == 'o') {
+          if (output_set) {
+            fprintf(stderr, "write to standard output already set (-o)\n");
+            return COMMAND_INVALID;
+          }
+          params->output_path = argv[i];
+        } else if (c == 'q') {
+          if (quality_set) {
+            fprintf(stderr, "quality already set\n");
+            return COMMAND_INVALID;
+          }
+          quality_set = ParseInt(argv[i], BROTLI_MIN_QUALITY,
+                                 BROTLI_MAX_QUALITY, &params->quality);
+          if (!quality_set) {
+            fprintf(stderr, "error parsing quality value [%s]\n", argv[i]);
+            return COMMAND_INVALID;
+          }
+        } else if (c == 'w') {
+          if (lgwin_set) {
+            fprintf(stderr, "lgwin parameter already set\n");
+            return COMMAND_INVALID;
+          }
+          lgwin_set = ParseInt(argv[i], 0,
+                               BROTLI_MAX_WINDOW_BITS, &params->lgwin);
+          if (!lgwin_set) {
+            fprintf(stderr, "error parsing lgwin value [%s]\n", argv[i]);
+            return COMMAND_INVALID;
+          }
+          if (params->lgwin != 0 && params->lgwin < BROTLI_MIN_WINDOW_BITS) {
+            fprintf(stderr,
+                    "lgwin parameter (%d) smaller than the minimum (%d)\n",
+                    params->lgwin, BROTLI_MIN_WINDOW_BITS);
+            return COMMAND_INVALID;
+          }
+        } else if (c == 'C') {
+          if (comment_set) {
+            fprintf(stderr, "comment already set\n");
+            return COMMAND_INVALID;
+          }
+          params->comment_len = MAX_COMMENT_LEN;
+          if (!ParseBase64(argv[i], params->comment, &params->comment_len)) {
+            fprintf(stderr, "invalid base64-encoded comment\n");
+            return COMMAND_INVALID;
+          }
+          comment_set = BROTLI_TRUE;
+        } else if (c == 'D') {
+          if (params->dictionary_path) {
+            fprintf(stderr, "dictionary path already set\n");
+            return COMMAND_INVALID;
+          }
+          params->dictionary_path = argv[i];
+        } else if (c == 'S') {
+          if (suffix_set) {
+            fprintf(stderr, "suffix already set\n");
+            return COMMAND_INVALID;
+          }
+          suffix_set = BROTLI_TRUE;
+          params->suffix = argv[i];
+        }
+      }
+    } else {  /* Double-dash. */
+      arg = &arg[2];
+      if (strcmp("best", arg) == 0) {
+        if (quality_set) {
+          fprintf(stderr, "quality already set\n");
+          return COMMAND_INVALID;
+        }
+        quality_set = BROTLI_TRUE;
+        params->quality = 11;
+      } else if (strcmp("concatenated", arg) == 0) {
+        if (concatenated_set) {
+          fprintf(stderr, "argument -K / --concatenated already set\n");
+          return COMMAND_INVALID;
+        }
+        concatenated_set = BROTLI_TRUE;
+        params->allow_concatenated = BROTLI_TRUE;
+        continue;
+      } else if (strcmp("decompress", arg) == 0) {
+        if (command_set) {
+          fprintf(stderr, "command already set when parsing --decompress\n");
+          return COMMAND_INVALID;
+        }
+        command_set = BROTLI_TRUE;
+        command = COMMAND_DECOMPRESS;
+      } else if (strcmp("force", arg) == 0) {
+        if (params->force_overwrite) {
+          fprintf(stderr, "force output overwrite already set\n");
+          return COMMAND_INVALID;
+        }
+        params->force_overwrite = BROTLI_TRUE;
+      } else if (strcmp("help", arg) == 0) {
+        /* Don't parse further. */
+        return COMMAND_HELP;
+      } else if (strcmp("keep", arg) == 0) {
+        if (keep_set) {
+          fprintf(stderr, "argument --rm / -j or --keep / -k already set\n");
+          return COMMAND_INVALID;
+        }
+        keep_set = BROTLI_TRUE;
+        params->junk_source = BROTLI_FALSE;
+      } else if (strcmp("no-copy-stat", arg) == 0) {
+        if (!params->copy_stat) {
+          fprintf(stderr, "argument --no-copy-stat / -n already set\n");
+          return COMMAND_INVALID;
+        }
+        params->copy_stat = BROTLI_FALSE;
+      } else if (strcmp("rm", arg) == 0) {
+        if (keep_set) {
+          fprintf(stderr, "argument --rm / -j or --keep / -k already set\n");
+          return COMMAND_INVALID;
+        }
+        keep_set = BROTLI_TRUE;
+        params->junk_source = BROTLI_TRUE;
+      } else if (strcmp("squash", arg) == 0) {
+        if (squash_set) {
+          fprintf(stderr, "argument --squash / -s already set\n");
+          return COMMAND_INVALID;
+        }
+        squash_set = BROTLI_TRUE;
+        params->reject_uncompressible = BROTLI_TRUE;
+        continue;
+      } else if (strcmp("stdout", arg) == 0) {
+        if (output_set) {
+          fprintf(stderr, "write to standard output already set\n");
+          return COMMAND_INVALID;
+        }
+        output_set = BROTLI_TRUE;
+        params->write_to_stdout = BROTLI_TRUE;
+      } else if (strcmp("test", arg) == 0) {
+        if (command_set) {
+          fprintf(stderr, "command already set when parsing --test\n");
+          return COMMAND_INVALID;
+        }
+        command_set = BROTLI_TRUE;
+        command = COMMAND_TEST_INTEGRITY;
+      } else if (strcmp("verbose", arg) == 0) {
+        if (params->verbosity > 0) {
+          fprintf(stderr, "argument --verbose / -v already set\n");
+          return COMMAND_INVALID;
+        }
+        params->verbosity = 1;
+      } else if (strcmp("version", arg) == 0) {
+        /* Don't parse further. */
+        return COMMAND_VERSION;
+      } else {
+        /* key=value */
+        const char* value = strchr(arg, '=');
+        size_t key_len;
+        if (!value || value[1] == 0) {
+          fprintf(stderr, "must pass the parameter as --%s=value\n", arg);
+          return COMMAND_INVALID;
+        }
+        key_len = (size_t)(value - arg);
+        value++;
+        if (strncmp("comment", arg, key_len) == 0) {
+          if (comment_set) {
+            fprintf(stderr, "comment already set\n");
+            return COMMAND_INVALID;
+          }
+          params->comment_len = MAX_COMMENT_LEN;
+          if (!ParseBase64(value, params->comment, &params->comment_len)) {
+            fprintf(stderr, "invalid base64-encoded comment\n");
+            return COMMAND_INVALID;
+          }
+          comment_set = BROTLI_TRUE;
+        } else if (strncmp("dictionary", arg, key_len) == 0) {
+          if (params->dictionary_path) {
+            fprintf(stderr, "dictionary path already set\n");
+            return COMMAND_INVALID;
+          }
+          params->dictionary_path = value;
+        } else if (strncmp("lgwin", arg, key_len) == 0) {
+          if (lgwin_set) {
+            fprintf(stderr, "lgwin parameter already set\n");
+            return COMMAND_INVALID;
+          }
+          lgwin_set = ParseInt(value, 0,
+                               BROTLI_MAX_WINDOW_BITS, &params->lgwin);
+          if (!lgwin_set) {
+            fprintf(stderr, "error parsing lgwin value [%s]\n", value);
+            return COMMAND_INVALID;
+          }
+          if (params->lgwin != 0 && params->lgwin < BROTLI_MIN_WINDOW_BITS) {
+            fprintf(stderr,
+                    "lgwin parameter (%d) smaller than the minimum (%d)\n",
+                    params->lgwin, BROTLI_MIN_WINDOW_BITS);
+            return COMMAND_INVALID;
+          }
+        } else if (strncmp("large_window", arg, key_len) == 0) {
+          /* This option is intentionally not mentioned in help. */
+          if (lgwin_set) {
+            fprintf(stderr, "lgwin parameter already set\n");
+            return COMMAND_INVALID;
+          }
+          lgwin_set = ParseInt(value, 0,
+                               BROTLI_LARGE_MAX_WINDOW_BITS, &params->lgwin);
+          if (!lgwin_set) {
+            fprintf(stderr, "error parsing lgwin value [%s]\n", value);
+            return COMMAND_INVALID;
+          }
+          if (params->lgwin != 0 && params->lgwin < BROTLI_MIN_WINDOW_BITS) {
+            fprintf(stderr,
+                    "lgwin parameter (%d) smaller than the minimum (%d)\n",
+                    params->lgwin, BROTLI_MIN_WINDOW_BITS);
+            return COMMAND_INVALID;
+          }
+        } else if (strncmp("output", arg, key_len) == 0) {
+          if (output_set) {
+            fprintf(stderr,
+                    "write to standard output already set (--output)\n");
+            return COMMAND_INVALID;
+          }
+          params->output_path = value;
+        } else if (strncmp("quality", arg, key_len) == 0) {
+          if (quality_set) {
+            fprintf(stderr, "quality already set\n");
+            return COMMAND_INVALID;
+          }
+          quality_set = ParseInt(value, BROTLI_MIN_QUALITY,
+                                 BROTLI_MAX_QUALITY, &params->quality);
+          if (!quality_set) {
+            fprintf(stderr, "error parsing quality value [%s]\n", value);
+            return COMMAND_INVALID;
+          }
+        } else if (strncmp("suffix", arg, key_len) == 0) {
+          if (suffix_set) {
+            fprintf(stderr, "suffix already set\n");
+            return COMMAND_INVALID;
+          }
+          suffix_set = BROTLI_TRUE;
+          params->suffix = value;
+        } else {
+          fprintf(stderr, "invalid parameter: [%s]\n", arg);
+          return COMMAND_INVALID;
+        }
+      }
+    }
+  }
+
+  params->input_count = input_count;
+  params->longest_path_len = longest_path_len;
+  params->decompress = (command == COMMAND_DECOMPRESS);
+  params->test_integrity = (command == COMMAND_TEST_INTEGRITY);
+
+  if (input_count > 1 && output_set) return COMMAND_INVALID;
+  if (params->test_integrity) {
+    if (params->output_path) return COMMAND_INVALID;
+    if (params->write_to_stdout) return COMMAND_INVALID;
+  }
+  if (params->reject_uncompressible && params->write_to_stdout) {
+    return COMMAND_INVALID;
+  }
+  if (strchr(params->suffix, '/') || strchr(params->suffix, '\\')) {
+    return COMMAND_INVALID;
+  }
+  if (!params->decompress && params->allow_concatenated) {
+    return COMMAND_INVALID;
+  }
+  if (params->allow_concatenated && params->comment_len) {
+    return COMMAND_INVALID;
+  }
+
+  return command;
+}
+
+static void PrintVersion(void) {
+  int major = BROTLI_VERSION_MAJOR;
+  int minor = BROTLI_VERSION_MINOR;
+  int patch = BROTLI_VERSION_PATCH;
+  fprintf(stdout, "brotli %d.%d.%d\n", major, minor, patch);
+}
+
+static void PrintHelp(const char* name, BROTLI_BOOL error) {
+  FILE* media = error ? stderr : stdout;
+  /* String is cut to pieces with length less than 509, to conform C90 spec. */
+  fprintf(media,
+"Usage: %s [OPTION]... [FILE]...\n",
+          name);
+  fprintf(media,
+"Options:\n"
+"  -#                          compression level (0-9)\n"
+"  -c, --stdout                write on standard output\n"
+"  -d, --decompress            decompress\n"
+"  -f, --force                 force output file overwrite\n"
+"  -h, --help                  display this help and exit\n");
+  fprintf(media,
+"  -j, --rm                    remove source file(s)\n"
+"  -s, --squash                remove destination file if larger than source\n"
+"  -k, --keep                  keep source file(s) (default)\n"
+"  -n, --no-copy-stat          do not copy source file(s) attributes\n"
+"  -o FILE, --output=FILE      output file (only if 1 input file)\n");
+  fprintf(media,
+"  -q NUM, --quality=NUM       compression level (%d-%d)\n",
+          BROTLI_MIN_QUALITY, BROTLI_MAX_QUALITY);
+  fprintf(media,
+"  -t, --test                  test compressed file integrity\n"
+"  -v, --verbose               verbose mode\n");
+  fprintf(media,
+"  -w NUM, --lgwin=NUM         set LZ77 window size (0, %d-%d)\n"
+"                              window size = 2**NUM - 16\n"
+"                              0 lets compressor choose the optimal value\n",
+          BROTLI_MIN_WINDOW_BITS, BROTLI_MAX_WINDOW_BITS);
+  fprintf(media,
+"  --large_window=NUM          use incompatible large-window brotli\n"
+"                              bitstream with window size (0, %d-%d)\n"
+"                              WARNING: this format is not compatible\n"
+"                              with brotli RFC 7932 and may not be\n"
+"                              decodable with regular brotli decoders\n",
+          BROTLI_MIN_WINDOW_BITS, BROTLI_LARGE_MAX_WINDOW_BITS);
+  fprintf(media,
+"  -C B64, --comment=B64       set comment; argument is base64-decoded first;\n"
+"                              (maximal decoded length: %d)\n"
+"                              when decoding: check stream comment;\n"
+"                              when encoding: embed comment (fingerprint)\n",
+          MAX_COMMENT_LEN);
+  fprintf(media,
+"  -D FILE, --dictionary=FILE  use FILE as raw (LZ77) dictionary\n"
+"  -K, --concatenated          allows concatenated brotli streams as input\n");
+  fprintf(media,
+"  -S SUF, --suffix=SUF        output file suffix (default:'%s')\n",
+          DEFAULT_SUFFIX);
+  fprintf(media,
+"  -V, --version               display version and exit\n"
+"  -Z, --best                  use best compression level (11) (default)\n"
+"Simple options could be coalesced, i.e. '-9kf' is equivalent to '-9 -k -f'.\n"
+"With no FILE, or when FILE is -, read standard input.\n"
+"All arguments after '--' are treated as files.\n");
+}
+
+static const char* PrintablePath(const char* path) {
+  return path ? path : "con";
+}
+
+static BROTLI_BOOL OpenInputFile(const char* input_path, FILE** f) {
+  *f = NULL;
+  if (!input_path) {
+    *f = fdopen(MAKE_BINARY(STDIN_FILENO), "rb");
+    return BROTLI_TRUE;
+  }
+  *f = fopen(input_path, "rb");
+  if (!*f) {
+    fprintf(stderr, "failed to open input file [%s]: %s\n",
+            PrintablePath(input_path), strerror(errno));
+    return BROTLI_FALSE;
+  }
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL OpenOutputFile(const char* output_path, FILE** f,
+                                  BROTLI_BOOL force) {
+  int fd;
+  *f = NULL;
+  if (!output_path) {
+    *f = fdopen(MAKE_BINARY(STDOUT_FILENO), "wb");
+    return BROTLI_TRUE;
+  }
+  fd = open(output_path, O_CREAT | (force ? 0 : O_EXCL) | O_WRONLY | O_TRUNC,
+            S_IRUSR | S_IWUSR);
+  if (fd < 0) {
+    fprintf(stderr, "failed to open output file [%s]: %s\n",
+            PrintablePath(output_path), strerror(errno));
+    return BROTLI_FALSE;
+  }
+  *f = fdopen(fd, "wb");
+  if (!*f) {
+    fprintf(stderr, "failed to open output file [%s]: %s\n",
+            PrintablePath(output_path), strerror(errno));
+    return BROTLI_FALSE;
+  }
+  return BROTLI_TRUE;
+}
+
+static int64_t FileSize(const char* path) {
+  FILE* f = fopen(path, "rb");
+  int64_t retval;
+  if (f == NULL) {
+    return -1;
+  }
+  if (fseek(f, 0L, SEEK_END) != 0) {
+    fclose(f);
+    return -1;
+  }
+  retval = ftell(f);
+  if (fclose(f) != 0) {
+    return -1;
+  }
+  return retval;
+}
+
+static int CopyTimeStat(const struct stat* statbuf, const char* output_path) {
+#if HAVE_UTIMENSAT
+  struct timespec times[2];
+  times[0].tv_sec = statbuf->st_atime;
+  times[0].tv_nsec = ATIME_NSEC(statbuf);
+  times[1].tv_sec = statbuf->st_mtime;
+  times[1].tv_nsec = MTIME_NSEC(statbuf);
+  return utimensat(AT_FDCWD, output_path, times, AT_SYMLINK_NOFOLLOW);
+#else
+  struct utimbuf times;
+  times.actime = statbuf->st_atime;
+  times.modtime = statbuf->st_mtime;
+  return utime(output_path, &times);
+#endif
+}
+
+/* Copy file times and permissions.
+   TODO(eustas): this is a "best effort" implementation; honest cross-platform
+   fully featured implementation is way too hacky; add more hacks by request. */
+static void CopyStat(const char* input_path, const char* output_path) {
+  struct stat statbuf;
+  int res;
+  if (input_path == 0 || output_path == 0) {
+    return;
+  }
+  if (stat(input_path, &statbuf) != 0) {
+    return;
+  }
+  res = CopyTimeStat(&statbuf, output_path);
+  res = chmod(output_path, statbuf.st_mode & (S_IRWXU | S_IRWXG | S_IRWXO));
+  if (res != 0) {
+    fprintf(stderr, "setting access bits failed for [%s]: %s\n",
+            PrintablePath(output_path), strerror(errno));
+  }
+  res = chown(output_path, (uid_t)-1, statbuf.st_gid);
+  if (res != 0) {
+    fprintf(stderr, "setting group failed for [%s]: %s\n",
+            PrintablePath(output_path), strerror(errno));
+  }
+  res = chown(output_path, statbuf.st_uid, (gid_t)-1);
+  if (res != 0) {
+    fprintf(stderr, "setting user failed for [%s]: %s\n",
+            PrintablePath(output_path), strerror(errno));
+  }
+}
+
+/* Result ownership is passed to caller.
+   |*dictionary_size| is set to resulting buffer size. */
+static BROTLI_BOOL ReadDictionary(Context* context, Command command) {
+  static const int kMaxDictionarySize =
+      BROTLI_MAX_DISTANCE - BROTLI_MAX_BACKWARD_LIMIT(24);
+  FILE* f;
+  int64_t file_size_64;
+  uint8_t* buffer;
+  size_t bytes_read;
+
+  if (context->dictionary_path == NULL) return BROTLI_TRUE;
+  f = fopen(context->dictionary_path, "rb");
+  if (f == NULL) {
+    fprintf(stderr, "failed to open dictionary file [%s]: %s\n",
+            PrintablePath(context->dictionary_path), strerror(errno));
+    return BROTLI_FALSE;
+  }
+
+  file_size_64 = FileSize(context->dictionary_path);
+  if (file_size_64 == -1) {
+    fprintf(stderr, "could not get size of dictionary file [%s]",
+            PrintablePath(context->dictionary_path));
+    fclose(f);
+    return BROTLI_FALSE;
+  }
+
+  if (file_size_64 > kMaxDictionarySize) {
+    fprintf(stderr, "dictionary [%s] is larger than maximum allowed: %d\n",
+            PrintablePath(context->dictionary_path), kMaxDictionarySize);
+    fclose(f);
+    return BROTLI_FALSE;
+  }
+  context->dictionary_size = (size_t)file_size_64;
+
+  buffer = (uint8_t*)malloc(context->dictionary_size);
+  if (!buffer) {
+    fprintf(stderr, "could not read dictionary: out of memory\n");
+    fclose(f);
+    return BROTLI_FALSE;
+  }
+  bytes_read = fread(buffer, sizeof(uint8_t), context->dictionary_size, f);
+  if (bytes_read != context->dictionary_size) {
+    free(buffer);
+    fprintf(stderr, "failed to read dictionary [%s]: %s\n",
+            PrintablePath(context->dictionary_path), strerror(errno));
+    fclose(f);
+    return BROTLI_FALSE;
+  }
+  fclose(f);
+  context->dictionary = buffer;
+  if (command == COMMAND_COMPRESS) {
+    context->prepared_dictionary = BrotliEncoderPrepareDictionary(
+        BROTLI_SHARED_DICTIONARY_RAW, context->dictionary_size,
+        context->dictionary, BROTLI_MAX_QUALITY, NULL, NULL, NULL);
+    if (context->prepared_dictionary == NULL) {
+      fprintf(stderr, "failed to prepare dictionary [%s]\n",
+              PrintablePath(context->dictionary_path));
+      return BROTLI_FALSE;
+    }
+  }
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL NextFile(Context* context) {
+  const char* arg;
+  size_t arg_len;
+
+  /* Iterator points to last used arg; increment to search for the next one. */
+  context->iterator++;
+
+  context->input_file_length = -1;
+
+  /* No input path; read from console. */
+  if (context->input_count == 0) {
+    if (context->iterator > 1) return BROTLI_FALSE;
+    context->current_input_path = NULL;
+    /* Either write to the specified path, or to console. */
+    context->current_output_path = context->output_path;
+    return BROTLI_TRUE;
+  }
+
+  /* Skip option arguments. */
+  while (context->iterator == context->not_input_indices[context->ignore]) {
+    context->iterator++;
+    context->ignore++;
+  }
+
+  /* All args are scanned already. */
+  if (context->iterator >= context->argc) return BROTLI_FALSE;
+
+  /* Iterator now points to the input file name. */
+  arg = context->argv[context->iterator];
+  arg_len = strlen(arg);
+  /* Read from console. */
+  if (arg_len == 1 && arg[0] == '-') {
+    context->current_input_path = NULL;
+    context->current_output_path = context->output_path;
+    return BROTLI_TRUE;
+  }
+
+  context->current_input_path = arg;
+  context->input_file_length = FileSize(arg);
+  context->current_output_path = context->output_path;
+
+  if (context->output_path) return BROTLI_TRUE;
+  if (context->write_to_stdout) return BROTLI_TRUE;
+
+  strcpy(context->modified_path, arg);
+  context->current_output_path = context->modified_path;
+  /* If output is not specified, input path suffix should match. */
+  if (context->decompress) {
+    size_t suffix_len = strlen(context->suffix);
+    char* name = (char*)FileName(context->modified_path);
+    char* name_suffix;
+    size_t name_len = strlen(name);
+    if (name_len < suffix_len + 1) {
+      fprintf(stderr, "empty output file name for [%s] input file\n",
+              PrintablePath(arg));
+      context->iterator_error = BROTLI_TRUE;
+      return BROTLI_FALSE;
+    }
+    name_suffix = name + name_len - suffix_len;
+    if (strcmp(context->suffix, name_suffix) != 0) {
+      fprintf(stderr, "input file [%s] suffix mismatch\n",
+              PrintablePath(arg));
+      context->iterator_error = BROTLI_TRUE;
+      return BROTLI_FALSE;
+    }
+    name_suffix[0] = 0;
+    return BROTLI_TRUE;
+  } else {
+    strcpy(context->modified_path + arg_len, context->suffix);
+    return BROTLI_TRUE;
+  }
+}
+
+static BROTLI_BOOL OpenFiles(Context* context) {
+  BROTLI_BOOL is_ok = OpenInputFile(context->current_input_path, &context->fin);
+  if (!context->test_integrity && is_ok) {
+    is_ok = OpenOutputFile(
+        context->current_output_path, &context->fout, context->force_overwrite);
+  }
+  return is_ok;
+}
+
+static BROTLI_BOOL CloseFiles(Context* context, BROTLI_BOOL rm_input,
+                              BROTLI_BOOL rm_output) {
+  BROTLI_BOOL is_ok = BROTLI_TRUE;
+  if (!context->test_integrity && context->fout) {
+    if (fclose(context->fout) != 0) {
+      if (is_ok) {
+        fprintf(stderr, "fclose failed [%s]: %s\n",
+                PrintablePath(context->current_output_path), strerror(errno));
+      }
+      is_ok = BROTLI_FALSE;
+    }
+    if (rm_output && context->current_output_path) {
+      unlink(context->current_output_path);
+    }
+
+    /* TOCTOU violation, but otherwise it is impossible to set file times. */
+    if (!rm_output && is_ok && context->copy_stat) {
+      CopyStat(context->current_input_path, context->current_output_path);
+    }
+  }
+
+  if (context->fin) {
+    if (fclose(context->fin) != 0) {
+      if (is_ok) {
+        fprintf(stderr, "fclose failed [%s]: %s\n",
+                PrintablePath(context->current_input_path), strerror(errno));
+      }
+      is_ok = BROTLI_FALSE;
+    }
+  }
+  if (rm_input && context->current_input_path) {
+    unlink(context->current_input_path);
+  }
+
+  context->fin = NULL;
+  context->fout = NULL;
+
+  return is_ok;
+}
+
+static const size_t kFileBufferSize = 1 << 19;
+
+static void InitializeBuffers(Context* context) {
+  context->available_in = 0;
+  context->next_in = NULL;
+  context->available_out = kFileBufferSize;
+  context->next_out = context->output;
+  context->total_in = 0;
+  context->total_out = 0;
+  if (context->verbosity > 0) {
+    context->start_time = clock();
+  }
+}
+
+/* This method might give the false-negative result.
+   However, after an empty / incomplete read it should tell the truth. */
+static BROTLI_BOOL HasMoreInput(Context* context) {
+  return feof(context->fin) ? BROTLI_FALSE : BROTLI_TRUE;
+}
+
+static BROTLI_BOOL ProvideInput(Context* context) {
+  context->available_in =
+      fread(context->input, 1, kFileBufferSize, context->fin);
+  context->total_in += context->available_in;
+  context->next_in = context->input;
+  if (ferror(context->fin)) {
+    fprintf(stderr, "failed to read input [%s]: %s\n",
+            PrintablePath(context->current_input_path), strerror(errno));
+    return BROTLI_FALSE;
+  }
+  return BROTLI_TRUE;
+}
+
+/* Internal: should be used only in Provide-/Flush-Output. */
+static BROTLI_BOOL WriteOutput(Context* context) {
+  size_t out_size = (size_t)(context->next_out - context->output);
+  context->total_out += out_size;
+  if (out_size == 0) return BROTLI_TRUE;
+  if (context->test_integrity) return BROTLI_TRUE;
+
+  fwrite(context->output, 1, out_size, context->fout);
+  if (ferror(context->fout)) {
+    fprintf(stderr, "failed to write output [%s]: %s\n",
+            PrintablePath(context->current_output_path), strerror(errno));
+    return BROTLI_FALSE;
+  }
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL ProvideOutput(Context* context) {
+  if (!WriteOutput(context)) return BROTLI_FALSE;
+  context->available_out = kFileBufferSize;
+  context->next_out = context->output;
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL FlushOutput(Context* context) {
+  if (!WriteOutput(context)) return BROTLI_FALSE;
+  context->available_out = 0;
+  context->next_out = context->output;
+  return BROTLI_TRUE;
+}
+
+static void PrintBytes(size_t value) {
+  if (value < 1024) {
+    fprintf(stderr, "%d B", (int)value);
+  } else if (value < 1048576) {
+    fprintf(stderr, "%0.3f KiB", (double)value / 1024.0);
+  } else if (value < 1073741824) {
+    fprintf(stderr, "%0.3f MiB", (double)value / 1048576.0);
+  } else {
+    fprintf(stderr, "%0.3f GiB", (double)value / 1073741824.0);
+  }
+}
+
+static void PrintFileProcessingProgress(Context* context) {
+  fprintf(stderr, "[%s]: ", PrintablePath(context->current_input_path));
+  PrintBytes(context->total_in);
+  fprintf(stderr, " -> ");
+  PrintBytes(context->total_out);
+  fprintf(stderr, " in %1.2f sec", (double)(context->end_time - context->start_time) / CLOCKS_PER_SEC);
+}
+
+static const char* PrettyDecoderErrorString(BrotliDecoderErrorCode code) {
+  /* "_ERROR_domain_" is in only added in newer versions. If CLI is linked
+     against older shared library, return error string as is; result might be
+     a bit confusing, e.g. "RESERVED" instead of "FORMAT_RESERVED" */
+  const char* prefix = "_ERROR_";
+  size_t prefix_len = strlen(prefix);
+  const char* error_str = BrotliDecoderErrorString(code);
+  size_t error_len = strlen(error_str);
+  if (error_len > prefix_len) {
+    if (strncmp(error_str, prefix, prefix_len) == 0) {
+      error_str += prefix_len;
+    }
+  }
+  return error_str;
+}
+
+static void OnMetadataStart(void* opaque, size_t size) {
+  Context* context = (Context*) opaque;
+  if (context->comment_state == COMMENT_INIT) {
+    if (context->comment_len != size) {
+      context->comment_state = COMMENT_BAD;
+      return;
+    }
+    context->comment_pos = 0;
+    context->comment_state = COMMENT_READ;
+  }
+}
+
+static void OnMetadataChunk(void* opaque, const uint8_t* data, size_t size) {
+  Context* context = (Context*) opaque;
+  if (context->comment_state == COMMENT_READ) {
+    size_t i;
+    for (i = 0; i < size; ++i) {
+      if (context->comment_pos >= context->comment_len) {
+        context->comment_state = COMMENT_BAD;
+        return;
+      }
+      if (context->comment[context->comment_pos++] != data[i]) {
+        context->comment_state = COMMENT_BAD;
+        return;
+      }
+    }
+    if (context->comment_pos == context->comment_len) {
+      context->comment_state = COMMENT_OK;
+    }
+  }
+}
+
+static BROTLI_BOOL InitDecoder(Context* context) {
+  context->decoder = BrotliDecoderCreateInstance(NULL, NULL, NULL);
+  if (!context->decoder) {
+    fprintf(stderr, "out of memory\n");
+    return BROTLI_FALSE;
+  }
+  /* This allows decoding "large-window" streams. Though it creates
+      fragmentation (new builds decode streams that old builds don't),
+      it is better from used experience perspective. */
+  BrotliDecoderSetParameter(
+      context->decoder, BROTLI_DECODER_PARAM_LARGE_WINDOW, 1u);
+  if (context->dictionary) {
+    BrotliDecoderAttachDictionary(context->decoder,
+        BROTLI_SHARED_DICTIONARY_RAW, context->dictionary_size,
+        context->dictionary);
+  }
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL DecompressFile(Context* context) {
+  BrotliDecoderState* s = context->decoder;
+  BrotliDecoderResult result = BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT;
+  if (context->comment_len) {
+    context->comment_state = COMMENT_INIT;
+    BrotliDecoderSetMetadataCallbacks(s, &OnMetadataStart, &OnMetadataChunk,
+        (void*)context);
+  } else {
+    context->comment_state = COMMENT_OK;
+  }
+
+  InitializeBuffers(context);
+  for (;;) {
+    /* Early check */
+    if (context->comment_state == COMMENT_BAD) {
+      fprintf(stderr, "corrupt input [%s]\n",
+              PrintablePath(context->current_input_path));
+      if (context->verbosity > 0) {
+        fprintf(stderr, "reason: comment mismatch\n");
+      }
+      return BROTLI_FALSE;
+    }
+    if (result == BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT) {
+      if (!HasMoreInput(context)) {
+        fprintf(stderr, "corrupt input [%s]\n",
+                PrintablePath(context->current_input_path));
+        if (context->verbosity > 0) {
+          fprintf(stderr, "reason: truncated input\n");
+        }
+        return BROTLI_FALSE;
+      }
+      if (!ProvideInput(context)) return BROTLI_FALSE;
+    } else if (result == BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT) {
+      if (!ProvideOutput(context)) return BROTLI_FALSE;
+    } else if (result == BROTLI_DECODER_RESULT_SUCCESS) {
+      if (!FlushOutput(context)) return BROTLI_FALSE;
+      BROTLI_BOOL has_more_input = (context->available_in != 0);
+      int extra_char = EOF;
+      if (!has_more_input) {
+        extra_char = fgetc(context->fin);
+        if (extra_char != EOF) {
+          has_more_input = BROTLI_TRUE;
+          context->input[0] = (uint8_t)extra_char;
+          context->next_in = context->input;
+          context->available_in = 1;
+        }
+      }
+      if (has_more_input) {
+        if (context->allow_concatenated) {
+          if (context->verbosity > 0) {
+            fprintf(stderr, "extra input\n");
+          }
+          if (!ProvideOutput(context)) return BROTLI_FALSE;
+          BrotliDecoderDestroyInstance(context->decoder);
+          context->decoder = NULL;
+          if (!InitDecoder(context)) return BROTLI_FALSE;
+          s = context->decoder;
+        } else {
+          fprintf(stderr, "corrupt input [%s]\n",
+                  PrintablePath(context->current_input_path));
+          if (context->verbosity > 0) {
+            fprintf(stderr, "reason: extra input\n");
+          }
+          return BROTLI_FALSE;
+        }
+      } else {
+        if (context->verbosity > 0) {
+          context->end_time = clock();
+          fprintf(stderr, "Decompressed ");
+          PrintFileProcessingProgress(context);
+          fprintf(stderr, "\n");
+        }
+        /* Final check */
+        if (context->comment_state != COMMENT_OK) {
+          fprintf(stderr, "corrupt input [%s]\n",
+                  PrintablePath(context->current_input_path));
+          if (context->verbosity > 0) {
+            fprintf(stderr, "reason: comment mismatch\n");
+          }
+        }
+        return BROTLI_TRUE;
+      }
+    } else {  /* result == BROTLI_DECODER_RESULT_ERROR */
+      fprintf(stderr, "corrupt input [%s]\n",
+              PrintablePath(context->current_input_path));
+      if (context->verbosity > 0) {
+        BrotliDecoderErrorCode error = BrotliDecoderGetErrorCode(s);
+        const char* error_str = PrettyDecoderErrorString(error);
+        fprintf(stderr, "reason: %s (%d)\n", error_str, error);
+      }
+      return BROTLI_FALSE;
+    }
+
+    result = BrotliDecoderDecompressStream(s, &context->available_in,
+        &context->next_in, &context->available_out, &context->next_out, 0);
+  }
+}
+
+static BROTLI_BOOL DecompressFiles(Context* context) {
+  while (NextFile(context)) {
+    BROTLI_BOOL is_ok = BROTLI_TRUE;
+    BROTLI_BOOL rm_input = BROTLI_FALSE;
+    BROTLI_BOOL rm_output = BROTLI_TRUE;
+    if (!InitDecoder(context)) return BROTLI_FALSE;
+    is_ok = OpenFiles(context);
+    if (is_ok && !context->current_input_path &&
+        !context->force_overwrite && isatty(STDIN_FILENO)) {
+      fprintf(stderr, "Use -h help. Use -f to force input from a terminal.\n");
+      is_ok = BROTLI_FALSE;
+    }
+    if (is_ok) is_ok = DecompressFile(context);
+    if (context->decoder) BrotliDecoderDestroyInstance(context->decoder);
+    context->decoder = NULL;
+    rm_output = !is_ok;
+    rm_input = !rm_output && context->junk_source;
+    if (!CloseFiles(context, rm_input, rm_output)) is_ok = BROTLI_FALSE;
+    if (!is_ok) return BROTLI_FALSE;
+  }
+  return BROTLI_TRUE;
+}
+
+static BROTLI_BOOL CompressFile(Context* context, BrotliEncoderState* s) {
+  BROTLI_BOOL is_eof = BROTLI_FALSE;
+  BROTLI_BOOL prologue = !!context->comment_len;
+  InitializeBuffers(context);
+  for (;;) {
+    if (context->available_in == 0 && !is_eof) {
+      if (!ProvideInput(context)) return BROTLI_FALSE;
+      is_eof = !HasMoreInput(context);
+    }
+
+    if (prologue) {
+      prologue = BROTLI_FALSE;
+      const uint8_t* next_meta = context->comment;
+      size_t available_meta = context->comment_len;
+      if (!BrotliEncoderCompressStream(s,
+          BROTLI_OPERATION_EMIT_METADATA,
+          &available_meta, &next_meta,
+          &context->available_out, &context->next_out, NULL)) {
+        /* Should detect OOM? */
+        fprintf(stderr, "failed to emit metadata [%s]\n",
+                PrintablePath(context->current_input_path));
+        return BROTLI_FALSE;
+      }
+      if (available_meta != 0) {
+        fprintf(stderr, "failed to emit metadata [%s]\n",
+                PrintablePath(context->current_input_path));
+        return BROTLI_FALSE;
+      }
+    } else {
+      if (!BrotliEncoderCompressStream(s,
+          is_eof ? BROTLI_OPERATION_FINISH : BROTLI_OPERATION_PROCESS,
+          &context->available_in, &context->next_in,
+          &context->available_out, &context->next_out, NULL)) {
+        /* Should detect OOM? */
+        fprintf(stderr, "failed to compress data [%s]\n",
+                PrintablePath(context->current_input_path));
+        return BROTLI_FALSE;
+      }
+    }
+
+    if (context->available_out == 0) {
+      if (!ProvideOutput(context)) return BROTLI_FALSE;
+    }
+
+    if (BrotliEncoderIsFinished(s)) {
+      if (!FlushOutput(context)) return BROTLI_FALSE;
+      if (context->verbosity > 0) {
+        context->end_time = clock();
+        fprintf(stderr, "Compressed ");
+        PrintFileProcessingProgress(context);
+        fprintf(stderr, "\n");
+      }
+      return BROTLI_TRUE;
+    }
+  }
+}
+
+static BROTLI_BOOL CompressFiles(Context* context) {
+  while (NextFile(context)) {
+    BROTLI_BOOL is_ok = BROTLI_TRUE;
+    BROTLI_BOOL rm_input = BROTLI_FALSE;
+    BROTLI_BOOL rm_output = BROTLI_TRUE;
+    BrotliEncoderState* s = BrotliEncoderCreateInstance(NULL, NULL, NULL);
+    if (!s) {
+      fprintf(stderr, "out of memory\n");
+      return BROTLI_FALSE;
+    }
+    BrotliEncoderSetParameter(s,
+        BROTLI_PARAM_QUALITY, (uint32_t)context->quality);
+    if (context->lgwin > 0) {
+      /* Specified by user. */
+      /* Do not enable "large-window" extension, if not required. */
+      if (context->lgwin > BROTLI_MAX_WINDOW_BITS) {
+        BrotliEncoderSetParameter(s, BROTLI_PARAM_LARGE_WINDOW, 1u);
+      }
+      BrotliEncoderSetParameter(s,
+          BROTLI_PARAM_LGWIN, (uint32_t)context->lgwin);
+    } else {
+      /* 0, or not specified by user; could be chosen by compressor. */
+      uint32_t lgwin = DEFAULT_LGWIN;
+      /* Use file size to limit lgwin. */
+      if (context->input_file_length >= 0) {
+        lgwin = BROTLI_MIN_WINDOW_BITS;
+        while (BROTLI_MAX_BACKWARD_LIMIT(lgwin) <
+               (uint64_t)context->input_file_length) {
+          lgwin++;
+          if (lgwin == BROTLI_MAX_WINDOW_BITS) break;
+        }
+      }
+      BrotliEncoderSetParameter(s, BROTLI_PARAM_LGWIN, lgwin);
+    }
+    if (context->input_file_length > 0) {
+      uint32_t size_hint = context->input_file_length < (1 << 30) ?
+          (uint32_t)context->input_file_length : (1u << 30);
+      BrotliEncoderSetParameter(s, BROTLI_PARAM_SIZE_HINT, size_hint);
+    }
+    if (context->dictionary) {
+      BrotliEncoderAttachPreparedDictionary(s, context->prepared_dictionary);
+    }
+    is_ok = OpenFiles(context);
+    if (is_ok && !context->current_output_path &&
+        !context->force_overwrite && isatty(STDOUT_FILENO)) {
+      fprintf(stderr, "Use -h help. Use -f to force output to a terminal.\n");
+      is_ok = BROTLI_FALSE;
+    }
+    if (is_ok) is_ok = CompressFile(context, s);
+    BrotliEncoderDestroyInstance(s);
+    rm_output = !is_ok;
+    if (is_ok && context->reject_uncompressible) {
+      if (context->total_out >= context->total_in) {
+        rm_output = BROTLI_TRUE;
+        if (context->verbosity > 0) {
+          fprintf(stderr, "Output is larger than input\n");
+        }
+      }
+    }
+    rm_input = !rm_output && context->junk_source;
+    if (!CloseFiles(context, rm_input, rm_output)) is_ok = BROTLI_FALSE;
+    if (!is_ok) return BROTLI_FALSE;
+  }
+  return BROTLI_TRUE;
+}
+
+int main(int argc, char** argv) {
+  Command command;
+  Context context;
+  BROTLI_BOOL is_ok = BROTLI_TRUE;
+  int i;
+
+  context.quality = 11;
+  context.lgwin = -1;
+  context.verbosity = 0;
+  context.comment_len = 0;
+  context.force_overwrite = BROTLI_FALSE;
+  context.junk_source = BROTLI_FALSE;
+  context.reject_uncompressible = BROTLI_FALSE;
+  context.copy_stat = BROTLI_TRUE;
+  context.test_integrity = BROTLI_FALSE;
+  context.write_to_stdout = BROTLI_FALSE;
+  context.decompress = BROTLI_FALSE;
+  context.large_window = BROTLI_FALSE;
+  context.allow_concatenated = BROTLI_FALSE;
+  context.output_path = NULL;
+  context.dictionary_path = NULL;
+  context.suffix = DEFAULT_SUFFIX;
+  for (i = 0; i < MAX_OPTIONS; ++i) context.not_input_indices[i] = 0;
+  context.longest_path_len = 1;
+  context.input_count = 0;
+
+  context.argc = argc;
+  context.argv = argv;
+  context.dictionary = NULL;
+  context.dictionary_size = 0;
+  context.decoder = NULL;
+  context.prepared_dictionary = NULL;
+  context.modified_path = NULL;
+  context.iterator = 0;
+  context.ignore = 0;
+  context.iterator_error = BROTLI_FALSE;
+  context.buffer = NULL;
+  context.current_input_path = NULL;
+  context.current_output_path = NULL;
+  context.fin = NULL;
+  context.fout = NULL;
+
+  command = ParseParams(&context);
+
+  if (command == COMMAND_COMPRESS || command == COMMAND_DECOMPRESS ||
+      command == COMMAND_TEST_INTEGRITY) {
+    if (!ReadDictionary(&context, command)) is_ok = BROTLI_FALSE;
+    if (is_ok) {
+      size_t modified_path_len =
+          context.longest_path_len + strlen(context.suffix) + 1;
+      context.modified_path = (char*)malloc(modified_path_len);
+      context.buffer = (uint8_t*)malloc(kFileBufferSize * 2);
+      if (!context.modified_path || !context.buffer) {
+        fprintf(stderr, "out of memory\n");
+        is_ok = BROTLI_FALSE;
+      } else {
+        context.input = context.buffer;
+        context.output = context.buffer + kFileBufferSize;
+      }
+    }
+  }
+
+  if (!is_ok) command = COMMAND_NOOP;
+
+  switch (command) {
+    case COMMAND_NOOP:
+      break;
+
+    case COMMAND_VERSION:
+      PrintVersion();
+      break;
+
+    case COMMAND_COMPRESS:
+      is_ok = CompressFiles(&context);
+      break;
+
+    case COMMAND_DECOMPRESS:
+    case COMMAND_TEST_INTEGRITY:
+      is_ok = DecompressFiles(&context);
+      break;
+
+    case COMMAND_HELP:
+    case COMMAND_INVALID:
+    default:
+      is_ok = (command == COMMAND_HELP);
+      PrintHelp(FileName(argv[0]), is_ok);
+      break;
+  }
+
+  if (context.iterator_error) is_ok = BROTLI_FALSE;
+
+  BrotliEncoderDestroyPreparedDictionary(context.prepared_dictionary);
+  free(context.dictionary);
+  free(context.modified_path);
+  free(context.buffer);
+
+  if (!is_ok) exit(1);
+  return 0;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/tools/brotli.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/tools/brotli.md
new file mode 100644
index 0000000000..8792314ee1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/c/tools/brotli.md
@@ -0,0 +1,116 @@
+# NAME
+
+brotli(1) -- brotli, brcat, unbrotli - compress or decompress files
+
+# SYNOPSIS
+
+`brotli` [*OPTION|FILE*]...
+
+`brcat` is equivalent to `brotli --decompress --concatenated --stdout`
+
+`unbrotli` is equivalent to `brotli --decompress`
+
+# DESCRIPTION
+
+`brotli` is a generic-purpose lossless compression algorithm that compresses
+data using a combination of a modern variant of the **LZ77** algorithm, Huffman
+coding and 2-nd order context modeling, with a compression ratio comparable to
+the best currently available general-purpose compression methods. It is similar
+in speed with deflate but offers more dense compression.
+
+`brotli` command line syntax similar to `gzip (1)` and `zstd (1)`.
+Unlike `gzip (1)`, source files are preserved by default. It is possible to
+remove them after processing by using the `--rm` _option_.
+
+Arguments that look like "`--name`" or "`--name=value`" are _options_. Every
+_option_ has a short form "`-x`" or "`-x value`". Multiple short form _options_
+could be coalesced:
+
+* "`--decompress --stdout --suffix=.b`" works the same as
+* "`-d -s -S .b`" and
+* "`-dsS .b`"
+
+`brotli` has 3 operation modes:
+
+* default mode is compression;
+* `--decompress` option activates decompression mode;
+* `--test` option switches to integrity test mode; this option is equivalent to
+  "`--decompress --stdout`" except that the decompressed data is discarded
+  instead of being written to standard output.
+
+Every non-option argument is a _file_ entry. If no _files_ are given or _file_
+is "`-`", `brotli` reads from standard input. All arguments after "`--`" are
+_file_ entries.
+
+Unless `--stdout` or `--output` is specified, _files_ are written to a new file
+whose name is derived from the source _file_ name:
+
+* when compressing, a suffix is appended to the source filename to
+  get the target filename
+* when decompressing, a suffix is removed from the source filename to
+  get the target filename
+
+Default suffix is `.br`, but it could be specified with `--suffix` option.
+
+Conflicting or duplicate _options_ are not allowed.
+
+# OPTIONS
+
+* `-#`:
+    compression level (0-9); bigger values cause denser, but slower compression
+* `-c`, `--stdout`:
+    write on standard output
+* `-d`, `--decompress`:
+    decompress mode
+* `-f`, `--force`:
+    force output file overwrite
+* `-h`, `--help`:
+    display this help and exit
+* `-j`, `--rm`:
+    remove source file(s); `gzip (1)`-like behaviour
+* `-k`, `--keep`:
+    keep source file(s); `zstd (1)`-like behaviour
+* `-n`, `--no-copy-stat`:
+    do not copy source file(s) attributes
+* `-o FILE`, `--output=FILE`
+    output file; valid only if there is a single input entry
+* `-q NUM`, `--quality=NUM`:
+    compression level (0-11); bigger values cause denser, but slower compression
+* `-t`, `--test`:
+    test file integrity mode
+* `-v`, `--verbose`:
+    increase output verbosity
+* `-w NUM`, `--lgwin=NUM`:
+    set LZ77 window size (0, 10-24) (default: 24); window size is
+    `(pow(2, NUM) - 16)`; 0 lets compressor decide over the optimal value;
+    bigger windows size improve density; decoder might require up to window size
+    memory to operate
+* `-C B64`, `--comment=B64`:
+    set comment; argument is base64-decoded first;
+    when decoding: check stream comment;
+    when encoding: embed comment (fingerprint)
+* `-D FILE`, `--dictionary=FILE`:
+    use FILE as raw (LZ77) dictionary; same dictionary MUST be used both for
+    compression and decompression
+* `-K`, `--concatenated`:
+    when decoding, allow concatenated brotli streams as input
+* `-S SUF`, `--suffix=SUF`:
+    output file suffix (default: `.br`)
+* `-V`, `--version`:
+    display version and exit
+* `-Z`, `--best`:
+    use best compression level (default); same as "`-q 11`"
+
+# SEE ALSO
+
+`brotli` file format is defined in
+[RFC 7932](https://www.ietf.org/rfc/rfc7932.txt).
+
+`brotli` is open-sourced under the
+[MIT License](https://opensource.org/licenses/MIT).
+
+Mailing list: https://groups.google.com/forum/#!forum/brotli
+
+# BUGS
+
+Report bugs at: https://github.com/google/brotli/issues
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/brotli-comparison-study-2015-09-22.pdf b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/brotli-comparison-study-2015-09-22.pdf
new file mode 100644
index 0000000000..040f179e2b
Binary files /dev/null and b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/brotli-comparison-study-2015-09-22.pdf differ
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/brotli.1 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/brotli.1
new file mode 100644
index 0000000000..14a4de1faa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/brotli.1
@@ -0,0 +1,139 @@
+.\" Automatically generated by Pandoc 2.7.3
+.\"
+.TH "brotli" "1" "August 14 2021" "brotli 1.0.9" "User Manual"
+.hy
+.SH NAME
+.PP
+brotli(1) -- brotli, brcat, unbrotli - compress or decompress files
+.SH SYNOPSIS
+.PP
+\f[B]brotli\f[R] [\f[I]OPTION|FILE\f[R]]\&...
+.PP
+\f[B]brcat\f[R] is equivalent to \f[B]brotli --decompress --concatenated
+--stdout\f[R]
+.PP
+\f[B]unbrotli\f[R] is equivalent to \f[B]brotli --decompress\f[R]
+.SH DESCRIPTION
+.PP
+\f[B]brotli\f[R] is a generic-purpose lossless compression algorithm
+that compresses data using a combination of a modern variant of the
+\f[B]LZ77\f[R] algorithm, Huffman coding and 2-nd order context
+modeling, with a compression ratio comparable to the best currently
+available general-purpose compression methods.
+It is similar in speed with deflate but offers more dense compression.
+.PP
+\f[B]brotli\f[R] command line syntax similar to \f[B]gzip (1)\f[R] and
+\f[B]zstd (1)\f[R].
+Unlike \f[B]gzip (1)\f[R], source files are preserved by default.
+It is possible to remove them after processing by using the
+\f[B]--rm\f[R] \f[I]option\f[R].
+.PP
+Arguments that look like \[lq]\f[B]--name\f[R]\[rq] or
+\[lq]\f[B]--name=value\f[R]\[rq] are \f[I]options\f[R].
+Every \f[I]option\f[R] has a short form \[lq]\f[B]-x\f[R]\[rq] or
+\[lq]\f[B]-x value\f[R]\[rq].
+Multiple short form \f[I]options\f[R] could be coalesced:
+.IP \[bu] 2
+\[lq]\f[B]--decompress --stdout --suffix=.b\f[R]\[rq] works the same as
+.IP \[bu] 2
+\[lq]\f[B]-d -s -S .b\f[R]\[rq] and
+.IP \[bu] 2
+\[lq]\f[B]-dsS .b\f[R]\[rq]
+.PP
+\f[B]brotli\f[R] has 3 operation modes:
+.IP \[bu] 2
+default mode is compression;
+.IP \[bu] 2
+\f[B]--decompress\f[R] option activates decompression mode;
+.IP \[bu] 2
+\f[B]--test\f[R] option switches to integrity test mode; this option is
+equivalent to \[lq]\f[B]--decompress --stdout\f[R]\[rq] except that the
+decompressed data is discarded instead of being written to standard
+output.
+.PP
+Every non-option argument is a \f[I]file\f[R] entry.
+If no \f[I]files\f[R] are given or \f[I]file\f[R] is
+\[lq]\f[B]-\f[R]\[rq], \f[B]brotli\f[R] reads from standard input.
+All arguments after \[lq]\f[B]--\f[R]\[rq] are \f[I]file\f[R] entries.
+.PP
+Unless \f[B]--stdout\f[R] or \f[B]--output\f[R] is specified,
+\f[I]files\f[R] are written to a new file whose name is derived from the
+source \f[I]file\f[R] name:
+.IP \[bu] 2
+when compressing, a suffix is appended to the source filename to get the
+target filename
+.IP \[bu] 2
+when decompressing, a suffix is removed from the source filename to get
+the target filename
+.PP
+Default suffix is \f[B].br\f[R], but it could be specified with
+\f[B]--suffix\f[R] option.
+.PP
+Conflicting or duplicate \f[I]options\f[R] are not allowed.
+.SH OPTIONS
+.IP \[bu] 2
+\f[B]-#\f[R]: compression level (0-9); bigger values cause denser, but
+slower compression
+.IP \[bu] 2
+\f[B]-c\f[R], \f[B]--stdout\f[R]: write on standard output
+.IP \[bu] 2
+\f[B]-d\f[R], \f[B]--decompress\f[R]: decompress mode
+.IP \[bu] 2
+\f[B]-f\f[R], \f[B]--force\f[R]: force output file overwrite
+.IP \[bu] 2
+\f[B]-h\f[R], \f[B]--help\f[R]: display this help and exit
+.IP \[bu] 2
+\f[B]-j\f[R], \f[B]--rm\f[R]: remove source file(s); \f[B]gzip
+(1)\f[R]-like behaviour
+.IP \[bu] 2
+\f[B]-k\f[R], \f[B]--keep\f[R]: keep source file(s); \f[B]zstd
+(1)\f[R]-like behaviour
+.IP \[bu] 2
+\f[B]-n\f[R], \f[B]--no-copy-stat\f[R]: do not copy source file(s)
+attributes
+.IP \[bu] 2
+\f[B]-o FILE\f[R], \f[B]--output=FILE\f[R] output file; valid only if
+there is a single input entry
+.IP \[bu] 2
+\f[B]-q NUM\f[R], \f[B]--quality=NUM\f[R]: compression level (0-11);
+bigger values cause denser, but slower compression
+.IP \[bu] 2
+\f[B]-t\f[R], \f[B]--test\f[R]: test file integrity mode
+.IP \[bu] 2
+\f[B]-v\f[R], \f[B]--verbose\f[R]: increase output verbosity
+.IP \[bu] 2
+\f[B]-w NUM\f[R], \f[B]--lgwin=NUM\f[R]: set LZ77 window size (0, 10-24)
+(default: 24); window size is \f[B](pow(2, NUM) - 16)\f[R]; 0 lets
+compressor decide over the optimal value; bigger windows size improve
+density; decoder might require up to window size memory to operate
+.IP \[bu] 2
+\f[B]-C B64\f[R], \f[B]--comment=B64\f[R]: set comment; argument is
+base64-decoded first; when decoding: check stream comment; when
+encoding: embed comment (fingerprint)
+.IP \[bu] 2
+\f[B]-D FILE\f[R], \f[B]--dictionary=FILE\f[R]: use FILE as raw (LZ77)
+dictionary; same dictionary MUST be used both for compression and
+decompression
+.IP \[bu] 2
+\f[B]-K\f[R], \f[B]--concatenated\f[R]: when decoding, allow
+concatenated brotli streams as input
+.IP \[bu] 2
+\f[B]-S SUF\f[R], \f[B]--suffix=SUF\f[R]: output file suffix (default:
+\f[B].br\f[R])
+.IP \[bu] 2
+\f[B]-V\f[R], \f[B]--version\f[R]: display version and exit
+.IP \[bu] 2
+\f[B]-Z\f[R], \f[B]--best\f[R]: use best compression level (default);
+same as \[lq]\f[B]-q 11\f[R]\[rq]
+.SH SEE ALSO
+.PP
+\f[B]brotli\f[R] file format is defined in RFC
+7932 (https://www.ietf.org/rfc/rfc7932.txt).
+.PP
+\f[B]brotli\f[R] is open-sourced under the MIT
+License (https://opensource.org/licenses/MIT).
+.PP
+Mailing list: https://groups.google.com/forum/#!forum/brotli
+.SH BUGS
+.PP
+Report bugs at: https://github.com/google/brotli/issues
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/brotli.svg b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/brotli.svg
new file mode 100644
index 0000000000..3732d96c99
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/brotli.svg
@@ -0,0 +1 @@
+<svg xmlns="http://www.w3.org/2000/svg" fill="#fff" viewBox="0 0 512 512"><g transform="rotate(15 -844 1100)scale(24)"><circle fill="#ea3" r="10"/><ellipse rx="2" ry="8"/><ellipse rx="1" ry="4" cx="5"/><ellipse rx="1" ry="4" cx="-5"/></g></svg>
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/constants.h.3 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/constants.h.3
new file mode 100644
index 0000000000..1b29f28c98
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/constants.h.3
@@ -0,0 +1,47 @@
+.TH "constants.h" 3 "August 2021" "Brotli" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+constants.h \- Common constants used in decoder and encoder API\&.  
+
+.SH SYNOPSIS
+.br
+.PP
+.SS "Macros"
+
+.in +1c
+.ti -1c
+.RI "#define \fBBROTLI_LARGE_MAX_DISTANCE_BITS\fP   62U"
+.br
+.RI "\fIThe theoretical maximum number of distance bits specified for large window brotli, for 64-bit encoders and decoders\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_LARGE_MAX_WBITS\fP   30"
+.br
+.RI "\fIThe maximum supported large brotli window bits by the encoder and decoder\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_MAX_NPOSTFIX\fP   3"
+.br
+.RI "\fIMaximal number of 'postfix' bits\&. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Common constants used in decoder and encoder API\&. 
+
+
+.SH "Macro Definition Documentation"
+.PP 
+.SS "#define BROTLI_LARGE_MAX_DISTANCE_BITS   62U"
+
+.PP
+The theoretical maximum number of distance bits specified for large window brotli, for 64-bit encoders and decoders\&. Even when in practice 32-bit encoders and decoders only support up to 30 max distance bits, the value is set to 62 because it affects the large window brotli file format\&. Specifically, it affects the encoding of simple huffman tree for distances, see Specification RFC 7932 chapter 3\&.4\&. 
+.SS "#define BROTLI_LARGE_MAX_WBITS   30"
+
+.PP
+The maximum supported large brotli window bits by the encoder and decoder\&. Large window brotli allows up to 62 bits, however the current encoder and decoder, designed for 32-bit integers, only support up to 30 bits maximum\&. 
+.SS "#define BROTLI_MAX_NPOSTFIX   3"
+
+.PP
+Maximal number of 'postfix' bits\&. Number of 'postfix' bits is stored as 2 bits in meta-block header\&. 
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for Brotli from the source code\&.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/decode.h.3 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/decode.h.3
new file mode 100644
index 0000000000..30929e9721
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/decode.h.3
@@ -0,0 +1,505 @@
+.TH "decode.h" 3 "August 2021" "Brotli" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+decode.h \- API for Brotli decompression\&.  
+
+.SH SYNOPSIS
+.br
+.PP
+.SS "Macros"
+
+.in +1c
+.ti -1c
+.RI "#define \fBBROTLI_DECODER_ERROR_CODES_LIST\fP(BROTLI_ERROR_CODE,  SEPARATOR)        "
+.br
+.RI "\fITemplate that evaluates items of \fBBrotliDecoderErrorCode\fP\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_LAST_ERROR_CODE\fP   BROTLI_DECODER_ERROR_UNREACHABLE"
+.br
+.RI "\fIThe value of the last error code, negative integer\&. \fP"
+.in -1c
+.SS "Typedefs"
+
+.in +1c
+.ti -1c
+.RI "typedef void(* \fBbrotli_decoder_metadata_chunk_func\fP) (void *opaque, const uint8_t *data, size_t size)"
+.br
+.RI "\fICallback to fire on metadata block chunk becomes available\&. \fP"
+.ti -1c
+.RI "typedef void(* \fBbrotli_decoder_metadata_start_func\fP) (void *opaque, size_t size)"
+.br
+.RI "\fICallback to fire on metadata block start\&. \fP"
+.ti -1c
+.RI "typedef enum \fBBrotliDecoderParameter\fP \fBBrotliDecoderParameter\fP"
+.br
+.RI "\fIOptions to be used with \fBBrotliDecoderSetParameter\fP\&. \fP"
+.ti -1c
+.RI "typedef struct BrotliDecoderStateStruct \fBBrotliDecoderState\fP"
+.br
+.RI "\fIOpaque structure that holds decoder state\&. \fP"
+.in -1c
+.SS "Enumerations"
+.SS "Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliDecoderAttachDictionary\fP (\fBBrotliDecoderState\fP *state, BrotliSharedDictionaryType type, size_t data_size, const uint8_t data[data_size])"
+.br
+.RI "\fIAdds LZ77 prefix dictionary, adds or replaces built-in static dictionary and transforms\&. \fP"
+.ti -1c
+.RI "\fBBrotliDecoderState\fP * \fBBrotliDecoderCreateInstance\fP (\fBbrotli_alloc_func\fP alloc_func, \fBbrotli_free_func\fP free_func, void *opaque)"
+.br
+.RI "\fICreates an instance of \fBBrotliDecoderState\fP and initializes it\&. \fP"
+.ti -1c
+.RI "\fBBrotliDecoderResult\fP \fBBrotliDecoderDecompress\fP (size_t encoded_size, const uint8_t encoded_buffer[encoded_size], size_t *decoded_size, uint8_t decoded_buffer[*decoded_size])"
+.br
+.RI "\fIPerforms one-shot memory-to-memory decompression\&. \fP"
+.ti -1c
+.RI "\fBBrotliDecoderResult\fP \fBBrotliDecoderDecompressStream\fP (\fBBrotliDecoderState\fP *state, size_t *available_in, const uint8_t **next_in, size_t *available_out, uint8_t **next_out, size_t *total_out)"
+.br
+.RI "\fIDecompresses the input stream to the output stream\&. \fP"
+.ti -1c
+.RI "void \fBBrotliDecoderDestroyInstance\fP (\fBBrotliDecoderState\fP *state)"
+.br
+.RI "\fIDeinitializes and frees \fBBrotliDecoderState\fP instance\&. \fP"
+.ti -1c
+.RI "const char * \fBBrotliDecoderErrorString\fP (\fBBrotliDecoderErrorCode\fP c)"
+.br
+.RI "\fIConverts error code to a c-string\&. \fP"
+.ti -1c
+.RI "\fBBrotliDecoderErrorCode\fP \fBBrotliDecoderGetErrorCode\fP (const \fBBrotliDecoderState\fP *state)"
+.br
+.RI "\fIAcquires a detailed error code\&. \fP"
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliDecoderHasMoreOutput\fP (const \fBBrotliDecoderState\fP *state)"
+.br
+.RI "\fIChecks if decoder has more output\&. \fP"
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliDecoderIsFinished\fP (const \fBBrotliDecoderState\fP *state)"
+.br
+.RI "\fIChecks if decoder instance reached the final state\&. \fP"
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliDecoderIsUsed\fP (const \fBBrotliDecoderState\fP *state)"
+.br
+.RI "\fIChecks if instance has already consumed input\&. \fP"
+.ti -1c
+.RI "void \fBBrotliDecoderSetMetadataCallbacks\fP (\fBBrotliDecoderState\fP *state, \fBbrotli_decoder_metadata_start_func\fP start_func, \fBbrotli_decoder_metadata_chunk_func\fP chunk_func, void *opaque)"
+.br
+.RI "\fISets callback for receiving metadata blocks\&. \fP"
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliDecoderSetParameter\fP (\fBBrotliDecoderState\fP *state, \fBBrotliDecoderParameter\fP param, uint32_t value)"
+.br
+.RI "\fISets the specified parameter to the given decoder instance\&. \fP"
+.ti -1c
+.RI "const uint8_t * \fBBrotliDecoderTakeOutput\fP (\fBBrotliDecoderState\fP *state, size_t *size)"
+.br
+.RI "\fIAcquires pointer to internal output buffer\&. \fP"
+.ti -1c
+.RI "uint32_t \fBBrotliDecoderVersion\fP (void)"
+.br
+.RI "\fIGets a decoder library version\&. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+API for Brotli decompression\&. 
+
+
+.SH "Macro Definition Documentation"
+.PP 
+.SS "#define BROTLI_DECODER_ERROR_CODES_LIST(BROTLI_ERROR_CODE, SEPARATOR)"
+
+.PP
+Template that evaluates items of \fBBrotliDecoderErrorCode\fP\&. Example:
+.PP
+.nf
+// Log Brotli error code\&.
+switch (brotliDecoderErrorCode) {
+#define CASE_(PREFIX, NAME, CODE) \
+  case BROTLI_DECODER ## PREFIX ## NAME: \
+    LOG(INFO) << "error code:" << #NAME; \
+    break;
+#define NEWLINE_
+BROTLI_DECODER_ERROR_CODES_LIST(CASE_, NEWLINE_)
+#undef CASE_
+#undef NEWLINE_
+  default: LOG(FATAL) << "unknown brotli error code";
+}
+
+.fi
+.PP
+ 
+.SS "#define BROTLI_LAST_ERROR_CODE   BROTLI_DECODER_ERROR_UNREACHABLE"
+
+.PP
+The value of the last error code, negative integer\&. All other error code values are in the range from \fBBROTLI_LAST_ERROR_CODE\fP to \fC-1\fP\&. There are also 4 other possible non-error codes \fC0\fP \&.\&. \fC3\fP in \fBBrotliDecoderErrorCode\fP enumeration\&. 
+.SH "Typedef Documentation"
+.PP 
+.SS "typedef void(* brotli_decoder_metadata_chunk_func) (void *opaque, const uint8_t *data, size_t size)"
+
+.PP
+Callback to fire on metadata block chunk becomes available\&. This function can be invoked multiple times per metadata block; block should be considered finished when sum of \fCsize\fP matches the announced metadata block size\&. Chunks contents pointed by \fCdata\fP are transient and shouln not be accessed after leaving the callback\&.
+.PP
+\fBParameters:\fP
+.RS 4
+\fIopaque\fP callback handle 
+.br
+\fIdata\fP pointer to metadata contents 
+.br
+\fIsize\fP size of metadata block chunk, at least \fC1\fP 
+.RE
+.PP
+
+.SS "typedef void(* brotli_decoder_metadata_start_func) (void *opaque, size_t size)"
+
+.PP
+Callback to fire on metadata block start\&. After this callback is fired, if \fCsize\fP is not \fC0\fP, it is followed by \fBbrotli_decoder_metadata_chunk_func\fP as more metadata block contents become accessible\&.
+.PP
+\fBParameters:\fP
+.RS 4
+\fIopaque\fP callback handle 
+.br
+\fIsize\fP size of metadata block 
+.RE
+.PP
+
+.SS "typedef enum \fBBrotliDecoderParameter\fP  \fBBrotliDecoderParameter\fP"
+
+.PP
+Options to be used with \fBBrotliDecoderSetParameter\fP\&. 
+.SS "typedef struct BrotliDecoderStateStruct \fBBrotliDecoderState\fP"
+
+.PP
+Opaque structure that holds decoder state\&. Allocated and initialized with \fBBrotliDecoderCreateInstance\fP\&. Cleaned up and deallocated with \fBBrotliDecoderDestroyInstance\fP\&. 
+.SH "Enumeration Type Documentation"
+.PP 
+.SS "enum \fBBrotliDecoderErrorCode\fP"
+
+.PP
+Error code for detailed logging / production debugging\&. See \fBBrotliDecoderGetErrorCode\fP and \fBBROTLI_LAST_ERROR_CODE\fP\&. 
+.SS "enum \fBBrotliDecoderParameter\fP"
+
+.PP
+Options to be used with \fBBrotliDecoderSetParameter\fP\&. 
+.PP
+\fBEnumerator\fP
+.in +1c
+.TP
+\fB\fIBROTLI_DECODER_PARAM_DISABLE_RING_BUFFER_REALLOCATION \fP\fP
+Disable 'canny' ring buffer allocation strategy\&. Ring buffer is allocated according to window size, despite the real size of the content\&. 
+.TP
+\fB\fIBROTLI_DECODER_PARAM_LARGE_WINDOW \fP\fP
+Flag that determines if 'Large Window Brotli' is used\&. 
+.SS "enum \fBBrotliDecoderResult\fP"
+
+.PP
+Result type for \fBBrotliDecoderDecompress\fP and \fBBrotliDecoderDecompressStream\fP functions\&. 
+.PP
+\fBEnumerator\fP
+.in +1c
+.TP
+\fB\fIBROTLI_DECODER_RESULT_ERROR \fP\fP
+Decoding error, e\&.g\&. corrupted input or memory allocation problem\&. 
+.TP
+\fB\fIBROTLI_DECODER_RESULT_SUCCESS \fP\fP
+Decoding successfully completed\&. 
+.TP
+\fB\fIBROTLI_DECODER_RESULT_NEEDS_MORE_INPUT \fP\fP
+Partially done; should be called again with more input\&. 
+.TP
+\fB\fIBROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT \fP\fP
+Partially done; should be called again with more output\&. 
+.SH "Function Documentation"
+.PP 
+.SS "\fBBROTLI_BOOL\fP BrotliDecoderAttachDictionary (\fBBrotliDecoderState\fP * state, BrotliSharedDictionaryType type, size_t data_size, const uint8_t data[data_size])"
+
+.PP
+Adds LZ77 prefix dictionary, adds or replaces built-in static dictionary and transforms\&. Attached dictionary ownership is not transferred\&. Data provided to this method should be kept accessible until decoding is finished and decoder instance is destroyed\&.
+.PP
+\fBNote:\fP
+.RS 4
+Dictionaries can NOT be attached after actual decoding is started\&.
+.RE
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance 
+.br
+\fItype\fP dictionary data format 
+.br
+\fIdata_size\fP length of memory region pointed by \fCdata\fP 
+.br
+\fIdata\fP dictionary data in format corresponding to \fCtype\fP 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_FALSE\fP if dictionary is corrupted, or dictionary count limit is reached 
+.PP
+\fBBROTLI_TRUE\fP if dictionary is accepted / attached 
+.RE
+.PP
+
+.SS "\fBBrotliDecoderState\fP* BrotliDecoderCreateInstance (\fBbrotli_alloc_func\fP alloc_func, \fBbrotli_free_func\fP free_func, void * opaque)"
+
+.PP
+Creates an instance of \fBBrotliDecoderState\fP and initializes it\&. The instance can be used once for decoding and should then be destroyed with \fBBrotliDecoderDestroyInstance\fP, it cannot be reused for a new decoding session\&.
+.PP
+\fCalloc_func\fP and \fCfree_func\fP \fBMUST\fP be both zero or both non-zero\&. In the case they are both zero, default memory allocators are used\&. \fCopaque\fP is passed to \fCalloc_func\fP and \fCfree_func\fP when they are called\&. \fCfree_func\fP has to return without doing anything when asked to free a NULL pointer\&.
+.PP
+\fBParameters:\fP
+.RS 4
+\fIalloc_func\fP custom memory allocation function 
+.br
+\fIfree_func\fP custom memory free function 
+.br
+\fIopaque\fP custom memory manager handle 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fC0\fP if instance can not be allocated or initialized 
+.PP
+pointer to initialized \fBBrotliDecoderState\fP otherwise 
+.RE
+.PP
+
+.SS "\fBBrotliDecoderResult\fP BrotliDecoderDecompress (size_t encoded_size, const uint8_t encoded_buffer[encoded_size], size_t * decoded_size, uint8_t decoded_buffer[*decoded_size])"
+
+.PP
+Performs one-shot memory-to-memory decompression\&. Decompresses the data in \fCencoded_buffer\fP into \fCdecoded_buffer\fP, and sets \fC*decoded_size\fP to the decompressed length\&.
+.PP
+\fBParameters:\fP
+.RS 4
+\fIencoded_size\fP size of \fCencoded_buffer\fP 
+.br
+\fIencoded_buffer\fP compressed data buffer with at least \fCencoded_size\fP addressable bytes 
+.br
+\fIdecoded_size\fP \fBin:\fP size of \fCdecoded_buffer\fP; 
+.br
+ \fBout:\fP length of decompressed data written to \fCdecoded_buffer\fP 
+.br
+\fIdecoded_buffer\fP decompressed data destination buffer 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_DECODER_RESULT_ERROR\fP if input is corrupted, memory allocation failed, or \fCdecoded_buffer\fP is not large enough; 
+.PP
+\fBBROTLI_DECODER_RESULT_SUCCESS\fP otherwise 
+.RE
+.PP
+
+.SS "\fBBrotliDecoderResult\fP BrotliDecoderDecompressStream (\fBBrotliDecoderState\fP * state, size_t * available_in, const uint8_t ** next_in, size_t * available_out, uint8_t ** next_out, size_t * total_out)"
+
+.PP
+Decompresses the input stream to the output stream\&. The values \fC*available_in\fP and \fC*available_out\fP must specify the number of bytes addressable at \fC*next_in\fP and \fC*next_out\fP respectively\&. When \fC*available_out\fP is \fC0\fP, \fCnext_out\fP is allowed to be \fCNULL\fP\&.
+.PP
+After each call, \fC*available_in\fP will be decremented by the amount of input bytes consumed, and the \fC*next_in\fP pointer will be incremented by that amount\&. Similarly, \fC*available_out\fP will be decremented by the amount of output bytes written, and the \fC*next_out\fP pointer will be incremented by that amount\&.
+.PP
+\fCtotal_out\fP, if it is not a null-pointer, will be set to the number of bytes decompressed since the last \fCstate\fP initialization\&.
+.PP
+\fBNote:\fP
+.RS 4
+Input is never overconsumed, so \fCnext_in\fP and \fCavailable_in\fP could be passed to the next consumer after decoding is complete\&.
+.RE
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance 
+.br
+\fIavailable_in\fP \fBin:\fP amount of available input; 
+.br
+ \fBout:\fP amount of unused input 
+.br
+\fInext_in\fP pointer to the next compressed byte 
+.br
+\fIavailable_out\fP \fBin:\fP length of output buffer; 
+.br
+ \fBout:\fP remaining size of output buffer 
+.br
+\fInext_out\fP output buffer cursor; can be \fCNULL\fP if \fCavailable_out\fP is \fC0\fP 
+.br
+\fItotal_out\fP number of bytes decompressed so far; can be \fCNULL\fP 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_DECODER_RESULT_ERROR\fP if input is corrupted, memory allocation failed, arguments were invalid, etc\&.; use \fBBrotliDecoderGetErrorCode\fP to get detailed error code 
+.PP
+\fBBROTLI_DECODER_RESULT_NEEDS_MORE_INPUT\fP decoding is blocked until more input data is provided 
+.PP
+\fBBROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT\fP decoding is blocked until more output space is provided 
+.PP
+\fBBROTLI_DECODER_RESULT_SUCCESS\fP decoding is finished, no more input might be consumed and no more output will be produced 
+.RE
+.PP
+
+.SS "void BrotliDecoderDestroyInstance (\fBBrotliDecoderState\fP * state)"
+
+.PP
+Deinitializes and frees \fBBrotliDecoderState\fP instance\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance to be cleaned up and deallocated 
+.RE
+.PP
+
+.SS "\fBBrotliDecoderErrorCode\fP BrotliDecoderGetErrorCode (const \fBBrotliDecoderState\fP * state)"
+
+.PP
+Acquires a detailed error code\&. Should be used only after \fBBrotliDecoderDecompressStream\fP returns \fBBROTLI_DECODER_RESULT_ERROR\fP\&.
+.PP
+See also \fBBrotliDecoderErrorString\fP
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+last saved error code 
+.RE
+.PP
+
+.SS "\fBBROTLI_BOOL\fP BrotliDecoderHasMoreOutput (const \fBBrotliDecoderState\fP * state)"
+
+.PP
+Checks if decoder has more output\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_TRUE\fP, if decoder has some unconsumed output 
+.PP
+\fBBROTLI_FALSE\fP otherwise 
+.RE
+.PP
+
+.SS "\fBBROTLI_BOOL\fP BrotliDecoderIsFinished (const \fBBrotliDecoderState\fP * state)"
+
+.PP
+Checks if decoder instance reached the final state\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_TRUE\fP if decoder is in a state where it reached the end of the input and produced all of the output 
+.PP
+\fBBROTLI_FALSE\fP otherwise 
+.RE
+.PP
+
+.SS "\fBBROTLI_BOOL\fP BrotliDecoderIsUsed (const \fBBrotliDecoderState\fP * state)"
+
+.PP
+Checks if instance has already consumed input\&. Instance that returns \fBBROTLI_FALSE\fP is considered 'fresh' and could be reused\&.
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_TRUE\fP if decoder has already used some input bytes 
+.PP
+\fBBROTLI_FALSE\fP otherwise 
+.RE
+.PP
+
+.SS "void BrotliDecoderSetMetadataCallbacks (\fBBrotliDecoderState\fP * state, \fBbrotli_decoder_metadata_start_func\fP start_func, \fBbrotli_decoder_metadata_chunk_func\fP chunk_func, void * opaque)"
+
+.PP
+Sets callback for receiving metadata blocks\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance 
+.br
+\fIstart_func\fP callback on metadata block start 
+.br
+\fIchunk_func\fP callback on metadata block chunk 
+.br
+\fIopaque\fP callback handle 
+.RE
+.PP
+
+.SS "\fBBROTLI_BOOL\fP BrotliDecoderSetParameter (\fBBrotliDecoderState\fP * state, \fBBrotliDecoderParameter\fP param, uint32_t value)"
+
+.PP
+Sets the specified parameter to the given decoder instance\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance 
+.br
+\fIparam\fP parameter to set 
+.br
+\fIvalue\fP new parameter value 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_FALSE\fP if parameter is unrecognized, or value is invalid 
+.PP
+\fBBROTLI_TRUE\fP if value is accepted 
+.RE
+.PP
+
+.SS "const uint8_t* BrotliDecoderTakeOutput (\fBBrotliDecoderState\fP * state, size_t * size)"
+
+.PP
+Acquires pointer to internal output buffer\&. This method is used to make language bindings easier and more efficient:
+.IP "1." 4
+push data to \fBBrotliDecoderDecompressStream\fP, until \fBBROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT\fP is reported
+.IP "2." 4
+use \fBBrotliDecoderTakeOutput\fP to peek bytes and copy to language-specific entity
+.PP
+.PP
+Also this could be useful if there is an output stream that is able to consume all the provided data (e\&.g\&. when data is saved to file system)\&.
+.PP
+\fBAttention:\fP
+.RS 4
+After every call to \fBBrotliDecoderTakeOutput\fP \fC*size\fP bytes of output are considered consumed for all consecutive calls to the instance methods; returned pointer becomes invalidated as well\&.
+.RE
+.PP
+\fBNote:\fP
+.RS 4
+Decoder output is not guaranteed to be contiguous\&. This means that after the size-unrestricted call to \fBBrotliDecoderTakeOutput\fP, immediate next call to \fBBrotliDecoderTakeOutput\fP may return more data\&.
+.RE
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance 
+.br
+\fIsize\fP \fBin:\fP number of bytes caller is ready to take, \fC0\fP if any amount could be handled; 
+.br
+ \fBout:\fP amount of data pointed by returned pointer and considered consumed; 
+.br
+ out value is never greater than in value, unless it is \fC0\fP 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+pointer to output data 
+.RE
+.PP
+
+.SS "uint32_t BrotliDecoderVersion (void)"
+
+.PP
+Gets a decoder library version\&. Look at BROTLI_MAKE_HEX_VERSION for more information\&. 
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for Brotli from the source code\&.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/encode.h.3 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/encode.h.3
new file mode 100644
index 0000000000..eea97d99fd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/encode.h.3
@@ -0,0 +1,630 @@
+.TH "encode.h" 3 "August 2021" "Brotli" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+encode.h \- API for Brotli compression\&.  
+
+.SH SYNOPSIS
+.br
+.PP
+.SS "Macros"
+
+.in +1c
+.ti -1c
+.RI "#define \fBBROTLI_DEFAULT_MODE\fP   \fBBROTLI_MODE_GENERIC\fP"
+.br
+.RI "\fIDefault value for \fBBROTLI_PARAM_MODE\fP parameter\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_DEFAULT_QUALITY\fP   11"
+.br
+.RI "\fIDefault value for \fBBROTLI_PARAM_QUALITY\fP parameter\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_DEFAULT_WINDOW\fP   22"
+.br
+.RI "\fIDefault value for \fBBROTLI_PARAM_LGWIN\fP parameter\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_LARGE_MAX_WINDOW_BITS\fP   30"
+.br
+.RI "\fIMaximal value for \fBBROTLI_PARAM_LGWIN\fP parameter in 'Large Window Brotli' (32-bit)\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_MAX_INPUT_BLOCK_BITS\fP   24"
+.br
+.RI "\fIMaximal value for \fBBROTLI_PARAM_LGBLOCK\fP parameter\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_MAX_QUALITY\fP   11"
+.br
+.RI "\fIMaximal value for \fBBROTLI_PARAM_QUALITY\fP parameter\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_MAX_WINDOW_BITS\fP   24"
+.br
+.RI "\fIMaximal value for \fBBROTLI_PARAM_LGWIN\fP parameter\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_MIN_INPUT_BLOCK_BITS\fP   16"
+.br
+.RI "\fIMinimal value for \fBBROTLI_PARAM_LGBLOCK\fP parameter\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_MIN_QUALITY\fP   0"
+.br
+.RI "\fIMinimal value for \fBBROTLI_PARAM_QUALITY\fP parameter\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_MIN_WINDOW_BITS\fP   10"
+.br
+.RI "\fIMinimal value for \fBBROTLI_PARAM_LGWIN\fP parameter\&. \fP"
+.in -1c
+.SS "Typedefs"
+
+.in +1c
+.ti -1c
+.RI "typedef enum \fBBrotliEncoderMode\fP \fBBrotliEncoderMode\fP"
+.br
+.RI "\fIOptions for \fBBROTLI_PARAM_MODE\fP parameter\&. \fP"
+.ti -1c
+.RI "typedef enum \fBBrotliEncoderOperation\fP \fBBrotliEncoderOperation\fP"
+.br
+.RI "\fIOperations that can be performed by streaming encoder\&. \fP"
+.ti -1c
+.RI "typedef enum \fBBrotliEncoderParameter\fP \fBBrotliEncoderParameter\fP"
+.br
+.RI "\fIOptions to be used with \fBBrotliEncoderSetParameter\fP\&. \fP"
+.ti -1c
+.RI "typedef struct BrotliEncoderStateStruct \fBBrotliEncoderState\fP"
+.br
+.RI "\fIOpaque structure that holds encoder state\&. \fP"
+.in -1c
+.SS "Enumerations"
+.SS "Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliEncoderAttachPreparedDictionary\fP (\fBBrotliEncoderState\fP *state, const BrotliEncoderPreparedDictionary *dictionary)"
+.br
+.RI "\fIAttaches a prepared dictionary of any type to the encoder\&. \fP"
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliEncoderCompress\fP (int quality, int lgwin, \fBBrotliEncoderMode\fP mode, size_t input_size, const uint8_t input_buffer[input_size], size_t *encoded_size, uint8_t encoded_buffer[*encoded_size])"
+.br
+.RI "\fIPerforms one-shot memory-to-memory compression\&. \fP"
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliEncoderCompressStream\fP (\fBBrotliEncoderState\fP *state, \fBBrotliEncoderOperation\fP op, size_t *available_in, const uint8_t **next_in, size_t *available_out, uint8_t **next_out, size_t *total_out)"
+.br
+.RI "\fICompresses input stream to output stream\&. \fP"
+.ti -1c
+.RI "\fBBrotliEncoderState\fP * \fBBrotliEncoderCreateInstance\fP (\fBbrotli_alloc_func\fP alloc_func, \fBbrotli_free_func\fP free_func, void *opaque)"
+.br
+.RI "\fICreates an instance of \fBBrotliEncoderState\fP and initializes it\&. \fP"
+.ti -1c
+.RI "void \fBBrotliEncoderDestroyInstance\fP (\fBBrotliEncoderState\fP *state)"
+.br
+.RI "\fIDeinitializes and frees \fBBrotliEncoderState\fP instance\&. \fP"
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliEncoderHasMoreOutput\fP (\fBBrotliEncoderState\fP *state)"
+.br
+.RI "\fIChecks if encoder has more output\&. \fP"
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliEncoderIsFinished\fP (\fBBrotliEncoderState\fP *state)"
+.br
+.RI "\fIChecks if encoder instance reached the final state\&. \fP"
+.ti -1c
+.RI "size_t \fBBrotliEncoderMaxCompressedSize\fP (size_t input_size)"
+.br
+.RI "\fICalculates the output size bound for the given \fCinput_size\fP\&. \fP"
+.ti -1c
+.RI "BrotliEncoderPreparedDictionary * \fBBrotliEncoderPrepareDictionary\fP (BrotliSharedDictionaryType type, size_t data_size, const uint8_t data[data_size], int quality, \fBbrotli_alloc_func\fP alloc_func, \fBbrotli_free_func\fP free_func, void *opaque)"
+.br
+.RI "\fIPrepares a shared dictionary from the given file format for the encoder\&. \fP"
+.ti -1c
+.RI "\fBBROTLI_BOOL\fP \fBBrotliEncoderSetParameter\fP (\fBBrotliEncoderState\fP *state, \fBBrotliEncoderParameter\fP param, uint32_t value)"
+.br
+.RI "\fISets the specified parameter to the given encoder instance\&. \fP"
+.ti -1c
+.RI "const uint8_t * \fBBrotliEncoderTakeOutput\fP (\fBBrotliEncoderState\fP *state, size_t *size)"
+.br
+.RI "\fIAcquires pointer to internal output buffer\&. \fP"
+.ti -1c
+.RI "uint32_t \fBBrotliEncoderVersion\fP (void)"
+.br
+.RI "\fIGets an encoder library version\&. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+API for Brotli compression\&. 
+
+
+.SH "Macro Definition Documentation"
+.PP 
+.SS "#define BROTLI_DEFAULT_MODE   \fBBROTLI_MODE_GENERIC\fP"
+
+.PP
+Default value for \fBBROTLI_PARAM_MODE\fP parameter\&. 
+.SS "#define BROTLI_DEFAULT_QUALITY   11"
+
+.PP
+Default value for \fBBROTLI_PARAM_QUALITY\fP parameter\&. 
+.SS "#define BROTLI_DEFAULT_WINDOW   22"
+
+.PP
+Default value for \fBBROTLI_PARAM_LGWIN\fP parameter\&. 
+.SS "#define BROTLI_MAX_INPUT_BLOCK_BITS   24"
+
+.PP
+Maximal value for \fBBROTLI_PARAM_LGBLOCK\fP parameter\&. 
+.SS "#define BROTLI_MAX_QUALITY   11"
+
+.PP
+Maximal value for \fBBROTLI_PARAM_QUALITY\fP parameter\&. 
+.SS "#define BROTLI_MAX_WINDOW_BITS   24"
+
+.PP
+Maximal value for \fBBROTLI_PARAM_LGWIN\fP parameter\&. 
+.PP
+\fBNote:\fP
+.RS 4
+equal to \fCBROTLI_MAX_DISTANCE_BITS\fP constant\&. 
+.RE
+.PP
+
+.SS "#define BROTLI_MIN_INPUT_BLOCK_BITS   16"
+
+.PP
+Minimal value for \fBBROTLI_PARAM_LGBLOCK\fP parameter\&. 
+.SS "#define BROTLI_MIN_QUALITY   0"
+
+.PP
+Minimal value for \fBBROTLI_PARAM_QUALITY\fP parameter\&. 
+.SS "#define BROTLI_MIN_WINDOW_BITS   10"
+
+.PP
+Minimal value for \fBBROTLI_PARAM_LGWIN\fP parameter\&. 
+.SH "Typedef Documentation"
+.PP 
+.SS "typedef enum \fBBrotliEncoderMode\fP  \fBBrotliEncoderMode\fP"
+
+.PP
+Options for \fBBROTLI_PARAM_MODE\fP parameter\&. 
+.SS "typedef enum \fBBrotliEncoderOperation\fP  \fBBrotliEncoderOperation\fP"
+
+.PP
+Operations that can be performed by streaming encoder\&. 
+.SS "typedef enum \fBBrotliEncoderParameter\fP  \fBBrotliEncoderParameter\fP"
+
+.PP
+Options to be used with \fBBrotliEncoderSetParameter\fP\&. 
+.SS "typedef struct BrotliEncoderStateStruct \fBBrotliEncoderState\fP"
+
+.PP
+Opaque structure that holds encoder state\&. Allocated and initialized with \fBBrotliEncoderCreateInstance\fP\&. Cleaned up and deallocated with \fBBrotliEncoderDestroyInstance\fP\&. 
+.SH "Enumeration Type Documentation"
+.PP 
+.SS "enum \fBBrotliEncoderMode\fP"
+
+.PP
+Options for \fBBROTLI_PARAM_MODE\fP parameter\&. 
+.PP
+\fBEnumerator\fP
+.in +1c
+.TP
+\fB\fIBROTLI_MODE_GENERIC \fP\fP
+Default compression mode\&. In this mode compressor does not know anything in advance about the properties of the input\&. 
+.TP
+\fB\fIBROTLI_MODE_TEXT \fP\fP
+Compression mode for UTF-8 formatted text input\&. 
+.TP
+\fB\fIBROTLI_MODE_FONT \fP\fP
+Compression mode used in WOFF 2\&.0\&. 
+.SS "enum \fBBrotliEncoderOperation\fP"
+
+.PP
+Operations that can be performed by streaming encoder\&. 
+.PP
+\fBEnumerator\fP
+.in +1c
+.TP
+\fB\fIBROTLI_OPERATION_PROCESS \fP\fP
+Process input\&. Encoder may postpone producing output, until it has processed enough input\&. 
+.TP
+\fB\fIBROTLI_OPERATION_FLUSH \fP\fP
+Produce output for all processed input\&. Actual flush is performed when input stream is depleted and there is enough space in output stream\&. This means that client should repeat \fBBROTLI_OPERATION_FLUSH\fP operation until \fCavailable_in\fP becomes \fC0\fP, and \fBBrotliEncoderHasMoreOutput\fP returns \fBBROTLI_FALSE\fP\&. If output is acquired via \fBBrotliEncoderTakeOutput\fP, then operation should be repeated after output buffer is drained\&.
+.PP
+\fBWarning:\fP
+.RS 4
+Until flush is complete, client \fBSHOULD\fP \fBNOT\fP swap, reduce or extend input stream\&.
+.RE
+.PP
+When flush is complete, output data will be sufficient for decoder to reproduce all the given input\&. 
+.TP
+\fB\fIBROTLI_OPERATION_FINISH \fP\fP
+Finalize the stream\&. Actual finalization is performed when input stream is depleted and there is enough space in output stream\&. This means that client should repeat \fBBROTLI_OPERATION_FINISH\fP operation until \fCavailable_in\fP becomes \fC0\fP, and \fBBrotliEncoderHasMoreOutput\fP returns \fBBROTLI_FALSE\fP\&. If output is acquired via \fBBrotliEncoderTakeOutput\fP, then operation should be repeated after output buffer is drained\&.
+.PP
+\fBWarning:\fP
+.RS 4
+Until finalization is complete, client \fBSHOULD\fP \fBNOT\fP swap, reduce or extend input stream\&.
+.RE
+.PP
+Helper function \fBBrotliEncoderIsFinished\fP checks if stream is finalized and output fully dumped\&.
+.PP
+Adding more input data to finalized stream is impossible\&. 
+.TP
+\fB\fIBROTLI_OPERATION_EMIT_METADATA \fP\fP
+Emit metadata block to stream\&. Metadata is opaque to Brotli: neither encoder, nor decoder processes this data or relies on it\&. It may be used to pass some extra information from encoder client to decoder client without interfering with main data stream\&.
+.PP
+\fBNote:\fP
+.RS 4
+Encoder may emit empty metadata blocks internally, to pad encoded stream to byte boundary\&.
+.RE
+.PP
+\fBWarning:\fP
+.RS 4
+Until emitting metadata is complete client \fBSHOULD\fP \fBNOT\fP swap, reduce or extend input stream\&.
+.PP
+The whole content of input buffer is considered to be the content of metadata block\&. Do \fBNOT\fP \fIappend\fP metadata to input stream, before it is depleted with other operations\&.
+.RE
+.PP
+Stream is soft-flushed before metadata block is emitted\&. Metadata block \fBMUST\fP be no longer than than 16MiB\&. 
+.SS "enum \fBBrotliEncoderParameter\fP"
+
+.PP
+Options to be used with \fBBrotliEncoderSetParameter\fP\&. 
+.PP
+\fBEnumerator\fP
+.in +1c
+.TP
+\fB\fIBROTLI_PARAM_MODE \fP\fP
+Tune encoder for specific input\&. \fBBrotliEncoderMode\fP enumerates all available values\&. 
+.TP
+\fB\fIBROTLI_PARAM_QUALITY \fP\fP
+The main compression speed-density lever\&. The higher the quality, the slower the compression\&. Range is from \fBBROTLI_MIN_QUALITY\fP to \fBBROTLI_MAX_QUALITY\fP\&. 
+.TP
+\fB\fIBROTLI_PARAM_LGWIN \fP\fP
+Recommended sliding LZ77 window size\&. Encoder may reduce this value, e\&.g\&. if input is much smaller than window size\&.
+.PP
+Window size is \fC(1 << value) - 16\fP\&.
+.PP
+Range is from \fBBROTLI_MIN_WINDOW_BITS\fP to \fBBROTLI_MAX_WINDOW_BITS\fP\&. 
+.TP
+\fB\fIBROTLI_PARAM_LGBLOCK \fP\fP
+Recommended input block size\&. Encoder may reduce this value, e\&.g\&. if input is much smaller than input block size\&.
+.PP
+Range is from \fBBROTLI_MIN_INPUT_BLOCK_BITS\fP to \fBBROTLI_MAX_INPUT_BLOCK_BITS\fP\&.
+.PP
+\fBNote:\fP
+.RS 4
+Bigger input block size allows better compression, but consumes more memory\&. 
+.br
+ The rough formula of memory used for temporary input storage is \fC3 << lgBlock\fP\&. 
+.RE
+.PP
+
+.TP
+\fB\fIBROTLI_PARAM_DISABLE_LITERAL_CONTEXT_MODELING \fP\fP
+Flag that affects usage of 'literal context modeling' format feature\&. This flag is a 'decoding-speed vs compression ratio' trade-off\&. 
+.TP
+\fB\fIBROTLI_PARAM_SIZE_HINT \fP\fP
+Estimated total input size for all \fBBrotliEncoderCompressStream\fP calls\&. The default value is 0, which means that the total input size is unknown\&. 
+.TP
+\fB\fIBROTLI_PARAM_LARGE_WINDOW \fP\fP
+Flag that determines if 'Large Window Brotli' is used\&. 
+.TP
+\fB\fIBROTLI_PARAM_NPOSTFIX \fP\fP
+Recommended number of postfix bits (NPOSTFIX)\&. Encoder may change this value\&.
+.PP
+Range is from 0 to \fBBROTLI_MAX_NPOSTFIX\fP\&. 
+.TP
+\fB\fIBROTLI_PARAM_NDIRECT \fP\fP
+Recommended number of direct distance codes (NDIRECT)\&. Encoder may change this value\&.
+.PP
+Range is from 0 to (15 << NPOSTFIX) in steps of (1 << NPOSTFIX)\&. 
+.TP
+\fB\fIBROTLI_PARAM_STREAM_OFFSET \fP\fP
+Number of bytes of input stream already processed by a different instance\&. 
+.PP
+\fBNote:\fP
+.RS 4
+It is important to configure all the encoder instances with same parameters (except this one) in order to allow all the encoded parts obey the same restrictions implied by header\&.
+.RE
+.PP
+If offset is not 0, then stream header is omitted\&. In any case output start is byte aligned, so for proper streams stitching 'predecessor' stream must be flushed\&.
+.PP
+Range is not artificially limited, but all the values greater or equal to maximal window size have the same effect\&. Values greater than 2**30 are not allowed\&. 
+.SH "Function Documentation"
+.PP 
+.SS "\fBBROTLI_BOOL\fP BrotliEncoderAttachPreparedDictionary (\fBBrotliEncoderState\fP * state, const BrotliEncoderPreparedDictionary * dictionary)"
+
+.PP
+Attaches a prepared dictionary of any type to the encoder\&. Can be used multiple times to attach multiple dictionaries\&. The dictionary type was determined by BrotliEncoderPrepareDictionary\&. Multiple raw prefix dictionaries and/or max 1 serialized dictionary with custom words can be attached\&.
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_FALSE\fP in case of error 
+.PP
+\fBBROTLI_TRUE\fP otherwise 
+.RE
+.PP
+
+.SS "\fBBROTLI_BOOL\fP BrotliEncoderCompress (int quality, int lgwin, \fBBrotliEncoderMode\fP mode, size_t input_size, const uint8_t input_buffer[input_size], size_t * encoded_size, uint8_t encoded_buffer[*encoded_size])"
+
+.PP
+Performs one-shot memory-to-memory compression\&. Compresses the data in \fCinput_buffer\fP into \fCencoded_buffer\fP, and sets \fC*encoded_size\fP to the compressed length\&.
+.PP
+\fBNote:\fP
+.RS 4
+If \fBBrotliEncoderMaxCompressedSize\fP(\fCinput_size\fP) returns non-zero value, then output is guaranteed to be no longer than that\&.
+.PP
+If \fClgwin\fP is greater than \fBBROTLI_MAX_WINDOW_BITS\fP then resulting stream might be incompatible with RFC 7932; to decode such streams, decoder should be configured with \fBBROTLI_DECODER_PARAM_LARGE_WINDOW\fP = \fC1\fP 
+.RE
+.PP
+\fBParameters:\fP
+.RS 4
+\fIquality\fP quality parameter value, e\&.g\&. \fBBROTLI_DEFAULT_QUALITY\fP 
+.br
+\fIlgwin\fP lgwin parameter value, e\&.g\&. \fBBROTLI_DEFAULT_WINDOW\fP 
+.br
+\fImode\fP mode parameter value, e\&.g\&. \fBBROTLI_DEFAULT_MODE\fP 
+.br
+\fIinput_size\fP size of \fCinput_buffer\fP 
+.br
+\fIinput_buffer\fP input data buffer with at least \fCinput_size\fP addressable bytes 
+.br
+\fIencoded_size\fP \fBin:\fP size of \fCencoded_buffer\fP; 
+.br
+ \fBout:\fP length of compressed data written to \fCencoded_buffer\fP, or \fC0\fP if compression fails 
+.br
+\fIencoded_buffer\fP compressed data destination buffer 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_FALSE\fP in case of compression error 
+.PP
+\fBBROTLI_FALSE\fP if output buffer is too small 
+.PP
+\fBBROTLI_TRUE\fP otherwise 
+.RE
+.PP
+
+.SS "\fBBROTLI_BOOL\fP BrotliEncoderCompressStream (\fBBrotliEncoderState\fP * state, \fBBrotliEncoderOperation\fP op, size_t * available_in, const uint8_t ** next_in, size_t * available_out, uint8_t ** next_out, size_t * total_out)"
+
+.PP
+Compresses input stream to output stream\&. The values \fC*available_in\fP and \fC*available_out\fP must specify the number of bytes addressable at \fC*next_in\fP and \fC*next_out\fP respectively\&. When \fC*available_out\fP is \fC0\fP, \fCnext_out\fP is allowed to be \fCNULL\fP\&.
+.PP
+After each call, \fC*available_in\fP will be decremented by the amount of input bytes consumed, and the \fC*next_in\fP pointer will be incremented by that amount\&. Similarly, \fC*available_out\fP will be decremented by the amount of output bytes written, and the \fC*next_out\fP pointer will be incremented by that amount\&.
+.PP
+\fCtotal_out\fP, if it is not a null-pointer, will be set to the number of bytes compressed since the last \fCstate\fP initialization\&.
+.PP
+Internally workflow consists of 3 tasks:
+.IP "1." 4
+(optionally) copy input data to internal buffer
+.IP "2." 4
+actually compress data and (optionally) store it to internal buffer
+.IP "3." 4
+(optionally) copy compressed bytes from internal buffer to output stream
+.PP
+.PP
+Whenever all 3 tasks can't move forward anymore, or error occurs, this method returns the control flow to caller\&.
+.PP
+\fCop\fP is used to perform flush, finish the stream, or inject metadata block\&. See \fBBrotliEncoderOperation\fP for more information\&.
+.PP
+Flushing the stream means forcing encoding of all input passed to encoder and completing the current output block, so it could be fully decoded by stream decoder\&. To perform flush set \fCop\fP to \fBBROTLI_OPERATION_FLUSH\fP\&. Under some circumstances (e\&.g\&. lack of output stream capacity) this operation would require several calls to \fBBrotliEncoderCompressStream\fP\&. The method must be called again until both input stream is depleted and encoder has no more output (see \fBBrotliEncoderHasMoreOutput\fP) after the method is called\&.
+.PP
+Finishing the stream means encoding of all input passed to encoder and adding specific 'final' marks, so stream decoder could determine that stream is complete\&. To perform finish set \fCop\fP to \fBBROTLI_OPERATION_FINISH\fP\&. Under some circumstances (e\&.g\&. lack of output stream capacity) this operation would require several calls to \fBBrotliEncoderCompressStream\fP\&. The method must be called again until both input stream is depleted and encoder has no more output (see \fBBrotliEncoderHasMoreOutput\fP) after the method is called\&.
+.PP
+\fBWarning:\fP
+.RS 4
+When flushing and finishing, \fCop\fP should not change until operation is complete; input stream should not be swapped, reduced or extended as well\&.
+.RE
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP encoder instance 
+.br
+\fIop\fP requested operation 
+.br
+\fIavailable_in\fP \fBin:\fP amount of available input; 
+.br
+ \fBout:\fP amount of unused input 
+.br
+\fInext_in\fP pointer to the next input byte 
+.br
+\fIavailable_out\fP \fBin:\fP length of output buffer; 
+.br
+ \fBout:\fP remaining size of output buffer 
+.br
+\fInext_out\fP compressed output buffer cursor; can be \fCNULL\fP if \fCavailable_out\fP is \fC0\fP 
+.br
+\fItotal_out\fP number of bytes produced so far; can be \fCNULL\fP 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_FALSE\fP if there was an error 
+.PP
+\fBBROTLI_TRUE\fP otherwise 
+.RE
+.PP
+
+.SS "\fBBrotliEncoderState\fP* BrotliEncoderCreateInstance (\fBbrotli_alloc_func\fP alloc_func, \fBbrotli_free_func\fP free_func, void * opaque)"
+
+.PP
+Creates an instance of \fBBrotliEncoderState\fP and initializes it\&. \fCalloc_func\fP and \fCfree_func\fP \fBMUST\fP be both zero or both non-zero\&. In the case they are both zero, default memory allocators are used\&. \fCopaque\fP is passed to \fCalloc_func\fP and \fCfree_func\fP when they are called\&. \fCfree_func\fP has to return without doing anything when asked to free a NULL pointer\&.
+.PP
+\fBParameters:\fP
+.RS 4
+\fIalloc_func\fP custom memory allocation function 
+.br
+\fIfree_func\fP custom memory free function 
+.br
+\fIopaque\fP custom memory manager handle 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fC0\fP if instance can not be allocated or initialized 
+.PP
+pointer to initialized \fBBrotliEncoderState\fP otherwise 
+.RE
+.PP
+
+.SS "void BrotliEncoderDestroyInstance (\fBBrotliEncoderState\fP * state)"
+
+.PP
+Deinitializes and frees \fBBrotliEncoderState\fP instance\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP decoder instance to be cleaned up and deallocated 
+.RE
+.PP
+
+.SS "\fBBROTLI_BOOL\fP BrotliEncoderHasMoreOutput (\fBBrotliEncoderState\fP * state)"
+
+.PP
+Checks if encoder has more output\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP encoder instance 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_TRUE\fP, if encoder has some unconsumed output 
+.PP
+\fBBROTLI_FALSE\fP otherwise 
+.RE
+.PP
+
+.SS "\fBBROTLI_BOOL\fP BrotliEncoderIsFinished (\fBBrotliEncoderState\fP * state)"
+
+.PP
+Checks if encoder instance reached the final state\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP encoder instance 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_TRUE\fP if encoder is in a state where it reached the end of the input and produced all of the output 
+.PP
+\fBBROTLI_FALSE\fP otherwise 
+.RE
+.PP
+
+.SS "size_t BrotliEncoderMaxCompressedSize (size_t input_size)"
+
+.PP
+Calculates the output size bound for the given \fCinput_size\fP\&. 
+.PP
+\fBWarning:\fP
+.RS 4
+Result is only valid if quality is at least \fC2\fP and, in case \fBBrotliEncoderCompressStream\fP was used, no flushes (\fBBROTLI_OPERATION_FLUSH\fP) were performed\&.
+.RE
+.PP
+\fBParameters:\fP
+.RS 4
+\fIinput_size\fP size of projected input 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fC0\fP if result does not fit \fCsize_t\fP 
+.RE
+.PP
+
+.SS "BrotliEncoderPreparedDictionary* BrotliEncoderPrepareDictionary (BrotliSharedDictionaryType type, size_t data_size, const uint8_t data[data_size], int quality, \fBbrotli_alloc_func\fP alloc_func, \fBbrotli_free_func\fP free_func, void * opaque)"
+
+.PP
+Prepares a shared dictionary from the given file format for the encoder\&. \fCalloc_func\fP and \fCfree_func\fP \fBMUST\fP be both zero or both non-zero\&. In the case they are both zero, default memory allocators are used\&. \fCopaque\fP is passed to \fCalloc_func\fP and \fCfree_func\fP when they are called\&. \fCfree_func\fP has to return without doing anything when asked to free a NULL pointer\&.
+.PP
+\fBParameters:\fP
+.RS 4
+\fItype\fP type of dictionary stored in data 
+.br
+\fIdata_size\fP size of \fCdata\fP buffer 
+.br
+\fIdata\fP pointer to the dictionary data 
+.br
+\fIquality\fP the maximum Brotli quality to prepare the dictionary for, use BROTLI_MAX_QUALITY by default 
+.br
+\fIalloc_func\fP custom memory allocation function 
+.br
+\fIfree_func\fP custom memory free function 
+.br
+\fIopaque\fP custom memory manager handle 
+.RE
+.PP
+
+.SS "\fBBROTLI_BOOL\fP BrotliEncoderSetParameter (\fBBrotliEncoderState\fP * state, \fBBrotliEncoderParameter\fP param, uint32_t value)"
+
+.PP
+Sets the specified parameter to the given encoder instance\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP encoder instance 
+.br
+\fIparam\fP parameter to set 
+.br
+\fIvalue\fP new parameter value 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fBBROTLI_FALSE\fP if parameter is unrecognized, or value is invalid 
+.PP
+\fBBROTLI_FALSE\fP if value of parameter can not be changed at current encoder state (e\&.g\&. when encoding is started, window size might be already encoded and therefore it is impossible to change it) 
+.PP
+\fBBROTLI_TRUE\fP if value is accepted 
+.RE
+.PP
+\fBWarning:\fP
+.RS 4
+invalid values might be accepted in case they would not break encoding process\&. 
+.RE
+.PP
+
+.SS "const uint8_t* BrotliEncoderTakeOutput (\fBBrotliEncoderState\fP * state, size_t * size)"
+
+.PP
+Acquires pointer to internal output buffer\&. This method is used to make language bindings easier and more efficient:
+.IP "1." 4
+push data to \fBBrotliEncoderCompressStream\fP, until \fBBrotliEncoderHasMoreOutput\fP returns BROTLI_TRUE
+.IP "2." 4
+use \fBBrotliEncoderTakeOutput\fP to peek bytes and copy to language-specific entity
+.PP
+.PP
+Also this could be useful if there is an output stream that is able to consume all the provided data (e\&.g\&. when data is saved to file system)\&.
+.PP
+\fBAttention:\fP
+.RS 4
+After every call to \fBBrotliEncoderTakeOutput\fP \fC*size\fP bytes of output are considered consumed for all consecutive calls to the instance methods; returned pointer becomes invalidated as well\&.
+.RE
+.PP
+\fBNote:\fP
+.RS 4
+Encoder output is not guaranteed to be contiguous\&. This means that after the size-unrestricted call to \fBBrotliEncoderTakeOutput\fP, immediate next call to \fBBrotliEncoderTakeOutput\fP may return more data\&.
+.RE
+.PP
+\fBParameters:\fP
+.RS 4
+\fIstate\fP encoder instance 
+.br
+\fIsize\fP \fBin:\fP number of bytes caller is ready to take, \fC0\fP if any amount could be handled; 
+.br
+ \fBout:\fP amount of data pointed by returned pointer and considered consumed; 
+.br
+ out value is never greater than in value, unless it is \fC0\fP 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+pointer to output data 
+.RE
+.PP
+
+.SS "uint32_t BrotliEncoderVersion (void)"
+
+.PP
+Gets an encoder library version\&. Look at BROTLI_MAKE_HEX_VERSION for more information\&. 
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for Brotli from the source code\&.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/types.h.3 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/types.h.3
new file mode 100644
index 0000000000..3d8a98cbc4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/docs/types.h.3
@@ -0,0 +1,117 @@
+.TH "types.h" 3 "August 2021" "Brotli" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+types.h \- Common types used in decoder and encoder API\&.  
+
+.SH SYNOPSIS
+.br
+.PP
+.SS "Macros"
+
+.in +1c
+.ti -1c
+.RI "#define \fBBROTLI_BOOL\fP   int"
+.br
+.RI "\fIA portable \fCbool\fP replacement\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_FALSE\fP   0"
+.br
+.RI "\fIPortable \fCfalse\fP replacement\&. \fP"
+.ti -1c
+.RI "#define \fBBROTLI_TRUE\fP   1"
+.br
+.RI "\fIPortable \fCtrue\fP replacement\&. \fP"
+.ti -1c
+.RI "#define \fBTO_BROTLI_BOOL\fP(X)   (!!(X) ? \fBBROTLI_TRUE\fP : \fBBROTLI_FALSE\fP)"
+.br
+.RI "\fI\fCbool\fP to \fBBROTLI_BOOL\fP conversion macros\&. \fP"
+.in -1c
+.SS "Typedefs"
+
+.in +1c
+.ti -1c
+.RI "typedef void *(* \fBbrotli_alloc_func\fP) (void *opaque, size_t size)"
+.br
+.RI "\fIAllocating function pointer type\&. \fP"
+.ti -1c
+.RI "typedef void(* \fBbrotli_free_func\fP) (void *opaque, void *address)"
+.br
+.RI "\fIDeallocating function pointer type\&. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Common types used in decoder and encoder API\&. 
+
+
+.SH "Macro Definition Documentation"
+.PP 
+.SS "#define BROTLI_BOOL   int"
+
+.PP
+A portable \fCbool\fP replacement\&. \fBBROTLI_BOOL\fP is a 'documentation' type: actually it is \fCint\fP, but in API it denotes a type, whose only values are \fBBROTLI_TRUE\fP and \fBBROTLI_FALSE\fP\&.
+.PP
+\fBBROTLI_BOOL\fP values passed to Brotli should either be \fBBROTLI_TRUE\fP or \fBBROTLI_FALSE\fP, or be a result of \fBTO_BROTLI_BOOL\fP macros\&.
+.PP
+\fBBROTLI_BOOL\fP values returned by Brotli should not be tested for equality with \fCtrue\fP, \fCfalse\fP, \fBBROTLI_TRUE\fP, \fBBROTLI_FALSE\fP, but rather should be evaluated, for example:
+.PP
+.nf
+if (SomeBrotliFunction(encoder, BROTLI_TRUE) &&
+    !OtherBrotliFunction(decoder, BROTLI_FALSE)) {
+  bool x = !!YetAnotherBrotliFunction(encoder, TO_BROLTI_BOOL(2 * 2 == 4));
+  DoSomething(x);
+}
+
+.fi
+.PP
+ 
+.SS "#define BROTLI_FALSE   0"
+
+.PP
+Portable \fCfalse\fP replacement\&. 
+.SS "#define BROTLI_TRUE   1"
+
+.PP
+Portable \fCtrue\fP replacement\&. 
+.SS "#define TO_BROTLI_BOOL(X)   (!!(X) ? \fBBROTLI_TRUE\fP : \fBBROTLI_FALSE\fP)"
+
+.PP
+\fCbool\fP to \fBBROTLI_BOOL\fP conversion macros\&. 
+.SH "Typedef Documentation"
+.PP 
+.SS "typedef void*(* brotli_alloc_func) (void *opaque, size_t size)"
+
+.PP
+Allocating function pointer type\&. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIopaque\fP custom memory manager handle provided by client 
+.br
+\fIsize\fP requested memory region size; can not be \fC0\fP 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+\fC0\fP in the case of failure 
+.PP
+a valid pointer to a memory region of at least \fCsize\fP bytes long otherwise 
+.RE
+.PP
+
+.SS "typedef void(* brotli_free_func) (void *opaque, void *address)"
+
+.PP
+Deallocating function pointer type\&. This function \fBSHOULD\fP do nothing if \fCaddress\fP is \fC0\fP\&.
+.PP
+\fBParameters:\fP
+.RS 4
+\fIopaque\fP custom memory manager handle provided by client 
+.br
+\fIaddress\fP memory region pointer returned by \fBbrotli_alloc_func\fP, or \fC0\fP 
+.RE
+.PP
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for Brotli from the source code\&.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/fetch-spec/shared-brotli-fetch-spec.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/fetch-spec/shared-brotli-fetch-spec.txt
new file mode 100644
index 0000000000..ea2d11712b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/fetch-spec/shared-brotli-fetch-spec.txt
@@ -0,0 +1,116 @@
+[DRAFT]
+
+Introduction:
+
+This document is a draft proposal for Shard Brotli dictionaries in the fetch spec
+(https://fetch.spec.whatwg.org/).
+
+The goal is to add support for custom dictionaries for Brotli. A dictionary is used
+to improve compression. A client can download a dictionary from a server and then
+use it to decompress resources compressed with this dictionary.
+
+This document specifies how the client and server negotiate the dictionary over HTTP.
+A high level overview is as follows: The server adds an HTTP header to the response
+with a URL of the dictionary. The browser downloads the dictionary from the URL and
+then caches it so it can be reused. The server also adds a checksum to an HTTP header
+which the client uses to verify the dictionary. Caching, CORS, and other existing
+mechanisms are used. A dictionary can be a pre-made static dictionary, but does not
+have to be, for example a previous page loaded from this server, or an old version
+of a page, can be used as well.
+
+Below are changes and additions to add Shared Brotli dictionaries to the fetch spec
+at https://fetch.spec.whatwg.org/:
+
+Additions to `4.5. HTTP-network-or-cache fetch`
+
+Add to point `15. Modify httpRequest’s header list per HTTP.`:
+
+  If the recursive-sbr flag is enabled, `Accept-Encoding` may not contain `sbr`
+  [NOTE-BOX] When sbr can be used, it is possible to add a header Available-Dict
+  with the URL and hash code of a cached resource. The server may then use it as
+  shared dictionary.
+
+Additions to `4.6. HTTP-network fetch`
+
+Add after point `10. Run these steps, but abort if the ongoing fetch is terminated`:
+
+  11. Let codings be the result of extracting header list values given
+      `Content-Encoding` and response’s header list.
+  12. If codings contains `sbr`
+    1. If the header list does not contain `Sbr-Dict`, return a network error
+    2. Let dictionaryId be the result of extracting header list values given
+       `Sbr-Dict` and response’s header list.
+
+To point `12. Run these substeps in parallel:`, add new first sub-point:
+
+  1. If codings contains `sbr`, run these subsubsteps:
+      1. Let dictionaryResponse be the result of performing a
+         Shared-Brotli-dictionary fetch given dictionaryId and request.
+      2. If dictionaryResponse is a network error, return a network error.
+
+Change point `12.4. Set bytes to the result of handling content codings given codings and bytes.` to:
+
+  4. Set bytes to the result of handling content codings given codings, bytes
+     and, if codings contains `sbr`, also dictionaryResponse's body.
+     [NOTE-BOX] If the dictionary is still being fetched, which happens in
+     parallel, enqueue bytes in a compressed buffer and handle content coding
+     once the dictionary is fetched
+
+Additions to `2.2.4. Bodies`
+
+
+Change last section `To handle content codings ...` to:
+
+  To handle content codings given codings, bytes and optionally a dictionary, run these substeps:
+    1. If codings are not supported, return bytes.
+    2. If the codings has `sbr`, run these subsubsteps:
+       a. Return the result of decoding bytes and dictionary with the Shared
+          Brotli decoder.
+          [Shared Brotli Spec] [IANA Brotli](https://www.iana.org/assignments/http-parameters/http-parameters.xhtml)
+    3. Else:
+       a. Return the result of decoding bytes with the given codings, as
+          explained in HTTP. [HTTP] [HTTP-SEMANTICS] [HTTP-COND] [HTTP-CACHING]
+          [HTTP-AUTH]
+
+New section `4.10. Shared-Brotli-dictionary fetch`
+
+  To perform a Shared-Brotli-dictionary fetch using dictionaryId, and parentRequest, perform these steps:
+
+  1. Let dictionaryURL be the URL extracted from dictionaryId
+  2. Let dictionaryHash be the hash id extracted from dictionaryId
+  3. Let dictionaryRequest be a new request whose method is `GET`, url is
+     dictionaryURL, mode is "cors", and client is parentRequest's client.
+  4. Let dictionaryResponse be the result of performing an
+     [HTTP-network-or-cache](https://fetch.spec.whatwg.org/#concept-http-network-or-cache-fetch)
+     fetch using dictionaryRequest with the recursive-sbr flag set to true.
+     [NOTE-BOX] For compression benefits, the dictionary should be reused to
+     decode multiple different responses. We rely on caching to achieve this.
+     It is suggested for servers to not add any "no-cache" or short "max-age"
+     Cache-Control directives, and it is suggested for the client to effectively
+     support caching it.
+     [NOTE-BOX] Since the same dictionary can be identified by a hash code, a
+     browser can avoid fetching a dictionary if it already has one with the same
+     hashed cached from a different source URL.
+     [NOTE-BOX] It is suggested that a server does not reuse the same URL
+     to host an updated or different dictionary. Instead the same dictionary URL
+     should contain a dictionary with the same content and same hash.
+  5. If dictionaryResponse is a network error, return a network error.
+  6. If dictionaryResponse's status is not an ok status, return a network error.
+  7. Let tokens be the result of
+     [parsing metadata](https://w3c.github.io/webappsec-subresource-integrity/#parse-metadata)
+     given dictionaryHash.
+     [Subresource Integrity](https://w3c.github.io/webappsec-subresource-integrity/)
+  8. If tokens is no metadata or the length of tokens is not 1, return a network
+     error
+  9. Let algorithm be the alg component of tokens[0]. If alg is 'hw3', set
+     algorithm to 256-bit HighwayHash
+  10. Let digest be the val component of tokens[1].
+  11. Let hashValue be the result of base64 decoding digest
+      [base64](https://tools.ietf.org/html/rfc4648)
+  12. If hashValue is not a valid base64 encoding, return a network error
+      [NOTE-BOX] All of the supported hashing algorithms are cryptographically
+      secure.
+  13. Compute the hash code of dictionaryResponse's body using algorithm and
+      compare this checksum for equality with hashValue. If the computed
+      checksum does not match hashValue, return a network error.
+  14. Return dictionaryResponse.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/README.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/README.md
new file mode 100644
index 0000000000..366a82c3f0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/README.md
@@ -0,0 +1,3 @@
+Set of tools that can be used to download brotli RFC, extract and validate
+binary dictionary, and generate dictionary derivatives
+(e.g. Java `DictionaryData` class constants).
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-01-download-rfc.py b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-01-download-rfc.py
new file mode 100644
index 0000000000..04f9cccc7d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-01-download-rfc.py
@@ -0,0 +1,16 @@
+# Step 01 - download RFC7932.
+#
+# RFC is the ultimate source for brotli format and constants, including
+# static dictionary.
+
+import urllib2
+
+response = urllib2.urlopen("https://tools.ietf.org/rfc/rfc7932.txt")
+
+text = response.read()
+path = "rfc7932.txt"
+
+with open(path, "w") as rfc:
+  rfc.write(text)
+
+print("Downloaded and saved " + str(len(text)) + " bytes to " + path)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-02-rfc-to-bin.py b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-02-rfc-to-bin.py
new file mode 100644
index 0000000000..ddf255a328
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-02-rfc-to-bin.py
@@ -0,0 +1,34 @@
+# Step 02 - parse RFC.
+#
+# Static dictionary is described in "Appendix A" section in a hexadecimal form.
+# This tool locates dictionary data in RFC and converts it to raw binary format.
+
+import re
+
+rfc_path = "rfc7932.txt"
+
+with open(rfc_path, "r") as rfc:
+  lines = rfc.readlines()
+
+re_data_line = re.compile("^      [0-9a-f]{64}$")
+
+appendix_a_found = False
+dictionary = []
+for line in lines:
+  if appendix_a_found:
+    if re_data_line.match(line) is not None:
+      data = line.strip()
+      for i in range(32):
+        dictionary.append(int(data[2 * i:2 * i + 2], 16))
+      if len(dictionary) == 122784:
+        break
+  else:
+    if line.startswith("Appendix A."):
+      appendix_a_found = True
+
+bin_path = "dictionary.bin"
+
+with open(bin_path, "wb") as output:
+  output.write(bytearray(dictionary))
+
+print("Parsed and saved " + str(len(dictionary)) + " bytes to " + bin_path)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-03-validate-bin.py b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-03-validate-bin.py
new file mode 100644
index 0000000000..b52e6141b8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-03-validate-bin.py
@@ -0,0 +1,35 @@
+# Step 03 - validate raw dictionary file.
+#
+# CRC32, MD5, SHA1 and SHA256 checksums for raw binary dictionary are checked.
+
+import hashlib
+import zlib
+
+bin_path = "dictionary.bin"
+
+with open(bin_path, "rb") as raw:
+  data = raw.read()
+
+
+def check_digest(name, expected, actual):
+  if expected == actual:
+    print("[OK] " + name)
+  else:
+    print("[ERROR] " + name + " | " + expected + " != " + actual)
+
+
+check_digest(
+    "CRC32",  # This is the only checksum provided in RFC.
+    "0x5136cb04",
+    hex(zlib.crc32(data)))
+
+check_digest("MD5", "96cecd2ee7a666d5aa3627d74735b32a",
+             hashlib.md5(data).hexdigest())
+
+check_digest("SHA1", "72b41051cb61a9281ba3c4414c289da50d9a7640",
+             hashlib.sha1(data).hexdigest())
+
+check_digest(
+    "SHA256",
+    "20e42eb1b511c21806d4d227d07e5dd06877d8ce7b3a817f378f313653f35c70",
+    hashlib.sha256(data).hexdigest())
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-04-generate-java-literals.py b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-04-generate-java-literals.py
new file mode 100644
index 0000000000..d8645427b0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/dictionary/step-04-generate-java-literals.py
@@ -0,0 +1,85 @@
+# Step 04 - generate Java literals.
+#
+# Java byte-code has severe restrictions. There is no such thing as
+# "array literal" - those are implemented as series of data[x] = y;
+# as a consequence N-byte array will use 7N bytes in class, plus N bytes
+# in instantiated variable. Also no literal could be longer than 64KiB.
+#
+# To keep dictionary data compact both in source code and in compiled format
+# we use the following tricks:
+#  * use String as a data container
+#  * store only lowest 7 bits; i.e. all characters fit ASCII table; this allows
+#    efficient conversion to byte array; also ASCII characters use only 1 byte
+#.   of memory (UTF-8 encoding)
+#  * RLE-compress sequence of 8-th bits
+#
+# This script generates literals used in Java code.
+
+try:
+  unichr  # Python 2
+except NameError:
+  unichr = chr  # Python 3
+
+bin_path = "dictionary.bin"
+
+with open(bin_path, "rb") as raw:
+  data = raw.read()
+
+low = []
+hi = []
+is_skip = True
+skip_flip_offset = 36
+cntr = skip_flip_offset
+for b in data:
+  value = ord(b)
+  low.append(chr(value & 0x7F))
+  if is_skip:
+    if value < 0x80:
+      cntr += 1
+    else:
+      is_skip = False
+      hi.append(unichr(cntr))
+      cntr = skip_flip_offset + 1
+  else:
+    if value >= 0x80:
+      cntr += 1
+    else:
+      is_skip = True
+      hi.append(unichr(cntr))
+      cntr = skip_flip_offset + 1
+hi.append(unichr(cntr))
+
+low0 = low[0:len(low) // 2]
+low1 = low[len(low) // 2:len(low)]
+
+
+def escape(chars):
+  result = []
+  for c in chars:
+    if "\r" == c:
+      result.append("\\r")
+    elif "\n" == c:
+      result.append("\\n")
+    elif "\t" == c:
+      result.append("\\t")
+    elif "\"" == c:
+      result.append("\\\"")
+    elif "\\" == c:
+      result.append("\\\\")
+    elif ord(c) < 32 or ord(c) >= 127:
+      result.append("\\u%04X" % ord(c))
+    else:
+      result.append(c)
+  return result
+
+
+source_code = [
+    "  private static final String DATA0 = \"", "".join(escape(low0)), "\";\n",
+    "  private static final String DATA1 = \"", "".join(escape(low1)), "\";\n",
+    "  private static final String SKIP_FLIP = \"", "".join(escape(hi)), "\";\n"
+]
+
+src_path = "DictionaryData.inc.java"
+
+with open(src_path, "w") as source:
+  source.write("".join(source_code))
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/download_testdata.sh b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/download_testdata.sh
new file mode 100755
index 0000000000..b93028da5e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/download_testdata.sh
@@ -0,0 +1,7 @@
+#!/bin/bash
+set -x
+BROTLI_TAG=${BROTLI_TAG:-dev/null}
+BROTLI_TAG="${BROTLI_TAG//'/'/%2F}" # Escaping for tag names with slash (e.g. "dev/null")
+ARCHIVE=testdata.txz
+curl -L https://github.com/google/brotli/releases/download/${BROTLI_TAG}/${ARCHIVE} -o ${ARCHIVE}
+tar xvfJ ${ARCHIVE}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/libbrotlicommon.pc.in b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/libbrotlicommon.pc.in
new file mode 100644
index 0000000000..2a8cf7a35e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/libbrotlicommon.pc.in
@@ -0,0 +1,11 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: libbrotlicommon
+URL: https://github.com/google/brotli
+Description: Brotli common dictionary library
+Version: @PACKAGE_VERSION@
+Libs: -L${libdir} -lbrotlicommon
+Cflags: -I${includedir}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/libbrotlidec.pc.in b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/libbrotlidec.pc.in
new file mode 100644
index 0000000000..ecb8f46ab1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/libbrotlidec.pc.in
@@ -0,0 +1,12 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: libbrotlidec
+URL: https://github.com/google/brotli
+Description: Brotli decoder library
+Version: @PACKAGE_VERSION@
+Libs: -L${libdir} -lbrotlidec
+Requires.private: libbrotlicommon >= 1.1.0
+Cflags: -I${includedir}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/libbrotlienc.pc.in b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/libbrotlienc.pc.in
new file mode 100644
index 0000000000..5bedb2f0f1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/brotli/scripts/libbrotlienc.pc.in
@@ -0,0 +1,12 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: libbrotlienc
+URL: https://github.com/google/brotli
+Description: Brotli encoder library
+Version: @PACKAGE_VERSION@
+Libs: -L${libdir} -lbrotlienc
+Requires.private: libbrotlicommon >= 1.1.0
+Cflags: -I${includedir}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/.gitignore b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/.gitignore
new file mode 100644
index 0000000000..4a1921d3fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/.gitignore
@@ -0,0 +1,19 @@
+tags
+*.demo
+*swp
+*.out
+*.o
+*.d
+*.ut
+log
+main
+lib*.a
+*_demo
+segdict*
+prior.gbk
+tmp
+t.*
+*.pid
+build
+Testing/Temporary/CTestCostData.txt
+Testing/Temporary/LastTest.log
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/CMakeLists.txt
new file mode 100644
index 0000000000..f7fbd23116
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/CMakeLists.txt
@@ -0,0 +1,47 @@
+CMAKE_MINIMUM_REQUIRED (VERSION 3.10)
+PROJECT(CPPJIEBA)
+
+# Use vendored limonp
+set(LIMONP_INCLUDE_DIR "${PROJECT_SOURCE_DIR}/deps/limonp/include")
+INCLUDE_DIRECTORIES("${LIMONP_INCLUDE_DIR}"
+  ${PROJECT_SOURCE_DIR}/include)
+
+if(NOT DEFINED CMAKE_CXX_STANDARD)
+    set(CMAKE_CXX_STANDARD 11)
+endif()
+set(CMAKE_CXX_STANDARD_REQUIRED ON)
+set(CMAKE_CXX_EXTENSIONS OFF)
+
+ADD_DEFINITIONS(-O3 -g)
+
+# Define a variable to check if this is the top-level project
+if(NOT DEFINED CPPJIEBA_TOP_LEVEL_PROJECT)
+    if(CMAKE_CURRENT_SOURCE_DIR STREQUAL CMAKE_SOURCE_DIR)
+        set(CPPJIEBA_TOP_LEVEL_PROJECT ON)
+    else()
+        set(CPPJIEBA_TOP_LEVEL_PROJECT OFF)
+    endif()
+endif()
+
+if(NOT TARGET cppjieba)
+  add_library(cppjieba INTERFACE)
+  target_include_directories(cppjieba INTERFACE
+    ${PROJECT_SOURCE_DIR}/include
+    ${PROJECT_SOURCE_DIR}/deps/limonp/include
+  )
+endif()
+
+include(GNUInstallDirs)
+install(DIRECTORY include/
+        DESTINATION ${CMAKE_INSTALL_INCLUDEDIR})
+install(DIRECTORY dict/
+        DESTINATION ${CMAKE_INSTALL_DATADIR}/cppjieba/dict)
+
+if(CPPJIEBA_TOP_LEVEL_PROJECT)
+  ENABLE_TESTING()
+
+  message(STATUS "MSVC value: ${MSVC}")
+  ADD_SUBDIRECTORY(test)
+  ADD_TEST(NAME ./test/test.run COMMAND ./test/test.run)
+  ADD_TEST(NAME ./load_test COMMAND ./load_test)
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/LICENSE
new file mode 100644
index 0000000000..6308e939b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/LICENSE
@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright (c) 2013
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/VERSION b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/VERSION
new file mode 100644
index 0000000000..55a34b061a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/VERSION
@@ -0,0 +1,2 @@
+v5.6.0
+git@github.com:yanyiwu/cppjieba.git
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/.gitignore b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/.gitignore
new file mode 100644
index 0000000000..ad7223aab8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/.gitignore
@@ -0,0 +1,9 @@
+*.o
+*.ut
+libcm.a
+tags
+*.d
+build
+t.cpp
+a.out
+*.swp
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/.gitmodules b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/.gitmodules
new file mode 100644
index 0000000000..e69de29bb2
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/CHANGELOG.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/CHANGELOG.md
new file mode 100644
index 0000000000..17427cef57
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/CHANGELOG.md
@@ -0,0 +1,169 @@
+# CHANGELOG
+
+## v1.0.1
+
++ [CI] Update GitHub Actions configurations
+  - Add stale issues workflow
+  - Update checkout action from v2 to v4
+  - Update macOS test environments (remove macOS-12, add macOS-15)
++ [dep] Update googletest to release-1.12.1
++ [doc] Add build instructions to README.md
+
+## v1.0.0
+
++ rm thread pool demo
++ deleted:    include/limonp/BlockingQueue.hpp
++ deleted:    include/limonp/BoundedBlockingQueue.hpp
++ deleted:    include/limonp/BoundedQueue.hpp
++ deleted:    include/limonp/MutexLock.hpp
++ deleted:    include/limonp/Thread.hpp
++ deleted:    include/limonp/ThreadPool.hpp
++ deleted:    test/unittest/TBlockingQueue.cpp
++ deleted:    test/unittest/TBoundedQueue.cpp
++ deleted:    test/unittest/TMutexLock.cpp
++ deleted:    test/unittest/TThread.cpp
++ deleted:    test/unittest/TThreadPool.cpp
++ rm FileLock
++ rm Md5.hpp
+
+## v0.9.0
+
++ [c++20] compatibility
++ [c++17] compatibility
+
+## v0.8.1
+
++ [CI] fix windows gtest thread link error
++ [submodule] rm test/googletest
++ [CMake] FetchContent googletest
++ [CMake] required 3.5 -> 3.14
+
+## v0.8.0
+
++ [StringUtil] Fix windows assert typo
++ [CMake] find_package(Threads REQUIRED); target_link_libraries(... Threads::Threads)
++ [CMAKE][CI] windows: 2019,2022
++ [CMAKE][CI] matrix.build_type[Release, Debug]
++ [unittest] disable #TMd5.cpp
++ [unittest] disable #TFileLock.cpp
++ [unittest] disable #TBoundedQueue.cpp 
++ [unittest] disable #TMutexLock.cpp 
++ [unittest] disable #TBlockingQueue.cpp 
++ [unittest] disable #TThread.cpp 
++ [unittest] disable #TThreadPool.cpp
+
+## v0.7.2
+
++ [CI] ubuntu version from 20 to 22, macos version from 12 to 14
++ [test/unittes] uint->size_t
++ [googletest] v1.6.0->v1.10.0
++ [CMake] version required 3.0 -> 3.5
+
+## v0.7.1
+
++ [CMake] fix CMAKE_CXX_STANDARD passed from github/actions and [c++11, c++14] only
+
+## v0.7.0
+
++ [CI] Added os.macos and cpp_version=[c++98, c++03, c++11, c++14, c++17, c++20]
++ [git submodule] Added googletest-release-v1.6.0
+
+## v0.6.7
+
++ Merged [pr35](https://github.com/yanyiwu/limonp/pull/35)
++ Merged [pr33](https://github.com/yanyiwu/limonp/pull/33)
++ Merged [pr32](https://github.com/yanyiwu/limonp/pull/32)
+
+## v0.6.6
+
++ Merged [pr-31 To be compatible with cpp17 and later, use lambda instead of std::not1 & std::bind2nd #31](https://github.com/yanyiwu/limonp/pull/31)
+
+## v0.6.5
+
++ Merged [pr-25 Update cmake.yml](https://github.com/yanyiwu/limonp/pull/25)
++ Merged [pr-26 fix license for end of line sequence and remove useless signature](https://github.com/yanyiwu/limonp/pull/26)
++ Merged [pr-27 Update cmake.yml](https://github.com/yanyiwu/limonp/pull/27)
++ Merged [pr-28 add a target to be ready to support installation](https://github.com/yanyiwu/limonp/pull/28)
++ Merged [pr-29 Installable by cmake](https://github.com/yanyiwu/limonp/pull/29)
++ Merged [pr-30 Replace localtime with localtime_s on Windows and localtime_r on Linux](https://github.com/yanyiwu/limonp/pull/30)
+
+## v0.6.4
+
++ merge [fixup gcc8 warnings](https://github.com/yanyiwu/gojieba/pull/70)
+
+## v0.6.3
+
++ remove compiler conplained macro
+
+## v0.6.2
+
++ merge [pr-18](https://github.com/yanyiwu/limonp/pull/18/files)
+
+## v0.6.1
+
+add Specialized template for vector<string>
+
+when it is `vector<string>`, print like this: ["hello", "world"]; (special case)
+when it is `vector<int>`, print like this: [1, 10, 1000]; (common cases)
+
+## v0.6.0
+
++ remove Trim out of Split.
+
+## v0.5.6
+
++ fix hidden trouble.
+
+## v0.5.5
+
++ macro name LOG and CHECK in Logging.hpp is so easy to confict with other lib, so I have to rename them to XLOG and XCHECK for avoiding those macro name conflicts.
+
+## v0.5.4
+
++ add ForcePublic.hpp
++ Add Utf8ToUnicode32 and Unicode32ToUtf8 in StringUtil.hpp
+
+## v0.5.3
+
++ Fix incompatibility problem about 'time.h' in Windows.
+
+## v0.5.2
+
++ Fix incompatibility problem about `enum {INFO ...}` name conflicts in Windows .
++ So from this version begin: the compile flags: `-DLOGGING_LEVEL=WARNING` must be changed to `-DLOGGING_LEVEL=LL_WARNING`
+
+## v0.5.1
+
++ add `ThreadPool::Stop()` to wait util all the threads finished. 
+If Stop() has not been called, it will be called when the ThreadPool destructing.
+
+## v0.5.0
+
++ Reorganized directories: include/ -> include/limonp/ ... and so on.
++ Add `NewClosure` in Closure.hpp, 0~3 arguments have been supported.
++ Update ThreadPool, use `NewClosure` instead of `CreateTask`
+
+## v0.4.1
+
++ `CHECK(exp) << "log message"` supported;
+
+## v0.4.0
+
++ add test/demo.cc as example.
++ move `print` macro to StdExtension.hpp
++ BigChange: rewrite `log` module, use `LOG(INFO) << "xxx" ` instead `LogInfo` .
++ remove HandyMacro.hpp, add CHECK in Logging.hpp instead.
+
+## v0.3.0
+
++ remove 'MysqlClient.hpp', 'InitOnOff.hpp', 'CastFloat.hpp'
++ add 'Closure.hpp'
++ uniform code style
+
+## v0.2.0
+
++ `namespace limonp`, not `Limonp` .
+
+## v0.1.0
+
++ Basic functions
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/CMakeLists.txt
new file mode 100644
index 0000000000..77c4210d38
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/CMakeLists.txt
@@ -0,0 +1,61 @@
+cmake_minimum_required(VERSION 3.14)
+
+PROJECT(limonp
+        LANGUAGES CXX)
+
+################
+# cmake config #
+################
+
+if(NOT DEFINED CMAKE_CXX_STANDARD)
+    set(CMAKE_CXX_STANDARD 11)
+endif()
+message(STATUS "CMAKE_CXX_STANDARD is ${CMAKE_CXX_STANDARD}")
+
+set(CMAKE_CXX_STANDARD_REQUIRED ON)
+set(CMAKE_CXX_EXTENSIONS OFF)
+
+
+##############
+# dependency #
+##############
+include(GNUInstallDirs)
+
+##########
+# target #
+##########
+
+add_library(${PROJECT_NAME} INTERFACE)
+add_library(${PROJECT_NAME}::${PROJECT_NAME} ALIAS ${PROJECT_NAME})
+
+target_include_directories(${PROJECT_NAME}
+                           INTERFACE
+                               $<BUILD_INTERFACE:${PROJECT_SOURCE_DIR}/include>
+                               $<INSTALL_INTERFACE:${CMAKE_INSTALL_FULL_INCLUDEDIR}>)
+
+########
+# test #
+########
+
+ENABLE_TESTING()
+
+ADD_SUBDIRECTORY(test)
+ADD_TEST(NAME ./test/demo COMMAND ./test/demo)
+ADD_TEST(NAME ./test/test.run COMMAND ./test/test.run)
+
+###########
+# install #
+###########
+
+include(GNUInstallDirs)
+
+install(TARGETS ${PROJECT_NAME}
+        EXPORT ${PROJECT_NAME})
+
+install(EXPORT ${PROJECT_NAME}
+        DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/${PROJECT_NAME}/
+        NAMESPACE ${PROJECT_NAME}::
+        FILE ${PROJECT_NAME}-config.cmake)
+
+install(DIRECTORY include/
+        DESTINATION ${CMAKE_INSTALL_INCLUDEDIR})
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/LICENSE
new file mode 100644
index 0000000000..6308e939b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/LICENSE
@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright (c) 2013
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/ArgvContext.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/ArgvContext.hpp
new file mode 100644
index 0000000000..ba3abe0692
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/ArgvContext.hpp
@@ -0,0 +1,70 @@
+/************************************
+ * file enc : ascii
+ * author   : wuyanyi09@gmail.com
+ ************************************/
+
+#ifndef LIMONP_ARGV_FUNCTS_H
+#define LIMONP_ARGV_FUNCTS_H
+
+#include <set>
+#include <sstream>
+#include "StringUtil.hpp"
+
+namespace limonp {
+
+using namespace std;
+
+class ArgvContext {
+ public :
+  ArgvContext(int argc, const char* const * argv) {
+    for(int i = 0; i < argc; i++) {
+      if(StartsWith(argv[i], "-")) {
+        if(i + 1 < argc && !StartsWith(argv[i + 1], "-")) {
+          mpss_[argv[i]] = argv[i+1];
+          i++;
+        } else {
+          sset_.insert(argv[i]);
+        }
+      } else {
+        args_.push_back(argv[i]);
+      }
+    }
+  }
+  ~ArgvContext() {
+  }
+
+  friend ostream& operator << (ostream& os, const ArgvContext& args);
+  string operator [](size_t i) const {
+    if(i < args_.size()) {
+      return args_[i];
+    }
+    return "";
+  }
+  string operator [](const string& key) const {
+    map<string, string>::const_iterator it = mpss_.find(key);
+    if(it != mpss_.end()) {
+      return it->second;
+    }
+    return "";
+  }
+
+  bool HasKey(const string& key) const {
+    if(mpss_.find(key) != mpss_.end() || sset_.find(key) != sset_.end()) {
+      return true;
+    }
+    return false;
+  }
+
+ private:
+  vector<string> args_;
+  map<string, string> mpss_;
+  set<string> sset_;
+}; // class ArgvContext
+
+inline ostream& operator << (ostream& os, const ArgvContext& args) {
+  return os<<args.args_<<args.mpss_<<args.sset_;
+}
+
+} // namespace limonp
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Closure.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Closure.hpp
new file mode 100644
index 0000000000..c9d9dd49ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Closure.hpp
@@ -0,0 +1,206 @@
+#ifndef LIMONP_CLOSURE_HPP
+#define LIMONP_CLOSURE_HPP
+
+namespace limonp {
+
+class ClosureInterface {
+ public:
+  virtual ~ClosureInterface() {
+  }
+  virtual void Run() = 0;
+};
+
+template <class Funct>
+class Closure0: public ClosureInterface {
+ public:
+  Closure0(Funct fun) {
+    fun_ = fun;
+  }
+  virtual ~Closure0() {
+  }
+  virtual void Run() {
+    (*fun_)();
+  }
+ private:
+  Funct fun_;
+}; 
+
+template <class Funct, class Arg1>
+class Closure1: public ClosureInterface {
+ public:
+  Closure1(Funct fun, Arg1 arg1) {
+    fun_ = fun;
+    arg1_ = arg1;
+  }
+  virtual ~Closure1() {
+  }
+  virtual void Run() {
+    (*fun_)(arg1_);
+  }
+ private:
+  Funct fun_;
+  Arg1 arg1_;
+}; 
+
+template <class Funct, class Arg1, class Arg2>
+class Closure2: public ClosureInterface {
+ public:
+  Closure2(Funct fun, Arg1 arg1, Arg2 arg2) {
+    fun_ = fun;
+    arg1_ = arg1;
+    arg2_ = arg2;
+  }
+  virtual ~Closure2() {
+  }
+  virtual void Run() {
+    (*fun_)(arg1_, arg2_);
+  }
+ private:
+  Funct fun_;
+  Arg1 arg1_;
+  Arg2 arg2_;
+}; 
+
+template <class Funct, class Arg1, class Arg2, class Arg3>
+class Closure3: public ClosureInterface {
+ public:
+  Closure3(Funct fun, Arg1 arg1, Arg2 arg2, Arg3 arg3) {
+    fun_ = fun;
+    arg1_ = arg1;
+    arg2_ = arg2;
+    arg3_ = arg3;
+  }
+  virtual ~Closure3() {
+  }
+  virtual void Run() {
+    (*fun_)(arg1_, arg2_, arg3_);
+  }
+ private:
+  Funct fun_;
+  Arg1 arg1_;
+  Arg2 arg2_;
+  Arg3 arg3_;
+}; 
+
+template <class Obj, class Funct> 
+class ObjClosure0: public ClosureInterface {
+ public:
+  ObjClosure0(Obj* p, Funct fun) {
+   p_ = p;
+   fun_ = fun;
+  }
+  virtual ~ObjClosure0() {
+  }
+  virtual void Run() {
+    (p_->*fun_)();
+  }
+ private:
+  Obj* p_;
+  Funct fun_;
+}; 
+
+template <class Obj, class Funct, class Arg1> 
+class ObjClosure1: public ClosureInterface {
+ public:
+  ObjClosure1(Obj* p, Funct fun, Arg1 arg1) {
+   p_ = p;
+   fun_ = fun;
+   arg1_ = arg1;
+  }
+  virtual ~ObjClosure1() {
+  }
+  virtual void Run() {
+    (p_->*fun_)(arg1_);
+  }
+ private:
+  Obj* p_;
+  Funct fun_;
+  Arg1 arg1_;
+}; 
+
+template <class Obj, class Funct, class Arg1, class Arg2> 
+class ObjClosure2: public ClosureInterface {
+ public:
+  ObjClosure2(Obj* p, Funct fun, Arg1 arg1, Arg2 arg2) {
+   p_ = p;
+   fun_ = fun;
+   arg1_ = arg1;
+   arg2_ = arg2;
+  }
+  virtual ~ObjClosure2() {
+  }
+  virtual void Run() {
+    (p_->*fun_)(arg1_, arg2_);
+  }
+ private:
+  Obj* p_;
+  Funct fun_;
+  Arg1 arg1_;
+  Arg2 arg2_;
+}; 
+template <class Obj, class Funct, class Arg1, class Arg2, class Arg3> 
+class ObjClosure3: public ClosureInterface {
+ public:
+  ObjClosure3(Obj* p, Funct fun, Arg1 arg1, Arg2 arg2, Arg3 arg3) {
+   p_ = p;
+   fun_ = fun;
+   arg1_ = arg1;
+   arg2_ = arg2;
+   arg3_ = arg3;
+  }
+  virtual ~ObjClosure3() {
+  }
+  virtual void Run() {
+    (p_->*fun_)(arg1_, arg2_, arg3_);
+  }
+ private:
+  Obj* p_;
+  Funct fun_;
+  Arg1 arg1_;
+  Arg2 arg2_;
+  Arg3 arg3_;
+}; 
+
+template<class R>
+ClosureInterface* NewClosure(R (*fun)()) {
+  return new Closure0<R (*)()>(fun);
+}
+
+template<class R, class Arg1>
+ClosureInterface* NewClosure(R (*fun)(Arg1), Arg1 arg1) {
+  return new Closure1<R (*)(Arg1), Arg1>(fun, arg1);
+}
+
+template<class R, class Arg1, class Arg2>
+ClosureInterface* NewClosure(R (*fun)(Arg1, Arg2), Arg1 arg1, Arg2 arg2) {
+  return new Closure2<R (*)(Arg1, Arg2), Arg1, Arg2>(fun, arg1, arg2);
+}
+
+template<class R, class Arg1, class Arg2, class Arg3>
+ClosureInterface* NewClosure(R (*fun)(Arg1, Arg2, Arg3), Arg1 arg1, Arg2 arg2, Arg3 arg3) {
+  return new Closure3<R (*)(Arg1, Arg2, Arg3), Arg1, Arg2, Arg3>(fun, arg1, arg2, arg3);
+}
+
+template<class R, class Obj>
+ClosureInterface* NewClosure(Obj* obj, R (Obj::* fun)()) {
+  return new ObjClosure0<Obj, R (Obj::* )()>(obj, fun);
+}
+
+template<class R, class Obj, class Arg1>
+ClosureInterface* NewClosure(Obj* obj, R (Obj::* fun)(Arg1), Arg1 arg1) {
+  return new ObjClosure1<Obj, R (Obj::* )(Arg1), Arg1>(obj, fun, arg1);
+}
+
+template<class R, class Obj, class Arg1, class Arg2>
+ClosureInterface* NewClosure(Obj* obj, R (Obj::* fun)(Arg1, Arg2), Arg1 arg1, Arg2 arg2) {
+  return new ObjClosure2<Obj, R (Obj::*)(Arg1, Arg2), Arg1, Arg2>(obj, fun, arg1, arg2);
+}
+
+template<class R, class Obj, class Arg1, class Arg2, class Arg3>
+ClosureInterface* NewClosure(Obj* obj, R (Obj::* fun)(Arg1, Arg2, Arg3), Arg1 arg1, Arg2 arg2, Arg3 arg3) {
+  return new ObjClosure3<Obj, R (Obj::*)(Arg1, Arg2, Arg3), Arg1, Arg2, Arg3>(obj, fun, arg1, arg2, arg3);
+}
+
+} // namespace limonp
+
+#endif // LIMONP_CLOSURE_HPP
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Colors.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Colors.hpp
new file mode 100644
index 0000000000..04edd7eb8d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Colors.hpp
@@ -0,0 +1,31 @@
+#ifndef LIMONP_COLOR_PRINT_HPP
+#define LIMONP_COLOR_PRINT_HPP
+
+#include <string>
+#include <stdarg.h>
+
+namespace limonp {
+
+using std::string;
+
+enum Color {
+  BLACK = 30,
+  RED,
+  GREEN,
+  YELLOW,
+  BLUE,
+  PURPLE
+}; // enum Color
+
+static void ColorPrintln(enum Color color, const char * fmt, ...) {
+  va_list ap;
+  printf("\033[0;%dm", color);
+  va_start(ap, fmt);
+  vprintf(fmt, ap);
+  va_end(ap);
+  printf("\033[0m\n"); // if not \n , in some situation , the next lines will be set the same color unexpectedly
+}
+
+} // namespace limonp
+
+#endif // LIMONP_COLOR_PRINT_HPP
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Condition.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Condition.hpp
new file mode 100644
index 0000000000..656a61d7ae
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Condition.hpp
@@ -0,0 +1,38 @@
+#ifndef LIMONP_CONDITION_HPP
+#define LIMONP_CONDITION_HPP
+
+#include "MutexLock.hpp"
+
+namespace limonp {
+
+class Condition : NonCopyable {
+ public:
+  explicit Condition(MutexLock& mutex)
+    : mutex_(mutex) {
+    XCHECK(!pthread_cond_init(&pcond_, NULL));
+  }
+
+  ~Condition() {
+    XCHECK(!pthread_cond_destroy(&pcond_));
+  }
+
+  void Wait() {
+    XCHECK(!pthread_cond_wait(&pcond_, mutex_.GetPthreadMutex()));
+  }
+
+  void Notify() {
+    XCHECK(!pthread_cond_signal(&pcond_));
+  }
+
+  void NotifyAll() {
+    XCHECK(!pthread_cond_broadcast(&pcond_));
+  }
+
+ private:
+  MutexLock& mutex_;
+  pthread_cond_t pcond_;
+}; // class Condition
+
+} // namespace limonp
+
+#endif // LIMONP_CONDITION_HPP
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Config.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Config.hpp
new file mode 100644
index 0000000000..c98f22277b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Config.hpp
@@ -0,0 +1,103 @@
+/************************************
+ * file enc : utf8
+ * author   : wuyanyi09@gmail.com
+ ************************************/
+#ifndef LIMONP_CONFIG_H
+#define LIMONP_CONFIG_H
+
+#include <map>
+#include <fstream>
+#include <iostream>
+#include <assert.h>
+#include "StringUtil.hpp"
+
+namespace limonp {
+
+using namespace std;
+
+class Config {
+ public:
+  explicit Config(const string& filePath) {
+    LoadFile(filePath);
+  }
+
+  operator bool () {
+    return !map_.empty();
+  }
+
+  string Get(const string& key, const string& defaultvalue) const {
+    map<string, string>::const_iterator it = map_.find(key);
+    if(map_.end() != it) {
+      return it->second;
+    }
+    return defaultvalue;
+  }
+  int Get(const string& key, int defaultvalue) const {
+    string str = Get(key, "");
+    if("" == str) {
+      return defaultvalue;
+    }
+    return atoi(str.c_str());
+  }
+  const char* operator [] (const char* key) const {
+    if(NULL == key) {
+      return NULL;
+    }
+    map<string, string>::const_iterator it = map_.find(key);
+    if(map_.end() != it) {
+      return it->second.c_str();
+    }
+    return NULL;
+  }
+
+  string GetConfigInfo() const {
+    string res;
+    res << *this;
+    return res;
+  }
+
+ private:
+  void LoadFile(const string& filePath) {
+    ifstream ifs(filePath.c_str());
+    assert(ifs);
+    string line;
+    vector<string> vecBuf;
+    size_t lineno = 0;
+    while(getline(ifs, line)) {
+      lineno ++;
+      Trim(line);
+      if(line.empty() || StartsWith(line, "#")) {
+        continue;
+      }
+      vecBuf.clear();
+      Split(line, vecBuf, "=");
+      if(2 != vecBuf.size()) {
+        fprintf(stderr, "line[%s] illegal.\n", line.c_str());
+        assert(false);
+        continue;
+      }
+      string& key = vecBuf[0];
+      string& value = vecBuf[1];
+      Trim(key);
+      Trim(value);
+      if(!map_.insert(make_pair(key, value)).second) {
+        fprintf(stderr, "key[%s] already exits.\n", key.c_str());
+        assert(false);
+        continue;
+      }
+    }
+    ifs.close();
+  }
+
+  friend ostream& operator << (ostream& os, const Config& config);
+
+  map<string, string> map_;
+}; // class Config
+
+inline ostream& operator << (ostream& os, const Config& config) {
+  return os << config.map_;
+}
+
+} // namespace limonp
+
+#endif // LIMONP_CONFIG_H
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/ForcePublic.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/ForcePublic.hpp
new file mode 100644
index 0000000000..20766820a3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/ForcePublic.hpp
@@ -0,0 +1,7 @@
+#ifndef LIMONP_FORCE_PUBLIC_H
+#define LIMONP_FORCE_PUBLIC_H
+
+#define private public
+#define protected public
+
+#endif // LIMONP_FORCE_PUBLIC_H
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/LocalVector.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/LocalVector.hpp
new file mode 100644
index 0000000000..11339cc8e9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/LocalVector.hpp
@@ -0,0 +1,139 @@
+#ifndef LIMONP_LOCAL_VECTOR_HPP
+#define LIMONP_LOCAL_VECTOR_HPP
+
+#include <iostream>
+#include <stdlib.h>
+#include <assert.h>
+#include <string.h>
+
+namespace limonp {
+using namespace std;
+/*
+ * LocalVector<T> : T must be primitive type (char , int, size_t), if T is struct or class, LocalVector<T> may be dangerous..
+ * LocalVector<T> is simple and not well-tested.
+ */
+const size_t LOCAL_VECTOR_BUFFER_SIZE = 16;
+template <class T>
+class LocalVector {
+ public:
+  typedef const T* const_iterator ;
+  typedef T value_type;
+  typedef size_t size_type;
+ private:
+  T buffer_[LOCAL_VECTOR_BUFFER_SIZE];
+  T * ptr_;
+  size_t size_;
+  size_t capacity_;
+ public:
+  LocalVector() {
+    init_();
+  };
+  LocalVector(const LocalVector<T>& vec) {
+    init_();
+    *this = vec;
+  }
+  LocalVector(const_iterator  begin, const_iterator end) { // TODO: make it faster
+    init_();
+    while(begin != end) {
+      push_back(*begin++);
+    }
+  }
+  LocalVector(size_t size, const T& t) { // TODO: make it faster
+    init_();
+    while(size--) {
+      push_back(t);
+    }
+  }
+  ~LocalVector() {
+    if(ptr_ != buffer_) {
+      free(ptr_);
+    }
+  };
+ public:
+  LocalVector<T>& operator = (const LocalVector<T>& vec) {
+    clear();
+    size_ = vec.size();
+    capacity_ = vec.capacity();
+    if(vec.buffer_ == vec.ptr_) {
+      memcpy(static_cast<void*>(buffer_), vec.buffer_, sizeof(T) * size_);
+      ptr_ = buffer_;
+    } else {
+      ptr_ = (T*) malloc(vec.capacity() * sizeof(T));
+      assert(ptr_);
+      memcpy(static_cast<void*>(ptr_), vec.ptr_, vec.size() * sizeof(T));
+    }
+    return *this;
+  }
+ private:
+  void init_() {
+    ptr_ = buffer_;
+    size_ = 0;
+    capacity_ = LOCAL_VECTOR_BUFFER_SIZE;
+  }
+ public:
+  T& operator [] (size_t i) {
+    return ptr_[i];
+  }
+  const T& operator [] (size_t i) const {
+    return ptr_[i];
+  }
+  void push_back(const T& t) {
+    if(size_ == capacity_) {
+      assert(capacity_);
+      reserve(capacity_ * 2);
+    }
+    ptr_[size_ ++ ] = t;
+  }
+  void reserve(size_t size) {
+    if(size <= capacity_) {
+      return;
+    }
+    T * next =  (T*)malloc(sizeof(T) * size);
+    assert(next);
+    T * old = ptr_;
+    ptr_ = next;
+    memcpy(static_cast<void*>(ptr_), old, sizeof(T) * capacity_);
+    capacity_ = size;
+    if(old != buffer_) {
+      free(old);
+    }
+  }
+  bool empty() const {
+    return 0 == size();
+  }
+  size_t size() const {
+    return size_;
+  }
+  size_t capacity() const {
+    return capacity_;
+  }
+  const_iterator begin() const {
+    return ptr_;
+  }
+  const_iterator end() const {
+    return ptr_ + size_;
+  }
+  void clear() {
+    if(ptr_ != buffer_) {
+      free(ptr_);
+    }
+    init_();
+  }
+};
+
+template <class T>
+ostream & operator << (ostream& os, const LocalVector<T>& vec) {
+  if(vec.empty()) {
+    return os << "[]";
+  }
+  os<<"[\""<<vec[0];
+  for(size_t i = 1; i < vec.size(); i++) {
+    os<<"\", \""<<vec[i];
+  }
+  os<<"\"]";
+  return os;
+}
+
+}
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Logging.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Logging.hpp
new file mode 100644
index 0000000000..beb5a7e2a4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/Logging.hpp
@@ -0,0 +1,91 @@
+#ifndef LIMONP_LOGGING_HPP
+#define LIMONP_LOGGING_HPP
+
+#include <sstream>
+#include <iostream>
+#include <cassert>
+#include <cstdlib>
+#include <ctime>
+
+#ifdef XLOG
+#error "XLOG has been defined already"
+#endif // XLOG
+#ifdef XCHECK
+#error "XCHECK has been defined already"
+#endif // XCHECK
+
+#define XLOG(level) limonp::Logger(limonp::LL_##level, __FILE__, __LINE__).Stream() 
+#define XCHECK(exp) if(!(exp)) XLOG(FATAL) << "exp: ["#exp << "] false. "
+
+namespace limonp {
+
+enum {
+  LL_DEBUG = 0, 
+  LL_INFO = 1, 
+  LL_WARNING = 2, 
+  LL_ERROR = 3, 
+  LL_FATAL = 4,
+}; // enum
+
+static const char * LOG_LEVEL_ARRAY[] = {"DEBUG","INFO","WARN","ERROR","FATAL"};
+static const char * LOG_TIME_FORMAT = "%Y-%m-%d %H:%M:%S";
+
+class Logger {
+ public:
+  Logger(size_t level, const char* filename, int lineno)
+   : level_(level) {
+#ifdef LOGGING_LEVEL
+     if (level_ < LOGGING_LEVEL) {
+       return;
+     }
+#endif
+    assert(level_ <= sizeof(LOG_LEVEL_ARRAY)/sizeof(*LOG_LEVEL_ARRAY));
+    
+    char buf[32];
+    
+    time_t timeNow;
+    time(&timeNow);
+
+    struct tm tmNow;
+
+    #if defined(_WIN32) || defined(_WIN64)
+    errno_t e = localtime_s(&tmNow, &timeNow);
+    assert(e == 0);
+    #else
+    struct tm * tm_tmp = localtime_r(&timeNow, &tmNow);
+    (void)tm_tmp;
+    assert(tm_tmp != nullptr);
+    #endif
+
+    strftime(buf, sizeof(buf), LOG_TIME_FORMAT, &tmNow);
+
+    stream_ << buf 
+      << " " << filename 
+      << ":" << lineno 
+      << " " << LOG_LEVEL_ARRAY[level_] 
+      << " ";
+  }
+  ~Logger() {
+#ifdef LOGGING_LEVEL
+     if (level_ < LOGGING_LEVEL) {
+       return;
+     }
+#endif
+    std::cerr << stream_.str() << std::endl;
+    if (level_ == LL_FATAL) {
+      abort();
+    }
+  }
+
+  std::ostream& Stream() {
+    return stream_;
+  }
+
+ private:
+  std::ostringstream stream_;
+  size_t level_;
+}; // class Logger
+
+} // namespace limonp
+
+#endif // LIMONP_LOGGING_HPP
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/NonCopyable.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/NonCopyable.hpp
new file mode 100644
index 0000000000..145400f4b7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/NonCopyable.hpp
@@ -0,0 +1,21 @@
+/************************************
+ ************************************/
+#ifndef LIMONP_NONCOPYABLE_H
+#define LIMONP_NONCOPYABLE_H
+
+namespace limonp {
+
+class NonCopyable {
+ protected:
+  NonCopyable() {
+  }
+  ~NonCopyable() {
+  }
+ private:
+  NonCopyable(const NonCopyable& );
+  const NonCopyable& operator=(const NonCopyable& );
+}; // class NonCopyable
+
+} // namespace limonp
+
+#endif // LIMONP_NONCOPYABLE_H
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/StdExtension.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/StdExtension.hpp
new file mode 100644
index 0000000000..cf00e94166
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/StdExtension.hpp
@@ -0,0 +1,157 @@
+#ifndef LIMONP_STD_EXTEMSION_HPP
+#define LIMONP_STD_EXTEMSION_HPP
+
+#include <map>
+
+#ifdef __APPLE__
+#include <unordered_map>
+#include <unordered_set>
+#elif(__cplusplus >= 201103L)
+#include <unordered_map>
+#include <unordered_set>
+#elif defined _MSC_VER
+#include <unordered_map>
+#include <unordered_set>
+#else
+#include <tr1/unordered_map>
+#include <tr1/unordered_set>
+namespace std {
+using std::tr1::unordered_map;
+using std::tr1::unordered_set;
+}
+
+#endif
+
+#include <set>
+#include <string>
+#include <vector>
+#include <deque>
+#include <fstream>
+#include <sstream>
+
+namespace std {
+
+template<typename T>
+ostream& operator << (ostream& os, const vector<T>& v) {
+  if(v.empty()) {
+    return os << "[]";
+  }
+  os<<"["<<v[0];
+  for(size_t i = 1; i < v.size(); i++) {
+    os<<", "<<v[i];
+  }
+  os<<"]";
+  return os;
+}
+
+template<>
+inline ostream& operator << (ostream& os, const vector<string>& v) {
+  if(v.empty()) {
+    return os << "[]";
+  }
+  os<<"[\""<<v[0];
+  for(size_t i = 1; i < v.size(); i++) {
+    os<<"\", \""<<v[i];
+  }
+  os<<"\"]";
+  return os;
+}
+
+template<typename T>
+ostream& operator << (ostream& os, const deque<T>& dq) {
+  if(dq.empty()) {
+    return os << "[]";
+  }
+  os<<"[\""<<dq[0];
+  for(size_t i = 1; i < dq.size(); i++) {
+    os<<"\", \""<<dq[i];
+  }
+  os<<"\"]";
+  return os;
+}
+
+
+template<class T1, class T2>
+ostream& operator << (ostream& os, const pair<T1, T2>& pr) {
+  os << pr.first << ":" << pr.second ;
+  return os;
+}
+
+
+template<class T>
+string& operator << (string& str, const T& obj) {
+  stringstream ss;
+  ss << obj; // call ostream& operator << (ostream& os,
+  return str = ss.str();
+}
+
+template<class T1, class T2>
+ostream& operator << (ostream& os, const map<T1, T2>& mp) {
+  if(mp.empty()) {
+    os<<"{}";
+    return os;
+  }
+  os<<'{';
+  typename map<T1, T2>::const_iterator it = mp.begin();
+  os<<*it;
+  it++;
+  while(it != mp.end()) {
+    os<<", "<<*it;
+    it++;
+  }
+  os<<'}';
+  return os;
+}
+template<class T1, class T2>
+ostream& operator << (ostream& os, const std::unordered_map<T1, T2>& mp) {
+  if(mp.empty()) {
+    return os << "{}";
+  }
+  os<<'{';
+  typename std::unordered_map<T1, T2>::const_iterator it = mp.begin();
+  os<<*it;
+  it++;
+  while(it != mp.end()) {
+    os<<", "<<*it++;
+  }
+  return os<<'}';
+}
+
+template<class T>
+ostream& operator << (ostream& os, const set<T>& st) {
+  if(st.empty()) {
+    os << "{}";
+    return os;
+  }
+  os<<'{';
+  typename set<T>::const_iterator it = st.begin();
+  os<<*it;
+  it++;
+  while(it != st.end()) {
+    os<<", "<<*it;
+    it++;
+  }
+  os<<'}';
+  return os;
+}
+
+template<class KeyType, class ContainType>
+bool IsIn(const ContainType& contain, const KeyType& key) {
+  return contain.end() != contain.find(key);
+}
+
+template<class T>
+basic_string<T> & operator << (basic_string<T> & s, ifstream & ifs) {
+  return s.assign((istreambuf_iterator<T>(ifs)), istreambuf_iterator<T>());
+}
+
+template<class T>
+ofstream & operator << (ofstream & ofs, const basic_string<T>& s) {
+  ostreambuf_iterator<T> itr (ofs);
+  copy(s.begin(), s.end(), itr);
+  return ofs;
+}
+
+} // namespace std
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/StringUtil.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/StringUtil.hpp
new file mode 100644
index 0000000000..22c7f5c56e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/deps/limonp/include/limonp/StringUtil.hpp
@@ -0,0 +1,387 @@
+/************************************
+ * file enc : ascii
+ * author   : wuyanyi09@gmail.com
+ ************************************/
+#ifndef LIMONP_STR_FUNCTS_H
+#define LIMONP_STR_FUNCTS_H
+#include <fstream>
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+#include <cctype>
+#include <map>
+#include <cassert>
+#include <ctime>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <memory.h>
+#include <functional>
+#include <locale>
+#include <sstream>
+#include <sys/types.h>
+#include <iterator>
+#include <algorithm>
+#include "StdExtension.hpp"
+
+namespace limonp {
+using namespace std;
+inline string StringFormat(const char* fmt, ...) {
+  int size = 256;
+  std::string str;
+  va_list ap;
+  while (1) {
+    str.resize(size);
+    va_start(ap, fmt);
+    int n = vsnprintf((char *)str.c_str(), size, fmt, ap);
+    va_end(ap);
+    if (n > -1 && n < size) {
+      str.resize(n);
+      return str;
+    }
+    if (n > -1)
+      size = n + 1;
+    else
+      size *= 2;
+  }
+  return str;
+}
+
+template<class T>
+void Join(T begin, T end, string& res, const string& connector) {
+  if(begin == end) {
+    return;
+  }
+  stringstream ss;
+  ss<<*begin;
+  begin++;
+  while(begin != end) {
+    ss << connector << *begin;
+    begin ++;
+  }
+  res = ss.str();
+}
+
+template<class T>
+string Join(T begin, T end, const string& connector) {
+  string res;
+  Join(begin ,end, res, connector);
+  return res;
+}
+
+inline string& Upper(string& str) {
+  transform(str.begin(), str.end(), str.begin(), (int (*)(int))toupper);
+  return str;
+}
+
+inline string& Lower(string& str) {
+  transform(str.begin(), str.end(), str.begin(), (int (*)(int))tolower);
+  return str;
+}
+
+inline bool IsSpace(unsigned c) {
+  // when passing large int as the argument of isspace, it core dump, so here need a type cast.
+  return c > 0xff ? false : std::isspace(c & 0xff) != 0;
+}
+
+inline std::string& LTrim(std::string &s) {
+    s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](unsigned char ch) {
+        return !std::isspace(ch);
+    }));
+    return s;
+}
+
+inline std::string& RTrim(std::string &s) {
+  s.erase(std::find_if(s.rbegin(), s.rend(), [](unsigned char ch) {
+      return !std::isspace(ch);
+  }).base(), s.end());
+  return s;
+}
+
+inline std::string& Trim(std::string &s) {
+  return LTrim(RTrim(s));
+}
+
+inline std::string& LTrim(std::string& s, char x) {
+    s.erase(s.begin(), std::find_if(s.begin(), s.end(),
+      [x](unsigned char c) { return !std::isspace(c) && c != x; }));
+    return s;
+}
+
+inline std::string& RTrim(std::string& s, char x) {
+    s.erase(std::find_if(s.rbegin(), s.rend(),
+        [x](unsigned char c) { return !std::isspace(c) && c != x; }).base(), s.end());
+    return s;
+}
+
+inline std::string& Trim(std::string &s, char x) {
+  return LTrim(RTrim(s, x), x);
+}
+
+inline void Split(const string& src, vector<string>& res, const string& pattern, size_t maxsplit = string::npos) {
+  res.clear();
+  size_t Start = 0;
+  size_t end = 0;
+  string sub;
+  while(Start < src.size()) {
+    end = src.find_first_of(pattern, Start);
+    if(string::npos == end || res.size() >= maxsplit) {
+      sub = src.substr(Start);
+      res.push_back(sub);
+      return;
+    }
+    sub = src.substr(Start, end - Start);
+    res.push_back(sub);
+    Start = end + 1;
+  }
+  return;
+}
+
+inline vector<string> Split(const string& src, const string& pattern, size_t maxsplit = string::npos) {
+  vector<string> res;
+  Split(src, res, pattern, maxsplit);
+  return res;
+}
+
+inline bool StartsWith(const string& str, const string& prefix) {
+  if(prefix.length() > str.length()) {
+    return false;
+  }
+  return 0 == str.compare(0, prefix.length(), prefix);
+}
+
+inline bool EndsWith(const string& str, const string& suffix) {
+  if(suffix.length() > str.length()) {
+    return false;
+  }
+  return 0 == str.compare(str.length() -  suffix.length(), suffix.length(), suffix);
+}
+
+inline bool IsInStr(const string& str, char ch) {
+  return str.find(ch) != string::npos;
+}
+
+inline uint16_t TwocharToUint16(char high, char low) {
+  return (((uint16_t(high) & 0x00ff ) << 8) | (uint16_t(low) & 0x00ff));
+}
+
+template <class Uint16Container>
+bool Utf8ToUnicode(const char * const str, size_t len, Uint16Container& vec) {
+  if(!str) {
+    return false;
+  }
+  char ch1, ch2;
+  uint16_t tmp;
+  vec.clear();
+  for(size_t i = 0; i < len;) {
+    if(!(str[i] & 0x80)) { // 0xxxxxxx
+      vec.push_back(str[i]);
+      i++;
+    } else if ((uint8_t)str[i] <= 0xdf && i + 1 < len) { // 110xxxxxx
+      ch1 = (str[i] >> 2) & 0x07;
+      ch2 = (str[i+1] & 0x3f) | ((str[i] & 0x03) << 6 );
+      tmp = (((uint16_t(ch1) & 0x00ff ) << 8) | (uint16_t(ch2) & 0x00ff));
+      vec.push_back(tmp);
+      i += 2;
+    } else if((uint8_t)str[i] <= 0xef && i + 2 < len) {
+      ch1 = ((uint8_t)str[i] << 4) | ((str[i+1] >> 2) & 0x0f );
+      ch2 = (((uint8_t)str[i+1]<<6) & 0xc0) | (str[i+2] & 0x3f);
+      tmp = (((uint16_t(ch1) & 0x00ff ) << 8) | (uint16_t(ch2) & 0x00ff));
+      vec.push_back(tmp);
+      i += 3;
+    } else {
+      return false;
+    }
+  }
+  return true;
+}
+
+template <class Uint16Container>
+bool Utf8ToUnicode(const string& str, Uint16Container& vec) {
+  return Utf8ToUnicode(str.c_str(), str.size(), vec);
+}
+
+template <class Uint32Container>
+bool Utf8ToUnicode32(const string& str, Uint32Container& vec) {
+  uint32_t tmp;
+  vec.clear();
+  for(size_t i = 0; i < str.size();) {
+    if(!(str[i] & 0x80)) { // 0xxxxxxx
+      // 7bit, total 7bit
+      tmp = (uint8_t)(str[i]) & 0x7f;
+      i++;
+    } else if ((uint8_t)str[i] <= 0xdf && i + 1 < str.size()) { // 110xxxxxx
+      // 5bit, total 5bit
+      tmp = (uint8_t)(str[i]) & 0x1f;
+
+      // 6bit, total 11bit
+      tmp <<= 6;
+      tmp |= (uint8_t)(str[i+1]) & 0x3f;
+      i += 2;
+    } else if((uint8_t)str[i] <= 0xef && i + 2 < str.size()) { // 1110xxxxxx
+      // 4bit, total 4bit
+      tmp = (uint8_t)(str[i]) & 0x0f;
+
+      // 6bit, total 10bit
+      tmp <<= 6;
+      tmp |= (uint8_t)(str[i+1]) & 0x3f;
+
+      // 6bit, total 16bit
+      tmp <<= 6;
+      tmp |= (uint8_t)(str[i+2]) & 0x3f;
+
+      i += 3;
+    } else if((uint8_t)str[i] <= 0xf7 && i + 3 < str.size()) { // 11110xxxx
+      // 3bit, total 3bit
+      tmp = (uint8_t)(str[i]) & 0x07;
+
+      // 6bit, total 9bit
+      tmp <<= 6;
+      tmp |= (uint8_t)(str[i+1]) & 0x3f;
+
+      // 6bit, total 15bit
+      tmp <<= 6;
+      tmp |= (uint8_t)(str[i+2]) & 0x3f;
+
+      // 6bit, total 21bit
+      tmp <<= 6;
+      tmp |= (uint8_t)(str[i+3]) & 0x3f;
+
+      i += 4;
+    } else {
+      return false;
+    }
+    vec.push_back(tmp);
+  }
+  return true;
+}
+
+template <class Uint32ContainerConIter>
+void Unicode32ToUtf8(Uint32ContainerConIter begin, Uint32ContainerConIter end, string& res) {
+  res.clear();
+  uint32_t ui;
+  while(begin != end) {
+    ui = *begin;
+    if(ui <= 0x7f) {
+      res += char(ui);
+    } else if(ui <= 0x7ff) {
+      res += char(((ui >> 6) & 0x1f) | 0xc0);
+      res += char((ui & 0x3f) | 0x80);
+    } else if(ui <= 0xffff) {
+      res += char(((ui >> 12) & 0x0f) | 0xe0);
+      res += char(((ui >> 6) & 0x3f) | 0x80);
+      res += char((ui & 0x3f) | 0x80);
+    } else {
+      res += char(((ui >> 18) & 0x03) | 0xf0);
+      res += char(((ui >> 12) & 0x3f) | 0x80);
+      res += char(((ui >> 6) & 0x3f) | 0x80);
+      res += char((ui & 0x3f) | 0x80);
+    }
+    begin ++;
+  }
+}
+
+template <class Uint16ContainerConIter>
+void UnicodeToUtf8(Uint16ContainerConIter begin, Uint16ContainerConIter end, string& res) {
+  res.clear();
+  uint16_t ui;
+  while(begin != end) {
+    ui = *begin;
+    if(ui <= 0x7f) {
+      res += char(ui);
+    } else if(ui <= 0x7ff) {
+      res += char(((ui>>6) & 0x1f) | 0xc0);
+      res += char((ui & 0x3f) | 0x80);
+    } else {
+      res += char(((ui >> 12) & 0x0f )| 0xe0);
+      res += char(((ui>>6) & 0x3f )| 0x80 );
+      res += char((ui & 0x3f) | 0x80);
+    }
+    begin ++;
+  }
+}
+
+
+template <class Uint16Container>
+bool GBKTrans(const char* const str, size_t len, Uint16Container& vec) {
+  vec.clear();
+  if(!str) {
+    return true;
+  }
+  size_t i = 0;
+  while(i < len) {
+    if(0 == (str[i] & 0x80)) {
+      vec.push_back(uint16_t(str[i]));
+      i++;
+    } else {
+      if(i + 1 < len) { //&& (str[i+1] & 0x80))
+        uint16_t tmp = (((uint16_t(str[i]) & 0x00ff ) << 8) | (uint16_t(str[i+1]) & 0x00ff));
+        vec.push_back(tmp);
+        i += 2;
+      } else {
+        return false;
+      }
+    }
+  }
+  return true;
+}
+
+template <class Uint16Container>
+bool GBKTrans(const string& str, Uint16Container& vec) {
+  return GBKTrans(str.c_str(), str.size(), vec);
+}
+
+template <class Uint16ContainerConIter>
+void GBKTrans(Uint16ContainerConIter begin, Uint16ContainerConIter end, string& res) {
+  res.clear();
+  //pair<char, char> pa;
+  char first, second;
+  while(begin != end) {
+    //pa = uint16ToChar2(*begin);
+    first = ((*begin)>>8) & 0x00ff;
+    second = (*begin) & 0x00ff;
+    if(first & 0x80) {
+      res += first;
+      res += second;
+    } else {
+      res += second;
+    }
+    begin++;
+  }
+}
+
+/*
+ * format example: "%Y-%m-%d %H:%M:%S"
+ */
+inline void GetTime(const string& format, string&  timeStr) {
+  time_t timeNow;
+  time(&timeNow);
+
+  struct tm tmNow;
+
+  #if defined(_WIN32) || defined(_WIN64)
+  errno_t e = localtime_s(&tmNow, &timeNow);
+  assert(e == 0);
+  #else
+  struct tm * tm_tmp = localtime_r(&timeNow, &tmNow);
+  (void)tm_tmp;
+  assert(tm_tmp != nullptr);
+  #endif
+
+  timeStr.resize(64);
+  
+  size_t len = strftime((char*)timeStr.c_str(), timeStr.size(), format.c_str(), &tmNow);
+  
+  timeStr.resize(len);
+}
+
+inline string PathJoin(const string& path1, const string& path2) {
+  if(EndsWith(path1, "/")) {
+    return path1 + path2;
+  }
+  return path1 + "/" + path2;
+}
+
+}
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/README.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/README.md
new file mode 100644
index 0000000000..8879118986
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/README.md
@@ -0,0 +1,31 @@
+# CppJieba字典
+
+文件后缀名代表的是词典的编码方式。
+比如filename.utf8 是 utf8编码，filename.gbk 是 gbk编码方式。
+
+
+## 分词
+
+### jieba.dict.utf8/gbk
+
+作为最大概率法(MPSegment: Max Probability)分词所使用的词典。
+
+### hmm_model.utf8/gbk
+
+作为隐式马尔科夫模型(HMMSegment: Hidden Markov Model)分词所使用的词典。
+
+__对于MixSegment(混合MPSegment和HMMSegment两者)则同时使用以上两个词典__
+
+
+## 关键词抽取
+
+### idf.utf8
+
+IDF(Inverse Document Frequency)
+在KeywordExtractor中，使用的是经典的TF-IDF算法，所以需要这么一个词典提供IDF信息。
+
+### stop_words.utf8
+
+停用词词典
+
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/hmm_model.utf8 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/hmm_model.utf8
new file mode 100644
index 0000000000..2e1f807a0f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/hmm_model.utf8
@@ -0,0 +1,34 @@
+#
+#0:B
+#1:E
+#2:M
+#3:S
+#
+#B:-0.26268660809250016
+#E:-3.14e+100
+#M:-3.14e+100
+#S:-1.4652633398537678
+#prob_start
+-0.26268660809250016 -3.14e+100 -3.14e+100 -1.4652633398537678
+#prob_trans 4x4 matrix
+-3.14e+100 -0.510825623765990 -0.916290731874155 -3.14e+100
+-0.5897149736854513 -3.14e+100 -3.14e+100 -0.8085250474669937
+-3.14e+100 -0.33344856811948514 -1.2603623820268226 -3.14e+100
+-0.7211965654669841 -3.14e+100 -3.14e+100 -0.6658631448798212
+#B
+#E:-0.510825623765990,M:-0.916290731874155
+#E
+#B:-0.5897149736854513,S:-0.8085250474669937
+#M
+#E:-0.33344856811948514,M:-1.2603623820268226
+#S
+#B:-0.7211965654669841,S:-0.6658631448798212
+#prob_emit 4 lines
+#B
+耀:-10.460283,蘄:-11.015514,涉:-8.766406,谈:-8.039065,伊:-7.682602,預:-7.177710,亟:-11.905136,洞:-8.668696,咣:-13.327149,猢:-12.749514,礦:-7.891761,鶩:-17.334482,缪:-11.306203,河:-6.929795,临:-7.845071,犷:-15.388572,吸:-7.936418,娼:-12.444133,线:-8.816289,談:-8.039065,反:-6.369305,牌:-9.229778,雏:-11.365774,姑:-7.825668,織:-9.845070,遠:-7.694504,卢:-8.491877,知:-6.289929,除:-7.912099,緩:-8.461434,彪:-12.965034,觱:-15.137257,歲:-10.002113,闹:-9.824051,鯽:-13.100375,廿:-11.896403,覆:-9.290497,辊:-16.235870,鮒:-17.334482,应:-6.510851,檜:-13.645602,踟:-13.191347,崩:-10.196409,芬:-10.286095,冶:-9.681936,鍍:-12.192818,湟:-12.580892,瑣:-11.547585,鏢:-10.756621,囤:-12.607094,峨:-10.570597,括:-12.130475,虯:-12.001763,滴:-10.379843,须:-9.320808,孽:-12.780605,鹿:-8.821498,沉:-7.721882,贈:-10.636214,上:-5.739553,犍:-13.402656,后:-6.515864,碑:-10.476968,餐:-9.618467,蒙:-7.885361,枯:-9.770762,伴:-9.290177,玷:-12.589550,逶:-13.114974,离:-7.739355,羿:-14.243439,鰾:-16.235870,釋:-9.387511,鷓:-10.440826,罔:-14.444110,譜:-11.482279,盥:-13.309130,裱:-13.550292,号:-8.512012,灶:-11.059720,姻:-11.887745,忿:-11.977896,节:-7.859089,躊:-10.895132,厌:-10.228696,钎:-14.626432,紓:-17.334482,骒:-15.948188,茗:-17.334482,輟:-11.209799,倡:-9.862550,熠:-11.493840,锣:-11.140077,鬧:-9.824051,稽:-11.678490,拂:-10.697224,豉:-16.641335,克:-8.162674,坏:-9.616686,胖:-8.753188,賞:-9.753272,几:-6.133791,埤:-17.334482,巨:-7.780907,腫:-9.483599,赳:-17.334482,齿:-11.261437,舀:-17.334482,萄:-17.334482,澉:-13.933285,挖:-9.847869,嚣:-11.223015,閥:-12.940033,符:-8.404914,披:-9.290497,褲:-10.201186,锺:-17.334482,鼾:-12.011472,所:-6.051574,摄:-8.913139,凍:-10.350692,灌:-9.307005,佞:-12.598283,兢:-12.572308,学:-5.575267,翩:-12.061482,臭:-10.153651,诱:-9.506444,践:-11.647507,嫻:-11.127906,膂:-12.474670,标:-7.386930,予:-9.537191,越:-7.708132,馒:-10.633751,岔:-11.308616,耗:-9.769207,訛:-12.770134,匡:-11.732363,弩:-12.661653,纨:-13.207348,誰:-9.898454,貴:-8.043668,隸:-10.217276,颼:-12.823622,懂:-9.469294,毆:-12.108735,轉:-6.763421,配:-7.797936,魑:-14.561893,秒:-11.594689,菖:-13.967186,橛:-15.031897,江:-6.488198,连:-7.195093,癣:-15.388572,惬:-11.637388,遷:-9.248687,相:-5.809104,驻:-8.549095,好:-6.811144,鱿:-11.499671,撅:-15.725044,嘎:-12.350875,窑:-10.779125,或:-7.305993,垣:-14.444110,钥:-10.703799,麩:-14.156428,簪:-12.530461,斯:-8.052379,澳:-8.801809,蠲:-14.002277,綿:-10.029294,鸾:-14.626432,仉:-14.849575,煌:-17.334482,筐:-13.808121,曙:-11.144167,乞:-10.536541,狡:-10.690692,婦:-8.370298,绩:-11.601141,胭:-11.431849,普:-7.341199,諱:-12.498200,俳:-13.868746,雹:-14.002277,寻:-8.102869,飽:-10.003422,繾:-14.444110,會:-6.520360,誆:-14.156428,侈:-14.695425,册:-10.662449,階:-7.563384,缓:-8.461434,講:-8.162155,榜:-10.217276,负:-7.206492,疤:-12.181190,羨:-10.794896,樱:-10.468591,记:-6.676587,趴:-10.990601,庾:-12.414501,蹉:-14.076385,泊:-10.176746,遍:-9.477001,問:-6.210238,盎:-11.630699,当:-5.910792,叠:-11.325669,督:-9.493775,郢:-11.732363,嗤:-13.160095,荫:-12.791187,酷:-10.672627,矸:-13.779134,榉:-15.725044,弒:-13.620910,箕:-15.725044,挚:-12.291057,傣:-10.772038,座:-9.241631,撫:-9.622038,梳:-10.563692,锶:-16.235870,餾:-13.144827,胃:-9.949251,案:-8.722160,癌:-10.436777,飓:-12.026214,聘:-10.009333,鉤:-12.378655,秩:-9.329449,孪:-12.812693,潲:-16.235870,诵:-11.689035,當:-5.910792,釹:-15.542722,峻:-12.915641,怃:-14.695425,變:-6.595025,岐:-12.868574,蘗:-17.334482,谛:-13.573282,溜:-11.323215,訟:-12.482452,連:-7.195093,天:-5.568303,札:-12.563797,蚬:-15.948188,洱:-12.880135,邸:-13.175599,缽:-13.057816,麼:-14.038645,蕁:-13.750963,淆:-15.255040,呋:-13.223608,燎:-12.671043,習:-8.274267,汛:-11.229689,機:-5.865843,灣:-12.709509,勤:-9.540071,鷦:-16.641335,葫:-10.425727,鯪:-14.390043,曬:-11.243172,良:-8.033022,泰:-8.723981,陷:-9.062422,兹:-12.891831,综:-7.950693,驿:-11.001202,茄:-11.299000,搖:-8.454314,戚:-9.900815,钡:-13.837974,瘢:-12.522298,銥:-15.255040,綻:-12.061482,鈺:-15.948188,弼:-17.334482,臃:-12.680522,过:-6.192693,結:-6.296758,答:-8.059572,噢:-17.334482,蛭:-13.364190,執:-7.253099,瑶:-10.610649,牺:-9.525753,黽:-16.235870,寿:-9.460504,蚂:-10.952666,誊:-12.186987,麒:-12.378655,蜗:-12.163998,贛:-10.968011,丝:-8.859361,澜:-12.092735,吡:-12.297529,鄣:-17.334482,別:-7.416894,昭:-10.471724,亲:-7.228952,樵:-13.071802,讴:-12.615983,總:-6.056646,墾:-11.654309,佇:-12.436642,降:-7.883158,协:-7.355980,绒:-11.234163,驕:-10.162825,蓖:-12.952455,離:-7.739355,古:-6.752377,姨:-10.574067,柬:-10.821252,药:-7.726641,幽:-9.293713,翼:-11.415588,极:-7.454570,耄:-14.390043,殉:-10.799241,計:-6.762063,些:-11.456746,愚:-10.103195,劣:-10.639920,產:-6.146110,暫:-8.916225,礪:-17.334482,丰:-7.604158,檳:-12.051278,贲:-13.345498,券:-10.555697,鄺:-12.066624,尼:-8.674055,資:-6.152230,橈:-14.695425,雋:-13.402656,郏:-14.156428,髓:-13.808121,艘:-16.641335,淝:-14.444110,燥:-12.429207,彦:-14.561893,篩:-10.932565,奪:-8.665598,据:-8.571992,签:-8.230725,辆:-15.137257,瘋:-9.606947,和:-7.225648,瀏:-9.853490,庐:-10.389431,折:-8.595746,蠟:-10.165132,鈣:-11.678490,窨:-16.235870,漱:-12.615983,宾:-9.848429,證:-7.601605,镍:-13.779134,偏:-8.501019,齑:-13.868746,緒:-13.129789,饕:-13.402656,湛:-11.404893,臚:-15.948188,诞:-9.562572,因:-6.104676,闢:-10.909613,虫:-11.011917,擬:-10.103919,聯:-6.652450,詳:-9.036689,鑷:-13.364190,卹:-13.900495,狸:-12.643134,顿:-9.292747,蜀:-11.183879,悅:-12.011472,檉:-13.779134,锌:-14.198988,刎:-17.334482,芙:-10.170535,供:-8.184954,貝:-8.747763,樞:-9.687651,琢:-10.515558,嶧:-16.641335,枫:-12.240732,估:-8.807140,殳:-14.936587,阶:-7.563384,禿:-11.363220,騾:-10.528759,杀:-8.061824,韋:-7.830651,响:-8.940135,界:-9.351042,量:-9.767653,罐:-10.193237,壕:-12.147096,拙:-12.228536,盡:-7.579378,靠:-9.561308,呢:-12.011472,扮:-10.237761,汲:-11.275359,嗷:-12.801882,忻:-12.076987,姿:-9.716722,蒂:-11.973190,看:-6.291352,徐:-7.274162,蔗:-11.485157,掘:-11.747233,輛:-15.137257,瞠:-12.265578,倥:-14.289959,搭:-9.606066,薬:-15.255040,辰:-12.880135,嚶:-15.948188,爹:-9.198842,簽:-8.230725,媾:-12.589550,擂:-11.123882,狎:-13.837974,鹑:-15.725044,敗:-9.589479,潛:-8.148742,胚:-10.263758,埠:-15.388572,铢:-16.641335,凤:-8.621886,寨:-11.096157,旬:-13.442662,乱:-9.142465,濰:-12.147096,長:-15.255040,饿:-10.504688,斉:-15.255040,箍:-14.390043,崎:-11.647507,逐:-7.724359,阔:-10.071152,趙:-13.750963,漚:-14.769533,岣:-17.334482,焦:-8.432435,閩:-10.869894,溯:-13.207348,贮:-10.396197,茲:-12.891831,餶:-17.334482,尸:-9.076578,炻:-16.235870,桀:-13.003749,湄:-12.098040,苇:-10.947603,摈:-12.598283,黏:-11.407556,凑:-10.413810,癔:-13.808121,淙:-11.594689,佚:-13.114974,孢:-10.799241,鹤:-10.676471,坪:-13.291431,语:-7.718077,浮:-8.845277,鷹:-11.196755,僻:-12.046215,囿:-15.725044,戇:-15.542722,鰣:-11.550657,弥:-9.693398,纤:-9.056054,朵:-12.834672,紹:-10.551157,鲸:-12.530461,銼:-14.338750,襁:-12.801882,毂:-14.338750,轅:-12.181190,蕉:-13.779134,柊:-15.255040,魍:-14.561893,呓:-13.933285,牧:-9.182860,哨:-10.796342,衫:-14.338750,惰:-12.228536,葳:-15.388572,更:-7.052044,驷:-13.240137,狼:-9.964251,梁:-8.038514,溅:-14.243439,窍:-11.853843,導:-7.301415,划:-8.427005,栖:-10.292196,渚:-17.334482,芝:-10.403010,搞:-9.516454,麥:-8.974645,瀦:-13.383238,钩:-12.378655,榫:-14.038645,瘪:-14.243439,瞿:-10.530977,跃:-9.431255,仅:-8.629814,菇:-15.542722,效:-7.786384,僑:-10.375083,赘:-12.563797,婢:-12.634002,绥:-11.291849,噪:-10.751073,諭:-11.490937,俯:-9.946773,胱:-15.031897,击:-8.704853,侄:-10.251933,指:-6.480186,肆:-10.335972,蚊:-11.158615,完:-6.476926,謗:-17.334482,脛:-13.527819,堡:-11.420979,帥:-10.821252,群:-7.151660,吩:-9.260456,昵:-13.696896,爽:-10.406924,惆:-12.259308,葉:-7.762768,奋:-8.935622,驍:-11.514399,遑:-14.115606,狒:-13.868746,陕:-8.692067,束:-9.969302,忤:-13.402656,郦:-12.490295,嗨:-15.255040,雪:-8.759775,软:-8.270556,柴:-9.122185,魷:-11.499671,屹:-12.234615,剽:-12.271887,言:-8.509804,涅:-12.965034,谄:-12.163998,枉:-12.152698,禍:-10.308055,頌:-11.249982,鈐:-15.388572,儒:-9.733579,膝:-10.738701,傧:-15.031897,脲:-14.849575,常:-6.792831,值:-8.883642,髋:-13.620910,姍:-13.933285,鳏:-14.561893,发:-5.005842,篡:-11.186014,奢:-10.184565,卦:-15.948188,矩:-11.131946,陨:-11.183879,啪:-13.256944,潮:-9.219858,菱:-9.621591,勻:-11.559930,睾:-11.866422,莆:-12.868574,程:-7.298126,薊:-11.042913,醒:-10.302741,咔:-12.186987,伙:-9.515247,溘:-15.948188,舛:-15.948188,窠:-13.750963,鸣:-10.350692,粤:-11.550657,圩:-13.030417,椭:-10.509022,侮:-11.171167,蒴:-12.192818,家:-6.753418,麸:-14.156428,嶺:-10.389431,乃:-9.237664,蝉:-12.098040,屏:-9.679565,翎:-13.030417,噓:-13.057816,燒:-8.703603,诖:-17.334482,付:-8.846100,扛:-14.769533,摟:-12.466947,駢:-12.490295,峤:-17.334482,詫:-10.418758,闪:-8.709511,擴:-7.540084,顷:-10.533199,役:-11.913947,绸:-11.216385,鉻:-12.284626,兽:-10.840728,鑿:-12.297529,檁:-14.936587,謀:-9.388926,沅:-12.304044,暉:-17.334482,蜈:-10.937552,碍:-11.479410,餌:-12.451680,錐:-11.496751,倒:-8.550167,锔:-16.235870,肝:-9.673426,骡:-10.528759,鲥:-11.550657,殫:-13.256944,琪:-14.769533,踮:-16.641335,枳:-14.444110,玻:-9.249611,儼:-11.689035,獐:-13.057816,韓:-7.830577,惝:-16.235870,塢:-15.948188,湮:-12.317202,英:-6.757514,究:-9.043938,都:-8.532411,百:-6.543453,笋:-12.880135,丙:-10.895132,尥:-15.388572,鄧:-7.966198,嘩:-11.046623,覬:-12.222494,亮:-9.615352,縹:-12.181190,佃:-11.100071,拆:-9.276155,擊:-8.704853,額:-9.175107,鉑:-13.808121,論:-7.865013,俘:-10.091684,蛞:-14.501269,飢:-10.015942,照:-7.954736,鋦:-16.235870,譫:-13.291431,饷:-13.160095,幹:-6.948013,偽:-9.783295,长:-6.002791,疑:-8.936298,鐐:-13.274039,園:-9.009418,鈔:-11.588279,缢:-14.626432,沫:-13.967186,猪:-9.939374,纷:-8.616473,汀:-13.175599,橄:-11.074900,蛇:-10.780549,忍:-8.757700,郓:-12.546990,虜:-15.255040,形:-6.317920,啦:-15.137257,遨:-12.915641,迭:-12.130475,廷:-10.267162,勿:-13.085987,莊:-8.306503,馎:-17.334482,舟:-10.877712,躬:-10.221340,芴:-17.334482,屋:-8.383301,跖:-15.542722,诚:-9.446523,豫:-10.416776,滬:-11.671521,擰:-13.967186,聳:-11.131946,拴:-15.137257,她:-8.585542,盼:-10.479073,沁:-11.391683,謄:-12.186987,悉:-11.011917,脈:-9.946154,锐:-10.614262,侗:-10.577550,氖:-15.137257,蚝:-15.725044,琦:-15.948188,爪:-10.968011,伬:-15.255040,殯:-10.857510,夸:-9.495350,逾:-11.581909,慈:-8.794745,罌:-11.987374,哑:-10.384625,動:-6.792119,曝:-11.131946,童:-8.708973,烩:-13.779134,剪:-9.938760,空:-6.918500,灾:-9.139700,紋:-10.395228,芊:-17.334482,後:-15.542722,果:-8.079933,綠:-8.252884,娥:-14.769533,霧:-11.020934,倩:-13.422459,熨:-13.100375,渭:-11.076814,薰:-15.725044,莴:-13.442662,傾:-8.502916,豁:-10.480127,滂:-14.076385,鑑:-9.211221,盒:-10.896730,敛:-12.643134,损:-8.334739,胞:-12.990676,寤:-16.235870,赫:-9.332457,鋪:-9.610035,譯:-9.906743,腳:-8.316029,援:-9.451790,齷:-13.030417,塹:-13.808121,秸:-12.421827,掉:-10.741437,興:-7.540865,瞑:-12.759771,阐:-9.326449,途:-8.994503,挞:-15.388572,索:-8.829969,馥:-13.442662,咧:-12.739362,鎩:-13.696896,溫:-7.574288,梯:-10.342385,餺:-17.334482,吼:-11.201084,錾:-16.235870,俁:-15.255040,桄:-16.641335,蓇:-14.076385,扈:-11.689035,巍:-10.959457,籌:-9.246534,毙:-11.453949,翡:-11.569291,坦:-8.514817,珩:-15.137257,仫:-13.291431,敲:-10.087401,闽:-10.869894,獾:-16.641335,岌:-13.071802,鮎:-11.488043,閒:-9.118664,谗:-13.207348,纠:-9.001452,夥:-9.515247,責:-8.150178,朱:-7.158946,蚰:-13.129789,肴:-14.115606,笹:-14.501269,骸:-12.444133,钼:-13.837974,草:-7.984380,懊:-11.117876,痒:-12.240732,汗:-10.083137,廠:-9.112197,壤:-12.857145,韦:-7.830651,艳:-10.627620,惴:-12.061482,鱷:-12.071792,避:-8.408895,梅:-8.516592,抉:-10.995888,皑:-13.670920,炕:-11.563041,鄔:-10.911235,宣:-7.197386,喧:-10.235280,瘦:-10.126622,掳:-11.927310,嬸:-11.011917,瞻:-10.779125,鈾:-12.163998,仁:-9.476614,诃:-16.641335,囑:-10.302741,僕:-10.181430,乖:-10.475917,識:-9.714758,屢:-10.475917,狩:-10.805063,賭:-9.916902,蛱:-14.936587,巷:-10.895132,凿:-12.297529,貂:-12.344049,钒:-16.235870,贗:-13.114974,殘:-8.457937,斜:-9.972471,鬣:-13.223608,利:-6.731194,怵:-15.725044,庶:-11.109923,閼:-14.198988,蹁:-15.137257,惊:-7.888437,奏:-9.717214,卓:-9.519275,違:-8.627330,慟:-13.837974,苞:-12.624952,忠:-9.067033,叨:-13.085987,淬:-12.546990,襯:-10.555697,命:-7.588058,痼:-13.596812,酿:-10.246073,退:-8.122144,瞅:-12.834672,弊:-10.930908,舌:-10.186136,蠐:-14.849575,踔:-16.641335,焖:-15.542722,废:-8.501165,炫:-11.348030,漪:-15.031897,键:-11.205432,堰:-11.015514,粳:-11.601141,鬲:-14.038645,贾:-8.141898,铃:-10.599890,蛏:-15.388572,桐:-10.758012,賓:-9.848429,兖:-12.108735,痙:-11.572431,坚:-7.405814,篝:-12.228536,查:-8.275779,豨:-17.334482,駱:-9.632830,筲:-16.641335,慶:-8.860614,诽:-12.337270,仿:-8.868161,傀:-10.999428,球:-8.318090,鎂:-13.309130,馆:-10.526547,昏:-9.572737,讒:-13.207348,五:-6.609564,窜:-12.739362,鸟:-9.441283,悠:-9.135293,單:-6.775315,礱:-15.255040,改:-6.297079,蒸:-9.385743,欽:-10.041464,呃:-14.243439,珂:-16.641335,秆:-14.561893,毒:-8.564819,触:-9.390699,迪:-9.876873,独:-7.214473,维:-7.476986,艷:-10.627620,蹿:-15.255040,霄:-14.243439,堆:-9.909720,粉:-8.991166,茌:-15.948188,褐:-10.738701,輔:-9.231895,钙:-11.678490,簞:-15.137257,股:-7.196397,戢:-17.334482,販:-10.148338,鐮:-12.152698,掷:-13.256944,耶:-9.320146,榻:-14.936587,闃:-15.255040,捌:-15.948188,仕:-11.133973,潔:-10.659921,属:-8.212863,惡:-8.388107,腠:-14.289959,蝤:-15.948188,凫:-15.388572,巳:-16.235870,恶:-8.388107,智:-8.645186,汾:-11.747233,冀:-10.228696,垄:-9.766619,领:-6.296018,餛:-12.661653,箜:-13.808121,蔣:-8.032474,涨:-9.672955,爭:-7.793903,鎬:-15.031897,媲:-11.905136,樽:-15.725044,讼:-12.482452,遁:-12.857145,啃:-14.849575,狂:-9.271419,际:-12.624952,鱉:-14.936587,绊:-12.284626,擎:-12.158332,祛:-11.821053,罟:-15.137257,鳞:-11.096157,散:-8.551239,歧:-10.792010,称:-7.178447,荷:-8.793572,轿:-10.195615,而:-6.684496,訐:-15.137257,涕:-12.891831,猖:-11.211989,甚:-7.088966,辩:-9.512839,洪:-7.541256,纳:-8.439263,尴:-10.069052,茶:-8.516740,蔺:-12.186987,沿:-7.810499,輾:-11.270697,叁:-15.388572,嗅:-11.368335,苋:-13.527819,卖:-8.855614,握:-10.046238,日:-6.194404,廳:-10.447950,捶:-12.466947,蟹:-12.868574,咄:-11.996944,搏:-10.504688,逗:-10.988846,抠:-14.002277,撤:-8.281849,邬:-10.911235,垮:-12.147096,骰:-11.325669,椽:-13.670920,篆:-11.710464,緊:-7.577872,乓:-17.334482,鏖:-12.615983,桧:-13.645602,详:-9.036689,仨:-14.695425,跪:-9.509237,六:-7.626219,孱:-13.085987,鹳:-14.849575,職:-6.508801,書:-7.368818,犁:-11.263744,锄:-11.845544,尊:-8.521192,悍:-12.051278,檑:-17.334482,冗:-12.297529,隙:-13.967186,宛:-9.909124,琚:-13.463281,额:-9.175107,縞:-13.723564,芡:-14.243439,玫:-10.705119,疯:-9.606947,阮:-9.502468,嬰:-9.788036,憷:-17.334482,舶:-14.769533,涿:-11.813021,勁:-9.760951,韃:-11.470851,廉:-9.985251,慌:-9.911511,藏:-8.797486,歐:-7.389756,浔:-14.198988,剖:-10.730538,荠:-13.900495,蕤:-15.255040,滩:-11.553738,轨:-9.337492,叫:-8.165901,郭:-7.177593,癮:-14.156428,扶:-9.349338,蛹:-17.334482,摺:-15.137257,湾:-12.709509,邂:-12.407228,善:-8.747576,骆:-9.632830,很:-6.989101,攏:-15.031897,漓:-12.490295,袒:-12.234615,鴟:-11.703270,掠:-9.944300,蜣:-14.198988,斤:-12.392839,醬:-11.420979,稱:-7.178447,鶴:-10.676471,栽:-9.870545,烂:-11.229689,奇:-8.061730,糊:-10.002113,体:-6.580694,棒:-11.109923,筛:-10.932565,姜:-8.982635,點:-7.538580,諦:-13.573282,俨:-11.689035,質:-7.913557,镯:-12.546990,練:-9.313554,鈄:-14.390043,崆:-11.862211,須:-9.320808,涑:-14.390043,谐:-11.231923,岛:-8.963240,产:-6.146110,犯:-8.477679,碳:-10.093116,娴:-11.127906,治:-7.610480,蓋:-9.568065,晌:-12.152698,苏:-7.107246,汐:-15.031897,燙:-12.036165,博:-7.841975,鹜:-17.334482,表:-6.269204,韭:-12.216488,煮:-11.982624,壳:-12.087458,署:-11.423685,追:-7.944574,咀:-11.514399,戏:-8.690480,栓:-12.026214,纜:-12.119546,护:-8.713289,梨:-11.440079,眭:-15.948188,冮:-17.334482,镁:-13.309130,偃:-12.181190,濒:-10.767809,闖:-8.636135,恣:-12.198683,湧:-9.376255,鑫:-14.038645,顳:-13.779134,孵:-10.924307,詿:-17.334482,销:-8.311315,錄:-8.528058,将:-7.598881,碉:-12.056367,邙:-13.808121,麝:-12.228536,芥:-12.026214,侧:-9.364778,氦:-13.967186,疫:-10.783402,横:-8.377100,环:-7.203620,逮:-10.078185,鸲:-16.641335,嬴:-14.156428,枷:-12.451680,似:-7.702475,殿:-9.534319,品:-7.654826,獄:-10.805063,祈:-10.441840,杌:-17.334482,菏:-11.468014,呖:-14.936587,烙:-11.725010,绝:-7.607016,齜:-13.723564,塞:-9.284736,拥:-7.976239,荤:-12.868574,嗫:-12.181190,可:-5.401045,喀:-10.066259,厄:-10.891942,妈:-8.904155,骊:-13.550292,候:-8.739587,鴛:-10.616677,帝:-7.864936,榨:-10.498223,元:-7.540028,盂:-15.137257,竊:-10.935887,評:-7.764720,絛:-12.990676,飞:-7.199843,慣:-9.922322,賦:-9.142742,矬:-14.936587,山:-6.411263,婵:-14.626432,懸:-8.843427,濼:-17.334482,阀:-12.940033,逄:-14.076385,萌:-10.561402,踐:-11.647507,榕:-12.643134,蠔:-15.725044,焚:-10.238589,墟:-16.641335,攢:-12.098040,让:-9.962993,听:-7.218629,炯:-12.198683,錮:-15.388572,場:-8.147615,撷:-14.695425,謾:-12.739362,鋃:-14.338750,鳇:-11.080653,蛋:-8.925765,俑:-15.725044,桔:-12.216488,珙:-13.030417,党:-7.670585,緝:-11.415588,囫:-12.770134,闭:-8.538143,絲:-8.859361,任:-6.381152,簇:-10.725133,馊:-13.484334,怏:-12.823622,莎:-11.142119,樓:-8.613858,匙:-14.849575,鸛:-14.849575,甭:-12.759771,厮:-10.654883,缱:-14.444110,挹:-14.695425,芸:-12.357748,洽:-11.728680,貼:-9.494563,剃:-11.529347,揎:-16.235870,淒:-10.037391,勘:-10.222970,扣:-10.090254,迦:-10.968011,影:-6.990098,绰:-11.268374,驳:-11.179624,磴:-15.388572,葷:-12.868574,泼:-11.173275,需:-6.915510,鄄:-14.338750,帆:-11.076814,瀚:-13.933285,稞:-17.334482,肥:-9.165146,渦:-10.636214,株:-11.499671,唬:-13.527819,鰲:-13.160095,头:-7.386882,斷:-8.600405,榿:-15.388572,訾:-13.442662,囁:-12.181190,着:-8.298733,僅:-8.629814,嫉:-11.098112,蟋:-11.918382,敌:-7.655451,诓:-14.156428,楔:-12.087458,狙:-11.640750,鍘:-13.442662,做:-7.492817,鵜:-13.900495,蝠:-13.144827,书:-7.368818,铭:-10.729184,凯:-9.532273,籲:-14.076385,晶:-9.179982,苹:-9.969935,恺:-15.137257,賽:-8.786760,守:-8.759397,朋:-8.196067,颊:-14.390043,意:-6.523987,则:-13.383238,尝:-9.896687,綜:-7.950693,憤:-9.156404,货:-7.899479,閬:-13.550292,縱:-8.532110,馴:-10.555697,千:-7.132669,嵇:-12.310601,细:-7.606003,磊:-13.868746,拎:-14.338750,蹑:-12.371637,雖:-7.189932,变:-6.595025,捣:-10.595145,酯:-14.695425,翰:-10.282626,塵:-10.206788,轻:-7.493455,淼:-15.137257,西:-6.085379,禁:-8.373372,羅:-15.255040,儆:-15.948188,憑:-9.434587,耐:-9.340187,枕:-10.442856,缚:-12.915641,欢:-7.994518,薩:-9.004100,未:-7.582632,纯:-8.587130,嘴:-8.658748,褶:-11.048484,悻:-12.265578,础:-17.334482,鳃:-14.115606,必:-6.720867,鋇:-13.837974,嗉:-15.137257,恐:-8.442008,蓓:-14.198988,奖:-8.793963,緙:-13.750963,鱘:-11.044766,啞:-10.384625,早:-7.372820,士:-8.520449,絮:-12.350875,獲:-7.341839,韵:-10.763599,潺:-12.812693,菽:-15.948188,庄:-8.306503,栋:-13.044022,搓:-13.402656,莒:-13.309130,粘:-9.577003,逛:-11.650902,匝:-13.900495,队:-7.802275,谣:-10.792010,伥:-16.641335,邰:-11.523341,厲:-8.654320,隴:-11.245437,貸:-9.005065,挽:-9.860277,則:-13.383238,乏:-11.245437,插:-9.291782,蝕:-13.723564,穗:-12.634002,癟:-14.243439,闞:-12.977773,询:-9.595123,令:-7.853809,执:-7.253099,顫:-9.998196,蟪:-16.641335,共:-7.039324,直:-6.580908,泸:-11.550657,拼:-9.369979,倆:-11.936319,锈:-12.589550,脐:-13.207348,宗:-7.844769,砖:-9.867682,军:-6.200156,躥:-15.255040,怦:-11.113892,羯:-14.936587,疳:-14.501269,殷:-8.853123,蠶:-10.478020,踺:-15.725044,壁:-9.572311,祀:-17.334482,罄:-15.388572,歌:-8.533314,藓:-15.948188,糙:-13.696896,襠:-15.725044,滥:-10.722441,蕨:-12.317202,姫:-15.255040,髭:-13.837974,籮:-13.016994,嗳:-14.338750,牲:-10.219712,桶:-15.255040,骂:-10.714409,径:-9.470062,椋:-14.444110,隊:-7.802275,漏:-10.143806,芒:-11.664601,初:-7.505449,责:-8.150178,严:-6.980651,澤:-10.932565,茧:-12.965034,劲:-9.760951,氹:-15.031897,趸:-14.338750,人:-4.673338,莼:-11.728680,鹅:-11.538424,升:-8.023030,益:-10.191655,住:-8.490290,拒:-9.022101,處:-7.075911,浣:-14.076385,諢:-13.750963,捧:-11.725010,護:-8.713289,腻:-12.891831,匆:-9.651999,阈:-13.071802,伎:-12.310601,舐:-15.542722,龙:-7.892474,力:-7.452627,級:-9.763523,计:-6.762063,攪:-10.664984,到:-7.466673,鄲:-15.031897,吴:-6.896228,丸:-11.936319,抻:-16.641335,贺:-9.046702,撿:-13.100375,蜾:-15.542722,黃:-14.390043,巅:-12.234615,郇:-14.769533,請:-8.293034,桌:-8.692773,摔:-10.347915,遜:-11.315889,坞:-15.948188,毡:-12.087458,詠:-12.364669,駭:-10.769217,置:-9.430147,煲:-14.561893,闵:-10.556835,迹:-10.663716,松:-8.308786,樋:-13.057816,氏:-10.414798,辎:-12.114126,易:-8.841786,頗:-10.869894,沤:-14.769533,暨:-12.739362,微:-7.550848,冲:-7.733181,电:-6.253971,钴:-15.725044,魁:-10.949288,幃:-15.542722,假:-8.132779,痊:-11.706861,懒:-10.514466,鯖:-16.235870,牛:-8.090223,瑟:-12.041177,藪:-15.255040,危:-7.767797,狰:-12.016362,陳:-13.309130,衷:-11.470851,滸:-15.137257,突:-6.972589,堂:-9.838385,分:-5.653833,吊:-9.701112,与:-8.355569,抑:-9.398179,撕:-10.231160,邝:-12.066624,喟:-14.561893,誡:-14.849575,侣:-16.235870,蚩:-13.223608,箫:-12.459285,搪:-12.006606,瞳:-11.681993,進:-5.501010,訶:-16.641335,伸:-8.236639,嫁:-10.885593,組:-6.351225,采:-6.948970,诋:-12.990676,跏:-16.641335,捐:-9.941834,给:-8.680488,泥:-9.083079,赤:-8.851052,蝨:-12.364669,寫:-8.358978,巯:-14.444110,铵:-14.156428,決:-6.419430,能:-6.662299,晾:-12.834672,颂:-11.249982,嶄:-10.947603,钊:-16.641335,錛:-16.641335,涤:-12.589550,砭:-14.626432,馬:-15.255040,爱:-7.491913,傲:-10.866783,琵:-10.935887,兇:-9.249611,瓊:-10.691995,衍:-10.441840,滎:-12.530461,髖:-13.620910,忘:-9.144682,凜:-11.270697,雞:-9.212704,慧:-9.497717,苦:-8.462415,靳:-11.376057,呵:-10.952666,痴:-10.538776,荻:-13.505841,懼:-11.042913,綁:-11.538424,异:-8.281966,唆:-11.813021,踌:-10.895132,斑:-9.934472,舔:-15.542722,店:-9.502468,香:-7.617625,功:-7.444384,漢:-6.966569,讥:-10.907993,膩:-12.891831,挪:-9.990409,窯:-10.779125,炳:-13.670920,露:-8.825926,溷:-16.235870,撻:-15.388572,抿:-17.334482,脾:-9.747171,寅:-14.115606,雇:-9.640545,凉:-9.698695,扔:-11.179624,願:-8.444071,孚:-15.031897,淡:-8.691185,鏵:-15.542722,价:-7.024197,閆:-10.209199,傈:-12.652351,二:-6.454889,夙:-12.690091,碘:-11.870650,您:-11.721354,缭:-11.996944,妮:-12.891831,由:-6.817567,钰:-15.948188,朽:-12.671043,魅:-10.423731,酉:-13.779134,珊:-10.175190,柒:-15.948188,壘:-12.903665,牟:-10.572909,档:-9.722145,迢:-13.750963,彭:-8.487697,驯:-10.555697,卵:-10.248580,狴:-15.137257,曼:-9.218363,市:-6.408004,吆:-10.809452,炉:-10.167444,刊:-9.560046,撑:-11.192445,投:-6.707463,得:-6.807224,颙:-17.334482,稚:-11.862211,原:-6.105180,財:-7.170247,誥:-13.114974,肩:-9.028998,截:-8.558469,防:-7.319766,谶:-12.580892,診:-9.543786,僉:-14.115606,跋:-11.418280,仍:-8.109844,诏:-9.308966,磙:-15.948188,婚:-8.625347,靜:-8.684858,泡:-10.213229,赠:-10.636214,櫥:-12.330536,惩:-9.662655,巫:-10.207591,确:-7.386499,铱:-15.255040,凳:-11.470851,癲:-11.931805,汶:-11.541468,裹:-12.344049,麂:-14.076385,冈:-10.976640,洋:-8.942172,锛:-16.641335,殤:-17.334482,憨:-12.330536,墮:-10.929253,爵:-10.942565,根:-6.727550,驅:-9.024067,均:-9.460123,罗:-7.313345,鳖:-14.936587,姘:-13.383238,畛:-14.936587,蓦:-10.495005,魯:-8.433933,呱:-12.563797,痰:-13.422459,創:-6.920419,蕻:-17.334482,羁:-10.681619,崂:-12.868574,禅:-10.323268,圆:-8.446553,玉:-7.823519,谌:-11.343017,岗:-9.402120,编:-6.846101,猞:-13.402656,朦:-10.783402,嘰:-11.725010,锲:-13.144827,叉:-11.896403,版:-8.742181,軋:-11.949987,苓:-17.334482,篙:-17.334482,奚:-11.320767,卞:-11.074900,濡:-13.868746,蹠:-15.542722,揩:-13.723564,艨:-14.561893,壯:-8.663538,勳:-10.256140,畲:-11.566161,釵:-15.948188,劈:-11.037373,栏:-10.095267,窘:-11.739771,璜:-16.641335,速:-8.163402,訣:-11.813021,萧:-8.985234,抨:-11.196755,宮:-7.597758,隰:-15.255040,邴:-14.115606,侶:-16.235870,蒼:-9.303422,饅:-10.633751,之:-5.681482,腕:-11.681993,嫘:-11.758533,摧:-10.101026,鹫:-13.327149,自:-5.034486,顯:-7.198614,兵:-7.720678,烴:-13.309130,櫸:-15.725044,擼:-16.235870,嘆:-10.000153,暑:-11.223015,嶗:-12.868574,垛:-11.261437,砚:-13.030417,钝:-13.550292,躡:-12.371637,氢:-10.299213,怪:-9.265140,地:-5.157400,玳:-12.965034,鐲:-12.546990,舾:-15.255040,廁:-10.524339,壅:-13.550292,勉:-9.825695,材:-8.178492,站:-9.121642,塚:-14.936587,镜:-9.720663,满:-7.342160,襤:-13.383238,择:-10.458217,荨:-13.750963,快:-7.859856,右:-8.159354,郵:-8.917330,找:-8.175014,往:-7.753682,笃:-12.392839,妄:-10.199591,隆:-8.889859,邊:-7.992149,椏:-17.334482,吝:-11.996944,澠:-13.527819,推:-6.808109,咲:-15.255040,醴:-11.547585,樹:-8.120847,许:-6.795874,搽:-15.388572,鹁:-13.550292,盆:-9.256414,擒:-10.783402,睛:-16.235870,嗜:-11.703270,俠:-10.935887,正:-6.152940,賢:-9.944918,胪:-15.948188,緬:-10.233630,饯:-12.459285,噱:-13.422459,偵:-9.133096,燴:-13.779134,起:-6.272793,腿:-11.340520,挂:-9.611804,誇:-9.495350,邋:-13.100375,厍:-14.695425,随:-6.823051,抗:-7.345184,萘:-13.160095,造:-7.444738,渴:-10.158227,閹:-11.404893,稼:-13.160095,珍:-8.525216,科:-6.514724,翕:-15.137257,幔:-15.725044,苗:-9.161471,軟:-8.270556,凡:-9.168550,铣:-12.927763,巩:-9.541720,惫:-13.505841,罪:-8.994026,衰:-9.179982,泳:-12.175427,蹴:-15.137257,其:-5.887344,磻:-15.948188,驼:-11.280043,绿:-8.252884,沈:-7.721882,個:-7.167362,餑:-13.057816,攙:-11.476549,無:-6.038966,鎢:-12.759771,殲:-9.904368,鈷:-15.725044,頻:-8.562491,鸿:-11.071084,綾:-12.780605,胀:-13.808121,賈:-8.141898,俊:-11.033696,鋌:-12.482452,嗎:-12.759771,寒:-8.800825,黔:-11.769962,蕙:-15.725044,擘:-15.542722,也:-7.999449,盤:-8.973709,婧:-15.137257,糨:-14.115606,捭:-15.388572,诲:-14.338750,畹:-13.779134,醋:-12.169696,渊:-10.737336,劍:-9.074765,鞏:-9.541720,底:-8.810115,榛:-13.016994,疣:-15.388572,鴨:-10.235280,芭:-10.698535,椰:-10.834695,甸:-14.695425,妻:-8.787924,笼:-9.854618,泉:-10.186136,蹊:-11.678490,狍:-13.345498,绕:-9.903182,晚:-7.880568,迟:-9.220456,汞:-12.699753,牢:-9.454056,鯧:-14.156428,繪:-9.456327,柯:-9.190674,淳:-11.243172,轴:-10.523238,偶:-9.151085,移:-8.347160,老:-6.115270,蘅:-15.948188,构:-7.944741,消:-6.850064,儋:-14.115606,鈍:-13.550292,頑:-9.461646,鸕:-13.670920,羔:-12.284626,肖:-8.845277,貞:-10.898332,冠:-8.887282,脫:-8.493612,撮:-12.823622,吹:-9.670135,皺:-10.233630,精:-6.701033,臀:-11.291849,蟄:-13.207348,歇:-10.524339,今:-6.635855,哎:-10.880857,駐:-8.549095,佟:-11.006545,燠:-14.849575,編:-6.846101,扭:-9.680513,蓮:-9.090673,导:-7.301415,侉:-15.725044,再:-7.444941,蘘:-16.641335,沟:-9.158090,伞:-10.783402,碧:-10.163593,鸨:-13.402656,亳:-13.030417,趵:-13.808121,水:-6.093234,傷:-8.068991,瘸:-13.100375,砼:-17.334482,岿:-13.900495,旅:-7.040338,濉:-14.769533,么:-17.334482,赊:-13.207348,偌:-11.637388,饒:-10.488602,潞:-13.191347,難:-7.135419,嗥:-14.390043,擯:-12.598283,詰:-13.670920,烷:-11.858018,陸:-7.507336,茁:-12.880135,技:-6.602050,載:-9.343228,溈:-15.542722,吏:-10.011311,鴕:-12.823622,莖:-13.144827,辞:-9.363051,加:-6.314935,甥:-14.849575,缩:-9.060890,晃:-10.796342,蓄:-10.138545,城:-6.222318,姒:-16.641335,鳔:-16.235870,蝙:-11.566161,襝:-14.289959,狠:-9.842279,瓤:-14.626432,睹:-14.561893,闺:-10.825713,螃:-12.114126,怂:-12.098040,争:-7.793903,傍:-10.672627,閏:-12.834672,砒:-12.624952,蜘:-11.418280,涟:-12.498200,丞:-10.149095,錠:-13.750963,锤:-12.006606,冷:-7.896289,眸:-12.514200,礼:-8.125843,聂:-9.976926,擅:-9.729587,詆:-12.990676,兌:-9.851800,子:-7.765838,顒:-17.334482,糕:-12.001763,诛:-11.529347,跟:-8.736446,哥:-8.512897,議:-7.697372,赴:-11.183879,饼:-11.703270,幾:-6.133791,掀:-9.756848,踉:-11.216385,澈:-16.235870,逍:-11.074900,唏:-12.812693,弓:-10.155936,昙:-13.003749,栝:-14.849575,邢:-9.599923,琥:-12.016362,茫:-10.106819,暮:-11.175387,状:-7.747831,嘹:-12.530461,鴿:-10.945921,纾:-17.334482,权:-7.017693,迈:-9.717706,里:-7.861008,畏:-10.393292,柘:-14.243439,衝:-7.733181,珠:-9.151085,痤:-13.620910,奧:-8.137024,鹩:-17.334482,恭:-9.494169,蛮:-10.773451,橱:-12.330536,铺:-9.610035,黾:-16.235870,肃:-9.867111,權:-7.017693,颓:-11.273025,宕:-16.235870,暗:-8.067950,耘:-17.334482,沛:-12.709509,级:-9.763523,崦:-17.334482,嬪:-11.074900,氰:-12.709509,嚷:-11.996944,旁:-8.459335,矍:-13.573282,齒:-11.261437,敖:-11.581909,保:-6.224784,楞:-13.573282,嗡:-11.289477,睢:-13.645602,句:-10.324170,黧:-13.527819,給:-8.680488,虬:-12.001763,拯:-11.076814,選:-6.601766,系:-7.137094,鹼:-10.583380,竿:-13.900495,茅:-9.411496,抄:-10.504688,万:-6.309643,霍:-8.939230,猥:-12.791187,墨:-8.812301,憮:-14.695425,鰻:-12.615983,玺:-13.868746,禾:-11.973190,恃:-13.837974,苄:-16.641335,雌:-10.129589,體:-6.580694,惘:-13.327149,瓠:-15.542722,鍥:-13.144827,磨:-9.577003,杭:-8.514817,昂:-10.245239,氆:-13.144827,開:-5.708442,樊:-9.477001,鎏:-13.505841,岑:-10.318769,馓:-14.769533,林:-7.227768,涛:-13.463281,輜:-12.114126,羧:-12.253078,館:-10.526547,本:-6.139327,邹:-9.331453,宿:-9.512839,擁:-7.976239,担:-7.672111,豆:-9.440910,棉:-8.508188,過:-6.192693,嵐:-14.002277,孔:-8.405842,跛:-12.466947,仝:-12.952455,诟:-13.114974,員:-8.974176,釣:-10.522137,癢:-12.240732,壩:-11.315889,走:-7.251427,槳:-13.463281,譴:-10.226238,酸:-9.417674,塾:-14.289959,舅:-10.548894,瞌:-12.246886,箔:-14.002277,怙:-14.936587,渝:-13.900495,袞:-15.255040,妨:-10.831692,蔫:-13.723564,茯:-11.284748,鴻:-11.071084,帽:-10.261212,碾:-11.028207,潇:-10.276584,览:-15.388572,畋:-15.137257,韌:-11.162781,軲:-14.076385,银:-7.308113,凸:-10.563692,繽:-12.801882,飾:-11.136003,漆:-9.915101,隋:-9.577003,邏:-9.533091,猎:-9.649238,徑:-9.470062,谜:-11.747233,梟:-12.940033,唢:-12.163998,弦:-11.575580,太:-6.586114,搬:-9.927771,辱:-11.887745,爸:-9.528193,轆:-13.596812,秕:-16.235870,塔:-9.141082,杖:-16.641335,慚:-10.809452,埡:-13.779134,畢:-7.623306,鳧:-15.388572,審:-7.274247,葬:-11.024564,惯:-9.922322,瓷:-10.252773,鉸:-13.240137,鱼:-7.704576,脅:-11.654309,悄:-9.267960,倏:-11.035533,娓:-13.030417,膚:-11.370903,関:-15.137257,掮:-14.695425,液:-9.183437,匹:-10.532087,崽:-13.291431,蛀:-13.191347,汇:-8.397001,拘:-10.293070,赝:-13.114974,靡:-13.868746,酥:-12.087458,烤:-10.329600,仰:-9.658008,極:-7.454570,韶:-12.041177,勸:-9.502071,搂:-12.466947,鞋:-10.258673,斗:-7.969791,带:-7.505933,堪:-10.263758,攬:-12.589550,椴:-13.837974,喷:-9.327115,銹:-12.589550,情:-6.438409,绑:-11.538424,鱒:-14.769533,磕:-10.149853,奔:-9.077615,晖:-17.334482,进:-5.501010,囡:-16.641335,僥:-10.846798,嫩:-11.223015,轰:-9.126807,噶:-11.853843,翻:-8.301476,者:-14.626432,國:-5.037422,肚:-9.443151,語:-7.718077,瘡:-12.643134,钢:-8.370810,冤:-9.955474,麦:-8.974645,脯:-15.388572,謳:-12.615983,刹:-10.759406,鼻:-9.026036,為:-6.339373,尽:-7.579378,餿:-13.484334,浇:-10.992360,仆:-10.181430,诈:-11.082578,闌:-12.699753,峒:-17.334482,艙:-10.813861,佛:-8.470301,陡:-10.136298,遥:-9.589912,零:-8.569804,特:-6.110493,司:-7.614437,籽:-13.191347,愆:-16.235870,钓:-10.522137,谘:-17.334482,会:-6.520360,舜:-12.240732,犧:-9.525753,圪:-11.412903,训:-8.115380,簸:-12.880135,傻:-9.950492,槁:-15.031897,胛:-16.235870,蛟:-12.749514,敞:-10.763599,煦:-17.334482,嗩:-12.163998,詬:-13.114974,滯:-10.837707,聰:-9.337492,奶:-8.913579,鱸:-12.903665,啾:-16.641335,撈:-12.210518,帏:-15.542722,吓:-10.240247,視:-8.177542,缥:-12.181190,甩:-11.041063,咨:-8.888140,踯:-14.338750,涮:-14.156428,騷:-10.278307,逻:-9.533091,阿:-6.985796,疾:-8.715816,扇:-10.463391,髌:-14.695425,赙:-16.641335,拜:-9.130083,剧:-8.274499,菲:-9.933251,杵:-15.542722,絹:-12.903665,闾:-13.057816,樂:-8.187614,馋:-13.240137,昊:-13.808121,傑:-9.475455,間:-8.856445,嚕:-15.542722,业:-7.835435,茜:-13.967186,倦:-12.011472,侯:-8.912259,肱:-14.769533,朴:-9.748693,冻:-10.350692,滅:-9.395680,聆:-12.234615,孌:-13.868746,児:-13.645602,诗:-8.188360,穢:-13.207348,哩:-15.948188,譬:-10.473818,濯:-15.725044,腰:-9.437557,蝴:-10.917750,篷:-13.967186,幺:-17.334482,矿:-7.891761,澄:-10.944241,騍:-15.948188,式:-11.402237,袖:-10.224602,氙:-14.076385,蒞:-12.198683,邦:-11.591479,褫:-13.620910,險:-9.504056,輯:-12.344049,沮:-11.035533,尹:-9.097797,纺:-8.509951,刽:-12.589550,觀:-7.215560,迄:-10.444891,勒:-10.435767,淘:-10.042826,卧:-9.782245,痨:-13.114974,牽:-9.097797,链:-10.069052,肇:-11.541468,妍:-16.235870,缎:-12.198683,梗:-11.845544,抛:-9.844511,纣:-13.044022,夢:-9.267647,莱:-9.817505,戰:-6.136706,咿:-13.240137,毁:-9.702565,淅:-12.915641,荆:-7.199050,种:-7.531588,塌:-11.959204,酒:-8.134091,痕:-10.464428,苛:-11.162781,浚:-13.620910,蓟:-11.042913,杞:-11.675000,寡:-8.682758,祢:-14.289959,工:-5.286169,郧:-9.417674,番:-11.033696,衬:-10.555697,泯:-13.256944,艰:-8.873859,曳:-13.345498,磷:-9.798118,狻:-13.837974,遼:-8.820895,謁:-14.198988,檀:-11.335545,七:-7.817392,贅:-12.563797,蜉:-13.933285,暈:-10.944241,碌:-13.175599,小:-5.795450,讖:-12.580892,亘:-13.274039,螞:-10.952666,鎦:-12.407228,眩:-11.883443,谯:-13.868746,憲:-8.022849,頷:-12.952455,弹:-8.442420,綺:-11.845544,賄:-10.653627,惜:-11.992148,章:-8.695779,幣:-11.781522,革:-7.310681,業:-7.835435,迮:-17.334482,敵:-7.655451,罹:-12.977773,鷺:-13.645602,煽:-11.109923,较:-8.012690,戆:-15.542722,劑:-10.840728,咕:-10.595145,掛:-9.611804,斟:-11.033696,袭:-9.836720,花:-7.371641,缸:-13.402656,去:-7.940571,泅:-13.596812,曉:-9.602990,遒:-13.114974,仙:-8.448626,嫡:-11.578740,峥:-13.160095,牦:-11.805053,毫:-7.802928,瑪:-9.950492,柳:-8.901105,蕴:-9.869972,婶:-11.011917,痿:-15.137257,谅:-11.661159,嬋:-14.626432,鈑:-16.641335,圓:-8.446553,渙:-12.385722,思:-7.128633,宠:-10.437788,謫:-13.837974,贯:-9.033208,悲:-8.740143,诀:-11.813021,跄:-15.948188,蟈:-14.289959,筋:-10.462354,闔:-14.561893,蹙:-13.527819,內:-6.391637,险:-9.504056,忸:-12.563797,災:-9.139700,凼:-15.031897,雾:-11.020934,漂:-9.316515,攆:-13.933285,鲋:-17.334482,骏:-11.858018,礎:-17.334482,喑:-14.115606,邓:-7.966198,厕:-10.524339,碣:-13.967186,匪:-11.234163,辭:-9.363051,測:-8.180183,戴:-8.875766,康:-8.124042,砸:-11.896403,咻:-15.137257,势:-8.428224,轂:-14.338750,毅:-10.745555,應:-6.510851,荊:-7.199050,幌:-12.291057,呐:-10.633751,青:-7.051736,剔:-12.204583,苟:-10.971454,巡:-8.653471,罢:-8.706642,寥:-11.429120,畦:-15.137257,蹬:-13.967186,想:-7.116987,绷:-11.728680,孺:-13.364190,檄:-12.371637,脉:-9.946154,尋:-8.102869,續:-10.513374,锑:-15.137257,朝:-7.516008,紡:-8.509951,储:-8.506867,榮:-8.537538,耳:-8.590313,鸷:-16.235870,夹:-9.612690,鈿:-17.334482,熾:-11.845544,賀:-9.046702,桃:-8.689951,諄:-12.770134,棘:-11.325669,糠:-13.442662,酩:-14.115606,潭:-12.538691,蟲:-11.011917,覃:-11.020934,戊:-11.407556,澗:-14.936587,斛:-16.641335,蜜:-10.241077,瞧:-9.317504,否:-8.475403,刪:-10.945921,漬:-15.031897,德:-7.454519,喻:-10.247744,隽:-13.402656,眼:-6.754256,县:-7.559623,況:-10.515558,蹂:-11.284748,绍:-10.551157,彌:-9.693398,顎:-14.936587,協:-7.355980,菟:-13.808121,峡:-10.392325,韧:-11.162781,淫:-10.935887,转:-6.763421,毯:-12.634002,婺:-12.357748,谁:-9.898454,羌:-11.247707,鈕:-11.597910,昝:-14.289959,簡:-7.256201,嶠:-17.334482,室:-9.888480,钦:-10.041464,冨:-15.255040,贫:-8.418110,中:-4.596743,鼷:-17.334482,锻:-9.738090,窺:-11.166965,评:-7.764720,筏:-12.624952,佗:-15.137257,衙:-9.024805,柜:-10.848321,締:-9.846748,篤:-12.392839,適:-7.142363,蛲:-13.967186,鳶:-13.868746,白:-6.681940,郾:-13.327149,麋:-9.657081,銓:-14.695425,冕:-14.936587,記:-6.676587,萜:-14.390043,悟:-11.769962,鸠:-14.289959,崢:-13.160095,頤:-11.150333,璧:-16.641335,享:-8.531058,優:-7.083865,氬:-15.255040,岷:-12.175427,琼:-10.691995,濁:-11.954585,揉:-12.729312,腊:-10.325073,燕:-8.674575,蛛:-11.801092,楚:-8.620407,捞:-12.210518,絢:-11.146218,姥:-11.627372,铧:-15.542722,睦:-11.829150,叩:-10.137795,豬:-9.939374,拳:-9.559626,驸:-10.796342,鑼:-11.140077,茉:-12.046215,炔:-14.561893,辖:-9.850113,攝:-8.913139,莞:-13.309130,庠:-15.388572,猩:-12.114126,动:-6.792119,醪:-14.849575,舳:-15.137257,羶:-14.338750,阻:-8.544213,軀:-10.368458,摇:-8.454314,鳌:-13.160095,譙:-13.868746,齡:-14.936587,饥:-10.015942,東:-6.004002,慵:-13.327149,筹:-9.246534,哼:-11.412903,薇:-17.334482,昆:-8.842812,龋:-13.071802,馏:-13.144827,税:-9.228873,世:-6.142051,鼠:-10.956056,錨:-12.690091,倪:-9.928379,蚱:-14.769533,笸:-14.198988,钽:-14.849575,滁:-12.749514,拉:-7.815334,聊:-10.186923,糍:-10.667525,嵌:-11.311034,监:-7.448141,坐:-7.786670,兔:-10.855972,跗:-13.837974,湖:-6.170759,臟:-10.610649,濫:-10.722441,蝰:-15.542722,揳:-17.334482,并:-7.383968,澀:-14.243439,蠅:-13.240137,舉:-7.056676,授:-8.478818,弋:-13.129789,夏:-7.719477,阑:-12.699753,熔:-9.814790,標:-7.386930,鲢:-14.390043,砥:-13.837974,厨:-10.057234,邪:-10.443873,撲:-9.820227,纶:-14.626432,確:-7.386499,歃:-13.723564,规:-6.346008,哒:-15.542722,翠:-10.076774,季:-8.133485,秤:-12.759771,啧:-12.087458,諮:-17.334482,穹:-12.169696,寸:-11.520351,骇:-10.769217,肋:-11.721354,貓:-11.136003,欒:-12.056367,鐘:-8.285837,撣:-14.002277,谨:-10.133311,伪:-9.783295,爬:-10.541016,馱:-12.823622,砰:-14.076385,岳:-8.495495,讽:-10.557975,亿:-7.221058,屈:-8.901323,齊:-8.237870,蕎:-12.163998,濕:-9.064981,乔:-8.741254,飛:-7.199843,睚:-14.695425,寝:-10.772038,黟:-13.750963,絞:-10.935887,换:-8.956091,諧:-11.231923,楦:-15.388572,烫:-12.036165,鉬:-13.837974,盯:-11.125892,啮:-12.699753,拷:-11.355596,棻:-15.137257,詼:-12.181190,滿:-7.342160,炀:-12.624952,吃:-8.318090,的:-8.392936,娇:-10.252773,鴉:-10.048290,輕:-7.493455,莢:-13.550292,洩:-10.062778,疮:-12.643134,失:-7.278745,張:-6.137885,舷:-12.990676,憶:-12.253078,蠻:-10.773451,参:-6.577729,雄:-8.833012,姆:-12.634002,恋:-9.971837,苌:-17.334482,晏:-10.914487,惠:-9.610477,注:-7.381633,问:-6.210238,声:-7.248798,罵:-10.714409,閃:-8.709511,縊:-14.626432,井:-9.415489,倖:-15.137257,羟:-11.069181,质:-7.913557,个:-7.167362,缴:-10.373186,攸:-11.556830,便:-7.802493,兀:-10.419751,盅:-15.725044,顆:-10.831692,鹊:-13.240137,拍:-8.716358,滕:-10.416776,佔:-8.003961,鏗:-12.357748,駛:-10.503608,诧:-10.418758,桦:-12.216488,矯:-10.792010,饰:-11.136003,送:-8.333875,阅:-8.610925,瞄:-10.351619,鰉:-11.080653,舍:-9.380461,掌:-7.932943,蠑:-13.527819,喘:-10.615469,宜:-7.947754,怡:-10.966295,春:-8.104829,氩:-15.255040,報:-6.661673,悶:-10.784831,褻:-12.222494,輿:-9.718198,沾:-11.150333,釀:-10.246073,筇:-15.542722,態:-8.674228,廊:-11.675000,菌:-11.343017,杏:-10.857510,觐:-12.661653,浓:-8.610437,返:-9.254554,南:-6.150783,痘:-14.769533,淨:-9.690999,召:-7.701033,铮:-12.246886,胶:-9.743125,摹:-12.317202,蛺:-14.936587,颇:-10.869894,笆:-15.725044,芋:-13.207348,紊:-10.773451,椒:-13.696896,化:-7.299703,頜:-12.977773,粟:-10.825713,萤:-10.994123,梧:-11.620749,劫:-10.751073,咯:-11.426399,覽:-15.388572,格:-8.228281,病:-7.714087,蝎:-11.887745,郗:-12.357748,畚:-16.235870,鳟:-14.769533,慢:-8.573715,武:-5.718684,俩:-11.936319,浪:-9.164862,瓯:-13.645602,驰:-10.008674,绳:-10.025270,櫻:-10.468591,犀:-11.289477,锅:-9.657545,堇:-15.388572,纈:-14.849575,脍:-12.834672,檐:-15.137257,专:-6.373951,沔:-10.364691,鎖:-10.685497,墜:-10.952666,挡:-10.498223,讦:-15.137257,漩:-12.119546,亨:-10.448972,鸳:-10.616677,耷:-12.538691,癃:-14.501269,硇:-15.031897,密:-7.790387,手:-6.384588,背:-7.851598,静:-8.684858,盘:-8.973709,荡:-10.813861,轩:-10.314291,滨:-10.657398,筱:-12.522298,峴:-14.444110,藺:-12.186987,薏:-13.967186,明:-6.172732,输:-8.373629,枣:-10.303624,榧:-14.849575,徳:-15.255040,區:-7.538914,遂:-11.465185,啄:-12.530461,绉:-15.137257,彈:-8.442420,虎:-9.508438,法:-6.155771,釗:-16.641335,鯛:-14.849575,瑚:-17.334482,繞:-9.903182,恢:-8.369531,汪:-8.615491,酬:-11.529347,懷:-8.085113,蝸:-12.163998,乾:-9.348998,备:-8.593026,羈:-10.681619,耍:-11.572431,谕:-11.490937,銖:-16.641335,瘙:-12.444133,砝:-12.538691,戡:-14.936587,肢:-10.969731,誦:-11.689035,温:-7.574288,侨:-10.375083,錫:-10.146069,貪:-9.372415,倭:-11.080653,锯:-11.508482,皮:-8.086653,娱:-9.775444,碲:-15.948188,撺:-12.823622,贿:-10.653627,捋:-15.031897,臌:-16.235870,敏:-9.400327,兗:-12.108735,揠:-15.137257,蹩:-13.463281,灭:-9.395680,寰:-12.903665,飲:-8.775571,巴:-7.439732,邃:-17.334482,厅:-10.447950,紆:-17.334482,蒋:-8.032474,笊:-14.289959,窟:-11.345520,患:-8.754126,溧:-13.223608,咫:-12.990676,鞭:-10.096704,簰:-14.936587,墳:-10.525443,辽:-8.820895,呀:-15.255040,秉:-10.871452,腎:-9.784347,淑:-12.051278,毕:-7.623306,神:-6.891669,浦:-10.619099,歪:-10.950975,驴:-11.404893,泻:-12.421827,蹼:-14.501269,锁:-10.685497,璀:-12.522298,犄:-13.003749,餉:-13.160095,暌:-14.849575,沐:-11.499671,檔:-9.722145,焙:-12.770134,傘:-10.783402,缝:-10.399111,府:-10.427727,螢:-10.994123,挥:-9.238274,鐫:-12.759771,讪:-13.442662,圭:-11.936319,羲:-16.641335,掺:-11.505536,伽:-11.383839,铀:-12.163998,灃:-14.626432,埂:-16.235870,桓:-10.987093,噗:-11.927310,烘:-11.001202,络:-11.383839,擠:-10.228696,荥:-12.530461,統:-6.637414,峰:-10.610649,筵:-11.177503,醃:-11.870650,龇:-13.723564,怎:-6.761986,覓:-11.678490,吖:-17.334482,刚:-7.858322,澧:-12.680522,鲱:-13.505841,細:-7.606003,陂:-14.769533,奈:-10.661184,驊:-14.849575,蹒:-12.506168,廝:-10.654883,臣:-9.972471,痫:-16.641335,干:-6.948013,腸:-9.695321,添:-9.395680,玄:-8.671804,訕:-13.442662,縝:-12.451680,徜:-13.291431,颞:-13.779134,栩:-12.344049,說:-6.319877,嘭:-17.334482,錯:-8.290196,炮:-8.490434,就:-7.111414,餳:-16.641335,纲:-9.636453,蜷:-12.130475,贻:-11.959204,丽:-9.720663,囂:-11.223015,捏:-11.927310,楓:-12.240732,块:-11.090315,遙:-9.589912,孟:-8.730928,葡:-9.196209,无:-6.038966,槨:-17.334482,巰:-14.444110,恹:-14.626432,内:-6.391637,鲇:-11.488043,缆:-12.119546,安:-6.462225,挎:-12.652351,誓:-10.526547,洒:-11.345520,圖:-7.326724,碟:-12.163998,沧:-10.391359,伦:-8.967647,閭:-13.057816,琬:-15.137257,媳:-9.723134,破:-7.815040,莹:-13.573282,镂:-12.141525,築:-10.090254,濑:-12.216488,乐:-8.187614,叙:-9.406076,黛:-10.379843,川:-9.907933,食:-7.600834,苣:-17.334482,敢:-10.138545,潦:-12.459285,烯:-12.385722,鹰:-11.196755,顴:-12.671043,擷:-14.695425,霁:-15.948188,刃:-13.383238,將:-7.598881,窈:-13.364190,源:-9.247764,梔:-13.309130,猙:-12.016362,辦:-7.209052,親:-7.228952,逯:-13.191347,弱:-9.837275,網:-7.187107,架:-9.214191,雀:-12.284626,郄:-14.936587,忆:-12.253078,晋:-8.995459,姊:-9.861981,裔:-17.334482,呗:-15.137257,鵝:-11.538424,糜:-11.201084,曠:-10.427727,腥:-11.588279,鷲:-13.327149,蟶:-15.388572,课:-8.425247,傅:-8.944441,鶇:-15.542722,膏:-11.556830,戎:-10.526547,云:-7.874006,讓:-9.962993,疗:-9.725611,嘖:-12.087458,錘:-12.006606,倚:-11.104000,掣:-12.634002,涧:-14.936587,並:-7.383968,垫:-11.637388,钭:-14.390043,甬:-11.301396,冯:-8.139763,缰:-11.591479,害:-8.692420,芹:-12.304044,貽:-11.959204,洼:-10.868337,兄:-8.045515,操:-8.213629,滑:-9.224656,佐:-10.572909,棕:-10.369402,癖:-13.596812,務:-9.751743,駟:-13.240137,矫:-10.792010,篳:-14.501269,饴:-11.728680,旷:-10.427727,荸:-14.002277,阁:-10.342385,熄:-11.055960,崇:-8.362526,萍:-12.634002,蠕:-11.105971,榔:-14.243439,厘:-9.052758,急:-8.091287,吭:-11.236408,鄯:-12.915641,粲:-14.501269,堵:-10.113377,蔷:-12.021276,輻:-9.270160,檾:-15.255040,哂:-14.390043,运:-6.562382,柠:-11.473696,詩:-8.188360,嗬:-16.235870,批:-7.447225,胺:-13.345498,汽:-7.854114,諾:-9.592514,待:-9.214786,喉:-10.227056,袋:-11.223015,窗:-8.880868,外:-6.260046,沣:-14.626432,萨:-9.004100,鮭:-13.309130,咳:-10.140796,瘴:-13.057816,永:-7.784175,莽:-11.661159,私:-8.194457,魂:-10.896730,翅:-10.907993,酆:-13.868746,痉:-11.572431,呈:-9.690520,母:-7.978570,赎:-11.325669,荒:-8.854575,祖:-7.990310,罚:-10.279169,賣:-8.855614,止:-9.769207,苧:-12.506168,马:-6.499894,绯:-12.317202,惻:-11.987374,替:-9.419864,切:-8.608001,锉:-14.338750,脑:-8.495640,蜕:-11.931805,首:-6.757208,紙:-9.157528,岘:-14.444110,龚:-9.557108,猝:-11.668055,订:-9.646943,交:-6.487692,鐳:-15.255040,玲:-11.231923,耻:-10.995888,蘿:-11.328129,籃:-9.755314,寂:-9.880341,黄:-6.061795,片:-8.719618,准:-7.334639,蛔:-12.661653,棠:-14.198988,滤:-11.604382,围:-8.180289,瀆:-12.729312,見:-7.475730,瘊:-15.725044,戒:-9.416946,算:-8.345412,瞟:-14.198988,吞:-9.699178,涣:-12.385722,控:-7.712959,妫:-13.808121,第:-5.698216,邱:-9.457085,焰:-12.823622,喳:-14.198988,芽:-12.228536,磁:-8.877888,绅:-11.640750,遆:-17.334482,豎:-10.440826,惑:-14.390043,硖:-16.235870,繚:-11.996944,勝:-7.795557,瑞:-9.049221,橢:-10.509022,以:-5.494658,秫:-13.967186,酰:-11.841420,割:-9.857443,靴:-12.130475,荼:-13.402656,柿:-11.858018,頁:-11.610897,禀:-9.793860,伏:-9.380812,憐:-10.719756,颖:-13.291431,钞:-11.588279,校:-7.720946,渥:-12.643134,鼯:-14.626432,粮:-8.365067,嘵:-17.334482,梶:-13.309130,溺:-11.949987,蜿:-10.598702,嫂:-10.236933,囊:-11.041063,字:-8.314455,緘:-12.087458,坟:-10.525443,衡:-9.768171,濤:-13.463281,旨:-10.189286,寬:-8.668524,汹:-10.994123,宁:-8.456403,碗:-11.338030,犛:-11.805053,谤:-17.334482,馭:-16.641335,砬:-15.031897,爰:-16.641335,琴:-10.179867,边:-7.992149,游:-7.255781,膽:-8.976050,婀:-12.680522,镊:-13.364190,槍:-9.084384,轎:-10.195615,策:-8.980043,忙:-9.824599,凝:-8.963703,糯:-10.006045,窀:-17.334482,布:-7.536188,霉:-11.214184,皈:-11.785406,缙:-12.158332,次:-8.287602,津:-9.771801,薪:-9.746158,夭:-12.186987,匱:-11.883443,阳:-8.207741,髀:-15.725044,繃:-11.728680,鳄:-12.071792,橋:-8.737554,俎:-15.031897,晓:-9.602990,塗:-9.596866,齙:-15.948188,绘:-9.456327,剛:-7.858322,酝:-11.188153,祭:-8.907213,壬:-11.451160,跺:-11.858018,蟾:-11.913947,龃:-13.596812,砂:-10.097423,醇:-11.196755,爆:-8.274732,渎:-12.729312,螓:-16.235870,怒:-9.174821,玛:-9.950492,尚:-7.841598,疟:-11.849685,謠:-10.792010,贤:-9.944918,憧:-11.987374,宫:-7.597758,礬:-16.235870,钵:-13.057816,漸:-8.969741,肽:-14.626432,孀:-14.561893,糅:-13.463281,棍:-10.639920,聒:-13.044022,癞:-12.607094,桢:-15.255040,臧:-11.203255,扦:-12.977773,緯:-11.024564,石:-6.103747,腼:-12.103373,简:-7.256201,弃:-10.382710,阉:-11.404893,蠍:-11.887745,掐:-12.589550,徘:-10.942565,瀝:-11.671521,农:-6.383535,模:-7.596577,芦:-9.510036,鴯:-14.338750,吵:-10.480127,丹:-8.755441,浏:-9.853490,从:-6.751769,套:-9.571886,翘:-11.900760,燜:-15.542722,啟:-8.643840,佣:-10.949288,淤:-10.373186,姬:-10.584551,台:-7.482498,諶:-11.343017,俸:-11.849685,賺:-10.694606,恽:-12.538691,蛾:-12.759771,缂:-13.750963,宅:-10.925953,冉:-11.104000,侍:-8.643672,椎:-11.440079,崖:-11.931805,領:-6.296018,阜:-11.119874,犟:-14.038645,伢:-15.137257,暧:-12.147096,岫:-14.076385,媯:-13.808121,閱:-8.610925,傳:-6.684638,核:-7.627922,螽:-15.255040,昼:-10.463391,局:-7.945661,燉:-13.868746,偈:-14.289959,乌:-8.102184,筚:-14.501269,煞:-11.164871,裣:-14.289959,潢:-13.967186,敦:-10.125142,鹬:-14.156428,端:-9.205307,奮:-8.935622,鑰:-10.703799,鉴:-9.211221,虼:-14.695425,拿:-8.559087,窄:-12.092735,鄉:-8.186655,蔑:-11.927310,撐:-11.192445,礙:-11.479410,醞:-11.188153,薦:-13.291431,莪:-16.235870,禮:-8.125843,唱:-9.587317,殺:-8.061824,憾:-13.837974,癇:-16.641335,嗆:-15.725044,及:-7.556274,軌:-9.337492,苔:-11.644122,呛:-15.725044,盜:-9.631474,赡:-12.690091,泠:-16.235870,惨:-8.994265,廬:-10.389431,獵:-9.649238,楹:-13.933285,诺:-9.592514,岁:-10.002113,理:-6.652082,趋:-8.764127,栎:-14.444110,尖:-8.987366,餘:-7.735687,霜:-11.296611,贠:-13.484334,丢:-9.766619,缬:-14.849575,钱:-8.322836,田:-7.759082,决:-6.419430,猴:-9.906743,竅:-11.853843,先:-6.486136,鏟:-11.706861,灞:-15.031897,解:-6.571020,扪:-13.933285,镰:-12.152698,蝼:-13.003749,选:-6.601766,斐:-11.874896,骚:-10.278307,席:-10.034009,吱:-11.892064,皲:-13.933285,廂:-11.028207,哆:-11.391683,测:-8.180183,藐:-11.973190,彗:-11.797148,秘:-7.758943,陝:-8.692067,矜:-12.337270,象:-8.540112,淠:-14.695425,懨:-14.626432,繭:-12.965034,雲:-7.874006,牵:-9.097797,諺:-11.900760,征:-8.286425,紂:-13.044022,厉:-8.654320,躋:-11.146218,焊:-11.526339,攒:-12.098040,粗:-8.957241,多:-6.037749,檣:-16.641335,庫:-9.206782,瘰:-14.338750,劳:-7.231406,讹:-12.770134,樸:-15.255040,翁:-10.146069,幀:-15.255040,珉:-17.334482,酊:-15.725044,柑:-11.148273,鳗:-12.615983,雛:-11.365774,嗝:-15.137257,郟:-14.156428,信:-6.802919,绫:-12.780605,慪:-13.527819,磯:-15.255040,陰:-8.091578,遴:-12.530461,泷:-14.769533,佶:-15.725044,娃:-9.835612,餅:-11.703270,下:-5.997089,贍:-12.690091,悔:-11.420979,笙:-12.198683,鸫:-15.542722,崭:-10.947603,疲:-9.374857,谷:-8.718349,澶:-13.596812,耿:-10.128105,飄:-9.678145,蛐:-13.160095,打:-6.571422,瓜:-9.873992,轡:-13.484334,拨:-9.684789,困:-8.063988,闲:-9.118664,歹:-11.105971,劉:-6.545039,規:-6.346008,莓:-15.255040,帖:-11.627372,熟:-8.703603,斧:-11.434585,茨:-13.442662,鲭:-16.235870,妯:-13.463281,隱:-8.181559,邵:-9.242243,誹:-12.337270,蒽:-11.624055,磅:-13.100375,奄:-12.082208,陆:-7.507336,午:-8.857694,遊:-7.255781,鷗:-14.936587,硚:-11.789304,仡:-11.553738,晦:-11.440079,恪:-11.862211,鵬:-12.634002,积:-7.535966,混:-8.113993,懿:-12.429207,項:-7.700575,禄:-11.508482,唇:-11.644122,鈉:-12.056367,谍:-13.422459,涌:-9.376255,蘑:-10.839216,析:-12.158332,耕:-9.146905,憔:-11.381239,官:-6.998628,颚:-14.936587,喜:-7.599591,渡:-9.308966,侠:-10.935887,貢:-8.223520,窮:-9.402120,嘱:-10.302741,錳:-12.400008,贷:-9.005065,溶:-8.919321,蜻:-12.407228,鏈:-10.069052,潋:-15.137257,跌:-9.936308,坛:-12.222494,濠:-15.542722,补:-8.114191,癱:-11.031863,铲:-11.706861,灵:-8.145467,茂:-10.710417,芗:-14.695425,钣:-16.641335,瘤:-13.144827,般:-9.335475,踴:-11.805053,疹:-15.031897,场:-8.147615,捂:-11.866422,駑:-14.695425,筒:-12.147096,拗:-12.192818,赞:-8.673535,瓣:-12.780605,噤:-13.505841,胫:-13.527819,扬:-9.022101,俵:-14.561893,黿:-14.769533,愁:-10.914487,颐:-11.150333,缕:-12.823622,枚:-14.501269,謝:-7.852436,丟:-9.766619,涞:-13.696896,禦:-8.960005,是:-7.255697,薮:-15.255040,讲:-8.162155,爷:-9.571036,咸:-8.631805,砻:-15.255040,運:-6.562382,契:-9.522913,磐:-13.207348,录:-8.528058,教:-6.218384,諜:-13.422459,叢:-9.507241,睥:-15.031897,姦:-9.689563,旮:-13.696896,广:-6.561292,斃:-11.453949,殇:-17.334482,踊:-11.805053,經:-5.619735,攘:-12.071792,辟:-10.909613,閣:-10.342385,岩:-8.766596,茬:-14.338750,鬼:-9.370326,尾:-9.402838,胁:-11.654309,框:-10.430735,凋:-11.922836,湊:-10.413810,聖:-8.324668,虚:-8.749817,濟:-9.516454,坤:-11.841420,鹪:-16.641335,蟯:-13.967186,跳:-8.830779,仵:-12.952455,潴:-13.383238,畸:-10.644883,态:-8.674228,膀:-10.990601,咎:-13.505841,媒:-8.485973,龔:-9.557108,悖:-11.801092,訝:-13.100375,伟:-8.892228,逡:-14.198988,犢:-14.390043,纪:-7.981948,术:-10.555697,課:-8.425247,宼:-17.334482,蕃:-14.002277,柄:-17.334482,酋:-11.238657,前:-6.498988,塑:-9.397107,鵓:-13.550292,幕:-10.226238,翔:-12.572308,勢:-8.428224,卷:-9.487110,驽:-14.695425,糾:-9.001452,脂:-9.709375,丈:-8.866689,贊:-8.673535,霎:-10.570597,纓:-14.338750,尔:-9.619358,颧:-12.671043,涵:-10.421739,谴:-10.226238,禽:-10.819769,菁:-14.769533,歆:-17.334482,勋:-10.256140,浊:-11.954585,重:-5.723441,廓:-12.671043,櫛:-13.933285,監:-7.448141,苫:-14.849575,鵪:-12.965034,恬:-12.204583,蓯:-15.542722,汴:-11.394311,培:-7.876188,癸:-12.891831,硼:-12.624952,持:-8.208067,笑:-8.355317,骐:-15.948188,妒:-11.801092,紕:-12.857145,掖:-14.769533,锥:-11.496751,覲:-12.661653,稻:-10.078891,簿:-12.522298,擄:-11.927310,免:-8.428360,孑:-12.857145,楝:-15.388572,補:-8.114191,俞:-9.070119,略:-9.883821,铤:-12.482452,實:-5.752198,罩:-12.690091,黨:-7.670585,腭:-15.255040,乳:-9.081515,槲:-14.198988,赵:-7.249298,偷:-9.292747,痺:-14.243439,饽:-13.057816,王:-5.852996,儌:-17.334482,疏:-9.471985,阎:-9.764554,頒:-8.900453,崔:-9.179982,趟:-15.031897,务:-9.751743,鞣:-13.402656,缨:-14.338750,悭:-14.289959,贴:-9.494563,制:-6.238088,霸:-9.880341,苁:-15.542722,友:-8.741810,汊:-13.696896,髑:-15.388572,硒:-17.334482,鳕:-13.442662,毛:-7.388558,占:-8.003961,矣:-15.137257,啤:-10.615469,秧:-11.883443,浴:-10.803604,囹:-14.390043,壽:-9.460504,搅:-10.664984,薄:-9.345260,辈:-10.259519,嚎:-11.892064,墒:-15.388572,抖:-10.945921,鈡:-15.137257,圣:-8.324668,大:-4.615104,窦:-10.147581,鸩:-14.002277,挫:-10.229516,粪:-11.261437,支:-7.038513,漳:-11.493840,麾:-11.386447,揀:-13.527819,义:-8.047922,鍋:-9.657545,镏:-12.407228,展:-7.679776,桝:-15.255040,牡:-10.553424,嫦:-11.905136,繩:-10.025270,峪:-14.076385,話:-8.802597,佳:-9.408602,棲:-10.292196,具:-6.745048,顽:-9.461646,蜂:-10.187710,謊:-11.320767,嘌:-13.383238,依:-7.184056,那:-5.814750,厥:-17.334482,妩:-11.987374,枭:-12.940033,谰:-15.948188,段:-8.539203,訴:-9.508438,熹:-12.729312,逸:-12.555358,区:-7.538914,羽:-9.593818,夾:-9.612690,藁:-15.031897,杂:-8.393329,菅:-13.223608,仇:-9.531047,浆:-11.259136,觉:-7.544331,煎:-11.535389,壓:-7.880803,泛:-10.064169,荚:-13.550292,乜:-13.750963,櫟:-14.444110,面:-6.323687,继:-7.413744,苯:-10.812389,汰:-15.948188,雷:-8.066628,凹:-11.065386,忽:-8.006981,繼:-7.413744,袈:-11.581909,徒:-9.577003,輝:-9.831744,锡:-10.146069,帧:-15.255040,綦:-13.422459,箪:-15.137257,農:-6.383535,稿:-10.727832,擀:-13.620910,拄:-14.561893,蹇:-14.338750,坍:-12.082208,顓:-12.791187,孕:-10.367515,铠:-12.240732,鋤:-11.845544,左:-7.142213,飨:-14.289959,澇:-13.442662,谆:-12.770134,疋:-15.255040,訊:-11.156538,墩:-11.578740,沱:-12.615983,贰:-13.868746,串:-10.424729,吶:-10.633751,点:-7.538580,刺:-8.403723,纽:-9.424258,時:-5.654501,雍:-10.332326,姓:-9.606947,髕:-14.695425,作:-5.840576,院:-7.561046,卤:-10.396197,驪:-13.550292,華:-7.094308,觳:-15.725044,價:-7.024197,煸:-16.235870,鯿:-11.773800,搁:-11.678490,栉:-13.933285,撖:-15.137257,耙:-14.002277,抚:-9.622038,踝:-14.390043,弧:-10.537658,攫:-11.927310,窪:-10.868337,振:-9.114886,肮:-11.661159,躲:-9.879183,眷:-11.236408,婕:-15.948188,恙:-15.137257,臘:-10.325073,远:-7.694504,团:-7.581120,鏤:-12.141525,滲:-9.676727,坷:-15.255040,瓶:-10.492866,鹽:-9.343566,孿:-12.812693,皋:-14.289959,褊:-14.626432,同:-5.911416,帐:-10.099583,战:-6.136706,垡:-15.542722,瘠:-13.596812,銣:-17.334482,冥:-11.396946,断:-8.600405,萬:-6.309643,儺:-14.561893,綽:-11.268374,诉:-9.508438,楊:-6.713594,像:-9.381867,獎:-8.793963,駕:-9.309947,棟:-13.044022,噠:-15.542722,镢:-13.129789,糧:-8.365067,胯:-14.849575,俱:-9.540071,諳:-13.003749,铷:-17.334482,叹:-10.000153,巽:-14.289959,籼:-13.933285,蚀:-13.723564,肄:-11.566161,來:-6.497316,缑:-13.291431,颔:-12.952455,丛:-9.507241,贝:-8.747763,殞:-13.645602,尧:-12.482452,鬩:-13.808121,禪:-10.323268,怯:-11.442838,豇:-13.750963,陋:-12.671043,遏:-10.572909,奕:-13.291431,苘:-15.255040,賜:-11.252263,睡:-8.847954,煥:-10.656140,郤:-16.641335,蕭:-8.985234,揮:-9.238274,轱:-14.076385,矶:-15.255040,幻:-9.742620,篾:-13.808121,掃:-9.250228,涇:-12.114126,熏:-11.330595,夔:-14.243439,辛:-8.388368,眠:-14.769533,笨:-11.067281,播:-9.652460,蔬:-9.664987,梵:-11.037373,褴:-13.383238,嘶:-11.308616,犹:-8.955172,债:-9.412583,粽:-11.547585,埋:-9.382923,减:-7.761793,黑:-7.251218,寓:-10.648621,飕:-12.823622,旗:-9.061401,聚:-8.488561,槟:-12.051278,詞:-7.812401,坠:-10.952666,鹦:-11.699692,敬:-9.079953,潰:-10.357201,诳:-13.750963,闷:-10.784831,獸:-10.840728,峽:-10.392325,駿:-11.858018,怅:-12.364669,了:-7.786884,龐:-8.734235,暖:-9.901998,伛:-15.948188,悚:-13.837974,阡:-13.900495,匣:-11.681993,约:-8.736262,末:-9.350360,芮:-11.913947,男:-7.500612,隶:-10.217276,荃:-17.334482,汝:-10.103919,穩:-7.884967,鯨:-12.530461,葭:-17.334482,拮:-12.253078,彻:-8.846924,沃:-9.941219,謂:-12.482452,脆:-10.896730,纏:-10.396197,嘔:-10.671349,氘:-17.334482,肛:-11.490937,鲣:-14.390043,强:-6.932282,唾:-10.705119,见:-7.475730,迅:-8.083000,藉:-15.137257,金:-6.332049,哓:-17.334482,周:-6.513444,恰:-8.954025,晴:-10.352547,叽:-11.725010,椁:-17.334482,验:-10.021262,邐:-16.641335,隔:-9.255174,餡:-12.506168,瞪:-11.601141,港:-8.740143,莲:-9.090673,稷:-14.038645,岸:-10.040105,閾:-13.071802,检:-7.153287,滄:-10.391359,艇:-13.144827,鹏:-12.634002,兑:-9.851800,盔:-11.992148,浙:-8.881721,俚:-12.147096,苜:-12.990676,寢:-10.772038,铨:-14.695425,淮:-9.389635,腱:-14.076385,婷:-14.936587,訂:-9.646943,掇:-11.789304,耆:-12.006606,蘊:-9.869972,嬌:-10.252773,儐:-15.031897,膛:-13.967186,螟:-13.967186,缤:-12.801882,鎧:-12.240732,用:-6.821963,謬:-11.318325,悱:-16.235870,吾:-12.555358,裁:-9.124086,恆:-9.412946,蓉:-13.291431,始:-8.145978,忏:-11.845544,郑:-7.781829,嗓:-10.056543,雕:-9.076319,毗:-11.035533,奠:-9.573589,緣:-9.797052,驢:-11.404893,彤:-13.837974,陪:-9.589912,慰:-10.518842,獼:-11.801092,響:-8.940135,清:-6.533275,薈:-12.371637,稍:-9.698695,瀑:-10.212422,谙:-13.003749,撞:-10.261212,頡:-13.808121,鸥:-14.936587,漯:-12.690091,颶:-12.026214,钾:-11.104000,赃:-12.400008,久:-9.422425,饋:-12.615983,齏:-13.868746,菜:-9.041183,瑩:-13.573282,门:-7.100001,詭:-10.203583,佯:-12.228536,泮:-13.207348,聱:-15.948188,养:-8.177648,溃:-10.357201,褂:-12.459285,茆:-14.561893,蔊:-16.641335,鼎:-10.610649,皓:-12.965034,鄒:-9.331453,怜:-10.719756,审:-7.274247,稠:-11.376057,舰:-8.865429,羹:-15.031897,鸸:-14.338750,逼:-9.729090,证:-7.601605,捆:-11.607634,囓:-12.699753,闕:-10.593963,棗:-10.303624,乘:-8.683807,招:-7.286461,赚:-10.694606,绣:-11.006545,層:-8.990215,烧:-8.703603,器:-8.677875,諫:-12.624952,扰:-10.843758,函:-9.362361,灼:-11.389061,铿:-12.357748,有:-5.406240,颌:-12.977773,冒:-9.299527,甕:-12.323847,殖:-9.072181,枞:-13.868746,氯:-10.372238,辮:-11.296611,砷:-13.291431,庸:-10.738701,爻:-13.900495,琿:-13.573282,泄:-10.062778,卑:-9.901998,狐:-10.630068,瓔:-14.390043,胜:-7.795557,另:-7.748449,雨:-9.264514,濮:-11.785406,懲:-9.662655,矾:-16.235870,舆:-9.718198,箋:-12.990676,萊:-9.817505,綏:-11.291849,递:-9.119746,亙:-13.274039,愜:-11.637388,笠:-14.561893,眨:-11.710464,梭:-10.966295,抱:-9.156966,撵:-13.933285,娶:-11.931805,纹:-10.395228,尺:-9.823504,炽:-11.845544,促:-8.171548,桂:-9.049473,摊:-10.167444,佘:-12.169696,換:-8.956091,豚:-14.561893,虞:-10.688091,顢:-14.626432,燧:-13.422459,坨:-14.626432,诫:-14.849575,路:-7.639065,整:-6.993417,樁:-15.137257,讀:-8.428360,砍:-10.919385,閔:-10.556835,鰥:-14.561893,育:-10.071853,骶:-15.255040,冼:-12.317202,难:-7.135419,毀:-9.702565,淄:-11.681993,剑:-9.074765,珐:-12.891831,靓:-13.364190,呕:-10.671349,痔:-12.624952,还:-6.775315,癩:-12.607094,哪:-7.645612,艱:-8.873859,惲:-12.538691,葵:-11.164871,競:-8.033205,卻:-8.125743,遽:-14.695425,盾:-12.021276,梃:-15.031897,希:-7.497775,吐:-9.739095,芟:-15.137257,隧:-10.174413,瀨:-12.216488,舴:-16.641335,禹:-11.323215,頸:-10.758012,诅:-11.762328,臉:-7.713822,赖:-9.692438,譚:-8.925765,拟:-10.103919,屠:-9.533500,盧:-8.491877,俭:-11.817029,胳:-10.069752,黷:-15.031897,姹:-14.038645,發:-5.005842,洁:-10.659921,愉:-10.060002,甑:-16.641335,垒:-12.903665,猕:-11.801092,殚:-13.256944,鬥:-7.969791,嘧:-13.327149,氫:-10.299213,京:-8.096429,樯:-16.641335,縷:-12.823622,嚼:-13.550292,道:-7.247132,单:-6.775315,裘:-10.463391,絡:-11.383839,嗦:-16.641335,煩:-9.720170,部:-6.094113,只:-6.450078,呻:-10.672627,剿:-11.054086,枇:-12.634002,舊:-8.749817,頎:-13.837974,唐:-7.660156,阒:-15.255040,辗:-11.270697,薛:-8.909623,岡:-10.976640,素:-8.373757,笤:-13.383238,傩:-14.561893,抵:-8.174803,茴:-13.573282,倾:-8.502916,賁:-13.345498,摆:-8.692420,巋:-13.900495,黍:-15.137257,聞:-8.747203,秣:-15.948188,孤:-8.766596,全:-5.243427,跫:-17.334482,误:-9.137219,数:-6.581741,至:-7.486296,壹:-14.156428,祸:-10.308055,闻:-8.747203,国:-5.037422,亂:-9.142465,樅:-13.868746,膈:-17.334482,龌:-13.030417,众:-7.590400,红:-7.069028,鲶:-11.743495,画:-8.404385,猿:-12.071792,邾:-17.334482,淀:-11.146218,蝇:-13.240137,懈:-12.624952,翌:-10.539895,魏:-8.195638,晝:-10.463391,廢:-8.501165,鯤:-15.137257,蹭:-14.561893,森:-8.522830,葱:-11.732363,曲:-8.454314,彷:-12.344049,项:-7.700575,竺:-11.773800,陽:-8.207741,卿:-12.297529,一:-3.654498,撇:-10.740068,蜆:-15.948188,脊:-9.865969,锒:-14.338750,倔:-11.496751,搜:-8.057231,御:-8.960005,妥:-9.840608,钧:-13.327149,厩:-14.936587,爨:-17.334482,谬:-11.318325,夺:-8.665598,匾:-9.832295,迁:-9.248687,觅:-11.678490,杆:-10.505770,泗:-12.169696,惟:-9.656618,荞:-12.163998,竣:-10.802148,靦:-12.103373,酪:-13.645602,对:-6.221199,電:-6.253971,漁:-8.843017,椅:-9.912706,按:-7.669442,納:-8.439263,隐:-8.181559,焕:-10.656140,謙:-10.333236,綢:-11.216385,吧:-12.903665,议:-7.697372,戳:-12.880135,簷:-15.137257,棄:-10.382710,拈:-10.849847,糌:-14.038645,顏:-8.592546,坑:-10.473818,盐:-9.343566,歙:-12.990676,敝:-13.463281,罡:-15.948188,黠:-13.422459,巢:-10.865232,祥:-11.080653,赭:-13.057816,噻:-13.044022,偿:-10.719756,現:-6.000922,殃:-13.256944,文:-5.723876,蘆:-9.510036,福:-8.010634,騎:-8.728912,攜:-9.510036,缠:-10.396197,助:-8.929338,沭:-13.207348,贬:-10.400085,暱:-13.696896,悵:-12.364669,帶:-7.505933,璽:-13.868746,求:-8.243038,装:-7.298564,穎:-13.291431,痧:-17.334482,迫:-8.903500,杰:-9.475455,韻:-10.763599,哽:-10.994123,栅:-12.071792,簍:-13.160095,咒:-11.287110,瀕:-10.767809,準:-7.334639,萝:-11.328129,鸡:-9.212704,唧:-11.340520,漫:-9.323790,蒲:-9.791738,激:-7.534911,齋:-10.973179,屍:-9.076578,偕:-12.965034,他:-5.822797,橙:-11.762328,诘:-13.670920,繡:-11.006545,物:-7.195883,鏨:-16.235870,虱:-12.364669,擲:-13.256944,绶:-14.338750,驹:-14.002277,磺:-12.357748,鑽:-9.440910,倀:-16.641335,專:-6.373951,且:-10.194029,颛:-12.791187,宝:-7.675298,麟:-14.561893,怠:-11.308616,氨:-10.074662,售:-10.190075,禱:-11.927310,頰:-14.390043,方:-5.790891,狗:-10.100305,员:-8.974176,靚:-13.364190,统:-6.637414,郫:-13.596812,叭:-15.255040,雯:-15.137257,鳳:-8.621886,念:-9.189512,摸:-9.880920,邀:-9.155563,厂:-9.112197,妆:-12.506168,鲈:-12.903665,漕:-10.526547,列:-7.766467,错:-8.290196,探:-7.885676,蜥:-12.378655,贩:-10.148338,劬:-15.255040,户:-9.077875,螺:-10.114108,趾:-12.834672,允:-9.174821,聋:-12.051278,拌:-12.598283,虏:-15.255040,何:-7.105800,滔:-11.098112,留:-7.672111,州:-9.153321,来:-6.497316,蛤:-11.706861,浩:-9.989117,噯:-14.338750,饱:-10.003422,懶:-10.514466,蕹:-15.725044,譽:-9.976926,儀:-8.385376,順:-7.836785,憋:-12.652351,萎:-10.924307,涓:-13.057816,鎗:-15.255040,甘:-8.378260,龟:-10.895132,愠:-13.383238,吮:-12.759771,碱:-10.583380,纵:-8.532110,鼴:-14.338750,郁:-9.962364,雅:-8.976050,寇:-11.275359,苍:-9.303422,孜:-12.915641,翟:-10.405944,獬:-14.849575,數:-6.581741,歼:-9.904368,床:-9.145237,戍:-12.350875,树:-8.120847,辔:-13.484334,北:-5.927006,炖:-13.868746,皚:-13.670920,弟:-8.160494,抢:-9.033953,梦:-9.267647,谩:-12.739362,溪:-10.647373,眯:-12.940033,钮:-11.597910,紳:-11.640750,漿:-11.259136,屉:-15.137257,腋:-11.699692,槐:-10.988846,赓:-17.334482,僖:-14.243439,瑙:-13.207348,囚:-10.615469,汩:-12.801882,跨:-9.243467,八:-7.220977,仪:-8.385376,鉭:-14.849575,坯:-13.175599,瓮:-12.323847,顱:-11.982624,鹵:-10.396197,惶:-10.604658,使:-6.861457,泾:-12.114126,刀:-8.828957,鄂:-7.959729,各:-5.821816,师:-7.038007,褒:-11.813021,邗:-13.085987,瘘:-14.501269,妝:-12.506168,鲟:-11.044766,箱:-10.407905,騰:-10.179867,蠼:-17.334482,壇:-12.222494,筆:-8.111127,臍:-13.207348,李:-5.983511,译:-9.906743,仓:-9.745652,噘:-15.031897,糟:-10.266310,棧:-12.001763,警:-8.232395,凭:-9.434587,銀:-7.308113,缉:-11.415588,肌:-9.330116,貔:-15.031897,玖:-15.388572,娛:-9.775444,羞:-10.198795,蔥:-11.732363,輩:-10.259519,涪:-11.987374,催:-9.400327,薺:-13.900495,达:-7.354589,十:-6.007344,狀:-7.747831,终:-7.483499,泔:-13.723564,取:-7.114907,嗚:-11.035533,祝:-9.350019,捡:-13.100375,矮:-10.256140,平:-5.981490,揶:-13.274039,旺:-10.500373,濾:-11.604382,匀:-11.559930,适:-7.142363,唄:-15.137257,弈:-13.967186,挠:-12.709509,攤:-10.167444,亩:-12.749514,炭:-11.002980,嘮:-11.805053,粵:-11.550657,暹:-12.589550,举:-7.056676,鋁:-10.718417,埃:-8.624192,铅:-10.449995,穆:-8.991166,鹞:-12.927763,試:-7.778710,豪:-9.041183,煬:-12.624952,闯:-8.636135,读:-8.428360,楼:-8.613858,琅:-13.723564,縉:-12.158332,趔:-12.927763,阙:-10.593963,营:-7.760124,踩:-12.624952,猫:-11.136003,沪:-11.671521,冬:-8.858944,甯:-15.255040,宰:-9.755825,愷:-15.137257,蒺:-13.291431,剁:-14.561893,珀:-12.259308,痄:-15.388572,硝:-10.186136,菠:-11.273025,藤:-10.119977,卫:-7.758874,遭:-8.189854,目:-6.524148,驱:-9.024067,彳:-16.641335,虹:-11.535389,擺:-8.692420,衽:-17.334482,滾:-9.526972,鴆:-14.002277,梓:-11.650902,隗:-11.535389,写:-8.358978,瀘:-11.550657,鲛:-15.725044,瞭:-11.870650,綱:-9.636453,耸:-11.131946,絆:-12.284626,慎:-10.546637,跑:-10.286095,试:-7.778710,盗:-9.631474,镖:-10.756621,竟:-8.143936,饞:-13.240137,赦:-11.936319,癬:-15.388572,鋯:-13.620910,己:-10.974908,寵:-10.437788,穴:-9.835612,恸:-13.837974,賻:-16.641335,垂:-9.022592,颈:-10.758012,服:-7.223411,蚌:-11.728680,嘗:-9.896687,疖:-15.031897,鄙:-10.355337,娟:-13.596812,蔡:-8.345038,枢:-9.687651,丧:-9.218662,润:-10.633751,莺:-14.390043,啁:-14.115606,卅:-14.390043,狄:-9.550009,奉:-8.992118,術:-10.555697,嗖:-12.791187,煙:-8.754126,黜:-15.948188,苤:-17.334482,裨:-13.309130,副:-9.327781,时:-5.654501,腹:-8.918436,载:-9.343228,斋:-10.973179,掏:-10.000806,備:-8.593026,缜:-12.451680,挤:-10.228696,倮:-15.255040,粱:-15.255040,脸:-7.713822,溽:-14.769533,铁:-7.176468,療:-9.725611,鋅:-14.198988,賑:-11.743495,矗:-11.445604,鉚:-12.474670,類:-7.833040,虢:-14.338750,闫:-10.209199,园:-9.009418,嫵:-11.987374,跻:-11.146218,份:-10.051721,潼:-10.907993,門:-7.100001,馈:-12.615983,民:-6.288987,互:-8.044591,這:-4.675504,崛:-10.668798,暢:-9.364433,沦:-9.934472,甫:-15.725044,邮:-8.917330,宴:-10.015279,活:-6.755502,酃:-17.334482,秈:-13.933285,荏:-14.038645,比:-6.451842,釘:-11.303797,壞:-9.616686,藠:-16.235870,桩:-15.137257,卯:-14.626432,女:-6.737697,绲:-16.641335,嘀:-11.624055,锂:-14.289959,娈:-13.868746,養:-8.177648,茎:-13.144827,丐:-9.985251,钗:-15.948188,厙:-14.695425,颟:-14.626432,映:-10.647373,貧:-8.418110,匮:-11.883443,韁:-11.591479,勃:-10.583380,鯉:-11.259136,藍:-8.656702,捎:-12.791187,近:-7.548821,浒:-15.137257,靖:-10.828698,绛:-13.723564,酚:-12.514200,屜:-15.137257,拣:-13.527819,车:-7.661414,襪:-11.505536,郯:-14.115606,軻:-17.334482,省:-7.157690,喂:-11.442838,還:-6.775315,骈:-12.490295,妊:-10.999428,吗:-12.759771,錙:-14.561893,帛:-12.915641,鴝:-16.641335,蜡:-10.165132,瘫:-11.031863,咬:-9.964881,鎮:-8.399895,稳:-7.884967,膺:-17.334482,设:-6.536172,充:-7.570831,佑:-15.388572,鳜:-11.706861,条:-6.997979,胤:-17.334482,噫:-17.334482,镭:-15.255040,饵:-12.451680,懺:-11.845544,億:-7.221058,枋:-16.235870,伐:-12.652351,谒:-14.198988,愤:-9.156404,刮:-10.642398,纱:-10.742808,抹:-11.259136,茸:-13.207348,沽:-13.129789,贼:-11.236408,雁:-10.470679,參:-6.577729,郅:-15.725044,繆:-11.306203,蓍:-14.769533,扎:-9.779623,裕:-12.317202,租:-9.372066,揣:-11.482279,蹦:-12.615983,哭:-9.509237,畬:-11.566161,罰:-10.279169,咂:-13.291431,庆:-8.860614,墊:-11.637388,損:-8.334739,薌:-14.695425,渑:-13.527819,辐:-9.270160,皖:-11.291849,弛:-12.357748,够:-11.661159,喬:-8.741254,銮:-13.505841,鲲:-15.137257,蚶:-15.948188,肺:-9.954850,椿:-13.723564,婉:-11.231923,旌:-11.493840,牙:-9.323459,僚:-12.436642,蟠:-11.048484,恥:-10.995888,诨:-13.750963,鑭:-14.626432,狮:-9.751743,孳:-13.422459,页:-11.610897,惺:-12.927763,堀:-12.522298,鄆:-12.546990,合:-6.533988,撓:-12.709509,骗:-10.442856,嶙:-13.144827,邛:-13.191347,侥:-10.846798,渤:-10.693300,箭:-10.800693,崮:-16.641335,熱:-7.241573,阴:-8.091578,伺:-10.577550,駁:-11.179624,勇:-8.867740,词:-7.812401,济:-9.516454,烛:-10.614262,剜:-17.334482,盟:-9.812082,泣:-12.259308,拧:-13.967186,腦:-8.495640,黯:-10.830194,凱:-9.532273,灰:-9.029245,諷:-10.557975,扼:-11.196755,礁:-12.385722,颀:-13.837974,缅:-10.233630,円:-15.255040,针:-8.509657,朕:-13.967186,羚:-11.640750,嘟:-11.591479,褡:-13.364190,輥:-16.235870,枪:-9.084384,琳:-11.805053,嚴:-6.980651,总:-6.056646,组:-6.351225,填:-9.204423,酱:-11.420979,味:-9.193292,珲:-13.573282,濺:-14.243439,弄:-10.277445,率:-8.697197,逆:-10.015942,谎:-11.320767,舒:-8.952650,醛:-14.338750,劝:-9.502071,猜:-9.616241,趣:-11.150333,亥:-14.936587,莧:-13.527819,鄰:-9.343905,油:-8.071644,贸:-8.462836,为:-6.339373,抽:-8.688720,茼:-15.137257,諍:-14.076385,俏:-12.098040,扒:-11.954585,卜:-10.389431,詢:-9.595123,佤:-13.057816,僱:-9.640545,请:-8.293034,浸:-10.159758,臻:-17.334482,码:-9.466610,龄:-14.936587,琉:-9.688606,昕:-17.334482,嬗:-13.670920,土:-6.979568,璞:-14.695425,蠡:-13.933285,檢:-7.153287,悦:-12.011472,萩:-14.156428,礫:-11.785406,鲮:-14.390043,冰:-8.432571,申:-8.248345,躺:-12.240732,秀:-9.692438,幅:-9.956723,痈:-13.670920,柔:-9.505249,廚:-10.057234,牝:-13.422459,鏜:-14.038645,桡:-14.695425,迤:-12.719361,摩:-9.047457,驭:-16.641335,陵:-10.140796,豹:-11.328129,擾:-10.843758,射:-8.477109,嘈:-11.657728,沏:-13.100375,颗:-10.831692,钟:-8.285837,氤:-13.207348,昨:-8.260649,儲:-8.506867,疵:-14.769533,澹:-12.759771,鯁:-15.542722,藕:-13.114974,停:-8.021044,非:-7.086767,惧:-11.042913,蕪:-11.429120,硬:-8.903937,叱:-12.304044,嗵:-17.334482,苻:-15.388572,恼:-10.427727,如:-5.840433,紅:-7.069028,历:-6.547992,眉:-9.395323,喊:-9.893748,植:-7.988824,挑:-8.649573,芐:-16.641335,蒔:-15.948188,创:-6.920419,続:-15.255040,吟:-11.391683,瞞:-12.857145,败:-9.589479,咴:-17.334482,样:-8.336840,讶:-13.100375,趺:-15.725044,遇:-8.371578,盈:-9.538424,拐:-10.362813,擔:-7.672111,默:-9.204128,郜:-12.857145,歡:-7.994518,賤:-11.057838,饭:-8.952650,屯:-10.015942,淺:-9.456327,頂:-8.812500,圈:-9.745652,残:-8.457937,耒:-13.463281,庙:-10.078185,缘:-9.797052,欠:-10.468591,辣:-9.880920,木:-7.500398,碭:-13.191347,帮:-7.855948,輸:-8.373629,心:-6.091071,牆:-9.089885,雉:-13.442662,苑:-11.825094,恒:-9.412946,兜:-11.273025,衢:-12.482452,艦:-8.865429,鷯:-17.334482,獰:-12.615983,音:-7.878219,畴:-15.725044,潸:-13.207348,藿:-14.198988,于:-7.257503,我:-5.563301,薔:-12.021276,窖:-13.175599,逝:-9.981400,梢:-12.680522,谥:-12.977773,累:-8.913800,政:-5.709157,婁:-11.223015,節:-7.859089,居:-7.470619,緄:-16.641335,赏:-9.753272,提:-5.980365,嫖:-12.234615,釜:-12.222494,回:-6.236845,橡:-9.971837,诠:-12.031177,孫:-7.299221,嵯:-13.868746,绮:-11.845544,泺:-17.334482,聽:-7.218629,曾:-7.875096,娄:-11.223015,皇:-6.479645,锆:-13.620910,蜒:-16.641335,麗:-9.720663,妙:-10.155174,钛:-13.256944,怨:-10.296576,鸬:-13.670920,央:-10.408887,疱:-12.719361,鈴:-10.599890,蘼:-15.137257,罂:-11.987374,釉:-12.087458,塘:-11.426399,魚:-7.704576,噜:-15.542722,酞:-14.936587,棣:-16.641335,髯:-14.626432,瑰:-12.103373,叵:-13.191347,骄:-10.162825,焉:-11.637388,邈:-15.137257,君:-8.551239,贡:-8.223520,簫:-12.459285,措:-8.242137,馮:-8.139763,论:-7.865013,房:-7.590049,膾:-12.834672,竄:-12.739362,陇:-11.245437,光:-7.086837,烈:-9.876296,位:-7.190050,滌:-12.589550,拔:-9.639179,飘:-9.678145,雜:-8.393329,賠:-9.608710,步:-8.307824,鍵:-11.205432,淶:-13.696896,懾:-14.076385,瞇:-12.940033,墙:-9.089885,鼬:-14.002277,锰:-12.400008,嘲:-10.550025,郉:-15.137257,軍:-6.200156,桎:-13.422459,蓑:-13.175599,晒:-11.243172,苕:-15.542722,鱖:-11.706861,痛:-8.373886,驚:-7.888437,遞:-9.119746,葦:-10.947603,異:-8.281966,勵:-11.668055,迷:-8.840967,楸:-15.388572,藻:-10.579878,杼:-17.334482,稅:-9.228873,咆:-11.805053,瀉:-12.421827,劊:-12.589550,渍:-15.031897,戕:-13.573282,弗:-9.712797,溢:-11.315889,訥:-12.729312,紫:-7.797287,貶:-10.400085,攻:-7.658648,肾:-9.784347,屁:-10.131821,饃:-13.144827,範:-7.392014,偉:-8.892228,燈:-8.995937,赋:-9.142742,乍:-11.879161,譏:-10.907993,腓:-11.335545,韜:-11.829150,污:-8.927327,诤:-14.076385,恩:-8.433524,臨:-7.845071,鹭:-13.645602,关:-6.053022,盲:-9.922322,虽:-7.189932,窃:-10.935887,璇:-14.198988,刈:-17.334482,謎:-11.747233,抓:-8.571210,宙:-11.610897,際:-12.624952,喝:-8.461714,渠:-9.728095,誣:-10.821252,維:-7.476986,伶:-11.789304,施:-7.960833,萼:-12.680522,終:-7.483499,哇:-11.485157,介:-7.923080,煊:-13.327149,蟑:-12.739362,盛:-8.245970,呜:-11.035533,烟:-8.754126,习:-8.274267,赢:-9.971837,蝦:-11.273025,籬:-11.866422,飯:-8.952650,癰:-13.670920,蛻:-11.931805,嶂:-17.334482,预:-7.177710,冊:-10.662449,貌:-12.357748,愕:-11.268374,禚:-14.769533,借:-8.332150,褥:-12.891831,縫:-10.399111,岬:-13.240137,鮮:-8.137531,傴:-15.948188,氷:-13.868746,覺:-7.544331,绀:-14.561893,驃:-12.952455,蹋:-17.334482,泌:-11.572431,忖:-14.198988,高:-5.634007,姚:-8.698262,畝:-12.749514,铜:-9.170541,裤:-10.201186,幫:-7.855948,篮:-9.755314,酵:-12.071792,开:-5.708442,处:-7.075911,疇:-15.725044,阆:-13.550292,匈:-9.504454,逊:-11.315889,討:-8.215709,咝:-15.388572,甜:-9.533500,亡:-10.160524,漠:-10.836200,讣:-13.442662,挨:-10.151370,皱:-10.233630,霰:-13.327149,吲:-13.620910,癆:-13.114974,摒:-12.066624,存:-7.381728,矛:-8.640650,啜:-12.739362,營:-7.760124,你:-7.263913,豢:-13.463281,旧:-8.749817,聪:-9.337492,峭:-11.238657,僵:-9.816961,跷:-13.837974,歸:-8.249025,蟻:-12.791187,岂:-9.676727,馄:-12.661653,嚆:-17.334482,氍:-13.967186,怕:-11.131946,崗:-9.402120,纖:-9.056054,騙:-10.442856,償:-10.719756,缫:-12.344049,冴:-14.561893,愿:-8.444071,镇:-8.399895,某:-7.773555,廖:-9.403916,關:-6.053022,勞:-7.231406,桥:-8.737554,扩:-7.540084,即:-7.686080,遵:-8.893522,詹:-9.707424,棺:-9.624725,拾:-10.367515,怀:-8.085113,氈:-12.087458,嚏:-15.948188,脖:-9.741612,料:-9.460123,蜚:-12.719361,贞:-10.898332,錢:-8.322836,瞥:-12.087458,嘤:-15.948188,蚯:-11.325669,攮:-15.725044,貳:-13.868746,欲:-10.055853,侵:-7.951029,銷:-8.311315,然:-7.219114,喹:-13.345498,眺:-11.918382,宽:-8.668524,豈:-9.676727,盏:-17.334482,摘:-10.221340,话:-8.802597,仟:-15.948188,癤:-15.031897,揭:-8.848779,酶:-14.076385,痹:-14.243439,萃:-12.198683,掂:-12.791187,榆:-11.223015,匍:-12.259308,阏:-14.198988,鰓:-14.115606,引:-7.016239,厢:-11.028207,鲨:-11.348030,循:-9.254864,茭:-13.696896,抬:-8.868372,械:-13.900495,溴:-12.780605,刷:-10.567139,视:-8.177542,罕:-10.000806,衛:-7.758874,柚:-12.690091,秦:-7.935507,嵩:-10.746932,恫:-13.044022,景:-8.024658,凶:-9.249611,铸:-9.819137,基:-6.135336,巾:-12.546990,貉:-15.255040,频:-8.562491,缔:-9.846748,撙:-16.235870,蘚:-15.948188,螯:-14.338750,足:-8.296473,亵:-12.222494,瘺:-14.501269,媽:-8.904155,簾:-11.508482,旃:-15.137257,赈:-11.743495,敘:-9.406076,俟:-17.334482,郡:-10.150611,嗣:-12.690091,寧:-8.456403,鳩:-14.289959,絨:-11.234163,拭:-12.749514,棱:-11.102034,該:-8.182512,佴:-15.542722,啸:-11.913947,梆:-12.158332,刍:-14.289959,霏:-14.695425,璎:-14.390043,堑:-13.808121,窒:-11.451160,帕:-9.621591,蠱:-12.643134,踵:-15.542722,恁:-13.309130,裆:-15.725044,汉:-6.966569,車:-7.661414,双:-7.032755,姐:-8.967414,繕:-13.723564,轟:-9.126807,镣:-13.274039,慫:-12.098040,绪:-13.129789,杯:-10.563692,獷:-15.388572,闸:-11.541468,固:-8.052193,戀:-9.971837,辉:-9.831744,醍:-13.750963,咏:-12.364669,鮑:-9.710840,库:-9.206782,蔚:-11.523341,删:-10.945921,鄢:-12.103373,疥:-13.900495,義:-8.047922,芫:-13.696896,蒯:-9.463552,猶:-8.955172,町:-13.505841,蹈:-14.038645,坎:-10.922664,结:-6.296758,鱔:-13.868746,鏡:-9.720663,瑤:-10.610649,蝮:-13.100375,襲:-9.836720,淵:-10.737336,鍶:-16.235870,噸:-11.140077,秽:-13.207348,憂:-9.500486,殆:-11.739771,伉:-13.596812,瞎:-10.299213,袜:-11.505536,氟:-11.706861,冢:-14.936587,钤:-15.388572,砧:-12.880135,宦:-10.488602,悬:-8.843427,贵:-8.043668,霹:-11.505536,皸:-13.933285,碼:-9.466610,尿:-10.399111,臂:-11.303797,故:-7.389996,识:-9.714758,筑:-10.090254,駒:-14.002277,絕:-7.607016,揖:-15.031897,詛:-11.762328,卡:-8.516148,陣:-8.500873,啥:-13.016994,顧:-7.801334,篦:-14.849575,彩:-8.625347,扫:-9.250228,胬:-16.641335,摯:-12.291057,賴:-9.692438,叶:-7.762768,飼:-9.769725,躉:-14.338750,压:-7.880803,骑:-8.728912,純:-8.587130,條:-6.997979,匠:-11.696127,逢:-11.657728,唤:-10.677755,莫:-8.144242,薯:-11.954585,栲:-13.044022,父:-7.506149,琺:-12.891831,績:-11.601141,荀:-11.378645,酌:-12.572308,噎:-12.903665,蛙:-12.466947,裝:-7.298564,獠:-13.003749,黩:-15.031897,惭:-10.809452,泵:-13.256944,盹:-14.338750,奼:-14.038645,蜃:-14.769533,三:-5.932086,倍:-10.884011,皎:-12.538691,娑:-15.388572,鼓:-8.452368,尕:-15.388572,亞:-7.579378,閤:-17.334482,憬:-16.235870,許:-6.795874,谵:-13.291431,扁:-10.168988,賊:-11.236408,凌:-9.016716,雎:-17.334482,飒:-12.330536,巔:-12.234615,拖:-9.590345,據:-8.571992,滞:-10.837707,剡:-14.390043,饧:-16.641335,捫:-13.933285,诰:-13.114974,哺:-10.529867,搀:-11.476549,莅:-12.198683,栈:-12.001763,咋:-11.959204,鞍:-10.985343,瘌:-16.641335,墓:-9.291461,稔:-15.948188,茚:-15.725044,东:-6.004002,吠:-14.002277,判:-8.317484,芯:-10.304509,漲:-9.672955,徽:-10.854437,社:-6.117203,艄:-12.607094,滇:-11.368335,陌:-10.236933,归:-8.249025,违:-8.627330,闡:-9.326449,瑠:-15.255040,硨:-13.837974,腮:-12.297529,深:-6.880016,轲:-17.334482,镶:-11.100071,幼:-9.024067,饾:-16.641335,考:-6.690630,殊:-10.522137,圍:-8.180289,頓:-9.292747,肘:-12.216488,氛:-10.799241,樟:-11.900760,钠:-12.056367,垢:-17.334482,風:-6.814917,宪:-8.022849,贱:-11.057838,炸:-9.459363,捅:-14.695425,跆:-13.309130,诊:-9.543786,野:-8.129858,嫔:-11.074900,旖:-13.505841,揚:-9.022101,佝:-12.147096,遣:-10.561402,矢:-11.019124,鹧:-10.440826,扯:-11.963844,嗶:-14.038645,郸:-15.031897,类:-7.833040,黼:-17.334482,穿:-8.884070,攀:-10.092400,喋:-12.759771,隍:-16.235870,鲑:-13.309130,紐:-9.424258,妓:-10.738701,笔:-8.111127,溝:-9.158090,唠:-11.805053,碩:-9.845629,渲:-11.614170,爺:-9.571036,砾:-11.785406,偎:-13.057816,魔:-9.501674,慘:-8.994265,潜:-8.148742,铡:-13.442662,畠:-15.255040,鋥:-13.309130,忧:-9.500486,票:-9.934472,泱:-13.900495,蹲:-11.102034,烹:-9.951735,典:-8.629316,绽:-12.061482,彼:-9.264514,顾:-7.801334,暂:-8.916225,沆:-14.156428,锋:-10.567139,嘍:-11.793218,炎:-9.818049,少:-7.158756,餓:-10.504688,朗:-10.673907,膘:-14.849575,洛:-8.710949,辜:-10.528759,缧:-15.725044,馨:-13.596812,蘭:-8.932700,谱:-11.482279,殴:-12.108735,鸽:-10.945921,桉:-13.383238,郎:-10.101026,蝗:-12.114126,赛:-8.786760,拚:-10.919385,九:-7.682537,酣:-11.657728,剥:-9.232501,蟬:-12.098040,仲:-10.032660,说:-6.319877,勺:-12.624952,怄:-13.527819,縐:-15.137257,研:-6.454286,掙:-9.632378,脚:-8.316029,涝:-13.442662,锢:-15.388572,箩:-13.016994,肯:-8.454592,洲:-11.879161,麻:-8.161428,但:-7.048559,鑌:-13.129789,烏:-8.102184,华:-7.094308,托:-9.074765,距:-8.903937,汜:-16.641335,灤:-12.451680,旭:-11.982624,濱:-10.657398,买:-8.798467,靶:-11.313459,斂:-12.643134,澆:-10.992360,阋:-13.808121,榊:-13.868746,透:-8.432162,玎:-14.198988,弑:-13.620910,夕:-11.282393,搗:-10.595145,減:-7.761793,簧:-14.156428,骨:-8.632803,蔭:-12.791187,撬:-11.647507,粼:-14.198988,歉:-11.511436,觊:-12.222494,哌:-14.198988,网:-7.187107,著:-8.298733,坡:-10.876144,痢:-12.643134,入:-7.752095,翦:-13.723564,孩:-7.475835,蓬:-10.209199,息:-10.667525,裴:-10.283492,鋸:-11.508482,出:-5.448380,蚁:-12.791187,最:-5.901173,肅:-9.867111,誉:-9.976926,型:-9.741108,甌:-13.645602,宓:-12.546990,蘖:-17.334482,鸦:-10.048290,窩:-10.644883,螫:-14.936587,戮:-14.695425,讳:-12.498200,淇:-14.115606,镌:-12.759771,剎:-10.759406,齐:-8.237870,篓:-13.160095,浜:-13.967186,口:-7.442713,煤:-8.948993,巧:-9.288894,艮:-16.641335,佰:-16.235870,棵:-14.444110,陶:-8.566219,狹:-9.456706,卸:-10.944241,遺:-7.491222,驾:-9.309947,范:-7.392014,撂:-12.857145,溆:-15.255040,名:-6.552343,鬓:-12.474670,粒:-9.747678,堕:-10.929253,莘:-13.003749,鞠:-11.296611,紧:-7.577872,度:-9.380110,斬:-10.134057,踱:-12.572308,榴:-10.879283,晁:-11.205432,裊:-12.135985,忐:-11.992148,硕:-9.845629,委:-6.620309,曖:-12.147096,襟:-12.903665,瓢:-12.522298,健:-8.107284,绦:-12.990676,述:-11.313459,祿:-11.508482,要:-6.733357,栀:-13.309130,辅:-9.231895,序:-9.815875,鬢:-12.474670,羥:-11.069181,吨:-11.140077,被:-8.004050,霪:-16.235870,躯:-10.368458,洮:-12.927763,骷:-11.927310,邻:-9.343905,缺:-8.044868,甾:-13.327149,血:-7.827450,蹄:-11.094206,拇:-11.236408,磋:-11.192445,经:-5.619735,遐:-12.474670,卒:-13.967186,菝:-16.235870,柵:-12.071792,饶:-10.488602,调:-6.909704,與:-8.355569,頋:-15.137257,樗:-16.641335,芜:-11.429120,星:-8.033935,颠:-10.091684,客:-7.400417,钨:-12.759771,脱:-8.493612,暴:-8.478248,嘿:-10.460283,仄:-14.849575,臆:-12.607094,蟊:-14.936587,筍:-12.880135,嫌:-10.555697,囔:-15.948188,號:-8.512012,彥:-14.561893,燦:-10.286965,桫:-14.038645,湯:-8.827339,胰:-10.987093,摳:-14.002277,蛴:-14.849575,穷:-9.402120,鋼:-8.370810,袁:-7.634948,邑:-15.137257,隕:-11.183879,沙:-7.552597,夠:-11.661159,逦:-16.641335,璩:-16.641335,阪:-14.115606,辯:-9.512839,氮:-11.394311,戲:-8.690480,轄:-9.850113,秋:-8.945804,屎:-14.936587,祠:-11.275359,铩:-13.696896,惱:-10.427727,色:-8.510245,顶:-8.812500,鑾:-13.505841,犒:-12.522298,愛:-7.491913,亚:-7.579378,莜:-14.243439,期:-7.395724,閨:-10.825713,設:-6.536172,伯:-8.873436,嬷:-12.522298,鰹:-14.390043,綸:-14.626432,桁:-11.954585,諂:-12.163998,俄:-8.030651,胆:-8.976050,蛊:-12.643134,積:-7.535966,富:-7.933686,灑:-11.345520,鋒:-10.567139,埔:-15.948188,滚:-9.526972,烦:-9.720170,盪:-10.813861,诬:-10.821252,潯:-14.198988,筷:-10.630068,壶:-12.563797,鷸:-14.156428,建:-5.766245,睿:-12.474670,超:-7.329838,馍:-13.144827,砌:-12.271887,爐:-10.167444,嚓:-16.641335,丘:-8.883856,管:-6.732462,尤:-8.054429,錦:-9.062678,瞩:-10.648621,貯:-10.396197,徹:-8.846924,銻:-15.137257,紺:-14.561893,冽:-17.334482,钿:-17.334482,眾:-7.590400,立:-6.943304,題:-8.895250,彎:-9.575294,兒:-7.570371,这:-4.675504,湘:-9.263263,鯡:-13.505841,廣:-6.561292,僧:-9.744640,韩:-7.830577,轮:-8.886853,翹:-11.900760,幸:-8.432026,概:-7.954990,复:-7.443978,美:-6.166924,熒:-10.830194,栗:-10.588070,戛:-12.071792,骠:-12.952455,縣:-7.559623,鲤:-11.259136,瀧:-14.769533,厦:-10.075366,隨:-6.823051,喪:-9.218662,茱:-13.837974,鼹:-14.338750,纸:-9.157528,刻:-9.238883,炼:-9.800254,观:-7.215560,浅:-9.456327,杉:-10.509022,勐:-14.002277,哔:-14.038645,街:-8.195423,余:-7.735687,淚:-9.429409,柞:-12.240732,坩:-13.291431,橫:-8.377100,修:-7.412173,蓴:-11.728680,寶:-7.675298,侃:-12.141525,洄:-12.589550,月:-8.094874,宋:-7.397753,颍:-12.965034,銑:-12.927763,钕:-15.542722,优:-7.083865,谚:-11.900760,粥:-13.114974,崤:-17.334482,鈦:-13.256944,在:-7.379921,螳:-12.690091,庹:-11.015514,瘾:-14.156428,濃:-8.610437,资:-6.152230,懇:-10.949288,蝈:-14.289959,镔:-13.129789,潘:-8.828754,筠:-14.849575,鳥:-9.441283,拱:-9.883821,聲:-7.248798,驶:-10.503608,烽:-11.785406,兼:-8.556464,較:-8.012690,刑:-8.651266,霓:-12.317202,炒:-9.453300,吕:-8.560169,辘:-13.596812,挛:-14.561893,膜:-12.498200,咪:-12.903665,舱:-10.813861,掰:-12.977773,萵:-13.442662,夷:-10.458217,羸:-13.967186,医:-7.150261,唿:-12.915641,裂:-9.751234,晉:-8.995459,蓊:-15.137257,黎:-9.061145,瑕:-13.160095,嗔:-12.749514,乙:-9.492989,履:-9.565526,噩:-11.440079,浯:-16.641335,杳:-13.327149,祷:-11.927310,獻:-9.301797,畿:-12.607094,图:-7.326724,趁:-9.953603,龍:-7.892474,琐:-11.547585,贖:-11.325669,枝:-9.962364,鼢:-15.031897,锦:-9.062678,倨:-13.422459,貫:-9.033208,妹:-9.202657,钻:-9.440910,笺:-12.990676,曇:-13.003749,鹌:-12.965034,奎:-12.234615,仗:-11.685508,籠:-9.854618,釩:-16.235870,旱:-10.421739,蝲:-15.948188,矽:-10.176746,噼:-12.563797,蘇:-7.107246,騏:-15.948188,禎:-17.334482,瞒:-12.857145,匕:-10.386545,渗:-9.676727,蚜:-12.952455,戟:-17.334482,鲠:-15.542722,砣:-17.334482,骤:-10.848321,瘧:-11.849685,撰:-10.036714,茵:-13.670920,帷:-11.396946,吻:-11.541468,霽:-15.948188,流:-6.758841,迂:-11.311034,菊:-10.579878,畑:-15.255040,哐:-13.696896,淖:-17.334482,葛:-9.248995,痦:-15.137257,兩:-5.616015,恳:-10.949288,寺:-10.029966,誅:-11.529347,欄:-10.095267,肉:-9.097003,愈:-9.559206,宏:-9.110318,訚:-17.334482,鸢:-13.868746,窥:-11.166965,嬤:-12.522298,亭:-11.315889,讯:-11.156538,膳:-11.773800,閻:-9.764554,瀾:-12.092735,腈:-13.596812,緋:-12.317202,镐:-15.031897,俗:-9.355828,裙:-11.203255,杜:-8.076018,姣:-13.868746,衮:-15.255040,擱:-11.678490,奸:-9.689563,蜇:-16.641335,把:-8.827541,碎:-10.066956,向:-7.770040,攛:-12.823622,挟:-11.664601,努:-8.287720,萱:-14.289959,新:-6.182885,舵:-10.899935,強:-6.932282,頹:-11.273025,瞼:-15.137257,匿:-12.297529,汁:-12.414501,忌:-10.563692,风:-6.814917,雒:-12.709509,叔:-9.608710,荟:-12.371637,屡:-10.475917,绢:-12.903665,瓦:-8.884711,慳:-14.289959,罷:-8.706642,島:-8.963240,莉:-13.402656,戈:-9.886731,簌:-12.152698,鞑:-11.470851,褚:-10.609448,羡:-10.794896,堤:-10.734611,玩:-9.052505,刨:-12.530461,身:-6.459193,芳:-10.488602,鲷:-14.849575,缶:-16.641335,容:-7.770250,示:-8.314576,喽:-11.793218,蹀:-15.388572,櫃:-10.848321,擇:-10.458217,限:-8.248572,達:-7.354589,诙:-12.181190,橘:-11.833224,藝:-7.578741,嫣:-11.858018,硤:-16.235870,哧:-15.137257,柱:-9.889649,蕲:-11.015514,懵:-12.729312,饺:-11.343017,呼:-8.011974,鍾:-17.334482,企:-6.750375,訃:-13.442662,涂:-9.596866,萇:-17.334482,憊:-13.505841,儕:-14.076385,誘:-9.506444,蒜:-12.661653,颤:-9.998196,垦:-11.654309,銨:-14.156428,丫:-9.552509,冪:-13.422459,购:-8.459754,尷:-10.069052,嘻:-11.717711,潁:-12.965034,什:-6.306779,捉:-10.263758,臊:-13.327149,睑:-15.137257,虛:-8.749817,奥:-8.137024,賬:-10.189286,蛰:-13.207348,扳:-11.138038,胴:-14.338750,登:-7.753889,灿:-10.286965,躁:-12.690091,袅:-12.135985,律:-9.572737,鲍:-9.710840,邕:-13.670920,舞:-8.535122,纡:-17.334482,张:-6.137885,夤:-13.550292,辫:-11.296611,莳:-15.948188,砺:-17.334482,咽:-10.371292,爾:-9.619358,襄:-7.638511,蓝:-8.656702,獨:-7.214473,詮:-12.031177,竹:-8.836472,學:-5.575267,顺:-7.836785,啼:-11.303797,丁:-8.125042,沂:-12.436642,鼋:-14.769533,對:-6.221199,洗:-9.031720,望:-8.855614,薜:-15.031897,感:-6.792858,岢:-15.948188,嚦:-14.936587,伫:-12.436642,谭:-8.925765,耵:-15.948188,疼:-9.723629,儿:-7.570371,桅:-11.977896,蛆:-13.402656,扉:-13.696896,籍:-11.634038,棚:-11.119874,幡:-13.837974,镧:-14.626432,剩:-8.404782,跬:-15.948188,致:-8.315544,延:-8.133889,壺:-12.563797,勾:-9.502865,鶉:-15.725044,戌:-16.235870,辕:-12.181190,渔:-8.843017,鄖:-9.417674,疙:-11.100071,箝:-15.542722,娜:-12.652351,枥:-15.542722,涩:-14.243439,輪:-8.886853,厭:-10.228696,鲳:-14.156428,徵:-8.286425,芷:-12.780605,机:-5.865843,派:-8.561717,附:-7.848861,竇:-10.147581,鱈:-13.442662,惋:-11.781522,泓:-17.334482,廟:-10.078185,晤:-14.390043,汨:-13.442662,班:-9.002896,年:-6.313086,毽:-14.769533,鐃:-14.002277,羊:-9.012331,斎:-15.255040,谓:-12.482452,殒:-13.645602,肠:-9.695321,貨:-7.899479,倫:-8.967647,侪:-14.076385,犬:-11.692575,嘯:-11.913947,碰:-9.079173,撸:-16.235870,捍:-11.205432,仔:-9.304398,鉗:-12.152698,顛:-10.091684,矚:-10.648621,孝:-8.558778,緞:-12.198683,董:-7.932117,火:-7.100037,米:-8.410358,黴:-11.214184,湿:-9.064981,邁:-9.717706,喃:-10.509022,宇:-8.984288,紈:-13.207348,芍:-12.108735,演:-7.452065,阚:-12.977773,窝:-10.644883,舢:-12.350875,沩:-15.542722,醫:-7.150261,踪:-10.619099,庵:-11.714081,获:-7.341839,剂:-10.840728,靄:-14.561893,篇:-10.699849,懋:-13.900495,柏:-9.338165,受:-7.157196,铙:-14.002277,胡:-6.936847,狭:-9.456706,绵:-10.029294,聶:-9.976926,锃:-13.309130,尉:-10.341467,贓:-12.400008,猗:-16.641335,閘:-11.541468,缟:-13.723564,膠:-9.743125,攣:-14.561893,欧:-7.389756,趨:-8.764127,鸵:-12.823622,殼:-12.087458,净:-9.690999,飆:-12.466947,才:-9.115695,桑:-9.432364,諒:-11.661159,呙:-14.849575,齟:-13.596812,糞:-11.261437,拢:-15.031897,哮:-11.355596,絳:-13.723564,捷:-9.971837,縈:-12.538691,亓:-13.057816,趕:-7.805106,气:-6.936695,嘘:-13.057816,锚:-12.690091,採:-6.948970,斥:-10.919385,贪:-9.372415,貿:-8.462836,漾:-14.695425,鉀:-11.104000,鑄:-9.819137,鹈:-13.900495,拋:-9.844511,嵊:-13.071802,职:-6.508801,詐:-11.082578,駝:-11.280043,菡:-15.137257,藥:-7.726641,燭:-10.614262,篱:-11.866422,饲:-9.769725,蕺:-16.641335,槽:-13.030417,隘:-12.729312,喚:-10.677755,颜:-8.592546,從:-6.751769,别:-7.416894,鄭:-7.781829,启:-8.643840,鬱:-17.334482,帳:-10.099583,畅:-9.364433,哄:-11.072990,廈:-10.075366,慍:-13.383238,蟎:-14.769533,角:-8.337706,遗:-7.491222,驛:-11.001202,佩:-9.518871,淪:-9.934472,瑯:-13.723564,繳:-10.373186,鳴:-10.350692,俾:-12.158332,垃:-10.077479,甄:-10.590423,妇:-8.370298,誑:-13.750963,團:-7.581120,夜:-8.281966,鸞:-14.626432,撥:-9.684789,谪:-13.837974,傭:-10.949288,戶:-9.077875,携:-9.510036,趿:-14.076385,渾:-9.355486,婆:-9.090936,届:-10.348840,腌:-11.870650,族:-10.469634,赔:-9.608710,雙:-7.032755,热:-7.241573,公:-5.301888,孰:-12.036165,曹:-7.811377,刁:-10.969731,鞘:-13.383238,笛:-11.179624,咚:-11.797148,庞:-8.734235,薤:-15.388572,辨:-9.981400,熬:-11.777654,唯:-8.393198,綴:-16.235870,枸:-11.736060,鳊:-11.773800,恍:-10.321466,汕:-11.550657,酗:-12.364669,绞:-10.935887,泪:-9.429409,釬:-14.626432,鯰:-11.743495,慷:-10.367515,死:-7.740854,庇:-11.249982,馉:-17.334482,融:-8.926211,昌:-10.400085,趑:-16.641335,讕:-15.948188,熙:-11.437328,倘:-8.648897,錚:-12.246886,羝:-16.641335,餞:-12.459285,斡:-12.563797,接:-6.664666,账:-10.189286,垭:-13.779134,宵:-12.965034,收:-6.805056,費:-8.309508,挺:-9.829540,調:-6.909704,烃:-13.309130,坂:-11.559930,织:-9.845070,擋:-10.498223,豐:-7.604158,詔:-9.308966,灘:-11.553738,桨:-13.463281,短:-8.230058,噬:-12.770134,酮:-14.338750,緱:-13.291431,齲:-13.071802,婴:-9.788036,唁:-15.542722,逃:-8.464521,包:-6.796377,萋:-17.334482,憎:-11.111906,蠓:-15.031897,厚:-9.383627,妞:-12.357748,芤:-16.641335,含:-8.066911,霭:-14.561893,脹:-13.808121,悸:-14.501269,哀:-10.013293,獅:-9.751743,鯊:-11.348030,浑:-9.355486,彝:-10.668798,驟:-10.848321,牯:-12.719361,胸:-8.458217,軼:-12.135985,銅:-9.170541,徇:-12.634002,颉:-13.808121,蚍:-15.031897,誕:-9.562572,炙:-12.451680,报:-6.661673,谦:-10.333236,訪:-8.947625,岱:-13.291431,馳:-10.008674,縲:-15.725044,搶:-9.033953,访:-8.947625,栾:-12.056367,镀:-12.192818,燃:-9.004341,屆:-10.348840,旋:-9.316845,婊:-11.323215,蝌:-11.563041,描:-8.758077,赐:-11.252263,槓:-11.268374,乒:-10.857510,黝:-12.210518,察:-9.792268,若:-8.064553,楨:-15.255040,遮:-10.045554,葶:-15.948188,惹:-11.026383,艺:-7.578741,佼:-12.490295,吁:-14.076385,皂:-12.234615,粆:-15.137257,咖:-9.764039,紛:-8.616473,龜:-10.895132,增:-6.344505,愣:-11.479410,瞬:-9.814247,匯:-8.397001,鰱:-14.390043,箴:-13.240137,踽:-14.338750,胎:-10.176746,軒:-10.314291,轧:-11.949987,畫:-8.404385,櫪:-15.542722,韬:-11.829150,獯:-17.334482,僮:-13.900495,瘀:-14.243439,劃:-8.427005,稈:-14.561893,辑:-12.344049,渐:-8.969741,霖:-14.338750,刘:-6.545039,褪:-12.278236,邯:-11.423685,献:-9.301797,款:-10.370346,陀:-11.360672,衔:-10.940891,哗:-11.046623,壟:-9.766619,臥:-9.782245,恤:-13.900495,翱:-12.709509,鵲:-13.240137,蝶:-12.317202,腺:-10.813861,嬉:-11.532364,蘋:-9.969935,掎:-14.849575,休:-8.407433,訓:-8.115380,銘:-10.729184,縛:-12.915641,鲜:-8.137531,砟:-17.334482,实:-5.752198,肤:-11.370903,氧:-9.280595,侦:-9.133096,誨:-14.338750,锭:-13.750963,纰:-12.857145,餵:-11.442838,碴:-15.255040,茹:-11.743495,主:-5.356057,沼:-10.031985,睁:-14.501269,煅:-14.002277,等:-7.384493,潑:-11.173275,既:-8.275779,癫:-11.931805,铬:-12.284626,灯:-8.995937,叮:-10.455126,已:-6.353980,飴:-11.728680,購:-8.459754,桿:-10.505770,躑:-14.338750,阖:-14.561893,通:-6.019983,檩:-14.936587,辻:-14.561893,呂:-8.560169,塊:-11.090315,毓:-17.334482,鳝:-13.868746,杠:-11.268374,胥:-11.485157,彰:-12.364669,奴:-8.189000,泽:-10.932565,嘁:-13.573282,鴇:-13.402656,娉:-14.076385,脏:-10.610649,丑:-10.200388,沒:-5.834024,挣:-9.632378,洧:-17.334482,亦:-10.879283,讨:-8.215709,鸱:-11.703270,羰:-12.607094,船:-8.157388,掸:-14.002277,涼:-9.698695,铂:-13.808121,凄:-10.037391,苎:-12.506168,俐:-17.334482,賒:-13.207348,镗:-14.038645,盖:-9.568065,竞:-8.033205,荣:-8.537538,擢:-13.223608,赧:-16.235870,滦:-12.451680,睫:-11.801092,敷:-11.183879,砀:-13.191347,龅:-15.948188,劇:-8.274499,閉:-8.538143,亏:-9.696765,昔:-10.011971,餖:-16.641335,尘:-10.206788,两:-5.616015,斩:-10.134057,钳:-12.152698,放:-6.956314,兆:-11.825094,棋:-9.236751,坊:-13.442662,滏:-13.779134,虔:-11.098112,鷙:-16.235870,囟:-15.137257,桠:-17.334482,迥:-11.801092,藩:-11.270697,噴:-9.327115,淹:-10.698535,揽:-12.589550,蕾:-15.948188,唉:-12.530461,踏:-9.601674,涎:-13.364190,排:-7.647349,稗:-14.626432,妖:-9.611804,瀛:-12.965034,銜:-10.940891,瘟:-11.588279,氣:-6.936695,鄱:-11.762328,吳:-6.896228,皴:-14.076385,费:-8.309508,沸:-10.284359,押:-10.937552,祁:-10.530977,罅:-15.255040,哈:-7.945075,慑:-14.076385,驗:-10.021262,遛:-14.338750,陟:-16.641335,痞:-13.160095,佥:-14.115606,懦:-11.692575,硫:-9.935084,差:-7.861547,史:-7.953640,恻:-11.987374,俺:-11.299000,颁:-8.900453,缄:-12.087458,钉:-11.303797,認:-6.466218,侏:-11.661159,蚕:-10.478020,朔:-11.692575,鸚:-11.699692,溥:-11.429120,伤:-8.068991,耦:-12.169696,撩:-12.098040,讷:-12.729312,膻:-14.338750,渺:-11.523341,構:-7.944741,腐:-8.915343,鳙:-16.641335,凛:-11.270697,域:-11.601141,裡:-7.861008,楠:-10.671349,潤:-10.633751,竭:-10.093116,孬:-13.868746,兰:-8.932700,蹺:-13.837974,帅:-10.821252,吉:-8.071454,蔓:-10.929253,抒:-10.496077,庚:-11.968506,真:-6.789193,夫:-7.900278,箬:-17.334482,弯:-9.575294,週:-6.513444,阵:-8.500873,涸:-15.725044,髂:-16.235870,繅:-12.344049,晕:-10.944241,绚:-11.146218,剝:-9.232501,赣:-10.968011,荧:-10.830194,惦:-11.544522,歷:-6.547992,板:-9.119746,鮁:-14.501269,稀:-9.062422,成:-5.613356,搔:-12.216488,帘:-11.508482,倜:-13.868746,霞:-11.883443,殡:-10.857510,缮:-13.723564,袷:-15.948188,芻:-14.289959,蒿:-12.204583,驀:-10.495005,练:-9.313554,陈:-6.371106,啊:-10.985343,行:-5.906145,低:-7.654263,針:-8.509657,诡:-10.203583,代:-6.451935,汤:-8.827339,晨:-10.697224,秭:-10.614262,塬:-17.334482,蝾:-13.527819,疊:-11.325669,谏:-12.624952,澎:-11.569291,砗:-13.837974,爛:-11.229689,誠:-9.446523,渣:-12.371637,性:-7.212542,犰:-14.849575,悼:-11.311034,峄:-16.641335,囈:-13.933285,闊:-10.071152,迎:-8.523724,敕:-12.350875,鉛:-10.449995,線:-8.816289,蹣:-12.506168,鋰:-14.289959,軸:-10.523238,胼:-13.723564,骁:-11.514399,鲅:-14.501269,約:-8.736262,袍:-11.675000,攔:-9.350360,弘:-10.231983,蠢:-11.465185,沥:-11.671521,鮫:-15.725044,鶯:-14.390043,縮:-9.060890,励:-11.668055,瀲:-15.137257,显:-7.198614,靈:-8.145467,毋:-11.080653,告:-7.662233,乎:-17.334482,荐:-13.291431,染:-9.258277,姗:-13.933285,叛:-9.457843,郝:-9.543372,煜:-17.334482,嗟:-12.812693,諡:-12.977773,俣:-15.255040,杨:-6.713594,狱:-10.805063,印:-7.325329,遲:-9.220456,滹:-12.680522,豺:-12.719361,虾:-11.273025,威:-7.897723,嘉:-8.550320,贏:-9.971837,悒:-15.031897,猛:-8.749256,岚:-14.002277,醜:-10.200388,生:-5.436437,漣:-12.498200,愧:-11.725010,螨:-14.769533,頭:-7.386882,现:-6.000922,鐵:-7.176468,耽:-10.164362,扑:-9.820227,饗:-14.289959,竖:-10.440826,鍛:-9.738090,盞:-17.334482,腧:-12.175427,拦:-9.350360,间:-8.856445,楷:-11.254549,迸:-11.813021,捻:-12.350875,臼:-12.699753,境:-8.133889,嚇:-10.240247,醉:-10.463391,辍:-11.209799,搐:-15.948188,鄞:-13.670920,涡:-10.636214,憩:-12.259308,鲫:-13.100375,徭:-11.650902,骯:-11.661159,邳:-13.505841,洶:-10.994123,欺:-9.285055,商:-6.717505,半:-7.115235,蹌:-15.948188,駙:-10.796342,募:-10.258673,跡:-10.663716,池:-9.132273,该:-8.182512,恨:-10.507937,饮:-8.775571,痱:-14.390043,赶:-7.805106,柽:-13.779134,腾:-10.179867,頃:-10.533199,阇:-17.334482,疆:-10.719756,儉:-11.817029,谋:-9.388926,伍:-9.571886,题:-8.895250,琛:-16.235870,定:-7.505341,障:-9.493382,負:-7.206492,誤:-9.137219,昧:-13.967186,纬:-11.024564,锱:-14.561893,環:-7.203620,煉:-9.800254,鏊:-14.156428,潍:-12.147096,救:-8.323935,蟒:-12.661653,捕:-9.094097,坝:-11.315889,衣:-7.989611,虧:-9.696765,旦:-12.204583,揪:-12.364669,铰:-13.240137,裸:-10.625178,摻:-11.505536,承:-7.655451,鲁:-8.433933,紀:-7.981948,妃:-11.442838,骅:-14.849575,躍:-9.431255,圜:-14.626432,逞:-11.996944,没:-5.834024,踢:-11.710464,萦:-12.538691,航:-7.219519,庭:-9.914502,咱:-7.670394,樺:-12.216488,秃:-11.363220,幂:-13.422459,魄:-12.051278,矇:-13.723564,呆:-10.229516,酈:-12.490295,淋:-10.083846,削:-9.779100,每:-6.763858,荔:-11.614170,志:-8.548178,飙:-12.466947,睜:-14.501269,賡:-17.334482,浠:-10.675188,此:-6.586758,慨:-11.853843,续:-10.513374,彬:-12.709509,却:-8.125743,曽:-17.334482,聾:-12.051278,封:-7.477195,餃:-11.343017,纂:-13.003749,震:-8.839739,倉:-9.745652,犊:-14.390043,不:-4.274262,脓:-11.282393,媚:-11.368335,亢:-11.508482,认:-6.466218,膨:-9.903182,鸭:-10.235280,疰:-15.542722,蠹:-14.936587,寄:-9.208555,铆:-12.474670,湍:-11.381239,糖:-9.650618,噝:-15.388572,擦:-10.903151,壮:-8.663538,闰:-12.834672,觸:-9.390699,馅:-12.506168,事:-6.248976,怔:-12.031177,娘:-9.237664,餚:-14.115606,疝:-14.849575,澡:-12.607094,财:-7.170247,掩:-9.431625,颯:-12.330536,笮:-17.334482,銳:-10.614262,甲:-8.738293,况:-10.515558,買:-8.798467,肿:-9.483599,挾:-11.664601,滋:-9.478937,豌:-10.641158,虐:-11.647507,拓:-9.663121,联:-6.652450,四:-6.438947,瑜:-12.001763,觥:-14.243439,桤:-15.388572,菩:-9.812623,屬:-8.212863,側:-9.364778,轶:-12.135985,熊:-8.807536,瀟:-10.276584,樣:-8.336840,芨:-15.255040,師:-7.038007,堯:-12.482452,皰:-12.719361,謹:-10.133311,檸:-11.473696,蔽:-13.463281,撼:-12.868574,鷂:-12.927763,释:-9.387511,村:-7.977188,慕:-9.024067,鱗:-11.096157,孙:-7.299221,陛:-9.582577,珞:-10.353476,硯:-13.030417,嗲:-14.390043,郴:-13.327149,諸:-8.061824,蓼:-16.641335,缀:-16.235870,它:-7.912261,颅:-11.982624,礄:-11.789304,喇:-9.861981,例:-8.092837,鈞:-13.327149,传:-6.684638,谢:-7.852436,耪:-16.641335,岭:-10.389431,種:-7.531588,鎳:-13.779134,債:-9.412583,螻:-13.003749,膿:-11.282393,层:-8.990215,症:-9.414035,赌:-9.916902,腔:-12.041177,髙:-15.137257,铝:-10.718417,畜:-9.425360,驮:-12.823622,盱:-13.030417,鑲:-11.100071,兴:-7.540865,艾:-9.080473,币:-11.781522,鬃:-13.645602,堅:-7.405814,皆:-12.474670,炊:-11.465185,撒:-9.542133,紗:-10.742808,庖:-13.779134,办:-7.209052,欣:-9.270160,莨:-13.933285,綬:-14.338750,夯:-12.041177,落:-7.766257,於:-11.681993,繁:-7.974429,硅:-10.176746,集:-6.792092,又:-8.146489,郊:-10.312505,恕:-11.762328,靛:-13.129789,磚:-9.867682,狞:-12.615983,乡:-8.186655,波:-7.888753,祯:-17.334482,哲:-8.620079,海:-6.281531,件:-13.484334,诸:-8.061824
+#E
+耀:-9.266706,蘄:-17.334482,涉:-9.096474,谈:-8.435707,伊:-10.223786,預:-10.202783,亟:-16.641335,洞:-8.366213,咣:-16.235870,媧:-12.891831,礦:-8.627164,鶩:-13.463281,悫:-16.235870,缪:-12.304044,河:-6.866419,临:-8.232507,犷:-12.210518,吸:-9.357543,娼:-12.378655,线:-6.590441,談:-8.435707,反:-8.316150,牌:-7.880803,雏:-12.615983,姑:-9.011602,織:-6.802919,遠:-7.514485,卢:-10.646127,知:-6.851212,除:-7.733316,緩:-9.084384,彪:-9.484378,歲:-7.986033,迵:-17.334482,闹:-9.133919,鯽:-15.031897,廿:-15.725044,覆:-10.569443,辊:-14.444110,閎:-13.750963,鮒:-14.849575,应:-6.828784,檜:-11.909532,儡:-10.988846,皤:-16.641335,崩:-11.207613,芬:-9.099652,冶:-10.070452,骼:-10.846798,赉:-15.137257,鍍:-13.256944,湟:-15.255040,跞:-17.334482,瑣:-10.772038,鏢:-11.389061,囤:-15.948188,峨:-11.240912,括:-7.173797,虯:-14.936587,棰:-16.641335,滴:-9.535549,须:-7.256369,孽:-10.939220,鹿:-9.083862,沉:-9.348657,贈:-10.670073,上:-5.323135,犍:-17.334482,后:-5.523988,碑:-9.390699,餐:-9.132548,怖:-9.736584,蒙:-9.449529,昚:-17.334482,邡:-15.388572,砦:-14.695425,憫:-11.453949,枯:-12.615983,伴:-9.100713,离:-7.790101,羿:-13.505841,鰾:-15.725044,浈:-14.849575,釋:-8.216915,勍:-16.641335,壑:-12.204583,罔:-15.948188,蕘:-15.948188,譜:-9.465845,裱:-13.345498,号:-7.443523,灶:-11.240912,姻:-9.279959,节:-7.299265,袆:-17.334482,厌:-10.474867,钎:-13.463281,紓:-14.002277,茗:-12.330536,褛:-12.451680,輟:-14.501269,倡:-10.149095,熠:-11.365774,锣:-11.389061,鬧:-9.133919,稽:-11.107945,拂:-12.371637,豉:-13.933285,克:-7.154348,鉍:-16.641335,坏:-8.437620,瓎:-17.334482,鹕:-14.156428,胖:-10.631294,賞:-8.985471,几:-9.943683,巨:-11.037373,腫:-9.911511,赳:-13.723564,篼:-16.641335,齿:-9.310602,舀:-15.388572,萄:-10.603464,挖:-11.243172,嚣:-11.177503,閥:-9.098061,符:-9.768689,披:-11.284748,蜮:-14.849575,褲:-10.706441,炷:-14.849575,锺:-14.338750,鼾:-12.940033,所:-7.326769,摄:-10.122187,凍:-10.469634,灌:-10.944241,柙:-17.334482,佞:-13.463281,兢:-11.559930,学:-5.428427,翩:-12.284626,鹨:-16.641335,臭:-11.181749,诱:-11.353068,践:-8.678745,嫻:-11.418280,昃:-16.641335,标:-7.481025,予:-8.110633,越:-7.761306,琏:-10.719756,岔:-11.368335,耗:-9.574015,暘:-15.542722,訛:-14.076385,谟:-11.383839,匡:-12.147096,弩:-12.421827,誰:-14.243439,洵:-12.759771,貴:-8.167467,隸:-8.761476,颼:-12.421827,懂:-10.893535,毆:-12.385722,轉:-8.277876,配:-7.985424,魑:-17.334482,秒:-10.560258,菖:-17.334482,江:-6.554505,连:-8.178915,癣:-13.003749,艫:-15.137257,遷:-9.282185,相:-7.754856,驻:-9.975651,好:-6.539857,撅:-17.334482,溉:-10.231983,嘎:-12.186987,窑:-10.859049,粕:-12.538691,或:-10.515558,垣:-10.431739,钥:-12.749514,麩:-14.561893,簪:-12.749514,斯:-6.900337,澳:-10.607050,鐺:-13.114974,綿:-10.289577,鸾:-12.181190,煌:-9.444274,筐:-12.124996,曙:-14.076385,乞:-13.463281,婦:-8.305544,绩:-8.095263,普:-9.407518,諱:-10.842242,俳:-16.235870,雹:-12.124996,寻:-10.124402,飽:-11.505536,會:-4.810319,侈:-11.158615,册:-8.728180,階:-9.513641,缓:-9.084384,講:-9.582147,榜:-10.315185,负:-8.730928,疤:-11.789304,羨:-11.949987,樱:-12.291057,记:-7.446768,庾:-16.235870,泊:-8.891366,遍:-8.199835,問:-7.572212,当:-6.950422,叠:-10.204383,督:-7.915503,郢:-14.626432,嗤:-13.933285,祧:-15.388572,髦:-11.465185,荫:-11.207613,轳:-13.550292,酷:-9.765070,榉:-13.670920,箕:-12.823622,挚:-11.190296,閡:-12.240732,座:-7.599354,撫:-9.427935,笪:-16.641335,梳:-12.940033,锶:-14.289959,帼:-13.044022,窿:-11.223015,餾:-11.412903,胃:-10.518842,案:-7.093344,铋:-16.641335,癌:-9.448025,聘:-8.780764,鑠:-13.240137,珥:-13.933285,鉤:-10.813861,秩:-13.463281,慮:-7.950861,诵:-10.436777,當:-6.950422,釹:-16.235870,峻:-9.733579,獺:-12.451680,螂:-12.147096,變:-7.126271,岐:-12.624952,蘗:-13.207348,谛:-12.147096,溜:-10.578713,訟:-9.916301,璠:-15.948188,連:-8.178915,天:-5.896463,札:-12.563797,洱:-13.422459,邸:-11.378645,缽:-12.671043,麼:-5.394460,妾:-11.090315,乇:-16.641335,淆:-11.490937,襉:-15.255040,燎:-12.498200,鵑:-9.795987,習:-7.289625,晗:-10.983596,汛:-10.815335,機:-6.182182,觞:-13.808121,灣:-7.763883,勤:-8.809122,曬:-11.131946,良:-7.784531,泰:-9.597738,陷:-9.254244,兹:-9.931421,综:-12.770134,驿:-12.278236,茄:-11.725010,粑:-10.625178,窕:-13.345498,搖:-9.958600,戚:-9.835612,钡:-13.696896,銥:-16.235870,斫:-16.235870,綻:-11.181749,鈺:-10.564840,弼:-10.327787,过:-5.756668,闋:-14.038645,結:-7.700837,答:-8.007515,镠:-17.334482,噢:-17.334482,饨:-12.661653,婪:-11.123882,蛭:-13.240137,執:-10.187710,瑶:-9.443151,黽:-15.255040,寿:-9.496928,誊:-17.334482,垌:-17.334482,礓:-15.948188,麒:-12.977773,蜗:-13.645602,贛:-11.739771,丝:-8.803780,澜:-10.929253,疠:-14.038645,別:-6.432221,昭:-10.463391,螬:-14.849575,亲:-7.359744,樵:-13.207348,總:-9.766103,墾:-11.107945,佇:-17.334482,降:-7.973999,协:-8.376328,绒:-10.968011,驕:-12.927763,浛:-17.334482,歟:-14.849575,離:-7.790101,古:-7.878923,姨:-10.950975,柬:-12.823622,药:-7.648280,幽:-10.802148,翼:-9.033953,极:-7.720678,計:-6.777732,禕:-12.749514,頔:-14.390043,些:-5.596750,愚:-10.689391,劣:-9.740604,產:-6.114680,暫:-10.813861,礪:-12.378655,悯:-11.453949,丰:-9.305375,檳:-12.538691,贲:-12.977773,券:-8.752625,尼:-8.373886,資:-7.036927,雋:-12.474670,忑:-13.016994,髓:-10.355337,艘:-9.623381,燥:-9.937533,彦:-10.370346,篩:-13.422459,奪:-8.846512,据:-6.776848,鏹:-14.501269,签:-10.551157,氇:-13.144827,辆:-8.810909,瘋:-11.650902,和:-7.597935,瀏:-14.501269,庐:-10.942565,折:-8.856030,蠟:-11.588279,鈣:-11.529347,炤:-16.641335,漱:-12.580892,宾:-9.052505,證:-7.366940,槊:-14.769533,镍:-13.808121,偏:-10.147581,緒:-8.341055,饕:-16.235870,湛:-10.898332,诞:-11.080653,因:-7.553953,闢:-9.388926,虫:-8.542844,擬:-9.377655,聯:-7.779276,詳:-10.348840,卹:-12.001763,狸:-11.072990,顿:-8.053124,蜀:-11.218590,悅:-9.526972,檉:-15.725044,锌:-12.364669,刎:-11.849685,鼐:-11.011917,芙:-13.129789,供:-7.587882,貝:-9.367548,樞:-10.300975,琢:-12.186987,嶧:-16.235870,枫:-10.619099,估:-9.813164,殳:-17.334482,谲:-13.191347,阶:-9.513641,禿:-12.317202,騾:-14.338750,杀:-8.440635,韋:-10.682910,响:-6.976580,界:-6.433216,量:-5.795392,廑:-15.255040,罐:-10.412824,壕:-12.108735,拙:-11.350546,赜:-13.967186,盡:-8.898716,靠:-8.638473,呢:-12.330536,扮:-9.890818,汲:-14.626432,嗷:-13.309130,忻:-13.808121,姿:-10.489666,蒂:-10.326881,看:-7.395338,銎:-15.725044,徐:-10.745555,蔗:-10.790570,掘:-9.409686,輛:-8.810909,娩:-11.610897,搭:-12.098040,辰:-9.376255,嚶:-15.388572,爹:-9.159497,簽:-10.551157,媾:-14.076385,擂:-13.071802,鹑:-12.880135,孓:-15.388572,敗:-7.725298,潛:-10.344225,胚:-14.076385,埠:-11.348030,铢:-12.759771,凤:-8.734051,寨:-9.219260,飪:-11.194597,旬:-9.693878,乱:-7.951534,長:-5.457094,饿:-10.803604,箍:-13.402656,崎:-11.949987,逐:-9.630572,阔:-8.989739,趙:-10.971454,焦:-10.604658,閩:-12.903665,溯:-10.561402,贮:-12.652351,茲:-9.931421,尸:-9.680987,皿:-11.661159,锾:-15.542722,桀:-13.670920,賃:-11.440079,俅:-14.695425,湄:-14.076385,苇:-10.695914,穌:-11.181749,凑:-11.373477,埕:-16.641335,淙:-11.535389,佚:-11.789304,孢:-12.466947,翥:-14.849575,鹤:-9.820227,坪:-10.783402,语:-7.148714,浮:-10.201186,鷹:-9.427566,僻:-10.906377,囿:-14.198988,弥:-11.714081,纤:-10.512285,璨:-12.407228,朵:-9.028257,蚴:-13.573282,紹:-8.148024,鲸:-11.335545,銼:-16.641335,喾:-13.779134,毂:-14.849575,轅:-11.203255,蕉:-10.772038,塋:-13.696896,呓:-14.198988,晟:-11.858018,鯢:-11.566161,牧:-9.648320,哨:-10.216466,衫:-9.672014,韪:-13.750963,櫬:-15.031897,惰:-12.284626,葳:-13.620910,更:-9.758385,驷:-14.849575,狼:-10.581044,梁:-8.748696,溅:-11.604382,窍:-11.214184,導:-6.508940,划:-6.834606,栖:-10.781974,渚:-12.940033,芝:-9.963622,搞:-13.003749,麥:-8.897198,钩:-10.813861,榫:-15.948188,瘪:-13.207348,鸺:-17.334482,瞿:-14.501269,鐾:-16.641335,跃:-9.099386,仅:-7.634274,菇:-10.101026,效:-7.634335,筌:-14.198988,僑:-9.927771,闓:-15.948188,赘:-12.124996,荜:-15.725044,婢:-10.493935,绥:-12.624952,噪:-11.617454,諭:-10.773451,俯:-15.388572,胱:-11.578740,击:-7.147207,瑾:-10.018598,侄:-11.717711,指:-8.294574,肆:-10.356268,蚊:-13.016994,完:-9.253316,謗:-12.246886,堡:-8.645691,鴣:-10.442856,帥:-8.656191,群:-7.729805,吩:-14.338750,昵:-12.222494,爽:-10.125882,葉:-8.143630,奋:-9.052758,驍:-13.191347,狒:-13.868746,陕:-11.532364,束:-7.936169,忤:-16.641335,郦:-14.561893,雪:-8.568088,软:-8.995698,柴:-10.663716,屹:-13.463281,言:-7.037197,涅:-11.905136,枉:-10.964581,禍:-10.015942,頌:-10.530977,玑:-13.114974,鈐:-13.723564,儒:-10.263758,欖:-11.909532,辙:-11.270697,膝:-11.136003,脲:-14.561893,常:-6.361227,值:-6.838110,霾:-12.940033,姍:-11.123882,硌:-16.235870,发:-6.506458,篡:-17.334482,奢:-12.291057,卦:-10.348840,矩:-9.529007,啪:-12.589550,潮:-8.518667,菱:-11.069181,勻:-10.085978,睾:-13.223608,程:-6.315476,薊:-14.626432,瘓:-11.196755,醒:-8.552619,伙:-8.939908,舛:-15.255040,嬡:-12.891831,窠:-16.235870,鸣:-9.327115,粤:-11.617454,圩:-14.501269,侮:-10.756621,家:-5.092728,麸:-14.561893,嶺:-8.284897,乃:-10.661184,赅:-13.016994,揆:-13.223608,蝉:-11.479410,屏:-10.061389,翎:-12.429207,噓:-11.610897,燒:-8.954713,付:-8.058916,跚:-12.407228,摟:-14.769533,峤:-12.152698,詫:-11.689035,闪:-10.180648,擴:-10.562546,顷:-8.760153,役:-8.143630,绸:-10.487539,鉻:-14.038645,兽:-9.505647,鑿:-10.901542,檁:-17.334482,謀:-8.900018,沅:-13.016994,贄:-13.573282,暉:-9.889064,碍:-9.028998,餌:-12.046215,錐:-11.905136,倒:-8.397395,肝:-10.608249,骡:-14.338750,殫:-15.255040,琪:-9.885566,涯:-9.774401,玻:-13.967186,儼:-16.641335,杈:-12.615983,韓:-11.229689,畔:-10.609448,塢:-11.076814,靨:-13.085987,英:-7.667920,究:-6.739148,黹:-14.561893,叻:-14.501269,都:-7.483077,百:-8.924206,袂:-12.952455,笋:-11.426399,丙:-11.482279,茛:-13.670920,鄧:-12.021276,嘩:-11.160696,亮:-7.589580,詁:-12.278236,佃:-12.076987,棂:-12.801882,拆:-12.615983,擊:-7.147207,額:-7.609702,绎:-11.343017,鉑:-13.933285,論:-6.503744,俘:-10.061389,賚:-15.137257,飢:-12.098040,照:-7.342892,饷:-11.284748,幹:-7.817098,偽:-10.596329,燼:-11.862211,长:-5.457094,谀:-12.749514,疑:-8.220763,鐐:-13.291431,園:-7.350936,玕:-17.334482,鈔:-11.624055,缢:-12.310601,沫:-10.318769,猪:-9.893748,纷:-8.538900,汀:-12.061482,蛇:-9.858576,忍:-9.388218,髏:-11.896403,嗑:-14.849575,虜:-10.236106,緡:-16.641335,形:-7.290450,篥:-14.390043,驤:-12.977773,啦:-11.042913,迭:-10.871452,杲:-11.710464,廷:-7.929974,勿:-11.637388,辂:-13.645602,昇:-17.334482,莊:-8.727265,咐:-8.985471,鞒:-16.235870,舟:-9.635546,躬:-12.066624,隼:-14.198988,赁:-11.440079,濂:-12.834672,旆:-16.641335,屋:-8.762422,镑:-10.622742,跖:-17.334482,诚:-8.831388,癧:-14.338750,豫:-9.473140,滬:-12.016362,擰:-16.235870,聳:-11.338030,拴:-12.990676,盼:-10.502528,沁:-11.777654,謄:-17.334482,悉:-8.678397,脈:-8.519557,锐:-9.304398,侗:-14.038645,鲡:-13.114974,妣:-14.695425,骥:-11.862211,垧:-16.235870,琦:-10.343305,涫:-16.641335,爪:-11.092259,殯:-13.114974,夸:-11.949987,逾:-15.388572,慈:-10.340549,哑:-10.980112,動:-5.486728,鵠:-13.505841,幢:-11.490937,童:-8.343791,烩:-14.115606,剪:-11.402237,空:-7.352322,灾:-9.475069,紋:-9.545027,芊:-13.723564,後:-14.626432,笏:-16.235870,颎:-17.334482,焓:-15.255040,榘:-16.641335,果:-6.155157,綠:-9.597738,娥:-10.268015,霧:-9.542546,倩:-10.227056,熨:-17.334482,渭:-12.198683,薰:-13.463281,傾:-10.777704,豁:-14.626432,滂:-16.641335,嵋:-11.017317,鑑:-9.933861,盒:-9.890818,敛:-10.638683,损:-9.357200,胞:-8.208067,黢:-14.444110,赫:-9.664053,鋪:-9.319816,濬:-16.641335,譯:-9.014521,腳:-8.476113,援:-8.859987,塹:-11.728680,秸:-12.310601,掉:-8.848573,興:-7.647473,阐:-13.868746,途:-8.611902,挞:-13.071802,索:-8.071359,馥:-12.990676,咧:-12.506168,眦:-15.542722,溫:-8.242925,梯:-9.537191,吼:-11.699692,錾:-15.542722,俁:-14.002277,扈:-11.520351,巍:-10.525443,籌:-10.332326,飏:-15.031897,毙:-10.924307,葜:-16.235870,翡:-14.038645,坦:-8.614674,珩:-12.392839,敲:-11.841420,祺:-11.360672,闽:-12.903665,獾:-13.364190,膊:-10.146069,鮎:-14.156428,閒:-9.650618,纠:-13.696896,夥:-8.939908,鐧:-11.918382,責:-7.483921,朱:-9.989117,蚰:-16.641335,肴:-9.424258,骸:-11.109923,钼:-14.338750,草:-8.421605,痒:-10.752457,汗:-9.116774,廠:-7.953893,壤:-8.954943,韦:-10.682910,曰:-11.376057,艳:-8.925765,惴:-12.845846,鱷:-13.256944,避:-9.219858,梅:-8.115677,皑:-13.016994,吒:-14.038645,炕:-12.259308,宣:-10.627620,颥:-14.561893,喧:-14.002277,瘦:-10.952666,鸶:-14.002277,嬸:-11.585089,瞻:-11.259136,鈾:-13.191347,仁:-8.681535,诃:-13.808121,囑:-10.599890,睐:-10.780549,僕:-9.977564,乖:-10.879283,識:-7.085492,绡:-14.002277,齠:-16.235870,屢:-11.644122,饤:-16.641335,狩:-13.057816,賭:-11.940854,巷:-9.619804,凿:-10.901542,牾:-15.031897,貂:-12.857145,骎:-16.235870,钒:-13.484334,殘:-10.551157,斜:-9.974378,鬣:-16.641335,利:-6.448860,昱:-11.220800,怵:-13.402656,庶:-11.945410,稹:-11.575580,劾:-10.869894,衅:-11.328129,惊:-8.978397,奏:-9.017204,卓:-10.762199,瓒:-12.607094,違:-11.211989,慟:-13.383238,苞:-13.016994,忠:-8.390715,鳢:-15.255040,叨:-11.225234,淬:-15.948188,襯:-11.773800,命:-6.413791,酿:-11.076814,退:-8.759209,瞅:-13.291431,阄:-10.917750,弊:-10.723786,舌:-10.424729,焖:-11.758533,废:-10.559116,紞:-17.334482,炫:-12.977773,漪:-11.311034,键:-8.574029,堰:-8.972306,粳:-15.725044,鬲:-16.641335,贾:-11.133973,铃:-10.571752,蛏:-14.626432,桐:-9.813164,賓:-9.052505,兖:-17.334482,坚:-9.485938,查:-7.266285,豨:-17.334482,駱:-14.626432,慶:-8.091868,藹:-11.801092,诽:-14.501269,仿:-10.075366,球:-7.210013,鎂:-12.522298,馆:-7.715349,龊:-12.834672,昏:-10.306280,氓:-10.786263,五:-8.268589,璘:-15.948188,窜:-11.559930,鸟:-9.683362,悠:-10.393292,銬:-11.913947,單:-7.874239,礱:-15.388572,缵:-15.542722,改:-8.440086,蒸:-10.305394,欽:-10.002767,誼:-9.556689,珂:-12.186987,秆:-11.866422,翊:-12.323847,旎:-12.891831,毒:-8.125743,触:-8.557081,迪:-9.457085,独:-8.950135,维:-8.198650,艷:-8.925765,霄:-10.097423,堆:-9.374507,粉:-8.677527,褐:-12.739362,輔:-9.453678,钙:-11.529347,骝:-14.561893,股:-7.884810,販:-11.057838,鐮:-13.900495,掷:-11.017317,耶:-10.973179,榻:-11.607634,蘺:-14.769533,捌:-16.641335,仕:-10.863682,潔:-8.785596,属:-7.477248,惡:-8.902411,巳:-13.071802,恶:-8.902411,智:-8.629151,汾:-12.108735,冀:-11.333067,垄:-14.289959,领:-7.304009,侔:-12.240732,蔣:-11.821053,涨:-9.115425,爭:-6.699949,鎬:-12.234615,樽:-16.641335,讼:-9.916301,遁:-12.598283,狂:-9.656618,际:-6.662438,鱉:-13.442662,绊:-12.812693,擎:-10.899935,蹕:-12.652351,獗:-11.588279,罟:-17.334482,鳞:-12.001763,散:-8.365067,歧:-10.410853,称:-6.855168,荷:-9.757360,旸:-15.542722,襻:-15.948188,轿:-12.323847,鈀:-15.388572,儂:-13.274039,而:-7.033931,訐:-13.309130,涕:-11.263744,谔:-13.175599,媛:-10.146825,甚:-11.420979,辩:-10.109000,洪:-9.138597,倬:-13.696896,纳:-8.218782,茶:-8.867109,檻:-10.727832,蔺:-13.933285,沿:-10.192445,叁:-14.289959,瑄:-14.936587,苋:-13.808121,卖:-8.648559,陘:-13.383238,握:-8.343044,日:-6.332732,廳:-8.266166,蟹:-10.625178,搏:-10.777704,逗:-12.572308,碜:-13.422459,撤:-11.773800,垮:-11.511436,妲:-13.750963,椽:-16.235870,鍁:-13.129789,篆:-12.903665,緊:-8.282200,乓:-12.082208,籟:-12.965034,桧:-11.909532,详:-10.348840,仨:-16.235870,跪:-12.259308,六:-9.021611,烬:-11.862211,鹳:-13.422459,糴:-15.948188,職:-7.767937,書:-6.867443,犁:-11.236408,锄:-15.255040,娆:-12.834672,尊:-9.446523,悍:-10.742808,檑:-16.641335,謐:-12.451680,冗:-14.849575,隙:-9.884984,宛:-10.314291,琚:-16.641335,额:-7.609702,縞:-15.137257,芡:-16.235870,玫:-12.580892,疯:-11.650902,阮:-14.338750,嬰:-11.156538,頲:-15.137257,崴:-13.016994,憷:-15.031897,舶:-9.829540,勁:-9.058087,廉:-10.299213,慌:-10.312505,藏:-7.962023,歐:-9.323127,浔:-13.868746,剖:-11.080653,荠:-14.002277,蕤:-14.038645,滩:-9.425360,轨:-10.168988,叫:-8.229724,郭:-11.647507,癮:-11.133973,扶:-10.845277,蛹:-14.626432,湾:-7.763883,善:-7.671220,骆:-14.626432,攏:-10.552290,漓:-11.088375,袒:-12.538691,堝:-13.114974,掠:-10.781974,斤:-8.256302,醬:-10.560258,稱:-6.855168,鶴:-9.820227,栽:-12.770134,烂:-9.514444,奇:-8.054989,鹉:-12.108735,糊:-9.430886,聍:-15.948188,体:-5.656508,棒:-9.719184,豕:-17.334482,筛:-13.422459,姜:-11.992148,點:-5.991538,諦:-12.147096,俨:-16.641335,質:-6.606665,镯:-12.147096,練:-7.746733,鈄:-17.334482,須:-7.256369,谐:-9.818593,岛:-7.623003,礞:-15.137257,产:-6.114680,璫:-17.334482,犯:-8.822502,碳:-10.528759,娴:-11.418280,治:-6.467324,瑀:-16.641335,郃:-17.334482,蓋:-8.618438,晌:-9.817505,苏:-8.832605,汐:-11.601141,啖:-17.334482,燙:-11.829150,遘:-17.334482,博:-9.254244,鹜:-13.463281,表:-6.388688,煮:-11.318325,壳:-9.263576,署:-8.200051,捺:-13.207348,追:-11.209799,咀:-11.758533,戏:-8.618438,栓:-11.585089,阗:-11.829150,纜:-10.628843,护:-7.154841,梨:-11.150333,紱:-15.137257,镁:-12.522298,偃:-16.235870,饉:-13.837974,濒:-14.038645,闖:-11.291849,湧:-10.021928,鑫:-9.892575,璁:-12.135985,销:-7.872760,錄:-7.975204,将:-7.701688,謔:-12.801882,邙:-17.334482,蒡:-15.725044,芥:-13.044022,侧:-7.923407,氦:-13.422459,疫:-9.750217,横:-9.682886,环:-8.581742,禳:-16.641335,嬴:-14.936587,枷:-16.235870,似:-7.954314,殿:-8.185804,品:-6.038233,獄:-9.415489,祈:-12.323847,菏:-17.334482,呖:-14.936587,烙:-14.501269,绝:-8.334863,塞:-9.129263,拥:-9.845070,荤:-13.309130,可:-7.522616,摶:-14.156428,喀:-11.945410,厄:-12.323847,缇:-16.235870,鲆:-15.542722,妈:-8.331658,骊:-13.900495,躒:-17.334482,候:-6.525603,鴛:-15.031897,帝:-6.900219,鬟:-11.211989,榨:-11.365774,元:-6.370292,盂:-12.400008,鉅:-14.769533,竊:-11.211989,評:-8.702889,铖:-10.810920,飞:-8.076876,慣:-8.843017,賦:-9.938147,镫:-12.952455,山:-6.183244,饳:-17.334482,婵:-12.169696,懸:-10.904762,濼:-15.137257,阀:-9.098061,萌:-10.956056,踐:-8.678745,榕:-11.318325,焚:-11.604382,墟:-10.827204,笞:-13.044022,攢:-12.429207,让:-8.451119,听:-8.484251,炯:-11.661159,錮:-12.056367,場:-5.786865,撷:-14.390043,癀:-15.137257,蛋:-9.122456,俑:-12.082208,桔:-12.680522,珙:-14.390043,党:-6.923484,緝:-11.581909,闭:-8.679093,絲:-8.803780,菹:-17.334482,任:-6.634727,嚀:-12.522298,閂:-12.092735,簇:-12.181190,龆:-16.235870,怏:-12.965034,莎:-10.805063,樓:-7.385304,匙:-10.632522,鸛:-13.422459,谧:-12.451680,甭:-15.542722,厮:-11.188153,芸:-11.035533,洽:-11.426399,貼:-9.479325,痂:-13.808121,魉:-14.038645,淒:-14.390043,瑗:-13.750963,勘:-11.793218,扣:-10.024600,迦:-11.544522,啭:-14.936587,影:-7.806124,绰:-12.061482,驳:-10.658659,葷:-13.309130,泼:-10.472771,衿:-16.235870,需:-9.353432,炅:-13.808121,鄄:-15.948188,帆:-9.593383,堊:-12.378655,瀚:-11.747233,稞:-12.429207,肥:-9.397464,渦:-11.229689,株:-9.649238,唬:-11.647507,鈮:-16.641335,鰲:-12.135985,头:-5.905971,斷:-6.983940,榿:-15.948188,着:-6.360439,鏃:-13.837974,僅:-7.634274,嫉:-13.750963,敌:-8.780957,臏:-13.160095,仑:-10.060002,楔:-15.255040,做:-8.666802,蝠:-11.502599,书:-6.867443,铭:-9.588614,凯:-8.808527,牮:-17.334482,籲:-9.959853,晶:-8.912919,苹:-12.530461,恺:-11.559930,賽:-7.187931,紇:-12.598283,守:-8.014660,朋:-11.031863,颊:-10.475917,意:-6.336273,芎:-13.837974,锗:-15.725044,则:-7.301371,尝:-10.073959,綜:-12.770134,憤:-9.696284,货:-8.894818,閬:-16.235870,縱:-9.614908,馴:-12.240732,千:-8.836675,嵇:-17.334482,细:-8.217134,磊:-9.798651,拎:-15.725044,蹑:-16.641335,变:-7.126271,祟:-11.381239,捣:-12.812693,酯:-11.152397,翰:-10.117038,塵:-9.430147,蕷:-14.076385,轻:-8.005470,淼:-11.581909,西:-6.611898,禁:-8.434751,羅:-8.577957,儆:-17.334482,殍:-14.156428,訌:-10.637448,憑:-10.499297,耐:-10.257828,枕:-12.135985,缚:-10.554560,欢:-7.989698,愦:-14.501269,薩:-9.081515,未:-8.365449,纯:-9.259522,嘴:-9.289214,褶:-12.927763,悻:-12.538691,础:-7.483868,必:-8.005648,鋇:-13.696896,恐:-9.650618,蓓:-11.547585,晔:-11.620749,奖:-8.498253,鱘:-10.642398,珝:-17.334482,啞:-10.980112,衠:-15.137257,早:-8.143019,士:-6.632092,絮:-11.496751,獲:-9.088573,韵:-10.050347,跹:-14.198988,潺:-12.903665,菽:-15.725044,墀:-12.016362,庄:-8.727265,栋:-9.793329,搓:-12.891831,崙:-10.060002,粘:-14.695425,逛:-11.728680,匝:-13.484334,队:-6.259751,谣:-10.985343,伥:-13.900495,焱:-11.913947,邰:-17.334482,厲:-9.586453,眵:-17.334482,隴:-13.191347,洹:-15.725044,貸:-9.768171,挽:-17.334482,則:-7.301371,镉:-14.444110,乏:-8.727082,腑:-10.834695,插:-11.294227,蝕:-9.570186,穗:-10.827204,癟:-13.207348,询:-8.590313,令:-7.217982,执:-10.187710,顫:-11.353068,共:-8.018071,直:-7.096202,拼:-11.874896,虿:-16.235870,倆:-9.839496,璉:-10.719756,锈:-11.982624,脐:-13.207348,暕:-17.334482,宗:-8.021585,砖:-10.557975,军:-5.788828,怦:-11.303797,羯:-17.334482,疳:-14.695425,殷:-11.754752,蠶:-11.396946,壁:-8.477963,祀:-9.688606,罄:-13.596812,哉:-11.526339,畈:-15.388572,歌:-8.809321,藓:-12.158332,糙:-11.111906,襠:-12.927763,滥:-10.947603,轤:-13.550292,蕨:-15.725044,姫:-14.561893,籮:-13.645602,牲:-9.514444,桶:-10.214846,骂:-9.778577,径:-8.118458,喈:-15.542722,椋:-16.235870,隊:-6.259751,漏:-9.992350,芒:-9.657545,初:-8.021495,责:-7.483921,严:-8.663024,澤:-8.842607,茧:-11.992148,劲:-9.058087,氹:-16.235870,人:-4.711846,莼:-17.334482,鹅:-10.611852,升:-7.930138,益:-7.226993,住:-7.115454,拒:-10.907993,處:-6.752428,浣:-15.388572,諢:-13.670920,捧:-11.739771,婭:-10.956056,镳:-11.766137,護:-7.154841,腻:-10.676471,匆:-9.832847,阈:-14.849575,伎:-13.345498,斕:-11.883443,龙:-7.341336,力:-5.469661,級:-5.829780,计:-6.777732,攪:-12.444133,到:-5.316499,鄲:-11.725010,吴:-10.392325,丸:-10.511196,贺:-10.062084,撿:-15.255040,黃:-9.121642,巅:-12.506168,郇:-15.255040,請:-8.252998,桌:-9.569337,摔:-13.900495,鹘:-11.637388,遜:-9.249303,坞:-11.076814,毡:-12.634002,詠:-12.016362,淥:-14.561893,柩:-11.111906,駭:-11.728680,置:-7.265099,煲:-11.714081,闵:-12.880135,迹:-8.010277,松:-8.125543,氏:-8.366978,易:-7.173527,頗:-12.092735,纘:-15.542722,炜:-10.637448,暨:-13.364190,微:-8.386546,冲:-8.192313,电:-7.793831,钴:-15.388572,肼:-13.967186,魁:-11.078732,假:-8.871745,荑:-15.948188,懒:-11.523341,鯖:-17.334482,牛:-9.011602,鷚:-16.641335,瑟:-10.598702,韞:-14.038645,藪:-14.561893,奭:-17.334482,磬:-13.364190,危:-9.954226,陳:-10.740068,瓴:-13.750963,衷:-10.215656,滸:-12.210518,突:-9.310274,堂:-7.524646,分:-5.816509,霈:-11.696127,吊:-10.999428,与:-8.355821,抑:-10.725133,撕:-17.334482,妗:-16.641335,喟:-15.255040,誡:-11.192445,侣:-10.620311,蚩:-16.641335,箫:-11.982624,搪:-13.900495,瞳:-11.909532,進:-6.538484,榷:-13.016994,訶:-13.808121,伸:-9.344244,嫁:-10.402034,組:-7.997773,采:-9.290819,捐:-11.434585,给:-7.797070,泥:-9.333462,赤:-10.793452,蝨:-13.645602,寫:-8.345287,飭:-12.506168,巯:-17.334482,铵:-12.392839,決:-7.220288,能:-5.759634,晾:-16.641335,缃:-15.542722,颂:-10.530977,嶄:-14.501269,钊:-9.922322,帙:-14.626432,錛:-14.626432,熜:-17.334482,锟:-11.927310,涤:-11.140077,枨:-15.255040,砭:-13.550292,馬:-7.173140,爱:-8.110633,鎰:-14.769533,傲:-10.125882,驁:-13.160095,兇:-11.144167,陉:-13.383238,瓊:-9.646485,衍:-10.269723,滎:-15.137257,祗:-12.466947,忘:-10.246908,凜:-11.067281,雞:-9.304398,裢:-13.364190,慧:-8.709152,苦:-8.040168,珰:-17.334482,靳:-16.641335,呵:-11.758533,痴:-11.205432,荻:-11.797148,懼:-9.507241,綁:-11.511436,异:-8.194671,騄:-17.334482,唆:-12.634002,澍:-11.059720,斑:-10.275724,店:-8.152953,香:-8.312763,咛:-12.522298,功:-7.154538,漢:-6.766581,讥:-13.129789,膩:-10.676471,挪:-13.071802,窯:-10.859049,餮:-13.484334,炳:-9.605186,露:-7.987166,贶:-17.334482,撻:-13.071802,抿:-13.868746,脾:-12.739362,寅:-10.827204,雇:-12.204583,凉:-9.328781,願:-8.032292,孚:-11.520351,淡:-9.583867,闱:-13.100375,僳:-13.291431,鏵:-13.223608,价:-7.511933,閆:-17.334482,傈:-17.334482,鎊:-10.622742,二:-7.624822,碘:-15.255040,蠣:-12.729312,您:-17.334482,缭:-13.327149,妮:-10.006045,由:-7.667667,钰:-10.564840,椹:-13.967186,朽:-10.456155,魅:-12.680522,酉:-12.868574,珊:-10.275724,轍:-11.270697,槎:-14.501269,柒:-16.641335,壘:-10.402034,瑛:-10.250255,牟:-13.291431,档:-9.843953,迢:-11.862211,菪:-13.933285,彭:-12.952455,驯:-12.240732,卵:-9.662655,曼:-8.914681,艿:-14.936587,市:-5.446324,吆:-16.641335,炉:-9.632830,刊:-9.038684,撑:-9.951114,投:-10.366573,茔:-13.696896,得:-5.825575,颙:-14.849575,稚:-11.348030,原:-7.106306,財:-9.378005,誥:-15.542722,搦:-15.948188,肩:-10.376034,截:-9.731083,熳:-15.725044,防:-8.089161,診:-9.962993,峁:-13.696896,絀:-12.834672,僉:-13.645602,跋:-11.100071,仍:-12.490295,诏:-10.904762,磙:-14.243439,婚:-8.623039,靜:-7.896926,泡:-9.858576,赠:-10.670073,櫥:-12.436642,惩:-10.218900,巫:-12.801882,确:-7.516226,铱:-16.235870,凳:-10.843758,癲:-12.066624,汶:-12.563797,裹:-10.471724,麂:-15.542722,宄:-14.695425,眇:-16.235870,冈:-9.181708,洋:-7.621066,欏:-13.933285,鼗:-16.641335,锛:-14.626432,錟:-17.334482,殤:-14.338750,憨:-14.002277,墮:-15.388572,爵:-9.623829,根:-8.073068,绂:-15.137257,驅:-10.488602,均:-7.512367,葑:-14.936587,罗:-8.577957,鳖:-13.442662,姘:-15.137257,畛:-17.334482,楣:-10.680329,魯:-9.558366,呱:-12.880135,痰:-11.900760,創:-9.100448,蕻:-14.626432,羁:-12.357748,禅:-10.433751,圆:-9.382571,玉:-7.650706,谌:-14.444110,岗:-8.739402,编:-8.881721,朦:-13.364190,纫:-13.144827,尬:-10.067655,鬮:-10.917750,嘰:-12.607094,锲:-16.235870,叉:-9.907338,版:-8.215270,軋:-12.061482,苓:-10.939220,篙:-12.880135,奚:-14.561893,卞:-14.626432,濡:-15.725044,蹠:-13.967186,揩:-14.695425,壯:-9.184014,筮:-13.670920,勳:-9.790679,畲:-15.948188,釵:-10.363752,稃:-15.137257,琇:-17.334482,劈:-13.100375,栏:-9.628319,嬙:-15.542722,窘:-12.680522,璜:-11.973190,速:-7.041422,訣:-10.684203,萧:-11.909532,宮:-7.729400,隰:-17.334482,喲:-10.831692,邴:-17.334482,侶:-10.620311,蒼:-11.725010,之:-7.947587,燊:-17.334482,旒:-15.725044,腕:-10.022596,鏞:-13.240137,摧:-12.709509,鹫:-12.845846,自:-7.316015,顯:-8.044776,兵:-6.773915,烴:-11.448378,櫸:-13.670920,虻:-13.967186,聿:-15.948188,嘆:-9.230988,暑:-10.547765,脔:-15.948188,垛:-12.474670,砚:-11.585089,钝:-11.459551,躡:-16.641335,氢:-11.183879,芩:-13.345498,怪:-8.308666,騮:-14.561893,地:-5.612025,鐲:-12.147096,廁:-12.770134,勉:-11.532364,材:-7.818497,站:-7.676384,魘:-13.240137,塚:-13.327149,镜:-8.686085,满:-7.946916,择:-7.941237,快:-7.452576,右:-7.927424,郵:-11.610897,蓽:-15.725044,找:-8.969974,往:-7.351583,笃:-11.982624,鲂:-13.402656,妄:-11.473696,隆:-8.647715,邊:-6.726759,椏:-13.030417,吝:-12.977773,推:-10.925953,咲:-12.952455,亶:-16.641335,樹:-8.111917,许:-7.601605,搽:-16.641335,盆:-9.864258,鉉:-12.222494,烊:-14.849575,虑:-7.950861,擒:-11.675000,睛:-7.961173,飚:-13.309130,俠:-9.100713,正:-7.102806,賢:-9.108443,緬:-15.725044,饯:-12.643134,偵:-13.463281,燴:-14.115606,起:-6.268062,蝻:-15.725044,腿:-9.398537,挂:-9.331119,誇:-11.949987,厍:-17.334482,随:-9.209147,徕:-12.791187,抗:-8.545888,萘:-15.388572,溟:-13.573282,造:-6.978328,璣:-13.114974,鰨:-15.388572,戬:-13.345498,渴:-10.947603,稼:-10.922664,珍:-8.394377,剌:-15.137257,科:-6.845655,幔:-12.011472,苗:-8.962314,軟:-8.995698,浞:-14.561893,凡:-9.060380,铣:-13.933285,巩:-12.147096,惫:-11.154465,罪:-8.365449,衰:-10.253614,泳:-10.000153,其:-7.141651,驼:-10.719756,绿:-9.597738,暄:-11.833224,沈:-12.514200,個:-4.601848,嘏:-14.695425,餑:-13.057816,攙:-16.641335,無:-8.639143,鎢:-14.390043,眥:-15.542722,谳:-15.255040,殲:-11.289477,鈷:-15.388572,頻:-9.069604,鸿:-10.129589,綾:-12.421827,胀:-9.460884,蛄:-13.723564,橇:-12.671043,賈:-11.133973,俊:-8.796310,嗎:-11.284748,寒:-9.273311,黔:-12.624952,蕙:-12.228536,擘:-13.868746,也:-8.976988,靥:-13.085987,盤:-8.113301,婧:-10.896730,诲:-11.532364,醋:-11.399588,渊:-9.927164,劍:-8.066156,鞏:-12.147096,鶓:-14.338750,底:-7.218952,榛:-14.695425,疣:-14.338750,箧:-17.334482,鴨:-11.637388,袱:-10.479073,椰:-14.390043,钹:-13.723564,甸:-9.990409,妻:-9.353432,笼:-9.871119,泉:-8.270208,蹊:-13.967186,奐:-13.696896,绕:-9.114617,晚:-8.466209,迟:-9.902590,汞:-13.129789,僡:-17.334482,牢:-10.034009,鯧:-14.849575,繪:-9.248379,柯:-11.296611,淳:-9.804539,轴:-10.397168,偶:-10.242740,移:-8.438304,屾:-17.334482,老:-8.062200,蘅:-14.289959,构:-6.844625,消:-9.066263,儋:-13.573282,鈍:-11.459551,頑:-12.977773,羔:-12.801882,肖:-11.363220,貞:-9.966773,冠:-9.498903,颦:-14.002277,脫:-9.028257,撮:-12.834672,吹:-10.529867,皺:-10.769217,精:-9.372415,臀:-15.031897,蟄:-14.198988,歇:-10.503608,今:-7.517206,駐:-9.975651,嫒:-12.891831,詝:-17.334482,佟:-14.769533,燠:-15.137257,編:-8.881721,扭:-11.389061,蓮:-8.906557,导:-6.508940,再:-8.364558,钏:-13.670920,麓:-9.841165,沟:-9.278372,伞:-10.884011,碧:-11.350546,鸨:-12.915641,亳:-15.137257,水:-6.622979,傷:-7.929068,岿:-17.334482,旅:-10.053096,濉:-15.948188,么:-11.728680,偌:-16.641335,篑:-13.207348,饒:-10.643640,胗:-16.641335,諛:-12.749514,潞:-13.383238,叡:-15.137257,難:-7.497348,嗥:-13.442662,詰:-13.933285,烷:-10.921023,陸:-7.806634,顼:-12.498200,茁:-15.255040,技:-7.541702,載:-8.065307,吏:-9.382571,鴕:-17.334482,莖:-10.666254,辞:-9.309947,猡:-14.390043,加:-6.379998,甥:-11.754752,咤:-14.038645,缩:-8.972774,舫:-12.759771,圹:-15.137257,晃:-9.799185,蓄:-9.902590,城:-6.568273,姒:-16.641335,鳔:-15.725044,狠:-9.936920,瓤:-14.849575,睹:-10.081719,闺:-14.156428,怂:-16.641335,争:-6.699949,傍:-13.129789,閏:-13.100375,砒:-16.641335,涟:-13.620910,丞:-12.222494,錠:-11.026383,锤:-10.833192,禧:-9.306353,冷:-9.355486,隹:-15.388572,眸:-12.317202,礼:-8.209155,聂:-14.936587,擅:-13.696896,兌:-11.254549,子:-4.788803,顒:-17.334482,糕:-10.195615,诛:-12.940033,跟:-10.884011,湞:-14.849575,哥:-7.483657,廩:-13.383238,旯:-13.670920,議:-6.230262,赴:-10.347915,饼:-10.024600,幾:-9.943683,踉:-15.948188,澈:-10.843758,逍:-14.289959,唏:-15.137257,箐:-14.390043,弓:-10.684203,躞:-15.388572,邢:-14.936587,琥:-13.723564,徨:-12.344049,茫:-10.113377,暮:-12.589550,輳:-14.501269,状:-7.973827,鬻:-17.334482,鴿:-10.959457,纾:-14.002277,菀:-15.137257,权:-6.488899,迈:-10.866783,里:-5.508631,畏:-10.093116,柘:-15.725044,衝:-8.192313,珠:-8.672323,奧:-9.905555,鹩:-14.769533,恭:-10.945921,蛮:-10.128847,橱:-12.436642,铺:-9.319816,黾:-15.255040,肃:-9.086214,躇:-11.078732,權:-6.488899,颓:-13.596812,宕:-11.992148,暗:-8.706463,耘:-11.581909,沛:-10.105368,级:-5.829780,嬪:-11.825094,螭:-14.769533,趱:-17.334482,氰:-17.334482,嚷:-10.824224,旁:-8.936072,屐:-13.596812,齒:-9.310602,敖:-12.868574,保:-8.130260,楞:-13.868746,嗡:-11.289477,睢:-14.695425,句:-7.599886,給:-7.797070,虬:-14.936587,拯:-11.563041,啶:-12.114126,選:-7.816363,系:-6.299399,卺:-14.338750,鹼:-9.875719,竿:-11.657728,茅:-10.837707,抄:-11.245437,万:-7.655326,霍:-11.245437,亜:-15.255040,猥:-15.948188,墨:-9.737587,鰻:-13.327149,玺:-10.593963,禾:-10.725133,蓀:-11.488043,恃:-11.849685,苄:-13.933285,瑋:-10.884011,雌:-15.948188,鳐:-15.725044,忒:-13.505841,體:-5.656508,惘:-11.743495,瓠:-17.334482,鍥:-16.235870,磨:-9.458223,杭:-11.538424,昂:-9.592514,辇:-13.550292,開:-6.427884,樊:-11.254549,鎏:-14.289959,岑:-11.918382,馓:-15.948188,林:-6.802066,脘:-13.837974,涛:-8.740143,锠:-17.334482,館:-7.715349,本:-5.838998,邹:-14.038645,宿:-9.542133,擁:-9.845070,担:-8.457658,豆:-9.034947,棉:-10.376034,過:-5.756668,嵐:-10.585722,孔:-9.018671,仝:-11.773800,員:-5.928630,釣:-12.634002,癢:-10.752457,壩:-9.616241,走:-8.315060,槳:-11.263744,酸:-8.566997,塾:-11.905136,萁:-14.769533,舅:-10.435767,掄:-15.031897,榈:-12.198683,箔:-11.117876,渝:-11.936319,袞:-10.175968,妨:-9.823504,蔫:-14.115606,褳:-13.364190,鴻:-10.129589,帽:-9.987182,碾:-16.235870,潇:-11.465185,览:-8.625017,畋:-13.402656,韌:-11.448378,彧:-15.725044,银:-9.059360,凸:-11.391683,飾:-8.825523,芃:-14.936587,漆:-10.280032,隋:-15.137257,邏:-10.846798,猎:-9.972471,徑:-8.118458,谜:-12.330536,梟:-12.915641,弦:-10.353476,太:-8.179232,搬:-12.175427,辱:-9.353774,爸:-9.414399,轆:-12.780605,痍:-14.243439,鵒:-16.641335,秕:-15.948188,塔:-8.791816,杖:-9.681461,慚:-12.098040,裟:-11.581909,埡:-11.766137,畢:-10.048975,審:-9.448777,葬:-9.207668,惯:-8.843017,蹰:-13.240137,櫳:-16.641335,瓷:-10.153651,鉸:-17.334482,绻:-14.444110,鱼:-7.516334,脅:-9.038434,悄:-9.807226,倏:-15.725044,娓:-13.527819,膚:-9.114617,讞:-15.255040,液:-8.466491,匹:-9.373460,崽:-14.198988,蛀:-14.849575,胄:-11.620749,汇:-9.054024,铌:-16.641335,灏:-13.044022,巒:-11.766137,拘:-12.572308,靡:-11.074900,酥:-13.327149,烤:-10.196409,仰:-9.206192,極:-7.720678,韶:-12.466947,勸:-11.052215,搂:-14.769533,鞋:-9.813705,栊:-16.641335,庑:-14.390043,斗:-7.848330,带:-7.258765,堪:-9.826792,攬:-10.816811,椴:-15.031897,喷:-11.996944,銹:-11.982624,情:-6.411750,绑:-11.511436,鱒:-14.501269,奔:-9.602113,晖:-9.889064,进:-6.538484,恚:-15.948188,囡:-13.160095,瑢:-17.334482,嫩:-9.870545,轰:-11.520351,噶:-14.076385,翻:-9.589046,者:-5.592319,國:-4.505006,肚:-9.563415,語:-7.148714,瘡:-11.306203,垠:-12.759771,钢:-9.355828,冤:-11.485157,麦:-8.897198,脯:-11.158615,锷:-11.566161,刹:-10.585722,鼻:-10.952666,為:-5.039277,尽:-8.898716,蟀:-11.918382,浇:-14.501269,仆:-9.977564,诈:-10.636214,闌:-14.936587,峒:-12.011472,艙:-9.852363,佛:-8.742738,陡:-17.334482,卣:-16.235870,遥:-10.308055,摭:-16.235870,零:-10.994123,特:-7.494307,司:-6.189812,籽:-11.502599,愆:-14.289959,颋:-15.137257,冑:-11.620749,钓:-12.634002,垕:-17.334482,檗:-13.750963,谘:-15.542722,悛:-14.936587,会:-4.810319,舜:-11.654309,圪:-17.334482,训:-8.245406,昴:-16.235870,簸:-11.829150,傻:-12.530461,槁:-13.550292,腆:-12.103373,噔:-13.030417,諗:-16.641335,胛:-13.527819,蛟:-11.833224,敞:-11.520351,煦:-11.381239,滯:-10.375083,聰:-10.125882,奶:-8.827743,鱸:-14.501269,啾:-14.038645,輅:-13.645602,撈:-10.378889,堋:-16.641335,吓:-10.668798,視:-7.307981,洙:-13.364190,辚:-16.235870,挝:-11.678490,甩:-14.501269,咨:-15.725044,涮:-13.505841,騷:-11.074900,逻:-10.846798,阿:-11.107945,疾:-10.083137,扇:-9.683362,拜:-9.274890,屣:-15.725044,剧:-7.935755,镩:-15.725044,菲:-9.508438,杵:-13.071802,絹:-11.566161,闾:-13.085987,樂:-7.282445,怆:-12.680522,馋:-13.114974,昊:-10.802148,傑:-8.243601,間:-5.641412,嚕:-11.243172,业:-5.119018,茜:-11.152397,綣:-14.444110,倦:-10.595145,锨:-13.129789,侯:-9.547515,肱:-13.505841,朴:-10.024600,冻:-10.469634,滅:-8.556772,聆:-14.444110,孌:-15.031897,诗:-9.081254,摞:-12.661653,穢:-11.671521,哩:-14.849575,濯:-14.769533,腰:-9.928379,篷:-10.417767,幺:-11.728680,矿:-8.627164,踅:-14.936587,澄:-11.353068,式:-6.242999,逑:-15.255040,阕:-14.038645,袖:-9.128444,躚:-14.198988,蒞:-16.641335,骢:-12.337270,邦:-7.589990,險:-7.716945,輯:-7.229320,尹:-11.156538,纺:-9.609152,觀:-7.413498,迄:-16.641335,勒:-8.862077,淘:-13.933285,卧:-11.080653,痨:-14.390043,牽:-12.530461,链:-9.862550,肇:-13.645602,骋:-11.837314,妍:-10.658659,缎:-11.268374,梗:-12.344049,耜:-13.085987,纣:-15.031897,夢:-9.536780,唪:-17.334482,莱:-10.234455,戰:-6.685373,毁:-9.115695,淅:-14.289959,荆:-11.963844,蕊:-10.363752,种:-5.414839,塌:-10.790570,珑:-11.013714,剐:-12.652351,酒:-8.223078,痕:-10.100305,苛:-14.038645,浚:-10.971454,蓟:-14.626432,杞:-11.900760,寡:-11.407556,工:-6.653598,郧:-16.235870,櫫:-17.334482,番:-8.794158,衬:-11.773800,泯:-14.390043,艰:-12.749514,曳:-11.809029,磷:-12.071792,遼:-11.386447,瓿:-16.235870,謁:-12.337270,檀:-11.637388,七:-9.198842,贅:-12.124996,沄:-16.641335,蜉:-16.641335,暈:-10.301858,碌:-10.471724,小:-7.367973,亘:-11.699692,眩:-11.732363,嚨:-10.950975,澮:-17.334482,憲:-9.966142,頷:-17.334482,弹:-7.418671,綺:-13.291431,湃:-11.451160,賄:-10.859049,惜:-8.653131,章:-7.295284,幣:-7.822483,革:-7.166056,業:-5.119018,敵:-8.780957,鷺:-12.330536,较:-7.610540,劑:-8.234068,咕:-10.957755,掛:-9.331119,斟:-14.501269,羣:-15.137257,袭:-9.187773,花:-6.935353,缸:-11.028207,去:-6.190666,曉:-9.201482,遒:-16.641335,仙:-9.101776,晞:-16.235870,峥:-12.330536,釧:-13.670920,毫:-9.301148,瑪:-9.864828,柳:-9.975014,蕴:-11.541468,婶:-11.585089,痿:-12.530461,伃:-17.334482,谅:-9.856878,嬋:-12.169696,圓:-9.382571,疔:-17.334482,渙:-14.849575,思:-7.559623,宠:-11.198917,颢:-12.915641,銦:-14.769533,瘩:-10.942565,謫:-13.696896,贯:-8.947397,悲:-10.621526,诀:-10.684203,跄:-11.216385,蟈:-14.561893,筋:-9.939374,鏐:-17.334482,闔:-13.750963,濘:-12.130475,內:-6.657674,险:-7.716945,繹:-11.343017,災:-9.475069,凼:-16.235870,雾:-9.542546,漂:-12.671043,鲋:-14.849575,骏:-10.343305,礎:-7.483868,喑:-15.031897,邓:-12.021276,厕:-12.770134,抟:-14.156428,碣:-13.114974,弢:-15.948188,匪:-10.522137,辭:-9.309947,測:-8.085979,戴:-10.101749,康:-7.950272,咻:-14.289959,势:-6.887973,轂:-14.849575,毅:-9.395680,應:-6.828784,荊:-11.963844,幌:-14.849575,呐:-12.192818,青:-8.105909,剔:-11.685508,苟:-12.385722,巡:-11.381239,飣:-16.641335,罢:-10.261212,寥:-11.797148,畦:-14.156428,泫:-15.542722,獪:-12.823622,蹬:-12.643134,想:-6.602333,绷:-14.501269,顸:-14.626432,孺:-11.550657,謅:-13.144827,檄:-17.334482,脉:-8.519557,尋:-15.255040,續:-6.955444,锑:-15.542722,璐:-10.239418,錕:-11.927310,朝:-7.418473,紡:-9.609152,储:-10.043507,榮:-7.914367,耳:-9.379759,鸷:-14.156428,夹:-12.001763,鈿:-12.880135,熾:-12.036165,賀:-10.062084,桃:-8.765266,諄:-13.345498,铐:-11.913947,埒:-16.641335,棘:-11.801092,曜:-12.216488,鵡:-12.108735,糠:-12.739362,酩:-15.137257,烨:-11.496751,潭:-10.004077,们:-4.816523,蟲:-8.542844,睽:-12.615983,覃:-13.044022,戊:-14.243439,澗:-11.547585,褘:-17.334482,斛:-14.038645,蜜:-10.424729,瞧:-9.640089,否:-7.883866,刪:-13.723564,漬:-11.892064,德:-7.168284,喻:-10.442856,隽:-12.474670,眼:-7.486190,县:-6.820468,況:-6.634298,葆:-13.223608,绍:-8.148024,彌:-11.714081,顎:-12.563797,協:-8.376328,菟:-13.900495,峡:-8.541932,韧:-11.448378,淫:-11.127906,转:-8.277876,毯:-10.423731,蕰:-15.137257,靼:-11.473696,谁:-14.243439,殄:-16.641335,羌:-12.216488,鈕:-12.222494,誚:-14.002277,簡:-10.719756,嶠:-12.152698,室:-7.487247,钦:-10.002767,贫:-10.162825,中:-5.476939,锻:-14.198988,窺:-13.016994,评:-8.702889,筏:-11.440079,闐:-11.829150,佗:-12.699753,衙:-12.210518,柜:-10.325977,締:-11.538424,驥:-11.862211,篤:-11.982624,適:-9.001692,鳶:-15.137257,白:-7.282402,郾:-15.948188,颏:-14.115606,銓:-12.147096,冕:-11.046623,記:-7.446768,萜:-14.444110,悟:-9.513641,鸠:-12.444133,崢:-12.330536,頤:-13.160095,璧:-12.175427,享:-9.047709,優:-9.863688,昰:-17.334482,岷:-12.903665,琼:-9.646485,濁:-11.245437,赂:-10.794896,揉:-14.289959,腊:-9.104971,魎:-14.038645,镒:-14.769533,燕:-8.548637,蛛:-11.514399,楚:-7.711436,捞:-10.378889,忡:-11.747233,絢:-13.750963,姥:-11.024564,铧:-13.223608,睦:-11.900760,叩:-14.695425,豬:-9.893748,拳:-9.332457,驸:-15.137257,鑼:-11.389061,茉:-14.626432,霑:-15.137257,炔:-12.414501,辖:-8.981220,攝:-10.122187,莞:-11.692575,缡:-17.334482,庠:-14.695425,猩:-12.181190,动:-5.486728,醪:-15.948188,殮:-12.371637,羶:-14.038645,阻:-9.672955,禺:-10.794896,軀:-10.636214,摇:-9.958600,苈:-17.334482,鳌:-12.135985,硏:-17.334482,嗒:-12.634002,齡:-8.428631,饥:-12.098040,诮:-14.002277,東:-6.589664,筹:-10.332326,哼:-11.459551,薇:-10.174413,昆:-10.189286,龋:-14.561893,馏:-11.412903,税:-8.684683,世:-7.652826,鼠:-9.880920,錨:-12.337270,倪:-11.769962,蚱:-13.016994,愴:-12.680522,嶷:-13.620910,拉:-8.071454,聊:-10.528759,嵌:-11.330595,监:-8.582059,坐:-9.449529,兔:-11.335545,湖:-7.180819,臟:-9.250228,廡:-14.390043,濫:-10.947603,腴:-12.927763,并:-8.864800,澀:-10.818289,蠅:-11.044766,榄:-11.909532,舉:-7.176430,授:-8.195960,弋:-12.690091,鰍:-11.448378,夏:-8.517332,阑:-14.936587,熔:-13.256944,標:-7.481025,徠:-12.791187,鲢:-15.255040,砥:-15.255040,妤:-13.309130,厨:-11.282393,邪:-10.325977,撲:-10.809452,纶:-11.247707,確:-7.516226,规:-7.808601,哒:-13.100375,釔:-17.334482,翠:-9.902590,季:-8.268705,顥:-12.915641,秤:-12.791187,啧:-12.634002,諮:-15.725044,穹:-12.739362,寸:-9.441656,骇:-11.728680,肋:-13.484334,貓:-10.303624,欒:-15.948188,鐘:-7.961003,碛:-12.709509,谨:-10.235280,伪:-10.596329,爬:-11.493840,砰:-14.338750,岳:-9.072697,薹:-13.670920,讽:-11.039216,亿:-10.769217,燁:-11.496751,屈:-9.748186,齊:-8.445036,揍:-13.779134,蕎:-15.948188,濕:-9.958600,乔:-10.287835,煖:-15.255040,飛:-8.076876,寝:-11.789304,絞:-14.115606,蓣:-14.076385,换:-8.069180,諧:-9.818593,楦:-14.444110,烫:-11.829150,鉬:-14.338750,盯:-14.936587,啮:-13.750963,顰:-14.002277,葸:-14.444110,滿:-7.946916,炀:-13.696896,吃:-8.773080,的:-6.412328,娇:-10.334147,鴉:-11.238657,輕:-8.005470,甙:-16.641335,莢:-13.129789,覦:-12.222494,洩:-10.340549,疮:-11.306203,失:-7.893427,張:-7.207011,舷:-12.291057,憶:-9.184303,蠻:-10.128847,参:-9.781720,雄:-7.998038,姆:-9.231290,恋:-9.765070,苌:-12.459285,晏:-12.181190,瓘:-16.641335,幟:-9.853490,惠:-8.853953,蝥:-16.641335,注:-8.358093,獭:-12.451680,问:-7.572212,声:-6.364372,罵:-9.778577,閃:-10.180648,嚅:-12.181190,縊:-12.310601,井:-9.116234,锘:-17.334482,禛:-17.334482,质:-6.606665,个:-4.601848,猬:-12.378655,缴:-11.192445,攸:-14.769533,便:-7.750580,烁:-10.584551,兀:-11.927310,盅:-12.482452,顆:-9.193292,鹊:-11.650902,拍:-10.296576,詒:-13.808121,滕:-13.030417,佔:-9.251771,鏗:-13.779134,哙:-14.038645,駛:-9.887897,诧:-11.689035,桦:-11.017317,鍬:-12.965034,矯:-13.837974,饰:-8.825523,送:-8.489569,阅:-9.970568,瞄:-15.137257,舍:-9.131452,掌:-8.602661,踕:-17.334482,喘:-10.921023,宜:-8.324912,鲞:-16.235870,怡:-9.846748,春:-8.243939,躪:-11.284748,刭:-17.334482,報:-7.029571,悶:-9.803466,褻:-13.463281,輿:-13.071802,沾:-13.550292,釀:-11.076814,筇:-17.334482,態:-7.126455,廊:-9.466610,菌:-8.971839,杏:-10.590423,觐:-12.297529,浓:-12.474670,返:-10.071152,南:-6.560454,痘:-12.834672,淨:-9.054785,召:-9.526565,铮:-10.813861,胶:-9.631926,摹:-12.278236,賾:-13.967186,颇:-12.092735,笆:-11.927310,徉:-13.291431,芋:-10.483297,紊:-12.350875,椒:-9.424992,化:-5.705223,頜:-11.465185,粟:-11.692575,萤:-14.038645,梧:-11.607634,劫:-10.179867,咯:-11.909532,覽:-8.625017,格:-6.819600,剀:-13.100375,病:-7.482182,懍:-16.235870,蝎:-12.880135,郗:-16.641335,埙:-11.762328,姝:-12.780605,鳟:-14.501269,慢:-8.380196,武:-7.992236,俩:-9.839496,浪:-9.251771,瓯:-12.589550,驰:-9.943067,绳:-10.099583,櫻:-12.291057,錁:-16.235870,犀:-12.791187,锅:-9.439418,堇:-15.137257,纈:-13.723564,悌:-13.750963,檐:-10.100305,专:-9.889064,沔:-15.255040,鎖:-9.257967,眙:-13.114974,墜:-11.607634,挡:-9.867111,讦:-13.309130,亨:-10.935887,鸳:-15.031897,耷:-14.002277,铄:-13.240137,密:-7.829236,手:-6.280660,背:-9.300499,静:-7.896926,盘:-8.113301,荡:-8.835453,轩:-9.290819,滨:-9.622933,筱:-13.837974,絵:-14.156428,峴:-15.388572,藺:-13.933285,稆:-15.255040,薏:-14.849575,明:-6.062839,输:-8.353555,枣:-10.719756,榧:-14.338750,鲵:-11.566161,區:-5.360341,遂:-10.697224,瓅:-17.334482,啄:-14.936587,绉:-13.309130,彈:-7.418671,虎:-8.823106,法:-5.709532,釗:-9.922322,牖:-14.501269,鯛:-15.388572,瑚:-10.657398,繞:-9.114617,恢:-12.977773,汪:-11.566161,酬:-9.571036,翳:-14.002277,懷:-8.939456,蝸:-13.645602,乾:-10.365632,玀:-14.390043,圃:-11.559930,备:-6.493079,羈:-12.357748,耍:-11.275359,谕:-10.773451,涔:-14.198988,銖:-12.759771,戡:-15.255040,肢:-9.868827,誦:-10.436777,温:-8.242925,侨:-9.927771,錫:-10.189286,貪:-13.933285,倭:-13.291431,锯:-12.791187,皮:-8.277526,娱:-11.640750,贿:-10.859049,僂:-12.459285,敏:-8.161636,兗:-17.334482,孛:-15.542722,灭:-8.556772,寰:-11.426399,飲:-10.562546,巴:-8.292915,軾:-11.728680,邃:-11.825094,厅:-8.266166,麇:-16.235870,紆:-15.948188,蒋:-11.821053,芏:-17.334482,愎:-14.038645,窟:-10.190864,患:-9.794392,溧:-16.641335,鞭:-10.666254,墳:-11.505536,辽:-11.386447,呀:-10.868337,靂:-11.348030,珅:-16.235870,剄:-17.334482,秉:-11.280043,腎:-11.963844,淑:-12.016362,毕:-10.048975,忝:-15.948188,神:-7.386356,浦:-9.933251,歪:-12.304044,狯:-12.823622,兮:-12.259308,驴:-11.496751,泻:-10.806524,蹼:-14.769533,锁:-9.257967,璀:-17.334482,餉:-11.284748,蜍:-12.135985,暌:-17.334482,沐:-13.129789,檔:-9.843953,焙:-13.670920,傘:-10.884011,缝:-9.928986,府:-6.139753,螢:-14.038645,挥:-7.758804,鐫:-17.334482,讪:-12.634002,圭:-10.554560,羲:-9.840608,伽:-12.124996,铀:-13.191347,灃:-13.900495,埂:-13.207348,繇:-13.044022,桓:-10.561402,烘:-12.271887,络:-8.037780,擠:-10.409870,荥:-15.137257,統:-6.571888,峰:-7.490055,筵:-13.085987,藶:-17.334482,墉:-14.002277,覓:-11.353068,吖:-17.334482,刚:-7.975635,堞:-13.967186,澧:-13.967186,眬:-13.442662,細:-8.217134,陂:-10.137795,奈:-9.207668,驊:-11.240912,廝:-11.188153,臣:-7.820192,痫:-12.323847,干:-7.817098,魴:-13.402656,腸:-9.141358,添:-9.871119,轼:-11.728680,玄:-10.361876,弇:-17.334482,谑:-12.801882,訕:-12.634002,搡:-13.057816,栩:-13.670920,說:-6.311012,嘭:-17.334482,錯:-8.289724,炮:-8.439126,就:-8.235632,纲:-9.532682,贻:-15.137257,丽:-7.705365,囂:-11.177503,捏:-11.973190,楓:-10.619099,块:-7.639126,遙:-10.308055,孟:-10.879283,葡:-17.334482,无:-8.639143,衩:-13.837974,槨:-11.133973,癭:-13.837974,巰:-17.334482,恹:-14.156428,裾:-14.338750,銃:-12.407228,内:-6.657674,鲇:-14.156428,缆:-10.628843,安:-6.920929,蚋:-17.334482,侑:-14.243439,誓:-10.481183,洒:-10.617887,圖:-7.540698,碟:-11.762328,沧:-13.175599,伦:-8.924874,閭:-13.085987,琬:-13.044022,傯:-13.527819,媳:-11.214184,破:-8.156768,莹:-9.670605,镂:-14.289959,築:-7.545452,濑:-14.002277,乐:-7.282445,叙:-11.714081,黛:-12.823622,煚:-17.334482,川:-8.016633,食:-7.752785,苣:-13.620910,敢:-7.664125,烯:-10.356268,卮:-16.641335,鹰:-9.427566,擷:-14.390043,霁:-14.076385,刃:-9.497322,將:-7.701688,窈:-15.137257,源:-6.786171,梔:-17.334482,醚:-10.987093,辦:-7.760332,親:-7.359744,玮:-10.884011,弱:-8.477251,網:-7.965771,架:-7.836409,雀:-10.236933,忆:-9.184303,晋:-8.975347,姊:-11.870650,裔:-10.304509,呗:-15.255040,幛:-14.626432,鵝:-10.611852,糜:-13.256944,曠:-11.462364,腥:-10.546637,櫨:-15.388572,鷲:-12.845846,蟶:-14.626432,课:-9.187194,傅:-9.318494,螋:-17.334482,膏:-10.090969,戎:-11.829150,云:-7.876188,讓:-8.451119,疗:-7.899000,嘖:-12.634002,錘:-10.833192,倚:-11.931805,掣:-13.129789,涧:-11.547585,並:-8.864800,謨:-11.383839,垫:-11.282393,钭:-17.334482,甬:-14.561893,冯:-12.284626,缰:-13.967186,害:-7.426106,礴:-12.344049,芹:-10.492866,貽:-15.137257,洼:-11.412903,址:-7.862470,兄:-8.490290,鹆:-16.641335,操:-9.048716,滑:-9.775965,佐:-10.348840,棕:-12.350875,癖:-13.463281,務:-6.190897,駟:-14.849575,湦:-17.334482,矫:-13.837974,剮:-12.652351,饴:-14.156428,旷:-11.462364,槿:-14.038645,阁:-8.587925,逅:-12.671043,熄:-13.463281,崇:-10.604658,萍:-8.339937,斌:-8.563112,澐:-16.641335,蠕:-13.933285,榔:-12.204583,厘:-12.546990,骞:-12.026214,急:-8.315302,吭:-11.797148,粲:-16.235870,堵:-11.363220,蔷:-13.723564,輻:-15.725044,运:-7.652078,柠:-14.444110,詩:-9.081254,瑭:-12.952455,嗬:-17.334482,鋮:-10.810920,批:-7.940072,胺:-10.325977,汽:-10.800693,諾:-8.815890,妁:-14.038645,待:-7.816804,喉:-10.619099,袋:-8.683108,躏:-11.284748,洎:-15.725044,窗:-9.875143,外:-6.115082,沣:-13.900495,萨:-9.081515,鮭:-15.388572,咳:-11.747233,瘴:-15.725044,永:-9.747678,莽:-10.560258,私:-9.352407,魂:-9.103372,翅:-11.084507,幄:-12.749514,酆:-17.334482,呈:-11.482279,母:-7.666527,懑:-12.459285,荒:-9.701112,祖:-8.590153,罚:-9.025297,賣:-8.648559,止:-7.316506,杪:-16.641335,马:-7.173140,绯:-17.334482,豸:-13.933285,惻:-13.779134,佺:-17.334482,替:-8.960697,切:-7.147245,锉:-16.641335,璈:-17.334482,脑:-8.249025,蜕:-13.808121,首:-6.734976,紙:-8.557081,岘:-15.388572,龚:-15.137257,猝:-13.364190,订:-8.521490,交:-7.934762,膦:-15.388572,鸯:-10.670073,鐳:-14.444110,玲:-8.513340,耻:-10.071853,蘿:-11.511436,籃:-9.901998,寂:-10.456155,黄:-9.121642,片:-6.965595,准:-7.114798,铈:-17.334482,棠:-10.690692,滤:-11.234163,围:-7.308777,瀆:-12.103373,見:-6.240821,辏:-14.501269,戒:-9.330785,算:-7.220693,帚:-11.725010,吞:-11.330595,涣:-14.849575,控:-9.096738,妫:-13.900495,第:-9.530231,邱:-13.573282,焰:-9.872842,喳:-12.304044,芽:-10.277445,磁:-10.430735,绅:-10.584551,豎:-12.066624,惑:-9.368589,鯗:-16.235870,硖:-16.235870,峙:-11.044766,繚:-13.327149,勝:-7.899879,瑞:-9.001452,以:-5.595657,酰:-12.506168,割:-9.681936,靴:-11.927310,荼:-12.572308,柿:-12.071792,頁:-8.051077,禀:-12.538691,崃:-14.198988,伏:-9.047205,憐:-9.579143,颖:-9.790150,钞:-11.624055,校:-6.788036,渥:-14.936587,蚪:-11.563041,粮:-9.702565,嘵:-14.936587,溺:-12.671043,撾:-11.678490,嫂:-10.051034,闈:-13.100375,囊:-9.671544,诌:-13.144827,字:-7.286807,緘:-15.725044,坟:-11.505536,衡:-8.464662,槠:-14.626432,濤:-8.740143,葩:-13.573282,旨:-8.995459,寬:-9.871693,凰:-10.054474,汹:-11.837314,宁:-7.931375,邇:-11.420979,蚓:-11.325669,碗:-9.296939,璟:-14.002277,谤:-12.246886,馭:-11.785406,爰:-14.561893,嚳:-13.779134,琴:-8.502770,边:-6.726759,游:-7.161082,膽:-9.326116,怼:-14.338750,篁:-14.769533,槍:-8.455567,轎:-12.323847,策:-7.298126,忙:-8.215818,凝:-11.442838,铟:-14.769533,睞:-10.780549,胧:-10.807987,顬:-14.561893,糯:-15.725044,窀:-15.255040,布:-6.571782,霉:-10.653627,缙:-11.594689,鶚:-12.271887,次:-5.878804,津:-8.500436,騫:-12.026214,薪:-9.559206,夭:-12.719361,匱:-17.334482,阳:-6.625881,舻:-15.137257,繃:-14.501269,鳄:-13.256944,橋:-7.323756,俎:-14.444110,晓:-9.201482,塗:-9.643282,绘:-9.248379,剛:-7.975635,祭:-11.280043,壬:-16.641335,勰:-13.240137,蟾:-12.690091,砂:-10.126622,醇:-9.851800,爆:-10.636214,渎:-12.103373,怒:-8.680837,玛:-9.864828,尚:-8.417439,疟:-14.198988,謠:-10.985343,贤:-9.108443,憧:-15.725044,宫:-7.729400,礬:-12.903665,钵:-12.671043,漸:-7.921364,肽:-12.868574,孀:-13.442662,糅:-14.390043,棍:-10.353476,聒:-15.137257,廙:-17.334482,桢:-10.015942,臧:-15.137257,饬:-12.506168,緯:-9.647861,鍰:-15.542722,石:-7.016900,偲:-17.334482,轸:-13.808121,騁:-11.837314,简:-10.719756,弃:-8.666974,蠍:-12.880135,瀝:-13.240137,农:-8.987128,模:-7.627679,袢:-15.948188,芦:-10.311614,纮:-17.334482,吵:-10.952666,丹:-8.376456,暾:-14.849575,觌:-16.235870,浏:-14.501269,从:-7.896608,杓:-14.626432,套:-8.348035,翘:-12.436642,燜:-11.758533,啟:-9.583007,詡:-12.506168,佣:-10.748310,淤:-13.620910,姬:-10.992360,台:-7.184017,諶:-14.444110,俸:-13.256944,賺:-13.723564,恽:-14.769533,蛾:-12.092735,嶁:-16.641335,颃:-14.561893,宅:-9.707912,冉:-11.183879,猊:-13.160095,侍:-10.190864,椎:-11.313459,肓:-13.422459,崖:-10.170535,領:-7.304009,阜:-12.337270,犟:-13.484334,谠:-16.641335,岫:-14.444110,媯:-13.900495,閱:-9.970568,琰:-12.011472,傳:-7.795557,鎵:-13.160095,核:-8.773655,昼:-11.640750,局:-7.082135,燉:-11.055960,偈:-16.235870,乌:-10.981853,铛:-13.114974,鋟:-15.031897,煞:-12.259308,潢:-12.291057,敦:-9.391764,鹬:-17.334482,端:-7.928657,奮:-9.052758,鑰:-12.749514,鉴:-9.933861,擻:-12.466947,虼:-16.235870,拿:-10.033334,堃:-15.031897,窄:-10.269723,鄉:-7.811450,蔑:-11.140077,撐:-9.951114,礙:-9.028998,薦:-8.920208,莪:-15.725044,弭:-13.291431,禮:-8.209155,唱:-9.512438,殺:-8.440635,憾:-10.019264,癇:-12.323847,嗆:-13.527819,及:-6.554859,軌:-10.168988,苔:-11.813021,幗:-13.044022,呛:-13.527819,盜:-9.629670,赡:-15.948188,泠:-14.198988,腩:-15.388572,惨:-10.694606,廬:-10.942565,獵:-9.972471,楹:-11.747233,诺:-8.815890,臾:-11.927310,岁:-7.986033,理:-5.699374,趋:-10.347915,亍:-16.641335,栎:-12.429207,尖:-9.516052,餘:-7.958712,霜:-10.496077,玟:-14.338750,倞:-15.255040,缬:-13.723564,钱:-8.197573,田:-8.192313,决:-7.220288,猴:-10.617887,鹂:-13.327149,竅:-11.214184,先:-7.320169,壙:-15.137257,鏟:-11.825094,解:-7.021537,齬:-13.596812,镰:-13.900495,噲:-14.038645,旻:-14.561893,圇:-12.915641,选:-7.816363,澌:-17.334482,斐:-9.303747,妘:-15.137257,骚:-11.074900,怩:-12.739362,芪:-12.563797,席:-7.030508,吱:-12.709509,蔻:-13.345498,廂:-10.438799,睇:-16.641335,测:-8.085979,菔:-15.948188,秘:-9.178259,陝:-11.532364,矜:-13.550292,象:-6.975787,聩:-13.345498,懨:-14.156428,繭:-11.992148,瑱:-17.334482,雲:-14.444110,牵:-12.530461,諺:-12.903665,征:-7.628044,紂:-15.031897,钇:-17.334482,眆:-17.334482,厉:-9.586453,焊:-12.903665,攒:-12.429207,粗:-11.750986,皛:-17.334482,多:-6.323852,檣:-14.076385,舨:-14.156428,庫:-8.082616,劳:-8.962083,讹:-14.076385,樸:-10.024600,翁:-10.054474,幀:-12.690091,鵂:-17.334482,塄:-17.334482,珉:-12.940033,酊:-15.388572,譎:-13.191347,柑:-14.038645,鳗:-13.327149,雛:-12.615983,祚:-11.144167,嗝:-13.044022,信:-7.107137,绫:-12.421827,磯:-10.656140,孮:-17.334482,陰:-10.170535,狳:-14.849575,佶:-12.834672,娃:-9.532273,餅:-10.024600,下:-5.739645,贍:-15.948188,沌:-11.692575,暐:-15.137257,悔:-9.727597,笙:-11.547585,崭:-14.501269,疲:-13.144827,谷:-8.315908,澶:-16.235870,耿:-11.714081,飄:-11.194597,鋈:-17.334482,凊:-17.334482,蛐:-13.442662,打:-8.524619,镝:-13.967186,瓜:-9.568913,轡:-13.645602,拨:-10.677755,困:-9.252698,闲:-9.650618,歹:-10.644883,鮃:-15.542722,墅:-10.995888,劉:-11.330595,辋:-14.936587,規:-7.808601,莓:-12.459285,帖:-10.503608,锜:-17.334482,熟:-8.698262,斧:-11.243172,茨:-10.350692,鲭:-17.334482,隱:-9.658008,邵:-14.198988,誹:-14.501269,蒽:-16.235870,绁:-15.725044,磅:-12.350875,奄:-13.364190,陆:-7.806634,午:-8.104241,遊:-7.161082,葒:-14.501269,惕:-10.485416,鷗:-11.887745,哝:-11.762328,诣:-10.871452,晦:-11.736060,恪:-12.643134,鵬:-8.595746,积:-6.979123,混:-11.289477,懿:-11.140077,項:-7.462124,禄:-9.848990,唇:-9.863688,鈉:-10.460283,谍:-11.024564,涌:-10.021928,蘑:-13.808121,析:-7.867641,耕:-10.879283,官:-7.367503,颚:-12.563797,喜:-8.422682,渡:-8.835045,侠:-9.100713,貢:-10.706441,戩:-13.345498,肪:-10.160524,窮:-9.595994,嘱:-10.599890,錳:-13.422459,贷:-9.768171,溶:-11.190296,鏈:-9.862550,潋:-16.641335,跌:-10.186923,坛:-8.472140,濠:-12.291057,补:-9.175107,癱:-12.222494,铲:-11.825094,灵:-8.384598,橹:-15.031897,苾:-15.137257,茂:-9.879183,輊:-14.769533,帔:-13.696896,袛:-17.334482,瘤:-9.333127,骧:-12.977773,般:-6.885275,疹:-10.968011,鐸:-11.523341,场:-5.786865,囏:-17.334482,筒:-9.828440,拗:-11.675000,滟:-14.444110,赞:-9.494169,瓣:-10.857510,噤:-12.770134,饦:-17.334482,齪:-12.834672,扬:-8.426599,愁:-9.430516,颐:-13.160095,缕:-10.907993,枚:-9.347297,謝:-8.582691,涞:-15.948188,吣:-15.542722,玢:-15.725044,禦:-8.971373,是:-5.039044,薮:-14.561893,氳:-13.191347,讲:-9.582147,爷:-7.697437,咸:-12.490295,砻:-15.388572,媼:-14.695425,曄:-11.620749,運:-7.652078,契:-10.857510,磐:-12.204583,录:-7.975204,绔:-14.561893,教:-7.109563,諜:-11.024564,叢:-9.622485,姦:-9.687173,忪:-13.463281,荭:-14.501269,广:-8.508041,斃:-10.924307,舂:-16.235870,殇:-14.338750,蠆:-16.235870,經:-6.117782,攘:-12.098040,辟:-9.388926,閣:-8.587925,岩:-8.179337,茬:-11.959204,鬼:-9.436442,尾:-9.205602,胁:-9.038434,框:-11.057838,湊:-11.373477,埏:-16.641335,聖:-9.294035,槛:-10.727832,虚:-9.439046,濟:-6.345974,痣:-12.952455,坤:-9.838385,跳:-10.270578,畸:-13.527819,态:-7.126455,膀:-9.768171,螄:-14.115606,爍:-10.584551,咎:-11.817029,馐:-13.645602,媒:-10.257828,龔:-15.137257,悖:-12.624952,訝:-10.246908,伟:-8.186230,唣:-13.967186,犢:-12.903665,鰩:-15.725044,愫:-13.274039,纪:-7.002855,术:-6.137048,洳:-15.725044,課:-9.187194,猷:-11.747233,蕃:-10.796342,柄:-10.738701,酋:-12.169696,前:-5.984840,塑:-10.143806,幕:-8.960928,翔:-9.535549,勢:-6.887973,廪:-13.383238,卷:-8.495640,鑹:-15.725044,糾:-13.696896,脂:-9.724620,丈:-9.023821,贊:-9.494169,倌:-13.129789,霎:-13.309130,纓:-11.825094,餒:-12.304044,尔:-7.147622,琤:-16.641335,涵:-9.737587,禽:-10.318769,菁:-11.175387,歆:-11.211989,勋:-9.790679,浊:-11.245437,重:-6.691011,哏:-15.542722,廓:-10.906377,櫛:-15.948188,監:-8.582059,酢:-14.501269,呤:-13.016994,磧:-12.709509,苫:-16.235870,恬:-12.538691,蓯:-15.542722,汴:-14.695425,培:-9.476228,癸:-15.388572,髻:-12.414501,硼:-13.723564,持:-6.638749,漉:-12.158332,笑:-7.423026,骐:-13.645602,妒:-11.323215,掖:-11.982624,錡:-17.334482,锥:-11.905136,覲:-12.297529,稻:-9.948011,簿:-12.228536,免:-7.607254,楝:-14.444110,補:-9.175107,俞:-13.422459,略:-7.457852,實:-6.510512,罩:-9.934472,黨:-6.923484,腭:-13.967186,乳:-10.701163,赵:-10.971454,偷:-10.387506,痺:-11.526339,饽:-13.057816,屿:-9.868827,翾:-14.390043,榇:-15.031897,王:-7.061226,谊:-9.556689,疏:-10.172084,阎:-15.542722,頒:-14.501269,崔:-15.388572,趟:-10.246073,务:-6.190897,缨:-11.825094,贴:-9.479325,制:-6.090364,霸:-10.154412,苁:-15.542722,恂:-13.175599,友:-7.509929,汊:-13.463281,硒:-16.235870,鳕:-15.388572,毛:-8.857070,葚:-14.695425,占:-9.251771,矣:-12.066624,遢:-13.100375,啤:-15.255040,秧:-12.845846,菫:-15.255040,浴:-10.694606,釷:-17.334482,壽:-9.496928,搅:-12.444133,薄:-9.793860,辈:-8.741810,醌:-11.569291,嚎:-12.615983,墒:-14.561893,抖:-9.956723,圣:-9.294035,大:-5.467722,窦:-12.210518,挫:-11.634038,粪:-12.407228,支:-8.123242,漳:-11.578740,垸:-11.754752,钺:-12.690091,揀:-13.256944,义:-6.057912,鍋:-9.439418,展:-5.978947,晙:-17.334482,仞:-10.976640,牡:-15.137257,嫦:-13.071802,繩:-10.099583,峪:-12.234615,話:-6.542753,佳:-8.510540,棲:-10.781974,具:-7.774824,顽:-12.977773,绾:-14.198988,蜂:-10.265458,璋:-9.387864,謊:-10.909613,碓:-15.388572,依:-9.435700,那:-9.748693,厥:-10.265458,妩:-15.137257,枭:-12.915641,伲:-17.334482,段:-7.059914,訴:-7.629384,熹:-11.175387,逸:-10.304509,区:-5.360341,羽:-9.398179,夾:-12.001763,杂:-8.343791,仇:-9.503262,浆:-9.828440,觉:-7.459754,煎:-12.699753,壓:-8.096818,蕖:-16.641335,泛:-8.280094,荚:-13.129789,乜:-16.641335,櫟:-12.429207,襞:-14.769533,面:-5.504427,继:-9.253625,苯:-10.914487,汰:-10.286965,裳:-10.738701,雷:-8.599600,凹:-12.330536,灸:-11.448378,忽:-10.361876,繼:-9.253625,徒:-8.811903,輝:-8.274964,锡:-10.189286,帧:-12.690091,栳:-15.255040,農:-8.987128,稿:-9.664520,聃:-15.725044,蹇:-15.542722,坍:-15.388572,孕:-10.083137,铠:-14.390043,鋤:-15.255040,左:-11.303797,飨:-15.031897,珺:-13.900495,婿:-10.608249,澇:-11.054086,谆:-13.345498,訊:-8.951049,墩:-10.116305,沱:-12.868574,贰:-15.137257,串:-10.004077,吶:-12.192818,点:-5.991538,刺:-9.275522,纽:-9.913903,蓁:-14.390043,時:-5.475763,雍:-11.762328,姓:-8.214395,繒:-17.334482,葖:-14.076385,作:-5.616227,院:-5.740059,卤:-14.198988,驪:-13.900495,華:-6.819980,價:-7.511933,煸:-17.334482,搁:-10.980112,栉:-15.948188,覈:-17.334482,瘍:-11.280043,耙:-13.967186,抚:-9.427935,踝:-12.124996,弧:-11.541468,窪:-11.412903,振:-9.531455,躲:-13.071802,眷:-10.825713,揄:-13.274039,屑:-10.472771,婕:-10.848321,恙:-11.585089,臘:-9.104971,远:-7.514485,团:-6.886521,鏤:-14.289959,峦:-11.766137,惮:-10.780549,滲:-12.041177,坷:-11.987374,瓶:-9.700628,鹽:-9.363051,皋:-10.379843,同:-6.210415,帐:-10.575227,蒗:-14.849575,战:-6.685373,瘠:-12.414501,冥:-12.246886,断:-6.983940,萬:-7.655326,鈸:-13.723564,綽:-12.061482,诉:-7.629384,楊:-9.511637,像:-7.721547,獎:-8.498253,駕:-9.913903,棟:-9.793329,譞:-14.501269,噠:-13.100375,糧:-9.702565,齦:-12.607094,婨:-17.334482,饪:-11.194597,俱:-13.967186,諳:-12.246886,叹:-9.230988,巽:-14.289959,籼:-17.334482,飿:-17.334482,蚀:-9.570186,來:-4.916780,钌:-14.561893,颔:-17.334482,丛:-9.622485,憚:-10.780549,贝:-9.367548,殞:-15.137257,尧:-10.806524,鬩:-16.235870,禪:-10.433751,怯:-10.726481,趲:-17.334482,縻:-10.911235,醺:-13.175599,陋:-10.614262,遏:-11.624055,奕:-11.773800,磔:-15.725044,賜:-10.376985,睡:-9.990409,煥:-9.765586,蕭:-11.909532,揮:-7.758804,呷:-15.948188,矶:-10.656140,幻:-10.401059,篾:-13.596812,掃:-10.360939,涇:-13.620910,蠊:-14.936587,熏:-11.793218,箓:-13.620910,夔:-12.868574,辛:-10.095267,眠:-9.620251,鎣:-15.388572,傥:-13.071802,笨:-12.572308,播:-8.089643,蔬:-11.437328,溱:-17.334482,梵:-15.137257,嘶:-12.643134,犹:-13.345498,錸:-16.641335,债:-9.765586,諉:-12.652351,埋:-11.320767,铍:-14.936587,减:-9.581717,黑:-9.164296,寓:-10.837707,飕:-12.421827,旗:-8.373501,濛:-17.334482,聚:-9.499694,槟:-12.538691,詞:-8.365067,坠:-11.607634,珣:-14.849575,鹦:-17.334482,敬:-8.732029,潰:-10.193237,闷:-9.803466,獸:-9.505647,峽:-8.541932,駿:-10.343305,怅:-12.259308,了:-6.658736,龐:-11.434585,馔:-14.115606,暖:-9.480101,悚:-13.670920,阡:-16.641335,匣:-11.529347,崧:-14.390043,约:-7.353154,末:-8.493612,芮:-13.207348,貲:-16.235870,男:-10.730538,隶:-8.761476,邺:-12.152698,嶼:-9.868827,荃:-10.694606,菘:-14.936587,汝:-12.041177,穩:-9.793860,鯨:-11.335545,葭:-16.641335,啷:-12.498200,彻:-9.117853,沃:-9.958600,謂:-8.084632,脆:-9.839496,蜊:-14.444110,娌:-13.223608,纏:-10.469634,嘔:-12.940033,肛:-14.076385,琨:-12.451680,强:-7.044135,见:-6.240821,迅:-9.890818,藉:-11.610897,金:-7.098530,哓:-14.936587,獒:-15.031897,襖:-11.363220,周:-7.975722,恰:-10.340549,晴:-10.676471,叽:-12.607094,椁:-11.133973,蒈:-15.255040,验:-7.140753,邐:-12.615983,隔:-9.872842,餡:-13.144827,瞪:-13.967186,港:-7.863163,莲:-8.906557,稷:-9.326116,岸:-7.843484,劼:-15.542722,瘿:-13.837974,閾:-14.849575,检:-9.838940,滄:-13.175599,艇:-8.516444,鹏:-8.595746,兑:-11.254549,盔:-11.214184,浙:-11.289477,俚:-15.388572,寢:-11.789304,铨:-12.147096,淮:-10.268015,腱:-12.801882,婷:-9.010388,偻:-12.459285,訂:-8.521490,掇:-12.186987,耆:-11.675000,蘊:-11.541468,嬌:-10.334147,膛:-10.453071,螟:-13.505841,庥:-14.076385,鎧:-14.390043,用:-5.486471,謬:-11.203255,蜴:-12.474670,粹:-9.956098,吾:-10.983596,裁:-8.871323,恆:-9.945536,蓉:-8.312039,始:-6.662832,晊:-17.334482,忏:-15.542722,郑:-11.692575,嗓:-15.725044,牒:-10.925953,雕:-9.427566,毗:-15.255040,奠:-12.163998,緣:-8.705390,驢:-11.496751,彤:-10.949288,珧:-15.948188,觫:-15.725044,陪:-11.234163,慰:-9.331119,響:-6.976580,清:-7.457441,辄:-11.949987,薈:-12.834672,稍:-10.921023,瀑:-12.940033,醐:-14.390043,谙:-12.246886,撞:-9.820227,頡:-13.402656,鸥:-11.887745,嶸:-12.135985,钾:-11.434585,赃:-11.410226,久:-7.784674,荇:-16.641335,饋:-10.906377,篌:-13.808121,镓:-13.160095,菜:-8.186443,瑩:-9.670605,门:-5.556036,囪:-12.031177,詭:-15.388572,佯:-15.725044,泮:-15.725044,养:-7.583097,溃:-10.193237,褂:-11.566161,茆:-16.235870,鼎:-9.965512,皓:-11.892064,鄒:-14.038645,怜:-9.579143,审:-9.448777,稠:-12.246886,垩:-12.378655,榭:-12.624952,舰:-8.706463,羹:-11.569291,逼:-11.063493,圾:-10.274006,证:-7.366940,仃:-12.615983,楂:-12.624952,捆:-12.278236,鏑:-13.967186,囓:-13.750963,煒:-10.637448,闕:-11.407556,棗:-10.719756,乘:-10.034685,招:-8.477536,赚:-13.723564,绣:-10.652373,層:-7.258891,烧:-8.954713,器:-6.634321,諫:-10.689391,镪:-14.501269,扰:-9.030234,蛳:-14.115606,函:-11.156538,灼:-11.572431,铿:-13.779134,有:-5.011489,颌:-11.465185,冒:-10.387506,甕:-14.076385,殖:-8.375942,枞:-15.255040,氯:-11.423685,辮:-12.965034,砷:-14.289959,庸:-10.197999,爻:-13.808121,琿:-14.002277,泄:-10.340549,曈:-17.334482,卑:-10.199591,狐:-8.711129,啕:-12.546990,瓔:-15.031897,胜:-7.899879,另:-14.444110,雨:-8.393722,嗪:-12.791187,濮:-16.235870,懲:-10.218900,矾:-12.903665,舆:-13.071802,箋:-11.931805,萊:-10.234455,綏:-12.624952,匐:-12.364669,递:-9.652460,唔:-16.235870,亙:-11.699692,薟:-16.641335,笠:-12.216488,梭:-11.098112,抱:-9.852363,娶:-11.125892,纹:-9.545027,尺:-8.862914,炽:-12.036165,促:-9.561729,桂:-9.170826,賅:-13.016994,蛉:-14.243439,摊:-10.364691,換:-8.069180,豚:-10.152130,虞:-11.825094,燧:-13.345498,鉦:-15.948188,坨:-14.501269,诫:-11.192445,路:-6.189928,整:-7.658083,闿:-15.948188,樁:-10.742808,讀:-8.133687,氅:-14.156428,趄:-12.903665,昉:-15.948188,螈:-13.463281,砍:-11.559930,閔:-12.880135,沚:-17.334482,育:-6.620020,猻:-12.759771,冼:-17.334482,难:-7.497348,毀:-9.115695,淄:-12.506168,塍:-15.542722,剑:-8.066156,靓:-12.124996,呕:-12.940033,痔:-14.626432,还:-9.662655,恝:-17.334482,穡:-14.338750,壢:-14.769533,哪:-16.235870,艱:-12.749514,惲:-14.769533,葵:-11.220800,競:-12.498200,卻:-9.801323,遽:-13.527819,盾:-8.598957,暇:-10.060696,希:-9.741108,吐:-10.197999,炓:-17.334482,宥:-13.505841,隧:-15.388572,瀨:-14.002277,禹:-10.614262,頸:-10.220526,诅:-14.626432,臉:-8.382912,峋:-12.615983,祎:-12.749514,赖:-9.279324,譚:-12.278236,拟:-9.377655,屠:-12.965034,磣:-13.422459,盧:-10.646127,镦:-15.725044,鍪:-14.038645,俭:-10.837707,姹:-15.255040,發:-6.506458,洁:-8.785596,愉:-12.514200,甑:-16.641335,垒:-10.402034,褙:-16.235870,殚:-15.255040,鬥:-7.848330,嘧:-16.641335,氫:-11.183879,京:-6.538771,樯:-14.076385,縷:-10.907993,嚼:-11.473696,爿:-15.948188,绌:-12.834672,道:-5.298996,单:-7.874239,裘:-12.977773,絡:-8.037780,嗦:-11.115882,煩:-9.189222,部:-5.501177,只:-7.796710,剿:-10.475917,燾:-11.218590,舊:-8.720162,箏:-10.974908,頎:-15.031897,唐:-9.244693,薛:-12.977773,岡:-9.181708,素:-7.147772,抵:-10.770626,倾:-10.777704,賁:-12.977773,摆:-10.701163,巋:-17.334482,黍:-14.769533,硎:-16.641335,聞:-7.630971,秣:-13.345498,孤:-11.781522,全:-6.893332,跫:-16.235870,误:-8.151204,数:-6.364475,至:-7.205613,壹:-14.501269,祸:-10.015942,闻:-7.630971,国:-4.505006,亂:-7.951534,樅:-15.255040,膈:-14.076385,众:-7.005433,红:-7.744610,璦:-14.390043,洫:-14.444110,侬:-13.274039,画:-8.097110,猿:-11.566161,淀:-10.599890,蝇:-11.044766,懈:-10.725133,翌:-13.967186,魏:-9.649238,晝:-11.640750,廢:-10.559116,鯤:-13.175599,哦:-13.463281,灩:-14.444110,蹭:-12.634002,森:-8.863542,葱:-10.983596,曲:-8.088099,项:-7.462124,啻:-13.207348,竺:-10.992360,陽:-6.625881,卿:-9.409686,一:-6.044988,撇:-12.459285,脊:-10.177526,樘:-17.334482,搜:-16.641335,肟:-16.235870,御:-8.971373,妥:-10.643640,钧:-9.212111,厩:-13.191347,爨:-16.235870,谬:-11.203255,夺:-8.846512,疽:-12.378655,匾:-13.191347,迁:-9.282185,觅:-11.353068,杆:-9.380461,慊:-17.334482,釕:-14.561893,泗:-13.057816,惟:-11.266056,荞:-15.948188,竣:-13.383238,塤:-11.762328,軫:-13.808121,酪:-12.147096,晰:-9.861413,对:-6.797279,穸:-17.334482,電:-7.793831,嗽:-10.215656,漁:-12.098040,椅:-10.021262,袄:-11.363220,按:-11.601141,納:-8.218782,隐:-9.658008,焕:-9.765586,謙:-10.134057,娣:-10.806524,綢:-10.487539,吧:-10.233630,錩:-17.334482,议:-6.230262,戳:-13.240137,簷:-10.100305,媸:-17.334482,棄:-8.666974,鹋:-14.338750,顏:-10.082428,坑:-10.307167,盐:-9.363051,兕:-16.641335,歙:-15.948188,敝:-12.940033,罡:-12.228536,黠:-12.812693,巢:-10.478020,祥:-7.988126,噻:-16.235870,偿:-9.110050,現:-5.880108,殃:-12.407228,谂:-16.641335,文:-6.604979,蘆:-10.311614,福:-8.186975,騎:-10.106093,玓:-17.334482,儔:-14.849575,攜:-11.610897,缠:-10.469634,助:-7.385065,沭:-15.948188,贬:-13.327149,暱:-12.222494,悵:-12.259308,帶:-7.258765,璽:-10.593963,求:-6.644038,装:-7.544499,鳍:-10.125142,穎:-9.790150,懟:-14.338750,痧:-13.207348,迫:-8.535122,杰:-8.243601,韻:-10.050347,栅:-12.330536,簍:-12.181190,咒:-11.144167,瀕:-14.038645,準:-7.114798,萝:-11.511436,鸡:-9.304398,唧:-11.303797,漫:-9.697730,蒲:-12.271887,宸:-9.416217,颺:-15.031897,激:-8.841172,齋:-10.125882,屍:-9.680987,他:-7.163566,橙:-13.085987,诘:-13.933285,藜:-12.607094,繡:-10.652373,物:-5.952429,鏨:-15.542722,虱:-13.645602,擲:-11.017317,聵:-13.345498,绶:-12.624952,驹:-10.517746,坻:-14.626432,磺:-12.181190,鑽:-12.031177,倀:-13.900495,璃:-9.451790,專:-9.889064,沓:-12.031177,且:-6.922672,喙:-15.948188,宝:-7.481393,麟:-10.210004,怠:-11.736060,氨:-12.868574,玭:-17.334482,售:-8.054429,禱:-11.113892,頰:-10.475917,方:-5.702414,萸:-13.274039,釁:-11.328129,觑:-10.922664,狗:-9.431625,员:-5.928630,靚:-12.124996,统:-6.571888,櫧:-14.626432,襦:-17.334482,叭:-11.243172,雯:-9.977564,鳳:-8.734051,念:-7.477667,苷:-12.729312,摸:-9.882079,橼:-14.769533,邀:-10.959457,厂:-7.953893,妆:-10.702480,紉:-13.144827,鲈:-14.501269,徊:-10.927602,列:-7.389325,错:-8.289724,探:-9.677672,蜥:-14.769533,贩:-11.057838,澪:-14.156428,劬:-17.334482,户:-7.307008,螺:-11.119874,趾:-12.031177,允:-10.542137,聋:-11.853843,拌:-10.711746,虏:-10.236106,何:-6.693806,滔:-11.311034,留:-8.337582,埚:-13.114974,筝:-10.974908,州:-6.352823,来:-4.916780,蛤:-13.808121,浩:-9.975014,俪:-13.016994,饱:-11.505536,懶:-11.523341,譽:-8.405312,儀:-8.830577,疃:-15.388572,圄:-13.696896,順:-8.658918,萎:-12.522298,涓:-12.709509,咙:-10.950975,甘:-10.639920,龟:-10.574067,讧:-10.637448,吮:-13.175599,碱:-9.875719,娲:-12.891831,纵:-9.614908,鼴:-14.769533,郁:-9.534729,雅:-8.931354,寇:-10.333236,苍:-11.725010,孜:-11.754752,翟:-13.837974,獬:-17.334482,數:-6.364475,歼:-11.289477,床:-8.432435,戍:-12.330536,树:-8.111917,辔:-13.645602,北:-6.227827,炖:-11.055960,鐙:-12.952455,皚:-13.016994,弟:-7.448853,抢:-10.954359,梦:-9.536780,溪:-9.305701,眯:-11.762328,钮:-12.222494,紳:-10.584551,漿:-9.828440,魇:-13.240137,屉:-10.992360,腋:-12.891831,槐:-11.050348,赓:-12.791187,僖:-14.038645,瑙:-11.647507,囚:-11.247707,臠:-15.948188,汩:-12.812693,跨:-11.234163,八:-8.766976,仪:-8.830577,坯:-12.317202,瓮:-14.076385,顱:-11.303797,鹵:-14.198988,惶:-11.046623,使:-7.130482,泾:-13.620910,刀:-8.114785,鄂:-10.359068,各:-11.423685,碇:-17.334482,师:-6.734279,褒:-13.779134,邗:-16.641335,瘘:-14.444110,骛:-13.596812,妝:-10.702480,砜:-14.444110,鲟:-10.642398,蚣:-10.937552,侩:-14.156428,箱:-9.286972,騰:-8.935847,蘸:-15.255040,壇:-8.472140,筆:-8.554463,臍:-13.207348,李:-9.719184,译:-9.014521,仓:-10.313398,糟:-11.181749,棧:-11.440079,警:-8.492455,凭:-10.499297,铯:-17.334482,穰:-15.725044,籴:-15.948188,猁:-13.402656,銀:-9.059360,缉:-11.581909,肌:-10.890351,玖:-13.175599,霙:-17.334482,娛:-11.640750,疚:-11.209799,羞:-11.179624,蔥:-10.983596,輩:-8.741810,涪:-17.334482,催:-16.641335,琯:-17.334482,莶:-16.641335,薺:-14.002277,达:-7.022600,十:-8.311556,狀:-7.973827,终:-7.882844,艋:-16.641335,取:-6.876104,嗚:-13.484334,祝:-9.747678,捡:-15.255040,苠:-17.334482,矮:-11.781522,平:-6.378897,揶:-15.255040,旺:-9.937533,濾:-11.234163,匀:-10.085978,适:-9.001692,唄:-15.255040,弈:-11.949987,挠:-10.702480,攤:-10.364691,亩:-8.615328,炭:-9.519678,嘮:-15.948188,粵:-11.617454,暹:-13.808121,举:-7.176430,鋁:-11.977896,埃:-9.652460,铅:-12.990676,穆:-10.321466,諑:-15.031897,鹞:-13.645602,試:-7.474998,豪:-9.463171,煬:-13.696896,闯:-11.291849,嫱:-15.542722,筰:-17.334482,读:-8.133687,楼:-7.385304,琅:-11.303797,縉:-11.594689,龈:-12.607094,岊:-15.255040,犖:-13.933285,阙:-11.407556,崟:-17.334482,营:-7.537745,踩:-17.334482,猫:-10.303624,沪:-12.016362,冬:-9.610477,宰:-10.737336,缳:-16.641335,嶴:-17.334482,愷:-11.559930,珀:-11.813021,懌:-13.837974,勖:-13.223608,哚:-13.620910,硝:-12.880135,菠:-15.255040,藤:-10.969731,迨:-16.641335,卫:-7.952039,遭:-10.272290,目:-6.891319,驱:-10.488602,磲:-13.837974,拶:-17.334482,虹:-9.524535,擺:-10.701163,衽:-13.402656,滾:-10.081012,梓:-11.315889,輒:-11.949987,隗:-14.243439,写:-8.345287,鲛:-14.444110,搠:-17.334482,綱:-9.532682,耸:-11.338030,絆:-12.812693,慎:-9.754292,跑:-9.446523,试:-7.474998,盗:-9.629670,镖:-11.389061,竟:-8.269052,饞:-13.114974,赦:-11.092259,癬:-13.003749,鋯:-15.031897,己:-5.903830,寵:-11.198917,穴:-9.594252,恸:-13.383238,垂:-10.818289,颈:-10.220526,服:-7.581410,蚌:-13.779134,嘗:-10.073959,鄙:-11.203255,娟:-8.663195,蔡:-12.598283,枢:-10.300975,丧:-10.205986,润:-8.247666,醮:-13.750963,莺:-11.862211,卅:-13.422459,狄:-11.949987,鹇:-13.933285,奉:-9.323127,曌:-15.542722,泐:-16.641335,術:-6.137048,嗖:-12.690091,煙:-8.875554,黜:-11.879161,蓠:-14.769533,副:-9.346618,燮:-12.444133,时:-5.475763,腹:-9.700628,载:-8.065307,阂:-12.240732,匄:-17.334482,斋:-10.125882,掏:-15.542722,備:-6.493079,焘:-11.218590,挤:-10.409870,倮:-15.255040,粱:-10.904762,鴰:-14.002277,脸:-8.382912,铁:-8.374528,療:-7.899000,鋅:-12.364669,賑:-14.695425,矗:-15.948188,類:-6.678282,懣:-12.459285,虢:-14.626432,闫:-17.334482,园:-7.350936,睬:-11.211989,嫵:-15.137257,份:-7.440742,潼:-12.378655,诿:-12.652351,門:-5.556036,馈:-10.906377,民:-5.647032,互:-8.634134,崛:-14.501269,鸝:-13.327149,暢:-10.093832,伧:-14.626432,沦:-12.749514,甫:-9.563415,邮:-11.610897,宴:-9.956098,活:-6.763447,酃:-17.334482,秈:-17.334482,荏:-14.769533,比:-7.701950,釘:-10.819769,壞:-8.437620,桩:-10.742808,卯:-11.072990,女:-7.377454,绲:-16.235870,聹:-15.948188,嘀:-15.948188,锂:-12.141525,娈:-15.031897,養:-7.583097,茎:-10.666254,丐:-10.983596,钗:-10.363752,厙:-17.334482,映:-8.318576,貧:-10.162825,樨:-15.031897,匮:-17.334482,舸:-13.527819,韁:-13.967186,勃:-9.839496,鯉:-13.527819,藍:-10.630068,近:-7.179963,浒:-12.210518,靖:-8.159354,绛:-13.868746,酚:-10.690692,屜:-10.992360,拣:-13.256944,车:-6.892077,襪:-12.031177,忱:-11.315889,軻:-13.030417,省:-6.390488,喂:-13.779134,還:-9.662655,妊:-17.334482,吗:-11.284748,帛:-11.728680,蜡:-11.588279,瘫:-12.222494,咬:-12.108735,鎮:-7.832443,稳:-9.793860,膺:-11.470851,设:-6.866618,充:-8.822301,佑:-10.511196,絝:-14.561893,寞:-10.582212,条:-6.851212,胤:-11.459551,俦:-14.849575,歩:-14.501269,镭:-14.444110,珮:-14.936587,緲:-11.963844,饵:-12.046215,懺:-15.542722,億:-10.769217,嬈:-12.834672,枋:-10.842242,頊:-12.498200,伐:-9.373809,殓:-12.371637,谒:-12.337270,龛:-12.729312,紜:-12.222494,愤:-9.696284,锬:-17.334482,刮:-12.259308,纱:-9.939989,抹:-11.015514,茸:-11.699692,沽:-11.343017,贼:-8.940361,雁:-10.496077,參:-9.781720,郅:-12.056367,繆:-12.304044,扎:-9.376955,裕:-9.526565,租:-9.622933,揣:-13.044022,蹦:-14.561893,韫:-14.038645,哭:-9.696284,畬:-15.948188,罰:-9.025297,瘁:-12.407228,鞀:-16.641335,瀅:-12.124996,庆:-8.091868,墊:-11.282393,損:-9.357200,辐:-15.725044,皖:-10.442856,弛:-11.186014,够:-7.450738,溦:-17.334482,喬:-10.287835,焯:-11.703270,銮:-12.522298,笳:-14.444110,鲲:-13.175599,蚶:-14.936587,肺:-11.207613,椿:-12.436642,婉:-10.854437,旌:-16.235870,牙:-8.390323,鏘:-12.284626,僚:-9.780147,蟠:-11.817029,恥:-10.071853,诨:-13.670920,狮:-9.824051,糲:-14.849575,页:-8.051077,佻:-13.550292,惺:-12.990676,犇:-16.641335,合:-6.319466,溏:-15.725044,撓:-10.702480,骗:-10.023264,邛:-16.641335,厝:-15.948188,渤:-14.936587,箭:-9.047457,崮:-13.967186,熱:-8.350415,阴:-10.170535,伺:-13.016994,駁:-10.658659,勇:-8.506574,词:-8.365067,济:-6.345974,烛:-10.103195,盟:-8.277176,镞:-13.837974,泣:-10.466507,拧:-16.235870,腦:-8.249025,凱:-8.808527,灰:-10.051721,铳:-12.407228,諷:-11.039216,礁:-10.753843,颀:-15.031897,缅:-15.725044,円:-15.255040,针:-8.495785,誌:-15.255040,朕:-13.364190,羚:-11.420979,嘟:-11.743495,輥:-14.444110,枪:-8.455567,琳:-9.028998,嚴:-8.663024,总:-9.766103,奁:-13.114974,组:-7.997773,啉:-13.207348,敩:-17.334482,填:-11.431849,酱:-10.560258,味:-7.655076,珲:-14.002277,濺:-11.604382,荽:-14.115606,綃:-14.002277,弄:-9.922322,率:-7.087724,逆:-10.852905,谎:-10.909613,斓:-11.883443,舒:-11.330595,岙:-17.334482,醛:-11.188153,劝:-11.052215,猜:-11.870650,趣:-8.404914,亥:-13.345498,莧:-13.808121,鄰:-9.830641,油:-7.968250,贸:-8.957931,为:-5.039277,抽:-15.388572,穂:-13.645602,铉:-12.222494,諍:-13.933285,俏:-11.585089,扒:-14.936587,嵘:-12.135985,鹚:-13.620910,卜:-10.102472,詢:-8.590313,佤:-14.849575,僱:-12.204583,闳:-13.750963,囵:-12.915641,请:-8.252998,浸:-11.173275,臻:-11.431849,码:-8.402269,馀:-16.641335,龄:-8.428631,昕:-10.799241,嬗:-15.137257,土:-7.544163,璞:-12.436642,蠡:-10.780549,檢:-9.838940,悦:-9.526972,礫:-11.664601,宬:-17.334482,缯:-17.334482,冰:-9.339512,申:-10.103195,欷:-16.235870,躺:-12.680522,秀:-7.981427,幅:-8.461574,鍇:-12.770134,蕓:-15.137257,柔:-9.756848,籙:-13.620910,廚:-11.282393,鏜:-14.444110,迤:-13.085987,摩:-9.673426,驭:-11.785406,狲:-12.759771,陵:-7.867408,豹:-10.164362,艽:-15.137257,擾:-9.030234,射:-7.713026,錆:-17.334482,脒:-16.235870,颗:-9.193292,徙:-11.216385,钟:-7.961003,昨:-15.725044,鈰:-17.334482,儲:-10.043507,疵:-12.915641,鯁:-15.137257,韉:-14.936587,藕:-13.114974,幘:-15.948188,停:-9.124086,非:-7.729805,惧:-9.507241,荦:-13.933285,髫:-15.542722,蕪:-11.624055,硬:-9.725611,叱:-14.695425,雳:-11.348030,嗵:-17.334482,恼:-9.681936,蓿:-12.940033,骀:-17.334482,如:-7.265819,紅:-7.744610,历:-7.735077,眉:-9.806688,喊:-9.577431,植:-8.799252,挑:-11.541468,芐:-13.933285,蒔:-17.334482,创:-9.100448,吟:-9.451036,瞞:-10.770626,败:-7.725298,样:-5.715999,讶:-10.246908,趺:-16.641335,鹃:-9.795987,遇:-8.497672,盈:-9.693878,拐:-10.974908,虓:-16.235870,擔:-8.457658,默:-8.898933,郜:-17.334482,歡:-7.989698,賤:-11.046623,饭:-8.254478,屯:-11.247707,翮:-14.849575,轹:-17.334482,淺:-10.636214,頂:-8.415564,圈:-8.960005,残:-10.551157,耒:-17.334482,馗:-13.345498,庙:-8.214395,缘:-8.705390,欠:-10.862136,辣:-10.123663,木:-8.089933,碭:-17.334482,帮:-9.031720,锴:-12.770134,輸:-8.353555,心:-5.908782,鳅:-11.448378,凇:-13.596812,牆:-8.440635,雉:-12.344049,湎:-12.780605,苑:-9.746158,恒:-9.945536,彘:-16.641335,兜:-11.769962,衢:-10.343305,艦:-8.706463,鷯:-14.769533,勱:-15.137257,獰:-11.883443,音:-7.450126,畴:-9.510436,潸:-15.031897,于:-5.201851,我:-9.186036,薔:-13.723564,窖:-11.801092,逝:-10.673907,梢:-10.921023,谥:-15.388572,蘩:-16.641335,累:-8.955402,貺:-17.334482,政:-6.562550,婁:-13.696896,節:-7.299265,居:-8.118955,緄:-16.235870,槌:-12.357748,赏:-8.985471,提:-8.646365,蝓:-14.501269,灝:-13.044022,釜:-17.334482,回:-7.563555,橡:-17.334482,诠:-15.031897,跤:-11.858018,孫:-8.963008,绮:-13.291431,坳:-12.192818,泺:-15.137257,聽:-8.484251,曾:-9.222254,娄:-13.696896,皇:-8.988552,锆:-15.031897,蜒:-10.522137,麗:-7.705365,妙:-8.933373,钛:-13.484334,蚧:-14.243439,怨:-9.598175,央:-7.268238,疱:-13.071802,鈴:-10.571752,釉:-12.643134,塘:-9.764554,瓛:-17.334482,魚:-7.516334,噜:-11.243172,酞:-14.769533,棣:-13.364190,轢:-17.334482,荪:-11.488043,忭:-16.641335,髯:-11.977896,瑰:-10.907993,骄:-12.927763,喆:-13.505841,焉:-11.692575,邈:-12.965034,君:-8.366468,贡:-10.706441,脩:-16.235870,簫:-11.982624,措:-9.730584,馮:-12.284626,论:-6.503744,房:-7.804234,竄:-11.559930,陇:-13.191347,光:-6.857081,烈:-7.655138,位:-5.890810,滌:-11.140077,拔:-8.273918,飘:-11.194597,雜:-8.343791,賠:-11.996944,步:-6.531890,諤:-13.175599,鍵:-8.574029,淶:-15.948188,蝽:-17.334482,懾:-11.008332,瞇:-11.762328,儈:-14.156428,墙:-8.440635,欤:-14.849575,愨:-16.235870,纭:-12.222494,鼬:-13.573282,锰:-13.422459,嘲:-11.754752,褸:-12.451680,髅:-11.896403,軍:-15.137257,晒:-11.131946,苕:-14.076385,奘:-11.973190,痛:-8.500291,驚:-8.978397,坜:-14.769533,遞:-9.652460,葦:-10.695914,異:-8.194671,勵:-8.837287,迷:-9.463552,楸:-13.620910,藻:-9.403197,杼:-14.390043,稅:-8.684683,瀉:-10.806524,渍:-11.892064,弗:-11.762328,谡:-11.591479,溢:-10.824224,訥:-12.791187,紫:-10.603464,貶:-13.327149,攻:-8.008850,肾:-11.963844,屁:-10.647373,饃:-12.284626,範:-8.175119,偉:-8.186230,燈:-8.581584,赋:-9.938147,乍:-14.626432,譏:-13.129789,腓:-15.388572,駘:-17.334482,嫚:-15.388572,韜:-11.940854,污:-10.216466,橥:-17.334482,诤:-13.933285,恩:-8.767737,臨:-8.232507,嵫:-17.334482,鹭:-12.330536,关:-6.136870,盲:-11.266056,櫺:-12.801882,窃:-11.211989,璇:-11.090315,霆:-11.266056,刈:-17.334482,梏:-13.422459,謎:-12.330536,抓:-11.048484,宙:-9.541720,際:-6.662438,喝:-9.704021,渠:-10.229516,誣:-15.542722,維:-8.198650,熵:-14.338750,伶:-11.931805,訸:-17.334482,施:-7.132113,萼:-10.800693,終:-7.882844,哇:-11.119874,介:-8.973943,煊:-11.456746,盛:-8.800628,呜:-13.484334,烟:-8.875554,习:-7.289625,赢:-10.877712,蝦:-11.022747,籬:-12.538691,飯:-8.254478,蛻:-13.808121,嶂:-13.696896,预:-10.202783,冊:-8.728180,貌:-8.420125,愕:-11.809029,嘛:-10.214038,借:-9.694840,褥:-11.896403,縫:-9.928986,鮮:-8.390193,覺:-7.459754,怿:-13.837974,绀:-13.345498,驃:-15.031897,卉:-10.755231,狈:-10.973179,蹋:-11.931805,泌:-9.736083,忖:-11.578740,高:-6.756852,姚:-11.209799,畝:-8.615328,铜:-9.992350,裤:-10.706441,捩:-15.137257,幫:-9.031720,篮:-9.901998,酵:-11.448378,开:-6.427884,处:-6.752428,疇:-9.510436,阆:-16.235870,逊:-9.249303,討:-9.341537,咝:-17.334482,甜:-10.111916,亡:-8.093418,漠:-8.959083,椤:-13.933285,挨:-13.645602,皱:-10.769217,鄴:-12.152698,蔼:-11.801092,嗇:-12.572308,癆:-14.390043,蛑:-15.948188,緗:-15.542722,存:-7.715747,矛:-11.315889,營:-7.537745,鉞:-12.690091,你:-12.459285,旧:-8.720162,聪:-10.125882,峭:-11.399588,囱:-12.031177,僵:-12.801882,跷:-11.581909,歸:-9.136118,蟻:-10.962870,龀:-15.255040,岂:-14.444110,怕:-7.668364,崗:-8.739402,纖:-10.512285,騙:-10.023264,碚:-15.725044,償:-9.110050,钲:-15.948188,冴:-15.255040,愿:-8.032292,芾:-11.640750,翀:-12.801882,魃:-13.175599,镇:-7.832443,珈:-11.637388,淌:-11.773800,某:-9.900225,懔:-16.235870,廖:-16.235870,關:-6.136870,勞:-8.962083,桥:-7.323756,扩:-10.562546,即:-7.735077,遵:-12.857145,詹:-14.936587,棺:-11.399588,拾:-9.510836,怀:-8.939456,螅:-13.100375,氈:-12.634002,嚏:-11.913947,馑:-13.837974,龕:-12.729312,脖:-13.527819,料:-6.679508,贞:-9.966773,錢:-8.197573,瞥:-11.303797,嘤:-15.388572,肫:-15.388572,貳:-15.137257,欲:-9.478162,侵:-9.711329,銷:-7.872760,然:-5.387977,喹:-14.936587,眺:-11.566161,宽:-9.871693,麿:-15.255040,豈:-14.444110,盏:-10.496077,摘:-11.096157,话:-6.542753,仟:-14.243439,揭:-12.459285,槱:-17.334482,酶:-11.123882,痹:-11.526339,萃:-11.508482,訇:-12.823622,榆:-12.749514,逋:-15.542722,引:-8.565130,戗:-13.550292,厢:-10.438799,鲨:-13.750963,循:-10.073959,茭:-16.641335,抬:-13.696896,械:-8.279860,刷:-9.634187,锹:-12.965034,视:-7.307981,罕:-10.495005,衛:-7.952039,柚:-13.364190,淞:-12.572308,鑣:-11.766137,秦:-10.123663,嵩:-10.473818,景:-7.754027,裰:-12.598283,凶:-11.144167,铸:-10.787696,基:-8.114785,巾:-9.907933,貉:-14.849575,频:-9.069604,缔:-11.538424,蘚:-12.158332,谞:-15.031897,頦:-14.115606,鸪:-10.442856,螯:-15.725044,足:-7.501256,亵:-13.463281,瘺:-14.444110,媽:-8.331658,簾:-10.649870,旃:-15.388572,赈:-14.695425,齔:-15.255040,敘:-11.714081,諝:-15.031897,俟:-15.542722,郡:-9.470446,嗣:-10.843758,寧:-7.931375,鳩:-12.444133,絨:-10.968011,拭:-12.147096,棱:-12.538691,該:-7.272837,啸:-10.242740,竽:-16.641335,謇:-12.690091,梆:-14.626432,刍:-13.402656,霏:-12.834672,璎:-15.031897,堑:-11.728680,帕:-10.561402,讜:-16.641335,劢:-15.137257,掬:-12.857145,踵:-12.857145,疸:-12.414501,晅:-15.031897,裆:-12.927763,汉:-6.766581,車:-6.892077,牍:-12.152698,双:-8.699506,铎:-11.523341,姐:-8.046995,繕:-10.230338,轟:-11.520351,泞:-12.130475,镣:-13.291431,噥:-11.762328,慫:-16.641335,绪:-8.341055,杯:-8.352549,獷:-12.210518,闸:-11.311034,固:-8.719981,戀:-9.765070,辉:-8.274964,咏:-12.016362,鮑:-14.338750,库:-8.082616,蔚:-11.160696,輞:-14.936587,删:-13.723564,鄢:-14.444110,義:-15.137257,猶:-13.345498,町:-14.198988,蹈:-9.635999,瓏:-11.013714,坎:-11.209799,结:-7.700837,鱔:-11.470851,鏡:-8.686085,闥:-15.031897,瑤:-9.443151,襲:-9.187773,淵:-9.927164,鍶:-14.289959,噸:-8.508188,秽:-11.671521,憂:-9.828990,殆:-13.114974,伉:-15.255040,瞎:-14.115606,袜:-12.031177,氟:-14.076385,冢:-13.327149,钤:-13.723564,砧:-14.338750,宦:-11.862211,悬:-10.904762,贵:-8.167467,碼:-8.402269,尿:-10.576387,臂:-8.830982,故:-8.678049,识:-7.085492,筑:-7.545452,駒:-10.517746,絕:-8.334863,揖:-11.721354,詛:-14.626432,濞:-13.645602,卡:-8.899150,陣:-7.924471,啥:-11.692575,顧:-8.334492,篦:-15.031897,彩:-8.236303,扫:-10.360939,摯:-11.190296,賴:-9.279324,叶:-8.143630,飼:-13.620910,忾:-12.071792,压:-8.096818,喏:-13.256944,骑:-10.106093,純:-9.259522,條:-6.851212,踞:-11.442838,匠:-9.063189,逢:-9.707424,唤:-9.635546,莫:-10.604658,薯:-10.173636,父:-7.803871,鶿:-13.620910,績:-8.095263,荀:-14.115606,酌:-11.152397,噎:-12.634002,蛙:-11.156538,裝:-7.544499,惭:-12.098040,衲:-11.330595,泵:-10.780549,盹:-12.857145,奼:-15.255040,三:-7.978830,倍:-8.952650,锏:-11.918382,皎:-13.160095,娑:-12.990676,鼓:-9.460884,亞:-7.123399,憬:-11.977896,許:-7.601605,儷:-13.016994,扁:-10.604658,湉:-17.334482,賊:-8.940361,凌:-10.468591,雎:-13.191347,穑:-14.338750,寐:-13.100375,飒:-12.880135,巔:-12.506168,拖:-12.522298,據:-6.776848,赟:-12.234615,滞:-10.375083,剡:-15.725044,竦:-16.235870,臬:-15.255040,诰:-15.542722,哺:-13.723564,搀:-16.641335,莅:-16.641335,栈:-11.440079,鞍:-11.750986,瘌:-15.542722,墓:-8.959544,稔:-13.309130,东:-6.589664,疡:-11.280043,吠:-12.652351,玥:-13.670920,判:-8.039525,鴦:-10.670073,芯:-11.627372,漲:-9.115425,徽:-9.188642,社:-7.463828,滇:-14.338750,陌:-13.463281,归:-9.136118,违:-11.211989,闡:-13.868746,腮:-13.191347,深:-8.226950,轲:-13.030417,镶:-13.573282,燹:-13.484334,鍺:-15.725044,幼:-9.850675,考:-7.852970,殊:-8.362272,圍:-7.308777,崑:-17.334482,頓:-8.053124,肘:-11.407556,氛:-9.463934,樟:-13.750963,钠:-10.460283,瀣:-16.641335,垢:-12.031177,風:-7.284905,宪:-9.966142,贱:-11.046623,炸:-9.317174,捅:-17.334482,诊:-9.962993,野:-8.877676,嫔:-11.825094,旖:-14.501269,揚:-8.426599,啡:-10.021928,遣:-9.462027,矢:-11.809029,緦:-17.334482,奩:-13.114974,篪:-12.759771,扯:-10.308944,郸:-11.725010,类:-6.678282,穿:-9.414762,攀:-11.426399,隍:-12.845846,鲑:-15.388572,紐:-9.913903,妓:-12.087458,笔:-8.554463,溝:-9.278372,唠:-15.948188,碩:-10.836200,薫:-14.156428,渲:-16.235870,琶:-11.042913,鶻:-11.637388,爺:-7.697437,砾:-11.664601,珏:-11.736060,偎:-12.598283,魔:-10.567139,慘:-10.694606,潜:-10.344225,忧:-9.828990,飩:-12.661653,票:-7.792323,泱:-13.868746,烹:-14.561893,典:-7.764092,绽:-11.181749,彼:-12.051278,顾:-8.334492,暂:-10.813861,锋:-8.119054,炎:-8.873224,少:-6.709090,餓:-10.803604,朗:-8.439675,膘:-16.235870,洛:-9.127080,辜:-10.758012,馨:-10.491799,媪:-14.695425,蘭:-7.494307,谱:-9.465845,殴:-12.385722,鸽:-10.959457,摁:-16.641335,桉:-15.031897,郎:-8.809916,蝗:-12.421827,赛:-7.187931,拚:-13.723564,九:-9.387511,酣:-12.990676,剥:-12.378655,蟬:-11.479410,仲:-10.482239,说:-6.311012,勺:-11.479410,昀:-12.749514,龑:-17.334482,縐:-13.309130,馕:-16.641335,研:-8.507894,掙:-14.002277,脚:-8.476113,涝:-11.054086,锢:-12.056367,箩:-13.645602,肯:-8.606218,洲:-6.922101,眶:-10.649870,麻:-9.164579,但:-8.805360,鑌:-14.038645,烏:-10.981853,华:-6.819980,托:-8.503793,距:-9.105504,汜:-13.309130,韡:-14.243439,灤:-13.808121,旭:-9.312897,濱:-9.622933,买:-8.844454,靶:-13.016994,珹:-17.334482,斂:-10.638683,澆:-14.501269,阋:-16.235870,透:-9.610919,玎:-16.235870,夕:-9.951735,搗:-12.812693,芘:-14.338750,減:-9.581717,邤:-17.334482,簧:-11.482279,骨:-8.767737,妪:-13.505841,蔭:-11.207613,褵:-17.334482,犸:-14.501269,帻:-15.948188,粼:-13.696896,歉:-10.602271,哌:-17.334482,网:-7.965771,著:-8.649066,坡:-8.658577,痢:-13.779134,入:-5.995327,鱧:-15.255040,翦:-13.573282,孩:-8.948309,蓬:-9.989763,息:-6.766967,裴:-13.670920,瑷:-14.390043,鋸:-12.791187,出:-5.556879,蚁:-10.962870,最:-12.234615,肅:-9.086214,誉:-8.405312,型:-6.733307,钍:-17.334482,甌:-12.589550,冏:-17.334482,宓:-12.845846,蘖:-13.207348,鸦:-11.238657,窩:-10.043507,戮:-11.096157,讳:-10.842242,氲:-13.191347,岽:-15.031897,淇:-11.968506,镌:-17.334482,剎:-10.585722,齐:-8.445036,篓:-12.181190,饔:-16.641335,浜:-13.596812,口:-5.921001,煤:-10.642398,巧:-8.838921,艮:-12.598283,佰:-14.198988,棵:-10.420745,陶:-9.681461,狹:-13.291431,卸:-10.983596,遺:-11.287110,驾:-9.913903,范:-8.175119,撂:-15.542722,贇:-13.402656,溆:-16.641335,名:-6.116411,帑:-14.444110,鬓:-12.186987,粒:-9.383627,堕:-15.388572,莘:-14.156428,鞠:-14.038645,紧:-8.282200,度:-5.594859,斬:-12.392839,榴:-11.849685,唷:-15.948188,鈹:-14.936587,晁:-14.444110,裊:-12.459285,硕:-10.836200,委:-7.543491,惚:-11.350546,襟:-10.294822,櫞:-14.769533,瓢:-12.407228,健:-8.946032,述:-7.503834,觴:-13.808121,祿:-9.848990,要:-5.268246,栀:-17.334482,辅:-9.453678,序:-7.852970,鬢:-12.186987,吨:-8.508188,被:-9.575721,躯:-10.636214,洮:-13.114974,挲:-13.114974,邻:-9.830641,缺:-9.486329,血:-8.245406,蹄:-10.637448,磋:-12.407228,经:-6.117782,遐:-14.076385,卒:-10.287835,闩:-12.092735,柵:-12.330536,饶:-10.643640,緹:-16.235870,调:-7.520700,與:-8.355821,鐓:-15.725044,玒:-16.641335,怛:-16.641335,芜:-11.624055,星:-7.334276,颠:-10.995888,簣:-13.207348,客:-7.640852,钨:-14.390043,檬:-12.278236,脱:-9.028257,暴:-9.419499,嘿:-10.460283,诂:-12.278236,仄:-13.191347,臆:-12.940033,筍:-11.426399,嫌:-11.320767,睕:-17.334482,囔:-12.482452,號:-7.443523,彥:-10.370346,燦:-10.843758,湯:-9.908528,胰:-15.725044,穷:-9.595994,鋼:-9.355828,袁:-13.044022,躅:-14.198988,邑:-11.133973,蠖:-14.338750,沙:-8.411957,碡:-13.868746,夠:-7.450738,纥:-12.598283,逦:-12.615983,璩:-14.501269,阪:-11.365774,辯:-10.109000,氮:-12.169696,戲:-8.618438,轄:-8.981220,蕈:-13.808121,秋:-8.477679,屎:-12.228536,酐:-12.429207,祠:-11.072990,惱:-9.681936,色:-6.298996,顶:-8.415564,狽:-10.973179,鑾:-12.522298,們:-4.816523,锓:-15.031897,愛:-15.137257,亚:-7.123399,期:-6.032092,閨:-14.156428,設:-6.866618,伯:-8.517777,耱:-15.948188,嬷:-12.082208,綸:-11.247707,儻:-13.071802,俄:-10.921023,胆:-9.326116,積:-6.979123,富:-7.386786,鳎:-15.388572,灑:-10.617887,鋒:-8.119054,埔:-11.789304,棖:-15.255040,滚:-10.081012,擞:-12.466947,烦:-9.189222,楫:-13.596812,盪:-8.835453,诬:-15.542722,潯:-13.868746,筷:-12.071792,壶:-10.312505,鷸:-17.334482,建:-6.880881,睿:-11.370903,超:-8.658918,馍:-12.284626,砌:-11.996944,爐:-9.632830,嚓:-11.874896,謖:-11.591479,丘:-9.676727,管:-7.027665,娠:-11.238657,尤:-11.918382,錦:-10.300975,瞩:-13.003749,貯:-12.652351,徹:-9.117853,銻:-15.542722,紺:-13.345498,冽:-12.271887,钿:-12.880135,眾:-7.005433,惇:-16.235870,立:-6.089763,題:-6.145723,彎:-10.622742,兒:-6.345957,湘:-9.964881,廣:-8.508041,鷥:-14.002277,僧:-9.234017,韩:-11.229689,轮:-8.454870,旵:-14.936587,翹:-12.436642,幸:-9.033208,概:-8.940135,复:-7.389037,美:-7.441297,熒:-13.550292,栗:-10.310723,肜:-17.334482,骠:-15.031897,縣:-6.820468,鲤:-13.527819,厦:-10.365632,隨:-17.334482,喪:-10.205986,鼹:-14.769533,纸:-8.557081,刻:-7.244224,炼:-9.108443,观:-7.413498,浅:-10.636214,杉:-10.543260,勐:-14.849575,街:-8.313125,毖:-16.641335,余:-7.958712,淚:-8.871534,橫:-9.682886,痪:-11.196755,修:-8.373372,蓴:-17.334482,寶:-15.255040,侃:-10.882433,貅:-15.031897,月:-7.055954,宋:-9.223154,颍:-13.144827,銑:-13.933285,垓:-14.936587,钕:-16.235870,訖:-13.620910,优:-9.863688,谚:-12.903665,悝:-13.527819,粥:-11.781522,鈦:-13.484334,在:-5.878571,讫:-13.620910,瘾:-11.133973,濃:-12.474670,资:-7.036927,懇:-11.125892,蝈:-14.561893,篋:-17.334482,饌:-14.115606,矓:-13.442662,镔:-14.038645,潘:-12.158332,胝:-13.933285,髡:-15.137257,筠:-12.103373,鳥:-9.683362,雩:-16.235870,睨:-12.857145,拱:-11.179624,聲:-6.364372,驶:-9.887897,鱺:-13.114974,烽:-12.271887,兼:-12.522298,較:-7.610540,刑:-8.992595,霓:-13.223608,炒:-12.891831,吕:-11.996944,辘:-12.780605,挛:-11.601141,膜:-9.331119,咪:-12.514200,舱:-9.852363,掰:-15.725044,夷:-10.190864,鸹:-14.002277,医:-9.108979,裂:-8.705926,晉:-8.975347,黎:-8.954943,瑕:-12.940033,嗔:-13.422459,乙:-11.750986,荛:-15.948188,履:-11.194597,噩:-13.030417,浯:-17.334482,杳:-16.641335,祷:-11.113892,獻:-8.221093,畿:-12.216488,图:-7.540698,趁:-13.900495,龍:-7.341336,琐:-10.772038,爔:-17.334482,枝:-9.070376,锦:-10.300975,貫:-8.947397,妹:-8.282200,钻:-12.031177,笺:-11.931805,奎:-10.235280,仗:-9.246534,籠:-9.871119,釩:-13.484334,旱:-9.890818,矽:-12.181190,蠃:-15.542722,蘇:-8.832605,騏:-13.645602,禎:-9.036689,唑:-12.474670,瞒:-10.770626,渗:-12.041177,蚜:-14.849575,戟:-10.945921,鲠:-15.137257,砣:-14.243439,骤:-10.284359,瘧:-14.198988,撰:-11.758533,茵:-11.196755,帷:-14.849575,吻:-10.510108,霽:-14.076385,流:-6.913332,迂:-17.334482,菊:-10.464428,畑:-17.334482,淖:-13.442662,葛:-10.866783,艟:-14.561893,孥:-17.334482,兩:-8.860405,珪:-15.388572,恳:-11.125892,苴:-16.641335,寺:-8.695956,誅:-12.940033,欄:-9.628319,肉:-8.206654,愈:-9.786980,缌:-17.334482,宏:-8.991404,谖:-15.542722,鸢:-15.137257,窥:-13.016994,嬤:-15.137257,亭:-8.847130,讯:-8.951049,膳:-11.100071,閻:-15.542722,瀾:-10.929253,赀:-16.235870,乂:-17.334482,腈:-13.071802,緋:-17.334482,镐:-12.234615,鍔:-11.566161,俗:-8.699683,裙:-10.830194,杜:-11.488043,姣:-11.473696,煨:-15.137257,佬:-12.135985,衮:-10.175968,擱:-10.980112,奸:-9.687173,蜇:-13.505841,把:-8.444071,碎:-9.365124,向:-6.897429,挟:-12.103373,努:-12.076987,萱:-12.317202,新:-6.999439,舵:-11.575580,強:-7.044135,頹:-13.596812,瞼:-12.310601,匿:-11.620749,汁:-10.085267,苊:-17.334482,忌:-9.185169,风:-7.284905,雒:-17.334482,叔:-9.070119,櫚:-12.198683,荟:-12.834672,屡:-11.644122,绢:-11.566161,瓦:-8.740883,罷:-10.261212,島:-7.623003,駸:-16.235870,栄:-15.255040,莉:-9.036689,戈:-9.909720,簌:-11.766137,褚:-13.484334,羡:-11.949987,禥:-17.334482,堤:-9.504056,玩:-10.137795,刨:-15.255040,身:-6.512606,芳:-8.179760,鲷:-15.388572,容:-7.134489,示:-6.785044,猾:-11.207613,櫃:-10.325977,擇:-7.941237,艈:-17.334482,限:-8.111620,達:-7.022600,橘:-11.129924,藝:-7.946665,嫣:-11.024564,硤:-16.235870,哧:-11.535389,柱:-8.394246,蕲:-17.334482,懵:-15.031897,饺:-13.402656,呼:-8.380325,鍾:-14.338750,企:-10.227876,涂:-9.643282,萇:-12.459285,憊:-11.154465,崍:-14.198988,頏:-14.561893,箎:-15.137257,儕:-14.561893,誘:-11.353068,蒜:-11.870650,稣:-11.181749,颤:-11.353068,垦:-11.107945,銨:-12.392839,丫:-12.699753,冪:-14.115606,购:-8.639310,悴:-11.345520,嘻:-10.907993,潁:-13.144827,什:-9.585591,蟆:-11.493840,捉:-10.487539,臊:-12.780605,睑:-12.310601,煕:-17.334482,虛:-9.439046,彡:-17.334482,奥:-9.905555,湫:-14.769533,賬:-10.308055,蛰:-14.198988,扳:-15.542722,登:-9.635546,铼:-16.641335,灿:-10.843758,躁:-9.991703,袅:-12.459285,挈:-14.038645,律:-6.807197,鲍:-14.338750,邕:-12.812693,舞:-8.793963,纡:-15.948188,张:-7.207011,夤:-15.255040,辫:-12.965034,莳:-17.334482,砺:-12.378655,咽:-10.120714,爾:-7.147622,襄:-9.506842,蓝:-10.630068,飥:-17.334482,獨:-8.950135,詮:-15.031897,竹:-9.323790,學:-5.428427,顺:-8.658918,啼:-12.378655,丁:-9.075800,沂:-12.186987,對:-6.797279,洗:-9.897276,望:-7.000609,薜:-15.725044,感:-7.790172,岢:-16.235870,嚦:-14.936587,伫:-17.334482,谭:-12.278236,枰:-15.725044,圻:-10.542137,疼:-10.316976,儿:-6.345957,賂:-10.794896,桅:-14.444110,扉:-11.164871,籍:-8.726717,棚:-9.903182,幡:-13.364190,剩:-10.776284,致:-7.364551,延:-9.126263,壺:-10.312505,闼:-15.031897,勾:-11.468014,鞅:-12.304044,鶉:-12.880135,戌:-13.016994,辕:-11.203255,渔:-12.098040,鄖:-16.235870,娜:-8.602500,枥:-14.695425,涩:-10.818289,輪:-8.454870,厭:-10.474867,鲳:-14.849575,徵:-12.749514,芷:-10.971454,机:-6.182182,派:-7.552315,附:-10.216466,竇:-12.210518,鱈:-15.388572,惋:-15.542722,彊:-17.334482,泓:-12.158332,勗:-13.223608,廟:-8.214395,蟥:-13.309130,晤:-10.824224,班:-8.124742,年:-5.257380,毽:-15.725044,儁:-17.334482,耋:-15.031897,羊:-9.620697,谓:-8.084632,殒:-15.137257,钘:-15.137257,垚:-15.948188,骜:-13.160095,縟:-14.002277,肠:-9.141358,蚤:-12.759771,貨:-8.894818,倫:-8.924874,侪:-14.561893,犬:-11.129924,嘯:-10.242740,碰:-11.849685,诒:-13.808121,仔:-11.236408,鉗:-13.256944,顛:-10.995888,矚:-13.003749,孝:-10.182213,緞:-11.268374,董:-11.194597,火:-7.860470,癯:-13.723564,米:-6.656244,黴:-10.653627,諼:-15.542722,湿:-9.958600,邁:-10.866783,喃:-10.503608,隅:-10.689391,宇:-8.658918,芍:-13.422459,躕:-13.240137,演:-8.107875,逖:-13.779134,窝:-10.043507,舢:-15.031897,醫:-9.108979,踪:-9.367548,劭:-13.422459,鞯:-14.936587,琮:-12.364669,庵:-10.469634,获:-9.088573,昺:-16.235870,痃:-17.334482,剂:-8.234068,靄:-12.421827,篇:-8.927997,懋:-13.144827,柏:-10.159758,轔:-16.235870,受:-7.166133,胡:-10.359068,狭:-13.291431,绵:-10.289577,聶:-14.936587,尉:-9.635546,贓:-11.410226,丕:-11.781522,猗:-14.769533,傖:-14.626432,閘:-11.311034,缟:-15.137257,膠:-9.631926,攣:-11.601141,欧:-9.323127,趨:-10.347915,圯:-14.289959,鸵:-17.334482,殼:-9.263576,净:-9.054785,飆:-13.085987,才:-7.141576,桑:-10.053096,諒:-9.856878,糞:-12.407228,拢:-10.552290,哮:-11.900760,絳:-13.868746,捷:-9.278372,诼:-15.031897,龉:-13.596812,縈:-14.076385,趕:-10.030639,气:-6.564230,嘘:-11.610897,锚:-12.337270,採:-9.290819,斥:-9.719677,銫:-17.334482,贪:-13.933285,钯:-15.388572,貿:-8.957931,漾:-11.801092,鉀:-11.434585,鑄:-10.787696,职:-7.767937,詐:-10.636214,滓:-13.620910,韙:-13.750963,癘:-14.038645,駝:-10.719756,菡:-12.791187,藥:-7.648280,迩:-11.420979,燭:-10.103195,偬:-13.527819,篱:-12.538691,饲:-13.620910,槽:-10.122187,轾:-14.769533,頇:-14.626432,萏:-15.388572,隘:-11.383839,喚:-9.635546,颜:-10.082428,從:-7.896608,别:-6.432221,鄭:-11.692575,炬:-10.575227,启:-9.583007,鬱:-9.534729,帳:-10.575227,獁:-14.501269,畅:-10.093832,哄:-11.284748,廈:-10.365632,蟎:-14.936587,角:-7.933934,遗:-11.287110,珖:-17.334482,驛:-12.278236,佩:-10.241908,淪:-12.749514,瑯:-11.303797,繳:-11.192445,鳴:-9.327115,蛸:-15.948188,裼:-16.641335,垃:-14.243439,甄:-14.769533,妇:-8.305544,缈:-11.963844,皙:-12.699753,團:-6.886521,夜:-7.929644,鸞:-12.181190,抡:-15.031897,撥:-10.677755,谪:-13.696896,傭:-10.748310,岵:-17.334482,戶:-7.307008,携:-11.610897,渾:-11.294227,婆:-8.337954,届:-7.969277,族:-6.214540,赔:-11.996944,雙:-8.699506,祜:-12.823622,苡:-14.198988,蓥:-15.388572,热:-8.350415,公:-7.683116,曹:-12.240732,葺:-11.171167,刁:-14.390043,鞘:-10.978374,笛:-11.131946,咚:-11.175387,庞:-11.434585,莠:-13.933285,辨:-10.319668,熬:-11.164871,唯:-11.785406,綴:-10.702480,恍:-15.137257,蛎:-12.729312,汕:-12.607094,噙:-15.948188,瓚:-12.607094,绞:-14.115606,蝣:-13.933285,乩:-13.900495,泪:-8.871534,釬:-13.463281,畯:-17.334482,鷴:-13.933285,慷:-14.695425,死:-7.669569,庇:-11.936319,融:-8.434478,昌:-7.623003,锖:-17.334482,熙:-8.951964,錚:-10.813861,帜:-9.853490,餞:-12.643134,蜢:-14.198988,接:-7.196278,账:-10.308055,垭:-11.766137,宵:-10.852905,收:-7.860010,費:-7.292755,挺:-10.401059,調:-7.520700,烃:-11.448378,坂:-13.129789,织:-6.802919,擋:-9.867111,豐:-9.305375,詔:-10.904762,灘:-9.425360,菥:-17.334482,桨:-11.263744,短:-9.367548,噬:-11.637388,酮:-11.805053,齲:-14.561893,婴:-11.156538,唁:-12.124996,逃:-10.247744,包:-8.616964,萋:-16.641335,憎:-12.021276,厚:-8.454314,妞:-12.903665,含:-8.909404,霭:-12.421827,脹:-9.460884,悸:-11.569291,哀:-10.710417,獅:-9.824051,祉:-13.620910,鯊:-13.750963,浑:-11.294227,彝:-12.823622,驟:-10.284359,柢:-15.725044,淦:-12.990676,晷:-13.670920,胸:-10.523238,軼:-12.780605,銅:-9.992350,颉:-13.402656,誕:-11.080653,炙:-14.501269,蘢:-13.364190,报:-7.029571,谦:-10.134057,訪:-8.449456,岱:-12.141525,馳:-9.943067,搶:-10.954359,访:-8.449456,栾:-15.948188,镀:-13.256944,燃:-10.241908,屆:-7.969277,饈:-13.645602,旋:-9.173107,蝌:-17.334482,描:-10.657398,赐:-10.376985,槓:-11.732363,乒:-13.900495,黝:-12.259308,察:-7.458777,若:-8.364050,楨:-10.015942,遮:-14.338750,葶:-15.948188,惹:-11.805053,艺:-7.946665,佼:-13.900495,衾:-17.334482,吁:-9.959853,皂:-11.550657,茏:-13.364190,褓:-12.903665,紛:-8.538900,龜:-10.574067,增:-8.887497,愣:-12.823622,瞬:-11.523341,匯:-9.054024,鰱:-15.255040,綰:-14.198988,箴:-15.255040,踽:-14.695425,瑁:-11.287110,胎:-9.697248,軒:-9.290819,轧:-12.061482,畫:-8.097110,櫪:-14.695425,韬:-11.940854,僮:-13.003749,杷:-12.709509,瘀:-12.607094,劃:-6.834606,稈:-11.866422,辑:-7.229320,渐:-7.921364,霖:-9.091199,刘:-11.330595,綝:-16.641335,輦:-13.550292,献:-8.221093,紲:-15.725044,款:-7.880020,陀:-10.161290,櫓:-15.031897,衔:-10.042145,哗:-11.160696,牘:-12.152698,廛:-13.596812,壟:-14.289959,臥:-11.080653,恤:-12.001763,诩:-12.506168,翱:-14.338750,鵲:-11.650902,蝶:-10.610649,腺:-9.702081,鈃:-15.137257,嬉:-13.003749,蘋:-14.501269,休:-9.226461,訓:-8.245406,銘:-9.588614,縛:-10.554560,鲜:-8.390193,实:-6.510512,肤:-9.114617,氧:-10.693300,侦:-13.463281,誨:-11.532364,锭:-11.026383,餵:-13.779134,碴:-13.779134,茹:-10.781974,主:-6.502084,贽:-13.573282,沼:-11.678490,睁:-11.488043,囀:-14.936587,等:-7.221098,潑:-10.472771,燚:-16.641335,嵝:-16.641335,既:-14.289959,癫:-12.066624,铬:-14.038645,灯:-8.581584,叮:-14.243439,已:-7.910968,飴:-14.156428,購:-8.639310,桿:-9.380461,嶇:-11.758533,笈:-11.987374,阖:-13.750963,通:-6.685753,粝:-14.849575,檩:-17.334482,咭:-15.948188,薷:-14.695425,昶:-13.160095,覿:-16.235870,樾:-13.256944,呂:-11.996944,魈:-14.289959,塊:-7.639126,毓:-12.580892,鳝:-11.470851,杠:-11.732363,胥:-10.810920,啬:-12.572308,彰:-10.849847,奴:-9.422791,泽:-8.842607,倅:-17.334482,鴇:-12.915641,娉:-13.779134,脏:-9.250228,丑:-10.780549,沒:-9.367895,鎘:-14.444110,缛:-14.002277,媞:-15.031897,挣:-14.002277,洧:-14.849575,亦:-11.125892,讨:-9.341537,疬:-14.338750,船:-8.242475,涼:-9.328781,铂:-13.933285,凄:-14.390043,俐:-11.169064,桕:-11.526339,镗:-14.444110,盖:-8.618438,竞:-12.498200,荣:-7.914367,擢:-13.016994,赧:-14.626432,滦:-13.808121,睫:-12.021276,棪:-17.334482,敷:-12.240732,馁:-12.304044,砀:-17.334482,劇:-7.935755,閉:-8.679093,亏:-9.991056,膑:-13.160095,昔:-11.781522,尘:-9.430147,锞:-16.235870,两:-8.860405,斩:-12.392839,钳:-13.256944,放:-7.236580,鹄:-13.505841,兆:-10.364691,棋:-10.019264,坊:-9.112465,滏:-17.334482,虔:-14.849575,嫗:-13.505841,鷙:-14.156428,桠:-13.030417,迥:-14.626432,藩:-11.008332,噴:-11.996944,淹:-12.222494,揽:-10.816811,蕾:-10.125882,鈇:-17.334482,踏:-10.863682,涎:-13.030417,排:-8.040996,稗:-17.334482,妖:-13.274039,瀛:-12.903665,銜:-10.042145,瘟:-14.076385,氣:-6.564230,戧:-13.550292,蒨:-14.390043,窬:-15.948188,吳:-10.392325,费:-7.292755,沸:-11.849685,押:-10.093832,祁:-12.506168,罅:-15.255040,哈:-9.217468,跎:-14.198988,慑:-11.008332,驗:-7.140753,遛:-17.334482,陟:-14.769533,痞:-12.834672,佥:-13.645602,懦:-12.514200,硫:-11.817029,繯:-16.641335,差:-8.422278,史:-6.616094,恻:-13.779134,俺:-15.725044,颁:-14.501269,缄:-15.725044,钉:-10.819769,認:-8.233622,蚕:-11.396946,朔:-11.945410,鸚:-17.334482,訢:-15.255040,溥:-10.481183,伤:-7.929068,耦:-17.334482,讷:-12.791187,膻:-14.038645,渺:-12.385722,構:-6.844625,腐:-9.747171,凛:-11.067281,域:-6.913720,裡:-5.508631,楠:-10.396197,潤:-8.247666,竭:-10.417767,兰:-7.494307,蹺:-11.581909,拽:-15.137257,帅:-8.656191,炆:-15.137257,吉:-9.445398,蔓:-12.414501,抒:-13.723564,鶘:-14.156428,庚:-10.904762,真:-7.819529,薨:-16.235870,夫:-7.143112,騭:-13.837974,弯:-10.622742,週:-7.975722,唳:-14.243439,阵:-7.924471,涸:-12.036165,苒:-13.345498,晕:-10.301858,绚:-13.750963,剝:-12.378655,赣:-11.739771,荧:-13.550292,惦:-16.235870,歷:-7.735077,跸:-12.652351,板:-7.720545,稀:-9.832847,栌:-15.388572,成:-5.488461,帘:-10.649870,倜:-13.291431,霞:-8.374399,殡:-13.114974,缮:-10.230338,芻:-13.402656,洺:-17.334482,蒿:-11.333067,练:-7.746733,奂:-13.696896,陈:-10.740068,啊:-14.002277,行:-5.221885,低:-8.193920,針:-8.495785,哟:-10.831692,诡:-15.388572,代:-5.962452,汤:-9.908528,晨:-9.029245,塬:-14.076385,圉:-17.334482,疊:-10.204383,谏:-10.689391,澎:-12.880135,憒:-14.501269,爛:-9.514444,誠:-15.255040,渣:-11.508482,性:-5.900037,錱:-17.334482,锵:-12.284626,悼:-11.936319,峄:-16.235870,囈:-14.198988,闊:-8.989739,迎:-8.644344,敕:-13.779134,顗:-17.334482,鉛:-12.990676,線:-6.590441,鋰:-12.141525,桷:-16.641335,軸:-10.397168,骁:-13.191347,約:-7.353154,眈:-12.634002,袍:-9.704021,芑:-16.235870,攔:-10.345147,騖:-13.596812,弘:-10.675188,蠢:-11.022747,沥:-13.240137,鮫:-14.444110,鶯:-11.862211,縮:-8.972774,励:-8.837287,瀲:-16.641335,覷:-10.922664,显:-8.044776,靈:-8.384598,毋:-17.334482,告:-7.074124,乎:-7.264633,荐:-8.920208,染:-8.500145,姗:-11.123882,罘:-14.695425,叛:-10.507937,郝:-13.808121,煜:-11.627372,嗟:-16.641335,諡:-15.388572,俣:-14.002277,杨:-9.511637,狱:-9.415489,印:-9.121914,遲:-9.902590,虾:-11.022747,威:-8.195745,嘉:-9.732580,贏:-10.877712,蜓:-12.482452,悒:-14.936587,猛:-9.606506,岚:-10.585722,醜:-10.780549,生:-5.248094,漣:-13.620910,愧:-9.822957,螨:-14.936587,頭:-5.905971,现:-5.880108,圳:-9.392475,鐵:-8.374528,疴:-14.002277,耽:-13.779134,鋆:-13.750963,扑:-10.809452,饗:-15.031897,竖:-12.066624,鍛:-14.198988,盞:-10.496077,拦:-10.345147,间:-5.641412,楷:-11.231923,捻:-14.769533,臼:-12.385722,境:-7.035883,嚇:-10.668798,醉:-9.691958,辍:-14.501269,渌:-14.561893,搐:-11.710464,涡:-11.229689,憩:-12.506168,鲫:-15.031897,喱:-14.849575,洶:-11.837314,欺:-12.323847,愾:-12.071792,驄:-12.337270,商:-7.708990,半:-8.359231,蹌:-11.216385,駙:-15.137257,癜:-13.527819,募:-11.082578,跡:-8.010277,池:-8.770405,该:-7.272837,恨:-9.331788,饮:-10.562546,剴:-13.100375,赶:-10.030639,柽:-15.725044,腾:-8.935847,頃:-8.760153,嬅:-14.501269,疆:-9.016472,儉:-10.837707,谋:-8.900018,伍:-8.311315,题:-6.145723,琛:-10.599890,定:-5.331573,障:-8.364940,負:-8.730928,誤:-8.151204,昧:-10.851375,纬:-9.647861,環:-8.581742,犴:-14.002277,嫄:-16.641335,煉:-9.108443,鏊:-15.725044,觎:-12.222494,救:-8.598314,蟒:-12.759771,捕:-8.915563,鹗:-12.271887,坝:-9.616241,衣:-8.384598,虧:-9.991056,旦:-8.456682,姮:-17.334482,铰:-17.334482,裸:-11.728680,承:-8.833418,鲁:-9.558366,紀:-7.002855,妃:-9.439791,骅:-11.240912,笄:-15.137257,躍:-15.255040,圜:-17.334482,逞:-11.809029,没:-9.367895,踢:-13.085987,萦:-14.076385,航:-8.653810,庭:-7.840166,咱:-17.334482,樺:-11.017317,秃:-12.317202,幂:-14.115606,魄:-10.233630,呆:-10.341467,酈:-14.561893,淋:-10.927602,削:-9.788564,每:-11.496751,荔:-12.801882,志:-7.137467,飙:-13.085987,睜:-11.488043,叟:-13.256944,賡:-12.791187,浠:-14.561893,此:-6.294605,慨:-9.759410,续:-6.955444,彬:-9.786453,陲:-11.306203,却:-9.801323,棹:-16.641335,聾:-11.853843,封:-8.648897,餃:-13.402656,纂:-11.094206,娅:-10.956056,震:-8.708793,璆:-17.334482,倉:-10.313398,犊:-12.903665,不:-7.496013,脓:-12.729312,缗:-16.641335,岖:-11.758533,媚:-10.391359,亢:-10.879283,认:-8.233622,朧:-10.807987,鸭:-11.637388,伷:-16.641335,蠹:-15.388572,籁:-12.965034,寄:-12.297529,湍:-14.198988,糖:-9.225257,镛:-13.240137,噝:-17.334482,滢:-12.124996,擦:-10.505770,壮:-9.184014,闰:-13.100375,煳:-16.235870,觸:-8.557081,馅:-13.144827,事:-6.025375,氌:-13.144827,怔:-13.100375,娘:-7.598053,餚:-9.424258,疝:-17.334482,澡:-11.154465,财:-9.378005,掩:-11.360672,颯:-12.880135,笮:-15.948188,銳:-9.304398,甲:-8.682233,况:-6.634298,買:-8.844454,漶:-15.725044,肿:-9.911511,挾:-12.103373,滋:-11.150333,虐:-11.442838,拓:-10.157463,联:-7.779276,四:-8.281146,瑜:-9.783821,桤:-15.948188,屬:-7.477248,镲:-17.334482,側:-7.923407,轶:-12.780605,毹:-13.967186,弁:-13.383238,熊:-10.225420,骘:-13.837974,钜:-14.769533,瀟:-11.465185,樣:-5.715999,袤:-12.671043,芨:-16.235870,師:-6.734279,堯:-10.806524,皰:-13.071802,謹:-10.235280,檸:-14.444110,蔽:-10.157463,撼:-10.730538,鷂:-13.645602,释:-8.216915,浍:-17.334482,村:-7.465896,慕:-9.960480,鱗:-12.001763,孙:-8.963008,珞:-13.345498,詣:-10.871452,硯:-11.585089,寮:-14.769533,郴:-16.641335,諸:-10.981853,恿:-12.082208,缀:-10.702480,它:-8.410891,颅:-11.303797,喇:-12.364669,例:-7.557522,洌:-15.725044,朐:-14.501269,鈞:-9.212111,传:-7.795557,谢:-8.582691,岭:-8.284897,種:-5.414839,鎳:-13.808121,琲:-17.334482,債:-9.765586,膿:-12.729312,戾:-12.092735,层:-7.258891,症:-9.030729,赌:-11.940854,腔:-9.231895,铝:-11.977896,畜:-10.077479,裥:-15.255040,嵬:-14.156428,鑲:-13.573282,兴:-7.647473,蹶:-16.641335,艾:-11.211989,币:-7.822483,鬃:-13.364190,堅:-9.485938,皆:-12.076987,炊:-12.990676,檎:-14.626432,撒:-10.959457,紗:-9.939989,庖:-14.198988,办:-7.760332,欣:-10.148338,莨:-15.948188,鰭:-10.125142,綬:-12.624952,夯:-12.337270,阱:-10.990601,瞰:-10.628843,逵:-10.202783,落:-7.672556,於:-14.936587,繁:-9.600361,硅:-12.181190,集:-7.373480,又:-12.845846,郊:-9.486329,恕:-11.229689,靛:-14.444110,磚:-10.557975,狞:-11.883443,乡:-7.811450,波:-7.789671,曦:-11.234163,祯:-9.036689,哲:-10.379843,海:-6.537011,件:-6.277452,诸:-10.981853
+#M
+耀:-8.476517,蘄:-14.372296,涉:-10.560093,谈:-8.345223,伊:-8.021847,預:-10.938309,洞:-9.547990,咣:-15.065443,猢:-12.868219,媧:-13.812680,礦:-8.994706,鶩:-13.812680,缪:-11.751257,河:-7.144452,临:-9.040786,吸:-8.945146,娼:-15.065443,线:-7.755896,談:-8.345223,反:-7.752890,牌:-9.660516,雏:-11.715539,姑:-8.381457,織:-7.493455,遠:-7.471565,卢:-9.425311,知:-7.315690,除:-9.782240,緩:-10.022018,彪:-11.163471,歲:-10.565634,闹:-9.441426,廿:-12.357393,覆:-9.201812,閎:-14.659978,应:-7.206030,檜:-12.020921,儡:-13.193641,崩:-10.221256,芬:-9.480069,冶:-9.189109,骼:-11.751257,赉:-12.868219,鍍:-15.758590,湟:-15.758590,瑣:-14.372296,鏢:-10.938309,峨:-14.372296,括:-11.292682,棰:-15.758590,滴:-10.290530,须:-9.818419,孽:-11.866770,鹿:-9.150590,沉:-9.090362,贈:-12.232230,上:-6.827435,后:-7.650268,碑:-11.315939,餐:-10.549104,怖:-10.038279,蒙:-7.755562,邡:-15.065443,憫:-12.667548,枯:-11.376564,伴:-11.401882,离:-8.076569,羿:-13.456005,浈:-15.758590,釋:-9.923780,壑:-12.426386,祐:-13.456005,罔:-11.553898,櫝:-14.659978,譜:-9.938507,号:-8.918044,灶:-11.733239,姻:-11.114200,忿:-12.714068,节:-8.513649,袆:-15.758590,厌:-10.831337,钎:-12.925377,紓:-12.986002,茗:-11.974401,褛:-14.372296,倡:-11.236802,熠:-11.631456,锣:-10.387952,鬧:-9.441426,稽:-10.875788,拂:-10.708734,克:-5.821330,坏:-9.845087,胖:-10.156472,賞:-9.999689,几:-6.995944,筧:-15.758590,巨:-9.385271,腫:-9.971693,赳:-12.147673,齿:-10.160168,萄:-7.885373,挖:-13.273684,嚣:-11.339750,符:-9.810555,披:-11.376564,蜮:-13.119533,褲:-12.147673,锺:-13.050540,所:-6.377242,摄:-11.247731,凍:-10.728152,灌:-10.891056,兢:-9.730312,学:-4.878752,翩:-11.049060,臭:-11.351871,诱:-13.193641,践:-10.652645,嫻:-12.095029,标:-8.232950,予:-10.360428,越:-8.850835,琏:-11.183879,馒:-14.659978,岔:-10.938309,耗:-10.702345,訛:-11.481924,谟:-10.683417,匡:-10.213413,弩:-10.538235,誰:-11.095151,洵:-13.812680,貴:-7.992597,隸:-8.674364,颼:-11.951928,懂:-10.838609,毆:-15.065443,轉:-8.393410,配:-9.649343,秒:-11.553898,菖:-13.193641,江:-5.949578,连:-7.150460,遷:-10.538235,相:-6.820059,驻:-11.183879,好:-7.612461,鱿:-12.391295,撅:-15.758590,溉:-12.203242,嘎:-10.795746,窑:-10.946406,或:-9.530079,垣:-10.652645,钥:-12.762858,簪:-13.561366,斯:-5.478483,澳:-9.858693,鐺:-12.925377,綿:-9.638293,鸾:-12.500494,仉:-15.065443,煌:-10.186436,筐:-14.659978,曙:-9.495192,乞:-12.539715,婦:-9.730312,绩:-11.247731,普:-7.681764,諱:-11.788299,寻:-9.267867,飽:-10.102599,會:-5.035852,侈:-9.980938,册:-10.116683,階:-6.535334,缓:-10.022018,講:-9.813170,榜:-10.342490,负:-9.266351,疤:-15.758590,羨:-10.860751,樱:-10.987906,记:-7.668801,庾:-12.357393,泊:-9.341858,遍:-9.656032,問:-8.539681,盎:-11.524484,当:-6.781696,叠:-9.638293,督:-7.312464,郢:-15.758590,髦:-13.812680,荫:-10.721638,酷:-11.866770,矸:-13.561366,舄:-13.679149,箕:-14.659978,攖:-13.966831,挚:-14.372296,閡:-15.065443,傣:-11.553898,座:-8.978669,撫:-9.361661,梳:-12.868219,帼:-12.069711,窿:-13.360695,餾:-11.236802,胃:-12.426386,案:-9.040786,癌:-11.163471,聘:-8.708468,鑠:-13.561366,鉤:-13.273684,秩:-12.714068,慮:-10.860751,诵:-12.714068,當:-6.781696,釹:-15.758590,峻:-10.290530,獺:-14.659978,祾:-15.758590,螂:-12.175071,變:-7.792351,岐:-11.826765,溜:-9.526142,訟:-10.075011,璠:-15.065443,連:-7.150460,天:-5.927674,札:-11.715539,洱:-11.647717,缽:-12.262083,麼:-7.246008,淆:-12.147673,呋:-12.762858,燎:-13.273684,鵑:-8.965124,習:-8.547772,晗:-12.020921,汛:-13.273684,機:-6.512979,灣:-7.724932,勤:-9.248332,葫:-10.374095,鯪:-13.360695,曬:-11.123861,良:-7.521905,泰:-8.100835,陷:-10.269653,兹:-8.818368,综:-10.282127,驿:-12.667548,茄:-11.647717,窕:-13.360695,搖:-8.014454,戚:-11.163471,钡:-12.868219,斫:-14.659978,綻:-12.814151,鈺:-9.720719,弼:-9.990269,过:-7.515045,結:-7.656004,答:-9.772138,婪:-14.372296,執:-9.383566,瑶:-9.383566,巻:-13.679149,牺:-11.123861,寿:-8.277598,蚂:-11.929949,麒:-10.930277,贛:-11.183879,丝:-8.275909,澜:-10.475387,吡:-13.360695,別:-7.616527,昭:-8.573961,亲:-8.521531,樵:-14.149153,瀹:-15.758590,總:-7.343430,墾:-13.119533,泆:-13.561366,降:-9.065267,协:-7.555286,绒:-10.946406,驕:-11.788299,浛:-13.561366,離:-8.076569,古:-6.602178,姨:-9.333721,柬:-13.193641,药:-7.789233,幽:-10.853316,翼:-9.038370,极:-7.602080,殉:-12.762858,計:-6.645532,禕:-11.441102,些:-8.938574,愚:-12.667548,劣:-10.774984,產:-4.988570,暫:-14.659978,礪:-13.679149,悯:-12.667548,丰:-8.642196,檳:-11.524484,贲:-12.925377,券:-8.634112,尼:-6.332494,資:-6.304755,雋:-11.866770,郏:-15.758590,忑:-10.860751,髓:-10.898778,艘:-15.758590,燥:-11.364141,彦:-8.404228,篩:-13.360695,奪:-8.975265,据:-7.294587,鏹:-15.758590,签:-11.807347,辆:-11.510095,瘋:-10.774984,和:-5.539088,瀏:-13.456005,庐:-12.069711,折:-8.977533,蠟:-11.481924,鈣:-10.930277,炤:-15.065443,窨:-12.121004,漱:-11.058110,袴:-14.372296,宾:-9.006320,證:-7.689561,槊:-13.050540,偏:-10.677186,緒:-8.701553,湛:-9.903518,诞:-9.984039,因:-8.152203,闢:-10.611096,虫:-8.838907,擬:-10.346944,聯:-6.777789,詳:-11.769606,卹:-11.647717,狸:-11.058110,顿:-9.286244,蜀:-11.104630,悅:-9.627364,檉:-15.758590,锌:-11.733239,鼐:-11.364141,芙:-10.576807,供:-8.928797,貝:-8.088628,樞:-9.131873,琢:-12.147673,枫:-11.510095,估:-11.040092,谲:-13.812680,阶:-6.535334,禿:-10.914403,杀:-9.576506,韋:-9.752237,响:-8.391513,界:-6.650504,量:-8.357970,罐:-11.031203,壕:-14.659978,拙:-14.149153,赜:-13.812680,盡:-8.473084,靠:-9.439622,扮:-11.553898,汲:-13.561366,嗷:-12.147673,忻:-12.762858,姿:-10.035005,蒂:-8.359192,洇:-15.758590,看:-10.225201,銎:-15.065443,徐:-10.506317,蔗:-12.357393,掘:-11.247731,輛:-11.510095,倥:-12.580537,娩:-13.456005,搭:-10.860751,辰:-9.701806,爹:-14.372296,簽:-11.807347,擂:-13.193641,敗:-8.470346,潛:-8.680249,胚:-11.951928,埠:-10.774984,铢:-11.376564,凤:-7.595219,寨:-9.889294,飪:-15.758590,旬:-13.119533,乱:-8.403588,長:-13.561366,饿:-12.925377,箍:-10.611096,崎:-9.081507,逐:-8.850835,阔:-9.932590,趙:-10.120236,漚:-15.758590,焦:-10.987906,閩:-11.866770,溯:-11.664246,贮:-11.929949,茲:-8.818368,尸:-10.527482,皿:-15.758590,桀:-12.762858,賃:-13.119533,俅:-13.812680,苇:-12.069711,穌:-13.050540,凑:-12.814151,淙:-13.360695,佚:-15.758590,孢:-12.262083,翥:-13.050540,鹤:-8.596193,坪:-11.031203,语:-8.528752,浮:-10.075011,鷹:-11.351871,僻:-11.751257,囿:-13.679149,弥:-8.135926,纤:-9.145206,鈧:-13.273684,璨:-13.360695,朵:-10.962800,紹:-8.462177,鲸:-11.058110,喾:-15.758590,毂:-10.898778,轅:-11.584203,蕉:-10.728152,魍:-13.360695,晟:-9.962533,牧:-8.150216,哨:-12.623096,衫:-10.044858,韪:-13.812680,櫬:-15.758590,惰:-14.659978,葳:-14.372296,更:-9.104438,驷:-10.186436,狼:-9.959498,梁:-9.078991,溅:-13.812680,窍:-10.768158,導:-6.352437,划:-7.642173,栖:-9.239443,渚:-12.232230,芝:-9.920860,搞:-14.372296,麥:-8.874104,钩:-13.273684,榫:-15.065443,瘪:-14.372296,瞿:-14.149153,鐾:-14.659978,跃:-8.376466,仅:-8.107470,菇:-12.045018,效:-7.863527,僑:-10.605299,赘:-15.758590,荜:-14.149153,婢:-12.357393,绥:-11.292682,噪:-11.031203,諭:-11.769606,俯:-13.966831,胱:-11.376564,击:-7.258137,瑾:-10.689686,侄:-14.149153,指:-8.273099,肆:-12.580537,蚊:-12.814151,完:-9.701806,謗:-12.814151,脛:-11.807347,堡:-9.764629,鴣:-12.986002,帥:-9.821054,群:-8.139848,吩:-15.758590,爽:-10.824116,葉:-7.699630,奋:-8.844853,驍:-11.951928,陕:-12.462754,束:-10.038279,忤:-15.065443,郦:-15.065443,雪:-7.214950,软:-9.134525,柴:-11.049060,魷:-12.391295,屹:-12.020921,殁:-15.758590,言:-6.041312,涅:-9.441426,谄:-15.065443,枉:-10.802763,禍:-10.116683,頌:-10.213413,玑:-11.401882,鈐:-13.812680,儒:-9.595276,欖:-9.900657,辙:-15.065443,膝:-11.929949,傧:-15.065443,脲:-14.372296,常:-5.508150,值:-8.150712,姍:-9.599495,发:-6.277994,奢:-11.427857,卦:-10.501095,矩:-10.883393,陨:-15.758590,啪:-11.143470,潮:-9.230633,菱:-11.631456,勻:-12.292855,哿:-15.065443,睾:-12.667548,程:-7.028223,薊:-12.986002,醒:-9.990269,伙:-8.001967,嬡:-15.758590,窠:-13.812680,鸣:-9.322440,粤:-10.064858,圩:-13.360695,芰:-15.758590,家:-5.057190,嶺:-9.197560,乃:-8.852837,揆:-15.758590,蝉:-11.664246,屏:-11.067243,翎:-12.868219,噓:-12.623096,燒:-9.578574,镕:-10.781857,付:-9.642698,扛:-15.758590,跚:-15.758590,峤:-13.966831,詫:-12.868219,闪:-9.412954,擴:-10.788777,顷:-12.667548,役:-10.511566,绸:-9.706501,鉻:-13.679149,兽:-11.215296,鑿:-11.866770,謀:-8.027976,沅:-9.363329,暉:-9.886473,蜈:-14.149153,碍:-10.054808,餌:-15.758590,錐:-9.428870,倒:-9.184910,肝:-10.109616,琪:-10.229161,涯:-10.816948,玻:-10.565634,儼:-15.758590,獐:-15.065443,韓:-10.480476,畔:-13.679149,湮:-15.758590,英:-7.095740,究:-6.574697,叻:-15.758590,都:-7.771746,百:-5.718956,袂:-12.925377,丙:-9.629540,鄧:-11.887389,嘩:-11.085762,亮:-9.338595,縹:-11.974401,佃:-12.020921,棂:-13.679149,拆:-11.846567,擊:-7.258137,額:-8.419702,绎:-10.217327,鉑:-14.659978,楗:-13.812680,論:-7.427004,俘:-12.762858,賚:-12.868219,飢:-11.401882,照:-8.772949,幹:-7.510323,偽:-10.435580,长:-6.113485,谀:-12.147673,疑:-8.880264,園:-8.614973,鈔:-12.462754,沫:-9.932590,猪:-10.922309,纷:-9.723109,汀:-12.069711,橄:-12.069711,蛇:-9.759654,忍:-10.068231,槙:-13.679149,柝:-15.758590,虜:-11.143470,形:-7.892635,驤:-13.966831,啦:-10.450323,遨:-15.758590,迭:-11.163471,杲:-11.908443,廷:-8.038129,勿:-11.269954,辂:-13.966831,昇:-15.758590,莊:-8.798243,梘:-15.758590,舟:-10.640597,躬:-10.677186,隼:-14.372296,赁:-13.119533,濂:-13.050540,屋:-10.217327,跖:-13.050540,诚:-8.924482,豫:-8.496663,滬:-10.229161,擰:-14.372296,聳:-10.640597,拴:-11.788299,盼:-10.816948,沁:-10.728152,悉:-11.974401,脈:-9.418231,锐:-10.406732,侗:-11.997390,氖:-15.065443,骥:-11.351871,琦:-8.066934,涫:-15.065443,爪:-12.262083,殯:-15.758590,夸:-10.831337,逾:-11.183879,慈:-9.545984,罌:-13.812680,哑:-12.020921,動:-5.561314,曝:-15.758590,鵠:-12.986002,幢:-13.812680,童:-9.068991,烩:-15.065443,剪:-13.193641,空:-6.996727,灾:-9.220451,紋:-10.130969,芊:-12.324603,後:-7.650268,笏:-14.659978,焓:-15.758590,果:-7.766322,綠:-8.196949,娥:-11.647717,霧:-10.853316,倩:-9.419996,熨:-12.203242,渭:-10.397298,薰:-12.623096,傾:-9.665021,豁:-15.758590,滂:-12.714068,嵋:-13.561366,鑑:-10.532844,盒:-12.121004,敛:-13.193641,损:-10.261422,胞:-8.878206,黢:-12.868219,赫:-8.746475,鋪:-11.631456,譯:-9.631721,旰:-12.814151,腳:-8.518658,援:-9.280081,齷:-12.986002,塹:-13.679149,掉:-11.974401,興:-7.146997,瞑:-11.454525,阐:-13.966831,途:-9.270906,挞:-12.986002,索:-8.243246,馥:-11.974401,咧:-10.646603,眦:-13.679149,溫:-8.832013,梯:-10.205631,吼:-13.561366,俁:-12.020921,扈:-11.769606,巍:-9.685546,籌:-9.647123,翡:-15.065443,坦:-8.248707,珩:-13.456005,仫:-13.966831,敲:-11.524484,祺:-8.995861,闽:-11.866770,膊:-11.615456,岌:-11.510095,鮎:-12.580537,閒:-9.448672,谗:-14.372296,纠:-12.292855,夥:-8.001967,鐧:-15.758590,責:-6.910943,朱:-9.351710,骸:-14.149153,钼:-12.580537,草:-8.222760,痒:-14.149153,汗:-9.894959,廠:-10.809831,壤:-10.652645,韦:-9.752237,曰:-11.539083,艳:-7.649967,惴:-11.095151,避:-9.001658,梅:-8.130073,皑:-12.462754,吒:-11.788299,炕:-14.659978,宣:-8.415164,喧:-11.769606,瘦:-11.095151,嬸:-11.997390,瞻:-10.186436,鈾:-14.149153,仁:-7.919065,诃:-11.123861,囑:-12.391295,睐:-13.273684,僕:-9.779705,乖:-12.667548,識:-7.238003,绡:-14.372296,屢:-11.468131,賭:-14.372296,巷:-11.269954,凿:-11.866770,貂:-12.292855,嶌:-13.679149,钒:-12.714068,殘:-9.562146,斜:-10.576807,利:-5.607657,昱:-10.695995,庶:-13.119533,劾:-14.149153,衅:-11.846567,惊:-8.357359,奏:-9.316050,卓:-8.941855,瓒:-12.391295,違:-11.997390,苞:-12.357393,忠:-7.622072,叨:-11.067243,襯:-14.149153,柰:-15.065443,命:-7.018574,酿:-15.758590,退:-9.588980,瞅:-13.966831,阄:-15.758590,弊:-14.372296,舌:-9.633907,踔:-15.065443,废:-9.534032,炫:-11.539083,漪:-12.175071,键:-9.448672,堰:-7.709802,贾:-10.160168,铃:-9.365000,桐:-10.465286,賓:-9.006320,兖:-15.758590,痙:-14.659978,坚:-9.480069,查:-8.442042,囯:-15.758590,駱:-14.659978,慶:-7.162586,藹:-10.946406,仿:-11.751257,傀:-12.814151,球:-7.570179,鎂:-11.414785,馆:-9.558081,昏:-9.690165,氓:-13.193641,讒:-14.372296,五:-6.177791,璘:-15.758590,窜:-13.456005,鸟:-10.038279,悠:-10.171342,單:-9.335343,礱:-11.664246,缵:-14.372296,改:-8.627692,蒸:-10.249202,欽:-9.662766,誼:-10.068231,珂:-11.647717,秆:-14.372296,翊:-8.522251,旎:-13.360695,毒:-8.634112,触:-10.078418,迪:-8.163706,独:-8.197469,维:-6.426741,艷:-7.649967,蹿:-12.868219,霄:-10.303269,堆:-12.986002,粉:-9.980938,褐:-9.091634,輔:-9.787329,钙:-10.930277,股:-9.186308,販:-10.652645,鐮:-13.966831,掷:-12.462754,耶:-8.733941,榻:-13.360695,仕:-9.676372,潔:-8.564154,镘:-15.758590,属:-8.613394,惡:-9.002821,巳:-12.262083,恶:-9.002821,智:-7.502762,汾:-12.175071,冀:-9.457805,垄:-11.733239,领:-8.433441,蔣:-12.580537,涨:-11.104630,爭:-7.859808,鎬:-12.292855,樽:-13.360695,讼:-10.075011,啃:-13.360695,狂:-11.281254,际:-6.229215,鱉:-14.372296,绊:-12.667548,擎:-11.826765,祛:-13.050540,罟:-15.758590,鳞:-10.130969,散:-9.186308,歧:-10.495900,称:-9.295561,荷:-10.009197,轿:-11.153420,鈀:-15.758590,而:-6.275098,涕:-10.891056,媛:-9.658271,甚:-9.662766,辩:-10.628692,洪:-7.372417,倬:-13.273684,纳:-7.536305,尴:-15.065443,茶:-9.834335,檻:-13.456005,蔺:-13.561366,沿:-11.315939,叁:-15.758590,橐:-15.758590,卖:-9.203234,陘:-12.462754,握:-13.193641,日:-6.444972,廳:-11.715539,捶:-15.065443,蟹:-12.462754,咄:-10.425872,搏:-11.599707,逗:-12.925377,抠:-15.065443,垮:-12.500494,妲:-15.065443,椽:-14.659978,緊:-9.568275,乓:-9.489494,籟:-11.281254,桧:-12.020921,详:-11.769606,跪:-15.758590,六:-6.537310,鹳:-14.149153,職:-8.229184,書:-6.211207,犁:-10.538235,锄:-14.659978,尊:-9.183515,謐:-14.372296,冗:-15.758590,隙:-11.427857,宛:-10.078418,额:-8.419702,玫:-11.095151,疯:-10.774984,阮:-12.539715,嬰:-11.351871,崴:-14.659978,舶:-11.481924,勁:-9.105727,廉:-9.974765,慌:-9.189109,藏:-7.698050,歐:-9.365000,浔:-13.966831,剖:-10.286320,荠:-13.966831,滩:-11.887389,轨:-11.698147,叫:-9.996539,郭:-10.387952,癮:-12.667548,扶:-10.329245,湾:-7.724932,善:-8.150216,骆:-14.659978,很:-11.067243,攏:-12.069711,漓:-10.774984,掠:-11.292682,斤:-10.754644,醬:-11.647717,稱:-9.295561,鶴:-8.596193,栽:-12.292855,烂:-9.588980,奇:-8.076108,鹉:-11.715539,糊:-8.613394,体:-6.722246,棒:-9.821054,豕:-14.659978,筛:-13.360695,铚:-15.758590,姜:-10.883393,點:-7.009016,俨:-15.758590,質:-7.556382,镯:-13.679149,練:-8.058748,鈄:-15.758590,須:-9.818419,谐:-13.360695,岛:-8.352487,产:-4.988570,犯:-10.425872,碳:-10.824116,娴:-12.095029,治:-4.974522,蓋:-8.656914,晌:-12.069711,苏:-7.928165,汐:-12.232230,燙:-15.758590,博:-7.417896,鹜:-13.812680,表:-4.813202,韭:-13.561366,煮:-12.500494,壳:-10.402004,署:-12.262083,捺:-10.145462,追:-10.269653,咀:-13.050540,戏:-9.082767,栓:-11.454525,阗:-11.887389,纜:-12.814151,护:-7.042055,梨:-8.750085,眭:-13.456005,紱:-15.758590,镁:-11.414785,偃:-13.360695,濒:-13.360695,闖:-9.795011,恣:-13.561366,湧:-10.294759,鑫:-9.772138,璁:-12.539715,销:-8.596968,錄:-9.358333,将:-8.353095,蒡:-14.659978,芥:-13.679149,侧:-11.510095,疫:-9.578574,横:-8.800142,环:-7.927767,禳:-14.372296,嬴:-13.679149,枷:-14.149153,似:-9.497099,殿:-9.564185,品:-7.628826,獄:-13.193641,祈:-12.357393,烙:-15.065443,绝:-9.437822,塞:-7.669722,拥:-9.395562,嗫:-13.273684,可:-6.167624,喀:-9.346772,厄:-11.123861,缇:-15.758590,妈:-8.552955,骊:-13.679149,候:-10.307552,熘:-15.758590,鴛:-12.147673,帝:-7.979542,鬟:-14.149153,榨:-13.812680,元:-6.117182,盂:-13.456005,鉅:-12.580537,竊:-10.708734,評:-10.316173,铖:-12.714068,絛:-13.273684,飞:-7.776174,慣:-9.414710,賦:-11.681053,山:-5.737764,婵:-11.339750,懸:-10.316173,濼:-13.360695,萌:-10.565634,踐:-10.652645,榕:-11.698147,焚:-11.631456,墟:-13.456005,笞:-15.758590,攢:-11.315939,让:-10.658724,听:-8.779445,炯:-10.506317,場:-7.475349,蛋:-9.015710,俑:-11.698147,桔:-12.814151,珙:-14.149153,党:-7.392453,緝:-10.549104,闭:-9.834335,絲:-8.275909,任:-7.696158,嚀:-12.814151,簇:-12.580537,怏:-13.273684,莎:-9.866946,樓:-9.051728,匙:-12.147673,鸛:-14.149153,谧:-14.372296,厮:-12.814151,挹:-15.758590,芸:-10.853316,洽:-12.580537,貼:-11.568936,剃:-15.065443,淒:-12.667548,勘:-12.714068,扣:-11.681053,迦:-10.290530,影:-7.782338,绰:-10.374095,驳:-12.203242,泼:-11.114200,衿:-15.758590,需:-9.818419,炅:-13.119533,帆:-9.917949,堊:-10.588106,瀚:-10.853316,稞:-12.539715,蚡:-15.758590,肥:-9.281618,渦:-14.149153,株:-12.121004,鰲:-12.147673,头:-6.561741,斷:-8.653625,榿:-15.065443,囁:-13.273684,着:-8.594644,鏃:-13.360695,僅:-8.107470,嫉:-12.121004,敌:-9.000496,仑:-9.335343,做:-9.777176,蝠:-13.966831,书:-6.211207,铭:-8.967369,凯:-8.902128,牮:-15.758590,籲:-9.962533,晶:-8.174326,苹:-12.095029,恺:-11.040092,賽:-8.661042,紇:-15.758590,守:-7.760927,朋:-8.129587,意:-6.777160,锗:-15.758590,则:-8.543350,尝:-9.278546,綜:-10.282127,憤:-9.757176,货:-8.056486,閬:-14.659978,縱:-10.102599,氽:-10.213413,趼:-14.659978,千:-5.794055,嵇:-15.758590,细:-7.581637,磊:-10.031743,蹑:-11.183879,雖:-13.119533,变:-7.792351,祟:-10.329245,捣:-12.324603,酯:-13.456005,翰:-9.277013,塵:-9.467021,轻:-7.492683,淼:-11.215296,西:-5.827731,禁:-8.112237,羅:-6.138461,儆:-12.095029,殍:-14.372296,憑:-11.631456,耐:-8.902128,枕:-11.258781,缚:-12.121004,欢:-8.980944,薩:-7.590104,未:-8.027537,纯:-8.863920,嘴:-9.926708,褶:-12.868219,悻:-12.121004,础:-9.230633,鳃:-13.193641,必:-7.632959,繄:-15.758590,鋇:-12.868219,恐:-9.706501,蓓:-10.728152,晔:-10.025249,奖:-9.483828,啞:-12.020921,早:-9.562146,士:-6.865292,絮:-9.762138,獲:-9.599495,韵:-10.092164,潺:-13.679149,菽:-14.659978,庄:-8.798243,栋:-10.741311,莒:-14.149153,崙:-9.335343,粘:-10.922309,匝:-12.020921,队:-8.310839,谣:-12.986002,焱:-11.631456,邰:-15.758590,厲:-10.269653,隴:-11.269954,貸:-10.543655,挽:-10.962800,則:-8.543350,乏:-10.622792,腑:-11.769606,插:-11.225991,蝕:-10.611096,穗:-10.795746,癟:-14.372296,询:-10.178861,令:-7.215924,执:-9.383566,顫:-12.020921,共:-5.411283,直:-8.004538,拼:-10.979467,倆:-15.758590,璉:-11.183879,锈:-10.582441,脐:-12.580537,宗:-6.570189,砖:-11.163471,军:-6.137864,躥:-12.868219,羯:-14.149153,殷:-11.040092,蠶:-11.058110,壁:-9.179339,祀:-12.292855,哉:-12.203242,歌:-9.343493,藓:-11.951928,糙:-12.391295,襠:-12.539715,滥:-10.781857,姫:-13.679149,籮:-14.659978,牲:-9.690165,桶:-13.812680,骂:-10.946406,径:-10.141819,椋:-15.758590,隊:-8.310839,漏:-11.929949,芒:-11.040092,初:-9.392120,责:-6.910943,严:-9.512484,澤:-6.055874,茧:-11.524484,劲:-9.105727,氹:-14.149153,人:-4.374135,鹅:-8.326107,升:-7.804921,益:-7.934544,住:-9.107019,拒:-12.500494,處:-7.781308,浣:-15.065443,捧:-9.749777,婭:-10.979467,镳:-13.812680,護:-7.042055,腻:-12.292855,匆:-9.845087,伎:-12.292855,舐:-15.758590,斕:-13.679149,龙:-6.908073,力:-6.577164,級:-7.041891,眞:-13.679149,计:-6.645532,攪:-12.292855,到:-7.739965,鄲:-12.020921,吴:-10.149119,丸:-11.085762,贺:-9.742433,黃:-8.168749,請:-9.273955,桌:-10.576807,鹘:-12.262083,遜:-9.883660,毡:-13.966831,詠:-13.561366,淥:-13.273684,駭:-10.576807,置:-8.731276,闵:-12.667548,迹:-10.416256,松:-7.854256,氏:-8.471714,易:-7.394315,頗:-11.339750,纘:-14.372296,炜:-10.485591,沤:-15.758590,暨:-12.986002,微:-8.395945,冲:-8.051078,电:-6.353177,钴:-14.372296,魁:-10.677186,假:-8.867981,荑:-15.758590,懒:-11.826765,牛:-8.613394,瑟:-9.711218,韞:-12.232230,奭:-15.758590,磬:-12.175071,危:-9.772138,狰:-12.175071,陳:-8.958420,衷:-9.805347,滸:-10.571205,突:-10.480476,堂:-8.775728,分:-6.238635,霈:-13.456005,吊:-10.351419,与:-8.445370,抑:-12.262083,妗:-15.758590,侣:-14.659978,箫:-11.647717,搪:-15.065443,瞳:-15.758590,進:-7.333732,訶:-11.123861,伸:-11.584203,嫁:-11.807347,組:-7.562705,采:-8.952868,捐:-11.049060,给:-9.196146,泥:-9.706501,赤:-10.480476,寫:-10.938309,飭:-15.758590,決:-7.779594,能:-6.799279,晾:-14.659978,缃:-15.758590,颂:-10.213413,嶄:-13.812680,钊:-10.938309,帙:-12.580537,錛:-14.659978,锟:-13.679149,涤:-10.527482,砭:-12.667548,馬:-6.488944,爱:-7.180678,鎰:-13.561366,傲:-11.599707,琵:-13.456005,驁:-11.887389,兇:-10.611096,陉:-12.462754,瓊:-9.303392,衍:-10.088709,滎:-12.868219,忘:-9.165546,凜:-9.591074,雞:-9.098015,慧:-7.859437,苦:-8.239983,靳:-14.149153,呵:-10.411483,痴:-10.640597,荻:-12.500494,懼:-11.123861,綁:-13.456005,异:-8.492462,唆:-12.814151,澍:-11.441102,斑:-10.245162,店:-10.708734,香:-7.649065,咛:-12.814151,功:-7.528280,漢:-5.391400,膩:-12.292855,挪:-13.812680,窯:-10.946406,餮:-13.966831,炳:-8.352487,露:-8.841875,撻:-12.986002,抿:-15.758590,脾:-9.864188,寅:-9.880855,雇:-13.456005,凉:-9.191918,願:-8.280421,孚:-11.733239,淡:-8.791623,闱:-14.372296,僳:-11.414785,鏵:-15.758590,价:-7.234422,閆:-13.456005,傈:-12.925377,二:-5.367720,夙:-13.679149,碘:-12.539715,蠣:-15.065443,您:-14.149153,缭:-10.640597,妮:-10.470323,由:-6.604609,钰:-9.720719,椹:-14.659978,朽:-12.814151,魅:-13.360695,酉:-12.426386,珊:-9.620863,轍:-15.065443,柒:-15.758590,壘:-11.826765,瑛:-10.954569,牟:-10.708734,档:-10.721638,迢:-10.435580,菪:-12.868219,彭:-11.114200,卵:-9.999689,曼:-8.410647,市:-7.105120,吆:-14.372296,炉:-10.346944,刊:-11.258781,撑:-11.631456,投:-9.100579,得:-6.292523,稚:-11.454525,原:-7.613041,財:-8.477205,肩:-10.303269,截:-9.623026,熳:-13.561366,防:-7.210480,診:-10.237130,峁:-14.149153,僉:-12.203242,跋:-10.134573,仍:-13.561366,诏:-10.015587,婚:-9.338595,靜:-7.693954,泡:-10.845936,赠:-12.232230,惩:-12.069711,巫:-11.788299,确:-8.863920,癲:-11.194242,汶:-10.747955,裹:-12.714068,冈:-7.809852,洋:-7.198146,欏:-15.758590,锛:-14.659978,殤:-13.679149,憨:-12.986002,墮:-13.193641,爵:-10.593804,根:-7.555560,绂:-15.758590,驅:-10.156472,均:-8.610245,葑:-12.232230,罗:-6.138461,鳖:-14.372296,畛:-15.758590,埜:-13.679149,楣:-15.065443,魯:-6.930682,呱:-12.147673,痰:-13.812680,創:-9.392120,蕻:-15.065443,羁:-14.372296,禅:-10.194070,圆:-8.250900,玉:-6.413457,谌:-13.273684,岗:-8.045253,编:-8.816434,朦:-10.891056,莩:-15.758590,纫:-10.996416,鬮:-15.758590,嘰:-11.481924,叉:-9.500923,版:-7.693011,軋:-13.193641,苓:-13.561366,奚:-12.580537,卞:-14.659978,濡:-11.022392,蹠:-13.050540,壯:-8.887499,勳:-10.954569,畲:-13.966831,釵:-10.307552,琇:-15.758590,劈:-12.925377,栏:-10.689686,嬙:-15.065443,窘:-15.758590,璜:-13.812680,速:-7.274127,萧:-10.201762,宮:-8.291791,侶:-14.659978,欹:-15.758590,蒼:-10.333640,饅:-14.659978,之:-5.614041,燊:-13.561366,腕:-12.147673,摧:-15.065443,鹫:-13.966831,自:-5.824380,顯:-8.544822,兵:-7.524025,烴:-15.758590,聿:-11.553898,嘆:-9.968630,暑:-11.005000,垛:-12.814151,砚:-11.351871,躡:-11.183879,氢:-10.186436,芩:-13.456005,怪:-9.631721,地:-6.027553,玳:-14.372296,鐲:-13.679149,舾:-15.758590,廁:-13.966831,勉:-11.647717,材:-8.002823,站:-11.013658,魘:-13.679149,塚:-13.360695,镜:-9.309701,满:-7.991750,襤:-11.327774,择:-9.114801,快:-9.539990,右:-8.001539,郵:-9.427089,蓽:-14.149153,找:-11.615456,往:-9.077736,笃:-11.183879,妄:-9.826345,隆:-8.555185,邊:-8.171787,椏:-13.679149,吝:-12.814151,推:-9.547990,咲:-10.501095,亶:-15.758590,樹:-7.397583,许:-9.432441,搽:-15.758590,盆:-9.166917,鉉:-13.679149,烊:-14.659978,虑:-10.860751,擒:-10.816948,睛:-11.908443,嗜:-15.758590,俠:-10.002848,正:-6.709476,賢:-8.138866,緬:-15.065443,偵:-12.391295,燴:-15.065443,起:-7.136677,旼:-13.561366,腿:-9.612261,挂:-10.664840,誇:-10.831337,邋:-13.456005,随:-9.316050,徕:-14.659978,抗:-9.224802,溟:-15.758590,造:-7.518997,璣:-11.401882,鰨:-15.758590,戬:-14.372296,渴:-13.193641,稼:-9.547990,珍:-8.567914,剌:-10.658724,科:-6.196256,苗:-8.383335,軟:-9.134525,凡:-9.087824,铣:-15.065443,巩:-13.360695,惫:-11.067243,罪:-9.263325,衰:-10.015587,泳:-9.720719,蹴:-11.524484,其:-6.603023,驼:-12.462754,绿:-8.196949,暄:-13.561366,沈:-9.090362,個:-6.420561,無:-5.903086,鎢:-11.281254,眥:-13.679149,鈷:-14.372296,頻:-10.360428,鸿:-7.122371,綾:-10.490732,胀:-10.616927,賈:-10.160168,俊:-7.351212,嗎:-13.561366,寒:-8.924482,黔:-11.997390,蕙:-12.121004,也:-8.798243,盤:-9.147894,婧:-10.809831,捭:-12.391295,诲:-13.561366,畹:-15.065443,醋:-12.539715,渊:-9.078991,劍:-7.792004,鞏:-13.360695,底:-8.870018,鴨:-11.058110,芭:-12.175071,袱:-15.758590,椰:-12.232230,甸:-9.432441,妻:-10.061497,笼:-11.733239,泉:-8.579282,蹊:-11.788299,奐:-12.714068,绕:-10.721638,晚:-10.081837,迟:-10.156472,汞:-13.273684,牢:-10.333640,繪:-9.037165,荬:-15.758590,柯:-9.487602,淳:-10.324868,轴:-8.517224,偶:-11.454525,移:-9.214679,老:-7.104247,蘅:-12.539715,构:-8.849836,消:-9.298686,頑:-10.816948,羔:-13.966831,肖:-9.338595,貞:-8.295227,冠:-8.221160,垤:-15.758590,颦:-12.426386,脫:-9.850507,撮:-14.149153,吹:-9.407705,皺:-13.360695,精:-8.121838,歇:-9.428870,今:-8.692977,駐:-11.183879,嫒:-15.758590,葙:-15.758590,佟:-15.758590,編:-8.816434,扭:-11.104630,蓮:-7.821216,导:-6.352437,再:-8.919114,钏:-11.247731,麓:-11.908443,沟:-10.088709,伞:-11.085762,碧:-8.323743,水:-5.878525,傷:-9.246845,旅:-9.138517,么:-11.401882,饒:-11.123861,諛:-12.147673,潞:-12.462754,難:-7.821930,嗥:-15.065443,烷:-12.324603,陸:-7.664517,顼:-13.966831,技:-6.558098,撄:-13.966831,載:-9.108311,吏:-11.631456,莖:-13.050540,辞:-9.872486,加:-6.406403,甥:-11.495911,咤:-11.788299,缩:-9.562146,舫:-14.372296,晃:-9.135854,蓄:-10.946406,城:-6.253865,姒:-15.065443,蝙:-15.065443,狠:-9.708857,瓤:-13.966831,睹:-12.762858,闺:-11.715539,争:-7.859808,傍:-10.041563,閏:-12.580537,蜘:-12.500494,涟:-13.193641,丞:-9.723109,錠:-15.065443,倢:-15.758590,锤:-10.421052,禧:-9.385271,冷:-8.477893,隹:-15.758590,眸:-12.262083,礼:-7.932546,聂:-11.143470,兌:-15.758590,竑:-15.758590,子:-5.619873,糕:-13.679149,诛:-11.751257,跟:-9.842388,湞:-15.758590,哥:-8.096123,廩:-14.149153,議:-7.360181,赴:-11.304243,饼:-12.292855,幾:-6.995944,踉:-11.067243,澈:-12.462754,逍:-13.812680,箐:-15.758590,弓:-10.781857,昙:-13.679149,邢:-12.324603,茫:-10.532844,暮:-10.809831,状:-7.955972,鬻:-12.426386,璺:-14.659978,鴿:-13.360695,纾:-12.986002,菀:-13.273684,权:-7.501983,迈:-10.397298,里:-6.115624,畏:-9.990269,柘:-12.539715,衝:-8.051078,珠:-8.713685,奧:-8.424261,恭:-8.828096,蛮:-11.481924,铺:-11.631456,肃:-9.304965,躇:-11.076459,權:-7.501983,颓:-13.456005,宕:-11.769606,暗:-9.984039,耘:-12.986002,沛:-9.762138,级:-7.041891,嬪:-13.679149,氰:-10.868241,嚷:-11.568936,旁:-9.418231,齒:-10.160168,敖:-12.324603,保:-6.841414,楞:-11.846567,句:-9.386979,給:-9.196146,拯:-12.462754,啶:-14.372296,選:-6.938039,系:-6.495563,鹼:-10.320511,竿:-10.816948,茅:-9.572382,抄:-11.339750,万:-6.139922,霍:-9.993399,墨:-9.591074,鰻:-15.758590,玺:-11.807347,禾:-12.069711,蓀:-15.065443,恃:-10.962800,苄:-15.758590,瑋:-10.229161,雌:-10.891056,忒:-12.203242,體:-6.722246,磨:-9.418231,杭:-9.853229,廼:-15.758590,昂:-10.282127,辇:-12.986002,開:-6.750856,樊:-9.996539,鎏:-13.812680,岑:-12.292855,林:-6.271604,涛:-10.360428,羧:-14.659978,館:-9.558081,本:-5.934146,邹:-13.966831,宿:-9.800166,擁:-9.395562,担:-10.374095,豆:-9.054176,棉:-10.728152,過:-7.515045,嵐:-9.667281,孔:-9.524180,仝:-12.391295,員:-4.852451,釣:-11.441102,癢:-14.149153,壩:-9.938507,走:-8.867981,槳:-12.868219,酸:-7.737663,塾:-13.561366,萁:-15.758590,舅:-11.215296,掄:-15.065443,榈:-11.236802,瞌:-11.339750,匏:-13.966831,箔:-15.758590,渝:-9.405961,袞:-13.456005,蔫:-14.372296,茯:-14.149153,鴻:-7.122371,帽:-10.490732,碾:-14.149153,潇:-10.303269,览:-8.026221,韌:-11.315939,軲:-13.119533,银:-7.339672,凸:-11.292682,繽:-10.728152,飾:-9.720719,漆:-10.460273,邏:-9.932590,猎:-11.114200,徑:-10.141819,谜:-14.149153,梟:-13.273684,弦:-9.601611,太:-6.118938,搬:-12.814151,辱:-9.620863,爸:-15.065443,轆:-12.045018,痍:-13.456005,塔:-7.986259,杖:-10.241138,軛:-12.539715,慚:-11.698147,埡:-13.812680,畢:-9.697134,審:-8.877179,葬:-9.237969,惯:-9.414710,瓷:-11.258781,鉸:-15.758590,鱼:-8.691271,脅:-10.123801,悄:-8.685321,娓:-11.997390,膚:-10.038279,液:-10.795746,匹:-9.168289,崽:-11.173623,蛀:-15.758590,胄:-13.812680,汇:-9.370029,灏:-11.997390,巒:-12.868219,拘:-10.702345,靡:-11.327774,酥:-12.667548,烤:-12.868219,仰:-10.435580,極:-7.602080,韶:-10.320511,勸:-12.539715,鞋:-12.623096,斗:-7.043695,带:-8.570933,堪:-9.221899,攬:-11.076459,喷:-10.245162,銹:-10.582441,情:-7.794782,绑:-13.456005,彐:-13.561366,鱒:-13.561366,磕:-11.681053,奔:-9.616553,晖:-9.886473,进:-7.333732,恚:-15.758590,囡:-15.065443,嫩:-10.695995,轰:-9.436025,噶:-9.692482,翻:-10.186436,者:-7.989634,國:-4.124625,肚:-9.489494,語:-8.528752,瘡:-11.269954,垠:-12.925377,钢:-9.312871,冤:-11.104630,麦:-8.874104,脯:-13.966831,锷:-13.966831,刹:-10.205631,鼻:-9.739997,為:-6.630437,尽:-8.473084,浇:-11.104630,仆:-9.779705,诈:-11.510095,闌:-12.762858,峒:-12.203242,艙:-14.659978,佛:-8.638955,遥:-9.725504,零:-8.717179,特:-6.307188,司:-7.594365,籽:-11.481924,冑:-13.812680,钓:-11.441102,会:-5.035852,舜:-9.878057,犧:-11.123861,圪:-14.659978,训:-8.808734,螵:-14.372296,簸:-14.372296,傻:-11.339750,槁:-15.758590,諗:-15.758590,胛:-12.324603,蛟:-12.175071,敞:-12.868219,煦:-11.769606,滯:-10.906560,聰:-9.129227,奶:-9.376774,輅:-13.966831,撈:-11.194242,吓:-12.262083,視:-7.342987,洙:-15.065443,辚:-15.758590,挝:-12.868219,缥:-11.974401,咨:-13.679149,踯:-14.659978,涮:-13.966831,騷:-11.204714,逻:-9.932590,阿:-8.057843,疾:-8.525135,扇:-12.868219,拜:-9.304965,剧:-8.335022,菲:-8.180445,杵:-12.292855,絹:-12.292855,闾:-12.762858,樂:-6.549451,昊:-10.450323,傑:-8.725084,間:-8.049731,嚕:-12.232230,业:-5.720004,茜:-10.860751,倦:-14.659978,侯:-8.852837,肱:-13.966831,朴:-10.576807,冻:-10.728152,滅:-9.552014,聆:-15.758590,孌:-13.119533,诗:-9.046850,穢:-11.807347,哩:-15.065443,濯:-14.659978,腰:-10.754644,蝴:-12.462754,篷:-11.173623,幺:-11.401882,矿:-8.994706,澄:-10.233137,式:-8.286658,袖:-10.152788,骢:-13.273684,邦:-7.547108,險:-8.117506,輯:-8.325515,尹:-11.866770,纺:-8.882326,觀:-8.117987,浃:-11.807347,釐:-15.758590,勒:-7.466543,淘:-11.615456,卧:-11.013658,牽:-10.954569,链:-12.262083,肇:-9.127907,骋:-13.360695,妍:-10.875788,梗:-10.538235,耜:-15.758590,纣:-12.020921,夢:-7.969964,莱:-7.744585,戰:-6.210564,咿:-12.292855,毁:-12.986002,淅:-11.997390,荆:-10.774984,蕊:-11.364141,种:-7.699947,塌:-10.044858,珑:-11.846567,酒:-9.035961,痕:-11.887389,浚:-11.769606,蓟:-12.986002,杞:-12.175071,寡:-9.463324,工:-6.053371,番:-10.054808,衬:-14.149153,泯:-14.372296,艰:-11.826765,曳:-12.667548,磷:-11.095151,狻:-12.262083,遼:-10.245162,謁:-14.149153,檀:-10.853316,七:-6.559716,贅:-15.758590,蜉:-13.679149,暈:-10.506317,碌:-10.571205,小:-5.095185,亘:-14.372296,螞:-11.929949,鎦:-15.758590,眩:-12.714068,谯:-12.925377,憲:-7.986680,弹:-8.705869,綺:-11.481924,湃:-15.758590,賄:-11.539083,惜:-10.141819,章:-8.635724,幣:-8.518658,革:-6.402333,業:-5.720004,敵:-9.000496,鷺:-12.095029,较:-11.095151,劑:-11.733239,咕:-10.599535,掛:-10.664840,斟:-11.401882,袭:-10.163879,花:-6.960740,缸:-13.561366,去:-8.730389,曉:-6.112126,遒:-15.758590,仙:-8.586166,嫡:-15.758590,峥:-12.232230,釧:-11.247731,毫:-9.727905,瑪:-8.737506,柳:-8.973003,蕴:-11.236802,婶:-11.997390,屺:-14.149153,谅:-12.986002,嬋:-11.339750,圓:-8.250900,渙:-12.500494,思:-6.304833,宠:-10.838609,颢:-12.925377,瘩:-12.667548,钪:-13.273684,贯:-8.867981,悲:-10.708734,跄:-11.067243,蟈:-14.149153,筋:-10.616927,蹙:-15.065443,濘:-15.758590,內:-6.830480,险:-8.117506,繹:-10.217327,災:-9.220451,凼:-14.149153,雾:-10.853316,漂:-12.391295,骏:-10.571205,礎:-9.230633,邓:-11.887389,厕:-13.966831,碣:-15.758590,匪:-11.327774,辭:-9.872486,測:-8.748279,戴:-9.556055,康:-7.742603,砸:-12.357393,咻:-12.714068,势:-8.468980,轂:-10.898778,毅:-9.480069,應:-7.206030,荊:-10.774984,幌:-14.372296,呐:-11.788299,青:-7.178986,剔:-11.376564,苟:-11.076459,巡:-10.914403,罢:-10.316173,寥:-10.824116,蹬:-14.372296,想:-7.068285,绷:-13.119533,孺:-12.203242,脉:-9.418231,尋:-9.267867,續:-8.424261,锑:-13.193641,璐:-9.965577,錕:-13.679149,朝:-7.037640,紡:-8.882326,笥:-15.065443,储:-9.201812,榮:-7.784746,耳:-7.795478,鸷:-15.758590,夹:-11.095151,鈿:-12.357393,熾:-10.971099,賀:-9.742433,桃:-8.064198,諄:-11.826765,棘:-12.714068,曜:-11.807347,鵡:-11.715539,糠:-12.814151,烨:-11.866770,潭:-9.528109,们:-10.273793,蟲:-8.838907,睽:-11.040092,覃:-14.659978,戊:-11.153420,澗:-12.020921,褘:-15.758590,蜜:-10.383312,瞧:-14.659978,否:-10.257332,漬:-12.232230,德:-6.144052,喻:-10.201762,隽:-11.866770,眼:-7.637110,县:-9.350062,況:-10.721638,葆:-11.495911,绍:-8.462177,彌:-8.135926,協:-7.555286,峡:-8.713685,韧:-11.315939,淫:-11.194242,转:-8.393410,毯:-10.113144,靼:-15.758590,谁:-11.095151,殄:-13.273684,羌:-11.599707,鈕:-14.149153,簡:-10.048163,嶠:-13.966831,室:-10.194070,钦:-9.662766,贫:-9.823696,中:-5.253194,锻:-13.456005,窺:-11.866770,评:-10.316173,筏:-13.456005,闐:-11.887389,佗:-15.065443,衙:-12.203242,柜:-10.387952,締:-10.824116,驥:-11.351871,篤:-11.183879,適:-9.941479,白:-6.655390,颏:-13.360695,銓:-12.623096,冕:-11.163471,記:-7.668801,萜:-14.659978,悟:-9.434231,鸠:-13.456005,崢:-12.232230,璧:-11.866770,享:-11.049060,優:-8.883358,岷:-12.426386,琼:-9.303392,濁:-11.539083,赂:-11.997390,揉:-12.292855,腊:-8.741084,镒:-13.561366,燕:-7.683941,蛛:-11.664246,楚:-8.134948,捞:-11.194242,忡:-10.425872,絢:-12.020921,姥:-10.015587,铧:-15.758590,睦:-11.005000,叩:-13.456005,豬:-10.922309,拳:-10.406732,鑼:-10.387952,茉:-11.076459,炔:-15.065443,辖:-6.432692,攝:-11.247731,莞:-11.414785,猩:-11.584203,动:-5.561314,阻:-10.622792,禺:-11.974401,摇:-8.014454,苈:-13.679149,鳌:-12.147673,譙:-12.925377,齡:-9.298686,饥:-11.401882,東:-6.398538,筹:-9.647123,哼:-11.539083,薇:-10.628692,昆:-9.962533,馏:-11.236802,税:-9.311285,世:-5.822878,鼠:-10.002848,錨:-15.065443,倪:-13.119533,嶷:-14.659978,钽:-15.065443,拉:-5.720922,聊:-10.470323,嵌:-12.262083,监:-8.677723,坐:-10.217327,兔:-11.846567,湖:-7.628237,臟:-9.224802,濫:-10.781857,并:-9.356673,燿:-13.561366,澀:-12.462754,蠅:-13.966831,榄:-9.900657,舉:-7.879299,授:-10.374095,弋:-11.553898,夏:-7.034708,阑:-12.762858,熔:-13.273684,標:-8.232950,徠:-14.659978,砥:-9.886473,邪:-11.327774,茳:-15.758590,撲:-10.294759,纶:-12.462754,確:-8.863920,规:-6.989861,哒:-15.758590,釔:-13.966831,翠:-8.088162,季:-8.576998,顥:-12.925377,秤:-13.561366,啧:-11.376564,汭:-15.758590,諮:-13.679149,寸:-9.605858,骇:-10.576807,肋:-13.119533,貓:-11.194242,欒:-15.065443,鐘:-8.661042,碛:-12.762858,撣:-13.119533,谨:-10.257332,伪:-10.435580,爬:-11.647717,馱:-15.758590,砰:-12.714068,岳:-8.247613,讽:-12.925377,亿:-8.446037,燁:-11.866770,屈:-10.127379,齊:-8.438063,濕:-9.620863,乔:-9.186308,飛:-7.776174,寝:-11.887389,絞:-10.875788,换:-8.742878,諧:-13.360695,楦:-15.758590,烫:-15.758590,鉬:-12.580537,盯:-13.360695,顰:-12.426386,拷:-13.456005,滿:-7.991750,炀:-10.593804,吃:-8.410647,的:-7.241997,娇:-10.127379,鴉:-12.147673,輕:-7.492683,莢:-13.966831,洩:-10.294759,疮:-11.269954,失:-8.312005,張:-8.184032,憶:-9.194735,蠻:-11.481924,参:-8.463534,雄:-7.690187,姆:-7.888807,恋:-9.625192,苌:-11.327774,晏:-11.599707,幟:-11.143470,惠:-7.584169,注:-8.825167,獭:-14.659978,问:-8.539681,声:-7.284305,罵:-10.946406,閃:-9.412954,嚅:-13.273684,井:-8.051978,羟:-15.065443,质:-7.556382,个:-6.420561,缴:-13.561366,攸:-11.339750,便:-8.800142,烁:-11.615456,兀:-11.481924,顆:-12.925377,鹊:-12.292855,拍:-10.634626,詒:-12.667548,滕:-11.664246,佔:-8.673526,鏗:-12.667548,駛:-8.916975,诧:-12.868219,桦:-11.524484,鍬:-15.758590,矯:-12.814151,饰:-9.720719,槻:-12.986002,送:-9.351710,阅:-12.357393,瞄:-14.372296,舍:-9.883660,掌:-9.108311,喘:-9.878057,宜:-8.406791,怡:-9.900657,春:-6.531491,報:-8.588471,悶:-10.683417,褻:-15.065443,輿:-14.659978,沾:-11.133618,釀:-15.758590,態:-8.745575,菌:-9.330485,杏:-9.118715,觐:-12.762858,浓:-10.209514,返:-11.441102,南:-5.931174,痘:-14.659978,淨:-9.057859,召:-8.490367,铮:-10.979467,胶:-10.616927,摹:-14.372296,賾:-13.812680,颇:-11.339750,笆:-14.659978,芋:-13.679149,椒:-9.346772,化:-5.930743,頜:-11.114200,粟:-10.092164,梧:-12.045018,劫:-10.273793,咯:-12.324603,覽:-8.026221,格:-6.662651,剀:-15.065443,病:-8.361029,蝎:-11.951928,姝:-10.987906,鳟:-13.561366,慢:-10.402004,武:-6.743292,俩:-15.758590,浪:-8.907405,瓯:-14.372296,驰:-10.640597,绳:-10.715165,櫻:-10.987906,錁:-13.193641,犀:-12.203242,锅:-9.897804,堇:-15.758590,纈:-13.456005,悌:-14.659978,檐:-12.045018,专:-8.690418,鎖:-9.574442,眙:-14.149153,墜:-12.069711,挡:-12.623096,亨:-10.078418,鸳:-12.147673,耷:-13.119533,铄:-13.561366,密:-7.691441,手:-7.336807,背:-10.245162,静:-7.693954,盘:-9.147894,荡:-8.452730,轩:-10.741311,滨:-9.757176,筱:-10.190246,藺:-13.561366,薏:-13.561366,明:-6.213851,输:-8.152700,枣:-13.119533,榧:-15.758590,區:-6.434297,遂:-10.527482,绉:-11.846567,彈:-8.705869,虎:-8.336217,法:-5.964471,釗:-10.938309,瑚:-9.556055,繞:-10.721638,恢:-10.249202,汪:-10.374095,酬:-12.262083,懷:-8.292363,乾:-9.441426,鈁:-15.758590,圃:-13.273684,备:-8.049731,羈:-14.372296,耍:-14.372296,谕:-11.769606,涔:-12.762858,銖:-11.376564,戡:-13.456005,肢:-10.721638,誦:-12.714068,温:-8.832013,侨:-10.605299,錫:-8.014021,貪:-11.133618,倭:-13.679149,锯:-12.147673,皮:-8.324333,娱:-13.273684,贿:-11.539083,僂:-11.807347,捋:-14.372296,敏:-7.933345,兗:-15.758590,孛:-15.758590,灭:-9.552014,寰:-13.193641,飲:-10.460273,巴:-6.886664,厅:-11.715539,紆:-14.372296,蒋:-12.580537,芏:-15.758590,愎:-11.997390,窟:-13.050540,患:-10.102599,咫:-10.269653,鞭:-11.751257,墳:-13.050540,辽:-10.245162,呀:-11.427857,靂:-12.814151,秉:-7.574914,腎:-12.986002,淑:-8.138376,毕:-9.697134,忝:-15.065443,神:-7.171685,浦:-8.805862,歪:-10.628692,兮:-11.173623,驴:-11.908443,泻:-11.846567,锁:-9.574442,璀:-15.065443,沐:-10.009197,檔:-10.721638,焙:-12.868219,傘:-11.085762,缝:-11.327774,府:-8.113193,挥:-7.478893,鐫:-15.065443,圭:-10.576807,羲:-10.683417,伽:-12.069711,铀:-14.149153,灃:-14.372296,埂:-13.273684,繇:-12.925377,桓:-9.536014,烘:-10.715165,络:-8.180445,擠:-12.203242,荥:-12.868219,統:-7.473834,峰:-8.303292,藶:-13.679149,墉:-12.623096,怎:-9.356673,覓:-11.681053,刚:-9.031159,澧:-13.456005,細:-7.581637,陂:-10.182641,奈:-7.822288,驊:-12.714068,蹒:-13.193641,廝:-12.814151,臣:-9.179339,痫:-12.814151,干:-7.510323,腸:-8.881294,添:-9.850507,玄:-8.977533,銚:-15.758590,搡:-13.119533,栩:-10.741311,說:-7.800363,錯:-9.662766,炮:-9.353362,就:-7.957608,纲:-9.649343,贻:-9.823696,丽:-6.541672,囂:-11.339750,捏:-11.715539,楓:-11.510095,块:-8.994706,遙:-9.725504,嵛:-13.456005,孟:-9.041996,葡:-11.364141,无:-5.903086,衩:-15.758590,槨:-13.119533,癭:-15.065443,恹:-13.561366,内:-6.830480,鲇:-12.580537,缆:-12.814151,安:-4.737456,侑:-11.510095,誓:-11.183879,洒:-11.269954,圖:-8.282684,碟:-12.069711,沧:-9.858693,伦:-7.432558,閭:-12.762858,琬:-12.462754,媳:-9.866946,破:-7.723959,莹:-9.416469,镂:-15.758590,偄:-15.758590,築:-7.247617,濑:-9.687853,乐:-6.549451,叙:-10.664840,黛:-9.601611,川:-7.398285,食:-8.387101,苣:-14.372296,敢:-9.495192,潦:-12.203242,烯:-10.116683,鹰:-11.351871,霁:-11.769606,刃:-10.038279,將:-8.353095,窈:-13.273684,源:-7.401097,梔:-15.065443,猙:-12.175071,辦:-8.718054,親:-8.521531,玮:-10.229161,弱:-10.058147,網:-8.878206,架:-8.091900,雀:-9.534032,忆:-9.194735,晋:-9.502840,姊:-10.294759,裔:-12.667548,鵝:-8.326107,曠:-10.269653,腥:-10.922309,鷲:-13.966831,课:-12.147673,傅:-11.510095,膏:-9.909266,戎:-11.143470,云:-6.766406,讓:-10.658724,疗:-9.392120,嘖:-11.376564,錘:-10.421052,倚:-12.391295,掣:-13.193641,涧:-12.020921,並:-9.356673,謨:-10.683417,垫:-11.539083,钭:-15.758590,甬:-10.095630,冯:-12.175071,缰:-12.868219,害:-9.072729,芹:-11.826765,貽:-9.823696,洼:-11.304243,址:-11.647717,兄:-8.393410,操:-9.802753,滑:-9.603732,佐:-8.706735,棕:-11.698147,務:-5.087173,駟:-10.186436,矫:-12.814151,饴:-14.659978,旷:-10.269653,槿:-12.426386,阁:-9.759654,逅:-12.292855,熄:-12.539715,崇:-7.921431,萍:-9.909266,斌:-9.536014,蠕:-15.065443,厘:-9.378468,骞:-12.121004,急:-8.498068,吭:-13.360695,堵:-12.623096,蔷:-13.050540,輻:-9.409451,运:-6.513655,柠:-13.561366,詩:-9.046850,瑭:-14.659978,鋮:-12.714068,批:-9.532054,胺:-11.887389,汽:-8.640574,諾:-8.061923,待:-8.016623,喉:-11.414785,袋:-10.549104,窗:-11.788299,外:-7.037804,沣:-14.372296,萨:-7.590104,咳:-13.273684,瘴:-10.605299,永:-6.492342,莽:-11.315939,私:-9.309701,魂:-9.446856,翅:-9.906388,幄:-14.659978,痉:-14.659978,呈:-10.397298,母:-8.461499,赎:-11.866770,荒:-10.088709,祖:-7.811619,罚:-10.634626,賣:-9.203234,止:-9.660516,苧:-13.561366,杪:-15.065443,马:-6.488944,豸:-15.758590,替:-11.846567,切:-8.533837,脑:-8.633307,首:-6.885262,紙:-9.674091,龚:-14.149153,订:-10.182641,交:-6.132043,鸯:-11.215296,鐳:-15.758590,玲:-8.421654,耻:-10.338055,蘿:-9.160081,籃:-10.233137,寂:-11.733239,黄:-8.168749,片:-8.445370,准:-8.472399,铈:-15.065443,蛔:-15.758590,棠:-11.997390,滤:-10.914403,围:-10.338055,浹:-11.807347,稂:-15.065443,瀆:-15.065443,見:-7.354118,戒:-10.761378,算:-6.793639,帚:-13.273684,吞:-9.468875,涣:-12.500494,控:-9.137185,第:-7.846534,邱:-12.203242,焰:-10.329245,喳:-10.914403,芽:-10.307552,磁:-8.426221,绅:-13.561366,豎:-10.906560,惑:-9.909266,峙:-12.580537,繚:-10.640597,勝:-6.976728,瑞:-7.502762,跣:-14.659978,以:-6.825586,酰:-10.012387,割:-10.480476,靴:-12.925377,荼:-14.149153,柿:-12.623096,頁:-10.485591,禀:-13.561366,崃:-12.500494,伏:-9.008659,憐:-10.229161,颖:-8.870018,钞:-12.462754,校:-8.512935,渥:-15.758590,粮:-9.419996,嘵:-11.751257,撾:-12.868219,嫂:-11.085762,闈:-14.372296,囊:-10.201762,字:-7.400393,緘:-12.925377,坟:-13.050540,衡:-10.116683,濤:-10.360428,旨:-11.539083,寬:-10.171342,凰:-9.558081,汹:-10.320511,宁:-7.002223,邇:-14.372296,碗:-10.741311,嬖:-15.758590,璟:-15.065443,谤:-12.814151,馭:-13.360695,爰:-14.659978,嚳:-15.758590,琴:-8.605539,边:-8.171787,游:-6.871490,膽:-9.393840,婀:-12.814151,槍:-9.200393,轎:-11.153420,策:-9.141187,忙:-9.127907,凝:-8.681092,睞:-13.273684,胧:-10.996416,布:-6.581600,霉:-9.340225,皈:-14.659978,缙:-12.623096,次:-6.966041,津:-7.873261,騫:-12.121004,薪:-9.701806,夭:-11.304243,匱:-12.426386,阳:-6.145723,繃:-13.119533,橋:-8.317270,俎:-12.580537,晓:-6.112126,塗:-9.669546,绘:-9.037165,剛:-9.031159,祭:-11.866770,壬:-15.065443,勰:-15.065443,跺:-13.360695,蟾:-14.659978,砂:-10.728152,醇:-11.647717,爆:-10.501095,渎:-15.065443,怒:-9.463324,玛:-8.737506,尚:-8.402311,疟:-13.561366,謠:-12.986002,贤:-8.138866,憧:-14.372296,宫:-8.291791,礬:-11.183879,钵:-12.262083,漸:-10.677186,肽:-15.758590,棍:-10.853316,桢:-12.232230,臧:-15.065443,饬:-15.758590,緯:-8.750990,石:-6.809615,偲:-15.758590,轸:-15.065443,騁:-13.360695,简:-10.048163,弃:-10.044858,蠍:-11.951928,掐:-14.659978,瀝:-10.954569,农:-7.024030,模:-8.326699,芦:-10.860751,纮:-12.986002,吵:-10.708734,丹:-7.654491,浏:-13.456005,从:-8.458118,杓:-14.372296,套:-11.173623,翘:-12.667548,啟:-14.659978,詡:-13.050540,佣:-10.178861,淤:-13.456005,姬:-11.441102,台:-7.944999,諶:-13.273684,俸:-13.119533,賺:-14.372296,恽:-15.065443,蛾:-12.925377,宅:-10.190246,冉:-10.914403,侍:-10.075011,椎:-9.246845,崖:-10.245162,領:-8.433441,阜:-12.020921,谠:-15.065443,岫:-12.762858,閱:-12.357393,琰:-12.762858,傳:-7.283887,鎵:-14.372296,核:-8.833978,局:-9.432441,乌:-9.504762,铛:-12.925377,煞:-12.667548,潢:-13.456005,敦:-8.982083,端:-8.968493,奮:-8.844853,鑰:-12.762858,鉴:-10.532844,擻:-11.510095,拿:-7.748563,堃:-15.758590,窄:-11.751257,鄉:-9.137185,撐:-11.631456,礙:-10.054808,薦:-10.987906,莪:-15.065443,弭:-15.758590,禮:-7.932546,唱:-8.969619,殺:-9.576506,癇:-12.814151,及:-8.422305,軌:-11.698147,苔:-11.974401,幗:-12.069711,盜:-11.104630,赡:-15.758590,泠:-12.762858,惨:-12.175071,廬:-12.069711,獵:-11.114200,楹:-12.391295,诺:-8.061923,臾:-12.986002,岁:-10.565634,理:-5.704960,趋:-11.826765,栎:-12.203242,尖:-10.163879,餘:-6.608531,霜:-9.103150,倞:-13.679149,枧:-15.758590,缬:-13.456005,钱:-8.619723,田:-6.877588,决:-7.779594,猴:-10.475387,鹂:-15.758590,竅:-10.768158,先:-7.159264,解:-7.069463,扪:-15.758590,镰:-13.966831,旻:-12.814151,圇:-13.193641,选:-6.938039,澌:-15.758590,萑:-15.065443,斐:-9.075229,妘:-13.679149,骚:-11.204714,怩:-12.814151,席:-7.593511,鬯:-15.065443,吱:-11.664246,蔻:-13.561366,廂:-10.501095,哆:-12.095029,测:-8.748279,菔:-14.659978,彗:-11.908443,秘:-9.739997,陝:-12.462754,矜:-14.149153,象:-7.838871,懨:-13.561366,繭:-11.524484,雲:-6.766406,牵:-10.954569,諺:-13.561366,征:-8.750990,紂:-12.020921,钇:-13.966831,厉:-10.269653,焊:-12.925377,攒:-11.315939,粗:-11.866770,多:-5.745173,庫:-9.126589,劳:-7.883471,讹:-11.481924,樸:-10.576807,翁:-10.702345,幀:-15.065443,珉:-12.925377,酊:-12.714068,譎:-13.812680,柑:-15.065443,蕒:-15.758590,鳗:-15.758590,雛:-11.715539,祚:-10.774984,嗝:-14.659978,郟:-15.758590,信:-7.473077,绫:-10.490732,磯:-11.715539,陰:-9.066507,佶:-12.667548,娃:-9.489494,餅:-12.292855,下:-6.293840,贍:-15.758590,沌:-13.360695,暐:-13.679149,悔:-10.781857,笙:-12.262083,崭:-13.812680,疲:-10.102599,谷:-8.471714,耿:-9.732724,飄:-9.418231,蛐:-12.986002,打:-8.426875,镝:-15.758590,瓜:-9.425311,轡:-13.360695,荩:-15.758590,拨:-10.971099,困:-9.131873,闲:-9.448672,歹:-12.426386,墅:-12.426386,劉:-9.108311,規:-6.989861,莓:-13.273684,帖:-11.584203,熟:-9.631721,斧:-11.031203,茨:-9.237969,妯:-15.758590,隱:-8.998176,邵:-11.866770,磅:-11.133618,奄:-10.383312,陆:-7.664517,午:-9.233561,遊:-6.871490,惕:-10.599535,鷗:-12.580537,仡:-15.065443,诣:-13.456005,晦:-13.456005,恪:-13.456005,鵬:-8.705005,积:-7.623830,混:-10.646603,懿:-10.445384,項:-9.917949,禄:-9.923780,唇:-10.616927,鈉:-14.149153,伋:-15.758590,谍:-12.667548,涌:-10.294759,蘑:-15.758590,析:-8.635724,耕:-9.593173,憔:-13.119533,官:-8.053778,喜:-8.315512,渡:-9.386979,侠:-10.002848,貢:-11.031203,戩:-14.372296,肪:-9.800166,窮:-9.552014,嘱:-12.391295,錳:-10.996416,贷:-10.543655,溶:-9.376774,蜻:-13.679149,鏈:-12.262083,潋:-13.561366,跌:-10.257332,坛:-10.809831,濠:-13.456005,补:-8.740189,灵:-7.901884,橹:-13.193641,茂:-8.333829,瀠:-15.758590,瘤:-11.058110,骧:-13.966831,般:-8.711943,疹:-13.360695,鐸:-13.360695,场:-7.475349,臁:-15.758590,捂:-15.758590,筒:-10.734710,拗:-15.065443,滟:-15.758590,赞:-9.355016,瓣:-12.426386,胫:-11.807347,扬:-8.599299,愁:-11.315939,缕:-11.304243,枚:-10.868241,謝:-9.210371,涞:-13.812680,玢:-13.679149,禦:-8.982083,是:-7.669108,氳:-13.679149,讲:-9.813170,爷:-9.333721,咸:-10.831337,砻:-11.664246,媼:-15.758590,曄:-10.025249,運:-6.513655,契:-9.938507,磐:-12.762858,录:-9.358333,绔:-12.324603,教:-6.477885,諜:-12.667548,叢:-9.526142,姦:-10.747955,旮:-15.758590,广:-6.395958,舂:-15.065443,殇:-13.679149,經:-6.021453,攘:-10.565634,辟:-10.611096,閣:-9.759654,岩:-8.792566,茬:-12.539715,褰:-15.758590,鬼:-9.087824,尾:-8.681092,胁:-10.123801,框:-11.846567,凋:-13.679149,湊:-12.814151,聖:-8.379582,槛:-13.456005,虚:-8.367175,濟:-6.264727,坤:-9.495192,跳:-10.138190,畸:-14.372296,态:-8.745575,膀:-12.580537,爍:-11.615456,咎:-11.631456,媒:-9.142525,龔:-14.149153,悖:-11.929949,伟:-7.432558,逡:-15.758590,犢:-12.203242,愫:-14.659978,纪:-7.097816,术:-6.629243,洳:-15.065443,課:-12.147673,猷:-12.623096,蕃:-14.149153,柄:-11.826765,酋:-11.615456,前:-7.936947,塑:-9.754703,幕:-9.005153,翔:-10.031743,勢:-8.468980,廪:-14.149153,卷:-10.081837,糾:-12.292855,脂:-9.920860,丈:-9.412954,贊:-9.355016,霎:-11.681053,纓:-11.997390,尔:-5.380920,涵:-11.615456,禽:-11.058110,菁:-11.104630,歆:-11.715539,勋:-10.954569,浊:-11.539083,重:-7.374472,睎:-15.758590,廓:-12.539715,櫛:-11.539083,監:-8.677723,呤:-15.758590,磧:-12.762858,恬:-12.925377,蓯:-12.580537,汴:-11.997390,培:-8.137885,癸:-13.561366,髻:-14.149153,硼:-13.050540,持:-7.749560,漉:-10.582441,笑:-8.401672,妒:-13.193641,紕:-15.758590,掖:-13.273684,锥:-9.428870,覲:-12.762858,稻:-10.788777,簿:-12.925377,免:-9.744875,楝:-12.580537,補:-8.740189,俞:-11.454525,略:-7.626178,實:-6.693160,罩:-13.193641,黨:-7.392453,腭:-14.659978,乳:-9.206083,赵:-10.120236,偷:-10.470323,痺:-11.974401,屿:-12.175071,榇:-15.758590,王:-7.263438,谊:-10.068231,疏:-10.809831,阎:-11.031203,頒:-12.667548,崔:-12.357393,趟:-15.065443,务:-5.087173,鞣:-15.758590,缨:-11.997390,贴:-11.568936,制:-7.130572,霸:-10.123801,苁:-12.580537,恂:-14.659978,友:-7.938954,汊:-14.149153,鳕:-15.758590,毛:-8.066934,占:-8.673526,矣:-14.659978,啤:-12.391295,秧:-12.121004,浴:-11.495911,囹:-12.814151,壽:-8.277598,搅:-12.292855,薄:-9.597383,辈:-8.048834,抖:-10.987906,圣:-8.379582,大:-3.845936,窦:-11.339750,鸩:-13.050540,粪:-12.262083,支:-8.692977,漳:-10.149119,钺:-12.814151,揀:-11.698147,旄:-14.372296,义:-6.734218,鍋:-9.897804,镏:-15.758590,展:-7.392453,仞:-13.679149,牡:-12.175071,嫦:-11.826765,繩:-10.715165,峪:-10.549104,話:-7.680833,佳:-7.784058,棲:-9.239443,具:-8.422305,顽:-10.816948,蜂:-10.406732,璋:-11.929949,謊:-13.050540,嘌:-12.714068,碓:-13.193641,依:-7.842148,那:-8.699832,厥:-11.085762,妩:-15.758590,枭:-13.273684,段:-9.644908,訴:-9.697134,熹:-15.758590,逸:-8.759168,区:-6.434297,羽:-9.423536,夾:-11.095151,杂:-9.059090,菅:-12.814151,仇:-9.552014,浆:-11.204714,觉:-9.158720,煎:-12.391295,壓:-8.752801,泛:-10.253259,荚:-13.966831,乜:-15.065443,櫟:-12.203242,面:-6.715013,继:-7.541152,苯:-9.892122,汰:-11.058110,裳:-13.966831,雷:-7.606104,凹:-13.360695,灸:-12.292855,忽:-9.230633,繼:-7.541152,芄:-15.758590,徒:-8.971873,笕:-15.758590,輝:-8.694686,锡:-8.014021,帧:-15.065443,農:-7.024030,閶:-15.758590,稿:-11.292682,擀:-15.758590,聃:-13.561366,顓:-15.758590,孕:-9.947449,铠:-13.193641,鋤:-14.659978,左:-9.173799,珺:-13.050540,澇:-12.667548,谆:-11.826765,訊:-8.553698,墩:-11.951928,沱:-10.938309,串:-11.539083,吶:-11.788299,点:-7.009016,刺:-10.605299,纽:-9.903518,蓁:-15.065443,時:-6.342538,雍:-10.460273,姓:-9.974765,作:-5.850812,院:-7.139202,卤:-12.232230,驪:-13.679149,華:-5.276497,價:-7.234422,栉:-11.539083,瘍:-12.262083,抚:-9.361661,踝:-15.065443,弧:-12.580537,窪:-11.304243,振:-7.246812,肮:-15.758590,躲:-11.104630,眷:-13.119533,屑:-10.435580,婕:-11.599707,臘:-8.741084,远:-7.471565,团:-7.320008,鏤:-15.758590,峦:-12.868219,滲:-12.069711,坷:-12.324603,瓶:-9.858693,鹽:-9.974765,皋:-13.119533,同:-6.580154,帐:-14.149153,蒗:-13.966831,战:-6.210564,瘠:-14.659978,銣:-15.758590,冥:-10.430714,断:-8.653625,萬:-6.139922,綽:-10.374095,潆:-15.758590,诉:-9.697134,楊:-8.773874,像:-8.743776,獎:-9.483828,駕:-10.622792,棟:-10.741311,噠:-15.758590,糧:-9.419996,齦:-13.561366,饪:-15.758590,胯:-15.065443,俱:-8.762824,諳:-13.193641,铷:-15.758590,叹:-9.968630,黻:-15.758590,巽:-12.762858,籼:-15.758590,蚀:-10.611096,肄:-15.758590,來:-6.041975,丛:-9.526142,贝:-8.088628,尧:-10.522148,鬩:-13.456005,禪:-10.194070,怯:-14.372296,醺:-11.908443,豇:-15.758590,陋:-11.339750,遏:-12.986002,奕:-9.977847,磔:-15.065443,賜:-10.061497,睡:-13.456005,煥:-9.184910,蕭:-10.201762,揮:-7.478893,轱:-13.119533,矶:-11.715539,幻:-10.402004,掃:-10.106101,涇:-12.175071,熏:-11.414785,薗:-13.679149,辛:-8.495261,眠:-10.333640,鎣:-11.788299,笨:-11.769606,播:-8.994706,蔬:-14.372296,梵:-13.812680,褴:-11.327774,嘶:-11.031203,犹:-9.295561,债:-10.392614,埋:-10.938309,减:-10.708734,黑:-8.853840,寓:-12.262083,飕:-11.951928,旗:-8.878206,聚:-8.912711,槟:-11.524484,詞:-10.253259,坠:-12.069711,珣:-15.758590,鹦:-13.679149,敬:-8.219032,潰:-11.351871,闷:-10.683417,獸:-11.215296,峽:-8.713685,駿:-10.571205,怅:-14.659978,了:-8.570178,龐:-10.565634,馔:-15.065443,暖:-8.941855,悚:-10.582441,阡:-11.866770,匣:-11.647717,约:-7.889571,末:-8.929878,芮:-12.667548,貲:-15.065443,男:-8.969619,隶:-8.674364,邺:-12.667548,嶼:-12.175071,荃:-11.929949,菘:-15.758590,汝:-7.798267,穩:-9.683244,鯨:-11.058110,葭:-12.324603,彻:-9.478195,烺:-15.758590,沃:-9.718336,謂:-11.584203,脆:-11.788299,娌:-13.273684,纏:-11.788299,琨:-13.119533,强:-8.323743,见:-7.354118,迅:-11.427857,藉:-13.966831,金:-6.086153,哓:-11.751257,周:-8.071052,恰:-10.061497,晴:-10.229161,叽:-11.481924,椁:-13.119533,验:-7.627354,隔:-10.241138,餡:-15.065443,瞪:-9.506687,港:-8.388360,莲:-7.821216,稷:-13.119533,岸:-8.450718,劼:-15.758590,瘿:-15.065443,检:-7.413848,滄:-9.858693,艇:-13.561366,鹏:-8.705005,兑:-15.758590,盔:-12.868219,浙:-11.049060,苜:-13.966831,寢:-11.887389,铨:-12.623096,淮:-9.944460,婷:-8.945146,偻:-11.807347,訂:-10.182641,耆:-13.050540,蘊:-11.236802,嬌:-10.127379,儐:-15.065443,膛:-11.104630,螟:-15.758590,庥:-15.065443,缤:-10.728152,鎧:-13.193641,用:-6.950221,謬:-12.262083,悱:-13.193641,粹:-10.346944,吾:-8.302136,裁:-9.300252,恆:-8.699832,蓉:-8.175343,始:-7.739307,郑:-10.860751,嗓:-11.715539,雕:-11.269954,毗:-13.561366,奠:-13.812680,緣:-9.547990,驢:-11.908443,彤:-11.292682,珧:-14.659978,陪:-13.273684,慰:-10.971099,響:-8.391513,清:-6.858178,辄:-12.324603,薈:-12.203242,瀑:-12.667548,醐:-12.925377,谙:-13.193641,撞:-10.273793,頡:-11.568936,鸥:-12.580537,嶸:-13.456005,钾:-13.679149,赃:-11.584203,久:-7.651774,荇:-14.372296,饋:-13.966831,镓:-14.372296,菜:-9.015710,瑩:-9.416469,门:-5.707114,詭:-10.996416,泮:-13.360695,聱:-14.149153,养:-8.183519,溃:-11.351871,褂:-15.065443,茆:-14.149153,鼎:-9.340225,皓:-11.194242,鄒:-13.966831,怜:-10.229161,审:-8.877179,稠:-10.987906,垩:-10.588106,榭:-12.292855,舰:-9.550000,羹:-12.232230,逼:-10.109616,圾:-10.225201,证:-7.689561,仃:-12.580537,楂:-12.986002,捆:-14.372296,鏑:-15.758590,煒:-10.485591,闕:-12.814151,棗:-13.119533,乘:-9.903518,招:-8.782242,赚:-14.372296,绣:-10.430714,層:-8.667681,烧:-9.578574,器:-8.459469,諫:-11.615456,镪:-15.758590,扰:-10.677186,函:-10.071615,灼:-11.183879,铿:-12.667548,有:-5.971524,颌:-11.114200,冒:-10.078418,甕:-12.095029,殖:-8.432125,氯:-10.075011,辮:-12.069711,砷:-14.149153,庸:-9.658271,琿:-15.758590,泄:-10.294759,卑:-9.578574,狐:-6.974122,啕:-11.715539,瓔:-13.561366,胜:-6.976728,另:-14.149153,雨:-7.787159,嗪:-15.065443,濮:-13.812680,懲:-12.069711,矾:-11.183879,舆:-14.659978,箋:-13.456005,萊:-7.744585,綏:-11.292682,匐:-12.986002,递:-11.376564,亙:-14.372296,笠:-12.868219,眨:-11.225991,梭:-11.599707,抱:-10.788777,纹:-10.130969,尺:-11.123861,炽:-10.971099,促:-10.683417,桂:-7.615945,摊:-10.954569,換:-8.742878,虞:-10.560093,鉦:-13.679149,坨:-15.065443,路:-6.887366,整:-8.897927,樁:-14.659978,讀:-10.261422,氅:-15.065443,趄:-13.812680,昉:-15.758590,砍:-12.868219,閔:-12.667548,育:-6.914831,骶:-12.714068,猻:-12.814151,难:-7.821930,毀:-12.986002,淄:-13.360695,塍:-15.758590,剑:-7.792004,靓:-12.121004,还:-9.593173,壢:-15.065443,哪:-12.925377,艱:-11.826765,惲:-15.065443,葵:-12.580537,競:-11.304243,卻:-10.853316,盾:-10.640597,暇:-11.389143,希:-7.514256,吐:-8.961767,宥:-13.360695,隧:-13.050540,瀨:-9.687853,禹:-10.560093,頸:-10.025249,诅:-13.456005,臉:-10.294759,峋:-13.561366,祎:-11.441102,赖:-9.061556,譚:-13.119533,拟:-10.346944,屠:-10.138190,盧:-9.425311,俭:-10.269653,黷:-12.925377,姹:-13.679149,發:-6.277994,洁:-8.564154,愉:-12.814151,垒:-11.826765,鬥:-7.043695,嘧:-12.292855,氫:-10.186436,京:-5.948645,縷:-11.304243,嚼:-11.524484,爿:-15.065443,道:-6.753185,单:-9.335343,裘:-13.679149,絡:-8.180445,煩:-10.490732,部:-5.622286,只:-11.481924,轭:-12.539715,呻:-12.868219,舊:-10.299005,箏:-12.095029,唐:-9.764629,薛:-11.846567,岡:-7.809852,素:-8.064653,抵:-11.997390,茴:-13.360695,倾:-9.665021,賁:-12.925377,摆:-9.886473,聞:-7.432074,秣:-13.193641,孤:-9.564185,全:-6.807539,误:-11.281254,数:-6.869282,至:-7.771746,壹:-13.966831,祸:-10.116683,闻:-7.432074,国:-4.124625,亂:-8.403588,膈:-15.065443,龌:-12.986002,鎔:-10.781857,众:-7.823361,红:-6.481994,璦:-13.360695,画:-8.922331,猿:-10.962800,淀:-10.068231,蝇:-13.966831,懈:-10.824116,翌:-14.659978,魏:-9.866946,廢:-9.534032,鯤:-13.193641,灩:-15.758590,蹭:-12.203242,森:-7.634440,葱:-11.225991,曲:-7.828384,项:-9.917949,啻:-15.065443,竺:-11.887389,陽:-6.145723,卿:-10.622792,一:-4.428159,撇:-11.524484,脊:-11.364141,搜:-13.273684,肟:-14.659978,御:-8.982083,妥:-12.175071,钧:-9.562146,谬:-12.262083,夺:-8.975265,匾:-15.758590,迁:-10.538235,觅:-11.681053,杆:-9.962533,泗:-11.414785,惟:-9.947449,竣:-14.372296,軫:-15.065443,酪:-14.659978,晰:-10.560093,对:-7.416703,電:-6.353177,嗽:-13.966831,漁:-8.942950,椅:-12.667548,按:-11.908443,納:-7.536305,隐:-8.998176,焕:-9.184910,謙:-8.247066,娣:-13.561366,綢:-9.706501,吧:-13.966831,议:-7.360181,戳:-13.966831,簷:-12.045018,媸:-14.659978,棄:-10.044858,拈:-12.580537,顏:-8.705869,坑:-11.376564,盐:-9.974765,敝:-14.659978,罡:-14.149153,巢:-10.554584,祥:-7.495258,噻:-14.372296,偿:-10.012387,現:-8.561155,殃:-11.481924,谂:-15.758590,文:-5.423450,蘆:-10.860751,福:-7.246812,騎:-10.658724,攜:-10.294759,缠:-11.788299,助:-7.972454,沭:-12.539715,贬:-12.667548,悵:-14.659978,帶:-8.570933,璽:-11.807347,求:-7.881952,装:-7.370595,鳍:-9.452315,穎:-8.870018,迫:-9.892122,杰:-8.725084,韻:-10.092164,栅:-9.880855,簍:-14.659978,咒:-12.175071,瀕:-13.360695,準:-8.472399,萝:-9.160081,鸡:-9.098015,唧:-13.119533,漫:-9.273955,蒲:-12.121004,宸:-10.490732,激:-8.421654,齋:-11.194242,屍:-10.527482,偕:-11.887389,他:-8.933130,橙:-10.123801,藜:-13.966831,繡:-10.430714,物:-6.149474,擲:-12.462754,绶:-10.490732,驹:-11.807347,坻:-13.456005,磺:-12.069711,鑽:-11.163471,璃:-8.052427,專:-8.690418,沓:-11.269954,且:-10.883393,颛:-15.758590,宝:-7.158344,麟:-10.411483,怠:-12.262083,氨:-9.625192,售:-8.544086,禱:-13.812680,方:-5.080053,萸:-14.659978,釁:-11.846567,狗:-9.260308,员:-4.852451,靚:-12.121004,统:-7.473834,叭:-10.774984,雯:-9.795011,鳳:-7.595219,念:-7.198338,苷:-10.640597,摸:-9.800166,橼:-13.812680,邀:-13.966831,厂:-10.809831,妆:-9.233561,紉:-10.996416,列:-7.480416,错:-9.662766,探:-10.201762,贩:-10.652645,户:-8.505828,螺:-10.588106,趾:-11.510095,允:-9.847794,聋:-11.236802,拌:-12.262083,虏:-11.143470,何:-7.715570,滔:-10.265529,留:-8.658563,筝:-12.095029,州:-6.395787,来:-6.041975,蛤:-11.133618,浩:-7.812327,俪:-13.119533,饱:-10.102599,懶:-11.826765,譽:-9.045634,儀:-9.909266,順:-8.183519,萎:-15.065443,涓:-15.065443,甘:-8.699832,龟:-11.058110,碱:-10.320511,娲:-13.812680,纵:-10.102599,郁:-9.512484,雅:-7.692069,寇:-12.232230,苍:-10.333640,孜:-9.769629,數:-6.869282,床:-10.741311,戍:-10.658724,树:-7.397583,辔:-13.360695,北:-5.363827,皚:-12.462754,弟:-9.378468,抢:-10.996416,梦:-7.969964,溪:-9.096736,眯:-10.324868,钮:-14.149153,紳:-13.561366,漿:-11.204714,魇:-13.679149,屉:-15.065443,腋:-13.119533,槐:-11.315939,赓:-13.360695,僖:-11.951928,瑙:-10.028491,囚:-12.814151,汩:-15.758590,跨:-15.758590,八:-6.227254,仪:-9.909266,鉭:-15.065443,坯:-12.868219,瓮:-12.095029,顱:-15.758590,鹵:-12.232230,惶:-10.015587,使:-9.014531,泾:-12.175071,刀:-8.575479,鄂:-10.670994,各:-7.886898,师:-7.075205,邗:-15.065443,骛:-12.324603,妝:-9.233561,蚣:-15.065443,侩:-13.679149,箱:-10.930277,騰:-8.904236,蘸:-14.372296,壇:-10.809831,筆:-9.335343,臍:-12.580537,李:-8.475829,译:-9.631721,仓:-9.815791,镚:-15.758590,糟:-10.962800,棧:-13.273684,警:-8.750085,凭:-11.631456,穰:-13.966831,銀:-7.339672,缉:-10.549104,麈:-15.758590,愍:-13.561366,肌:-10.167603,玖:-11.887389,娛:-13.273684,疚:-13.679149,羞:-10.455286,蔥:-11.225991,輩:-8.048834,催:-12.462754,薺:-13.966831,达:-6.923234,十:-4.946199,狀:-7.955972,终:-10.035005,泔:-15.758590,取:-8.498068,嗚:-10.160168,祝:-8.864934,苠:-15.758590,矮:-11.163471,平:-5.928211,旺:-9.767126,濾:-10.914403,匀:-12.292855,适:-9.941479,弈:-12.324603,挠:-11.997390,攤:-10.954569,炭:-10.430714,嘮:-11.553898,粵:-10.064858,举:-7.879299,鋁:-11.076459,埃:-8.259721,铅:-11.715539,穆:-9.130549,試:-8.456768,豪:-8.995861,煬:-10.593804,闯:-9.795011,嫱:-15.065443,读:-10.261422,楼:-9.051728,琅:-10.715165,縉:-12.623096,龈:-13.561366,怍:-13.679149,趔:-13.812680,犖:-14.372296,阙:-12.814151,崟:-15.065443,营:-7.707887,猫:-11.194242,沪:-10.229161,冬:-8.215847,宰:-10.611096,嶴:-13.456005,愷:-11.040092,蒺:-12.391295,珀:-12.262083,懌:-13.561366,勖:-15.065443,硝:-9.883660,菠:-13.679149,藤:-8.283818,卫:-6.821635,遭:-15.758590,目:-7.747235,驱:-10.156472,虹:-9.658271,擺:-9.886473,滾:-10.182641,霂:-15.758590,鴆:-13.050540,梓:-10.576807,輒:-12.324603,隗:-14.372296,写:-10.938309,鲛:-12.814151,搠:-15.758590,綱:-9.649343,耸:-10.640597,絆:-12.667548,慎:-9.437822,跑:-10.734710,试:-8.456768,盗:-11.104630,镖:-10.938309,竟:-11.751257,赦:-11.846567,铫:-15.758590,埭:-15.758590,鋯:-15.758590,己:-9.232096,寵:-10.838609,穴:-9.754703,垂:-9.759654,颈:-10.025249,服:-8.590781,蚌:-11.846567,嘗:-9.278546,鄙:-11.143470,娟:-9.620863,蔡:-11.846567,枢:-9.131873,丧:-9.603732,润:-8.014454,醮:-15.758590,莺:-11.269954,卅:-10.320511,狄:-10.355913,奉:-9.547990,術:-6.629243,嗖:-13.456005,煙:-8.574720,黜:-12.357393,裨:-11.974401,副:-8.430810,燮:-11.807347,时:-6.342538,腹:-9.772138,载:-9.108311,阂:-15.065443,斋:-11.194242,備:-8.049731,挤:-12.203242,粱:-11.510095,脸:-10.294759,铁:-7.014740,療:-9.392120,鋅:-11.733239,類:-8.743776,虢:-14.659978,闫:-13.456005,园:-8.614973,睬:-15.758590,嫵:-15.758590,份:-8.333233,潼:-12.069711,門:-5.707114,砉:-13.966831,馈:-13.966831,民:-3.836586,互:-8.587702,這:-11.104630,崛:-15.758590,鸝:-15.758590,暢:-11.364141,沦:-14.149153,甫:-9.730312,邮:-9.427089,宴:-11.631456,活:-8.059654,秈:-15.758590,荏:-12.667548,比:-6.982578,釘:-10.225201,壞:-9.845087,桩:-14.659978,卯:-12.121004,女:-7.956790,嘀:-11.584203,娈:-13.119533,養:-8.183519,茎:-13.050540,丐:-12.203242,钗:-10.307552,映:-9.818419,貧:-9.823696,樨:-15.065443,匮:-12.426386,舸:-13.679149,韁:-12.868219,勃:-8.835947,鯉:-12.986002,藍:-9.325650,近:-8.813539,浒:-10.571205,靖:-8.171280,绛:-12.714068,酚:-12.762858,屜:-15.065443,拣:-11.698147,车:-7.750890,襪:-13.561366,郯:-15.758590,忱:-15.065443,姵:-13.561366,軻:-13.360695,省:-7.460798,還:-9.593173,吗:-13.561366,錙:-15.065443,帛:-12.232230,蜡:-11.481924,咬:-10.338055,鎮:-8.039461,稳:-9.683244,膺:-14.659978,设:-8.088628,充:-9.996539,佑:-9.056630,絝:-12.324603,条:-7.873637,胤:-11.887389,镭:-15.758590,珮:-12.623096,緲:-15.758590,饵:-15.758590,億:-8.446037,枋:-13.456005,頊:-13.966831,伐:-8.227574,谒:-14.149153,紜:-15.758590,愤:-9.757176,刮:-11.568936,纱:-9.536014,抹:-10.838609,茸:-10.898778,沽:-9.411201,贼:-10.628692,雁:-8.865949,參:-8.463534,郅:-14.372296,繆:-11.751257,扎:-9.096736,裕:-8.978669,租:-9.232096,蹦:-11.114200,韫:-12.232230,哭:-10.163879,畬:-13.966831,罰:-10.634626,咂:-13.193641,瀅:-12.121004,庆:-7.162586,墊:-11.539083,損:-10.261422,辐:-9.409451,皖:-11.974401,弛:-13.360695,够:-12.925377,喬:-9.186308,焯:-13.273684,銮:-11.133618,笳:-12.623096,鲲:-13.193641,肺:-12.667548,椿:-9.923780,婉:-8.653625,旌:-12.868219,牙:-7.700263,鏘:-11.974401,僚:-9.730312,蟠:-11.615456,恥:-10.338055,狮:-10.081837,页:-10.485591,惺:-10.677186,堀:-12.986002,合:-5.883708,撓:-11.997390,骗:-11.204714,嶙:-11.951928,厝:-14.372296,渤:-11.887389,箭:-8.580808,崮:-12.391295,熱:-7.495258,阴:-9.066507,駁:-12.203242,勇:-8.428841,词:-10.253259,济:-6.264727,烛:-11.698147,盟:-8.734831,镞:-13.360695,泣:-11.481924,拧:-14.372296,腦:-8.633307,凱:-8.902128,灰:-8.108422,諷:-12.925377,扼:-11.258781,礁:-13.273684,缅:-15.065443,円:-13.679149,针:-10.171342,朕:-12.539715,羚:-12.814151,嘟:-11.647717,褡:-13.119533,枪:-9.200393,琳:-9.332102,嚴:-9.512484,总:-7.343430,组:-7.562705,啉:-14.659978,填:-10.282127,酱:-11.647717,味:-7.522170,珲:-15.758590,濺:-13.812680,綃:-14.372296,弄:-10.171342,率:-9.656032,逆:-9.078991,阊:-15.758590,谎:-13.050540,斓:-13.679149,舒:-9.164177,岙:-13.456005,醛:-11.908443,劝:-12.539715,猜:-12.095029,趣:-10.761378,亥:-8.031937,鄰:-10.290530,油:-7.815518,贸:-8.345223,为:-6.630437,抽:-11.733239,铉:-13.679149,諍:-14.149153,俏:-11.468131,扒:-12.623096,嵘:-13.456005,卜:-9.168289,詢:-10.178861,佤:-12.986002,僱:-13.456005,闳:-14.659978,囵:-13.193641,请:-9.273955,浸:-12.357393,臻:-11.468131,码:-10.194070,馀:-14.659978,龄:-9.298686,琉:-11.495911,昕:-10.875788,土:-7.320008,璞:-12.500494,蠡:-10.012387,檢:-7.413848,悦:-9.627364,礫:-12.175071,鲮:-13.360695,冰:-8.296375,申:-9.880855,躺:-13.966831,秀:-7.143182,幅:-9.060322,鍇:-12.814151,痈:-13.966831,柔:-9.767126,迤:-13.273684,摩:-8.081190,驭:-13.360695,狲:-12.814151,陵:-7.719433,豹:-13.966831,艽:-15.065443,擾:-10.677186,射:-7.462543,錆:-15.758590,嘈:-13.561366,颗:-12.925377,徙:-15.065443,钟:-8.661042,昨:-13.966831,鈰:-15.065443,儲:-9.201812,鯁:-13.456005,畊:-13.679149,藕:-9.607988,停:-10.054808,非:-8.070135,惧:-11.123861,荦:-14.372296,蕪:-12.147673,硬:-9.459641,雳:-12.814151,苻:-12.462754,蓿:-15.065443,如:-6.399313,紅:-6.481994,历:-8.330257,眉:-8.410647,喊:-9.923780,植:-7.943383,挑:-10.634626,芐:-15.758590,蒔:-14.659978,创:-9.392120,吟:-9.754703,瞞:-11.104630,败:-8.470346,咴:-15.758590,样:-7.923011,鹃:-8.965124,遇:-9.556055,盈:-9.235028,拐:-12.020921,擔:-10.374095,默:-8.057390,歡:-8.980944,賤:-11.751257,饭:-9.353362,屯:-11.067243,淺:-10.249202,頂:-9.411201,圈:-9.831664,残:-9.562146,馗:-15.065443,庙:-11.269954,缘:-9.547990,欠:-12.925377,辣:-9.405961,木:-6.883723,帮:-8.747376,璵:-15.758590,锴:-12.814151,輸:-8.152700,心:-6.301312,凇:-15.758590,牆:-10.677186,雉:-13.679149,湎:-12.986002,苑:-11.389143,恒:-8.699832,兜:-11.715539,艦:-9.550000,獰:-13.812680,音:-8.037685,畴:-14.372296,潸:-15.758590,藿:-13.679149,覌:-13.561366,于:-7.593796,我:-8.528027,薔:-13.050540,逝:-15.758590,梢:-11.005000,累:-9.481947,政:-4.669258,婁:-12.814151,節:-8.513649,居:-7.019214,槌:-15.758590,赏:-9.999689,提:-8.303292,嫖:-12.426386,灝:-11.997390,釜:-11.631456,回:-7.901110,橡:-10.374095,跤:-15.758590,孫:-7.927370,绮:-11.481924,坳:-13.119533,泺:-13.360695,聽:-8.779445,曾:-10.450323,娄:-12.814151,皇:-7.473329,锆:-15.758590,麗:-6.541672,妙:-9.200393,钛:-13.193641,怨:-10.425872,央:-6.197875,疱:-12.714068,鈴:-9.365000,罂:-13.812680,釉:-13.273684,塘:-9.757176,魚:-8.691271,噜:-12.232230,棣:-12.580537,荪:-15.065443,髯:-12.045018,瑰:-10.360428,叵:-11.733239,骄:-11.788299,喆:-13.193641,焉:-11.866770,邈:-15.065443,君:-7.977452,贡:-11.031203,脩:-13.561366,簫:-11.647717,措:-11.085762,馮:-12.175071,论:-7.427004,房:-8.976398,竄:-13.456005,陇:-11.269954,光:-6.754659,烈:-9.072729,位:-8.520812,滌:-10.527482,拔:-9.421765,飘:-9.418231,雜:-9.059090,浡:-15.758590,賠:-12.500494,步:-7.693325,鍵:-9.448672,淶:-13.812680,懾:-11.698147,瞇:-10.324868,儈:-13.679149,墙:-10.677186,纭:-15.758590,锰:-10.996416,嘲:-11.327774,褸:-14.372296,軍:-6.137864,蓑:-15.758590,晒:-11.123861,苕:-15.065443,奘:-11.664246,痛:-9.317644,驚:-8.357359,坜:-15.065443,遞:-11.376564,葦:-12.069711,異:-8.492462,勵:-11.225991,迷:-8.962885,楸:-13.966831,藻:-11.454525,杼:-13.050540,稅:-9.311285,瀉:-11.846567,渍:-12.232230,弗:-9.316050,谡:-13.193641,溢:-10.102599,訥:-14.659978,紫:-8.403588,貶:-12.667548,攻:-9.532054,肾:-12.986002,屁:-10.658724,範:-6.772644,偉:-7.432558,燈:-9.497099,赋:-11.681053,乍:-11.510095,嫚:-15.065443,韜:-11.327774,污:-9.204657,诤:-14.149153,恩:-7.116352,臨:-9.040786,鹭:-12.095029,关:-7.130393,盲:-11.769606,櫺:-13.679149,虽:-13.119533,窃:-10.708734,璇:-11.807347,霆:-11.615456,謎:-14.149153,抓:-11.441102,宙:-9.390403,際:-6.229215,喝:-10.277951,渠:-10.425872,誣:-15.758590,維:-6.426741,伶:-10.064858,施:-7.698998,萼:-13.456005,終:-10.035005,哇:-10.922309,介:-7.643368,煊:-13.050540,盛:-8.188147,呜:-10.160168,烟:-8.574720,习:-8.547772,赢:-12.426386,蝦:-13.119533,籬:-12.045018,飯:-9.353362,癰:-13.966831,预:-10.938309,垆:-14.149153,冊:-10.116683,貌:-10.311853,嘛:-10.971099,借:-10.071615,褥:-12.121004,縫:-11.327774,岬:-13.679149,鮮:-8.052878,覺:-9.158720,怿:-13.561366,绀:-13.456005,驃:-13.050540,卉:-11.631456,狈:-10.946406,泌:-9.676372,忖:-13.561366,高:-5.941587,姚:-11.215296,铜:-9.338595,裤:-12.147673,捩:-15.758590,幫:-8.747376,篮:-10.233137,酵:-12.069711,开:-6.750856,处:-7.781308,疇:-14.372296,阆:-14.659978,逊:-9.883660,討:-8.768334,咝:-14.149153,甜:-9.883660,亡:-8.528027,漠:-10.351419,椤:-15.758590,挨:-11.364141,皱:-13.360695,霰:-13.966831,鄴:-12.667548,蔼:-10.946406,嗇:-12.814151,緗:-15.758590,存:-8.027976,矛:-9.845087,營:-7.707887,鉞:-12.814151,你:-10.838609,旧:-10.299005,聪:-9.129227,峭:-11.414785,僵:-12.069711,跷:-14.149153,歸:-8.237814,蟻:-11.807347,岂:-12.623096,怕:-9.463324,崗:-8.045253,纖:-9.145206,騙:-11.204714,碚:-14.372296,償:-10.012387,钲:-13.679149,冴:-12.580537,愿:-8.280421,秄:-15.758590,镇:-8.039461,珈:-13.360695,淌:-13.812680,某:-11.389143,廖:-11.715539,壚:-14.149153,關:-7.130393,勞:-7.883471,桥:-8.317270,扩:-10.788777,即:-9.667281,遵:-11.031203,詹:-10.831337,棺:-11.553898,拾:-12.045018,怀:-8.292363,氈:-13.966831,脖:-11.539083,料:-8.530202,蜚:-11.908443,贞:-8.295227,錢:-8.619723,欲:-8.569423,侵:-10.397298,銷:-8.596968,然:-6.137797,眺:-15.065443,宽:-10.171342,豈:-12.623096,盏:-13.812680,摘:-13.679149,话:-7.680833,仟:-13.966831,揭:-13.679149,酶:-12.020921,痹:-11.974401,萃:-12.500494,掂:-13.456005,訇:-15.065443,榆:-11.225991,逋:-14.659978,鰓:-13.193641,引:-8.378335,渟:-15.758590,邠:-15.758590,厢:-10.501095,鲨:-15.758590,循:-9.842388,茭:-15.758590,抬:-11.022392,械:-8.232950,溴:-13.679149,刷:-9.616553,锹:-15.758590,视:-7.342987,罕:-9.350062,衛:-6.821635,柚:-13.193641,淞:-9.875268,鑣:-13.812680,秦:-10.303269,嵩:-10.824116,景:-7.137037,凶:-10.611096,铸:-11.568936,基:-6.899085,巾:-10.217327,愀:-14.372296,銍:-15.758590,频:-10.360428,缔:-10.824116,蘚:-11.951928,頦:-13.360695,鸪:-12.986002,足:-7.626766,亵:-15.065443,媽:-8.552955,簾:-9.737567,旃:-12.714068,敘:-10.664840,俟:-13.966831,郡:-10.127379,嗣:-8.613394,寧:-7.002223,鳩:-13.456005,絨:-10.946406,棱:-10.511566,該:-11.173623,啸:-9.480069,竽:-13.456005,梆:-11.058110,刍:-13.119533,霏:-12.868219,璎:-13.561366,堑:-13.679149,帕:-9.301821,讜:-15.065443,掬:-14.149153,踵:-9.965577,晅:-15.758590,裆:-12.539715,汉:-5.391400,車:-7.750890,牍:-14.659978,双:-8.102253,铎:-13.360695,姐:-9.164177,轟:-9.436025,泞:-15.758590,绪:-8.701553,杯:-9.962533,闸:-11.414785,固:-8.871038,戀:-9.625192,辉:-8.694686,咏:-10.316173,鮑:-12.203242,库:-9.126589,蔚:-11.339750,疥:-13.812680,義:-6.734218,蒯:-14.659978,猶:-9.295561,町:-12.580537,蹈:-9.779705,瓏:-11.846567,坎:-10.802763,结:-7.656004,鏡:-9.309701,瑤:-9.383566,襲:-10.163879,淵:-9.078991,噸:-9.249821,秽:-11.807347,憂:-9.520266,伉:-13.561366,瞎:-9.006320,袜:-13.561366,氟:-10.616927,冢:-10.031743,钤:-13.812680,宦:-13.812680,悬:-10.316173,贵:-7.992597,倷:-13.679149,霹:-11.553898,碼:-10.194070,尿:-9.022810,臂:-10.261422,故:-9.987149,识:-7.238003,筑:-7.247617,駒:-11.807347,絕:-9.437822,揖:-10.922309,詛:-13.456005,濞:-14.659978,卡:-7.986259,陣:-8.252548,顧:-8.385844,彩:-7.853518,扫:-10.106101,摯:-14.372296,賴:-9.061556,叶:-7.699630,飼:-12.045018,忾:-12.357393,压:-8.752801,骑:-10.658724,純:-8.863920,條:-7.873637,踞:-13.812680,匠:-11.076459,逢:-9.864188,唤:-10.802763,莫:-7.678663,薯:-12.925377,父:-9.715958,績:-11.247731,荀:-12.986002,柃:-15.758590,噎:-12.714068,蛙:-12.357393,裝:-7.370595,獠:-13.119533,黩:-12.925377,惭:-11.698147,衲:-12.324603,泵:-10.209514,盹:-12.986002,奼:-13.679149,蜃:-11.204714,三:-5.476358,倍:-10.127379,锏:-15.758590,皎:-12.462754,娑:-15.065443,鼓:-8.918044,尕:-13.561366,亞:-6.332091,許:-9.432441,儷:-13.119533,扁:-12.324603,賊:-10.628692,凌:-8.555185,寐:-10.930277,飒:-12.580537,拖:-10.543655,據:-7.294587,赟:-11.908443,滞:-10.906560,捫:-15.758590,哺:-14.659978,栈:-13.273684,咋:-13.679149,鞍:-9.680948,瘌:-14.372296,墓:-9.443232,东:-6.398538,疡:-12.262083,吠:-14.372296,玥:-15.758590,判:-8.166729,鴦:-11.215296,芯:-11.095151,漲:-11.104630,徽:-8.631700,社:-7.676806,滇:-12.539715,陌:-15.758590,归:-8.237814,违:-11.997390,闡:-13.966831,瑠:-11.599707,腮:-11.215296,深:-8.508665,轲:-13.360695,镶:-12.426386,鍺:-15.758590,幼:-9.423536,考:-8.739294,殊:-9.358333,圍:-10.338055,頓:-9.286244,肘:-15.065443,樟:-11.236802,钠:-14.149153,瀣:-12.667548,垢:-11.647717,風:-6.789430,宪:-7.986680,贱:-11.751257,炸:-8.590781,尻:-12.986002,诊:-10.237130,野:-7.878542,嫔:-13.679149,旖:-12.069711,揚:-8.599299,啡:-9.495192,遣:-10.081837,矢:-11.215296,扯:-11.846567,郸:-12.020921,类:-8.743776,穿:-11.681053,攀:-11.076459,喋:-11.327774,隍:-11.510095,紐:-9.903518,笔:-9.335343,溝:-10.088709,唠:-11.553898,碩:-9.669546,渲:-14.372296,琶:-11.495911,鶻:-12.262083,爺:-9.333721,砾:-12.175071,珏:-12.580537,偎:-15.758590,魔:-10.229161,慘:-12.175071,潜:-8.680249,鋥:-13.561366,忧:-9.520266,票:-9.257301,泱:-12.462754,烹:-14.149153,典:-8.788800,绽:-12.814151,彼:-8.770177,顾:-8.385844,暂:-14.659978,锋:-8.536755,嘍:-15.758590,炎:-9.500923,少:-6.840208,餓:-12.925377,朗:-8.453402,洛:-7.371050,辜:-12.762858,馨:-11.005000,媪:-15.758590,蘭:-6.624915,谱:-9.938507,殴:-15.065443,鸽:-13.360695,嬿:-13.679149,桉:-15.758590,郎:-8.563403,赛:-8.661042,九:-6.640475,酣:-12.623096,剥:-13.119533,蟬:-11.664246,仲:-8.093306,说:-7.800363,勺:-12.232230,昀:-13.456005,縐:-11.846567,研:-8.275346,掙:-12.324603,脚:-8.518658,涝:-12.667548,箩:-14.659978,肯:-10.485591,洲:-7.582480,眶:-11.067243,麻:-8.008406,但:-12.121004,烏:-9.504762,华:-5.276497,托:-7.741283,距:-9.190513,汜:-12.095029,韡:-13.561366,灤:-11.846567,旭:-8.403588,濱:-9.757176,买:-8.832013,靶:-13.360695,斂:-13.193641,澆:-11.104630,阋:-13.456005,透:-9.112200,夕:-9.644908,搗:-12.324603,減:-10.708734,簧:-11.022392,骨:-8.335022,蔭:-10.721638,犸:-12.500494,粼:-12.539715,歉:-15.758590,哌:-13.050540,网:-8.878206,著:-8.594644,坡:-9.248332,痢:-12.925377,入:-7.815518,孩:-7.720078,蓬:-10.316173,息:-7.059242,裴:-13.456005,瑷:-13.360695,鋸:-12.147673,繻:-15.758590,出:-7.232834,蚁:-11.807347,最:-11.204714,肅:-9.304965,誉:-9.045634,型:-8.772024,甌:-14.372296,宓:-14.149153,鸦:-12.147673,窩:-9.932590,戮:-13.273684,讳:-11.788299,氲:-13.679149,淇:-11.114200,镌:-15.065443,剎:-10.205631,齐:-8.438063,篓:-14.659978,浜:-15.758590,口:-6.388515,煤:-10.795746,巧:-8.571689,艮:-10.954569,佰:-10.670994,棵:-10.824116,陶:-9.502840,卸:-9.912152,遺:-9.797585,驾:-10.622792,范:-6.772644,贇:-13.456005,溆:-13.360695,名:-7.104247,鬓:-12.292855,粒:-9.625192,堕:-13.193641,莘:-11.846567,椟:-14.659978,鞠:-12.868219,紧:-9.568275,度:-6.994225,斬:-11.114200,榴:-9.091634,晁:-13.456005,裊:-11.681053,硕:-9.669546,委:-4.898246,惚:-11.769606,襟:-10.938309,櫞:-13.812680,瓢:-12.868219,健:-8.204256,绦:-13.273684,述:-9.962533,祿:-9.923780,要:-7.694268,栀:-15.065443,辅:-9.787329,序:-8.902128,鬢:-12.292855,羥:-15.065443,吨:-9.249821,被:-11.974401,洮:-12.925377,邻:-10.290530,缺:-10.329245,甾:-13.966831,血:-7.481941,蹄:-9.536014,拇:-9.704151,磋:-14.659978,驌:-15.758590,经:-6.021453,遐:-9.944460,卒:-12.121004,柵:-9.880855,饶:-11.123861,緹:-15.758590,调:-8.737506,與:-8.445370,樗:-15.065443,芜:-12.147673,星:-7.510847,颠:-10.781857,客:-9.143865,钨:-11.281254,檬:-10.445384,脱:-9.850507,暴:-9.470732,嘿:-15.065443,臆:-13.050540,敉:-15.758590,嫌:-13.966831,囔:-12.462754,號:-8.918044,彥:-13.561366,燦:-9.510548,湯:-10.277951,胰:-15.065443,摳:-15.065443,穷:-9.552014,鋼:-9.312871,袁:-10.781857,邑:-11.215296,隕:-15.758590,蠖:-15.758590,沙:-7.394082,夠:-12.925377,纥:-15.758590,璩:-15.065443,阪:-12.762858,辯:-10.628692,氮:-11.631456,戲:-9.082767,轄:-6.432692,秋:-7.262825,屎:-14.372296,酐:-13.812680,祠:-11.866770,色:-7.028385,顶:-9.411201,狽:-10.946406,鑾:-11.133618,們:-10.273793,愛:-7.180678,亚:-6.332091,期:-7.539264,閨:-11.715539,設:-8.088628,伯:-6.527468,嬷:-11.539083,綸:-12.462754,諂:-15.065443,俄:-8.870018,胆:-9.393840,積:-7.623830,富:-7.615945,鳎:-15.758590,灑:-11.269954,鋒:-8.536755,埔:-8.685321,滚:-10.182641,擞:-11.510095,烦:-10.490732,楫:-13.456005,盪:-8.452730,诬:-15.758590,潯:-13.966831,筷:-14.372296,壶:-12.814151,建:-5.859663,睿:-10.906560,超:-8.342212,爐:-10.346944,嚓:-13.561366,謖:-13.193641,丘:-9.194735,管:-7.483978,娠:-10.971099,尤:-10.095630,錦:-8.018796,瞩:-10.338055,貯:-11.929949,徹:-9.478195,銻:-13.193641,紺:-13.456005,钿:-12.357393,眾:-7.823361,立:-6.435189,題:-9.582723,彎:-9.685546,兒:-7.520847,这:-11.104630,湘:-8.932045,廣:-6.395958,僧:-9.616553,韩:-10.480476,轮:-8.723322,翹:-12.667548,幸:-9.894959,概:-11.510095,复:-7.655399,美:-6.024706,熒:-14.149153,栗:-11.225991,戛:-11.681053,骠:-13.050540,縣:-9.350062,鲤:-12.986002,厦:-11.681053,隨:-9.316050,喪:-9.603732,茱:-12.262083,纸:-9.674091,刻:-8.417107,炼:-10.971099,观:-8.117987,浅:-10.249202,杉:-9.176565,勐:-13.812680,街:-9.086557,毖:-12.175071,余:-6.608531,淚:-9.443232,橫:-8.800142,修:-8.364712,寶:-7.158344,侃:-10.677186,洄:-12.868219,月:-7.293744,宋:-9.375084,颍:-12.020921,銑:-15.065443,垓:-14.659978,钕:-15.758590,訖:-15.065443,优:-8.883358,谚:-13.561366,蘞:-15.758590,粥:-13.456005,鈦:-13.193641,在:-6.779048,讫:-15.065443,瘾:-12.667548,濃:-10.209514,资:-6.304755,懇:-11.751257,蝈:-14.149153,饌:-15.065443,潘:-11.414785,胝:-13.812680,慜:-15.758590,筠:-12.426386,鳥:-10.038279,睨:-14.149153,拱:-10.197909,聲:-7.284305,驶:-8.916975,烽:-12.462754,兼:-9.764629,較:-11.095151,刑:-10.213413,霓:-13.360695,炒:-13.456005,吕:-9.660516,辘:-12.045018,挛:-12.714068,膜:-10.009197,咪:-11.664246,舱:-14.659978,掰:-14.149153,夷:-9.283158,医:-7.969964,裂:-9.735143,晉:-9.502840,蓊:-15.065443,黎:-8.082580,瑕:-15.065443,嗔:-13.273684,乙:-8.983224,履:-9.903518,噩:-11.553898,浯:-15.065443,杳:-13.456005,祷:-13.812680,獻:-7.231645,畿:-12.986002,图:-8.282684,趁:-14.149153,龍:-6.908073,琐:-14.372296,贖:-11.866770,枝:-9.031159,锦:-8.018796,倨:-13.966831,貫:-8.867981,妹:-9.603732,钻:-11.163471,笺:-13.456005,曇:-13.679149,奎:-10.213413,仗:-10.683417,籠:-11.733239,釩:-12.714068,旱:-10.962800,矽:-11.568936,噼:-11.951928,蘇:-7.928165,禎:-11.599707,唑:-12.539715,瞒:-11.104630,匕:-13.966831,渗:-12.069711,蚜:-15.758590,戟:-11.866770,鲠:-13.456005,骤:-11.351871,瘧:-13.561366,撰:-13.812680,茵:-10.031743,帷:-11.304243,吻:-14.149153,霽:-11.769606,流:-6.964675,迂:-14.659978,菊:-9.077736,畑:-12.069711,淖:-12.121004,葛:-8.501588,兩:-7.402740,恳:-11.751257,寺:-9.445042,誅:-11.751257,欄:-10.689686,肉:-8.555929,愈:-9.795011,宏:-7.349651,窥:-11.866770,嬤:-11.539083,亭:-9.715958,讯:-8.553698,膳:-13.679149,閻:-11.031203,瀾:-10.475387,赀:-15.065443,腈:-13.360695,镐:-12.292855,鍔:-13.966831,俗:-9.697134,裙:-13.561366,杜:-9.113499,姣:-11.539083,佬:-9.944460,衮:-13.456005,奸:-10.747955,蜇:-13.273684,把:-8.848837,碎:-9.754703,向:-7.371962,咦:-13.561366,努:-9.252806,萱:-14.149153,新:-6.243416,舵:-11.376564,掴:-15.758590,強:-8.323743,頹:-13.456005,匿:-11.339750,汁:-11.143470,忌:-9.532054,风:-6.789430,叔:-8.754616,櫚:-11.236802,荟:-12.203242,屡:-11.468131,绢:-12.292855,瓦:-7.584733,罷:-10.316173,島:-8.352487,栄:-12.986002,莉:-8.538948,戈:-9.138517,簌:-11.414785,褚:-11.974401,羡:-10.860751,堤:-12.539715,玩:-8.914840,刨:-14.659978,身:-7.608411,芳:-8.136416,容:-7.009175,示:-8.373980,喽:-15.758590,櫃:-10.387952,擇:-9.114801,限:-6.805338,達:-6.923234,藝:-7.429898,嫣:-11.681053,哧:-12.324603,柱:-9.418231,蕲:-14.372296,懵:-11.929949,饺:-15.758590,呼:-8.328476,鍾:-13.050540,企:-7.931350,涂:-9.669546,萇:-11.327774,憊:-11.067243,崍:-12.500494,儕:-15.758590,誘:-13.193641,蒜:-12.020921,稣:-13.050540,颤:-12.020921,垦:-13.119533,丫:-9.685546,购:-9.834335,尷:-15.065443,嘻:-9.217560,潁:-12.020921,什:-6.208925,蟆:-12.986002,捉:-10.816948,虛:-8.367175,奥:-8.424261,湫:-14.149153,賬:-12.462754,登:-8.600855,灿:-9.510548,躁:-14.372296,袅:-11.681053,挈:-12.357393,律:-7.439604,鲍:-12.203242,邕:-13.193641,舞:-8.826143,纡:-14.372296,张:-8.184032,辫:-12.069711,莳:-14.659978,砺:-13.679149,咽:-10.788777,爾:-5.380920,襄:-9.303392,蓝:-9.325650,獨:-8.197469,竹:-9.226256,學:-4.878752,顺:-8.183519,啼:-11.123861,丁:-7.932946,沂:-11.076459,對:-7.416703,洗:-10.788777,望:-8.417107,薜:-14.149153,感:-7.590671,岢:-13.966831,谭:-13.119533,圻:-12.814151,疼:-11.997390,儿:-7.520847,賂:-11.997390,桅:-15.758590,蛆:-15.758590,籍:-11.215296,棚:-13.193641,幡:-12.580537,剩:-11.269954,跬:-15.065443,致:-8.528752,延:-7.948238,壺:-12.814151,勾:-10.664840,戌:-10.311853,辕:-11.584203,渔:-8.942950,疙:-10.971099,娜:-9.744875,涩:-12.462754,輪:-8.723322,厭:-10.831337,徵:-8.750990,芷:-8.940760,机:-6.512979,派:-9.327259,附:-9.701806,竇:-11.339750,鱈:-15.758590,泓:-11.441102,勗:-15.065443,廟:-11.269954,晤:-10.411483,班:-7.172804,年:-6.437067,毽:-13.050540,耋:-13.561366,羊:-8.975265,谓:-11.584203,垚:-14.659978,骜:-11.887389,縟:-12.391295,肠:-8.881294,蚤:-12.714068,貨:-8.056486,倫:-7.432558,侪:-15.758590,犬:-10.460273,嘯:-9.480069,碰:-10.824116,蔹:-15.758590,捍:-12.868219,藎:-15.758590,诒:-12.667548,仔:-10.329245,鉗:-13.966831,顛:-10.781857,矚:-10.338055,孝:-8.079339,董:-11.401882,火:-7.341218,米:-7.201600,黴:-9.340225,湿:-9.620863,邁:-10.397298,喃:-10.715165,隅:-11.049060,宇:-8.313757,演:-8.696399,逖:-14.149153,窝:-9.932590,醫:-7.969964,踪:-11.524484,劭:-12.391295,琮:-12.868219,稲:-13.679149,庵:-12.147673,获:-9.599495,昺:-15.758590,剂:-11.733239,靄:-13.119533,篇:-8.382708,懋:-11.401882,柏:-8.207929,轔:-15.758590,受:-9.156003,胡:-8.850835,绵:-9.638293,聶:-11.143470,锃:-13.561366,尉:-10.582441,贓:-11.584203,丕:-9.201812,猗:-12.814151,閘:-11.414785,膠:-10.616927,攣:-12.714068,欧:-9.365000,趨:-11.826765,殼:-10.402004,净:-9.057859,飆:-15.065443,才:-8.221160,桑:-8.775728,諒:-12.986002,糞:-12.262083,拢:-12.069711,哮:-12.623096,絳:-12.714068,捷:-9.779705,縈:-11.951928,亓:-14.659978,趕:-11.846567,气:-6.728574,嘘:-12.623096,锚:-15.065443,採:-8.952868,斥:-11.584203,贪:-11.133618,钯:-15.758590,貿:-8.345223,漾:-13.966831,鉀:-13.679149,鑄:-11.568936,职:-8.229184,詐:-11.510095,滓:-12.714068,韙:-13.812680,駝:-12.462754,菡:-15.758590,藥:-7.789233,迩:-14.372296,燭:-11.698147,篱:-12.045018,饲:-12.045018,槽:-12.175071,隘:-13.812680,喚:-10.802763,颜:-8.705869,從:-8.458118,别:-7.616527,鄭:-10.860751,炬:-8.757345,启:-7.847633,鬱:-9.512484,帳:-14.149153,獁:-12.500494,畅:-11.364141,哄:-10.138190,廈:-11.681053,蟎:-13.360695,角:-7.662078,遗:-9.797585,驛:-12.667548,佩:-8.261938,淪:-14.149153,瑯:-10.715165,繳:-13.561366,鳴:-9.322440,裼:-14.372296,甄:-14.149153,妇:-9.730312,缈:-15.758590,皙:-15.065443,團:-7.320008,夜:-8.820306,鸞:-12.500494,抡:-15.065443,撥:-10.971099,傭:-10.178861,戶:-8.505828,携:-10.294759,渾:-11.194242,婆:-8.295227,届:-8.840885,族:-6.503468,赔:-12.500494,雙:-8.102253,寛:-13.679149,祜:-11.351871,苡:-15.758590,蓥:-11.788299,热:-7.495258,公:-4.987918,孰:-12.623096,曹:-10.708734,葺:-13.273684,刁:-13.812680,鞘:-11.908443,笛:-10.971099,咚:-12.391295,庞:-10.565634,莠:-11.866770,辨:-9.524180,唯:-9.370029,枸:-15.065443,恍:-10.891056,蛎:-15.065443,汕:-12.357393,瓚:-12.391295,绞:-10.875788,泪:-9.443232,釬:-12.925377,慷:-12.714068,死:-7.817651,庇:-10.996416,融:-8.919114,昌:-6.505861,锖:-15.758590,熙:-9.980938,錚:-10.979467,帜:-11.143470,斡:-11.005000,接:-7.954747,账:-12.462754,钫:-15.758590,垭:-13.812680,宵:-10.355913,收:-7.736021,費:-7.195468,挺:-9.984039,調:-8.737506,烃:-15.758590,坂:-10.109616,织:-7.493455,擋:-12.623096,豐:-8.642196,詔:-10.015587,囗:-13.679149,灘:-11.887389,菥:-15.065443,桨:-12.868219,短:-9.016890,噬:-12.580537,酮:-11.681053,婴:-11.351871,逃:-10.022018,包:-8.679406,憎:-12.426386,厚:-8.169761,妞:-11.664246,含:-9.993399,霭:-13.119533,脹:-10.616927,哀:-10.360428,獅:-10.081837,祉:-15.065443,鯊:-15.758590,浑:-11.194242,彝:-10.670994,驟:-11.351871,柢:-15.065443,淦:-11.908443,牯:-15.065443,胸:-10.411483,軼:-11.058110,銅:-9.338595,徇:-13.119533,颉:-11.568936,誕:-9.984039,炙:-11.269954,蘢:-13.456005,报:-8.588471,谦:-8.247066,訪:-9.308120,岱:-12.232230,馳:-10.640597,搶:-10.996416,访:-9.308120,栾:-15.065443,镀:-15.758590,燃:-9.649343,屆:-8.840885,旋:-8.538217,描:-9.938507,赐:-10.061497,槓:-15.065443,乒:-10.445384,黝:-10.683417,察:-5.840461,若:-7.693325,楨:-12.232230,遮:-10.333640,惹:-11.664246,艺:-7.429898,佼:-10.831337,吁:-9.962533,皂:-10.831337,茏:-13.456005,褓:-13.561366,咖:-13.679149,紛:-9.723109,龜:-11.058110,增:-8.618137,愣:-11.929949,瞬:-9.767126,匯:-9.370029,箴:-15.758590,踽:-13.966831,瑁:-15.758590,胎:-10.522148,軒:-10.741311,轧:-13.193641,畫:-8.922331,韬:-11.327774,杷:-13.679149,歿:-15.758590,瘀:-13.561366,劃:-7.642173,稈:-14.372296,辑:-8.325515,渐:-10.677186,霖:-11.292682,玙:-15.758590,刘:-9.108311,輦:-12.986002,献:-7.231645,款:-9.727905,陀:-9.308120,遄:-14.372296,櫓:-13.193641,衔:-11.908443,哗:-11.085762,牘:-14.659978,壟:-11.733239,臥:-11.013658,恤:-11.647717,诩:-13.050540,翱:-15.758590,鵲:-12.292855,蝶:-10.611096,腺:-8.904236,嬉:-12.324603,蘋:-12.095029,休:-9.777176,訓:-8.808734,銘:-8.967369,縛:-12.121004,鲜:-8.052878,实:-6.693160,肤:-10.038279,氧:-7.903433,侦:-12.391295,誨:-13.561366,锭:-15.065443,纰:-15.758590,碴:-13.679149,茹:-10.628692,主:-4.782338,沼:-12.262083,睁:-9.938507,等:-7.228678,潑:-11.114200,燚:-15.758590,既:-10.035005,癫:-11.194242,铬:-13.679149,灯:-9.497099,叮:-10.571205,已:-9.176565,飴:-14.659978,購:-9.834335,桿:-9.962533,嶇:-12.623096,躑:-14.659978,通:-6.652833,薷:-15.758590,昶:-13.360695,樾:-14.659978,呂:-9.660516,魈:-14.659978,塊:-8.994706,毓:-9.217560,杠:-15.065443,胥:-11.751257,啬:-12.814151,彰:-11.510095,奴:-9.932590,泽:-6.055874,嘁:-11.997390,娉:-11.974401,脏:-9.224802,丑:-11.524484,沒:-7.738978,缛:-12.391295,挣:-12.324603,洧:-15.758590,亦:-8.502999,讨:-8.768334,船:-9.448672,掸:-13.119533,涼:-9.191918,铂:-14.659978,凄:-12.667548,俐:-11.269954,桕:-14.372296,盖:-8.656914,竞:-11.304243,荣:-7.784746,赧:-13.119533,滦:-11.846567,睫:-11.733239,敷:-11.427857,劇:-8.335022,閉:-9.834335,亏:-10.490732,昔:-10.677186,尘:-9.467021,锞:-13.193641,两:-7.402740,斩:-11.114200,钳:-13.966831,放:-6.262770,鹄:-12.986002,兆:-7.911609,棋:-9.465171,坊:-10.906560,鷙:-15.758590,鏝:-15.758590,桠:-13.679149,迥:-14.372296,藩:-12.175071,噴:-10.245162,淹:-13.456005,揽:-11.076459,蕾:-9.784781,踏:-9.184910,涎:-11.481924,排:-9.847794,稗:-15.758590,妖:-11.974401,瀛:-11.304243,銜:-11.908443,瘟:-13.193641,氣:-6.728574,鄱:-15.065443,吳:-10.149119,费:-7.195468,沸:-9.658271,押:-10.795746,祁:-9.316050,哈:-7.297121,跎:-14.659978,慑:-11.698147,驗:-7.627354,陟:-12.426386,痞:-14.659978,佥:-12.203242,懦:-15.758590,硫:-10.922309,差:-9.248332,史:-7.367414,颁:-12.667548,缄:-12.925377,钉:-10.225201,認:-9.815791,蚕:-11.058110,朔:-10.868241,鸚:-13.679149,溥:-11.866770,伤:-9.246845,讷:-14.659978,渺:-13.193641,構:-8.849836,腐:-9.003986,凛:-9.591074,域:-9.545984,裡:-6.115624,楠:-11.568936,潤:-8.014454,竭:-10.593804,兰:-6.624915,蹺:-14.149153,帅:-9.821054,吉:-7.130930,蔓:-12.292855,抒:-11.163471,庚:-10.582441,真:-7.230853,夫:-7.061412,弯:-9.685546,週:-8.071052,阵:-8.252548,晕:-10.506317,绚:-12.020921,剝:-13.119533,赣:-11.183879,荧:-14.149153,歷:-8.330257,板:-8.775728,稀:-9.653797,成:-6.158102,搔:-13.273684,帘:-9.737567,倜:-12.095029,霞:-9.168289,殡:-15.758590,芻:-13.119533,蒿:-13.119533,练:-8.058748,奂:-12.714068,陈:-8.958420,啊:-12.667548,行:-5.865002,低:-9.190513,針:-10.171342,诡:-10.996416,代:-4.636739,汤:-10.277951,晨:-8.868999,秭:-15.758590,塬:-15.065443,懽:-15.758590,圉:-14.372296,疊:-9.638293,谏:-11.615456,澎:-10.329245,爛:-9.588980,誠:-8.924482,渣:-12.357393,性:-7.294587,蚨:-13.812680,锵:-11.974401,悼:-10.677186,闊:-9.932590,迎:-9.220451,鉛:-11.715539,線:-7.755896,蹣:-13.193641,桷:-15.758590,軸:-8.517224,骁:-11.951928,約:-7.889571,眈:-11.058110,袍:-12.426386,攔:-13.119533,騖:-12.324603,弘:-9.805347,蠢:-11.539083,沥:-10.954569,鮫:-12.814151,鶯:-11.269954,縮:-9.562146,励:-11.225991,瀲:-13.561366,显:-8.544822,靈:-7.901884,毋:-12.986002,告:-8.225432,乎:-8.848837,荐:-10.987906,染:-8.147738,姗:-9.599495,罘:-12.762858,叛:-11.049060,郝:-12.462754,煜:-10.351419,嗟:-15.758590,俣:-12.020921,杨:-8.773874,狱:-13.193641,印:-8.760081,遲:-10.156472,虾:-13.119533,威:-8.009699,嘉:-7.485254,贏:-12.426386,蜓:-12.580537,猛:-10.028491,岚:-9.667281,醜:-11.524484,生:-5.719611,漣:-13.193641,愧:-10.201762,螨:-13.360695,頭:-6.561741,现:-8.561155,圳:-8.709336,鐵:-7.014740,鋆:-13.561366,扑:-10.294759,竖:-10.906560,鍛:-13.456005,盞:-13.812680,拦:-13.119533,鏰:-15.758590,间:-8.049731,楷:-12.121004,捻:-15.065443,臼:-12.324603,境:-8.201640,嚇:-12.262083,醉:-9.383566,渌:-13.273684,涡:-14.149153,徭:-12.623096,骯:-15.758590,喱:-15.065443,邳:-15.065443,洶:-10.320511,欺:-10.728152,愾:-12.357393,驄:-13.273684,商:-7.252256,半:-6.661083,蹌:-11.067243,癜:-12.762858,募:-13.679149,跡:-10.416256,池:-9.536014,该:-11.173623,恨:-10.875788,饮:-10.460273,剴:-15.065443,赶:-11.846567,柽:-15.758590,腾:-8.904236,頃:-12.667548,疆:-9.306541,儉:-10.269653,谋:-8.027976,伍:-10.538235,题:-9.582723,琛:-12.539715,定:-6.721770,障:-9.984039,負:-9.266351,誤:-11.281254,昧:-11.339750,纬:-8.750990,锱:-15.065443,環:-7.927767,煉:-10.971099,救:-8.429497,蟒:-15.758590,捕:-11.715539,坝:-9.938507,衣:-8.137885,虧:-10.490732,旦:-8.952868,铰:-15.758590,裸:-10.522148,承:-6.796583,鲁:-6.930682,紀:-7.097816,妃:-12.020921,骅:-12.714068,躍:-8.376466,逞:-12.175071,没:-7.738978,踢:-14.149153,萦:-11.951928,航:-7.982055,庭:-7.485254,樺:-11.524484,秃:-10.914403,魄:-10.795746,呆:-9.514424,酈:-15.065443,淋:-9.252806,削:-10.265529,每:-11.553898,荔:-11.510095,志:-6.219018,飙:-15.065443,睜:-9.938507,叟:-12.714068,賡:-13.360695,浠:-12.714068,此:-7.174674,慨:-9.402483,续:-8.424261,彬:-9.853229,却:-10.853316,聾:-11.236802,封:-8.514363,餃:-15.758590,纂:-12.500494,娅:-10.979467,震:-7.992597,倉:-13.679149,犊:-12.203242,不:-4.439760,脓:-10.868241,岖:-12.623096,媚:-10.576807,亢:-12.292855,认:-9.815791,朧:-10.996416,膨:-9.348416,鸭:-11.058110,籁:-11.281254,寄:-9.134525,湍:-15.065443,摑:-15.758590,糖:-9.536014,噝:-14.149153,滢:-12.121004,擦:-10.277951,壮:-8.887499,闰:-12.580537,觸:-10.078418,馅:-15.065443,事:-5.832510,怔:-13.966831,娘:-8.554441,澡:-12.292855,财:-8.477205,掩:-10.883393,颯:-12.580537,銳:-10.406732,甲:-7.815873,况:-10.721638,買:-8.832013,肿:-9.971693,滋:-8.369026,豌:-14.372296,虐:-13.360695,拓:-9.923780,联:-6.777789,四:-6.110770,瑜:-10.338055,桤:-15.065443,菩:-11.997390,屬:-8.613394,側:-11.510095,轶:-11.058110,熊:-9.708857,钜:-12.580537,瀟:-10.303269,樣:-7.923011,芨:-13.679149,師:-7.075205,堯:-10.522148,皰:-12.714068,謹:-10.257332,檸:-13.561366,蔽:-10.355913,撼:-11.058110,释:-9.923780,村:-8.220628,慕:-9.774654,鱗:-10.130969,孙:-7.927370,陛:-13.561366,詣:-13.456005,硯:-11.351871,嗲:-12.814151,郴:-15.758590,諸:-9.400748,蓼:-14.659978,恿:-15.758590,它:-14.372296,颅:-15.758590,喇:-9.996539,例:-9.915046,洌:-14.659978,朐:-14.659978,鈞:-9.562146,传:-7.283887,谢:-9.210371,岭:-9.197560,種:-7.699947,琲:-15.758590,債:-10.392614,膿:-10.868241,层:-8.667681,症:-11.454525,赌:-14.372296,腔:-9.711218,铝:-11.076459,畜:-12.147673,嵬:-13.679149,驮:-15.758590,鑲:-12.426386,兴:-7.146997,蹶:-11.215296,艾:-9.586890,币:-8.518658,鬃:-12.925377,堅:-9.480069,皆:-8.774800,撒:-9.538000,紗:-9.536014,办:-8.718054,欣:-9.071482,莨:-12.623096,鰭:-9.452315,綬:-10.490732,夯:-15.065443,落:-8.444038,於:-12.762858,繁:-9.869712,硅:-11.568936,集:-7.503542,又:-8.864934,郊:-10.041563,恕:-12.426386,磚:-11.163471,狞:-13.812680,乡:-9.137185,波:-7.771746,曦:-11.664246,祯:-11.599707,哲:-9.243878,海:-5.722628,件:-8.340410,诸:-9.400748
+#S
+蘄:-10.005820,涉:-10.523076,唎:-15.269250,禑:-17.215160,鸔:-14.442571,愖:-16.522013,薙:-14.079666,洞:-8.369527,醡:-13.526281,咣:-12.514680,礦:-9.476672,鶩:-13.526281,悫:-15.605722,河:-7.791807,鄶:-14.730253,吸:-9.368961,碻:-15.017935,汈:-16.116548,郋:-17.215160,反:-7.704715,硐:-12.650812,鳓:-14.507110,忕:-11.921855,毝:-16.522013,遠:-7.703013,卢:-10.519361,知:-7.608059,鱨:-17.215160,彪:-11.135227,歲:-7.846193,迵:-17.215160,勷:-17.215160,睺:-14.912575,鯽:-12.661283,廿:-15.017935,莂:-17.215160,辊:-13.303137,劌:-14.912575,鮒:-13.025505,应:-7.067276,蠛:-13.551598,檜:-13.263916,鐣:-11.931956,圥:-16.522013,皤:-15.135719,芬:-11.468957,冶:-11.144422,骼:-13.551598,鍍:-12.287906,噏:-17.215160,痎:-14.442571,齕:-15.135719,湟:-12.693371,跞:-14.079666,僠:-17.215160,峨:-11.269739,虯:-12.924701,棰:-10.826599,鉷:-16.116548,啹:-13.526281,瓸:-17.215160,鹿:-9.710218,暅:-13.263916,贈:-10.774214,上:-4.754054,犍:-12.561200,餐:-10.774214,昚:-15.269250,爢:-15.269250,隥:-17.215160,宧:-17.215160,枯:-10.283688,伴:-9.858242,玷:-14.817265,阺:-17.215160,羿:-13.882956,杄:-14.442571,獌:-15.135719,壑:-12.027774,罔:-12.542331,譜:-9.494698,塦:-17.215160,裱:-12.796319,灶:-10.355545,铹:-15.269250,姻:-12.533029,欇:-17.215160,袆:-15.605722,钎:-13.453960,茗:-11.816997,輟:-12.039010,倡:-11.658332,熠:-16.116548,鬧:-8.812705,尩:-16.522013,栱:-13.781173,覰:-16.116548,琹:-17.215160,拂:-10.450121,豉:-15.017935,克:-8.471628,顑:-17.215160,嵓:-16.116548,畣:-17.215160,埤:-16.522013,腫:-10.256712,赳:-13.453960,乵:-16.116548,婽:-13.025505,篼:-14.170638,萄:-13.631641,澉:-15.423401,箑:-15.135719,鰔:-17.215160,挖:-9.247533,鎡:-13.718652,嚣:-12.704301,符:-10.533051,披:-9.991864,蜮:-14.650211,溳:-11.627911,錶:-13.501588,嘸:-13.172109,窻:-16.522013,鼾:-13.430970,所:-5.970611,蛃:-15.605722,湈:-16.522013,凍:-10.382128,黓:-17.215160,虘:-10.515660,槝:-12.171735,鉠:-15.605722,兢:-12.551721,鹨:-13.551598,嵪:-15.605722,臭:-9.704729,践:-11.177289,畺:-17.215160,峿:-17.215160,昃:-14.730253,膂:-14.650211,越:-7.543352,傌:-17.215160,馒:-15.017935,岔:-11.635430,訛:-11.419102,梜:-16.522013,愭:-11.228708,洵:-14.079666,貴:-8.808228,厶:-13.365012,礽:-14.650211,颼:-12.630193,蕅:-17.215160,毆:-12.146256,配:-9.306773,矎:-17.215160,恗:-17.215160,菖:-14.730253,江:-8.501907,连:-7.158308,勠:-16.116548,硧:-16.522013,廨:-12.884427,葯:-17.215160,櫰:-17.215160,遷:-9.242349,坹:-15.828866,相:-7.249073,鱿:-12.191280,撅:-11.498132,輈:-17.215160,鬐:-15.828866,粕:-13.453960,袝:-16.116548,钥:-12.496661,妧:-14.381947,簪:-12.378878,斯:-8.891552,蠲:-13.604242,熷:-10.269146,鐺:-13.688800,夼:-15.423401,綿:-11.329056,敄:-14.219428,觇:-13.996284,仉:-13.577574,煌:-10.693067,嫑:-13.749424,曙:-11.395077,襜:-14.576103,乞:-10.523076,狡:-12.273518,镤:-15.269250,婦:-10.125083,绩:-12.273518,普:-10.004342,諱:-10.860790,俳:-12.749252,牶:-17.215160,雹:-12.737823,寻:-9.056071,繾:-11.887284,椇:-14.730253,誆:-12.204525,侈:-13.226176,甏:-14.170638,階:-10.002866,宐:-15.269250,枘:-14.507110,负:-8.823530,刡:-16.116548,玠:-12.551721,帩:-17.215160,羨:-11.989413,樱:-11.398049,记:-8.297849,瘹:-14.124118,鞸:-15.135719,惂:-12.561200,蹉:-15.135719,泊:-10.338895,当:-6.553346,督:-9.924185,郢:-10.200346,嗤:-10.103648,荫:-10.427315,轳:-16.522013,塽:-11.014651,秼:-15.605722,斁:-12.266400,舄:-14.912575,榉:-13.882956,阌:-12.966665,儎:-13.501588,綑:-13.088026,騔:-17.215160,攖:-14.037106,膙:-16.522013,椞:-16.116548,閡:-13.718652,傣:-11.942160,紦:-13.172109,馩:-17.215160,撫:-9.939988,梳:-11.008584,锶:-12.427668,倸:-13.283334,粻:-16.116548,餾:-14.324788,胃:-9.929653,案:-9.237192,铋:-12.427668,埍:-13.072025,飓:-13.781173,寕:-13.688800,聘:-10.921741,鑠:-13.847864,坢:-13.551598,珥:-14.507110,孪:-13.072025,蟭:-14.324788,潲:-14.912575,诵:-11.090477,囷:-12.231553,獺:-12.452986,嫿:-14.442571,螂:-14.650211,琋:-17.215160,變:-7.812465,嚌:-14.650211,媔:-17.215160,谛:-11.431335,伝:-14.442571,溜:-9.743797,連:-16.522013,犤:-17.215160,札:-10.953668,蚬:-12.924701,欵:-17.215160,営:-17.215160,缽:-11.243898,麼:-7.880657,妾:-10.284665,荅:-17.215160,乇:-12.487772,淆:-14.730253,燎:-12.715350,晗:-13.919323,機:-8.370535,觞:-13.453960,哠:-13.882956,鷦:-12.109215,良:-10.120096,泰:-10.031289,陷:-10.029773,兹:-10.984679,驿:-10.688665,抅:-16.116548,褈:-17.215160,鴐:-16.116548,窕:-13.283334,戚:-11.401030,躝:-17.215160,瘢:-12.715350,銥:-12.693371,掯:-15.269250,踲:-14.730253,瞷:-17.215160,鈺:-14.270721,弼:-12.470228,箿:-17.215160,捄:-17.215160,过:-5.724306,睌:-12.796319,鏏:-17.215160,峑:-17.215160,答:-8.670936,惙:-16.116548,鍤:-13.244868,屦:-15.135719,瑶:-11.068831,郹:-17.215160,巻:-13.226176,硾:-15.423401,嶐:-15.828866,蜗:-13.207827,謟:-17.215160,吡:-12.760813,疠:-15.017935,禨:-12.784343,氱:-11.650640,亲:-7.939969,瀹:-9.757551,曂:-15.423401,衉:-17.215160,啋:-13.323340,鱑:-15.605722,奓:-15.135719,绒:-11.446839,浛:-14.817265,俜:-13.501588,煣:-17.215160,離:-8.031574,古:-8.171583,柬:-10.819898,襳:-17.215160,幽:-10.628988,翼:-10.053538,极:-7.578637,耄:-12.609990,伆:-13.226176,殉:-11.501427,羑:-14.442571,莙:-16.522013,些:-7.421543,鞡:-17.215160,劣:-11.360088,缦:-13.072025,暫:-9.966656,丰:-10.550751,檳:-14.037106,券:-10.984679,纻:-13.749424,鬾:-14.730253,橈:-12.470228,雋:-11.957665,嗍:-12.858451,繐:-16.116548,髓:-11.555678,艘:-9.124145,淝:-12.363130,啢:-15.017935,燥:-11.277624,奪:-9.172139,煺:-13.781173,瘋:-10.045040,覊:-13.604242,和:-3.986969,鶒:-15.135719,沜:-16.522013,鈣:-10.174624,炤:-13.501588,攭:-16.522013,椵:-17.215160,袴:-15.423401,垶:-14.124118,鲼:-13.604242,宾:-10.878334,濆:-11.203893,镍:-10.460556,偏:-8.963757,珎:-15.828866,饕:-11.937045,桟:-16.116548,诞:-11.868053,因:-6.933716,籧:-17.215160,嫨:-13.477490,聯:-9.182151,鑷:-14.037106,卹:-11.863302,狸:-12.897672,顿:-9.350356,蜀:-9.349588,悅:-11.548733,鼐:-11.835263,碕:-13.577574,怚:-17.215160,貝:-10.486531,琢:-11.947302,嶧:-13.303137,砪:-16.116548,憯:-13.847864,谲:-13.551598,崼:-13.056277,禿:-10.555866,慄:-17.215160,跇:-17.215160,界:-8.527212,量:-7.986783,廑:-15.135719,祔:-15.828866,拙:-11.717992,赜:-12.749252,盡:-7.993188,酤:-14.324788,扮:-10.327607,軱:-17.215160,癶:-16.522013,鋹:-15.605722,忻:-13.154717,洇:-14.650211,銎:-13.631641,徐:-9.463685,蔗:-12.704301,掘:-10.025992,褟:-13.283334,嘡:-14.270721,瞠:-13.813963,娩:-13.244868,箨:-14.124118,辰:-11.006570,爹:-9.149895,鎸:-10.846973,傺:-15.017935,虁:-12.981054,擂:-11.887284,坋:-16.116548,棊:-16.116548,鹑:-12.981054,潛:-9.757551,胚:-11.331838,铢:-12.514680,凤:-10.395144,飪:-13.408498,旬:-11.877622,槴:-16.116548,屽:-8.888643,踄:-15.605722,崎:-13.172109,熑:-17.215160,阔:-9.634971,椖:-16.522013,趙:-9.181177,岣:-12.146256,焦:-10.048894,閩:-10.472279,梫:-16.522013,贮:-11.345863,撳:-12.682561,尸:-9.392715,炻:-14.324788,锾:-12.505630,桀:-12.726524,賃:-12.784343,俅:-11.538406,摈:-12.897672,铓:-14.324788,埕:-15.017935,佚:-11.591143,揝:-14.576103,顠:-16.522013,孢:-12.211214,翥:-15.605722,鑨:-13.430970,坪:-10.472279,语:-8.789424,仯:-14.817265,捲:-17.215160,囿:-12.478962,砋:-15.135719,琓:-13.847864,鎒:-16.522013,抜:-17.215160,鰣:-14.507110,弥:-10.969053,纤:-11.216223,欭:-17.215160,朵:-9.933086,蚴:-12.363130,妶:-15.423401,銼:-12.630193,喾:-13.172109,轅:-12.671865,懆:-13.847864,魍:-13.577574,幏:-14.650211,橗:-17.215160,觖:-17.215160,晟:-13.263916,牧:-10.487728,釦:-15.423401,哨:-9.813929,蹯:-16.522013,惰:-11.569713,驷:-11.494848,嵹:-16.116548,糸:-14.650211,褀:-16.522013,溅:-10.800063,窍:-11.184475,鄐:-14.270721,划:-9.385928,皕:-15.605722,渚:-11.386214,芝:-10.685741,麥:-9.934463,厧:-14.324788,瘪:-12.452986,舲:-16.522013,箷:-15.605722,鸺:-13.207827,匼:-14.730253,瞿:-11.947302,潄:-13.957064,菇:-12.402976,筌:-15.269250,僑:-10.236946,泙:-17.215160,荜:-15.135719,磡:-15.605722,偦:-13.957064,瓩:-14.730253,汮:-17.215160,胱:-12.620040,硶:-12.630193,击:-8.825800,瑾:-12.505630,指:-7.714017,肆:-11.018716,缏:-13.072025,鲎:-12.386846,冐:-16.116548,謗:-12.833133,涘:-10.671248,堡:-9.907958,錧:-11.428263,吩:-13.551598,怱:-15.269250,簹:-12.363130,衁:-11.267125,葉:-8.777660,奋:-11.282915,遑:-13.072025,啓:-13.501588,狒:-16.522013,慛:-11.816997,忤:-12.505630,雪:-8.852518,毬:-13.659812,柴:-9.823745,酻:-15.828866,剽:-13.781173,珼:-17.215160,殁:-12.580431,谄:-12.427668,枉:-10.712370,頌:-10.814903,弎:-16.116548,玑:-13.104286,鐔:-16.116548,欖:-12.411139,辙:-12.966665,朞:-17.215160,庣:-11.371616,檫:-14.170638,鬶:-15.269250,常:-7.739230,犻:-12.363130,霾:-12.542331,橀:-12.295179,軃:-14.381947,晈:-16.116548,髋:-13.813963,姍:-13.577574,牐:-15.423401,雓:-14.270721,嗕:-10.448968,懝:-15.828866,奢:-11.962887,緥:-13.172109,陨:-12.332358,啪:-10.494940,壷:-15.605722,絺:-15.605722,哿:-14.219428,程:-9.567374,薊:-11.901954,瘓:-12.600040,醒:-9.280288,咔:-12.211214,舛:-12.671865,悜:-11.826088,鸣:-10.076293,崥:-15.605722,粤:-10.394053,椭:-12.570769,侮:-11.456258,攵:-14.170638,蒴:-12.858451,家:-6.593296,赅:-14.650211,揆:-13.226176,饍:-17.215160,屏:-10.366094,翎:-12.561200,镕:-13.781173,诖:-12.570769,付:-9.637526,摟:-10.031289,蟞:-17.215160,嫠:-13.577574,鏦:-17.215160,囨:-10.969053,拰:-10.730525,顷:-10.996560,役:-9.432770,绸:-11.407018,鑿:-10.296465,謀:-9.619773,沅:-11.413042,蜈:-15.135719,碍:-10.965185,錐:-10.669810,倒:-7.216635,氚:-13.263916,肝:-9.767992,砢:-17.215160,鲥:-14.507110,冧:-12.039010,琪:-12.833133,涯:-12.394878,鰺:-15.605722,儼:-12.302505,浄:-14.381947,臇:-15.269250,畔:-10.369280,滙:-16.522013,剦:-14.576103,盩:-15.135719,湮:-12.995652,英:-8.281892,究:-10.322518,黹:-15.605722,叻:-13.323340,百:-9.102632,愇:-16.522013,厐:-16.522013,丙:-11.360088,澘:-13.813963,蔟:-14.912575,娡:-12.061868,箠:-15.135719,鄧:-10.508298,嘩:-10.662652,莰:-15.269250,縹:-13.408498,岺:-16.116548,詁:-13.996284,佃:-11.243898,棂:-11.068831,擊:-16.522013,鉑:-11.491575,烒:-17.215160,賚:-13.577574,罣:-16.522013,飢:-11.261917,巤:-17.215160,譫:-17.215160,铪:-13.408498,槬:-13.847864,偽:-10.387531,燼:-13.847864,訄:-16.116548,憉:-13.688800,夎:-10.816565,疑:-10.172874,鈔:-10.599095,洖:-11.839882,愞:-14.912575,鶡:-16.116548,墣:-15.605722,甦:-15.135719,沫:-11.681771,悳:-15.017935,堸:-17.215160,汀:-11.410025,裃:-14.650211,恈:-15.605722,鳋:-16.522013,忍:-9.551752,郓:-12.600040,叕:-12.995652,柝:-14.730253,鱠:-16.522013,形:-8.266444,篥:-16.522013,遨:-15.605722,迭:-11.077433,杲:-13.303137,廷:-10.045040,韽:-16.522013,勿:-10.304409,栃:-17.215160,辂:-11.826088,簋:-12.952480,莊:-9.836776,庌:-17.215160,鞒:-12.715350,暜:-17.215160,漭:-16.522013,躬:-11.228708,挵:-17.215160,芴:-13.688800,眽:-11.383278,隼:-11.772742,旆:-12.784343,齍:-15.017935,婏:-11.343042,鍕:-11.947302,湗:-11.251581,跖:-13.882956,臞:-15.135719,癧:-16.116548,僨:-14.324788,擰:-10.753692,她:-5.409304,鉿:-13.408498,丂:-16.522013,檅:-16.522013,脈:-9.179557,纍:-17.215160,锐:-11.307077,侗:-11.747100,樚:-15.828866,蚝:-12.966665,縢:-15.605722,骥:-13.526281,垧:-15.269250,爪:-10.055091,伬:-14.442571,殯:-13.526281,圼:-14.270721,罌:-13.477490,哑:-10.755256,棙:-14.170638,蝜:-17.215160,呦:-12.178207,烩:-10.480568,嗻:-12.871355,灾:-10.265304,朇:-17.215160,笏:-12.981054,颎:-14.124118,榘:-11.504733,茟:-17.215160,尡:-16.116548,綠:-8.998802,霧:-9.874324,倩:-12.427668,熨:-12.749252,搱:-12.833133,薰:-11.952470,砹:-13.207827,媺:-13.104286,豁:-11.863302,滂:-12.609990,嵋:-10.583158,拊:-13.104286,鑑:-10.878334,兓:-15.605722,盒:-10.224904,敛:-11.043459,祣:-16.522013,黢:-15.605722,寤:-12.171735,赫:-10.841840,鋪:-8.388866,乭:-15.828866,濬:-13.137623,腳:-8.442240,援:-10.275906,矼:-16.522013,掉:-8.185862,嬎:-15.828866,瞑:-13.847864,途:-10.461722,挞:-13.365012,眦:-13.189808,鎩:-12.355348,溫:-9.278857,皻:-13.813963,錾:-12.737823,湀:-12.427668,扈:-13.172109,巍:-11.768423,凕:-17.215160,詘:-13.303137,鹠:-15.269250,鉨:-14.507110,敲:-9.647297,祺:-12.211214,闽:-10.472279,僿:-17.215160,樃:-14.817265,趂:-17.215160,縋:-11.973413,膊:-11.942160,岌:-14.507110,爓:-17.215160,閒:-9.827451,蘛:-17.215160,騣:-17.215160,夥:-10.046580,洭:-16.522013,責:-10.167643,肴:-12.561200,徶:-17.215160,甽:-17.215160,钼:-11.518067,塏:-13.430970,酕:-16.116548,汗:-8.854855,菞:-17.215160,廠:-8.562038,瑧:-11.759839,韦:-10.493734,勨:-13.323340,衯:-14.576103,曰:-7.939500,鱷:-10.626234,竸:-16.522013,避:-9.424051,梅:-9.927599,茈:-16.522013,粍:-12.204525,吒:-14.324788,炕:-10.024484,簢:-15.017935,喧:-11.751328,榯:-17.215160,綷:-17.215160,唼:-15.269250,熿:-17.215160,仁:-10.147840,楄:-11.730363,囑:-11.569713,乖:-10.775810,櫙:-11.594759,绡:-13.056277,饤:-16.522013,噦:-12.820711,狩:-12.858451,俫:-17.215160,橮:-16.522013,蛱:-13.631641,髹:-13.631641,牾:-14.912575,侀:-11.555678,骎:-14.124118,垐:-14.124118,贗:-13.226176,殘:-9.977382,帡:-16.116548,锧:-15.423401,利:-8.665113,玨:-17.215160,昱:-13.631641,螰:-17.215160,稹:-12.419369,墺:-14.730253,蹁:-16.522013,艉:-13.189808,惊:-8.177151,卓:-11.199003,瓒:-11.705772,杛:-14.576103,裚:-16.522013,鳢:-14.817265,姤:-12.287906,轫:-13.072025,郪:-12.496661,淬:-12.317320,命:-7.856141,痼:-16.116548,阄:-13.343959,夆:-14.270721,綉:-15.605722,舌:-10.058983,榑:-16.116548,踔:-12.640449,焖:-10.179012,墛:-14.730253,紞:-13.088026,椦:-14.817265,炫:-12.103172,键:-10.525561,堰:-11.142116,粳:-14.270721,贾:-9.665025,铃:-10.826599,埅:-13.957064,桐:-12.033376,賓:-17.215160,俕:-16.522013,坚:-10.166774,篝:-16.116548,查:-9.071062,豨:-14.270721,囯:-17.215160,筲:-14.912575,杺:-17.215160,诽:-12.682561,仿:-10.795165,球:-8.575749,鎂:-10.838433,嚄:-17.215160,龊:-12.981054,氓:-13.919323,讒:-12.533029,五:-7.555976,嬝:-15.017935,窜:-10.194969,萣:-16.116548,銬:-12.011153,單:-8.545589,缵:-14.912575,麴:-15.017935,欽:-10.033568,誼:-12.022203,婇:-12.231553,秆:-12.146256,旎:-13.453960,触:-10.363975,陯:-15.828866,艷:-10.600434,蹿:-11.047644,鄀:-12.211214,刂:-11.877622,抍:-13.631641,褐:-11.103693,厗:-16.116548,瘚:-15.828866,骝:-14.170638,徟:-17.215160,戢:-13.882956,蚥:-14.730253,匬:-15.269250,弴:-15.423401,掷:-9.458965,蘺:-17.215160,睄:-15.828866,鯇:-11.627911,捌:-13.072025,蟏:-17.215160,潔:-11.326282,偖:-13.551598,瓙:-10.277846,魜:-14.912575,属:-7.048924,惡:-9.164457,蝤:-16.116548,泩:-16.116548,凫:-13.323340,瑮:-15.135719,巳:-11.383278,恶:-9.164457,汾:-12.551721,冀:-11.194137,笇:-14.170638,领:-8.390482,嶈:-10.466400,朏:-15.605722,蒎:-13.847864,吙:-13.263916,涨:-9.570241,馰:-17.215160,媲:-14.170638,搹:-15.828866,薸:-16.522013,遁:-11.591143,啃:-10.716878,狂:-9.743797,鱉:-11.039293,绊:-11.326282,櫒:-13.882956,祛:-12.411139,雚:-17.215160,寜:-13.919323,散:-8.578585,苢:-16.522013,酫:-14.650211,幵:-15.605722,襻:-13.996284,玁:-14.650211,鐄:-16.116548,而:-5.342932,殑:-8.451263,谔:-12.693371,猖:-13.813963,媛:-12.496661,莡:-17.215160,辩:-10.135134,犫:-14.817265,娰:-17.215160,纳:-9.630387,茶:-7.956315,檻:-12.033376,輾:-12.833133,牀:-15.605722,嗅:-11.083934,繈:-15.017935,苋:-12.820711,橐:-12.184722,軓:-12.609990,陘:-13.882956,日:-5.941825,釭:-14.817265,哯:-17.215160,祲:-17.215160,敺:-13.189808,觽:-17.215160,咄:-12.050374,戋:-15.605722,鶊:-14.576103,碜:-13.718652,撤:-9.531296,邬:-11.511378,垮:-10.062891,紵:-11.256735,鲴:-14.170638,椽:-12.630193,袼:-14.442571,侾:-17.215160,镅:-12.796319,塇:-17.215160,篆:-10.990602,赕:-15.605722,鏖:-14.037106,籟:-13.263916,桧:-13.263916,详:-10.296465,仨:-12.858451,孱:-14.650211,職:-8.509498,書:-7.363334,鼈:-17.215160,尊:-9.539150,悍:-11.751328,謐:-13.040773,沕:-17.215160,冗:-12.760813,琚:-11.488312,额:-9.405619,嶟:-16.116548,怢:-16.116548,氪:-12.784343,儬:-17.215160,疯:-10.045040,頲:-15.423401,崴:-13.040773,憷:-13.189808,萺:-17.215160,涿:-12.542331,勁:-9.152097,駇:-12.911095,廉:-11.060302,慌:-9.662923,藏:-8.130496,浔:-12.682561,剖:-11.669983,饜:-13.386519,幞:-13.577574,拡:-14.730253,蕤:-14.817265,滩:-10.020723,叫:-6.536231,癮:-11.627911,扶:-9.174391,蛹:-11.413042,湾:-9.599369,厀:-14.817265,礇:-13.365012,骆:-11.669983,很:-6.071807,攏:-10.575284,鄗:-13.781173,鴟:-13.056277,掠:-10.127586,褧:-17.215160,稱:-7.038787,鮰:-17.215160,昹:-17.215160,坃:-11.772742,烂:-9.905279,鹉:-14.817265,糊:-10.878334,体:-8.038376,棒:-9.415817,筛:-11.413042,铚:-14.037106,姜:-10.248193,鍫:-12.726524,質:-8.556467,偭:-16.522013,齳:-17.215160,練:-8.873035,槼:-13.088026,疁:-14.381947,鈄:-14.576103,崆:-13.781173,涑:-12.171735,岛:-8.408736,礞:-15.423401,薡:-13.430970,洦:-13.631641,覩:-15.828866,璫:-10.955579,鄮:-15.269250,尰:-13.137623,碳:-9.758128,治:-8.292502,瑀:-13.813963,郃:-11.650640,叅:-16.522013,蓋:-8.878290,汐:-15.605722,遘:-15.135719,博:-10.563588,表:-8.512816,韭:-13.207827,勯:-10.585797,署:-10.771029,鯵:-14.650211,捺:-12.033376,追:-8.571334,瀃:-11.759839,劄:-14.079666,搋:-16.116548,鮊:-15.605722,栓:-12.152565,鰛:-16.116548,弝:-13.263916,纜:-12.370973,耣:-16.116548,护:-9.274220,眭:-14.730253,冮:-12.085261,漽:-14.324788,鍅:-14.817265,幇:-11.521428,譕:-14.079666,癗:-16.522013,闖:-9.235479,僘:-16.522013,湧:-9.510348,嵱:-17.215160,糰:-17.215160,惸:-16.522013,詿:-12.570769,销:-10.471101,娊:-14.037106,暍:-12.704301,贐:-15.135719,丒:-16.522013,檕:-17.215160,垗:-14.730253,爚:-17.215160,麝:-11.272361,実:-16.522013,昢:-12.693371,芥:-10.809932,侧:-9.055213,横:-8.843918,圬:-15.828866,环:-8.902779,鸲:-13.688800,嬴:-13.056277,枷:-11.211273,舺:-15.269250,似:-8.258036,殿:-8.434680,品:-9.484107,獄:-10.471101,壉:-17.215160,杌:-13.154717,菏:-12.704301,歔:-11.989413,呖:-13.847864,烙:-11.440608,齜:-12.309885,塞:-9.240627,荤:-10.529299,棩:-11.416067,嗫:-13.604242,灮:-15.135719,姳:-12.470228,摶:-13.386519,桾:-14.650211,喀:-9.920783,缇:-11.722099,鲆:-12.533029,妈:-8.695171,挏:-16.522013,候:-10.020723,熘:-13.577574,鬟:-13.551598,斠:-16.522013,榨:-11.298958,簱:-15.423401,庲:-17.215160,怹:-16.522013,元:-6.945745,盂:-11.978718,竊:-10.688665,絛:-11.942160,鋚:-16.116548,応:-17.215160,慣:-10.152112,镫:-12.363130,噭:-14.730253,矬:-14.270721,婵:-12.661283,篴:-16.522013,赻:-16.116548,乽:-17.215160,濼:-13.718652,逄:-14.219428,萌:-12.121410,蠔:-16.116548,庛:-13.526281,笞:-12.317320,让:-6.389201,皫:-17.215160,錮:-12.061868,帰:-14.507110,窳:-13.604242,溻:-17.215160,謾:-11.709829,癀:-16.116548,鋃:-13.244868,穈:-17.215160,蛋:-8.956220,湐:-16.522013,党:-7.154541,緝:-11.751328,虠:-16.522013,闭:-9.373667,僯:-17.215160,絲:-9.275288,慺:-15.828866,跽:-14.730253,閂:-12.139986,傄:-16.522013,馊:-12.808441,樓:-8.475624,鸛:-13.453960,粜:-12.858451,舣:-15.269250,悤:-17.215160,甭:-10.923591,钬:-15.269250,厮:-10.085062,礵:-17.215160,洽:-12.478962,貼:-8.657977,屇:-16.116548,蕍:-14.442571,揎:-13.996284,襕:-13.120815,瑗:-12.178207,勘:-11.083934,汧:-14.730253,迦:-11.360088,遯:-13.137623,影:-9.518039,绰:-11.968136,葷:-10.529299,衿:-13.323340,需:-8.090051,吂:-14.219428,炅:-13.996284,鬈:-13.631641,堊:-14.912575,梕:-13.343959,瀚:-12.760813,鲝:-14.324788,搢:-17.215160,肥:-9.745506,株:-10.543127,唬:-10.631751,熯:-15.017935,鰲:-10.349269,头:-6.968899,斷:-8.256749,榿:-13.088026,囁:-13.604242,煄:-13.577574,嫉:-11.759839,敌:-8.418821,臏:-14.442571,仑:-13.072025,楔:-12.693371,狙:-14.381947,鵜:-14.170638,曡:-12.514680,书:-7.363334,埫:-17.215160,牮:-16.522013,寳:-13.365012,晶:-10.835038,苹:-12.580431,俻:-16.522013,橾:-16.522013,垀:-16.522013,紇:-13.749424,守:-8.576103,意:-7.742840,芎:-13.072025,侐:-17.215160,锗:-12.165304,则:-6.836681,玘:-13.244868,枠:-14.912575,货:-9.510799,殨:-16.116548,縱:-8.867570,岲:-17.215160,戹:-17.215160,莸:-13.154717,陁:-16.522013,千:-8.991533,磊:-12.858451,蹑:-12.796319,泒:-14.817265,巜:-14.730253,捣:-10.106916,蓢:-17.215160,呭:-11.135227,痬:-16.522013,塵:-10.318466,秴:-15.017935,轻:-8.284666,淼:-12.224727,禁:-9.755245,儆:-13.088026,訌:-14.507110,憑:-8.563961,傛:-10.005080,覡:-14.730253,愦:-13.813963,薩:-10.302417,倰:-16.522013,褶:-11.790210,悻:-14.270721,础:-11.488312,鳃:-11.016681,必:-8.103205,恐:-9.823745,蓓:-14.079666,鱘:-13.688800,衠:-15.828866,鯭:-14.730253,獲:-8.236626,韵:-10.576592,潺:-14.650211,菽:-13.631641,簃:-14.650211,庄:-9.836776,栋:-11.538406,搓:-10.745910,莒:-13.551598,逛:-10.378901,匝:-11.926893,谣:-12.514680,伥:-15.423401,笭:-15.828866,嶮:-11.440608,眵:-14.912575,隴:-11.658332,挽:-10.351357,芼:-17.215160,則:-15.605722,乏:-11.201445,蝕:-11.194137,穗:-11.236274,峘:-15.269250,癟:-12.452986,闞:-15.269250,执:-9.518493,鹯:-17.215160,共:-7.172084,泸:-13.631641,虿:-13.430970,娂:-15.605722,锈:-12.067666,檍:-17.215160,脐:-12.496661,暕:-17.215160,宗:-9.118952,垟:-13.996284,躥:-11.047644,昪:-13.577574,嬬:-11.351529,羯:-11.877622,圴:-17.215160,殷:-10.749015,踺:-17.215160,枿:-16.522013,壁:-9.474496,罄:-12.158914,鏇:-12.938494,哉:-10.694539,歌:-9.195876,杔:-16.116548,塖:-14.124118,糙:-12.845712,鍜:-10.503420,棡:-16.116548,轤:-16.522013,姫:-15.423401,籮:-12.570769,嗳:-11.213745,桶:-10.635909,猇:-11.580370,邆:-16.522013,喈:-15.828866,漏:-10.251970,尙:-15.135719,綘:-9.965235,茧:-11.456258,瀱:-17.215160,劲:-9.152097,氹:-12.871355,趸:-11.994804,人:-4.560534,嵃:-15.135719,鑉:-13.813963,益:-10.972937,拒:-10.089073,黚:-14.912575,叜:-14.650211,浣:-9.384734,諢:-12.523812,俤:-15.605722,饫:-12.966665,蛪:-16.522013,婭:-12.995652,镳:-13.072025,噵:-16.522013,矴:-16.522013,腻:-10.710872,箁:-14.650211,匆:-12.478962,伎:-11.803514,掑:-12.085261,笖:-11.877622,龙:-8.088527,力:-7.929898,眞:-17.215160,计:-8.704991,亣:-12.897672,挦:-14.037106,到:-4.982733,皳:-15.605722,丸:-10.459391,抻:-12.995652,蜾:-16.522013,穀:-16.522013,黃:-7.903889,巅:-12.158914,癈:-15.423401,請:-7.149426,蛓:-11.764122,鹘:-12.682561,嵚:-17.215160,燝:-16.116548,詠:-10.793538,淥:-12.056105,駭:-10.889011,峯:-15.269250,煲:-12.273518,闵:-11.858574,臽:-11.139814,馂:-15.605722,岄:-10.368217,樋:-13.088026,易:-8.689602,膒:-15.828866,鈛:-16.522013,炜:-13.453960,踣:-15.605722,沤:-12.650812,微:-8.728014,电:-7.765724,钴:-10.848690,愽:-16.116548,肼:-13.577574,假:-8.687819,蕕:-13.154717,硗:-13.263916,鯖:-13.477490,廘:-17.215160,瑟:-11.494848,韞:-13.189808,恧:-15.605722,危:-10.803342,狰:-15.423401,衷:-11.307077,佹:-10.405018,滸:-13.781173,堂:-8.959591,霈:-16.522013,吊:-9.935841,梍:-10.473459,茐:-13.749424,撕:-10.399520,妗:-11.501427,簚:-16.522013,邝:-13.631641,喟:-12.911095,貥:-14.576103,搪:-13.323340,夬:-16.522013,綯:-17.215160,進:-7.062160,唴:-12.952480,榷:-11.478588,谺:-17.215160,斿:-11.083934,嫁:-9.471023,組:-8.776794,采:-9.616260,囉:-11.598389,楌:-17.215160,跏:-13.551598,敔:-15.423401,给:-6.066366,櫡:-14.576103,赤:-9.347289,曩:-14.219428,寫:-7.472781,鋱:-15.269250,埳:-17.215160,軹:-14.912575,晾:-11.609358,宀:-11.844522,焇:-15.605722,銆:-8.364069,垈:-17.215160,洏:-13.749424,餗:-17.215160,帙:-12.152565,锟:-13.882956,殠:-16.116548,脧:-16.522013,枨:-14.817265,爱:-7.607454,鎰:-13.154717,傲:-11.844522,渹:-16.522013,驁:-15.605722,彃:-14.507110,陉:-13.882956,瓊:-11.075275,獛:-17.215160,鳚:-14.381947,凜:-11.043459,潣:-14.730253,裢:-14.037106,塭:-17.215160,秬:-17.215160,靳:-13.813963,呵:-9.425291,痴:-10.946064,荻:-13.244868,懼:-9.946937,綁:-9.991135,騄:-14.576103,唆:-11.594759,踌:-15.269250,斑:-10.280763,舔:-11.380349,紖:-17.215160,香:-8.545074,咛:-13.189808,焞:-15.017935,攦:-16.522013,膩:-17.215160,粫:-14.442571,餮:-13.263916,吰:-17.215160,炳:-11.839882,贶:-15.135719,撻:-12.609990,脾:-10.418336,籀:-13.604242,寅:-12.461570,灈:-17.215160,俍:-15.605722,摐:-13.813963,願:-8.429773,孚:-12.924701,矝:-14.650211,鏵:-13.604242,价:-9.188663,龂:-17.215160,鎊:-9.270668,二:-7.044129,怓:-17.215160,螒:-13.226176,鐛:-17.215160,圝:-17.215160,皜:-17.215160,蠣:-13.659812,缭:-12.772509,妮:-10.970993,猵:-17.215160,銴:-17.215160,朽:-12.370973,魅:-11.973413,噇:-16.116548,轍:-17.215160,槎:-10.880106,鷖:-16.522013,壘:-11.144422,牟:-11.816997,晧:-15.605722,藦:-15.135719,驯:-11.901954,啱:-16.522013,瓰:-17.215160,棸:-16.116548,艿:-11.764122,市:-6.615007,窅:-17.215160,刊:-10.880106,溍:-13.189808,投:-8.597217,得:-5.405997,稚:-11.812483,原:-7.478495,渢:-15.828866,誥:-10.273970,截:-9.942067,弬:-12.419369,箯:-12.133756,防:-9.201817,匴:-16.522013,診:-11.315263,峁:-11.587539,僉:-12.295179,潌:-14.324788,诏:-8.889854,屖:-17.215160,磙:-15.605722,靜:-9.410093,偞:-16.522013,泡:-9.454267,惩:-11.768423,巫:-11.681771,确:-9.020102,铱:-12.693371,凳:-11.186882,汶:-12.858451,裹:-9.986046,恾:-17.215160,嶀:-16.116548,眇:-13.882956,钆:-14.650211,冈:-10.559720,欏:-11.320757,鼗:-13.207827,堙:-13.718652,錟:-13.996284,涠:-13.120815,憨:-11.494848,閰:-12.287906,嚲:-11.163071,根:-8.618601,绂:-12.461570,葑:-11.872826,畛:-13.631641,埜:-14.170638,楣:-13.154717,翬:-13.781173,創:-9.293262,珴:-16.116548,蕻:-17.215160,柼:-15.269250,羁:-12.640449,圆:-8.961672,玉:-8.670352,谌:-11.218708,耔:-17.215160,编:-9.091306,猞:-17.215160,朦:-13.813963,莩:-14.730253,纫:-12.911095,鬮:-13.343959,嘰:-12.523812,犳:-10.485336,暻:-15.423401,繀:-10.584477,髃:-16.522013,版:-8.775712,軋:-11.389160,晐:-17.215160,苓:-14.170638,奚:-11.911855,痝:-14.817265,蹠:-13.631641,槥:-16.522013,艨:-14.037106,鷭:-16.116548,壯:-9.851880,畲:-11.882441,釵:-11.755575,楺:-17.215160,稃:-14.442571,阛:-16.116548,唝:-17.215160,璜:-13.056277,訣:-10.669810,梤:-15.828866,紭:-13.847864,宮:-8.457376,邴:-14.650211,侶:-12.280686,攽:-14.730253,蒼:-11.410025,饅:-15.017935,赍:-11.389160,毎:-15.269250,腕:-11.058181,籗:-10.478193,嫘:-13.996284,灟:-16.522013,鏞:-15.269250,仠:-14.079666,摧:-11.926893,蟦:-14.912575,顯:-8.787017,櫸:-13.882956,聿:-13.303137,専:-15.423401,錈:-13.263916,倊:-17.215160,沍:-17.215160,悕:-12.402976,嶗:-12.280686,砚:-11.462587,钝:-11.383278,冟:-17.215160,氢:-10.296465,怪:-8.499608,崬:-16.522013,鐲:-12.924701,儴:-11.064557,憿:-12.109215,廁:-12.266400,闇:-12.317320,勉:-12.287906,浌:-17.215160,觏:-14.079666,幖:-15.828866,站:-7.163511,镜:-9.859519,剞:-16.522013,满:-8.045329,襤:-13.813963,择:-10.700447,快:-7.217590,穮:-17.215160,雱:-16.522013,右:-8.061284,湶:-13.263916,諹:-17.215160,找:-7.269763,往:-7.475722,甇:-16.116548,隆:-9.847451,椏:-12.981054,鴗:-15.605722,娙:-16.522013,箘:-14.912575,澠:-14.079666,推:-8.463053,樹:-8.599752,许:-9.235479,鹁:-13.631641,孃:-16.522013,鉉:-13.718652,佋:-17.215160,烊:-12.858451,虑:-10.730525,擒:-9.932399,睛:-11.548733,飚:-11.518067,嗜:-11.006570,正:-6.676075,賢:-10.091487,齫:-17.215160,胪:-9.754095,屭:-14.270721,緬:-10.969053,偵:-11.821532,燴:-10.480568,蝻:-17.215160,旼:-15.828866,誇:-10.446667,椆:-13.604242,随:-8.106188,梛:-17.215160,璣:-13.631641,栰:-16.116548,閹:-11.777081,墻:-16.116548,珍:-10.139351,镎:-13.882956,翕:-13.088026,裛:-14.817265,杚:-14.576103,铣:-11.807988,埥:-14.507110,罪:-8.877811,曯:-14.912575,衰:-10.496147,狷:-15.423401,鑸:-12.079362,绿:-8.998802,脁:-14.219428,暄:-13.526281,個:-5.474796,餑:-13.501588,尓:-13.604242,纔:-14.912575,鎢:-11.146734,眥:-16.522013,嚤:-17.215160,谳:-13.365012,熶:-10.845259,頻:-10.471101,綾:-11.449969,蛄:-13.172109,橇:-12.533029,鋌:-15.135719,癏:-17.215160,嗎:-7.251283,黔:-10.349269,擘:-13.919323,也:-4.577789,靥:-13.154717,婧:-12.760813,糨:-15.828866,楱:-16.522013,畹:-12.091196,醋:-10.585797,渊:-11.194137,劍:-7.777445,鶓:-14.817265,稒:-16.116548,底:-8.360781,掗:-12.924701,蔘:-17.215160,鄠:-15.135719,箧:-13.303137,鴨:-9.813929,芭:-12.650812,挬:-16.116548,漴:-15.828866,厷:-12.091196,笼:-10.366094,惁:-14.037106,泉:-9.833036,蹊:-15.828866,卌:-16.522013,磑:-13.957064,彔:-14.079666,恖:-17.215160,迟:-9.655601,汞:-10.471101,僡:-15.423401,鯧:-14.442571,硦:-13.365012,峩:-16.116548,懫:-16.522013,荬:-16.522013,淳:-11.504733,轴:-9.987498,偶:-10.325569,移:-9.104132,屾:-9.198512,憀:-17.215160,蘅:-13.207827,消:-9.792786,鈍:-11.383278,圏:-17.215160,禐:-14.912575,鸕:-12.402976,肖:-10.907062,貞:-11.179679,冠:-9.897284,颦:-13.104286,簩:-11.194137,嶨:-17.215160,檲:-11.073123,吹:-8.891794,皺:-10.079473,臀:-11.221199,敃:-16.522013,煋:-15.135719,今:-7.132983,駐:-8.383448,嫒:-13.882956,葙:-15.605722,啣:-14.650211,鱩:-15.135719,扭:-10.003603,諲:-9.833036,湵:-11.722099,穽:-15.605722,导:-10.065243,欆:-16.522013,侉:-14.381947,钏:-13.303137,宑:-14.507110,伞:-10.247251,皣:-15.269250,鐤:-11.973413,亳:-12.808441,鞹:-13.172109,瘸:-12.091196,媻:-17.215160,旅:-9.306038,譆:-17.215160,么:-9.127520,燍:-17.215160,婐:-17.215160,諛:-12.238426,敚:-16.522013,難:-7.389364,煢:-14.219428,嗥:-13.386519,絪:-16.522013,擯:-12.897672,詰:-11.153703,烷:-12.039010,陸:-9.544732,啺:-14.650211,茁:-14.219428,撄:-14.037106,載:-9.098743,刋:-17.215160,帓:-13.172109,粔:-16.522013,椝:-16.522013,醢:-14.219428,甥:-12.749252,咤:-14.324788,舫:-13.263916,踳:-15.017935,蓄:-11.177289,城:-7.314025,鳔:-10.867771,曘:-13.154717,襝:-14.381947,狠:-9.830550,镥:-15.135719,绨:-13.343959,蟮:-11.440608,睹:-12.171735,螃:-15.423401,怂:-11.931956,氊:-17.215160,傍:-11.201445,砒:-14.037106,岕:-15.828866,憗:-15.269250,蜘:-15.269250,涟:-11.267125,錠:-11.425200,倢:-14.730253,禧:-14.079666,尪:-14.079666,肭:-13.718652,愬:-10.959410,洴:-15.017935,冷:-8.669574,礼:-8.583746,聂:-12.505630,滉:-15.135719,豊:-14.912575,兌:-10.048894,竑:-13.453960,顒:-13.688800,跟:-6.829462,湞:-14.576103,廩:-12.871355,揫:-17.215160,腬:-17.215160,赴:-8.709432,饼:-9.873676,幾:-8.188743,掀:-10.938517,澈:-13.137623,逍:-10.894392,唏:-13.303137,箐:-11.646816,鰕:-14.576103,昙:-11.312527,爡:-17.215160,厠:-13.137623,骦:-15.269250,徨:-13.137623,蔯:-17.215160,梲:-14.817265,鄷:-15.605722,嘹:-14.576103,璺:-10.623486,鴿:-11.962887,菀:-12.952480,权:-8.294905,迈:-10.384286,獋:-13.882956,壒:-12.259333,槜:-15.423401,痤:-15.828866,鹩:-14.324788,恭:-10.145286,汵:-11.280266,铺:-8.388866,躇:-15.017935,焎:-17.215160,沛:-12.461570,踜:-13.749424,鈤:-16.522013,崦:-14.270721,趱:-12.911095,氰:-13.154717,瀸:-17.215160,岻:-17.215160,赆:-15.135719,矍:-13.526281,酎:-13.718652,屐:-13.718652,賛:-16.522013,保:-8.674446,睢:-11.906892,句:-8.467808,拯:-13.430970,豰:-17.215160,佲:-13.154717,選:-8.342813,卺:-15.828866,竿:-11.576805,抄:-9.977382,吋:-13.120815,亜:-14.219428,鞢:-17.215160,猥:-13.430970,鮪:-14.219428,疶:-16.116548,鰻:-12.505630,弽:-11.681771,禾:-10.206655,苄:-12.737823,湇:-12.995652,雌:-10.283688,牏:-15.605722,凎:-17.215160,體:-13.501588,惘:-13.604242,瓠:-13.453960,鍥:-13.847864,磨:-9.563089,臮:-16.116548,浱:-17.215160,闶:-12.858451,煹:-15.269250,膃:-17.215160,昂:-10.831653,開:-6.978778,樊:-11.514716,馓:-13.453960,林:-8.157854,脘:-12.871355,锠:-15.017935,嘢:-17.215160,羧:-13.010467,館:-9.602329,本:-6.564819,誵:-17.215160,垷:-15.828866,麽:-11.035143,缼:-16.522013,宿:-10.448968,擁:-9.493368,棉:-9.748361,坌:-14.650211,孔:-9.162545,诟:-12.514680,員:-8.520658,壩:-10.391874,槳:-10.967117,譴:-12.103172,呶:-12.570769,塾:-13.365012,斀:-15.423401,舅:-11.282915,伇:-17.215160,榈:-13.010467,阍:-13.386519,匏:-13.501588,綐:-17.215160,騕:-15.828866,蒖:-16.522013,怙:-14.124118,袞:-11.989413,琡:-16.116548,鲦:-15.017935,砩:-13.189808,妨:-12.609990,茯:-15.135719,溲:-13.526281,倹:-15.423401,犺:-11.320757,览:-11.440608,畋:-14.324788,祓:-13.631641,廒:-14.381947,軲:-16.116548,繽:-13.365012,忼:-16.116548,貇:-15.828866,漆:-10.156402,邏:-10.790291,猎:-10.813243,徑:-9.735860,谜:-10.120096,弦:-8.903270,辱:-10.674130,渰:-14.442571,鎹:-11.916843,爸:-9.794581,懅:-15.828866,轆:-13.551598,痍:-15.605722,鍎:-12.266400,幐:-17.215160,秕:-14.817265,軛:-12.133756,慚:-12.252315,鋣:-17.215160,畢:-9.141445,凥:-17.215160,祪:-16.522013,惯:-10.152112,蹰:-17.215160,瓷:-10.584477,鉸:-12.309885,兺:-17.215160,悄:-11.186882,娓:-11.709829,碔:-14.817265,膚:-11.812483,傤:-16.522013,掮:-13.244868,訳:-15.135719,瞶:-16.522013,鸻:-14.730253,崽:-12.661283,箾:-15.828866,胄:-12.191280,汇:-10.096334,铌:-12.302505,灏:-9.520767,収:-12.796319,拘:-11.528185,赝:-13.226176,酥:-10.431835,屧:-16.116548,潱:-15.828866,仰:-10.136818,韶:-13.154717,勸:-9.042431,鯾:-15.828866,搂:-10.031289,鞋:-9.851247,栊:-13.088026,咍:-16.116548,鮓:-15.828866,簒:-17.215160,墕:-15.269250,斗:-8.480439,榟:-17.215160,堪:-10.572673,蒭:-16.522013,攬:-10.901612,椴:-12.820711,喷:-10.065243,鲽:-13.365012,紼:-12.191280,曁:-16.522013,櫉:-12.027774,衊:-17.215160,绑:-9.991135,鱒:-14.324788,奔:-8.492580,晖:-12.238426,橞:-16.116548,囡:-14.507110,嫩:-9.587129,蕬:-14.324788,毳:-15.269250,襴:-17.215160,噶:-11.777081,翻:-8.741292,鵼:-17.215160,者:-7.149511,鐍:-13.551598,儏:-11.320757,蚖:-16.522013,戙:-12.924701,語:-17.215160,瘡:-11.534987,垠:-15.423401,麦:-9.934463,脯:-13.283334,沲:-17.215160,锷:-13.453960,刹:-11.785814,為:-4.617207,餿:-12.808441,蟀:-13.120815,捃:-15.135719,诈:-11.158376,峒:-13.477490,艙:-10.026747,佛:-9.182475,淜:-17.215160,陡:-10.571370,卣:-12.309885,驩:-15.605722,摭:-14.270721,桵:-13.189808,籽:-12.231553,巼:-13.996284,愆:-13.010467,冑:-14.730253,悛:-15.828866,舜:-11.282915,粣:-14.817265,鸤:-15.605722,儦:-15.605722,怰:-17.215160,鶹:-14.124118,簸:-14.730253,傻:-9.558823,濅:-11.777081,腆:-13.040773,篍:-17.215160,鵎:-17.215160,偐:-14.124118,矕:-17.215160,胛:-13.996284,潚:-13.453960,鳣:-16.522013,忥:-12.487772,睪:-14.576103,滯:-11.114841,聰:-11.830665,竷:-11.790210,鱸:-12.324811,彺:-14.576103,盿:-17.215160,溄:-15.135719,堋:-12.620040,吓:-8.882852,辚:-13.882956,挝:-12.682561,缥:-13.408498,庤:-11.635430,涮:-12.470228,逻:-10.790291,匽:-15.135719,疾:-9.751797,扇:-9.268542,髌:-13.688800,繏:-17.215160,巎:-15.423401,荝:-14.442571,剧:-9.736990,瓨:-13.659812,慱:-16.522013,絹:-10.745910,峸:-15.135719,闾:-12.184722,樂:-9.008031,馋:-11.114841,昊:-12.671865,間:-7.144803,嚕:-12.590187,殗:-13.919323,业:-8.791618,枟:-12.224727,餠:-13.386519,锨:-12.561200,侯:-10.087466,蚵:-14.324788,朴:-11.616738,宷:-15.828866,垿:-17.215160,棁:-13.749424,孌:-12.324811,坔:-16.522013,诗:-8.425348,蟟:-14.270721,摞:-12.419369,灦:-13.688800,哩:-15.135719,譬:-13.718652,旳:-16.116548,蝴:-16.522013,塶:-16.522013,燻:-15.423401,鍼:-17.215160,呾:-16.116548,榀:-15.828866,踅:-10.944172,騍:-17.215160,式:-7.747236,阕:-12.784343,袖:-10.282712,氙:-13.386519,蒞:-12.938494,邦:-8.617863,喨:-14.442571,輯:-10.753692,尹:-10.969053,纺:-10.963256,霿:-16.522013,觀:-8.833100,浃:-11.609358,祋:-16.522013,釐:-13.882956,勒:-9.709668,嵣:-17.215160,苲:-17.215160,黺:-14.219428,牽:-9.629879,叼:-11.839882,肇:-11.849184,鲏:-14.507110,缎:-11.081762,厑:-15.828866,抛:-9.575037,耜:-13.847864,纣:-11.803514,匦:-12.067666,莱:-10.373545,戰:-8.125407,劻:-11.206347,淅:-13.120815,荆:-9.321961,种:-7.285128,齎:-13.453960,剐:-11.768423,痕:-11.126115,苛:-11.616738,浚:-11.635430,祢:-13.882956,工:-8.980065,番:-9.295440,泯:-12.726524,艰:-12.152565,磷:-9.991135,嵺:-14.270721,瓿:-13.025505,謁:-11.285571,七:-8.269436,沄:-17.215160,蜉:-16.116548,娋:-17.215160,碌:-11.488312,趚:-17.215160,愝:-16.522013,岤:-15.605722,訫:-16.522013,閪:-17.215160,澮:-13.996284,箶:-13.343959,儽:-17.215160,瞾:-13.172109,賄:-12.184722,恇:-15.017935,忎:-11.365835,铔:-12.845712,滘:-15.135719,腝:-13.813963,章:-8.494536,偧:-15.017935,盨:-16.116548,迮:-15.423401,捱:-12.121410,罹:-13.501588,廸:-16.116548,较:-6.891943,栂:-17.215160,鮋:-14.650211,搊:-16.522013,墍:-11.764122,鞓:-16.116548,咕:-11.693699,榗:-16.522013,斟:-10.821569,堢:-11.566186,熧:-16.522013,霨:-15.269250,袭:-9.326451,攴:-16.522013,邽:-14.170638,焼:-14.576103,喿:-17.215160,櫁:-15.017935,衂:-17.215160,曉:-10.970993,奌:-16.522013,遒:-13.501588,橖:-17.215160,仙:-8.852518,晞:-13.072025,嫡:-11.631664,釧:-13.303137,牦:-16.522013,囩:-11.921855,毫:-11.203893,襬:-16.522013,柳:-9.393116,蕴:-12.056105,婶:-9.951130,噾:-13.137623,谅:-11.101478,枈:-13.120815,崏:-13.365012,玐:-17.215160,鐕:-14.219428,渙:-12.091196,蚞:-17.215160,宠:-10.504637,銦:-13.343959,瘩:-16.116548,垨:-13.172109,贯:-10.604464,悲:-10.534305,帹:-13.386519,粺:-13.408498,锿:-13.882956,诀:-10.669810,潃:-10.615290,蟈:-16.116548,筋:-9.736425,鏐:-12.487772,僒:-17.215160,蹙:-11.348692,懜:-13.477490,彣:-15.828866,緤:-15.135719,险:-9.757551,桭:-17.215160,摵:-14.507110,災:-17.215160,凼:-12.871355,蚇:-14.381947,攆:-11.290904,骏:-12.158914,礎:-11.488312,喑:-13.551598,碣:-13.323340,騤:-13.365012,搰:-14.576103,砸:-9.477980,咻:-13.919323,毅:-10.976835,蕆:-17.215160,呐:-11.149052,歚:-17.215160,飣:-16.522013,罢:-8.064145,寥:-13.088026,獪:-16.522013,绷:-11.119335,顸:-15.828866,孺:-12.772509,檄:-11.901954,脉:-9.179557,尋:-15.269250,續:-10.219394,锑:-11.528185,倓:-12.772509,朝:-7.607051,龢:-10.619380,笥:-12.704301,谫:-16.116548,鎪:-14.037106,伭:-17.215160,榮:-10.116784,耳:-8.861899,圽:-17.215160,熾:-11.962887,諄:-13.882956,晇:-16.116548,黌:-15.605722,姎:-14.576103,乗:-13.040773,棘:-11.000552,糠:-11.658332,噧:-14.650211,烨:-13.847864,敱:-12.146256,鷶:-14.324788,祹:-15.269250,壸:-15.828866,覃:-13.604242,渂:-17.215160,戊:-12.121410,瘒:-14.912575,澗:-11.428263,褘:-15.605722,瞧:-8.059593,鄨:-17.215160,刪:-11.882441,躭:-17.215160,漬:-12.224727,芵:-15.269250,挴:-15.269250,德:-8.050968,隽:-11.957665,眼:-8.125519,县:-7.075731,況:-11.309798,蹂:-15.605722,惉:-12.016663,彌:-13.957064,瓑:-12.146256,協:-10.835038,菟:-14.037106,恞:-16.522013,峡:-9.758128,韧:-12.103172,淫:-10.963256,转:-7.854505,屶:-17.215160,靼:-13.386519,偾:-14.324788,憈:-17.215160,鈕:-12.749252,栙:-17.215160,肞:-16.116548,簡:-10.319477,嶠:-13.244868,钦:-10.033568,冨:-11.206347,暲:-12.693371,鼷:-13.919323,窺:-11.137518,楃:-11.609358,絋:-16.116548,闐:-12.995652,囒:-17.215160,衙:-11.206347,柜:-10.716878,鱡:-15.269250,篤:-10.905242,適:-10.573978,湭:-13.323340,俬:-16.522013,蛲:-13.263916,扵:-15.605722,白:-7.800574,埼:-16.522013,侁:-15.135719,蒇:-17.215160,朆:-17.215160,颏:-12.097166,笎:-14.324788,垑:-16.522013,伖:-15.423401,萜:-12.897672,窣:-12.897672,頤:-11.184475,享:-10.481758,螱:-16.522013,昰:-13.957064,稸:-15.017935,乀:-16.522013,槅:-14.730253,魎:-13.244868,燕:-9.877572,蛛:-10.828281,楚:-8.757080,絢:-15.017935,姥:-10.615290,棯:-14.170638,驸:-12.737823,奺:-17.215160,梄:-17.215160,茉:-12.370973,粌:-13.244868,霑:-16.116548,刓:-15.423401,炔:-12.784343,攝:-9.828070,墤:-13.453960,醪:-12.995652,殮:-12.470228,舳:-13.996284,羶:-12.191280,阻:-9.759283,唽:-16.116548,摇:-9.311933,鳌:-10.349269,寎:-16.116548,櫘:-11.251581,绠:-11.459418,饥:-11.261917,狨:-14.650211,诮:-12.570769,東:-7.401652,筹:-10.504637,嫸:-16.522013,氂:-16.116548,龋:-11.620449,怊:-16.522013,岍:-15.423401,鎓:-15.828866,琒:-17.215160,傕:-12.217948,涗:-11.453109,憟:-15.135719,鼠:-10.475823,尢:-14.576103,疧:-17.215160,錨:-11.799060,倪:-11.781438,愴:-13.323340,嶷:-13.365012,钽:-12.259333,冿:-12.461570,滁:-13.813963,拉:-7.756632,聊:-10.499777,嵌:-10.368217,监:-9.413769,鑒:-17.215160,兔:-10.688665,跗:-13.120815,湖:-7.784400,臟:-10.346146,扞:-16.522013,廡:-10.899802,勩:-11.538406,濫:-11.079595,赬:-16.116548,揳:-16.116548,腴:-14.270721,并:-5.765515,矻:-16.522013,澀:-11.443719,蠅:-11.431335,授:-9.260788,鰍:-12.871355,夏:-8.647844,躖:-16.116548,標:-9.628864,縡:-17.215160,徠:-14.507110,爩:-17.215160,厨:-11.221199,撲:-8.798893,鴷:-16.522013,確:-17.215160,歃:-16.116548,獓:-15.135719,哒:-11.521428,鹡:-14.576103,季:-9.825596,秤:-11.419102,鉩:-15.017935,汭:-14.912575,恵:-15.605722,瑽:-17.215160,骇:-10.889011,嶉:-11.662200,蚏:-17.215160,碛:-12.661283,崞:-14.037106,撣:-11.968136,馱:-10.963256,砰:-10.084261,岳:-10.127586,薹:-13.025505,搸:-15.269250,偀:-14.912575,矅:-17.215160,屈:-10.831653,揍:-11.794625,蕎:-13.577574,濕:-9.599369,飛:-8.049503,睚:-16.116548,寝:-11.139814,蓣:-16.522013,换:-8.438221,潪:-13.226176,盯:-9.625824,顰:-13.104286,孲:-13.718652,拷:-11.812483,葸:-16.522013,滿:-8.045329,吃:-6.701934,的:-2.240177,鴉:-11.709829,抌:-17.215160,媜:-16.522013,莢:-12.217948,匭:-13.631641,疮:-11.534987,張:-7.130101,憶:-11.730363,蠻:-10.160710,雄:-9.231720,穇:-14.650211,姆:-10.097144,苌:-12.871355,晏:-11.351529,軔:-13.072025,瓘:-13.604242,幟:-11.738696,惠:-10.577902,蝥:-17.215160,注:-9.270668,问:-6.772376,声:-7.552916,敹:-13.526281,跾:-17.215160,閃:-9.240627,嚅:-13.631641,縊:-12.427668,井:-9.928968,玗:-16.522013,锘:-13.577574,嘚:-15.017935,羟:-12.693371,殧:-14.442571,质:-8.556467,个:-5.474796,猬:-12.427668,垯:-13.137623,麵:-15.605722,缴:-11.033075,便:-6.293927,烁:-12.590187,鹊:-11.343042,棑:-16.116548,詒:-12.911095,佔:-7.082984,鏗:-11.501427,灖:-14.507110,哙:-14.124118,诧:-12.238426,桦:-11.165427,燫:-12.661283,鍬:-12.171735,呮:-11.481819,緳:-13.688800,槻:-13.172109,熀:-13.659812,阅:-10.642877,綈:-13.365012,舍:-9.917392,邖:-12.640449,琙:-17.215160,喘:-10.490126,鲞:-14.576103,怡:-10.675574,氩:-12.496661,報:-7.623169,輿:-10.270109,釀:-11.989413,勂:-17.215160,鷈:-16.116548,態:-9.796979,廊:-9.297624,觐:-13.430970,浓:-9.672416,奛:-17.215160,柤:-14.576103,牭:-15.605722,召:-9.862078,蛺:-13.631641,颇:-8.610689,笆:-12.152565,徉:-14.650211,化:-8.351969,窛:-13.919323,頜:-12.033376,暣:-13.226176,萤:-13.477490,劫:-10.057425,庳:-15.605722,昸:-16.116548,剀:-14.381947,病:-8.104309,魆:-14.324788,幈:-17.215160,懍:-13.137623,蝎:-11.812483,畚:-13.323340,姝:-10.324551,慢:-9.329079,浪:-10.154684,瓯:-12.796319,驰:-10.122586,奲:-11.144422,錁:-13.025505,璄:-17.215160,鼉:-12.580431,悌:-13.154717,謑:-17.215160,专:-8.702979,沔:-9.847451,閚:-15.828866,礝:-16.522013,墜:-10.704902,攥:-11.404019,儭:-13.882956,瞮:-15.017935,鸳:-12.897672,崵:-17.215160,铄:-13.847864,硇:-13.813963,密:-8.943612,背:-8.019629,偗:-14.219428,盘:-8.960371,屟:-16.116548,拠:-15.269250,滨:-10.487728,筱:-13.957064,嫰:-16.522013,杹:-15.828866,迾:-14.079666,咅:-16.522013,莋:-15.605722,输:-9.235136,栒:-16.522013,熗:-12.749252,榧:-12.661283,輨:-14.079666,鲵:-13.303137,紴:-16.116548,∶:-15.828866,椼:-12.897672,狁:-13.226176,遂:-8.870180,啄:-11.049742,绉:-10.584477,鱊:-14.270721,衒:-15.605722,釗:-11.453109,牖:-13.526281,鷟:-16.522013,繞:-9.196535,橦:-13.957064,仩:-17.215160,珫:-14.219428,酬:-11.142116,噮:-17.215160,翳:-13.430970,乾:-9.868505,玀:-16.116548,备:-9.481476,羈:-12.640449,耍:-10.127586,谕:-10.358698,銖:-12.514680,瘙:-15.828866,垘:-16.116548,戡:-14.507110,誦:-11.090477,温:-9.278857,侨:-10.236946,锯:-11.249013,娱:-12.661283,碲:-12.911095,脷:-17.215160,撺:-13.010467,贿:-12.184722,鏀:-10.641480,睃:-13.040773,僂:-13.604242,捋:-10.988623,峊:-17.215160,诐:-17.215160,陙:-10.907062,孛:-11.681771,蹩:-13.781173,灭:-9.053500,凬:-17.215160,飲:-9.147697,籵:-17.215160,巴:-8.720826,桽:-16.522013,喁:-13.323340,麇:-13.996284,紆:-13.207827,芏:-12.966665,愎:-13.749424,唖:-16.522013,粛:-13.010467,鸜:-15.017935,患:-9.585670,咫:-15.269250,簰:-15.423401,墳:-10.159847,膹:-17.215160,怸:-17.215160,呀:-8.047727,珅:-11.973413,柍:-16.116548,腎:-9.968792,毕:-9.141445,鳛:-14.576103,獚:-16.522013,忝:-12.726524,杢:-16.116548,歪:-10.081864,狯:-16.522013,彲:-10.887223,曷:-13.283334,锁:-9.898612,倃:-17.215160,犄:-16.116548,餉:-10.881880,暌:-13.781173,檔:-9.596909,鎚:-15.017935,缝:-9.920783,府:-7.842701,螢:-16.116548,挥:-8.909676,鐫:-12.419369,讪:-11.768423,圭:-10.528051,熮:-17.215160,頳:-17.215160,谻:-16.522013,伽:-10.515660,榾:-14.270721,繇:-13.056277,噗:-11.117086,烘:-10.478193,婟:-17.215160,擠:-9.492040,荥:-13.408498,棨:-14.730253,統:-9.519857,峰:-9.493368,藶:-13.551598,慹:-15.423401,醃:-11.101478,瘂:-15.423401,劅:-12.252315,薋:-17.215160,稊:-16.116548,覓:-10.346146,鄘:-14.170638,刚:-8.016791,箟:-12.640449,澧:-10.656962,隭:-15.828866,眬:-13.120815,漼:-16.522013,陂:-13.154717,驊:-15.135719,泑:-16.522013,蹒:-15.605722,韗:-15.017935,僙:-17.215160,硞:-16.522013,痫:-13.996284,靬:-13.919323,偮:-16.116548,秳:-17.215160,魴:-12.514680,添:-9.973078,轼:-15.017935,疀:-16.522013,弇:-14.037106,蘍:-16.522013,訕:-11.768423,钖:-12.820711,瀙:-17.215160,颞:-13.088026,搡:-13.040773,栩:-13.919323,錯:-8.460526,就:-4.697486,纲:-9.535909,蜷:-12.590187,抺:-15.828866,闀:-10.596421,煃:-15.423401,囂:-17.215160,敋:-13.056277,楓:-11.821532,仒:-17.215160,遙:-10.850409,嵛:-13.996284,葡:-11.425200,衩:-13.088026,癭:-12.820711,埬:-16.522013,苺:-14.650211,垁:-13.072025,鲇:-12.259333,缆:-12.370973,安:-8.128457,肏:-17.215160,挎:-10.782220,侑:-13.453960,圖:-7.813208,纛:-12.570769,鰜:-15.269250,耤:-17.215160,伦:-10.337864,嚫:-11.713902,媳:-12.317320,莹:-12.370973,亻:-14.912575,噀:-13.207827,齆:-13.919323,婈:-17.215160,乐:-9.008031,黛:-11.654478,煚:-12.139986,川:-9.767409,苣:-13.104286,敢:-8.232348,楪:-15.605722,烯:-12.133756,鹰:-10.258615,擷:-14.079666,棿:-12.115294,霁:-13.172109,刃:-10.280763,梔:-14.324788,醚:-12.287906,紝:-17.215160,岜:-13.501588,薢:-16.116548,愥:-17.215160,親:-15.135719,唭:-17.215160,玮:-11.269739,架:-8.312432,殾:-17.215160,郄:-14.219428,籇:-16.522013,忆:-11.730363,恏:-17.215160,裔:-11.468957,呗:-11.673896,鵝:-10.661227,曠:-10.892595,腥:-11.177289,櫨:-14.219428,鏮:-13.604242,罱:-13.718652,蟶:-12.533029,课:-9.242694,傅:-10.377827,螋:-15.269250,砊:-14.650211,讓:-6.389201,疗:-11.514716,錘:-10.736650,倚:-10.203946,禟:-17.215160,涧:-11.428263,謨:-11.170155,钭:-14.576103,甬:-13.189808,冯:-10.744361,礴:-16.522013,貽:-12.533029,洼:-12.184722,兄:-9.083041,顊:-16.116548,滑:-9.231379,癖:-12.378878,務:-10.013244,駟:-17.215160,湦:-15.828866,矫:-11.605688,镬:-12.478962,剮:-16.522013,篳:-15.828866,饴:-14.270721,瞀:-15.269250,逅:-14.219428,崇:-10.230444,萍:-11.738696,澐:-17.215160,蠕:-13.430970,厘:-11.156037,骞:-10.467574,躦:-15.423401,鄯:-13.365012,帱:-17.215160,粲:-12.370973,蔷:-11.952470,悺:-14.912575,獃:-17.215160,哂:-11.942160,鯈:-16.116548,杋:-16.522013,壊:-12.238426,运:-8.627322,歓:-17.215160,鉙:-11.978718,彛:-12.224727,緜:-16.116548,虡:-17.215160,詩:-16.522013,瑭:-14.037106,嗬:-11.816997,鳲:-15.605722,硵:-17.215160,姴:-13.526281,胺:-11.337424,汽:-12.103172,妁:-17.215160,喉:-10.819898,躏:-15.605722,洎:-16.116548,外:-6.749660,唞:-15.828866,沣:-12.324811,墫:-17.215160,瀰:-13.283334,咳:-10.523076,永:-9.735860,翅:-9.803604,酆:-12.630193,呈:-8.112850,母:-9.217161,赎:-11.137518,柕:-15.017935,郛:-14.219428,罚:-9.589565,賣:-8.282155,止:-9.145505,俥:-15.828866,杪:-14.507110,绯:-11.602032,卲:-17.215160,豸:-15.269250,佺:-10.883658,替:-8.643289,尃:-13.813963,锉:-12.630193,脑:-9.218506,龚:-12.044676,猝:-13.688800,订:-9.872381,交:-8.511321,頫:-12.938494,嬭:-11.504733,綮:-15.605722,鐳:-12.505630,圵:-17.215160,榶:-17.215160,耻:-11.528185,斾:-11.518067,黄:-7.903889,片:-8.488030,准:-9.006668,蛔:-11.199003,鍝:-11.186882,棠:-11.613041,僰:-13.781173,觶:-12.620040,浹:-11.609358,稂:-14.650211,庅:-16.116548,見:-6.230461,戒:-9.864644,算:-8.122703,帚:-12.427668,瞟:-11.413042,褠:-11.407018,控:-10.225825,蔨:-16.522013,第:-7.167053,徯:-15.423401,眴:-14.730253,芽:-11.008584,挼:-14.442571,磁:-9.884755,驂:-16.116548,瓉:-15.828866,惑:-11.984051,鯗:-14.576103,硖:-13.365012,峙:-11.514716,瑞:-10.573978,恦:-16.522013,秫:-14.442571,屮:-17.215160,痳:-14.650211,靴:-11.354374,荼:-12.178207,禀:-9.928968,伏:-9.423637,憐:-11.371616,蘕:-17.215160,颖:-10.978790,簙:-16.116548,嶘:-17.215160,钞:-10.599095,校:-9.296168,肦:-15.017935,鼯:-14.170638,倱:-16.522013,犲:-10.482949,溺:-12.005674,蜿:-14.912575,駀:-17.215160,絃:-16.116548,嫂:-10.523076,闈:-13.056277,楋:-11.790210,囊:-9.980262,敓:-11.713902,珜:-14.817265,衡:-11.449969,濤:-11.037216,葩:-15.605722,穭:-16.522013,寬:-8.101220,埴:-16.522013,軺:-14.650211,宁:-9.724631,邇:-13.477490,垉:-15.828866,嬖:-12.217948,犛:-16.522013,圞:-15.605722,谤:-12.833133,鎱:-12.561200,爰:-12.302505,嚳:-15.269250,边:-7.517283,游:-8.323373,婀:-12.523812,緅:-17.215160,鍆:-14.270721,槍:-8.624345,轎:-9.408057,凝:-10.445518,楢:-15.605722,糯:-11.751328,兲:-17.215160,棷:-15.605722,擿:-14.037106,布:-8.733180,霉:-11.246452,梌:-14.170638,茑:-15.605722,鶚:-12.056105,傜:-11.028951,津:-9.634460,騫:-17.215160,薪:-10.631751,夭:-12.103172,阳:-9.081866,唵:-13.718652,舻:-13.137623,枾:-13.996284,鳄:-10.626234,叆:-12.370973,汏:-17.215160,俎:-13.172109,塗:-9.936531,绘:-9.650403,酝:-12.808441,呟:-16.116548,櫠:-13.957064,赥:-16.522013,曨:-16.116548,勰:-13.263916,诶:-13.551598,潹:-11.669983,蟾:-11.123850,龃:-12.487772,砂:-10.341996,岅:-16.522013,琊:-13.244868,螓:-17.215160,怒:-8.769893,尚:-8.614729,疟:-13.154717,謠:-12.514680,憧:-12.884427,蜨:-17.215160,颭:-16.116548,礬:-11.293582,嶯:-11.658332,钵:-11.243898,甴:-17.215160,肽:-11.538406,嵄:-14.124118,盉:-14.324788,鑊:-14.037106,拑:-15.605722,聒:-13.847864,廙:-16.522013,闟:-11.669983,癞:-12.858451,臧:-12.273518,扦:-13.718652,饬:-11.807988,石:-7.903437,镴:-15.423401,腼:-14.576103,简:-10.319477,儇:-15.269250,瞈:-15.605722,蠍:-11.812483,掐:-11.073123,骖:-16.116548,徘:-13.882956,隞:-15.423401,模:-10.262431,芦:-12.266400,昩:-14.381947,鴯:-13.996284,炲:-11.261917,丹:-9.354204,鯀:-12.347626,壂:-12.533029,韈:-15.828866,歋:-13.551598,哊:-9.374847,杓:-12.231553,燜:-10.179012,詡:-12.347626,佣:-10.377827,淤:-11.211273,虩:-15.423401,硭:-14.507110,姬:-11.274989,郲:-17.215160,賺:-9.681466,恽:-14.037106,嶁:-13.551598,甆:-12.924701,冉:-12.056105,椎:-11.135227,崖:-10.068388,阜:-10.955579,梣:-15.269250,岫:-12.152565,閱:-13.088026,琰:-14.124118,傳:-7.940531,核:-8.865439,局:-8.920860,镆:-13.386519,偈:-12.133756,铛:-13.688800,筚:-15.828866,埝:-14.730253,裣:-14.381947,潢:-12.966665,端:-8.577698,鑰:-10.367155,坲:-17.215160,拿:-7.313875,堃:-13.365012,窄:-10.062891,鄉:-7.716038,蔑:-12.897672,抔:-15.423401,鮚:-15.605722,眝:-14.817265,嚜:-11.018716,欥:-17.215160,莪:-13.659812,弭:-13.365012,禮:-16.116548,涶:-17.215160,憾:-12.505630,癇:-15.269250,嗆:-10.694539,軌:-10.970993,橏:-15.828866,苔:-10.855586,幗:-17.215160,剟:-15.423401,泠:-13.120815,譥:-12.115294,惨:-10.149547,駮:-16.116548,跶:-13.137623,楹:-11.296266,臾:-15.269250,馃:-15.423401,媅:-17.215160,趋:-10.034329,爊:-16.522013,亍:-11.994804,餘:-8.233101,玟:-16.116548,丢:-9.256933,枧:-15.135719,缬:-12.630193,宯:-17.215160,猴:-10.043503,侷:-16.116548,糁:-13.072025,鹂:-14.324788,壙:-14.324788,鏟:-10.358698,灞:-10.117611,摦:-15.269250,緫:-15.423401,齬:-12.590187,旻:-13.263916,蝼:-15.135719,騅:-13.303137,圇:-16.522013,斐:-11.282915,鲖:-13.189808,砙:-13.263916,妘:-14.817265,氡:-12.911095,蒦:-17.215160,怩:-14.912575,鬯:-13.957064,吱:-11.163071,皲:-17.215160,檺:-14.381947,祃:-15.605722,廂:-11.079595,釈:-16.522013,测:-9.573596,藐:-13.996284,慓:-14.170638,顙:-14.381947,啛:-13.577574,矜:-12.022203,象:-8.170284,毤:-16.522013,聩:-15.269250,繭:-11.456258,忬:-15.269250,雲:-8.458478,牵:-9.629879,叴:-13.263916,諺:-13.025505,晽:-14.442571,征:-9.349205,钇:-13.172109,厉:-11.609358,欎:-10.288583,弖:-15.605722,鐜:-10.669810,檣:-13.226176,庫:-9.579373,瘰:-14.442571,劳:-10.206655,讹:-11.419102,樸:-12.682561,幀:-11.501427,秅:-14.219428,靆:-15.135719,剈:-17.215160,譎:-15.269250,懕:-17.215160,雛:-12.609990,祚:-12.760813,嗝:-12.671865,慪:-13.207827,磯:-11.437508,陰:-9.474496,啲:-15.269250,泷:-13.919323,娃:-9.729107,下:-5.622555,沌:-15.135719,悔:-10.609862,椥:-16.522013,鸫:-13.688800,崭:-13.386519,箮:-12.561200,鈳:-15.828866,儵:-15.828866,澶:-9.065558,掾:-12.570769,飄:-9.897284,瑇:-15.423401,埆:-12.152565,竘:-16.522013,镝:-15.269250,滠:-15.269250,拨:-9.542402,睱:-16.522013,困:-9.953233,歹:-12.661283,菾:-15.423401,鮃:-12.533029,墅:-14.324788,辋:-14.576103,莓:-14.381947,鬘:-14.912575,堚:-14.912575,熟:-8.703180,斧:-10.361861,茨:-10.845259,鲭:-13.477490,紬:-13.453960,妯:-12.966665,邵:-12.016663,焴:-15.269250,蒽:-13.631641,攼:-14.650211,绁:-11.978718,鱂:-14.219428,奄:-12.737823,遊:-14.507110,曑:-17.215160,鷗:-12.487772,繖:-9.853785,嫙:-14.650211,牞:-15.828866,仡:-12.347626,晦:-11.620449,鵬:-10.836734,婮:-17.215160,酴:-16.522013,査:-14.324788,項:-8.136524,唇:-10.423939,玈:-16.116548,谍:-13.919323,析:-10.475823,耕:-10.697489,麖:-16.522013,稙:-17.215160,官:-7.806215,渡:-9.570241,侠:-10.326588,蚦:-12.496661,戩:-15.605722,嘱:-11.569713,贷:-10.552027,梺:-13.526281,峂:-16.116548,鏈:-10.147840,潋:-16.522013,坛:-8.665306,蹡:-14.817265,槤:-14.381947,籭:-17.215160,铲:-10.358698,灵:-9.101733,摽:-14.124118,茂:-11.293582,輊:-17.215160,堐:-16.522013,粓:-13.120815,芗:-12.808441,躟:-14.650211,瀠:-15.828866,骧:-14.381947,簨:-10.894392,掭:-15.269250,般:-9.111666,踴:-12.378878,场:-7.870726,臁:-12.295179,捂:-11.058181,囏:-16.522013,駑:-14.576103,筒:-10.101204,拗:-11.635430,腖:-13.430970,滟:-15.135719,赞:-10.009525,噤:-13.813963,胫:-12.280686,扬:-9.799985,湴:-10.115958,穼:-15.017935,肀:-13.882956,朅:-17.215160,猍:-17.215160,喎:-12.640449,颐:-11.184475,缕:-11.755575,憖:-14.219428,丟:-15.828866,涞:-11.616738,鄡:-15.828866,禦:-8.689205,是:-3.626561,讲:-7.698291,爷:-9.153042,咸:-11.128385,鞺:-17.215160,縿:-15.423401,惀:-12.808441,運:-8.627322,契:-10.938517,磐:-11.669983,鱓:-15.269250,教:-7.808267,諜:-13.919323,煡:-11.548733,叢:-10.416104,絩:-16.522013,忪:-15.828866,轵:-14.912575,塻:-15.605722,殇:-13.659812,蠆:-13.430970,瞏:-13.882956,鐎:-14.912575,弔:-16.116548,閣:-9.434022,岩:-9.432353,褰:-10.233225,倶:-17.215160,锸:-13.244868,尾:-9.243039,框:-11.514716,凋:-12.845712,巓:-17.215160,槛:-12.033376,虚:-8.893495,兠:-15.135719,痣:-12.109215,嵨:-16.116548,鹪:-12.109215,蟯:-13.263916,楰:-16.116548,仵:-15.135719,畸:-13.025505,嫽:-17.215160,态:-9.796979,螄:-13.365012,亊:-14.912575,鎌:-16.116548,砑:-13.477490,媒:-10.970993,龔:-13.604242,暚:-14.037106,訝:-13.088026,唣:-14.324788,犢:-12.461570,愫:-13.813963,纪:-10.523076,洳:-13.343959,邶:-14.037106,礻:-14.079666,宼:-17.215160,鲾:-15.135719,柄:-9.132140,前:-6.167784,珌:-15.017935,幕:-9.888694,翔:-11.602032,癥:-15.017935,卷:-8.645564,烶:-13.996284,鑹:-12.005674,彿:-13.882956,糾:-11.475367,暃:-15.828866,脂:-10.697489,丈:-10.269146,犋:-15.017935,贊:-17.215160,纓:-12.184722,餒:-13.631641,肗:-17.215160,颧:-13.303137,耬:-14.079666,涵:-11.431335,谴:-12.103172,唺:-13.631641,禽:-11.404019,菁:-12.952480,慂:-14.650211,迉:-17.215160,浊:-11.383278,哏:-13.957064,祒:-16.522013,惗:-17.215160,荖:-15.135719,泟:-13.551598,呤:-13.226176,磧:-12.661283,魦:-10.170255,苫:-11.747100,恬:-13.104286,汴:-11.511378,培:-11.654478,髻:-11.844522,硼:-11.643006,攅:-17.215160,垎:-11.371616,骐:-15.828866,紕:-11.887284,掖:-11.573253,錡:-10.515660,箦:-15.828866,鼩:-13.919323,搯:-15.828866,覲:-16.116548,瀷:-13.996284,閺:-16.116548,簿:-10.627610,佉:-14.381947,滈:-11.677826,鉋:-16.522013,孑:-14.079666,杙:-15.135719,補:-9.125984,獡:-15.828866,铤:-15.135719,罩:-10.086664,腭:-12.427668,乳:-10.487728,槲:-13.430970,赵:-9.181177,婻:-16.522013,痺:-12.287906,饽:-13.501588,榇:-13.688800,儌:-14.219428,疏:-9.746076,阎:-11.478588,崔:-10.816565,検:-16.116548,务:-10.013244,鞣:-12.273518,甤:-17.215160,制:-7.843552,皹:-15.828866,霸:-10.518126,帾:-14.650211,橆:-16.116548,友:-10.067601,癎:-15.017935,忓:-10.951762,鳕:-12.671865,毛:-8.259325,占:-7.082984,矣:-9.481476,遢:-15.423401,彨:-12.109215,歰:-16.116548,釷:-12.280686,壽:-10.500990,薄:-9.299812,醌:-13.453960,墒:-12.027774,撚:-16.116548,圣:-8.921360,炢:-15.605722,鐥:-12.197880,挫:-11.132941,粪:-10.715373,漳:-12.050374,銶:-12.561200,妼:-17.215160,麾:-13.025505,旄:-13.056277,偍:-14.912575,镏:-11.534987,展:-9.633950,蟘:-15.269250,仞:-13.408498,嫦:-13.501588,曮:-16.522013,話:-6.774010,具:-8.478350,嵿:-15.135719,绾:-10.761535,悃:-14.124118,蜂:-10.071542,璋:-10.846973,謊:-11.282915,尐:-14.442571,碓:-13.577574,怘:-14.817265,依:-8.739414,厥:-11.541837,枭:-10.843548,伲:-13.120815,段:-7.154882,訴:-11.004560,区:-7.090451,羽:-10.164171,藁:-13.749424,杂:-9.537760,仇:-9.865929,觉:-8.404551,曗:-14.817265,蕖:-13.430970,乜:-13.303137,櫟:-11.062427,襞:-14.912575,剤:-13.430970,继:-9.456399,晬:-15.605722,裳:-12.737823,凹:-10.724437,繼:-15.828866,蒀:-12.363130,袈:-15.423401,眍:-15.423401,鲐:-13.659812,笕:-13.244868,锡:-10.087466,帧:-11.501427,綦:-14.507110,戯:-11.639211,農:-9.676133,瘷:-13.749424,鎺:-11.066692,稿:-9.944152,擀:-12.419369,聃:-14.817265,棈:-17.215160,鑋:-13.996284,嵑:-15.017935,顓:-15.017935,埢:-13.551598,鋤:-11.475367,祩:-15.423401,寪:-17.215160,屻:-12.897672,珺:-15.269250,澇:-12.103172,谆:-13.882956,圌:-16.116548,逎:-15.269250,醣:-14.037106,猤:-17.215160,墩:-9.846820,沱:-12.650812,贰:-11.488312,吶:-14.124118,点:-7.101209,汆:-14.442571,雍:-11.620449,灎:-16.522013,姓:-8.327784,髕:-13.688800,淛:-15.828866,艚:-13.813963,啠:-17.215160,院:-8.367656,驪:-12.682561,華:-8.834016,浰:-16.116548,煸:-14.037106,廽:-16.522013,鯿:-13.551598,搁:-10.361861,栉:-12.452986,抚:-9.939988,踝:-12.726524,儣:-16.116548,皢:-12.022203,鈥:-9.425291,攫:-12.952480,窪:-17.215160,肮:-12.966665,钶:-15.828866,徼:-14.170638,揄:-14.324788,噍:-15.017935,矌:-14.730253,鍏:-9.549407,婕:-12.370973,篔:-15.828866,臘:-10.761535,湝:-14.079666,闠:-16.522013,牥:-15.269250,峦:-13.010467,惮:-13.408498,坷:-14.219428,瓶:-9.715184,遹:-14.442571,孿:-13.072025,磾:-12.911095,抃:-16.522013,皋:-12.542331,褊:-14.124118,帐:-9.090713,窓:-15.605722,鴒:-14.507110,蒗:-15.135719,战:-8.125407,瘠:-13.303137,冥:-11.101478,鲧:-12.347626,断:-8.256749,萬:-6.926716,蠴:-16.116548,儺:-12.570769,綽:-11.968136,蟁:-15.017935,敂:-16.116548,诉:-11.004560,楊:-7.494574,像:-6.845614,絒:-14.219428,擗:-17.215160,棟:-11.538406,譞:-14.037106,偤:-14.817265,糧:-9.067872,齦:-12.858451,摬:-15.423401,俱:-9.476672,諳:-12.478962,桴:-13.847864,叹:-8.885743,黻:-14.124118,籼:-13.453960,蚀:-11.194137,愅:-15.605722,來:-5.222893,甍:-15.135719,麐:-13.996284,枖:-16.522013,殞:-13.477490,尧:-11.488312,鬩:-13.056277,怯:-10.790291,亰:-14.381947,趲:-12.911095,劸:-16.522013,醺:-12.833133,櫈:-15.017935,陋:-12.411139,绐:-11.128385,賜:-9.442407,睡:-8.337360,嗢:-15.605722,郤:-15.269250,筩:-15.423401,姪:-13.813963,蕭:-10.419454,幻:-11.196567,燺:-16.522013,鵽:-14.324788,涇:-11.926893,熏:-11.000552,鈎:-17.215160,夔:-10.674130,辛:-10.883658,洜:-12.650812,嚡:-17.215160,鎣:-17.215160,焤:-15.605722,溱:-16.116548,嘶:-11.203893,犹:-9.978821,錸:-13.749424,娾:-14.170638,湆:-17.215160,埋:-9.434439,铍:-12.514680,牎:-13.882956,寓:-10.727476,飕:-12.630193,濛:-12.737823,聚:-9.394319,坠:-10.704902,珣:-14.219428,孨:-12.165304,潰:-11.039293,闷:-10.106916,獸:-9.591029,峽:-17.215160,駿:-12.158914,樉:-13.120815,閌:-12.858451,縑:-12.938494,馔:-10.722920,伛:-15.423401,悚:-12.772509,谝:-11.315263,匣:-11.008584,末:-8.619341,芮:-13.501588,隶:-10.782220,嶼:-12.067666,菘:-14.079666,汝:-10.134292,灥:-16.116548,廦:-17.215160,鯨:-11.158376,拮:-14.037106,蹱:-16.522013,啷:-11.090477,竾:-13.408498,沃:-12.056105,謂:-10.115958,蜊:-14.912575,倐:-13.919323,錒:-13.010467,氘:-12.981054,銧:-17.215160,琨:-15.017935,殭:-14.817265,訬:-14.817265,枵:-14.912575,强:-7.454216,见:-6.230461,歂:-15.828866,藉:-10.544394,金:-7.594433,獒:-13.244868,襖:-11.365835,曟:-12.152565,蕞:-13.996284,狧:-17.215160,晴:-10.395144,巹:-15.135719,漅:-14.730253,蒈:-17.215160,笍:-15.017935,嶎:-15.423401,邐:-13.323340,榖:-13.526281,餡:-12.103172,刧:-17.215160,锩:-13.263916,港:-8.629748,莲:-9.869150,稷:-11.605688,岸:-9.652479,瘿:-12.820711,检:-10.736650,顋:-17.215160,兑:-10.048894,浙:-10.628988,俚:-12.600040,苜:-15.423401,寢:-11.139814,畩:-14.170638,埪:-16.522013,譭:-16.522013,揲:-14.650211,偻:-13.604242,伄:-14.079666,掇:-12.609990,耆:-12.127564,嬌:-10.735115,膛:-11.146734,挜:-15.269250,墡:-13.882956,缤:-13.365012,咩:-13.189808,悱:-15.423401,粹:-13.781173,吾:-9.128750,恆:-10.808280,始:-8.843918,籎:-17.215160,嗓:-12.833133,雕:-9.215146,蹚:-11.931956,奠:-12.184722,緣:-9.593965,驢:-10.117611,陪:-9.011582,迯:-12.570769,慰:-11.112601,鯷:-15.017935,響:-8.631056,栁:-17.215160,辄:-12.726524,鮌:-16.116548,瀑:-12.339963,鞔:-13.263916,溚:-17.215160,崣:-17.215160,窢:-16.522013,鸥:-12.487772,椫:-16.522013,皪:-15.269250,颶:-13.781173,焻:-15.605722,厼:-15.828866,钾:-10.709376,久:-8.273353,濄:-12.760813,荇:-14.442571,婍:-15.828866,篌:-16.116548,齏:-13.688800,噕:-15.828866,跘:-17.215160,僦:-13.659812,门:-6.622960,佯:-11.962887,泮:-14.576103,聱:-17.215160,磶:-14.650211,溃:-11.039293,褂:-11.177289,窋:-15.605722,皓:-11.521428,鄒:-12.533029,渘:-14.037106,蒟:-16.116548,稠:-11.713902,瘨:-13.882956,榭:-11.650640,熽:-16.116548,逼:-9.021760,证:-9.018723,楂:-11.315263,敊:-12.845712,峏:-17.215160,鏑:-15.269250,煒:-13.453960,棗:-11.114841,譖:-14.219428,層:-8.481405,烧:-8.724927,鍦:-9.231720,諫:-10.462890,蛳:-13.365012,忹:-16.522013,灼:-11.047644,洅:-15.828866,徎:-14.442571,銐:-12.609990,甕:-10.925444,殖:-11.060302,枞:-14.817265,鬡:-14.324788,倧:-14.442571,玦:-14.507110,霩:-15.828866,氯:-10.994570,膲:-13.323340,砷:-11.751328,庸:-9.831792,鶺:-15.017935,琿:-12.650812,櫀:-15.828866,卑:-10.747461,狐:-10.919894,潙:-13.957064,胜:-8.476104,筡:-17.215160,姢:-13.386519,嗪:-13.120815,懲:-11.768423,剻:-15.135719,緺:-17.215160,酽:-13.659812,憇:-17.215160,舆:-10.270109,夌:-10.919894,綏:-11.863302,唔:-11.049742,亙:-13.996284,莛:-15.269250,愜:-14.576103,紤:-14.219428,嚩:-14.507110,抱:-8.508339,娶:-9.536371,纹:-9.686291,鼸:-16.522013,嘾:-14.730253,促:-10.584477,賅:-14.650211,扆:-13.882956,繎:-13.120815,埓:-14.381947,铕:-14.730253,佘:-13.577574,換:-15.269250,豚:-12.630193,孠:-17.215160,翣:-15.423401,坨:-12.427668,鑪:-17.215160,路:-6.988647,僽:-16.116548,闿:-12.682561,樁:-10.589768,趄:-15.135719,昉:-12.650812,馌:-17.215160,傒:-13.919323,閔:-11.858574,沚:-14.817265,碢:-17.215160,鰥:-14.442571,璪:-15.135719,朳:-17.215160,骶:-12.952480,猻:-12.452986,冼:-13.430970,难:-7.389364,淄:-13.120815,塍:-15.605722,鵏:-16.522013,呕:-11.548733,痔:-12.355348,还:-5.250790,鯠:-17.215160,籥:-17.215160,勦:-17.215160,滮:-17.215160,艱:-17.215160,競:-10.185187,鹹:-14.730253,啿:-13.120815,盾:-10.697489,梃:-13.551598,輂:-15.423401,粋:-17.215160,吐:-9.232402,栘:-16.116548,芟:-12.470228,簠:-13.996284,宥:-11.868053,隧:-12.952480,瀨:-14.381947,踬:-15.269250,舴:-13.631641,瞽:-13.688800,阼:-15.828866,臉:-7.949763,捊:-15.017935,嫏:-15.605722,滗:-15.605722,赖:-10.125917,拟:-9.655601,盧:-16.116548,镦:-12.339963,賫:-17.215160,湬:-16.116548,胳:-14.124118,姹:-10.518126,铻:-14.817265,發:-7.483648,貀:-14.442571,缍:-13.430970,妎:-16.522013,钐:-14.170638,猕:-15.269250,丗:-15.269250,涖:-12.796319,褙:-15.135719,憞:-14.124118,鴡:-15.605722,嘧:-13.430970,鄩:-15.135719,樯:-13.226176,螲:-15.828866,縷:-11.755575,墸:-14.817265,鮺:-14.912575,爿:-12.273518,惈:-14.324788,啑:-15.423401,瓐:-15.828866,道:-5.361877,楙:-13.010467,蛜:-13.847864,絡:-11.064557,煩:-10.107735,只:-5.687908,轭:-12.133756,柲:-15.605722,呻:-15.423401,篺:-17.215160,枇:-13.120815,萆:-14.270721,弌:-16.522013,箏:-11.901954,頎:-14.124118,薛:-10.696013,岡:-10.559720,笤:-12.845712,傩:-12.570769,撱:-13.025505,尶:-15.423401,碹:-16.522013,倾:-9.647814,諅:-14.730253,摆:-8.822850,巋:-17.215160,黍:-12.027774,硎:-12.280686,凓:-17.215160,鋕:-15.269250,旛:-16.116548,秣:-13.283334,鹢:-15.828866,全:-7.208890,误:-9.767992,数:-7.938190,祸:-10.136818,国:-6.906341,鏿:-13.813963,亂:-8.187661,怉:-17.215160,龌:-12.966665,嚒:-14.037106,鎔:-15.423401,蘝:-16.116548,红:-7.604970,洫:-15.828866,侬:-12.693371,鲶:-14.507110,画:-8.284666,垼:-16.522013,邾:-13.604242,蝇:-11.431335,翌:-14.270721,魏:-9.609270,剕:-14.730253,晝:-12.022203,哦:-9.063250,森:-10.595087,葱:-10.649895,彷:-12.411139,糶:-12.858451,项:-8.136524,卿:-10.191401,一:-4.923690,脊:-9.389915,锒:-13.244868,樘:-12.995652,肟:-12.715350,縠:-15.423401,妥:-10.496147,钧:-10.829966,爨:-13.477490,谬:-12.085261,憵:-17.215160,夺:-9.172139,疽:-12.952480,迁:-9.242349,浂:-15.135719,菉:-15.605722,慊:-12.295179,壏:-17.215160,韑:-17.215160,泗:-12.033376,惟:-10.335804,荞:-13.577574,塤:-13.323340,瓧:-12.505630,靦:-15.269250,軫:-13.781173,汬:-17.215160,恴:-16.116548,对:-5.088813,電:-15.828866,椅:-10.541862,芈:-13.386519,納:-16.522013,隐:-9.818825,焕:-11.868053,澖:-16.522013,謙:-10.874801,掞:-12.640449,吧:-7.067707,瞦:-16.522013,錩:-15.017935,簷:-9.925550,媸:-12.924701,瀿:-15.017935,佁:-17.215160,滀:-10.826599,拈:-10.940398,鹋:-14.817265,坑:-9.942762,盐:-8.818328,鉓:-17.215160,歙:-13.088026,蓜:-17.215160,罡:-11.978718,巢:-10.700447,飤:-16.522013,赭:-13.526281,旲:-15.605722,噻:-14.442571,秺:-12.845712,文:-7.979737,蘆:-16.522013,崌:-14.037106,福:-9.235821,騎:-8.817426,儔:-12.966665,螛:-12.386846,攜:-10.007300,庡:-10.736650,鮣:-14.576103,助:-9.552692,暱:-12.858451,蜰:-11.383278,帶:-7.059631,装:-8.375304,忋:-13.072025,鳍:-10.908885,穎:-10.978790,叓:-11.863302,郕:-15.269250,卨:-15.135719,觯:-12.620040,杰:-10.739727,鷷:-17.215160,哽:-12.884427,釿:-16.522013,戉:-16.522013,瘑:-12.402976,咒:-11.108137,萝:-11.701731,粢:-14.037106,漫:-10.480568,炪:-13.323340,挳:-15.605722,眻:-13.430970,銾:-16.116548,屍:-13.919323,偕:-11.301657,燔:-14.730253,他:-4.312598,诘:-11.153703,摝:-13.343959,硥:-12.067666,囦:-11.722099,鏨:-12.737823,虱:-12.152565,嵷:-15.605722,绶:-12.715350,驹:-12.139986,兿:-17.215160,倀:-16.522013,璃:-14.381947,錂:-17.215160,專:-15.269250,沓:-12.039010,謒:-16.522013,琘:-15.828866,宝:-8.804217,麟:-12.620040,怠:-11.228708,氨:-9.288919,玭:-17.215160,嬲:-13.386519,殽:-15.605722,釁:-11.989413,獂:-15.423401,鷉:-16.522013,觑:-11.620449,狗:-8.972141,酖:-16.116548,婜:-17.215160,统:-9.519857,鵞:-11.068831,櫧:-14.381947,襦:-13.781173,郫:-14.324788,牬:-13.172109,姱:-13.453960,鳳:-10.395144,橼:-14.730253,邀:-10.070753,眅:-17.215160,妆:-11.163071,鲈:-12.324811,挍:-17.215160,漕:-11.368721,列:-8.553347,熖:-16.116548,错:-8.460526,綞:-13.430970,榦:-17.215160,贩:-11.075275,瘯:-13.263916,墰:-13.688800,户:-8.907947,螺:-10.651305,渿:-14.576103,允:-10.011011,烀:-14.730253,鑃:-17.215160,嵉:-15.135719,糈:-15.828866,聋:-11.609358,棐:-14.381947,留:-8.413089,埚:-17.215160,髜:-17.215160,蛤:-12.238426,浩:-10.357646,偫:-15.423401,俪:-12.139986,屳:-14.381947,篲:-16.522013,譽:-9.687904,圄:-17.215160,箇:-16.522013,順:-9.237192,枏:-14.912575,萎:-13.283334,伔:-13.781173,咙:-15.017935,馛:-17.215160,笜:-16.522013,吮:-12.121410,碱:-10.332723,撹:-12.079362,蔸:-14.730253,雅:-10.257663,硆:-17.215160,苍:-11.410025,啘:-13.408498,旣:-17.215160,勭:-10.644277,祰:-16.116548,廵:-14.124118,數:-13.577574,瀁:-17.215160,劂:-16.522013,鞄:-17.215160,簉:-17.215160,床:-9.143005,树:-8.599752,辔:-12.044676,夛:-11.926893,皚:-14.817265,抢:-8.552136,焫:-16.522013,溪:-10.018473,厬:-15.828866,钮:-12.749252,紳:-12.245347,徴:-17.215160,椻:-14.219428,矄:-17.215160,魇:-12.394878,揌:-15.135719,乕:-15.017935,僖:-13.263916,闘:-17.215160,峞:-11.643006,臠:-14.912575,晥:-14.270721,跨:-9.257283,坯:-12.280686,瓮:-10.925444,顱:-12.039010,惶:-11.434417,葹:-16.522013,使:-6.138339,泾:-11.926893,刀:-8.080514,鄂:-8.185503,师:-7.806461,褒:-12.402976,邗:-14.219428,瘘:-12.897672,妝:-11.163071,鲟:-13.688800,戠:-11.047644,綵:-15.269250,蠼:-13.226176,鏁:-10.910711,煂:-15.605722,壇:-11.742889,译:-9.737556,楒:-15.828866,烗:-16.116548,鍖:-11.033075,糟:-10.521836,棧:-12.085261,警:-10.631751,灬:-17.215160,寱:-16.522013,籴:-12.726524,桼:-16.522013,銀:-8.523006,宆:-17.215160,麈:-14.219428,愍:-13.263916,洕:-17.215160,倗:-13.919323,玖:-12.630193,尟:-15.135719,羞:-10.430703,殦:-15.605722,輩:-10.016976,琯:-13.604242,媰:-14.576103,薺:-14.324788,氿:-16.116548,十:-8.237256,狀:-8.464319,彉:-12.884427,终:-9.450015,艋:-13.659812,櫐:-16.116548,蹓:-13.919323,睙:-11.552200,嗚:-10.336834,捡:-10.179891,潩:-14.650211,平:-7.814034,旺:-10.437513,唄:-15.605722,禇:-17.215160,鮛:-13.501588,礜:-17.215160,攤:-10.461722,亩:-9.304569,嘮:-13.430970,鬰:-15.828866,暹:-13.172109,举:-8.434680,埃:-9.789802,铅:-9.770327,穆:-11.213745,胍:-12.671865,晎:-17.215160,俓:-16.522013,坘:-16.522013,柣:-15.135719,聢:-16.116548,豪:-10.140197,僭:-8.890824,闯:-9.235479,筰:-14.219428,峵:-15.605722,杸:-14.817265,縉:-11.742889,膌:-15.828866,樑:-16.522013,趔:-16.116548,嬛:-14.730253,璚:-17.215160,悢:-17.215160,营:-8.513980,猫:-9.661349,沪:-9.457254,冬:-9.910644,缳:-16.522013,嶴:-14.912575,欻:-15.828866,懌:-14.650211,勖:-13.453960,韘:-14.381947,硝:-11.984051,廞:-17.215160,菠:-14.912575,摥:-13.813963,迨:-12.533029,啯:-13.659812,目:-8.599389,驱:-10.452431,拶:-14.079666,虹:-10.400617,滾:-9.300542,吀:-14.324788,堈:-17.215160,梓:-11.110367,輒:-12.726524,隗:-14.079666,瀘:-16.522013,徝:-16.522013,骟:-13.882956,搠:-11.772742,躧:-13.813963,栨:-11.528185,瞭:-13.501588,阬:-13.226176,弲:-17.215160,踼:-17.215160,駉:-16.522013,筊:-16.522013,跑:-7.872564,盗:-9.519402,镖:-10.389700,幜:-17.215160,竟:-7.920938,饞:-11.114841,赦:-10.161574,铫:-14.270721,癬:-13.226176,己:-9.619773,穴:-9.186379,賻:-15.135719,湼:-15.017935,钀:-11.236274,嶆:-10.238812,颈:-9.670299,服:-8.897638,貐:-17.215160,嘗:-10.048894,疖:-13.749424,鄙:-11.518067,娟:-10.157262,蔡:-10.077087,丧:-10.294489,润:-9.782676,爯:-17.215160,昷:-17.215160,莺:-11.437508,樿:-11.673896,啁:-14.219428,奉:-8.831498,磈:-17.215160,泐:-15.269250,術:-9.168931,煙:-8.947968,叚:-12.981054,黜:-12.772509,苤:-12.808441,楩:-16.116548,呫:-13.137623,载:-9.098743,匄:-17.215160,掏:-10.475823,耎:-17.215160,備:-10.041202,缜:-13.386519,膣:-17.215160,挤:-9.492040,倮:-14.730253,粱:-12.693371,鴰:-13.263916,悹:-15.828866,脸:-7.949763,凃:-17.215160,鋅:-9.805418,籆:-16.522013,恎:-15.828866,兘:-10.246310,緛:-14.442571,鉚:-13.430970,懣:-14.442571,虢:-12.487772,园:-9.658209,鏯:-15.423401,絰:-17.215160,嫵:-14.219428,蟷:-16.116548,慸:-14.817265,份:-8.765390,诿:-12.897672,嚂:-15.828866,砉:-13.577574,民:-8.414293,互:-9.589077,崛:-12.833133,犚:-17.215160,鸝:-14.324788,暢:-10.604464,舥:-13.137623,甫:-10.889011,檪:-15.135719,垬:-10.620747,邮:-11.218708,宴:-10.332723,活:-8.227963,袾:-15.828866,剅:-9.590541,柌:-16.116548,荏:-15.828866,比:-6.743380,哖:-16.522013,釘:-9.806024,繝:-14.079666,壞:-8.776145,扥:-16.522013,卯:-11.942160,聹:-16.522013,棾:-17.215160,嘀:-12.191280,锂:-11.826088,娈:-12.324811,暋:-16.522013,養:-9.110155,丐:-10.413877,檓:-17.215160,钗:-11.755575,嶝:-15.605722,映:-10.763111,貧:-10.550751,樨:-17.215160,疭:-16.116548,鐬:-12.580431,崲:-13.688800,禵:-15.269250,涽:-16.522013,谼:-17.215160,韁:-11.478588,峇:-12.152565,鯉:-10.932893,近:-7.441952,浒:-13.781173,靖:-10.921741,屜:-13.781173,泧:-13.749424,车:-8.006321,瑬:-17.215160,忱:-12.911095,髳:-16.522013,硴:-17.215160,軻:-13.551598,焅:-17.215160,徆:-14.442571,骈:-12.280686,躐:-14.912575,椕:-17.215160,吗:-7.251283,錙:-15.135719,堟:-11.191712,箞:-11.233746,蜡:-11.016681,澦:-17.215160,謩:-16.522013,瀯:-13.996284,鶲:-14.912575,搷:-13.040773,膺:-12.402976,栿:-16.522013,竈:-15.605722,佑:-10.631751,滐:-12.478962,獙:-13.659812,鳜:-13.551598,条:-7.775058,胤:-10.846973,歩:-16.116548,噫:-12.590187,镭:-12.505630,婳:-14.442571,緲:-12.496661,饵:-10.691598,乻:-16.522013,懺:-13.120815,億:-8.915377,綇:-12.197880,舎:-17.215160,劙:-14.442571,龛:-11.807988,紜:-11.738696,莣:-15.828866,愤:-11.006570,刮:-10.032048,纱:-10.545662,抹:-9.514412,茸:-10.955579,參:-9.260437,郅:-11.989413,繆:-12.630193,蓍:-14.507110,扎:-9.233085,裕:-10.645679,翛:-15.828866,揣:-10.934764,哭:-8.295439,罰:-9.589565,觿:-17.215160,瘁:-14.912575,咂:-12.302505,醄:-14.730253,稉:-17.215160,墊:-10.299437,薌:-12.808441,渑:-14.079666,弛:-12.496661,耥:-17.215160,眫:-17.215160,梪:-16.116548,喬:-10.846973,銮:-12.749252,笳:-13.343959,妴:-16.116548,蚶:-12.884427,偅:-10.387531,旌:-12.133756,腏:-17.215160,槔:-13.718652,鏘:-12.871355,籝:-13.919323,嫞:-16.116548,蟠:-12.231553,恥:-16.116548,仦:-17.215160,诨:-12.523812,兯:-17.215160,狮:-10.589768,鹱:-13.551598,曶:-14.124118,艹:-12.845712,堀:-15.269250,合:-8.061073,撓:-10.969053,骗:-9.739821,厝:-12.911095,侥:-12.981054,搨:-15.423401,箭:-9.053500,瞵:-16.522013,阴:-9.474496,伺:-12.005674,駁:-11.158376,勇:-9.679863,闉:-13.847864,臑:-13.430970,捒:-15.828866,剜:-12.050374,盟:-10.521836,镞:-11.401030,拧:-10.753692,腦:-16.116548,飫:-12.966665,穬:-14.079666,凱:-11.315263,铳:-12.178207,扼:-11.697707,颀:-14.124118,缅:-10.969053,针:-9.417869,欍:-13.088026,肐:-15.605722,朕:-9.426948,禖:-15.269250,鴙:-12.523812,嘟:-12.339963,褡:-13.453960,憦:-16.522013,縯:-13.813963,鎲:-14.270721,樷:-13.283334,昿:-16.522013,奁:-12.620040,啉:-13.604242,瓈:-17.215160,衋:-17.215160,惐:-16.116548,絙:-13.919323,忚:-11.844522,楡:-15.423401,敩:-14.912575,填:-9.997717,味:-8.837689,珲:-12.650812,濺:-12.542331,荽:-14.324788,弄:-8.552309,率:-8.162761,逆:-10.023731,澏:-16.522013,谎:-11.282915,岙:-14.912575,醛:-11.576805,猜:-9.446627,趣:-11.462587,漤:-16.522013,尮:-14.912575,炱:-13.604242,鄰:-9.646264,油:-8.573098,贸:-11.799060,黅:-14.219428,諍:-12.309885,汎:-16.522013,嵘:-13.283334,鹚:-14.381947,詢:-11.785814,嫭:-12.704301,囵:-16.522013,请:-7.149426,浸:-10.871280,码:-9.878874,龄:-10.649895,琉:-11.794625,嚊:-15.423401,讌:-17.215160,檢:-16.522013,踥:-14.730253,礫:-12.436037,暪:-17.215160,宬:-14.576103,鲮:-14.124118,申:-10.642877,垴:-15.828866,愻:-16.116548,蒾:-15.828866,幅:-9.446627,翄:-14.650211,鍇:-15.269250,毌:-15.828866,柔:-9.856966,壖:-16.522013,牝:-13.919323,哞:-14.381947,湥:-16.522013,藨:-15.017935,彯:-16.116548,棶:-11.465767,豹:-10.580527,擾:-10.897995,娀:-15.828866,餂:-15.605722,嘈:-12.444475,锊:-13.072025,暓:-17.215160,脒:-14.324788,颗:-9.624308,冝:-15.828866,钟:-9.034839,樠:-17.215160,昨:-11.826088,禭:-17.215160,頬:-13.688800,儲:-11.045549,疵:-13.040773,憽:-17.215160,耼:-17.215160,鯁:-14.912575,祂:-14.170638,僇:-16.522013,韉:-11.562671,畊:-16.522013,菑:-10.724437,慒:-17.215160,停:-8.526706,瓟:-13.172109,非:-7.515136,惧:-9.946937,荦:-13.813963,髫:-14.817265,硬:-8.660093,叱:-11.199003,瑴:-14.442571,苻:-11.456258,恼:-10.311413,骀:-14.912575,紅:-15.828866,历:-9.620276,隈:-14.912575,植:-10.887223,侎:-13.813963,芐:-12.737823,堗:-17.215160,箖:-14.037106,鼙:-12.995652,吟:-10.795165,瞞:-9.865929,謡:-15.828866,蜩:-14.912575,簯:-11.631664,劰:-17.215160,醲:-17.215160,样:-9.465838,亸:-11.163071,趺:-13.408498,搿:-12.609990,鹃:-10.976835,盈:-11.249013,詋:-12.845712,拐:-9.864002,虓:-15.135719,郜:-13.919323,歡:-10.075500,賤:-10.440936,杩:-9.053214,饭:-8.461947,噳:-14.324788,镵:-16.116548,淺:-9.260086,腽:-17.215160,崄:-11.440608,庙:-8.794258,鎛:-14.730253,焜:-14.270721,辣:-10.283688,洤:-16.522013,帮:-8.436680,犱:-10.771029,輸:-9.235136,心:-7.079133,鳅:-12.871355,牆:-8.609773,湎:-13.025505,蓕:-14.219428,彘:-12.640449,珛:-12.402976,鱚:-15.135719,衢:-11.730363,鷯:-16.116548,獰:-14.730253,哵:-12.211214,潸:-15.423401,藿:-13.882956,稁:-17.215160,瘉:-12.924701,我:-4.511830,薔:-13.781173,粚:-17.215160,逝:-11.016681,伣:-14.730253,梢:-10.250080,谥:-11.256735,笫:-12.693371,妬:-16.116548,眳:-13.263916,誶:-13.226176,居:-8.111069,緄:-12.178207,酇:-15.135719,槌:-11.548733,赏:-9.424051,嫖:-12.121410,灝:-15.423401,回:-7.147345,诠:-12.121410,嵯:-13.604242,绮:-10.031289,櫶:-15.828866,曾:-6.936426,尀:-17.215160,碃:-17.215160,鼂:-14.270721,倈:-16.522013,沋:-16.522013,悓:-11.022798,蜒:-12.966665,麗:-10.172000,砘:-13.813963,垝:-13.154717,蚧:-12.079362,怨:-9.975227,鸬:-12.402976,鈴:-16.522013,枽:-17.215160,蘼:-13.551598,鷁:-13.263916,罂:-13.477490,釉:-11.443719,獊:-13.526281,绗:-10.923591,鵖:-14.324788,噜:-12.590187,酞:-14.219428,曧:-15.423401,繬:-11.221199,牴:-12.609990,鲀:-13.207827,笅:-9.978101,喆:-14.170638,邈:-13.996284,漍:-17.215160,蒐:-15.269250,挕:-17.215160,帗:-16.522013,綖:-14.442571,刟:-17.215160,贡:-10.691598,脩:-14.912575,咰:-17.215160,鞲:-13.283334,渷:-14.650211,论:-8.308902,房:-8.450014,嵁:-12.551721,顃:-16.522013,光:-7.919101,烈:-9.604802,擐:-14.912575,寚:-12.252315,雜:-17.215160,浡:-13.088026,俢:-14.730253,諤:-12.693371,屫:-15.605722,鍵:-10.525561,蝽:-13.477490,瞇:-11.081762,殏:-13.847864,蠎:-12.995652,墙:-8.609773,閛:-17.215160,眜:-15.605722,欤:-12.121410,堮:-17.215160,锰:-10.312417,梹:-17.215160,褸:-15.828866,姃:-15.135719,髅:-13.847864,瑆:-15.269250,軍:-7.004188,桎:-16.116548,苕:-10.198550,奘:-13.781173,痛:-9.004492,驚:-8.177151,槣:-17.215160,蹢:-17.215160,廭:-16.522013,鯯:-14.170638,異:-9.067582,勵:-12.273518,迷:-9.832414,楸:-12.833133,鮄:-14.817265,瀉:-11.049742,劊:-14.381947,唛:-17.215160,阝:-14.576103,溢:-11.555678,訥:-11.937045,紫:-8.541476,抪:-17.215160,徬:-13.659812,颮:-14.079666,厴:-12.808441,貶:-11.022798,攻:-8.582498,肾:-9.968792,婅:-11.755575,範:-10.478193,乍:-10.821569,譏:-12.302505,峖:-16.116548,駘:-14.912575,癝:-15.828866,橥:-15.017935,臨:-9.274220,孯:-17.215160,磮:-17.215160,鑱:-12.245347,佷:-10.735115,泶:-13.919323,惾:-17.215160,帀:-11.285571,窃:-10.688665,刈:-12.171735,抓:-8.436988,喝:-7.999534,渠:-10.375684,維:-9.785639,唲:-15.135719,熵:-11.973413,逴:-17.215160,施:-9.257633,萼:-11.101478,終:-17.215160,哇:-10.263388,鏉:-9.563089,煊:-13.104286,蟑:-15.828866,糗:-14.817265,呜:-10.336834,烟:-8.947968,鍞:-12.808441,蝦:-9.978821,籬:-12.938494,埱:-16.522013,灴:-17.215160,蛻:-12.109215,摼:-17.215160,礅:-14.730253,垆:-14.650211,洍:-16.522013,蚐:-13.283334,愕:-11.410025,尗:-14.507110,借:-8.823303,玞:-16.522013,枦:-16.522013,砯:-17.215160,閲:-10.146988,氷:-17.215160,覺:-8.404551,怿:-14.650211,彁:-12.444475,绀:-12.551721,驃:-13.263916,卉:-13.604242,狈:-12.938494,蹋:-12.419369,姚:-11.049742,铜:-8.560120,潡:-13.749424,裤:-10.996560,捩:-15.605722,幫:-8.436680,剳:-12.981054,酵:-13.056277,槺:-15.269250,处:-7.089850,疇:-12.171735,阆:-13.025505,討:-9.505852,媙:-17.215160,甜:-9.613758,亡:-9.514865,讣:-13.477490,椤:-11.320757,皱:-10.079473,霰:-13.120815,丶:-13.526281,檹:-15.269250,寃:-15.017935,癆:-13.749424,賍:-12.273518,存:-8.925872,矛:-11.008584,顚:-17.215160,你:-4.849578,豢:-11.844522,聪:-11.830665,峭:-12.165304,僵:-10.986649,跷:-11.952470,歸:-8.319667,臿:-15.423401,縁:-17.215160,岂:-8.910665,馄:-12.704301,昑:-15.017935,碚:-13.847864,鐝:-13.323340,蠥:-17.215160,缫:-12.911095,悪:-16.116548,嶬:-17.215160,骮:-11.119335,冴:-17.215160,朻:-16.116548,芾:-12.897672,镇:-7.906242,淌:-11.233746,襏:-17.215160,懔:-13.137623,廖:-11.254155,瑝:-16.116548,勞:-10.206655,迠:-16.522013,桥:-8.167456,奯:-15.605722,竮:-17.215160,滶:-17.215160,詹:-10.908885,拾:-9.973794,怀:-9.656122,螅:-11.331838,氈:-10.986649,鎍:-17.215160,龕:-11.135227,蜚:-13.551598,殝:-16.522013,倠:-15.017935,錢:-7.424225,瞥:-10.934764,尨:-14.730253,蚯:-13.551598,欲:-8.525359,侵:-10.135976,銷:-13.847864,眺:-13.813963,宽:-8.101220,麿:-14.507110,佊:-17.215160,盏:-10.299437,孒:-17.215160,橜:-15.828866,仟:-14.324788,癤:-13.749424,嫧:-15.269250,槱:-15.269250,乴:-15.269250,酶:-10.109374,痹:-12.287906,婼:-13.919323,訇:-15.017935,榆:-11.906892,匍:-13.408498,阏:-13.501588,疎:-16.522013,引:-8.593607,戗:-13.120815,蒘:-17.215160,渟:-16.116548,邠:-14.507110,稧:-16.522013,鲨:-10.969053,械:-10.561008,刷:-9.619270,锹:-12.171735,帿:-12.444475,慁:-15.828866,菂:-16.522013,浉:-12.259333,鯒:-15.269250,衛:-9.806629,柚:-12.820711,鑣:-13.072025,嵩:-12.011153,恫:-13.631641,汳:-16.116548,軴:-13.882956,硻:-15.605722,基:-9.014323,髼:-12.833133,朄:-15.423401,貉:-12.760813,猌:-17.215160,垏:-13.120815,频:-10.471101,缔:-13.781173,耖:-15.269250,撙:-17.215160,谞:-15.269250,頦:-12.097166,粩:-13.882956,搮:-15.269250,足:-8.057693,咹:-15.269250,簾:-10.976835,旃:-12.609990,赈:-11.952470,呎:-12.523812,敘:-9.980983,諝:-17.215160,煠:-15.605722,嗣:-10.458228,絨:-11.446839,拭:-11.425200,該:-6.976022,啸:-11.368721,竽:-12.808441,堑:-11.392114,窒:-11.508050,椛:-16.116548,讜:-12.542331,産:-14.576103,劢:-14.270721,舭:-15.017935,掬:-12.671865,踵:-13.189808,澴:-16.522013,箼:-15.135719,晅:-16.522013,裆:-12.650812,牍:-12.650812,双:-8.179768,铎:-12.121410,繕:-11.685731,忔:-11.213745,荗:-17.215160,惖:-15.605722,轟:-9.668186,泞:-16.522013,噥:-12.514680,杯:-9.316007,獷:-15.269250,闸:-10.152968,罿:-13.882956,戀:-10.925444,薅:-13.577574,済:-13.104286,劋:-15.135719,醍:-16.116548,稐:-17.215160,库:-9.579373,蔚:-12.121410,删:-11.882441,鄢:-13.749424,疥:-13.847864,帨:-16.522013,鴪:-16.522013,蒯:-14.576103,邷:-17.215160,町:-12.184722,妽:-13.025505,鲿:-13.957064,棇:-14.730253,瓏:-12.514680,奒:-17.215160,鱔:-12.995652,桜:-14.576103,鏡:-9.859519,瑤:-11.068831,蝮:-13.996284,毱:-17.215160,鍶:-12.427668,塼:-17.215160,殆:-13.137623,儍:-16.522013,鐏:-11.689707,瞎:-9.266775,崕:-14.170638,怗:-15.605722,氟:-11.035143,銠:-13.659812,砧:-13.025505,宦:-11.722099,檰:-14.576103,倷:-17.215160,霹:-15.135719,皸:-17.215160,尿:-9.735860,臂:-9.783860,仈:-13.631641,筑:-9.521223,駒:-12.139986,詛:-13.996284,卡:-9.211797,陣:-9.082160,彩:-9.466700,扫:-9.653518,緪:-16.116548,胬:-13.813963,湳:-13.688800,賴:-17.215160,穻:-15.269250,飼:-10.735115,攄:-15.828866,躉:-11.994804,焌:-15.828866,喏:-11.446839,骑:-8.817426,純:-9.442407,舖:-15.423401,暙:-17.215160,踞:-12.073496,唤:-9.821897,纩:-15.017935,莫:-9.187357,昮:-17.215160,父:-9.211797,鮻:-16.116548,績:-11.090477,荀:-12.590187,柃:-17.215160,噎:-11.872826,魐:-12.266400,翓:-17.215160,杘:-15.828866,裝:-16.522013,獠:-12.715350,铥:-15.135719,罨:-13.882956,惭:-12.252315,衲:-12.911095,泵:-11.475367,鑺:-12.139986,磽:-13.263916,蜃:-12.650812,悂:-15.605722,三:-6.556913,娑:-10.514429,鼓:-9.323829,傢:-16.522013,閤:-14.650211,岪:-13.430970,憬:-13.303137,谵:-17.215160,涴:-17.215160,摅:-15.828866,諆:-17.215160,灍:-16.522013,凌:-11.301657,雎:-13.847864,籕:-16.116548,巔:-15.605722,腗:-15.828866,拖:-9.067872,赟:-12.073496,滞:-11.114841,饧:-12.833133,竦:-11.826088,敯:-12.505630,诰:-10.273970,煷:-17.215160,勶:-11.135227,廾:-14.650211,搀:-11.301657,莅:-12.938494,栈:-12.085261,咋:-9.964525,鞍:-10.923591,墓:-8.430232,茚:-13.343959,吠:-11.627911,玥:-15.017935,堨:-16.522013,芯:-10.412765,漲:-9.570241,隷:-12.309885,猺:-15.135719,徽:-11.211273,艄:-12.542331,滇:-10.577902,陌:-12.127564,归:-8.319667,湜:-12.551721,闡:-12.461570,牤:-15.423401,腮:-10.970993,深:-7.942221,镶:-10.753692,燹:-17.215160,幼:-10.462890,饾:-17.215160,圍:-8.918614,肘:-11.149052,樟:-11.790210,钠:-10.419454,縧:-13.919323,風:-7.891938,贱:-10.440936,沰:-16.522013,嘷:-16.522013,鄹:-13.957064,炸:-9.556460,娿:-12.411139,敁:-15.828866,楉:-17.215160,诊:-11.315263,峐:-17.215160,揚:-17.215160,啡:-13.365012,遣:-9.726867,矢:-11.130661,奩:-12.620040,篪:-15.605722,蛬:-15.135719,諴:-17.215160,类:-7.630776,叺:-11.868053,黼:-12.061868,挄:-14.170638,鲑:-12.715350,笔:-9.129058,悙:-15.135719,伜:-17.215160,璡:-13.189808,碩:-11.142116,薫:-16.522013,琶:-13.056277,傹:-17.215160,鶻:-12.682561,砾:-12.436037,痋:-12.027774,偎:-12.184722,鵐:-16.116548,秓:-17.215160,慘:-16.116548,畠:-12.620040,鋥:-14.270721,票:-9.451714,蹲:-10.055868,典:-9.828689,鉺:-14.730253,绽:-11.135227,脃:-14.912575,暂:-9.966656,锋:-10.427315,少:-7.408459,餓:-9.643172,洛:-10.250080,辜:-12.514680,焣:-13.263916,嚢:-17.215160,媪:-13.577574,蘭:-9.978101,枬:-12.938494,殴:-12.146256,崻:-17.215160,鸽:-11.962887,羼:-14.912575,癍:-13.551598,埌:-10.604464,郎:-9.624813,寔:-12.427668,蝗:-11.677826,擖:-17.215160,九:-8.227588,譟:-16.116548,剥:-10.287602,齧:-16.522013,睷:-13.718652,昀:-13.577574,膅:-16.116548,嚋:-17.215160,閍:-17.215160,縐:-10.584477,馕:-12.419369,脚:-8.442240,涝:-12.103172,嘠:-17.215160,锢:-12.061868,熥:-15.828866,餪:-17.215160,肯:-9.216825,洲:-9.167011,钷:-14.650211,焺:-14.381947,嶽:-14.912575,聄:-15.423401,泇:-16.116548,鑌:-16.522013,烏:-9.788611,嵒:-13.813963,顔:-15.828866,汜:-12.749252,灤:-12.609990,峧:-17.215160,濱:-10.487728,靶:-11.189294,珹:-16.116548,屼:-9.277785,谇:-13.226176,澆:-10.809932,透:-9.298353,玎:-12.715350,夕:-11.208807,搗:-10.106916,芘:-14.381947,栟:-15.269250,隠:-17.215160,簧:-11.534987,骨:-8.934702,犸:-17.215160,杁:-15.605722,藂:-13.957064,歉:-11.431335,觊:-14.912575,网:-8.332075,坡:-9.833658,痢:-12.103172,孩:-11.839882,晫:-11.901954,蓬:-10.905242,橳:-16.116548,裴:-11.243898,出:-5.854838,蚁:-11.056065,誉:-9.687904,甌:-12.796319,冏:-14.037106,麑:-16.522013,蘖:-13.957064,皡:-15.135719,儤:-15.828866,鸦:-11.709829,窩:-9.573116,螫:-12.640449,戮:-11.952470,亱:-14.079666,讳:-10.860790,効:-11.942160,蝀:-15.605722,剎:-13.749424,齐:-8.814501,篓:-12.924701,捘:-17.215160,睠:-17.215160,口:-7.273510,筨:-13.996284,擭:-13.226176,佰:-15.269250,棵:-10.498565,卸:-10.353449,遺:-10.160710,范:-10.478193,撂:-11.481819,梊:-16.116548,帑:-12.952480,鬓:-11.717992,粒:-10.174624,趜:-17.215160,猣:-17.215160,咢:-17.215160,醤:-12.620040,斬:-9.442828,蠵:-15.017935,榴:-12.085261,弻:-13.453960,鰽:-17.215160,綼:-17.215160,恅:-14.650211,軆:-13.501588,瑍:-16.522013,嗌:-13.025505,硕:-11.142116,委:-9.905279,曖:-13.957064,襟:-11.440608,櫞:-14.730253,健:-9.892650,绦:-11.942160,慯:-17.215160,述:-9.793983,畷:-16.116548,祿:-11.213745,嫾:-13.847864,栀:-14.324788,辅:-10.273003,鮍:-14.507110,堠:-14.381947,鬢:-11.717992,羥:-12.693371,吨:-8.547824,霪:-16.116548,躯:-11.812483,挲:-14.270721,骷:-13.303137,缺:-9.389515,蹄:-11.174905,拇:-11.545279,驌:-14.650211,经:-7.260884,卒:-8.819457,陔:-15.135719,扜:-14.650211,闩:-12.139986,懱:-16.522013,饶:-9.801190,緹:-14.324788,剼:-12.737823,伅:-13.577574,與:-5.226100,憆:-17.215160,鸏:-17.215160,綎:-13.056277,樗:-13.104286,貘:-13.408498,星:-8.820360,颠:-10.730525,爧:-16.522013,冦:-12.938494,钨:-11.146734,脱:-8.978210,悰:-14.037106,粸:-13.718652,嘿:-11.039293,楁:-11.035143,诂:-13.996284,敉:-13.919323,蟊:-13.718652,煑:-17.215160,聛:-14.912575,奡:-15.423401,鱣:-16.522013,啩:-17.215160,桫:-17.215160,摳:-11.485060,蛴:-13.025505,鋼:-9.374847,袁:-9.253093,蒉:-15.828866,笌:-13.453960,徏:-17.215160,邑:-10.718385,眔:-15.828866,蠖:-12.981054,沙:-9.231720,碡:-15.828866,弤:-15.269250,逦:-13.323340,璩:-14.507110,氮:-10.706391,薳:-15.017935,岹:-17.215160,襀:-15.828866,蕈:-13.718652,秋:-9.258333,屎:-10.955579,酐:-13.847864,浘:-12.726524,祠:-10.845259,巣:-17.215160,黥:-13.323340,畨:-12.217948,色:-8.374725,曵:-17.215160,嵸:-14.650211,鹺:-13.551598,狽:-12.938494,們:-6.588675,锓:-13.283334,犒:-12.620040,愛:-14.270721,亚:-8.551445,莜:-15.828866,紣:-15.828866,設:-7.532194,殬:-15.828866,枴:-16.116548,儻:-14.270721,鈽:-17.215160,湅:-10.910711,俄:-8.576635,胆:-10.108554,積:-9.415407,富:-9.320842,鳎:-11.697707,癕:-15.423401,埔:-12.981054,棖:-15.605722,蝟:-15.605722,擞:-12.452986,幥:-17.215160,鍧:-11.485060,烦:-10.107735,潯:-12.295179,筷:-11.858574,壶:-9.976663,鷸:-13.189808,睿:-10.248193,樀:-13.189808,亃:-12.737823,超:-8.954150,昈:-16.522013,媋:-15.269250,馍:-11.362958,爐:-9.848083,嚓:-12.152565,丘:-10.078677,憝:-15.269250,娠:-14.124118,餢:-11.485060,锪:-13.996284,貯:-11.345863,愲:-16.522013,紺:-12.551721,冽:-14.170638,钿:-13.430970,豄:-17.215160,惇:-12.671865,題:-8.572568,兒:-7.572258,这:-4.739858,恜:-15.605722,鯡:-13.010467,籤:-15.269250,僧:-8.944379,韩:-9.069610,轮:-8.778093,翹:-10.923591,偼:-14.912575,掆:-16.522013,复:-8.467331,鰏:-15.828866,美:-7.485490,栗:-11.755575,躘:-15.135719,骠:-13.263916,瀧:-13.919323,厦:-11.602032,隨:-11.594759,茱:-14.124118,鼹:-14.730253,纸:-8.991801,吿:-15.828866,观:-8.833100,杉:-10.655545,勐:-13.244868,余:-8.233101,淚:-9.629371,孡:-17.215160,鹣:-13.847864,坩:-14.912575,橫:-16.116548,痪:-12.600040,晳:-14.324788,蓴:-13.453960,牻:-14.324788,巺:-15.605722,洄:-11.602032,礌:-13.604242,嶏:-12.050374,銑:-11.807988,訖:-11.777081,蘞:-15.828866,窡:-11.755575,崤:-12.966665,鈦:-10.436375,皩:-16.116548,讫:-11.777081,渮:-15.828866,螳:-14.817265,稶:-14.381947,庹:-13.781173,鎻:-11.785814,瘾:-11.627911,濃:-14.442571,蝈:-16.116548,篋:-13.303137,幎:-16.522013,鍐:-9.883445,矓:-15.605722,潘:-10.850409,胝:-14.124118,筠:-15.017935,忣:-16.522013,鳥:-9.192919,睨:-12.693371,棭:-13.104286,聲:-7.552916,彸:-13.072025,鱺:-16.116548,烽:-12.737823,較:-6.891943,刑:-9.826214,霓:-11.416067,炒:-8.809345,挛:-13.010467,膜:-9.632422,缣:-12.938494,墢:-17.215160,鶤:-16.522013,咪:-11.199003,榬:-16.522013,萵:-16.522013,医:-10.268184,熼:-11.498132,姌:-13.996284,黎:-10.644277,瑕:-10.366094,嗔:-10.885439,櫖:-16.116548,曞:-11.799060,履:-11.459418,酧:-12.427668,浯:-13.577574,仮:-13.749424,菰:-13.263916,祷:-12.204525,畿:-12.324811,图:-7.813208,怈:-14.507110,岋:-11.428263,龍:-8.088527,琐:-11.705772,枝:-9.933774,箥:-15.017935,倨:-13.430970,誯:-14.576103,朲:-16.522013,笺:-11.357227,垽:-14.324788,銿:-16.522013,佂:-17.215160,曇:-11.312527,鹌:-14.037106,坒:-16.522013,鉔:-12.570769,仗:-9.122003,晜:-17.215160,囧:-10.732053,釩:-11.112601,乬:-13.501588,旱:-10.596421,鵶:-17.215160,秹:-15.017935,噼:-13.847864,酾:-16.116548,蘇:-8.954409,弍:-16.522013,騏:-15.828866,禎:-13.025505,匕:-12.487772,渗:-11.254155,戟:-10.303413,鲠:-14.912575,瘧:-15.605722,喦:-14.381947,邨:-14.442571,撰:-10.141890,帷:-11.863302,刿:-14.912575,流:-8.049922,迂:-12.808441,菊:-10.548203,畑:-13.919323,哐:-12.411139,葛:-11.189294,毚:-14.079666,嵡:-14.170638,顣:-11.326282,兩:-6.545949,汫:-17.215160,珪:-11.398049,恳:-11.326282,苴:-13.072025,寺:-8.600477,雼:-16.116548,欄:-10.616651,肉:-8.407838,缌:-12.280686,宏:-10.539337,钑:-11.498132,谖:-12.523812,梙:-16.522013,粡:-11.580370,嬤:-13.120815,鐦:-13.749424,炩:-15.269250,趫:-17.215160,栮:-17.215160,膳:-10.587119,簶:-17.215160,墹:-15.605722,閻:-11.478588,瀾:-11.307077,赀:-12.609990,槃:-11.973413,腈:-13.207827,緋:-11.602032,镐:-10.976835,楘:-13.631641,姣:-11.251581,煨:-10.442080,拵:-16.522013,奸:-10.386448,驺:-14.381947,盽:-17.215160,褃:-13.477490,溂:-11.472157,把:-5.624663,向:-5.976948,鄓:-17.215160,皒:-13.813963,攛:-13.010467,庢:-10.557149,鮤:-14.381947,努:-11.083934,舵:-10.188733,掴:-13.847864,唻:-13.996284,阽:-16.522013,瞼:-12.871355,繍:-12.784343,忌:-8.863785,风:-7.891938,叔:-9.363110,泖:-14.912575,荟:-14.037106,惞:-15.269250,瓦:-9.135542,罷:-13.604242,島:-16.522013,駸:-14.124118,獿:-17.215160,僾:-17.215160,戈:-11.301657,庋:-11.785814,瘐:-15.135719,劓:-13.226176,醕:-15.605722,褚:-11.288234,斝:-14.324788,帠:-16.522013,鴢:-14.730253,禥:-15.135719,刨:-10.793538,攲:-14.381947,鲷:-13.137623,示:-10.339928,喽:-11.545279,衄:-13.154717,擇:-10.700447,啒:-13.303137,達:-6.966134,诙:-12.444475,摜:-12.419369,硤:-13.365012,哧:-11.916843,柱:-9.738122,呼:-9.111666,鍾:-10.969053,萇:-12.871355,枆:-15.135719,崍:-12.505630,頏:-17.215160,箎:-15.017935,儕:-14.270721,誘:-11.182074,怟:-16.116548,琧:-17.215160,垦:-11.646816,銨:-12.897672,蜱:-13.172109,暰:-17.215160,尷:-12.871355,窸:-13.453960,潁:-11.631664,什:-10.097955,跂:-16.116548,捉:-9.435275,臊:-12.324811,睑:-12.871355,闒:-15.135719,虛:-15.605722,槚:-16.116548,緢:-11.594759,卩:-16.522013,湫:-12.808441,燪:-16.522013,賬:-10.484142,扳:-10.728999,胴:-13.882956,登:-9.190625,姺:-16.522013,铼:-13.749424,躁:-11.863302,椄:-16.522013,芉:-13.526281,妏:-14.650211,隑:-17.215160,檙:-17.215160,舞:-9.304936,纡:-13.207827,夤:-13.343959,辫:-10.912541,莳:-13.882956,縶:-15.269250,媹:-15.423401,鞻:-13.996284,爾:-8.975567,荈:-16.522013,翋:-14.270721,珓:-15.828866,歘:-16.522013,蓝:-9.300908,寣:-14.912575,獨:-9.256933,泭:-14.170638,學:-7.446233,顺:-9.237192,丁:-9.024528,謃:-16.116548,沂:-12.184722,鼋:-12.158914,悊:-11.844522,嘑:-17.215160,璒:-17.215160,望:-7.843892,薜:-13.207827,笣:-13.813963,岢:-12.217948,伫:-14.170638,傪:-16.522013,谭:-10.921741,涬:-17.215160,耵:-15.828866,圻:-13.577574,疼:-9.686828,桅:-12.061868,蛆:-12.165304,籍:-9.970218,髎:-17.215160,灕:-17.215160,凔:-16.522013,拞:-16.116548,塥:-17.215160,镧:-13.577574,盦:-14.730253,楯:-13.882956,蟰:-15.423401,絷:-15.269250,延:-10.474641,煿:-13.957064,勾:-9.776777,瀀:-14.817265,咃:-11.892150,鞅:-13.386519,栐:-17.215160,辕:-12.671865,吘:-13.453960,箝:-14.507110,枥:-14.270721,輪:-8.778093,厭:-10.903425,徵:-12.630193,芷:-12.115294,机:-8.370535,卂:-13.283334,附:-9.327576,竇:-10.994570,彊:-13.088026,艌:-13.501588,曏:-17.215160,勗:-13.604242,穜:-16.522013,廟:-8.794258,臡:-16.522013,晤:-12.570769,跩:-16.522013,秱:-14.912575,年:-4.791725,旹:-16.116548,赾:-16.522013,禆:-14.442571,蘏:-13.847864,伕:-12.760813,冖:-17.215160,钘:-13.882956,縟:-13.501588,嶞:-16.522013,肠:-10.301423,貨:-17.215160,嘯:-15.605722,餱:-14.381947,碰:-9.671887,蔹:-15.828866,撸:-11.947302,煁:-14.442571,鏂:-10.077882,峈:-17.215160,诒:-12.911095,啙:-16.116548,顛:-17.215160,矚:-13.781173,董:-10.308405,火:-8.165223,鋬:-16.522013,米:-6.748179,寲:-12.650812,黴:-11.246452,桻:-17.215160,諼:-12.523812,邁:-15.269250,眄:-15.269250,宇:-10.908885,鲉:-14.124118,挌:-14.817265,演:-9.281363,逖:-14.079666,璙:-17.215160,悡:-14.270721,蠦:-17.215160,沩:-15.423401,醫:-16.522013,琮:-13.343959,怶:-16.522013,覻:-14.817265,氾:-11.897040,痃:-17.215160,懋:-13.244868,姛:-13.040773,髝:-16.522013,狭:-10.604464,驲:-16.522013,绵:-11.329056,虺:-13.577574,倁:-16.522013,锃:-14.270721,犂:-17.215160,尉:-11.434417,脋:-15.828866,纊:-15.017935,贓:-12.796319,檒:-14.817265,攣:-15.017935,儫:-12.952480,崳:-13.919323,鸵:-12.386846,殼:-9.575999,埄:-13.088026,飆:-12.952480,才:-6.292554,蓎:-16.522013,湕:-14.576103,俔:-11.508050,鍗:-10.141043,烖:-16.116548,齟:-12.487772,糞:-10.715373,棦:-12.995652,哮:-13.551598,駰:-14.912575,捷:-10.607159,潿:-15.135719,縈:-13.189808,樐:-15.135719,亓:-12.966665,趕:-8.799335,嘘:-11.730363,锚:-11.799060,脢:-17.215160,斥:-11.073123,丨:-13.104286,贪:-10.445518,冭:-12.067666,钯:-11.272361,礲:-15.828866,肷:-13.343959,攺:-15.423401,貿:-11.799060,兂:-11.041374,鑄:-10.261476,嵊:-12.924701,职:-8.509498,豔:-17.215160,僗:-13.957064,韙:-12.820711,硜:-15.017935,峟:-16.522013,菡:-14.170638,摤:-15.423401,迩:-13.477490,偬:-14.507110,篱:-12.938494,屴:-17.215160,轾:-17.215160,頇:-15.828866,萏:-15.017935,厖:-13.207827,隘:-11.440608,簟:-12.995652,從:-5.602978,芠:-14.079666,栧:-11.039293,启:-10.061326,鬱:-12.016663,窰:-17.215160,蜹:-13.172109,暸:-15.269250,獁:-14.442571,罉:-16.522013,廈:-11.602032,角:-9.061235,坙:-15.423401,驛:-10.688665,痚:-16.522013,懢:-17.215160,佩:-10.925444,淪:-12.252315,繳:-17.215160,鳴:-16.522013,裼:-13.577574,甄:-12.630193,妇:-10.125083,愌:-15.135719,誑:-12.005674,皙:-13.749424,夜:-8.916123,鸞:-11.693699,抡:-11.392114,鎫:-17.215160,瘮:-12.402976,媱:-15.423401,戶:-8.907947,讻:-17.215160,渾:-10.491328,婆:-10.642877,濓:-11.785814,睘:-13.919323,寛:-17.215160,飝:-13.813963,蓥:-17.215160,潨:-15.135719,热:-7.843126,孰:-11.514716,糵:-16.522013,葺:-15.423401,棽:-14.650211,刁:-12.533029,霃:-14.219428,帉:-13.088026,茋:-17.215160,粊:-14.912575,梒:-17.215160,笛:-10.326588,咚:-11.541837,朣:-15.828866,薤:-14.817265,逭:-13.919323,熬:-10.094716,弳:-16.522013,綴:-11.407018,榼:-16.116548,嗄:-12.523812,恍:-11.428263,蛎:-13.659812,汕:-12.966665,酗:-15.423401,狖:-12.760813,塝:-17.215160,鵟:-17.215160,绞:-10.967117,櫦:-15.135719,畯:-15.605722,囮:-15.828866,鯰:-14.507110,慷:-12.609990,蟸:-11.777081,仾:-15.828866,傃:-15.828866,融:-10.845259,氐:-11.174905,讕:-13.813963,倘:-10.372477,錚:-10.666941,羝:-13.040773,蜢:-14.650211,接:-7.954602,垭:-12.570769,缲:-16.522013,宵:-11.456258,挺:-8.987785,調:-8.262555,坂:-13.283334,鉄:-17.215160,织:-10.182536,孊:-16.522013,拏:-14.817265,佒:-17.215160,詔:-17.215160,囗:-16.522013,釙:-12.871355,繜:-15.828866,嫟:-14.124118,扤:-14.650211,噬:-11.887284,酮:-11.062427,緱:-14.170638,婴:-10.955579,乼:-17.215160,包:-8.641776,鸇:-17.215160,綆:-13.604242,憎:-12.133756,瘗:-15.017935,喖:-17.215160,邘:-15.135719,妞:-11.892150,刯:-17.215160,粰:-11.514716,脹:-10.630369,悸:-13.056277,哀:-10.671248,韂:-15.269250,祉:-14.576103,壈:-14.442571,鯊:-10.969053,浑:-10.491328,聣:-13.813963,柢:-13.010467,毪:-15.828866,雬:-17.215160,忲:-16.116548,汻:-12.505630,軼:-11.552200,钁:-13.010467,猄:-16.522013,徇:-13.386519,颉:-12.280686,朌:-17.215160,欔:-15.828866,鐖:-11.868053,炙:-11.685731,頞:-14.170638,谦:-10.874801,梩:-12.952480,閫:-13.813963,瀮:-17.215160,岱:-10.061326,馳:-10.122586,搶:-8.552136,栾:-14.507110,镀:-12.287906,燃:-10.867771,屆:-8.495843,饈:-11.534987,旋:-10.141890,赐:-9.442407,槓:-12.146256,巛:-16.522013,黝:-13.813963,敠:-15.423401,若:-7.474191,楨:-14.037106,嵰:-17.215160,鹲:-15.423401,竵:-12.339963,艺:-10.321504,吁:-11.449969,鄃:-15.605722,皂:-11.562671,堉:-14.124118,窊:-17.215160,褓:-16.116548,溒:-17.215160,紛:-11.456258,劚:-13.631641,龜:-10.409437,愣:-9.780903,唫:-16.116548,瞬:-11.620449,騵:-17.215160,箴:-12.760813,踽:-17.215160,叄:-17.215160,鳆:-17.215160,胎:-10.482949,瓖:-13.501588,魟:-13.957064,轧:-11.389160,泦:-12.496661,獯:-13.283334,僮:-12.044676,杷:-14.219428,歿:-12.580431,瘀:-11.697707,劃:-17.215160,醅:-15.605722,稈:-12.146256,渐:-8.842993,刘:-8.542845,鄚:-15.423401,綝:-12.924701,褪:-10.867771,邯:-12.715350,紲:-16.116548,蒷:-15.828866,愺:-17.215160,袿:-17.215160,啂:-16.522013,遄:-13.386519,糇:-14.381947,惏:-16.522013,衔:-9.874324,哗:-10.662652,籜:-14.124118,壟:-13.104286,恤:-11.863302,诩:-12.347626,呬:-11.677826,鍮:-17.215160,翱:-12.650812,塴:-12.938494,蝶:-11.620449,譾:-15.605722,儅:-17.215160,羆:-13.303137,掎:-16.116548,琗:-16.522013,垖:-14.817265,銘:-11.437508,砟:-14.650211,实:-8.325300,蚠:-13.781173,氧:-10.030531,侦:-11.821532,誨:-10.715373,鼱:-15.269250,纰:-11.887284,茹:-13.207827,睁:-9.330207,囀:-14.079666,闂:-10.343032,等:-5.029627,嫈:-14.124118,潑:-10.387531,仐:-14.037106,卙:-15.423401,鹛:-14.576103,燚:-17.215160,既:-7.473251,癫:-12.845712,铬:-10.866021,已:-6.021917,飴:-12.287906,湻:-15.423401,購:-10.299437,隁:-17.215160,焄:-15.135719,嶇:-17.215160,躑:-17.215160,椔:-16.116548,阖:-11.462587,崜:-15.017935,暡:-14.219428,踦:-13.365012,檩:-15.423401,鞫:-12.682561,昶:-14.442571,樾:-13.477490,幆:-14.650211,魈:-13.882956,柋:-16.522013,轐:-17.215160,毓:-12.238426,獘:-15.269250,忛:-12.280686,鳝:-12.995652,杠:-12.146256,胥:-13.056277,瓭:-16.116548,彰:-11.734521,磵:-17.215160,泽:-10.745910,嘁:-12.640449,娉:-10.716878,蜋:-15.017935,丑:-9.927599,沒:-6.348365,缛:-13.501588,傚:-9.762758,挣:-10.234154,圫:-15.828866,鐭:-11.108137,疬:-16.116548,頵:-16.116548,伻:-16.116548,涼:-9.823745,灅:-17.215160,凄:-12.171735,苎:-13.365012,桕:-14.576103,镗:-12.000224,盖:-8.878290,屝:-16.522013,饟:-17.215160,竞:-10.185187,赧:-13.957064,滦:-12.609990,煯:-16.116548,勮:-10.534305,敷:-10.724437,菸:-15.269250,楿:-15.423401,砀:-13.813963,岃:-9.692760,龅:-11.514716,尘:-10.318466,鼚:-17.215160,玝:-14.817265,澥:-16.522013,宭:-15.828866,麯:-17.215160,猲:-13.659812,垵:-13.263916,鹄:-11.764122,坊:-10.276876,滏:-13.882956,虔:-12.171735,嫗:-14.324788,鷙:-13.172109,囟:-12.871355,藩:-10.658382,婬:-17.215160,噴:-15.017935,淹:-11.631664,蕾:-12.238426,鈇:-14.650211,熆:-17.215160,踏:-9.710218,涎:-12.067666,稗:-13.154717,妖:-9.389116,鲘:-17.215160,瘟:-12.347626,喞:-17.215160,戧:-13.120815,蒨:-16.522013,帯:-16.522013,鄱:-12.726524,炰:-11.887284,费:-9.129673,沸:-11.764122,祁:-12.884427,壀:-16.522013,哈:-9.398340,慑:-11.863302,嵙:-15.605722,遛:-12.561200,翚:-13.781173,豣:-17.215160,毢:-17.215160,硫:-10.620747,髬:-16.522013,史:-8.274400,恻:-12.266400,俺:-9.353433,颁:-9.338142,缄:-13.072025,钉:-9.806024,欌:-13.577574,侏:-14.650211,朔:-11.144422,粙:-13.749424,匜:-15.269250,鐞:-11.772742,梡:-15.017935,伤:-8.310937,耦:-13.659812,撩:-11.114841,簮:-14.324788,傱:-17.215160,栶:-16.522013,膻:-12.191280,搾:-15.828866,偆:-15.269250,镈:-14.730253,構:-10.568770,腐:-10.934764,旓:-12.152565,凛:-11.043459,鋝:-13.072025,楠:-11.609358,敨:-16.522013,竭:-11.650640,兰:-9.978101,鉲:-15.135719,蹺:-17.215160,拽:-10.173748,堁:-17.215160,吉:-9.355747,皊:-11.901954,蔓:-11.821532,抒:-12.386846,庚:-12.302505,洣:-15.423401,夫:-8.902779,騭:-14.650211,箬:-13.957064,唳:-13.477490,阵:-9.082160,掼:-12.419369,繅:-12.911095,忄:-15.828866,晕:-10.042735,磖:-15.828866,剝:-10.287602,瓞:-17.215160,乥:-15.423401,荧:-13.501588,惦:-12.924701,峮:-17.215160,歷:-15.828866,跸:-12.966665,板:-8.688215,稀:-9.942067,瘈:-13.919323,成:-6.503413,帘:-10.976835,熝:-17.215160,褢:-11.374518,蔪:-12.561200,妭:-13.577574,喵:-10.910711,袷:-11.978718,洺:-10.936639,蒿:-10.674130,奂:-13.137623,烇:-12.609990,啊:-7.225036,行:-7.210561,葔:-17.215160,壗:-17.215160,灜:-15.135719,哟:-10.013989,诡:-12.005674,汤:-8.896662,塬:-11.989413,齮:-17.215160,呴:-12.027774,蝾:-15.135719,崅:-15.135719,玆:-16.116548,谏:-10.462890,澎:-13.104286,砗:-13.477490,宖:-17.215160,垞:-16.522013,誠:-10.591095,性:-7.679336,蚨:-13.189808,尯:-11.609358,錱:-14.324788,溸:-17.215160,嫀:-14.817265,駂:-17.215160,睉:-15.605722,囈:-13.749424,闊:-11.280266,捑:-17.215160,彙:-13.551598,鉛:-9.770327,線:-8.267744,蹣:-15.605722,槢:-13.688800,穫:-17.215160,旪:-17.215160,癳:-12.478962,胼:-16.522013,骁:-13.104286,約:-6.991947,冇:-16.116548,隉:-14.912575,芑:-13.453960,攔:-10.159847,騖:-13.957064,儜:-13.659812,暩:-15.828866,鮫:-11.613041,縮:-9.602329,励:-12.273518,鞳:-15.423401,亹:-13.072025,显:-8.787017,魀:-15.605722,翃:-16.522013,靈:-17.215160,毋:-11.785814,乎:-9.971647,荐:-11.196567,染:-10.140197,罘:-14.170638,叛:-10.777408,郝:-11.531580,歠:-16.116548,俣:-12.280686,杨:-7.494574,磭:-15.269250,印:-9.066714,遲:-9.655601,佸:-9.350740,豺:-13.303137,惽:-14.912575,威:-9.658732,碂:-15.017935,嘉:-9.343086,謋:-17.215160,璊:-15.828866,蜓:-13.659812,悒:-15.269250,猛:-9.066425,岚:-13.072025,醜:-16.116548,漣:-11.267125,嬫:-10.558434,頭:-16.522013,圳:-13.882956,鐵:-8.149383,疴:-15.017935,耽:-11.639211,巄:-17.215160,鋆:-15.017935,軎:-15.828866,摕:-17.215160,饗:-12.394878,竖:-10.137662,镟:-12.938494,盞:-17.215160,腧:-13.996284,拦:-10.159847,絯:-16.522013,楷:-12.590187,迸:-11.213745,敿:-17.215160,簀:-15.828866,境:-8.942334,辍:-12.039010,搐:-14.576103,莕:-17.215160,徭:-12.370973,骯:-14.817265,躷:-14.817265,欺:-10.317455,彂:-11.781438,驄:-14.817265,半:-8.203149,蹌:-14.170638,艔:-14.381947,廗:-16.116548,駙:-12.737823,癜:-15.017935,募:-11.259323,跡:-10.852132,幬:-17.215160,饮:-9.147697,痱:-15.423401,剴:-16.522013,赶:-8.799335,槹:-16.522013,腾:-10.073123,嬅:-17.215160,阇:-12.630193,疆:-11.099268,伍:-10.923591,訏:-17.215160,嶖:-16.522013,题:-8.572568,爟:-17.215160,冞:-16.522013,負:-17.215160,昧:-11.274989,锱:-15.135719,環:-11.926893,絁:-15.605722,煉:-10.212095,僈:-14.912575,鏊:-13.137623,救:-8.471947,蟒:-11.422146,鑛:-17.215160,篚:-15.605722,衣:-9.119561,籫:-17.215160,揪:-10.002128,摻:-11.872826,鲁:-9.841158,笄:-13.172109,垇:-15.828866,圜:-11.821532,逞:-11.238809,没:-6.348365,萦:-13.189808,砮:-16.116548,咱:-8.721440,氶:-12.561200,怾:-17.215160,秃:-10.555866,呆:-8.829671,酈:-14.576103,淋:-11.060302,懓:-16.116548,嗛:-11.552200,雝:-17.215160,浠:-8.784179,諥:-17.215160,慨:-12.995652,续:-10.219394,啰:-11.598389,陲:-14.324788,封:-8.402168,餃:-12.561200,纂:-11.882441,倉:-10.333749,犊:-12.461570,脓:-11.524801,暒:-13.501588,媚:-11.627911,亢:-12.252315,认:-9.388717,鸭:-9.813929,儳:-13.526281,枼:-14.650211,穅:-15.423401,寄:-9.360779,铆:-13.430970,湍:-11.906892,俌:-10.982712,裎:-14.442571,糖:-9.040457,噝:-12.259333,鍟:-11.312527,擦:-9.266069,壮:-9.851880,闰:-12.146256,觸:-17.215160,馅:-12.103172,爈:-17.215160,事:-6.505889,昐:-15.828866,膕:-14.576103,娘:-8.928387,餚:-17.215160,疝:-13.088026,丠:-17.215160,财:-9.762178,榥:-17.215160,颯:-14.576103,甲:-8.752846,况:-11.309798,買:-7.953271,椺:-16.522013,肿:-10.256712,嵂:-14.037106,瓇:-17.215160,兊:-15.605722,豌:-15.828866,棏:-16.522013,联:-9.182151,峗:-15.828866,瑜:-9.793983,僟:-17.215160,桤:-13.088026,菩:-13.056277,屬:-14.650211,側:-16.522013,轶:-11.552200,毹:-16.116548,夅:-17.215160,鐇:-14.324788,瞆:-16.522013,徖:-17.215160,骘:-14.650211,瀟:-12.845712,厞:-15.828866,搧:-12.505630,芨:-12.938494,堯:-11.488312,霱:-17.215160,皰:-13.283334,謹:-10.466400,檸:-15.135719,廀:-17.215160,鷂:-12.630193,释:-10.498565,村:-8.191270,孙:-8.769893,陛:-11.548733,佡:-15.828866,詣:-12.760813,鳬:-17.215160,牳:-14.270721,嗲:-12.995652,郴:-12.682561,晻:-16.522013,蓼:-12.514680,礄:-15.423401,喇:-10.562297,洌:-12.347626,蚑:-13.263916,愔:-14.442571,鈞:-10.829966,抩:-17.215160,種:-17.215160,嚱:-16.522013,鎳:-13.749424,渶:-11.942160,螻:-15.135719,戾:-12.726524,齀:-17.215160,篃:-10.480568,濋:-12.178207,筘:-15.135719,埛:-12.938494,铝:-10.411655,潠:-16.522013,裥:-13.882956,捨:-16.522013,鑲:-11.416067,烵:-17.215160,衺:-17.215160,擽:-12.966665,币:-10.835038,鬃:-12.630193,粂:-12.561200,炊:-11.926893,茓:-13.501588,撒:-9.661873,眛:-16.116548,墚:-16.522013,閜:-16.522013,欣:-11.357227,覤:-16.116548,鰭:-10.908885,綬:-12.715350,匳:-17.215160,逵:-13.386519,熴:-13.088026,落:-8.135384,於:-5.642307,硅:-10.283688,姄:-13.501588,集:-8.487058,汍:-17.215160,諎:-14.037106,恕:-10.439794,狞:-14.730253,曦:-12.085261,祯:-13.025505,嫮:-15.828866,海:-8.037756,件:-8.438376,诸:-8.403657,耀:-11.216223,枅:-15.423401,谈:-8.403508,伊:-9.670828,預:-10.659803,羕:-15.423401,朚:-16.522013,亟:-12.011153,猢:-14.912575,媧:-11.022798,缪:-12.630193,临:-9.274220,犷:-15.269250,霺:-14.507110,娼:-12.302505,线:-8.267744,晄:-17.215160,談:-8.403508,牌:-9.149266,雏:-12.609990,姑:-9.786233,織:-11.669983,除:-7.515259,奦:-17.215160,緩:-9.706373,敮:-12.682561,煶:-11.083934,闹:-8.812705,壻:-17.215160,絾:-11.246452,樇:-16.116548,覆:-10.165038,瘏:-15.423401,閎:-11.968136,舗:-17.215160,踟:-16.116548,儡:-16.116548,騧:-17.215160,崩:-10.949859,粨:-12.600040,钸:-17.215160,垺:-15.828866,赉:-13.577574,濊:-11.957665,屓:-17.215160,蟚:-16.116548,瑣:-11.705772,鏢:-10.389700,囤:-12.370973,括:-11.153703,豳:-13.781173,併:-12.693371,滴:-9.918747,须:-8.110514,孽:-11.669983,竼:-16.522013,悁:-16.116548,沉:-9.433187,后:-5.480748,碑:-9.743797,怖:-12.749252,蒙:-9.198512,邡:-14.912575,砦:-13.263916,鲩:-11.627911,憫:-12.760813,涳:-12.079362,逶:-13.813963,唸:-15.605722,离:-8.031574,鰾:-16.116548,慀:-16.522013,浈:-14.576103,釋:-10.498565,勍:-17.215160,祐:-10.715373,鷓:-13.430970,廕:-15.828866,蕘:-17.215160,櫝:-12.266400,剢:-14.079666,盥:-14.037106,幪:-17.215160,苭:-16.116548,号:-6.509200,髽:-16.116548,忿:-11.251581,节:-8.734216,焋:-15.828866,躊:-15.269250,厌:-10.903425,紓:-12.109215,骒:-17.215160,褛:-15.828866,殜:-17.215160,锣:-11.233746,稽:-11.404019,岾:-14.912575,棆:-14.576103,鉍:-12.427668,坏:-8.776145,鹕:-13.659812,胖:-9.878874,潟:-12.171735,賞:-17.215160,几:-8.188743,筧:-13.244868,巨:-9.607282,蝯:-17.215160,槰:-14.730253,齿:-10.081864,舀:-11.631664,攚:-17.215160,焢:-17.215160,閥:-11.957665,墧:-14.381947,紪:-13.659812,撯:-14.730253,褲:-10.996560,炷:-12.152565,锺:-10.969053,堼:-16.522013,摄:-9.828070,裇:-11.764122,俉:-15.269250,灌:-9.781494,铏:-11.952470,寑:-15.423401,籔:-14.912575,柙:-13.688800,佞:-12.760813,珡:-16.116548,学:-7.446233,翩:-14.730253,杮:-16.522013,诱:-11.182074,仳:-16.116548,韹:-13.577574,嫻:-10.880106,罾:-14.037106,标:-9.628864,予:-10.241617,琏:-12.097166,耗:-10.814903,暘:-12.845712,谟:-11.170155,匡:-11.481819,頧:-13.749424,弩:-11.261917,纨:-10.988623,誰:-7.055404,眹:-14.730253,隸:-10.782220,懂:-8.921611,轉:-16.116548,剋:-14.912575,魑:-12.085261,幓:-11.165427,秒:-8.925872,橛:-13.263916,癣:-13.226176,哤:-17.215160,艫:-13.137623,惬:-14.576103,泴:-16.116548,驻:-8.383448,好:-5.779731,磼:-15.135719,抁:-15.423401,溉:-13.526281,嘎:-11.208807,窑:-9.975945,或:-5.938691,渞:-16.522013,垣:-11.602032,麩:-13.919323,澳:-10.696013,鈶:-15.828866,圸:-17.215160,箻:-14.650211,鸾:-11.693699,捀:-15.605722,潈:-13.189808,鏋:-10.901612,働:-17.215160,筐:-11.868053,峕:-17.215160,棝:-13.303137,鍠:-17.215160,偢:-13.813963,瓥:-13.688800,齨:-17.215160,屪:-15.423401,胭:-15.135719,桲:-15.605722,凷:-17.215160,瑺:-16.522013,飽:-9.845559,巿:-12.911095,會:-5.784628,貊:-14.219428,册:-10.062891,缓:-9.706373,嶔:-15.828866,講:-13.813963,榜:-9.671887,霣:-15.135719,吥:-15.605722,疤:-11.887284,怭:-16.522013,氵:-14.124118,趴:-11.545279,砽:-12.650812,庾:-13.040773,葅:-17.215160,櫆:-14.507110,遍:-9.543333,問:-16.116548,盎:-11.844522,慗:-17.215160,苖:-16.522013,叠:-10.397329,祧:-12.324811,髦:-11.764122,忨:-17.215160,酷:-11.191712,噹:-12.505630,矸:-13.283334,瞍:-16.116548,鰐:-15.017935,弒:-12.347626,箕:-11.320757,挚:-12.184722,眢:-14.912575,座:-8.039204,笪:-13.226176,皷:-14.730253,帼:-17.215160,窿:-15.269250,癌:-10.782220,鋏:-14.912575,巑:-17.215160,懙:-14.576103,蹜:-17.215160,鉤:-9.907287,嵦:-15.828866,秩:-11.386214,慮:-17.215160,當:-15.828866,釹:-13.604242,峻:-11.494848,祾:-14.730253,趆:-14.817265,醎:-15.828866,岐:-12.630193,蘗:-15.605722,悘:-15.828866,訟:-11.620449,唡:-17.215160,璠:-13.718652,天:-6.724469,洱:-14.219428,貰:-17.215160,侲:-16.116548,焹:-16.522013,邸:-11.404019,厺:-15.828866,蕁:-12.871355,襉:-13.882956,呋:-13.207827,毊:-12.640449,鵑:-10.976835,塓:-16.522013,習:-10.111838,汛:-12.704301,菚:-17.215160,仜:-15.269250,灣:-17.215160,勤:-10.698967,葫:-16.116548,鯪:-12.570769,曬:-9.925550,彽:-16.116548,综:-11.669983,茄:-11.994804,梉:-15.423401,粑:-9.907958,搖:-17.215160,肙:-14.576103,钡:-11.149052,冣:-15.828866,簦:-13.010467,颩:-17.215160,斫:-11.968136,榳:-16.522013,儸:-16.522013,綻:-11.135227,敀:-16.522013,臃:-13.104286,闋:-17.215160,囍:-17.215160,結:-8.982720,腘:-14.576103,镠:-12.487772,噢:-10.513200,饨:-12.682561,婪:-14.079666,蛭:-11.887284,湲:-15.423401,執:-15.605722,牺:-13.604242,黽:-12.650812,寿:-10.500990,愃:-16.522013,蚂:-12.324811,甋:-17.215160,誊:-13.154717,垌:-17.215160,礓:-15.828866,麒:-11.576805,宔:-15.269250,贛:-10.668375,丝:-9.275288,澜:-11.307077,鄣:-12.402976,別:-7.658963,昭:-10.425063,樵:-11.555678,讴:-14.730253,咶:-16.522013,總:-7.146794,墾:-11.646816,佇:-15.135719,泆:-17.215160,降:-8.513315,协:-10.835038,烎:-17.215160,驕:-11.734521,蓖:-13.040773,歟:-12.121410,姨:-11.377430,药:-8.178697,靷:-17.215160,計:-17.215160,疍:-13.072025,崒:-14.576103,禕:-11.246452,愚:-10.974884,產:-8.384909,岧:-15.135719,礪:-12.470228,悯:-12.760813,贲:-12.897672,璷:-17.215160,鄺:-13.631641,尼:-9.271023,恄:-16.522013,資:-9.838026,郏:-12.630193,忑:-15.828866,硔:-16.116548,矡:-15.269250,彦:-10.585797,篩:-11.413042,据:-7.341668,睶:-14.124118,鏹:-15.017935,签:-10.146988,氇:-16.522013,辆:-9.372489,瀏:-13.386519,鎎:-16.116548,庐:-11.478588,折:-8.823530,蠟:-11.016681,皠:-14.037106,嬩:-10.719894,窨:-13.154717,漱:-12.339963,猹:-17.215160,旂:-12.044676,證:-15.135719,槊:-12.726524,齑:-13.688800,緒:-12.067666,湛:-13.072025,臚:-9.754095,牣:-17.215160,闢:-9.814539,僤:-17.215160,虫:-9.186379,擬:-17.215160,詳:-10.296465,棴:-14.817265,嵽:-16.116548,暁:-15.269250,丆:-16.522013,檉:-14.817265,锌:-9.805418,刎:-14.037106,昖:-14.170638,芙:-9.410093,供:-8.211106,樞:-10.742814,厣:-12.808441,縦:-15.135719,枫:-11.821532,估:-11.274989,殳:-13.343959,阶:-10.002866,騾:-11.380349,杀:-7.442237,菃:-14.507110,韋:-10.493734,响:-8.631056,罐:-10.616651,壕:-11.196567,荘:-17.215160,泝:-16.116548,靠:-8.129363,呢:-6.953194,烥:-17.215160,魨:-13.207827,汲:-12.452986,嗷:-12.419369,灺:-17.215160,鳽:-17.215160,姿:-11.468957,蒂:-11.077433,看:-6.108085,袊:-16.522013,喌:-13.172109,笓:-14.381947,鲒:-15.605722,輛:-17.215160,涜:-12.091196,倥:-14.912575,搭:-9.173747,栵:-12.347626,嚶:-11.613041,簽:-15.423401,鶼:-13.847864,媾:-13.408498,滆:-10.867771,鑍:-15.135719,兏:-13.604242,狎:-13.040773,敗:-9.137713,蛖:-14.507110,楟:-16.522013,諞:-11.315263,埠:-11.994804,絧:-16.116548,寨:-8.882130,乱:-8.187661,濰:-13.501588,長:-6.611525,剹:-16.116548,饿:-9.643172,蠀:-15.017935,澅:-17.215160,箍:-10.990602,逐:-10.335804,漚:-12.650812,莝:-16.522013,笢:-11.410025,劧:-10.841840,溯:-11.462587,茲:-10.984679,刼:-15.828866,皿:-13.882956,湄:-13.957064,苇:-12.386846,穌:-13.365012,黏:-12.178207,凑:-9.973794,癔:-15.828866,淙:-12.470228,鹤:-10.374614,兦:-17.215160,浮:-9.975227,祶:-17.215160,鷹:-10.258615,僻:-11.431335,畾:-12.427668,戇:-14.324788,膆:-16.522013,傐:-16.522013,託:-16.116548,沘:-16.116548,鈧:-12.600040,璨:-14.324788,愱:-15.135719,紹:-11.135227,鲸:-11.158376,徺:-15.828866,襁:-17.215160,毂:-12.820711,蕉:-11.722099,塋:-14.730253,柊:-12.309885,呓:-13.749424,珒:-13.501588,恛:-15.828866,籣:-17.215160,鯢:-17.215160,廤:-17.215160,衫:-10.516892,韪:-12.820711,櫬:-13.688800,葳:-15.605722,更:-6.273554,狼:-9.321961,梁:-9.583728,鬌:-17.215160,導:-16.522013,炑:-17.215160,栖:-10.687202,搞:-8.177508,颡:-14.381947,瀦:-13.847864,钩:-9.907287,榫:-12.427668,谮:-14.219428,崸:-14.170638,熻:-11.413042,鐾:-13.365012,楀:-10.867771,跃:-9.295804,仅:-7.806543,效:-10.518126,嫍:-12.245347,煐:-17.215160,闓:-12.682561,赘:-12.121410,拝:-16.522013,婢:-10.961331,绥:-11.863302,镨:-15.269250,噪:-12.287906,諭:-10.358698,俯:-10.918051,寷:-13.688800,鋽:-15.605722,洃:-14.507110,侄:-10.316446,礋:-13.526281,蚊:-11.528185,完:-7.739230,甓:-13.919323,銒:-17.215160,垔:-16.116548,脛:-12.280686,鴣:-13.386519,帥:-10.536818,群:-8.122365,讬:-16.116548,昵:-12.858451,墶:-16.116548,爽:-10.769440,鎼:-12.204525,咾:-16.116548,蹅:-16.522013,惆:-13.996284,驍:-16.116548,陕:-10.777408,束:-10.334776,蓞:-17.215160,姠:-14.650211,郦:-14.576103,嗨:-11.307077,软:-8.990997,魷:-12.191280,屹:-13.847864,緸:-14.270721,靿:-15.135719,言:-8.036207,涅:-10.739727,禍:-10.136818,鈐:-12.115294,儒:-10.796795,洚:-17.215160,膝:-10.403916,鶥:-14.576103,傧:-14.270721,甪:-15.423401,脲:-13.088026,值:-8.628254,璿:-15.135719,硌:-12.079362,鳏:-14.442571,发:-7.483648,瑔:-16.116548,濙:-13.025505,篡:-12.109215,鱤:-16.116548,卦:-10.216650,矩:-11.978718,潮:-9.809664,菱:-11.160721,筶:-12.871355,勻:-11.167788,睾:-12.419369,怇:-17.215160,莆:-12.097166,簏:-15.269250,龎:-16.522013,伙:-10.046580,溘:-15.423401,嬡:-13.882956,窠:-12.478962,逧:-16.522013,圩:-11.921855,皨:-11.957665,芰:-11.587539,麸:-13.919323,嶺:-9.140511,乃:-8.717150,槂:-17.215160,蝉:-10.932893,鍑:-9.748361,噓:-11.730363,燒:-17.215160,扛:-10.461722,跚:-14.124118,駢:-12.280686,峤:-13.244868,詫:-12.238426,闪:-9.240627,棬:-12.590187,擴:-9.650922,鉻:-14.730253,兽:-9.591029,烼:-15.828866,檁:-17.215160,贄:-13.957064,暉:-12.238426,餌:-10.691598,帎:-15.017935,锔:-13.813963,昞:-12.952480,骡:-11.380349,隩:-17.215160,殫:-14.381947,踮:-12.858451,枳:-13.526281,騶:-14.381947,弸:-13.781173,玻:-11.282915,歀:-15.828866,杈:-10.023731,壍:-14.817265,獐:-12.115294,韓:-17.215160,哕:-12.820711,轘:-14.817265,惝:-15.828866,塢:-11.345863,靨:-17.215160,呪:-15.017935,恲:-14.650211,姷:-14.576103,都:-4.995283,嗿:-17.215160,袂:-13.244868,笋:-12.158914,妌:-17.215160,眓:-16.522013,喔:-12.436037,茛:-15.605722,憜:-13.088026,尥:-13.813963,栭:-12.109215,覬:-14.912575,亮:-8.847163,搵:-17.215160,媶:-16.522013,瀽:-15.135719,醼:-13.882956,拆:-9.742659,額:-9.405619,嵏:-14.730253,绎:-13.430970,鑕:-15.423401,楗:-12.370973,論:-8.308902,俘:-9.409685,敟:-14.507110,蛞:-13.207827,寠:-16.522013,照:-8.682881,鋦:-13.813963,埨:-17.215160,揰:-17.215160,饷:-10.881880,幹:-7.321167,长:-6.611525,谀:-12.238426,伂:-17.215160,羍:-13.283334,鐐:-12.444475,園:-14.912575,玕:-13.957064,亗:-16.522013,缢:-12.427668,嚧:-13.718652,猪:-9.173425,丬:-16.116548,檯:-13.453960,纷:-11.456258,嘼:-16.522013,橄:-13.847864,蛇:-9.419514,繌:-14.576103,髏:-13.847864,嗑:-12.808441,槙:-15.423401,虜:-10.306405,緡:-12.704301,驤:-14.381947,啦:-8.015780,楮:-14.324788,絶:-16.522013,駹:-14.576103,哻:-15.269250,煾:-16.522013,昇:-11.844522,稏:-17.215160,咐:-13.408498,梘:-14.381947,舟:-10.322518,崡:-12.981054,粠:-11.386214,攱:-14.442571,赁:-12.784343,濂:-10.044272,腉:-14.170638,屋:-9.288919,镑:-9.270668,偓:-13.659812,摛:-17.215160,诚:-10.591095,嫤:-13.025505,豫:-10.405018,佭:-17.215160,滬:-17.215160,聳:-10.876566,拴:-10.697489,鑻:-10.951762,盼:-9.782085,沁:-11.410025,謄:-13.154717,悉:-10.638690,堎:-16.116548,氖:-10.927301,怞:-16.116548,鲡:-16.116548,妣:-15.423401,琦:-12.671865,邩:-13.263916,涫:-13.040773,憳:-11.751328,鰶:-15.828866,夸:-10.446667,逾:-10.570069,慈:-10.682826,鷋:-16.116548,動:-7.780956,曝:-12.966665,鵠:-11.764122,幢:-11.062427,童:-9.716844,剪:-9.836776,忷:-16.522013,空:-8.296510,叿:-13.551598,椃:-14.079666,躂:-13.137623,紋:-9.686291,芊:-12.704301,後:-10.117611,焓:-12.845712,厔:-12.966665,蔛:-13.551598,果:-8.807335,娥:-9.810881,箤:-14.079666,渭:-11.897040,辬:-16.522013,戵:-17.215160,莴:-16.522013,岶:-16.116548,瘽:-11.395077,傾:-9.647814,詅:-16.116548,鹍:-16.522013,鉕:-17.215160,潗:-12.561200,损:-10.287602,胞:-11.105912,铦:-14.576103,凨:-16.522013,譯:-17.215160,旰:-13.882956,齷:-17.215160,塹:-17.215160,秸:-12.600040,鍿:-14.124118,榅:-16.116548,興:-8.850186,綍:-12.620040,阐:-12.461570,椚:-15.828866,索:-9.905948,馥:-13.996284,咧:-10.710872,焪:-14.730253,梯:-10.649895,蔲:-17.215160,粷:-12.966665,餺:-17.215160,吼:-10.233225,炿:-17.215160,俁:-12.280686,桄:-16.522013,籌:-10.504637,飏:-13.957064,埑:-14.730253,灔:-16.116548,佖:-16.522013,毙:-10.982712,葜:-14.730253,翡:-14.170638,坦:-10.406121,珩:-11.627911,仫:-17.215160,獾:-10.766271,亀:-15.828866,搇:-15.423401,鮎:-12.259333,谗:-12.533029,檘:-16.116548,弡:-13.718652,纠:-11.475367,鐧:-11.434417,犨:-16.116548,朱:-8.329719,蚰:-13.477490,骸:-11.360088,妺:-16.116548,淂:-17.215160,草:-8.529237,幋:-17.215160,懊:-12.845712,靑:-17.215160,痒:-10.766271,晛:-16.116548,觚:-13.430970,壤:-11.602032,蹫:-16.522013,釪:-14.730253,泬:-16.522013,艳:-10.600434,惴:-12.715350,抉:-14.079666,皑:-14.817265,鄔:-11.511378,渖:-13.526281,戞:-11.041374,宣:-10.053538,瘦:-9.708019,掳:-11.079595,鸶:-13.996284,嬸:-9.951130,瞻:-11.099268,鈾:-10.623486,潀:-17.215160,诃:-11.937045,捈:-17.215160,峍:-16.522013,睐:-14.507110,僕:-10.180772,識:-9.280288,擝:-15.423401,齠:-12.682561,屢:-10.165905,磥:-14.219428,鍨:-13.749424,偪:-15.828866,賭:-10.231370,摲:-16.522013,胵:-15.017935,巷:-10.850409,铽:-15.605722,凿:-10.296465,欃:-17.215160,貂:-11.251581,缋:-13.453960,猓:-11.849184,钒:-11.112601,蜛:-16.522013,斜:-9.262897,鬣:-13.025505,堥:-11.892150,氭:-11.395077,怵:-12.533029,膴:-16.522013,庶:-10.761535,閼:-13.501588,劾:-11.921855,衅:-11.989413,曆:-15.135719,奏:-8.912646,違:-11.041374,浗:-11.872826,慟:-11.994804,苞:-11.531580,忠:-9.532678,畧:-13.718652,叨:-11.830665,襯:-11.309798,柰:-14.730253,酿:-11.989413,退:-8.322274,匂:-16.116548,瞅:-9.874973,鰈:-13.365012,弊:-10.905242,掍:-12.245347,蠐:-13.025505,眚:-15.135719,鮝:-16.522013,废:-9.336247,挢:-14.324788,漪:-13.604242,刬:-16.522013,皯:-11.931956,鬲:-13.244868,帴:-12.273518,蜺:-16.522013,溿:-12.995652,巉:-14.507110,扌:-14.170638,蛏:-12.533029,湔:-13.996284,兖:-12.402976,痙:-12.590187,懡:-11.508050,駱:-11.669983,慶:-9.483668,藹:-12.427668,傀:-14.912575,稇:-17.215160,馆:-9.602329,岈:-15.269250,昏:-10.475823,唙:-16.116548,璘:-11.277624,鸟:-9.192919,悠:-12.402976,訧:-17.215160,沨:-15.828866,礱:-12.590187,宲:-17.215160,改:-8.078897,蒸:-9.925550,酁:-17.215160,呃:-12.073496,珂:-10.265304,翊:-12.760813,襑:-17.215160,毒:-8.835621,嫜:-14.817265,迪:-11.241350,卭:-17.215160,独:-9.256933,彵:-16.522013,维:-9.785639,炁:-16.522013,霄:-12.952480,堆:-9.403187,粉:-9.452564,茌:-14.912575,梑:-14.912575,輔:-10.273003,钙:-10.174624,簞:-14.507110,股:-8.168162,栦:-11.174905,販:-17.215160,鐮:-11.957665,耶:-10.206655,榻:-10.694539,煀:-15.828866,闃:-13.072025,絈:-15.423401,楐:-15.828866,仕:-11.079595,镘:-15.828866,噚:-17.215160,竝:-16.522013,腠:-14.576103,曥:-17.215160,乪:-13.526281,黵:-16.116548,智:-9.095761,俿:-17.215160,甃:-16.522013,垄:-12.217948,洓:-12.073496,誒:-13.551598,侔:-13.477490,餛:-12.704301,蔣:-10.290548,枤:-17.215160,爭:-8.961672,鎬:-10.497355,咮:-17.215160,縵:-13.072025,樽:-12.820711,讼:-11.620449,际:-10.184303,艍:-16.522013,擎:-12.027774,蹕:-12.966665,獗:-12.884427,嗘:-10.642877,罟:-13.781173,鳞:-9.951830,歧:-12.355348,称:-7.038787,荷:-9.780312,旸:-12.845712,轿:-9.408057,鈀:-11.272361,儂:-16.116548,崊:-15.423401,憍:-15.828866,訐:-13.957064,涕:-12.737823,傗:-10.152968,甚:-7.733648,愢:-16.116548,薥:-16.522013,洪:-9.690599,倬:-14.324788,尴:-12.871355,悷:-15.017935,蔺:-14.219428,沿:-9.096655,叁:-13.882956,瑄:-13.688800,飇:-17.215160,蓏:-16.116548,汔:-15.605722,卖:-8.282155,矙:-14.324788,彞:-13.813963,握:-9.488506,濩:-14.730253,勫:-9.818211,睮:-14.912575,廳:-8.885261,捶:-10.905242,蟹:-10.528051,潾:-17.215160,砇:-12.981054,鮆:-17.215160,搏:-11.077433,逗:-11.165427,皘:-14.270721,鰟:-14.507110,抠:-11.485060,伩:-13.919323,笱:-12.671865,骰:-12.640449,妲:-14.124118,朹:-17.215160,鍁:-12.561200,燂:-11.863302,齉:-16.522013,緊:-8.571863,乓:-12.452986,槒:-14.324788,闚:-17.215160,壜:-16.116548,晣:-13.718652,臢:-14.507110,跪:-9.064404,六:-8.180126,烬:-13.847864,鹳:-13.453960,嵵:-15.269250,糴:-17.215160,棼:-15.605722,犁:-10.965185,锄:-11.475367,娆:-11.241350,脌:-16.116548,檑:-17.215160,贔:-13.957064,隙:-11.075275,宛:-11.730363,縞:-12.386846,芡:-12.884427,玫:-11.075275,阮:-11.165427,嬰:-10.955579,羳:-16.522013,舶:-12.650812,殻:-16.116548,韃:-10.212095,菋:-16.522013,歐:-9.458109,迓:-13.477490,磝:-15.828866,荠:-14.324788,轨:-10.970993,郭:-9.108043,嗯:-9.513056,摺:-11.677826,邂:-16.522013,善:-8.543530,挋:-14.817265,鲊:-15.828866,漓:-12.204525,袒:-12.833133,鬛:-17.215160,堝:-10.057425,蜣:-16.522013,斤:-10.616651,瀭:-16.116548,醬:-10.669810,嚮:-12.496661,簵:-13.813963,鶴:-10.896192,栽:-10.480568,亾:-10.986649,鑅:-14.219428,奇:-8.750735,竆:-14.650211,聍:-16.522013,曎:-16.522013,豕:-13.263916,煗:-17.215160,埘:-13.847864,點:-15.135719,諦:-11.431335,俨:-12.302505,镯:-12.924701,腷:-14.730253,柸:-16.522013,須:-15.605722,谐:-11.066692,伒:-13.501588,殕:-14.507110,嚗:-16.522013,猚:-15.269250,媟:-17.215160,产:-8.384909,嘬:-12.938494,犯:-8.987785,鼲:-16.522013,娴:-10.880106,茺:-15.605722,檿:-14.650211,嗁:-17.215160,姉:-12.452986,晌:-11.594759,苏:-8.954409,橔:-16.116548,啖:-13.263916,燙:-10.283688,鹜:-13.526281,旡:-16.522013,艤:-15.269250,槩:-16.522013,煮:-9.488506,壳:-9.575999,咀:-10.473459,戏:-9.192919,阗:-12.995652,儙:-15.135719,騟:-15.269250,梨:-10.203045,紱:-13.659812,鲰:-16.522013,愹:-17.215160,肸:-16.116548,镁:-10.838433,偃:-12.044676,饉:-12.897672,赑:-13.957064,濒:-11.419102,籛:-15.423401,廜:-17.215160,恣:-12.640449,蟢:-13.323340,鑫:-12.266400,坭:-14.079666,盬:-16.116548,顳:-13.088026,孵:-12.224727,竴:-9.192919,佽:-11.041374,璁:-10.175500,錄:-9.701451,将:-5.500887,碉:-12.324811,沑:-16.116548,謔:-11.627911,邙:-13.996284,嶛:-14.650211,蒡:-17.215160,氦:-11.343042,疫:-12.411139,逮:-10.921741,崰:-13.813963,禳:-12.981054,畀:-14.037106,釃:-16.116548,勅:-15.828866,祈:-12.171735,藋:-13.718652,浐:-11.738696,剚:-15.423401,绝:-8.739831,拥:-9.493368,襨:-15.605722,可:-5.744182,繲:-14.817265,扺:-15.828866,焃:-15.135719,厄:-10.688665,骊:-12.682561,椓:-14.381947,躒:-14.079666,鴛:-12.897672,帝:-8.984050,掤:-15.828866,鞬:-14.576103,鉅:-13.343959,彇:-12.551721,惎:-16.116548,評:-10.035090,睗:-17.215160,铖:-13.781173,凘:-16.522013,筟:-13.154717,飞:-8.049503,潧:-12.911095,賦:-9.998451,山:-7.148746,緰:-11.844522,蝷:-17.215160,懸:-9.682536,阀:-11.957665,唂:-17.215160,騈:-17.215160,夊:-10.150401,踐:-11.177289,榕:-13.207827,咗:-17.215160,焚:-10.845259,墟:-11.256735,攢:-11.022798,膥:-11.389160,椪:-17.215160,听:-6.483645,炯:-10.828281,場:-16.522013,撷:-14.079666,梿:-14.381947,埁:-14.442571,灄:-13.263916,鳇:-15.269250,寉:-17.215160,摌:-17.215160,俑:-11.643006,桔:-12.266400,珙:-14.507110,孞:-15.423401,柡:-17.215160,聤:-14.576103,囫:-16.522013,獮:-17.215160,嫳:-11.624173,菹:-14.124118,任:-7.484182,嚀:-13.189808,簇:-11.238809,龆:-12.682561,怏:-14.912575,莎:-10.691598,亐:-17.215160,鐗:-10.130934,匙:-11.989413,暠:-13.577574,谧:-13.040773,缱:-11.887284,嶲:-16.522013,挹:-14.170638,芸:-11.290904,剃:-10.927301,痂:-13.263916,魉:-13.244868,轑:-16.522013,淒:-16.522013,繛:-11.957665,釚:-16.522013,峜:-16.116548,扣:-9.891989,啭:-14.079666,驳:-11.158376,磴:-11.081762,蹻:-13.847864,泼:-10.387531,皁:-16.522013,鄄:-12.378878,帆:-10.925444,蔌:-17.215160,溑:-17.215160,褔:-17.215160,瘖:-14.650211,銙:-15.828866,稞:-16.116548,蚡:-12.884427,渦:-11.872826,鈮:-12.302505,弰:-13.996284,訾:-14.576103,着:-5.067861,鏃:-9.800587,僅:-16.522013,筈:-16.116548,蟋:-14.817265,潐:-17.215160,诓:-12.204525,鍘:-11.962887,做:-6.388784,糝:-17.215160,蝠:-12.737823,惥:-14.576103,铭:-11.437508,凯:-11.315263,籲:-16.116548,恺:-12.211214,賽:-9.283875,猃:-15.605722,钂:-13.453960,朋:-11.587539,颊:-10.605811,欓:-11.747100,貒:-16.522013,尝:-10.048894,綜:-11.669983,憤:-11.006570,琭:-17.215160,閬:-10.599095,砵:-16.522013,馴:-11.901954,氽:-11.646816,趼:-14.270721,遅:-17.215160,嵇:-14.381947,细:-8.828531,拎:-10.899802,衕:-15.828866,雖:-7.644491,变:-7.812465,祟:-13.323340,髞:-12.995652,酯:-11.139814,翰:-11.906892,蕷:-16.522013,揸:-15.135719,西:-7.399193,羅:-8.990997,鐈:-17.215160,圊:-16.522013,殍:-17.215160,耐:-10.056646,枕:-10.447817,缚:-10.195863,鎝:-13.453960,嚟:-13.526281,欢:-10.075500,未:-7.485847,纯:-9.442407,録:-16.522013,嘴:-8.412187,檷:-14.037106,暿:-16.116548,姁:-14.912575,繄:-15.605722,鋇:-11.149052,嗉:-13.604242,橌:-17.215160,軏:-14.576103,晔:-13.323340,奖:-9.168931,緙:-11.799060,啞:-10.755256,槡:-17.215160,早:-7.638165,士:-9.419925,絮:-11.709829,釱:-15.135719,哳:-14.324788,跹:-13.430970,敾:-12.911095,墀:-14.576103,爇:-16.522013,醆:-17.215160,咈:-17.215160,趎:-14.381947,騗:-12.139986,崙:-15.269250,粘:-9.999920,队:-7.743841,梠:-16.522013,焱:-13.154717,邰:-14.270721,厲:-16.116548,洹:-12.097166,貸:-10.552027,饁:-17.215160,屃:-14.817265,篂:-16.522013,镉:-11.812483,矊:-14.650211,腑:-10.867771,插:-8.936478,灛:-16.116548,询:-11.785814,令:-8.049294,顫:-9.789802,蟪:-13.526281,孭:-15.605722,鑳:-10.603119,坵:-15.605722,直:-7.539326,拼:-10.207559,碁:-12.726524,倆:-9.387919,璉:-17.215160,謌:-17.215160,悑:-15.828866,砖:-9.626836,鲙:-16.522013,军:-7.004188,怦:-13.088026,蒩:-16.522013,鰮:-14.507110,儰:-15.423401,疳:-14.730253,蠶:-11.264517,憻:-16.522013,祀:-9.978821,鷃:-16.522013,畈:-13.882956,觋:-14.730253,藓:-12.103172,鵘:-17.215160,狝:-14.817265,襠:-12.650812,滥:-11.079595,蕨:-11.916843,髭:-13.207827,忯:-17.215160,牲:-12.295179,湺:-17.215160,苽:-16.116548,骂:-8.354803,径:-9.735860,椋:-11.189294,隊:-7.743841,芒:-10.721406,鄛:-17.215160,初:-7.663218,玜:-17.215160,责:-10.167643,严:-9.355361,澤:-10.745910,瘵:-16.522013,鞴:-13.025505,戽:-15.828866,莼:-13.453960,鹅:-10.661227,升:-8.736084,住:-6.919326,處:-7.089850,飖:-15.017935,巘:-17.215160,铞:-15.828866,捧:-9.235821,胦:-17.215160,偱:-16.522013,護:-17.215160,淸:-14.442571,夂:-13.244868,綅:-12.820711,阈:-12.650812,唊:-17.215160,榍:-14.507110,舐:-12.184722,斕:-11.790210,増:-16.116548,級:-8.019629,攪:-10.459391,堬:-11.781438,粯:-13.040773,鄲:-14.442571,吴:-8.264757,梷:-13.501588,贺:-9.832414,撿:-10.179891,郇:-15.017935,埉:-15.135719,桌:-10.341996,摔:-9.415407,孖:-15.423401,翙:-17.215160,遜:-11.123850,坞:-11.345863,毡:-10.986649,柩:-12.011153,嫫:-13.882956,置:-7.896414,鏱:-16.522013,図:-17.215160,迹:-10.852132,松:-8.995026,嚈:-13.847864,氏:-9.361944,辎:-14.576103,頗:-8.610689,弙:-17.215160,纘:-12.317320,鐟:-14.817265,檠:-14.270721,耧:-14.079666,暨:-11.079595,猱:-13.025505,冲:-8.178935,魁:-11.323516,幃:-13.408498,靉:-12.370973,痊:-12.505630,荑:-14.079666,懒:-10.826599,牛:-8.460684,鷚:-13.551598,僜:-15.269250,湣:-14.170638,觢:-17.215160,驫:-14.650211,藪:-12.911095,奭:-12.726524,磬:-12.884427,陳:-8.581785,啵:-12.266400,瓴:-14.324788,艻:-17.215160,惼:-17.215160,突:-9.634460,分:-6.761818,褌:-15.135719,与:-5.226100,抑:-11.088291,蔔:-11.646816,厛:-11.947302,瘞:-15.828866,誡:-11.968136,侣:-12.280686,戦:-12.184722,蚩:-12.871355,箫:-11.312527,鸮:-12.966665,瞳:-12.259333,訶:-17.215160,伸:-9.078642,峅:-15.605722,诋:-13.957064,捐:-10.299437,烝:-15.135719,泥:-8.836310,蝨:-14.507110,飭:-11.807988,巯:-14.507110,铵:-12.897672,決:-8.783743,能:-5.773774,缃:-11.868053,颂:-10.814903,嶄:-10.710872,欋:-16.116548,钊:-11.453109,朓:-14.507110,錛:-7.773311,倝:-12.981054,熜:-11.362958,輣:-13.688800,涤:-12.427668,砭:-13.365012,馬:-7.315781,琵:-12.704301,閴:-15.269250,兇:-9.792189,衍:-11.616738,滎:-13.408498,祗:-12.911095,髖:-13.813963,忘:-8.706604,雞:-8.977945,慧:-10.866021,苦:-8.739623,鵯:-14.730253,剱:-17.215160,珰:-10.955579,乹:-16.522013,濸:-16.522013,异:-9.067582,箅:-14.507110,澍:-14.381947,萐:-11.039293,掕:-12.858451,店:-9.078642,笚:-15.017935,功:-8.577343,漢:-8.118997,讥:-12.302505,挪:-10.681371,帬:-15.269250,窯:-9.975945,露:-9.269959,溷:-14.817265,抿:-11.249013,穄:-15.017935,雇:-10.718385,凉:-9.823745,湌:-17.215160,諏:-13.040773,扔:-9.484546,嵖:-15.828866,秙:-14.037106,陜:-17.215160,兞:-17.215160,淡:-9.935152,峫:-15.605722,闱:-13.056277,僳:-16.116548,慾:-15.269250,岀:-10.126751,瘇:-13.718652,閆:-12.640449,傈:-14.576103,樏:-16.116548,夙:-12.924701,碘:-10.919894,沠:-17.215160,蘧:-15.017935,您:-7.617043,由:-5.948097,钰:-14.270721,椹:-11.591143,翂:-11.576805,酉:-11.926893,珊:-9.669770,柒:-16.522013,瑛:-11.216223,档:-9.596909,迢:-15.135719,菪:-13.365012,彭:-10.277846,卵:-9.871734,狴:-16.116548,曼:-10.678468,吆:-12.152565,炉:-9.848083,撑:-9.966656,茔:-14.730253,簖:-16.116548,颙:-13.688800,喛:-16.522013,財:-15.605722,搦:-12.295179,肩:-9.667658,唰:-12.044676,熳:-13.919323,谶:-11.853868,斻:-13.408498,絀:-11.591143,駃:-16.522013,嫅:-16.116548,煈:-17.215160,跋:-11.472157,仍:-7.382793,婚:-9.228655,盝:-15.605722,赠:-10.774214,乢:-15.423401,櫥:-11.246452,寯:-15.605722,癲:-12.845712,麂:-12.833133,宄:-12.784343,洋:-9.816374,銊:-16.522013,侌:-16.522013,蚒:-17.215160,锛:-7.773311,殤:-16.522013,墮:-10.674130,爵:-10.853858,鎴:-9.557405,螼:-15.269250,驅:-10.452431,均:-7.273606,蹍:-17.215160,罗:-8.990997,鳖:-11.039293,姘:-10.949859,獟:-17.215160,郞:-16.522013,杧:-14.381947,蓦:-13.303137,魯:-9.841158,呱:-12.820711,痰:-10.413877,槸:-9.008031,崂:-12.280686,禅:-10.448968,鈈:-14.817265,儊:-14.576103,岗:-8.607578,傟:-17.215160,覥:-17.215160,愪:-11.392114,尬:-14.124118,锲:-13.847864,倴:-16.116548,沷:-17.215160,悿:-16.116548,忁:-16.116548,铇:-16.522013,叉:-9.973078,裏:-10.718385,恔:-16.116548,彖:-14.170638,篙:-12.620040,鑜:-13.408498,卞:-10.082662,濡:-10.910711,衤:-14.324788,揩:-11.033075,筮:-13.453960,勳:-10.940398,潶:-13.957064,诹:-13.040773,庀:-12.542331,琇:-13.283334,劈:-9.907287,栏:-10.616651,讎:-12.444475,嬙:-13.882956,窘:-11.952470,速:-9.584213,伡:-14.381947,萧:-10.419454,抨:-15.269250,眱:-17.215160,隰:-13.386519,喲:-10.013989,欹:-13.919323,齁:-15.135719,婃:-11.189294,鍉:-16.116548,之:-5.358950,燊:-14.442571,旒:-13.551598,哜:-14.650211,鹫:-12.091196,自:-6.806302,兵:-7.499509,烴:-11.785814,虻:-11.785814,擼:-11.947302,餄:-16.522013,嘆:-8.885743,犉:-17.215160,贌:-16.522013,暑:-12.266400,脔:-14.912575,縖:-15.269250,骙:-13.365012,垛:-11.669983,爞:-13.631641,躡:-14.817265,芩:-13.453960,騮:-14.170638,地:-5.228855,玳:-13.919323,枻:-15.828866,舾:-13.386519,壅:-12.630193,獈:-14.270721,迋:-16.116548,材:-10.445518,菓:-14.730253,魘:-12.394878,塚:-11.004560,轠:-14.576103,棥:-15.423401,荨:-12.871355,姯:-16.522013,瑲:-17.215160,郵:-11.218708,桺:-14.730253,蓽:-15.135719,笃:-10.905242,鲂:-12.514680,妄:-10.963256,邊:-17.215160,挓:-14.442571,吝:-13.996284,榤:-15.828866,簭:-14.124118,瀵:-10.608510,醴:-12.952480,亶:-12.845712,搽:-12.217948,顅:-12.911095,啇:-17.215160,盆:-10.245369,櫎:-13.154717,寘:-13.244868,煟:-16.116548,俠:-10.326588,敧:-15.017935,饯:-14.219428,噱:-14.576103,矰:-17.215160,起:-6.235238,腿:-8.670546,挂:-8.412337,邋:-15.423401,漊:-15.269250,厍:-12.171735,徕:-14.507110,抗:-9.076011,萘:-12.693371,溟:-13.919323,造:-9.188990,鰨:-17.215160,弪:-16.522013,戬:-15.605722,辵:-17.215160,渴:-10.988623,稼:-12.784343,荂:-17.215160,淉:-15.828866,剌:-10.346146,科:-8.347592,幔:-12.011153,苗:-10.117611,軟:-8.990997,浞:-12.737823,凡:-8.614913,祦:-13.040773,巩:-12.073496,惫:-13.056277,泳:-12.347626,蹴:-12.911095,其:-6.040200,磻:-17.215160,驼:-10.359751,嵾:-16.522013,悀:-15.135719,蜅:-17.215160,沈:-10.001392,錍:-17.215160,嘏:-13.781173,攙:-11.301657,無:-6.565435,紩:-13.477490,殲:-10.597757,鈷:-10.848690,唹:-14.381947,瞺:-15.017935,鸿:-9.412951,胀:-10.630369,摃:-17.215160,賈:-9.665025,灋:-17.215160,俊:-9.963106,飐:-16.116548,籓:-15.269250,寒:-9.608773,蕙:-12.938494,酡:-14.507110,呣:-15.828866,盤:-8.960371,鵩:-15.828866,捭:-17.215160,诲:-10.715373,潵:-10.270109,仴:-13.688800,筽:-11.407018,嫼:-16.522013,鞏:-16.522013,琎:-13.189808,墑:-15.605722,榛:-11.713902,疣:-12.273518,霤:-15.828866,堦:-17.215160,袱:-11.462587,椰:-12.995652,钹:-12.884427,甸:-11.475367,妻:-9.823128,曅:-17.215160,衆:-16.116548,狍:-12.871355,奐:-13.137623,绕:-9.196535,觛:-16.522013,晚:-8.545589,牢:-10.112661,囥:-13.226176,繪:-9.650403,柯:-11.576805,珷:-13.749424,噺:-12.845712,老:-6.798160,构:-10.568770,儋:-13.847864,頑:-10.889011,崓:-15.828866,羔:-13.526281,樝:-17.215160,垤:-14.817265,脫:-8.978210,撮:-10.420573,贳:-17.215160,炶:-12.266400,娽:-16.522013,精:-8.904745,蟄:-12.897672,歇:-9.366617,鏌:-11.552200,睏:-14.507110,哎:-10.058983,詝:-15.135719,佟:-11.777081,燠:-15.017935,編:-13.072025,蓮:-9.869150,桱:-15.828866,鳾:-15.605722,蚃:-14.730253,愂:-17.215160,洊:-14.079666,再:-6.290896,麓:-11.569713,悗:-11.163071,蘘:-14.912575,沟:-9.439464,儢:-16.522013,碧:-9.969505,鸨:-13.386519,崪:-14.730253,膭:-15.135719,怬:-15.828866,趵:-14.442571,水:-7.116352,傷:-17.215160,砼:-15.135719,岿:-17.215160,腂:-16.522013,濉:-12.103172,赊:-12.784343,偌:-13.551598,饒:-9.801190,胗:-13.847864,潞:-12.091196,叡:-12.419369,飧:-11.872826,筦:-13.453960,拫:-13.154717,豴:-15.135719,竻:-12.245347,顼:-15.269250,彾:-13.813963,技:-10.185187,溈:-15.423401,吏:-10.554585,鴕:-17.215160,莖:-10.016229,朙:-15.423401,辞:-9.752371,猡:-16.116548,加:-7.861846,鮦:-13.189808,缩:-9.602329,庨:-11.906892,圹:-14.324788,晃:-9.885410,牋:-17.215160,繓:-15.423401,姒:-12.671865,蝙:-15.423401,棜:-14.912575,鍡:-13.154717,噣:-14.170638,瓤:-12.749252,闺:-11.931956,祽:-13.957064,壼:-15.828866,覇:-17.215160,樆:-13.718652,争:-8.961672,閏:-15.017935,瘎:-13.882956,媑:-17.215160,殛:-14.079666,丞:-10.745910,瞣:-17.215160,锤:-10.736650,娦:-17.215160,侳:-15.828866,隹:-13.343959,眸:-13.882956,擅:-10.288583,詆:-14.576103,佈:-17.215160,子:-7.358293,糕:-9.261490,诛:-10.479380,韣:-13.430970,哥:-8.779394,旯:-14.270721,議:-9.511701,靸:-15.605722,舁:-15.269250,踉:-13.659812,匋:-14.730253,熌:-14.730253,騑:-16.116548,弓:-10.287602,綔:-11.413042,蒚:-17.215160,栝:-15.423401,邢:-10.804985,琥:-14.817265,喤:-16.116548,茫:-11.481819,鲪:-16.116548,暮:-10.503420,輳:-11.407018,状:-8.464319,鬻:-13.207827,纾:-12.109215,楇:-16.522013,里:-5.962898,畏:-10.800063,柘:-13.283334,衝:-17.215160,珠:-9.326076,奧:-9.583728,蛮:-10.160710,橱:-11.246452,鋶:-17.215160,癹:-16.522013,埸:-16.116548,黾:-12.650812,肃:-10.533051,朂:-15.828866,钋:-12.871355,權:-16.116548,垍:-15.605722,颓:-12.505630,缒:-11.973413,宕:-11.892150,暗:-9.099042,耘:-13.137623,檟:-16.116548,鐠:-16.522013,圢:-14.817265,级:-8.019629,嬪:-12.347626,螭:-11.130661,昬:-15.423401,讵:-12.287906,嚷:-10.179891,縼:-14.381947,媿:-13.688800,旁:-8.647274,蝂:-17.215160,噌:-13.040773,齒:-10.081864,婔:-17.215160,敖:-12.097166,楞:-10.633135,嗡:-11.812483,黧:-14.817265,給:-16.116548,姩:-11.440608,虬:-12.924701,棳:-15.828866,啶:-13.919323,系:-7.985409,鹼:-12.266400,茅:-10.634521,万:-6.926716,梈:-15.423401,霍:-10.398424,粐:-12.523812,薖:-17.215160,愙:-16.522013,甡:-16.116548,礩:-12.966665,墨:-10.089877,舯:-13.882956,儹:-12.858451,玺:-11.777081,蓀:-13.207827,恃:-11.320757,裈:-15.135719,瑋:-11.269739,鳐:-13.323340,忒:-10.814903,腙:-14.730253,镡:-16.116548,偣:-11.877622,狤:-16.116548,饩:-12.238426,杭:-10.061326,歵:-17.215160,罽:-13.323340,辇:-10.557149,鎏:-13.010467,岑:-13.137623,涛:-11.037216,輜:-14.576103,洰:-12.542331,邹:-12.533029,焸:-16.522013,担:-9.656122,豆:-9.397937,盍:-13.957064,過:-15.423401,嵐:-15.269250,跛:-11.937045,仝:-13.749424,釣:-11.182074,癢:-10.766271,揯:-16.522013,走:-6.386680,酸:-8.946685,剺:-15.269250,萁:-13.781173,掄:-11.392114,瞌:-15.605722,箔:-12.924701,芚:-17.215160,渝:-10.331697,侜:-16.116548,隢:-17.215160,厤:-13.283334,蔫:-12.640449,悮:-16.522013,褳:-12.772509,鴻:-9.412951,帽:-10.585797,碾:-10.944172,潇:-12.845712,韌:-12.103172,獏:-13.957064,僎:-17.215160,鯔:-13.781173,痠:-15.017935,彧:-11.216223,秨:-17.215160,银:-8.523006,凸:-10.878334,飾:-10.363975,隋:-10.252917,椊:-16.522013,骓:-13.303137,紒:-13.365012,撗:-16.116548,梟:-10.843548,阠:-15.828866,唢:-16.116548,粧:-14.381947,騨:-17.215160,太:-7.092577,搬:-9.253441,栴:-16.522013,咷:-16.116548,墿:-12.981054,柁:-15.828866,翑:-15.423401,鵒:-12.966665,塔:-9.213135,杖:-9.653518,裟:-13.604242,埡:-13.957064,鳧:-13.323340,罦:-17.215160,審:-9.305671,曫:-16.522013,葬:-9.682001,櫳:-13.088026,坶:-13.430970,绻:-11.781438,鱼:-7.523011,孾:-12.620040,暀:-12.542331,脅:-10.783829,檈:-14.079666,锍:-13.577574,倏:-11.921855,挙:-13.577574,讞:-13.365012,笩:-14.650211,伱:-15.828866,液:-9.795180,匹:-10.294489,熺:-11.053953,蛀:-12.317320,扃:-15.269250,癋:-14.079666,黐:-13.718652,巒:-13.010467,荙:-16.522013,靡:-11.650640,烤:-9.024806,敭:-15.423401,極:-17.215160,峼:-16.116548,渆:-14.650211,庑:-10.899802,澛:-16.522013,鄤:-14.730253,带:-7.059631,躱:-16.522013,銹:-17.215160,情:-8.183588,瓍:-15.605722,磕:-10.304409,进:-7.062160,恚:-12.011153,瑢:-17.215160,僥:-15.605722,硪:-12.394878,轰:-9.668186,痷:-15.423401,偺:-17.215160,憄:-17.215160,訉:-16.522013,國:-14.912575,鸑:-13.343959,肚:-10.158985,钢:-9.374847,冤:-10.488927,抮:-17.215160,謳:-17.215160,皶:-17.215160,鼻:-9.740388,尽:-7.993188,浇:-10.809932,仆:-10.180772,闌:-12.339963,煏:-16.522013,駔:-15.605722,揘:-17.215160,豝:-16.116548,遥:-10.850409,嵧:-15.269250,篨:-17.215160,湱:-17.215160,俰:-14.650211,零:-9.693301,特:-8.240795,司:-8.645185,欂:-17.215160,颋:-15.423401,朊:-13.749424,宍:-17.215160,钓:-11.182074,猒:-17.215160,垕:-13.453960,檗:-15.605722,谘:-12.952480,会:-5.784628,暟:-13.408498,頠:-14.170638,嬢:-16.522013,犧:-13.604242,鐨:-14.079666,圪:-12.165304,训:-10.251024,亯:-10.710872,螵:-16.116548,昴:-13.303137,媷:-13.551598,鎽:-12.091196,爼:-16.522013,槁:-13.882956,旉:-15.828866,婌:-16.522013,鍒:-9.470590,噔:-12.609990,諗:-13.501588,楖:-15.017935,蛟:-11.041374,敞:-11.591143,姡:-14.817265,煦:-13.263916,嗩:-16.116548,棫:-14.124118,詬:-12.514680,奶:-10.080269,烻:-12.444475,啾:-12.085261,梀:-17.215160,輅:-11.826088,撈:-10.337864,帏:-13.408498,視:-9.223230,洙:-14.912575,墠:-11.139814,甩:-10.207559,咨:-12.133756,騷:-11.952470,崹:-16.522013,阿:-8.375159,裀:-15.269250,硋:-16.116548,郐:-14.730253,赙:-15.135719,拜:-8.460842,屣:-14.730253,绤:-16.522013,歭:-16.116548,菲:-10.257663,杵:-11.301657,勼:-17.215160,怆:-13.323340,龏:-17.215160,傑:-16.116548,茜:-12.378878,綣:-11.781438,倦:-11.374518,肱:-13.526281,愰:-12.295179,鲹:-15.605722,冻:-10.382128,滅:-11.261917,聆:-12.620040,児:-15.135719,穢:-11.689707,濯:-13.056277,腰:-9.045540,篷:-12.005674,幺:-9.127520,矿:-9.476672,蠁:-14.730253,澄:-10.780614,夋:-10.496147,箌:-17.215160,逑:-13.120815,唓:-17.215160,瞔:-17.215160,躚:-13.430970,戝:-10.491328,骢:-14.817265,縥:-17.215160,徤:-17.215160,褫:-13.659812,險:-9.757551,沮:-11.937045,碶:-17.215160,刽:-14.381947,迄:-11.673896,捇:-14.270721,峎:-16.522013,淘:-11.105912,艝:-17.215160,鹥:-16.522013,卧:-10.258615,痨:-13.749424,籹:-15.423401,链:-10.147840,椂:-10.916211,骋:-12.737823,妍:-12.016663,隓:-16.522013,焒:-17.215160,喕:-15.828866,梗:-10.860790,踘:-17.215160,撟:-14.324788,騠:-14.912575,夢:-8.993950,阨:-16.522013,唪:-15.828866,栬:-11.858574,搴:-10.626234,墷:-14.730253,醽:-17.215160,瀼:-14.576103,咿:-13.283334,毁:-9.196864,柉:-12.820711,蕊:-12.079362,塌:-10.633135,珑:-12.514680,酒:-8.040136,呔:-13.718652,蓟:-11.901954,杞:-11.037216,寡:-11.045549,郧:-10.869524,獦:-15.828866,櫫:-15.017935,衬:-11.309798,佮:-16.116548,曳:-12.056105,葴:-16.116548,狻:-12.033376,遼:-8.995565,檀:-10.806631,贅:-12.121410,暈:-17.215160,餍:-13.386519,小:-6.247496,锕:-13.010467,讖:-17.215160,亘:-13.996284,螞:-12.324811,笡:-15.423401,媠:-15.017935,鎦:-11.534987,眩:-12.252315,嚨:-15.423401,谯:-12.505630,憲:-11.555678,頷:-12.938494,弹:-8.786143,綺:-10.031289,鐿:-15.423401,諀:-17.215160,湃:-13.154717,蛈:-17.215160,穋:-16.522013,鋐:-15.269250,凒:-16.116548,轙:-17.215160,惜:-10.949859,幣:-17.215160,革:-10.090682,業:-17.215160,敵:-8.418821,鷺:-13.104286,煽:-11.973413,僼:-15.135719,膇:-17.215160,戆:-14.324788,縎:-13.453960,劑:-9.828070,掛:-16.522013,羣:-13.010467,花:-7.765016,挰:-14.170638,麹:-15.017935,缸:-10.526805,去:-5.491957,泅:-14.324788,鹎:-14.730253,卐:-16.116548,瓕:-14.730253,峥:-13.919323,瑪:-10.905242,淯:-13.137623,荰:-14.219428,秷:-13.365012,齸:-16.116548,屺:-14.576103,痿:-13.919323,伃:-13.025505,嬋:-16.522013,禌:-15.828866,鈑:-13.386519,圓:-16.522013,疔:-13.365012,思:-9.344994,颢:-15.423401,簥:-14.576103,謫:-12.808441,钪:-12.600040,窶:-13.408498,錻:-16.522013,倽:-15.269250,皾:-15.423401,跄:-14.170638,慇:-16.116548,駌:-17.215160,絏:-16.522013,闔:-11.462587,濘:-16.522013,篠:-17.215160,鱥:-15.828866,內:-6.391310,扱:-14.270721,繹:-13.430970,忸:-15.017935,雾:-9.874324,漂:-11.165427,鲋:-13.025505,徍:-14.381947,邓:-10.508298,厕:-12.266400,抟:-13.386519,弢:-13.477490,皧:-14.270721,匪:-10.774214,辭:-9.752371,測:-15.828866,戴:-8.826255,康:-10.233225,瘼:-15.135719,势:-8.635931,轂:-16.522013,應:-7.067276,荊:-9.321961,幌:-11.165427,痑:-17.215160,青:-8.587858,剔:-12.347626,苟:-11.472157,巡:-10.520598,畦:-12.661283,泫:-13.919323,蹬:-11.016681,想:-6.181820,艴:-17.215160,嵶:-15.828866,陼:-13.631641,兾:-15.828866,謅:-13.072025,悈:-15.828866,鼍:-12.580431,璐:-11.440608,錕:-13.882956,椙:-16.116548,紡:-12.981054,閦:-16.522013,储:-11.045549,枲:-15.135719,鸷:-13.172109,夹:-9.251352,鈿:-13.430970,賀:-17.215160,桃:-9.905948,係:-15.605722,胈:-10.721406,铐:-12.011153,埒:-14.270721,曜:-12.640449,鵡:-14.817265,塣:-17.215160,酩:-14.912575,潭:-10.417220,们:-6.588675,蟲:-16.116548,捵:-17.215160,鯺:-16.522013,睽:-14.170638,囼:-17.215160,咑:-17.215160,斛:-12.146256,蜜:-11.153703,鬤:-17.215160,否:-10.307405,蒱:-13.604242,喻:-11.514716,櫅:-16.522013,葆:-13.244868,绍:-11.135227,顎:-12.411139,啐:-11.734521,藛:-15.017935,橚:-15.269250,繢:-13.453960,嫥:-15.135719,牪:-17.215160,毯:-12.178207,饸:-16.522013,婺:-13.244868,谁:-7.055404,殄:-14.124118,崋:-12.620040,羌:-10.907062,鐑:-11.781438,儓:-13.688800,誚:-12.570769,昝:-14.817265,室:-8.789644,贫:-10.550751,銪:-17.215160,中:-4.813558,梮:-14.270721,粶:-14.912575,锻:-12.011153,评:-10.035090,杇:-16.116548,筏:-11.882441,壎:-15.017935,佗:-13.189808,様:-14.576103,締:-13.781173,驥:-13.526281,坧:-15.269250,摱:-14.576103,鳶:-13.604242,硹:-17.215160,姸:-13.996284,郾:-13.365012,誃:-17.215160,洂:-16.522013,麋:-13.781173,愊:-17.215160,嶍:-17.215160,銓:-13.244868,甒:-15.828866,冕:-12.808441,記:-15.423401,悟:-10.216650,鸠:-10.571370,崢:-13.919323,璧:-9.877572,優:-9.911317,氬:-10.775810,膵:-13.577574,岷:-12.478962,閽:-12.630193,琼:-11.075275,傿:-17.215160,濁:-11.383278,赂:-13.244868,揉:-10.296465,腊:-10.761535,屌:-13.577574,矑:-16.522013,镒:-13.154717,偔:-15.423401,潖:-13.453960,捞:-10.337864,忡:-14.817265,铧:-13.604242,睦:-10.846973,叩:-10.169383,豬:-16.522013,拳:-9.543333,彶:-13.919323,盻:-16.522013,鑼:-13.172109,満:-11.681771,皐:-17.215160,辖:-8.280705,欙:-11.368721,莞:-13.749424,缡:-12.295179,庠:-12.995652,鞦:-16.522013,猩:-12.661283,动:-7.780956,鰷:-15.017935,禺:-14.912575,逿:-13.718652,軀:-11.812483,苈:-13.551598,繋:-14.324788,嗒:-11.443719,譙:-12.661283,齡:-16.522013,鍩:-11.569713,慵:-12.952480,哼:-9.171818,薇:-10.419454,昆:-10.568770,馏:-14.324788,税:-9.393517,嚑:-11.362958,世:-8.432070,枛:-17.215160,箣:-10.925444,嘦:-16.116548,侫:-17.215160,蚱:-13.501588,朰:-17.215160,骹:-17.215160,笸:-13.226176,垻:-17.215160,佀:-15.605722,棅:-15.423401,糍:-15.605722,驎:-13.577574,坐:-7.569990,蟛:-12.737823,桚:-15.423401,鯣:-17.215160,灪:-15.423401,槯:-14.912575,蝰:-13.244868,緷:-13.453960,塺:-17.215160,燿:-17.215160,踁:-10.874801,榄:-12.411139,舉:-15.605722,弋:-13.501588,綌:-17.215160,阑:-12.339963,熔:-11.077433,鲢:-10.481758,砥:-11.158376,妤:-12.570769,邪:-9.624813,檮:-16.116548,纶:-13.104286,吽:-14.730253,规:-9.579856,敇:-14.730253,祏:-14.037106,嫎:-15.269250,釔:-13.172109,毘:-16.116548,翠:-10.217564,顥:-15.423401,啧:-13.025505,諮:-12.133756,晱:-14.730253,穹:-12.650812,寸:-10.438653,钃:-12.682561,猂:-14.507110,垅:-13.104286,肋:-11.182074,缊:-16.522013,貓:-17.215160,欒:-11.280266,鐘:-12.309885,圚:-15.828866,纟:-15.605722,耠:-16.522013,檧:-17.215160,谨:-10.466400,伪:-10.387531,鎭:-11.437508,爬:-8.909676,嚯:-13.604242,縴:-16.116548,讽:-12.671865,樼:-11.128385,亿:-8.915377,燁:-15.605722,鍂:-11.973413,齊:-8.814501,槑:-11.911855,乔:-10.846973,煖:-14.730253,嗙:-11.320757,黟:-15.135719,絞:-10.967117,諧:-17.215160,楦:-13.120815,烫:-10.283688,鉬:-11.518067,啮:-13.343959,棻:-13.631641,詼:-12.444475,炀:-13.659812,霅:-16.522013,娇:-10.735115,粈:-11.329056,輕:-8.284666,甙:-12.671865,覦:-15.605722,洩:-10.286622,阯:-13.996284,失:-9.009668,箲:-16.522013,舷:-12.079362,枺:-16.522013,参:-9.260437,恋:-10.925444,忊:-14.650211,竜:-17.215160,腡:-15.017935,曤:-16.522013,獭:-12.452986,勬:-10.047351,罵:-8.354803,廴:-13.386519,傁:-17.215160,砆:-12.693371,岉:-17.215160,倖:-14.124118,禛:-12.302505,尞:-14.507110,冫:-16.116548,颱:-14.507110,礰:-17.215160,嶳:-15.605722,蒹:-14.381947,攸:-11.541837,兀:-10.280763,盅:-11.764122,顆:-14.817265,嵈:-12.091196,拍:-8.509829,葎:-16.116548,滕:-12.056105,駛:-11.170155,癚:-14.507110,嫝:-15.017935,扢:-13.882956,湪:-9.826214,矯:-11.605688,饰:-10.363975,婲:-10.982712,送:-7.701830,唃:-15.135719,瞄:-11.312527,鰉:-15.269250,掌:-8.142474,蠑:-15.135719,澔:-17.215160,宜:-9.045257,春:-8.748629,鄫:-15.017935,躪:-17.215160,刭:-15.135719,璮:-13.631641,帵:-17.215160,悶:-12.496661,褻:-12.478962,沾:-10.284665,筇:-13.477490,壆:-15.605722,菌:-10.099578,杏:-11.146734,返:-9.992594,南:-7.117093,痘:-12.165304,彟:-13.072025,懠:-13.526281,淨:-9.638550,铮:-10.666941,姰:-17.215160,胶:-10.373545,摹:-10.655545,賾:-12.749252,喅:-12.609990,芋:-12.561200,紊:-13.283334,躓:-15.269250,椒:-10.446667,阘:-15.135719,粟:-11.511378,舠:-17.215160,梧:-12.671865,醭:-13.847864,瀬:-12.858451,咯:-11.163071,覽:-11.440608,格:-8.863549,酂:-15.135719,呄:-17.215160,翉:-16.522013,毑:-17.215160,郗:-17.215160,埙:-13.323340,鳟:-14.324788,武:-8.650702,俩:-9.387919,遬:-13.577574,坮:-16.522013,绳:-10.252917,櫻:-17.215160,佾:-15.423401,犀:-12.324811,锅:-9.367007,堇:-13.343959,纈:-12.630193,脍:-14.037106,檐:-9.925550,鎖:-17.215160,眙:-17.215160,嚘:-17.215160,挡:-9.225600,讦:-13.957064,漩:-10.951762,亨:-10.967117,耷:-14.079666,斺:-11.755575,谿:-13.957064,癃:-15.605722,黈:-17.215160,手:-6.958694,湓:-13.408498,静:-9.410093,荡:-10.125917,擤:-13.453960,轩:-10.766271,煭:-13.957064,僬:-14.650211,峴:-11.552200,藺:-14.219428,楽:-16.116548,劁:-14.170638,馇:-14.324788,庉:-16.522013,薏:-14.219428,明:-7.527282,刖:-12.871355,餜:-15.423401,帞:-16.116548,枣:-11.114841,厫:-14.650211,骱:-12.796319,笰:-17.215160,徳:-14.124118,蚹:-13.343959,朸:-15.828866,區:-17.215160,彈:-12.561200,惍:-17.215160,虎:-8.729458,法:-7.156337,鯛:-13.137623,瑚:-14.442571,蟣:-12.938494,恢:-10.910711,汪:-10.031289,魰:-12.551721,懷:-9.656122,蝸:-13.207827,淿:-17.215160,鈁:-13.343959,圃:-11.555678,疄:-11.598389,鸉:-17.215160,訑:-15.828866,伓:-13.104286,涔:-9.170855,钚:-12.394878,砝:-13.882956,肢:-11.114841,搥:-14.576103,錫:-10.087466,貪:-10.445518,倭:-11.348692,皮:-8.335548,鼳:-17.215160,尵:-16.522013,溾:-14.170638,闄:-10.344069,祇:-12.952480,嫆:-14.124118,臌:-16.116548,敏:-10.001392,跔:-17.215160,兗:-15.423401,矘:-16.116548,嵟:-15.828866,揠:-16.522013,雮:-12.324811,寰:-9.776188,晹:-16.116548,軾:-15.017935,邃:-14.442571,厅:-8.885261,蒋:-10.290548,笊:-13.847864,袓:-15.605722,匚:-13.283334,窟:-10.309407,溧:-14.037106,蠨:-17.215160,鞭:-9.648332,瘬:-13.408498,劯:-12.252315,辽:-8.995565,渼:-15.269250,剄:-16.522013,秉:-11.491575,淑:-10.035090,畖:-13.244868,髟:-13.263916,神:-7.777684,浦:-11.383278,瓫:-16.522013,陬:-13.847864,兮:-10.876566,驴:-10.117611,泻:-11.049742,蹼:-12.600040,璀:-12.981054,帇:-12.033376,蜍:-15.269250,沐:-10.420573,焙:-12.027774,傘:-13.408498,椩:-15.828866,崱:-13.688800,羲:-13.088026,掺:-11.872826,铀:-10.623486,灃:-12.324811,埂:-11.926893,飈:-17.215160,摋:-15.269250,寊:-17.215160,賐:-17.215160,桓:-11.014651,屛:-17.215160,络:-11.064557,蕡:-17.215160,拤:-14.079666,囬:-12.487772,筵:-11.425200,潽:-17.215160,仼:-14.507110,咁:-17.215160,龇:-12.309885,簆:-17.215160,墉:-14.507110,怎:-8.399938,吖:-14.170638,堞:-13.577574,茤:-13.659812,鲱:-13.010467,細:-10.130096,妳:-13.847864,啀:-11.734521,狅:-12.478962,鱆:-17.215160,奈:-10.502204,曍:-16.116548,櫕:-14.730253,牚:-13.813963,廝:-16.522013,臣:-8.572921,晢:-13.303137,橪:-15.828866,珯:-12.760813,鵰:-14.381947,干:-7.321167,柷:-14.817265,腸:-17.215160,毿:-14.079666,玄:-10.108554,枌:-12.127564,谑:-11.627911,殔:-16.116548,銚:-14.270721,縝:-17.215160,徜:-15.828866,蚢:-16.522013,戥:-14.507110,锫:-14.730253,說:-4.914609,嘭:-12.056105,炮:-9.026749,餳:-12.833133,娵:-17.215160,撶:-11.425200,贻:-12.533029,丽:-10.172000,梾:-12.121410,鏄:-8.914880,罇:-17.215160,峆:-15.828866,捏:-9.784453,诔:-12.693371,块:-8.398010,孟:-10.430703,无:-6.565435,佧:-17.215160,槨:-11.172527,巰:-15.269250,裾:-13.172109,銃:-16.522013,内:-6.391310,蚋:-13.040773,礊:-14.219428,誓:-10.268184,洒:-10.277846,璗:-17.215160,儚:-11.887284,碟:-10.675574,蘠:-16.116548,沧:-12.061868,閭:-10.540599,琬:-14.576103,傯:-17.215160,破:-8.082781,氼:-16.522013,矁:-16.522013,镂:-11.357227,偄:-15.423401,築:-9.521223,濑:-14.381947,赒:-15.605722,铗:-14.912575,睖:-16.116548,叙:-9.980983,食:-8.458950,賧:-15.605722,潦:-13.010467,盫:-16.522013,卮:-12.273518,竳:-13.919323,顴:-13.303137,滻:-11.738696,皀:-17.215160,鄅:-15.828866,將:-16.522013,窈:-13.365012,源:-8.915128,猙:-15.423401,劘:-15.017935,鮞:-14.219428,朡:-15.423401,辦:-7.973903,逯:-13.343959,弱:-9.214140,網:-14.576103,萷:-13.430970,憺:-15.135719,蠿:-17.215160,雀:-10.998554,牃:-17.215160,嗂:-16.522013,晋:-9.880831,姊:-8.902289,橓:-14.037106,鍙:-9.215817,幛:-13.996284,糜:-12.165304,惤:-12.726524,譩:-16.522013,畭:-15.828866,哬:-17.215160,鷲:-12.091196,祵:-15.269250,臺:-13.072025,嚁:-17.215160,鶇:-13.688800,媉:-15.828866,膏:-11.233746,戎:-11.221199,云:-8.458478,嘖:-13.025505,羛:-16.116548,掣:-11.066692,並:-15.017935,垫:-10.299437,缰:-11.478588,害:-9.011582,芹:-12.966665,挸:-15.828866,侻:-17.215160,址:-10.908885,鹆:-12.966665,孈:-15.423401,操:-9.097549,艎:-17.215160,佐:-10.519361,棕:-11.112601,灚:-15.828866,峝:-15.828866,摢:-12.682561,齰:-17.215160,屲:-17.215160,旷:-10.892595,荸:-17.215160,槿:-13.343959,阁:-9.434022,熄:-11.538406,斌:-10.843548,榔:-13.365012,邚:-13.718652,簝:-15.423401,嶜:-15.605722,蒢:-16.522013,急:-7.898120,霫:-16.116548,袪:-16.522013,吭:-11.620449,犮:-13.526281,堵:-10.130934,暶:-17.215160,輻:-12.347626,檾:-15.269250,廆:-13.957064,藌:-12.884427,觔:-14.507110,啗:-10.595087,珘:-15.828866,鱝:-13.604242,柠:-15.135719,鋮:-17.215160,批:-8.639887,諾:-9.941374,鲃:-15.269250,笂:-10.313423,待:-7.979834,袋:-10.262431,眊:-15.605722,挒:-13.957064,窗:-9.808449,皟:-12.715350,蠠:-15.828866,萨:-10.302417,鮭:-12.715350,庯:-11.713902,瘴:-12.671865,莽:-11.897040,私:-9.661349,魂:-10.119267,幄:-13.577574,痉:-12.590187,靊:-15.828866,懑:-14.442571,荒:-10.268184,祖:-9.844929,巙:-15.828866,雟:-15.828866,畞:-14.817265,苧:-13.365012,慦:-17.215160,马:-7.315781,嵮:-14.170638,陴:-16.522013,惻:-12.266400,碀:-17.215160,切:-9.200163,璈:-13.137623,悐:-14.730253,蜕:-12.109215,首:-8.138694,紙:-15.423401,岘:-11.552200,椡:-16.522013,膦:-14.381947,攩:-17.215160,鸯:-13.244868,玲:-12.127564,訷:-13.056277,蘿:-11.701731,飀:-14.219428,籃:-10.687202,寂:-11.863302,铈:-13.604242,埊:-17.215160,摓:-15.828866,鵙:-17.215160,偛:-13.526281,滤:-11.602032,蕩:-17.215160,嫬:-17.215160,睵:-15.269250,围:-8.918614,迺:-15.828866,捽:-13.453960,墁:-15.423401,瀆:-11.713902,辏:-11.407018,堖:-17.215160,熛:-17.215160,吞:-10.201245,涣:-12.091196,妫:-11.747100,邱:-11.573253,焰:-11.602032,喳:-13.040773,洸:-13.154717,奀:-17.215160,绅:-12.245347,啈:-17.215160,豎:-10.137662,繚:-12.514680,勝:-16.522013,跣:-13.120815,橢:-12.570769,以:-5.393971,晪:-16.522013,酰:-12.016663,割:-9.705277,乺:-13.882956,柿:-11.709829,頁:-8.715927,崃:-12.505630,殌:-13.882956,耑:-14.817265,爝:-17.215160,厜:-12.224727,渥:-11.849184,侤:-15.423401,蚪:-13.813963,娭:-16.522013,粮:-9.067872,锳:-17.215160,嘵:-14.817265,梶:-14.037106,撾:-12.682561,僆:-14.912575,诌:-13.072025,潏:-15.828866,字:-7.292851,緘:-13.072025,坟:-10.159847,槠:-14.381947,旨:-9.291812,凰:-12.386846,汹:-14.817265,礂:-14.650211,嶅:-10.008783,蚓:-12.938494,愒:-15.423401,碗:-9.152412,崚:-11.514716,璟:-12.570769,悧:-12.370973,蘨:-16.522013,馭:-12.027774,砬:-14.817265,岯:-17.215160,琴:-9.766244,膽:-17.215160,怼:-12.287906,篁:-13.882956,屄:-16.116548,矉:-13.365012,镊:-14.037106,飗:-14.219428,策:-9.770911,忙:-7.989537,铟:-13.343959,睞:-14.507110,胧:-12.715350,竫:-14.817265,彮:-13.408498,鑴:-11.142116,拻:-14.650211,窀:-14.442571,倇:-17.215160,皈:-13.365012,蔕:-14.817265,缙:-11.742889,庘:-14.037106,鞞:-16.522013,次:-7.419982,鰯:-15.423401,匱:-12.737823,熲:-12.570769,伹:-16.522013,髀:-13.263916,繃:-10.823243,姂:-15.605722,橋:-17.215160,嗊:-17.215160,晓:-10.970993,齙:-14.324788,剛:-15.605722,烜:-14.037106,泤:-14.912575,祭:-8.886951,壬:-12.044676,跺:-10.317455,慽:-17.215160,媁:-14.912575,醇:-10.382128,爆:-9.841786,嚉:-17.215160,渎:-11.713902,娖:-16.116548,玛:-10.905242,鄜:-14.079666,嘞:-13.172109,澣:-16.116548,贤:-10.091487,宫:-8.457376,猰:-17.215160,漸:-16.116548,孀:-12.671865,糅:-14.817265,坈:-15.135719,棍:-10.141890,蹎:-17.215160,僝:-16.116548,桢:-14.037106,緯:-10.852132,鍰:-12.505630,偲:-15.269250,槷:-16.522013,轸:-13.781173,旿:-17.215160,騁:-12.737823,弃:-9.942067,阉:-11.777081,榌:-15.423401,鲚:-13.551598,瀝:-12.561200,农:-9.676133,袢:-13.604242,氥:-13.189808,蒪:-13.244868,纮:-14.170638,霳:-10.403916,吵:-10.263388,檶:-14.270721,暾:-13.882956,煇:-12.165304,觌:-14.124118,浏:-13.386519,从:-5.602978,套:-8.848790,翘:-10.923591,遝:-17.215160,啟:-17.215160,柨:-14.507110,黮:-15.135719,牱:-11.446839,台:-7.476311,諶:-11.218708,湹:-13.919323,俸:-11.051845,蛾:-11.086110,颃:-17.215160,缂:-11.799060,宅:-10.408331,猊:-14.912575,侍:-10.121755,肓:-13.207827,朒:-15.828866,纗:-17.215160,領:-16.116548,嬚:-15.828866,犟:-12.661283,谠:-12.542331,伢:-14.650211,暧:-13.957064,耨:-13.882956,媯:-14.817265,鎵:-13.056277,亷:-15.017935,螽:-15.423401,昼:-12.022203,婄:-11.627911,燉:-11.646816,鍊:-11.172527,乌:-9.788611,姙:-13.244868,鋟:-13.283334,煞:-10.838433,敦:-11.677826,鹬:-13.189808,奮:-12.938494,鉴:-10.878334,擻:-16.522013,虼:-12.067666,鬅:-17.215160,炈:-15.828866,撐:-9.966656,茕:-14.219428,鶖:-17.215160,礙:-16.522013,墘:-17.215160,醞:-12.808441,洡:-16.522013,薦:-11.196567,愩:-12.884427,唱:-8.833787,殺:-7.442237,鳀:-13.957064,硃:-14.324788,忂:-17.215160,汋:-16.116548,及:-6.395622,蓐:-15.423401,恓:-13.847864,呛:-10.694539,盜:-9.519402,赡:-11.844522,櫤:-14.079666,腩:-14.576103,廬:-16.522013,獵:-10.813243,诺:-9.941374,杽:-12.551721,岁:-7.846193,理:-8.377334,傉:-13.996284,栎:-11.062427,尖:-9.209126,霜:-10.467574,倞:-12.402976,榣:-16.522013,謤:-14.912575,嶫:-15.269250,钱:-7.424225,田:-8.513980,决:-8.783743,椸:-16.116548,竅:-11.184475,先:-7.066454,衎:-15.828866,拕:-17.215160,囝:-16.522013,解:-8.528562,湢:-16.522013,扪:-13.323340,篯:-15.423401,镰:-11.957665,噲:-16.522013,揿:-12.682561,鰁:-10.970993,选:-8.342813,澌:-15.269250,萑:-13.919323,掔:-12.461570,骚:-11.952470,瘝:-13.688800,垜:-9.798782,芪:-12.749252,席:-9.856329,鄳:-17.215160,刵:-17.215160,蔻:-14.912575,悾:-14.912575,睇:-14.730253,哆:-12.238426,菔:-13.526281,彗:-13.120815,秘:-10.291531,陝:-10.777408,卟:-12.533029,淠:-13.137623,瑱:-16.116548,桹:-16.116548,胾:-16.522013,骃:-14.912575,紂:-11.803514,妅:-16.522013,躋:-13.501588,焊:-12.079362,芓:-15.605722,攒:-11.022798,粗:-9.352663,多:-5.713296,炟:-14.507110,踠:-15.135719,舨:-14.037106,簬:-11.231224,墯:-17.215160,醵:-14.124118,瀴:-15.269250,薽:-15.017935,搼:-16.116548,翁:-9.756397,鵂:-13.207827,塄:-13.303137,珉:-16.522013,酊:-14.270721,柑:-11.329056,蕒:-16.522013,鳗:-12.505630,寙:-14.079666,郟:-17.215160,獞:-14.381947,信:-7.892563,蓧:-12.363130,杦:-17.215160,绫:-11.449969,孮:-15.605722,狳:-17.215160,遴:-14.576103,佶:-15.135719,曻:-15.828866,餅:-17.215160,吇:-13.263916,贍:-11.844522,暐:-13.120815,笙:-11.024845,鎞:-16.522013,漡:-14.576103,疲:-11.236274,谷:-9.065847,耿:-12.347626,黀:-17.215160,巂:-14.170638,鋈:-12.402976,湋:-17.215160,凊:-17.215160,蛐:-13.501588,打:-6.785377,瓜:-10.438653,轡:-12.044676,棤:-11.383278,荩:-12.704301,闲:-9.827451,僴:-17.215160,觺:-13.056277,瘆:-15.269250,劉:-17.215160,規:-17.215160,帖:-9.882137,锜:-10.515660,刞:-13.604242,殣:-13.551598,徫:-17.215160,隱:-9.818825,眰:-11.616738,厳:-17.215160,誹:-16.116548,欸:-16.116548,彀:-11.968136,磅:-10.747461,陆:-9.544732,午:-10.416104,詎:-15.017935,惕:-12.796319,硚:-15.423401,哝:-12.514680,诣:-12.760813,汢:-17.215160,恪:-11.481819,积:-9.415407,靰:-17.215160,呲:-13.172109,混:-9.248920,譸:-17.215160,懿:-10.982712,禄:-11.213745,鈉:-10.419454,伋:-15.423401,涌:-9.510348,蘑:-13.577574,憔:-14.170638,颚:-12.411139,喜:-8.308631,貢:-10.691598,栥:-13.408498,肪:-12.505630,尭:-16.522013,窮:-9.475366,錳:-10.312417,倵:-16.522013,溶:-10.450121,蜻:-14.912575,抾:-16.116548,跌:-9.538223,楏:-16.522013,嵗:-16.522013,篘:-10.029773,濠:-11.957665,补:-9.125984,髮:-16.522013,癱:-11.658332,軶:-14.912575,橹:-11.669983,苾:-14.817265,檇:-15.135719,褆:-17.215160,刌:-17.215160,锎:-14.219428,帔:-14.037106,袛:-17.215160,冡:-16.522013,钣:-13.386519,瘤:-10.793538,榱:-14.730253,疹:-12.693371,鐸:-12.121410,崾:-12.858451,楆:-16.116548,鏍:-10.661227,畎:-14.442571,棛:-16.116548,蝚:-17.215160,瓣:-11.070974,鍢:-11.751328,屨:-15.135719,齪:-17.215160,桰:-16.522013,俵:-15.017935,寽:-15.017935,黿:-12.158914,愁:-10.142738,洉:-16.116548,侊:-11.812483,礑:-17.215160,枚:-9.224245,謝:-9.389515,吣:-13.688800,玢:-14.912575,怫:-13.263916,羪:-13.526281,薮:-12.911095,氳:-12.079362,亴:-12.760813,砻:-12.590187,媼:-15.828866,曄:-13.323340,卍:-15.828866,录:-9.701451,绔:-11.407018,郠:-11.730363,睥:-15.828866,姦:-13.343959,旮:-14.381947,剷:-14.912575,广:-8.768604,斃:-10.982712,舂:-11.320757,熋:-16.522013,踊:-12.378878,夐:-11.673896,經:-15.135719,攘:-11.826088,辟:-9.814539,嚥:-17.215160,紨:-14.730253,茬:-10.947959,鬼:-8.637060,胁:-10.783829,扂:-17.215160,湊:-9.973794,埏:-16.116548,飑:-14.079666,聖:-8.921360,濟:-9.592985,豞:-13.604242,坤:-9.695468,捬:-17.215160,跳:-8.171819,潴:-13.847864,筼:-15.828866,膀:-12.523812,昅:-17.215160,爍:-12.590187,咎:-12.000224,馐:-11.534987,悖:-11.488312,伟:-11.228708,沞:-16.522013,逡:-13.847864,嬧:-14.912575,碦:-17.215160,鰩:-13.323340,术:-9.168931,課:-9.242694,猷:-13.659812,蕃:-10.796795,酋:-12.109215,塑:-11.231224,秐:-17.215160,鵓:-13.631641,摙:-16.522013,诜:-12.363130,勢:-8.635931,籩:-13.430970,廪:-12.871355,奻:-17.215160,驽:-14.576103,梇:-15.423401,謆:-14.507110,倌:-12.661283,霎:-13.025505,尔:-8.975567,誛:-17.215160,厡:-14.381947,琤:-13.365012,復:-16.522013,歆:-12.884427,勋:-10.940398,重:-7.552598,睎:-17.215160,廓:-12.056105,櫛:-17.215160,剠:-14.576103,監:-16.522013,酢:-12.542331,鵪:-14.037106,蓯:-12.533029,郷:-14.442571,癸:-11.562671,姽:-13.847864,持:-8.914880,漉:-14.170638,笑:-6.833701,妒:-11.947302,鲔:-14.219428,褝:-12.995652,嘣:-12.470228,锥:-10.669810,綪:-17.215160,渳:-16.522013,鎶:-10.233225,稻:-11.062427,墼:-14.442571,擄:-11.984051,免:-9.727426,嵕:-14.912575,蛘:-12.897672,楝:-11.812483,俞:-10.674130,略:-8.751368,實:-17.215160,黨:-7.154541,柮:-16.116548,偷:-9.360391,珶:-13.120815,靹:-15.135719,屿:-12.067666,枃:-11.413042,耂:-13.040773,王:-7.326532,谊:-12.022203,羓:-16.522013,頒:-9.338142,朘:-15.135719,趟:-10.750572,咥:-16.522013,缨:-12.184722,悭:-14.576103,脬:-15.828866,沵:-15.828866,贴:-8.657977,碽:-17.215160,餼:-12.238426,苁:-12.533029,恂:-13.453960,汊:-11.249013,嗏:-13.430970,髑:-14.037106,硒:-12.103172,懗:-13.386519,啤:-12.079362,秧:-13.386519,驦:-15.269250,迳:-11.377430,浴:-11.309798,囹:-16.522013,祼:-15.269250,搅:-10.459391,辈:-10.016976,瀍:-15.423401,嚎:-11.730363,鮐:-13.659812,抖:-9.932399,蘙:-14.037106,溞:-14.381947,大:-5.336904,窦:-10.994570,鸩:-12.217948,支:-8.721645,袲:-16.522013,垸:-8.719599,钺:-12.693371,紿:-11.128385,揀:-10.520598,蝃:-17.215160,义:-8.579651,濈:-11.839882,鍋:-11.404019,觜:-14.576103,牡:-10.800063,僢:-16.116548,闤:-16.116548,繩:-10.252917,峪:-11.957665,佳:-9.426948,棲:-16.522013,顽:-10.889011,溇:-15.269250,嘌:-13.025505,犏:-14.817265,那:-5.592932,谰:-13.813963,唶:-16.116548,熹:-12.884427,逸:-10.603119,夾:-16.522013,菅:-13.996284,浆:-10.131772,哋:-17.215160,煎:-9.389915,壓:-8.784397,鯕:-17.215160,泛:-10.184303,荚:-12.217948,呠:-16.522013,烣:-17.215160,面:-7.644561,塨:-15.017935,苯:-10.231370,汰:-13.226176,雷:-9.639063,灸:-11.149052,忽:-8.268395,攁:-15.605722,芄:-12.924701,椉:-17.215160,紑:-11.528185,徒:-9.547534,輝:-10.980749,倣:-15.423401,瞢:-16.116548,搫:-14.576103,箪:-14.507110,栳:-16.522013,閶:-11.978718,簻:-13.526281,庼:-16.522013,拄:-11.501427,蹇:-9.849980,坍:-12.245347,盌:-14.650211,鉏:-15.828866,孕:-11.163071,铠:-12.470228,獥:-14.507110,左:-7.756164,飨:-12.394878,懮:-17.215160,噷:-10.576592,酹:-14.381947,婿:-11.984051,秾:-13.365012,憃:-17.215160,疋:-13.154717,訊:-8.899838,崐:-12.682561,螗:-15.269250,愘:-14.576103,亝:-15.423401,甠:-13.526281,暭:-15.605722,串:-10.336834,檵:-15.135719,刺:-8.337220,纽:-11.277624,蓁:-15.423401,時:-5.665565,俇:-14.912575,裉:-13.088026,叏:-12.347626,鳑:-14.507110,繒:-13.040773,柗:-15.269250,葖:-16.116548,作:-6.974629,卤:-10.558434,杬:-11.569713,觳:-12.820711,價:-14.817265,罼:-14.442571,薀:-17.215160,瘍:-14.079666,稕:-17.215160,撖:-15.828866,耙:-10.587119,鐡:-13.283334,弧:-10.938517,粦:-12.897672,振:-10.453587,躲:-9.018723,眷:-11.449969,旀:-11.566186,槈:-12.496661,镋:-16.522013,屑:-11.213745,緐:-16.116548,恙:-14.270721,远:-7.703013,团:-8.404850,鏤:-11.357227,硩:-14.124118,嫪:-13.718652,滲:-16.522013,詵:-12.363130,嵻:-16.116548,狺:-14.817265,鹽:-8.818328,沇:-17.215160,同:-6.680986,堔:-17.215160,氜:-16.116548,垡:-13.749424,銣:-13.025505,宩:-16.522013,澱:-17.215160,踰:-12.737823,玹:-11.508050,鈸:-17.215160,嬾:-15.828866,潆:-15.828866,獎:-15.423401,嫓:-14.576103,駕:-9.613258,腚:-13.631641,噠:-11.521428,镢:-14.079666,饪:-13.408498,胯:-11.160721,湰:-11.901954,铷:-13.025505,牸:-13.137623,巽:-12.238426,肄:-15.135719,欉:-15.828866,钌:-13.172109,缑:-14.170638,嶒:-15.017935,颔:-12.938494,丛:-10.416104,憚:-14.730253,贝:-10.486531,疢:-17.215160,昫:-14.124118,禪:-10.448968,莮:-13.781173,鞶:-14.650211,縻:-13.137623,岼:-15.269250,惄:-15.828866,豇:-16.116548,啍:-17.215160,瓌:-15.605722,遏:-12.514680,奕:-10.331697,磔:-13.430970,苘:-15.269250,雠:-12.444475,煥:-16.522013,忦:-15.605722,揮:-8.909676,轱:-16.116548,呷:-11.835263,矶:-11.437508,篾:-13.283334,掃:-9.653518,瞋:-15.017935,蠊:-12.952480,箓:-13.365012,鰒:-17.215160,薗:-15.605722,挘:-17.215160,眠:-10.795165,傥:-14.270721,笨:-11.018716,播:-10.759961,蔬:-12.726524,梵:-11.713902,褴:-13.813963,债:-10.721406,粽:-12.884427,蛁:-17.215160,摂:-17.215160,諉:-12.897672,桊:-17.215160,减:-9.559769,黑:-7.882956,旗:-8.997991,虖:-17.215160,槟:-14.037106,詞:-8.560817,緧:-17.215160,鹦:-13.501588,敬:-9.965235,仱:-15.828866,诳:-12.005674,楴:-17.215160,螀:-17.215160,怅:-13.323340,了:-3.523362,琍:-14.381947,劎:-15.017935,龐:-11.097063,砕:-15.135719,暖:-8.562213,檞:-14.270721,阡:-12.911095,崧:-12.224727,约:-6.991947,愯:-12.273518,侰:-17.215160,貲:-12.609990,男:-8.301341,邺:-11.401030,柀:-16.522013,荃:-11.407018,幑:-16.522013,癡:-16.116548,哢:-17.215160,釤:-17.215160,穩:-9.661349,葭:-13.303137,泲:-13.882956,彻:-11.462587,烺:-13.551598,鱽:-15.828866,抇:-16.116548,脆:-10.730525,娌:-10.357646,纏:-9.876272,嘔:-11.548733,肛:-12.386846,戜:-10.716878,鲣:-14.170638,耰:-15.269250,夶:-16.522013,綹:-12.022203,唾:-12.109215,迅:-11.994804,慆:-16.522013,壋:-15.017935,絎:-10.923591,哓:-14.817265,韕:-12.820711,惛:-13.847864,轚:-17.215160,塠:-13.056277,糣:-15.605722,周:-8.188022,恰:-10.326588,籸:-17.215160,叽:-12.523812,雿:-17.215160,椁:-11.172527,躄:-15.269250,攉:-14.170638,验:-11.128385,焑:-15.828866,隔:-8.956997,茝:-16.522013,尣:-16.522013,箢:-10.540599,栫:-11.251581,瞪:-9.748932,趮:-13.749424,搳:-16.116548,瀻:-14.576103,劼:-15.135719,閾:-12.995652,佅:-17.215160,滄:-10.091487,艇:-10.362917,鹏:-10.836734,坕:-16.522013,盔:-10.998554,飠:-13.688800,処:-15.828866,铨:-13.244868,淮:-10.041202,腱:-14.270721,婷:-12.332358,噿:-16.116548,痾:-17.215160,訂:-9.872381,禋:-15.017935,蘊:-12.056105,儐:-13.577574,鈒:-14.817265,洘:-16.116548,螟:-13.207827,礠:-13.882956,庥:-13.303137,鎧:-12.470228,用:-5.968990,檭:-14.079666,謬:-12.085261,暵:-16.522013,蜴:-16.522013,帺:-13.088026,裁:-9.953233,橂:-17.215160,蓉:-10.457066,晊:-17.215160,忏:-13.120815,郑:-9.868505,牒:-11.594759,毗:-11.307077,衖:-14.324788,柟:-10.990602,彤:-12.640449,珧:-16.522013,杴:-16.522013,峹:-15.828866,獼:-17.215160,清:-7.444119,薈:-16.116548,稍:-8.794478,瘕:-14.507110,梖:-13.631641,谙:-12.478962,撞:-8.979534,頡:-12.280686,鐩:-10.795165,漯:-14.037106,芲:-14.170638,嶸:-13.283334,眿:-14.037106,槀:-15.423401,赃:-12.796319,旈:-12.808441,饋:-12.411139,偑:-15.135719,燐:-17.215160,镓:-13.056277,汙:-15.269250,仚:-17.215160,菜:-8.162175,嫢:-12.661283,瑩:-15.828866,囪:-14.037106,詭:-12.005674,拲:-16.522013,虵:-17.215160,养:-9.110155,绺:-12.022203,悇:-12.640449,茆:-15.017935,堌:-16.522013,粏:-13.263916,鼎:-10.319477,吔:-15.269250,怜:-11.371616,审:-9.305671,麣:-15.828866,簤:-12.079362,垩:-14.912575,舰:-9.026471,嬶:-11.070974,羹:-10.618014,鸸:-13.996284,圾:-14.442571,仃:-13.604242,捆:-10.637299,嫋:-14.507110,囓:-13.343959,闕:-9.825596,乘:-8.884296,招:-8.649558,赚:-9.681466,绣:-8.771613,器:-8.867807,镪:-15.017935,扰:-10.897995,繸:-16.522013,函:-10.918051,铿:-11.501427,欁:-17.215160,有:-4.258226,颌:-12.033376,冒:-8.652802,钔:-14.270721,涚:-11.803514,樫:-15.828866,辮:-10.912541,爻:-12.772509,泄:-10.286622,鱏:-14.507110,啕:-15.828866,瓔:-16.116548,慝:-14.324788,另:-7.187907,雨:-8.814501,濮:-10.788672,塷:-16.522013,篶:-17.215160,齹:-11.594759,矾:-11.293582,澃:-15.269250,箋:-11.357227,萊:-10.373545,匐:-13.551598,递:-9.482353,漘:-17.215160,薟:-15.269250,笠:-12.027774,眨:-10.480568,梭:-10.938517,撵:-11.290904,尺:-10.448968,炽:-11.962887,鄼:-16.522013,桂:-10.188733,蛉:-12.726524,摊:-10.461722,巏:-17.215160,灒:-15.269250,槗:-13.813963,虞:-10.848690,燧:-12.347626,鉦:-14.507110,诫:-11.968136,楬:-16.522013,整:-9.754670,鏻:-17.215160,煼:-15.423401,讀:-8.573981,氅:-13.343959,螈:-13.172109,砍:-9.108043,琕:-17.215160,儧:-16.522013,犦:-17.215160,洯:-16.116548,育:-10.728999,鲺:-15.605722,毀:-15.605722,柈:-17.215160,剑:-7.777445,珐:-13.137623,靓:-13.154717,臜:-14.507110,穡:-12.640449,壢:-17.215160,癩:-12.858451,哪:-7.811064,惲:-15.605722,葵:-12.033376,卻:-6.190842,糺:-15.423401,遽:-12.561200,暇:-11.494848,希:-9.930339,餎:-15.269250,昜:-17.215160,嶡:-15.017935,颣:-16.522013,冩:-11.906892,禹:-10.813243,頸:-9.670299,儾:-17.215160,诅:-13.996284,峋:-13.477490,祎:-11.246452,僓:-14.912575,譚:-15.135719,屠:-11.777081,磣:-13.718652,鍪:-12.204525,俭:-12.419369,摰:-17.215160,黷:-15.828866,硸:-15.269250,埽:-12.231553,洁:-11.326282,侂:-13.847864,誄:-12.693371,愉:-11.666084,甑:-12.378878,垒:-11.144422,殚:-14.381947,堣:-11.677826,羢:-17.215160,鬥:-16.522013,氫:-11.449969,玪:-16.522013,京:-8.422914,怳:-16.116548,琻:-17.215160,嚼:-10.555866,櫄:-12.833133,彍:-14.037106,绌:-11.591143,单:-8.545589,狔:-16.116548,裘:-10.408331,杝:-17.215160,鳠:-17.215160,筥:-17.215160,嗦:-11.790210,部:-7.698880,槮:-14.730253,幷:-13.189808,緶:-15.269250,饹:-15.269250,剿:-10.596421,燾:-12.820711,綋:-10.750572,舊:-8.412036,唐:-8.745058,熓:-17.215160,阒:-13.072025,辗:-12.833133,椘:-17.215160,素:-8.796021,鞧:-16.522013,抵:-9.409278,茴:-14.037106,娺:-17.215160,皽:-16.522013,賁:-15.423401,铑:-13.659812,癒:-17.215160,豖:-17.215160,聞:-8.750313,孤:-9.627850,矧:-14.817265,鑦:-17.215160,跫:-12.533029,潬:-13.577574,至:-6.529874,壹:-13.781173,闻:-8.750313,睼:-17.215160,樅:-14.817265,膈:-12.808441,縍:-14.124118,墎:-15.828866,众:-7.877923,沖:-14.507110,蠙:-15.605722,悞:-17.215160,鰡:-17.215160,圧:-16.116548,璦:-12.204525,缷:-17.215160,妸:-11.149052,骺:-13.244868,猿:-10.889011,淀:-12.444475,懈:-12.085261,呑:-16.522013,痐:-16.522013,蟜:-16.116548,廢:-9.336247,鯤:-13.781173,灩:-15.135719,勪:-10.552027,蹭:-11.182074,曲:-9.257633,啻:-13.104286,竺:-13.010467,陽:-13.882956,撇:-11.099268,蜆:-12.924701,尌:-12.693371,碏:-15.135719,倔:-12.419369,搜:-9.550813,御:-8.689205,骣:-15.828866,厩:-12.726524,枱:-17.215160,弶:-13.120815,箹:-13.453960,騸:-17.215160,匾:-10.576592,觅:-10.346146,杆:-9.942067,廋:-16.522013,筎:-16.116548,勓:-17.215160,釕:-13.172109,曛:-13.631641,竣:-14.650211,剨:-15.605722,酪:-12.833133,裯:-15.017935,晰:-14.219428,鳷:-15.828866,穸:-13.154717,嗽:-11.613041,郿:-13.688800,漁:-10.535561,袄:-11.365835,按:-7.262501,鲌:-11.594759,眑:-15.605722,榚:-17.215160,娣:-11.785814,綢:-11.407018,渫:-14.170638,熪:-17.215160,议:-9.511701,戳:-10.056646,咼:-16.522013,鎾:-12.339963,棄:-16.116548,葇:-15.828866,嵍:-15.828866,糌:-16.116548,顏:-11.119335,兕:-14.324788,烔:-17.215160,俖:-17.215160,敝:-10.493734,黠:-14.324788,祥:-10.766271,埦:-17.215160,鋨:-13.189808,蝱:-16.522013,偿:-11.395077,現:-8.162527,伀:-12.461570,殃:-13.104286,谂:-13.501588,羋:-16.522013,耊:-15.423401,玓:-17.215160,鐒:-10.684282,缠:-9.876272,墥:-15.828866,沭:-13.688800,贬:-11.022798,悵:-16.522013,堺:-15.605722,璽:-11.777081,锼:-14.037106,求:-8.441002,恊:-14.442571,姏:-11.872826,瑒:-16.522013,懟:-16.116548,奤:-13.551598,痧:-12.981054,迫:-10.381051,浬:-16.522013,慴:-15.423401,嫹:-17.215160,韻:-17.215160,畼:-11.892150,辀:-17.215160,栅:-11.697707,簍:-12.924701,瀕:-11.419102,準:-14.576103,鸡:-8.977945,唧:-14.507110,皦:-13.813963,椯:-15.269250,蒲:-10.809932,宸:-10.280763,颺:-13.957064,激:-10.090682,齋:-10.013989,噑:-16.522013,鍓:-10.874801,橙:-11.022798,藜:-12.650812,繡:-8.771613,駤:-16.522013,物:-8.153320,佫:-17.215160,擲:-9.458965,聵:-15.269250,坻:-15.423401,磺:-12.109215,鑽:-9.444937,窇:-13.072025,蔎:-17.215160,且:-7.958891,喙:-11.605688,颛:-15.017935,稜:-15.828866,昤:-17.215160,售:-10.526805,禱:-12.204525,頰:-10.605811,方:-7.729767,萸:-15.017935,哃:-16.522013,韅:-17.215160,祆:-12.650812,菍:-16.522013,敎:-15.605722,迕:-14.079666,员:-8.520658,靚:-13.154717,擣:-16.116548,荢:-17.215160,叭:-11.518067,雯:-15.135719,念:-8.926626,苷:-11.685731,摸:-8.791838,厂:-8.562038,紉:-12.911095,徊:-11.994804,椑:-17.215160,躔:-15.828866,堛:-13.408498,鬝:-17.215160,探:-9.436111,蜥:-12.231553,瀫:-17.215160,劬:-12.749252,閮:-10.438653,簳:-12.726524,栻:-14.270721,趾:-10.821569,拌:-10.130096,虏:-10.306405,何:-8.525696,滔:-13.189808,凖:-14.324788,筝:-11.901954,州:-7.537883,胠:-16.522013,来:-5.222893,賨:-12.197880,噯:-13.104286,饱:-9.845559,懶:-10.826599,蕹:-14.270721,乿:-17.215160,淾:-16.116548,儀:-9.770327,疃:-12.600040,崈:-13.154717,憋:-10.411655,鸊:-16.522013,涓:-7.745691,鎗:-14.912575,甘:-10.502204,龟:-10.409437,愠:-12.580431,讧:-14.507110,洨:-15.135719,犭:-15.423401,錬:-15.828866,娲:-11.022798,纵:-8.867570,鼴:-16.116548,檽:-14.730253,謼:-17.215160,郁:-12.016663,牂:-13.813963,寇:-11.163071,鳉:-14.219428,繊:-13.957064,珗:-12.204525,孜:-11.877622,翟:-11.931956,毧:-17.215160,衦:-16.522013,獬:-12.661283,罴:-13.303137,歼:-10.597757,瘅:-16.116548,墆:-17.215160,戍:-12.050374,渕:-17.215160,北:-7.424841,炖:-11.646816,鐙:-11.777081,弟:-9.138956,粞:-13.957064,耡:-13.453960,梦:-8.993950,谩:-11.709829,眯:-11.081762,骲:-15.423401,挷:-16.116548,蚺:-14.124118,漿:-10.131772,偁:-13.526281,镃:-13.718652,屉:-13.781173,腋:-11.887284,槐:-11.609358,赓:-14.124118,瑙:-10.515660,囚:-11.514716,恡:-17.215160,汩:-15.423401,八:-8.302956,仪:-9.770327,鉭:-12.259333,嵳:-17.215160,鹵:-10.558434,曺:-15.828866,各:-6.505040,碇:-13.226176,蜎:-15.828866,垙:-12.981054,骛:-13.957064,砜:-13.477490,蚣:-13.688800,侩:-14.576103,圮:-13.919323,箱:-10.128422,騰:-15.828866,枹:-13.919323,蘸:-11.298958,伾:-14.912575,闅:-11.627911,筆:-16.522013,臍:-12.496661,李:-8.048354,仓:-10.333749,噘:-12.871355,曣:-17.215160,乨:-17.215160,凭:-8.563961,铯:-12.772509,穰:-13.323340,巵:-15.828866,晸:-17.215160,猁:-15.605722,冂:-15.828866,钄:-14.079666,缉:-11.751328,嶊:-15.605722,肌:-10.127586,欑:-11.312527,貔:-15.269250,娛:-12.661283,疚:-13.453960,餝:-13.577574,蔥:-10.649895,爫:-14.576103,涪:-12.995652,催:-9.967367,鞮:-14.730253,岴:-16.522013,莶:-15.269250,樻:-10.395144,达:-6.966134,啅:-15.017935,瓄:-16.522013,惌:-13.749424,泔:-14.817265,取:-7.912696,雘:-16.116548,祝:-9.677197,忞:-14.912575,敥:-14.730253,呯:-11.781438,矮:-10.037378,濾:-11.602032,匀:-11.167788,适:-10.573978,弈:-13.244868,掋:-13.604242,眘:-14.442571,墝:-14.324788,挠:-10.969053,炭:-11.290904,堲:-17.215160,粵:-16.116548,鴴:-15.828866,梽:-13.207827,鋁:-15.423401,灂:-16.522013,姇:-13.104286,黉:-15.605722,諑:-13.551598,鉖:-17.215160,緟:-12.981054,鹞:-12.630193,槧:-17.215160,試:-8.992875,煬:-15.135719,嫱:-13.882956,读:-8.573981,楼:-8.475624,鎀:-14.442571,琅:-11.511378,龈:-12.858451,怍:-14.324788,氕:-15.423401,儗:-13.137623,犖:-13.813963,阙:-9.825596,崟:-13.453960,舡:-14.442571,踩:-10.091487,甯:-10.912541,宰:-10.533051,愷:-12.211214,洿:-11.685731,剁:-10.509521,珀:-12.231553,幉:-15.605722,翈:-15.828866,毐:-13.430970,癙:-16.116548,哚:-16.522013,藤:-10.831653,卫:-9.806629,遭:-9.103232,彳:-14.507110,磲:-16.522013,鱵:-15.605722,擺:-8.822850,衽:-13.882956,刄:-13.919323,纇:-14.170638,鴆:-12.217948,脎:-15.828866,写:-7.472781,鲛:-11.613041,戤:-16.116548,綱:-16.522013,耸:-10.876566,僃:-17.215160,鏅:-10.464059,絆:-17.215160,慎:-11.163071,试:-8.992875,偘:-16.522013,鍚:-9.464545,惣:-14.381947,埭:-13.957064,鋯:-12.427668,籰:-13.996284,寵:-17.215160,恸:-11.994804,俽:-15.828866,垂:-9.441986,宊:-14.124118,蚌:-10.992584,洑:-14.507110,侒:-14.270721,尛:-16.522013,玚:-16.522013,枢:-10.742814,琫:-14.912575,殪:-15.828866,嚬:-11.807988,醮:-12.542331,媴:-13.010467,薶:-17.215160,卅:-13.718652,狄:-11.170155,鹇:-14.170638,曌:-14.912575,艏:-13.408498,櫔:-15.135719,嗖:-11.868053,罝:-16.522013,姞:-12.339963,蓠:-17.215160,裨:-12.339963,副:-6.807479,燮:-13.577574,时:-5.665565,腹:-9.836776,槾:-12.252315,阂:-13.718652,夈:-12.370973,斋:-10.013989,騊:-16.522013,踒:-13.365012,鞗:-15.017935,焘:-12.820711,庝:-10.732053,鮟:-13.882956,攠:-16.522013,辧:-14.817265,椨:-17.215160,帲:-16.116548,窵:-16.116548,鬴:-12.620040,溽:-15.605722,铁:-8.149383,療:-14.219428,忇:-16.522013,穊:-17.215160,賑:-11.952470,矗:-11.062427,彜:-12.266400,類:-15.828866,闫:-12.640449,睬:-11.689707,峱:-15.017935,筴:-15.423401,跻:-13.501588,潼:-14.079666,門:-13.453960,岆:-17.215160,馈:-12.411139,昍:-17.215160,樕:-17.215160,圗:-14.730253,這:-15.269250,碞:-16.522013,伧:-14.170638,沦:-12.252315,嶰:-17.215160,朷:-14.442571,芺:-16.116548,痀:-17.215160,酃:-13.659812,秈:-13.453960,蕋:-17.215160,灙:-11.897040,桩:-10.589768,啫:-14.507110,女:-6.976952,绲:-12.178207,驵:-15.605722,拺:-13.688800,蹽:-14.650211,悏:-14.730253,茎:-10.016229,厙:-12.171735,芣:-16.522013,匮:-12.737823,羱:-16.522013,鸰:-14.507110,舸:-13.919323,勃:-11.174905,釅:-13.659812,藍:-9.300908,捎:-10.651305,绛:-11.045549,酚:-11.772742,拣:-10.520598,蕢:-15.828866,襪:-12.146256,嗭:-10.426188,郯:-13.659812,繰:-16.522013,姵:-13.781173,裿:-16.522013,省:-6.907842,喂:-9.515318,還:-17.215160,笉:-9.278500,妊:-13.010467,蒌:-14.442571,漑:-15.828866,帛:-11.548733,熚:-16.522013,鴝:-13.688800,斢:-17.215160,脥:-14.730253,瘫:-11.658332,榪:-17.215160,咬:-9.038206,鎮:-11.524801,稳:-9.661349,设:-7.532194,充:-9.869795,鱇:-13.882956,棔:-13.577574,埖:-15.605722,鋘:-16.116548,絝:-17.215160,寞:-14.912575,慥:-16.116548,俦:-12.966665,偯:-14.912575,珮:-11.410025,柶:-17.215160,玃:-17.215160,嬈:-11.241350,枋:-12.820711,頊:-15.269250,伐:-10.146137,殓:-12.470228,谒:-11.285571,猘:-17.215160,朠:-12.981054,璭:-13.189808,锬:-13.996284,碵:-17.215160,沽:-11.081762,贼:-8.691587,雁:-11.186882,硊:-17.215160,痗:-17.215160,嵜:-16.522013,租:-9.581306,蹦:-10.998554,韫:-13.189808,畬:-12.427668,廱:-15.605722,鯳:-17.215160,祴:-14.650211,迻:-16.522013,浼:-10.359751,鞀:-13.207827,瀅:-15.269250,庆:-9.483668,鮈:-15.269250,損:-17.215160,辐:-12.347626,栕:-16.522013,唗:-17.215160,皖:-10.652716,够:-8.899349,窞:-13.207827,焯:-12.833133,徰:-15.605722,鲲:-13.781173,肺:-9.970218,椿:-11.759839,噁:-14.730253,矀:-13.882956,婉:-11.952470,牙:-9.297259,僚:-12.027774,晡:-14.324788,橩:-17.215160,坫:-15.135719,鑭:-13.577574,孳:-11.318006,糲:-13.343959,页:-8.715927,佻:-15.135719,惺:-11.079595,豽:-14.576103,鄆:-12.600040,溏:-13.154717,嶙:-13.104286,邛:-12.845712,爜:-15.605722,渤:-11.764122,崮:-13.688800,熱:-16.522013,峃:-17.215160,煆:-15.605722,词:-8.560817,济:-9.592985,蟕:-16.116548,屘:-16.116548,烛:-10.953668,泣:-11.380349,蝪:-17.215160,黯:-13.189808,灰:-9.252048,埵:-15.135719,諷:-13.408498,汸:-16.522013,礁:-11.000552,麄:-17.215160,垊:-14.324788,誌:-17.215160,倛:-13.847864,羚:-12.820711,錝:-12.952480,殢:-13.386519,輥:-13.303137,砫:-13.453960,枪:-8.624345,琳:-10.671248,嚴:-9.355361,总:-7.146794,薾:-15.605722,彅:-15.017935,组:-8.776794,櫌:-13.263916,蹏:-16.522013,曔:-17.215160,姖:-15.269250,鳘:-15.605722,獝:-15.828866,嗞:-15.423401,潥:-12.981054,蓨:-15.269250,幯:-17.215160,酱:-10.669810,槶:-16.116548,夀:-17.215160,綃:-16.522013,騂:-16.522013,阊:-11.978718,斓:-11.790210,舒:-11.018716,紘:-17.215160,劝:-9.042431,椠:-17.215160,亥:-11.942160,莧:-16.522013,攨:-15.828866,窭:-13.408498,鬬:-16.522013,刲:-17.215160,皵:-11.498132,为:-4.617207,抽:-9.285674,茼:-16.116548,叇:-15.135719,铉:-13.718652,癊:-16.116548,俏:-11.267125,扒:-10.184303,顖:-17.215160,卜:-10.458228,矟:-16.116548,鑞:-17.215160,佤:-13.303137,筬:-17.215160,僱:-17.215160,闳:-11.968136,臻:-11.839882,馀:-12.295179,縅:-17.215160,閈:-14.270721,昕:-12.487772,嬗:-13.283334,土:-8.160305,璞:-11.957665,蠡:-13.010467,悦:-11.548733,萩:-16.116548,缯:-13.040773,冰:-9.531296,欷:-14.270721,躺:-9.060085,朿:-17.215160,秀:-9.789802,痈:-12.224727,蕓:-13.154717,籙:-17.215160,廚:-15.135719,鏜:-12.000224,桡:-12.470228,迤:-11.887284,摩:-9.708568,驭:-12.027774,狲:-12.452986,陵:-9.258333,滺:-15.269250,艽:-12.600040,射:-8.712877,錆:-13.263916,沏:-12.146256,徙:-10.545662,銛:-14.576103,氤:-13.688800,玱:-17.215160,鈰:-15.135719,澹:-10.785441,獆:-15.828866,觍:-17.215160,潎:-14.507110,藕:-8.868755,幘:-11.511378,鵚:-15.269250,蕪:-11.056065,姭:-15.135719,嗵:-12.158914,湸:-16.522013,蓿:-13.919323,笁:-11.742889,如:-6.280893,眉:-10.152112,喊:-8.757292,挑:-9.265363,蒔:-13.882956,创:-9.293262,続:-17.215160,败:-9.137713,墬:-15.828866,瘳:-15.828866,咴:-13.303137,讶:-13.088026,螾:-11.562671,嵅:-16.522013,遇:-9.064692,棌:-13.882956,豏:-17.215160,擔:-15.828866,寖:-14.576103,默:-10.809932,煝:-17.215160,埞:-14.037106,諠:-17.215160,浥:-16.116548,屯:-10.502204,翮:-14.912575,鍱:-16.522013,轹:-16.522013,嬀:-13.847864,頂:-8.253666,圈:-9.334734,残:-9.977382,枓:-15.605722,耒:-13.882956,馗:-13.882956,缘:-9.593965,傝:-10.493734,閟:-15.605722,欠:-9.858880,木:-8.496824,碭:-17.215160,餬:-16.522013,倲:-14.817265,璵:-15.828866,锴:-15.269250,悽:-14.079666,髁:-12.478962,硂:-17.215160,凇:-12.419369,雉:-11.952470,苑:-10.967117,恒:-10.808280,秗:-15.269250,兜:-10.229518,痟:-15.423401,陞:-15.605722,艦:-9.026471,鯫:-17.215160,祬:-15.017935,勱:-17.215160,音:-9.321961,畴:-12.171735,菻:-14.912575,慼:-17.215160,鮀:-17.215160,簅:-17.215160,劆:-17.215160,鞈:-11.569713,于:-5.642307,搕:-16.522013,夗:-17.215160,窖:-10.524318,皞:-14.324788,蘩:-13.882956,累:-9.250309,厰:-14.219428,邲:-15.017935,椷:-17.215160,侸:-16.116548,貺:-15.135719,政:-9.024528,婁:-12.444475,節:-12.452986,噉:-16.116548,提:-7.982765,蝓:-17.215160,繙:-12.570769,峚:-15.828866,釜:-10.116784,橡:-13.323340,跤:-12.061868,晩:-11.858574,孫:-16.116548,坳:-12.952480,鑵:-11.755575,泺:-13.718652,聽:-6.483645,娄:-12.444475,皇:-8.960891,锆:-12.427668,丌:-14.576103,褎:-15.423401,妙:-9.542402,钛:-10.436375,瘜:-14.442571,央:-11.569713,疱:-13.283334,榹:-17.215160,壃:-13.343959,鯅:-17.215160,迍:-14.912575,楎:-17.215160,塘:-10.440936,瓛:-16.522013,魚:-14.730253,棣:-9.171176,轢:-16.522013,荪:-13.207827,忭:-14.912575,髯:-11.751328,瑰:-10.394053,叵:-12.259333,桸:-15.605722,紁:-16.522013,徂:-15.017935,骄:-11.734521,焉:-10.497355,芔:-17.215160,君:-9.159050,簫:-11.312527,措:-11.872826,馮:-10.744361,労:-17.215160,搻:-17.215160,膾:-14.037106,竄:-10.194969,陇:-11.658332,位:-7.519743,滌:-12.427668,拔:-9.349205,巖:-14.912575,飘:-9.897284,凞:-16.116548,賠:-10.451275,步:-8.852284,胨:-13.430970,秮:-15.135719,镱:-15.423401,乷:-17.215160,淶:-11.616738,懾:-11.863302,鸂:-15.135719,儈:-14.576103,愨:-14.730253,纭:-11.738696,鼬:-12.693371,嘲:-12.693371,犵:-11.298958,暽:-17.215160,鳁:-14.507110,繂:-15.017935,埇:-13.453960,蓑:-13.430970,晒:-9.925550,鱖:-13.551598,坜:-17.215160,珟:-11.803514,遞:-9.482353,柧:-15.269250,葦:-12.386846,鷫:-17.215160,罬:-17.215160,哱:-13.430970,獴:-14.507110,藻:-10.538077,杼:-14.037106,稅:-17.215160,咆:-15.017935,醈:-16.522013,渍:-12.224727,薐:-17.215160,戕:-13.244868,弗:-10.558434,粖:-12.478962,谡:-12.295179,撦:-17.215160,耩:-15.017935,漷:-15.423401,屁:-10.721406,饃:-11.362958,偉:-14.912575,燈:-9.075720,赋:-9.998451,腓:-12.845712,硙:-13.957064,嫚:-13.688800,韜:-10.940398,污:-11.189294,诤:-12.309885,恩:-9.061810,嵫:-13.919323,鹭:-13.104286,关:-8.351827,盲:-11.216223,鉵:-17.215160,櫺:-17.215160,虽:-7.644491,璇:-9.496030,霆:-13.718652,梏:-15.828866,謎:-10.120096,宙:-13.189808,際:-10.184303,価:-16.522013,誣:-11.730363,栤:-15.135719,嬮:-11.404019,伶:-11.701731,嫃:-14.381947,睆:-14.270721,介:-11.139814,盛:-9.125678,习:-10.111838,櫣:-17.215160,赢:-9.402782,腪:-17.215160,飯:-8.461947,癰:-12.224727,凵:-13.882956,橸:-14.219428,缁:-9.802396,嶂:-12.704301,预:-10.659803,猉:-15.605722,冊:-17.215160,貌:-10.446667,嘛:-9.072806,锝:-12.871355,涢:-11.627911,褥:-12.370973,縫:-9.920783,憪:-15.605722,岬:-11.826088,鮮:-9.366226,傴:-15.423401,辶:-13.882956,昻:-17.215160,泌:-12.252315,衏:-12.561200,惔:-14.124118,忖:-12.551721,高:-6.255916,畝:-13.551598,叞:-11.807988,軠:-16.116548,塯:-15.269250,篮:-10.687202,揾:-15.423401,开:-6.978778,匈:-11.472157,逊:-11.123850,掓:-11.937045,萒:-13.025505,鶗:-13.386519,笘:-13.072025,咝:-12.259333,漠:-11.377430,挨:-9.803604,粭:-13.244868,吲:-14.219428,炵:-11.816997,鄴:-16.522013,蔼:-12.427668,籂:-14.507110,嗇:-12.858451,灊:-14.507110,蛑:-13.040773,摒:-13.526281,緗:-13.072025,鹖:-16.116548,啜:-12.833133,營:-17.215160,鉞:-12.693371,旧:-8.412036,囱:-14.037106,煴:-15.269250,蟻:-11.056065,敼:-12.858451,龀:-12.523812,砅:-15.605722,嚆:-17.215160,鎈:-15.605722,氍:-15.828866,螐:-13.996284,怕:-7.890331,崗:-14.124118,纖:-17.215160,騙:-9.739821,償:-11.395077,犞:-17.215160,踡:-17.215160,垰:-13.226176,钲:-14.507110,洷:-17.215160,愿:-8.429773,翀:-14.817265,魃:-13.104286,剉:-8.539255,珈:-11.605688,某:-8.173949,壚:-14.650211,關:-16.116548,湡:-11.208807,扩:-9.650922,彫:-14.442571,鱭:-13.551598,即:-6.761328,遵:-10.505856,棺:-9.706373,昄:-17.215160,爌:-16.116548,嚏:-14.442571,馑:-12.897672,脖:-11.446839,料:-9.296895,贞:-11.179679,嘤:-11.613041,肫:-13.781173,攮:-14.324788,貳:-11.488312,然:-8.993412,喹:-13.477490,颻:-15.017935,聀:-14.576103,豈:-8.910665,啎:-16.522013,摘:-10.141043,话:-6.774010,灠:-15.828866,韥:-16.116548,揭:-10.227670,呸:-10.894392,靺:-13.283334,萃:-12.820711,掂:-11.803514,逋:-13.120815,澊:-15.828866,鰓:-11.016681,箒:-15.605722,栛:-16.522013,誜:-15.269250,琣:-16.116548,厢:-11.079595,隤:-17.215160,循:-10.437513,茭:-14.124118,抬:-8.813153,溴:-11.456258,鬽:-13.283334,窼:-17.215160,杅:-13.919323,视:-9.223230,獍:-14.270721,勌:-15.828866,罕:-10.641480,懖:-17.215160,蹟:-16.522013,淞:-11.835263,坥:-16.116548,秦:-9.264658,景:-9.624308,裰:-13.749424,凶:-9.792189,铸:-10.261476,巾:-10.755256,愀:-13.882956,洈:-14.912575,銍:-17.215160,嶓:-15.828866,麕:-15.017935,蘚:-12.103172,檝:-16.522013,儠:-15.605722,皥:-12.897672,崨:-16.522013,鸪:-13.386519,螯:-12.332358,樲:-17.215160,亵:-12.478962,鎷:-11.060302,瘺:-13.189808,媽:-16.522013,毇:-17.215160,乊:-15.605722,鍌:-13.919323,婒:-16.522013,齔:-12.523812,歜:-14.817265,俟:-11.514716,郡:-8.006020,寧:-14.507110,鳩:-10.571370,棱:-10.407225,孼:-17.215160,謇:-12.091196,梆:-12.580431,刍:-12.871355,霏:-11.624173,璎:-16.116548,帕:-10.709376,挗:-14.576103,薘:-17.215160,醠:-14.912575,笧:-16.116548,墦:-11.256735,蠱:-11.863302,疸:-15.828866,恁:-11.453109,汉:-8.118997,車:-14.912575,姐:-10.044272,襛:-15.135719,曚:-12.217948,镣:-12.444475,狢:-14.912575,慫:-16.522013,绪:-12.067666,迴:-14.817265,祻:-14.442571,固:-9.762758,鯼:-14.730253,辉:-10.980749,瀌:-17.215160,咏:-10.793538,鮑:-11.431335,輞:-14.576103,玡:-14.270721,義:-16.522013,芫:-13.137623,朮:-15.135719,猶:-9.978821,骻:-13.408498,曃:-17.215160,蹈:-12.317320,坎:-10.938517,结:-8.982720,觝:-16.522013,牠:-13.526281,団:-14.650211,闥:-13.137623,懭:-16.522013,襲:-16.116548,淵:-17.215160,噸:-11.768423,镺:-14.037106,秽:-11.689707,憂:-9.729107,伉:-15.135719,鈋:-13.659812,鸓:-14.912575,袜:-12.146256,瘣:-17.215160,冢:-11.004560,钤:-12.115294,脭:-17.215160,悬:-9.682536,丳:-14.124118,贵:-8.808228,娻:-17.215160,餽:-16.522013,碼:-9.878874,故:-8.032499,识:-9.280288,煍:-13.718652,僌:-16.116548,絕:-16.522013,峔:-17.215160,揖:-10.559720,豟:-15.605722,濞:-11.877622,啥:-9.012404,顧:-8.966369,篦:-13.604242,摯:-17.215160,叶:-8.777660,雸:-17.215160,忾:-13.659812,挀:-17.215160,漈:-14.817265,压:-8.784397,笐:-14.817265,従:-16.522013,鲕:-14.219428,條:-16.522013,匠:-10.624859,逢:-10.322518,璥:-15.828866,弨:-16.522013,薯:-12.561200,栲:-13.056277,琺:-15.828866,墽:-13.604242,鶿:-14.381947,槇:-17.215160,酌:-12.027774,塒:-13.847864,鵔:-17.215160,蛙:-11.018716,楜:-15.605722,鋡:-17.215160,畤:-14.124118,黩:-15.828866,虮:-12.938494,鉶:-11.952470,盹:-12.580431,奼:-10.518126,鹾:-13.551598,複:-16.522013,倍:-8.852985,锏:-11.434417,皎:-11.799060,尕:-12.650812,愗:-17.215160,螘:-16.522013,洟:-11.514716,亞:-14.650211,媦:-16.522013,許:-14.037106,殰:-14.817265,儷:-14.507110,崿:-17.215160,扁:-9.916039,胂:-12.884427,湉:-13.604242,俈:-17.215160,賊:-8.691587,穑:-12.640449,寐:-12.324811,飒:-14.576103,據:-7.341668,剡:-14.037106,靣:-13.957064,捫:-13.323340,臬:-13.303137,潳:-16.522013,筻:-15.269250,哺:-12.067666,駼:-17.215160,瘌:-17.215160,鶑:-15.605722,稔:-13.749424,东:-7.401652,疡:-14.079666,判:-10.022226,鴦:-13.244868,禩:-15.135719,蒫:-14.817265,愮:-11.901954,鲻:-13.781173,社:-9.033999,葀:-15.828866,惃:-15.828866,兎:-17.215160,违:-11.041374,瑠:-17.215160,僣:-17.215160,硨:-13.477490,柭:-14.576103,轲:-13.551598,毵:-14.079666,鍺:-12.165304,翽:-17.215160,考:-8.520155,枂:-13.604242,殊:-10.876566,崑:-14.219428,頓:-9.350356,氛:-12.704301,躜:-15.423401,瀣:-16.116548,垢:-11.937045,宪:-11.555678,暬:-16.116548,尻:-12.966665,捅:-10.771029,跆:-14.381947,睍:-13.882956,囌:-17.215160,野:-9.922142,嫔:-12.347626,旖:-13.882956,佝:-14.507110,槞:-16.522013,鹧:-13.430970,緦:-16.116548,扯:-9.256583,嗶:-14.219428,郸:-14.442571,穿:-7.877394,攀:-10.482949,椈:-11.962887,喋:-13.283334,隍:-14.219428,紐:-11.277624,妓:-11.132941,骕:-14.650211,溝:-17.215160,唠:-13.430970,阢:-17.215160,夨:-14.442571,渲:-12.280686,爺:-14.219428,荄:-17.215160,濇:-11.345863,珏:-14.817265,幒:-14.912575,魔:-9.153042,胙:-13.919323,潜:-9.757551,铡:-11.962887,獤:-17.215160,忧:-9.729107,飩:-12.682561,泱:-14.912575,鑶:-13.120815,烹:-11.872826,彼:-10.020723,顾:-8.966369,輇:-17.215160,沆:-17.215160,嘍:-17.215160,錏:-16.522013,炎:-10.611216,朗:-9.871087,膘:-13.137623,缧:-12.871355,岦:-17.215160,馨:-12.133756,谱:-9.494698,圷:-13.882956,熸:-10.536818,摁:-12.620040,桉:-13.577574,籑:-17.215160,黒:-17.215160,赛:-9.283875,拚:-10.349269,酣:-11.685731,塩:-13.604242,敫:-13.688800,蟬:-17.215160,仲:-11.602032,说:-4.914609,絻:-17.215160,勺:-11.380349,怄:-13.207827,讉:-14.650211,研:-10.710872,掙:-10.234154,瞡:-16.116548,値:-17.215160,箩:-12.570769,蚫:-15.017935,挮:-16.522013,侱:-17.215160,眶:-12.324811,厹:-15.269250,麻:-9.735296,笾:-13.430970,虀:-16.522013,拃:-15.135719,但:-5.600500,詈:-12.224727,华:-8.834016,鹐:-15.828866,托:-9.118647,仛:-12.178207,距:-8.880448,勣:-13.781173,穨:-13.749424,旭:-11.785814,买:-7.953271,剸:-14.270721,酺:-14.912575,舃:-13.137623,斂:-11.937045,阋:-13.056277,弑:-12.347626,綒:-15.828866,減:-17.215160,貜:-10.889011,爣:-14.037106,妪:-14.324788,蔭:-15.017935,撬:-10.961331,褵:-17.215160,梴:-12.561200,帻:-11.511378,粼:-13.501588,慅:-16.522013,迆:-16.116548,畍:-13.577574,哌:-13.604242,祕:-17.215160,著:-8.487544,柖:-17.215160,毞:-15.269250,入:-7.301277,鱧:-14.817265,翦:-12.784343,息:-9.876922,瑷:-12.204525,鋸:-11.249013,硿:-16.116548,対:-15.828866,最:-6.205588,肅:-17.215160,型:-7.686366,钍:-12.280686,缐:-17.215160,宓:-12.231553,鐢:-10.361861,炥:-17.215160,嬨:-12.252315,氲:-12.079362,瀺:-14.650211,岽:-14.124118,馿:-15.828866,腄:-14.576103,淇:-11.146734,镌:-12.419369,燏:-14.912575,饔:-11.613041,浜:-8.352110,雡:-16.116548,煤:-9.370136,巧:-10.111016,艮:-12.427668,滱:-15.269250,陶:-10.616651,狹:-10.604464,嵼:-17.215160,驾:-9.613258,贇:-14.170638,溆:-13.120815,名:-7.039548,鄏:-13.957064,犎:-16.522013,堕:-10.674130,莘:-13.749424,椟:-12.266400,鞠:-12.487772,紧:-8.571863,度:-8.698967,鮨:-16.522013,踱:-11.090477,唷:-11.624173,鈹:-12.514680,晁:-11.646816,蓂:-16.522013,裊:-12.981054,繑:-15.135719,忐:-14.324788,鳒:-15.269250,轛:-11.117086,惚:-13.749424,鍣:-13.408498,瓢:-12.005674,婩:-17.215160,杫:-16.522013,歳:-16.522013,觴:-13.453960,僺:-16.522013,要:-5.253831,稌:-16.522013,序:-10.210278,醑:-15.423401,瘔:-13.919323,褖:-17.215160,涙:-11.594759,蔞:-17.215160,帤:-13.919323,被:-5.636026,洮:-12.911095,邻:-9.646264,甾:-12.671865,血:-8.283608,泃:-14.912575,磋:-11.221199,嵎:-13.919323,遐:-14.270721,菝:-14.442571,硠:-15.828866,峣:-11.583948,瑨:-17.215160,柵:-17.215160,屸:-13.172109,珽:-14.912575,调:-8.262555,殂:-14.730253,枊:-17.215160,鐓:-12.845712,怛:-13.120815,侚:-15.828866,芜:-11.056065,簣:-14.650211,客:-8.822397,垪:-14.219428,檬:-12.470228,暴:-10.605811,倻:-14.912575,犼:-15.423401,潅:-13.882956,仄:-12.461570,臆:-14.381947,筍:-12.158914,嫌:-9.770911,睕:-17.215160,囔:-14.730253,槖:-17.215160,號:-17.215160,彥:-15.828866,鉧:-16.522013,燦:-12.115294,湯:-15.269250,胰:-12.016663,穷:-9.475366,癿:-16.522013,嗾:-13.882956,椀:-15.605722,躅:-16.522013,骍:-16.522013,焐:-12.561200,喓:-16.116548,隕:-12.332358,踚:-15.423401,夠:-17.215160,騢:-16.522013,纥:-13.749424,唨:-14.381947,阪:-13.577574,辯:-10.135134,戲:-17.215160,縺:-13.430970,劽:-17.215160,轄:-8.280705,剒:-15.017935,賙:-15.605722,飡:-17.215160,叧:-12.370973,铩:-12.355348,惱:-17.215160,顶:-8.253666,鑾:-12.259333,茇:-16.116548,悆:-12.514680,娍:-12.620040,粎:-12.760813,期:-8.408137,傦:-12.436037,閨:-11.931956,伯:-9.837401,耱:-15.828866,憰:-16.116548,嬷:-13.120815,鰹:-14.170638,綸:-13.104286,桁:-12.784343,諂:-14.219428,蛊:-11.863302,灑:-17.215160,鋒:-17.215160,滚:-9.300542,鵣:-14.730253,竢:-17.215160,楫:-13.551598,盪:-16.522013,诬:-11.730363,敳:-15.135719,煻:-16.116548,建:-7.855710,砌:-9.867860,鎑:-14.442571,謖:-12.295179,蜞:-17.215160,管:-7.869939,尤:-9.350356,錦:-9.630387,瞩:-13.781173,漮:-16.116548,蚳:-14.912575,徹:-11.462587,銻:-14.381947,眾:-17.215160,滃:-10.386448,立:-8.187061,彎:-9.601835,湘:-8.978210,穠:-17.215160,廣:-16.522013,鷥:-13.996284,癨:-16.522013,槭:-12.273518,幸:-10.437513,燽:-17.215160,概:-11.142116,阓:-16.522013,熒:-16.522013,戛:-12.845712,肜:-14.079666,縣:-7.075731,鲤:-10.932893,喪:-17.215160,褭:-15.828866,梬:-17.215160,蔵:-15.135719,撴:-11.481819,刻:-9.381560,炼:-10.212095,浅:-9.260086,菆:-17.215160,壌:-15.269250,哔:-14.219428,街:-8.146383,毖:-13.526281,葟:-15.017935,柞:-13.477490,珦:-15.017935,汯:-17.215160,修:-8.514479,苰:-15.828866,硷:-12.266400,寶:-13.813963,侃:-12.600040,貅:-16.522013,月:-5.605044,宋:-8.702778,颍:-11.631664,垓:-12.211214,钕:-13.604242,优:-9.911317,谚:-13.025505,悝:-15.828866,嬠:-16.522013,頢:-15.605722,粥:-10.196758,在:-3.717220,鐪:-10.025238,趯:-17.215160,怲:-16.116548,馷:-11.290904,簺:-11.853868,傽:-16.116548,閿:-12.158914,资:-9.838026,懇:-14.576103,饌:-10.722920,偒:-15.828866,镔:-16.522013,慜:-16.522013,髡:-12.436037,雩:-14.817265,拱:-9.138956,驶:-11.170155,绹:-15.135719,兼:-8.237130,抆:-16.116548,堍:-15.605722,鴏:-16.116548,纎:-13.577574,吕:-10.374614,椗:-16.522013,辘:-13.551598,鮠:-10.273003,焧:-16.116548,劦:-16.522013,鞨:-13.303137,舱:-10.026747,掰:-11.616738,夷:-9.944847,鸹:-13.263916,羸:-14.381947,唿:-13.365012,橁:-16.116548,裂:-9.961690,晉:-9.880831,蓊:-15.269250,乙:-10.355545,荛:-17.215160,泚:-13.025505,齣:-15.135719,噩:-14.576103,瓪:-16.522013,觬:-16.522013,杳:-13.263916,獻:-8.937748,峺:-14.912575,釼:-13.010467,趁:-9.660825,樄:-16.522013,縌:-16.116548,媏:-17.215160,閑:-12.324811,贖:-11.137518,脞:-15.269250,锦:-9.630387,熩:-17.215160,貫:-13.323340,椮:-17.215160,紶:-10.850409,妹:-10.352402,钻:-9.444937,豀:-15.828866,奎:-12.165304,鑐:-15.828866,蟝:-14.507110,籠:-10.366094,蝲:-17.215160,揵:-13.477490,塸:-15.828866,矽:-13.847864,蠃:-15.605722,澂:-13.501588,掊:-15.423401,唑:-12.726524,瞒:-9.865929,搛:-14.324788,蚜:-12.419369,砣:-13.303137,徢:-15.135719,骤:-11.386214,厪:-17.215160,茵:-12.693371,抴:-15.423401,吻:-9.390314,霽:-13.172109,皼:-15.135719,歅:-17.215160,罍:-14.650211,廌:-15.423401,獕:-16.116548,勔:-14.219428,淖:-11.254155,艟:-14.650211,懞:-15.423401,孥:-13.813963,陧:-14.912575,橯:-13.604242,蓰:-15.423401,巶:-13.718652,洀:-14.507110,誅:-10.479380,愈:-9.336247,嶋:-17.215160,冓:-14.817265,暝:-14.079666,崠:-14.037106,鸢:-13.604242,窥:-11.137518,儨:-13.343959,鈪:-15.605722,亭:-9.267481,讯:-8.899838,鎿:-13.137623,乂:-14.576103,柇:-12.796319,齌:-16.522013,篏:-17.215160,鍔:-10.131772,俗:-9.950430,裙:-10.480568,杜:-10.487728,鳡:-15.269250,埧:-13.477490,佬:-11.312527,衮:-11.989413,擱:-17.215160,磹:-16.522013,坼:-14.730253,蜇:-13.323340,帍:-14.817265,鬏:-15.605722,碎:-9.535446,刕:-12.551721,覘:-13.996284,挟:-10.664080,鶠:-17.215160,咦:-10.502204,醨:-17.215160,萱:-11.282915,新:-6.170224,強:-13.323340,頹:-12.505630,匿:-12.478962,汁:-10.507076,軂:-16.116548,恉:-16.522013,苊:-13.718652,瑑:-16.522013,嗐:-10.843548,雒:-11.921855,櫚:-15.269250,屡:-10.165905,饣:-13.263916,绢:-10.745910,偩:-14.576103,慳:-14.576103,菴:-14.912575,畻:-12.204525,辁:-17.215160,栄:-16.116548,莉:-12.127564,簌:-14.576103,墏:-16.522013,鞑:-10.212095,羡:-11.989413,堤:-9.772082,玩:-8.870655,身:-7.548091,芳:-10.458228,缶:-12.784343,容:-9.336626,隻:-17.215160,猾:-14.381947,蹀:-15.605722,櫃:-13.408498,绋:-12.191280,孎:-13.813963,限:-9.410501,狓:-15.135719,橘:-12.370973,藝:-10.321504,嫣:-10.350312,蕲:-10.005820,懵:-11.957665,婸:-17.215160,饺:-12.561200,企:-10.573978,訃:-13.477490,涂:-9.936531,憊:-17.215160,疒:-17.215160,昛:-16.522013,蒜:-11.045549,稣:-13.365012,嶢:-11.583948,颤:-9.789802,丫:-11.790210,冪:-12.551721,购:-10.299437,沬:-15.423401,悴:-12.671865,嘻:-10.605811,锽:-17.215160,楅:-12.363130,蟆:-12.073496,絍:-16.116548,煕:-15.135719,僔:-17.215160,揞:-15.828866,奥:-9.583728,桯:-16.522013,蛰:-12.897672,忶:-16.522013,灿:-12.115294,叾:-12.000224,袅:-12.981054,挈:-13.189808,律:-9.578408,鲍:-11.431335,厓:-13.847864,邕:-13.365012,张:-7.130101,碥:-17.215160,覯:-14.079666,搲:-15.423401,砺:-12.470228,咽:-10.218479,襄:-9.060947,旇:-11.768423,秏:-16.116548,呒:-13.172109,酔:-17.215160,敜:-15.017935,鋩:-14.324788,詮:-14.817265,曱:-17.215160,竹:-8.943612,啼:-11.643006,暆:-15.828866,對:-5.088813,窎:-16.116548,倕:-15.828866,洗:-9.143629,亖:-15.828866,感:-8.563086,龠:-15.605722,甧:-17.215160,嚦:-12.324811,枰:-12.050374,箸:-12.355348,儿:-7.572258,湁:-9.808449,賂:-13.244868,扉:-13.882956,癑:-16.522013,埐:-16.116548,铒:-14.730253,棚:-10.571370,幡:-11.462587,魣:-16.116548,剩:-9.691139,潫:-13.847864,跬:-14.442571,致:-9.014048,壺:-17.215160,闼:-13.137623,醁:-17.215160,鶉:-12.981054,戌:-12.796319,渔:-10.535561,鄖:-10.869524,疙:-15.605722,娜:-10.254812,鴞:-17.215160,憡:-12.682561,涩:-11.443719,妱:-14.650211,鲳:-14.442571,愶:-11.697707,派:-7.223067,鱈:-12.671865,惋:-14.170638,泓:-12.760813,鯝:-14.170638,恠:-16.116548,蟥:-17.215160,汨:-14.037106,班:-8.765390,魲:-17.215160,毽:-14.912575,儁:-13.025505,鐃:-13.040773,崉:-13.477490,耋:-15.423401,羊:-9.215481,谓:-10.115958,殒:-13.477490,砛:-17.215160,垚:-11.548733,骜:-15.605722,搣:-16.116548,蚤:-12.682561,倫:-17.215160,侪:-14.270721,犬:-10.823243,尳:-16.116548,纴:-17.215160,檼:-15.605722,睅:-15.135719,捍:-12.995652,藎:-12.704301,潕:-11.868053,仔:-11.000552,鉗:-11.709829,孝:-9.685217,鹟:-14.912575,緞:-13.919323,詧:-17.215160,槦:-10.783829,癯:-14.442571,湿:-9.599369,喃:-13.365012,隅:-11.068831,紈:-10.988623,芍:-13.088026,椐:-14.170638,躕:-17.215160,阚:-15.269250,窝:-9.573116,踪:-11.254155,劭:-14.037106,鞯:-11.562671,庵:-9.946240,获:-8.236626,昺:-14.037106,辿:-17.215160,剂:-9.828070,靄:-12.884427,篇:-8.985649,幊:-16.116548,柏:-11.434417,轔:-13.882956,受:-7.057185,铙:-13.040773,筜:-12.363130,胡:-9.111363,杤:-17.215160,卬:-13.996284,磱:-12.952480,彴:-13.551598,聶:-12.505630,丕:-12.224727,猗:-13.154717,傖:-14.170638,閘:-16.522013,缟:-12.386846,膠:-10.373545,欧:-9.458109,趨:-10.034329,圯:-13.957064,禰:-10.727476,净:-9.638550,巈:-13.996284,桑:-10.563588,諒:-11.101478,呙:-14.270721,饛:-15.269250,拢:-10.575284,煫:-17.215160,滪:-17.215160,鏬:-15.423401,絳:-11.045549,诼:-13.551598,鎁:-15.605722,龉:-12.590187,气:-7.426747,堜:-11.329056,採:-14.270721,謦:-16.522013,澩:-13.919323,銫:-12.772509,眮:-13.207827,宱:-15.828866,挶:-12.067666,漾:-12.551721,鉀:-10.709376,盃:-17.215160,孆:-16.522013,鹈:-14.170638,拋:-12.394878,詐:-11.158376,滓:-14.079666,癘:-17.215160,嫛:-15.605722,駝:-10.359751,扠:-13.365012,藥:-16.522013,湨:-14.817265,燭:-15.605722,婰:-16.522013,饲:-10.735115,緵:-14.170638,蕺:-14.270721,槽:-9.800587,阃:-13.813963,弉:-15.828866,綊:-14.124118,稛:-15.605722,喚:-15.828866,颜:-11.119335,昣:-15.828866,别:-7.658963,鄭:-9.868505,炬:-11.602032,帳:-16.116548,粴:-13.749424,梼:-16.116548,畅:-10.604464,哄:-9.675601,慍:-17.215160,蟎:-11.521428,浕:-17.215160,遗:-10.160710,鱟:-12.386846,毦:-12.452986,瑯:-15.135719,埮:-14.507110,髰:-13.477490,恷:-17.215160,蛸:-13.957064,汿:-16.522013,俾:-11.803514,垃:-14.576103,钅:-13.957064,缈:-12.496661,欐:-10.664080,侓:-16.522013,團:-16.522013,鐚:-12.609990,耢:-15.017935,撥:-9.542402,伨:-16.522013,谪:-12.808441,傭:-16.116548,閯:-15.135719,砲:-14.912575,岵:-13.408498,携:-10.007300,趿:-13.430970,偂:-13.365012,镄:-14.079666,秇:-17.215160,届:-8.495843,腌:-11.101478,族:-8.655866,赔:-10.451275,凗:-15.269250,雙:-15.828866,祜:-13.010467,巟:-14.270721,苡:-12.884427,敤:-12.158914,公:-8.579651,嵴:-12.820711,曹:-9.534061,蹾:-14.650211,吅:-16.116548,窆:-14.037106,暎:-14.124118,焗:-14.730253,劖:-15.269250,鞘:-10.728999,紟:-10.835038,庞:-11.097063,莠:-14.576103,椧:-16.522013,辨:-9.816986,唯:-10.310409,箰:-13.847864,枸:-14.817265,牁:-14.817265,繉:-15.269250,忈:-15.828866,鳊:-13.551598,橑:-15.828866,裒:-14.576103,噙:-11.858574,瓚:-16.116548,蝣:-16.522013,惢:-15.269250,乩:-12.427668,獫:-14.324788,泪:-9.629371,釬:-17.215160,鷴:-14.170638,死:-6.906774,庇:-10.938517,昌:-11.002554,趑:-17.215160,樔:-17.215160,锖:-13.263916,熙:-10.392963,帜:-11.738696,餞:-14.219428,斡:-10.413877,账:-10.484142,榩:-17.215160,钫:-13.343959,焮:-15.423401,收:-8.199011,費:-15.605722,椾:-11.246452,烃:-11.785814,嵆:-13.244868,擋:-9.225600,豐:-12.737823,棓:-14.079666,灘:-15.828866,峛:-15.605722,摠:-15.605722,菥:-14.817265,桨:-10.967117,短:-8.410985,齲:-11.620449,唁:-14.507110,逃:-8.742755,変:-10.373545,萋:-14.219428,箊:-17.215160,蠓:-12.590187,澒:-15.017935,簛:-15.135719,厚:-8.722669,麜:-14.442571,怣:-15.605722,芤:-12.749252,含:-8.368663,霭:-12.884427,皬:-11.422146,鬵:-13.688800,獅:-17.215160,勄:-17.215160,杍:-17.215160,陗:-13.919323,痖:-15.423401,彝:-11.269739,驟:-11.386214,蹧:-16.116548,淦:-12.760813,牯:-12.871355,凮:-15.269250,晷:-13.386519,胸:-9.481476,橿:-17.215160,冃:-16.116548,銅:-17.215160,蚍:-13.120815,誕:-11.868053,鈚:-15.423401,蘢:-12.966665,报:-7.623169,訪:-9.938604,嚭:-10.771029,鎯:-10.294489,縲:-12.871355,媵:-15.269250,亽:-16.116548,访:-9.938604,婊:-11.673896,蝌:-12.542331,描:-11.246452,乒:-12.386846,譔:-16.522013,埗:-12.726524,察:-9.807236,俧:-14.270721,裩:-16.116548,遮:-10.420573,糱:-17.215160,孴:-11.135227,葶:-15.135719,惹:-9.833036,佼:-13.659812,衾:-12.542331,茏:-12.966665,悎:-12.749252,眗:-17.215160,咖:-13.604242,笟:-13.477490,增:-9.190953,匯:-10.096334,鰱:-13.882956,綰:-10.761535,憸:-15.269250,瑁:-11.877622,硉:-17.215160,姈:-14.442571,軒:-10.766271,偙:-16.116548,鵛:-17.215160,曢:-13.263916,畫:-12.211214,櫪:-14.270721,韬:-10.940398,祳:-16.116548,廲:-14.912575,鞁:-16.522013,辑:-10.753692,栔:-16.522013,霖:-12.796319,玙:-15.828866,尜:-17.215160,枡:-12.590187,輦:-10.557149,殩:-14.912575,献:-8.937748,骳:-17.215160,朶:-17.215160,躻:-15.605722,款:-9.811490,陀:-10.170255,狃:-17.215160,彆:-17.215160,曋:-17.215160,蹐:-15.423401,櫓:-13.501588,牘:-16.116548,廛:-14.730253,晠:-13.477490,臥:-10.258615,橨:-17.215160,痭:-15.605722,鵲:-11.343042,腺:-11.016681,鈃:-13.882956,疂:-15.423401,嬉:-12.287906,蘋:-14.170638,禊:-15.828866,休:-9.465838,訓:-10.251024,涒:-14.442571,縛:-17.215160,冚:-17.215160,鲜:-9.366226,戣:-11.179679,肤:-11.812483,嘫:-12.682561,锭:-11.425200,璬:-15.135719,餵:-9.515318,碴:-12.858451,主:-7.610213,贽:-13.957064,沼:-12.027774,煅:-13.283334,僄:-16.116548,楕:-17.215160,矖:-13.088026,嵝:-13.551598,顟:-17.215160,濦:-17.215160,灯:-9.075720,叮:-10.944172,摷:-13.957064,苸:-13.040773,桿:-17.215160,眀:-13.453960,邅:-15.135719,笈:-11.968136,蒍:-16.522013,袕:-13.551598,通:-8.042729,粝:-13.343959,悥:-14.037106,咭:-12.273518,醯:-12.561200,簲:-12.011153,墵:-15.828866,薷:-13.996284,覿:-14.124118,呂:-10.374614,緇:-17.215160,塊:-8.398010,蕌:-17.215160,襔:-17.215160,嗗:-10.201245,絜:-14.730253,姟:-12.671865,蛡:-14.507110,慤:-17.215160,啬:-12.858451,绱:-11.598389,奴:-9.946937,拹:-15.605722,倅:-15.605722,鴇:-13.386519,脏:-10.346146,抎:-15.605722,甗:-14.442571,嚖:-16.522013,鎘:-17.215160,螠:-15.423401,洧:-14.507110,亦:-8.072777,讨:-9.505852,鸱:-13.056277,羰:-13.604242,船:-8.250848,掸:-11.968136,癁:-15.828866,铂:-11.491575,穉:-15.828866,寈:-15.423401,飊:-16.116548,湑:-16.116548,俐:-14.730253,賒:-12.784343,齛:-16.116548,烚:-17.215160,荣:-10.116784,擢:-11.755575,睫:-13.604242,棪:-14.817265,闬:-14.270721,筳:-16.522013,潻:-11.799060,跼:-15.828866,馁:-13.631641,劇:-17.215160,閉:-16.522013,亏:-9.849980,膑:-14.442571,昔:-11.081762,餖:-17.215160,刜:-15.828866,锞:-13.025505,两:-6.545949,斩:-9.442828,紮:-13.226176,冱:-17.215160,钳:-11.709829,放:-7.588678,兆:-10.098766,棋:-10.141043,僛:-13.408498,鏝:-15.828866,桠:-12.981054,迥:-11.233746,偰:-17.215160,轺:-14.650211,揽:-10.901612,夁:-16.522013,鰃:-14.124118,唉:-9.423637,蠋:-14.817265,排:-8.958812,瀛:-10.020723,銜:-17.215160,氣:-10.367155,窬:-12.808441,吳:-17.215160,皴:-12.808441,押:-9.889353,罅:-12.280686,廄:-16.116548,釆:-17.215160,歍:-15.017935,跎:-13.120815,杕:-17.215160,驗:-11.128385,陟:-13.813963,痞:-13.688800,佥:-12.295179,懦:-11.947302,繯:-13.688800,差:-8.325852,郰:-17.215160,橷:-14.381947,晿:-16.522013,嶃:-13.303137,麅:-16.522013,認:-9.388717,愐:-17.215160,蚕:-11.264517,崘:-16.116548,鸚:-13.501588,訢:-14.037106,溥:-13.244868,媭:-16.522013,爲:-12.609990,讷:-11.937045,渺:-12.609990,螿:-15.269250,婂:-10.880106,齄:-15.423401,寗:-14.037106,鳙:-10.236015,獜:-16.522013,域:-10.190511,裡:-15.828866,潤:-13.323340,蓩:-13.343959,孬:-13.172109,烱:-16.116548,泹:-17.215160,葾:-17.215160,帅:-10.536818,炆:-12.109215,墖:-13.453960,鶘:-13.659812,真:-7.312273,挧:-13.996284,薨:-13.477490,弯:-9.601835,週:-8.188022,熰:-17.215160,谹:-16.522013,涸:-12.682561,硁:-15.017935,髂:-13.172109,瑉:-17.215160,恑:-17.215160,苒:-14.730253,屙:-12.737823,绚:-15.017935,赣:-10.668375,祫:-14.079666,曪:-12.551721,慻:-17.215160,仺:-13.226176,菼:-16.522013,鮁:-13.718652,傇:-16.522013,栌:-14.219428,搔:-11.437508,倜:-13.919323,霞:-11.189294,殡:-13.526281,枩:-12.911095,缮:-11.685731,厱:-15.828866,隳:-13.283334,侹:-16.116548,芻:-12.871355,朾:-14.507110,驀:-13.303137,练:-8.873035,陈:-8.581785,櫋:-15.605722,低:-7.566307,艐:-17.215160,曓:-16.116548,繘:-11.624173,針:-17.215160,代:-8.410385,晨:-11.086110,秭:-15.828866,剰:-11.320757,酲:-15.605722,痵:-14.324788,乸:-15.605722,懽:-14.324788,嬁:-13.386519,禂:-15.423401,圉:-12.693371,疊:-10.397329,憒:-13.813963,爛:-14.270721,嶚:-17.215160,渣:-11.196567,锵:-12.871355,悼:-12.505630,峄:-13.303137,鏆:-12.317320,迎:-8.801329,敕:-10.455905,顗:-15.605722,兝:-17.215160,矞:-13.781173,揦:-17.215160,忮:-16.116548,鋰:-11.826088,桷:-14.817265,軸:-17.215160,笀:-12.808441,徃:-11.989413,鲅:-13.718652,眈:-14.037106,袍:-10.029016,蒕:-14.170638,弘:-12.121410,炝:-12.749252,蠢:-11.437508,沥:-12.561200,墭:-14.270721,鶯:-11.437508,瀲:-16.522013,咵:-15.605722,覷:-15.828866,氺:-17.215160,告:-8.989122,襌:-16.116548,淏:-16.116548,姗:-13.577574,煜:-12.470228,嗟:-11.407018,諡:-11.256735,蛩:-12.378878,鹮:-14.124118,狱:-10.471101,滹:-15.135719,虾:-9.978821,尅:-14.576103,贏:-16.116548,溎:-16.522013,媖:-14.576103,生:-7.190384,讠:-14.324788,愧:-11.351529,螨:-11.521428,崯:-14.650211,现:-8.162527,踹:-11.485060,寀:-13.631641,癉:-16.116548,铊:-13.137623,扑:-8.798893,胒:-17.215160,幙:-12.133756,鍛:-10.258615,筫:-12.103172,駬:-16.522013,睳:-12.033376,间:-7.144803,捻:-10.814903,臼:-12.073496,嚇:-14.507110,醉:-9.755821,渌:-12.056105,薑:-15.605722,戔:-14.324788,嘜:-17.215160,鄞:-14.324788,涡:-11.872826,蔦:-15.605722,憩:-13.477490,鲫:-12.661283,礮:-13.847864,喱:-15.135719,邳:-12.858451,洶:-14.730253,蒻:-16.116548,愾:-15.828866,鱀:-14.219428,磃:-15.269250,商:-8.958553,泋:-16.522013,惓:-15.605722,池:-10.057425,该:-6.976022,恨:-8.886951,呰:-10.859052,珵:-13.551598,譺:-13.781173,柽:-14.817265,崁:-15.605722,頃:-14.270721,儉:-13.781173,谋:-9.619773,耓:-14.381947,枒:-13.010467,琛:-10.846973,定:-7.542218,障:-11.620449,誤:-17.215160,尫:-17.215160,纬:-10.852132,犴:-14.442571,蜽:-13.996284,筅:-14.037106,嫄:-14.170638,闆:-11.514716,潍:-13.501588,仌:-16.522013,觎:-15.605722,捕:-9.560243,鹗:-12.056105,坝:-10.391874,虧:-9.849980,旦:-11.264517,姮:-13.154717,铰:-12.309885,裸:-11.077433,承:-8.190186,紀:-16.116548,妃:-9.402377,骅:-15.135719,躍:-16.522013,皝:-12.204525,踢:-9.211129,航:-10.237879,庭:-10.936639,瘲:-14.912575,劵:-16.522013,樺:-10.707882,幂:-12.551721,魄:-11.609358,矇:-12.858451,削:-9.963106,每:-7.047464,荔:-13.154717,志:-9.008031,飙:-12.952480,睜:-16.116548,叟:-12.671865,賡:-14.124118,此:-6.570235,胩:-13.577574,彬:-10.644277,瓱:-17.215160,却:-6.190842,棹:-12.995652,聾:-11.609358,娅:-12.995652,震:-9.241316,璆:-14.912575,不:-4.420382,梎:-16.522013,缗:-12.704301,岖:-17.215160,馘:-15.269250,傞:-11.259323,朧:-12.715350,膨:-11.360088,疰:-17.215160,伷:-16.522013,蠹:-12.295179,榸:-14.730253,籁:-13.263916,灉:-12.772509,凈:-15.017935,摑:-12.938494,蛒:-15.423401,塙:-15.605722,镛:-15.269250,竚:-17.215160,滢:-15.269250,煳:-12.419369,鏴:-13.919323,敻:-15.423401,蟼:-14.817265,龁:-15.135719,咇:-16.522013,鎉:-14.730253,氌:-16.522013,怔:-9.315265,箙:-12.784343,吜:-16.116548,錞:-13.154717,澡:-11.968136,掩:-9.844300,笮:-12.551721,垱:-9.871087,銳:-17.215160,漶:-16.522013,挾:-17.215160,鹀:-16.116548,竃:-16.522013,坆:-15.135719,鉈:-13.137623,滋:-10.721406,虐:-12.191280,拓:-11.650640,四:-7.358240,湠:-16.522013,觥:-12.109215,緭:-15.017935,噰:-13.996284,镲:-15.423401,旽:-17.215160,弁:-11.882441,騃:-16.522013,熊:-9.890670,舓:-15.269250,瘛:-12.650812,钜:-13.343959,樣:-9.465838,袤:-14.576103,師:-12.378878,鴭:-16.522013,粬:-9.931025,刳:-14.730253,炴:-11.705772,蔽:-11.821532,撼:-12.085261,祅:-14.912575,壄:-14.324788,浍:-13.996284,诎:-13.303137,慕:-11.249013,鱗:-16.522013,啝:-15.605722,珞:-9.856966,柦:-14.170638,硯:-11.462587,寮:-9.991135,汷:-14.037106,俶:-13.154717,諸:-17.215160,恿:-12.671865,缀:-11.407018,它:-6.198763,颅:-12.039010,例:-9.294714,朐:-13.453960,肕:-17.215160,璝:-13.631641,传:-7.940531,谢:-9.389515,梥:-17.215160,耪:-13.189808,岭:-9.140511,琲:-16.116548,債:-16.522013,趷:-16.522013,膿:-11.524801,层:-8.481405,饄:-13.882956,症:-10.006560,偊:-16.116548,赌:-10.231370,腔:-10.135134,巗:-17.215160,髙:-15.828866,畜:-10.725955,楤:-17.215160,嵬:-13.430970,驮:-10.963256,盱:-15.423401,兴:-8.850186,蹶:-13.408498,櫹:-16.522013,艾:-10.722920,堅:-16.522013,锇:-13.189808,皆:-8.291036,檎:-15.135719,紗:-16.522013,庖:-11.942160,办:-7.973903,攧:-14.576103,莨:-14.219428,夯:-11.677826,阱:-14.381947,瞰:-14.124118,繁:-10.130934,鳂:-15.423401,又:-5.291789,郊:-10.980749,晑:-17.215160,靛:-11.060302,磚:-17.215160,乡:-7.716038,波:-8.988319,惪:-16.522013,哲:-10.969053,杻:-15.605722
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/idf.utf8 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/idf.utf8
new file mode 100644
index 0000000000..4ca9cecfc1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/idf.utf8
@@ -0,0 +1,258826 @@
+劳动防护 13.900677652
+生化学 13.900677652
+奥萨贝尔 13.900677652
+考察队员 13.900677652
+岗上 11.5027823792
+倒车档 12.2912397395
+编译 9.21854642485
+蝶泳 11.1926274509
+外委 11.8212361103
+故作高深 11.9547675029
+尉遂成 13.2075304714
+心源性 11.1926274509
+现役军人 10.642581114
+杜勃留 13.2075304714
+包天笑 13.900677652
+贾政陪 13.2075304714
+托尔湾 13.900677652
+多瓦 12.5143832909
+多瓣 13.900677652
+巴斯特尔 11.598092559
+刘皇帝 12.8020653633
+亚历山德罗夫 13.2075304714
+社会公众 8.90346537821
+五百份 12.8020653633
+两点阈 12.5143832909
+多瓶 13.900677652
+冰天 12.2912397395
+库布齐 11.598092559
+龙川县 12.8020653633
+银燕 11.9547675029
+历史风貌 11.8212361103
+信仰主义 13.2075304714
+好色 10.0088573539
+款款而行 12.5143832909
+凳子 8.36728816325
+二部 9.93038573842
+卢巴 12.1089181827
+五百五 13.2075304714
+畅叙 11.598092559
+吴栅子 13.2075304714
+智力竞赛 13.900677652
+库邦 13.2075304714
+非正义 11.3357282945
+编订 10.2897597393
+悲号 12.8020653633
+陈庄搭 13.2075304714
+二郎 9.62401153296
+电光石火 11.8212361103
+抢球 11.9547675029
+南澳大利亚 10.9562386728
+失散多年 12.5143832909
+有理有据 10.9562386728
+盈利 5.72260018813
+弗龙堡 13.900677652
+悚然 10.604840786
+查吓 13.2075304714
+滕县 10.9049453784
+毛瑟枪 12.2912397395
+好花 11.2616203224
+潮州人 13.900677652
+头羊 11.5027823792
+提足 12.5143832909
+书款 12.2912397395
+嗤之以鼻 10.642581114
+代金券 11.9547675029
+公共财产 11.4157710022
+文化素质 10.765183436
+口称 10.0505300503
+聚异丁烯 12.1089181827
+终南山 10.4349417492
+东安动力 10.2630914922
+集训营 13.2075304714
+截留 9.94943393339
+热烈欢迎 9.91169360541
+岗亭 11.598092559
+浑球 13.900677652
+让座 10.4349417492
+迁户 13.2075304714
+布尔热 12.5143832909
+绣花针儿 11.598092559
+二通 11.8212361103
+滑雪运动 11.7034530746
+程颢 10.3743171274
+五百万 10.9049453784
+旱荒 12.5143832909
+标准线 13.900677652
+时后梁 12.2912397395
+外备 12.5143832909
+绝对权 13.2075304714
+蕉麻 11.5027823792
+黎刹 12.2912397395
+二十余年 10.0720362555
+好苦 10.8096351986
+镇心 11.598092559
+残茬 11.598092559
+从界岭 12.1089181827
+国际经济组织 11.8212361103
+五百两 9.94943393339
+后手 11.3357282945
+广播公司 10.0720362555
+诞生地 10.533381822
+二遍 10.8561552143
+遂溪 12.1089181827
+五百个 10.8096351986
+不知高下 13.900677652
+盈动 11.9547675029
+程颐 9.89334446674
+外头 7.76079309975
+二道 9.43476953332
+外夷 11.0103058941
+喷洒车 13.2075304714
+过会芳 13.2075304714
+含金量 9.72629038208
+外壁 10.7226238216
+运猪 13.900677652
+伶俐 9.5186510173
+滑来滑去 13.2075304714
+四轮驱动 10.9562386728
+多病 9.75754292558
+时至今日 8.81308131674
+卖火柴 12.1089181827
+后接 12.5143832909
+发射器 8.52078029844
+迭宕 13.900677652
+索尼 9.6811699468
+鹿角霜 12.8020653633
+双日 11.5027823792
+用之不竭 10.8561552143
+诊病 11.1280889297
+职能 6.70924832194
+军民联欢 13.900677652
+周迥 13.2075304714
+策源地 10.5684731418
+后掌 12.8020653633
+奸夫淫妇 12.5143832909
+北五祖 11.8212361103
+分析仪器 11.0103058941
+加州大学 11.1926274509
+服用者 12.2912397395
+付出代价 10.0505300503
+小兴安岭 9.5186510173
+暴涨暴跌 9.89334446674
+额窦 12.5143832909
+库里 10.2117981979
+和良渚 12.5143832909
+后排 8.81927328699
+张羽 11.1280889297
+落脚点 10.4349417492
+多会儿 11.9547675029
+地动仪 11.9547675029
+外境 12.2912397395
+进贤县 13.2075304714
+冰塔 12.8020653633
+乳腺 9.25628675283
+漆绘 12.2912397395
+尤尔弗 13.900677652
+岗位 7.86519621945
+诊疗 9.15574552361
+万公斤 11.2616203224
+救下来 11.7034530746
+折梅 12.8020653633
+虎口脱险 11.9547675029
+蜜蜂 8.78868986362
+长角牛 12.1089181827
+平滑肌 9.4233408375
+外墙 10.3743171274
+斯坦贝克 11.4157710022
+后援 10.8096351986
+多疑 9.25628675283
+大水沟 13.2075304714
+光机所 13.900677652
+王治朝 13.2075304714
+孤行 12.5143832909
+诉讼法 9.37888907493
+奥运会 8.16733637508
+会合点 11.7034530746
+票子 9.48183704418
+二重 10.0505300503
+声全息图 13.900677652
+胡正卿 12.1089181827
+教学进度 13.900677652
+人证物证 11.5027823792
+算进来 12.8020653633
+积雨云 11.0674643079
+人微言轻 11.3357282945
+开路先锋 11.3357282945
+董琬 12.8020653633
+梁父吟 12.2912397395
+两百二十册 13.2075304714
+傅大人 11.2616203224
+张家辉 13.900677652
+百米 9.02548032877
+连遭败绩 12.8020653633
+暴发户 9.87532596124
+多留 10.0088573539
+分宜 12.2912397395
+汝可先 12.2912397395
+宇文泰和 12.5143832909
+五百余 10.4666904475
+寒潮 9.05649056552
+大水池 12.5143832909
+陈循 13.900677652
+多番 11.9547675029
+旱船 11.7034530746
+十一名 11.9547675029
+慢条斯理 9.91169360541
+卢尔 13.2075304714
+高低杠 11.5027823792
+海西州 13.2075304714
+官腔 10.3743171274
+求贤若渴 11.9547675029
+日喀则市 11.4157710022
+多种营养 12.2912397395
+新老交替 13.2075304714
+手牵着 11.0674643079
+书橱 11.2616203224
+情郎 11.7034530746
+江陵县 10.4349417492
+通布卡 13.900677652
+医药卫生 10.2117981979
+渭川千亩 13.900677652
+莫恰洛 12.5143832909
+房舱 13.2075304714
+冰壁 10.4349417492
+焦庄户 12.8020653633
+既想 11.7034530746
+就业结构 11.9547675029
+人类学 8.81308131674
+潭州 10.4666904475
+训练班 9.71102290995
+骚动 8.61241062128
+鸿业 11.5027823792
+今年底 8.78868986362
+好菜 11.1280889297
+小亚丁 13.900677652
+店伙 12.8020653633
+马鞭 9.66657114738
+高负荷 13.900677652
+房舍 8.96620371885
+悲剧 7.55855623325
+缅甸 7.81390292506
+泌尿器官 13.900677652
+免罚 13.900677652
+总商会 11.4157710022
+口喊着 13.2075304714
+截球 13.2075304714
+最省 12.1089181827
+减薪 10.642581114
+辛丑和约 12.2912397395
+外寇 13.2075304714
+躲藏着 12.5143832909
+浮来 13.2075304714
+莫尔耶 13.900677652
+撒手不管 10.4994802703
+卢循 12.1089181827
+枯木朽株 13.900677652
+卢德 12.1089181827
+多盘 12.2912397395
+幽期密约 13.900677652
+花生饼 12.8020653633
+斯堪尼亚 13.2075304714
+易中天 13.2075304714
+左膀 13.900677652
+多目 12.8020653633
+郎咸平 11.0103058941
+赏月 10.0505300503
+寒威 12.5143832909
+贺兰 10.7226238216
+邪风 12.5143832909
+好者 13.900677652
+蒋御史 13.900677652
+多相 10.2630914922
+古观象台 11.7034530746
+好耍 11.0103058941
+老谋深算 10.4041700905
+后悔 7.32142643997
+游嬉恰 13.900677652
+伤心落泪 10.9049453784
+韩非则 13.2075304714
+服用药 13.2075304714
+格林卡 11.5027823792
+正话 10.8561552143
+叶碧秋 8.49350588052
+姜丝排 12.5143832909
+贺卡 12.1089181827
+拖住 9.21854642485
+悲凄 11.0674643079
+葛翠琳 13.900677652
+吴景超 12.1089181827
+银灯 13.2075304714
+悲凉 9.35738286971
+外客 12.1089181827
+外宣 10.9049453784
+情报搜集 11.598092559
+狗仔队 13.2075304714
+裁汰 10.7226238216
+位于下面 13.2075304714
+子禄父 12.1089181827
+埃弗里 12.5143832909
+乌尔斯 13.2075304714
+外宾 10.5684731418
+外宿 13.900677652
+咱村 9.96885201925
+从宽处理 11.9547675029
+赊贷 11.3357282945
+免纳 11.7034530746
+蜕壳激素 13.900677652
+表意文字 12.1089181827
+趁心如意 13.900677652
+悲叹 10.604840786
+人所共知 10.0088573539
+家电企业 10.3743171274
+距离处 11.9547675029
+风情万种 10.8561552143
+外存 12.5143832909
+外孙 9.85762638414
+梅里威 13.2075304714
+亚圣 12.1089181827
+周至县 11.5027823792
+采编部 13.900677652
+怀特河 13.2075304714
+外学 11.7034530746
+马八儿 12.2912397395
+圣路易斯 10.2630914922
+合线期 13.900677652
+凿井 10.6818018271
+联贯性 13.900677652
+冰室 13.2075304714
+显身手 12.5143832909
+后怕 9.91169360541
+赏析 12.1089181827
+瓦德希 13.2075304714
+卢彦 13.900677652
+切齿痛恨 11.4157710022
+不惜一战 13.900677652
+千百万 10.0720362555
+战斗分队 12.2912397395
+夜壶 10.9562386728
+古巴共和国 13.2075304714
+缘薄 13.900677652
+麦禾 12.8020653633
+毋须 11.5027823792
+测试者 12.2912397395
+乌巢劫 13.2075304714
+吃大户 11.2616203224
+平城南 13.900677652
+风风光光 11.4157710022
+镇巴 12.5143832909
+江三公子 13.2075304714
+拨乱反正 10.3171587135
+戒酒 10.4349417492
+一千五百多名 13.2075304714
+好胜 11.5027823792
+多瘦 13.2075304714
+最矮 12.5143832909
+铺设 8.68574189437
+最短 9.28555713513
+标准粉 13.2075304714
+折款 13.900677652
+房脊 11.598092559
+信奉者 11.5027823792
+绝对数 11.0674643079
+鸡冠花 11.8212361103
+坏血酸 13.900677652
+外嫁 13.900677652
+萝北 12.5143832909
+张泽咸 12.2912397395
+空置率 11.0674643079
+款洽 13.900677652
+恩仇记 13.2075304714
+拖上 11.598092559
+拖下 12.8020653633
+好脸 13.2075304714
+投河自尽 11.7034530746
+博蒙 12.8020653633
+张高丽 12.8020653633
+欢音 12.8020653633
+方方正正 10.8096351986
+私人教师 11.7034530746
+医务部 12.8020653633
+慢点 10.6818018271
+马宅 11.7034530746
+查哨 11.8212361103
+零所 13.2075304714
+海关检查 12.5143832909
+弗雷泽 11.598092559
+血糖仪 12.2912397395
+民航机场 11.598092559
+异端邪说 11.8212361103
+既成 11.0103058941
+吹风会 11.0674643079
+活字版 11.9547675029
+黄风吹 13.2075304714
+多石 12.2912397395
+朴不花 12.5143832909
+广南西 11.5027823792
+叶祖 11.1926274509
+姊妹花 11.5027823792
+萝卜 8.6803218269
+陇海路 9.93038573842
+刁羊 11.9547675029
+供办 12.8020653633
+二千五百元 13.900677652
+地图更新 13.900677652
+天津市委 10.9562386728
+三四百斤 12.1089181827
+百忙之中 10.9562386728
+没前途 12.1089181827
+刑讯 11.8212361103
+百级 13.900677652
+高得幸 13.2075304714
+受贿者 12.2912397395
+普通住宅 10.2117981979
+枪打出头鸟 13.2075304714
+树皮画 12.8020653633
+强弩之末 10.1164880181
+铸造蜡 13.900677652
+咽喉 8.22392384971
+阮大人 12.8020653633
+暴发性 11.598092559
+保险制度 10.7226238216
+另行通知 12.2912397395
+韩世昌 12.2912397395
+外套 9.20932976975
+多着 12.5143832909
+空穴 10.1871055853
+扫黄办 13.2075304714
+祖白圭 12.8020653633
+公平交易 9.69598503258
+牵过来 11.8212361103
+刑警 11.1280889297
+陈求发 12.8020653633
+贾政问 12.8020653633
+立体声 10.642581114
+卢布 9.62401153296
+智能网 13.2075304714
+左臂 9.31571017331
+娄室之 13.2075304714
+卢帕 13.2075304714
+杜若 12.2912397395
+郭攸之 12.5143832909
+兄友弟恭 12.5143832909
+容星桥 13.2075304714
+萨拉班 12.8020653633
+下流无耻 13.900677652
+桑德斯 12.8020653633
+二人同心 13.900677652
+文崔二 12.5143832909
+自误 11.8212361103
+多看 9.75754292558
+宁王 11.3357282945
+玉华王 11.9547675029
+不饱和 9.16447920358
+慢火 11.598092559
+王秀兰 12.8020653633
+书档 13.2075304714
+耐压性 13.900677652
+截瘫 11.7034530746
+宁玛 12.1089181827
+户主 10.6818018271
+易舟浮 13.2075304714
+穆然城 13.2075304714
+对话会 13.2075304714
+海蜇头 13.900677652
+多眼 11.1926274509
+书案 9.49395840471
+握力 13.2075304714
+书桌 9.87532596124
+遮面 13.2075304714
+内廷紫 13.2075304714
+八节 11.598092559
+袁姑爷 10.4349417492
+零散 9.33632946051
+编过 12.5143832909
+国台办 11.5027823792
+蓝孔雀 13.2075304714
+库银 13.900677652
+同翅目 10.8096351986
+零数 11.9547675029
+上海滩 10.4666904475
+正表 13.900677652
+黎国 13.900677652
+电焊条 12.8020653633
+二钱 11.0674643079
+交通违章 12.2912397395
+五卅运动 10.0940151622
+贡二水 12.8020653633
+蜜色 13.900677652
+以远 11.9547675029
+百科 10.1630080337
+左舷 12.1089181827
+新媳妇 9.85762638414
+外差 11.9547675029
+竞争性 9.62401153296
+编述 12.5143832909
+孤负 12.5143832909
+百种 9.61021821083
+杨炎官 13.2075304714
+每下愈况 13.900677652
+博莱 12.2912397395
+少数整 12.8020653633
+宗羲 12.2912397395
+新疆省 10.9049453784
+由近而远 12.8020653633
+镇子 9.28555713513
+丽丽 9.87532596124
+靳祥 12.8020653633
+类型学 11.2616203224
+小象虫 13.2075304714
+烈女传 13.2075304714
+史志宏 11.8212361103
+四十六次 13.2075304714
+编辑 6.28685896717
+黑白两道 11.598092559
+交换条件 11.0103058941
+立体式 12.8020653633
+发射区 11.8212361103
+广陵派 13.2075304714
+卢姆 12.1089181827
+国务院法制办 11.1926274509
+租下来 13.2075304714
+私生活 10.533381822
+山竹子 13.2075304714
+神使鬼差 13.900677652
+卢世荣 12.2912397395
+任姓挚 13.2075304714
+试述 13.900677652
+多点 8.86372504956
+诱导酶 13.900677652
+阿旃陀 10.9049453784
+夏耘 13.900677652
+王爵封 13.2075304714
+哈飞公司 13.2075304714
+院校 8.81927328699
+养阴 10.7226238216
+个性特点 12.5143832909
+第十七个 13.900677652
+第二十六章 10.5684731418
+潘公凯 13.900677652
+镇定 8.37124856446
+争嘴 13.900677652
+专题讲座 12.2912397395
+女追男 13.900677652
+镇宅 11.4157710022
+感受一下 11.3357282945
+零时 9.14708746087
+资源税 10.2117981979
+项怀诚 12.8020653633
+王立武 13.2075304714
+镇安 10.4041700905
+镇守 8.38724890581
+一筐 10.7226238216
+够格 12.5143832909
+脉动 9.98865464655
+级别 7.50541605386
+竟陵 10.7226238216
+全国学联 12.2912397395
+贺喜 9.38981814546
+宝钗素 12.2912397395
+多灾 11.598092559
+萨克森 9.45802639549
+杨国强 13.2075304714
+几十艘 13.900677652
+严防 9.56994431169
+元老级 11.8212361103
+票庄 13.2075304714
+足球界 11.8212361103
+洮南 11.9547675029
+双力 13.2075304714
+后景 12.8020653633
+截然 9.05649056552
+照耀 8.67493097826
+来江州 12.5143832909
+丽人 11.1926274509
+用途林 12.8020653633
+戒面 13.900677652
+上海港 10.2371160058
+昏昏欲睡 10.6818018271
+八艘 11.9547675029
+撸子 12.8020653633
+开门见山 9.59661255877
+卢奇 12.1089181827
+慢着 10.533381822
+欢送 10.604840786
+不作美 13.900677652
+斯海姆 12.8020653633
+合作局 13.2075304714
+丽亚 12.2912397395
+上海电影制片厂 10.2630914922
+川东南 11.598092559
+布特莱齐 13.900677652
+拉栖第 10.3743171274
+明铁盖 12.2912397395
+主掌 11.7034530746
+脱氧核糖核酸 10.1164880181
+阿拉斯加 9.13850371718
+乌孙王 11.9547675029
+塑胶管 12.8020653633
+落马洲 13.2075304714
+历经沧桑 12.5143832909
+羊背石 11.4157710022
+姑父 9.72629038208
+姑爹 13.2075304714
+桂林人 12.2912397395
+张廷玉 11.0674643079
+二十余家 12.5143832909
+玎珰 13.900677652
+冰封 9.77354326693
+四出戏 13.900677652
+海蚀台 13.2075304714
+群而不党 13.900677652
+鲁比亚 12.8020653633
+输送泵 13.2075304714
+老街区 13.2075304714
+千态万状 13.900677652
+铭心镂骨 12.5143832909
+查克 12.2912397395
+陈女士 10.4994802703
+达官显宦 12.8020653633
+人才流 13.900677652
+适量水 13.2075304714
+黑娃 8.0985592766
+光纤网 13.900677652
+傲雪凌霜 13.900677652
+潭头 12.8020653633
+电抗器 11.5027823792
+后果 7.19748953873
+牛山湖 12.8020653633
+警报系统 11.9547675029
+为民除害 10.765183436
+应明辨 12.8020653633
+喝进去 12.2912397395
+李老爷 11.598092559
+寒冬腊月 11.2616203224
+冰屑 11.9547675029
+多媒体信息 12.8020653633
+美国纽约大学 11.1926274509
+非常容易 10.0505300503
+解放军部队 12.1089181827
+复旦大学 8.79473217808
+冰层 9.28555713513
+二间 12.8020653633
+仪器仪表 9.56994431169
+远亲近友 13.2075304714
+变幻莫测 10.4994802703
+劲风 11.0103058941
+外岛 12.2912397395
+厚脸皮 13.900677652
+奥威尔 12.8020653633
+信息处理 9.43476953332
+冰山 9.29550746599
+几十箱 13.2075304714
+老少爷们儿 13.2075304714
+贩贱卖贵 13.900677652
+非她不可 13.2075304714
+成仙成 13.2075304714
+夏历 9.71102290995
+最灵 11.3357282945
+投资银行业 12.8020653633
+四时之气 13.900677652
+外层 8.83808261895
+长春电影制片厂 11.1926274509
+张维 11.598092559
+李虞候 11.7034530746
+上海大众 9.34680076038
+冰岛 9.12155415886
+过磷酸 13.2075304714
+外屋 10.642581114
+小角色 12.1089181827
+默不作声 10.0505300503
+服罪 11.9547675029
+查出 8.40350942668
+哑巴亏 11.9547675029
+防雷击 13.900677652
+雅鲁藏布江 8.97342396682
+分清主次 13.900677652
+混起 13.900677652
+后有 11.0674643079
+海瑞罢官 11.0674643079
+中饱私囊 11.4157710022
+尼科西亚 12.1089181827
+朱三松 12.5143832909
+后期 6.18778669049
+画眉鸟 12.1089181827
+洞鉴 12.2912397395
+刑赏 11.8212361103
+宇文泰嗣 12.8020653633
+和平解决 9.32596667347
+中草药 9.28555713513
+一站式 10.0720362555
+不怕困难 12.5143832909
+标准箱 11.2616203224
+后来 4.99211827683
+心细 10.5684731418
+戒除 10.9049453784
+八荒 12.8020653633
+刑责 12.5143832909
+电信业 11.0103058941
+帅营 13.900677652
+逗乐 11.0103058941
+固溶体 10.642581114
+玄稽沉 13.2075304714
+情夫 13.2075304714
+减色 11.9547675029
+巴拉那 11.7034530746
+明叔让 12.5143832909
+冰峰 12.2912397395
+最烦 11.8212361103
+待命状态 12.8020653633
+近红外 11.0103058941
+李永芳 12.2912397395
+闸阀 11.9547675029
+快撤 11.7034530746
+宗明昌 12.8020653633
+最热 8.73589167805
+森严壁垒 13.900677652
+千岛群岛 10.6818018271
+技艺 8.0600359946
+激光管 13.900677652
+相当规模 9.82314020807
+极端愚蠢 13.2075304714
+业务室 13.2075304714
+诉讼案 10.2897597393
+杨国平 12.1089181827
+从乐亭 13.900677652
+降霜 13.900677652
+闸门 9.28555713513
+静止 7.98988100794
+几万倍 12.2912397395
+悲喜 11.2616203224
+氦氖激光器 13.2075304714
+后撤 9.40086798165
+既未 11.5027823792
+帝斯 13.900677652
+创立 6.8787012289
+自投罗网 10.3171587135
+二难 11.4157710022
+统战部门 13.900677652
+马小舍 12.2912397395
+团服 13.900677652
+内利斯 11.598092559
+贾政道 9.45802639549
+卢宅 12.8020653633
+八股 9.53122979951
+幻灯机 12.5143832909
+背不住 13.900677652
+中国人民解放军空军 11.1926274509
+拔出去 13.900677652
+王峰 10.642581114
+外快 10.7226238216
+四五千里 13.2075304714
+既有 7.11622058934
+宗社 10.9049453784
+百无一见 13.900677652
+纯棉纱 12.8020653633
+百篇 10.9562386728
+从维熙 12.8020653633
+斯宾诺 13.900677652
+外径 11.0674643079
+童大人 11.0103058941
+市政建设 10.3743171274
+猜谜 11.1280889297
+当代人 12.1089181827
+谄上欺下 13.900677652
+宗祖 12.8020653633
+神农本草经 10.9049453784
+卡波济 13.900677652
+骑马打仗 11.3357282945
+梅斯基 13.2075304714
+减至 9.19114745066
+查到 9.66657114738
+尼泊尔共产党 13.2075304714
+卢寻 13.2075304714
+另起炉灶 11.2616203224
+不可理喻 10.6818018271
+宗祠 10.533381822
+零月 13.2075304714
+未处理 13.2075304714
+少尉 9.85762638414
+情面 10.2897597393
+政法干部 12.5143832909
+高等学府 9.37888907493
+懊悔无及 12.8020653633
+马加比 13.2075304714
+不安全感 11.4157710022
+和启东 13.2075304714
+米勒德 12.8020653633
+民族乐器 10.9049453784
+由合子 13.2075304714
+查勤 13.900677652
+中国篮协 13.900677652
+慢用 12.5143832909
+统战部长 11.9547675029
+二阶 10.2117981979
+韦奇伍 13.900677652
+利润率 7.2673592187
+岸线 8.80692745117
+亿加元 12.5143832909
+地广 12.1089181827
+逆我者死 13.900677652
+南泥湾 11.1926274509
+缘自 11.9547675029
+外形 7.45178825783
+多数三项 13.900677652
+汪若海 11.4157710022
+中国人民解放军三军仪仗队 12.2912397395
+特库蒂 13.2075304714
+欢闹 12.8020653633
+百等 13.2075304714
+风信子 12.5143832909
+查勘 10.2897597393
+如法炮制 11.0103058941
+二队 10.642581114
+坛坛罐罐 11.2616203224
+游览胜地 8.83177344976
+博多湾 13.900677652
+镇委 12.2912397395
+日本东京证券交易所 13.900677652
+从今以后 9.4233408375
+我姐 10.7226238216
+阿弥陀 11.4157710022
+戊子 13.2075304714
+金乌西坠 12.8020653633
+埃努古 13.900677652
+纯如 13.900677652
+冰心 10.4349417492
+姬宗周 13.2075304714
+魏延领 11.8212361103
+外引 13.2075304714
+家电网 12.1089181827
+待物 13.900677652
+杭嘉和 8.39534611604
+千百件 13.900677652
+职蜂 13.2075304714
+外弦 13.2075304714
+悲啼 11.0103058941
+耳边风 12.5143832909
+旱芹 13.900677652
+查办 9.74179456862
+配在一起 12.5143832909
+情韵 11.598092559
+别难过 11.2616203224
+外强 11.7034530746
+文国庆 11.3357282945
+大连市 9.66657114738
+岸礁 11.9547675029
+开发计划署 13.900677652
+反省 9.4233408375
+减肥 8.30225569298
+向父皇 12.8020653633
+宫太后 10.0088573539
+工具书 9.91169360541
+图尔卡纳湖 12.8020653633
+后方 7.57811241205
+血循环 10.604840786
+提供方便 10.5684731418
+百端 11.598092559
+龙的传人 13.900677652
+十五丈 13.2075304714
+目标群体 12.5143832909
+廊房头条 13.2075304714
+多班 13.2075304714
+莫泽尔 13.900677652
+乳状物 13.900677652
+凋残 11.8212361103
+悲咽 12.5143832909
+篾青 13.900677652
+蜜腺 10.533381822
+后文 12.1089181827
+嫡子 10.9049453784
+最爱 8.77671367257
+外延 8.87679713113
+嫡孙 11.9547675029
+米字旗 13.2075304714
+小团体 11.2616203224
+最爽 12.5143832909
+正梳妆 13.900677652
+指甲钳 13.900677652
+借壳上市 9.5062284973
+十大元帅 13.900677652
+后日 9.87532596124
+梦牵魂绕 11.9547675029
+潭子 12.5143832909
+带头羊 13.900677652
+魏末 11.5027823792
+鼎立 10.0294766411
+书法 7.8184587416
+掩其不备 13.2075304714
+林网化 11.598092559
+交流电路 10.9049453784
+古定剑 12.5143832909
+少私寡欲 12.8020653633
+上课时数 13.900677652
+具体化 10.2897597393
+悲哭 11.1926274509
+尖锐湿疣 11.2616203224
+查字法 13.900677652
+技能 8.16733637508
+张勋遂 12.8020653633
+冰库 12.2912397395
+金丸珠 13.900677652
+闯王 5.73730633552
+孤身 10.1630080337
+元代 7.09274270828
+非线性 8.55834340001
+甄夫人 12.8020653633
+而立 8.83177344976
+汇率 6.76658393078
+袁锦 13.900677652
+可预测性 10.642581114
+电热水壶 13.900677652
+后放 12.1089181827
+官晋爵 12.8020653633
+神经衰弱 9.98865464655
+查号 13.900677652
+挣到 10.4041700905
+二十余处 12.8020653633
+养锐 12.5143832909
+战斗能力 11.1280889297
+栽插 12.5143832909
+李亚 10.8561552143
+史张腊 13.2075304714
+绝对性 10.9562386728
+政法委 9.98865464655
+日积月累 10.4666904475
+秒杀 8.57766767284
+言之士 12.8020653633
+不死不活 11.7034530746
+博耶 12.5143832909
+山药蛋 12.5143832909
+鳖精 13.900677652
+有用之才 11.8212361103
+李岩惊 13.900677652
+外币 8.70772080109
+马雅 13.900677652
+消息面 8.11685246965
+金融债权 12.8020653633
+丘伦梅 13.900677652
+马鲁穆 13.900677652
+猛吃 11.1926274509
+广南路 13.2075304714
+乡土观念 11.8212361103
+浩然之气 12.8020653633
+太冲 9.23723855786
+唐复名 12.5143832909
+雷阵雨 10.9562386728
+自外而内 13.900677652
+亿千瓦 9.33632946051
+师道尊严 12.2912397395
+单家独户 12.5143832909
+口出怨言 11.1926274509
+外带 10.6818018271
+石渠阁 11.7034530746
+达生 13.900677652
+滕哈 13.2075304714
+二万二千八百七十七卷 13.900677652
+寒露风 12.1089181827
+卢峰 12.2912397395
+尿素氮 10.642581114
+京石高速公路 13.2075304714
+相对数 11.8212361103
+票券 13.2075304714
+寒江 12.5143832909
+二踢脚 12.5143832909
+百余人 9.58318953844
+地中衡 13.2075304714
+廖萦卫 10.3453295905
+梁保华 13.2075304714
+宗真 13.2075304714
+鸡屁股 12.8020653633
+多糖 9.66657114738
+五十三年 11.3357282945
+洛拉尔 11.9547675029
+各项事业 10.8561552143
+七端 13.900677652
+最紧 12.8020653633
+归元寺 12.8020653633
+继续抓好 12.1089181827
+但慧英 13.2075304714
+腼腆 9.24671730182
+二颗 12.2912397395
+酒池肉林 12.1089181827
+密度 6.99192287266
+被判赔 13.900677652
+托尔普 12.5143832909
+外出 8.00903344015
+拉夫斯 13.2075304714
+百病 10.0720362555
+亿多立方米 11.0103058941
+苯丙氨酸 10.765183436
+金古符 12.5143832909
+立体化 11.0103058941
+富冠三 13.2075304714
+马黑麻 13.900677652
+啤酒花 10.5684731418
+第一一五回 13.2075304714
+趣剧 13.900677652
+平稳过渡 9.96885201925
+饶平县 12.8020653633
+易如 13.900677652
+查尼 11.7034530746
+布拉戈维申斯克 12.8020653633
+萨瓦伊 13.900677652
+烈军属 13.900677652
+小钦岛 12.2912397395
+空中交通 11.9547675029
+外军 11.5027823792
+百余件 12.2912397395
+多粒 12.2912397395
+表面现象 10.4994802703
+仁民 12.8020653633
+各有胜负 12.2912397395
+共和国 6.95562658825
+野草闲花 12.2912397395
+山结营 12.8020653633
+争先 9.85762638414
+查封 9.31571017331
+离间计 12.2912397395
+政协主席 11.5027823792
+死伤枕藉 12.1089181827
+意大利 6.24009219027
+扛扛抬抬 13.2075304714
+真叶 11.9547675029
+一泻而下 12.5143832909
+查尔 11.598092559
+啤酒节 12.2912397395
+老把式 11.9547675029
+二里 9.5186510173
+百余个 11.4157710022
+五谷杂粮 11.1926274509
+岸炮 12.1089181827
+胜任 9.31571017331
+乌猿 12.8020653633
+杰伊汉 13.2075304714
+票务 10.9562386728
+莉雅 13.900677652
+高交会 11.3357282945
+龙亚目 11.7034530746
+冰冰 11.5027823792
+微粒子 12.1089181827
+冰冷 8.34771806705
+冰冻 9.41204128224
+托尔曼 13.2075304714
+任务艰巨 10.9562386728
+百余万 10.604840786
+法西斯化 12.5143832909
+比赛馆 12.8020653633
+冰冠 12.1089181827
+受教育者 11.0103058941
+遂曰 12.2912397395
+多类 11.7034530746
+玄远之 13.2075304714
+马中赤 13.900677652
+多米 8.35160156708
+某方 13.900677652
+烟花节 13.900677652
+款曲 12.8020653633
+王顾左右而言他 11.8212361103
+孤臣 11.7034530746
+王耶律 13.2075304714
+辐射量 10.2371160058
+二顷 12.2912397395
+亡国论 12.1089181827
+减轻 6.89307703802
+割弃 12.2912397395
+安眠 10.5684731418
+弱不禁风 10.9562386728
+养驯 13.900677652
+冰凌 10.2371160058
+养马 10.4041700905
+程邃 12.5143832909
+三十七员 13.2075304714
+成群作队 13.900677652
+冰窟窿 11.0674643079
+普鲁土 11.9547675029
+门诊费 13.2075304714
+骚客 11.8212361103
+吃眼前亏 11.7034530746
+效用 8.62256299275
+刑者 11.8212361103
+微管 10.7226238216
+高低温 11.3357282945
+查岗 13.2075304714
+庚辰 12.8020653633
+放线菌 10.1630080337
+罗源县 13.900677652
+费莱克 13.900677652
+惟命是听 12.5143832909
+电热水器 11.9547675029
+八辈 11.1926274509
+破门而出 12.8020653633
+人多 8.3555002075
+长崎市 11.8212361103
+书报 10.604840786
+陈宝琛 12.5143832909
+横纹肌 10.9049453784
+裸装 13.900677652
+岸然 13.900677652
+后段 10.642581114
+宁神 11.3357282945
+天幸 10.6818018271
+建设部门 12.2912397395
+郭长城 13.2075304714
+白头山天池 10.5684731418
+王徵绘 13.2075304714
+气势不凡 13.2075304714
+假公济私 11.4157710022
+缺乏营养 11.8212361103
+孤老 11.4157710022
+二首 10.8096351986
+人民陪审员 12.5143832909
+每平方米 8.50705010562
+木头木脑 13.2075304714
+白乐天 11.7034530746
+旅游业者 13.900677652
+漆皮 11.3357282945
+竹篱笆 12.1089181827
+病秧子 13.2075304714
+彭其活 13.2075304714
+谭文博 12.1089181827
+杰尔巴岛 13.2075304714
+服玩 13.900677652
+奥古斯 11.598092559
+人类史 11.8212361103
+斯梅尔 13.2075304714
+小银铃 12.2912397395
+克二世 11.7034530746
+水落石出 9.61021821083
+中华儿女 11.1280889297
+八连 11.8212361103
+迷狂 12.8020653633
+达布逊 13.2075304714
+白生生 10.9049453784
+后母 11.598092559
+几十辆 11.8212361103
+龚贤 12.8020653633
+宋州北 13.2075304714
+作风严谨 13.2075304714
+呼之 11.5027823792
+肖厝港 11.9547675029
+古宇田 13.900677652
+悲切 10.4994802703
+具结 12.1089181827
+够早 13.2075304714
+塔夫脱 11.5027823792
+打打停停 12.8020653633
+宗列渠 12.2912397395
+砍除 13.900677652
+嫡嗣 12.5143832909
+好记 12.2912397395
+圣安德烈 11.3357282945
+冷森森 11.1280889297
+萨克旗 12.2912397395
+忏悔书 13.900677652
+书房 7.69611988941
+导购员 13.2075304714
+破门而入 10.8096351986
+夏鼎商彝 13.2075304714
+郝红梅 9.46986085313
+刻骨镂心 13.900677652
+几十载 13.2075304714
+呼集朋 13.900677652
+红外信号 12.8020653633
+匪人 13.2075304714
+差误 12.5143832909
+野狐禅 12.1089181827
+忍气 11.3357282945
+左世雄 13.2075304714
+岗巴县 13.900677652
+职衔 9.71102290995
+现代舞团 13.900677652
+治装 13.900677652
+理论研究室 12.1089181827
+注销 8.85725253506
+高家庄 11.1280889297
+大圣寿 13.2075304714
+惰性 10.1394775363
+金睛火眼 13.2075304714
+镇康 13.2075304714
+说黄道黑 13.900677652
+独树一格 13.900677652
+票号 11.0103058941
+好读 12.2912397395
+白雄尊 13.900677652
+询价 7.47257237929
+秦川牛 12.2912397395
+檀香山 10.2117981979
+单一材料 13.900677652
+最糟 11.3357282945
+平推式 11.0674643079
+半分毫 12.5143832909
+好诗 11.3357282945
+官舱 13.2075304714
+有钱赚 11.9547675029
+好话 8.62256299275
+能干啥 11.9547675029
+卡拉哈里 11.8212361103
+丁夫人 10.642581114
+鹿三和 12.2912397395
+够数 12.5143832909
+宋廷命 13.2075304714
+好评 8.6966709649
+世锦赛 11.0674643079
+萨克斯 10.7226238216
+好词 13.900677652
+外债 8.84443184663
+三十四处 13.2075304714
+各赛区 13.900677652
+凋敝 9.84023464143
+凑在一起 10.5684731418
+安如泰山 12.8020653633
+多组 10.9562386728
+渴得 11.0103058941
+抠门 11.0674643079
+罗纳尔迪 13.900677652
+红豆女 13.2075304714
+杜勃罗 12.8020653633
+蒙古国政府 12.8020653633
+治警 11.7034530746
+花生酱 11.4157710022
+珠宝首饰 10.1394775363
+启封 11.2616203224
+生生世世 12.1089181827
+追回来 11.0674643079
+学学习 12.5143832909
+刘皇后 13.900677652
+甚或 9.87532596124
+后梁 9.63799777493
+清溪镇 12.8020653633
+房角 12.1089181827
+养颜 10.0294766411
+只知其一 10.9562386728
+外史 10.765183436
+宗申 9.48183704418
+梅饰 12.8020653633
+大道理 9.89334446674
+多维 10.6818018271
+牵回去 13.900677652
+挣得 9.84023464143
+缘起 10.0940151622
+地主分子 13.900677652
+外厂 13.900677652
+不可企及 11.7034530746
+深情厚谊 11.8212361103
+塞纳河畔 11.9547675029
+闷子车 13.2075304714
+魏兵分 12.5143832909
+白苔主 13.2075304714
+阔佬 11.3357282945
+唐村 12.8020653633
+梁光烈 11.598092559
+纯收入 9.96885201925
+那陈清 12.5143832909
+马挥刀 12.8020653633
+一万五千二百余 13.2075304714
+啤酒肚 11.9547675029
+速读 12.2912397395
+战略要地 9.56994431169
+阳明堡 13.2075304714
+中超联赛 11.598092559
+晋源区 12.8020653633
+多级 9.33632946051
+洛南县 11.8212361103
+十几公斤 13.900677652
+多线 11.4157710022
+冻结成 11.5027823792
+线或 10.4041700905
+中南工业大学 13.2075304714
+正西 10.7226238216
+弗雷斯 12.8020653633
+新泽西 10.6818018271
+查帐 11.9547675029
+改扩建 9.71102290995
+水溜 13.2075304714
+天晓方 13.2075304714
+大行宫 12.8020653633
+泽田 13.2075304714
+富家女 13.900677652
+多口相声 13.900677652
+燕肃造 13.2075304714
+最美 9.30555780184
+冰原 11.3357282945
+贺客 12.5143832909
+外协 12.5143832909
+中共中央纪律检查委员会 11.8212361103
+逾越节 12.8020653633
+折损 10.0505300503
+条件反射 9.89334446674
+化脓性 9.46986085313
+贺宴 12.8020653633
+错词 13.900677652
+质量第一 12.2912397395
+寨主 9.7898037878
+古泉汇 12.8020653633
+全部内容 10.765183436
+裁撤 9.89334446674
+这一下 8.63281949291
+漆画 11.598092559
+洋品牌 11.7034530746
+减负 10.2630914922
+钻子 13.900677652
+瞒不过 10.0720362555
+帕彼曼 12.8020653633
+技贸 13.2075304714
+姚世安 13.2075304714
+超长 10.533381822
+百眼 9.12155415886
+够晚 12.8020653633
+后桥 11.7034530746
+吉祥物 11.1926274509
+一百岁 11.7034530746
+拓宽渠道 13.900677652
+外化 11.8212361103
+二驾 10.9562386728
+胡晓义 12.8020653633
+俚俗 11.0103058941
+折挫 12.2912397395
+欧罗港 13.900677652
+瑞士航空公司 11.9547675029
+经九纬 12.8020653633
+暝色 13.900677652
+方解石 9.82314020807
+减资 11.0674643079
+窦融归 12.8020653633
+后桅 13.900677652
+今文经学 10.8561552143
+调查部 11.7034530746
+贝利亚尔 13.2075304714
+查府 13.2075304714
+恭请 10.1394775363
+哈夫拉 12.5143832909
+诉讼权 12.1089181827
+应用服务 11.4157710022
+何必当初 11.4157710022
+查库 13.900677652
+归为此类 13.900677652
+汇编 8.78868986362
+泄题 13.900677652
+镇吐 13.900677652
+揉搓 9.6811699468
+胸罗万象 13.900677652
+唐人谓 13.2075304714
+效益 7.23754495598
+宗统 11.7034530746
+冰刀 11.7034530746
+体力劳动 9.31571017331
+修车 10.0088573539
+黎姿 12.8020653633
+中低层 12.5143832909
+提倡者 11.8212361103
+活版印刷 12.8020653633
+百盛 10.2897597393
+外勤 13.2075304714
+棕刚玉 13.900677652
+年深日久 10.6818018271
+峻拔 12.1089181827
+蒸汽机车 10.8096351986
+拾遗 9.74179456862
+孤舟 11.1280889297
+滑润油 13.900677652
+花荣大 13.2075304714
+百盏 13.2075304714
+三千余里 12.5143832909
+吊去 13.900677652
+白石山 11.9547675029
+赵安开 12.8020653633
+多美 11.1280889297
+工作部门 10.4666904475
+款数 13.2075304714
+注音 10.7226238216
+变态心理 11.7034530746
+四面受敌 11.5027823792
+封萧国 13.2075304714
+殄灭 11.598092559
+行踪不明 13.900677652
+多用 8.05713323494
+外力 8.84443184663
+本细则 10.3453295905
+法眼宗 12.5143832909
+外办 11.598092559
+外功 13.900677652
+外加 8.65893063692
+外务 12.5143832909
+太华山 11.9547675029
+向觉华 13.2075304714
+权智 13.900677652
+恩威并施 11.7034530746
+八路 9.43476953332
+邓九如 12.5143832909
+并不知道 8.42003872863
+鼎盛 9.21854642485
+好早 13.2075304714
+医疗广告 10.765183436
+马卡连柯 12.2912397395
+悲壮 8.95903522937
+沙米隐 12.8020653633
+迭出 10.4666904475
+纳折布 13.2075304714
+养鸡户 12.5143832909
+院本 10.7226238216
+票决 13.900677652
+跷跷 12.5143832909
+折扇 9.31571017331
+一口一声 11.7034530746
+十六尊 13.900677652
+有法必依 12.2912397395
+微笑 6.80395627348
+宗璞 12.8020653633
+莫亚 13.900677652
+多罗 10.3743171274
+多罐 13.900677652
+羟磷灰石 13.900677652
+北京同仁医院 12.1089181827
+安心定志 13.900677652
+容不得 9.61021821083
+孙宝琦 13.900677652
+小幸童 13.2075304714
+折扣 8.49350588052
+正当权利 12.8020653633
+裁断 11.598092559
+卢嘉 13.2075304714
+导火 13.2075304714
+够本 11.1280889297
+好要 11.9547675029
+桃僵李代 13.900677652
+炮楼 9.89334446674
+借酒浇愁 11.9547675029
+敢上去 12.8020653633
+趋势性 9.32596667347
+小肚 11.8212361103
+赵令穰 12.8020653633
+雄厚实力 11.9547675029
+编者 9.80633308975
+贝雷桥 12.5143832909
+外切 12.8020653633
+孤苦 10.8096351986
+最终 5.33679173257
+多画 10.9049453784
+协调组 12.8020653633
+民主型 12.5143832909
+折戟 11.0103058941
+小肖 12.8020653633
+公孙衍 11.7034530746
+查德 11.598092559
+柴科夫 13.900677652
+边筑寨 13.2075304714
+最绝 12.5143832909
+钡剂 11.5027823792
+丘圣僧 12.8020653633
+陈鉴胡 13.2075304714
+至高无上 9.53122979951
+美眷 12.8020653633
+能诗善 12.2912397395
+交易网 13.900677652
+钢格板 13.900677652
+盖济尔 13.900677652
+多缸 12.2912397395
+外制 11.598092559
+托尔斯 12.1089181827
+查得 10.6818018271
+好觉 11.1926274509
+撒丁岛 10.8561552143
+揉擦 12.2912397395
+三十位 12.8020653633
+后溪 13.900677652
+公布于世 12.2912397395
+书架 9.75754292558
+电弧焊接 13.900677652
+肝癌 9.74179456862
+玻璃镜 11.8212361103
+董师爷 10.1630080337
+伊逊河 12.5143832909
+大人 6.29379312076
+双峰县 12.2912397395
+托尔托 12.5143832909
+裁成 12.1089181827
+三十余 9.45802639549
+周伯 12.1089181827
+类型区 11.7034530746
+调查队 11.598092559
+无缘无故 9.66657114738
+周伦 13.2075304714
+庞各庄 11.9547675029
+巡捕房 11.4157710022
+大亨 10.4041700905
+周会 13.900677652
+萨拉米 11.7034530746
+进价 11.2616203224
+周伟 10.6818018271
+大云 13.900677652
+书林 11.5027823792
+浴堂 13.900677652
+周休 13.900677652
+大些 9.34680076038
+折旧 9.66657114738
+新化县 12.5143832909
+咽哽 12.5143832909
+标准版 12.2912397395
+玉虚洞 12.8020653633
+促进剂 11.598092559
+大于 6.74528135008
+西藏路 11.7034530746
+大二 10.6818018271
+大事 6.31438134482
+补仓 10.3453295905
+恭贺 10.3453295905
+镇南 9.96885201925
+大件 9.98865464655
+后患 9.20019728618
+车友们 11.8212361103
+笑傲江湖 11.598092559
+进些 12.2912397395
+补交 10.9562386728
+瘦人 12.2912397395
+大任 10.7226238216
+畅心 12.8020653633
+减课 13.900677652
+缩略词 12.2912397395
+进了 7.36398605438
+揉捏 11.1926274509
+滕彪 13.900677652
+零活 11.5027823792
+舆论监督 10.3743171274
+四五家 11.9547675029
+黎庶 10.9049453784
+猛打猛冲 12.5143832909
+揉捻 12.5143832909
+栽树 11.7034530746
+畅快 9.04864738806
+折断 8.85725253506
+立真金 13.2075304714
+李岩正 13.2075304714
+书柜 10.5684731418
+王吴芮 12.2912397395
+大仙 9.5062284973
+远远望去 10.3171587135
+少数派 10.8096351986
+大仁 12.8020653633
+果子狸 10.9562386728
+欢颜 11.7034530746
+库鲁 11.4157710022
+提词 13.900677652
+多碱 13.900677652
+进京 8.15767446417
+依葫芦画瓢 12.5143832909
+嘉禾路 13.2075304714
+羽饰 12.2912397395
+外商 8.58255765813
+大丰 11.1926274509
+镇原 11.1926274509
+大举 6.79982574303
+玻利瓦 13.900677652
+宗王 10.6818018271
+大为 7.2872934336
+大丹 11.9547675029
+让利 9.44633035572
+养鸡 10.4994802703
+一时间 7.87239913175
+房车 11.4157710022
+大中 10.2117981979
+黎平 11.1280889297
+镇压 6.77539456047
+大个 10.0720362555
+养鸭 11.598092559
+折上来 13.900677652
+大专 10.4994802703
+南非非洲人国民大会 11.9547675029
+共和制 9.7898037878
+古希腊 7.56739802384
+真不错 10.7226238216
+大东 11.4157710022
+养鸟 12.2912397395
+大业 8.11378027061
+大丘 12.5143832909
+魏华存 12.8020653633
+童话故事 11.3357282945
+大一 11.5027823792
+够急 13.900677652
+猴急 12.1089181827
+玻璃门 10.3171587135
+大三 9.93038573842
+弗拉芒 13.2075304714
+树荫下 10.8561552143
+麦芽糖酶 13.2075304714
+西贝货 12.1089181827
+职责 7.50708689803
+大乱 8.230796729
+卢公 13.2075304714
+训练组 12.5143832909
+养鹿 11.7034530746
+揉揉 10.1871055853
+大书 9.53122979951
+进一 11.9547675029
+贤人 10.765183436
+快揍 13.900677652
+专门性 10.8096351986
+镇反 11.9547675029
+经常性 8.47572763449
+卢兹 13.900677652
+立元嗣 12.8020653633
+平陆县 11.7034530746
+低压钠灯 12.5143832909
+大乔 12.2912397395
+侵袭到 13.2075304714
+补下 13.900677652
+补上 9.34680076038
+太华寺 12.8020653633
+二十余岁 12.2912397395
+补丁 10.2117981979
+外售 12.5143832909
+大乘 8.71889410168
+百仕达 12.8020653633
+贺州 11.7034530746
+风速仪 12.2912397395
+窦融奉 13.2075304714
+马铃薯 8.23771717184
+司鼎立 13.2075304714
+瘦下 13.900677652
+谷永曾 13.2075304714
+大义 9.26594866375
+谦称 12.8020653633
+多种 5.63374230437
+公布于众 11.7034530746
+补修 12.8020653633
+大便 8.70772080109
+揉成 11.3357282945
+负屈 13.2075304714
+三十九 11.1280889297
+即将来临 9.41204128224
+支陈敏 12.2912397395
+江斯登 13.900677652
+简化字 11.7034530746
+焦达峰 13.2075304714
+热烈庆祝 12.5143832909
+险些儿 10.4349417492
+多科 11.0674643079
+五十个 10.4666904475
+自家人 9.58318953844
+国家审计署 11.7034530746
+指书 13.900677652
+行将就木 11.2616203224
+恭谨 10.1871055853
+提讯 10.7226238216
+乌桓俗 13.2075304714
+领导阶层 13.2075304714
+周三 7.34389929582
+五十一 12.1089181827
+五十七 11.5027823792
+时令商品 13.900677652
+周一 6.47234445778
+溯源 10.3453295905
+五十丈 12.8020653633
+进修 8.87679713113
+历史进程 9.71102290995
+乌尔旦 13.2075304714
+百点 9.75754292558
+多福 11.5027823792
+三十三 10.8096351986
+三十丈 11.8212361103
+三十下 12.8020653633
+扯落 12.1089181827
+三十万 9.48183704418
+尼沃契 13.900677652
+醒来时 9.80633308975
+三十一 11.0674643079
+三十七 11.2616203224
+财政部长 8.79473217808
+耍贫嘴 11.9547675029
+十万百万 13.900677652
+相对性 9.84023464143
+好转 6.6943003605
+周书 9.94943393339
+阿丽思 12.8020653633
+黎德 11.9547675029
+今年初 8.89004235788
+谢万岁 12.1089181827
+奴化教育 11.9547675029
+三十个 9.96885201925
+查处 8.02014466558
+梳棉 11.9547675029
+最硬 11.9547675029
+注释 8.21370229564
+查夜 11.8212361103
+流通出来 13.900677652
+于崇德 11.9547675029
+中国化学会 10.6818018271
+注重 6.73673096763
+栽植 9.18217878068
+汇票 8.24119543622
+周人 9.93038573842
+莫尔达 13.900677652
+阳明心 11.598092559
+百灵 9.21854642485
+拾零 13.900677652
+达特茅斯 11.7034530746
+极力争取 13.2075304714
+大伤 11.8212361103
+周亮 12.5143832909
+皮书 10.1394775363
+大陆性气候 8.9308643524
+大伯 8.83808261895
+班公错 11.2616203224
+好辩 12.8020653633
+秋风扫落叶 12.1089181827
+大众 7.36543638096
+尾水渠 13.900677652
+毋需 12.8020653633
+多票 13.2075304714
+服着 13.900677652
+申报材料 10.4041700905
+外周 9.77354326693
+赏梅 11.9547675029
+立体图 13.2075304714
+大会 6.16262535429
+大伙 7.58531965045
+斗心眼儿 13.2075304714
+副科级 12.5143832909
+车友会 12.5143832909
+范文 12.2912397395
+周二 6.67519617919
+五十二 11.4157710022
+四五寸 11.9547675029
+幼稚可笑 11.9547675029
+蜜语 12.8020653633
+装配式 11.598092559
+补体 10.9049453784
+四五对 13.900677652
+三十二 10.0940151622
+小马庄 11.8212361103
+财政部门 9.04086524761
+劲道 12.8020653633
+大使 8.24818847171
+呕吐者 13.2075304714
+严禁吸烟 13.2075304714
+诸小邦 13.2075304714
+外向 10.2630914922
+形不成 11.8212361103
+杨心赤 13.900677652
+漆片 13.900677652
+三十五 10.1164880181
+那东廊 13.2075304714
+大佬 9.48183704418
+大长老 13.900677652
+玉人儿 13.2075304714
+包拯集 13.2075304714
+曾几何时 11.0103058941
+大体 7.42370528909
+好运 9.75754292558
+大佐 12.1089181827
+好远 10.642581114
+贤侄 9.35738286971
+大作 8.9102450652
+大佛 9.96885201925
+赫梯古 11.9547675029
+大余 12.1089181827
+汽油价格 11.4157710022
+多礼 10.642581114
+全国人大常委会 8.60737282725
+好过 9.87532596124
+白狼山 12.8020653633
+滑膛式 12.8020653633
+玻璃钢 10.2630914922
+山鸟飞 12.8020653633
+刘皇叔 10.4349417492
+瘦瘦的 10.3743171274
+补休 12.2912397395
+寒浞 12.1089181827
+农业土壤 12.5143832909
+杨春敏 12.5143832909
+外城 9.15574552361
+凸出 9.62401153296
+凯丝 11.7034530746
+凸凹 11.8212361103
+宗姓 13.900677652
+多站 12.2912397395
+贺强 12.5143832909
+音响效果 10.8096351986
+后河 12.8020653633
+迄今为止 8.53470163695
+外域 12.5143832909
+外埠 12.1089181827
+多端 10.4349417492
+真让人 10.0505300503
+一如既往 8.9308643524
+长沙地区 12.5143832909
+沉潜 13.2075304714
+滴上 12.8020653633
+多年生 8.5440913773
+邓尼金 11.7034530746
+魏军夜 12.8020653633
+鳖甲 11.2616203224
+程限 12.2912397395
+德莱克 13.2075304714
+一无所取 13.900677652
+阳明山 11.1280889297
+军衔制 12.5143832909
+书斋 10.0505300503
+好谈 11.8212361103
+凯丰 11.9547675029
+新课程 12.2912397395
+唇齿相依 11.8212361103
+博览 10.2117981979
+冰块 9.56994431169
+无痛分娩 13.2075304714
+学习外语 12.2912397395
+外型 10.2630914922
+兵法云 10.765183436
+贺华 11.3357282945
+丰原 10.8561552143
+程阳 13.900677652
+好象 7.15661846566
+折枝 11.0103058941
+趣味 8.9308643524
+一阵 5.58878809375
+效率 6.87070474027
+带锯床 13.900677652
+凯乐 12.5143832909
+盈尺 11.7034530746
+二黄 13.2075304714
+养鳗 11.9547675029
+斩草 13.2075304714
+正长岩 11.0103058941
+景泰蓝 10.6818018271
+园艺作物 11.8212361103
+民主制 10.1630080337
+无偏见 13.900677652
+说来听听 11.9547675029
+卢叔 9.62401153296
+棋友 12.5143832909
+达理 11.9547675029
+维流形 11.9547675029
+刁状 11.4157710022
+三十六根 13.2075304714
+冰坨 13.2075304714
+白石头 13.2075304714
+辐射面 12.5143832909
+旱路 10.3171587135
+税收法规 13.900677652
+立大功 10.533381822
+够戗 11.1926274509
+麻生 13.900677652
+折杀 11.9547675029
+宁绍 10.2117981979
+动力机械 9.82314020807
+手段毒辣 13.900677652
+猴戏 12.5143832909
+镇内 10.642581114
+中共云南省委 12.8020653633
+大庆油田 10.1630080337
+周至德 12.5143832909
+黎山 12.5143832909
+盈利模式 9.14708746087
+姨奶奶 11.1280889297
+枵腹 12.2912397395
+婚姻大事 10.9562386728
+公孙贾 13.2075304714
+高山冻土 13.900677652
+大小不一 9.35738286971
+公孙贺 13.2075304714
+交易税 11.9547675029
+十六岁 9.20019728618
+横贯公路 10.642581114
+县外 12.1089181827
+孔老二 12.5143832909
+篾黄 13.900677652
+加密算法 13.2075304714
+点睛之笔 11.7034530746
+脑肿瘤 11.0674643079
+杨炎入 13.2075304714
+卢卡 11.3357282945
+房费 10.9562386728
+折服 10.2117981979
+房贷 7.07630398193
+子斐迪 12.8020653633
+恭迎 9.65218240993
+够打 13.900677652
+养鱼 9.21854642485
+怎么得了 10.604840786
+戊午 12.8020653633
+几只羊 13.2075304714
+电子货币 12.5143832909
+冰城 12.2912397395
+第二次世界大战 6.66074506066
+谢利夫河 13.900677652
+正交极化 13.900677652
+后汉 9.25628675283
+美国空军 8.82550383674
+滕州 11.5027823792
+院所 11.7034530746
+折本 13.2075304714
+麦管 13.2075304714
+外在 9.63799777493
+自乘 12.2912397395
+立马儿 11.8212361103
+外地 7.79143006921
+孙书记 9.44633035572
+忽如 13.900677652
+激光炮 11.598092559
+卫生系统 10.6818018271
+外场 10.9562386728
+好贵 13.900677652
+凯伊 12.2912397395
+荣禄瞅 13.900677652
+裸视 12.5143832909
+必经之路 10.0505300503
+多篇 9.09665660724
+迎宾曲 13.2075304714
+乘快艇 13.900677652
+巴拉马 13.900677652
+好货 11.4157710022
+世代交替 10.2117981979
+视频模式 13.900677652
+岩屑锥 13.2075304714
+深受其害 10.9562386728
+标准煤 9.98865464655
+吴师机 12.8020653633
+外因 10.0294766411
+望林纳 12.1089181827
+干军万 12.8020653633
+弥漫性 9.98865464655
+贺帅 13.2075304714
+漕运 8.28754954559
+东波美 13.2075304714
+可怜相 10.9562386728
+发射塔 11.9547675029
+外围 6.72978917346
+黎川 13.900677652
+苗瑶语 12.2912397395
+程静 11.1926274509
+外国 6.36698394213
+二龙 8.57766767284
+蒋家庄 11.7034530746
+让出 9.49395840471
+色素性 11.8212361103
+秋海棠 11.2616203224
+唐人街 11.4157710022
+枝梢 11.5027823792
+民主化 9.7898037878
+那魔闻 12.8020653633
+大食帝国 13.2075304714
+八角 9.15574552361
+滑溜溜 11.1280889297
+好好看 11.5027823792
+贺年 12.1089181827
+十八层地 13.900677652
+临时政府 8.75901409547
+玉荣 13.900677652
+贺平 13.900677652
+潭底 10.1871055853
+尉迟公 12.8020653633
+金微山 12.5143832909
+仲裁人 11.1926274509
+只能靠 9.41204128224
+归根结底 9.0884932966
+多管 9.21854642485
+好赚 11.7034530746
+西高东 9.59661255877
+贺县 11.598092559
+最穷 10.8561552143
+非遗传性 13.900677652
+王贲引 12.8020653633
+遂愿 12.5143832909
+多箱 12.8020653633
+汇算 11.4157710022
+以意为之 13.900677652
+动刑 11.4157710022
+宗炎 12.1089181827
+百物 11.7034530746
+立储君 13.2075304714
+查对 11.2616203224
+差距 6.93182727363
+查寻 12.5143832909
+编著 9.5062284973
+白天鹅 11.1280889297
+七十年代 9.72629038208
+少不更事 11.598092559
+蒲桥 12.8020653633
+贺庆 12.8020653633
+宵衣旰食 10.9562386728
+非典型 11.1280889297
+邻里单位 13.900677652
+快手 12.8020653633
+查察 13.2075304714
+宗炳 13.2075304714
+峙立 11.9547675029
+阳明巾 13.2075304714
+辽源市 11.5027823792
+却明明 13.2075304714
+贾母 7.75434839431
+咽头 13.2075304714
+后浪 12.8020653633
+截稿 10.2117981979
+共和党 8.91707103027
+巨浪滔天 13.900677652
+查审 13.900677652
+服用 7.68407155089
+不加区分 12.1089181827
+冯保派 12.8020653633
+摇摇摆摆 10.2371160058
+攻倒 13.900677652
+多笔 12.1089181827
+电器集团 12.5143832909
+时明军 13.2075304714
+眼皮底下 10.1394775363
+后海 11.598092559
+油漆工 13.900677652
+查完 12.1089181827
+道琼斯 7.6165434909
+山樱桃 13.900677652
+阴星君 12.5143832909
+书摘 13.900677652
+罗力哥 13.2075304714
+旱象 11.8212361103
+查实 9.66657114738
+古冰斗 11.1280889297
+残瓦 13.900677652
+书摊 12.8020653633
+祭出 11.0103058941
+隆平府 12.5143832909
+地木梁 12.5143832909
+成都市委 13.900677652
+王佐之才 11.5027823792
+事成之后 10.2630914922
+新密市 10.2630914922
+二股 11.2616203224
+大势 8.46259834305
+须生 11.7034530746
+仆妇 9.85762638414
+爵士鼓 13.2075304714
+乌斯达 13.2075304714
+百花争艳 12.8020653633
+非正常 9.38981814546
+压条繁殖 12.1089181827
+既然 5.916896583
+交通广播 11.8212361103
+列举如下 13.2075304714
+大加 9.66657114738
+二肽 13.900677652
+大劫 10.4994802703
+鲁君 12.2912397395
+大动 11.0103058941
+猴精 10.642581114
+上海站 11.9547675029
+叶甲科 13.2075304714
+果蝇属 13.900677652
+大功 8.36334338496
+大办 11.4157710022
+张将军 10.642581114
+博格达 10.9562386728
+大力 7.02958635737
+石河子 10.6818018271
+宁息 12.8020653633
+书简 10.3743171274
+明礼义 13.2075304714
+套间 9.80633308975
+宫寺释 12.5143832909
+斯弗德 13.2075304714
+潮州市 11.3357282945
+砍进 12.8020653633
+夏侯兰 13.2075304714
+铍青铜 13.900677652
+杜瓦尔 13.2075304714
+陇东 10.1164880181
+补助 8.43261751084
+十样 12.8020653633
+二胡 9.82314020807
+人字形 11.5027823792
+大不一样 9.56994431169
+补加 12.2912397395
+让价 13.900677652
+二十余件 12.8020653633
+截断 8.5440913773
+二手市场 11.5027823792
+阿克斯 13.900677652
+云露方 13.900677652
+镇住 9.62401153296
+乌桓势 13.2075304714
+国防科技大学 12.5143832909
+二胺 11.9547675029
+信赏必罚 12.2912397395
+刘春霖 13.900677652
+院系 10.3743171274
+张秀 10.9049453784
+二胎 11.2616203224
+丽娜 9.77354326693
+博韦 11.598092559
+奥尔丁顿 13.900677652
+周南 11.598092559
+竿子 11.1280889297
+大勇 11.3357282945
+雪肤 13.900677652
+补办 11.0674643079
+三十匹 11.8212361103
+海蛎 13.2075304714
+谷登堡 11.1280889297
+声威大震 12.5143832909
+灭火机 12.8020653633
+长寿区 12.2912397395
+冰寒 13.2075304714
+讽刺性 11.1926274509
+出人意料 8.53938548627
+钻入 8.97342396682
+铨叙部 12.2912397395
+邓颖超 11.7034530746
+二十余个 12.5143832909
+红碎茶 11.9547675029
+时分复用 12.5143832909
+后爹 11.8212361103
+封建思想 11.5027823792
+凿岩 11.5027823792
+社会公德 11.1926274509
+刘女士 10.0940151622
+百余卷 12.5143832909
+蝶类 11.9547675029
+八队 9.66657114738
+萤石 8.78868986362
+进前 11.0103058941
+萌芽林 13.900677652
+二十余万 10.4994802703
+二者 7.28863661714
+马槽里 12.8020653633
+多摩 11.8212361103
+大刑 11.1926274509
+三十只 11.4157710022
+减震 10.9562386728
+十框 13.900677652
+进剿 9.94943393339
+具有 4.3446221763
+补剂 12.2912397395
+五百年 9.54396882529
+最新 6.03895057415
+薛继承 13.2075304714
+百济 10.604840786
+大刀 8.77077893705
+平汉铁路 11.4157710022
+待援 10.765183436
+瘦削 9.22784881751
+抄近路 11.7034530746
+琐碎 9.96885201925
+麻疹 10.1164880181
+伊通满族自治县 13.2075304714
+嘴部 11.598092559
+周史 12.8020653633
+书楼 12.8020653633
+截收 12.1089181827
+源源本本 12.8020653633
+炸药 7.95003509939
+书签 11.2616203224
+刁民 10.8561552143
+叶缘 10.8096351986
+双桅 12.8020653633
+大副 13.900677652
+周口 9.13850371718
+天尊宣 12.8020653633
+废寝忘餐 13.900677652
+贤劳 13.900677652
+牛爱国 7.93197009199
+学习成绩 10.0720362555
+服用量 11.9547675029
+进到 8.70218062071
+渎职 10.5684731418
+进制 9.75754292558
+大剑 12.8020653633
+相反相成 11.7034530746
+标准源 13.900677652
+最早 5.85669322075
+周叔 13.2075304714
+连入 12.5143832909
+姚景源 10.1394775363
+后牙 12.2912397395
+二联 13.2075304714
+王洛宾 12.8020653633
+食欲不佳 12.8020653633
+最旺 11.3357282945
+情致 10.642581114
+长寿县 13.2075304714
+颔首微笑 13.2075304714
+度假胜地 11.9547675029
+拉梅托 13.900677652
+进发 8.35941410682
+雪橇犬 13.900677652
+进取 8.11685246965
+马海毛 12.5143832909
+大县 10.604840786
+中石化 7.92179188707
+周到 8.80081122415
+杜聿明 11.2616203224
+王伤目 12.8020653633
+聚合起来 12.2912397395
+效法 9.16447920358
+鼎沸 10.533381822
+大厦 7.77162744192
+通脉 12.2912397395
+废寝忘食 11.0674643079
+曹植入 13.900677652
+详情 8.55357012126
+嫉妒心 11.5027823792
+裁缝 9.22784881751
+镇上 8.20358416547
+大厨 11.7034530746
+治道 11.4157710022
+课外书 11.9547675029
+折磨 7.63537643924
+周初 8.71329184614
+大原 13.2075304714
+多日 8.83808261895
+越过波 13.2075304714
+石川县 12.5143832909
+小百货 13.2075304714
+进口 6.25480182679
+大历 10.3171587135
+大厅 7.67414098269
+弃文就武 12.2912397395
+待批 10.9049453784
+大厂 9.77354326693
+国际经贸 11.4157710022
+撒手尘寰 12.5143832909
+多时 8.01457362053
+补发 11.1926274509
+浙江医药 10.1164880181
+大号 10.3453295905
+赵兵 12.1089181827
+里希特 11.3357282945
+降脂药 12.5143832909
+卡持卡 13.2075304714
+二臣 12.1089181827
+指甲花 13.2075304714
+博雅 9.03314320152
+墨梅图 12.2912397395
+三十分 11.1280889297
+两百块 11.9547675029
+纳冰架 13.900677652
+粘糊糊 12.2912397395
+进厂 10.2897597393
+大口 8.63281949291
+知性美 12.8020653633
+秦明勒 13.2075304714
+大叠 12.8020653633
+大可 10.5684731418
+交易日 5.95158615215
+大叫 7.34816976494
+中国出版工作者协会 12.1089181827
+福尔蒂 13.900677652
+大受 9.65218240993
+大叔 8.83177344976
+蜜露 12.8020653633
+大发 9.15574552361
+进去 6.25527995255
+霓虹灯 9.89334446674
+大变 9.19114745066
+新课改 12.5143832909
+诊断 6.93371051336
+向警予 12.1089181827
+多方 7.65070240972
+镇乡 12.8020653633
+运出来 12.2912397395
+书立 13.2075304714
+计算机专业 13.2075304714
+宁愿 8.44109213783
+速速 9.82314020807
+外来户 11.5027823792
+黏土砖 12.2912397395
+末日审判 11.0103058941
+步兵旅 9.74179456862
+多故 11.598092559
+南城门 13.2075304714
+泄洪区 13.900677652
+太爽了 13.900677652
+大区 9.43476953332
+书稿 10.1164880181
+汇文 12.8020653633
+草棚 10.0088573539
+减阻 12.8020653633
+贺新郎 12.1089181827
+亮堂堂 11.3357282945
+大年夜 12.2912397395
+北京协和医院 11.5027823792
+大北 11.9547675029
+大化 10.0720362555
+弹道式 11.8212361103
+不省得 10.3453295905
+悚惧 10.4349417492
+大匙 13.900677652
+技防 13.2075304714
+乌桓南 13.2075304714
+大包 9.44633035572
+进占 9.71102290995
+十公尺 13.2075304714
+阴雨雪 13.2075304714
+够紧 13.900677652
+麦考利 13.900677652
+魔岩 13.2075304714
+有家难奔 12.1089181827
+多数 5.82198942275
+大卷 12.2912397395
+熬过 9.91169360541
+图片说明 12.5143832909
+进化 7.65457088649
+戒色 13.900677652
+大印 10.1630080337
+钻儿 12.8020653633
+周勰 13.2075304714
+减除 12.1089181827
+艰困 12.8020653633
+王义夫 12.2912397395
+大卡 10.7226238216
+零点 9.34680076038
+哇哇大哭 11.5027823792
+大卫 8.9519177616
+凯凯 12.8020653633
+八面 10.3453295905
+多支 10.765183436
+南迦巴瓦峰 11.4157710022
+土地利用 9.33632946051
+保留意见 10.2117981979
+二十余位 13.900677652
+伯杰龙 12.8020653633
+供需见面 12.5143832909
+张磊 11.9547675029
+多放 11.3357282945
+耶路撒冷城 12.8020653633
+让位 9.38981814546
+获得最佳 11.0103058941
+上海大学 10.8096351986
+大华 9.63799777493
+多收 10.2897597393
+大半 7.96050639926
+注资 7.94225295895
+五百强 11.598092559
+拖开 11.9547675029
+养育 9.56994431169
+最最 9.21854642485
+院级 12.2912397395
+明确规定 8.22050504296
+经受锻炼 13.2075304714
+萨拉托 12.1089181827
+可维修性 12.8020653633
+最有 7.33541268194
+民国日报 11.4157710022
+公益性 9.48183704418
+拖式 10.8096351986
+果子沟 13.2075304714
+擦乾净 13.900677652
+孤鬼 12.8020653633
+刚回到 11.598092559
+养肥 12.1089181827
+垫上去 13.900677652
+穿下去 13.900677652
+院线 11.0103058941
+双格 13.900677652
+三十六 8.91707103027
+竟能 9.61021821083
+么法儿 13.2075304714
+好逑 12.2912397395
+王度庐 13.900677652
+三十八 10.6818018271
+银监 12.5143832909
+最末 10.6818018271
+鲁玉瓷 12.8020653633
+差遣 9.08039608637
+新一期 12.5143832909
+宁扬 12.8020653633
+待慢 13.2075304714
+八钱 12.1089181827
+房里 7.34389929582
+双核 11.1926274509
+灵慧 11.9547675029
+卡梅隆 13.2075304714
+家至户到 13.2075304714
+宗派 9.21854642485
+七万多平方公里 13.2075304714
+数学教师 12.1089181827
+多曲 11.9547675029
+其实难副 13.2075304714
+徐力里 9.25628675283
+郑蛟麟 13.900677652
+醉心于 10.5684731418
+显教 11.9547675029
+兰亚科 12.5143832909
+输送管 12.8020653633
+绅商 11.598092559
+周兴 12.1089181827
+下切侵蚀 11.598092559
+周全 9.03314320152
+太史 10.1164880181
+真不该 10.4666904475
+周六 8.5488195185
+萨拉戈 13.900677652
+五十六 10.7226238216
+奉到 12.2912397395
+容隐 13.900677652
+折算 9.29550746599
+筑波大学 12.2912397395
+五十八 11.1926274509
+阳襄陵 12.8020653633
+门里门外 10.9049453784
+养胖 13.900677652
+隆昌县 12.8020653633
+小艾 11.0674643079
+佛跳墙 12.8020653633
+百般无奈 13.2075304714
+蒲柳 12.1089181827
+孤魂 10.8096351986
+卢俊 13.2075304714
+调查表 10.1394775363
+养胃 11.3357282945
+周克 13.2075304714
+周光 11.3357282945
+周文王 9.34680076038
+锣鼓喧天 10.4994802703
+博闻 12.1089181827
+家乡父老 12.8020653633
+丽江市 12.8020653633
+甚至于 9.28555713513
+五十克 13.900677652
+来得快 10.2117981979
+知觉 8.55834340001
+言之不预 12.8020653633
+符腾堡 11.4157710022
+大值 13.2075304714
+北宫玄 13.2075304714
+端午节 9.61021821083
+十一届三中全会 9.56994431169
+太古 9.40086798165
+补偿 6.92526372452
+慕容恒 13.2075304714
+张桂兰 11.1280889297
+拖得 10.2897597393
+萨拉拉 12.8020653633
+快讨 13.900677652
+周军 11.0674643079
+龚雯 13.900677652
+浅陋 11.7034530746
+百余名 10.6818018271
+细胞培养 11.5027823792
+治丝愈棼 13.900677652
+天王殿 10.8096351986
+三十几 13.900677652
+党小组长 13.2075304714
+养老 7.91926344072
+陶仲文 12.8020653633
+必经之道 11.3357282945
+马后 10.765183436
+多晶 10.8561552143
+乌孙族 12.8020653633
+空置房 12.2912397395
+初速度 12.1089181827
+肢残人 13.2075304714
+西兵勤 13.2075304714
+慢慢 6.23820983678
+恒指 8.31342899358
+孙理 12.8020653633
+停赛 12.5143832909
+嫡亲 10.2117981979
+五十几 13.900677652
+戈森斯 12.8020653633
+猫眼儿 13.900677652
+赵先生 9.20019728618
+独步一时 13.2075304714
+鲁忽赤 10.9049453784
+保卫和平 11.7034530746
+免疫病理 12.2912397395
+宫皇太后 10.765183436
+多是 10.9049453784
+黄淮平原 10.2371160058
+歪眼 13.2075304714
+内忧外患 10.2117981979
+小艇 9.74179456862
+龙钟老态 13.900677652
+汉字编码 13.2075304714
+白石英 13.2075304714
+大水缸 11.4157710022
+身怀六甲 12.1089181827
+二艘 12.5143832909
+英资 11.2616203224
+大冷 11.1280889297
+大冶 9.44633035572
+拖布 13.900677652
+花生衣 13.900677652
+大冲 11.8212361103
+几十门 12.1089181827
+磁悬浮 11.9547675029
+依曼结构 12.8020653633
+镇尺 12.1089181827
+线控 13.2075304714
+络石藤 13.900677652
+宗气 11.8212361103
+几十间 12.1089181827
+大冢 11.4157710022
+河麂 12.8020653633
+惝恍 13.900677652
+净水剂 13.2075304714
+勘探工程 13.2075304714
+漫反射 11.9547675029
+蝶翅 13.2075304714
+拖带 10.6818018271
+足球报 13.900677652
+进出 7.85567233794
+各有不同 9.29550746599
+大军 6.41968548911
+最是 9.19114745066
+大写 10.3171587135
+幅宽 11.7034530746
+大内 8.50705010562
+主任医生 12.2912397395
+竟自 10.4666904475
+迪奥赛 13.900677652
+猴群 10.9562386728
+守分安常 13.2075304714
+太尉宿 13.900677652
+多柱 12.8020653633
+凿开 10.8096351986
+三十倍 13.2075304714
+大凶 13.2075304714
+好酷 13.900677652
+祁彪佳 12.5143832909
+黑作坊 10.8096351986
+防寒防冻 13.900677652
+阜康 11.5027823792
+进军 7.17085358149
+连衫裙 13.2075304714
+户庭 13.2075304714
+失望透顶 13.900677652
+多极 11.1280889297
+泽泻 10.642581114
+响尾蛇 9.58318953844
+铃铛 10.1394775363
+多枝 12.1089181827
+连击 11.9547675029
+绫罗 10.9049453784
+未点燃 13.900677652
+大凡 9.20019728618
+最晚 9.37888907493
+解颐 12.8020653633
+多林 12.5143832909
+彭齐亚 12.1089181827
+幻灯片 11.1926274509
+周健 10.8561552143
+耳聋 9.58318953844
+迎新晚会 13.2075304714
+大前提 11.0103058941
+民间文化 11.598092559
+九百余万元 13.2075304714
+多枪 13.900677652
+好酒 9.80633308975
+闯来 12.8020653633
+八门 10.3171587135
+质量保证 11.2616203224
+如之何 10.9049453784
+定位点 12.8020653633
+补写 12.2912397395
+自在不成人 13.2075304714
+好吃好喝 10.8096351986
+后燕 10.1164880181
+大凉 11.9547675029
+啤酒馆 13.900677652
+十五捆 13.2075304714
+慢性 7.39041931145
+补全 12.5143832909
+幸丫 12.5143832909
+补入 11.0674643079
+拖床 12.8020653633
+凯厄 12.5143832909
+依仗 9.65218240993
+情节 7.46613113319
+多束 12.8020653633
+补养 10.8561552143
+企业亏损 10.8561552143
+成幼鱼 13.2075304714
+水萝卜 11.598092559
+夺过来 10.4666904475
+显亲扬名 13.2075304714
+进关 9.24671730182
+轮耕 13.2075304714
+卢万 11.1926274509
+泽民 11.1280889297
+大儒 10.4666904475
+进兵 7.78699547214
+飘下去 13.2075304714
+补充 6.10956814137
+多来 9.54396882529
+崔立凡 10.4349417492
+有微子 13.900677652
+多条 8.02014466558
+闻言心 13.2075304714
+集体所有制 10.4041700905
+康为卫 12.8020653633
+进入 4.5621199822
+征兵法 13.900677652
+财政管理 11.4157710022
+伊兹尼 12.8020653633
+多服 13.900677652
+大兵 8.46695564842
+大兴 9.09665660724
+多月 7.75007488353
+多有 7.82074445688
+戈宾德 13.2075304714
+小雨点 13.900677652
+德宁 12.5143832909
+斯匹次卑尔根 11.3357282945
+大典 8.12302532875
+宗法 9.14708746087
+多期 11.0103058941
+从里到外 10.765183436
+洪古尔 13.2075304714
+均匀度 12.1089181827
+大公 9.33632946051
+鲜奶油 13.900677652
+大全 9.69598503258
+多本 11.0674643079
+仲英 13.900677652
+多未 11.7034530746
+惟命是从 12.8020653633
+依随 13.2075304714
+司马越 12.2912397395
+大党 10.2630914922
+军民团结 12.5143832909
+霁月光风 13.2075304714
+大兄 11.0674643079
+大元 10.0940151622
+拖延 8.35160156708
+丽如 12.5143832909
+多朵 13.2075304714
+宗泽 10.0505300503
+交易权 12.8020653633
+大光 12.1089181827
+停顿下来 10.765183436
+大嚷 10.604840786
+严领 12.8020653633
+服满 12.1089181827
+转圜余地 11.9547675029
+多情 9.22784881751
+军备竞赛 10.4666904475
+追上来 10.3171587135
+釉上彩 11.8212361103
+门诊量 12.8020653633
+国家语委 13.2075304714
+宁玛派 11.9547675029
+言而有信 12.8020653633
+追问 7.73525979774
+小五台山 11.0674643079
+养蚕 9.75754292558
+青旅 13.900677652
+连小孔 13.900677652
+内哥罗 11.4157710022
+汇总 8.87679713113
+高仪喊 13.2075304714
+抗非 13.900677652
+掩上 10.2371160058
+天津市人 11.9547675029
+斗折蛇行 13.900677652
+指南攻北 13.900677652
+国际电信联盟 11.598092559
+乌尔班 11.9547675029
+多想 9.15574552361
+书翰 12.5143832909
+原尾虫 13.900677652
+战坦克 11.7034530746
+美味可口 12.5143832909
+万多平方公里 10.8096351986
+新阿姆斯特丹 12.5143832909
+零用 11.8212361103
+快意 9.7898037878
+大国 7.15897695732
+胡荣华 13.2075304714
+小舌 13.2075304714
+大团 10.4666904475
+后盾 9.32596667347
+好险 11.598092559
+最慢 10.9562386728
+五十块 10.765183436
+宗正 10.2630914922
+迭代 11.0103058941
+手机短信 11.7034530746
+大四 10.9562386728
+请进来 10.4041700905
+布尔加科夫 12.5143832909
+十六号 13.2075304714
+待机 10.0088573539
+欺诈案 11.9547675029
+惊涛拍岸 12.8020653633
+玻璃质 11.7034530746
+后盖 12.1089181827
+逗弄 11.1926274509
+充军 9.75754292558
+犬马之力 11.598092559
+悔之无及 11.5027823792
+跑生意 12.2912397395
+痘疹 11.598092559
+好难 13.2075304714
+望帝 12.8020653633
+皮夹克 11.5027823792
+逗引 10.9562386728
+社会公害 12.8020653633
+巴甫洛夫 10.3743171274
+马拉若岛 12.5143832909
+不进不退 13.900677652
+存在主义 9.96885201925
+谦恭 9.77354326693
+作业负担 13.900677652
+趣事 10.642581114
+水龟虫 12.1089181827
+多恩 11.1280889297
+所罗门王 13.2075304714
+待查 12.8020653633
+玉门关 10.1394775363
+丁格尔 13.2075304714
+由李鸿 13.2075304714
+家亡国破 13.2075304714
+王允济 12.8020653633
+犬马之劳 10.2371160058
+摔下去 11.8212361103
+龚都 11.7034530746
+手牵手 11.598092559
+官调 13.900677652
+二萜 12.8020653633
+欢聚 10.765183436
+楚雁潮 7.65651075131
+慢来 11.7034530746
+充电器 10.9049453784
+胚囊 10.6818018271
+落点 10.6818018271
+商务活动 9.85762638414
+票价 9.16447920358
+大邑县 12.1089181827
+多思 11.8212361103
+户头 11.4157710022
+养生之道 11.2616203224
+林下植物 12.8020653633
+垂杨 11.1280889297
+电视发射塔 12.1089181827
+宗毛 13.900677652
+铁哥们 12.2912397395
+聂振邦 13.900677652
+大器 9.66657114738
+南坡 8.83808261895
+草案 8.12923652885
+封潞国 12.5143832909
+户外 9.20932976975
+色谱仪 13.900677652
+周城 11.5027823792
+用药治疗 11.2616203224
+起纠纷 12.8020653633
+养虎 12.5143832909
+百千万亿 13.2075304714
+拖堂 12.8020653633
+武汉邮科院 13.900677652
+丽影 13.900677652
+甜丝丝 11.1926274509
+易消化 10.765183436
+纸袋子 12.2912397395
+温气乃 13.900677652
+浦文英 12.8020653633
+加快速度 10.9049453784
+巴中市 11.7034530746
+吕始东 13.900677652
+捏合机 13.900677652
+最怕 8.94485059437
+挽回损失 12.2912397395
+书纪 11.7034530746
+进城 7.33259974056
+推诚相见 13.900677652
+不容许 10.6818018271
+尹常带 13.2075304714
+外婆 10.0505300503
+孙琪 11.9547675029
+声功率 13.2075304714
+槲寄生 11.8212361103
+双周刊 12.1089181827
+协调性 9.61021821083
+库藏 10.5684731418
+独行侠 12.8020653633
+大型 5.61667834773
+门诊部 10.0294766411
+天津泰达 12.2912397395
+失范 11.1280889297
+体弱多病 10.4041700905
+养蟹 13.900677652
+皇甫少华 13.900677652
+后知 11.5027823792
+反复计算 13.2075304714
+回复突变 12.1089181827
+偏转线圈 13.2075304714
+史蒂夫 11.3357282945
+那珠母 12.8020653633
+慢曲 13.2075304714
+岗子 11.9547675029
+注解 9.61021821083
+百余台 13.900677652
+后石 13.900677652
+百余号 13.2075304714
+根竹 13.2075304714
+大埔 10.4994802703
+充分反映 9.80633308975
+古儿 13.2075304714
+平平安安 10.4994802703
+最恨 10.1164880181
+木木的 12.1089181827
+好静 12.8020653633
+思达 10.6818018271
+静滴 11.0674643079
+痛痛快快 9.7898037878
+非传统 11.0103058941
+五百家 12.2912397395
+拼刺刀 11.8212361103
+大城 9.5062284973
+陶望卿 13.2075304714
+注视 7.64301006409
+诸郎君 12.8020653633
+重仓股 7.76727960898
+书经 11.2616203224
+摇摆不定 10.6818018271
+大地 7.30353195009
+一来一往 10.5684731418
+房陵 12.2912397395
+十八亿美元 13.2075304714
+大场 11.1926274509
+第四十二章 11.0674643079
+群众体育 12.2912397395
+百余匹 12.8020653633
+大圣 7.56739802384
+三十四 10.533381822
+司马懿善 12.8020653633
+欢腾 9.82314020807
+长津湖 12.1089181827
+楚风馆 12.2912397395
+乌桓均 13.2075304714
+擀毡 13.900677652
+宁日 12.8020653633
+青戈江 13.2075304714
+危机感 10.642581114
+大土 11.8212361103
+两用桥 11.1280889297
+全托 13.2075304714
+多慢 12.8020653633
+养蜂 10.2630914922
+桂林市 10.533381822
+非亲非故 12.5143832909
+长痘痘 11.9547675029
+张百祥 13.900677652
+青白江 12.5143832909
+公益林 12.5143832909
+大圈 11.598092559
+小苏 12.5143832909
+佞佛 12.1089181827
+促膝交谈 13.2075304714
+吕碧城 10.533381822
+笑乐 12.5143832909
+搞上去 10.8096351986
+显族 12.2912397395
+驱驰 11.1926274509
+弹道学 10.4994802703
+周围 5.85797815508
+百样 12.1089181827
+这一关 9.43476953332
+鹿角菜 12.2912397395
+龙涎香 11.3357282945
+大坡 11.4157710022
+韦氏恐 12.8020653633
+王淦昌 11.7034530746
+大坪 11.8212361103
+零担 11.8212361103
+大块 9.15574552361
+周四 7.35389224122
+电子密度 10.9562386728
+大坑 9.85762638414
+进场 8.19356738723
+鼠肉 12.1089181827
+解理面 11.1926274509
+银甲 10.9562386728
+五十四 11.2616203224
+最想 9.93038573842
+百栋 13.2075304714
+心灵 7.75864024639
+猴票 11.3357282945
+林春曾 13.2075304714
+顿脚 10.3743171274
+明太鱼 12.8020653633
+生生的 11.4157710022
+痤疮 10.2371160058
+丽山 13.900677652
+多拉 11.2616203224
+汇成 9.59661255877
+诸为闽 12.8020653633
+多担 13.2075304714
+宁晋 11.8212361103
+房间 6.78104201396
+判离 12.8020653633
+金阳 13.2075304714
+拾起 9.32596667347
+感光性 12.5143832909
+发怨言 13.900677652
+光机电 12.8020653633
+房门 7.94484028251
+阿尼玛 12.8020653633
+宜耕宜 13.900677652
+各说各话 13.900677652
+方括号 11.5027823792
+庚酮 13.900677652
+阿雷纳 13.2075304714
+鸣鞭 12.5143832909
+乒乒 12.5143832909
+乒乓 10.4349417492
+张勋自 12.8020653633
+八邪 13.900677652
+钕铁硼 12.8020653633
+幅度 6.19992985746
+补品 10.642581114
+举步 9.94943393339
+服法 11.7034530746
+孔狄亚 12.2912397395
+坐观成败 12.2912397395
+镀膜 10.9049453784
+呼吸器官 10.5684731418
+魏延表 13.900677652
+博里 13.900677652
+窦尔泰 13.900677652
+博野 12.1089181827
+一千六百万镑 12.5143832909
+蝶窦 12.8020653633
+医源性 11.7034530746
+博采 10.1871055853
+苑广 13.900677652
+宁明 11.7034530746
+大哥 7.00398332035
+兄弟阋于墙 13.900677652
+一两门 13.2075304714
+大哭 8.14493543839
+在生 13.900677652
+减量 11.0103058941
+哪一天 9.24671730182
+减重 10.8561552143
+考虑不周 11.4157710022
+马偕尔 13.900677652
+东盟国家 10.8561552143
+孙黄狮 12.8020653633
+外侧 8.29120585679
+外侨 10.8561552143
+八部 10.533381822
+唐煮宋 12.8020653633
+外侮 11.1280889297
+单轨制 11.3357282945
+专用工具 12.5143832909
+舞蹈片 13.2075304714
+截掉 11.4157710022
+可出租 13.900677652
+大响 12.5143832909
+根竖 13.900677652
+贾耽 11.598092559
+咨文 10.0294766411
+吓了一跳 8.02574692112
+荨麻 11.0674643079
+大吵 10.5684731418
+大吴 13.900677652
+赏玩 10.2897597393
+多手 11.8212361103
+从业员 13.900677652
+多所 8.59737274392
+大吹 13.2075304714
+油盐酱醋 11.0103058941
+托喻之 12.8020653633
+坐舱 12.8020653633
+埠头 11.8212361103
+联轴节 13.900677652
+进呈 10.0505300503
+诊所 9.58318953844
+百步 9.63799777493
+地面蒸发 12.1089181827
+效死 10.765183436
+大吕 12.5143832909
+武仙座 10.6818018271
+卷尾猴 11.9547675029
+政治头脑 11.3357282945
+风致 11.3357282945
+一面面 11.7034530746
+萨拉曼 11.7034530746
+特快专递 11.2616203224
+一个三十出头 12.8020653633
+汇报 7.38893232233
+课下 12.1089181827
+大吃 10.3171587135
+多批 11.598092559
+大吏 9.30555780184
+大名 8.07173203437
+大同 8.01179969364
+大吉 10.4994802703
+外使 13.2075304714
+外企 10.2630914922
+坐船 10.1871055853
+刘崇部 13.2075304714
+百款 11.9547675029
+翟弘 13.2075304714
+阔叶 8.71889410168
+且说 7.49876045525
+大呼 9.0884932966
+八遍 12.5143832909
+八道 10.533381822
+动名词 13.900677652
+方孔昭 12.1089181827
+乌政府 13.900677652
+庚醛 13.900677652
+背褡子 13.900677652
+百次 11.0103058941
+哇哇大叫 11.8212361103
+外传 9.5186510173
+圆心角 13.2075304714
+外伤 8.78868986362
+招待会 10.0720362555
+多截 13.2075304714
+第十七届 11.3357282945
+刁横 13.900677652
+阳脉 12.5143832909
+大员 8.70772080109
+服气 10.1164880181
+琐细 11.2616203224
+汇拢 12.5143832909
+十三例 13.2075304714
+鹿角胶 11.7034530746
+差钱 9.80633308975
+欢舞 13.900677652
+多户 9.69598503258
+蒲东巡 13.900677652
+交易所 5.91145624316
+下载速度 13.2075304714
+外甥女 10.1164880181
+劳动党中央 12.1089181827
+冰丘 11.7034530746
+开炼机 12.8020653633
+罗小文 10.8096351986
+领导核心 10.6818018271
+落后分子 12.5143832909
+阔别 10.1394775363
+徇私 10.8561552143
+冰上 9.72629038208
+多提 11.9547675029
+新词 10.3453295905
+库车县 11.598092559
+嫩黄瓜 12.5143832909
+外代 12.1089181827
+王乾娘 11.8212361103
+快人快语 11.9547675029
+低通滤波器 12.5143832909
+大喜 7.31037660378
+几十里 9.49395840471
+妙喻 13.2075304714
+研究生院 9.63799777493
+相州民 13.2075304714
+暗亏 13.900677652
+周吉 11.1926274509
+小花 9.55687223012
+净水器 13.2075304714
+长寿命 11.0674643079
+五十名 10.1630080337
+人才网 11.5027823792
+大喊 8.51618258919
+战争赔偿 13.2075304714
+炒地皮 10.9049453784
+三十名 10.604840786
+允许浓度 13.2075304714
+数控铣 13.2075304714
+尿常规 10.5684731418
+家具市场 13.2075304714
+好长 10.1630080337
+外事 9.71102290995
+房钱 10.9049453784
+八里 10.0720362555
+通家之好 12.5143832909
+差错 8.67493097826
+周周 11.8212361103
+陶波湖 13.900677652
+川家康 11.0674643079
+姑息 9.41204128224
+确保重点 12.5143832909
+弹状病毒 13.2075304714
+童时入 13.2075304714
+波旁王朝 10.4666904475
+外交 7.23882291143
+性疲劳 13.900677652
+赶赴现场 11.1926274509
+凿孔 12.1089181827
+小拳头 10.8096351986
+凿子 10.2371160058
+麦利那 12.8020653633
+外亲 12.5143832909
+泛着 9.82314020807
+折线 11.5027823792
+折纳 11.1280889297
+外人 7.70627226087
+金属结构 11.598092559
+漳平市 12.2912397395
+后用 9.46986085313
+漆树 9.61021821083
+李金山 13.900677652
+大唱 12.1089181827
+财力雄厚 11.3357282945
+宫传旨 12.5143832909
+重农主义 11.1926274509
+自导自演 11.0674643079
+芙蓉姐姐 12.1089181827
+通权达变 11.7034530746
+性感冒 13.2075304714
+捏造出 12.2912397395
+杀手锏 9.44633035572
+伸进去 11.3357282945
+百分之九十 11.1280889297
+创痕 12.2912397395
+大唐 8.33999602096
+冰人 12.8020653633
+潜口 13.2075304714
+查志隆 11.598092559
+减退 8.20694551317
+减速 8.67493097826
+工商学院 11.7034530746
+小样儿 13.900677652
+能永保 13.900677652
+萨拉查 12.5143832909
+后生 8.38724890581
+大连人 13.900677652
+苑律 12.8020653633
+巴甫洛娃 11.9547675029
+程远 13.2075304714
+情窦初开 12.1089181827
+定位球 12.1089181827
+摇旗呐喊 10.7226238216
+毛穆之 13.2075304714
+好闻 11.0674643079
+江西农业大学 13.900677652
+速降 11.0103058941
+十多支 13.900677652
+斗六市 13.2075304714
+舞蹈班 13.900677652
+外业 12.5143832909
+好问 13.900677652
+百余具 12.8020653633
+速来电 12.2912397395
+五百多 10.5684731418
+转忧为喜 13.2075304714
+龙舟赛 13.900677652
+咱爷 13.2075304714
+傻小子 11.4157710022
+七十公斤 13.2075304714
+修脚 11.7034530746
+大商 9.27570483869
+群情振奋 12.5143832909
+木亚科 12.8020653633
+萨马拉 11.598092559
+见素抱朴 12.8020653633
+怀祖 12.8020653633
+赵侍郎 13.900677652
+刑鼎 12.2912397395
+郜林 12.5143832909
+浑河 9.96885201925
+伍子胥 10.2897597393
+鸿基 10.6818018271
+低首 11.2616203224
+里瓦达维亚 12.8020653633
+马司主 12.8020653633
+百余座 10.6818018271
+一无所有 9.38981814546
+巴拉赫 12.8020653633
+鼎新 11.1926274509
+刑部 7.96578345636
+宗朝 11.4157710022
+百日 9.37888907493
+戈尔湾 13.900677652
+连动 10.9049453784
+少数票 13.2075304714
+汇水 11.5027823792
+黑白照片 11.8212361103
+沛然 12.8020653633
+咳声叹气 13.2075304714
+拾荒 11.8212361103
+爱剑如 13.900677652
+汤川秀树 11.8212361103
+二袋 13.2075304714
+带路人 13.2075304714
+开发区热 13.900677652
+雅量高致 13.900677652
+腌渍品 13.900677652
+普降大雨 13.2075304714
+单层式 13.2075304714
+氟碳铈矿 12.8020653633
+后窗 10.2371160058
+百方 12.2912397395
+后端 8.88339781516
+杨雄便 11.8212361103
+普鲁士 8.35941410682
+脸软心慈 13.900677652
+弥漫着 9.15574552361
+过目成诵 12.5143832909
+习以为常 9.65218240993
+傅律 13.2075304714
+隆镇卫 13.2075304714
+凯塔 12.8020653633
+过户费 12.8020653633
+入云龙 11.3357282945
+漆柱 12.8020653633
+九一 12.8020653633
+诊治 9.24671730182
+本迪克斯 13.2075304714
+地地导弹 11.0674643079
+交易法 13.900677652
+秋蝉 13.900677652
+逗号 10.7226238216
+后站 12.2912397395
+大嫂 8.55834340001
+宁根 12.2912397395
+陈那之 13.2075304714
+求降 13.900677652
+寻以言 12.8020653633
+邮购目录 13.2075304714
+浑水 10.6818018271
+少数种 10.4349417492
+鱼类学 13.2075304714
+周家 10.5684731418
+多汁 9.66657114738
+陈云林 13.900677652
+周宪 13.900677652
+过敏原 11.1280889297
+沙复明 8.39941944143
+待毙 13.2075304714
+那识君 13.2075304714
+培养人才 10.5684731418
+铃鼓 11.7034530746
+周宣 13.900677652
+担此重任 11.2616203224
+时隶臣 13.2075304714
+周室 11.2616203224
+后稷 11.0674643079
+贝子爷 13.2075304714
+周官 10.6818018271
+救援车辆 13.900677652
+采访员 13.900677652
+没有支撑 12.5143832909
+川家光 12.8020653633
+大娘 9.17328983326
+零秒 13.900677652
+脚骨 13.900677652
+上海牌 12.2912397395
+大威 10.2117981979
+漆木 11.598092559
+非卖品 13.900677652
+宣教部 13.900677652
+李金华 12.8020653633
+忏悔录 11.9547675029
+引路人 12.1089181827
+大婶 9.04086524761
+藉此机会 13.900677652
+马坪里 12.5143832909
+哈拉哈河 11.9547675029
+舞蹈系 12.1089181827
+拾获 13.900677652
+土皇帝 11.3357282945
+夏瓦纳 13.2075304714
+旱魃 10.3743171274
+款目 12.5143832909
+百支 12.8020653633
+百余年 9.77354326693
+慢死 13.2075304714
+卢殿 13.2075304714
+标准普尔公司 11.9547675029
+泽村 13.2075304714
+即以其人之道 13.900677652
+二行 12.1089181827
+主政者 11.598092559
+大婚 10.1871055853
+浑江 10.8096351986
+百余幅 13.900677652
+二街 13.2075304714
+高家俊 13.900677652
+观看电视 13.900677652
+顾一望 12.8020653633
+毕晓普 13.900677652
+三十家 12.1089181827
+阳一阴 11.598092559
+咽下 9.48183704418
+过敏史 11.9547675029
+穹天 13.900677652
+大家 4.87149950907
+非处方药 11.3357282945
+可想而知 8.83808261895
+借贷资本 9.5186510173
+激光束 10.0940151622
+预想到 12.5143832909
+宁南伯 12.5143832909
+陕北黄土高原 11.0103058941
+擀杖 12.2912397395
+大客 12.2912397395
+海蕾 13.2075304714
+月销量 9.74179456862
+一百海里 13.900677652
+大宫 12.8020653633
+赤巴 12.2912397395
+大宗 6.42590546958
+高纯锗 13.2075304714
+福特宝 13.900677652
+吴老苏 13.900677652
+凯夫 12.1089181827
+欢跃 11.7034530746
+高单翼 13.2075304714
+戟状 13.900677652
+大宝 9.96885201925
+大宛 9.94943393339
+大定 9.96885201925
+大官 8.85725253506
+大宇 11.598092559
+大宅 10.4041700905
+脉络分明 12.8020653633
+静冈县 12.5143832909
+大宁 11.0674643079
+本末倒置 10.8096351986
+痘疱 13.900677652
+丽华 10.8561552143
+大安 10.2117981979
+速食 13.900677652
+便辟 13.2075304714
+杨建文 11.4157710022
+斗门镇 12.1089181827
+黄兴路 13.900677652
+陈二人 11.0103058941
+利欲薰心 13.900677652
+早秋 12.2912397395
+大寿 11.2616203224
+泽曼 13.900677652
+燕天王 12.5143832909
+如是说 9.53122979951
+大寺 10.0505300503
+进宝 11.9547675029
+皮雷 13.900677652
+汇流 9.65218240993
+芦汉 11.1926274509
+压下来 10.8561552143
+外置硬盘 13.900677652
+断然拒绝 10.4041700905
+胚子 11.4157710022
+大寨 8.83808261895
+芝麻开门 12.5143832909
+补完 12.2912397395
+气苗 13.900677652
+大寒 11.0103058941
+二见 13.900677652
+龚古尔 11.2616203224
+贼溜溜 12.8020653633
+鹤发童颜 11.5027823792
+后篇 12.8020653633
+磁介质 10.0088573539
+二角 11.3357282945
+进宫 7.58170953823
+特里波 12.5143832909
+大富 11.598092559
+删成 13.900677652
+毛毛娘 12.8020653633
+恭顺 9.93038573842
+工艺设备 11.3357282945
+孙学武 10.0294766411
+库西 11.9547675029
+中国画 9.31571017331
+梅冠三 11.598092559
+花甲之年 12.2912397395
+丁普郎 13.2075304714
+礼品包装 13.900677652
+宁南侯 10.7226238216
+表演场 13.2075304714
+五百块 11.1926274509
+钴粉 13.900677652
+中书令 9.40086798165
+跌进来 13.900677652
+瞻仰厅 13.900677652
+瘦子 10.0720362555
+宽顶堰 13.2075304714
+玻璃胶 13.900677652
+爱立生 13.2075304714
+扑杀 11.598092559
+护民官 13.2075304714
+梁窝状 12.8020653633
+耸人听闻 10.0088573539
+一来一去 12.5143832909
+难以承受 9.93038573842
+够用 10.2371160058
+二中院 11.0674643079
+皮钦尼 13.900677652
+如人饮水 12.1089181827
+排比句 12.2912397395
+大武山 11.9547675029
+耐火砖 12.2912397395
+百感丛生 13.900677652
+乌克兰人 10.533381822
+喜悦感 13.900677652
+坏习惯 9.98865464655
+喽啰 13.900677652
+大学 5.71421322255
+旦旦 13.900677652
+引起争议 11.1280889297
+和田福贤 12.5143832909
+泽普 12.5143832909
+浑浑 11.8212361103
+法制晚报 11.1280889297
+冷凄凄 13.900677652
+挣出 11.5027823792
+户名 12.1089181827
+打哑谜 12.5143832909
+零碎 9.59661255877
+多派 10.2897597393
+看得出来 9.20019728618
+伤势 9.04086524761
+人多口杂 11.598092559
+书牍 11.4157710022
+袁继成 11.1280889297
+进可攻 10.604840786
+杆菌属 10.5684731418
+格罗兹尼 12.2912397395
+漆料 12.8020653633
+北水南调 13.900677652
+保得住 11.0103058941
+杨大爷 13.2075304714
+崇高精神 11.598092559
+周天 10.2371160058
+超乎寻常 11.0674643079
+杨卓然 12.2912397395
+通布图 12.5143832909
+实心砖 12.2912397395
+采访团 10.4994802703
+浑源 11.2616203224
+王弄喧 13.900677652
+姑洗 13.2075304714
+领事裁判权 10.0940151622
+大增 7.16965955149
+真主党 13.900677652
+五十多 11.3357282945
+拖地 10.8096351986
+开管 13.900677652
+进士 7.53249046563
+容不下 10.6818018271
+斯居 12.2912397395
+大壶 12.8020653633
+莫尔顿 13.900677652
+金质奖 10.8561552143
+必有我师 13.900677652
+效果 5.97624346709
+大声 6.48610477063
+阿墨士 13.2075304714
+三十处 13.2075304714
+加冕典礼 11.7034530746
+百架 12.2912397395
+血热型 12.2912397395
+进境 12.1089181827
+三十夜 12.8020653633
+嫡堂 11.598092559
+真犀亚 13.2075304714
+三十多 10.4666904475
+猜透 10.765183436
+大士 9.40086798165
+宗教 6.28685896717
+浮动汇率 10.5684731418
+万片 11.598092559
+百枚 11.8212361103
+百果 12.2912397395
+语文学 11.1926274509
+登革热 12.1089181827
+高速摄影机 13.2075304714
+三十大 13.2075304714
+自主性 9.94943393339
+户型 9.38981814546
+子武公 13.2075304714
+猖狂进攻 13.2075304714
+戒规 12.2912397395
+周奎 11.0103058941
+赏罚 9.82314020807
+票夹 13.900677652
+折现 12.2912397395
+共青团员 11.5027823792
+漂来漂去 13.900677652
+分组码 13.900677652
+公安民警 11.598092559
+李金兰 12.5143832909
+贤士 10.2897597393
+汇源 10.5684731418
+连敬轩 12.2912397395
+杨国忠 10.2371160058
+编配 10.9562386728
+侍近臣 13.2075304714
+大堤 8.6803218269
+巴拉迪 13.2075304714
+百条 11.3357282945
+旦暮 12.5143832909
+户均 9.93038573842
+初夜权 12.5143832909
+覆盖 6.80230201338
+栽绒 11.1926274509
+拖垮 10.7226238216
+大堆 10.4349417492
+郑州铁路局 11.0103058941
+大堂 8.81927328699
+好数 13.900677652
+坂田 13.2075304714
+宋江三 13.2075304714
+司各特 11.0674643079
+骇客 12.8020653633
+道德风险 10.8561552143
+贾瑞前 13.2075304714
+宗族 8.79473217808
+李宝吓 13.2075304714
+索姆 11.9547675029
+鲁棒控制 13.900677652
+情话 10.765183436
+梁晴抱 13.900677652
+百本 13.2075304714
+差额 8.12612610643
+情诗 11.0674643079
+金风寨 11.9547675029
+充分考虑 9.14708746087
+飘风暴雨 13.900677652
+革命烈士 9.71102290995
+韦罗内 12.2912397395
+鼠辈 10.9049453784
+万千瓦 7.59075937375
+五百吨 13.2075304714
+宗旨 7.62403416263
+阻力位 9.31571017331
+禾草 10.1394775363
+游兴正浓 13.900677652
+养血 9.72629038208
+百服 12.2912397395
+抗旱性 12.8020653633
+序列密码 13.2075304714
+连小命 13.2075304714
+报考者 12.2912397395
+汇演 12.1089181827
+汉军详 13.2075304714
+不明飞行物 11.9547675029
+软件开发 10.0505300503
+百曲 13.900677652
+秃岭 13.900677652
+债有主 11.4157710022
+几十光年 13.2075304714
+熊庆胄 13.2075304714
+安肃军 12.1089181827
+民间文学 9.23723855786
+高文秀 12.8020653633
+消息传递 13.2075304714
+九族 10.6818018271
+水乡泽国 11.7034530746
+欢迎 6.9039961638
+铲运机 11.9547675029
+静乐县 13.2075304714
+软件加密 12.5143832909
+防空兵 11.4157710022
+伯俞廉 12.8020653633
+宁死 9.84023464143
+查体 11.4157710022
+大妈 7.63537643924
+博鳌 9.98865464655
+龚鼎 8.43684584695
+催赶着 13.2075304714
+旧思想 11.598092559
+毒化 11.8212361103
+后秦 9.69598503258
+宇文泰军 13.2075304714
+汪明荃 13.2075304714
+祝酒辞 13.2075304714
+后移 9.74179456862
+在此之前 8.13235665618
+双边协定 11.5027823792
+肉芽 11.5027823792
+房颤 11.8212361103
+宇文泰之 12.5143832909
+竟要 10.604840786
+大姨 11.0674643079
+龚胜 13.2075304714
+大姓 9.69598503258
+大姑 11.598092559
+大姐 8.08059472162
+小杨春 11.9547675029
+销案 11.1926274509
+大姚 12.8020653633
+禾苗 11.8212361103
+大姆 12.8020653633
+贾政贾 13.2075304714
+昆布 11.5027823792
+鸡瘟 12.2912397395
+晏驾 11.5027823792
+固位体 13.900677652
+二话 9.96885201925
+掩体 9.87532596124
+刘道醇 13.2075304714
+倒回去 11.7034530746
+美国宇航局 11.3357282945
+大头 9.02548032877
+神不知鬼不觉 10.2630914922
+悠闲地 10.4666904475
+狗皮膏药 11.9547675029
+吕梁山 10.1871055853
+房顶 9.17328983326
+民不聊生 9.89334446674
+争创 11.3357282945
+大大 6.6076599722
+舰上 9.37888907493
+大夥 12.8020653633
+环游世界 12.5143832909
+咬着牙 8.74162235276
+百景 13.900677652
+阔度 13.900677652
+十二指肠 9.66657114738
+大夫 7.31037660378
+潘三保 13.900677652
+西奈半岛 10.9049453784
+鲁德艾 13.900677652
+合理冲撞 13.900677652
+编遣 11.9547675029
+占岳州 12.8020653633
+施有政 13.2075304714
+闭口不言 12.2912397395
+纳希 13.2075304714
+好香 11.3357282945
+大多 6.10956814137
+穹宇 12.2912397395
+大处 11.7034530746
+复色光 11.7034530746
+吉尔巴特 11.598092559
+动动手 12.5143832909
+象形文字 9.98865464655
+智能机 11.0674643079
+天官赐福 11.8212361103
+叶紫 13.2075304714
+掩住 10.4994802703
+安全可靠 9.91169360541
+挖墙脚 13.2075304714
+编选 9.94943393339
+大好 8.99540287354
+开开心心 11.9547675029
+万马克 11.8212361103
+净胜球 12.8020653633
+贤妻 11.1926274509
+贤妹 10.2630914922
+多演 12.1089181827
+外汇行市 12.5143832909
+防空军 10.9562386728
+拖回 11.1280889297
+编造 9.12999302751
+大奖 8.33615724465
+玻璃花 13.900677652
+工贼 12.2912397395
+窒息而死 11.4157710022
+伊朗高原 10.4349417492
+蓝领工人 13.2075304714
+大奇 12.5143832909
+汰劣 12.2912397395
+吴凤庙 12.5143832909
+陈守一 12.8020653633
+附凤攀龙 13.900677652
+能开成 12.2912397395
+檐瓦 13.900677652
+变量值 11.8212361103
+编程人员 13.2075304714
+大康 12.1089181827
+周弼 11.1280889297
+宁汉 11.7034530746
+谷秀 12.8020653633
+治不好 11.0103058941
+第一夫人 11.0674643079
+公孙龙 11.598092559
+款爷 13.2075304714
+发下去 11.7034530746
+大度 9.89334446674
+摸出来 11.598092559
+澳门半岛 11.5027823792
+欺诈性 11.598092559
+养身 11.4157710022
+阔大 10.2117981979
+归并 10.4041700905
+凯尔 11.2616203224
+第七十八回 12.2912397395
+黄黄的 11.0674643079
+大店 12.5143832909
+琐琐 11.4157710022
+大库 11.598092559
+宗赵佶 12.2912397395
+升温快 12.8020653633
+吴香 13.900677652
+大庙 9.37888907493
+大庆 9.00283785202
+大庄 12.5143832909
+五十开 13.2075304714
+分钱 9.6811699468
+二千五百两 13.2075304714
+圆柱体 10.2117981979
+涿鹿县 12.1089181827
+讲道德 12.1089181827
+多棱 12.2912397395
+波德河 12.8020653633
+享有盛誉 9.66657114738
+后续 7.29944753325
+岗前 13.2075304714
+大建 11.1926274509
+新课标 13.900677652
+后继 10.0088573539
+款物 12.1089181827
+数日 8.0229418702
+科南特 12.8020653633
+毕尔巴鄂 12.2912397395
+周彦 13.900677652
+规划组 13.2075304714
+秋官 11.1926274509
+扶住 8.85725253506
+户内 11.0103058941
+谷种 11.9547675029
+拖入 10.4041700905
+长白朝鲜族自治县 12.1089181827
+古体诗 11.1280889297
+美发厅 13.900677652
+孟良崮战役 11.5027823792
+三十张 13.2075304714
+徐仁铸 13.2075304714
+进度 7.90174109003
+房龄 11.5027823792
+奇货可居 11.0674643079
+凯山 13.2075304714
+金锤 13.2075304714
+瘦干 11.7034530746
+难以成眠 12.1089181827
+红锌矿 13.900677652
+扣好 11.1926274509
+新旗云 12.2912397395
+夏和周 13.2075304714
+漳河水库 12.8020653633
+梳妆盒 13.900677652
+诸般品 13.2075304714
+宗授 13.900677652
+共夺 13.900677652
+韦罗基 12.1089181827
+惠斯特 12.8020653633
+股票证券 10.533381822
+程序正确性 12.8020653633
+守纪律 11.5027823792
+谈宗英 12.8020653633
+黑斑病 12.8020653633
+争利 11.7034530746
+宁波 7.50374799676
+鸿博 11.7034530746
+双刃剑 9.74179456862
+金锭 12.5143832909
+大帝 8.82550383674
+绅宦 13.900677652
+发呆地 12.2912397395
+情趣 8.76487921493
+棋圣战 13.2075304714
+悲伤 8.40350942668
+大帅 8.5440913773
+珐琅质 11.8212361103
+大市 8.230796729
+太吵 12.8020653633
+马卡尔 12.5143832909
+书眉 13.900677652
+大师 7.64301006409
+万里拉 12.2912397395
+隐蔽性 9.87532596124
+大平 11.9547675029
+大干 9.61021821083
+多栋 13.2075304714
+周忱 11.3357282945
+文行出处 13.900677652
+新闻广播 11.8212361103
+大幸 10.6818018271
+幕府将军 11.7034530746
+内生性 9.30555780184
+盈亏 9.07236391467
+刘道规 13.2075304714
+冰川 7.34959731693
+智能性 13.900677652
+乌桓常 13.2075304714
+卢奴 12.5143832909
+大幕 8.99540287354
+喁喁 12.1089181827
+谈过去 12.8020653633
+多株 11.4157710022
+百感 13.2075304714
+雅鲁藏布 12.8020653633
+自卑心 13.2075304714
+赛伊尼 13.900677652
+同献忠 10.8096351986
+多格 13.2075304714
+鼎鼎大名 11.2616203224
+大幅 5.12327636511
+多核 11.0674643079
+多根 11.0103058941
+拖出 10.0720362555
+多样 7.60910851242
+姑母 10.642581114
+大德 8.93783302172
+白凤丸 10.642581114
+盈余 9.20019728618
+分子生物学 9.7898037878
+博罗季诺 12.5143832909
+情谊 9.41204128224
+外币存款 12.2912397395
+重力选矿 13.2075304714
+情调 8.9102450652
+自主权 9.38981814546
+分分合合 12.1089181827
+拖倒 11.5027823792
+零米 13.2075304714
+大圣何 11.3357282945
+中东战争 9.87532596124
+在此之后 10.604840786
+雨器 13.2075304714
+法国共产党 11.0103058941
+金话筒 12.2912397395
+百余家 11.0103058941
+宗戚 11.598092559
+大得 8.87023973058
+抢答 12.8020653633
+子午圈 10.9562386728
+五百口 13.2075304714
+卿兄 11.8212361103
+没成想 11.598092559
+跑龙套 11.0103058941
+两栖舰 11.7034530746
+补心 10.8096351986
+五百只 12.5143832909
+周师 12.2912397395
+何存 12.5143832909
+宁海 10.4666904475
+三十年 7.80260336981
+骚乱 9.12155415886
+耽忧 11.8212361103
+五十年 9.29550746599
+理论物理研究所 11.9547675029
+进得 9.5062284973
+周平 10.8096351986
+黄州市 12.8020653633
+全麻 12.5143832909
+周年 7.82763311788
+岗南 11.4157710022
+曼城 12.8020653633
+后晋 9.18217878068
+后翼 12.8020653633
+别以为 9.87532596124
+大忠 12.8020653633
+请举手 13.900677652
+未切割 13.900677652
+书目 9.13850371718
+基律纳 12.8020653633
+竟达 9.65218240993
+胥吏 10.8561552143
+青杏 12.2912397395
+宁津 13.900677652
+龙川令 12.5143832909
+瘦得 10.2897597393
+消费资料 8.74738605748
+熬药 12.1089181827
+补征 13.900677652
+大忙 9.85762638414
+宁洱 13.900677652
+布尔津 10.9562386728
+圣弗兰西斯科 12.1089181827
+哀呼 11.9547675029
+半座 12.1089181827
+孟家花园 13.2075304714
+大忌 10.0088573539
+每周三 13.900677652
+藏品展 13.900677652
+漆成 11.1280889297
+温克勒 13.2075304714
+照上去 12.8020653633
+扫出去 13.2075304714
+镇海港 12.5143832909
+周康 13.900677652
+板系统 13.900677652
+凿冰 12.1089181827
+生活水准 11.1926274509
+栽秧 13.2075304714
+六渡桥 13.900677652
+大张 9.5062284973
+拜在门下 13.900677652
+注脚 10.3743171274
+充电式 13.2075304714
+周庙 13.2075304714
+人心难测 12.8020653633
+尉奉晋 13.2075304714
+周府 12.1089181827
+后缀 10.604840786
+花荣便 11.5027823792
+贫贱 10.3171587135
+闭口不谈 10.9562386728
+后缘 9.27570483869
+哀吊 12.1089181827
+五百卷 12.2912397395
+陈舵主 13.900677652
+沙井镇 13.900677652
+捐赠者 11.7034530746
+大开 8.61747392324
+补录 12.8020653633
+小薛 13.900677652
+文中子 12.5143832909
+旱鸭 13.900677652
+周庄 11.3357282945
+凿凿 12.5143832909
+瘦弱 9.37888907493
+凿出 11.0674643079
+后置 9.87532596124
+南川市 13.900677652
+真器 12.5143832909
+长久性 12.8020653633
+莉莉 10.3743171274
+二起 13.2075304714
+辩护词 12.8020653633
+养车 11.598092559
+鸿利 11.0674643079
+补强 11.8212361103
+贤德 11.3357282945
+平满纳 13.2075304714
+编队 8.98802276624
+黄信便 12.5143832909
+大当 11.4157710022
+百思 12.8020653633
+中低收入 9.75754292558
+三十座 12.5143832909
+规划署 12.2912397395
+羊癫风 12.8020653633
+考爱岛 11.9547675029
+金融学院 10.642581114
+骚人 12.8020653633
+整段 11.3357282945
+百态 11.9547675029
+纳泽尔 12.5143832909
+五百匹 11.0103058941
+血糖值 11.598092559
+总金额 9.0884932966
+魏了翁 12.1089181827
+户口 8.02014466558
+梨园子弟 13.2075304714
+凯布 11.598092559
+贾老板 11.9547675029
+翟城 13.2075304714
+氏族社会 9.6811699468
+八颗 12.5143832909
+直得 11.4157710022
+钢铁股 8.9519177616
+李信见 12.8020653633
+大岭 10.9562386728
+从严治党 11.9547675029
+大岩 13.900677652
+分配资源 12.2912397395
+大岗 13.2075304714
+失信 9.94943393339
+最次 11.8212361103
+挎枪 11.8212361103
+款款 10.0294766411
+南和县 13.900677652
+啥病 11.0103058941
+大岛 9.11318590919
+握住 8.26946587015
+热烈鼓掌 13.2075304714
+金镯 13.2075304714
+独龙 10.4349417492
+子福临 12.1089181827
+横冲 12.8020653633
+凝血剂 12.8020653633
+小董 13.900677652
+八风 13.2075304714
+胚层 10.1394775363
+大峡 11.5027823792
+病理切片 12.2912397395
+户县 10.9049453784
+大峪 11.8212361103
+比斯 11.1926274509
+路易斯安那 10.8561552143
+人生如梦 11.598092559
+拘拿 11.2616203224
+张竞 11.8212361103
+宋江回 11.8212361103
+物极则反 13.900677652
+乌尔禾 11.598092559
+水俣湾 11.7034530746
+汝阳王 13.2075304714
+物主 12.8020653633
+几十颗 11.9547675029
+愣怔 9.98865464655
+皮耶克 11.7034530746
+冷一笑 9.54396882529
+桑蒂斯 12.8020653633
+连皮带骨 12.8020653633
+心狠 10.765183436
+进展 6.29528528716
+两对半 11.8212361103
+皮夹子 12.8020653633
+书画 8.31718134319
+白浆土 11.3357282945
+林黛玉 8.81927328699
+戴宗回 12.5143832909
+酒坛子 11.8212361103
+且莫 9.71102290995
+进屋 8.12923652885
+几十项 13.2075304714
+送审稿 12.5143832909
+追求名利 13.900677652
+截止 7.11058041646
+东豫州 13.2075304714
+来得及 7.61841090508
+进山 8.60236028543
+隐蔽所 13.2075304714
+连轴转 11.8212361103
+酒仙桥 11.8212361103
+书生 8.79473217808
+大将 7.18166449759
+悬浮式 12.8020653633
+漫天大雪 11.9547675029
+水以东 13.900677652
+王鸣盛 12.2912397395
+大封 11.0674643079
+主机 8.70772080109
+大小 5.62989663881
+穹庐 10.2897597393
+拖去 11.598092559
+大尉 10.533381822
+演变成 9.03314320152
+康为帝 13.2075304714
+百多万项 13.900677652
+大山 8.12923652885
+大屿 12.1089181827
+维护团结 12.8020653633
+贺信 11.8212361103
+苑囿 11.0103058941
+门底下 13.2075304714
+最毒 11.2616203224
+史杨仪 12.5143832909
+须溪集 13.900677652
+大屯 10.3453295905
+训练法 12.8020653633
+劲草 12.5143832909
+倾城倾国 13.2075304714
+靖志远 13.2075304714
+逆着 12.1089181827
+大展 10.4041700905
+黎城 11.5027823792
+取反 13.2075304714
+教席 11.3357282945
+补射 12.2912397395
+外出血 13.2075304714
+鸿儒 11.0674643079
+风流才子 11.0103058941
+小涨 10.3171587135
+八顷 13.2075304714
+防污染 11.7034530746
+分列为 13.2075304714
+大局 7.78921031247
+戒赌 13.900677652
+石川岛 12.8020653633
+八项 10.1871055853
+龚二人 12.5143832909
+大屋 10.7226238216
+外交界 11.8212361103
+瘦小 9.59661255877
+祝酒词 12.2912397395
+补差 12.2912397395
+任职期间 9.87532596124
+而今 8.52539924429
+枪靶 13.900677652
+天王星 9.96885201925
+氢溴酸 11.598092559
+猴王 9.23723855786
+终能 11.8212361103
+多毛 10.6818018271
+多比 12.2912397395
+在实践上 11.598092559
+两三公里 11.9547675029
+诺氟沙星 13.900677652
+祸起萧墙 12.5143832909
+墨江哈尼族自治县 12.5143832909
+假性 10.533381822
+汇款 9.43476953332
+吴为熬 13.2075304714
+拖到 9.38981814546
+赤峰 9.75754292558
+蜜饯 9.77354326693
+在实践中 9.0884932966
+蘘荷 13.2075304714
+神经类型 13.2075304714
+大巷 13.900677652
+布里亚特 11.598092559
+大巴 10.1164880181
+库达 12.5143832909
+逗哏 13.2075304714
+周山 9.87532596124
+关在东 12.8020653633
+阔步前进 12.5143832909
+凿印 12.8020653633
+井平灶 13.2075304714
+大工 11.0674643079
+锡铁山 11.8212361103
+枪管下 13.900677652
+四书五经 11.1280889297
+大差 13.2075304714
+洗出来 12.8020653633
+大巫 11.9547675029
+毫发不差 13.2075304714
+编钟 10.3453295905
+百折 11.9547675029
+攻击速度 13.2075304714
+萧何采 12.8020653633
+尼家嗣 13.900677652
+诛求 11.9547675029
+兵要地志 12.1089181827
+逗人 11.0103058941
+减食 13.900677652
+百把 11.4157710022
+土地革命 9.84023464143
+几十首 13.900677652
+小嘴儿 11.7034530746
+自动开机 13.900677652
+多段 11.9547675029
+毛公鼎 11.4157710022
+折皱 13.2075304714
+东奔西 12.2912397395
+二进 11.8212361103
+一心二用 13.900677652
+单位名单 12.5143832909
+五百元 11.1280889297
+十公分 12.2912397395
+劲舞 12.8020653633
+把斋 12.1089181827
+芦洲 12.5143832909
+防治法 11.598092559
+瘫子 13.2075304714
+马步芳 12.1089181827
+服毒自杀 11.3357282945
+国外市场 9.66657114738
+百余头 13.2075304714
+快想 12.2912397395
+探险队 9.48183704418
+多此 12.1089181827
+多步 13.2075304714
+长远性 12.5143832909
+体体面面 11.7034530746
+百余处 11.0674643079
+李旭旦 12.8020653633
+五百具 13.2075304714
+连叫 13.900677652
+五十岁 9.74179456862
+治黄 11.9547675029
+凯德 11.598092559
+西军之 12.8020653633
+周岁 8.80081122415
+贺云 11.4157710022
+说长说短 13.900677652
+掉过头来 11.3357282945
+养起 12.5143832909
+零级 11.3357282945
+二轮 10.8096351986
+重组股 9.82314020807
+三十岁 9.55687223012
+百户 10.2117981979
+禾虫 13.2075304714
+二门 8.65893063692
+马兰草 12.1089181827
+提袋 12.8020653633
+孤零 11.4157710022
+文翔凤 13.2075304714
+杜鹃花节 13.900677652
+二载 10.4666904475
+零线 12.1089181827
+百战 10.6818018271
+绅士 8.88339781516
+治安部门 12.8020653633
+多次 5.9192860704
+孤雁 10.9562386728
+倒计时 9.85762638414
+夹进去 13.900677652
+多款 9.63799777493
+店伙计 11.3357282945
+百戏 9.82314020807
+陕西人 10.8561552143
+嘿嘿嘿 10.9562386728
+插一脚 13.900677652
+曲意奉承 12.1089181827
+上榜 8.85082164473
+大抵 8.97342396682
+软鞋 12.1089181827
+尉迟孙 12.5143832909
+漆得 11.9547675029
+活字典 13.900677652
+座落 11.2616203224
+岸堤 12.5143832909
+进拜 12.2912397395
+外科 8.92394390956
+大报 11.2616203224
+多立方米 12.1089181827
+殷秀梅 13.900677652
+宗弟 13.2075304714
+镇海县 12.8020653633
+鬼哭神嚎 12.1089181827
+百工 10.4349417492
+马相迎 12.2912397395
+汇合 8.13548654919
+甘罗格 12.8020653633
+贤才 10.5684731418
+百川 10.9049453784
+荷重 12.1089181827
+藏医学 11.5027823792
+多哥 10.0505300503
+马利肯 12.1089181827
+贴进去 12.5143832909
+外积 12.2912397395
+大亚湾 10.7226238216
+色素体 10.2630914922
+大佛寺 10.3171587135
+娇韵诗 13.900677652
+驸马爷 12.2912397395
+相似乃尔 12.5143832909
+外移 11.4157710022
+向直军 12.8020653633
+节节败退 10.4666904475
+残余物 11.598092559
+揉作 13.900677652
+卢齐利 13.2075304714
+贪钱 13.2075304714
+哀哀欲绝 12.1089181827
+责编 12.8020653633
+声音洪亮 10.4994802703
+大小事 11.598092559
+宗彝 11.9547675029
+富斯特 13.900677652
+推进改革 9.74179456862
+中国农行 12.2912397395
+让给 8.66423568915
+举用 13.2075304714
+纳达尔 13.2075304714
+多咯 13.900677652
+凯恩 9.4233408375
+王陵变 13.2075304714
+查理 9.20019728618
+现炒现卖 13.900677652
+狄奥提 13.900677652
+人离乡贱 13.900677652
+山东省委 12.2912397395
+谦和 10.3171587135
+交易品 12.1089181827
+大户 7.68606955355
+杨曾 12.2912397395
+王陵区 11.3357282945
+黑眉乌嘴 13.900677652
+重钢 12.2912397395
+大房 11.598092559
+拉拉扯扯 10.604840786
+培植出 13.900677652
+纪念塔 9.98865464655
+考试内容 11.5027823792
+脸软 12.8020653633
+传为笑谈 12.8020653633
+哩哩啦啦 12.5143832909
+余万斤 13.2075304714
+图书馆学 10.0940151622
+外祖 12.2912397395
+烂尾楼 10.642581114
+茨坝 13.2075304714
+嫡系 10.1164880181
+格鲁吉亚 9.5186510173
+小刀会 10.8561552143
+镇海区 12.8020653633
+那雄伟 13.900677652
+丈母娘 10.1630080337
+尼龙布 13.900677652
+大成 7.65845438652
+大戟 11.3357282945
+管理学家 11.7034530746
+托尔任 13.900677652
+大战 7.40390266179
+巨额利润 10.4349417492
+水泥池 13.2075304714
+慢化 12.8020653633
+医技 13.2075304714
+代糖 13.2075304714
+凿沉 12.5143832909
+大戏 9.01787572939
+界面显示 13.900677652
+丹麦队 13.900677652
+浑名 13.2075304714
+四洲志 12.5143832909
+多味 11.5027823792
+多名 7.87965430263
+王允大 13.2075304714
+多吉 10.2630914922
+任其子 12.5143832909
+蘸笔 12.5143832909
+别跟我 10.5684731418
+寿佛 11.5027823792
+别跑 11.8212361103
+憍陈如 13.2075304714
+权力下放 11.3357282945
+大批 6.76419444339
+追上去 10.0505300503
+扭扭捏捏 11.3357282945
+大扫 11.8212361103
+多向 10.8561552143
+铭记在心 11.0103058941
+原生晕 13.2075304714
+于己于人 13.900677652
+大打 10.765183436
+交易员 8.78268383956
+封短信 13.2075304714
+百儿八十 12.2912397395
+岸壁 11.4157710022
+自白书 13.900677652
+大扇 12.8020653633
+凸缘 12.8020653633
+千多亿吨 12.5143832909
+吕班 13.900677652
+苗栗市 13.2075304714
+无怨无悔 11.0103058941
+宗废德 13.2075304714
+汉成帝 11.1926274509
+大手 9.01787572939
+白衫子 13.2075304714
+领带夹 13.2075304714
+重锤 11.1926274509
+袁文才 12.8020653633
+五十户 12.2912397395
+全音符 13.900677652
+最后 4.65651573152
+交响乐队 10.642581114
+滨河公园 12.1089181827
+宗师 10.2371160058
+正直无邪 13.900677652
+玉山闯 13.900677652
+止咳药 11.9547675029
+干好 10.9049453784
+探测仪 11.7034530746
+款步 12.8020653633
+进口轿车 13.2075304714
+宗帝 13.900677652
+百余架 12.8020653633
+岸头 13.900677652
+凿洞 11.598092559
+矢言 13.900677652
+大排 10.7226238216
+愁苦 10.0720362555
+周成 11.598092559
+浑然 10.604840786
+遥遥地 12.5143832909
+灭火器 11.1280889297
+百余枚 13.2075304714
+马拉喀什 11.4157710022
+焦作人 12.8020653633
+穿越 8.24119543622
+王玄策 11.1926274509
+天桂海 13.2075304714
+李如梅 13.2075304714
+压担子 13.2075304714
+神学家 9.5062284973
+联合国粮食及农业组织 13.2075304714
+躬行 11.598092559
+香精 9.63799777493
+灭门绝户 13.900677652
+协调员 11.8212361103
+凸纹 13.2075304714
+两性间 12.5143832909
+昆弟 12.5143832909
+刘使君 11.4157710022
+感恩节 9.77354326693
+零儿 13.2075304714
+忙来 12.2912397395
+重镇 8.00352378434
+点到为止 11.4157710022
+张敞 13.2075304714
+耐酸碱 11.4157710022
+引蛇出洞 12.1089181827
+王秀珍 11.2616203224
+艺苑 11.3357282945
+氧化剂 9.45802639549
+商品学 13.2075304714
+寻哥 12.8020653633
+百岁 9.85762638414
+凌霜 12.8020653633
+热爱集体 12.5143832909
+待到 8.99540287354
+第十七次 10.0720362555
+大直 13.2075304714
+吴若甫 12.5143832909
+接受考验 11.5027823792
+江宽水 12.5143832909
+职务犯罪 11.0103058941
+吉祥天 12.1089181827
+拖沓 10.9049453784
+横向速度 13.900677652
+真圆 13.900677652
+大振 9.63799777493
+宋振平 13.900677652
+如鱼得水 10.6818018271
+宗庙 9.5186510173
+周报 7.42370528909
+周折 9.63799777493
+施放烟火 13.900677652
+冰碴 12.2912397395
+韦家营 13.2075304714
+乱了套 10.8096351986
+镇纸 11.1926274509
+镇级 13.900677652
+一片汪洋 10.533381822
+一九六七年 11.8212361103
+所罗门群岛 10.3171587135
+电话拨号 13.2075304714
+讽刺画 11.8212361103
+爬行动物 9.41204128224
+五十把 12.1089181827
+蓝毗尼 13.2075304714
+大捷 8.77077893705
+深入群众 11.7034530746
+百尺 10.9049453784
+全兵团 11.8212361103
+煞费 11.9547675029
+穿起 10.7226238216
+宁冈 11.3357282945
+休闲鞋 13.2075304714
+联防 10.5684731418
+侧冲 13.900677652
+待办 12.8020653633
+邢德全 13.2075304714
+婉丽 11.598092559
+家姑 13.900677652
+郭经理 11.598092559
+联队 8.4980002701
+酣醉 12.8020653633
+拖泥 12.8020653633
+系牢 12.8020653633
+科学技术委员会 10.642581114
+祷念 13.900677652
+袁继威 12.8020653633
+鸿渐 12.5143832909
+百尊 13.900677652
+交易商 8.73589167805
+百封 13.900677652
+怀疑对象 11.5027823792
+效尤 11.4157710022
+心王 13.900677652
+凋亡 13.2075304714
+萨空了 12.8020653633
+粗调 13.900677652
+大悲 10.0720362555
+宁可信其有 10.8561552143
+鄂州市 11.2616203224
+喂鸡 11.4157710022
+棋后 12.8020653633
+大悦 10.9562386728
+多回 12.5143832909
+大患 10.4349417492
+重阳 8.81927328699
+多四 13.2075304714
+窦尔墩 13.2075304714
+狂话 12.5143832909
+标价签 13.900677652
+直径 7.17204903889
+小火花 13.2075304714
+直待 10.7226238216
+一十六员 12.2912397395
+大悟 10.8561552143
+狂语 13.900677652
+缅因 12.5143832909
+三二零 13.2075304714
+多国 9.5062284973
+圣雷莫 13.2075304714
+李瀚章 13.2075304714
+消化不良 9.58318953844
+钱志节 13.900677652
+标准局 12.1089181827
+政治论文 12.5143832909
+整理出来 11.1280889297
+龈交 13.2075304714
+西水坡 12.5143832909
+星星点点 10.2371160058
+怀了孕 10.765183436
+辉绿岩 10.9049453784
+歌德巴赫 13.900677652
+动植物种 12.8020653633
+小姐儿 12.5143832909
+侯受封 12.8020653633
+最坏 8.60737282725
+抢险救灾 11.1926274509
+或多或少 8.33615724465
+齐大非偶 13.900677652
+滑膛炮 9.82314020807
+工作力度 10.1630080337
+存储元件 13.2075304714
+订购电话 13.2075304714
+躲藏在 10.765183436
+皮袋子 13.900677652
+皮钦查 13.2075304714
+旗舰级 13.900677652
+衷情 11.7034530746
+泽州 11.0674643079
+粗豪 11.7034530746
+呼叫声 11.1280889297
+必选课 13.2075304714
+亿千克 11.1280889297
+洪昭光 11.1280889297
+漆工 11.9547675029
+少问 13.900677652
+大惊 7.86759143018
+争多论少 13.900677652
+各街道 12.5143832909
+萨拉勒 13.2075304714
+森林上限 11.8212361103
+树顶 10.7226238216
+惠姑娘 12.1089181827
+院中 7.89679058487
+贤惠 10.4041700905
+偷起来 13.2075304714
+木塞子 13.900677652
+西境南 12.8020653633
+合而为一 10.2117981979
+二三千年 12.1089181827
+丽森 13.900677652
+斗争方式 11.598092559
+粗毛布 13.900677652
+红辣椒 10.642581114
+折氏 12.5143832909
+地面部队 9.82314020807
+冰箱 8.44963919841
+大怒 7.82074445688
+哈谢克 12.5143832909
+顽匪 13.900677652
+黎德寿 13.900677652
+一路领先 12.8020653633
+步兵团 9.94943393339
+醉杨 12.8020653633
+急痛攻心 13.900677652
+蕤宾 12.8020653633
+对劲儿 10.3743171274
+不单是 9.49395840471
+若烹小鲜 13.2075304714
+重新处理 13.2075304714
+百强 9.61021821083
+邪僻 13.2075304714
+寻梅 13.900677652
+凯拉 12.8020653633
+卡巴尔达 11.8212361103
+怒气冲冲 9.56994431169
+张克辉 13.900677652
+三座大山 11.598092559
+阿代尔 13.900677652
+南环路 11.8212361103
+浑噩 12.5143832909
+认真学习 9.80633308975
+经叔平 10.604840786
+大恩 9.91169360541
+溶度积 13.2075304714
+大恒 10.642581114
+肝功能 9.66657114738
+挣着 11.3357282945
+安王 11.7034530746
+撬门 11.9547675029
+够买 11.5027823792
+阿拉斯加州 10.9049453784
+副厅长 9.94943393339
+王陵免 13.2075304714
+即是色 13.900677652
+权能 11.1926274509
+多嘴 9.87532596124
+马梅特 13.900677652
+吸进来 12.8020653633
+联销 12.8020653633
+渴睡 12.2912397395
+官乃正 13.900677652
+截图 11.5027823792
+显易 13.2075304714
+玄远旷 13.2075304714
+锦鸡儿 11.1280889297
+审美观 11.0674643079
+贤慧 11.1926274509
+亚力 12.2912397395
+蛊惑 10.4041700905
+百余斤 12.8020653633
+兴安区 12.5143832909
+相勾结 10.604840786
+宁南 11.7034530746
+各过 13.2075304714
+啪嚓 12.8020653633
+周性 13.900677652
+一两千块 13.900677652
+候车室 10.2371160058
+重霄 12.5143832909
+截回 13.900677652
+胚胎学 10.0940151622
+宁卫 12.2912397395
+夏文化 10.642581114
+软钢 13.2075304714
+粗质 13.900677652
+萨拉卡 13.2075304714
+擦边 13.2075304714
+扁扁的 11.7034530746
+基本思路 11.2616203224
+好好学 12.1089181827
+吊白块 11.8212361103
+逆我者亡 12.2912397395
+质量事故 12.5143832909
+汉宁王 13.2075304714
+万象更新 12.1089181827
+定点转动 11.7034530746
+效应 6.15437698974
+百余日 11.9547675029
+卢维 13.900677652
+申鲜虞 13.2075304714
+而回 13.900677652
+宁化 11.1280889297
+位能 11.5027823792
+若尔盖 10.8096351986
+熊猫馆 13.900677652
+百度 8.71329184614
+百座 11.8212361103
+鸿沟 9.35738286971
+愁肠 10.8096351986
+渴盼 11.598092559
+慎终如始 13.900677652
+乌兰哈达 12.2912397395
+查看 7.1877214513
+披萨 13.900677652
+租赁契约 13.2075304714
+两打 12.1089181827
+土壤结构 11.5027823792
+多亿港元 12.1089181827
+贤愚 10.9562386728
+宗山 12.2912397395
+穿过 6.90308166899
+软银 11.9547675029
+明德门 12.1089181827
+养静 12.5143832909
+伸进来 12.8020653633
+冰清玉润 13.900677652
+冰窖 10.4994802703
+临泽 11.598092559
+保国寺 12.5143832909
+查知 12.2912397395
+需求预测 11.8212361103
+百年 8.01179969364
+冰窟 10.604840786
+通风道 13.2075304714
+稻草人 11.3357282945
+鸣门 13.2075304714
+标准差 10.5684731418
+马加丹 13.2075304714
+刘中藻 11.2616203224
+服好 12.2912397395
+多块 10.0940151622
+刚柔相济 10.765183436
+宋江久 13.2075304714
+魏初行 12.8020653633
+大话西游 13.2075304714
+具名 9.25628675283
+生日派对 13.900677652
+光致抗蚀剂 13.2075304714
+宁可 8.10158499752
+周瑞旺 13.2075304714
+旧事重提 11.1926274509
+歧黄 12.1089181827
+浑圆 9.44633035572
+大意 8.60737282725
+外空 12.1089181827
+削减到 12.5143832909
+窃以为 10.533381822
+外穿 12.2912397395
+外稃 11.8212361103
+狂言 10.3743171274
+生态农业 10.4666904475
+这一来 8.85725253506
+没大没小 11.598092559
+社科界 13.900677652
+吴质 13.2075304714
+微末 11.0103058941
+重音 10.6818018271
+靡费 12.1089181827
+路远物 13.2075304714
+铁山港 12.8020653633
+省煤器 13.900677652
+柳公权 11.2616203224
+特邀嘉宾 12.2912397395
+苹果电脑 13.2075304714
+青春 7.89926277401
+陈云峰 13.2075304714
+业余时间 10.3453295905
+公共安全 9.93038573842
+李善邦 13.2075304714
+多场 10.7226238216
+诉情 13.900677652
+宁县 10.4994802703
+大慈 11.2616203224
+肝胆俱裂 12.8020653633
+行得通 10.9049453784
+重造 11.9547675029
+重逢 9.48183704418
+狂跌 11.1926274509
+简化版 12.8020653633
+胥浦 12.5143832909
+歇脚 10.0940151622
+古典家具 13.900677652
+周末 7.61467955747
+外心 11.4157710022
+狂跑 12.5143832909
+集热器 11.598092559
+巩义市 9.66657114738
+加官晋爵 11.598092559
+贺电 12.1089181827
+敬轩将军 10.604840786
+民进党 12.8020653633
+放射形 11.7034530746
+慎行 11.9547675029
+周期 6.34111815597
+大暑 11.7034530746
+周朝 8.93783302172
+斗牛 10.2630914922
+百姓 6.19451468178
+三十条 11.5027823792
+经济作物 7.86759143018
+数字型 12.8020653633
+左轮 12.8020653633
+东山岛 11.1926274509
+转瞬即逝 10.1630080337
+生子名 12.5143832909
+红骨髓 12.5143832909
+转换规则 11.8212361103
+三级预防 13.900677652
+楚惠王 12.2912397395
+生物膜 10.604840786
+李宝臣 13.900677652
+中国科学院自动化研究所 13.2075304714
+宁吉 11.1926274509
+最先 7.78699547214
+书信 8.04274449749
+五十条 13.2075304714
+宿命论 10.3453295905
+二万左右 13.2075304714
+手脚无措 13.2075304714
+雁湖 12.8020653633
+贤明 10.2371160058
+宗学 12.2912397395
+经济过热 9.82314020807
+挑挑拣拣 12.1089181827
+最全 10.4994802703
+周村 11.598092559
+斯谟则 13.900677652
+卢秉 13.2075304714
+珍珠鸡 12.1089181827
+最具 7.82303540863
+龙骧虎步 13.2075304714
+编造谎言 12.8020653633
+祖北征 13.900677652
+包合物 12.5143832909
+中共甘肃省委 12.8020653633
+幸童 12.8020653633
+大显 11.0674643079
+沈从龙 13.2075304714
+盈盈 9.87532596124
+地史学 11.8212361103
+慢地 13.2075304714
+自立门户 11.3357282945
+风流云散 12.8020653633
+宗宝 13.2075304714
+凯撒 9.77354326693
+定标器 13.900677652
+宗室 8.11378027061
+宁哥 12.8020653633
+革新者 12.1089181827
+氏症 12.1089181827
+书会 11.1280889297
+感光纸 13.900677652
+周林 12.2912397395
+百套 13.900677652
+郑吉至 13.2075304714
+七十七座 13.2075304714
+水利部 11.1280889297
+最冷 9.72629038208
+可亲可敬 13.900677652
+小圆邻 13.900677652
+大昌 10.2897597393
+慎裕 13.2075304714
+多倍 9.15574552361
+起义者 9.5186510173
+东宝 10.533381822
+最准 12.2912397395
+盖棺 12.2912397395
+石湖来 12.1089181827
+百头 11.9547675029
+大智 12.5143832909
+百天 11.8212361103
+宋江便 9.27570483869
+多借 13.2075304714
+查点 10.765183436
+索赔权 13.900677652
+龙华塔 12.5143832909
+吊民伐罪 10.604840786
+穿衣 9.29550746599
+百大 9.69598503258
+发射率 10.8096351986
+百多 11.5027823792
+书体 9.82314020807
+百夜 13.900677652
+关顾 12.2912397395
+服毒自尽 11.7034530746
+周某 11.1926274509
+训练团 10.8096351986
+网里 11.2616203224
+多值 11.7034530746
+包天心 10.765183436
+服帖 10.765183436
+周柏 12.5143832909
+书法导报 13.2075304714
+全盘考虑 13.2075304714
+杀人者死 12.1089181827
+纤维材料 12.5143832909
+阻力点 12.8020653633
+灭火剂 11.5027823792
+同社友 11.7034530746
+安灵 12.2912397395
+一两千元 11.598092559
+花无百日红 12.8020653633
+普鲁斯 11.1926274509
+王廷诏 12.8020653633
+二二八 11.8212361103
+挣点 10.765183436
+大枣 9.85762638414
+粟帛皆 13.2075304714
+寻中星 13.900677652
+书亭 13.2075304714
+硫化染料 12.8020653633
+大林 10.604840786
+事实证明 8.85725253506
+生物能 11.0674643079
+张方 12.5143832909
+慈焕抱 13.2075304714
+旦夕 9.84023464143
+于连泉 13.2075304714
+周易 9.12155415886
+大枝 11.7034530746
+以身作则 10.533381822
+易生根 13.2075304714
+正长石 11.8212361103
+周明 12.8020653633
+训练场 10.9049453784
+多出 8.35941410682
+周昂 11.598092559
+刘养正 13.2075304714
+糊糊涂涂 11.1280889297
+杨凌农业高新技术产业示范区 13.900677652
+多册 12.2912397395
+上楼 8.98069672615
+言诗者 13.2075304714
+四十六日 12.5143832909
+汇兑 8.55357012126
+书价 13.2075304714
+利伯维尔 12.1089181827
+重酬 12.8020653633
+野豌豆 12.2912397395
+趵突泉 11.0103058941
+周景 12.1089181827
+张廷发 13.2075304714
+乙级队 13.2075304714
+沙僧拢 13.2075304714
+书仪 12.1089181827
+王义仁 10.8561552143
+胥氏 13.900677652
+后窗玻璃 12.8020653633
+啥事 8.5440913773
+维登科 12.2912397395
+重配 11.4157710022
+栝楼 11.4157710022
+闯入 9.05649056552
+大柜 11.2616203224
+盈眶 11.9547675029
+补助款 11.9547675029
+郎转祠 13.2075304714
+汇入 7.94225295895
+乐毅畏 12.8020653633
+树龄 10.2117981979
+无聊者 12.5143832909
+拉斯卡拉 11.1926274509
+花荣听 11.9547675029
+闯关 10.3171587135
+凸窗 13.900677652
+法赫鲁 12.5143832909
+冰粒 12.8020653633
+乱说一通 12.5143832909
+进村 9.87532596124
+饶饶 12.8020653633
+袁弘 13.900677652
+多克 11.5027823792
+凯文 12.1089181827
+多兆 13.900677652
+怒火中烧 10.9049453784
+多元 7.82993992397
+灼熟 13.900677652
+终端用户 11.5027823792
+妆台 11.0674643079
+多党 10.642581114
+充电机 13.2075304714
+大本 11.4157710022
+服役 7.2726362758
+过敏源 11.9547675029
+大木 10.4041700905
+凯斯 11.7034530746
+平生之愿 11.598092559
+二等奖 9.35738286971
+运出去 11.8212361103
+消极影响 10.765183436
+人面像 13.900677652
+书业 12.1089181827
+书丛 12.8020653633
+吊舱 9.11318590919
+觥筹交错 11.1926274509
+两班 9.59661255877
+折射角 11.9547675029
+进来 5.75338939327
+多养 13.2075304714
+噼噼啪啪 10.4041700905
+杨志大 13.2075304714
+书上 8.97342396682
+多具 10.2630914922
+多兰 12.1089181827
+波浪滔天 12.5143832909
+大有 7.78921031247
+大月 11.598092559
+悲嗟 13.900677652
+凯旋 9.24671730182
+波音公司 9.87532596124
+冰糕 12.5143832909
+大板 10.4666904475
+红旗招展 11.4157710022
+护肩 13.900677652
+大杼 13.2075304714
+最像 12.1089181827
+乌拉特后旗 12.5143832909
+头上脚下 12.2912397395
+宫太监 12.8020653633
+指标股 8.92394390956
+知书达礼 12.8020653633
+大杯 11.3357282945
+进有 11.1280889297
+被除数 12.1089181827
+大杨 10.4994802703
+隐蔽处 10.765183436
+放气门 13.900677652
+体育馆 9.10488710638
+春秋战国 8.18694484647
+大村 10.9562386728
+自我中心 11.7034530746
+重重 8.12612610643
+重量 6.88766186234
+汇出 9.49395840471
+烦躁不安 9.96885201925
+从我做起 13.2075304714
+麦斯欧 12.5143832909
+重金 9.27570483869
+闯出 10.3453295905
+大李 10.9562386728
+阿维勒 13.2075304714
+专席 13.900677652
+乌孙兵 12.5143832909
+毫不客气 9.98865464655
+专题报道 11.8212361103
+座舱 9.33632946051
+喝西北风 10.5684731418
+具体物 13.900677652
+冰缘 10.0088573539
+氟化物 10.3743171274
+外交大臣 9.66657114738
+花飞散 13.900677652
+查特 12.8020653633
+干头 11.9547675029
+宗神 11.8212361103
+守本分 12.1089181827
+五十支 13.2075304714
+拖欠 9.10488710638
+柴达木河 11.5027823792
+汇到 11.2616203224
+丽江 9.29550746599
+北辛庄 12.8020653633
+数一点二六倍 13.2075304714
+李善长 10.8561552143
+外翻 10.765183436
+外翼 11.598092559
+孙将军 11.8212361103
+宗祧 12.1089181827
+陕西省 8.08059472162
+足球城 13.900677652
+四处寻找 10.642581114
+截去 11.8212361103
+贾母问 11.7034530746
+周数 12.8020653633
+小口袋 10.9049453784
+百家 9.34680076038
+悲痛 8.41173992582
+捡钱 11.3357282945
+勒乌 12.5143832909
+多办 12.1089181827
+正忙着 9.96885201925
+污言秽语 12.8020653633
+训练员 13.900677652
+后步 13.2075304714
+流行色 13.2075304714
+靖安县 12.8020653633
+吊臂 10.7226238216
+待用 11.8212361103
+百官 8.02014466558
+三十支 13.2075304714
+待售 10.765183436
+百宝 10.3453295905
+蒙托夫 10.9049453784
+慎言 12.1089181827
+多加 9.20019728618
+二百多个 13.2075304714
+兰国未 13.2075304714
+场频 13.2075304714
+叶浅予 11.598092559
+东丹王 13.2075304714
+龙光塔 12.8020653633
+咽炎 10.4994802703
+自感系数 12.5143832909
+皮乌斯 12.8020653633
+抒发感情 12.5143832909
+帝企鹅 13.2075304714
+足球圈 11.2616203224
+吊脚 13.2075304714
+丽泽 13.2075304714
+周新 12.5143832909
+蒙卡尔 12.8020653633
+纯棉布 13.900677652
+褒贬不一 11.1280889297
+五十斤 10.765183436
+碰锁 13.900677652
+旭东 12.8020653633
+惨兮兮 13.2075304714
+顺价 12.5143832909
+党和人民 10.0940151622
+跟踪目标 11.1280889297
+透闪石 11.1926274509
+三十日 10.0088573539
+外罩 10.2371160058
+三百余次 13.2075304714
+外置 12.5143832909
+百字 12.1089181827
+顺序程序 12.8020653633
+卢笑 13.2075304714
+足球场 10.4666904475
+拖欠货款 12.8020653633
+外语成绩 13.900677652
+周文 10.8561552143
+泼妇骂街 13.900677652
+愕然 9.16447920358
+沧海一粟 11.5027823792
+西服革履 12.8020653633
+歇菜 12.8020653633
+瓦罗加 9.12999302751
+剑桥大学 8.9519177616
+物价管理 12.5143832909
+周旨 12.8020653633
+折伞 13.900677652
+多则 9.22784881751
+外缘 9.72629038208
+流遍全身 12.2912397395
+柬埔寨 8.66956903512
+多划 12.5143832909
+周日 8.66423568915
+下基层 11.9547675029
+冒冒失失 10.0720362555
+多利 11.0103058941
+三十斤 10.765183436
+宗姬 12.5143832909
+最可 11.1280889297
+战列舰 9.54396882529
+大摆 11.0103058941
+周族 11.1280889297
+支柱行业 11.9547675029
+多刻 12.8020653633
+佛法无边 12.1089181827
+多到 10.3743171274
+卡帕克 11.9547675029
+多双 12.8020653633
+半屏山 12.5143832909
+人事工作 12.5143832909
+大新 9.74179456862
+罗内克 11.598092559
+宗禅 12.2912397395
+大方 8.31718134319
+外经 11.2616203224
+袁世凯 6.9731197457
+普林西普 11.9547675029
+大鹏湾 11.1926274509
+多变 8.45825994145
+蔓荆子 12.8020653633
+徐宏基 13.2075304714
+多受 10.4994802703
+多发 8.98069672615
+最初 6.37449873863
+大斗 10.8096351986
+两抵 13.2075304714
+多只 8.03704647638
+江轮 11.0674643079
+焦虚寒 12.5143832909
+浑厚 9.34680076038
+烟臭 13.2075304714
+大料 11.598092559
+多口 11.4157710022
+待命 9.53122979951
+贴砖 13.900677652
+王继光 11.1926274509
+布兰卡 12.5143832909
+茶文化 11.1926274509
+多号 12.5143832909
+多台 10.0505300503
+折价 8.30596627237
+白石灰 13.900677652
+善于词令 13.900677652
+汇单 13.2075304714
+多片 11.7034530746
+吃大锅饭 12.8020653633
+狂躁 10.4666904475
+大旱 9.75754292558
+穆索尔 11.8212361103
+内藏式 12.5143832909
+进料 12.5143832909
+金壮龙 13.2075304714
+最前 10.765183436
+镜中人 13.2075304714
+浑古 13.900677652
+联邦 7.35964765279
+防空洞 9.28555713513
+悬壶济世 13.2075304714
+徐晃引 12.8020653633
+打牙犯嘴 13.2075304714
+大早 11.5027823792
+大旨 12.1089181827
+大旗 8.15767446417
+买不到 9.46986085313
+大跳水 10.765183436
+子午流 11.4157710022
+二十余种 12.2912397395
+威利斯 12.2912397395
+页表 11.8212361103
+亚硫酰氯 12.2912397395
+多去 10.6818018271
+大族 8.74162235276
+贾老师 11.0103058941
+岗楼 11.8212361103
+外线 10.1630080337
+阳明病 11.5027823792
+多半 7.61467955747
+大政 9.08039608637
+大放 10.7226238216
+缓召 13.900677652
+日用电器 12.8020653633
+大改 11.3357282945
+宁城 10.0720362555
+七八十天 13.900677652
+马伊堪 10.2371160058
+范聚普 13.2075304714
+岩石层 11.9547675029
+补数 13.900677652
+若无其事 9.4233408375
+增压泵 13.900677652
+谦卑 10.4041700905
+有条不紊 9.80633308975
+养鸡业 11.9547675029
+石墨制品 13.900677652
+躬身 7.75220935606
+吊耳 10.8096351986
+和岸勤 13.2075304714
+事迹报告 13.2075304714
+多卷 10.604840786
+补救 9.21854642485
+闻弦歌 13.2075304714
+折上 11.8212361103
+茅塞顿开 11.0674643079
+郭永强 13.900677652
+鸣镝 12.2912397395
+折射计 13.2075304714
+大数 10.3453295905
+洛宁用 12.8020653633
+收割机 10.2897597393
+黄芦叶 13.2075304714
+高家军 11.4157710022
+广船国际 11.2616203224
+丽润 13.2075304714
+个人爱好 11.8212361103
+撒手不干 13.2075304714
+救火队员 13.900677652
+缅北 11.2616203224
+王允常 13.900677652
+蛰伏 9.7898037878
+发射点 11.3357282945
+泽塔 12.8020653633
+联通 9.01787572939
+折中 10.1871055853
+进攻 6.11163725032
+披肩 10.1871055853
+收割期 12.8020653633
+军事实力 9.54396882529
+折为 11.0674643079
+一个九品 12.5143832909
+大故 12.2912397395
+多匹 13.2075304714
+奥加湖 12.8020653633
+百威 12.2912397395
+低常儿童 12.1089181827
+大敌 9.96885201925
+钮子 13.900677652
+蒜苗 11.0674643079
+蒜苔 11.8212361103
+子宫颈癌 11.3357282945
+灌溉面积 9.04086524761
+王贞治 12.8020653633
+宋钦宗 11.0103058941
+沥沥 11.3357282945
+闯将 10.7226238216
+欧几里得 9.27570483869
+漏洞百出 11.1280889297
+方脸 11.0674643079
+蛊毒 12.8020653633
+贺礼 10.9049453784
+特雷莎 12.8020653633
+手心儿 13.2075304714
+第十一回 11.8212361103
+材积 11.7034530746
+达波尔 13.900677652
+室里 10.0294766411
+粉底液 12.8020653633
+宗圣 12.8020653633
+镶黄旗 10.533381822
+三十步 11.7034530746
+十公斤 12.8020653633
+笙簧 11.7034530746
+激光器 9.4233408375
+奢侈浪费 12.5143832909
+酸甜苦辣 11.0103058941
+侃大山 12.2912397395
+雷明登 11.7034530746
+多峰 12.1089181827
+拖放 13.900677652
+座谈 9.93038573842
+服务 5.34215059707
+关铝 10.3171587135
+磁强计 11.598092559
+多岁 8.93783302172
+金鸡山 12.8020653633
+张白皙 13.2075304714
+五十步 11.7034530746
+那珠囊 13.2075304714
+关铎 13.2075304714
+多岛 12.2912397395
+周正 11.1280889297
+周武 11.5027823792
+凯桑 13.2075304714
+镇海寺 12.8020653633
+王陵寝 13.900677652
+审计报告 10.3171587135
+三十次 13.2075304714
+三十款 13.900677652
+卡捷琳娜 13.900677652
+康梁变 13.2075304714
+邵阳县 11.8212361103
+绿松石 10.604840786
+宋元算 13.900677652
+唐及唐 13.2075304714
+计算方法 8.9519177616
+落脚处 11.9547675029
+邋遢 10.533381822
+来得早 10.6818018271
+标准图 13.900677652
+多届 12.8020653633
+凯梅 13.2075304714
+大盈 11.9547675029
+两百卷 12.8020653633
+多层 8.87679713113
+删节版 13.900677652
+多属 8.57766767284
+户数 9.13850371718
+冰熊 12.8020653633
+沥水 12.2912397395
+宽高比 12.5143832909
+令人惊骇 13.2075304714
+玉米象 13.900677652
+人字架 13.900677652
+进入计算机 13.2075304714
+大樟 11.9547675029
+松辽平原 9.71102290995
+凸着 13.2075304714
+李修贤 11.9547675029
+炒冷饭 12.5143832909
+两数 13.900677652
+太华群 13.900677652
+精耕细作 10.0294766411
+卢生 12.2912397395
+东海广场 12.5143832909
+多山 9.16447920358
+马朱罗 13.900677652
+遒劲 10.0940151622
+蠢笨 11.8212361103
+董事会 6.70324229788
+多封 12.2912397395
+念道 8.78268383956
+焦利蒂 12.8020653633
+历年来 9.89334446674
+官兵一致 12.1089181827
+待定 10.4994802703
+户政 13.2075304714
+多少 5.27570686839
+撮盐入火 13.2075304714
+唐僧马 12.8020653633
+成绵绢 13.2075304714
+断句 11.1926274509
+穿著 12.1089181827
+粗蛮 13.900677652
+长乐路 13.2075304714
+最差 8.65365357982
+知书达理 11.4157710022
+待客 9.77354326693
+多尼 10.3453295905
+服刑 9.94943393339
+喀纳斯 11.1280889297
+生物质 11.598092559
+吊车 9.25628675283
+阴气沉沉 13.900677652
+计年 12.8020653633
+大段 10.9049453784
+冰瀑 12.2912397395
+特此通知 11.3357282945
+酣饮 11.7034530746
+大殿 8.15447446144
+品行不端 12.1089181827
+仙女座 10.765183436
+最小 7.1038539337
+领军人物 9.87532596124
+泰山北斗 12.8020653633
+最少 7.80710788193
+于殇子 13.2075304714
+大云山 12.5143832909
+李三景 13.900677652
+没生气 11.598092559
+教学计划 10.9562386728
+有百害而无一利 12.5143832909
+油料管理 13.2075304714
+阔气 10.9562386728
+萨马尔 12.8020653633
+晋挚虞 12.5143832909
+奥运村 11.9547675029
+沥涝 12.5143832909
+半生不熟 10.9562386728
+尉迟眺 13.2075304714
+高锰钢 12.1089181827
+多巴 11.7034530746
+总经销 11.5027823792
+叙述出来 13.900677652
+试验者 13.2075304714
+卧蚕眉 11.8212361103
+李岩之 13.900677652
+卢瓦 11.9547675029
+国新办 12.2912397395
+协调局 13.2075304714
+西欧联盟 11.1926274509
+宁夏 7.82303540863
+低等生物 11.5027823792
+大圣笑 11.7034530746
+三思而行 10.5684731418
+扫出来 13.900677652
+万州区 13.2075304714
+自主化 11.598092559
+民事责任 10.2630914922
+包天剑 8.71329184614
+好好儿 9.20932976975
+关闸 11.1926274509
+诸旗会 11.8212361103
+刘良佐 10.2630914922
+应权通变 13.900677652
+大毛 11.7034530746
+北婆罗 13.2075304714
+关门 8.40350942668
+毒囊 13.2075304714
+关闭 7.30080715276
+新一届 10.0720362555
+冰灯 12.8020653633
+脏脸 13.900677652
+大同路 11.3357282945
+北京市第一中级人民法院 11.1926274509
+大款 10.2897597393
+百味 10.8561552143
+待嫁 11.598092559
+糖浆剂 12.5143832909
+保育院 11.4157710022
+猜枚行令 12.5143832909
+一还一报 13.2075304714
+逗我 11.5027823792
+赫鲁宛 12.5143832909
+百员 12.8020653633
+解暑益 13.2075304714
+乐卫尉 13.2075304714
+邻二甲苯 12.5143832909
+效命 10.0940151622
+冰点 9.85762638414
+不正派 12.1089181827
+安塞县 12.8020653633
+推举 8.59240995457
+关键 6.12456217488
+进步 6.46053097131
+人欢马叫 11.8212361103
+祈年殿 11.9547675029
+精英奖 13.2075304714
+世界闻名 10.3453295905
+关锦 13.900677652
+冰炭 12.1089181827
+传播学 11.1926274509
+权诈 13.900677652
+明德慎 12.5143832909
+破袭战 11.5027823792
+权证 7.7083151625
+并行操作 12.8020653633
+卷丹 13.2075304714
+百吨 11.1280889297
+大武 11.0103058941
+大步 8.53938548627
+大正 11.9547675029
+巢元方 11.7034530746
+拒人于千 13.900677652
+南京晨报 13.900677652
+田制 10.4349417492
+关镇 11.598092559
+咂巴 12.5143832909
+保值储蓄 13.900677652
+关长 13.900677652
+进款 11.5027823792
+百合 9.04864738806
+标准型 10.1871055853
+糊里糊涂 9.63799777493
+百名 9.94943393339
+史蒂文 12.5143832909
+嗅神经 12.8020653633
+能举贤 12.8020653633
+不公平性 11.8212361103
+福寿之 13.2075304714
+中低级 13.2075304714
+武装冲突 9.72629038208
+硝酸甘油 10.8096351986
+关隘 9.29550746599
+三千万两 12.5143832909
+主神 10.2897597393
+黑褐色 9.34680076038
+独此一家 12.8020653633
+从茶庄 12.8020653633
+话虽如此 11.1926274509
+汇市 9.01032852375
+贺笺 12.8020653633
+修改权 13.2075304714
+干枣儿 13.2075304714
+感生电流 13.900677652
+学期开始 12.1089181827
+第一零八回 13.2075304714
+南北通衢 12.8020653633
+洋洋得意 10.8096351986
+灯灭了 11.9547675029
+报名条件 13.2075304714
+反得 12.1089181827
+哲学博士 11.598092559
+最弱 9.77354326693
+披起 12.8020653633
+胚根 11.598092559
+大梁 9.21854642485
+咱俩 8.37522471284
+多延 13.2075304714
+外廊 12.8020653633
+古遗音 13.900677652
+麦尔维尔 12.1089181827
+两用型 13.2075304714
+步兵师 9.06439574502
+于义 13.900677652
+国与国 10.2630914922
+导流 10.2897597393
+劳少得 13.900677652
+奥鲁官 13.900677652
+松阿察 11.598092559
+陈西滢 12.8020653633
+刑法学家 13.900677652
+草泽 12.1089181827
+王兼理 11.8212361103
+宁娜 13.900677652
+悲秋 12.5143832909
+败不馁 13.2075304714
+大棒 10.1164880181
+权衡 9.09665660724
+多座 8.60236028543
+大棚 10.0294766411
+外环 10.0940151622
+阅览室 10.7226238216
+外廓 12.1089181827
+握笔 12.2912397395
+鸿文 13.900677652
+噩耗传来 12.5143832909
+特首 12.1089181827
+绿盈盈 11.9547675029
+一笑一颦 13.2075304714
+栽下 10.765183436
+栽上 11.598092559
+大样 12.2912397395
+详述 10.3171587135
+达夫尼斯 13.2075304714
+卡鲁索 12.1089181827
+多幅 10.8096351986
+查继 11.0674643079
+一个十二岁 12.8020653633
+斯里兰卡卢比 13.900677652
+狂草 11.7034530746
+大根 12.8020653633
+农用车 11.9547675029
+拜拉姆 13.900677652
+应激状态 13.2075304714
+绳缆 13.2075304714
+最得 11.1280889297
+大校 9.5186510173
+越雷池 12.1089181827
+多幕 13.900677652
+妖术 10.0088573539
+布利达 13.900677652
+寻龙入 13.2075304714
+冰玲 13.2075304714
+梯也尔 11.0674643079
+上海市总工会 13.2075304714
+小姐姐 12.5143832909
+防护物 13.900677652
+大树 8.27305653829
+普林西比 12.5143832909
+关防 9.55687223012
+激溅 13.900677652
+卢眉 12.8020653633
+多幢 12.2912397395
+百块 13.2075304714
+能量消耗 10.8096351986
+交易师 13.900677652
+多年 5.58217933147
+结婚的人 12.8020653633
+由爱生 13.900677652
+查结 12.8020653633
+大桶 10.9562386728
+百场 11.8212361103
+冬虫夏草 10.2630914922
+异图 12.8020653633
+德莱塞 11.8212361103
+庄客见 12.5143832909
+水产丰富 10.8561552143
+镇痛 9.49395840471
+最忌 10.7226238216
+多布 12.1089181827
+大桥 7.97108850859
+上课时 11.1280889297
+拼到底 12.2912397395
+最忙 11.0674643079
+关陇 10.4994802703
+紧握拳头 11.8212361103
+大桩 12.5143832909
+宗嗣 12.8020653633
+最快 7.54456999128
+吊起 10.0940151622
+吊走 13.900677652
+关陵 10.765183436
+扯碎 11.1280889297
+进校 12.2912397395
+解放事业 10.9562386728
+通信工程 11.8212361103
+美国商业部 13.2075304714
+定谳 12.2912397395
+截开 12.5143832909
+大案 9.85762638414
+候车厅 12.5143832909
+琉璃塔 13.900677652
+燕慕容 11.5027823792
+坐上去 11.1926274509
+金兵南 11.598092559
+王家嫂子 13.2075304714
+云根朝 13.2075304714
+公共财政 9.94943393339
+五十根 13.2075304714
+多心 9.26594866375
+延庆县 11.5027823792
+苦口婆心 10.3743171274
+举国上下 11.2616203224
+东山县 11.5027823792
+脸皮薄 12.1089181827
+吹风机 11.598092559
+根基深厚 12.5143832909
+冰帽 12.2912397395
+按质论价 13.900677652
+福泉山 13.900677652
+不合规定 12.2912397395
+不清 8.26232298264
+百回 13.2075304714
+多快 11.3357282945
+伏念臣 12.5143832909
+过敏性 9.31571017331
+几辈子 11.0103058941
+马萨革 12.5143832909
+映雪 12.8020653633
+俘虏营 10.9049453784
+出国考察 10.9049453784
+吴率军 12.8020653633
+冰爪 13.900677652
+最常 10.2897597393
+咱们 5.38088783471
+乘鸾跨凤 13.900677652
+五百文 11.9547675029
+凯歌 9.49395840471
+蘑菇 8.47572763449
+萨瑟兰 12.1089181827
+八通关 12.5143832909
+城步 11.7034530746
+维和部队 11.5027823792
+不按君臣 13.900677652
+冰片 11.0103058941
+查缴 13.900677652
+雷鸣电闪 11.1926274509
+秋千架 11.3357282945
+胡先生 9.22784881751
+资质证书 12.5143832909
+五百斤 11.8212361103
+大雪纷飞 11.0103058941
+土崩鱼烂 13.900677652
+混杂起来 13.2075304714
+死灰槁木 13.900677652
+卢益 12.8020653633
+宗周 10.0088573539
+智能型 11.8212361103
+兵种部 13.2075304714
+岳石 12.8020653633
+专找 11.598092559
+知识讲座 13.900677652
+铸币厂 13.2075304714
+多德 10.765183436
+最广 8.05713323494
+采色 13.900677652
+洗出去 13.2075304714
+并肩而立 12.8020653633
+权要 13.2075304714
+盈科 10.5684731418
+正科级 13.900677652
+丝绵被 13.900677652
+伏在沙 13.900677652
+王焕武 13.2075304714
+渐变性 13.900677652
+松下电器 12.8020653633
+多当 13.900677652
+高甲戏 12.5143832909
+辛辛那提 11.1926274509
+多彩 10.8096351986
+凿枘 13.2075304714
+外物 10.533381822
+井中盟 12.8020653633
+请愿书 10.4994802703
+埃德尔曼 13.900677652
+四千八百名 13.900677652
+官衔 9.37888907493
+策划者 11.0103058941
+假使说 13.900677652
+三十棵 12.8020653633
+大椎 11.5027823792
+宁寺 11.1280889297
+小土豆 13.900677652
+酒窝儿 12.2912397395
+采访权 13.900677652
+宁宁 11.5027823792
+谷蠡王 12.8020653633
+宁宇 10.8096351986
+宁安 10.765183436
+大楼 8.10766404359
+多开 11.5027823792
+原生性 13.900677652
+秃尾 11.5027823792
+催化部位 13.900677652
+昆州 12.8020653633
+宁宗 11.2616203224
+权证和 12.8020653633
+宁官 11.8212361103
+仙女山 12.8020653633
+敲山震虎 11.1926274509
+索赔案 12.2912397395
+支队长 9.01032852375
+生广陵 13.2075304714
+蒲阿军 13.2075304714
+左袖 13.2075304714
+萨瓦河 11.4157710022
+篓子 10.1164880181
+多张 10.642581114
+陈宝国 11.598092559
+研究成果 8.19689517732
+拖曳 10.2371160058
+好色者 13.900677652
+生财之道 11.2616203224
+外父 13.900677652
+悲哀 8.44963919841
+庆元党禁 12.5143832909
+五百担 13.2075304714
+联机处理 12.8020653633
+百出 10.4349417492
+丽晶 13.900677652
+独具特色 9.75754292558
+钢轮 12.8020653633
+出人意外 10.2897597393
+钢轨 10.2371160058
+乳香 11.1926274509
+悬浮液 11.5027823792
+无悔无怨 13.900677652
+后人 7.20611559345
+氨基树脂 12.1089181827
+外痔 12.5143832909
+网队 11.1926274509
+最多 5.96009382487
+管窥 12.2912397395
+丽景 13.2075304714
+双泉 12.8020653633
+大溪 10.533381822
+争作 13.900677652
+慢待 12.2912397395
+抗静电 11.7034530746
+后事 9.20932976975
+最大 4.47684010574
+后于 9.22784881751
+大源 11.8212361103
+大溜 12.8020653633
+醋精 13.900677652
+慢得 11.1926274509
+发射筒 10.642581114
+南通 8.49350588052
+任你选 12.2912397395
+场面话 12.1089181827
+明使臣 13.2075304714
+多声 11.598092559
+宫神宫 13.2075304714
+出口成章 11.2616203224
+陈宝光 13.2075304714
+握紧 10.0940151622
+一五零 13.900677652
+后代 7.37711534583
+标准制 12.8020653633
+不拘小节 12.1089181827
+扣问 13.900677652
+后任 7.55504129115
+海军南海舰队 12.2912397395
+后仰 10.1630080337
+凸现 9.55687223012
+泥瓦 13.900677652
+后件 13.2075304714
+多玩 13.900677652
+饮水思源 13.2075304714
+宗卢 13.2075304714
+明重辑 13.2075304714
+一点一点 9.23723855786
+丽星 11.7034530746
+成胶状 13.900677652
+连上 11.1280889297
+作风正派 11.8212361103
+于延 12.2912397395
+臭皮囊 12.1089181827
+交易中心 9.62401153296
+泳衣 12.1089181827
+首下 13.900677652
+养路工 13.900677652
+最好 5.7794944099
+质素 11.2616203224
+顷刻之间 9.89334446674
+百兽 11.1280889297
+丁力士 13.2075304714
+阳明经 11.5027823792
+体育部 12.2912397395
+外界 6.90582766614
+百具 12.2912397395
+室长 12.5143832909
+后为 7.96843246453
+团体会员 11.598092559
+燃气轮机 9.6811699468
+应召来 13.2075304714
+大港 8.9102450652
+武定县 13.900677652
+阳明络 13.900677652
+方鸿渐 13.900677652
+抄下来 11.8212361103
+后上 11.9547675029
+后下 12.2912397395
+影山 12.5143832909
+朋友 5.84710848284
+银楼 13.2075304714
+漆匠 13.2075304714
+大清 7.77818484246
+百克 11.598092559
+财经大学 12.8020653633
+无虞 10.0294766411
+百元 8.78868986362
+滋补食品 12.8020653633
+大渊 13.2075304714
+后世 7.21232293803
+人剥削人 11.4157710022
+扔下来 11.3357282945
+树阴 10.5684731418
+俘敌 11.1280889297
+发射管 9.12155415886
+关道 12.5143832909
+大湾 11.0103058941
+谢婉莹 13.2075304714
+塔城地区 11.8212361103
+吉布提共和国 12.8020653633
+司马懿入 11.9547675029
+克雷夫 13.2075304714
+米勒特 13.2075304714
+泳装 11.4157710022
+外生 10.3453295905
+大湖 8.92394390956
+妖物 11.1926274509
+外甥 8.79473217808
+外用 9.10488710638
+引颈受戮 12.8020653633
+分生组织 10.0294766411
+魏攻秦 13.2075304714
+赤眼鳟 12.2912397395
+粗哑 12.2912397395
+辉煌灿烂 11.9547675029
+五百户 12.5143832909
+外电 9.77354326693
+嗜酒者 12.2912397395
+零星 8.28754954559
+进港 10.9049453784
+连串 10.8096351986
+泳裤 13.900677652
+天堂寨 11.9547675029
+周游 9.98865464655
+大澳 12.8020653633
+塞尔维亚民主党 13.2075304714
+通配符 11.4157710022
+第五队 12.8020653633
+多姆 11.7034530746
+第十二层 13.2075304714
+徐爵见 12.2912397395
+陕西籍 12.5143832909
+后侧 10.533381822
+冰球 11.1280889297
+充耳不闻 10.5684731418
+作小服低 13.900677652
+定位仪 11.9547675029
+跨越 7.93197009199
+来风 9.85762638414
+大道北 12.2912397395
+软骨 9.5186510173
+洪家拳 13.900677652
+姑娘 5.9544140084
+覃塘毛 12.8020653633
+张材 10.2371160058
+周仆亲 13.2075304714
+盖好 10.533381822
+麦卡蒂 13.900677652
+多姿 9.91169360541
+博浪沙 11.8212361103
+寒风料峭 13.2075304714
+从金华 12.5143832909
+课前 13.2075304714
+精力过剩 12.8020653633
+滑肉门 13.900677652
+中膂俞 13.900677652
+把揽 13.900677652
+数据检索 12.8020653633
+苗栗县 11.3357282945
+理论界 11.1280889297
+移动信息 13.900677652
+千金难买 11.8212361103
+实心体 13.2075304714
+凸状 13.2075304714
+利尿药 10.5684731418
+袁尽力 12.8020653633
+歧途 10.9562386728
+芒角 13.900677652
+北攻姑 12.8020653633
+戊烷 11.1926274509
+标准化 8.12923652885
+戊烯 11.9547675029
+姑婆 10.2371160058
+丽服 12.8020653633
+妮娜 13.2075304714
+小西行 12.2912397395
+制海权 10.3743171274
+吴耀宗 12.5143832909
+念错 12.8020653633
+翟义 11.9547675029
+压下去 10.4349417492
+后传 11.3357282945
+公务车 10.9562386728
+多奇 13.900677652
+尔多 12.8020653633
+木材加工业 11.5027823792
+无从查证 13.900677652
+防空演习 12.8020653633
+音像店 13.900677652
+大漠 9.44633035572
+多套 9.58318953844
+妖魅 12.8020653633
+宁州 11.1280889297
+第七十八条 13.900677652
+凸版 11.8212361103
+撒胡椒面 12.5143832909
+漆刷 13.2075304714
+侯成引 13.2075304714
+便于管理 11.7034530746
+擦起 12.5143832909
+梵蒂冈城 11.7034530746
+人力资源部 11.7034530746
+多好 9.20019728618
+后会 8.98069672615
+汝亦 11.9547675029
+宁巴 13.900677652
+中低端 10.1871055853
+粗莽 12.2912397395
+查科 11.2616203224
+第十七期 11.8212361103
+霍集占 12.5143832909
+第十七条 11.1280889297
+相敬之 12.5143832909
+刀子嘴 12.1089181827
+多处 7.93197009199
+戈湖 13.900677652
+反中子 13.900677652
+行色匆匆 11.5027823792
+投放量 9.74179456862
+多夜 13.900677652
+油光水滑 12.2912397395
+张本 12.2912397395
+多多 8.50705010562
+皮手套 11.2616203224
+大潮 9.36807815882
+含怨而死 13.900677652
+卢灿 13.2075304714
+周公之礼 13.2075304714
+补漏 12.8020653633
+多天 8.90346537821
+体相 12.5143832909
+多夫 10.0294766411
+扣得 11.1926274509
+多大 7.64109618791
+查禁 9.62401153296
+跨跨 13.900677652
+托斯克 13.2075304714
+姑嫂 10.3743171274
+后作 11.1926274509
+百倍 8.97342396682
+多头 7.22359419073
+上机操作 13.900677652
+权谋 10.5684731418
+不慌不乱 13.2075304714
+拖挂 12.2912397395
+大河 7.68207753228
+补注 10.9049453784
+赔本生意 12.8020653633
+百台 12.8020653633
+大沽 9.85762638414
+大治 11.598092559
+三亚市 10.2897597393
+百叶 11.8212361103
+百只 10.3453295905
+纪念卡 13.2075304714
+补泻 11.8212361103
+姑夫 10.1394775363
+百口 10.6818018271
+披襟 13.900677652
+百句 13.2075304714
+齐侯 12.8020653633
+蒜蓉 12.8020653633
+生物课 13.2075304714
+信息率 13.2075304714
+布尔干 13.900677652
+朋克 12.5143832909
+百发 13.2075304714
+零位 13.2075304714
+孟连傣族拉祜族佤族自治县 12.5143832909
+凿成 10.8096351986
+蒋州 13.900677652
+空气量 13.900677652
+宗儿 12.1089181827
+朋党 10.3171587135
+混出来 12.5143832909
+公益事业 9.82314020807
+俚歌 13.900677652
+慢工 13.900677652
+昼间 10.8561552143
+达纳 11.7034530746
+标准值 10.9562386728
+大泽 10.8561552143
+钢质 10.765183436
+缝起 13.2075304714
+训练局 12.8020653633
+新一季 13.900677652
+外来工 12.8020653633
+大波 11.8212361103
+宁帖 11.5027823792
+雷老爷 13.2075304714
+专干 10.642581114
+阔步 11.8212361103
+坚牢度 13.900677652
+大法 9.71102290995
+查税 12.8020653633
+非特异 12.5143832909
+立体画 11.0103058941
+十一号 12.8020653633
+老大自居 13.900677652
+周济 9.84023464143
+圆度仪 13.900677652
+稽考 11.3357282945
+大泉 10.8561552143
+各个系统 11.9547675029
+逮捕法办 12.1089181827
+大水 8.82550383674
+注册人数 13.900677652
+金翠莲 13.2075304714
+披览 11.9547675029
+百卷 12.1089181827
+诚心地 12.2912397395
+浅解 13.900677652
+二面 11.7034530746
+周润 13.2075304714
+心疑 10.4994802703
+具备 6.18110366272
+粗肥 13.2075304714
+瞠目结舌 9.75754292558
+琅勃拉邦 11.4157710022
+三百四百 13.2075304714
+剑诀 13.900677652
+联络员 10.2117981979
+鼻咽癌 10.9562386728
+苑文炳 12.8020653633
+斯塔诺 12.8020653633
+汊流 10.4666904475
+书画名家 13.2075304714
+巴埃斯 12.8020653633
+大氅 11.1926274509
+李如月 13.900677652
+进汤 13.900677652
+百十 9.75754292558
+百千 13.900677652
+麻点 11.8212361103
+生活资料 8.01735526349
+同步进行 10.8096351986
+外省 9.07236391467
+积劳成疾 11.1926274509
+披覆 12.5143832909
+进气 9.46986085313
+亚欧会议 12.1089181827
+多娇 11.9547675029
+最富 9.84023464143
+全线通车 10.8561552143
+举着 8.28754954559
+圣皮埃尔 11.3357282945
+激活 7.3741827924
+补水 10.2117981979
+东安门大街 12.8020653633
+认真贯彻 9.94943393339
+姑姑 7.20364340431
+姑姐 11.1926274509
+软饭 13.900677652
+指南车 10.9049453784
+进水 9.27570483869
+大江 8.66423568915
+测定法 10.9562386728
+大汛 11.7034530746
+判别分析 12.5143832909
+全部四个 13.900677652
+筒状花 13.900677652
+水涨船高 9.34680076038
+叶和芽 13.2075304714
+骨龄 12.2912397395
+东府里 10.9049453784
+补气 9.87532596124
+揪扯 11.4157710022
+两三条 12.1089181827
+斯之妻 13.900677652
+大汉 8.41173992582
+能写 13.2075304714
+周永 11.598092559
+诊察 11.0674643079
+摆起来 12.8020653633
+浑家 10.642581114
+拦阻 9.55687223012
+约翰逊 9.41204128224
+正经事儿 12.2912397395
+零乱 9.89334446674
+释出 10.533381822
+董鄂皇后 13.900677652
+邪道 12.8020653633
+真草隶篆 13.900677652
+既为 9.94943393339
+大涨 6.61791647237
+披衣 9.77354326693
+进深 10.3453295905
+彭湘湘 9.77354326693
+权责 10.642581114
+红岗区 13.2075304714
+少数乡 13.2075304714
+多寡 8.94485059437
+鱼肠剑 11.7034530746
+薛永宗 13.2075304714
+乌孙大 13.2075304714
+鼎力 11.0103058941
+进修学校 13.900677652
+周氏 11.1926274509
+外相 10.533381822
+蛟龙戏水 13.900677652
+大醇小疵 13.900677652
+权贵 8.74162235276
+效力 8.00352378434
+四出活动 13.900677652
+多守 12.8020653633
+补涨 8.34771806705
+王玄甫 13.900677652
+正当权益 10.9049453784
+零个 13.2075304714
+示威者 10.4349417492
+田义庄 11.0674643079
+船舶业 13.900677652
+血细胞 9.94943393339
+绝对阈限 12.8020653633
+劳资关系 11.3357282945
+许德拉 13.900677652
+吊装 10.5684731418
+多宗 11.8212361103
+演变史 12.1089181827
+补液 10.6818018271
+零一 12.5143832909
+零七 11.7034530746
+零三 10.4994802703
+零下 9.6811699468
+运兵车 12.1089181827
+外皮 10.2897597393
+蒜薹 12.8020653633
+暗骂 10.0720362555
+钡盐 12.1089181827
+亭子间 11.4157710022
+枇杷叶 12.2912397395
+一病不起 10.765183436
+熊文灿 9.6811699468
+诊室 11.3357282945
+多家 6.52416952565
+宁强 12.5143832909
+阿卜杜 11.1280889297
+肯下去 13.900677652
+宁心 12.5143832909
+大洲 9.40086798165
+打前站 11.9547675029
+北京军区空军 12.8020653633
+向父帅 12.8020653633
+拖把 11.8212361103
+杨建华 8.39941944143
+瓦杰拉 13.2075304714
+海特勒 11.9547675029
+丽日 11.7034530746
+低收入者 10.4349417492
+零件 8.3555002075
+陈子昂 10.8096351986
+多孔 9.29550746599
+难辞其咎 11.2616203224
+智能卡 10.9049453784
+多子 11.3357282945
+大洪 11.1926274509
+金鉴 13.900677652
+分区赛 13.900677652
+白龙驹 12.8020653633
+笙箫 11.1926274509
+终裁 11.3357282945
+帮扶 9.74179456862
+播发 11.1280889297
+大洞 9.20932976975
+图书馆员 12.1089181827
+马上观 13.2075304714
+泄洪洞 13.2075304714
+西吉斯 12.5143832909
+割晒机 12.8020653633
+砭石 13.2075304714
+巧取豪夺 10.3743171274
+天生一对 13.2075304714
+光彩耀眼 13.900677652
+光荣称号 11.8212361103
+大洋 7.88208443748
+龃龉不合 13.2075304714
+苑太监 13.900677652
+贤淑 10.8096351986
+大海 7.71241352889
+流行语 10.9049453784
+冰盖 9.56994431169
+拖拉 10.2630914922
+周泰 10.5684731418
+进洞 9.98865464655
+披袍 12.8020653633
+念青 9.94943393339
+户户 10.533381822
+百利 11.2616203224
+周文中 13.2075304714
+吴君如 12.2912397395
+拖拖 11.5027823792
+生异卉 13.2075304714
+周波 12.2912397395
+待岗 12.2912397395
+大浪 10.1164880181
+余万户 12.5143832909
+大坏蛋 12.8020653633
+修齐治平 12.8020653633
+从金军 12.5143832909
+智能化 8.86372504956
+闪闪发亮 10.2117981979
+各领风骚 12.8020653633
+鲁穆公 13.2075304714
+鲁贝尔 12.2912397395
+御宇 13.900677652
+宁德 11.4157710022
+艺术总监 11.7034530746
+百分 11.0674643079
+堪察加 11.2616203224
+李远 13.900677652
+王育民 11.3357282945
+传感器 8.46695564842
+书家 11.9547675029
+外交家 9.93038573842
+松塔 12.1089181827
+闪闪发光 9.12999302751
+大圣才 11.9547675029
+零六 11.1280889297
+烟色 11.9547675029
+迸出 10.3171587135
+书室 12.1089181827
+梁永大 13.2075304714
+折姜 13.2075304714
+后势 11.2616203224
+非人类 13.2075304714
+后劲 9.48183704418
+永康市 13.2075304714
+乌尔城 11.8212361103
+摆在首位 12.2912397395
+披靡 11.7034530746
+零元 13.2075304714
+私生女 11.9547675029
+宗伯 10.765183436
+外交官 9.63799777493
+王立志 12.8020653633
+查摆 13.2075304714
+拖累 7.41299363349
+漆侠 10.604840786
+潭水 10.4041700905
+从零开始 11.0103058941
+啮齿 10.4349417492
+凌虐 12.5143832909
+遂平 9.91169360541
+枕藉 12.8020653633
+新热带界 13.900677652
+凌虚 12.5143832909
+最新动向 11.7034530746
+全明星 12.1089181827
+大罗神仙 13.900677652
+第十七章 10.0088573539
+盛京时 11.8212361103
+六百五十七部 13.2075304714
+设计室 13.900677652
+冰楔 12.8020653633
+后勤 8.2985588311
+苗栗人 13.900677652
+柯尔贝尔 11.7034530746
+商茶行 13.2075304714
+托尔布 12.5143832909
+大圣战 12.1089181827
+发射机 9.89334446674
+追随者 9.15574552361
+服装行业 10.2897597393
+弗雷德 10.765183436
+高家村 13.2075304714
+文远忠义 13.900677652
+里希南 12.8020653633
+骀荡 13.900677652
+披露 5.91349290374
+斯地产 13.2075304714
+实业家 9.66657114738
+裁并 11.5027823792
+蝶岛 12.8020653633
+进犯 8.46695564842
+杨士奇 10.5684731418
+菠菜 9.15574552361
+左翼后旗 12.5143832909
+大爷 7.83689244329
+卢津 12.5143832909
+用户手册 13.2075304714
+守时 11.8212361103
+大爽 13.900677652
+标准件 11.598092559
+林虑山 13.2075304714
+这下子 10.1871055853
+百万雄师 11.4157710022
+逗笑 9.82314020807
+最后通谍 13.2075304714
+后到 8.73589167805
+零出 12.8020653633
+滑着 12.8020653633
+补牌 13.900677652
+震泽镇 12.5143832909
+裁度 12.1089181827
+座钟 11.7034530746
+兴会淋漓 13.900677652
+狂饮 11.598092559
+日本籍 13.900677652
+天晓得 10.8096351986
+过期杂志 13.900677652
+成也萧何 11.5027823792
+周王 8.77077893705
+补牙 11.7034530746
+贾母房 10.8096351986
+慕利延 12.1089181827
+白波帅 13.2075304714
+卢洞 12.8020653633
+外楼 12.2912397395
+啥子 9.6811699468
+金国汗 13.900677652
+小狮 13.900677652
+闯劲儿 13.900677652
+通天河 10.1164880181
+朋侪 13.900677652
+漆作 13.900677652
+无足轻重 9.71102290995
+发射架 9.14708746087
+乌龟王八 11.8212361103
+混响器 13.2075304714
+大牢 9.29550746599
+书学 12.1089181827
+外交学 13.2075304714
+中国空军 10.6818018271
+桓銮庠 13.2075304714
+进爵 10.7226238216
+发射极 12.1089181827
+端木 11.1280889297
+大牛 11.1926274509
+克里斯特尔 12.1089181827
+大牙 9.62401153296
+大片 7.11509000697
+魏襄王 11.4157710022
+以进为退 12.2912397395
+非正统 13.2075304714
+雁荡山 10.3743171274
+守恒性 13.2075304714
+大牌 10.2630914922
+包二奶 12.5143832909
+折头 13.900677652
+伏在石 12.8020653633
+妻女 9.6811699468
+裁开 13.2075304714
+银盘 10.2630914922
+票款 11.8212361103
+狂风 8.57280148319
+卸载 11.0103058941
+艾谢特 13.2075304714
+后去 12.8020653633
+正面战场 10.1630080337
+抛头露面 10.4666904475
+不容乐观 8.85082164473
+剧烈运动 10.1630080337
+滕戡 12.8020653633
+狂飙 9.08039608637
+狂飚 13.2075304714
+生物链 12.8020653633
+瘫痪 8.5488195185
+大率 13.2075304714
+效果图 11.0103058941
+颜晟子 13.2075304714
+抓上来 13.900677652
+款式 8.9519177616
+华中师大 13.900677652
+卢沟 12.8020653633
+大王 7.47905538417
+寒松 12.5143832909
+漆亮 12.5143832909
+朔风怒号 13.900677652
+电信服务 11.3357282945
+李德水 13.900677652
+软蛋 11.3357282945
+披阅 11.7034530746
+赵邦之 13.2075304714
+故今 12.1089181827
+承乾门 11.598092559
+环流器 12.1089181827
+外凸 12.8020653633
+连任 8.6803218269
+孙威王 12.5143832909
+大珠 12.5143832909
+后台 8.53003962385
+大班 11.1280889297
+中尉军官 13.2075304714
+杖藜 13.2075304714
+后叶 11.5027823792
+嫡派 11.5027823792
+规划司 11.5027823792
+奶头 10.4994802703
+民主派 9.75754292558
+臂腕 13.2075304714
+胡闹 8.98069672615
+整型外科 13.900677652
+王入朝 12.8020653633
+解暑清 13.900677652
+汉唐两代 13.900677652
+传动系统 10.5684731418
+十分明确 10.3171587135
+后发 10.3453295905
+谢杭生 13.2075304714
+崇尚自我 13.900677652
+遂心 10.9049453784
+韩世同 12.5143832909
+小马拉 13.900677652
+书面声明 12.8020653633
+焦作市 10.0505300503
+查无 13.900677652
+悲戚 10.2371160058
+等奖品 13.900677652
+王彦 11.1926274509
+后区 12.2912397395
+政治协商会议 9.37888907493
+慕师师 13.2075304714
+宗云 13.2075304714
+第九十八回 12.2912397395
+五灵脂 11.9547675029
+畏罪潜逃 12.5143832909
+聚集一堂 12.8020653633
+规划区 12.8020653633
+迭次 12.5143832909
+圈圈点点 13.900677652
+急慌慌 11.9547675029
+彩色玻璃 11.5027823792
+三四百块 13.900677652
+户籍 7.95003509939
+卢氏 9.75754292558
+武汉队 13.900677652
+遂昌 12.5143832909
+西北民族学院 13.900677652
+宗亲 9.91169360541
+水磨粉 13.900677652
+师徒俩 11.8212361103
+当前情况 11.1926274509
+马加尔 13.2075304714
+款待 8.91707103027
+张林 13.2075304714
+查斯 13.2075304714
+后卫 10.1394775363
+线粉 13.900677652
+施莱辛 12.8020653633
+伦汇宗 13.2075304714
+王彤 13.2075304714
+妻妾 9.54396882529
+卢汶 13.2075304714
+满街跑 11.9547675029
+布素鲁 12.5143832909
+金属工艺 12.8020653633
+武工队 11.9547675029
+网络设备 11.8212361103
+查新 13.900677652
+冰棍 11.2616203224
+托尔德 12.5143832909
+外校 13.2075304714
+后半 11.1280889297
+工人员 13.900677652
+贤王 10.4666904475
+石油工业 9.21854642485
+查文 12.8020653633
+米格 8.85725253506
+关起 11.3357282945
+卢汉 11.7034530746
+北空 13.2075304714
+杨若薇 12.5143832909
+宗仰 12.8020653633
+摆架子 11.8212361103
+从技术上 8.81927328699
+八国联军 9.04864738806
+尉迟氏 12.5143832909
+八字眉 12.5143832909
+票根 13.900677652
+私生子 9.29550746599
+请回去 11.8212361103
+轻巧型 13.900677652
+票样 11.3357282945
+大点 10.4666904475
+豹头环眼 12.2912397395
+大炮 7.89186446653
+金丹奉 13.2075304714
+百四十六 12.8020653633
+院庆 13.900677652
+呼兰 11.4157710022
+栲栳 11.8212361103
+密执安 13.2075304714
+主义者 8.91707103027
+多糖类 11.7034530746
+退过来 13.900677652
+折寿 12.2912397395
+零卖 13.900677652
+迸发 9.91169360541
+扁豆花 13.2075304714
+大松林 12.8020653633
+饿死事小 13.2075304714
+居下风 12.5143832909
+巨人症 12.5143832909
+倾耳 13.900677652
+一百零七卷 12.8020653633
+瘦点 12.8020653633
+探矿权 11.1280889297
+高校学生 12.1089181827
+磁控管 11.5027823792
+必需 7.50876053858
+拖网 11.0674643079
+灰砂砖 13.900677652
+折实 12.5143832909
+优哩婆湿 13.2075304714
+诺森伯兰 12.2912397395
+盈怀 13.900677652
+碧空如洗 13.900677652
+外因论 13.900677652
+镇海 9.4233408375
+革命烈火 13.900677652
+伯周奎 13.2075304714
+披锦 13.900677652
+专门店 13.900677652
+大烟 9.40086798165
+胡那帮 13.2075304714
+官迷 12.5143832909
+严阵连 12.5143832909
+外段 12.8020653633
+凯特 11.3357282945
+削肩 13.2075304714
+无可挽回 10.2630914922
+吊打 12.1089181827
+汝义 11.2616203224
+零口 13.2075304714
+渴望 7.7083151625
+粗鲁 9.33632946051
+仅次于 7.0883325578
+进退失据 11.2616203224
+百佳 11.3357282945
+一塌糊涂 9.71102290995
+新创建 11.1280889297
+罗素图 12.8020653633
+悲愁 11.2616203224
+红富士 12.8020653633
+零号 12.8020653633
+拐肘 12.5143832909
+折子 7.78699547214
+吊销 10.5684731418
+收养法 13.2075304714
+铝酸盐 12.5143832909
+函数 7.08394177138
+促进法 10.8561552143
+百余 9.16447920358
+虚晃一枪 11.8212361103
+古历 12.8020653633
+斯库达 13.900677652
+解放路 11.1926274509
+做鬼脸 12.2912397395
+悲愤 8.89673134603
+创元科技 10.9049453784
+百位 11.2616203224
+五百米 13.2075304714
+表面色 13.2075304714
+金融债券 10.9562386728
+好汉不吃眼前亏 11.7034530746
+阎罗王 11.8212361103
+冰毒 13.900677652
+大灶 10.7226238216
+友谊商店 12.2912397395
+大灾 10.4994802703
+程途 11.1280889297
+阿尔米达 12.2912397395
+挣来 10.8561552143
+保育费 13.900677652
+舞蹈团 11.3357282945
+大灯 9.40086798165
+错误认识 11.598092559
+普鲁特 13.2075304714
+大火 8.39128931535
+别构酶 13.900677652
+厚墩墩 12.5143832909
+外欠 11.7034530746
+进退维艰 13.900677652
+百会 13.2075304714
+贪生畏死 12.2912397395
+犯罪感 12.5143832909
+拜金主义 11.8212361103
+猴年 13.2075304714
+气候系统 11.8212361103
+三四百名 12.2912397395
+国民教育 10.533381822
+海洋卫星 11.9547675029
+壶中日月 13.2075304714
+滇西北 10.533381822
+陆生动物 11.598092559
+宗赵恒 13.900677652
+指数函数 11.8212361103
+吊钟 12.8020653633
+镇民 12.5143832909
+后冠 13.2075304714
+齐文宣帝 11.3357282945
+人才学 12.1089181827
+百件 11.598092559
+草圣 12.8020653633
+吊针 11.8212361103
+岳灵 13.900677652
+妻孥 12.1089181827
+百代 10.9049453784
+洋务运动 9.7898037878
+好评率 13.900677652
+顾不了 10.2897597393
+产品链 11.5027823792
+妻子 6.15870975216
+效仿 9.14708746087
+悲悼 11.8212361103
+热轧板 10.9562386728
+握手 8.40761620864
+查杀 13.900677652
+请愿团 12.1089181827
+后写 11.1926274509
+后军 9.72629038208
+美加地区 13.900677652
+吊钩 11.9547675029
+张晖 11.598092559
+悲悯 11.3357282945
+大熊 10.765183436
+关进 9.59661255877
+百人 9.82314020807
+关连 11.1280889297
+百亿 8.45394028031
+镇江 8.18036587537
+夕阳余晖 13.2075304714
+美国纽约 9.36807815882
+颜晟天 13.2075304714
+少数分 13.2075304714
+凭照 12.8020653633
+戴本孝 12.8020653633
+悲情 11.0103058941
+黑幢幢 12.8020653633
+中统钞 11.8212361103
+真家伙 12.1089181827
+氤氲 10.2371160058
+栽在 10.642581114
+舰种 11.1280889297
+后凉 10.765183436
+吊链 13.900677652
+水火之中 11.8212361103
+零分 10.8096351986
+精卫填海 13.900677652
+念诵 10.0720362555
+难分伯仲 12.8020653633
+百五 12.8020653633
+因病未来 13.900677652
+充实感 12.8020653633
+救苦救难 10.765183436
+百事 9.93038573842
+百二 12.2912397395
+转游 10.8561552143
+双重标准 11.598092559
+两撇 11.1280889297
+云中郡 11.5027823792
+同色系 13.900677652
+几杯酒 9.87532596124
+畅想 11.1926274509
+麻剌为 13.2075304714
+蝶形 11.0674643079
+穿鼻 11.1280889297
+鼎中 11.4157710022
+杨国栋 13.2075304714
+查查 9.82314020807
+耆那教 10.4349417492
+栽培 7.30353195009
+马鲁丁 11.8212361103
+第六十五章 13.2075304714
+受罪 9.10488710638
+洒热血 11.4157710022
+悲怀 12.8020653633
+体育迷 13.900677652
+后儿 11.4157710022
+遂川 11.0674643079
+达维尔 13.2075304714
+喜剧片 10.4994802703
+共和派 10.3453295905
+幽雅 9.96885201925
+防锈剂 12.5143832909
+百乐 13.2075304714
+未便 10.6818018271
+白如银 12.2912397395
+顾不上 8.13548654919
+顶下来 13.900677652
+浙东运河 11.5027823792
+佛朗哥 10.3743171274
+书堆 12.1089181827
+融资额 8.68574189437
+悲怨 12.5143832909
+毫微米 13.900677652
+门苔纲 13.2075304714
+朝日新闻社 12.8020653633
+梅蒂卡尔 13.900677652
+半乳聚糖 13.2075304714
+权重 7.39638947844
+书塾 13.900677652
+吉辰 12.5143832909
+百个 9.5186510173
+悬浮物 11.5027823792
+癞痢 13.900677652
+妻室 10.0720362555
+卢湾 13.900677652
+联营 10.3171587135
+百两 11.2616203224
+至圣至明 12.8020653633
+宁远城 11.0674643079
+百业 11.598092559
+潞西 11.8212361103
+燕世子 13.2075304714
+握把 10.6818018271
+悲恸 10.604840786
+杨国桢 12.2912397395
+蝶式 13.900677652
+百丈 10.1871055853
+百三 12.8020653633
+百下 13.900677652
+艾姆赫斯 13.900677652
+百一 13.2075304714
+马萨达 12.5143832909
+一千三百 11.8212361103
+里克河 12.5143832909
+梵蒂冈教廷 13.900677652
+百万 7.78258045393
+陆均松 11.5027823792
+让玩家 13.900677652
+萨克塞 13.900677652
+操作系统 9.26594866375
+王役 13.2075304714
+来自 5.52274652789
+外公 9.46986085313
+贝子府 13.2075304714
+连住 12.2912397395
+冰洞 10.9049453784
+贝子庙 12.2912397395
+生物量 10.9562386728
+银核 12.1089181827
+蒜黄 12.8020653633
+博列洛 13.2075304714
+黎曼 9.91169360541
+重耳 11.598092559
+奥义书 11.1280889297
+国民学校 12.2912397395
+藁城县 13.2075304714
+斧凿痕迹 13.900677652
+杰斯纳河 13.900677652
+争名夺利 12.8020653633
+重者 9.01032852375
+吴晓灵 9.53122979951
+补益 9.5186510173
+玉臂匠 11.9547675029
+红豆杉 9.71102290995
+服从 7.6701962044
+毫不服输 13.900677652
+暴发型 12.8020653633
+蔓草 12.2912397395
+外关 12.8020653633
+麦特 13.900677652
+罗朗 12.2912397395
+陈叔通 11.8212361103
+医学期刊 12.5143832909
+外涂 12.5143832909
+非银行 10.2117981979
+后园 10.2897597393
+具体性 11.3357282945
+泳道 12.8020653633
+零售 6.93276845017
+院士 7.24781462262
+凯瑟 12.1089181827
+凯瑞 13.900677652
+向文帝 13.900677652
+救济灾民 13.900677652
+奥蒙德 12.8020653633
+树身 9.94943393339
+权限 8.67493097826
+百分之九点 13.2075304714
+那献王 11.3357282945
+服人 11.5027823792
+大盗 10.604840786
+大盖 12.8020653633
+魔兽争霸 12.8020653633
+服了 10.4349417492
+冰海 11.5027823792
+各项措施 10.604840786
+规划图 11.7034530746
+不一会 9.85762638414
+大盘 5.25685180963
+章明基 13.2075304714
+殷切期望 12.1089181827
+汪光焘 13.2075304714
+归有光 11.7034530746
+妻小 10.7226238216
+志留纪 10.1871055853
+扫乾净 13.900677652
+重聚 11.3357282945
+约束条件 10.4666904475
+外流 8.74738605748
+倚门卖笑 13.2075304714
+农村调查 13.2075304714
+教学特点 13.2075304714
+如弟 13.900677652
+调味汁 12.8020653633
+补白 13.900677652
+子午线 10.0088573539
+贤相 11.8212361103
+发育畸形 11.9547675029
+绝对化 10.9049453784
+氏族 7.8161782389
+张易 13.2075304714
+卢植 11.2616203224
+晌午 8.80081122415
+天字号 12.1089181827
+歧视 8.30596627237
+歪理 11.598092559
+歧见 12.8020653633
+外海 9.63799777493
+变魔术 11.9547675029
+蔓菁 11.7034530746
+普顿郡 12.2912397395
+书影 8.4801426527
+服丧 11.5027823792
+日夜操劳 12.1089181827
+钢鞭 10.7226238216
+大白 9.94943393339
+外洋 10.765183436
+净含量 13.2075304714
+桑养蚕 11.5027823792
+瘦瘠 12.5143832909
+潮差 10.0505300503
+胚盘 11.9547675029
+刑徒免 13.2075304714
+瘦瘦 12.1089181827
+宗赵构 12.8020653633
+十堰市 11.5027823792
+吉木乃 12.8020653633
+周知 10.9049453784
+沙巴州 13.2075304714
+李佩甫 12.8020653633
+二甲双胍 13.2075304714
+书录 11.5027823792
+工人党 9.33632946051
+服下 10.5684731418
+贾太君 13.2075304714
+白岩山 11.7034530746
+二页 13.2075304714
+十几本 13.900677652
+浴具 13.900677652
+五权宪法 10.604840786
+上海市 6.71680693691
+位非 12.8020653633
+外派 11.598092559
+共赴 11.598092559
+补短 12.8020653633
+外泄 10.2897597393
+约己爱民 13.900677652
+卢梭 9.48183704418
+历史唯物主义 9.44633035572
+自惊自怪 12.8020653633
+指南针 9.07236391467
+架构图 13.900677652
+李岩刚 12.5143832909
+联苯 11.0674643079
+三四百只 13.2075304714
+杨连弟 13.900677652
+金丝鸟 12.5143832909
+英汉双解 13.2075304714
+冰凉 8.62767809341
+瞒天大谎 13.900677652
+单位名称 12.5143832909
+冰水 9.43476953332
+书店 9.4233408375
+稻草堆 12.5143832909
+李二姐 13.900677652
+舰群 13.900677652
+红毛国 12.5143832909
+马鹰亦 13.2075304714
+博大精深 10.4994802703
+二项 12.2912397395
+愁雾 12.8020653633
+陈姑娘 13.2075304714
+亲水性 11.7034530746
+东六宫 12.1089181827
+大石 9.17328983326
+驴唇马嘴 13.900677652
+穆藕初 12.5143832909
+云中雕 9.87532596124
+闻武王 12.8020653633
+滑膛枪 11.0103058941
+查爱珍 13.2075304714
+齐永明 11.5027823792
+旭川 12.8020653633
+少走弯路 11.7034530746
+高低压 12.2912397395
+空调车 12.8020653633
+斗眼 11.3357282945
+直播间 10.8561552143
+想象表象 13.2075304714
+马驹桥 13.2075304714
+款子 10.2897597393
+总编 10.642581114
+戴法兴 12.5143832909
+渴想 12.8020653633
+戴宗先 11.7034530746
+终觉 12.1089181827
+关迎敌 12.8020653633
+利害关系 9.31571017331
+外沿 12.2912397395
+手中有权 13.900677652
+烟草 7.69611988941
+外汇 7.04211261718
+分局长 13.900677652
+大眼 9.36807815882
+林清源 13.900677652
+祖皇帝 12.1089181827
+救下去 13.900677652
+后场 10.6818018271
+位阶 12.8020653633
+小火锅 13.900677652
+陈善 13.2075304714
+合江省 12.1089181827
+卢格 11.5027823792
+攀高枝儿 13.2075304714
+款客 13.900677652
+裁定 8.29120585679
+线切割 13.900677652
+喹啉 10.6818018271
+冰河 11.5027823792
+算进去 12.1089181827
+沙巴岛 13.900677652
+和奇珍 12.1089181827
+直升机 7.30763311783
+表露无遗 11.8212361103
+猴头 9.54396882529
+地底下 10.1871055853
+贪腐 11.1280889297
+叶甲属 13.2075304714
+冰沼 11.5027823792
+韩玉建 13.2075304714
+寻龙之 12.8020653633
+黾勉 12.8020653633
+院外 10.0088573539
+专座 13.2075304714
+后土 11.1280889297
+加拉加斯 11.0674643079
+愈来愈 8.10766404359
+其本质 10.3453295905
+撩乱 11.5027823792
+遂宁 11.598092559
+重臣 8.88339781516
+正当程序 13.2075304714
+折射 8.73589167805
+止息 11.0103058941
+中国妇女报 13.900677652
+月台票 13.900677652
+联航 13.2075304714
+和俊文 12.2912397395
+马斯登 13.2075304714
+可供使用 13.2075304714
+让步 8.46695564842
+于武帝 12.5143832909
+遂定 12.8020653633
+格外开恩 12.2912397395
+屈死之 13.900677652
+盐河 10.642581114
+亚德 12.2912397395
+关西 10.0088573539
+马黎诺 12.1089181827
+来者 9.44633035572
+念起 10.6818018271
+血压低 13.900677652
+王徐达 12.5143832909
+外水 12.8020653633
+黎朝 11.4157710022
+整件事 13.2075304714
+后坐 9.85762638414
+两机 13.900677652
+左宝贵 12.5143832909
+金点胡 11.8212361103
+苍生何 13.2075304714
+软膏 10.8561552143
+文镜秘 13.2075304714
+肃南裕固族自治县 12.2912397395
+南方局 10.7226238216
+爱是个 12.8020653633
+主枢纽 12.2912397395
+大豆制品 12.1089181827
+赵绪成 13.900677652
+查扣 11.0103058941
+上气不接下气 9.96885201925
+宋江传 13.2075304714
+数百公斤 13.900677652
+查找 9.43476953332
+阿珍 13.900677652
+人亡物在 13.2075304714
+公共事务 10.2117981979
+罗特芬 13.2075304714
+归根结柢 12.2912397395
+往前方 12.8020653633
+岸上 8.02014466558
+维系人心 12.8020653633
+你老 8.66956903512
+五华山 11.8212361103
+萤光 11.5027823792
+阻抗匹配 12.5143832909
+候车亭 12.2912397395
+陶乐县 13.2075304714
+面如土色 9.80633308975
+志留系 11.0103058941
+真宗 10.4994802703
+佩银字 13.2075304714
+愁闷 10.0088573539
+贺朔 12.2912397395
+民主测评 13.2075304714
+王家沙 13.2075304714
+新型产业 11.1280889297
+绥靖主义 12.2912397395
+凿穿 12.8020653633
+大瓶 12.2912397395
+栽到 10.765183436
+倡廉 13.900677652
+钢锭 11.8212361103
+钢锯 13.2075304714
+十里洋场 12.8020653633
+专政机关 12.1089181827
+冲劲儿 13.900677652
+以质取胜 13.900677652
+查房 11.9547675029
+双清 12.5143832909
+中年夫妇 10.7226238216
+拦车 11.4157710022
+从青楼 12.8020653633
+伦理学史 13.2075304714
+红纱 11.2616203224
+折得 12.5143832909
+扛出去 12.8020653633
+防锈油 12.8020653633
+项发明 13.2075304714
+灵谷洞 11.8212361103
+韩伯龙 13.2075304714
+握有 9.01787572939
+卢母 10.5684731418
+魏长生 11.9547675029
+立体派 13.2075304714
+贺权 12.8020653633
+卢比 10.2630914922
+蛾子 10.642581114
+钱弘佐 12.8020653633
+畅旺 11.598092559
+林潇湘 12.8020653633
+草房子 13.2075304714
+票汇 12.5143832909
+放焰口 11.9547675029
+魏忠贤 9.40086798165
+投宿在 13.900677652
+后殿 10.0088573539
+钢门 13.900677652
+感应同步器 13.2075304714
+贪色 10.8561552143
+宝钢集团 10.2117981979
+嗲声嗲气 11.5027823792
+二十余样 13.900677652
+随时欢迎 13.900677652
+软脚 12.8020653633
+垫个 13.900677652
+堪萨斯州 11.3357282945
+身怀绝技 11.3357282945
+查拉 11.7034530746
+餐饮部 13.2075304714
+通报制度 11.598092559
+折彦 11.4157710022
+院方 9.93038573842
+虎口拔牙 11.9547675029
+大理 8.37522471284
+大球 12.2912397395
+电子仪器 10.4041700905
+山祖冷 12.8020653633
+各有利弊 11.2616203224
+两栖登陆 10.9049453784
+海军军官 11.3357282945
+后周 9.12999302751
+物价飞涨 11.2616203224
+陶盆 12.8020653633
+查报 12.8020653633
+财用 10.8096351986
+进球 10.0294766411
+伤亡率 12.1089181827
+王李泰 13.900677652
+稽颡 13.900677652
+白秉德 11.7034530746
+遣唐使 11.1280889297
+过甚其词 13.900677652
+顾清山 12.8020653633
+福寿全 13.900677652
+扶墙摸壁 13.900677652
+韬晦之计 13.2075304714
+软腭 11.5027823792
+青灰色 10.2371160058
+陇川县 13.900677652
+折弯 13.900677652
+第七十四回 12.2912397395
+徐永久 13.2075304714
+查抄 10.0294766411
+斯滕堡 12.8020653633
+词汇量 12.1089181827
+木札勒 12.8020653633
+若干具 11.5027823792
+担负起来 12.5143832909
+周至柔 12.2912397395
+心理疾病 12.8020653633
+人才库 13.900677652
+一线品牌 11.1280889297
+人吃人 11.7034530746
+勃兰登堡 10.604840786
+迩来 12.8020653633
+海洋工程 9.94943393339
+稳步迈进 11.5027823792
+软肋 10.0505300503
+裁处 10.8096351986
+生化汤 12.8020653633
+递归语言 13.900677652
+衣奴 13.2075304714
+贺春 13.2075304714
+德相生 13.2075304714
+托皮卡 13.2075304714
+甲申年 11.5027823792
+张本直 11.5027823792
+开屏 12.2912397395
+白俄罗斯共和国 13.2075304714
+早年间 9.82314020807
+附着龈 13.900677652
+周琦 13.900677652
+宁完我 11.7034530746
+温度控制 11.0103058941
+放言高论 12.5143832909
+艰难度日 12.2912397395
+黎族 10.0720362555
+管理制度 8.55834340001
+萧先生 10.4349417492
+大连港 10.5684731418
+钢精锅 12.2912397395
+黄风怪 12.1089181827
+赤眼蜂 11.7034530746
+总务主任 12.8020653633
+产品部 11.7034530746
+裁夺 11.1926274509
+院定 13.900677652
+基层建设 13.2075304714
+有闲 11.598092559
+大痴 13.2075304714
+冰湖 12.2912397395
+在朝党 13.2075304714
+专门家 12.8020653633
+太始 12.5143832909
+重庆市政府 11.2616203224
+贾吉尔 12.2912397395
+王录 10.9562386728
+外源 11.3357282945
+科连特斯 13.2075304714
+重荷 12.1089181827
+二十八万户 13.2075304714
+零嘴 12.8020653633
+十一下 13.2075304714
+李岩停 13.2075304714
+张骞所 12.8020653633
+念过 10.4666904475
+师张真人 13.900677652
+呼朋引类 13.900677652
+非死即伤 12.2912397395
+外溢 10.642581114
+不劳而获 11.0103058941
+周瑞 9.58318953844
+重排本 13.900677652
+周瑜 8.63798746307
+保国会 11.598092559
+二千尺 13.900677652
+妻弟 10.4666904475
+黎文 11.598092559
+大病 8.86372504956
+小护士 10.3453295905
+一览无余 10.4994802703
+速递网 13.900677652
+大连湾 10.5684731418
+边缘系统 11.7034530746
+逍遥 9.46986085313
+小房间 9.96885201925
+八面玲珑 11.7034530746
+大甲 11.598092559
+树起 9.85762638414
+大田 10.4041700905
+讲道理 10.604840786
+谣传 9.69598503258
+养鱼池 12.8020653633
+重获 10.0505300503
+易感性 11.4157710022
+家电业 11.4157710022
+大用 10.1394775363
+里克森 12.5143832909
+汤明奇 12.8020653633
+钢铁 6.21451534848
+大生 10.1164880181
+燃油费 11.4157710022
+嫡母 11.7034530746
+女配角 12.8020653633
+假痴假呆 13.2075304714
+风格特征 11.2616203224
+绝对值 9.72629038208
+半自动 9.63799777493
+后唐 8.75901409547
+铺天盖地 9.09665660724
+光蕊 11.1926274509
+菠萝 8.81308131674
+书山 12.8020653633
+老本行 11.1280889297
+柴进笑 12.2912397395
+道不同不相为谋 12.2912397395
+查控 13.900677652
+输送带 11.5027823792
+猴子 8.22050504296
+查探 11.9547675029
+折帛 11.598092559
+大略 9.87532596124
+郭盛 9.72629038208
+大圣斗 12.5143832909
+外渗 11.7034530746
+凯比尔 12.2912397395
+竞业禁止 12.8020653633
+拍下来 11.1926274509
+稽首 10.4994802703
+挣扎 6.80230201338
+广济渠 12.5143832909
+钢钎 11.598092559
+钢针 10.6818018271
+钢钉 12.2912397395
+外港 10.0505300503
+书局 9.48183704418
+子伯服 12.5143832909
+院子 6.57684708577
+史黄立 13.2075304714
+数值数据 13.2075304714
+速调管 12.2912397395
+古寺 10.1164880181
+书屋 10.6818018271
+忧劳成疾 13.900677652
+联考 13.2075304714
+恕我直言 11.8212361103
+息差 8.21031819765
+镜外 13.900677652
+来路 9.46986085313
+四百六十七种 13.2075304714
+齐叫化 13.900677652
+票房 8.98069672615
+贝丹意 12.8020653633
+重谢 10.9562386728
+狂野 11.4157710022
+卢斯 9.87532596124
+镇服 12.8020653633
+窦美仪 9.11318590919
+上海虹桥机场 12.8020653633
+卢文 10.6818018271
+能减 13.900677652
+树苗 10.2630914922
+卢斌 12.8020653633
+阳虚阴 11.8212361103
+释二教 13.2075304714
+联运 9.93038573842
+折出 12.8020653633
+宝文堂 12.5143832909
+工商分局 11.3357282945
+票戏 13.900677652
+有限元法 10.9049453784
+排挤掉 11.0103058941
+山难 13.2075304714
+服从分配 13.900677652
+拦腰 9.5186510173
+外交史 11.5027823792
+效果律 13.900677652
+植物药 11.8212361103
+大良镇 12.8020653633
+山诸泉 13.2075304714
+大竹 10.7226238216
+张八岭 12.8020653633
+保护模式 13.2075304714
+岩手县 12.8020653633
+零头 10.4666904475
+德莱木 13.2075304714
+大端 12.5143832909
+林怀民 13.2075304714
+驱蚊器 13.900677652
+查氏 11.7034530746
+信诚 9.36807815882
+社会各界 8.58255765813
+大站 11.1280889297
+数端 13.2075304714
+胡元谋 11.8212361103
+树节 13.900677652
+充电站 10.642581114
+折冲 10.8561552143
+共同努力 8.74738605748
+嘈杂声 11.1280889297
+会计科目 12.5143832909
+页面 9.75754292558
+淫妇 9.30555780184
+折光 11.1926274509
+弥漫型 12.5143832909
+奇形异状 12.8020653633
+攘臂 12.2912397395
+三四百年 11.9547675029
+迭戈 13.2075304714
+杨义贞 13.2075304714
+扬威耀武 12.5143832909
+贝子分 12.8020653633
+白袜子 11.9547675029
+泥潦 13.2075304714
+外展神经 13.900677652
+够吃 11.4157710022
+总揽全局 13.2075304714
+跨地区 9.82314020807
+聪明睿智 12.5143832909
+许朝阳 13.900677652
+大暴雨 10.9049453784
+滑水板 12.2912397395
+发横财 11.598092559
+鞭毛藻 13.2075304714
+泗州戏 12.8020653633
+后娘 11.5027823792
+次声武器 11.9547675029
+汲长之 13.2075304714
+毫不放松 11.5027823792
+书包 9.35738286971
+悲欢 11.1926274509
+多极化 11.0674643079
+太妈 11.3357282945
+大程 13.900677652
+折兵 10.8096351986
+数百平方米 13.2075304714
+课员 13.900677652
+够呛 10.642581114
+水土不服 10.4666904475
+永巷 11.7034530746
+书卷 11.0674643079
+来货 13.900677652
+镜头 8.60737282725
+一箩 11.9547675029
+户田 12.1089181827
+进程 6.52542187397
+蠕虫形 12.5143832909
+伊势湾 13.2075304714
+外感 9.27570483869
+软软 9.53122979951
+辣椒红 13.2075304714
+补税 12.5143832909
+书单 13.2075304714
+修园子 10.3743171274
+柯家坪 11.7034530746
+日耳曼 8.86372504956
+够味 11.4157710022
+铁山区 13.2075304714
+五十篇 12.5143832909
+具体 5.50587810877
+交互型业务 13.900677652
+大甲溪 10.765183436
+熊熊大火 11.4157710022
+书协 11.3357282945
+王立国 13.2075304714
+后宫 8.87023973058
+大箱 11.5027823792
+马德望 12.1089181827
+行政效率 10.1394775363
+托斯卡 11.1280889297
+矗立 9.08039608637
+二十余架 13.2075304714
+两架 9.20019728618
+物离乡贵 13.900677652
+鱼装 13.2075304714
+大管 11.3357282945
+萦绕在 10.9562386728
+勾御前 13.2075304714
+躬逢 11.9547675029
+越快越好 9.7898037878
+狂轰滥炸 10.9049453784
+中海油 8.97342396682
+郭允能 13.2075304714
+赏封 11.8212361103
+利川市 12.8020653633
+信访 9.48183704418
+还珠格格 12.5143832909
+重负 11.1280889297
+金融学 9.98865464655
+玉马 13.900677652
+百无一用 11.8212361103
+花障 12.5143832909
+沙姆斯 13.2075304714
+田桂花 12.5143832909
+打饥荒 12.5143832909
+仙女们 12.1089181827
+克卢埃 12.8020653633
+妻儿 9.69598503258
+立体战 12.5143832909
+木卡姆 11.4157710022
+蔡太师 10.0940151622
+西黄寺 12.1089181827
+票据 7.41299363349
+重走 11.8212361103
+胡焕庸 13.2075304714
+活疫苗 11.0674643079
+几半 13.2075304714
+南郡枝 13.2075304714
+重资 12.5143832909
+树莓 12.2912397395
+外患 10.2897597393
+栖霞山 11.4157710022
+弹射器 11.5027823792
+好认 13.2075304714
+历尽艰辛 11.1926274509
+重赏 8.92394390956
+认负 13.900677652
+重赋 11.9547675029
+五华区 11.8212361103
+武库司 12.8020653633
+大篆 11.2616203224
+热喀斯特 12.8020653633
+乌启罗 10.533381822
+广源土 13.2075304714
+温家宝 7.77818484246
+长沙市人 13.2075304714
+代之以 9.56994431169
+安莎社 12.5143832909
+子午环 12.8020653633
+云南省德宏傣族景颇族自治州 11.8212361103
+权利能力 11.1280889297
+过剩人口 9.98865464655
+姚仁隽 13.2075304714
+丽珠 11.0674643079
+蝶啶 12.1089181827
+树荫 11.0674643079
+憋住气 12.8020653633
+卢携 12.8020653633
+吉温 11.8212361103
+大笔 8.82550383674
+罗塞塔 11.4157710022
+大笑 7.37711534583
+陈二湖 9.41204128224
+举止不凡 13.900677652
+三十章 13.2075304714
+梳妆台 10.3171587135
+款型 13.2075304714
+一所所 13.900677652
+丽珍 11.7034530746
+凌迟 9.41204128224
+书刊 9.49395840471
+贪赃 10.6818018271
+变凉 11.4157710022
+贪贿 10.9562386728
+连指 12.8020653633
+抢劫杀人 11.9547675029
+旭光 10.4994802703
+后学 10.1871055853
+扈成那 13.2075304714
+羊痫风 13.900677652
+凸显 7.99804431857
+凌辱 9.65218240993
+折倒 13.2075304714
+粘着剂 13.900677652
+周章 12.2912397395
+渴求 9.82314020807
+老怪 9.96885201925
+贪财 10.3171587135
+维护型 13.900677652
+书剑 13.2075304714
+两家子 12.8020653633
+甘如养 12.5143832909
+地质矿产 11.4157710022
+重跌 11.1926274509
+萨瓦纳 12.2912397395
+维管束 10.1394775363
+周立 11.1926274509
+邱小乙 12.2912397395
+天堂伞 13.900677652
+汉举叔 12.2912397395
+补笔 13.900677652
+屠潭州 13.2075304714
+传出神经 11.1926274509
+耐酸性 12.5143832909
+趣怪 13.900677652
+李劫夫 13.2075304714
+沙巴区 12.8020653633
+闯上 11.5027823792
+郑海泉 13.900677652
+树胶 10.3743171274
+抿嘴笑 11.1926274509
+悲剧重演 11.9547675029
+浑人 12.2912397395
+重踩 13.2075304714
+汇业 11.7034530746
+那唐僧 10.4349417492
+冰挂 13.2075304714
+宜加崇 13.2075304714
+尤尔特 12.8020653633
+协调会 11.1926274509
+受制于 8.45825994145
+梨园春 11.2616203224
+最会 10.3743171274
+夫妻间 10.4666904475
+最优 8.43261751084
+伤自尊 13.2075304714
+大钉 12.5143832909
+大碗 8.77077893705
+压榨机 12.5143832909
+面容清癯 13.900677652
+汇丰 8.01179969364
+大碟 13.900677652
+多以 8.18364995057
+来过 8.70772080109
+读一读 10.9562386728
+贝若特 12.5143832909
+汇为 11.1280889297
+老玉米 12.5143832909
+多代 11.8212361103
+零子 13.900677652
+多份 10.1164880181
+来迟 10.0505300503
+外援 9.09665660724
+武英殿 8.44535653662
+合作医疗 10.8096351986
+多任 11.9547675029
+大碍 9.56994431169
+仰八叉 12.2912397395
+舰炮 9.19114745066
+毛里塔尼亚 9.82314020807
+多于 8.05423887692
+多亏 8.71329184614
+连根拔起 11.5027823792
+肉火烧 13.900677652
+咱得 10.604840786
+多事 9.43476953332
+立体感 9.93038573842
+最低 6.23962126961
+书函 10.642581114
+红渠生 13.2075304714
+守林 11.8212361103
+外排 11.3357282945
+多些 9.6811699468
+英国航空公司 11.9547675029
+裁员 9.09665660724
+慎防 11.2616203224
+浑仪 10.533381822
+多云 9.72629038208
+假意 9.58318953844
+透漏出 12.8020653633
+立载漪 13.2075304714
+三峡水利枢纽工程 11.9547675029
+多亩 10.0940151622
+香院 10.9562386728
+查清 9.07236391467
+后壁 10.765183436
+拉姆塔 11.8212361103
+多产 10.2897597393
+重蹈 9.40086798165
+最佳 6.75785025081
+多亿 9.59661255877
+卢某 10.9049453784
+多人 7.34816976494
+既存 12.5143832909
+同安区 13.900677652
+折半 13.900677652
+索罗金 11.598092559
+大破 8.91707103027
+多么 6.36165059615
+多义 12.2912397395
+慈宁花园 11.8212361103
+化学交联 12.8020653633
+多久 7.45495783259
+来车 11.2616203224
+王部堂 12.8020653633
+和尚头 13.2075304714
+鲁仲连 12.1089181827
+折博 12.8020653633
+西军正 13.2075304714
+穹窿 10.0088573539
+夏侯威 12.2912397395
+多乐 12.1089181827
+困心衡虑 12.5143832909
+重庆市政协 13.900677652
+感情脆弱 12.8020653633
+八万里 13.2075304714
+萨克图 11.0674643079
+联赛 9.11318590919
+软质 10.765183436
+后堂 9.18217878068
+沛县 10.0294766411
+于心何 13.900677652
+隐瞒事实 13.900677652
+张荫恒 13.900677652
+截住 8.61747392324
+赏得 12.8020653633
+黎桓 12.2912397395
+既定 8.62767809341
+二三两 12.1089181827
+外挂 9.74179456862
+草垫子 13.900677652
+多丈 13.2075304714
+对簿公堂 11.1280889297
+多上 12.2912397395
+多下 12.8020653633
+麻线 11.598092559
+多万 7.83922073305
+汇付 12.2912397395
+食指大动 12.2912397395
+多丝 11.8212361103
+鸡犬升天 11.2616203224
+双层经营 12.1089181827
+百余米 10.8096351986
+粗铜 11.9547675029
+周秦 10.5684731418
+多丑 13.900677652
+读取数据 12.8020653633
+汇价 8.9519177616
+咽气 10.0940151622
+三岁时 12.1089181827
+多个 6.05174392561
+支柱产业 9.02548032877
+中提 13.900677652
+葛雷岛 13.2075304714
+矢量 9.17328983326
+赏心 10.7226238216
+三等舱 13.900677652
+阿拉斯河 12.8020653633
+镇日 12.2912397395
+第五遍 13.2075304714
+多为 6.66218081108
+五十种 12.8020653633
+同安县 10.9049453784
+末世论 12.5143832909
+铵态氮肥 13.900677652
+多串 12.8020653633
+大得多 8.46695564842
+汇众 13.900677652
+心外膜 13.900677652
+鲁冰花 13.900677652
+个别辅导 13.2075304714
+夏侯惠 12.2912397395
+最上 10.7226238216
+最下 11.0674643079
+兰光科技 11.8212361103
+人民保险 10.9562386728
+大禹 8.51160592216
+香源堂 13.900677652
+揉合 11.9547675029
+雷监国 11.9547675029
+张顾行 13.2075304714
+周砥 11.4157710022
+补种 10.0088573539
+徐水县 12.8020653633
+后妃 8.90346537821
+萨伏伊 12.2912397395
+一加仑 12.5143832909
+俸给 12.8020653633
+穿鞋 10.4349417492
+萨巴蒂埃 12.5143832909
+最为 6.03510589429
+遮眼睛 13.900677652
+外借 12.2912397395
+鞭毛虫 11.1926274509
+前程远大 12.1089181827
+逗点 13.900677652
+张希清 12.8020653633
+二十余日 11.7034530746
+本本主义 12.1089181827
+高凤阁 10.642581114
+最久 9.6811699468
+星星之火 11.1926274509
+规划委 13.900677652
+通北疆 12.1089181827
+田土 10.2117981979
+大秦 9.98865464655
+费尔马 11.2616203224
+秋天里 11.5027823792
+重载 10.4041700905
+策划部 11.8212361103
+再加之 10.765183436
+书僮 10.4041700905
+裴济 11.8212361103
+数二亿三千二百三十五万余两 13.2075304714
+裹尸 11.3357282945
+王强 10.8096351986
+百余位 12.2912397395
+长江后浪推前浪 12.5143832909
+屈子问 12.8020653633
+工程地质 10.8561552143
+大种 13.900677652
+摸起来 11.7034530746
+太厚道 12.1089181827
+后天 8.36728816325
+补票 11.1926274509
+行幸乐 13.2075304714
+大社 11.2616203224
+大礼 8.89673134603
+浑似 12.5143832909
+多吃含 11.598092559
+多作 9.75754292558
+石云星 12.5143832909
+外打 12.8020653633
+多余 7.76079309975
+多佛 11.3357282945
+将本求利 13.900677652
+李家山 12.2912397395
+后头 8.46259834305
+岳王全 13.2075304714
+卡加尔 13.2075304714
+腐败无能 12.1089181827
+交易会 9.72629038208
+横琴岛 11.7034530746
+卢昂 13.2075304714
+票友 11.1280889297
+和妹儿 13.2075304714
+最亮 9.72629038208
+高级法院 11.4157710022
+都还没 10.604840786
+比较语言学 10.9049453784
+递嬗 11.7034530746
+闻千树 13.2075304714
+萨伏依 11.8212361103
+齐默尔曼 12.5143832909
+上建桥 13.900677652
+黑边眼镜 12.1089181827
+招待所 8.45394028031
+叶和鞍 13.900677652
+新一任 12.5143832909
+书库 11.4157710022
+折刀 13.2075304714
+穿靴 11.7034530746
+急刹车 10.2371160058
+阔绰 9.91169360541
+大祸 8.88339781516
+新一代 7.58170953823
+大祥 13.900677652
+重述 11.1280889297
+多会 10.2371160058
+古字 11.2616203224
+居里夫人 11.1280889297
+逆水 12.2912397395
+外戚 8.85725253506
+输送到 9.84023464143
+藏头诗 13.2075304714
+浑体 13.900677652
+花荣寨 12.5143832909
+大小不等 9.31571017331
+最令 10.1630080337
+后奏 13.2075304714
+大神 9.41204128224
+多伦 10.8561552143
+重返 8.0484751722
+树脂 8.4801426527
+联谊 10.765183436
+八载 10.9562386728
+王爵授 13.2075304714
+院坝 12.5143832909
+联调 12.5143832909
+忧心如焚 10.642581114
+裁刀 13.900677652
+五百八十五 13.2075304714
+大纲 8.9519177616
+裁切 12.5143832909
+串烧 11.7034530746
+大线 12.2912397395
+进给 11.1280889297
+相差太大 11.9547675029
+查档 13.900677652
+后座 9.5186510173
+大约 5.90200629096
+多多马 12.2912397395
+大红 8.62767809341
+人造卫星 9.40086798165
+百匹 12.5143832909
+周缘 10.7226238216
+裴多菲 11.5027823792
+裁判 8.87679713113
+后序 10.9562386728
+树蛙 11.7034530746
+糊涂帐 12.2912397395
+来见 8.47572763449
+挂在口上 13.2075304714
+天下第一 9.46986085313
+林卫 11.9547675029
+碎碎的 12.5143832909
+补给 7.76079309975
+相差太多 12.5143832909
+裁制 11.2616203224
+氯化亚砜 12.5143832909
+山雀 11.3357282945
+乘飞机 10.5684731418
+惠斯勒 13.2075304714
+镇国寺 12.5143832909
+大维 10.642581114
+戏台子 10.8561552143
+外文 9.49395840471
+张鼐望 13.2075304714
+杨宣进 13.2075304714
+热哄哄 13.900677652
+鬼画符 11.9547675029
+软话 11.4157710022
+联训 12.8020653633
+查核 11.5027823792
+待会 10.7226238216
+受到牵连 11.0674643079
+发电量 8.62767809341
+后廷 12.5143832909
+赤霉菌 13.900677652
+慎选 12.2912397395
+软语 10.7226238216
+复习班 12.8020653633
+绘声绘影 12.5143832909
+商城县 11.2616203224
+重行 11.0103058941
+裁剪 10.3453295905
+谢谢你们 10.8096351986
+待传 13.900677652
+沐川 12.8020653633
+卡鲁比 13.900677652
+钢鼓 12.5143832909
+大经 11.8212361103
+外方 9.35738286971
+威斯康星大学 10.642581114
+民主性 11.9547675029
+杨国柱 11.4157710022
+书城 11.3357282945
+太嫩 11.8212361103
+千八百九十九万余两 13.2075304714
+纳甲法 13.2075304714
+水保 12.8020653633
+查森 13.900677652
+冰斗 9.94943393339
+实体墙 13.900677652
+书场 10.4349417492
+外敌 10.2371160058
+堪萨斯城 11.8212361103
+做零工 12.5143832909
+火炬手 13.2075304714
+规划师 11.0674643079
+书圣 12.8020653633
+黄巾力士 12.5143832909
+费口舌 11.7034530746
+外教 11.7034530746
+怎是 13.2075304714
+扁平化 11.1926274509
+福蒂斯 13.900677652
+无事不登三宝殿 11.2616203224
+穿通 11.9547675029
+新闻公报 11.9547675029
+闲得无聊 11.5027823792
+后市 6.08991953545
+尽人事听 12.8020653633
+查检 12.1089181827
+麻絮 13.900677652
+穿透 8.89673134603
+行宽简 12.8020653633
+山雄 13.900677652
+黎湛 11.7034530746
+外敷 10.4349417492
+李林甫 10.1394775363
+外界压力 12.5143832909
+巴伯 13.2075304714
+好几十里 12.5143832909
+赐姓 9.61021821083
+邮币 12.8020653633
+伊兹密尔 10.4994802703
+形意拳 11.4157710022
+关联 7.31037660378
+万回 13.900677652
+喀斯特化 11.8212361103
+后年 10.0505300503
+鸣金 10.4994802703
+你中有我 11.8212361103
+重装 10.0294766411
+郝摇旗 8.21709788464
+楼子 12.8020653633
+书坛 12.5143832909
+从树林 11.5027823792
+心诚则灵 12.8020653633
+颖花 12.8020653633
+特约医院 13.900677652
+杨永泰 13.2075304714
+时再纳 13.2075304714
+托尔加 13.2075304714
+书坊 9.89334446674
+控计算机 13.900677652
+重裘 13.900677652
+外放 10.9049453784
+硬橡皮 13.900677652
+深圳市公安局 13.900677652
+降入 11.9547675029
+后微 13.2075304714
+延时器 13.900677652
+外来人 11.1280889297
+查楼 12.5143832909
+大群 9.10488710638
+团干部 11.9547675029
+镇戍 11.0674643079
+速记 11.1926274509
+小熊星座 13.900677652
+混响室 13.2075304714
+何长荣 12.8020653633
+举报电话 9.69598503258
+贺氏 11.598092559
+捡过 12.5143832909
+丁二醇 12.8020653633
+炬火 13.900677652
+烂摊子 10.533381822
+实心弹 13.2075304714
+忽忽悠悠 12.5143832909
+上同调 12.8020653633
+遂即 10.9049453784
+李岩派 13.2075304714
+楸子 13.2075304714
+慢些 11.1926274509
+来袭 9.48183704418
+捱打 13.2075304714
+翟璜 12.8020653633
+街头诗 12.5143832909
+三四百家 13.2075304714
+丹麦语 11.5027823792
+外号 9.06439574502
+相对值 12.5143832909
+温掌教 13.2075304714
+胡仔你 13.2075304714
+翠华山 12.5143832909
+难兄难弟 11.7034530746
+张仲景 10.1630080337
+言之凿凿 10.3171587135
+黎澍 12.2912397395
+楚玛尔 11.7034530746
+吕擎点 13.900677652
+后心 10.765183436
+中年妇女 9.85762638414
+史伍可 12.5143832909
+贺江 11.7034530746
+十一年 7.80710788193
+姚明年 13.900677652
+神师计 13.900677652
+亚美尼亚 9.29550746599
+海洋资源 9.91169360541
+人道精神 12.1089181827
+进网 12.2912397395
+生理反应 11.2616203224
+周线 8.97342396682
+布赫塔尔 13.2075304714
+零次 12.2912397395
+后张 12.2912397395
+公然反对 13.2075304714
+系鞋带 11.8212361103
+哈普斯 13.900677652
+大缸 10.3171587135
+蝶兰 13.900677652
+便民利民 12.2912397395
+融资难 9.26594866375
+范司令 13.2075304714
+雪峰山 10.2117981979
+暗哨 12.1089181827
+东方艺术 11.7034530746
+成绩单 9.45802639549
+贝雷帽 11.0674643079
+猴儿 9.58318953844
+亚美尼亚语 11.7034530746
+萌芽 8.1386262692
+重要 4.01296385356
+慎重 8.42421410004
+罗素姆 12.2912397395
+王训告 13.2075304714
+万港元 9.4233408375
+明心志 12.8020653633
+太湖流域 9.93038573842
+至尊版 13.2075304714
+一秉虔诚 13.900677652
+握法 12.8020653633
+畅游 10.8096351986
+权宜之计 10.2897597393
+根究 13.900677652
+肃杀之气 11.7034530746
+折合 8.20694551317
+金丝雀 12.2912397395
+全乌力 11.4157710022
+卢恩 12.8020653633
+维辛斯基 12.5143832909
+旁门外道 13.900677652
+周绮 13.900677652
+丁二酸 11.598092559
+补缺 9.98865464655
+斯豪森 12.8020653633
+补缴 10.9562386728
+大罪 9.87532596124
+华师一 13.2075304714
+大罗 11.8212361103
+重视 6.08627801817
+重见 10.8096351986
+几百封 13.2075304714
+大网 10.0088573539
+大罐 12.5143832909
+奴隶 7.102737239
+待产 11.4157710022
+善恶不分 13.900677652
+补缀 10.8561552143
+迸射 11.1926274509
+两百架 12.2912397395
+树蜂 11.9547675029
+拦蓄 10.6818018271
+吾兄 10.4666904475
+待人 9.54396882529
+语文系 11.4157710022
+指南鱼 12.5143832909
+补编 10.2371160058
+再混 13.2075304714
+云中鹤 12.8020653633
+军机大臣 9.24671730182
+盈江 11.5027823792
+接口技术 12.8020653633
+解事 12.8020653633
+朱震亨 12.1089181827
+戎马生涯 11.1926274509
+冰期 8.87023973058
+乌尔姆 13.2075304714
+连杆式 11.0103058941
+渔业部 13.2075304714
+冰月 10.3453295905
+盖起 10.0720362555
+萨拉乌 11.2616203224
+大粪 10.765183436
+输入阻抗 11.7034530746
+宁乡 10.533381822
+爱德蒙 13.2075304714
+大粒 11.8212361103
+裂解 9.75754292558
+补西墙 13.2075304714
+狂欢起来 13.900677652
+北方工业 10.6818018271
+从兴庆 13.2075304714
+来话 13.2075304714
+宇化 13.900677652
+民主运动 9.48183704418
+双节棍 13.900677652
+来试 12.2912397395
+揎拳掳袖 13.2075304714
+赤嵌楼 11.7034530746
+警备队 10.642581114
+越南战争 10.1164880181
+吟诗 9.5062284973
+周文德 13.2075304714
+各拉丹冬雪山 11.9547675029
+大系 10.9562386728
+宫征商 13.900677652
+萨拉丁 11.3357282945
+来访 8.52078029844
+巴门尼德 11.8212361103
+和梭伦 13.2075304714
+缩简 13.900677652
+后峰 13.900677652
+体节 9.80633308975
+宁丛 12.8020653633
+秋冬 9.11318590919
+宁东 11.9547675029
+来讲 7.36688881404
+古惑仔 12.2912397395
+衰变产物 11.9547675029
+尉迟恭 11.5027823792
+杜袭 12.5143832909
+戊基 13.2075304714
+王立军 11.7034530746
+咱家 8.74162235276
+拉雅山 13.900677652
+吟诵 9.91169360541
+侵权人 11.9547675029
+获鹿县 11.9547675029
+外架 13.900677652
+既当 11.8212361103
+玄兄 12.5143832909
+宁为 11.598092559
+密谋 8.81927328699
+手绣 12.5143832909
+渴念 11.1280889297
+设计阶段 10.8561552143
+休闲装 11.598092559
+蹲班 13.2075304714
+养鸡场 11.8212361103
+模拟训练 11.4157710022
+外村 10.4349417492
+主持正义 11.2616203224
+后尾 13.2075304714
+内官监 10.765183436
+否极泰来 10.6818018271
+古壁 11.4157710022
+家大业大 11.598092559
+树葬 12.2912397395
+马星野 12.8020653633
+两院制 10.8096351986
+疙瘩 8.29487558568
+脑海中 9.72629038208
+既往 10.1164880181
+外来 7.80710788193
+座骑 13.900677652
+咬起 12.8020653633
+合家欢乐 12.8020653633
+院刊 12.2912397395
+后尘 10.0720362555
+行劫 12.8020653633
+既得 10.4349417492
+马上飞 13.2075304714
+索罗门 13.900677652
+指令寄存器 13.2075304714
+身体疲劳 13.900677652
+查普曼 10.1164880181
+吴传玉 12.5143832909
+琐琐碎碎 12.2912397395
+骄恣 11.9547675029
+大米 8.2985588311
+亲母 12.2912397395
+万桶 9.05649056552
+外有 9.08039608637
+过敏症 12.1089181827
+大类 8.4284069783
+外服 12.2912397395
+冰柜 11.2616203224
+查帕 13.900677652
+双螺旋 10.9049453784
+手续 7.1877214513
+千百块 13.900677652
+规划局 10.642581114
+受记 12.8020653633
+自不量力 11.5027823792
+逗留 8.78268383956
+萨赫勒 12.1089181827
+体育节 11.9547675029
+夯土 9.55687223012
+冰柱 12.2912397395
+渴死 11.1280889297
+黎氏 12.8020653633
+院前 12.5143832909
+吃来吃去 12.8020653633
+气质高雅 13.900677652
+布尔人 10.3171587135
+跑堂儿 13.2075304714
+党和政府 9.62401153296
+关良 12.5143832909
+书商 11.2616203224
+叶杉 12.8020653633
+黎民 10.0505300503
+多纳 12.5143832909
+夜以继日 10.5684731418
+法明长老 12.5143832909
+千百倍 12.2912397395
+电信技术 12.8020653633
+红豆汤 12.5143832909
+司州领 13.2075304714
+汝言 11.9547675029
+张惠言 11.598092559
+折回 9.96885201925
+树藤 13.2075304714
+炯炯有神 10.2117981979
+向金国 13.900677652
+深蓝色 10.1164880181
+通话时间 12.5143832909
+粗鄙 10.6818018271
+卫朝廷 12.8020653633
+中国田径协会 13.2075304714
+桑赫斯 12.5143832909
+直罗镇 11.9547675029
+实物 7.29537973103
+白石桥 12.2912397395
+狂雨 13.900677652
+荆王 12.8020653633
+画供 13.2075304714
+蔓衍 13.900677652
+阶级友爱 13.2075304714
+中低档 10.765183436
+当头对面 13.900677652
+三十米 11.7034530746
+斯美塔纳 12.1089181827
+半真 13.2075304714
+解放者 10.9562386728
+成绩册 13.2075304714
+裴注 12.1089181827
+整体效益 12.8020653633
+够受 11.9547675029
+鼹鼠 11.1926274509
+票数 10.604840786
+六百万镑 12.5143832909
+虎踞龙盘 12.8020653633
+彭代雷 12.8020653633
+萨拉伊 12.1089181827
+监测网 12.5143832909
+树薯 13.2075304714
+后巷 11.9547675029
+脖子 6.84709192478
+敢上来 12.5143832909
+松心 12.2912397395
+地级市 8.83177344976
+封季历 12.8020653633
+百余种 9.89334446674
+燕征发 13.2075304714
+狐死首丘 13.2075304714
+实业银行 11.0103058941
+卢拉 11.3357282945
+大张旗鼓 9.84023464143
+泥垢 11.7034530746
+书品 11.7034530746
+耐火度 12.5143832909
+核工业 10.8096351986
+悲泣 11.1280889297
+歇马 10.642581114
+联袂 9.24671730182
+冰景 12.8020653633
+大义凛然 10.642581114
+若萍 10.4994802703
+石墨棒 13.900677652
+舞蹈家 10.1394775363
+外卖 12.1089181827
+和春义 10.6818018271
+玲珑剔透 10.4041700905
+库马 13.2075304714
+披风 9.75754292558
+合理布局 10.0720362555
+戊戌 11.3357282945
+温大雅 12.5143832909
+张怡 13.2075304714
+款冬 13.900677652
+大索 11.598092559
+捡起 8.96620371885
+书吧 13.2075304714
+何足为奇 11.598092559
+裁军 9.6811699468
+重设 11.1280889297
+神螺沟 11.3357282945
+院区 11.3357282945
+倍加 10.0505300503
+伍绍祖 13.900677652
+新几内亚 9.63799777493
+恙虫 12.1089181827
+梅西耶 12.5143832909
+冰暴 13.2075304714
+辛勤劳动 10.4666904475
+外景 10.3453295905
+户牖 12.8020653633
+裁决 8.59737274392
+天津市政 12.5143832909
+公主岭市 11.9547675029
+书名 9.26594866375
+书后 10.1630080337
+书吏 10.3743171274
+斯洛沃 13.2075304714
+趣旨 13.900677652
+妇科炎症 11.9547675029
+零度 11.2616203224
+粗野 10.0088573539
+粗重 9.72629038208
+走访调查 13.2075304714
+马瘦毛长 12.8020653633
+小词 11.3357282945
+裁减 9.24671730182
+重说 12.2912397395
+普吕克尔 13.2075304714
+南薰殿 12.5143832909
+忠于党 12.8020653633
+谁错 11.3357282945
+民族利益 10.5684731418
+镇惊 11.7034530746
+重读 11.5027823792
+外星 11.7034530746
+酒精喷灯 13.900677652
+麦王 12.8020653633
+独树一帜 9.31571017331
+专门化 10.0940151622
+百万雄兵 13.2075304714
+王子渊 13.2075304714
+经常化 11.8212361103
+磷霉素 13.900677652
+来言 12.2912397395
+宁侯 13.2075304714
+争霸战 12.8020653633
+重译 11.9547675029
+躲来躲去 12.8020653633
+阳经行 13.900677652
+小木凳 13.2075304714
+洛阳龙门石窟 12.1089181827
+外显 11.8212361103
+利亚族 13.900677652
+愈多 10.5684731418
+等深线 11.5027823792
+二十余名 11.9547675029
+该填 13.900677652
+脉冲数 12.8020653633
+门架 12.8020653633
+杂学旁收 13.900677652
+释迦方 13.2075304714
+确保 6.59481761929
+思想僵化 12.2912397395
+朝服 9.54396882529
+已成定局 9.13850371718
+闵采尔 11.9547675029
+品牌服装 10.4994802703
+私下交易 12.5143832909
+扛起 10.0505300503
+上官者亦 13.2075304714
+确信 8.55834340001
+输入国 11.5027823792
+竞买人 10.9562386728
+屋漏 11.7034530746
+王印川 12.8020653633
+排设 11.9547675029
+原地踏步 10.9049453784
+巾帼不让须眉 13.900677652
+门极 13.900677652
+愈大 9.71102290995
+淡然处之 11.7034530746
+上旋球 13.2075304714
+街心花园 11.4157710022
+五十匹 11.7034530746
+贞下起元 13.900677652
+计列 13.2075304714
+汗流满面 12.1089181827
+七拼八凑 13.900677652
+聚光镜 12.8020653633
+门柱 10.9562386728
+预料到 9.59661255877
+惊疑 8.89004235788
+卢科夫 11.5027823792
+杭爱山 10.6818018271
+阿克塞哈萨克族自治县 13.2075304714
+豪森 11.4157710022
+谋财害命 11.8212361103
+推使 13.900677652
+尔海盆 13.900677652
+乔松 11.0103058941
+小试 12.1089181827
+实用型 11.4157710022
+中流砥柱 9.93038573842
+真成了 10.4349417492
+释迦族 12.2912397395
+乌檀 12.8020653633
+走水 11.9547675029
+愈好 12.1089181827
+巡弋 12.2912397395
+伏惟 12.8020653633
+史称贞 13.900677652
+闵园 13.2075304714
+把式 12.1089181827
+白菜叶 13.2075304714
+方便快捷 10.7226238216
+反复证明 11.7034530746
+慰问品 11.598092559
+陈荒煤 12.5143832909
+揭发出 12.2912397395
+罗德里格斯 11.9547675029
+妓馆 11.8212361103
+门柄 12.8020653633
+门机 12.8020653633
+杞柳 12.2912397395
+宽解 11.1280889297
+走法 10.765183436
+泽思巴 12.2912397395
+仲颖 12.8020653633
+永春 11.0103058941
+钱德里卡 13.2075304714
+执勤 9.48183704418
+万根 11.3357282945
+住院费 11.8212361103
+里斯坦 11.5027823792
+洪泽湖 9.69598503258
+外包 9.15574552361
+期房 9.85762638414
+门望 11.3357282945
+永明 10.4666904475
+永昌 9.20932976975
+徐娘 12.1089181827
+般若经 10.7226238216
+徐威 12.1089181827
+梅江镇 12.5143832909
+向平儿 11.4157710022
+侯致仕 12.8020653633
+并非 6.16480733202
+王常月 13.2075304714
+黄忠大 13.900677652
+门板 8.99540287354
+简照南 13.2075304714
+下象棋 11.1280889297
+心旷神怡 10.5684731418
+锦心绣口 12.8020653633
+主焦煤 12.1089181827
+商办 10.1630080337
+上海海关 11.2616203224
+网络游戏 9.17328983326
+谬赞 13.2075304714
+拉利萨 13.900677652
+樟子松 10.6818018271
+三万九千 12.8020653633
+多道程序 12.1089181827
+戈洛夫 13.2075304714
+军事政变 9.74179456862
+乔贝 12.5143832909
+变形运动 11.8212361103
+十几倍 10.6818018271
+拐脖 12.8020653633
+洪泽渠 13.2075304714
+盐边县 13.2075304714
+康国大 13.2075304714
+商务 7.09606313191
+贺寿 11.3357282945
+感冒通 13.900677652
+锦江区 13.2075304714
+装修业 13.2075304714
+田园 8.58747167293
+席纹 12.5143832909
+财大 12.1089181827
+腾出 8.99540287354
+伯罗虎 12.8020653633
+徐家 10.6818018271
+训练队 12.5143832909
+汤斯 11.3357282945
+暂名 12.2912397395
+网上商城 11.598092559
+衣商 13.2075304714
+徐宣 13.2075304714
+触觉计 13.900677652
+令人烦恼 13.2075304714
+巡幸 10.9562386728
+味如鸡肋 13.900677652
+干部团 12.8020653633
+不懂事 9.4233408375
+海鸠 13.900677652
+公文旅行 13.900677652
+分红 7.05799436974
+不早了 9.62401153296
+集中型 12.2912397395
+粘弹性 10.533381822
+宫城南 12.8020653633
+第一段 10.4994802703
+该奖 12.2912397395
+东胡族 11.9547675029
+徐宏 13.900677652
+周元忠 12.1089181827
+留守 8.13548654919
+不良行为 11.2616203224
+朝晖 10.3743171274
+腾冲 9.93038573842
+殊路同归 13.900677652
+徐寿 11.5027823792
+暂告 10.533381822
+下田 10.642581114
+战斗条令 11.8212361103
+五七一 13.900677652
+朱仙镇 8.80081122415
+明季滇 13.2075304714
+仰冲 12.8020653633
+王贵戚 12.1089181827
+战术导弹 9.7898037878
+该处 9.56994431169
+留客 11.3357282945
+汉特克 13.2075304714
+肌力 11.2616203224
+九百等 12.8020653633
+反洗钱法 13.900677652
+省辖市 7.69814213479
+留宿 10.604840786
+博罗县 12.2912397395
+下生 11.2616203224
+秦惠王 11.4157710022
+下痢 11.9547675029
+劳有所得 11.7034530746
+确乎 11.1926274509
+安赫尔 11.2616203224
+勇气可嘉 12.5143832909
+褚墨伦 10.3171587135
+翘翘板 12.5143832909
+谭太尉 12.5143832909
+集中地 9.19114745066
+马努蒂 12.8020653633
+绕道而行 11.598092559
+留存 8.82550383674
+不合格品 12.8020653633
+敷到 12.8020653633
+期指 9.63799777493
+蹦蹦跳跳 11.2616203224
+仰光 9.84023464143
+赖朝 12.1089181827
+开展活动 10.9562386728
+商史 12.8020653633
+王国里 11.2616203224
+编辑整理 10.8096351986
+白兰地 10.9562386728
+商号 10.0294766411
+溃散 9.03314320152
+十几元 11.598092559
+丛林区 13.900677652
+于乾道 13.2075304714
+第一次 5.71004597107
+留学 7.53420720424
+陈平重 13.900677652
+第一款 9.41204128224
+迅疾 10.8096351986
+科隆 9.5186510173
+象牙 8.42003872863
+会计人员 12.5143832909
+布赵复 13.2075304714
+朝暮 10.9562386728
+竞买价 11.7034530746
+事权 10.1164880181
+钻进去 9.5186510173
+先秦散文 12.1089181827
+关节盘 13.2075304714
+改恶从善 11.9547675029
+铁和钢 12.5143832909
+中国少年先锋队 12.2912397395
+下疳 13.2075304714
+宫城县 12.8020653633
+坚持真理 11.4157710022
+政治协商 10.5684731418
+寓公 11.0674643079
+小童儿 12.2912397395
+著名画家 11.0674643079
+国际贸易 7.72273353793
+似有如无 13.900677652
+路追征 13.2075304714
+乳鸽 12.2912397395
+输入地 12.8020653633
+第一步 8.07763175649
+工商联 10.2630914922
+克拉克 9.77354326693
+万象新 13.900677652
+朝曦 13.900677652
+恭读 12.2912397395
+商厦 10.0505300503
+导体 8.99540287354
+惹草拈花 13.900677652
+减速器 10.4994802703
+号召书 12.8020653633
+求助于 9.80633308975
+硬撅撅 13.900677652
+边远地区 9.55687223012
+连接件 11.8212361103
+孙康映 13.900677652
+自扫门前 13.900677652
+牧之制 13.2075304714
+极限 7.89186446653
+倦勤 13.900677652
+门斯 12.8020653633
+绝缘纸 13.2075304714
+贡舶 12.5143832909
+贡船 12.1089181827
+郑易里 13.900677652
+两头 8.1386262692
+黄文弼 11.8212361103
+拱花 13.2075304714
+完善 5.95938208107
+真妙 12.5143832909
+汾阳县 11.7034530746
+朝政 7.65457088649
+履行合同 11.0103058941
+门斗 12.5143832909
+从宜城 12.2912397395
+老年痴呆 11.9547675029
+坎贝尔 11.0103058941
+修一修 12.8020653633
+农工部 12.8020653633
+改回来 13.2075304714
+监督程序 13.2075304714
+哈莱姆 12.5143832909
+乔迁 11.8212361103
+袁绍表 12.8020653633
+悦耳 9.46986085313
+张华便 13.2075304714
+读出来 11.7034530746
+臭气冲天 13.2075304714
+囊虫 11.9547675029
+检定所 11.8212361103
+科长 8.00352378434
+讲演录 11.5027823792
+过氧乙酸 11.598092559
+现场表演 11.8212361103
+第六十八回 12.2912397395
+预先录制 13.900677652
+韩熙载 11.0674643079
+右腿 9.55687223012
+慰问团 10.8561552143
+敷出 12.5143832909
+泱泱 11.8212361103
+罗汉豆 13.900677652
+共同富裕 10.4349417492
+曼飞龙 11.7034530746
+富顺县 13.2075304714
+千遍万遍 12.1089181827
+神射手 12.5143832909
+扑簌 12.8020653633
+十六次 12.5143832909
+陈市长 13.900677652
+汗孔 12.1089181827
+波尔卡 11.3357282945
+门旁 10.642581114
+戈罗夫 12.2912397395
+斗鸡走狗 12.1089181827
+暂定名 10.9562386728
+胸乡 13.900677652
+冬粉 12.5143832909
+朝文 13.2075304714
+扛过 11.9547675029
+下直 13.2075304714
+蜡油 12.2912397395
+青铜峡市 11.8212361103
+镇名 12.5143832909
+一氧化碳 9.05649056552
+秉公处理 13.2075304714
+湫隘 13.900677652
+未名社 13.2075304714
+晴雨计 13.900677652
+程先生 9.28555713513
+朝方 11.4157710022
+虚拟存储 12.2912397395
+篮球架 11.9547675029
+世俗社会 12.2912397395
+鹰巢 13.2075304714
+曼涅 13.2075304714
+第一根 11.598092559
+森林土壤 11.8212361103
+孝南区 11.598092559
+下盘 11.0674643079
+突破防线 13.900677652
+上臂骨 13.900677652
+岂因祸福避趋之 13.2075304714
+云长知 13.2075304714
+专题地图 11.1926274509
+曲终人散 11.5027823792
+具体内容 9.20932976975
+关节痛 10.8561552143
+顶体反应 13.900677652
+蜡泪 13.900677652
+鼓吹 8.41588071849
+守待 12.5143832909
+十块钱 10.1871055853
+黑汉 11.2616203224
+白木兰 12.8020653633
+王沪宁 12.8020653633
+拉丁语系 13.900677652
+关节病 11.4157710022
+何必如此 10.642581114
+聘金 12.5143832909
+公孙胜先生 11.8212361103
+第一桩 12.2912397395
+逆流 9.85762638414
+巴解组织执委会 13.2075304714
+十几分 13.900677652
+东庄 11.598092559
+朝日 10.2117981979
+秋兰 13.2075304714
+前磨牙 13.900677652
+联机服务 13.2075304714
+第一桶 13.900677652
+大染坊 13.900677652
+石友三 12.8020653633
+救命稻草 10.1871055853
+极难 10.1164880181
+十几只 10.533381822
+品茶 9.55687223012
+夏国钱 13.2075304714
+聘选 13.900677652
+农业发展银行 10.4349417492
+亲如一家 13.900677652
+刘仁静 12.2912397395
+调节税 12.1089181827
+日本鬼子 8.75318317516
+杆棒 11.1926274509
+该季 11.9547675029
+巡山 10.8096351986
+蓟城 11.0674643079
+实用品 12.8020653633
+贡茶 10.9562386728
+荷兰政府 11.4157710022
+昆明城 12.8020653633
+永新 10.642581114
+印历 12.2912397395
+十几号 13.900677652
+仡佬族 11.2616203224
+极面 12.8020653633
+怎说 10.9049453784
+反对 5.60438053933
+图案画 13.900677652
+赖斯 11.1280889297
+一元论 10.7226238216
+巡展 10.4041700905
+击爆 13.900677652
+声势显赫 13.900677652
+徐妈 11.0674643079
+事务司 12.8020653633
+不成问题 9.12999302751
+招信军 12.8020653633
+进退两难 9.84023464143
+蔡二相 13.2075304714
+捐躯 10.7226238216
+版权法 12.1089181827
+费达依 12.8020653633
+永无 10.0505300503
+收缘结果 13.900677652
+最需 13.900677652
+消声器 11.5027823792
+作者简介 12.1089181827
+走漏 10.4041700905
+详言之 12.8020653633
+任子 12.5143832909
+脉冲星 10.4666904475
+泛水 13.900677652
+公鹅 12.8020653633
+亚山 12.5143832909
+陷住 12.1089181827
+申论题 12.8020653633
+舌系带 13.900677652
+硫磺 9.19114745066
+凡事 8.39941944143
+文渠 11.9547675029
+遵义市 11.2616203224
+严厉查处 10.8561552143
+音乐风格 10.604840786
+首尾呼应 13.2075304714
+不中不西 11.9547675029
+马上传 13.900677652
+一笔抹煞 12.8020653633
+该寺 10.9562386728
+攻过去 13.900677652
+徐天 11.9547675029
+下矿 13.900677652
+亲如骨肉 13.900677652
+鲁银投资 11.1280889297
+靠上去 12.5143832909
+齿耙 11.9547675029
+收集者 12.5143832909
+任官 9.96885201925
+洪泽浦 12.8020653633
+连接体 13.2075304714
+京津唐 11.0674643079
+固位形 13.900677652
+留好 13.900677652
+仰卧 9.93038573842
+安全标志 12.5143832909
+一辈子架 12.8020653633
+任安 12.1089181827
+中小学 8.75901409547
+腾升 12.8020653633
+怪难吃 13.900677652
+须臾之间 11.5027823792
+语法分析 11.9547675029
+自费留学 12.2912397395
+张笺 13.2075304714
+条理性 13.2075304714
+普度众生 13.2075304714
+蜷缩 9.85762638414
+聚众滋事 12.5143832909
+琼剧 12.8020653633
+变化如神 13.2075304714
+集成化 10.9049453784
+时段 8.170577869
+留够 11.9547675029
+无语凝 12.8020653633
+明显增强 9.89334446674
+归罪于 10.9562386728
+于贞元 12.5143832909
+逆浪 13.900677652
+自古以来 8.51160592216
+令行 13.900677652
+宗祖乙 13.2075304714
+每时每刻 10.4041700905
+袁绍见 12.8020653633
+静电 9.02548032877
+万事达 13.900677652
+当家作主 10.9049453784
+余嘉锡 12.1089181827
+八十一个 13.2075304714
+富裕县 12.1089181827
+撒播机 13.2075304714
+死顽固 13.900677652
+元颢 13.900677652
+平安里 10.4349417492
+犹太民族 11.1280889297
+各不相谋 13.2075304714
+冯延巳 11.9547675029
+五千零四十八卷 12.5143832909
+埃森哲 13.900677652
+瞬态 11.3357282945
+苏步青 12.1089181827
+收下来 12.5143832909
+黑沟 13.2075304714
+完县 11.9547675029
+水流量 11.3357282945
+司马法 10.765183436
+阅览 10.8096351986
+徒刑 9.5186510173
+任尔 12.8020653633
+丹山 11.5027823792
+修改意见 11.0674643079
+该局 8.81927328699
+徐府 12.5143832909
+横加干涉 12.5143832909
+钱生亮 11.0103058941
+商器 12.5143832909
+过渡带 10.533381822
+缺编 12.8020653633
+曹大军 10.8561552143
+参观者 10.3743171274
+黜责 13.900677652
+国家开发行 12.5143832909
+反弹力 12.2912397395
+侦察地形 12.5143832909
+货币 5.31153596125
+栽培品种 10.9049453784
+暂免 10.0720362555
+奥利力 10.8561552143
+问清 10.2371160058
+黑沉 12.1089181827
+顾雍进 13.2075304714
+时水 12.5143832909
+陆龙卷 13.2075304714
+地堪院 12.8020653633
+以至于 8.0746775446
+二百零四万 13.2075304714
+各不相让 11.598092559
+极速 10.9562386728
+轰天雷 11.2616203224
+向宗敏 12.2912397395
+吹过来 11.1280889297
+走样 10.9562386728
+瞬息 11.0103058941
+蒙太奇 10.8096351986
+多群 13.2075304714
+玄关 12.1089181827
+阿卜德 12.1089181827
+二百零四个 12.5143832909
+杭得放 9.53122979951
+舞钢 11.1280889297
+任定边 12.8020653633
+福薄 12.1089181827
+徒劳 9.74179456862
+文化节 11.3357282945
+大庆石油管理局 12.1089181827
+徐常 13.900677652
+流口水 11.0103058941
+钓船 13.2075304714
+成本高 9.80633308975
+杜邦公司 11.9547675029
+布兰太尔 12.8020653633
+分解者 11.2616203224
+走棋 11.2616203224
+克卢日 11.9547675029
+机密性 12.1089181827
+建材价格 11.598092559
+计发 13.2075304714
+略低 9.87532596124
+恐后无凭 13.900677652
+豪气 10.3171587135
+菩提 9.18217878068
+站拢 13.900677652
+略作 9.75754292558
+商团 11.0103058941
+不列颠 8.75901409547
+徐帆 8.1641053545
+杨利普 9.46986085313
+宗宋派 13.900677652
+物理所 12.1089181827
+迁离 11.8212361103
+巨斧 13.900677652
+欢呼声 9.74179456862
+巡察 10.4349417492
+玉娇梨 13.2075304714
+祛暑 11.9547675029
+实用化 10.9562386728
+打猎技术 13.900677652
+真笨 12.1089181827
+寻到 9.05649056552
+响应分析 12.5143832909
+暂减 13.2075304714
+徐广 13.900677652
+陕南秦巴山区 12.2912397395
+包装工 13.2075304714
+完卵 11.2616203224
+马祖卡 11.7034530746
+数千千米 11.2616203224
+光身汉 12.8020653633
+赛典赤 11.4157710022
+惶惶不安 10.642581114
+走投没路 13.2075304714
+师真长老 13.2075304714
+受伤者 11.4157710022
+十几名 10.3743171274
+卫国公 13.2075304714
+受益者 9.08039608637
+孙儒败 13.2075304714
+保用 11.0103058941
+纵帆船 12.2912397395
+导电体 12.1089181827
+愈差 12.8020653633
+该岛 9.31571017331
+舟车 10.8096351986
+迁移 7.81390292506
+折抵 11.4157710022
+故书 11.9547675029
+司马氏 10.1394775363
+贼窝 12.1089181827
+燕南园 13.900677652
+审理案件 10.7226238216
+赖掉 12.1089181827
+留心 8.29487558568
+金击子 11.8212361103
+淡泊明志 13.900677652
+冬笋 11.3357282945
+金川镇 12.8020653633
+一个半月 10.1164880181
+交通阻塞 11.7034530746
+愈小 10.9049453784
+商均 11.8212361103
+阔人 13.2075304714
+远程目标 13.900677652
+暂借 11.9547675029
+其管辖 11.1926274509
+暂候 13.2075304714
+油价 6.92526372452
+正确轨道 13.2075304714
+锻炼者 13.2075304714
+徐徐 8.90346537821
+黑沙 12.8020653633
+眉目传情 11.598092559
+蝇头小利 11.598092559
+异域 10.3453295905
+五十二篇 13.2075304714
+松自思 12.8020653633
+击球 9.98865464655
+赢定了 13.900677652
+那汉笑 13.2075304714
+纸片儿 12.8020653633
+极酷 13.2075304714
+乔装 11.2616203224
+留念 10.4994802703
+国土开发 12.1089181827
+杨丽萍 12.1089181827
+李宗一 10.9562386728
+下焦 11.1926274509
+油亮 10.2371160058
+自动检测 12.1089181827
+门拱 13.900677652
+门拴 13.900677652
+象皮 12.2912397395
+鄂皖赣 13.2075304714
+李代桃僵 12.8020653633
+商圈 10.0940151622
+简便性 13.2075304714
+人员名单 10.8096351986
+海湾地区 10.4041700905
+留得 9.96885201925
+马恩岛 13.2075304714
+一杯杯 12.5143832909
+电子电路 10.3743171274
+徐志 11.9547675029
+三点水 12.8020653633
+商场 8.092535162
+涂色 13.2075304714
+塞利努 13.900677652
+红灶鸟 12.2912397395
+蒋雯丽 12.2912397395
+油井 9.62401153296
+留德 12.8020653633
+滇越铁路 11.8212361103
+期期 12.1089181827
+如是我闻 13.2075304714
+集成商 11.1926274509
+集中区 10.3453295905
+门房 9.85762638414
+凹下来 13.900677652
+盼顾 13.900677652
+哲学流派 10.8096351986
+硼氢化 12.5143832909
+浅水湾 13.900677652
+门户 7.60541165054
+极量 13.900677652
+听来听去 13.2075304714
+晋灵公 13.900677652
+留归 12.8020653633
+蓝青官话 13.900677652
+刷白 11.7034530746
+商城 8.50251495046
+肩中俞 13.900677652
+丛林地 13.2075304714
+相对真理 11.3357282945
+糖度 11.9547675029
+集中化 10.604840786
+刘铁山 13.900677652
+陆面蒸发 13.900677652
+邓玉函 12.2912397395
+商埠 9.0884932966
+屋檐 10.0505300503
+期末 8.49350588052
+心贴心 12.8020653633
+留影 11.0103058941
+密密匝匝 11.0674643079
+东群沙 13.2075304714
+自诉 10.5684731418
+松岳 12.8020653633
+组织生活 10.9049453784
+贷款额度 9.89334446674
+朝拜 9.5186510173
+入射光 9.96885201925
+平汉线 11.9547675029
+刮地皮 13.2075304714
+姿色 9.84023464143
+蓖麻油 11.9547675029
+任工 13.2075304714
+略为 9.31571017331
+盛有浓 13.2075304714
+精心设计 9.80633308975
+期权 8.77077893705
+算高 12.8020653633
+万目睚眦 13.900677652
+卢龙军 11.9547675029
+车行 10.2371160058
+驶上 10.765183436
+波意耳 13.2075304714
+输入区 13.2075304714
+黄风岭 12.1089181827
+门扉 12.8020653633
+狗叫声 11.598092559
+准备不周 13.900677652
+绥化市 11.9547675029
+第二十二路 13.900677652
+徐岳 12.2912397395
+离乱 11.0674643079
+宁寺敬 12.1089181827
+饲草料 12.2912397395
+沈阳城 11.598092559
+有曜仪 13.2075304714
+离乡 10.5684731418
+表面温度 10.1871055853
+该年 11.7034530746
+第七道 13.900677652
+下片 13.900677652
+诺基亚 9.33632946051
+意义 5.59990069112
+信不信 10.0294766411
+进不去 9.82314020807
+并重 8.61241062128
+装备维修 12.1089181827
+吐丝 10.0720362555
+城市防洪 12.8020653633
+祭服 12.5143832909
+王李氏 13.900677652
+巩固政权 11.0674643079
+将就一下 13.900677652
+毛守白 12.8020653633
+劫机者 13.900677652
+商周 8.90346537821
+吐下 13.900677652
+下牙 11.8212361103
+袁方策 11.2616203224
+谬论 10.3453295905
+研磨剂 12.8020653633
+任希 13.900677652
+商业银行 6.71604849926
+该帮 13.900677652
+松井石根 12.1089181827
+巡天 11.2616203224
+皮传示 13.2075304714
+商君 13.2075304714
+公序良 13.2075304714
+哄笑声 11.3357282945
+意为 7.53592689512
+徐峥 11.598092559
+八千万口 13.2075304714
+脱下 8.61241062128
+闲愁万种 13.900677652
+蒙哥马利 10.533381822
+遵义会议 10.0505300503
+意下 11.9547675029
+离世 10.5684731418
+拉佩纳 13.900677652
+终结者 11.7034530746
+谬误 9.56994431169
+肯不肯 9.94943393339
+第一波 10.0720362555
+该市 8.92394390956
+球面几何 13.900677652
+唇红齿白 11.4157710022
+案件线索 11.9547675029
+进入状态 12.5143832909
+虚晃一招 13.900677652
+逸仙路 13.900677652
+经济部 10.2117981979
+两百年 10.604840786
+离任 9.63799777493
+娜塔莉 13.900677652
+留居 9.43476953332
+娜塔莎 13.2075304714
+商品 5.2850881387
+下狱 8.87023973058
+颈椎 9.80633308975
+实然 13.900677652
+该建 13.900677652
+范冰冰 11.3357282945
+赵孟坚 13.2075304714
+暗器 9.87532596124
+国法难容 13.900677652
+净菜 13.900677652
+硫素 13.900677652
+龙画虎 13.2075304714
+殿试 10.4041700905
+肌酸酐 13.2075304714
+单卵双生 13.2075304714
+回转仪 13.900677652
+政策界限 12.2912397395
+初祖庵 12.8020653633
+许瀚 12.5143832909
+韦弗尔 12.8020653633
+没动静 10.9562386728
+外刊 11.9547675029
+时滞 10.3453295905
+王本来 13.2075304714
+弄清问题 12.5143832909
+时溥 11.7034530746
+离人 12.1089181827
+近水楼台先得月 11.1926274509
+完全 4.82329740726
+红葡萄 12.5143832909
+禄永终 13.2075304714
+贺拉斯 11.1926274509
+秦至楚 13.900677652
+排烟系统 13.900677652
+离京 9.36807815882
+水行州 12.8020653633
+玉件儿 12.2912397395
+聘问 10.8561552143
+倚天 11.4157710022
+框架 7.24266660611
+临床意义 10.3171587135
+舞阳 10.533381822
+纵意 13.2075304714
+严家淦 12.8020653633
+纳斯达克交易所 13.900677652
+圣日尔曼 13.2075304714
+棉的确良 13.900677652
+脱产 11.2616203224
+永恒 8.27305653829
+该店 10.0088573539
+可爱多 13.900677652
+万家灯火 10.6818018271
+象生 11.7034530746
+岳鹏举 13.900677652
+拉蒙 11.1280889297
+强邻相 13.900677652
+招摇撞骗 10.8561552143
+青浦区 12.5143832909
+硫粉 13.2075304714
+徒儿 11.8212361103
+新加坡岛 13.2075304714
+颈梗 13.900677652
+任弼 12.5143832909
+闻陵川 13.2075304714
+情怀 9.12155415886
+迅猛 8.40761620864
+舆榇 12.8020653633
+俯首贴耳 12.8020653633
+东突厥 10.1164880181
+立宪诸 13.2075304714
+脱位 10.4041700905
+折成 10.4349417492
+京津冀 12.5143832909
+科罗尔 13.900677652
+蓬莱县 12.1089181827
+身价超 13.900677652
+玉食 13.2075304714
+风湿痛 12.5143832909
+特鲁维 11.9547675029
+一亿六千多万元 13.2075304714
+暂别 11.0103058941
+上演 7.32420808293
+凹凸不平 10.2371160058
+砂布 13.900677652
+扼杀 9.30555780184
+走步 12.1089181827
+风湿病 10.642581114
+风湿症 11.7034530746
+安平镇 12.5143832909
+浴血苦战 12.1089181827
+强行军 12.1089181827
+糖尿 12.1089181827
+覃立本 11.1926274509
+平贝母 13.2075304714
+徒具 11.4157710022
+自谋出路 11.7034530746
+秋月明 13.900677652
+罗卜藏 11.4157710022
+压抑感 11.9547675029
+刘穆之 13.2075304714
+集成型 13.900677652
+妙龄女子 13.900677652
+舞鞋 11.8212361103
+任彦 13.900677652
+徐工 9.91169360541
+普多夫 12.2912397395
+比勒陀利亚 11.598092559
+蓟县 9.77354326693
+碎纸 11.8212361103
+离休 9.56994431169
+非所宜 12.2912397395
+仓储业 10.1630080337
+徐州 7.78478552649
+问津 10.6818018271
+客运量 9.71102290995
+净化系统 13.900677652
+意会 11.0674643079
+苏制安 12.8020653633
+期日 12.8020653633
+维那 12.5143832909
+缺粮 10.3743171274
+司炉工 13.900677652
+脱俗 10.4994802703
+哪里话 10.642581114
+三氧化钨 12.5143832909
+细片 13.900677652
+青浦县 10.9049453784
+维道 13.2075304714
+下班 8.35160156708
+社址 12.1089181827
+马拉雅兰 12.2912397395
+糜芳 10.9049453784
+其意 9.07236391467
+关节炎 9.58318953844
+要风得风 13.2075304714
+不复存在 8.80081122415
+算题 13.2075304714
+屋梁 10.0505300503
+公私兼顾 11.8212361103
+期收 13.900677652
+放长 12.8020653633
+多厘米 11.1926274509
+梅嫩蕊 13.2075304714
+信息内容 11.5027823792
+江山易改 11.598092559
+于澎湖 12.1089181827
+橡胶机械 12.1089181827
+十几块 10.533381822
+卢龙县 13.2075304714
+周府中 13.900677652
+再往 8.51618258919
+年庚尧 12.5143832909
+腾地 10.642581114
+无敌手 12.1089181827
+冬种 11.1926274509
+鄂陵湖 10.9049453784
+作福作威 12.8020653633
+第一流 9.4233408375
+夏救民 12.8020653633
+十几场 13.900677652
+陶然亭 11.1280889297
+普渡村 12.5143832909
+江八景 13.2075304714
+驱护舰 12.1089181827
+啧啧称羡 12.8020653633
+十几圈 12.8020653633
+吹出 10.4666904475
+储蓄罐 13.900677652
+着劲儿 11.3357282945
+波尔图 11.598092559
+纵横交错 9.26594866375
+该往 11.2616203224
+期数 11.8212361103
+潘红 13.900677652
+观赏树木 11.4157710022
+铭感不忘 13.900677652
+发出声音 10.604840786
+怀恨在心 10.533381822
+地价税 12.8020653633
+一命呜呼 10.765183436
+汪然 13.2075304714
+揭护法 13.2075304714
+徐劳 11.9547675029
+鼻梁骨 12.2912397395
+第一把 10.3453295905
+蓬莱岛 12.8020653633
+新奥尔良 10.9049453784
+借东风 11.5027823792
+咯血 10.3453295905
+浦东新区 8.97342396682
+糖化 11.3357282945
+净赚 9.94943393339
+慕义来 12.5143832909
+名笔 13.900677652
+两堵 12.2912397395
+减让 11.8212361103
+浅白色 12.8020653633
+徐力 12.5143832909
+整整齐齐 9.25628675283
+白兰度 11.9547675029
+有所为有所不为 11.7034530746
+第一抹 13.2075304714
+印刷品 10.3453295905
+荡秋千 10.9049453784
+准入 8.56795885871
+象管 12.5143832909
+屋来 11.3357282945
+北仑河口 12.1089181827
+参知政事 9.54396882529
+台港澳 12.1089181827
+现代农业 9.61021821083
+网上商店 12.8020653633
+宋元丰 11.9547675029
+小白羊 13.2075304714
+毫不考虑 12.5143832909
+时态 11.0103058941
+置身 9.77354326693
+椒盐 12.2912397395
+村干部 8.86372504956
+怙恶不悛 12.5143832909
+用电户 13.2075304714
+徐勇 13.900677652
+豪情 9.69598503258
+露营地 13.2075304714
+闵帝 11.0674643079
+糖厂 9.54396882529
+麦肯罗 12.8020653633
+薄膜状 12.1089181827
+陈元靓 12.8020653633
+诚如 10.0940151622
+连翩 13.2075304714
+甘边宁 12.5143832909
+布罗德 11.8212361103
+污染者 12.5143832909
+长期实践 11.3357282945
+豪性 13.900677652
+倚坐 12.2912397395
+姓氏笔画 13.2075304714
+糖原 10.8096351986
+松尾 12.1089181827
+那辆车 11.0674643079
+白炽灯 10.1394775363
+渊远流长 13.900677652
+直接对话 11.598092559
+晴雯 9.10488710638
+第一户 13.900677652
+五指毛桃 11.7034530746
+萨莱城 13.2075304714
+谎话 9.72629038208
+打击者 13.900677652
+灰铁 13.900677652
+一片焦土 13.2075304714
+侯哲安 13.2075304714
+第一手 9.72629038208
+嚅嚅 13.900677652
+竹桥 11.2616203224
+铅笔刀 13.900677652
+侧脑室 13.900677652
+蒙眼 13.900677652
+亨克尔 11.8212361103
+第一所 9.87532596124
+希格玛 13.900677652
+静卧在 12.8020653633
+一千亩 12.5143832909
+颜统军 10.765183436
+栽桑 11.7034530746
+仲巴县 13.900677652
+栅门 10.5684731418
+留利 13.900677652
+王温禺 13.2075304714
+留别 11.8212361103
+祥云 9.36807815882
+麻答 13.2075304714
+石敬塘 13.2075304714
+贻贝 10.533381822
+躲起 13.900677652
+乾隆年间 9.06439574502
+企业应用 12.5143832909
+车辆管理 10.3171587135
+第一批 7.67414098269
+不折不扣 9.63799777493
+留到 10.1630080337
+近八年 11.7034530746
+水葫芦 11.3357282945
+蓟州 8.98802276624
+北京石油学院 13.2075304714
+伯查德 13.2075304714
+原作者 13.900677652
+糖分 9.41204128224
+击破 9.38981814546
+马来西亚 8.0600359946
+高增益 11.598092559
+基准价 10.3453295905
+说东道西 11.9547675029
+镇区 11.1926274509
+丰宁满族自治县 13.2075304714
+黑鹿 11.598092559
+附属性 13.2075304714
+框框 11.0674643079
+留发 11.7034530746
+朱庆永 13.2075304714
+堡主 12.5143832909
+第一排 10.9562386728
+留取 11.5027823792
+执字 12.8020653633
+紫灰色 13.2075304714
+王庭 10.9562386728
+孔明一一 13.2075304714
+冬眠 9.17328983326
+军用机 12.8020653633
+门源 11.4157710022
+徒弟 7.49214886092
+申办人 13.900677652
+何足畏 13.900677652
+吴国华 13.900677652
+万殊 12.5143832909
+走散 10.533381822
+带班 11.3357282945
+商学 12.5143832909
+该党 9.0884932966
+火镜 12.5143832909
+口口声声 9.40086798165
+一千亿 12.8020653633
+暂居 11.4157710022
+小侄女 12.8020653633
+任其 9.62401153296
+任兵 12.8020653633
+化学感受 13.900677652
+波尔塞 13.900677652
+策勒县 13.2075304714
+万段 12.1089181827
+左宗正 13.2075304714
+江海堤防 13.900677652
+学前班 12.8020653633
+刑戮 12.5143832909
+白卡纸 10.9049453784
+要带头 12.2912397395
+碍眼 11.8212361103
+针刺麻醉 11.0103058941
+三十余个 12.1089181827
+纳布科 13.2075304714
+神情沮丧 11.9547675029
+蜡板 13.2075304714
+置辩 13.2075304714
+类型化 12.5143832909
+鹰嘴 11.1926274509
+麦肯纳 13.900677652
+农家品种 13.2075304714
+多孔性 11.9547675029
+框格 13.900677652
+时尚品牌 11.7034530746
+三层楼 11.0674643079
+处理方式 10.5684731418
+王札阑 13.2075304714
+枯坐 10.7226238216
+当局者迷 11.598092559
+任光 12.2912397395
+卢军 13.900677652
+缸盖 11.3357282945
+克拉姆 11.9547675029
+任免 8.80081122415
+米乐继 12.8020653633
+乌桓亦 13.2075304714
+汉学家 10.0294766411
+陆太太 11.7034530746
+借读费 12.8020653633
+宋王 12.1089181827
+不逊于 10.8561552143
+执导 9.10488710638
+冲积锥 12.8020653633
+该函 13.2075304714
+两壶 11.8212361103
+事半功倍 10.3743171274
+钢片琴 12.8020653633
+磐安县 13.2075304714
+舟舆 13.900677652
+准儿 11.8212361103
+死皮赖脸 11.4157710022
+该减 12.1089181827
+走时 8.84443184663
+小贩 9.49395840471
+舟船 9.91169360541
+任军 12.8020653633
+淑媛 11.7034530746
+环境温度 10.1394775363
+守备 9.13850371718
+谵语 10.9562386728
+集中式 11.7034530746
+零零星星 11.0674643079
+减速带 12.5143832909
+不折不挠 13.900677652
+任内 9.59661255877
+东阳县 12.2912397395
+便鞋 12.1089181827
+男生宿舍 10.9562386728
+击碎 10.4994802703
+巡回 9.56994431169
+时态变化 13.900677652
+抬出去 11.0103058941
+十几天 9.44633035572
+葡萄糖氧化酶 12.8020653633
+奥利弗 12.2912397395
+事务处 11.4157710022
+开拓史 13.900677652
+纳不纳 13.2075304714
+商定 8.57280148319
+宽街 13.900677652
+搞活经济 13.2075304714
+小财 11.9547675029
+徐卫 13.2075304714
+任凭 8.66423568915
+将门之后 12.5143832909
+仰头 9.53122979951
+贡觉 11.5027823792
+十几处 11.7034530746
+交换价值 9.00283785202
+蜡染 10.3743171274
+充满热情 11.7034530746
+盗窃者 11.5027823792
+仰天 9.7898037878
+待缘 13.900677652
+暂开 13.900677652
+都安瑶族自治县 12.1089181827
+袁伟民 11.5027823792
+两千多万 13.2075304714
+该剧 9.56994431169
+默然不语 10.9049453784
+检举信 12.5143832909
+西北部 7.09828288865
+乳品业 12.2912397395
+杨诚斋 13.900677652
+洞见 11.9547675029
+彭雪枫 12.5143832909
+缩瞳药 13.900677652
+禁猎区 12.2912397395
+人口爆炸 11.8212361103
+独自一人 9.58318953844
+陈岱孙 12.8020653633
+测距法 12.5143832909
+王厚恩 12.2912397395
+苏里科 12.1089181827
+乌桓人 11.1280889297
+捕得 11.598092559
+框死 13.900677652
+朴刀来 11.1280889297
+服不服 12.5143832909
+不错呀 11.3357282945
+棕刷 12.8020653633
+阿克尔 13.900677652
+消导药 12.5143832909
+淑女 10.0940151622
+完工 8.45825994145
+零距离 11.1280889297
+日程表 11.5027823792
+该判 12.8020653633
+仙女下凡 12.2912397395
+客户机 13.2075304714
+京师 7.07196558033
+捕快 10.3171587135
+蒲席 13.2075304714
+启发式 11.0103058941
+公孙述 11.8212361103
+永泰 10.604840786
+该到 10.642581114
+烧伤科 13.2075304714
+击筑 11.7034530746
+徐僖 13.2075304714
+该刊 10.1164880181
+盗版软件 13.900677652
+踏月 12.8020653633
+应国公 13.2075304714
+屏蔽 9.03314320152
+稀奇古怪 10.1871055853
+宣官传 12.5143832909
+一个半桩 13.2075304714
+蚀损 13.900677652
+袁绍聚 13.2075304714
+惺惺相惜 11.3357282945
+勤奋好学 10.8096351986
+异国情趣 13.900677652
+旧例 10.0505300503
+惊羡 11.8212361103
+大王镇 12.2912397395
+国泰航空公司 13.900677652
+任劳 13.2075304714
+执壶 10.9049453784
+科罗纳多 12.2912397395
+门派 11.1926274509
+加强型 13.900677652
+分网 12.8020653633
+半夜里 9.22784881751
+惶惶不可终日 10.5684731418
+特卖会 10.2630914922
+诚实 9.19114745066
+暂得 11.8212361103
+灵璧县 12.8020653633
+王本欲 13.900677652
+轻型坦克 9.98865464655
+侯蒋 12.8020653633
+博罗塔 12.5143832909
+山风光 12.5143832909
+蓬莱市 12.2912397395
+断发文身 12.8020653633
+门洞 9.19114745066
+第一性 10.765183436
+步日耶 12.8020653633
+区位商 13.900677652
+小贝 12.2912397395
+襄汾 11.3357282945
+成象 12.5143832909
+室内空间 11.8212361103
+积分算子 13.900677652
+冷如冰 11.8212361103
+假惺惺 10.765183436
+焊锡 11.9547675029
+任王潮 12.8020653633
+下级 8.58747167293
+时报 8.21709788464
+宁远县 13.900677652
+七事八事 12.8020653633
+血流漂杵 13.900677652
+愈发 8.84443184663
+左宗棠 9.71102290995
+门海 13.900677652
+若尔盖县 12.2912397395
+问宝玉 10.6818018271
+旧伤 12.8020653633
+新加坡元 12.5143832909
+昆明市 9.80633308975
+秽语 12.1089181827
+徐健 13.2075304714
+出口值 11.3357282945
+冬瓜 9.80633308975
+泽金从 13.2075304714
+下线 9.84023464143
+常林钻石 12.5143832909
+闻大圣 12.8020653633
+尽欢而散 13.2075304714
+海鲁 13.900677652
+三十三起 13.2075304714
+也门共和国 11.9547675029
+去去就来 11.5027823792
+毛冠鹿 9.91169360541
+条约国 13.2075304714
+该办 11.4157710022
+孳息 11.1926274509
+玉饰 11.8212361103
+刘铁匠 12.2912397395
+拽住 8.99540287354
+胚乳 9.87532596124
+炉料 11.3357282945
+陈胜自立 13.2075304714
+掖县 11.3357282945
+朝气 10.2117981979
+徐冰 13.900677652
+侯蒙 11.5027823792
+支宗王 12.8020653633
+花莲 10.3453295905
+该卡 12.5143832909
+扼死 12.2912397395
+花笃好 13.2075304714
+工农分子 13.2075304714
+十几对 12.5143832909
+扼止 12.8020653633
+粘性力 11.4157710022
+湘东 10.533381822
+三万多户 13.2075304714
+投注额 13.2075304714
+该印 13.900677652
+跪谢 11.7034530746
+大串 13.900677652
+高士晶莹 13.2075304714
+负屈衔冤 12.8020653633
+商女 13.2075304714
+动情周期 13.900677652
+司徒美堂 13.2075304714
+湘中 9.93038573842
+正义斗争 11.5027823792
+徐军 12.8020653633
+王见 12.1089181827
+吴仲华 12.5143832909
+华东地区 9.23723855786
+走板 11.598092559
+马祖岛 12.2912397395
+左权县 11.9547675029
+储蓄率 8.9519177616
+下网 11.598092559
+留出 9.89334446674
+宗教团体 10.9562386728
+走来 7.52395070408
+几小时 9.49395840471
+流通领域 8.6803218269
+水泄不漏 13.900677652
+拉姆斯菲尔德 12.2912397395
+全燕 12.8020653633
+国贸局 13.900677652
+峭壁 8.29120585679
+泛滥 8.11993413618
+玉皇顶 11.598092559
+倦容 11.4157710022
+差不远 13.900677652
+老憨汉 12.8020653633
+击穿 8.99540287354
+旧人 9.82314020807
+睡卧不安 12.8020653633
+补习 11.1926274509
+控制部件 11.8212361103
+徐凡 13.900677652
+该区 9.23723855786
+永淳 11.7034530746
+低层次 11.7034530746
+事务官 11.5027823792
+十几家 9.91169360541
+徐凯 9.94943393339
+介绍性 12.5143832909
+裁抑 10.9049453784
+财赤 12.5143832909
+任贺鲁 13.2075304714
+设备设计 12.5143832909
+马努斯 13.2075304714
+过目不忘 10.9049453784
+湘乡 9.62401153296
+帕米拉 11.8212361103
+门法 13.2075304714
+各色人等 10.4349417492
+呼保义 11.1926274509
+朱绣入 13.2075304714
+商大 13.900677652
+下缘 11.1926274509
+旧事 9.32596667347
+燕阵 12.8020653633
+北京外国语大学 11.8212361103
+商委 13.900677652
+汤杯 13.900677652
+地基基础 13.2075304714
+巡哨 10.3171587135
+玉娇枝 13.2075304714
+任县 11.8212361103
+涨停板 8.2985588311
+旧书 11.1926274509
+爽然 12.2912397395
+缺点 7.62591563073
+泥石流 9.36807815882
+旧习 10.9562386728
+李光羲 13.900677652
+手工操作 11.4157710022
+该台 10.8096351986
+颐中 12.1089181827
+马祖尔 13.900677652
+马述宽 13.900677652
+执委 11.2616203224
+郁闷死 12.8020653633
+玉庆满 13.2075304714
+护林防火 12.5143832909
+国王队 13.2075304714
+书本 9.58318953844
+铁杵磨成针 13.900677652
+任原 11.598092559
+书札 10.0088573539
+佶屈聱牙 12.5143832909
+泥泞不堪 12.2912397395
+算钱 11.9547675029
+侵吞公款 12.5143832909
+愈加 8.09554268306
+尼迈里 12.5143832909
+埃克特 12.1089181827
+赖派 11.5027823792
+内线交易 12.8020653633
+回头见 11.0103058941
+拨交 13.2075304714
+旧主 11.4157710022
+劈脸 10.3171587135
+梁天柱 10.3453295905
+徒工 11.9547675029
+该县 9.43476953332
+失土 12.1089181827
+王庆 8.53938548627
+异国情调 11.1280889297
+时间跨度 10.4349417492
+桓彦范 11.8212361103
+永济 10.2371160058
+文化路 9.82314020807
+韦勒克 13.2075304714
+净身 10.6818018271
+亮亮堂堂 12.8020653633
+旧业 11.7034530746
+该厂 10.0294766411
+邓艾约 13.2075304714
+任参 12.5143832909
+赏个 11.9547675029
+李开先 11.598092559
+徐兄 11.3357282945
+寻龙 9.85762638414
+徐克 10.4041700905
+徐光 12.5143832909
+海阵 11.5027823792
+伊璜 12.8020653633
+疥疮 11.598092559
+谷禄制 13.2075304714
+通风处 11.5027823792
+司马欣 13.2075304714
+子中惟 13.2075304714
+徐若萱 13.2075304714
+老相好 11.9547675029
+申购量 11.2616203224
+传奇性 10.9562386728
+健壮 9.03314320152
+联合国难民事务高级专员公署 13.2075304714
+智利共和国 13.2075304714
+出口国 9.00283785202
+古币 12.2912397395
+倒拉 13.900677652
+仰峰 12.5143832909
+留园 11.5027823792
+拮据 9.85762638414
+祠墓 12.8020653633
+任君 11.9547675029
+室内设计 11.3357282945
+勒石 11.5027823792
+缺省 12.8020653633
+查泰莱 13.900677652
+敷得 13.900677652
+普渡河 11.4157710022
+于心无愧 13.2075304714
+中国消费者协会 11.4157710022
+极顶 12.2912397395
+太尉府 12.1089181827
+许下诺言 12.8020653633
+五味杂陈 12.5143832909
+穆鲁特 13.900677652
+评上 12.2912397395
+斯海军 13.900677652
+问明 9.75754292558
+借债人 13.900677652
+一应俱全 10.1394775363
+史迁殿 12.8020653633
+海鳅 11.1926274509
+任命 6.84795660274
+徐国 10.765183436
+顾齐平 13.900677652
+糖块 11.8212361103
+循环无端 13.900677652
+朝歌 11.5027823792
+闻大军 13.2075304714
+徐园 12.8020653633
+该名 10.6818018271
+姆莱 13.2075304714
+评个 13.900677652
+优待证 13.2075304714
+洞达 11.8212361103
+别构配体 13.900677652
+琼州 11.0674643079
+十几岁 9.55687223012
+曼彻斯特大学 11.2616203224
+水印 10.9562386728
+讲笑 13.900677652
+评为 8.32094782599
+可再生性 12.1089181827
+朝正 13.2075304714
+昌都县 12.2912397395
+外国专家 11.0674643079
+况普天 13.2075304714
+硫矿 12.2912397395
+第一曲 13.2075304714
+期满 8.74738605748
+事务局 11.1926274509
+评介 10.9562386728
+淑德 13.900677652
+桦甸 11.1280889297
+张戎 13.900677652
+黄花女 13.2075304714
+中国人 13.900677652
+銮舆 11.598092559
+书市 12.2912397395
+净角 13.2075304714
+宣仁温 13.900677652
+养鹰 11.9547675029
+杨大妈 10.2897597393
+阿拉善旗 12.5143832909
+那凤 12.8020653633
+琼崖 10.765183436
+缝补 10.4349417492
+贸易网 12.8020653633
+沐浴 8.68574189437
+十几层 12.1089181827
+古汴渠 13.2075304714
+摄氏度 9.18217878068
+巴仲麦 13.2075304714
+只许州官放火 12.5143832909
+虎踞鲸吞 13.900677652
+阿尔卑斯省 13.2075304714
+评价 6.74919218807
+黄文农 13.2075304714
+第八任 13.2075304714
+襄樊 9.19114745066
+低柔 13.900677652
+商店 7.9817837977
+评了 13.900677652
+卢全 12.8020653633
+田哥 10.4666904475
+司令部 7.34959731693
+齿轮 8.83177344976
+须老翁 13.900677652
+经费 7.82303540863
+杨翠喜 12.5143832909
+死鱼 11.5027823792
+真长老 12.1089181827
+十几尊 12.5143832909
+具体措施 9.07236391467
+南南合作 10.4041700905
+清廉正直 13.900677652
+水太浅 13.900677652
+嚅动 10.8096351986
+小趾 12.8020653633
+十几封 13.2075304714
+席位数 12.5143832909
+十三根 12.5143832909
+官宗伯 12.8020653633
+赵嘉麟 12.8020653633
+后人乘凉 13.900677652
+苦无对策 12.8020653633
+拜访 8.78868986362
+于枫丹 13.900677652
+糖基 12.8020653633
+绿叶菜 12.1089181827
+易其主 13.2075304714
+当自强 13.2075304714
+煽动力 13.2075304714
+章衣萍 13.900677652
+养鹤 12.1089181827
+置评 10.2630914922
+时数 10.6818018271
+愈合 8.41588071849
+豪斯 9.65218240993
+第一枚 10.6818018271
+河水库 12.2912397395
+经济实用 11.598092559
+新鲜血液 10.2371160058
+于蜀郡 12.8020653633
+浅谈 12.8020653633
+乔卢特 13.900677652
+古铜色 11.2616203224
+第一枪 10.2630914922
+时效 10.0940151622
+宽减 13.2075304714
+扑得 13.2075304714
+琼岛 11.7034530746
+处理不当 10.8096351986
+十个月 9.75754292558
+魂灵 9.80633308975
+成效卓着 13.2075304714
+组织部门 11.0103058941
+飞流直下三千尺 12.5143832909
+叶廷秀 11.1926274509
+土建工程 11.2616203224
+居鲁士 10.8096351986
+演示会 13.900677652
+双剑 11.7034530746
+蒙人 10.765183436
+诺贝尔化学奖 9.80633308975
+山谷风 11.598092559
+诚属 13.900677652
+海防部队 12.8020653633
+评优 12.5143832909
+名贵物品 13.2075304714
+易趣网 13.2075304714
+时政 9.4233408375
+乔灌木 11.598092559
+千秋万代 10.9049453784
+杨炎升 13.2075304714
+水位 8.04560572977
+苜蓿 9.94943393339
+贡赋 9.74179456862
+大乐 10.7226238216
+稀有元素 10.533381822
+撞击中心 13.900677652
+评传 11.7034530746
+出口型 10.0088573539
+遍览群籍 13.2075304714
+豪族 10.2630914922
+人民解放军总部 12.1089181827
+和雪生 13.2075304714
+蜂蜜水 11.4157710022
+尤德利 13.900677652
+徐城 13.2075304714
+一百一十九个 13.2075304714
+评估 6.91688768672
+豪放 9.49395840471
+痱子粉 12.1089181827
+时日 8.45394028031
+郑世横 13.2075304714
+悲愤填膺 13.900677652
+琼尼 13.900677652
+准假 13.900677652
+关节窝 13.2075304714
+第一期 9.01032852375
+千秋万世 12.8020653633
+越之君 13.2075304714
+过渡型 11.0674643079
+十景 10.8096351986
+时时 8.24468584116
+强烈不满 9.87532596124
+卢克 11.598092559
+开式 11.4157710022
+任其发展 11.3357282945
+组织部长 9.63799777493
+周俊 11.9547675029
+第一本 9.7898037878
+敷布 11.9547675029
+潘晓婷 13.2075304714
+证券化 9.01032852375
+大久 11.7034530746
+下种 11.0674643079
+死丫头 11.4157710022
+日落黄 12.8020653633
+厌恶疗法 12.5143832909
+汉宫传 13.900677652
+三里河 11.9547675029
+蒙旨宣 13.2075304714
+第一朵 13.2075304714
+墙砖 12.5143832909
+迫切要求 10.0294766411
+军事科学出版社 12.2912397395
+九州岛 10.765183436
+印度斯坦 10.7226238216
+琼山 10.765183436
+依兰县 11.3357282945
+危象期 13.900677652
+悦达 11.1926274509
+第一束 12.8020653633
+奴俾 13.900677652
+瓷碟 12.8020653633
+焦辣辣 13.900677652
+焦达 13.900677652
+于阗复 13.2075304714
+时方 11.3357282945
+纳粹主义 11.5027823792
+第一村 12.8020653633
+拮抗 10.642581114
+第一杯 12.1089181827
+留在 6.47890185833
+十七位 13.900677652
+事故 7.12759727632
+推而广之 11.7034530746
+时文 10.7226238216
+缺盆 11.9547675029
+薛天培 13.2075304714
+第一条 8.56795885871
+直言正色 13.900677652
+唐叔虞 11.9547675029
+董折发 12.8020653633
+文化课 11.4157710022
+印第安 8.97342396682
+亨莱因 13.2075304714
+喜剧演员 11.3357282945
+完婚 10.2630914922
+飞语 13.900677652
+春满人间 13.2075304714
+爆裂声 11.9547675029
+步甲科 12.2912397395
+民主党 8.40350942668
+寄主范围 12.5143832909
+临渊羡鱼 13.900677652
+巴拉顿 13.900677652
+兰博基尼 11.598092559
+蒲巍 13.2075304714
+望眼镜 13.2075304714
+缺电 11.7034530746
+驮篓 12.8020653633
+贻误 9.77354326693
+公知吾 13.2075304714
+肢窝 13.900677652
+商山 12.5143832909
+出口品 12.2912397395
+武当剑 13.900677652
+龙生九种 12.8020653633
+宫城居 13.2075304714
+核试爆 13.900677652
+克拉底 11.3357282945
+仁义君子 13.2075304714
+信金邦 13.900677652
+领导职务 9.48183704418
+古汴河 12.2912397395
+遵义县 12.8020653633
+商屯 12.5143832909
+凭以 12.1089181827
+明显增加 9.12155415886
+拜请 10.765183436
+冬灌 13.900677652
+罗奔尼 13.900677652
+十几座 11.2616203224
+法新社 10.4994802703
+舆情 10.1871055853
+现被 13.900677652
+创价 12.8020653633
+暂存 11.4157710022
+文化街 11.7034530746
+两万三千 13.900677652
+五十两 9.61021821083
+丢了棒 13.900677652
+集成度 11.3357282945
+舆论工具 11.9547675029
+何孟雄 13.2075304714
+天下大事 11.1926274509
+山中瑞 13.2075304714
+时明 12.2912397395
+执法不公 12.8020653633
+红旗渠 10.3453295905
+由慧梅 12.5143832909
+赏格 11.0103058941
+李方桂 12.2912397395
+玉宇琼楼 13.900677652
+下章 12.2912397395
+置行 11.8212361103
+奥利塔 13.2075304714
+优孟 13.900677652
+猛虎添翼 13.2075304714
+橡胶 7.37125881371
+下端 9.38981814546
+诚征 10.7226238216
+拿腔作势 12.1089181827
+该团 9.84023464143
+天下大乱 9.71102290995
+销售业务 10.0720362555
+齿质 13.900677652
+极高 8.089536659
+宁波人 11.0674643079
+十几年 8.092535162
+消声室 13.900677652
+跑步 9.40086798165
+完备 7.71859274526
+十枚 12.5143832909
+寻小宝 13.2075304714
+契阔 13.900677652
+建三江 13.900677652
+徒增 12.8020653633
+四六文 12.2912397395
+王权仗 13.2075304714
+该回 12.5143832909
+暴雨成灾 13.2075304714
+梅百器 13.2075304714
+不幸遇害 13.900677652
+下站 10.8561552143
+丁贤俊 11.8212361103
+医疗组 12.5143832909
+二十五万五千两 12.5143832909
+象素 13.900677652
+王真人 10.9049453784
+留名 10.604840786
+门楼 8.18036587537
+留后 10.4666904475
+特征选择 13.900677652
+不要命 9.84023464143
+没有印象 11.8212361103
+工时费 11.598092559
+王八蛋 9.14708746087
+恶龙 11.8212361103
+公约国 13.2075304714
+门楣 10.4994802703
+盘古开天地 12.2912397395
+完好 8.18364995057
+期求 13.2075304714
+冬烘 12.5143832909
+多好几倍 11.9547675029
+拖下去 9.91169360541
+白专 13.900677652
+南澳岛 12.1089181827
+阳光灿烂 10.3171587135
+吴国和 13.2075304714
+空气压缩机 11.1280889297
+部长职务 13.2075304714
+白丝 12.8020653633
+详解 10.0720362555
+合法权 12.2912397395
+青布罩 13.900677652
+森达 12.8020653633
+京津塘 11.8212361103
+热核反应 10.5684731418
+套马 12.1089181827
+统计学家 10.765183436
+严复感 13.2075304714
+有板有眼 10.9562386728
+干部家庭 11.9547675029
+任圣 11.9547675029
+马尔康县 12.1089181827
+波尔布 12.2912397395
+哺养 12.5143832909
+国际钢铁 10.642581114
+下签 13.2075304714
+时松 12.5143832909
+模糊认识 13.2075304714
+固定翼 9.85762638414
+阴性反应 13.2075304714
+云四州 13.2075304714
+毫无来由 13.900677652
+软件业 11.8212361103
+尹张顾 13.2075304714
+辨白 13.900677652
+南亚 8.24818847171
+弗赖伊 13.900677652
+脚步声 7.80260336981
+五十万 9.5062284973
+楼中楼 13.900677652
+下策 10.4666904475
+陕甘宁 10.1630080337
+世袭制 10.7226238216
+楼层 10.0505300503
+门梁 12.8020653633
+舞龙 11.7034530746
+买卖合同 10.0505300503
+事非得已 12.5143832909
+密克罗尼西亚 10.1164880181
+耐火泥 13.2075304714
+整齐有序 12.5143832909
+鲁利亚 12.2912397395
+科顿 12.5143832909
+中小型 8.35160156708
+谷德带 12.8020653633
+该场 12.5143832909
+时机 6.68690934386
+赵文瑄 13.900677652
+该地 8.83808261895
+主编 7.42678695562
+王朱鼎 12.8020653633
+冤各有头 12.5143832909
+踢踏舞 12.1089181827
+纨绔子弟 11.3357282945
+时有 7.99804431857
+连门儿 13.2075304714
+言必信 11.598092559
+五十三 11.8212361103
+龙闻哀 13.900677652
+印刷厂 10.5684731418
+十分高兴 8.84443184663
+问政 11.9547675029
+屠牛 13.900677652
+政权建设 11.0103058941
+五十下 12.8020653633
+逆风而行 13.2075304714
+真好汉 12.5143832909
+千番 13.2075304714
+时期 4.89871537911
+证类本草 12.2912397395
+干茶呈 13.2075304714
+两寸 11.1280889297
+曼陀林 12.1089181827
+雷蒙达 12.8020653633
+友好关系 9.28555713513
+司天秘 13.2075304714
+股份合作制 11.9547675029
+商州 8.91707103027
+桌下 11.1280889297
+双勾 12.5143832909
+黄花烟草 13.2075304714
+牧安骥 12.8020653633
+妓院 9.6811699468
+并须 10.9049453784
+贡辽 13.2075304714
+第一支 9.82314020807
+半截入土 13.2075304714
+出口商 9.77354326693
+该城 9.22784881751
+下篇 11.4157710022
+西色雷斯 12.5143832909
+白亮亮 13.900677652
+权威认证 12.5143832909
+坐电梯 12.8020653633
+当不来 13.900677652
+陈代梁 12.8020653633
+惜字如金 13.900677652
+商工 11.2616203224
+祛淤 13.900677652
+安赫利 13.2075304714
+沈阳市 9.77354326693
+哀泣 12.5143832909
+和豪奢 13.900677652
+二十余只 12.8020653633
+十几张 10.9049453784
+三海里 13.900677652
+豪杰 8.83808261895
+疥癣 11.5027823792
+小谢 10.2371160058
+好轻 13.900677652
+法老 9.80633308975
+走掉 9.82314020807
+花魔芋 13.900677652
+门桥 12.5143832909
+问斩 10.9049453784
+回头路 11.8212361103
+韩暹 11.2616203224
+侯关某 13.2075304714
+自限性 11.8212361103
+群芳谱 11.9547675029
+殷都区 12.5143832909
+魏国用 13.2075304714
+好车 12.5143832909
+徐商 12.2912397395
+屠狗 13.900677652
+高季兴 11.598092559
+腾开 12.8020653633
+天秤座 11.9547675029
+许衡诣 13.2075304714
+门框 9.25628675283
+寇莱公 12.8020653633
+东南 6.06549389671
+斯杜特 10.9049453784
+船弦 12.8020653633
+海兰德 13.2075304714
+缺欠 12.5143832909
+东单 11.1280889297
+忽喇喇 12.5143832909
+孔雀东南飞 11.1926274509
+大修 9.77354326693
+哺乳 9.44633035572
+狼子野心 12.1089181827
+下摆 9.66657114738
+车臣共和国 13.2075304714
+麦仁 12.8020653633
+金业勤 13.2075304714
+森罗殿 10.8561552143
+赖皮 11.598092559
+冬温 10.9562386728
+薄产 13.900677652
+专利品 13.900677652
+儿童节目 13.900677652
+阳辅 13.900677652
+六和塔 11.1280889297
+特造 12.1089181827
+金属构件 12.5143832909
+最笨 13.2075304714
+迁流 13.900677652
+企业资质 10.4666904475
+屈折 10.9562386728
+评分 8.0746775446
+鞠躬 9.43476953332
+略宽 11.5027823792
+第八十二回 12.2912397395
+朝着 7.96050639926
+第一站 10.4666904475
+遴选 9.75754292558
+对称性 9.49395840471
+唱名 10.8561552143
+古铜鼎 13.2075304714
+在群众中 10.765183436
+千秋万古 13.900677652
+盘脚坐 13.900677652
+浓烟滚滚 11.598092559
+评判 9.15574552361
+里克利 13.2075304714
+宋元嘉 11.9547675029
+旋翼机 10.9049453784
+第一章 8.73589167805
+索价 12.8020653633
+五十九 10.9562386728
+咣当 10.4666904475
+滴溜溜转 12.2912397395
+四六等 13.2075304714
+法律援助 10.604840786
+雄厚资金 11.9547675029
+质子泵 13.900677652
+清高宗 11.4157710022
+屈才 12.8020653633
+蜡纸 10.9562386728
+水城路 13.900677652
+确当 11.598092559
+唱响 11.7034530746
+员林 13.2075304714
+脱壳 9.7898037878
+核工业部 12.5143832909
+奔逸 12.8020653633
+周围环境 9.59661255877
+终极目标 10.9049453784
+下操 12.2912397395
+古之仙 13.2075304714
+优抚工作 13.900677652
+基本相同 8.64318227995
+堡垒 8.66423568915
+一百七十卷 12.8020653633
+基层政权 10.533381822
+丸散膏丹 12.5143832909
+王侯将相 11.598092559
+油子 11.9547675029
+鲁火赤 13.2075304714
+前灯 11.8212361103
+那秋桐 13.2075304714
+算过 10.642581114
+特选 12.2912397395
+角弓反张 11.4157710022
+蔡卞 11.9547675029
+奢侈品 8.73589167805
+闯祸 10.1164880181
+莫衷一是 10.3171587135
+屋翳 13.900677652
+永登 11.3357282945
+钱三强 11.1926274509
+梅木 13.2075304714
+田家 9.09665660724
+算进 13.2075304714
+舞者 10.2897597393
+内营力 13.900677652
+牛家沟 11.7034530746
+有所改进 11.1926274509
+意境 8.66956903512
+太医院 9.55687223012
+离境 10.2630914922
+不大一样 11.598092559
+韩存保 11.8212361103
+固定性 11.3357282945
+贾母扶 12.8020653633
+闷罐车 12.2912397395
+司法程序 10.3453295905
+魑魅魍魉 11.598092559
+公孙舍之 12.5143832909
+寻宝者 12.1089181827
+机械设计 10.8561552143
+歌唱家 9.66657114738
+董士选 13.2075304714
+庆安县 13.2075304714
+大用处 11.9547675029
+两家 6.67083887382
+压抑着 10.3743171274
+蜗杆传动 13.2075304714
+林克语 13.2075304714
+倚仗 9.93038573842
+问答 9.0884932966
+每家店 13.2075304714
+牛仔装 12.1089181827
+略嫌 11.3357282945
+李苦禅 11.7034530746
+执法不严 11.8212361103
+宋水军 13.2075304714
+通屏东 12.5143832909
+埃克森 10.1630080337
+萨哈夫 13.900677652
+屠氏 13.2075304714
+铲煤 12.2912397395
+离奇 9.12999302751
+象拔 13.900677652
+大卸八块 11.3357282945
+评卷 12.2912397395
+内分泌腺 10.1394775363
+九十六年 12.8020653633
+颐和 12.1089181827
+一百余位 13.900677652
+八十一岁 12.8020653633
+高等植物 9.10488710638
+第一篇 9.37888907493
+封大圣 13.2075304714
+汉言永 12.5143832909
+工商部 11.9547675029
+别籍异财 13.2075304714
+魏徵劝 12.8020653633
+上翠微 13.2075304714
+气胸 11.0103058941
+卡迭石 13.2075304714
+确应 13.900677652
+下放 9.43476953332
+德瓦尔 11.7034530746
+脱失 12.2912397395
+阿谢格 13.2075304714
+宋元圆 13.2075304714
+如堕 12.2912397395
+攻无不取 13.2075304714
+范布伦 13.2075304714
+空等 12.8020653633
+溃疡 8.89004235788
+层次模型 13.2075304714
+步履艰难 11.8212361103
+海格特 12.5143832909
+汪士慎 12.5143832909
+贡酒 10.6818018271
+意外 6.44364556285
+拉姆斯 13.2075304714
+民族情绪 11.5027823792
+包龙图 12.1089181827
+斗争性 11.9547675029
+玉阙 12.8020653633
+斜纹布 11.4157710022
+翠翠 10.3453295905
+大户型 11.8212361103
+下旬 7.52225146832
+晚一点 11.0103058941
+品牌服饰 11.7034530746
+三角铁 12.2912397395
+安乃近 13.900677652
+第一笔 9.93038573842
+稳操胜券 11.4157710022
+屠沽 13.2075304714
+桦树 10.0294766411
+谷精草 12.5143832909
+操控性 10.2117981979
+下旋 13.2075304714
+金国兵 13.900677652
+上规模 10.2117981979
+五十亩 11.3357282945
+顶楼 11.0103058941
+春来早 13.900677652
+进位 9.84023464143
+尹钧科 9.74179456862
+巨石 8.73019365694
+内容分析 12.8020653633
+淡水鱼 9.08039608637
+松劲 11.9547675029
+待续 12.2912397395
+顺时针 10.0720362555
+美国波音公司 11.9547675029
+联防队 13.900677652
+第一等 10.3171587135
+绛色 12.2912397395
+曹聚仁 13.2075304714
+米开朗基罗 12.8020653633
+于也儿 13.2075304714
+顺时钟 13.900677652
+敬殿 12.2912397395
+造纸术 10.533381822
+下方 7.391908515
+夹带 9.62401153296
+广开贤路 13.900677652
+屈指 10.4994802703
+艾儒略 12.5143832909
+松动 8.80692745117
+个头儿 10.765183436
+许衡闻 13.2075304714
+下文 8.34384959028
+五十三岁 12.2912397395
+贸易战 9.75754292558
+招待员 13.900677652
+华夏大地 13.900677652
+钱松岩 13.900677652
+奔逃 9.55687223012
+贡金 11.8212361103
+大伟 10.642581114
+唐英年 12.5143832909
+付诸行动 11.2616203224
+凤英 8.24818847171
+胶合剂 13.2075304714
+感动不已 11.8212361103
+好辞 13.900677652
+兰布达 13.2075304714
+收集器 12.1089181827
+李光昭 9.48183704418
+外语片 11.0103058941
+死有余辜 11.1280889297
+云长未 12.8020653633
+贺岁 10.0940151622
+洞里 8.49350588052
+周五 6.87959368769
+于孙权 12.8020653633
+第一碗 12.8020653633
+计若何 11.9547675029
+时空 8.61747392324
+于宗周 11.9547675029
+自吹 13.900677652
+小鸟依人 11.3357282945
+郑定公 13.900677652
+算账 9.08039608637
+导播 12.5143832909
+缄口无言 13.900677652
+缥缈 9.74179456862
+英语词汇 11.8212361103
+立刘协 13.900677652
+离婚 7.35964765279
+周予 13.2075304714
+吴菱仙 13.2075304714
+数字模型 12.5143832909
+软件包 10.9562386728
+胸廓 10.4994802703
+确已 10.765183436
+班格拉 13.900677652
+相仿 9.32596667347
+垦殖指数 10.642581114
+三氯氧磷 13.2075304714
+章学诚 10.765183436
+日宴庆 13.900677652
+乡镇干部 13.900677652
+八十多里 13.900677652
+仓皇出逃 11.0674643079
+黑露脊 12.8020653633
+配对法 13.900677652
+辰溪 11.9547675029
+艳阳天 11.9547675029
+虚拟存储器 11.5027823792
+益兰州 11.598092559
+积弱积贫 13.2075304714
+还怪 12.2912397395
+三从四德 11.7034530746
+抗美援朝战争 10.604840786
+食谱问题 13.900677652
+撞击力 13.900677652
+高克恭 12.1089181827
+宋元名 12.5143832909
+卡克奇 12.8020653633
+时程 12.1089181827
+警察局长 11.4157710022
+八千二百八十二公里 13.2075304714
+算起 9.46986085313
+枚举 11.598092559
+欢声雷动 11.3357282945
+戚容 12.5143832909
+鹿泰恒 11.4157710022
+妨碍 7.97642185456
+孙钟龄 12.8020653633
+平凉地区 12.8020653633
+葛郎王 13.2075304714
+玛丽莲梦 13.2075304714
+有目共见 13.2075304714
+阿非利 12.1089181827
+手掌心 11.598092559
+实缴 13.900677652
+依法办理 12.8020653633
+筒子楼 11.1280889297
+字眼儿 11.4157710022
+诸友 13.2075304714
+慈溪人 11.2616203224
+磨时间 12.8020653633
+市场报 12.1089181827
+王派军 13.2075304714
+益次郎 13.900677652
+微观世界 10.9049453784
+张文裕 11.8212361103
+美因兹 13.2075304714
+门生 8.80081122415
+北平协和医学院 11.2616203224
+周仲 10.2897597393
+魏徵典 12.8020653633
+郾城 9.96885201925
+旧址 8.55834340001
+趣味无穷 13.2075304714
+寻根究底 11.3357282945
+击掌 10.6818018271
+连珠炮 10.533381822
+郭善明 13.900677652
+人格权 12.8020653633
+旧地 10.2117981979
+煤化工 8.58255765813
+略大 10.9562386728
+试用本 13.900677652
+骗下来 13.900677652
+格什姆岛 13.900677652
+风雨飘摇 10.4349417492
+尽信 10.9562386728
+风湿性 10.5684731418
+民事法庭 12.2912397395
+郑元和 12.8020653633
+配页 13.900677652
+瞬目 12.8020653633
+椒江 11.4157710022
+印刷业 10.2897597393
+雷天觉 13.2075304714
+四项 9.20019728618
+走红 9.44633035572
+可简化 12.1089181827
+岩石圈 9.32596667347
+白乙丙 13.900677652
+雪佛龙 11.1926274509
+宗敏先 13.2075304714
+回天之力 11.7034530746
+毛远新 13.900677652
+奴隶主义 13.900677652
+鹿三刚 12.2912397395
+下来 5.11850822564
+旋宫 11.7034530746
+尾气 10.0505300503
+旧国 12.5143832909
+五十代 13.900677652
+聘者 12.8020653633
+梅朵 13.2075304714
+周代 8.57766767284
+科萨 12.8020653633
+海香亭 9.5062284973
+咳血 10.765183436
+访问学者 11.4157710022
+油壶 11.8212361103
+波函数 10.3453295905
+离子 7.56562340048
+巨眼 11.1280889297
+守宫 10.9562386728
+黑云杉 13.2075304714
+革命领袖 11.0103058941
+宿舍楼 10.3171587135
+下村 12.8020653633
+拖泥带水 10.8561552143
+置闰 11.9547675029
+冯俊扬 13.2075304714
+刷新记录 13.2075304714
+胡福才 13.900677652
+田纳西河 12.1089181827
+反面材料 13.900677652
+油墨 10.0505300503
+第一种 8.37522471284
+桑德森 12.2912397395
+种公鹿 13.2075304714
+下木 12.8020653633
+天之娇 13.900677652
+首项 11.8212361103
+省工商局 10.5684731418
+下机 13.2075304714
+业主论坛 12.8020653633
+宽免 11.9547675029
+维蒂 13.2075304714
+击打 9.53122979951
+并蒂 11.598092559
+吐字 10.7226238216
+嵇康致 13.2075304714
+下有 8.4284069783
+下月 12.1089181827
+成本费 12.5143832909
+契证 13.900677652
+汪凤藻 13.2075304714
+周仓 10.4666904475
+索日河 13.2075304714
+下期 11.7034530746
+下朝 11.0674643079
+文德尔班 12.5143832909
+感冒药 10.533381822
+临产时 13.2075304714
+佐藤荣作 13.900677652
+西索尔 13.2075304714
+慢下 13.2075304714
+下柬 12.8020653633
+静电引力 13.900677652
+奥尔斯克 12.8020653633
+确属 10.9562386728
+太太平平 11.7034530746
+十三太保 13.900677652
+舢板 9.18217878068
+印刷体 12.8020653633
+绝缘漆 12.8020653633
+吐实 13.2075304714
+竹篮打水一场空 11.9547675029
+评出 10.0088573539
+永生 9.44633035572
+王赣骏 12.5143832909
+确山 10.6818018271
+盥洗间 13.900677652
+推广部 12.1089181827
+慢动作 13.2075304714
+抢救室 12.8020653633
+跑前跑后 11.0674643079
+参考手册 13.900677652
+离家 8.80081122415
+俄文 9.77354326693
+差得多 11.598092559
+三百乡 13.2075304714
+比例变换 13.900677652
+振扬 12.8020653633
+脏弹 13.900677652
+名章 13.2075304714
+离宫 9.89334446674
+大位 10.8561552143
+利商民 12.8020653633
+优质品 12.5143832909
+周仁 12.2912397395
+诗酒风流 13.2075304714
+东台 10.2897597393
+似旧 13.900677652
+下枋 13.2075304714
+周仆 7.49379766591
+八强战 13.2075304714
+美国通用电气 12.2912397395
+够慢 13.900677652
+旋子 11.7034530746
+端拱 11.8212361103
+俄方 9.58318953844
+民事法律 10.0720362555
+北达科他州 12.8020653633
+幕后消息 13.900677652
+玩儿完 12.8020653633
+站牌 11.1280889297
+协商者 13.900677652
+友谊医院 12.8020653633
+溃烂 10.4041700905
+千代田 13.900677652
+彻夜难眠 11.4157710022
+劳姆 13.900677652
+小转 13.2075304714
+门环 10.4041700905
+科茨 10.3453295905
+高峭 13.2075304714
+徐京 11.9547675029
+地方官吏 9.49395840471
+缺漏 11.2616203224
+小轩 11.8212361103
+一针 9.59661255877
+迅急 11.9547675029
+守密 13.900677652
+胸壁 11.5027823792
+相国子 13.2075304714
+二百匹 11.5027823792
+第一线 9.49395840471
+离层 12.2912397395
+留任 10.2117981979
+兵粮 11.598092559
+优质化 12.1089181827
+临床学科 13.2075304714
+朝献 12.5143832909
+徐二 13.2075304714
+美国在线 13.900677652
+略微 8.08059472162
+德伯格 12.1089181827
+风云人物 10.1630080337
+第一组 11.1926274509
+雨过天晴 11.2616203224
+秘书处 8.80081122415
+确定 5.35063012369
+祛瘀 11.2616203224
+确实 5.72936077726
+铲球 13.2075304714
+黑腾腾 13.900677652
+经济舱 12.2912397395
+吐屯 12.2912397395
+驶往 10.3453295905
+暗念 13.2075304714
+王真君 13.2075304714
+期盼 8.98069672615
+爱国路 13.2075304714
+电磁透镜 13.900677652
+人机接口 12.2912397395
+徇情 11.8212361103
+维莱 11.9547675029
+留人 11.2616203224
+鼎盛时期 9.25628675283
+油得 13.900677652
+油彩 10.533381822
+苦行僧 12.8020653633
+闭幕会 13.900677652
+沃达丰 12.2912397395
+相国寺 10.0088573539
+日本参议院 13.900677652
+须慎防 13.900677652
+徐丽 13.900677652
+惊慌 7.78699547214
+湘军 9.33632946051
+涓滴归公 13.2075304714
+金鱼缸 12.1089181827
+郑元勋 9.33632946051
+人命危浅 13.900677652
+科莫 11.9547675029
+饲草 10.5684731418
+杨应龙 12.2912397395
+山雄峙 13.2075304714
+卜问其 13.2075304714
+徐世 11.4157710022
+算计 9.01032852375
+鹰扬虎视 12.5143832909
+有我无敌 12.8020653633
+李进忠 12.5143832909
+贸易权 11.1926274509
+干活不累 13.2075304714
+追诉权 12.8020653633
+经济犯罪 10.4666904475
+蒂米什瓦拉 13.2075304714
+留下 5.75774164154
+科菲 12.8020653633
+鹿死谁手 11.7034530746
+脱岗 13.900677652
+油渣果 12.5143832909
+惊愕 9.22784881751
+离岸 9.12155415886
+创可贴 12.1089181827
+李东阳 10.8096351986
+专用程序 13.2075304714
+连梅子 12.2912397395
+三五成群 10.2897597393
+算话 13.900677652
+港口法 13.900677652
+回顾展 11.598092559
+衡以山 13.2075304714
+树袋熊 11.8212361103
+交友不慎 12.5143832909
+留个 9.71102290995
+离岗 11.5027823792
+底下人 11.9547675029
+离岛 10.8561552143
+打信号 12.8020653633
+激情 7.53249046563
+固陋 13.2075304714
+不对头 10.1394775363
+大枪 11.2616203224
+起草人 11.0674643079
+冰场 12.2912397395
+举措失当 12.2912397395
+爽约 11.1926274509
+创制权 13.2075304714
+维茨 11.0103058941
+赖特 10.0505300503
+夜光表 12.5143832909
+卡尔曼滤波 12.8020653633
+出口业 11.2616203224
+九十六家 13.2075304714
+克拉夫特 11.9547675029
+重男轻女 11.4157710022
+小杂种 10.8561552143
+颈窝 12.5143832909
+言必善 13.2075304714
+何家村 12.2912397395
+火魔 12.8020653633
+走神 10.1630080337
+废土 13.900677652
+黄仙姑 9.87532596124
+天津音乐学院 12.8020653633
+郝思平 11.5027823792
+存储单元 11.598092559
+康沃尔郡 12.5143832909
+糖业 9.6811699468
+洛古河 12.1089181827
+双口 12.8020653633
+自动检索 13.900677652
+问罪 9.71102290995
+绣花枕头 11.8212361103
+惊惶 9.54396882529
+新加坡人 13.2075304714
+农科院 11.0674643079
+租赁经营 11.5027823792
+潘地亚 13.2075304714
+宋元南 10.5684731418
+都御史 9.02548032877
+高技术 8.77077893705
+蜡笔 13.2075304714
+糖丸 12.8020653633
+贡锛 11.4157710022
+惊惧 9.49395840471
+十进位制 12.2912397395
+抿着 10.3171587135
+拔山 12.8020653633
+虱子 9.45802639549
+华夏银行 9.11318590919
+襄王 10.2630914922
+惊悚 10.9562386728
+文殊师 13.900677652
+拉得雷 13.2075304714
+屈枉 13.900677652
+惊悉 13.2075304714
+老鹳草 12.8020653633
+里士满 10.8561552143
+席尔瓦 11.4157710022
+官僚资本家 13.2075304714
+电脑硬件 13.2075304714
+石岩山 12.8020653633
+瀛台 10.3453295905
+惊悸 10.4666904475
+蒙药 11.7034530746
+传输数据 12.2912397395
+扶绥县 13.2075304714
+方位感 12.5143832909
+外交活动 10.1630080337
+徐俊 11.7034530746
+拱门 10.1630080337
+油库 10.0720362555
+内务部队 13.2075304714
+乔顿 13.2075304714
+地震烈度 11.4157710022
+留住 9.05649056552
+惊恐 8.20358416547
+烹宰 13.900677652
+拘执 11.3357282945
+戚属 13.2075304714
+走私 8.58747167293
+留作 10.4349417492
+铁马金戈 12.1089181827
+第一缕 12.1089181827
+垂髫 12.2912397395
+离差 11.4157710022
+贺彩 13.900677652
+房价格 12.5143832909
+三十三亿美元 13.2075304714
+宋江知 12.8020653633
+唱出 10.4994802703
+徐伟 11.7034530746
+维艰 12.1089181827
+凝视着 8.53003962385
+极至 10.9562386728
+首飞 9.53122979951
+舒庆春 13.2075304714
+课堂纪律 12.8020653633
+糖人 13.900677652
+电化铝 13.900677652
+自留地 10.1630080337
+衣囊 12.8020653633
+规划法 12.8020653633
+惊怖 11.2616203224
+略带 8.86372504956
+未名湖 10.8561552143
+旧债 11.0103058941
+象是 7.6604018068
+苛性碱 12.2912397395
+西尼笑 13.900677652
+脚痛医脚 11.4157710022
+屈服 8.94485059437
+转移性 11.0674643079
+早中晚 11.598092559
+第一网 12.8020653633
+第一罐 13.900677652
+科苑 11.7034530746
+劳工法 11.0674643079
+门牙 9.91169360541
+新手机 10.8561552143
+留传 10.4349417492
+油布 10.642581114
+走禽 13.2075304714
+莱顿瓶 11.1926274509
+门牌 11.1926274509
+糖价 8.88339781516
+山风中 13.2075304714
+连接处 10.4041700905
+糖份 12.1089181827
+六七百米 12.8020653633
+一氧化氮 11.7034530746
+宗四朝 12.1089181827
+该书 7.60541165054
+该乡 11.2616203224
+舍费尔 12.8020653633
+余夫 12.5143832909
+答谢会 12.5143832909
+鬼泣神嚎 13.900677652
+抗老化 12.5143832909
+唐僧哩 12.2912397395
+湘北 10.765183436
+比什凯克 11.8212361103
+玉蜀黍 11.7034530746
+德川氏 13.2075304714
+张汤 10.9049453784
+八达岭长城 10.9562386728
+下手 7.94484028251
+摇头摆脑 13.2075304714
+训诂学 10.2371160058
+任丘 10.4349417492
+搭班子 11.4157710022
+马辛杰 13.2075304714
+任东 13.900677652
+洞门 9.31571017331
+下属单位 11.4157710022
+任一 9.31571017331
+罗普郡 13.900677652
+合成石油 12.8020653633
+侯大人 12.2912397395
+云南省楚雄彝族自治州 12.2912397395
+贡院 10.533381822
+中央空调 11.1926274509
+撰著 10.6818018271
+山伯英 13.2075304714
+递归函数 11.598092559
+不忠实 11.9547675029
+创伤 8.48457724977
+张文谦 12.2912397395
+不失良机 13.900677652
+下户 10.533381822
+额外负担 12.5143832909
+斟酌一下 12.2912397395
+该为 12.2912397395
+相谢方 13.2075304714
+口腔疾病 12.2912397395
+下房 11.3357282945
+湘南 9.94943393339
+离席 10.1394775363
+余音犹在 13.900677652
+走稳 9.72629038208
+千军万马 9.72629038208
+舌剑唇枪 13.2075304714
+该下 12.8020653633
+脱帽 10.9562386728
+扇阴风 13.2075304714
+离市 12.2912397395
+下成 12.2912397395
+旧厂 12.8020653633
+缧绁 12.5143832909
+任之 12.8020653633
+豪绅 9.94943393339
+封乐毅 12.8020653633
+仓储式 13.2075304714
+象散 12.8020653633
+冬梅 11.598092559
+赵娘子 10.604840786
+该以 13.2075304714
+任人 10.2117981979
+下拨 10.4994802703
+猴拳 12.1089181827
+女子双打 11.598092559
+腰酸背痛 10.9562386728
+不咸不淡 11.9547675029
+朱莉亚 12.5143832909
+娴于辞令 13.2075304714
+马颈圈 13.900677652
+铜川市 11.598092559
+席棚 10.642581114
+诤谏 13.2075304714
+极苦 11.5027823792
+捉奸捉双 13.2075304714
+下拉 10.604840786
+守孝 10.7226238216
+时经 11.5027823792
+大大超 13.2075304714
+冰坡 11.2616203224
+仇么 13.900677652
+重置成本 12.5143832909
+任事 10.1394775363
+阳太守周 13.2075304714
+下拜 10.0720362555
+多斯桑托斯 13.900677652
+戴秉国 13.2075304714
+蒸气浴 13.900677652
+轻型客车 11.5027823792
+地价款 11.7034530746
+平流层 10.4666904475
+梅赛德斯 11.1280889297
+旧区 11.4157710022
+唱功 10.7226238216
+禄劝县 12.2912397395
+科臣 12.1089181827
+时纳 12.8020653633
+离座 10.765183436
+该人 11.9547675029
+撕心裂肺 10.1394775363
+职工股 11.5027823792
+文化部 8.71329184614
+楸树 11.9547675029
+利宜归 12.8020653633
+梁黄河 13.2075304714
+该事 12.5143832909
+过往行人 11.2616203224
+言语知觉 13.2075304714
+信托投资 10.4994802703
+秘书室 12.1089181827
+站点 9.32596667347
+捉虫 12.5143832909
+第一类 9.5062284973
+手持着 11.9547675029
+煤炭工业局 11.8212361103
+三乙胺 12.5143832909
+反腐败 9.56994431169
+专利号 13.900677652
+风再起 13.900677652
+缺氧 8.91707103027
+平安无恙 11.3357282945
+那光艳 13.2075304714
+愈下 13.2075304714
+缺水 8.97342396682
+培修 13.900677652
+盐源县 12.8020653633
+并能 8.42421410004
+提个醒 11.0103058941
+该位 10.8561552143
+长江大桥 11.1926274509
+贺循 11.8212361103
+以计代战 13.900677652
+在手 8.32472854883
+旋律 8.59240995457
+师白法 13.2075304714
+电导率 10.533381822
+记账式 9.80633308975
+寒天 13.2075304714
+御沟红叶 13.900677652
+科考 11.1280889297
+新生儿期 11.8212361103
+击昏 11.7034530746
+古越族 12.5143832909
+间歇喷泉 12.2912397395
+哈泼斯 12.8020653633
+创佳 13.2075304714
+筒子河 13.2075304714
+弱音器 12.5143832909
+走笔 12.2912397395
+下挫 7.26210986281
+并肩 9.24671730182
+玄奘法师 11.8212361103
+脱开 11.1926274509
+过期作废 12.2912397395
+龙纪元 12.8020653633
+离弦 10.6818018271
+任佥 13.2075304714
+达喀尔 10.9049453784
+三万万两 13.900677652
+后处理 10.8096351986
+民生银行 7.91422564669
+诀别 10.5684731418
+百货商店 10.3743171274
+灰头土脸 11.1280889297
+饲育 11.7034530746
+固定架 12.8020653633
+汪家山 12.5143832909
+蕾期 13.2075304714
+湘剧 11.1926274509
+离弃 12.1089181827
+离异 10.3171587135
+秦惠文 11.0674643079
+离开 5.46079756366
+小事化 13.2075304714
+该会 9.46986085313
+金印紫绶 13.900677652
+迅捷 10.533381822
+岿然独存 13.900677652
+战斗出动 13.900677652
+委派 8.73589167805
+临敌易将 13.900677652
+文笔流畅 11.9547675029
+乳品厂 12.2912397395
+任便 11.7034530746
+青庙 13.900677652
+任侠 12.8020653633
+金绿石 12.5143832909
+二叉树 12.2912397395
+祛病 11.5027823792
+憬悟 13.2075304714
+波伦亚 11.8212361103
+意念 10.1630080337
+吴掌柜 13.2075304714
+满口生 12.8020653633
+兼优 11.8212361103
+祛痰 10.1394775363
+太白路 13.900677652
+储水量 11.0103058941
+无偏性 12.8020653633
+油层 10.6818018271
+惊扰 9.59661255877
+尖锐批评 12.1089181827
+离心 9.58318953844
+风韵犹存 11.9547675029
+并联 9.84023464143
+著述 7.89679058487
+意志 7.43453292774
+辘轳 10.4349417492
+连年不断 12.1089181827
+旧制 8.89673134603
+迈向 9.37888907493
+核弹头 9.82314020807
+下接 11.598092559
+基准值 12.8020653633
+威金 13.2075304714
+下推 11.3357282945
+耙组 12.8020653633
+与人方便 12.1089181827
+洗下 13.900677652
+进一步 4.82558442941
+贝色麻 13.2075304714
+成本上升 9.93038573842
+类星体 10.8096351986
+邵飘萍 12.1089181827
+卖主求荣 11.8212361103
+干眼症 10.642581114
+软件园 11.8212361103
+德之士 12.2912397395
+七千余只 13.2075304714
+若伏 13.900677652
+维耶 11.9547675029
+慕容泓闻 12.8020653633
+旧创 13.900677652
+固定术 12.5143832909
+下排 12.2912397395
+克瓦查 13.2075304714
+生活品质 10.6818018271
+黑如墨 11.598092559
+宗为皇 12.8020653633
+几百美元 13.2075304714
+市井之徒 12.5143832909
+司城氏 13.2075304714
+铝镁合金 12.2912397395
+围湖造田 11.2616203224
+心烦意躁 12.8020653633
+薛呆子 13.900677652
+数百亿元 11.598092559
+孤军奋斗 12.8020653633
+宗复封 13.2075304714
+弗赖堡 10.9049453784
+拍打着 9.72629038208
+暖烘烘 10.7226238216
+冬春 9.32596667347
+刹住 10.9049453784
+阿劳坎 12.5143832909
+旧州 11.9547675029
+毫不畏缩 13.2075304714
+杜将军 12.5143832909
+创造精神 11.1926274509
+宋江著 13.2075304714
+星光点点 12.5143832909
+输出特性 12.5143832909
+从难从严 13.2075304714
+并进 9.93038573842
+下江 11.5027823792
+著者 10.2897597393
+梳子 10.1394775363
+马上谓 12.5143832909
+高而不危 13.900677652
+主赛场 13.900677652
+鲍曼高 13.2075304714
+拉姆沙 13.2075304714
+杨砷 12.2912397395
+略去 11.0103058941
+维佐峰 13.900677652
+索尼公司 12.1089181827
+驶去 9.72629038208
+变化莫测 11.1280889297
+氩弧焊 12.2912397395
+陈十策 12.8020653633
+维达 10.6818018271
+油压 11.9547675029
+徐小香 12.5143832909
+常连安 13.2075304714
+冬景 11.1926274509
+阿赛洛 13.2075304714
+油厂 9.54396882529
+挟到 13.2075304714
+贫困县 10.5684731418
+滚水坝 13.2075304714
+升结肠 12.8020653633
+缺损 9.62401153296
+并辔 10.9049453784
+谷钟秀 13.900677652
+计划调节 12.2912397395
+下气 11.9547675029
+愤世 11.8212361103
+杨静仁 12.8020653633
+战火纷飞 11.4157710022
+节车厢 10.7226238216
+临泉县 11.8212361103
+奥斯陆 10.2117981979
+并轨 11.1926274509
+以古为镜 12.8020653633
+下注 9.94943393339
+科达 10.4666904475
+冬暖 10.604840786
+与格 12.5143832909
+讶然 12.1089181827
+下泻 11.9547675029
+中国人民银行 8.11993413618
+屈柘枝 13.900677652
+乌梁海 12.2912397395
+主管部门 7.87239913175
+改来改去 12.5143832909
+几句 6.78835020726
+下泄 10.3453295905
+张鲁大 13.2075304714
+国际海事卫星组织 12.8020653633
+百八十 11.8212361103
+专利局 12.1089181827
+礼贤下士 10.4349417492
+下法 10.7226238216
+奠基人 8.42421410004
+固定桥 13.2075304714
+苦累 13.2075304714
+安宁河 10.6818018271
+石佛寺 11.8212361103
+生物武器 10.1871055853
+房贴 13.900677652
+柯切托 12.8020653633
+贫困化 11.3357282945
+第一版 10.1394775363
+第一片 12.2912397395
+袁娘娘 11.9547675029
+擦干 9.5062284973
+下河 10.2371160058
+骨髓库 13.2075304714
+油区 10.0505300503
+时点 8.35941410682
+张文芬 12.5143832909
+歌唱剧 12.2912397395
+没志气 11.8212361103
+彼得 8.93783302172
+外资企业 9.38981814546
+狂风暴雨 10.0505300503
+下沉 8.43261751084
+门罗 11.1280889297
+放逐 9.36807815882
+琉球屿 12.8020653633
+刮去 10.4666904475
+少而精 11.7034530746
+逢年过节 9.80633308975
+蜡盘 12.1089181827
+下沙 12.1089181827
+聘请 8.42003872863
+击槌 13.2075304714
+手抄本 10.1394775363
+张波 11.2616203224
+梅亚林 13.2075304714
+蒙丞相 11.8212361103
+小边 13.900677652
+竹木 9.46986085313
+脱党 12.1089181827
+下浮 9.74179456862
+冬月 10.8096351986
+流转额 13.2075304714
+下海 9.55687223012
+傅士仁 11.9547675029
+脱光 10.0720362555
+意兴 12.2912397395
+穗选 13.900677652
+牛怪 13.900677652
+下流 9.20932976975
+徒众 11.0674643079
+编订者 12.8020653633
+没出息 9.31571017331
+确因 12.8020653633
+完事 9.80633308975
+鲁花赤 13.2075304714
+海泡石 11.4157710022
+田娘 10.765183436
+观无量 11.598092559
+无边无际 9.89334446674
+饮水机 12.2912397395
+王孟英 12.5143832909
+愧心 12.8020653633
+思维科学 11.598092559
+大兴安岭 8.28754954559
+正弦波 10.9562386728
+略加 10.1871055853
+万缕千丝 13.900677652
+贝尔格莱德 9.94943393339
+宁红 12.5143832909
+尚朋堂 13.2075304714
+发言稿 13.2075304714
+加官进禄 13.2075304714
+受激发射 12.8020653633
+下派 12.2912397395
+弃耕 12.8020653633
+易清洗 12.5143832909
+日用瓷 11.3357282945
+第一班 13.900677652
+基泽 12.8020653633
+下洋 13.2075304714
+区际 11.3357282945
+华西大学 12.1089181827
+陶行知 10.8561552143
+藏精器 12.8020653633
+候芳魂 13.2075304714
+教区长 13.900677652
+极贵 13.2075304714
+用人不当 12.2912397395
+未能得逞 11.5027823792
+西尔威斯 13.900677652
+居庆州 13.2075304714
+华夏儿女 13.2075304714
+奥利佛 13.2075304714
+苹果园 11.4157710022
+某地 9.7898037878
+不拘一格 10.4349417492
+不二法门 11.4157710022
+夜行 9.75754292558
+势不两立 10.1871055853
+中华民族 8.08059472162
+万余里 11.8212361103
+照开 13.2075304714
+旋儿 11.2616203224
+双选会 11.9547675029
+屈死 10.8561552143
+通济渠 10.3743171274
+冬枣 13.900677652
+朝纲 10.1630080337
+旧属 11.2616203224
+不对味 13.900677652
+油剂 11.7034530746
+转轮密码 13.900677652
+王常 11.7034530746
+朵玫瑰 10.2117981979
+旧居 10.1164880181
+帝原 13.900677652
+任吴相 13.2075304714
+时燕 13.2075304714
+区隔 11.9547675029
+小辛 12.5143832909
+中欧国际工商学院 11.1926274509
+屈武 12.2912397395
+绞肠痧 12.5143832909
+生命攸关 12.2912397395
+密西西比河 9.61021821083
+握得 11.3357282945
+旋入 12.5143832909
+吐出 8.47572763449
+八十一名 13.900677652
+左右顾盼 13.900677652
+开绿灯 11.598092559
+北御辽 12.8020653633
+评定 8.56313957227
+于蜀营 13.2075304714
+不食周粟 13.2075304714
+高墨达 13.900677652
+参军事 12.5143832909
+体育场地 13.2075304714
+宋江教 10.765183436
+评审 8.40350942668
+燕之议 12.5143832909
+以防 8.10766404359
+四十位 13.2075304714
+霍贝玛 12.8020653633
+太平真君 10.642581114
+夹心 10.4041700905
+逐步推广 10.9562386728
+唐小西 13.2075304714
+吐到 11.8212361103
+向宗第 12.5143832909
+布伦托 11.5027823792
+戚友 13.2075304714
+唯物主义 8.33615724465
+食杂店 13.900677652
+旋动 11.8212361103
+着魔 11.5027823792
+灿若云霞 13.900677652
+布约亚 13.900677652
+蜷曲 10.4349417492
+警察部队 10.4994802703
+平天下 10.6818018271
+黄原扎 13.2075304714
+驶出 9.87532596124
+中国电子商务协会 13.2075304714
+胸围 10.9049453784
+共和军 12.8020653633
+群众路线 10.8096351986
+白衣秀士 10.9562386728
+别打我 12.8020653633
+扇扇子 12.2912397395
+囿于 10.1871055853
+行贿受贿 11.2616203224
+笔耕不辍 12.2912397395
+寇台州 13.2075304714
+青天 9.58318953844
+谈朋友 12.8020653633
+驻华大使 10.4994802703
+第一点 10.8561552143
+高家堰 12.2912397395
+姚东照 11.1280889297
+玩具娃娃 13.900677652
+衡石丈 13.2075304714
+火葬场 10.9049453784
+捎话 10.8096351986
+尼迈耶 12.8020653633
+宣官引 13.2075304714
+梁亦清 8.85725253506
+暂住 10.3171587135
+下港 13.900677652
+贡马 11.7034530746
+蒸汽轮机 10.1164880181
+安全区 13.2075304714
+那丹哈达 12.2912397395
+区长 8.95903522937
+暂作 12.1089181827
+科赫 10.604840786
+下游 6.40847460936
+魂飞胆破 13.900677652
+远愁近虑 13.900677652
+旧得 13.2075304714
+脱到 13.2075304714
+屠杀 8.18036587537
+迁来 9.5186510173
+捕俘 12.1089181827
+意切 13.2075304714
+昆明人 11.1926274509
+按察使 9.55687223012
+话剧团 11.598092559
+硖石 12.5143832909
+略写 13.2075304714
+一望而知 11.1280889297
+鹿泰桓 12.1089181827
+涨涨跌跌 11.598092559
+豪爽 9.45802639549
+双名 11.0103058941
+驶入 9.34680076038
+隔声罩 13.900677652
+环球航空公司 13.2075304714
+缺憾 10.2117981979
+祭扫 11.1280889297
+连接器 12.2912397395
+并起 10.4041700905
+暂依 13.900677652
+略具 10.8561552143
+宣汉县 13.900677652
+蹼足 13.900677652
+油光 10.1164880181
+王治国 13.900677652
+宽带接入 12.8020653633
+旋切 12.8020653633
+冬播 10.2897597393
+罗世烈 10.9562386728
+陶恩顿 13.2075304714
+下滑 6.25241462107
+国家至上 12.5143832909
+闭门不纳 12.8020653633
+南部非洲 10.2630914922
+迎来送往 11.0103058941
+下溢 13.2075304714
+建筑装修 11.8212361103
+韩武子 13.900677652
+豪特 13.2075304714
+意动 12.2912397395
+创造性 8.55357012126
+简狄生 13.2075304714
+并购 7.42987814819
+空头支票 10.604840786
+子曰诗云 12.8020653633
+谢尔福德 13.2075304714
+神池县 13.2075304714
+别答 13.900677652
+朱以海 11.9547675029
+王朱谊 12.8020653633
+区间 6.58081272217
+与你同在 13.2075304714
+背向着 12.8020653633
+十斤 9.89334446674
+植树节 12.5143832909
+石秀听 12.5143832909
+服装学院 11.9547675029
+字画 8.9308643524
+击毙 8.92394390956
+附足 13.900677652
+问点 13.2075304714
+击毁 9.43476953332
+彩电业 13.900677652
+官僚作风 12.5143832909
+林之北 13.2075304714
+储蓄所 11.7034530746
+旧式 9.62401153296
+令酒 13.2075304714
+夜光虫 12.2912397395
+一万二千五百一十二 13.2075304714
+犯罪活动 10.2630914922
+聚酯薄膜 12.8020653633
+宁死不降 13.900677652
+张嘴巴 11.8212361103
+弃艇 13.900677652
+暂且 8.30225569298
+进不了 10.1394775363
+湘帘 12.2912397395
+感到痛心 11.4157710022
+旧好 13.900677652
+会厌软骨 12.5143832909
+评奖 10.1871055853
+乒坛 13.2075304714
+意即 9.18217878068
+曹大人 11.8212361103
+于昭烈 13.2075304714
+冲击力 9.53122979951
+施工单位 10.0720362555
+大中小企业 11.9547675029
+飒飒 10.0720362555
+吴铭德 10.642581114
+旋压 13.2075304714
+脱卸 11.8212361103
+象棋 10.642581114
+武厅前 12.5143832909
+饲料厂 12.1089181827
+椒料 13.2075304714
+经久不息 11.5027823792
+地球表层 10.4349417492
+别过 10.2117981979
+极轻 11.1280889297
+离华 13.900677652
+暂为 12.1089181827
+下潜 9.77354326693
+肯斯 13.900677652
+半月刊 10.3743171274
+马奶子 13.900677652
+出口贸易 9.89334446674
+经济账 11.9547675029
+瀛州 11.7034530746
+意匠 12.5143832909
+纰缪 13.900677652
+软弱无力 10.3453295905
+噤若寒蝉 10.9049453784
+慰问信 12.1089181827
+特重 11.9547675029
+失查 13.900677652
+附属物 10.0505300503
+查字 13.2075304714
+捏着鼻子 11.8212361103
+可乘之机 9.84023464143
+城市防灾 13.900677652
+三万八千一百九十四户 13.2075304714
+门高弟 13.900677652
+宽大地 13.900677652
+实线 11.5027823792
+走眼 11.4157710022
+气调 12.1089181827
+租户 11.8212361103
+弃船 11.1280889297
+和莲莲 12.8020653633
+博恩霍尔 13.900677652
+听丘 13.900677652
+毛豆油 12.8020653633
+高山土壤 12.8020653633
+位似变换 13.2075304714
+殿阁 9.93038573842
+申张正义 13.900677652
+脱发 10.0294766411
+夏国谱 13.2075304714
+卡路里 10.1164880181
+仓廒 11.3357282945
+过磷酸钙 11.4157710022
+耙犁 13.2075304714
+等兵 12.8020653633
+暂于 13.2075304714
+矿务局 9.75754292558
+暂予 13.2075304714
+附息债 12.2912397395
+豪猪 11.0674643079
+工程上马 11.7034530746
+卡尔达诺 12.8020653633
+极远 11.9547675029
+人同此心 12.5143832909
+无可救药 11.0674643079
+略偏 10.8096351986
+唱念 10.9562386728
+交付给 10.1164880181
+愉色 13.900677652
+洞顶 10.642581114
+六十里 10.2371160058
+脱口 9.54396882529
+万宝路 12.5143832909
+加泰隆 11.8212361103
+蜡疗 13.900677652
+八十六年 13.2075304714
+高等教育 8.85082164473
+疹子 11.7034530746
+耗水量 12.2912397395
+矿泉水瓶 12.1089181827
+邓初民 12.1089181827
+门类 8.33615724465
+模型船 13.900677652
+只开出 13.900677652
+屋瓦 10.604840786
+唱得 9.6811699468
+横向联合 12.8020653633
+离去 7.74369866639
+抓岩机 13.900677652
+吐司 13.2075304714
+彼岸 9.37888907493
+旋即 8.79473217808
+吐口 10.3453295905
+虚拟现实 13.2075304714
+吃醋 10.3743171274
+象样 10.3171587135
+宫腔内 11.7034530746
+短信内容 13.2075304714
+涉讼 11.4157710022
+暂付 13.900677652
+四五件 13.900677652
+海南经济特区 11.9547675029
+暂以 11.7034530746
+冬日 9.18217878068
+共同完成 10.9049453784
+脱去 9.20019728618
+总线结构 12.8020653633
+玩儿命 13.900677652
+梁静茹 12.8020653633
+曾玉良 13.2075304714
+旧币 10.9562386728
+期票 11.4157710022
+言行不一 12.5143832909
+下档 10.6818018271
+英雄模范 11.8212361103
+梁曙光 8.28027678626
+结构钢 11.1926274509
+下桥 11.8212361103
+相国印 12.8020653633
+宁远府 13.2075304714
+皇恩浩荡 11.3357282945
+芦木 12.8020653633
+多值逻辑 12.1089181827
+特韦雷 13.900677652
+意味 8.10766404359
+六万余 12.2912397395
+情势所迫 12.5143832909
+通财之义 13.900677652
+吐吐 12.2912397395
+维诺 12.2912397395
+宫城之 12.1089181827
+何家湾 13.2075304714
+谈书法 13.2075304714
+碍手 13.900677652
+罗奔乃 13.2075304714
+外语类 12.1089181827
+瓜洲镇 12.5143832909
+光是在 12.8020653633
+走火 10.8096351986
+拉姆森 13.900677652
+航空航天 9.72629038208
+盘中餐 12.8020653633
+不许动 10.642581114
+患病率 10.533381822
+商专 12.8020653633
+刻过来 13.900677652
+商丘 8.26946587015
+商业 5.77179750985
+油垢 12.1089181827
+汛期 8.73019365694
+算草 13.900677652
+红嘴鸥 13.2075304714
+预料中 11.1926274509
+空疏 12.2912397395
+秋庭 12.5143832909
+期终 11.9547675029
+十日 9.22784881751
+执中 12.5143832909
+鲤鱼门 13.2075304714
+棺盖 10.0088573539
+永立 13.2075304714
+离向 13.900677652
+下标 11.4157710022
+广告业 12.2912397395
+埃克斯 12.5143832909
+执业 9.58318953844
+立刘崇 12.8020653633
+堡子 11.5027823792
+联合国贸易和发展会议 11.5027823792
+波多尔 13.2075304714
+执一 12.5143832909
+记账员 12.5143832909
+成都电子科技大学 13.900677652
+离合 9.7898037878
+新车型 9.75754292558
+意向 7.92432674268
+李体林 13.900677652
+站立 7.93709830836
+尤者 13.2075304714
+几不欲生 13.900677652
+绝缘性 10.0294766411
+风度翩翩 10.9049453784
+捡便宜 12.5143832909
+蒸气机 13.900677652
+宁缬 10.1394775363
+高性 13.900677652
+向风坡 13.900677652
+门第 9.72629038208
+旅行队 13.900677652
+清新俊逸 12.2912397395
+心理障碍 10.765183436
+迸溅 12.1089181827
+神农氏 10.8096351986
+穷理尽性 13.900677652
+唱声 12.1089181827
+褶痕 13.900677652
+油坊 11.1280889297
+升上去 13.900677652
+下棋 8.89004235788
+巧劲儿 13.900677652
+作伪证者 13.2075304714
+商代 8.17382990439
+外语系 11.7034530746
+凯撒大帝 12.5143832909
+经世之 11.2616203224
+树底下 10.4349417492
+丛林中 9.89334446674
+骑马飞奔 13.2075304714
+特遣队 11.9547675029
+公安队伍 13.2075304714
+吐哺 13.2075304714
+堡寨 11.3357282945
+金粟兰 12.5143832909
+续范亭 12.8020653633
+热呼呼 11.1280889297
+质谱法 12.1089181827
+任昭文 13.2075304714
+好赌 12.2912397395
+河西 8.1608847398
+施公案 11.8212361103
+商事 10.765183436
+陈眉公 13.900677652
+潇洒自如 11.3357282945
+叶城今 13.2075304714
+南街村 13.900677652
+太尉乃 13.2075304714
+死缠 11.7034530746
+舞谱 11.7034530746
+商人 6.59818122825
+走点 12.8020653633
+城区 7.53249046563
+第一百 10.7226238216
+七长八短 12.1089181827
+作业条件 12.8020653633
+扰动理论 12.5143832909
+两地分居 11.4157710022
+执事 8.97342396682
+急先锋 10.1164880181
+号召力 9.58318953844
+击水 11.5027823792
+问着 9.75754292558
+磷酸甘油 13.900677652
+迁怒 11.1926274509
+芦柴 12.5143832909
+强娶 12.5143832909
+好样儿的 12.5143832909
+滞留不归 13.2075304714
+下楼 8.61241062128
+尚飨 12.1089181827
+安东诺夫 11.2616203224
+把门人 13.2075304714
+观果植物 13.900677652
+巴不得 8.53470163695
+溪湖 12.5143832909
+中山大学 9.29550746599
+陈去病 12.1089181827
+却大异 13.2075304714
+男女私情 11.598092559
+缺德鬼 12.8020653633
+小娈童 11.8212361103
+上推 10.3171587135
+连袂 13.2075304714
+驶回 11.598092559
+贾宝玉 10.533381822
+徐光烈 12.8020653633
+万里晴空 12.5143832909
+住院部 11.4157710022
+寻甸回族彝族自治县 12.5143832909
+交下来 13.2075304714
+商会 8.7245279194
+后半部 10.765183436
+独挑大梁 12.8020653633
+肌原纤维 12.2912397395
+沸泉 11.0103058941
+尼姆鲁 12.8020653633
+仿毛 12.8020653633
+氘化 13.2075304714
+走往 11.0103058941
+伊特 10.9562386728
+细绫 13.900677652
+唱头 13.2075304714
+李重 12.5143832909
+六辆 13.900677652
+西藏自治区筹备委员会 12.5143832909
+胸内 12.5143832909
+十四五里 12.5143832909
+面面相看 13.2075304714
+鬻文为生 13.900677652
+白菜价 11.7034530746
+评弹 11.4157710022
+颜晟时 12.5143832909
+惊梦 11.3357282945
+发奋图强 11.8212361103
+三百余名 13.900677652
+后派 12.5143832909
+湖光山色 10.2897597393
+南谯区 13.900677652
+单引号 11.598092559
+多孔结构 13.2075304714
+稻瘟病 11.9547675029
+蓟州守 13.900677652
+朱元彰 13.900677652
+屡教不改 12.5143832909
+排卵期 10.9562386728
+执信 12.8020653633
+夜生活 11.0103058941
+不急不徐 12.8020653633
+格列柯 13.2075304714
+学前期 13.2075304714
+捉贼 11.7034530746
+利益冲突 9.96885201925
+四位数 11.7034530746
+勤政为民 12.2912397395
+宾童龙 13.2075304714
+敷上 10.9049453784
+皮卡第 12.1089181827
+舞起 10.5684731418
+岭北行省 10.9562386728
+第一眼 9.59661255877
+花落花开 12.2912397395
+地理综合 12.8020653633
+象湖 12.8020653633
+击沉 9.25628675283
+性激素 9.6811699468
+香港特区 11.1926274509
+寻连克 13.2075304714
+辰河 13.2075304714
+截止期 13.2075304714
+阿劳加 12.8020653633
+逻辑程序 13.900677652
+时疫 11.4157710022
+确切 7.82303540863
+最大数 13.2075304714
+王凯旋 11.4157710022
+下榻 9.38981814546
+评得 13.900677652
+申购者 11.0103058941
+饮弹 13.900677652
+油嘴 11.2616203224
+净额 8.9102450652
+汽车厂家 10.8096351986
+撰述 10.2371160058
+徐福厅 13.2075304714
+线性表 12.5143832909
+自来水 8.81927328699
+伪言 13.900677652
+差路 13.900677652
+溪源 11.9547675029
+有其父必有其子 13.900677652
+捉起 12.2912397395
+程巨夫 13.2075304714
+功利主义者 12.8020653633
+直喊 12.5143832909
+邹元标 10.765183436
+波马雷 13.900677652
+太空城 11.7034530746
+仰仗 9.72629038208
+三十三首 13.2075304714
+掠夺者 11.598092559
+白内障 9.55687223012
+烤鸭店 12.5143832909
+共商大计 13.900677652
+北方邦 10.9049453784
+治好病 12.2912397395
+清平世界 11.4157710022
+胡太后 11.9547675029
+十几份 11.9547675029
+风景如画 11.1926274509
+过与不及 13.900677652
+十几件 13.2075304714
+花宝鉴 13.900677652
+黄亚生 13.900677652
+洛豪德 12.5143832909
+点阅召集 12.5143832909
+宁波市 9.38981814546
+香盒 11.598092559
+桦林 11.8212361103
+体贴入微 11.7034530746
+八十一只 13.900677652
+青黄不接 10.642581114
+寓于 11.1280889297
+确凿 9.98865464655
+仰仪 12.2912397395
+门禁 11.5027823792
+溪流 9.10488710638
+旧家 12.5143832909
+十几亩 12.2912397395
+高级技工 11.3357282945
+刘有义 13.2075304714
+拐棍儿 11.8212361103
+行凶作恶 12.8020653633
+太原市 10.1394775363
+科西 12.2912397395
+十几人 11.9547675029
+屈沈 13.2075304714
+蒙自 11.1926274509
+十几亿 11.9547675029
+朱梁 12.2912397395
+旧宫 12.1089181827
+北川县 13.2075304714
+四十丈 12.8020653633
+一九三九年 11.2616203224
+国网公司 11.8212361103
+勤务兵 10.9562386728
+阿富汉 13.900677652
+腾云 11.3357282945
+永磁 10.6818018271
+吐噜 11.9547675029
+海量 9.89334446674
+旧宅 11.4157710022
+测温表 12.8020653633
+刷牙 9.98865464655
+直喷 10.2117981979
+第一瓶 12.5143832909
+旋回 10.8561552143
+苦尽甘来 11.4157710022
+吸附平衡 13.900677652
+误以为 9.59661255877
+老一辈 10.0088573539
+阿拉维 12.2912397395
+走狗 10.3743171274
+黄钺白 12.2912397395
+自留山 13.2075304714
+大智度 11.4157710022
+绿波 11.8212361103
+扭转颓势 12.8020653633
+重刑犯 12.1089181827
+巴蒂斯塔 11.7034530746
+舞蹈 7.54630761118
+意图 7.57631868959
+分列式 13.2075304714
+和喜儿 13.2075304714
+迷彩色 13.900677652
+桦木 10.3743171274
+折子戏 11.0103058941
+祝你成功 12.5143832909
+泪道 11.7034530746
+爪哇海 11.0103058941
+脱困 10.6818018271
+丹朱 12.1089181827
+胸前 7.72897705456
+跨步电压 13.2075304714
+克食 13.2075304714
+医学博士 11.2616203224
+掌状脉 12.8020653633
+置顶 12.5143832909
+埃塞奎博 13.900677652
+十几个 7.75649201785
+宝贝孙子 12.8020653633
+美国大学 11.598092559
+欧洲共同体 9.19114745066
+铝型材 13.2075304714
+鹰手营子 13.2075304714
+百货商场 10.6818018271
+十几两 12.5143832909
+风景优美 9.69598503258
+门票 8.59737274392
+屈氏 12.8020653633
+十几串 13.2075304714
+刘正彦 11.598092559
+拐弯处 10.3453295905
+溪涧 10.3171587135
+河北宣工 12.8020653633
+区里 10.1871055853
+十几下 12.2912397395
+本征函数 13.2075304714
+皮壳 10.8561552143
+门神 9.98865464655
+难以逾越 10.533381822
+布阿吉 11.9547675029
+杨阁老 11.7034530746
+高婕放 12.8020653633
+碳化硅 10.8561552143
+米勒兰 11.598092559
+寓义 13.900677652
+初段 10.642581114
+匡谬正俗 13.900677652
+蜡烛 7.81390292506
+七星鱼 13.900677652
+望而止步 12.8020653633
+猛烈起来 12.8020653633
+缪称训 13.2075304714
+安福 11.1280889297
+下步 11.598092559
+齿鲸 11.5027823792
+胸口 8.10461990121
+弓劲弩 13.900677652
+屠戮 9.82314020807
+知耻而后勇 11.8212361103
+母鸟 13.2075304714
+旁枝末节 13.2075304714
+里外里 12.5143832909
+金明寨 13.2075304714
+站票 12.1089181827
+永福 10.3743171274
+贸易法 11.5027823792
+油品 9.36807815882
+张履祥 12.8020653633
+昌黎北 13.2075304714
+人口危机 13.900677652
+倪瓒 10.765183436
+荣禄站 12.8020653633
+截止日 9.69598503258
+恕不奉陪 12.8020653633
+自放电 13.2075304714
+反咬 12.8020653633
+主创者 13.900677652
+埃克曼 11.1280889297
+文代会 13.2075304714
+院内外 13.2075304714
+仰俯 12.5143832909
+脱坯 12.5143832909
+伊力特 11.598092559
+费林德 13.900677652
+不容置喙 13.2075304714
+下次 8.41588071849
+离地 9.62401153296
+所见者 12.1089181827
+任剑桥 12.5143832909
+意在 8.37522471284
+溪水 9.45802639549
+中国外交部 10.6818018271
+寒心 9.96885201925
+容克斯 12.8020653633
+可免于 13.2075304714
+易言之 13.2075304714
+条件性 12.2912397395
+下款 11.2616203224
+彭其将军 12.8020653633
+空空如也 10.0505300503
+陈应安 12.5143832909
+蝇蛹 13.900677652
+不对劲 9.5062284973
+喷喷香 13.2075304714
+黯然神伤 10.765183436
+排卵日 12.8020653633
+风化层 12.5143832909
+龙史进 11.7034530746
+必由之路 9.89334446674
+恶食 13.2075304714
+特区政府 10.7226238216
+北大营 12.2912397395
+昌黎县 11.598092559
+枪击案 10.9049453784
+呼啦啦 10.9049453784
+工资制度 11.0674643079
+城河 12.8020653633
+胸卡 13.2075304714
+文化馆 10.2371160058
+阿拉善盟 10.8561552143
+中国北方地区 10.9562386728
+孤军奋战 10.8096351986
+上海动物园 13.900677652
+净高 12.8020653633
+琼中 10.765183436
+火神庙 12.8020653633
+轸念 13.900677652
+涌泉穴 11.8212361103
+索布扎 13.2075304714
+十几位 10.8096351986
+黑云母 10.2117981979
+评工 13.900677652
+并行 8.60236028543
+老姑娘 11.8212361103
+击溃 8.42421410004
+下毒 10.8096351986
+一米阳光 13.2075304714
+蜡熟 12.5143832909
+八十一分 13.2075304714
+宋沿江 13.2075304714
+创作才能 12.2912397395
+激进党 11.3357282945
+永祥 10.4666904475
+螺线管 12.2912397395
+关键设备 11.4157710022
+脱垂 10.9562386728
+下段 10.4349417492
+送礼物 11.4157710022
+倾盆而降 13.900677652
+魏徵少 12.8020653633
+纪念碑式 11.8212361103
+略同 10.642581114
+溪沟 10.8096351986
+断壁颓垣 12.5143832909
+实体图 13.900677652
+通济桥 13.2075304714
+卷层云 11.7034530746
+压缩算法 13.2075304714
+光洁度 11.9547675029
+驶向 9.85762638414
+珍藏版 13.2075304714
+涝池 11.4157710022
+陈府尹 12.5143832909
+刁猾 13.900677652
+夏国行 12.8020653633
+无立锥之地 11.7034530746
+驱虫药 11.7034530746
+胜得 12.5143832909
+油毡 12.5143832909
+森罗宝 12.8020653633
+下周 7.50541605386
+养花 11.0103058941
+浮想联翩 10.9049453784
+旧日 9.03314320152
+食源性 13.900677652
+西伯尔 12.8020653633
+蜡丸 11.0103058941
+科伦坡 10.642581114
+监测数据 9.4233408375
+呋喃树脂 13.900677652
+青海地区 11.5027823792
+舆人 13.900677652
+钟南山 9.96885201925
+郭申 12.8020653633
+隆德东 12.5143832909
+吴城镇 11.9547675029
+劳工处 13.900677652
+单反相机 12.2912397395
+暂由 11.9547675029
+体西学 12.8020653633
+安之若命 13.2075304714
+调味料 10.642581114
+诚然 8.74162235276
+车路 12.1089181827
+颈侧 11.4157710022
+典当行 10.7226238216
+妾妇 13.2075304714
+惊喜 7.84389363875
+恶因 12.8020653633
+发力点 11.8212361103
+年久失修 10.533381822
+恬不知耻 11.4157710022
+双唇 10.2371160058
+亲临其境 13.900677652
+妥妥贴贴 13.900677652
+离格 12.5143832909
+总需求 9.28555713513
+解剖室 12.8020653633
+谢侠逊 13.2075304714
+从上向下 12.2912397395
+暂留 11.1926274509
+评成 13.900677652
+半截儿 12.2912397395
+太屈心 13.2075304714
+石湖县 11.3357282945
+磁盘机 11.9547675029
+生不如死 11.3357282945
+宋元明 11.7034530746
+下吏 13.900677652
+公开场合 10.1871055853
+金堂县 11.9547675029
+宗演 12.8020653633
+魏建猷 13.2075304714
+阿寅勒 13.900677652
+主牌 13.2075304714
+自娱自乐 12.1089181827
+马绍纳 13.2075304714
+极天际地 12.8020653633
+眼观六路 11.5027823792
+金堂南 13.2075304714
+萌芽期 12.2912397395
+矮牵牛 13.2075304714
+配电室 13.900677652
+神清意 13.2075304714
+了结 8.15767446417
+咧开嘴笑 12.5143832909
+戚楚 13.2075304714
+解剖学 9.17328983326
+跳楼价 12.2912397395
+创业投资 9.06439574502
+山游 13.900677652
+进步力量 11.1280889297
+溪口 10.2117981979
+邓军叉 12.8020653633
+下品 11.4157710022
+培植亲信 13.900677652
+蜷局 13.900677652
+四尾 12.8020653633
+谱分析 11.0674643079
+旧教 13.2075304714
+房棘球 13.2075304714
+半径大小 13.900677652
+周树杰 12.5143832909
+留空 11.9547675029
+缩手缩脚 10.9049453784
+挛缩 11.1926274509
+白匪 11.9547675029
+水分亏缺 12.5143832909
+谭盾 13.900677652
+尾大不掉 11.1280889297
+贸易区 12.5143832909
+击出 10.9049453784
+争夺战 7.65457088649
+白化 12.8020653633
+珍珠粉 10.642581114
+习称钦 13.2075304714
+蔡振峰 13.900677652
+威尔逊山 12.2912397395
+沐猴而冠 12.5143832909
+拉姆吉 13.900677652
+朱骏 11.5027823792
+熟猪油 12.2912397395
+固定值 12.8020653633
+经典着作 13.900677652
+出口税 10.9049453784
+周匝 13.2075304714
+绝缘层 11.3357282945
+日本早稻田大学 11.8212361103
+行贩 12.2912397395
+极情尽致 13.900677652
+穆泽尼 13.2075304714
+屈利 13.2075304714
+交通银行 8.06879517469
+创记录 12.1089181827
+凹凸棒石 11.7034530746
+望太尉 12.2912397395
+淑珍 13.2075304714
+戚大帅 11.598092559
+袁隆平 10.7226238216
+糖稀 12.8020653633
+紧随其后 8.56795885871
+玉钏 11.9547675029
+于敖山 13.2075304714
+林务 13.2075304714
+首都 6.46111834284
+坎宁安 12.2912397395
+白带鱼 13.900677652
+屋中 8.98069672615
+岸标 13.900677652
+生态危机 12.5143832909
+恶性疟 13.2075304714
+腕骨 11.8212361103
+亲生子女 12.8020653633
+屋主 11.9547675029
+从长计较 12.1089181827
+张宗禹 11.9547675029
+社会制度 8.57766767284
+击倒 10.0940151622
+居宗周 12.8020653633
+子苻健 13.2075304714
+亿兆 11.9547675029
+迁就 9.56994431169
+嘴巧 13.900677652
+立刘恒 13.2075304714
+反哺 11.1926274509
+收放自如 11.598092559
+汲水 10.7226238216
+迁居 8.33999602096
+屈原 8.94485059437
+杀鼠剂 11.8212361103
+该社 10.2371160058
+蒙王爷 12.8020653633
+由赞礼 12.8020653633
+某国 10.9562386728
+三十卷 10.533381822
+京口 9.98865464655
+某团 12.8020653633
+浪迹天下 13.2075304714
+下唇 9.84023464143
+无烟日 13.2075304714
+收容审查 12.5143832909
+隔河岩 12.1089181827
+吹口哨 11.5027823792
+敦煌市 11.1280889297
+够糟 13.2075304714
+管乐队 12.2912397395
+凤历幻 13.2075304714
+习举子 13.2075304714
+酷到 13.900677652
+试剂瓶 13.900677652
+成员名单 12.1089181827
+多尔蒂 12.8020653633
+奥彭海 13.900677652
+明季三 13.2075304714
+概预算 13.900677652
+五十卷 11.1926274509
+再压缩 13.2075304714
+杨惟忠 13.900677652
+一个九头 12.5143832909
+卢鹿剑 12.5143832909
+惊呆 8.91707103027
+施都丁 11.7034530746
+该称 13.2075304714
+折福 13.900677652
+惊呼 8.75318317516
+米粉店 13.900677652
+梅特卡夫 13.2075304714
+扶正固 13.2075304714
+万壑松风 12.2912397395
+急功好利 13.2075304714
+沃尔顿 12.1089181827
+邢薜 12.1089181827
+瓦房店 12.8020653633
+基本学科 12.8020653633
+庆功酒 13.900677652
+各骑 12.8020653633
+该科 8.52539924429
+不打自招 11.8212361103
+张宗祥 12.8020653633
+三一斤 13.900677652
+水利工程 8.49350588052
+金门岛 11.598092559
+宋朱熹 11.8212361103
+叶梗 13.2075304714
+庞特勤 13.2075304714
+刚要 8.68574189437
+凿山 11.5027823792
+五百万镑 12.8020653633
+商王 10.1630080337
+伏公府 13.2075304714
+留笔 13.900677652
+与其 6.93654203956
+王导之 12.8020653633
+鄂托克旗 11.3357282945
+食物链 9.93038573842
+工频 10.9049453784
+该禁 12.1089181827
+势在必得 11.9547675029
+凑上去 10.533381822
+戴黄巾 13.2075304714
+中国国家队 13.2075304714
+为国增光 13.2075304714
+脱榫 13.900677652
+怒江州 13.2075304714
+奠基石 13.900677652
+吴景略 12.8020653633
+快球 12.8020653633
+演技派 12.8020653633
+接合孢子 11.7034530746
+奥恩布 13.2075304714
+油槽 13.2075304714
+跨国公司 8.65365357982
+魂归 11.598092559
+向监国 12.8020653633
+龙树著 13.2075304714
+褚师 13.900677652
+钢芯 12.5143832909
+缺失 8.47572763449
+基准日 10.0088573539
+菜饼 12.5143832909
+积体电路 13.900677652
+朱顶 12.8020653633
+云飞扬 13.900677652
+攻其无备 11.7034530746
+凸透镜 10.4994802703
+想像中 10.4994802703
+真情流露 11.9547675029
+万金油 12.5143832909
+奥利瓦 13.900677652
+要项 13.900677652
+看电视 9.19114745066
+尉迟乐 13.2075304714
+太委屈 12.2912397395
+天女散花 11.3357282945
+白兰瓜 11.1926274509
+平板显示器 11.7034530746
+油气分离 13.900677652
+弄粉调朱 13.900677652
+月光如水 11.3357282945
+斗争史 11.7034530746
+妥切 13.900677652
+走上 6.96239316796
+红狐狸 12.2912397395
+二十块 10.2117981979
+良好信誉 12.8020653633
+纳布勒 13.900677652
+陶菲克 12.1089181827
+教育方针 10.9049453784
+看来看去 11.4157710022
+颟顸 11.598092559
+陈庆瑜 13.900677652
+塔鲁克 13.900677652
+脱模 13.2075304714
+整行 13.2075304714
+红茵兰 13.900677652
+河均发源 12.5143832909
+十二亿三百八十二万余两 13.2075304714
+情感高涨 13.900677652
+棚顶 11.5027823792
+闵行镇 12.8020653633
+彼时 8.9102450652
+迁往 8.45394028031
+东安县 13.2075304714
+琴颈 11.8212361103
+自不待言 11.3357282945
+诺诺 11.3357282945
+甲壳类 9.74179456862
+迁徙 8.03704647638
+下图 10.1394775363
+小箱 11.598092559
+唱曲 9.89334446674
+旧村 13.900677652
+天文钟 12.2912397395
+张湾 13.2075304714
+银碗盛 13.2075304714
+十几片 12.2912397395
+缺如 11.1926274509
+两头尖 12.5143832909
+施工者 13.2075304714
+该站 11.3357282945
+镀铜 13.2075304714
+下回 9.89334446674
+布莱恩特 12.8020653633
+克拉特 12.5143832909
+原素 13.2075304714
+要领 9.4233408375
+野鼠 10.4994802703
+誊出来 13.900677652
+重点对象 11.3357282945
+诚信为本 11.8212361103
+彼方 12.8020653633
+楚穆王 12.5143832909
+小白脸儿 13.900677652
+底衬 13.900677652
+宣召 10.0940151622
+开罚单 11.7034530746
+反弹球 12.8020653633
+西详初 13.900677652
+击发 9.82314020807
+阿拉伯半岛 8.97342396682
+走人 9.69598503258
+暂短 11.8212361103
+玛鲁神 11.1280889297
+死胎 9.94943393339
+牛家庄 10.0294766411
+敲锣打鼓 10.0940151622
+欲言又止 9.28555713513
+那留斯 12.5143832909
+旧有 9.12999302751
+蜡烛台 13.2075304714
+变价款 13.900677652
+马灵金 13.2075304714
+汪大渊 11.0674643079
+下坠 9.7898037878
+留种 11.9547675029
+书架上 10.3171587135
+扯起来 11.8212361103
+抓阄儿 13.900677652
+马舍尔 13.2075304714
+执照 9.94943393339
+徐禧 13.900677652
+平板电视 10.0505300503
+土壤调查 12.2912397395
+比较显著 12.2912397395
+硝基 10.1630080337
+走低 7.42370528909
+景色宜人 11.0103058941
+温柔乡 11.3357282945
+九百多 12.1089181827
+胡格诺 10.533381822
+华阴县 10.642581114
+苹果汁 11.0674643079
+在校学生 10.3171587135
+马托格罗索 12.2912397395
+徒生 12.5143832909
+要饭 8.98802276624
+奥利根 13.900677652
+盲人瞎马 13.2075304714
+该答 13.900677652
+奉辛比克党 12.5143832909
+心力衰竭 9.48183704418
+油棕 9.96885201925
+徐福 9.62401153296
+凯旋路 11.598092559
+许多星星 13.2075304714
+油梨 12.8020653633
+谓词演算 11.1926274509
+岳乐才 13.2075304714
+玉镯 10.5684731418
+际会风云 12.8020653633
+威逼利诱 11.1926274509
+再次出现 8.89004235788
+暴雨径流 12.5143832909
+野麦 13.2075304714
+祖祖辈辈 10.642581114
+下地 10.4666904475
+上报 7.87965430263
+高血脂 10.3171587135
+意欲 8.63798746307
+产品品种 10.3171587135
+超一流 12.5143832909
+许许多多 8.69119149913
+击剑 10.3743171274
+托马 12.5143832909
+唱机 11.5027823792
+诺言 9.36807815882
+徒留 13.2075304714
+打摆子 11.1926274509
+鹿三扬 13.2075304714
+数学原理 10.5684731418
+单边主义 11.9547675029
+旋毛 11.9547675029
+该笔 9.62401153296
+克拉珀 13.2075304714
+下土 12.1089181827
+唱本 10.604840786
+草草收场 11.5027823792
+涨大 12.2912397395
+脱毒 12.2912397395
+辉钼矿 11.7034530746
+脱毛 11.2616203224
+野鹤 12.2912397395
+邮电通信 11.4157710022
+毛鳞鱼 12.2912397395
+屈光 10.765183436
+条件成熟 9.98865464655
+音位学 12.1089181827
+脉冲幅度 11.7034530746
+走俏 10.6818018271
+油桶 11.1280889297
+侍已非 12.8020653633
+教完 12.8020653633
+油桃 12.5143832909
+龙大渊 12.8020653633
+激进派 10.2117981979
+下城 9.66657114738
+龙华民 12.2912397395
+专利权 9.69598503258
+张其平 13.900677652
+复国主义 10.8561552143
+后父 13.900677652
+黑土地 12.5143832909
+沃尔马 13.2075304714
+油桐 8.67493097826
+人体美 13.2075304714
+女子单打 11.1926274509
+可哀 12.5143832909
+法律汇编 13.900677652
+野鸭 9.7898037878
+包容性 10.6818018271
+刷浆 13.2075304714
+瞿式耜 10.3453295905
+利西泰 13.2075304714
+漫谈 11.1926274509
+该管 11.0103058941
+穆然 12.1089181827
+擅作威福 11.7034530746
+野鸽 11.7034530746
+吴山之 13.2075304714
+掬诚 13.2075304714
+下垂 8.60236028543
+动态 6.71000161764
+二老 10.3743171274
+转败为功 12.2912397395
+大地回春 12.5143832909
+魏人 10.4349417492
+来不及 7.25298927841
+迁延 9.82314020807
+宋干节 12.8020653633
+该算 12.2912397395
+迁建 10.9562386728
+周之会 13.2075304714
+自贼 13.2075304714
+渔歌子 13.2075304714
+屠夫 9.87532596124
+执白 12.1089181827
+太极集团 11.5027823792
+机动队 13.2075304714
+留给 7.73316116109
+广善寺 13.2075304714
+产品出口 8.97342396682
+该类 9.0884932966
+假小子 13.2075304714
+漫话 12.5143832909
+敦煌学 10.3171587135
+唢呐声 11.5027823792
+隆宗门 11.598092559
+合纵连横 12.1089181827
+吐气 11.1926274509
+大分 12.1089181827
+实施方案 9.71102290995
+新笔 12.8020653633
+苏奇科 13.900677652
+李嘉诚 10.4349417492
+埃克巴 13.2075304714
+黑蝇 11.9547675029
+问乾 13.900677652
+漫说 11.4157710022
+入射点 12.5143832909
+朱鹭 11.9547675029
+世界主义 12.2912397395
+朱鹮 11.0103058941
+问上 11.598092559
+问下 12.2912397395
+死者 7.47418919452
+羊三世 13.2075304714
+迎向前去 13.900677652
+切进来 13.900677652
+朱鸟 11.9547675029
+百亿元 9.48183704418
+裁纸 13.2075304714
+基础产业 10.9049453784
+下倾 13.2075304714
+问世 7.72066099832
+耵聍 12.8020653633
+问个 9.35738286971
+乐天知命 12.1089181827
+四六体 13.900677652
+脱水 8.69119149913
+上下班 9.12155415886
+庆亲王 10.765183436
+监测仪器 13.2075304714
+第一代 8.52078029844
+桦川 12.5143832909
+留级 12.2912397395
+十五万英镑 13.2075304714
+第一份 8.27305653829
+脱氢 10.3743171274
+先进人物 11.598092559
+脱氧 11.0103058941
+第一件 8.88339781516
+意气 9.54396882529
+四百斤 11.9547675029
+中山纪念堂 11.598092559
+写生画 13.2075304714
+远房 10.8096351986
+天然气井 12.5143832909
+三十而立 12.2912397395
+积极意义 9.4233408375
+闻香识 13.900677652
+与否 8.170577869
+归奴尔 13.2075304714
+赶驴 11.5027823792
+该系 11.8212361103
+齐王肥 11.8212361103
+东华大学 13.900677652
+缺德 10.3743171274
+绝尘而去 12.1089181827
+柯切布 13.900677652
+节肢动物 9.63799777493
+购车者 10.533381822
+介绍信 9.93038573842
+吴国终 12.8020653633
+自贡 10.0088573539
+巴基斯坦政府 12.5143832909
+文昌鱼 10.7226238216
+水玻璃 12.2912397395
+汉宫春 12.8020653633
+矮矮 11.9547675029
+缺得 13.900677652
+云长军 13.2075304714
+战雷头 12.8020653633
+宋诗钞 12.5143832909
+七仙女 11.598092559
+妨主 12.8020653633
+刘仙洲 12.2912397395
+浊度计 13.900677652
+老健猛 13.2075304714
+第一义 12.5143832909
+骡车 10.9049453784
+涝坝 13.900677652
+吐泻 11.9547675029
+信心危机 13.900677652
+古隆中 12.1089181827
+自负 9.15574552361
+商皆 12.8020653633
+网络共享 13.900677652
+无保留地 12.8020653633
+玄德问 10.5684731418
+敷着 13.2075304714
+孳乳 13.900677652
+有所长 11.9547675029
+油漆 8.63281949291
+购销额 13.2075304714
+问人 10.765183436
+网子 12.1089181827
+记账法 13.900677652
+为民服务 11.598092559
+野餐 11.1280889297
+信息管理系统 11.598092559
+缸子 11.1280889297
+跟踪站 12.2912397395
+婉言谢绝 11.0103058941
+缺席 9.14708746087
+旋涡 8.84443184663
+图案化 11.7034530746
+第一例 10.3171587135
+摩登时代 13.2075304714
+问住 10.4666904475
+碰到困难 13.900677652
+屈光性 13.900677652
+服务厅 12.8020653633
+抗炎药 11.4157710022
+教官 9.46986085313
+贸易国 11.1926274509
+全军尽墨 12.5143832909
+任素 10.8096351986
+眉月 13.900677652
+席子 9.84023464143
+率尔 12.8020653633
+原京汉 13.900677652
+单兵作战 12.1089181827
+老中青 12.5143832909
+紫藤花 12.1089181827
+下元 12.8020653633
+击向 13.900677652
+深棕色 11.0103058941
+从长计议 10.2371160058
+草草收兵 12.8020653633
+旧情 9.93038573842
+共同财产 11.7034530746
+执着 9.00283785202
+油滑 11.1926274509
+炉霍县 13.900677652
+朱鼐 12.8020653633
+显露出来 9.62401153296
+莫斯科州 12.8020653633
+万多颗 12.8020653633
+集水 9.5062284973
+戈罗维 11.8212361103
+朱鼎 11.8212361103
+冬学 12.1089181827
+植村秀 13.2075304714
+冬季 6.70324229788
+冲击波 9.18217878068
+忻城伯 12.8020653633
+倪云 13.2075304714
+倪二 11.598092559
+心理量表 12.8020653633
+幸汉阳 13.2075304714
+三万余户 12.2912397395
+金石为开 13.900677652
+旧恶 13.2075304714
+下凡 10.1394775363
+意淫 11.1280889297
+克己复礼 11.5027823792
+宋两朝 11.598092559
+活页簿 13.900677652
+玉叶溪 11.9547675029
+下出 11.7034530746
+于摩尔 13.900677652
+问俗 13.900677652
+徐缓 10.765183436
+扬一扬 12.1089181827
+留置 11.2616203224
+冬宫 10.9562386728
+生源论 13.900677652
+籍译成 13.2075304714
+士心 12.8020653633
+深潭 10.0088573539
+糖纸 12.1089181827
+承传 11.9547675029
+琼瑶 11.2616203224
+第一位 7.76945116249
+戚氏 13.900677652
+油港 10.9562386728
+背墙 13.900677652
+油渣 11.8212361103
+洪奇沥 11.9547675029
+片面追求 10.4994802703
+狗娃 11.7034530746
+下冲 11.0674643079
+上房 8.08356649201
+冬寒 10.1630080337
+天花病 12.5143832909
+惊骇不已 12.5143832909
+第一零七回 13.2075304714
+评析 12.1089181827
+旧怨 11.3357282945
+足球宝贝 13.900677652
+树大根深 12.1089181827
+日语翻译 13.900677652
+胸椎 11.1926274509
+观光型 13.2075304714
+切宜 11.598092559
+问侯 12.8020653633
+乔清秀 12.2912397395
+矿泉水 9.24671730182
+印纹陶 11.9547675029
+下册 11.4157710022
+人口老龄化 10.642581114
+艺人名 13.900677652
+韩忠彦 12.8020653633
+倪三 10.604840786
+脱涩 13.900677652
+小萌 12.8020653633
+惊变 12.8020653633
+心连心 11.598092559
+浮华世界 12.5143832909
+厉王死 11.9547675029
+下剩 11.8212361103
+惊受 13.900677652
+销售者 11.2616203224
+歌赋 13.900677652
+丘巴良 12.8020653633
+骗下去 13.900677652
+连影儿 12.2912397395
+戈雷岛 12.1089181827
+标准分 13.900677652
+防治所 13.900677652
+随身携带 9.5186510173
+吐温 10.604840786
+谢绝 9.58318953844
+王炎午 13.900677652
+惊叹 8.69119149913
+信言不美 13.900677652
+皮夹 11.5027823792
+串门子 12.5143832909
+面折廷争 13.2075304714
+地峡 9.66657114738
+十几盆 12.5143832909
+新疆师范大学 13.2075304714
+气到 13.900677652
+香叶醇 11.7034530746
+惊叫 8.63281949291
+完熟 12.8020653633
+伊凡诺夫 11.7034530746
+乔卢奥 13.900677652
+安仁镇 13.900677652
+懒洋洋 9.48183704418
+加强筋 12.8020653633
+心仪 10.5684731418
+不得违误 12.8020653633
+时中 9.45802639549
+计时工资 10.8096351986
+下到 8.85725253506
+革委会 9.20019728618
+与国 11.4157710022
+曹辅 12.8020653633
+战略轰炸 11.5027823792
+天高地 11.3357282945
+油液 12.8020653633
+巡礼 10.7226238216
+唱戏 8.90346537821
+周礼六 13.2075304714
+下刀 11.7034530746
+下切 9.98865464655
+四万多个 13.900677652
+萧德 13.2075304714
+乌桓号 13.2075304714
+重武器 10.765183436
+时下 8.80081122415
+警服 11.4157710022
+祖鲁人 11.598092559
+医疗站 12.8020653633
+氘核 11.598092559
+下列 7.65845438652
+正气凛然 12.2912397395
+惊厥 9.66657114738
+邓艾取 12.8020653633
+齐王芳 12.5143832909
+豪举 12.1089181827
+时代 5.50633029056
+时令 9.7898037878
+迁安 11.0103058941
+宋沿唐 11.8212361103
+偶然间 12.2912397395
+迁完 13.900677652
+外科病房 12.2912397395
+骗骗 12.2912397395
+任红 12.2912397395
+屠宰 9.33632946051
+债台高筑 10.3171587135
+和皇兄 11.9547675029
+时价 11.9547675029
+时任 8.33233314821
+击垮 10.4666904475
+尹宗浩 12.8020653633
+捱上 13.2075304714
+澳大利亚 6.2405633328
+油流 12.1089181827
+该组 10.8561552143
+半盏 10.5684731418
+苋科 12.8020653633
+油浆 12.8020653633
+史家谓 12.8020653633
+北方地区 9.43476953332
+捕猎 10.0720362555
+贸易商 8.91707103027
+普拉西 12.1089181827
+固定器 12.2912397395
+盖瓦尔 12.2912397395
+缸外 13.900677652
+环境宽松 12.1089181827
+凿井机 13.900677652
+布军裤 13.2075304714
+时亨 10.9049453784
+该约 11.8212361103
+接风酒 11.8212361103
+七上八落 13.2075304714
+失宜 12.1089181827
+多亿美元 10.1630080337
+下劲 13.2075304714
+该线 10.4994802703
+野鬼 12.1089181827
+演艺事业 12.2912397395
+发行部 10.2371160058
+时人 8.99540287354
+哀鸣 10.604840786
+曼殊 11.7034530746
+昌里 13.2075304714
+时事 8.89004235788
+耍手艺 12.8020653633
+借风使船 13.900677652
+合江县 12.8020653633
+下力 11.3357282945
+杯葛 13.900677652
+硬着头皮 8.79473217808
+一九八三年 12.5143832909
+冬夏 9.89334446674
+三万多两 12.5143832909
+油泥 12.1089181827
+紫禁城 7.83689244329
+汲古阁本 13.900677652
+滑下去 11.7034530746
+大堰川 13.900677652
+扇动翅膀 13.900677652
+郭淮闻 12.8020653633
+下卷 9.62401153296
+织女星 10.533381822
+准尉 11.4157710022
+将伯之助 13.900677652
+冬夜 10.4349417492
+商界 9.5062284973
+个人保险 13.2075304714
+该署 12.8020653633
+周刊 7.64877376881
+封电子邮件 11.8212361103
+套交情 13.900677652
+百泉 11.4157710022
+可选性 12.5143832909
+下半 11.8212361103
+下午 5.96939289045
+办事效率 11.3357282945
+闻名世界 10.2630914922
+冬天 7.102737239
+楞严经 11.1926274509
+埋首 11.8212361103
+下单 10.4349417492
+好多遍 12.2912397395
+讲演稿 13.2075304714
+播音室 12.8020653633
+陆地区 12.8020653633
+缺少 7.0254455647
+马形铜 13.2075304714
+俄共 10.6818018271
+散热量 11.9547675029
+梁丘氏 13.2075304714
+向丹湖 12.8020653633
+包罗宏 13.2075304714
+服毒 10.765183436
+油油 13.2075304714
+手模 13.2075304714
+能动性 9.84023464143
+愤然 9.89334446674
+下区 11.9547675029
+镇中 11.9547675029
+脱漏 11.598092559
+基本功 10.1394775363
+昌遂 13.2075304714
+乌戎潘 12.5143832909
+千利体 12.1089181827
+微软中国公司 12.5143832909
+汤用彤 11.8212361103
+芮城县 11.5027823792
+惊动 7.78699547214
+苹果树 10.7226238216
+商用 8.64318227995
+时会 8.55834340001
+糖类 9.13850371718
+迅即 9.94943393339
+电吹风 11.7034530746
+下口 10.4994802703
+一锭 10.0294766411
+张万年 12.5143832909
+八十六所 13.2075304714
+野马 9.40086798165
+中国和平统一促进会 13.2075304714
+下句 11.3357282945
+油污 10.7226238216
+糖粉 11.598092559
+刘映花 12.8020653633
+漫衍 13.2075304714
+附去 13.900677652
+仰着 9.58318953844
+下台 8.82550383674
+特药 13.2075304714
+下叶 11.1926274509
+不要紧 8.30969067146
+存储设备 11.598092559
+少废话 11.5027823792
+野驴 9.96885201925
+连幺妹 13.2075304714
+高位沼泽 12.1089181827
+上扬 6.58812415387
+官僚化 12.8020653633
+十篇 11.7034530746
+沈燮均 13.2075304714
+松形鹤骨 13.900677652
+油汀 11.598092559
+时俊 12.8020653633
+下发 7.73736284794
+念兹在兹 12.8020653633
+豪伊 12.8020653633
+昌邑 11.2616203224
+整日价 11.8212361103
+糖精 11.0674643079
+阿尔卑斯山 9.46986085313
+旧房 10.6818018271
+找上门来 9.69598503258
+下厨 10.9562386728
+飞沫传染 13.900677652
+时侯 10.642581114
+基尔库克 11.9547675029
+俄军 8.94485059437
+糖糖 13.900677652
+下去 5.58854254433
+昌都 10.5684731418
+油水 9.54396882529
+西涅克 12.5143832909
+评断 11.7034530746
+一语不发 11.0103058941
+下压 10.1394775363
+区位码 13.900677652
+发行量 8.07763175649
+耐热性 10.3743171274
+旧戏 12.2912397395
+天礼伯 12.1089181827
+污染环境 10.1394775363
+刘宋时 11.4157710022
+油气 8.3555002075
+路环岛 11.8212361103
+何杰金 12.8020653633
+永享 12.5143832909
+依法办事 10.7226238216
+张顺见 12.5143832909
+赖于 12.2912397395
+朝会 9.94943393339
+赤身裸体 10.2117981979
+下山 7.64301006409
+专业课 12.1089181827
+二百四十家 12.8020653633
+离恨 11.3357282945
+野间 12.2912397395
+测距仪 10.604840786
+野营地 13.2075304714
+下层 8.14493543839
+多斗 12.5143832909
+奥利维 11.9547675029
+赶集 9.48183704418
+完美 7.50042020667
+下届 11.3357282945
+东坑 13.900677652
+工程浩大 11.1280889297
+氮尿嘧啶 13.900677652
+大只 12.2912397395
+放风声 13.900677652
+图谋不轨 11.1280889297
+玛鲁王 11.1926274509
+磷酸二酯 11.9547675029
+下属 7.5871296057
+克莱奥梅 12.2912397395
+抢救性 11.7034530746
+站上 7.92941581219
+心肠硬 12.2912397395
+走远路 12.2912397395
+宋元港 13.2075304714
+老工人 9.5062284973
+裁缝店 13.2075304714
+多斯 10.4666904475
+官方人士 13.2075304714
+九十六期 13.2075304714
+分得出 13.900677652
+于基质 12.1089181827
+商税 10.2371160058
+八十一斤 12.5143832909
+能量棒 13.900677652
+药瓶子 13.900677652
+站个 13.2075304714
+赖以 9.21854642485
+二亿二千八百六十三万元 13.2075304714
+永仁 13.2075304714
+坂垣征 13.2075304714
+鹰眼 10.3171587135
+多斤 11.1280889297
+意思 5.80843824525
+蒙塞拉 13.2075304714
+应归政 13.2075304714
+晋察冀边区 11.0103058941
+升上来 11.2616203224
+瓦卢瓦 11.5027823792
+意兴阑珊 12.8020653633
+妇联 10.604840786
+唱法 10.604840786
+迁善 13.900677652
+永中 12.2912397395
+概貌 10.4041700905
+名歌手 12.8020653633
+促退 13.900677652
+凸凹不平 11.8212361103
+上辈子 11.2616203224
+整根 12.2912397395
+金明池 10.3171587135
+硫化 9.41204128224
+弘远 13.900677652
+田律 11.9547675029
+轻于鸿毛 11.8212361103
+永丰 10.0940151622
+促进会 9.7898037878
+意想 11.5027823792
+汤水 9.89334446674
+皮库 13.2075304714
+不予认定 13.900677652
+维诺克拉 13.900677652
+永不 8.36334338496
+一百多公里 12.2912397395
+奖励制度 12.2912397395
+骗钱 11.4157710022
+遣兴 11.8212361103
+永世 10.1871055853
+看帖 12.8020653633
+确有 7.99804431857
+托里 11.0103058941
+播音员 10.4349417492
+汞齐 10.642581114
+硫华 12.8020653633
+缺口 7.22233553732
+光阴荏苒 11.4157710022
+裁缝师 13.900677652
+薛赞 13.2075304714
+慷慨 8.15447446144
+逢见 13.900677652
+兴山县 11.3357282945
+后燕太子 13.2075304714
+茫茫 8.27305653829
+雷亚尔 11.0103058941
+门禁系统 12.5143832909
+放映队 12.8020653633
+话语权 8.51618258919
+永久 7.97642185456
+删削 11.9547675029
+下岗 9.63799777493
+输水管线 12.8020653633
+山高皇帝远 11.7034530746
+永乐 7.82993992397
+机警过人 13.900677652
+杨端 12.1089181827
+门人 9.46986085313
+站位 11.5027823792
+站住 7.70627226087
+裴度自 13.2075304714
+溴化铅 13.900677652
+朝东 10.533381822
+胸无 13.2075304714
+总动员 10.0088573539
+青阳镇 12.2912397395
+习非成是 13.900677652
+缺刻 10.5684731418
+细枝状 13.900677652
+牙牙学语 13.900677652
+笑出眼泪 13.900677652
+朝下 10.1394775363
+朝上 9.48183704418
+李宇春 11.2616203224
+旧法 10.7226238216
+思维能力 10.4666904475
+冬至节 12.5143832909
+非人工 13.900677652
+十几种 10.2897597393
+负氧离子 12.5143832909
+美众议院 12.5143832909
+梁师傅 13.2075304714
+十几秒 12.1089181827
+霖生 13.900677652
+蓝细菌 11.9547675029
+汪静之 13.2075304714
+湘水 11.1926274509
+首善之区 12.8020653633
+俄式 10.9049453784
+永修 12.1089181827
+并行程序 13.2075304714
+氟脲嘧啶 12.8020653633
+峭立 12.8020653633
+速递 10.4349417492
+意愿 7.24010250214
+泻下 10.5684731418
+湘江 8.99540287354
+冶金学家 11.5027823792
+协办人 13.2075304714
+出口率 11.9547675029
+宿舍区 10.1630080337
+英民 11.8212361103
+负片 13.900677652
+尼斯顿 13.900677652
+松滋县 13.900677652
+离愁 11.4157710022
+明振江 13.2075304714
+完结 9.46986085313
+纳税钱 12.5143832909
+从冥殿 13.2075304714
+聊以解嘲 13.900677652
+硫分 11.8212361103
+下工 11.4157710022
+一九五四年 12.5143832909
+耍风 13.900677652
+屈子 12.5143832909
+捱了 11.5027823792
+国宣劳 12.8020653633
+广宁门 11.5027823792
+檐柱 11.1280889297
+下巴 8.18036587537
+酱肉 11.9547675029
+慕容燕 13.900677652
+评比 9.94943393339
+真确 11.4157710022
+攀升 6.99492437566
+冲击性 11.598092559
+大慈法王 11.5027823792
+章回体 13.2075304714
+张竹 13.2075304714
+门上 8.00627481771
+安全补丁 13.900677652
+行军床 11.0103058941
+李孝伯 13.2075304714
+任熊 11.8212361103
+门丁 11.7034530746
+怕冷 9.82314020807
+下川 12.1089181827
+湘泉 13.900677652
+特工队 12.5143832909
+秋水伊人 13.900677652
+缺勤 12.5143832909
+观光客 13.900677652
+价格指数 8.30225569298
+明文定 13.2075304714
+图灵机 10.7226238216
+油房 13.2075304714
+纯一 12.1089181827
+心乱 11.1280889297
+医药公司 10.2897597393
+高皇后 12.2912397395
+凌驾在 12.5143832909
+确是 8.36334338496
+昌黎 10.642581114
+永佃 13.2075304714
+奥瓦河 13.900677652
+爱好体育 13.900677652
+僭取 13.900677652
+第聂伯 12.2912397395
+朝代 8.43261751084
+公共建筑 10.2630914922
+遗骸 9.56994431169
+解剖刀 13.2075304714
+蓟素 13.900677652
+炭粉 13.900677652
+肢体冲突 12.8020653633
+打浆机 13.2075304714
+商量研究 13.900677652
+上旋 12.8020653633
+一亿多美元 13.900677652
+诚笃 12.8020653633
+灯苗 13.900677652
+要道 8.83808261895
+临危授命 12.2912397395
+旧时代 11.3357282945
+卵细胞 10.2371160058
+暂缓 8.49350588052
+屠场 11.7034530746
+脱手 10.0294766411
+温莎 11.0103058941
+惊心 10.3171587135
+机密信息 12.5143832909
+重装备 11.7034530746
+路子走 11.9547675029
+早班车 13.900677652
+确无 12.8020653633
+该片 9.43476953332
+伏尔肯 13.900677652
+三百五十四部 13.2075304714
+红领巾 10.4041700905
+水刷石 13.2075304714
+暖色 11.7034530746
+田忌 12.1089181827
+镜光 13.2075304714
+入射线 11.9547675029
+暂缺 13.2075304714
+稀落 11.3357282945
+咬字清晰 13.900677652
+迁址 10.8561552143
+邓艾引 11.8212361103
+型飞机 9.80633308975
+桦叶 13.900677652
+古典建筑 11.4157710022
+溪头 12.8020653633
+惊得 8.35160156708
+恐难 9.98865464655
+宜良县 13.900677652
+新技能 12.8020653633
+钢产量 9.06439574502
+八八年 13.2075304714
+遇祸 13.900677652
+吉尔吉斯共和国 12.5143832909
+龚老爷 13.2075304714
+单廷便 13.900677652
+喀麦隆共和国 13.2075304714
+红顶商人 12.8020653633
+生物物理 11.9547675029
+迁坟 11.9547675029
+直去 11.2616203224
+天摇地动 11.3357282945
+下市 12.5143832909
+落实到户 13.900677652
+湘潭 9.40086798165
+唱游 13.900677652
+杨三人 11.3357282945
+申请书 9.53122979951
+留点 10.4349417492
+战术轰炸 13.2075304714
+小郑 12.2912397395
+安全设备 11.3357282945
+假报 12.5143832909
+扎堆儿 11.3357282945
+恣肆汪洋 13.900677652
+温冰川 13.900677652
+赤壁大战 13.2075304714
+恶化趋势 12.2912397395
+一字之差 11.9547675029
+腾空 9.29550746599
+吆五喝六 11.3357282945
+格万杜 13.2075304714
+大染缸 11.9547675029
+出卖灵魂 12.2912397395
+胃脏 13.900677652
+红带子 12.2912397395
+外贸生意 13.900677652
+枣花 12.2912397395
+满园春色 12.1089181827
+两年 5.94385052989
+上街区 11.1926274509
+阿舅 11.5027823792
+创意曲 12.1089181827
+彩信 12.2912397395
+王从道 12.8020653633
+卡门青 13.900677652
+传道士 12.8020653633
+申请人 9.29550746599
+魔幻现实主义 11.7034530746
+溃乱 11.4157710022
+曹永祥 10.604840786
+青岛碱业 12.1089181827
+国家森林公园 11.0674643079
+玉皇大帝 10.0940151622
+车辐 13.900677652
+下座 11.7034530746
+末段 10.2117981979
+自载 13.900677652
+五大连池 10.2897597393
+酱菜 10.4994802703
+塞诺语 13.2075304714
+魏藻 13.2075304714
+象头 12.5143832909
+李攀龙 11.5027823792
+惊异 8.31718134319
+车辕 10.765183436
+国际法庭 11.8212361103
+皮质醇 11.3357282945
+狼图腾 13.900677652
+番杏科 13.2075304714
+艾米丽 13.900677652
+桦南 12.2912397395
+下床 9.34680076038
+屠城 10.765183436
+员工 7.14723973338
+孙督师 13.2075304714
+下底 12.2912397395
+车辙 9.69598503258
+切纸 13.900677652
+都市生活 11.1280889297
+暂缓执行 11.1280889297
+分离 6.6722892004
+操作命令 12.8020653633
+任苏松 13.900677652
+完粮 12.5143832909
+鸡蛋花 11.8212361103
+阁外 12.5143832909
+鄙见 12.5143832909
+格式文件 13.900677652
+象声 13.2075304714
+居功至伟 12.5143832909
+李光弼 10.8096351986
+类比推理 11.8212361103
+哈伊马角 12.8020653633
+沈阳站 12.2912397395
+枣茶 12.2912397395
+杭爱省 12.5143832909
+李时英 13.2075304714
+时来运转 11.2616203224
+野雁 12.1089181827
+铣铁 13.900677652
+十几篇 12.2912397395
+竹箩 13.2075304714
+十数两 13.2075304714
+冯保自 13.2075304714
+周润发 10.1394775363
+血脉相连 12.5143832909
+纯笃 13.900677652
+于甜 11.598092559
+青眼 11.2616203224
+绣墩草 13.900677652
+一人之下 11.3357282945
+特钢 9.56994431169
+小红花 12.5143832909
+下弦 11.8212361103
+普拉蒂 11.2616203224
+执礼 12.2912397395
+忽起忽落 12.2912397395
+刘松山 12.8020653633
+北洞山 13.2075304714
+腕部 11.1280889297
+淮北市 11.5027823792
+正则系综 12.5143832909
+韵腹 13.2075304714
+绝对速度 13.2075304714
+端绪 13.900677652
+李欣欣 13.900677652
+干柴烈火 12.5143832909
+管琰 13.2075304714
+意指 10.4349417492
+铮铮的 11.9547675029
+商社 10.1164880181
+异丙苯 11.598092559
+搔着痒处 13.900677652
+于修礼 12.8020653633
+华化考 12.5143832909
+苦味酸 10.9562386728
+强己益 13.2075304714
+尾标 13.900677652
+腼颜 13.2075304714
+该班 11.7034530746
+商科 11.7034530746
+徐然 12.5143832909
+稀薄 9.14708746087
+连修园子 13.900677652
+通商条约 11.1926274509
+徐院长 9.20932976975
+高陵县 12.2912397395
+一两月 12.5143832909
+闾巷 11.8212361103
+宰孔去 13.2075304714
+陆鸿渐 12.1089181827
+具体办法 10.3171587135
+空间通信 12.5143832909
+阴皇后 13.900677652
+舞蹈病 11.598092559
+暂约 13.900677652
+摇了一下 12.1089181827
+喧扰 13.2075304714
+恐非 10.8561552143
+马关条约 9.6811699468
+拉丘兹 12.2912397395
+酃县 11.598092559
+米勒 9.65218240993
+小兔子 10.9049453784
+大千 11.8212361103
+吐掉 12.1089181827
+棚里 9.85762638414
+海绵体 11.1926274509
+江阴人 11.7034530746
+香榭丽舍大街 12.5143832909
+可口可乐公司 11.0674643079
+油性 10.0720362555
+旧游 12.5143832909
+乌兰浩特市 12.1089181827
+储蓄卡 11.8212361103
+周勃 10.4349417492
+脱掉 9.12155415886
+以免费 12.5143832909
+迁回 9.54396882529
+干粮袋 11.598092559
+胸有 10.8561552143
+市消委会 12.5143832909
+惆然 13.900677652
+航海日志 12.1089181827
+管理 4.67426709982
+周勇 13.2075304714
+穆眯兄 13.2075304714
+概述 8.5488195185
+巴拉蒂 12.8020653633
+电导体 12.8020653633
+纪元后 13.2075304714
+吉尔伯特 10.6818018271
+愈甚 11.5027823792
+戚族 13.900677652
+和济尔 12.2912397395
+链长 13.900677652
+瞧着办 11.8212361103
+期于 11.9547675029
+彼此 6.8367736905
+胡太明 13.900677652
+朱陆 12.5143832909
+真武帝 12.2912397395
+模棱两可 10.0088573539
+畅通无阻 10.1630080337
+第三世界科学院 10.642581114
+且不说 9.08039608637
+同明叔 12.8020653633
+木伦河 9.93038573842
+死路一条 10.2117981979
+张冠英 12.1089181827
+每分钟 8.87679713113
+城建监察 12.2912397395
+重感冒 11.7034530746
+云台山 9.91169360541
+劳动报 12.5143832909
+贾存 12.8020653633
+革命斗争 9.20932976975
+竿头 13.900677652
+翩然而至 13.900677652
+串门儿 12.1089181827
+硅化物 12.5143832909
+固定岗 13.900677652
+畅销品 12.1089181827
+恶骂 12.5143832909
+死去活来 9.65218240993
+上灵宝 13.2075304714
+阴山背后 12.8020653633
+三十元 11.598092559
+链锯 12.5143832909
+天下大治 12.1089181827
+罗戈夫 13.900677652
+象征 7.29808975979
+下堂 10.9562386728
+迁入 8.7245279194
+犹太主义 11.7034530746
+封诸吕 11.9547675029
+期价 8.14493543839
+徐盛 10.2630914922
+李廷松 12.8020653633
+涡河 10.8096351986
+府邸 9.36807815882
+家政学 13.2075304714
+美式英语 13.900677652
+抽象数据类型 13.2075304714
+托长 13.900677652
+如龙似虎 13.900677652
+十几粒 12.5143832909
+硫基 12.2912397395
+一路神祇 13.900677652
+乌玛达 12.8020653633
+贫困村 12.5143832909
+象形 9.96885201925
+驶来 10.1630080337
+油条 10.3453295905
+旧楼 12.1089181827
+张宗琪 9.25628675283
+红色政权 11.4157710022
+救济金 10.8561552143
+未批准 12.5143832909
+朱雀 9.61021821083
+口诛笔伐 10.9562386728
+天花粉 12.1089181827
+虎落平阳 11.4157710022
+席勒 9.94943393339
+十几米 9.61021821083
+惊奇 7.92941581219
+油杉 11.1926274509
+绊倒 9.98865464655
+看不过眼 11.4157710022
+首班车 13.2075304714
+高曼寺 12.8020653633
+期中 10.2897597393
+留白 13.2075304714
+浑身解数 10.765183436
+酸蓄电池 10.5684731418
+北大人民医院 12.5143832909
+执绋 13.2075304714
+叶子烟 12.2912397395
+暂离 11.3357282945
+施耐德 13.2075304714
+平面磨床 12.5143832909
+松嘴 13.900677652
+漆液 12.5143832909
+尔伯爵 11.3357282945
+百慕大群岛 11.1280889297
+学习性 13.900677652
+回归祖国 11.2616203224
+一鸣惊人 10.8096351986
+花药培养 13.900677652
+要隘 10.765183436
+游手 13.2075304714
+执纪 12.8020653633
+春之声 13.2075304714
+商纳 13.2075304714
+略有 7.26999426633
+凯利 10.8561552143
+图形处理 12.2912397395
+外加剂 12.1089181827
+胸怀 9.27570483869
+青弋江 11.2616203224
+匪帮 12.1089181827
+储蓄员 13.900677652
+相国掌 13.2075304714
+商纣 11.9547675029
+惊天 9.91169360541
+商约 11.4157710022
+学生自治 12.1089181827
+葛攀藤 12.8020653633
+迁出 10.1164880181
+雷横守 13.2075304714
+解剖图 12.8020653633
+任由 9.59661255877
+孟加拉人民共和国 12.8020653633
+经手费 12.8020653633
+离散 9.01787572939
+戈列曼 13.900677652
+下奶 13.2075304714
+任用 8.230796729
+系统疾病 10.9049453784
+脱敏 11.3357282945
+波斯湾地区 11.8212361103
+穆斯林族 13.900677652
+惊声 11.9547675029
+执罚 13.2075304714
+靴底 12.5143832909
+抿住 12.1089181827
+此约 11.1280889297
+席卷 8.70772080109
+刻骨相思 13.900677652
+精神实质 11.5027823792
+数学课 11.8212361103
+徐石 10.0940151622
+该用 10.4994802703
+湘桂 9.72629038208
+昌马 12.5143832909
+香火 8.86372504956
+燠热 11.4157710022
+伯恩施坦 11.0674643079
+贾家 10.1394775363
+姜姓族 13.2075304714
+下头 9.43476953332
+交往甚密 11.1926274509
+永春县 12.2912397395
+花信灯 12.1089181827
+莫悟奇 13.2075304714
+庐山管理局 13.900677652
+石秀推 13.2075304714
+振动模式 12.5143832909
+多尔衮 7.34959731693
+工业统计 13.900677652
+高迎样 11.9547675029
+下处 9.61021821083
+贮存期 12.1089181827
+贪图安逸 12.5143832909
+对於 12.1089181827
+贾宪 12.5143832909
+合作经营 11.598092559
+势倾朝野 12.1089181827
+呐喊 8.09554268306
+纵谷区 12.5143832909
+概要 9.98865464655
+永保青春 13.900677652
+意旨 10.0720362555
+留着 8.49350588052
+促销 8.0484751722
+蒙古政府 12.1089181827
+饶有趣味 13.2075304714
+广交会 9.56994431169
+巴斯贝克 12.8020653633
+不可枚举 13.900677652
+象年 13.2075304714
+上半部 10.5684731418
+完稿 11.0674643079
+测定器 12.5143832909
+或非 9.37888907493
+白兰 10.604840786
+完税 10.642581114
+原始社会 8.52078029844
+曹太公 11.3357282945
+受了伤 9.91169360541
+千万重 13.2075304714
+韦孝宽 12.5143832909
+城市布局 10.6818018271
+纪元前 11.9547675029
+售票机 12.8020653633
+托钵 11.4157710022
+冲击摆 12.8020653633
+施耐庵 11.0103058941
+赵南星 11.9547675029
+概观 11.7034530746
+十姊妹 12.8020653633
+西山碧云 12.5143832909
+黄文烨 12.5143832909
+轻松感 12.5143832909
+概览 10.9049453784
+橱柜 10.642581114
+陆先生 10.4666904475
+略显 8.56795885871
+魏拯民 12.8020653633
+香灰 11.9547675029
+商羊 13.900677652
+王悦之 12.8020653633
+猎头公司 11.5027823792
+屈强 13.900677652
+发审委 8.87023973058
+又惊又喜 9.62401153296
+鸿雁传书 13.900677652
+东躲西藏 11.2616203224
+穆赫塔尔 11.9547675029
+双城 10.9562386728
+法鲁克 11.5027823792
+商群 13.900677652
+意料 8.74162235276
+邓茂 13.900677652
+鹰犬 10.4041700905
+徐兴业 12.8020653633
+氟橡胶 12.5143832909
+痉挛 8.4801426527
+周公 8.9102450652
+神农庙 13.900677652
+抛锚 10.765183436
+竹帘子 12.5143832909
+差速 11.1926274509
+逼上去 13.900677652
+宁波港 11.3357282945
+停薪留职 13.900677652
+炒黄豆 12.8020653633
+入射窗 13.900677652
+张顺进 13.900677652
+白公 12.2912397395
+滹沱 11.4157710022
+担惊受怕 10.1871055853
+心伤 12.8020653633
+员外 9.48183704418
+低人一等 12.1089181827
+刑部侍郎 11.0103058941
+框住 13.900677652
+一两周 13.2075304714
+红四方面军 10.3453295905
+拉希德 11.2616203224
+徐璜 12.8020653633
+缸内 10.7226238216
+甲胺磷 11.8212361103
+刘宋永 12.5143832909
+逆料 11.4157710022
+干活儿 10.2371160058
+象州 11.4157710022
+迁升 11.1280889297
+白兔 10.4994802703
+肥肥大大 13.900677652
+几经反复 12.1089181827
+动物学家 10.1394775363
+爱屋及乌 11.5027823792
+略施 11.4157710022
+和俊山 12.5143832909
+邓肯 10.9049453784
+固定床 13.2075304714
+死苗 13.2075304714
+万重山 12.8020653633
+铲下 12.8020653633
+同明军 12.5143832909
+折箭 13.2075304714
+大专生 12.5143832909
+油料 8.53938548627
+德奎利亚尔 12.1089181827
+徐日升 11.7034530746
+托鞋 13.900677652
+那树洞 13.2075304714
+树脂漆 13.900677652
+鼎湖山 10.9562386728
+清扫车 12.8020653633
+小甜甜 12.1089181827
+社会财富 9.4233408375
+减轻处分 13.900677652
+作记号 13.2075304714
+造就人才 13.2075304714
+宋沈括 13.2075304714
+驮子 11.3357282945
+草坝 13.2075304714
+闭环控制 11.598092559
+五彩斑斓 11.0103058941
+屈居 10.4041700905
+帝丞相 12.8020653633
+维奥拉 13.900677652
+下嫁 10.765183436
+发行额 10.4994802703
+评注 10.9049453784
+炮竹 13.2075304714
+脚制动器 13.900677652
+冬储 10.9049453784
+小人书 11.9547675029
+丹吉尔 11.0103058941
+统一标准 10.5684731418
+亚马逊河 12.2912397395
+衡阳人 12.5143832909
+李密势 12.8020653633
+迁去 12.1089181827
+印刷版 13.900677652
+赶造 12.8020653633
+食草兽 13.900677652
+苟合取容 13.900677652
+海隆 11.4157710022
+文昌阁 11.4157710022
+五十元 10.4041700905
+徐瑾 12.8020653633
+屈尊 10.5684731418
+旅游热线 13.900677652
+沃尔霍 12.8020653633
+重庆路 12.8020653633
+第三产业 8.73589167805
+杜甫仁科 13.2075304714
+老虎沟 13.2075304714
+破镜重圆 11.5027823792
+拜火教 11.5027823792
+徐瑛 13.900677652
+一饮而尽 9.10488710638
+金门县 11.7034530746
+连接成 10.4041700905
+要钱 8.83808261895
+迁台 12.8020653633
+惊喜欲狂 13.2075304714
+来访者 10.9562386728
+系缚 13.2075304714
+竭虑 12.8020653633
+宣令官 13.2075304714
+下季 12.1089181827
+陈眉抱 12.5143832909
+仲裁庭 11.1280889297
+评测 8.46695564842
+徐疾 13.2075304714
+布思端 13.2075304714
+逆施 13.900677652
+尔塞 13.900677652
+燃香 12.2912397395
+和睦相处 10.533381822
+范礼安 13.2075304714
+陈克恢 13.2075304714
+米其林 12.1089181827
+快爬 11.9547675029
+留痕 11.9547675029
+唱歌 8.230796729
+固辞 11.1280889297
+屠刀 10.642581114
+纳耶夫 13.2075304714
+巨细胞 11.0103058941
+六百年 12.2912397395
+益津 11.9547675029
+敷粉 12.8020653633
+苞谷 11.8212361103
+迁到 8.76487921493
+比较支持 13.2075304714
+二百多条 13.900677652
+扼住 10.765183436
+洪文山 12.2912397395
+下存 13.900677652
+储蓄型 12.5143832909
+本无树 13.2075304714
+朱锐 13.2075304714
+白衣战士 12.8020653633
+人口不足 12.1089181827
+反坦克 8.11993413618
+第六十八篇 13.2075304714
+锁线 13.900677652
+任督 12.2912397395
+俄罗斯语 13.2075304714
+风海流 12.5143832909
+汤洗 12.5143832909
+框上 11.8212361103
+框下 13.900677652
+魏学曾 8.69119149913
+十一点七 13.2075304714
+杨子江 11.9547675029
+竹排 11.1280889297
+琼结 12.1089181827
+张顺身 13.2075304714
+龄期 11.5027823792
+汤洒 12.8020653633
+脱机 11.9547675029
+该省 9.63799777493
+质子化 12.8020653633
+美因河 11.1926274509
+穆鲁克 13.2075304714
+爪哇岛 10.0720362555
+天大圣 11.8212361103
+索尔斯 11.8212361103
+肯特郡 11.0103058941
+望而却步 9.93038573842
+佟图赖 12.1089181827
+讲古论今 13.900677652
+谶纬 10.1164880181
+加伊纳 13.900677652
+伦顿 13.2075304714
+象山 10.2630914922
+带不带 13.2075304714
+该矿 10.5684731418
+叶自茎 13.2075304714
+压在心底 12.5143832909
+下寺 11.7034530746
+象屿 10.533381822
+刑释解教 12.8020653633
+赫内斯 13.900677652
+冬冬 11.7034530746
+效果显著 10.604840786
+明大义 11.8212361103
+天文馆 11.2616203224
+贸易局 10.1630080337
+苦练 10.604840786
+百鸟朝凤 12.1089181827
+朱门 11.8212361103
+要闻 9.77354326693
+阿美莉 13.900677652
+概论 9.36807815882
+小盂鼎 12.2912397395
+侦听员 10.4041700905
+几百几百 13.900677652
+代省长 11.9547675029
+行军壶 13.900677652
+人人得而 13.2075304714
+仓容量 12.8020653633
+调脂弄粉 13.900677652
+冬凉 12.5143832909
+愈益 9.56994431169
+李白诗 12.1089181827
+秦先儿 11.9547675029
+二舅 11.3357282945
+下家 10.4041700905
+抄起来 13.2075304714
+碰撞频率 12.1089181827
+孔墨之 12.8020653633
+糖瓜 12.8020653633
+史李森 13.2075304714
+留用 10.6818018271
+离析 12.2912397395
+唱段 10.4994802703
+裴耀卿 11.8212361103
+亲口答应 12.2912397395
+优质棉 11.4157710022
+除权日 12.5143832909
+秋玫瑰 12.8020653633
+概说 11.7034530746
+怨鬼 12.8020653633
+门儿清 13.900677652
+高志航 11.8212361103
+应用领域 9.36807815882
+十九路 10.9049453784
+弛豫 11.2616203224
+下定 9.84023464143
+下官 8.64840422393
+托雷 11.8212361103
+替补 10.6818018271
+习称葱 13.2075304714
+诚意 8.55357012126
+松垮 11.3357282945
+礼节性 11.1280889297
+安闲地 11.9547675029
+仰惟 12.5143832909
+个把位 13.2075304714
+夏完淳 12.1089181827
+脱硅 12.8020653633
+斯世 12.1089181827
+稀巴烂 10.9049453784
+投票选举 11.7034530746
+割股疗亲 13.2075304714
+该案 8.9519177616
+注意安全 10.2371160058
+江茂 11.9547675029
+观摩课 11.9547675029
+旧病 11.0674643079
+杨三哥 13.900677652
+朝圣 9.75754292558
+鱼骨冠 12.5143832909
+脱硫 9.6811699468
+执手 10.8096351986
+廉自中 13.900677652
+鹰潭 10.9562386728
+要言 12.8020653633
+公共行政 11.7034530746
+凌驾于 10.0505300503
+铲倒 13.900677652
+携起手来 11.9547675029
+油管 10.533381822
+邻长 13.900677652
+野趣 11.598092559
+该校 8.16733637508
+氨碱法 12.8020653633
+席下 13.2075304714
+中国新疆地区 11.7034530746
+豪壮 11.0103058941
+豪士 13.2075304714
+油箱 9.01787572939
+管花目 13.2075304714
+加回来 13.900677652
+兵祸 11.3357282945
+欧美各国 9.65218240993
+商户 8.79473217808
+水太凉 12.8020653633
+坪山镇 13.900677652
+岁月如流 13.900677652
+英宗初 13.2075304714
+罗卡角 13.2075304714
+古细菌 12.5143832909
+离心离德 11.0674643079
+工人阶级 8.0484751722
+医界 13.900677652
+黄岛区 13.900677652
+危若安 13.900677652
+合订本 12.5143832909
+期初 10.4666904475
+反华 11.7034530746
+林言椒 13.2075304714
+橱窗 9.96885201925
+酱香 11.9547675029
+丛林战 12.2912397395
+居多数 11.7034530746
+周之宗 13.2075304714
+暖风 9.98865464655
+曲棍球 11.0674643079
+期刊 9.13850371718
+冬云 11.1926274509
+何趣 12.8020653633
+日月潭 10.5684731418
+解放北路 13.900677652
+初步成效 11.598092559
+测距器 12.1089181827
+执拗 9.32596667347
+三天打鱼 11.9547675029
+永嘉 9.31571017331
+桥墩下 13.900677652
+一长 9.54396882529
+麦西来甫 13.2075304714
+沃尔西 13.2075304714
+两关 11.9547675029
+隆德府 12.1089181827
+虫声 13.2075304714
+电子游戏 11.4157710022
+仰承其 13.900677652
+临安县 11.5027823792
+别无分店 13.900677652
+夸父逐日 13.2075304714
+罗湖区 11.7034530746
+宜善防 13.2075304714
+罗弥迦 13.900677652
+母弘吉 12.5143832909
+空校 13.900677652
+倦怠 9.77354326693
+生态园林 13.900677652
+框内 12.5143832909
+无闻 11.2616203224
+条约法 11.5027823792
+四百余卷 13.2075304714
+那尊银 12.2912397395
+变了又变 13.900677652
+流传千古 12.1089181827
+莲花 8.17382990439
+府谷 11.0674643079
+脱碳 12.5143832909
+深表歉意 12.5143832909
+事务性 11.1280889297
+杨家兄弟 13.900677652
+旧生 13.900677652
+减速板 11.4157710022
+碍于 10.3171587135
+碍事 9.49395840471
+倦态 13.900677652
+暂时 6.11912169274
+屯驻 9.71102290995
+饮料包装 13.900677652
+缸体 10.9562386728
+条理化 12.5143832909
+岳钟琪 10.8561552143
+和献忠 11.8212361103
+白雨斋 12.8020653633
+襄城 9.93038573842
+老交情 11.1280889297
+扬一益 13.2075304714
+席位 7.79811905736
+站址 12.5143832909
+异卉奇花 13.900677652
+元旦节 13.900677652
+朗文 13.2075304714
+河北平原 9.4233408375
+该楼 10.533381822
+诺顿 12.1089181827
+眉清目秀 10.2630914922
+各军兵种 11.1926274509
+惹火烧身 12.1089181827
+司农卿 12.2912397395
+全裸照 13.900677652
+骗财 13.2075304714
+赶过 10.2630914922
+骗购 12.5143832909
+中村克己 13.2075304714
+凯勒 11.3357282945
+高性能 8.89673134603
+金属器皿 12.2912397395
+新闻来源 13.900677652
+第一家 8.29487558568
+潇潇洒洒 13.2075304714
+赶进 10.533381822
+徒有 11.1280889297
+红尖椒 12.2912397395
+冷却系统 10.4994802703
+钟粹宫 11.1280889297
+绫绢 11.3357282945
+塞进陈 13.2075304714
+妨害 10.3453295905
+赵哲畏 13.2075304714
+好脾气 11.2616203224
+电源插头 11.9547675029
+峭拔 11.0103058941
+连克嘉 13.2075304714
+凹下去 11.8212361103
+同龄人 10.3453295905
+茫无边际 12.8020653633
+钱风览 12.1089181827
+邓龙 11.4157710022
+永城 10.4349417492
+金湖县 12.8020653633
+周刑统 12.8020653633
+自行解决 12.1089181827
+平头百姓 11.0674643079
+拖下水 11.598092559
+罗密欧 10.2897597393
+尖刀班 13.900677652
+站场 10.8096351986
+雅鲁河 12.5143832909
+另有打算 11.7034530746
+最迟在 11.4157710022
+骗走 11.7034530746
+或许 6.46053097131
+弘阳 13.2075304714
+小家电 10.4666904475
+拉什利 12.8020653633
+徐母 12.2912397395
+要诀 10.3743171274
+永在 12.1089181827
+金枪不倒 12.5143832909
+赶车 9.84023464143
+仰慕 9.53122979951
+野象 11.3357282945
+大做 11.5027823792
+带月披星 13.2075304714
+普斯科夫 12.1089181827
+豪夫 12.5143832909
+苹果绿 12.5143832909
+蒲鲜万 12.2912397395
+蚩尤 10.5684731418
+张顺道 10.9049453784
+司农司 11.598092559
+输入板 12.1089181827
+秦学正 11.598092559
+铲凿 13.900677652
+留步 10.9562386728
+汉俗汉 13.2075304714
+黑盒子 12.8020653633
+装修网 13.900677652
+寓意 9.09665660724
+要说 7.12645376562
+敷成 13.900677652
+清碧如 12.5143832909
+刚肠嫉恶 13.2075304714
+潮落 11.7034530746
+日本航空公司 12.2912397395
+石仲泉 13.900677652
+西苑机场 13.2075304714
+过往人 12.5143832909
+秦夫人 13.900677652
+伍延 13.2075304714
+骡马 8.80081122415
+讲演法 13.900677652
+美若天仙 12.8020653633
+自由振荡 11.8212361103
+湿乎乎 12.1089181827
+中间色律 13.2075304714
+徐步 11.8212361103
+乘隙而入 12.1089181827
+豪奢 11.1280889297
+强度极限 12.5143832909
+老爷爷 10.3743171274
+埃尔门 12.5143832909
+脱离 6.91318740497
+第一季 11.0674643079
+生客 12.1089181827
+狡谲 13.900677652
+华北局 11.7034530746
+侵权行为 10.0940151622
+执掌 8.75901409547
+倦意 10.9562386728
+挖墙角 12.2912397395
+吴国桢 12.5143832909
+铸钢件 12.8020653633
+薅草 12.8020653633
+炮兵阵地 11.3357282945
+流溪河 11.3357282945
+无证据 11.5027823792
+信步而行 13.2075304714
+妒忌心 13.900677652
+诚挚 9.53122979951
+不足与谋 12.8020653633
+略称 11.9547675029
+篮球场 10.7226238216
+见利思义 12.8020653633
+永和 9.5062284973
+自给自足 9.38981814546
+督饬 12.8020653633
+人比人 12.5143832909
+周之太 13.900677652
+宗氏 12.8020653633
+亚诺夫 13.2075304714
+递烟 11.5027823792
+蓖麻子 12.5143832909
+通风机 11.3357282945
+红杉树 13.900677652
+鲁宾逊 12.1089181827
+溃围 12.8020653633
+真真假假 10.4666904475
+菜籽油 9.56994431169
+香草醇 13.2075304714
+经费有限 13.2075304714
+站名 10.9562386728
+外扬 12.2912397395
+莽莽 11.0103058941
+互相交换 9.48183704418
+陈老板 11.8212361103
+阿穆达 13.2075304714
+渔轮 12.2912397395
+铲刀 13.2075304714
+李应听 12.8020653633
+乐尔号 13.900677652
+耙子 11.3357282945
+驶离 10.4041700905
+香草醛 13.2075304714
+喀尔巴阡山 10.9562386728
+俏俏 13.2075304714
+减速时 12.8020653633
+吐穗 13.2075304714
+富裕户 13.2075304714
+细分化 11.4157710022
+鹰派 12.2912397395
+山西人民出版社 12.8020653633
+脱稿 11.3357282945
+化学抛光 13.900677652
+克拉拉 12.5143832909
+孟冬 12.8020653633
+车头灯 13.900677652
+第一声 10.4994802703
+油票 13.900677652
+事务所 7.68407155089
+结集在 12.2912397395
+油饰 13.2075304714
+唱盘 12.5143832909
+迪弗斯 11.7034530746
+第一堂 12.5143832909
+十几批 13.900677652
+莽荡 13.2075304714
+商情 11.4157710022
+命若悬丝 13.900677652
+走廊 7.92941581219
+普勒 12.5143832909
+刹时 12.8020653633
+俄罗斯队 11.7034530746
+永合 11.3357282945
+徐树 11.598092559
+潭柘寺 12.1089181827
+有限元 12.5143832909
+内部噪声 13.900677652
+十几所 11.7034530746
+西弗吉尼亚州 12.2912397395
+安邑 10.533381822
+仰承 12.8020653633
+简短地 11.8212361103
+徐标 13.900677652
+直列 9.84023464143
+互不侵犯条约 10.4041700905
+四孔 13.2075304714
+张嘴说话 11.9547675029
+托词 10.642581114
+反杜林论 11.1926274509
+杨龙友 12.2912397395
+西清古 12.5143832909
+低保户 11.9547675029
+完整 6.46997056943
+天行者 11.9547675029
+马贩子 12.2912397395
+邸前治 13.2075304714
+那克西 11.598092559
+多一刻 12.8020653633
+十几户 11.7034530746
+徐桐 9.74179456862
+留校 9.30555780184
+前站 10.0940151622
+浩茫 13.900677652
+送进去 10.765183436
+进击 9.7898037878
+进不来 11.0103058941
+附加费 9.23723855786
+催化剂 7.84389363875
+统一分配 12.5143832909
+寓所 9.98865464655
+易如反掌 10.8096351986
+捕杀 9.46986085313
+专业部 13.900677652
+朝向 9.30555780184
+反右 11.0674643079
+贵为天子 12.1089181827
+豪宴 12.2912397395
+竟至 10.8561552143
+迁下 13.900677652
+迁上 13.900677652
+赶路 8.65893063692
+科拉松 13.900677652
+朱襄 13.2075304714
+该死 8.25877058104
+删去 10.0720362555
+连栋全 13.2075304714
+期内 8.05135287203
+朝后 10.5684731418
+勃然而起 13.900677652
+豪客 11.7034530746
+期冀 12.1089181827
+于定军 13.900677652
+何格恩 13.2075304714
+国民党员 11.598092559
+有何感想 11.8212361103
+提款权 9.93038573842
+永善 12.1089181827
+走形 11.8212361103
+赶跑 10.3453295905
+确系 11.3357282945
+横向联系 11.8212361103
+问好 9.4233408375
+莽苍 13.900677652
+豪宅 8.65893063692
+傍轴条件 12.1089181827
+野骆驼 11.1926274509
+持有异议 11.4157710022
+盐效应 13.2075304714
+朱褒 12.1089181827
+研磨机 13.900677652
+本科课程 13.900677652
+走开 7.94484028251
+该款 10.1630080337
+祖名为 13.2075304714
+边界条件 10.4349417492
+脚扭伤 13.900677652
+于慎行 11.7034530746
+赶超 10.0720362555
+走强 6.82402383653
+交换意见 10.2371160058
+豪富 10.4666904475
+反反 12.8020653633
+梅利埃 12.8020653633
+八百八味 12.5143832909
+工龄 10.4349417492
+执意 8.68574189437
+两出 10.9562386728
+西米替丁 13.900677652
+促请 12.1089181827
+赶趟 11.8212361103
+要见 8.97342396682
+门吸 12.1089181827
+胸罩 11.0103058941
+嫡传 11.5027823792
+入侵者 9.29550746599
+要览 11.8212361103
+天青石 11.2616203224
+校董 11.8212361103
+赶走 8.43684584695
+俏丽 10.0720362555
+第一夜 11.1926274509
+赶赴 9.45802639549
+直到 5.67812401358
+溃坝 13.2075304714
+赶起 12.5143832909
+下水管 11.5027823792
+苏锡常 12.5143832909
+峭急 13.900677652
+羽绒服 10.3743171274
+乙肝患者 11.1926274509
+情趣内衣 13.2075304714
+第一天 8.22050504296
+千惠子 13.2075304714
+凤翅金 12.5143832909
+印象形成 13.900677652
+身居要职 12.1089181827
+河北地区 10.8096351986
+接合处 13.2075304714
+用人不疑 12.2912397395
+门吏 10.4349417492
+试了试 10.533381822
+三令五申 10.1394775363
+骗过 10.8096351986
+走得 8.1417758781
+时宪 13.2075304714
+大出 9.71102290995
+腾挪 9.62401153296
+上半身 10.0294766411
+腕表 12.5143832909
+诚招 10.9562386728
+新天地 10.1630080337
+三百五十里 13.2075304714
+云丫头 11.8212361103
+军乐团 13.900677652
+连代立 13.2075304714
+犯罪理论 13.900677652
+蜷伏 11.1280889297
+向北 7.95525704337
+无烟煤 9.7898037878
+公理化 10.4994802703
+悉听尊便 11.9547675029
+五百余种 12.8020653633
+鄂西 9.17328983326
+时宜 10.4666904475
+绝缘体 10.3171587135
+内华达 10.4994802703
+饲料粮 13.900677652
+永劫 12.8020653633
+朝北 10.4666904475
+现代医学 9.49395840471
+多枚 10.4349417492
+真有此事 11.8212361103
+常理 8.96620371885
+凯南 13.2075304714
+九百个 13.2075304714
+第二十七回 11.8212361103
+留滞 12.2912397395
+琼斯 9.20932976975
+九百两 12.8020653633
+扒灰 11.8212361103
+时局 8.94485059437
+任民 12.8020653633
+本科生 10.533381822
+黎母 11.9547675029
+第一座 8.81927328699
+时届 13.2075304714
+褒禅山 13.2075304714
+云洞岩 12.8020653633
+法制教育 12.2912397395
+电玩展 13.900677652
+四六开 13.900677652
+中长期 6.90766252904
+任氏 12.2912397395
+基武 11.1926274509
+门厅 10.1871055853
+朝南 10.1871055853
+上林 11.3357282945
+田家镇 12.5143832909
+而非 7.87239913175
+问市 12.2912397395
+抿嘴 9.93038573842
+豪峰 13.900677652
+商星 13.900677652
+襄办 11.4157710022
+中古世纪 13.2075304714
+梁自号 12.8020653633
+门口 6.21589370845
+朝华 9.59661255877
+沙钵略 13.2075304714
+茂名市 11.0103058941
+缺位 9.80633308975
+快完了 11.598092559
+邓骘 12.2912397395
+知恩必报 12.5143832909
+吴国清 13.2075304714
+襄助 11.2616203224
+门户网站 10.1164880181
+课田制 11.0103058941
+公布出来 10.9562386728
+苹婆 12.2912397395
+得失成败 12.5143832909
+负责同志 9.59661255877
+屋子 7.63537643924
+时尚 7.45337178943
+自然概念 13.900677652
+倪征 12.8020653633
+徒手 10.3743171274
+任河 12.2912397395
+永别 10.0720362555
+永利 10.642581114
+门匾 13.2075304714
+省略号 12.2912397395
+内行话 13.900677652
+唐僧径 12.8020653633
+高中政治 13.900677652
+九百亩 11.8212361103
+能源建设 11.2616203224
+秘书科 13.2075304714
+民营事业 13.2075304714
+徐温 11.7034530746
+巴蒂斯特 12.5143832909
+屋宇 10.3171587135
+阿明尼 12.1089181827
+熬起 13.900677652
+豪尔 12.5143832909
+五具 11.8212361103
+施工队 10.3743171274
+肾内科 11.9547675029
+需要的话 11.4157710022
+道歉信 12.5143832909
+莱曼系 13.900677652
+西林水 12.2912397395
+油罐 9.84023464143
+李岩微微 13.900677652
+常务委员会 9.31571017331
+脱粒 10.8561552143
+一甲子六十年 13.2075304714
+抛进 11.0674643079
+之路 7.45654639528
+第一幅 10.7226238216
+八间 12.5143832909
+武当山 9.93038573842
+油缸 10.8096351986
+飞雨 12.2912397395
+势焰熏天 13.900677652
+伦茨 12.1089181827
+第一幕 11.4157710022
+多架 10.2117981979
+双园区 12.8020653633
+宗祖神 12.1089181827
+磋商 8.57280148319
+站务 12.5143832909
+胡敬 13.900677652
+兰陵王 12.1089181827
+第一幢 13.2075304714
+装载机 11.0103058941
+宋妈妈 12.8020653633
+义堂 13.900677652
+清洁机 13.2075304714
+八闽 11.9547675029
+血脉相通 13.2075304714
+劫得 13.900677652
+任泉 10.9562386728
+第一年 9.41204128224
+上架 10.1394775363
+汗背心 13.900677652
+明大哥 12.5143832909
+确立 6.76897914151
+暂态 11.7034530746
+原始部落 11.2616203224
+刘福通 10.4994802703
+糖渍 12.8020653633
+十几日 12.5143832909
+纸币 8.51160592216
+杨羲 13.2075304714
+辫子 8.71329184614
+克拉斯 13.900677652
+桥头镇 11.9547675029
+油绿 13.900677652
+钻进来 10.1630080337
+埋设 10.2117981979
+浑朴 11.2616203224
+执杖 11.8212361103
+十六排 13.2075304714
+南腔北调 11.9547675029
+缺一 11.7034530746
+走好 9.01032852375
+古格王国 11.7034530746
+四年生 13.900677652
+事务时 11.9547675029
+原教旨主义 11.4157710022
+发掘出 9.5186510173
+地玄珠 12.2912397395
+二茬 11.8212361103
+上官俸的 13.2075304714
+镜匣 13.2075304714
+骨肉分离 11.9547675029
+漫骂 13.2075304714
+德力格尔 13.900677652
+关键技术 9.04086524761
+叮当响 11.1926274509
+反倒 7.34959731693
+商朝 9.37888907493
+十几斤 11.4157710022
+美国参谋长联席会议 11.9547675029
+溃军 11.5027823792
+油纸 10.9049453784
+愧领 13.2075304714
+朝前 9.59661255877
+顾秋水 7.36398605438
+吐絮 12.8020653633
+旅游胜地 8.59737274392
+中共三大 12.2912397395
+缺乏 6.13426075396
+阁子 9.61021821083
+偏光片 11.4157710022
+任浚 10.5684731418
+商机 8.93783302172
+吴黄武 11.598092559
+贫困线 10.8096351986
+启发性 11.2616203224
+瘫坐 10.604840786
+凶多吉少 9.96885201925
+马恩河 11.0674643079
+溃决 10.4994802703
+有意者 12.8020653633
+永发 12.8020653633
+湘灵 13.900677652
+岁月如梭 12.8020653633
+门券 12.5143832909
+旋紧 13.2075304714
+无大不大 13.900677652
+雨量计 12.5143832909
+真姓实名 13.2075304714
+问心 12.5143832909
+阶级觉悟 12.2912397395
+不解之谜 11.4157710022
+时差 10.0940151622
+关华宫 12.8020653633
+艾米克 13.900677652
+缺人 10.8561552143
+日环食 12.2912397395
+背脊 9.98865464655
+冯泽芳 12.8020653633
+易其兵 13.2075304714
+蔫蔫唧唧 13.900677652
+第一弦 13.900677652
+站口 12.8020653633
+易西亚德 13.900677652
+善自保重 13.2075304714
+第一张 9.85762638414
+镇巴县 13.900677652
+帕米尔 9.5062284973
+完成 4.97177223969
+拉西浦 13.900677652
+站台 9.62401153296
+朱迪 12.5143832909
+溃兵 10.7226238216
+怎见得 10.1394775363
+夫妻反目 12.2912397395
+该涨 13.2075304714
+赖升 12.2912397395
+西欧人 10.5684731418
+采集起来 13.900677652
+旖旎 11.4157710022
+白板笔 13.900677652
+匀出 13.900677652
+朱辅 13.900677652
+周振鹤 12.8020653633
+石秀笑 12.2912397395
+田川 12.1089181827
+问得 8.84443184663
+一百亩 11.4157710022
+刹把 12.8020653633
+永华 12.2912397395
+天理人情 13.900677652
+斯八世 12.5143832909
+三辈子 12.2912397395
+司马昭兵 13.2075304714
+祖尔肯 12.8020653633
+朱达 13.900677652
+王学的 13.900677652
+十三亿余元 13.2075304714
+万种风情 11.9547675029
+专业队 12.5143832909
+门前 6.90582766614
+追悼会 9.74179456862
+标度因子 13.900677652
+吴思礼 11.2616203224
+永南 13.2075304714
+闭门不出 10.4349417492
+王又宸 13.2075304714
+马德望省 12.5143832909
+普贤行 12.5143832909
+愤恨 9.25628675283
+涟水县 12.2912397395
+小学部 12.1089181827
+末日 8.84443184663
+金塔寺 13.900677652
+暂按 11.7034530746
+腕足 10.4666904475
+吴鞠通 12.2912397395
+链轨 12.5143832909
+张士衡 13.2075304714
+时年 9.93038573842
+更新换代 9.85762638414
+唱片 9.12155415886
+周伟良 13.900677652
+杨摩西 9.5186510173
+对时 11.9547675029
+夏内尔 12.5143832909
+留法 10.9562386728
+是非成败 12.5143832909
+旋纽 13.2075304714
+短简 13.2075304714
+科拉才 13.2075304714
+琼林 12.1089181827
+举行座谈 13.900677652
+变生肘腋 13.900677652
+邓飞 9.71102290995
+徽菜 13.900677652
+奠基性 11.1280889297
+走神儿 13.900677652
+屈一伸 13.900677652
+屋外 9.26594866375
+铭心刻骨 11.3357282945
+诚朴 13.900677652
+衣冠文物 13.2075304714
+发行者 11.1280889297
+瞬刻 11.2616203224
+敷料 11.7034530746
+门内 8.63798746307
+该港 10.9562386728
+驻马店 9.62401153296
+朱谕 12.1089181827
+糖浆 10.3171587135
+导抗 12.8020653633
+莱索托 10.533381822
+波丁顿 12.8020653633
+刘其兵 12.8020653633
+地心说 10.9049453784
+唱歌跳舞 10.9049453784
+无倚无靠 12.8020653633
+瓢泼大雨 10.8096351986
+时常 7.63918596765
+张兵败 13.2075304714
+大院君 11.9547675029
+闪盘 13.2075304714
+戴蒙哥 12.8020653633
+几十亿年 11.598092559
+痛不欲生 10.2117981979
+托车 13.900677652
+纲领 8.01179969364
+齐尔品 12.8020653633
+余联沅 12.2912397395
+旋绕 12.2912397395
+失常 9.24671730182
+框在 13.900677652
+愤怒 7.37564799413
+撑起来 11.1280889297
+第一峰 11.2616203224
+吐纳 10.4349417492
+强行性 12.8020653633
+门儿 10.4041700905
+徐水 11.598092559
+旺销 9.85762638414
+败兵之将 13.900677652
+第一封 11.8212361103
+朝内 10.2117981979
+二十万斤 13.2075304714
+凉浸浸 13.900677652
+托辞 10.8096351986
+时延 11.1280889297
+龙颜碑 12.8020653633
+梅利利 13.900677652
+大关 7.92686804011
+船坚炮利 12.2912397395
+叶氏 12.2912397395
+燃耗 13.2075304714
+提送到 13.2075304714
+讶异 11.598092559
+封于鲁 12.1089181827
+挂上去 11.7034530746
+发牢骚 9.7898037878
+伊能静 12.1089181827
+徐氏 10.533381822
+第一届 8.01457362053
+江阴县 11.7034530746
+不管三七二十一 10.5684731418
+骨髓炎 11.2616203224
+第一层 9.93038573842
+第一局 12.5143832909
+任满 10.9049453784
+荷叶杯 13.900677652
+托运 11.2616203224
+催化器 13.900677652
+走老路 13.2075304714
+弗所公 12.8020653633
+销售部 10.533381822
+奥贝德 13.900677652
+捕捞 8.6803218269
+西双版纳 9.25628675283
+芦管 12.5143832909
+遇水叠桥 12.1089181827
+贾范 12.2912397395
+累加器 13.900677652
+纳费珍 13.2075304714
+时序 10.2371160058
+出口气 12.1089181827
+库茨 13.900677652
+捕捉 8.15767446417
+徐汇 10.5684731418
+横须贺 11.3357282945
+劳动竞赛 12.1089181827
+惯量张量 13.900677652
+波塞东 11.9547675029
+脱网 12.1089181827
+缺什么 11.1280889297
+朱赓 12.8020653633
+兴趣盎然 11.598092559
+范麻子 12.5143832909
+愤慨 8.96620371885
+任继愈 11.8212361103
+荸荠 10.3171587135
+亚诺尔 13.900677652
+石由海 13.2075304714
+四六尺 13.2075304714
+朱赞 12.5143832909
+杀鸡取蛋 13.900677652
+努努嘴 10.9049453784
+徐润 11.2616203224
+弘道 11.0674643079
+遇秋 13.900677652
+杭家兄弟 12.5143832909
+商数 12.5143832909
+妙方 12.2912397395
+多亿立方米 10.5684731418
+允执其中 13.2075304714
+溃口 12.2912397395
+师学 12.2912397395
+中国企业联合会 12.5143832909
+执教 8.9102450652
+张万仙 13.2075304714
+东土寻 11.3357282945
+博厄斯 11.8212361103
+糖水 10.604840786
+阎圃谏 13.2075304714
+南京博物院 11.9547675029
+脱罪 12.5143832909
+金鲁生 8.18036587537
+显名 13.2075304714
+洋葱味 13.900677652
+糖汁 11.598092559
+基准点 12.2912397395
+攻过来 12.2912397395
+非议 9.04864738806
+执政 7.26210986281
+三数日 12.5143832909
+愤愤 9.34680076038
+铲土 11.1280889297
+乌云密布 11.8212361103
+秘鲁人 11.9547675029
+促进 5.49754941685
+刘兄弟 13.900677652
+显露头角 13.900677652
+汪良臣 13.2075304714
+一刀两断 10.4041700905
+盐粉 12.2912397395
+申请单 13.900677652
+朝鲜人民军 10.1871055853
+旋翼 10.5684731418
+神婆 11.9547675029
+脱缰 11.3357282945
+天花板 9.26594866375
+贴心人 12.1089181827
+要货 12.5143832909
+暂扣 10.2897597393
+时弊 10.1164880181
+一千六 12.8020653633
+一九二七年 12.1089181827
+稀饭 9.30555780184
+里拉琴 13.2075304714
+踝骨 12.8020653633
+瞬即 11.7034530746
+安新 11.4157710022
+因陋就简 11.5027823792
+有求必应 11.4157710022
+一十九句 13.900677652
+体重计 13.900677652
+鸡蛋黄 11.9547675029
+妖刀 12.5143832909
+捕房 11.5027823792
+婚照 13.900677652
+压进去 13.900677652
+豪强 8.55834340001
+大人物 9.48183704418
+兰新铁路 10.2371160058
+连柯夫 13.900677652
+核国家 11.4157710022
+十几条 11.0103058941
+自艾 13.2075304714
+油类 10.9049453784
+商旅 9.89334446674
+日本共同社 11.5027823792
+徐洪 13.900677652
+旧物 10.0720362555
+商族 11.0674643079
+立刘盈 12.8020653633
+巡检 9.72629038208
+成祖赐 13.2075304714
+西尼奥 13.900677652
+皮尔 10.4349417492
+自留畜 13.2075304714
+伏妖 13.900677652
+框图 11.7034530746
+王锡朋 12.8020653633
+张宗演 12.1089181827
+徐洁 12.8020653633
+想了个 10.7226238216
+徐洋 11.9547675029
+准奏 10.3743171274
+迄至 13.2075304714
+愤懑 9.46986085313
+跨脚 13.900677652
+留洋 12.1089181827
+倚栏 11.9547675029
+烟波浩淼 13.2075304714
+徐海 11.5027823792
+销售量 8.59737274392
+仰望 9.06439574502
+中银国际 9.05649056552
+唐敏之 11.0674643079
+电势差计 13.900677652
+吐翠 13.900677652
+非常耐久 13.900677652
+干不了 10.0294766411
+甲基丙烯酸 12.8020653633
+剪纸片 12.5143832909
+离群 11.3357282945
+连接符 13.2075304714
+国家统计局 8.13548654919
+徐浩 12.5143832909
+能源部 11.598092559
+七亘村 12.5143832909
+永光 11.598092559
+两千四百余 13.2075304714
+永元 10.4349417492
+开诚相见 12.8020653633
+石原慎太郎 12.8020653633
+实用性 9.5062284973
+纤维素酯 12.8020653633
+赖兴 13.900677652
+鼎湖 13.900677652
+捕手 12.5143832909
+基本参数 11.3357282945
+和圣训 11.8212361103
+欧律狄 13.2075304714
+吴禄贞 13.2075304714
+势不两存 13.900677652
+拾起来 10.4666904475
+弗兰德 11.598092559
+大姨子 12.8020653633
+电力机械 13.900677652
+马祖澳 12.5143832909
+任总 10.0505300503
+皮尤 13.2075304714
+此一时彼一时 11.5027823792
+门德 13.900677652
+修行在个人 13.2075304714
+方可言 12.8020653633
+双增长 11.8212361103
+任性 8.99540287354
+异丙醇 11.7034530746
+六百多行 13.2075304714
+永康 10.1164880181
+步行者队 13.900677652
+朱色 11.598092559
+门徒 9.71102290995
+宽肩 12.1089181827
+永庆 11.7034530746
+确知 10.2117981979
+一夥 10.4041700905
+稳操胜算 12.5143832909
+杨大洪 12.2912397395
+文史类 13.900677652
+刘庄村 13.2075304714
+环球网 12.5143832909
+喧嚣一时 13.2075304714
+军官团 12.8020653633
+后港 13.2075304714
+三乙醇胺 12.1089181827
+门径 11.0103058941
+抛荒 11.7034530746
+走向 6.09846833573
+景东彝族自治县 13.900677652
+军用物资 10.1871055853
+史太君 12.1089181827
+原程序 13.900677652
+四维空间 12.1089181827
+永建 10.9562386728
+同心结 13.2075304714
+蟋蟀 9.58318953844
+加喜特 11.9547675029
+没头没尾 11.598092559
+贫困率 13.900677652
+金銮宝座 13.900677652
+走合 13.2075304714
+红外技术 12.2912397395
+时值 9.21854642485
+防扩散 11.8212361103
+入射波 11.9547675029
+不害羞 11.3357282945
+斯金纳 11.4157710022
+公孙鞅 12.2912397395
+手艺人 9.62401153296
+阳茎基 13.2075304714
+狂奔 9.12999302751
+三万多元 12.1089181827
+舆图 10.8561552143
+生态小区 13.900677652
+东方通信 11.9547675029
+拍打在 13.900677652
+问到 8.83177344976
+时候 4.28874633344
+苍蝇儿 11.4157710022
+凄风 12.8020653633
+呀呀 10.2117981979
+巡查 9.6811699468
+助虐 12.5143832909
+金融法 11.9547675029
+防盗窗 13.900677652
+赖希 12.8020653633
+第一刀 12.5143832909
+赖帐 12.5143832909
+白圭 11.9547675029
+颈圈 11.9547675029
+封肃 12.2912397395
+贵阳 8.77671367257
+生态系统 8.55357012126
+艺术作品 9.96885201925
+荣事达 11.0103058941
+和河东 11.4157710022
+诺里 12.8020653633
+徐成 13.900677652
+鱼骨头 12.5143832909
+明堂正道 13.900677652
+十几桌 12.1089181827
+分支机构 8.43684584695
+刚跑 11.3357282945
+迦太基 9.37888907493
+东零西落 13.900677652
+门式 12.2912397395
+昆明池 11.3357282945
+巴达赫尚 12.8020653633
+门开 9.66657114738
+徐戎 12.2912397395
+襄平 10.9049453784
+乳源瑶族自治县 12.1089181827
+十几株 13.900677652
+可见度 12.8020653633
+裁缝业 12.2912397395
+司马玮 12.8020653633
+浅水区 10.642581114
+琼楼 11.8212361103
+艾米尔 12.2912397395
+控制系统 7.86759143018
+哮喘 9.12155415886
+四六句 11.7034530746
+十几根 11.5027823792
+自由竞争 9.89334446674
+变化规律 9.11318590919
+女佣人 13.900677652
+留成 11.9547675029
+有教益 12.8020653633
+十几样 12.1089181827
+永年 11.1926274509
+第一副 9.55687223012
+朱芳 13.900677652
+豆奶 11.0103058941
+长白山地 10.1164880181
+俚曲 11.598092559
+圣彼得广场 12.5143832909
+要花 9.59661255877
+戈拉 11.9547675029
+俄人 12.5143832909
+任情 11.1926274509
+原地打转 12.5143832909
+戚然 11.598092559
+暧昧不明 12.8020653633
+倒数第 11.9547675029
+拉威尔 13.900677652
+虱目 11.8212361103
+存储管理 12.1089181827
+纽波特 12.1089181827
+问华 13.2075304714
+评等 11.9547675029
+削壁 12.1089181827
+准备 4.95704094607
+踩踩 13.2075304714
+甚且 12.1089181827
+暖酒 11.8212361103
+胸痹 11.8212361103
+时兴 9.6811699468
+促膝 11.3357282945
+门庭 10.5684731418
+朱祖谋 13.2075304714
+永德 11.9547675029
+抛舍 13.2075304714
+日照时间 10.4666904475
+杨三己 13.900677652
+特勤队 10.9049453784
+时光 8.05135287203
+基度山 11.9547675029
+丘陵地区 9.63799777493
+门店 8.59737274392
+约瑟夫森 11.0674643079
+折旧基金 12.5143832909
+胸痛 9.84023464143
+朱荣 10.5684731418
+多瑙河 8.86372504956
+踩踏 8.81927328699
+赖德 11.8212361103
+灵活处理 13.900677652
+蹲下 9.10488710638
+任意 7.51211624643
+灾难深重 11.4157710022
+问卷 9.36807815882
+北京京剧团 11.9547675029
+若冰霜 12.8020653633
+第一双 13.2075304714
+基准线 12.2912397395
+周礼义 12.2912397395
+完满 10.3453295905
+吡咯烷 13.900677652
+祖鲁军 13.900677652
+足食足兵 12.2912397395
+朱茂 13.900677652
+卡卢奇 13.900677652
+日用品 9.23723855786
+琼森 11.598092559
+割到 13.2075304714
+宋江收 11.8212361103
+第一发 12.8020653633
+油状 10.4041700905
+咎由自取 10.9049453784
+朱茵 12.8020653633
+进口关税 10.642581114
+处理单元 11.5027823792
+第一句 9.28555713513
+第一口 10.604840786
+门廊 10.8096351986
+徐揆 12.8020653633
+第一号 9.84023464143
+珍藏品 12.8020653633
+算术级数 12.2912397395
+永志 13.900677652
+香附子 11.8212361103
+第一台 8.70218062071
+问及 8.86372504956
+语言学家 9.82314020807
+野葬 13.900677652
+字帖儿 12.8020653633
+王亦君 13.900677652
+二十五六岁 12.2912397395
+山芝麻 13.900677652
+桂王朱 12.2912397395
+可邀 13.2075304714
+野葱 13.2075304714
+勇冠三军 12.2912397395
+决一胜负 13.900677652
+舆地 10.2117981979
+夹墙 11.5027823792
+驻伊美军 13.900677652
+司农寺 11.5027823792
+铮铮 11.1280889297
+节省成本 11.1926274509
+问句 13.2075304714
+愤激 10.9049453784
+产棉省 12.1089181827
+人口论 11.2616203224
+第一匹 13.2075304714
+态函数 11.3357282945
+门市 10.533381822
+涨大起来 13.2075304714
+望仙桥 11.9547675029
+问号 9.35738286971
+姜茶 12.8020653633
+等时摆 13.900677652
+石秀看 13.2075304714
+记大过 11.8212361103
+豪兴 11.8212361103
+情绪高涨 10.9562386728
+科登第 12.8020653633
+第一千 12.5143832909
+野营 10.9562386728
+当涂县 12.2912397395
+具体安排 10.765183436
+汪春元 11.598092559
+皮山 11.3357282945
+朱莉 12.1089181827
+话剧界 13.2075304714
+介音 12.1089181827
+朝廷 5.85508937117
+左有林 13.2075304714
+商殷 12.5143832909
+人权宣言 11.1926274509
+日月星 12.8020653633
+自由职业者 10.8561552143
+努力以赴 13.2075304714
+走喽 13.900677652
+王常常 13.2075304714
+黄绿色 9.5062284973
+徽调 12.2912397395
+豪克 13.2075304714
+第一卷 8.21370229564
+汽车集团 10.1164880181
+室内环境 11.8212361103
+道高一丈 13.2075304714
+框子 12.1089181827
+输入法 12.1089181827
+误认 10.9562386728
+邓铿 13.2075304714
+任化邦 13.900677652
+兜圈子 10.1871055853
+清清静静 11.598092559
+留情 10.533381822
+秋审 12.8020653633
+该扣 12.8020653633
+织出 11.0674643079
+陈联寿 10.1630080337
+科拉湾 13.2075304714
+微积分学 10.7226238216
+鲷类 13.900677652
+开拓性 10.5684731418
+过渡态 10.9562386728
+翠碧 12.8020653633
+唐琴 13.2075304714
+三阴交 11.4157710022
+该所 9.41204128224
+闵河 12.5143832909
+不到之处 11.9547675029
+商桥 12.8020653633
+田岛 13.2075304714
+过渡性 9.5186510173
+下乘 12.1089181827
+周廷儒 13.2075304714
+或能 10.1394775363
+百分之十三点 13.2075304714
+下个 9.80633308975
+伊尔汗 13.2075304714
+昆仲 11.5027823792
+门巴 9.80633308975
+厉有为 13.2075304714
+问候 8.77077893705
+商标 8.05423887692
+纵纹 10.2371160058
+该户 12.8020653633
+时刻 6.76738169708
+收费公路 11.2616203224
+昏暮 13.900677652
+货币地租 9.55687223012
+薪酬 8.48457724977
+立灵帝 13.2075304714
+下一 9.41204128224
+英国大学 12.1089181827
+时分 7.45813748551
+虫媒 11.7034530746
+下下 11.4157710022
+地瘠民贫 12.5143832909
+治多县 12.8020653633
+商校 13.900677652
+云长何 12.8020653633
+任所 10.8561552143
+下世 11.1926274509
+陶宗仪 11.4157710022
+夹好 13.900677652
+豪勇 13.900677652
+小锅 11.7034530746
+下代 12.2912397395
+昆明湖 10.3453295905
+留恋 8.98802276624
+宁化县 11.8212361103
+下令 6.92619874095
+没关系 8.65365357982
+走回 9.26594866375
+周之冕 12.5143832909
+秦至唐 12.5143832909
+表舅 12.2912397395
+闵氏 13.900677652
+赖尔 11.1926274509
+皮卡尔 12.8020653633
+下任 12.1089181827
+曾为楚 13.2075304714
+秋容 12.5143832909
+脱狱 13.900677652
+执棒 11.8212361103
+油煎 11.0674643079
+单树模 9.23723855786
+闵水 13.2075304714
+朱能 12.2912397395
+违反原则 13.2075304714
+示爱 13.2075304714
+各集 13.2075304714
+淞沪 9.43476953332
+入土为安 10.8561552143
+匪巢 12.5143832909
+阿尔茨海默 12.2912397395
+易义别 13.2075304714
+全权大使 11.5027823792
+六十万两 12.1089181827
+漫长 7.41147272065
+数据终端 12.8020653633
+小锚 13.2075304714
+泽西岛 13.900677652
+时务 9.63799777493
+达原饮 13.900677652
+或者 5.17468327096
+做神做鬼 13.900677652
+转变成 8.6966709649
+该报 10.0720362555
+框定 11.4157710022
+埋葬 8.47133202302
+国在华 11.9547675029
+生产经营者 12.2912397395
+惆怅 9.32596667347
+生命安全 10.2117981979
+下人 9.23723855786
+徐恩 12.8020653633
+蛐蛐儿 11.4157710022
+站岗 9.5186510173
+时势 9.82314020807
+钱正英 13.2075304714
+心理线 13.900677652
+野蜂 11.1926274509
+奥克兰市 13.2075304714
+徒托空言 13.900677652
+唐韵正 13.900677652
+吴平西 11.3357282945
+唱红 12.2912397395
+无妻 11.8212361103
+下井 9.65218240993
+克里斯蒂娜 11.0674643079
+该投 13.2075304714
+按兵不动 8.81308131674
+客观实在 11.0103058941
+书写方向 13.900677652
+骂大街 11.598092559
+青乌术 12.2912397395
+第一册 11.8212361103
+铲子 9.80633308975
+鹄立 11.9547675029
+野蛮 8.30225569298
+晤对 13.2075304714
+一百七十六篇 13.2075304714
+该换 11.5027823792
+斯内克 13.900677652
+姚启圣 13.900677652
+垂涕 13.900677652
+同恶共济 13.900677652
+头临泣 12.8020653633
+不足为外人道 13.2075304714
+割舍不下 13.900677652
+在世界上 8.60737282725
+运动 5.15714601835
+焦耳实验 13.900677652
+古贾尔 12.8020653633
+技术部 10.7226238216
+阿干镇 12.5143832909
+完全变态 10.8096351986
+下位 9.20932976975
+下体 9.89334446674
+环境治理 11.1280889297
+打发掉 11.9547675029
+林盛中 13.900677652
+油烟 10.5684731418
+幅射 13.900677652
+凯旋门 10.3453295905
+下余 13.900677652
+英若诚 12.2912397395
+下作 10.1871055853
+紫黑色 10.5684731418
+下传 11.9547675029
+任捷 12.8020653633
+匝道 11.4157710022
+洛克先生 12.2912397395
+豪右 11.2616203224
+油炸 9.5062284973
+莲荷 13.900677652
+汉宫秋 11.1280889297
+时区 11.0103058941
+百分之零点 12.1089181827
+漏接电话 13.900677652
+江春水 13.2075304714
+克里斯蒂安 11.0674643079
+兵符 10.3171587135
+朝山 11.0103058941
+糟改 12.8020653633
+惊人 7.09384829158
+控告 9.36807815882
+埋藏 8.31342899358
+穿出去 13.900677652
+苤蓝 13.900677652
+永州 10.4041700905
+王贲攻 12.1089181827
+永川 11.8212361103
+徐懋 12.5143832909
+有好有坏 12.2912397395
+油炒 12.1089181827
+野蚕 12.5143832909
+开发方式 12.8020653633
+门尹 12.8020653633
+油灯 9.14708746087
+含饴弄孙 13.900677652
+十九首 11.1280889297
+皋兰 12.5143832909
+保健产品 12.5143832909
+开店 9.46986085313
+油灰 13.2075304714
+准现房 13.900677652
+猜得出 11.2616203224
+陈再道 12.2912397395
+生大士 13.900677652
+静美 13.900677652
+锁阳 11.5027823792
+保国安民 11.9547675029
+项目组 10.642581114
+惊喜价 13.900677652
+邮件系统 12.8020653633
+时变 11.1926274509
+门封 12.8020653633
+门将 10.5684731418
+徒涉 12.5143832909
+任掌 11.598092559
+磁条卡 13.2075304714
+远洋渔业 11.2616203224
+留意 7.89679058487
+累累的 11.3357282945
+惊世 13.2075304714
+战斗运用 13.2075304714
+印刷机 10.5684731418
+国际品牌 10.9049453784
+惹是非 13.2075304714
+檐角 11.7034530746
+斯佩里 12.5143832909
+印刷术 9.55687223012
+腾欢 13.2075304714
+沙黄色 12.5143832909
+舅爷 10.1164880181
+激怒 8.83808261895
+商榷 9.75754292558
+湘绣 11.1926274509
+管箫 13.2075304714
+云长今 13.2075304714
+医疗界 13.900677652
+安平古堡 12.2912397395
+豪华 7.57631868959
+小包装 10.4041700905
+公大怒 11.5027823792
+莅会 13.2075304714
+燃起 9.0884932966
+扼守 9.63799777493
+体育运动 8.93783302172
+鬼域伎俩 13.900677652
+汉惠帝 13.2075304714
+繁琐哲学 12.8020653633
+迷宫般 11.5027823792
+旧称 8.9102450652
+略知 10.9562386728
+凸函数 13.2075304714
+匀匀 13.900677652
+电视新闻 11.3357282945
+屈从 9.80633308975
+刚赢 13.900677652
+油矿 11.1926274509
+门客 10.0720362555
+海滩鞋 13.900677652
+油石 11.3357282945
+萨福克郡 12.5143832909
+韩彭二 12.8020653633
+仰泳 11.3357282945
+信用联社 12.5143832909
+运兵 11.5027823792
+巴泽雷克 11.9547675029
+巡捕 10.0505300503
+叶派 13.900677652
+文文 12.1089181827
+钟子期 12.2912397395
+由海道 11.598092559
+彼等 12.2912397395
+万户 7.79811905736
+麦卡宾 13.2075304714
+连接点 11.7034530746
+深受教育 12.8020653633
+侠骨 12.1089181827
+真不容易 10.4666904475
+东明路 10.765183436
+第一回 10.2117981979
+圬工 13.900677652
+无错 11.7034530746
+几十发 12.5143832909
+数九 11.7034530746
+蓬勃发展 8.99540287354
+田放 10.6818018271
+透镜状 11.4157710022
+巡按 9.37888907493
+第一团 13.900677652
+完毕 6.98594675926
+持票人 11.598092559
+打击目标 11.598092559
+商港 9.75754292558
+外事委员会 12.5143832909
+朝宗 10.1871055853
+赖娃 12.5143832909
+愧色 11.7034530746
+介面 13.2075304714
+史见服 13.2075304714
+政府部门 8.00627481771
+德彪西 10.9049453784
+于锡兰 13.2075304714
+空港 10.4349417492
+两卷 9.53122979951
+屋去 10.9562386728
+耐盐作物 13.2075304714
+多口网络 13.900677652
+割去 10.4994802703
+糖果 9.03314320152
+期市 8.80692745117
+唱国歌 12.8020653633
+调和函数 11.4157710022
+细管 11.7034530746
+连旗昌 13.2075304714
+青绿色 11.0674643079
+枯季 11.9547675029
+释迦多 12.2912397395
+徐昆 13.2075304714
+新平彝族傣族自治县 12.5143832909
+奥梅 13.900677652
+举重队 13.900677652
+陆俨少 12.2912397395
+液晶面板 10.1164880181
+刘士豪 13.2075304714
+琼海 10.9562386728
+王导卒 12.8020653633
+亲英派 13.900677652
+黄粱美梦 12.5143832909
+唱碟 13.900677652
+缅怀 9.7898037878
+宝积宾 12.5143832909
+悄然而去 13.2075304714
+赖婚 13.900677652
+空气喷气 11.8212361103
+张书才 12.8020653633
+实繁有徒 13.900677652
+一劳永逸 11.2616203224
+徐晓 13.2075304714
+卡斯帕罗夫 12.5143832909
+一扫而过 13.2075304714
+四两重 13.2075304714
+评级 6.62897394509
+门子 9.5062284973
+颐神 13.2075304714
+长白山区 10.604840786
+溃堤 12.2912397395
+琼浆 11.7034530746
+徐晃 9.66657114738
+库萨 11.9547675029
+南浔庄 13.2075304714
+辽远 11.8212361103
+反党 10.0505300503
+丧气话 11.7034530746
+废水处理 11.4157710022
+过渡期 9.30555780184
+马英九 12.5143832909
+纪风成 12.8020653633
+金铃子 13.2075304714
+第一世界 11.7034530746
+无以至千里 13.900677652
+粗略地 10.765183436
+黑星 11.3357282945
+期待 6.70924832194
+踢过去 12.5143832909
+抬出来 10.642581114
+永安 8.73019365694
+徐林 10.604840786
+昌言 12.2912397395
+永宁 9.32596667347
+走兽 9.89334446674
+永定 10.1871055853
+张牙舞爪 9.98865464655
+麻木状态 12.2912397395
+岚皋县 13.900677652
+多怒 13.900677652
+走入 8.74738605748
+油盐 10.0505300503
+升斗小民 12.5143832909
+鞍前马后 11.2616203224
+小天鹅 9.54396882529
+鹰扬 11.3357282945
+余对 13.900677652
+宋元符 12.5143832909
+商演 13.900677652
+暖锅 12.1089181827
+油皮 12.8020653633
+暖锋 11.8212361103
+徒步 9.32596667347
+爪哇人 11.0674643079
+永寿 10.765183436
+月下老人 12.5143832909
+旗鼓相当 11.0674643079
+吐番 12.5143832909
+宗为尧 13.2075304714
+该收 13.900677652
+意甲 12.2912397395
+徐某 11.7034530746
+三里屯 11.1280889297
+任教 7.55679721785
+万担 12.2912397395
+屋前 11.0674643079
+转换方法 12.5143832909
+钟肇政 12.8020653633
+煤炭行业 9.17328983326
+腾涌 12.5143832909
+洪泽县 11.9547675029
+机动车 7.55504129115
+主客观 10.9562386728
+上辈人 13.2075304714
+挖耳勺 13.2075304714
+大小官员 10.2371160058
+玉里 12.1089181827
+自学能力 12.8020653633
+伟大领袖 10.9562386728
+汉刘曜 12.8020653633
+饲料用 12.5143832909
+第一圈 12.1089181827
+该日 11.8212361103
+社会部 11.3357282945
+三仁汤 12.8020653633
+教士 8.81308131674
+享乐主义 11.4157710022
+伦格兰 13.2075304714
+凤头村 13.2075304714
+芦粟 12.8020653633
+和平医院 13.900677652
+森林更新 13.2075304714
+名垂史册 13.900677652
+德钦莫 12.8020653633
+思想混乱 11.4157710022
+停车库 12.2912397395
+出口权 13.2075304714
+走出 5.87843673517
+贪赃枉法 10.3171587135
+忧国爱民 13.900677652
+辽中县 12.2912397395
+射下来 11.598092559
+任文 13.2075304714
+第一场 9.54396882529
+平壤市 12.5143832909
+出口创汇 10.7226238216
+荷语 12.5143832909
+白吃白喝 12.5143832909
+留有 8.58255765813
+追踪报道 11.0674643079
+吐痰 10.9562386728
+纳税者 11.9547675029
+巡护 12.8020653633
+多岩礁 13.2075304714
+一九八七年 13.900677652
+徐松 10.8561552143
+桐子 11.7034530746
+蜡台 12.8020653633
+牛皮带 12.8020653633
+站定 9.12155415886
+蜡叶 13.2075304714
+第一块 10.4994802703
+卡片式 12.5143832909
+屈伸 10.5684731418
+看官 10.2897597393
+贸易业 11.598092559
+野老 11.3357282945
+圆周率 10.0940151622
+静置 11.5027823792
+彝文 13.2075304714
+七八百里 11.9547675029
+永存 10.4041700905
+方杰见 13.2075304714
+附属品 11.2616203224
+个人所有 11.5027823792
+端节 12.2912397395
+豪商 13.2075304714
+巡抚 7.46292600224
+数万 8.2985588311
+朝夕 9.55687223012
+罄竹难书 11.9547675029
+朝外 9.85762638414
+地区性 8.70218062071
+附属地 11.5027823792
+很多歌 13.900677652
+何曾洁 13.2075304714
+国际奥林匹克委员会 10.9049453784
+秕谷 13.900677652
+具报 12.5143832909
+活化剂 12.2912397395
+三万重 13.900677652
+耙土 13.2075304714
+击伤 9.94943393339
+枣阳 10.604840786
+大军鼓 13.2075304714
+块茎作物 13.900677652
+颈内 11.8212361103
+堡礁 11.3357282945
+黑木耳 10.0088573539
+野菊 12.2912397395
+里佐 13.900677652
+伊尔根 11.7034530746
+铲平 10.2371160058
+封王爵 11.9547675029
+任公卿 13.2075304714
+马内斯 12.8020653633
+想像到 13.900677652
+商汤 10.2117981979
+耙地 11.2616203224
+未能免俗 11.9547675029
+朝天 9.33632946051
+作笔记 13.900677652
+提示符 10.8561552143
+暖阁 8.89673134603
+该是 8.3555002075
+暂歇 10.0940151622
+徽记 12.8020653633
+金塔县 13.2075304714
+金鼓齐鸣 11.598092559
+第一品 12.8020653633
+可利用率 12.5143832909
+红巾军 9.87532596124
+问君 11.7034530746
+哈莱斯 12.2912397395
+朝奉 11.5027823792
+任普 13.2075304714
+天文表 12.2912397395
+恶汉 13.2075304714
+走到 6.25815351774
+负伤 8.81927328699
+商水 10.9049453784
+米拉波 11.8212361103
+邮政总局 11.598092559
+上映 9.34680076038
+背德 13.900677652
+九百六十万平方公里 11.8212361103
+主记 13.900677652
+沙钵罗 12.8020653633
+孤雌生殖 10.642581114
+蝇头小楷 11.0674643079
+拿得起 11.4157710022
+甚佳 10.4666904475
+愈来 13.2075304714
+黄皮肤 12.1089181827
+第一名 8.51160592216
+两包 10.533381822
+商法 10.8561552143
+翠柳 12.2912397395
+口腹之欲 12.8020653633
+略略 9.11318590919
+渔获 11.0674643079
+四年级 10.7226238216
+瓦克锤 12.8020653633
+华北区 10.9049453784
+门夫 12.8020653633
+苏庵 11.3357282945
+正后方 12.2912397395
+销售额 7.83689244329
+白于山 11.1280889297
+糖料 10.6818018271
+想像力 10.604840786
+躲躲 12.8020653633
+交货付现 13.900677652
+野草 9.37888907493
+执法 7.51211624643
+脱盲 13.900677652
+生产能力 7.99804431857
+常盛 13.2075304714
+张宗昌 12.2912397395
+定结县 13.2075304714
+门外 6.34111815597
+胸片 11.0103058941
+栅板 13.900677652
+贾敬颜 11.598092559
+关赋百 13.2075304714
+印刷所 10.8096351986
+骨腔 13.2075304714
+有意识 8.9102450652
+一档子 11.5027823792
+金圣叹 11.598092559
+天汉州 12.5143832909
+小童子 12.5143832909
+某处 9.85762638414
+朱蒙 12.8020653633
+模型飞机 12.5143832909
+圭亚那 9.58318953844
+贫困生 13.900677652
+创新作品 13.2075304714
+油画 8.39941944143
+第一员 13.2075304714
+油田 8.04560572977
+佩斯卡拉 12.8020653633
+北大附中 11.598092559
+齐尔山 13.900677652
+金融寡头 11.0103058941
+赶考 10.9049453784
+石炭井区 13.2075304714
+莽苍苍斋 13.2075304714
+第一周 9.85762638414
+蓬蓬松松 12.1089181827
+漫步者 11.598092559
+鸣金收兵 11.1926274509
+走势 5.33374236866
+蜡像 12.2912397395
+二道贩子 11.7034530746
+北北东 9.61021821083
+仁义道德 11.1926274509
+走动 8.03138073884
+妖儿 11.598092559
+抗污染 12.5143832909
+脱皮 10.2371160058
+走卒 11.1280889297
+王势力 13.900677652
+渔船 9.00283785202
+该来 10.8561552143
+剧坛 10.765183436
+徐方 12.2912397395
+该条 10.9562386728
+鱼骨庙 9.98865464655
+都东瓯 13.2075304714
+茫茫然 10.8561552143
+徐丽贞 12.8020653633
+门墩 11.9547675029
+旧章 11.5027823792
+温德殿 13.900677652
+韦尔特曼 13.900677652
+击中 8.44963919841
+油瓶 11.1926274509
+渔舟 11.9547675029
+蹲伏 11.5027823792
+愈显 12.5143832909
+商海 12.2912397395
+不奈烦 12.8020653633
+流动力学 13.900677652
+余百三十五 13.2075304714
+任期 7.96843246453
+东瞧西望 12.5143832909
+旧站 13.2075304714
+虞应龙 12.5143832909
+遥遥 10.3453295905
+徐文 12.8020653633
+东麓南 13.2075304714
+任有 12.5143832909
+喜怒不形 11.9547675029
+街面上 10.533381822
+坐怀不乱 12.5143832909
+任杰 12.1089181827
+保正 10.2371160058
+美国公司 9.84023464143
+六千斤 12.8020653633
+不容置疑 9.58318953844
+商洛 10.4349417492
+渔色 13.900677652
+首重 11.598092559
+东水关 12.2912397395
+第几百次 13.900677652
+两叠 12.8020653633
+该机 9.04086524761
+野花 9.21854642485
+海卡尔 12.8020653633
+急于事功 13.2075304714
+吸收玻璃 13.900677652
+失德 10.4041700905
+屯门 11.8212361103
+五五年 13.900677652
+现役军官 11.9547675029
+航行图 13.2075304714
+商洽 11.9547675029
+任权 11.0674643079
+强还原剂 11.7034530746
+明长城 11.0103058941
+一百号 13.900677652
+卡萨尔斯 12.2912397395
+第聂伯罗彼得罗夫斯克 11.8212361103
+工农联盟 10.2897597393
+电脑游戏 11.4157710022
+离石 10.0505300503
+百余只 11.9547675029
+重新得到 10.8096351986
+敬恳 13.2075304714
+设计图 11.4157710022
+广东海关 13.900677652
+倚恃 11.9547675029
+漫道 12.5143832909
+铁笛仙 11.598092559
+平摩尔 12.1089181827
+两号 12.8020653633
+哑口无声 13.2075304714
+温水浴 13.2075304714
+宁陵县 11.1280889297
+中小板 6.5887914879
+科教兴农 12.5143832909
+云洞圣 13.2075304714
+永备 11.0103058941
+互惠互利 10.642581114
+成龙配套 12.5143832909
+与会 8.3285236198
+秋子 10.0088573539
+聂拉木县 12.2912397395
+煽动性 11.2616203224
+经世济 13.2075304714
+侯玉英 10.0088573539
+时域 11.598092559
+汗滴禾下土 12.8020653633
+徐整 12.8020653633
+稀释 8.62767809341
+恃强凌弱 12.2912397395
+海勃湾 11.7034530746
+子常 13.2075304714
+连承欢 13.2075304714
+闻闻看 13.900677652
+耿耿于怀 9.84023464143
+惶悚 11.7034530746
+医巫闾山 11.7034530746
+白菜汤 13.2075304714
+走去 7.05799436974
+愤概 13.2075304714
+宗为庐 12.8020653633
+特瑟斯 12.8020653633
+湘竹 13.900677652
+会宁县 12.8020653633
+性肝炎 11.1280889297
+放射源 11.3357282945
+赶脚 11.3357282945
+兰桂坊 13.2075304714
+徐敏 11.3357282945
+奇乾 13.2075304714
+略语 13.900677652
+十几部 11.8212361103
+寓邸 13.900677652
+时间机器 13.2075304714
+沃尔科 13.900677652
+十二路 12.5143832909
+算式 12.1089181827
+科场 10.0720362555
+千声 12.8020653633
+金日成 10.4666904475
+枣核 10.8561552143
+该项 8.63281949291
+朱穆 13.2075304714
+该页 13.900677652
+加兰德 13.900677652
+埋线 11.8212361103
+维埃 13.2075304714
+石机 12.5143832909
+法院网 12.8020653633
+电子探针 11.9547675029
+厉王赐 13.2075304714
+钦州港 13.900677652
+干旱期 12.1089181827
+事务部 10.5684731418
+短期行为 9.82314020807
+献言 13.900677652
+脱衣 10.4349417492
+寒假 10.3171587135
+凄恻 12.2912397395
+高次方程 11.7034530746
+唢呐 9.37888907493
+枣树 9.77354326693
+抱进 11.5027823792
+这几年来 10.4041700905
+鱼肝油 10.4349417492
+韩丽珍 10.642581114
+凄怆 11.0103058941
+六丈 12.2912397395
+十分钟 9.53122979951
+弘期 12.2912397395
+巴纳德 11.1926274509
+沃尔福 13.2075304714
+略记 13.2075304714
+空间频率 13.2075304714
+区位 9.26594866375
+临沂人 12.8020653633
+塞进来 12.8020653633
+鹰鼻 13.900677652
+科坛 13.900677652
+吐血 9.49395840471
+连太子爷 13.2075304714
+露天开采 10.4349417492
+布冉利 13.2075304714
+声明书 12.5143832909
+极品 9.63799777493
+呆若木鸡 10.4349417492
+信任案 12.2912397395
+守备部队 11.3357282945
+托福 10.765183436
+不可见光 13.2075304714
+妓女 8.73589167805
+愣头愣脑 12.1089181827
+感应电流 11.4157710022
+算得 9.08039608637
+全线产品 12.8020653633
+其美 12.2912397395
+两千多块 12.5143832909
+金鸳鸯 12.8020653633
+活报剧 12.1089181827
+呼声甚高 12.8020653633
+克拉通 11.3357282945
+凄惨 9.27570483869
+十几遍 12.5143832909
+华科技 12.2912397395
+试点县 11.598092559
+李翠莲 11.5027823792
+恁地 8.98802276624
+留驻 9.84023464143
+人武部 11.598092559
+心理战术 12.5143832909
+单挑 12.1089181827
+王牌军 11.598092559
+凄惶 10.4349417492
+十几道 12.2912397395
+秦权 10.765183436
+党员干部 9.84023464143
+奥斯丁 11.1926274509
+三重市 13.2075304714
+青衣人 13.900677652
+过圆 13.900677652
+中洲子 12.5143832909
+浙江人民出版社 12.8020653633
+相敬相 12.8020653633
+弃妇 11.7034530746
+赵紫宸 12.8020653633
+解码器 12.2912397395
+朱窝儿 13.2075304714
+诸广山 11.1926274509
+攸关 10.0294766411
+锤儿 13.900677652
+孵化率 12.5143832909
+折节下士 12.5143832909
+无轨电车 10.642581114
+聘召 12.8020653633
+动漫 9.03314320152
+漫漫 9.27570483869
+冲积层 11.0674643079
+弗伦奇 11.598092559
+梁国之 12.8020653633
+通亨奇 12.8020653633
+腾退 11.8212361103
+数了 13.2075304714
+托称 12.8020653633
+蓝田玉 12.5143832909
+听宝玉 11.0103058941
+掠夺式 11.7034530746
+正诱因 13.900677652
+安仁里 11.9547675029
+鹰鹞 12.8020653633
+歌舞晚会 12.1089181827
+张文学 13.2075304714
+恶霸 10.4666904475
+一整片 12.8020653633
+枣椰 12.1089181827
+夹点 13.2075304714
+信小乘 12.5143832909
+舞出 12.8020653633
+金石学 10.1394775363
+十几里 9.96885201925
+精炼油 12.8020653633
+新闻史 13.900677652
+朱筠 13.2075304714
+低保金 13.2075304714
+卢龙镇 13.2075304714
+愤青 12.8020653633
+呼吸之间 11.4157710022
+瓦斯卡兰山 13.900677652
+朱笔 9.69598503258
+销售权 12.2912397395
+银河系 8.9519177616
+模型试验 11.0103058941
+金鼓振 13.2075304714
+稀罕物 12.5143832909
+妻管严 12.8020653633
+土壤有机 12.8020653633
+窟窿眼 12.1089181827
+园艺场 9.54396882529
+吉布提 10.2117981979
+和资阳 12.5143832909
+经济圈 10.1394775363
+相位 9.18217878068
+抛空 11.0674643079
+浮点数 12.5143832909
+封建意识 11.5027823792
+购车族 13.900677652
+喇嘛庙 12.1089181827
+俄罗斯族 11.4157710022
+概数 12.5143832909
+白云鹏 11.8212361103
+愣神 10.9562386728
+独奏会 12.8020653633
+迟太迟 13.2075304714
+旅团长 11.598092559
+灌木丛 9.28555713513
+蒋二旺 10.8096351986
+燃眉 12.5143832909
+赏点 13.2075304714
+区产 12.5143832909
+诚邀 11.9547675029
+郁之策 12.8020653633
+超稳定 13.2075304714
+离解 9.98865464655
+颜佩韦 11.5027823792
+抗氧化剂 10.2897597393
+引人关注 9.89334446674
+鼓儿词 13.900677652
+氨苯砜 12.8020653633
+自相矛盾 9.75754292558
+一亿两千万 12.5143832909
+李阎王 9.94943393339
+裴松之 11.598092559
+比徐爵 13.900677652
+意见 5.87810870499
+房院 13.900677652
+腹足类 11.3357282945
+办成 9.06439574502
+丝虫病 10.9562386728
+柳叶黄 13.2075304714
+默哀 11.0674643079
+妖冶 11.5027823792
+三步走 10.604840786
+陈修园 12.5143832909
+埋置 12.1089181827
+九折 11.1280889297
+金刚怒目 12.2912397395
+全能冠军 11.8212361103
+纸鹤 13.900677652
+北方佬 13.900677652
+专业户 10.4666904475
+总政治部 10.0940151622
+经济型 10.1871055853
+柳州 9.20932976975
+双组分 12.5143832909
+古杰兰 12.8020653633
+李铁夫 13.2075304714
+暂代 12.1089181827
+该馆 9.87532596124
+昌益 13.2075304714
+疾病防治 12.2912397395
+反物质 12.5143832909
+马尼亚 11.1926274509
+色胆包天 12.5143832909
+草酰乙酸 13.900677652
+金石家 13.2075304714
+金蝉长老 11.8212361103
+谈瀛洲 9.7898037878
+由献忠 13.2075304714
+漫游 9.29550746599
+安乃德 13.900677652
+昌盛 9.6811699468
+季亚族 13.900677652
+商道 10.9562386728
+雷顶 13.2075304714
+各界人士 9.96885201925
+生物战剂 10.765183436
+低于正常 10.0940151622
+弘教 12.2912397395
+二道河 12.8020653633
+装载量 10.8096351986
+弃子 11.9547675029
+空仔 13.2075304714
+天雄哥 13.2075304714
+企业基金 12.5143832909
+大圆 10.0720362555
+素昧平生 11.4157710022
+乐利 13.2075304714
+略见 11.8212361103
+弃学 11.9547675029
+府绸 10.765183436
+治愈率 11.1926274509
+妙极 11.8212361103
+塌下去 11.9547675029
+延期付款 11.598092559
+蒋师仁 13.2075304714
+战略转移 10.7226238216
+名片设计 13.900677652
+动态显示 13.900677652
+避风塘 13.900677652
+拿班做势 12.8020653633
+福元宝 13.2075304714
+喷射性 12.8020653633
+胖娃 12.2912397395
+家乡风味 13.900677652
+水果市场 13.900677652
+朱砂 9.45802639549
+魄力 8.98069672615
+饲喂 10.8561552143
+马勺舀 13.2075304714
+装修门面 13.900677652
+李青 12.1089181827
+孙灏 13.2075304714
+任马 13.2075304714
+抓革命促 12.1089181827
+邓沙 12.5143832909
+时分多址 12.8020653633
+章孝严 13.900677652
+甜嘴蜜舌 13.900677652
+谈命理 13.2075304714
+宛平城 11.4157710022
+渔网 9.82314020807
+舞动 9.94943393339
+信手拈来 11.598092559
+德兴市 12.1089181827
+马振海 12.5143832909
+出口额 9.28555713513
+希罗多德 10.604840786
+劳恩凯 13.2075304714
+漫流 10.3743171274
+刘敏 11.3357282945
+三花脸 12.8020653633
+关索杨 11.8212361103
+时装模特 12.1089181827
+舞剑 9.94943393339
+刹闸 13.2075304714
+黑木 11.5027823792
+捉刀 13.2075304714
+商郊 12.2912397395
+蓬莱阁 11.4157710022
+说白了 9.59661255877
+抛离 11.8212361103
+捉到 9.15574552361
+托管 8.02014466558
+商都 9.18217878068
+弘旺 10.9049453784
+喜恶 13.900677652
+港澳台地区 13.2075304714
+管点 13.2075304714
+骗线 13.900677652
+加碘盐 12.5143832909
+日渐式微 13.2075304714
+三原色 11.4157710022
+舞剧 9.30555780184
+办得更好 13.900677652
+交管部门 11.4157710022
+取景框 13.900677652
+弃守 11.5027823792
+晴岚 12.5143832909
+米万钟 13.2075304714
+个中滋味 12.8020653633
+底气十足 11.5027823792
+多愁 12.5143832909
+鄂硕 11.598092559
+弃官 10.1394775363
+可溶性 9.63799777493
+鹿成群 13.900677652
+舞刀 10.5684731418
+强电解质 12.5143832909
+赶排 12.2912397395
+金鸡奖 10.5684731418
+一亿多 11.598092559
+冰糖水 13.900677652
+锡矿山 10.604840786
+稀泥 11.5027823792
+显示仪 11.4157710022
+火窑 13.900677652
+权倾天下 11.7034530746
+返老还童 11.5027823792
+燕禁卫 13.2075304714
+阳原县 11.598092559
+黄冈县 12.5143832909
+下雨天 10.7226238216
+梅利特 13.2075304714
+柔声道 11.3357282945
+心慌意乱 9.77354326693
+寒凝 10.7226238216
+横蛮 11.7034530746
+弃家 10.9562386728
+渔翁 10.1871055853
+抛砖 12.8020653633
+朱祖 13.2075304714
+口出秽言 13.2075304714
+极坏 11.1280889297
+易贡藏布 12.1089181827
+量人为出 13.900677652
+艋舺 11.9547675029
+服务态度 11.1280889297
+吴思远 13.900677652
+完钻 13.2075304714
+直眉瞪眼 12.8020653633
+舞台 7.34959731693
+飞回来 11.7034530746
+川庆喜 12.5143832909
+避风头 13.900677652
+古稀之年 11.8212361103
+从福临 12.8020653633
+收盘价格 9.27570483869
+刻苦自励 12.8020653633
+狭隘性 12.8020653633
+科名 11.8212361103
+弃婴 11.7034530746
+国理民 12.5143832909
+动一动 9.94943393339
+评功摆好 12.5143832909
+黎国荃 12.5143832909
+极圈 12.8020653633
+句法结构 12.8020653633
+压好 12.1089181827
+留香 11.7034530746
+维和 9.96885201925
+需肥量 13.2075304714
+调情 10.2630914922
+扛下 13.900677652
+高个儿 11.1926274509
+舞厅 10.4041700905
+六百万两 13.2075304714
+恶狠狠 8.99540287354
+拈酸吃醋 13.2075304714
+檀弓 12.5143832909
+科员 10.642581114
+风流蕴藉 13.2075304714
+万多美元 12.1089181827
+极地 8.82550383674
+金川区 13.2075304714
+殿下 8.82550383674
+路统军 12.8020653633
+撬锁 12.2912397395
+殉难者 11.7034530746
+普拉河 13.900677652
+锁链 9.72629038208
+最惨 10.8096351986
+聚光器 12.5143832909
+亢旱 13.2075304714
+八十七 12.5143832909
+晴川 12.1089181827
+一千余万斤 13.2075304714
+略表 11.8212361103
+说干就干 10.9049453784
+苑川 11.5027823792
+农工党 12.5143832909
+撰写 7.72481038187
+会议主题 12.5143832909
+围场县 13.2075304714
+口味 8.48457724977
+恩人 9.33632946051
+春秋时期 8.74162235276
+邵太太 12.5143832909
+商量 6.49033055415
+魏悼子 12.8020653633
+莫奇卡 13.900677652
+行好 12.1089181827
+意识 6.38424434906
+乔乔 12.8020653633
+迷你 9.96885201925
+广东省高级人民法院 13.900677652
+机械设备 7.96314144689
+销售方 13.2075304714
+五更天 11.3357282945
+不幸遇难 12.2912397395
+摩尔根 10.2630914922
+意译 9.94943393339
+刘门 13.900677652
+好人好事 12.1089181827
+乔丽 13.900677652
+伦琴 10.3453295905
+邓派 12.8020653633
+赶紧 6.30982552829
+布见卓 13.2075304714
+耶律斜轸 11.1280889297
+两千多名 12.5143832909
+专业性 9.23723855786
+站不起来 10.9562386728
+衣带 10.8561552143
+苏园笑 12.8020653633
+慈禧微微 12.8020653633
+创见性 12.5143832909
+朱禄 11.5027823792
+卑词厚礼 13.2075304714
+六千六百八十六万元 13.2075304714
+装修费 13.900677652
+黑松 11.9547675029
+郢州 11.1926274509
+重足而立 13.900677652
+秘密社会 13.2075304714
+布尔斯 13.900677652
+特尔福德 13.2075304714
+剧场版 13.900677652
+德尼斯 13.900677652
+并合 10.9049453784
+两千多吨 13.2075304714
+于兴平 12.8020653633
+完整无损 12.1089181827
+并同 9.62401153296
+多尔曼 12.8020653633
+北海舰队 10.1164880181
+女选手 13.2075304714
+沦入敌手 13.900677652
+绰尔河 11.2616203224
+直教人 13.900677652
+并吞 9.82314020807
+中华人民共和国财政部 13.900677652
+抨击 7.97642185456
+确诊 8.06586691491
+专职干部 13.900677652
+露水河 12.5143832909
+确证 10.4994802703
+安诺本 13.900677652
+意象 10.2117981979
+油迹 12.1089181827
+两制 11.9547675029
+喇嘛寺 11.9547675029
+旧臣 9.56994431169
+娉婷 12.1089181827
+法学专业 12.8020653633
+黄猫峡 12.8020653633
+相生相克 11.1280889297
+怯惧 12.1089181827
+略述 12.5143832909
+白雪红梅 12.5143832909
+锰酸钾 13.2075304714
+唐贾公 12.1089181827
+上下级 10.3743171274
+张顺早 12.8020653633
+屯溪 10.7226238216
+驶过 9.59661255877
+地籍图 13.900677652
+两千多只 13.2075304714
+卢龙道 12.8020653633
+驶近 10.9562386728
+掬水 12.5143832909
+晶体 7.4855806928
+草寇 9.82314020807
+富得溢 13.2075304714
+油运 9.82314020807
+驶进 10.0088573539
+组合装 13.900677652
+签订协议 9.6811699468
+七四年 13.900677652
+离谱 9.21854642485
+实心球 13.2075304714
+罢斥 11.0674643079
+钻戒 11.2616203224
+红眼病 12.5143832909
+真情实意 12.2912397395
+六亲 12.5143832909
+空泡 10.9049453784
+二亿二千三百万 13.900677652
+暖气 8.83808261895
+野禽 11.598092559
+鄂绒 13.900677652
+算子 10.4666904475
+真情实感 11.1926274509
+非必要 12.1089181827
+算学 10.1394775363
+袁绍之 11.5027823792
+商阳 12.2912397395
+描绘出 10.3171587135
+淑静 13.2075304714
+大王子 11.8212361103
+确认 6.53803238156
+确论 13.900677652
+十粒 13.900677652
+暖水 10.6818018271
+发行版 11.0674643079
+老叔休 13.2075304714
+心如止水 11.7034530746
+清太宗 10.4994802703
+意谓 11.0674643079
+极值 10.0720362555
+科协 11.1926274509
+单色性 11.4157710022
+珞巴族 10.8096351986
+油轮 9.59661255877
+维南 12.5143832909
+多招 12.8020653633
+顺流而下 10.1871055853
+燃爆 13.2075304714
+朱统 10.0088573539
+油车 13.2075304714
+维华 13.900677652
+疼痛感 11.3357282945
+竹溪县 12.5143832909
+略轻 12.5143832909
+气锤 13.900677652
+丁军门 10.8561552143
+辩护者 13.2075304714
+袁绍二 12.5143832909
+漫步 9.56994431169
+乱盖 12.8020653633
+沉湎酒色 11.1926274509
+任鲁 12.8020653633
+返复 12.8020653633
+笑哈哈 11.7034530746
+专业村 12.8020653633
+心绪如麻 13.900677652
+蟾蜍 9.33632946051
+盼头 10.6818018271
+敷面 12.5143832909
+标致 9.30555780184
+散热片 12.5143832909
+李嘉欣 11.4157710022
+好个屁 12.5143832909
+女服务员 10.765183436
+咳得 12.5143832909
+枣泥 10.8096351986
+老夫老妻 11.4157710022
+北京故宫 10.4666904475
+留鸟 11.4157710022
+金中都 10.7226238216
+广泛应用 7.76511276089
+朱纱 13.2075304714
+一九四五年 11.2616203224
+兴化县 12.1089181827
+雷天心 13.2075304714
+六七尺 12.5143832909
+南五祖 12.8020653633
+紫葡萄 13.900677652
+百舸争流 13.2075304714
+利格尼 13.2075304714
+赶程 13.2075304714
+热门话题 10.4041700905
+行头 9.93038573842
+太尉陈 13.2075304714
+老虎灶 11.9547675029
+朱红 9.54396882529
+兵家必争 12.8020653633
+贻误战机 10.9562386728
+李先生 9.0884932966
+盼复 13.900677652
+龙山镇 12.1089181827
+朱纯 13.900677652
+雨量站 12.5143832909
+暖流 9.00283785202
+十几门 12.1089181827
+唱腔 8.97342396682
+朱罗 12.1089181827
+差得远 10.4994802703
+涎言涎语 13.900677652
+维勒 10.9049453784
+离心力 10.0088573539
+南沙群岛 9.75754292558
+玄化潜 13.2075304714
+令人 6.30127631856
+双鬓 11.598092559
+科利 11.8212361103
+进退无路 11.4157710022
+科别 13.900677652
+布迪 13.900677652
+补锅匠 13.900677652
+十几间 11.8212361103
+石秀诗 13.900677652
+科刑 12.2912397395
+弘扬 9.21854642485
+木德星 13.900677652
+徐龙 13.900677652
+九十七个 13.2075304714
+白板说 12.2912397395
+钱乙 12.5143832909
+万源县 13.2075304714
+牛书道 10.2371160058
+极具 8.69119149913
+极其 6.92807140067
+作声 10.0720362555
+富哈尼 12.2912397395
+忙忙地 11.9547675029
+安息 8.98802276624
+轴浆流 13.900677652
+墨里勒 13.2075304714
+酱汁 11.598092559
+丙氨酸 11.2616203224
+克多伦 13.2075304714
+喷射机 13.2075304714
+张日 13.900677652
+郭松义 12.2912397395
+古维语 13.2075304714
+慰问金 11.9547675029
+舞钢市 12.8020653633
+课堂气氛 13.2075304714
+黑枣 12.2912397395
+事机 11.0103058941
+曾公亮 11.4157710022
+不容置辩 11.598092559
+链反应 11.3357282945
+酱汤 12.8020653633
+庾家村 12.8020653633
+乱相 13.2075304714
+萨尔瓦多 10.0294766411
+托米 12.8020653633
+脱贫 11.1926274509
+并力 9.36807815882
+汗珠子 11.0674643079
+枢纽港 11.5027823792
+心理系 12.5143832909
+透心凉 12.1089181827
+发胀感 13.900677652
+伦特 13.2075304714
+一亿年 13.900677652
+令严 11.7034530746
+气象站 10.1871055853
+赖东 13.900677652
+热固性 10.9049453784
+米市 11.1926274509
+经济史 9.63799777493
+实用价值 9.6811699468
+剽劫 12.8020653633
+商音 13.2075304714
+杂文集 11.7034530746
+酱油 9.43476953332
+施工期 11.3357282945
+童话剧 11.8212361103
+夏国初 12.8020653633
+严防死守 11.1926274509
+瘦瘦长长 12.8020653633
+违约 8.35160156708
+办事处 7.85804481829
+胸襟 10.0294766411
+学习曲线 12.5143832909
+小人国 11.5027823792
+事务长 11.1926274509
+孙夷男 13.2075304714
+洋嗓子 13.900677652
+戚谊 12.5143832909
+蔡夫人 10.9049453784
+挑唆 10.9049453784
+西维因 12.5143832909
+锋芒毕露 11.0674643079
+商鞅 9.56994431169
+除害兴利 12.5143832909
+军委总政治部 12.5143832909
+莫兹多克 13.2075304714
+重复性 10.9049453784
+水花生 13.2075304714
+残废军人 11.598092559
+饿莩遍野 13.900677652
+王大叔 12.2912397395
+卫四厢 12.2912397395
+极冠 12.2912397395
+地震预报 11.7034530746
+王慎中 12.5143832909
+青狮潭 13.900677652
+秦富功 11.1926274509
+立抚军 13.2075304714
+分级制 13.2075304714
+敷陈 13.2075304714
+夏邑 11.4157710022
+极冷 12.5143832909
+并列 8.11685246965
+多折 13.2075304714
+或缺 10.4994802703
+直截了当 9.27570483869
+凉水河 12.8020653633
+罪有应得 11.1280889297
+勇于探索 11.9547675029
+第四十九回 12.2912397395
+镭射 13.900677652
+钟肇鹏 13.2075304714
+授受不亲 13.900677652
+油路 11.1280889297
+初演 12.5143832909
+骗税 13.900677652
+计件 12.1089181827
+信不过 10.3743171274
+抵账 12.8020653633
+链罩 13.900677652
+稀树 11.4157710022
+李白成 10.9049453784
+徽班 11.1280889297
+并出 11.0103058941
+以致于 10.6818018271
+弗伦德 13.2075304714
+浮泛 11.9547675029
+以怨报德 12.5143832909
+戴绿帽子 12.1089181827
+徒逞 12.8020653633
+共栖 11.3357282945
+经营规模 10.0720362555
+愉快 7.51548325298
+哀告 9.89334446674
+感到痛苦 10.9562386728
+舞团 11.3357282945
+太白山 10.0720362555
+屯河 10.3453295905
+暖湿 10.4349417492
+播放器 11.4157710022
+大哗 10.604840786
+罗德里戈 13.2075304714
+科兴 10.8096351986
+一眨眼 9.61021821083
+科兹 13.2075304714
+唐至元 12.5143832909
+促织 10.533381822
+极刑 10.4349417492
+诚非 13.900677652
+武老二 12.8020653633
+桓鑫蘩 13.2075304714
+狗不理 11.8212361103
+二万余箱 13.2075304714
+安平君 13.2075304714
+吴亮平 13.2075304714
+世界舞台 11.8212361103
+国办发 11.8212361103
+纳浦尔 13.2075304714
+燃烧 7.00600761254
+郑霖 9.11318590919
+准考证 10.4349417492
+海南特区 13.900677652
+习颜 12.8020653633
+林晓培 13.900677652
+科克 10.4349417492
+择偶 10.604840786
+贪生恶死 13.2075304714
+两千多元 11.9547675029
+于荣府 13.2075304714
+并入 7.34389929582
+喜马拉雅山 8.66423568915
+不解之缘 10.9049453784
+万余次 13.900677652
+两百八十里 13.2075304714
+袁咏仪 12.5143832909
+四千余箱 13.2075304714
+实时操作系统 12.8020653633
+维克 10.9049453784
+旋踵 13.900677652
+旧药 13.2075304714
+线性化 11.7034530746
+花楼子 13.2075304714
+工会主席 11.1280889297
+加依尔 11.9547675029
+金兵渡 11.9547675029
+蒸汽熨斗 13.900677652
+凑个 10.9049453784
+扶弱抑强 13.900677652
+商银 13.900677652
+库蚊 11.9547675029
+实用技术 12.8020653633
+商铺 9.41204128224
+赵南起 13.900677652
+活泼可爱 11.3357282945
+维兰 13.900677652
+饲养 7.55328844232
+西喇木伦 13.2075304714
+赵光义 12.8020653633
+葵花子油 13.2075304714
+科内 11.7034530746
+房地产业 8.13235665618
+湘莲 10.9049453784
+青白玉 13.900677652
+汪胡桢 12.8020653633
+戴眼镜 9.98865464655
+油质 10.8096351986
+二道桥 12.8020653633
+张文岳 12.8020653633
+琳娜 11.8212361103
+灰雾 12.8020653633
+千禾夫 13.2075304714
+油费 11.7034530746
+清扫机 13.900677652
+湘菜 11.8212361103
+配菜 12.5143832909
+离身 10.7226238216
+极力 7.75649201785
+瘙痒 9.58318953844
+链群 13.900677652
+剧名 11.8212361103
+袅袅娜娜 11.3357282945
+夏国公 12.5143832909
+燃灯 11.5027823792
+长远规划 11.9547675029
+首邑 12.1089181827
+概括 7.46934657004
+古萧窑 12.8020653633
+由宋祁 13.2075304714
+技术活 12.8020653633
+脱身 8.14810501315
+车载船装 13.900677652
+奥利金 13.2075304714
+粤剧团 13.2075304714
+阴阳五行 10.0294766411
+多才 11.0103058941
+老人与海 12.1089181827
+石秀见 11.598092559
+草鸡 13.2075304714
+施工方 10.2897597393
+动作电位 11.3357282945
+跌打损伤 10.4994802703
+呈请 10.642581114
+国防科学技术工业委员会 12.8020653633
+著录 8.86372504956
+吃人肉 11.1926274509
+美特斯 11.1926274509
+输入量 11.7034530746
+离轨 12.5143832909
+平溪镇 12.8020653633
+范节级 13.2075304714
+苦味素 12.5143832909
+晴好 11.5027823792
+吉布斯 9.94943393339
+子午岭 11.598092559
+弘恭 12.2912397395
+日月食 11.8212361103
+垂直角 13.900677652
+麦考利夫 13.900677652
+香烟盒 12.8020653633
+小礼堂 11.3357282945
+遁入空门 11.2616203224
+尚志县 13.2075304714
+二十二只 13.2075304714
+脱轨 11.598092559
+民众团体 13.2075304714
+知人知面不知心 11.7034530746
+沈阳机床 9.01032852375
+大吼 9.38981814546
+包羞忍耻 13.900677652
+吃皇粮 12.5143832909
+弃市 10.7226238216
+陆良县 13.2075304714
+计件工资 10.1394775363
+商销 12.5143832909
+高智慧 12.8020653633
+科健 12.8020653633
+韦梅河 13.900677652
+极北 12.2912397395
+极化 9.61021821083
+张旺 12.8020653633
+第二十二位 13.900677652
+要素 6.81728980435
+海南特别 13.900677652
+夜饭 11.2616203224
+普拉梯 13.900677652
+要紧 7.24138373229
+模型库 13.2075304714
+努力做到 11.0103058941
+于善德 12.5143832909
+晴天 9.26594866375
+旋进 10.8096351986
+陷入绝境 11.3357282945
+百分之三十六 12.8020653633
+踩点 10.7226238216
+舞坛 13.2075304714
+于丹墀 12.2912397395
+远见卓识 10.5684731418
+十几面 13.2075304714
+大材小用 12.1089181827
+盛暑 11.3357282945
+三重奏 11.4157710022
+神仓颉 13.2075304714
+尼维斯岛 12.8020653633
+垛子 11.7034530746
+农工商 10.7226238216
+何忍 11.8212361103
+昌炽 12.5143832909
+赫尔巴特 11.7034530746
+刘晏之 12.8020653633
+傅秋涛 12.8020653633
+银柴胡 13.2075304714
+极口 12.1089181827
+试图用 9.96885201925
+贤哲 11.7034530746
+极可 13.900677652
+巡风 12.8020653633
+仰面 9.34680076038
+三百五十斤 13.2075304714
+极右 11.1280889297
+伟大旗帜 10.7226238216
+卑怯 11.4157710022
+蜂腰猿背 13.900677652
+办好事 11.2616203224
+鸡蛋清 11.598092559
+司令官 9.44633035572
+伸长率 11.598092559
+邓椿 13.2075304714
+显著特点 9.94943393339
+刹那 10.2371160058
+下有苏杭 13.2075304714
+旧船 11.7034530746
+旋转 7.24138373229
+贝斯基 13.900677652
+笑了起来 8.52539924429
+自我概念 13.900677652
+方胜 12.5143832909
+穿云裂石 13.900677652
+舞场 11.5027823792
+股东会 9.91169360541
+略谈 12.1089181827
+卢希亚 12.5143832909
+燃煤 9.71102290995
+个人消费 8.59240995457
+吐过 13.900677652
+普拉格 13.2075304714
+汞灯 11.7034530746
+府第 10.0505300503
+十九日 9.62401153296
+托维 13.900677652
+独特型 13.2075304714
+大君 11.4157710022
+法律案 11.9547675029
+廖化欲 13.2075304714
+苔藓 8.86372504956
+保龄球场 12.5143832909
+掩鼻而过 13.900677652
+古代人 9.85762638414
+伦德尔 12.2912397395
+变则通 12.5143832909
+王经之 13.2075304714
+出版业务 11.8212361103
+情天孽海 13.900677652
+哈药集团 12.8020653633
+死者家属 10.2630914922
+贾政心 13.2075304714
+腾飞 9.66657114738
+湘财 10.0294766411
+离聚 13.900677652
+戚臣 12.8020653633
+弃养 13.2075304714
+汉文武 13.2075304714
+跪伏 10.2897597393
+油菜 8.20694551317
+蛮不讲理 11.3357282945
+年近花甲 11.8212361103
+任选 10.4041700905
+林周县 13.2075304714
+离职 8.55834340001
+杯盘狼籍 13.900677652
+子其子 12.8020653633
+置于 7.72066099832
+气象学家 10.2117981979
+侠溪 13.900677652
+丧妻 11.9547675029
+经济带 10.8096351986
+极小 8.46695564842
+极少 7.83689244329
+精品下载 13.900677652
+逐步推进 10.4041700905
+老一套 10.6818018271
+陈瑞华 13.2075304714
+并往 12.2912397395
+苔草沼泽 12.5143832909
+经济师 9.93038573842
+维德 11.2616203224
+底比斯 10.3171587135
+氯霉素 10.604840786
+齐王求 13.2075304714
+弃儿 11.598092559
+周善 12.5143832909
+尔帕 13.900677652
+极尽 9.54396882529
+十几颗 11.8212361103
+戴天子 13.2075304714
+司令员 7.46934657004
+屯戍 10.8561552143
+缺德事 12.2912397395
+该部 9.93038573842
+科德 10.642581114
+金玉良言 12.5143832909
+诛心之论 13.2075304714
+万源市 13.900677652
+低脂肪 10.8096351986
+十几项 12.8020653633
+托熟 13.900677652
+库玛丽 12.8020653633
+作壁上观 10.8096351986
+离心式 11.1280889297
+梁与晋 13.2075304714
+十几页 12.2912397395
+四瓣花 13.900677652
+打捞到 12.5143832909
+脱胶 12.2912397395
+着陆点 12.8020653633
+桃花扇 10.3743171274
+倚靠 10.5684731418
+江绍贞 12.1089181827
+太傅府 13.2075304714
+自流灌溉 11.2616203224
+旋耕 11.8212361103
+气闷 10.5684731418
+置买 11.3357282945
+大难不死 11.3357282945
+配药 11.0103058941
+烈焰腾空 12.8020653633
+屯扎 9.91169360541
+拽起 10.3453295905
+朝鲜劳动党 11.5027823792
+经济庭 13.900677652
+保泰松 12.8020653633
+脱肛 10.9049453784
+诗句 8.98802276624
+云梦山 12.8020653633
+旧货 10.7226238216
+旧账 10.765183436
+置业 7.65651075131
+野田 11.9547675029
+油茶 8.58255765813
+徒拥虚名 13.900677652
+瞒住 10.4666904475
+张挂着 13.900677652
+山头主义 13.2075304714
+办事员 10.642581114
+霉味 11.1926274509
+厚嘴唇 10.9562386728
+要犯 10.1871055853
+铙钹 11.1280889297
+证验 13.900677652
+维尔京群岛 10.9562386728
+野生 8.00078029839
+斯蒂芬尼 13.900677652
+积福 13.2075304714
+诺恩 13.2075304714
+科取士 11.7034530746
+隋置武 12.8020653633
+宫面圣 13.2075304714
+鸡毛信 11.9547675029
+稀有 8.78868986362
+鄂王 11.9547675029
+八哥儿 13.2075304714
+假以时日 10.8096351986
+凄楚 9.71102290995
+稀朗 13.2075304714
+黑刺李 13.900677652
+盛先生 13.900677652
+并建 10.7226238216
+乌勒格 13.900677652
+二轻局 13.900677652
+堂堂之阵 13.2075304714
+当今世界 9.06439574502
+深交所 6.824868788
+闲下来 10.5684731418
+置信 10.2117981979
+临洮县 12.1089181827
+艾顿 12.8020653633
+鞠城 13.900677652
+各行其事 12.2912397395
+科布 12.8020653633
+二三起 13.900677652
+舞姬 11.0103058941
+高个子 9.77354326693
+跪下 6.91967191125
+林之孝 10.0940151622
+执法不阿 13.2075304714
+肥大 8.76487921493
+很久 7.61841090508
+伦纳 12.1089181827
+美貌 9.06439574502
+感恩图报 11.1280889297
+科幻 10.7226238216
+暖意 9.58318953844
+脱脂 11.0103058941
+油花 11.9547675029
+四十块 12.2912397395
+伦纪 13.900677652
+忠烈祠 12.2912397395
+兴化市 12.2912397395
+脱脱 10.0940151622
+旋臂 10.533381822
+于基民 12.8020653633
+吴用唤 12.8020653633
+巡阅 11.2616203224
+诤友 12.1089181827
+渔人之利 11.9547675029
+贮水 11.3357282945
+男耕女织 11.9547675029
+须曾闻 13.2075304714
+发行网 11.0103058941
+野玫瑰 11.8212361103
+诺思 11.8212361103
+动景运动 13.900677652
+好久没 10.7226238216
+维度 10.4994802703
+抛物 11.598092559
+旧貌 11.598092559
+稀松 10.8096351986
+强硬措施 11.9547675029
+魏入楚 13.2075304714
+关门打狗 13.900677652
+评评 11.2616203224
+一组组 12.5143832909
+籼稻 10.9562386728
+文成帝 11.5027823792
+受灾面积 12.5143832909
+评话 10.533381822
+三十三万 13.900677652
+宗程朱 13.2075304714
+六百多种 13.2075304714
+双工器 13.900677652
+黄梨洲 13.2075304714
+喷气式 9.33632946051
+赶着 8.23771717184
+遮脸 12.5143832909
+评语 9.87532596124
+极左 10.4666904475
+桂世镛 13.900677652
+完全保密 13.900677652
+邓村 13.900677652
+舞女 10.4666904475
+和复社 12.2912397395
+脱臼 11.5027823792
+极差 10.0505300503
+蝼蛄 10.642581114
+两千多年 10.1394775363
+光密度计 13.900677652
+好铁 13.2075304714
+评说 10.5684731418
+链烃 11.8212361103
+脱臭 12.8020653633
+捕鱼 8.42421410004
+马望东 12.5143832909
+宗主国 10.0294766411
+刘士祯 13.2075304714
+活多久 12.8020653633
+专利费 13.2075304714
+为尊者讳 13.900677652
+客运车辆 12.2912397395
+油船 10.2897597393
+酬宾 13.2075304714
+满目疮痍 11.9547675029
+信任感 10.9049453784
+朱玉 10.3743171274
+阿纳多卢 13.900677652
+庄生梦 13.900677652
+评议 9.20019728618
+捉奸 10.642581114
+朱玲 13.2075304714
+廿四 12.8020653633
+上少安 12.8020653633
+巡视组 12.1089181827
+岫岩 10.4349417492
+何倚 13.2075304714
+钢琴演奏 11.2616203224
+鹰隼 11.3357282945
+吉奥克 13.2075304714
+评论 6.77700486677
+太白县 12.1089181827
+蝼蚁 10.8561552143
+一亿分 13.2075304714
+扰动 8.76487921493
+帐面价值 12.8020653633
+鬼怪式 13.2075304714
+一言兴邦 13.900677652
+塑料玩具 12.2912397395
+维州 11.9547675029
+胃蛋白酶 11.0674643079
+弘济 11.9547675029
+董二人 12.1089181827
+贾科梅 13.2075304714
+候机楼 11.0103058941
+仰高 13.900677652
+暖手 11.598092559
+出口部 13.900677652
+旧迹 11.8212361103
+胡子微微 13.2075304714
+王庆兄弟 13.2075304714
+明党参 12.5143832909
+危而复 12.5143832909
+产业革命 9.58318953844
+踏脚板 13.900677652
+保险金额 11.2616203224
+立武氏 12.8020653633
+文武全才 11.0674643079
+庄巧生 13.2075304714
+图们江 9.80633308975
+萤火 11.5027823792
+脱色 10.2371160058
+朱灵 11.598092559
+起劲儿 11.8212361103
+山雨欲来风满楼 10.9562386728
+王正中 11.598092559
+经济局 13.2075304714
+点唱 12.8020653633
+千回万转 13.2075304714
+湖塘镇 13.2075304714
+王子安阳 13.2075304714
+徐邈 13.2075304714
+从少安 12.8020653633
+水火土 13.2075304714
+极广 9.41204128224
+甜言美语 12.8020653633
+吐艳 12.2912397395
+任茂东 12.5143832909
+破口大骂 9.44633035572
+猛增 8.50251495046
+裙带关系 12.8020653633
+糖酒 10.9049453784
+徐郡 12.8020653633
+受益人 10.2117981979
+穆如清风 13.900677652
+张文倬 13.2075304714
+第四路 12.8020653633
+左道派 13.900677652
+粮食价格 9.82314020807
+算啦 10.0088573539
+算啥 11.3357282945
+好生生 11.8212361103
+普拉斯 11.7034530746
+油膏 10.4349417492
+孤鸿 12.8020653633
+转瞬之间 11.5027823792
+油膜 10.8561552143
+文学知识 13.900677652
+苦留 10.5684731418
+职业女性 11.0674643079
+撑过来 12.1089181827
+无题诗 13.2075304714
+友好使者 13.900677652
+吐芳 13.2075304714
+托管人 10.0294766411
+无本万利 12.2912397395
+汉城奥运会 12.2912397395
+愿不愿意 10.1394775363
+糖醇 12.1089181827
+利哈乔夫 13.2075304714
+契券 11.7034530746
+尚志市 11.9547675029
+糖醋 11.9547675029
+该当何罪 11.7034530746
+惊世骇俗 11.0674643079
+吐芽 12.5143832909
+旧车 9.44633035572
+油腻 9.27570483869
+山岩刻 13.2075304714
+旧寨 12.2912397395
+朱仙庄 12.8020653633
+糖醛 12.5143832909
+捕鼠 10.6818018271
+北河沿 13.2075304714
+通共 10.642581114
+叙永县 13.900677652
+含笑而终 13.900677652
+佳乐水 13.2075304714
+唐小姐 11.5027823792
+永载史册 13.900677652
+夏国崇 13.2075304714
+甘兴霸 12.5143832909
+歌唱者 12.5143832909
+祝朝奉 11.2616203224
+马兹鲁 13.900677652
+舞娘 13.900677652
+评定量表 12.5143832909
+胆囊炎 10.6818018271
+远东地区 10.5684731418
+换下来 11.0103058941
+词不达意 12.5143832909
+天文系 13.2075304714
+天说 10.2371160058
+商颂 11.9547675029
+脱节 9.98865464655
+科工 10.2897597393
+链环 12.2912397395
+贝第斯 13.900677652
+刘注似 13.900677652
+喷雾剂 12.1089181827
+山东泰山 12.2912397395
+费心劳力 13.2075304714
+极度 7.75864024639
+饼肥 13.900677652
+输油管线 11.5027823792
+导演奖 9.93038573842
+侠气 12.2912397395
+欠税款 13.900677652
+要点 8.23425096386
+图坦哈蒙 12.1089181827
+民族解放 9.71102290995
+额尔克 12.5143832909
+万世安 12.8020653633
+塑化 11.598092559
+国家测绘局 13.900677652
+居之城 12.5143832909
+宁杭 12.1089181827
+科尼 10.4349417492
+相邦仪 12.5143832909
+鳌山 10.1394775363
+杨得志 11.598092559
+游伴 13.900677652
+实时性 11.8212361103
+科尔 9.77354326693
+内分泌学 11.9547675029
+是可忍 11.3357282945
+向春川 13.900677652
+断魂 12.2912397395
+盛明 13.2075304714
+略胜 12.2912397395
+岗头 11.598092559
+诺托 13.2075304714
+冯云 12.5143832909
+掌中珠 11.7034530746
+梳发 13.900677652
+烟蓑雨笠 13.900677652
+变频器 10.9562386728
+居蒙蒂 13.2075304714
+连皮带肉 12.1089181827
+冯亭 12.5143832909
+打网球 11.598092559
+邓斯 12.2912397395
+净业 12.5143832909
+磁记录 11.0674643079
+青凤 12.2912397395
+习近平 9.91169360541
+集体企业 10.7226238216
+艰苦朴素 11.5027823792
+朱然 11.2616203224
+立刘言 13.2075304714
+桂墩 13.2075304714
+科局 13.900677652
+托特 12.2912397395
+蔷薇科 10.0294766411
+安慧 12.8020653633
+社科 11.8212361103
+妙思 13.900677652
+算命 9.15574552361
+极强 8.81308131674
+邓文 12.8020653633
+歪风邪气 12.2912397395
+车营 12.5143832909
+一误再误 13.900677652
+实属无奈 11.2616203224
+下断语 13.900677652
+炖鸡汤 13.900677652
+长江黄河 13.2075304714
+邮递员 10.5684731418
+孤孤凄凄 12.8020653633
+鳌峰 13.900677652
+躺下去 10.2897597393
+稀料 13.900677652
+蝙蝠侠 13.900677652
+邓敦 13.900677652
+预警飞机 13.2075304714
+弘法 11.3357282945
+梁折柱 13.900677652
+诺拉 13.900677652
+极快 9.33632946051
+彬彬有礼 10.2371160058
+生得明 13.900677652
+沃尔特 10.2117981979
+非本意 13.900677652
+维山 12.5143832909
+劳恩堡 12.2912397395
+商业来往 13.900677652
+净价 11.3357282945
+水里游 11.7034530746
+冲积土 10.4994802703
+停尸房 11.5027823792
+孤鹤 10.2897597393
+许尧佐 13.900677652
+无可避免 10.8561552143
+科峰 13.900677652
+书系 12.2912397395
+说穿 10.4041700905
+俄新社 13.900677652
+维尔 9.43476953332
+褒衣博带 12.5143832909
+链状 10.4349417492
+颜丹 13.2075304714
+契卡 11.4157710022
+北向东 13.2075304714
+贫困者 11.7034530746
+云贵川 12.2912397395
+维尼 11.4157710022
+满勤 13.900677652
+商务部长 10.9049453784
+技术性 7.91674137129
+由厄尔 13.900677652
+极微 11.0674643079
+三重唱 12.8020653633
+弘治 9.33632946051
+卢明月 12.5143832909
+清营凉 12.5143832909
+茅顶 12.8020653633
+或然 12.1089181827
+翁布里亚 13.900677652
+投案自首 11.1280889297
+一死了之 11.7034530746
+油耗 8.71889410168
+安肃州 13.900677652
+自贸区 11.3357282945
+泼下去 12.8020653633
+种族政策 13.2075304714
+托克托县 11.2616203224
+食味 13.900677652
+能源开发 10.1394775363
+博古架 12.5143832909
+刘少奇 9.15574552361
+世纪末 6.8106008162
+鄂皖 11.2616203224
+托生 10.6818018271
+施瑞伯 13.2075304714
+风化壳 10.3453295905
+北霍鲁 12.2912397395
+悦乐 13.900677652
+唤回 10.8096351986
+诺敏 12.2912397395
+吸水能力 12.8020653633
+邓拓 11.4157710022
+亚历山 12.8020653633
+胸胁 10.642581114
+烹调师 13.2075304714
+所见即 13.2075304714
+间谍活动 12.2912397395
+旧观 11.598092559
+生产日期 10.604840786
+风雪交加 11.9547675029
+著名 5.75919661052
+强迫症 11.9547675029
+推广会 13.900677652
+魏昭子 12.8020653633
+崔琰 13.2075304714
+科学 5.57755476439
+并不比 9.36807815882
+脚数 12.8020653633
+凭证式 10.2371160058
+揭盖子 13.900677652
+算卦 9.5186510173
+担架 9.17328983326
+愈长 11.2616203224
+胸肌 11.3357282945
+运城 10.0940151622
+脱落 8.11378027061
+嫩江省 12.5143832909
+浦仓栈 13.2075304714
+菲奇 12.2912397395
+湘西 8.24468584116
+布兰夏 13.2075304714
+唐至宋 12.2912397395
+屯昌 11.8212361103
+徐阶 9.80633308975
+金马奖 10.5684731418
+求助者 13.900677652
+政工干部 13.900677652
+弘毅 11.1280889297
+青冷 12.1089181827
+第四十九届 13.2075304714
+科室 10.0720362555
+占地面积 9.07236391467
+戍守边疆 13.900677652
+潘公自 13.2075304714
+吉林省延边朝鲜族自治州 11.9547675029
+几节课 12.5143832909
+萨尔斯堡 13.900677652
+执黑 11.9547675029
+神仙鬼怪 13.2075304714
+鸠夺鹊巢 13.900677652
+折纸 11.9547675029
+科宁 13.900677652
+托疾 11.8212361103
+五百公里 13.2075304714
+绿叶 9.16447920358
+并存 8.21031819765
+契合 9.46986085313
+赶牛 13.2075304714
+英超球 13.900677652
+诺斯 10.5684731418
+徐陵 11.7034530746
+原田 12.2912397395
+悦人 12.1089181827
+稀拉 13.2075304714
+托病 10.4666904475
+猛士 11.598092559
+福佬话 13.2075304714
+筏基 13.900677652
+留队 13.900677652
+宽以待人 13.900677652
+朱皋 13.2075304714
+欲哭无泪 10.8561552143
+抛石 11.3357282945
+同生共死 11.9547675029
+阿列克谢耶维奇 13.2075304714
+青冥 13.2075304714
+普适性 12.2912397395
+夏国存 13.2075304714
+拉普拉塔 10.4994802703
+汉兵亦 13.2075304714
+算号 13.900677652
+小仲马 11.598092559
+齿位 13.900677652
+赶明儿 10.533381822
+贝尔莫潘 12.5143832909
+立刘豫 13.900677652
+纳楚克 13.2075304714
+被絮 12.8020653633
+经济学 6.9780337605
+完骨 13.2075304714
+张次溪 13.2075304714
+匈牙利共和国 12.2912397395
+根深叶茂 12.5143832909
+硫糖铝 13.2075304714
+隐秘性 12.2912397395
+八十多亩 13.900677652
+水流声 12.1089181827
+朝更暮改 13.900677652
+穆桑代 13.900677652
+该镇 10.765183436
+胸臆 11.0103058941
+新发于硎 13.2075304714
+高新科技 11.5027823792
+命令式 11.598092559
+销售款 12.5143832909
+多少岁 12.8020653633
+极好 8.62256299275
+减笔字 13.900677652
+阿伯德 13.900677652
+党国元老 13.900677652
+社会性 9.40086798165
+极处 11.7034530746
+野炮 11.0674643079
+五月份 11.8212361103
+渔灯 13.2075304714
+渔火 11.598092559
+韦江州 13.900677652
+极多 9.11318590919
+气势恢弘 12.2912397395
+任镭 13.900677652
+扶摇直上 10.604840786
+胸膈 11.7034530746
+马老爷 12.5143832909
+积极支持 9.10488710638
+极大 6.3973880213
+五七百个 13.2075304714
+自治机关 11.3357282945
+西学东渐 12.1089181827
+积极思考 13.900677652
+枪身 10.533381822
+后浪推前浪 12.5143832909
+胸膛 8.43684584695
+捕风 11.9547675029
+哈耳琼 13.900677652
+胸膜 10.1871055853
+心有余悸 10.0940151622
+长津江 12.5143832909
+八十多件 13.900677652
+市公所 13.900677652
+脱离现实 11.3357282945
+此病 9.89334446674
+博通 10.7226238216
+站不住脚 10.0940151622
+揉碎 10.9562386728
+邓捷 13.2075304714
+尹吉甫 11.2616203224
+胸腺 10.0720362555
+乌拉圭东岸共和国 13.900677652
+胸腹 10.0088573539
+旧衣 11.4157710022
+行客 11.9547675029
+宋元诸 11.598092559
+旧街 12.8020653633
+空海 11.0674643079
+连平儿 12.8020653633
+献血 10.3453295905
+无价之宝 10.6818018271
+徐震 13.2075304714
+锅盖头 13.900677652
+胸腔 9.18217878068
+令人敬畏 11.5027823792
+喷气孔 11.5027823792
+胸脯 8.18036587537
+横三竖四 12.5143832909
+外乡 10.6818018271
+抛盘 9.44633035572
+不计报酬 13.2075304714
+有问必答 12.8020653633
+苹果花 12.5143832909
+东北亚地区 12.1089181827
+常熟人 10.642581114
+启蒙者 11.9547675029
+管接头 13.900677652
+胸脊 13.2075304714
+李福领 13.900677652
+茫昧 13.2075304714
+小卒 10.533381822
+公众 6.74294216773
+罗章龙 12.2912397395
+朱瞻 13.900677652
+一百二十 10.2897597393
+乌目山 12.8020653633
+成绩优良 13.900677652
+拉仁波 12.8020653633
+史家村 12.1089181827
+米奥 12.1089181827
+吴亮嗣 13.900677652
+维也纳 7.93453091285
+王船山 12.5143832909
+我佛 10.533381822
+艾克斯 11.9547675029
+倚重 9.21854642485
+冰壶 11.5027823792
+山重水复 11.7034530746
+尚不明 12.8020653633
+瓦克斯 12.5143832909
+公休 11.3357282945
+任大人 12.8020653633
+该院 8.71329184614
+劳动模范 10.1630080337
+中尺度 11.4157710022
+科大 11.4157710022
+调酒师 13.2075304714
+贡举 11.5027823792
+旧诗 11.0674643079
+某年 11.9547675029
+卖东西 10.7226238216
+魏延解 12.8020653633
+西式婚礼 13.2075304714
+旧话 11.2616203224
+词谱 12.8020653633
+渔猎 8.92394390956
+旧识 11.4157710022
+容物耶 13.2075304714
+护守 12.2912397395
+元景仲 13.2075304714
+安抚住 13.900677652
+托着 9.22784881751
+凄清 10.9049453784
+纯中药 12.1089181827
+公伤 13.900677652
+鳌头 12.2912397395
+若干员 12.8020653633
+大龙湫 12.1089181827
+两虎相争 13.900677652
+七步之才 12.5143832909
+胸花 12.2912397395
+料事如神 11.0674643079
+刘将爷 11.2616203224
+低龄化 11.598092559
+甘破蔗 13.2075304714
+经营范围 9.11318590919
+算入 12.2912397395
+野王 11.598092559
+矛盾加剧 10.8096351986
+匝数 11.598092559
+马耳他共和国 13.900677652
+过嘉轩 13.2075304714
+死亡证书 13.900677652
+该队 10.2897597393
+科奇 12.8020653633
+留钱 12.5143832909
+井冈山市 11.9547675029
+徐铉 11.3357282945
+货厢 12.5143832909
+花天酒地 10.4994802703
+排他性 10.5684731418
+雨香 13.900677652
+米高扬 11.598092559
+羊毛衫 11.5027823792
+任岩仓 13.2075304714
+邓恩 12.5143832909
+浑源县 11.9547675029
+吴国铸 13.900677652
+辜振甫 11.7034530746
+祥符调 13.900677652
+张玉书 12.8020653633
+工商会 13.900677652
+紧日子 11.5027823792
+咳嗽 7.39938798144
+黄埔军官学校 12.1089181827
+该集 12.5143832909
+艾克曼 13.2075304714
+过氧化钙 12.8020653633
+气体动力 13.2075304714
+蓟马 11.0674643079
+于宜宾 12.8020653633
+机动粮 13.900677652
+野猪 8.77671367257
+千亿美元 10.3743171274
+维多 11.3357282945
+石牌坊 10.8561552143
+康国 10.8561552143
+卡拉哈迪 12.8020653633
+水城县 12.8020653633
+刘少宇 12.2912397395
+编撰者 12.8020653633
+三十多公里 12.2912397395
+兰布卡 13.900677652
+个性化 8.98802276624
+建议书 9.98865464655
+神清气爽 11.1926274509
+并处 9.77354326693
+科委 11.9547675029
+杨举起 11.9547675029
+湘语 13.2075304714
+炸麻花 13.900677652
+鱼迹 12.5143832909
+李铁嘴 9.4233408375
+科姆 11.3357282945
+明眼人 10.3743171274
+算出 9.56994431169
+遭厄 13.900677652
+渔父 11.3357282945
+讨价还价 9.26594866375
+更漏 12.2912397395
+膏粱子弟 12.8020653633
+琼麻 13.2075304714
+该面 12.5143832909
+燃气灶具 13.900677652
+外丘 13.2075304714
+汗珠儿 12.8020653633
+野狼 11.0674643079
+数不胜数 10.2630914922
+八目鳗 13.900677652
+女星 10.0940151622
+史元道 13.2075304714
+月子病 11.9547675029
+窝里反 12.2912397395
+兄弟会 10.765183436
+留门 13.2075304714
+大篷车 11.8212361103
+要略 10.765183436
+心巧嘴乖 13.900677652
+文娱活动 11.598092559
+学书不成 13.900677652
+槌球 13.900677652
+借回去 13.900677652
+巡道 10.4349417492
+吴用听 11.9547675029
+评起 13.900677652
+完颜 9.85762638414
+步兵排 11.8212361103
+伯德金 13.2075304714
+野狗 9.96885201925
+壁洞 13.900677652
+奉贤县 12.8020653633
+野犬 13.2075304714
+说句实话 11.3357282945
+徐闻 11.1926274509
+黄冈市 13.900677652
+千百年来 9.98865464655
+电力设备 8.9308643524
+卞玉京 13.900677652
+霍加斯 13.2075304714
+正整数 10.1630080337
+巡逻 8.11685246965
+二氧化 11.5027823792
+钱顺堂 12.8020653633
+明仁孝 13.2075304714
+腾龙 12.1089181827
+严进宽 12.8020653633
+溴化锂 13.900677652
+科塔 11.5027823792
+潘璋部 13.2075304714
+要用 7.95787827685
+任静 11.598092559
+同步增长 10.9049453784
+森严 8.83177344976
+诺昂 13.900677652
+脱蜡 11.9547675029
+爱爱姑 12.8020653633
+擂台赛 12.2912397395
+打暗号 13.2075304714
+野物 10.1164880181
+两千万两 13.2075304714
+唱诗 11.598092559
+西莫诺夫 13.900677652
+维塔 11.2616203224
+极富 9.0884932966
+爱爱太 13.2075304714
+诺曼 10.642581114
+妇权 13.900677652
+望江楼 11.4157710022
+头功 10.3453295905
+黑布洋 13.900677652
+沁水县 12.5143832909
+唱词 9.56994431169
+捉弄 9.41204128224
+工商业 7.74581955796
+吊袜带 13.900677652
+外运发展 10.533381822
+流量计 11.8212361103
+姆林宫 12.8020653633
+波因特 13.2075304714
+画中画 13.2075304714
+纳什维尔 12.5143832909
+野牛 9.59661255877
+前些天 9.96885201925
+第五章 9.20932976975
+益王赵 12.8020653633
+端过来 11.2616203224
+枣林 10.9049453784
+楚云飞 13.900677652
+从少平 13.2075304714
+冗职 11.598092559
+奉贤区 13.900677652
+略萨 12.8020653633
+盼到 10.3171587135
+保民官 10.9049453784
+志祥 11.8212361103
+孟东野 12.2912397395
+恩重如山 11.5027823792
+舞弊 9.96885201925
+兄弟俩 9.28555713513
+阶级观点 12.2912397395
+舞弄 11.5027823792
+或用 8.65365357982
+公信 10.7226238216
+发行科 13.900677652
+邓愈 13.2075304714
+雅安地区 12.5143832909
+徐镇 13.900677652
+江裕泰 12.8020653633
+这具 9.66657114738
+魏尔伦 13.900677652
+馓子 12.1089181827
+荆轲入 12.8020653633
+专业班 12.8020653633
+该补 11.7034530746
+旧闻 10.5684731418
+离去角 10.8561552143
+马望城 13.2075304714
+起水泡 13.2075304714
+镗孔 13.2075304714
+地球表面 8.75318317516
+一夫一妻制 9.27570483869
+该行 7.41147272065
+左手掌 11.9547675029
+胸鳍 8.9102450652
+达荷美 11.1926274509
+左侍郎 9.29550746599
+侠盗 12.8020653633
+中国铁路文工团 13.2075304714
+亚龙湾 11.7034530746
+渝北区 11.2616203224
+高兰科 13.2075304714
+洞口 7.84155445639
+数千万元 12.1089181827
+钻石戒指 12.1089181827
+逼过去 13.900677652
+细胞学说 11.3357282945
+刘洪波 13.2075304714
+使馆区 10.9049453784
+现原形 13.2075304714
+显示屏 9.45802639549
+托洛茨基 10.4349417492
+富裕者 13.900677652
+金缕玉衣 11.1280889297
+老客户 10.3171587135
+算作 9.18217878068
+救下 10.3171587135
+艾比湖 10.9562386728
+事务股 13.900677652
+行孝 11.2616203224
+府河 11.4157710022
+实力政策 13.2075304714
+校内外 13.2075304714
+商船 8.71329184614
+跪坐 11.8212361103
+旋风 8.75318317516
+李将爷 11.7034530746
+史称崇 13.900677652
+苏非导师 13.900677652
+小床 10.8096351986
+桑迪亚 13.900677652
+楚州山 13.2075304714
+法律纠纷 13.2075304714
+月晕而风 12.8020653633
+人海茫茫 13.2075304714
+国姓爷 12.5143832909
+盐花 13.900677652
+跪垫 13.900677652
+基准面 10.8096351986
+宰执时 13.2075304714
+特立尼达和多巴哥 10.5684731418
+朱克柔 12.8020653633
+成本价 9.84023464143
+某市 11.0103058941
+另有新欢 13.900677652
+该装 13.900677652
+夏利车 13.900677652
+慈恩寺 10.8561552143
+捉影捕风 13.900677652
+每人每年 10.4994802703
+扔下去 10.765183436
+旧镇 12.8020653633
+头悬梁 13.2075304714
+琼脂 11.3357282945
+太基人 13.900677652
+国际争端 9.96885201925
+拉科尼亚 12.5143832909
+芬斯特 12.8020653633
+拍外景 13.2075304714
+慈恩宗 12.8020653633
+敷药 11.1280889297
+怪头怪脑 13.2075304714
+三十几个 11.7034530746
+波涛汹涌 10.3743171274
+切诺基 11.9547675029
+踉踉 13.900677652
+华奎劾 13.2075304714
+李金发 12.2912397395
+吗啉 11.9547675029
+正前方 10.6818018271
+回报率 8.16733637508
+唱针 12.2912397395
+临沂市 11.0674643079
+某师 12.2912397395
+胡梯边 13.2075304714
+黄祖部 12.8020653633
+普通人家 12.5143832909
+导弹基地 11.0674643079
+伊朗伊斯兰共和国 12.2912397395
+阿城县 13.2075304714
+驾御 11.4157710022
+公费旅游 12.5143832909
+离题 12.2912397395
+太常礼 12.8020653633
+慈慧普 13.2075304714
+型彩票 13.900677652
+托槽 13.900677652
+说得有理 10.0294766411
+歧视性 10.1164880181
+森冷 12.8020653633
+文化圈 11.3357282945
+外简内明 13.900677652
+梦梦 12.1089181827
+妇科 8.9308643524
+金全盛 13.900677652
+区带 11.8212361103
+算上 9.59661255877
+乔峰 13.900677652
+北静郡王 12.8020653633
+留话 12.2912397395
+各市县 11.5027823792
+成本低 9.19114745066
+侯健管 13.2075304714
+发行期 10.8096351986
+五百万斤 13.2075304714
+昌明 10.0294766411
+昌昌 12.8020653633
+说不出口 9.93038573842
+算个 9.20019728618
+区市 13.900677652
+渔民 8.56313957227
+科春闱 13.900677652
+香香的 12.1089181827
+朱正 13.900677652
+略高 10.1164880181
+噪声污染 11.5027823792
+朱武 9.4233408375
+稀缺 8.88339781516
+要死 8.22050504296
+亚地带 11.9547675029
+提篮桥 13.2075304714
+琼胶 11.8212361103
+马奶酒 12.1089181827
+异常情况 8.32094782599
+雷庆哥 11.8212361103
+西学堂 12.1089181827
+南方高科 13.900677652
+身不由已 12.5143832909
+中胚层 10.8096351986
+稀罕 8.6966709649
+屋檐下 9.66657114738
+应向 9.65218240993
+苞片 9.85762638414
+概略 10.9562386728
+诋毁 10.1394775363
+迄未 12.2912397395
+渔汛 12.2912397395
+教堂 7.52565283215
+拱出 12.5143832909
+法不治众 13.2075304714
+完蛋 9.11318590919
+浑沌 11.3357282945
+北非人 13.2075304714
+取之 12.5143832909
+柴大官人 9.85762638414
+凄然 9.5062284973
+令嫒 12.2912397395
+发行权 11.0674643079
+董虞候 13.900677652
+算了 7.65845438652
+尼日尔河 9.93038573842
+裴将军 13.900677652
+腾腾 9.93038573842
+好驴 13.2075304714
+朱毛 13.900677652
+枢纽站 11.0674643079
+暖种 13.900677652
+有所思 11.4157710022
+露布 12.2912397395
+北外滩 13.2075304714
+野战炮兵 10.8561552143
+花得精光 13.2075304714
+精简整编 11.9547675029
+于德安 13.2075304714
+钯金 10.533381822
+单色画 12.8020653633
+拂袖而归 13.900677652
+信任票 11.4157710022
+足踝 12.5143832909
+山八珍 13.900677652
+既有线 12.8020653633
+区庄 13.900677652
+高手 8.12302532875
+最浅 10.533381822
+托梦 10.1871055853
+伏威自 12.8020653633
+泰康镇 13.2075304714
+廿二 11.5027823792
+替换算法 13.2075304714
+朱克曼 13.2075304714
+庄氏史 13.2075304714
+利欲熏心 11.4157710022
+梦梅 11.8212361103
+淑英 10.8561552143
+诗剧 10.1871055853
+乔尼 13.2075304714
+仰脖 10.8096351986
+热带地区 9.10488710638
+铁盖山 12.8020653633
+三九 10.3453295905
+王进谢 13.2075304714
+两响 12.8020653633
+拿准 12.8020653633
+写写画画 12.8020653633
+学习动机 12.8020653633
+疾病症状 12.8020653633
+闭音节 12.5143832909
+缓缓而行 10.9562386728
+三缺一 12.1089181827
+炮烙 11.598092559
+几十分之一 12.2912397395
+乔尔 11.9547675029
+该要 12.1089181827
+亿多斤 12.8020653633
+影子内阁 11.2616203224
+时名臣 13.2075304714
+招权纳贿 11.9547675029
+席夫碱 12.8020653633
+白脱 13.900677652
+行废立 12.2912397395
+广州抽水蓄能电站 12.5143832909
+向开田 11.9547675029
+安神定魄 12.8020653633
+肥饶 13.900677652
+埋没 9.59661255877
+戳印 12.5143832909
+业务管理 10.0505300503
+齿冷 12.5143832909
+要案 13.900677652
+商聚 13.900677652
+保守疗法 12.8020653633
+通存通兑 13.900677652
+令妹 11.598092559
+武卫 11.3357282945
+张玉勤 12.1089181827
+进前一步 12.8020653633
+严式标 13.900677652
+齿冠 10.642581114
+志愿人员 11.7034530746
+姆巴 11.598092559
+鸽蛋 12.8020653633
+晋宁县 12.5143832909
+连敬 12.8020653633
+肃北蒙古族自治县 12.8020653633
+魏王豹 12.5143832909
+汹涌澎湃 10.642581114
+定南县 13.900677652
+索拉诺 13.900677652
+卡消费 12.8020653633
+普鲁特河 11.9547675029
+评选 8.07173203437
+衡阳县 13.2075304714
+保险费率 11.1280889297
+中国社会科学院经济研究所 12.5143832909
+祛风除湿 12.1089181827
+农家肥料 13.900677652
+曾庆红 13.900677652
+罗汉山 12.2912397395
+我党我军 13.2075304714
+慈云桂 13.2075304714
+净土 9.56994431169
+朱栏 11.9547675029
+伦斯 12.5143832909
+六百多户 13.2075304714
+没花 11.7034530746
+令姊 13.900677652
+十几节 13.2075304714
+二三十个 10.0940151622
+周孝 12.5143832909
+呈览 13.900677652
+几两几 13.900677652
+油香 12.1089181827
+喝闷酒 11.4157710022
+隔断 9.5186510173
+克拉苏 11.1926274509
+杨积余 11.8212361103
+魏安 11.7034530746
+满足条件 11.4157710022
+倦色 12.8020653633
+从外到里 13.900677652
+薛大爷 11.8212361103
+生死荣辱 12.8020653633
+马六儿 11.8212361103
+转接器 12.8020653633
+信道编码 12.1089181827
+荷叶茶 13.900677652
+通葛 13.2075304714
+油饼 10.6818018271
+伦敦 6.51855328624
+谨记在心 12.8020653633
+双冠王 12.8020653633
+倚赖 11.7034530746
+集中营 9.41204128224
+四等奖 12.1089181827
+香酒 12.1089181827
+敷脸 12.1089181827
+十九点 12.5143832909
+秘不示人 11.8212361103
+异族人 12.1089181827
+齐发声 13.2075304714
+楼台亭阁 12.2912397395
+稀粥 11.2616203224
+拱券 11.4157710022
+谭从其 12.5143832909
+商胡 11.598092559
+十几艘 13.2075304714
+亚伯奎 12.5143832909
+排除障碍 12.2912397395
+厚壁孢子 12.2912397395
+敷脚 13.900677652
+秦简夫 12.5143832909
+多油 12.2912397395
+黄埔军校武汉分校 12.8020653633
+托管国 13.900677652
+讨人厌 12.5143832909
+红海岸 13.2075304714
+油气显示 12.5143832909
+多退少补 12.1089181827
+埋汰 12.1089181827
+朱梅 13.900677652
+克洛宁 13.900677652
+瓦房店市 12.8020653633
+成人 7.85804481829
+稀糟 13.2075304714
+托比 13.900677652
+卵孢子 12.2912397395
+叶翠翠 13.900677652
+洞儿 13.2075304714
+离骚 10.0088573539
+王振铎 13.900677652
+四川省政府 11.2616203224
+分解器 13.900677652
+脱骨 12.2912397395
+百文 12.8020653633
+徐行 10.9049453784
+体育比赛 11.0103058941
+气冲 11.598092559
+马考莱 13.2075304714
+琼花 9.93038573842
+托管地 10.765183436
+存在物 11.7034530746
+杜克大学 11.5027823792
+耿京归 12.8020653633
+升为 8.67493097826
+渔港 9.14708746087
+燃料 7.14142238131
+白家 9.33632946051
+前思后想 11.9547675029
+波尔舍 11.9547675029
+花样繁多 11.8212361103
+马尼山 13.900677652
+踉跄 8.98069672615
+旧雨 12.5143832909
+容国团 12.8020653633
+指鹿为马 11.8212361103
+铁弓 13.900677652
+荀子所 13.2075304714
+李延寿 11.9547675029
+留解 13.2075304714
+修得道 13.2075304714
+朱楼 11.9547675029
+和翠翠 11.8212361103
+百数 12.5143832909
+魏联军 12.2912397395
+糯稻 12.1089181827
+丹尼洛夫 13.900677652
+央视网 10.8561552143
+湘阴 10.1394775363
+防寒服 13.900677652
+话说回来 9.85762638414
+琼英 9.66657114738
+氟哌酸 11.9547675029
+柏辽兹 11.1926274509
+王绍鏊 12.8020653633
+置喙 12.5143832909
+化学感觉 13.900677652
+甜滋滋 11.7034530746
+胡厥文 11.7034530746
+关东军 9.20932976975
+偶然性 9.65218240993
+田文镜 12.1089181827
+仰莲 12.8020653633
+糖衣 11.9547675029
+豆螺科 13.2075304714
+区局 12.5143832909
+一去不复返了 10.642581114
+天元战 12.8020653633
+区属 11.1926274509
+耐热钢 11.7034530746
+冰天雪地 10.0294766411
+山争田 13.2075304714
+马缨丹 13.2075304714
+尔康 12.8020653633
+优质钢 11.598092559
+评释 13.2075304714
+庾季才 13.2075304714
+拱北 10.4041700905
+张玉卿 12.8020653633
+散布 8.00903344015
+查德威 11.1926274509
+平买平 10.8561552143
+金匮石室 13.900677652
+库布其沙漠 12.5143832909
+赶海 11.9547675029
+攻进来 13.2075304714
+寿宁宫 9.84023464143
+福陵 12.2912397395
+勘查业 12.5143832909
+该词 11.598092559
+多汗 10.4041700905
+满腹经纶 10.6818018271
+令堂 10.9562386728
+玉田伯 13.2075304714
+迄无 11.0103058941
+英才网 13.2075304714
+示范户 13.900677652
+第十回 11.598092559
+燃放 10.4994802703
+几百英里 13.2075304714
+跑单帮 12.8020653633
+引古证今 13.2075304714
+吴永刚 12.8020653633
+甲壳质 11.7034530746
+鹊桥相会 12.5143832909
+占列耶 13.2075304714
+野渡 11.8212361103
+一百七十九斤 13.2075304714
+任课 13.2075304714
+湘雅 12.8020653633
+野游 12.8020653633
+捕虫 10.642581114
+湾里区 13.2075304714
+华管藻 12.8020653633
+视频网 13.900677652
+尤维纳利斯 12.8020653633
+破烂儿 13.2075304714
+压制群众 12.8020653633
+八八九九 12.5143832909
+法穆索夫 12.2912397395
+衣冠济济 13.900677652
+判断题 11.1926274509
+史称庆 13.2075304714
+蛇皮袋 12.8020653633
+拱卫 9.44633035572
+小学生 8.9519177616
+唱道 9.56994431169
+巡警 9.33632946051
+湘鄂 8.79473217808
+朱湘 11.2616203224
+主任委员 8.70218062071
+细胞骨架 12.1089181827
+巴中县 12.8020653633
+齿垢 13.900677652
+新房子 10.765183436
+常犯 12.2912397395
+泡泡吧 13.900677652
+常州人 11.9547675029
+许年 13.900677652
+黑户 11.0103058941
+白兰花 11.1280889297
+雉堞 11.1926274509
+华盛顿 7.87723005901
+一整杯 13.900677652
+维吾尔 8.9102450652
+托派 11.598092559
+全程参加 13.2075304714
+洋罪 12.2912397395
+超强度 12.8020653633
+飞行数据 12.8020653633
+哇哇地 10.1394775363
+史称夷 13.2075304714
+孵化期 10.0088573539
+退伍军人 10.4994802703
+评阅 12.1089181827
+叹惋 12.1089181827
+来日方长 11.3357282945
+骗案 13.2075304714
+追奔逐北 13.2075304714
+亮度比 13.2075304714
+红腹锦鸡 10.9049453784
+草店 13.900677652
+置办 9.4233408375
+一两一两 13.2075304714
+第二十二届 11.1926274509
+金庆堂 13.900677652
+蠓虫 11.598092559
+孵化机 13.900677652
+周宁 13.900677652
+激光指示器 13.2075304714
+至情 12.5143832909
+殿外 9.93038573842
+短粗 10.2897597393
+该调 12.8020653633
+积极开展 9.41204128224
+绿叶子 12.8020653633
+龙溪河 12.1089181827
+流血冲突 11.1280889297
+朱温 9.6811699468
+孟山都 12.2912397395
+郑筱萸 13.900677652
+发行所 10.7226238216
+富国银行 9.71102290995
+以一当十 11.2616203224
+两千八百六十三家 13.2075304714
+朱滔 11.8212361103
+电影演员 8.89004235788
+慢步 11.1280889297
+司马越弟 13.2075304714
+和静县 11.4157710022
+时修魏 13.2075304714
+何来实 13.900677652
+傅沙沙 13.900677652
+窨井 11.0674643079
+望本寨 13.2075304714
+近亲属 10.5684731418
+钻谋 13.900677652
+住院处 13.900677652
+巡诊 11.8212361103
+来延津 11.8212361103
+画中游 12.8020653633
+令弟 10.765183436
+那如山 13.2075304714
+孟罕勒 13.2075304714
+后半夜 9.45802639549
+拂意 12.8020653633
+郎廷佐 11.9547675029
+狼心 12.5143832909
+株距 13.900677652
+画像石 10.0720362555
+捷克共和国 12.1089181827
+谬奖 12.2912397395
+足球比赛 10.3453295905
+雪舟 11.7034530746
+森喜 13.900677652
+乔夫 12.2912397395
+佩西奥利 13.900677652
+荷兰属地 12.8020653633
+一千五百多个 13.2075304714
+美工设计 13.2075304714
+感知 8.7245279194
+巡访 13.2075304714
+咯咯 9.25628675283
+橡胶材料 13.900677652
+保险费用 11.5027823792
+卷铺盖走人 13.900677652
+细铁丝 11.9547675029
+三十四五岁 12.8020653633
+窘状 13.900677652
+安泰萨 13.2075304714
+中英两国 11.598092559
+工农红军 9.94943393339
+重复使用 10.1630080337
+黄村镇 12.5143832909
+呆头鹅 13.2075304714
+第一桌 13.2075304714
+冲出去 10.4041700905
+枣糕 11.9547675029
+大有起色 12.1089181827
+邓美成 9.62401153296
+公仆 10.2897597393
+临川市 11.8212361103
+俯仰由人 13.900677652
+旧都 10.765183436
+压头 13.2075304714
+跪到 9.80633308975
+留过 11.5027823792
+勿进 13.2075304714
+行政许可 10.1394775363
+痴痴呆呆 11.5027823792
+孔尚贤 11.598092559
+亿多支 13.900677652
+该起 12.2912397395
+怀中 8.0746775446
+领悟出 12.5143832909
+旧部 9.58318953844
+德雷尔 12.8020653633
+扰乱 8.44963919841
+沃尔泰 12.1089181827
+统共 11.1926274509
+教学仪器 12.5143832909
+韦德曼 12.1089181827
+贡唐 12.5143832909
+鸡蛋粉 13.2075304714
+睫状体 11.5027823792
+油黑 11.598092559
+晨钟暮鼓 13.900677652
+徐辉 10.9562386728
+袁绍引 13.900677652
+唱酬 12.2912397395
+钻杆 12.1089181827
+待在家里 10.9562386728
+李东垣 12.1089181827
+克罗地亚共和国 12.8020653633
+长细晶 13.900677652
+曾答允 13.900677652
+列席会议 11.3357282945
+损失赔偿 11.8212361103
+小安子 13.900677652
+宣官速 13.2075304714
+元阳 10.9049453784
+不合格者 12.1089181827
+炮火 8.25877058104
+创办人 10.0505300503
+沃尔沃 9.13850371718
+腹胀痛 11.1926274509
+古代史 10.1164880181
+你来我往 10.765183436
+壤塘县 13.900677652
+脚趾甲 13.2075304714
+有意思 8.02574692112
+那坡县 13.2075304714
+姚硕德 13.900677652
+莽撞 9.74179456862
+徐迟 12.5143832909
+鸡蛋糕 12.8020653633
+音符 10.0720362555
+中华全国学生联合会 12.1089181827
+马绛士 13.2075304714
+铁基非 13.900677652
+六百多支 13.2075304714
+麦克马洪 11.8212361103
+糯米 9.23723855786
+殿堂 9.04864738806
+净值 6.64015505389
+公仓 13.900677652
+双带 12.5143832909
+该路 11.0103058941
+绿林好汉 12.1089181827
+唐僧备 13.2075304714
+西苏丹 11.3357282945
+商业界 10.9049453784
+斯利那 12.5143832909
+文化厅 10.6818018271
+死鸡 13.900677652
+惊服 12.8020653633
+言三语四 12.8020653633
+各市地 13.2075304714
+胸饰 11.8212361103
+立武王 12.8020653633
+照得人 11.9547675029
+三棱镜 11.3357282945
+几十部 12.2912397395
+亦庄亦谐 12.5143832909
+引进外资 10.2371160058
+鸿蒙初辟 13.900677652
+最深 8.40350942668
+祝总斌 10.765183436
+行驶证 11.2616203224
+木托盘 13.900677652
+主计 11.8212361103
+吴蛮 12.8020653633
+木棚 11.9547675029
+阿瓦提 13.2075304714
+唐僧复 13.2075304714
+尤卡坦半岛 11.2616203224
+应负 10.2371160058
+油鸡 13.900677652
+泡起 13.900677652
+打发走 9.56994431169
+镗床 11.5027823792
+阿音札鲁 13.2075304714
+炮灰 12.2912397395
+俩好久 13.900677652
+斯普林菲尔德 11.598092559
+欢呼鼓舞 13.900677652
+秋去冬 12.2912397395
+岷县 10.6818018271
+子德明 13.2075304714
+扰人 12.8020653633
+周密 8.50251495046
+经验老到 12.2912397395
+抠出来 10.8096351986
+善性 11.8212361103
+文化史 9.6811699468
+结余 10.0294766411
+死行 11.7034530746
+储蓄存款 9.96885201925
+阿勒纳哈扬 12.8020653633
+于德尔 13.900677652
+抛洒 11.1280889297
+由下而上 11.598092559
+要求 4.60654775427
+鸿图 10.8096351986
+奠基者 9.93038573842
+拘泥于 10.1394775363
+分解力 13.900677652
+朱江 13.900677652
+相敬如宾 11.0674643079
+都还不 11.3357282945
+显卡 11.9547675029
+中山大道 12.2912397395
+咯噔 9.84023464143
+执著 10.1394775363
+著书 9.74179456862
+政治纲领 10.1630080337
+钻木 12.8020653633
+书状 12.8020653633
+铁剑利 13.2075304714
+酱缸 12.1089181827
+史称孝 12.8020653633
+棉垫 12.8020653633
+向长安 11.9547675029
+莲蓉 13.2075304714
+哀怜 11.5027823792
+下决心 8.73589167805
+宗明 13.2075304714
+区外 10.7226238216
+常春藤 12.2912397395
+胸骨 9.94943393339
+汲汲于 12.5143832909
+乔家 11.1926274509
+曲解 10.4041700905
+灵芝草 11.4157710022
+心灵深处 10.7226238216
+要民 13.2075304714
+正确认识 9.94943393339
+唤名 11.4157710022
+净化 8.44963919841
+蒙泰韦尔 13.2075304714
+异丁烯 11.5027823792
+姆妈 11.9547675029
+技术水平 8.49350588052
+中国医学科学院 11.4157710022
+散散心 10.0088573539
+引水上山 13.900677652
+反电动势 12.8020653633
+莽林 12.8020653633
+天剑 11.9547675029
+年运量 12.1089181827
+朱永 13.900677652
+咕咚咕咚 10.6818018271
+净亏损 10.3171587135
+渔歌 11.7034530746
+偏磷酸 12.8020653633
+变得坚韧 13.900677652
+小得多 9.02548032877
+任宝顺 12.8020653633
+领悟力 13.900677652
+真宗朝 13.2075304714
+公了 13.2075304714
+摧毁力 13.900677652
+历朝相 12.2912397395
+契丹 7.81390292506
+长盛不衰 11.2616203224
+安草儿 9.93038573842
+八十二卷 13.2075304714
+黑木梁 12.2912397395
+奥斯塔 12.5143832909
+帕莫主 13.900677652
+掖进 12.5143832909
+盘错 13.2075304714
+懒散地 12.8020653633
+挑嘴 13.900677652
+净口 13.2075304714
+李延年 11.9547675029
+小可心 13.900677652
+坏死性 11.598092559
+巡视 8.39941944143
+假名字 13.2075304714
+四十年代 10.9562386728
+红曲红 12.2912397395
+销售点 11.5027823792
+天年不齐 13.900677652
+绽开 9.7898037878
+尔派 13.900677652
+李士春 12.5143832909
+罗雪问 12.1089181827
+考纳斯 13.2075304714
+多才多艺 10.3171587135
+存储系统 11.4157710022
+罗马尼亚 8.35160156708
+报案人 13.2075304714
+一板一眼 10.9562386728
+领悟到 11.0103058941
+身轻如燕 11.5027823792
+太武帝 10.9049453784
+内敛 10.604840786
+柳直荀 12.2912397395
+减租减息 11.1926274509
+穿山越岭 12.2912397395
+通知精神 12.5143832909
+中国抗癌协会 13.900677652
+洛伊特 11.9547675029
+殿宇 9.34680076038
+暗蓝色 12.2912397395
+汪元量 12.5143832909
+相匹配 9.18217878068
+集中体现 9.66657114738
+小毛驴 11.2616203224
+棋逢敌手 13.900677652
+秕政 13.2075304714
+理想主义者 12.1089181827
+备要 12.5143832909
+侯选皆 13.2075304714
+该车 7.69814213479
+投标书 12.5143832909
+地自谦 13.900677652
+缨穗 12.8020653633
+心术不端 13.2075304714
+哲学领域 12.8020653633
+拱型 12.2912397395
+阔少 12.8020653633
+令岳 12.5143832909
+无极县 13.900677652
+立宪密 13.2075304714
+卫生厅 8.80692745117
+逗玩 13.900677652
+傅同钦 13.2075304714
+巡行 10.1630080337
+跪倒 8.38724890581
+边做边看 13.2075304714
+贤孝 12.8020653633
+总队长 10.642581114
+撕下来 11.1926274509
+邓秀 12.8020653633
+谷司令 12.8020653633
+邓禹 11.0674643079
+整理表 13.900677652
+朱洗 11.9547675029
+鼻窦炎 10.5684731418
+曹营 8.5440913773
+三反五反 11.5027823792
+无棣县 13.2075304714
+体育场馆 11.2616203224
+绷着脸 10.604840786
+在校生 10.7226238216
+八角街 13.2075304714
+流量表 12.8020653633
+弃世 11.0674643079
+贵重 8.44535653662
+朱仝正 12.8020653633
+要津 11.2616203224
+五方杂处 12.8020653633
+工分值 13.2075304714
+净利 7.64492761022
+杖头木偶 13.2075304714
+锥心泣血 13.2075304714
+同月同日 11.9547675029
+留足 11.598092559
+朱洪 12.2912397395
+河池市 12.2912397395
+芳草萋萋 13.2075304714
+徐贲 12.5143832909
+高功率 11.0103058941
+概率 6.75469318426
+万死一生 12.8020653633
+查默斯 12.5143832909
+调控 7.14607355249
+一百零二卷 13.2075304714
+多涎 13.900677652
+李双喜 8.88339781516
+连斩 12.1089181827
+一千美元 13.2075304714
+挑上去 13.2075304714
+朱淇 11.8212361103
+偶像崇拜 11.1280889297
+拱圈 11.9547675029
+徐质 12.1089181827
+公亩 13.900677652
+蜜里调油 13.2075304714
+范各庄 13.900677652
+金庆寿 13.2075304714
+令尊 10.1394775363
+中央大街 12.5143832909
+联合国儿童基金会 12.8020653633
+置入 9.5186510173
+埋植 13.2075304714
+凯奇 11.9547675029
+上证所 9.22784881751
+该进 13.2075304714
+尔库 12.5143832909
+产品品质 10.3171587135
+两大部 13.2075304714
+留起 11.7034530746
+哈拉齐 13.2075304714
+出口货 13.2075304714
+颜思齐 11.9547675029
+拱坝 10.8561552143
+不伤脾胃 12.5143832909
+亚丁 10.533381822
+投标人 10.8096351986
+洞名 13.900677652
+洞后 12.2912397395
+风媒花 12.5143832909
+袁绍已 12.5143832909
+苦无 13.900677652
+单色光源 13.2075304714
+王叔和 10.9049453784
+点阵图 13.900677652
+四四年 13.2075304714
+何兆武 13.900677652
+舟山 9.63799777493
+两性花 10.6818018271
+魁星踢斗 11.2616203224
+官大呼 13.900677652
+每人每天 11.1280889297
+黑幕重重 13.2075304714
+牧额济 13.2075304714
+依品 12.5143832909
+根本利益 9.65218240993
+完聚 11.2616203224
+电唱头 13.900677652
+戚里 12.1089181827
+渔政 12.8020653633
+刁斗 12.1089181827
+留苏 12.5143832909
+洞察 9.80633308975
+惊慌无措 12.8020653633
+六师 10.9562386728
+李开芳 12.8020653633
+刹车 8.83177344976
+克烈部 11.0674643079
+条件优惠 13.2075304714
+许衡尊 13.2075304714
+两眼 7.70627226087
+官大官 13.900677652
+科伦 11.7034530746
+须弥座 11.5027823792
+在天之灵 10.1394775363
+过得来 13.2075304714
+张将士 13.900677652
+尹俊春 13.2075304714
+文成侯 12.8020653633
+疑团 10.3453295905
+斯瑞克 10.6818018271
+朱批 11.7034530746
+无纺织布 12.1089181827
+变化多端 9.98865464655
+八十一门 13.2075304714
+徐小姐 11.7034530746
+闪射 11.2616203224
+维修 7.5871296057
+改革方案 9.17328983326
+壮劳力 12.5143832909
+玄德分 13.2075304714
+幸吴 13.900677652
+亿港元 7.80260336981
+事关大局 11.7034530746
+实事求是 8.63798746307
+东主爷 12.1089181827
+棚户 11.8212361103
+历史小说 9.94943393339
+咿呀 11.0674643079
+夏候鸟 12.1089181827
+回旋曲 12.2912397395
+向渊圣 12.1089181827
+韭子 13.2075304714
+格勒诺 13.2075304714
+兰江 11.7034530746
+脱逃 10.604840786
+脏污 11.4157710022
+科佩 13.900677652
+神器谱 13.2075304714
+三二里 11.7034530746
+踌躇不决 12.1089181827
+相国霜 12.8020653633
+胸针 11.8212361103
+令友 13.900677652
+能源网 11.1926274509
+川烟柳 13.900677652
+急如星火 11.4157710022
+宫庙 13.2075304714
+齿寒 12.5143832909
+王蛤蟆 10.1871055853
+下水道 9.75754292558
+九十七卷 13.2075304714
+全能运动 12.5143832909
+离退 12.8020653633
+信远斋 13.2075304714
+贞观之治 10.604840786
+艾凡赫 12.2912397395
+留芳 12.5143832909
+区块 11.5027823792
+洞室 10.4666904475
+德雷克 10.765183436
+热力学温标 12.1089181827
+利尔城 13.900677652
+烟点 12.8020653633
+百分之三十五 13.2075304714
+褥垫 12.5143832909
+甲壳虫 10.1871055853
+洞子 10.3171587135
+上半时 13.900677652
+难以名状 11.3357282945
+通报批评 10.2630914922
+缓冲区 11.2616203224
+刘晏充 13.2075304714
+洗洗澡 13.2075304714
+沉下来 11.0674643079
+徐航 13.900677652
+沙兹里 12.8020653633
+抛掉 9.62401153296
+吹灰之力 11.7034530746
+直饮水 12.8020653633
+死鸟 12.5143832909
+抛掷 10.604840786
+无边无垠 13.900677652
+封文书 12.5143832909
+浙江广厦 10.3743171274
+净差 13.900677652
+绒毛状 10.9049453784
+咿哑 11.9547675029
+蒙森 11.8212361103
+李叔同 11.5027823792
+分外眼红 12.5143832909
+潘文得 12.8020653633
+并作 9.53122979951
+湖南卫视 11.0674643079
+临川县 12.8020653633
+阿倍仲麻吕 13.2075304714
+华尔街日报 9.22784881751
+确需 10.7226238216
+暖炉 11.9547675029
+贡士 13.2075304714
+徽派 11.8212361103
+软化剂 13.2075304714
+舰只 9.45802639549
+奇卢巴 13.900677652
+修文偃武 13.900677652
+野放 13.900677652
+别来无恙 10.604840786
+商誉 10.7226238216
+轴流 12.5143832909
+集油站 13.2075304714
+赣县 11.0674643079
+比洛夫 12.8020653633
+纤介 13.2075304714
+副伤寒 12.1089181827
+国家信息中心 9.72629038208
+液态奶 11.7034530746
+区域 5.73958813913
+加工成本 12.2912397395
+严重不足 9.74179456862
+顺口溜 9.80633308975
+并会 10.0940151622
+长山岛 11.0674643079
+仰角 10.4041700905
+南岛群 12.2912397395
+延汉祀 13.2075304714
+身体检查 11.7034530746
+并以 10.4041700905
+严守中立 11.8212361103
+巫卜祝 13.2075304714
+连杨诚 12.2912397395
+仰观 10.7226238216
+恐无 12.1089181827
+仰视 9.69598503258
+印加国 12.1089181827
+风雨无阻 11.598092559
+胸闷 9.16447920358
+德尼罗 13.2075304714
+孟禄 12.8020653633
+戒尺 12.1089181827
+刘斌 11.1926274509
+普贤来 13.2075304714
+相对来说 9.44633035572
+封文信 12.8020653633
+御道口 12.5143832909
+谢良佐 13.2075304714
+新娘新郎 12.2912397395
+三十三座 13.900677652
+经济体 7.01926634833
+任脉 10.9562386728
+随风转舵 13.900677652
+破格提拔 11.5027823792
+机动车行驶 10.9562386728
+维亚 10.6818018271
+重商主义 10.0505300503
+吐酸 13.2075304714
+从绍鸥 13.2075304714
+穗肥 13.900677652
+递上来 11.5027823792
+立功受奖 11.3357282945
+销售网 12.2912397395
+孟离 11.9547675029
+商族先 13.2075304714
+要挟 9.22784881751
+浓酒 12.5143832909
+来献忠 11.9547675029
+贫道 9.87532596124
+贡奉 11.1926274509
+吕光伐 13.2075304714
+暗门 10.765183436
+咿唔 13.900677652
+并于 7.30900391997
+禹南均 13.900677652
+殿后 9.94943393339
+维京 10.9562386728
+日月蚀 13.900677652
+喀麦隆 9.48183704418
+黑金刚 13.900677652
+净尽 10.533381822
+朱提 11.598092559
+梁式桥 12.5143832909
+余万册 11.9547675029
+食肉类 11.3357282945
+赶来 7.24138373229
+抛投 13.900677652
+夏国主 11.8212361103
+在组织上 10.642581114
+铁青色 12.2912397395
+李希圣 13.900677652
+马尼图 13.2075304714
+中共江西省委 12.2912397395
+只此一家 12.2912397395
+水师营 12.5143832909
+发潮 12.1089181827
+小西天 11.8212361103
+闭幕词 13.900677652
+割爱 11.9547675029
+奥斯坦 12.5143832909
+商请 12.8020653633
+回头客 11.0103058941
+看图 11.8212361103
+向崇祯 10.4041700905
+冰山美人 13.900677652
+经贸局 13.900677652
+集数 13.900677652
+北师大 11.7034530746
+清仓查库 11.5027823792
+宋瓷 12.2912397395
+群艺馆 13.2075304714
+俗例 13.900677652
+科任 12.8020653633
+击穿场强 12.2912397395
+人体模型 13.900677652
+任臣 13.2075304714
+徐荣 13.2075304714
+政府公告 13.900677652
+科以 12.1089181827
+囊空如洗 12.5143832909
+科仪 11.598092559
+并举 9.11318590919
+中华人民共和国海关 13.900677652
+依靠群众 11.1926274509
+凿凿有据 13.900677652
+立足未稳 11.0674643079
+三十三年 9.44633035572
+愈能 13.2075304714
+技术水准 12.1089181827
+拉夫琴 13.900677652
+并不 13.2075304714
+饲主 12.8020653633
+照过来 13.900677652
+科什 12.5143832909
+商订 11.8212361103
+并且 5.25861547851
+哀悼 9.84023464143
+乔合 13.900677652
+糖苷 11.4157710022
+商讨 8.85725253506
+宝林寺 11.3357282945
+科介 13.900677652
+准噶尔 8.85082164473
+民族自决权 11.3357282945
+商议 6.74372128736
+中国人民抗日战争纪念馆 13.2075304714
+糖脂 11.598092559
+差转台 13.900677652
+两面三刀 12.5143832909
+问答法 13.900677652
+极乐 10.2630914922
+大舜 12.8020653633
+岷山 9.94943393339
+长话费 12.2912397395
+野柳 11.5027823792
+商行 9.29550746599
+北港溪 12.1089181827
+渔期 12.8020653633
+肆应 13.2075304714
+脏水 10.6818018271
+油量 10.2897597393
+共生死 11.9547675029
+雄风不减 13.900677652
+谁知盘中餐 12.1089181827
+月均 7.47095817394
+燃油 7.77380846786
+集散 9.31571017331
+迪帕克 12.5143832909
+执行 5.55807597129
+炼焦炉 12.5143832909
+罗拔诺 12.8020653633
+开拓者 9.62401153296
+范木匠 13.900677652
+妙峰山 12.1089181827
+文化层 10.765183436
+文化局 10.642581114
+出乱子 10.9049453784
+冒汗 10.1630080337
+换句话 12.2912397395
+各送 11.9547675029
+咽住 10.642581114
+打击力 12.5143832909
+文化展 13.900677652
+上半期 10.604840786
+音程 10.604840786
+郭晶晶 11.4157710022
+前怕狼 13.2075304714
+相互合作 11.2616203224
+显示器 8.93783302172
+户口调查 11.9547675029
+山盟海誓 12.5143832909
+渔村 9.29550746599
+雷庆忙 13.2075304714
+野果 9.87532596124
+泗州城 11.9547675029
+纪渐新 12.1089181827
+极为 6.5160672688
+电化学 9.5062284973
+孤儿寡母 10.6818018271
+七高八低 13.900677652
+完败 11.9547675029
+振振有词 10.1630080337
+潍河 12.1089181827
+四下里 8.58255765813
+南木林县 13.2075304714
+机会成本 10.4041700905
+歼击 9.84023464143
+糖膏 13.900677652
+柴烂草 12.8020653633
+油酸 10.9562386728
+高鼻深目 13.2075304714
+虚度年华 13.900677652
+自营 8.092535162
+促成 7.79365476423
+四百五十万 12.5143832909
+白水城 13.900677652
+燃气 7.75649201785
+晏婴 11.5027823792
+赶摆 12.8020653633
+庄老乌 12.1089181827
+港客 12.5143832909
+泰州市 10.6818018271
+金合欢树 13.2075304714
+胸际 13.2075304714
+气象日 13.900677652
+徐老 11.1926274509
+遭人白眼 13.2075304714
+野村 9.74179456862
+寓言 9.28555713513
+翱翔天际 13.900677652
+药制剂 11.0674643079
+任英 12.1089181827
+资产阶级 6.60358664682
+极了 8.11378027061
+严以律己 13.900677652
+喋喋不休 10.3453295905
+北京青年报 9.74179456862
+洞外 9.87532596124
+文史系 12.1089181827
+五百四十 13.2075304714
+不合规格 13.900677652
+抽空到 12.5143832909
+净得 13.900677652
+病急乱投医 11.4157710022
+令其 9.10488710638
+玄中寺 12.5143832909
+德萨拉 13.900677652
+链接 8.6966709649
+首辆 12.1089181827
+参众两院 10.765183436
+床垫 10.604840786
+新一波 11.4157710022
+令兄 10.765183436
+大盈江 11.2616203224
+生产经营性 12.1089181827
+话剧院 11.598092559
+王正廷 11.3357282945
+巴士底 13.2075304714
+边干边学 13.900677652
+茫然 8.00903344015
+漫画 9.26594866375
+秦简公 13.2075304714
+谔谔 13.900677652
+屡试屡验 13.2075304714
+该药 11.0103058941
+伦泳 13.2075304714
+连蹦带跳 11.9547675029
+陵谷沧桑 13.900677652
+赶早 10.2897597393
+踩水 12.5143832909
+极低 9.38981814546
+三十三岁 11.598092559
+诺特 10.9562386728
+以下几点 9.14708746087
+协商会 12.8020653633
+开馆 9.62401153296
+进退出处 13.900677652
+圣海伦斯 12.8020653633
+谶言 12.1089181827
+联合国总部 11.2616203224
+诸复立 13.2075304714
+骗术 10.8096351986
+夜工 11.0103058941
+画像砖 10.765183436
+极佳 9.12155415886
+差额选举 13.900677652
+自杀未遂 11.4157710022
+跪射 12.2912397395
+性技巧 12.8020653633
+诃德 13.900677652
+宋江掌 13.2075304714
+大字 8.26232298264
+推牌九 13.900677652
+辐射能 10.2630914922
+托托 11.5027823792
+蜡渣子 13.900677652
+田晓霞 9.32596667347
+腾讯 9.09665660724
+悼文 13.900677652
+酋长 8.39941944143
+于贞观 11.1280889297
+一瞬间把 13.900677652
+抽空去 11.9547675029
+无数代 13.2075304714
+骗来 12.2912397395
+舒申斯 13.900677652
+太尉见 13.2075304714
+单孔目 11.2616203224
+纳布卢斯 13.2075304714
+韦伯定律 13.2075304714
+渐染 12.5143832909
+葛麻草 13.2075304714
+胡司令 9.6811699468
+昌江 11.0103058941
+塔拉哈西 13.900677652
+等级制 10.604840786
+科拉迪 13.2075304714
+不要脸 9.56994431169
+稀疏 8.11993413618
+微词 10.8096351986
+伦池 13.900677652
+重瓣胃 13.2075304714
+华伦夫人 12.2912397395
+昌河 9.69598503258
+保险市场 10.0088573539
+贡家 10.8561552143
+重申立场 13.900677652
+终日只 12.5143832909
+手书 9.46986085313
+雅典卫城 11.2616203224
+老哈 9.71102290995
+踌躇不前 11.598092559
+悒悒 13.2075304714
+污染区 11.5027823792
+激光枪 12.1089181827
+真不愧是 10.8561552143
+包庇罪 13.900677652
+袁绍军 13.2075304714
+合建 10.9049453784
+数万顷 12.8020653633
+萧国亮 12.2912397395
+贮存量 12.8020653633
+闵贡 13.2075304714
+糖肽 13.900677652
+韩国联合通讯社 12.5143832909
+黄菜叶子 13.2075304714
+须鲸亚 12.8020653633
+托拉 11.3357282945
+黄色录像 12.8020653633
+促销期 13.900677652
+神清气朗 12.8020653633
+荣赫鹏 13.2075304714
+中等偏上 11.1280889297
+贾琏便 10.9562386728
+哀意 13.900677652
+大好事 10.8096351986
+炼焦煤 10.0720362555
+传捷报 12.5143832909
+奋勇作战 12.1089181827
+谵妄 10.4994802703
+一幕 8.04560572977
+大好人 11.598092559
+烟波浩渺 11.0103058941
+浑浊 9.21854642485
+净度 11.8212361103
+略逊 10.9562386728
+敷衍 8.77671367257
+刘家庄 13.2075304714
+王羲之 9.4233408375
+倍受鼓舞 13.900677652
+乔嘉 12.8020653633
+各不相同 8.29487558568
+恐有 9.66657114738
+胸部 8.05713323494
+恐惶 13.2075304714
+一百七十四卷 13.2075304714
+羽绒被 12.5143832909
+憋住 12.1089181827
+马尼卡 13.900677652
+实力雄厚 9.63799777493
+调查者 11.8212361103
+奥斯勒 12.8020653633
+朱晃 12.1089181827
+恐惧 7.33541268194
+区区 8.78868986362
+巨大力量 11.1926274509
+雪佛兰 10.5684731418
+塞利诺 13.900677652
+伦比 11.8212361103
+自由落体 10.604840786
+经贸委 11.5027823792
+沉着脸 9.74179456862
+编采 12.2912397395
+各道 10.1630080337
+或曰 11.1280889297
+五百响 13.2075304714
+慰问袋 11.8212361103
+假借名义 12.8020653633
+足球运动 11.8212361103
+百柱 13.2075304714
+托收 10.604840786
+违章 10.1630080337
+买卖成 13.900677652
+踩死 10.4666904475
+乔冽 12.8020653633
+跃身而起 13.2075304714
+托故 11.0674643079
+贡山 11.7034530746
+荷兰银行 10.7226238216
+文学刊物 11.1926274509
+左总兵 13.900677652
+朱昆 13.900677652
+剁肉 12.8020653633
+朱明 10.9562386728
+敷过 13.900677652
+老电影 12.5143832909
+类乌齐 12.5143832909
+氛围 7.83689244329
+罗塔里 13.2075304714
+战斗侦察 12.5143832909
+杨杏才 13.2075304714
+要是 5.79295759007
+无一不精 11.9547675029
+私章 13.2075304714
+撰书 12.8020653633
+平流雾 12.2912397395
+抛来 12.1089181827
+当代艺术 13.900677652
+端正党风 13.2075304714
+沃尔斯 13.2075304714
+诸多不便 11.0674643079
+弛缓 11.2616203224
+黄纪莲 13.2075304714
+塞甘蒂 12.8020653633
+斯钦合 12.8020653633
+油面 12.5143832909
+福特公司 11.5027823792
+罗晓鹏 12.8020653633
+昌都地区 10.765183436
+广袤千里 12.8020653633
+管他什么 12.1089181827
+铱金 13.2075304714
+区县 9.94943393339
+森川 13.900677652
+空气浴 12.5143832909
+抢下 11.7034530746
+撰于 11.0674643079
+崔纵充 13.2075304714
+泰戈尔 10.8561552143
+护卫军 11.3357282945
+卫汝贵 13.2075304714
+明察暗访 10.604840786
+托斯 11.0674643079
+武警部队 11.0103058941
+扛出 12.1089181827
+秧田 12.5143832909
+癞头 11.598092559
+森工 9.7898037878
+五十天 11.598092559
+诸仓米 12.5143832909
+视为畏途 12.8020653633
+钩虫病 12.2912397395
+出海口 9.77354326693
+家庭环境 11.5027823792
+老气横秋 11.5027823792
+平齐 10.6818018271
+令坦 13.900677652
+团管区 13.2075304714
+贝阿德 12.2912397395
+引过来 12.8020653633
+羽绒衣 12.5143832909
+集安市 11.9547675029
+伦次 13.900677652
+刘寄奴 13.900677652
+洞开 9.75754292558
+坐车来 13.2075304714
+触觉器 13.900677652
+区号 12.5143832909
+昌黎郡 12.5143832909
+齿形 12.2912397395
+恐怖 7.67414098269
+缩成一团 10.4349417492
+恐怕 6.31590457436
+特摩斯 11.5027823792
+张柬之 10.7226238216
+朗切斯科 12.8020653633
+或是 6.71908570736
+执行公务 10.7226238216
+愿天下有 13.900677652
+恒产 11.598092559
+利可安 12.8020653633
+空情 12.1089181827
+脱钩 9.85762638414
+殿内 9.02548032877
+李延听 12.5143832909
+和沅江 12.2912397395
+古铜剑 12.5143832909
+马而泰 11.0103058941
+十几路 13.900677652
+区别 6.30127631856
+空气流 11.8212361103
+曲细精 12.5143832909
+朱权 12.2912397395
+玉亭刚 13.2075304714
+大墙 11.598092559
+精炼炉 12.8020653633
+翟让兄 13.2075304714
+梦溪 12.5143832909
+元成宗 9.72629038208
+可降解 11.8212361103
+哭个痛快 13.2075304714
+要来 8.0985592766
+胸里 13.2075304714
+卖方市场 10.8561552143
+掌邦教 13.2075304714
+区分 7.34816976494
+别具风采 13.2075304714
+李满住 12.5143832909
+专业组 12.2912397395
+耳熟能详 9.84023464143
+聘为 9.12999302751
+食块 13.900677652
+恢复电路 13.900677652
+植物病害 11.1926274509
+腾跃 10.9049453784
+区划 9.15574552361
+冲击钻 13.2075304714
+里脊肉 12.2912397395
+透漏过来 13.900677652
+医院船 11.598092559
+洞府 10.0505300503
+芦雪庵 12.1089181827
+难民收容 12.2912397395
+暂行 10.1394775363
+妇道人家 10.1394775363
+洞库 12.2912397395
+朱朝 12.1089181827
+专业级 12.5143832909
+吃偏食 13.900677652
+于魏郡 13.2075304714
+入射角 10.8096351986
+脱销 11.3357282945
+订单式 13.2075304714
+阿城市 11.9547675029
+绚丽多彩 10.5684731418
+封侯景 13.2075304714
+常熟市 11.7034530746
+班为帝 12.8020653633
+伊洛夫 13.900677652
+聘书 11.598092559
+腾越 11.0103058941
+按劳分配 10.3453295905
+洞庭 9.53122979951
+忧国忘家 13.900677652
+朱木 12.8020653633
+邪教组织 13.2075304714
+惩处 8.71329184614
+执迷 10.4041700905
+朱某 11.598092559
+仰赖 10.4349417492
+玉皇阁 12.5143832909
+化为己有 13.900677652
+离间 9.69598503258
+连接酶 13.900677652
+表姊妹 13.900677652
+诺瓦 12.5143832909
+蔡寅亦 12.8020653633
+差不多 6.54439777543
+纽约市场 9.56994431169
+册亨县 13.2075304714
+降格以求 13.900677652
+自适应性 13.900677652
+学满 12.8020653633
+临阵磨枪 12.1089181827
+不哼不哈 12.2912397395
+法经义 13.2075304714
+围抢 13.900677652
+七千八百六十五门 13.2075304714
+冷大哥 11.598092559
+文化宫 10.6818018271
+奥斯卡 8.52078029844
+可靠性 8.22050504296
+创巨痛深 12.2912397395
+圣玛丽斯 12.2912397395
+测试题 11.8212361103
+雷州市 12.1089181827
+宗敏 8.52539924429
+鼓足干劲 12.8020653633
+普拉特 10.9562386728
+哀戚 12.1089181827
+凤来鸡 13.2075304714
+棚架 11.5027823792
+田人隆 10.604840786
+莽汉 12.5143832909
+古葛洛 13.900677652
+恐慌 7.56739802384
+左右万户 13.2075304714
+国丞相 12.2912397395
+战守皆 13.2075304714
+酱瓜 11.9547675029
+下战书 11.1280889297
+野性 9.82314020807
+胸膜炎 10.8561552143
+商辂 13.900677652
+森岛 13.2075304714
+贡巴 12.8020653633
+文武学校 13.900677652
+惕惧 13.900677652
+净增 10.4349417492
+略阳 11.4157710022
+经典作 13.2075304714
+冒险游戏 13.900677652
+着陆时 11.5027823792
+贻笑大方 13.2075304714
+油阀 13.900677652
+第六道 13.2075304714
+聘任 9.43476953332
+徽标 12.8020653633
+地静立 13.2075304714
+概称 12.1089181827
+死而无怨 11.598092559
+工商局 7.85330547293
+八十多年 12.1089181827
+堆龙德庆 12.2912397395
+油门 9.15574552361
+说白道绿 13.900677652
+龙舟竞赛 12.8020653633
+公共资源 10.3453295905
+阮啸仙 13.2075304714
+潘英伯 13.900677652
+急弯 11.2616203224
+盗印 13.900677652
+相容性 10.642581114
+链条 8.61241062128
+弘祖 13.900677652
+苹果酸 10.5684731418
+水清木 13.900677652
+乔叟 11.5027823792
+贡布 11.7034530746
+直线发展 13.900677652
+寿带鸟 13.2075304714
+显影液 12.8020653633
+七星岩 10.4666904475
+略有所闻 12.8020653633
+肃宁县 13.900677652
+墨西哥 7.65845438652
+得人惊 13.900677652
+脱除 11.8212361103
+王婷婷 13.900677652
+脱险 9.7898037878
+流浪儿 11.7034530746
+贻害 11.7034530746
+金科玉律 11.4157710022
+哈登堡 11.9547675029
+楚云 12.5143832909
+奸谋 11.2616203224
+不使它 12.5143832909
+比目鱼 10.7226238216
+商谜 12.8020653633
+牛肝菌 12.1089181827
+平弦 12.8020653633
+商调 12.1089181827
+热控制 12.8020653633
+扛包 13.2075304714
+白秀英 12.2912397395
+商谈 9.00283785202
+三十天 11.598092559
+过路客 12.8020653633
+拱廊 12.1089181827
+为国争光 11.9547675029
+百枝 13.900677652
+渔捞 12.2912397395
+景宗建国 13.2075304714
+口出 11.9547675029
+离队 11.4157710022
+熟睡 9.77354326693
+田余庆 12.8020653633
+原子能部 13.2075304714
+毕业分配 12.1089181827
+好生意 12.2912397395
+托板 12.8020653633
+求实精神 13.900677652
+织布机 9.98865464655
+壹亿元 12.8020653633
+省油灯 12.5143832909
+明总兵 12.5143832909
+干得了 12.2912397395
+乳中 12.2912397395
+唱高 12.8020653633
+万世一 12.5143832909
+埋怨 7.96843246453
+高血糖 10.4041700905
+略长 11.4157710022
+敷贴 11.2616203224
+何椿霖 13.900677652
+石秀道 9.84023464143
+铁腕人物 12.1089181827
+儿童乐园 11.7034530746
+供选择 9.7898037878
+上海师范大学 13.2075304714
+区内 7.70423352418
+满面红光 11.0674643079
+远洋运输 10.4349417492
+熊佛西 12.1089181827
+老相识 10.604840786
+一双双手 12.5143832909
+应计 13.900677652
+托架 11.3357282945
+稀烂 9.89334446674
+万世之 11.5027823792
+垂头丧气 9.56994431169
+油锯 13.2075304714
+刘老根 13.900677652
+癞子 12.8020653633
+敲门声 9.69598503258
+目标目录 12.1089181827
+雍亲王 12.2912397395
+第二十二回 11.8212361103
+老哥 9.36807815882
+闵行 10.1630080337
+太白金星 10.8096351986
+振振有辞 11.9547675029
+匹配 7.78478552649
+哺育 9.87532596124
+出于意外 12.5143832909
+陨硫铁 12.5143832909
+电子电器 11.2616203224
+辎重 8.88339781516
+净室 11.5027823792
+四十多分 13.900677652
+调来调去 13.900677652
+油锅 9.58318953844
+苹果醋 12.5143832909
+七星山 12.5143832909
+腾踊 13.2075304714
+包下去 13.2075304714
+路有冻死骨 12.5143832909
+股抵债 11.9547675029
+酒泉市 11.2616203224
+净宽 12.2912397395
+吐露 9.35738286971
+高抬贵手 11.0103058941
+德金刚 13.2075304714
+羽轴 11.5027823792
+渔户 12.5143832909
+黄大人 11.1926274509
+色素痣 13.900677652
+两国人民 10.1164880181
+松谷庵 12.8020653633
+朋党政治 12.5143832909
+呵欠连天 13.900677652
+总决赛 10.7226238216
+交手 9.69598503258
+脱靴 12.5143832909
+脱靶 12.1089181827
+大堰 12.1089181827
+麻藤科 12.5143832909
+昌栈 13.2075304714
+社交生活 13.2075304714
+要数 9.24671730182
+殿前 9.36807815882
+三五枝 13.900677652
+红相公 12.5143832909
+初次 8.17382990439
+阿沙尔 13.900677652
+腾迅 13.900677652
+无所不及 13.900677652
+唐僧闻 13.900677652
+关停并转 12.2912397395
+起云 13.900677652
+腾达 11.5027823792
+挡驾 11.7034530746
+主目录 13.2075304714
+三四百米 12.5143832909
+李希凡 13.900677652
+押后 10.7226238216
+受伤害 10.4994802703
+油钱 11.2616203224
+驻外使馆 11.8212361103
+显示卡 13.900677652
+托普 12.5143832909
+龙游县 12.8020653633
+商贸 8.26232298264
+滴答声 13.900677652
+十几辆 11.0103058941
+商贾 9.25628675283
+古滇国 10.8561552143
+活脱脱 10.604840786
+芝麻油 11.7034530746
+玉京金 13.2075304714
+商贩 9.55687223012
+塞米蒂 13.900677652
+调整 4.8224981836
+横膈膜 13.900677652
+要政 11.7034530746
+雷蒙德 12.8020653633
+抛撒 9.94943393339
+大堡 13.900677652
+萨金特 12.1089181827
+思想素质 12.8020653633
+原东 12.2912397395
+完整无缺 11.598092559
+漫灌 12.5143832909
+拱开 12.8020653633
+概算 10.8096351986
+贡德 12.5143832909
+九十二卷 13.2075304714
+忧劳 12.1089181827
+煽动者 11.9547675029
+糖蒜 12.5143832909
+涵闸 11.4157710022
+拱式 12.2912397395
+家翻宅乱 12.8020653633
+墨丘利 12.8020653633
+欧阳侍郎 11.1280889297
+令名 12.2912397395
+楚州南 12.2912397395
+乌鸦嘴 12.8020653633
+石勒建国 12.5143832909
+要旨 10.3171587135
+沙排 13.2075304714
+抽工夫 13.900677652
+见风使舵 10.8561552143
+诺盖 13.2075304714
+闷声不响 10.8561552143
+网站空间 13.2075304714
+宁馨儿 13.900677652
+屯田 8.19689517732
+凄美 11.7034530746
+压力降 12.8020653633
+舞会 9.49395840471
+娄丞相 12.2912397395
+楚州区 12.5143832909
+二百一十五万斤 13.2075304714
+置备 10.604840786
+元音 9.45802639549
+叙事歌曲 12.8020653633
+岳麓书院 11.5027823792
+捉住 8.56313957227
+乔利 12.8020653633
+安泽 12.8020653633
+脱鞋 10.8096351986
+诃子 12.8020653633
+朱斌 12.5143832909
+恬不知羞 13.900677652
+老一代 10.6818018271
+零篇 12.5143832909
+舞伴 10.9562386728
+傅生 13.900677652
+尚不知 10.4666904475
+综合执法 10.9562386728
+拱形 9.96885201925
+饮茶 9.41204128224
+卓奥友峰 11.7034530746
+别无长物 13.900677652
+增产节约 12.1089181827
+朱斯 13.2075304714
+黄丸加 13.900677652
+舅母 10.0505300503
+武圣真 12.8020653633
+状物质 11.3357282945
+天轮 12.1089181827
+红海湾 12.5143832909
+非正规军 12.5143832909
+稀世 10.4994802703
+麸曲 13.900677652
+贾母才 12.2912397395
+加足马力 12.5143832909
+阿里亚斯 12.5143832909
+督促检查 11.8212361103
+防护眼镜 12.5143832909
+惊闻 12.2912397395
+储蓄额 13.900677652
+茔地 13.900677652
+时行 11.2616203224
+托大 10.8096351986
+溧阳县 12.5143832909
+馅儿饼 12.8020653633
+孙礼引 12.5143832909
+四维时空 11.8212361103
+十四把 13.900677652
+蠢材 11.7034530746
+圆柱面 11.3357282945
+糟糕 8.33233314821
+非均衡 11.7034530746
+横向发展 13.2075304714
+骗局 9.29550746599
+好自为之 11.1280889297
+妙笔 13.2075304714
+资质等级 12.2912397395
+走调 13.900677652
+外电报道 10.1630080337
+靠门边 13.2075304714
+王不留行 13.2075304714
+工控机 13.900677652
+深沟高垒 10.765183436
+根插 13.2075304714
+扛活 11.9547675029
+按类型 11.8212361103
+七星拳 13.900677652
+踩坏 12.8020653633
+凤阳山 12.2912397395
+遮起 13.900677652
+应试 9.62401153296
+卵原细胞 12.8020653633
+罪恶滔天 11.3357282945
+机动力 10.7226238216
+战斗性能 11.598092559
+阿伯特 12.8020653633
+楚郡 13.2075304714
+于皇叔 13.2075304714
+烘托渲染 13.900677652
+口内 9.59661255877
+酒气熏天 13.2075304714
+检票口 13.2075304714
+下铺 11.0103058941
+马放鹰 13.900677652
+卜法 12.2912397395
+本世纪 9.14708746087
+狄蒙娜 13.2075304714
+开元 7.95525704337
+辛企宗 13.2075304714
+时装 9.31571017331
+长江日报 11.7034530746
+手儿 11.3357282945
+中国数学学会 13.2075304714
+温暖如春 11.3357282945
+龙行虎步 13.900677652
+五百名 10.533381822
+邓义 13.2075304714
+徽商 10.2371160058
+一整只 12.8020653633
+闻先生 13.900677652
+缸鼓 13.900677652
+自贱 13.900677652
+坏心眼 11.8212361103
+托姆 11.598092559
+令正 11.9547675029
+植物区系 9.82314020807
+本杰明 10.9049453784
+小苹果 12.1089181827
+白矮星 10.3171587135
+英雄团 13.900677652
+府尊 12.8020653633
+聊起来 11.8212361103
+燕青拿 13.2075304714
+偷税漏税 10.4994802703
+赵宗燠 13.2075304714
+苏打饼干 13.900677652
+乔洛 13.2075304714
+潘梓年 12.2912397395
+散热器 10.9049453784
+东北大学 10.4349417492
+奥斯港 13.900677652
+腕子 10.9562386728
+府尹 9.29550746599
+马望本 11.7034530746
+筵上 11.3357282945
+越来越近 9.0884932966
+沃尔夫 9.75754292558
+朱子 11.8212361103
+五十步笑百步 12.5143832909
+特弥斯 13.900677652
+增产增收 12.1089181827
+赶快 6.03051170551
+朱孝 11.5027823792
+固定量 13.900677652
+配载 12.2912397395
+错误做法 11.3357282945
+走资 13.900677652
+厄瓜多尔共和国 12.5143832909
+袁绍欲 12.8020653633
+走走 8.41588071849
+扼腕 11.1926274509
+毛地黄 12.5143832909
+小人得志 11.5027823792
+帕诺夫斯 12.8020653633
+活动状态 12.1089181827
+诃斥 13.900677652
+小人物 9.82314020807
+击退 8.47133202302
+不堪一击 9.82314020807
+蒲墨王子 12.2912397395
+翻译器 13.900677652
+朱学 11.7034530746
+怡情养性 13.900677652
+赶忙 7.82533162089
+有气没力 12.2912397395
+火灭烟消 13.900677652
+得人心 10.2117981979
+侯玉山 12.2912397395
+第一记 13.2075304714
+利血平 11.8212361103
+柳寅东 12.5143832909
+乔治 8.62256299275
+凯瑟琳 11.4157710022
+宗旦 12.5143832909
+刘玉林 10.9562386728
+渔山 12.2912397395
+普拉亚 12.5143832909
+圣战者 12.5143832909
+克格勃 10.2897597393
+文化村 12.1089181827
+棚子 9.66657114738
+托塔 10.4666904475
+白姐 12.2912397395
+赶往 9.00283785202
+铣床 10.7226238216
+小夜曲 11.4157710022
+查德森 13.900677652
+下锅 9.94943393339
+丹青图 13.900677652
+第一课 12.2912397395
+老中医 10.9049453784
+走账 13.2075304714
+淡水河 10.765183436
+赶得 10.0088573539
+糟糠 12.8020653633
+丹江口 10.1871055853
+沃尔塔 13.2075304714
+问诊 11.1926274509
+第几轮 13.900677652
+安丘市 13.2075304714
+各行其是 10.533381822
+全面禁止 10.4041700905
+保证体系 12.1089181827
+两万多块 12.8020653633
+窖藏 10.3743171274
+七千名 12.8020653633
+名声在外 11.3357282945
+中央山脉 9.96885201925
+问话 8.46695564842
+高永昌 13.2075304714
+野山 11.598092559
+隐姓埋名 10.642581114
+同业公会 10.2897597393
+朱富 10.1630080337
+走跌 10.2371160058
+时见 10.5684731418
+夜视仪 10.0505300503
+手工艺 9.94943393339
+县太爷 10.7226238216
+问询 10.2371160058
+水泵房 13.900677652
+朱寿 13.900677652
+信心倍增 12.2912397395
+风必摧之 13.2075304714
+七千吨 12.1089181827
+著称 7.30900391997
+裂解气 12.5143832909
+李嘉乐 13.2075304714
+肆意挥霍 13.2075304714
+走路 7.5393751744
+内插法 11.9547675029
+奥沙利 12.1089181827
+哭诉 9.66657114738
+薪金制 12.8020653633
+扯顺风旗 13.900677652
+球墨铸铁 11.3357282945
+普拉东 13.2075304714
+昌图 11.8212361103
+曹髦 11.7034530746
+立宪派 10.0294766411
+科目 8.90346537821
+赶开 11.0103058941
+慈云寺 11.1926274509
+过节 8.84443184663
+阿穆尔 11.2616203224
+朱家 9.54396882529
+问计 10.1871055853
+遵守合同 11.7034530746
+乔氏 10.7226238216
+要害 8.5440913773
+二百五十四卷 13.2075304714
+徐晓钟 12.8020653633
+激动剂 12.2912397395
+秦舟船 13.2075304714
+杨杏忙 13.2075304714
+下院 9.23723855786
+梅萨维 12.8020653633
+科甲 11.9547675029
+字义疏证 13.900677652
+安哥拉人民解放运动 12.8020653633
+宋诗别 12.8020653633
+那波利 12.5143832909
+结构胶 13.900677652
+河图洛 13.900677652
+死记 12.5143832909
+下陷 9.4233408375
+京顺路 13.900677652
+蜥蜴 9.35738286971
+弓箭步 12.5143832909
+遮天蔽日 10.765183436
+马占山 11.8212361103
+要塞 8.26588804881
+拱抱 13.900677652
+青衣江 11.1280889297
+下附 13.2075304714
+链子 9.74179456862
+公冶长 13.900677652
+野心 8.68574189437
+下降 5.04103015226
+国际法院 10.8096351986
+马光 10.642581114
+下限 8.52078029844
+贝应夔 13.2075304714
+舞狮 11.5027823792
+不容忽视 8.77671367257
+贸易量 10.2897597393
+府库 9.80633308975
+代码变换 13.2075304714
+二三十号 12.8020653633
+强中更有强中手 12.8020653633
+关节镜 13.2075304714
+适用法律 10.4041700905
+大妹 13.2075304714
+货仓 12.8020653633
+托子 12.5143832909
+兰盆会 13.900677652
+急得 8.20023407859
+关门声 12.8020653633
+辰砂 10.6818018271
+满口胡 11.9547675029
+斯宾诺莎 10.0720362555
+发行员 13.2075304714
+变本加厉 10.2117981979
+莽原 13.2075304714
+通济门 11.9547675029
+沦落街头 13.2075304714
+西奈山 12.1089181827
+净本 13.900677652
+李双双 11.9547675029
+洋媳妇 13.900677652
+忽前忽后 13.2075304714
+三十三日 13.2075304714
+白家湾 13.2075304714
+下阕 13.2075304714
+从洛贝尔 13.2075304714
+侏儒症 12.5143832909
+创伤性 11.7034530746
+远为 10.5684731418
+奥斯汀 10.765183436
+立党为公 12.1089181827
+不幸身亡 12.1089181827
+别出新意 13.900677652
+下雪 9.11318590919
+下雨 8.45394028031
+寻宝玉 13.2075304714
+公孙胜 8.90346537821
+本垒打 12.2912397395
+前些年 9.33632946051
+极盛 9.08039608637
+下雾 13.900677652
+关工委 11.598092559
+梅地亚 13.2075304714
+下集 11.598092559
+两百亩 13.2075304714
+相频特性 13.900677652
+经纶满腹 13.2075304714
+杀鸡取卵 11.9547675029
+极目 11.0674643079
+备忘录 8.93783302172
+托宾 11.7034530746
+斯卡尔法罗 13.900677652
+朱士 11.9547675029
+屠龙 10.533381822
+豪言 11.1280889297
+禁例 12.1089181827
+契税 9.7898037878
+迁莺出谷 13.900677652
+维生 11.8212361103
+类似性 12.2912397395
+速来速往 13.900677652
+太上老君 9.89334446674
+拱托 13.900677652
+七千块 13.900677652
+雷庆来 13.2075304714
+雍正帝 10.533381822
+公理学 13.900677652
+左长史 11.9547675029
+梁诸州 12.8020653633
+操营务 13.2075304714
+拱手 7.80485308954
+结构化分析 13.900677652
+埋层 13.900677652
+心声 9.74179456862
+俗世 11.8212361103
+各有千秋 10.8561552143
+永葆 12.2912397395
+张小巧 13.2075304714
+舟楫 10.3453295905
+麦肯锡 11.9547675029
+火箭炮 9.02548032877
+散散步 11.598092559
+朱墨 12.5143832909
+迅雷 9.49395840471
+捉牢 12.8020653633
+对日元 10.6818018271
+下面 6.25815351774
+口服心服 12.5143832909
+赶工 11.7034530746
+赶巧 11.1926274509
+蜡质 10.3171587135
+上半年 6.03242338646
+宽饶 13.2075304714
+气象局 11.3357282945
+俱往矣 12.2912397395
+贸易部 11.4157710022
+固体废弃物 12.1089181827
+最出色 9.93038573842
+汤恩伯 11.2616203224
+经济界 10.3743171274
+祖鲁语 12.8020653633
+江州牢 12.1089181827
+惊雷 10.4666904475
+江州牧 12.8020653633
+昌吉 11.3357282945
+第二十二次 12.8020653633
+阿图尔 13.900677652
+别练 12.8020653633
+门蒂 13.900677652
+罗汉洞 12.5143832909
+一面镜子 10.0940151622
+渔市 13.900677652
+阿布沙 13.900677652
+连连看 13.2075304714
+卡纳维拉尔角 11.9547675029
+宴会 8.43261751084
+面折廷诤 12.1089181827
+何祚庥 10.9562386728
+三田 12.2912397395
+第五等 11.5027823792
+灯市口 11.1926274509
+菩萨 7.58351296523
+舞王 12.8020653633
+缺项 13.900677652
+会理县 12.8020653633
+不得已地 13.2075304714
+长滨乡 12.5143832909
+潮涨潮落 12.8020653633
+文昌宫 11.9547675029
+纳兰容若 13.900677652
+净是 11.5027823792
+性收费 11.9547675029
+巡视员 10.3743171274
+职高 13.900677652
+呼声最高 10.9562386728
+刘晔 10.9562386728
+贤契 11.8212361103
+司长 8.52078029844
+主客场 12.5143832909
+单身白领 13.900677652
+走运 9.91169360541
+走近 7.69814213479
+佩斯捷 13.2075304714
+走进 6.34059718695
+走远 9.24671730182
+工商户 10.3171587135
+淡水湖 8.94485059437
+温吞水 11.5027823792
+门萨 13.2075304714
+时说 8.18694484647
+走过 7.14957618304
+看吧 8.93783302172
+一整头 12.8020653633
+泪如雨下 10.3171587135
+惯性定律 12.5143832909
+时评 11.7034530746
+极短 9.72629038208
+受益权 12.1089181827
+尽到 9.91169360541
+车马坑 10.765183436
+商增裕 13.2075304714
+王太监 13.2075304714
+惊险 9.56994431169
+张文秀 11.7034530746
+手动液压 13.900677652
+医疗器械 8.88339781516
+瑞典王国 13.2075304714
+新收 12.1089181827
+不得已而为之 10.4041700905
+澳元 8.30969067146
+杭家五 13.2075304714
+萨瓦尔 13.900677652
+爱莫能助 11.0103058941
+吕布见 12.2912397395
+意懒心灰 13.900677652
+于武王 12.2912397395
+时论 11.7034530746
+烟波钓徒 13.900677652
+分道扬镳 10.1394775363
+点头应允 11.7034530746
+张乐平 12.2912397395
+和圣德 13.2075304714
+新闻检查 11.598092559
+结晶法 12.1089181827
+斜对面 10.3743171274
+铮亮 13.2075304714
+杭家人 9.14708746087
+走边 8.77671367257
+文书工作 12.8020653633
+肯特山 11.2616203224
+蓝答儿 12.1089181827
+置放 11.598092559
+工商所 10.4041700905
+舟桥 11.5027823792
+德钦巴 12.8020653633
+达子嫂 12.1089181827
+闵行区 10.1871055853
+低等植物 10.9049453784
+一整块 12.8020653633
+极好地 12.5143832909
+申请者 11.1926274509
+严颖书 11.5027823792
+惩恶 12.2912397395
+抛弃 7.75434839431
+迅速 5.23110678014
+抛开 9.18217878068
+渔夫 10.604840786
+永芳 13.900677652
+手册 9.07236391467
+浆洗 10.7226238216
+击键 12.8020653633
+暴起发 12.8020653633
+算符 12.5143832909
+一传十 10.6818018271
+汪桂芬 11.8212361103
+晴空 10.0505300503
+乌拉圭队 13.2075304714
+乔冠华 13.2075304714
+萧方智 11.9547675029
+铸成大错 11.4157710022
+气象学 9.06439574502
+茅大哥 13.900677652
+严耕望 11.3357282945
+摧毁性 12.8020653633
+刘智伯 13.2075304714
+家专 13.900677652
+早报讯 10.9049453784
+白塔 9.98865464655
+葱丝 11.8212361103
+发扬成绩 13.900677652
+昌卫 12.2912397395
+惊醒 7.92179188707
+国家外汇管理局 8.34384959028
+赚头 11.1280889297
+保收 13.2075304714
+小汽车 9.62401153296
+上半天 11.0674643079
+昌升 13.900677652
+时调 11.3357282945
+乔榛 13.900677652
+要带 10.5684731418
+西拉塔 13.2075304714
+喘气声 12.1089181827
+李宗闵 11.9547675029
+孔明自 10.604840786
+身患绝症 12.1089181827
+盲目发展 12.2912397395
+二里庄 13.900677652
+涡旋 10.533381822
+算筹 10.8561552143
+臭架子 12.8020653633
+埃及西奈半岛 13.2075304714
+抛得 12.8020653633
+动画 10.0720362555
+周边国家 9.74179456862
+下部 8.0285598625
+摄影家 11.598092559
+算算 9.84023464143
+盛懋 12.8020653633
+高清晰 12.8020653633
+死话 13.900677652
+电性能 11.3357282945
+恃才傲物 11.7034530746
+区段 10.4349417492
+鲁豫巡 12.2912397395
+本底 12.8020653633
+边景昭 12.5143832909
+朱延 13.2075304714
+地图投影 12.1089181827
+髓心 11.9547675029
+目的旨在 11.9547675029
+朱建 13.900677652
+极热 12.2912397395
+看向 10.0088573539
+电视讲话 11.7034530746
+铁交椅 13.900677652
+布拉茨克 12.5143832909
+渔妇 13.900677652
+科王 13.2075304714
+这间 8.64318227995
+火地岛 10.765183436
+活泼生动 13.2075304714
+揽权纳贿 13.900677652
+学生用品 13.900677652
+战久议 13.2075304714
+官大权 13.900677652
+悲从中来 10.642581114
+锥刺股 13.900677652
+新政府 8.12612610643
+感觉良好 13.900677652
+朱庄 12.1089181827
+朱庆 12.8020653633
+株洲县 11.9547675029
+火腿肠 10.3453295905
+科班 10.4666904475
+七千元 12.8020653633
+更移 13.900677652
+七二六 12.2912397395
+任亚卿 12.8020653633
+生生永 13.2075304714
+十二经脉 10.0940151622
+年三十 10.5684731418
+火腿肉 13.900677652
+科珀 13.2075304714
+汪士铎 13.900677652
+红七军 12.2912397395
+极点 9.04086524761
+横向扫描 13.2075304714
+接发球 11.598092559
+空间科学 10.7226238216
+北宽南 10.6818018271
+野外 8.59240995457
+两三碗 13.900677652
+同盖 13.900677652
+节约能源 9.94943393339
+金鸡纳 11.3357282945
+挣个 11.7034530746
+战守之 11.2616203224
+国而忘家 12.5143832909
+佛力 12.5143832909
+之间 4.46152979906
+够交情 13.900677652
+悦来 11.9547675029
+达卡 10.4349417492
+军官证 13.2075304714
+臭不可闻 11.5027823792
+忽左忽右 12.2912397395
+托尔 10.4666904475
+经济运行 8.11071748108
+清早 9.30555780184
+真宗咸 11.9547675029
+白草科 12.2912397395
+舆论 7.47095817394
+吴沃尧 12.8020653633
+书记员 10.8096351986
+孵化器 10.9562386728
+新疆棉 13.2075304714
+地摊儿 13.900677652
+习称兀 13.2075304714
+朱彤 11.8212361103
+托尼 10.9049453784
+朱彦 13.900677652
+帏幕 13.2075304714
+师出有名 12.2912397395
+替代疗法 12.1089181827
+硫黄 9.44633035572
+科特 11.0103058941
+准备金率 8.37522471284
+圣彼得堡市 12.8020653633
+一九八九年 12.8020653633
+没头没脸 11.2616203224
+郑吉 11.8212361103
+撰着 13.900677652
+朱异 12.1089181827
+雷庆想 13.2075304714
+三分之二 8.74738605748
+蒙脱石 10.9049453784
+前所 10.7226238216
+狄安娜 12.2912397395
+战乱 8.06879517469
+信天游 10.2371160058
+基金项目 11.2616203224
+黑糖 12.8020653633
+鲁普奖 13.2075304714
+大为激动 12.8020653633
+四氢呋喃 11.4157710022
+消石灰 12.8020653633
+人行横道 11.0103058941
+王首道 13.900677652
+半瓶子醋 12.8020653633
+聚光灯 10.7226238216
+欧洲杯 12.8020653633
+炔诺酮 12.8020653633
+霸着 12.2912397395
+硬邦邦 10.9049453784
+捉生 13.900677652
+以利再战 13.2075304714
+洞晓 13.2075304714
+坐困愁城 12.2912397395
+问过 8.57280148319
+安皇后 10.4041700905
+腕带 11.9547675029
+进奉 10.9562386728
+一百单八 11.1926274509
+惊避 13.900677652
+催化机理 13.2075304714
+维特 10.1394775363
+自由贸易 8.9519177616
+置换 8.31342899358
+下野 10.0940151622
+包特氏 12.8020653633
+权函数 13.900677652
+象限 11.0103058941
+布达尔 13.2075304714
+米友仁 11.4157710022
+孵化园 12.5143832909
+姜太公 11.1926274509
+栽倒 9.63799777493
+赫法伊 13.900677652
+著录规则 12.8020653633
+五百万元 11.598092559
+天文台 8.80081122415
+发行史 12.8020653633
+向香兰 12.8020653633
+无约束 11.8212361103
+三分之一 7.85330547293
+公族中 12.8020653633
+细数 10.2117981979
+氧气瓶 10.4666904475
+假性近视 12.2912397395
+溃脓 12.2912397395
+梁国正 13.2075304714
+惊退 13.2075304714
+迁飞 10.3743171274
+跪拜 9.31571017331
+第一轮 9.58318953844
+碎尸万段 10.9562386728
+时超 13.900677652
+朱德 8.6803218269
+开先 13.2075304714
+客服部 11.3357282945
+包皮炎 12.1089181827
+铃木学衍 13.2075304714
+豪赌 9.55687223012
+重振朝纲 13.2075304714
+极目望去 13.900677652
+巴塔哥尼亚 10.8561552143
+魂魄 9.38981814546
+徽号 11.7034530746
+污染源 10.3453295905
+中国移动公司 13.2075304714
+自始至终 9.55687223012
+严格管理 10.3743171274
+洗尘 10.642581114
+纺织器材 12.8020653633
+炊烟袅袅 12.8020653633
+后半段 10.533381822
+契约 8.092535162
+带进去 12.8020653633
+聘用 9.96885201925
+八十公斤 13.2075304714
+弃置 10.9049453784
+跑断腿 12.1089181827
+内酰胺酶 13.900677652
+刚劲有力 12.1089181827
+使命感 10.604840786
+遭绑架 11.4157710022
+罗肃郡 12.2912397395
+一九二九 12.5143832909
+狄更生 12.8020653633
+慕田峪长城 11.8212361103
+回嗔作喜 11.7034530746
+国家队 9.04086524761
+门希尔 12.8020653633
+朱尔 11.9547675029
+棚屋 11.8212361103
+常润 12.8020653633
+徽县 11.7034530746
+长期打算 12.8020653633
+大夏 9.13850371718
+高度机密 13.900677652
+衰翁 13.900677652
+许衡才 13.2075304714
+踩入 12.8020653633
+阴户 10.7226238216
+拜领 11.4157710022
+无从选择 13.900677652
+卧床不起 10.4041700905
+郦寄 13.2075304714
+诺伊 11.2616203224
+张孝若 12.8020653633
+典当业 11.9547675029
+惩戒 9.89334446674
+根拔 13.900677652
+妇产 12.2912397395
+精品工程 11.1926274509
+永胜 10.8096351986
+链式 10.533381822
+介绍费 13.900677652
+那龙岭 13.2075304714
+分解成 9.27570483869
+门脸 11.8212361103
+强迫式 13.900677652
+尼恩特 13.900677652
+十五篇 13.900677652
+渔家 11.1280889297
+软锰矿 11.8212361103
+戈宝权 12.2912397395
+鄂尔 13.2075304714
+法制建设 10.6818018271
+发现异常 10.3743171274
+虞山镇 12.5143832909
+改善目前 12.1089181827
+朱峰 12.5143832909
+半自给 12.5143832909
+软化水 13.2075304714
+巴士拉 10.4041700905
+金河水 12.8020653633
+清太祖 10.5684731418
+伦克 13.2075304714
+托德 12.1089181827
+可渗透 13.900677652
+太白粉 13.900677652
+冬风 13.2075304714
+红曲米 12.8020653633
+文昌市 13.2075304714
+绿丝 12.8020653633
+信哉斯 13.900677652
+钉子户 10.5684731418
+檩条 11.598092559
+圆满解决 10.765183436
+中华民族解放行动委员会 12.1089181827
+四方步 12.5143832909
+鲤鱼潭 12.8020653633
+森林 6.33695798356
+脚踏船 13.900677652
+车首 11.7034530746
+枣仁 11.7034530746
+收银员 12.2912397395
+屋角 9.74179456862
+乌尔比诺 12.5143832909
+威势 9.6811699468
+朝臣 8.48903160012
+副处级 11.9547675029
+炭窑 13.2075304714
+卡斯帕尔 13.2075304714
+徐崇嗣 13.2075304714
+玄德至 12.5143832909
+净手 10.604840786
+妇保 13.900677652
+农村户口 11.7034530746
+玉门市 11.4157710022
+宽银幕 11.2616203224
+布斯塔曼特 12.5143832909
+抛射 9.98865464655
+分解掉 13.2075304714
+射箭场 13.900677652
+千项 13.2075304714
+原定 8.5440913773
+木库莲 11.0674643079
+找事 11.7034530746
+除我之外 12.1089181827
+魏清泉 10.642581114
+订单数 12.8020653633
+夜黑 11.9547675029
+阿尔巴尼亚 9.20019728618
+梦幻般 11.1280889297
+生夏雪 12.8020653633
+贡期 13.2075304714
+问起 8.45394028031
+独联体 9.5062284973
+攻进去 12.5143832909
+达拉特 13.2075304714
+朝聘 11.1926274509
+艾米莉 13.900677652
+闻韩信 13.900677652
+苑仙葩 13.2075304714
+骗子 9.19114745066
+鄂州 9.75754292558
+畏忌 12.5143832909
+链带 12.8020653633
+苯丁酸 13.900677652
+第一路 11.3357282945
+无人驾驶 10.1871055853
+澄清事实 12.5143832909
+安肃公 13.2075304714
+是不是 5.85380814102
+暗物质 12.2912397395
+嚎叫声 12.2912397395
+掌上电脑 13.900677652
+豪迈 9.35738286971
+托幼 11.7034530746
+渔婆 13.900677652
+托平 13.2075304714
+加利亚尼 13.900677652
+忿怒地 12.1089181827
+李方膺 12.2912397395
+库马西 12.1089181827
+案桌 11.8212361103
+腕尺 13.900677652
+饲料原料 13.900677652
+总体性 12.1089181827
+水文地质 10.2371160058
+玄德自 11.0103058941
+徽剧 11.4157710022
+一庹 13.900677652
+弃绝 11.2616203224
+埋头 9.01032852375
+舞着 11.3357282945
+田尔耕 11.9547675029
+这份儿 11.5027823792
+托底 11.1280889297
+啼啼哭哭 12.8020653633
+尉魏思 13.2075304714
+急火火 10.8561552143
+朱巴 12.8020653633
+问路 10.5684731418
+林英海 13.2075304714
+走读 12.5143832909
+初次应答 13.900677652
+奥里亚 11.8212361103
+焦枝线 12.2912397395
+随从官 13.2075304714
+闾里 11.8212361103
+南卡罗来纳州 11.8212361103
+克利青 13.2075304714
+火炎山 13.2075304714
+清辞丽句 13.900677652
+赏给 9.43476953332
+默默无言 10.4666904475
+时辰 7.51717101709
+转战 8.44963919841
+梅尼埃 11.9547675029
+凉水井 13.2075304714
+邮电通讯 11.8212361103
+周奶妈 13.900677652
+法海和尚 13.2075304714
+归纳公理 13.2075304714
+佛得角共和国 13.2075304714
+放射性核素 9.63799777493
+卖身契 12.8020653633
+景峰 12.8020653633
+走访 8.4284069783
+门联 12.8020653633
+杭嘉乔 9.4233408375
+与非 9.16447920358
+曼丁哥 13.2075304714
+丹麦皇家芭蕾舞团 12.8020653633
+硒矿 12.8020653633
+木瓜树 13.900677652
+周强 12.1089181827
+门边 9.02548032877
+一千余万两 13.2075304714
+植物保护 11.7034530746
+东床坦腹 13.900677652
+第一节 9.6811699468
+婚外情 10.9049453784
+引过去 13.900677652
+吴枫 13.2075304714
+萍乡市 11.7034530746
+青少年儿童 13.900677652
+马泰伊 13.2075304714
+精怪 11.1280889297
+肥肥的 13.2075304714
+辣酱 11.2616203224
+揄扬 11.598092559
+李延想 12.8020653633
+区有 9.94943393339
+五七百步 13.2075304714
+徽州 9.28555713513
+淘宝网 8.89004235788
+宋齐 11.598092559
+冬防 12.8020653633
+托儿 12.1089181827
+英雄救美 12.5143832909
+五百多座 13.2075304714
+短短的 8.71889410168
+库司坊 12.2912397395
+赶回 8.30969067146
+奥斯曼 9.11318590919
+托克 11.5027823792
+篮球赛 11.0103058941
+望江亭 13.2075304714
+伦德 12.1089181827
+蜡虫 13.900677652
+拱棚 13.900677652
+雨量器 12.5143832909
+歪歪地 13.900677652
+乔斯 11.598092559
+炸丸子 13.900677652
+毛纺织厂 11.598092559
+救护站 13.900677652
+小圈圈 13.2075304714
+陆陆续续 10.1164880181
+销售价格 9.03314320152
+大座 12.1089181827
+养物丰 13.2075304714
+军团菌属 13.2075304714
+科罗 11.9547675029
+抛却 11.8212361103
+驾上去 13.900677652
+名节 10.2897597393
+时而 8.45394028031
+要到 11.0103058941
+仪节 11.5027823792
+真事 11.0674643079
+鞋粉 13.2075304714
+婚外恋 11.7034530746
+马泰依 13.2075304714
+麦肯齐 11.7034530746
+驾驶人员 12.1089181827
+圆珠笔 10.642581114
+衡山县 12.8020653633
+白虎观 11.3357282945
+张挂在 12.2912397395
+并置 10.2117981979
+幽幽地 10.7226238216
+独奏曲 10.3743171274
+昌德 11.5027823792
+朱勇 13.2075304714
+空气净化 12.1089181827
+话不投机半句多 13.2075304714
+车轮下 11.7034530746
+投石机 13.900677652
+十六七岁 10.3743171274
+沃尔克 11.5027823792
+中组部 10.1394775363
+李岩笑 11.5027823792
+屈驾 11.9547675029
+抛去 11.8212361103
+侠义 10.642581114
+魂门 13.900677652
+踩得 10.6818018271
+俏销 12.2912397395
+好多好多 11.0674643079
+并网 10.1871055853
+七万多 12.2912397395
+污染性 13.900677652
+过阻尼 13.900677652
+老朽无能 13.2075304714
+折痕 13.2075304714
+急急慌慌 11.5027823792
+煤油炉 11.8212361103
+惩治 8.96620371885
+录取分数 12.5143832909
+闷闷地 10.6818018271
+孤儿寡妇 11.2616203224
+府君 11.5027823792
+嫩江县 12.1089181827
+泡腾片 12.2912397395
+第一艘 9.18217878068
+对电极 13.2075304714
+或则 12.5143832909
+碍难 12.5143832909
+外经贸部 13.900677652
+莽夫 12.8020653633
+要办 9.74179456862
+要务 9.5186510173
+恐吓 9.32596667347
+心意拳 13.900677652
+竹子湖 12.5143832909
+神农顶 11.8212361103
+冬雪 11.0674643079
+转辙机 12.5143832909
+失之东隅 12.5143832909
+灌木林 9.87532596124
+白果树 10.6818018271
+拱桥 10.2897597393
+剥茧抽丝 13.2075304714
+居相州 12.8020653633
+平型关战役 12.1089181827
+问芳 12.5143832909
+小道消息 10.3743171274
+销售价 11.1280889297
+少不了 8.77671367257
+新政协 11.4157710022
+官僚主义 10.1630080337
+朱博 13.900677652
+问荆 12.2912397395
+鸦片烟 10.9562386728
+托尔特 11.8212361103
+朱升 12.8020653633
+于昭苏 13.2075304714
+南邦 13.2075304714
+奚静之 13.900677652
+喊起来 9.84023464143
+修术行 12.8020653633
+朱印 12.1089181827
+永辉 11.1926274509
+皮猴儿 13.900677652
+腕力 12.1089181827
+期许 10.5684731418
+维维 10.0720362555
+测电笔 12.2912397395
+能源业 13.900677652
+五代十国 9.12155415886
+并经 9.0884932966
+蒙国恩 13.2075304714
+区星 13.2075304714
+瞭望 8.82550383674
+耙耱 12.5143832909
+经济网 11.1280889297
+保持沉默 10.3743171274
+邹承鲁 13.2075304714
+侠侣 13.900677652
+版权保护 11.8212361103
+兼得 11.0674643079
+弘一 13.2075304714
+雷庆泡 13.900677652
+弘业 11.1280889297
+磁盘格式 13.900677652
+陪侍 9.63799777493
+冬青 10.4994802703
+昌平 9.22784881751
+结束 5.33755552867
+玉殒香消 13.900677652
+胡杨 10.4994802703
+女强人 11.4157710022
+投注站 9.71102290995
+熊汝霖 11.5027823792
+相互尊重 10.604840786
+储蓄金 12.8020653633
+余万件 12.1089181827
+维纶 11.3357282945
+不够意思 12.1089181827
+维纳 10.642581114
+安胎药 13.900677652
+永远 6.22327722146
+定位器 11.9547675029
+接合菌 11.8212361103
+古云 11.9547675029
+六万大山 11.8212361103
+腹股沟 10.2630914922
+徽山 13.2075304714
+弘仁 12.5143832909
+潜蚀作用 12.8020653633
+象马 12.5143832909
+内分泌科 12.2912397395
+组织胺 11.1280889297
+时至 9.44633035572
+科级 11.0103058941
+择善而从 11.3357282945
+朱友 11.8212361103
+野味 9.96885201925
+上层建筑 9.37888907493
+储金会 13.2075304714
+第一茬 13.2075304714
+大姨妈 11.5027823792
+支大军 11.8212361103
+湘雅医学院 12.8020653633
+乱葬岗 11.9547675029
+气象图 12.8020653633
+做活儿 10.9562386728
+加拉帕戈斯 11.1926274509
+侍樊丰 13.2075304714
+几十道 11.9547675029
+昌府 11.5027823792
+罗汉果 10.9562386728
+贡榜 11.9547675029
+曹变蛟 9.72629038208
+廿九日 12.1089181827
+杨涛 11.5027823792
+赶在 9.26594866375
+黑海地区 11.9547675029
+朱厚 10.8096351986
+数滴 12.5143832909
+缎子 9.54396882529
+鄂南 11.7034530746
+从承天 11.7034530746
+问答式 12.1089181827
+小朝廷 11.1280889297
+赶场 11.1926274509
+鄂博 10.1871055853
+劳工部 10.2117981979
+野合 12.1089181827
+皮卡车 13.900677652
+唐太太 12.8020653633
+溃败 8.9308643524
+奥斯本 12.2912397395
+罗瓦涅米 13.900677652
+科组 13.900677652
+扼要 9.7898037878
+不甚明朗 11.9547675029
+望闻达 10.9049453784
+急性毒性 12.8020653633
+渔场 8.73019365694
+周彬 13.900677652
+阿瓦尔 10.9049453784
+一整套 8.83808261895
+头一回 9.04864738806
+时艰 10.6818018271
+朱碧山 12.8020653633
+修指甲 13.2075304714
+硫醚 12.1089181827
+购车人 12.5143832909
+男一号 13.900677652
+南镇抚 12.8020653633
+共线性 11.7034530746
+二氧化物 13.2075304714
+促动 11.4157710022
+痉挛性 10.9562386728
+矫直机 13.900677652
+包下来 11.8212361103
+乔某 11.7034530746
+工具化 13.900677652
+力排众议 10.604840786
+于德性 12.8020653633
+朝贡 9.96885201925
+聘礼 10.0088573539
+岷江 9.31571017331
+斗鸡走马 13.2075304714
+严寒季节 13.900677652
+第四十九章 10.9049453784
+腐败分子 9.43476953332
+第一胎 12.1089181827
+齿槽 11.5027823792
+一整夜 11.0103058941
+上半场 10.2371160058
+鹌鹑 9.84023464143
+问者 13.2075304714
+单色仪 12.8020653633
+一样样 11.8212361103
+门路 9.41204128224
+础润而雨 13.2075304714
+日益严重 9.49395840471
+多倍体 11.3357282945
+抛光 9.96885201925
+合金结 13.900677652
+红绿色盲 11.5027823792
+法院院长 10.7226238216
+不来梅港 13.900677652
+说来 7.79588441956
+好端端 9.20932976975
+武蒂维 13.900677652
+乔林 12.2912397395
+潜规则 9.11318590919
+十六七年 12.2912397395
+原西康 13.2075304714
+围攻战 12.8020653633
+需不需要 11.598092559
+须毛 13.900677652
+社党 13.900677652
+甲天下 10.2630914922
+一整天 9.14708746087
+火光熊熊 11.4157710022
+朱倪 13.900677652
+生地黄 12.5143832909
+氧气管 13.900677652
+腕儿 13.900677652
+嘟嘟哝哝 11.8212361103
+暴跌 7.23372085955
+概予 13.900677652
+埃塞俄比亚人民革命民主阵线 13.2075304714
+经济系 10.1871055853
+常浩 13.2075304714
+贾可萨 13.2075304714
+晨鸣 10.4041700905
+重要讲话 8.90346537821
+豆儿 11.7034530746
+大厨师 13.900677652
+平鲁 12.2912397395
+卢库 13.900677652
+空降师 10.1394775363
+商品信息 12.2912397395
+宏观指导 13.2075304714
+傅家庄 12.8020653633
+埋名 13.900677652
+伞兵部队 10.604840786
+黑非洲 11.0103058941
+李叔明 13.2075304714
+向香帅 13.900677652
+后图 13.900677652
+闹饥荒 11.4157710022
+后半期 9.54396882529
+阳性反应 11.598092559
+可乘之隙 13.900677652
+织布厂 11.9547675029
+制糖业 10.2371160058
+竞驰 13.900677652
+一肚子气 10.6818018271
+四十多名 13.900677652
+工贸结合 13.2075304714
+鸡霍乱 13.900677652
+尊大人 11.8212361103
+九时 11.8212361103
+乔木 8.24119543622
+野地 9.37888907493
+骗回 12.8020653633
+圣玛丽亚 11.5027823792
+时节 8.0746775446
+令慈 13.2075304714
+逐客令 11.4157710022
+奕奕 11.8212361103
+抛出 8.51618258919
+加拿大政府 11.7034530746
+翻涌 10.2897597393
+打退堂鼓 10.6818018271
+德钦哥 12.2912397395
+赶向 12.8020653633
+犁庭扫穴 12.8020653633
+第十七回 11.7034530746
+三五文 13.2075304714
+扛枪 10.9562386728
+硫酸 8.51618258919
+托叶 9.17328983326
+气冲牛斗 12.8020653633
+吃里扒外 11.7034530746
+令您 12.8020653633
+贡嘎机场 12.8020653633
+盼盼 11.8212361103
+行吟诗人 12.1089181827
+陈相公 12.5143832909
+朱允 11.8212361103
+刘家寺 13.2075304714
+朱兄 12.2912397395
+朱兆 13.2075304714
+朱光 12.1089181827
+死谷 11.4157710022
+鄂军 12.8020653633
+朱兰 13.2075304714
+弃物 13.2075304714
+托利 11.9547675029
+维系 8.91707103027
+没拿到 11.7034530746
+黄分兵 12.8020653633
+呼隆呼 13.2075304714
+神经错乱 11.4157710022
+要公 12.2912397395
+夏虫 13.900677652
+烙铁 11.0674643079
+腹哀 13.2075304714
+弓箭手 10.4041700905
+访谈录 11.8212361103
+贸易风 12.5143832909
+泫然 13.2075304714
+杏核眼 12.8020653633
+国际会计 12.5143832909
+科米 12.2912397395
+巴尔加斯 12.8020653633
+三氧化硫 11.7034530746
+封邓禹 13.2075304714
+庆功宴 11.1280889297
+百万立方米 11.598092559
+预压 12.8020653633
+神府煤田 12.1089181827
+自高 11.7034530746
+可控性 10.533381822
+病历 10.2630914922
+晋军得 13.2075304714
+公孙杵臼 13.900677652
+起源于 7.70016847793
+各省市 10.8096351986
+三炮 12.2912397395
+张鑫炎 13.900677652
+贸易额 8.95903522937
+北向南 9.20019728618
+古丽 11.8212361103
+沃尔加 13.900677652
+文昌县 11.598092559
+极缺 13.2075304714
+热拉尔 12.1089181827
+跪求 11.7034530746
+觉察到 9.41204128224
+菲尔 9.77354326693
+出难题 11.3357282945
+巴丹吉林沙漠 10.9562386728
+齿根 12.2912397395
+优抚对象 11.598092559
+棚内 12.1089181827
+夏洛特阿马利亚 12.1089181827
+捉笔 13.2075304714
+布达利 13.2075304714
+乔普 11.9547675029
+托办 13.900677652
+无愧于心 11.9547675029
+二不怕死 12.5143832909
+索丙契 13.2075304714
+然诺 13.2075304714
+陈超英 13.900677652
+赖账 11.1926274509
+杂多县 13.2075304714
+夕惕若厉 13.900677652
+大禹治水 10.7226238216
+事事处处 12.1089181827
+外语课 13.2075304714
+席间 9.84023464143
+两千多米 13.900677652
+永贞 11.3357282945
+补平 12.1089181827
+要击 13.900677652
+刺啦 12.5143832909
+朱凯 13.900677652
+惊鸟 13.2075304714
+转托管 10.2371160058
+信而有证 13.900677652
+朱军 9.80633308975
+伦尼 12.8020653633
+越军乘 12.2912397395
+黎之 12.8020653633
+马萨里克 12.1089181827
+可变 8.47572763449
+代森锌 13.2075304714
+粟子 13.2075304714
+一切众生 11.2616203224
+惊鸿 10.5684731418
+真丹 11.5027823792
+偷香窃玉 12.8020653633
+七千年 12.2912397395
+量能 12.5143832909
+猪八戒 9.04864738806
+汉密尔顿 11.0103058941
+要冲 8.31342899358
+冬闲 11.8212361103
+七二年 13.2075304714
+氧气站 13.900677652
+正天丸 13.900677652
+五宗 12.5143832909
+图形系统 12.5143832909
+金属棒 12.2912397395
+晶体缺陷 13.900677652
+三百五十万 13.2075304714
+行为责任 13.900677652
+坐山雕 12.8020653633
+下页 12.8020653633
+挑动 10.2630914922
+五言绝句 12.1089181827
+下顿 11.4157710022
+科第 12.2912397395
+十九万 13.900677652
+伍献文 13.2075304714
+前途无量 10.8561552143
+名臣 9.53122979951
+槁木 12.2912397395
+长房 12.2912397395
+额尔登 12.8020653633
+纵横交织 11.7034530746
+十九个 11.1280889297
+十九中 13.2075304714
+程光奎 13.900677652
+停停当当 13.900677652
+明帝卒 12.8020653633
+宋江纳 13.2075304714
+云兴霞蔚 13.900677652
+费耶尔 12.8020653633
+不进则退 11.0674643079
+再生之恩 13.2075304714
+挨冻受饿 13.900677652
+沉下去 10.4349417492
+渔具 10.6818018271
+不可讳言 13.900677652
+物质鼓励 13.2075304714
+篮子 8.25877058104
+徐光春 8.49350588052
+性传播 10.604840786
+巴索夫 11.9547675029
+朱嘉 13.2075304714
+磕牙 12.2912397395
+孙甜甜 12.2912397395
+埃克尔斯 12.2912397395
+拐角处 10.4041700905
+刁奴 13.2075304714
+磋跎 12.8020653633
+门诊 8.84443184663
+口出狂言 12.1089181827
+光固化 13.900677652
+客运站 10.2630914922
+弃甲 12.1089181827
+无极分子 13.900677652
+无奈我何 13.900677652
+赶办 12.2912397395
+斐济共和国 13.2075304714
+残次品 13.900677652
+抛妻别子 12.8020653633
+余尊 11.598092559
+甘盘为 12.8020653633
+其味无穷 13.900677652
+绽放 9.82314020807
+昌宫 12.5143832909
+蜡花 12.5143832909
+张成仁 8.9308643524
+进帐 10.2897597393
+豪萨 10.6818018271
+野兽 8.40350942668
+穆勒尔 13.900677652
+德雷斯 12.8020653633
+奥斯托 12.5143832909
+中关村科技园区 11.8212361103
+心慌意急 13.900677652
+十九人 13.2075304714
+气象台 9.59661255877
+壁饰 13.900677652
+七千头 13.900677652
+下风 10.9049453784
+昌安 13.2075304714
+耳语般 12.8020653633
+蒲城县 12.8020653633
+工具厂 13.900677652
+拉什迪 13.900677652
+季大姐 12.8020653633
+欠考虑 11.7034530746
+野兔 9.43476953332
+要图 11.1280889297
+硅化木 12.8020653633
+迅风 13.2075304714
+十六票 13.2075304714
+赶到 6.74840879594
+雪鸟 12.5143832909
+改邪归正 11.0674643079
+五国城 12.2912397395
+赶制 10.8561552143
+截止阀 13.2075304714
+玉梨魂 13.2075304714
+象鼻 11.2616203224
+公采邑 13.900677652
+橡皮塞 13.2075304714
+不揣冒昧 11.9547675029
+赤膊上阵 12.1089181827
+算珠 12.2912397395
+一百一十万箱 13.2075304714
+下颌 8.66423568915
+策略师 9.69598503258
+下颔 12.8020653633
+廉政建设 11.2616203224
+中级法院 10.4041700905
+削发为尼 11.5027823792
+下额 13.2075304714
+幅员 10.9049453784
+达米亚 13.900677652
+怀利 12.5143832909
+托后 13.900677652
+格陵兰岛 10.533381822
+托名 10.4994802703
+冯小军 11.9547675029
+启口 11.4157710022
+路见不平 10.9562386728
+雄赳赳 11.0103058941
+下饭 10.4041700905
+看去 8.230796729
+惊风 10.642581114
+领口处 12.2912397395
+影儿 10.0505300503
+不求有功 12.5143832909
+惬怀 12.8020653633
+新黄浦 11.7034530746
+永记 12.5143832909
+六斤重 13.900677652
+荣于华 13.900677652
+铲起 11.9547675029
+能源经济 10.6818018271
+惑众 11.598092559
+腰板儿 12.8020653633
+并立 9.75754292558
+招蜂惹蝶 13.2075304714
+屋舍 11.0103058941
+五八年 11.7034530746
+净桶 12.2912397395
+江发源 13.900677652
+临夏回族自治州 11.4157710022
+井然有序 10.533381822
+斯摩第 13.900677652
+戒石铭 11.9547675029
+鄂城 10.6818018271
+时蔬 13.2075304714
+溜门撬锁 13.900677652
+马灵往 13.2075304714
+天文学 7.98988100794
+摸掉 13.900677652
+专用权 11.8212361103
+平度 10.5684731418
+黑蒙蒙 12.8020653633
+东汉时期 9.89334446674
+赶去 8.95903522937
+徽墨 11.0674643079
+记号笔 13.900677652
+走脱 10.2630914922
+声名鹊起 11.598092559
+清雍正 9.16447920358
+导演组 13.900677652
+奥布斯 13.900677652
+永诀 11.4157710022
+宫别苑 12.8020653633
+舟曲 12.1089181827
+索尔兹伯里 11.4157710022
+泡泡浴 13.900677652
+梅山镇 13.2075304714
+德里奇 13.2075304714
+英雄无用武之地 11.8212361103
+肾阳虚 9.91169360541
+莽山 12.8020653633
+成菊 9.69598503258
+各赏 12.5143832909
+韵事 13.2075304714
+延安自然科学院 12.8020653633
+专业书 12.8020653633
+赶印 12.8020653633
+溧阳市 12.8020653633
+金寇之 12.8020653633
+轻加工 13.900677652
+乔恩 12.5143832909
+熄灯号 12.5143832909
+于恭 12.8020653633
+近旁 10.4041700905
+马尼拉 9.77354326693
+从庆远 12.8020653633
+液态氢 11.7034530746
+丁取忠 13.900677652
+聘约 13.2075304714
+最末端 12.5143832909
+大大的 8.60737282725
+液态水 11.1280889297
+闷倦 12.8020653633
+德钦县 12.5143832909
+勤勤恳恳 11.1280889297
+东亚国家 11.1280889297
+掩人耳目 10.604840786
+送礼者 13.900677652
+玩弄着 11.598092559
+红旗路 12.8020653633
+于皇庆 13.2075304714
+张岱年 13.2075304714
+捐躯报国 13.900677652
+苛捐杂税 10.4041700905
+修房子 13.900677652
+出继 12.8020653633
+体重儿 12.8020653633
+椎体 10.4666904475
+智渊寺 12.5143832909
+虞氏义 13.2075304714
+铣刀 12.5143832909
+上殿赐 13.2075304714
+刘将军 11.0103058941
+下首 9.77354326693
+埋单 9.4233408375
+一整座 13.900677652
+精彩剧照 13.900677652
+迁都 7.75434839431
+骗出 12.8020653633
+官方语言 8.55834340001
+醉打金枝 13.2075304714
+渔区 10.9049453784
+肠套叠 11.7034530746
+有效数字 12.5143832909
+晋冀鲁豫 9.58318953844
+野口 12.1089181827
+两千多种 13.2075304714
+宝马新 13.900677652
+维科 10.9049453784
+李先念 10.7226238216
+倪藤 12.8020653633
+要员 9.77354326693
+野史 9.96885201925
+三角钢琴 12.8020653633
+杰拉尔 11.9547675029
+三一三十一 13.900677652
+调护 12.5143832909
+击鼓 9.14708746087
+六百多年 13.2075304714
+编集 10.765183436
+屋脊 9.19114745066
+绝大多数 6.95082119697
+哪里找 10.0940151622
+玉亭才 13.2075304714
+汉语拼音 10.3743171274
+刘国钧 12.5143832909
+白帽 11.3357282945
+七星河 12.5143832909
+冰炭不投 13.900677652
+皮布 12.8020653633
+骗到 11.2616203224
+脏乎乎 11.8212361103
+歼敌 9.22784881751
+要命 8.55357012126
+抛售 7.57811241205
+前情 11.8212361103
+与世无争 11.3357282945
+濮州司 12.8020653633
+邓洛普 12.8020653633
+哈科特港 12.1089181827
+张难先 13.900677652
+金鱼藻 12.5143832909
+草稿纸 12.8020653633
+闯进来 9.98865464655
+妇产医院 11.9547675029
+徽宗 10.3743171274
+刘昱 12.8020653633
+韵脚 11.5027823792
+诺福克岛 12.5143832909
+朝西 10.642581114
+走船 12.8020653633
+予以强调 13.900677652
+氧气罐 13.900677652
+颐养天年 11.4157710022
+小鱼 8.82550383674
+创建 6.93276845017
+着陆器 12.1089181827
+非法传销 13.900677652
+宋府州 13.2075304714
+永裕 12.5143832909
+率尔成章 13.2075304714
+玄乎 11.3357282945
+康塔塔 10.5684731418
+言出法随 12.8020653633
+战例 9.80633308975
+上半叶 8.86372504956
+后羿 11.1280889297
+颈脖 10.9049453784
+立新帝 13.900677652
+拨来拨去 12.5143832909
+延长时间 11.9547675029
+发消息 12.2912397395
+惊魂 10.0088573539
+控制论 9.56994431169
+抢功 12.8020653633
+金蝉脱壳 11.1280889297
+咳痰 11.0674643079
+母质层 11.9547675029
+极端 7.31450599712
+异军突起 9.14708746087
+惕厉 13.900677652
+安歇 8.63798746307
+夏王相 13.900677652
+赶做 13.2075304714
+并祝 13.900677652
+广西壮族自治区 8.59737274392
+冲积物 9.96885201925
+缺门 13.900677652
+朝觐 9.25628675283
+洞洞 11.598092559
+朝见 9.24671730182
+异步控制 13.900677652
+丘墓 13.900677652
+长白山脉 10.4666904475
+老许 13.900677652
+渔叟 13.2075304714
+风云 8.65893063692
+一氧化铅 13.900677652
+发光物 13.2075304714
+原理图 13.900677652
+列宁全集 11.2616203224
+赛米尔 11.598092559
+西尼耳 10.9049453784
+渔友 12.5143832909
+渔叉 12.2912397395
+阿瓦士 12.1089181827
+闻得王 12.5143832909
+经贸合作 9.71102290995
+快去快回 11.8212361103
+上海开明书店 13.2075304714
+授信额度 10.1164880181
+抛向 10.2371160058
+卢九德 12.1089181827
+专业训练 10.9049453784
+在编人员 13.900677652
+抹稀泥 13.2075304714
+司农赋 13.2075304714
+渔利 12.8020653633
+多得是 11.9547675029
+赶出 8.80081122415
+鄂西地区 11.8212361103
+掌相合 13.900677652
+印锡茶 13.2075304714
+科研 7.83689244329
+着陆场 13.900677652
+桓彝 12.8020653633
+刘建超 12.1089181827
+影写 12.8020653633
+铲车 11.4157710022
+以牙还牙 10.4666904475
+红旗车 12.5143832909
+乔拉 12.5143832909
+泛北极 12.1089181827
+保管员 11.7034530746
+葛老 13.900677652
+销户 13.900677652
+人体器官 11.7034530746
+硫铁 10.6818018271
+左近 10.3743171274
+大征 13.2075304714
+啃噬 11.0674643079
+数回 13.900677652
+铵盐 10.9049453784
+抗敌剧社 13.900677652
+德钦党 12.1089181827
+两千八百九十部 13.2075304714
+张若麟 13.2075304714
+约克敦 13.2075304714
+舞美 11.9547675029
+导演系 11.3357282945
+行市 10.8561552143
+惊骇 9.04086524761
+普通外科 12.8020653633
+府县 9.71102290995
+刘纪鹏 10.3171587135
+后半拍 13.900677652
+计划编制 13.2075304714
+第二十二条 11.7034530746
+彻查 10.9562386728
+闻皇叔 12.5143832909
+赶写 12.1089181827
+起草文件 12.8020653633
+供体 11.7034530746
+铲运 13.2075304714
+赶入 10.2371160058
+强痛定 13.2075304714
+灿若明霞 12.8020653633
+菇类 12.5143832909
+孤标傲世 13.2075304714
+陷害忠良 12.1089181827
+乔扮 12.5143832909
+哈尔西 12.8020653633
+遵纪守法 10.604840786
+员额 9.63799777493
+莫来石 12.5143832909
+缺钱 9.36807815882
+惊驾 11.2616203224
+四十万零八千 13.2075304714
+驮马 12.8020653633
+乔托 12.1089181827
+每盒 12.2912397395
+农习班 13.2075304714
+蜡膏 13.2075304714
+广深高速 13.2075304714
+惊马 13.2075304714
+真俗 13.900677652
+汤旺河 11.7034530746
+缺钙 10.8096351986
+饮水量 11.5027823792
+二路 9.75754292558
+期货 5.89564430734
+张汉笑 12.5143832909
+经济科 13.2075304714
+骗去 12.5143832909
+入级检验 13.900677652
+患病者 12.1089181827
+镇沅 12.8020653633
+埋入 9.87532596124
+袁绍既 13.2075304714
+吴起传 13.2075304714
+九百门 13.900677652
+骗取 9.91169360541
+月明星稀 11.8212361103
+向华强 12.8020653633
+北冰洋 8.66956903512
+种姓 9.17328983326
+溃敌 13.900677652
+一百四十 10.8561552143
+看不起人 13.2075304714
+拼不过 13.2075304714
+倪萍 12.5143832909
+纵目远望 13.900677652
+汤汤水水 12.2912397395
+性取向 12.5143832909
+蓖麻蚕 11.9547675029
+资质聪颖 13.900677652
+令箭 9.80633308975
+钦州市 11.8212361103
+松锦 12.2912397395
+朝霞 9.91169360541
+开销 9.04864738806
+下葬 9.35738286971
+胆大妄为 10.4666904475
+负屈含冤 13.2075304714
+殷开山 12.1089181827
+罗养性 13.2075304714
+新房网 12.8020653633
+同明远 12.2912397395
+科朗 13.2075304714
+朝露 11.7034530746
+陈可畏 11.9547675029
+四平方米 13.900677652
+三四十样 12.8020653633
+购车和 12.1089181827
+信封袋 13.900677652
+害鸟 12.8020653633
+维柯 11.0103058941
+师尚父 13.900677652
+继承权 9.45802639549
+古已有之 10.8561552143
+超时限 13.2075304714
+玉清昭 13.2075304714
+贡瀛 13.2075304714
+元景炎 13.2075304714
+张顺再 12.8020653633
+三十席 13.900677652
+黄皮书 12.2912397395
+战斗部队 10.9049453784
+转角处 11.1926274509
+下营 11.1926274509
+诺夫 9.53122979951
+孟语 13.2075304714
+独特性 10.0720362555
+旷继勋 13.2075304714
+站队 10.1871055853
+田直典 13.2075304714
+屈节 12.8020653633
+洞玄 12.5143832909
+癞病 13.900677652
+下落 7.83456956187
+行凶 9.44633035572
+信风带 11.2616203224
+苏沪杭 12.5143832909
+鱼香肉丝 12.5143832909
+半截脸 13.900677652
+专业厂 13.2075304714
+王三槐 13.2075304714
+荐任 11.7034530746
+奥斯纳 13.2075304714
+迁走 11.4157710022
+隔溪 13.900677652
+提供支援 12.1089181827
+寂然不动 12.2912397395
+跪着 12.5143832909
+普拉德 13.2075304714
+森然 10.7226238216
+瑰奇 12.5143832909
+并条 13.2075304714
+宋官本 13.2075304714
+暴燥 12.8020653633
+俏货 13.2075304714
+媒体报道 7.50876053858
+偶联 11.1280889297
+安菲浦 13.2075304714
+类似物 11.0674643079
+烦燥 11.8212361103
+漫录 13.2075304714
+大对虾 13.2075304714
+数千万美元 12.5143832909
+维权 8.67493097826
+丁一笑 13.2075304714
+披得 13.900677652
+科林 12.2912397395
+贤弟 8.61747392324
+毕业证书 10.8561552143
+诺姆 11.9547675029
+说空话 11.5027823792
+时风 12.8020653633
+离心机 11.598092559
+经贸界 13.900677652
+大兴水利 11.9547675029
+刘道衡 13.900677652
+暖壶 11.0674643079
+黑绸 12.5143832909
+董卓欲 13.2075304714
+芳姿 13.2075304714
+韩拔陵 13.2075304714
+朽迈 13.2075304714
+闻风响应 12.1089181827
+混流式 12.5143832909
+于罗兰 13.900677652
+并未 6.22698952271
+撰拟 11.2616203224
+重新加入 11.1280889297
+一千间 13.2075304714
+缺课 13.2075304714
+视觉效果 10.7226238216
+解放日报报业集团 13.900677652
+黑绿 11.598092559
+汉发兵 12.5143832909
+联合经营 12.5143832909
+神完气足 13.900677652
+易腐烂 12.2912397395
+宣言书 11.7034530746
+永陵 11.3357282945
+从江县 13.900677652
+别作声 13.2075304714
+蜡黄 9.85762638414
+鹅口疮 12.5143832909
+赶上 7.5411037833
+耳根清净 13.2075304714
+翩若惊鸿 12.8020653633
+幕后人物 13.2075304714
+骡子 7.77599426108
+独当 12.2912397395
+葛洲坝水电站 11.8212361103
+专业化 8.30225569298
+襄阳 7.54979193526
+城中心 10.7226238216
+中外驰名 12.1089181827
+算清 11.0674643079
+妇委 13.2075304714
+屯守 12.5143832909
+博庭欢 13.2075304714
+齿状 10.9562386728
+钢琴伴奏 12.2912397395
+赶修 13.900677652
+解税粮 12.5143832909
+东白山 12.8020653633
+议论文 11.7034530746
+原唱 13.2075304714
+妄言 9.98865464655
+模糊控制 11.9547675029
+大风雨 12.8020653633
+十九匹 13.900677652
+初春 10.0720362555
+东伸入 12.5143832909
+社会局 13.2075304714
+米尔登 12.5143832909
+朝阳 8.48903160012
+洞庭湖区 10.765183436
+驱虫剂 11.8212361103
+无可非议 10.9049453784
+漫延 11.7034530746
+电子电离 12.1089181827
+艾里 11.9547675029
+十年如一日 12.8020653633
+发工资 10.4994802703
+雷琐辛 13.900677652
+鸡蛋壳 12.2912397395
+今何在 12.2912397395
+哄抢 10.5684731418
+沙文主义 10.4041700905
+情报侦察 13.2075304714
+弗吉尼亚 9.5062284973
+处之泰然 12.2912397395
+富春江 10.4041700905
+库赫 13.2075304714
+经世致用 10.1871055853
+塔尔坝 12.8020653633
+真仙岩 12.8020653633
+改朝换代 10.0505300503
+斯蒂芬斯 12.8020653633
+终审权 12.5143832909
+这就是说 8.63798746307
+玉檀忙 11.0103058941
+租房子 11.0674643079
+热收缩 12.8020653633
+十几二十年 12.8020653633
+杨杏佛 12.2912397395
+迎国庆 12.5143832909
+绽破 13.2075304714
+依法追究 10.1871055853
+羽衣 10.5684731418
+凄凉 8.51160592216
+开刀手术 13.2075304714
+区级 11.7034530746
+门阶 13.2075304714
+回头率 11.5027823792
+布然斯 12.2912397395
+扈蒙 13.2075304714
+全球华语 13.900677652
+静力学 10.0088573539
+翻译机 13.2075304714
+洛色林 12.8020653633
+啼笑皆非 11.4157710022
+阅兵式 10.4994802703
+妇女 6.3940858719
+极早 12.2912397395
+明人不做 13.900677652
+喷气机 12.8020653633
+紫玉兰 13.900677652
+埋伏 7.88696249593
+显俊 13.2075304714
+半吊子 11.8212361103
+斑斑驳驳 11.9547675029
+达克 10.0505300503
+净瓶 10.5684731418
+层层落实 13.900677652
+暗底下 13.900677652
+门阀 9.58318953844
+急剧 7.34389929582
+气象仪 13.900677652
+理头发 12.5143832909
+西自邕 12.8020653633
+教书先生 11.4157710022
+日射病 13.2075304714
+飒爽 11.9547675029
+东引岛 13.2075304714
+科曼 13.2075304714
+高血压 7.9817837977
+豪饮 11.0103058941
+警务人员 13.2075304714
+冬运 13.2075304714
+三百四十余万两 13.2075304714
+安菲波 12.8020653633
+屯子 9.41204128224
+十多元 13.900677652
+邓弘 13.2075304714
+北方网 13.2075304714
+公司业绩 7.04737855879
+门限 11.8212361103
+徐星伯 12.8020653633
+十九号 12.8020653633
+大弟 10.8096351986
+矛盾加深 11.7034530746
+口岸 8.39534611604
+利特尔 11.8212361103
+凄冷 11.7034530746
+永靖 10.9049453784
+经济林 9.33632946051
+叫化 11.4157710022
+贴心话 12.2912397395
+碳化钨 12.1089181827
+一个二十岁 13.2075304714
+居大不易 13.2075304714
+言之过甚 13.2075304714
+伍应星 13.2075304714
+骗上 13.900677652
+加里曼丹岛 10.3171587135
+维族 10.9562386728
+接茬儿 12.5143832909
+稀少 7.92941581219
+反抗者 11.7034530746
+闪来 13.900677652
+第一颗 9.30555780184
+二舅母 12.5143832909
+命令性 12.5143832909
+会够 13.2075304714
+各谋 13.2075304714
+妩媚 8.94485059437
+如何治 11.9547675029
+拱状 12.1089181827
+望襄垣 12.8020653633
+玉和尚 12.5143832909
+太常寺 10.0940151622
+格布哈 13.900677652
+促销价 13.900677652
+廉亲王 12.2912397395
+碳化钛 12.5143832909
+碳化钙 11.598092559
+出头首 13.2075304714
+邱道人 12.8020653633
+巴西队 12.2912397395
+乔羽 13.900677652
+永铭 13.2075304714
+贡物 10.1394775363
+凄切 11.7034530746
+黄潜善 11.598092559
+饲料 7.88452049228
+恹恹 11.4157710022
+销售员 10.1630080337
+极易 8.61747392324
+门闩 9.65218240993
+一把手 9.15574552361
+水费 10.5684731418
+舞技 12.2912397395
+张荫桓 12.8020653633
+人言籍籍 12.5143832909
+拉齐拉卡 13.900677652
+林吉特 13.900677652
+捉拿 9.10488710638
+科教 10.8561552143
+急急如律令 11.598092559
+科敛 11.4157710022
+观光者 12.2912397395
+应用程序 10.4994802703
+依从性 12.5143832909
+维斯 10.8096351986
+真空蒸发 13.2075304714
+姚弋仲 12.2912397395
+真传 10.9049453784
+极昼 11.7034530746
+一炷香 10.5684731418
+蔫不唧 13.2075304714
+小辫子 11.598092559
+成本法 11.0674643079
+谷神星 13.2075304714
+顾大嫂 9.40086798165
+时髦 8.98069672615
+一把抓 10.0505300503
+植物病理 12.5143832909
+实验设计 11.1926274509
+玄德修 13.2075304714
+篮球鞋 13.900677652
+植物神经 10.6818018271
+技术奖 13.900677652
+经典性 11.2616203224
+手刹 11.7034530746
+兼容机 12.5143832909
+卡地亚 11.7034530746
+余丛考 12.5143832909
+轻喜剧 12.2912397395
+下蛋 10.1871055853
+一百几十年 13.2075304714
+刘知寨 10.6818018271
+国际性 8.75901409547
+献爱心 11.598092559
+语甫 13.900677652
+伯克之 12.8020653633
+科文 12.5143832909
+薄膜袋 13.900677652
+门锁 10.0505300503
+骗人 9.26594866375
+丧权辱国 10.3743171274
+手刃 11.3357282945
+大桥头 10.5684731418
+玉亭级 12.8020653633
+焦黑 10.8096351986
+及时行乐 12.8020653633
+托关系 11.5027823792
+玉阶 10.9049453784
+弘善 12.5143832909
+问题 3.96351357308
+议价 9.17328983326
+操作手 11.3357282945
+迅速行动 10.8561552143
+迁进 13.2075304714
+麦卡锡 11.598092559
+府上 8.6966709649
+爬山虎 11.4157710022
+从宁远 10.765183436
+西孟加拉 11.9547675029
+武城山 12.8020653633
+诺安 8.41173992582
+高技能 12.5143832909
+阿伯思 13.2075304714
+镉米 12.8020653633
+投上去 13.2075304714
+朝闻 12.1089181827
+第二十二章 10.2630914922
+地笑丁 13.2075304714
+第一项 10.2117981979
+令祖 13.900677652
+住房贷款 9.82314020807
+第一页 11.3357282945
+丁仪 12.2912397395
+城郊乡 12.8020653633
+门钹 12.5143832909
+拖网船 13.900677652
+富裕 7.84623830571
+篮球队 11.7034530746
+捉掐 13.900677652
+渡边 12.8020653633
+贡献 6.04203699635
+乞讨者 12.5143832909
+酒气冲天 12.5143832909
+忘我工作 12.8020653633
+丛莽 12.1089181827
+姊姊 11.0674643079
+第一首 11.0674643079
+乌兰巴托 10.6818018271
+赦罪 10.6818018271
+军乐队 10.8561552143
+渔业 7.59989185731
+邓州 9.21854642485
+开玩笑 7.94484028251
+经久不衰 10.8561552143
+惊蛰 10.9562386728
+雕栏 11.0674643079
+森特 12.5143832909
+门钉 13.900677652
+站长 7.63918596765
+侍姬 12.2912397395
+可控硅 12.1089181827
+极板 11.5027823792
+弘吉 11.598092559
+分润 11.9547675029
+文化界 9.96885201925
+屈膝 9.59661255877
+极有 8.27666014579
+志得意满 10.4666904475
+销售商 10.3171587135
+逢到 10.4041700905
+教学楼 9.7898037878
+野人 8.67493097826
+室内空气 10.4994802703
+彤云密布 11.1926274509
+科摩 12.1089181827
+置疑 10.9562386728
+十九元 13.900677652
+乔红 13.2075304714
+见机行事 10.4041700905
+嬗变 10.6818018271
+地广人稀 10.0940151622
+善者不来 11.2616203224
+酋长国 10.0940151622
+姊妹 8.10461990121
+加油站 9.23723855786
+一个四品 12.2912397395
+缺血 9.98865464655
+诺威 12.2912397395
+宗主汗 13.2075304714
+诺娃 12.2912397395
+封宗王 13.2075304714
+精卵结合 13.2075304714
+三百五十六 12.8020653633
+门铃 10.1871055853
+枣子 9.96885201925
+纳税人 8.31342899358
+周起 12.5143832909
+瞄来瞄去 13.900677652
+社会规范 10.3171587135
+渔人 10.1871055853
+岗松 12.5143832909
+大院里 9.72629038208
+濮州临 12.8020653633
+玉娇龙 13.2075304714
+优势产业 10.9562386728
+渔产 11.3357282945
+喷射出 11.598092559
+东沟县 13.2075304714
+第一餐 12.8020653633
+准军事化 12.1089181827
+旅途愉快 13.2075304714
+妇孺 10.7226238216
+择友 12.1089181827
+击节 10.4041700905
+漫山 11.5027823792
+皇家马德里队 13.900677652
+呼么喝六 13.900677652
+维摩 11.0103058941
+拱猪 13.900677652
+位夏婆 12.5143832909
+博古堂 12.5143832909
+仗势欺人 11.8212361103
+野中 12.1089181827
+凄厉 9.53122979951
+搜肠刮肚 11.2616203224
+盐酸盐 10.9049453784
+捉捕 13.2075304714
+竞争对手 8.34384959028
+算法 8.69119149913
+定界符 13.2075304714
+氨茶碱 12.1089181827
+螳螂 10.0720362555
+骗保 13.2075304714
+李将军 11.3357282945
+贫苦人家 13.2075304714
+无现金 13.2075304714
+和吏科 13.2075304714
+暖室 13.900677652
+存心不良 13.2075304714
+贤徒 11.1926274509
+李香兰 13.2075304714
+可氧化 13.900677652
+应用程式 13.900677652
+电力设施 11.9547675029
+抗氧化性 12.2912397395
+盘中盛 13.900677652
+抢到 9.93038573842
+贝斯提 12.5143832909
+铺路 9.66657114738
+许衡知 13.2075304714
+安帝建 13.2075304714
+阴盛阳衰 11.8212361103
+广宗寺 13.2075304714
+要义 10.2371160058
+要么 8.25170341381
+扶沟县 11.598092559
+干旱区 9.65218240993
+讯号线 12.8020653633
+聘期 12.1089181827
+软脂酸 12.1089181827
+奥西波夫 13.2075304714
+骨胳 12.5143832909
+大岳 12.8020653633
+副州长 12.2912397395
+机械室 13.2075304714
+铜唇铁舌 13.900677652
+安西将军 11.8212361103
+陆逊子 13.2075304714
+或以 9.02548032877
+陶志彭 13.900677652
+隔声量 12.8020653633
+李光耀 11.1926274509
+画中人 11.9547675029
+乔科 13.900677652
+并提 10.533381822
+避风港 9.7898037878
+改不了 10.2897597393
+缉拿罪犯 13.900677652
+下聘 12.5143832909
+望夫云 12.5143832909
+望穿 12.1089181827
+隐秘处 12.5143832909
+马凯 11.8212361103
+一千岁 13.900677652
+艾克尔 13.2075304714
+民主协商 12.5143832909
+特拉法 13.900677652
+施工图 11.9547675029
+政治委员 7.94484028251
+任开州 12.8020653633
+献花 11.1926274509
+朱三 12.2912397395
+剪指甲 12.1089181827
+专业型 13.900677652
+泫然泪下 12.8020653633
+极性 9.24671730182
+北伐军 9.40086798165
+朱丹 11.9547675029
+启动 6.17226187213
+朱丽 11.3357282945
+葛弗阿 12.8020653633
+四角俱全 13.900677652
+同红霞 13.2075304714
+赡养人 12.5143832909
+并排 8.95903522937
+煤铁矿 13.900677652
+杭家大 10.1394775363
+迁西 11.5027823792
+在职进修 13.2075304714
+拉进去 11.9547675029
+食肉兽 11.4157710022
+朱仙 13.900677652
+李正敏 12.8020653633
+朱仝 8.97342396682
+发制品 11.4157710022
+金量来 12.8020653633
+封于康 12.8020653633
+念义 13.900677652
+剽掠 12.5143832909
+鄂东 10.4041700905
+上述事实 11.0674643079
+信天翁 10.7226238216
+悦目 11.2616203224
+要以 8.32094782599
+或事物 12.2912397395
+金石滩 12.8020653633
+有条理 10.9049453784
+频频点头 9.55687223012
+邓婕 8.092535162
+包头市 10.1871055853
+极想 11.0674643079
+议论性 13.900677652
+要价 10.0720362555
+要件 9.98865464655
+走石飞沙 12.1089181827
+二十篇 13.2075304714
+塞进去 11.0103058941
+参考资料 10.604840786
+马厂塬 13.2075304714
+山巨岩 12.5143832909
+下肢 9.19114745066
+五中全会 9.82314020807
+离家近 11.8212361103
+溃逃 9.82314020807
+要事 10.4994802703
+溃退 9.77354326693
+北京朝阳医院 12.1089181827
+人参 8.26946587015
+期限 6.68323422028
+拍片子 13.900677652
+从玉泉 13.900677652
+观摩会 13.900677652
+阿鼻地狱 11.5027823792
+畏罪自杀 10.6818018271
+修业年限 11.1280889297
+确切的说 13.900677652
+维持 5.37531789789
+古来氏 12.1089181827
+七八匹 13.2075304714
+流水过程 13.900677652
+一个四十 11.8212361103
+重庆地区 11.9547675029
+马万祺 12.5143832909
+简在帝心 13.900677652
+工商界 10.7226238216
+下肚 9.77354326693
+或为 10.9049453784
+要人 9.87532596124
+时鲜 11.0103058941
+威尔 9.6811699468
+罗德里克 12.5143832909
+并拢 10.4994802703
+张寿 11.3357282945
+海达尔 13.2075304714
+要位 13.2075304714
+天津医科大学 13.900677652
+击落 9.5186510173
+革命力量 10.1164880181
+窖酒 12.5143832909
+下腰 9.32596667347
+马兰花 10.9562386728
+易平 13.900677652
+维拉 10.6818018271
+抛下 9.55687223012
+下腹 10.1394775363
+极慢 11.598092559
+文化学术 11.3357282945
+乌勒吉 13.2075304714
+劳保用品 13.900677652
+打来打去 11.8212361103
+塞努尔 13.2075304714
+项目前期 11.2616203224
+和羽纹 13.2075304714
+销售区 13.900677652
+炭子冲 12.8020653633
+向义军 11.4157710022
+朱佩 12.5143832909
+贡生 10.533381822
+尉袁绍 11.8212361103
+邓容 13.2075304714
+并报 10.8096351986
+问鼎 10.4666904475
+撮弄 11.7034530746
+王蜀宫 13.2075304714
+邓家 12.8020653633
+极意 12.5143832909
+魏兵皆 12.2912397395
+犹豫不决 9.36807815882
+兴化戏 13.900677652
+文献考证 12.8020653633
+望江县 13.2075304714
+太仆 10.9562386728
+戴逸 11.9547675029
+倪麟 13.2075304714
+邓实 13.2075304714
+邓宝 13.2075304714
+手劲 11.4157710022
+科托 12.5143832909
+俞先生 13.2075304714
+隔湖 13.2075304714
+摩门教徒 13.2075304714
+狂犬病 9.74179456862
+下脚 10.6818018271
+维护 6.19226698472
+下脘 12.8020653633
+围隔 12.5143832909
+极愿 13.900677652
+大好形势 10.5684731418
+下臣 10.1164880181
+斯大林格勒 9.82314020807
+兼容性 11.7034530746
+显亮 13.2075304714
+下自 13.900677652
+一日之长 13.2075304714
+下至 9.17328983326
+逃避 8.26588804881
+或体 12.5143832909
+忠孝两全 13.900677652
+深水 8.4284069783
+开闭 10.7226238216
+散文随笔 13.2075304714
+稀客 11.2616203224
+鄂伦 12.5143832909
+米什科尔茨 13.2075304714
+波及面 11.7034530746
+爪哇虎 13.2075304714
+冬训 10.604840786
+宇文虚中 10.2117981979
+由左向右 13.900677652
+概况 7.92941581219
+价格竞争 11.1926274509
+维修中心 12.8020653633
+腕上 10.0505300503
+鳌拜 9.87532596124
+投标法 11.2616203224
+咯痰 11.5027823792
+卡瓦列里 12.1089181827
+北河口 12.8020653633
+申请量 11.9547675029
+俄罗斯共 13.900677652
+懵懵 13.2075304714
+前愆 11.8212361103
+保管人 11.8212361103
+不消说 10.533381822
+黄原府 13.2075304714
+含氰苷 13.2075304714
+云瑞霭 13.2075304714
+如醉方醒 12.5143832909
+单色光 10.9562386728
+并成 11.5027823792
+贵昆铁路 11.598092559
+饮食习惯 9.61021821083
+科拉 10.642581114
+美欣达 11.598092559
+嚷出来 12.1089181827
+宗族势力 11.9547675029
+舒卷自如 12.5143832909
+宋马令 13.2075304714
+甄的香 13.900677652
+公有住房 13.900677652
+社会学 7.86280673205
+西洞庭 11.3357282945
+缺货 10.3171587135
+普拉姆 12.8020653633
+何春芳 11.8212361103
+天大地大 12.8020653633
+分派 9.13850371718
+妫满 12.5143832909
+缓冲带 13.2075304714
+白色污染 12.8020653633
+许允 12.2912397395
+吴兵骤 13.2075304714
+舞曲 9.5186510173
+技术工 12.5143832909
+托伦 12.5143832909
+铲除 9.54396882529
+联合晚报 12.2912397395
+名誉主席 9.56994431169
+体弱 10.1164880181
+走马 10.1871055853
+此基础 8.15128466607
+俄而 12.8020653633
+托住 10.4666904475
+穿心莲 12.5143832909
+经济性 9.01032852375
+叶廷芳 13.900677652
+手力 12.2912397395
+非驴非马 13.2075304714
+清营汤 12.5143832909
+下船 9.35738286971
+一十七个 13.900677652
+猖獗一时 13.2075304714
+冬衣 10.9562386728
+棕红色 10.3743171274
+老肖 11.3357282945
+引潮力 11.4157710022
+信任度 10.9562386728
+良药苦口利于病 12.2912397395
+马梯尼 13.2075304714
+碱性岩 11.1926274509
+回笼资金 9.18217878068
+七间 12.5143832909
+侯逸凡 13.900677652
+奸狡 11.9547675029
+李香君 10.8096351986
+钢化玻璃 12.2912397395
+狄更斯 10.4041700905
+走高 6.66505851091
+私家侦探 12.1089181827
+墨色清 13.2075304714
+俞府 13.900677652
+呼救信号 11.9547675029
+钱坑 11.9547675029
+平汉路 11.8212361103
+魏道武 10.4041700905
+从量税 12.5143832909
+好去处 10.0088573539
+妇幼 12.1089181827
+报春花 10.9562386728
+犹豫不前 11.9547675029
+枣庄 10.8561552143
+永通 11.5027823792
+一肚子火 10.9049453784
+永逝 13.2075304714
+冬葵子 13.900677652
+冬装 11.0674643079
+扶眉战役 12.5143832909
+十瓶 12.2912397395
+萧秋水 13.900677652
+可定义 11.598092559
+普拉多 12.5143832909
+金朝四 13.900677652
+恻隐 12.1089181827
+氰酸酯 13.2075304714
+茫崖 10.9562386728
+弘农 10.642581114
+喀土穆 10.765183436
+朝里 9.94943393339
+朝野 8.4980002701
+中生代 8.27666014579
+穹幕 12.8020653633
+漫天 9.13850371718
+塌下来 10.4994802703
+扣点 12.5143832909
+死魂灵 11.5027823792
+心存 8.82550383674
+不得而知 8.97342396682
+窝里横 13.900677652
+马上得天下 11.2616203224
+万出头 13.2075304714
+需承担 12.5143832909
+共总 11.7034530746
+桑塔那 11.8212361103
+亚硝胺 11.0674643079
+额尔济 13.2075304714
+酒气熏人 13.2075304714
+美梦成真 13.2075304714
+蓼蓼 13.900677652
+贪滥 12.5143832909
+下药 10.765183436
+查特豪 12.8020653633
+枣强 11.1926274509
+播放机 11.598092559
+妾身 10.4041700905
+一二百两 12.1089181827
+科性 13.900677652
+一百余年 11.9547675029
+丽色 13.2075304714
+一部分千户 13.2075304714
+鼙鼓 11.7034530746
+肯吃苦 13.2075304714
+中央戏剧学院 10.4041700905
+机智幽默 11.598092559
+尼日尔 9.07236391467
+战术情报 13.2075304714
+核垄断 12.2912397395
+蓼蓝 13.2075304714
+科思 13.900677652
+张顺因 13.2075304714
+中华人民共和国中央人民政府 10.4666904475
+刘晏继 12.8020653633
+独生子女 9.62401153296
+影像 8.83808261895
+四化建设 12.1089181827
+巴彦高勒 12.5143832909
+澉浦 10.604840786
+向宗正 12.8020653633
+相邦冉 13.2075304714
+扰民 10.1871055853
+稀奇 9.27570483869
+四海鼎沸 12.8020653633
+十五只 11.598092559
+圣凯瑟琳 13.900677652
+屋顶 8.05713323494
+不解之仇 13.900677652
+科恩 10.3743171274
+实业界 11.7034530746
+制糖厂 11.1926274509
+妇德 12.1089181827
+陈尧叟 13.2075304714
+拱石 13.900677652
+一千余万元 13.2075304714
+期间 5.14620134569
+武装入侵 12.1089181827
+六千只 13.2075304714
+期门 12.8020653633
+百世流芳 13.900677652
+灵川县 12.8020653633
+克纳济 13.2075304714
+姜饼 13.2075304714
+姚友仲 10.765183436
+搭架子 13.900677652
+孑然一身 11.1926274509
+炼铝 10.2117981979
+朝邑 13.2075304714
+站里 12.1089181827
+但献忠 12.5143832909
+描绘成 10.6818018271
+技术局 13.900677652
+强光照 13.2075304714
+崔毅 13.2075304714
+撰文 8.85082164473
+张若虚 12.8020653633
+贴近生活 11.0103058941
+不可否认 9.25628675283
+技术展 13.900677652
+奥里康 13.2075304714
+普拉塔 12.2912397395
+木房 13.900677652
+显示管 12.5143832909
+中体西用 13.900677652
+内质网 10.604840786
+后半程 13.2075304714
+束皙 12.8020653633
+汉字信息处理 12.8020653633
+托交 13.900677652
+惊艳 10.3743171274
+托人 8.83177344976
+脱离实际 10.2117981979
+魏延背 13.2075304714
+维恩 11.1926274509
+剽悍 10.3743171274
+促性腺素 13.900677652
+贾宪三角 12.2912397395
+嗤笑 12.1089181827
+尹庆群 12.5143832909
+徐安琪 13.900677652
+孔分墨 13.900677652
+十五级 13.900677652
+致命处 13.900677652
+滚滚向前 11.4157710022
+藤泽秀行 12.8020653633
+托付 9.82314020807
+形同虚设 9.85762638414
+阿达米 13.900677652
+林青霞 12.5143832909
+概叙 13.900677652
+太乙 10.3743171274
+颈项 10.0505300503
+豆叶 12.5143832909
+远洋渔船 13.2075304714
+版权页 13.2075304714
+门道 9.38981814546
+庞家堡 13.2075304714
+师丁启 11.9547675029
+李俊入 13.2075304714
+郑季 12.8020653633
+淮海战役 9.77354326693
+关相云 8.99540287354
+瑶民 12.5143832909
+促使 6.65359706739
+雄纠纠 11.5027823792
+施力点 13.900677652
+军事科学 9.82314020807
+三万户 11.8212361103
+爪哇语 11.9547675029
+惊跑 12.8020653633
+舞棍 12.5143832909
+体形 8.28390655431
+入境手续 12.8020653633
+武装斗争 8.9308643524
+劳工市场 11.4157710022
+收集箱 13.900677652
+莆田 10.2630914922
+摸不透 10.9562386728
+发型师 12.8020653633
+燃亮 13.900677652
+诺克 11.1280889297
+算术 8.61241062128
+惊跳 12.2912397395
+佯笑 11.0674643079
+四十开 13.2075304714
+闹独立性 13.900677652
+巴黎政治学院 13.2075304714
+北汝河 12.1089181827
+技术史 12.1089181827
+算机 11.5027823792
+坐禁闭 13.2075304714
+屋面 10.5684731418
+时逢 10.765183436
+图们市 11.8212361103
+表侄女 13.900677652
+能级宽度 12.8020653633
+谢富治 11.7034530746
+舒尔茨 11.0674643079
+晴明 11.4157710022
+轻世傲物 13.2075304714
+纳瓦依 13.2075304714
+奥伦堡 11.5027823792
+十例 13.2075304714
+长征二号 13.900677652
+硫化橡胶 12.1089181827
+下调 6.77700486677
+算来 9.74179456862
+彤云 12.5143832909
+所获 9.58318953844
+国务院参事 11.9547675029
+阔别多年 12.1089181827
+还套 12.1089181827
+洞箫 11.5027823792
+踩住 10.9562386728
+玛建寺 13.2075304714
+宗主权 10.2371160058
+抗焦虑 11.4157710022
+帅座 12.8020653633
+时速 8.03138073884
+老龄化 9.84023464143
+迄今 8.15767446417
+弘忍 12.8020653633
+极泉 13.2075304714
+肠炎 10.1630080337
+客运港 13.2075304714
+民族压迫 10.0294766411
+刘半农 11.4157710022
+森科 13.900677652
+水光山色 13.2075304714
+销售店 11.8212361103
+伦佐 13.900677652
+惊起 10.0294766411
+吴将爷 12.8020653633
+应酬话 12.2912397395
+掩护 7.8184587416
+三唑酮 13.2075304714
+五百多两 12.8020653633
+输氧管 12.8020653633
+五百多个 12.8020653633
+大法官 10.642581114
+后半生 10.0505300503
+局中人 12.8020653633
+白巾 13.900677652
+门齿 9.93038573842
+王仁俊 12.8020653633
+思虑周详 13.2075304714
+定军山 11.0103058941
+战止战 13.2075304714
+得来不易 12.5143832909
+张顺夜 13.2075304714
+澹台小姐 11.8212361103
+心如火燎 12.8020653633
+惩前毖后 11.7034530746
+驮负 12.5143832909
+技术化 13.2075304714
+臧否人物 11.9547675029
+泼下来 12.5143832909
+做呕 13.2075304714
+诗词集 12.8020653633
+电闪雷鸣 10.6818018271
+许德华 12.5143832909
+滕州市 12.8020653633
+氦气 10.8096351986
+非难 10.4666904475
+氦氖 13.2075304714
+趋吉避凶 11.0103058941
+京山线 13.900677652
+吉拉迪诺 13.2075304714
+业务流程 10.3171587135
+禹之鼎 13.2075304714
+负后象 12.8020653633
+信息沟通 10.765183436
+埃克脱 12.1089181827
+物质不灭 13.2075304714
+中国香港地区 11.0103058941
+陈化成 11.2616203224
+私立中学 11.7034530746
+结算价 9.03314320152
+顺天者昌 13.900677652
+贴现率 9.94943393339
+板房 11.1280889297
+佛得角 10.1871055853
+水如烟 13.900677652
+呃逆 11.2616203224
+唐至清 12.5143832909
+李嘉固 13.2075304714
+结核 8.90346537821
+枣儿 10.8561552143
+首轮 9.75754292558
+压强 8.92394390956
+令状 12.8020653633
+乌龟壳 11.7034530746
+阳关大道 12.1089181827
+稀土 8.39128931535
+汽锅 12.1089181827
+扰扰 12.1089181827
+格查尔 13.900677652
+胡主席 11.598092559
+怒发冲冠 11.5027823792
+算是 6.52918835676
+明确提出 8.25523075433
+郑家 10.9562386728
+一当 10.4994802703
+沧桑感 12.8020653633
+踩下 10.9049453784
+邓城 13.2075304714
+炼焦厂 13.2075304714
+孟特祖 13.2075304714
+婉商 13.900677652
+鬼箭羽 13.900677652
+犯过 10.3171587135
+惦记着 9.23723855786
+洞窟 8.55834340001
+晴朗 9.22784881751
+泔水 10.8096351986
+走错 10.2117981979
+柔情密意 13.900677652
+广涵 12.8020653633
+办毕 13.2075304714
+耗资近 11.3357282945
+下贱 9.85762638414
+循环体 13.900677652
+非国有经济 12.1089181827
+俟机 11.7034530746
+脚趾头 12.1089181827
+鲁宾孙 12.8020653633
+南宗禅 12.8020653633
+沈曾植 11.8212361103
+昌乐 11.5027823792
+进尺 12.5143832909
+狄昂 12.8020653633
+昌九 11.2616203224
+令狐 12.8020653633
+愉悦 9.53122979951
+突发事件 8.80081122415
+心活面软 13.900677652
+下跪 9.16447920358
+格卢斯曼 13.2075304714
+浮光掠影 12.2912397395
+推广站 13.2075304714
+泥盆纪 9.65218240993
+李管家 10.7226238216
+阅兵场 12.8020653633
+贡禹 12.5143832909
+桑塔露 13.900677652
+萧绎自立 13.2075304714
+令爱 11.8212361103
+周亦助 13.2075304714
+永鼎 11.5027823792
+符合规律 12.8020653633
+布林迪西 12.5143832909
+洞穴 7.80485308954
+楷字 13.2075304714
+下跌 5.29565675019
+北方省 12.8020653633
+枣农 12.5143832909
+自力更生 9.89334446674
+申请事项 11.9547675029
+乔瑁 12.8020653633
+北京京剧院 13.2075304714
+谭仲麟 11.8212361103
+太上 9.93038573842
+秦铁 13.2075304714
+丰容靓饰 13.900677652
+翘首企望 13.2075304714
+区直 13.900677652
+宣过誓 13.2075304714
+杭家和 12.2912397395
+情迷 11.8212361103
+案板 9.69598503258
+于壁衣 12.5143832909
+令牌 11.0674643079
+妇儿 12.5143832909
+暖冬 11.598092559
+少不得 8.87679713113
+妥妥当当 12.2912397395
+本行政区域 11.8212361103
+外耳门 13.900677652
+罗钳吉网 13.900677652
+缺苗 12.8020653633
+王若虚 11.4157710022
+台湾玉 13.900677652
+钟磬鼓 13.900677652
+伤感情 13.900677652
+凄婉 10.533381822
+维修点 12.5143832909
+乔石 11.4157710022
+下蹲 10.9049453784
+李铁拐 13.900677652
+扛着 9.04864738806
+丹尼尔斯 13.900677652
+蒌蒿 13.2075304714
+任劳任怨 10.8096351986
+安平桥 12.2912397395
+诺华 11.0674643079
+楼梯口 9.43476953332
+二连浩特 11.7034530746
+科洛 11.1926274509
+临战状态 11.8212361103
+簿籍 11.3357282945
+商法典 11.8212361103
+贡税 12.2912397395
+此岸 11.5027823792
+醒眼 13.900677652
+亲历者 13.900677652
+走险 13.900677652
+妻儿老小 11.1280889297
+有秩序地 11.598092559
+增殖性 11.3357282945
+科海 12.8020653633
+八十多种 13.2075304714
+天南海北 10.642581114
+露易丝 12.5143832909
+普罗斯特 13.2075304714
+甲沟炎 13.2075304714
+资溪 12.8020653633
+拱立 11.9547675029
+表达形式 11.1280889297
+体征 8.92394390956
+接合部 10.8561552143
+埃特纳 11.598092559
+小鹿 9.77354326693
+第一部 7.19748953873
+维奇 10.3453295905
+贻羞 13.900677652
+齿科 12.1089181827
+吸上 11.3357282945
+冬葵 13.2075304714
+算数 9.82314020807
+四十度 12.2912397395
+闹肚子 12.1089181827
+硫脂 13.900677652
+褥疮 11.5027823792
+于平城 11.598092559
+环境中工作 11.5027823792
+朱利奥 13.2075304714
+皮由兹 13.2075304714
+借个火 12.8020653633
+禁核试条约 13.900677652
+殷虚书 13.2075304714
+弘州 12.8020653633
+第一通 12.1089181827
+萨德夫人 13.900677652
+气贯长虹 12.2912397395
+郭太后 12.8020653633
+祛风 9.87532596124
+倍频器 12.8020653633
+并流 13.2075304714
+德里亚 12.5143832909
+田间试验 12.8020653633
+寓兵于农 12.1089181827
+夏馨 13.900677652
+红教 12.8020653633
+太常卿 11.1926274509
+公共品 11.7034530746
+喇嘛教 9.37888907493
+硫脲 12.5143832909
+撑不住 10.1394775363
+驮轿 12.8020653633
+起床号 13.2075304714
+二边 13.900677652
+经济法 10.533381822
+鹰视狼顾 12.8020653633
+小鹏 13.2075304714
+第一遍 12.1089181827
+三五步 11.9547675029
+七千余 12.2912397395
+伦勃朗 10.6818018271
+下身 8.94485059437
+屋门 9.5186510173
+金身罗汉 12.2912397395
+耐波性 12.2912397395
+第一道 9.37888907493
+小鹊 13.900677652
+可抑制 10.4349417492
+第一遭 11.4157710022
+子田常 13.2075304714
+至多是 11.5027823792
+羊羔美酒 13.2075304714
+查户口 11.2616203224
+毕宗远 13.2075304714
+盼望 8.39534611604
+六合之内 13.2075304714
+十五名 11.7034530746
+重复式 13.900677652
+回乡证 13.900677652
+马端临 10.9049453784
+胡格利 12.5143832909
+沃土 10.3743171274
+污染物 8.80081122415
+弃掷 13.900677652
+太俗 12.5143832909
+卢希特 13.900677652
+下车 8.10766404359
+套衫 12.2912397395
+光要 12.5143832909
+趋之若骛 12.5143832909
+天义叔 10.3453295905
+漫水 12.1089181827
+多尔帕 12.1089181827
+歼灭 7.97375162601
+十九处 12.8020653633
+下载 7.14840727583
+惩罚 7.8093677699
+试题库 13.900677652
+平角 12.8020653633
+一个四岁 12.8020653633
+城关区 11.7034530746
+缺考 10.6818018271
+品格高尚 13.2075304714
+谭小培 13.2075304714
+科学安排 11.4157710022
+数千公里 12.8020653633
+纽瓦克 12.1089181827
+兴旺繁荣 13.900677652
+不以为意 10.6818018271
+离心法 13.2075304714
+第一重 11.0674643079
+亮光光 12.8020653633
+大航海家 13.2075304714
+秦巽衡 11.3357282945
+保持清洁 11.4157710022
+武城尹 13.2075304714
+由摩尔 12.8020653633
+储雷架 12.8020653633
+刻画入微 12.2912397395
+母丁香 12.8020653633
+离心泵 12.1089181827
+画面感 13.2075304714
+闻家堰 12.8020653633
+水川道 12.2912397395
+第一百六十三条 12.1089181827
+百担 13.2075304714
+降压药 10.8561552143
+埃克芳 13.900677652
+周云鹏 12.8020653633
+武汉东湖新技术开发区 13.2075304714
+蔡懋 12.1089181827
+整出戏 13.900677652
+洪恩 11.5027823792
+流转税 12.2912397395
+金朝守 13.2075304714
+两万左右 13.2075304714
+朝鲜 6.58745726489
+春哈旺 12.8020653633
+洪泽镇 13.2075304714
+金朝官 12.2912397395
+下述 8.81927328699
+入夜后 11.7034530746
+关键部件 10.2117981979
+信贷业务 10.3453295905
+七千万 13.900677652
+浅尝辄止 12.2912397395
+大鱼吃 13.900677652
+下过 9.5186510173
+孙总兵 13.900677652
+占卜师 13.2075304714
+局部战争 9.84023464143
+删节本 13.2075304714
+护身符 10.0940151622
+科沃 11.7034530746
+工商税 12.5143832909
+板手 13.900677652
+治民官 13.900677652
+舞步 10.3743171274
+急变 12.5143832909
+太软弱 11.1926274509
+中国青年出版社 12.1089181827
+国家所有 9.89334446674
+白费口舌 13.900677652
+冬藏 11.1926274509
+谭歪嘴 13.900677652
+名义工资 11.7034530746
+科波 11.598092559
+鼠目寸光 11.9547675029
+土栽 13.900677652
+总编室 12.8020653633
+蛤蜊 11.2616203224
+下边 7.20364340431
+苗泽 13.2075304714
+下达 7.96843246453
+契据 11.7034530746
+姊儿 12.8020653633
+武宁县 12.2912397395
+若葭萌 13.2075304714
+主客体 11.9547675029
+迷彩服 11.0103058941
+下辈 12.1089181827
+成丁礼 12.8020653633
+借回来 12.8020653633
+概念 5.78038633801
+下辖 8.56313957227
+史称皇 12.2912397395
+魏道明 13.2075304714
+一百四十卷 12.5143832909
+屯兵 8.55834340001
+夜光杯 11.3357282945
+走道 11.7034530746
+重如泰山 12.8020653633
+取送 13.900677652
+北京东方 12.5143832909
+微观粒子 9.74179456862
+下表 9.66657114738
+韩本铉 13.2075304714
+安塔基 13.2075304714
+于仁宗 12.2912397395
+击败 7.39938798144
+大溪镇 13.900677652
+马加特 13.900677652
+小规模 8.59240995457
+克努特 12.2912397395
+涨跌互现 9.29550746599
+走遍 9.77354326693
+宋沿边 12.8020653633
+未得缓和 13.900677652
+南戴河 12.5143832909
+匝地 11.1926274509
+纷纷扬扬 10.5684731418
+公费留学 12.2912397395
+斯蒂芬森 11.1926274509
+廖化引 12.8020653633
+走避 11.8212361103
+下行 6.98893035172
+威廉 8.37921673411
+搜摸 12.8020653633
+近景 11.1926274509
+广艺舟 12.8020653633
+社会党 8.5440913773
+大巨 13.2075304714
+喝个 10.8561552143
+广宗县 13.900677652
+外耳道 11.0103058941
+技术型 11.1926274509
+走通 11.5027823792
+第一集 11.4157710022
+一把汗 10.7226238216
+贡米 12.1089181827
+安平港 12.1089181827
+太白星 11.8212361103
+三十三篇 12.1089181827
+中央芭蕾舞团 13.2075304714
+月夕 13.900677652
+老奸巨滑 12.2912397395
+农六师 12.8020653633
+路队 12.1089181827
+行号 10.5684731418
+交联剂 12.1089181827
+正弦规 13.900677652
+十九年 8.37921673411
+流连忘返 11.4157710022
+屈身 11.0103058941
+异丙嗪 12.5143832909
+首方 13.2075304714
+徐若瑄 11.3357282945
+有良言 13.900677652
+山云 13.2075304714
+益封凡 13.2075304714
+大川 10.8096351986
+拖上来 12.2912397395
+空文 11.9547675029
+冬节 13.900677652
+何宫 12.1089181827
+丑态百出 12.1089181827
+星女郎 13.900677652
+一千四五百文 13.2075304714
+贻祸 12.5143832909
+好下场 10.0720362555
+第一队 11.1280889297
+腹面 8.6966709649
+非命 11.8212361103
+邓艾见 13.2075304714
+时尚生活 11.8212361103
+篮球馆 12.8020653633
+占据主动 11.1926274509
+齿缝 12.5143832909
+有进有出 12.8020653633
+下装 11.598092559
+圣托马斯岛 13.2075304714
+八强赛 13.900677652
+弃旧 11.8212361103
+萎靡不振 10.2630914922
+漫卷 11.8212361103
+健身器材 13.2075304714
+菱花镜 12.8020653633
+奥斯特 9.85762638414
+没设 13.900677652
+屡见 11.1280889297
+百艘 13.2075304714
+溪边 9.66657114738
+技术圈 13.2075304714
+暖和 8.52539924429
+二连 10.2117981979
+常绿阔 13.2075304714
+文化站 11.5027823792
+装修 8.23425096386
+不知情 9.36807815882
+无罪判决 13.900677652
+地锚 13.900677652
+涌上心来 13.900677652
+双层结构 11.8212361103
+科比 10.6818018271
+时针 10.4349417492
+弘宣 13.2075304714
+偏心轮 13.900677652
+取景器 12.5143832909
+麻栎 10.4041700905
+迁至 8.32094782599
+纳丁银 13.2075304714
+问难 12.2912397395
+大视野 13.2075304714
+金川河 12.2912397395
+漫射 12.1089181827
+马来熊 13.900677652
+时钟 9.37888907493
+亿股 6.5000570746
+观光车 11.5027823792
+刘艺舟 12.8020653633
+几十遍 12.2912397395
+席草 11.1926274509
+莱曼 11.9547675029
+敲骨吸髓 11.9547675029
+洞经 12.8020653633
+汪士贤 12.8020653633
+科技开发 11.598092559
+时长 10.8561552143
+相机行事 10.9049453784
+裂解炉 12.8020653633
+屯垦 9.65218240993
+邓发 11.8212361103
+大法师 12.2912397395
+差不离 11.3357282945
+激动井 13.900677652
+刘人顺 13.2075304714
+契文 13.900677652
+编排节目 13.900677652
+人力物力 9.62401153296
+邓艾表 13.2075304714
+赫勒福 13.2075304714
+侠客 10.9049453784
+鲁之公 13.2075304714
+第六十九回 12.2912397395
+邓县 10.5684731418
+靠你了 11.4157710022
+卫百司 12.8020653633
+汉文帝 9.71102290995
+居官之 13.900677652
+活法儿 13.2075304714
+韦亚努 13.900677652
+死不要脸 13.2075304714
+豪门 9.35738286971
+阅兵台 12.1089181827
+防弹玻璃 11.8212361103
+鞭责 13.2075304714
+象棋队 13.900677652
+行卫尉 12.5143832909
+屈辱 8.71889410168
+喷射式 10.6818018271
+三十三章 12.2912397395
+原地不动 11.7034530746
+瘤子 11.9547675029
+期待值 13.2075304714
+医药学 10.9049453784
+梁三州 13.2075304714
+植树日 13.900677652
+司马猎律 13.2075304714
+胶原蛋白 11.1280889297
+忻城 12.1089181827
+时间 4.07953963246
+钱儿 11.5027823792
+二道区 13.2075304714
+辨别力 12.1089181827
+方位角 10.3453295905
+松峦峰 12.8020653633
+祥林嫂 11.0103058941
+奕世 12.5143832909
+邓南 12.2912397395
+库车 9.38981814546
+芮城西 11.9547675029
+下角 13.900677652
+邓华 12.1089181827
+碱性土 12.5143832909
+冬菇 11.4157710022
+谢建东 13.900677652
+车轮子 11.5027823792
+夜半三更 12.8020653633
+印制板 13.900677652
+大牧场 12.5143832909
+灌木状 11.1926274509
+套裤 12.8020653633
+接合面 12.8020653633
+张敞画眉 13.2075304714
+病毒软件 13.900677652
+从良 11.0103058941
+达坂 10.642581114
+止于至善 12.8020653633
+机关效能 11.9547675029
+想都别想 13.2075304714
+第一面 11.2616203224
+婚检率 13.900677652
+尼思哈 13.2075304714
+拖动 11.1926274509
+与赛 13.2075304714
+家无宁日 13.2075304714
+放胆 11.5027823792
+蠢才 12.2912397395
+没说 8.93783302172
+人工流产 10.5684731418
+升官发财 11.0103058941
+未见异常 12.8020653633
+弃权 11.4157710022
+侠士 11.5027823792
+诗词选 12.2912397395
+精炼厂 13.2075304714
+有条纹 12.1089181827
+苦水 9.80633308975
+关东糖 13.900677652
+社会群体 10.1871055853
+韦里尼 13.2075304714
+天体营 13.900677652
+于平南 13.900677652
+一两回 11.7034530746
+自卫队 9.46986085313
+洗头房 12.2912397395
+掠夺性 10.4666904475
+门首 9.31571017331
+强笑道 11.1280889297
+敲门砖 12.1089181827
+几代人 10.4349417492
+铁之议 10.765183436
+为时未晚 11.8212361103
+漫出 12.1089181827
+惊诧 8.89673134603
+门馆 11.9547675029
+徐顺全 13.900677652
+扰攘 11.0103058941
+洪兴祖 12.8020653633
+显示牌 13.900677652
+美解眠 13.900677652
+不臣之心 11.7034530746
+豪雨 11.9547675029
+秦朗引 13.2075304714
+姜龙 11.2616203224
+三十三种 13.2075304714
+班役 12.1089181827
+异丙基 12.2912397395
+乔玛 12.1089181827
+自筹资金 10.4349417492
+惊讶 7.34247984916
+惊恐失色 13.2075304714
+弘大 13.2075304714
+作恶多端 10.7226238216
+社会化 8.85082164473
+缩水率 11.9547675029
+豪雄 12.2912397395
+李希烈 11.5027823792
+香云纱 12.2912397395
+六百多个 13.900677652
+普拉克 12.1089181827
+峰点 13.900677652
+何孟春 13.2075304714
+时雨 13.2075304714
+令甥 11.9547675029
+脆弱性 10.5684731418
+社会史 10.2897597393
+贡纳 11.3357282945
+并不多 8.74162235276
+能源工业 10.2630914922
+十九岁 10.0088573539
+丽江县 12.8020653633
+小凉山 11.7034530746
+游进去 13.2075304714
+冬肥 12.5143832909
+撑过去 13.900677652
+释加牟 13.900677652
+豪阔 12.8020653633
+并不大 8.12612610643
+欢叫声 12.8020653633
+倒毁 13.900677652
+通德乡 12.2912397395
+冲积成 11.9547675029
+棒棒糖 11.8212361103
+普拉兰 13.900677652
+索宁克 11.8212361103
+天职 10.9049453784
+三重态 12.8020653633
+系统工程 9.17328983326
+热胀冷缩 11.1280889297
+陈章良 13.2075304714
+枣园 11.8212361103
+明长陵 12.8020653633
+特色小吃 12.1089181827
+利用外资 9.62401153296
+玉钏姐姐 13.900677652
+永顺 11.1926274509
+求签问卜 13.2075304714
+呓语 11.2616203224
+办校 11.598092559
+张顺引 13.900677652
+毛一鹭 12.8020653633
+苏定方 11.8212361103
+徐宏亮 13.900677652
+李铁映 12.8020653633
+就职 9.22784881751
+任开封 12.8020653633
+定性描述 11.8212361103
+十九峰 12.1089181827
+宋士杰 13.2075304714
+一往 10.6818018271
+冲积扇 9.06439574502
+太伯 11.2616203224
+时隔 8.76487921493
+厌食症 12.1089181827
+时隙 12.1089181827
+九泉之下 10.2371160058
+通金代 13.2075304714
+赖顿 12.1089181827
+熟地黄 12.2912397395
+全封闭 10.1871055853
+连操 13.900677652
+射起 13.900677652
+书名号 12.2912397395
+缪达尔 12.8020653633
+销售处 13.2075304714
+老维克 12.8020653633
+望彝陵 13.2075304714
+忸忸怩怩 12.8020653633
+劳恩河 13.2075304714
+楼亭 12.5143832909
+链传动 12.5143832909
+狗男女 11.2616203224
+门额 11.8212361103
+圣安德列斯 13.900677652
+王克敏 11.9547675029
+贡缎 12.1089181827
+须弥福 12.2912397395
+于濡源 13.2075304714
+汪洋恣肆 11.8212361103
+净空 9.98865464655
+高性价 13.900677652
+俄克拉荷马 13.2075304714
+躺下来 10.2371160058
+溪谷 10.0720362555
+张金莲 13.900677652
+著有 6.55080394724
+连续传代 13.2075304714
+巴士海峡 10.642581114
+泉水幽咽 13.900677652
+软化病 13.900677652
+卜一卦 11.7034530746
+细鳞鱼 11.7034530746
+何乔远 12.8020653633
+邓军 7.82074445688
+卜一卜 13.2075304714
+克虏伯 9.53122979951
+第一门 11.8212361103
+男佣 13.900677652
+武昌起义 9.26594866375
+颈部 8.55357012126
+利眠宁 12.8020653633
+门风 10.6818018271
+利上滚利 13.2075304714
+浒墅关 12.2912397395
+犹豫不定 10.8561552143
+第一间 11.7034530746
+碍脚 13.900677652
+屈赛 13.2075304714
+金属粉末 11.5027823792
+契机 8.08059472162
+小陇山 12.5143832909
+纪尧姆 12.8020653633
+侠女 12.2912397395
+技术员 10.0720362555
+穆沙拉夫 13.2075304714
+符拉迪 13.900677652
+海林檎 12.8020653633
+管弦乐 9.69598503258
+下课 9.75754292558
+英政府 10.9562386728
+之遥 9.49395840471
+问问 7.79811905736
+并案 12.8020653633
+阴宫里 12.8020653633
+屈起 12.2912397395
+天宫 9.02548032877
+节约使用 11.2616203224
+华克尔 12.8020653633
+走一遭 9.23723855786
+小嘎子 10.2371160058
+加拿大约克大学 13.900677652
+人龙 11.8212361103
+专业展 13.900677652
+田永圻 11.598092559
+外部设备 11.2616203224
+披盖着 13.900677652
+电脑配件 13.900677652
+趋之若鹜 10.1394775363
+范子长 13.2075304714
+风信 11.4157710022
+茶匙 11.2616203224
+郭太尉 11.8212361103
+金庆玉 13.2075304714
+加尔各答 9.65218240993
+相一致 8.76487921493
+下设 8.17382990439
+化钠 13.900677652
+维格 13.2075304714
+德寿宫 12.5143832909
+维根 13.2075304714
+斯冰川 12.5143832909
+青霜剑 12.8020653633
+屠苏 13.900677652
+莽丛 13.900677652
+吐绶鸡 11.8212361103
+射上来 13.2075304714
+冬至 9.22784881751
+洞烛 13.2075304714
+其生 10.8561552143
+几两米 13.900677652
+庆功会 11.9547675029
+贤良 9.21854642485
+照此办理 11.4157710022
+王基引 13.2075304714
+闸口 10.642581114
+朝鲜政府 10.9049453784
+创始 9.5062284973
+终言 12.8020653633
+领略到 10.7226238216
+交流信息 11.9547675029
+吹哨子 11.7034530746
+金属丝网 13.2075304714
+贴得 11.4157710022
+苏丹人 11.8212361103
+粘粘糊糊 13.900677652
+麦考莱 12.5143832909
+开始符号 13.2075304714
+盖世无双 13.2075304714
+吊架 12.1089181827
+趟马 13.900677652
+游下去 13.2075304714
+贾母王 13.900677652
+李锡 13.900677652
+鸿运 11.3357282945
+波动力学 11.3357282945
+大节 10.5684731418
+公说公有理 12.2912397395
+补苗 12.8020653633
+千山万水 10.9049453784
+增湿作用 13.2075304714
+鸿达 13.900677652
+碍手碍脚 10.765183436
+大英 11.0103058941
+动物油 11.8212361103
+周荫 12.5143832909
+鲁王霸 12.8020653633
+打前锋 13.900677652
+草原气候 9.65218240993
+身分证 11.3357282945
+周荣 12.8020653633
+已修 12.5143832909
+关系 4.73554387284
+新周刊 13.900677652
+晚节不保 11.7034530746
+和帆帆 12.8020653633
+围上来 10.2117981979
+赫伯森 13.2075304714
+抢吃 12.8020653633
+斯维尔德 11.0103058941
+树突 11.2616203224
+偷换概念 11.9547675029
+马兰峪 9.75754292558
+电讯报 11.1926274509
+拖起 11.5027823792
+冤家对头 11.5027823792
+广谱性 13.2075304714
+尚其亨 12.8020653633
+揭不开锅 11.3357282945
+折射波 13.900677652
+布利斯 11.7034530746
+大船 8.62767809341
+卫生学校 11.7034530746
+受窘 12.5143832909
+氟化银 13.900677652
+成品率 12.2912397395
+欢呼 8.42421410004
+体育系 12.1089181827
+大航 11.598092559
+补色 11.598092559
+发脾气 9.10488710638
+氟化铀 12.8020653633
+罗卡富 13.900677652
+左光斗 10.9562386728
+大舟 13.2075304714
+双边会谈 10.8096351986
+贾政因 11.5027823792
+钡餐 11.4157710022
+大舅 9.59661255877
+周莉 11.598092559
+英首相 13.900677652
+人机界面 12.5143832909
+情况 4.00724043529
+扶疏 11.7034530746
+注射 8.0229418702
+最叫 12.8020653633
+氟化钠 13.2075304714
+感应力 13.900677652
+来用 10.3171587135
+亡妹 13.900677652
+王铭章 12.2912397395
+童话世界 11.3357282945
+底子薄 11.9547675029
+程墨 13.2075304714
+大艺 13.900677652
+怡香院 13.2075304714
+千百口 11.8212361103
+主观武断 13.2075304714
+做手术 10.0088573539
+来电 9.46986085313
+吊杆 11.1926274509
+欧吕第 13.900677652
+氟化钾 12.8020653633
+社科院 9.16447920358
+银汞合金 12.5143832909
+寻入朝 13.2075304714
+红肖梨 13.900677652
+高端用户 12.2912397395
+中国天主教主教团 12.8020653633
+阿维森纳 12.8020653633
+子太太 13.900677652
+洛浦之 13.2075304714
+钓名沽誉 13.900677652
+来生 10.604840786
+临江仙 11.7034530746
+租借地 10.5684731418
+节外生枝 10.2630914922
+氟化钙 12.2912397395
+闸北 10.7226238216
+树篱 13.2075304714
+一百一十二文 13.2075304714
+金沸草 13.900677652
+力求上进 12.8020653633
+太空服 13.900677652
+重用 8.20694551317
+过共析钢 13.900677652
+联合大厦 12.5143832909
+包一机 13.2075304714
+营收额 13.2075304714
+重申 7.84155445639
+茶卤 13.900677652
+毋容 12.8020653633
+凤盘兄 13.2075304714
+莱昂纳多 12.8020653633
+恶补 12.8020653633
+联盟 6.8858633007
+毋宁 10.1871055853
+氟化镁 13.2075304714
+二册 11.7034530746
+美滋滋 11.0674643079
+肉乎乎 11.4157710022
+三千六百分 12.8020653633
+兴隆洼 12.8020653633
+合川县 11.4157710022
+三千六百刀 12.5143832909
+情债 13.900677652
+楚纪南 13.900677652
+大秧歌 11.8212361103
+重生 10.1871055853
+芬太尼 13.900677652
+三千余家 12.8020653633
+旷课 13.2075304714
+土壤通气 12.5143832909
+四节课 13.900677652
+魏延引 11.1280889297
+诸恶莫作 13.900677652
+九样 13.2075304714
+爵士乐 10.8096351986
+外频 12.2912397395
+阶梯状 9.75754292558
+科瑟尔 12.5143832909
+左五营 13.2075304714
+周良 11.1280889297
+外颖 13.2075304714
+软盘 10.9562386728
+二出 13.900677652
+酣然 11.1926274509
+菩萨像 11.0674643079
+氟化锂 13.2075304714
+宗弼 12.2912397395
+牛纹铜 13.2075304714
+大菜 10.9049453784
+意乱神迷 12.8020653633
+阿司匹林 10.1394775363
+马上望 13.2075304714
+查错 13.900677652
+太烂 13.2075304714
+美国政府 7.44705265308
+欢喜 7.82303540863
+库内 10.6818018271
+漂零 13.2075304714
+补药 10.6818018271
+查问 9.84023464143
+扭伤 10.604840786
+养医 11.8212361103
+落巢 13.900677652
+狗肝草 13.900677652
+劲射 12.5143832909
+四十多根 13.2075304714
+封汉安 12.8020653633
+声望去 11.8212361103
+消息儿 11.9547675029
+化学战剂 12.1089181827
+指甲剪 13.900677652
+治安处罚 13.900677652
+好管闲事 12.8020653633
+轻飘飘 10.0940151622
+穿洞 11.9547675029
+调查室 12.8020653633
+软瘫 11.0674643079
+内科病房 12.5143832909
+宗教改革 9.41204128224
+软瘤 13.900677652
+庄客报 12.2912397395
+库克 9.84023464143
+补报 10.8561552143
+位或 10.3171587135
+戒刀 9.7898037878
+相国之 12.8020653633
+布尔什维主义 11.3357282945
+五百载 12.5143832909
+关索 10.9562386728
+关紧 10.4349417492
+组合式 10.533381822
+阿弥光 12.8020653633
+中国共产主义青年团 9.77354326693
+二六 11.5027823792
+玻璃墙 12.1089181827
+二八 8.47572763449
+历尽艰难 13.900677652
+电力集团 11.8212361103
+纷至沓来 10.1630080337
+静电积累 13.900677652
+欢唱 11.5027823792
+盛洪 13.900677652
+因材施教 11.5027823792
+撬棒 13.2075304714
+重病 9.20932976975
+重症 8.33999602096
+大荔 10.6818018271
+户调 11.0674643079
+大荒 10.2630914922
+劫数难逃 12.8020653633
+质保金 13.2075304714
+数出 10.9562386728
+有章可循 11.5027823792
+一个情节 12.8020653633
+弓锯 13.900677652
+英语考试 13.2075304714
+和世卫 13.2075304714
+沙米尔 12.8020653633
+口快 13.2075304714
+楚馆秦楼 13.900677652
+劲得 13.900677652
+牙科医生 12.2912397395
+汽车配件 10.8096351986
+史之功 13.2075304714
+一门同气 13.900677652
+思想道德 11.0674643079
+裂痕 9.93038573842
+库内奥 13.2075304714
+再见面 10.642581114
+大股 10.2117981979
+大肠 9.48183704418
+侮辱罪 12.8020653633
+油头粉面 11.4157710022
+邮政所 11.3357282945
+披散 10.1164880181
+渔业法 13.2075304714
+分次 10.5684731418
+库勒 10.4994802703
+大肚 11.2616203224
+听雨轩 13.900677652
+广谱抗 12.1089181827
+大肆 8.092535162
+於巳午 12.8020653633
+白劳德 12.2912397395
+圆弧形 11.2616203224
+卢龙 10.4994802703
+大肉 10.3743171274
+贾政同 13.2075304714
+十月革命 8.47133202302
+倒持干戈 13.900677652
+喀拉 9.29550746599
+隐匿 9.04086524761
+房山寨 12.1089181827
+姚伯道 13.2075304714
+巴拉圭 9.58318953844
+补肾 9.18217878068
+广播剧 11.0674643079
+长乐村 13.900677652
+黄兴国 13.900677652
+石渠县 13.900677652
+用尽心机 13.2075304714
+重百 13.900677652
+找不出 9.6811699468
+重登 11.4157710022
+历史风云 12.8020653633
+刘曼卿 13.2075304714
+临江会 13.900677652
+蔓生 11.1280889297
+进抵 9.91169360541
+拖车 9.69598503258
+已久 8.28027678626
+查阅 8.44109213783
+十八九岁 10.604840786
+大胜 9.30555780184
+拖轮 11.2616203224
+八字脚 12.2912397395
+大胆 7.12531156104
+健体 12.1089181827
+翟让 11.1926274509
+发挥余热 12.8020653633
+瘦肉 9.63799777493
+数百公里 11.3357282945
+担纲 10.0720362555
+雪莲花 11.7034530746
+茹科夫 10.2371160058
+安邦河 12.5143832909
+狂歌 11.8212361103
+亚眠 11.4157710022
+驳壳枪 10.1164880181
+赤霉素 11.0103058941
+老不死 10.7226238216
+贤能 10.3171587135
+核力量 9.94943393339
+区域经理 12.5143832909
+克尔凯戈 13.2075304714
+按铃 13.2075304714
+粗沙 12.8020653633
+二分 9.72629038208
+王安定 12.8020653633
+孙建平 12.5143832909
+非非 11.9547675029
+体育组 13.900677652
+票额 12.2912397395
+画苑 13.900677652
+实言相告 12.1089181827
+羽坛 11.9547675029
+二列 12.1089181827
+明灿灿 12.8020653633
+多种经营 9.71102290995
+大考 11.2616203224
+贬官 10.533381822
+大老 11.8212361103
+三二百 13.2075304714
+李长荣 13.2075304714
+门脸儿 11.3357282945
+二则 7.77818484246
+享有盛名 9.84023464143
+胚胎 8.39941944143
+戒具 12.8020653633
+班达拉奈克 12.1089181827
+拖过 11.1926274509
+周至 10.604840786
+文峪河 12.1089181827
+周致 13.2075304714
+拖运 12.5143832909
+库利 11.598092559
+张柱 13.2075304714
+情变 12.5143832909
+联用 11.2616203224
+妖魔化 11.4157710022
+周臣 11.7034530746
+拖进 9.89334446674
+流行曲 13.900677652
+是非颠倒 13.2075304714
+进而 6.89307703802
+植物种 10.8561552143
+踔厉风发 13.2075304714
+来看 4.8352474518
+走弯路 12.1089181827
+不请自来 11.0103058941
+悲酸 11.8212361103
+补考 11.9547675029
+余香 11.7034530746
+伊松佐 13.2075304714
+卢齐 12.8020653633
+鱼龙曼衍 13.2075304714
+三厘米 13.2075304714
+库切 13.900677652
+情史 11.8212361103
+北京工人体育馆 12.5143832909
+小食店 12.5143832909
+查革 13.2075304714
+六亲不认 10.642581114
+水文测验 11.7034530746
+奥克里 12.8020653633
+情分 9.77354326693
+座机 10.9562386728
+意志薄弱者 13.900677652
+大甲镇 13.2075304714
+治脱发 13.900677652
+凯茜 11.9547675029
+兖州市 11.1280889297
+报菜名 13.2075304714
+敞胸露怀 13.900677652
+女护士 10.642581114
+黄惠贤 11.3357282945
+关羽 9.45802639549
+伊美尔 13.900677652
+三千多两 13.900677652
+邻居家 10.533381822
+勒克瑙 11.598092559
+新乡县 11.5027823792
+视之为 10.765183436
+程子 13.2075304714
+守夜人 11.8212361103
+图海道 13.900677652
+柔韧度 12.5143832909
+周老 12.5143832909
+树种 7.68407155089
+余万平方米 11.7034530746
+天行健 12.5143832909
+二口 12.1089181827
+二叠 10.4349417492
+十余万顷 13.2075304714
+发自体内 13.900677652
+克尽厥职 13.900677652
+二只 12.8020653633
+心外科 12.8020653633
+二叶 11.1280889297
+二号 9.21854642485
+雨露之恩 12.8020653633
+大臣 6.02328046562
+抬高身价 12.5143832909
+二台 11.7034530746
+篾匠 13.900677652
+歇晌 11.9547675029
+进膳 11.1926274509
+玄德恐 12.1089181827
+绕弯子 10.8561552143
+贾治邦 12.1089181827
+平湖县 12.1089181827
+补助费 11.0674643079
+破财消灾 13.2075304714
+披搭 13.2075304714
+二叉 11.598092559
+二叔 9.11318590919
+大丰县 12.2912397395
+电法勘探 12.2912397395
+衔哀 13.900677652
+季托夫 13.900677652
+质量技术监督局 10.765183436
+注心 13.900677652
+发回重审 12.2912397395
+帕潘德里欧 12.2912397395
+集居 11.7034530746
+座架 13.900677652
+高德曼 13.900677652
+输入速度 13.2075304714
+夺得 7.91171623509
+凯莉 11.7034530746
+养儿 12.5143832909
+贤臣 10.604840786
+大脸 11.1926274509
+花生壳 13.2075304714
+畅通 8.28390655431
+拉格斯 13.2075304714
+库卡 13.900677652
+二区 11.598092559
+贪睡 11.7034530746
+二匹 11.5027823792
+燃料库 12.8020653633
+纳吉布 11.9547675029
+听天由命 9.82314020807
+大脑 7.92179188707
+产蛋鸡 13.900677652
+待发 9.93038573842
+磁盘镜像 13.900677652
+大脚 10.0294766411
+树神 12.8020653633
+情势 8.61747392324
+二十九条 12.8020653633
+一八九 13.900677652
+李冰冰 9.01787572939
+凯莱 11.3357282945
+曹门坊 12.5143832909
+库区 9.84023464143
+广播台 12.5143832909
+坚持到底 11.3357282945
+大腿 8.26232298264
+码洋 12.8020653633
+分歧 7.19015454252
+心理主义 12.8020653633
+塞牙缝 11.7034530746
+二卷 10.2897597393
+大悟县 13.900677652
+安固 11.4157710022
+遗漏掉 13.900677652
+程家 13.900677652
+重石 13.2075304714
+多周 13.2075304714
+萨瓦蒂 13.900677652
+愁思 11.2616203224
+妖人 11.0674643079
+欢场 13.900677652
+玄德谢 12.5143832909
+大腕 9.80633308975
+此法 8.67493097826
+凿进 13.2075304714
+二千 9.24671730182
+二十 7.84155445639
+一万个 10.4666904475
+不即不离 12.2912397395
+张孔山 13.900677652
+凯悦 12.5143832909
+补脑 11.598092559
+勤俭朴实 13.900677652
+拍岸 11.9547675029
+老好人 11.4157710022
+巴拉兹 12.8020653633
+软玉 11.1280889297
+流行性 9.53122979951
+措勤 12.1089181827
+制表符 12.1089181827
+叹气声 12.5143832909
+气门数 11.1926274509
+联合国人口基金 12.8020653633
+穿梭 9.18217878068
+史天雄 8.65893063692
+引道 11.5027823792
+关碍 12.8020653633
+刘松 11.4157710022
+毛文龙 12.5143832909
+毋庸 11.3357282945
+连鬓胡子 12.1089181827
+查遍 12.1089181827
+广南东 11.4157710022
+脚本语言 12.1089181827
+五两重 13.900677652
+可采储量 10.4994802703
+纳吉巴 12.8020653633
+一二日 9.69598503258
+盘金彩 13.2075304714
+编修 8.98069672615
+当事人 7.32979468964
+感应器 11.2616203224
+钢材 6.93276845017
+巴拉克 11.4157710022
+附着力 10.9562386728
+竟因 13.900677652
+向宝玉 10.4349417492
+披挂 8.59737274392
+耳朵眼儿 13.2075304714
+二哥 8.29487558568
+美极了 11.9547675029
+逊谢 11.1926274509
+元嘉之 11.9547675029
+情商 12.2912397395
+传奇式 11.8212361103
+树线 11.9547675029
+广播中心 12.8020653633
+外祸 13.900677652
+羽冠 10.9562386728
+牵扯不清 13.900677652
+柳同春 11.1280889297
+重灾 12.5143832909
+防护系统 11.0103058941
+苏伊士 10.2371160058
+狂涛 11.4157710022
+操引兵 11.7034530746
+武英门 9.84023464143
+操舟运 12.8020653633
+二品 9.01787572939
+席次 12.8020653633
+广播员 11.9547675029
+狂涨 10.642581114
+阿埃塔 12.2912397395
+麻城 10.4349417492
+叶和根 12.5143832909
+普遍性 9.27570483869
+于禄兀 13.2075304714
+马兰士 13.2075304714
+节育器 12.5143832909
+花荣陪 13.2075304714
+猜中 9.98865464655
+张荫麟 12.5143832909
+角色行为 12.5143832909
+派活儿 13.900677652
+默示录 12.8020653633
+王肯堂 13.2075304714
+布迈丁 11.8212361103
+大型帆船 13.2075304714
+信息检索 10.9049453784
+重炮 10.604840786
+凯蒂 11.9547675029
+操引军 12.1089181827
+路面 7.85804481829
+何柱国 10.9562386728
+电介质 9.75754292558
+水洛城 13.2075304714
+贝勒阿敏 12.5143832909
+重点 5.25263165214
+吊挂 11.0674643079
+颧骨 9.94943393339
+劲头 9.01032852375
+魂消魄丧 13.2075304714
+两条腿 8.73019365694
+空气垫 13.900677652
+核能力 13.2075304714
+二名 11.0103058941
+二合 11.9547675029
+拉普拉塔河 10.765183436
+精雕细刻 10.6818018271
+一面倒 11.598092559
+小圆点 12.5143832909
+破烂货 13.900677652
+高感光度 13.900677652
+大虾 10.6818018271
+原器 12.2912397395
+磙子 13.900677652
+钢枪 10.8561552143
+中国国际展览中心 13.2075304714
+钢架 11.598092559
+两位 6.55209012105
+告密者 11.8212361103
+联邦德国队 13.2075304714
+缠扰 12.2912397395
+黎阳 10.2117981979
+大虫 9.22784881751
+鱿鱼片 12.8020653633
+仰义 13.2075304714
+戴鸿慈 12.5143832909
+啤酒业 12.8020653633
+字条 9.63799777493
+旧旧 13.900677652
+注塑 11.598092559
+卢济塔 13.900677652
+百余艘 12.5143832909
+出线权 13.2075304714
+库吏 13.900677652
+元兴元 11.3357282945
+大虎 12.1089181827
+温克让 12.2912397395
+结构式 10.2630914922
+走得快 11.0103058941
+二员 10.3171587135
+黄太冲 10.8561552143
+孙专掌 13.2075304714
+山野菜 12.1089181827
+口彩 13.900677652
+一九八六年 12.5143832909
+和晴雯 12.5143832909
+温度传感器 12.1089181827
+杨连真 12.2912397395
+关禁 13.2075304714
+整几个 13.2075304714
+百亩 10.1164880181
+巴巴结结 13.900677652
+付点 13.2075304714
+弟兄们 7.8604229407
+官审录 13.900677652
+中央预算 11.598092559
+公务舱 13.900677652
+拉下去 12.8020653633
+伊图尔 12.1089181827
+胡美丽 13.2075304714
+言密语 13.2075304714
+狂泻 10.9562386728
+瘦成 10.9049453784
+周虹 12.8020653633
+编了 10.8096351986
+礼尚往来 11.2616203224
+新宾满族自治县 12.8020653633
+边飞 13.900677652
+当场出丑 12.5143832909
+玄照经 13.2075304714
+达县市 12.8020653633
+感应圈 13.900677652
+指标性 13.900677652
+来点 10.6818018271
+起火燃烧 13.900677652
+多吨 10.2117981979
+大水库 11.1280889297
+追根溯源 10.7226238216
+减字谱 12.5143832909
+权杖 11.0103058941
+土壤侵蚀 11.3357282945
+直线型 12.8020653633
+北帝岩 13.900677652
+泽当 11.3357282945
+伯赞 12.5143832909
+得意之作 11.3357282945
+拍拍网 13.900677652
+河南站 13.900677652
+乌切洛 12.2912397395
+副粘病毒 12.8020653633
+毋忘 11.8212361103
+情味 12.1089181827
+披拂 12.1089181827
+裂片 9.56994431169
+贾政又 10.5684731418
+曲臂 13.2075304714
+来火 13.900677652
+张煌言 10.765183436
+哥白尼 9.59661255877
+京广线 10.4041700905
+多一会儿 11.1926274509
+东方文化 10.9049453784
+木仙庵 12.8020653633
+查里 13.2075304714
+真不少 10.3171587135
+云行雨施 13.900677652
+编书 11.7034530746
+贾政叫 11.7034530746
+黄石湖 13.2075304714
+巨人般 13.900677652
+马兰头 13.2075304714
+晋孝武帝 12.1089181827
+嫔从 12.8020653633
+重熔 11.5027823792
+体育科 12.5143832909
+玄灵宝 13.900677652
+卡斯皮 13.2075304714
+联片 13.2075304714
+增强器 11.5027823792
+局主席 12.2912397395
+动员戡乱 13.900677652
+快板儿 13.900677652
+软片 12.2912397395
+编上 12.2912397395
+丽达 12.8020653633
+带操 13.900677652
+言文一致 13.900677652
+狂气 13.900677652
+贺铸 12.1089181827
+帕鲁德 12.8020653633
+公务机 11.1280889297
+拖裙 13.900677652
+魏延守 12.8020653633
+吊扇 12.8020653633
+粗毛 11.8212361103
+薛绍彭 13.2075304714
+两百二十门 13.900677652
+主轴电机 13.900677652
+左袒 12.8020653633
+赵郡 11.1280889297
+编个 11.598092559
+引退 10.1630080337
+生物性 11.7034530746
+国家财政部 11.4157710022
+编为 8.90346537821
+渣子 10.9562386728
+吊扣 13.2075304714
+贪狼 13.900677652
+拉合尔市 13.900677652
+羽叶 12.2912397395
+凿壁偷光 13.900677652
+两万多元 12.1089181827
+未完结 13.900677652
+安第斯山脉 9.85762638414
+法外施仁 12.2912397395
+关窗 12.1089181827
+花光柳影 13.900677652
+恩平 12.1089181827
+辐射式 12.8020653633
+愤然离去 13.2075304714
+奥加辽 13.2075304714
+左家军 13.2075304714
+太天真 10.765183436
+冰砖 12.8020653633
+子午谷 12.1089181827
+咽部 9.93038573842
+大木头 11.9547675029
+西三环 11.1280889297
+编下去 13.2075304714
+逗趣 11.4157710022
+阴谋论 11.1280889297
+大蒜 7.77380846786
+适用人群 12.2912397395
+蒜泥 11.7034530746
+乔道清 9.7898037878
+情场 11.5027823792
+佐治亚 11.0674643079
+横陈 12.1089181827
+事业有成 11.3357282945
+雷明顿 12.1089181827
+高低贵贱 11.4157710022
+警督 12.1089181827
+二团 11.9547675029
+悖逆 11.598092559
+调查局 11.1926274509
+阳性植物 13.900677652
+中国曲艺家协会 13.2075304714
+千难万险 11.1926274509
+重物 9.61021821083
+稽核 10.2630914922
+树精 13.2075304714
+妆奁 10.4666904475
+念经 9.08039608637
+苏库马 13.2075304714
+狂澜 10.8096351986
+数制 11.9547675029
+刚正不阿 11.7034530746
+拦网 11.598092559
+古田县 10.8561552143
+重版 11.8212361103
+贴上标签 12.8020653633
+枪下 13.900677652
+二回 11.0674643079
+刑事 8.6803218269
+二四 12.2912397395
+关辽民 12.5143832909
+幻梦 12.1089181827
+花城出版社 13.900677652
+小丸子 12.2912397395
+重犯 10.642581114
+畅销 8.36728816325
+开疆展土 13.900677652
+大营 9.11318590919
+关税 7.61841090508
+玻璃心 13.900677652
+刑书 11.0674643079
+程建 12.8020653633
+樗栎庸材 13.900677652
+千难万难 11.8212361103
+泽维尔 13.2075304714
+四五千元 12.5143832909
+可居住性 13.900677652
+周边地区 9.58318953844
+狂潮 9.65218240993
+四五千克 13.2075304714
+宋江立 12.5143832909
+落帆 13.2075304714
+凌烟 12.1089181827
+骂阵 11.8212361103
+忙不迭 9.32596667347
+左轮枪 13.2075304714
+钢斧 12.5143832909
+程度 5.16434893064
+大葱 9.87532596124
+新格局 9.98865464655
+街道社区 12.2912397395
+神圣感 12.5143832909
+养命 11.4157710022
+胡汝银 11.9547675029
+砍头 9.93038573842
+很薄 9.54396882529
+位数 9.33632946051
+歧管 11.9547675029
+废水池 13.900677652
+不入虎穴 11.598092559
+邢太医 10.5684731418
+孔乙己 11.4157710022
+挖耳朵 13.900677652
+捡球 13.900677652
+羽化 9.82314020807
+太行山 8.23425096386
+程序 6.33281504651
+保和殿 10.4349417492
+毒粉 13.900677652
+炭疽病 10.4041700905
+一试之下 12.8020653633
+市场运作 10.2630914922
+过分劳累 12.2912397395
+马上悟 13.900677652
+何壮哉 13.900677652
+鸣枪示警 13.900677652
+铁阁子 13.2075304714
+德莱顿 13.2075304714
+是否是 9.44633035572
+结儿 13.900677652
+贾政先 12.5143832909
+下碗 12.8020653633
+酣睡 10.0940151622
+第九届 9.82314020807
+欢叫 10.4666904475
+原发灶 12.2912397395
+寿皇殿 10.9049453784
+劣者 13.2075304714
+汝岂知 13.2075304714
+熬夜 9.96885201925
+始乱终弃 11.9547675029
+进藏 10.3171587135
+注定 7.94225295895
+五十四句 13.2075304714
+狒狒 10.9049453784
+万绿湖 11.7034530746
+孤丁 12.2912397395
+孤东 12.8020653633
+黄池之会 12.8020653633
+孤丘 11.2616203224
+周萍 13.900677652
+掖紧 13.2075304714
+采访证 12.8020653633
+隐身术 13.900677652
+古玛 13.2075304714
+架上去 13.900677652
+来犯 9.63799777493
+毋巧 13.2075304714
+数百门 13.2075304714
+计算机控制 10.8561552143
+言明在先 12.2912397395
+酣眠 12.2912397395
+诱导剂 13.2075304714
+黄石河 12.2912397395
+第十七路 12.2912397395
+北帝庙 13.900677652
+三眼井 13.2075304714
+克莉斯 13.2075304714
+贪玩 10.8096351986
+刑侦 10.604840786
+枪伤 11.598092559
+程弹 10.6818018271
+放射状 9.31571017331
+歇手 11.7034530746
+千家万户 9.89334446674
+魏延复 13.2075304714
+程异 12.1089181827
+猛咬 13.2075304714
+资江 11.7034530746
+特雷泽 13.900677652
+程式 9.35738286971
+地勤人员 12.1089181827
+供献 11.0674643079
+魏延大 12.8020653633
+蝶形花冠 12.5143832909
+大藏 10.2630914922
+权数 12.2912397395
+裂点 12.1089181827
+精神科 11.0674643079
+气候调节 13.900677652
+顶下 12.8020653633
+纳梁氏 13.2075304714
+认真思考 11.3357282945
+缠手 13.2075304714
+重现 8.68574189437
+压裂液 12.8020653633
+银监局 9.41204128224
+正确看待 11.8212361103
+惑世诬民 13.900677652
+侈言 12.5143832909
+生物所 10.9049453784
+二圆 13.900677652
+已交 10.8096351986
+视同儿戏 13.2075304714
+大圣闪 12.5143832909
+小圆环 13.900677652
+杨开然 13.2075304714
+盈门 11.598092559
+吃独食 12.5143832909
+程志 13.2075304714
+结构层 12.8020653633
+政策措施 8.46695564842
+司徒雷登 11.8212361103
+大圣闻 13.2075304714
+库址 12.2912397395
+戊糖 11.5027823792
+孤云 12.1089181827
+通事郎 13.2075304714
+力学系统 11.598092559
+下愚不移 13.900677652
+违禁物品 12.8020653633
+吴大猷 12.5143832909
+生物战 11.5027823792
+卢马 12.8020653633
+于汉初 13.2075304714
+柳市 13.900677652
+阿贝丁 13.2075304714
+黎锦 12.1089181827
+由帅筹 13.2075304714
+斯塔尔克 13.900677652
+七部 11.1280889297
+农桑通 12.8020653633
+解放碑 12.2912397395
+禹前 13.2075304714
+贾侯渠 12.8020653633
+南河沿 12.5143832909
+细砂糖 13.900677652
+毛线帽 13.2075304714
+注子 11.8212361103
+非正规 10.5684731418
+忏悔者 12.8020653633
+卫生室 10.9562386728
+二块 12.1089181827
+环抱 8.90346537821
+莉妮 13.2075304714
+舍身报国 12.8020653633
+权时 11.7034530746
+大蕉 11.3357282945
+傅籍 13.2075304714
+几十代 13.2075304714
+周扬 11.1926274509
+真心实意 10.0505300503
+放热反应 13.2075304714
+黑窝 12.8020653633
+侯宝山 10.6818018271
+格雷茅斯 13.2075304714
+齐最强 12.8020653633
+几十件 12.5143832909
+八五 11.3357282945
+容小其 13.2075304714
+几十份 12.5143832909
+木板 8.14810501315
+周仆叉 12.8020653633
+技侦 13.2075304714
+地走了 8.55834340001
+棒球场 13.2075304714
+石泓寺 13.2075304714
+目光远大 12.2912397395
+施莱登 11.2616203224
+寻乐 13.2075304714
+盛器 13.2075304714
+裂隙 9.12999302751
+五十余斤 13.900677652
+冯舒 11.1280889297
+有恩义 13.900677652
+大同江 10.642581114
+相统属 11.5027823792
+佟军门 13.2075304714
+貔貅 12.2912397395
+八亿 11.7034530746
+唐人传 13.900677652
+总经理 6.4628825303
+王胤昌 11.7034530746
+五十四岁 12.2912397395
+银行利息 11.7034530746
+麦尔维 13.900677652
+树状 11.2616203224
+拉格湾 13.900677652
+几十亩 11.2616203224
+高音喇叭 9.5186510173
+凌霄 11.598092559
+镇静 8.22050504296
+大白于天下 11.0674643079
+缘会 13.900677652
+绞刑架 11.5027823792
+花边新闻 13.2075304714
+二声 12.8020653633
+医务室 12.8020653633
+几十人 10.642581114
+西凉乐 12.8020653633
+蔡特金 12.2912397395
+断腿 10.765183436
+几十亿 10.8561552143
+八代 10.642581114
+白打 12.5143832909
+怀顺王 12.8020653633
+难治性 12.2912397395
+韦小宝 12.8020653633
+大提 13.900677652
+坡坡 12.1089181827
+一多数 13.2075304714
+联美 11.0103058941
+八件 11.1280889297
+结构厂 13.2075304714
+泳池 11.9547675029
+台盟中央 13.2075304714
+八份 13.900677652
+胸腺素 12.1089181827
+地平仪 13.2075304714
+软缎 11.9547675029
+八一 8.68574189437
+位次 10.4994802703
+骄兵之计 13.2075304714
+偏歪 13.2075304714
+顾始汗 13.900677652
+凸面 11.7034530746
+情妇 9.89334446674
+一万四千余顷 13.2075304714
+联署 13.900677652
+西击勃 13.2075304714
+延缓执行 11.3357282945
+博会 10.2371160058
+不惜牺牲 10.8561552143
+但说无妨 12.5143832909
+鸿源 12.2912397395
+向西山 12.8020653633
+木杠 13.2075304714
+相沿成 12.8020653633
+马萨瓦 13.2075304714
+应付账款 12.5143832909
+集体主义 11.7034530746
+水利系 13.2075304714
+河南省 6.56374073827
+八个 7.73947033028
+砍坏 13.900677652
+舰船 8.27305653829
+拾取 11.1926274509
+库塔 12.2912397395
+反式消除 13.900677652
+汽化器 12.5143832909
+粗暴 8.97342396682
+修炼法 12.5143832909
+凌统 11.0103058941
+翻一番 10.2897597393
+通知函 11.9547675029
+四大部 10.7226238216
+周诸 12.8020653633
+拾去 12.8020653633
+几十两 12.2912397395
+不钓 13.900677652
+一个十八岁 11.8212361103
+胃部不适 12.2912397395
+几十个 8.27305653829
+依波 13.900677652
+伦敦经济学院 11.4157710022
+落花生 11.598092559
+萧峰 13.900677652
+进言 9.56994431169
+舰艇 7.82763311788
+周语 11.2616203224
+冰释 11.5027823792
+裂缝 8.48457724977
+生意盎然 12.5143832909
+周详 10.0505300503
+冰量 11.8212361103
+八九 9.93038573842
+减低 8.73589167805
+结构化 9.40086798165
+离子半径 11.2616203224
+几十万 8.7245279194
+欢欢喜喜 11.0103058941
+热点话题 10.642581114
+几十下 13.2075304714
+内华达州 11.0674643079
+无雪 11.9547675029
+崖壁画 12.1089181827
+真珠 11.598092559
+经理部 12.1089181827
+联缀 10.8561552143
+补语 12.2912397395
+公一母 13.2075304714
+德国柏林大学 11.1280889297
+大讲 11.8212361103
+冰雪聪明 11.7034530746
+显著者 12.2912397395
+减产 8.26946587015
+绕弯儿 12.2912397395
+一问一答 11.0674643079
+父子情 12.8020653633
+奴才 7.35532799164
+减人 13.2075304714
+博亚 12.8020653633
+程典 13.2075304714
+交接处 10.4994802703
+三千余只 12.8020653633
+二妹 13.2075304714
+减亏 11.5027823792
+埃雷拉 13.900677652
+联络 7.45337178943
+红移量 12.8020653633
+河汇注 13.2075304714
+外部 7.02854955064
+减了 10.765183436
+陈在竹 9.72629038208
+百余辆 11.598092559
+联结 8.2985588311
+体育界 11.3357282945
+软线 13.2075304714
+生堂溪 13.2075304714
+木扎尔 12.1089181827
+冰碛 9.63799777493
+权欲 13.2075304714
+联组 13.900677652
+工资额 11.598092559
+库姆 10.7226238216
+韦拉克鲁斯州 13.2075304714
+鲤科 10.1630080337
+巴拉尼 13.900677652
+联线 11.1926274509
+不忘故旧 12.8020653633
+票箱 12.2912397395
+钢模 13.2075304714
+大诰 10.8096351986
+拾到 11.5027823792
+大课 12.2912397395
+惰性元素 13.2075304714
+第六十七篇 13.2075304714
+造船业 9.75754292558
+清水衙门 12.8020653633
+脱氨 13.2075304714
+减价 11.5027823792
+清醒认识 10.6818018271
+补记 12.5143832909
+两例 12.8020653633
+条锈病 12.8020653633
+熊坛 13.2075304714
+库克峰 13.900677652
+外邦 10.604840786
+蔡继琨 13.2075304714
+巴拉尔 13.2075304714
+应节 12.2912397395
+大话 10.1630080337
+火树银花 12.2912397395
+二姊 13.2075304714
+笊篱 11.0674643079
+凯西 11.9547675029
+乡镇党委 12.5143832909
+漆布 12.8020653633
+文件格式 13.900677652
+二姐 10.0294766411
+二姑 10.0940151622
+凭良心 11.7034530746
+慢到 13.2075304714
+软绵 12.1089181827
+车里雅宾斯克 11.4157710022
+减仓 7.38005652442
+裂纹 9.34680076038
+二大 10.3171587135
+抬头挺胸 12.1089181827
+内蒙古自治区人民政府 12.8020653633
+房屋交易 12.2912397395
+外遇 10.4666904475
+广征博采 12.8020653633
+心无二用 12.8020653633
+万多立方米 12.1089181827
+铜管乐 13.900677652
+假若有 13.2075304714
+情境 9.85762638414
+狂恋 13.2075304714
+稽查 9.35738286971
+二头 11.9547675029
+外道 11.1926274509
+四五千年 10.765183436
+减为 9.63799777493
+探听虚实 11.4157710022
+小轩窗 13.900677652
+子午莲 13.900677652
+中世纪 7.36109169636
+革新派 11.5027823792
+翁岢隽 13.2075304714
+二处 9.94943393339
+减下 13.2075304714
+左监军 13.2075304714
+再运行 13.900677652
+补习功课 12.2912397395
+劲吹 12.8020653633
+二外 13.900677652
+分档 11.3357282945
+渣土 12.2912397395
+博丹 12.1089181827
+缘份 12.1089181827
+尼德兰 9.6811699468
+库奇 12.2912397395
+风速计 12.2912397395
+不难理解 9.91169360541
+妖婆 11.9547675029
+外逃 10.5684731418
+缘于 9.38981814546
+狂态 12.1089181827
+渐变色 13.900677652
+台背斜 11.598092559
+申不害 11.3357282945
+豆象 11.9547675029
+斯瓦希 13.2075304714
+二奶 10.765183436
+惠能禅 13.2075304714
+续古逸 12.2912397395
+自称为 9.72629038208
+丢人现眼 10.604840786
+二女 11.2616203224
+狂怒 10.533381822
+继承衣钵 13.900677652
+张三爷 9.82314020807
+博乐 11.4157710022
+养子 9.08039608637
+库克山 12.2912397395
+局管内 13.2075304714
+嵌石 13.900677652
+陈越香 13.2075304714
+生活状况 9.98865464655
+二套 7.69814213479
+天气晴朗 10.4041700905
+周期时间 13.900677652
+丽莎 11.7034530746
+沉默寡言 9.96885201925
+县办 13.900677652
+挤作一团 13.900677652
+有钱人 9.65218240993
+老年公寓 11.8212361103
+厘米波 11.7034530746
+执政者 10.533381822
+沾水 11.8212361103
+真菌性 11.4157710022
+鉴别能力 12.5143832909
+北方大学 12.5143832909
+土办法 12.5143832909
+拦海大坝 12.8020653633
+河南建业队 12.5143832909
+辐射区 12.5143832909
+洗手不干 11.7034530746
+惊爆价 13.900677652
+一张白纸 10.533381822
+五项原则 10.5684731418
+程前 13.900677652
+放卫星 12.2912397395
+但那次 12.8020653633
+票选 11.9547675029
+由异戊 12.8020653633
+拾元 11.9547675029
+大袋 12.2912397395
+俘获 8.69119149913
+攻击方式 11.9547675029
+十八级 12.2912397395
+铸造业 11.9547675029
+欢度 11.0103058941
+玻璃化 10.9049453784
+武烈 13.900677652
+优惠政策 7.45020722983
+主色调 11.9547675029
+不翼而飞 10.8096351986
+玻利瓦尔城 13.2075304714
+姑且一试 12.2912397395
+何州 12.8020653633
+掉转头 11.4157710022
+魏延各 12.5143832909
+卢音 12.8020653633
+养士 11.598092559
+采薇 12.5143832909
+陆定一 12.1089181827
+尤苏巴 11.9547675029
+欢庆 10.0940151622
+来美 12.8020653633
+二嫂 10.1630080337
+数千 8.23425096386
+镇长 10.8561552143
+赤霉病 12.1089181827
+适销对路 11.8212361103
+财务顾问 9.56994431169
+秦降卒 12.8020653633
+迭部 12.1089181827
+石湖见 12.2912397395
+麦季 12.2912397395
+风速表 13.2075304714
+石渠宝 12.2912397395
+倒灌 9.91169360541
+碧昂丝 12.5143832909
+进袭 11.1926274509
+夫倡妇随 13.900677652
+阔达 13.2075304714
+错过机会 11.8212361103
+二千五百颗 13.2075304714
+公债券 11.4157710022
+补补 10.8096351986
+喝下去 9.93038573842
+横幅标语 13.2075304714
+红墨水 12.5143832909
+王义良 11.2616203224
+弗朗索斯 12.8020653633
+翻然悔悟 12.5143832909
+特克人 12.8020653633
+涌泉相报 11.8212361103
+房山区 10.2630914922
+和俊斌 13.2075304714
+进行 3.72712479502
+玉顶赤 13.2075304714
+双烯烃 12.1089181827
+发电机 8.57280148319
+切削液 12.8020653633
+补血 9.53122979951
+戒备 9.36807815882
+五十四年 10.9049453784
+进补 10.2117981979
+豆沙 10.6818018271
+华莱士 10.8561552143
+蛆虫 10.3171587135
+维契托 13.900677652
+白拿 12.8020653633
+二娘 12.2912397395
+百余条 11.9547675029
+市场策略 10.533381822
+景观学 11.8212361103
+巴拉德 12.2912397395
+大樱桃 12.2912397395
+游长安 12.8020653633
+二婶 9.45802639549
+大补 10.6818018271
+大衣 8.66423568915
+能工巧匠 10.7226238216
+稠油 12.2912397395
+亚急性 10.4994802703
+大街 7.45020722983
+重组 5.82292008824
+畅饮 10.9049453784
+关白 11.9547675029
+周角 13.900677652
+无关痛痒 11.8212361103
+念物 11.9547675029
+苦笑 7.6781013839
+佛得角非洲独立党 13.2075304714
+展翅高飞 12.2912397395
+十二三 13.2075304714
+大行 7.97909923233
+二婚 11.9547675029
+妒嫉 10.8096351986
+活棋 12.1089181827
+钢桥 11.7034530746
+联系 5.61214319256
+二审 10.0720362555
+过敏者 11.0674643079
+西西里 9.38981814546
+说不上来 10.7226238216
+阴消阳 13.2075304714
+水利网 12.5143832909
+欢快 8.9102450652
+二家 11.1280889297
+钢桶 12.8020653633
+在线电影 13.900677652
+鼠年 11.598092559
+一贫如洗 10.5684731418
+二宇 13.2075304714
+镇痛药 10.3171587135
+欢心 9.40086798165
+省区市 9.94943393339
+逍遥法外 11.4157710022
+暖湿气流 10.604840786
+虞于唐 12.8020653633
+二宗 11.3357282945
+保静军 13.2075304714
+大要 11.1926274509
+粗放 9.33632946051
+索科托 11.8212361103
+补角 13.900677652
+朱震达 12.5143832909
+查斯丁 13.2075304714
+裙板 11.0674643079
+王立东 13.2075304714
+前奏曲 10.9049453784
+重置 10.9562386728
+柳元景 12.5143832909
+重罪 9.80633308975
+砖瓦房 12.1089181827
+杨绵绵 11.1926274509
+二十余间 13.2075304714
+软糖 12.8020653633
+悲风 11.598092559
+令人堪忧 12.5143832909
+西山区 11.9547675029
+二寸 10.3743171274
+二对 11.8212361103
+环天线 13.900677652
+双边协议 11.4157710022
+费弗尔 12.8020653633
+特困户 11.8212361103
+冰鉴 12.5143832909
+精神病 8.90346537821
+负有重任 13.900677652
+流进来 12.8020653633
+暖和些 13.900677652
+中国武术 9.66657114738
+几位数 13.900677652
+大观 9.61021821083
+奴性 11.0674643079
+库宁 11.8212361103
+任期制 11.8212361103
+商业部门 10.4994802703
+念珠 9.66657114738
+不让须眉 13.2075304714
+重罚 10.2117981979
+密歇根湖 10.9049453784
+寿永昌 13.2075304714
+努尔哈赤 9.09665660724
+曹俊臣 13.2075304714
+辐射力 11.598092559
+阻塞住 13.900677652
+亲近感 12.5143832909
+逗耍 13.900677652
+诸小国 11.9547675029
+王五权 10.8096351986
+脑浆 10.2897597393
+胶印机 12.8020653633
+阿卜莱 13.900677652
+养大 10.2117981979
+统御 11.4157710022
+广播室 13.2075304714
+夜神仙 13.900677652
+谢通门县 12.5143832909
+丁绪贤 13.2075304714
+宝钗宝玉 12.5143832909
+位标 13.2075304714
+库存 6.59146528628
+莫尔加尼 12.8020653633
+漫无止境 12.8020653633
+切削油 12.8020653633
+李德林 12.8020653633
+库子 11.1926274509
+瘫软 9.91169360541
+张岚峰 12.8020653633
+莽莽苍苍 11.7034530746
+码数 13.2075304714
+大褂 10.4666904475
+业主大会 13.900677652
+红黄蓝 11.8212361103
+敬贤礼士 13.2075304714
+女演员 9.26594866375
+锡克 11.1280889297
+养女 9.7898037878
+行商 10.3171587135
+竟夜 13.900677652
+三聚磷酸钠 12.2912397395
+二季 9.49395840471
+变动不居 12.1089181827
+分身乏术 12.1089181827
+大西 10.4994802703
+竟夕 12.8020653633
+衬衫厂 12.5143832909
+一点点儿 12.2912397395
+晕过去 10.4349417492
+检字法 12.2912397395
+家庭暴力 11.9547675029
+斯瓦尔 11.8212361103
+软陶 13.2075304714
+贪心不足 11.7034530746
+关着 9.75754292558
+抢嘴 13.900677652
+嘻笑 11.1280889297
+波列夫 12.8020653633
+巴西联邦共和国 12.8020653633
+阿喇戈 13.900677652
+披沥 11.8212361103
+大襟 9.89334446674
+商业部长 12.5143832909
+贵阳人 13.900677652
+粗旷 13.900677652
+百花争妍 13.2075304714
+延世大学 12.8020653633
+二子 10.3453295905
+畅顺 13.2075304714
+码放 10.7226238216
+两姨亲 13.900677652
+拥吻 13.2075304714
+马利沃 13.900677652
+支撑不了 12.1089181827
+没有用完 11.9547675029
+走向前来 12.8020653633
+田青廉 11.0103058941
+恍忽 13.2075304714
+查顿 13.900677652
+欢声 10.9562386728
+记事文 13.900677652
+搓板 12.5143832909
+放荡 9.96885201925
+最圆 13.900677652
+戊醇 13.2075304714
+凌空 9.35738286971
+好个 9.23723855786
+横眉立目 12.2912397395
+好丑 13.900677652
+二岁 11.598092559
+心志 10.2630914922
+外篇 10.4994802703
+软管 11.3357282945
+座标 11.5027823792
+船夫曲 13.2075304714
+妆匣 13.900677652
+外间 8.57280148319
+测试仪 11.8212361103
+冰锥 12.1089181827
+于敬轩 13.900677652
+郎家取 13.2075304714
+公孙侨 13.2075304714
+戒律 9.59661255877
+着着实实 12.5143832909
+马宝玉 13.900677652
+库岸 13.900677652
+好乱 13.2075304714
+钟鸣鼎食 11.9547675029
+电荷中和 13.900677652
+直线度 13.2075304714
+闻虎山 12.8020653633
+好书 10.4666904475
+拖腔 11.3357282945
+冰镇 11.0674643079
+周转 7.75649201785
+忌食 10.3171587135
+瘦身 9.58318953844
+热效应 9.96885201925
+断肠 10.7226238216
+来福 11.0103058941
+好乖 12.5143832909
+各表 11.9547675029
+卢里 12.8020653633
+开门见喜 12.1089181827
+承诺函 10.7226238216
+好久 8.4980002701
+广播局 12.8020653633
+慎思 13.900677652
+戒心 9.80633308975
+神经肽 13.2075304714
+看海 11.9547675029
+养廉 12.8020653633
+冰镩 12.2912397395
+好么 9.72629038208
+结构型 11.1926274509
+周边 7.20240959786
+城市用地 12.8020653633
+邮政法 11.4157710022
+中国证监会 7.38893232233
+合川市 11.9547675029
+好人 7.78478552649
+精神爽 13.2075304714
+放牧区 13.2075304714
+二尾 13.2075304714
+施一礼 13.900677652
+蜀锦吴绫 13.900677652
+二尺 9.41204128224
+宋锦 11.8212361103
+两女一男 13.2075304714
+和容悦色 13.900677652
+枳壳 11.9547675029
+二小 11.1926274509
+劲儿 8.33999602096
+百分之五十左右 12.8020653633
+见了面 9.43476953332
+三二十匹 12.8020653633
+五十辆 11.9547675029
+周辉 13.2075304714
+赵敬侯 12.5143832909
+查第格 13.900677652
+大气窗 13.900677652
+好于 7.89186446653
+各军区 11.0103058941
+存储空间 11.5027823792
+差价 8.90346537821
+外销 8.96620371885
+中国文学艺术界联合会 11.1280889297
+好价 13.2075304714
+差事 8.89673134603
+两男一女 11.7034530746
+外锅 13.2075304714
+系列小说 11.7034530746
+湾头 11.3357282945
+伪装者 13.900677652
+旱作 9.69598503258
+干部部 11.7034530746
+勤俭建国 12.5143832909
+差些 10.765183436
+动物性 9.75754292558
+蒙塔涅 12.8020653633
+蚯蚓 9.20932976975
+循规蹈矩 10.533381822
+重磅 9.43476953332
+二层 9.24671730182
+调查团 10.604840786
+二局 12.5143832909
+吊死 9.72629038208
+令人恼火 13.900677652
+高不成低不就 11.7034530746
+二届 10.0294766411
+沥血 11.9547675029
+库尔 10.2117981979
+戊酮 12.1089181827
+法律文书 10.604840786
+关灯 10.8096351986
+安尼斯顿 12.8020653633
+男大须婚 12.8020653633
+狂放 10.8096351986
+总想找 12.8020653633
+细看之下 12.8020653633
+周迅 9.98865464655
+挑拣 11.2616203224
+周学军 13.900677652
+帕拉伊 13.900677652
+房价 6.54248389924
+好似 8.24119543622
+结构图 10.642581114
+由不得 9.23723855786
+库巴 11.9547675029
+快刀斩乱麻 11.1280889297
+进过 10.0940151622
+本质区别 10.2897597393
+全力支持 9.80633308975
+重礼 10.4994802703
+缠绕着 10.2897597393
+补述 13.900677652
+羽士 12.5143832909
+文中说 12.5143832909
+珍禽奇兽 13.2075304714
+养得 10.533381822
+哭调 11.9547675029
+自由之子 13.2075304714
+顾不得 8.18694484647
+巴拉塔 13.900677652
+补过 11.1280889297
+七里 10.1630080337
+第十二天 12.8020653633
+测位器 12.8020653633
+象限仪 11.7034530746
+遗诏 9.5186510173
+座椅 8.38724890581
+钢铁厂 9.4233408375
+联立 11.3357282945
+注册 7.29132840881
+差使 9.38981814546
+乌桓连 12.2912397395
+明断是非 13.2075304714
+外铺 13.2075304714
+百十步 11.8212361103
+小秘 13.900677652
+镂空 10.0505300503
+元化 13.2075304714
+科研专家 13.900677652
+第十八条 11.9547675029
+群众监督 11.1280889297
+伪饰 12.2912397395
+好使 9.77354326693
+座楼 10.642581114
+同甘苦 10.8561552143
+改性沥青 12.5143832909
+感应式 11.5027823792
+票面 8.15767446417
+所在城市 11.598092559
+效忠 8.81927328699
+芬兰人 11.4157710022
+大运 11.4157710022
+大连 7.58170953823
+萝卜快了不洗泥 12.5143832909
+宋童贯 13.2075304714
+声光电 12.5143832909
+养心 11.0674643079
+托罗斯 11.3357282945
+动物 5.82013068615
+房事 9.71102290995
+七大姑八大姨 11.9547675029
+赵述岛 11.7034530746
+中日战争 10.4349417492
+胚轴 11.5027823792
+大迎 12.2912397395
+来碗 12.8020653633
+明经笑 12.5143832909
+两任 11.4157710022
+雷二人 11.4157710022
+计算速度 11.4157710022
+公孙丑 12.5143832909
+氟牙症 13.900677652
+自我教育 11.2616203224
+时凯平 13.2075304714
+插队知青 13.900677652
+周身 9.02548032877
+溜井 13.2075304714
+夏鲁 12.8020653633
+伦常之 11.5027823792
+边饰 13.900677652
+欢好 13.900677652
+毛囊炎 11.7034530746
+元裔之 12.8020653633
+黄菊花 13.900677652
+小曲儿 11.0674643079
+悖理 12.1089181827
+拾回 13.2075304714
+望加锡 11.4157710022
+延伸性 12.5143832909
+贺鲁 11.0674643079
+公孙为 12.5143832909
+鲁攻银 13.2075304714
+变化不穷 13.900677652
+悲鸣 10.533381822
+拒绝执行 11.0103058941
+汉元朔 12.8020653633
+本学科 11.4157710022
+乐思 11.598092559
+集体行动 11.4157710022
+房主 10.0088573539
+柯太守陈 12.5143832909
+伸头探脑 12.8020653633
+冰铜 13.2075304714
+贤达 11.1926274509
+中俄关系 11.5027823792
+房中 8.00078029839
+置换术 12.1089181827
+各位朋友 11.5027823792
+大软 13.900677652
+于斌 12.8020653633
+牌子曲 11.8212361103
+注入 6.48369803059
+房东 9.23723855786
+拉脱维亚语 12.5143832909
+砍刀 10.4666904475
+拉来拉去 13.900677652
+燕雀安知 13.900677652
+半身不遂 10.642581114
+劲健 10.765183436
+横眉立眼 13.900677652
+闲情逸致 11.0674643079
+成都飞机工业公司 13.900677652
+关照 8.62767809341
+蒜末 13.2075304714
+镇海电厂 12.5143832909
+二度 9.80633308975
+二座 11.5027823792
+积草屯粮 11.7034530746
+立体镜 13.900677652
+插队落户 12.1089181827
+豹猫 11.3357282945
+冰霜 10.533381822
+留胡子 13.900677652
+提格雷 11.7034530746
+周质 12.8020653633
+诉苦会 12.8020653633
+荡漾 9.5062284973
+抠出 10.8096351986
+云淡 13.2075304714
+保德县 13.900677652
+砍出 12.1089181827
+木尔坦 12.1089181827
+体育片 13.900677652
+达吉 13.2075304714
+体育版 13.900677652
+重税 11.3357282945
+坚定不移 9.04864738806
+透露 5.94982279426
+采光口 13.2075304714
+售楼部 9.94943393339
+特雷斯 12.8020653633
+输出管 12.8020653633
+里米尼 11.7034530746
+郑强 12.2912397395
+远华案 12.8020653633
+质询者 13.900677652
+警察故事 12.8020653633
+顿巴斯 11.4157710022
+捞外快 12.1089181827
+苏打水 12.5143832909
+从今年起 11.9547675029
+歇歇 9.23723855786
+前翼子板 13.900677652
+井元代 13.2075304714
+篾席 12.5143832909
+丽萨 12.2912397395
+调查员 11.7034530746
+解模 13.2075304714
+百乘 12.5143832909
+植物界 9.94943393339
+黎鲁 13.2075304714
+皮钦语 13.900677652
+虎踞龙蟠 13.2075304714
+赖其芳 13.2075304714
+攀不上 12.5143832909
+情形 6.33592063907
+冰面 9.91169360541
+须勤慎 13.900677652
+高峰期 8.5488195185
+厨工 13.2075304714
+乳酸菌 11.1926274509
+丽萍 8.9308643524
+丘埃洛 13.2075304714
+朱石麟 12.8020653633
+粗枝大叶 13.2075304714
+大谷 11.3357282945
+慎择 12.5143832909
+禾场 12.5143832909
+履险如夷 12.5143832909
+阔论 12.8020653633
+贾母素 13.2075304714
+库平 12.1089181827
+注到 12.2912397395
+二席 12.8020653633
+真诚待人 13.900677652
+开通 7.51211624643
+新乡市 9.59661255877
+处心积虑 10.3453295905
+辐射型 12.2912397395
+义无返顾 12.1089181827
+军烈属 12.8020653633
+冰鞋 12.5143832909
+大谬 12.5143832909
+加殊锡 13.2075304714
+土石方 11.0674643079
+外面 6.40014816658
+兖州县 12.2912397395
+关爱 9.0884932966
+职位 7.70627226087
+砍光 11.7034530746
+陈那颜 12.2912397395
+索乙契 13.2075304714
+动物所 11.2616203224
+河洛之 13.2075304714
+大调 9.75754292558
+贺龙 9.74179456862
+玉为容 13.900677652
+和田晓萌 12.8020653633
+狠得 11.7034530746
+石油机械 11.2616203224
+二帝 10.2117981979
+记事本 11.7034530746
+大谈 10.642581114
+联社 11.0674643079
+进谒 12.8020653633
+各装 11.4157710022
+上海展览中心 12.5143832909
+腺苷酸 13.900677652
+王象晋 12.5143832909
+闲常 11.0103058941
+子午仪 11.4157710022
+孙建初 13.2075304714
+清华大学 8.08059472162
+鼠害 11.7034530746
+二年 6.40070111102
+劲升 9.89334446674
+欢娱 10.9049453784
+挥挥手 8.85082164473
+阎立德 12.5143832909
+淅沥沥 13.2075304714
+情志 9.69598503258
+镇里 10.8096351986
+进谏 10.2630914922
+大豪 12.5143832909
+唐李延寿 12.8020653633
+念白 10.4041700905
+俚语 11.0674643079
+一千二百万 13.900677652
+休耕地 12.5143832909
+姊妹会 13.900677652
+大豆 6.98594675926
+外露 9.80633308975
+辩护士 11.0674643079
+批销 13.2075304714
+库布 12.5143832909
+伯益 11.2616203224
+索罗斯 9.4233408375
+马勋 13.2075304714
+林四娘 12.2912397395
+治乱 10.3171587135
+谢清斋 9.12155415886
+大足 10.8561552143
+重大成就 10.4994802703
+于太清 13.2075304714
+唇干舌燥 13.2075304714
+地层图 13.2075304714
+俚言 13.900677652
+劲力 10.9049453784
+关王 13.2075304714
+周谨 10.7226238216
+老管家 13.2075304714
+座次 9.82314020807
+分散聚合 13.2075304714
+劳图斯 11.8212361103
+东照宫 13.900677652
+职任 11.5027823792
+巩家庄 13.2075304714
+芝华士 13.900677652
+翠柏丛 13.2075304714
+夫妻情 11.1926274509
+于沪江 13.2075304714
+职介 12.5143832909
+科学研究 7.90174109003
+发电报 11.7034530746
+魏延入 13.2075304714
+惊天地 11.7034530746
+拖船 11.3357282945
+打不着 10.9049453784
+进路 12.1089181827
+双姝 13.900677652
+误闯 12.8020653633
+价格低廉 9.75754292558
+不久以后 10.4349417492
+大跳 12.5143832909
+马槽中 12.5143832909
+喘息声 11.0103058941
+含氧酸 10.7226238216
+软磁 10.9049453784
+欢宴 10.8561552143
+以备不测 11.9547675029
+野食儿 13.2075304714
+邓丽君 12.8020653633
+谁料 10.2897597393
+肩负重任 12.2912397395
+补足 9.69598503258
+耶摩诃 13.900677652
+流行歌 11.598092559
+现金结算 11.5027823792
+二心 9.5062284973
+软磨 12.5143832909
+汪精卫 8.81927328699
+自来水厂 12.5143832909
+二十余里 10.2371160058
+注发 13.900677652
+乙二胺 11.5027823792
+职事 9.89334446674
+狂暴 10.0294766411
+黄潜蝇 13.2075304714
+五十四家 13.2075304714
+辐射器 12.2912397395
+向敏敏 11.9547675029
+三五十步 12.2912397395
+欢实 12.8020653633
+大跌 7.06120121375
+麦克米伦 10.9562386728
+二弦 12.8020653633
+贤路 11.4157710022
+大贵 11.9547675029
+二张 10.8561552143
+景观带 11.5027823792
+江风峭 13.2075304714
+生活费用 10.604840786
+丽藻 13.2075304714
+宋江答 12.8020653633
+大败 7.4191005227
+大贤 11.0674643079
+大财 10.5684731418
+季子 12.5143832909
+极大丰富 12.2912397395
+省议会 10.9562386728
+承诺制 12.8020653633
+外院 11.7034530746
+补赎 13.2075304714
+缺乏症 10.7226238216
+二式 13.2075304714
+已知数 12.2912397395
+物化劳动 10.2630914922
+内部人员 11.8212361103
+贺麟 13.900677652
+外陵 13.2075304714
+首日封 12.2912397395
+明经科 13.2075304714
+成品粮 11.9547675029
+中奖率 13.2075304714
+定远 9.28555713513
+俘虏 7.62968922012
+冰雕 11.5027823792
+补货 11.5027823792
+外事活动 12.1089181827
+趣闻 11.4157710022
+大赦 9.49395840471
+来稿 12.5143832909
+治产 12.8020653633
+马不停蹄 9.61021821083
+左家塘 13.2075304714
+补贴 7.13910488317
+胡松华 12.8020653633
+大赫 13.2075304714
+保有储量 10.642581114
+巴吉 12.8020653633
+刑警队 11.598092559
+凯迪 10.0940151622
+开道 9.94943393339
+吊桶 10.765183436
+冰雹 9.0884932966
+大赛 8.74162235276
+容易腐烂 12.5143832909
+进贡 9.12155415886
+进货 9.87532596124
+进账 10.6818018271
+砍倒 10.2371160058
+妒忌 10.1164880181
+吊桥 9.00283785202
+冰雨 13.900677652
+大赌 12.2912397395
+职业 6.76818010032
+含氧量 10.8096351986
+图书目录 13.2075304714
+积满灰尘 13.2075304714
+外观 7.80485308954
+披着 8.86372504956
+萨拉托夫州 12.8020653633
+治兵 11.0674643079
+房号 10.765183436
+感恩戴德 10.7226238216
+菜锅 13.2075304714
+凌晨 7.65845438652
+魏延乃 13.2075304714
+外角 13.2075304714
+松义郎 13.900677652
+墨竹工卡 11.9547675029
+魏延之 12.1089181827
+来时 7.93453091285
+好利 11.598092559
+捡拾 11.598092559
+陈师道 11.5027823792
+援建 10.0294766411
+新旗舰 11.8212361103
+丁六粮 13.2075304714
+关河 11.3357282945
+治党 13.900677652
+速决 10.8561552143
+庄晚芳 11.7034530746
+平平妥妥 13.900677652
+专项斗争 12.1089181827
+水远山遥 13.2075304714
+周昂战 13.900677652
+编导 8.96620371885
+几十回 12.8020653633
+兰平原 13.900677652
+中国民主同盟中央 11.598092559
+上蔡县 10.5684731418
+蓄意谋杀 13.900677652
+嘎那 12.8020653633
+阖家 13.900677652
+理性主义 9.80633308975
+言明 10.2897597393
+差分 10.4994802703
+科技攻关 10.4666904475
+民事行为 10.8096351986
+凸边 13.900677652
+裂果 13.900677652
+编定 10.2371160058
+上吐下泻 12.2912397395
+孤女 11.0674643079
+拿上来 11.4157710022
+编审 10.4666904475
+阿托卡夫 12.2912397395
+差别 6.75943252963
+后妻 11.9547675029
+通波波 13.900677652
+撬杠 13.2075304714
+嘀里嘟噜 13.900677652
+来文 12.2912397395
+嗟来之食 12.8020653633
+高尔夫球场 10.0505300503
+河阳仓 13.2075304714
+造船场 12.5143832909
+关注 4.80765792258
+来料 12.8020653633
+再融资 7.40843781696
+冠瘿瘤 13.900677652
+各要 10.9562386728
+八国 11.1280889297
+纲要 8.94485059437
+闺英闱秀 13.900677652
+顽抗到底 11.5027823792
+庄客王 12.8020653633
+凸轮 10.9562386728
+副标题 12.8020653633
+重播 12.5143832909
+盛泽名 12.8020653633
+动物类 13.2075304714
+枪声 8.44535653662
+批风抹月 13.900677652
+畅茂 12.2912397395
+生物界 9.55687223012
+关氏 12.8020653633
+封怀王 13.2075304714
+张家店 12.8020653633
+氆氇 10.7226238216
+澳元兑 10.2117981979
+好动 10.6818018271
+房卡 13.2075304714
+来敏 13.2075304714
+交臂失之 13.2075304714
+联合演出 11.8212361103
+软木 9.94943393339
+夏洛克 12.1089181827
+好办 8.55357012126
+钢铁业 9.09665660724
+联村 13.900677652
+居怀州 13.2075304714
+争霸赛 9.7898037878
+道德风尚 11.598092559
+初中英语 13.900677652
+政治文明 11.3357282945
+粗纱 12.1089181827
+粗线 11.4157710022
+卢贝 13.900677652
+认同感 11.1926274509
+粗纺 11.5027823792
+浑浑噩噩 11.0103058941
+二三十家 12.5143832909
+太爷 9.84023464143
+联机 10.642581114
+吊睛 12.2912397395
+张晨 13.900677652
+镇远 10.533381822
+太爱 10.9562386728
+粗绒 12.8020653633
+捱过 11.7034530746
+铝酸钙 13.2075304714
+洋为中用 13.900677652
+罗雪尔 11.5027823792
+吊着 10.0294766411
+左四营 11.8212361103
+终老林 13.900677652
+差动 12.2912397395
+治军 9.49395840471
+生物电 10.604840786
+戳戳看 13.900677652
+刘信叔 12.8020653633
+可预见性 11.9547675029
+缩少 13.2075304714
+刑堂 13.900677652
+粗绳 12.2912397395
+砍伐 9.46986085313
+氯化亚铜 13.2075304714
+基层单位 10.3743171274
+马代拉 12.8020653633
+装燃料 13.900677652
+曹吉祥 11.9547675029
+非常明显 8.48457724977
+氯化亚锡 12.8020653633
+香梨 11.5027823792
+张普 13.2075304714
+辩证唯物论 12.8020653633
+纯血马 13.900677652
+稍懈 13.900677652
+汪东兴 12.5143832909
+关涉 10.7226238216
+于建武 12.1089181827
+豪尔赫 13.900677652
+神经功能 11.8212361103
+重放 10.8096351986
+恭候 9.30555780184
+申时 10.0940151622
+钢片 11.9547675029
+外裤 13.2075304714
+短线产品 13.900677652
+枪套 12.2912397395
+测试台 13.900677652
+刘宗吉 12.2912397395
+梅核气 11.8212361103
+渴着 13.900677652
+梁王彭 12.1089181827
+尉欧阳伦 12.8020653633
+撒泼打滚 12.8020653633
+佳人薄命 13.900677652
+膘肥肉厚 13.900677652
+额尔德尼 10.9562386728
+气涌如山 13.900677652
+贺珍 13.900677652
+枪头 10.2117981979
+稻场 12.2912397395
+行政级别 11.1280889297
+重整 8.68574189437
+重数 13.2075304714
+绩差股 11.1926274509
+哈普西 11.4157710022
+条理清楚 11.8212361103
+博园 11.7034530746
+燕下都 10.4041700905
+好卖 10.7226238216
+职业性 10.5684731418
+颠茄 11.1280889297
+阿诗玛 10.9049453784
+丹凤朝阳 12.5143832909
+支撑体系 11.9547675029
+手持式 12.5143832909
+承担者 9.49395840471
+悲苦 10.2117981979
+荷香 12.1089181827
+情绪反应 11.7034530746
+猛烈地 9.38981814546
+李妈妈 11.9547675029
+傅崇碧 13.900677652
+砍些 12.2912397395
+代立 12.2912397395
+关洛 12.5143832909
+大姑子 13.2075304714
+金尼尔 13.2075304714
+技嘉 13.2075304714
+外行 9.62401153296
+俗语说 10.1871055853
+塞夫尔 11.7034530746
+国泰电影院 13.2075304714
+披盖 13.2075304714
+冰袋 12.5143832909
+巨人队 13.900677652
+蒙塔莱 12.2912397395
+组合体 11.598092559
+真没想到 9.40086798165
+三二十个 11.598092559
+外衣 8.73019365694
+罗拉 11.8212361103
+差可 13.900677652
+外表 8.3285236198
+缘因 13.2075304714
+廖角嘴 12.8020653633
+黄权 11.1926274509
+发祥地 9.05649056552
+房前 10.1871055853
+自成体系 10.5684731418
+几十块 10.642581114
+路上行人 11.9547675029
+土地评价 13.2075304714
+鸿鹄 12.1089181827
+傲慢不逊 11.8212361103
+关津 11.0674643079
+麦尔杰 13.900677652
+凯里 10.4349417492
+学术论文 10.2371160058
+卢象 12.8020653633
+周朴园 13.2075304714
+援引 8.52078029844
+配眼镜 13.2075304714
+幼稚教育 12.8020653633
+好句 11.4157710022
+浪潮汹涌 13.900677652
+重旱 12.5143832909
+万摄氏度 11.8212361103
+刑天 12.2912397395
+几十场 12.8020653633
+吴湖帆 12.5143832909
+谷氨酸 10.7226238216
+好受 10.2630914922
+特里舒尔 13.2075304714
+溜个 13.2075304714
+尉迟迥 11.5027823792
+流行病 10.5684731418
+联明 13.900677652
+司马懿谏 13.2075304714
+抽丰 13.2075304714
+巴利奥尔 12.1089181827
+趣话 12.2912397395
+鲁忽乃 13.2075304714
+票证 10.9562386728
+寄放在 13.2075304714
+好友 8.60236028543
+谢王爷 12.8020653633
+穿线 12.8020653633
+治印 11.9547675029
+传真机 11.1280889297
+行为习惯 12.2912397395
+群众利益 10.4666904475
+软文 13.900677652
+阿吉勒 13.900677652
+浪声浪气 13.900677652
+十几支 12.2912397395
+编委 10.3743171274
+涂蜡 13.900677652
+贾母邢 13.900677652
+官征赋 13.2075304714
+云长乃 13.2075304714
+外话 13.900677652
+职司 9.5186510173
+利用网络 11.2616203224
+旱冰 13.2075304714
+曾志伟 11.7034530746
+速去 10.533381822
+宗封 13.900677652
+大邑 11.0674643079
+快活起来 11.9547675029
+王鹏 11.0674643079
+戊辰 11.9547675029
+外语 9.30555780184
+屋乌之爱 13.900677652
+开天窗 11.9547675029
+踢出来 12.8020653633
+夏中星 11.1926274509
+保加利亚 8.69119149913
+北京天安门广场 11.1926274509
+栖息处 12.8020653633
+惹人爱 13.2075304714
+八品 10.642581114
+王思政 13.2075304714
+速变 13.2075304714
+劳动组合 10.8561552143
+大都 6.68396816527
+茅迪 13.2075304714
+八响 13.900677652
+怂恿 8.97342396682
+树梢 9.27570483869
+雷二公 12.5143832909
+曾孙女 13.900677652
+无价宝 13.2075304714
+镇赉 12.5143832909
+大部 7.5393751744
+石湖里 10.8561552143
+适时地 10.533381822
+沧桑 9.40086798165
+锵锵 12.2912397395
+不尽相同 8.5488195185
+卢纶 12.1089181827
+张家山 11.9547675029
+共聚物 10.4994802703
+酣战 11.4157710022
+差值 9.71102290995
+行员 13.2075304714
+栾祁 13.2075304714
+房内 9.40086798165
+外设 11.7034530746
+外访 13.900677652
+三十里 9.07236391467
+靖江县 12.5143832909
+形重错觉 13.900677652
+集合地点 12.8020653633
+印刷业者 13.900677652
+八名 10.6818018271
+饶河县 13.2075304714
+翟魏 12.8020653633
+姑姑家 12.5143832909
+树桩 10.533381822
+向汝才 12.2912397395
+粗粝 11.7034530746
+凸起 9.38981814546
+但力帆 13.900677652
+卓绝 11.1926274509
+乳制品厂 12.2912397395
+乌桓遂 13.2075304714
+公举之 13.2075304714
+荷马史诗 10.4041700905
+信誉至上 13.900677652
+鲁布革 12.8020653633
+凌操 12.5143832909
+大通 7.85330547293
+雷贯耳 13.900677652
+注上 11.598092559
+大逆 10.9562386728
+大同盟 10.7226238216
+几十员 12.8020653633
+补遗 10.2117981979
+温特图 13.2075304714
+编好 11.5027823792
+大选 8.33999602096
+美华人 13.900677652
+粗货 12.8020653633
+乌兰浩特 11.3357282945
+千难万苦 13.2075304714
+饱经霜雪 13.900677652
+树根 9.06439574502
+蔡旭 11.7034530746
+询问 6.94986288353
+窦家庄 13.2075304714
+孤寡 11.3357282945
+粗糖 12.8020653633
+自信力 12.8020653633
+进退 8.71329184614
+狂笑 10.3171587135
+失去活力 12.5143832909
+拼搏精神 12.5143832909
+勒克斯 11.9547675029
+内在联系 9.63799777493
+斗兽 12.5143832909
+粗糙 8.04560572977
+三万五千五百余箱 13.2075304714
+司盐运 12.8020653633
+大道 7.49710345404
+粗糠 12.8020653633
+八周 11.1926274509
+孤寂 9.65218240993
+几十名 9.84023464143
+抓下去 13.900677652
+进逼 9.25628675283
+退而结网 13.2075304714
+格尔尼卡 12.8020653633
+滦南县 13.900677652
+市中区 11.598092559
+精英赛 12.5143832909
+好像 5.61693090487
+孤寒 12.5143832909
+嫔妃 9.61021821083
+就行 8.19356738723
+启奏 8.51618258919
+舰首 11.5027823792
+杰构 12.1089181827
+候补队员 13.2075304714
+捐赠人 13.900677652
+寒鸦戏水 13.900677652
+由圣克 13.900677652
+抗风性 13.900677652
+外端 13.2075304714
+瑞士军刀 12.2912397395
+麦尔斯 12.5143832909
+八喜 12.8020653633
+周通 10.1164880181
+丹麦文 12.5143832909
+席康 13.2075304714
+愁烦 12.2912397395
+案一审 12.5143832909
+体育老师 12.5143832909
+叔伯弟兄 13.2075304714
+延伸线 11.0674643079
+规格书 13.900677652
+速动 12.8020653633
+该唱 13.2075304714
+地转风 11.8212361103
+龙集贞 13.2075304714
+南云忠 13.2075304714
+重望 12.1089181827
+大圣腾 13.2075304714
+重来 10.2630914922
+符字景 13.2075304714
+莫尔兹 12.5143832909
+铃响 10.642581114
+职务 6.76897914151
+刑宽 13.2075304714
+疤瘌 12.1089181827
+氢氟酸 10.3743171274
+尔岗 13.2075304714
+撞天屈 13.2075304714
+联播 12.1089181827
+动物群 9.37888907493
+让路 9.58318953844
+周遭 9.58318953844
+妙理 12.1089181827
+百余间 12.8020653633
+优等生 12.1089181827
+先上来 11.8212361103
+克斯克 13.900677652
+东萨摩亚 11.7034530746
+连枷 13.2075304714
+大金 10.4994802703
+五十道 13.2075304714
+周道 9.94943393339
+治则 11.0674643079
+海水浴场 10.604840786
+施本格 13.2075304714
+总导演 10.3171587135
+沿岸国 12.1089181827
+那黑沙 13.2075304714
+布农族 13.2075304714
+周遍 12.5143832909
+大量 4.94703761484
+农家子弟 11.9547675029
+大里 12.8020653633
+数十册 13.2075304714
+摇席破坐 13.900677652
+进酒 11.598092559
+凌日 12.1089181827
+外突 12.5143832909
+误差率 11.9547675029
+从来未有 12.2912397395
+销销 13.900677652
+贪杯 11.8212361103
+治咳嗽 13.900677652
+虚荣 9.72629038208
+海湾合作委员会 12.2912397395
+让贤 11.5027823792
+吊球 12.5143832909
+注会 13.900677652
+重构 10.0505300503
+楚怀王 10.2371160058
+交响音乐 10.604840786
+德芒戎 12.8020653633
+组分分析 13.900677652
+虮子 11.7034530746
+职前 13.900677652
+独占权 12.1089181827
+宋刊本 11.5027823792
+趁现在 10.533381822
+中曾根康弘 13.2075304714
+来晚 11.1280889297
+达官显贵 11.598092559
+潭边 11.1280889297
+好凶 12.8020653633
+一百五十九卷 13.2075304714
+大酱 12.5143832909
+钢炮 11.598092559
+稳定流 13.2075304714
+数峰 12.5143832909
+迟发性 12.1089181827
+五辈子 13.2075304714
+天铭 13.2075304714
+好几 9.63799777493
+滕胤 12.5143832909
+势焰 13.2075304714
+职分 10.5684731418
+粗通文墨 10.8561552143
+舞美设计 12.5143832909
+隆科多 10.604840786
+兰斯 11.0103058941
+承诺书 11.2616203224
+好准 13.900677652
+周郎 10.2630914922
+八十二首 13.2075304714
+减员 11.0674643079
+政治素质 12.1089181827
+埋头苦干 11.3357282945
+名满天下 11.8212361103
+沥青 8.89673134603
+盈虚 13.900677652
+庚午 12.5143832909
+房基 11.0674643079
+大有人在 10.0505300503
+大难 9.46986085313
+顽儿 12.8020653633
+地走动 11.1280889297
+燕易王 12.2912397395
+祝典 13.900677652
+山环水 11.2616203224
+减去 8.75318317516
+伊莫拉 13.900677652
+野鸽子 12.8020653633
+罪盈恶满 13.900677652
+拦洪 11.8212361103
+科穆宁 11.9547675029
+逼进 10.604840786
+四十多次 13.2075304714
+减压 9.62401153296
+于石城 13.2075304714
+巴尔德斯 12.1089181827
+长寿面 11.9547675029
+洗刷 9.66657114738
+外路 10.533381822
+于太甲 12.8020653633
+吊环 11.3357282945
+伊朗政府 12.1089181827
+企管系 13.900677652
+丹书铁券 12.5143832909
+肛门期 13.900677652
+昂里奥 12.8020653633
+最佳阵容 12.2912397395
+太甲放 12.8020653633
+镰刀状 11.9547675029
+郭家店 11.9547675029
+念法 13.2075304714
+大雾 9.04086524761
+拒不承认 10.9562386728
+漱口杯 13.900677652
+就医 8.95903522937
+居功自恃 13.900677652
+编得 10.9049453784
+减号 12.8020653633
+联控 12.1089181827
+博取 9.12999302751
+联接 7.76945116249
+大雪 7.90671622467
+三千余亩 12.8020653633
+大雨 8.37124856446
+公安机关 7.86999239171
+汝阳县 11.1926274509
+应明廷 12.5143832909
+摄氏温标 12.1089181827
+双鹿 12.2912397395
+汛情 13.900677652
+应急灯 11.7034530746
+博古 10.2630914922
+省内游 13.2075304714
+枪尖 10.5684731418
+子弹壳 12.1089181827
+啤酒店 11.598092559
+大集 10.6818018271
+大雅 10.4349417492
+大雄 12.1089181827
+房型 11.7034530746
+大雁 9.69598503258
+马萨格 12.5143832909
+青藏高原 7.86999239171
+八刀 12.8020653633
+外资 6.84795660274
+八分 9.30555780184
+闭目塞听 12.2912397395
+代天立 13.2075304714
+班尼 12.2912397395
+中国保险监督管理委员会 12.8020653633
+穿破 10.1164880181
+办公时间 13.2075304714
+几十副 13.2075304714
+共有 6.07064956944
+海军上将 9.91169360541
+八列 13.2075304714
+编录 10.9562386728
+类型论 12.8020653633
+海中青 13.2075304714
+恭喜 9.54396882529
+挣脱 8.50251495046
+大阪 9.01787572939
+曾文溪 10.8096351986
+冲动 7.47905538417
+旱地 9.16447920358
+吉田忠雄 12.5143832909
+师杨廷 13.2075304714
+沧源 11.8212361103
+大队 7.15544130249
+超声波 9.17328983326
+尾矿 11.4157710022
+解放军总医院 12.2912397395
+城市化 7.99259471381
+顽军 12.8020653633
+弹子锁 13.2075304714
+秘鲁政府 11.598092559
+贪恋 10.0505300503
+案情 9.23723855786
+人至察则无徒 12.8020653633
+房址 11.1280889297
+银监会 7.21481670491
+权益 6.99793491482
+揩去 9.98865464655
+精通业务 13.900677652
+招待费 11.0674643079
+独占性 12.1089181827
+造船厂 9.31571017331
+奥卡万戈 12.8020653633
+重惩 11.598092559
+房地 10.6818018271
+太玄 11.3357282945
+三千余两 13.2075304714
+大院 8.63798746307
+海滋 12.8020653633
+博南 11.5027823792
+省议员 13.2075304714
+体育用品 10.6818018271
+重情 12.8020653633
+来意 9.11318590919
+减半 8.90346537821
+外账 13.2075304714
+大限 9.85762638414
+外购 10.4666904475
+马分尸 13.2075304714
+猜度 10.765183436
+大陆 6.07144511443
+权相 11.0103058941
+补阙 11.1926274509
+打破纪录 13.900677652
+外贸 7.55679721785
+格里奥 11.9547675029
+晴和 11.1280889297
+宇文泰自 13.2075304714
+大陈 12.8020653633
+努嘴 10.3453295905
+八厂 12.5143832909
+结构件 10.9049453784
+几十口 11.9547675029
+拦水 13.2075304714
+几十句 12.8020653633
+龚兄 12.5143832909
+周阳 12.5143832909
+几十只 11.0674643079
+搭撒 13.2075304714
+几十台 13.900677652
+盛泽镇 11.1280889297
+施莱歇 12.1089181827
+几十号 11.598092559
+谦恭有礼 12.8020653633
+来想 11.4157710022
+梅斯蒂 12.5143832909
+边防 8.4980002701
+特雷纳 13.900677652
+联招 13.900677652
+满湖 11.8212361103
+几十双 12.8020653633
+粗笨 10.9049453784
+古黄河 12.1089181827
+虚肿 12.8020653633
+如山倒 11.8212361103
+工业气体 12.5143832909
+靖南王 12.5143832909
+颗粒饲料 13.2075304714
+哈努卡 13.900677652
+东边儿 13.2075304714
+从来未 12.5143832909
+求名 12.2912397395
+化学药品 10.0940151622
+外貌 9.20019728618
+八发 13.2075304714
+完税价格 13.900677652
+古文化 9.82314020807
+枪崩 11.5027823792
+糜二夫人 12.5143832909
+多二 13.2075304714
+东色雷斯 11.9547675029
+铃木秀男 11.1280889297
+组织纪律性 11.7034530746
+位相 11.7034530746
+大韩 10.765183436
+孤山 10.1630080337
+八口 11.5027823792
+八叠 12.8020653633
+喷水孔 10.604840786
+八句 11.0103058941
+漆封 13.900677652
+八只 10.4994802703
+一丝一毫 9.89334446674
+额定功率 11.3357282945
+有路可走 12.2912397395
+迷魂汤 11.3357282945
+茄克 12.1089181827
+八台 12.2912397395
+八号 11.7034530746
+拾一 13.2075304714
+好坏 8.38322475551
+归根结蒂 11.598092559
+天下第一关 11.9547675029
+周际 13.2075304714
+疫源地 12.1089181827
+捡来 10.533381822
+索子 10.0294766411
+减利 10.2117981979
+雄激素 10.0940151622
+松散层 12.5143832909
+检查一下 10.3171587135
+条纹布 13.900677652
+番石榴 11.3357282945
+应能 10.1871055853
+心虚胆怯 11.598092559
+几十卷 13.900677652
+业余队 13.900677652
+猜忌 9.36807815882
+江口洋介 13.2075304714
+减到 10.4041700905
+铸造出 12.5143832909
+伯内特 12.5143832909
+勇敢者 11.8212361103
+过嘉平 13.2075304714
+博利 12.2912397395
+花生仁 12.1089181827
+贪慕 13.900677652
+子弹头 11.8212361103
+记事簿 12.5143832909
+由李强 12.5143832909
+免税店 11.8212361103
+钢盔 9.96885201925
+瓦德西 10.2371160058
+编年 10.7226238216
+联手 7.6761192227
+抬回去 11.7034530746
+八区 12.5143832909
+八匹 12.1089181827
+国家建委 12.5143832909
+职员 8.64840422393
+黢黑 12.5143832909
+八千 9.91169360541
+猜得 11.8212361103
+八十 9.53122979951
+外调 10.6818018271
+联户 12.8020653633
+钢皮 13.2075304714
+张挂起来 13.2075304714
+吊牌 11.9547675029
+裂成 10.7226238216
+大面 11.598092559
+几十匹 11.1926274509
+金丝绒 12.5143832909
+稍感 10.9562386728
+大革 11.9547675029
+霸权主义 10.1394775363
+赫梯语 12.5143832909
+大青 10.4349417492
+关楼 12.1089181827
+职后 12.8020653633
+张家寨 9.48183704418
+联成 10.4041700905
+西孟加拉邦 11.7034530746
+八卷 10.4349417492
+无可讳言 13.900677652
+妙悟 13.900677652
+提心吊胆 9.20932976975
+原丹徒 13.2075304714
+字帖 10.7226238216
+太高明 12.2912397395
+加害人 12.1089181827
+胡里胡涂 12.8020653633
+大钱 9.5062284973
+芜湖市 10.9562386728
+于永波 13.900677652
+立足点 10.0940151622
+雅美族 12.5143832909
+外运 9.38981814546
+穿窬 13.900677652
+原太平 13.900677652
+还用说 11.2616203224
+好听 8.66956903512
+中立国 10.2630914922
+孤弱 11.4157710022
+性情平和 13.900677652
+趣谈 12.8020653633
+大钟 10.3171587135
+一百二十多件 13.2075304714
+周锐 12.8020653633
+冀鲁豫 10.6818018271
+补铁 12.2912397395
+假门假事 13.900677652
+周锋 12.5143832909
+石料厂 13.2075304714
+好吃 8.0985592766
+好名 11.2616203224
+东安门 11.1280889297
+言之不尽 13.900677652
+两千八百万元 13.2075304714
+包装用 11.9547675029
+舒筋活血 11.2616203224
+济济一堂 12.8020653633
+杜丽丽 10.8561552143
+周长 8.89004235788
+重扣 12.2912397395
+于建水 13.2075304714
+来接 9.04864738806
+宋州谷 13.2075304714
+真菌类 12.5143832909
+辐射体 12.5143832909
+全盘西化 13.2075304714
+赵长平 12.1089181827
+奈曼旗 11.9547675029
+阵内 10.8561552143
+目击者 9.49395840471
+郑少师 13.2075304714
+进针 11.5027823792
+刑庭 13.900677652
+篇籍 13.900677652
+孤影 12.2912397395
+扬马延 13.2075304714
+前段 10.0505300503
+教导处 13.900677652
+后知后觉 11.8212361103
+没过 9.43476953332
+燃油泵 12.8020653633
+镇西 10.0088573539
+一显身手 11.598092559
+粗硬 10.642581114
+百幅 12.2912397395
+封宜侯 13.2075304714
+吴南轩 13.2075304714
+邻居们 10.0088573539
+补钙 10.9562386728
+英汉词典 12.8020653633
+重打 12.1089181827
+外边 6.99693039439
+时小福 13.2075304714
+冰轮 10.4994802703
+重托 10.9562386728
+有线网 13.900677652
+干嚼 13.900677652
+重报 12.2912397395
+黄菊香 13.2075304714
+程仪 11.7034530746
+费里尼 11.4157710022
+漠然置之 13.2075304714
+八倍 11.598092559
+红樱枪 12.5143832909
+东邻西舍 13.2075304714
+泥牛 13.900677652
+涵蓄 12.8020653633
+奥林匹斯 12.2912397395
+多圈 12.5143832909
+前殿 9.74179456862
+李乾顺 13.2075304714
+江醉章 8.32094782599
+运用自如 11.3357282945
+重抄 12.8020653633
+凶残成性 13.900677652
+无容身之地 12.8020653633
+发射臂 13.900677652
+三十门 13.900677652
+洛威尔 12.1089181827
+外转 12.5143832909
+外轮 10.642581114
+穹隆 11.2616203224
+树汁 11.9547675029
+定造 12.8020653633
+肇源县 12.5143832909
+铃儿 11.598092559
+南支锋 12.5143832909
+间断性 12.1089181827
+揩净 11.598092559
+试金石 10.5684731418
+史可查 13.2075304714
+东北局 11.9547675029
+一屏 13.900677652
+郭家屯 12.8020653633
+格雷罗州 13.900677652
+郭存先 12.1089181827
+空大 13.2075304714
+穿空 12.8020653633
+博克 11.2616203224
+汗王 13.900677652
+恭城 11.8212361103
+物色到 11.598092559
+孤忠 12.1089181827
+萨卡特卡斯 13.2075304714
+青旗 11.0674643079
+技巧性 11.1280889297
+护卫兵 13.900677652
+反戈相向 13.2075304714
+营养缺乏症 12.5143832909
+重拳 10.5684731418
+一百二十多万 12.8020653633
+重拾 9.08039608637
+大鑫 11.7034530746
+租用费 13.900677652
+重担 9.66657114738
+减免 8.40350942668
+重拍 11.9547675029
+几十倍 9.94943393339
+穷则变 12.8020653633
+嘟嚷 11.7034530746
+好哇 9.07236391467
+技术鉴定 10.9049453784
+凯雷 10.642581114
+省料 12.8020653633
+歇班 12.8020653633
+铃兰 11.2616203224
+五氯化磷 12.5143832909
+志在千里 12.1089181827
+黄祖必 13.2075304714
+重振 9.38981814546
+三分球 12.2912397395
+望风披靡 12.2912397395
+联想 7.70016847793
+重挫 8.31342899358
+雕成 10.2117981979
+票贩 13.2075304714
+王安中 11.598092559
+东寨港 11.3357282945
+血糖高 11.3357282945
+几十出 13.2075304714
+页码 11.4157710022
+上车时 11.7034530746
+通知书 9.04086524761
+一隅之见 12.8020653633
+达美康 13.900677652
+玄德亦 11.9547675029
+子公司 6.86014126176
+司右军 12.8020653633
+资本货物 12.1089181827
+新影联 13.2075304714
+鸢尾花 12.5143832909
+进门 7.59075937375
+不眠之夜 11.0103058941
+升华热 12.8020653633
+原发性 9.0884932966
+速回 10.3453295905
+树液 11.4157710022
+破甑不顾 13.900677652
+枪弹 8.77671367257
+发电站 9.98865464655
+泄洪闸 11.7034530746
+惹人眼 13.2075304714
+大闹 9.32596667347
+大闸 13.2075304714
+钢琴 8.25523075433
+相邦子 12.8020653633
+老人河 12.5143832909
+八中全会 11.5027823792
+沧浪 10.7226238216
+大门 6.63594747405
+刑徒 9.71102290995
+百余里 11.0674643079
+菠萝蜜 11.5027823792
+心冷 12.8020653633
+照本宣科 11.598092559
+权臣 9.20932976975
+大鹏鸟 11.7034530746
+枪式 13.900677652
+孤高 11.3357282945
+抽抽噎噎 11.4157710022
+第九号 13.2075304714
+程伟 11.9547675029
+重接 12.8020653633
+沈福文 12.8020653633
+树海 13.2075304714
+毫不妥协 12.2912397395
+嗜酒如命 11.5027823792
+交上去 11.8212361103
+气手枪 13.2075304714
+心凉 11.2616203224
+治国 8.64318227995
+瘦长 10.0088573539
+植物油 9.36807815882
+大锦 13.2075304714
+钢瓶 11.8212361103
+减值 9.11318590919
+大锣 11.3357282945
+戴维斯杯 11.9547675029
+顽劣 11.7034530746
+几十具 12.5143832909
+出资方 11.8212361103
+水平衡 12.2912397395
+可再生 11.1280889297
+自命不凡 11.4157710022
+煤气工厂 13.900677652
+赵长征 10.3453295905
+几十元 10.4666904475
+华觉明 13.900677652
+周钟 10.2897597393
+好喝 10.3453295905
+谈判代表 9.71102290995
+东苏丹 12.1089181827
+大错 10.0294766411
+原厂 11.5027823792
+桑地诺 11.5027823792
+勇气十足 13.2075304714
+大锅 9.72629038208
+斗志昂扬 11.2616203224
+邹荻帆 12.8020653633
+重排 10.2117981979
+正确引导 11.5027823792
+泰晤士 12.2912397395
+解缰牵 13.2075304714
+不能不 7.22611626016
+周铸 13.2075304714
+心净 11.2616203224
+香港贸易发展局 13.900677652
+田忌赛马 13.900677652
+室温 8.99540287354
+援外 11.598092559
+知过必改 12.5143832909
+黎拔力 10.5684731418
+萨拉托夫 11.1926274509
+伦常名 13.900677652
+叙叙旧 12.1089181827
+进销 10.4041700905
+当老板 10.9049453784
+黄祖引 13.900677652
+铸造厂 12.8020653633
+查获 10.0940151622
+迪沃斯 13.900677652
+南城县 12.8020653633
+笔力 10.4349417492
+关死 10.8561552143
+补锌 12.5143832909
+恩仇录 13.900677652
+八八 12.1089181827
+约翰森 13.2075304714
+门罗主义 11.7034530746
+八关 13.2075304714
+夜雾 11.1280889297
+迭起 10.0294766411
+吊灯 10.642581114
+辐射仪 11.598092559
+五十铃 12.5143832909
+汗不敢出 13.900677652
+孝义县 13.900677652
+民众代表 13.900677652
+屈子祠 13.2075304714
+十之八九 10.0294766411
+免税区 12.5143832909
+东山岭 13.900677652
+八床 13.900677652
+重氮 12.1089181827
+治好 9.53122979951
+重水 10.642581114
+西侯度 11.4157710022
+页眉 13.900677652
+解放村 13.2075304714
+博得 8.88339781516
+梗阻性 11.9547675029
+法律事务 11.5027823792
+狂燥 13.900677652
+八座 11.2616203224
+八度 9.75754292558
+细枝 11.1280889297
+一盒盒 12.8020653633
+瘦高 10.642581114
+常时 11.1280889297
+元文 12.5143832909
+截击 9.55687223012
+减征 10.604840786
+钢筋 8.85082164473
+四氟乙烯 11.0674643079
+弱水三千 12.2912397395
+刘茂恩 12.5143832909
+大骂 8.62256299275
+钢筒 13.900677652
+编号 8.09554268306
+减得 12.2912397395
+王廷相 11.5027823792
+博德 11.8212361103
+钢筘 13.900677652
+金丝猴 9.23723855786
+三黄鸡 11.7034530746
+房宿 12.1089181827
+西单商场 10.7226238216
+议论英发 13.2075304714
+几十度 12.5143832909
+几十座 11.598092559
+不称职 9.94943393339
+桓叔之 12.8020653633
+别后 10.4041700905
+蜚声国际 11.9547675029
+舍侄 12.2912397395
+重汽 10.4041700905
+房室 10.1164880181
+外膜 11.1926274509
+房客 10.4041700905
+穹顶 10.533381822
+突然性 10.1630080337
+猜到 9.13850371718
+蒙毅兄弟 13.2075304714
+治多 13.900677652
+公孙寿 13.900677652
+敬授民时 13.900677652
+王瑞芳 13.2075304714
+柿蒂 13.2075304714
+钢笔 9.49395840471
+巴布柯 13.2075304714
+查谟 11.1926274509
+红泥巴 13.900677652
+拍拍手 11.0103058941
+休闲游 13.2075304714
+人民美术出版社 12.2912397395
+何异 10.9562386728
+英国外交部 12.5143832909
+拖长 10.6818018271
+博弈 7.52395070408
+亘古未有 12.2912397395
+辔头 10.533381822
+四十斤 11.7034530746
+时尚饰品 12.8020653633
+博异 13.2075304714
+长林哥 11.598092559
+速复 13.900677652
+定情之物 12.2912397395
+几十年 7.09163834593
+户长 11.7034530746
+博引 13.2075304714
+宽怀 11.2616203224
+瘦马 11.2616203224
+贪污 8.65365357982
+减弱 7.16015829237
+上甲科 13.900677652
+放赈 9.33632946051
+东碰西撞 13.2075304714
+辩护人 10.4349417492
+卡梅尔 12.8020653633
+进驻 8.0285598625
+国公府 12.1089181827
+八席 11.9547675029
+大胡子 9.66657114738
+编印 10.5684731418
+百里酚蓝 13.2075304714
+孤军 9.75754292558
+凤凰衣 13.900677652
+汪德臣 11.9547675029
+大鹏金 13.900677652
+贪求 11.9547675029
+暖空气 13.2075304714
+职大 13.900677652
+钢管 9.04086524761
+实打实 10.3453295905
+折文书 12.8020653633
+大驾 10.2897597393
+江苏省人民政府 12.1089181827
+税收法律 11.598092559
+酣梦 12.1089181827
+外脑 11.8212361103
+葛志毅 12.8020653633
+钢箱 13.2075304714
+杨永裕 13.2075304714
+粗盐 11.8212361103
+鸿毛 13.2075304714
+大马 10.0940151622
+挣起 12.8020653633
+媒体化 13.900677652
+全始全终 12.5143832909
+八幡 12.1089181827
+音乐欣赏 13.2075304714
+博彩 9.87532596124
+肉搏战 11.4157710022
+贾政亦 12.8020653633
+滋补药品 13.2075304714
+国有企业 7.64877376881
+不重 9.48183704418
+旱季 9.87532596124
+柏子仁 11.7034530746
+凌源 11.1280889297
+八年 7.18166449759
+生物素 12.1089181827
+随高就低 13.900677652
+迟到者 12.1089181827
+另有其 11.598092559
+黎语 11.9547675029
+神珍铁 12.8020653633
+重选 12.2912397395
+钱金福 12.8020653633
+狂烈 12.2912397395
+外胎 12.1089181827
+并肩而行 11.7034530746
+阮大铖 7.92941581219
+言极 9.94943393339
+法国梧桐 11.598092559
+查起 12.5143832909
+关文 9.85762638414
+铁路工人 10.4994802703
+重活 11.0674643079
+扬铃打鼓 13.900677652
+吊线 12.5143832909
+生物系 10.8561552143
+汉军内 13.2075304714
+技术实力 10.4666904475
+苘麻 11.5027823792
+狂热 8.17382990439
+伺服系统 11.0674643079
+肽键 11.8212361103
+卡尔梅克 12.1089181827
+专门调查 12.1089181827
+北京农业大学 11.5027823792
+关断 11.5027823792
+稍息 11.7034530746
+鸿雁 10.4994802703
+慎用 9.31571017331
+雪里送炭 13.2075304714
+贺表 10.9562386728
+随机存取 12.1089181827
+汉桓帝 11.7034530746
+矍铄 11.0103058941
+博康加 12.1089181827
+查账 10.765183436
+中老年人 10.0720362555
+解放军总政治部 11.8212361103
+好学 9.24671730182
+千片 13.900677652
+纵令 11.598092559
+庚帖 11.1926274509
+国九条 12.2912397395
+立诸吕 13.2075304714
+产品线 9.32596667347
+好字 11.2616203224
+考察报告 11.0103058941
+国体 10.2117981979
+塞内加尔 9.56994431169
+井伊直 13.2075304714
+植物所 10.9049453784
+原生孔隙 13.900677652
+兰溪市 12.2912397395
+集成电路 8.57280148319
+救火 9.71102290995
+产品约 12.5143832909
+编剧奖 11.8212361103
+啤酒厂 11.2616203224
+罗布林卡 11.9547675029
+广南县 12.8020653633
+无异于 9.15574552361
+教导团 11.598092559
+大屈辱 12.5143832909
+刑具 10.0720362555
+枪击 10.1164880181
+于众议 12.8020653633
+刑典 12.2912397395
+技师 9.82314020807
+张治中 10.4994802703
+八式 13.900677652
+穿甲 9.89334446674
+抽上去 13.2075304714
+吴传钧 13.2075304714
+梅西昂 12.8020653633
+坐不起 13.2075304714
+稳定期 12.1089181827
+穿用 10.2630914922
+外聘 12.2912397395
+孤傲 11.1280889297
+冰肌 12.1089181827
+大曲 9.87532596124
+无事忙 12.2912397395
+编剧 8.58747167293
+衣烂衫 13.900677652
+记好 13.900677652
+好官 12.1089181827
+衡广 12.5143832909
+惊恐不安 11.4157710022
+八强 12.1089181827
+动物界 9.5186510173
+周杰 13.900677652
+几十张 11.3357282945
+色蕴 13.900677652
+四五千两 13.900677652
+佟湘玉 13.900677652
+妙用 10.533381822
+刘季玉 11.9547675029
+稳定杆 11.3357282945
+枪决 10.7226238216
+差官 10.533381822
+俾斯麦群岛 11.8212361103
+孤僻 10.4994802703
+编列 12.2912397395
+出师表 11.1280889297
+小勃律 11.9547675029
+编创 11.9547675029
+颖果 10.9049453784
+元万顷 13.2075304714
+披红 11.5027823792
+减幅 10.1164880181
+编到 12.2912397395
+陆奥宗 10.4994802703
+外耳 11.1280889297
+粗石 13.900677652
+编制 6.92994757383
+蚍蜉撼树 12.1089181827
+来气 11.9547675029
+月工 12.5143832909
+苑里 10.5684731418
+恶性事件 11.598092559
+民主联盟 9.91169360541
+八岁 9.53122979951
+多交 11.7034530746
+宗子 10.765183436
+进食 8.35160156708
+建置 9.21854642485
+顽强 8.0746775446
+普加乔夫 11.598092559
+空自怜 13.900677652
+治学 9.77354326693
+鸿门 11.9547675029
+贾巧姐 13.2075304714
+小狮子 8.33999602096
+太和城 11.7034530746
+山填海 10.7226238216
+重游 11.598092559
+商王派 12.8020653633
+成双作对 13.900677652
+大颗 11.4157710022
+米沙鄢 12.1089181827
+马迎 13.2075304714
+冰茶 13.900677652
+沿革地理 12.1089181827
+基础医学 11.7034530746
+特别强调 8.96620371885
+大额 8.65365357982
+王母宫 13.900677652
+大颚 11.5027823792
+大题 13.2075304714
+六大块 13.900677652
+一怒之下 10.0940151622
+编出 10.3453295905
+凌汛 11.9547675029
+成人之美 11.9547675029
+西南航空 11.7034530746
+裕固族自治县 13.900677652
+枪刺 9.77354326693
+缺乏性 11.5027823792
+任东平 12.8020653633
+十代 10.9049453784
+榫槽机 13.2075304714
+刑务 13.900677652
+博川 11.8212361103
+五十四五 13.2075304714
+悲观 7.84623830571
+编写 7.98447558937
+快得多 10.0294766411
+操作步骤 12.1089181827
+邯郸 8.62767809341
+位移 8.75318317516
+英尼斯 12.8020653633
+凯马 13.900677652
+技巧 7.38300637906
+诸降羌 13.2075304714
+怀璧其罪 12.5143832909
+大食 9.58318953844
+普斯 11.2616203224
+悖谬 12.1089181827
+却引兵 12.1089181827
+专程去 12.2912397395
+公证机关 11.1280889297
+补题 13.900677652
+拖靶 12.8020653633
+替代选择 12.8020653633
+孤单 9.09665660724
+粗鲁无礼 13.2075304714
+职官 9.26594866375
+窦宪兄弟 13.2075304714
+邓世昌 10.5684731418
+来潮 10.3743171274
+凌波 12.1089181827
+流星花园 12.2912397395
+肯回去 12.8020653633
+丽都 13.2075304714
+荣禄全 13.900677652
+此时此地 10.0940151622
+房奴 9.91169360541
+八小 13.2075304714
+金融类 9.25628675283
+热心快肠 12.8020653633
+低钠血症 11.7034530746
+公孙夏 13.2075304714
+十字路口 9.19114745066
+快板书 12.1089181827
+电气控制 11.5027823792
+压电式 13.900677652
+几十层 13.2075304714
+编入 8.7245279194
+先载 13.900677652
+钢种 11.5027823792
+约翰斯 11.1280889297
+冰莹 13.2075304714
+派车去 12.5143832909
+换脑筋 13.900677652
+房契 12.1089181827
+特豪斯 13.900677652
+上下水 11.598092559
+欢乐 7.92941581219
+联测 11.9547675029
+整体性 9.35738286971
+旱天 12.2912397395
+八尺 9.84023464143
+八尾 13.2075304714
+吊索 12.8020653633
+八层 11.4157710022
+八局 12.1089181827
+治家 10.7226238216
+稠粥 12.5143832909
+八届 9.65218240993
+洋女婿 13.900677652
+不醒 10.0294766411
+独断独行 12.8020653633
+大项 11.1280889297
+历历可数 12.2912397395
+一高一低 11.598092559
+凌河 13.2075304714
+安肃道 13.2075304714
+树怨 13.900677652
+几十尺 13.2075304714
+控制者 11.5027823792
+金丝燕 10.3171587135
+荆钗布裙 13.900677652
+贺词 12.5143832909
+栲胶 9.89334446674
+中信银行 8.0484751722
+轻车熟路 11.3357282945
+五十四个 13.900677652
+阳极泥 11.7034530746
+李家姐妹 13.2075304714
+榜上有名 10.2371160058
+因而是 9.31571017331
+分权 9.94943393339
+张扬出去 11.1280889297
+联洋 13.900677652
+治安 8.26946587015
+搽脂抹粉 13.2075304714
+护路队 11.7034530746
+好头 10.4041700905
+钢硬 13.900677652
+刑司 12.2912397395
+古往今来 10.0505300503
+关林 10.5684731418
+光学家 12.8020653633
+植物性 9.6811699468
+金蝉 11.9547675029
+好大 9.37888907493
+子弹型 13.900677652
+起搏器 12.1089181827
+工部局 10.8561552143
+道工序 10.8561552143
+发神经病 12.1089181827
+拦截 8.39128931535
+页理 13.900677652
+好天 13.2075304714
+冰舌 10.7226238216
+索科特 12.8020653633
+树懒 11.1926274509
+次级 8.9308643524
+国际原油 9.58318953844
+稽留 11.598092559
+扎卡里 13.2075304714
+好多 7.45813748551
+贪多嚼不烂 12.5143832909
+重演 8.6966709649
+万恶之源 12.1089181827
+狂狷 12.5143832909
+焦磷酸 11.9547675029
+杂文家 13.2075304714
+上皮附着 13.900677652
+宋宝元 13.2075304714
+三十顷 11.8212361103
+教导员 10.7226238216
+周顺 11.598092559
+百周年 12.8020653633
+五十顷 12.2912397395
+日常行为 13.2075304714
+互相帮助 11.4157710022
+阴极铜 13.2075304714
+进香 10.2371160058
+龚开 12.5143832909
+旧梦重温 12.2912397395
+科洛尼亚 13.2075304714
+上调 6.50987913024
+武汉理工大学 13.2075304714
+叶和真 13.2075304714
+就业人数 9.16447920358
+免刑 12.5143832909
+肇州县 13.2075304714
+粗略 8.61241062128
+尖声喊叫 13.900677652
+彭元瑞 12.2912397395
+狂犬 11.598092559
+松寿兰 13.2075304714
+题材股 7.72897705456
+大春 12.5143832909
+周旋 8.59240995457
+好奇 7.78921031247
+草决明 12.8020653633
+吴大澄 13.900677652
+电子元件 10.2117981979
+宣武区 11.4157710022
+佞臣 11.1926274509
+来源 5.22665166653
+地理环境 8.44963919841
+香菌 11.8212361103
+几线 13.2075304714
+明辛街 12.5143832909
+粗疏 10.8096351986
+空幻 12.2912397395
+存取 9.62401153296
+李义表 13.2075304714
+逗逗 12.1089181827
+关有 12.5143832909
+羽书 13.900677652
+博尔 10.8096351986
+因特网 11.9547675029
+帕塔塞 13.900677652
+枪口 8.84443184663
+减小 7.75220935606
+关机 9.82314020807
+吉鸿昌 10.8096351986
+位码 13.2075304714
+外激素 11.1280889297
+大餐 9.93038573842
+银行利率 11.0674643079
+猜出 10.0505300503
+光杆司令 12.2912397395
+百余户 11.8212361103
+博尼 13.2075304714
+柳浪闻 12.8020653633
+孤力 11.598092559
+户限 13.900677652
+周颂 11.8212361103
+芜湖县 12.1089181827
+软水 11.598092559
+减少 5.2309350621
+分来 11.8212361103
+畅行 12.5143832909
+进餐 10.1871055853
+巫舞 12.1089181827
+外舅 12.8020653633
+星际飞行 12.1089181827
+大饼 11.0103058941
+体育产业 12.1089181827
+信息管理 10.765183436
+马利筋 12.5143832909
+马萨林 13.2075304714
+花荣见 12.2912397395
+盛泽归 12.5143832909
+永清县 11.8212361103
+三十颗 13.2075304714
+肉中刺 11.598092559
+弗朗索瓦 11.1280889297
+十两 9.14708746087
+松紧度 11.0103058941
+丑相 13.2075304714
+专程到 11.0103058941
+紧贴在 10.2630914922
+外航 11.9547675029
+电讯社 12.5143832909
+易燃易爆 11.3357282945
+通路子 13.900677652
+大星 12.1089181827
+白果 10.2117981979
+贤首 12.8020653633
+临汾地区 12.8020653633
+博山 11.3357282945
+郑东新 9.03314320152
+穿着 6.75706004927
+养亲 12.8020653633
+职工 7.15309112515
+山蝎子 10.604840786
+查表 12.2912397395
+穿点 12.5143832909
+室早 13.900677652
+查补 12.5143832909
+养人 10.9049453784
+浙江省博物馆 12.8020653633
+二百五十 11.2616203224
+大麻 9.74179456862
+有期徒刑 8.46259834305
+大麦 8.56795885871
+插补器 13.2075304714
+好带 12.5143832909
+采访部 12.2912397395
+冤大头 11.2616203224
+仿画 13.2075304714
+有线电 11.5027823792
+庚子 11.1926274509
+隔山 12.2912397395
+装饰画 11.598092559
+工业用品 13.900677652
+金丝边 11.7034530746
+多国公司 13.2075304714
+自不必说 10.2897597393
+外藩 11.1280889297
+查血 13.900677652
+博客 8.42421410004
+小五义 12.8020653633
+畅达 10.9562386728
+周鼎 13.2075304714
+统治者 7.06549306583
+颜文梁 12.2912397395
+萧何功 12.8020653633
+丁二烯 10.1630080337
+十公里 11.8212361103
+梁王刘 13.2075304714
+李冰之 13.2075304714
+特困生 13.900677652
+竟于 12.5143832909
+攘攘 11.5027823792
+博察 12.8020653633
+软毛 12.1089181827
+王臣磐 12.8020653633
+大明 7.5871296057
+小德子 9.30555780184
+蓝色盲 13.900677652
+钢缆 12.2912397395
+通人 12.5143832909
+大黑 9.53122979951
+成百上千 10.533381822
+当事国 10.8561552143
+弹道飞弹 13.2075304714
+周齐 12.1089181827
+达朗伯 13.2075304714
+博导 12.2912397395
+吊篮 10.765183436
+大黄 9.35738286971
+栖息地 10.0505300503
+斯捷潘 12.1089181827
+援助 7.27528528397
+蒜皮 12.8020653633
+金宇车 12.5143832909
+学者型 13.900677652
+编址 13.2075304714
+滕达 13.900677652
+楚令尹 12.2912397395
+无心插柳 12.2912397395
+宗密 12.2912397395
+大鸿 11.0674643079
+庚寅 12.2912397395
+黑瘦 10.3171587135
+突然转向 11.7034530746
+舰队 7.52395070408
+谢夷吾 13.2075304714
+中国人民对外友好协会 12.2912397395
+人性尊严 13.900677652
+令人欣慰 11.2616203224
+精饲料 11.2616203224
+李全生 13.900677652
+关怀 8.60236028543
+乌克兰语 12.1089181827
+大鸨 11.0103058941
+为人师表 11.9547675029
+特委会 13.900677652
+信产部 13.2075304714
+大鸟 9.58318953844
+东倒西歪 9.77354326693
+陕西路 11.2616203224
+道义 9.7898037878
+单向性 12.8020653633
+粗犷 9.11318590919
+枪响 9.41204128224
+左光禄 12.2912397395
+能源技术 9.93038573842
+天下奇闻 13.900677652
+堵阿 11.8212361103
+大鹰 11.598092559
+闷声闷气 12.1089181827
+快得很 13.900677652
+位置 5.67463922249
+许多节 13.2075304714
+工程验收 12.5143832909
+侍御史 10.1394775363
+文牍主义 12.8020653633
+仲雍奔 12.8020653633
+拔罐子 13.900677652
+材质 8.74738605748
+狂生 11.2616203224
+联欢 11.598092559
+正确态度 12.5143832909
+媚笑 11.5027823792
+竟为 11.4157710022
+中央全会 11.1280889297
+编在 10.9562386728
+博学 9.09665660724
+库苏泊 13.2075304714
+房式 13.900677652
+尼古丁 10.9049453784
+长条形 10.0940151622
+锯齿形 10.9562386728
+大鹏 10.0505300503
+斯艾利斯 13.900677652
+罗纳尔多 11.8212361103
+二十余艘 13.2075304714
+治山 11.7034530746
+玻璃丝袜 13.2075304714
+龙潭虎穴 11.3357282945
+周鸿 13.2075304714
+小白桦 12.8020653633
+特尔恩 13.900677652
+房延 13.2075304714
+户部 7.62215622781
+预防犯罪 11.9547675029
+丽靡 13.900677652
+古文字 9.84023464143
+连日来 9.40086798165
+国向武 12.8020653633
+几十对 12.5143832909
+位线 12.8020653633
+凯宾斯基 11.8212361103
+八宝 9.75754292558
+马尔萨斯 10.0940151622
+谁知 6.96433491614
+卢肃 13.2075304714
+文武百官 8.78868986362
+亲亲热热 10.3171587135
+愁绪 10.8561552143
+大龙 9.22784881751
+羊腿 11.9547675029
+差役 9.08039608637
+大龄 11.598092559
+八家 9.96885201925
+领花 13.2075304714
+悬心吊胆 13.2075304714
+八宿 13.900677652
+空调机 12.2912397395
+刘曜闻 13.2075304714
+码率 12.2912397395
+鲁朵之 12.8020653633
+对外关系部 13.900677652
+子午面 11.7034530746
+差异 6.516688194
+有兵勇 12.5143832909
+化学战争 13.900677652
+侮辱性 11.598092559
+几十家 10.1164880181
+心劲 11.3357282945
+外蒙 11.7034530746
+发给你 12.2912397395
+氏谱 13.900677652
+非主流 10.4349417492
+苔丝 11.9547675029
+南去北来 13.900677652
+树林 7.97375162601
+武汉站 13.2075304714
+树枝 8.01457362053
+生物碱 9.20932976975
+凝血酶 12.8020653633
+廖叔 12.5143832909
+周鹏 12.2912397395
+厂长室 13.2075304714
+其三 8.2985588311
+山西汾酒 10.4666904475
+九流 12.1089181827
+念旧 11.0103058941
+八寸 11.1280889297
+代赭石 13.900677652
+百余所 13.900677652
+输变电 10.4349417492
+粗率 12.1089181827
+黎轩 12.2912397395
+应名儿 13.900677652
+难治病 13.900677652
+莫尔德 13.900677652
+半空中 8.84443184663
+让茶 11.3357282945
+戒严 9.59661255877
+二维地震 13.900677652
+大鼠 11.598092559
+速将 11.3357282945
+一分之差 13.900677652
+曾经沧海 11.7034530746
+阴神 12.2912397395
+水分调节 13.2075304714
+好得 10.2897597393
+聚居点 13.900677652
+大鼓 9.54396882529
+紧急停车 12.5143832909
+救人一命 11.1280889297
+脱羧酶 12.8020653633
+倒不开 13.900677652
+搭车去 13.900677652
+穿行 8.61241062128
+树杈 9.94943393339
+史张孝 13.900677652
+补齐 10.765183436
+锻打 11.2616203224
+蒋张桂 13.900677652
+竟会 8.73589167805
+有纬宇 13.2075304714
+大齿 12.8020653633
+政治流氓 13.2075304714
+来校 12.2912397395
+冰蓝 13.2075304714
+产品税 11.8212361103
+八字 8.83808261895
+周勃之 12.8020653633
+树木 7.46773755924
+来样 13.900677652
+好快 11.3357282945
+差得 10.5684731418
+得之不易 11.4157710022
+解放报 13.2075304714
+表现主义 9.65218240993
+旱年 11.7034530746
+袁国林 13.900677652
+翁归靡 12.5143832909
+百处 11.9547675029
+听人摆布 13.900677652
+捡漏 13.2075304714
+龙潭虎窟 13.2075304714
+死劲儿 13.2075304714
+好心 8.70218062071
+捱苦 13.900677652
+悖论 9.55687223012
+房市 9.0884932966
+转弯抹角 11.0103058941
+死心踏地 12.8020653633
+二产 13.2075304714
+大鲵 9.75754292558
+更灵 13.900677652
+哀哀切切 13.900677652
+史湘云笑 12.5143832909
+周敦颐 10.9562386728
+延伸率 12.2912397395
+泽侯田 11.8212361103
+高硫煤 13.900677652
+二亩 10.2897597393
+乙二醇 9.94943393339
+阿里亚娜 13.900677652
+消防系统 12.8020653633
+一百五十九座 13.2075304714
+二亿 11.9547675029
+二人 6.32099882889
+雍乾 13.2075304714
+房州 11.0674643079
+跟上来 9.93038573842
+梅塞塔 12.2912397395
+关押 8.83808261895
+库仓 13.900677652
+库仑 9.66657114738
+申请回避 12.5143832909
+斯基克达 12.5143832909
+职志 12.5143832909
+二五 11.1926274509
+蒜瓣 11.1926274509
+库什 9.87532596124
+查照 12.5143832909
+二十余载 13.2075304714
+延安市 11.7034530746
+二代 8.88339781516
+钢索 10.642581114
+交流电力 12.8020653633
+条理清晰 11.5027823792
+奴隶劳动 10.7226238216
+兵器 7.36543638096
+二件 11.9547675029
+二价 10.6818018271
+金百蝶 13.2075304714
+缴验 13.900677652
+李谷一 13.2075304714
+行脚 12.5143832909
+发交 11.7034530746
+元良 11.5027823792
+二份 13.2075304714
+二任 13.900677652
+口子 8.44535653662
+篾丝 11.5027823792
+敦敦实实 13.2075304714
+太和县 11.7034530746
+骚货 11.1926274509
+陈茶 12.5143832909
+念曰 13.900677652
+河池地区 11.4157710022
+孤坟 12.2912397395
+八声 12.8020653633
+阴雨天 11.598092559
+情报系统 11.1280889297
+北镇县 12.2912397395
+徐鸿儒 10.9562386728
+孤坐 13.900677652
+二仙 11.2616203224
+二两 9.36807815882
+慎独 11.3357282945
+永登县 12.8020653633
+麦斯道 13.900677652
+精神性 10.8561552143
+来此 8.62767809341
+软椅 12.2912397395
+二中 10.4349417492
+二个 9.25628675283
+调整机制 11.1926274509
+博多 11.5027823792
+晨雾 10.533381822
+索索 10.2897597393
+戴天履地 13.900677652
+伏路军 11.7034530746
+何幸 12.2912397395
+二万 9.37888907493
+敢作敢当 12.1089181827
+二七 8.83177344976
+二一 13.2075304714
+博夫 12.5143832909
+全过程 8.7245279194
+博大 9.72629038208
+注册手续 12.5143832909
+二下 11.9547675029
+二丈 10.4041700905
+小马路 12.8020653633
+二世 7.87481167815
+贺辞 12.2912397395
+沿海港口 10.0720362555
+重檐 9.98865464655
+八堵 12.5143832909
+鞍马之劳 13.900677652
+通风设备 10.642581114
+余度 13.900677652
+科目表 13.900677652
+赶趟儿 13.900677652
+涡轮喷气 10.765183436
+决赛权 13.2075304714
+光说不练 12.5143832909
+想了又想 11.0103058941
+劳动报酬 9.87532596124
+大鱼 8.78868986362
+混球儿 12.8020653633
+从来没 8.4284069783
+出师不利 11.0103058941
+赫尔辛基 10.4041700905
+油炸物 13.900677652
+往前走 8.08654712015
+博奕 13.2075304714
+舒瓦瑟尔 13.900677652
+程式化 10.4994802703
+孤城 9.54396882529
+卡默林 12.8020653633
+抽象主义 11.4157710022
+口蜜腹剑 12.2912397395
+天士力 10.4041700905
+博奥 12.1089181827
+二义 11.9547675029
+南清河 13.2075304714
+两大块 11.1280889297
+新西兰工党 12.8020653633
+二九 12.5143832909
+宗戚勋 12.8020653633
+治平 10.0940151622
+季舍夫 13.2075304714
+通通 9.65218240993
+组织变革 13.900677652
+古村落 13.2075304714
+居移气 12.8020653633
+低毒性 13.2075304714
+邮政网 12.5143832909
+情丝 13.900677652
+卡尔松 13.2075304714
+关掉 9.84023464143
+瞄着 10.4041700905
+撼天震地 13.900677652
+金风送爽 13.2075304714
+费马 10.533381822
+软梯 12.5143832909
+无颜见人 13.2075304714
+空间轨道 12.1089181827
+味同嚼蜡 11.9547675029
+贺新年 12.2912397395
+特吕弗 11.9547675029
+巴黎公社 9.62401153296
+速度 5.56596603015
+百余首 12.5143832909
+不容小视 10.9562386728
+空忙 12.8020653633
+来檬 13.900677652
+情义 10.0720362555
+援军 8.91707103027
+李宝章 13.2075304714
+二信 13.2075304714
+黄柏 10.4349417492
+造化弄人 12.1089181827
+生编 12.8020653633
+沁人肺腑 13.900677652
+村农民 11.598092559
+与其说 10.0294766411
+博士 7.34389929582
+抗磁性 10.8096351986
+技士 12.1089181827
+情书 10.0720362555
+千柱 13.900677652
+样本数 13.2075304714
+达夫 11.5027823792
+瑟夫 12.2912397395
+树文 13.2075304714
+欧美军 12.8020653633
+侯家骑 13.2075304714
+铃声 9.18217878068
+补助金 10.4994802703
+此时此刻 8.81308131674
+拉完 11.3357282945
+畅谈 10.1164880181
+二传 12.1089181827
+八处 11.8212361103
+二伯 10.3171587135
+青春岁月 12.2912397395
+鲁沙尔镇 12.1089181827
+房山 9.94943393339
+热门资源 13.900677652
+千千万万颗 13.900677652
+曹操传 13.2075304714
+稳定感 12.8020653633
+凯龙 10.9562386728
+红明红 13.2075304714
+识字知书 13.900677652
+棉兰老岛 10.9049453784
+八百六十卷 13.2075304714
+八大 8.21370229564
+视黄醇 12.5143832909
+成品油 7.79811905736
+八天 9.84023464143
+援兵 9.20019728618
+查证 9.71102290995
+重残 13.900677652
+倒算 13.2075304714
+连江县 13.2075304714
+房屋 6.61585673941
+龟儿子 9.72629038208
+情人 8.59240995457
+葬仪 11.7034530746
+牛爱香 9.75754292558
+启子 13.900677652
+树敌 11.2616203224
+各处室 13.2075304714
+查讯 12.2912397395
+孤园 12.8020653633
+露得清 11.7034530746
+几十天 11.8212361103
+情仇 11.9547675029
+撬棍 11.7034530746
+贪欲 9.98865464655
+过延津 12.1089181827
+工业用地 10.6818018271
+查访 10.9049453784
+杜光廷 12.2912397395
+几十头 12.1089181827
+博塔 11.8212361103
+如上图 13.900677652
+毛笔字 10.9049453784
+国务院研究室 12.8020653633
+库伦 10.9562386728
+十四周岁 13.900677652
+折射率 9.41204128224
+几十处 11.0674643079
+摧残 8.77671367257
+二位 7.51379833261
+舰长 10.0294766411
+抛体运动 13.900677652
+幅面 11.8212361103
+情份 12.2912397395
+荨麻疹 10.8096351986
+于建文 12.8020653633
+真菌病 11.598092559
+禽畜 10.7226238216
+免税品 12.8020653633
+龚家 13.2075304714
+电线电缆 11.7034530746
+样式表 13.900677652
+书记 6.23726998708
+蒲细柳 13.900677652
+高纯水 13.2075304714
+夫妻俩 9.28555713513
+小穗含 13.2075304714
+交流电法 13.900677652
+二炮 10.2117981979
+重听 12.8020653633
+重启 8.21709788464
+格雷戈里 11.8212361103
+深厚感情 11.4157710022
+文木活 12.5143832909
+邢丫头 13.900677652
+华宁库 13.2075304714
+时不可失 13.900677652
+张恩华 13.900677652
+自选商场 13.900677652
+折角 11.4157710022
+道儿 10.765183436
+视黄醛 13.900677652
+砍翻 10.5684731418
+二点 11.598092559
+体育局 10.8096351986
+肉皮儿 13.900677652
+软垫 10.8096351986
+被剥削 10.4041700905
+北体大 13.900677652
+骨肉未寒 13.2075304714
+重名 10.6818018271
+宗清宁 13.2075304714
+顾寿 12.8020653633
+有法不依 12.2912397395
+重合 9.10488710638
+张家港 10.4666904475
+杨会 10.7226238216
+面向对象 10.642581114
+枪案 11.0103058941
+干打垒 12.8020653633
+关岭 12.8020653633
+好戏 9.43476953332
+停止使用 10.3453295905
+妊娠 8.39128931535
+弗雷迪 12.8020653633
+不结盟 9.33632946051
+沃什 12.8020653633
+李渊入 13.900677652
+撬坏 13.2075304714
+好找 10.4666904475
+古文明 11.1280889297
+刻舟求剑 11.598092559
+植物学 9.34680076038
+来喽 13.900677652
+自有办法 11.1280889297
+多钟 10.1394775363
+多钙 13.2075304714
+重味 13.2075304714
+踏下 13.2075304714
+萨拉逊 13.2075304714
+攘外 11.598092559
+铁石心肠 10.7226238216
+楼间距 13.900677652
+妒火 11.9547675029
+养狐 13.900677652
+养狗 11.3357282945
+英庚款 12.5143832909
+玄元皇帝 12.2912397395
+昼寝 13.2075304714
+相州魏 13.2075304714
+枪栓 10.3453295905
+攘夺 11.9547675029
+书证 11.4157710022
+暮鼓晨钟 12.2912397395
+书评 11.1280889297
+唐人杨 12.8020653633
+写日记 11.8212361103
+血压高 11.9547675029
+治愈 8.53470163695
+急切切 13.2075304714
+最长 7.27661242418
+好手 9.63799777493
+张家湾 10.4994802703
+标准电池 12.8020653633
+凋谢 10.3743171274
+李善友 12.5143832909
+江心洲 11.598092559
+养父 9.94943393339
+瘦果 10.3743171274
+玄妙 9.85762638414
+编歌 13.900677652
+女儿河 11.9547675029
+诉讼费 12.2912397395
+好报 11.4157710022
+诀要 13.900677652
+腰腿痛 11.3357282945
+屈死鬼 12.5143832909
+博望 11.7034530746
+后舱 11.0103058941
+亿吨级 11.8212361103
+室女 11.4157710022
+宗龙 12.2912397395
+宁郡 13.900677652
+交接点 12.5143832909
+关尹 12.5143832909
+铃木 10.1630080337
+噢噢 11.0674643079
+汇钱 11.4157710022
+杨德泉 13.2075304714
+赞助商 10.5684731418
+技术 4.71945717857
+吟唱 9.94943393339
+房捐 13.900677652
+刑案 12.1089181827
+傅恒 11.9547675029
+沙特阿拉伯 8.79473217808
+粗人 10.0940151622
+羽田 9.34680076038
+鼠疫 10.1871055853
+四中全会 8.96620371885
+肛门口 12.5143832909
+枪械 9.11318590919
+方丈室 11.1280889297
+黄澍才 12.8020653633
+没吃没穿 13.2075304714
+软坚 12.1089181827
+联在 11.598092559
+债权国 10.2630914922
+靡丽 12.8020653633
+亚父 12.1089181827
+编次 9.7898037878
+赚疯了 12.8020653633
+哭腔 10.0940151622
+养牛 10.2371160058
+关山 10.0720362555
+八景 9.84023464143
+好招 13.900677652
+首倡者 11.1926274509
+木筒 13.900677652
+腰腿疼 13.900677652
+多冲 13.900677652
+室外 9.02548032877
+重新起动 13.900677652
+畸形发展 10.765183436
+揪出来 10.2897597393
+贪吃 10.8561552143
+卫伯玉 13.900677652
+八极 12.1089181827
+打冷枪 13.900677652
+大朵 11.2616203224
+吟咏 10.4666904475
+潞安 9.82314020807
+重唱 10.7226238216
+单人赛 13.2075304714
+羽翼已成 13.900677652
+酣兴 13.900677652
+林园 11.9547675029
+多问 9.46986085313
+子真 12.8020653633
+多门 10.6818018271
+大气圈 9.96885201925
+森海塞尔 12.2912397395
+拾穗 12.8020653633
+没醒 11.598092559
+八架 11.9547675029
+叶引唐 13.2075304714
+多闻 10.8561552143
+多间 10.6818018271
+阎尔梅 11.9547675029
+清仁宗 11.9547675029
+凝胶电泳 13.2075304714
+象样儿 13.900677652
+漆黑 7.84858848305
+玻璃砖 13.900677652
+拱背 13.2075304714
+多办实事 13.2075304714
+桑弘羊 10.2117981979
+注册主任 13.900677652
+外籍 9.09665660724
+甘夫人 11.3357282945
+中央社会主义学院 13.900677652
+因果报应 10.4041700905
+粗体 12.5143832909
+几十架 11.8212361103
+艾见 12.5143832909
+灭火队 12.5143832909
+浪费时间 10.6818018271
+捡去 13.900677652
+增塑作用 13.900677652
+自我批评 10.1871055853
+气鼓鼓 10.8561552143
+蜜月 10.1394775363
+一分收获 13.2075304714
+过冬 9.6811699468
+绘声绘色 10.2117981979
+恭恭 12.5143832909
+肃静 9.62401153296
+捻碎 12.8020653633
+休闲地 12.8020653633
+半冬性 13.900677652
+姐夫 8.42003872863
+尖利 9.66657114738
+吟哦 10.2897597393
+能斯脱 11.3357282945
+砂轮 10.9049453784
+孤桐 13.2075304714
+博昌 13.2075304714
+不言不语 10.4994802703
+布尔金 13.900677652
+蜜柑 11.4157710022
+鱼船 12.8020653633
+八月 7.42216800977
+特克斯 10.9049453784
+诗二首 12.8020653633
+几十杯 13.900677652
+扶策太 13.900677652
+其乐无穷 11.598092559
+强权政治 11.0674643079
+养猫 12.2912397395
+养猪 9.24671730182
+前列腺素 10.2630914922
+八期 12.2912397395
+口沫横飞 12.5143832909
+飞跃发展 10.7226238216
+智伯渠 12.5143832909
+欢畅 11.1280889297
+布索加 13.2075304714
+鸭掌 12.5143832909
+树孔 13.2075304714
+几十杆 13.2075304714
+人才观 13.900677652
+念头 7.41299363349
+程秉 12.8020653633
+生贵子 12.1089181827
+划出界限 13.2075304714
+横躺竖卧 12.5143832909
+房扑 13.2075304714
+书中 7.81390292506
+节育环 12.5143832909
+多长 8.76487921493
+八朵 13.900677652
+裁边 13.900677652
+贾母刚 13.2075304714
+折衷 10.1394775363
+安海镇 13.2075304714
+零股 11.3357282945
+检察机关 8.98802276624
+钴蓝 13.2075304714
+八杆 13.900677652
+各显神通 11.5027823792
+休闲型 12.8020653633
+几十本 12.8020653633
+不遇 9.94943393339
+冯异 12.1089181827
+粗俗 10.0088573539
+开赌 12.8020653633
+司鼓 13.2075304714
+既能 8.53003962385
+真本事 10.765183436
+清障车 13.2075304714
+念好 13.900677652
+玻璃碴 11.598092559
+八条 10.2897597393
+令人惊叹 10.4041700905
+玻璃碳 13.900677652
+钢铁网 11.7034530746
+留尾巴 13.2075304714
+挑重担 13.900677652
+孔隙率 13.900677652
+吟味 12.5143832909
+史达祖 13.2075304714
+雪雁 9.96885201925
+蜜枣 10.4994802703
+陈白尘 11.3357282945
+田劝农 13.2075304714
+北领地 13.2075304714
+达奇 13.900677652
+贪图 9.82314020807
+边门 11.0674643079
+万把块 12.2912397395
+和稀泥 11.3357282945
+博文 10.2897597393
+自毁长城 12.2912397395
+时果 12.1089181827
+缘故 7.56385192083
+好急 13.900677652
+好性 12.8020653633
+技术推广 11.9547675029
+曹操就到 12.5143832909
+专题报告 11.5027823792
+贝采利 10.765183436
+好怪 13.900677652
+吠陀 9.65218240993
+类抗生素 10.5684731418
+多雨 8.56313957227
+多雪 12.1089181827
+穿井 13.2075304714
+寂无人声 12.8020653633
+博施 12.5143832909
+多雾 9.98865464655
+张眼一看 13.900677652
+匹茨堡 13.2075304714
+纳善言 13.2075304714
+不遑 11.0103058941
+服食 10.0088573539
+场电位 13.900677652
+描述统计 12.5143832909
+篾片 11.8212361103
+何其毒也 13.2075304714
+交流电源 11.1280889297
+好恶 10.2117981979
+施莱尔 12.5143832909
+联合收割 13.900677652
+杨笑 12.5143832909
+多隆 13.2075304714
+申大爷 13.2075304714
+黑眼 12.2912397395
+喷水池 12.1089181827
+步兵队 13.900677652
+戴礼记 11.0674643079
+零茶 13.900677652
+树墩 12.2912397395
+神圣不可 10.1630080337
+注重实效 12.2912397395
+顺水行舟 13.900677652
+五行生克 11.0103058941
+折让 10.3171587135
+后背 8.63798746307
+休闲吧 13.2075304714
+程程 12.8020653633
+缅共 13.2075304714
+职掌 9.40086798165
+博览古今 13.2075304714
+嵌入式软件 12.5143832909
+外侵 12.1089181827
+高渐离 12.5143832909
+多难 10.0940151622
+歧异 10.765183436
+一千四百二十七万余两 13.2075304714
+多关 13.900677652
+奥林匹克 9.25628675283
+同归于尽 9.33632946051
+库特 10.5684731418
+太高兴 10.642581114
+关帝 10.765183436
+许多许多年 12.5143832909
+张居谦 10.8096351986
+分文 9.53122979951
+泉州市 10.3171587135
+二爷 8.49350588052
+沅陵县 12.5143832909
+减收 9.25628675283
+进贤用能 13.900677652
+截面 9.20019728618
+邵阳市 11.2616203224
+感愧交并 13.900677652
+孤残 13.900677652
+鼎鼎 13.2075304714
+俗家 11.1926274509
+重新武装 11.5027823792
+庚日 13.2075304714
+昼夜 7.90671622467
+后者 6.08749038445
+阿纳姆 13.2075304714
+身事 13.2075304714
+穿上 8.5440913773
+涡流损耗 11.9547675029
+技改 9.22784881751
+摄氏温度 12.2912397395
+开赴 9.31571017331
+好想 11.0103058941
+贪嘴 11.7034530746
+太田 13.900677652
+贾琏宝玉 13.2075304714
+好惹 11.2616203224
+唐招提寺 11.5027823792
+感应炉 11.9547675029
+动给 13.900677652
+太甲 11.4157710022
+保障人权 12.1089181827
+保定 8.33615724465
+好惨 12.5143832909
+减数 12.2912397395
+二片 11.598092559
+桑利斯 13.2075304714
+回首往事 11.1926274509
+慎于 12.8020653633
+陈凤桐 13.2075304714
+关平 10.2630914922
+数字影像 13.900677652
+杨诺夫 12.8020653633
+玻璃管 11.3357282945
+沾边儿 12.2912397395
+黄师爷 10.1871055853
+重回 8.25523075433
+伊姆雷 12.5143832909
+精神百倍 11.5027823792
+软和 10.765183436
+博蒂切利 12.1089181827
+阿尔丰索 13.900677652
+二环 11.598092559
+待遇 7.59805867623
+关得 10.642581114
+重在 9.11318590919
+好几十万 12.2912397395
+河南岸 10.7226238216
+流离琐尾 13.900677652
+蒿俊闵 13.2075304714
+八斗 11.8212361103
+重地 8.99540287354
+库班 12.5143832909
+屡见不鲜 9.29550746599
+添砖加瓦 11.8212361103
+重场 13.900677652
+好几十个 11.5027823792
+重圆 12.5143832909
+荷枪实弹 10.8561552143
+维克拉姆 12.8020653633
+八斤 11.7034530746
+拂尘 11.4157710022
+好感 8.82550383674
+沃乌 13.900677652
+李岩营 13.2075304714
+院辖 13.900677652
+来回 7.49544919394
+仁川港 13.2075304714
+约翰尼 12.8020653633
+速报 11.598092559
+库珀 11.2616203224
+情爱 9.89334446674
+柬帖 12.5143832909
+多音 12.5143832909
+跷过 13.2075304714
+科龙电器 11.9547675029
+波德拉 13.900677652
+八正散 12.1089181827
+省内外 9.22784881751
+二班 11.0674643079
+清原县 13.2075304714
+维护费 11.9547675029
+旱情 10.533381822
+好慢 13.900677652
+关心 6.52104549937
+引错 13.900677652
+伴生气 12.5143832909
+宜阳 10.2117981979
+跟进去 11.2616203224
+八日 10.2897597393
+几十文 13.900677652
+黑劳士 12.1089181827
+较为理想 11.4157710022
+戒烟 9.7898037878
+结束战斗 12.2912397395
+八旬 11.1926274509
+干部科 13.2075304714
+楚恭王子 13.2075304714
+盛着 9.96885201925
+八时 12.1089181827
+情牵 13.2075304714
+扭转干坤 12.8020653633
+服式 11.9547675029
+麟凤龟龙 13.900677652
+禾稻 12.8020653633
+禾稼 11.2616203224
+速战 11.0103058941
+空开 12.8020653633
+鼠目 13.2075304714
+钱库 13.2075304714
+速成 10.642581114
+金代章 13.2075304714
+服饰 7.99804431857
+采编 11.1280889297
+客运码头 11.7034530746
+宁明县 12.2912397395
+龚某 13.900677652
+颖川 11.8212361103
+无本之木 12.2912397395
+动物体 10.2117981979
+枪毙 9.20019728618
+何长工 12.8020653633
+武陵源区 12.8020653633
+八支 11.4157710022
+兵戈相见 12.8020653633
+重型 7.9817837977
+缩影 9.26594866375
+后脚 10.0720362555
+孔径光阑 12.8020653633
+西击秦 12.5143832909
+中医疗法 13.900677652
+大权 7.90422556336
+慢速 10.2630914922
+最难 9.0884932966
+橄榄球队 13.900677652
+处理结果 10.2897597393
+训练量 13.2075304714
+技术产业 10.9562386728
+玻璃窗 9.54396882529
+克利福德 12.5143832909
+张勋理 13.900677652
+减摩 11.8212361103
+战士 6.70099930628
+违抗命令 12.8020653633
+几十支 12.1089181827
+可修改性 13.900677652
+斯霍弗 12.8020653633
+反右派斗 11.2616203224
+调查科 11.5027823792
+后腿 9.46986085313
+房性 12.2912397395
+工团主义 11.7034530746
+米纳斯吉拉斯 12.2912397395
+名闻遐迩 11.0103058941
+萨克达 12.8020653633
+百鸟 10.4994802703
+竟然 5.99413041961
+后申侯 12.8020653633
+大出血 10.2117981979
+瑟斯 12.5143832909
+公差 9.61021821083
+联同 11.9547675029
+联名 9.22784881751
+交接班 9.30555780184
+联合 5.64979650728
+公益金 10.4994802703
+轻剑 11.4157710022
+麻辣火锅 13.900677652
+合乎逻辑 10.5684731418
+农林下路 12.8020653633
+耳聪 13.900677652
+熬油费火 13.900677652
+换行符 11.2616203224
+外事办公室 13.2075304714
+来凤 10.3171587135
+来丹湖 12.8020653633
+汇通 9.87532596124
+卢俊义 8.4980002701
+来函 11.7034530746
+尚性钡 13.2075304714
+关境 12.1089181827
+煤气中毒 11.5027823792
+创作实践 10.604840786
+八折 10.6818018271
+裂变 9.20932976975
+特使团 13.900677652
+汇划 12.8020653633
+多部 8.70218062071
+几十担 13.2075304714
+减掉 10.642581114
+裂口 10.3453295905
+诸小神 13.2075304714
+大舌头 11.4157710022
+贺维帧 12.2912397395
+非均相 11.5027823792
+诗云子曰 13.900677652
+顽愚 13.2075304714
+虚心听取 12.1089181827
+蒙马特尔 12.5143832909
+花博园 10.4994802703
+下霜 13.900677652
+情由 10.1164880181
+十进制 10.642581114
+捡回 11.0674643079
+八担 12.2912397395
+刑治 12.5143832909
+二瓶 12.8020653633
+八拐 12.2912397395
+格雷哥尔 13.2075304714
+时世尊 13.2075304714
+量入为出 11.3357282945
+好景 12.1089181827
+膘情 13.2075304714
+谁言寸草 12.8020653633
+勤能补拙 13.900677652
+穆合热 13.2075304714
+旱柳 12.5143832909
+恭敬 8.89673134603
+鼓舞人心 11.0103058941
+百首 11.598092559
+好晚 13.2075304714
+肉体化 13.900677652
+最酷 12.8020653633
+割来割去 13.900677652
+重做 11.7034530746
+减振 10.3743171274
+多遍 11.8212361103
+树干 8.1608847398
+国兴 11.5027823792
+商品粮棉 12.2912397395
+宫卫骑 13.2075304714
+拉芙 13.900677652
+乱臣贼子 11.3357282945
+八戒 7.15779701618
+说明书 7.50208271744
+夜猫子 11.2616203224
+市容管理 13.900677652
+软化 9.12155415886
+客观化 12.2912397395
+多道 10.5684731418
+几十所 12.2912397395
+多遭 11.2616203224
+速攻 12.2912397395
+减按 11.2616203224
+枪法 9.35738286971
+于楚 11.3357282945
+减持 6.45234379108
+忘得 11.1280889297
+联华 9.55687223012
+邵宏渊 13.2075304714
+八户 12.5143832909
+李俊引 12.5143832909
+刁顽 11.8212361103
+折起 11.1280889297
+职教 11.7034530746
+调查组 9.5062284973
+于建康 11.5027823792
+多选 11.0103058941
+冉献 12.5143832909
+附着物 11.0103058941
+最重 8.77671367257
+八打 13.2075304714
+裂化 10.7226238216
+编演 10.3743171274
+工业用水 10.4041700905
+多通 13.2075304714
+几十户 11.2616203224
+井式炉 13.2075304714
+指针式 11.9547675029
+婀娜 10.7226238216
+化工学院 11.9547675029
+沙士比 13.900677652
+孰不可忍 11.0674643079
+找不着 9.14708746087
+新闻调查 12.8020653633
+软卧 10.9562386728
+折账 13.900677652
+臭汗 10.9562386728
+减损 12.5143832909
+贸易往来 9.40086798165
+开跑 11.1926274509
+艾奇逊 11.5027823792
+街头剧 12.2912397395
+营建商 13.900677652
+雷尔夫 13.900677652
+截取 10.4041700905
+南海诸岛 9.69598503258
+最适 10.0088573539
+多重 8.12923652885
+杜埃 12.8020653633
+多量 10.3171587135
+文成公主 9.7898037878
+宁镇 11.1280889297
+脊椎神经 13.2075304714
+策划人 11.598092559
+情理 9.89334446674
+人性美 13.900677652
+诊金 13.900677652
+太监 6.53866710072
+玛仁卡 13.900677652
+落叶 7.8093677699
+解振华 10.0720362555
+弃邪归正 13.2075304714
+朱丹溪 12.5143832909
+董太后 12.2912397395
+联勤 11.8212361103
+乌尔苏 13.2075304714
+最速 12.5143832909
+指甲盖 10.9049453784
+云奉尉 13.2075304714
+女厕所 12.5143832909
+有空时 13.900677652
+树心 13.2075304714
+半流质 11.9547675029
+救援队 11.4157710022
+咏叹 10.9562386728
+通情达理 10.1164880181
+好有 12.8020653633
+城建税 12.5143832909
+有百利而无一害 13.900677652
+任吏 13.900677652
+重入 10.9562386728
+掘土机 13.2075304714
+怀安 12.8020653633
+博拉 11.1926274509
+树德 12.5143832909
+国家股 11.7034530746
+斯库塔 12.8020653633
+孙永祚 10.5684731418
+转瞬间 10.6818018271
+重兵 8.46259834305
+新人奖 12.5143832909
+洪宣娇 13.2075304714
+联动 8.33999602096
+重典 10.6818018271
+曲阜市 11.3357282945
+联办 11.9547675029
+衡山 9.32596667347
+等值线图 12.2912397395
+宁锦 11.9547675029
+重光 10.8561552143
+陶瓷原料 11.5027823792
+交易量 8.10766404359
+掌与明 13.2075304714
+效颦 13.900677652
+镂刻 10.7226238216
+树影 9.93038573842
+百项 11.5027823792
+口袋吧 13.900677652
+玄奥 12.1089181827
+灭资兴无 13.2075304714
+丽水 10.4994802703
+百页 12.8020653633
+二用 13.900677652
+养眼 11.0103058941
+树形 10.3171587135
+二甲 11.0103058941
+仰荷圣 13.2075304714
+哀痛 10.3453295905
+奴仆 8.58255765813
+乍一听 10.604840786
+孔晁注 13.2075304714
+王成章 11.8212361103
+邵巡抚 13.2075304714
+亡命之徒 10.9562386728
+资源型 9.7898037878
+人员不足 12.2912397395
+大气压 9.5062284973
+撬动 9.63799777493
+关头 8.83808261895
+魂不守舍 11.0103058941
+好极 11.4157710022
+高强 10.0088573539
+苍生鼓 13.900677652
+板筋 12.8020653633
+斯瓦特 11.4157710022
+重写 10.2897597393
+施小计 11.8212361103
+圣安德鲁 13.2075304714
+和启沃 13.2075304714
+于建德 12.5143832909
+孤注 13.900677652
+江大津 13.900677652
+寿终 13.2075304714
+百尺竿头 12.2912397395
+穆扎法尔 12.2912397395
+鬼鬼祟祟 9.56994431169
+盐焗鸡 12.8020653633
+博克萨 13.900677652
+朱华奎 13.2075304714
+砥柱 11.0103058941
+重击 12.1089181827
+拾级 12.1089181827
+援款 12.8020653633
+生产实践 10.1394775363
+软商品 11.9547675029
+欺压百姓 11.8212361103
+联创 10.3743171274
+关好 10.3743171274
+节能降耗 10.4041700905
+结义为 13.900677652
+常服 10.604840786
+图像复原 13.2075304714
+凌厉 9.31571017331
+陶共王 13.2075304714
+规范市场 11.8212361103
+安倍 12.8020653633
+达茂旗 13.2075304714
+指手画脚 10.0505300503
+款识 10.8561552143
+核废料 10.642581114
+中国日报 10.642581114
+尊府 10.6818018271
+玻璃罐 13.2075304714
+足球鞋 12.8020653633
+遂行 9.25628675283
+重利 11.2616203224
+杨林 9.05649056552
+刑满 11.4157710022
+折进 13.900677652
+情真 11.7034530746
+重制 13.2075304714
+宁陕 12.5143832909
+重到 11.8212361103
+通报会 11.2616203224
+赫歇耳 11.9547675029
+来台 10.765183436
+折返 11.1280889297
+不悔改 13.2075304714
+向宝钗 11.5027823792
+一石激起千层浪 10.765183436
+折迭 13.2075304714
+信号机房 13.900677652
+行君臣 11.9547675029
+治权 10.642581114
+重刑 10.642581114
+摸头 12.8020653633
+重划 12.2912397395
+回音壁 11.7034530746
+炮仗 10.2897597393
+玻璃罩 11.598092559
+二百万 11.1280889297
+重创 8.38724890581
+正北方 12.2912397395
+坏血病 11.3357282945
+吕凤子 12.5143832909
+侍太监 10.9562386728
+海金刚 12.5143832909
+包罗万象 10.8096351986
+铸造成 13.900677652
+公屋 13.2075304714
+矫治 10.3743171274
+人世沧桑 12.1089181827
+气壮山河 11.598092559
+摆谱儿 12.8020653633
+确非 11.2616203224
+治本 10.0720362555
+裁衣 11.8212361103
+贪功 11.5027823792
+联军 8.14493543839
+副科长 11.9547675029
+赚到 9.43476953332
+太和殿 10.1630080337
+来历 8.27666014579
+长沙市 9.56994431169
+消息灵通 10.6818018271
+高峰会 11.7034530746
+宁阳 11.3357282945
+重剑 11.598092559
+解铃还须系铃人 12.8020653633
+上海圣约翰大学 10.9562386728
+壮士断腕 12.2912397395
+走向市场 12.2912397395
+燃料箱 10.8561552143
+芦丛 13.2075304714
+崇庆县 13.2075304714
+书费 13.2075304714
+猪叫 13.2075304714
+输送车 8.90346537821
+联共 9.44633035572
+杖刑 11.598092559
+黄梅雨 12.8020653633
+呈网状 12.8020653633
+程维 12.8020653633
+晶形沉淀 13.2075304714
+唐山钢铁公司 12.1089181827
+突泉县 13.900677652
+来华 8.66956903512
+职权 8.11993413618
+折转 11.4157710022
+弗雷西 12.5143832909
+王诗序 13.2075304714
+机舱 9.27570483869
+倒霉蛋 11.3357282945
+杨柳 9.46986085313
+重办 12.8020653633
+由此进 13.2075304714
+重力 8.09554268306
+医务界 12.8020653633
+密陀僧 13.2075304714
+公孙敖 13.2075304714
+周郎安 13.2075304714
+栽花 10.8096351986
+金钱关 13.900677652
+房改 10.1164880181
+嘻嘻 8.65365357982
+相对论 8.64318227995
+减慢 9.16447920358
+社会习俗 11.2616203224
+贪利 11.5027823792
+二百 8.83177344976
+灵官庙 13.2075304714
+葱头 12.8020653633
+沉沉 9.40086798165
+以资抵债 13.900677652
+拖死 11.2616203224
+赏菊 11.7034530746
+高要县 12.1089181827
+情知 9.53122979951
+二百个 11.0103058941
+角杯 12.8020653633
+寄生调幅 13.900677652
+枝节 10.4666904475
+爆竹声 11.598092559
+速来 10.1630080337
+多劳 11.8212361103
+编派 11.1280889297
+大伤元气 11.5027823792
+开冻 12.5143832909
+生机盎然 10.8096351986
+吕子明 12.8020653633
+工资改革 10.765183436
+国华人寿 13.900677652
+念得 11.7034530746
+托炼锌 13.2075304714
+花生米 10.3453295905
+编法 12.1089181827
+宁靖 12.8020653633
+宁静 8.29487558568
+中国乒乓球协会 13.2075304714
+猜测 7.23244940356
+胡愈之 11.4157710022
+姓宋 11.0674643079
+家传户诵 13.900677652
+半文盲 11.8212361103
+吴大叔 12.5143832909
+棉毛衫 13.2075304714
+强弱电 13.900677652
+市内电话 12.2912397395
+于元光 12.5143832909
+宋晓梧 11.9547675029
+杨玄威 12.5143832909
+乌孙遂 12.5143832909
+不合逻辑 11.598092559
+差数 11.8212361103
+赎罪券 12.2912397395
+西塞罗 10.7226238216
+百骸 13.2075304714
+浙江省政府 12.2912397395
+玉山县 13.900677652
+羽状 9.34680076038
+南靖县 12.5143832909
+红星路 13.900677652
+须儿 12.8020653633
+自来水管 11.1280889297
+和嘉平 10.604840786
+后藤 12.5143832909
+桑库鲁 12.2912397395
+陈师曾 11.3357282945
+金迷纸醉 13.900677652
+来势 9.82314020807
+谋虚逐妄 13.900677652
+走不开 11.4157710022
+重印 10.2897597393
+联储 8.34771806705
+屋基 11.8212361103
+木扎特 12.8020653633
+蜜意 12.8020653633
+电子散射 12.8020653633
+阮福时 13.2075304714
+理查兹 11.598092559
+万足齐 13.900677652
+不足为凭 12.1089181827
+后藏 10.533381822
+念念 9.82314020807
+摆荡起来 13.2075304714
+先入之见 13.2075304714
+余姚市 11.0674643079
+养病 9.05649056552
+鳖鱼 12.8020653633
+克尔阶 13.2075304714
+狂人 10.4666904475
+阿是穴 11.7034530746
+独立国家 9.25628675283
+麦垛 12.2912397395
+三二十 11.3357282945
+足球队 10.3453295905
+莫尔斯 10.9562386728
+黑郁郁 12.8020653633
+英雄事迹 10.8561552143
+赏花 10.0940151622
+赫勒拿 12.1089181827
+辐射线 12.2912397395
+温文尔雅 9.91169360541
+顽抗 9.87532596124
+白斩 13.2075304714
+零蛋 13.900677652
+养生 8.82550383674
+重压 9.84023464143
+边以济 13.2075304714
+花生糖 12.8020653633
+羽片 11.2616203224
+日文版 13.2075304714
+躬亲 11.9547675029
+狂乱 10.6818018271
+深表同情 11.9547675029
+收编在 13.2075304714
+古立克 13.2075304714
+减息 10.0505300503
+重叠 8.18036587537
+乐愿 13.900677652
+关子 10.4041700905
+洗尽铅华 12.8020653633
+砍破 13.900677652
+宋袭 13.2075304714
+水利厅 12.1089181827
+贾母命 11.1926274509
+哭丧着脸 9.74179456862
+来到 5.38568688411
+玻璃纱 13.900677652
+沧州 8.79473217808
+玉山北 12.5143832909
+特勤旅 12.8020653633
+玻璃纸 11.598092559
+四十千米 13.900677652
+养畜 10.4041700905
+百子 10.604840786
+佥都御史 10.9049453784
+重发 11.8212361103
+子军 13.900677652
+秩序 7.33400522217
+竟用 11.1280889297
+图像资料 13.2075304714
+沉沦 9.87532596124
+自来水笔 10.7226238216
+宋江点 12.8020653633
+邢进士 13.900677652
+来往关系 12.5143832909
+撬开 9.49395840471
+刘校长 13.900677652
+方西冷 8.9102450652
+体育周 13.900677652
+父子情深 13.2075304714
+百门 12.2912397395
+内向型 11.9547675029
+塔吉克斯坦共和国 11.9547675029
+会当 12.1089181827
+如前所述 10.0088573539
+田贵妃 11.5027823792
+水利局 11.3357282945
+平底船 11.7034530746
+脱不了 10.3171587135
+孤意 11.2616203224
+强立鲁 12.8020653633
+黄巢攻 12.8020653633
+贾母安 13.900677652
+二碗 13.900677652
+五十文 12.1089181827
+筹融资 13.900677652
+资助者 13.2075304714
+呕吐时 12.5143832909
+立足于 9.05649056552
+建筑设备 11.9547675029
+龚氏 13.900677652
+一百周年 12.8020653633
+稍早 9.7898037878
+树势 11.7034530746
+编排 8.80692745117
+整瓶 13.900677652
+重山 12.2912397395
+琐事 9.93038573842
+艾菲尔 13.900677652
+曹休寨 13.900677652
+怏怏不悦 13.900677652
+恣行无忌 12.8020653633
+赏赉 12.2912397395
+咨商 11.5027823792
+胶体状态 12.8020653633
+室内 7.52565283215
+卡尔斯塔德 13.2075304714
+色胆 13.2075304714
+闯劲 12.8020653633
+汝二人 10.1164880181
+寇梁 12.1089181827
+一分钱一 12.8020653633
+章与章 13.2075304714
+刁钻 10.2630914922
+一览无遗 11.7034530746
+郑国泰 12.5143832909
+一二种 13.900677652
+江伐楚 12.5143832909
+赏赐 7.84155445639
+软式 11.2616203224
+明拔寨 12.8020653633
+跷跷板 9.71102290995
+三聚甲醛 12.2912397395
+武装集团 11.9547675029
+关合 12.8020653633
+全力以赴 9.38981814546
+秦曼卿 10.8561552143
+车钩 13.2075304714
+院落 8.37124856446
+核能级 11.5027823792
+秒表 11.3357282945
+凋落 11.5027823792
+皮科拉 12.8020653633
+既要 8.0484751722
+杀进去 13.900677652
+凋萎 13.2075304714
+马远 11.0674643079
+折腾 7.94484028251
+荒淫无耻 11.4157710022
+和召公 12.1089181827
+知其下落 13.2075304714
+总体而言 8.78268383956
+返乡 9.61021821083
+树前 13.2075304714
+化浓妆 13.900677652
+软弱 8.53003962385
+情种 11.598092559
+房款 10.604840786
+脑垂体 10.4349417492
+裂开 8.87023973058
+蜜源 10.0088573539
+青岩板 12.8020653633
+受到破坏 10.8096351986
+拦击 11.598092559
+拼出来 13.900677652
+那八宝 13.2075304714
+龙探海 13.900677652
+稳定器 9.96885201925
+法人代表 10.1871055853
+宜丰 13.2075304714
+摸骨 11.598092559
+不雅观 11.598092559
+贪小 12.5143832909
+天堂鸟 13.2075304714
+清热泻火 11.2616203224
+薛婆阿 13.2075304714
+害人害己 11.8212361103
+弗里德曼 10.765183436
+施特拉 12.2912397395
+最受 8.4284069783
+稳定型 12.1089181827
+掉色 13.900677652
+联建 13.900677652
+软床 12.8020653633
+少数行 13.900677652
+树叶 8.29487558568
+荒唐言 13.2075304714
+美术专业 12.8020653633
+手夹着 13.2075304714
+苦乐不均 11.598092559
+商品生产 8.45825994145
+木竹 12.2912397395
+色胺 12.8020653633
+后设 10.604840786
+踢出局 13.2075304714
+后记 10.1164880181
+鼠类 9.98865464655
+千公顷 11.7034530746
+第十五次 10.642581114
+香港中文大学 10.5684731418
+多列 10.8096351986
+漓江 10.0505300503
+扣罚 13.900677652
+软座 13.2075304714
+安傅 13.900677652
+十三经 11.1280889297
+七十三岁 13.900677652
+职棒 13.900677652
+注疏 10.0720362555
+栽赃 10.4994802703
+机油箱 13.900677652
+铜板纸 11.9547675029
+滑灏界 13.2075304714
+鹿非鹿 13.2075304714
+严加戒备 12.5143832909
+成团打块 13.900677652
+金融中心 8.24468584116
+抱恨终身 13.900677652
+鼎铭 12.1089181827
+水晶玻璃 13.2075304714
+披上 8.94485059437
+三棒鼓 12.5143832909
+好歹 8.0229418702
+漓水 12.2912397395
+张家村 12.1089181827
+桂冠诗人 12.5143832909
+治校 12.5143832909
+后读 13.2075304714
+凌弱 12.1089181827
+国债 6.58745726489
+行业新闻 13.900677652
+王豪格 12.5143832909
+知疼知热 13.900677652
+养息牧 12.8020653633
+编报 12.2912397395
+枪膛 10.3743171274
+帝登基 13.2075304714
+成其为 10.4666904475
+来岁 9.29550746599
+来路不明 11.5027823792
+房檐 9.6811699468
+空射 11.1280889297
+马上会 10.3743171274
+治标 10.765183436
+后话 13.2075304714
+彩色照片 11.598092559
+好歌 13.900677652
+帕萨迪纳 12.1089181827
+内寄生 12.2912397395
+前列腺病 13.900677652
+古楚 11.7034530746
+孤悬 11.1280889297
+三百六 13.900677652
+沧县 11.4157710022
+标准音 11.598092559
+牝牛 13.900677652
+艾伦娜 13.2075304714
+软布 11.9547675029
+蔓延 7.80035869996
+叶立德 12.8020653633
+理查德 10.1164880181
+撒手人寰 12.8020653633
+左武卫 12.5143832909
+折伤 11.8212361103
+吊上 12.1089181827
+吊下 11.8212361103
+大筛法 13.900677652
+最鲜 13.900677652
+成为僵局 13.900677652
+生气蓬勃 12.8020653633
+田多达 13.2075304714
+辐射点 11.5027823792
+古瑟 11.5027823792
+中央直属机关 13.900677652
+化龙池 13.900677652
+萧何月 12.8020653633
+阿尔布克 13.900677652
+凌志 11.2616203224
+傅作义 10.642581114
+吊个 12.8020653633
+宗隽 13.2075304714
+镶板 13.900677652
+走过场 11.8212361103
+果子露 12.8020653633
+重工 6.96628044205
+王母桃 13.2075304714
+多刺 11.8212361103
+职校 13.900677652
+医药企业 9.94943393339
+编成 7.69007757495
+四大皆空 11.8212361103
+联席 9.94943393339
+联带 12.2912397395
+王立在 13.900677652
+博湖 12.2912397395
+树大招风 11.1280889297
+科技期刊 11.9547675029
+钱凤 11.7034530746
+裂帛 10.9562386728
+好比 8.11685246965
+好毒 12.8020653633
+烹饪器 13.900677652
+纽约股票交易所 13.2075304714
+德哈斯 13.900677652
+辐射热 12.1089181827
+编户 9.98865464655
+班勇攻 13.2075304714
+创世纪 11.1280889297
+载歌载舞 10.642581114
+空虚感 12.2912397395
+好样 10.0505300503
+选择权 9.4233408375
+羽翼 9.77354326693
+含笑九泉 12.2912397395
+广播稿 12.1089181827
+服部 13.2075304714
+大同书 12.1089181827
+阶级分析 12.8020653633
+粉面油头 13.900677652
+备耕 13.900677652
+蔡福 10.642581114
+西竺 13.900677652
+蜜汁 11.4157710022
+歇伏 13.900677652
+蝶蛹 13.2075304714
+陆尔奎 13.2075304714
+行尸走肉 10.604840786
+医务科 13.2075304714
+枪托 9.18217878068
+室友 11.7034530746
+木立 13.2075304714
+刑拘 10.1630080337
+国民党中常委 13.2075304714
+致敬 9.59661255877
+白灵笑 11.9547675029
+羽翅 11.8212361103
+定睛一看 9.89334446674
+希金斯 11.0674643079
+财会人员 13.900677652
+枪手 9.94943393339
+外立面 11.8212361103
+松竹斋 13.2075304714
+特区建设 13.900677652
+二章 12.2912397395
+二端 11.9547675029
+速比 12.2912397395
+余庆县 13.900677652
+优遇 11.2616203224
+注目 9.12155415886
+勒梅尔 13.900677652
+六百余万 13.2075304714
+红树湾 13.900677652
+都诺夫 12.2912397395
+承气汤 11.3357282945
+百安居 12.5143832909
+隔离法 13.900677652
+大气层 8.82550383674
+空包弹 11.3357282945
+枪战 11.7034530746
+抓狂 11.7034530746
+不识庐山真面目 12.5143832909
+上交所 7.40390266179
+揩洗 13.900677652
+山春晓 13.2075304714
+浑黄 12.5143832909
+妻舅 11.2616203224
+只害 13.900677652
+高分子 8.25523075433
+来得 7.39638947844
+吡唑酮 13.2075304714
+后裔 7.5871296057
+麻将牌 10.9562386728
+刁难 10.3453295905
+阿谀奉承 11.3357282945
+一百一十二万 13.2075304714
+重度 9.69598503258
+太和村 12.2912397395
+十七层 12.8020653633
+计上心来 11.4157710022
+生物体 8.48457724977
+说时迟那时快 11.598092559
+浙江省政协 13.2075304714
+农耕 8.62767809341
+闻知王爷 13.900677652
+博洛 11.0674643079
+常情 10.4041700905
+重庆 6.46937797682
+猜想 7.72066099832
+柳建伟 13.2075304714
+当前目录 10.3171587135
+念到 11.2616203224
+博洽 12.2912397395
+三二年 12.2912397395
+玻璃珠 12.8020653633
+贯彻始终 13.900677652
+书脊 12.5143832909
+欲罢不能 10.9049453784
+司马子伯 13.2075304714
+鼎革 13.2075304714
+博济 12.5143832909
+窘态 10.7226238216
+夏小正 11.9547675029
+没派 13.2075304714
+马迪 12.2912397395
+后补 12.8020653633
+刑房 12.1089181827
+姚广孝 10.8561552143
+怀来县 12.1089181827
+阿雅尔 12.5143832909
+树功立业 13.900677652
+重建 7.31450599712
+王岐山 10.3743171274
+衡定 13.2075304714
+后行 10.4349417492
+博浪 13.2075304714
+赏过 12.8020653633
+侍管霸 13.2075304714
+广播站 11.2616203224
+樱桃花 12.5143832909
+吴大帝 11.0103058941
+规划表 13.2075304714
+闭口不答 13.2075304714
+前列腺癌 10.4041700905
+窦房结 10.9562386728
+仪门 10.765183436
+羽缎 13.2075304714
+走不动 9.18217878068
+跟上去 10.642581114
+后街 11.9547675029
+多边贸易 9.96885201925
+闻言笑 11.8212361103
+贪念 12.5143832909
+歇业 11.1926274509
+养禽 11.2616203224
+布拉藻斯卡斯 13.2075304714
+玻璃片 11.3357282945
+布鲁默 12.2912397395
+做针线 11.0103058941
+六百万贯 13.2075304714
+重弹 10.642581114
+独行其道 13.900677652
+野鹤闲云 13.900677652
+比活度 11.9547675029
+重开 9.93038573842
+羽绒 10.6818018271
+乒乒乓乓 10.9562386728
+揩汗 11.8212361103
+提神醒脑 12.2912397395
+于建元 11.7034530746
+陈小官 11.8212361103
+书肆 12.1089181827
+归纳推理 11.8212361103
+连皮带 13.900677652
+节电池 12.8020653633
+搏浪 11.8212361103
+龙鳞状 13.2075304714
+崎岖 8.6966709649
+贪心 10.765183436
+夏练三伏 13.900677652
+阎李寨 10.1394775363
+解放后 8.98802276624
+重彩 10.9562386728
+水桶腰 12.5143832909
+面面观 12.1089181827
+洗碗工 13.2075304714
+树冠 8.89004235788
+重影 12.2912397395
+关城 10.2897597393
+技法 8.3555002075
+体育场 9.22784881751
+镜中花 11.5027823792
+高要市 12.8020653633
+多叶 12.5143832909
+钟鸣 11.598092559
+二篇 12.1089181827
+石油部长 11.9547675029
+李信兄弟 10.7226238216
+张世杰 11.0674643079
+齐齐哈尔 9.98865464655
+贪得 12.5143832909
+指示植物 11.0103058941
+后视 12.5143832909
+渭干河 11.5027823792
+重录 13.900677652
+左角 12.8020653633
+念叨 9.14708746087
+重当 13.900677652
+厦门信达 9.54396882529
+座位 7.93709830836
+书背 13.2075304714
+房梁 10.4041700905
+撤销权 13.900677652
+公孙树 12.5143832909
+或传感器 13.900677652
+巴拉维 13.900677652
+训练馆 11.9547675029
+大众汽车集团 11.598092559
+标准间 12.2912397395
+援救 9.5186510173
+温书 11.7034530746
+援敌 13.2075304714
+夺过去 11.9547675029
+开辟出来 12.2912397395
+恒定 8.82550383674
+元器件 8.71889410168
+来年 12.2912397395
+拦劫 12.1089181827
+来水量 10.9049453784
+牵强附会 11.0674643079
+丛谈 11.5027823792
+浑号 12.2912397395
+辐射状 10.0940151622
+经济协作 12.1089181827
+联展 12.5143832909
+浇铸 10.1871055853
+栽进 11.598092559
+二笔 13.900677652
+关在 8.91707103027
+保育员 13.2075304714
+阿丑 10.4041700905
+关圣 11.4157710022
+布利亚 13.900677652
+王家乙 13.2075304714
+鲁托斯 13.2075304714
+同等条件 11.7034530746
+前清 10.5684731418
+宋畏晋 13.2075304714
+乙酰螺旋霉素 13.2075304714
+想个办法 10.3453295905
+数声 10.4994802703
+半流体 12.8020653633
+长沙县 11.1280889297
+简正模式 13.900677652
+贾珍想 12.5143832909
+别吓唬 11.9547675029
+赵青 11.9547675029
+中国围棋协会 13.2075304714
+分镜头 11.9547675029
+扭亏 8.51618258919
+卵式生殖 12.1089181827
+严重后果 9.62401153296
+跷起 11.1280889297
+玻璃状 12.1089181827
+重心 7.54630761118
+军语 13.2075304714
+养神 10.1394775363
+二等 9.33632946051
+石油部门 12.1089181827
+寿翁 12.5143832909
+后襟 11.8212361103
+孤拔 11.2616203224
+孤拐 11.1280889297
+拙劣手段 13.900677652
+多风 10.2371160058
+漕泾 12.1089181827
+貉子 12.1089181827
+严重性 9.36807815882
+蜜橘 10.5684731418
+念咒 9.98865464655
+溶剂 8.51160592216
+如前所说 13.2075304714
+千万人次 12.8020653633
+零起 13.900677652
+投机倒把 10.4349417492
+乾闼婆 13.900677652
+空白行 13.2075304714
+权且 9.40086798165
+交易额 8.97342396682
+不世出 12.1089181827
+韦玄成 12.5143832909
+脉络贯通 13.900677652
+好清 13.900677652
+权为 10.9562386728
+阎君 11.3357282945
+前列腺炎 10.1871055853
+百重 13.2075304714
+程瑛 13.900677652
+沙井子 12.1089181827
+蛲虫 11.3357282945
+卡罗林 12.8020653633
+晚婚晚育 12.5143832909
+中近程 12.2912397395
+漕河 10.3171587135
+贪墨 9.55687223012
+绝非易事 11.8212361103
+多颗 10.2630914922
+联审 12.8020653633
+精打细算 10.7226238216
+铁布衫 12.5143832909
+舒服些 12.1089181827
+民以食为天 11.0103058941
+空调器 11.0674643079
+庚款 12.8020653633
+重塑 9.63799777493
+大冶县 12.8020653633
+三千余匹 13.2075304714
+元老院 9.58318953844
+解放区 8.44963919841
+贾母忙 11.0674643079
+赵献子 12.8020653633
+二簧 10.9049453784
+阶梯形 11.2616203224
+禾田 13.2075304714
+广信军 12.5143832909
+美中关系 11.3357282945
+景观规划 12.2912397395
+裂孔 11.4157710022
+时隔多年 11.7034530746
+王忠肃 13.2075304714
+援手 10.5684731418
+手巧 11.5027823792
+乐毅则 12.8020653633
+方夜潭 13.900677652
+恐怖组织 11.1926274509
+可疑分子 13.2075304714
+六七户 13.900677652
+活死人 13.2075304714
+武珞路 13.2075304714
+藕片 13.2075304714
+经献忠 12.8020653633
+楠梓 11.4157710022
+多项 7.73525979774
+杨想 11.1926274509
+结合部位 12.2912397395
+多页 11.3357282945
+风情画 13.2075304714
+传输网 13.900677652
+寄往 11.3357282945
+情况表 11.1280889297
+出类拔萃 10.0940151622
+关停 9.75754292558
+稳定剂 10.8096351986
+九瓶 13.900677652
+分束器 13.2075304714
+打带跑 13.900677652
+忽明忽暗 10.2630914922
+二米 12.5143832909
+来头 9.61021821083
+权仗 12.8020653633
+二类 9.65218240993
+四五遍 13.900677652
+都钦慕 13.900677652
+来复 12.1089181827
+技正 11.1926274509
+本格拉 11.598092559
+唐仆尚 12.8020653633
+克莉丝 13.900677652
+进程同步 13.900677652
+内部单位 13.900677652
+代数数域 11.9547675029
+阶梯式 10.1630080337
+研发部 11.0103058941
+沙变金 12.8020653633
+汜滥 13.900677652
+心理战 10.9562386728
+错误处理 13.900677652
+狐朋狗友 11.8212361103
+关健 12.2912397395
+斯科菲尔德 12.2912397395
+重大 5.40389127034
+地中海 7.32281629425
+毫无价值 10.7226238216
+马迹 13.900677652
+茬子 11.7034530746
+杜奥蒙 13.2075304714
+解放前 9.34680076038
+乔西奇 13.2075304714
+百部 11.1926274509
+重头 10.765183436
+治污 10.765183436
+拜我为师 13.2075304714
+黄陂县 12.2912397395
+贝桑松 11.7034530746
+语义学 10.765183436
+供膳宿 13.900677652
+关内 8.51618258919
+后辈 10.2630914922
+弋阳腔 10.765183436
+藏医院 12.5143832909
+路归路 12.5143832909
+重复 6.91688768672
+关冲 12.5143832909
+位于 4.96609078159
+灵活经营 13.2075304714
+编曲 12.2912397395
+弱女子 10.8561552143
+八段 12.5143832909
+吠叫 11.1926274509
+养羊 10.8096351986
+权位 10.3171587135
+治水 9.58318953844
+核计划 11.8212361103
+愁云 10.4666904475
+古生物学家 10.642581114
+西部旅游 13.900677652
+枪支 9.45802639549
+乌兰诺娃 11.8212361103
+玻璃球 11.4157710022
+协奏曲 9.17328983326
+后述 13.900677652
+收支平衡 9.22784881751
+多首 10.0294766411
+多千 12.8020653633
+贾政笑 10.8561552143
+治民 10.604840786
+清溪 9.77354326693
+朝南面 13.2075304714
+砾岩 9.5186510173
+曾文坝 12.8020653633
+重奏 10.4994802703
+氟尿嘧啶 12.8020653633
+后进 9.87532596124
+积弊已久 13.2075304714
+李十儿 12.2912397395
+钢丝 9.74179456862
+六尺 10.4041700905
+职业杀手 13.900677652
+贪好 13.900677652
+几十步 11.0103058941
+利润额 11.1926274509
+猴脑 12.1089181827
+钢件 12.2912397395
+黄陂区 13.900677652
+你家 7.79588441956
+黑烟 9.19114745066
+啤酒杯 12.5143832909
+稳定化 12.1089181827
+公孙渊 10.9562386728
+树坑 12.5143832909
+八次 10.2371160058
+玻璃瓶 10.3171587135
+联婚 12.8020653633
+公开 5.61440819919
+治法 9.35738286971
+焉用 12.5143832909
+国史 9.40086798165
+铁路工程 10.642581114
+三要素 10.9562386728
+气象卫星 10.1630080337
+市场策划 11.7034530746
+中国跳水队 12.8020653633
+刮脸刀 12.8020653633
+根廷 13.900677652
+共商国事 11.9547675029
+八款 12.2912397395
+选号费 13.900677652
+文待诏 13.2075304714
+治河 10.0294766411
+几十次 11.0674643079
+战威 13.900677652
+就业人口 10.1164880181
+律师资格 10.533381822
+后轮 10.1630080337
+鬼不觉 11.3357282945
+治治 11.9547675029
+惯性质量 11.598092559
+蒙番宣 13.2075304714
+顾广圻 13.2075304714
+扯走 12.5143832909
+刑政 11.8212361103
+劳务输出 10.9562386728
+邱乙郎 13.2075304714
+运输工具 9.37888907493
+关元 11.9547675029
+强藩巨 12.8020653633
+贪大 12.1089181827
+后轴 11.4157710022
+几十款 13.900677652
+捡开 13.900677652
+幸不辱命 13.900677652
+循环不断 13.900677652
+八步 11.1926274509
+王母池 12.8020653633
+关关 12.1089181827
+胡一刀 12.2912397395
+东山镇 11.8212361103
+西艺知 12.8020653633
+绲边 13.2075304714
+国士相 13.2075304714
+平衡 6.05565323473
+建房 9.25628675283
+秩和 12.8020653633
+皮制品 11.8212361103
+关公 8.58747167293
+关入 11.4157710022
+杰出成就 11.7034530746
+说短论长 13.900677652
+二级 6.30077569277
+孤本 10.9562386728
+石秀便 11.2616203224
+联姻 9.23723855786
+孤木 13.900677652
+风凉话 10.8561552143
+创世神 11.8212361103
+测试法 11.9547675029
+旱涝 9.66657114738
+心血来潮 10.1164880181
+多高 9.31571017331
+情缘 10.9049453784
+拦在 10.642581114
+二线 8.01735526349
+解放党 11.9547675029
+马利亚 11.3357282945
+安道尔公国 12.5143832909
+好气 9.85762638414
+呼伦湖 10.6818018271
+麦其 8.34771806705
+宋仁宗庆 11.7034530746
+差池 10.0720362555
+秋刀鱼 12.8020653633
+三杯水 13.900677652
+期望值 10.0505300503
+够花 12.1089181827
+竭力支持 12.5143832909
+众口铄金 13.2075304714
+关务 12.8020653633
+寒酸气 13.900677652
+喀什 8.71889410168
+赵隆才 13.2075304714
+唐正 12.8020653633
+成为泡影 10.9562386728
+孟尼利 11.8212361103
+金点子 13.2075304714
+来客 9.43476953332
+孤松 12.8020653633
+二维 9.20019728618
+来宾 9.65218240993
+房山石 11.9547675029
+智越 13.900677652
+漕溪 12.8020653633
+羽箭 10.1394775363
+二绿 13.900677652
+闻其香 13.2075304714
+情网 11.7034530746
+新体诗 11.598092559
+姬姓和 13.2075304714
+一零一 12.8020653633
+二组 10.9562386728
+来安 11.598092559
+王兴亚 13.2075304714
+狐朋狗党 13.900677652
+维多利亚湖 10.8561552143
+维护者 11.4157710022
+剃发令 11.0103058941
+派车来 13.2075304714
+乱摸 10.8096351986
+好汉 7.72689154807
+重婚 11.598092559
+御史中丞 9.75754292558
+冰结 12.2912397395
+八栋 12.1089181827
+文学家 8.44963919841
+秦司马错 12.5143832909
+好油 13.2075304714
+决赛圈 11.9547675029
+不堵车 12.8020653633
+广播级 13.900677652
+开转 12.8020653633
+贪婪 8.30969067146
+陈永文 12.5143832909
+目无法纪 12.5143832909
+关切 8.28390655431
+龙图阁 11.1280889297
+中央革命根据地 9.69598503258
+卓文君 11.9547675029
+总经办 13.900677652
+隐身人 12.5143832909
+音标 11.4157710022
+关到 10.8561552143
+几十桌 12.8020653633
+小分队 9.46986085313
+专程来 11.4157710022
+老本儿 11.3357282945
+八样 12.8020653633
+凡延光 13.2075304714
+多包 13.2075304714
+蛰虫 13.900677652
+八根 11.5027823792
+八杯 13.900677652
+谙达 10.4666904475
+昏愚 13.900677652
+梅朗中 9.00283785202
+明军入 12.5143832909
+寿与天 13.900677652
+质疑问难 13.900677652
+王安石 8.96620371885
+宗与笃 13.2075304714
+李岩见 11.9547675029
+黑点儿 12.8020653633
+松德桥 12.8020653633
+八桌 12.8020653633
+南威岛 11.9547675029
+衣着打扮 11.9547675029
+几十样 12.1089181827
+联大 9.91169360541
+大起大落 8.83808261895
+韩兰根 13.900677652
+沙奶奶 13.2075304714
+解放军 7.93967231235
+若存若亡 13.900677652
+瓜豆 13.900677652
+仪陇 12.2912397395
+抽搐起来 11.4157710022
+聊表心意 13.2075304714
+赏识 8.43684584695
+吴大娘 13.2075304714
+几十栋 13.2075304714
+竹枝词 12.1089181827
+夏舒 13.2075304714
+宋梅村 12.8020653633
+亚穆苏克罗 12.1089181827
+轩辕帝 13.2075304714
+树名 12.8020653633
+蝶舞 12.2912397395
+凯巴鲁斯 13.2075304714
+萨拉齐 11.9547675029
+关原 13.2075304714
+认同度 10.3453295905
+预制构件 12.8020653633
+栉比 11.1280889297
+四十四万九千八百镑 13.2075304714
+天坛生物 9.27570483869
+丘吉尔 9.13850371718
+玉山寨 12.5143832909
+牛拉犁 12.8020653633
+道县 11.9547675029
+后足 10.3743171274
+侍唐廷 12.8020653633
+公心 11.7034530746
+孟抑荀 13.2075304714
+速溶 11.9547675029
+束手就缚 13.2075304714
+当事方 11.5027823792
+雕塑系 13.900677652
+医学工程 12.8020653633
+孤星 11.9547675029
+索绪尔 11.1926274509
+夏洛滕 11.9547675029
+乌溪江 11.5027823792
+玄德闻 10.6818018271
+关厢 11.7034530746
+枪杆 10.765183436
+枪杀 9.61021821083
+孔复古 13.900677652
+义犬 13.2075304714
+冲压 9.66657114738
+林苑派 13.2075304714
+重学 12.5143832909
+富民路 12.5143832909
+后路 8.98069672615
+熬煎 9.53122979951
+影带 13.900677652
+无力招架 13.2075304714
+精氨酸 11.8212361103
+速滑 12.1089181827
+凌夷 13.2075304714
+作业管理 13.2075304714
+宗道 12.5143832909
+小圆孔 12.2912397395
+门扇 9.72629038208
+破碎机 11.9547675029
+邵逸夫 11.2616203224
+你好 7.95787827685
+厦门日报 13.2075304714
+俗套 10.9562386728
+广播网 9.94943393339
+尼日尔共和国 13.900677652
+贪官 9.00283785202
+夫妻恩爱 12.5143832909
+以功覆过 12.8020653633
+面有难色 11.4157710022
+编撰 9.10488710638
+王子生平 13.900677652
+重子 10.3453295905
+浮游生物 9.22784881751
+契诃夫 10.0940151622
+布什总统 11.4157710022
+重孙 11.0674643079
+芳香族化合物 11.1926274509
+官家先 12.2912397395
+分内事 13.2075304714
+波罗僧 12.8020653633
+曹国公 12.5143832909
+体育史 12.2912397395
+赵全德 13.900677652
+身家清白 12.8020653633
+公孙氏 13.2075304714
+细情 13.2075304714
+两大阵营 10.765183436
+技校 11.1926274509
+吴刚伐桂 12.8020653633
+六百六十三万亿元 13.2075304714
+刑杖 12.2912397395
+蒋勤勤 13.2075304714
+妆点 12.5143832909
+赵九章 13.2075304714
+张关羽 10.1164880181
+博格 11.1926274509
+伊比 13.2075304714
+博根 13.900677652
+倒履相迎 12.8020653633
+重宝 11.3357282945
+核竞赛 13.900677652
+耐酸 10.3743171274
+白辛苦 12.8020653633
+一百瓦 13.900677652
+眼面前 11.1280889297
+枪架 11.2616203224
+房水 12.1089181827
+关南 12.8020653633
+教头 9.13850371718
+方孔圆 12.8020653633
+谐戏 13.900677652
+向来都是 10.533381822
+最高 5.13975427564
+网络管理员 12.5143832909
+反垄断法 11.598092559
+情结 9.59661255877
+后起 10.2371160058
+枪枝 12.2912397395
+波利尼西亚 9.75754292558
+公忠 12.8020653633
+情绪 6.05682901382
+临界温度 10.4041700905
+帅诸羌 13.2075304714
+枪林 12.5143832909
+刑期 9.96885201925
+黑斑蚊 13.2075304714
+房氏 13.2075304714
+卡异尔 12.8020653633
+欢笑 9.72629038208
+诸臣之 12.8020653633
+杜工部 11.2616203224
+关卡 9.94943393339
+铁脚 12.8020653633
+散装白酒 13.2075304714
+鼠窜 11.9547675029
+八楼 12.2912397395
+训练任务 11.8212361103
+情意 9.56994431169
+注油 13.900677652
+粗布 10.0294766411
+数处 10.533381822
+中央文件 11.2616203224
+服勤 13.900677652
+好爽 13.900677652
+天下兴亡 11.8212361103
+杨洁篪 12.5143832909
+增强塑料 11.2616203224
+车门 8.59737274392
+情感 7.45020722983
+钢印 12.8020653633
+养护 9.29550746599
+宁凌噶 12.2912397395
+很感兴趣 9.80633308975
+陇海线 10.604840786
+鼎足 11.8212361103
+摘胆剜心 13.900677652
+编篡 12.5143832909
+权利 6.49944638756
+蝇头 12.8020653633
+叩齿 12.1089181827
+情愫 11.1926274509
+东寻西 13.2075304714
+钢协 8.81308131674
+几十盏 12.5143832909
+情愿 8.07763175649
+周文重 11.7034530746
+尼古拉 9.74179456862
+主题性 9.91169360541
+铿锵 9.72629038208
+止咳剂 13.900677652
+训练舰 11.598092559
+狂妄 9.38981814546
+专家门诊 11.9547675029
+尼日利亚人 12.8020653633
+罪恶感 12.2912397395
+八盆 13.2075304714
+锦标赛 8.58255765813
+多里安 11.5027823792
+租售 10.1394775363
+八盏 12.8020653633
+别吓人 13.2075304714
+叶落归根 11.8212361103
+八盒 13.900677652
+阿奴律 12.1089181827
+编算 11.7034530746
+不能忘怀 10.765183436
+概括地说 11.9547675029
+八盘 11.1926274509
+妒恨 12.8020653633
+光说不做 13.2075304714
+钢包 13.2075304714
+开边 11.3357282945
+古公卒 12.5143832909
+步兵营 9.7898037878
+落叶树 11.9547675029
+披在 9.85762638414
+八目 13.2075304714
+黑不溜秋 12.8020653633
+百越 9.71102290995
+工程机械 8.83177344976
+沈学明 13.2075304714
+渣滓 10.9562386728
+迎宾馆 12.8020653633
+从茶蓬 13.2075304714
+兴隆山 11.3357282945
+忻喜 13.2075304714
+油性皮肤 11.2616203224
+团结 7.3741827924
+维多利亚港 11.0674643079
+李四 10.765183436
+最薄 11.9547675029
+简明扼要 10.5684731418
+财雄势大 13.900677652
+帕托尼 13.900677652
+顽疾 10.3171587135
+注水 10.2371160058
+审计部 12.5143832909
+供应价格 12.2912397395
+库恩 11.1280889297
+决策支持系统 11.598092559
+河阳温 13.2075304714
+优酪乳 13.2075304714
+丞相 7.35245854921
+处世之道 13.2075304714
+不测之祸 11.4157710022
+顾面子 12.2912397395
+宁胡 12.5143832909
+粗度 13.2075304714
+养成 8.1386262692
+巢内 10.4666904475
+内蒙古草原 10.9562386728
+小耳朵 12.2912397395
+浓缩汁 13.900677652
+减省 11.4157710022
+放浪不羁 13.2075304714
+戒指 8.59737274392
+权势 8.13235665618
+杨慎 11.2616203224
+贾老六 12.5143832909
+遵守纪律 11.3357282945
+可分性 11.9547675029
+恩泽深厚 13.2075304714
+分区制 13.900677652
+穿山 10.6818018271
+巴拉斯 12.1089181827
+历官工 13.2075304714
+付帐 13.2075304714
+花招儿 12.8020653633
+谢多夫 12.5143832909
+百货 7.86519621945
+组合港 13.2075304714
+瞪目结舌 13.900677652
+好狗 12.1089181827
+田多主 13.2075304714
+锦西市 12.8020653633
+受礼 10.765183436
+奴家 8.74738605748
+朋辈 11.9547675029
+宁肯 9.38981814546
+韩女士 12.2912397395
+徐宏祖 12.8020653633
+顽症 11.7034530746
+圣佩德罗 11.8212361103
+条分缕析 11.598092559
+开眼界 10.765183436
+旱獭 10.5684731418
+八百 9.28555713513
+邢国公 12.8020653633
+血压计 11.4157710022
+武修和尚 13.2075304714
+侯风 13.2075304714
+马上坡 13.2075304714
+化工业 10.8096351986
+忘乎所以 10.4666904475
+情态 10.4994802703
+屠赞巴 13.2075304714
+王称君 12.8020653633
+情思 10.3453295905
+道口 9.93038573842
+广巡阅 13.2075304714
+河南人 9.20019728618
+梁春尽 13.2075304714
+六大类 11.5027823792
+位势 10.8561552143
+土地证 11.0103058941
+刑科 11.4157710022
+长条状 11.1280889297
+耶夫斯基 10.642581114
+锯齿状 10.2371160058
+诫条 13.2075304714
+情急 9.94943393339
+白城市 11.598092559
+狂士 12.1089181827
+王杀休 12.5143832909
+注消 13.900677652
+略识之无 13.900677652
+夏花 13.900677652
+农用品 13.2075304714
+清真寺 8.46259834305
+本联 13.900677652
+钟乳石 10.765183436
+妒意 11.9547675029
+奴婢 7.45654639528
+李大官人 12.2912397395
+安蒂利 13.900677652
+接入网 13.900677652
+公用电话 11.1926274509
+宗地 11.3357282945
+钢制 10.4349417492
+技监 13.2075304714
+差猜 12.8020653633
+真菌学 12.2912397395
+贾希兹 12.1089181827
+全国公安 13.900677652
+辩护权 11.8212361103
+大众公司 12.5143832909
+龙华路 12.5143832909
+钢刀 9.69598503258
+山鲁佐 12.8020653633
+贾政未 13.2075304714
+从不间断 12.1089181827
+普罗米修斯 10.3453295905
+这些年来 8.77671367257
+金山岭 12.5143832909
+人在江湖 12.1089181827
+威克岛 11.8212361103
+谁家 8.34384959028
+夫妻店 11.4157710022
+正常式 12.5143832909
+中华人民共和国国务院 10.8096351986
+大肆挥霍 12.2912397395
+人机环境 13.900677652
+富格尔 13.2075304714
+卡梅申 12.8020653633
+通货 9.19114745066
+资质审查 13.900677652
+玻璃棒 11.8212361103
+王兴兵 13.2075304714
+燃料油 8.9102450652
+独流镇 11.7034530746
+通贡 11.4157710022
+伊文思 11.9547675029
+雷厉风行 10.3171587135
+好玩 9.01032852375
+赏钱 9.96885201925
+道友 12.5143832909
+栾菊杰 13.2075304714
+掌握分寸 12.1089181827
+二意 11.8212361103
+稷米 13.900677652
+黄巾起义 10.0720362555
+波列西 13.2075304714
+位列 7.89926277401
+医务所 12.8020653633
+石玉昆 12.5143832909
+毛笔画 13.2075304714
+暂态过程 13.2075304714
+沈丹线 11.9547675029
+郫县 11.598092559
+老太婆 9.37888907493
+折页 12.5143832909
+知识产权局 11.9547675029
+娘家人 10.9562386728
+粗心 10.1630080337
+烯丙基 12.2912397395
+匈奴血 13.900677652
+编程 9.84023464143
+卷积云 11.9547675029
+刑礼 12.8020653633
+马利克 11.8212361103
+开始曲 13.2075304714
+清醒过来 8.91707103027
+权变 11.0674643079
+超螺旋 13.2075304714
+赏银 10.0720362555
+螯合树脂 11.8212361103
+我行我素 10.4994802703
+捱着 11.8212361103
+诸本讳 13.2075304714
+悬河泻水 13.2075304714
+起源地 11.0674643079
+东岳庙 10.604840786
+博白 12.8020653633
+春风化雨 13.2075304714
+马利兰 12.8020653633
+博登 13.900677652
+注浆 12.1089181827
+刘中垒 13.900677652
+饭馆儿 12.8020653633
+瑟瑟 9.82314020807
+消息报 10.642581114
+绵阳市 10.5684731418
+雅虎将 12.8020653633
+贾希利 12.5143832909
+元丰郡 13.2075304714
+训练者 13.2075304714
+如花美眷 12.5143832909
+北大中文系 12.8020653633
+风流罪过 13.2075304714
+美军基地 11.7034530746
+渣油 11.2616203224
+马萨乔 11.9547675029
+崭露头角 10.0088573539
+速率 8.37522471284
+颓垣败壁 13.900677652
+运输工人 12.2912397395
+花团锦簇 10.4349417492
+关了 9.18217878068
+看手相 12.8020653633
+服装 6.93654203956
+关人 12.2912397395
+王叔文 11.4157710022
+好几十张 13.2075304714
+书香 11.3357282945
+舞蹈队 11.5027823792
+手制动器 12.2912397395
+焦遂 13.2075304714
+库拉 11.2616203224
+澳门国际机场 13.2075304714
+书馆 11.598092559
+醺醺然 13.2075304714
+关亡 13.900677652
+神奇莫测 13.900677652
+挤上去 11.8212361103
+二折 13.2075304714
+后部 8.09554268306
+宜城亭 12.8020653633
+包络线 13.900677652
+观象台 10.9562386728
+蝇子 12.1089181827
+殷直阁 13.2075304714
+电子出版 12.1089181827
+曲意奉迎 13.900677652
+恶性事故 12.8020653633
+吊嗓 13.900677652
+技痒 11.598092559
+尖啸 11.4157710022
+轰起来 12.8020653633
+孙先生 9.36807815882
+奶油味 13.900677652
+注满 10.8561552143
+熬汤 11.5027823792
+二担 13.2075304714
+测试点 12.8020653633
+巴拉望 12.1089181827
+费尔南 12.5143832909
+克赖斯特彻奇 12.2912397395
+回归方程 13.900677652
+任建新 12.8020653633
+冠盖如云 13.2075304714
+马上吟 12.8020653633
+纷纭复杂 13.900677652
+乳酸饮料 12.5143832909
+国家自然科学基金 12.8020653633
+明宗设 13.2075304714
+炼石补天 12.5143832909
+百辆 10.9049453784
+庚申 11.4157710022
+积累基金 10.8096351986
+百载 12.8020653633
+关东 9.19114745066
+蜜瓜 12.5143832909
+好点 10.1871055853
+五日京兆 13.900677652
+关下 10.765183436
+关上 8.20358416547
+博生 13.2075304714
+养性 10.6818018271
+马王爷 12.5143832909
+二房 10.3171587135
+多虑 10.3171587135
+卫生习惯 10.6818018271
+传播者 10.765183436
+交汇处 8.99540287354
+工具机 11.1280889297
+后退 7.74158226348
+两用车 11.9547675029
+谦虚 9.37888907493
+谣言 8.0484751722
+小学老师 11.9547675029
+飞行技术 12.8020653633
+英联邦 9.06439574502
+渔业局 13.900677652
+压根儿 9.02548032877
+关中 7.82303540863
+为您服务 11.9547675029
+蒙塔古 11.8212361103
+二战 8.29120585679
+库房 9.38981814546
+顽石 10.765183436
+农用地 11.1280889297
+各种因素 9.18217878068
+射阳河 13.2075304714
+老太太 7.2673592187
+好烦 13.2075304714
+关乎 9.17328983326
+生物圈 8.96620371885
+好热 13.900677652
+笔会 11.1280889297
+养息 11.7034530746
+宁芜 11.0103058941
+二批 11.8212361103
+干球温度 13.900677652
+蚂蟥 10.5684731418
+奥地利人 10.9049453784
+二所 13.900677652
+乌季达 12.8020653633
+福寿镜 13.2075304714
+榴弹 8.9308643524
+二手 9.53122979951
+伊索克拉 12.2912397395
+差点 7.77599426108
+莫悲兮 13.2075304714
+二打 12.8020653633
+徐爵嘻 13.2075304714
+徐爵嘴 12.8020653633
+戒慎 12.5143832909
+甄府里 13.2075304714
+后遗 13.900677652
+知名度 8.62767809341
+程武 13.2075304714
+卫生学家 13.2075304714
+赵颜 13.900677652
+文森特 12.2912397395
+杨简 12.5143832909
+交流经验 12.1089181827
+一颗颗 10.1871055853
+时兵民 13.2075304714
+装备精良 10.3171587135
+乱放 10.4994802703
+麻省理工学院 9.93038573842
+马超之 12.5143832909
+穿堂风 12.8020653633
+宁荣 11.598092559
+思想倾向 10.0294766411
+穿得 9.4233408375
+霍尔穆 13.900677652
+宗谭 13.2075304714
+得不到 7.79588441956
+编磬 12.5143832909
+练家子 13.900677652
+王世隆 12.8020653633
+宗谷 11.9547675029
+二排 13.2075304714
+宗谱 11.5027823792
+公干 10.0088573539
+歧义 11.4157710022
+座圈 12.1089181827
+泳坛 13.2075304714
+马语 13.2075304714
+李椿年 13.2075304714
+太功利 13.900677652
+藤吉郎 13.900677652
+权充 12.1089181827
+神秘物质 13.900677652
+比较完善 10.1164880181
+顽癣 13.2075304714
+谣诼 12.2912397395
+胳膊拧不过大腿 12.5143832909
+竞今疏古 13.900677652
+彰德 10.4349417492
+被选人 13.2075304714
+后里 13.2075304714
+折射式 13.2075304714
+蒙巴萨港 12.5143832909
+政治派别 10.5684731418
+五头 13.2075304714
+休斯敦大学 13.2075304714
+有旋电场 10.8561552143
+青皮竹 13.2075304714
+陈各代 12.8020653633
+顶回 12.5143832909
+后金 9.54396882529
+顺反子 12.8020653633
+穿心 11.9547675029
+大良平 13.2075304714
+受压迫 10.533381822
+不解事 13.2075304714
+蚂蚁 8.76487921493
+管理决策 11.7034530746
+拖斗 12.5143832909
+银行资本 8.74162235276
+盖帘 13.900677652
+半开化 13.900677652
+璧月 13.2075304714
+投机事业 12.8020653633
+吊吊 12.2912397395
+夏洛特 11.9547675029
+穿弦 13.900677652
+顽皮 9.34680076038
+座垫 10.9562386728
+转祸为福 12.1089181827
+宿鸭湖 12.2912397395
+抬起头来 7.89432449237
+情报 7.58170953823
+好熟 12.1089181827
+科学实验 10.0505300503
+出冷汗 11.1926274509
+佳木斯市 11.1926274509
+棋社 13.900677652
+八甲 12.5143832909
+外来者 11.4157710022
+页岩 8.60737282725
+蚂蚱 9.7898037878
+三个代表 9.91169360541
+蒙薄桐 13.2075304714
+编码 8.9102450652
+书页 10.8096351986
+慎微 12.8020653633
+赵之战 13.2075304714
+保持足够 10.8561552143
+大烟囱 11.9547675029
+咱队 13.2075304714
+佩舍尔 13.2075304714
+黎城县 12.8020653633
+博瑞 11.5027823792
+关住 11.0674643079
+孤竹 11.5027823792
+釜底抽薪 10.5684731418
+枪管 9.20932976975
+被选为 8.0285598625
+蒜头 10.9049453784
+孤立 7.88696249593
+八番 11.7034530746
+招贤纳士 11.1280889297
+外营力 10.642581114
+旱灾 9.41204128224
+木格儿 13.900677652
+霍尼韦尔 11.7034530746
+十万天 11.1280889297
+龙游曲沼 13.900677652
+惹人厌 13.2075304714
+菜心 12.5143832909
+义熙 10.604840786
+铜精矿 11.598092559
+关键所在 9.71102290995
+钢坯 9.98865464655
+截至 5.49285299761
+共聚合 11.3357282945
+严峻性 12.1089181827
+爆破作业 12.1089181827
+豆腥味 13.2075304714
+希米 12.5143832909
+白云质 11.598092559
+戊申 12.8020653633
+欢情 12.5143832909
+京山县 11.8212361103
+穿墙 12.1089181827
+伊文斯 12.2912397395
+狸子 9.87532596124
+于阔端 13.2075304714
+多能 9.98865464655
+执行机构 9.85762638414
+温克尔曼 12.8020653633
+吴乃武 13.2075304714
+风雨晦暝 13.900677652
+奥墨冬 13.900677652
+相吕嘉 13.2075304714
+新都区 13.900677652
+贡献力量 9.91169360541
+情敌 10.9049453784
+欢悦 10.4041700905
+减肥餐 13.2075304714
+剩余产品 8.65365357982
+门诊病人 12.2912397395
+备胎 10.9562386728
+衔冤负屈 13.2075304714
+树人 12.8020653633
+七点钟 11.1280889297
+汇聚 8.9102450652
+花针 13.900677652
+山木自寇 13.900677652
+阴河中 13.2075304714
+重新召集 13.2075304714
+专员公署 11.3357282945
+倍受欢迎 13.2075304714
+龙胜县 12.8020653633
+于永 13.2075304714
+秒钟 8.9308643524
+程氏 11.1926274509
+多股 11.2616203224
+后集 11.598092559
+多肽 10.2897597393
+妳是 13.900677652
+张孟谈 13.900677652
+监视系统 11.1926274509
+吊古 11.7034530746
+植物体 8.79473217808
+布尔萨 11.3357282945
+双乳 10.8096351986
+速生 10.2897597393
+法律责任 9.04086524761
+过弯 11.598092559
+有色眼镜 12.5143832909
+阿荣旗 11.598092559
+托尔高 12.5143832909
+宋淮西 12.8020653633
+披发 10.2630914922
+美国航空航天局 12.1089181827
+闸板 12.8020653633
+多聚 11.1926274509
+四有 12.5143832909
+后防 11.9547675029
+利比里亚 10.0505300503
+砍死 9.66657114738
+磁卡电话 13.2075304714
+言者无罪 12.2912397395
+多尊 11.9547675029
+几十片 13.2075304714
+重大成果 11.1280889297
+钢城 12.2912397395
+可收回 11.2616203224
+挂一挂 13.900677652
+谣谚 11.7034530746
+八爷 9.6811699468
+老身 9.85762638414
+治病 8.230796729
+烂柯山 12.5143832909
+围上去 11.0674643079
+交易者 9.80633308975
+宗论 11.2616203224
+履霜知冰 13.900677652
+劳碌命 13.2075304714
+丰镇厅 13.2075304714
+矢忠 11.4157710022
+软膏剂 13.2075304714
+多者 9.21854642485
+后院 8.44535653662
+八版 12.8020653633
+多老 12.2912397395
+百褶 12.1089181827
+解放鞋 11.1280889297
+亵渎 9.91169360541
+戒条 11.7034530746
+宁蒗 11.7034530746
+陆奥皱 13.900677652
+宁蒙 13.2075304714
+生活气息 9.65218240993
+树丫 12.5143832909
+鲁肃入 11.9547675029
+萨克领 13.2075304714
+办公建筑 12.8020653633
+歇凉 11.598092559
+夏与贵 13.2075304714
+牛奶糖 13.900677652
+塔斯马尼亚州 12.5143832909
+治疗 5.82447312474
+喧笑 13.2075304714
+树丛 9.41204128224
+三二十步 13.2075304714
+动手脚 11.7034530746
+竟是 7.49544919394
+矢志 10.533381822
+五十三两个 13.2075304714
+树下 8.49350588052
+规划院 11.2616203224
+赏金 11.0674643079
+会合处 11.8212361103
+麻雀战 11.3357282945
+二十三家 13.2075304714
+二斤 10.1164880181
+编练 10.0505300503
+编组 9.18217878068
+吴将军 11.0103058941
+编织 8.46259834305
+四男 12.8020653633
+斯瓦拉 12.5143832909
+协调者 13.2075304714
+罗本立 12.8020653633
+三思而后 13.2075304714
+多尔 10.1630080337
+黄淮海 11.598092559
+编结 10.4041700905
+程海 12.1089181827
+从登州 12.8020653633
+客运公司 10.765183436
+编绘 10.8096351986
+传媒界 12.2912397395
+防滑装置 13.900677652
+二方 12.1089181827
+蔡成勋 12.8020653633
+平尺 13.2075304714
+服过 11.1280889297
+万公里 8.88339781516
+房盖 12.8020653633
+测试软件 13.900677652
+二斗 11.0103058941
+红梅赞 13.900677652
+关门捉贼 13.900677652
+抽鼻子 12.2912397395
+杨德祖 12.5143832909
+赵永复 11.9547675029
+好看 7.59622884955
+那殿阁 12.8020653633
+萨之战 11.1926274509
+二日 9.36807815882
+二无 11.1280889297
+和珍儿 12.8020653633
+指标值 12.8020653633
+济困 11.8212361103
+栾平 13.2075304714
+八珍 11.1280889297
+火上浇油 10.4041700905
+爆炸案件 13.2075304714
+敬请原谅 13.2075304714
+库斯 11.2616203224
+差旅费 11.3357282945
+起义军 7.87239913175
+程派 12.5143832909
+截肢 10.3453295905
+最巧 11.9547675029
+篦子 11.598092559
+玻璃水 12.8020653633
+十六周岁 13.900677652
+生死不渝 11.9547675029
+正等待 10.0505300503
+原于 12.1089181827
+三字经 10.8561552143
+自销 12.1089181827
+吹袭 11.9547675029
+电脑公司 11.9547675029
+立特勤 12.8020653633
+地理纬度 11.5027823792
+自由民主党 10.765183436
+治理 6.72365888607
+服输 11.0674643079
+昆特 13.2075304714
+蜜柚 13.900677652
+规规矩矩 10.0088573539
+吴于稷 13.2075304714
+快捷酒店 13.2075304714
+畅销商品 12.8020653633
+切削力 13.2075304714
+从勒尔 13.2075304714
+心囊 12.5143832909
+二支 11.5027823792
+服软 11.5027823792
+信息资讯 13.2075304714
+艾龙曲 12.5143832909
+专一性 10.3453295905
+怪声怪气 11.8212361103
+码子 11.5027823792
+位居要津 12.8020653633
+安康 9.35738286971
+码字 12.5143832909
+标准语 10.8096351986
+多腔 12.8020653633
+甲状腺 8.99540287354
+蒂罗尔州 12.8020653633
+杨可胜 10.8561552143
+跪叩 11.4157710022
+慎始 13.2075304714
+塔斯马尼亚岛 11.3357282945
+巨蟹座 11.9547675029
+啤酒罐 13.2075304714
+稽察 11.3357282945
+差矣 9.62401153296
+吊到 11.2616203224
+最肯 13.2075304714
+斯瓦扬 12.5143832909
+轩将军 12.2912397395
+于池 13.900677652
+百行 12.2912397395
+国别 8.80081122415
+各人自扫门前雪 13.900677652
+马上发 12.5143832909
+竟来 11.5027823792
+策划师 12.2912397395
+垄断利润 10.3453295905
+博爱 9.59661255877
+比我强 11.5027823792
+情操 9.85762638414
+脸皮子 12.8020653633
+穿好 13.2075304714
+军制史 13.900677652
+杨扶 13.2075304714
+后面 6.10133425376
+维廷霍夫 13.900677652
+学术会议 10.5684731418
+多脂 12.8020653633
+栾廷 12.8020653633
+零钱 10.4666904475
+马行 11.5027823792
+诊脉 10.7226238216
+竟有 8.85725253506
+八一建军节 12.5143832909
+两大类 7.79588441956
+标准计 13.2075304714
+砥石 13.900677652
+笔供 13.900677652
+魏延至 13.2075304714
+旦角 10.6818018271
+汇至 12.1089181827
+博物 10.0294766411
+段业入 13.2075304714
+质因素 13.900677652
+欢愉 10.1394775363
+第五纵队 12.1089181827
+跆拳道 11.7034530746
+博特 11.8212361103
+曹真寨 13.2075304714
+革新党 12.5143832909
+大丰收 10.6818018271
+邱兹 12.8020653633
+黄石市 11.598092559
+周旋到底 11.9547675029
+姑苏 9.54396882529
+最能 8.81927328699
+情有 12.1089181827
+画饼充饥 12.1089181827
+实地考察 9.66657114738
+明文规定 9.58318953844
+花荣笑 12.8020653633
+刘卫辰 11.7034530746
+喀嚓 11.0103058941
+秉公而断 12.1089181827
+置之高阁 12.5143832909
+戒断 12.1089181827
+孙菲菲 13.900677652
+无色差 13.900677652
+白濛濛 13.2075304714
+乌尔里 13.900677652
+国家足球队 13.2075304714
+不断前进 11.2616203224
+易化性 13.2075304714
+训练营 10.7226238216
+组蛋白 11.5027823792
+舒婷 12.5143832909
+宝文阁 12.8020653633
+无庸 10.0294766411
+中庸之道 11.4157710022
+好球 11.9547675029
+八点 9.69598503258
+比赛服 13.900677652
+黏糊糊 11.5027823792
+赶集网 13.900677652
+款项 8.24468584116
+百论 12.1089181827
+万里行 11.5027823792
+寿康宫 13.900677652
+最后通牒 10.2371160058
+擦边球 10.1871055853
+蝶骨 12.2912397395
+截获 9.74179456862
+阎立本 10.604840786
+情杀 12.2912397395
+多节 11.0103058941
+朱大人 11.0674643079
+二曲 12.5143832909
+质询权 12.8020653633
+狂徒 11.3357282945
+诸道之 13.2075304714
+百计 10.8096351986
+达川 13.2075304714
+单称郎 13.2075304714
+无明业火 13.2075304714
+多芯 13.900677652
+张世文 13.2075304714
+任海 13.900677652
+多瘤病毒 13.900677652
+天山纺织 11.7034530746
+泼油救火 13.900677652
+躬耕 11.0674643079
+尤长于 10.765183436
+化合反应 13.2075304714
+既非 10.4994802703
+束革 13.2075304714
+多花 10.0294766411
+拦住 7.47095817394
+附着性 13.900677652
+散兵壕 13.900677652
+通谍 13.900677652
+二是 6.0615460037
+董树槐 13.900677652
+国家信访局 12.1089181827
+花开南 13.2075304714
+蓬托尔 12.1089181827
+半分钟 10.3171587135
+穷达 13.2075304714
+西凉军 11.8212361103
+寒风刺骨 12.1089181827
+假学历 13.900677652
+全民性 11.9547675029
+旱田 10.8561552143
+下女 12.8020653633
+款额 11.0103058941
+无线连接 13.900677652
+龚完敬 13.900677652
+特利萨 13.900677652
+应云卫 12.1089181827
+路过 7.96050639926
+公务员 7.95525704337
+坏小子 12.5143832909
+手三里 13.900677652
+二星 11.0103058941
+空相 13.2075304714
+闹房 12.1089181827
+塔夫绸 13.900677652
+严义明 10.6818018271
+泽西 12.5143832909
+于江 11.2616203224
+二晶 13.2075304714
+巴国 10.6818018271
+班公湖 13.900677652
+长沙人 10.642581114
+徐爵刚 13.2075304714
+卯时 10.8561552143
+颜二姓 13.900677652
+大殓 12.2912397395
+军医大 13.900677652
+举贤任能 11.9547675029
+鼓动风潮 13.900677652
+不冷不热 10.3171587135
+建筑功能 11.9547675029
+忽略 7.71652876104
+栾川 10.9049453784
+墙倒众人推 12.1089181827
+安检 10.3453295905
+粗壮 8.39941944143
+吊具 13.2075304714
+吊兰 13.2075304714
+普通股 8.69119149913
+庄大田 13.2075304714
+施塔特 10.9049453784
+粗声 11.598092559
+念书 8.93783302172
+寡言少语 12.1089181827
+凭感觉 10.533381822
+马杰农 13.2075304714
+带大 11.1926274509
+车毁人亡 12.5143832909
+朱砂莲 13.900677652
+好画 13.2075304714
+二架 12.8020653633
+多层板 13.2075304714
+卡勒瓦拉 12.2912397395
+暗中行事 13.900677652
+责权利 12.8020653633
+零陵 10.0940151622
+权证行 9.80633308975
+只租不卖 13.900677652
+篾条 13.2075304714
+陈宣帝 12.2912397395
+关於 12.8020653633
+好用 10.642581114
+粗大 8.4801426527
+马上先 13.2075304714
+程庭桂 13.900677652
+推推拉拉 12.2912397395
+诺和诺德 13.900677652
+子弹箱 12.5143832909
+好生 7.71652876104
+黑状 12.5143832909
+乌尔都 12.5143832909
+抹嘴 11.1926274509
+三四百里 13.900677652
+周文雍 12.8020653633
+库柏 12.1089181827
+丧尽天良 10.765183436
+竟日 12.8020653633
+拦下 10.5684731418
+二枚 11.1926274509
+程潜 11.1280889297
+后门 8.18694484647
+公孙瓒 10.1630080337
+反老还童 13.2075304714
+奴尔 12.1089181827
+逝者如斯 12.8020653633
+喀城 13.2075304714
+飞龙在天 12.5143832909
+新装修 12.8020653633
+竖眼 13.2075304714
+围拢过来 11.0103058941
+二柱 13.2075304714
+钱官铸 13.2075304714
+赏鉴 11.598092559
+情景 7.16489763773
+秋山萧寺 13.2075304714
+半节课 13.900677652
+致冷器 13.2075304714
+库林 13.2075304714
+闯荡 9.93038573842
+聪颖过人 13.900677652
+追忆往事 13.900677652
+王臣史 13.2075304714
+杜拉斯 11.9547675029
+王敬 11.9547675029
+云中君 13.2075304714
+瓜苗 13.900677652
+围棋比赛 13.2075304714
+二本 12.5143832909
+统治区 9.34680076038
+双手赞成 11.3357282945
+抚宁县 12.5143832909
+天气晴好 11.2616203224
+岸边 8.04560572977
+宽贷 12.8020653633
+博瀚 13.900677652
+创刊 8.46695564842
+麻四哥 12.1089181827
+燃放烟花 11.2616203224
+原苏联 10.7226238216
+人口基数 11.2616203224
+零集 13.900677652
+刑罚 8.35160156708
+黄培英 13.900677652
+慎密 12.5143832909
+扼腕痛惜 13.2075304714
+泽国 10.8561552143
+羽扇 10.5684731418
+二期 8.51618258919
+庚烷 13.900677652
+竟敢 8.66956903512
+山西化肥厂 12.8020653633
+念作 13.900677652
+二来 8.37124856446
+念佛 9.48183704418
+二条 10.533381822
+穷迫 12.8020653633
+余姚人 10.8561552143
+本属 9.45802639549
+服贴 12.2912397395
+斜过 12.8020653633
+宝马车 11.2616203224
+兜兜风 13.2075304714
+大同县 13.900677652
+乌尔逊 12.5143832909
+查索 13.900677652
+木下惠 12.8020653633
+花生油 9.89334446674
+二杆 13.900677652
+雅各布 10.9049453784
+穿孝 11.7034530746
+铜青 13.900677652
+五百四十万 13.2075304714
+伪冒 11.8212361103
+闵斯特 13.2075304714
+穿孔 9.23723855786
+用材林 9.33632946051
+两千余名 13.900677652
+好痛 12.2912397395
+上海浦东发展银行 11.598092559
+后镜 13.900677652
+码头 7.29402746578
+刘中军 12.8020653633
+耍威风 11.8212361103
+塞下曲 13.2075304714
+密歇根州 10.533381822
+权威 7.37858485381
+一表非凡 12.8020653633
+闽西南 11.7034530746
+长安少年 13.900677652
+砍柴 9.91169360541
+犹自 10.2630914922
+职称 9.87532596124
+凌乱 9.75754292558
+咨询 6.67811163315
+拾捡 12.2912397395
+用户数量 11.3357282945
+城市群 9.11318590919
+谢中堂 12.5143832909
+截距 13.2075304714
+胡慧中 13.2075304714
+联保 10.4041700905
+八级 11.598092559
+刑徒城 12.8020653633
+干线网 12.1089181827
+输配电 10.8096351986
+长策 11.4157710022
+编班 12.8020653633
+当机立断 9.61021821083
+詹善仆 13.2075304714
+心存疑惑 11.2616203224
+语不惊人死不休 12.8020653633
+最贵 9.35738286971
+颓废者 13.900677652
+八线 12.2912397395
+更比 13.900677652
+数学方法 9.65218240993
+逻格斯 13.900677652
+快进去 11.0103058941
+奴化 12.1089181827
+小蜀兵 13.2075304714
+七百余万 13.2075304714
+闽西北 11.1926274509
+治礼 13.900677652
+慢说 11.3357282945
+劲旅 9.91169360541
+缘缘 12.2912397395
+邮政储汇局 13.900677652
+咨议 10.8096351986
+咨讯 13.2075304714
+道格拉斯 9.96885201925
+恭祝 11.2616203224
+休闲业 13.2075304714
+外来语 11.598092559
+赛车场 12.2912397395
+房管 9.82314020807
+漏勺 12.8020653633
+田聪明 12.2912397395
+一三五 13.900677652
+戒毒 11.8212361103
+古纳特 13.900677652
+提供情报 11.598092559
+狂风怒吼 13.900677652
+君权神授 11.0674643079
+愁容 10.3743171274
+氢氧化铯 13.900677652
+揉面 11.3357282945
+库梅 12.8020653633
+嘉纳 12.5143832909
+减缩 11.0674643079
+计出万全 12.2912397395
+汉藏语系 9.5062284973
+暴殄天物 11.7034530746
+二样 13.900677652
+吊式 13.900677652
+王百合 13.900677652
+服色 9.89334446674
+生态灾难 12.8020653633
+改样 13.900677652
+噌噌噌 12.8020653633
+韩太太 7.72689154807
+二根 12.5143832909
+父子兵 12.1089181827
+南山路 12.8020653633
+忠直 11.3357282945
+砍杀 9.91169360541
+思如泉涌 12.8020653633
+广东地区 10.8561552143
+核能源 13.2075304714
+联体 11.2616203224
+波士顿大学 11.7034530746
+傅青主 13.2075304714
+狰狞面目 13.2075304714
+巴子生 13.2075304714
+庄客宰 12.8020653633
+牙髓腔 13.900677652
+减缓 8.22050504296
+书面形式 10.2371160058
+啥意思 10.0505300503
+戴凤翔 12.5143832909
+三千余户 12.5143832909
+多谈 10.1630080337
+二档 11.8212361103
+持续增长 7.88452049228
+营私作弊 13.900677652
+乌孙达 13.2075304714
+何渊源 13.900677652
+你们 4.73084682334
+黑狼 12.5143832909
+浑象 10.9049453784
+马斯基 12.5143832909
+枪炮 9.61021821083
+子公子 13.2075304714
+地平线 9.40086798165
+冰火 9.69598503258
+劲敌 9.69598503258
+博罗 10.765183436
+软体 10.7226238216
+尊容 11.1926274509
+名贵 8.28390655431
+动动脑 12.1089181827
+联会 11.1926274509
+起征 11.8212361103
+联众 13.900677652
+氢氧化铜 13.900677652
+自问 9.69598503258
+多谢 8.60737282725
+统计力学 10.3453295905
+招商引资 9.26594866375
+歇工 13.2075304714
+位子 8.82550383674
+风雨沧桑 13.900677652
+凌云 10.2630914922
+安弦 13.2075304714
+高宝湖 12.5143832909
+拾掇 9.96885201925
+司令 7.35389224122
+张廷辅 13.2075304714
+断层照相 13.900677652
+好几十名 12.5143832909
+新都市 13.900677652
+瑟罗 13.900677652
+黑色素瘤 11.5027823792
+作案动机 13.2075304714
+四十四丈 13.2075304714
+亚塔珠 12.5143832909
+卑鄙龌龊 12.5143832909
+融资券 9.20932976975
+组合柜 13.900677652
+挡过去 12.8020653633
+吊床 12.2912397395
+字母组合 12.8020653633
+发出信号 11.1926274509
+好笔 13.2075304714
+多路 9.11318590919
+好笑 8.41173992582
+养殖 7.71859274526
+文曲 12.8020653633
+双人 9.71102290995
+横行无忌 11.4157710022
+忧心如捣 13.900677652
+汇费 13.900677652
+安禄山 9.40086798165
+闯贼 8.60236028543
+鲣鸟 11.0103058941
+文艺演出 11.1280889297
+第八十八回 12.2912397395
+统计图 11.9547675029
+互有胜负 10.8096351986
+忠心耿耿 9.18217878068
+鲁班奖 12.1089181827
+羽泉 11.598092559
+热血沸腾 10.0505300503
+博纳 11.5027823792
+孤灯 11.2616203224
+丰镇市 12.1089181827
+帮派 11.7034530746
+十进位 11.1280889297
+直不笼统 13.900677652
+码型 12.5143832909
+维埃利 13.900677652
+院门 8.18694484647
+弗雷隆 13.2075304714
+食不甘味 12.1089181827
+补正 10.4041700905
+杨和陈 13.2075304714
+花花世界 11.1926274509
+联产 10.5684731418
+码垛 13.900677652
+米粒 10.0505300503
+谢家荣 13.2075304714
+官家真 13.900677652
+歇山 11.0674643079
+突尼斯 8.97342396682
+马上开 12.1089181827
+陆承祖 13.2075304714
+没有经费 13.2075304714
+捋虎须 12.1089181827
+瑟缩 10.604840786
+软件 7.35102690974
+黄棕色 12.8020653633
+玉铃卫 13.2075304714
+养母 10.5684731418
+别西姆 13.2075304714
+消毒柜 11.9547675029
+扎挣 10.765183436
+钻牛角尖 12.5143832909
+阿猫妈 12.5143832909
+服药 8.93783302172
+沿线 8.26588804881
+镰刀形 12.2912397395
+劫牢 11.7034530746
+好管 13.2075304714
+于登州 13.2075304714
+多赚 10.533381822
+权宜 11.1926274509
+脱不开 10.9049453784
+沃尔玛 9.40086798165
+舞蹈节 13.2075304714
+香港基本法 13.900677652
+乱扔 11.3357282945
+死而复苏 13.900677652
+铂电阻 12.2912397395
+空印 12.2912397395
+旱稻 10.533381822
+撤职处分 12.8020653633
+武汉市 8.83177344976
+天朗气清 11.8212361103
+刘羲叟 13.2075304714
+权宿 13.900677652
+天鹰 12.5143832909
+星落云散 11.5027823792
+吊带 11.4157710022
+多起 9.59661255877
+零食 9.84023464143
+宁要 12.2912397395
+寿穴 13.900677652
+高建民 13.2075304714
+凌侮 12.1089181827
+恒常 11.8212361103
+昂昂溪区 13.2075304714
+平气静 11.4157710022
+改日再来 11.7034530746
+欢洽 11.598092559
+二楼 8.63281949291
+院长 6.50987913024
+杨诚竟 12.5143832909
+陈安邦 13.900677652
+龙图腾 13.900677652
+诊费 11.8212361103
+四十四代 13.2075304714
+后魏 11.0103058941
+见不着 9.7898037878
+训练课 12.5143832909
+沛郡 12.2912397395
+那小红 13.900677652
+霍氏权 13.2075304714
+太祖 8.53470163695
+速算 13.900677652
+阿喇古 13.2075304714
+生力军 9.96885201925
+来信 8.62767809341
+众目睽睽 9.94943393339
+庄客备 13.2075304714
+折射器 13.900677652
+八粒 12.5143832909
+贾惜春 12.8020653633
+光泽感 13.2075304714
+砥砺 10.9562386728
+两性人 12.1089181827
+浑身 6.95755522916
+阿扎姆 12.8020653633
+动物园 8.51160592216
+重为 11.598092559
+房租 8.92394390956
+强渡江河 12.8020653633
+拉格尔 13.2075304714
+氢氧化钠 9.69598503258
+泳帽 13.900677652
+徐寿辉 10.604840786
+忽明忽灭 12.1089181827
+马斯地 12.5143832909
+狂叫 10.4041700905
+孙定 12.8020653633
+姊妹篇 12.8020653633
+罗振玉 10.4349417492
+摸回 13.2075304714
+关宁兵 9.28555713513
+情欲 9.63799777493
+昏昏暗暗 13.900677652
+情歌 9.84023464143
+河南队 11.7034530746
+科迪勒拉 10.2630914922
+砍断 9.85762638414
+向士隐 13.900677652
+皂河 12.2912397395
+柳陌花衢 13.900677652
+浓云密布 11.9547675029
+凋零 9.89334446674
+三度空间 11.7034530746
+新一轮 7.32003851469
+又红又专 12.5143832909
+史来贺 12.1089181827
+暗箭难防 12.5143832909
+公益行 13.900677652
+多身 13.2075304714
+大同市 10.3743171274
+埃塞萨 13.900677652
+高傲自大 12.5143832909
+中央军委 8.5440913773
+几十粒 13.900677652
+走得慢 10.8096351986
+重九 11.7034530746
+最轻 10.1394775363
+吴派舟 12.8020653633
+书里 10.6818018271
+王萨迦 13.2075304714
+德怀特 12.1089181827
+蜜糖 11.2616203224
+深入调查 10.2630914922
+狂升 12.2912397395
+清涧县 12.5143832909
+耳濡目染 10.765183436
+思静 13.2075304714
+于太安 12.1089181827
+回水温度 12.5143832909
+敲警钟 11.8212361103
+截尾 13.900677652
+涉嫌犯罪 10.765183436
+一厢情愿 9.59661255877
+几十米 9.53122979951
+烟大 13.2075304714
+仕女图 12.2912397395
+防静电 12.5143832909
+重人 12.8020653633
+妆新 12.8020653633
+位处 10.7226238216
+扎兰屯 11.5027823792
+支宿卫 13.2075304714
+韩大太 12.2912397395
+商江岫 13.2075304714
+从贞观 13.2075304714
+发电场 12.1089181827
+萨克雷 11.3357282945
+来作 9.75754292558
+注明 8.45825994145
+摩托罗拉 10.4041700905
+南北朝 7.51043698491
+忘恩失义 13.2075304714
+惹人嫌 13.900677652
+披巾 12.1089181827
+佟皇亲 12.1089181827
+增订本 11.3357282945
+电动泵 13.900677652
+非同小可 9.12155415886
+用在一时 12.8020653633
+近日里 13.2075304714
+关宁军 12.2912397395
+十二首 11.4157710022
+重价 12.5143832909
+最近 5.76738379075
+似漆如胶 13.900677652
+作案时间 12.5143832909
+悭吝 10.9049453784
+吴乃文 13.900677652
+岸英 13.900677652
+最迟 9.37888907493
+重任 8.30596627237
+蜜粉 12.8020653633
+蝶阀 12.8020653633
+艾巴克 13.2075304714
+服老 13.2075304714
+三天两头 9.75754292558
+戈德温 11.8212361103
+不知所措 8.61241062128
+劲松 10.2117981979
+边野 13.900677652
+砖瓦厂 10.642581114
+宗藩 10.642581114
+八米 13.2075304714
+重仓 7.64301006409
+八类 11.3357282945
+独守空闺 13.2075304714
+刘大哥 13.2075304714
+硬磁材料 11.9547675029
+重伤 8.29120585679
+重传 13.2075304714
+披屋 13.900677652
+多过 10.9049453784
+多远 8.35941410682
+二十多分钟 12.8020653633
+营养生长 11.3357282945
+二段 11.8212361103
+湔雪 13.900677652
+徐爵忙 13.2075304714
+多进 11.5027823792
+来件 13.900677652
+多运 12.8020653633
+多近 12.5143832909
+洋式 13.900677652
+罗迦室 13.900677652
+摇唇鼓舌 12.5143832909
+龙生岗 13.2075304714
+卜伦阿 13.2075304714
+实业部 12.1089181827
+库比 11.7034530746
+钢塔 12.8020653633
+权夺 13.2075304714
+自律意识 12.5143832909
+田楷 12.5143832909
+直播室 13.2075304714
+金榜题名 11.2616203224
+徐宁教 13.2075304714
+动作速度 12.8020653633
+临沧地区 12.5143832909
+后首 13.2075304714
+来京 8.77077893705
+世界贸易中心 12.2912397395
+夏政权 11.5027823792
+多辆 9.65218240993
+招标制 13.900677652
+张家界 10.1394775363
+回延安 11.1926274509
+电脑中心 13.900677652
+黎笋 12.5143832909
+钟鼎之家 13.900677652
+八下 11.4157710022
+来人 8.32094782599
+外交部 8.7245279194
+吕嘉问 12.8020653633
+服膺 11.1926274509
+妩媚多姿 12.1089181827
+魏延收 13.2075304714
+警备区 10.5684731418
+蚍蜉 13.900677652
+曲贝藏 13.2075304714
+谦辞 11.8212361103
+奔跃 12.2912397395
+海金伯 12.5143832909
+周文骏 13.2075304714
+多达 7.52055511508
+讽刺诗 10.642581114
+多边 9.15574552361
+紧急措施 10.9049453784
+重作 12.2912397395
+斯纳布 12.5143832909
+治税 11.7034530746
+紧贴着 10.2117981979
+卯足了劲 13.2075304714
+白箭翎 13.2075304714
+汇辑 11.3357282945
+二次 7.18166449759
+鳖肉 12.8020653633
+来书 11.1926274509
+斯莱特 13.2075304714
+青白色 11.2616203224
+性价比 9.22784881751
+北明翰 11.4157710022
+步兵连 10.8096351986
+船台 11.1926274509
+吊射 13.900677652
+工资收入 11.0674643079
+气管炎 9.84023464143
+一千步 11.598092559
+崔护 13.2075304714
+事倍功半 12.5143832909
+多轮 10.7226238216
+多轨 13.900677652
+多车 12.5143832909
+瓷雕 11.598092559
+布尔诺 11.7034530746
+南昭王 13.900677652
+多载 11.9547675029
+注有 11.8212361103
+科鲁巴尔 13.900677652
+多轻 13.2075304714
+公卿皆 12.5143832909
+漂过去 12.5143832909
+亵慢 12.8020653633
+孤独 8.11378027061
+二步 12.2912397395
+重信 11.8212361103
+库款 12.8020653633
+具象 10.9562386728
+来个 8.46695564842
+闯过 10.2897597393
+夏文说 11.9547675029
+平可夫 13.900677652
+重修 8.59737274392
+汇进 11.9547675029
+马兰村 10.6818018271
+心脏镜 13.900677652
+漆器 8.92394390956
+结构性 7.35676580641
+闯进 9.32596667347
+民营企业 8.06294720481
+库欣 13.900677652
+来临 7.39788760606
+绿春 12.8020653633
+沈高速 12.8020653633
+国宾馆 11.5027823792
+木牛流马 10.765183436
+抠搂 13.900677652
+或者说 7.49876045525
+书道 11.4157710022
+能说惯道 13.900677652
+来下 12.8020653633
+邓亚萍 12.8020653633
+慢行 10.4041700905
+尔比 13.900677652
+起开 13.2075304714
+雪梨 10.3453295905
+穿坏 12.8020653633
+面天线 13.2075304714
+援用 11.8212361103
+藏龙卧虎 11.5027823792
+十七天 12.8020653633
+魏延断 13.2075304714
+九百 9.69598503258
+核电机组 11.7034530746
+顺行 11.4157710022
+见票后 12.8020653633
+性格不合 11.8212361103
+家庭事务 12.5143832909
+水浴加 13.2075304714
+邮政局 10.2630914922
+毒疮 12.8020653633
+反贪污 12.8020653633
+晚熟作物 12.8020653633
+待转 13.900677652
+恶根 13.900677652
+初春时节 12.5143832909
+玛利亚 9.38981814546
+达纳基尔 13.2075304714
+亚当斯 10.1871055853
+组合拳 11.0674643079
+吊客 11.5027823792
+路可通 11.4157710022
+言者复 13.2075304714
+词汇学 11.9547675029
+淅川县 11.5027823792
+别有所指 13.900677652
+院部 12.5143832909
+利尿剂 10.4041700905
+狂喊 11.5027823792
+萨克逊 11.9547675029
+没错 8.35160156708
+漕粮 9.56994431169
+汝宁州 13.2075304714
+吞声饮泣 12.5143832909
+狂喜 9.56994431169
+长期共存 11.5027823792
+八站 13.2075304714
+制造悬念 13.2075304714
+且慢 9.77354326693
+情浓 12.2912397395
+哈尔蒂 13.900677652
+从来不 7.58170953823
+标准舞 12.8020653633
+宁谧 12.2912397395
+遒健 13.900677652
+动窝 13.2075304714
+砍掉 9.46986085313
+司提举 12.8020653633
+权幸 13.900677652
+绿茸茸 11.8212361103
+旅游业界 12.5143832909
+家长学校 13.2075304714
+弧圈球 12.5143832909
+浑然一体 10.5684731418
+毛骨竦然 13.900677652
+编着 11.7034530746
+二氧 13.2075304714
+杨宣伐 13.2075304714
+李敞致 13.2075304714
+常光甫 13.2075304714
+公妇 13.900677652
+二氯 10.8561552143
+待过 10.6818018271
+内藤虎 12.8020653633
+顾得上 9.61021821083
+缩孔 13.2075304714
+得饶人处且饶人 12.2912397395
+千乘之国 13.2075304714
+二水 10.4666904475
+第三十八章 11.0674643079
+汤所盟 13.2075304714
+乌孙语 13.2075304714
+比照办理 13.900677652
+吕正操 13.2075304714
+什么游戏 13.2075304714
+万公顷 7.45495783259
+养路费 11.5027823792
+金吾不禁 13.2075304714
+结过婚 10.1164880181
+多表 13.900677652
+阿姆 11.3357282945
+多补 12.8020653633
+历城区 12.8020653633
+熊庆来 11.5027823792
+张东荪 11.9547675029
+心口如一 12.8020653633
+人所共见 13.2075304714
+一亿八千八百余万元 13.2075304714
+王兴居 13.2075304714
+狂啸 13.2075304714
+凋逝 13.900677652
+斯纳姆 13.900677652
+冤冤相报 13.2075304714
+慢车 12.1089181827
+队部 11.8212361103
+歌舞升平 10.6818018271
+下笔如神 13.900677652
+寻迁奉 13.2075304714
+耿继茂 12.5143832909
+河面上 10.0720362555
+书面 8.31342899358
+殃及无辜 13.900677652
+麦赫杜 12.8020653633
+足球赛 10.6818018271
+二汽 11.8212361103
+生脉散 11.7034530746
+杨德炳 11.8212361103
+组合成 10.0720362555
+绛红色 11.5027823792
+兽用 11.5027823792
+上海队 12.8020653633
+火苗 9.14708746087
+工作思路 10.8096351986
+维娜斯 12.2912397395
+安山 11.0674643079
+杨院长 13.900677652
+喀山 10.2371160058
+库氏 13.2075304714
+栾城 11.3357282945
+志在四方 12.8020653633
+渣打 9.71102290995
+奶嘴 13.2075304714
+看风水 10.3743171274
+情深 10.9049453784
+连名带姓 13.900677652
+贾母亦 12.5143832909
+高煦之 12.1089181827
+宝贵财富 11.0674643079
+云中府 12.8020653633
+泄到 13.900677652
+一番方 13.2075304714
+花水湾 13.900677652
+水汪汪 11.3357282945
+多见 8.65893063692
+汤子博 13.900677652
+输送链 12.8020653633
+猜着 11.598092559
+巴尔萨斯 13.900677652
+体质 8.01457362053
+诊视 11.5027823792
+狗吠声 12.2912397395
+职系 13.900677652
+多角 11.598092559
+五十万两匹 12.5143832909
+伴生物 13.2075304714
+百胜 10.5684731418
+麦叶 13.900677652
+效能 8.71329184614
+间二甲苯 12.8020653633
+折射光 12.1089181827
+倒车镜 13.2075304714
+后龙 13.900677652
+一艘船 11.2616203224
+慧眼识珠 13.900677652
+衮衮 13.2075304714
+唐睿宗 11.598092559
+折银 11.0674643079
+袁大洪 11.3357282945
+超市业 12.8020653633
+有所不知 10.0720362555
+穿凿 11.0103058941
+钢带 13.2075304714
+判若 12.2912397395
+调查权 11.3357282945
+穿出 10.7226238216
+续夷坚 13.2075304714
+军制学 12.5143832909
+最强 8.01735526349
+够重 12.1089181827
+先行一步 10.1871055853
+权当 9.69598503258
+远郊区县 12.5143832909
+谢大人 12.2912397395
+西徐亚 11.1926274509
+座套 13.2075304714
+喀左 11.9547675029
+鼠标 10.8096351986
+烛光晚会 13.900677652
+院里 7.75864024639
+硫铁矿 9.82314020807
+性意识 12.2912397395
+帕内蒂 13.2075304714
+请参阅 12.5143832909
+月球车 13.2075304714
+出人意表 11.7034530746
+书集 12.8020653633
+布利塔 13.900677652
+利润表 10.7226238216
+妆扮 11.2616203224
+陈介祺 11.8212361103
+紧身胸衣 12.1089181827
+临时 6.00710557847
+大棵 12.5143832909
+千万美元 11.8212361103
+南丁格尔 11.1926274509
+董贵妃 13.2075304714
+猛加 13.900677652
+毛里求斯共和国 13.2075304714
+二派 13.900677652
+头号人物 12.1089181827
+粗厚 11.0103058941
+减税 9.21854642485
+稠密 8.47133202302
+平底鞋 12.1089181827
+奥林匹亚 10.4994802703
+砍手 13.900677652
+解舒丝 13.2075304714
+注意 5.33526588829
+化龙桥 12.5143832909
+狂呼 10.1630080337
+印象派 10.765183436
+弹性控制 13.900677652
+上篇上论 13.900677652
+商同孚 13.2075304714
+起搏点 12.8020653633
+彼此间 9.6811699468
+琐闻 11.9547675029
+八等 13.2075304714
+午饭时间 10.9562386728
+羽根 12.8020653633
+书院 8.07173203437
+老知青 13.2075304714
+啼鸣 10.765183436
+无偏无党 13.2075304714
+穿入 10.8096351986
+瞿秋白 10.1164880181
+桂发祥 12.8020653633
+程文 10.0720362555
+亚洲小姐 13.900677652
+二流 10.8096351986
+安全检查 10.9562386728
+谢米列 13.2075304714
+一二百号 13.2075304714
+井子 12.1089181827
+砍成 11.7034530746
+功不可没 9.69598503258
+山贝子 11.7034530746
+市场经济 7.61467955747
+折物 13.900677652
+关雎 11.7034530746
+阎圃 12.2912397395
+重定向 9.26594866375
+十几公里 11.8212361103
+漆膜 12.5143832909
+程普 10.0088573539
+啤酒瓶 11.1280889297
+黔阳县 12.8020653633
+发电厂 9.04864738806
+八碗 11.8212361103
+水平线上 11.9547675029
+治罪 8.83808261895
+不温不火 10.7226238216
+菲亚特 9.80633308975
+时血勇 12.5143832909
+随喜 11.5027823792
+市政工程 9.74179456862
+如闻其声 12.8020653633
+玻璃板 10.4041700905
+三元里 11.2616203224
+后天下之乐而乐 12.8020653633
+羽毛 8.25523075433
+刘卫东 12.5143832909
+玻璃杯 10.4349417492
+德哈特 12.8020653633
+螺钿 11.1280889297
+打捞工具 13.900677652
+顺丁烯二酸酐 11.5027823792
+好米 13.2075304714
+犯罪构成 12.2912397395
+条纹病 13.900677652
+闻名不如见面 13.2075304714
+位差 11.8212361103
+切中要害 11.4157710022
+二滩 11.5027823792
+亓浚 11.598092559
+程昱 10.2897597393
+权属 10.7226238216
+慎到 11.9547675029
+义形于色 12.2912397395
+杨根思 11.8212361103
+拖来 11.5027823792
+果木林 13.2075304714
+没钱 8.46259834305
+证人 9.03314320152
+笑林 12.8020653633
+同莺儿 13.2075304714
+纤维组织 11.3357282945
+缓蚀剂 12.1089181827
+榧子 11.9547675029
+师渡江 13.2075304714
+减租 12.2912397395
+考试题 11.9547675029
+机油泵 12.8020653633
+慢跑 10.5684731418
+一代宗师 11.1280889297
+几十碗 13.900677652
+足球迷 13.2075304714
+柏诺兹 13.900677652
+中国移动通信集团 12.2912397395
+多度 11.5027823792
+一时期 7.64492761022
+唱首歌 12.8020653633
+程曦 12.5143832909
+春蚕到死丝方尽 13.900677652
+袜厂 13.2075304714
+费尔德 10.765183436
+感到遗憾 10.765183436
+三四百页 13.2075304714
+各背 12.5143832909
+杨琦 12.8020653633
+穿到 11.9547675029
+南太平洋 9.55687223012
+葛根芩 13.2075304714
+电讯局 13.900677652
+谁肯 9.85762638414
+山垭口 12.1089181827
+大沿帽 13.900677652
+养民 10.1630080337
+龚端 11.1280889297
+扬扬自得 13.900677652
+改名换姓 11.598092559
+歇宿 10.4994802703
+最让 12.2912397395
+赔笑脸 12.8020653633
+长乐宫 10.765183436
+百草 10.8096351986
+端出去 12.5143832909
+萨比纳 13.900677652
+生物学 7.79811905736
+天下父母 13.2075304714
+气门心 13.2075304714
+茶酒店 13.900677652
+石磨盘 11.9547675029
+幽恨 13.2075304714
+多言 9.26594866375
+北京首都体育馆 13.2075304714
+指南录 11.5027823792
+慢走 10.765183436
+魏茨泽克 12.5143832909
+楠竹 10.0720362555
+孤石 12.8020653633
+脑瓜儿 11.3357282945
+软组织 9.59661255877
+给料 12.8020653633
+宗臣 11.9547675029
+出敌意外 13.2075304714
+玄岩 13.2075304714
+控制元件 12.8020653633
+前海 11.598092559
+妄取 11.9547675029
+养汉 12.8020653633
+密胺 12.1089181827
+照镜 12.8020653633
+梳妆镜 12.5143832909
+急慢性 10.9562386728
+肃静无声 11.0674643079
+新体验 12.1089181827
+立宣帝 11.9547675029
+缝衣针 12.8020653633
+愿赌服输 13.900677652
+起床 8.06586691491
+多话 10.2897597393
+革新家 11.7034530746
+优等奖 13.900677652
+多试 12.5143832909
+好累 12.5143832909
+第二语言 12.5143832909
+缅语 11.4157710022
+多语 12.1089181827
+平底锅 13.2075304714
+穿厚 12.5143832909
+有话请讲 13.900677652
+吴天墀 11.1280889297
+谦诚 13.900677652
+几十种 9.82314020807
+敬神佛 13.900677652
+红日三竿 13.900677652
+几十秒 12.1089181827
+共度 10.5684731418
+训练费 13.900677652
+单向阀 13.900677652
+多说 13.2075304714
+第五十二篇 13.2075304714
+先进先出 12.5143832909
+枪眼 11.598092559
+职级 11.7034530746
+扯出来 12.1089181827
+百花 9.45802639549
+书铺 12.2912397395
+八种 10.2371160058
+指甲油 11.598092559
+程朱 9.82314020807
+鲜龙活 13.2075304714
+谦让 9.38981814546
+沈子木 13.900677652
+馊味 12.5143832909
+空间组织 12.8020653633
+钢尺 12.8020653633
+朱延平 12.8020653633
+东子 11.9547675029
+放诞 12.8020653633
+民族气节 10.765183436
+座子 11.5027823792
+瞳孔放大 11.8212361103
+曹真兵 13.2075304714
+肌麻痹 12.2912397395
+浑话 12.8020653633
+九亿八千二百二十三万余两 13.2075304714
+粗具 11.9547675029
+羽檄 12.5143832909
+分区表 13.900677652
+昨天晚上 8.56795885871
+周清澍 10.9562386728
+百节 12.5143832909
+宗废耶 13.2075304714
+多记 12.2912397395
+祝酒歌 12.2912397395
+百艺 12.5143832909
+骏马 8.90346537821
+为富不仁 10.9562386728
+江卫级 12.5143832909
+养活 8.48903160012
+费尔康 13.2075304714
+百色 10.1871055853
+可有可无 10.604840786
+龙肝凤髓 12.2912397395
+茶餐厅 12.8020653633
+呼呼啦啦 12.8020653633
+内引外联 12.2912397395
+治绩 11.7034530746
+空中楼阁 11.0674643079
+园木 13.900677652
+多少年来 9.43476953332
+化学工厂 13.2075304714
+冰玉 11.1280889297
+交通员 12.5143832909
+包干到户 12.2912397395
+呕吐物 10.9562386728
+欢歌 11.1926274509
+国开行 8.98069672615
+粉条儿菜 13.900677652
+那哗哗 13.2075304714
+位尊 11.0103058941
+巧笑倩兮 12.2912397395
+兴隆县 11.598092559
+于太康 13.2075304714
+利氏 11.7034530746
+自由组合 12.1089181827
+陈叔宝 11.4157710022
+被推荐者 13.900677652
+热泪潸潸 13.2075304714
+口袋书 12.5143832909
+欢欢 12.2912397395
+猜疑 8.73589167805
+吊塔 13.2075304714
+修得真 13.2075304714
+裁量 11.7034530746
+济南市委 13.2075304714
+顽童 11.1280889297
+其他同学 11.5027823792
+百般 8.98802276624
+象牙塔 11.8212361103
+营房勤务 13.2075304714
+库仑计 13.900677652
+八神 12.5143832909
+位居 7.32839510928
+夏蒙尼 13.900677652
+胡毋生 13.900677652
+情况下 13.900677652
+认不出来 10.0505300503
+安山镇 12.5143832909
+恭维 9.61021821083
+孔晁皆 13.2075304714
+无数张 13.2075304714
+特微渺 13.900677652
+宁边 13.2075304714
+爱说笑 13.2075304714
+拉美国家 10.3171587135
+阴险毒辣 12.1089181827
+演奏会 12.2912397395
+星期一 8.95903522937
+出来 4.3691962538
+星期三 10.4041700905
+包络检波 13.900677652
+摒除 11.8212361103
+诵咏 13.900677652
+经济损失 9.25628675283
+蒋沈韩 13.900677652
+秦显 13.2075304714
+卡累利阿 10.8096351986
+拧断 12.2912397395
+师事广 13.2075304714
+第三组 11.9547675029
+水生物 12.8020653633
+脸笑 11.598092559
+网络应用 11.2616203224
+飞田 12.8020653633
+墨染 12.8020653633
+葡萄球菌 9.77354326693
+何道士 12.5143832909
+宦海浮沉 12.8020653633
+子之心 12.5143832909
+喧天锣鼓 13.900677652
+打圈 13.2075304714
+堆肥 11.1926274509
+无规则 10.4666904475
+首等 12.8020653633
+记在 9.43476953332
+急需解决 11.0103058941
+主产品 11.7034530746
+第三级 10.4041700905
+咸镜南道 12.5143832909
+怪闻 12.1089181827
+唐甄 12.8020653633
+国国民 12.5143832909
+第三纪 8.13548654919
+国家科技部 11.8212361103
+固定指标 13.900677652
+道员 10.7226238216
+第三线 12.5143832909
+孙华正 11.598092559
+洪炉燎毛 13.900677652
+舍内 12.1089181827
+逃出去 9.91169360541
+水作渠 13.2075304714
+出月 13.2075304714
+出有 10.3743171274
+打坐 10.0088573539
+竞买 9.12999302751
+打坏 10.0940151622
+开衫 13.900677652
+描金 9.62401153296
+肚里 8.39534611604
+哇塞 13.900677652
+莫奇勒 13.900677652
+肚量 11.3357282945
+画起 13.2075304714
+碧纱 11.8212361103
+鉴相器 12.2912397395
+马公至 12.5143832909
+星期二 10.1630080337
+宏桥 13.2075304714
+益友 11.4157710022
+查士丁 10.1394775363
+星期五 9.37888907493
+那容 13.2075304714
+打垮 9.59661255877
+由御史 13.900677652
+阵亡将士 10.2897597393
+没头脑 11.7034530746
+那家 9.25628675283
+普通小麦 11.9547675029
+路西 9.72629038208
+曾进 11.8212361103
+曾远 11.9547675029
+伊泰普 11.7034530746
+伪满 10.8561552143
+彭玉麟 12.2912397395
+宜阳县 12.1089181827
+赫赫的 11.598092559
+万年县 12.2912397395
+东湖区 13.900677652
+五十几岁 12.5143832909
+胶结作用 13.2075304714
+曾达 9.75754292558
+画贴 13.2075304714
+碧绿 9.20932976975
+眼眶里 9.59661255877
+乙酰胆碱 10.604840786
+男爵 10.1871055853
+马基亚 12.8020653633
+昆山县 11.9547675029
+淡泊寡味 13.900677652
+纳同知 12.8020653633
+画质 11.9547675029
+王闽中 13.2075304714
+印古什 11.7034530746
+懂不懂 10.3453295905
+空值 11.4157710022
+一掷千金 10.8561552143
+戴名世 11.9547675029
+金毛狮 12.5143832909
+董承 10.4349417492
+若干项 12.8020653633
+侵蚀作用 9.91169360541
+内务司法委员会 13.2075304714
+同捷轩 11.0674643079
+说胡话 10.8096351986
+楚威王 11.598092559
+乙状结肠镜 12.2912397395
+阿库拉 11.1280889297
+若干首 12.5143832909
+炉火纯青 10.533381822
+爬犁 12.5143832909
+喷灯 13.900677652
+详星拜斗 13.900677652
+喷火 9.7898037878
+阴恻恻 13.900677652
+打嘴 11.9547675029
+软弱性 11.7034530746
+蛔虫 9.94943393339
+亩数 12.1089181827
+诽议 12.2912397395
+明知故问 10.8096351986
+阴精 11.2616203224
+郭祥老 13.2075304714
+茶商 9.93038573842
+骑乘 10.2117981979
+种瓜得瓜 11.3357282945
+喷灌 11.5027823792
+关肇直 13.2075304714
+徐韵秋 10.765183436
+不差什么 12.5143832909
+丈夫 6.41406433884
+陈志远 11.598092559
+科罗娜 13.900677652
+于旬日 12.8020653633
+模拟系统 11.9547675029
+星座 9.00283785202
+猝不及防 9.36807815882
+倡议者 12.1089181827
+嗓音 8.33615724465
+汽车用品 11.5027823792
+加工品 10.5684731418
+翁上尉 13.2075304714
+二郎滩 13.2075304714
+多媒体技术 11.0674643079
+诽语 13.900677652
+韵律学 13.2075304714
+办事机构 9.98865464655
+上级法院 12.2912397395
+好好先生 10.5684731418
+后不后悔 13.900677652
+西达斯 12.8020653633
+鲁申 13.2075304714
+操持家务 11.598092559
+夏风见 12.8020653633
+急便 13.2075304714
+睡房 12.2912397395
+鹿港镇 13.2075304714
+努斯拉特 13.900677652
+崇圣 10.9562386728
+克丝 11.9547675029
+于言 12.8020653633
+形胜 10.3453295905
+骑上 9.63799777493
+童贯幕 13.2075304714
+吾爱 12.8020653633
+天命有归 13.900677652
+乱喝 13.900677652
+墨晶 11.9547675029
+梅兰竹菊 12.8020653633
+画象 13.2075304714
+柴草 9.44633035572
+修船厂 12.2912397395
+地质剖面 11.9547675029
+第十具 11.9547675029
+安岩 13.900677652
+陈豫钟 12.8020653633
+川木香 12.2912397395
+薄仪 12.5143832909
+塑料套 13.2075304714
+全攻全守 13.2075304714
+说话声 9.62401153296
+第三罐 13.2075304714
+众生相 12.8020653633
+古巴比伦 10.4349417492
+德厚流光 13.900677652
+车管所 11.7034530746
+种族歧视 9.94943393339
+夸张性 13.2075304714
+柴荣 10.642581114
+秦震略 13.2075304714
+画谱 11.3357282945
+统计调查 11.0674643079
+由盛而衰 11.4157710022
+抽身而退 12.8020653633
+碳源 11.5027823792
+中心局 12.2912397395
+旧约全书 11.9547675029
+胆南星 13.2075304714
+碧翠 13.2075304714
+译注 11.7034530746
+自身难保 11.1280889297
+李麦用 12.8020653633
+学习用品 12.5143832909
+译法 11.598092559
+打回 10.2897597393
+英国海军 9.15574552361
+唐末有 13.2075304714
+天齐寿 12.8020653633
+捷联 11.4157710022
+杂货店 10.3743171274
+首笔 10.4666904475
+易七世 12.5143832909
+电热器 12.8020653633
+明之弟 13.2075304714
+大蒜油 13.900677652
+那天 6.71756595023
+知识库 10.765183436
+三十桌 13.2075304714
+黑森州 12.8020653633
+仰头一看 13.900677652
+那大 9.21854642485
+童贯见 12.5143832909
+公士 13.2075304714
+萨迦之 12.8020653633
+骶椎 12.5143832909
+险路 11.7034530746
+邵时信 9.01032852375
+深深感到 11.1280889297
+铁通 11.1280889297
+亲授 11.5027823792
+棕熊 10.604840786
+牵挂 9.22784881751
+北游录 12.8020653633
+工业生产 8.14810501315
+公司总裁 9.56994431169
+欧亚 8.57766767284
+舍友 13.900677652
+色粉 12.1089181827
+居留地 10.2630914922
+六家 10.0720362555
+敞亮 10.9562386728
+那夜 10.765183436
+单选题 13.900677652
+见死不救 10.2371160058
+柴胡 9.53122979951
+喜得 10.0294766411
+由丁男 12.8020653633
+诈骗罪 10.5684731418
+霄壤之别 13.900677652
+桓温死 12.5143832909
+改造 6.55144682736
+刘备知 13.2075304714
+百花凋零 13.2075304714
+历史论文 12.2912397395
+允许值 12.2912397395
+猛撞 10.9562386728
+铁道 9.02548032877
+死节 10.8561552143
+那好 8.69119149913
+夜路 10.3453295905
+中央常委 11.3357282945
+闯开 12.2912397395
+孤独感 11.5027823792
+氢氧化镁 12.8020653633
+舍去 11.9547675029
+埃斯皮 12.2912397395
+改选 9.72629038208
+岸区 13.900677652
+精神药物 12.5143832909
+之故 9.44633035572
+宁子 12.5143832909
+阿佛洛 11.598092559
+栖身 10.1630080337
+马札尔 13.2075304714
+佩萨罗 13.2075304714
+怨气 9.37888907493
+国合 12.8020653633
+胜利者 9.65218240993
+二尖瓣 10.4041700905
+坚称 10.765183436
+马森布 12.5143832909
+里瓦 11.598092559
+弹拨 11.2616203224
+共同之处 10.1164880181
+铁冶户 13.2075304714
+可鄙 11.5027823792
+画轴 11.0674643079
+修堤 11.4157710022
+埃斯登 13.2075304714
+劝业 11.3357282945
+宣纸 9.6811699468
+出时 12.5143832909
+超音速飞 13.900677652
+王觉斯 11.598092559
+第三类 9.71102290995
+供销科 13.2075304714
+之龙 11.9547675029
+南阳镇 12.5143832909
+西王庆 13.2075304714
+赶奔 13.900677652
+木兰花 11.598092559
+录相机 13.900677652
+项领 13.2075304714
+船务 10.3743171274
+单丝不成线 13.2075304714
+过街楼 12.8020653633
+简逸 12.2912397395
+巴儿监 12.2912397395
+群体 6.93559730637
+牵掣 13.900677652
+山拗 11.8212361103
+希望工程 11.4157710022
+群伦 12.1089181827
+半首 12.1089181827
+林屋洞 13.2075304714
+纯羊毛 13.2075304714
+坦白从宽 11.3357282945
+托尘凡 13.2075304714
+水陆联运 10.4349417492
+路见 13.2075304714
+生物固氮 11.8212361103
+催租 11.7034530746
+成克巩 12.5143832909
+出新 8.88339781516
+君权 10.2371160058
+纺织工人 11.5027823792
+打嗝 11.0674643079
+维先托 13.900677652
+缪尔 11.1926274509
+成一艺 12.8020653633
+飞石 10.765183436
+陈将士 11.8212361103
+专政对象 13.900677652
+宣统 9.00283785202
+出料 12.5143832909
+群众 6.024039191
+卖空 10.2371160058
+老去 10.4666904475
+孙吴县 13.900677652
+寸步难行 10.4994802703
+牙关紧闭 11.2616203224
+子宫出血 11.0674643079
+股级 13.900677652
+膜拜 10.2897597393
+难为 8.83808261895
+漂洋过海 11.7034530746
+不知世务 13.900677652
+打听 7.00196311765
+中心店 13.2075304714
+统计员 12.2912397395
+郑秀文 13.900677652
+记名 10.604840786
+阴线 8.89004235788
+性犯罪 13.900677652
+秦置阳 12.8020653633
+出摊 12.5143832909
+半页 12.8020653633
+中等城市 11.0103058941
+金帛之 12.2912397395
+内外勾结 11.8212361103
+边防部队 10.604840786
+三等分 12.5143832909
+架空线 12.5143832909
+北京航空航天大学 12.5143832909
+舍勒 10.9049453784
+次高 12.8020653633
+韩乐卿 13.2075304714
+大概 6.13341365522
+非蛋白氮 12.8020653633
+耐油 11.4157710022
+打呼 12.5143832909
+简释 13.900677652
+群交 13.900677652
+滕云设 12.5143832909
+横枪跃马 13.2075304714
+打的费 13.2075304714
+广种薄收 11.9547675029
+构象变化 13.2075304714
+喜庆 9.10488710638
+伏在水 12.8020653633
+嗓门 8.61241062128
+里甲 10.4666904475
+吴雁泽 12.5143832909
+牵手 9.89334446674
+法律系 10.0720362555
+航天部队 13.900677652
+青岚湖 12.2912397395
+凉山州 12.5143832909
+地震波 10.0720362555
+飞白 13.900677652
+穆拉维 11.7034530746
+宙斯盾 11.4157710022
+阴维 13.900677652
+国有财产 11.0103058941
+官员 5.82977156319
+弹指 11.0103058941
+碳水 12.5143832909
+牵扯 9.07236391467
+欧俄 13.900677652
+黄日华 13.900677652
+干涉级 13.2075304714
+开发阶段 12.2912397395
+杨志明 13.900677652
+凶信 11.9547675029
+飘缈 13.2075304714
+首都机场高速公路 12.1089181827
+晴天霹雳 10.4349417492
+胡震亨 12.8020653633
+细木工 11.0103058941
+亲戚 7.46934657004
+卖笑 11.1280889297
+万应灵药 13.2075304714
+身不由主 12.2912397395
+牛金星 7.25819085061
+小算盘 11.1926274509
+桃红 10.4349417492
+满脸春色 12.8020653633
+吸入式 13.900677652
+喜幸 13.2075304714
+主产地 10.4994802703
+川长社 12.1089181827
+礁溪温泉 12.8020653633
+飞盘 13.900677652
+福建柏 10.642581114
+严严密密 12.1089181827
+半颗 12.2912397395
+舍利 9.7898037878
+识时务 10.5684731418
+国产轿车 13.2075304714
+嬷嬷 10.0940151622
+痛不可忍 12.2912397395
+巨大成就 9.91169360541
+修士 10.4994802703
+牵拉 10.2371160058
+群主 12.8020653633
+形色 11.5027823792
+氢氧化锂 13.900677652
+劝住 10.3453295905
+那壶 11.8212361103
+亲手 7.93967231235
+坚硬 7.78258045393
+拉鲁斯 11.8212361103
+明定陵 12.5143832909
+金州路 13.2075304714
+河东郡 11.598092559
+留恋不舍 13.900677652
+唐初改 13.2075304714
+窄带 11.7034530746
+群丛 12.8020653633
+打响 8.75318317516
+一九七七 13.900677652
+为了 4.60682367977
+泸县 12.5143832909
+耐寒性 10.604840786
+第三章 9.04086524761
+蚶子 12.2912397395
+那张 7.62780064543
+传过去 13.2075304714
+蘑菇云 11.4157710022
+因袭 9.61021821083
+丝绸面料 12.8020653633
+阴福 12.8020653633
+通览 13.900677652
+呆笑 12.8020653633
+里特 11.1926274509
+星宿 9.61021821083
+画角 10.9049453784
+云体 11.3357282945
+多得 9.34680076038
+说东说西 13.900677652
+硫氰酸 12.2912397395
+皮帕德 13.900677652
+自以为是 9.98865464655
+新时尚 12.5143832909
+红罗宝 13.2075304714
+行式打印机 12.8020653633
+烤熟 11.5027823792
+催缴 11.0674643079
+赵奢 11.8212361103
+四月份 11.3357282945
+忆旧 11.9547675029
+博爱医院 12.1089181827
+第三站 13.2075304714
+打包 8.70218062071
+赛马 9.96885201925
+抵抗力 8.62767809341
+疏财仗义 12.8020653633
+毛贵部 13.2075304714
+打印 8.28027678626
+机动权 13.900677652
+碧空 11.1926274509
+简雍 10.765183436
+百慕大杯 12.2912397395
+封口机 13.2075304714
+打卡 12.2912397395
+亲族 10.0720362555
+记协 12.8020653633
+氟嗪酸 12.8020653633
+阴私 12.5143832909
+主人翁 10.642581114
+原守关 13.900677652
+毫不手软 11.0674643079
+伏尔塔瓦河 11.8212361103
+炫耀 8.64840422393
+最优性 12.2912397395
+非同一般 9.41204128224
+科贝特 12.8020653633
+急行军 10.5684731418
+发起方 12.5143832909
+眼镜盒 12.5143832909
+打千 11.1280889297
+假设性 13.2075304714
+计算机技术 9.58318953844
+打去 10.0720362555
+胡人之 11.8212361103
+隋书 9.4233408375
+博斯普鲁斯海峡 10.3453295905
+万泽蒂 12.5143832909
+烤焦 11.8212361103
+拂动 11.3357282945
+曹子丹 12.5143832909
+摄魂 11.7034530746
+穆垒 13.2075304714
+饰品 9.89334446674
+青菜汤 13.2075304714
+尽义务 12.1089181827
+卜之兄 13.2075304714
+徐树丕 12.5143832909
+叽里呱啦 13.2075304714
+冯胜征 13.2075304714
+施淡彩 12.2912397395
+曾译 10.8561552143
+喜好 9.17328983326
+萧一山 11.5027823792
+伏斯基 13.2075304714
+子之孝 13.2075304714
+打压 7.80260336981
+简阳 11.9547675029
+公存 13.900677652
+大门口 8.27666014579
+战幕 12.1089181827
+民主监督 10.9562386728
+遏抑 12.8020653633
+狂花 13.2075304714
+国家海洋局 12.2912397395
+畜牧场 11.8212361103
+做假 10.9562386728
+记取 11.0103058941
+杰米 13.900677652
+向建虏 12.8020653633
+简陋 8.66423568915
+喜多 11.9547675029
+飞燕 10.8561552143
+安国县 12.2912397395
+星子 10.765183436
+亲故 11.3357282945
+转义序列 11.3357282945
+拍摄角度 13.900677652
+龙头老大 10.9049453784
+吉隆 11.4157710022
+打叠 11.3357282945
+普罗霍罗夫 12.8020653633
+出掌 10.533381822
+金信 11.1926274509
+马廷鸾 12.8020653633
+记号 9.24671730182
+擅自 8.25170341381
+三季度 5.18365047868
+打发 7.47257237929
+摆在面前 10.8096351986
+武川镇 13.2075304714
+李元田 12.2912397395
+梗直 13.900677652
+英金河 12.1089181827
+菜园子 10.2897597393
+紫砂壶 10.4349417492
+之时 6.50189137656
+改革 5.49017919923
+福克兰 11.4157710022
+加利福尼 13.900677652
+那帮 9.93038573842
+烤红薯 11.7034530746
+谢晋元 12.8020653633
+飞瀑 9.7898037878
+打到 8.21031819765
+打制 9.72629038208
+米哈伊洛维奇 12.8020653633
+清咸茶 13.2075304714
+宣示 10.4349417492
+节日期间 9.43476953332
+记分 10.1871055853
+莴笋 11.5027823792
+游园会 13.900677652
+宣礼 12.1089181827
+寂寞 8.07173203437
+金观政 13.2075304714
+居高临下 9.37888907493
+水面舰艇 9.16447920358
+扶策 12.5143832909
+寂寥 10.2371160058
+渗进去 12.8020653633
+第三篇 10.604840786
+出手 7.23754495598
+阅人多矣 13.900677652
+陈光远 12.5143832909
+诸子百家 9.80633308975
+渭南市 11.8212361103
+烤炙 12.1089181827
+骷髅旗 13.2075304714
+西风带 10.2371160058
+打分 10.3453295905
+小牛队 13.900677652
+称心满意 12.8020653633
+牛李党 11.9547675029
+撑破 11.0103058941
+梗着 10.4041700905
+舷梯 11.7034530746
+那幢 10.4994802703
+烤烤 12.1089181827
+因公殉职 12.8020653633
+铁青 9.34680076038
+玄德 8.00627481771
+歇腿 13.900677652
+云中 8.93783302172
+那年 7.86519621945
+铁面 10.9049453784
+肥东县 13.900677652
+子世著 13.2075304714
+诵出 12.8020653633
+从义净 13.2075304714
+经纪人 8.33615724465
+那幅 9.25628675283
+烤烟 8.82550383674
+厅房 10.604840786
+出战 8.45825994145
+新进展 9.55687223012
+曾言 11.598092559
+三十九处 13.2075304714
+和平区 11.7034530746
+宣祖 12.5143832909
+猫耳洞 11.3357282945
+任浚命 13.2075304714
+悲辛 13.2075304714
+搁着 10.3453295905
+唐家璇 12.5143832909
+同花顺 10.3453295905
+铁鞋 13.2075304714
+那座 7.98447558937
+记功 10.9049453784
+毛尔布 13.2075304714
+打劫 9.72629038208
+襁褓 10.0088573539
+打动 8.5488195185
+经从乾 13.2075304714
+舍命 9.45802639549
+卖剑买牛 13.900677652
+均田制 9.84023464143
+杀一盘 12.8020653633
+古钢琴 13.900677652
+忙不过来 9.94943393339
+出拳 11.3357282945
+姜辣素 13.2075304714
+怨毒 10.604840786
+俞家军 13.2075304714
+铁鞭 11.0103058941
+白梨 11.7034530746
+和平号 11.8212361103
+悬梁刺骨 13.900677652
+树酯 13.2075304714
+午马 12.5143832909
+埃斯特角 12.8020653633
+模糊推理 13.2075304714
+画行 12.5143832909
+吓到 13.900677652
+打勾 13.900677652
+家庭妇女 11.4157710022
+纸边 13.2075304714
+泪涟涟 12.1089181827
+张健先生 13.2075304714
+百年树人 13.900677652
+佣钱 12.8020653633
+梁晴梳 13.2075304714
+铺底 11.8212361103
+两英里 13.2075304714
+宣称 7.83456956187
+云亭 12.5143832909
+云云 10.1871055853
+价格不菲 11.598092559
+飞进来 11.7034530746
+凤县东 12.8020653633
+制作者 11.8212361103
+山旺 11.2616203224
+横议 13.900677652
+阻尼振荡 13.900677652
+第三笔 13.2075304714
+谢国忠 9.26594866375
+洛丽塔 13.2075304714
+和平县 11.7034530746
+挤出去 11.5027823792
+正应 10.1871055853
+山易 12.1089181827
+于崇祯 10.4041700905
+松桃 13.900677652
+私房钱 10.2117981979
+画说 13.2075304714
+安巴 13.900677652
+阿基姆 12.5143832909
+曹魏邺 12.8020653633
+柏叶 11.9547675029
+聂隐娘 12.8020653633
+寻移疾 13.2075304714
+白眼狼 11.0674643079
+藏宝图 12.2912397395
+两三位 12.1089181827
+王东伐 12.8020653633
+简易楼 13.900677652
+喷着 10.3453295905
+五铢钱 10.1871055853
+耶利哥 12.8020653633
+遇阻 9.56994431169
+桃符 11.7034530746
+尼龙 9.46986085313
+说梦话 11.1280889297
+湿冷 10.9049453784
+办理 6.57355435972
+尹大目 12.8020653633
+熟石灰 12.5143832909
+舞台效果 11.9547675029
+荏苒 12.1089181827
+五六百年 12.8020653633
+沃尔特河 11.7034530746
+修正率 13.900677652
+恶语中伤 13.2075304714
+决断力 12.1089181827
+范秀枝 10.0505300503
+汪任 12.1089181827
+画论 11.0103058941
+血亏 11.4157710022
+中学阶段 12.8020653633
+格格格 11.8212361103
+获取数据 12.5143832909
+个别测验 13.900677652
+抛绣球 11.7034530746
+四方面 9.66657114738
+反射强度 13.900677652
+松烛 11.2616203224
+冲印 13.900677652
+打入 8.84443184663
+塞内加尔河 11.0103058941
+罗森海姆 12.8020653633
+山僧 12.5143832909
+喜宴 10.6818018271
+老茎生 11.8212361103
+雕虫小技 11.1926274509
+生物迁移 13.900677652
+阿努斯 12.8020653633
+宅基地 9.49395840471
+喜容 13.2075304714
+血亲 10.533381822
+重灾区 9.80633308975
+生契阔 12.5143832909
+记入 10.0088573539
+险要 8.37124856446
+劲舞团 13.900677652
+拖网渔船 12.2912397395
+有赖于 9.19114745066
+山景 10.7226238216
+宏源 11.0103058941
+阿来克 12.5143832909
+大楷 13.900677652
+星夜 8.32472854883
+辈数儿 13.900677652
+批发部 13.900677652
+喜子 13.900677652
+大老官 12.8020653633
+铁钉 9.80633308975
+杜诗学 13.2075304714
+贝济埃 13.2075304714
+爵士舞 13.900677652
+耶律洪基 13.2075304714
+铁钎 11.598092559
+诽谤 9.15574552361
+庙会 9.6811699468
+无所畏惧 10.4994802703
+纹板 13.2075304714
+窄得 12.1089181827
+缙云 11.5027823792
+铁钟 12.2912397395
+亲朋 9.94943393339
+西和杰 11.8212361103
+大半生 10.5684731418
+缪塞 11.9547675029
+血书 10.7226238216
+异动股 11.7034530746
+遇难 9.10488710638
+中秋月 13.2075304714
+铁钳 10.9049453784
+顾麟生 10.765183436
+铁钵 13.900677652
+午饭 8.07763175649
+阴符 11.8212361103
+平路 12.5143832909
+铁钺 13.900677652
+打击 6.32048823403
+打出 8.13235665618
+胡桐木 13.900677652
+性周期 12.2912397395
+氨基甲酸酯 11.5027823792
+橡胶坝 13.2075304714
+铁铉 13.900677652
+午餐 9.46986085313
+庄襄王 13.900677652
+冯夷 12.8020653633
+因小失大 11.2616203224
+阮某 12.8020653633
+好几幢 13.2075304714
+八九位 12.8020653633
+统考 10.642581114
+中立派 12.8020653633
+血丝 9.66657114738
+民贼 12.1089181827
+铁铧 12.5143832909
+十月革命节 13.900677652
+叠彩山 12.8020653633
+囤积居奇 10.8561552143
+村委会 8.93783302172
+沙拜尔 13.900677652
+血中 9.38981814546
+苛责 11.1280889297
+铁铲 10.9049453784
+铁铸 10.604840786
+铁铺 13.900677652
+糟践 10.3453295905
+塑料布 10.642581114
+铁链 9.20932976975
+铁锁 9.91169360541
+出恭 11.9547675029
+白眼珠 13.2075304714
+出息 8.97342396682
+铁锅 9.5186510173
+龙楼凤阁 13.2075304714
+六七丈 13.900677652
+六七万 11.0674643079
+铁锈 10.533381822
+拉珈语 13.2075304714
+酒醉饭饱 12.2912397395
+铁锌 13.900677652
+摄食 9.23723855786
+降降温 13.2075304714
+罗正钧 13.2075304714
+改长 12.5143832909
+山有 10.2897597393
+铁锚 11.5027823792
+狂舞 11.0674643079
+障眼 12.2912397395
+有害物质 9.26594866375
+计算机程序 10.9049453784
+指令系统 12.5143832909
+铁锥 11.7034530746
+铁锤 10.0088573539
+声誉不衰 13.900677652
+萧伊苏 13.2075304714
+第三种 9.06439574502
+好几年 9.0884932966
+云麓漫 13.2075304714
+从小儿 9.89334446674
+铁锹 9.91169360541
+山木 13.2075304714
+山本 10.5684731418
+主产县 11.8212361103
+宣笔 11.9547675029
+铁镁 11.9547675029
+洪河入 13.2075304714
+轻车简从 12.1089181827
+两三个 8.37124856446
+冠名权 12.5143832909
+大半瓶 12.8020653633
+薄业 11.598092559
+改锥 12.8020653633
+支撑杆 12.2912397395
+小月儿 13.900677652
+大放厥辞 13.2075304714
+跃马弯弓 12.8020653633
+大老婆 10.9049453784
+山杏 11.0674643079
+桥栏杆 12.1089181827
+年幼无知 10.8561552143
+化学农药 11.5027823792
+两三丈 11.8212361103
+除非己莫为 11.598092559
+两三下 13.2075304714
+那层 10.1630080337
+两三万 10.1164880181
+山松 11.7034530746
+改错 11.9547675029
+玉兰树 10.8561552143
+盘庚迁 11.3357282945
+汪俊 13.2075304714
+隆裕太后 12.5143832909
+国士之 13.2075304714
+人事部门 11.1280889297
+王廷臣 11.0103058941
+打假 9.19114745066
+宁宫 12.5143832909
+庙下 12.8020653633
+山林 8.15447446144
+非法经营 10.3453295905
+碳棒 11.9547675029
+忧容 11.598092559
+山果 11.598092559
+撑竿 12.2912397395
+两三代 12.8020653633
+八九万 12.5143832909
+缮写 10.4349417492
+毒蜘蛛 13.900677652
+抓药 10.4041700905
+于乐调 13.2075304714
+汪伦 11.3357282945
+歃血 11.7034530746
+当代史 12.1089181827
+亲昵 9.55687223012
+左右两 11.0674643079
+宇文泰继 12.2912397395
+催粮 11.0674643079
+小篆 10.533381822
+勾下 13.2075304714
+智能圈 12.5143832909
+彝人 13.900677652
+山枣 12.5143832909
+人算不如 12.2912397395
+夸成 13.900677652
+主产区 8.95903522937
+八九个 10.7226238216
+骏业 13.900677652
+成键轨道 12.8020653633
+海生植物 12.8020653633
+纸袋 10.9562386728
+飞狐 12.8020653633
+翻上去 13.900677652
+司书 13.2075304714
+口齿清楚 12.1089181827
+无疾而终 10.9562386728
+男用 12.1089181827
+闻令兄 13.2075304714
+企业信用 11.1926274509
+直流电机 11.5027823792
+波斯王子 12.5143832909
+引火线 13.900677652
+卡马河 11.8212361103
+段落 9.32596667347
+山柰 13.900677652
+山柳 10.8096351986
+善用 9.5186510173
+军民关系 11.8212361103
+铁门 8.90346537821
+阴穴 12.5143832909
+川学海 12.5143832909
+延长线 10.9562386728
+沥青路面 12.1089181827
+布苏泡 12.8020653633
+明之夕 13.900677652
+吕南老 11.2616203224
+亏损面 10.4349417492
+男生 9.12999302751
+铁闸 11.4157710022
+姬姓国 13.2075304714
+碧秋 12.5143832909
+回复体 13.900677652
+男童 10.7226238216
+感戴 11.0103058941
+双对 12.5143832909
+龙二 13.900677652
+创建者 9.59661255877
+亏损额 10.2371160058
+极左派 12.8020653633
+金书 10.9049453784
+读卡机 13.2075304714
+简验 12.2912397395
+任伯年 13.2075304714
+任商 12.8020653633
+那匹 8.87679713113
+尊严感 12.1089181827
+星型 12.2912397395
+红柳滩 12.5143832909
+龙云 11.1926274509
+起衅 13.900677652
+龙井 8.75318317516
+链条式 13.2075304714
+图像编码 13.900677652
+掩藏着 12.2912397395
+无籽西瓜 12.5143832909
+切入 9.31571017331
+龙亭 10.4349417492
+宝二爷 9.71102290995
+真赃真贼 13.900677652
+法务部 13.2075304714
+山根 10.4041700905
+性焦虑 11.8212361103
+凤仙花 11.4157710022
+忘年之交 13.900677652
+趁虚而入 11.9547675029
+随后就来 12.5143832909
+冯保趋 12.8020653633
+卖点 9.38981814546
+打开 6.06628534907
+第三盘 13.2075304714
+山桑 12.5143832909
+代用品 10.4041700905
+高显 13.2075304714
+人格保证 13.900677652
+昏蒙蒙 13.900677652
+记录 6.48851731703
+农业地理 11.4157710022
+阴痒 12.8020653633
+二十五块 12.8020653633
+浦圃 12.5143832909
+馆址 11.5027823792
+始创 10.1164880181
+委内瑞拉 8.71889410168
+斯科钦斯基 13.2075304714
+唐设西 12.1089181827
+中山美穗 13.900677652
+浸到 11.8212361103
+布发源 12.5143832909
+交界线 11.9547675029
+沈南山 13.2075304714
+机载 8.87023973058
+看也不看 10.1630080337
+曹魏黄 12.8020653633
+铁马 11.0103058941
+攻守同盟 11.8212361103
+第七十一回 12.5143832909
+项明远 11.8212361103
+尼采 10.4666904475
+飞絮 11.9547675029
+出演 10.2897597393
+片纸只字 12.5143832909
+成本增加 10.0294766411
+龙马精神 12.8020653633
+疗养 9.21854642485
+渗出 8.66423568915
+群众意见 10.9049453784
+记得 6.41014824992
+电气化铁路 10.1164880181
+粘贴板 13.900677652
+梁尚贤 13.2075304714
+铁骊 13.2075304714
+经受考验 11.1280889297
+山梁 9.89334446674
+凌驾 11.9547675029
+开证 12.8020653633
+波特锡 13.900677652
+果位 12.5143832909
+拉兹丹 13.900677652
+冯保略 13.2075304714
+十数只 12.2912397395
+康德罗 12.5143832909
+平面化 12.8020653633
+下划线 11.9547675029
+铁骨 11.9547675029
+加工型 11.3357282945
+打得 7.38448457593
+不服输 11.0674643079
+龙丹 10.7226238216
+苯中毒 11.9547675029
+昊天 11.0103058941
+译文 9.66657114738
+疑似病例 12.5143832909
+山梨 11.9547675029
+平射炮 12.2912397395
+步调一致 11.7034530746
+九天之外 13.900677652
+旅馆业 12.8020653633
+几弄 13.900677652
+飘红 8.63798746307
+那口 8.83177344976
+疏虞 11.3357282945
+史述论 11.8212361103
+马利诺夫斯基 13.900677652
+那句 8.99540287354
+打快 12.8020653633
+崇庆 11.3357282945
+阴界 11.9547675029
+贪食 11.0103058941
+记忆 7.46132728088
+里纳 11.8212361103
+那台 10.5684731418
+昌升茶 10.9049453784
+信君 13.2075304714
+霍林河 11.1280889297
+口齿清晰 13.900677652
+渗入 8.75318317516
+撬下 13.900677652
+对位法 11.8212361103
+汉长安 13.2075304714
+那双 7.9526426628
+落伍者 12.5143832909
+那参 12.8020653633
+宗匠 12.8020653633
+动力电池 10.0720362555
+石油大臣 11.598092559
+圣保罗岛 13.900677652
+二十六位 13.2075304714
+笞责 13.2075304714
+仓堪布 12.8020653633
+记帐 10.8561552143
+山椒 13.900677652
+加成法 13.900677652
+母创制 13.2075304714
+真纳 11.0674643079
+碧眼 10.765183436
+一粗一细 12.8020653633
+跳下 8.83808261895
+跳上 9.11318590919
+财政拨款 10.9562386728
+尼那 13.900677652
+果仁 10.8561552143
+吕叔湘 11.8212361103
+自我表现 11.9547675029
+叶恭绰 13.2075304714
+收纳盒 13.2075304714
+赫勒敦 12.2912397395
+张香帅 12.5143832909
+弄巧成拙 10.8096351986
+引咎辞职 10.8561552143
+中国共产党 6.69652835994
+有得有失 13.2075304714
+宿卫亲 12.8020653633
+克孜勒苏柯尔克孜自治州 11.4157710022
+耐蚀性 10.604840786
+黄河水 9.55687223012
+缪埂 11.8212361103
+出港 11.0674643079
+盘庚至 13.2075304714
+打平 12.2912397395
+统辖 8.7245279194
+涂山之 13.2075304714
+鲜妍 12.8020653633
+付过 12.2912397395
+感染性 9.75754292558
+出渣 12.8020653633
+将作监 13.2075304714
+山楂 9.31571017331
+出游 9.12999302751
+金元帅 12.5143832909
+赫姆斯 13.2075304714
+果于 13.2075304714
+知人论世 12.2912397395
+怨望 10.8561552143
+好处费 10.642581114
+廿八日 13.2075304714
+喷砂 13.2075304714
+从臣 12.8020653633
+出清 11.1926274509
+稍顷 12.5143832909
+喜迎春 13.900677652
+安国市 12.8020653633
+同价位 12.5143832909
+中国国情 9.84023464143
+爬竿 12.5143832909
+那剑 12.8020653633
+上皮组织 11.0674643079
+磷块岩 11.598092559
+星团 9.5062284973
+亚德里亚 13.2075304714
+但奉军 13.2075304714
+欣喜万分 13.900677652
+抓走 9.80633308975
+抓起 8.35941410682
+跳井 11.1280889297
+二十八万 12.5143832909
+音乐学校 11.0674643079
+一头雾水 10.765183436
+首站 11.1280889297
+解甲释 12.8020653633
+撞见 8.9308643524
+纸装 13.900677652
+见景生情 12.5143832909
+承德市 10.8096351986
+所得税率 11.1280889297
+死了心 10.8561552143
+侍书雪 13.900677652
+开路人 13.900677652
+慧超 13.2075304714
+打底 11.4157710022
+亚细亚洲 12.5143832909
+占廷史 13.2075304714
+铜子 11.2616203224
+抓赌 11.5027823792
+宦海沉浮 11.9547675029
+国际大坝委员会 13.2075304714
+浸取 11.5027823792
+新党章 11.3357282945
+弹药箱 10.7226238216
+六声 13.2075304714
+金云 12.2912397395
+郝天挺 13.2075304714
+开说 13.900677652
+于老庄 12.5143832909
+抓贼 12.1089181827
+粘液性 11.4157710022
+果业 12.1089181827
+青田石 11.1926274509
+颜卫地 13.2075304714
+宏愿 11.2616203224
+十数匹 12.8020653633
+贵少贱老 13.2075304714
+搁笔 10.8096351986
+龙体 10.9562386728
+尼勒克 13.2075304714
+纹样 9.66657114738
+崇德 9.74179456862
+丽春 12.8020653633
+杨贵妃 9.94943393339
+开课 11.7034530746
+跳价 13.2075304714
+五十年代 9.65218240993
+坚牢 11.1926274509
+亚纯 11.2616203224
+出溜 11.9547675029
+侯利仓 13.900677652
+各级 6.84106002368
+角度看 7.68407155089
+脱亚入 13.900677652
+挨肩擦脸 13.900677652
+别构效应 13.900677652
+潍坊市 10.8561552143
+房屋产权 11.0103058941
+一忽儿 10.8561552143
+一十六岁 12.8020653633
+伯里 11.0103058941
+那儿 6.65004214008
+全线进攻 12.1089181827
+出浴 11.8212361103
+出海 8.3555002075
+译本 8.85082164473
+二件套 13.900677652
+烤羊 12.2912397395
+拉普人 11.8212361103
+骁雄 12.5143832909
+广东省教育厅 11.5027823792
+三级片 13.2075304714
+午门 8.49350588052
+大滩 11.8212361103
+原西京 12.5143832909
+进口港 12.1089181827
+可限 12.8020653633
+石油价格 9.24671730182
+三色堇 12.8020653633
+碧瑶 12.1089181827
+行为科学 10.6818018271
+证券监管 11.1280889297
+若尔当 12.2912397395
+西河郡 11.0103058941
+横倒竖卧 12.5143832909
+崇尚 8.53938548627
+个人空间 12.2912397395
+裸燕麦 12.5143832909
+有慧根 11.4157710022
+出活 13.900677652
+赵恒命 13.2075304714
+那具 9.17328983326
+宓慕 12.5143832909
+刘絮云 8.23425096386
+女王 8.13548654919
+董作宾 11.4157710022
+珍品展 13.900677652
+出洋 10.3743171274
+左选郎 13.2075304714
+庐州 9.91169360541
+邈邈 13.900677652
+绵里藏针 11.8212361103
+出洞 9.98865464655
+行业标准 10.1630080337
+胡连生 9.15574552361
+瓜子脸 10.9049453784
+牵正 13.2075304714
+难过地 10.533381822
+钮祜禄 13.900677652
+丹巴县 12.8020653633
+半里 9.36807815882
+半重 13.2075304714
+半野 11.0103058941
+薄曲 13.2075304714
+精子发生 11.9547675029
+催熟 11.9547675029
+原产地 9.85762638414
+幼仔 9.87532596124
+温宿县 11.8212361103
+飞羽 10.1630080337
+译林 13.2075304714
+那册 13.2075304714
+华盛顿湖 13.2075304714
+路上车 12.2912397395
+破坏型 13.900677652
+集合令 13.900677652
+改食 13.2075304714
+代理费 11.9547675029
+各组 10.3453295905
+喷管 10.4666904475
+费力气 12.2912397395
+飞翔 8.50705010562
+半醒 11.7034530746
+脉冲序列 13.900677652
+碧瓦 11.2616203224
+赤瓜礁 12.8020653633
+宣相 10.604840786
+曹武 13.2075304714
+无可奈何花落去 12.2912397395
+和平岛 13.2075304714
+打工 7.93709830836
+名爵 10.2897597393
+蒋文卓 12.8020653633
+飞翼 12.5143832909
+马飞报 10.9562386728
+梯度 9.20932976975
+松隆子 13.900677652
+年少无知 13.900677652
+在所不惜 11.0103058941
+泽及 12.2912397395
+火力发电厂 10.4349417492
+可随 10.8096351986
+唐中宗 10.604840786
+终身职 11.8212361103
+鬼扯 13.2075304714
+烤红 13.900677652
+半道 11.0674643079
+巴登邦 13.2075304714
+翁隆盛 11.7034530746
+搽药 13.900677652
+馆名 11.8212361103
+抓进 11.4157710022
+玄德遂 11.7034530746
+楼橹 11.9547675029
+沉默不语 9.61021821083
+无从着手 12.1089181827
+六头 13.900677652
+哀辞 12.1089181827
+戎辂 13.900677652
+遇鬼 12.5143832909
+梯形 9.59661255877
+曾著 11.7034530746
+以色列工党 11.9547675029
+出江 12.8020653633
+打小 11.598092559
+黑路 13.2075304714
+男科 10.533381822
+心理卫生 11.1926274509
+画蛋 13.900677652
+出汗 8.6966709649
+抓过 10.1164880181
+蒲东林 13.900677652
+郑之瑞 13.2075304714
+学生处 13.900677652
+此风 10.6818018271
+阴盛 11.9547675029
+半通 11.8212361103
+馆员 11.1280889297
+穿耳 12.8020653633
+于长平 11.8212361103
+拉斯坎 13.900677652
+出水 9.08039608637
+摆上 8.99540287354
+摆下 10.3453295905
+林中采 13.900677652
+山歌 9.87532596124
+司徒尚纪 9.44633035572
+诵念 11.2616203224
+望行者 11.598092559
+铁饭 12.8020653633
+鲤鱼 8.64840422393
+苍耳子 11.9547675029
+南渡江 11.3357282945
+流通手段 8.87023973058
+后主 9.17328983326
+出气 9.07236391467
+塞尔维亚人 10.0720362555
+铁饼 11.1280889297
+塑料厂 12.2912397395
+第四群 12.5143832909
+五百六十万 13.900677652
+海沙 11.598092559
+清流县 12.5143832909
+近现代史 13.2075304714
+崇州 13.2075304714
+构造型 12.8020653633
+盘头 12.5143832909
+第三番 12.8020653633
+回填土 13.900677652
+浸出 10.9049453784
+士充 13.2075304714
+国有国法 12.1089181827
+墨池 11.8212361103
+最妙 11.1280889297
+沉沙池 11.598092559
+摆件 12.1089181827
+解成仙 12.8020653633
+水天一色 11.598092559
+付账 11.4157710022
+张国淦 12.8020653633
+打岔 10.765183436
+别有情趣 12.2912397395
+崇左 11.9547675029
+付费 9.45802639549
+半部 9.46986085313
+渗到 12.2912397395
+有吃有穿 11.598092559
+游子吟 12.5143832909
+飞红 10.4994802703
+墨汁 9.87532596124
+画虎 12.1089181827
+益利 13.900677652
+构成主义 12.1089181827
+股癣 12.1089181827
+庐山 8.85725253506
+蛇蝎为心 13.900677652
+张广泗 11.0103058941
+飘着 10.3171587135
+叶树科 12.8020653633
+那僧 11.8212361103
+出没 8.43684584695
+墨水 9.80633308975
+意见建议 11.0674643079
+顿饭 9.19114745066
+出油 11.0674643079
+飞经 11.7034530746
+占廷军 12.5143832909
+寇孙观 13.2075304714
+越州 9.96885201925
+曾蒙 12.5143832909
+碧痕 11.5027823792
+铺得 11.5027823792
+拉斯基 11.598092559
+舍娃 13.900677652
+太闵氏 13.900677652
+统购 11.7034530746
+统货 13.900677652
+腥气 10.1164880181
+远程教育 12.1089181827
+长吁短叹 10.3743171274
+山民 9.40086798165
+呆坐 10.0720362555
+林间小道 13.900677652
+可重复性 13.2075304714
+出此 10.2630914922
+婆罗 9.71102290995
+那场 8.4801426527
+无一例外 9.20019728618
+捷足 12.5143832909
+障壁 11.8212361103
+星历 11.4157710022
+建昌县 12.1089181827
+誓不罢休 11.3357282945
+铁鸟 12.5143832909
+参军入伍 12.8020653633
+杨闻言 12.8020653633
+那圈 13.900677652
+山水 7.70016847793
+催眠 10.2897597393
+炸中 12.8020653633
+中等职业 10.8096351986
+四川北路 12.2912397395
+缪勒 11.4157710022
+大戏台 10.533381822
+磐石 10.2897597393
+成仙之 12.1089181827
+袁汉举 13.2075304714
+层峦 13.2075304714
+认个 11.1926274509
+半面 11.4157710022
+虞师 13.2075304714
+卡丁车 12.2912397395
+地形匹配 12.2912397395
+项梁立 13.2075304714
+操作方法 10.2897597393
+性饥渴 12.5143832909
+椰菜 12.5143832909
+阮小七 9.46986085313
+巢湖市 11.598092559
+肌无力 10.9049453784
+经济法学 12.8020653633
+远古文化 12.5143832909
+支神兵 13.2075304714
+施瓦本 11.8212361103
+藏春集 13.2075304714
+排名第 8.92394390956
+于石亭 12.5143832909
+集散地 8.3285236198
+星号 10.5684731418
+劳燕分飞 12.2912397395
+晏平仲 13.2075304714
+打字 10.642581114
+里程 8.15128466607
+半露 11.1280889297
+打孔 10.9049453784
+管牧放 13.2075304714
+冯保见 12.2912397395
+碎玻璃 10.9562386728
+改革调整 13.900677652
+那块 7.91926344072
+自立军 10.604840786
+记实 12.8020653633
+山沟 8.94485059437
+暮日 13.2075304714
+幻数 13.2075304714
+牵涉 9.53122979951
+磕打 11.9547675029
+拉纳卡 13.900677652
+打定 10.1871055853
+山河 9.04086524761
+瓦埠湖 11.7034530746
+飞禽 10.0940151622
+吴蕴初 11.4157710022
+色拉油 12.2912397395
+本贯州 13.2075304714
+符坚 11.8212361103
+杜冷丁 11.9547675029
+第三版 10.5684731418
+蒲殿俊 13.2075304714
+因而 5.65450609212
+半音 10.4994802703
+截头 12.2912397395
+董贵人 13.2075304714
+磕头如捣蒜 11.4157710022
+用兵如神 11.4157710022
+打完 10.0088573539
+弹法 13.900677652
+石虎养 12.8020653633
+阮小二 9.55687223012
+正屋 11.9547675029
+打对 12.2912397395
+二十四节气 10.0940151622
+含沙量 8.74738605748
+三八二十四 13.900677652
+飞秒 12.8020653633
+贵金属 8.30596627237
+汉丹铁路 11.8212361103
+出殡 10.642581114
+金元宝 12.1089181827
+铁黑 12.8020653633
+长驱直入 10.0294766411
+氯纶 11.9547675029
+山泉 10.1871055853
+突入 9.75754292558
+进口棉 12.5143832909
+无能无力 13.2075304714
+戎行 11.9547675029
+测谎器 12.8020653633
+吴昌硕 10.642581114
+浏览 9.14708746087
+喜儿 13.2075304714
+山泽 11.0103058941
+宜居城市 11.9547675029
+王自立 13.2075304714
+安世高 12.1089181827
+雷家庄 13.2075304714
+星占 12.2912397395
+五十余里 11.9547675029
+膜法 12.8020653633
+书籍装帧 11.9547675029
+漾漾 11.9547675029
+阮氏 11.1280889297
+赶下台 11.4157710022
+制服呢 13.2075304714
+博茨瓦纳 10.0088573539
+长卷发 12.5143832909
+山洞 8.10766404359
+磷光体 12.8020653633
+承办 8.9102450652
+折腰 11.0674643079
+普罗维杰 13.900677652
+付讫 12.2912397395
+门拉手 12.2912397395
+穆尔特 11.8212361103
+倒三角 12.8020653633
+山洼 11.3357282945
+筑坛拜将 12.8020653633
+夸梅 13.900677652
+刻不容缓 9.35738286971
+条钢 13.900677652
+于玉麟 11.8212361103
+远渡重洋 11.9547675029
+山洪 9.94943393339
+布尼奥罗 13.2075304714
+寻夫至 13.2075304714
+二千元 12.8020653633
+浸在 10.3743171274
+赶下去 11.7034530746
+翘足而待 13.900677652
+半阕 13.900677652
+罗亚尔 11.8212361103
+甚殷 12.5143832909
+平面图 10.8096351986
+遏止 9.4233408375
+兼任 7.51886163457
+牢狱之灾 11.598092559
+劳动效率 11.9547675029
+汪朝光 10.8096351986
+遥不可及 11.0103058941
+牛迹岭 11.8212361103
+纵火案 11.2616203224
+三百万两 12.8020653633
+东芝公司 11.5027823792
+汝州市 10.8096351986
+馆前 12.1089181827
+焦糊糊 13.2075304714
+罗亚尼 12.8020653633
+弹药罪 13.900677652
+山海 9.5186510173
+昆山市 11.7034530746
+依我看来 11.8212361103
+商品化 9.98865464655
+羊毛毡 11.7034530746
+观赏植物 9.58318953844
+付诸 10.642581114
+应弦飞 13.2075304714
+沈河区 12.8020653633
+居元朝 12.5143832909
+例题 13.2075304714
+巨大成功 10.1630080337
+统计 5.70396524476
+东北边 12.5143832909
+鼓胀 10.7226238216
+须存 13.2075304714
+飞碟 10.6818018271
+季洛杜 13.2075304714
+山涛 10.9049453784
+碧玺 11.4157710022
+心悬 11.9547675029
+板簧 12.2912397395
+甲型肝炎 11.9547675029
+别儿哥 11.4157710022
+畜肉 13.2075304714
+亲水 10.9049453784
+褚时健 13.2075304714
+无规律 11.0103058941
+花开两朵 13.900677652
+兰翎 12.8020653633
+益二州 12.2912397395
+凯泽 12.1089181827
+缛丽 13.900677652
+搁置 9.33632946051
+畜肥 13.900677652
+山涧 9.89334446674
+盗走 11.1926274509
+张明山 12.2912397395
+可退回 13.2075304714
+飘然 9.69598503258
+碧玉 9.45802639549
+石库门 12.5143832909
+形象 6.41294389054
+米第亚 13.2075304714
+喟然长叹 12.2912397395
+喷粪 13.2075304714
+雕饰 10.1871055853
+金强 9.71102290995
+那国 11.5027823792
+商业中心 8.98069672615
+玉速帖 13.2075304714
+乌审旗 10.604840786
+感情纠缠 13.900677652
+干瘪瘪 13.900677652
+崇安 10.4666904475
+股灾 10.765183436
+出事地点 11.8212361103
+一亿零五百万 13.2075304714
+喜不喜欢 11.8212361103
+大众汽车公司 12.5143832909
+漾濞 11.1280889297
+雷诺氏 13.2075304714
+照镜子 10.3171587135
+冯白驹 13.2075304714
+阴灵 12.5143832909
+希尔顿 12.1089181827
+密封面 13.900677652
+记忆系统 13.2075304714
+舍尔 10.9049453784
+布朗运动 10.9562386728
+阴火 10.0294766411
+私有土地 11.4157710022
+盗贼 9.07236391467
+两百五十八家 13.2075304714
+募捐箱 11.8212361103
+赛道 12.1089181827
+胡子拉碴 11.5027823792
+统裙 11.598092559
+宜兰雨 13.2075304714
+确凿不移 13.900677652
+搓过去 13.900677652
+打头 9.93038573842
+怨恨 8.68574189437
+模糊数学 12.5143832909
+钻井工程 12.2912397395
+跏趺 11.9547675029
+范进中 12.8020653633
+捷达 10.3453295905
+冯保让 12.1089181827
+广交 12.1089181827
+电绝缘 11.5027823792
+爱知县 11.7034530746
+烤箱 11.4157710022
+木焦油 13.900677652
+钧谕 11.2616203224
+猛投 13.2075304714
+山之南 11.5027823792
+心地纯洁 13.2075304714
+低蛋白 10.604840786
+父亲节 12.5143832909
+外敷药 12.2912397395
+艰苦备尝 13.900677652
+三万斤 13.900677652
+中大通 12.2912397395
+止泻药 11.9547675029
+飞符 12.8020653633
+打好 9.46986085313
+山湖 13.2075304714
+郭祥转 13.900677652
+小康生活 12.2912397395
+四十二章 12.8020653633
+最低值 10.1871055853
+卖盘 9.89334446674
+王希孟 12.8020653633
+第三点 11.598092559
+色纱 12.2912397395
+许婚 11.9547675029
+毫不迟延 13.900677652
+天师 9.43476953332
+怨怒 12.2912397395
+于老夫 13.900677652
+闻鹤村 11.598092559
+四十出头 11.2616203224
+山湾 11.1926274509
+细声细气 11.1280889297
+和普京 13.900677652
+直流电源 10.4666904475
+康世恩 12.8020653633
+金枪鱼 9.93038573842
+感染期 11.598092559
+捷运 12.8020653633
+卖相 11.9547675029
+积极行动 10.4994802703
+红三色 12.5143832909
+铁鱼 13.2075304714
+广仁 12.2912397395
+怨怅 12.1089181827
+座上宾 11.3357282945
+广为 8.80692745117
+生灵涂炭 11.4157710022
+补上来 13.900677652
+坐以待旦 13.2075304714
+一票否决 11.3357282945
+六朝金粉 12.2912397395
+落英缤纷 12.1089181827
+馆内 10.4994802703
+警察局 10.1394775363
+星儿 11.7034530746
+广东 6.23773980151
+续文献 11.4157710022
+阿基兰 13.2075304714
+半间 10.8561552143
+舵手 10.5684731418
+邹涛 13.2075304714
+地图学 10.8561552143
+达延汗 11.5027823792
+半门 13.900677652
+中心区 9.6811699468
+胡戈 13.2075304714
+清心寡欲 10.6818018271
+山溪 9.77354326693
+政治阴谋 13.2075304714
+艾菲尔铁塔 12.8020653633
+杨鹏 13.900677652
+蓇葖 10.765183436
+沈君玉 13.900677652
+愚人 10.8096351986
+姜鼓 13.2075304714
+可于 9.66657114738
+波吕斐 12.8020653633
+空城 10.9049453784
+火花塞 11.3357282945
+井俊二 11.8212361103
+吕蒙正 11.7034530746
+超然物外 11.8212361103
+星光 8.59737274392
+项链 9.59661255877
+液晶屏幕 13.900677652
+定制 8.30596627237
+拼过去 13.900677652
+色纯 12.8020653633
+取信于 11.7034530746
+李尽忠 13.2075304714
+舍弃 9.27570483869
+孔明便 12.2912397395
+郭祥迎 13.2075304714
+领章 10.6818018271
+怨悔 13.2075304714
+出榜 9.89334446674
+定海神针 11.3357282945
+广之 13.2075304714
+大多数名 13.2075304714
+广义 7.51886163457
+一百五十万元 13.2075304714
+逃跑主义 13.900677652
+舍弟 10.765183436
+侍臣扶 13.2075304714
+朱呈祥 11.5027823792
+掌渐生 13.2075304714
+三甲胺 11.7034530746
+无家无室 13.2075304714
+本项 12.2912397395
+平湖市 12.1089181827
+和平奖 10.533381822
+统觉 11.7034530746
+盗运 12.2912397395
+缪凤 12.5143832909
+哥俩 10.4666904475
+畜舍 12.2912397395
+统观 11.9547675029
+崇奉 10.2630914922
+梯子 9.26594866375
+载物 11.598092559
+沃尔特斯 13.2075304714
+问这问那 11.3357282945
+颁布实施 10.3453295905
+险胜 11.9547675029
+那名 9.91169360541
+座上客 11.8212361103
+明崇祯 9.7898037878
+前无古人 11.7034530746
+俗尚 13.2075304714
+空域 9.87532596124
+产权法 13.2075304714
+汲冢周 12.2912397395
+科工贸 13.900677652
+撞车 10.1871055853
+戎语 12.5143832909
+党组会 12.8020653633
+灵活性 7.92941581219
+喜功 13.900677652
+排水量 8.0985592766
+体坛周报 13.900677652
+喜力 13.900677652
+出格 10.2897597393
+西王印 12.8020653633
+吕元晤 13.900677652
+王险城 13.2075304714
+郑丰喜 13.900677652
+经济落后 10.3743171274
+半年报 8.43684584695
+金猴降妖 13.900677652
+工程管线 12.8020653633
+怨愤 10.6818018271
+黄公覆 12.1089181827
+卢舍那 11.9547675029
+符咒 10.5684731418
+沙祖康 13.900677652
+车模 11.9547675029
+饮马长江 12.5143832909
+性善论 12.1089181827
+建构 10.8096351986
+椰胡 12.2912397395
+四十二篇 12.8020653633
+走着瞧 9.91169360541
+玉树藏族自治州 11.0103058941
+打躬作揖 11.4157710022
+拉斯卡 13.2075304714
+墨梅 12.8020653633
+诈骗犯 12.5143832909
+写字楼 9.15574552361
+障子 13.900677652
+产供销 11.5027823792
+中介代理 13.900677652
+符命 11.7034530746
+垂涎欲滴 11.2616203224
+胡达奎 13.900677652
+胜利路 11.598092559
+唐师父 12.2912397395
+商礼和 12.5143832909
+宣王 10.2897597393
+破坏力 10.4349417492
+利国利民 11.8212361103
+阴爻 11.598092559
+出将入相 11.7034530746
+酿成 8.61747392324
+延宕时日 13.900677652
+喜剧 8.27305653829
+远大前程 13.900677652
+阴爪 10.765183436
+三十一二岁 13.900677652
+司徒乔 12.8020653633
+陈光蕊 11.598092559
+会尽 12.8020653633
+宏村 13.900677652
+喷绘 13.2075304714
+好几十万两 13.2075304714
+代理行 11.4157710022
+严丝合缝 10.9049453784
+莫企逊 11.8212361103
+画船 11.9547675029
+丁部领 12.8020653633
+承祯为 13.2075304714
+饱暖思淫欲 12.1089181827
+武穴市 12.2912397395
+半桩 11.7034530746
+电老虎 13.2075304714
+画舫 10.9562386728
+两次 6.19947747112
+圆二色性 13.2075304714
+行东 12.5143832909
+稍有不慎 10.4994802703
+白金卡 11.598092559
+午安 13.900677652
+痈肿 11.1926274509
+呼图壁县 12.8020653633
+布勃诺 13.2075304714
+虚饰 12.2912397395
+十万八千里 10.3171587135
+四十七中 12.2912397395
+边际 7.9817837977
+户枢不蠹 13.900677652
+若干面 13.2075304714
+四十七个 12.2912397395
+符合 6.13723126325
+长程 10.7226238216
+耗氧量 11.3357282945
+纳雍县 13.900677652
+四方脸 11.5027823792
+改良 7.72273353793
+六七处 13.2075304714
+遗绪 13.900677652
+沉闷 8.83808261895
+子窦林 13.2075304714
+刘备方 13.2075304714
+南塘 12.2912397395
+改色 11.598092559
+摸到 9.12155415886
+电气设备 9.7898037878
+耍猴儿 13.900677652
+众议院 8.96620371885
+云子 12.2912397395
+羊毛皮 13.2075304714
+没商量 11.0674643079
+海因茨 12.8020653633
+肚腩 12.1089181827
+六七天 10.9049453784
+王召燕 12.8020653633
+水文气象 11.3357282945
+阿科松博 13.2075304714
+猛拍 11.7034530746
+户型图 12.5143832909
+催款 11.7034530746
+值得一看 11.8212361103
+东中部 11.7034530746
+钧鉴 13.2075304714
+两三天 8.87023973058
+奥连布 13.2075304714
+数以百万计 10.9049453784
+坚毅 9.89334446674
+马祖庵 12.8020653633
+社交圈 13.900677652
+抓钩 11.0103058941
+白湖 13.2075304714
+篇文章 9.31571017331
+水生成 11.7034530746
+朱滔留 12.8020653633
+肚脐 10.1164880181
+遥感平台 12.1089181827
+碧湖 12.2912397395
+宣汉 12.5143832909
+里昂 8.97342396682
+妞儿 9.74179456862
+两三处 11.9547675029
+诸家曲 13.2075304714
+出省 11.8212361103
+宏碁 11.9547675029
+馆使 12.5143832909
+巫女 11.3357282945
+擅长 7.61281909181
+邀功请赏 12.1089181827
+旧恨新仇 12.8020653633
+龙图 11.8212361103
+山火 11.8212361103
+幼名 11.598092559
+不漏水 13.900677652
+玄军 13.900677652
+绣花针 11.5027823792
+吴班引 12.8020653633
+经商者 11.8212361103
+茂名 9.75754292558
+云寺 11.1280889297
+震聋发聩 13.900677652
+北迎海 12.8020653633
+老主顾 10.9562386728
+职业技能 11.1926274509
+公交公司 10.7226238216
+碧溪 13.2075304714
+最低价 9.06439574502
+英雄末路 12.8020653633
+欧尔 13.2075304714
+前列康 13.900677652
+支撑点 9.91169360541
+铁花 13.900677652
+平北 11.7034530746
+能源行业 9.61021821083
+郭祥醒 13.2075304714
+八九天 12.8020653633
+山炮 10.7226238216
+九八年 12.2912397395
+弹炮 11.598092559
+尼西 13.2075304714
+多妻 12.8020653633
+星体 10.3743171274
+平方海里 13.900677652
+淫秽物品 11.598092559
+飞旋 11.2616203224
+赫尔利 11.598092559
+股海 11.1926274509
+麦片粥 12.1089181827
+士兰 10.6818018271
+和开田 9.43476953332
+糟踏 10.2371160058
+擅闯 13.900677652
+汪塘 13.900677652
+何心 11.8212361103
+骑得 11.0674643079
+反馈性 13.900677652
+改节 12.8020653633
+果场 13.900677652
+王将军 12.2912397395
+于紫微 13.900677652
+宣泄 9.33632946051
+铁英 11.9547675029
+明之世 13.2075304714
+云安 11.1926274509
+诨名 11.8212361103
+果在 12.1089181827
+增值额 13.2075304714
+盗采 13.2075304714
+阴沟 10.6818018271
+铁范 13.2075304714
+里来 8.73589167805
+特别法 11.5027823792
+偷走 10.2371160058
+毕贺 13.900677652
+北峪河 12.5143832909
+三拳两脚 12.5143832909
+日本自由党 13.2075304714
+压电效应 11.598092559
+萨纳加 12.8020653633
+星云 8.97342396682
+杨士琦 11.7034530746
+阴沉 8.58747167293
+二地主 11.7034530746
+平顶海山 12.2912397395
+亮氨酸 12.1089181827
+群峰 9.85762638414
+小集团 10.765183436
+防暴警察 12.5143832909
+汉园集 12.8020653633
+墨盒 11.2616203224
+马费奥 13.2075304714
+馆主 12.2912397395
+托根贝 13.900677652
+顾及 9.07236391467
+边水 13.900677652
+人类学系 12.8020653633
+赛车 9.96885201925
+电子数据交换 12.8020653633
+四二年 13.2075304714
+果园 8.50251495046
+吴奎 13.2075304714
+厕所 8.05135287203
+左右壁 13.2075304714
+百余次 12.5143832909
+吴昌时 12.5143832909
+龙城 10.2117981979
+拉丹冬 11.9547675029
+富士通杯 13.900677652
+桃汛 13.2075304714
+拉网式 11.598092559
+桃江 11.598092559
+生张熟魏 13.2075304714
+光电效应 10.4666904475
+膜炎 11.1926274509
+碧潭 11.9547675029
+学究气 12.8020653633
+外套膜 10.8561552143
+行政处罚 8.92394390956
+阿墨江 12.8020653633
+射下 10.642581114
+领导批示 12.5143832909
+海正药业 10.642581114
+穆顺 12.5143832909
+一路顺风 11.9547675029
+休斯敦 10.2117981979
+倾巢而出 11.1926274509
+群岛 7.35532799164
+骑师 13.2075304714
+中情局 13.900677652
+飘洋 13.900677652
+慕田峪 12.5143832909
+江原道 12.1089181827
+罗切斯特 11.9547675029
+阴气 9.30555780184
+庙堂 9.62401153296
+肚胀 12.5143832909
+驽马恋栈 13.900677652
+一百五十万两 13.900677652
+口拙 13.900677652
+大半截 11.8212361103
+垂首丧气 13.900677652
+侯国的 11.7034530746
+飘洒 10.9562386728
+两三声 11.7034530746
+伯益之 13.2075304714
+群山 8.68574189437
+北朝元 13.2075304714
+分组会 13.900677652
+星主 10.8096351986
+马森 11.7034530746
+楚悼王 11.5027823792
+应募者 11.9547675029
+外套腔 13.2075304714
+群居 10.0294766411
+灯亮了 10.642581114
+嘉奖令 13.900677652
+股民 7.68407155089
+旭日 10.765183436
+龙场 12.5143832909
+出盘 13.900677652
+飞播 12.8020653633
+粗声大气 12.5143832909
+赛迪 11.0674643079
+立成仪 12.5143832909
+各有特点 10.533381822
+六万多 12.1089181827
+肌节 12.5143832909
+那思摩 13.2075304714
+短视症 13.900677652
+兵马俑 9.7898037878
+不象话 11.0674643079
+言来语去 11.9547675029
+某个字 13.900677652
+事迹材料 13.900677652
+七派 13.900677652
+老年期 10.9562386728
+可说是 9.20932976975
+无法自拔 11.5027823792
+近半年 9.48183704418
+呆滞无神 13.900677652
+群小 11.7034530746
+免疫检测 12.1089181827
+飘浮 9.54396882529
+肚肠 10.4349417492
+赛达 13.900677652
+一千零一夜 10.8561552143
+曹子孝 13.900677652
+为政以德 12.8020653633
+百炼钢 11.8212361103
+五十多户 13.2075304714
+周元王 12.1089181827
+缆船 12.8020653633
+恩断义绝 12.5143832909
+广元 9.82314020807
+向东走 11.598092559
+出自于 11.0674643079
+碧水 10.2117981979
+菜品 10.2897597393
+查理大帝 10.8096351986
+庙宇 8.53470163695
+石子路 12.1089181827
+带动 6.20219486409
+亲率 8.74162235276
+凶年 11.598092559
+左右宗 13.900677652
+铁耙 13.2075304714
+亲王 7.44233936863
+出界 11.1926274509
+飞机 5.95938208107
+驸马 8.56313957227
+大漆 11.8212361103
+飘溢 12.5143832909
+侯相楚 13.2075304714
+朗福德 11.9547675029
+鸿才 13.900677652
+弹片 10.0294766411
+清灵宝 12.5143832909
+王统照 11.8212361103
+广东发展银行 11.0674643079
+付钱 10.4041700905
+中财网 10.0505300503
+柴郡 11.9547675029
+林丽韫 13.2075304714
+刺激剂 12.8020653633
+云头 8.80692745117
+黑甲 11.7034530746
+待建 12.1089181827
+尼诺 13.2075304714
+上海市房地局 13.900677652
+野山参 11.9547675029
+凤鸟纹 13.2075304714
+炸伤 10.765183436
+云大 12.8020653633
+碧池 13.2075304714
+云天 10.2897597393
+出电 13.900677652
+金鸡纳树 12.1089181827
+紫紫 13.2075304714
+敏感时期 11.4157710022
+国姓 11.7034530746
+碧江 12.2912397395
+画龙 12.8020653633
+五十几个 12.8020653633
+龙哥 12.2912397395
+田根 13.2075304714
+销势 13.900677652
+大通县 12.2912397395
+出生 7.0644183747
+亲和力 10.0940151622
+杨恭如 12.5143832909
+摆在 7.63918596765
+碳素 10.4666904475
+飞来 8.70218062071
+支撑物 13.2075304714
+马鲁一世 13.2075304714
+韦氏临 12.8020653633
+满天飞 10.0940151622
+刘备未 13.2075304714
+万马奔腾 10.8096351986
+颜大怒 12.5143832909
+自熄性 12.2912397395
+妙辞 13.900677652
+半角 11.4157710022
+加速度 8.89673134603
+男青年 10.0294766411
+两三寸 13.2075304714
+广利 11.3357282945
+定单 10.4666904475
+空在 12.5143832909
+曹全碑 13.2075304714
+死信 13.2075304714
+输入 7.06013112269
+班言官 12.8020653633
+第零 12.5143832909
+龙含 11.8212361103
+定南 11.598092559
+龙启 12.8020653633
+尤里克 13.900677652
+四十七卷 13.2075304714
+普氏 11.0103058941
+孔明叹 11.4157710022
+飞架 11.8212361103
+珐瑯 13.900677652
+飘渺 11.1280889297
+濡染 12.1089181827
+闭起 10.2371160058
+欧市 12.8020653633
+名山大川 10.4994802703
+六七家 12.8020653633
+不胜枚举 10.5684731418
+龙吴 13.2075304714
+依靠集体 12.5143832909
+惠安崇 13.900677652
+男性 7.23499393419
+墨画 12.8020653633
+孤陋寡闻 11.1280889297
+湘桂铁路 10.4994802703
+隋堤 12.2912397395
+裸体画 12.5143832909
+和慧珠 12.8020653633
+十门 12.8020653633
+砖室墓 11.9547675029
+财经证券 13.900677652
+碧波 9.98865464655
+尹达 11.7034530746
+自作孽 11.598092559
+闭管 13.900677652
+两三家 11.598092559
+百余步 11.9547675029
+那鼎盖 13.900677652
+金属矿 9.85762638414
+殊相 13.900677652
+公使衔 12.2912397395
+闻得今 12.8020653633
+中原油田 10.9049453784
+感泣 12.2912397395
+夸着 13.900677652
+麦饭石 10.9562386728
+建树 8.98069672615
+花大姐姐 12.2912397395
+十样锦 13.2075304714
+既然如此 8.58747167293
+六七寸 13.900677652
+仰慕者 13.900677652
+碧泉 13.900677652
+抓阄 11.3357282945
+欧德 12.2912397395
+依恃 10.9049453784
+达斡尔 9.6811699468
+福建省 7.96578345636
+汪家 11.5027823792
+通宝钱 11.8212361103
+棋类 11.0674643079
+失意者 12.2912397395
+柔情蜜意 11.5027823792
+里数 11.5027823792
+果品 8.64840422393
+羊毛疔 13.900677652
+广厦 11.7034530746
+邓大妙 12.8020653633
+亮度对比 13.900677652
+法约尔 12.2912397395
+描花 11.9547675029
+缀文 13.2075304714
+臭水 11.3357282945
+方有圆 13.900677652
+卡斯托尔 13.2075304714
+一串串 9.85762638414
+空地 8.50705010562
+时发雷 12.8020653633
+脸厚 11.7034530746
+溥仁寺 12.8020653633
+神宗赐 12.8020653633
+四十多斤 13.2075304714
+焚烧厂 12.8020653633
+山猪 12.2912397395
+年发电量 9.23723855786
+碧海 11.1280889297
+半年线 8.11378027061
+巫婆 11.2616203224
+软骨鱼类 11.5027823792
+五十余辆 13.2075304714
+替罪羊 10.8096351986
+枕形畸变 13.900677652
+铁腕 11.2616203224
+毕轨 12.1089181827
+凤泉区 12.8020653633
+睫毛 9.25628675283
+解说词 11.8212361103
+喜事 9.06439574502
+施关发 13.900677652
+蓝桥 12.5143832909
+膜状 11.3357282945
+打嗝儿 13.2075304714
+七数 13.2075304714
+胡秋原 13.900677652
+园林形式 13.900677652
+识别方法 13.900677652
+喜人 9.34680076038
+并无二致 11.598092559
+出球 12.2912397395
+弓未拉 13.2075304714
+高考作文 12.1089181827
+蕴含 9.02548032877
+广安门 11.2616203224
+职工教育 13.2075304714
+赫尔内 13.2075304714
+田弘遇 11.2616203224
+林巧稚 11.8212361103
+绣花鞋 11.0103058941
+申渐高 13.900677652
+赛跑 9.82314020807
+改自 12.8020653633
+广医 13.900677652
+喜乐 11.4157710022
+卷土重来 8.66423568915
+弹珠 13.2075304714
+晋西北 10.1871055853
+膜片 11.7034530746
+无功而返 10.4349417492
+劝开 12.1089181827
+迷人眼 13.900677652
+山玉 13.2075304714
+山王 11.2616203224
+拒不接受 10.9049453784
+进步人士 10.1630080337
+居宅 11.9547675029
+大柱子 13.2075304714
+亲父 13.2075304714
+杜勋必 13.900677652
+半裸 10.5684731418
+果味 11.8212361103
+到时候 7.93453091285
+设计规划 11.9547675029
+好几封 12.8020653633
+亲爹 10.3743171274
+局域平衡 13.900677652
+续道藏 12.8020653633
+捏脚捏手 13.900677652
+故址 9.84023464143
+内塔尼亚胡 11.598092559
+咽喉癌 13.2075304714
+四大家族 10.3171587135
+欧式 10.4666904475
+网络系统 10.8096351986
+山环 11.9547675029
+大路歌 13.2075304714
+铁臂 12.2912397395
+赵谦本 12.8020653633
+张性 11.8212361103
+钻石项链 12.5143832909
+孔明劝 13.2075304714
+里斯 10.1164880181
+半袖 12.1089181827
+英年早逝 11.1280889297
+赵简子 12.1089181827
+二十八员 12.2912397395
+纯收益 12.2912397395
+碳粉 13.2075304714
+臭骂一顿 12.5143832909
+半袋 11.1280889297
+字符串 8.61747392324
+大气迁移 13.900677652
+第三派 13.2075304714
+果名 13.900677652
+山珍 10.9049453784
+描龙绣凤 13.2075304714
+难能可贵 9.66657114738
+阴湿 10.2371160058
+穆尔河 12.8020653633
+太平洋地区 10.0720362555
+广博 9.94943393339
+参数均 12.8020653633
+广南 10.6818018271
+调料作物 13.900677652
+梁上跳 12.2912397395
+汪子 13.900677652
+隋复 12.1089181827
+史末资 12.5143832909
+凶徒 10.7226238216
+李玉茹 13.900677652
+聚碳酸酯 11.5027823792
+凶得 11.9547675029
+烤晒 11.9547675029
+萧楚女 12.5143832909
+译经 10.1394775363
+抢先一步 10.5684731418
+伯克利分校 10.8561552143
+宋向金 12.1089181827
+多米尼加 10.2117981979
+那青衫 13.900677652
+近地 9.96885201925
+低温气候 13.2075304714
+黑车 10.604840786
+说得过去 10.2630914922
+监管区 13.2075304714
+彩旗猎猎 13.900677652
+云彩 9.24671730182
+隋建 12.1089181827
+亲疏 10.4041700905
+慈江道 13.900677652
+虚惊一场 10.8561552143
+进在 13.2075304714
+金凯德 13.2075304714
+半载 10.8561552143
+空想家 12.8020653633
+马克思主义者 9.96885201925
+公开处理 13.900677652
+任范阳 12.8020653633
+美国会众议院 13.900677652
+半轴 12.5143832909
+砂盘 13.900677652
+里手 13.900677652
+等价物 8.60737282725
+武冈市 11.9547675029
+急脉缓受 13.900677652
+那会 9.59661255877
+那伙 8.80081122415
+山青水 13.2075304714
+太晖观 12.8020653633
+半车 12.8020653633
+马公镇 12.8020653633
+克尽孝 13.900677652
+沈公 13.900677652
+濮氏 13.2075304714
+曹子建 12.1089181827
+小驴儿 13.2075304714
+汪峰 12.8020653633
+宋江进 12.8020653633
+职工大学 13.2075304714
+山瑞 12.8020653633
+大忙时节 13.900677652
+大油 12.8020653633
+听众席 12.2912397395
+摸入 12.8020653633
+跳升 10.6818018271
+弹琴 9.71102290995
+苗凯 9.49395840471
+出猎 10.4349417492
+黑龙洞 12.5143832909
+黄琪翔 12.1089181827
+那位 6.94413220882
+弹球 12.5143832909
+辗转 8.32472854883
+弃本逐末 12.5143832909
+熟客 11.5027823792
+挑子 10.1394775363
+铺展开 13.900677652
+墨玉 11.3357282945
+摄论 12.1089181827
+跳荡 11.5027823792
+阒寂 12.5143832909
+群妖 10.1394775363
+新鲜菜 13.900677652
+濮水 12.8020653633
+爱国人士 10.1871055853
+建设史 11.9547675029
+选择项 13.900677652
+建设司 11.9547675029
+涮锅 12.2912397395
+画饼 12.8020653633
+副职 9.96885201925
+参数值 11.598092559
+闭一只眼 10.2371160058
+查究 11.5027823792
+小孙孙 11.9547675029
+人民银行 8.79473217808
+摆出 8.50251495046
+孔有德 11.9547675029
+里拉 9.65218240993
+性格外向 12.8020653633
+杨轻叹 13.2075304714
+小屁孩 12.2912397395
+七政 12.5143832909
+阴络脉 12.8020653633
+曲别针 13.900677652
+一百二十五年 13.2075304714
+跳变 13.2075304714
+泄出来 13.2075304714
+刘书经 11.0103058941
+酿祸 13.2075304714
+如蚁附膻 12.8020653633
+铁蛋 11.598092559
+萨巴赫 11.2616203224
+监管司 12.8020653633
+撞针 11.2616203224
+大半杯 12.1089181827
+名不符实 12.8020653633
+宋汉中 13.2075304714
+龙剑 13.900677652
+喷施 11.8212361103
+小孙子 10.6818018271
+出现 3.84296799359
+简阅民 13.2075304714
+伯吉斯 11.9547675029
+半格 13.2075304714
+爬来 13.900677652
+浸于 11.9547675029
+半边 9.12155415886
+泪液 10.4041700905
+骆谷 12.2912397395
+跳台 10.8096351986
+胡人常 13.2075304714
+大沟 11.0103058941
+林业部门 11.9547675029
+奥洛夫 12.8020653633
+广告 7.37271973435
+建设厅 10.3453295905
+男星 11.8212361103
+十多分钟 11.5027823792
+血尿 9.58318953844
+隋帝 13.2075304714
+那个 4.74595570376
+哥们 10.9049453784
+小穴 12.8020653633
+民主选举 11.2616203224
+更有 7.25428713713
+司晨 12.8020653633
+不放过 9.94943393339
+善策 9.82314020807
+那丹 12.8020653633
+八九岁 11.1926274509
+呼吸声 11.0103058941
+爱克卒 13.900677652
+桃树 10.1871055853
+乙地 13.2075304714
+帅众 10.642581114
+孔明告 13.2075304714
+出牌 10.9562386728
+山田 11.9547675029
+黑龙江 7.42833135747
+山甲 12.1089181827
+出版 6.10215459835
+孔明命 13.2075304714
+那丁 13.900677652
+跳到 8.9308643524
+两三层 11.8212361103
+译码 11.0674643079
+赫尔城 13.900677652
+桃核 11.7034530746
+和鹫峰 13.2075304714
+左右岸 12.5143832909
+汲冢书 12.1089181827
+阮琴 13.2075304714
+画风 9.04864738806
+仔细听 10.1630080337
+真章儿 12.1089181827
+醉舞 13.2075304714
+强劲有力 11.1926274509
+幼儿 9.31571017331
+金泳三 11.8212361103
+阴棒 13.900677652
+选择题 10.9049453784
+第三段 11.5027823792
+流亡政府 10.8096351986
+皮维斯 13.2075304714
+低眉垂眼 13.2075304714
+龙发 13.900677652
+机诈 11.8212361103
+买笑追欢 13.900677652
+闭口无言 12.5143832909
+那么 4.60077083664
+魏博遂 12.8020653633
+丁级 13.900677652
+另当别论 10.3743171274
+巴洛克式 11.4157710022
+隋律 12.5143832909
+擦起来 13.900677652
+龙口 9.80633308975
+画题 12.1089181827
+两三封 13.900677652
+回肠荡气 11.4157710022
+阴森 9.45802639549
+欧姆 10.7226238216
+巫山 9.0884932966
+印度尼西亚语 11.4157710022
+晕呼呼 13.900677652
+随身带 9.7898037878
+龙台 13.900677652
+花解语 12.5143832909
+洪淤灌 12.1089181827
+贾二爷 12.8020653633
+画页 12.8020653633
+其余部分 9.44633035572
+护国寺 11.598092559
+忧形于色 13.2075304714
+静电聚焦 13.900677652
+六七岁 10.9049453784
+那人 7.33119623156
+宗兄 10.4041700905
+实生林 13.900677652
+出狱 8.56795885871
+发布新闻 11.598092559
+弹性元件 11.8212361103
+邓大人 11.1926274509
+男权 12.8020653633
+赛诺 12.5143832909
+大白痴 13.900677652
+那些 4.80608488854
+撒豆成兵 12.5143832909
+酵母片 13.2075304714
+跳动 8.42421410004
+股栗 11.598092559
+开尔文 10.2371160058
+奉献精神 11.3357282945
+那云 12.8020653633
+灵枢经 12.8020653633
+弹痕 12.5143832909
+攒眉 11.5027823792
+搁板 11.7034530746
+绑回去 13.900677652
+无后效 13.900677652
+门前三包 13.900677652
+云庵 12.5143832909
+第三次 7.28461246684
+龙华 10.3171587135
+引黄灌区 11.1926274509
+檀石槐 10.8561552143
+荀和本 12.8020653633
+杨宝忠 12.5143832909
+黑龙河 11.9547675029
+柳墩 10.2630914922
+淋巴结核 13.2075304714
+人生大事 11.9547675029
+掩旗息鼓 13.2075304714
+汪嵩 13.2075304714
+那份 8.30596627237
+行家里手 10.9562386728
+第三款 11.5027823792
+三百三十万 13.2075304714
+孤独寂寞 11.9547675029
+那件 8.43261751084
+龙南 12.2912397395
+非生物 11.0674643079
+箍桶匠 13.2075304714
+巫峡 10.3171587135
+漏出来 11.7034530746
+那仁 12.8020653633
+勒拿河 10.4994802703
+拉普兰 12.8020653633
+两三岁 11.4157710022
+纹理 9.20019728618
+谪戍 10.9562386728
+侯勋臣 13.900677652
+周浩 9.53122979951
+茂兰 11.9547675029
+喷撒 13.2075304714
+半身 10.3171587135
+纵火烧 11.5027823792
+广商 13.900677652
+柏灌丛 12.8020653633
+同里镇 13.2075304714
+龙卷 11.0674643079
+王任重 13.2075304714
+巴勒莫 11.2616203224
+就职演说 12.1089181827
+爱云 10.0505300503
+改葬 12.2912397395
+摆卖 12.2912397395
+尼达 12.5143832909
+今吾 11.1280889297
+撑死 11.2616203224
+塑料件 11.9547675029
+方有利 12.2912397395
+花单生 10.2897597393
+黑龙潭 10.9049453784
+知易行难 11.8212361103
+午觉 10.9049453784
+防地 10.642581114
+徬徨 12.8020653633
+超高频 11.0674643079
+杨志玖 11.598092559
+决定系数 11.9547675029
+疗伤 11.8212361103
+富士施乐 12.5143832909
+中老年 10.1871055853
+颇受欢迎 11.1926274509
+克姆契 13.900677652
+王九思 8.81927328699
+获奖 8.28754954559
+番禺区 9.82314020807
+汪庄 11.7034530746
+老股民 10.533381822
+白浪 9.5186510173
+珠联璧合 12.1089181827
+电度表 11.4157710022
+无线电通信 10.1164880181
+阴毛 11.1280889297
+权豪 12.8020653633
+琢磨 7.7083151625
+果农 12.2912397395
+汪廷 12.8020653633
+阴毒 11.5027823792
+别做声 13.900677652
+见所未见 11.5027823792
+这里 4.47482275585
+血库 11.9547675029
+学习年限 11.8212361103
+堆集 12.5143832909
+诡秘地 11.3357282945
+投射物 13.900677652
+尼迪 10.8096351986
+牵着 8.63798746307
+凌岩寺 10.1630080337
+九千九百九十九间 12.2912397395
+楼继伟 10.8561552143
+云崖 12.8020653633
+果冻 11.8212361103
+在战前 11.598092559
+马鲁古 11.5027823792
+碧桃 11.0103058941
+染上瘟疫 12.1089181827
+跳入 10.0294766411
+孤独症 11.598092559
+宋赠封 13.2075304714
+第三桩 12.2912397395
+碧梧 13.2075304714
+曲射炮 13.2075304714
+多晶硅 8.47133202302
+百位数 13.900677652
+各吃 11.8212361103
+延津归 13.2075304714
+长久不衰 13.900677652
+丈人 9.71102290995
+段长 10.9562386728
+亲眷 10.4349417492
+福格尔 13.2075304714
+亲眼 8.81927328699
+官黄澍 12.5143832909
+说错 8.9308643524
+凶嫌 13.2075304714
+云州 10.7226238216
+番禺县 11.3357282945
+晴隆县 13.900677652
+半路 8.84443184663
+和夫兰 13.900677652
+欧威 13.900677652
+薄刃斧 13.2075304714
+飞掠 11.3357282945
+李如柏 13.900677652
+暗渡陈仓 11.0103058941
+衣带渐宽终不悔 13.2075304714
+中国画研究院 11.9547675029
+秋兰姆 13.900677652
+腭裂 11.9547675029
+宝刀未老 13.900677652
+锗晶体 13.2075304714
+惠安女 13.900677652
+喷枪 12.8020653633
+山盟 12.8020653633
+锅盖 10.2117981979
+王府井大街 11.9547675029
+过切 13.900677652
+卡普阿斯 13.2075304714
+亲着 11.2616203224
+老着脸皮 13.2075304714
+第三根 12.1089181827
+跳出 8.42421410004
+二郎神 11.4157710022
+走私贩私 12.1089181827
+赵昀诏 13.2075304714
+果儿 11.1280889297
+淘汰赛制 13.900677652
+亲睹 11.8212361103
+诸行省 11.7034530746
+所得税法 11.2616203224
+咫尺之间 12.2912397395
+总体方案 10.8096351986
+金田起义 11.0103058941
+白浊 13.900677652
+拉法格 11.598092559
+费德林 12.5143832909
+龙冈 11.3357282945
+膜盒 13.900677652
+事态严重 10.9049453784
+和健妇 11.5027823792
+飞成 13.2075304714
+慢半拍 11.8212361103
+巫师 9.75754292558
+水落归漕 13.900677652
+译稿 11.9547675029
+西突厥 9.54396882529
+复习方法 13.2075304714
+两三年 8.6966709649
+王尽美 11.9547675029
+寄出去 12.1089181827
+密封盖 13.2075304714
+国家验收 12.8020653633
+司乘人员 11.8212361103
+质证 12.1089181827
+弹着 11.1926274509
+欧宝 9.65218240993
+星期天 8.94485059437
+郭宝臣 12.5143832909
+云层 9.35738286971
+柴门 10.5684731418
+神工 13.2075304714
+木化石 13.900677652
+茂县 10.9049453784
+占富室 13.900677652
+苯海拉明 12.8020653633
+格勒诺布尔 12.5143832909
+赎买政策 11.9547675029
+写作者 12.8020653633
+国境 9.18217878068
+索拉斯 12.2912397395
+飞扑 12.2912397395
+宣武 10.1394775363
+常用词 11.8212361103
+黑龙港 11.8212361103
+徐中行 12.5143832909
+张宪文 13.2075304714
+英文原版 12.8020653633
+椰风 13.900677652
+初见端倪 12.5143832909
+男方 9.49395840471
+孟钺 13.2075304714
+摆到 9.69598503258
+四九三十六 12.5143832909
+增长量 11.1926274509
+六十大寿 12.1089181827
+全真道 10.2371160058
+特利尔 13.2075304714
+桑螵蛸 13.2075304714
+龙凤 9.27570483869
+常用语 12.8020653633
+战具 11.7034530746
+舷窗 11.1280889297
+宣歙 12.5143832909
+白润 12.1089181827
+飞扬 8.99540287354
+三泉 12.2912397395
+亦非台 12.8020653633
+六七年 10.4994802703
+马克西米利安 11.8212361103
+一百一十六卷 13.2075304714
+流行歌曲 10.9562386728
+幼叶 11.4157710022
+云峰 10.4994802703
+看片会 13.900677652
+广场 7.11509000697
+犒劳 9.96885201925
+陈旭麓 12.5143832909
+失节事大 12.8020653633
+太平洋百货 13.900677652
+匠心独运 12.1089181827
+有利可图 9.41204128224
+统配 13.2075304714
+河口区 10.765183436
+骑士 8.32094782599
+七斤 12.1089181827
+夸父 11.7034530746
+无表情 9.75754292558
+供电量 12.5143832909
+萨迦寺 12.8020653633
+体育教师 11.9547675029
+翻转运动 13.2075304714
+高峰论坛 9.49395840471
+化石林 12.1089181827
+飞抵 10.1871055853
+高能态 12.2912397395
+纵火犯 12.5143832909
+信佛教 11.0674643079
+群婚 10.8561552143
+刘恢先 12.8020653633
+龙儿 13.900677652
+布留洛 13.2075304714
+特内里费岛 13.2075304714
+飞报 9.22784881751
+五指山区 12.1089181827
+梁晴站 13.2075304714
+洋布 11.2616203224
+分秒必争 11.4157710022
+带去 9.22784881751
+用武之地 10.1630080337
+观音柳 13.900677652
+储积量 12.8020653633
+两三座 13.2075304714
+龙兄 12.5143832909
+时代周刊 12.1089181827
+录相片 13.900677652
+大气 6.93748766611
+出点 9.45802639549
+谢振华 13.2075304714
+云岩 12.1089181827
+小里小气 13.2075304714
+云岭 10.2630914922
+牛皮癣 11.1926274509
+抗洪抢险 12.1089181827
+山石 8.74738605748
+八九年 11.2616203224
+出炉 8.0484751722
+付酬 13.2075304714
+出土文物 9.74179456862
+骑墙 12.1089181827
+仇岂可 13.900677652
+国家文物局 10.9049453784
+晋小波 11.1926274509
+多米尼克 10.7226238216
+劝学 11.2616203224
+摆动 8.23425096386
+轻装前进 13.2075304714
+龙兴 10.4041700905
+搁放 13.900677652
+龙床 10.642581114
+译电 12.5143832909
+输导 10.8096351986
+截子 12.1089181827
+飞洒 12.5143832909
+皮埃尔 10.9049453784
+云卿 12.1089181827
+和列娜 11.5027823792
+一个七八 13.2075304714
+窦皇后 13.2075304714
+埃斯波 13.2075304714
+果心 13.900677652
+阴文 11.5027823792
+始终一贯 12.8020653633
+跳开 10.9562386728
+舒龙 13.2075304714
+崇义 11.598092559
+打伤 8.90346537821
+逝水 11.1280889297
+直来直去 10.8561552143
+龙庭 12.8020653633
+打伞 11.0103058941
+云南 6.48912136416
+伊犁哈萨克自治州 11.0674643079
+底气不足 11.1926274509
+吴镇 10.6818018271
+马廷英 13.2075304714
+热中子 10.9562386728
+里湖 12.8020653633
+摆开阵势 10.5684731418
+倾心吐胆 12.1089181827
+阅兵典礼 13.900677652
+下拉菜单 13.900677652
+泰山队 13.900677652
+盗领 13.2075304714
+大江健三郎 11.8212361103
+土坯墙 13.2075304714
+开垦费 12.5143832909
+福建籍 12.5143832909
+输家 10.9562386728
+记作 9.66657114738
+小家子气 11.9547675029
+木格 11.4157710022
+特拉夫 13.2075304714
+出缺 10.8096351986
+姑妈 7.97108850859
+孔明复 13.2075304714
+飞流 11.2616203224
+优质优价 12.2912397395
+牛角尖 11.7034530746
+记住 7.46934657004
+嗑药 13.900677652
+封郡公 13.2075304714
+输定 13.2075304714
+福格勒 12.8020653633
+尤里安 13.900677652
+地大喊 11.5027823792
+八九出 13.2075304714
+汉弥尔 13.900677652
+打住 9.7898037878
+承嗣大 12.8020653633
+输完 12.8020653633
+六七具 13.2075304714
+幼小 9.66657114738
+和盘托出 10.4041700905
+抽象劳动 12.1089181827
+裸体美 13.2075304714
+龙廷 12.8020653633
+车到山前必有路 12.1089181827
+云台 10.3453295905
+简言 13.900677652
+钢琴曲 9.96885201925
+老花镜 10.2897597393
+跳得 10.4349417492
+坚持 5.81457511631
+劝君 11.9547675029
+飞涌 13.2075304714
+崇仁 11.4157710022
+股改 7.60725837313
+观光旅游 12.5143832909
+取药 10.8096351986
+蘸水 12.5143832909
+泽兰 11.9547675029
+崇仰 13.900677652
+成名成家 13.900677652
+十八九年 12.5143832909
+浪基面 13.900677652
+云叟 11.7034530746
+飞涨 10.0940151622
+骆秉章 12.5143832909
+坚挺 8.68574189437
+延平郡王 12.5143832909
+遇袭 11.8212361103
+七扭八歪 12.8020653633
+下流话 11.9547675029
+太佳妙 13.2075304714
+马中足 13.2075304714
+猝发 13.2075304714
+瓦斯科 11.598092559
+妞妞 11.7034530746
+肘腋之患 11.5027823792
+朱培德 11.8212361103
+飘摆 13.900677652
+飘摇 11.0103058941
+云县 12.2912397395
+股数 8.1902506346
+髫龄 12.1089181827
+十万左右 11.8212361103
+项英 10.9049453784
+四十七处 13.2075304714
+查勒斯 13.900677652
+分子电流 12.1089181827
+星期四 10.0720362555
+劝告 8.9519177616
+赵钱孙 12.2912397395
+初始状态 11.1280889297
+数字化仪 11.8212361103
+虎头山 12.8020653633
+混一 11.8212361103
+楼群 12.5143832909
+纯种马 13.900677652
+公正廉洁 12.1089181827
+鸡蛋羹 13.900677652
+执行部 10.0720362555
+逝波 12.1089181827
+硬皮病 11.9547675029
+分站赛 13.900677652
+没飞 13.900677652
+拉尔 10.7226238216
+龙年 13.900677652
+主骨架 12.2912397395
+六七倍 12.2912397395
+墨绿 10.765183436
+老婆大人 13.900677652
+阿弥陀佛 8.77077893705
+首都儿科研究所 12.5143832909
+常领 12.2912397395
+混上 11.598092559
+一落千丈 10.2630914922
+打个 7.64109618791
+宣政 11.9547675029
+声阻抗 13.900677652
+打中 9.4233408375
+阿希拉 13.2075304714
+记上 10.8561552143
+记下 9.44633035572
+穆格法 12.5143832909
+集刊 10.642581114
+病根儿 12.8020653633
+血凝 11.1280889297
+赖伐尔 11.598092559
+抱朴子 10.7226238216
+记为 9.53122979951
+简讯 12.5143832909
+宁府 9.61021821083
+打下 8.00352378434
+打上 9.24671730182
+简记 11.8212361103
+独居石 10.3171587135
+墨经 10.765183436
+简论 12.5143832909
+不尽然 10.765183436
+功能障碍 9.21854642485
+龙德 11.3357282945
+大汗 8.77077893705
+二百零七篇 13.2075304714
+勇敢无畏 12.1089181827
+墨线 11.2616203224
+简评 9.56994431169
+疲劳轰炸 12.8020653633
+打乱 9.26594866375
+扣人心弦 10.9562386728
+贴面舞 13.2075304714
+山神 9.23723855786
+叫外卖 12.5143832909
+字长 10.765183436
+第三架 12.5143832909
+米特雷 12.8020653633
+印第安纳州 11.1280889297
+喷油量 13.900677652
+消肿药 13.900677652
+坚拒 12.1089181827
+两三倍 11.598092559
+第三极 11.7034530746
+斯摩棱斯克 10.8561552143
+张小轩 12.8020653633
+砚台 10.2371160058
+私房话 11.3357282945
+险招 12.5143832909
+获嘉 11.9547675029
+黄老之 10.9049453784
+一举四得 13.900677652
+鹰金钱 13.900677652
+宣教 10.8096351986
+输出方 13.900677652
+第三枝 12.5143832909
+安魂曲 11.8212361103
+归怀州 13.2075304714
+梗死 11.3357282945
+曾阅 13.2075304714
+第三枚 13.2075304714
+偷逃税 12.2912397395
+打人 8.77671367257
+坚戈 13.900677652
+阿尔普 11.8212361103
+定名 8.33615724465
+电热丝 12.2912397395
+第三杯 12.2912397395
+唐牛儿 10.4666904475
+虎头崖 11.0103058941
+险险 13.900677652
+武冈县 13.2075304714
+记了 10.9049453784
+打亮 11.1280889297
+自助餐 12.2912397395
+鼓起勇气 9.91169360541
+广大 6.22004022441
+记事 9.23723855786
+改说 11.7034530746
+卫生机构 11.598092559
+开蒙 12.5143832909
+果干 12.2912397395
+二十八席 13.900677652
+养生术 12.2912397395
+广外 13.2075304714
+迪尔汗 13.900677652
+数以万计 9.59661255877
+打井 10.4994802703
+骑回 13.900677652
+黄老五 13.2075304714
+飞沫 10.7226238216
+屋久岛 13.900677652
+出给 11.598092559
+崇信 10.2371160058
+乐器厂 13.900677652
+见利忘义 11.4157710022
+铁证 11.8212361103
+魏师 13.2075304714
+险阻 10.1394775363
+宣旨 10.4349417492
+哄动一时 13.2075304714
+第三本 12.8020653633
+改订 10.4994802703
+禁口 13.900677652
+带兵官 11.7034530746
+汪公 12.8020653633
+飞泉 11.1280889297
+出线 10.0720362555
+红太阳 10.2117981979
+记仇 10.533381822
+丁念廷 13.900677652
+拍摄地 13.2075304714
+特洛伊木马 12.5143832909
+施里芬 13.900677652
+出纳 10.4666904475
+保护器 11.9547675029
+阿塔卡马 12.1089181827
+红木家具 11.7034530746
+飘散 9.96885201925
+厅级 11.9547675029
+龙形 10.604840786
+打仗 7.24010250214
+大写字母 11.7034530746
+大动肝火 11.8212361103
+不老练 12.2912397395
+义诊 10.8561552143
+曾随 9.91169360541
+第三期 10.0720362555
+二十八年 8.70218062071
+苍茫大地 12.5143832909
+山积 11.0103058941
+公司总部 9.5186510173
+幼年 8.24119543622
+吊上去 12.8020653633
+侯狼何 13.2075304714
+凶器 10.604840786
+拦防 13.900677652
+宿一宵 10.533381822
+不得其解 11.4157710022
+若干节 13.2075304714
+光栅扫描 12.2912397395
+郭祥鬼 13.2075304714
+依法严办 13.900677652
+尼莫 13.900677652
+龙岗 10.533381822
+阴极 9.61021821083
+龙岩 10.0294766411
+奶子 9.18217878068
+桃木 10.4994802703
+龙岭 10.0940151622
+改行 9.82314020807
+汪力 13.2075304714
+沈黎 12.8020653633
+无色无臭 12.5143832909
+半腰 11.1280889297
+防火墙 10.4994802703
+两三千 10.2371160058
+一万万 13.2075304714
+宏观经济 6.15308081328
+撑杆 11.8212361103
+巫医 11.5027823792
+古琴台 11.8212361103
+铁血 10.5684731418
+布告栏 13.900677652
+姜名维 13.2075304714
+桃李 10.5684731418
+简装 12.2912397395
+堆高 12.5143832909
+中国大酒店 13.900677652
+阴柔 11.2616203224
+劝回 12.5143832909
+六七千 11.3357282945
+六七十 10.9049453784
+发现者 10.2371160058
+摆开 8.9519177616
+左右发 13.2075304714
+米纳斯 12.2912397395
+摆弄 9.27570483869
+两三匹 12.2912397395
+界外球 11.9547675029
+起初 7.43608934829
+摆式 12.1089181827
+铁衣 12.8020653633
+曾锐 12.5143832909
+里氏 11.4157710022
+庙口 13.900677652
+幼帝 11.598092559
+恩克鲁玛 11.0674643079
+横行乡里 12.1089181827
+译着 13.2075304714
+不感兴趣 8.98802276624
+不经意 8.9102450652
+三寸不烂 13.2075304714
+飘曳 11.8212361103
+打个比方 10.8096351986
+马提刀 11.598092559
+凤仙郡 11.3357282945
+庙号 10.0294766411
+诡计多端 11.1926274509
+亲笔 9.35738286971
+曾闻 10.9049453784
+闲居家中 13.2075304714
+想认 13.2075304714
+五指山市 13.900677652
+袖手旁观 9.71102290995
+两三句 11.7034530746
+老虎凳 13.2075304714
+山窝 11.4157710022
+股本 6.68250081357
+山窟 12.8020653633
+两三口 12.5143832909
+画面 7.79365476423
+孔明密 12.5143832909
+曾问 13.900677652
+齐燮元 11.7034530746
+高视阔步 12.8020653633
+桃林 11.0103058941
+瓜子金 13.900677652
+突地 11.8212361103
+国际友人 11.1926274509
+改装 7.87965430263
+不得公开 13.900677652
+龙尾 9.82314020807
+北原兵 13.2075304714
+匾牌 12.2912397395
+华雷斯 12.1089181827
+孔明寨 12.8020653633
+卖房 10.0720362555
+诸州郡 11.3357282945
+气急败坏 9.11318590919
+绝对多数 10.765183436
+男校 12.8020653633
+摆得 10.2371160058
+谋杀罪 12.1089181827
+增生症 11.9547675029
+龙居 12.1089181827
+黑云压城 11.8212361103
+秦书田 9.06439574502
+宗弟七 13.900677652
+八九千 11.598092559
+墨累 12.1089181827
+八九十 10.8561552143
+隐白 12.8020653633
+男根 12.5143832909
+股权 5.68350905621
+项背 11.9547675029
+越南盾 11.8212361103
+山竹 12.2912397395
+不同凡响 10.4666904475
+简表 11.4157710022
+山竽 13.900677652
+感染率 11.0103058941
+无计 9.62401153296
+改良主义 9.59661255877
+袁建军 12.1089181827
+山童 13.2075304714
+集资房 13.2075304714
+辛可宁 12.5143832909
+云冈 11.598092559
+爬楼 13.900677652
+不分彼此 11.2616203224
+卡宾枪 9.85762638414
+孙儿女 13.900677652
+重大进展 9.91169360541
+第三日 10.1871055853
+简要 9.21854642485
+杨维桢 12.8020653633
+猝倒 13.2075304714
+阴暗 8.92394390956
+群团 12.8020653633
+番禺市 12.2912397395
+马莉莉 13.2075304714
+里海 8.9519177616
+职责所在 11.0674643079
+梼杌 13.2075304714
+阿玉奇 12.2912397395
+可以 3.50511925216
+矢石如雨 10.9049453784
+形骸 10.1871055853
+打字速度 13.900677652
+亩产 9.82314020807
+罗朗展 12.8020653633
+米为亚 10.9049453784
+摆平 10.1164880181
+广宗 11.7034530746
+爬梯 12.8020653633
+张议潮 10.9049453784
+那回事 11.8212361103
+仰天大笑 11.4157710022
+建设局 10.2371160058
+受到重视 9.4233408375
+画集 9.85762638414
+广安 11.1280889297
+广宇 10.2371160058
+飞渡 11.3357282945
+赫尔姆 12.8020653633
+慨当以慷 12.8020653633
+二体问题 11.1280889297
+广宁 10.4041700905
+今朝有酒今朝醉 11.8212361103
+宣杭 11.8212361103
+幼弱 13.900677652
+坐骨神经 12.1089181827
+沃罗夫斯基 12.8020653633
+常来寨 13.900677652
+南嘉措 12.1089181827
+摆布 8.90346537821
+龙川 10.6818018271
+飞湍 13.2075304714
+隋况 13.2075304714
+龙州 11.0674643079
+汪古 10.765183436
+大眼贼 11.3357282945
+王学萍 13.900677652
+莫念 11.1926274509
+第三方 8.1417758781
+飘柔 11.1926274509
+撞鬼 11.8212361103
+鲜碧楼 12.8020653633
+阴曹 11.4157710022
+幼弟 10.9562386728
+上官婉儿 12.1089181827
+退热药 11.7034530746
+广寒 11.7034530746
+力透纸背 12.8020653633
+保全 8.39128931535
+安士荣 12.2912397395
+监管局 9.82314020807
+顿觉 9.55687223012
+隋军 11.4157710022
+齐襄王 11.7034530746
+雏形 8.58747167293
+果岭 12.2912397395
+酵母粉 13.900677652
+好生之德 11.3357282945
+铁西 12.1089181827
+微生物 7.88696249593
+之字形 12.5143832909
+阶级斗争 8.34384959028
+左右分 12.8020653633
+软风 13.900677652
+血吸虫病 10.9562386728
+带上来 10.642581114
+呼吸器 11.5027823792
+画院 10.1871055853
+老老实实 8.99540287354
+尤氏姊妹 13.2075304714
+于仲景 13.2075304714
+爬树 10.1871055853
+检漏仪 13.900677652
+庞刘苟 12.5143832909
+曾铣 12.8020653633
+飞溅 9.26594866375
+钱运录 13.900677652
+精疲力竭 9.74179456862
+第十四位 13.900677652
+两次运球 13.900677652
+四月八 11.7034530746
+干部子弟 11.1280889297
+官运官 11.1280889297
+鼓乐队 13.2075304714
+茶器 11.8212361103
+称得上 9.02548032877
+改观 8.48457724977
+侍卖官 13.2075304714
+血印 11.3357282945
+巩县任 12.8020653633
+周文王子 12.5143832909
+结节病 12.1089181827
+三台村 13.2075304714
+出糗 12.5143832909
+高某 10.9562386728
+张家港市 11.7034530746
+催情 11.4157710022
+庙前 10.0720362555
+门进东 13.2075304714
+二三日 11.7034530746
+第三支 12.1089181827
+索回 11.0674643079
+闲过 13.2075304714
+编写者 13.2075304714
+小竹笛 13.900677652
+解铨厚 13.2075304714
+左路军 12.1089181827
+栖霞 11.1280889297
+亚砜 12.8020653633
+超常规 10.4994802703
+应考者 12.1089181827
+几斤几两 12.2912397395
+四脚蛇 13.2075304714
+电视栏目 12.8020653633
+燕侯赏 13.2075304714
+阴晴 11.3357282945
+鲁东 11.7034530746
+飘来 10.0505300503
+开金口 12.8020653633
+阴晦 10.3171587135
+坐立不安 9.62401153296
+战况 10.0940151622
+博乾隆 13.2075304714
+窠巢 13.900677652
+巴氏合金 12.2912397395
+惠安县 11.8212361103
+变化趋势 9.58318953844
+强颜欢笑 11.4157710022
+袁继咸 11.1280889297
+危言耸听 9.53122979951
+坚果 9.49395840471
+五颜六色 9.55687223012
+国家 4.00044539216
+赛艇 11.4157710022
+值夜班 10.8561552143
+蝇虎 13.900677652
+洪道 12.8020653633
+涕泗横流 13.900677652
+一个二重 12.8020653633
+喷浆 13.900677652
+夏文彦 13.2075304714
+十八世纪 9.87532596124
+喷流 11.4157710022
+例规 13.900677652
+荤笑话 13.900677652
+社交能力 12.5143832909
+宣怀 11.3357282945
+摆好 9.14708746087
+葡萄糖酸钙 12.1089181827
+牵累 11.3357282945
+史载舜 13.900677652
+二十八宿 9.6811699468
+第三招 12.5143832909
+宣恩 12.8020653633
+国宾 11.4157710022
+铁蹄 11.1280889297
+商洛山 8.19356738723
+果实 7.62403416263
+脚手 11.9547675029
+弹簧 8.98069672615
+出笼 10.3171587135
+汪哭 13.2075304714
+水泊里 12.8020653633
+商业法 13.2075304714
+王炳章 13.900677652
+躁急 12.5143832909
+天泉 12.5143832909
+毫州市 12.1089181827
+偿清 11.598092559
+宗人府 10.4349417492
+骑出去 13.2075304714
+章炳麟 10.4994802703
+武陵山 10.0294766411
+黑袍 10.3743171274
+赛船 11.8212361103
+生活富裕 11.8212361103
+输得 10.7226238216
+埃斯梅 12.8020653633
+喷洒 10.0720362555
+农业遥感 13.900677652
+效劳 9.74179456862
+马巴赫 13.900677652
+进水闸 11.0103058941
+输往 9.84023464143
+阵亡者 11.8212361103
+活地图 12.5143832909
+专营店 10.9562386728
+离婚证 10.9049453784
+有德者 12.1089181827
+果子 8.81927328699
+中国网络通信有限公司 13.900677652
+马世耀 9.45802639549
+齐相王 12.8020653633
+拆白党 13.2075304714
+检字表 13.2075304714
+商船海事 13.900677652
+金灯桥 12.5143832909
+即墨县 12.2912397395
+张店区 13.900677652
+第三批 8.58255765813
+第三扇 13.2075304714
+惯性导航 9.93038573842
+橄榄色 11.1926274509
+山寿马 13.900677652
+太美 11.3357282945
+平儿见 11.7034530746
+获取 6.91781490051
+统驭 11.5027823792
+昌珠寺 13.2075304714
+生产厂家 9.26594866375
+斯韦特 13.900677652
+非要不可 13.900677652
+活色生香 12.1089181827
+迷迭香 12.1089181827
+贮蓄 13.900677652
+碘甘油 13.900677652
+工商管理 10.2371160058
+萨勒河 13.900677652
+龙婆 12.1089181827
+广屯 12.8020653633
+贺州市 11.9547675029
+天底 12.2912397395
+灰鸽子 12.8020653633
+多饮水 10.9562386728
+亲子关系 11.1280889297
+玻尔磁子 12.5143832909
+郊寒岛瘦 12.8020653633
+毕胜 11.0674643079
+高居榜首 10.1394775363
+喷涂 10.2897597393
+山系 9.04086524761
+喷涌 9.98865464655
+墨笔 11.598092559
+电中性 11.2616203224
+队歌 13.900677652
+南雄水 13.2075304714
+剥夺公权 13.900677652
+县监狱 13.900677652
+训练大纲 13.2075304714
+伯川 12.8020653633
+曾欲删 12.8020653633
+群儒 13.900677652
+逐村逐户 13.2075304714
+柴鸡 13.900677652
+龙安 13.2075304714
+库埃特流 13.900677652
+打麻将 10.0294766411
+幼女 10.4349417492
+徐中舒 11.1280889297
+卖文 13.2075304714
+三百万年 12.8020653633
+劝农 11.2616203224
+婊子 9.14708746087
+黄巾军 11.3357282945
+曹魏设 12.1089181827
+马驰骋 12.8020653633
+进取心 11.3357282945
+欧冠 10.8096351986
+亚氯酸 13.2075304714
+激化矛盾 11.7034530746
+崔民 13.2075304714
+采桑子 13.900677652
+皇贵妃 8.91707103027
+群像 10.533381822
+龙宫 9.98865464655
+孔明山 13.900677652
+萨巴蒂 13.2075304714
+凶兆 11.3357282945
+倚门卖俏 13.900677652
+黄货 11.598092559
+以弗所 12.2912397395
+卖断 11.5027823792
+弊害 12.1089181827
+群僚 12.1089181827
+裙钗 11.8212361103
+龙宾 12.8020653633
+困苦 9.5186510173
+电子邮箱 11.598092559
+飞亚达 11.1926274509
+营营逐逐 13.900677652
+龙家 11.3357282945
+骑到 10.533381822
+大洼 12.5143832909
+阮籍 10.2117981979
+犊牛 12.8020653633
+看惯 10.4666904475
+赫尔德 11.9547675029
+获利 7.04211261718
+自然风光 10.0505300503
+无法回答 10.4041700905
+人到中年 10.6818018271
+拍案惊奇 10.4666904475
+获到 12.5143832909
+宣慰 9.89334446674
+四十七岁 12.5143832909
+学生会 10.7226238216
+两三名 13.900677652
+广川 11.9547675029
+求之不得 10.3171587135
+徐二黑 13.2075304714
+珩磨 12.1089181827
+牛皮糖 11.598092559
+铁轨 9.55687223012
+砧子 11.5027823792
+戈铭文 13.2075304714
+大津 13.2075304714
+铁轮 12.2912397395
+思潮澎湃 13.900677652
+简述 10.1871055853
+喷气 8.83177344976
+常州城 12.8020653633
+第三排 10.642581114
+简单机械 10.765183436
+公平竞争 9.98865464655
+飞桥 12.1089181827
+白兰地酒 11.9547675029
+莫兹利 11.7034530746
+动脑 11.8212361103
+鸿恩 10.4666904475
+瓦莱里 12.8020653633
+携出 12.5143832909
+翼长 11.8212361103
+全身检查 12.2912397395
+九碗 13.900677652
+云图 10.6818018271
+抚宁 11.9547675029
+云团 10.8096351986
+凶凶 11.9547675029
+小程 13.900677652
+喷泻 13.900677652
+孜孜不倦 11.0674643079
+尼萨 12.5143832909
+合取范式 12.5143832909
+多字 11.1926274509
+低下头来 10.8561552143
+平白无故 10.0720362555
+汝拉山 12.1089181827
+肺结核病 11.9547675029
+改过 10.642581114
+例行 9.02548032877
+水源林 11.8212361103
+平面设计 13.900677652
+改进 6.54567573087
+出站 11.598092559
+八则 12.8020653633
+阴性 9.01787572939
+宋咸淳 11.598092559
+魏置秀 12.8020653633
+矫若游龙 13.900677652
+商立国 13.900677652
+江安县 13.900677652
+擎天 10.3171587135
+鸡足山 11.1280889297
+增函数 13.900677652
+木然 9.84023464143
+淮北地区 11.7034530746
+冯保顿 13.2075304714
+卫周祚 13.900677652
+股息 8.67493097826
+幼妹 13.2075304714
+铁运 13.2075304714
+补济 13.900677652
+发射站 12.8020653633
+不识抬举 10.4994802703
+龙子 11.0103058941
+骑劫 11.5027823792
+口交 12.5143832909
+喷油 11.9547675029
+劝其 11.1280889297
+唧筒 12.2912397395
+牵系 11.1926274509
+徐阶任 13.900677652
+吴长庆 12.1089181827
+修正案 9.08039608637
+酯类 10.5684731418
+讨债鬼 12.8020653633
+转嫁到 10.765183436
+出窑 11.3357282945
+喷沙 12.1089181827
+于尔根 13.2075304714
+国企股 11.1926274509
+受迫振动 11.3357282945
+中心思想 11.0674643079
+樊瑞引 12.5143832909
+终奉其 13.2075304714
+劝劝 9.69598503258
+廉希宪 12.2912397395
+前功尽废 13.900677652
+崇高理想 11.9547675029
+强项 10.604840786
+孙吴亦 13.2075304714
+广度 9.01032852375
+莱州湾 10.5684731418
+进口税 10.8096351986
+报警信号 11.9547675029
+例证 9.10488710638
+广府 12.8020653633
+群友 13.900677652
+兵器库 12.8020653633
+撺掇 9.59661255877
+股掌 11.598092559
+六员 11.0103058941
+催收 10.5684731418
+增长额 10.6818018271
+出神 8.92394390956
+宣战 8.37921673411
+平庸之辈 11.5027823792
+撇掉 13.2075304714
+二次破碎 13.900677652
+易于反掌 13.900677652
+群发 12.2912397395
+卡尔霍恩 13.2075304714
+汪国 13.900677652
+佩之剑 12.1089181827
+机械工人 11.8212361103
+广建 11.5027823792
+宣扬 8.02014466558
+飘拂 11.4157710022
+广延 10.9562386728
+票房榜 13.900677652
+比较文学 11.3357282945
+侯恂 10.3453295905
+飞歌 12.2912397395
+光度计 10.8096351986
+出示 9.38981814546
+六七块 13.2075304714
+统领 7.90174109003
+里格 12.1089181827
+劝勉 11.9547675029
+里根 9.7898037878
+二元化 12.8020653633
+喷漆 10.604840786
+两三圈 13.2075304714
+那富安 13.2075304714
+极其负责 13.900677652
+午膳 9.38981814546
+改调 12.5143832909
+赫尔岑 10.642581114
+言花语 13.2075304714
+撑持 10.3453295905
+加在一起 9.54396882529
+多元分析 11.7034530746
+阿奎那 11.0674643079
+米涅夫 11.598092559
+塔儿海 13.2075304714
+古阳洞 12.8020653633
+劲头十足 11.9547675029
+收摊子 12.5143832909
+反咬一口 11.5027823792
+新事新办 13.900677652
+里森 13.900677652
+杨月楼 13.2075304714
+龙堂 13.900677652
+亲缘 9.20932976975
+黄巾刘 13.900677652
+乌马尔 12.8020653633
+经纪商 10.4666904475
+高级干部 10.2117981979
+简谐 11.1280889297
+后点 13.2075304714
+有青龙 12.2912397395
+大专学校 13.2075304714
+逆向传导 13.2075304714
+超高速 10.6818018271
+救回 10.4666904475
+亚砷酸钠 13.2075304714
+幼嫩 10.9562386728
+获准 8.61241062128
+伪装物 13.900677652
+饰件 11.4157710022
+劝到 13.900677652
+股指 5.87974993299
+强有力 7.89432449237
+山线 11.5027823792
+执子之手 11.9547675029
+宣抚 9.20932976975
+出租 8.32472854883
+古利特 12.5143832909
+高高手 13.2075304714
+蛙泳 11.1926274509
+广布 7.79811905736
+出科 11.8212361103
+毕节 11.4157710022
+煤炭资源 8.80081122415
+第三性 13.900677652
+戎马 10.1164880181
+公地 12.5143832909
+履行职责 10.6818018271
+压港 11.9547675029
+广平 10.9562386728
+于海军 11.5027823792
+河北人 11.3357282945
+局麻 12.1089181827
+提交者 12.8020653633
+岸基 10.0940151622
+河东路 10.8096351986
+炼成 9.91169360541
+飘扬 9.38981814546
+蝇蛆 11.1926274509
+夜航 11.2616203224
+排名榜 12.2912397395
+舍生忘死 11.1280889297
+西拉斯 13.2075304714
+潘罗支 12.1089181827
+担不起 11.598092559
+卓尼县 13.2075304714
+史张昭 12.1089181827
+孙吴之 12.8020653633
+飞毯 13.2075304714
+当场看到 13.900677652
+元素 6.84364067028
+瞪瞪 12.8020653633
+牛皮纸 10.8561552143
+二百零六 12.8020653633
+多美滋 12.5143832909
+二重人格 13.900677652
+顿足 10.5684731418
+青木正儿 13.2075304714
+晚于 9.80633308975
+名列前茅 9.24671730182
+喷湿 13.900677652
+改起 13.900677652
+果壳 11.0674643079
+幼子 9.75754292558
+广得 13.2075304714
+铁质 10.0720362555
+羊力 11.7034530746
+颠倒黑白 11.3357282945
+自渎 13.900677652
+虞以伐 12.8020653633
+宇文泰立 13.2075304714
+草荐 12.8020653633
+申扎县 12.1089181827
+栀子花 11.598092559
+阴招 13.900677652
+涣散 9.93038573842
+血型 9.41204128224
+老大夫 11.1280889297
+猫扑网 12.8020653633
+道家 9.04864738806
+成铁汁 13.2075304714
+奥焦尔 13.900677652
+航空工业部 12.5143832909
+纹线 13.2075304714
+晁盖 8.21709788464
+北京动物园 12.2912397395
+投资收益 7.83456956187
+国土报 13.2075304714
+粉末状 10.2117981979
+产生式系统 13.900677652
+盘身 13.900677652
+星期六 9.06439574502
+铺子 9.10488710638
+云吞 13.900677652
+正确度 13.900677652
+司徒府 12.8020653633
+汪城 13.2075304714
+群力 13.2075304714
+西出阳关无故人 13.900677652
+敞口 9.46986085313
+钟山区 12.8020653633
+东拼西凑 11.9547675029
+他山之石 11.7034530746
+跳墙 11.1280889297
+爱情观 12.8020653633
+搁浅 9.32596667347
+飞檐 10.0505300503
+徐弘祖 11.5027823792
+同音词 13.900677652
+发薪日 13.900677652
+石景山 10.2630914922
+险遭 11.8212361103
+血块 10.9049453784
+大声嚷叫 11.3357282945
+白对虾 13.2075304714
+磁性瓷 13.2075304714
+假执行 13.2075304714
+山羊 8.46259834305
+飞檄 11.2616203224
+我省 6.87513933734
+牵线 10.8096351986
+赵大明 7.76945116249
+四十七年 10.0720362555
+龙大 12.5143832909
+曾欲兴 13.2075304714
+苏圣玛 12.5143832909
+山群 12.2912397395
+地热能 10.2371160058
+龙骑兵 12.1089181827
+悬梁刺股 13.2075304714
+龙头 7.23882291143
+广开 10.7226238216
+雷达网 13.2075304714
+勇猛果敢 13.2075304714
+大流 11.5027823792
+民办学校 11.0674643079
+打呵欠 11.9547675029
+毛利族人 13.900677652
+常参 13.2075304714
+穆拉托 13.2075304714
+豆腐汤 13.2075304714
+山翁 13.900677652
+关系数据库 12.5143832909
+远海 11.0103058941
+牵绊 12.1089181827
+龙套 11.598092559
+墨砚 12.8020653633
+喷溅 11.8212361103
+深成岩 11.7034530746
+孙若肯 13.2075304714
+萨迦县 12.8020653633
+乳酸杆菌 11.8212361103
+安妥 11.8212361103
+护国军 10.7226238216
+常用药 11.1280889297
+职权范围 10.5684731418
+铁路 5.84425088445
+拖拽 10.2630914922
+高高挂 12.8020653633
+吴楼村 12.5143832909
+隋唐 7.75649201785
+教我如何 12.5143832909
+王利芬 12.5143832909
+欧华 13.2075304714
+龙女 11.3357282945
+大脑皮层 9.35738286971
+独往独来 11.598092559
+喷入 11.4157710022
+坚守 7.73947033028
+林茂 11.9547675029
+桑植县 11.7034530746
+打眼 11.1926274509
+家馨 10.7226238216
+少见多怪 11.0103058941
+特征频率 12.5143832909
+龙门客栈 12.5143832909
+服饰店 12.5143832909
+坚实 7.92941581219
+身心俱疲 12.2912397395
+主人家 10.0720362555
+霉菌 9.31571017331
+坚定 7.52225146832
+老禅师 13.2075304714
+宋汉章 12.5143832909
+临街房 12.5143832909
+青霉素 9.23723855786
+脱尽 11.9547675029
+挣断 11.4157710022
+自编自演 11.9547675029
+艾草 12.5143832909
+爆破手 13.900677652
+搞好关系 10.8096351986
+林茨 11.7034530746
+主耶稣 12.5143832909
+乍暖还寒 11.598092559
+六百五十 12.8020653633
+政治事件 10.1394775363
+王秋蛇 12.1089181827
+星群 11.7034530746
+孔武有力 12.8020653633
+那笔 10.4994802703
+不念旧恶 11.598092559
+第三座 12.1089181827
+交易规则 9.65218240993
+果枝 12.2912397395
+谢迪赫 13.2075304714
+深成指 7.74581955796
+林草 12.2912397395
+王庆闻 13.2075304714
+记着 8.80692745117
+忘年交 11.7034530746
+大半只 12.8020653633
+坐喷气式 12.2912397395
+巫楚 11.4157710022
+太想 11.3357282945
+团政委 11.2616203224
+颜承麟 13.2075304714
+经义述 12.8020653633
+少数党 13.2075304714
+沙宾达 12.1089181827
+符箓 10.6818018271
+跳板 9.45802639549
+于事无补 11.1280889297
+东看西看 12.8020653633
+建设期 10.0505300503
+猝死 9.74179456862
+呼啦圈 13.2075304714
+第四家 12.2912397395
+输掉 10.5684731418
+凶气 11.4157710022
+测向仪 13.2075304714
+打着 7.39041931145
+俞秀山 12.5143832909
+欧泊 11.0674643079
+跳来 12.8020653633
+鹅毛雪 13.900677652
+多美元 10.642581114
+大众汽车 9.94943393339
+坐地铁 11.7034530746
+贫化铀 13.2075304714
+武二花 13.2075304714
+血案 10.2630914922
+谦抑 13.900677652
+金学曾 7.5273578624
+林莉 13.2075304714
+第三年 10.0940151622
+渑池 10.4994802703
+飘尘 12.8020653633
+二十八期 13.2075304714
+费丹旭 12.5143832909
+六品 9.01032852375
+那箱 11.9547675029
+太史慈 10.642581114
+喷出 8.2985588311
+一泻千里 10.8096351986
+主和 9.96885201925
+第三幅 11.9547675029
+大天兴 12.1089181827
+于成王 12.8020653633
+唐僧喜 12.5143832909
+财务监督 11.3357282945
+袖珍本 12.5143832909
+等级森严 11.1280889297
+第三幕 12.5143832909
+安亲王 10.4041700905
+打瞎 12.5143832909
+月牙泉 11.8212361103
+欧氏 11.4157710022
+法兰克福 8.86372504956
+林莽 11.5027823792
+阎王殿 12.5143832909
+云母 8.56313957227
+四十二名 13.2075304714
+罗萨里奥 12.1089181827
+爬升 9.66657114738
+赵谦听 12.8020653633
+笑掉大牙 12.5143832909
+李仪祉 12.8020653633
+机器配置 13.900677652
+主考官 10.6818018271
+云殿 12.1089181827
+家饰 13.900677652
+血栓 9.41204128224
+无尽 9.32596667347
+河南省高级人民法院 11.3357282945
+四十六号 13.2075304714
+郭宝钧 12.2912397395
+一双双 10.533381822
+于青 11.8212361103
+体贴人 11.598092559
+果有 9.85762638414
+萧翼赚 12.2912397395
+战力 10.4666904475
+防滑链 11.9547675029
+那篇 10.1394775363
+不念旧情 12.8020653633
+起兴 12.8020653633
+血样 11.4157710022
+科学决策 10.7226238216
+已往 10.4349417492
+灰溜溜 10.4349417492
+那万圣 13.900677652
+果木 10.2117981979
+战功 8.44535653662
+喜糖 11.1280889297
+帕子抹 13.2075304714
+阽危 13.900677652
+孔明恐 13.2075304714
+烤羊肉串 12.2912397395
+飞向 9.49395840471
+已缩水 13.900677652
+封为丹 13.2075304714
+师守御 13.900677652
+领袖群伦 12.8020653633
+摆摆 10.7226238216
+提取物 10.7226238216
+摆摊 10.0720362555
+中心粒 11.2616203224
+飞吻 13.2075304714
+王远知 12.2912397395
+伟论 13.2075304714
+鹿群 11.5027823792
+男双 12.5143832909
+男友 9.25628675283
+幼教 12.1089181827
+迷途羔羊 13.900677652
+步履 9.71102290995
+樊爱能 13.2075304714
+渗碳 10.9562386728
+台中市 10.642581114
+防患于未然 10.2630914922
+自溶 13.2075304714
+麻坊镇 13.2075304714
+曾率兵 12.8020653633
+哀诉 13.2075304714
+不打紧 9.49395840471
+两三株 13.2075304714
+晓景 11.4157710022
+一八八七年 13.900677652
+尉氏县 11.0674643079
+李助 10.7226238216
+摸下去 13.2075304714
+亿余立方米 11.8212361103
+偷闲 11.8212361103
+赫尔措 12.5143832909
+迫切愿望 12.8020653633
+何应钦 10.0720362555
+云横 13.900677652
+穆尔希 13.900677652
+封为义 12.8020653633
+侯大苟 13.900677652
+衰落期 13.2075304714
+献礼片 11.598092559
+萨迦派 11.3357282945
+林良 12.1089181827
+遮得 10.9049453784
+金箍棒 9.14708746087
+地震仪 10.9562386728
+端上去 13.900677652
+家风 10.765183436
+少数具 12.5143832909
+男厕 13.2075304714
+虎父无犬 13.900677652
+高荣盛 12.1089181827
+龙柱 13.2075304714
+火化场 13.900677652
+养条狗 12.8020653633
+浣洗 13.900677652
+寝食难安 10.533381822
+幼时 9.33632946051
+写实主义 10.1394775363
+欧洲 5.36348577405
+询价制 12.1089181827
+归宿感 13.2075304714
+大老粗 10.9049453784
+打皱 12.8020653633
+武帝遂 13.2075304714
+谆谆告诫 11.8212361103
+养老保险费 11.9547675029
+姚建华 11.7034530746
+拖拖拉拉 11.5027823792
+石室铭 13.900677652
+林芝 10.642581114
+起先 8.97342396682
+里基 12.8020653633
+龙朔 11.7034530746
+李仁孝 10.8561552143
+以寡敌众 12.5143832909
+蛙叫 13.900677652
+野鸭子 11.598092559
+鹿儿岛县 12.1089181827
+曾率军 11.8212361103
+工厂关门 13.900677652
+生殖道 10.4349417492
+男单 12.2912397395
+拉线开关 13.2075304714
+恫瘝 12.2912397395
+恩里科 13.2075304714
+陶大临 13.900677652
+勒弗库森 13.900677652
+国土局 11.3357282945
+于海滨 12.1089181827
+难以接近 11.2616203224
+范德林特 12.5143832909
+张宸 13.900677652
+求生不得 12.5143832909
+打盹 9.91169360541
+第三张 11.7034530746
+众说纷纭 9.69598503258
+二中全会 10.0294766411
+九万七千三百二十四匹 13.2075304714
+架空层 13.2075304714
+洋铁 11.3357282945
+安知其 13.900677652
+左右为难 9.71102290995
+交界地 12.5143832909
+洋芋 11.0674643079
+林苑 12.2912397395
+恕罪 9.14708746087
+静脉滴注 10.9049453784
+柯姆文 13.2075304714
+上海戏剧学院 11.4157710022
+船仓 12.2912397395
+认真反思 13.2075304714
+甘延寿 12.5143832909
+龙杠 13.900677652
+阴山 8.73589167805
+龙爪槐 12.8020653633
+正确性 9.63799777493
+洗净 8.59737274392
+宣州 10.2371160058
+广慈 12.5143832909
+巾帼丈夫 13.2075304714
+都尔罕 13.2075304714
+形同陌路 12.8020653633
+宋任穷 13.2075304714
+适龄 10.533381822
+感知力 13.900677652
+三河 9.4233408375
+慈力王 13.2075304714
+猜不着 11.0103058941
+两三步 11.0674643079
+半青半黄 13.900677652
+云楼 12.2912397395
+埃斯图 13.900677652
+来去分明 13.900677652
+王应麟 12.2912397395
+第三峰 13.2075304714
+深田恭子 13.900677652
+无数具 13.900677652
+斯琴高娃 13.900677652
+戛纳 9.69598503258
+宣师 13.900677652
+穆拉德 11.598092559
+宣布 5.41952623191
+阴德 10.765183436
+拥挤不堪 10.604840786
+六七次 12.8020653633
+盖玻片 13.900677652
+飞在 10.765183436
+衣冠不整 11.9547675029
+学科群 13.2075304714
+陈耳 10.4994802703
+宣帝 10.0940151622
+前尘往事 11.7034530746
+非本 11.598092559
+饰物 9.32596667347
+阿力麻 10.5684731418
+舷侧 11.9547675029
+皮耶罗 11.3357282945
+费德勒 11.9547675029
+碧山 12.5143832909
+不薄 10.2117981979
+釜底游鱼 12.5143832909
+彤彤 10.765183436
+新时空 13.900677652
+两三次 10.765183436
+那祥 12.1089181827
+果料 13.2075304714
+战战兢兢 8.91707103027
+少蛋 13.900677652
+宣平 12.2912397395
+另觅新欢 13.900677652
+于海洋 10.604840786
+麻织品 11.4157710022
+隋梅 12.2912397395
+整体观念 12.2912397395
+六七步 12.8020653633
+译作 9.84023464143
+施维群 13.900677652
+各阶层 9.02548032877
+催奶 12.2912397395
+撑开 9.98865464655
+果断 8.0600359946
+爬出 10.3453295905
+正宫 11.0103058941
+赘肉 10.8561552143
+膳食 8.9102450652
+孔明提 12.8020653633
+正宪 12.8020653633
+剥除 12.5143832909
+流血流汗 11.598092559
+无梁楼盖 13.900677652
+含致癌 13.900677652
+高材生 10.9562386728
+半边莲 12.1089181827
+加里波第 11.1926274509
+晚睡 11.9547675029
+碧岩 12.2912397395
+各立 11.3357282945
+越南人 11.1926274509
+第三局 12.8020653633
+第三层 10.3743171274
+二十八支 13.2075304714
+摄制组 12.8020653633
+漫天遍地 13.900677652
+广义速度 12.5143832909
+飘带 10.6818018271
+第三届 8.61241062128
+果敢 10.1164880181
+恨透 12.8020653633
+喷发 8.53938548627
+宣府 10.1164880181
+肖大叔 12.5143832909
+夜草 11.8212361103
+吃不饱 9.91169360541
+封尚师 12.2912397395
+杨宝森 13.2075304714
+多分钟 10.4349417492
+会选 11.7034530746
+碧峰 13.2075304714
+结社自由 12.2912397395
+二十四路 12.5143832909
+炮声 8.77671367257
+商品粮 8.46259834305
+会通 11.0674643079
+非吃不可 13.2075304714
+扣件 13.2075304714
+正室 10.533381822
+薄酒 11.2616203224
+关系不大 10.3743171274
+爬入 11.9547675029
+亚乔木 13.900677652
+撑得 10.604840786
+风吹雨淋 12.2912397395
+大屏幕显示器 13.2075304714
+投资信托 10.4666904475
+第三尊 13.900677652
+阴影 7.70219893548
+原始公社 9.82314020807
+建都于 9.84023464143
+吹角连营 13.900677652
+那科 12.8020653633
+受之无愧 12.8020653633
+对外文委 13.2075304714
+从襄子 13.2075304714
+丘之城 12.5143832909
+林耀 12.2912397395
+译为 10.2371160058
+卖完 9.89334446674
+龙文 12.5143832909
+嗳气 11.1280889297
+五六岁 10.8561552143
+茂林 10.4349417492
+林耐 12.2912397395
+行动计划 9.46986085313
+对空射击 11.4157710022
+喷剂 12.5143832909
+阴康 13.2075304714
+译丛 12.1089181827
+边卫 13.900677652
+君士坦丁堡 8.73589167805
+中心线 10.642581114
+林耶 12.2912397395
+泡酒 13.2075304714
+排灌站 11.0103058941
+韦诸部 11.9547675029
+卖家 9.12155415886
+阿尔弗雷 10.8096351986
+打球 10.4041700905
+始得 10.1164880181
+打理 9.74179456862
+黛瓦 13.900677652
+袍泽之谊 13.900677652
+顶尖高手 12.1089181827
+陈国公主 12.2912397395
+各端 12.8020653633
+略表心意 13.2075304714
+中心组 11.598092559
+塑料箱 13.2075304714
+坚壁 10.8561552143
+心雄万夫 12.8020653633
+肩部 9.66657114738
+黑角 11.9547675029
+大爹 12.8020653633
+浸礼 11.1926274509
+花穗状 13.2075304714
+塑料管 12.5143832909
+简肃得 12.8020653633
+龙旗 10.6818018271
+合情合理 9.59661255877
+星系 8.85082164473
+方有权 13.900677652
+云栖 11.1926274509
+阿弗罗尔 13.900677652
+夯货 10.533381822
+太息 11.9547675029
+飘忽 10.2371160058
+弹药兵 13.2075304714
+联想公司 13.900677652
+南雄县 12.1089181827
+主产省 12.8020653633
+赵襄子 11.598092559
+孔明拜 13.2075304714
+让渡 9.30555780184
+帮手 9.31571017331
+宣徽 12.8020653633
+永隆 10.9562386728
+宣德 8.62256299275
+宗依 12.8020653633
+股市 5.25403639337
+阿基米 13.900677652
+叶叶 11.9547675029
+浸种 12.1089181827
+林肯 9.43476953332
+有备而来 11.0674643079
+含硫量 12.1089181827
+赵大娘 11.7034530746
+一串红 12.8020653633
+白璧微瑕 13.2075304714
+复决权 13.2075304714
+利七世 10.642581114
+亲属关系 10.0505300503
+阿蒙森 11.9547675029
+姜索荣 12.5143832909
+飞回 10.3743171274
+孙宝传 13.2075304714
+关平银 12.5143832909
+脸带笑容 13.2075304714
+怡红院 9.55687223012
+红罗伞 12.8020653633
+云梦 10.7226238216
+男儿 9.61021821083
+典身卖命 13.2075304714
+于国军 13.900677652
+云梯 9.18217878068
+昌达成 13.2075304714
+幼林 12.2912397395
+边卡 13.900677652
+爱克斯 12.8020653633
+林胡 10.8096351986
+瓶颈 8.18694484647
+风味十足 13.900677652
+幼果 12.2912397395
+机器人 8.4801426527
+阴干 11.5027823792
+阴平 10.2897597393
+皮肉伤 13.2075304714
+符码 13.900677652
+橡胶厂 11.8212361103
+译介 10.9562386728
+捱近 13.900677652
+少数几 13.2075304714
+通蒙 13.2075304714
+赫尔曼 10.8561552143
+领使馆 13.900677652
+何兆 12.1089181827
+血泊 9.87532596124
+于加尔 13.2075304714
+会集 9.87532596124
+船尾 9.62401153296
+孔明教 11.2616203224
+广播 7.80035869996
+战备动员 12.1089181827
+危可解 13.2075304714
+后分 11.3357282945
+献酒 12.8020653633
+官范琼 13.2075304714
+癸卯 11.5027823792
+科雷马 12.8020653633
+小柱子 13.2075304714
+马金叙 12.8020653633
+聊城市 12.2912397395
+血泪 10.0088573539
+夏商周 11.0103058941
+厕坑 13.900677652
+能说会道 10.8561552143
+甘淡渗 13.2075304714
+武帝闻 13.2075304714
+那虎力 12.2912397395
+种子队 12.8020653633
+佛兰芒语 13.2075304714
+定义明确 13.2075304714
+氢同位素 13.900677652
+天从人愿 13.2075304714
+坚忍 11.0103058941
+三妻四妾 11.5027823792
+童跟著 12.8020653633
+泰克毕 12.2912397395
+纨绔 11.4157710022
+包仁 10.8096351986
+差价款 13.900677652
+血沉 10.8561552143
+张彦远 11.5027823792
+上海市分行 12.8020653633
+昂首阔步 11.2616203224
+三人间 13.2075304714
+志丹县 11.598092559
+客舱 11.1280889297
+晕糊糊 13.900677652
+有吃有喝 11.4157710022
+青羊宫 12.1089181827
+客船 10.533381822
+塔杜施 12.5143832909
+很久以前 9.93038573842
+上层社会 9.93038573842
+添酒 12.5143832909
+破坏神 13.900677652
+好几套 12.8020653633
+客舍 11.7034530746
+盘桓着 13.900677652
+周文元 12.8020653633
+常性 12.5143832909
+血河 11.7034530746
+商品税 13.900677652
+人行道 9.05649056552
+依依惜别 11.9547675029
+飞入 10.2117981979
+墟沟 13.2075304714
+血汁 13.2075304714
+催征 11.4157710022
+汪水 13.2075304714
+欧格 11.0674643079
+叮当作响 11.9547675029
+亿平方米 9.77354326693
+那群 9.5062284973
+倍受青睐 12.2912397395
+记者部 13.900677652
+血汗 9.82314020807
+那壁厢 10.2897597393
+阴处 12.5143832909
+门市价 13.900677652
+多伦多 9.61021821083
+魏丞相 13.2075304714
+血污 9.69598503258
+偷逃 11.2616203224
+公司员工 10.0294766411
+外地口音 12.8020653633
+寡妻 13.2075304714
+五百八十二卷 13.2075304714
+讲下去 10.0940151622
+首字母 12.1089181827
+汪氏 11.7034530746
+亚力合 13.2075304714
+坚强 8.21370229564
+阴天 9.82314020807
+石室里 13.2075304714
+穆拉夫 13.900677652
+汝今 11.2616203224
+丑行 10.4994802703
+乌克兰 8.3285236198
+时事评论 12.5143832909
+辩白 11.0103058941
+里加 10.2630914922
+水平尾翼 11.1280889297
+雪弗兰 13.900677652
+刘备入 11.9547675029
+精神药品 12.5143832909
+留退路 13.2075304714
+山为陵 11.8212361103
+喷喷 10.6818018271
+农林水产 13.900677652
+椿萱 12.5143832909
+混血人 10.765183436
+漫水桥 13.900677652
+乱动 9.6811699468
+刘备兵 12.8020653633
+人民英雄纪念碑 10.8096351986
+总的看来 11.0674643079
+克鲁姆 13.900677652
+医圣 11.3357282945
+飞出 9.02548032877
+群植 13.900677652
+古契科 13.2075304714
+粘滞性 11.1280889297
+爬坡 9.84023464143
+孔明施 13.2075304714
+慈济宫 13.900677652
+烤面包 11.8212361103
+支官军阻 13.2075304714
+诧异 7.93709830836
+血水 9.44633035572
+会阴 10.4349417492
+褫夺 11.8212361103
+诸相 12.5143832909
+颊脂垫 13.900677652
+会阳 13.900677652
+护田林 12.8020653633
+泡面 12.8020653633
+里卡 12.5143832909
+汪涵 11.5027823792
+巫氏 13.2075304714
+超度众生 13.900677652
+四十五卷 12.2912397395
+石竹花 13.900677652
+黄老爷 11.1926274509
+斯基泰 10.8561552143
+华容县 13.2075304714
+立上 13.900677652
+丑角 10.7226238216
+艾艾 13.900677652
+汪涛 11.9547675029
+静幽幽 13.900677652
+于松科 13.2075304714
+温温的 11.1280889297
+一礼 10.1394775363
+弗里曼特尔 13.2075304714
+尚可一 12.8020653633
+庙河 13.900677652
+郑律成 12.2912397395
+百口莫辩 12.8020653633
+打爆 12.8020653633
+湖北人民出版社 12.2912397395
+善小而 13.2075304714
+云游 9.80633308975
+三江 9.25628675283
+曾致书 12.2912397395
+嘉莉 13.900677652
+侯捷 13.2075304714
+第三家 10.4041700905
+宠辱 13.2075304714
+专营权 13.2075304714
+挫折感 12.8020653633
+王人美 11.9547675029
+帕雷西斯 13.2075304714
+城市边缘 11.4157710022
+偷采 12.2912397395
+重见光明 11.9547675029
+何可得 13.2075304714
+无后嗣 13.900677652
+诸帅臣 13.2075304714
+从毓庆 13.900677652
+每学期 12.5143832909
+血液 6.98694030132
+侯贵戚 13.900677652
+果报 11.2616203224
+因涉嫌 9.18217878068
+旷日 13.900677652
+打牌 9.71102290995
+新疆阿勒泰地区 13.2075304714
+荒郊野外 11.3357282945
+振作精神 11.5027823792
+富铝化 11.4157710022
+场地设施 13.2075304714
+林千树 13.2075304714
+赫尔松 13.2075304714
+血流 8.51618258919
+血浆 8.47133202302
+云滴 11.1926274509
+第三季 8.81308131674
+排放 6.76897914151
+那红 11.2616203224
+水滑梯 13.900677652
+跳投 12.1089181827
+香港证券交易所 12.2912397395
+望谟县 12.2912397395
+喧闹声 11.0674643079
+起义将领 12.2912397395
+骆越 11.0103058941
+保人 11.7034530746
+专拜 12.8020653633
+井陉县 11.1926274509
+万岁通天 11.4157710022
+于成皋 11.8212361103
+好梦不长 13.900677652
+少量多 12.8020653633
+会面 9.06439574502
+财力 8.33615724465
+嘉荫 11.3357282945
+业务联系 11.1926274509
+血海 10.9049453784
+活动课 13.900677652
+彭兴庭 13.900677652
+埃斯克 13.2075304714
+飘失 13.900677652
+勘探局 13.2075304714
+梅卡 13.2075304714
+多一回 12.5143832909
+巴马科 11.3357282945
+钢琴家 10.0088573539
+和北东 12.2912397395
+防火板 13.2075304714
+王希烈 8.71889410168
+拉斯科 11.4157710022
+广德降 13.2075304714
+不声不响 9.55687223012
+血洗 10.4994802703
+晋郭璞 12.5143832909
+豉汁 13.900677652
+神圣罗马 13.2075304714
+白眼儿 12.8020653633
+林蛙 11.0674643079
+左右江 11.5027823792
+伯里亚 12.5143832909
+庖丁解牛 12.8020653633
+花荣拨 13.2075304714
+残留量 12.1089181827
+星空 9.45802639549
+斯基氏 13.2075304714
+咂咂嘴 11.3357282945
+养生学 12.8020653633
+淡酒 11.598092559
+巨鹿郡 12.2912397395
+该受 12.5143832909
+黑漆皮鞋 13.900677652
+红暴 13.2075304714
+云海 9.62401153296
+幼承 11.8212361103
+密码保护 12.8020653633
+骑楼 11.9547675029
+塑料绳 13.2075304714
+防患未然 12.5143832909
+司寇或 12.8020653633
+生产成本 8.77671367257
+一百三十名 12.8020653633
+第三声 13.2075304714
+山群峰 13.900677652
+马金凤 13.900677652
+中国环境科学学会 12.5143832909
+阴宅 9.80633308975
+巨大贡献 9.55687223012
+云浮 10.9562386728
+龙博利 13.2075304714
+脑损伤 11.598092559
+卖座 11.2616203224
+伸缩门 13.900677652
+宣威 11.1926274509
+二氧化硒 13.2075304714
+幼托 13.900677652
+孔明来 11.9547675029
+碧堂 12.5143832909
+血滴 11.2616203224
+和克德 13.900677652
+会银 13.900677652
+子烈 13.2075304714
+劳其筋骨 12.5143832909
+韦荣氏 12.5143832909
+宏亮 11.2616203224
+泉涌 10.8096351986
+两小无猜 12.2912397395
+塑料纸 12.2912397395
+师氏虎 12.8020653633
+杀人一万 13.900677652
+凶横 11.2616203224
+庞令明 13.2075304714
+阴寒 10.533381822
+师克 12.8020653633
+喷在 11.598092559
+品质育种 13.900677652
+血源 11.4157710022
+特技飞行 11.9547675029
+阴密 12.8020653633
+桃子 9.93038573842
+于国君 13.2075304714
+黄斑 10.0940151622
+飞升 9.94943393339
+绦子 11.8212361103
+化学矿 12.8020653633
+青红丝 13.2075304714
+司掌 10.9049453784
+乘兴 11.7034530746
+韩匡嗣 13.2075304714
+云洞 10.8096351986
+迎香 12.8020653633
+中国电信 9.0884932966
+尺有所短 12.5143832909
+曹知白 13.2075304714
+穆尔太 11.4157710022
+粗颈 13.2075304714
+宋庆宋 13.900677652
+门牌号码 13.900677652
+家鼠 11.598092559
+冷阴极 12.5143832909
+卫武公 13.2075304714
+教学相长 13.900677652
+查士标 13.2075304714
+养生堂 12.5143832909
+嘉联 13.900677652
+和标营 12.2912397395
+尼勒克县 12.8020653633
+历朝廷 13.900677652
+哗啦哗啦 10.5684731418
+禁内 13.900677652
+绕远儿 13.900677652
+飞去 9.30555780184
+药贩 13.2075304714
+今公子 13.2075304714
+行政事务 9.94943393339
+硬块 11.598092559
+黎雄才 13.2075304714
+广明 11.1280889297
+广昌 10.3743171274
+大玩 12.1089181827
+药费 11.1280889297
+宰辅之 11.3357282945
+宣传科 11.2616203224
+汪清 12.5143832909
+广智 11.9547675029
+血清 8.48457724977
+覃道善 13.2075304714
+高压阀门 12.5143832909
+血渍 11.5027823792
+宏丽 11.5027823792
+科学技术 7.18529426564
+野麻 13.2075304714
+结穴 13.900677652
+碳水化合物 8.95903522937
+邵捷春 11.0103058941
+穆王居 13.2075304714
+电话亭 12.5143832909
+泡钉 13.2075304714
+汉传 12.2912397395
+云涛 12.8020653633
+自流 10.2897597393
+家齐 13.2075304714
+股子 9.32596667347
+点光源 11.598092559
+梯状 11.7034530746
+云涌 13.2075304714
+维吾尔语 9.96885201925
+三星在天 13.2075304714
+九香虫 12.8020653633
+豆类 7.95003509939
+新党员 12.1089181827
+颜大喜 12.2912397395
+计算机硬盘 13.900677652
+学生界 12.5143832909
+那星官 12.2912397395
+阿斯顿 10.8561552143
+桓温举 13.2075304714
+出气口 13.900677652
+奔小康 11.9547675029
+止吐药 12.8020653633
+孙仁玉 13.900677652
+卖得 9.33632946051
+飞刀 9.15574552361
+王克商 12.1089181827
+不测风云 12.8020653633
+摆手 8.30225569298
+丑语 13.900677652
+桓温专 12.5143832909
+竹篮打水 13.900677652
+盘淮夷 13.2075304714
+同平章 11.0674643079
+飞到 8.75901409547
+单向行驶 13.2075304714
+丑话 10.8561552143
+里克 9.94943393339
+入梅 12.5143832909
+舍监 10.8561552143
+云汉 11.9547675029
+小二仙 12.5143832909
+丑诋 13.900677652
+摆成 10.4666904475
+恋爱婚姻 12.5143832909
+云水 11.2616203224
+飞剑 11.8212361103
+白赵氏 9.84023464143
+鲍注 12.8020653633
+喷嘴 10.604840786
+杨乃武 13.2075304714
+中心站 11.1926274509
+水土保持 9.5062284973
+投入市场 10.4666904475
+旋转变换 12.5143832909
+堵车 9.63799777493
+云气 10.5684731418
+河北省 7.74369866639
+骚扰 8.2985588311
+蝨子 13.900677652
+胖墩墩 12.2912397395
+广柑 11.7034530746
+飞剪 11.8212361103
+螟虫 11.8212361103
+为情所困 12.5143832909
+偶氮染料 12.1089181827
+递传 13.2075304714
+南京日报 13.900677652
+抹布 9.89334446674
+社交性 13.2075304714
+包乘 13.900677652
+生物钟 10.4994802703
+打点 8.62256299275
+司徒普 13.2075304714
+卖弄 9.44633035572
+井中水 12.5143832909
+夜莺 11.4157710022
+卡伦指 13.2075304714
+家鸭 12.5143832909
+诘屈聱牙 13.2075304714
+慈眉善目 11.598092559
+园中园 12.8020653633
+偶一 11.7034530746
+广本 12.2912397395
+孟子曰 13.2075304714
+打炮 9.48183704418
+广木 12.8020653633
+烤制 11.0674643079
+法律义务 11.9547675029
+家鸽 12.5143832909
+十五元 12.5143832909
+决无此事 13.900677652
+动荡 7.82763311788
+孔明曰 8.70772080109
+一蹶不振 9.65218240993
+知多少 11.3357282945
+巫溪 11.9547675029
+克罗地亚民主共同体 12.5143832909
+塑料网 12.5143832909
+逝去 9.6811699468
+飞动 10.533381822
+第三套 11.7034530746
+罗林斯基 10.9049453784
+布莱布 13.2075304714
+汤阴县 11.4157710022
+宣宗 9.98865464655
+周保中 12.5143832909
+题外话 11.5027823792
+四十二卷 11.4157710022
+不可告人 9.87532596124
+约尔丹斯 12.8020653633
+第三天 8.47133202302
+五十多名 12.8020653633
+上班族 10.604840786
+螟蛉 12.2912397395
+外祖父母 11.0674643079
+国海军 11.4157710022
+位少帅 13.900677652
+咔叽 12.5143832909
+真心诚意 11.9547675029
+螟蛾 11.598092559
+手相术 13.2075304714
+喷嚏 9.28555713513
+凶残 9.38981814546
+宏伟 8.1417758781
+打烊 11.8212361103
+其害 10.604840786
+羊酒 11.4157710022
+劝止 10.4666904475
+嘎达梅林 11.7034530746
+打烂 10.642581114
+达勒姆 11.5027823792
+饭囊衣架 13.2075304714
+封高唐 13.2075304714
+其家 9.84023464143
+第三团 13.900677652
+一个千年 12.8020653633
+荤腥不沾 13.2075304714
+赘言 11.9547675029
+输出品 11.5027823792
+弊源 13.900677652
+整旧如新 13.900677652
+催化 8.56313957227
+福寿园 13.900677652
+出使 8.28390655431
+骑来 11.8212361103
+并行性 11.9547675029
+坚厚 10.765183436
+第三国 9.98865464655
+斯坦语 12.8020653633
+稿纸 10.1630080337
+卑南溪 12.5143832909
+出位 11.3357282945
+龙溪 10.642581114
+精密机器 12.8020653633
+公允 9.05649056552
+四十二岁 11.7034530746
+载客量 10.9049453784
+浅浮雕 11.598092559
+晓露 13.2075304714
+第三回 11.3357282945
+卡伦河 13.900677652
+高品佚 13.900677652
+章率兵 12.8020653633
+二甲基甲酰胺 11.7034530746
+符玺 13.2075304714
+四连冠 13.900677652
+天阴 10.5684731418
+一百三十一里 13.2075304714
+喷头 11.7034530746
+高品位 11.0674643079
+那举子 11.598092559
+讨好卖乖 13.900677652
+骑术 10.4994802703
+阿尼哥 11.5027823792
+龙滩 11.9547675029
+宣告 7.51379833261
+出伏 13.900677652
+里布 11.9547675029
+九组 13.900677652
+里克温 13.2075304714
+家里 5.69382122358
+六列 13.2075304714
+东帝汶 11.1926274509
+时慎修 13.2075304714
+执法机关 10.8096351986
+电子邮件 9.89334446674
+如醉如痴 10.533381822
+蔡琴 13.900677652
+龙渊 11.8212361103
+适销 13.900677652
+光周期 11.7034530746
+逾期未 10.642581114
+盘舵石 13.2075304714
+流氓行为 13.2075304714
+号子声 11.7034530746
+迎面 8.37921673411
+专用性 11.598092559
+一九四 11.5027823792
+置之不顾 12.8020653633
+搓衣 13.2075304714
+男婴 10.604840786
+阴唇 11.3357282945
+飘向 11.1926274509
+鼓里 11.1926274509
+那玉 11.0103058941
+林敦奎 12.8020653633
+中国电信集团 12.8020653633
+宣和 8.89004235788
+生态条件 10.9562386728
+洛惠渠 11.598092559
+龙游 11.4157710022
+布伦塔诺 11.9547675029
+药茶 12.8020653633
+庇荫 10.9562386728
+开工典礼 11.5027823792
+打翻 9.40086798165
+卫亲军 10.4666904475
+强颜 12.2912397395
+那班 10.0505300503
+卖假 11.8212361103
+二聚环戊二烯 13.2075304714
+修庆 12.8020653633
+林译 13.900677652
+催发 11.598092559
+十余万口 12.1089181827
+龙湖 9.11318590919
+沉醉 10.1871055853
+龙湫 12.1089181827
+发展党员 11.598092559
+血性 9.74179456862
+辛亥革命 7.85330547293
+常驻 9.34680076038
+签订契约 13.900677652
+佩西奥 13.2075304714
+中篇 10.642581114
+十九点九 13.2075304714
+迎霜 8.6803218269
+婚史 12.1089181827
+龙湾 10.9562386728
+言心哲 12.5143832909
+夫人城 13.2075304714
+二道河子 12.8020653633
+飞尘 11.5027823792
+客车 8.08654712015
+林言 12.2912397395
+香港电视广播有限公司 13.2075304714
+出书 10.2371160058
+扶进房 13.900677652
+干劲儿 13.900677652
+敬辞 13.900677652
+贪图享受 12.8020653633
+教皇国 11.2616203224
+单姓周 13.2075304714
+飞射 12.1089181827
+斯皮克曼 13.2075304714
+豆糕 13.900677652
+讲清楚 9.55687223012
+出乎 8.31342899358
+房屋内 11.9547675029
+存货 8.3285236198
+邓大爷 13.900677652
+欧文 10.0505300503
+近年以来 11.8212361103
+麻黄碱 11.4157710022
+限量版 11.2616203224
+寄生虫病 9.91169360541
+余分钟 12.2912397395
+存贷 10.0940151622
+侯国中 13.2075304714
+马坦萨斯 13.900677652
+男客 11.4157710022
+出个 8.58747167293
+星盘 11.8212361103
+龙海县 12.1089181827
+复合材料 9.26594866375
+出丧 12.5143832909
+睑缘炎 12.8020653633
+鄢宫 12.8020653633
+男家 11.0674643079
+乌拉尔河 10.9049453784
+侯国之 12.5143832909
+孤束核 13.2075304714
+宋礼修 13.2075304714
+里弄 10.4349417492
+二十三名 12.8020653633
+出上 11.5027823792
+出下 11.9547675029
+赵家姐妹 13.900677652
+那片 8.13235665618
+桑哥专 12.8020653633
+袁锡藩 9.33632946051
+走后门 10.0720362555
+米缸 11.9547675029
+低下头去 8.78868986362
+出丑 10.4994802703
+摆法 13.2075304714
+水稻田 11.0674643079
+厄立特里亚 10.5684731418
+若豆 13.2075304714
+什锦菜 13.900677652
+男孩 8.26946587015
+宣喻 13.900677652
+喷壶 11.9547675029
+小红山 13.900677652
+望明月 13.2075304714
+打纬 11.9547675029
+催办 12.8020653633
+战后 7.28461246684
+出价 9.48183704418
+红黄绿 13.2075304714
+许宗衡 12.8020653633
+豌豆 8.57766767284
+中国网通 12.8020653633
+迎客松 11.7034530746
+集中性 11.1280889297
+卡伦津 12.5143832909
+发达县 11.2616203224
+中气不足 11.9547675029
+催动 10.2897597393
+嘉轩 8.95903522937
+阿特兰蒂斯 11.8212361103
+广植 11.7034530746
+第三块 10.9562386728
+客运 8.28754954559
+官卑职小 13.2075304714
+男子 6.7359572732
+出仕 9.94943393339
+余类推 12.1089181827
+出仓 11.8212361103
+刘备屯 13.2075304714
+曹江 12.5143832909
+宝二叔 13.2075304714
+卖光 10.5684731418
+出产 8.41173992582
+结果显示 8.05135287203
+喷墨 12.1089181827
+卓兵 13.2075304714
+里德 10.4994802703
+出人 10.1394775363
+那狼 11.8212361103
+深怕 10.0940151622
+止痛药 10.1630080337
+社会治安 9.85762638414
+穆格尔 13.2075304714
+第三场 12.2912397395
+公平正义 10.8561552143
+环生 13.900677652
+出于 6.58147519321
+龙潭 9.84023464143
+疏水键 13.900677652
+出事 7.88452049228
+打结 10.7226238216
+烈度 10.604840786
+阮志清 13.2075304714
+第三圈 13.2075304714
+冯祖荀 13.900677652
+三六九等 11.1926274509
+家道 10.8561552143
+都子察 12.5143832909
+位彩民 11.9547675029
+碧城 13.2075304714
+那狐 11.7034530746
+秦兵马俑 11.9547675029
+药膏 10.604840786
+放心好了 10.604840786
+会风 12.5143832909
+爱马仕 12.5143832909
+虚拟语气 13.900677652
+男士 9.82314020807
+顾维钧 11.9547675029
+龙沙 12.1089181827
+财务咨询 12.1089181827
+左右排 13.900677652
+政策法规司 11.8212361103
+龙沟 12.5143832909
+男声 11.4157710022
+升降式 13.900677652
+电子乐器 11.9547675029
+活血祛瘀 11.9547675029
+黛玉 7.93453091285
+恨不能 8.82550383674
+卒子 11.598092559
+第三品 12.5143832909
+感病性 13.900677652
+里屋 9.03314320152
+两亿六千万余 13.2075304714
+卖劲 11.2616203224
+喷孔 12.5143832909
+获救 10.3453295905
+输出国 10.9562386728
+平阳公主 11.598092559
+博拉斯 12.1089181827
+龙河 11.1280889297
+坚冰 10.1871055853
+血拼 10.765183436
+坚决 6.66650047223
+龙泉 9.37888907493
+放下包袱 12.1089181827
+服饰品 13.900677652
+陈词滥调 11.598092559
+金果榄 13.900677652
+姜涛 12.2912397395
+云南旅游 13.900677652
+辞章 12.2912397395
+诵经 9.19114745066
+宜良 11.598092559
+群架 12.5143832909
+梗塞 10.4349417492
+里尼 11.1926274509
+羯鼓 11.9547675029
+拿出手 12.2912397395
+已失 9.84023464143
+埃斯库 11.1926274509
+铜头铁臂 12.5143832909
+中心矩 13.900677652
+三五九旅 12.5143832909
+十一时 11.5027823792
+这边儿 11.598092559
+刘备必 12.2912397395
+跳海 11.9547675029
+瓦利斯 11.598092559
+筛孔 11.7034530746
+里尔 10.6818018271
+印加人 10.604840786
+林西 12.8020653633
+薛传薪 8.80692745117
+唐君铂 13.2075304714
+阿旺罗 11.9547675029
+粉白色 12.5143832909
+家居设计 13.2075304714
+正好 6.48249682925
+龙氏 11.598092559
+第三周 9.7898037878
+医嘱 10.3171587135
+寡核苷酸 12.8020653633
+飞得 9.87532596124
+伊斯法罕 10.8561552143
+跃跃欲试 9.62401153296
+肖雄文 10.765183436
+大半天 9.74179456862
+飞往 9.09665660724
+和平建议 12.8020653633
+客户服务 8.31718134319
+羊叔子 13.900677652
+存身 10.3171587135
+大半夜 10.2897597393
+唐通差 12.5143832909
+大半多 12.8020653633
+鲍威尔 10.4994802703
+王九岛 12.5143832909
+升入 10.0088573539
+阴地 13.2075304714
+喷粉器 13.2075304714
+卖到 9.61021821083
+亏缺 12.8020653633
+夜营 13.2075304714
+拉帮结派 11.8212361103
+最舒服 12.5143832909
+蛙声 11.7034530746
+能力倾向 12.1089181827
+福建人 10.8561552143
+龙水 13.2075304714
+福克纳 11.3357282945
+四十二年 10.2117981979
+疏水阀 13.900677652
+贮满 11.7034530746
+果洛 11.3357282945
+主人公 8.20694551317
+马致远 11.0103058941
+抚仙湖 11.8212361103
+郑义 13.900677652
+河口湾 11.2616203224
+凶暴 10.4994802703
+评价性 12.8020653633
+周祖谟 12.8020653633
+血战 9.06439574502
+呼吸机 11.5027823792
+高村 11.9547675029
+古勃金 12.8020653633
+过大年 12.8020653633
+妖异 11.0674643079
+梯级 9.74179456862
+第三名 9.58318953844
+五十多天 13.900677652
+蕴涵 10.4666904475
+官黄友 12.8020653633
+喜玛拉雅 12.2912397395
+滴耳液 13.900677652
+师攻鄂 12.8020653633
+机械工程 10.0088573539
+飞快 8.30596627237
+尼科波尔 13.900677652
+美国密歇根大学 11.7034530746
+大柏树 12.1089181827
+闪烁着 9.26594866375
+腮帮子 10.3743171274
+宠臣 10.0720362555
+卫国赵 13.2075304714
+龙涎 12.2912397395
+飘垂 13.2075304714
+卖压 11.5027823792
+泡饭 11.3357282945
+奥克苏斯 11.598092559
+阿乔利 12.1089181827
+蛾眉月 13.900677652
+巴尔博亚 12.2912397395
+山行旅 11.9547675029
+六七成 12.8020653633
+凶杀 10.0940151622
+劝架 10.9562386728
+输出设备 11.1280889297
+会计账 13.900677652
+捏手捏脚 13.900677652
+陈春生 12.8020653633
+自动自发 13.900677652
+跳水 8.1641053545
+乏善可陈 10.642581114
+熟得 11.1280889297
+第三十一章 10.642581114
+门门 12.5143832909
+吕尼科 13.900677652
+颜如桃花 13.2075304714
+卜万苍 12.5143832909
+强取豪夺 11.9547675029
+裴家庄 11.7034530746
+心肝宝贝 11.2616203224
+舞弊案 11.8212361103
+催债 13.900677652
+一会儿记 13.900677652
+客货 9.7898037878
+凸版印刷 12.2912397395
+谋无遗策 13.900677652
+测量方法 9.80633308975
+辩称 11.1926274509
+会馆 9.08039608637
+卖友 13.2075304714
+白狗 11.9547675029
+阴囊 9.94943393339
+沃波尔 11.8212361103
+薙发 11.598092559
+扮演着 10.2371160058
+会首 12.2912397395
+两三户 12.5143832909
+拖驳 12.2912397395
+抚养人 11.8212361103
+苦涩感 13.900677652
+喂药 12.1089181827
+存车 12.8020653633
+凶服 11.598092559
+大路口 11.598092559
+梅东益 13.2075304714
+摆渡 10.4994802703
+男妓 11.9547675029
+续继祖 13.2075304714
+左右一阵 13.900677652
+没工夫 10.3171587135
+血性男儿 12.2912397395
+龙洋 12.8020653633
+八九成 11.7034530746
+胚珠 8.74738605748
+杨志一 13.2075304714
+拉库尔 12.5143832909
+汉寿县 13.2075304714
+里巷 11.3357282945
+那点 8.66956903512
+汪振 13.2075304714
+男女 6.83421068184
+识吾 12.1089181827
+龙洞 10.1630080337
+劝服 12.8020653633
+星球 9.56994431169
+打粥 13.2075304714
+结素 13.900677652
+挖来挖去 13.900677652
+千分之 10.4041700905
+和克利 13.900677652
+跳河 11.1926274509
+首映式 12.5143832909
+楼宝殿 12.1089181827
+龙津 11.9547675029
+一望无边 12.5143832909
+发传单 11.598092559
+摆满 9.29550746599
+奥夫雷 12.8020653633
+可读 10.9049453784
+马建堂 11.7034530746
+飞度 11.8212361103
+吃不透 13.2075304714
+高高地 9.66657114738
+木矛 12.5143832909
+沙田区 12.5143832909
+正大 10.2371160058
+左右手 10.1630080337
+说不清道不明 11.4157710022
+卖卖 13.900677652
+广武 11.0674643079
+中草药材 10.9049453784
+烤干 11.0103058941
+黄道吉日 10.5684731418
+星期日 9.45802639549
+康德尔 13.2075304714
+圣玛利亚 13.2075304714
+宣城 10.3453295905
+桃园 9.37888907493
+古典小说 10.3453295905
+家财险 13.900677652
+泡馍 10.604840786
+马三俊 9.20019728618
+进献 10.4041700905
+群星 9.96885201925
+之扰 11.9547675029
+粒铁 13.2075304714
+旋转体 13.2075304714
+马三保 13.900677652
+输出地 12.2912397395
+痿证 12.5143832909
+蘸墨 11.2616203224
+史异闻 13.2075304714
+来界岭 10.5684731418
+八十九篇 13.2075304714
+霉运 13.900677652
+塑料瓶 11.598092559
+广河 12.5143832909
+云板 10.9562386728
+无数回 12.5143832909
+铺头 12.8020653633
+果毅 10.9049453784
+凶恶 9.04864738806
+八十三万 11.9547675029
+密西 11.8212361103
+一万七千多 13.2075304714
+特立尼达岛 10.9049453784
+飞夺 12.2912397395
+河北籍 13.900677652
+圣训 10.0940151622
+法国议会 11.0674643079
+阴冷 9.28555713513
+司马台长城 13.2075304714
+人物画 10.0088573539
+穆尔卡 11.7034530746
+飞天 9.33632946051
+八九斤 13.2075304714
+桃儿 12.2912397395
+货畅其流 13.2075304714
+云杉 8.77671367257
+左右方 12.1089181827
+上座率 11.1926274509
+盛饭 10.604840786
+肥大细胞 10.9049453784
+坚城 10.1871055853
+两三支 13.900677652
+云朵 10.2117981979
+家门 8.20023407859
+适量 8.06586691491
+飞奔 8.78868986362
+幼根 13.2075304714
+寥落 10.9049453784
+菲尔曼 13.2075304714
+阴凉 10.0940151622
+吕文焕 12.1089181827
+马建忠 12.5143832909
+巫教 12.2912397395
+障碍 6.85926598818
+初犯 11.0674643079
+添饭 11.598092559
+小公鸡 11.8212361103
+公函 11.598092559
+广泛 5.58707051266
+幼树 10.5684731418
+广泗 12.8020653633
+宋企郊 11.9547675029
+八九日 13.2075304714
+广泉 12.8020653633
+我一语 12.2912397395
+马檀溪 12.8020653633
+驻站 13.900677652
+跳步 12.2912397395
+朱松邻 12.5143832909
+云柱 13.2075304714
+不在少数 9.33632946051
+绝大部分 7.30763311783
+周家庄 11.9547675029
+日落而息 12.5143832909
+文化论坛 13.2075304714
+两三日 10.8096351986
+勇者 11.8212361103
+漂亮女孩 13.900677652
+林辉 12.8020653633
+亚麻色 12.8020653633
+旺盛期 12.2912397395
+弹药库 10.765183436
+楚语支 13.2075304714
+图片展 11.9547675029
+埃斯塔 13.2075304714
+脸色红润 11.9547675029
+卞舰 12.5143832909
+二十八次 13.2075304714
+打算 6.19902528933
+全副精力 13.2075304714
+一百二三十万两 12.8020653633
+顶天 12.8020653633
+林达 12.1089181827
+摈除 12.8020653633
+高压线 10.8096351986
+疗病 12.5143832909
+大帽子 11.5027823792
+林如海 11.5027823792
+两三斤 12.8020653633
+适配 12.8020653633
+北京邮电大学 12.2912397395
+阿努伊 12.8020653633
+亚力山 13.900677652
+芒剌 13.900677652
+金钢琢 12.5143832909
+西丽湖 12.8020653633
+断烂朝报 13.2075304714
+那石 11.8212361103
+嘉言 12.2912397395
+毁誉参半 12.2912397395
+汝侯 10.1164880181
+婚生子女 11.7034530746
+家长 7.57095674645
+盘踞 9.12155415886
+二千名 13.2075304714
+八十三任 13.2075304714
+林志成 13.900677652
+云林 11.2616203224
+河兰湟 13.2075304714
+六七日 12.1089181827
+九万五千 13.900677652
+兰波特 13.2075304714
+凶悍 10.0294766411
+濉溪县 12.2912397395
+三小块 13.2075304714
+制造者 10.4041700905
+第三列 12.8020653633
+自求 11.5027823792
+广汉 10.2117981979
+第三十三章 10.9562386728
+谢虎臣 12.2912397395
+卖命 9.49395840471
+肉桂粉 13.900677652
+打稿 13.900677652
+第三口 13.2075304714
+垂盆草 13.900677652
+高频头 13.900677652
+三民 11.9547675029
+金哀宗 11.4157710022
+第三只 10.5684731418
+纵声 10.9562386728
+安汉室 13.2075304714
+第三号 11.7034530746
+第三台 13.900677652
+水源地 10.3743171274
+徐匡迪 13.900677652
+摆桌 12.8020653633
+腊鱼 13.900677652
+何泽慧 12.8020653633
+力孤势危 13.900677652
+星状 10.7226238216
+群情 10.4349417492
+念念有词 9.85762638414
+敏化剂 13.2075304714
+张全义 11.5027823792
+东方不亮西方亮 12.2912397395
+中心点 10.642581114
+过付 11.9547675029
+决策依据 12.2912397395
+呈阅 13.900677652
+邓植仪 13.2075304714
+外交使团 11.7034530746
+闹着玩儿 11.4157710022
+莲华经 11.4157710022
+双循环 12.5143832909
+宣公 11.8212361103
+生产潜力 10.2371160058
+土耳其人 8.71889410168
+北寨苏 13.2075304714
+赵大哥 10.642581114
+商品猪 11.598092559
+血斑 12.8020653633
+金沙萨 11.0674643079
+干休所 13.900677652
+太行军区 11.2616203224
+母公司 7.73316116109
+清一色 9.4233408375
+税控机 13.900677652
+嘉许 11.0103058941
+宣光 12.5143832909
+喷射 8.98069672615
+摆样 13.900677652
+稻香村 10.6818018271
+中宁县 12.5143832909
+鱼肠 12.1089181827
+十七八 11.2616203224
+坚固 7.88941047757
+歇肩 13.900677652
+碧华 13.900677652
+一脸茫然 10.9562386728
+一人向隅 13.2075304714
+大通河 10.8561552143
+符号串 12.5143832909
+辞修 13.2075304714
+如火燎原 12.8020653633
+拉纳特 13.2075304714
+敲了半天 11.9547675029
+封口令 13.2075304714
+离情别绪 12.5143832909
+一声令下 9.93038573842
+童叟无欺 13.900677652
+有所作为 9.27570483869
+未能如愿 10.8561552143
+意外事故 10.0940151622
+会齐 10.9562386728
+股值 13.2075304714
+便是 6.2692459874
+不避水火 13.2075304714
+第三十 11.598092559
+适逢 9.69598503258
+常言道 8.46695564842
+短信通 12.5143832909
+锦母角 13.2075304714
+一个七品 12.8020653633
+发育阶段 10.4041700905
+输出入 12.2912397395
+卖唱 10.6818018271
+五十多年 10.8096351986
+北京牌 13.900677652
+甲级联赛 12.2912397395
+体态轻盈 10.9049453784
+搁开 13.900677652
+子之父 12.8020653633
+隋末 9.58318953844
+群性 13.900677652
+大半年 9.32596667347
+会计证 13.2075304714
+星牌 13.900677652
+任谏议 12.8020653633
+红黄紫 13.2075304714
+里宾 11.4157710022
+刘益州 12.8020653633
+资源配置 8.9102450652
+周瑜唤 13.2075304714
+司徒氏 13.2075304714
+那盏 10.1871055853
+劝慰 9.11318590919
+任校委 13.2075304714
+男式 11.8212361103
+机运 12.1089181827
+兜揽生意 12.5143832909
+龙武 13.2075304714
+会计课 13.900677652
+广济 10.3453295905
+伏龙寺 13.2075304714
+大圣怒 13.2075304714
+开拓进取 11.0103058941
+种植者 12.2912397395
+赘述 11.1280889297
+西深东 13.900677652
+商品率 9.71102290995
+隋朝 9.26594866375
+接人待物 12.8020653633
+多伦县 12.2912397395
+养痈成患 13.900677652
+资产者 10.2630914922
+山丘 8.68574189437
+山丛 12.8020653633
+曲靖 10.0940151622
+宣判 9.0884932966
+周传瑛 12.2912397395
+山一 13.900677652
+云散 11.2616203224
+哈蜜瓜 12.8020653633
+淮阳县 10.4994802703
+阴历 9.45802639549
+山下 7.89679058487
+山上 7.07848026136
+新闻人物 11.598092559
+产油国 10.3171587135
+咫尺千里 13.2075304714
+飘动 9.69598503258
+辰光 12.1089181827
+罗藏丹 13.2075304714
+牵伸 12.2912397395
+山丹 10.8096351986
+蜣螂 11.3357282945
+山主 12.8020653633
+塑料盖 13.2075304714
+巫术 9.35738286971
+游移 10.2897597393
+广源 11.9547675029
+刺伤 9.7898037878
+里塔 13.2075304714
+摆正 11.0103058941
+张丰毅 12.8020653633
+浅成岩 11.8212361103
+宋咸平 12.1089181827
+山中 7.51379833261
+巴山虎 12.1089181827
+暗示着 10.3171587135
+握持 10.9562386728
+易受攻击 11.9547675029
+望小路 12.5143832909
+输液 9.55687223012
+对立物 11.598092559
+鳕鱼 10.4994802703
+腊鼓 13.900677652
+欧巴桑 13.900677652
+牵住 10.5684731418
+查明 8.30969067146
+校团委 13.900677652
+一六角 13.900677652
+南河村 13.900677652
+马如风 13.900677652
+幸垂照 13.2075304714
+林赛 12.2912397395
+海蚀崖 11.7034530746
+弹下 13.900677652
+弹上 10.8561552143
+布腊斯 13.2075304714
+莱州市 11.9547675029
+跳楼 10.4041700905
+遮人耳目 12.8020653633
+杨希闵 11.598092559
+刘安叫 13.2075304714
+侯潜奢 13.2075304714
+构造物 13.2075304714
+山乡 10.7226238216
+山习 13.2075304714
+亲信 7.57452817882
+黄绵土 11.8212361103
+铜筋铁骨 13.900677652
+卖国 9.43476953332
+国土厅 12.5143832909
+顾园 12.8020653633
+文彦博 10.6818018271
+林超 12.5143832909
+重温旧梦 12.2912397395
+武陵源 11.5027823792
+劝戒 11.0103058941
+人事变动 10.0088573539
+一专多能 13.2075304714
+汪昭 13.900677652
+不良风气 11.8212361103
+修律 12.8020653633
+后悔无及 11.5027823792
+自行车厂 11.7034530746
+血晕 12.8020653633
+龙树 11.0674643079
+阴包 12.8020653633
+下花园 12.1089181827
+八九月 12.2912397395
+黑压压 9.16447920358
+向秀相 13.2075304714
+复兴乡 13.2075304714
+宋英宗 11.5027823792
+成败论 12.8020653633
+作礼拜 12.1089181827
+郭大官人 13.900677652
+寂灭 11.0103058941
+山人 10.0505300503
+环境容量 11.5027823792
+叠合 11.598092559
+宣力 12.8020653633
+施莱谢 13.2075304714
+卖嘴 13.2075304714
+一匹 7.68008748188
+飘到 10.642581114
+台港 12.8020653633
+山亭 11.8212361103
+八大菜系 12.5143832909
+吴雪 12.8020653633
+亲体 11.2616203224
+维修电工 13.900677652
+消防安全 11.4157710022
+丘格 12.5143832909
+较之于 12.2912397395
+机电设备 10.4041700905
+自然生态 10.533381822
+摆列出 13.900677652
+野鹿 11.1280889297
+吊上来 11.8212361103
+男尸 10.604840786
+欧打 12.8020653633
+跳槽 9.91169360541
+林路 12.8020653633
+任务量 12.8020653633
+汪晖 12.5143832909
+龙桥 11.7034530746
+乔大夯 9.10488710638
+类黄酮 12.1089181827
+北京烤鸭 12.5143832909
+小窗 10.604840786
+粒重 13.900677652
+车票价 12.5143832909
+权臣铁 12.8020653633
+国会 7.63537643924
+藻菌 12.2912397395
+阴功 11.9547675029
+特立御 13.2075304714
+打砸 11.3357282945
+口号式 13.900677652
+三千里 10.2117981979
+张江陵 11.8212361103
+男巫 11.5027823792
+显祖 12.5143832909
+打破 6.86101730211
+交河城 11.8212361103
+血染 10.4994802703
+宇宙飞船 9.6811699468
+催吐 10.4041700905
+牵上 11.2616203224
+南非兰特 13.2075304714
+亲事 8.87679713113
+里奇 10.2371160058
+蒙恩相 12.8020653633
+逼向 12.1089181827
+亲亲 10.2117981979
+性情大变 12.8020653633
+大老爷 9.22784881751
+帕隆藏布 11.0103058941
+亲人 7.63537643924
+林谷 13.2075304714
+飘去 11.7034530746
+花顶生 12.8020653633
+愤恨不平 12.5143832909
+八八六十四 12.5143832909
+杜赫德 13.2075304714
+崇祯 6.35634554392
+古琴曲 12.5143832909
+王东明 13.2075304714
+卢姆节 13.900677652
+宣化 9.65218240993
+一九八 11.5027823792
+款语温言 13.900677652
+撑到 11.3357282945
+山体 7.78921031247
+过甚其辞 13.900677652
+曲面 9.06439574502
+食用菌类 11.8212361103
+柳绿花红 12.8020653633
+盘王节 13.2075304714
+人工工资 13.900677652
+如醉如狂 13.900677652
+催告 12.5143832909
+里夫 10.765183436
+文以载道 12.5143832909
+里头 7.31726842982
+卫生机关 13.2075304714
+支撑住 11.7034530746
+支撑位 9.13850371718
+六十六岁 11.9547675029
+最惠国 10.2630914922
+家雀 13.2075304714
+输沙 11.4157710022
+隋文 12.8020653633
+第三册 12.8020653633
+崇礼 11.8212361103
+汪某 11.0103058941
+亲任 12.1089181827
+里外 9.04086524761
+汪柏 13.2075304714
+孔明渡 13.900677652
+发起人 9.05649056552
+两眼发黑 11.0103058941
+亲代 10.8096351986
+六区 11.0103058941
+相当于 6.48069772831
+腊鸡 13.900677652
+铜锈 11.9547675029
+第三军 10.0088573539
+认死理 11.1280889297
+程畿 12.5143832909
+生苗高 11.2616203224
+股利 11.0103058941
+黑话 10.765183436
+龙椅 9.71102290995
+窥探 9.56994431169
+女秘 13.900677652
+九千个 13.900677652
+第三关 11.7034530746
+腊黄 12.8020653633
+跳梁 12.1089181827
+九千两 13.900677652
+武宏全 12.8020653633
+列宁格勒州 13.2075304714
+广漠 12.2912397395
+亲临 8.85082164473
+房屋买卖 11.9547675029
+阴刻 10.7226238216
+客观 6.95178042966
+股分 13.900677652
+歪心邪意 13.900677652
+艾蒿 11.8212361103
+大柴旦镇 11.4157710022
+符瑞 11.9547675029
+卖地 9.66657114738
+明珠投暗 13.2075304714
+儿童读物 11.598092559
+打碎 9.19114745066
+伊犁河谷 10.642581114
+卖场 8.85082164473
+蔓藤 12.5143832909
+互助土族自治县 13.2075304714
+原产物 13.900677652
+农业大学 10.4349417492
+后继乏人 12.2912397395
+果树 8.08654712015
+朱虚侯 11.7034530746
+无从下手 11.0103058941
+进退自如 11.598092559
+输水 10.2371160058
+跳棋 11.8212361103
+打磨 9.85762638414
+经查明 11.8212361103
+误时 12.8020653633
+抢救工作 13.2075304714
+市场需求 7.78921031247
+输氧 11.1280889297
+那瓶 10.4994802703
+巩县窑 13.900677652
+交界处 8.35941410682
+迎送 10.3743171274
+血本 10.3453295905
+输气 11.0103058941
+输出区 13.2075304714
+寂然 10.533381822
+不见泰山 13.2075304714
+纹丝 11.1926274509
+山中采 13.2075304714
+爬山 9.77354326693
+宣发 11.598092559
+阿昌语 12.8020653633
+白狄族 13.900677652
+探索频道 12.5143832909
+李邦彦 9.61021821083
+步棋 11.1280889297
+第三代 8.80081122415
+一九九 12.8020653633
+那次 7.99804431857
+工作服 10.4041700905
+获罪 9.44633035572
+县级市 8.5488195185
+忙里偷闲 11.0103058941
+马坦巴 13.2075304714
+第三件 10.604840786
+那款 11.5027823792
+第三份 11.7034530746
+诟病 9.56994431169
+攒动 11.0103058941
+辩护 8.58747167293
+第三任 10.604840786
+归宿点 11.9547675029
+龙皮 12.1089181827
+耐磨钢 12.8020653633
+改变方式 13.900677652
+相比而言 10.4994802703
+焚烧炉 13.2075304714
+具有特征 11.4157710022
+柳眉倒竖 12.8020653633
+招股书 8.87023973058
+初生之犊 12.1089181827
+聂绀弩 12.2912397395
+迎迓 10.9562386728
+最低温 9.41204128224
+打板 12.1089181827
+巴嘎河 12.8020653633
+社教 11.8212361103
+阮元 11.7034530746
+罗织罪名 11.7034530746
+女生宿舍 10.642581114
+富豪之家 12.5143832909
+出场 8.82550383674
+一九七 12.5143832909
+石室金匮 13.900677652
+崇明 10.3743171274
+符号化 11.8212361103
+陪伴着 10.1630080337
+打来 8.27666014579
+嘉隆 11.2616203224
+李遵顼 12.8020653633
+特勒克 13.900677652
+家规 11.0674643079
+发高烧 10.5684731418
+边缘学科 9.58318953844
+促排卵 12.8020653633
+数百千米 11.0103058941
+颤巍巍 9.77354326693
+发高热 13.900677652
+出土 6.99092437033
+牵入 12.2912397395
+打杂 11.1280889297
+千钧石 12.5143832909
+客队 12.2912397395
+龙直 12.8020653633
+三文鱼 13.900677652
+生甘草 11.9547675029
+古息 13.900677652
+步出 10.533381822
+打架 8.51160592216
+打枪 10.604840786
+金钢桥 12.5143832909
+莫高窟 9.69598503258
+生殖腺 10.4994802703
+自动步枪 8.6803218269
+地下茎 10.642581114
+较近 9.20019728618
+那段 8.75318317516
+两三种 12.2912397395
+体彩网 12.5143832909
+招股价 9.59661255877
+单人床 11.9547675029
+碧云 11.598092559
+打保票 11.3357282945
+嘉陵 11.598092559
+马超兵 12.5143832909
+一下首 13.2075304714
+存钱 10.4666904475
+横肉 11.2616203224
+一九五 11.8212361103
+违约金 10.6818018271
+六七种 13.2075304714
+封为忠 13.2075304714
+果真 8.37124856446
+广灵 11.7034530746
+季羡林 11.2616203224
+第三个 7.83922073305
+打柴 10.642581114
+剥落 9.56994431169
+向内地 10.4041700905
+传过来 9.45802639549
+进口品 12.2912397395
+纹儿 13.2075304714
+汞柱 12.5143832909
+一九二 12.8020653633
+田万江 11.2616203224
+喂食 10.0940151622
+宋蒙 11.9547675029
+电压计 13.900677652
+李齐物 12.8020653633
+亲兵 6.84622799384
+伊利湖 10.604840786
+牵出 10.0720362555
+嘉阳 12.2912397395
+释奠 12.8020653633
+分享者 12.2912397395
+废止 8.70772080109
+掀出 13.900677652
+辩手 13.900677652
+辩才 11.5027823792
+纸老虎 10.5684731418
+薄荷 9.80633308975
+电热杯 13.900677652
+九千元 13.2075304714
+朱厚照 11.598092559
+深恐 10.765183436
+拉斯洛 13.2075304714
+墨国 13.900677652
+弹入 11.9547675029
+果盘 11.1926274509
+星源 11.5027823792
+陈以勤 12.2912397395
+阿默达 12.1089181827
+战而胜 11.9547675029
+转嫁给 10.2897597393
+银铃样 12.8020653633
+阿拉善右旗 12.1089181827
+挤出来 10.4666904475
+搂搂 12.5143832909
+陈星唱 12.8020653633
+幼畜 11.2616203224
+机身 8.39941944143
+唐六典 11.4157710022
+生油层 12.1089181827
+墨囊 13.2075304714
+刘思复 12.5143832909
+隔靴搔痒 11.7034530746
+打昏 12.5143832909
+孔明灯 12.5143832909
+沙河粉 12.5143832909
+喜泪 12.8020653633
+铁器时代 9.96885201925
+墨洛温 11.1926274509
+山兔 12.2912397395
+霍赫胡 13.2075304714
+书契 12.8020653633
+霍鲁海 13.2075304714
+婆说婆有理 12.2912397395
+棋坛 12.5143832909
+黎玉玺 12.8020653633
+进口商 9.89334446674
+泡茶 9.62401153296
+封为平 12.1089181827
+一副副 13.900677652
+八百余里 12.1089181827
+家装 11.7034530746
+功夫片 11.7034530746
+喂饭 11.4157710022
+精疲力倦 13.900677652
+第三例 12.5143832909
+不兹 13.900677652
+群治学社 12.8020653633
+敬奠瀛 13.900677652
+喂饱 10.3743171274
+喂饲 11.598092559
+果皮 9.65218240993
+票据交换 11.1280889297
+挤出机 12.8020653633
+青川县 11.7034530746
+棚户区 10.4994802703
+怨忿 11.7034530746
+山农 13.2075304714
+嘉靖 7.98447558937
+出国 8.00352378434
+弹出 10.2117981979
+山内 10.8096351986
+上海医学院 11.3357282945
+龙真 13.2075304714
+山冈 10.3171587135
+云端 9.75754292558
+毒花 13.900677652
+地震带 9.85762638414
+分会场 11.1926274509
+福泽谕吉 12.8020653633
+一万公里 12.5143832909
+第三位 8.53938548627
+唯心主义者 11.1926274509
+血祭 12.8020653633
+多头图灵机 13.900677652
+苏六朋 13.2075304714
+龙眼 9.05649056552
+王震宇 13.900677652
+箭鱼 12.2912397395
+精简机构 11.4157710022
+泡菜 10.9049453784
+抗跌性 9.6811699468
+金靴奖 13.900677652
+信马由缰 11.8212361103
+喜气 9.71102290995
+一颦一笑 10.9049453784
+太戊 12.5143832909
+说一千道一万 12.8020653633
+宏大 8.79473217808
+星湖 9.5062284973
+吹头 13.900677652
+打更 10.1394775363
+为国捐躯 10.7226238216
+西藏自治区 8.53938548627
+外长级 13.900677652
+腊肉 10.2630914922
+陈家花园 13.2075304714
+中国汽车工业协会 10.1871055853
+河南省旅游局 11.4157710022
+男同性恋 13.2075304714
+福克斯 10.2630914922
+霍金的 13.900677652
+现买现卖 12.5143832909
+磁控 13.2075304714
+雷达兵 11.5027823792
+山凹 9.84023464143
+字串 11.1280889297
+二百零七卷 13.2075304714
+薄艺 12.5143832909
+高岸 13.900677652
+谢方校 13.2075304714
+腊肠 11.3357282945
+家计 11.1280889297
+郦飞云 13.2075304714
+真善美 11.3357282945
+冯保瞄 13.2075304714
+家训 10.8561552143
+聂老 10.6818018271
+摆着 8.7245279194
+薄膜 8.39128931535
+社交界 13.900677652
+齐格菲 11.4157710022
+忆及 11.9547675029
+血站 12.5143832909
+天生天化 13.900677652
+麻辣烫 12.2912397395
+家访 13.2075304714
+意见簿 13.900677652
+花自芳 11.9547675029
+访英 13.900677652
+勇往直前 10.7226238216
+肉包 13.2075304714
+静悄悄 8.52078029844
+爬来爬去 12.1089181827
+血竭 12.2912397395
+拉斯港 12.8020653633
+灵山寺 13.900677652
+圣君贤相 13.2075304714
+宣东 12.1089181827
+裆部 12.2912397395
+肩膀 7.22233553732
+步冲 13.2075304714
+交来 11.0103058941
+撑住 10.2630914922
+向济尔 12.8020653633
+出售 6.27410744569
+于诠 12.5143832909
+门诊室 13.2075304714
+之流 9.06439574502
+粘结剂 12.2912397395
+构造湖 10.1630080337
+一望无际 10.2630914922
+微笑起来 11.0103058941
+燕世家 13.2075304714
+室外机 12.8020653633
+打散 10.0294766411
+弹到 11.9547675029
+山前 8.22392384971
+轻装简从 11.8212361103
+茂盛 8.97342396682
+神经中枢 10.4666904475
+记数 10.3743171274
+群羊 12.1089181827
+操作测验 13.2075304714
+国尉 11.9547675029
+唧哝 13.900677652
+骆驼 8.15767446417
+剥蚀 8.66423568915
+撑伞 11.8212361103
+谢国桢 11.9547675029
+阿蒙神 11.1280889297
+亲口 9.40086798165
+不留心 10.6818018271
+肩臂 11.5027823792
+骆马 12.2912397395
+招待不周 12.2912397395
+布龙菲 12.2912397395
+女修道院 13.2075304714
+薄脆 11.2616203224
+粘结力 11.5027823792
+宋美龄 10.4666904475
+支撑力 10.6818018271
+板条箱 13.900677652
+中国空间技术研究院 12.8020653633
+夺门而出 11.598092559
+会聚 9.6811699468
+螺旋藻 11.7034530746
+酯化 10.8561552143
+女神 8.5488195185
+明福 13.2075304714
+寺儿沟 12.8020653633
+牵去 12.2912397395
+打斜 12.8020653633
+霁月 13.900677652
+打斗 10.4994802703
+能育养 13.900677652
+山势 8.1902506346
+内膜系统 13.2075304714
+地图板 13.900677652
+小杨姐姐 12.1089181827
+蓝海 10.642581114
+弹动 12.1089181827
+罗洛浑 13.2075304714
+黑天摸地 13.2075304714
+植物毒素 13.2075304714
+中国残疾人福利基金会 13.2075304714
+林里 9.96885201925
+阿基洛 13.900677652
+会考 11.8212361103
+籍河东 13.2075304714
+大讲堂 10.8561552143
+疗毒 11.5027823792
+斯韦尔 11.5027823792
+弹劾 8.21709788464
+浣纱 11.3357282945
+塑料模 13.900677652
+黑旋风 9.17328983326
+记时 12.5143832909
+司马懿攻 13.2075304714
+阮可 13.2075304714
+进口国 9.6811699468
+老夫子 9.75754292558
+打旗 12.5143832909
+共处一室 13.2075304714
+弹力 10.0505300503
+缪氏 13.2075304714
+廿八年 12.5143832909
+武二郎 12.8020653633
+木皮 12.2912397395
+药饵 11.3357282945
+奔突 11.3357282945
+老林嫂 8.64318227995
+谈古论今 11.7034530746
+勤工俭学 10.0505300503
+社会知觉 12.5143832909
+森森黄 13.900677652
+宣伯 12.8020653633
+山北 10.0940151622
+同是天涯沦落人 13.900677652
+轻敌思想 11.8212361103
+宣传 6.53423250365
+林逋 12.8020653633
+收藏馆 11.9547675029
+商水县 11.5027823792
+效价 11.8212361103
+那根 8.88339781516
+景宗李 12.5143832909
+山包 11.4157710022
+翻上来 11.9547675029
+跳球 13.2075304714
+于长春 11.7034530746
+那样 5.33469429639
+林通 13.2075304714
+那栋 10.2630914922
+群经 11.1280889297
+宏富 10.4349417492
+群组 13.2075304714
+牵制 8.50705010562
+星河 11.9547675029
+牵到 10.2117981979
+弹升 9.18217878068
+社日 12.8020653633
+左岸 8.64840422393
+干涉仪 10.2371160058
+盘尼西林 11.5027823792
+徐阶性 12.8020653633
+欧美 7.07848026136
+阴交 12.5143832909
+崇敬 9.18217878068
+打搅 9.54396882529
+薄胎 10.8561552143
+情趣用品 13.900677652
+文义通 13.2075304714
+山南 8.89673134603
+拉纳河 13.900677652
+吕佩师 13.900677652
+身不由己 9.54396882529
+莞尔 12.1089181827
+山卜 11.9547675029
+巴哈马 10.1630080337
+林道 11.9547675029
+股价 5.72007670438
+蹲坐在 13.2075304714
+弊病 9.27570483869
+半年度 10.4041700905
+股份 4.83709866139
+逼命 13.900677652
+出名 8.3555002075
+肩胛 10.3171587135
+血管 7.34816976494
+滑过去 11.598092559
+业余爱好 11.3357282945
+户孝允 12.1089181827
+东游西逛 13.900677652
+左右端 13.2075304714
+郭为 11.598092559
+卢开万 11.0674643079
+大港区 11.598092559
+阴令 13.900677652
+共同提高 12.2912397395
+马到成功 10.4666904475
+书声 12.1089181827
+艳而不俗 13.2075304714
+那凤鸣 13.900677652
+阴世 12.1089181827
+赫拉克利特 11.1280889297
+嘌呤 10.4994802703
+雅思考试 13.2075304714
+摇出 11.0674643079
+唧唧 10.2897597393
+亲切 7.49379766591
+盖州市 12.8020653633
+林邑 11.1926274509
+苏里南共和国 13.2075304714
+六只 10.4041700905
+腥味 10.604840786
+白灰 10.4349417492
+西尔哈 13.2075304714
+自控 10.2630914922
+瓶装 10.0088573539
+望汉中 11.9547675029
+阴丹 10.9562386728
+擎着 10.1394775363
+宋江营 13.2075304714
+孟建柱 13.900677652
+出品 8.94485059437
+山县 10.4994802703
+苏满塔 12.5143832909
+降水量 6.50803013125
+三线建设 12.1089181827
+孔明独 13.2075304714
+行政部 11.8212361103
+龙甲 13.2075304714
+指缝 10.8561552143
+上周五 6.12834607681
+画报社 12.8020653633
+双色球 10.6818018271
+海明威 11.0674643079
+强强合作 13.2075304714
+初中部 12.8020653633
+地震局 12.2912397395
+攀藤附葛 12.5143832909
+数字签名 12.8020653633
+二郎山 11.4157710022
+放音机 13.900677652
+崇文 10.4994802703
+发问者 13.900677652
+桃仙 13.2075304714
+山参 11.2616203224
+煤核儿 13.900677652
+星汉 12.8020653633
+丈母 11.9547675029
+另有洞天 13.2075304714
+那棵 8.69119149913
+阴乾 13.2075304714
+牛轭湖 10.642581114
+弹压 9.82314020807
+袁大叔 11.7034530746
+矛头 9.01787572939
+风偏 12.8020653633
+六七分 11.9547675029
+山口 8.2273543848
+墨吉 12.2912397395
+看花了 10.8561552143
+打擂 12.2912397395
+蓬勃向上 11.7034530746
+富浠诲 11.7034530746
+克洛塔尔 13.900677652
+公升 10.8096351986
+缎面 11.1926274509
+山君 11.9547675029
+石勇引 13.2075304714
+无杂质 12.8020653633
+亲善 11.0103058941
+深刻影响 9.82314020807
+血糖 8.50705010562
+浸湿 10.1871055853
+遏制 7.61467955747
+金刚烷胺 12.8020653633
+山名 11.1280889297
+山后 9.19114745066
+印度国防部 12.2912397395
+喝了酒 10.0294766411
+制药机械 13.900677652
+农运 12.8020653633
+九十三岁 13.900677652
+关过 12.8020653633
+海慈航 13.900677652
+国徽 8.4801426527
+有例可循 13.900677652
+呼吸科 11.8212361103
+自我安慰 11.2616203224
+郑洞国 11.7034530746
+出卖 7.75434839431
+内阁制 9.48183704418
+卡亚镇 13.900677652
+哎呀呀 11.0674643079
+萨克森州 13.2075304714
+藻饰 11.598092559
+虚位以待 12.5143832909
+那潭 13.900677652
+被誉为 7.6165434909
+原始凭证 11.7034530746
+切割机 12.5143832909
+血粉 12.1089181827
+犊子 11.1926274509
+无忧 9.04864738806
+傲睨自若 13.900677652
+又称 5.39880116467
+不可动摇 10.7226238216
+林青 10.2371160058
+毫无效果 11.4157710022
+果王 13.900677652
+踊跃输将 12.8020653633
+左末旗 12.5143832909
+埃德赛 13.900677652
+包子铺 12.5143832909
+打捞 8.9519177616
+浸渍 10.765183436
+坚信 8.61241062128
+奥地利政府 12.8020653633
+马上锁 13.900677652
+表土层 11.8212361103
+叶德辉 13.900677652
+一个十一二岁 12.5143832909
+喂鱼 10.765183436
+西喀尔巴 13.900677652
+打捆 12.2912397395
+火塘 9.89334446674
+巴尔虎 13.900677652
+家财 9.82314020807
+远图 12.2912397395
+张广厚 13.900677652
+穿堂门 13.900677652
+师之礼 12.1089181827
+舍伍德 12.2912397395
+崇拜 7.60541165054
+转下去 13.900677652
+张生记 13.900677652
+出口 5.42848182649
+出镜率 13.2075304714
+一少部分 12.8020653633
+危在旦夕 10.1871055853
+贪图享乐 12.1089181827
+赢大奖 13.2075304714
+打探 8.53003962385
+出号 13.2075304714
+排泄系统 11.4157710022
+老几 10.642581114
+螺旋菌 12.8020653633
+秋冬装 13.900677652
+龙爪 11.0674643079
+道德败坏 10.765183436
+油汪汪 12.5143832909
+顺非而泽 13.900677652
+打掉 9.72629038208
+曾利明 13.900677652
+申报 7.47905538417
+辩明 12.1089181827
+龙爱 13.2075304714
+够快 11.9547675029
+阿基亚斯 13.900677652
+出发 6.47710920772
+逃出来 9.59661255877
+称赞不已 11.1280889297
+党同伐异 10.9049453784
+催促 7.70627226087
+渗流 10.0720362555
+须连累 11.9547675029
+出虚汗 11.8212361103
+雷达员 13.900677652
+李岩命 13.900677652
+柯莫道 13.900677652
+打援 12.8020653633
+名副其实 8.78268383956
+冯公 13.900677652
+出去 5.63451321536
+未定之天 12.5143832909
+山响 10.4349417492
+执行逮捕 11.598092559
+发刊词 11.7034530746
+地震学 10.3453295905
+夸克 10.1164880181
+电视电话 12.2912397395
+家资 10.8561552143
+病号服 11.9547675029
+悲惨 8.43261751084
+阮嗣 13.2075304714
+中东社 12.8020653633
+西校区 13.2075304714
+出厂 9.45802639549
+沃特曼 12.8020653633
+山哥 12.1089181827
+情报署 10.9049453784
+囊括四海 13.2075304714
+抗日救亡运动 10.1164880181
+分际 12.2912397395
+卢森堡人 12.5143832909
+龙王 8.80692745117
+六安市 11.0674643079
+伫立 9.55687223012
+色球 10.9049453784
+请回到 13.900677652
+桂山脉 12.5143832909
+可可西里 11.7034530746
+牵合 12.8020653633
+唐李问 13.2075304714
+珲春市 11.8212361103
+七彩虹 12.5143832909
+十处 12.2912397395
+温宗尧 12.8020653633
+打战 10.2117981979
+托一梦 13.2075304714
+打成 8.9519177616
+如醉如梦 13.2075304714
+行政院 9.36807815882
+罗文说 13.900677652
+山唤 11.598092559
+赫章县 13.900677652
+艾尔沙德 13.2075304714
+凶神 11.1926274509
+宣传部门 11.7034530746
+展翅飞翔 12.2912397395
+林际 13.900677652
+没沿 12.2912397395
+学生服 12.8020653633
+打扰 8.74162235276
+皮鞭子 13.2075304714
+畅怀 12.1089181827
+打扫 8.55834340001
+灵山岛 12.8020653633
+根治性 12.2912397395
+打扮 7.60725837313
+弹唱 10.2117981979
+出到 9.80633308975
+崚嶒 12.1089181827
+关闭不全 11.7034530746
+不法分子 10.2897597393
+医保卡 10.7226238216
+出刊 12.8020653633
+打打 10.4349417492
+龙珠 10.9562386728
+供销业 11.3357282945
+数十千米 10.9049453784
+出刀 12.8020653633
+握拳 10.2371160058
+打手 10.0294766411
+奏起来 11.7034530746
+催乳 11.4157710022
+瘦煤 11.7034530746
+出列 11.1926274509
+六七米 11.9547675029
+驻留 11.0674643079
+舷墙 13.2075304714
+侠义精神 12.8020653633
+诗文集 10.2117981979
+出勤 11.8212361103
+复卷机 13.900677652
+广电 9.23723855786
+浸濡 13.900677652
+音响系统 10.9049453784
+广田 11.7034530746
+滑轮组 12.1089181827
+家谱 10.3171587135
+龙猛 11.9547675029
+和菲尔 13.900677652
+辩术 13.900677652
+钢都 11.9547675029
+肯用 12.5143832909
+哈尔滨工程大学 13.900677652
+金大坚 10.2371160058
+催产 12.1089181827
+超前性 11.9547675029
+打折 8.81308131674
+海子边 13.900677652
+三五百里 13.2075304714
+渗氮 12.8020653633
+墨剑 13.2075304714
+双下肢 11.9547675029
+日趋衰落 10.533381822
+中心校 12.8020653633
+亲吻 9.20932976975
+渗水 10.0505300503
+科道官 12.1089181827
+疗治 10.9049453784
+衣租食税 13.900677652
+见闻录 11.598092559
+果物 13.900677652
+偷腥 12.8020653633
+出动 8.03989142851
+存量 8.24119543622
+数据链 9.89334446674
+云纹 10.7226238216
+山陶塑 13.2075304714
+打拱 11.598092559
+瓶身 11.8212361103
+怨家 13.2075304714
+唐家河 11.5027823792
+疗法 8.02574692112
+羞耻心 11.9547675029
+危则立 13.2075304714
+外贸顺差 11.8212361103
+压片 12.5143832909
+剥脱 11.1926274509
+煤层气 11.0674643079
+十一万 12.1089181827
+打拚 12.8020653633
+八九米 12.8020653633
+陪哭 13.900677652
+杂交种 10.9049453784
+沸沸扬扬 9.02548032877
+立集东 11.598092559
+墨刑 11.9547675029
+伙计 8.22392384971
+北高加索地区 12.2912397395
+邵陵厉 13.900677652
+出力 8.6966709649
+破除迷信 12.2912397395
+种榆仙 13.900677652
+元帝皇后 12.8020653633
+钱树根 13.900677652
+周转资金 11.8212361103
+两三粒 12.8020653633
+性反应 11.1926274509
+跟你走 10.6818018271
+日经指数 9.85762638414
+出入 7.71036224612
+薄薄 10.6818018271
+波涛起伏 11.5027823792
+张大老爷 13.2075304714
+阮圆 13.2075304714
+常言说 9.55687223012
+新民主主义革命 9.66657114738
+伏低做小 13.900677652
+出典 11.1280889297
+哈托尔 12.2912397395
+出兵 7.51717101709
+不好意思 7.52225146832
+出具 8.26232298264
+血统 8.62256299275
+杂交稻 11.8212361103
+出关 9.0884932966
+新大陆 8.44109213783
+交学费 11.3357282945
+山嘴 10.8096351986
+高油价 10.9562386728
+市赢率 13.2075304714
+喂鸭 13.900677652
+迁过来 13.900677652
+一言不合 12.2912397395
+掌击 12.8020653633
+虽死犹荣 13.900677652
+卫国遂 12.8020653633
+客道 11.9547675029
+六十六两卷 13.2075304714
+迎角 11.598092559
+左右羽 12.2912397395
+阿尔汉格尔斯克 12.1089181827
+林镇 12.1089181827
+狎邪 13.900677652
+李亚普诺 11.5027823792
+夸口 10.3171587135
+孔明真 11.9547675029
+格奥尔基 12.2912397395
+失恋者 11.1926274509
+星槎 11.2616203224
+笔记本电脑 9.5186510173
+御前会议 9.59661255877
+浸水 10.8096351986
+骆鹏 13.900677652
+血红 9.40086798165
+咀咒 13.900677652
+棋战 13.900677652
+广盛 12.8020653633
+高端化 12.5143832909
+侯国兵 13.2075304714
+黑龙会 13.2075304714
+只缘身在此山中 12.8020653633
+甜品店 13.900677652
+气焰万丈 13.900677652
+匈奴 7.53077666915
+动过心 13.2075304714
+阿尔弗莱 13.2075304714
+硅铁合金 13.900677652
+广益 12.2912397395
+卖价 10.9562386728
+人类学家 10.0505300503
+周勃复 13.2075304714
+左右翼 10.9049453784
+汉水流域 11.598092559
+殊功 13.900677652
+少生快富 13.900677652
+五四新文化运动 10.2897597393
+渗漏 9.91169360541
+怨声 11.8212361103
+浸泡 8.78868986362
+奴颜 12.5143832909
+译审 12.8020653633
+断绝 8.43261751084
+颇具匠心 12.2912397395
+招之即来 11.8212361103
+出击 8.01735526349
+幼狮 12.5143832909
+客都 12.8020653633
+发源地 8.39941944143
+大有可为 11.1280889297
+水上飞行 13.900677652
+资产额 10.2371160058
+肘关节 11.0103058941
+商品住宅 8.96620371885
+膺选 13.900677652
+译官 13.2075304714
+普芬多 12.2912397395
+孔明知 12.8020653633
+第三十一条 13.2075304714
+商品棉 12.2912397395
+杨锤 13.2075304714
+弹回 13.900677652
+群策 13.2075304714
+卖主 10.9049453784
+军舰鸟 11.3357282945
+广百 9.96885201925
+陈奇瑜 12.5143832909
+事不过三 11.7034530746
+被检者 11.9547675029
+浸没 11.1280889297
+缙绅 9.19114745066
+红崖山 12.5143832909
+输电 9.08039608637
+刺秦王 11.7034530746
+费格尔 12.8020653633
+商情报 13.900677652
+卖乖 10.533381822
+殊勋 11.7034530746
+不出所料 10.1164880181
+号淘大哭 13.900677652
+幼犬 11.598092559
+非法行为 10.765183436
+果然 6.06036466866
+龙火 10.1164880181
+浸沉 11.9547675029
+奉访 13.2075304714
+卖书 11.7034530746
+一栋栋 12.8020653633
+卢大夫 9.15574552361
+山国 11.598092559
+茂物 10.604840786
+北魏官 12.5143832909
+林间 9.6811699468
+喜欢 5.70258840302
+出军 10.642581114
+父母双全 12.8020653633
+杨令公 12.5143832909
+抵抗性 12.8020653633
+饮既 13.900677652
+记者节 13.900677652
+辩方 12.8020653633
+河北杨 13.2075304714
+溜开 13.900677652
+乌鲁班 13.2075304714
+后备军官 13.900677652
+怨女 11.9547675029
+深圳晚报 13.900677652
+打怪 11.9547675029
+好助手 12.8020653633
+林姐儿 13.900677652
+嘉里 10.4041700905
+德业 12.5143832909
+美专 13.900677652
+浸浴 11.9547675029
+热空气 11.0103058941
+山地 6.41014824992
+性急的人 12.2912397395
+杨锋 12.8020653633
+山场 10.2630914922
+孔明登 13.2075304714
+八九级 13.900677652
+一千户 12.8020653633
+发起国 12.2912397395
+记性 9.38981814546
+罗马不是 13.2075304714
+人员培训 10.6818018271
+秦司令 12.8020653633
+自费生 13.900677652
+滥杀无辜 10.8096351986
+裸体像 13.900677652
+山坑 13.2075304714
+未免太不 12.8020653633
+浦江镇 12.1089181827
+有情可原 12.2912397395
+烷基化 10.8561552143
+色痣 13.2075304714
+克伯克 12.8020653633
+山坞 11.8212361103
+举不胜举 11.5027823792
+怨天 12.5143832909
+锁相 12.8020653633
+马布里 11.7034530746
+饰有 10.8561552143
+马丘比丘 11.9547675029
+最优化 9.84023464143
+灾变论 11.598092559
+宁王友 12.5143832909
+山坳 9.87532596124
+三氯氢硅 12.8020653633
+施瓦尔 13.2075304714
+武装头脑 13.2075304714
+凹凸棒 11.7034530746
+长途客车 11.1280889297
+登山临水 13.900677652
+西迤逦 13.900677652
+敞篷 11.4157710022
+山坡 7.24781462262
+防御反应 12.5143832909
+出借 11.1926274509
+扩大范围 12.2912397395
+贾琏先 12.8020653633
+记恨 10.4994802703
+记恩 13.2075304714
+浸洗 12.2912397395
+浸淫 10.765183436
+李给谏 13.2075304714
+董万才 13.2075304714
+玉蝶 13.900677652
+任御史 12.2912397395
+男式大衣 13.2075304714
+时乐钟 13.900677652
+学生族 13.900677652
+伊顿公 11.1926274509
+自找 10.4994802703
+赤忱 13.900677652
+动乱不安 13.2075304714
+英日同盟 12.1089181827
+早晚都会 12.8020653633
+正在 4.65680579679
+杨志刚 13.900677652
+百世 11.4157710022
+巴斯蒂 13.900677652
+沂蒙 12.1089181827
+亲嘴 10.4994802703
+美洲 7.27661242418
+玛西特 13.900677652
+林钢 13.900677652
+嘉酿 13.900677652
+十五号 12.8020653633
+摩步旅 11.1280889297
+参佐 13.2075304714
+膜电位 12.1089181827
+万佛峡 11.598092559
+打成一片 11.0103058941
+闻风而来 12.5143832909
+服药者 12.5143832909
+笑闹 11.1926274509
+涝害 12.5143832909
+沃特斯 13.2075304714
+山鼠 12.8020653633
+统计地图 12.5143832909
+城乡经济 11.598092559
+不法之徒 11.598092559
+符水 11.3357282945
+美国能源部 10.533381822
+必死无疑 10.4994802703
+非比 10.4041700905
+剥茧 12.1089181827
+越拉越 11.3357282945
+何伟 10.8561552143
+今夕何夕 11.9547675029
+结缘 10.6818018271
+打惯 12.8020653633
+于库伦 12.5143832909
+苏尔达 12.5143832909
+浸液 12.5143832909
+血缘 8.87023973058
+有理式 12.2912397395
+巫统 13.2075304714
+乌朱穆 13.2075304714
+山城 9.48183704418
+薄葬 11.7034530746
+学期结束 12.5143832909
+汪罔 13.2075304714
+汪罕 13.2075304714
+林铭 13.2075304714
+中国文联 11.0103058941
+西王母 10.533381822
+伤停补时 13.900677652
+三色旗 12.5143832909
+战团 11.4157710022
+中英街 13.900677652
+名不副实 10.765183436
+输球 11.4157710022
+熟巧 13.900677652
+左辅右弼 12.2912397395
+宋素卿 13.2075304714
+怨妇 12.5143832909
+塞尼山 13.900677652
+二十二万 11.8212361103
+出彩 10.5684731418
+笑称 11.4157710022
+追根求源 13.900677652
+浓墨重彩 11.3357282945
+颜卫曰 13.2075304714
+王摩诃 13.2075304714
+山堂 11.0103058941
+综合信息 11.5027823792
+嘉黎 12.5143832909
+竞赛活动 10.533381822
+五千零四十八斤 13.900677652
+天下乌鸦一般黑 12.1089181827
+亿兰特 12.8020653633
+添购 12.2912397395
+争利益 13.900677652
+陪同 8.3285236198
+非用不可 13.2075304714
+牵头 8.53003962385
+符号学 12.2912397395
+比亚韦斯托克 12.2912397395
+龙纹 10.4666904475
+骑着 8.64318227995
+晁冲 13.2075304714
+杰纳布河 12.5143832909
+张顺摸 13.900677652
+银安殿 11.8212361103
+薄记 13.2075304714
+一呼百诺 12.1089181827
+殊属 13.900677652
+黑森林 12.2912397395
+火印 13.2075304714
+庄客来 12.5143832909
+山塘 10.642581114
+应选 10.4349417492
+出海捕鱼 13.900677652
+球半径 13.2075304714
+顶一顶 12.8020653633
+抹子 13.900677652
+农林水利 13.2075304714
+夏原吉 11.2616203224
+刑罚学 13.900677652
+情报网 12.5143832909
+依禅 12.2912397395
+方胜球 13.900677652
+不致 8.24818847171
+更慢 11.1280889297
+升国旗 11.8212361103
+安邺 12.8020653633
+阿利耶夫 13.900677652
+公司 3.50346994358
+弱势群体 9.80633308975
+摇动 8.94485059437
+狴犴 11.7034530746
+星期 7.69410172525
+跳羚 12.8020653633
+获知 9.46986085313
+半晌回 13.900677652
+西军旧 12.1089181827
+山墙 9.89334446674
+非婚生子 11.0103058941
+夏侯成 11.9547675029
+宝时捷 13.900677652
+积极情绪 13.2075304714
+亲多 13.900677652
+朱漆 9.43476953332
+酬神 11.9547675029
+可信性 13.900677652
+墨彩 12.5143832909
+千古不变 13.900677652
+星月 9.72629038208
+弹壳 9.94943393339
+自打 9.31571017331
+当阳市 11.598092559
+珲春县 12.8020653633
+露天电影 13.900677652
+亮底 13.900677652
+适用技术 12.5143832909
+曼蒂 13.2075304714
+碗豆 13.900677652
+麻织业 12.5143832909
+亲夫 12.2912397395
+山壑 13.2075304714
+豪华气派 12.8020653633
+山高路远 13.2075304714
+福格特 13.2075304714
+里查德 13.900677652
+合葬墓 10.3743171274
+元永初 13.2075304714
+现露 13.900677652
+山壁 9.72629038208
+诸家之 11.8212361103
+沥青路 12.1089181827
+封为城 13.2075304714
+车前灯 13.900677652
+哥伦比亚特区 11.598092559
+十度 13.900677652
+和平溪 13.2075304714
+动人心弦 11.8212361103
+特勒姆 12.8020653633
+征管法 13.2075304714
+群生 11.4157710022
+叶云杉 12.5143832909
+玉佛寺 12.8020653633
+出得 9.06439574502
+梯河 13.900677652
+竺敬 12.2912397395
+会诊 9.98865464655
+兰尼姆 13.2075304714
+永远都是 10.4041700905
+丑闻 9.21854642485
+会话 11.1926274509
+刘进忠 11.9547675029
+爬梳 13.2075304714
+会试 9.41204128224
+兰特 10.765183436
+汲冢所 13.2075304714
+山头 8.12302532875
+弹奏 9.63799777493
+果绿 13.2075304714
+偷越 11.5027823792
+八九点 12.2912397395
+打渔 11.1926274509
+繁弦急管 13.900677652
+郑国渠 10.8096351986
+一百一十八篇 13.2075304714
+公厘 11.1280889297
+山大 11.598092559
+第四块 11.4157710022
+化学迁移 13.2075304714
+译名 10.2897597393
+在场者 12.8020653633
+出席 7.06334483729
+几百公斤 13.900677652
+马诺诺 13.900677652
+打湿 9.77354326693
+更愿 12.5143832909
+人无完人 12.5143832909
+出带 12.5143832909
+鼠雀之辈 13.900677652
+国际舆论 10.6818018271
+弹夹 10.4994802703
+改变命运 11.598092559
+那批 9.93038573842
+氯化铜 13.2075304714
+败家子 9.89334446674
+暗示性 12.1089181827
+拉拉杂杂 13.2075304714
+甘氨酸 11.598092559
+弹头 8.70218062071
+张定国 10.1394775363
+会议 4.95027449214
+于长江 9.6811699468
+出师 8.60737282725
+五十一万 12.2912397395
+那才 9.05649056552
+译员 10.8561552143
+楚长顺 11.598092559
+席卷八荒 13.900677652
+会计 8.08654712015
+院墙 9.03314320152
+大白天 9.85762638414
+不世之功 11.1926274509
+布吕默尔 13.2075304714
+偷跑 11.0103058941
+漩流 13.2075304714
+空仓 9.21854642485
+出帐 10.8561552143
+星星 8.30596627237
+玉汝于成 13.900677652
+戴假发 13.900677652
+绵绵细雨 13.900677652
+周介生 11.8212361103
+德耀哥 13.2075304714
+热风 10.2630914922
+百密一疏 12.1089181827
+品管部 13.900677652
+薄言 13.2075304714
+性格内向 12.1089181827
+好几回 11.1926274509
+白头到老 12.5143832909
+西缓东 13.2075304714
+说不下去 9.48183704418
+漩涡 9.23723855786
+船板 10.4041700905
+宏兴 11.0674643079
+赶下来 13.2075304714
+家老 12.1089181827
+毒药 8.83808261895
+虽近 12.5143832909
+山妻 11.7034530746
+聚甲醛 11.7034530746
+获益 9.12999302751
+冯朗 13.900677652
+六七点 12.5143832909
+问题重重 12.1089181827
+浸提 13.900677652
+夸尔 13.2075304714
+曾国藩 9.15574552361
+出庭 10.0505300503
+南堡 12.1089181827
+服务器端 13.2075304714
+葛朗台 11.2616203224
+出度 13.900677652
+康巴青 13.2075304714
+瓮声瓮气 10.5684731418
+普通型 10.7226238216
+楚成王 11.7034530746
+千分尺 11.9547675029
+闽南语 12.8020653633
+唐六如 13.2075304714
+山姆 11.598092559
+八百多 12.1089181827
+辩正 13.2075304714
+李金羽 13.900677652
+高奇峰 11.598092559
+打滚 9.84023464143
+那拉 13.900677652
+和鸿林 13.2075304714
+齐相国 13.2075304714
+跳绳 11.0674643079
+打滑 10.2630914922
+氯化铵 10.4349417492
+墨师 11.4157710022
+六氟化硫 11.5027823792
+离子浮选 13.900677652
+出库 11.0674643079
+杂交瘤 12.1089181827
+逝世 7.8093677699
+天文历算 11.1926274509
+星斗 10.1394775363
+电子层 11.3357282945
+耶律国珍 12.8020653633
+元明善 12.5143832909
+纳石矢 13.900677652
+塔察儿 11.598092559
+体会 7.8093677699
+落实政策 10.604840786
+亲家 9.17328983326
+猝然 10.1630080337
+打洞 11.0103058941
+古曲 11.8212361103
+何人 8.28027678626
+福建省委 10.9562386728
+杜少陵 12.8020653633
+端子 12.2912397395
+织袜机 12.8020653633
+摆置 11.4157710022
+拼过来 13.900677652
+药量 11.1926274509
+明秀 12.5143832909
+孔明笑 10.1630080337
+四十二件 13.2075304714
+云然 12.5143832909
+老皇历 11.5027823792
+节拍器 12.5143832909
+于海生 13.2075304714
+判别函数 13.2075304714
+德智体 11.8212361103
+星族 11.1280889297
+磁光效应 11.7034530746
+贺敏 11.8212361103
+伞盖 10.2117981979
+飞低 13.900677652
+补上去 13.2075304714
+大盒 13.2075304714
+赏光 10.8561552143
+沙德韦 12.5143832909
+四百多万两 13.2075304714
+欧盟 7.21982297319
+大盐 11.1926274509
+吉雅德 13.2075304714
+氯化铯 12.8020653633
+谢枋得 12.2912397395
+无处可去 10.3171587135
+溪州 13.900677652
+羊圈 12.1089181827
+打浆 13.2075304714
+粘上去 13.900677652
+舍此 11.1280889297
+出差 8.7245279194
+材料 5.7268201972
+方金星 13.2075304714
+老尼 11.0103058941
+越南人民军 12.8020653633
+岳王庙 11.1926274509
+夸张 8.10461990121
+跟屁虫 12.8020653633
+出巡 9.94943393339
+积善成德 13.2075304714
+白睛 12.5143832909
+牛金引 13.2075304714
+凶相 11.1280889297
+王丽萍 11.9547675029
+杨安儿 13.900677652
+二十六艘 12.8020653633
+玉檀正 12.5143832909
+微冷 12.5143832909
+蘸上 11.8212361103
+明辰敬 13.2075304714
+云燕 13.900677652
+嘉鱼 11.4157710022
+巴桑 13.900677652
+铺垫 9.22784881751
+刘伯坚 12.2912397395
+具体任务 11.4157710022
+绿洲耕作 13.2075304714
+打消 8.56313957227
+杨志强 12.8020653633
+四十二万 12.8020653633
+史黄桂 13.2075304714
+丑陋 8.78268383956
+东阿县 11.7034530746
+交易市场 7.82074445688
+亲子 10.2630914922
+温良恭俭让 11.2616203224
+宏利 10.2371160058
+打混 12.2912397395
+张子善 12.8020653633
+余光 10.4666904475
+雌激素 9.41204128224
+药酒 10.4349417492
+拍来拍去 12.8020653633
+拉斯曼 11.598092559
+大平正芳 12.8020653633
+国库 8.48457724977
+威尼托 12.8020653633
+几毫克 12.8020653633
+剥壳 12.8020653633
+机谋 10.765183436
+奥里诺科 11.5027823792
+骨鲠在喉 13.2075304714
+应纳税额 11.9547675029
+第三十一次 13.900677652
+杨问 10.604840786
+括发 13.900677652
+桑德兰 13.2075304714
+星散 10.6818018271
+沃特森 13.900677652
+果糖 10.0720362555
+秦震连 13.900677652
+结为义 12.8020653633
+功到自然成 12.8020653633
+会规 11.9547675029
+厅局 11.9547675029
+打水 9.62401153296
+飞上 10.1871055853
+飞下 10.9562386728
+周洪涛 11.2616203224
+雪日 12.5143832909
+陪酒女 13.900677652
+出山 8.39534611604
+九一八事变 9.35738286971
+韵律感 12.1089181827
+劳克林 12.8020653633
+薄被 11.5027823792
+躺进去 13.900677652
+补习教育 12.8020653633
+欣欣然 12.2912397395
+出局 8.78268383956
+打气 10.533381822
+卖出去 9.20019728618
+改变方向 10.765183436
+九评 13.900677652
+弹子 10.9562386728
+行必果 11.598092559
+弹孔 12.1089181827
+放任自流 11.2616203224
+电热法 13.900677652
+山子 11.2616203224
+尤奥洛 12.5143832909
+何事 8.10766404359
+杂多 13.900677652
+海滨公园 11.5027823792
+牲口 8.23771717184
+波利那 13.900677652
+胡乔木 11.598092559
+皮埃罗 13.2075304714
+三曹对案 12.8020653633
+混血儿 10.8561552143
+工商部门 9.45802639549
+流传开来 11.0103058941
+和娜杰 13.2075304714
+崇洋 12.8020653633
+光辉灿烂 10.765183436
+果粉 13.900677652
+偷过 10.8096351986
+胎盘球蛋白 12.8020653633
+代刘恺 13.900677652
+披头士 12.1089181827
+缪斌 13.900677652
+陆贻吉 12.2912397395
+药都 10.533381822
+出尘 11.8212361103
+偷运 11.1280889297
+林顿 11.0674643079
+方寸已乱 12.2912397395
+出尖 13.900677652
+败家女 13.900677652
+东昏侯 12.2912397395
+进人关 12.5143832909
+斯蒂芬 10.3743171274
+金帛相 12.8020653633
+曹化淳 9.14708746087
+飞云 10.2897597393
+孔明竟 13.2075304714
+蛰居 11.2616203224
+亲娘 10.1630080337
+对内政策 11.4157710022
+田万有 11.5027823792
+弧光灯 12.8020653633
+平面性 12.8020653633
+由上而下 11.7034530746
+首犯 11.1280889297
+卫京师 13.2075304714
+孔明立 12.8020653633
+风气之先 11.1280889297
+打转转 11.3357282945
+飞人 11.2616203224
+波塔陶 13.2075304714
+天长 10.604840786
+花草树木 11.5027823792
+妄自菲薄 12.2912397395
+储藏量 10.9049453784
+澶渊 10.3453295905
+旋转式 10.4994802703
+国家电网 9.66657114738
+落入 7.92686804011
+刘备东 13.2075304714
+钢混 13.900677652
+宏博 13.900677652
+匹夫有责 11.1280889297
+首映会 13.900677652
+折下 11.9547675029
+偷车 12.2912397395
+国家计委 11.1280889297
+记法 11.1926274509
+岳池县 13.2075304714
+不能转让 13.2075304714
+武帝言 13.2075304714
+烤乾 13.900677652
+赵恒时 12.5143832909
+放在眼里 8.83808261895
+敞着 10.533381822
+林飞 10.2897597393
+打泡 13.900677652
+打关节 12.2912397395
+铭牌 11.8212361103
+二万三万 13.900677652
+色拉寺 11.1926274509
+刘备之 11.8212361103
+阆中县 13.900677652
+自私自利 10.5684731418
+诞生记 13.2075304714
+山寻 13.2075304714
+家庭理财 10.9562386728
+薄衣 11.9547675029
+打法 9.41204128224
+摆线 11.4157710022
+感染力 9.40086798165
+朱员外 12.8020653633
+出岔 12.5143832909
+山寨 7.50374799676
+天高地迥 13.900677652
+开拓型 13.900677652
+那末 7.07088391446
+卧薪尝胆 10.3453295905
+那木 12.5143832909
+对立性 13.900677652
+向大顺 11.9547675029
+衷肠 10.642581114
+偷袭 9.12155415886
+防火线 13.2075304714
+颈背 11.598092559
+自愿 7.85804481829
+虎虎生气 13.900677652
+龙窑 12.8020653633
+和君臣 12.5143832909
+构造性 11.5027823792
+康拉德 10.5684731418
+那有 9.59661255877
+鹿肾 13.900677652
+昏昏默默 12.5143832909
+摘去 11.0103058941
+尔虞我诈 10.6818018271
+冲出亚洲 12.8020653633
+缪拉 12.8020653633
+羟化 12.5143832909
+弊窦 12.5143832909
+出字 11.9547675029
+民主权利 9.96885201925
+行政处分 10.8096351986
+打死 7.37271973435
+洛必达 12.1089181827
+卡马圭 12.8020653633
+溴氰菊酯 12.2912397395
+商品房 7.69007757495
+六口之家 13.900677652
+贝宁共和国 13.2075304714
+那条 7.35245854921
+水产资源 9.25628675283
+墨家 10.2371160058
+碳化 10.0940151622
+那来 11.0103058941
+疗效 8.04274449749
+打歪 13.2075304714
+计划生育 8.76487921493
+山居 11.598092559
+墨客 12.5143832909
+推让 10.0940151622
+男人 5.93965618609
+内核模块 12.8020653633
+山山 12.2912397395
+三爷 10.7226238216
+脏心烂肺 13.900677652
+墨宝 10.6818018271
+狼狈万状 13.900677652
+弹射 9.89334446674
+操作控制 12.5143832909
+墨守 11.2616203224
+弊端 8.53470163695
+冲开水 12.8020653633
+地震台 12.8020653633
+灵活化 12.8020653633
+电热毯 11.2616203224
+都平阳 12.2912397395
+应试者 11.1280889297
+布罗德赫斯特 13.900677652
+名称 6.4202493459
+革命政权 10.1871055853
+云石 11.1926274509
+吸入性 11.598092559
+急处从宽 13.900677652
+山岗 10.1871055853
+山岛 11.7034530746
+山岚 12.5143832909
+夸大 8.5440913773
+五十多位 13.2075304714
+汪琬 11.4157710022
+门镜 13.2075304714
+夸夸 12.8020653633
+禄未详 13.2075304714
+周瘦鹃 13.900677652
+禁售 10.765183436
+林龙 12.1089181827
+张广宁 11.9547675029
+糜国币 13.900677652
+公制 11.7034530746
+山岳 10.0505300503
+自愧 11.3357282945
+四十八个 12.2912397395
+空个 13.2075304714
+尽在 13.900677652
+译写 11.2616203224
+为虎添翼 13.900677652
+墨子 9.69598503258
+敢说话 11.4157710022
+徐师傅 11.8212361103
+十面体 11.8212361103
+省级机关 13.900677652
+那枝 11.8212361103
+大名府 9.77354326693
+山岩 9.5062284973
+酝酿着 10.4041700905
+山岭 8.15128466607
+女篮 11.8212361103
+血球 12.1089181827
+中国书店 12.1089181827
+牧草地 13.2075304714
+海内鼎沸 12.8020653633
+纽约银行 11.8212361103
+喜感 13.900677652
+搁下 9.77354326693
+译出 9.69598503258
+海滨 8.13235665618
+夸她 11.5027823792
+顺其自然 11.0674643079
+普鲁斯特 11.7034530746
+喜意 13.900677652
+出家 8.25877058104
+禹州市 10.7226238216
+山峰 7.90422556336
+李毅中 9.46986085313
+色盲 10.8096351986
+男丁 11.0103058941
+刘得福 13.900677652
+冯世伦 11.9547675029
+沙特 9.09665660724
+药面 11.5027823792
+打比 13.900677652
+山峡 11.598092559
+小偷儿 13.2075304714
+差价率 13.900677652
+羊倌 13.2075304714
+山峦 9.19114745066
+侍章京 13.2075304714
+夸奖 8.9308643524
+龙穴 11.4157710022
+实实在在 8.40761620864
+候选者 11.5027823792
+优势互补 9.80633308975
+血症 9.12155415886
+山崖 9.22784881751
+二关 12.8020653633
+余党 10.3743171274
+南宁德 12.8020653633
+打横 11.0103058941
+地面沉降 11.4157710022
+血痕 10.2630914922
+皮合生 11.9547675029
+破坏性 9.33632946051
+山崎 11.7034530746
+老脾气 12.2912397395
+输给 9.77354326693
+胡林翼 10.8096351986
+兜风 11.7034530746
+称快 11.7034530746
+山东半岛 8.98069672615
+何为 9.13850371718
+令人尊敬 12.1089181827
+崇武 11.598092559
+弗罗姆 11.9547675029
+五十多件 13.2075304714
+刘广凯 13.2075304714
+山崩 9.80633308975
+自愈 10.1871055853
+星报 11.5027823792
+拦路 9.62401153296
+流水落花 13.2075304714
+九千岁 11.9547675029
+苍生之 11.9547675029
+输纸 13.2075304714
+声全息 12.8020653633
+林志玲 10.8561552143
+梗住 13.2075304714
+助阵 10.3171587135
+细胞融合 11.2616203224
+西长安 12.1089181827
+常见疾病 11.598092559
+凶焰 12.1089181827
+随风倒 13.900677652
+汕头经济特区 12.8020653633
+添补 11.598092559
+略有出入 12.2912397395
+邱巡抚 13.2075304714
+车把 10.5684731418
+古晋 11.9547675029
+跳空 7.58531965045
+景宗时 11.8212361103
+业务学习 12.8020653633
+卫生统计 13.900677652
+空下 11.8212361103
+进餐时间 13.900677652
+喜悦 8.0746775446
+那晚 10.0720362555
+红崖子 12.8020653633
+朝闻道夕 12.8020653633
+果穗 11.3357282945
+集合竞价 9.53122979951
+强县 11.9547675029
+古利克 12.8020653633
+致歉 10.8561552143
+跳窗 12.5143832909
+青葱葱 13.2075304714
+龙笛 12.8020653633
+心路历程 11.9547675029
+大半个 9.33632946051
+唯肖 13.900677652
+前进波 13.2075304714
+吴长贵 12.2912397395
+情报检索 11.7034530746
+孕早期 11.5027823792
+教科文组织 12.5143832909
+埃德蒙 11.3357282945
+平黄经 13.2075304714
+老冯 10.2630914922
+愚迷不悟 13.900677652
+会车 11.7034530746
+出嫁 8.46259834305
+贾易 12.8020653633
+市里 8.14493543839
+李岩叹 12.8020653633
+蔡河中 13.2075304714
+浸染 11.0103058941
+李元霸 13.900677652
+翠亨村 11.598092559
+间不容发 10.8096351986
+喜怒 10.4994802703
+有所准备 10.604840786
+亲属 8.21370229564
+幼禽 12.8020653633
+山川 8.23425096386
+控制率 12.5143832909
+庆父不死 13.2075304714
+男伴 12.2912397395
+山巅 9.6811699468
+那曲 10.642581114
+战六捷 13.2075304714
+铝壶 12.2912397395
+林默 13.900677652
+第十八次 11.8212361103
+浣熊 11.3357282945
+潜在性 13.2075304714
+劈波斩浪 12.1089181827
+有了钱 10.4041700905
+北京市政协 12.5143832909
+五十多个 11.598092559
+富贵 7.88452049228
+喜性 13.2075304714
+凝汽式 12.5143832909
+卢楚 12.8020653633
+兽亚纲 12.5143832909
+第一军医大学 13.900677652
+抗拉力 13.2075304714
+起名 11.2616203224
+品流 13.900677652
+那支 8.97342396682
+牵引 7.84858848305
+凤鸣歧 12.1089181827
+罗耶定 10.1871055853
+风势 10.5684731418
+广纳 11.7034530746
+匡谬 13.2075304714
+起吊 10.1164880181
+出好 11.1926274509
+上海市公安局 11.8212361103
+文雅地 12.2912397395
+亲往 9.96885201925
+亲征 8.88339781516
+渗得 13.2075304714
+渗析 11.8212361103
+野山羊 12.1089181827
+山师 13.2075304714
+出奶 13.900677652
+牵开 13.2075304714
+成批处理 13.900677652
+久居人下 12.2912397395
+忆念 11.9547675029
+分三步 11.9547675029
+出奇 8.53470163695
+三尸神 12.2912397395
+增强体质 10.1630080337
+书面通知 11.3357282945
+里子 10.604840786
+牵张 12.1089181827
+华银 12.5143832909
+冯紫英 10.9562386728
+跳神 10.0720362555
+汪直 11.5027823792
+若祚宗 13.2075304714
+弹带 12.2912397395
+广告代理 13.900677652
+五脊六兽 13.2075304714
+出头 8.46259834305
+那禅师 12.8020653633
+广绣 12.5143832909
+商品性 10.5684731418
+上阿松 13.2075304714
+二三次 13.900677652
+喜出望外 9.07236391467
+马三婆 9.80633308975
+没见识 12.8020653633
+肉儿 12.8020653633
+模板聚合 13.900677652
+出处 9.34680076038
+宣帝时 10.9049453784
+出备 12.5143832909
+广结 11.7034530746
+玉厚问 13.2075304714
+骨组织 10.9049453784
+跳票 13.900677652
+两层楼 10.8561552143
+符文 12.8020653633
+出外 9.01032852375
+审讯官 13.2075304714
+摄制成 10.8561552143
+好人难做 13.900677652
+凶狠 9.36807815882
+裸体女 13.2075304714
+一定量 8.37522471284
+掌军国 12.5143832909
+终其一生 11.4157710022
+黄健翔 13.900677652
+添设 10.8096351986
+血癌 11.9547675029
+和爱云 11.5027823792
+妙龄女郎 13.900677652
+侯国如 13.2075304714
+乱琼碎玉 13.900677652
+幼童 10.765183436
+山庄 9.45802639549
+党组织 8.66423568915
+八十三岁 12.8020653633
+跳离 11.7034530746
+侥幸取胜 11.9547675029
+凶狂 12.5143832909
+茶话会 11.7034530746
+凹凸感 13.2075304714
+肩负 9.85762638414
+肩贞 13.900677652
+看穿 10.0088573539
+牙髓坏死 13.900677652
+切面 10.5684731418
+解表药 11.8212361103
+攒射 11.7034530746
+贬低 9.96885201925
+食心虫 11.598092559
+衾寒枕冷 13.900677652
+远亲不如近邻 11.9547675029
+于艺婉 13.900677652
+特许证 12.5143832909
+左右眼 13.900677652
+血瘀 10.2630914922
+提取液 12.2912397395
+会谈 8.36334338496
+吴历合 13.2075304714
+睢阳区 11.9547675029
+六十出头 11.9547675029
+寻音 13.2075304714
+那日 8.80081122415
+会调 12.5143832909
+氧量 11.7034530746
+麦立克 13.900677652
+桑宁翁 13.2075304714
+多巴胺 11.1926274509
+膜式 13.2075304714
+上海通用 9.14708746087
+那时 6.15654102435
+服务质量 9.59661255877
+和娜拉 11.3357282945
+省部级 11.0103058941
+马三嫂 11.7034530746
+家蝇 11.7034530746
+牵念 12.8020653633
+申戎 12.8020653633
+山建 13.2075304714
+羊城 11.1280889297
+赵恒惕 11.5027823792
+尤莉娅 13.900677652
+古典学派 11.3357282945
+信德省 11.7034530746
+联合疫苗 13.900677652
+弹库 13.900677652
+雨情 13.900677652
+欧版 12.2912397395
+萨沃纳 13.900677652
+秦癫 10.0720362555
+索垂 13.900677652
+译制 11.9547675029
+乔伊纳 12.1089181827
+客饭 13.2075304714
+打样 12.8020653633
+越南化 12.5143832909
+牛背梁 12.8020653633
+银微晶 13.2075304714
+两三百 10.3453295905
+秦仲子 13.900677652
+六环路 13.900677652
+宏基 11.9547675029
+街头巷尾 10.604840786
+半句话 10.1164880181
+姨儿 13.2075304714
+姊夫 12.8020653633
+于明洪武 12.2912397395
+阜新市 10.765183436
+圆光 11.1280889297
+放线 11.8212361103
+布腊瓦 12.2912397395
+熟视无睹 10.9049453784
+锇酸 13.900677652
+朝鲜外务省 12.2912397395
+出塞 10.1630080337
+家蚕 10.765183436
+奥尔巴尼 12.5143832909
+牵带 13.900677652
+各奔前程 11.8212361103
+龙种 11.1280889297
+输精 13.900677652
+饰演 9.96885201925
+果碟 13.2075304714
+黄渤海 11.5027823792
+厅堂 8.94485059437
+弹弹 11.7034530746
+打桩 11.0674643079
+未婚妻 9.93038573842
+源氏物语 11.0674643079
+惠我忠 13.900677652
+龙科 12.2912397395
+一年之计在于春 13.900677652
+连香树 10.1394775363
+金宇春 12.8020653633
+立嗣君 13.900677652
+喷丸 12.8020653633
+山影 10.533381822
+解惑答疑 13.900677652
+固为 12.5143832909
+古普塔 12.5143832909
+弹开 11.7034530746
+平步青云 11.5027823792
+喷上 11.9547675029
+卒业 12.5143832909
+展商 12.1089181827
+六七百 10.4666904475
+山形 10.2897597393
+药铺 9.82314020807
+几篓 13.900677652
+营养不良 8.80692745117
+易北河 10.3171587135
+焙茶 13.900677652
+层位 10.642581114
+塑料板 12.8020653633
+杂技场 13.2075304714
+活动量 11.2616203224
+酿制 10.5684731418
+有管腺 13.2075304714
+孙文台 13.900677652
+和诺尔 13.2075304714
+哄然大笑 11.2616203224
+箱笼 10.1164880181
+塑料杯 13.900677652
+山径 10.0294766411
+开记 13.900677652
+独担 13.2075304714
+蓝蓝的 12.1089181827
+拧折 13.900677652
+出声 8.26946587015
+十美图 13.900677652
+一叉 11.2616203224
+产权局 13.900677652
+两三盏 13.2075304714
+八笔 12.8020653633
+明里帖 13.2075304714
+尼扎姆 13.2075304714
+光屁股 11.0103058941
+北查科 12.5143832909
+适航 10.9562386728
+半年前 9.35738286971
+受得了 9.91169360541
+擒住 10.2897597393
+何义 13.900677652
+紧急通知 9.91169360541
+殊宠 13.900677652
+记者证 12.2912397395
+未婚夫 10.8561552143
+刘履丁 10.0940151622
+山志 12.8020653633
+齐解甲 13.900677652
+金凯瑞 13.2075304714
+九千年 12.5143832909
+忽东忽西 12.5143832909
+巫盐 10.9562386728
+新形态 12.8020653633
+龙神 11.1926274509
+佩滕科 13.2075304714
+龙票 13.900677652
+神经症 10.7226238216
+主卧室 13.900677652
+支气管镜 11.1926274509
+郑斌 11.598092559
+会账 13.900677652
+扑克牌 10.9049453784
+龙祥 13.2075304714
+出境 9.26594866375
+没指望 10.604840786
+会费 11.1926274509
+亲冒矢石 12.1089181827
+近些年来 10.0294766411
+温尼伯 11.9547675029
+梯段 12.8020653633
+满腹文章 13.900677652
+弹得 11.4157710022
+暂且不说 12.8020653633
+穆青 12.5143832909
+苦头 9.36807815882
+猎鹿人 13.2075304714
+徐光启 9.91169360541
+包装 7.50374799676
+赵紫阳 10.8096351986
+马军齐 13.2075304714
+弗拉门 12.2912397395
+牛国兴 11.2616203224
+耳风 12.8020653633
+洋兵 11.1280889297
+外沙 12.5143832909
+自诉人 11.9547675029
+古根海姆 12.1089181827
+信长 13.2075304714
+曲警芳 13.2075304714
+尼雅河 12.1089181827
+郑爷 12.5143832909
+风风 12.5143832909
+桓之曲 13.2075304714
+双簧管 10.9049453784
+生金蛋 13.900677652
+趋近 11.0674643079
+马士基 13.900677652
+七六九团 12.5143832909
+帕杰罗 13.2075304714
+萨穆埃尔 13.900677652
+手感 9.28555713513
+八卦楼 12.8020653633
+苦夏 12.5143832909
+赦过宥罪 13.900677652
+手慢 13.2075304714
+家务劳动 11.2616203224
+恩施 10.533381822
+包袋 12.8020653633
+古柏 9.98865464655
+怀恋 11.5027823792
+水石盆景 12.8020653633
+巴尔扎 13.900677652
+注册商标 10.7226238216
+投篮不中 13.900677652
+中央政府 7.88452049228
+春耕时节 13.2075304714
+钱文 10.9562386728
+伊塞尔 13.900677652
+衣甲 9.49395840471
+市委常委 9.11318590919
+本论坛 13.900677652
+败草 13.900677652
+包被 10.4041700905
+蔚摹 12.5143832909
+怀恩 11.598092559
+两三遍 11.8212361103
+怪侠 13.900677652
+服侍 7.96050639926
+落标 13.2075304714
+大无畏 10.8096351986
+鸳鸯楼 12.8020653633
+任马堡 12.5143832909
+字儿 8.71889410168
+火耗 12.2912397395
+最佳影片 9.18217878068
+包袱 7.84155445639
+那巧姐儿 12.8020653633
+反射系数 11.8212361103
+顺丁烯二酸 11.598092559
+短刀 9.91169360541
+疫情 8.08654712015
+替人着想 13.900677652
+黄土地 10.5684731418
+范希文 13.900677652
+一发 8.3555002075
+温江县 13.900677652
+烈风 11.2616203224
+由情志 12.8020653633
+王太医 11.4157710022
+卢旺达共和国 13.900677652
+失去理性 12.5143832909
+师杜晓 12.5143832909
+棉球 11.0674643079
+曹丕大 13.900677652
+饶艿 12.8020653633
+钱数 10.6818018271
+吉祥如意 11.3357282945
+干到底 11.598092559
+总装机 11.598092559
+常将 10.7226238216
+宇一郎 13.900677652
+严肃 7.26080181815
+建筑设施 11.598092559
+定都 8.94485059437
+前列 7.32281629425
+抬头不见低头见 12.1089181827
+林冲叹 13.2075304714
+一千九百八十门 13.900677652
+断了线 11.1280889297
+冰川学 11.4157710022
+戴维能 13.900677652
+杨峰 13.900677652
+千钧一发 9.85762638414
+第二宇宙 13.900677652
+烧茶 12.2912397395
+短剑 9.61021821083
+乘晕宁 12.8020653633
+空谷幽兰 12.8020653633
+秦晋之好 13.2075304714
+雅俗 11.5027823792
+常山 9.46986085313
+内黄县 11.598092559
+七阵 13.2075304714
+形象工程 11.7034530746
+短剧 11.1926274509
+天宝龙 12.2912397395
+雷巴奇 13.2075304714
+草灰 12.8020653633
+磁带 8.83808261895
+饶舌 10.533381822
+优秀干部 11.8212361103
+怀想 12.1089181827
+匀称 9.22784881751
+第四名 10.2117981979
+惊涛骇浪 10.1164880181
+合理收费 13.900677652
+龙泉县 13.900677652
+六四式 11.1280889297
+阿尔忒 13.900677652
+碧纱橱 12.8020653633
+观赏性 10.8096351986
+手性 10.7226238216
+魏名徵 13.2075304714
+卢鹤绂 13.2075304714
+吴组缃 12.5143832909
+安德里 11.9547675029
+承欢膝下 13.2075304714
+难辨 9.85762638414
+医疗险 11.5027823792
+龙泉剑 11.8212361103
+沾益 12.2912397395
+音名 12.5143832909
+钱操 13.900677652
+方能胜 13.2075304714
+影戏 11.1926274509
+亚拉 12.5143832909
+前厅 9.98865464655
+修改稿 11.9547675029
+公海 9.98865464655
+普雷萨 12.8020653633
+拔起来 12.1089181827
+丙二酸 11.8212361103
+雅丽 11.3357282945
+立法机构 9.63799777493
+雅丹 11.2616203224
+修饰 9.45802639549
+基尔肯尼 12.2912397395
+话到嘴边 10.4994802703
+中国佛教协会 11.5027823792
+头文字 13.900677652
+高脂血症 10.6818018271
+耐旱植物 12.8020653633
+义仓 11.1926274509
+包覆 11.1280889297
+元狩 9.5062284973
+驭手 13.2075304714
+初中 8.40761620864
+前叶 10.4041700905
+话锋一转 10.5684731418
+前台 9.35738286971
+前史 11.7034530746
+榆次市 11.8212361103
+铁尺 12.8020653633
+还让出 13.900677652
+创造财富 10.2630914922
+雅乐 10.2630914922
+哼哼唧唧 10.8561552143
+义仆 12.8020653633
+短句 12.1089181827
+难进 11.8212361103
+霹雳炮 13.900677652
+放手大干 12.5143832909
+前叉 12.5143832909
+第十六位 12.5143832909
+刘景升 11.1926274509
+短号 13.2075304714
+常州 8.50705010562
+常川 13.900677652
+下半场 9.84023464143
+周皮 11.3357282945
+傍晚 7.78699547214
+前叙 12.8020653633
+教练车 13.900677652
+无肩带 13.2075304714
+难过 7.52225146832
+王司马昱 12.8020653633
+闻燕昭 12.8020653633
+定量 8.03420959504
+商丘站 12.8020653633
+陈善闭邪 13.900677652
+雅事 12.5143832909
+各个领域 8.7245279194
+廖叔安 13.900677652
+黄原河 10.3743171274
+杜隆 12.5143832909
+八斗子 13.2075304714
+试想想 13.900677652
+定金 9.65218240993
+任国相 11.9547675029
+霹雳火 10.4994802703
+伊博语 12.8020653633
+罗布朗 12.5143832909
+有凤来仪 12.1089181827
+国泰君安 7.49710345404
+为辅 8.94485059437
+耳饰 11.9547675029
+海外奇谈 12.5143832909
+曹世雄 13.2075304714
+初九 10.1394775363
+苦境 11.9547675029
+官长 10.8096351986
+揭露 7.51886163457
+落槌 11.8212361103
+外江 11.3357282945
+指引方向 12.8020653633
+矮墩墩 12.8020653633
+马行迟 12.8020653633
+黑蛇 10.0720362555
+十张 12.1089181827
+山东大鼓 12.2912397395
+接线图 13.900677652
+前卫 9.53122979951
+阿旺晋美 12.8020653633
+递补 11.4157710022
+尖椒 11.9547675029
+给定 8.99540287354
+义乌 9.62401153296
+音响 8.5440913773
+网警 13.2075304714
+倒杯茶 13.900677652
+中国海 11.1280889297
+阳渠直 13.2075304714
+抗寒力 12.8020653633
+放空车 13.900677652
+深证 7.1356386752
+杨州 11.3357282945
+二十九卷 12.5143832909
+指环王 13.900677652
+在你看来 11.7034530746
+落榜 11.1280889297
+罗希 13.2075304714
+指称 10.3453295905
+超值价 12.8020653633
+前半 12.8020653633
+外专局 13.2075304714
+大真 13.900677652
+前南 12.2912397395
+啜泣 10.2117981979
+解数 10.3743171274
+橡胶鞋 13.900677652
+余兴 11.4157710022
+转差率 13.2075304714
+残废者 12.1089181827
+公司法 9.56994431169
+罗家镇 13.2075304714
+马服君 13.2075304714
+三四顷 13.2075304714
+安之若泰 13.900677652
+深识 13.2075304714
+怀戎 12.8020653633
+钱柜 11.5027823792
+映衬 10.2897597393
+范希朝 12.8020653633
+十六分 13.900677652
+行气 10.2371160058
+黑严 12.5143832909
+发芽率 11.4157710022
+先礼后兵 11.598092559
+忍过去 12.8020653633
+择吉 11.0674643079
+一万种 13.2075304714
+舅姑 11.9547675029
+王先谦 11.5027823792
+宋江亦 12.2912397395
+黑丑 12.8020653633
+晏明 13.900677652
+手持 8.26232298264
+手指 7.02029356979
+收入丰厚 13.2075304714
+衣着 8.83177344976
+吉普赛人 11.2616203224
+字卷 12.8020653633
+往事如烟 12.8020653633
+烈马 10.7226238216
+网袋 11.8212361103
+帮套 13.900677652
+杨帆 11.1926274509
+要地防空 11.5027823792
+风骨 10.3453295905
+压肩叠背 13.2075304714
+严良 12.5143832909
+涨起来 10.9049453784
+杨广 10.1871055853
+草狐 13.2075304714
+二十万件 13.2075304714
+总监制 13.900677652
+苦学 12.2912397395
+咏物诗 12.1089181827
+左文清 13.2075304714
+宋江令 11.598092559
+日夜兼程 10.9049453784
+起名叫 11.5027823792
+解典库 13.2075304714
+副组长 9.71102290995
+搭帮 11.5027823792
+径矢 12.5143832909
+埃格蒙特 12.2912397395
+放马过来 13.2075304714
+监督制度 12.1089181827
+风骚 10.4666904475
+肓门 13.900677652
+做好做歹 13.2075304714
+洋化 13.900677652
+圭角 13.900677652
+吞没 9.03314320152
+成赫梯 13.2075304714
+副歌 13.900677652
+龙州县 11.5027823792
+手控 11.598092559
+后废帝 11.9547675029
+鸣谢 13.900677652
+黑人 7.83922073305
+音型 11.5027823792
+颠倒众生 13.900677652
+常常 6.07184312439
+人有千算 13.900677652
+资深望重 13.2075304714
+白岳 13.2075304714
+进八强 13.900677652
+风驰 12.2912397395
+假冒伪劣 11.2616203224
+前倾 9.89334446674
+杨度 10.765183436
+黑亮 10.2371160058
+贾兰中 13.900677652
+字句 9.61021821083
+黑井 13.2075304714
+杨府 12.1089181827
+商贸业 11.4157710022
+木版画 11.9547675029
+吴克坚 12.8020653633
+陈慕华 12.2912397395
+和谈 9.23723855786
+手掌 8.30969067146
+字号 8.86372504956
+怀抱 8.33615724465
+和谐 7.283274674
+酌情处理 13.900677652
+苦守 11.3357282945
+风风火火 10.0294766411
+大程度 9.17328983326
+杨庆 11.7034530746
+舍利塔 10.9562386728
+杨庄 11.5027823792
+搭建 8.49350588052
+杨建 12.2912397395
+射阳县 12.2912397395
+手握 8.77671367257
+音域 9.53122979951
+防止出现 10.3171587135
+赌窟 13.2075304714
+探索者 12.2912397395
+凹形 11.3357282945
+缤纷多彩 13.900677652
+核电站 8.92394390956
+奖提名 12.2912397395
+良家女子 12.1089181827
+汉举 10.2630914922
+字原 12.2912397395
+常平 10.6818018271
+丢脸 9.69598503258
+常年 7.78258045393
+鼠李糖 11.9547675029
+苦寒 10.8561552143
+女中音 11.1280889297
+迈克尔 9.59661255877
+一点一滴 10.4666904475
+随风飘 10.4349417492
+手提 8.89004235788
+洪嘉 13.2075304714
+严苛 10.3453295905
+鹅蛋脸 11.7034530746
+厚黑学 12.5143832909
+外气 13.2075304714
+官阶 9.87532596124
+杜门 12.8020653633
+王春华 13.900677652
+大声嚷嚷 11.9547675029
+洪基 13.2075304714
+屈就 12.5143832909
+李多祚 12.2912397395
+待不住 12.2912397395
+手戳 13.900677652
+罄竭 13.900677652
+轻工产品 11.0103058941
+阿莫斯 13.900677652
+烫脚 11.9547675029
+桶狭间 13.900677652
+生存之道 11.2616203224
+常德 9.28555713513
+巴塞洛 13.2075304714
+财政部 6.85577253485
+益都 10.0940151622
+巧克力 9.24671730182
+宋江依 13.2075304714
+证券市场 7.12645376562
+败者 11.598092559
+清真教 11.9547675029
+直观教学 13.2075304714
+柞丝绸 12.1089181827
+以劣胜优 13.2075304714
+前军 9.19114745066
+机帆船 11.0103058941
+手执 8.64318227995
+沉吟 7.69208762588
+凤起路 11.9547675029
+克林格尔 12.5143832909
+落款 10.0940151622
+言刘备 12.8020653633
+常宁市 12.8020653633
+杨彪 11.9547675029
+信阳 8.60737282725
+手扶 9.63799777493
+十数里 11.0674643079
+杨彦 9.54396882529
+黑佬 11.7034530746
+贡赋入 13.2075304714
+公希预 13.2075304714
+汉军正 13.900677652
+黑体 10.0088573539
+无痕迹 13.2075304714
+阿巴拉 13.900677652
+砂纸 12.8020653633
+黑佛 11.0103058941
+接线员 10.4041700905
+雕塑 8.1902506346
+桌上 6.94222925868
+布兰迪斯 13.2075304714
+日益突出 10.0294766411
+易九世 11.7034530746
+益邦 12.8020653633
+赚钱事业 13.900677652
+污水排放 12.8020653633
+呆帐 13.900677652
+魏兵齐 13.2075304714
+无形无影 12.5143832909
+郑旭 13.900677652
+杨德 10.1394775363
+憋死 9.80633308975
+女店主 11.7034530746
+向黛玉 11.7034530746
+初二 9.5186510173
+行之不远 13.2075304714
+闸流管 12.1089181827
+那兔儿 13.900677652
+施药 11.1280889297
+转法轮 12.2912397395
+餐饮费 13.900677652
+尉迟孙立 11.8212361103
+经过努力 10.9562386728
+李赞画 12.5143832909
+客串演出 13.2075304714
+手抄 10.4041700905
+官面 11.7034530746
+手把 9.7898037878
+常开 11.5027823792
+摄影棚 11.7034530746
+不怎么 8.39534611604
+逢高卖出 11.9547675029
+杨征 11.7034530746
+枝叶茂盛 11.598092559
+氯丁橡胶 11.2616203224
+钱景 12.2912397395
+深加工 9.27570483869
+洋务 9.55687223012
+志学 11.8212361103
+耳鬓 12.5143832909
+马恒昌 13.900677652
+痴笑 13.900677652
+强制力 10.5684731418
+杨快 13.2075304714
+手拷 13.900677652
+攻关项目 11.3357282945
+友谊股份 11.4157710022
+杨忠 11.2616203224
+一九三五年 11.7034530746
+怀揣 10.3171587135
+难赚 12.5143832909
+前兆 9.89334446674
+信隆 12.2912397395
+前街后巷 13.900677652
+手拉 10.4041700905
+前先 10.5684731418
+无奈何 11.5027823792
+不孝子 12.5143832909
+五峰土家族自治县 12.1089181827
+撒娇撒痴 11.9547675029
+缔约方 9.58318953844
+看不过去 11.4157710022
+斯坦人 12.5143832909
+陈建生 13.900677652
+疲软 7.62591563073
+南侧 8.48903160012
+番茄红素 11.8212361103
+猪瘦肉 13.900677652
+十六位 13.900677652
+纹状体 11.5027823792
+共轭双键 11.7034530746
+受骗上当 11.8212361103
+开诚 12.8020653633
+有线广播 11.4157710022
+陈伯达 11.4157710022
+戴维营 10.9049453784
+洋商 11.0103058941
+初交 12.5143832909
+七大八小 13.2075304714
+华盛顿纪念碑 12.5143832909
+罗萨斯 11.8212361103
+雕弓 10.8096351986
+搓衣板 12.8020653633
+自蹈法网 13.900677652
+梁永强 9.96885201925
+实质问题 12.5143832909
+黄秉维 12.5143832909
+迷思 10.8561552143
+落水 9.46986085313
+前因 10.5684731418
+马上遥 12.2912397395
+高锰酸钾 10.0088573539
+贾珍笑 11.5027823792
+互通声气 11.5027823792
+展翅欲飞 11.8212361103
+霍温第 13.900677652
+杨静 11.7034530746
+先奸后杀 13.2075304714
+蔫巴巴 13.2075304714
+像胶 12.8020653633
+金国将军 12.5143832909
+彰明 12.2912397395
+突堤 11.8212361103
+一出戏 10.4994802703
+撵去 13.900677652
+阻遏 10.4994802703
+余万公顷 11.3357282945
+彰显 9.17328983326
+徐向前 10.533381822
+陆军营 12.8020653633
+王伯龙 12.8020653633
+五六十个 11.1926274509
+官邸 10.1394775363
+软膜 12.2912397395
+鸭绿江畔 12.5143832909
+破涕为笑 11.0103058941
+第六十三篇 13.2075304714
+泌阳县 11.5027823792
+希龙 13.900677652
+章孝慈 13.900677652
+神圣化 11.8212361103
+启新 11.5027823792
+勒兵 10.2371160058
+手斧 11.3357282945
+荡除 13.900677652
+根状 13.900677652
+低成本 8.96620371885
+凭栏 10.6818018271
+联产承包 10.9562386728
+诬告 9.66657114738
+起步 7.81390292506
+独享 10.3743171274
+行御史台 12.1089181827
+宋建隆 11.5027823792
+官道 9.40086798165
+递质 10.765183436
+诊断率 12.5143832909
+落泪 9.17328983326
+生物测定 11.9547675029
+戳穿 10.6818018271
+邹逸麟 10.4994802703
+李上善 12.2912397395
+毫微秒 13.900677652
+多佛尔港 13.900677652
+国有银行 8.67493097826
+信里 9.93038573842
+成实性 12.1089181827
+白用 12.8020653633
+馋猫 11.9547675029
+孙孝哲 13.2075304714
+火耕水耨 12.8020653633
+翁谈录 12.5143832909
+难言 9.0884932966
+停车灯 13.2075304714
+姬昌 12.8020653633
+口袋妖怪 13.900677652
+勒克 12.5143832909
+江山美人 12.5143832909
+紫绀型 12.8020653633
+五六十两 12.5143832909
+伊施波 13.900677652
+顺口答应 13.900677652
+一百二十多 11.598092559
+矿产区 12.8020653633
+毒丸 12.2912397395
+优秀奖 11.7034530746
+绿篱 11.3357282945
+补贴额 13.2075304714
+冰碴儿 12.2912397395
+杨士 12.8020653633
+去看房 12.1089181827
+狮子舞 12.1089181827
+若洪钟 13.2075304714
+苦工 11.2616203224
+儒艮 11.1280889297
+音准 13.900677652
+苦差 12.2912397395
+没来由 10.2117981979
+狮子般 13.900677652
+乐此不疲 10.3453295905
+齐云峰 12.2912397395
+炸裂 10.642581114
+岔道 10.9562386728
+大清国 9.5062284973
+年代久远 10.2897597393
+手旗 13.900677652
+迷惑 8.37522471284
+之愤 11.7034530746
+六百三十余首 13.2075304714
+包谷 9.55687223012
+定钱 13.2075304714
+迷惘 10.0294766411
+代课老师 12.8020653633
+是从 5.96867449961
+落海 13.2075304714
+骨头汤 11.2616203224
+塞萨尔 13.900677652
+难记 11.7034530746
+公共责任 11.3357282945
+孔令奇 13.900677652
+信达公司 12.2912397395
+影星 9.80633308975
+洋味 13.900677652
+钧天广乐 13.2075304714
+恩惠 9.91169360541
+严加防范 11.598092559
+砧骨 12.8020653633
+侦查人员 11.2616203224
+种泳湍 13.2075304714
+梁希 12.8020653633
+音值 11.9547675029
+荥阳县 12.1089181827
+低迷区 13.900677652
+信道 9.93038573842
+定长 12.2912397395
+杨夏 13.900677652
+波光潋滟 11.8212361103
+搭好 11.3357282945
+恩情 9.87532596124
+陇南 10.765183436
+冷酷无情 10.5684731418
+溺水者 11.9547675029
+角皮层 13.2075304714
+十六七 11.3357282945
+下江兵 12.8020653633
+十六万 13.2075304714
+第六十三章 13.2075304714
+余古帝 13.2075304714
+苍白无力 11.598092559
+河色钦 13.2075304714
+手摸 9.85762638414
+如之奈何 9.15574552361
+失信于民 12.5143832909
+章汉夫 12.8020653633
+廉二世 11.5027823792
+陈老总 12.8020653633
+十六个 10.1164880181
+手摇 9.85762638414
+数据资料 10.604840786
+返回式 12.8020653633
+东沿淮 13.2075304714
+十六两 11.5027823792
+前埔 13.2075304714
+赞美歌 13.2075304714
+杨奂 13.2075304714
+左上角 10.8561552143
+信通 12.5143832909
+杨奇 12.1089181827
+常委 8.15767446417
+科学分析 10.8096351986
+陈复礼 12.8020653633
+赵光怀 13.900677652
+冰川带 13.900677652
+美国专利局 13.2075304714
+钢锥 12.8020653633
+随之而起 12.1089181827
+新内饰 11.9547675029
+克鲁马 13.900677652
+常夸 12.8020653633
+偏着 11.5027823792
+初任 10.3171587135
+酷爱 9.56994431169
+包赔 12.8020653633
+黑森森 10.6818018271
+羚羊角 11.4157710022
+沉勇 12.2912397395
+前场 11.3357282945
+草甸 8.05423887692
+认证书 12.5143832909
+常夏 13.2075304714
+陇县 11.0674643079
+老豆腐 12.2912397395
+望梅止渴 11.3357282945
+滤清 11.7034530746
+常备 10.0505300503
+诉状 10.4041700905
+化隆西 13.2075304714
+爱祖国 12.2912397395
+对话录 12.5143832909
+十数处 13.2075304714
+曹丕封 12.8020653633
+天赐良机 11.598092559
+质检 9.14708746087
+包走 13.2075304714
+上海市浦东新区 11.598092559
+企事业 9.5062284973
+折征 11.7034530746
+晶莹剔透 10.642581114
+草畜 13.900677652
+绿竹 12.8020653633
+嘹亮 9.74179456862
+信邪 12.8020653633
+大学美术 12.8020653633
+元大仙 12.2912397395
+恩怨 9.77354326693
+热烘烘 9.93038573842
+吴楚七国之乱 10.7226238216
+张君秋 11.5027823792
+信邸 12.8020653633
+玉清元 12.8020653633
+六百米 12.8020653633
+电子显微镜 9.59661255877
+追踪调查 12.2912397395
+千秋业 13.2075304714
+暗潮汹涌 13.900677652
+凤丹霞 13.2075304714
+霎时间 9.69598503258
+陇右 9.48183704418
+怀旧 9.93038573842
+烧结砖 13.2075304714
+不足为怪 10.3453295905
+杨姐 11.9547675029
+圣迹 11.7034530746
+益阳 10.1394775363
+穷人的孩子早当家 12.8020653633
+赵虎 12.8020653633
+不分上下 11.9547675029
+拜房 13.900677652
+金秀来 12.8020653633
+挤挤挨挨 13.2075304714
+阴极保护 12.2912397395
+刺猬 9.34680076038
+映象 11.0674643079
+不堪救药 13.900677652
+功服 13.2075304714
+提下来 13.900677652
+手术 7.09274270828
+手札 11.5027823792
+手本 10.1394775363
+千奇百怪 10.4349417492
+白鹿飘 13.2075304714
+手机 6.17182182812
+联成一体 10.7226238216
+滤液 11.8212361103
+纤毫 11.598092559
+音区 11.7034530746
+交通法规 11.1926274509
+怀春 11.598092559
+人工降雨 11.5027823792
+陈宗善 12.5143832909
+芦席 10.8561552143
+金鞍玉 13.2075304714
+焦晃 13.900677652
+草皮 10.6818018271
+修鹰 13.2075304714
+定陵 10.6818018271
+定陶 10.1164880181
+杨威 11.8212361103
+沉入 8.87679713113
+死不带去 12.2912397395
+撇撇嘴 9.96885201925
+华荣 13.900677652
+恶癖 13.900677652
+口耳相传 11.2616203224
+苦役 9.69598503258
+夏廷 13.2075304714
+马行街 11.9547675029
+前哨 9.98865464655
+寻阳 11.9547675029
+性医学 12.8020653633
+尉王肃 12.8020653633
+音协 11.7034530746
+交会 9.20019728618
+腓特烈一世 11.1280889297
+手板 11.4157710022
+修史 10.2371160058
+利息额 12.8020653633
+行政命令 10.2897597393
+包身 13.2075304714
+大蓟 12.8020653633
+托卡列夫 13.2075304714
+剥蚀面 11.8212361103
+递进 10.4349417492
+广告法 11.5027823792
+手杖 10.0294766411
+法分析 13.2075304714
+国安局 13.900677652
+构成威胁 9.94943393339
+耳麦 12.5143832909
+老残游记 11.8212361103
+杨守敬 12.1089181827
+肠道病毒 11.9547675029
+系统管理 11.4157710022
+沉凝 13.900677652
+爱好文学 11.598092559
+轰隆隆 9.71102290995
+手枪 8.01179969364
+女网友 12.1089181827
+勒卡 13.900677652
+唐元和 11.598092559
+宗主 10.3171587135
+东暖阁 8.98802276624
+买进卖出 11.8212361103
+肠伤寒 13.900677652
+定安 10.9562386728
+方案设计 10.9562386728
+鸿福 13.900677652
+勒南 12.2912397395
+许多首次 12.2912397395
+杆件 11.0674643079
+第四项 11.598092559
+砒霜 8.98069672615
+哥德堡 11.3357282945
+前后 6.11787038914
+金军入 11.7034530746
+于黎丽 10.7226238216
+儒者 11.0103058941
+研究部 8.16733637508
+网谈 13.900677652
+闯进去 11.598092559
+中国教会 12.2912397395
+内外援 12.8020653633
+秋露 11.9547675029
+澳门路 13.2075304714
+音变 12.5143832909
+全意 13.900677652
+钢箱梁 11.7034530746
+二十九员 13.2075304714
+字型 10.0088573539
+前周 9.75754292558
+音叉 11.7034530746
+肠壁 10.4041700905
+阳西县 13.900677652
+任何事物 10.1394775363
+维维安 12.1089181827
+俺家 9.61021821083
+连系起来 13.900677652
+噶尔县 12.5143832909
+整体式 10.604840786
+国际饭店 12.1089181827
+跑马场 11.7034530746
+手柄 10.3171587135
+公墓区 12.2912397395
+子阿吉 13.2075304714
+跑马地 12.8020653633
+戳破 10.8561552143
+质谱仪 11.1280889297
+时事政治 12.8020653633
+难行 9.80633308975
+棉田 10.0505300503
+短命 9.5186510173
+沉冤 11.598092559
+凹字 13.900677652
+三七年 12.8020653633
+衣物 8.70772080109
+边政 12.8020653633
+常客 9.4233408375
+怀有 9.05649056552
+杜通 13.2075304714
+资州 11.9547675029
+眼保健操 11.7034530746
+贾第 12.5143832909
+医疗室 13.900677652
+怀朔 12.5143832909
+常宽 13.900677652
+玉米面 10.4349417492
+情绪低落 10.7226238216
+落潮 11.0103058941
+郑伯克 13.2075304714
+诺贝尔经济学奖 8.75318317516
+火柴厂 11.2616203224
+洪口 11.4157710022
+常安 12.2912397395
+两步走 10.9562386728
+水茜溪 12.5143832909
+常宁 11.9547675029
+高质量 8.97342396682
+用力一拍 11.8212361103
+附带条件 12.1089181827
+本位货币 11.4157710022
+军民结合 11.5027823792
+常宝 12.2912397395
+天涯社区 11.7034530746
+凉苏苏 13.900677652
+哈苏纳 13.2075304714
+戈佐岛 13.900677652
+苦干 11.5027823792
+十尊 13.2075304714
+长肉 12.5143832909
+尤精研 13.2075304714
+酷热 9.98865464655
+滤波 10.3171587135
+艰难行进 13.2075304714
+滤泡 11.0674643079
+薛灿 11.598092559
+常导 13.900677652
+小说网 9.96885201925
+给人以 9.00283785202
+观众们 10.9049453784
+新动向 10.0940151622
+网路 11.0674643079
+俩成 13.2075304714
+杨孚 12.8020653633
+林默涵 12.8020653633
+矫健 9.61021821083
+怀来 10.3453295905
+气象台站 11.8212361103
+杨子 9.16447920358
+贾冰硬 13.2075304714
+太普 13.900677652
+十数间 12.8020653633
+酷烈 11.9547675029
+监视器 10.6818018271
+朱家角 11.0674643079
+小笼包子 13.2075304714
+难觅 10.604840786
+阳王章 13.2075304714
+烟圈儿 13.2075304714
+杨宾 13.900677652
+网贴 13.2075304714
+杨宽 11.0103058941
+网费 13.2075304714
+小张侯 12.5143832909
+杨家 10.1871055853
+源江 12.5143832909
+阿术领 13.2075304714
+苦度 12.8020653633
+文心雕龙 10.642581114
+膜过滤 13.2075304714
+反射动作 12.5143832909
+冯渊 12.5143832909
+陶瓷纤维 13.900677652
+行不由径 13.900677652
+杨宜 12.8020653633
+抗非典 12.5143832909
+包车 10.4994802703
+杜邦 12.1089181827
+谈判者 12.5143832909
+一倒 10.0505300503
+玄参科 11.4157710022
+杨宇 12.8020653633
+定音 10.8561552143
+启明 11.1280889297
+匀细 12.1089181827
+耳鼓 11.1280889297
+招摇过市 10.9562386728
+马绍尔 11.4157710022
+滤池 12.8020653633
+足音 12.5143832909
+景帝弟 12.8020653633
+光彩熠熠 13.900677652
+黎可漂 13.900677652
+怀柔 10.2117981979
+皇朝 9.7898037878
+广西队 13.900677652
+伐木工人 13.900677652
+任右通 13.2075304714
+凭此 11.1926274509
+升降台 11.4157710022
+水泄不通 9.5062284973
+无数次 9.27570483869
+常存 11.5027823792
+九十五条 12.5143832909
+作兴 11.9547675029
+日暮途穷 12.5143832909
+伊犁地区 10.9049453784
+缩短成 13.2075304714
+他国 9.06439574502
+产蛋率 11.9547675029
+玉米须 11.2616203224
+首着 13.900677652
+明叔闻 13.900677652
+他处 10.8096351986
+南山人寿 13.900677652
+质数 12.1089181827
+动植物园 12.2912397395
+洪峰 8.88339781516
+杨吴 12.2912397395
+门溪龙 11.8212361103
+做题 13.900677652
+客观条件 10.1630080337
+贾琮 11.9547675029
+洋奴 13.900677652
+第四集 13.900677652
+正副 9.30555780184
+林加耶 13.900677652
+修道 9.44633035572
+冷落 8.58255765813
+好几千 10.8561552143
+南流贯 11.9547675029
+杨君 12.8020653633
+避而远之 12.2912397395
+像貌 12.8020653633
+杭九斋 9.5062284973
+灰褐色 9.44633035572
+好几十 11.598092559
+状貌 11.3357282945
+手植 12.8020653633
+势必会 9.03314320152
+中共湖北省委 11.9547675029
+蟒蛇 10.1871055853
+华茶 11.3357282945
+下半年 6.66289946005
+贾琏 8.4801426527
+三百六十门 13.900677652
+恍悟 12.5143832909
+废址 12.2912397395
+纤悉无遗 13.2075304714
+剃须 12.1089181827
+风邪 10.8096351986
+迷汤 13.900677652
+殷切希望 11.598092559
+八万余 11.4157710022
+生吞活剥 11.598092559
+香胰子 13.2075304714
+给分 13.900677652
+世界旅游组织 11.7034530746
+修通 9.75754292558
+资力 11.4157710022
+伊世珍 13.2075304714
+脱离关系 11.3357282945
+赖丘尔 13.2075304714
+严衍 12.8020653633
+矫形 11.3357282945
+招集 9.65218240993
+贾瑞 10.765183436
+夹叙夹议 11.8212361103
+修造 9.00283785202
+前嫌 11.1926274509
+印度共和国 11.598092559
+劳军 10.2117981979
+信女 12.8020653633
+华陀 12.2912397395
+字头 9.82314020807
+消愁解闷 13.900677652
+人情化 13.900677652
+沐浴露 10.9562386728
+恍惚 8.77671367257
+尾盘报 10.4041700905
+常含 10.765183436
+一点一撇 13.2075304714
+贸易差额 10.8096351986
+苦况 12.5143832909
+白痴 9.77354326693
+耳道 11.1926274509
+朴子蛮 13.2075304714
+洪山 10.2897597393
+一般化 11.1926274509
+注册名 13.2075304714
+面红耳热 13.2075304714
+荥阳市 10.9562386728
+场论 11.0103058941
+吴起甚 13.2075304714
+林荫道 11.5027823792
+场记 13.2075304714
+苏斯洛 13.900677652
+林迁 12.8020653633
+国情 8.70772080109
+贾璜 12.8020653633
+纳蒂维 12.5143832909
+向永福 13.2075304714
+王明礼 13.2075304714
+曹帅派 12.8020653633
+常向 11.0674643079
+响炮 13.900677652
+广告战 13.900677652
+龙泉寺 11.598092559
+第四队 12.1089181827
+五百四十五辆 13.900677652
+小鬼难缠 12.5143832909
+陈伯荣 13.2075304714
+社会科学文献出版社 10.642581114
+观赏树 11.7034530746
+一百九十 11.5027823792
+胆囊息肉 13.900677652
+黄毛小子 13.900677652
+沉得 11.4157710022
+定额 8.20023407859
+对外汉语 12.8020653633
+年销量 10.4349417492
+袁崇焕 10.2897597393
+糖葫芦 11.3357282945
+苏公祠 12.5143832909
+风选 12.1089181827
+质料 10.2117981979
+败诉 10.4041700905
+嘉惠 13.900677652
+灯火阑珊 11.8212361103
+祝愿 9.69598503258
+俄联邦 10.0940151622
+小家碧玉 11.2616203224
+吴永真 13.900677652
+明叔凑 13.2075304714
+回天无力 11.9547675029
+酷网 11.8212361103
+风速 8.93783302172
+李阳冰 11.598092559
+洋妞 11.9547675029
+教会学校 10.4666904475
+联苯胺 11.8212361103
+迷津 11.598092559
+恩泽 10.7226238216
+修配 9.71102290995
+雕刻 7.57990935773
+玉米饼 12.1089181827
+烈酒 10.7226238216
+徐士高 13.2075304714
+信号器 13.900677652
+赤马 11.9547675029
+山水画 9.45802639549
+社会保险金 13.2075304714
+苏里兰 13.900677652
+专用词 13.900677652
+荣叔荣 13.2075304714
+透过来 12.2912397395
+建筑细部 13.2075304714
+洪川 11.2616203224
+洪州 10.533381822
+古龙标 13.900677652
+风里 10.0940151622
+风量 12.1089181827
+吸收能力 11.1926274509
+封泰山 12.5143832909
+杳无踪影 13.900677652
+畋猎 11.8212361103
+风采 9.01787572939
+王景弘 12.8020653633
+计算机病毒 11.3357282945
+甘蔗园 13.2075304714
+彰武 11.0674643079
+八万两 11.8212361103
+苏斯河 13.900677652
+常喝 11.4157710022
+直观教具 13.900677652
+八万个 12.8020653633
+贺廷延 13.2075304714
+前定 10.7226238216
+冻土层 11.1280889297
+鹿胎 12.2912397395
+资历 9.29550746599
+山越岭 12.1089181827
+钱清北 13.2075304714
+董锡林 13.2075304714
+根本无法 8.73589167805
+功能测试 13.900677652
+包膜 10.533381822
+修改版 13.900677652
+述而不作 12.8020653633
+杜鹃 9.04086524761
+拜斯 13.2075304714
+历史文物 9.93038573842
+前导 9.91169360541
+治感冒 11.9547675029
+汪云凤 12.1089181827
+山上人家 13.900677652
+文莱达鲁萨兰国 13.900677652
+各种类型 8.89004235788
+洁身 11.8212361103
+鄂登楚 13.2075304714
+十数座 13.900677652
+十几句 12.5143832909
+像距 13.2075304714
+敌兵 9.5186510173
+农经系 13.900677652
+瞪大眼睛 9.5062284973
+各部委 9.96885201925
+祝您 11.8212361103
+教学区 11.8212361103
+调音师 12.1089181827
+望风逃窜 13.2075304714
+翩翩飞 12.8020653633
+就医难 13.900677652
+失败主义 12.5143832909
+时前凉 13.2075304714
+请调报告 12.8020653633
+上呼吸道 9.63799777493
+钱江 10.4666904475
+巫兰英 13.2075304714
+霸主 8.89004235788
+巴塞林 13.900677652
+三十九度 13.2075304714
+华菱 10.1871055853
+拦路虎 10.765183436
+客观真理 11.598092559
+第四十三回 12.2912397395
+刑事诉讼 10.0294766411
+杨喜 11.7034530746
+请原谅 10.3743171274
+矽土 13.900677652
+变电站 9.72629038208
+冲脉 11.4157710022
+霸业 10.1164880181
+阖家团圆 13.2075304714
+唐懿宗 13.2075304714
+子燕帖 13.2075304714
+臂长 11.4157710022
+大经大法 12.5143832909
+杨善 11.0103058941
+军事管制 10.6818018271
+秦末汉 11.9547675029
+计算机教育 13.900677652
+杜黑 11.7034530746
+张康二 13.900677652
+沉底 11.3357282945
+奋发上进 13.900677652
+吞服 11.2616203224
+包脚 13.900677652
+杜黎 13.2075304714
+杨嗣 13.900677652
+钱氏 10.8561552143
+勒尔 11.8212361103
+做饭 7.93453091285
+凛然 9.89334446674
+霍尔巴赫 12.1089181827
+严规 12.5143832909
+坚持不懈 9.65218240993
+缝衣服 12.5143832909
+德谟克利特 10.8561552143
+估衣 12.1089181827
+一日数惊 12.8020653633
+李昭楠 13.2075304714
+铁精粉 11.3357282945
+伊比利 13.900677652
+富田 12.8020653633
+段鹏举 12.5143832909
+美少女 12.5143832909
+财政开支 11.0103058941
+曹丕问 13.2075304714
+蓬头赤脚 13.900677652
+方慢慢 12.2912397395
+字字 10.0720362555
+能源安全 10.1164880181
+铂金 10.0294766411
+伪报 13.2075304714
+数据挖掘 13.2075304714
+痴狂 12.5143832909
+正到 11.598092559
+三四百个 12.5143832909
+白琳 13.2075304714
+舌战群儒 13.2075304714
+改编者 12.1089181827
+质材 13.900677652
+津贴费 13.900677652
+估计 6.00747878243
+这群人 10.4349417492
+钱德拉塞卡 11.9547675029
+残废证 13.2075304714
+朱姨娘 12.1089181827
+秘书 6.82995354472
+何以见得 10.1394775363
+落户 8.13235665618
+城市交通 9.77354326693
+从爱生 12.5143832909
+质朴 8.89673134603
+国中 9.29550746599
+索夫雷 13.900677652
+地理位置 8.21031819765
+仿造品 12.2912397395
+刘廷让 13.2075304714
+续顺公 13.2075304714
+电导分析 13.2075304714
+沃霍尔 13.2075304714
+冠军杯 12.5143832909
+七万户 12.5143832909
+缝衣机 13.900677652
+洪府 11.3357282945
+映耀 13.2075304714
+落成 9.11318590919
+陇山 10.604840786
+解放街 12.5143832909
+快进来 10.9049453784
+购买过程 12.8020653633
+停车线 12.1089181827
+影楼 12.5143832909
+扬名天下 12.8020653633
+郭品文 13.2075304714
+从那以后 9.0884932966
+石决明 12.1089181827
+常回 12.8020653633
+加德纳 12.1089181827
+杨道 10.533381822
+音形 12.8020653633
+李贞贤 11.1280889297
+水道网 12.8020653633
+乱叫 9.28555713513
+卡切夫 12.8020653633
+许志永 13.2075304714
+舅兄 13.2075304714
+弥勒县 12.5143832909
+克莱斯蒂尔 13.900677652
+充分肯定 9.20932976975
+洪平 13.900677652
+音律 9.31571017331
+闲庭信步 12.1089181827
+开展批评 11.2616203224
+手段 5.69764741026
+凹地 9.93038573842
+造型艺术 10.0088573539
+明叔面 13.900677652
+舅公 11.0103058941
+盱眙县 12.2912397395
+小帽子 13.900677652
+平凡 8.83808261895
+草稿 9.89334446674
+碘化钾 11.7034530746
+汗浸浸 13.900677652
+柯钦 11.8212361103
+头皮发麻 10.9562386728
+倚强凌弱 13.2075304714
+确认书 10.9562386728
+镁光 13.900677652
+九重 10.1871055853
+三管齐下 12.8020653633
+他家 7.54456999128
+碘化钠 12.8020653633
+海沧区 13.900677652
+雕凿 11.0103058941
+纵横捭阖 11.0674643079
+利斯特 12.2912397395
+杨国 11.9547675029
+伦蒂岛 12.2912397395
+高频干燥 13.900677652
+卢锋 13.900677652
+柯铁 13.2075304714
+河间王 11.7034530746
+捆紧 12.2912397395
+西德维纳河 12.5143832909
+洪帮 12.8020653633
+苦口 11.598092559
+披麻戴孝 10.9562386728
+杜麟征 13.2075304714
+蕾丝 11.9547675029
+废城 12.8020653633
+七八千块 13.2075304714
+连克瓜 13.2075304714
+吃香 10.0294766411
+痴爱 12.8020653633
+食言而肥 13.2075304714
+五三年 12.2912397395
+苦参 11.3357282945
+外滩 9.41204128224
+凹坑 11.598092559
+网聊 13.900677652
+吴支谦 12.8020653633
+新内阁 11.1280889297
+旁遮普省 11.1926274509
+数十艘 11.9547675029
+储秀宫 10.6818018271
+太虚幻境 11.2616203224
+陈中伟 11.7034530746
+磕磕绊绊 11.598092559
+大唐电信 8.77671367257
+躬身下拜 13.900677652
+迷漫 10.8096351986
+包菜 12.8020653633
+鹰钩鼻 11.9547675029
+黄土岭 12.5143832909
+裙子 8.73019365694
+死期临近 13.900677652
+杨诚伸 12.5143832909
+前妻 9.94943393339
+地热井 12.2912397395
+稀疏地 13.2075304714
+斯洛文尼亚 9.85762638414
+水珠子 13.2075304714
+径级 13.900677652
+第四间 13.900677652
+张昭谏 12.8020653633
+黄土岗 11.3357282945
+弹奏着 13.900677652
+径线 12.2912397395
+给养 9.33632946051
+晶体学 11.4157710022
+巴克莱 8.91707103027
+兜圈 13.2075304714
+贡赋备 13.2075304714
+好几双 13.900677652
+压盖 12.8020653633
+干干净净 8.4801426527
+陈称鸿 13.2075304714
+杨诚你 12.5143832909
+大行星 10.3743171274
+官龄 13.900677652
+常基 13.2075304714
+文佛典 13.2075304714
+八百壮士 11.9547675029
+信鸽 11.3357282945
+可贵 9.46986085313
+杨坤 12.1089181827
+人大主任 12.8020653633
+副总裁 8.36728816325
+人马座 10.1630080337
+力竭声嘶 12.2912397395
+创刊号 11.0103058941
+窄门 11.9547675029
+老侍者 13.900677652
+败血 13.2075304714
+图板 12.1089181827
+杨坊 12.8020653633
+华北石油 12.2912397395
+诬害 12.8020653633
+垂垂老矣 12.8020653633
+级低 13.900677652
+黄辅臣 13.2075304714
+元太祖 11.5027823792
+损失费 12.8020653633
+吕擎阳 12.5143832909
+严训 13.2075304714
+短处 10.1630080337
+常在 8.13548654919
+苦劳 10.9049453784
+职务侵占罪 13.2075304714
+砖木结构 10.8561552143
+审曲面势 13.900677652
+国史馆 10.7226238216
+砂礓 12.8020653633
+前天 8.23771717184
+前夫 10.1630080337
+拒之门外 10.1394775363
+百花洲 12.8020653633
+前头 8.36728816325
+音序 12.8020653633
+非问 13.900677652
+杜鲁 13.900677652
+城步苗族自治县 12.2912397395
+杨诚便 12.5143832909
+膏粱锦绣 13.2075304714
+短多 11.1926274509
+景阳宫 13.2075304714
+李默然 12.8020653633
+胞间连丝 11.5027823792
+台州市 11.5027823792
+封辅国 12.5143832909
+苦劝 9.98865464655
+坏东西 11.7034530746
+注册地 10.533381822
+做鬼 10.8561552143
+给出 7.06334483729
+古旧 9.84023464143
+大发议论 12.5143832909
+草笠 12.5143832909
+资兴 12.2912397395
+诈病 12.8020653633
+后北征 12.5143832909
+杨基 11.9547675029
+杜家 11.598092559
+完美主义 13.2075304714
+包茎 10.1871055853
+教唆者 13.900677652
+海河平原 10.9562386728
+陇州 13.2075304714
+陇川 11.5027823792
+理想信念 11.9547675029
+柯劭 12.8020653633
+镜面反射 12.1089181827
+提刑官 13.900677652
+资本密集型 11.0103058941
+箴谏 13.900677652
+哀苦 12.2912397395
+河东狮吼 12.8020653633
+好几口 11.9547675029
+严词 10.9049453784
+负固不服 13.900677652
+归师勿掩 13.900677652
+玛兰厅 12.8020653633
+草签 10.8096351986
+前奏 9.45802639549
+马上直 13.2075304714
+越耶律 12.8020653633
+雕像 8.56795885871
+绫子 11.3357282945
+西长安街 11.1926274509
+勒布 13.2075304714
+黄土层 10.9049453784
+滩涂 9.08039608637
+财经纪律 12.5143832909
+许仕廉 12.8020653633
+前座 10.9562386728
+公乃命 13.2075304714
+严谨 8.03704647638
+福清人 13.900677652
+前庭 9.93038573842
+陈书记 13.2075304714
+拉回去 11.5027823792
+回驳 13.2075304714
+民族平等 11.0674643079
+王积薪 13.900677652
+大千世界 10.765183436
+土壤资源 11.5027823792
+玉清境 13.900677652
+开普敦 10.1630080337
+三百六十里 12.8020653633
+黄忠甚 13.2075304714
+权利义务 9.82314020807
+雕鞍 10.2630914922
+扣住 10.1394775363
+前序 12.8020653633
+风铃 10.2897597393
+臂部 11.598092559
+掌门人 7.71652876104
+勒姆 12.2912397395
+两三截儿 13.2075304714
+肯请 13.900677652
+龟头炎 11.3357282945
+扣作 12.5143832909
+指数分布 13.2075304714
+旦夕之间 12.2912397395
+好整以暇 12.2912397395
+杜宣 13.2075304714
+救溺 13.2075304714
+安德鲁 10.5684731418
+一表非俗 11.598092559
+河南日报 10.0720362555
+蝌蚪 8.5488195185
+确山县 10.604840786
+摄影机 10.2117981979
+凹凹 12.2912397395
+凹凸 9.74179456862
+耳钉 13.900677652
+风钻 12.2912397395
+横尸遍野 13.900677652
+贝青乔 13.2075304714
+摄影术 13.2075304714
+中明兄 12.8020653633
+杨健 10.3743171274
+病毒感染者 11.598092559
+质感 9.27570483869
+离岸价 11.3357282945
+恶煞 12.8020653633
+金口玉牙 13.900677652
+烯酸 11.9547675029
+金戈铁马 11.3357282945
+投资规模 8.44535653662
+灶膛 11.1280889297
+奉令 11.3357282945
+迷梦 12.2912397395
+顶端优势 12.2912397395
+的的确确 10.8096351986
+笑窝 13.2075304714
+廉访司 11.5027823792
+法朗士 12.1089181827
+奉上 9.75754292558
+滤机 13.900677652
+场边 11.3357282945
+常值 11.9547675029
+表面波 11.1926274509
+滏阳 10.3453295905
+弧线球 13.900677652
+忌妒心 13.900677652
+河北省政府 12.2912397395
+筋肉 10.8096351986
+苦闷 9.06439574502
+临终前 9.6811699468
+兰甘亨 12.1089181827
+难舍 11.2616203224
+绿玉 11.598092559
+地下水库 13.2075304714
+咬着不放 13.2075304714
+助产士 11.8212361103
+提提神 12.2912397395
+撒克逊 11.0103058941
+盐湖区 12.8020653633
+凭恃 11.8212361103
+沉实 12.1089181827
+手淫 10.4349417492
+官样文章 11.1280889297
+辣椒油 11.8212361103
+高尚风格 13.900677652
+前年 8.26588804881
+秦末楚 12.8020653633
+粮油食品 11.8212361103
+网虫 13.2075304714
+洪堡 10.3453295905
+绿珠 12.1089181827
+雪花膏 11.3357282945
+草类 10.3453295905
+草籽 11.2616203224
+榆次县 11.7034530746
+二十九年 8.82550383674
+贷款人 9.89334446674
+中国航空工业第二集团 13.900677652
+珠三角 9.07236391467
+阿德莱 13.900677652
+海东地区 12.1089181827
+刘体仁 12.8020653633
+始末原由 13.2075304714
+燕京大学 9.13850371718
+真无 13.2075304714
+耳后 10.3453295905
+风门 11.5027823792
+名垂青史 11.1926274509
+包藏 10.3171587135
+六七十里 13.2075304714
+挺撞 13.900677652
+篱墙 13.900677652
+吃饺子 10.642581114
+严责 11.2616203224
+宫朝贺 11.0674643079
+短得 11.1280889297
+风闻 9.11318590919
+奉侍 12.8020653633
+膏丸 13.900677652
+灼热感 11.7034530746
+美味佳肴 10.7226238216
+一万盏 12.5143832909
+白龙马 12.2912397395
+街谈巷议 11.598092559
+越觉 11.9547675029
+耳闻 9.75754292558
+石太铁路 12.2912397395
+前往 6.79653355899
+帕里 11.3357282945
+吃后悔药 11.9547675029
+筋脉 10.8561552143
+辛永宗 11.8212361103
+新机种 13.900677652
+耳门 11.2616203224
+东北制药集团 13.900677652
+目光犀利 11.9547675029
+修长 9.62401153296
+花旗集团 9.12155415886
+供料 13.900677652
+投诉信 13.900677652
+苦味 9.7898037878
+乙醇钠 12.8020653633
+海贝形 12.8020653633
+杨兰 13.900677652
+苦命 9.62401153296
+杨兴 13.900677652
+融于 11.0674643079
+吞掉 10.4666904475
+杨全 12.8020653633
+见棱见角 12.8020653633
+字少 12.8020653633
+党工委 12.5143832909
+救命钱 12.8020653633
+刀美兰 12.8020653633
+宋政权 11.0103058941
+迷楼 13.2075304714
+扣下 10.9049453784
+扣上 10.4041700905
+归咎于 9.53122979951
+塔那那利佛 11.4157710022
+左上臂 13.900677652
+医院院长 10.2117981979
+匕首 9.30555780184
+成正比 8.46259834305
+城邑 10.0505300503
+杨克 13.2075304714
+杨先 12.1089181827
+杨光 10.9562386728
+怀海 13.900677652
+杨元 13.900677652
+杜马 11.0674643079
+酷站 13.900677652
+近交 12.1089181827
+函电 13.900677652
+刘景德 11.5027823792
+优胜 9.74179456862
+耳镜 12.1089181827
+杨冲 12.8020653633
+奏凯歌 11.7034530746
+短式 13.900677652
+纪者劾 13.2075304714
+落日 9.96885201925
+可贵精神 12.8020653633
+有天无日 12.2912397395
+常儿 13.900677652
+胺基 12.5143832909
+干亲家 12.1089181827
+大清律 11.8212361103
+保宁府 12.8020653633
+杨军 11.3357282945
+说东谈西 13.900677652
+第九条 10.9049453784
+继任者 9.65218240993
+信风 10.0940151622
+索非亚 11.0103058941
+易于控制 12.5143832909
+前弓 13.900677652
+包蕴 13.2075304714
+无数根 12.8020653633
+筋膜 10.7226238216
+益鸟 10.9562386728
+烫过 11.9547675029
+恩格 11.8212361103
+真怕 10.1164880181
+童夫人 13.2075304714
+李友 9.04864738806
+秋之菊 13.2075304714
+毛晋刻 13.2075304714
+抽泣声 11.7034530746
+扣人 12.2912397395
+汉军旗 11.1926274509
+杨凯 11.598092559
+第九期 12.2912397395
+洪大 10.2117981979
+雇佣军 9.98865464655
+手泽 13.2075304714
+爪牙 10.2117981979
+设卡 10.604840786
+箪食瓢饮 13.2075304714
+奉使 11.5027823792
+江湖味 13.900677652
+吉尼玛 13.900677652
+黄蔷薇 13.2075304714
+操盘手 10.0720362555
+手法 7.09828288865
+供方 12.2912397395
+风雨 8.01735526349
+风雪 8.62256299275
+朦胧诗 13.2075304714
+几百年几千年 12.8020653633
+纳士招贤 13.900677652
+菝葜 12.8020653633
+常务 7.76295059789
+杨制 12.2912397395
+一万两万 12.8020653633
+助产婆 13.2075304714
+看不下去 10.7226238216
+二十九岁 11.598092559
+高温炎热 13.2075304714
+河湖相 10.765183436
+立等可取 13.2075304714
+主题卡 12.2912397395
+板蓝根 10.1164880181
+李成桂 12.8020653633
+责任险 10.2630914922
+风雷 10.533381822
+杨刚 12.1089181827
+草纸 11.7034530746
+落晖 12.8020653633
+字形 8.32472854883
+时候未到 13.900677652
+修院 10.7226238216
+风雅 9.84023464143
+江坝 12.1089181827
+防御力 12.1089181827
+无地自容 10.0505300503
+新华社摄影部 13.900677652
+第四部 9.91169360541
+黑脸 9.71102290995
+边传首 13.2075304714
+不讲理 10.4666904475
+三联单 11.4157710022
+修陵 12.5143832909
+草约 11.1926274509
+贾特 12.1089181827
+二十五顷 13.2075304714
+难能 11.9547675029
+顶极 12.2912397395
+凹口 13.900677652
+小羽柄 13.2075304714
+音孔 10.8561552143
+粗嗓子 13.900677652
+痘痘 10.9562386728
+冻成 11.2616203224
+多嘴多舌 11.5027823792
+稠密性 13.2075304714
+血糊糊 11.9547675029
+封楚公 12.8020653633
+败走 9.36807815882
+草绿 11.9547675029
+认股权 11.3357282945
+三街六巷 13.2075304714
+翟秋白 12.8020653633
+草绳 10.8096351986
+子奶奶 12.8020653633
+猫头鹰 9.54396882529
+人马宫 13.900677652
+三四百元 12.5143832909
+自是 8.49350588052
+风障 12.8020653633
+黍子 11.598092559
+飞进去 13.900677652
+付煦然 13.900677652
+风险 4.93062699015
+肢解 10.533381822
+古特提 13.900677652
+短小 8.5440913773
+他律 13.2075304714
+伦加德 13.900677652
+邵公 11.8212361103
+必必剥剥 13.2075304714
+丢起 13.2075304714
+壁板 11.8212361103
+汉元帝 10.9562386728
+经济往来 11.1280889297
+脑力劳动者 11.8212361103
+羽毛球拍 12.8020653633
+耳际 11.2616203224
+曾学书 13.2075304714
+议决案 13.2075304714
+筋节 12.1089181827
+獐子 10.0088573539
+义节 13.900677652
+官马 11.5027823792
+萨马兰奇 11.1926274509
+难耐 9.74179456862
+转贴自 13.900677652
+任天知 12.8020653633
+大雪山 9.84023464143
+程序实现 13.900677652
+刘嘉玲 13.900677652
+亡魂失魄 13.900677652
+魄散魂飞 12.1089181827
+借故 10.0720362555
+短尾 10.8096351986
+难者 11.598092559
+哭天哭地 13.2075304714
+有益菌 12.5143832909
+在此一举 10.765183436
+省直管 12.8020653633
+体育讯 12.2912397395
+布雪勒 13.900677652
+捞去 12.1089181827
+前山 10.7226238216
+三厢车 11.4157710022
+蒸发器 11.3357282945
+衣箱 11.0674643079
+多发病 11.1280889297
+战国时代 9.38981814546
+质控 12.8020653633
+郎束皙 13.2075304714
+陆九渊 10.533381822
+场上 8.20023407859
+家恋土 13.2075304714
+灵官殿 11.7034530746
+烫伤 9.93038573842
+吴太平 13.2075304714
+前屋 13.2075304714
+钱款 11.0674643079
+胡泽斯 13.2075304714
+板条 13.2075304714
+桑子 10.4666904475
+正过 11.5027823792
+杨勇 10.8096351986
+深冷分离 13.900677652
+字幅 12.2912397395
+一秉至公 13.900677652
+冷空气 8.7245279194
+钢钳 13.2075304714
+郑伯奇 11.8212361103
+常去 10.2371160058
+字幕 11.1926274509
+第四重 13.900677652
+由此而来 10.1164880181
+文笔优美 11.8212361103
+风韵 9.98865464655
+演奏者 10.4349417492
+常压 9.91169360541
+不容分说 10.3171587135
+成竹在胸 10.7226238216
+侯叔献 13.2075304714
+女人爱 12.8020653633
+修面 12.2912397395
+人民解放军 8.88339781516
+穆顿 13.900677652
+水利水电 10.4041700905
+多核体 13.2075304714
+龙泉山 10.5684731418
+铂铱 12.2912397395
+倒挂金钟 12.5143832909
+运筹学 10.0505300503
+僻静处 10.3171587135
+定鼎 10.6818018271
+爱丁堡大学 10.4041700905
+洪家 11.8212361103
+才仁旺 12.5143832909
+状语 12.1089181827
+汉置云 12.8020653633
+绿灯 9.98865464655
+杨卫 11.8212361103
+前巷 11.9547675029
+权门 10.765183436
+洪宪 11.2616203224
+迷死 13.900677652
+队报 12.5143832909
+下半夜 9.98865464655
+书展 11.4157710022
+短工 10.3171587135
+双飞双 13.900677652
+金属罐 13.2075304714
+吉林省 8.29487558568
+注册号 12.2912397395
+朱姓藩 13.2075304714
+基本知识 11.0674643079
+杜顺 13.2075304714
+无梁 12.5143832909
+哪一位 10.2897597393
+前川 12.1089181827
+洪宅 13.2075304714
+信塞 13.2075304714
+落月 13.2075304714
+慨然应允 11.8212361103
+徐光宪 13.2075304714
+风靡 9.44633035572
+草编 10.6818018271
+氧吧 12.1089181827
+杜预 10.2897597393
+平儿 8.5440913773
+会计报表 10.9562386728
+贾环 9.74179456862
+皮科克 13.2075304714
+阿威罗 12.5143832909
+韦达著 13.2075304714
+喋血 12.2912397395
+晏殊 11.1280889297
+采矿业 9.24671730182
+沉声 11.5027823792
+洪子 13.2075304714
+邵大侠 7.85330547293
+严辞 11.598092559
+搭台 10.7226238216
+空气冷却 12.2912397395
+美少妇 13.900677652
+修鞋 11.7034530746
+质押 8.32472854883
+人来客往 13.900677652
+牛山岛 12.8020653633
+巴彦塔拉 13.2075304714
+字库 11.7034530746
+黄土塬 11.0103058941
+黄二人 11.598092559
+贾珠 12.2912397395
+婵娟 11.2616203224
+全权处理 11.3357282945
+落枕 11.7034530746
+进用 11.598092559
+半晌道 11.3357282945
+洋庄 11.4157710022
+赵谦派 12.8020653633
+落果 11.7034530746
+画来画去 13.2075304714
+凭据 10.2630914922
+特等奖 11.3357282945
+风霜 10.4041700905
+贾珍 8.99540287354
+洋底 9.69598503258
+薛修义 13.2075304714
+杨参 12.8020653633
+阿尔摩哈 12.1089181827
+赵尘 12.1089181827
+罗庄 13.900677652
+巡防舰 12.2912397395
+一千几百 13.2075304714
+强降雨 12.1089181827
+杆塔 11.9547675029
+掌王之 13.2075304714
+瞻仰遗容 13.900677652
+脑勺子 13.900677652
+华胄 13.2075304714
+与其说是 9.18217878068
+王维山 13.900677652
+学区制 13.900677652
+益菌 13.900677652
+义律 11.3357282945
+彳亍 13.2075304714
+潍县 11.0674643079
+诲淫诲盗 12.2912397395
+包裹 7.81390292506
+白桦树 11.2616203224
+溶蚀盆 12.1089181827
+黑尔 12.1089181827
+陈仓道 11.598092559
+第九章 9.66657114738
+压秤 13.900677652
+修补 9.12155415886
+损失险 11.598092559
+不愁吃 11.5027823792
+网络覆盖 11.4157710022
+贾氏 11.0103058941
+振荡电路 12.8020653633
+良性瘤 13.900677652
+进站 10.4349417492
+黑山 9.43476953332
+还原剂 9.98865464655
+八万块 12.8020653633
+太湖 8.43684584695
+非军事化 12.1089181827
+蛞蝓 11.1926274509
+汽化热 11.7034530746
+国资委 7.25688791883
+萌起 13.2075304714
+贾汪 11.9547675029
+储气库 11.1926274509
+炸鱼 11.8212361103
+王彦超 13.2075304714
+祝福 8.71889410168
+七顷 13.2075304714
+估量 9.58318953844
+徽州地区 12.1089181827
+安义 12.2912397395
+偷出来 11.5027823792
+模型材料 13.900677652
+非军事区 12.1089181827
+相形见绌 10.4666904475
+秦乘燕 12.8020653633
+整军经武 11.0674643079
+杨诚告 13.2075304714
+塑料包装 11.8212361103
+儒雅 10.0720362555
+言过其实 10.604840786
+麦秆虫 12.8020653633
+秉公 10.765183436
+痴梦 13.2075304714
+傻呵呵 12.5143832909
+纪检组 11.1926274509
+黑屏 13.900677652
+蜘蛛蟹 13.2075304714
+义弟 12.8020653633
+风衣 10.0505300503
+任礼部 11.4157710022
+信叔贤 13.2075304714
+学士学位 8.91707103027
+涤卡 12.2912397395
+童儿忽 13.900677652
+身首异处 10.9562386728
+黑岩 12.8020653633
+祝祷 10.3743171274
+风行 9.77354326693
+陶塑女 12.5143832909
+黑岛 12.8020653633
+埃布罗河 11.9547675029
+家乡人 11.8212361103
+定能 10.4041700905
+匆匆忙忙 9.41204128224
+一万步 10.4666904475
+叶丛生 12.8020653633
+扣发 12.8020653633
+手熟 13.900677652
+扣取 12.8020653633
+古国史 12.8020653633
+大幅度提高 9.36807815882
+安城 12.1089181827
+增量调制 13.900677652
+宋江山 13.900677652
+猜拳行令 12.8020653633
+幸蒙 10.765183436
+扣去 11.7034530746
+主任医师 9.59661255877
+安极尔 12.8020653633
+弃甲倒戈 13.2075304714
+维米尔 13.2075304714
+一个萝卜一个坑 12.2912397395
+祖孟嘉 13.2075304714
+中国籍 11.0674643079
+重新命名 11.7034530746
+冉闵灭 12.8020653633
+毛瑟式 13.900677652
+带阁楼 12.8020653633
+粮食供应 10.6818018271
+范章京 12.5143832909
+官营 10.1871055853
+衣料 9.94943393339
+曹宇 12.8020653633
+送往迎来 12.1089181827
+不跌 10.2897597393
+聚苯醚 11.9547675029
+喜笑颜开 10.4994802703
+荡舟 13.2075304714
+叛将 10.4349417492
+净现金 11.2616203224
+喜新厌旧 10.9049453784
+老趼 13.900677652
+惑乱人心 13.900677652
+购物者 13.900677652
+本报讯 7.2439511278
+哥们义气 13.2075304714
+圣地亚哥 9.87532596124
+恒星系 13.900677652
+匹马单枪 11.8212361103
+看得起 10.4349417492
+斯诺戈尔 13.2075304714
+见天日 11.1926274509
+地主婆 12.8020653633
+王司徒 12.1089181827
+亮银色 13.900677652
+义庄 10.0088573539
+穆虎 12.1089181827
+追根究底 11.8212361103
+三七廿一 13.900677652
+斯帕克斯 13.900677652
+龙岗山 12.5143832909
+够意思 11.4157710022
+光武帝 10.1164880181
+吴丙 13.2075304714
+无关宏旨 11.8212361103
+衣摆 13.2075304714
+难以避免 9.44633035572
+百业萧条 13.2075304714
+刘禹锡 10.3453295905
+难不住 11.7034530746
+达达尼 10.3171587135
+变电所 10.4994802703
+精密机械 10.4041700905
+爱尔巴桑 13.900677652
+具体条件 10.8561552143
+食色性也 13.2075304714
+音频 10.3743171274
+和龙 10.4994802703
+等效网络 13.900677652
+高峡出平湖 13.900677652
+抢过来 10.5684731418
+毒害 9.53122979951
+包馅 12.8020653633
+美国环球影片公司 11.9547675029
+任行寿 13.2075304714
+救命之恩 10.2630914922
+基因学 13.900677652
+邵荃麟 12.5143832909
+视为至宝 13.900677652
+一百七十一万四千余 13.2075304714
+霸图 12.2912397395
+影片 7.28863661714
+宋江差 11.9547675029
+第四辆 12.1089181827
+严酷 8.76487921493
+扣到 11.5027823792
+市场秩序 9.33632946051
+缓流 10.9049453784
+惜客好义 13.900677652
+杆头 12.5143832909
+汤玛法 11.2616203224
+林丰草 13.900677652
+补贴费 13.2075304714
+扣分 11.2616203224
+冰消瓦解 12.8020653633
+射球入门 13.900677652
+奉召 10.4666904475
+遗祸无穷 13.900677652
+凤羽 13.900677652
+扣划 12.2912397395
+梅里爱 11.9547675029
+凤生祥 13.900677652
+斯坦尼 10.4349417492
+反客为主 11.3357282945
+荡荡 10.1164880181
+树花 13.2075304714
+搜索枯肠 13.900677652
+似地 7.47580862807
+居草庐 13.2075304714
+安第斯 10.765183436
+能静心 13.900677652
+不可等闲视之 11.8212361103
+楼顶上 10.3453295905
+义师 10.5684731418
+何用途 12.2912397395
+总的来说 9.08039608637
+铁心石肠 13.900677652
+包饭 12.5143832909
+直馏汽油 13.900677652
+雅座 11.5027823792
+书号 12.5143832909
+责任保险 10.9562386728
+张宝引 13.2075304714
+颜昔班 13.2075304714
+吴七 12.8020653633
+第四轮 10.765183436
+柯达 12.2912397395
+拴马 11.9547675029
+建功 10.4349417492
+做脸 13.900677652
+鸣鼓 10.765183436
+鹅头 13.2075304714
+三座门 11.2616203224
+孟公公 10.5684731418
+闪躲不及 13.900677652
+沸点升高 11.9547675029
+魏老大 12.8020653633
+扣动 10.765183436
+生成素 10.9562386728
+宋天宫宝藏 13.2075304714
+粗陋 11.2616203224
+斗子 12.1089181827
+感器 12.1089181827
+木村兵 13.2075304714
+黑巾 13.900677652
+象牙白 12.8020653633
+晃动 8.53470163695
+黑工 12.8020653633
+齐王田 13.2075304714
+春风雨露 13.2075304714
+总的来讲 12.2912397395
+中国国际旅行社 13.2075304714
+可穿透 11.1280889297
+拉开距离 11.7034530746
+必有一得 13.900677652
+严重 5.32729318091
+魏兵袭 13.900677652
+见过世面 10.1630080337
+韩天麟 12.5143832909
+不用浪费 13.2075304714
+剔透 11.4157710022
+栗色 10.5684731418
+喧响 12.1089181827
+林奈学 12.1089181827
+司马昭之心 12.5143832909
+杨为 11.9547675029
+主体作用 12.1089181827
+杨丽 12.2912397395
+肉丸子 13.900677652
+古图索 12.8020653633
+常亦 12.8020653633
+绿洲 8.43261751084
+落空 8.66956903512
+常人 8.61241062128
+伯邑考 11.9547675029
+韦坚 11.8212361103
+黑带 12.1089181827
+薛烛 13.900677652
+搭乘 9.72629038208
+黑帮 11.0103058941
+杨业 10.8096351986
+常事 10.1630080337
+多次重复 11.0674643079
+高朋满座 11.5027823792
+奉承话 10.8561552143
+小户型 9.74179456862
+杨东 12.8020653633
+汽车保险 12.1089181827
+新生力量 10.642581114
+季直夸 13.900677652
+尖端 9.27570483869
+黑布 10.1871055853
+黑市 9.98865464655
+那就好 10.5684731418
+陆士衡 13.2075304714
+信息熵 11.9547675029
+杨一 11.5027823792
+端坐 8.69119149913
+三联体 12.1089181827
+入场 8.77077893705
+无可厚非 9.82314020807
+监考官 13.900677652
+草拟 9.17328983326
+小木屋 11.4157710022
+绿海 12.5143832909
+摄影社 13.900677652
+静定问题 13.900677652
+常以 8.70772080109
+常任 10.0940151622
+扣儿 11.598092559
+绿浪 13.2075304714
+太空站 11.2616203224
+魏金斯 12.8020653633
+乌尔德 13.2075304714
+审议 7.26210986281
+对天盟誓 10.9562386728
+恩格尔系数 11.7034530746
+郭平梁 12.2912397395
+十六天 13.2075304714
+金澄澄 13.900677652
+黑幕 9.94943393339
+衣服 6.08587422249
+第十六届 10.8096351986
+连窝儿 13.2075304714
+杨乐 13.2075304714
+着力点 9.19114745066
+臭得 12.5143832909
+十六大 10.765183436
+搭个 10.3453295905
+旗鼓相望 11.598092559
+杨么 10.4994802703
+杨义 13.900677652
+官奴 11.8212361103
+亚利桑那州 9.85762638414
+玩心很重 13.900677652
+孙羽 13.900677652
+怀特 10.2897597393
+义工 11.598092559
+十六头 13.900677652
+奉候 12.8020653633
+卡式录音机 13.2075304714
+三河县 11.598092559
+杨亿 11.598092559
+通化市 11.1280889297
+傅博 13.900677652
+手环 13.2075304714
+乱成一团 10.604840786
+扣击 12.2912397395
+扣出 13.2075304714
+相为表里 11.7034530746
+那岭 12.5143832909
+杨亮 13.2075304714
+嘲骂 11.598092559
+黑度 13.900677652
+酷政 13.900677652
+半辈子架 13.900677652
+定苗 12.1089181827
+客源国 13.900677652
+夏阿姨 11.5027823792
+杨亚 13.2075304714
+扣减 10.0720362555
+宝钗忙 11.1926274509
+草房 9.80633308975
+那愚夫 13.900677652
+杨云 12.8020653633
+起止点 12.1089181827
+载流子 10.6818018271
+伍珀塔尔 13.900677652
+沿条 13.900677652
+割切 11.5027823792
+衣柜 9.6811699468
+克鲁赛 13.900677652
+有限小数 13.2075304714
+幸生 13.2075304714
+明独照 13.2075304714
+网页 9.53122979951
+宝云塔 12.8020653633
+第五十二回 12.2912397395
+机号码 13.900677652
+顶礼膜拜 10.5684731418
+近似计算 11.1280889297
+六百步 13.2075304714
+撂荒地 13.2075304714
+杨仪 10.9562386728
+秀姑峦溪 12.1089181827
+雅州 11.3357282945
+宫颈癌 10.2371160058
+库奇马 13.900677652
+愀然不乐 13.900677652
+盘蛇坡 11.598092559
+牌示 13.2075304714
+衣架 10.9049453784
+咏唱 12.2912397395
+震撼性 13.2075304714
+场里 10.604840786
+益脾 12.8020653633
+书友 13.2075304714
+勒紧裤带 11.1280889297
+钱眼 13.2075304714
+向金军 13.2075304714
+公民道德 13.900677652
+王宝钏 11.9547675029
+常乐 12.2912397395
+沛公 11.7034530746
+周仆瞅 12.8020653633
+百年难遇 12.2912397395
+杆子 8.52539924429
+恩相 9.77354326693
+奉军 9.82314020807
+中国工商银行 9.56994431169
+明公正道 13.900677652
+第九种 13.900677652
+十刀 12.2912397395
+库拉索岛 12.8020653633
+淼淼 13.2075304714
+绿水 10.2897597393
+伊藤忠 13.900677652
+实践经验 9.43476953332
+玉怜香 13.2075304714
+有钱有闲 12.8020653633
+排湾族 12.5143832909
+国民党中央委员会 11.2616203224
+测试表明 12.8020653633
+雅尔 10.642581114
+未能幸免 11.598092559
+杨伦 13.2075304714
+海宁路 13.900677652
+益胃 12.1089181827
+起起伏伏 10.9562386728
+常例 10.3743171274
+杨伟 11.4157710022
+钩针 11.4157710022
+十分 4.86302538783
+败退 9.30555780184
+雅尼 13.900677652
+荒无人烟 10.765183436
+顾大章 12.1089181827
+耳语 9.20932976975
+梁庄 13.2075304714
+直肠癌 10.4994802703
+林下鸣 13.2075304714
+全立交 13.900677652
+瘤牛 11.4157710022
+黑影 8.6803218269
+马寅初 11.7034530746
+售票口 12.2912397395
+贾树三 12.5143832909
+四物汤 11.4157710022
+做菜 10.7226238216
+客源地 13.2075304714
+任三司 12.1089181827
+一万两千 13.900677652
+老古董 11.0674643079
+不太能 12.8020653633
+儒门 13.900677652
+喧噪 12.5143832909
+喧器 13.900677652
+宋江忙 12.5143832909
+国际共管 12.5143832909
+柯赫 12.8020653633
+迷着 13.2075304714
+林毅夫 11.8212361103
+陈建斌 12.5143832909
+三十六七岁 13.2075304714
+迥异 9.24671730182
+搭伴 11.8212361103
+毒妇 13.2075304714
+日升昌 13.900677652
+穆萨 11.3357282945
+身受 10.0294766411
+三十四岁 12.5143832909
+雅山 13.2075304714
+群众斗争 11.4157710022
+俺们 8.52078029844
+成问题 10.3171587135
+必要条件 8.9102450652
+影视制作 10.9562386728
+黑德 11.598092559
+台子上 10.3743171274
+怀玉 13.900677652
+迷瞪 11.5027823792
+焦思 12.5143832909
+安仁 11.8212361103
+小蜻蜓 13.900677652
+喧嚣 9.29550746599
+冠军级 13.900677652
+马上摇 13.900677652
+枣椰树 12.8020653633
+丢下 8.30225569298
+凹下 11.3357282945
+常伏 13.2075304714
+黑得 9.74179456862
+压寨 13.900677652
+杨侑 12.5143832909
+终身制 10.9562386728
+杨侗 12.8020653633
+常会 9.4233408375
+外向型 9.54396882529
+一程子 11.8212361103
+修读 13.2075304714
+宋江开 12.2912397395
+裕隆 10.642581114
+看得远 11.598092559
+兰开斯特 10.4666904475
+迫不急待 12.5143832909
+汪昱庭 13.2075304714
+场部 12.2912397395
+不法者 12.8020653633
+周仆皱 13.2075304714
+易燃物品 13.900677652
+外贸逆差 13.2075304714
+哪一只 12.1089181827
+杨修 11.8212361103
+皮鞋油 13.900677652
+数字式 9.96885201925
+杨信 12.8020653633
+锁相环 12.5143832909
+奉养 10.8096351986
+共通性 13.900677652
+政策性 8.56795885871
+阖家幸福 13.900677652
+修订 7.51043698491
+杨俊 12.5143832909
+大豆价格 9.82314020807
+七段 12.5143832909
+女装品牌 13.2075304714
+班封疆 13.2075304714
+之欢 11.5027823792
+至行 12.8020653633
+瘾头 11.8212361103
+史无前例 9.62401153296
+义安 12.2912397395
+大雄宝殿 9.93038573842
+垃圾邮件 11.5027823792
+霸县 11.4157710022
+宫颈炎 11.1280889297
+义宁 11.3357282945
+要求归还 12.5143832909
+审读 11.7034530746
+电子手表 11.8212361103
+败露 9.61021821083
+鹅岭 12.5143832909
+洛卡泰 13.900677652
+二三十里 11.3357282945
+劳动密集型 9.30555780184
+江河湖海 10.765183436
+烂死 13.900677652
+部件是否 12.5143832909
+做庄 12.5143832909
+积极分子 10.3743171274
+任免权 11.9547675029
+刑事责任 9.19114745066
+德兴铜矿 12.1089181827
+官能 10.9049453784
+落籍 11.3357282945
+中医药学会 13.900677652
+穆荫 12.1089181827
+卡桑 12.8020653633
+通俗读物 11.7034530746
+该不该 9.05649056552
+喷着气 13.2075304714
+还能 6.34059718695
+匀浆 13.2075304714
+给与 9.43476953332
+开脱罪责 11.7034530746
+场面 7.38448457593
+猫叫声 12.2912397395
+燕桓侯 12.8020653633
+师范毕业 12.5143832909
+岳贞黎 10.1630080337
+贾桢 13.2075304714
+哈密市 11.5027823792
+蹀躞 11.9547675029
+卑下 10.9049453784
+物理学奖 11.9547675029
+风貌 8.96620371885
+黑塔 10.9562386728
+马腾之 13.2075304714
+之欲 12.2912397395
+资产 5.04159833409
+官股 11.1926274509
+二十五艘 13.2075304714
+黑塞 12.8020653633
+紫荆 10.9049453784
+社子 13.900677652
+十六强 12.5143832909
+暴敛横征 13.900677652
+交汇点 10.9562386728
+计算技术 10.4041700905
+许皇后 12.8020653633
+权继立 12.8020653633
+补习班 11.3357282945
+雅安 10.2897597393
+碰碰车 12.8020653633
+官职 7.85094419674
+塞思黑 12.8020653633
+侯德耀 11.598092559
+给付 9.49395840471
+鲸油 12.2912397395
+比尔斯 12.1089181827
+尘缘 10.642581114
+游山玩水 11.3357282945
+邱清泉 12.1089181827
+黑墨 12.2912397395
+拜别 10.4041700905
+三江五湖 13.900677652
+自然选择 9.63799777493
+达迪耶 12.8020653633
+阿维菌素 12.8020653633
+天工开物 10.5684731418
+铜墙铁壁 10.5684731418
+举了 13.900677652
+方能保 13.900677652
+蒙逊灭 12.8020653633
+小心眼 11.1926274509
+一星级 13.2075304714
+基因库 11.3357282945
+行凶后 12.5143832909
+元大德 11.5027823792
+给予 6.149632534
+遇难者 10.3743171274
+义子 10.2630914922
+霸占 9.36807815882
+风谣 12.8020653633
+发动群众 9.80633308975
+斜土路 13.900677652
+饶阳 11.8212361103
+德索托 13.900677652
+楼适夷 12.5143832909
+旅差费 13.2075304714
+谦逊有礼 13.2075304714
+才能救 11.8212361103
+讪笑 10.765183436
+军兵种 10.3171587135
+资中 11.0103058941
+绿毛 10.9562386728
+美国航空公司 12.8020653633
+启用 8.77671367257
+一九九六年 13.900677652
+吻遍 12.5143832909
+唐僧推 13.2075304714
+颠沛流离 10.642581114
+手痒 11.1280889297
+众人拾柴火焰高 13.900677652
+炸飞 11.8212361103
+张静初 12.5143832909
+齐康公 13.2075304714
+嘈嘈切切 13.2075304714
+售票员 10.2630914922
+滤网 12.1089181827
+草料 9.40086798165
+偷鸡盗狗 12.8020653633
+史湘云偶 13.2075304714
+黑头 10.4041700905
+金脉 11.2616203224
+雕塑品 12.5143832909
+唐僧才 12.5143832909
+撵跑 12.8020653633
+生育权 13.900677652
+悲歌 10.9049453784
+田挥 13.2075304714
+母虎 12.8020653633
+遗物 8.40761620864
+滤纸 11.4157710022
+牛耕田 12.8020653633
+败阵 9.85762638414
+晏然 13.2075304714
+马德伦 10.8561552143
+内蒙古大学 12.2912397395
+手球 11.1926274509
+导火线 10.0720362555
+克维尔 13.2075304714
+并行处理技术 12.8020653633
+黑夜 8.15767446417
+除草剂 9.58318953844
+资信 9.30555780184
+委员长 8.65893063692
+利萨拉 13.900677652
+确认函 12.8020653633
+橡胶草 12.5143832909
+四十一位 13.2075304714
+猥琐 11.0103058941
+修起 10.8561552143
+收复失地 9.65218240993
+长期有效 11.4157710022
+产品组合 11.1926274509
+黑奴 9.91169360541
+网络计算机 11.9547675029
+八角楼 13.2075304714
+何爱 13.900677652
+风趣 9.62401153296
+摔痛 13.900677652
+场院 11.1926274509
+官费 11.9547675029
+生育期 10.4994802703
+新一佳 13.2075304714
+似可 12.2912397395
+任天民 13.900677652
+钱袋子 10.3743171274
+萨嘎县 13.900677652
+西哀士 12.1089181827
+烫面 12.8020653633
+胡玉昆 13.2075304714
+信者 11.7034530746
+努乔马 13.2075304714
+杓子 12.8020653633
+修贤 13.900677652
+同甘共苦 10.5684731418
+收复失土 12.8020653633
+李古壁 11.7034530746
+国际纵队 11.598092559
+建始县 13.900677652
+宣城市 12.1089181827
+闵可夫 13.2075304714
+雅婷 11.7034530746
+疫病 9.75754292558
+有慈石 13.900677652
+班张迪 11.598092559
+报上去 11.9547675029
+还原型 13.900677652
+御弟 9.84023464143
+二刀 13.900677652
+郁郁葱葱 10.1871055853
+无可替代 11.8212361103
+怀疑 6.56700125632
+背景噪声 11.8212361103
+刑余之人 13.900677652
+怀疚 13.900677652
+江河湖泊 10.5684731418
+转圈圈 11.8212361103
+三百六十行 11.4157710022
+朱诺 12.5143832909
+抱负不凡 12.8020653633
+看得见 8.93783302172
+染色牢度 13.900677652
+宋江夜 13.900677652
+修路 9.85762638414
+宋降军 13.2075304714
+十五头 12.8020653633
+撵走 10.604840786
+黑妞 11.1280889297
+神兵天将 13.900677652
+对话体 11.7034530746
+离子交换 9.59661255877
+宋江复 13.2075304714
+扣回 13.900677652
+益虫 11.0103058941
+冷血动物 11.598092559
+唐僧拿 12.1089181827
+分理处 11.3357282945
+巴布尔 10.9562386728
+宋江备 12.5143832909
+自由港 10.0940151622
+放射出 10.6818018271
+吓出病来 13.900677652
+擂鼓台 12.2912397395
+王云龙 13.900677652
+非法 7.41451686303
+迷你裙 12.8020653633
+心中有鬼 11.8212361103
+标准大气压 11.3357282945
+国资局 11.9547675029
+服务中心 8.93783302172
+表皮原 13.900677652
+凭祥 11.0103058941
+交通流量 11.8212361103
+疫疠 11.598092559
+长毛兔 12.1089181827
+社会保险费 11.598092559
+杜英 12.1089181827
+广道御 13.2075304714
+凭票 12.5143832909
+柑橘园 12.8020653633
+观赏用 11.3357282945
+万佛寺 13.900677652
+宋江奏 13.2075304714
+广告网 12.8020653633
+疫疹 13.900677652
+寅时 11.3357282945
+筠连 12.8020653633
+将军级 13.2075304714
+浙江人 11.1926274509
+尖细 10.4666904475
+防城港市 12.5143832909
+半吞半吐 13.900677652
+罪不可逭 13.900677652
+观察敏锐 13.900677652
+严阻 13.2075304714
+严阵 7.9526426628
+塞努福 12.5143832909
+手眼 11.598092559
+难题 7.41299363349
+溴化钾 12.1089181827
+重责 10.1630080337
+严密控制 12.5143832909
+噎住 9.75754292558
+影画 13.900677652
+大笑一声 13.2075304714
+镇星 11.7034530746
+多姿多采 13.900677652
+人挪活 13.900677652
+溴化钠 12.8020653633
+杨诚刚 12.5143832909
+浮生六记 12.2912397395
+剧烈地 9.7898037878
+想想也是 10.604840786
+国际电信 13.900677652
+明叔讲 12.5143832909
+献身精神 11.1280889297
+内顾之忧 12.8020653633
+火爆爆 12.1089181827
+不足为据 12.8020653633
+八万元 13.2075304714
+场长 11.0103058941
+研究者 9.05649056552
+曹操 6.73055810853
+阮小 13.2075304714
+耕莘 13.900677652
+多见于 8.39534611604
+尺牍 11.3357282945
+波萨里 13.900677652
+惠而不费 13.2075304714
+称得起 11.8212361103
+溴化银 11.598092559
+马萨诸塞 10.3453295905
+弥勒佛 10.4041700905
+伊于胡底 13.900677652
+孔泉 11.5027823792
+斯特若 12.8020653633
+题上去 13.900677652
+物理学家 7.78921031247
+斩除 12.8020653633
+安住 12.2912397395
+采矿场 12.5143832909
+抗肿瘤 10.604840786
+筋骨 9.09665660724
+非常感谢 10.3743171274
+罗掘 13.900677652
+秦广王 11.9547675029
+第四行 13.900677652
+河中府 11.7034530746
+规定量 13.900677652
+草明 13.900677652
+胡传奎 13.900677652
+春意闹 12.8020653633
+进取之心 13.2075304714
+长青树 13.900677652
+希腊共产党 11.8212361103
+变压器 8.57280148319
+钢铁产业 9.40086798165
+种种原因 9.23723855786
+出谋画策 13.900677652
+义夫 12.5143832909
+为题 9.36807815882
+非有不可 13.2075304714
+巢材 13.2075304714
+宋至明 12.2912397395
+导火索 9.35738286971
+国防医学 13.900677652
+周子旺 13.2075304714
+悬崖绝壁 10.533381822
+难顾 11.8212361103
+官舍 11.9547675029
+加进去 11.4157710022
+雅姆 12.8020653633
+痘浆 13.900677652
+网鱼 12.8020653633
+自由派 10.2371160058
+奉告 10.765183436
+难以预料 10.4041700905
+厂商会 12.5143832909
+和顺 9.96885201925
+慌手慌脚 11.8212361103
+苦修 11.1926274509
+姑且 9.58318953844
+沈莹 13.2075304714
+绕指柔肠 13.2075304714
+修身 10.0720362555
+奉命 7.79365476423
+儒道 10.6818018271
+当权者 10.2630914922
+俄罗斯联邦 9.41204128224
+义女 10.0294766411
+照下去 13.900677652
+如虎生翼 12.5143832909
+高斯密 13.900677652
+官船 10.7226238216
+金纹工 12.8020653633
+吴起死 13.2075304714
+苏里亚 11.8212361103
+雕镂 11.1926274509
+凭空 9.32596667347
+十六届 10.604840786
+草果 12.5143832909
+预先规定 11.5027823792
+衣扣 10.8096351986
+苦主 10.4349417492
+散兵游勇 11.0674643079
+雅堂 12.5143832909
+丁伟志 12.5143832909
+一诺千金 12.1089181827
+悬崖峭壁 9.74179456862
+杭运道 13.2075304714
+叫起 10.642581114
+专卖店 9.36807815882
+怄气 10.8561552143
+自由泳 10.7226238216
+具体说来 11.7034530746
+落网 10.4041700905
+延津记 10.6818018271
+观赏石 13.900677652
+出水管 12.8020653633
+广东省文联 13.2075304714
+绿树 9.7898037878
+那锦鳞 12.1089181827
+严霜 11.2616203224
+七言绝句 10.765183436
+傻劲儿 11.8212361103
+司正 13.900677652
+段距离 11.5027823792
+经院哲学 9.98865464655
+手癣 12.2912397395
+智真长老 11.1926274509
+李二人 11.9547675029
+立义海 13.2075304714
+悠悠荡荡 12.2912397395
+仿膳 12.1089181827
+华东野战军 9.98865464655
+镜泊湖 10.0720362555
+听得懂 10.3171587135
+唐僧怒 13.2075304714
+丢钱 11.9547675029
+阿勒萨尼 13.2075304714
+首屈一指 9.5062284973
+曹丕代 11.3357282945
+张昭远 12.5143832909
+体力活 11.598092559
+杆式 11.1280889297
+苦乐 10.8096351986
+黑子 9.85762638414
+耳边 7.77599426108
+穆耳 13.900677652
+不违农时 13.2075304714
+峰头 11.5027823792
+黑字 11.1926274509
+升降车 13.900677652
+哪一块 11.9547675029
+三家店 12.2912397395
+柯西 10.0720362555
+义士 9.20019728618
+好几公里 13.900677652
+富可敌国 10.9562386728
+南仁 13.2075304714
+节目组 13.2075304714
+量贩式 13.900677652
+发育不良 10.1630080337
+高丽布 13.900677652
+风轮 11.8212361103
+损失量 12.8020653633
+不予理睬 11.1926274509
+苦人 12.5143832909
+妙舞 13.900677652
+灶马 13.900677652
+风车 10.1871055853
+减毒疫苗 13.900677652
+金桂华 12.5143832909
+黑客 10.604840786
+产生器 11.7034530746
+明体达 13.900677652
+添加物 12.1089181827
+剔除 7.75434839431
+检察干警 13.900677652
+观众席 10.2630914922
+匀溜 13.900677652
+上海南京东路 13.2075304714
+再生力 11.8212361103
+拜服 11.1280889297
+插起来 13.900677652
+上海县 10.8096351986
+库存现金 12.8020653633
+草木 8.61747392324
+耳软 12.8020653633
+耳轮 11.8212361103
+杀身成仁 11.3357282945
+单聘仁 12.8020653633
+钱物 10.0505300503
+竖直 10.7226238216
+为首 6.76339921472
+苦事 12.8020653633
+苦于 9.24671730182
+衣披 13.900677652
+催情剂 12.1089181827
+水泥袋 13.900677652
+恩爱 9.75754292558
+单台静 12.5143832909
+自斟 12.1089181827
+进给量 12.8020653633
+一水之隔 12.8020653633
+修辞 9.77354326693
+禁渔期 13.900677652
+手相 11.9547675029
+溴化镁 13.900677652
+玉米螟 11.9547675029
+雅士 12.5143832909
+义塾 12.2912397395
+明十三陵 10.6818018271
+缠绕茎 12.8020653633
+芝麻小事 13.900677652
+刘敬往 13.2075304714
+踌躇 8.34384959028
+卡塔尔 9.58318953844
+数百万人次 12.2912397395
+莱伯 13.900677652
+梅香菊 13.2075304714
+洗澡盆 12.2912397395
+喝过 9.69598503258
+细胞周期 11.5027823792
+克隆 10.0940151622
+自由民 9.75754292558
+作文法 13.900677652
+灶门 13.900677652
+碳酸岩 11.598092559
+很着急 10.642581114
+杜公祠 13.2075304714
+天文地理 11.5027823792
+赵云挺 12.2912397395
+灶间 10.3171587135
+风能 8.92394390956
+耳背 11.8212361103
+以及人之老 13.2075304714
+痴情 9.72629038208
+陇上 11.5027823792
+新型材料 11.1280889297
+蛛网膜 10.9562386728
+痴想 11.9547675029
+信赏 12.8020653633
+间通信 12.8020653633
+问安 9.74179456862
+轰轰烈烈 8.83808261895
+一腔热血 11.1926274509
+咏志 12.2912397395
+扣子 9.61021821083
+拼命三郎 11.3357282945
+寻花问柳 11.5027823792
+十六卷 11.2616203224
+巷战 10.0294766411
+伞齿轮 12.2912397395
+竹牌 12.2912397395
+误人子弟 12.1089181827
+十口 11.7034530746
+司空见惯 9.94943393339
+启禀 8.62767809341
+草棉 12.2912397395
+布林克 12.8020653633
+地热异常 13.2075304714
+梅尔卡 13.900677652
+信贷 5.81951187425
+绿杨 11.8212361103
+劳动资料 8.53470163695
+欠收自补 13.900677652
+锡箔纸 13.2075304714
+未备案 11.5027823792
+弗之叹 11.9547675029
+十二皮部 12.8020653633
+矩阵式 13.2075304714
+华虹 13.2075304714
+关索李 12.2912397395
+俸禄 8.90346537821
+毒力 11.1926274509
+责任者 11.4157710022
+山之西 12.8020653633
+旅馆老板 13.900677652
+尖点 12.8020653633
+沉伦 13.900677652
+第九版 12.8020653633
+霎那之间 13.900677652
+感触良多 13.900677652
+七死八活 13.2075304714
+定装 12.5143832909
+所在地 7.33823355828
+金属品 12.5143832909
+压碎 11.0103058941
+优质产品 10.9049453784
+为难 7.80710788193
+市镇 9.05649056552
+不合规律 12.5143832909
+痴恋 13.2075304714
+淫辱 13.900677652
+毒副 13.2075304714
+西太平洋地区 12.1089181827
+草标 13.2075304714
+草根 9.5186510173
+绿枝 12.2912397395
+十六只 13.900677652
+识时务者 13.900677652
+胡宗宪 12.1089181827
+绿林 9.31571017331
+十六口 13.2075304714
+约化质量 13.900677652
+严颜 10.765183436
+焉耆回族 13.900677652
+炮击 9.77354326693
+味精厂 12.8020653633
+捐助国 13.900677652
+毒剂 10.0505300503
+根腐病 12.2912397395
+穆迪 9.04864738806
+焦挺 10.8561552143
+陇亩 12.1089181827
+砍上去 13.2075304714
+货运业 13.2075304714
+高科技 8.11378027061
+宣城县 12.8020653633
+杜远 13.900677652
+绿柳 10.9562386728
+包退 13.2075304714
+毒刺 10.2117981979
+径流 8.0484751722
+第六十三条 13.2075304714
+饮酒者 11.7034530746
+芝加哥大学 9.04864738806
+醴泉 11.5027823792
+黑哨 11.8212361103
+隆重 8.03420959504
+古比 13.900677652
+广告片 10.7226238216
+做表 13.900677652
+毒刑 12.5143832909
+令狐楚继 13.2075304714
+广告牌 10.4349417492
+质疑 7.09053520186
+迷糊 9.61021821083
+马卡科 13.2075304714
+点头咂嘴 13.900677652
+大局意识 10.8096351986
+宋江告 12.5143832909
+启示 8.28754954559
+陈留南 13.2075304714
+敢怒而不敢言 11.7034530746
+老大姐 12.2912397395
+光谱分析 9.89334446674
+法外施恩 12.5143832909
+怠慢 8.39128931535
+包里 8.98802276624
+跷着 11.1280889297
+蜂皇浆 13.900677652
+张继诗 13.900677652
+定襄 10.2630914922
+撙节 13.2075304714
+尺素 13.2075304714
+穆罕默 12.2912397395
+奉安 13.2075304714
+奉守 13.900677652
+落照 13.2075304714
+不象 7.91926344072
+南方航空公司 12.8020653633
+包金 11.3357282945
+巨大变化 9.5062284973
+周谷城 10.8096351986
+宋江喝 12.8020653633
+官路 10.9562386728
+万多光年 13.2075304714
+白茅根 11.4157710022
+国文 9.80633308975
+炸锅 13.900677652
+定西 11.0103058941
+戴天恩 13.900677652
+元圣政 13.2075304714
+葬身火海 13.2075304714
+孙尚书 13.900677652
+所在国 10.4994802703
+耳膜 10.2897597393
+自弹自唱 10.533381822
+巴克里 13.900677652
+牵起来 13.900677652
+麻醉学 13.900677652
+岔路 9.71102290995
+沉下 9.66657114738
+贾敬 11.4157710022
+超重型 12.1089181827
+食品行业 10.3743171274
+鸣音 11.598092559
+盖世之 13.900677652
+天地万物 9.98865464655
+中空玻璃 10.9562386728
+杆儿 11.3357282945
+抗日红军大学 11.4157710022
+白齐文 12.8020653633
+独眼龙 10.2897597393
+中国地质大学 11.9547675029
+皇天后土 11.1280889297
+贾敏 12.8020653633
+衣民 12.5143832909
+有碍观瞻 11.9547675029
+珠胎暗结 13.900677652
+购物袋 11.1926274509
+尹氏 12.5143832909
+定规 10.9562386728
+烘托出 11.8212361103
+胱氨酸 12.1089181827
+茅檐 12.8020653633
+定见 11.3357282945
+牛子 12.5143832909
+恍然 8.99540287354
+行列式 10.642581114
+硫酸亚铁 11.3357282945
+贾斯 13.2075304714
+必修课程 11.7034530746
+中国乒乓球队 13.900677652
+古昔斋 13.2075304714
+售票处 12.1089181827
+开发工具 11.7034530746
+墨西拿 11.0674643079
+阿德雷 12.5143832909
+递送 10.533381822
+瞬时速度 11.8212361103
+惹是招非 13.900677652
+出国深造 12.2912397395
+贾文 13.2075304714
+探悉 12.8020653633
+和面 11.3357282945
+金之议 13.2075304714
+爱耳日 13.900677652
+侯封伯 11.9547675029
+之比 8.4284069783
+沉井 12.5143832909
+定要 8.9102450652
+痴意 12.8020653633
+殷商余 12.8020653633
+罗如望 13.2075304714
+比尔森 12.5143832909
+精细管 13.2075304714
+北湖园 13.2075304714
+级差 10.8096351986
+雅园 11.0103058941
+一万户 12.8020653633
+准据法 10.765183436
+卡德洛 13.2075304714
+藁城市 13.900677652
+弄鬼弄神 13.900677652
+盲人摸象 12.2912397395
+浪漫气息 11.1926274509
+披头 13.900677652
+空腔子 13.2075304714
+海岛棉 11.3357282945
+女店员 12.2912397395
+滩羊 10.8096351986
+狮子鼻 12.8020653633
+扛起来 11.9547675029
+大笑一场 13.2075304714
+土耳其 7.42987814819
+陈情表 13.900677652
+奥克兰港 13.900677652
+挂下来 11.4157710022
+春分点 10.8096351986
+表皮层 10.9049453784
+决不 7.02235118368
+十六元 13.900677652
+弗拉迪 12.8020653633
+段小楼 13.900677652
+共蒸发 13.900677652
+互相监督 11.0103058941
+掴了 11.9547675029
+脊椎骨 10.642581114
+汽车空调 13.2075304714
+造福一方 11.8212361103
+艾遂 12.8020653633
+王辅仁 11.3357282945
+巡回展 12.5143832909
+籍占田 13.2075304714
+连秀春 13.2075304714
+关机时 12.8020653633
+叶连娜 13.900677652
+铁公鸡 11.0674643079
+鸣钟 11.1280889297
+观众厅 12.2912397395
+手笔 9.6811699468
+冷脸 11.598092559
+洪仁 11.5027823792
+升降舵 11.1280889297
+血崩 13.2075304714
+国旗 8.08356649201
+盲校 13.2075304714
+杆刀 12.2912397395
+可获 9.93038573842
+洪亮 9.18217878068
+塞舌尔 10.1394775363
+音位 10.6818018271
+宋江因 11.5027823792
+奏鸣曲 9.77354326693
+羧化酶 12.8020653633
+毒品走私 12.1089181827
+滩簧 12.2912397395
+描写出 12.5143832909
+贝瑞特 13.2075304714
+宋江四 13.2075304714
+十区 13.900677652
+太阳辐射 9.14708746087
+飞毛腿 10.765183436
+红玛瑙 11.5027823792
+修船 10.4666904475
+涂祯刊 13.2075304714
+霸州 10.2117981979
+言蜀兵 12.5143832909
+影票 11.9547675029
+祝玮 13.2075304714
+雕塑家 9.77354326693
+牌照 8.80081122415
+张镇芳 12.8020653633
+祖总栈 13.2075304714
+十千 13.900677652
+乌菲齐 12.2912397395
+摇摇晃晃 8.99540287354
+尖牙 11.9547675029
+外贸出口 9.55687223012
+焦得布 12.8020653633
+含恨而死 13.900677652
+救命草 12.5143832909
+总体规划 9.32596667347
+乍看之下 13.2075304714
+知我罪我 13.2075304714
+平平静静 10.9049453784
+场馆 10.0940151622
+网通 11.0674643079
+短途运输 10.9049453784
+卡塔克 12.8020653633
+网速 13.2075304714
+那丫头 10.2897597393
+抵得住 12.5143832909
+有道是 9.72629038208
+正兵 11.2616203224
+全省各地 10.0294766411
+鄢陵侯 12.8020653633
+勒住 9.36807815882
+高斯型 13.2075304714
+彻体力 13.2075304714
+白暨豚 12.5143832909
+四排 13.900677652
+钢骨 13.2075304714
+计算机科学 9.75754292558
+烧结机 13.2075304714
+汉哀帝 12.8020653633
+奇袭战术 13.900677652
+柯蓝 13.900677652
+乌孙人 11.9547675029
+慧禅师 12.8020653633
+炸雷 9.85762638414
+信达 8.50705010562
+昭披耶河 13.2075304714
+洪业 12.8020653633
+怅怅然 12.5143832909
+柴火垛 11.9547675029
+陈建民 12.8020653633
+消息来源 10.0294766411
+音信 9.58318953844
+赫比格 12.5143832909
+黑地 10.9562386728
+聚合反应 10.3743171274
+国资办 13.900677652
+格兰德河 10.604840786
+曹魏初 11.5027823792
+雅各 9.96885201925
+冰情 11.1280889297
+童年期 12.5143832909
+随同前往 12.1089181827
+足月儿 13.900677652
+勒令 9.58318953844
+精敏 13.900677652
+包豪斯 11.4157710022
+猴儿精 13.2075304714
+棉花胎 13.2075304714
+哀兵必胜 12.8020653633
+官运 10.9049453784
+耳听八方 11.5027823792
+手稿 8.89004235788
+省时省力 12.8020653633
+王朱权 13.900677652
+牛僧孺 11.8212361103
+由福王 12.8020653633
+文山州 11.9547675029
+马尼托巴省 12.5143832909
+迎春曲 12.8020653633
+表示感谢 9.63799777493
+黑土 9.7898037878
+萌蘖 11.7034530746
+开户银行 12.1089181827
+凯科 12.5143832909
+多发性 9.75754292558
+禄俸散 12.8020653633
+函授 11.1280889297
+百分之五十 10.2371160058
+难闻 9.72629038208
+直达快车 13.900677652
+元军平 13.2075304714
+音乐 6.62966911369
+臭哄哄 13.900677652
+逆之者亡 13.900677652
+音义 11.0103058941
+国字号 10.9562386728
+剔骨 11.1926274509
+核外电子 11.1926274509
+噶尔丹 10.3171587135
+马克思列宁主义者 13.2075304714
+诉求 9.01032852375
+大字典 11.0103058941
+老冬子 10.4041700905
+郁抑 13.900677652
+穆天子 11.1926274509
+妙莲 13.900677652
+长崎县 11.7034530746
+十八双 13.900677652
+埃维昂 11.9547675029
+鹿皮鞋 13.2075304714
+商贸城 10.533381822
+任国民 10.642581114
+再造之恩 12.8020653633
+才气横溢 12.5143832909
+五华县 13.900677652
+杜倍雷 13.900677652
+鸣锣 9.4233408375
+迁怒于人 13.2075304714
+质直 12.2912397395
+童年时代 11.4157710022
+残废人 11.2616203224
+文坛领袖 13.2075304714
+篱下 13.900677652
+六百户 13.900677652
+定语 12.1089181827
+斯坦因 10.9049453784
+三十四员 13.2075304714
+克已复礼 13.900677652
+扶丁军 13.900677652
+徐曰彪 12.8020653633
+三门峡水库 11.7034530746
+质监 10.533381822
+一腔热诚 13.900677652
+贾林 12.2912397395
+奉天 8.62767809341
+大田庄 12.2912397395
+官轿 11.0674643079
+电影胶片 11.3357282945
+定说 12.5143832909
+何先生 10.2897597393
+刘敬叔 13.900677652
+富连成 12.8020653633
+准备考 13.2075304714
+大地测量 9.59661255877
+启程 8.59737274392
+凭着 7.87965430263
+榴梿 13.900677652
+自由性 13.2075304714
+尽可能少 11.1280889297
+危亦林 12.5143832909
+南加利福尼亚大学 11.9547675029
+诊断法 13.2075304714
+硝烟弥漫 10.4041700905
+吉尼斯 11.7034530746
+始料 12.1089181827
+武装挑衅 11.9547675029
+宋江坚 12.1089181827
+宫之主 11.4157710022
+要作到 13.900677652
+高旷 11.9547675029
+贾某 11.5027823792
+不谙 10.533381822
+风范 9.63799777493
+定计 10.0940151622
+自由态 12.5143832909
+揭起 9.48183704418
+定论 8.59240995457
+梦仙 12.2912397395
+鹅卵 12.5143832909
+一步登天 10.3453295905
+唐僧治 13.900677652
+黑城 11.1280889297
+叶清入 13.2075304714
+多发期 12.2912397395
+手紧 11.7034530746
+鸣銮 13.900677652
+隆重开幕 11.1926274509
+水利部门 12.2912397395
+六百斤 12.5143832909
+电脑主机 12.8020653633
+一呼百应 10.4349417492
+食品保藏 12.2912397395
+文武双全 11.0103058941
+耳垂 10.4994802703
+闯下 11.7034530746
+软指标 13.2075304714
+雅化 12.5143832909
+渠道商 11.598092559
+喧天 10.4666904475
+前人 8.21031819765
+周礼 8.64840422393
+义县 10.4349417492
+庶民 9.34680076038
+任立 12.8020653633
+前事 9.77354326693
+六百文 12.5143832909
+鸦雀 12.1089181827
+不迭 9.43476953332
+修葺 9.72629038208
+渡江战役 10.1630080337
+包银 11.4157710022
+前些 9.11318590919
+软件测试 13.2075304714
+纲维 13.2075304714
+二把手 11.1926274509
+采锡 12.5143832909
+前代 8.83808261895
+官袍 9.82314020807
+电脑主板 13.900677652
+生拉硬拽 12.1089181827
+粒粒皆辛苦 12.1089181827
+负有责任 10.8561552143
+秘密性 13.2075304714
+定调 8.26946587015
+前件 12.8020653633
+酒瓶盖 12.8020653633
+梅园新村 12.8020653633
+采矿工 13.900677652
+低价位 9.96885201925
+官仓 11.9547675029
+第四节 9.94943393339
+前任 8.98802276624
+估价 9.28555713513
+幸淮危 12.5143832909
+前仇 13.2075304714
+政治学系 12.1089181827
+二十九件 13.900677652
+蓄电量 13.900677652
+二十九任 13.2075304714
+晃荡 10.6818018271
+破烂王 12.5143832909
+相貌端正 12.2912397395
+包钢 9.17328983326
+筋道 11.9547675029
+官客 12.8020653633
+匀整 11.7034530746
+落地有声 13.900677652
+残缺不全 9.96885201925
+多付 10.9562386728
+咸度 13.900677652
+整体收缩 13.2075304714
+后勤保障 9.40086798165
+保护装置 11.2616203224
+达达兰 13.2075304714
+所在区 12.5143832909
+原生态 11.2616203224
+两亿七千万 13.2075304714
+第四艘 12.2912397395
+草民 11.4157710022
+征文活动 12.8020653633
+一摸之下 13.2075304714
+外柔内刚 12.1089181827
+三十四卷 13.2075304714
+龇牙 11.9547675029
+前个 13.900677652
+红情 9.18217878068
+向云中 12.5143832909
+官衙 10.2630914922
+履险若夷 13.900677652
+内外科 12.2912397395
+贪小便宜 11.9547675029
+四五十处 13.900677652
+稳定人心 12.2912397395
+商业学校 11.5027823792
+共产国际 8.81927328699
+连凤姐 13.2075304714
+致候 13.900677652
+自由权 11.1280889297
+一妻多夫 11.598092559
+折受 12.8020653633
+柏慧 9.93038573842
+白玉圭 11.7034530746
+前世 9.32596667347
+写意画 11.8212361103
+荣禄会 13.900677652
+银海 13.900677652
+一万条 12.5143832909
+二十九个 12.2912397395
+钱票 12.8020653633
+美洲国家组织 10.9562386728
+怀才不遇 10.5684731418
+杜诗 10.8096351986
+昂头 10.8096351986
+梅里美 11.7034530746
+周郊 12.2912397395
+碲化镉 12.5143832909
+于龙朔 13.2075304714
+义卖 10.8561552143
+明朱权 12.5143832909
+临武县 13.900677652
+强劲 6.20038244856
+基因图 13.900677652
+冤有头 11.5027823792
+民族英雄 8.99540287354
+嵌套循环 12.2912397395
+马卡洛 13.900677652
+伊拉克政府 11.7034530746
+戳戳 10.9562386728
+官家 7.38744754106
+消极面 12.2912397395
+原种 11.4157710022
+山水情 13.900677652
+书写 8.05135287203
+南仲 11.3357282945
+雅号 11.1280889297
+辣椒粉 12.8020653633
+韩非子 9.82314020807
+折叠 8.6966709649
+陈派 12.8020653633
+前侧 10.5684731418
+外胚层 10.642581114
+维埃拉 11.4157710022
+淳于越 11.8212361103
+董彰 13.900677652
+刻意求精 12.5143832909
+太宗闻 11.7034530746
+臂臑 13.900677652
+第四十一条 13.900677652
+伯尔特 13.2075304714
+十数辆 13.900677652
+多臂机 12.8020653633
+怀素 10.9562386728
+侍疾 11.7034530746
+雅利 13.900677652
+电力工业 9.11318590919
+荡过 12.8020653633
+延绵不断 13.900677652
+郭祥义 12.1089181827
+二百八十 11.7034530746
+翻个儿 13.2075304714
+前例 11.7034530746
+汗血 12.1089181827
+网页快照 13.900677652
+宋江再 11.598092559
+明叔背 13.2075304714
+义务 6.86628972206
+包间 10.8096351986
+天峨 13.2075304714
+严白虎 12.2912397395
+平浙西 13.2075304714
+婆罗洲 10.6818018271
+书内 12.5143832909
+建和 13.900677652
+容错性 13.900677652
+贮藏量 12.2912397395
+臂膀 10.0940151622
+短促 8.88339781516
+鲍勒尔 13.900677652
+小秦淮 11.4157710022
+臂膊 10.642581114
+现成活 13.900677652
+辣椒素 12.2912397395
+萌动 10.9049453784
+提上去 12.2912397395
+炸酱 13.2075304714
+警戒线 9.33632946051
+多件 9.61021821083
+义勇 9.74179456862
+马笼头 12.5143832909
+定购 10.3743171274
+多价 12.1089181827
+短信 8.43684584695
+地下水位 9.48183704418
+书册 11.8212361103
+基本电荷 13.900677652
+定货 10.7226238216
+大衍历 11.5027823792
+定责 13.900677652
+敌后 8.9519177616
+蒙眬 11.8212361103
+一百二十多个 13.2075304714
+梅益论 13.900677652
+特地来 10.4349417492
+黑光 13.900677652
+司徒王朗 12.8020653633
+采掘业 9.32596667347
+古珊瑚 13.2075304714
+不知为不知 12.8020653633
+拖着 10.9562386728
+硅钢片 11.4157710022
+史称申 12.8020653633
+前传 12.1089181827
+军宣队 13.2075304714
+行业软件 13.2075304714
+上清帝 12.2912397395
+长城电脑 10.6818018271
+橄榄绿色 11.4157710022
+沿海居民 11.1926274509
+赝鼎 13.2075304714
+迷离 9.82314020807
+官子 13.2075304714
+孟菲斯市 13.2075304714
+国故 12.8020653633
+基因型 10.533381822
+杨对望 12.5143832909
+短传 13.900677652
+寒腿 12.2912397395
+闪长岩 11.0674643079
+做账 11.598092559
+识得 9.94943393339
+腾格里沙漠 10.9562386728
+义利 11.4157710022
+心惊胆战 9.98865464655
+不旋踵 13.900677652
+巴基斯坦伊斯兰共和国 12.5143832909
+鲁桥镇 13.2075304714
+疲倦不堪 13.900677652
+白沟镇 12.8020653633
+舞厅舞 11.7034530746
+欠债还钱 13.900677652
+质点 9.22784881751
+罗马尼亚语 11.8212361103
+位密度 13.900677652
+二次世界大战 10.765183436
+阿森松岛 12.1089181827
+二十万具 13.2075304714
+肢骨 11.9547675029
+包销 9.6811699468
+坏主意 11.2616203224
+真棒 12.8020653633
+宋江全 13.2075304714
+高头讲章 13.900677652
+马尔逊 13.900677652
+阿留申 10.1630080337
+诸葛瑾之 12.8020653633
+巴布达 12.8020653633
+非技术 12.8020653633
+勘乱 13.900677652
+不战自败 12.8020653633
+深浅不同 11.598092559
+信袋 12.2912397395
+忙中有错 13.900677652
+科举制 10.3171587135
+草海 10.9049453784
+褐铁矿 11.0103058941
+恢恢 12.2912397395
+宋江先 11.8212361103
+小手指 10.533381822
+集训中心 11.9547675029
+前作 11.598092559
+做起 8.77077893705
+民社党 11.9547675029
+二十万元 12.2912397395
+衣歪 13.900677652
+义军 7.07304841747
+人神共愤 11.598092559
+难以预测 11.4157710022
+女将军 12.8020653633
+锡器 12.2912397395
+粘胶 9.7898037878
+字位 13.2075304714
+寻乌县 12.8020653633
+云长守 12.2912397395
+八百弓 13.900677652
+第四胎 12.8020653633
+一圈圈 10.4349417492
+字体 8.44109213783
+伊利石 11.9547675029
+算清楚 11.7034530746
+常来常往 11.1280889297
+剽窃者 13.900677652
+樟脑油 13.2075304714
+司运 12.5143832909
+宋江劝 13.900677652
+特雷维索 13.900677652
+现代主义 9.46986085313
+思茅地区 11.598092559
+拉德利 13.900677652
+沟壑区 11.5027823792
+绿意 10.0720362555
+杨守素 13.2075304714
+毒品 9.59661255877
+宋隆济 12.1089181827
+供桌 10.533381822
+三千多里 13.2075304714
+极微小 12.5143832909
+雅克 9.94943393339
+斯特凡诺 11.7034530746
+碘缺乏病 13.900677652
+鸣奏 12.8020653633
+哪一年 10.4994802703
+卫生领域 12.8020653633
+司天监 12.1089181827
+掌权人 13.900677652
+公案 9.5062284973
+国有政策 13.900677652
+韩世忠 10.3453295905
+鹿惠氏 12.1089181827
+长途车 11.8212361103
+外接 11.598092559
+钱箱 12.1089181827
+饶鲁 12.8020653633
+西凉李 13.2075304714
+风蚀 9.28555713513
+毒蕈 11.598092559
+宋江勒 13.2075304714
+龙岗区 12.5143832909
+苦处 10.3171587135
+草滩 11.1926274509
+中国人民志愿军 9.44633035572
+一万斤 11.8212361103
+汊港 12.5143832909
+雅典 8.27666014579
+可先来 13.900677652
+报人 11.5027823792
+雅兴 10.8561552143
+洋伞 12.8020653633
+单生枝 11.598092559
+筑室 12.5143832909
+神神经经 13.900677652
+瞥视 13.900677652
+大笑不止 11.9547675029
+安静下来 9.16447920358
+迤逦 9.34680076038
+不可知论 10.4666904475
+跳楼自杀 12.1089181827
+生成物 11.0674643079
+正规军队 11.598092559
+阿德里 13.2075304714
+宋江别 12.8020653633
+炸药包 10.3453295905
+闲儿 13.900677652
+灌迷汤 13.2075304714
+难逢 11.3357282945
+信诺 12.1089181827
+拔除 10.3743171274
+长皱纹 13.900677652
+闭着 9.01787572939
+宋江则 13.2075304714
+无施不可 13.900677652
+江县境 12.8020653633
+撬起 12.8020653633
+心算能力 13.900677652
+宋至清 12.2912397395
+清同治 9.85762638414
+吞灭 11.1280889297
+罗荣光 13.2075304714
+难逃 9.04086524761
+林左旗 13.2075304714
+宋江分 12.2912397395
+戈夫岛 13.900677652
+拉德勃 12.8020653633
+聊个 12.5143832909
+游山玩景 12.8020653633
+中华全国归国华侨联合会 12.5143832909
+方竹林 13.2075304714
+地热学 13.2075304714
+跋文 13.900677652
+官家圣 12.8020653633
+箭在弦上 10.4666904475
+义兄 12.2912397395
+称不上 10.7226238216
+拴锁 12.5143832909
+蓬勃生机 13.2075304714
+悬挑 13.900677652
+尖瘦 13.2075304714
+卫王赵 12.5143832909
+他俩 8.092535162
+难道 6.03204075779
+义兴 11.1280889297
+位形空间 13.900677652
+解理极 12.8020653633
+贾拉 12.8020653633
+北京街头 11.7034530746
+拆东墙补西墙 11.598092559
+实体模型 13.2075304714
+俄斯特拉发 12.2912397395
+三十种 13.900677652
+降龙十八掌 13.2075304714
+字义 10.1630080337
+李民欣 13.2075304714
+黑匣 13.2075304714
+引力场 10.0720362555
+官话 9.91169360541
+耳性 13.900677652
+衣橱 11.8212361103
+曹世表 13.2075304714
+名簿 13.900677652
+字书 10.2630914922
+春风 8.83177344976
+三两年 11.7034530746
+望七星 13.2075304714
+投机性 9.21854642485
+柳生芽 13.2075304714
+阿米巴 10.4994802703
+药捻子 13.900677652
+尖石 11.2616203224
+通化县 12.5143832909
+落着 11.2616203224
+穷孩子 12.2912397395
+捣乱分子 12.8020653633
+明叔则 12.2912397395
+十六名 11.598092559
+网间 12.1089181827
+火辣辣 9.28555713513
+大黄山 13.2075304714
+温景春 9.35738286971
+做过 7.95525704337
+洛特雷 13.2075304714
+从士伍 12.8020653633
+洋中 10.8561552143
+常有良 13.900677652
+宋江叫 10.765183436
+宋江只 11.9547675029
+丁汝昌 9.01787572939
+鱼化石 11.9547675029
+优异者 11.9547675029
+美国雷声公司 13.2075304714
+杜衍 13.2075304714
+长途跋涉 10.0088573539
+放射学 12.8020653633
+他乡 10.9049453784
+赔了夫人又折兵 11.8212361103
+藏藏躲躲 12.5143832909
+牟尼合 12.5143832909
+斯坦利 10.4349417492
+且战且退 10.642581114
+宋江取 12.2912397395
+良贱 11.1280889297
+曼舞 12.5143832909
+茕茕 13.2075304714
+杜衡 13.2075304714
+冬奥会 12.2912397395
+灰身灭智 13.900677652
+汪氏振 13.2075304714
+旷费 13.900677652
+二十万匹 12.8020653633
+落石 11.0674643079
+乐器行 13.900677652
+夜视技术 13.2075304714
+落矿 12.8020653633
+王明清 12.8020653633
+受控系统 13.2075304714
+主权者 12.1089181827
+言归于好 12.5143832909
+妓女院 12.2912397395
+荡起 11.0103058941
+钱穆 11.4157710022
+手纹 13.900677652
+手纸 11.0103058941
+趋避 11.9547675029
+广告画 12.2912397395
+玩赏着 13.900677652
+大鱼缸 13.900677652
+北大清华 13.900677652
+金翅大 10.8561552143
+白桦林 12.8020653633
+随意肌 12.8020653633
+巴比伦王国 10.4666904475
+观云海 13.900677652
+窟窿眼儿 13.900677652
+他人 6.93465346487
+网络产品 12.5143832909
+全然不同 11.7034530746
+数字化 8.85082164473
+手绢 9.04864738806
+一目数行 13.900677652
+蓬乱 10.4994802703
+省俭 12.2912397395
+真名真姓 13.900677652
+耳蜗 10.8096351986
+查得严 12.5143832909
+古三国 13.900677652
+黑口 12.1089181827
+行加征 12.8020653633
+传输层 13.2075304714
+洋人 8.16733637508
+钱程 12.8020653633
+猜疑心 13.900677652
+市郊区 12.8020653633
+黑发 9.58318953844
+为重 8.63281949291
+排满 10.4349417492
+手织 12.2912397395
+抗坏血酸 11.0674643079
+斯坦努 13.2075304714
+是否 5.24441841244
+广告界 13.900677652
+一滴水 10.7226238216
+他们 3.51029862597
+北京市公安局 11.9547675029
+韧劲儿 12.8020653633
+滑雪场 10.1630080337
+定边 10.4666904475
+黄御史 13.2075304714
+递降 11.5027823792
+揭西 11.598092559
+手绘 11.4157710022
+宋江升 13.900677652
+长鼻目 11.4157710022
+张子勇 13.2075304714
+龙天武 13.900677652
+贾尼 13.900677652
+黑水 9.21854642485
+色法 11.598092559
+雪谷 13.900677652
+丑婆子 13.900677652
+范思哲 12.2912397395
+橄榄球赛 13.900677652
+世代书香 13.2075304714
+还原成 10.0720362555
+碧塔海 13.2075304714
+陈建国 11.1926274509
+沉着 8.0285598625
+咏柳 13.900677652
+音画 11.5027823792
+地理系统 11.8212361103
+保丽龙 13.900677652
+粗纱机 12.5143832909
+维尔顿 13.900677652
+五十二岁 13.2075304714
+焦距 10.2630914922
+不相往来 13.900677652
+政策史 13.900677652
+汇交 12.8020653633
+船户 11.0674643079
+门户之见 10.533381822
+沉睡 9.40086798165
+供参考 11.4157710022
+双城镇 13.2075304714
+勤务员 11.0674643079
+黄忠夺 13.2075304714
+神阙穴 13.900677652
+大干一场 11.1280889297
+斯托夫人 12.5143832909
+之用 8.42421410004
+雪豹 10.0294766411
+临床教学 12.5143832909
+似曾 12.2912397395
+批注 11.7034530746
+老大娘 11.0103058941
+水冷式 12.1089181827
+绿影 12.2912397395
+贡德语 13.900677652
+除草机 13.900677652
+拜见 8.74162235276
+勃艮第 10.0505300503
+完完全全 10.4666904475
+垄断资本 9.37888907493
+人民满意 11.0103058941
+一万家 12.1089181827
+震撼力 11.8212361103
+阿芙 11.9547675029
+黑汗 10.604840786
+刘光大 11.5027823792
+显著成绩 11.7034530746
+林德曼 12.1089181827
+炸土豆片 13.2075304714
+排污管 12.5143832909
+掩盖 8.02574692112
+车裂 10.765183436
+十六款 13.2075304714
+薄缘夷 12.8020653633
+性溃疡 11.9547675029
+行政公署 10.3171587135
+黑河 9.37888907493
+连克康 13.2075304714
+黑油 11.4157710022
+法西斯 8.13548654919
+公今 11.5027823792
+忻州市 11.598092559
+义演 11.5027823792
+前爪 9.94943393339
+冬荫功 13.900677652
+自控力 12.5143832909
+安庆人 13.900677652
+刨根问底 11.1926274509
+似是 9.89334446674
+万华 12.8020653633
+相王之 13.2075304714
+麦木鲁克 13.2075304714
+贾岛 11.0674643079
+之薇 10.8561552143
+怪道人 12.1089181827
+谎言 9.48183704418
+焦赞 12.2912397395
+六百多 11.8212361103
+碳酸钾 11.4157710022
+平心而论 9.82314020807
+多极世界 11.4157710022
+酣畅淋漓 11.0674643079
+大轿车 11.4157710022
+超短裙 11.9547675029
+高斯消 13.900677652
+奉托 12.2912397395
+短片 9.91169360541
+古桥 13.2075304714
+一家之主 10.4666904475
+搬救兵 12.2912397395
+满洲国 10.3743171274
+电烙铁 13.900677652
+第一次世界大战 7.30900391997
+吞下 9.75754292558
+黑泥 11.2616203224
+生育力 11.8212361103
+雕塑感 11.8212361103
+钱塘君 12.8020653633
+魏塔线 12.2912397395
+郭海萍 11.1280889297
+休眠期 11.1926274509
+伊朗核 11.8212361103
+德莱斯 12.2912397395
+扣掉 11.598092559
+滚起 12.8020653633
+小手帕 11.8212361103
+拉德波 13.900677652
+奉承 9.22784881751
+扇形 8.96620371885
+霸权 8.9102450652
+查字典 12.5143832909
+分等级 11.9547675029
+竭力反对 11.2616203224
+跟踪追击 12.8020653633
+广告费用 13.2075304714
+宋江求 13.2075304714
+前牙 11.9547675029
+草写 13.900677652
+绿帽 13.900677652
+闭馆 12.8020653633
+曹训 13.2075304714
+汇仁 13.900677652
+身板儿 12.8020653633
+哭骂 11.9547675029
+洋火 12.1089181827
+侉子 12.8020653633
+身当矢石 13.900677652
+纪尽善 12.8020653633
+先决问题 12.1089181827
+洋灰 11.0674643079
+小萝卜头 13.2075304714
+唇疱疹 13.900677652
+绿带 13.2075304714
+杨素 10.6818018271
+连屿 13.2075304714
+严格监督 11.7034530746
+胞质基因 13.900677652
+放错 12.1089181827
+直心眼 13.2075304714
+姜记 11.5027823792
+拍下去 13.900677652
+黑洞 9.37888907493
+娇艳动人 13.900677652
+生三男 12.8020653633
+版本升级 13.2075304714
+穗轴 11.9547675029
+贵州高原 9.93038573842
+秉性 9.23723855786
+大婶儿 10.765183436
+掂量掂量 11.8212361103
+曾宪梓 13.900677652
+爱沙尼亚人 11.9547675029
+谎语 13.900677652
+黑海 8.51618258919
+级数 9.38981814546
+任天堂 12.5143832909
+略无忌惮 13.900677652
+接力跑 11.9547675029
+安命 12.2912397395
+借约 13.2075304714
+剧烈性 13.900677652
+杨絮 13.2075304714
+控制额 13.2075304714
+分阶段 9.98865464655
+丘成桐 11.7034530746
+刁德一 13.2075304714
+重型车 12.8020653633
+活泼开朗 12.8020653633
+格勒山 13.900677652
+福知山 13.2075304714
+板栗树 13.2075304714
+中国人口学会 12.8020653633
+訾言 13.900677652
+乐此不倦 13.900677652
+山顶洞 11.8212361103
+转折处 12.2912397395
+伴随物 13.2075304714
+娘儿 9.98865464655
+巷子 9.14708746087
+鲁元公主 12.8020653633
+薄太后 13.2075304714
+寻乌水 13.2075304714
+黑液 12.8020653633
+沁源县 9.80633308975
+衣衫褴褛 10.9562386728
+组织部 9.01032852375
+拿腔拿调 11.1926274509
+万不得已 9.27570483869
+毒死 9.31571017331
+司徒王寻 12.5143832909
+朴刀杆 13.2075304714
+函大 13.900677652
+黑润 12.8020653633
+径向 9.80633308975
+刘氏复 13.900677652
+台汽 13.900677652
+附表 10.533381822
+红新月 13.2075304714
+失乐园 11.9547675029
+颜勤礼 13.2075304714
+跑马灯 13.900677652
+五千八 13.2075304714
+挑灯 10.9562386728
+函复 13.2075304714
+一身轻 11.4157710022
+洋烟 11.5027823792
+终身性 13.2075304714
+似有 8.80692745117
+接力赛 11.5027823792
+封博陵 13.2075304714
+欧洲各国 9.02548032877
+洋炮 11.9547675029
+华新水泥 11.4157710022
+德顺军 12.2912397395
+各个环节 9.72629038208
+五点钟 10.9049453784
+扣押 9.21854642485
+扣抵 13.2075304714
+接线盒 11.9547675029
+千百处 13.900677652
+普通法 10.604840786
+利库德集团 11.9547675029
+罢职 10.8561552143
+圣西门 10.7226238216
+玉虚宫 13.2075304714
+头脑清楚 11.9547675029
+朱利叶 13.900677652
+绿廊 13.900677652
+掩着 10.2117981979
+全面继承 13.900677652
+为非作恶 12.8020653633
+半抗原 11.8212361103
+七级浮屠 12.8020653633
+自治军 12.5143832909
+雅洁 11.1280889297
+郭远远 13.2075304714
+砧杵 13.900677652
+雷正妻 12.8020653633
+宋郑文 13.900677652
+伪劣产品 12.1089181827
+顶过去 13.900677652
+秉持 10.1630080337
+生产自救 11.8212361103
+三百五十余万 13.2075304714
+招标会 12.2912397395
+贪生怕死 9.94943393339
+还原性 10.2371160058
+朝鲜战争 9.15574552361
+朱子语 11.598092559
+张云逸 11.1280889297
+质体 11.2616203224
+旷世逸才 13.900677652
+接线生 13.900677652
+铜版纸 10.765183436
+逐退 13.2075304714
+拜认 13.900677652
+宫山 11.5027823792
+房贷部 11.7034530746
+承典人 12.2912397395
+居夫 13.2075304714
+多相催化 12.2912397395
+贾布 12.5143832909
+存贷款 9.96885201925
+有破有立 13.2075304714
+险恶 8.83177344976
+王明友 13.900677652
+首次 5.68567121921
+引诱 8.91707103027
+热传导 9.98865464655
+寡糖 12.8020653633
+火柴盒 11.4157710022
+歌风台 13.2075304714
+凭仗 11.598092559
+三四根 13.2075304714
+常绿 8.01179969364
+伏俟城 12.2912397395
+时不我与 13.900677652
+陈独秀 9.24671730182
+党风廉政 11.0674643079
+引语 12.5143832909
+质优 9.66657114738
+何理 11.598092559
+金光辉 11.9547675029
+神宙斯 10.6818018271
+失败率 12.8020653633
+分析报告 9.49395840471
+满分者 13.900677652
+服服帖帖 11.2616203224
+雅浦 11.9547675029
+在商言商 12.2912397395
+拜读 11.2616203224
+身后之事 12.8020653633
+监督制约 12.8020653633
+一般来说 7.99259471381
+病死猪 11.9547675029
+附记 12.8020653633
+放定 12.5143832909
+露风 12.8020653633
+听训 12.1089181827
+沉痛 9.30555780184
+八九间 13.900677652
+乌雷松 13.900677652
+海岛县 12.8020653633
+苏芬战争 11.0674643079
+抛在后面 12.2912397395
+追下去 12.1089181827
+兼任教师 13.900677652
+线性相关 12.5143832909
+杨红 10.642581114
+薛大哥 11.4157710022
+祖乙 13.2075304714
+馈送 11.3357282945
+匀实 12.8020653633
+自守 10.0940151622
+贾府 10.0940151622
+质保 10.6818018271
+高空槽 11.7034530746
+财经频道 11.1926274509
+盘旋曲折 12.2912397395
+所得税 8.33999602096
+肩周炎 11.9547675029
+黑娃谦 13.2075304714
+火轮船 11.8212361103
+哥斯达黎加 9.91169360541
+尾矿库 13.2075304714
+贾庄 11.9547675029
+后妈 11.3357282945
+鸭绿江口 10.765183436
+封闭系统 11.0674643079
+曹衣 12.5143832909
+一万多 9.71102290995
+馈遗 12.8020653633
+杨维 11.9547675029
+荷荷 9.93038573842
+新街镇 12.8020653633
+小两口儿 13.900677652
+两码子 12.8020653633
+安周 13.2075304714
+拐进去 13.900677652
+病死率 10.3743171274
+雨衣 9.45802639549
+不出意外 9.91169360541
+睡眼惺松 12.5143832909
+杨继 12.5143832909
+毒株 10.9049453784
+一百余家 12.8020653633
+史德威 13.900677652
+一万头 13.900677652
+日本驻华使馆 12.8020653633
+理想境界 13.900677652
+够瞧的 13.900677652
+坐卧不离 13.900677652
+雅淡 12.8020653633
+沉疴 10.765183436
+第三十八条 13.2075304714
+救援车 11.2616203224
+比试一下 12.8020653633
+还政于民 11.8212361103
+杨绍 11.4157710022
+哈萨克语 11.9547675029
+搭线 12.5143832909
+生物制品 9.03314320152
+母兔 13.2075304714
+湛然居士 12.8020653633
+字片 13.900677652
+作金石声 13.900677652
+立足之地 10.0720362555
+十六桌 13.2075304714
+草原 6.8367736905
+索命 10.5684731418
+字牌 10.9562386728
+甄六臣 11.8212361103
+肾移植 10.7226238216
+寻拜征 13.900677652
+荷花 9.11318590919
+偏远地区 11.0103058941
+凭依 11.9547675029
+雅气 13.900677652
+四时八节 12.5143832909
+李多奎 12.5143832909
+一眼看穿 13.2075304714
+一万声 13.900677652
+动静脉 11.0103058941
+后来者 10.3171587135
+于右任 11.9547675029
+安庄卫 13.2075304714
+郑超宗 11.1926274509
+黑漆 9.53122979951
+恶浪 11.2616203224
+麦盖提 12.5143832909
+迷了路 10.642581114
+冲突地区 12.2912397395
+汾河 9.69598503258
+义法 11.8212361103
+党政军民 12.5143832909
+绿山 13.900677652
+仓皇失措 12.2912397395
+大福 9.80633308975
+雅江 12.8020653633
+四二一 12.5143832909
+鹅毛 10.8561552143
+比较而言 10.3171587135
+荤段子 11.8212361103
+雪车 12.5143832909
+下半生 11.7034530746
+黑潮 9.93038573842
+大有用武之地 12.5143832909
+招军买马 11.7034530746
+齐进 12.2912397395
+凭信 10.7226238216
+秉承 9.04086524761
+招标书 12.1089181827
+草台 11.9547675029
+放青 12.5143832909
+大批三 13.900677652
+草叶 10.1164880181
+十六根 11.9547675029
+焦躁 8.60737282725
+嘘寒问暖 11.2616203224
+包塞 13.900677652
+新机型 12.8020653633
+华源集团 12.5143832909
+浮梁县 12.8020653633
+装满水 12.2912397395
+高山湖 11.8212361103
+奢欲 13.2075304714
+义民 10.0505300503
+义气 8.89673134603
+痴子 13.2075304714
+贾德 13.2075304714
+烧不死 13.900677652
+安全等级 13.2075304714
+绿岩 10.765183436
+慕尼黑 8.60737282725
+草包 10.2371160058
+教研组 13.2075304714
+杨羚 13.900677652
+菰米 12.5143832909
+绿岛 10.9049453784
+东方快车 11.1280889297
+酷吏 10.5684731418
+常缀 13.2075304714
+多例 11.7034530746
+黄仲霖 12.5143832909
+分外夺目 13.900677652
+原版 11.0103058941
+小米饭 13.2075304714
+开放式系统 13.900677652
+必有用 13.2075304714
+招标人 11.9547675029
+催迫 12.5143832909
+小说家 8.9519177616
+弹道导弹 8.32094782599
+三七等 12.5143832909
+孙乾来 13.2075304714
+苦竹 11.598092559
+放音 11.1926274509
+汾水 10.604840786
+诈骗 9.15574552361
+附言 12.8020653633
+重轨 13.2075304714
+逼回 13.900677652
+塞北江南 13.2075304714
+雅法 11.8212361103
+齐化门 11.598092559
+杨翠 13.900677652
+荣禄之 12.8020653633
+人文科学 9.87532596124
+真值函 13.2075304714
+正从 12.1089181827
+医疗网 11.7034530746
+围脖儿 13.2075304714
+棒磨机 12.8020653633
+禀明 9.55687223012
+列奥纳多 12.5143832909
+精彩镜头 13.900677652
+鱼亚目 11.8212361103
+善解人意 10.765183436
+停车场 9.19114745066
+正对着 9.72629038208
+惠济河 11.5027823792
+不予考虑 11.5027823792
+禁渔区 12.8020653633
+协作区 12.8020653633
+田中绢 12.2912397395
+意在言外 12.8020653633
+放逸 12.2912397395
+老年 8.31342899358
+焚风 10.765183436
+司徒崔浩 12.5143832909
+史占春 11.1280889297
+南蒂罗尔 13.2075304714
+八千里 11.598092559
+外抗 12.8020653633
+黑格 11.1280889297
+王奶妈 13.2075304714
+童宣抚 10.642581114
+高高飘扬 12.5143832909
+王春瑜 12.2912397395
+战关胜 12.8020653633
+焦触 12.1089181827
+放射性 8.20694551317
+成宗立 13.2075304714
+霍格兰 13.2075304714
+亥时 11.2616203224
+秉政 11.0103058941
+他用 7.35102690974
+赵云弃 13.900677652
+第九代 11.598092559
+赤铜矿 11.8212361103
+减肥茶 12.8020653633
+柬政府 13.2075304714
+两下子 10.8096351986
+衣兜 9.84023464143
+私相授受 12.1089181827
+放送 12.2912397395
+雪宝顶 11.9547675029
+贵公子 11.7034530746
+雅歌 12.5143832909
+闵科夫 13.900677652
+束手无计 13.2075304714
+右江河谷 12.5143832909
+响水县 13.900677652
+七十三年 12.5143832909
+讨生活 11.5027823792
+刚愎自用 10.7226238216
+义母 11.598092559
+云情雨意 13.900677652
+意大利政府 11.4157710022
+守宫砂 12.8020653633
+炼药 11.7034530746
+之腹 11.5027823792
+夏侯蔼入 13.2075304714
+文物出版社 11.4157710022
+紫花苜蓿 12.1089181827
+落雨 11.3357282945
+反其道 12.8020653633
+超速离心 12.8020653633
+新婚之夜 10.533381822
+万两左右 12.8020653633
+广州市公安局 11.3357282945
+雅正 11.598092559
+黑桃 11.5027823792
+道木 13.900677652
+减肥药 11.3357282945
+洪炉 13.2075304714
+生物制剂 12.2912397395
+黑案 11.0674643079
+陈建功 11.8212361103
+心惊胆寒 12.5143832909
+沙尼亚 13.2075304714
+陈建力 13.900677652
+样车 9.02548032877
+洪灾 10.4666904475
+赵岩 12.8020653633
+裸机 12.8020653633
+钓虾 12.8020653633
+饮血 11.9547675029
+遗风 10.1630080337
+倡议 8.40350942668
+不朽名作 12.8020653633
+针入度 13.2075304714
+几辆车 11.598092559
+以老卖老 13.900677652
+路遥知马力 12.5143832909
+广告主 10.9562386728
+五十余所 12.8020653633
+绿宝 13.2075304714
+阻雨 13.900677652
+叶冠 13.900677652
+戈夫曼 12.8020653633
+沙罗王 12.8020653633
+牌位 9.45802639549
+拜贺 11.1280889297
+附赠 13.2075304714
+黑梁 11.8212361103
+拜神 11.2616203224
+巴拉望岛 12.1089181827
+脏乱 11.1926274509
+基因源 13.900677652
+投机家 10.5684731418
+越改越 12.2912397395
+二十九艘 13.2075304714
+赵云得 13.2075304714
+重寄生 13.2075304714
+非虚 13.2075304714
+关孝和 12.2912397395
+三十四款 13.2075304714
+拜赐 12.5143832909
+成千累万 13.900677652
+春风吹又生 11.8212361103
+远非 9.65218240993
+衣冠 8.99540287354
+申花俱乐部 12.5143832909
+引力波 11.598092559
+之至 9.6811699468
+调解者 13.2075304714
+精锐之师 11.1926274509
+之致 11.7034530746
+电极过程 13.2075304714
+左思右 13.900677652
+正交 9.53122979951
+黑森 11.8212361103
+改过迁善 13.900677652
+自由式 12.2912397395
+第九个 10.4349417492
+多米诺骨牌 10.4041700905
+来来 10.765183436
+大秋 13.2075304714
+弗洛雷斯 11.9547675029
+鹅池 12.8020653633
+杨磊 11.8212361103
+筑墙 11.0674643079
+浙江籍 12.5143832909
+一万张 13.900677652
+五颗 11.4157710022
+看家本领 11.0674643079
+黑棋 12.5143832909
+假帐 13.2075304714
+南非共和国 11.598092559
+马腾结 13.2075304714
+第十六次 12.1089181827
+可燃物质 13.2075304714
+无往不复 12.8020653633
+官冢宰 12.8020653633
+赵云带 13.2075304714
+牌价 11.3357282945
+唤起民众 11.9547675029
+难如登天 13.2075304714
+斋堂川 12.5143832909
+吴升 7.87239913175
+小纱柜 13.2075304714
+六株 13.2075304714
+变电器 13.2075304714
+泣涕 12.5143832909
+前瞻 9.49395840471
+姜辉 13.900677652
+倡言 10.642581114
+黑椒 13.900677652
+高山栎 10.3743171274
+上门服务 10.8561552143
+山高路险 12.8020653633
+伞兵团 10.9562386728
+霎时之间 13.2075304714
+驻颜 11.598092559
+万户千门 12.2912397395
+吕清非 13.2075304714
+照射到 10.642581114
+蝗灾 11.0674643079
+徒子徒孙 12.1089181827
+挂花 11.8212361103
+正事 9.21854642485
+自由度 9.33632946051
+踏破 11.0674643079
+色香 13.900677652
+钻冰取火 13.900677652
+可登记 13.2075304714
+诉前 12.1089181827
+焚香 8.81927328699
+洋琴 12.5143832909
+枪口上 11.1280889297
+联成一气 12.5143832909
+苏鲁豫 13.900677652
+商丘市 9.75754292558
+杨祚 12.5143832909
+大石桥市 13.900677652
+十八卷 12.1089181827
+洪熙 10.8096351986
+偿还 7.64492761022
+短短 7.82074445688
+短矮 12.5143832909
+回迁房 12.8020653633
+冒上 13.2075304714
+捐助款 13.900677652
+马普尔 13.900677652
+视见函数 12.8020653633
+常科 11.8212361103
+雨过 11.8212361103
+莫耕闲 13.900677652
+痴醉 13.900677652
+拜谒 9.5186510173
+第九位 10.1871055853
+怠工 11.0674643079
+宗乘胜 13.2075304714
+车费 10.4041700905
+戳子 13.900677652
+租出去 11.5027823792
+断木 11.8212361103
+华北大平原 12.8020653633
+唐僧勒 12.5143832909
+常礼 11.7034530746
+预选赛 10.8561552143
+抢过去 11.4157710022
+病虫害 9.21854642485
+国际航班 11.7034530746
+一万年 10.7226238216
+陈建华 13.900677652
+测角器 13.2075304714
+一丝不挂 10.2117981979
+良好形象 11.1280889297
+拜谢 8.60737282725
+杨福 13.900677652
+酷刑 9.15574552361
+高级职称 12.2912397395
+魁北克 10.0294766411
+牌九 11.9547675029
+将军令 12.1089181827
+李秉常 12.8020653633
+六十斤 11.1280889297
+小三和弦 13.900677652
+特约记者 10.9562386728
+车赶 13.900677652
+总结报告 11.5027823792
+幽寂 12.5143832909
+背乡离井 13.2075304714
+雨轩 13.900677652
+孟尝君 11.3357282945
+重庆火锅 12.1089181827
+食利者 11.7034530746
+互联网内容 13.900677652
+之能 10.1630080337
+低音部 13.900677652
+公立医院 10.4041700905
+雕绘 13.900677652
+遗腹子 11.1926274509
+广告位 12.2912397395
+杨秋 11.8212361103
+淡红色 10.1630080337
+放量 7.50374799676
+凌海市 13.2075304714
+麂子 12.8020653633
+杨秀 12.5143832909
+周游世界 11.8212361103
+缀字 13.2075304714
+非你不可 13.2075304714
+江兆民 12.8020653633
+割回来 13.900677652
+幽娴 13.900677652
+氯胺酮 13.900677652
+无知者 12.5143832909
+吴起守 12.8020653633
+酷冷 12.5143832909
+黄忠引 12.8020653633
+胺类 10.8096351986
+车身 7.84389363875
+附近 5.16934129144
+水声学 12.2912397395
+崔健 13.900677652
+龙宗武 13.2075304714
+一无所求 13.2075304714
+丛丁香 13.2075304714
+土地权 12.1089181827
+查起来 11.9547675029
+坚持不下 13.900677652
+朱胜非 13.2075304714
+澉浦镇 12.8020653633
+太空人 12.8020653633
+年初三 13.900677652
+无意间 9.98865464655
+任何原因 11.9547675029
+饮誉 11.3357282945
+同崇祯 12.1089181827
+少女装 13.900677652
+旁若无人 10.0940151622
+茅村 11.9547675029
+弃甲曳兵 13.900677652
+羊湾 12.5143832909
+国家建设部 11.9547675029
+送出去 10.0720362555
+自甘暴弃 13.900677652
+小小年纪 10.1871055853
+拔锚 12.8020653633
+嗓门儿 12.5143832909
+渔产量 13.2075304714
+资粮 11.9547675029
+五千元 10.8096351986
+闲着没事 10.642581114
+一九五五年 12.2912397395
+草图 10.4041700905
+杨诚才 11.8212361103
+雅楠 12.8020653633
+衣包 11.1280889297
+灯火通明 9.98865464655
+重要关头 11.9547675029
+外找 13.900677652
+诸部兵 12.8020653633
+秧歌队 11.1280889297
+以一持万 13.2075304714
+字眼 8.74162235276
+落下 7.49379766591
+一百七十余年 13.2075304714
+工作母机 12.8020653633
+兰丹 12.8020653633
+中国船舶工业集团公司 13.900677652
+魂牵梦绕 13.2075304714
+森斯坦 11.7034530746
+孬种 11.0103058941
+白磷 11.3357282945
+姐弟 10.642581114
+旗开得胜 10.642581114
+推想出 13.900677652
+负负得正 13.900677652
+潜水服 11.7034530746
+神经失常 11.8212361103
+诸部军 12.2912397395
+高尿酸 11.4157710022
+加那利 10.8096351986
+国柄 11.4157710022
+少壮派 11.7034530746
+膛线 10.765183436
+天理教 11.7034530746
+黑檀 13.2075304714
+海岛型 13.900677652
+附载 12.2912397395
+毒汁 11.0674643079
+曾奉召 13.2075304714
+钓鱼台 9.72629038208
+抱有成见 13.2075304714
+诉冤 11.598092559
+毒水 11.7034530746
+来源国 11.5027823792
+一毛不拔 11.598092559
+不惜代价 11.4157710022
+基本原理 8.9102450652
+太统山 13.2075304714
+新机制 10.4994802703
+杨开慧 12.5143832909
+曹豹 11.9547675029
+国际域名 13.900677652
+布鲁格曼 13.2075304714
+靴鞋 11.8212361103
+衰弱无力 13.2075304714
+奠基典礼 12.2912397395
+鹅湖 12.8020653633
+毒气 9.26594866375
+弓身 11.598092559
+正位 10.765183436
+风雨衣 12.5143832909
+国际检疫 13.2075304714
+遗骨 10.2117981979
+杨立 11.4157710022
+董卓造 13.2075304714
+李儒劝 13.2075304714
+冷暖自知 11.8212361103
+落于 10.2371160058
+潋滟 11.8212361103
+采矿权 10.4349417492
+汪潮涌 13.2075304714
+总监督 12.1089181827
+雨子 9.19114745066
+草垛 11.1280889297
+神阙 12.8020653633
+庄客飞 13.900677652
+交通设施 10.533381822
+参考书目 8.10461990121
+秦皇帝 12.8020653633
+停不下 12.8020653633
+舞剧院 13.900677652
+赚些 11.7034530746
+拔丝 13.2075304714
+颠来簸去 13.900677652
+姜越 13.900677652
+痴心 10.0505300503
+武定桥 12.1089181827
+益气养阴 11.5027823792
+战国时期 8.170577869
+酥油花 12.5143832909
+熟料 11.1280889297
+落体 12.8020653633
+宫觐见 12.5143832909
+奉新 11.4157710022
+程序结构 13.2075304714
+茫茫苦海 13.900677652
+实践证明 9.5062284973
+五溪蛮 12.5143832909
+七万余 12.5143832909
+雅格 12.8020653633
+草垫 12.1089181827
+不规则 8.03704647638
+车辆 6.3973880213
+粉骨碎身 11.598092559
+金帅 12.1089181827
+大票 13.2075304714
+奈何 8.170577869
+之舞 11.4157710022
+蜂群 10.4666904475
+中国银行 7.22233553732
+环境变量 10.7226238216
+毒液 9.96885201925
+藜科 11.2616203224
+天老地荒 13.900677652
+大牲畜 10.2117981979
+马超背 13.2075304714
+钢领 12.2912397395
+广丙管 13.2075304714
+华蓥 13.2075304714
+绕过去 10.2897597393
+分辨 8.1417758781
+汉军佐 13.900677652
+哪一条 10.8561552143
+院址 11.8212361103
+五十三分钟 13.2075304714
+一男半女 13.2075304714
+车运 13.2075304714
+圣伯纳德 13.2075304714
+正佐 12.8020653633
+附身 11.4157710022
+言立决 13.900677652
+农工民主党 12.2912397395
+日资 11.4157710022
+金阙云 13.2075304714
+衣分 13.900677652
+福尔杜纳 13.900677652
+奉旨 8.63281949291
+杜回沪 13.2075304714
+落伍 10.2897597393
+厌食 10.4349417492
+十多户 13.900677652
+伊利亚 12.5143832909
+多塞特郡 13.2075304714
+色魔 12.2912397395
+接风洗尘 12.5143832909
+水冷壁 13.2075304714
+兰麝 12.1089181827
+好几万 11.9547675029
+下情上达 12.8020653633
+过劳死 12.2912397395
+诺罗敦 11.7034530746
+汗牛充栋 12.1089181827
+前田 12.8020653633
+开心颜 13.2075304714
+吴桥县 12.1089181827
+基础理论 9.23723855786
+洋相 11.1280889297
+字盘 12.5143832909
+梁思永 11.7034530746
+罗荣桓 10.642581114
+草场 8.42421410004
+洋盆 11.3357282945
+赚个 10.7226238216
+草地 8.29120585679
+邻水 13.2075304714
+近些 9.96885201925
+裂谷 9.54396882529
+净月潭 12.5143832909
+一百七十余 12.8020653633
+卡尔丹 13.2075304714
+贾宅 11.8212361103
+奉教 11.9547675029
+分进 13.2075304714
+车轴 10.0088573539
+之苦 8.78868986362
+隋显官 13.2075304714
+钙质 9.14708746087
+两个凡是 11.598092559
+仙童 10.4994802703
+车载 8.89004235788
+毛利润 11.2616203224
+更好 6.44076288573
+干腐病 13.2075304714
+车车 13.900677652
+占田令 13.2075304714
+功成行满 13.2075304714
+宋江正 11.4157710022
+利亚德 12.8020653633
+车轮 8.4801426527
+佐罗 12.8020653633
+揩油 12.8020653633
+拉闸 13.900677652
+色鬼 10.8096351986
+黑毛 10.604840786
+咏怀 10.533381822
+磁法勘探 11.9547675029
+草坪 9.32596667347
+优惠待遇 10.642581114
+奉敬 13.900677652
+失信于人 13.900677652
+草坡 9.63799777493
+二句 10.9562386728
+亚河 12.5143832909
+苦经 11.8212361103
+教学片 12.2912397395
+杨琳 13.900677652
+雨花 12.2912397395
+伯希和 11.598092559
+绿地 9.04864738806
+不跟人 12.1089181827
+克鲁人 12.5143832909
+巢脾 12.2912397395
+冻土学 11.7034530746
+附加赛 11.5027823792
+高容量 11.1926274509
+杨琛 11.8212361103
+特地到 11.8212361103
+多发区 13.2075304714
+探来探去 13.900677652
+曹节 11.7034530746
+高潮期 11.7034530746
+草墩 12.5143832909
+前窗 12.2912397395
+一万句 11.8212361103
+贾后 10.8561552143
+姓氏 8.57766767284
+音素 11.598092559
+一万只 12.1089181827
+体炎 13.2075304714
+搭理 9.44633035572
+股票买卖 11.0674643079
+魏征奏 13.2075304714
+前端 8.06586691491
+王并立 12.5143832909
+控制结构 12.2912397395
+威特 10.8096351986
+扣款 11.5027823792
+杨赞 13.2075304714
+海上结构 13.900677652
+外族 9.89334446674
+沉缅 13.900677652
+举国体制 11.8212361103
+装鬼脸 13.900677652
+机能减退 11.0674643079
+特殊符号 12.8020653633
+海牙公约 12.8020653633
+一件件 9.85762638414
+抵御外侮 10.8096351986
+美国福特汽车公司 11.598092559
+车胄 12.1089181827
+背风处 12.2912397395
+魏征好 13.2075304714
+凹痕 12.1089181827
+车胎 11.1926274509
+营运证 13.900677652
+大字报 9.35738286971
+重重包围 11.1280889297
+碳酸氢 11.9547675029
+浊骨凡胎 13.900677652
+优秀生 13.900677652
+潜在地 11.598092559
+碳酸氨 13.900677652
+官禄马 13.900677652
+可比价格 11.1926274509
+圣马丁 10.604840786
+短程 10.1630080337
+伊莉莎白 13.900677652
+丁字楼 11.9547675029
+金锞子 12.1089181827
+衣巾 11.5027823792
+仅此而已 10.642581114
+驱动器 10.6818018271
+草堂 9.16447920358
+苦熬 10.1164880181
+草堆 10.3743171274
+一万卷 13.900677652
+肿瘤 7.75007488353
+处身 11.5027823792
+藏风纳 11.7034530746
+毒打 10.1394775363
+南南东 12.5143832909
+五项 9.53122979951
+中间业务 9.48183704418
+银行信用 10.9049453784
+前程 8.5488195185
+制版工艺 13.900677652
+冗余度 12.8020653633
+装备齐全 12.5143832909
+翡翠绿 12.8020653633
+百花丛 13.2075304714
+小两口子 13.900677652
+毒手 9.5062284973
+草塘 11.5027823792
+匀净 11.0103058941
+吴中军 10.9562386728
+一方水土 13.2075304714
+吉星文 13.900677652
+混子 11.9547675029
+平治天 12.2912397395
+安塔利亚 13.2075304714
+勒紧 10.8096351986
+自由区 11.5027823792
+勒索 8.95903522937
+詹家 10.765183436
+令人恶心 11.598092559
+查案 11.7034530746
+脱列伯 13.2075304714
+商丘县 11.9547675029
+常跑 12.2912397395
+击打式打印机 11.9547675029
+淮海中路 11.0674643079
+小姑姑 10.9049453784
+高山族 9.5062284973
+尼尔逊 13.900677652
+文昭阁 11.9547675029
+六百元 12.8020653633
+正襟危坐 10.0940151622
+一万匹 12.5143832909
+绿城 9.33632946051
+干净水 12.8020653633
+先易后难 11.7034530746
+自由化 9.40086798165
+湘菜馆 13.2075304714
+电磁振荡 11.5027823792
+两三万元 12.5143832909
+张展南 13.900677652
+高剑父 11.4157710022
+短空 12.2912397395
+宋江方 12.5143832909
+杨戬主 13.2075304714
+融水县 12.2912397395
+卡明斯基 12.8020653633
+凛凛 10.1394775363
+搭界 11.4157710022
+数字图像处理 12.5143832909
+衣履 11.1280889297
+云开雾散 12.1089181827
+博尔努 11.4157710022
+空降部队 10.9049453784
+蔡任 12.5143832909
+比长仪 13.2075304714
+赵谭 12.5143832909
+跟风盘 11.1280889297
+大冢营 13.2075304714
+杨生 13.2075304714
+违纪者 13.2075304714
+之谈 10.7226238216
+斤斤计较 10.533381822
+其怪自败 13.900677652
+虹桥镇 11.7034530746
+赵云分 13.2075304714
+非让 11.8212361103
+电力工程 11.4157710022
+诬称 12.1089181827
+名扬 10.1630080337
+夏谷 12.8020653633
+紧箍咒 10.1871055853
+中国民生银行 10.642581114
+百业待兴 13.900677652
+之谜 8.71889410168
+快嘴 11.7034530746
+短篇 9.48183704418
+第十六条 11.2616203224
+糖胺聚糖 13.900677652
+字码 12.1089181827
+线性规划 10.4994802703
+年初二 11.9547675029
+纤维素酶 13.2075304714
+陆家羲 13.900677652
+宋江早 13.2075304714
+啃过去 13.900677652
+车臣 10.4349417492
+二十九篇 13.2075304714
+黍米 11.9547675029
+发护发 12.5143832909
+刘青云 13.2075304714
+多位数 12.8020653633
+边界争端 12.8020653633
+舒席 12.5143832909
+赵谦 8.66423568915
+于建虏 12.1089181827
+张孝骞 13.2075304714
+附肢 10.0088573539
+凛冽 10.2371160058
+肱股 13.900677652
+世界卫生组织 9.20932976975
+雕版 9.82314020807
+前男友 11.9547675029
+晓以大义 12.1089181827
+弯下身 10.7226238216
+难言之隐 10.4994802703
+不可胜记 12.5143832909
+地热水 12.8020653633
+常用 6.44769532251
+海上基地 13.900677652
+碳酸锶 12.8020653633
+二十九笔 13.2075304714
+提上来 11.2616203224
+梁思成 11.9547675029
+歉年 12.2912397395
+官家恩 13.2075304714
+十五层 12.8020653633
+何老爹 9.84023464143
+水府庙 11.8212361103
+短笛 11.1926274509
+炮响 8.99540287354
+黑斑 9.61021821083
+布鲁诺 11.0674643079
+娘姨 11.0103058941
+单大良 13.2075304714
+拜耳 11.4157710022
+物价上涨 9.27570483869
+教学班 11.9547675029
+端午 10.9049453784
+铜版画 11.4157710022
+草头 11.1926274509
+常生 11.3357282945
+南禅寺 11.598092559
+遗闻 12.2912397395
+元太宗 12.5143832909
+枇杷 9.58318953844
+于儒伯 13.2075304714
+巷口 9.23723855786
+半小时 8.38322475551
+处过 13.900677652
+多功能 8.46259834305
+童大焕 13.2075304714
+时起时伏 12.8020653633
+洋碱 13.900677652
+眼识 13.2075304714
+热轧卷 11.598092559
+一万刀 13.2075304714
+黑旦 11.7034530746
+话家常 13.900677652
+一二九 10.2630914922
+不同之处 9.48183704418
+寝食俱废 11.7034530746
+痴儿 12.2912397395
+平均利润 8.81308131674
+黑旗 11.4157710022
+卡塔戈 13.900677652
+优化 6.85577253485
+阿弟仔 13.900677652
+英雄难过 13.2075304714
+雪藏 11.9547675029
+利斯克 12.5143832909
+杨振声 12.8020653633
+边防前线 13.900677652
+米原器 13.2075304714
+切尔诺 12.8020653633
+舅父 9.94943393339
+附耳 10.4994802703
+功率因数 11.0103058941
+谁的车 13.2075304714
+马革裹尸 11.9547675029
+篱落 11.598092559
+埃维人 11.9547675029
+弹簧门 11.8212361103
+惴惴不安 9.93038573842
+精神力量 10.4041700905
+大孢子 11.2616203224
+哭醒 11.5027823792
+孔诺 13.2075304714
+彝族 9.33632946051
+罢论 13.900677652
+高大监 13.2075304714
+锡兰岛 12.5143832909
+葫芦蔓 12.8020653633
+用力过度 11.4157710022
+药剂拌种 13.2075304714
+熊岭瓶 13.2075304714
+迷上 10.1871055853
+副油箱 9.85762638414
+递减率 12.5143832909
+车节 12.5143832909
+十五公里 12.2912397395
+性能指标 10.533381822
+弄虚作假 9.94943393339
+猜得到 12.2912397395
+南京长江二桥 13.900677652
+周作民 13.2075304714
+温家庄 10.4349417492
+玉屏楼 12.2912397395
+投机商 10.3453295905
+非机动 11.9547675029
+赵云入 12.8020653633
+义旗 10.3171587135
+娘娘 7.57631868959
+十团 13.2075304714
+斯坦朗 13.2075304714
+迷乱 10.2897597393
+安静下去 13.900677652
+施鸿鄂 13.2075304714
+罢课 10.2630914922
+空中网 11.8212361103
+竭诚 10.4041700905
+字符 8.46259834305
+衣式 13.2075304714
+小姑子 11.3357282945
+触摸屏 11.3357282945
+大统 9.94943393339
+国东夷 13.2075304714
+集中反映 10.1871055853
+秉正 12.2912397395
+盼望已久 11.1280889297
+凭坚 13.2075304714
+言无不尽 11.598092559
+扶清灭 11.5027823792
+似水 10.7226238216
+医官 10.533381822
+封英布 12.8020653633
+杨振宁 10.533381822
+车船 9.94943393339
+羊剪绒 12.2912397395
+搭盖 11.0674643079
+一万元 10.0720362555
+共振吸收 11.9547675029
+闻名中外 9.7898037878
+影碟机 12.8020653633
+雅斯 12.1089181827
+金早立 13.2075304714
+黑暗 6.88138099826
+舒伯特 10.8561552143
+恩佐 13.900677652
+之辈 8.50705010562
+于龙兴 12.8020653633
+车舟 12.2912397395
+先尝 11.4157710022
+耐蚀 11.2616203224
+自由党 9.15574552361
+张静江 12.1089181827
+雪蚀 12.2912397395
+一万八 12.8020653633
+烟酰胺 12.5143832909
+误上贼船 13.900677652
+高潮时 11.4157710022
+山水图 11.7034530746
+钱伟 12.8020653633
+哈巴狗 11.4157710022
+组委会 9.26594866375
+毒性 7.95003509939
+非行 13.2075304714
+商业主义 13.2075304714
+一百五十余年 13.900677652
+山水园 13.2075304714
+麦折银 13.2075304714
+国同休 13.2075304714
+之过 10.4994802703
+葫芦藓 12.5143832909
+集团选择 13.900677652
+习拳 13.2075304714
+晚报社 12.2912397395
+盲肠炎 12.8020653633
+给点 11.1280889297
+蹑着 12.8020653633
+文采出众 13.900677652
+马赤军 11.5027823792
+欺下瞒上 13.900677652
+教学点 13.900677652
+二胡曲 12.2912397395
+安居乐业 9.63799777493
+鹅掌 11.2616203224
+红鼻子 12.5143832909
+鹤年堂 13.2075304714
+吞下去 10.1871055853
+党政机关 9.98865464655
+挖泥船 12.8020653633
+输电线 11.0103058941
+莫鲁齐 13.900677652
+拜节 12.5143832909
+月琴 10.533381822
+于菱 9.0884932966
+非要 7.95525704337
+娘子 8.0229418702
+洗手盆 13.900677652
+海市蜃楼 9.96885201925
+零工 12.1089181827
+母蜂 13.900677652
+径庭 13.2075304714
+克雷布斯 12.2912397395
+标记技术 13.900677652
+涤棉 11.598092559
+陆胡理 9.71102290995
+司徒王允 11.8212361103
+斯坦普 13.2075304714
+七折八扣 13.900677652
+小姑娘 8.23771717184
+周仆义 12.8020653633
+合奏曲 11.5027823792
+苏联队 12.5143832909
+周治平 13.900677652
+姜辛汤 13.900677652
+恩仇 12.8020653633
+道明 12.5143832909
+前秦 8.9308643524
+弹簧钢 11.3357282945
+张新贵 12.8020653633
+勒纳 12.1089181827
+自甘堕落 12.8020653633
+歪着头 10.2630914922
+黑板 9.75754292558
+田秉毅 12.5143832909
+胶济线 12.1089181827
+大风车 13.900677652
+衣帽 10.2371160058
+海泉湾 13.900677652
+失败者 10.2371160058
+穆塔里 12.8020653633
+前移 10.4666904475
+红军前敌总指挥部 12.1089181827
+黄汤辣水 13.900677652
+邹秉文 12.8020653633
+迷住 9.98865464655
+农业部门 10.1871055853
+从亨利 13.2075304714
+历四主 12.2912397395
+衣帛 13.2075304714
+前科 10.4349417492
+镇宁布依族苗族自治县 11.4157710022
+剂量计 12.1089181827
+日高三丈 13.900677652
+炙烤 11.9547675029
+切尔西 11.1280889297
+卫首领 12.1089181827
+驻防 9.21854642485
+望一望 9.75754292558
+达芙妮 11.7034530746
+之身 9.62401153296
+发洋财 12.8020653633
+不可捉摸 10.604840786
+冷烫精 13.900677652
+之躯 10.4041700905
+不升反降 11.0103058941
+分载 12.5143832909
+机压 12.5143832909
+宋江未 13.900677652
+辨别方向 11.8212361103
+核电厂 12.1089181827
+黑枪 10.6818018271
+一箭之遥 11.9547675029
+焦虑 8.23771717184
+黑林 11.598092559
+金尚 13.2075304714
+开山鼻祖 12.8020653633
+金声玉振 13.900677652
+民航机 12.8020653633
+恩义 10.533381822
+雪融 12.5143832909
+遗韵 13.2075304714
+棉短绒 12.1089181827
+原生地 13.2075304714
+顶珠 12.8020653633
+习题 12.1089181827
+刘老爷子 13.900677652
+霸气 11.1926274509
+王祖乙 13.2075304714
+箴规 12.5143832909
+恩主 11.4157710022
+迷信 7.88941047757
+秤不离砣 13.900677652
+狡辩 10.3453295905
+氮肥厂 10.9049453784
+肠穿孔 12.8020653633
+钱业 12.1089181827
+川杨河 12.8020653633
+草字 11.2616203224
+银基通 13.900677652
+空格符 13.900677652
+急急巴巴 13.900677652
+曹腾 12.2912397395
+一万倍 11.9547675029
+为国为民 11.2616203224
+赵时春 13.900677652
+响应者 11.5027823792
+抹抹 10.2897597393
+恩东 12.8020653633
+数字机 13.900677652
+晶体管 9.20019728618
+登高望远 13.2075304714
+余只 7.76945116249
+小说史 11.4157710022
+侈靡 13.2075304714
+娘家 8.37522471284
+农业部长 11.9547675029
+下民 11.8212361103
+前级 13.900677652
+束窈窕 13.900677652
+男医生 12.1089181827
+雪耻 11.4157710022
+医疗点 11.9547675029
+国际航空 10.0505300503
+麦斯特 12.8020653633
+自由基 9.14708746087
+宣和殿 12.2912397395
+前线 7.14723973338
+焦臭 11.4157710022
+休班 12.5143832909
+军需补给 13.2075304714
+短纤 10.8096351986
+相邦之 13.2075304714
+破家亡国 13.2075304714
+十六条 11.4157710022
+绿化 8.50251495046
+洋荤 12.8020653633
+多发地 13.2075304714
+牧于汉 13.2075304714
+叩诊 11.0674643079
+鲸吞 10.765183436
+铁闪锌矿 13.900677652
+水冷却 12.1089181827
+相对而言 8.9308643524
+短线 6.42931456379
+犟脾气 11.7034530746
+蜀山区 12.8020653633
+妇女杂志 13.2075304714
+走马上任 10.1164880181
+遗送 13.900677652
+黑恶 11.3357282945
+短绌 12.5143832909
+宋江想 12.8020653633
+车马炮 12.2912397395
+清议堂 11.7034530746
+并行执行 12.5143832909
+六万九千余两 13.2075304714
+保大帅 13.2075304714
+短绒 13.2075304714
+天松 13.900677652
+浩然正气 11.598092559
+斯丁人 12.5143832909
+绿卡 11.9547675029
+抽样检查 12.5143832909
+雨蛙 12.2912397395
+感叹 7.68606955355
+徐老爷 10.9562386728
+随心所欲 9.55687223012
+驱动力 8.87679713113
+整罐 13.900677652
+月镜 13.2075304714
+卡塔林 13.900677652
+酷寒 10.7226238216
+短绳 13.2075304714
+讹音 13.900677652
+白羊 9.02548032877
+诊断学 11.598092559
+阿维亚诺 12.5143832909
+三态变化 13.900677652
+一万块 10.5684731418
+滚轧 12.8020653633
+宰德派 12.8020653633
+居姜水 12.5143832909
+神韵 10.0505300503
+诸吕聚 13.2075304714
+痴呆 9.46986085313
+卡尼亚 11.7034530746
+半醒半睡 13.900677652
+照下来 11.7034530746
+绿原 13.900677652
+全运会 10.533381822
+咏歌 13.2075304714
+女知青 12.1089181827
+第四十一回 11.598092559
+音乐门户 13.900677652
+分度头 12.5143832909
+领域专家 11.9547675029
+方为人上 13.900677652
+常瀛 13.2075304714
+杨炎 11.0674643079
+摇摆式 12.8020653633
+布林斯 12.8020653633
+波浪侵蚀 13.2075304714
+灯火辉煌 10.765183436
+胺盐 13.900677652
+诊断室 12.8020653633
+邻里 9.89334446674
+奢靡 10.3743171274
+虚假 7.86759143018
+草屑 11.5027823792
+威斯康星州 11.0674643079
+何益 11.0103058941
+一查到底 11.7034530746
+高压锅 11.5027823792
+草屋 10.1630080337
+十六枚 12.8020653633
+姜虎 10.604840786
+巴多明 13.2075304714
+干涉现象 11.5027823792
+控制键 12.1089181827
+放飞 11.4157710022
+草山 10.604840786
+佛家弟子 13.2075304714
+苦痛 9.87532596124
+报父仇 11.5027823792
+双台子 11.4157710022
+新闻晚报 11.1280889297
+撰稿人 10.3453295905
+放风 10.8096351986
+雪胆 13.900677652
+闻喜县 13.2075304714
+陷阱 8.19356738723
+函告 11.3357282945
+巢营 12.1089181827
+坚硬无比 12.5143832909
+翁文辉 13.900677652
+一万回 13.2075304714
+影业 11.0103058941
+冷若 13.2075304714
+日臻完善 11.1926274509
+洪积 9.29550746599
+花里胡哨 11.8212361103
+宋燕肃 13.900677652
+色釉 11.5027823792
+生铜 13.900677652
+嫩生生 12.5143832909
+日不移影 13.900677652
+引伸到 13.2075304714
+抖乱 13.2075304714
+第八十二条 12.5143832909
+斯坦恩 12.5143832909
+千千结 13.900677652
+三亚港 12.1089181827
+心无旁骛 12.1089181827
+吻上了 13.2075304714
+常熟 8.98069672615
+苏州工业园区 11.7034530746
+冀热辽 12.8020653633
+伊迪卡拉 11.9547675029
+秦恩复 13.2075304714
+钓过 13.2075304714
+耐脏 13.2075304714
+南乡子 13.2075304714
+贾兹 11.8212361103
+国歌声 13.2075304714
+按图索骥 11.0674643079
+贾兰 10.2630914922
+鏊子 11.5027823792
+郑度 13.2075304714
+寓意深长 12.2912397395
+大惊失色 9.03314320152
+刘华清 11.8212361103
+变换器 11.4157710022
+政策底 11.9547675029
+粱肉 13.900677652
+毒枭 12.8020653633
+嗔责 13.2075304714
+非过 13.900677652
+国周郎 13.900677652
+耐腐 10.3743171274
+处警 13.900677652
+蝗蝻 12.8020653633
+沉稳 9.26594866375
+南充县 12.5143832909
+闭门 9.36807815882
+之行 8.74162235276
+陈谷子 13.900677652
+洪福 9.96885201925
+双飞燕 11.7034530746
+贾兄 13.900677652
+贾充 10.4349417492
+三亚湾 13.900677652
+闭锁 8.99540287354
+色酒 13.2075304714
+葫芦花 13.900677652
+贾冰 10.1394775363
+水平面 10.4666904475
+扣满 12.8020653633
+骆宾王 11.2616203224
+相鲍信 12.8020653633
+折节读书 12.8020653633
+生气勃勃 9.59661255877
+弹奏出 13.900677652
+分词 11.7034530746
+马和红 13.2075304714
+粗放型 10.533381822
+国是 9.98865464655
+外高加索地区 12.8020653633
+前缀 10.4041700905
+翁厄曼 13.900677652
+影人 13.2075304714
+仙山琼阁 13.2075304714
+毒杀 10.1164880181
+防空壕 11.9547675029
+一介武夫 11.8212361103
+前缘 8.92394390956
+贺岁版 11.1926274509
+短缺 8.1417758781
+强学会 10.0720362555
+焦耳 9.01032852375
+雅拉 12.8020653633
+民主人士 9.53122979951
+顺应性 11.8212361103
+前置 9.27570483869
+狂吼 11.1280889297
+停车处 13.900677652
+密封门 13.900677652
+宝津楼 11.9547675029
+邻邦 10.4349417492
+距离感 11.5027823792
+影从 13.900677652
+贾母正 12.2912397395
+外攻 13.900677652
+阿尔塞 13.900677652
+军国大事 9.01787572939
+沧源佤族自治县 13.2075304714
+洋粉 13.900677652
+苦瓜 10.2897597393
+杨燕 13.900677652
+老半天 9.89334446674
+重重叠叠 10.4041700905
+药到病除 11.9547675029
+猫鼠同眠 13.2075304714
+软胶囊 12.8020653633
+误认为 9.6811699468
+闻姜维 12.8020653633
+宋度宗 11.1280889297
+雅意 11.7034530746
+纺丝机 13.900677652
+中怡康 13.900677652
+看牢 12.5143832909
+怀上 10.0294766411
+草庐 10.9049453784
+姜蒜 13.2075304714
+草底 13.900677652
+沙模数 12.5143832909
+使唤 9.21854642485
+韩为氏 12.8020653633
+叶笃正 13.2075304714
+何为虚 13.2075304714
+败兴 10.6818018271
+加穿 13.2075304714
+金鱼池 12.8020653633
+祖贯 10.4994802703
+庞口 13.900677652
+秦开破 12.8020653633
+中科院 9.77354326693
+噎着 11.598092559
+波洛夫人 13.2075304714
+草庵 10.4349417492
+指缝间 11.8212361103
+一一记 12.1089181827
+郭宗清 13.2075304714
+天游峰 13.2075304714
+安全监控 11.9547675029
+卡博特 13.900677652
+纪实小说 13.2075304714
+死而无憾 11.0674643079
+马超见 13.2075304714
+第十 9.17328983326
+急急忙忙 9.15574552361
+宗素知 12.8020653633
+九十九道 13.900677652
+怀义 11.598092559
+放马 10.9562386728
+美国贝尔公司 13.900677652
+一两首 13.2075304714
+秦思民 10.8561552143
+轻手轻脚 9.89334446674
+怀乡 11.598092559
+笑呵呵 10.8096351986
+绿党 11.2616203224
+已拨 12.8020653633
+洋缎 13.900677652
+靓妆 12.5143832909
+断断 10.4666904475
+期货价格 8.02574692112
+化肥厂 9.98865464655
+绿光 10.4349417492
+车站 7.89186446653
+李典领 12.5143832909
+黑手 9.77354326693
+哭闹 9.87532596124
+阴灵儿 13.2075304714
+草帘 12.2912397395
+之计 8.00627481771
+怀了 11.2616203224
+雪芹 12.5143832909
+阴阴的 11.9547675029
+年希尧 13.900677652
+爱国者 9.25628675283
+雪花 8.26588804881
+东莞市 10.2117981979
+自愧不如 12.1089181827
+篱笆 9.85762638414
+之论 10.0940151622
+常爱 11.9547675029
+润笔费 13.900677652
+邹韬奋 10.7226238216
+必须品 12.8020653633
+有害信息 10.9562386728
+草帽 9.24671730182
+匾额 9.43476953332
+酷夏 13.2075304714
+音箱 10.533381822
+十六日 9.87532596124
+点函数 13.900677652
+七宗罪 12.8020653633
+草席 10.1871055853
+沉积 7.42833135747
+廖育群 13.2075304714
+掩码 13.2075304714
+如痴如狂 11.7034530746
+义愤 10.0940151622
+雪节 11.8212361103
+十六时 13.900677652
+怀仁 11.2616203224
+院内 8.6966709649
+二十六七岁 11.8212361103
+意大利语 10.0505300503
+吉日良时 12.1089181827
+本田雅阁 12.8020653633
+秦大河 13.2075304714
+还原法 11.0674643079
+之请 10.3453295905
+之说 12.1089181827
+荷载 9.98865464655
+苦短 12.1089181827
+宋江执 12.8020653633
+放高 12.5143832909
+之证 10.642581114
+张国英 13.2075304714
+姜葱 12.5143832909
+引伸出 12.1089181827
+十六斤 13.900677652
+之词 9.75754292558
+顶戴 10.3743171274
+六百块 12.5143832909
+马赛队 13.900677652
+空对地飞 13.900677652
+用心读 13.900677652
+防伪标志 11.9547675029
+霸者 13.900677652
+手中 5.91145624316
+受礼者 13.900677652
+雅思 11.5027823792
+手串 13.2075304714
+物我两忘 13.2075304714
+级次 12.5143832909
+诈降 10.2897597393
+一百五十余家 13.2075304714
+混纺纱 11.9547675029
+宋江接 12.8020653633
+得心应手 9.84023464143
+雕琢 9.4233408375
+之言 8.04274449749
+疙疸 12.8020653633
+手下 6.89579566226
+手上 7.06334483729
+胞壁酸 13.2075304714
+燃料电池 9.72629038208
+膝关节 10.1164880181
+贾化 13.2075304714
+布鲁赫 12.5143832909
+袁宏道 11.9547675029
+票房价值 12.5143832909
+史迪威 10.642581114
+未经审查 13.900677652
+雪茄 9.82314020807
+吉思部 12.8020653633
+氯化物 10.0294766411
+含在口内 13.900677652
+焦芳 11.8212361103
+启事 11.0674643079
+卡拉库姆 12.5143832909
+非跑 13.900677652
+周子山 12.5143832909
+雪荷 12.8020653633
+休止符 11.4157710022
+左宁南 11.598092559
+社会秩序 8.80081122415
+黄州武 13.2075304714
+中国银联 10.8096351986
+贾卡 12.2912397395
+边走边想 11.7034530746
+耐药 10.8096351986
+闹洞房 11.8212361103
+光着头 11.7034530746
+怜爱 10.0294766411
+篱竹 13.900677652
+咏梅 12.8020653633
+梁买茶 12.8020653633
+东宁县 12.5143832909
+网络电话 11.3357282945
+古瓦西 11.8212361103
+贾华 12.2912397395
+张国荣 12.5143832909
+游皇城 13.2075304714
+高大雄伟 11.598092559
+字组 12.5143832909
+他物权 12.5143832909
+南召县 10.9562386728
+雪莱 10.4994802703
+年产值 10.0720362555
+那才德 13.900677652
+取之于 11.2616203224
+并不相同 10.533381822
+猥亵 10.8096351986
+元武宗 11.598092559
+亦能覆舟 11.598092559
+双光束 12.2912397395
+一千五百九十五万余两 13.2075304714
+接处警 13.900677652
+太平盛世 10.3743171274
+奉派 10.8561552143
+搭班 11.0103058941
+狡诈 9.72629038208
+歌楼舞榭 13.900677652
+全民运动 13.2075304714
+救援船 13.2075304714
+多囊肾 11.598092559
+杨玉 10.604840786
+孟德新 12.5143832909
+雪莉 12.8020653633
+滑雪板 11.1926274509
+有限责任 7.21356904411
+浙江省 7.75007488353
+狡计 12.1089181827
+洋红 12.2912397395
+克里米亚 10.2630914922
+无知觉 12.1089181827
+手令 11.5027823792
+苦相 11.2616203224
+控制阀 12.2912397395
+阿巴斯 10.9562386728
+雪菲 12.8020653633
+琪花 12.5143832909
+洋纱 11.7034530746
+启东 9.38981814546
+艺术科 12.5143832909
+黄牛 8.61241062128
+伊籍 11.3357282945
+一万名 12.1089181827
+杨珧 13.900677652
+软酥酥 13.900677652
+雪菜 13.2075304714
+凹版 11.8212361103
+戳儿 13.900677652
+曼齐 11.8212361103
+三毛 10.8561552143
+择主而事 11.9547675029
+心血管病 10.3171587135
+全名是 12.5143832909
+科威特国 13.900677652
+察颜观色 11.7034530746
+字线 12.8020653633
+不得人心 10.533381822
+明光铮亮 13.900677652
+索洛拉 13.900677652
+字纸 11.2616203224
+驻足 9.77354326693
+于咸水 13.2075304714
+杨永 12.8020653633
+凯泰 13.900677652
+直立茎 12.1089181827
+瑟瑟发抖 10.2897597393
+腐化堕落 11.1280889297
+古吉拉特邦 12.1089181827
+下半晌 13.900677652
+见好就收 10.4666904475
+流眼泪 10.2117981979
+凌君甫 11.8212361103
+轻工部 13.900677652
+云南白药 9.22784881751
+储备品 12.8020653633
+售票点 12.8020653633
+传输率 11.7034530746
+塔尔伯特 13.900677652
+影区 12.2912397395
+一八 9.71102290995
+尖声 9.63799777493
+似的 5.8544485509
+杨氏 9.59661255877
+尽可能 7.43608934829
+孟丽君 11.8212361103
+伊萨 11.7034530746
+蒋奇之 13.2075304714
+东临翁 13.2075304714
+黑米 11.7034530746
+捧出来 12.8020653633
+短耳 11.9547675029
+歇顶 13.900677652
+字意 12.5143832909
+驻跸 9.41204128224
+接线板 12.5143832909
+百花园 13.2075304714
+汉军屯 12.8020653633
+音效 12.2912397395
+原辅材料 10.4666904475
+雅罗 11.2616203224
+勒斯 10.4041700905
+之长 8.45394028031
+祝妈 12.8020653633
+角速度 9.87532596124
+循环法 13.2075304714
+影印 9.37888907493
+医疗法 13.900677652
+溜冰 11.9547675029
+犹抱琵琶半遮面 11.7034530746
+苦楚 9.87532596124
+子隆隆 12.8020653633
+苦楝 11.7034530746
+器宇 12.5143832909
+常任理事 11.3357282945
+培训教材 13.900677652
+够凶 13.900677652
+邪心 12.8020653633
+哪一点 10.765183436
+割包 13.2075304714
+雅美 12.8020653633
+刮过来 11.9547675029
+物是人非 10.6818018271
+矫枉 12.8020653633
+诸阮聚 13.2075304714
+十六篇 12.8020653633
+百余篇 11.3357282945
+罗夫斯基 12.2912397395
+侈谈 12.1089181827
+统万城 10.642581114
+尖塔 10.765183436
+凹洼 13.2075304714
+晚礼服 11.7034530746
+掩映 9.55687223012
+前房 11.8212361103
+毫发之差 13.900677652
+敢不敢 9.80633308975
+鲁本斯 10.8561552143
+不显山不露水 11.8212361103
+常氏 13.2075304714
+边疆地区 9.77354326693
+齐政门 13.900677652
+灯烛辉煌 11.1926274509
+前戏 11.9547675029
+赚大 13.2075304714
+吞并 8.48903160012
+核算成本 12.8020653633
+缔约国 9.46986085313
+联络时间 12.5143832909
+和颖书 12.1089181827
+夏正思 11.1926274509
+思谋 10.765183436
+牌子 8.05423887692
+凹洞 12.1089181827
+黑粉 13.2075304714
+手写 10.3171587135
+动荡不安 10.1871055853
+连克二 13.2075304714
+接线柱 12.5143832909
+许夏国 13.2075304714
+扣环 13.900677652
+车顶 9.49395840471
+之门 9.21854642485
+林默娘 13.900677652
+定位系统 10.4994802703
+短手 13.900677652
+苦槠 11.7034530746
+织锦缎 12.8020653633
+人身攻击 11.7034530746
+短打 10.9049453784
+色调 9.01787572939
+杨波 13.2075304714
+罗安达 11.1926274509
+母范翻 13.2075304714
+海洋公园 10.9562386728
+落墨 12.8020653633
+藩属 10.4041700905
+田虎闻 12.8020653633
+从头再来 12.2912397395
+色谱 9.87532596124
+嗷嗷待哺 10.8561552143
+杨泓 13.900677652
+独出心裁 11.7034530746
+反刍动物 11.7034530746
+杨泉 12.5143832909
+王汗牙 13.2075304714
+天道观 11.1280889297
+凡立丁 12.2912397395
+何策擒 13.2075304714
+新婚姻法 13.2075304714
+三世佛 11.5027823792
+推广 6.84968820491
+拿笔 11.3357282945
+采矿点 13.2075304714
+推聋妆哑 13.900677652
+扣牢 13.900677652
+帝王将相 10.6818018271
+氯化汞 11.5027823792
+比较关心 11.4157710022
+杨洪 11.9547675029
+黑素 12.8020653633
+单顺反子 13.900677652
+干女儿 10.2117981979
+中长线 9.14708746087
+白纱 10.5684731418
+黑紫 12.2912397395
+麦德林 12.5143832909
+随意想象 13.900677652
+杨津 13.2075304714
+兔角龟毛 13.900677652
+炮烙之刑 13.900677652
+落套 12.2912397395
+换过去 13.900677652
+投诉率 13.2075304714
+遗赠 11.0103058941
+低价房 11.598092559
+一百余岁 13.2075304714
+国民议会 8.77077893705
+品头论足 13.2075304714
+二十几发 13.2075304714
+凹沟 12.8020653633
+前排 8.94485059437
+臂丛 12.2912397395
+穷奢极欲 11.0674643079
+撇开不谈 13.900677652
+黑黑 12.5143832909
+彰化 10.642581114
+滩地 9.5186510173
+下半月 9.82314020807
+格涅辛 13.2075304714
+高阳县 13.900677652
+取款机 11.8212361103
+杨浩 12.2912397395
+整编师 12.1089181827
+俄罗斯政府 10.7226238216
+一出场 11.8212361103
+习艺 13.2075304714
+毒箭 10.533381822
+杨浦 11.4157710022
+引伸义 13.900677652
+精细化 9.56994431169
+氯化氰 13.900677652
+组织者 9.31571017331
+理论意义 10.6818018271
+强制性 8.98802276624
+关脉 12.2912397395
+氯化氢 10.0505300503
+鹫峰 10.8561552143
+杨济 13.2075304714
+前提 6.58081272217
+影剧 11.598092559
+强手如林 12.8020653633
+氯化氨 13.900677652
+洪文 13.900677652
+扶摇子 13.2075304714
+蕴藻浜 12.8020653633
+马裤呢 12.8020653633
+香魂女 13.2075304714
+人地生疏 11.1926274509
+人民意志 12.1089181827
+虹桥路 12.8020653633
+论资排辈 11.5027823792
+佛诞节 12.8020653633
+反向而行 13.900677652
+高潮线 11.9547675029
+煤油灯 9.94943393339
+魏州昌 12.5143832909
+储气罐 12.5143832909
+挣大钱 11.5027823792
+耐力赛 13.2075304714
+邬梨依 13.2075304714
+那银铃 13.2075304714
+撼动 9.85762638414
+常洵 13.900677652
+过高估计 11.8212361103
+梅塔河 13.900677652
+前指 11.9547675029
+穷鬼 11.1280889297
+罢退 12.8020653633
+短外套 12.8020653633
+十六章 12.2912397395
+狗屁不通 11.9547675029
+叶绿体 9.53122979951
+小型机械 11.9547675029
+主题法 12.5143832909
+绿云 10.2371160058
+常洛 12.5143832909
+麻溜儿 13.2075304714
+杆秤 10.9049453784
+开普顿 13.2075304714
+奉献 8.62767809341
+大批量生产 10.0505300503
+附页 13.900677652
+常洗 12.5143832909
+广告学 13.900677652
+蝈蝈 11.2616203224
+秉烛 10.604840786
+灰鸭 13.900677652
+自治区 7.46773755924
+永康县 12.8020653633
+钱君 12.8020653633
+符合要求 10.0940151622
+单数据流 13.900677652
+性格化 11.7034530746
+商中英 13.2075304714
+酒瓶子 10.7226238216
+贷款率 13.900677652
+沪杭甬 11.5027823792
+墨尔本市 13.2075304714
+四分钟 13.900677652
+臣民 8.02574692112
+曹魏 9.25628675283
+鬈曲 11.3357282945
+杨淑 12.1089181827
+逊色 9.22784881751
+提出诉讼 11.7034530746
+主任科员 11.0674643079
+下颌运动 13.900677652
+尖头 10.1630080337
+庞统入 13.2075304714
+布瓦耶 12.2912397395
+掩杀 9.25628675283
+昌马堡 13.2075304714
+放射病 12.1089181827
+戳伤 12.5143832909
+定妆 13.900677652
+扶玄德 13.2075304714
+谢大夫 11.8212361103
+车箱 10.604840786
+插值法 12.8020653633
+苗小苗 13.2075304714
+艰巨性 10.8561552143
+迈达尼 12.8020653633
+一养 13.900677652
+巴塞尔 9.72629038208
+杨温 12.1089181827
+专案组 9.43476953332
+弯下去 12.1089181827
+商务大厦 11.7034530746
+托勒尔 12.1089181827
+十万里 13.900677652
+弓裔 13.2075304714
+机会均等 11.1280889297
+雪鸡 10.5684731418
+启发 8.26232298264
+粪球 12.8020653633
+车骑 9.48183704418
+摄影奖 11.598092559
+内盖夫 13.900677652
+手包 12.2912397395
+字据 10.9049453784
+祝寿 9.84023464143
+成掌东 13.2075304714
+传诵 9.46986085313
+八届全国政协 12.8020653633
+志不在此 13.2075304714
+警卫部队 11.598092559
+子项目 13.2075304714
+第二盏 13.2075304714
+黄原开 12.8020653633
+家乡水 12.8020653633
+曹颖 13.900677652
+业迹 12.8020653633
+之面 10.2897597393
+信末 13.900677652
+借贷无门 12.8020653633
+连严阵 12.5143832909
+生齿日繁 12.8020653633
+瓢虫 10.1871055853
+手印 10.0088573539
+手卷 11.3357282945
+引资 10.8096351986
+姜风 10.1164880181
+仇未报 12.2912397395
+六套 11.8212361103
+贝努利 12.5143832909
+酒井法子 13.900677652
+郴县 12.1089181827
+十场 13.900677652
+音板 12.8020653633
+史择题 12.8020653633
+焚身 13.2075304714
+五万里 13.2075304714
+花车 12.2912397395
+康斯坦丁内斯库 13.900677652
+百余万口 12.2912397395
+童年时期 11.1926274509
+碳酸盐 9.01787572939
+炸弹 7.67414098269
+帅群 12.1089181827
+马超闻 12.8020653633
+屈臣氏 12.8020653633
+朱执信 11.2616203224
+历历可辨 12.8020653633
+黑纱 10.2371160058
+诗书门第 13.900677652
+贾人 12.2912397395
+常温 9.74179456862
+十六种 13.2075304714
+黑纹 10.6818018271
+黑纸 12.5143832909
+活期存款 9.7898037878
+黑线 10.8561552143
+还原炉 12.2912397395
+任远东 11.9547675029
+黑红 10.642581114
+樱桃小口 12.2912397395
+法西斯主义 9.80633308975
+杨溢 12.5143832909
+压簧 13.900677652
+旁逸斜出 13.900677652
+安蒂叙 13.900677652
+杨溥 10.3743171274
+阻隔开 13.900677652
+邻近 7.76295059789
+惠禅师 13.2075304714
+增城县 12.8020653633
+对话框 12.8020653633
+手压 11.5027823792
+怀玉山 10.8096351986
+都鄙有章 13.900677652
+常清 11.7034530746
+鲁王部 13.2075304714
+拉德纳 11.8212361103
+诸宗王 11.7034530746
+罗世昌 13.2075304714
+折旧率 11.8212361103
+质心 10.2117981979
+充值卡 12.1089181827
+实意 12.2912397395
+英气逼人 12.2912397395
+宏图大志 13.2075304714
+邻边 13.900677652
+扑噜 12.2912397395
+车驾 9.84023464143
+之音 9.98865464655
+王于恶 13.2075304714
+大风雪 11.598092559
+业主权益 12.5143832909
+知情不报 12.2912397395
+车马 9.04864738806
+镌刻 9.62401153296
+不可胜言 13.2075304714
+手参 13.900677652
+口粗 12.8020653633
+音柱 13.2075304714
+贪婪成性 12.8020653633
+吊竹梅 13.900677652
+徐治功 8.96620371885
+国藩 13.2075304714
+油面筋 13.2075304714
+资格 6.911342386
+住所地 10.9049453784
+毒砂 11.8212361103
+贾仁 13.900677652
+夏侯蔼引 11.8212361103
+甘温之 13.900677652
+关键词 8.90346537821
+尊重知识 12.1089181827
+感觉不好 13.900677652
+勒曼 12.2912397395
+法赫萨 13.900677652
+手到 11.1926274509
+怀化 10.5684731418
+手制 10.9049453784
+天下为公 10.765183436
+后影 13.2075304714
+两万多名 13.2075304714
+功能性 9.29550746599
+神经官能症 11.2616203224
+尺地 12.8020653633
+心绞痛 10.0940151622
+明码标价 11.0103058941
+戎马一生 12.8020653633
+落子 11.8212361103
+贾伟 12.5143832909
+损坏率 12.8020653633
+焦黄 10.4666904475
+还原焰 12.8020653633
+手创 12.5143832909
+杨诚真 13.2075304714
+蝶儿 13.2075304714
+意大利队 12.8020653633
+海南藏族自治州 11.9547675029
+居雅尔 13.2075304714
+蓝筹权 11.2616203224
+言贵 13.2075304714
+保留剧目 11.1926274509
+启功 11.9547675029
+搭载 8.38724890581
+伏尔铿 13.2075304714
+真因子 13.900677652
+战情 13.2075304714
+洋房 10.0088573539
+黑网 13.900677652
+抗寒性 12.5143832909
+不羁之才 13.900677652
+金尊 13.900677652
+之际 6.53360059209
+唐山地区 11.0103058941
+魁梧奇伟 13.900677652
+色达 13.2075304714
+附骥 13.2075304714
+卷心菜 11.1926274509
+处长 7.40390266179
+黄崖洞 12.2912397395
+娃儿 9.55687223012
+工农路 13.900677652
+肱骨 11.5027823792
+师文工 13.2075304714
+编译馆 12.2912397395
+三十级 13.2075304714
+衔枚 11.5027823792
+数字网 12.5143832909
+手动 8.44535653662
+黑羽 12.5143832909
+禽类 10.3453295905
+尖子 10.533381822
+风靡一时 10.2371160058
+炼钢 9.10488710638
+下半旗 12.2912397395
+三百六十五 11.9547675029
+手势 7.78478552649
+之难 9.62401153296
+高山植物 12.2912397395
+人工控制 10.6818018271
+中国式 9.5062284973
+归路 9.53122979951
+雪龙 11.598092559
+杨澜 12.1089181827
+落寞 10.6818018271
+合格品 13.900677652
+牛头马面 11.8212361103
+萧怀侯 13.2075304714
+下半时 13.2075304714
+申诉状 13.900677652
+之隔 11.0103058941
+如意算盘 10.6818018271
+王陵之 12.1089181827
+杜门不出 13.900677652
+吃着不尽 13.900677652
+雕梁 12.5143832909
+利翁 12.1089181827
+遗迹 7.48068272383
+汗液 10.1164880181
+索洛维 13.2075304714
+党员个人 13.2075304714
+手勤 12.5143832909
+怀友 13.900677652
+将军墓 10.8561552143
+难于启齿 12.8020653633
+众多人口 13.2075304714
+时不我待 11.9547675029
+温斯坦 13.900677652
+火柴杆 12.1089181827
+周厉王 11.598092559
+自耕农 9.55687223012
+七万家 13.2075304714
+失踪案 13.2075304714
+第九天 12.1089181827
+拉斯维加斯 10.7226238216
+物候观测 12.8020653633
+怀古 10.2897597393
+显现出 9.35738286971
+好来宝 11.7034530746
+炼铜 10.2117981979
+落实 6.87780956589
+落定 10.1871055853
+通信处理机 12.8020653633
+近两年来 9.71102290995
+炼铁 9.08039608637
+可追踪 13.2075304714
+荷兰盾 12.1089181827
+求福禳灾 13.900677652
+亲生女 13.900677652
+落山 9.77354326693
+杨格 11.8212361103
+短暂 7.47743068844
+越矩 12.1089181827
+苦活 11.8212361103
+裙摆 11.598092559
+不雅致 13.2075304714
+饮食 6.97901946782
+租用者 13.900677652
+总装厂 13.2075304714
+殉道者 11.1926274509
+院务 11.0674643079
+搭桥 10.3171587135
+霸王 9.03314320152
+维茨基 12.2912397395
+搭档 9.98865464655
+有声电影 11.3357282945
+第五十八篇 13.2075304714
+杨树 9.16447920358
+开回 11.9547675029
+尖峭 11.9547675029
+常梅 9.93038573842
+尖峰 9.71102290995
+中国康复研究中心 13.900677652
+边郡领 13.900677652
+迷倒 12.2912397395
+字数 7.27395990273
+隔上 13.900677652
+洋教 11.4157710022
+雕漆 10.4994802703
+三十四篇 13.2075304714
+甜腻腻 13.2075304714
+恩准 10.0088573539
+敲诈勒索罪 11.2616203224
+哭过 10.1871055853
+蓬塔雷 13.900677652
+苦海 10.2371160058
+多行不义必自毙 12.2912397395
+影坛 9.37888907493
+情报机构 10.5684731418
+奥雷利 13.2075304714
+母亲河 12.5143832909
+百分之二十二点 13.900677652
+姜黄 11.9547675029
+凹槽 10.642581114
+扣眼 13.900677652
+沉落 10.5684731418
+高脚杯 12.5143832909
+鯷鱼 13.2075304714
+杨桦 12.8020653633
+资源 5.36172296878
+汉字结构 12.8020653633
+地面 5.93930745026
+步骑军 12.8020653633
+高不可攀 10.765183436
+同工 13.900677652
+蛤蟆 9.45802639549
+方伯谦 10.5684731418
+流星赶月 12.5143832909
+区间车 12.8020653633
+中长篇 13.2075304714
+落尘 12.1089181827
+第九座 13.900677652
+五日游 13.900677652
+扁桃体炎 10.3743171274
+矫捷 11.3357282945
+飞来横祸 12.1089181827
+杨桃 11.5027823792
+神姿 12.8020653633
+情感天地 13.900677652
+诈败 10.4349417492
+恩典 9.65218240993
+望老爷 12.1089181827
+字旁 11.5027823792
+空中巡逻 12.8020653633
+大鱼吃小鱼 11.5027823792
+普济众生 13.900677652
+徇私枉法 11.7034530746
+一万余 10.4349417492
+速度限制 12.5143832909
+枯燥乏味 11.9547675029
+任东南 13.900677652
+恩公 10.765183436
+来说 5.09965981844
+虚套子 13.900677652
+苦涩 9.27570483869
+凉拌菜 12.1089181827
+湘妃竹 11.7034530746
+搭棚 11.7034530746
+惊险片 12.1089181827
+荷锄 12.8020653633
+含油量 10.4994802703
+动态效果 13.900677652
+伦理学家 12.2912397395
+崩龙族 12.5143832909
+粗通 12.1089181827
+贴息贷款 11.9547675029
+尖山 10.642581114
+恩克 12.2912397395
+哈巴河 11.598092559
+不读 11.0674643079
+山九仞 13.900677652
+他方 10.0505300503
+先进集体 10.6818018271
+自由体 11.4157710022
+放肆 8.83177344976
+杨梅 9.80633308975
+第十六章 9.91169360541
+十里坪 12.1089181827
+战略方针 9.46986085313
+黑磷 13.2075304714
+写文章 10.0940151622
+前景 6.52604863676
+细砂纸 13.900677652
+斯坦福 10.4349417492
+诺贝尔基金会 11.5027823792
+伊藤 9.7898037878
+圣诞老人 11.598092559
+斗转星移 12.1089181827
+杨森 11.2616203224
+半轮 11.7034530746
+小聪明 11.1926274509
+落岩 11.8212361103
+事务繁多 13.2075304714
+晃晃悠悠 10.4994802703
+影城 9.75754292558
+谁能给 11.598092559
+战悚 13.900677652
+沙利文 11.4157710022
+气候志 12.2912397395
+洋文 11.2616203224
+海上生明月 12.2912397395
+曹鹏 13.2075304714
+前晌 13.2075304714
+舞台化 13.2075304714
+基因组 10.8561552143
+木马程序 12.1089181827
+想学 10.3453295905
+离瓣花冠 13.900677652
+夥伴 13.900677652
+配电装置 12.8020653633
+兵强将勇 12.8020653633
+举报信 11.3357282945
+平山镇 13.2075304714
+基本模式 11.8212361103
+前晚 10.4994802703
+浪漫主义 8.30225569298
+发射成功 10.6818018271
+杨椿 13.2075304714
+劳改营 13.2075304714
+亚丁港 12.8020653633
+蛤蚧 10.7226238216
+人急智生 13.900677652
+第三十三代 13.900677652
+廖若晨星 13.900677652
+攻心战 13.2075304714
+林姐 10.9562386728
+够劲 12.8020653633
+棺板 9.93038573842
+骑虎难下 11.8212361103
+山高谷 10.2630914922
+四环路 12.2912397395
+红房子 12.5143832909
+非徒 13.900677652
+芭比 13.2075304714
+色觉 10.8561552143
+拶子 12.5143832909
+蛤蚌 13.2075304714
+编委会 10.3171587135
+詹石梯 11.3357282945
+周仆停 12.8020653633
+接踵而来 10.2117981979
+五院 10.533381822
+曾仰丰 13.2075304714
+短枪 10.4349417492
+法兰西共和国 11.0103058941
+妥善安置 11.0674643079
+酒店客房 13.900677652
+昌马峡 13.2075304714
+顶尖人物 12.5143832909
+棺材 7.0644183747
+往蹇来连 13.900677652
+宋二人 10.3171587135
+弱不胜衣 13.900677652
+短柄 10.604840786
+一万五 12.2912397395
+滩区 11.8212361103
+棺木 8.91707103027
+杨楼 12.8020653633
+尺八 11.4157710022
+联觉 12.8020653633
+农信社 10.0505300503
+核试验场 13.900677652
+孙行者 8.70772080109
+自由人 9.44633035572
+灯光设备 13.2075304714
+耐饥 11.3357282945
+约束矩阵 13.900677652
+一万二 12.2912397395
+插下去 12.8020653633
+两条船 11.598092559
+拉起萧 13.900677652
+赵云之 11.9547675029
+圣马可 11.7034530746
+陈恭尹 12.8020653633
+司登 11.5027823792
+一万亿 11.7034530746
+闭路 11.8212361103
+风俗习惯 9.46986085313
+之道 7.85804481829
+苦汁 12.1089181827
+苦求 11.598092559
+小瀑布 11.5027823792
+苟安一隅 13.900677652
+摄影师 10.0720362555
+铰链轴 13.900677652
+亲亲的 13.2075304714
+棺柩 11.3357282945
+咏物 10.765183436
+休眠芽 12.5143832909
+拉德福 12.2912397395
+电泳仪 13.900677652
+顾大局 11.7034530746
+脱模剂 13.900677652
+一家之学 13.900677652
+短期 5.66266940276
+落差 8.17382990439
+主席国 10.9049453784
+前机 13.900677652
+蹑踪 13.900677652
+喂奶时 11.8212361103
+专用品 13.900677652
+信奉异教 13.900677652
+前有 9.05649056552
+滤布 12.2912397395
+卡比拉 13.2075304714
+闪着光 11.2616203224
+合宪性 12.5143832909
+桑塔雅 12.2912397395
+手势语 13.2075304714
+搭进 13.900677652
+核移植 12.8020653633
+前朝 8.63281949291
+深谙此道 11.9547675029
+前期 5.93339747303
+步履维艰 11.0103058941
+阿速军 12.1089181827
+前来 6.25575830702
+零售总额 8.89004235788
+臭味 9.12999302751
+姜齐 12.8020653633
+十响 12.2912397395
+托勒密 9.4233408375
+宫里呆 13.900677652
+比达尔 12.5143832909
+靖江市 12.5143832909
+疲弱 8.20358416547
+违反常理 13.900677652
+国际惯例 9.74179456862
+供求 7.96843246453
+始皇帝 10.8561552143
+促进性 12.5143832909
+十六级 13.900677652
+肺腑 9.89334446674
+一万两 9.7898037878
+炒青菜 13.2075304714
+短板 10.3171587135
+黑种 13.900677652
+拒马河 10.4349417492
+钢珠 11.1280889297
+巢鼠 13.900677652
+不讳 12.2912397395
+成都五牛 13.900677652
+连卸岭 13.2075304714
+监察院长 13.900677652
+不讲 12.5143832909
+检波器 11.4157710022
+红白分明 12.5143832909
+安穆凯 13.900677652
+观众群 13.900677652
+中纤板 11.9547675029
+迷到 13.900677652
+炸鸡翅 13.2075304714
+赚得 9.4233408375
+栾树属 13.2075304714
+无根萍 12.5143832909
+落幕 9.34680076038
+溘先朝露 13.900677652
+承受力 10.2117981979
+吞声 11.598092559
+硬脂酸 11.2616203224
+质子 8.53470163695
+劳役地租 11.3357282945
+穆哈卡 13.2075304714
+基因簇 13.900677652
+泗洪县 11.8212361103
+扣留 8.88339781516
+主题歌 12.5143832909
+桑耶寺 12.1089181827
+压延机 12.2912397395
+安全监管 10.8096351986
+毛青布 12.8020653633
+他杀 9.61021821083
+函件 10.4666904475
+遗言 9.53122979951
+蹬踏 12.1089181827
+钓钩 11.1926274509
+端公 11.7034530746
+武侯曾 12.8020653633
+八音节 13.900677652
+秉着 12.1089181827
+香芹菜 13.900677652
+鹅绒 12.8020653633
+杨民高 10.5684731418
+写错字 13.900677652
+痴人 11.8212361103
+交流学习 13.2075304714
+乱开 13.900677652
+匾联 12.2912397395
+洋服 13.2075304714
+违背良心 12.5143832909
+白江之 13.2075304714
+燃烧武器 13.2075304714
+如有所失 11.8212361103
+跳龙门 12.5143832909
+药皂 13.2075304714
+中共中央宣传部 10.4041700905
+千分之一 10.1394775363
+落市 13.900677652
+开放源码 13.900677652
+给水 9.80633308975
+虚怀若谷 11.1926274509
+乱弄 12.8020653633
+周仆叹 12.8020653633
+心脏科 13.2075304714
+最让人 9.93038573842
+质对 13.900677652
+再也不肯 10.8561552143
+毒米 13.900677652
+第九局 13.2075304714
+王部金 13.2075304714
+第九层 12.8020653633
+常模 12.5143832909
+义勇军 10.3171587135
+被遗弃 10.1630080337
+收银台 11.8212361103
+镢头 9.85762638414
+教学法 10.642581114
+判读 11.4157710022
+钱升 11.7034530746
+郓城县 9.66657114738
+小不点 12.8020653633
+数十层 12.8020653633
+台湾歌手 13.900677652
+判词 13.2075304714
+饮马 10.4666904475
+史坚如 12.5143832909
+地方队 10.642581114
+控制车 12.1089181827
+杨楼乡 13.900677652
+日本外务省 11.8212361103
+市行 13.900677652
+当地政府 9.04086524761
+倡首 13.2075304714
+正面人物 11.598092559
+追索权 12.5143832909
+宁缺毋滥 12.2912397395
+秦钟趁 13.2075304714
+黑竹 12.8020653633
+洋枪 11.7034530746
+许德珩 11.9547675029
+却不曾 9.96885201925
+落座 9.26594866375
+中兴公司 13.900677652
+钱包 9.38981814546
+斯图加特 10.0720362555
+会意字 11.7034530746
+澳大利亚政府 10.3453295905
+全然不顾 11.1280889297
+雅科 10.4666904475
+似火 10.642581114
+霉干菜 12.1089181827
+炼金 11.598092559
+涧水 11.1280889297
+信都芳 13.900677652
+波光粼粼 11.9547675029
+怠于 11.1280889297
+杆线 12.8020653633
+六百余 12.8020653633
+愚弟 10.1871055853
+冀北山 11.598092559
+血药浓度 12.1089181827
+资水 9.93038573842
+冲地 13.900677652
+削铁如泥 12.2912397395
+雅称 11.9547675029
+直升机场 12.8020653633
+短文 11.2616203224
+芥子油 12.8020653633
+三百六十万 12.8020653633
+智慧板 13.900677652
+两码事 10.3743171274
+六百人 12.2912397395
+扑出去 12.5143832909
+生物医学 10.1164880181
+该轮 10.4666904475
+杨欣 11.7034530746
+前方 7.49544919394
+史经世 13.2075304714
+影后 11.1926274509
+蹬车 11.8212361103
+摄影展 13.2075304714
+前文 9.77354326693
+无踪无影 11.1926274509
+色诱 13.900677652
+思贤 11.598092559
+鹅群 13.900677652
+排气量 11.9547675029
+元辅张 11.4157710022
+罪大恶极 10.6818018271
+始终如一 10.765183436
+避而不答 11.8212361103
+兴头上 10.9049453784
+雅砻 11.598092559
+国防力量 11.5027823792
+王锡祺 12.5143832909
+资深 7.78699547214
+前日 7.69611988941
+分走 12.2912397395
+梅安徒 13.900677652
+沉思 7.80260336981
+人不为己 12.8020653633
+宾客如云 13.2075304714
+曾纪鸿 13.900677652
+阿速卫 12.5143832909
+茶壶 9.24671730182
+违法犯罪 9.30555780184
+渭河平原 10.604840786
+生理 7.15897695732
+杨正 11.1280889297
+杨武 12.5143832909
+王旭东 13.900677652
+腌渍物 13.900677652
+扣球 11.2616203224
+放荒 11.8212361103
+正正之旗 13.2075304714
+纪检委 10.3453295905
+会员大会 11.9547675029
+前旗 11.4157710022
+短时 10.0505300503
+子玩 13.2075304714
+二十九日 10.2897597393
+雅利安 9.55687223012
+宫颈口 11.4157710022
+移归 13.900677652
+这山望着那山高 12.2912397395
+黑箱 11.598092559
+索拉里 13.900677652
+航空运输 8.66423568915
+杨殿 13.2075304714
+官朝贺 11.1926274509
+等于零 9.84023464143
+资浅 11.7034530746
+六百两 11.9547675029
+杨殷 12.1089181827
+黑管 11.8212361103
+山体中 10.765183436
+讳忌 13.2075304714
+六百串 13.900677652
+北朝南 13.900677652
+沟壑纵横 10.4349417492
+战意 13.2075304714
+田中角荣 12.2912397395
+积贫积弱 11.1280889297
+氧气 8.07763175649
+牌局 11.8212361103
+宋江笑 11.3357282945
+芥子气 11.8212361103
+伊阿宋 12.2912397395
+奢谈 11.3357282945
+儒商 13.2075304714
+六百万 11.1926274509
+南华大学 13.2075304714
+青梅竹马 10.9049453784
+科威特人 12.5143832909
+飘飘洒洒 12.1089181827
+贝努埃 11.3357282945
+三百六十两 13.900677652
+大前年 13.2075304714
+黑箍 13.2075304714
+沦落风尘 12.1089181827
+梁鸿志 12.8020653633
+处里 11.9547675029
+斜眼看人 13.900677652
+立法机关 9.41204128224
+矫情 10.642581114
+圣马克 12.5143832909
+打头炮 13.2075304714
+常武 13.2075304714
+短效 12.5143832909
+五音 10.765183436
+介村夫 13.2075304714
+立地成佛 11.598092559
+毒素 8.30596627237
+用心看 13.2075304714
+出水孔 11.8212361103
+影响 3.98605235503
+道童 10.4041700905
+落得 8.5440913773
+有没有 6.79325217787
+褐斑病 12.2912397395
+博絮埃 13.900677652
+一段段 11.2616203224
+遗训 11.0103058941
+秉直 12.8020653633
+自然区划 9.59661255877
+五十多米 13.2075304714
+景谷林业 10.5684731418
+大清早 9.96885201925
+消力池 12.5143832909
+杨毅 9.31571017331
+怀堂 13.900677652
+洪泽 12.1089181827
+纪念周 12.5143832909
+互动式 13.2075304714
+清水河 9.96885201925
+无意识 9.5186510173
+遗著 10.0088573539
+牌号 10.2897597393
+惨不忍闻 12.5143832909
+滤去 12.2912397395
+手头 8.80081122415
+高岩岸 13.900677652
+半饥半饱 12.5143832909
+刘念台 12.8020653633
+魏清慧 8.77077893705
+洪波 10.604840786
+洋楼 11.0103058941
+伏藏 12.2912397395
+献身者 13.900677652
+洪泛 12.8020653633
+马赞达 12.8020653633
+安思顺 13.900677652
+牌友 12.1089181827
+唐玉牒 12.8020653633
+况臣莽 13.900677652
+每天花 12.5143832909
+影子 7.45020722983
+宗在文 13.2075304714
+巴燕戎 12.5143832909
+由六卿 12.8020653633
+梨树县 12.8020653633
+娃娃 7.68807155622
+赵莲秀 13.2075304714
+美利坚合众国政府 13.2075304714
+洪河 10.4994802703
+无冤无仇 11.4157710022
+申呈陈 12.8020653633
+班详稳 13.2075304714
+第几次 12.2912397395
+明里 10.604840786
+毒犯 12.8020653633
+私人资本 10.3171587135
+交代任务 12.8020653633
+辛凉解 12.2912397395
+凯纳 12.5143832909
+立新君 10.4666904475
+社会保障部 9.61021821083
+洗不掉 12.8020653633
+手套 8.48903160012
+卢挚 12.8020653633
+熊大闰 13.2075304714
+遗落 10.8561552143
+物理学界 11.5027823792
+六杯 12.8020653633
+丘万壑 13.900677652
+撮合 9.85762638414
+传讯 10.8096351986
+东公启 13.2075304714
+扣篮 12.8020653633
+刘奎 13.900677652
+糜竺 10.2897597393
+乐志论 13.900677652
+凭吊 10.0720362555
+向琛航 13.900677652
+玉屏箫 12.8020653633
+绷巴吊拷 13.900677652
+腰阳关 13.900677652
+酷似 8.9308643524
+七十八岁 12.8020653633
+毒物 9.20019728618
+观音土 12.2912397395
+有口皆碑 11.0103058941
+中箭落马 11.8212361103
+洪江 10.5684731418
+抱恨终天 12.5143832909
+场地 8.24119543622
+靠水 13.2075304714
+隔热膜 12.5143832909
+毒牙 11.8212361103
+车速 8.81308131674
+主导地位 8.50251495046
+洋槐 11.0103058941
+吞噬 8.67493097826
+代代木 12.8020653633
+弄假 13.900677652
+汉举哥 12.5143832909
+盛产 7.21606592431
+百余万头 13.2075304714
+潘一鹤 10.5684731418
+卫忠 12.8020653633
+梅塔斯 12.8020653633
+高压脊 10.9049453784
+黑瓷 11.5027823792
+百分之五点 12.5143832909
+洪水 7.42216800977
+畅流 12.2912397395
+勒派 13.2075304714
+棉絮 9.71102290995
+密封胶 10.9562386728
+切切实实 11.0674643079
+习语 12.8020653633
+黑瓦 10.9049453784
+牌匾 10.8561552143
+永福路 12.8020653633
+参谋长 8.07173203437
+诬告陷害 12.2912397395
+车道 8.61747392324
+变奏曲 11.1280889297
+找麻烦 11.0103058941
+巢里 11.8212361103
+冶金工业 9.40086798165
+拐回来 12.2912397395
+高山病 12.8020653633
+整体感 11.3357282945
+洪氏 11.5027823792
+平川区 12.5143832909
+迷迷茫茫 13.2075304714
+阿尔卑斯山区 10.9562386728
+纵合 13.900677652
+黑田 11.9547675029
+朱屺瞻 12.8020653633
+唐僧乃 11.7034530746
+洋桥 13.2075304714
+哈扎拉 12.2912397395
+关某休 13.2075304714
+外患罪 12.5143832909
+洪深 10.5684731418
+避孕措施 11.9547675029
+再生资源 10.4041700905
+搭救 9.20932976975
+沉湎 10.2117981979
+家门不幸 12.2912397395
+常新 12.2912397395
+娃子 9.14708746087
+放账 13.2075304714
+媒体播放器 13.2075304714
+溯流 12.1089181827
+鞑靼斯坦 13.900677652
+体羽 10.5684731418
+前首相 11.2616203224
+有恃无恐 9.74179456862
+第九句 13.900677652
+养殖面积 11.598092559
+徐老板 13.900677652
+译成密码 13.900677652
+乱写 13.2075304714
+吃喝嫖赌 10.8561552143
+崔德 12.2912397395
+蹬腿 11.598092559
+麦伯良 12.5143832909
+千军易得 12.5143832909
+九头 11.0103058941
+尖凿 13.900677652
+敲起来 11.598092559
+上尉军官 13.2075304714
+放走 9.63799777493
+圩子 13.900677652
+落儿 12.2912397395
+真慢 13.900677652
+苦恼 8.32094782599
+三千五百余 12.8020653633
+灰垢 11.8212361103
+放起 9.91169360541
+清创术 12.8020653633
+翡翠色 13.2075304714
+没屋架梁 13.900677652
+山脚下 8.7245279194
+山西队 13.2075304714
+专卖品 13.900677652
+蹬脚 13.2075304714
+牵回来 12.2912397395
+贸易大学 12.5143832909
+洪涝 10.0505300503
+扣税 11.3357282945
+神论者 11.9547675029
+洪涛 8.9519177616
+益气养血 11.598092559
+闲置费 11.0674643079
+字样 8.32094782599
+天子山 12.2912397395
+杨敏 13.900677652
+贾母赏 13.900677652
+披挂上阵 11.8212361103
+先进分子 10.8096351986
+沉渣 11.598092559
+苦恋 12.8020653633
+车里 8.83177344976
+土壤质地 11.8212361103
+字根 12.1089181827
+井陉 10.1394775363
+前次 9.62401153296
+安长叹 13.2075304714
+提留款 12.8020653633
+沉滞 12.1089181827
+第九十 12.2912397395
+诸部争 12.8020653633
+漫无边际 10.8096351986
+妖道 9.08039608637
+受惠者 12.2912397395
+前款 11.2616203224
+达朗贝尔 10.9049453784
+脑震荡 11.1280889297
+一百余名 13.2075304714
+短欠 13.900677652
+夏河县 12.2912397395
+闻香玉 11.1280889297
+齐丞相 13.2075304714
+阿谀逢迎 12.1089181827
+杨斌 13.900677652
+断掌 13.900677652
+连窝端 12.2912397395
+短款 12.1089181827
+恐高症 10.765183436
+杨文 11.1280889297
+第九卷 9.4233408375
+前此 10.9562386728
+王富洲 11.9547675029
+附逆 13.900677652
+短歌 11.598092559
+伊基托斯 12.8020653633
+天下为家 13.2075304714
+世面 9.69598503258
+江南造船厂 11.7034530746
+附送 12.8020653633
+黑痣 11.2616203224
+大碗茶 12.1089181827
+田舍翁 13.900677652
+杨旭 10.604840786
+皂石 13.2075304714
+有完没完 11.598092559
+常数 8.32094782599
+埃切维 13.2075304714
+诱变剂 12.5143832909
+东四十条 13.900677652
+洪洞 10.8096351986
+沉溺 10.8561552143
+摇头叹息 10.9049453784
+皮里春秋 13.900677652
+庄宪祖 12.1089181827
+毒麦 12.5143832909
+暗示疗法 12.5143832909
+诊断仪 12.2912397395
+丘将军 12.8020653633
+唐僧亲 13.2075304714
+苦情 10.642581114
+康立乾 11.0103058941
+汉军击 12.8020653633
+首演 8.87679713113
+艮岳 11.4157710022
+当得起 11.1280889297
+尖儿 10.5684731418
+石油化学 10.4994802703
+怀娃 13.2075304714
+北京铁路局 13.900677652
+权豪势要 13.900677652
+一笔不苟 12.8020653633
+散播谣言 13.900677652
+密封舱 11.5027823792
+秉笔 9.38981814546
+齐齐扎 13.2075304714
+曹邺 13.900677652
+黑瘤 13.2075304714
+文籍 11.9547675029
+海贝格 12.8020653633
+掩没 12.2912397395
+任东州 12.1089181827
+承受度 12.1089181827
+吕祖谦 11.5027823792
+杨春 8.84443184663
+沉浸 8.48457724977
+发痴 11.1926274509
+病理变化 10.0294766411
+布鲁顿 13.2075304714
+胶漆 13.900677652
+祝史 13.900677652
+杨易 13.900677652
+行云流水 11.1280889297
+神鬼难测 13.2075304714
+质块 13.2075304714
+尺布 13.2075304714
+杨昊 13.2075304714
+澳门 8.41588071849
+杨明 10.9562386728
+沉浮 9.87532596124
+杨昂 12.2912397395
+哨声波 13.900677652
+小教室 13.900677652
+俺村 11.7034530746
+宋氏家族 13.900677652
+杨智 11.8212361103
+劳教所 12.1089181827
+呼朋唤友 13.900677652
+落到 7.56917580208
+弹性介质 11.8212361103
+尖劈 12.2912397395
+别克君威 13.900677652
+衣传 13.900677652
+黑白 8.56313957227
+恩德 9.89334446674
+志哀 12.8020653633
+杨晨 12.8020653633
+滤出 11.1280889297
+杨景 11.598092559
+奴隶起义 10.9049453784
+短棒 11.2616203224
+清风徐来 12.1089181827
+赚取 9.01032852375
+迷幻 11.7034530746
+哈辛塔 13.900677652
+瞪视 11.3357282945
+聚硅氧烷 12.5143832909
+长毛绒 11.9547675029
+救国救民 11.2616203224
+吞咽 9.38981814546
+尺幅 12.1089181827
+草莓酱 13.900677652
+杨晔 13.900677652
+杨晋 13.2075304714
+薄钢板 11.3357282945
+零年 12.8020653633
+夺门而入 12.2912397395
+空空洞洞 11.9547675029
+狡黠 9.7898037878
+社会形态 9.98865464655
+常是 9.85762638414
+放射线 10.1630080337
+尺度 7.95787827685
+两条路 10.4349417492
+生成器 13.900677652
+常春 13.2075304714
+范氏义 11.9547675029
+王景治 12.8020653633
+粗毛羊 13.2075304714
+熙熙攘攘 9.72629038208
+沉淀 8.39534611604
+民主专政 9.84023464143
+非常广阔 10.6818018271
+评评理 11.598092559
+军事机密 10.642581114
+黑皮 12.1089181827
+常昊 13.900677652
+谦谦君子 11.9547675029
+邦家 12.8020653633
+陶氏 11.598092559
+义田 11.7034530746
+洪湖 10.0720362555
+渔家傲 12.8020653633
+不见天日 10.8561552143
+唐初复 12.5143832909
+管理状况 13.2075304714
+第七十九回 12.2912397395
+哭脸 12.5143832909
+不屑一顾 9.98865464655
+前桥 12.5143832909
+理之当然 12.5143832909
+点定 11.598092559
+卡力斯 13.2075304714
+常景 13.2075304714
+吞吞 12.5143832909
+科塔萨尔 13.2075304714
+吞吐 9.46986085313
+口紧 12.8020653633
+湖南长沙市 12.1089181827
+正角儿 13.900677652
+芦笛岩 11.598092559
+梁明时 11.5027823792
+百花山 11.8212361103
+雪雪 11.1926274509
+塞浦路斯岛 11.5027823792
+盛东 13.900677652
+无兴趣 11.598092559
+吃住行 12.1089181827
+史沫特莱 12.5143832909
+前桅 13.900677652
+习见 10.4994802703
+兵车行 12.1089181827
+梅契尼 12.1089181827
+杆状 10.3453295905
+滤光 12.2912397395
+雪雕 13.2075304714
+基站设备 12.8020653633
+节目单 13.2075304714
+字段 11.7034530746
+冯维辛 12.8020653633
+黄原城 10.1871055853
+尖券 13.900677652
+伦理 8.28754954559
+尖刺 11.2616203224
+尖刻 9.89334446674
+刘晓路 13.2075304714
+二十条 12.5143832909
+占田制 11.7034530746
+华影 13.900677652
+焦雷 11.9547675029
+临终时 10.4994802703
+今朝 9.69598503258
+杨朱 13.2075304714
+谘商 12.5143832909
+戎狄之 12.5143832909
+联成一片 11.1280889297
+杨木 11.9547675029
+葛某 12.8020653633
+杨本 13.900677652
+张孝杰 13.2075304714
+冉闵 10.9562386728
+天知地知 12.1089181827
+落单 12.5143832909
+资源节约型 10.2117981979
+仿制品 10.4041700905
+以德取人 13.900677652
+苦战 9.09665660724
+五面 11.598092559
+郑有备 13.2075304714
+尖叫 8.62767809341
+闹新房 13.2075304714
+政治学家 11.1926274509
+小幅度 10.642581114
+文攻武卫 11.8212361103
+钢铁行业 8.14810501315
+五月天 11.7034530746
+黑眉 10.765183436
+白崇禧 9.5186510173
+哭肿 11.7034530746
+百媚生 13.900677652
+常林 11.9547675029
+肠肥脑满 13.900677652
+不合理性 11.2616203224
+放轻 10.4666904475
+杨松 12.1089181827
+尖厉 10.604840786
+杨杰 12.2912397395
+钱府 10.8096351986
+迷彩 10.7226238216
+日线图 10.3453295905
+章立凡 13.2075304714
+钱庄 9.62401153296
+怀孕 7.59989185731
+逐步完善 9.37888907493
+方家栏 13.2075304714
+美国之音 11.8212361103
+神怡心旷 13.900677652
+陇海 9.69598503258
+贺疯子 10.1630080337
+信任他人 13.2075304714
+藐视一切 13.2075304714
+字模 11.1926274509
+几千百年 12.8020653633
+艴然 13.900677652
+土大黄 13.900677652
+六本木 13.900677652
+杨村 10.533381822
+苦丁茶 13.2075304714
+棺椁 8.19356738723
+习行 12.2912397395
+司天台 11.7034530746
+衣业 12.5143832909
+雨量 8.44109213783
+纤指 13.2075304714
+曹金 11.2616203224
+昆斯 12.1089181827
+搭机 13.2075304714
+高温计 12.2912397395
+怀宁 10.533381822
+利用设备 13.900677652
+放达 11.7034530746
+山村里 11.5027823792
+主题曲 11.8212361103
+音源 12.5143832909
+钓饵 11.3357282945
+十里堡 12.1089181827
+争逐 13.900677652
+撮土 11.8212361103
+停车位 9.77354326693
+心理医生 11.0674643079
+死牢 10.8561552143
+池南岸 13.2075304714
+义理 9.74179456862
+一般性 9.12155415886
+玉华州 11.9547675029
+常有 7.20983537456
+落发 11.9547675029
+游街示众 11.3357282945
+杨枝 12.5143832909
+三部曲 9.17328983326
+五十米 11.3357282945
+作案人 12.2912397395
+教育网络 13.2075304714
+常朝 11.0674643079
+江南春 10.4349417492
+黑鳞鲛 11.7034530746
+刘青山 12.8020653633
+同形异义 13.900677652
+黑石 10.8561552143
+毒焰 13.900677652
+黜陟 11.1280889297
+钱帛 11.1280889297
+荷马 10.3171587135
+落去 11.5027823792
+常来 9.34680076038
+影壁 9.89334446674
+跳河自杀 12.8020653633
+郸城 11.598092559
+奉祀 10.3453295905
+节制生育 12.5143832909
+蒙逊弟 13.2075304714
+真分数 13.900677652
+放进 8.61747392324
+阿斯塔纳 12.2912397395
+杨某 10.5684731418
+吉国 13.900677652
+十六点 12.8020653633
+恩师 9.72629038208
+搭架 12.1089181827
+曹丕才 13.2075304714
+杨柏 13.2075304714
+著书立说者 13.900677652
+沉没 9.23723855786
+哪一篇 12.8020653633
+放过 8.39941944143
+郴州 10.533381822
+车钱 12.5143832909
+严可均 11.5027823792
+洋浦 11.5027823792
+陈文辉 12.5143832909
+穴居野处 13.2075304714
+无法无天 9.5186510173
+骚气 11.9547675029
+洪森 11.0674643079
+下狠心 10.4666904475
+第九回 11.7034530746
+大打折扣 9.61021821083
+商洛市 11.9547675029
+比斯克拉 13.2075304714
+氟磷灰石 13.2075304714
+七周岁 13.2075304714
+洋流 9.58318953844
+战斗者 11.8212361103
+夸多斗靡 13.900677652
+杨思 12.8020653633
+杨怒 13.2075304714
+严格要求 9.91169360541
+淮安市 10.9049453784
+誉满寰中 13.900677652
+杨怀 12.1089181827
+快生了 12.8020653633
+吕祖殿 12.2912397395
+双黄连 9.69598503258
+雕板 13.2075304714
+雨雾 10.533381822
+遗老 10.4666904475
+读音节 13.2075304714
+刻意求工 11.8212361103
+常惠 12.5143832909
+摄影场 12.2912397395
+曹丕时 13.2075304714
+雨雪 8.63798746307
+复旧观 13.2075304714
+全然不知 10.3171587135
+剪毛机 13.900677652
+各分部 13.2075304714
+冰晶 10.1164880181
+金宋 12.8020653633
+扣缴 11.598092559
+矫正 9.31571017331
+记录表 12.5143832909
+上海文艺出版社 12.5143832909
+洋洋 11.1280889297
+蠢虫 13.2075304714
+彭布罗克 13.2075304714
+车铃 12.1089181827
+放行 8.75318317516
+王锡爵 10.4994802703
+克利马 13.900677652
+放血 10.2630914922
+陪您 11.9547675029
+落后 6.6722892004
+簿记员 13.2075304714
+拜门 12.8020653633
+前滚 12.8020653633
+石油化工 8.22050504296
+此路 11.1280889297
+黑点 10.1871055853
+收音机 8.83177344976
+天工 11.0674643079
+康疯子 13.900677652
+乳熟期 12.5143832909
+刺破 10.3171587135
+下车伊始 12.2912397395
+相邦建 13.2075304714
+怅然若失 11.0103058941
+姜阁 11.8212361103
+曹阳 13.2075304714
+黑炭 11.1926274509
+樟脑丸 11.598092559
+熵增加 11.3357282945
+打群架 12.1089181827
+之馀 13.2075304714
+钱奴 12.5143832909
+苦斗 10.7226238216
+常怀 11.598092559
+常态 8.1386262692
+牌坊 9.33632946051
+多一间 13.900677652
+隔三岔五 11.1280889297
+之首 7.60356833204
+痴痴傻傻 13.900677652
+快回 10.9049453784
+冰川期 12.2912397395
+小翠 10.4994802703
+汪德昭 12.8020653633
+毒瘴 12.5143832909
+鬈毛 13.900677652
+史忠正 13.2075304714
+西欧地区 13.2075304714
+刘永春 13.900677652
+手工 7.93453091285
+阿尔加维 13.2075304714
+燃素说 11.4157710022
+毒瘾 12.5143832909
+钱多 10.1394775363
+巢门 13.2075304714
+毒瘤 10.533381822
+鲁那颜 13.2075304714
+防护装置 11.4157710022
+陈恭善 13.2075304714
+柚木 10.604840786
+杨惠 11.2616203224
+前湾 12.1089181827
+昌贤德 13.2075304714
+手巾 9.69598503258
+埃维塔 13.900677652
+公告送达 13.900677652
+小男孩 9.21854642485
+杨惟 13.900677652
+何德能 13.2075304714
+吞到 11.8212361103
+莎翁 11.9547675029
+西照 12.5143832909
+幽忧 13.900677652
+头头脑脑 11.1926274509
+一个十六岁 12.8020653633
+东溪村 11.0103058941
+苦旅 11.9547675029
+血淋淋 9.05649056552
+螺丝钻 13.900677652
+单于屯 13.900677652
+字汇 11.9547675029
+疯女人 12.5143832909
+音栓 12.5143832909
+发大水 10.642581114
+影帝 11.7034530746
+梅亚纲 11.3357282945
+升机 12.8020653633
+称颂一时 13.2075304714
+肉身 10.0720362555
+唯物论者 11.8212361103
+迷失 9.41204128224
+吴均 11.8212361103
+邹家华 12.8020653633
+教育领域 12.2912397395
+蟾酥 11.2616203224
+周书平 12.8020653633
+元素周期 13.2075304714
+传输线 11.1926274509
+诺丁汉郡 12.8020653633
+所向披靡 10.7226238216
+逗你玩 13.2075304714
+无照经营 11.9547675029
+雨鞋 11.9547675029
+怜恤 12.5143832909
+轩轾 13.900677652
+泛滥成灾 10.5684731418
+许志安 13.900677652
+雅爱 13.900677652
+遗腹 12.2912397395
+那人纳 13.2075304714
+长颈龟 12.5143832909
+车间 8.05423887692
+车闸 12.8020653633
+性力派 12.1089181827
+参谋部 9.6811699468
+南宁糖业 9.82314020807
+牛头 9.72629038208
+超值版 11.9547675029
+布恩地 13.900677652
+郭未成 13.900677652
+面不改容 13.2075304714
+施世纶 13.900677652
+涤纶 9.84023464143
+创造条件 9.09665660724
+迥然 11.8212361103
+杨慧 13.2075304714
+干妹子 11.2616203224
+迷奸 13.900677652
+西藏昌都地区 12.5143832909
+医事 13.2075304714
+越笑越 13.900677652
+海滨沼泽 13.900677652
+株连九族 12.2912397395
+凤贾瑞 13.2075304714
+杨慕 13.2075304714
+偏处一隅 13.2075304714
+罗萨峰 13.900677652
+蔡锷奉 12.8020653633
+洋气 11.1280889297
+郑若曾 13.900677652
+书记处 9.43476953332
+泾源县 12.2912397395
+输运现象 11.598092559
+十六盏 13.2075304714
+营葬 13.2075304714
+雨露 10.2371160058
+钱塘 9.27570483869
+怜惜 9.26594866375
+中外古今 12.2912397395
+清水江 10.533381822
+曹霸 11.8212361103
+黜退 12.5143832909
+开明派 12.8020653633
+尴尬事 12.1089181827
+复兴社 11.4157710022
+饮酒 7.64301006409
+电子图书 12.2912397395
+比例尺 9.98865464655
+重访 12.8020653633
+资材 12.2912397395
+祝告 11.4157710022
+鳊鱼 12.1089181827
+遗臣 12.8020653633
+孔明兵 13.2075304714
+胀鼓鼓 12.5143832909
+彩瓷 10.3743171274
+雨霖 13.900677652
+法律常识 12.1089181827
+义父 9.71102290995
+出污泥而不染 12.8020653633
+沙质土 11.8212361103
+吞占 13.2075304714
+黑熊 8.89673134603
+李仙风 10.1871055853
+俄罗斯 6.23680039327
+宁信 13.900677652
+公服 10.8096351986
+滤器 12.1089181827
+勒格 13.2075304714
+用在一朝 13.2075304714
+狄奥多 10.7226238216
+祝君 12.8020653633
+车长 8.28754954559
+洋河 10.1630080337
+内外墙 13.2075304714
+木锹 13.900677652
+襄樊市 10.8096351986
+洛阳花 13.2075304714
+资望 11.0103058941
+克尔逊 13.900677652
+玉华宫 12.8020653633
+洋油 11.7034530746
+周粟 12.1089181827
+噹噹 12.5143832909
+资本 4.81658100657
+不许失败 12.1089181827
+乱局 10.9562386728
+放射科 12.1089181827
+古称泽 13.2075304714
+之风 8.26588804881
+雪里 11.0103058941
+命世之才 13.900677652
+雪野 11.7034530746
+望首辅 12.8020653633
+怜悯 8.81927328699
+曹青 8.83177344976
+孟席斯 12.8020653633
+耐量 12.2912397395
+太宗笑 12.5143832909
+辣椒干 12.2912397395
+戈伊德 13.2075304714
+旧瓶新酒 13.2075304714
+报废井 13.900677652
+第九品 12.1089181827
+伊泽特贝戈维奇 13.2075304714
+个人身份 11.598092559
+搭手 11.0103058941
+扯平 11.9547675029
+操大怒 10.533381822
+杨戬 10.6818018271
+苦木 11.9547675029
+前沿 8.64840422393
+亢金龙 11.9547675029
+旷世奇 12.2912397395
+最佳期 13.2075304714
+搭扣 12.5143832909
+直肠子 11.9547675029
+负效应 11.4157710022
+杨成 11.0103058941
+丧师辱国 12.5143832909
+子之恩 13.2075304714
+联行 12.5143832909
+苏中军区 12.2912397395
+事物本质 11.2616203224
+艾美虫 12.8020653633
+实心眼儿 12.8020653633
+放言 11.3357282945
+一步一个脚印 11.3357282945
+阴性菌 11.3357282945
+六百一十六所 13.2075304714
+乔大哥 13.900677652
+扣紧 11.5027823792
+哗哗哗 10.604840786
+不愁穿 12.1089181827
+钱宁 11.8212361103
+欧洲地区 10.4349417492
+黑牢 13.900677652
+搭成 9.98865464655
+森林地带 10.5684731418
+马凌汉 13.2075304714
+恩宠 9.85762638414
+象征主义 9.98865464655
+哈尔滨 8.07763175649
+弱酸性 10.4994802703
+读后感 13.2075304714
+奉系 9.93038573842
+李海峰 13.2075304714
+短波 9.82314020807
+变化万端 13.2075304714
+咕噜咕噜 11.1926274509
+边走边谈 12.1089181827
+阿塔纳索 13.900677652
+启德 13.2075304714
+阎婆结 13.2075304714
+滦平县 12.1089181827
+黑牌 11.9547675029
+星际争霸 13.900677652
+峄城 13.2075304714
+贽见 12.5143832909
+草丛 8.61241062128
+杨抹 13.2075304714
+怀庆 11.1280889297
+哈密瓜 10.9562386728
+钓鱼 8.69119149913
+金泥玉 12.8020653633
+搭拉 10.8561552143
+蜀犬吠日 13.2075304714
+勒死 10.3453295905
+三连胜 13.2075304714
+短气 12.8020653633
+压感 13.900677652
+太谷县 12.2912397395
+古浪 12.5143832909
+苏里曼 11.1926274509
+大清河 9.96885201925
+质变 9.6811699468
+天下布武 13.900677652
+黄原原 13.2075304714
+戊寅 13.900677652
+比例式 13.900677652
+苦果 10.765183436
+道歉 8.56795885871
+色艺 11.3357282945
+车队 9.28555713513
+来源于 7.54804825566
+黑犀 12.8020653633
+牙种植术 13.900677652
+常成 10.4994802703
+潘巧云 13.2075304714
+凭券 12.5143832909
+家小孔 13.2075304714
+海雷达 12.2912397395
+第九名 11.7034530746
+手快 10.4994802703
+东至西 12.2912397395
+全郡马 13.2075304714
+双城记 12.2912397395
+启开 10.6818018271
+许老秀 10.9049453784
+七周年 13.2075304714
+虞允文 10.9049453784
+反射体 13.2075304714
+车险 9.30555780184
+养老送终 11.4157710022
+手心 8.96620371885
+有何不妥 11.9547675029
+胜人一筹 13.2075304714
+黑狗 10.2117981979
+合作主义 13.900677652
+前汉 11.7034530746
+咱娃 12.5143832909
+立新功 13.2075304714
+捐助点 13.2075304714
+毒理 11.4157710022
+尖嘴 11.2616203224
+由乃衍 13.2075304714
+祝圣 12.1089181827
+娘亲 12.2912397395
+常打 13.900677652
+前江 12.5143832909
+卓克 13.900677652
+广告员 13.900677652
+草书 9.20019728618
+怀异 13.2075304714
+酒后无德 13.900677652
+不堪言状 13.2075304714
+矢车菊 11.7034530746
+古称渝 12.8020653633
+网中之鱼 13.2075304714
+秋光 11.4157710022
+恶棍 10.4349417492
+适者 13.2075304714
+祖考 12.5143832909
+影射 10.2897597393
+测定仪 12.8020653633
+黑猫 9.85762638414
+黑猪 10.533381822
+防风林 10.7226238216
+书记官 9.35738286971
+西半边 13.2075304714
+时刻表 11.9547675029
+拿定主意 9.49395840471
+真空设备 13.900677652
+打闷棍 13.900677652
+落坐 10.9049453784
+战乱频仍 11.1926274509
+薛经理 12.8020653633
+高污染 9.82314020807
+杨全仁 13.900677652
+毒症 12.8020653633
+妇女部长 12.8020653633
+手帕 8.63281949291
+蓝天野 13.900677652
+经亚非 13.2075304714
+宗之祖 13.900677652
+黄土梁 12.5143832909
+水陆毕陈 13.900677652
+女丑 13.900677652
+扬督师 13.2075304714
+附随 12.8020653633
+陈无择 13.2075304714
+东潞州 12.5143832909
+影展 12.5143832909
+落地 7.72897705456
+肃贪 13.900677652
+马兹达 13.2075304714
+伊丽莎白 9.25628675283
+滩头 10.604840786
+高斯特 12.8020653633
+赚回 11.9547675029
+资料 5.85540993537
+一出头 13.2075304714
+特拉弗斯 12.8020653633
+晚香玉 12.5143832909
+落在 10.533381822
+羊城晚报 10.7226238216
+玩物丧志 11.9547675029
+耳软心活 13.2075304714
+火光烛天 11.9547675029
+静电屏蔽 12.8020653633
+五类分子 9.74179456862
+显微组分 13.900677652
+一百六十四 12.8020653633
+出水口 11.4157710022
+此谓 11.598092559
+覆叠空间 13.900677652
+中央电大 13.900677652
+资方 11.2616203224
+罢黜 10.0720362555
+柑橘类 10.765183436
+邻桌 12.5143832909
+尺子 10.3453295905
+吊顶 12.5143832909
+邻舍 9.48183704418
+晏子 12.2912397395
+同声翻译 13.900677652
+过门不入 13.900677652
+即时新闻 13.900677652
+多媒体通信 12.8020653633
+克敌制胜 10.8096351986
+迷宫 9.45802639549
+落基 10.6818018271
+焦碳 12.2912397395
+王明业 12.5143832909
+哪条 10.1394775363
+中国区 9.74179456862
+外交人员 11.8212361103
+启幕 12.5143832909
+藕断丝连 11.0103058941
+娘俩 10.765183436
+坚执不从 12.2912397395
+比翼齐飞 11.9547675029
+由洪积 11.8212361103
+附院 10.1164880181
+常指 10.9049453784
+高哈尔 13.900677652
+愚妄 13.900677652
+怀德 11.5027823792
+曹锟 9.46986085313
+黑玉 13.2075304714
+可见一斑 9.02548032877
+中国化 10.4349417492
+中国教育工会 13.2075304714
+沙坪坝 11.8212361103
+安全装置 11.5027823792
+短浅 10.8096351986
+洋溢 10.2897597393
+伊阿古 12.2912397395
+王明义 13.900677652
+管仲相 12.1089181827
+栾川县 10.9049453784
+草体 12.8020653633
+王维玲 13.900677652
+前浪 12.1089181827
+凭单 12.1089181827
+痛快淋漓 10.7226238216
+大小腿 13.900677652
+韦列夏 13.2075304714
+尺寸 7.58170953823
+字源 12.2912397395
+技术落后 10.2117981979
+洪欣 12.8020653633
+搭接 11.5027823792
+怀忠 12.5143832909
+放话 11.9547675029
+印染助剂 12.8020653633
+生存环境 9.74179456862
+母与子 11.9547675029
+牌名 11.9547675029
+病媒 13.900677652
+曹镇 13.2075304714
+滴出 12.1089181827
+资政 10.3171587135
+农作物 7.49050277001
+暖融融 11.0103058941
+百花奖 10.533381822
+怀念 8.59240995457
+恩威 11.8212361103
+中毒者 10.2897597393
+馈赠 9.85762638414
+之高 8.95903522937
+司赫德 11.9547675029
+沉静 9.00283785202
+难人 12.1089181827
+柯希 11.2616203224
+张国民 12.8020653633
+耐水 10.4666904475
+雪水 9.80633308975
+李志武 13.2075304714
+联大会议 13.900677652
+柯布 12.8020653633
+益发 9.85762638414
+腔道 11.8212361103
+别虞姬 13.900677652
+曹二营 12.5143832909
+和亲 9.53122979951
+定做 10.604840786
+为主 4.99781397978
+风声 7.93709830836
+奉节 10.1871055853
+修塔 12.8020653633
+车辆通行 10.6818018271
+种族问题 12.2912397395
+难产 9.69598503258
+三十九幅 13.2075304714
+卢日科夫 13.900677652
+耳壳 10.604840786
+饮泣 11.1926274509
+别谦虚 13.2075304714
+色系 11.598092559
+财政司 11.9547675029
+洋酒 10.4994802703
+郑天寿 10.3453295905
+难事 9.38981814546
+难于 8.56795885871
+圣保罗州 11.9547675029
+道头知尾 13.2075304714
+辗转流传 12.2912397395
+沉船 8.75318317516
+卫滨区 13.900677652
+女中 10.9049453784
+黑豹 10.765183436
+中义 12.8020653633
+赵嬷嬷 12.1089181827
+财政厅 9.25628675283
+司炉 11.5027823792
+嗔怪 10.0088573539
+秦钟笑 12.8020653633
+嗔怨 13.2075304714
+分说 10.533381822
+濒危动物 12.8020653633
+洪钧 12.8020653633
+盛大举行 11.9547675029
+难以 5.7006640038
+斯洛伐克共和国 12.1089181827
+莎草 10.5684731418
+洪钟 11.5027823792
+音长 13.2075304714
+流域规划 11.8212361103
+积劳 12.2912397395
+车棚 11.7034530746
+抓大放小 12.8020653633
+嗔怒 10.9562386728
+车检 13.2075304714
+脱脂剂 13.900677652
+穆圣 12.5143832909
+黑豆 9.29550746599
+第四座 12.5143832909
+违背者 13.900677652
+贝尼尼 11.9547675029
+红新月会 12.2912397395
+奈何桥 11.8212361103
+文献资料 9.87532596124
+餐饮业 10.8561552143
+耳塞 11.9547675029
+地带性 8.76487921493
+中国美术家协会 9.82314020807
+字量 13.900677652
+周桓王 12.2912397395
+总监部 11.2616203224
+史都华 13.2075304714
+涤荡 11.9547675029
+橡胶园 11.598092559
+耐高温 9.62401153296
+魏我桓 11.8212361103
+和丰 11.4157710022
+安德烈耶夫 13.900677652
+谷燕山 9.26594866375
+第四幅 13.900677652
+晃得 10.604840786
+地方性 8.82550383674
+里埃尔 12.5143832909
+滑雪衫 13.2075304714
+免提通话 13.2075304714
+莫鲁瓦 13.2075304714
+意大利文 11.1280889297
+铁骨铮铮 11.598092559
+难怪会 11.9547675029
+第四年 11.4157710022
+饮汤 11.598092559
+甘荫塘 13.2075304714
+题诗 10.2117981979
+烈士 8.45825994145
+黑貂 12.2912397395
+弯下来 12.1089181827
+一万六千多 12.2912397395
+车标 12.2912397395
+亨德尔 11.3357282945
+解围 9.12999302751
+阿贵 13.900677652
+英文翻译 12.5143832909
+余万平方公里 12.1089181827
+女乐 11.1926274509
+官吏 7.18287295695
+之日 8.30596627237
+臣服于 9.80633308975
+难买 12.1089181827
+王铁枪 12.8020653633
+窄幅 7.95003509939
+戴桃形 13.2075304714
+雅远 13.2075304714
+扛走 13.2075304714
+大修理 13.2075304714
+车桥 12.1089181827
+扫描线 13.2075304714
+高度重视 7.92686804011
+白粉笔 13.900677652
+师亦罢 12.8020653633
+供用电 12.8020653633
+车兵混 12.5143832909
+之旁 10.6818018271
+李少光 11.5027823792
+之旅 8.9102450652
+和义 12.2912397395
+报警装置 11.2616203224
+音问 12.8020653633
+和乐 13.2075304714
+柯廷 12.8020653633
+遗精 9.74179456862
+都建州 12.2912397395
+队章 13.900677652
+饮水 8.74162235276
+大智大慧 12.8020653633
+官吴 13.900677652
+荡口 13.2075304714
+腧穴 9.35738286971
+续行符 12.8020653633
+易地而处 13.2075304714
+嫡长子 10.604840786
+蒯异度 12.8020653633
+驾回来 13.900677652
+萧耀南 12.2912397395
+放电 8.65893063692
+三苯基膦 13.2075304714
+综艺节目 11.9547675029
+怜新厌旧 13.2075304714
+洪门 11.1926274509
+白辛树 13.2075304714
+风姿 10.3171587135
+为伴 10.8096351986
+黑质 11.9547675029
+信命 12.1089181827
+蒋明安 13.900677652
+为伍 10.0088573539
+耐洗 13.2075304714
+放生 10.4041700905
+烈女 10.765183436
+飞车走壁 13.900677652
+雪洗 13.2075304714
+沃克利 12.8020653633
+沉陷 10.1630080337
+走近路 13.2075304714
+高速公路网 11.0103058941
+习吏幼 13.2075304714
+于君臣 13.2075304714
+修好 9.31571017331
+定兴 11.598092559
+修女 10.6818018271
+感情交流 11.8212361103
+从麟州 13.2075304714
+三十分钟 12.5143832909
+修复 7.58894284282
+益力 11.3357282945
+扎陵湖 10.9049453784
+焦油 10.8096351986
+雪海 12.5143832909
+十七条 12.5143832909
+公引 12.8020653633
+周口市 9.72629038208
+三百六十岁 12.8020653633
+一再表示 10.765183436
+水平地带 12.8020653633
+党外人士 11.7034530746
+摇曳 9.24671730182
+三千多亩 12.8020653633
+重庆谈判 10.2897597393
+订户 10.9562386728
+难保 9.08039608637
+中南大学 13.2075304714
+阿什哈巴德 11.3357282945
+左司马曹 13.900677652
+准备充分 10.6818018271
+趋于 7.17204903889
+算盘子儿 13.2075304714
+水球场 13.900677652
+神驰 11.5027823792
+何金寿 12.8020653633
+沉降速度 12.1089181827
+做出 6.15740795115
+吴文藻 12.8020653633
+为何 6.45350929238
+一边倒 9.53122979951
+核心作用 10.2630914922
+益加 11.7034530746
+奔驶 12.2912397395
+华中 8.33233314821
+解珍 9.0884932966
+四个坚持 13.900677652
+定准 12.8020653633
+布鲁提 13.2075304714
+官商 10.2630914922
+回家路上 12.2912397395
+近在咫尺 9.54396882529
+够面子 13.2075304714
+老诚 12.5143832909
+那串 10.3743171274
+沉雄 11.0674643079
+丰乳肥臀 12.8020653633
+姨娘 9.65218240993
+奄奄一息 9.5186510173
+捷克语 11.2616203224
+山士奇 11.0674643079
+穆图 13.2075304714
+放疗 10.533381822
+幸诸阁 13.900677652
+师久无 12.1089181827
+定出 9.41204128224
+农民画 12.5143832909
+行歌坐月 12.8020653633
+挖井 11.5027823792
+自有主张 10.8561552143
+尖刻话 13.900677652
+风天 13.900677652
+那纬宇 13.2075304714
+有源元件 13.2075304714
+周口店 9.7898037878
+诫勉 12.5143832909
+李才旺 13.900677652
+雪深 12.2912397395
+风大 9.71102290995
+曹死 12.8020653633
+研究型 11.7034530746
+橡胶垫 12.8020653633
+塔利奥 11.7034530746
+掩面 9.71102290995
+风头 9.04086524761
+烈妇 13.2075304714
+七班 12.8020653633
+应佛僧 12.5143832909
+友朋 12.5143832909
+哭穷 11.3357282945
+色素 8.43684584695
+三千多万 12.5143832909
+宋江赏 12.8020653633
+难住 10.4666904475
+三星集团 12.5143832909
+八百元 12.2912397395
+第四张 12.5143832909
+魏有二 13.2075304714
+云里雾 12.8020653633
+姨妹 13.2075304714
+判罪 11.3357282945
+研究员 6.80395627348
+耐渴 12.2912397395
+八音盒 12.5143832909
+时样 12.5143832909
+之本 9.23723855786
+色织 12.1089181827
+胸无大志 11.3357282945
+五十万册 13.2075304714
+杨鸣 13.900677652
+疲于 11.1280889297
+耐温 11.5027823792
+弗拉基 13.2075304714
+死而不僵 11.7034530746
+金戴银 13.900677652
+中丞 10.4994802703
+对对子 12.1089181827
+官园 13.2075304714
+胡枝子 11.0103058941
+之有 10.2371160058
+达州市 13.2075304714
+鹰式 12.8020653633
+国家计划 9.91169360541
+姨妈 9.62401153296
+柯尼 11.0674643079
+判罚 11.1280889297
+富豪榜 9.61021821083
+张释之 12.8020653633
+祆教 10.2117981979
+洪雅 11.2616203224
+日本政府 8.38322475551
+通加巴 12.8020653633
+冰山一角 10.1630080337
+件次 13.2075304714
+宜体朕 13.2075304714
+铃木虎雄 13.2075304714
+前部 7.96314144689
+成冰作用 12.5143832909
+二老板 13.900677652
+定则 10.2897597393
+中国动物学会 12.1089181827
+调味粉 13.2075304714
+暗星云 11.598092559
+定刑 12.5143832909
+杨鹤 12.5143832909
+雨棚 12.8020653633
+司职掌 12.2912397395
+数不到 13.2075304714
+固定点 11.2616203224
+雅赫 12.5143832909
+贡赋道 13.2075304714
+九十九米 13.900677652
+时标 11.598092559
+色纸 13.900677652
+二十五员 13.900677652
+边答 13.2075304714
+扎上去 13.900677652
+大田县 13.2075304714
+沃克兰 12.2912397395
+代北旧 12.8020653633
+中长跑 11.598092559
+控制箱 13.2075304714
+公晓 13.2075304714
+窄小 9.66657114738
+礼拜六派 13.900677652
+昭彰 12.5143832909
+北京第二外国语学院 13.900677652
+百五十 12.5143832909
+段升 10.0294766411
+嗒然 13.900677652
+姨太 10.7226238216
+短途 10.4349417492
+文体学 13.900677652
+第四届 8.6966709649
+军阀主义 13.2075304714
+柴进分 13.900677652
+十数倍 13.900677652
+慨然应诺 13.900677652
+谁他妈 12.2912397395
+卢员外 10.604840786
+第四层 11.1926274509
+二文 13.900677652
+第四局 12.8020653633
+益兽 12.8020653633
+之极 9.37888907493
+王志强 13.2075304714
+投诉者 13.900677652
+不领情 10.3453295905
+柯岩 12.8020653633
+天平山 11.4157710022
+潘加尼 13.900677652
+益兰 13.2075304714
+贡止贡 13.2075304714
+瑞利散射 12.1089181827
+前途 7.69208762588
+毒血 11.8212361103
+方利平 12.5143832909
+地方戏 10.4349417492
+结草虫 13.900677652
+郭来喜 12.1089181827
+提高质量 11.1926274509
+做到 6.65787972918
+克塞诺芬 12.8020653633
+蓝澄澄 13.2075304714
+中华人民共和国外交部 12.1089181827
+梁启超 8.13548654919
+请客送礼 11.598092559
+小丹根 12.5143832909
+锔锅匠 13.2075304714
+西南财大 12.2912397395
+曲曲弯弯 11.7034530746
+誓死捍卫 11.8212361103
+摹古 12.8020653633
+安德列 11.5027823792
+第四尊 13.900677652
+短道 13.2075304714
+定力 11.0674643079
+故技重施 12.1089181827
+疲乏 9.12999302751
+陕北公学 11.2616203224
+放盘 12.2912397395
+宽带网 12.8020653633
+翁文恭 12.8020653633
+乱罚款 11.0103058941
+兰尼加 11.9547675029
+放盐 11.2616203224
+赖曼 13.900677652
+橡皮球 13.900677652
+音韵 9.32596667347
+附款 13.900677652
+生术赤 13.2075304714
+定势 11.7034530746
+王汗联 12.8020653633
+株连蔓引 13.900677652
+凉到 12.1089181827
+依小弟 11.8212361103
+哈比卜 13.900677652
+王以哲 12.2912397395
+广西区 13.900677652
+巴巴儿 12.8020653633
+豪格 9.49395840471
+隐约可见 10.765183436
+售楼处 10.765183436
+放眼 9.44633035572
+十六行 12.8020653633
+之春 11.4157710022
+铁蚕豆 13.900677652
+宗教画 11.5027823792
+家乡话 11.9547675029
+霍耳效应 11.8212361103
+椭圆函数 10.9562386728
+逞强好胜 13.2075304714
+控制站 11.2616203224
+无国籍 11.8212361103
+距离远 10.6818018271
+好乐迪 13.900677652
+空天飞机 11.4157710022
+杜吴 12.2912397395
+回归自然 12.5143832909
+宋江辞 12.8020653633
+音阶 9.71102290995
+修学 12.2912397395
+丘处机 11.1280889297
+购物券 11.1280889297
+石莲柱 13.2075304714
+伊朗语 10.7226238216
+量水堰 12.8020653633
+风寒 8.97342396682
+之星 9.59661255877
+宗王昔 12.1089181827
+名人字画 11.4157710022
+吴浊流 12.2912397395
+坏消息 9.55687223012
+女特工 12.5143832909
+第二课堂 12.5143832909
+作好作歹 12.8020653633
+李天羽 13.2075304714
+掩门 11.4157710022
+陟降 13.2075304714
+掩闭 12.8020653633
+打开天窗 13.900677652
+篮板王 13.900677652
+人生意义 12.2912397395
+据测定 10.604840786
+风害 11.4157710022
+肇事 9.6811699468
+点头之交 12.5143832909
+洞察秋毫 12.8020653633
+大体一致 10.4994802703
+敌对行为 12.8020653633
+谭军 12.5143832909
+伤残人员 13.2075304714
+三百六十度 12.8020653633
+放着 8.13548654919
+窄巷 13.900677652
+窄巴 13.2075304714
+季直表 13.2075304714
+遗缺 11.9547675029
+周建人 11.9547675029
+剪裁法 13.900677652
+音障 13.2075304714
+黑边 11.0674643079
+进料加工 13.900677652
+风季 11.2616203224
+劳改犯 11.2616203224
+车款 11.598092559
+耳孔 10.7226238216
+车次 10.533381822
+都建康 11.0674643079
+穆哈 12.1089181827
+丹心碧血 13.900677652
+痞积 13.900677652
+惠然 12.8020653633
+处断 13.2075304714
+曹植 10.5684731418
+锡业股份 10.0940151622
+愚夫愚妇 13.2075304714
+谨小慎微 10.5684731418
+由广利 13.2075304714
+传统医学 10.4041700905
+自经 12.5143832909
+克利斯 10.2117981979
+处方 9.35738286971
+移送起诉 12.5143832909
+高车驷马 13.900677652
+罢战 10.7226238216
+五间 9.74179456862
+杨龄 13.900677652
+义马 11.3357282945
+共青团中央 11.0674643079
+焦渴 10.8561552143
+奔月 11.1280889297
+太沙基 12.8020653633
+定压 11.4157710022
+八百卷 12.8020653633
+肇东 12.8020653633
+样样 9.00283785202
+正对面 11.2616203224
+修定 12.8020653633
+福宫庄 12.1089181827
+却尘缘 12.8020653633
+功放 13.900677652
+扣肉 12.5143832909
+杨见 9.98865464655
+擂鼓鸣金 13.2075304714
+中代 13.2075304714
+圣保罗市 12.8020653633
+臂弯 10.8096351986
+不忘本 12.8020653633
+罢手 10.2897597393
+官场 7.86280673205
+定县 9.98865464655
+克鲁尔 13.2075304714
+官地 11.8212361103
+洪都 11.4157710022
+曹溪 12.1089181827
+具体情况 8.4284069783
+三百四十八卷 12.5143832909
+进学 11.3357282945
+农民收入 9.74179456862
+车沿 13.2075304714
+官僚 7.46292600224
+定员 11.3357282945
+难于上青天 11.0103058941
+瓷器活 12.5143832909
+切角 13.2075304714
+吉恩 11.9547675029
+必要产品 12.8020653633
+银扣 13.900677652
+未分裂 13.900677652
+犯得上 12.2912397395
+之意 6.94127913984
+宫崇诣 13.2075304714
+宣魏征 12.8020653633
+二十五分 12.8020653633
+常额 11.7034530746
+彝语 11.0103058941
+网事 13.2075304714
+常频 13.900677652
+之感 8.3285236198
+乌拉山 10.765183436
+杜南 13.900677652
+后肢 9.13850371718
+十数回 13.900677652
+曹满 11.2616203224
+喧腾 10.9049453784
+接力棒 9.91169360541
+处所 9.35738286971
+唯成分论 12.5143832909
+粗气 9.55687223012
+黑衣 9.7898037878
+放火 8.58255765813
+轻如鸿毛 13.2075304714
+黑衫 12.8020653633
+定向 7.36834335975
+信儿 9.59661255877
+斯万 10.3171587135
+级联 11.1280889297
+王献之 10.6818018271
+字键 13.2075304714
+堂皇正大 13.900677652
+挖沟机 13.900677652
+从何而来 9.48183704418
+四次会议 12.2912397395
+杜卡 13.2075304714
+风岗 13.2075304714
+放点 11.0674643079
+明叔好 13.2075304714
+续行水 13.900677652
+发育不全 10.1871055853
+超短波 10.765183436
+连坐法 11.7034530746
+吉日良辰 12.2912397395
+解析性 13.900677652
+拴住 10.4349417492
+发嗲 12.1089181827
+耳屏 11.5027823792
+耳屎 12.8020653633
+放炮 9.85762638414
+吉思 10.4666904475
+赤手空拳 10.0294766411
+杨舍镇 13.2075304714
+信函 9.85762638414
+排气扇 13.900677652
+雕龙 11.4157710022
+西半球 10.604840786
+官家赐 12.2912397395
+搞砸 11.9547675029
+网丝 13.900677652
+好事 7.42833135747
+八百名 12.8020653633
+马军寨 12.8020653633
+中二 12.1089181827
+雪梅 8.11378027061
+网下 6.93465346487
+网上 6.15610784262
+飘飘扬扬 12.5143832909
+拳脚交加 13.900677652
+取精用宏 13.900677652
+考出来 13.900677652
+雅词 12.8020653633
+森林草原 9.38981814546
+抱头大哭 11.9547675029
+前院 9.00283785202
+一二天 11.4157710022
+耳尖 11.8212361103
+自卑 9.75754292558
+常须 12.5143832909
+音量 9.82314020807
+放热 10.8561552143
+官倒 11.5027823792
+这几天来 11.598092559
+谢子长 12.1089181827
+篮板球 11.1280889297
+雅语 12.2912397395
+杨飞 13.2075304714
+友好人士 11.598092559
+放烟 12.5143832909
+黑裙 11.1280889297
+大处方 11.8212361103
+非晶 10.642581114
+风尘 9.26594866375
+风尚 9.66657114738
+补体旁路 13.900677652
+自找苦吃 11.598092559
+破题儿第一遭 12.8020653633
+雅诺 13.2075304714
+三百六十天 11.5027823792
+驾驶盘 13.900677652
+罢教 13.900677652
+洪适 12.5143832909
+侍童 12.2912397395
+鲁勃极 13.2075304714
+音速 10.4349417492
+力穷势孤 12.8020653633
+之怨 12.1089181827
+雅言 12.5143832909
+体格健壮 11.5027823792
+擂鼓墩 12.8020653633
+解嘲 10.8096351986
+查理曼 10.642581114
+蚺蛇 13.900677652
+八卦拳 13.900677652
+黑褐 10.6818018271
+等外品 13.900677652
+各条战线 11.0103058941
+牢固地 10.4041700905
+师事子 13.2075304714
+机关作风 11.8212361103
+经纶济世 13.2075304714
+巴维克 12.8020653633
+映体 11.5027823792
+洪量 12.5143832909
+作家网 13.900677652
+繁星点点 12.8020653633
+数过去 13.2075304714
+揭去 11.0674643079
+遗祸 12.5143832909
+乔装打扮 10.765183436
+赛龙舟 11.598092559
+复兴门外 13.900677652
+地下水面 12.2912397395
+之恩 8.96620371885
+正当理由 10.0720362555
+官军 6.71150991356
+勒邦 13.2075304714
+妇幼保健 9.94943393339
+揭发 8.52539924429
+毒辣 10.5684731418
+克尔梅 13.900677652
+稍迟 10.9562386728
+谢玄任 13.2075304714
+拜泉 12.8020653633
+官秩品 12.8020653633
+徐泽商 11.9547675029
+教工路 13.900677652
+饮食业 11.0103058941
+核黄素 11.2616203224
+之恋 10.765183436
+鲁王朱 13.900677652
+六斗 11.8212361103
+妨碍交通 12.8020653633
+布鲁木 12.5143832909
+梅多斯 13.2075304714
+短音 13.2075304714
+边走边看 11.1926274509
+宋江见 9.55687223012
+笼而统之 13.900677652
+三千八百四十五家 13.2075304714
+穆勒 9.96885201925
+虞美人 11.3357282945
+超导体 10.0940151622
+待机时间 13.900677652
+曾纪泽 10.9049453784
+非有 10.8561552143
+扑闪 11.9547675029
+五原县 11.5027823792
+马超战 13.2075304714
+震撼作用 12.8020653633
+打个招呼 9.35738286971
+郭桂蓉 13.2075304714
+粽子 8.86372504956
+低音炮 13.900677652
+令人难忘 10.9049453784
+范红霞 13.2075304714
+密炼机 13.2075304714
+师费尔 13.900677652
+修己 13.2075304714
+东来西去 13.900677652
+山东大学 10.3743171274
+第四季 10.3171587135
+官兵 7.37564799413
+作家群 12.5143832909
+佟府 13.2075304714
+常饮 11.4157710022
+调和阴阳 12.1089181827
+前面 6.15740795115
+勒逼 12.1089181827
+之想 10.9049453784
+洋钱 10.6818018271
+拴上 10.604840786
+翳风 12.8020653633
+四环素 9.93038573842
+偏疼 12.5143832909
+杜勋 8.78268383956
+孙承泽 12.8020653633
+月黑风高 11.9547675029
+之情 7.70627226087
+洋钉 12.8020653633
+仪菁 13.2075304714
+陈伯之 13.2075304714
+短靴 11.598092559
+官儿 8.53470163695
+旅游观光 11.2616203224
+联络感情 11.4157710022
+非来 12.5143832909
+网住 12.1089181827
+洋面 9.75754292558
+龙泉镇 13.2075304714
+弹簧秤 12.2912397395
+文圣武 13.2075304714
+耳廓 10.4349417492
+习用 10.8561552143
+稀里糊涂 10.0940151622
+短针 12.5143832909
+霍姆斯 10.9049453784
+上海战役 11.9547675029
+祝奈德 13.900677652
+穆克 11.8212361103
+穆兰 12.1089181827
+焦比 13.900677652
+字面 10.4666904475
+亚大帝 12.8020653633
+淇县 10.9562386728
+商南 12.2912397395
+简作佛 13.2075304714
+第四声 13.900677652
+哪几天 13.900677652
+泻心汤 12.8020653633
+命比纸薄 13.2075304714
+曾文水库 12.5143832909
+汽车贷款 12.2912397395
+清孝堂 13.2075304714
+二十五倍 13.2075304714
+次访问 11.9547675029
+沉酣 11.8212361103
+政办发 13.900677652
+穆公 11.0674643079
+焦母 13.2075304714
+新疆生产建设兵团 10.5684731418
+燥动 13.2075304714
+二次革命 9.63799777493
+楚克迈 13.2075304714
+雨泽 11.7034530746
+递向 12.2912397395
+闭经 10.4666904475
+包了 9.69598503258
+风度 9.05649056552
+故技 12.8020653633
+检查报告 11.2616203224
+做回 12.2912397395
+杜充 13.2075304714
+官办 9.6811699468
+递信 12.8020653633
+施行 7.56385192083
+命题演算 11.2616203224
+杜克 11.0674643079
+放牧 8.65365357982
+不如归去 13.900677652
+掉头就跑 12.8020653633
+杜兴 9.89334446674
+放牛 10.3743171274
+信包 13.900677652
+老处女 11.8212361103
+杜兰 11.3357282945
+思辩 11.8212361103
+包产 12.2912397395
+二百六十所 13.2075304714
+常有子 13.2075304714
+雅西 12.5143832909
+印刷工 13.900677652
+风府 12.5143832909
+官势 13.2075304714
+惊愣 11.4157710022
+肉山酒海 12.5143832909
+遗稿 10.8096351986
+精神贯注 13.900677652
+雪橇 10.604840786
+小米粥 10.9562386728
+凡夫 11.0674643079
+爱好音乐 11.9547675029
+信口 10.642581114
+中体 9.06439574502
+汾西 12.1089181827
+晋水 11.7034530746
+赵尔丰 13.2075304714
+雨水 7.78921031247
+层压 12.1089181827
+信史 11.598092559
+沉重 6.60358664682
+刘元斌 12.5143832909
+信号 6.36005612332
+十数名 13.2075304714
+姜氏 11.1280889297
+学院路 11.598092559
+浪漫生活 12.8020653633
+姜水 12.2912397395
+克鲁奇 12.8020653633
+曹氏 10.3171587135
+项伯亦 13.900677652
+信友 12.5143832909
+核桃林 11.9547675029
+格朗德 13.2075304714
+诬陷 8.81308131674
+修建 6.94413220882
+放手 8.60737282725
+字音 10.604840786
+杨骏 11.5027823792
+脱裤子 11.1926274509
+一个五十 12.8020653633
+游宦 12.5143832909
+罢朝 12.1089181827
+张怀礼 13.2075304714
+中图法 13.900677652
+元字符 12.2912397395
+掉头就走 11.8212361103
+十数员 12.5143832909
+包下 10.6818018271
+包上 10.642581114
+救困扶危 13.900677652
+少吃多餐 11.8212361103
+风带 11.1926274509
+雅观 12.1089181827
+兴风作浪 10.0294766411
+面向世界 11.7034530746
+会钞 13.900677652
+风帽 11.0103058941
+姜汁 10.604840786
+北京联合大学 13.900677652
+流离 10.1871055853
+搞平衡 13.2075304714
+重整旗鼓 10.7226238216
+唱片业 13.2075304714
+杨高 13.2075304714
+杨衙内 13.900677652
+包严 12.8020653633
+佛教史 10.8561552143
+风市 13.900677652
+第四堵 12.5143832909
+风帆 9.75754292558
+放狗 12.5143832909
+代华商 13.2075304714
+起诉状 11.7034530746
+姜汤 11.2616203224
+焚稿 12.5143832909
+山河破碎 12.5143832909
+塞维利亚 10.3453295905
+一生何求 13.900677652
+董文炳 12.8020653633
+官制 8.66423568915
+认证费 11.8212361103
+醋罐子 12.2912397395
+数十分钟 11.7034530746
+更合 12.2912397395
+宋江设 13.2075304714
+定址 13.900677652
+讨回公道 11.3357282945
+控制组 13.900677652
+焚书坑儒 11.0103058941
+递交 8.43261751084
+遗策 12.8020653633
+魏贾诩 13.2075304714
+叶制器 13.900677652
+吴炳著 13.2075304714
+下界 9.27570483869
+雨润 11.0103058941
+珠围翠绕 12.1089181827
+炎症性 11.1280889297
+柯夫 13.2075304714
+雨涝 11.9547675029
+神魄 12.2912397395
+家具店 13.2075304714
+廷争面折 13.900677652
+风习 10.604840786
+官司 8.04274449749
+徐宁 9.6811699468
+官史 12.5143832909
+泱泱大国 11.8212361103
+之战 7.66430806177
+反颠覆 12.5143832909
+漆黑一团 10.8096351986
+朝阳产业 10.642581114
+宋江诸 12.8020653633
+建筑节能 9.7898037878
+中国东方航空公司 13.900677652
+那密密 13.2075304714
+伏击圈 11.8212361103
+玉米地 10.6818018271
+前门 9.08039608637
+官厅 10.3743171274
+信到 12.2912397395
+哥伦比亚河 11.8212361103
+人口数 10.3743171274
+义正词严 10.9562386728
+匙子 12.8020653633
+费希特 11.1926274509
+岔口 11.598092559
+建安 8.34771806705
+秦鲸卿 12.5143832909
+盖吴通 13.2075304714
+雨淞 11.8212361103
+稀稀疏疏 11.598092559
+之手 7.9526426628
+解钱谷 12.8020653633
+北京警方 12.1089181827
+之才 9.66657114738
+白溪 13.900677652
+雨淋 10.2117981979
+巢湖 9.61021821083
+一环扣一环 12.1089181827
+阿柯河 12.8020653633
+控制线 11.7034530746
+二十五元 12.5143832909
+三春柳 13.2075304714
+周邦彦 11.1926274509
+诫命 12.1089181827
+揭出 11.5027823792
+遗篇 12.5143832909
+字集 12.5143832909
+繁荣兴旺 11.3357282945
+曹洪 9.71102290995
+函数库 13.900677652
+第四套 11.8212361103
+一卧不起 12.8020653633
+官升 10.8561552143
+包佃 13.2075304714
+建宁 9.80633308975
+曹活 13.900677652
+零四十八点 13.2075304714
+无思凡 13.2075304714
+沉郁 10.0505300503
+冯锡范 13.900677652
+公家人 11.5027823792
+制式教练 13.900677652
+包体 11.4157710022
+给了谁 12.8020653633
+巴利语 12.1089181827
+图兰朵 11.2616203224
+前锋 8.83177344976
+馈电 12.5143832909
+六时 12.5143832909
+显著效果 11.7034530746
+责任心 10.0294766411
+章哈麻 12.5143832909
+官印 10.4994802703
+九百九十七 13.900677652
+和莱特 13.900677652
+递上 9.27570483869
+三剑客 12.1089181827
+色笔 12.5143832909
+诺沃特尼 13.900677652
+驻足观看 11.9547675029
+定型 8.21031819765
+闵生赋 13.2075304714
+好利忘义 13.900677652
+军事运输 11.1926274509
+淅川 10.2897597393
+双核心 13.900677652
+义行 12.8020653633
+势必能 13.900677652
+官禄田 12.2912397395
+广覆盖 12.2912397395
+毒质 13.900677652
+毒贩 13.2075304714
+修得 10.1164880181
+前镇 11.8212361103
+于洛水 12.5143832909
+此辈 10.604840786
+麦哲伦云 11.598092559
+全国人民代表大会常务委员会 9.33632946051
+奥果韦 12.5143832909
+弘福寺 12.8020653633
+乌油油 11.9547675029
+辽阳县 11.7034530746
+毕师铎 12.2912397395
+黄文山 12.5143832909
+布鲁斯 10.3171587135
+第四天 9.7898037878
+短长 10.4349417492
+趋奉 12.1089181827
+修德 11.9547675029
+第四回 11.4157710022
+鹅肉 12.5143832909
+地丁银 13.2075304714
+上海译文出版社 13.900677652
+三千四百万美元 13.2075304714
+战国策 9.5186510173
+谎报 10.7226238216
+揭底 12.1089181827
+雨披 12.8020653633
+句句 9.12999302751
+氯化镁 11.4157710022
+车悦 13.2075304714
+呋喃西林 12.5143832909
+非生产性 11.2616203224
+面带微笑 9.61021821083
+卫王宽 13.2075304714
+违反常规 12.1089181827
+益寿 12.5143832909
+杨诚调 12.5143832909
+德南 13.900677652
+比众不同 12.8020653633
+杨诚谈 12.5143832909
+吴仕期 12.5143832909
+人工心脏 11.8212361103
+记录簿 13.900677652
+卡尔皮 12.5143832909
+肢体 8.36728816325
+台湾银行 11.0674643079
+盐湖城 12.1089181827
+吕四港 12.2912397395
+二十五年 8.53003962385
+独门独户 12.5143832909
+缩叶病 13.2075304714
+瞳子 12.8020653633
+长足 9.62401153296
+绣线菊 10.9562386728
+毒芹 11.8212361103
+林副产品 10.642581114
+梁晴拉 13.2075304714
+氯化锂 12.1089181827
+五六十只 13.2075304714
+双杯 13.2075304714
+混交林 8.36728816325
+陈体强 13.2075304714
+发呕 13.900677652
+盥漱 11.7034530746
+护路林 13.900677652
+氯化锌 12.1089181827
+山本萨夫 13.2075304714
+苦酒 11.0674643079
+明叔喝 13.2075304714
+基里延科 12.8020653633
+宣徐茂 13.2075304714
+行痴 13.2075304714
+身历其境 13.2075304714
+巴维尔 13.2075304714
+故技重演 12.2912397395
+克尔斯 13.900677652
+罗斯塔 12.1089181827
+做声 8.0600359946
+村上春树 13.2075304714
+齐强鲁 13.2075304714
+搬上来 12.5143832909
+经团联 13.900677652
+盐浓度 12.8020653633
+网络适配器 13.900677652
+交警部门 9.87532596124
+信差 12.1089181827
+雪撬 13.2075304714
+狗食 12.8020653633
+揭帖 9.4233408375
+官属 10.2371160058
+姜戎 12.5143832909
+劳三军 10.8096351986
+杨钦 13.2075304714
+杜律 13.2075304714
+风中 9.12999302751
+杜德 12.2912397395
+丙型 13.900677652
+僧伽罗 10.9049453784
+财政学 11.7034530746
+杨钊 12.2912397395
+组织科 13.900677652
+沿海地区 8.00627481771
+庄宗同 13.2075304714
+殷天赐 12.8020653633
+杜微 12.2912397395
+官山 10.5684731418
+今年夏天 10.533381822
+信州 10.8096351986
+卡蒙斯 13.2075304714
+女同性恋 13.900677652
+官封 11.4157710022
+滑雪者 13.2075304714
+揭幕 10.0720362555
+字首 12.8020653633
+引力能 12.8020653633
+前驱 9.82314020807
+摹仿 11.0103058941
+栗子 9.55687223012
+贪污盗窃 13.2075304714
+萨诸邦 13.900677652
+高举着 10.604840786
+肘腋 11.8212361103
+中轴线 9.58318953844
+穆德 11.9547675029
+编译成 12.1089181827
+搭钩 12.5143832909
+放糖 11.9547675029
+轰隆声 12.1089181827
+左右群 12.8020653633
+凹镜 13.900677652
+杜忠 13.900677652
+风倒 13.900677652
+几十万千米 12.5143832909
+肿瘤病毒 13.900677652
+四战 13.2075304714
+余江县 12.1089181827
+曲靖市 11.0103058941
+年头儿 10.9049453784
+芦山 12.8020653633
+山西晋 13.900677652
+决定性 7.78258045393
+维格纳 12.5143832909
+那木罕 11.9547675029
+特色旅游 12.2912397395
+之水 9.33632946051
+杜希 13.900677652
+吉思益 13.2075304714
+胡说八道 9.10488710638
+遗留 8.83808261895
+谷贵时 13.2075304714
+风凉 11.7034530746
+六十米 12.8020653633
+趋同性 13.2075304714
+官差 11.598092559
+以战养战 11.598092559
+荡寇 11.5027823792
+撵出 10.604840786
+战斗人员 11.8212361103
+杨锐 9.53122979951
+比利牛斯 10.2371160058
+轻纺城 11.7034530746
+布林耶 12.8020653633
+定好 10.9049453784
+红十字国际委员会 13.2075304714
+修养 8.78268383956
+闻起来 11.598092559
+表音文字 13.900677652
+正字 10.533381822
+毒菌 12.5143832909
+修关 12.8020653633
+禽蛋 10.4041700905
+社名 12.5143832909
+战略思想 10.0720362555
+雅虎 9.98865464655
+默认设置 13.900677652
+九代 11.7034530746
+价格合理 11.598092559
+和义净 12.8020653633
+拉夫桑贾尼 12.5143832909
+扬州市 10.2117981979
+饮料 7.6468488404
+剪切机 13.900677652
+碰运气 10.604840786
+国地税 13.2075304714
+周仆刚 12.8020653633
+搭错 12.1089181827
+从小红 13.900677652
+风冷 10.3453295905
+信封 8.64318227995
+觇标 12.5143832909
+白蒲 12.8020653633
+任组长 11.1926274509
+柯坪 13.2075304714
+封子 11.7034530746
+主权国 12.8020653633
+纳入计划 12.5143832909
+杨镐 11.9547675029
+习旅 11.5027823792
+朱大典 11.5027823792
+作何解释 12.5143832909
+微波荡漾 13.900677652
+控制点 11.0674643079
+定夺 9.30555780184
+莲籽 13.2075304714
+横槊赋诗 13.900677652
+之江 10.4994802703
+祝融峰 11.5027823792
+向庙坪 12.8020653633
+加斯科 13.900677652
+沉默 6.98000614773
+掩鼻 12.1089181827
+幽州 8.70218062071
+揭开 7.69208762588
+背腹受敌 13.900677652
+可可托海 12.8020653633
+勿忘我 11.4157710022
+刘尊棋 13.2075304714
+氯化铝 13.900677652
+畅春园 10.604840786
+自同构 13.900677652
+耳光 8.26232298264
+氯化铁 11.0103058941
+待业人口 13.900677652
+重任在肩 11.5027823792
+常温状态 13.900677652
+齐威王 10.9049453784
+多平方米 9.93038573842
+杜康 11.3357282945
+氯化银 12.1089181827
+泾阳县 12.2912397395
+不剩 10.0294766411
+做大 8.17709255002
+洋风 13.2075304714
+吴尔夫 11.7034530746
+荡子 13.900677652
+患感冒 11.2616203224
+修凿 11.3357282945
+做头 11.8212361103
+刘豫州 10.9562386728
+还原论 11.598092559
+毒草 10.604840786
+丁灵威 13.900677652
+吴克善 13.2075304714
+耐旱 9.56994431169
+黄水疮 12.5143832909
+凯洛 11.4157710022
+伸下 12.1089181827
+黑藻 12.5143832909
+十六节 13.2075304714
+蒙娜丽莎 11.5027823792
+择肥而噬 13.2075304714
+二氧化锡 12.5143832909
+杨门 11.8212361103
+明叔听 11.5027823792
+风儿 10.642581114
+新奇感 12.1089181827
+两条线 10.604840786
+市政管理 10.0294766411
+头梳 11.9547675029
+财务预算 9.87532596124
+长路 10.7226238216
+孟京 12.5143832909
+第四场 12.1089181827
+衔环 11.7034530746
+张昭仍 13.2075304714
+级距 13.2075304714
+黄茂如 12.2912397395
+氯化钾 10.6818018271
+三盆 13.900677652
+做好 6.39134238596
+氯化钠 9.61021821083
+氯化钡 11.8212361103
+豪斯曼 13.900677652
+之法 8.26232298264
+九百九十八 13.900677652
+非此 11.8212361103
+氯化钯 12.5143832909
+拜恩 12.8020653633
+焦柳 12.8020653633
+蕞尔小国 13.900677652
+杨阳 12.1089181827
+高大雄 13.2075304714
+治标不治本 11.598092559
+九百万亿元 13.2075304714
+何光景 12.8020653633
+扣襻 12.2912397395
+魏巍女 12.5143832909
+定婚 12.1089181827
+矽钢 13.900677652
+无国界 12.8020653633
+唯理主义 12.8020653633
+研究局 11.598092559
+做媒 10.6818018271
+第四品 12.5143832909
+修剪 9.84023464143
+艾美特 13.2075304714
+若冠玉 13.2075304714
+万粒 11.3357282945
+色相 10.9562386728
+齐堆 9.06439574502
+车技 12.2912397395
+氧化作用 11.1280889297
+记里鼓车 12.1089181827
+前额 9.01787572939
+联合宣言 11.1926274509
+常隐 12.8020653633
+造影术 13.2075304714
+官廷 12.8020653633
+非梦 11.8212361103
+风动 11.3357282945
+南果梨 12.8020653633
+责任制 9.03314320152
+海陆丰 11.1280889297
+空盼 12.8020653633
+薄伽丘 10.9562386728
+日上三竿 11.5027823792
+雪晶 12.5143832909
+辽阳市 10.765183436
+官庄 11.3357282945
+草丛里 9.61021821083
+雪景 11.0674643079
+官府 7.25039860339
+自来火 12.8020653633
+商学系 13.900677652
+夏军攻 12.8020653633
+官店 13.2075304714
+焦枯 12.5143832909
+乐毅 10.2371160058
+油乎乎 13.2075304714
+冬羽 13.900677652
+为人正派 11.1280889297
+芭比娃娃 12.8020653633
+焦枝 10.2371160058
+以绝后患 11.4157710022
+乙酉年 13.2075304714
+邻省 10.3171587135
+风力 8.19689517732
+修到 10.6818018271
+知义多情 13.900677652
+盥洗 10.7226238216
+流式细胞 12.8020653633
+二十五届 12.8020653633
+像个 8.19356738723
+迷你型 11.7034530746
+雪暴 11.9547675029
+佛教徒 9.4233408375
+放纵 9.22784881751
+曹性 12.2912397395
+车房 12.8020653633
+伸下来 13.900677652
+张孝祥 11.9547675029
+信念 8.55834340001
+刀马 11.8212361103
+山之宝 12.1089181827
+范德比尔 11.9547675029
+盘费 11.1280889297
+非标 11.8212361103
+非核 12.1089181827
+信心 6.08305220892
+卡拉什尼科夫 11.1280889297
+科雷 12.2912397395
+亚声速 10.9049453784
+习禅 12.5143832909
+教学部 12.8020653633
+医疗队 10.9049453784
+三叶虫 10.4349417492
+黑蚁 13.900677652
+咏赞 13.2075304714
+拉汉姆 13.900677652
+二十五岁 10.6818018271
+处治 9.84023464143
+人造地球 9.31571017331
+益奢 12.8020653633
+内皮细胞 10.9049453784
+刘香兰 12.2912397395
+败名 13.900677652
+法向应力 12.2912397395
+罢止 13.900677652
+红一白 12.1089181827
+吃糠咽菜 12.1089181827
+凹面 10.9049453784
+发售日期 12.5143832909
+杨雪 8.36334338496
+莳花种草 13.900677652
+前顶 12.8020653633
+打耳光 12.5143832909
+植树造林 10.2371160058
+信德 10.4994802703
+艾哈迈德 10.3171587135
+益处 9.58318953844
+不太好 8.81308131674
+前项 11.598092559
+挨板子 12.5143832909
+杀鸡儆猴 12.2912397395
+放给 12.1089181827
+常陈 13.2075304714
+渐进主义 12.8020653633
+务工人员 10.9049453784
+乌加河 11.4157710022
+义蕴 13.900677652
+八扇 13.900677652
+红牡丹 11.3357282945
+刺头儿 13.2075304714
+信徒 8.32472854883
+油然作云 13.900677652
+唁电 13.2075304714
+信得 11.4157710022
+官帽 11.1280889297
+贷借 11.9547675029
+发哥 10.2630914922
+车手 11.5027823792
+短须 11.1926274509
+张驴儿 13.2075304714
+杜尔 10.765183436
+遗着 13.900677652
+惠农县 13.900677652
+产褥 11.8212361103
+风口 10.1630080337
+杜尚 12.8020653633
+刘姨 11.1926274509
+放缩 13.900677652
+四川盆地 8.53003962385
+做官 8.53003962385
+九寸 13.2075304714
+阎婆惜 10.9562386728
+定子 10.765183436
+贷出 9.33632946051
+资金 4.47708246144
+克尔曼 11.7034530746
+炼气 11.7034530746
+同意书 12.8020653633
+巴克德 13.900677652
+达达主义 11.0674643079
+闭环 11.2616203224
+放缓 7.61096208107
+前馈 11.7034530746
+做客 9.04086524761
+巡回赛 13.2075304714
+限压阀 13.900677652
+孟懿子 13.900677652
+新闻媒介 11.7034530746
+风发 12.1089181827
+产门 13.900677652
+伤寒杆菌 12.1089181827
+杨震 11.8212361103
+咀嚼 8.5488195185
+雪松 10.3453295905
+雪板 11.7034530746
+穆尔 11.0674643079
+脱脂奶 12.8020653633
+二十周岁 13.900677652
+拜拜 11.0103058941
+骨鲠 12.2912397395
+合成洗涤 13.2075304714
+责任区 12.8020653633
+洛泽尔 13.2075304714
+圣多美 11.7034530746
+放置 8.20694551317
+伏尔泰 10.0088573539
+鄂国公 12.5143832909
+敷剂 13.2075304714
+王汗见 12.8020653633
+伍子管 12.8020653633
+儿童心理 11.0674643079
+杆茵 13.900677652
+荡妇 12.1089181827
+榜上无名 13.2075304714
+杨青 11.5027823792
+雪杖 12.2912397395
+同亚非 13.2075304714
+穆尼 13.900677652
+雪村 13.2075304714
+做寿 11.9547675029
+统购包销 12.5143832909
+半新不旧 10.7226238216
+笛膜 13.2075304714
+救急 10.3453295905
+近似算法 13.900677652
+山地气候 10.1871055853
+工商联合 12.5143832909
+贷入 13.900677652
+坏良心 12.1089181827
+翳障 12.8020653633
+第二号 11.2616203224
+擅自决定 11.3357282945
+巴尔喀什湖 10.0720362555
+递延 10.642581114
+毒腺 10.6818018271
+炼油 8.17382990439
+煞风景 12.8020653633
+反过 12.2912397395
+荡女 13.900677652
+密封环 13.2075304714
+附托 13.900677652
+应电流 13.900677652
+杆菌 9.00283785202
+磁力 10.0720362555
+安德孙 13.2075304714
+鲍素 13.2075304714
+吊下去 12.5143832909
+瞬时 9.15574552361
+重氮基 13.2075304714
+电子产品 9.46986085313
+白灿灿 13.2075304714
+遗矢 13.2075304714
+风华 12.1089181827
+哈萨维 11.8212361103
+脑水肿 10.6818018271
+尽快恢复 11.0674643079
+放羊 9.93038573842
+之源 9.23723855786
+东跑西颠 11.8212361103
+雨意 13.2075304714
+施雷廷 12.8020653633
+不计得失 12.8020653633
+过永寿 13.900677652
+严慧书 11.3357282945
+岔开 9.46986085313
+掂斤播两 13.900677652
+劳动锻炼 12.8020653633
+大姚县 13.2075304714
+话不虚传 11.9547675029
+饮服 11.598092559
+信度 11.598092559
+黑甜 13.2075304714
+诸君子 10.9049453784
+乔普林 12.8020653633
+拜托 9.82314020807
+雪柳 13.900677652
+承建商 12.2912397395
+念点 13.900677652
+定定 9.63799777493
+杨韦 13.900677652
+摩尔曼斯克 11.3357282945
+凹陷 8.86372504956
+路世德 12.1089181827
+举善荐贤 13.900677652
+金光明 10.2117981979
+监测船 12.8020653633
+张国柱 13.900677652
+样态 13.2075304714
+哭灵 11.9547675029
+卜职司 12.8020653633
+常青 10.4349417492
+古三苗 13.2075304714
+拜扫 13.2075304714
+风化 8.38322475551
+问案 12.8020653633
+高山大川 13.2075304714
+牛年马月 13.2075304714
+人贩子 10.0720362555
+定居 7.41604241634
+毒蛾 10.765183436
+定局 9.20932976975
+陈其事 13.2075304714
+杨逵 12.5143832909
+件数 11.4157710022
+喜讯传来 13.900677652
+有惊无险 10.6818018271
+耐性 9.89334446674
+粉墨登场 11.1280889297
+教育资源 10.765183436
+弗拉姆 13.2075304714
+冶炼厂 10.3743171274
+馈线 13.900677652
+瑞士银行 10.2630914922
+信奉 7.48231271604
+烫个 12.5143832909
+焚烧 8.41173992582
+毒蛇 8.44963919841
+左右两个 11.9547675029
+注册证 12.8020653633
+克西斯 12.2912397395
+封兄 12.8020653633
+咏诗 12.5143832909
+大通银行 13.900677652
+张福河 12.5143832909
+八百岁 13.2075304714
+并排而坐 13.900677652
+曹丕闻 12.8020653633
+馈给 13.2075304714
+一两颗 12.8020653633
+杜子 12.8020653633
+束手无措 13.900677652
+附文 13.2075304714
+崽儿 12.2912397395
+渠灌田 12.5143832909
+多面手 12.1089181827
+莎车 9.85762638414
+斜进 13.900677652
+秉赋 11.8212361103
+雪恨 11.1926274509
+包石栎 12.2912397395
+家贫如洗 13.900677652
+舍身取义 12.8020653633
+铝板带 12.2912397395
+哭泣 8.14493543839
+风湿热 10.9562386728
+数不尽 11.598092559
+益德 13.2075304714
+今非昔比 10.4666904475
+水潜夫 12.8020653633
+描述性 11.0674643079
+宋江背 12.5143832909
+音色 9.21854642485
+高情厚谊 13.900677652
+朱子新 13.2075304714
+海连义 12.1089181827
+任领军 12.8020653633
+忍受得了 12.5143832909
+王小三 13.2075304714
+双石铺 12.8020653633
+氯化金 13.2075304714
+曹昭 12.5143832909
+输入品 11.8212361103
+样条 11.7034530746
+耳呜 13.900677652
+诫律 13.2075304714
+沈祖荣 12.8020653633
+杜宝 13.900677652
+姜昆 12.5143832909
+杜宇 11.5027823792
+荡平 10.4994802703
+样板 9.93038573842
+协迫 12.8020653633
+风味 8.68574189437
+卡瓦拉 12.8020653633
+毒虫 9.59661255877
+饮恨 11.4157710022
+幽居 11.2616203224
+普锐斯 12.5143832909
+单相电 12.5143832909
+宋建康 13.2075304714
+马军司 11.3357282945
+曹明 13.900677652
+巴布延 13.2075304714
+耍闹 13.2075304714
+于巨潮 12.2912397395
+流窜 10.533381822
+饶乐 12.2912397395
+宵禁时间 13.900677652
+常速 13.900677652
+科昆虫 10.2371160058
+色灯 13.2075304714
+李平水 9.61021821083
+忽长忽短 13.900677652
+穆宗 10.2117981979
+样本 8.50705010562
+放着不管 13.900677652
+剪切应力 13.900677652
+蒙藏院 13.2075304714
+杜密 12.1089181827
+风吹 8.53938548627
+安德尔 12.8020653633
+雨景 13.900677652
+做饭吃 12.8020653633
+和善业 13.2075304714
+完颜杲 12.2912397395
+哈萨克族 10.2897597393
+定岗 13.900677652
+样机 9.65218240993
+妇唱夫随 13.900677652
+小张乙 11.4157710022
+写写字 12.8020653633
+马雪斯 13.900677652
+九千余 13.900677652
+黑胖 12.2912397395
+调进来 13.900677652
+贵校 13.2075304714
+当家的 10.4994802703
+远红外线 11.9547675029
+元名臣 13.2075304714
+十数年 10.4349417492
+焦愁 13.900677652
+僳僳族 13.900677652
+歙砚 11.1926274509
+随意发 13.900677652
+曹晟 12.5143832909
+风向 8.73589167805
+资阳 10.533381822
+跨出去 12.5143832909
+高压电 11.4157710022
+望远式 12.8020653633
+非流通股 9.7898037878
+搭配 8.11378027061
+贝尼克 13.900677652
+驻点 12.8020653633
+固然会 11.598092559
+色彩纷呈 12.8020653633
+云枝 11.1926274509
+场主 12.5143832909
+维贾伊 13.2075304714
+魏州骄 12.8020653633
+遗照 13.900677652
+雨果 10.1394775363
+场下 12.5143832909
+第四号 13.2075304714
+雨林 9.85762638414
+博金斯 13.2075304714
+热力学 8.55357012126
+黑脉 12.8020653633
+怀山襄陵 13.900677652
+第四句 11.7034530746
+立宋徽 13.2075304714
+奉还 10.642581114
+揭密 11.0103058941
+斯坦者 13.2075304714
+山碧波 12.2912397395
+电话录音 13.2075304714
+注册量 12.8020653633
+斯拉德 13.2075304714
+宋江自 10.4666904475
+历历在目 9.80633308975
+奉迎 11.5027823792
+柯南 12.5143832909
+许宝蘅 13.2075304714
+荷泽 11.9547675029
+张孝纯 9.75754292558
+丢人 9.32596667347
+庞德闻 13.2075304714
+常量 8.98802276624
+车旗 12.8020653633
+做工 8.36334338496
+益康 12.8020653633
+常采 13.900677652
+人格解体 13.2075304714
+五金件 13.900677652
+吴名 13.2075304714
+处死 7.82993992397
+高有德 12.2912397395
+曹某 12.2912397395
+车族 11.1926274509
+请谅解 12.8020653633
+二十五家 13.2075304714
+之梦 10.533381822
+行政拘留 10.2630914922
+魏名士 13.2075304714
+车改 12.5143832909
+信士 12.5143832909
+败亡 9.49395840471
+地球仪 11.4157710022
+北京晨报 9.32596667347
+定州 9.89334446674
+唐山市委 13.2075304714
+非法所得 11.8212361103
+衰退期 11.1926274509
+冯道济 12.1089181827
+九牧王 12.8020653633
+看得出 9.11318590919
+第四十 12.2912397395
+弹簧片 12.8020653633
+工资管理 13.900677652
+益广 12.2912397395
+不能逃避 13.900677652
+败事 11.8212361103
+完颜昌 11.598092559
+第四卷 8.77671367257
+摩托车厂 13.900677652
+楔住 13.900677652
+四平方公里 13.2075304714
+刘乡长 13.2075304714
+比晴雯 13.2075304714
+彝良 12.8020653633
+主权利 13.900677652
+姜末 13.900677652
+雅芳 13.900677652
+曹杨 12.1089181827
+李恒嵩 13.2075304714
+畅行无阻 12.2912397395
+荷池 12.2912397395
+齐伯林 13.2075304714
+修善 11.8212361103
+之森 13.2075304714
+裴他姐 13.2075304714
+美能达 13.900677652
+吴氏仙 13.900677652
+焦急 7.76727960898
+焦性 13.2075304714
+曹杰 11.8212361103
+前齿 12.5143832909
+广寒宫 11.4157710022
+习练 11.7034530746
+狗尾草 12.1089181827
+注音符号 12.5143832909
+薏苡仁 11.3357282945
+毛半仙 13.900677652
+研究家 10.7226238216
+官大 10.8561552143
+丢上 13.900677652
+花色品种 11.598092559
+如痴如醉 11.1926274509
+联轴器 11.7034530746
+丢丑 11.5027823792
+宗第 9.82314020807
+研究室 8.39534611604
+败仗 9.12999302751
+通便药 13.2075304714
+数据误差 13.2075304714
+领港 13.900677652
+心腹大患 10.765183436
+外国名著 13.900677652
+满室生 13.2075304714
+黄玫瑰 12.5143832909
+组织罪 11.3357282945
+放稳 11.8212361103
+向婆子 13.900677652
+无规运动 13.900677652
+网络操作系统 12.5143832909
+马军先 12.8020653633
+任翰林 11.8212361103
+肉圆子 13.2075304714
+木波罗 13.2075304714
+主观原因 11.598092559
+扣起 13.2075304714
+多面性 12.2912397395
+非用 11.5027823792
+登坛拜将 13.2075304714
+色狼 11.8212361103
+雪神 13.900677652
+八千余家 13.2075304714
+明叔又 11.8212361103
+记录稿 13.900677652
+挫裂伤 13.900677652
+过永平 12.8020653633
+二苯醚 12.8020653633
+关吉玉 13.2075304714
+严世 11.1926274509
+刘若英 11.7034530746
+放空 10.5684731418
+黑色 6.56765463759
+鹅蛋 11.598092559
+高堂大厦 13.900677652
+腊子口 12.2912397395
+爱国情 13.2075304714
+捐助者 13.2075304714
+艇员 10.4666904475
+杜奇 13.2075304714
+知明 13.2075304714
+之死 9.16447920358
+伦会盟 11.8212361103
+和凉州 13.2075304714
+宋江若 13.2075304714
+臂力 11.0103058941
+升降器 12.8020653633
+巴黎盆地 11.5027823792
+哭鼻子 10.6818018271
+闭目 9.55687223012
+臂助 13.900677652
+之歌 9.01032852375
+冯保微微 13.2075304714
+雕镌 12.5143832909
+家具城 13.900677652
+矫饰 11.4157710022
+定常 10.642581114
+三明市 11.0674643079
+遗爱 13.900677652
+穆塔瓦 13.2075304714
+乐东县 12.5143832909
+如临深渊 11.3357282945
+中秋月饼 13.2075304714
+先宰 13.2075304714
+伊韦尔 13.2075304714
+电力机车 10.4349417492
+奔放 9.49395840471
+景行 12.5143832909
+亨德利 13.2075304714
+影格 13.2075304714
+拜望 9.74179456862
+以网 13.900677652
+近万名 11.7034530746
+杜如 10.8561552143
+六十篇 12.1089181827
+谭大人 11.5027823792
+克鲁兹 13.2075304714
+莫寿 13.2075304714
+横匾 11.598092559
+索洛莫 13.900677652
+浙江队 13.2075304714
+估估 13.2075304714
+严于 10.8096351986
+十数尾 12.8020653633
+零七八碎 13.900677652
+低音管 13.2075304714
+附来 13.2075304714
+殖民主义者 9.6811699468
+观景窗 13.900677652
+吴为本 12.5143832909
+图季曼 13.2075304714
+文锦渡 12.1089181827
+严云 13.900677652
+汝弟 11.8212361103
+沉香 9.84023464143
+康默记 13.2075304714
+失之于 12.2912397395
+附有 8.6803218269
+五花八门 9.44633035572
+严令 9.4233408375
+八百年 10.8096351986
+官威 13.900677652
+阳电子 13.900677652
+宋江指 13.900677652
+贾琏拿 12.5143832909
+苫盖 12.5143832909
+畏难情绪 12.1089181827
+风嘴 12.8020653633
+信宿 13.2075304714
+次干路 13.2075304714
+内当家 12.5143832909
+李龟寿 13.900677652
+三峡地区 12.5143832909
+民间艺术 10.1164880181
+教育会 10.3453295905
+信守 10.2897597393
+定座 13.2075304714
+事务所律师 9.89334446674
+东问西 12.8020653633
+之母 9.33632946051
+由崇明 13.2075304714
+阴沉沉 10.1630080337
+萌发 8.80081122415
+给钱 9.43476953332
+雅致 8.96620371885
+信宜 12.5143832909
+信实 12.5143832909
+孙礼 11.0674643079
+活不下去 10.2897597393
+手握着 10.4994802703
+车架 10.3171587135
+姓林 11.0674643079
+塞纳河 10.3171587135
+理发师 10.4666904475
+不变资本 7.61467955747
+姜文 12.2912397395
+往返运输 13.900677652
+水电工程 11.4157710022
+武惠良 9.77354326693
+做得 7.93197009199
+忧谗畏讥 13.2075304714
+定当 10.6818018271
+于阿瑜 13.900677652
+官寨 9.12999302751
+女主角 9.74179456862
+风城 11.9547675029
+蛤粉 12.5143832909
+延津县 10.4041700905
+经典对白 13.900677652
+担雪填井 13.900677652
+定形 10.9562386728
+独创 9.53122979951
+二十五处 13.2075304714
+彩陶文化 12.1089181827
+估产 11.2616203224
+以诚相待 11.7034530746
+嚼舌 12.8020653633
+义肢 12.8020653633
+别生 11.4157710022
+定影 11.7034530746
+厌烦 9.17328983326
+义项 12.2912397395
+胺键 13.900677652
+定式 10.8096351986
+柯克 11.1280889297
+责任地 12.1089181827
+利耶帕亚 13.900677652
+王司马歆 13.2075304714
+溃于蚁穴 13.2075304714
+重氮化 11.8212361103
+专用线路 13.900677652
+禽肥 13.900677652
+第四册 12.5143832909
+七年级 13.2075304714
+讳疾忌医 12.1089181827
+姜族 13.2075304714
+奇奇怪怪 11.0674643079
+名公巨卿 12.5143832909
+似角 13.900677652
+奢求 11.8212361103
+卿大夫 9.87532596124
+师事儒 12.8020653633
+反唇相讥 10.642581114
+知之者 12.2912397395
+时有发生 9.30555780184
+迁移率 11.3357282945
+海奠峡 13.2075304714
+酌古准今 13.900677652
+巴彦淖尔 11.5027823792
+金彩瓷 12.5143832909
+等幅面 12.8020653633
+禽肉 10.9562386728
+珠儿 10.8561552143
+大风歌 11.8212361103
+延津北 13.2075304714
+五两案 13.2075304714
+汉元鼎 10.765183436
+修城 11.2616203224
+财政局 8.35941410682
+公东征 11.0674643079
+三叶草 11.4157710022
+苦难 8.0484751722
+定心 11.1926274509
+非洲杯 13.2075304714
+米查林 13.900677652
+结案率 11.9547675029
+勒马 8.80692745117
+松口气 11.0674643079
+晶报 12.8020653633
+厚古薄今 13.900677652
+黑莓 10.1630080337
+下相 12.1089181827
+切身体会 11.7034530746
+遗珠 13.900677652
+点汤 12.8020653633
+雀盲眼 13.900677652
+非洲 6.42647284548
+鹁鸪 13.900677652
+寻亲访友 13.900677652
+储藏柜 11.5027823792
+桑科尔 13.2075304714
+初步查明 11.598092559
+闭眼 9.38981814546
+社刊 13.900677652
+耳坠 10.5684731418
+鹁鸽 10.4041700905
+奉贤 10.9562386728
+全国上下 11.7034530746
+严修 13.2075304714
+嵩山少林寺 11.598092559
+江淮地区 10.7226238216
+定律 7.45495783259
+掩饰 8.1608847398
+资费 9.53122979951
+矽酸 13.900677652
+车条 13.900677652
+明叔别 12.8020653633
+洋麻 13.900677652
+姜敏 13.900677652
+非浅 11.9547675029
+只闻其声 11.4157710022
+风圈 11.8212361103
+鲁鱼亥豕 13.900677652
+明叔刚 13.2075304714
+尼穆莱 13.2075304714
+吴太夫人 11.9547675029
+全国三八红旗手 13.900677652
+真抓实干 10.8561552143
+坎大哈 11.1280889297
+岔子 10.4041700905
+傅泛济 13.2075304714
+程序界面 13.900677652
+历久弥坚 12.8020653633
+风土 9.80633308975
+杨诚话 12.5143832909
+奉赠 12.2912397395
+长此下去 10.9562386728
+碳酸钠 10.1394775363
+碳酸钡 12.5143832909
+蹑足 12.1089181827
+再也不是 10.8096351986
+五金厂 13.900677652
+肇州 12.2912397395
+认贼为子 13.900677652
+阿斯基 11.9547675029
+尼尔森 10.3743171274
+餐饮店 11.4157710022
+扯旗 12.8020653633
+姜总爷 13.2075304714
+芸芸众生 11.0674643079
+场区 11.1926274509
+佛香阁 11.9547675029
+难度 7.33400522217
+布鲁特 10.9562386728
+为师 9.05649056552
+第四任 11.9547675029
+斜轧 13.2075304714
+第四件 12.5143832909
+色泽 8.1608847398
+照单全收 10.9049453784
+整体观 12.1089181827
+群雌粥粥 13.2075304714
+轰轰隆隆 11.598092559
+洋腔 13.2075304714
+伊莱克斯 12.5143832909
+败北 9.89334446674
+蕾铃 13.900677652
+第四代 9.40086798165
+杳无踪迹 13.2075304714
+杨谅 13.2075304714
+中餐馆 11.9547675029
+国法 8.93783302172
+驾雾腾云 12.8020653633
+固定物 13.900677652
+搭调 11.9547675029
+霄汉 11.0103058941
+联交所 10.8096351986
+黑鱼 10.533381822
+郊原 12.5143832909
+加紫笋 13.900677652
+乔贝河 12.8020653633
+分配比例 10.9562386728
+碳酸铵 12.8020653633
+遗民 9.98865464655
+生活习惯 8.96620371885
+丢去 11.8212361103
+电子商务 8.18036587537
+洪蒙 13.2075304714
+各期 10.8096351986
+有何贵干 11.8212361103
+鲁王爷 11.7034530746
+逐步撤出 10.642581114
+非独 13.2075304714
+信息反馈 11.0674643079
+防毒面具 9.12155415886
+军事医学科学院 12.5143832909
+水里去 10.1394775363
+天外来客 11.8212361103
+浙江美术学院 11.9547675029
+刘四厢 10.8096351986
+总务处 11.3357282945
+黑鲸 13.2075304714
+太平县 11.5027823792
+松明子 13.900677652
+看家狗 11.9547675029
+余下来 11.7034530746
+前舱 10.9562386728
+氢氧化 11.598092559
+殃毒 13.900677652
+攻防兼备 11.2616203224
+操纵台 12.1089181827
+何德治 12.8020653633
+优秀员工 12.5143832909
+常谈 13.2075304714
+科德利 12.1089181827
+柯亨 12.2912397395
+非爱 13.900677652
+拜礼 11.1280889297
+第一案 10.5684731418
+产学研 10.533381822
+传下 9.03314320152
+格勒兹 13.2075304714
+银行信贷 8.4284069783
+短舱 11.8212361103
+雪粉 11.9547675029
+弓弩手 10.1630080337
+叨陪末座 13.900677652
+和帝 11.4157710022
+克鲁伦 13.2075304714
+殷天锡 12.5143832909
+强子谱 13.2075304714
+两三点 12.1089181827
+难平 10.9049453784
+喧闹 9.31571017331
+哪一部 12.2912397395
+和平 6.66289946005
+黄水河 12.1089181827
+王城岗 10.8561552143
+败叶 10.8561552143
+暨大 10.642581114
+拜祷 12.1089181827
+迻译 13.900677652
+之症 10.8561552143
+义齿 11.7034530746
+雪糕 12.2912397395
+状告 9.82314020807
+拐来拐去 12.2912397395
+扯上去 13.900677652
+恒有 12.2912397395
+可焊性 12.8020653633
+第四个 9.12999302751
+音乐学 11.9547675029
+人各有志 11.4157710022
+颜合达 12.1089181827
+放龙入海 13.900677652
+永不相见 13.900677652
+拜祭 11.598092559
+钱俊瑞 12.8020653633
+放放 11.8212361103
+不干胶 13.2075304714
+常绿树 11.4157710022
+背若芒刺 13.900677652
+民主改革 9.89334446674
+控制棒 11.0674643079
+驻沪 11.598092559
+元崇德 12.8020653633
+党团员 12.8020653633
+禁止通行 10.9562386728
+之理 8.0746775446
+焦糖 12.8020653633
+无耻谰言 13.2075304714
+振翼 12.8020653633
+递增 8.68574189437
+一刻不停 10.9049453784
+乞力马扎罗山 11.0103058941
+难得 7.05586217277
+纸型 12.8020653633
+搭起 8.96620371885
+哪几个 11.598092559
+丢勒 11.1280889297
+柴油发动机 10.0720362555
+各机 13.2075304714
+焦糊 11.5027823792
+沐浴乳 13.2075304714
+姓朱 10.4666904475
+刘震云 10.4994802703
+后果自负 12.2912397395
+组织性 10.6818018271
+另想办法 11.4157710022
+苦衷 9.30555780184
+级长 13.900677652
+腾云致 13.2075304714
+总目录 13.2075304714
+雨篷 13.2075304714
+打头阵 11.0103058941
+甲等医院 12.8020653633
+第四例 13.900677652
+台北区 13.900677652
+严兵 12.5143832909
+突击检查 10.8561552143
+放散 11.9547675029
+维格曼 12.1089181827
+难忘 8.71329184614
+资讯 6.67446864188
+红河州 11.5027823792
+巢础 13.2075304714
+哈朗先 13.2075304714
+驻法 11.0103058941
+法国外交部 11.7034530746
+戎狄交 12.8020653633
+杨赋 12.8020653633
+黄州镇 12.8020653633
+难忍 9.21854642485
+棉花包 11.3357282945
+江苏省委宣传部 13.900677652
+苦行 10.0720362555
+带来 5.01523674027
+和弦 10.2117981979
+严冬 9.84023464143
+刘景莲 13.2075304714
+三千多年 11.8212361103
+医疗费 9.72629038208
+藏宝洞 10.6818018271
+常败 13.900677652
+王孙公子 11.8212361103
+第四位 9.25628675283
+春运期间 13.2075304714
+习武 9.96885201925
+严冷 13.2075304714
+布率兵 12.5143832909
+丘氏 12.8020653633
+前茅 10.0294766411
+嬴政 11.598092559
+碳酸锂 10.604840786
+注册费 13.2075304714
+碳酸锌 13.2075304714
+为人正直 11.7034530746
+估值 5.65686922831
+肥田 11.3357282945
+包好 9.80633308975
+令人振奋 10.3743171274
+白鹿镇 9.61021821083
+一段路 9.19114745066
+拉比亚 11.0674643079
+没有响应 12.8020653633
+白榴石 12.5143832909
+核糖核酸 9.98865464655
+路透社 8.9519177616
+卵母细胞 12.1089181827
+杨超 12.8020653633
+塞纳特 12.8020653633
+罕事 12.1089181827
+外贸体制 12.5143832909
+中国航天 11.0103058941
+车祸 9.54396882529
+覃恩 13.900677652
+网罗人材 13.900677652
+俄狄浦斯 10.8096351986
+烫发 11.3357282945
+丢到 11.0103058941
+车票 8.84443184663
+淮滨县 11.9547675029
+数模转换 13.2075304714
+碳酸镁 12.2912397395
+丢分 13.900677652
+维特根斯坦 11.7034530746
+网孔 12.2912397395
+斗鸡走犬 12.8020653633
+禽鸟 11.1280889297
+难当 9.89334446674
+弗兰克尔 13.2075304714
+众城 13.2075304714
+撞起 13.2075304714
+冷轧卷 12.2912397395
+曹丕自 13.2075304714
+包夹 12.5143832909
+内外呼应 13.900677652
+包头 8.80081122415
+汉顺帝 11.598092559
+起诉方 12.1089181827
+贫富差距 9.75754292558
+中厚板 10.4041700905
+慧学 13.900677652
+前肢 9.10488710638
+处理 5.41085565736
+深入骨髓 12.1089181827
+洋药 11.8212361103
+山东大学中文系 13.2075304714
+香港媒体 10.2897597393
+关一战 12.8020653633
+型业务 12.8020653633
+似钢 12.8020653633
+黑鸦 10.642581114
+放映 9.63799777493
+张锡纯 12.8020653633
+贮藏库 12.5143832909
+诈死 11.9547675029
+公报私仇 12.5143832909
+哈密顿 10.604840786
+车窗 9.09665660724
+玉皇殿 12.2912397395
+无敌军 13.900677652
+楚霸王 10.2117981979
+延津人 10.7226238216
+六十条 11.9547675029
+十几口 11.9547675029
+华远 11.1926274509
+严刑 10.2117981979
+墓葬品 12.8020653633
+黑鹰 11.0103058941
+黑鹳 10.8096351986
+开襟毛衣 13.2075304714
+前胡 13.900677652
+剔去 12.2912397395
+合浦县 11.0674643079
+放晴 10.4041700905
+鬼泣神号 13.900677652
+莘庄 12.2912397395
+伏牛山 8.90346537821
+整体论 12.8020653633
+败兵 9.89334446674
+炸平 12.2912397395
+五大三粗 11.5027823792
+前胸 9.20019728618
+省级重点 10.3743171274
+诈欺 12.2912397395
+蔚起 13.900677652
+喋喋 12.8020653633
+长期趋势 9.28555713513
+农民负担 11.2616203224
+凹进 11.7034530746
+铁观音 10.7226238216
+巢筑 11.5027823792
+明叔侃 12.8020653633
+崔宁 13.900677652
+平整土地 11.4157710022
+金坛 10.8561552143
+陈十思 12.8020653633
+丢入 11.8212361103
+雪线 9.07236391467
+耐纶 11.4157710022
+蟒山 12.8020653633
+抽壮丁 13.900677652
+破坏 6.11039527127
+克尔罗 13.900677652
+严加 8.96620371885
+十多步 12.5143832909
+罗马公教 11.598092559
+陈方垣 12.8020653633
+黑麦 10.2117981979
+奉送 10.8096351986
+医宗金鉴 12.5143832909
+余烬复燃 13.900677652
+抵事 13.2075304714
+十几台 11.5027823792
+前者 6.41912195007
+旱冰鞋 13.900677652
+园林景观 11.7034530746
+洋菇 13.2075304714
+场内 8.1902506346
+塔希尔 12.1089181827
+伏尔甘 13.900677652
+侍之制 13.2075304714
+严办 10.604840786
+拍巴掌 10.8096351986
+塞浦路斯 9.80633308975
+车程 10.4994802703
+和尚 6.84709192478
+张国纪 11.598092559
+翁文灏 10.765183436
+宜章县 13.900677652
+惊叹声 12.2912397395
+印儿 12.8020653633
+尺泽 13.900677652
+苦读 10.6818018271
+如你所愿 13.900677652
+记忆里 9.89334446674
+萨帕塔 11.7034530746
+清王朝 8.99540287354
+下着 10.2371160058
+帧面 13.900677652
+附笔 12.5143832909
+看得人 10.8096351986
+德宏傣族景颇族自治州 11.2616203224
+十六首 13.2075304714
+张国维 10.9049453784
+和局 12.8020653633
+疱疹病毒 11.0674643079
+丢官 11.0674643079
+汉贼不两立 12.8020653633
+集大成者 10.4349417492
+元恶 12.2912397395
+狮子吼 13.2075304714
+锻炼身体 10.1630080337
+曼尼斯 12.2912397395
+林壑 12.5143832909
+棉种 11.598092559
+蜜月旅行 13.900677652
+色温 12.2912397395
+经三路 9.98865464655
+滤波器 9.96885201925
+三峡大坝 11.9547675029
+起诉权 12.1089181827
+习性 8.19689517732
+董文敏 13.2075304714
+天真无邪 11.0674643079
+车管 13.900677652
+曹禺 10.604840786
+男子双打 11.2616203224
+智力型 13.900677652
+人员构成 11.5027823792
+记录本 11.4157710022
+克宋江 13.2075304714
+搭车 10.765183436
+吴铨叙 13.900677652
+曹福 13.2075304714
+波阿斯 12.5143832909
+录象 13.900677652
+炸开 9.54396882529
+蝗虫 9.0884932966
+所在区域 11.8212361103
+放有 10.9562386728
+上海辞书出版社 12.5143832909
+处男 12.8020653633
+都建业 11.7034530746
+黑鼎 12.1089181827
+苏菲亚 13.2075304714
+朱德熙 12.5143832909
+放松 7.44862869754
+车篷 11.0103058941
+遗漏 9.19114745066
+阿德尔 13.900677652
+孟津渡 12.2912397395
+巢穴 9.20932976975
+肇庆 10.0294766411
+吹出去 12.8020653633
+绿丹兰 11.9547675029
+谎称 10.4666904475
+洋船 11.8212361103
+放来 12.8020653633
+剂量率 13.2075304714
+十几发 13.2075304714
+冯应京 12.8020653633
+蚕头燕尾 12.8020653633
+前臂 10.4666904475
+丕业 13.900677652
+楚顷襄 11.8212361103
+投诉量 12.8020653633
+克尔纳 12.8020653633
+还原酶 11.2616203224
+包容 9.40086798165
+饮羽 13.2075304714
+掩藏 10.6818018271
+见财起意 11.8212361103
+宋天圣 12.5143832909
+揭丑 13.900677652
+放权 11.1926274509
+可追溯 9.59661255877
+五百多名 12.8020653633
+毒饵 12.8020653633
+龙舟竞渡 11.1926274509
+掩蔽 10.0505300503
+户外用品 11.9547675029
+吉思汗 13.2075304714
+知本 13.900677652
+泰姆奈 13.900677652
+巨竹 12.8020653633
+十几厘米 11.7034530746
+雅鲁 12.5143832909
+似锦 11.9547675029
+估分 13.900677652
+能进能出 12.8020653633
+网大 13.900677652
+包孕 13.2075304714
+马士著 13.2075304714
+楔入 10.9562386728
+驻港 12.1089181827
+包子 9.25628675283
+疲弊 13.2075304714
+真骨鱼 11.9547675029
+严厉 7.32699748502
+闭路电视 11.2616203224
+网外 13.2075304714
+黑龙 9.77354326693
+野营训练 12.8020653633
+金齿 12.2912397395
+有声有色 10.0294766411
+接踵而至 10.1164880181
+杨辉 12.1089181827
+前脑 12.1089181827
+低价股 10.4994802703
+会计报告 13.2075304714
+明镜 9.82314020807
+三百二十七公里 13.2075304714
+炸得 10.1871055853
+前脚 9.75754292558
+辛勤努力 12.1089181827
+巴拉圭河 11.4157710022
+常轨 12.2912397395
+字节 10.4994802703
+高枕无忧 10.1394775363
+裕固 11.1926274509
+陨石雨 12.2912397395
+微循环 10.4666904475
+习惯 6.27899265325
+赫尔辛基大学 11.1926274509
+亚丁湾 10.4666904475
+情怯 13.900677652
+色漆 12.8020653633
+前腰 13.2075304714
+带有 6.61243325096
+转眼之间 9.72629038208
+前腿 10.8096351986
+下眼皮 10.9562386728
+前言 9.11318590919
+杨进 12.8020653633
+雨神 10.8096351986
+网套 12.2912397395
+丽人行 10.9562386728
+马腾见 13.2075304714
+宋真宗 9.62401153296
+杨迈 12.8020653633
+孔清觉 13.900677652
+重头戏 10.0720362555
+烫出 13.900677652
+短腿 11.4157710022
+搭边 13.2075304714
+杨过 12.8020653633
+从未见过 9.45802639549
+千叶县 12.5143832909
+堆成堆 13.2075304714
+李方敬 13.2075304714
+曹纯 12.5143832909
+长达 7.1207557445
+西布玛斯 12.5143832909
+读物 9.96885201925
+特别税 13.2075304714
+疖子 12.5143832909
+摹刻 12.1089181827
+橛子 11.598092559
+场场 11.2616203224
+无止无休 13.2075304714
+程松圆 13.2075304714
+下级单位 13.900677652
+结业证书 13.900677652
+记忆量 13.900677652
+阿育王 10.0940151622
+网店 9.37888907493
+文武兼备 12.2912397395
+场圃 12.8020653633
+心壁 13.2075304714
+严君 13.2075304714
+分支行 10.3171587135
+波拉 11.7034530746
+宋江领 11.7034530746
+亏损累累 13.900677652
+阴清 13.900677652
+电插座 13.900677652
+三千多家 13.2075304714
+裕兴 12.5143832909
+罗浮宫 13.900677652
+车系 10.642581114
+细流 11.2616203224
+卡杰林娜 12.8020653633
+山高海 13.900677652
+面疙瘩 12.5143832909
+宾馆饭店 11.3357282945
+无可指责 11.9547675029
+放恣 13.2075304714
+有钱有势 10.2117981979
+贷了 12.2912397395
+败坏 8.57766767284
+北方方言 12.1089181827
+被治者 13.900677652
+吃喜糖 13.2075304714
+场址 12.8020653633
+山川险阻 13.2075304714
+氢氧基 13.900677652
+铣齿机 13.2075304714
+三河镇 10.4666904475
+观念性 12.8020653633
+突如其来 8.64318227995
+救护 8.89673134603
+耐碱 11.1280889297
+勒腰 13.900677652
+田虎 9.69598503258
+顾渚紫 12.8020653633
+忍辱求全 13.900677652
+鲁王监 12.2912397395
+控制流 13.2075304714
+砂浆 10.9562386728
+包层 12.2912397395
+近卫军 10.2371160058
+闭气 11.0103058941
+巴克尔 12.8020653633
+判断 5.78874958867
+活泼泼 11.598092559
+雪碧 11.4157710022
+恒星日 12.8020653633
+棉花团 12.8020653633
+过滤嘴 10.9049453784
+准备会 12.8020653633
+蓝筹股 7.31726842982
+知难行易 12.5143832909
+天开地辟 12.5143832909
+演奏家 10.0505300503
+左前 12.8020653633
+寄件人 13.2075304714
+束手无策 9.12155415886
+横贯东西 10.0940151622
+塞纳省 13.2075304714
+狗拿耗子 13.2075304714
+穿孔机 13.2075304714
+尾音 10.9049453784
+常衮 12.5143832909
+熏风 12.1089181827
+包封 12.1089181827
+脑力劳动 9.98865464655
+色标 12.8020653633
+灶头 12.2912397395
+吴子 10.3743171274
+风物长宜放眼量 13.2075304714
+卜甲 12.8020653633
+耐磨 9.20932976975
+时运不济 11.7034530746
+噗嗤一声 13.900677652
+江南西 10.9562386728
+色样 12.5143832909
+王司马 11.1280889297
+姜片 11.1926274509
+浪得虚名 11.9547675029
+一下一下 9.98865464655
+和婉 12.2912397395
+习染 13.2075304714
+奉陪 10.1871055853
+舌咽神经 12.8020653633
+聆音察理 13.900677652
+注册表 13.900677652
+过滤器 10.0088573539
+总而言之 9.5186510173
+黑风 11.1926274509
+难容 11.1926274509
+廖大亨 13.900677652
+宝云龙 13.2075304714
+朱砂根 13.2075304714
+电子商城 13.900677652
+音耗 12.2912397395
+挺舒服 12.2912397395
+扣除 7.75649201785
+车盘岭 13.2075304714
+瓢泼 11.598092559
+洋葱 9.66657114738
+光谱测量 13.2075304714
+状况 5.87483430782
+山高水 11.9547675029
+薛林 12.1089181827
+连皇后 13.900677652
+曹羲 12.8020653633
+此致 12.2912397395
+舒希纳 13.2075304714
+控制法 12.5143832909
+同伦群 12.1089181827
+判案 11.8212361103
+忠臣孝子 11.598092559
+包工 11.2616203224
+日月山 10.5684731418
+撞了人 13.2075304714
+狮子口 12.5143832909
+史潘庆 13.2075304714
+难守 11.3357282945
+每到一地 11.0103058941
+匮缺 13.2075304714
+包巾 11.7034530746
+隋义宁 13.2075304714
+王铁牛 12.5143832909
+齐顷公 13.2075304714
+车灯 9.89334446674
+斯坦顿 12.8020653633
+马士英 8.19689517732
+迥然有异 12.5143832909
+难寻 10.2897597393
+人生地不熟 10.604840786
+沉舟 12.2912397395
+孟达 10.0088573539
+之火 9.94943393339
+故态 13.900677652
+依稀记得 11.5027823792
+摹印 13.2075304714
+放慢 8.5488195185
+塔瓦萨 13.900677652
+之灾 10.0720362555
+哮喘病 10.765183436
+关系暧昧 11.8212361103
+纯正无邪 13.900677652
+伪装成 10.6818018271
+普尔顿 11.9547675029
+何至于 10.3171587135
+常见 6.32304381937
+毒龙 12.2912397395
+常规 7.32839510928
+同道中人 12.2912397395
+杉山 12.8020653633
+钻地 12.2912397395
+射门得分 11.7034530746
+不知羞耻 12.2912397395
+库腊加 13.2075304714
+历历可见 12.2912397395
+地方病 11.4157710022
+生平事迹 10.7226238216
+节行 12.5143832909
+噙齿戴发 13.900677652
+附籍 12.2912397395
+鲜艳夺目 11.4157710022
+湖北省物价局 12.5143832909
+涤除 12.8020653633
+科钦 11.7034530746
+胡老爷 12.8020653633
+马努金 13.2075304714
+负面性 12.2912397395
+为害 8.40761620864
+连白帆 12.8020653633
+韦乌卢 13.900677652
+雅尔塔 10.1630080337
+皋落 13.2075304714
+尹陈文 12.8020653633
+秋苗 13.2075304714
+姨丈 13.2075304714
+为官 8.90346537821
+长信侯 12.2912397395
+樊树志 12.1089181827
+弄鬼掉猴 13.900677652
+中央商务区 12.8020653633
+秉钧 13.2075304714
+微量元素 9.01787572939
+古来稀 13.2075304714
+无神论 9.98865464655
+炼狱 10.9049453784
+沙性母 13.900677652
+廖永忠 12.5143832909
+封国时 13.2075304714
+伏尔特 13.2075304714
+保险产品 9.44633035572
+法尤姆 12.5143832909
+雅高 13.900677652
+诬蔑 10.0505300503
+群体性 10.2897597393
+难学 12.5143832909
+烂污 12.1089181827
+利索 9.30555780184
+进位制 12.1089181827
+状元 8.71889410168
+某种理由 13.900677652
+理科大学 13.2075304714
+高速行驶 10.2630914922
+饮食店 10.7226238216
+高压氧 11.2616203224
+难字 12.8020653633
+菏泽市 11.3357282945
+一个二十五岁 12.8020653633
+洪脉 13.2075304714
+勃朗峰 11.0103058941
+女作家 10.4994802703
+洁净 8.9102450652
+风仪 12.8020653633
+起旱 13.2075304714
+那春娇 13.900677652
+洪英 13.2075304714
+脱缰之马 13.2075304714
+炼焦 9.58318953844
+月落乌啼 13.900677652
+责任书 11.2616203224
+言慧珠 12.5143832909
+奶油 9.58318953844
+国破家亡 10.4041700905
+表达思想 11.8212361103
+表同情 13.900677652
+姜粉 13.2075304714
+李开复 9.32596667347
+哈茨山 13.900677652
+吴广义 13.2075304714
+塔利亚 12.8020653633
+修习 10.7226238216
+冻港 13.900677652
+汪大人 12.2912397395
+修书 10.0720362555
+不成敬意 11.5027823792
+汁液 9.5186510173
+深藏 9.40086798165
+牧犬 13.900677652
+波尔加 13.900677652
+姜糖 13.900677652
+八字步 11.3357282945
+交通中枢 12.5143832909
+一个一尺 13.2075304714
+黑驴 9.05649056552
+鹅黄 10.604840786
+港口城市 9.12999302751
+耐穿 11.7034530746
+奢淫 12.8020653633
+吴广为 12.2912397395
+修业 12.2912397395
+井喷式 10.6818018271
+和声 9.31571017331
+放射性物质 9.66657114738
+长进 9.69598503258
+醉醺醺 10.642581114
+鸣声 9.80633308975
+黑马 8.75901409547
+原来如此 9.65218240993
+幽然 12.2912397395
+瓦格纳 9.93038573842
+叶榆泽 12.8020653633
+映射 9.87532596124
+魏州至 13.2075304714
+十六块 12.2912397395
+氯硅烷 13.900677652
+值得一提 10.4666904475
+裕华 9.98865464655
+车组 12.5143832909
+南洋群岛 10.9562386728
+访问演出 11.5027823792
+谋出路 13.900677652
+慌慌忙忙 11.5027823792
+巢群 13.2075304714
+云来雾 11.9547675029
+扣门 11.3357282945
+利益输送 9.30555780184
+生宇 11.9547675029
+毒鱼 12.2912397395
+安徽省委 13.900677652
+巴克希 13.2075304714
+浮游动物 9.96885201925
+狡狯 10.642581114
+修仙 10.7226238216
+难堪 8.52539924429
+越雷池一步 12.1089181827
+吴侯乃 13.2075304714
+银和金 13.2075304714
+双颌前突 13.900677652
+长运 11.9547675029
+饶命 9.80633308975
+忍辱负重 10.7226238216
+正统派 10.2630914922
+习文 12.1089181827
+笨头笨脑 13.2075304714
+之王 8.78868986362
+床围 13.2075304714
+常言 10.7226238216
+苦辛 13.2075304714
+回民区 13.2075304714
+松潘北 13.2075304714
+滚回去 11.5027823792
+嫣然 11.4157710022
+农民房 13.900677652
+主题词 12.5143832909
+洁具 12.2912397395
+远光灯 12.8020653633
+言古体 12.8020653633
+包干 11.598092559
+加斯普 13.2075304714
+九百九十九 13.900677652
+商军 13.900677652
+雪竹 12.2912397395
+垫支 12.2912397395
+宋江驱 13.2075304714
+革命理想 12.1089181827
+责任人 9.5186510173
+拜祝 13.2075304714
+梁御史 13.2075304714
+梅尧臣 11.0103058941
+想儿 13.900677652
+任导 13.2075304714
+修井 13.2075304714
+诱惑力 9.91169360541
+张国立 10.1871055853
+南东东 12.1089181827
+舞姿 10.3171587135
+绩效评价 11.8212361103
+递归 9.75754292558
+葫芦科 10.9049453784
+含油率 10.4349417492
+二拇指 11.598092559
+掌宿卫 12.5143832909
+得意洋洋 9.91169360541
+亨利 8.62767809341
+边界层 10.1164880181
+除草醚 13.2075304714
+贝克将军 13.900677652
+后湖 11.2616203224
+蝗莺 13.900677652
+一个一岁 12.8020653633
+洛阳桥 11.8212361103
+废墟 8.44963919841
+市场份额 7.60910851242
+水绕城 13.2075304714
+聚散无常 13.2075304714
+犄角之势 11.9547675029
+点读机 13.900677652
+帕特里 13.900677652
+焚毁 8.82550383674
+中央电视台文艺中心 13.2075304714
+嘲弄 9.75754292558
+之爱 10.765183436
+李道豫 13.900677652
+常设 8.95903522937
+之父 8.40350942668
+常讲 11.598092559
+罗伊德 12.5143832909
+女貌郎才 13.2075304714
+洋行 8.7245279194
+中央处理器 10.3453295905
+柴发利 13.2075304714
+教学赛 13.900677652
+茹太素 13.900677652
+王毓瑚 12.5143832909
+一千多度 13.900677652
+场合 7.14026296089
+掩膜 13.2075304714
+贮藏室 11.8212361103
+明争暗斗 10.4994802703
+华西村 10.8561552143
+附加物 13.900677652
+天津海关 13.2075304714
+马赛港 11.5027823792
+门生故旧 11.1926274509
+利纳斯 13.2075304714
+万多枚 12.8020653633
+难如 11.9547675029
+焦立 13.2075304714
+堆石坝 11.598092559
+风俗 7.75220935606
+潞城县 12.5143832909
+出口处 10.1164880181
+念一念 11.4157710022
+洪莹 12.8020653633
+地方矿 13.900677652
+掉下去 9.75754292558
+隐匿性 11.0103058941
+铳子 11.9547675029
+网巾 10.9049453784
+托人情 12.8020653633
+义风 12.8020653633
+在发言中 10.7226238216
+丘逢甲 11.7034530746
+阿尔基洛 12.8020653633
+常说 8.70218062071
+狡猾 8.89004235788
+民生问题 9.84023464143
+难两全 13.900677652
+勒芒 13.2075304714
+三百四十万镑 13.2075304714
+附约 11.1926274509
+自主经营权 13.2075304714
+前藏 11.598092559
+何徽临 13.2075304714
+常识 8.27666014579
+一条藤儿 12.8020653633
+田边地头 13.2075304714
+消旋天线 13.2075304714
+描述符 10.8096351986
+芝麻绿豆 11.5027823792
+黄土背 12.2912397395
+赴台湾 11.7034530746
+气绝身亡 12.8020653633
+芒康县 11.9547675029
+一段话 9.5186510173
+涝灾 11.598092559
+那道婆 13.2075304714
+宋江闻 11.8212361103
+遗毒 12.8020653633
+搭话 9.89334446674
+音节 9.25628675283
+十几包 13.2075304714
+帕日格 11.7034530746
+反攻为守 13.900677652
+修修 11.5027823792
+面朝天 13.900677652
+一言中的 13.2075304714
+有建昌 13.900677652
+车缝 13.2075304714
+洪荒 11.1926274509
+摹写 11.5027823792
+放掉 10.9049453784
+汁水 10.9049453784
+买下来 10.3453295905
+硕果累累 11.598092559
+难处 8.81308131674
+封头 12.5143832909
+张宗子 12.1089181827
+出铁 12.5143832909
+贯彻执行 9.85762638414
+风传 10.3171587135
+韩侯岭 12.5143832909
+吴广便 13.2075304714
+汤夫人 9.58318953844
+根状茎 9.72629038208
+何缘 12.8020653633
+杨诚 7.49050277001
+扣针 12.8020653633
+墓志铭 10.3171587135
+资质 8.16733637508
+无礼地 13.2075304714
+流动债务 13.900677652
+资财 10.1394775363
+放浪 10.765183436
+搭讪 9.75754292558
+八千户 13.2075304714
+看球赛 13.900677652
+被囊动物 13.900677652
+放映机 11.3357282945
+霸道 9.75754292558
+搭设 12.1089181827
+洪范 11.1926274509
+孙张鲁 13.2075304714
+钓竿 11.3357282945
+聚四氟乙烯 10.7226238216
+宋江问 11.2616203224
+放水 9.69598503258
+辩解者 13.900677652
+青史流芳 13.2075304714
+二十五两 12.5143832909
+西洱河 11.4157710022
+何炳松 13.2075304714
+鲁晓夫 13.2075304714
+斜角 11.4157710022
+簿子 11.9547675029
+密封性 11.7034530746
+松山一 13.900677652
+抗血栓 12.5143832909
+鲁才全 11.5027823792
+大专学生 13.900677652
+孙朝用 13.2075304714
+无赦 11.598092559
+孙毓筠 12.5143832909
+放气 12.1089181827
+二十五万 11.1280889297
+音质 10.1394775363
+老岳 11.9547675029
+百草园 13.2075304714
+至言 13.900677652
+杜伯 12.8020653633
+网上银行 8.92394390956
+悬铃木 11.5027823792
+雪球 11.1926274509
+儿茶素 12.5143832909
+姜狗 11.2616203224
+罗戈 13.900677652
+南巡讲话 12.8020653633
+水准测量 10.8096351986
+山西省 7.85330547293
+言谈之间 12.5143832909
+减肥网 13.900677652
+林甸县 13.900677652
+公乃汉 12.2912397395
+递出 11.598092559
+较劲儿 12.5143832909
+戊戌维新运动 11.5027823792
+王锡阐 11.2616203224
+雅静 10.8096351986
+湖中 8.33615724465
+一百六十一吨 13.2075304714
+一段落 12.5143832909
+宣景琳 13.900677652
+科蛙属 11.9547675029
+小喇叭 12.1089181827
+重庆版 13.2075304714
+迥然有别 12.1089181827
+狮子座 10.765183436
+交战团体 12.8020653633
+初始密码 13.900677652
+争取和平 10.765183436
+无铅化 13.900677652
+递减 8.29120585679
+场子 9.45802639549
+水校尉 11.598092559
+穷书生 13.2075304714
+黑钱 11.7034530746
+放油 12.1089181827
+硬度计 13.2075304714
+加说 13.2075304714
+雷横执 13.900677652
+橡胶件 13.2075304714
+裙装 11.4157710022
+揭下 11.4157710022
+戚庄田 12.8020653633
+绷着脸儿 12.8020653633
+曹爽 10.4041700905
+非税 11.598092559
+揭东 13.900677652
+宾尼 13.2075304714
+败家 10.9562386728
+二十五亩 13.2075304714
+扬幡招魂 13.900677652
+华商候 13.2075304714
+音信杳然 13.2075304714
+可管理性 13.900677652
+小剧场 11.0674643079
+处级 10.2897597393
+捞一把 11.1926274509
+裙裤 13.900677652
+沉迷 10.3453295905
+美国签证 13.900677652
+未定义 12.8020653633
+混杂着 10.604840786
+组织培养 10.604840786
+封国梁 12.8020653633
+穆修 12.5143832909
+敏感期 10.642581114
+万事如意 11.5027823792
+确保安全 10.4666904475
+饶宗 12.1089181827
+狗肉 9.87532596124
+前话 12.2912397395
+精液量 12.1089181827
+梅雨季 12.8020653633
+放流 11.7034530746
+建筑造型 12.2912397395
+蜘蛛侠 13.900677652
+庸材 13.2075304714
+梁山泊 7.97108850859
+噎膈 12.1089181827
+独立精神 12.8020653633
+麻纺织 11.0674643079
+鄂罗罗 13.900677652
+陈伯华 12.8020653633
+下半身 10.604840786
+挟恨 13.900677652
+损益表 11.5027823792
+黑铁 11.8212361103
+郁郁苍苍 11.4157710022
+癫子 12.2912397395
+黑铅 13.2075304714
+小娃儿 11.598092559
+雅韵 13.900677652
+鱼亚纲 10.9049453784
+平均工资 9.74179456862
+穆侯 13.900677652
+办公会议 11.7034530746
+任右仆 13.2075304714
+谢玄加 13.2075304714
+白英子 11.0674643079
+晃眼 11.5027823792
+两百余起 13.2075304714
+杜丝 12.8020653633
+雅阁 10.1630080337
+文化教育界 11.598092559
+反法西斯 8.9308643524
+竞争能力 8.99540287354
+任周瑜 13.2075304714
+黑娃瞅 12.1089181827
+隔热性 11.9547675029
+音调 9.18217878068
+莫斯科中山大学 11.1926274509
+耐用 9.12999302751
+松潘县 11.598092559
+遗教 12.5143832909
+严复 9.72629038208
+曹王 12.8020653633
+严处 12.5143832909
+短讯 13.2075304714
+杜丽 10.4041700905
+饶富 12.8020653633
+诸乐调 13.900677652
+字表 11.9547675029
+亿日元 9.63799777493
+放洋 12.2912397395
+黑锅 10.6818018271
+说句话 9.5186510173
+短评 11.598092559
+杜乔 13.2075304714
+雅隆 12.2912397395
+色斑 10.4666904475
+斯率军 13.900677652
+研究会 8.39128931535
+接待工作 11.3357282945
+色料 12.2912397395
+病防治 12.8020653633
+精密性 13.2075304714
+短诗 10.604840786
+扫描机 13.2075304714
+处罚 7.35820569147
+教工宿舍 13.900677652
+黄旗招 13.2075304714
+之类 6.94890548758
+曾统兵 12.8020653633
+雨珠 12.5143832909
+还我河山 12.1089181827
+深蕴 13.900677652
+处置 7.1072115194
+七窍生烟 11.2616203224
+家徒四壁 11.7034530746
+蜘蛛丝 11.1280889297
+短语 11.2616203224
+神鹿 12.2912397395
+一团和气 11.3357282945
+杜书 13.2075304714
+大自然 8.10461990121
+托梅斯 12.8020653633
+秽乱 13.2075304714
+附点 13.900677652
+九十九条 12.8020653633
+脉幅调制 13.900677652
+网友 6.61654284578
+莱温斯基 13.900677652
+中苏关系 11.4157710022
+白米饭 11.7034530746
+梁启雄 13.2075304714
+迷了眼 11.598092559
+马边河 12.5143832909
+遗族 11.2616203224
+非笑 13.2075304714
+单相思 11.5027823792
+杜亚 12.5143832909
+大苦 11.9547675029
+飞利浦公司 11.9547675029
+课外读物 12.1089181827
+有何高见 10.5684731418
+唐加勒 13.2075304714
+哭成 10.765183436
+变异型 12.8020653633
+季婷婷 10.0088573539
+索格底 12.8020653633
+柔性版 13.900677652
+洗不清 11.0674643079
+国际航运 10.0294766411
+包公 10.8096351986
+洋装 11.1926274509
+拿薪水 13.900677652
+一般般 12.8020653633
+楔子 11.0674643079
+哪一首 12.8020653633
+何炳林 13.2075304714
+乐美之 13.2075304714
+繁华似锦 12.8020653633
+嘎然 13.2075304714
+包养 11.1926274509
+色散 9.7898037878
+抑菌剂 13.2075304714
+知性 10.8096351986
+茅之田 13.2075304714
+遗文 10.533381822
+惊叹号 10.8561552143
+总负责人 11.9547675029
+丁是丁 12.1089181827
+炭化作用 12.8020653633
+舅舅 8.26946587015
+相关系数 10.8096351986
+雅集 10.9562386728
+侯马市 11.9547675029
+林索登 13.2075304714
+网卡 13.900677652
+秉风 13.900677652
+年收入 9.20932976975
+黑门 11.9547675029
+加训 13.900677652
+放淤 11.9547675029
+饮用 8.35941410682
+闹意气 12.8020653633
+杜仲 9.09665660724
+单稳态 13.2075304714
+知名之士 12.5143832909
+吴牛喘月 13.900677652
+袁彭 12.8020653633
+控制性 10.8561552143
+疾恶如仇 12.1089181827
+八十九条 12.8020653633
+枝叶扶疏 12.1089181827
+鲁邦多 13.900677652
+半导体技术 12.8020653633
+五味俱全 11.9547675029
+题辞 12.8020653633
+操作能力 12.1089181827
+法国航空公司 11.9547675029
+网协 13.900677652
+吓死 9.5062284973
+雨点 9.55687223012
+船桨 10.9049453784
+手握手 13.900677652
+小蝌蚪 11.3357282945
+性骨折 12.1089181827
+解劳 13.2075304714
+澳门元 12.8020653633
+非洲狮 13.2075304714
+鸣咽 13.900677652
+短袜 13.2075304714
+白里透红 11.598092559
+心跳声 11.1926274509
+信使 9.54396882529
+喻上猷 10.4666904475
+为名 7.95787827685
+邻村 10.0294766411
+为之一振 10.1871055853
+孜孜以求 11.1280889297
+留底 13.900677652
+电话设备 13.2075304714
+肇基 11.8212361103
+逆取顺守 13.2075304714
+半殖民地 9.06439574502
+九曲回肠 11.7034530746
+场外 8.39941944143
+山核桃树 13.900677652
+官价 10.9562386728
+短装 12.1089181827
+官事 10.9562386728
+教练员 10.2371160058
+帮帮忙 10.4349417492
+黑陶 10.9049453784
+之罪 8.46695564842
+勒达 12.8020653633
+独山 10.1164880181
+景仁宫 10.2630914922
+清政府 7.28998160726
+包办 9.80633308975
+数罪并罚 10.3743171274
+料峭 11.9547675029
+集会结社 13.2075304714
+短裙 10.4349417492
+视频录像 12.5143832909
+短裤 9.5062284973
+狮子岩 12.1089181827
+鸣响 10.4041700905
+官亭 11.1926274509
+末日来临 12.5143832909
+递变 11.1926274509
+苦荞 12.8020653633
+包兰 10.3743171274
+官人 8.80692745117
+义门 10.765183436
+进德修业 13.900677652
+音轨 13.2075304714
+都城远 13.2075304714
+信众 11.7034530746
+箭如雨下 12.8020653633
+陆强 13.900677652
+母亲节 12.1089181827
+色晕 12.8020653633
+宇文觉幼 12.8020653633
+边界值 12.5143832909
+丙烯酸酯 11.0674643079
+宋江阵 10.6818018271
+卸下来 10.4666904475
+暂行办法 9.27570483869
+大卫王 12.5143832909
+武定门 13.2075304714
+难听 9.13850371718
+鲁本辛 13.900677652
+毛发耸然 13.900677652
+老面子 12.5143832909
+菜市口 10.8096351986
+现场实验 13.900677652
+丰南县 13.900677652
+果蔬汁 11.8212361103
+登峰造极 10.4349417492
+暨南 12.8020653633
+和合 11.2616203224
+巴克利 11.8212361103
+灶坑 13.2075304714
+儒将 12.1089181827
+印模 12.2912397395
+地方税 11.7034530746
+夏威夷群 12.8020653633
+驻有 10.4041700905
+难吃 10.8096351986
+狮子山 10.9562386728
+好住 13.2075304714
+吃饭时间 10.4994802703
+新奇特 13.900677652
+无事生非 11.2616203224
+汾阳 10.0720362555
+站房 11.9547675029
+蹬技 11.9547675029
+金国 9.45802639549
+赞叹不止 12.5143832909
+一千份 12.1089181827
+雪盲 12.8020653633
+贷款额 10.3453295905
+高档商品 11.8212361103
+靖国神社 12.1089181827
+赵庞 12.8020653633
+丢失 8.35160156708
+晋承魏 12.8020653633
+招华商 13.2075304714
+放满 11.2616203224
+黑雪 12.8020653633
+廿七日 13.2075304714
+大陆同胞 13.2075304714
+首阳山 11.7034530746
+牙鲆 12.8020653633
+心态平衡 12.8020653633
+短衣 10.533381822
+前行 8.12923652885
+苦菜 12.8020653633
+连爬带滚 13.900677652
+短衫 11.0103058941
+死对头 10.1630080337
+拉德雷 12.1089181827
+递升 11.3357282945
+吃面 10.6818018271
+雅间 11.9547675029
+封鲁郡 13.2075304714
+车牌 9.75754292558
+嫁了人 12.1089181827
+高叶密 13.2075304714
+亲核反应 12.5143832909
+协调 6.4939669218
+借古讽今 11.7034530746
+诬诋 13.900677652
+克尔盒 13.2075304714
+孟庆元 13.2075304714
+递加 13.2075304714
+和善 9.71102290995
+多海里 13.900677652
+官修 9.82314020807
+难喝 11.8212361103
+火筷子 12.8020653633
+信义 10.1630080337
+硬质合金 10.7226238216
+官俸 11.9547675029
+洪迈 11.1926274509
+肇因 13.2075304714
+黑霉 13.2075304714
+耐看 11.598092559
+地鳖虫 13.900677652
+包叶 13.2075304714
+梁始 13.2075304714
+倒进去 12.1089181827
+哈萨河 13.2075304714
+演奏员 11.5027823792
+短视 10.642581114
+短见 11.1926274509
+现出原形 12.1089181827
+课题组 10.533381822
+为啥 8.170577869
+信个 13.900677652
+信中 8.68574189437
+苦艾 12.1089181827
+滤清器 11.3357282945
+信丰 13.2075304714
+黑面 10.2630914922
+奢想 12.5143832909
+为非作歹 10.3171587135
+焦皮 13.900677652
+判明 10.1871055853
+茄鲞 13.2075304714
+戴维孙 12.8020653633
+黑青 11.9547675029
+炸坏 10.9049453784
+陆运费 13.2075304714
+脸部皮肤 12.8020653633
+信上 9.71102290995
+推波助澜 9.25628675283
+包厢 10.8561552143
+陆心 11.7034530746
+包去 12.8020653633
+科维利 13.900677652
+砍下去 11.5027823792
+朴次茅斯 10.9049453784
+必有路 13.2075304714
+朱孝天 13.900677652
+鱼丸汤 13.900677652
+不依不饶 10.4041700905
+之约 10.642581114
+正统性 12.8020653633
+官位 9.5186510173
+许如错 13.2075304714
+危殆 10.8561552143
+网儿 13.2075304714
+严宽 13.2075304714
+信仰 7.25819085061
+信件 8.83808261895
+映出 10.0088573539
+信任 7.07630398193
+严家 9.96885201925
+瓦加斯 11.9547675029
+尾状核 13.2075304714
+克尔白 10.765183436
+中国工农红军 8.4284069783
+事务员 12.2912397395
+非礼 10.8096351986
+严守 9.44633035572
+皮拉 13.2075304714
+中国国民党 8.41588071849
+坎儿井 10.8561552143
+包儿 10.3453295905
+中心环节 10.5684731418
+一百架 13.900677652
+慌做一团 12.5143832909
+苦节 13.2075304714
+严实 9.87532596124
+作为 4.20040848195
+包卷 12.2912397395
+薛悌 13.2075304714
+分批操作 13.900677652
+扶老携幼 10.2630914922
+网关 11.9547675029
+洛浦 11.8212361103
+铁叶盘 12.8020653633
+蛀蚀 12.5143832909
+鸣啭 12.5143832909
+威远县 13.900677652
+包包 10.9562386728
+工商局长 12.8020653633
+扬州人 11.2616203224
+抒情诗 9.04864738806
+数字键 13.900677652
+苦苣 11.9547675029
+苦苦 8.44109213783
+严寺 12.1089181827
+波尔塔瓦 11.598092559
+汗马功劳 9.87532596124
+适者生存 10.5684731418
+炼糖 13.900677652
+洗车机 13.900677652
+灶君 11.5027823792
+不知颠倒 13.2075304714
+晶报讯 13.2075304714
+李典之 13.2075304714
+严密 7.61467955747
+网兜 11.3357282945
+金衣力士 13.2075304714
+拜特 12.2912397395
+趋向 7.92432674268
+彰化市 11.598092559
+元大都 10.2371160058
+包医 12.2912397395
+落叶乔木 9.55687223012
+前襟 10.2117981979
+严寒 8.2985588311
+南郑县 12.8020653633
+弄出来 10.4349417492
+毒雾 10.1871055853
+和转子 12.1089181827
+电信网 12.2912397395
+前身 7.56031834825
+色情 8.46259834305
+田阳县 13.2075304714
+场强 10.1630080337
+发大财 10.8096351986
+元戎 11.9547675029
+肺结核 9.80633308975
+难办 9.5062284973
+无数支 12.8020653633
+十几员 13.2075304714
+遗恨 10.8561552143
+黄金饰品 11.2616203224
+二日游 12.5143832909
+详细情况 9.48183704418
+杨老 12.8020653633
+一岗双责 12.8020653633
+益信 12.2912397395
+下定决心 9.17328983326
+雪灾 10.1630080337
+脱脂乳 13.900677652
+洋货 9.80633308975
+五谷不分 13.2075304714
+非统 13.2075304714
+权衡轻重 11.7034530746
+命中率 9.85762638414
+特别版 12.1089181827
+梁咏琪 12.8020653633
+劳维尔 13.900677652
+雪花儿 12.8020653633
+非经 10.642581114
+耐火 9.23723855786
+杨诚顿 13.2075304714
+办公用品 10.8561552143
+提花机 11.1926274509
+花花哨哨 12.5143832909
+内蒙古自治区 8.17709255002
+身价十倍 12.8020653633
+短训班 12.8020653633
+黑道 10.642581114
+膻气 11.8212361103
+超然独立 13.900677652
+烫平 13.2075304714
+商和周 13.2075304714
+玉台新 11.4157710022
+丢得 11.7034530746
+劈挂拳 13.2075304714
+常胜 9.49395840471
+史元杨 13.2075304714
+天福宫 12.8020653633
+收之桑榆 12.5143832909
+之神 8.81308131674
+棉花布 12.8020653633
+苋菜 10.8561552143
+巴尔干半岛 8.93783302172
+一头则 13.900677652
+历科 13.2075304714
+难到 11.7034530746
+标准答案 10.8096351986
+十几吨 12.1089181827
+处突 13.900677652
+是非 7.71036224612
+十数丈 12.8020653633
+饶平 12.8020653633
+焦煤 9.46986085313
+灶具 11.4157710022
+字距 13.900677652
+十数万 11.9547675029
+演奏厅 13.900677652
+玩笑话 10.4349417492
+海福元 12.5143832909
+肇兴 11.8212361103
+常考 13.900677652
+少于 8.55834340001
+益佰 11.0674643079
+黄水晶 13.2075304714
+十数个 9.62401153296
+任峻 13.2075304714
+十辈子 12.2912397395
+生物农药 13.900677652
+脉冲雷达 11.7034530746
+断墙残壁 12.5143832909
+走私船 12.2912397395
+刻画来 13.900677652
+为之一新 12.5143832909
+败得 11.3357282945
+杨肇 12.8020653633
+难分 10.2897597393
+奢望 9.31571017331
+势如累卵 12.5143832909
+巴布亚 10.4994802703
+包合 13.900677652
+听头 13.900677652
+不拘细节 13.900677652
+矫诏 10.642581114
+玩不转 12.1089181827
+包吃 13.2075304714
+米左右 7.73947033028
+组织液 11.1280889297
+附生 10.0720362555
+之称 6.76578680041
+耐烦 11.1926274509
+布瓦洛 11.598092559
+严峻 7.37271973435
+不够格 11.3357282945
+耐热 9.66657114738
+前蹄 10.4041700905
+诬谤 13.900677652
+丢开 9.66657114738
+混血种 13.2075304714
+包含 6.46170605958
+丢弃 9.54396882529
+之秋 10.7226238216
+鬣狗 10.4994802703
+演奏台 12.8020653633
+常聚 12.1089181827
+穗状 10.4666904475
+鱿鱼干 13.900677652
+白天黑夜 10.4041700905
+宋江遂 11.8212361103
+攻不下 13.900677652
+窗外事 12.2912397395
+公拆 13.900677652
+儒家 7.83922073305
+奉命惟谨 12.5143832909
+灭此朝食 13.900677652
+涯际 13.900677652
+张国焘 9.91169360541
+时局动荡 12.1089181827
+搭腔 10.0720362555
+五金店 12.1089181827
+油豆腐 12.1089181827
+第十二代 12.8020653633
+和县 9.37888907493
+前边 7.04316358943
+焦热 12.5143832909
+无敌号 12.2912397395
+状如 9.89334446674
+帧频 13.900677652
+行为不检 13.2075304714
+前辈 8.76487921493
+象眼 12.8020653633
+焦烂 13.900677652
+八十多个 12.5143832909
+藤原宣孝 13.900677652
+洪规 13.2075304714
+脊骨 11.1280889297
+山梨酸 12.2912397395
+鸣叫 9.56994431169
+焦炳 13.900677652
+严嵩 9.5186510173
+博克拉 12.2912397395
+黄尘清水 13.900677652
+焦点 6.83421068184
+尼尔斯 12.8020653633
+聚起来 12.1089181827
+佰草集 12.5143832909
+招商银行 7.62403416263
+益于 11.9547675029
+奏事官 12.8020653633
+前述 8.4801426527
+毛刷 11.9547675029
+字谜 11.3357282945
+趋势 5.31153596125
+焦炭 8.56795885871
+冬麦区 11.9547675029
+王备御 13.2075304714
+左下 12.5143832909
+六十根 13.900677652
+吴壮达 9.35738286971
+难受 7.71446902808
+闻得香 12.5143832909
+高风亮节 11.2616203224
+难友 10.9562386728
+毛刺 11.598092559
+可模仿 13.2075304714
+焦炉 11.2616203224
+日甚一日 11.5027823792
+前进 6.74294216773
+起飞前 11.8212361103
+葫芦状 11.9547675029
+上宝光 13.900677652
+母乳喂养 10.4041700905
+雪白 8.11378027061
+颈静脉 11.8212361103
+包商 13.2075304714
+焦灼 9.33632946051
+阿德勒 12.1089181827
+诬赖 12.1089181827
+何用尔 13.2075304714
+鸣哨 13.2075304714
+烫得 10.4349417492
+车用 10.1871055853
+像头 10.604840786
+楔形 9.7898037878
+贝亚特 13.2075304714
+优秀者 11.598092559
+幽兰 11.2616203224
+金之俊 10.7226238216
+放榜 11.598092559
+一千零六十六公里 13.2075304714
+布宜诺斯艾利斯省 12.1089181827
+液态空气 11.0674643079
+趋前 9.87532596124
+亲密合作 12.1089181827
+杨达波 13.2075304714
+斜进去 13.900677652
+曹真 9.82314020807
+组织法 10.0505300503
+厌战 12.2912397395
+化干戈为玉帛 11.9547675029
+本科文凭 13.2075304714
+前车 10.3743171274
+下炕 9.93038573842
+前转 12.8020653633
+益世 12.2912397395
+前轮 10.533381822
+相太师 11.5027823792
+炸出 11.1280889297
+前轴 11.0103058941
+儒学 8.73019365694
+益三 11.5027823792
+巡官 11.8212361103
+中正理工 13.900677652
+老少边穷 12.8020653633
+认知率 13.2075304714
+黑金 11.2616203224
+皮脂腺 10.4349417492
+和协 12.8020653633
+网坛 11.9547675029
+边全缘 12.8020653633
+明武宗 11.0103058941
+网址 8.51160592216
+精神头儿 11.7034530746
+和卓 10.8561552143
+黑釉 11.1280889297
+遗憾 7.57452817882
+庞德曾 13.2075304714
+罗庞岭 13.2075304714
+递呈 12.1089181827
+判据 10.8096351986
+李员外 13.2075304714
+专业人士 8.7245279194
+包囊 11.9547675029
+抗血清 12.5143832909
+同济医科大学 13.900677652
+勒诺 11.9547675029
+矽肺 13.2075304714
+灶台 10.533381822
+双崖集 12.8020653633
+掩袭 12.8020653633
+戴云山 11.8212361103
+做些 8.56795885871
+炸到 12.8020653633
+王翊铭 13.2075304714
+儒墨 12.2912397395
+色拉 11.5027823792
+车皮 11.3357282945
+白鸣鹤 11.3357282945
+刚出去 11.4157710022
+泼尼松 11.9547675029
+疲劳 7.62591563073
+市图书馆 12.5143832909
+湖南医科大学 13.2075304714
+六十步 12.8020653633
+情海 13.2075304714
+做人 8.40761620864
+市场总监 10.2630914922
+包围 7.15191810448
+交通管制 9.93038573842
+做亲 12.8020653633
+绞肉机 11.8212361103
+任神职 13.900677652
+名声不好 11.3357282945
+王城分 13.2075304714
+杨艳 13.2075304714
+耐特 13.2075304714
+仰首朝 13.900677652
+夹起尾巴 12.1089181827
+隔热板 12.2912397395
+现场采访 11.1926274509
+粟宗华 13.2075304714
+但荣禄 13.900677652
+卡斐尔 11.7034530746
+定业 13.2075304714
+丰田公司 13.2075304714
+疲困 10.8096351986
+素朴 12.1089181827
+数不上 13.900677652
+儒士 10.2117981979
+脲酶 12.8020653633
+算术题 12.8020653633
+车盖 11.8212361103
+深赛格 9.94943393339
+热热闹闹 9.91169360541
+剔得 13.900677652
+张昭奏 12.8020653633
+诈术 12.8020653633
+定为 7.60725837313
+巴克图 11.1926274509
+田初依 13.2075304714
+雪片 9.96885201925
+毒针 13.2075304714
+学科专业 11.8212361103
+从先秦 11.4157710022
+做上 11.2616203224
+杨芳 11.598092559
+杨花 11.7034530746
+控制杆 11.598092559
+姜琛 12.5143832909
+附着 8.39128931535
+脲醛 12.5143832909
+做东 11.1280889297
+波尔多液 12.1089181827
+饮牛 11.7034530746
+豪华酒店 11.4157710022
+网吧 9.91169360541
+五盘 12.8020653633
+八百两 11.7034530746
+科德尔 12.1089181827
+尤佐夫 13.900677652
+凯鲁万 12.8020653633
+十六门 13.900677652
+浅水滩 12.5143832909
+夏王廷 13.2075304714
+做个 7.61281909181
+波尔吉 13.2075304714
+汾酒 10.4041700905
+丁大全 13.900677652
+同性相斥 12.1089181827
+田刚一 13.2075304714
+附睾 10.2630914922
+三千多元 13.2075304714
+和御营 12.1089181827
+龙邹润 12.8020653633
+良心话 11.0674643079
+控制板 12.8020653633
+做为 9.58318953844
+做主 8.51618258919
+秦开袭 12.8020653633
+八百万 10.9562386728
+定价 6.62758505598
+网名 11.3357282945
+技术升级 10.0505300503
+字迹 8.96620371885
+淳于丹 13.2075304714
+光怪陆离 10.3453295905
+那木梁 13.2075304714
+定于 8.15128466607
+船梢 11.7034530746
+伊朗队 13.900677652
+开普省 11.598092559
+金学台 11.8212361103
+姜瑜 12.5143832909
+第七次 9.27570483869
+邻接 9.22784881751
+舞榭歌楼 13.900677652
+行己有耻 13.2075304714
+音读 12.5143832909
+非导体 13.900677652
+非类 13.900677652
+卫师 13.900677652
+分兵把守 12.8020653633
+幽光 11.4157710022
+重印本 12.5143832909
+定产 12.8020653633
+测试人员 13.900677652
+控制机 12.5143832909
+离退休金 13.2075304714
+杨苏 13.900677652
+定人 13.900677652
+透热疗法 13.900677652
+分配模式 13.900677652
+深刻印象 9.62401153296
+定亲 10.642581114
+定位 6.9431802811
+重山峻岭 12.8020653633
+红河县 12.8020653633
+战果 8.83808261895
+放款 9.5062284973
+段文昌 13.900677652
+连皇帝 12.1089181827
+宋天子 12.8020653633
+泽罗斯 13.900677652
+弦乐器 10.2630914922
+鸣冤 11.1926274509
+文字改革 10.5684731418
+明太宗 12.5143832909
+习水 12.5143832909
+山之东 13.2075304714
+教育规划 12.2912397395
+圣克鲁斯 11.7034530746
+十六里 13.2075304714
+草檄 13.900677652
+难写 13.2075304714
+败将 10.7226238216
+英国上议院 12.8020653633
+山之主 12.8020653633
+习气 9.71102290995
+杨茂 13.2075304714
+字词 12.1089181827
+饶州 11.0674643079
+难出 11.4157710022
+滑雪鞋 13.900677652
+晶态 10.7226238216
+便宜从事 12.2912397395
+附加税 11.0103058941
+前路 9.94943393339
+由瑞利 13.2075304714
+穿插着 12.5143832909
+鸣凤 11.7034530746
+杨荫 12.5143832909
+撇嘴 10.2117981979
+短跑 10.7226238216
+定会 9.56994431169
+短距 10.0088573539
+杨荣 10.4994802703
+密封条 11.5027823792
+乘风破浪 11.1280889297
+醉酒者 12.8020653633
+南漳县 13.900677652
+中西文化 10.8096351986
+幽冥 9.96885201925
+为先 9.44633035572
+场屋 12.5143832909
+陇西 8.93783302172
+短路 10.2117981979
+焚掠 11.1926274509
+败局 10.0294766411
+雨痕 13.900677652
+放歌 12.8020653633
+莘县 13.2075304714
+斯罗普 13.900677652
+发报机 11.3357282945
+判成 12.2912397395
+腰鼓队 12.2912397395
+前贤 11.7034530746
+狐狸尾巴 11.7034530746
+形迹可疑 11.2616203224
+杨武陵 12.1089181827
+低质量 12.1089181827
+三级跳远 12.1089181827
+流水无情 12.8020653633
+告别仪式 11.0103058941
+氯化苄 11.8212361103
+鱼亚科 11.0674643079
+亿里拉 13.900677652
+弄潮儿 11.598092559
+秦海璐 12.8020653633
+陈伯吹 12.1089181827
+空瘪 12.8020653633
+克尔特 10.1164880181
+严律 13.900677652
+昨天上午 8.89004235788
+胡国华 9.5062284973
+压力容器 10.8561552143
+打头风 13.900677652
+北军兵 13.2075304714
+十六铺 11.7034530746
+之窗 11.0103058941
+北京航天 13.2075304714
+做伴 9.80633308975
+第八十 13.900677652
+定例 10.642581114
+留待 9.96885201925
+克利科 13.2075304714
+包圆 12.8020653633
+丛樱 12.8020653633
+厌恨 11.8212361103
+做作 10.0294766411
+形容词 10.0088573539
+梁有誉 12.5143832909
+全打 12.2912397395
+曼青 13.2075304714
+烟销灰灭 13.900677652
+丁家花园 12.8020653633
+安置费 12.8020653633
+汉三公 13.2075304714
+八百余 11.0674643079
+年终奖 11.3357282945
+于苻坚 12.8020653633
+剥皮抽筋 13.900677652
+马赛曲 11.3357282945
+拜登 12.1089181827
+波多黎各 10.1164880181
+裙边 11.3357282945
+安天命 13.2075304714
+锻压设备 11.9547675029
+难免 7.40995411747
+彭士量 12.8020653633
+包场 11.3357282945
+狮子头 11.3357282945
+约定俗成 10.0505300503
+审美眼光 13.900677652
+驻扎 7.57811241205
+叶掌状 12.8020653633
+风磨 13.2075304714
+土壤胶体 12.2912397395
+拉后腿 13.2075304714
+封得 11.1926274509
+疲沓 12.5143832909
+官书 11.3357282945
+环境质量 10.533381822
+映像 11.4157710022
+暂停 7.59622884955
+衣长 12.8020653633
+地面信号 13.900677652
+桃谷六仙 13.900677652
+遗属 11.4157710022
+第四组 12.5143832909
+布瓦凯 13.900677652
+管理网络 13.900677652
+降妖捉怪 13.2075304714
+巴尔纳斯 13.2075304714
+宦海 11.1926274509
+大又圆 11.9547675029
+胡缠 11.5027823792
+依靠人民 11.1280889297
+缘簿 13.2075304714
+所误 11.3357282945
+阿瓦提县 12.1089181827
+手脚 7.87239913175
+王明里 13.2075304714
+烫手 10.0505300503
+信用 6.73363977506
+吴天 11.0103058941
+衣锦 12.5143832909
+鲸须 13.2075304714
+维拉港 12.5143832909
+记录员 11.9547675029
+遗少 13.900677652
+佛教界 11.9547675029
+交城县 12.8020653633
+维维集团 13.900677652
+汝知之 12.8020653633
+南美洲 8.01735526349
+冠军赛 11.0103058941
+丢掉 8.77671367257
+巴师夏 11.7034530746
+苦瓜脸 12.5143832909
+近地点 11.1280889297
+第四纪 7.96843246453
+洋话 11.7034530746
+手腕 8.46695564842
+遗尿 10.4666904475
+北京大学法律系 12.8020653633
+理财专家 10.1871055853
+北方话 11.8212361103
+边后卫 13.900677652
+修心养性 13.900677652
+色层 12.1089181827
+穿孔卡 12.5143832909
+协作单位 13.2075304714
+五月节 12.2912397395
+周阿六 11.8212361103
+书套 13.900677652
+挂钟 11.7034530746
+厌弃 10.765183436
+酿皮子 13.2075304714
+无性系 12.8020653633
+五月花 11.7034530746
+廖藜壑 13.2075304714
+吴茶情 13.2075304714
+贾鲁 11.9547675029
+禽流感 11.3357282945
+印欧 9.75754292558
+汤色橙 13.2075304714
+严惩 8.83177344976
+莘氏 12.8020653633
+诺夫哥罗德 10.765183436
+官理 10.9562386728
+朴子溪 13.900677652
+窦纳乐 13.2075304714
+耽搁到 12.1089181827
+詹懋海 13.900677652
+花街柳巷 13.900677652
+鸡皮疙瘩 10.1164880181
+各显其能 12.8020653633
+德鲁普 12.5143832909
+闭塞 8.95903522937
+偷回 13.900677652
+观赏者 12.5143832909
+手臂 7.83456956187
+苍松 10.4349417492
+阿灵顿 12.1089181827
+买张 12.5143832909
+萨拉姆 11.7034530746
+不经一事 12.8020653633
+官伊本 12.5143832909
+风砂 13.900677652
+故曰 10.8561552143
+专业人才 10.0720362555
+宋江陪 13.2075304714
+容易接受 10.7226238216
+定点 8.89004235788
+惟心 13.2075304714
+七千余部 13.2075304714
+柯维 13.900677652
+万春亭 12.5143832909
+吴国忠 11.8212361103
+吞进 10.604840786
+网段 12.5143832909
+摹本 10.2371160058
+艾美奖 13.900677652
+羽毛球赛 12.5143832909
+佐法尔 13.900677652
+共同声明 11.598092559
+西南政法大学 12.8020653633
+亚冠赛 13.2075304714
+首席法官 11.7034530746
+青睐有加 10.2630914922
+方老爹 11.0674643079
+黑雨 12.8020653633
+期望 7.45178825783
+鬼谷子 12.5143832909
+伊豆 12.1089181827
+烧石膏 12.8020653633
+永振 11.4157710022
+经售 13.2075304714
+起算 10.533381822
+儒林 10.765183436
+浆糊 11.0103058941
+邱树森 11.2616203224
+矮化砧 12.2912397395
+郑岩松 13.900677652
+石氏星 12.5143832909
+邻居 7.98447558937
+朱穆之 12.8020653633
+色差 11.598092559
+令人遗憾 10.765183436
+蒲圻市 11.9547675029
+广告语 11.1926274509
+人人皆知 10.4349417492
+倡乱 11.3357282945
+刘云峰 10.0720362555
+多面体 10.8096351986
+封国公 13.2075304714
+草野 11.598092559
+柯罗 11.4157710022
+国际贷款 11.3357282945
+狮子林 11.2616203224
+生物资源 9.4233408375
+郁林郡 11.9547675029
+中央政治局常委会 13.900677652
+中科大 13.900677652
+洛阳市 8.58747167293
+揭短 12.5143832909
+载物台 13.2075304714
+广告词 10.8561552143
+场所 7.09606313191
+弹簧床 12.5143832909
+简玉阶 13.900677652
+绵绵不断 12.1089181827
+地名学 11.598092559
+烯类 11.1280889297
+日清月结 13.900677652
+洗锅刷碗 13.2075304714
+定然 10.1394775363
+闭门自守 13.900677652
+叫动 13.900677652
+黄忠领 12.8020653633
+蓝天使 12.8020653633
+结出 9.98865464655
+带符号 12.5143832909
+精彩内容 8.15128466607
+金末迁 13.2075304714
+声级计 13.900677652
+中华人民共和国 6.35054230949
+更依 13.900677652
+连正眼 12.1089181827
+深受感染 13.2075304714
+边走边叫 13.900677652
+儒术 10.1164880181
+详细信息 10.2371160058
+中年男子 9.87532596124
+善友 13.2075304714
+喝声道 10.9049453784
+浙江省委 11.598092559
+毋庸讳言 10.8561552143
+丢手 11.1280889297
+购物点 12.2912397395
+北洋军 10.0505300503
+真可敦 12.8020653633
+净胜 12.2912397395
+风神 9.34680076038
+手肘 10.604840786
+边塞风光 12.8020653633
+涵木 12.8020653633
+成仁取义 12.8020653633
+对对碰 13.900677652
+蓄电池 8.99540287354
+倡仪 13.2075304714
+修禅 12.8020653633
+瘦下来 11.8212361103
+核政策 11.5027823792
+解午 13.2075304714
+贪大求洋 12.8020653633
+编后记 13.900677652
+驻屯 10.4994802703
+七千余里 12.5143832909
+无功功率 11.3357282945
+铁甲舰 11.3357282945
+草酸 10.0294766411
+符宝郎 13.900677652
+罗斯岛 13.2075304714
+迷藏 13.2075304714
+武财神 12.5143832909
+手背 9.28555713513
+两双手 11.9547675029
+官田 9.94943393339
+五古 11.1280889297
+山西人 10.604840786
+子名益 13.2075304714
+质轻 10.642581114
+亲戚朋友 9.62401153296
+难治 10.9049453784
+善变 11.3357282945
+六十块 12.2912397395
+各行其志 13.900677652
+网址库 13.900677652
+鲍照 11.7034530746
+宣传提纲 13.900677652
+乳制品 9.23723855786
+川守李 12.8020653633
+雪中 10.642581114
+宝密圣 12.8020653633
+应用逻辑 13.900677652
+前谷 13.900677652
+祝词 11.1926274509
+陈言务去 13.900677652
+技术装备 9.32596667347
+伊利诺 11.598092559
+翁方纲 12.1089181827
+主流产品 11.1926274509
+商交所 11.3357282945
+西科尔斯基 11.9547675029
+雪丘 12.1089181827
+第四系 10.4349417492
+庆大霉素 10.765183436
+猪下水 12.1089181827
+集团股份 9.10488710638
+映入 10.3743171274
+睾丸酮 11.7034530746
+无噪音 13.2075304714
+习儒 12.2912397395
+畅销书 10.8561552143
+窦天章 13.2075304714
+该州 10.0088573539
+雪上 11.9547675029
+增加利润 11.0103058941
+维修服务 10.642581114
+换言之 9.09665660724
+玉米片 13.900677652
+杜甫 8.99540287354
+伊格莱西亚斯 13.900677652
+知心 10.0294766411
+第四粒 13.900677652
+刺扎 12.8020653633
+谍报 10.6818018271
+严刑峻法 10.3453295905
+山顶面 13.2075304714
+罗密 13.900677652
+包修 13.2075304714
+喊上来 13.2075304714
+讳言 10.0720362555
+索剑 13.2075304714
+记录器 11.0103058941
+复印机 10.642581114
+停车难 11.9547675029
+一路下 13.900677652
+控制室 11.1280889297
+西夏国 11.1926274509
+色度 11.2616203224
+组织化 11.3357282945
+戴维才 13.2075304714
+剔掉 12.5143832909
+严打 10.4349417492
+橡胶球 12.8020653633
+君主国 10.4666904475
+鲸骨 10.8561552143
+雪人 11.2616203224
+迅速开展 11.8212361103
+王忽察 13.2075304714
+反主为客 13.900677652
+烤瓷牙 12.2912397395
+王伯祥 13.2075304714
+网格 10.765183436
+石呆子 12.8020653633
+筹资 8.78268383956
+网校 13.2075304714
+雪亮 9.48183704418
+铲斗 12.8020653633
+布瓦博 12.2912397395
+续命汤 13.900677652
+蜘蛛痣 12.8020653633
+随堂 11.4157710022
+门卫室 12.2912397395
+拿捏 10.1630080337
+烟幕弹 9.32596667347
+错误思想 10.9562386728
+第四类 12.2912397395
+严把 11.1926274509
+难民 8.11993413618
+违者必究 9.22784881751
+焦作 8.21370229564
+不期而然 13.2075304714
+耳穴 12.1089181827
+修竹 10.7226238216
+武汉钢铁公司 12.1089181827
+饶恕 9.59661255877
+过滤性 12.5143832909
+做爱 9.46986085313
+严抓 13.900677652
+希思罗 11.9547675029
+做牌 13.900677652
+十几万 9.32596667347
+人云亦云 11.5027823792
+袷袢 12.8020653633
+师辅臣 10.2371160058
+大红大紫 12.1089181827
+自命清高 12.8020653633
+城市信用社 11.8212361103
+曹熊 12.5143832909
+乐无忧 13.900677652
+逊克 11.7034530746
+做人流 11.8212361103
+心不在焉 9.30555780184
+认股证 11.9547675029
+放回 9.18217878068
+灵机一动 9.5062284973
+杨东文 11.5027823792
+已用 9.80633308975
+气候型 12.8020653633
+上赛季 11.4157710022
+贝尼纳 13.900677652
+色带 11.3357282945
+杰卢姆 13.2075304714
+官瘾 12.2912397395
+囫囵 9.59661255877
+罗洛普 12.8020653633
+得寸进尺 10.7226238216
+找不着北 12.1089181827
+齐尼亚 13.900677652
+虹桥店 12.8020653633
+卡片机 13.2075304714
+驭者 13.900677652
+菲比 13.900677652
+氧氟沙星 12.5143832909
+减速剂 12.8020653633
+杉林 12.2912397395
+秤盘子 13.900677652
+放在 5.88899092285
+德汗崇 13.2075304714
+色心 11.8212361103
+修筑 7.72066099832
+黄石公园 11.2616203224
+蜀中 9.69598503258
+哭墙 11.7034530746
+詹度派 13.900677652
+长期争斗 13.2075304714
+威摄 12.2912397395
+任尚书 11.1926274509
+王从周 10.2117981979
+心肝儿 12.8020653633
+杜琼 11.7034530746
+阴陵泉 13.900677652
+芦蒿炒 13.2075304714
+网内 12.2912397395
+贾琏复 13.2075304714
+音乐盛典 13.900677652
+与虎添翼 12.8020653633
+全押 13.2075304714
+场流分级 13.900677652
+金光亮 9.36807815882
+遗弃 9.27570483869
+肇源 12.1089181827
+放映厅 12.5143832909
+风管 12.5143832909
+宣宋江 12.8020653633
+数量指标 12.5143832909
+年龄结构 11.5027823792
+渔产品 11.7034530746
+反常情况 12.8020653633
+手艺 8.089536659
+见多识广 9.98865464655
+五毒 10.9562386728
+交流会 10.2117981979
+又当别论 13.2075304714
+埃弗拉 12.8020653633
+摩梭人 13.900677652
+白雪冲 12.8020653633
+中心对称 12.8020653633
+怀药 12.1089181827
+王从吾 13.900677652
+哭声 7.82074445688
+焦了 12.5143832909
+叶大鹰 10.4041700905
+耐住 11.598092559
+抵押放款 12.8020653633
+衣雪 9.49395840471
+王有子 13.900677652
+离散谱 13.900677652
+色当 11.598092559
+六十四 9.82314020807
+谈恋爱 9.4233408375
+另行安排 11.5027823792
+笨手笨脚 11.0103058941
+遗志 10.4666904475
+塞图巴尔 13.900677652
+切合 10.3743171274
+掉下来 8.85082164473
+五点四 13.900677652
+漆黑一片 10.765183436
+和赤纬 12.2912397395
+遗忘 8.9519177616
+磺溪 13.900677652
+理论工作者 12.8020653633
+宁远觉 13.2075304714
+商并雄 12.5143832909
+赵云领 12.2912397395
+佩德罗 11.0674643079
+丛毛 11.7034530746
+宋丹丹 13.900677652
+铸错 13.900677652
+风筝 9.21854642485
+合盘托出 13.2075304714
+通货紧缩 9.45802639549
+轻快地 10.1630080337
+宋江兵 11.8212361103
+伏弩 12.1089181827
+心领神会 10.1394775363
+晋祠泉 11.598092559
+购物狂 13.2075304714
+六级 10.9562386728
+演奏法 12.2912397395
+杉杉 9.35738286971
+邻座 11.7034530746
+荡然 12.2912397395
+公休日 11.7034530746
+韩宣子 12.2912397395
+长安区 13.900677652
+北寒带 12.5143832909
+吴克群 12.8020653633
+完美无缺 10.6818018271
+色弱 12.8020653633
+独具匠心 11.0103058941
+儒教 10.4994802703
+柘城县 13.2075304714
+猎获物 11.4157710022
+杜瓦 12.1089181827
+罗素伯爵 13.900677652
+风笛 12.1089181827
+并肩战斗 11.4157710022
+王胖子 10.4994802703
+膻味 11.598092559
+放债 10.8561552143
+八百万余斤 13.2075304714
+第四站 13.900677652
+人身权利 11.0674643079
+窄窄 11.7034530746
+三河马 11.1926274509
+更佳 10.2117981979
+牌迷 13.900677652
+哭得 9.06439574502
+咬钉嚼铁 13.900677652
+初校样 13.900677652
+哈萨克 8.98802276624
+罗伊河 13.2075304714
+严格来说 11.5027823792
+放倒 10.2897597393
+地球村 11.8212361103
+镇嵩军 12.2912397395
+李若琳 12.8020653633
+董兆乾 13.2075304714
+地明器 13.2075304714
+痉孪 13.900677652
+时立爱 12.8020653633
+一花独秀 13.900677652
+六十八 12.8020653633
+中国人民保险公司 12.5143832909
+六十六 11.5027823792
+苍术 10.765183436
+贷给 9.69598503258
+激动人心 9.89334446674
+中唐时期 11.8212361103
+吐丹 13.2075304714
+二花脸 12.8020653633
+牙齿 7.50042020667
+匮乏 8.88339781516
+适应环境 10.0940151622
+定理 8.1386262692
+沁阳市 10.6818018271
+鲸鱼 10.604840786
+长话短说 12.1089181827
+古砚微 13.2075304714
+北京市 7.41451686303
+通信接口 12.5143832909
+诱惑性 13.2075304714
+知之为知之 12.8020653633
+双余度 13.2075304714
+徒呼奈何 13.900677652
+苏州高新区 13.900677652
+偿付 8.94485059437
+曹仁 8.4980002701
+滤过 10.0294766411
+判处 8.12302532875
+窗纱 11.4157710022
+啁哳 13.900677652
+卡提利 12.8020653633
+修家谱 13.2075304714
+新街口 11.598092559
+北门一带 12.1089181827
+帮帮我 11.1280889297
+放假 9.05649056552
+吉思子 13.2075304714
+鲸鲨 11.9547675029
+十项全能 12.1089181827
+元宝区 13.900677652
+八千元 12.5143832909
+网游 8.75318317516
+姜丝 11.9547675029
+衣帽架 11.8212361103
+麻脚软 12.8020653633
+事关重大 10.0940151622
+曹为 12.8020653633
+随机误差 12.1089181827
+放映员 11.2616203224
+流血千里 12.8020653633
+雨中 10.4349417492
+推销术 13.900677652
+猛回头 11.8212361103
+雨燕 9.6811699468
+科罗纳 13.900677652
+红杏出墙 12.1089181827
+状态 5.59026265779
+驻外 9.66657114738
+雨丝 10.765183436
+姜为 12.8020653633
+反抗性 12.2912397395
+曹丘 13.2075304714
+萨马拉州 13.900677652
+敝履 12.8020653633
+闪念 11.4157710022
+杜环 11.1926274509
+新机遇 10.642581114
+非同儿戏 11.7034530746
+两河口 12.2912397395
+厌学 12.2912397395
+包氏 12.1089181827
+电气工程 11.1926274509
+柯立 11.7034530746
+揭牌 10.0088573539
+挂出去 13.2075304714
+洛阳宫 12.8020653633
+吊带裙 12.5143832909
+拉乌尔 11.9547675029
+家给人足 13.900677652
+万亿个 12.8020653633
+解像 13.2075304714
+穆王 10.604840786
+妙音 12.5143832909
+空即是色 12.5143832909
+平常心 9.98865464655
+乐嘉城 12.8020653633
+春上 10.4041700905
+遗墨 12.1089181827
+利息税 12.8020653633
+那达慕 11.598092559
+徐先生 9.71102290995
+摹拟 11.3357282945
+放像 13.2075304714
+封和硕 12.1089181827
+良辰吉日 12.5143832909
+一家之言 10.8561552143
+定界 12.1089181827
+均等化 10.8561552143
+阿木林 13.900677652
+完颜亮 10.4666904475
+曹侯 13.2075304714
+益盛 12.2912397395
+撮要 11.9547675029
+竖旗 12.8020653633
+包协 13.900677652
+样件 13.2075304714
+严政 13.900677652
+送进来 11.1926274509
+第四篇 11.3357282945
+颜氏家训 11.1926274509
+瓢儿 12.8020653633
+薛妹妹 12.8020653633
+东洋大海 10.8561552143
+信令 12.5143832909
+下车时 11.9547675029
+佩拉 12.2912397395
+胡打海摔 13.900677652
+立此存照 12.5143832909
+舞雩 13.900677652
+穆特 12.1089181827
+短褂 11.1280889297
+死人城 13.900677652
+和朝章 13.2075304714
+武学谕 13.900677652
+戈伊蒂 13.2075304714
+广告辞 13.900677652
+发包 12.1089181827
+民航史 13.900677652
+军大衣 9.98865464655
+放养 9.4233408375
+为此 6.47115680919
+肯塔基州 11.5027823792
+玉米田 12.8020653633
+晤面 12.5143832909
+为止 7.35389224122
+落败 11.7034530746
+启蒙 8.7245279194
+听好 12.1089181827
+严整 9.35738286971
+哥伦比亚人 12.5143832909
+放入 8.1902506346
+郭璞注 13.2075304714
+诈尸 10.3743171274
+前两天 9.22784881751
+敝屣 13.900677652
+项普略 12.5143832909
+传输方式 12.2912397395
+草间 11.5027823792
+杜牧 10.2371160058
+隔热层 12.5143832909
+独幕 10.765183436
+放免 10.765183436
+遗失 10.1394775363
+墩子 11.0103058941
+包涵 10.2117981979
+一团乱麻 10.533381822
+人伦关系 13.900677652
+知名企业 9.84023464143
+样书 13.900677652
+间质性 11.0674643079
+控制屏 13.2075304714
+同温同压 13.900677652
+数十余载 13.2075304714
+严斥 11.5027823792
+捣烂 10.604840786
+抚远县 11.598092559
+纠风办 12.1089181827
+华商洋 12.8020653633
+意中 11.7034530746
+凤凰寺 10.9562386728
+戴维斯 9.80633308975
+森房吉 12.8020653633
+第四等 12.2912397395
+不刊之典 13.900677652
+利利索索 11.3357282945
+靓仔 11.8212361103
+官佐 11.9547675029
+滚油浇心 13.900677652
+雨伞 9.82314020807
+过滤机 11.7034530746
+宝石蓝 13.2075304714
+研究班 11.5027823792
+林永升 12.5143832909
+曹休 10.5684731418
+纳米比亚 9.98865464655
+冷轧机 13.900677652
+放出 7.54283538547
+严旨 10.8561552143
+十六部 12.2912397395
+探索期 13.2075304714
+拜爵 13.2075304714
+农民党 11.2616203224
+严安 13.2075304714
+格洛斯特 12.1089181827
+带劲儿 12.8020653633
+数十千克 13.2075304714
+麦日盖 13.2075304714
+储光羲 13.2075304714
+乌兰察布盟 10.4666904475
+毒酒 11.3357282945
+玉皇山 11.1926274509
+赞美诗 10.533381822
+饶有 10.604840786
+速胜 11.9547675029
+怡颜悦色 12.8020653633
+一个通 12.2912397395
+邻境 11.7034530746
+来之不易 9.82314020807
+冯敏杰 9.63799777493
+降低成本 9.05649056552
+冷轧板 10.8096351986
+美国士兵 11.598092559
+啁啾 10.9562386728
+苫布 12.2912397395
+南充市 11.598092559
+放到 7.51717101709
+高射炮 9.56994431169
+巢伯 12.8020653633
+迷航 12.8020653633
+失踪者 12.8020653633
+宁府中 11.9547675029
+信从 12.5143832909
+刮过去 12.8020653633
+多形性 11.0103058941
+车云 13.900677652
+严明 9.5062284973
+臂章 11.3357282945
+卫队长 12.8020653633
+丰亨豫大 13.900677652
+人格理论 13.2075304714
+作鸟兽散 11.0103058941
+黄金组合 12.5143832909
+京沪线 11.9547675029
+郑正秋 11.598092559
+杨氏实验 12.1089181827
+驻守 8.39534611604
+方伯平 10.642581114
+郑超麟 13.900677652
+非洲人 9.41204128224
+风纪 11.9547675029
+下怀 11.2616203224
+车价 9.91169360541
+第四碗 12.8020653633
+赚过 12.1089181827
+汇率问题 9.53122979951
+风级 11.9547675029
+布鲁克斯 10.604840786
+刘晓光 12.1089181827
+王瞎子 13.2075304714
+频频告急 12.5143832909
+路望北 13.2075304714
+勘定 11.0103058941
+法文版 11.1280889297
+成年累月 11.7034530746
+林进屿 13.900677652
+宫规宫 12.8020653633
+南辕北辙 10.8096351986
+桠杈 13.900677652
+和棋 11.598092559
+吴姬 13.900677652
+释利摩 13.900677652
+竹节虫 11.598092559
+卡芬雅克 13.2075304714
+边走边吃 12.8020653633
+一国之君 12.1089181827
+移灵 13.2075304714
+郴州市 11.598092559
+唐山陶瓷 11.8212361103
+车主 7.71036224612
+拜会 10.1394775363
+占田达 13.2075304714
+瓦楞纸板 12.2912397395
+经验交流 10.7226238216
+林永健 12.8020653633
+想变 12.5143832909
+产前检查 10.6818018271
+质询 10.2371160058
+拜伏 9.89334446674
+涨跌互见 10.4666904475
+附体 10.0940151622
+地球日 13.2075304714
+网民 8.1641053545
+炮弹箱 11.598092559
+网具 12.5143832909
+升降级 12.5143832909
+谬说 12.2912397395
+潜江县 12.2912397395
+拜伦 10.3171587135
+八千卷 12.2912397395
+瓷板画 13.900677652
+车上 7.47743068844
+车下 11.1280889297
+双城县 13.2075304714
+广西省 10.9562386728
+邻家 10.8096351986
+修纂 11.0103058941
+扩散出来 13.900677652
+拜佛 9.01032852375
+学理科 12.5143832909
+里卡尔多 13.900677652
+印度卢比 11.4157710022
+钱范 12.5143832909
+九叶 12.2912397395
+哪几种 11.9547675029
+转移率 12.8020653633
+三五百 11.0674643079
+眷眷 12.8020653633
+对半分 11.8212361103
+自热 12.5143832909
+信王 11.1926274509
+益田 13.2075304714
+灭族 10.7226238216
+巡夜 11.2616203224
+吃水果 10.2630914922
+判定 8.47572763449
+摆臭架子 13.900677652
+判官 9.20932976975
+独秀峰 12.2912397395
+旗飘扬 12.8020653633
+手机芯片 13.900677652
+伯明翰 10.2371160058
+霍山县 10.9049453784
+官爵 9.40086798165
+寻公子 13.900677652
+微内核 13.900677652
+遗孀 10.4994802703
+信物 10.3453295905
+巢中 11.4157710022
+迷茫 8.88339781516
+心惊胆颤 11.7034530746
+玉皇庙 11.598092559
+兰斯洛特 13.900677652
+吞吐量 8.60737282725
+第四种 10.642581114
+迪奥狄 12.5143832909
+定睛 9.48183704418
+扼制 10.9049453784
+后膛 11.4157710022
+身兼数职 13.2075304714
+遗存 8.58747167293
+九句 12.8020653633
+遗孤 11.5027823792
+马骨胡 12.5143832909
+粗活 10.642581114
+历算 10.765183436
+信牌 13.2075304714
+密封式 12.1089181827
+附件 9.04086524761
+遗孽 13.900677652
+风翔 13.900677652
+天平秤 12.2912397395
+第一一六回 13.2075304714
+附二 13.2075304714
+名门贵族 13.2075304714
+凭证 8.52539924429
+九口 12.8020653633
+迷药 11.598092559
+油然而生 9.98865464655
+定省 13.900677652
+勾践 10.4994802703
+炸死 9.6811699468
+翁美玲 13.2075304714
+拜仁 11.598092559
+推崇备至 12.5143832909
+华顶 11.598092559
+更令 9.82314020807
+修编 11.9547675029
+高才捷足 13.900677652
+孤帆 12.8020653633
+更以 10.2630914922
+夫荣妻贵 12.8020653633
+修缮 9.30555780184
+于阿尔 13.900677652
+合格者 11.0103058941
+圣基茨 11.0674643079
+老巫婆 13.900677652
+官玺 12.2912397395
+以德服人 12.8020653633
+滩脊 13.900677652
+调兵 9.61021821083
+秦末英 13.2075304714
+有所前进 13.900677652
+开开眼 10.8561552143
+楹联 12.1089181827
+脱漆剂 13.900677652
+门户之争 11.1280889297
+朱子之 12.2912397395
+放去 11.1926274509
+色子 13.2075304714
+海军上尉 13.900677652
+反倾销 7.84623830571
+闭式 12.2912397395
+科考队 12.8020653633
+黑暗面 12.5143832909
+义生 12.8020653633
+强自忍 12.5143832909
+舞剧团 12.1089181827
+余人次 12.2912397395
+趋同 9.96885201925
+好娃娃 11.598092559
+弗拉特 13.2075304714
+广告费 10.8561552143
+梁山县 11.9547675029
+拜为 9.84023464143
+天网恢恢 12.1089181827
+落进 9.85762638414
+哈萨克人 11.2616203224
+起端 13.2075304714
+耳罩 12.2912397395
+寻黛玉 12.8020653633
+廉颇 10.6818018271
+亚历山大图书馆 12.5143832909
+哭尽 13.900677652
+电子业 12.2912397395
+宰执官 12.5143832909
+相依相偎 13.900677652
+附上 10.8561552143
+网海 13.2075304714
+一幢幢 10.5684731418
+严查 9.56994431169
+完好无损 10.2371160058
+无处不在 9.72629038208
+徐府街 12.5143832909
+乡镇财政 13.2075304714
+单峰驼 12.2912397395
+尚墨守 13.2075304714
+欠发达国家 11.9547675029
+狗眼看人 10.9049453784
+车体 7.98447558937
+步骑舟 13.2075304714
+伶仃洋 10.8561552143
+石家庄陆军指挥学院 13.900677652
+克拉伦斯 13.2075304714
+灯光设计 13.2075304714
+遗害 12.2912397395
+金娜 13.2075304714
+视紫红质 12.5143832909
+三千多名 11.598092559
+满洲里 10.533381822
+车位 10.3171587135
+遗容 11.5027823792
+素不相识 10.4666904475
+肖德贝 13.2075304714
+穆罕 12.5143832909
+内外资 13.2075304714
+场次 10.2117981979
+严格 6.15957856194
+当面 7.72066099832
+处世 9.96885201925
+陈海玲 12.8020653633
+蔡先生 12.1089181827
+原猴亚 11.7034530746
+广告节 12.5143832909
+蜘蛛网 10.604840786
+落聘 13.900677652
+和暖 9.44633035572
+烈火 8.75901409547
+阿合奇县 12.5143832909
+组织奖 12.1089181827
+原汁 11.8212361103
+所见所闻 10.1394775363
+放小 11.598092559
+萌生 9.4233408375
+遗命 10.2630914922
+放射 8.66423568915
+克利 11.0103058941
+侧重于 9.17328983326
+解决困难 11.1926274509
+摇摇头 6.97704902384
+龃龉 10.9049453784
+耕地面积 8.5488195185
+第九节 13.2075304714
+廖大珠 13.900677652
+宜城县 12.5143832909
+马赛克 11.7034530746
+辛辛那提大学 12.5143832909
+史兀良 13.2075304714
+吞蚀 12.8020653633
+耿耿于心 13.2075304714
+更有意义 10.9049453784
+波多诺伏 11.5027823792
+比例规 11.4157710022
+六百里 10.6818018271
+怀表 10.2117981979
+吴起问 13.2075304714
+分节 9.87532596124
+哭叫 9.63799777493
+内外贸 12.1089181827
+贸易界 13.2075304714
+哀恸不已 13.2075304714
+放屁 9.06439574502
+糖耐量 11.2616203224
+喧哗 8.98069672615
+焦燥 12.1089181827
+处于 5.17972762305
+克利亚 13.900677652
+游移不定 11.598092559
+风火 11.1926274509
+处事 9.35738286971
+呼吸困难 8.89004235788
+风灯 12.2912397395
+金之竣 11.9547675029
+开单子 13.900677652
+完美无瑕 13.2075304714
+吕祖庵 12.5143832909
+咫尺之遥 11.8212361103
+殃民 12.2912397395
+烈烈 11.2616203224
+三格 12.5143832909
+风灾 11.8212361103
+捶胸跌脚 13.2075304714
+研究组 10.604840786
+定神一看 12.1089181827
+阳翰笙 11.0674643079
+凛遵 12.1089181827
+恩赐 9.63799777493
+和昌 11.3357282945
+洛阳城 8.9519177616
+殷仲堪 13.2075304714
+碘酸钾 13.2075304714
+亨根 13.900677652
+整车厂 11.7034530746
+和易 13.2075304714
+习定 13.2075304714
+巴伐利亚 9.59661255877
+金匮 10.5684731418
+伪君子 10.0940151622
+衣阿华州 13.2075304714
+吴起镇 11.598092559
+探头缩脑 13.2075304714
+秦明力 13.2075304714
+狄之计 13.2075304714
+白雪娘 11.4157710022
+法文系 13.2075304714
+五十秒 13.900677652
+网扣 12.8020653633
+坐船去 12.5143832909
+影评 10.765183436
+批评指正 11.9547675029
+弄出去 12.5143832909
+战斗原则 13.900677652
+临盆时 13.900677652
+杜翰 12.1089181827
+托过 12.5143832909
+奢华 9.00283785202
+金化 11.2616203224
+董学礼 11.9547675029
+弹簧圈 13.900677652
+数码技术 13.900677652
+钱财 8.62767809341
+修炼 9.08039608637
+冷启动 12.8020653633
+钱货 11.3357282945
+作事 11.0103058941
+客流量 10.0720362555
+移行 11.0674643079
+毛主席纪念堂 11.4157710022
+增砖添瓦 13.900677652
+鸣枪 10.765183436
+第二百 11.4157710022
+女伶 13.2075304714
+王舍城 11.1280889297
+绿阴 12.1089181827
+炼丹 9.16447920358
+工程施工 10.1630080337
+趸船 10.9562386728
+支义军 11.8212361103
+听证会 9.18217878068
+衣鱼 13.2075304714
+鞋里 11.5027823792
+表表 12.1089181827
+匀速 10.3453295905
+挂锁 11.8212361103
+教练机 9.55687223012
+过渡时期 9.71102290995
+马超亦 13.900677652
+一头架 13.2075304714
+包虫病 13.900677652
+裕民 11.8212361103
+金管会 10.8561552143
+韩王信 11.9547675029
+为期 7.59622884955
+宝杖 10.2117981979
+并无不当 11.8212361103
+贬意 11.9547675029
+死里求生 13.900677652
+降顺 9.6811699468
+金之策 13.2075304714
+支配者 12.2912397395
+味道不好 12.8020653633
+通风口 11.2616203224
+耳熟 10.642581114
+炼乳 11.5027823792
+商贤臣 12.8020653633
+惨不忍睹 10.0940151622
+凭藉 12.5143832909
+南流江 11.1926274509
+刺探 10.1630080337
+迷走 12.1089181827
+杨辉三角 12.8020653633
+娓娓 11.5027823792
+杨耀 11.598092559
+几千几万年 12.2912397395
+平纹布 13.900677652
+短缺经济 11.598092559
+模式识别 10.9562386728
+烈焰 9.75754292558
+滥竽充数 12.8020653633
+落脚 9.4233408375
+定礼 11.4157710022
+就读于 8.71329184614
+解除限制 13.900677652
+烫死 11.5027823792
+初征 13.900677652
+傅全有 13.2075304714
+梁宫 13.900677652
+免收 9.80633308975
+苏中七 12.8020653633
+玉米秸 12.2912397395
+自然损耗 13.900677652
+炸断 10.533381822
+塔凌霄 13.2075304714
+姨父 10.6818018271
+耶利米 13.2075304714
+刘晓庆 10.8096351986
+钓线 12.5143832909
+锋芒太露 13.900677652
+阎浮提 13.2075304714
+九华 10.9049453784
+杜纳 13.900677652
+偕行 13.2075304714
+手袋 10.9562386728
+全国性 7.83456956187
+海地 9.37888907493
+主权在民 11.4157710022
+二百九十九 13.900677652
+难有 9.23723855786
+牧时铸 13.2075304714
+筋斗 9.91169360541
+玉米种 13.900677652
+李凝眉 13.900677652
+斗智斗勇 11.2616203224
+走私者 12.8020653633
+关税及贸易总协定 10.765183436
+抡刀 11.598092559
+迷路 9.56994431169
+疲敝 11.8212361103
+杜绝 8.63281949291
+金属带 12.8020653633
+六十岁 9.71102290995
+凌小姐 13.900677652
+慈悲为本 12.5143832909
+放工 12.2912397395
+理性分析 11.598092559
+斗智斗力 13.900677652
+网捕 12.2912397395
+纳西尔 13.2075304714
+钱谷 10.6818018271
+城调队 13.900677652
+演奏曲 13.900677652
+三六九 13.2075304714
+敢想敢说 13.900677652
+科里 9.94943393339
+信性儿 13.2075304714
+郭可盈 12.5143832909
+君臣父子 11.7034530746
+洛泽 13.900677652
+闭关 11.0103058941
+亲知 12.8020653633
+两万余册 13.2075304714
+刊正 12.8020653633
+等而下之 12.5143832909
+放声歌唱 12.1089181827
+组织学 10.2371160058
+周嫂子 12.5143832909
+蒋梦麟 13.2075304714
+毛背心 12.8020653633
+淳安县 12.8020653633
+十数碗 12.5143832909
+靴子 8.98802276624
+官绅 8.41588071849
+连若曦 13.2075304714
+潜藏着 11.7034530746
+赵弘 12.5143832909
+趋时 11.9547675029
+满山红 11.9547675029
+慈宁慈 12.8020653633
+一万里 13.2075304714
+二五眼 11.1926274509
+递推 11.2616203224
+包括 4.22365164923
+华商报 11.598092559
+发刷 13.2075304714
+刻画出 11.5027823792
+放帐 12.2912397395
+主承销 10.8561552143
+钢管厂 11.5027823792
+壁里安柱 13.900677652
+棉纺织业 9.49395840471
+低音弦 13.2075304714
+贾大泉 12.8020653633
+滤膜 13.2075304714
+别具风味 13.900677652
+益秩 13.2075304714
+控制台 11.0103058941
+毛玻璃 11.9547675029
+恍若 10.3453295905
+墙前 12.1089181827
+司寇下 13.2075304714
+二十五米 13.2075304714
+包抄 9.71102290995
+冰棍儿 12.5143832909
+巴克拉 13.900677652
+六十开 12.2912397395
+制作方法 10.5684731418
+办喜事 10.3453295905
+魏荣爵 12.8020653633
+百万富婆 13.900677652
+钱学礼 9.29550746599
+精密化 13.2075304714
+阿童木 10.2117981979
+撞大运 11.7034530746
+闯过去 11.7034530746
+庞德公 13.900677652
+刘姓诸 13.2075304714
+氧化铍 12.1089181827
+科威特 8.98069672615
+之低 11.4157710022
+新病毒 13.2075304714
+洛子峰 12.1089181827
+定稿 10.0720362555
+巷道 9.5186510173
+遗嘱 8.9102450652
+密封剂 12.5143832909
+之余 7.96843246453
+官纱 13.2075304714
+铁脚板 13.2075304714
+哭出 10.4041700905
+手订 12.2912397395
+包扎 9.20019728618
+落英 12.8020653633
+软柿子 11.8212361103
+阿尔丹 12.8020653633
+民航局 10.3171587135
+驻场 13.2075304714
+诈取 11.8212361103
+捉奸在床 13.900677652
+说真的 9.34680076038
+范代克 13.2075304714
+手记 10.0088573539
+各捡 13.900677652
+包打 13.2075304714
+封师古 8.44963919841
+办公用房 11.0103058941
+难搞 11.9547675029
+学富五车 12.2912397395
+邻域 11.1926274509
+时台军 13.900677652
+山高月小 12.8020653633
+英语老师 13.2075304714
+字贴 13.2075304714
+太空船 13.2075304714
+肇庆市 10.6818018271
+太空舱 12.5143832909
+太史令 11.2616203224
+落花 10.3743171274
+顺应潮流 11.8212361103
+阿尔卑斯山脉 9.96885201925
+手误 13.900677652
+三校 11.4157710022
+手语 11.1926274509
+为之一变 10.9049453784
+吕布兰 12.8020653633
+年年有余 13.900677652
+影视 8.53938548627
+定窑 11.1926274509
+强降水 13.900677652
+离愁别绪 12.1089181827
+五轮 12.1089181827
+毛孩子 11.5027823792
+林加拉 13.2075304714
+二百余万两 12.5143832909
+之俊 12.2912397395
+草驴 12.8020653633
+控制区 11.0103058941
+包房 10.9562386728
+那郡侯 11.598092559
+橡胶粉 13.900677652
+网恋 13.2075304714
+贾雄 13.2075304714
+非说不可 12.8020653633
+瓦特计 13.900677652
+住友银行 12.1089181827
+克鲁瓦 12.8020653633
+遗址 6.54312145107
+那金桂 12.8020653633
+肌肉组织 10.3171587135
+葛红林 13.2075304714
+之中 5.67973648369
+秋分点 12.5143832909
+五车 10.765183436
+弗拉维 12.2912397395
+干凝胶 13.900677652
+臭味儿 12.1089181827
+之主 8.4801426527
+之为 9.74179456862
+之举 8.12923652885
+和文 11.5027823792
+抗癫痫 11.9547675029
+之一 4.6441218562
+通晓兵 13.900677652
+六十年 9.45802639549
+开支票 13.900677652
+落荒 11.5027823792
+之下 6.19676744236
+之上 6.52416952565
+之三 10.1630080337
+落荚 13.900677652
+包揽 9.74179456862
+灵台县 13.2075304714
+英俊潇洒 12.2912397395
+刘骜之 13.2075304714
+走麦城 12.5143832909
+奉节县 11.1926274509
+放开 7.67216664838
+放弃 6.56049081666
+落草 9.94943393339
+宗社籍 13.2075304714
+祖诺夫 12.2912397395
+之乡 8.48457724977
+松阴溪 12.5143832909
+北北西 11.4157710022
+之书 8.96620371885
+大智若愚 11.598092559
+自由邦 10.9049453784
+严武 12.5143832909
+裕如 12.8020653633
+严正 10.2371160058
+欲了解 10.2371160058
+塔利班 10.2371160058
+之乱 8.78868986362
+顶球 12.5143832909
+文艺会演 13.900677652
+十数种 12.5143832909
+更为 6.05330581582
+为数 9.07236391467
+蛤壳 13.2075304714
+枋头 12.2912397395
+发刊 13.2075304714
+分工协作 10.8096351986
+闭口 10.1871055853
+放映室 12.8020653633
+之义 9.16447920358
+布政分 13.2075304714
+咯吱 11.7034530746
+包探 13.2075304714
+公粮 11.1280889297
+之乐 9.96885201925
+耳环 9.75754292558
+该当 9.74179456862
+前踱 13.2075304714
+检验能力 13.2075304714
+闻魏文 13.2075304714
+双城市 12.1089181827
+色块 11.3357282945
+帮宝适 12.5143832909
+主副食 13.900677652
+醪糟 11.8212361103
+第六号 13.900677652
+谢尔盖耶夫 13.2075304714
+邻国 8.52539924429
+揭明 13.900677652
+建国门 12.2912397395
+章太炎 10.0088573539
+七七七 13.2075304714
+鸣放 13.2075304714
+哈拉浩 13.2075304714
+之人 7.09495509856
+意大利人 8.97342396682
+有神论者 12.8020653633
+受术者 12.8020653633
+空怀 11.598092559
+雷横先 13.2075304714
+西欧各国 9.66657114738
+之事 6.54951942555
+丛氏 13.2075304714
+之争 8.46695564842
+年度预算 9.96885201925
+智商测验 13.900677652
+放得 9.27570483869
+高像素 13.2075304714
+大肆咆哮 13.900677652
+官署 9.45802639549
+氢氧根 11.7034530746
+卷闸门 11.3357282945
+马来群岛 10.8561552143
+北向西 12.5143832909
+将军肚 13.2075304714
+蜘蛛精 11.5027823792
+反转来 12.8020653633
+毛延寿 13.2075304714
+封宋江 12.8020653633
+修玄 12.5143832909
+元宝山 11.2616203224
+魄消魂散 13.900677652
+迷迷 11.0674643079
+维拉斯 13.2075304714
+先应 12.5143832909
+和数 12.1089181827
+阿尔丁 13.900677652
+做答 12.8020653633
+信纸 10.0720362555
+为时 10.0088573539
+对半开 12.8020653633
+消释 12.2912397395
+摄人心魄 13.2075304714
+可视电话 10.4041700905
+不甘寂寞 10.8096351986
+严毅 12.5143832909
+太长太 12.5143832909
+巷里 10.0294766411
+以子之矛 13.900677652
+六十度 12.8020653633
+放心 6.17490621039
+葛红来 13.900677652
+教学秩序 12.5143832909
+马适建 12.5143832909
+山豆根 13.900677652
+分庭抗礼 10.2630914922
+拔腿 10.2117981979
+直立式 11.8212361103
+干电池 10.2117981979
+贾逵 11.1926274509
+钟子昂 12.2912397395
+硬磁盘 12.2912397395
+一头把 12.8020653633
+非于 13.900677652
+巴拿马共和国 12.8020653633
+衣饰 10.1871055853
+冷面 10.604840786
+非人 9.7898037878
+打些 11.7034530746
+驻军 8.26232298264
+难抑 11.3357282945
+厌厌 13.900677652
+王丹凤 13.2075304714
+疲倦 8.47133202302
+久旱逢甘雨 13.2075304714
+右脑 11.598092559
+一扇门 10.7226238216
+茹斯特 12.1089181827
+生可旦 13.2075304714
+尺蠖 11.9547675029
+水族馆 11.0103058941
+叶吉格 13.900677652
+信神 11.3357282945
+并邀 12.8020653633
+计算精度 12.8020653633
+蹉跎岁月 13.2075304714
+外重内轻 12.5143832909
+男演员 10.0505300503
+六十多 11.1926274509
+双引擎 11.8212361103
+模拟退火 13.900677652
+修理 8.13548654919
+人体科学 12.5143832909
+记牢 11.3357282945
+看不上眼 10.9562386728
+董振堂 12.5143832909
+八千余种 13.2075304714
+布雷德 10.8096351986
+赞叹不已 11.0103058941
+西科迪勒 13.900677652
+窄狭 10.765183436
+现实状况 11.598092559
+巷陌 13.2075304714
+罚没款 11.9547675029
+不太会 10.7226238216
+诈唬 13.2075304714
+六十天 12.5143832909
+揭竿 12.2912397395
+叹息声 11.2616203224
+难拆 13.900677652
+努力奋斗 10.7226238216
+时移世易 13.900677652
+任登州 13.2075304714
+金无足赤 12.8020653633
+遗像 10.3171587135
+小俩口 12.2912397395
+自由面 12.8020653633
+闭合 8.74738605748
+霍姆伯 13.2075304714
+手足 8.47572763449
+一天天 8.85725253506
+非上 13.2075304714
+矿质肥料 13.2075304714
+疲态 9.98865464655
+严治 13.900677652
+结良缘 13.900677652
+像样 9.30555780184
+寂静无声 10.4994802703
+初小 13.900677652
+取阅 13.2075304714
+网易 8.5440913773
+立竿见影 10.0505300503
+孙毓修 13.900677652
+畏敌如虎 11.8212361103
+巴布维 13.2075304714
+金叶 10.765183436
+合格证 10.4349417492
+玉米糊 11.5027823792
+拐下去 13.900677652
+梁皇帝 13.900677652
+延兴门 13.2075304714
+铁甲车 13.2075304714
+玉米糁 12.2912397395
+环子 13.900677652
+美国国务院 10.765183436
+采获 13.2075304714
+巡按使 11.2616203224
+贝司手 13.900677652
+驻兵 9.58318953844
+放声 8.95903522937
+两党关系 12.2912397395
+白湖亭 13.900677652
+隐隐若现 13.900677652
+王朗 10.2371160058
+黄表纸 11.3357282945
+利害得失 11.7034530746
+松弛下来 10.6818018271
+兵微将寡 11.5027823792
+梅雨潭 13.900677652
+风琴 10.7226238216
+玉米粥 13.2075304714
+八千多 11.9547675029
+定粮 13.900677652
+草鱼 9.89334446674
+影迷 9.80633308975
+非买 13.900677652
+安全气囊 10.2630914922
+小推车 11.5027823792
+难打 11.7034530746
+涵意 12.2912397395
+独辫 13.900677652
+肢残 11.5027823792
+玉米粉 11.7034530746
+平果县 12.2912397395
+梅里达 12.8020653633
+严法 12.2912397395
+揭穿 9.69598503258
+香车宝马 13.2075304714
+恐后争先 13.900677652
+耳痛 12.1089181827
+罗伊斯 11.1926274509
+砍起来 13.900677652
+网架 11.3357282945
+严津 12.2912397395
+元君庙 11.9547675029
+落蕾 12.8020653633
+葡萄牙共和国 13.2075304714
+不及其余 12.8020653633
+外引内联 13.2075304714
+风痹 12.8020653633
+大拇指头 12.2912397395
+穆穆 13.900677652
+阳朔县 11.7034530746
+耳病 13.2075304714
+放大 6.65645013637
+波尔多市 13.900677652
+官秩 12.1089181827
+栗红 13.2075304714
+巴克斯 11.598092559
+萨尔布吕肯 12.1089181827
+手谈 11.7034530746
+嵌钻石 13.900677652
+蓟南 13.2075304714
+孙星衍 11.4157710022
+江城哈尼族彝族自治县 13.2075304714
+潮安县 12.8020653633
+手谕 9.82314020807
+松山湖 13.900677652
+官称 11.5027823792
+影踪 10.9049453784
+满脸横肉 11.9547675029
+车马店 12.8020653633
+足三里 11.2616203224
+金发 10.4994802703
+严浩 13.900677652
+放好 10.1394775363
+品竹调丝 13.2075304714
+精细化工 10.4994802703
+靴尖 11.9547675029
+梅苏拉 13.900677652
+分散性 11.8212361103
+火灾保险 13.2075304714
+官禄 12.1089181827
+方济会 13.900677652
+哈林顿 12.8020653633
+货币汇率 9.84023464143
+人神共鉴 13.900677652
+急不暇择 13.900677652
+遗患 12.2912397395
+钱袋 10.4349417492
+人像画 13.900677652
+婴幼儿 9.34680076038
+五包 12.8020653633
+追来追去 13.900677652
+维护性 13.2075304714
+总的来看 9.85762638414
+好事多磨 11.8212361103
+贾特波 13.900677652
+集成块 12.8020653633
+高度一致 10.4349417492
+聚拢在 11.7034530746
+布鲁纳 12.8020653633
+冷静 7.54804825566
+利息率 8.32094782599
+水听器 12.8020653633
+宋江道 8.05713323494
+包住 10.2897597393
+波箱 13.900677652
+坑道工事 11.0103058941
+雪顿节 13.2075304714
+挥汗成雨 13.2075304714
+席不暇暖 12.8020653633
+耳畔 9.53122979951
+寡欢 12.1089181827
+九百万两 13.2075304714
+万多所 13.900677652
+动态控制 13.2075304714
+交通设备 11.598092559
+烯炔 13.900677652
+色光 10.765183436
+唐僧高 12.8020653633
+工农区 11.4157710022
+黑郁 13.900677652
+讲用会 13.900677652
+法尔河 13.900677652
+败溃 11.9547675029
+衣食 9.27570483869
+三氧化钼 12.2912397395
+共存 9.35738286971
+集思广益 11.4157710022
+场源 12.5143832909
+立场坚定 11.3357282945
+沃克组 13.900677652
+耳生 13.900677652
+烯烃 9.38981814546
+江浦县 11.9547675029
+阳陵泉 13.2075304714
+金叉 9.31571017331
+木头 8.18036587537
+唐僧骑 13.900677652
+黄水冲 13.2075304714
+美索不达 13.900677652
+风电 8.12923652885
+非但 8.98802276624
+浮名薄利 13.900677652
+第三两个 13.900677652
+弹簧刀 13.2075304714
+江湖险恶 13.900677652
+衣领 9.38981814546
+集体利益 11.598092559
+桥牌赛 12.8020653633
+包放 13.900677652
+慎重考虑 10.4041700905
+乔装成 12.5143832909
+肝郁 10.765183436
+师事玄 13.2075304714
+高低贵贱之分 12.2912397395
+和悦 9.98865464655
+关节点 11.9547675029
+称赏不已 12.8020653633
+颜乌野 12.1089181827
+狭心症 13.900677652
+暴戾之气 13.900677652
+生民涂炭 12.8020653633
+掌综理 12.8020653633
+哭喊 9.55687223012
+训训 13.900677652
+排污沟 13.900677652
+判卷 13.2075304714
+启运 12.5143832909
+一万间 12.8020653633
+启迪 9.93038573842
+不愤不启 13.2075304714
+扎尔科 12.2912397395
+一气之下 10.642581114
+咬牙齿 13.2075304714
+井蛙之见 13.900677652
+冯琦 11.1926274509
+驻厂 11.8212361103
+信筒 13.900677652
+光荣史 13.900677652
+耳目 8.75901409547
+明码电报 12.8020653633
+烫水 13.900677652
+变异性 11.2616203224
+贝尼特 11.9547675029
+靴形 12.8020653633
+难惹 13.900677652
+性态 11.0674643079
+逻辑关系 10.2630914922
+上海体育场 13.2075304714
+断井颓垣 12.5143832909
+特种橡胶 13.900677652
+手软 9.21854642485
+手轮 12.2912397395
+冯道事 13.900677652
+饶河 11.2616203224
+购物网 13.900677652
+放射性元素 9.71102290995
+为恶 12.1089181827
+官窑 10.2117981979
+梁宏 13.900677652
+综合排名 11.3357282945
+第四点 11.9547675029
+合法财产 11.3357282945
+讲义夹 11.8212361103
+软弱可欺 11.9547675029
+园子 8.32094782599
+说词 10.9562386728
+信笔 12.2912397395
+敲击声 10.9562386728
+吴茶清 8.81308131674
+柯灵 12.1089181827
+年产量 8.38724890581
+摇曳多姿 12.8020653633
+必有一伤 12.2912397395
+屁股后头 11.1280889297
+祛斑 11.5027823792
+一百六十两 12.8020653633
+吴庆 13.2075304714
+难怪 7.92179188707
+杜福 12.8020653633
+手边 9.91169360541
+沙伊斯 13.900677652
+张孝嵩 12.8020653633
+大洼县 13.2075304714
+阿灵阿 11.3357282945
+吉期 12.1089181827
+有过之 11.9547675029
+先帝 8.66956903512
+建筑设计 9.59661255877
+挂零 12.1089181827
+全邦民 13.900677652
+揭破 11.4157710022
+添加剂 8.84443184663
+小柜子 12.2912397395
+罢休 9.11318590919
+可持续性 8.1902506346
+当代文学 11.1280889297
+加斯帕 13.2075304714
+泥土路 13.900677652
+饶汝 11.9547675029
+溴化氢 11.7034530746
+信管 12.5143832909
+风瘫 12.8020653633
+单位矩阵 13.2075304714
+邻县 10.7226238216
+小说集 9.93038573842
+年轻漂亮 11.3357282945
+信箱 9.69598503258
+孟津县 11.7034530746
+自由锻 12.8020653633
+臭屎 12.8020653633
+无赖汉 12.8020653633
+重起炉灶 12.2912397395
+手迹 10.1394775363
+张仪相 12.8020653633
+形态学 9.72629038208
+饿死鬼 11.598092559
+轻工业 8.03420959504
+六十家 13.2075304714
+十数米 12.5143832909
+定约 11.0103058941
+定级 11.598092559
+营养状况 11.0103058941
+绿野 11.9547675029
+定线 11.7034530746
+万顷碧波 12.8020653633
+哭啼 11.1926274509
+上级指示 11.8212361103
+精密型 13.900677652
+驻华 9.55687223012
+微卫星 13.2075304714
+万古流芳 12.8020653633
+过雪梅 13.2075304714
+运动队 12.5143832909
+地久 13.900677652
+悠悠岁月 13.900677652
+宫后殿 12.5143832909
+影调 13.2075304714
+法兰西共 13.900677652
+烫洗 13.2075304714
+科威特队 13.900677652
+电除尘器 13.900677652
+专杀 12.1089181827
+荷人 13.2075304714
+生物医药 8.64318227995
+站稳立场 12.8020653633
+定置 12.1089181827
+定罪 9.5186510173
+金刀 12.1089181827
+耳石 12.8020653633
+海涵 11.0674643079
+汝宜 12.8020653633
+密封圈 12.1089181827
+大小写 11.7034530746
+网文 13.2075304714
+习尚 11.3357282945
+宣仁太后 12.8020653633
+金九银 9.59661255877
+修眉 12.8020653633
+迷你版 13.2075304714
+判别 9.77354326693
+史参奏 13.2075304714
+三十六峰 12.8020653633
+犯得着 11.4157710022
+摸金校尉 8.08356649201
+活泼地 12.5143832909
+刀枪剑戟 11.1926274509
+修真 11.598092559
+做人情 11.0674643079
+雷克雅未克 11.598092559
+揭秘 9.89334446674
+放学 9.07236391467
+仁爱之心 12.5143832909
+益精 10.7226238216
+研究社 12.1089181827
+顾名思义 10.0088573539
+判分 12.2912397395
+甘丹寺 11.5027823792
+影象 11.5027823792
+预先注定 13.2075304714
+成正觉 12.5143832909
+瓢子 13.2075304714
+丛山峻岭 12.8020653633
+难懂 10.4666904475
+判刑 9.04864738806
+厌倦 9.37888907493
+放宽 7.98717464634
+酸处理 12.8020653633
+米突 13.900677652
+水流花落 13.900677652
+安全策略 11.9547675029
+安德罗 10.0720362555
+密封垫 13.900677652
+煞气 11.598092559
+王引之 11.2616203224
+深受感动 10.2371160058
+忽听 11.1926274509
+文昭关 12.8020653633
+排气管 11.1926274509
+随之而来 9.04086524761
+小姨子 10.642581114
+贝监参 12.8020653633
+消除器 13.2075304714
+逊尼 13.2075304714
+深红色 10.4041700905
+炸掉 10.533381822
+王献斋 13.2075304714
+耐旱性 11.9547675029
+情绪低沉 12.2912397395
+难愈 11.8212361103
+被忽略了 12.2912397395
+会家不忙 12.2912397395
+倪氏 12.5143832909
+放完 11.9547675029
+色卡 13.900677652
+宾川县 12.2912397395
+江督袁 13.2075304714
+吕嘉 13.2075304714
+揭示 7.40843781696
+放对 11.9547675029
+茉莉花 9.80633308975
+包月 11.9547675029
+断简残编 13.900677652
+南南西 11.598092559
+贾岛诗 13.2075304714
+生而平等 11.7034530746
+一阵子两 13.900677652
+考试合格者 13.2075304714
+无故人 13.900677652
+古观星 13.2075304714
+受到感染 12.1089181827
+贝尼玛 12.5143832909
+焚化 9.44633035572
+怀远 10.2630914922
+灶房 10.604840786
+倒进来 13.900677652
+丁修政 13.2075304714
+风流千古 13.900677652
+高精密 11.598092559
+莫比尔 11.8212361103
+三连冠 11.9547675029
+竞技状态 12.8020653633
+甘蔗田 13.2075304714
+工农兵 10.1630080337
+卡米洛 13.900677652
+一睹芳容 13.900677652
+包机 10.8096351986
+谈判桌 10.642581114
+融水镇 13.2075304714
+悻然 12.8020653633
+和约 7.90671622467
+杜朗 12.5143832909
+订婚宴 13.2075304714
+日知会 12.5143832909
+乔其纱 12.5143832909
+反贼 9.93038573842
+向亨特 13.2075304714
+青水 12.8020653633
+汪菊潜 13.2075304714
+瓦米尔 13.900677652
+弗里德里克 11.9547675029
+格清奇 13.900677652
+类化合物 10.3171587135
+贾谧 12.5143832909
+横向沙丘 13.900677652
+采茧 12.5143832909
+定息 11.5027823792
+耐尔 12.2912397395
+东连吴 12.8020653633
+窗缝 11.5027823792
+直肠镜 13.2075304714
+网窝 13.2075304714
+修桥 10.9562386728
+贾谊 10.4994802703
+九十九个 11.8212361103
+件套 13.2075304714
+旧社会 9.10488710638
+自由诗 12.1089181827
+完颜宗 11.4157710022
+脊椎炎 12.5143832909
+在押人员 12.5143832909
+车声 11.5027823792
+英国伦敦经济学院 12.5143832909
+王家二 12.1089181827
+艾尔萨哥 12.8020653633
+内外销 13.900677652
+多年未见 12.5143832909
+锦上添花 9.82314020807
+雪山 8.48457724977
+蒲犁分 12.8020653633
+件头 13.900677652
+孙承奉 13.2075304714
+检查井 13.900677652
+海马结构 13.900677652
+件夹 13.900677652
+波尔多 9.94943393339
+起疑心 12.1089181827
+向寒秀 13.2075304714
+严灏 12.8020653633
+杜杲 11.9547675029
+网站 6.54375940962
+清炖鸡 13.900677652
+定性 8.46695564842
+邱弘济 12.8020653633
+吐鲁番地区 11.9547675029
+荒诞无稽 11.7034530746
+雪屋 13.2075304714
+横死 10.8096351986
+气喘咻咻 12.8020653633
+迪奥斯 13.2075304714
+先减 12.2912397395
+工农业 8.15128466607
+杜林 11.3357282945
+扫描仪 11.1280889297
+娘胎 10.8561552143
+刘西杰 12.2912397395
+定惊 11.7034530746
+噪声系数 13.2075304714
+定情 11.4157710022
+任顺天 12.5143832909
+韦鲁湖 13.2075304714
+路诸州 12.8020653633
+科布伦茨 12.8020653633
+雪岳 12.2912397395
+衣藻 11.598092559
+集中度 8.43684584695
+直达车 13.2075304714
+彪形大汉 11.0674643079
+有去无回 10.3453295905
+多谢您 13.2075304714
+十几声 13.2075304714
+非分 11.1926274509
+损兵折将 10.4666904475
+星子县 12.2912397395
+升降梯 13.900677652
+牢牢 8.42003872863
+定安县 13.900677652
+买来买去 13.900677652
+协同式 13.2075304714
+育种学 11.5027823792
+尖顶 9.55687223012
+开药方 11.7034530746
+受控对象 11.598092559
+若朗星 12.5143832909
+世谊 13.2075304714
+安邦定国 11.3357282945
+之喜 10.2630914922
+法简政 13.2075304714
+空前团结 13.2075304714
+长绒棉 10.9562386728
+无补于事 13.900677652
+钓到 11.598092559
+雪峰 9.13850371718
+意马心猿 12.2912397395
+遗愿 10.533381822
+莫能知 12.8020653633
+风格 5.9466565647
+揭晓 8.78868986362
+荷兰 7.04526885337
+调配法 13.900677652
+菊花茶 11.1926274509
+用心听 11.4157710022
+教练组 11.3357282945
+苏菲派 13.2075304714
+二百三十九处 13.2075304714
+耳根 9.77354326693
+佾舞 13.2075304714
+罢免 9.27570483869
+市话费 13.900677652
+诺奇 13.900677652
+手重 12.1089181827
+手里 5.95299908067
+工作效率 9.21854642485
+贝尼河 13.2075304714
+不稳平衡 13.900677652
+溴化物 11.8212361103
+四百万斤 13.2075304714
+三两碗 12.8020653633
+赚饱 13.900677652
+认知度 10.533381822
+炸糕 11.9547675029
+网箱 11.9547675029
+心广体胖 13.900677652
+路甬祥 12.2912397395
+薛永 9.84023464143
+节能产品 10.8096351986
+义勇队 10.8561552143
+钓台 12.5143832909
+走桃花运 13.2075304714
+网管 12.2912397395
+除害灭病 13.900677652
+大小便 9.82314020807
+李福正 12.5143832909
+雪崩 9.37888907493
+姜宁 12.2912397395
+爱民如子 12.1089181827
+严然 12.1089181827
+一万二千两 13.900677652
+十三公里 13.900677652
+曹家 10.2117981979
+姜家 10.8561552143
+非去 12.5143832909
+处在 6.6898591985
+穆智 12.2912397395
+钱铺 12.8020653633
+曹宅 12.2912397395
+之后 4.37684127265
+之名 8.03420959504
+一百六十五 12.2912397395
+曹官 12.8020653633
+夏秋采 13.900677652
+铅锌矿 9.89334446674
+脑死亡 11.8212361103
+东风汽车 10.4041700905
+曹宗 11.9547675029
+红红亮 13.2075304714
+处均 12.2912397395
+爱国心 11.7034530746
+射弹 11.0103058941
+肇衅 13.2075304714
+钱钞 10.9562386728
+之味 11.1926274509
+德雷贝尔 13.900677652
+孙仲谋 12.1089181827
+二十五条 13.2075304714
+惦念着 10.765183436
+网通公司 13.2075304714
+阎岚秋 13.2075304714
+焦岭 12.8020653633
+网篮 12.8020653633
+交通拥堵 9.53122979951
+背城借一 13.2075304714
+相对而坐 11.1280889297
+曹寅 13.2075304714
+残夜 13.900677652
+官方 7.035829874
+穆春 10.2897597393
+秦篆 12.1089181827
+歹心 11.8212361103
+鼓唇摇舌 13.900677652
+凡此种种 10.2897597393
+车头 9.28555713513
+黑娃引 11.9547675029
+张秀才 10.9562386728
+淳于意 12.5143832909
+远走他乡 11.4157710022
+地沥青 13.2075304714
+搜查证 13.900677652
+先写 11.4157710022
+拜堂 10.6818018271
+学生公寓 12.1089181827
+洁癖 11.598092559
+难缠 10.642581114
+封长平 12.2912397395
+车夫 10.1394775363
+驱动轮 12.2912397395
+李光 9.69598503258
+巴悦色 12.8020653633
+空气阻力 10.9562386728
+十层楼 13.900677652
+常见故障 12.8020653633
+宗调露 13.2075304714
+延徽寺 12.8020653633
+包票 12.2912397395
+车外 10.4666904475
+殷忧启圣 13.900677652
+原生质 9.98865464655
+洪水泛滥 10.2897597393
+乌沙科夫 11.1280889297
+厌世 11.3357282945
+心耳 11.8212361103
+梦境 9.22784881751
+和缓 9.01032852375
+疲累 10.4349417492
+洁白 8.35160156708
+雷雨大风 13.2075304714
+无儿无女 11.1926274509
+太强大 12.2912397395
+半主动 10.765183436
+任东阁 13.2075304714
+巴拉圭人 12.1089181827
+手部 10.1630080337
+陆耕水 12.8020653633
+无纺布 11.9547675029
+曹学 12.8020653633
+转折期 13.900677652
+猕猴 9.18217878068
+悬梁自尽 10.8561552143
+贷款 5.67356941763
+超平面 13.900677652
+异装癖 13.900677652
+严刑峻罚 13.2075304714
+洛阳人 10.4349417492
+数过来 13.900677652
+焦尔 11.598092559
+巢壁 12.8020653633
+端粒酶 11.9547675029
+之哉 12.1089181827
+橡胶林 12.8020653633
+苏皮卢 13.900677652
+打埋伏 12.2912397395
+拉戈斯 13.900677652
+酷虐 11.8212361103
+第一招 11.9547675029
+书记长 11.7034530746
+顶真 12.1089181827
+逻辑设计 12.2912397395
+柯氏 11.9547675029
+六七千元 13.900677652
+平山县 10.0720362555
+包立 11.0674643079
+克罗地亚语 11.7034530746
+宰执中 13.2075304714
+小命儿 12.5143832909
+拜官 12.2912397395
+官震肃 13.2075304714
+谈心活动 13.2075304714
+之地 6.808103936
+假门 13.900677652
+贝族 13.2075304714
+落马 9.08039608637
+严父 12.5143832909
+有怡刚 12.8020653633
+遗书 8.81927328699
+龚自珍 10.8096351986
+河滩地 11.2616203224
+草芽 12.1089181827
+和烯醇 12.8020653633
+龙泉窑 10.9049453784
+夏风帮 13.2075304714
+焦心 10.8561552143
+拜客 11.3357282945
+卫浴间 13.900677652
+西之罗 13.2075304714
+提早到 12.5143832909
+碘化氢 12.8020653633
+草芥 10.6818018271
+美菱电器 8.89673134603
+香木 11.9547675029
+王仁裕 13.2075304714
+黄水中 12.5143832909
+焦德 13.2075304714
+登高一呼 11.5027823792
+以偏概全 11.3357282945
+克尔得 12.8020653633
+遗下 10.642581114
+马奔腾 13.2075304714
+娘舅 10.1394775363
+达到高潮 9.96885201925
+集中管理 10.765183436
+伏击战 11.2616203224
+焦循 12.2912397395
+日暮途远 13.900677652
+汝兄弟 12.8020653633
+见识一下 11.9547675029
+贩毒分子 13.900677652
+看得清 11.1280889297
+毫无办法 9.91169360541
+克谯城 13.2075304714
+拜寿 10.533381822
+络合作用 13.900677652
+信服 9.56994431169
+碧荧荧 13.2075304714
+汤象龙 13.2075304714
+草苫 12.8020653633
+定房 12.8020653633
+卫生死角 13.2075304714
+钟祥市 12.8020653633
+孟津伐 13.2075304714
+汤峪温泉 13.2075304714
+周南女 12.8020653633
+邻伍 13.2075304714
+擦过 11.5027823792
+巢室 11.9547675029
+平山区 13.2075304714
+做戏 10.533381822
+方司主 12.1089181827
+孙承宗 11.3357282945
+八百户 13.900677652
+打高尔夫 11.9547675029
+授权人 12.8020653633
+财政政策 7.14957618304
+杜文 12.8020653633
+张国庆 9.02548032877
+三百五十二万二千一百六十三 13.2075304714
+风格各异 10.765183436
+顶刮刮 13.900677652
+澳大利亚联邦 11.0674643079
+李校书 12.2912397395
+杜斌 12.5143832909
+女犯人 13.2075304714
+做成 7.89186446653
+附子 10.1394775363
+桑塔纳 10.8096351986
+荷包 8.98069672615
+姜堰 12.2912397395
+燕子岩 13.900677652
+须鲸 12.2912397395
+东亚银行 10.1871055853
+焚书 10.9562386728
+第六十六 12.5143832909
+朱子学 12.8020653633
+抛戈弃甲 13.900677652
+言行录 13.2075304714
+谷两石 13.2075304714
+张昭疑 12.8020653633
+杜斯 11.9547675029
+芬克尔 12.8020653633
+柯河 12.2912397395
+趋利 10.9562386728
+葫芦巴 13.900677652
+色感 13.2075304714
+最优设计 12.5143832909
+许靖奏 13.2075304714
+色丝 13.900677652
+遗事 11.2616203224
+和卫 13.900677652
+防窃听 13.2075304714
+训练 6.6493326686
+芳樟醇 12.8020653633
+宋元东 11.9547675029
+藏宝之 13.900677652
+数据网络 12.8020653633
+快门 10.9562386728
+遗产 8.37522471284
+苏泊尔 10.8096351986
+判例 9.96885201925
+质次价高 13.900677652
+教与学 12.8020653633
+长生久视 13.900677652
+色丹 12.8020653633
+量水槽 13.900677652
+放出去 10.0940151622
+敢为天下先 12.8020653633
+安哈尔特 12.8020653633
+翻江倒海 10.4994802703
+沐浴液 13.900677652
+穆斯 11.2616203224
+耳毛 13.900677652
+克鲁泡 11.8212361103
+疾风骤雨 11.7034530746
+嘲笑 8.2273543848
+坦登 13.900677652
+绿谷 13.900677652
+市辖区 10.0720362555
+草莓 9.62401153296
+尉高俅 12.5143832909
+布鲁克 9.84023464143
+遗体 8.51160592216
+采芹 13.2075304714
+遗作 11.3357282945
+竭力 7.51379833261
+驻京 10.0720362555
+次生林 9.55687223012
+方琼 12.2912397395
+王仁美 9.22784881751
+草莽 10.3171587135
+草莱 11.8212361103
+加雅涅 13.2075304714
+修正 7.44233936863
+修武 10.8096351986
+改性纤维 13.2075304714
+落魄 9.63799777493
+挖进去 12.2912397395
+王明芳 11.8212361103
+整本书 13.2075304714
+败火 12.1089181827
+葫芦山 12.8020653633
+地方史 11.7034530746
+定指 13.900677652
+雪影 13.2075304714
+罗斯冰 12.8020653633
+缺心眼 12.1089181827
+酱牛肉 11.598092559
+医药工业 10.4994802703
+判为 10.5684731418
+莱芒湖 12.8020653633
+不太想 12.1089181827
+化工市场 12.5143832909
+大智大勇 11.9547675029
+草菇 11.0674643079
+特拉西梅诺湖 12.5143832909
+杯弓蛇影 11.8212361103
+出车祸 12.1089181827
+遗传 7.57631868959
+韩恒 13.2075304714
+达梅尔 13.900677652
+包管 10.6818018271
+观测站 10.4994802703
+特定场合 12.5143832909
+绿豆 8.74162235276
+轻工厅 13.2075304714
+尕斯库勒 12.5143832909
+包箱 13.900677652
+黑社会 9.07236391467
+屋架 11.8212361103
+姜夔 10.9562386728
+甘井子 12.8020653633
+耐德 13.900677652
+判令 11.0674643079
+第一战 13.900677652
+钓具 13.2075304714
+反射器 11.598092559
+红白喜 12.2912397395
+元旦 8.48457724977
+遗俗 12.1089181827
+二十五斤 12.5143832909
+雨天 10.0294766411
+杂交亲本 13.900677652
+建国路 13.900677652
+射得 10.9049453784
+反面教材 12.1089181827
+姚崇出 12.8020653633
+耐得 10.6818018271
+杜撰 10.2897597393
+剔牙 11.9547675029
+旦角儿 13.900677652
+毛细血管 8.93783302172
+儒生 8.89004235788
+葫芦岛 10.6818018271
+地方化 12.2912397395
+严州 11.8212361103
+先兄 12.2912397395
+开罗宣言 11.598092559
+消水肿 13.2075304714
+巡航 9.25628675283
+穆家哥 13.2075304714
+以资鼓励 13.2075304714
+梁宽 12.8020653633
+官服 9.53122979951
+天津师范大学 13.2075304714
+邻人 10.5684731418
+没治了 13.900677652
+十瓶酒 13.900677652
+草草 9.20932976975
+霹雳舞 12.8020653633
+阴有异 13.2075304714
+百分之三左右 12.8020653633
+输入电阻 13.900677652
+配水管网 13.900677652
+之国 9.06439574502
+非典 9.82314020807
+南剑州 11.7034530746
+姜女 12.5143832909
+赵伯驹 12.2912397395
+曹奂 12.5143832909
+影都 11.1926274509
+非其 11.5027823792
+财政性 11.7034530746
+科龙 10.765183436
+非公 10.4666904475
+已近尾声 11.1280889297
+草药 9.45802639549
+益性 13.2075304714
+公事房 12.5143832909
+盈满 11.0674643079
+手锣 13.900677652
+晋阳之甲 13.900677652
+岫岩县 13.2075304714
+毒计 10.9049453784
+浅蓝色 10.1394775363
+处分 7.83225206373
+边界线 10.6818018271
+风波 8.26232298264
+网线 11.2616203224
+瓜分豆剖 12.8020653633
+祖先崇拜 9.66657114738
+太原卫星发射中心 12.8020653633
+毛里坦 12.5143832909
+雪堤 13.900677652
+狮子狗 12.8020653633
+永清 11.2616203224
+研究所 6.20947755445
+炸破 11.9547675029
+处刑 11.0103058941
+炼化 11.1280889297
+再试 11.5027823792
+重庆市 8.3285236198
+汽配城 12.5143832909
+启门 13.900677652
+瑞士联合银行 12.5143832909
+饶益 13.900677652
+做事 7.98988100794
+奢侈 8.48457724977
+水克火 11.8212361103
+金口玉言 12.2912397395
+迷途 10.5684731418
+雪堆 10.9562386728
+马军步 12.2912397395
+哈福兹 12.8020653633
+亨德森 11.9547675029
+做操 12.5143832909
+哲学评论 12.8020653633
+副理事长 9.06439574502
+临风对月 13.900677652
+这样儿 10.1871055853
+手镯 9.93038573842
+北流市 13.2075304714
+汽缸 10.533381822
+得陇望蜀 12.5143832909
+幸福快乐 12.8020653633
+之兵 8.76487921493
+类股票 8.30225569298
+一九五六年 11.8212361103
+奸宄 11.3357282945
+弗罗林 12.8020653633
+径自 9.02548032877
+毛月亮 13.2075304714
+之光 9.54396882529
+教条化 12.2912397395
+网络 6.20947755445
+压挤 12.8020653633
+水杨酸甲酯 12.5143832909
+风沙 8.5440913773
+中年男人 10.3453295905
+睁开眼 9.08039608637
+啜饮 11.9547675029
+落后者 12.5143832909
+四十员 13.2075304714
+贡嘎县 13.2075304714
+修水 9.93038573842
+手镜 13.900677652
+王铁口 9.27570483869
+获得好评 10.6818018271
+之冠 8.76487921493
+缄口不言 11.598092559
+第一分钟 13.900677652
+武装人员 10.765183436
+风池 12.2912397395
+山卸岭 10.3171587135
+财政权 12.8020653633
+车尾 9.96885201925
+代杨镐 12.8020653633
+沃克林 13.900677652
+假日酒店 10.8096351986
+红粉佳人 12.2912397395
+雨带 10.6818018271
+益权 12.2912397395
+责任法 11.8212361103
+雨帘 12.2912397395
+炸碎 11.598092559
+布鲁图 11.8212361103
+之内 6.61998045659
+曹帅 8.96620371885
+浪漫气质 12.1089181827
+栗木 12.2912397395
+奥庆哈 13.900677652
+雨师 11.9547675029
+食品饮料 7.72066099832
+炼厂 9.93038573842
+函调 12.5143832909
+吕头 13.900677652
+灶神 11.0674643079
+映红 11.5027823792
+乒乓外交 13.900677652
+焦头 13.900677652
+协同学 11.8212361103
+样张 12.8020653633
+二者之间 9.89334446674
+袁绍若 13.900677652
+再讨 13.2075304714
+炼句 12.5143832909
+当家人 10.7226238216
+免疫放射 13.900677652
+师从 9.40086798165
+程务挺 12.5143832909
+非对抗性 12.8020653633
+手闸 13.2075304714
+风水 7.62591563073
+倡导 7.6165434909
+严师 12.1089181827
+影音 10.9049453784
+会客室 9.87532596124
+一枕黄粱 12.5143832909
+车展 8.37921673411
+样式 8.28754954559
+价值观念 9.7898037878
+康居诸 13.2075304714
+有例可援 12.8020653633
+雨幕 11.0103058941
+厌憎 12.8020653633
+榆木脑袋 12.5143832909
+修治 10.765183436
+饱暖思淫 13.900677652
+稀有气体 10.7226238216
+风气 8.52539924429
+甘蔗渣 11.3357282945
+炼制 9.45802639549
+依阿华州 13.2075304714
+伯明氏 12.8020653633
+排气口 11.9547675029
+掌本府 13.2075304714
+伏尔加 10.0088573539
+鸣管 13.2075304714
+揭掉 10.765183436
+金狮奖 12.1089181827
+信息 5.25386069277
+宋邓名 12.8020653633
+修浚 11.5027823792
+黄忠谓 13.2075304714
+雪天 10.4994802703
+雪夫 13.900677652
+难管 13.2075304714
+八百斤 11.9547675029
+面红耳赤 10.0088573539
+爽身粉 11.9547675029
+雪夜 10.533381822
+敛衣 12.5143832909
+文教界 13.900677652
+长期以来 7.86280673205
+中国馆 12.1089181827
+太史儋 13.2075304714
+福克斯公司 12.5143832909
+栗暴 12.2912397395
+葫芦娃 13.900677652
+八百文 12.5143832909
+玉檀惊 13.2075304714
+定数 10.0940151622
+狮子王 11.8212361103
+懂礼貌 13.2075304714
+九平方米 12.1089181827
+修洁 12.8020653633
+太史公 10.9562386728
+生物制药 9.09665660724
+恒定电流 11.7034530746
+美国麻省理工学院 10.8561552143
+赵公元帅 12.5143832909
+约克角 12.5143832909
+巢居 12.5143832909
+虎跑泉 11.8212361103
+安德斯 12.2912397395
+缄口不语 12.2912397395
+王威廉 13.900677652
+戳记 11.598092559
+以弱胜强 11.3357282945
+非常感激 11.0674643079
+影院 9.40086798165
+旅大市 12.8020653633
+安德施 13.900677652
+附加值 9.10488710638
+雨帽 11.7034530746
+韵白 11.7034530746
+曹志 11.4157710022
+吴州 11.8212361103
+拜尔 11.598092559
+于越王 13.900677652
+比里亚 13.2075304714
+手钩 13.900677652
+利伯河 13.900677652
+专有 9.72629038208
+马铃薯泥 13.900677652
+附属 7.8604229407
+后脑勺子 13.900677652
+穆拉 10.4041700905
+平常人 10.7226238216
+内外部 9.72629038208
+滑铁卢战役 11.7034530746
+哭丧 11.2616203224
+加征练 11.5027823792
+镌镂 13.900677652
+益智 10.6818018271
+雄性激素 10.2630914922
+称之为 7.24138373229
+风流 8.49350588052
+定下 8.61747392324
+迷醉 10.9049453784
+哭个 10.4666904475
+鸣笛 11.0674643079
+葛洛 11.5027823792
+慢板 10.8561552143
+俄罗斯太平洋舰队 13.900677652
+定时 8.71329184614
+第四步 11.598092559
+曼哈顿岛 12.5143832909
+损失率 11.0674643079
+附小 11.598092559
+衣肩 13.900677652
+影雕 13.900677652
+诸大藩 12.8020653633
+索格狄 11.9547675029
+雨影 10.5684731418
+几百米 9.80633308975
+曹彦 13.2075304714
+獾猪 12.8020653633
+影集 12.8020653633
+网罩 11.7034530746
+曹彰 12.2912397395
+索县 11.8212361103
+柯比 13.900677652
+手链 11.9547675029
+徐士昌 11.5027823792
+杜拉 11.5027823792
+网网 13.900677652
+起码 7.8604229407
+网罗 9.94943393339
+库伯瓦 13.2075304714
+遭抢 13.2075304714
+吐鲁番市 11.4157710022
+网罟 13.900677652
+岌岌可危 9.71102290995
+手铐 10.0505300503
+十数杯 13.2075304714
+风洞 10.0088573539
+道路以目 13.900677652
+诉苦 9.59661255877
+省港大罢工 10.7226238216
+支基利 13.900677652
+吞食 9.09665660724
+第十节 13.900677652
+攥紧 10.765183436
+一个一米 12.8020653633
+于洛州 12.8020653633
+包络 11.7034530746
+包给 11.0103058941
+官拜 10.604840786
+车座 11.0674643079
+必修课 10.9562386728
+初等变换 12.5143832909
+升级 6.73983174531
+衣草 13.900677652
+车库 10.1394775363
+山之术 11.8212361103
+车底 9.29550746599
+广州军区空军 12.5143832909
+丁杀季 13.2075304714
+介绍所 11.0674643079
+车府 12.2912397395
+莆仙戏 12.2912397395
+睡个痛快 13.900677652
+能化成 13.900677652
+乱征 13.900677652
+铐起来 12.5143832909
+巴克纳 13.2075304714
+刘鼎 12.8020653633
+颌面部 11.598092559
+车床 10.2630914922
+中国石油天然气集团 13.2075304714
+三千多种 13.2075304714
+手面 11.598092559
+寅虎 12.8020653633
+隐射 12.1089181827
+班失仪 13.2075304714
+铁叶子 11.5027823792
+一九三八年 11.1280889297
+文具厂 13.2075304714
+配出来 13.900677652
+胞外酶 13.900677652
+二星级 12.5143832909
+华金 13.2075304714
+拜忏 12.5143832909
+磷化合物 11.9547675029
+邵元冲 13.2075304714
+葫芦套 13.900677652
+定是 9.46986085313
+纳马人 12.2912397395
+长垣县 10.9049453784
+修渠 11.598092559
+党御史 12.8020653633
+柯桥 12.5143832909
+免疫抑制 11.4157710022
+官报 11.8212361103
+诈伪 11.7034530746
+生长习性 12.5143832909
+九八 12.5143832909
+唐僧脱 12.5143832909
+自我改造 12.2912397395
+芗剧 12.8020653633
+研究性 11.9547675029
+棉花球 12.8020653633
+烷氧基 12.2912397395
+无一幸免 10.9049453784
+非君 12.8020653633
+杜里调 12.5143832909
+遗嘱继承 11.1926274509
+神经再生 13.900677652
+冲动型 12.5143832909
+平喉 13.900677652
+非同 10.7226238216
+时无卫 13.2075304714
+车带 13.900677652
+风湿 10.0088573539
+每日新报 13.2075304714
+明叔正 13.2075304714
+附录 9.36807815882
+歌仔戏 12.1089181827
+甘蔗汁 12.8020653633
+戈扬盾 13.900677652
+埃帕米 12.2912397395
+殉葬品 10.9049453784
+淅沥 11.8212361103
+狄立克 13.900677652
+车市 8.4980002701
+第四桩 13.2075304714
+一言以蔽之 11.5027823792
+南充人 12.2912397395
+编译局 11.7034530746
+藏族人 11.4157710022
+剔着 11.9547675029
+随风飞舞 13.900677652
+成千成万 11.7034530746
+怀集 11.7034530746
+状物 9.6811699468
+一国两制 10.4349417492
+密封件 12.5143832909
+委员会制 11.4157710022
+贝壳类 12.5143832909
+六国论 12.8020653633
+黄忠连 13.2075304714
+当间 11.4157710022
+大鱼际 12.8020653633
+唐古拉山脉 10.4994802703
+菜市场 10.0505300503
+第四根 12.8020653633
+像片 10.7226238216
+胡萨克 12.1089181827
+诉至 11.4157710022
+高栏 10.9049453784
+比重计 13.900677652
+草虫 10.6818018271
+和硕 9.93038573842
+奋发有为 11.3357282945
+愚蠢地 11.7034530746
+营运商 12.1089181827
+一万贯 12.5143832909
+之变 8.78268383956
+九流三教 13.2075304714
+四百万两 13.900677652
+阿鲁科尔沁旗 12.8020653633
+无私无畏 12.8020653633
+赫茨伯格 13.900677652
+南惠庭 13.900677652
+之别 9.10488710638
+令节 13.900677652
+之利 8.71329184614
+许靖华 13.2075304714
+拜庙 13.900677652
+辣椒面 11.8212361103
+符合条件者 13.2075304714
+领款 13.2075304714
+鸣禽 11.7034530746
+摧垮 11.4157710022
+深刻思想 13.900677652
+迪奥拉 12.8020653633
+之刃 13.900677652
+使君子 11.2616203224
+钱江晚报 11.5027823792
+边灯 13.2075304714
+赵云谏 12.8020653633
+痴迷 9.59661255877
+信手 11.0674643079
+纳马柳 13.900677652
+酷肖 11.8212361103
+温文儒雅 12.2912397395
+之列 8.28027678626
+白炽灯光 13.900677652
+控制权 8.77671367257
+肇端 12.1089181827
+难禁 10.3743171274
+索维林 12.1089181827
+鱼化龙 12.2912397395
+之初 7.57452817882
+撒丁 10.3453295905
+单宁酸 11.9547675029
+能言快语 13.2075304714
+杜恒 12.5143832909
+定有 9.96885201925
+宛子 13.2075304714
+凫水 12.1089181827
+太原战役 13.2075304714
+没脸见人 11.7034530746
+人民政协 11.7034530746
+克利克 12.5143832909
+定期 6.79571220371
+十里铺 11.9547675029
+特别奖 9.98865464655
+附加刑 11.598092559
+狗血喷头 11.4157710022
+令人发指 10.9049453784
+能跑能跳 13.900677652
+饮片 12.1089181827
+绿衣 11.2616203224
+高资费 13.900677652
+分内之事 11.3357282945
+定本 11.1926274509
+高丽人 13.2075304714
+近理 13.900677652
+克利兰 13.2075304714
+补贴款 11.8212361103
+递给 7.41757030052
+之前 5.19352547664
+之剑 10.3743171274
+桃羞杏让 13.900677652
+附庸 9.74179456862
+曹州 10.9049453784
+饮宴 9.6811699468
+十数日 11.1926274509
+拜帖 10.1164880181
+儆戒 12.8020653633
+保存实力 10.8096351986
+波尔塔 13.2075304714
+张国宝 10.5684731418
+唐僧背 13.900677652
+雪害 12.5143832909
+之劳 10.7226238216
+贾让 12.8020653633
+宋建文 13.2075304714
+饮子 11.8212361103
+车弩 13.2075304714
+包罗 10.9049453784
+草衣木食 13.2075304714
+之势 7.38300637906
+拜师 10.4666904475
+好大喜功 10.642581114
+管理模式 9.40086798165
+金瓦寺 12.5143832909
+保翊冲 13.2075304714
+绿袖 11.1280889297
+贡德尔 13.2075304714
+八千余户 13.2075304714
+思维习惯 12.8020653633
+甲硝唑 11.8212361103
+国民大会 9.7898037878
+之力 8.37124856446
+地役权 11.4157710022
+之功 8.42421410004
+处决 9.12999302751
+百万吨级 11.598092559
+曹嵩 11.8212361103
+车影 13.900677652
+和祥 13.900677652
+信报 11.1280889297
+兰室 13.900677652
+背水阵 13.900677652
+淅淅 11.9547675029
+闭住 9.85762638414
+荔枝林 13.2075304714
+唐僧肉 11.598092559
+世贸 10.1164880181
+饶申 12.8020653633
+手雷 11.1926274509
+聚众闹事 11.598092559
+严范孙 13.2075304714
+克鲁格 11.2616203224
+耐寒 9.12999302751
+山水诗 10.9562386728
+拜年 9.40086798165
+石冰川 12.8020653633
+钦博拉索山 12.8020653633
+附带 9.29550746599
+悦耳动听 11.598092559
+沈宝钧 13.2075304714
+涡轮轴发 12.8020653633
+那水养 13.900677652
+一首一首 13.2075304714
+绿装 12.8020653633
+贾评 10.533381822
+难倒 10.9562386728
+巡边员 13.900677652
+定案 10.3743171274
+雨势 11.5027823792
+桑嘉措 11.8212361103
+渔樵 11.4157710022
+饮品 9.98865464655
+交通管理 8.90346537821
+两句诗 10.4666904475
+草袋 12.5143832909
+橘黄色 11.4157710022
+哥伦比亚号 11.3357282945
+贝壳状 11.1280889297
+多几百元 13.900677652
+梁君 12.8020653633
+食物中毒 9.75754292558
+字迷 13.2075304714
+拦路石 12.8020653633
+安德森 10.2630914922
+做梦 7.86999239171
+掌管 7.75864024639
+克鲁柏 13.900677652
+风情 8.90346537821
+陈伯玉 13.2075304714
+雪后 10.4666904475
+哭哭笑笑 13.2075304714
+三百六十日 12.5143832909
+快审快结 13.900677652
+菜碟 12.5143832909
+败笔 12.1089181827
+匀脸 13.900677652
+贴补家用 11.598092559
+工厂区 11.0674643079
+附册 13.900677652
+九回 11.0674643079
+古思帖 12.8020653633
+子蔚停 13.2075304714
+历代祖先 13.2075304714
+定标 11.9547675029
+何新 11.9547675029
+克西凉 13.2075304714
+大袄 12.2912397395
+金文陈 13.2075304714
+理解能力 11.3357282945
+北朝鲜 10.7226238216
+演讲会 13.900677652
+太平无事 11.2616203224
+盘旋 8.30969067146
+径路 11.9547675029
+徐叔 12.8020653633
+坡缕石 13.2075304714
+除息日 9.71102290995
+定格 10.4994802703
+教条式 12.8020653633
+三百六十斤 13.900677652
+饕餮之徒 12.8020653633
+怕只怕 11.9547675029
+帕索斯 11.9547675029
+落选 10.3743171274
+烈性 9.89334446674
+国际局 11.4157710022
+刚出生 10.533381822
+奚王萧 13.2075304714
+建筑声学 11.8212361103
+工商时报 10.1394775363
+祝酒 11.5027823792
+缸盆 13.900677652
+宗赵煦 13.2075304714
+雅量 11.8212361103
+弗拉海 11.8212361103
+西南地区 8.26232298264
+曾志远 11.3357282945
+副高级 13.900677652
+唐僧进 13.900677652
+砧木 10.6818018271
+旁遮普 9.65218240993
+四十不惑 13.2075304714
+孙博士 13.2075304714
+鸡毛掸子 11.5027823792
+避雷器 11.0674643079
+玉米棒 12.8020653633
+岔气 11.598092559
+生物进化 9.58318953844
+鲁庄公子 12.8020653633
+抑郁寡欢 13.900677652
+曹刘 13.2075304714
+鸦片 8.25877058104
+更上层楼 13.2075304714
+泰夫姆 12.2912397395
+万春园 12.2912397395
+巢军 13.2075304714
+郭氏家族 13.900677652
+非婚 13.900677652
+夏威夷州 11.5027823792
+柔性化 13.2075304714
+不可胜举 13.2075304714
+一花独放 13.900677652
+砧板 11.3357282945
+涸泽而渔 12.8020653633
+有礼 10.4666904475
+之差 9.14708746087
+购销员 13.900677652
+表示感激 11.598092559
+白斩鸡 13.900677652
+民航业 10.0505300503
+径赛 11.9547675029
+官民 9.40086798165
+繁花似锦 11.2616203224
+官气 11.4157710022
+精简人员 13.2075304714
+申州 12.8020653633
+渐低 11.0674643079
+摹绘 12.8020653633
+厉天闰 12.8020653633
+网片 13.2075304714
+雨前 12.5143832909
+英华殿 11.2616203224
+亿韩元 13.2075304714
+车况 10.2897597393
+姜原 13.900677652
+那粒红 13.2075304714
+索夫斯 13.900677652
+苍梧 10.6818018271
+刘晓东 12.2912397395
+曹县 11.0103058941
+羞惭 9.80633308975
+糖异生 13.2075304714
+车师 10.4994802703
+阿斯巴甜 11.8212361103
+十四行诗 10.5684731418
+柯本 12.5143832909
+信汇 12.2912397395
+孤立主义 11.1280889297
+含油层 12.5143832909
+抽象思维 10.9049453784
+白湖子 13.2075304714
+再也不会 9.26594866375
+多管闲事 10.8561552143
+提出申请 9.91169360541
+车内 8.19356738723
+水力发电站 11.1926274509
+夔峡 12.1089181827
+惠山区 12.8020653633
+信江 10.1871055853
+深圳特区 7.63537643924
+定植 10.9562386728
+人口学 10.4041700905
+第四枚 13.900677652
+新加坡海峡 11.2616203224
+近火先焦 13.900677652
+醉八仙 13.900677652
+胡耀邦 10.8561552143
+满灰尘 12.2912397395
+马祖常 12.2912397395
+曹司 11.9547675029
+翩翩年少 13.900677652
+平均海拔 8.25523075433
+墓葬群 10.4041700905
+钓客 12.2912397395
+冀热察 12.2912397395
+痘苗 13.2075304714
+哈尔滨工业大学 11.1926274509
+沈黎郡 12.5143832909
+发一分光 13.2075304714
+之屋 12.1089181827
+西西伯利亚 10.5684731418
+眼结膜 11.3357282945
+曹参 10.9049453784
+宗王居 13.2075304714
+随机应变 9.80633308975
+坏名声 11.7034530746
+农业中学 11.9547675029
+从先帝 13.900677652
+那虞候 12.8020653633
+殷裔 13.2075304714
+分别编 11.9547675029
+雨区 11.0674643079
+莱茵河 9.20932976975
+焦味 12.8020653633
+拜倒 10.4994802703
+杜源 12.2912397395
+图兰多 12.8020653633
+发射装置 9.01032852375
+职工代表 10.2117981979
+孟珠 13.900677652
+像素 11.1926274509
+柯枝 11.7034530746
+淡化处理 13.900677652
+萌渚岭 11.5027823792
+鲍二媳妇 13.900677652
+难眠 11.4157710022
+处得 10.9562386728
+数十万件 13.2075304714
+又生 10.3171587135
+苏来曼 13.900677652
+毫无准备 10.765183436
+汪裕泰 13.2075304714
+难看 8.5488195185
+之岛 11.8212361103
+平山堂 11.598092559
+第四条 10.1871055853
+和睦 9.62401153296
+第四期 10.604840786
+菅野 13.900677652
+几千几万 13.900677652
+车兵 10.5684731418
+非子 12.2912397395
+书名索引 13.900677652
+映现 11.7034530746
+黑底 11.8212361103
+魔鬼身材 12.2912397395
+找来找去 11.5027823792
+元曲 10.4041700905
+几微米 12.2912397395
+初婚 12.5143832909
+厚谊 13.900677652
+自由舰 13.2075304714
+二皮脸 13.2075304714
+柯柯 11.9547675029
+导水管 12.8020653633
+乘其不备 11.598092559
+大仁大义 13.900677652
+杰布 13.2075304714
+停车费 11.1280889297
+白云悠悠 12.8020653633
+生颍川 13.2075304714
+窄条 12.5143832909
+官派 13.900677652
+场站 11.4157710022
+三百五十一里 13.2075304714
+核糖体 10.4994802703
+王公大人 13.2075304714
+荷塘 11.598092559
+绵绵不绝 11.7034530746
+估算 7.79811905736
+替天行道 9.74179456862
+网点 7.97375162601
+三十员 13.2075304714
+半晌方 11.5027823792
+杜洛 13.2075304714
+解析度 12.8020653633
+第二家 9.6811699468
+罢宴 11.9547675029
+钱临照 12.8020653633
+放个 10.5684731418
+渗透活动 13.900677652
+慌作一团 13.2075304714
+躬冒矢石 13.900677652
+状纸 11.9547675029
+籀篆 13.2075304714
+拿来 7.64109618791
+曼哈顿区 11.8212361103
+陈仁 12.1089181827
+起诉书 11.0674643079
+独生女 11.4157710022
+淇澳 12.8020653633
+包埋 11.2616203224
+耍两面派 13.2075304714
+汝知吾 13.2075304714
+边行军 13.2075304714
+意大利式 11.2616203224
+那才真 11.1926274509
+改行从善 13.2075304714
+放上 9.74179456862
+放下 6.6090214428
+购物款 13.2075304714
+抗拉强度 10.765183436
+罢官 9.30555780184
+擒贼先擒王 11.7034530746
+专家论证 11.8212361103
+拜受 11.1926274509
+真值表 11.5027823792
+克鲁斯 11.9547675029
+郑晓 11.0103058941
+广告部 12.2912397395
+黄鲁直 13.2075304714
+之影 12.1089181827
+诸部赐 12.8020653633
+满山满 12.8020653633
+坡田 13.900677652
+修成 9.17328983326
+温煦地 13.2075304714
+叶凯士 11.8212361103
+鲁连 13.900677652
+马军放 13.900677652
+定作 13.900677652
+资信度 13.2075304714
+你一言 12.1089181827
+蜘蛛洞 12.8020653633
+受折磨 11.5027823792
+老资格 9.93038573842
+炕下 10.8096351986
+十几套 12.5143832909
+那灵霄 13.2075304714
+成德文 13.900677652
+旁观者清 10.9562386728
+金管局 9.24671730182
+三室一厅 12.2912397395
+径迹 11.0103058941
+寓处 13.2075304714
+中国社会科学院研究生院 10.9562386728
+潜艇队 12.1089181827
+放人 9.72629038208
+当得上 13.900677652
+风扬 13.2075304714
+偿债 8.83177344976
+研究法 10.3743171274
+塔什库尔干塔吉克自治县 11.8212361103
+平易近人 10.604840786
+忙昏了头 12.5143832909
+自然实验 13.900677652
+巢县 11.3357282945
+八千余 11.9547675029
+梁代顾 13.2075304714
+徭役地租 13.2075304714
+三五回 12.8020653633
+潘频模 13.2075304714
+书童 10.1871055853
+半机械化 12.5143832909
+黄梁 13.900677652
+车列 12.2912397395
+站前区 13.2075304714
+陈定生 10.642581114
+风扇 9.58318953844
+车刀 12.8020653633
+之徒 8.80081122415
+中国队 9.63799777493
+包特 13.2075304714
+放于 10.533381822
+常有林 11.8212361103
+处理厂 10.0505300503
+邑宰 12.8020653633
+放任 9.96885201925
+之忧 9.62401153296
+圣地亚哥市 13.2075304714
+苏斯特 13.900677652
+黄石港区 13.2075304714
+披枷带锁 13.2075304714
+井岗山 12.8020653633
+曹健 13.900677652
+荥经 12.5143832909
+吕堰 13.2075304714
+粗提物 13.900677652
+罗伊特 11.9547675029
+样儿 8.6966709649
+庞加莱 10.3171587135
+有何不可 10.2897597393
+之心 7.3741827924
+耳房 9.80633308975
+记录仪 9.82314020807
+寒亭区 13.900677652
+检验所 12.8020653633
+凭险 10.4041700905
+单生茎 13.900677652
+焦土 11.4157710022
+诗思 12.5143832909
+公子哥儿 10.765183436
+立国之本 11.3357282945
+宋仪望 12.1089181827
+车削 11.5027823792
+宣战案 12.1089181827
+携程网 12.1089181827
+近来可好 13.2075304714
+巴克特 12.8020653633
+铁的事实 11.9547675029
+绿萼 12.5143832909
+反避税 13.2075304714
+桤木 11.9547675029
+易受侵犯 13.900677652
+姜农 13.900677652
+雪地 8.62767809341
+倒悬之苦 11.9547675029
+地译成 12.8020653633
+车厢 8.50705010562
+婚姻登记 9.98865464655
+杜氏 11.5027823792
+非如 12.5143832909
+开普勒 10.2371160058
+党政部门 11.5027823792
+张发奎 11.2616203224
+地方官 8.60236028543
+王先生 8.89004235788
+冠军队 12.8020653633
+承建方 12.8020653633
+三百七十万四千二百八十一两 13.2075304714
+车厂 12.1089181827
+为生 7.87723005901
+张少华 12.5143832909
+定死 12.5143832909
+梁山伯 10.4349417492
+第四日 11.4157710022
+出境游 10.8096351986
+通同作弊 12.2912397395
+拜勒 11.8212361103
+盲聋哑 12.1089181827
+车号 11.1280889297
+修持 9.91169360541
+那双竹 13.900677652
+六十一 11.0674643079
+六十七 11.598092559
+钟玉磬 13.2075304714
+梅山水库 12.2912397395
+六十万 9.93038573842
+之年 9.58318953844
+六十三 11.3357282945
+雨布 11.8212361103
+走头无路 12.5143832909
+以理服人 11.7034530746
+零零散散 11.7034530746
+杜汉 12.8020653633
+猴类 11.0674643079
+唐僧谢 12.5143832909
+商家 7.9526426628
+冷处理 12.2912397395
+第四方 13.2075304714
+诸部豪 13.2075304714
+长青藤 13.900677652
+附加 8.1902506346
+十多公里 13.2075304714
+臂架 12.1089181827
+萧疏鬼 13.2075304714
+六十两 12.5143832909
+放低 9.94943393339
+数第一 13.2075304714
+六十个 11.9547675029
+趋利性 13.2075304714
+雨凇 12.2912397395
+难症 13.900677652
+一家之长 12.5143832909
+辨论 13.900677652
+拍案叫绝 11.598092559
+隔岸观火 11.7034530746
+柯文 13.900677652
+激励机制 9.43476953332
+扼要说明 12.1089181827
+严管 11.5027823792
+电子公告 10.9562386728
+胸无点墨 11.9547675029
+难用 11.0674643079
+和田 9.20019728618
+徐公明 12.5143832909
+三四五次 13.2075304714
+车匪 13.2075304714
+摄影部 13.2075304714
+布鲁姆 11.4157710022
+恶报 12.5143832909
+马增芬 12.2912397395
+聚烯烃 11.5027823792
+人望 10.4666904475
+拜到 12.5143832909
+柯斧 12.5143832909
+分而治之 11.1926274509
+商客 12.8020653633
+国用 10.2630914922
+钱学森 9.19114745066
+紧密相联 10.8561552143
+贡嘎山 10.5684731418
+臂板 13.900677652
+大限度 11.4157710022
+干旱气候 9.34680076038
+瓦西列夫 13.2075304714
+通信子网 12.8020653633
+系统实施 11.3357282945
+附分 13.2075304714
+风挡 10.3743171274
+雨具 11.8212361103
+薛瞎子 12.5143832909
+情报来源 12.5143832909
+青秀山 12.8020653633
+曹典 13.2075304714
+桓温之 12.8020653633
+当权派 10.7226238216
+山湾子 12.8020653633
+附则 11.0103058941
+张世平 13.900677652
+曹兵 9.41204128224
+六十二 11.3357282945
+益格 11.598092559
+八千两 12.2912397395
+美贤之 12.1089181827
+雪域 11.2616203224
+轮作周期 12.8020653633
+响应值 13.900677652
+秀屿港 12.1089181827
+曹元 12.5143832909
+小抽屉 12.2912397395
+晤见 13.900677652
+信源 11.1926274509
+雪城 12.5143832909
+审判者 13.900677652
+洛泽河 12.8020653633
+彩盘 13.900677652
+公积 10.4041700905
+驾鹤西归 13.900677652
+姜公 12.8020653633
+附到 12.2912397395
+轰乱 13.900677652
+预混料 13.900677652
+之大 8.15128466607
+第四招 12.2912397395
+祖传秘方 11.7034530746
+什鲁斯伯里 13.2075304714
+绿茶 8.90346537821
+绿茵 12.8020653633
+抬进去 12.5143832909
+东征事 13.2075304714
+豁出去 9.55687223012
+反之亦然 10.3743171274
+败缺 13.900677652
+汶上县 12.1089181827
+沙苑子 13.900677652
+清华大学美术学院 13.900677652
+之处 6.7468438504
+葛氏 12.5143832909
+红霉素 10.4666904475
+大风堂 13.2075304714
+胡爷 9.63799777493
+克尔凯 12.8020653633
+衣襟 8.53003962385
+之外 5.87418071303
+过意不去 9.65218240993
+之多 7.99259471381
+外科病人 13.900677652
+之夜 8.65893063692
+罢工 8.34384959028
+思想体系 9.6811699468
+煮练 13.2075304714
+第一次国内革命战争 10.2630914922
+柳毅传 11.598092559
+银亮 11.7034530746
+随俗浮沉 12.8020653633
+之女 9.31571017331
+绿荫 10.0940151622
+丙辰 13.2075304714
+做法 6.6373480345
+衣褶 11.9547675029
+网目 12.8020653633
+炼字 12.8020653633
+酷评 13.900677652
+管连发 13.900677652
+攥着 9.5186510173
+增白剂 12.1089181827
+绿草 10.765183436
+吕四娘 13.2075304714
+递回 12.2912397395
+习作 10.4349417492
+长长 9.37888907493
+太长久 11.8212361103
+水木清华 11.9547675029
+奥尼尔 9.89334446674
+尽量避免 9.29550746599
+霍乱菌 13.2075304714
+扫瞄 12.8020653633
+佟某 13.900677652
+强制保险 11.4157710022
+克尔克 11.8212361103
+计算机服务 12.8020653633
+创汇额 13.900677652
+茶缸子 12.1089181827
+拴着 10.0088573539
+朱大定 13.2075304714
+非常 4.90328300634
+准备期 10.533381822
+观赏鱼 12.2912397395
+诉讼 7.39489359185
+第四批 11.9547675029
+大批量 9.98865464655
+摆龙门阵 11.9547675029
+一百余万两 13.2075304714
+阿波罗号 11.1926274509
+省林业厅 11.4157710022
+质量 5.79506824968
+灰白色 8.93783302172
+中国通 11.2616203224
+大好机会 10.4666904475
+衣角 10.765183436
+之妙 10.0505300503
+刘体纯 8.37522471284
+迷题 13.900677652
+温斯顿 11.598092559
+民兵组织 12.8020653633
+会客厅 11.5027823792
+菩提伽耶 12.8020653633
+伯唐通 12.8020653633
+诉诉 12.8020653633
+逊位 10.642581114
+安德罗斯 12.8020653633
+磁珠 13.2075304714
+贾胡 13.2075304714
+黜免 12.5143832909
+诉诸 9.69598503258
+没有同伴 12.5143832909
+之始 8.87023973058
+官校 12.1089181827
+诉说 8.59737274392
+诉请 11.3357282945
+剪切力 12.1089181827
+习俗 7.54979193526
+日思夜想 11.8212361103
+修撰 9.71102290995
+官样 12.5143832909
+迷幻药 13.2075304714
+衣衫 8.83177344976
+康王之 12.1089181827
+雪儿 10.6818018271
+凡书契 13.2075304714
+严紧 11.0674643079
+二十五款 13.2075304714
+尉迟胜入 12.8020653633
+严素 8.97342396682
+非得 8.86372504956
+重型化 11.7034530746
+逊于 10.0720362555
+擅自处理 13.2075304714
+二十五次 13.2075304714
+村墟 13.2075304714
+城西湖 12.1089181827
+伏山 13.2075304714
+连斯奇 11.1280889297
+北静王 10.7226238216
+抽水马桶 11.2616203224
+温柔敦厚 11.3357282945
+金樽玉 13.900677652
+马茶哥 13.2075304714
+映着 10.3171587135
+船门 12.8020653633
+孙嘉淦 12.2912397395
+生成量 12.8020653633
+日益巩固 13.2075304714
+中国美术馆 11.9547675029
+画中有画 13.900677652
+蟾光 13.2075304714
+封锁起来 11.7034530746
+以石投水 13.900677652
+汪联合 12.8020653633
+特支费 13.900677652
+体育院校 13.900677652
+特别区 11.4157710022
+游进游 13.2075304714
+定海 10.2630914922
+修整 9.30555780184
+赚钱 7.17444424962
+次世代 13.900677652
+出水量 12.1089181827
+左手腕 13.900677652
+唐僧言 13.2075304714
+甘蔗林 13.2075304714
+三八红旗手 11.9547675029
+布鲁克纳 11.598092559
+断案 11.0103058941
+金合欢 11.2616203224
+落锤 12.8020653633
+斑枯病 13.2075304714
+沃克湖 12.8020653633
+金镞科 13.2075304714
+斋心 13.900677652
+女子组 12.2912397395
+映眼 13.900677652
+六章 11.4157710022
+和珅 10.4994802703
+信标 10.4994802703
+控诉书 13.2075304714
+钓徒 13.900677652
+张发强 12.2912397395
+司隶部 12.8020653633
+钓得 13.900677652
+铁公祠 13.900677652
+修改 6.75390547252
+落锁 12.1089181827
+晋朝 10.4994802703
+修陈史 13.2075304714
+饮冰 11.3357282945
+弓形虫 11.3357282945
+漫长岁月 11.1280889297
+风斗 13.2075304714
+回复率 11.7034530746
+绿芽 11.1926274509
+群死群伤 13.2075304714
+据实 10.2371160058
+周如斗 13.2075304714
+海森伯 10.765183436
+衣裤 9.62401153296
+马先入 12.8020653633
+万卷楼 12.8020653633
+衣裳 7.78921031247
+鲜果汁 12.8020653633
+耐冬 13.900677652
+青金石 11.1280889297
+趋炎附势 11.0103058941
+看得懂 11.4157710022
+草贼 10.9562386728
+提起公诉 9.98865464655
+陈总兵 11.9547675029
+处室 11.0103058941
+服务项目 9.91169360541
+习于 11.8212361103
+打人骂狗 13.900677652
+衣装 10.8096351986
+之墓 10.0940151622
+加薪 10.642581114
+做派 10.3743171274
+荷尔 11.2616203224
+田皇亲 10.8561552143
+炸熟 13.900677652
+亲密关系 11.1926274509
+做活 9.32596667347
+竭尽 10.1630080337
+鸳鸯 8.19356738723
+言致祥 13.900677652
+直立人 10.1394775363
+迷香 12.1089181827
+烈日 9.96885201925
+附后 12.5143832909
+不像 7.34816976494
+可饮用 11.9547675029
+败绩 10.4994802703
+警察署 12.5143832909
+附合 11.7034530746
+紫气东来 11.4157710022
+反托拉斯法 11.4157710022
+滤除 11.8212361103
+东胡林 13.2075304714
+修文 11.1926274509
+尖锐 7.58170953823
+之声 7.58531965045
+明太祖 9.10488710638
+前后任 13.2075304714
+花针茅 10.3453295905
+弗拉格 13.900677652
+安德洛 13.2075304714
+熟知 8.58255765813
+文字编辑 13.2075304714
+身经百战 10.0088573539
+无意中 13.900677652
+尖锥 11.9547675029
+衣袍 10.8096351986
+修斯 10.4349417492
+诸马牧 12.8020653633
+贝丘遗址 11.9547675029
+绿苔 10.533381822
+修方 12.2912397395
+败给 10.7226238216
+车商 10.4349417492
+降低消耗 13.900677652
+吹打乐 11.3357282945
+艺术流派 11.0103058941
+衣袖 8.92394390956
+难点 9.43476953332
+信步 9.69598503258
+鸣炮 11.4157710022
+烟袋锅子 12.5143832909
+难于登天 12.2912397395
+麦克马斯特 13.2075304714
+贝尼托 12.5143832909
+魏兵骤 12.5143832909
+浅蓝衫 13.900677652
+松树枝 12.8020653633
+总角之交 12.1089181827
+非电解质 12.1089181827
+曹咎 13.2075304714
+成之君 12.8020653633
+刨冰 12.8020653633
+佩德拉 13.2075304714
+手鼓 11.5027823792
+祝融殿 12.2912397395
+超群绝伦 13.2075304714
+氯化苦 13.900677652
+拜垫 11.1280889297
+垂直于 9.61021821083
+根本途径 10.8561552143
+之学 8.53003962385
+竭心 12.8020653633
+先去 7.95525704337
+广茂 12.5143832909
+确确实实 9.41204128224
+朝海 12.8020653633
+像章 10.9049453784
+一番滋味 11.9547675029
+数不清 9.26594866375
+闾阎扑地 13.900677652
+司马隽 13.2075304714
+拜城 11.598092559
+文圣区 12.8020653633
+风暴 7.73947033028
+膻中 12.1089181827
+火车车厢 11.8212361103
+都先胜 12.8020653633
+包皮 9.43476953332
+经典台词 12.5143832909
+定温 12.5143832909
+布鲁尼 12.1089181827
+郑买嗣 12.8020653633
+橡胶树 10.4666904475
+二十多两 12.2912397395
+一头热 12.1089181827
+之子 7.85567233794
+大洋洲人 13.900677652
+沭河 10.533381822
+重工业部 11.9547675029
+华商相 13.2075304714
+耐劳 12.8020653633
+胡老大 13.2075304714
+尺骨 12.5143832909
+体重减轻 10.9049453784
+风景 7.60725837313
+处境 7.55328844232
+之害 10.0940151622
+汽车销量 9.61021821083
+之家 8.03420959504
+技术承包 13.900677652
+曹吵 12.8020653633
+预处理 10.604840786
+落雪 10.3743171274
+九城 9.94943393339
+贾芝 12.5143832909
+耐力 9.77354326693
+开单 11.8212361103
+鲁迈拉 10.533381822
+霹雳车 13.900677652
+罢弊 13.2075304714
+裴蒂庄 13.2075304714
+启齿 11.3357282945
+少佐 13.900677652
+网球 9.71102290995
+空集合 11.598092559
+雨后 10.3743171274
+一片狼藉 11.0674643079
+白攀郑 13.2075304714
+南郡南 12.8020653633
+之实 10.0505300503
+之宝 9.82314020807
+偿命 9.96885201925
+一兵一卒 10.642581114
+吕宋 10.9049453784
+观赏鸟 12.5143832909
+明鲁王 13.2075304714
+落难 10.1630080337
+五六十万两 13.2075304714
+霍丘 11.9547675029
+左氏传 12.8020653633
+邪劲 13.900677652
+厌恶 8.10158499752
+唱个 9.48183704418
+观赏鸽 13.900677652
+焦化 9.41204128224
+过桥费 13.2075304714
+阴山山脉 10.2630914922
+东风压倒西风 11.8212361103
+心脏病 8.24818847171
+巢域 13.2075304714
+破军杀将 13.900677652
+一百二十七辆 13.2075304714
+葬身海底 11.2616203224
+随意性 10.4349417492
+中国国际金融有限公司 10.1394775363
+豆制品厂 12.8020653633
+变矩器 11.1280889297
+吞金 11.7034530746
+处处 7.55504129115
+根肋骨 11.7034530746
+富贵寿考 13.900677652
+党的纪律 11.5027823792
+难熬 9.37888907493
+揭榜 11.7034530746
+车垫 13.2075304714
+财政法 12.8020653633
+侯赛因 10.0294766411
+笑贫不笑娼 13.2075304714
+样品 8.37124856446
+爱楚卿 13.2075304714
+中国人民 13.900677652
+充分体现 8.63281949291
+杜根 13.2075304714
+克利夫 11.4157710022
+升降机 11.0103058941
+尖音 12.5143832909
+出入将相 13.900677652
+车型 6.74997619438
+周子谅 12.8020653633
+板床 12.5143832909
+明叔抹 12.5143832909
+全国人大常委会法制工作委员会 13.900677652
+尼诺夫 12.5143832909
+年庚 11.8212361103
+荡涤 10.9562386728
+安纳德 12.2912397395
+杜桑 11.2616203224
+王华庆 12.5143832909
+发改委 6.98396263162
+雪印 13.900677652
+弗里德里希 10.8096351986
+说到底 8.71329184614
+每学年 13.2075304714
+金水路 9.41204128224
+期货价 11.8212361103
+剔红 11.8212361103
+马来亚 9.93038573842
+一后 11.5027823792
+包在 9.85762638414
+苏霍依 13.2075304714
+大风子 11.8212361103
+布恩施德 13.900677652
+迷魂 10.5684731418
+汪氏茶 13.900677652
+吃起 11.7034530746
+平经仪 12.5143832909
+任务 5.62301149112
+刚出狱 13.2075304714
+地方志 10.1630080337
+亲姐妹 11.1280889297
+环山 9.21854642485
+穗儿 12.1089181827
+单板机 13.2075304714
+优异性 13.900677652
+难燃 12.2912397395
+为准 8.0484751722
+车城 11.1280889297
+断了腿 11.0103058941
+科罗斯 13.2075304714
+治保主任 13.2075304714
+落音 10.1394775363
+丘特罗 13.900677652
+车场 12.8020653633
+一万二千亩 13.2075304714
+包着 9.22784881751
+东光公主 13.2075304714
+严羽 11.7034530746
+杜梅 12.5143832909
+荒漠化 11.0103058941
+三四十丈 12.8020653633
+白家庄 11.5027823792
+绿肥 9.69598503258
+罗尔斯 11.1280889297
+宗废王 13.2075304714
+南来北往 10.604840786
+气喘吁吁 8.92394390956
+雪原 10.9562386728
+庄前 10.1871055853
+连结起来 10.9562386728
+罢市 10.0294766411
+介溪 12.8020653633
+晃悠 10.5684731418
+炉灰 11.8212361103
+一亿次 13.2075304714
+官步 13.900677652
+大田湾 13.2075304714
+明叔才 12.8020653633
+交流史 11.3357282945
+期货业 9.32596667347
+车圈 13.2075304714
+耐压 10.4349417492
+毛皇后 13.2075304714
+荒漠区 10.533381822
+杜梨 11.5027823792
+和煦 10.8096351986
+铜箔 12.5143832909
+五金机械 12.8020653633
+公开栏 13.900677652
+加斯佩 13.900677652
+益气 9.33632946051
+醉死梦生 13.900677652
+听小骨 12.1089181827
+益民 9.19114745066
+和长生 12.2912397395
+风机 10.0720362555
+依小生 12.8020653633
+修枝 13.2075304714
+久利 13.2075304714
+月晕 12.5143832909
+陶瓷制品 12.2912397395
+风月 9.56994431169
+某一 7.90422556336
+聂新二 13.900677652
+鲈鱼 11.1926274509
+购物满 12.8020653633
+英勇作战 11.2616203224
+扎西岗 12.8020653633
+可怜天下父母心 12.8020653633
+耳朵 6.6898591985
+代加工 12.5143832909
+拨弄是非 12.8020653633
+康瓦尔 12.8020653633
+一吓 11.598092559
+报废车 11.9547675029
+箱内 10.0505300503
+跟风者 13.2075304714
+伏尔塔 13.900677652
+按揭 8.51618258919
+有崇宗 12.5143832909
+名句 10.0294766411
+铁刃 12.2912397395
+旧作 11.4157710022
+殃及 10.4349417492
+国事访问 10.4666904475
+半子 12.5143832909
+肚兜 11.0103058941
+慈禧圣母 13.900677652
+一千三百万斤 13.2075304714
+骑车 9.33632946051
+铁则 12.8020653633
+经济杠杆 10.8096351986
+球门区 12.8020653633
+小公牛 13.900677652
+寂默 13.900677652
+家禽 8.74738605748
+荠荠菜 12.2912397395
+西柏坡村 12.1089181827
+拔乎其萃 12.5143832909
+舍里 12.2912397395
+实用工具 12.8020653633
+钱孙爱 9.18217878068
+伊壁鸠鲁 10.5684731418
+周相公 11.8212361103
+崩殂 13.900677652
+但孙科 12.8020653633
+偏头疼 12.2912397395
+阅完 13.2075304714
+描写 7.15779701618
+魏元英 13.2075304714
+铁券 10.765183436
+孽根祸胎 13.900677652
+稻飞虱 12.1089181827
+感慨不已 11.1926274509
+王琦瑶 7.95525704337
+铁剂 11.8212361103
+黑鬼 10.9562386728
+桥瑁 13.900677652
+六里桥 12.5143832909
+虽死犹生 12.2912397395
+打靶 12.2912397395
+龙蛇 11.1280889297
+弥尔顿 11.0674643079
+铁剑 11.1280889297
+品种改良 11.7034530746
+偏头痛 10.6818018271
+各开 11.5027823792
+改到 11.7034530746
+安德烈 10.7226238216
+改制 7.88941047757
+家私 9.69598503258
+崇阳 12.5143832909
+五棵松 12.8020653633
+原生动物 9.32596667347
+名号 8.89004235788
+尼姆 11.4157710022
+曾伉 13.2075304714
+数九寒天 12.5143832909
+网络分析 12.5143832909
+江南一带 10.642581114
+情意相投 12.8020653633
+桂系 9.93038573842
+三国演义 9.25628675283
+劝谕 10.9562386728
+第十名 11.5027823792
+一手一足 13.900677652
+逗闷子 13.900677652
+吃货 11.9547675029
+思想前卫 13.900677652
+霜霉病 10.9049453784
+蒋宋孔 13.2075304714
+带羞 13.2075304714
+发行体 11.8212361103
+红土地 12.5143832909
+群起 9.66657114738
+劝谏 10.2897597393
+摄录 10.8561552143
+第三十二代 13.900677652
+尼夫 12.2912397395
+半导 11.9547675029
+血衣 11.0103058941
+闻得燕 13.2075304714
+半寸 10.7226238216
+等雨线 12.5143832909
+孔明至 12.8020653633
+毕岚 12.8020653633
+人格类型 13.900677652
+朝左边 13.900677652
+杨太真 12.8020653633
+施隆 12.8020653633
+骑过 11.2616203224
+水灌城 12.2912397395
+摄影 8.14493543839
+武汉出版社 13.900677652
+改动 9.11318590919
+物换星移 12.8020653633
+掌理御 13.2075304714
+出场费 11.8212361103
+芮良夫 11.9547675029
+举证责任 11.0103058941
+群贤 13.2075304714
+蛟河市 13.2075304714
+阿杰 13.2075304714
+采购计划 11.5027823792
+该加 13.2075304714
+群贼 10.8096351986
+尼奥 10.765183436
+目中无人 11.0103058941
+霍特林 13.2075304714
+泡状 11.7034530746
+答理 10.2897597393
+摸清楚 12.1089181827
+黄橙橙 13.900677652
+阿奎丹 13.2075304714
+汽压 13.2075304714
+曾依 13.900677652
+六岁时 12.5143832909
+经世济民 13.900677652
+广联 12.8020653633
+肉桂酸 12.8020653633
+尼奇 13.900677652
+跳出火坑 12.5143832909
+龙虾 10.0720362555
+铁勺 11.9547675029
+第四维 13.900677652
+水波不兴 13.2075304714
+电泳介质 13.900677652
+色欲 11.5027823792
+简历 9.96885201925
+食品部 13.900677652
+等因奉此 12.5143832909
+切身经验 13.2075304714
+邢救卫 13.2075304714
+窑湾 13.2075304714
+箭法 10.4666904475
+历南朝 12.8020653633
+夹皮沟 12.5143832909
+丢乌纱帽 13.2075304714
+光刻胶 13.2075304714
+童从稷 13.2075304714
+改印 13.900677652
+基因突变 10.2630914922
+赵尔巽 12.1089181827
+两三行 13.2075304714
+铁匠 9.18217878068
+铁匣 13.2075304714
+秦置吴 12.5143832909
+未办理 10.9562386728
+冲击波前 13.900677652
+十多匹 13.900677652
+伊斯帕诺 11.2616203224
+存放 8.26946587015
+北京大学第一医院 12.1089181827
+卢永祥 11.3357282945
+柏木杆 13.900677652
+雷焦卡拉 13.900677652
+单缝衍射 12.2912397395
+曾为 8.11071748108
+那马 9.55687223012
+顿号 12.1089181827
+决志 13.900677652
+洋溢着 9.28555713513
+嘉林 12.8020653633
+婉转动听 11.9547675029
+李建波 12.2912397395
+开拓创新 10.8561552143
+改区 13.900677652
+勘探队员 13.2075304714
+碧波荡漾 11.1280889297
+倡优 11.8212361103
+开胃酒 12.5143832909
+亳县 11.598092559
+张令一 12.5143832909
+客机 9.01787572939
+巫衣 10.9562386728
+威慑 9.49395840471
+险些 8.58747167293
+杨太监 13.900677652
+龙蟠 12.2912397395
+低头不语 9.49395840471
+跳虫 13.2075304714
+铁印 13.900677652
+值千金 12.1089181827
+对过儿 13.900677652
+寿宫 13.2075304714
+着火点 13.2075304714
+符验 11.7034530746
+史萧淮 13.2075304714
+铁厂 10.0940151622
+大十字 12.1089181827
+重新装配 13.900677652
+改口 9.71102290995
+天龙八部 11.7034530746
+祭扫者 13.900677652
+危险物品 10.765183436
+突出位置 11.0674643079
+偷电 13.2075304714
+粒级 13.2075304714
+简化 7.79588441956
+曾以 8.96620371885
+改号 11.5027823792
+遇冷 9.91169360541
+老公公 9.36807815882
+批发城 12.8020653633
+萨尔察赫河 13.2075304714
+马回寨 11.9547675029
+曾仕 13.900677652
+湖北省博物馆 13.2075304714
+改变 5.22357894305
+季孙之忧 12.8020653633
+险乎 12.5143832909
+偷生 10.1630080337
+橄榄形 11.7034530746
+铁甲武士 13.900677652
+若干天 12.2912397395
+跳蚤 10.642581114
+台北县人 13.2075304714
+若干套 13.2075304714
+天台寺 12.8020653633
+托管制度 12.2912397395
+庐陵 10.765183436
+铁叉 11.3357282945
+薄片 9.31571017331
+塞菲里 12.8020653633
+打雷 10.2117981979
+联络地点 13.2075304714
+改去 13.2075304714
+大苗山 12.1089181827
+往古来今 13.900677652
+简单 5.61819464825
+午市 9.18217878068
+位力系数 13.900677652
+片刻间 10.2117981979
+庙街 12.5143832909
+阿昌族 11.3357282945
+显露出 9.18217878068
+铁口 10.2897597393
+赛德 11.9547675029
+力矩电机 13.2075304714
+斯旺希 13.900677652
+首鼠两端 11.7034530746
+王常洵 12.8020653633
+调研室 13.2075304714
+嘉木 11.9547675029
+蜜渍 13.900677652
+揭盖 11.9547675029
+曾于 8.78268383956
+铁叶 11.1280889297
+平津战役 10.3743171274
+晋江市 12.8020653633
+什么世道 11.8212361103
+四方区 13.900677652
+冷柜 12.5143832909
+获赠 10.1871055853
+游法 12.8020653633
+记错 10.4349417492
+新华街 13.2075304714
+啧啧 10.2117981979
+提起过 10.6818018271
+西庇阿 11.3357282945
+因人 10.1394775363
+撑竿跳高 11.598092559
+幼虫 7.95787827685
+童从社 12.5143832909
+解差 13.900677652
+打错 10.9049453784
+遇到 6.17050285673
+嘁嘁喳喳 10.533381822
+因事 9.91169360541
+遇刺 9.77354326693
+木匠活 11.8212361103
+无动于衷 9.04864738806
+改做 10.9562386728
+罗秀竹 8.87679713113
+花梨椅 13.900677652
+初审 9.63799777493
+喻义 13.900677652
+丧门 11.598092559
+父子俩 9.45802639549
+半夜 7.80035869996
+开垦地 13.900677652
+剥皮 9.41204128224
+半多 11.9547675029
+赛尔 11.4157710022
+喻为 10.533381822
+直写 12.2912397395
+朵儿 11.1280889297
+栖于 9.61021821083
+梯队 9.63799777493
+计数器 9.98865464655
+半夏 9.96885201925
+奄然 13.900677652
+第十四 10.0940151622
+黑麻答 12.8020653633
+侵华日军 10.0294766411
+脉宽调制 12.8020653633
+随大势 11.9547675029
+喻世 13.2075304714
+海曲 12.8020653633
+半头 11.7034530746
+五十余座 13.2075304714
+环顾四周 10.7226238216
+河洄游 11.8212361103
+窑洞 7.99531580392
+偷盗 10.0505300503
+橄榄岩 11.1280889297
+半天 6.56374073827
+描叙 11.9547675029
+一夫之勇 13.900677652
+梯阶 12.8020653633
+半大 10.533381822
+电渣焊 13.2075304714
+互相合作 12.1089181827
+光化学 10.1871055853
+阿尔卡拉 12.5143832909
+广船 11.9547675029
+卢氏县 9.82314020807
+祀奉 12.1089181827
+监守自盗 12.2912397395
+椴树 10.4666904475
+电热锅 13.900677652
+蕴藏 8.03138073884
+据我所知 9.54396882529
+四川全兴 13.900677652
+河东军 12.1089181827
+因为 4.04837813621
+贸贸然 13.2075304714
+关系式 9.96885201925
+黑色金属 9.32596667347
+画作 11.0103058941
+俞募配穴 13.900677652
+橡树果 13.900677652
+设计规范 11.5027823792
+五十余年 12.5143832909
+领受到 12.8020653633
+那首 9.55687223012
+尹志 12.8020653633
+打闹 10.2371160058
+娩出 10.4994802703
+协调系统 13.2075304714
+四方台 12.8020653633
+林懋 12.8020653633
+铁像 12.8020653633
+半干旱 8.85725253506
+打闪 11.7034530746
+波克罗 12.5143832909
+打问 10.7226238216
+唐摭 13.2075304714
+泡点 13.2075304714
+影片类型 13.900677652
+无力回天 10.7226238216
+气顶驱动 13.900677652
+发罗拉 12.2912397395
+赵丽萍 13.900677652
+画会 12.1089181827
+巫语 13.900677652
+南北疆 13.2075304714
+收不到 11.4157710022
+三重门 12.2912397395
+果蔬 10.1164880181
+龙葵 12.2912397395
+水煤气 11.9547675029
+寿恒昌 13.2075304714
+存有 8.53003962385
+安庆市 10.765183436
+赵延寿 12.2912397395
+宁周义 10.1164880181
+血诏 13.900677652
+简册 11.7034530746
+地图集 10.2630914922
+华东师范大学 10.9049453784
+东界博 13.2075304714
+无毒品 13.900677652
+存期 12.5143832909
+帕尔梅 12.2912397395
+概括性 10.604840786
+简写 11.3357282945
+毒扁豆碱 12.8020653633
+雷必达 13.900677652
+萨阿德 12.5143832909
+电影学院 10.642581114
+委托合同 11.598092559
+改元 8.58747167293
+批发商 9.89334446674
+三人行 11.9547675029
+发布 5.09215903319
+志业 11.8212361103
+绕圈子 11.5027823792
+简况 10.6818018271
+万多平方米 10.7226238216
+林总 12.5143832909
+早早儿 11.7034530746
+摩纳哥 10.4041700905
+毕异 13.2075304714
+经商参 13.900677652
+劝返 11.5027823792
+疑云难消 13.900677652
+弗伦克尔 12.5143832909
+药棉 11.7034530746
+粒米 12.5143832909
+画人 11.8212361103
+劝进 10.4994802703
+药检 13.2075304714
+那须 13.900677652
+那顺 12.8020653633
+劝过 11.2616203224
+骨关节炎 12.5143832909
+各往 13.2075304714
+两湖总督 13.2075304714
+高速运转 11.8212361103
+苏州大学 12.5143832909
+查逊 12.8020653633
+飞针走线 12.2912397395
+肥大症 11.0674643079
+那顶 10.533381822
+那页 12.1089181827
+洋垃圾 12.2912397395
+口舌之争 13.2075304714
+锡克教 10.9049453784
+十多万元 12.8020653633
+汪清县 13.900677652
+半堵 13.2075304714
+光棍汉 11.7034530746
+巴黎凯旋门 12.8020653633
+林恩 12.5143832909
+行政性 10.765183436
+波罗的海 8.26946587015
+千里冰封 12.8020653633
+布拉迪斯拉发 11.7034530746
+田授田 12.8020653633
+李经纬 13.2075304714
+囚歌 12.5143832909
+一千一百一十一个 12.5143832909
+潜心研究 10.4041700905
+胎甲球 13.900677652
+甘宁引 12.5143832909
+向东开 13.900677652
+陈万里 13.2075304714
+宋之举 13.2075304714
+衫袖 12.2912397395
+女兵 8.40761620864
+意味着 5.83887537744
+官光禄 13.2075304714
+铁军 11.0103058941
+偷眼 9.69598503258
+喜鹊 9.5062284973
+半壁 10.765183436
+盘蛇谷 12.5143832909
+夏连特 12.1089181827
+打钟 12.5143832909
+闻丞相 11.598092559
+胶原病 12.8020653633
+尽心尽意 11.8212361103
+尼娜 12.8020653633
+不定期 9.37888907493
+半声 12.2912397395
+水煤浆 11.9547675029
+和平门 12.2912397395
+畜产 10.4994802703
+维尔尼亚 13.900677652
+打针 9.5062284973
+铁冶 10.0505300503
+别过来 11.7034530746
+王寿昌 13.2075304714
+那颗 8.5488195185
+石家庄 8.64840422393
+勇攀高峰 13.2075304714
+丹诚 12.8020653633
+画为 12.8020653633
+新鲜味 13.900677652
+玉甲 11.8212361103
+海陆风 12.1089181827
+蒋玉菡 11.1926274509
+荆土 12.8020653633
+一个男孩 10.7226238216
+扩布 12.5143832909
+画中 9.61021821083
+星鱼 13.2075304714
+烷烃 9.98865464655
+罗文素 12.5143832909
+偷着 9.98865464655
+简公 11.9547675029
+存查 13.900677652
+改写 9.01787572939
+铁凳 13.2075304714
+画一 11.8212361103
+锡克族 13.2075304714
+水漉漉 13.900677652
+一个二两 13.2075304714
+画下 11.0674643079
+画上 9.44633035572
+打铁 9.89334446674
+输者 13.2075304714
+心理作用 11.3357282945
+争吵不休 11.4157710022
+行政村 9.87532596124
+八万三千 13.2075304714
+辩难 11.4157710022
+浣衣 10.4994802703
+果菜 10.8096351986
+下流坯 13.900677652
+朱贵便 12.5143832909
+行政权 9.4233408375
+会盟 9.84023464143
+人心不同 13.900677652
+骑警 12.8020653633
+云轩 11.7034530746
+两三起 13.900677652
+饿殍遍野 13.2075304714
+遇合 12.2912397395
+龙成亲 13.2075304714
+龙芯 12.8020653633
+覆着 13.2075304714
+半影 11.9547675029
+林木 7.92179188707
+瓶罐 12.2912397395
+撞头磕脑 13.900677652
+初中期 13.2075304714
+心慈手软 11.0674643079
+铁嘴 11.598092559
+陈之才 10.8561552143
+平儿先 12.5143832909
+举手之劳 11.4157710022
+村姑 10.4349417492
+重归于好 12.2912397395
+一场春梦 12.5143832909
+林权 10.8561552143
+一场 5.91723758897
+念诗 12.1089181827
+林杉 12.8020653633
+吐根 13.900677652
+重彩画 12.8020653633
+客户 6.10503111564
+天津大学 11.2616203224
+满天下 11.7034530746
+阿斯第 13.900677652
+客房 8.90346537821
+半开 10.2371160058
+南阳县 12.2912397395
+拉斯顿 12.5143832909
+摆脱 6.38696840414
+官僚政治 11.1926274509
+施里弗 12.2912397395
+侧部 11.4157710022
+铁器 8.78868986362
+挪走 13.2075304714
+林杪 13.2075304714
+午宴 10.604840786
+白狗蛋 13.2075304714
+半弯 13.900677652
+迷蒙 10.3171587135
+魏军围 12.5143832909
+高速运行 12.2912397395
+本本分分 13.2075304714
+右臂 9.55687223012
+广蓄 12.8020653633
+半张 9.87532596124
+弗朗西斯敦 13.900677652
+方兴东 13.2075304714
+宋之世 13.2075304714
+系统命令 11.4157710022
+云迹 12.1089181827
+国孝家 12.8020653633
+端面 11.3357282945
+林林 11.7034530746
+边个 13.2075304714
+苏松粮 13.2075304714
+公孙尼子 13.900677652
+龙舟 9.82314020807
+龙舞 11.7034530746
+龙舒 11.8212361103
+神通广大 9.43476953332
+立渠帅 13.2075304714
+获评 10.6818018271
+核火箭 12.8020653633
+高林茂 12.8020653633
+喜饼 13.2075304714
+轮机长 12.8020653633
+项庄 12.2912397395
+龙船 10.9049453784
+内置 9.96885201925
+将心比心 10.9562386728
+大腹皮 13.2075304714
+箭楼 10.4994802703
+全体会议 9.19114745066
+石志仁 13.2075304714
+面无血色 12.5143832909
+王审知 11.7034530746
+丑样 13.2075304714
+原款 13.900677652
+怀胎 10.3171587135
+群发机 13.900677652
+云达 13.2075304714
+散发出 9.05649056552
+管钟形 13.2075304714
+若干层 12.5143832909
+林某 11.8212361103
+半径 7.99804431857
+饰针 13.900677652
+封冻 9.84023464143
+沃森 10.7226238216
+果茶 11.8212361103
+放哨 10.0720362555
+古气候 10.4994802703
+紫外遥感 13.900677652
+档册 12.1089181827
+置之不理 9.61021821083
+电动汽车 8.57766767284
+印支 9.74179456862
+恍恍忽忽 12.1089181827
+可喜成果 12.2912397395
+收购计划 10.7226238216
+中国南瓜 13.2075304714
+天气情况 10.8096351986
+铺纸 11.8212361103
+边界现状 13.2075304714
+方天画 11.0103058941
+祝英台 10.642581114
+跳舞 8.63798746307
+诸子自立 13.2075304714
+菱镁矿 10.1630080337
+各忙 13.2075304714
+电器元件 12.1089181827
+多几分 12.5143832909
+因应之道 13.900677652
+安皇 13.2075304714
+法工委 12.5143832909
+山姆大叔 11.7034530746
+茶卡盐湖 12.5143832909
+盖吴 12.8020653633
+登山运动 11.3357282945
+范雎 11.3357282945
+脊髓灰质炎 10.9049453784
+金沙江 8.75901409547
+阶级路线 13.2075304714
+半年 6.74840879594
+林昭 13.900677652
+血路 9.62401153296
+河北镇 13.900677652
+捞什子 13.2075304714
+赛季 9.74179456862
+吉利车 13.900677652
+王均居 13.2075304714
+美编 13.2075304714
+举办地 12.8020653633
+漠南 9.6811699468
+石虎领 13.2075304714
+改在 10.4994802703
+两千八百二十亩 13.2075304714
+猜不透 9.77354326693
+金沙水 12.8020653633
+白白胖胖 11.2616203224
+苏埠屯 12.2912397395
+汤嘉惠 12.5143832909
+几十微米 12.2912397395
+铁柄摇 13.2075304714
+黄天霸 13.900677652
+铁块 10.642581114
+国药准字 12.5143832909
+哈罗德 11.0674643079
+家系 13.2075304714
+正听得 11.9547675029
+帕子放 13.900677652
+隐匿型 13.2075304714
+方块字 11.9547675029
+代名词 9.38981814546
+万千气象 12.8020653633
+中译本 9.36807815882
+大音希声 13.2075304714
+馆驿 9.53122979951
+诸州佐 13.900677652
+入籍 10.9049453784
+连裆裤 12.8020653633
+劝解 8.9102450652
+朱利亚 11.7034530746
+盘绕在 12.1089181827
+贵德 10.9562386728
+担当起来 12.8020653633
+添点 12.2912397395
+明心见性 12.1089181827
+主修科目 13.900677652
+李麦喊 12.1089181827
+经学家 10.642581114
+那麽 11.8212361103
+茫无所知 13.900677652
+托里县 13.900677652
+尼尔 10.3171587135
+额尔金 11.7034530746
+例假 11.7034530746
+突现 10.9562386728
+秋冬种 12.2912397395
+乘务长 13.900677652
+药渣 12.1089181827
+纳拉亚南 13.900677652
+敲下来 13.900677652
+爱情史 13.900677652
+徐继畲 12.8020653633
+纪功坊 13.900677652
+焚尸 10.533381822
+苦心 9.26594866375
+热情高涨 10.3171587135
+电子衡器 13.2075304714
+项忠 13.2075304714
+五十余处 13.2075304714
+进化论者 12.5143832909
+茂腔 13.900677652
+两首 10.1630080337
+性气 11.3357282945
+半床 12.1089181827
+杨老儿 13.900677652
+题名录 13.2075304714
+螺旋状 9.71102290995
+中国社会科学出版社 11.3357282945
+烂泥巴 13.900677652
+第十六 10.7226238216
+改型 9.06439574502
+各念 13.900677652
+血账 13.900677652
+急人之难 13.900677652
+第十八 9.77354326693
+南攻楚 12.1089181827
+膏肓之疾 12.8020653633
+立文帝 12.8020653633
+江洋 13.900677652
+必有芳草 13.2075304714
+星驰 11.5027823792
+瓮安县 13.900677652
+祁山寨 11.1280889297
+薄白 10.7226238216
+成婚之日 13.2075304714
+完小 11.598092559
+半度 13.2075304714
+铁基 11.9547675029
+大忙人 11.9547675029
+巴嘎班迪 13.900677652
+正面交锋 11.8212361103
+尼德 12.1089181827
+数据机 12.5143832909
+发声明 12.2912397395
+探针 10.8096351986
+例句 12.2912397395
+笆斗 12.5143832909
+梁园 11.8212361103
+工作大队 13.900677652
+师之议 13.2075304714
+地球磁场 11.4157710022
+箭毒 11.1280889297
+官能症 13.900677652
+罗山县 9.96885201925
+小国寡民 11.9547675029
+黑曜岩 12.2912397395
+怜才 12.8020653633
+针织厂 13.2075304714
+跳脱 11.598092559
+活动桥 12.2912397395
+括号 9.82314020807
+伯颜分 13.2075304714
+肿瘤医院 11.0674643079
+特征函数 11.598092559
+林放 12.5143832909
+声尖叫 13.900677652
+移转 11.2616203224
+存户 11.9547675029
+三通一平 12.2912397395
+残留物 11.1926274509
+云贵 9.61021821083
+龙背 13.2075304714
+霉斑 12.5143832909
+最佳化 12.5143832909
+冷却空气 13.2075304714
+个人得失 12.2912397395
+龙胆 10.4666904475
+著名诗人 10.765183436
+群论 10.9562386728
+龙胜 10.4349417492
+搜括 10.5684731418
+董折 12.8020653633
+儒家思想 9.82314020807
+家翁 13.900677652
+赖活 11.9547675029
+改名 7.11622058934
+牵着鼻子 11.0674643079
+双虎 12.2912397395
+通城县 13.2075304714
+城市贫民 10.604840786
+尖角 10.642581114
+王学大 13.2075304714
+绕起来 13.900677652
+战三捷 13.900677652
+改向 11.2616203224
+血迹斑斑 11.4157710022
+全人类 9.48183704418
+渣打银行 9.20019728618
+口技 10.6818018271
+于怀特 13.2075304714
+沉吟未决 12.8020653633
+元夜 12.1089181827
+金帛请 13.2075304714
+迎祥 12.2912397395
+伟民 10.3171587135
+何某 11.9547675029
+第二十六路 13.2075304714
+存折 10.1164880181
+切入点 10.4666904475
+打醮 12.1089181827
+过滤掉 11.1926274509
+决策人员 13.900677652
+卸甲归田 13.900677652
+松下电器产业公司 13.900677652
+外层空间 9.71102290995
+缩衣节食 13.900677652
+箭步 13.900677652
+幼苗 9.43476953332
+两页 11.3357282945
+阿斯科 12.2912397395
+潜藏在 11.1926274509
+七里坪 13.2075304714
+林斯 11.9547675029
+打醒 11.8212361103
+齐谢赫 12.1089181827
+果腹 11.9547675029
+泰卡鸡 12.2912397395
+颌下腺 12.2912397395
+多棱镜 13.900677652
+迎神 11.8212361103
+创建人 9.37888907493
+薄田 11.7034530746
+制定方案 13.2075304714
+各帮 13.900677652
+郎侯迎 13.2075304714
+午夜 8.9519177616
+三月份 10.8561552143
+会理 11.1280889297
+幼芽 10.9049453784
+二元论 10.6818018271
+难关 9.66657114738
+先列 12.2912397395
+若干幅 13.2075304714
+第六十六回 12.2912397395
+怪事儿 12.8020653633
+邓绶林 9.40086798165
+薛里吉 13.2075304714
+尹家 12.8020653633
+若干年 9.13850371718
+第二世界 11.8212361103
+水浮莲 13.2075304714
+林旭 11.0674643079
+解放阵线 9.87532596124
+函授大学 12.1089181827
+宜兰市 13.2075304714
+那弼马 12.2912397395
+各带 9.6811699468
+打量 7.36543638096
+王东迁 10.642581114
+遥寄 13.2075304714
+果脯 10.4994802703
+贩卖毒品 12.8020653633
+药浴 12.2912397395
+杰克森 11.9547675029
+解甲归 12.8020653633
+尼康 11.7034530746
+金沙湾 13.900677652
+国防委员会 9.65218240993
+云豹 9.89334446674
+潘粤明 13.2075304714
+电镀法 13.2075304714
+王阿尔 13.900677652
+上海浦东新区 10.2630914922
+波一波 11.598092559
+种子田 13.2075304714
+太有钱 12.8020653633
+打造 7.19626329701
+一窝风 13.900677652
+半层 13.900677652
+痴傻 12.8020653633
+汪辜 11.8212361103
+打通 8.43684584695
+水文科学 11.1280889297
+三好学生 11.8212361103
+怔怔 8.99540287354
+比孙文 13.900677652
+半山 9.54396882529
+监管者 9.77354326693
+八百余枚 13.2075304714
+处方药 10.9049453784
+非法定 12.8020653633
+不知足 10.9049453784
+云豆 13.900677652
+骑行 10.7226238216
+复员兵 12.2912397395
+国民平均 13.900677652
+世行 9.5062284973
+油橄榄 10.7226238216
+吴忠市 11.7034530746
+名牌大学 10.6818018271
+翼侧 11.0103058941
+两眼发直 11.4157710022
+远地点 10.9049453784
+改唱 12.5143832909
+米斯特拉尔 13.2075304714
+渎职罪 13.900677652
+秋爽斋 11.7034530746
+阿图什市 13.900677652
+果肉 10.0720362555
+残羹冷炙 12.2912397395
+劝说 7.85330547293
+劝诱 10.9049453784
+半尺 10.2630914922
+塔纳拉 12.2912397395
+打道 12.1089181827
+罗比亚 12.8020653633
+欧洲区 11.9547675029
+胎教 10.7226238216
+希腊族 12.8020653633
+小鸭子 13.900677652
+中大奖 10.9049453784
+建设者 10.8561552143
+幼茎 12.2912397395
+步枪兵 13.900677652
+大瑶山 10.604840786
+阿拉里克 11.9547675029
+劝诫 11.0103058941
+怀宁县 11.8212361103
+龙脉 9.56994431169
+毕宿 13.2075304714
+龙脊 12.8020653633
+丑死 13.2075304714
+桃红柳绿 11.7034530746
+婆婆妈妈 10.3453295905
+金沙滩 10.2630914922
+隋继承 12.8020653633
+关中平原 9.44633035572
+龙脑 10.765183436
+本征频率 12.8020653633
+仁叔 13.900677652
+加强团 13.2075304714
+萨迦诸 12.5143832909
+姐俩 12.2912397395
+韦尔塔 12.2912397395
+霍乱弧菌 11.7034530746
+同盟会 8.6803218269
+偷猎 11.1926274509
+血轮 13.900677652
+费得罄 13.2075304714
+预料之中 10.1164880181
+贴过来 13.2075304714
+药水 10.0088573539
+虎狼之国 13.900677652
+饱经忧患 11.2616203224
+随你挑 13.2075304714
+质谱 10.8096351986
+半岛 7.44547908864
+门訇然 13.2075304714
+意味隽永 12.8020653633
+珍珠梅 12.8020653633
+销账 13.900677652
+分离器 11.8212361103
+会生 10.642581114
+耐磨损 11.598092559
+加长版 11.8212361103
+半索动物 11.9547675029
+体悟 11.7034530746
+半岁 11.3357282945
+亚美利加 11.598092559
+一笑了之 12.1089181827
+会用 8.97342396682
+认股权证 8.9519177616
+药汤 11.8212361103
+蕴育 12.2912397395
+改善 5.72964346277
+群言 13.900677652
+费尔南德斯 11.9547675029
+友台 13.900677652
+龙腾 10.604840786
+耳福 12.1089181827
+第十卷 10.765183436
+数理逻辑 10.0720362555
+奇怪的是 8.3285236198
+悲悲切切 12.1089181827
+恕难 13.900677652
+打鼾 10.8561552143
+过氧化苯甲酰 11.7034530746
+二十八辆 13.900677652
+幼豹 13.2075304714
+连州 11.9547675029
+乌卡亚利 12.2912397395
+会站 11.9547675029
+清咸丰 10.0940151622
+两千万元 11.5027823792
+广袤 9.89334446674
+中国建设银行 8.48457724977
+云药 13.2075304714
+半千 13.2075304714
+输诚 12.5143832909
+龙身 11.4157710022
+油毡纸 13.900677652
+班固著 13.2075304714
+打鼓 9.77354326693
+六十名 11.0674643079
+陆块 10.7226238216
+会章 12.8020653633
+喜闻 13.900677652
+三四百步 13.2075304714
+溅湿 11.598092559
+最低限 12.1089181827
+汪肇 13.2075304714
+针灸大成 12.2912397395
+换代产品 11.598092559
+存水 12.8020653633
+中级轿车 12.1089181827
+毕命 11.9547675029
+枚假 13.900677652
+税收收入 9.49395840471
+血肉 9.37888907493
+指示剂 10.2630914922
+天然漆 13.900677652
+隋芬 11.9547675029
+重要环节 9.40086798165
+出头露面 11.0103058941
+程诸子 13.2075304714
+半包 12.8020653633
+伞形 9.84023464143
+抛球 11.7034530746
+葛制 13.900677652
+风雨兼程 12.8020653633
+血肠 12.1089181827
+扫描式 11.8212361103
+红毛丹 13.900677652
+阮修 13.2075304714
+大散关 11.8212361103
+网络红人 11.7034530746
+直言极谏 12.1089181827
+毕呈 13.900677652
+跳转 12.5143832909
+犒赏 10.3453295905
+跳车 12.8020653633
+谈得成 13.2075304714
+红岩村 12.8020653633
+付上 13.900677652
+不敢问津 11.9547675029
+付与 9.85762638414
+客满 11.9547675029
+没有冬天 12.2912397395
+鲫鱼汤 13.2075304714
+左右脑 13.2075304714
+孔明视 11.5027823792
+孔明见 11.598092559
+潼南县 12.8020653633
+五十余员 13.2075304714
+舍饲 11.598092559
+在逃犯 13.2075304714
+若干倍 11.7034530746
+左右脚 13.900677652
+文字描述 13.900677652
+两盎司 13.900677652
+平丫头 13.2075304714
+附件炎 12.5143832909
+深刻反思 11.0674643079
+改嫁 9.63799777493
+近现代 9.14708746087
+半叶 9.36807815882
+适用 6.47115680919
+牛头山 11.598092559
+山山脉 11.7034530746
+半只 10.5684731418
+张铁林 13.2075304714
+半句 9.44633035572
+半口 12.2912397395
+跳进 8.89004235788
+第十届 9.45802639549
+跳远 10.9049453784
+中心镇 13.900677652
+可少不了 13.900677652
+辩驳 11.0674643079
+第十局 13.900677652
+阴道口 10.9049453784
+第十层 12.8020653633
+得分多 12.8020653633
+普赖斯 12.2912397395
+描好 13.900677652
+大得人心 13.900677652
+阿布德 12.8020653633
+完泽笃 13.2075304714
+跳过 9.7898037878
+维吾尔族 9.0884932966
+统一 5.49665315867
+萨福均 13.2075304714
+杰裴逊 13.2075304714
+蒋大为 13.2075304714
+排水器 13.2075304714
+评书 10.533381822
+广衍 13.900677652
+王阿只 12.8020653633
+客源 10.1871055853
+女中学生 13.2075304714
+吉泰 11.598092559
+籽种 11.2616203224
+批发店 12.8020653633
+肺吸虫 11.9547675029
+哈西迈 13.2075304714
+胸襟开阔 13.2075304714
+新鲜度 12.8020653633
+炒豆子 13.2075304714
+丰硕成果 10.604840786
+巫者 11.3357282945
+丑时 12.5143832909
+晚节 13.900677652
+于喀山 12.8020653633
+龙辇 11.7034530746
+改学 10.3171587135
+九名 11.0674643079
+丑旦 13.2075304714
+打鸣 13.900677652
+塔纳河 13.2075304714
+韩礼德 11.9547675029
+尼科尔森 12.1089181827
+肩窝 12.2912397395
+财政收支 10.1394775363
+李经理 12.1089181827
+渐开线 12.5143832909
+有售 12.1089181827
+存活 9.06439574502
+代理人 8.64318227995
+龙达 11.3357282945
+梁兵 13.900677652
+夸示 12.5143832909
+另案处理 11.1280889297
+器械 8.00352378434
+从薪泽 13.2075304714
+点菜 10.533381822
+简寂 13.2075304714
+高如岳 13.2075304714
+西河口 13.2075304714
+地图符号 13.900677652
+十三一眼 12.8020653633
+滥捕 11.1280889297
+岳铉 12.8020653633
+万多张 13.2075304714
+足智多谋 9.75754292558
+活动期 10.9049453784
+穆尔德河 13.900677652
+肩章 11.0103058941
+半分 9.82314020807
+沃尔森 13.900677652
+白睛多 13.900677652
+格登山 13.900677652
+高氏父 13.2075304714
+摆谱 11.4157710022
+失窃案 12.8020653633
+损耗费 13.900677652
+馆陶 11.5027823792
+警戒色 12.1089181827
+林汝昌 12.8020653633
+赛场 9.96885201925
+咸雍 12.8020653633
+广角 11.4157710022
+魁北克城 12.1089181827
+庇护 9.01787572939
+一千多元 11.8212361103
+摒弃 9.49395840471
+成组技术 12.2912397395
+跳蹦 12.2912397395
+三人舞 12.8020653633
+通宝为 12.8020653633
+黄金地段 11.1926274509
+橄榄坝 12.2912397395
+白菜心 11.7034530746
+渗透 7.87965430263
+机械传动 11.1280889297
+标志型 13.900677652
+长青 10.7226238216
+直接了当 13.2075304714
+敬善言 13.900677652
+啼泣 13.900677652
+镜检查 10.4349417492
+铁定 10.2371160058
+寂静 8.12302532875
+排除法 11.3357282945
+金溪 11.5027823792
+半勺 12.1089181827
+血腥 8.67493097826
+设防地 13.900677652
+踝关节 11.5027823792
+药房 9.74179456862
+会签 11.598092559
+政府职能 9.72629038208
+控制塔 13.900677652
+权臣王 13.2075304714
+一望无涯 13.900677652
+欧南喜 12.5143832909
+通宝一 13.900677652
+第二十八回 11.8212361103
+巴勒尔 13.2075304714
+血脂 9.96885201925
+阴晴不定 11.8212361103
+伪造 8.78268383956
+忧愁 8.89004235788
+撒花 11.1926274509
+被保险人 9.28555713513
+血脉 9.21854642485
+越吉 12.5143832909
+立行泉 13.2075304714
+差热分析 13.900677652
+数百株 13.900677652
+群落 9.14708746087
+丈量 9.71102290995
+郑学勤 13.2075304714
+南北纬 11.0674643079
+星际 9.04864738806
+学生上课 11.1926274509
+辛那克 13.2075304714
+峪口 10.7226238216
+中央纪律检查委员会 10.8096351986
+改守 13.900677652
+箫管 12.1089181827
+南阳市 9.6811699468
+腕关节 11.4157710022
+磷光计 13.900677652
+张可久 12.1089181827
+打黑 9.0884932966
+龙车 11.598092559
+高高低低 11.0103058941
+改定 10.2117981979
+星陨 12.2912397395
+迎阳 12.2912397395
+贡萨洛 12.8020653633
+南面称孤 12.8020653633
+深有研究 11.9547675029
+叫个 10.533381822
+一蹶不起 13.900677652
+陈经理 11.0674643079
+路易十五 11.7034530746
+雌三醇 12.5143832909
+大道至简 13.900677652
+斯四世 12.1089181827
+冯保便 11.9547675029
+宠惯 11.7034530746
+苏尔特 12.5143832909
+音像制品 11.1280889297
+一席话 9.31571017331
+肚子 7.17925195119
+百依百顺 10.8096351986
+劈里啪啦 11.8212361103
+半兽 11.9547675029
+技术支持 9.38981814546
+希尔德 11.7034530746
+北安市 12.2912397395
+司兵甲 13.2075304714
+编写出 12.8020653633
+嘉泰 11.0103058941
+杂乱无章 10.1394775363
+溅污 13.2075304714
+软件平台 11.7034530746
+比吉河 12.1089181827
+感受器 9.32596667347
+刘唐便 12.5143832909
+王孟韦 12.5143832909
+摆轮 12.1089181827
+吃苦耐劳 11.1280889297
+早睡早起 11.5027823792
+片晶 13.900677652
+建设费 12.5143832909
+贸易逆差 8.97342396682
+铁塔 9.65218240993
+合法席位 11.3357282945
+土壤改良 11.2616203224
+黄燮清 13.2075304714
+浸透 9.61021821083
+爱书人 13.2075304714
+春宵苦短 13.900677652
+李国香 8.87023973058
+不含税 11.2616203224
+白保罗 13.2075304714
+陈冠希 11.5027823792
+跳起 9.56994431169
+家珍 13.900677652
+馆长 9.33632946051
+客气 7.62215622781
+打是亲 12.5143832909
+慕士塔格 13.2075304714
+溅水 13.2075304714
+载客率 13.900677652
+紫砂陶 11.8212361103
+朝语 10.5684731418
+张小山 12.8020653633
+不知者 11.598092559
+爱琴海 9.26594866375
+箭杆 10.533381822
+明达 12.1089181827
+病号饭 13.900677652
+贵府 11.0674643079
+贝拉斯科 11.7034530746
+家猫 11.5027823792
+跳越 12.2912397395
+若干分 12.2912397395
+日复一日 9.94943393339
+半凉 13.2075304714
+两百六十六万四千余 13.2075304714
+青丘子 13.2075304714
+成绩卓著 11.3357282945
+路易十三 11.7034530746
+多子多孙 13.2075304714
+经济核算 11.5027823792
+遴选出 12.8020653633
+半出 13.2075304714
+平儿忙 10.533381822
+螺旋面 13.900677652
+阴道内 10.5684731418
+带分数 12.5143832909
+血色 9.20019728618
+八千名 13.900677652
+薄礼 10.8096351986
+爱新觉罗 9.61021821083
+记者组 13.2075304714
+符山石 11.9547675029
+木履 12.8020653633
+铁壁 10.642581114
+和平时期 9.71102290995
+基转移酶 12.8020653633
+祭祀坑 11.4157710022
+死症 12.8020653633
+贬值率 13.2075304714
+三接头 12.8020653633
+实焦点 13.2075304714
+半册 13.900677652
+硼钢 12.2912397395
+跳跃 8.35160156708
+西气东 10.1394775363
+会计法 12.1089181827
+血性汉子 12.8020653633
+括弧 13.900677652
+仁达 12.8020653633
+那里 5.02734966247
+跳跳 11.8212361103
+败而不馁 13.2075304714
+纯真无邪 13.2075304714
+洪渡河 12.8020653633
+永修县 11.9547675029
+抓下 12.5143832909
+抓上 12.8020653633
+包藏祸心 13.900677652
+铁壶 11.7034530746
+第十年 12.5143832909
+越南共产党 11.598092559
+抓丁 13.2075304714
+舒莱金 13.2075304714
+倒三七 13.900677652
+会种 12.2912397395
+广论 12.5143832909
+铁血男儿 13.2075304714
+填鸭式 11.9547675029
+蓝五哥 10.765183436
+家犬 11.1280889297
+缝纫机 9.53122979951
+物资交流 10.4666904475
+深一脚浅一脚 11.0674643079
+林栖 12.5143832909
+当众表示 13.900677652
+苍润 12.2912397395
+改好 11.7034530746
+革命事业 9.93038573842
+木展 12.8020653633
+电子琴 12.1089181827
+祸端 11.5027823792
+长随 10.3171587135
+双包 13.900677652
+客流 9.40086798165
+林校 13.2075304714
+布金寺 11.598092559
+覆舟 11.9547675029
+群蛇 11.5027823792
+请上来 13.2075304714
+字符集 11.5027823792
+毫不在意 10.642581114
+文昌鸡 11.9547675029
+王利器 11.7034530746
+新理念 12.1089181827
+铁头 10.8561552143
+马安澜 13.2075304714
+千文 13.2075304714
+林格 11.9547675029
+喜雨 11.7034530746
+老规矩 9.94943393339
+改天 10.6818018271
+对立面 9.5062284973
+机关化 12.8020653633
+药用植物 9.11318590919
+人言藉藉 12.8020653633
+投井自尽 13.900677652
+打鱼 9.61021821083
+龙跃 12.5143832909
+殷海光 13.900677652
+鳏寡 12.5143832909
+嫁不出去 11.5027823792
+宜兰县 11.1280889297
+悬在空中 10.6818018271
+形单影只 11.7034530746
+欧洲式 11.9547675029
+溅洒 13.900677652
+食品卫生 10.604840786
+标新立异 10.4666904475
+项充 9.59661255877
+二话没说 10.0088573539
+白领丽人 12.8020653633
+摒弃前嫌 13.900677652
+创业资金 11.598092559
+冯保仍 12.8020653633
+针头 10.4349417492
+何虑哉 13.2075304714
+李亚农 13.2075304714
+擅于 10.604840786
+聚集体 11.8212361103
+分裂性 13.2075304714
+潘家洵 13.2075304714
+水利枢纽 8.70772080109
+校际比赛 13.2075304714
+云胡 12.8020653633
+水绿色 12.8020653633
+经济大国 10.0505300503
+放狗屁 13.2075304714
+家父 9.80633308975
+隔出 11.8212361103
+杂货铺 9.80633308975
+范金 12.1089181827
+佛家语 13.900677652
+遇害 9.55687223012
+林梢 11.2616203224
+城阙 11.8212361103
+药性 9.74179456862
+吃零嘴 13.900677652
+若干匹 12.5143832909
+李一氓 11.9547675029
+卡罗斯 13.900677652
+睽睽 13.900677652
+抓住 6.57289711355
+改姓 9.41204128224
+输血 9.19114745066
+李建明 12.8020653633
+王全书 11.8212361103
+那部 9.80633308975
+表达法 13.900677652
+撮土焚香 12.5143832909
+卫星天线 13.900677652
+波茨坦 9.82314020807
+仰山 12.8020653633
+午后 7.0993946175
+天生我材必有用 13.2075304714
+和宝琴 12.2912397395
+抓伤 12.1089181827
+博通经籍 13.900677652
+贝超科 13.900677652
+喜阳 13.2075304714
+简奥 13.900677652
+林森 10.9049453784
+倦怠感 13.900677652
+万不该 11.2616203224
+大唐帝国 13.2075304714
+会社 10.7226238216
+上乘之作 11.4157710022
+和勇毅 13.900677652
+黄孟复 13.2075304714
+塔纳湖 12.8020653633
+宋汉鄂 13.2075304714
+论理 10.0505300503
+付东流 13.2075304714
+会经 13.900677652
+西埃斯 13.2075304714
+引经据典 11.0674643079
+奶油小生 13.2075304714
+该品 12.2912397395
+半块 10.8096351986
+二环路 11.0674643079
+躺上去 12.2912397395
+齐云山 12.1089181827
+那霸 11.4157710022
+快点儿 10.8096351986
+美国队 12.5143832909
+摄取 8.77671367257
+摄受 13.900677652
+花梨木 10.5684731418
+克拉尔 12.8020653633
+赛前 10.642581114
+写作学 13.900677652
+观测线 13.900677652
+罗拉喂 13.2075304714
+阿那 11.1280889297
+尹元 12.8020653633
+投降派 11.4157710022
+杨可发 13.2075304714
+内斯库 11.8212361103
+善后工作 11.0674643079
+存根 13.900677652
+刘大爷 13.2075304714
+张小娴 13.900677652
+铁帽 10.9049453784
+半坡 9.87532596124
+台阶式 11.5027823792
+再运 13.2075304714
+官监 13.2075304714
+存案 12.5143832909
+黄衣服 11.7034530746
+杜宾根 12.2912397395
+晋江县 11.0674643079
+金喜善 13.900677652
+金钢钻 12.5143832909
+助消化 10.9049453784
+第四十三章 11.2616203224
+何年何月 10.9562386728
+残阳 11.0674643079
+感人心者 13.900677652
+半圈 11.2616203224
+人道主义法 12.8020653633
+半圆 10.4666904475
+最新版 13.2075304714
+例如 5.61541651791
+赛制 12.8020653633
+无毒害 12.2912397395
+楚天金 11.9547675029
+存档 10.642581114
+北爱尔兰 9.91169360541
+会红 13.2075304714
+桂竹 11.4157710022
+白发皤然 13.900677652
+疯言疯语 12.5143832909
+薄翼 13.2075304714
+下跌股 12.2912397395
+再进 10.3171587135
+环带 10.4994802703
+数据流 10.9562386728
+录像片 12.8020653633
+李氏世 13.2075304714
+薄翳 11.9547675029
+赛勒 13.2075304714
+喜酒 9.75754292558
+丑恶 9.20019728618
+家用 8.77077893705
+第七十 13.900677652
+不定根 10.9049453784
+广谱 10.765183436
+崇高 8.4980002701
+段位 12.2912397395
+纯水机 13.2075304714
+改建 8.25877058104
+简帖 11.1926274509
+家电 6.91503583434
+湖北省政府 11.7034530746
+铁庙 13.900677652
+若干名 10.9049453784
+经营企业法 12.5143832909
+祖士远 12.1089181827
+监听站 13.900677652
+意识形态 8.77671367257
+不含糊 10.3453295905
+坏运 13.900677652
+分子生物学家 12.5143832909
+于成龙 13.2075304714
+孤孤单单 11.3357282945
+中国史学会 10.1164880181
+若干吨 13.2075304714
+多几家 12.8020653633
+若与 13.900677652
+社会名流 10.9049453784
+蒙汗药 10.9562386728
+胡寄窗 12.8020653633
+无风不起浪 12.2912397395
+解说员 12.1089181827
+海德拉巴 13.2075304714
+三两米 13.900677652
+都悔青 13.2075304714
+最小值 10.642581114
+葛兰 11.9547675029
+人渣 12.2912397395
+丑怪 12.2912397395
+林伯渠 10.8561552143
+发声法 13.900677652
+一好百好 13.2075304714
+孔甲经 12.8020653633
+肤见 13.900677652
+鳏居 12.8020653633
+谈家桢 13.2075304714
+阿斯玛 13.900677652
+丑态 10.6818018271
+简并 10.9562386728
+例外 7.51886163457
+好肥 13.900677652
+南方周末 11.1926274509
+家畜 8.3555002075
+木管乐器 11.4157710022
+阿斯王 13.2075304714
+唐天授 12.5143832909
+鲁肃遂 13.2075304714
+林清 11.9547675029
+寒食 11.0674643079
+天地诛戮 13.900677652
+微机化 13.900677652
+土特产 8.05135287203
+赛博 12.8020653633
+东大街 10.604840786
+阿斯特 12.2912397395
+青枯病 12.1089181827
+内布拉斯加州 11.2616203224
+访谈实录 13.900677652
+刘歆伪 13.2075304714
+萨哈林 10.604840786
+加一点 11.9547675029
+见高低 13.2075304714
+触景伤怀 13.900677652
+那阵 10.0720362555
+客死 10.8561552143
+项圈 10.604840786
+九万块 13.900677652
+乐百氏 12.8020653633
+肉票 11.598092559
+几百公里 11.8212361103
+赫尔斯 13.900677652
+藻思 13.900677652
+羊羔 10.0720362555
+那队 11.5027823792
+薄纸 11.5027823792
+铁弹 11.5027823792
+改当 13.2075304714
+向东冲 13.900677652
+圆通 10.5684731418
+薄纱 10.9562386728
+撩蜂剔蝎 13.900677652
+孔明谓 11.5027823792
+汪藻 12.8020653633
+氯酸盐 13.2075304714
+调水 10.4349417492
+毕公 12.5143832909
+潞西县 12.5143832909
+新大洲 11.598092559
+剥离 8.47572763449
+尉曹宽 13.2075304714
+德效骞 13.900677652
+白令海峡 10.2897597393
+若辈 13.900677652
+伤病员 10.9562386728
+吃进 10.2371160058
+摄动 9.85762638414
+赛区 10.642581114
+偷种 13.900677652
+呼吸肌 11.3357282945
+薄绢 13.900677652
+为民 8.52078029844
+炭烧 12.8020653633
+驷马 11.7034530746
+蛟河县 13.900677652
+铁粉 11.7034530746
+同性恋 10.2630914922
+粒状 9.24671730182
+多数派 10.642581114
+淋洒 13.900677652
+铁律 11.1926274509
+剃得 11.1926274509
+一百七十多万 13.2075304714
+联合航空公司 11.9547675029
+灵隐寺 9.69598503258
+细布 11.7034530746
+赵登禹 11.8212361103
+午前 11.598092559
+广货 13.2075304714
+显色剂 12.5143832909
+腹菌目 13.900677652
+喂料 12.5143832909
+第十天 12.5143832909
+籽粒 11.0103058941
+能源部长 11.8212361103
+斯基著 13.900677652
+群聚 11.2616203224
+瓶盖 10.604840786
+打骂 9.96885201925
+监狱长 11.598092559
+顿开 11.598092559
+敬王修 13.2075304714
+铁心 10.4994802703
+汉明德 12.8020653633
+符阴 13.2075304714
+段业 11.2616203224
+刘仲武 11.3357282945
+拉斯金 12.8020653633
+亚当夏娃 12.8020653633
+史安斌 13.900677652
+触景伤情 13.900677652
+黄瓦朱 13.900677652
+会编 12.2912397395
+较理想 11.4157710022
+同春哥 11.2616203224
+寒颤 10.3743171274
+公共场合 11.7034530746
+公章 10.4666904475
+项城 10.0720362555
+改征 11.598092559
+改往 13.2075304714
+嗓子 7.87965430263
+法海鉴 13.2075304714
+马大呼 13.900677652
+喜逢 11.7034530746
+黑职介 13.900677652
+摄制 9.66657114738
+乐不思蜀 13.2075304714
+子季历 11.8212361103
+改得 10.6818018271
+呼天叫地 13.900677652
+偷窥 10.765183436
+长江三峡水利枢纽工程 12.1089181827
+恶霸地主 11.598092559
+林洁 13.900677652
+扩展 6.80065048535
+红儿真 13.900677652
+调研员 11.2616203224
+欧芹 12.8020653633
+金绳来 12.8020653633
+空间主权 13.900677652
+滑翔翼 13.900677652
+苏尔登 11.0674643079
+药料 11.5027823792
+赫西奥 12.2912397395
+汉穆拉 10.6818018271
+骆明 10.4994802703
+祖鲁族 13.2075304714
+恍如 11.1280889297
+吓一跳 10.4041700905
+偷窃 10.2897597393
+人非草木 11.5027823792
+唱红脸 11.9547675029
+磁性材料 10.2630914922
+惠泉酒 13.2075304714
+太尉御 13.2075304714
+木炕木 13.900677652
+那锅 12.1089181827
+大喜之日 13.900677652
+药方 8.84443184663
+起跑器 13.2075304714
+西伯昌 12.1089181827
+假名假姓 13.900677652
+档子 10.4666904475
+巴兰斯基 13.2075304714
+波利斯 10.604840786
+钱币 9.01032852375
+殒命 10.8096351986
+羊羔肉 13.900677652
+写作能力 12.2912397395
+等你拿 13.2075304714
+铁屑 11.7034530746
+星野 13.2075304714
+山山腹 12.8020653633
+关系史 10.8561552143
+积渐 12.5143832909
+四方形 10.4666904475
+接收数据 13.2075304714
+草绿色 11.0674643079
+好几百个 13.900677652
+企业法人 10.2630914922
+汤原县 12.8020653633
+改小 13.2075304714
+客栈 9.05649056552
+第一枝 12.5143832909
+关闭系统 13.900677652
+活动性 10.2630914922
+林海 10.3171587135
+好几百万 11.7034530746
+黄烷醇 12.8020653633
+首天 11.9547675029
+含蓄地 10.533381822
+是非得失 12.1089181827
+基本路线 11.0103058941
+会籍 13.900677652
+添箱 11.598092559
+醴陵 10.2371160058
+逃亡者 10.604840786
+明轩 12.2912397395
+王利发 13.2075304714
+采芝斋 12.5143832909
+光度学 11.3357282945
+东为楚 13.2075304714
+很多类 13.900677652
+家眷 9.12155415886
+血虚 10.1394775363
+输赢 9.37888907493
+堆上 10.533381822
+碎屑岩 9.66657114738
+林涛 11.9547675029
+郭里洼 13.2075304714
+林润 12.1089181827
+乙酰乙酸乙酯 11.598092559
+鸟为食亡 12.5143832909
+记者站 10.8096351986
+偷税 10.765183436
+摄入 8.24119543622
+铁岭 10.0505300503
+恩同父母 13.900677652
+例子 7.08613475472
+泪干肠断 13.900677652
+分离式 12.1089181827
+洛泰尔 13.900677652
+幕府时代 13.2075304714
+世丹 13.2075304714
+下大力 12.2912397395
+药敏 12.8020653633
+流氓无产者 12.1089181827
+感受力 12.8020653633
+药效 9.77354326693
+曲艺界 12.2912397395
+宁府宝玉 13.2075304714
+独角戏 11.598092559
+馆里 10.765183436
+位错 11.3357282945
+龙街 12.2912397395
+那间 9.00283785202
+撞人 11.5027823792
+赫尔谟 13.2075304714
+龙衮 12.8020653633
+伦左旗 11.4157710022
+萨福克 11.9547675029
+摆设 8.98069672615
+精神异常 11.5027823792
+李平 12.2912397395
+魏徵代 12.8020653633
+云梯车 13.2075304714
+一棍子 11.1280889297
+信真 12.1089181827
+形体 8.3285236198
+箱包 10.765183436
+十多具 13.2075304714
+不算什么 9.61021821083
+安营下寨 11.5027823792
+像是 6.37665623677
+赖氨酸 10.4349417492
+贺家坊 11.2616203224
+林氏 13.2075304714
+昭然若揭 11.9547675029
+航班号 12.8020653633
+硼酸 10.8096351986
+问来 11.0674643079
+心知肚明 10.0088573539
+同音字 11.9547675029
+金液 12.5143832909
+刘天华 12.1089181827
+赛克 12.2912397395
+丘铭 13.900677652
+群英 11.3357282945
+非杀不可 12.1089181827
+毫不含糊 10.3743171274
+蒙古高原 9.40086798165
+碟机 12.2912397395
+红叶树 13.900677652
+矩形管 13.900677652
+内存储器 12.8020653633
+上水道 12.8020653633
+月复一月 12.8020653633
+存款 7.07304841747
+安装公司 13.900677652
+寒水石 13.2075304714
+人民广场 11.8212361103
+杀毒软件 11.5027823792
+忧怨 12.8020653633
+两百四十三公里 13.2075304714
+书同文 12.1089181827
+八十八万 12.8020653633
+阳界 13.2075304714
+法拉利 10.8561552143
+车尔尼雪夫斯基 10.7226238216
+打顶 13.2075304714
+荆南之 13.2075304714
+第一架 9.41204128224
+林江 12.2912397395
+林汝 13.900677652
+毕卡 12.5143832909
+群芳 10.9049453784
+兰德 9.53122979951
+挑拨是非 13.2075304714
+共轭光线 13.900677652
+广远 12.8020653633
+台式机 11.9547675029
+食道癌 11.7034530746
+毕博 13.900677652
+前列腺 9.25628675283
+工作简报 13.2075304714
+高钠血症 12.8020653633
+光电子学 12.2912397395
+信石 12.5143832909
+广运 11.5027823792
+拉普语 13.2075304714
+全文完 13.900677652
+第四军医大学 13.900677652
+王二人 11.9547675029
+门荫结 12.8020653633
+疫苗 7.25039860339
+毕升 11.4157710022
+撞伤 10.9562386728
+忧思 10.1871055853
+就此而言 11.3357282945
+聊天室 11.8212361103
+行政法 10.8096351986
+端盘子 13.2075304714
+竞争上岗 12.2912397395
+存殁 12.5143832909
+农业贷款 12.1089181827
+不惜一切 10.5684731418
+半响 10.8096351986
+楼兰遗址 12.1089181827
+丹青妙手 13.900677652
+小作坊 11.1926274509
+举行宴会 11.598092559
+打颤 9.01032852375
+李建成 11.2616203224
+孙策 9.53122979951
+馆邸 13.900677652
+数据源 13.900677652
+夏承焘 11.9547675029
+柴堆 11.0103058941
+河东岸 10.9562386728
+商品量 9.29550746599
+偷笑 12.2912397395
+获胜 8.0484751722
+派出国 13.900677652
+布龙纳 13.2075304714
+捷书 11.9547675029
+若干块 12.2912397395
+古汉语 11.5027823792
+锚机 13.900677652
+巫蛊 11.1926274509
+班主任 9.43476953332
+霉气 11.598092559
+林泉 8.52539924429
+吴起仕 13.2075304714
+郭祥仰 13.2075304714
+盗伐 12.8020653633
+田黄王 13.2075304714
+屠灭 11.9547675029
+铁州 12.5143832909
+半咸 11.7034530746
+赛况 13.2075304714
+传宗接代 10.6818018271
+屡次三番 13.2075304714
+形义 12.8020653633
+群舞 11.3357282945
+路歧 12.2912397395
+谷歌 8.55834340001
+几百间 12.8020653633
+最小化 10.4041700905
+合伙人 9.13850371718
+央请 13.900677652
+日贾珍 13.2075304714
+拉斯谟 11.8212361103
+萝芙木 11.3357282945
+金融体系 8.10158499752
+高维山 13.2075304714
+精兵强将 11.5027823792
+段叔 13.900677652
+学术观点 11.5027823792
+会拜 13.900677652
+奥利安 12.2912397395
+螺旋板 13.900677652
+喜跃 13.900677652
+画工 10.765183436
+田东县 13.900677652
+打蜡 10.9562386728
+德丽 13.900677652
+连铸机 13.2075304714
+人言可畏 12.1089181827
+宣帝许 13.2075304714
+幡然醒悟 12.5143832909
+玄通 12.8020653633
+首都机场 10.0720362555
+星辰 9.44633035572
+转播台 11.7034530746
+第七句 13.900677652
+抓哏 13.900677652
+高文典册 12.8020653633
+冯保喊 12.8020653633
+下礼 11.9547675029
+药箱 10.0088573539
+轻徭薄赋 10.8561552143
+实纳 13.2075304714
+美标 13.900677652
+曾强 13.900677652
+不同于 7.46292600224
+撞倒 9.96885201925
+郭祥全 13.2075304714
+姐儿 9.46986085313
+监控台 13.2075304714
+宣帝诏 13.2075304714
+匡扶 10.765183436
+尽尽 13.2075304714
+鲁肃责 13.2075304714
+云鬓 10.7226238216
+赘物 13.900677652
+朱利安 11.0674643079
+姚义 12.2912397395
+视神经 10.4041700905
+会报 12.1089181827
+胥德章 9.21854642485
+周公语 13.2075304714
+云鬟 11.1926274509
+翼墙 13.2075304714
+多瑙河畔 12.8020653633
+三官庙 9.89334446674
+摆锤 12.1089181827
+艰苦创业 10.8096351986
+塑料袋 9.48183704418
+付国 12.8020653633
+用图表 13.900677652
+张寿臣 11.7034530746
+空军司令 10.9049453784
+花贵纱 13.2075304714
+栖居 9.74179456862
+丑类 11.598092559
+坪地 12.1089181827
+徒孙 12.5143832909
+饮下 11.2616203224
+孔明重 13.2075304714
+满腹牢骚 11.1280889297
+抚顺市 11.3357282945
+炼铁厂 11.598092559
+神宗之 13.900677652
+赌博业 13.2075304714
+群众观点 13.2075304714
+广通 11.0674643079
+铝热焊 13.2075304714
+肩挑 10.8561552143
+凤来仪 13.2075304714
+曾志 12.2912397395
+误触 13.900677652
+言纵衡 12.8020653633
+格雷格 12.5143832909
+龙阳 12.2912397395
+邓石如 11.1926274509
+树木园 11.598092559
+初中班 11.7034530746
+神宗亦 12.8020653633
+三轮车夫 12.8020653633
+午休 10.8096351986
+累进税 11.1280889297
+罗加 13.900677652
+会战 8.23771717184
+莫根施 13.2075304714
+赛事 9.31571017331
+独有 8.37921673411
+药筒 11.1926274509
+柴刀 11.1926274509
+偷摸 12.8020653633
+坪坝 12.8020653633
+云老爷 13.900677652
+神龙见首不见尾 12.5143832909
+娄敏中 12.5143832909
+刘师傅 10.8561552143
+卡罗维 11.0103058941
+捷克 8.33615724465
+嫩枝 10.0940151622
+沂蒙山 12.1089181827
+廉川堡 12.5143832909
+家庭计划 12.2912397395
+南北极 11.5027823792
+志存高远 12.5143832909
+安子会 13.2075304714
+网桥 12.8020653633
+加雷特 13.900677652
+龙陵 11.598092559
+断头将军 12.1089181827
+张王氏 13.2075304714
+长久以来 10.533381822
+醉金刚 12.1089181827
+波状纹 12.8020653633
+黄天荡 11.8212361103
+薄技 12.8020653633
+柴发 13.2075304714
+袭警案 13.900677652
+乐极生悲 11.3357282945
+解表法 11.8212361103
+孔明遂 11.2616203224
+获鹿 11.8212361103
+请示汇报 12.2912397395
+名儿 9.61021821083
+符坚令 13.2075304714
+美国明尼苏达大学 12.1089181827
+邹容著 13.2075304714
+连地仙 13.2075304714
+得其所哉 12.5143832909
+安子介 13.2075304714
+林父 13.2075304714
+好几百元 12.8020653633
+管园子 13.2075304714
+武帝想 12.2912397395
+摄于 11.9547675029
+巴斯托 13.2075304714
+晋江人 11.9547675029
+会掉 11.9547675029
+富拉尔基 11.2616203224
+藻类 8.62767809341
+赛会 11.2616203224
+法尔加 10.9562386728
+存留 9.54396882529
+努库阿洛法 12.2912397395
+划为 9.05649056552
+海中珍 13.2075304714
+置信度 12.8020653633
+哗啦声 13.900677652
+密使 11.0674643079
+林牙 10.2630914922
+林牧 10.7226238216
+非去不可 11.9547675029
+么妹 13.900677652
+七八千种 12.8020653633
+全宇宙 13.2075304714
+统一经营 11.0674643079
+形像 11.5027823792
+工业分散 13.2075304714
+松原市 12.2912397395
+赛似 12.8020653633
+探索性 11.598092559
+宝贝儿子 10.765183436
+家庭幸福 11.4157710022
+健美运动 12.5143832909
+伊斯坦堡 13.2075304714
+曾布 10.8096351986
+赛伯 13.2075304714
+林特 12.8020653633
+领袖像 13.900677652
+交互方式 12.2912397395
+司则合 13.2075304714
+云髻 11.0674643079
+罗二世 13.2075304714
+下移 9.44633035572
+勐腊县 12.5143832909
+高票当选 13.2075304714
+混棉 13.900677652
+木匾 13.2075304714
+存疑 10.642581114
+大通道 11.1280889297
+冯保听 10.8561552143
+撞出 10.4349417492
+撞击 8.46695564842
+算术平均 10.604840786
+画展 9.89334446674
+蒙元史 13.2075304714
+储谷 12.8020653633
+焦木 13.900677652
+偷营劫寨 12.1089181827
+堆儿 10.604840786
+网络设施 13.900677652
+蒙钧鉴 13.2075304714
+苏富比 12.2912397395
+依草附木 13.900677652
+李含光 12.8020653633
+画屏 12.8020653633
+陈春辉 13.900677652
+傅难芯 13.2075304714
+箭簇 12.5143832909
+白葡萄酒 11.0103058941
+心欢 12.8020653633
+实在是高 12.8020653633
+巫风 11.7034530746
+冯保命 13.2075304714
+摆钟 11.5027823792
+陈志强 13.900677652
+手动式 13.2075304714
+三鹰 13.900677652
+皮兰德 11.7034530746
+公益活动 10.4349417492
+在讲话中 9.61021821083
+欣闻 13.900677652
+肩扛 11.1280889297
+于起纳 13.2075304714
+果阿 11.1280889297
+河口镇 10.9049453784
+呢子 11.9547675029
+展开式 11.3357282945
+李氏原 13.2075304714
+乐昌公主 12.8020653633
+两三颗 13.900677652
+严重破坏 8.71889410168
+伊泽尔 13.2075304714
+回流率 13.900677652
+丁家宜 12.5143832909
+蝴蝶夫人 11.4157710022
+罗特希尔德 13.900677652
+古尔邦节 11.4157710022
+以求一逞 13.2075304714
+鸡肉饭 13.900677652
+色目人 10.1871055853
+非法人 11.4157710022
+龙钟 11.8212361103
+公生 13.900677652
+喜迎 10.4349417492
+众议员 9.71102290995
+险工 12.2912397395
+水滴石穿 12.2912397395
+成份股 8.86372504956
+毕业 6.23164936339
+安县 10.2117981979
+陶然自得 13.900677652
+一九六 11.4157710022
+朱金甫 13.2075304714
+超重低音 13.900677652
+纤维蛋白 10.6818018271
+阿尔卡特 12.2912397395
+第三十二届 13.2075304714
+因应 10.642581114
+擅场 12.5143832909
+唤来 10.604840786
+特许权 10.6818018271
+毕万 11.9547675029
+乱乎 12.8020653633
+强国之路 12.8020653633
+会想 10.3453295905
+于炀帝 13.2075304714
+温可礼 12.8020653633
+奥赫拉 13.900677652
+左眼 9.80633308975
+翁同和 13.2075304714
+路易十四 9.80633308975
+挑下去 13.900677652
+林将军 12.2912397395
+统和 10.604840786
+抗疲劳 11.1280889297
+立等 10.9049453784
+黄曲霉菌 13.900677652
+毛孩 12.5143832909
+最低谷 11.4157710022
+画得 10.4994802703
+退而求其次 10.9562386728
+画纸 12.8020653633
+盗劫 12.1089181827
+家母 10.765183436
+长驱直进 13.900677652
+不战而败 12.8020653633
+划上 11.5027823792
+群龙 11.0103058941
+徒手操 12.5143832909
+形变 9.91169360541
+嘉瑟 13.900677652
+嘉瑞 9.91169360541
+空间规划 11.4157710022
+迷信活动 11.7034530746
+史尹之 12.8020653633
+曾巩 10.7226238216
+公用 8.96620371885
+具体指导 11.2616203224
+讲解员 11.8212361103
+一百五十万贯 13.2075304714
+高温区 13.2075304714
+尹俊 13.900677652
+航天技术 10.642581114
+强加于 10.1164880181
+党组书记 9.66657114738
+那要 9.91169360541
+商得 13.2075304714
+米隆 12.5143832909
+输配 11.8212361103
+幼雏 10.9562386728
+武艺高强 10.8561552143
+仲平和 12.8020653633
+大老远 10.2897597393
+超高层 12.5143832909
+武太后 12.8020653633
+狼狗 10.5684731418
+代理商 9.4233408375
+五十余万 11.7034530746
+南北方 10.5684731418
+朱氏 10.0088573539
+电器店 13.2075304714
+泄劲 13.900677652
+高科技产品 11.2616203224
+统合 11.7034530746
+郭祥叹 12.1089181827
+赵武灵 10.1871055853
+海喷火 12.1089181827
+环保总局 13.2075304714
+购物单 12.8020653633
+时新 11.2616203224
+杜塞尔多夫 10.9562386728
+跳闸 12.8020653633
+存目 12.1089181827
+吹遍 13.2075304714
+郭祥叉 11.598092559
+侯门 11.8212361103
+卡拉巴赫 13.900677652
+小手小脚 11.7034530746
+欧鹏 9.77354326693
+烂成 11.598092559
+唐娜薇 13.2075304714
+险峻 8.6803218269
+打落 10.1394775363
+云顶 11.3357282945
+因循 10.604840786
+险峰 10.4349417492
+有良玉 13.2075304714
+威风扫地 12.5143832909
+盗取 10.4041700905
+虎头鞋 11.9547675029
+程麟荪 13.2075304714
+迎泽 12.5143832909
+河流补给 11.1280889297
+生死存亡 9.63799777493
+白晃晃 11.7034530746
+渠引沁 13.2075304714
+关系人 10.8096351986
+蒋阎冯 10.642581114
+脱亚论 13.2075304714
+纳资纳 13.2075304714
+谲诈 13.2075304714
+乙肝病毒 9.91169360541
+挑战者 9.74179456862
+黄依依 6.96142370593
+张生民 10.642581114
+相差无几 9.61021821083
+心许 13.900677652
+石头块 13.2075304714
+扩印 12.8020653633
+画廊 9.34680076038
+郭祥刚 11.5027823792
+摆阔 11.5027823792
+长轴 9.94943393339
+侮弄 12.5143832909
+存着 10.3171587135
+薄情 11.0674643079
+耀华 10.8561552143
+补报名 13.900677652
+腊戍 12.1089181827
+尹为 12.5143832909
+就职典礼 12.5143832909
+攮子 12.5143832909
+束风 12.5143832909
+龙门 8.60236028543
+画店 11.4157710022
+拱起 10.9562386728
+那行 11.0674643079
+郭祥前 13.2075304714
+商德 13.900677652
+林火 13.900677652
+船翻 12.2912397395
+堆叠 10.9049453784
+古崖居 13.900677652
+摊摊手 10.9562386728
+金氏 10.3743171274
+合伙制 12.2912397395
+席上珍 13.900677652
+巨核细胞 11.598092559
+薛克构 13.2075304714
+孔明弃 12.8020653633
+竺迩 13.2075304714
+冯保嘴 11.7034530746
+程序开发 13.2075304714
+研究生 8.40350942668
+捷利 13.900677652
+纪云 13.900677652
+利子 13.2075304714
+盗卖 11.7034530746
+形制 8.61241062128
+王兵败 12.8020653633
+薄怒 13.900677652
+收发机 13.2075304714
+绝世无双 13.2075304714
+莫斯航宇 13.900677652
+木兰县 12.8020653633
+沙涧渡 12.8020653633
+男女老幼 10.1630080337
+格雷欣 13.2075304714
+因式 13.2075304714
+生态学 9.11318590919
+画幅 10.6818018271
+工会法 12.5143832909
+鳞次栉比 10.5684731418
+短元音 11.8212361103
+精血亏虚 11.9547675029
+生物电流 12.5143832909
+谲诡 13.900677652
+新闻分析 12.1089181827
+偷来 10.3453295905
+会意 8.78268383956
+吃了亏 10.3743171274
+群鸦 12.8020653633
+各层 10.1871055853
+龙镇 11.7034530746
+开胃菜 12.8020653633
+陈光大 12.5143832909
+石凌鹤 13.2075304714
+方天戟 10.9049453784
+食虫目 11.2616203224
+迎水 13.900677652
+快车道 9.36807815882
+自豪感 10.1394775363
+楚恭王 12.5143832909
+轮机舱 13.900677652
+伸缩性 10.604840786
+扫过去 11.9547675029
+聚集地 11.1280889297
+翼足类 13.2075304714
+画布 11.1926274509
+严谨性 12.2912397395
+额吉诺 12.1089181827
+甫到 13.900677652
+航天事业 10.7226238216
+输送 7.97642185456
+画师 9.75754292558
+保持联系 10.8096351986
+星象 10.1164880181
+金汤 10.765183436
+杨阁部 11.5027823792
+摆酒 10.5684731418
+几百亿吨 13.900677652
+缓冲体 13.900677652
+初幼嘉 11.7034530746
+无党无派 13.2075304714
+风箱 9.34680076038
+子岳云 12.1089181827
+凶顽 10.9049453784
+瓦莱塔 12.5143832909
+击缶 13.2075304714
+浸入 9.91169360541
+曾孙 9.85762638414
+项下 9.62401153296
+元子 11.1280889297
+一时无两 13.2075304714
+曾子 11.598092559
+阿基诺 11.4157710022
+安全部 12.5143832909
+赘瘤 13.900677652
+秦震想 11.598092559
+劣马 11.1926274509
+伉俪 11.4157710022
+东条英机 11.5027823792
+于庆王爷 13.900677652
+武帝时 9.84023464143
+象话 13.2075304714
+大部分具 13.2075304714
+冯桂芬 11.8212361103
+平昌县 12.5143832909
+波带片 12.8020653633
+难舍难离 13.900677652
+子袭爵 13.900677652
+斯泰尼 13.2075304714
+悻悻而去 12.2912397395
+团结湖 12.8020653633
+那车 11.598092559
+前程无忧 13.900677652
+苛征 12.1089181827
+区域规划 10.3171587135
+苛待 12.2912397395
+灶底 13.2075304714
+九万个 13.900677652
+促发展 10.7226238216
+斯泰尔 12.8020653633
+偷情 10.4994802703
+好棒 13.2075304714
+鸟叫声 12.1089181827
+擅入 10.4349417492
+引来引去 13.900677652
+闷骚 13.2075304714
+打草 11.7034530746
+伟绩 13.2075304714
+格雷泽 13.2075304714
+赠送给 10.1871055853
+正月初 10.4666904475
+鲁肃见 13.2075304714
+王将闾 11.9547675029
+万票 12.8020653633
+利兹城 13.2075304714
+见怪不怪 10.3171587135
+莱因哈特 11.598092559
+理气止痛 13.2075304714
+那边 6.62758505598
+苏尔泽 13.2075304714
+王义 12.5143832909
+拖儿带女 12.5143832909
+军中无戏言 12.2912397395
+第二封 11.9547675029
+会晒 13.2075304714
+签上去 13.2075304714
+翼展 9.22784881751
+朱贵引 13.2075304714
+罗美薇 13.900677652
+有加无已 13.2075304714
+李雅轩 13.2075304714
+发动机 6.41126556847
+大仓 13.2075304714
+城市园林 12.2912397395
+那辆 9.28555713513
+孔明闻 12.1089181827
+方维 13.900677652
+解释一下 10.5684731418
+大鱼大肉 10.9049453784
+付到 13.900677652
+连香菱 13.2075304714
+裨将 10.9049453784
+六盏 12.1089181827
+制冷剂 10.5684731418
+会昌 10.4349417492
+椰子 8.83808261895
+碓房 13.900677652
+滑灏辨 11.8212361103
+盗名 12.8020653633
+起止日期 12.1089181827
+雕梁画栋 10.5684731418
+胃黏膜 11.7034530746
+曾家 11.7034530746
+装饰音 11.8212361103
+真维斯 13.900677652
+尿裤子 11.0674643079
+统分 12.5143832909
+蛔厥 12.2912397395
+涂过 12.5143832909
+药罐 11.4157710022
+翼尖 10.6818018271
+指示仪 12.5143832909
+画外 13.900677652
+云龙 10.4994802703
+统制 8.59737274392
+薄板 10.4666904475
+百分之六十 11.4157710022
+拥有量 10.8561552143
+满绿毛 12.8020653633
+半侧 12.1089181827
+改过自新 12.1089181827
+吐骨头 13.900677652
+抓出 10.4349417492
+晒版机 13.2075304714
+浸软 12.2912397395
+项伯 11.1280889297
+郭祥听 11.7034530746
+拉齐斯 13.2075304714
+电磁脉冲 11.3357282945
+王权之 13.2075304714
+傀儡戏 11.8212361103
+骑马 7.21856905453
+雅加达市 12.8020653633
+薄暮 10.642581114
+驴年马月 13.2075304714
+嘻嘻哈哈 9.91169360541
+几盏 10.4349417492
+雅鲁泽尔斯基 12.2912397395
+郭祥同 11.8212361103
+九万余 12.1089181827
+最新款 11.7034530746
+博南帕 12.2912397395
+药线 11.5027823792
+戎军 12.2912397395
+刘新生 10.8096351986
+八十八味 13.900677652
+乔治亚州 12.2912397395
+安阳市 9.48183704418
+锚栓 13.2075304714
+先砍 13.2075304714
+严控 9.82314020807
+云鹏 12.2912397395
+临街面 13.2075304714
+利奴羊 13.900677652
+确非易事 13.2075304714
+广闻 12.8020653633
+柴垛 11.7034530746
+鼓乐声 10.2117981979
+祀事 13.2075304714
+半世 10.533381822
+吃派饭 13.2075304714
+特莱斯 11.0103058941
+应急照明 13.2075304714
+好收成 11.1926274509
+达灵顿 12.1089181827
+妖风 11.5027823792
+战炮 13.900677652
+自动增益 12.8020653633
+三阶教 12.2912397395
+木原 12.8020653633
+衣钵相传 13.2075304714
+严峻形势 10.642581114
+斯德氏 12.2912397395
+郭祥呀 12.8020653633
+艄公 9.94943393339
+枞阳 12.2912397395
+踵事增华 12.2912397395
+存照 12.5143832909
+画境 13.2075304714
+燃放鞭炮 11.5027823792
+比较繁荣 11.8212361103
+趔趔趄趄 11.9547675029
+家法 9.93038573842
+半个 6.6493326686
+错误观点 11.0103058941
+半两 10.604840786
+豆固醇 13.900677652
+林白 10.0088573539
+林登 12.2912397395
+各岛 9.89334446674
+那身 10.0940151622
+半仙 11.4157710022
+南吴北 12.8020653633
+郭祥咬 13.900677652
+卫之子 12.8020653633
+捐资 10.4994802703
+王曹丕 13.900677652
+陈郡长 12.8020653633
+一千多匹 13.2075304714
+资本集中 10.9049453784
+微尘数 13.900677652
+恐怖电影 12.8020653633
+半份 13.2075304714
+和洽 12.5143832909
+徐太仆 13.2075304714
+中国网民 10.8096351986
+会来 8.98069672615
+半件 12.5143832909
+半价 10.9049453784
+浸过 11.5027823792
+三千步 12.8020653633
+作贼心虚 12.8020653633
+鲜蹦活跳 13.900677652
+代理制 10.8561552143
+联合国环境规划署 11.4157710022
+胡文焕 13.2075304714
+长子县 13.2075304714
+食人花 13.2075304714
+庐舍 11.2616203224
+会服 12.2912397395
+楚相春 13.2075304714
+会有 6.34529570774
+有模有样 11.0103058941
+半些 13.2075304714
+罗比尼 13.900677652
+劳动收入 10.9562386728
+圣母院 12.8020653633
+板升 12.2912397395
+会期 10.604840786
+十二度 13.2075304714
+溶剂脱蜡 12.8020653633
+监控器 13.900677652
+统包 13.900677652
+欧游 12.5143832909
+青黑 12.2912397395
+骑骑 13.900677652
+半亿 13.900677652
+打苞 13.900677652
+不教而杀 13.900677652
+努力 6.0229013187
+丁家山 13.2075304714
+宋五 13.900677652
+指示信 12.2912397395
+金沙 10.0294766411
+两捆 11.4157710022
+莱奥帕尔 11.8212361103
+多姿多彩 11.0103058941
+花心 10.8096351986
+路易十六 10.4994802703
+六九年 12.5143832909
+付印 10.5684731418
+一节课 11.3357282945
+林相 11.0103058941
+丰收年 11.3357282945
+古人类学 11.8212361103
+通风孔 12.2912397395
+院团 13.900677652
+胞质溶胶 13.900677652
+红色旅游 11.0674643079
+林生 9.30555780184
+霉病 12.5143832909
+一点儿一点儿 12.5143832909
+肖克利 12.8020653633
+罗斯坦 11.9547675029
+杉木 9.01032852375
+一千二百元 12.8020653633
+命门穴 13.900677652
+林甫 13.2075304714
+三百万镑 13.2075304714
+有禁不止 11.7034530746
+初中生 10.642581114
+薄施 10.9049453784
+邓太后 12.5143832909
+高斯分布 13.900677652
+努克 13.2075304714
+坪内 12.1089181827
+萨巴依 13.2075304714
+热带丛林 11.0103058941
+放箭 9.65218240993
+林甸 12.8020653633
+渗过 13.900677652
+管领清 12.8020653633
+中心词 12.8020653633
+两高 11.4157710022
+门槛 7.18650712207
+五脏六腑 9.6811699468
+钧命 11.7034530746
+协作性 13.900677652
+海州湾 10.4041700905
+恨起来 12.8020653633
+由小到大 10.8096351986
+腊月 8.92394390956
+曾央 13.2075304714
+画室 10.0720362555
+偷拿 12.5143832909
+呼玄德 13.2075304714
+梦寐以求 9.94943393339
+那起 10.533381822
+中心语 13.2075304714
+抖翻 13.900677652
+若干份 13.900677652
+偷拍 11.598092559
+丁吉相 12.1089181827
+色彩 6.75154605342
+提出抗议 10.642581114
+凌波步 13.900677652
+具体步骤 10.7226238216
+若干代 12.5143832909
+喜讯 9.46986085313
+广雅 11.598092559
+贝尔根 12.8020653633
+一个三四百 13.2075304714
+让我拿 11.9547675029
+澳门特区政府 13.2075304714
+果酒 11.0103058941
+金泰 9.27570483869
+冤鬼 12.1089181827
+自视甚高 11.5027823792
+广阳 10.9562386728
+齐布尔 12.8020653633
+重新占领 10.9562386728
+澄心 12.5143832909
+丁零当郎 13.900677652
+求爱记 13.900677652
+箭筒 11.8212361103
+恐怖事件 12.2912397395
+伊苏斯 13.2075304714
+闻天子 11.1280889297
+画字 12.5143832909
+李淳风 10.9049453784
+果酱 10.0088573539
+困难重重 10.0940151622
+黎利 13.2075304714
+曾姓 13.2075304714
+果酸 11.1280889297
+两万万两 13.2075304714
+主权国家 9.98865464655
+电码本 13.2075304714
+经济可行性 11.5027823792
+殷末帝 13.2075304714
+烘到 13.900677652
+烘制 12.2912397395
+若干个 8.95903522937
+凡天宝 13.2075304714
+定率 12.5143832909
+秋高气爽 11.1926274509
+黑更半夜 13.900677652
+哈利法克斯 11.7034530746
+广陵 9.53122979951
+抓到 8.92394390956
+映山红 13.2075304714
+生不带来 12.1089181827
+加太尉 13.2075304714
+受苦受累 12.5143832909
+青麻 11.9547675029
+喂给 10.9562386728
+陈俊 12.5143832909
+解决办法 9.40086798165
+热污染 12.1089181827
+罗唆 12.2912397395
+全军覆没 8.82550383674
+劝驾 13.2075304714
+捻军 9.87532596124
+马驰入 13.900677652
+比嘉草 13.2075304714
+比献忠 13.2075304714
+堆垒 10.9562386728
+木剑 13.900677652
+药粉 10.3171587135
+打的好 13.2075304714
+堆垛 11.598092559
+梅新育 10.765183436
+皮翼目 12.5143832909
+埃德温 12.5143832909
+记者 4.29694475313
+辛松钊 13.2075304714
+会旗 11.9547675029
+壮年人 12.2912397395
+转变态度 12.5143832909
+郭祥嘻 13.900677652
+时燕国 12.5143832909
+护发乳 13.900677652
+尼亚 9.00283785202
+抓取 11.2616203224
+林琴 13.2075304714
+林琳 13.900677652
+夷陵区 13.900677652
+箭竹 10.2371160058
+打者 12.8020653633
+嘉熙 11.2616203224
+工薪族 11.2616203224
+艾则孜 13.2075304714
+黄澍 8.10158499752
+电台节目 13.900677652
+同寝室 12.8020653633
+输钱 11.9547675029
+长颈 10.604840786
+欢忭鼓舞 13.2075304714
+载热剂 13.900677652
+开场白 10.2371160058
+吴恽 12.5143832909
+种子数 13.900677652
+鼻粘膜 10.642581114
+气势如虹 10.8096351986
+大亚湾核电站 11.5027823792
+启航 10.0088573539
+该国 7.89926277401
+剥掉 11.0103058941
+顽强抵抗 9.93038573842
+俄亥俄 10.1164880181
+戎参 12.2912397395
+洛入河 13.2075304714
+波莱尔 11.8212361103
+神情恍惚 10.9562386728
+付出 7.23882291143
+办学 8.98802276624
+尼什 11.5027823792
+险境 10.3743171274
+炉炭 13.900677652
+供排水 11.4157710022
+栖宿 12.2912397395
+倪贻德 12.2912397395
+打肿 11.8212361103
+从南到北 10.4666904475
+人口密度 8.79473217808
+钠长石 11.3357282945
+历晋 13.2075304714
+一千多只 13.2075304714
+巴哈纳 13.2075304714
+喂羊 13.2075304714
+堆土 11.9547675029
+翼形 12.1089181827
+青藏铁路 10.3171587135
+重氢 12.5143832909
+建设部 9.36807815882
+窦仪 13.2075304714
+白金汉宫 11.1926274509
+镜像文件 13.2075304714
+董卓拜 12.8020653633
+利德布尔 13.2075304714
+分布面 12.8020653633
+赘疣 13.2075304714
+堆场 10.765183436
+雷曼 8.61747392324
+不得善终 12.8020653633
+难测 9.85762638414
+暂定 10.4349417492
+古之僵尸 13.2075304714
+构造论 12.5143832909
+非公务 12.1089181827
+热瓦甫 12.5143832909
+砷酸盐 13.2075304714
+肌酐 10.5684731418
+段君 13.900677652
+笞刑 11.4157710022
+戎卢 12.8020653633
+喻宣 13.900677652
+轧帐 13.900677652
+搔扰 12.5143832909
+鲁库阿 13.2075304714
+文丞相 11.7034530746
+禁猎 12.1089181827
+监管部 10.9562386728
+朝中 8.61241062128
+掐头去尾 12.2912397395
+聚集区 11.1280889297
+许朱公 13.900677652
+获颁 12.2912397395
+打胜 10.2371160058
+吴新登 11.9547675029
+麻辣锅 13.900677652
+隋将宇 13.2075304714
+因子 8.3285236198
+三人成虎 13.900677652
+打胎 11.598092559
+养育之恩 11.4157710022
+秦震挥 13.2075304714
+会收 12.8020653633
+极性单体 13.900677652
+卞祥 10.765183436
+野叟 13.900677652
+由纪夫 12.1089181827
+药王 10.642581114
+鲁涤平 12.5143832909
+不忍 8.03989142851
+二端网络 13.900677652
+黄药眠 12.8020653633
+松雪道人 13.2075304714
+苏富扬 12.5143832909
+丑表功 13.2075304714
+屈尔佩 12.8020653633
+邛崃 11.4157710022
+百余平方公里 12.5143832909
+六十年代 9.84023464143
+龙麟 12.8020653633
+家庭婚姻 12.2912397395
+监控室 13.900677652
+偷油 11.9547675029
+啮齿类动物 11.9547675029
+尚锡亭 13.2075304714
+统建 13.900677652
+形如 8.82550383674
+标准状态 11.4157710022
+海岸线 7.9817837977
+晶圆厂 12.5143832909
+大型化 10.3453295905
+忍者神龟 12.8020653633
+甘紫菜 13.900677652
+穿针 12.2912397395
+跳鼠 11.0674643079
+抹粉 12.1089181827
+庙里 8.38322475551
+萨默斯 11.598092559
+放刁把滥 13.2075304714
+盗墓 8.05423887692
+游氏 13.2075304714
+打转 9.43476953332
+来处不易 13.2075304714
+八九里 12.5143832909
+椰城 13.900677652
+社会教育 10.6818018271
+膳房 12.1089181827
+庞德引 13.2075304714
+倒卵形 10.0940151622
+福雷尔 12.8020653633
+段家 12.8020653633
+六十元 11.8212361103
+记载 6.22838519635
+同中有异 13.2075304714
+公路交通 9.55687223012
+适时 7.91674137129
+批发业 12.1089181827
+实实地 13.2075304714
+郭守敬 10.2117981979
+安阳县 10.8561552143
+金张掖 12.2912397395
+宠物 9.94943393339
+段子 9.87532596124
+吐蕃王 12.1089181827
+汪海洋 12.8020653633
+印模材料 13.900677652
+李经方 13.900677652
+堆堆 12.2912397395
+现金余额 12.5143832909
+杭丝联 13.2075304714
+批发价 9.34680076038
+紧锣密鼓 9.40086798165
+推放 12.5143832909
+广安市 13.2075304714
+两三里 10.7226238216
+第三十二回 11.9547675029
+梭罗树 13.2075304714
+存粮 10.9562386728
+打输 12.5143832909
+绝缘物 13.900677652
+貂裘 11.3357282945
+郭祥妈 13.900677652
+同出同进 13.900677652
+尔贝尔 11.9547675029
+画商 12.8020653633
+团结报 11.5027823792
+张溶 12.8020653633
+浏阳河 11.5027823792
+烧菜 11.9547675029
+严老烈 13.2075304714
+黑鹰坠落 13.2075304714
+六七里 11.5027823792
+广顺 10.3171587135
+弗朗西斯科 10.2897597393
+险地 12.2912397395
+姿态控制 10.604840786
+沙和尚 9.46986085313
+血透 10.6818018271
+拧松 13.900677652
+竹筒子 13.2075304714
+宠爱 8.75318317516
+记过 11.598092559
+现金支付 10.3743171274
+统帅 7.68207753228
+诚心 9.27570483869
+洛迦诺 10.642581114
+打进 9.37888907493
+记述 7.78699547214
+猎潜艇 11.0674643079
+耳朵尖 11.7034530746
+家慈 13.900677652
+弹性力 11.1280889297
+适应需要 12.2912397395
+自新之路 12.2912397395
+刘高那 12.8020653633
+止痛片 11.5027823792
+女工 8.91707103027
+统带 10.3453295905
+打过 8.0229418702
+生词 13.900677652
+阴狠毒辣 13.900677652
+恰恰相反 9.02548032877
+攻起 13.900677652
+险固 11.1280889297
+航行权 11.4157710022
+执鞭坠镫 13.2075304714
+那般 9.02548032877
+将王 12.8020653633
+自伐 12.2912397395
+罪恶累累 13.2075304714
+防御能力 10.2371160058
+西藏地区 10.2117981979
+血量 9.93038573842
+官费生 11.7034530746
+龙龙 13.900677652
+箭无虚发 12.5143832909
+苏联国家安全委员会 11.9547675029
+窥豹一斑 13.2075304714
+抓差 13.900677652
+擦身而过 11.0103058941
+新花样 10.7226238216
+会比 9.03314320152
+中央广播电视大学 12.8020653633
+方镇洛 13.2075304714
+付得 12.1089181827
+赘笔 13.900677652
+九子 11.598092559
+开怀大笑 11.0103058941
+慢下来 10.8561552143
+水平式 12.2912397395
+甫士 13.900677652
+同盟军 10.0294766411
+三十余岁 13.900677652
+不尚空谈 12.5143832909
+欧罗巴人种 8.85725253506
+嗓子眼儿 11.7034530746
+雪佛莱 13.900677652
+试管婴儿 10.9562386728
+画品 11.9547675029
+共同致富 13.900677652
+子嘉贞 13.2075304714
+亿人次 10.1394775363
+陶恭祖 12.5143832909
+库利亚布 13.900677652
+心房扑动 13.900677652
+散言碎语 13.2075304714
+匡正 11.1926274509
+连钱草 13.900677652
+料器 11.5027823792
+一会方 12.5143832909
+收进来 12.1089181827
+诸公想 13.2075304714
+十中全会 11.8212361103
+形声 11.4157710022
+辩诬 11.8212361103
+陈洪范 11.9547675029
+大庆市 11.1280889297
+弩箭 10.1871055853
+南阳人 11.1926274509
+塑料膜 11.598092559
+咿咿唔唔 13.2075304714
+左右部 12.2912397395
+梦到她 13.900677652
+撞头 12.5143832909
+辩诉 13.2075304714
+库赛尔 13.900677652
+符节 11.598092559
+多数种 10.8561552143
+第四章 9.02548032877
+辩证 8.96620371885
+立端王 12.8020653633
+立命召 13.2075304714
+陆探微 11.598092559
+刘大杰 12.5143832909
+会歌 12.5143832909
+石亭江 11.9547675029
+学生证 12.8020653633
+金井里 12.2912397395
+电催化 13.900677652
+活化分析 11.0674643079
+泰宁县 13.900677652
+陈声 13.2075304714
+怙终不悛 13.900677652
+打躬 12.1089181827
+双辽县 13.2075304714
+潮信 13.2075304714
+阿卜杜拉 10.0088573539
+核心人物 10.3453295905
+三千条 12.2912397395
+宣府曰 13.2075304714
+牵丝攀藤 12.5143832909
+肌肉男 13.900677652
+卡纳克 11.598092559
+王平见 13.2075304714
+谷氨酰胺 12.8020653633
+卢阿拉 12.8020653633
+多层模式 13.900677652
+丑男 13.900677652
+起爆 9.94943393339
+药片 10.2117981979
+祝你幸福 12.2912397395
+望引兵 13.2075304714
+林立 8.39128931535
+迎春 9.14708746087
+缬草 13.900677652
+多数票 10.7226238216
+流落天涯 12.8020653633
+弘徽殿 13.2075304714
+任潼川 13.2075304714
+腊梅 9.62401153296
+那英 13.900677652
+耳目一新 10.3743171274
+巫郡 12.1089181827
+容志行 13.2075304714
+女职员 12.1089181827
+么儿 13.900677652
+药物 6.42760856394
+苛刻 8.80081122415
+郑渊洁 11.598092559
+水上飞机 10.4349417492
+卫之地 12.2912397395
+河南建业 10.4041700905
+段迎原 13.2075304714
+汀洲 13.900677652
+会款 12.8020653633
+星虫 11.8212361103
+龙齿 12.8020653633
+知新报 12.8020653633
+籽棉 12.8020653633
+抛来抛去 13.900677652
+画名 12.1089181827
+阳高县 12.1089181827
+第十二 9.80633308975
+江海湖 11.8212361103
+效率高 9.62401153296
+凶险 9.0884932966
+大雁塔 11.3357282945
+五十四斤 13.900677652
+幼鹤 13.900677652
+张铁男 9.71102290995
+第十五 9.93038573842
+双栖双 13.900677652
+量出为入 13.2075304714
+形容 7.73106691948
+打败 7.54456999128
+娉娉婷婷 11.598092559
+杨大娘 10.0720362555
+中英文 10.642581114
+三月初 9.98865464655
+封莱国 12.8020653633
+客籍 11.598092559
+螺旋浆 12.8020653633
+吕建 12.5143832909
+卡罗琳 11.9547675029
+供电局 11.4157710022
+泡桐 9.87532596124
+迂回曲折 10.3171587135
+武学之 13.900677652
+箭石 10.1630080337
+龚家村 12.5143832909
+孙寿梦 12.5143832909
+偷溜 13.900677652
+交通要道 8.6803218269
+张铁生 13.2075304714
+自作 10.8096351986
+郭祥学 12.8020653633
+冯保念 13.900677652
+人事全非 12.8020653633
+幼鸽 13.900677652
+打起 8.37921673411
+死无葬身之地 10.2371160058
+后劲不足 11.7034530746
+武学中 13.900677652
+草铺 11.3357282945
+白公馆 11.8212361103
+衷曲 11.0674643079
+龙鳞 10.0505300503
+迎新 11.2616203224
+打赢 9.71102290995
+政治经济 8.69119149913
+未知领域 12.1089181827
+不忙 9.93038573842
+加工工业 9.20932976975
+林祥 12.5143832909
+内脏器官 10.0294766411
+记起 8.40350942668
+薛西斯 11.8212361103
+幼鸟 10.2897597393
+冯保忙 12.5143832909
+定向操作符 12.2912397395
+宣帝至 13.2075304714
+第十代 11.7034530746
+刘勃舒 13.900677652
+神职人员 10.4994802703
+打赌 9.96885201925
+癫痫病 11.3357282945
+万人迷 10.9049453784
+官方消息 11.7034530746
+英姿飒爽 11.1280889297
+布鲁克林 10.765183436
+南北洋 11.8212361103
+统属 10.642581114
+格雷戈 13.2075304714
+欧阳 9.11318590919
+第十三 10.3743171274
+偷渡 10.5684731418
+李克用 10.3171587135
+邝曰广 13.2075304714
+第十一 9.44633035572
+北顿涅茨河 13.2075304714
+朱贵儿 13.2075304714
+阿斯旺 10.8561552143
+排下来 12.8020653633
+打趣 9.65218240993
+膂力 11.598092559
+灵蛇 13.900677652
+幼稚 8.82550383674
+迎敌 8.46695564842
+第十个 11.3357282945
+画坛 10.3171587135
+倒苦水 12.2912397395
+粒料 12.5143832909
+劝阻 8.57280148319
+常礼服 13.900677652
+居伯塞 13.900677652
+闵妃 12.5143832909
+移上去 13.900677652
+卦师 13.2075304714
+缺斤短两 13.900677652
+神会 11.4157710022
+希尔伯 13.900677652
+云量 11.1926274509
+中共鄂豫皖省委 13.900677652
+钱通 13.2075304714
+涌现出 9.16447920358
+林种 12.1089181827
+会标 11.9547675029
+趋使 13.900677652
+松江省 11.9547675029
+水火无情 13.900677652
+画圣 11.9547675029
+第十九 10.533381822
+喂狗 11.0674643079
+潺潺流水 12.2912397395
+劝降 9.09665660724
+多足类 13.2075304714
+元山 11.598092559
+老雕 11.3357282945
+馆藏 10.1394775363
+小任 13.900677652
+司马班超 12.1089181827
+服务上门 13.900677652
+青钱柳 12.1089181827
+存续 9.63799777493
+欧洲人 7.96050639926
+扣帽子 12.1089181827
+欧陆 11.1280889297
+齐庄公 12.8020653633
+会计系 13.2075304714
+胡海泉 12.8020653633
+烘干 9.89334446674
+例会 9.48183704418
+画圈 11.8212361103
+武帝欲 12.2912397395
+戎幕 12.8020653633
+竞拍 9.01032852375
+盗寇 13.900677652
+凝析气 13.900677652
+阿默斯 11.9547675029
+修仙长 13.900677652
+买笑迎欢 13.900677652
+刑事管辖 13.900677652
+打谱 11.9547675029
+三百万顷 12.8020653633
+打谷 13.900677652
+画图 10.6818018271
+于茂陵 12.5143832909
+萨扬舒 12.8020653633
+方城县 11.2616203224
+喊出去 13.900677652
+核军备 11.8212361103
+连斯基 11.7034530746
+烘得 12.5143832909
+费正清 13.900677652
+云遮 11.0674643079
+过把瘾 13.900677652
+不在意 8.71889410168
+记谱 10.2371160058
+胡富夫 13.900677652
+群集 10.2371160058
+停泊地 11.9547675029
+群雄 9.6811699468
+杳无人烟 13.2075304714
+阶级立场 11.0103058941
+喂猪 10.2630914922
+冯保府 13.2075304714
+胡海洋 11.8212361103
+群雕 12.8020653633
+有情人终 13.900677652
+安第斯地区 12.1089181827
+一笔一画 11.598092559
+泥娃娃 10.1630080337
+几百号 11.598092559
+快刀 11.4157710022
+急性子 10.7226238216
+三千文 13.2075304714
+国际劳工组织 11.3357282945
+跟你急 13.900677652
+农民银行 11.2616203224
+幼鼠 12.5143832909
+相距甚远 10.642581114
+宗正秩 12.8020653633
+中兴大业 13.2075304714
+辩解 8.83177344976
+编码方案 13.900677652
+斯瓦蒂语 13.2075304714
+风水宝地 10.0940151622
+保不住 9.32596667347
+抓得 10.4041700905
+沈庆之 13.2075304714
+任苏共 13.900677652
+八百余篇 13.2075304714
+柄政 11.2616203224
+协调控制 12.5143832909
+垂名竹帛 13.900677652
+那士子 13.2075304714
+旋床 12.5143832909
+炮筒子 11.7034530746
+陆核区 13.2075304714
+米特含 12.8020653633
+毛竹林 11.3357282945
+那股 8.89673134603
+抢下来 13.900677652
+望了望 8.81927328699
+传接球 12.5143832909
+花艳丽 13.2075304714
+武学修 13.900677652
+因地 9.89334446674
+冯保带 13.2075304714
+解剖麻雀 13.2075304714
+家户 11.0674643079
+崇高思想 13.2075304714
+收盘价 6.96045518286
+不起眼儿 12.5143832909
+金属家具 13.900677652
+全国五一劳动奖章 13.2075304714
+弃之可惜 13.2075304714
+女影星 12.5143832909
+偷漏 12.2912397395
+和平路 12.5143832909
+敞露 12.8020653633
+刘岩兄弟 13.2075304714
+灌溉系统 10.1871055853
+欧震 13.900677652
+面不改色 11.0103058941
+笨活 13.2075304714
+哈西鲁 13.2075304714
+晚些 11.1926274509
+顾祝同 11.1926274509
+斜路 13.900677652
+李老九 12.2912397395
+各级党委 10.3171587135
+傲然挺立 12.5143832909
+灌进去 12.2912397395
+黄浦区 10.2371160058
+堆存 12.5143832909
+夺下来 11.7034530746
+沟门 12.2912397395
+江楚会 13.2075304714
+经济范畴 11.0674643079
+小游园 12.8020653633
+添满 11.9547675029
+凭直觉 10.4349417492
+那能 10.6818018271
+音乐迷 13.900677652
+合同文本 12.5143832909
+例举 12.2912397395
+孔孟之 11.1280889297
+奸污妇女 13.2075304714
+浸膏 12.2912397395
+溜边 12.8020653633
+欧非 12.1089181827
+莫希 12.5143832909
+自供 11.9547675029
+生态区 13.900677652
+广魏 13.900677652
+有据可查 11.5027823792
+幼龄 11.1926274509
+三下两下 10.3453295905
+咸镜北道 12.8020653633
+梅雨期 11.598092559
+通常条件 13.900677652
+于临颍 12.8020653633
+撞客 12.5143832909
+卡他性 12.1089181827
+梭罗河 13.2075304714
+第九十一回 12.2912397395
+十多万两 13.900677652
+画出 9.45802639549
+掌击法 13.900677652
+二元酸 11.598092559
+纵深感 13.900677652
+生生不已 12.8020653633
+铁业 13.900677652
+铁丝 9.71102290995
+八里台 12.1089181827
+林缘 10.7226238216
+龙骨 8.70218062071
+阿蒙霍 12.5143832909
+卡萨特 12.5143832909
+赫尔默 12.8020653633
+开上去 12.8020653633
+抬过去 13.900677652
+低血糖 10.0088573539
+宁敦伍 13.2075304714
+龙骧 11.2616203224
+改乘 11.1926274509
+大角 10.4666904475
+玻尔兹曼 12.1089181827
+膺窗 13.900677652
+木兰 9.19114745066
+曾升 11.1280889297
+状态变量 11.1926274509
+改个 11.3357282945
+简介 8.95903522937
+迎接 6.92339631035
+由东向西 10.0720362555
+承受者 13.900677652
+改为 6.41070675314
+孕妈咪 11.0674643079
+林网 11.2616203224
+轻举妄动 9.38981814546
+徐宝璜 13.2075304714
+赔小心 11.9547675029
+半路上 9.17328983326
+云霭 13.2075304714
+淳于琼 11.8212361103
+改下 13.900677652
+廖承志 11.598092559
+咆哮如雷 11.598092559
+简仪 11.1280889297
+曹丕 9.19114745066
+保国卫民 13.900677652
+虚心学习 13.2075304714
+畜养 11.0674643079
+云霞 10.2630914922
+八大胡同 11.3357282945
+改业 12.5143832909
+云霄 9.87532596124
+溯流而上 12.2912397395
+简任 13.2075304714
+灾情惨重 12.8020653633
+药石 11.1926274509
+画册 10.0505300503
+美谈 11.7034530746
+画具 13.900677652
+曲流馆 10.604840786
+适意 12.1089181827
+改以 10.8096351986
+为期不远 10.9049453784
+格鲁吉亚共和国 12.8020653633
+一个二元 12.1089181827
+改任 8.87679713113
+智穷力 12.8020653633
+劝退 11.7034530746
+蒙方 12.8020653633
+持平之论 13.900677652
+古代文学 10.5684731418
+家政 10.1871055853
+尝一尝 10.7226238216
+斯蒂文 10.8096351986
+吃不来 12.5143832909
+那雀儿 13.2075304714
+花马剑 10.0940151622
+迈赫迪 13.2075304714
+匡源 12.2912397395
+长城博物馆 12.8020653633
+记认 13.2075304714
+真可怜 11.4157710022
+林语堂 11.5027823792
+曾参 11.598092559
+铁人 11.1926274509
+客站 12.1089181827
+两万顷 11.9547675029
+南亚松 13.2075304714
+险区 13.2075304714
+杜布 12.5143832909
+环京津 13.900677652
+白雪皑皑 11.3357282945
+公务员法 11.3357282945
+红砖墙 13.2075304714
+闪了一下 10.765183436
+哗啦啦 9.74179456862
+修正主义 9.53122979951
+改产 12.2912397395
+家数 8.52539924429
+学成回国 12.8020653633
+段式 13.900677652
+打诨 11.9547675029
+范佛里 13.2075304714
+双钩 11.598092559
+结实 8.00352378434
+堆山 11.598092559
+辣子肉丁 13.900677652
+百合花 10.4041700905
+昆仑山脉 9.75754292558
+花马刘 12.8020653633
+记诵 11.4157710022
+负面新闻 11.7034530746
+浸蚀 11.8212361103
+双关语 11.3357282945
+自修 10.3453295905
+改了 9.44633035572
+面露难色 11.8212361103
+二元醇 11.9547675029
+卖面子 13.900677652
+陈志刚 13.900677652
+矇眬 10.3171587135
+王启民 13.2075304714
+家教 10.533381822
+勾画出 10.8096351986
+潘念之 12.8020653633
+冯保奏 12.8020653633
+灭绝性 13.2075304714
+曾历 13.2075304714
+名地 12.8020653633
+内幕重重 13.900677652
+傲气 10.4349417492
+白话文学 12.1089181827
+稳定平衡 12.5143832909
+明矾石 10.4994802703
+超高压 9.5186510173
+雷汉义 11.2616203224
+刘梦云 13.2075304714
+记言 12.2912397395
+萦纡 12.8020653633
+大卡车 10.2117981979
+泰山区 13.900677652
+邪门歪道 11.9547675029
+馆舍 10.0505300503
+冰冻食品 13.900677652
+抚顺县 12.8020653633
+方盒 13.2075304714
+武元甲 12.5143832909
+求爱者 13.900677652
+葫芦 7.72273353793
+改住 13.900677652
+尘事 13.900677652
+满屋子 10.1394775363
+情有可原 10.0294766411
+中华电信 12.8020653633
+水禽 10.0720362555
+认真执行 10.4994802703
+云际 12.5143832909
+改作 9.74179456862
+大有分别 13.900677652
+中东部 9.63799777493
+画像 8.66423568915
+简便 8.44535653662
+金州区 11.8212361103
+破坏者 11.9547675029
+肉羹 11.9547675029
+云阳 10.3453295905
+上水船 13.900677652
+阻拦着 13.900677652
+联合国日内瓦办事处 13.900677652
+慈宁宫 9.14708746087
+亚文化 12.2912397395
+杂货船 11.9547675029
+电路系统 12.2912397395
+药盒 13.2075304714
+衷心感谢 11.0674643079
+共匪 8.58747167293
+巴斯湾 13.2075304714
+诸州均 13.2075304714
+乔良 13.900677652
+分子运动 10.4041700905
+搜索引擎 9.72629038208
+云阁 12.1089181827
+电灯泡 11.0674643079
+扬名立万 12.5143832909
+门士族 11.598092559
+珍馐美味 12.2912397395
+跳马 11.5027823792
+红三兵 13.900677652
+心象 12.1089181827
+七台 13.900677652
+采诗 12.2912397395
+喜联 12.8020653633
+可喜成绩 13.2075304714
+抓好 8.61747392324
+毕业班 11.8212361103
+云雾 8.42003872863
+人心思变 13.2075304714
+沂源 11.7034530746
+红三军 11.4157710022
+云雨 10.4349417492
+祝贺 8.74738605748
+壮大声势 13.900677652
+折衷主义 10.9562386728
+从征钦 12.8020653633
+顺乎自然 12.5143832909
+失意人 12.8020653633
+云雁 12.2912397395
+药瘾 13.2075304714
+数股 11.3357282945
+呼吸道 8.47572763449
+云集 8.42421410004
+哈贾吉 13.900677652
+林纾 11.1280889297
+蹦出 10.2897597393
+换来换去 11.8212361103
+长命百岁 11.1926274509
+评审组 11.8212361103
+跳高 10.2897597393
+突破口 9.12155415886
+劝酒 10.1394775363
+童子功 12.8020653633
+搜根剔齿 13.900677652
+交口称赞 11.598092559
+因公 10.3743171274
+巴斯滕 12.5143832909
+简体 12.1089181827
+险别 12.1089181827
+因其 7.5871296057
+卡塔赫纳 11.9547675029
+文虎克 10.8561552143
+短信息 12.8020653633
+土尔其 13.900677652
+睡得正香 11.3357282945
+存积 12.8020653633
+薄脉弦 12.8020653633
+鲍格丹 13.2075304714
+迎战 8.80081122415
+群速 12.1089181827
+苦肉计 10.9049453784
+武帝永 13.900677652
+门栓 12.1089181827
+瞪起 10.3743171274
+马元利 9.61021821083
+理发匠 13.900677652
+粟特语 12.8020653633
+画史 10.4041700905
+立体电影 11.4157710022
+连指儿 12.8020653633
+银条 11.4157710022
+泡汤 10.4994802703
+马诺河 13.2075304714
+席慕容 13.900677652
+这会儿 7.04632314972
+抖了起来 11.1280889297
+和平街 13.2075304714
+许景澄 11.0103058941
+鲁肃荐 13.900677652
+龙颜 11.0103058941
+药疗 12.8020653633
+遇上 8.11071748108
+捷径 9.49395840471
+湿疹 10.0720362555
+电梯间 11.7034530746
+血雨 11.0674643079
+自主 6.75864107727
+匡氏 12.2912397395
+会泽 11.5027823792
+有何面目 10.2897597393
+陆心贤 10.1630080337
+赵氏昆 13.2075304714
+药疹 11.9547675029
+独家生产 13.2075304714
+生态园 11.9547675029
+吴冷西 12.5143832909
+油光可鉴 13.900677652
+乘得 13.2075304714
+阙之禁 12.8020653633
+黑胶绸 12.5143832909
+前途渺茫 12.8020653633
+遭此 9.87532596124
+朽烂 10.2117981979
+未注册 13.900677652
+果香 11.598092559
+云锣 12.5143832909
+泡水 11.5027823792
+龙飞 11.1280889297
+佟夫人 10.7226238216
+解药灌 13.2075304714
+喜获 11.4157710022
+千岛湖 11.8212361103
+挡箭牌 10.4666904475
+啸聚山林 11.4157710022
+啼笑 12.1089181827
+数据网 12.2912397395
+徐二州 13.2075304714
+五十八岁 11.8212361103
+油田区 12.5143832909
+石竹科 11.9547675029
+小师弟 13.2075304714
+富春县 12.8020653633
+强迫性 12.1089181827
+雨侯 12.5143832909
+筒箭毒 12.2912397395
+罗斯国 12.5143832909
+始终 6.16830842969
+画卷 9.7898037878
+全面推广 11.1926274509
+险关 11.4157710022
+中晚期 9.65218240993
+取水口 12.8020653633
+功能模块 11.4157710022
+一个二十 12.1089181827
+精力旺盛 11.1280889297
+马腊格 12.5143832909
+战俘营 11.7034530746
+广义动量 11.598092559
+云门 11.1926274509
+云闪 13.900677652
+遇事 8.80081122415
+喷油嘴 12.8020653633
+卢浮宫 9.89334446674
+药用 8.3555002075
+家有 9.38981814546
+丑牛 12.8020653633
+形式 5.02315619812
+冷下来 11.8212361103
+获释 8.80081122415
+数星星 12.8020653633
+攻坚年 13.900677652
+绿得 11.5027823792
+搭桥术 11.8212361103
+居留证 12.5143832909
+想活 10.6818018271
+丘八 12.2912397395
+汪陵 13.2075304714
+泡沫 6.63524792872
+学究天人 13.2075304714
+丁家坎 13.900677652
+画匠 11.4157710022
+形影 11.3357282945
+讹言 11.5027823792
+主体资格 12.1089181827
+港澳地区 11.0103058941
+施维茨 13.2075304714
+假消息 12.1089181827
+箭猪 13.900677652
+血防 13.900677652
+家村 11.3357282945
+龙须 11.1926274509
+萍踪侠影 13.900677652
+汪陈 13.900677652
+第三十三届 11.8212361103
+会水 11.598092559
+霉素 10.0720362555
+郭祥忙 12.1089181827
+客观原因 10.533381822
+血海深仇 11.8212361103
+游龟山 13.2075304714
+坚如磐石 11.598092559
+螺旋桨 8.86372504956
+天全县 13.2075304714
+堆得 11.598092559
+波利瓦 13.2075304714
+客票 11.3357282945
+伏于寨 12.5143832909
+那营 13.2075304714
+一死一伤 12.8020653633
+亚太区 9.63799777493
+止泻剂 13.900677652
+唯唯连声 13.900677652
+小岛屿 12.1089181827
+龙首 10.8561552143
+地下河 9.94943393339
+下箸 12.8020653633
+遭殃 9.71102290995
+沙兄弟 11.4157710022
+卿智 13.2075304714
+七级风 13.900677652
+沂水 11.5027823792
+不知天高地厚 10.4994802703
+新线路 12.5143832909
+卫指挥 11.4157710022
+傅鞍酌 12.8020653633
+翼城 10.1630080337
+善处 12.2912397395
+共通点 12.8020653633
+卢萨卡 11.8212361103
+诵诗 12.8020653633
+公奏议 12.5143832909
+舍身 9.91169360541
+伊尹活 12.8020653633
+肚丝 12.1089181827
+小手指头 11.9547675029
+嘉福 13.900677652
+进香团 13.900677652
+撞开 10.4041700905
+做广告 10.4349417492
+冬烘先生 12.5143832909
+生态型 10.9562386728
+诟骂 12.5143832909
+波状热 13.900677652
+肚中 10.8096351986
+延安文艺座谈会 11.1926274509
+玩出来 13.2075304714
+电流线 13.2075304714
+模式化 11.598092559
+倚翠偎红 13.900677652
+气度不凡 11.9547675029
+获选 11.8212361103
+匡济 12.5143832909
+女师 13.900677652
+因受 8.42003872863
+巫陵 12.5143832909
+药瓶 10.7226238216
+流动比率 12.8020653633
+翼型 11.2616203224
+摈斥 12.8020653633
+长焰煤 11.9547675029
+迎恩 11.5027823792
+言不尽意 12.5143832909
+数据线 12.2912397395
+自助式 12.1089181827
+不战而胜 12.2912397395
+畜力 10.2897597393
+场景 8.12612610643
+应用性 11.2616203224
+工布江达县 12.8020653633
+快别 10.4994802703
+愚昧无知 11.3357282945
+切实可行 9.94943393339
+喜色 10.1630080337
+描上 13.2075304714
+地下水 7.64877376881
+方献夫 13.2075304714
+岛内外 12.8020653633
+太昊陵 11.5027823792
+专用名词 11.9547675029
+禁烟 10.1164880181
+林左鸣 11.5027823792
+进场费 12.2912397395
+嘉祥 11.1926274509
+求诊者 13.900677652
+编码方法 12.8020653633
+地理信息 13.2075304714
+画到 12.2912397395
+兼程 11.0103058941
+适才 8.57280148319
+宠用 13.900677652
+循环器官 13.900677652
+撞得 10.3453295905
+高档次 11.5027823792
+面带笑容 10.765183436
+迪拉 13.900677652
+龙喷彩 13.900677652
+生态圈 12.2912397395
+不明真相 10.8561552143
+坪塘 13.900677652
+嘉礼 11.8212361103
+涟源市 12.2912397395
+政法队伍 13.900677652
+订购者 12.8020653633
+从远安 13.2075304714
+会派 10.3171587135
+叉烧 12.2912397395
+陪笑脸 13.2075304714
+刺梅 12.8020653633
+吹吹打打 10.9049453784
+打裂 12.8020653633
+吹泡泡 12.5143832909
+刘尼 13.2075304714
+地理景观 11.1926274509
+心里打鼓 12.5143832909
+永不分离 12.5143832909
+斯蒂夫 13.900677652
+人民武装警察部队 12.2912397395
+屈招 12.8020653633
+学生手册 13.2075304714
+姚期智 13.2075304714
+半筐 12.5143832909
+被动免疫 12.1089181827
+薄厚 11.8212361103
+硇砂 12.5143832909
+阿斯彭 13.2075304714
+淘金网 13.900677652
+格里芬湖 13.2075304714
+昏迷不醒 9.6811699468
+改版 10.1630080337
+广德县 13.900677652
+乒乓球赛 12.5143832909
+管理方面 9.75754292558
+别无它法 12.8020653633
+造出来 10.8561552143
+坪林 13.2075304714
+民俗学家 13.2075304714
+边寿民 12.8020653633
+瓶子 8.89004235788
+曲艺家 13.2075304714
+工商银行 7.12759727632
+擅改 12.8020653633
+腊八 11.0103058941
+浦东南路 13.900677652
+新年伊始 12.8020653633
+秋冬尤 13.2075304714
+吃不完 10.604840786
+一个两万多 12.5143832909
+铁片 10.9562386728
+斯泰格 13.900677652
+签字仪式 10.2630914922
+飞镖 10.9562386728
+比科尔 12.1089181827
+会办 10.4349417492
+沂南 11.5027823792
+差速器 10.4666904475
+义利观 13.2075304714
+铁牛 10.533381822
+张楷 12.5143832909
+团队精神 11.8212361103
+鲟鱼 11.1280889297
+纷纷表示 9.69598503258
+阿密尔 13.2075304714
+尼科 11.598092559
+二十五个 11.2616203224
+词令 12.2912397395
+末班车 9.72629038208
+会加 12.8020653633
+会务 11.2616203224
+毛毯厂 12.2912397395
+美津浓 12.8020653633
+亲朋好友 9.85762638414
+玉阳子 13.900677652
+苍然 12.1089181827
+荃湾 12.1089181827
+黄尊素 11.5027823792
+刘大年 11.9547675029
+巴斯卡 11.8212361103
+亲自 6.05565323473
+铁犁 12.2912397395
+会前 10.8096351986
+山穴陵 11.0103058941
+金坛县 11.9547675029
+佟妹妹 12.8020653633
+河东王 12.5143832909
+匡助 13.900677652
+偷听 10.3453295905
+武帝元 11.2616203224
+三千幅 13.2075304714
+某队 13.2075304714
+柴扉 11.9547675029
+半篇 13.2075304714
+杨经理 11.1926274509
+瞎忙活 13.900677652
+李宗振 11.598092559
+偷吃 9.7898037878
+放光 9.96885201925
+奥德朗 13.900677652
+碱中毒 10.7226238216
+窦宪大 12.8020653633
+联防军 11.3357282945
+超高温 12.1089181827
+粒径 10.765183436
+共叙 13.2075304714
+简爱 12.1089181827
+家外 11.9547675029
+黑玫瑰 13.2075304714
+大米饭 11.9547675029
+五十余米 12.8020653633
+三千年 10.8096351986
+漏网之鱼 10.9562386728
+会刊 11.1280889297
+啮齿动物 11.3357282945
+泼出来 13.2075304714
+会分 12.8020653633
+代理权 10.7226238216
+简牍 10.1394775363
+比方说 9.96885201925
+家奴 9.16447920358
+钩起 12.8020653633
+好眼力 11.3357282945
+中幡 13.900677652
+内斯特 12.2912397395
+加默兰 13.2075304714
+保持系 13.900677652
+奇蹄目 11.1280889297
+康沃尔 11.1926274509
+柴房 12.1089181827
+灌溉渠道 11.2616203224
+宫夺印 13.2075304714
+徐有禄 13.2075304714
+敬谨亲王 12.5143832909
+世界霸权 10.4349417492
+意料中 11.4157710022
+女画家 12.5143832909
+杜伊勒 12.8020653633
+评剧 10.9049453784
+攻守俱佳 13.900677652
+遇热 11.2616203224
+冯保则 13.2075304714
+会到 9.98865464655
+农历年 13.2075304714
+黄湘 10.0505300503
+里面 5.68027455204
+举国之力 13.2075304714
+会友 11.0103058941
+简王 11.4157710022
+陈泯公 13.900677652
+山脚 9.35738286971
+无足称道 13.900677652
+窜入 11.4157710022
+接棒人 13.900677652
+郭祥怪 13.2075304714
+苏松太 12.2912397395
+卡罗伊 12.2912397395
+互惠待遇 12.5143832909
+氯化 9.53122979951
+如风 10.4041700905
+喻浩 13.2075304714
+山脊 9.01787572939
+会发 11.8212361103
+弄反 12.8020653633
+等电点 13.2075304714
+波状云 12.5143832909
+家境 9.5062284973
+曹伯 13.900677652
+半空 8.20358416547
+首都医科大学 11.9547675029
+宏规 13.900677652
+增长极 10.0088573539
+刺棱 13.900677652
+清商乐 11.8212361103
+干山 12.5143832909
+那木叉 12.2912397395
+偷喝 13.2075304714
+梅耶荷 11.598092559
+并无不可 13.2075304714
+元修义 13.2075304714
+会厌 12.1089181827
+东周时 12.1089181827
+韦尔纳 12.1089181827
+三尖瓣 11.8212361103
+核泄漏 12.8020653633
+孤清 11.4157710022
+窑主 11.9547675029
+公园式 13.900677652
+格雷姆 13.2075304714
+魏森博 13.2075304714
+国策 9.74179456862
+啰唆 11.2616203224
+长此以往 10.1394775363
+化水谷 13.900677652
+半程 12.1089181827
+毛发倒竖 12.2912397395
+若干种 10.4994802703
+宪法法院 10.9049453784
+咬着唇 13.2075304714
+勾魂 11.598092559
+顿珠 12.8020653633
+阿斯帕 13.900677652
+书画作品 10.9049453784
+朱亦松 13.2075304714
+侯朝宗 11.8212361103
+六瓣 12.5143832909
+技术犯规 13.900677652
+肘后方 13.900677652
+伊通河 11.4157710022
+抓斗 13.2075304714
+双间 13.2075304714
+大榕树 12.1089181827
+方岳贡 13.2075304714
+有神论 11.7034530746
+会去 10.0720362555
+伺服机构 12.1089181827
+窑上 13.900677652
+阵脚大乱 13.900677652
+情真意切 10.9049453784
+版面设计 12.5143832909
+努曼 12.5143832909
+交界面 11.1926274509
+仿生学 10.8561552143
+半站 13.2075304714
+副政委 10.604840786
+生生不息 10.642581114
+第七品 12.5143832909
+童养媳 11.0103058941
+薄刃 12.8020653633
+群英会 10.4041700905
+胡同口 9.94943393339
+格雷多 13.900677652
+粒度 10.2897597393
+戎政 11.0103058941
+进步分子 12.5143832909
+鹤鸣九皋 13.900677652
+格雷夫 11.1280889297
+后生小子 11.7034530746
+地委 8.88339781516
+亲耳 11.1926274509
+吴昂 13.2075304714
+小牛犊 11.4157710022
+铁环 10.0940151622
+指示管 13.900677652
+增长期 10.0940151622
+啰嗦 10.0720362555
+心身医学 13.900677652
+威士忌 11.8212361103
+盲肠 10.9562386728
+后参征 13.2075304714
+印英军 13.900677652
+法学部 12.1089181827
+制冷机 11.0103058941
+发起者 11.3357282945
+联邦政府 9.19114745066
+砂粒 10.6818018271
+海军后勤部 13.900677652
+亲聆 12.5143832909
+和汉志 13.2075304714
+郭祥想 12.1089181827
+家塾 10.7226238216
+晁衡 13.2075304714
+铁珠 13.900677652
+河东狮 13.2075304714
+膳宿 11.9547675029
+凌统引 13.2075304714
+幽默诙谐 11.9547675029
+甘肃兰州 11.0103058941
+墨尔本 9.91169360541
+付来 12.8020653633
+颁布法律 11.5027823792
+远隔重洋 12.5143832909
+弹膛 11.2616203224
+古代文明 9.30555780184
+木内 13.900677652
+曾士楚 11.9547675029
+划来划去 13.900677652
+驿站 8.91707103027
+第十六回 11.7034530746
+半神 11.8212361103
+人心思汉 13.900677652
+家室 10.2897597393
+飞霞 12.1089181827
+两江道 13.2075304714
+更深夜静 13.900677652
+比特流 13.900677652
+五十多里 12.5143832909
+鞍鞯 11.598092559
+家宴 10.0505300503
+加长型 11.598092559
+家家 8.80081122415
+添在 13.900677652
+额尔齐斯 11.9547675029
+地下冰 11.8212361103
+卖房子 11.8212361103
+家宅 10.604840786
+家安 12.2912397395
+罗文峪 12.5143832909
+无线电波 9.69598503258
+困兽犹斗 11.598092559
+星巴克 12.8020653633
+明清小说 11.7034530746
+女徒 13.2075304714
+特大城市 10.533381822
+山航 12.8020653633
+家宝 10.8096351986
+薄冰 11.0674643079
+书本知识 11.8212361103
+得分王 13.900677652
+望葭萌 13.2075304714
+洞房花烛 10.9562386728
+撞成 11.4157710022
+丑人 11.9547675029
+云蒙山 12.5143832909
+擅权 10.0088573539
+巴斯克 10.4666904475
+范质 12.5143832909
+武帝厚 13.2075304714
+财经部门 13.900677652
+爬山越岭 12.2912397395
+膳堂 12.8020653633
+奉化县 12.5143832909
+青风 13.2075304714
+怨谤 12.8020653633
+酒糟鼻 12.1089181827
+吴春 13.2075304714
+不和睦 12.2912397395
+盗抢 12.8020653633
+登封市 9.53122979951
+非公有 12.2912397395
+旅途 9.12155415886
+梁河县 13.900677652
+庞然巨 12.2912397395
+全真教 12.2912397395
+铁灰 13.900677652
+宋庆龄 9.49395840471
+若干章 12.2912397395
+王造时 12.5143832909
+大口井 13.2075304714
+丑事 9.75754292558
+顺延到 12.8020653633
+树林子 10.1394775363
+堆成 9.96885201925
+阿斯巴 13.2075304714
+动物毒素 12.8020653633
+铁炉 11.1280889297
+武帝升 12.8020653633
+贩售 13.900677652
+波菲利 13.2075304714
+卡尔纳克 12.8020653633
+笞杖 12.5143832909
+会停 12.8020653633
+半种 13.900677652
+耳提面命 12.2912397395
+偷嘴 12.2912397395
+盗打 11.8212361103
+宛良马 13.900677652
+感觉器 11.9547675029
+戎昱 13.900677652
+山芋 10.4349417492
+统摄 11.0103058941
+祀神 11.4157710022
+记者团 12.2912397395
+冯保本 11.598092559
+山花 10.5684731418
+调子 9.32596667347
+阿提卡 11.1280889297
+多翻空 12.8020653633
+梅格 13.900677652
+打破迷关 13.900677652
+李建伟 11.7034530746
+种植体 12.8020653633
+铁炮 11.5027823792
+小前提 13.900677652
+负责干部 11.7034530746
+陇海铁路 9.12155415886
+血战到底 11.4157710022
+半潜船 12.8020653633
+凌波微 13.900677652
+弯路 10.2630914922
+鼻子眼睛 11.3357282945
+家学 10.3453295905
+地下党 9.4233408375
+伊凡雷 11.2616203224
+导爆索 11.2616203224
+幸弘农 13.2075304714
+兔崽子 10.9049453784
+林教头 10.765183436
+适当 6.26392553954
+吃药 8.74738605748
+攻坚战 10.0088573539
+尹羲 12.8020653633
+云蒙峡 12.8020653633
+那玉眼 13.2075304714
+丑丑 12.5143832909
+曾涛 12.8020653633
+撒哈拉沙漠 9.41204128224
+神色不动 13.900677652
+高等级公路 11.0103058941
+袁水拍 13.900677652
+攒聚 13.900677652
+小菜蛾 12.1089181827
+家子 13.2075304714
+三千尺 12.8020653633
+水芝澳 13.900677652
+关系网 11.3357282945
+郭祥提 13.2075304714
+腥臭味 11.9547675029
+如飞 9.87532596124
+阮黑身 13.900677652
+吉祥寺 13.2075304714
+滑轴窗 13.900677652
+捷报 9.71102290995
+喜悦之情 12.8020653633
+弹药 7.57274086825
+藻丽 13.900677652
+适应 6.32560595247
+亏损率 13.2075304714
+西往 13.2075304714
+讲叙 12.5143832909
+迎峰 12.1089181827
+里长 10.533381822
+丛聚 13.2075304714
+剪纸作品 13.900677652
+十位数 13.900677652
+适度 6.6090214428
+谢家小子 11.1280889297
+中秋节 8.91707103027
+山茶 9.66657114738
+党的路线 10.642581114
+首府 7.38005652442
+椰油 11.2616203224
+仁至义尽 11.0674643079
+李医生 11.7034530746
+钠盐 9.89334446674
+多杀多 13.900677652
+偷垒 12.8020653633
+忆苦 11.4157710022
+象牙色 12.2912397395
+红皮书 12.8020653633
+瓶塞 11.1926274509
+淡淡地 8.80692745117
+督察室 11.9547675029
+梦兆 12.2912397395
+出落 11.8212361103
+若干篇 13.2075304714
+亳州市 11.598092559
+会写 11.8212361103
+音乐创作 9.85762638414
+烘染 11.9547675029
+盗掘 9.96885201925
+阿斯尔 13.900677652
+衷心 9.5186510173
+单音节 11.3357282945
+阮良 12.8020653633
+郭祥才 12.1089181827
+潘晟 10.3453295905
+膳夫 13.900677652
+厍颍 12.8020653633
+故事会 12.1089181827
+专款专用 10.6818018271
+孙九爷 7.66430806177
+曾氏 12.8020653633
+生殖力 12.5143832909
+奥连特省 11.9547675029
+估摸 9.32596667347
+地缘关系 11.5027823792
+可可岛 12.5143832909
+俯仰之间 13.2075304714
+大白菜 9.7898037878
+顿然 9.85762638414
+普里斯特 11.3357282945
+秦震坐 11.9547675029
+类病毒 11.2616203224
+里间 8.53003962385
+阿鲁沙 12.1089181827
+会党 10.2630914922
+魏徵卒 12.8020653633
+曾业英 10.3453295905
+半磅 13.900677652
+李建中 12.8020653633
+神话 7.48721869481
+妙语连珠 12.2912397395
+新西兰元 11.2616203224
+宋元图 13.2075304714
+戎服 12.8020653633
+藻井 10.5684731418
+段恺 13.2075304714
+阴鸷 11.5027823792
+哈尔帕 13.2075304714
+吴宗宪 13.900677652
+郭祥抗 13.2075304714
+形成 4.27215339948
+会兴 13.900677652
+马尼克 12.5143832909
+最优控制 10.4666904475
+拉齐卡 13.900677652
+马其顿人 10.7226238216
+木头人儿 13.2075304714
+半碗 9.46986085313
+山菜 11.4157710022
+米常仰 13.2075304714
+墨萨 13.2075304714
+武帝初 12.5143832909
+洛图科 13.900677652
+马傅颜 13.2075304714
+物理介质 13.900677652
+印绶 10.2897597393
+二战时期 11.0103058941
+种植业 8.58255765813
+作者姓名 12.1089181827
+逍遥客 13.900677652
+练摊 13.900677652
+飞雷 11.598092559
+贷款风险 9.7898037878
+蓝胡子 12.5143832909
+飞雪 10.2897597393
+会儿 8.94485059437
+法国菜 12.1089181827
+环境污染问题 11.2616203224
+一商 12.5143832909
+清华大学水利系 13.2075304714
+孟家 10.1394775363
+应用层 11.2616203224
+同豪格 13.2075304714
+诸汗国 11.4157710022
+薄型 11.8212361103
+爱情片 12.8020653633
+墨菲 11.8212361103
+郭祥支 13.2075304714
+戈尔恰 13.900677652
+段某 13.900677652
+德努瓦耶 12.8020653633
+六畜 11.598092559
+手表 8.56795885871
+姑老爷 12.1089181827
+科道言 12.5143832909
+伟人 9.80633308975
+剌激 13.2075304714
+喷镀 12.8020653633
+格纳库 11.0103058941
+路漫漫其修远兮 13.2075304714
+供电所 13.900677652
+墨菊 13.900677652
+统括 13.900677652
+祝彪道 12.2912397395
+神识 12.8020653633
+麻耳干 10.8561552143
+移牧 12.2912397395
+酵母菌 10.642581114
+梗阻 9.62401153296
+各处 7.52906580474
+鲁伯特 13.900677652
+挑灯夜战 12.5143832909
+半缕 13.2075304714
+迎客 10.2371160058
+险段 12.2912397395
+王阿罗 12.5143832909
+贺狄干 13.2075304714
+明秀园 12.2912397395
+凌子风 12.8020653633
+飘飘 9.5186510173
+飘飞 10.642581114
+蓟马属 13.900677652
+迎宾 10.2897597393
+有海子 12.8020653633
+赛程 11.598092559
+毛丫头 11.8212361103
+地下城 12.8020653633
+善士 12.5143832909
+十年磨一剑 9.96885201925
+唱诗班 11.9547675029
+粒子 7.69410172525
+稽查人员 12.1089181827
+女秘书 11.0674643079
+萧同兹 12.8020653633
+毫不在乎 10.3743171274
+站直 11.0674643079
+哈尔巴 12.8020653633
+汝可引 11.598092559
+简直 6.61998045659
+建德县 12.2912397395
+不老草 13.900677652
+怨言 9.19114745066
+中建 7.87965430263
+高飞球 12.8020653633
+迪波尔 12.8020653633
+伟业 9.45802639549
+庇佑 11.4157710022
+王丽娜 13.900677652
+布韦希 12.1089181827
+画楼 11.9547675029
+调研组 10.4666904475
+鄢陵 10.5684731418
+地契 11.3357282945
+描画 10.2371160058
+夸脱 13.2075304714
+貉绒 13.2075304714
+林乐培 13.2075304714
+热力学势 13.900677652
+黄浦江 9.4233408375
+欧洲中央银行 11.5027823792
+曹寨中 12.8020653633
+举目四望 11.9547675029
+摘取桂冠 13.900677652
+剩余物资 12.1089181827
+丁家洲 12.5143832909
+铁皮 9.49395840471
+印染厂 11.3357282945
+郯城县 12.2912397395
+陆承志 11.2616203224
+牝马 13.2075304714
+背风面 12.5143832909
+履行诺言 12.1089181827
+和茂陵 12.8020653633
+殊胜 12.5143832909
+双陆 12.8020653633
+离婚率 11.2616203224
+蜂拥而来 10.7226238216
+统战 11.7034530746
+种子园 12.8020653633
+教皇统治 12.5143832909
+吃不开 11.9547675029
+偷偷 7.94484028251
+铁盐 13.900677652
+武乙赐 13.2075304714
+铁盒 11.9547675029
+一百多岁 13.900677652
+深部 9.18217878068
+高锰酸盐 13.2075304714
+遮天 10.765183436
+烷基 9.69598503258
+托普卡 13.900677652
+六十卷 11.598092559
+元二帝 13.2075304714
+茫无头绪 13.900677652
+中坚力量 10.2630914922
+肚疼 12.2912397395
+国立 8.089536659
+男队 13.900677652
+漯河市 10.2897597393
+付掉 13.900677652
+弱阳性 13.900677652
+飞逝 11.4157710022
+飞速 9.36807815882
+文教部门 13.900677652
+宝丰县 10.2117981979
+病毒传播 12.2912397395
+九套 12.2912397395
+组稿 13.2075304714
+飘香 10.604840786
+盘绕着 13.900677652
+编写组 11.9547675029
+中府 12.1089181827
+付排 13.900677652
+纵火者 12.8020653633
+杨遇春 11.5027823792
+出色 7.45654639528
+统揽 13.900677652
+标志符 13.900677652
+排水管 10.8561552143
+国务总理 10.0088573539
+浪漫爱情 13.2075304714
+埃德尔 13.2075304714
+唱和 10.0294766411
+古斯塔夫 10.6818018271
+斯蒂尔 11.3357282945
+霍尔木兹海峡 11.7034530746
+还阳 11.1280889297
+官能团 10.2117981979
+万县市 11.8212361103
+冯保想 11.8212361103
+李托塔 12.8020653633
+隆武帝 11.7034530746
+出航 10.8561552143
+公益 8.70218062071
+阴风 9.59661255877
+统掌 13.2075304714
+放刁 11.598092559
+木僵 11.5027823792
+偷出 11.1926274509
+赫拉克 12.2912397395
+天怒人怨 11.4157710022
+崔玉贵 13.900677652
+乌鲁图 12.5143832909
+简短 9.15574552361
+一百八十八公斤 13.2075304714
+药价 10.9562386728
+女式 10.604840786
+汽车出口 10.765183436
+三千家 12.8020653633
+有福同享 11.7034530746
+简省 11.9547675029
+改短 13.2075304714
+第二十八章 10.3743171274
+翁飞先生 13.2075304714
+显示信息 13.2075304714
+和雪梅 11.8212361103
+前为 9.93038573842
+钠灯 11.7034530746
+旁边儿 13.2075304714
+耀斑 10.604840786
+项羽 8.86372504956
+药业 6.99693039439
+冰川退缩 13.2075304714
+李兆洛 13.2075304714
+基本素质 12.1089181827
+海门县 12.5143832909
+剥光 11.1280889297
+谋杀者 12.1089181827
+赵布泰 13.2075304714
+穷人家 10.642581114
+夸耀 9.58318953844
+砒石 12.8020653633
+普罗旺斯 11.0103058941
+堆放 9.29550746599
+家小 9.96885201925
+武帝命 13.2075304714
+药丸 10.3171587135
+出苗 10.9049453784
+探空仪 11.4157710022
+苯基 10.3743171274
+扇起来 12.8020653633
+偷入 13.2075304714
+祝辞 12.1089181827
+子陵栉 12.5143832909
+致使 7.2726362758
+伊春区 13.900677652
+抗凝剂 12.8020653633
+昧良心 11.2616203224
+出芽 10.9562386728
+等高线图 12.8020653633
+楞伽 11.4157710022
+铁矛 11.8212361103
+纪历 13.2075304714
+迎娶 10.0505300503
+国际台 12.8020653633
+两眼发呆 13.900677652
+半线 12.1089181827
+家居 8.98069672615
+家屋 11.7034530746
+匀齐 12.5143832909
+偷光 13.2075304714
+兔娃 10.4666904475
+铁石 11.5027823792
+古长城 11.1280889297
+瓶底 12.5143832909
+会场 7.95003509939
+半级 13.900677652
+会地 13.900677652
+林雪平 13.900677652
+家属 7.68606955355
+腥臭 9.94943393339
+铁球 11.0674643079
+抓拿 13.2075304714
+记恨在心 13.2075304714
+保修卡 13.900677652
+弄口 11.1926274509
+蛇口工业区 12.8020653633
+直根系 12.1089181827
+适宜 7.20983537456
+奋起直追 11.8212361103
+耀星 12.2912397395
+西明寺 13.2075304714
+福塔莱萨 12.5143832909
+东京帝国大学 10.3453295905
+若街亭 13.2075304714
+腥臊 12.2912397395
+张纯自 13.2075304714
+恢复能力 13.900677652
+周期函数 11.7034530746
+称觞 13.2075304714
+地方分权 11.598092559
+若干级 13.900677652
+巴哈伊 13.900677652
+抓拍 11.8212361103
+处死刑 11.7034530746
+匡君 13.2075304714
+阿斯奎 11.9547675029
+光辉 8.14810501315
+桃江县 13.900677652
+木像 13.2075304714
+吊索具 13.2075304714
+泡吧 11.8212361103
+法拉第 9.26594866375
+世界杯赛 10.642581114
+弯起 13.2075304714
+厦门航空 11.7034530746
+始终认为 10.9562386728
+腥膻 11.0103058941
+关平入 13.2075304714
+出脱 11.1926274509
+霍林舍 13.2075304714
+求救信号 11.0674643079
+十竹斋 13.2075304714
+静寂 10.2117981979
+六十匹 13.2075304714
+第三颗 11.8212361103
+通风管道 13.2075304714
+喂乳 12.5143832909
+父之过 13.2075304714
+张尧扬 11.4157710022
+出脓 12.2912397395
+排难解纷 12.5143832909
+意识流 10.4666904475
+出自 7.38744754106
+腥腥 13.2075304714
+薄唇 11.9547675029
+接合管 13.900677652
+傲慢无礼 11.7034530746
+凯尔恩斯 12.8020653633
+方舟子 12.5143832909
+第三页 12.8020653633
+会员 7.44862869754
+腥腻 13.2075304714
+偷到 11.5027823792
+妙香山 12.5143832909
+烘成 13.900677652
+很久很久 10.1164880181
+第三项 10.8561552143
+坏孩子 11.8212361103
+阴鬼 12.5143832909
+郁林 11.0103058941
+剥削 7.30626419223
+第二性征 10.7226238216
+巨鹿县 12.2912397395
+霎那间 11.7034530746
+段数 12.1089181827
+臁疮 13.2075304714
+抓手 9.75754292558
+烷基苯 11.1926274509
+德诺夫 12.8020653633
+沥青厂 13.900677652
+手动档 12.2912397395
+玛纳斯 10.2371160058
+以劣充优 12.8020653633
+会同 8.14810501315
+会后 8.28754954559
+会合 8.01735526349
+秦震刚 12.5143832909
+宝暹 13.2075304714
+阴魔 12.8020653633
+墨脱 10.2117981979
+垂直 6.84020128598
+烘托 9.72629038208
+冬季两项 12.1089181827
+逗人喜爱 13.2075304714
+迎头 9.87532596124
+铁瓜 13.2075304714
+杨老爷 11.8212361103
+起跑线 10.3453295905
+尼罗 10.4041700905
+毕竟 6.04281009264
+毕竞 12.2912397395
+付息 8.74738605748
+布雷器 12.2912397395
+未婚者 12.5143832909
+亲儿子 11.0674643079
+描着 12.2912397395
+固定汇率制 13.2075304714
+房屋出租 11.8212361103
+田润叶 10.0940151622
+副攻手 13.900677652
+双阙 12.1089181827
+山蛭 11.8212361103
+电力供应 10.0505300503
+文艺表演 12.8020653633
+添到 13.2075304714
+急性期 10.2630914922
+苛法 12.8020653633
+秋冬季 10.8096351986
+股骨 10.6818018271
+家庭 5.77593463159
+冯保抢 13.2075304714
+奔命 11.2616203224
+重新排列 12.5143832909
+家康 12.8020653633
+抓握 11.7034530746
+好到 10.8096351986
+谷一石 13.2075304714
+平等权 12.1089181827
+家庄 11.0674643079
+安福系 11.8212361103
+公司法人 11.8212361103
+不骄不躁 13.2075304714
+海州弘 13.900677652
+闭市 11.0103058941
+斯泰潘 13.900677652
+王朗奏 13.2075304714
+半米 9.84023464143
+鲁豫有约 13.900677652
+宏远 11.5027823792
+无拘束 12.8020653633
+家底 9.84023464143
+三三五五 12.8020653633
+永福县 13.900677652
+柴旦 11.8212361103
+家庙 10.2897597393
+铁画 11.9547675029
+刘大奎 11.3357282945
+改用 8.20023407859
+修练 13.2075304714
+密码箱 13.2075304714
+浦彩质 13.2075304714
+惯量主轴 13.900677652
+蚂蚁洞 13.2075304714
+舟骨 12.2912397395
+怀自危 13.2075304714
+宏达 9.91169360541
+郊区农业 10.533381822
+剥去 9.98865464655
+遇着 9.16447920358
+改由 9.16447920358
+一二千 11.2616203224
+氓流 13.900677652
+撞机 13.2075304714
+光栅尺 13.900677652
+银朱 13.2075304714
+线电压 12.5143832909
+探头探脑 10.4041700905
+已纳 12.8020653633
+安心乐业 13.2075304714
+沙拐枣 11.1280889297
+第三首 12.5143832909
+工程设计 9.58318953844
+泽旺子 13.2075304714
+指挥机构 9.89334446674
+进口药 12.8020653633
+一江春水向东流 10.8561552143
+因次 12.1089181827
+银粉漆 13.900677652
+刘大妈 12.1089181827
+晋广陵 12.8020653633
+会商 9.75754292558
+耙齿 12.5143832909
+羊毛脂 12.2912397395
+达南 13.900677652
+于元朝 13.900677652
+苛求 10.1164880181
+添加 8.0484751722
+旧版 11.3357282945
+落基山 11.0674643079
+不驯服 11.9547675029
+反派人物 13.900677652
+家常 9.30555780184
+喷雾 9.96885201925
+螺绕环 13.900677652
+顿生 10.9049453784
+甘南县 12.8020653633
+栖止 12.2912397395
+堆积成 10.642581114
+赖桑德 13.2075304714
+里里 12.2912397395
+抓捕 9.63799777493
+在下文 13.900677652
+伏左 12.8020653633
+左马太 13.2075304714
+执鞭随镫 12.5143832909
+罪恶行径 12.8020653633
+计数率 13.2075304714
+越南话 13.900677652
+因此 4.06434537463
+华歆奏 11.9547675029
+艳情 11.1926274509
+元永贞 13.2075304714
+三千多 10.2630914922
+伯仲之间 11.7034530746
+挠钩手 13.900677652
+波浪 8.46695564842
+傅斯年 10.7226238216
+杜门谢客 13.900677652
+抓挠 10.2897597393
+赛福 13.900677652
+北德路 13.2075304714
+馆际互借 13.2075304714
+两日游 12.8020653633
+肚皮 8.6966709649
+索超挥 13.2075304714
+简略 9.5062284973
+冰醋酸 11.598092559
+薄命 11.0103058941
+越南语 12.2912397395
+小酒馆 11.3357282945
+韦力转 13.900677652
+机密消息 12.1089181827
+会唱 11.1280889297
+冯保才 12.1089181827
+就坡下驴 12.8020653633
+墨迹 9.13850371718
+出轨 10.9562386728
+梳辫子 12.2912397395
+盛寒 13.2075304714
+出车 10.1164880181
+沃拉 13.2075304714
+椰果 12.8020653633
+商伯大 13.2075304714
+没食子酸 11.9547675029
+几百亿根 13.900677652
+于明公 12.8020653633
+毕琪 13.2075304714
+安济桥 11.9547675029
+阿拉伯叙利亚共和国 13.2075304714
+国土整治 12.1089181827
+土耳其语 10.8561552143
+扬基级 12.8020653633
+沟通 6.94890548758
+产权证 13.2075304714
+第三集 13.2075304714
+忘光 12.5143832909
+狂妄自大 11.9547675029
+关平引 13.2075304714
+若干点 12.8020653633
+椰枣 10.3743171274
+苏保衡 13.900677652
+应用型 11.8212361103
+池鱼 12.5143832909
+地下室 8.81927328699
+冷饮 10.3743171274
+卫国之 12.1089181827
+唱唱 10.9049453784
+指示牌 10.9562386728
+啦啦队员 13.900677652
+纪初 12.1089181827
+孙女婿 12.5143832909
+曾朴 11.9547675029
+睁眼瞎子 13.900677652
+决不罢休 11.0103058941
+金技玉 13.2075304714
+经天纬地 11.7034530746
+亲见 9.98865464655
+客串 11.1926274509
+膺任 13.900677652
+燕侯 11.7034530746
+形槽 13.900677652
+狎亵 12.8020653633
+杭忆哥 13.2075304714
+行时 10.4041700905
+简章 11.8212361103
+螺旋式 10.9049453784
+邛海 11.8212361103
+中国水利学会 12.5143832909
+广德寺 12.5143832909
+段段 13.2075304714
+元康 10.8561552143
+阴间 9.53122979951
+统筹规划 10.765183436
+稀释液 13.2075304714
+墨辊 13.2075304714
+曾有 8.27305653829
+武帝妻 13.2075304714
+阴门 11.3357282945
+排头儿 12.5143832909
+杰出代表 10.4666904475
+冀南区 13.2075304714
+耍无赖 12.1089181827
+锡克人 11.4157710022
+苛捐 11.7034530746
+加纳共和国 12.8020653633
+九流人物 13.2075304714
+按兵束甲 13.900677652
+嘉乔 8.170577869
+靛蓝 10.765183436
+乘虚而入 10.533381822
+嘉义 10.4349417492
+铁窗 11.3357282945
+暮云 11.9547675029
+堆栈 11.0674643079
+难易度 13.900677652
+家儿 13.900677652
+张广达 10.9049453784
+走索 13.2075304714
+出迎 9.33632946051
+职业中学 11.4157710022
+曾某 13.900677652
+摒绝 12.8020653633
+出过 8.87023973058
+缺乏自信 12.5143832909
+夺回来 10.604840786
+出进 11.4157710022
+保无虞 11.2616203224
+午睡 10.2897597393
+青年救国 13.900677652
+远远望 11.4157710022
+行业协会 9.0884932966
+泛游 13.2075304714
+禹曾 12.5143832909
+家公 13.900677652
+指北针 11.5027823792
+鲥鱼 9.89334446674
+侍董琬 12.8020653633
+家具 7.4855806928
+铁站 13.900677652
+家养 10.1630080337
+夸起 13.2075304714
+股长 10.604840786
+初到 9.16447920358
+夏至点 12.8020653633
+闭幕 8.22050504296
+李麦又 10.9562386728
+家兄 10.3743171274
+抚养费 11.0674643079
+吴敏 9.55687223012
+原告人 11.0103058941
+横加 11.4157710022
+走累 11.1280889297
+伊春市 10.604840786
+干扰能力 13.2075304714
+半环 12.5143832909
+家兔 10.8561552143
+韩林儿 10.9562386728
+棉大衣 10.642581114
+双下巴 12.1089181827
+第三队 11.598092559
+玄德安民 13.2075304714
+喷香 11.1926274509
+于是乎 10.533381822
+蒲东 11.9547675029
+古全浊 12.1089181827
+明目张胆 9.98865464655
+于杏城 13.900677652
+二伯父 12.5143832909
+徐海东 11.7034530746
+邻室 13.2075304714
+因斯 11.8212361103
+木块 11.2616203224
+三回九转 12.8020653633
+重油 10.8096351986
+开拓前进 13.900677652
+铁笔 13.2075304714
+改签 11.598092559
+互派大使 12.2912397395
+半片 12.2912397395
+汀州 11.1280889297
+足厥阴肝经 11.598092559
+第三十二条 13.2075304714
+美观大方 11.2616203224
+陈之佛 12.2912397395
+毕生 8.87023973058
+摆尾摇头 12.5143832909
+橄榄石 10.4994802703
+客位 10.2630914922
+车间经费 13.900677652
+泡子 10.8096351986
+进口货 11.8212361103
+碧霄 12.5143832909
+贵妃 8.89673134603
+客体 9.26594866375
+嘉信 10.9562386728
+康德黎 11.9547675029
+铁笼 10.3743171274
+匡季 13.2075304714
+狎侮 13.900677652
+因日 12.2912397395
+荡出 12.8020653633
+清查工作 11.5027823792
+细嫩皮肤 13.900677652
+国外经验 12.1089181827
+会宁 10.765183436
+梁河境 13.2075304714
+因时 10.765183436
+字字句句 12.8020653633
+会宗 12.8020653633
+半天空 13.2075304714
+爬高 11.4157710022
+核子动力 13.900677652
+萧太后 11.5027823792
+高殿帅 11.5027823792
+飞鱼 9.84023464143
+碧青 12.8020653633
+薄嫩 13.2075304714
+操厚赏 13.2075304714
+斯费尔德 13.900677652
+感染者 9.89334446674
+会审 10.1394775363
+会客 10.642581114
+推理小说 11.5027823792
+耿恭见 13.2075304714
+无独有偶 9.45802639549
+剔透玲珑 13.900677652
+海子卦 13.2075304714
+厍蛟硕 13.2075304714
+库函数 12.5143832909
+写作组 13.2075304714
+嘉佑 13.2075304714
+铁箍 11.4157710022
+魂不守宅 13.900677652
+形样 13.2075304714
+会存 13.900677652
+简笔 12.8020653633
+最新型 10.3453295905
+洗冤 11.5027823792
+喻旨 11.0674643079
+三千块 10.7226238216
+炕头儿 13.900677652
+石湖戴 13.2075304714
+铁管 11.1280889297
+廉把剑 13.900677652
+项王 11.9547675029
+古典作品 12.8020653633
+单板纲 12.8020653633
+顿笔 13.900677652
+杨志谢 13.2075304714
+铁箱 13.2075304714
+神州大地 11.598092559
+堪此重任 13.900677652
+康多莉 13.900677652
+等周问题 13.2075304714
+采摘期 12.2912397395
+东加勒比元 11.8212361103
+甘南州 13.900677652
+嘉会 11.8212361103
+出身 6.72978917346
+螺旋度 13.900677652
+蒋奇领 13.2075304714
+多层建筑 13.2075304714
+吴敦 12.8020653633
+因数 10.3743171274
+童装 11.4157710022
+简策 12.5143832909
+鸬鹚 10.9562386728
+羊脂玉 11.1926274509
+轮纹病 13.2075304714
+时蜀汉 12.8020653633
+因故 9.80633308975
+福建路 11.5027823792
+分子光谱 11.2616203224
+快降 12.8020653633
+见习期 13.2075304714
+戴宗问 12.8020653633
+凤元年 12.1089181827
+猪脑子 11.8212361103
+存下 11.598092559
+白渣 13.900677652
+铁砂 11.598092559
+咸鱼 11.1280889297
+不能治愈 12.1089181827
+吃不准 10.1394775363
+急智 12.8020653633
+刺五加 11.0103058941
+轮来 13.2075304714
+黎元洪 9.26594866375
+新正 11.9547675029
+有远见 10.4994802703
+铁车兵 12.8020653633
+出起 12.5143832909
+存世 10.4349417492
+十多名 11.2616203224
+张曙光 12.8020653633
+市石 13.2075304714
+真理必胜 13.900677652
+侯杨玉 13.2075304714
+替补席 12.2912397395
+交叉路口 10.9049453784
+出资 7.51717101709
+男风 12.8020653633
+出出进进 10.533381822
+尼玛 12.5143832909
+高品质 9.43476953332
+熔融指数 13.900677652
+范登堡 11.7034530746
+吃不出 12.8020653633
+欧尼修 13.900677652
+出赛 12.5143832909
+飞鼠 12.2912397395
+平行光束 12.2912397395
+好容易 8.70772080109
+天德军 11.598092559
+红细胞 8.68574189437
+家口 10.9562386728
+画架 11.9547675029
+张口结舌 10.0505300503
+明辨是非 11.7034530746
+总结 6.76181065203
+统一安排 11.0103058941
+出货 8.21709788464
+费用率 10.2897597393
+靡颜腻理 13.2075304714
+记者席 13.900677652
+家史 11.598092559
+傅元天 13.2075304714
+茵陈蒿 12.2912397395
+殒灭 13.2075304714
+添彩 12.2912397395
+推演出来 11.8212361103
+哈巴河县 13.900677652
+薄姑 11.598092559
+飘雪 11.9547675029
+指示灯 11.1280889297
+飘雨 12.8020653633
+统治 5.75194284304
+刀儿 13.2075304714
+德重宝 13.2075304714
+铁硫 12.5143832909
+小爬虫 11.7034530746
+草鞋 9.69598503258
+李心草 13.2075304714
+和菲菲 13.2075304714
+家叔 12.8020653633
+家变 13.900677652
+赵锡元 13.2075304714
+飘零 10.4349417492
+喻昌 13.2075304714
+偷带 12.8020653633
+佐料 10.2897597393
+西服店 13.900677652
+彩云追月 13.2075304714
+过场戏 13.2075304714
+中奖号码 11.8212361103
+铝制 10.3743171274
+画板 11.598092559
+肩头 8.25170341381
+柴桑 10.7226238216
+向内走 13.2075304714
+铁碗 12.1089181827
+菲尔茨奖 12.2912397395
+无锡小天鹅股份有限公司 13.900677652
+多姿多态 13.2075304714
+存亡之秋 12.8020653633
+阴霾 9.03314320152
+斯坎人 11.5027823792
+孙伏园 13.2075304714
+酿蜜 11.9547675029
+添得 11.8212361103
+阴霸 12.1089181827
+会填 13.900677652
+经济合作组织 11.5027823792
+存亡 9.20932976975
+因明 10.642581114
+牵记 13.900677652
+安得拉 13.2075304714
+偷师 13.900677652
+交流电 10.0505300503
+箫声 12.5143832909
+针灸疗法 11.4157710022
+生殖孔 11.1926274509
+修罗 12.5143832909
+茹毛饮血 11.3357282945
+刘老六 13.2075304714
+铁磁 10.8096351986
+匡昂 13.2075304714
+青红芽 13.2075304714
+半熟 11.7034530746
+三千名 11.9547675029
+秦从雍 12.5143832909
+多巴哥 11.2616203224
+肉类 8.28027678626
+会堂 9.93038573842
+枣阳市 12.8020653633
+摄生 11.7034530746
+若干片 11.8212361103
+磨牙齿 13.2075304714
+溃疡性 11.3357282945
+缘悭一面 13.900677652
+橄榄球 11.0674643079
+七万二千六百九十处 13.2075304714
+吉安地区 11.8212361103
+足部按摩 13.900677652
+铁路车辆 11.0103058941
+瓶内 11.0103058941
+保平安 11.7034530746
+柴根 13.900677652
+出超 11.0674643079
+耳翼 13.2075304714
+第六十六章 13.2075304714
+滨州市 11.1926274509
+政治结论 13.2075304714
+上焙乾 12.8020653633
+空间设计 11.8212361103
+含山 12.1089181827
+颠鸾倒凤 12.2912397395
+言多必失 12.1089181827
+禅城区 12.5143832909
+阴面 11.9547675029
+雷基王 13.900677652
+家务 9.01787572939
+弄清楚 8.92394390956
+改祭 13.900677652
+秦震忙 13.2075304714
+飞鸟 9.66657114738
+海州区 12.5143832909
+顶呱呱 13.900677652
+好些个 11.9547675029
+第三间 12.5143832909
+投融资 9.10488710638
+真令人 11.1926274509
+林哈德 13.2075304714
+鲨烯 12.1089181827
+伸平 12.2912397395
+心狠手毒 13.2075304714
+秦震心 12.8020653633
+蜂王浆 11.4157710022
+撞死 10.5684731418
+符号表 12.2912397395
+飞鸽 12.2912397395
+飞鸿 13.2075304714
+不服气 9.21854642485
+闪去 13.2075304714
+匡复 11.9547675029
+偷得 12.1089181827
+记性差 13.900677652
+辛温香 13.2075304714
+唱喏 10.642581114
+传出去 9.72629038208
+催逼 10.2897597393
+飞鸣 11.4157710022
+因果 9.55687223012
+忤逆不孝 12.1089181827
+六块钱 11.7034530746
+龙盘虎踞 13.2075304714
+团结党 11.3357282945
+喜兴 12.5143832909
+魏宏运 13.2075304714
+罗文喊 12.8020653633
+巢东 11.0674643079
+胆大心细 11.1280889297
+海州卫 12.2912397395
+斯图加特市 13.900677652
+共轭物 13.900677652
+偷心 13.2075304714
+都护府 9.20932976975
+飞鹰 12.5143832909
+铁票 13.900677652
+总经销商 13.900677652
+鄢陵北 12.8020653633
+整顿纪律 13.900677652
+布鲁金斯 11.2616203224
+简称 5.92236668211
+进口车 10.642581114
+阴雨 9.63799777493
+剥得 10.9562386728
+薄壳 11.5027823792
+不敢想像 11.9547675029
+阴阜 13.900677652
+烤鸭 10.7226238216
+向东看 13.900677652
+大白话 11.5027823792
+苏尔古 12.8020653633
+烤鸡 11.7034530746
+阿斯哥 13.900677652
+核潜艇 8.21370229564
+家制 12.8020653633
+厚福 12.8020653633
+改称 7.05692770297
+画景 13.900677652
+研究进展 11.7034530746
+阴道炎 9.77354326693
+小李飞刀 13.2075304714
+改种 11.4157710022
+车老板 12.1089181827
+颜福兴 12.8020653633
+影像学 11.5027823792
+独来独往 11.1280889297
+阴阴 11.1926274509
+物以稀为贵 11.9547675029
+中德 11.1280889297
+会好 9.98865464655
+老婆儿 13.2075304714
+北大医院 12.8020653633
+改租 13.900677652
+简示 13.900677652
+纳金花 12.8020653633
+杨太尉 11.4157710022
+阿斯哈 13.900677652
+十两三 13.2075304714
+专攻 9.56994431169
+鄢陵县 11.9547675029
+王子英 13.2075304714
+摄理 12.8020653633
+添建 12.1089181827
+鳏夫 11.9547675029
+由点到面 12.5143832909
+尼特 12.1089181827
+旋转轴 11.1280889297
+憋着 9.74179456862
+下料 13.2075304714
+罗拉特 11.598092559
+迎合 8.92394390956
+卧不安 13.2075304714
+东冲西 13.900677652
+半点 8.10461990121
+栖木 13.900677652
+春姑 13.2075304714
+君临 11.2616203224
+剥开 10.642581114
+领班 9.38981814546
+因材 11.9547675029
+心宽 12.5143832909
+深圳市人大 13.900677652
+阴险 9.7898037878
+会头 13.2075304714
+首尔 9.53122979951
+云飘逸 12.8020653633
+项燕 11.8212361103
+泡妞 12.5143832909
+银冕 12.8020653633
+心肌细胞 11.3357282945
+罢黜百家 10.5684731418
+大型机 11.5027823792
+各抒己见 10.9562386728
+收发信机 12.8020653633
+纹路 9.82314020807
+耽于 11.5027823792
+出警 10.8561552143
+薄待 11.9547675029
+冷冰冰 9.62401153296
+盗泉 13.2075304714
+察布查尔锡伯自治县 12.2912397395
+和好相处 13.2075304714
+林伟 13.900677652
+价格便宜 10.0720362555
+你们好 10.5684731418
+编码方式 12.2912397395
+坎德拉 11.8212361103
+评审会 10.533381822
+几次三番 11.2616203224
+简约 9.74179456862
+山谷 7.65845438652
+赛特 11.7034530746
+符合人体 11.9547675029
+双塔堡 11.9547675029
+宣通 12.2912397395
+不弱 10.9049453784
+帕努伊 12.8020653633
+木城 11.0103058941
+烤肉店 13.900677652
+电话本 12.8020653633
+简练 9.27570483869
+满天星 10.9562386728
+蒙特塞拉特岛 13.900677652
+普通病 12.8020653633
+搬掉 11.9547675029
+留声机 10.2117981979
+标志牌 11.9547675029
+会庆 13.900677652
+山溪性 11.1280889297
+灿烂辉煌 11.4157710022
+任威廉 12.1089181827
+重振雄风 12.8020653633
+半眼 12.5143832909
+鄢陵君 13.2075304714
+阴宅阳 13.2075304714
+曹魏立 12.8020653633
+躲闪不及 11.0103058941
+科雷利 13.2075304714
+休斯顿 11.598092559
+无数盏 12.8020653633
+牵起 11.9547675029
+坚韧 8.89673134603
+标志物 10.9562386728
+牵走 11.4157710022
+桃酥 12.8020653633
+股金 10.9049453784
+奉命行事 11.8212361103
+孙失烈 13.2075304714
+余壮远 10.3171587135
+程文华 13.900677652
+别里哥 12.2912397395
+于今为烈 13.900677652
+中晚唐 11.5027823792
+沙荒地 13.900677652
+潮乎乎 13.2075304714
+圣彼得大教堂 11.2616203224
+欲仙欲死 13.2075304714
+飘送 12.8020653633
+郭祥涨 12.2912397395
+掉头 8.50251495046
+盗汗 9.65218240993
+苛杂 12.8020653633
+飘逝 12.8020653633
+分毫不差 11.8212361103
+四年制 13.2075304714
+涮洗 13.900677652
+柴湾 13.2075304714
+亲贵 9.59661255877
+三千副 13.2075304714
+孔逸 12.8020653633
+出诊 11.1280889297
+忆起 11.4157710022
+改练 12.5143832909
+改组 7.87723005901
+氟利昂 10.9562386728
+铁纱 13.900677652
+匡庐 11.598092559
+飘逸 9.71102290995
+民间艺人 10.8096351986
+古典艺术 11.1280889297
+川牛膝 12.2912397395
+讲演会 12.5143832909
+会干 11.598092559
+薄弱 8.28027678626
+面条儿 13.2075304714
+简繁 12.5143832909
+会师 8.40761620864
+出让 8.31718134319
+楼空 11.8212361103
+项目 4.88283039212
+南北宽 8.80692745117
+寡断 13.900677652
+宋淦鳌 13.2075304714
+电视电台 13.900677652
+改约 12.8020653633
+豆腐渣工程 12.1089181827
+撞沉 11.8212361103
+事故责任 12.1089181827
+出访 9.45802639549
+郭祥深 12.8020653633
+改线 11.4157710022
+林俐 12.5143832909
+如上所述 10.642581114
+例示 13.2075304714
+创投公司 10.533381822
+武中元 12.8020653633
+罗文刚 13.900677652
+亲赴 9.96885201925
+埃雷利 13.900677652
+高丽往 12.8020653633
+家商 13.900677652
+皮锡瑞 13.900677652
+日光温室 12.1089181827
+首尾 9.15574552361
+饥不择食 11.4157710022
+劳兄 13.2075304714
+画意 11.8212361103
+陈光明 13.2075304714
+输出量 10.4666904475
+添堵 12.2912397395
+林一 13.2075304714
+牟平 11.1926274509
+林下 9.28555713513
+芒状 12.8020653633
+会心 10.642581114
+泡影 10.642581114
+中央歌剧院 13.900677652
+行政 6.11912169274
+峻工 11.9547675029
+连成一片 9.40086798165
+林东 12.2912397395
+壳多糖 13.900677652
+徜徉于 12.8020653633
+弹起 11.4157710022
+躲起来 10.2117981979
+半白 12.5143832909
+半百 12.1089181827
+裁量权 11.5027823792
+临界现象 12.8020653633
+自给有余 10.6818018271
+林中 8.36334338496
+讲经说法 12.2912397395
+山贼 11.0674643079
+阴笑 11.7034530746
+完全同意 10.4041700905
+译者 9.56994431169
+控制目标 11.8212361103
+公私合营 9.93038573842
+林丽 13.900677652
+林丹 12.5143832909
+第十种 13.900677652
+基督教协会 13.2075304714
+专收 12.2912397395
+自行车道 11.7034530746
+实用主义 9.82314020807
+相互依赖 10.5684731418
+铁网 12.2912397395
+铁罐 12.5143832909
+金鸡纳霜 11.7034530746
+阴郄 13.900677652
+会得 10.9049453784
+卡纳斯 13.900677652
+三十户 12.8020653633
+阴郁 9.77354326693
+泡开 11.8212361103
+海富通 8.26588804881
+李女士 9.59661255877
+曲艺团 12.5143832909
+针纺织品 13.2075304714
+整队 10.0720362555
+愁滋味 12.8020653633
+宁宫太后 11.4157710022
+米特拉 11.598092559
+店门口 11.1280889297
+出言 9.7898037878
+亚纳邦 12.8020653633
+焚尸炉 10.0294766411
+阴部 10.0940151622
+五集 13.2075304714
+水流花谢 13.900677652
+少量重 12.8020653633
+喻意 12.2912397395
+黑曜石 12.2912397395
+孙静之 13.2075304714
+改编 7.61467955747
+第三系 9.74179456862
+拔尖儿 12.2912397395
+有登仙 13.2075304714
+爱红妆 13.900677652
+千分表 13.2075304714
+肠肚 12.5143832909
+醉到 13.900677652
+定时炸弹 10.0505300503
+半盒 12.1089181827
+卷图 13.900677652
+中将 7.72273353793
+简编 10.5684731418
+塔列朗 12.2912397395
+开会时间 13.900677652
+弹跳 10.4349417492
+山越 11.2616203224
+肩带 11.0103058941
+林产 9.85762638414
+子飞 13.900677652
+林亭 13.900677652
+简缩 13.2075304714
+隋文帝 9.48183704418
+布雷克 12.5143832909
+外经外贸 13.900677652
+逻各斯 11.7034530746
+付款 8.82550383674
+黎平县 13.900677652
+适值 11.1280889297
+资讯网 10.9049453784
+难追踪 13.900677652
+于公室 13.2075304714
+诸可宝 13.900677652
+飞飞 12.8020653633
+人类学者 11.598092559
+阴道 8.44109213783
+鬼天气 11.9547675029
+武帝封 12.8020653633
+国家经济体制改革委员会 13.2075304714
+一簇簇 10.9562386728
+侦结 13.900677652
+山遥路远 13.2075304714
+剥夺 7.89432449237
+山稀柿 13.2075304714
+天军 13.2075304714
+堆浸 13.900677652
+封陈王 12.8020653633
+几十棵 12.2912397395
+李宁杯 13.900677652
+热烈祝贺 11.4157710022
+褐藻酸钠 13.2075304714
+罗隆基 12.8020653633
+领土完整 9.5186510173
+股道 12.8020653633
+会弹 11.8212361103
+薄幸 12.8020653633
+吃软 13.2075304714
+手动挡 10.5684731418
+林任 12.8020653633
+单于都护 12.1089181827
+山路 8.2273543848
+和雨帘 13.900677652
+突破性 9.13850371718
+缺水量 13.900677652
+汪敬虞 12.2912397395
+谢列尔 12.8020653633
+粒儿 11.9547675029
+第三部 9.80633308975
+迎出 10.5684731418
+迎击 9.6811699468
+付梓 12.8020653633
+报平安 12.2912397395
+生药 12.2912397395
+仁公主 12.5143832909
+协议书 9.36807815882
+顶一下 12.5143832909
+于永徽 13.900677652
+朝核问题 11.4157710022
+新感受 13.900677652
+叉路口 12.2912397395
+五党 12.1089181827
+阿斯克 12.8020653633
+何虑焉 13.2075304714
+徐继庄 13.2075304714
+半生 9.58318953844
+杂乱无序 13.900677652
+亲近 8.37124856446
+何谕示 13.2075304714
+绝妙好词 13.2075304714
+挑得 11.3357282945
+武帝征 13.2075304714
+酸文假醋 12.1089181827
+羊脂球 12.2912397395
+亲迎 11.7034530746
+夸说 12.5143832909
+愚顽 11.7034530746
+付定金 12.5143832909
+攻城战 11.2616203224
+适口 10.5684731418
+第十章 9.7898037878
+柴河 11.7034530746
+法学系 13.2075304714
+交易成本 9.43476953332
+堆满 9.14708746087
+指关节 10.765183436
+特遣 10.4349417492
+诸豪杰 13.2075304714
+置业者 10.9562386728
+真会是 11.598092559
+若干目 13.2075304714
+濮阳 9.30555780184
+车马填门 13.900677652
+赵贞吉 13.2075304714
+苛敛 11.7034530746
+丧失者 13.900677652
+家地 13.2075304714
+睁一只眼 10.1394775363
+鲍文岳 12.2912397395
+囚牢 12.8020653633
+会展 9.91169360541
+干大鹿 13.2075304714
+白吴氏 11.5027823792
+匠心 11.9547675029
+骷髅 9.62401153296
+爱才如命 13.900677652
+第三遍 11.8212361103
+黄贯中 13.900677652
+生日快乐 12.2912397395
+观景台 13.2075304714
+采空区 12.5143832909
+金溪县 13.900677652
+雍正皇帝 12.5143832909
+休眠火山 11.7034530746
+标志点 12.8020653633
+协议价 12.8020653633
+自助游 11.598092559
+武满彻 13.2075304714
+二郎腿 10.4666904475
+牵连 8.65365357982
+牵进 12.2912397395
+武帝开 12.2912397395
+偶姻 12.8020653633
+顾盛 12.8020653633
+迎儿 9.93038573842
+多数乡 13.2075304714
+公羊传 10.5684731418
+放号 12.1089181827
+汀娜 12.2912397395
+消费者 6.05565323473
+尹玉 13.900677652
+爱德华 9.25628675283
+伊克塞 13.2075304714
+赣州市 11.9547675029
+白睛红 12.8020653633
+精密度 11.3357282945
+伊克塔 13.2075304714
+赛点 13.900677652
+苛政 10.642581114
+羊毛衣 13.900677652
+至阳 13.2075304714
+印满红 13.900677652
+特混舰队 11.4157710022
+以心问心 11.8212361103
+水俣病 11.598092559
+十六员 13.2075304714
+科学普及 11.1280889297
+墨尔根 11.5027823792
+王棋 13.900677652
+波吕葛 13.900677652
+畜力车 12.2912397395
+言不及义 12.8020653633
+钢笔字 12.1089181827
+苏尔坦 12.2912397395
+描线 13.900677652
+三月末 12.1089181827
+十字路头 13.900677652
+衡抚辰 13.2075304714
+让我学 12.5143832909
+财神爷 10.642581114
+钱夹 13.900677652
+出行 7.88696249593
+基本国情 11.5027823792
+赵锡君 13.900677652
+铁索 10.4994802703
+昆布糖 13.2075304714
+第三重 11.4157710022
+出血 7.71652876104
+宝音 13.2075304714
+偷安 11.8212361103
+伊秉绶 12.5143832909
+小游戏 11.9547675029
+武帝建 11.598092559
+传统工艺 10.8561552143
+出街 12.2912397395
+险情 10.2371160058
+收发室 12.8020653633
+亲身 8.92394390956
+纹身 10.6818018271
+混淆 8.97342396682
+第十篇 12.8020653633
+家园 8.71329184614
+见笑大方 13.900677652
+画押 10.4994802703
+附中 10.7226238216
+马公港 11.8212361103
+纽约证券交易所 10.765183436
+画报 10.0720362555
+优惠期 12.8020653633
+林甘泉 11.8212361103
+半球 9.74179456862
+鸭脖子 13.900677652
+简明版 13.900677652
+偷寄 13.900677652
+曾思 12.8020653633
+飞驰 9.53122979951
+匠师 10.5684731418
+山崩地塌 13.900677652
+丰收期 13.900677652
+痔漏 13.900677652
+投降书 10.533381822
+飞马 8.57766767284
+沂山 11.7034530746
+描绘 7.35964765279
+一二万贯 13.2075304714
+适切 13.2075304714
+高脂肪 10.4041700905
+生态村 12.8020653633
+三千元 11.0674643079
+翼板 11.598092559
+曾想 10.3743171274
+毕现 11.5027823792
+西藏地方 9.84023464143
+产仔数 12.8020653633
+大天鹅 11.598092559
+外经贸局 13.900677652
+前前后后 9.26594866375
+计数管 11.9547675029
+旷开田 9.10488710638
+三千八 13.2075304714
+一千一百 10.9049453784
+日显 11.598092559
+离线 12.5143832909
+淘金热 12.5143832909
+托伦斯 11.4157710022
+山边 10.3171587135
+半瓶 10.642581114
+璀璨夺目 11.8212361103
+养虎为患 13.900677652
+弹过 12.1089181827
+附丽 12.2912397395
+老宝 11.598092559
+五船 13.900677652
+晋怀帝 11.3357282945
+半瓢 11.4157710022
+丘县 13.2075304714
+偷学 13.900677652
+苏满营 13.2075304714
+郭祥满 13.900677652
+男大当婚 11.1926274509
+桑顿 12.2912397395
+阿布扎比 9.34680076038
+喊出来 10.2897597393
+薄层 9.49395840471
+舞艺 13.900677652
+段氏 10.533381822
+险怪 13.900677652
+幌动 13.900677652
+挂得 12.5143832909
+禅堂 10.4041700905
+李麦劝 11.9547675029
+停车站 13.900677652
+任红军 11.1926274509
+勘探队 12.8020653633
+画成 10.4994802703
+奉化市 12.8020653633
+太平洋保险 10.604840786
+孙权派 12.1089181827
+顺道 12.8020653633
+蒋大椿 12.5143832909
+和光同尘 12.1089181827
+马耳他 9.89334446674
+迎候 9.56994431169
+充电电池 11.1926274509
+秋行夏令 13.900677652
+卢萨提 12.8020653633
+楚地居 8.77077893705
+紧跟着 9.20019728618
+霉变 10.4041700905
+西尾东 13.2075304714
+撑起 9.54396882529
+扫描器 10.9562386728
+银质奖 13.2075304714
+出面 7.59989185731
+文妙真人 13.2075304714
+林化 12.1089181827
+菟丝子 10.5684731418
+遏阻 12.8020653633
+调和主义 12.2912397395
+殷邦 13.900677652
+科雷乔 11.8212361103
+卞庄 13.900677652
+铁戟 12.8020653633
+放尽 12.5143832909
+票贩子 10.8096351986
+擅用 11.7034530746
+简报 10.2630914922
+劳动所得 11.0103058941
+支链反应 12.5143832909
+颜代领 13.2075304714
+毕氏 13.2075304714
+关尹子 13.900677652
+嘉园 12.1089181827
+冯亲王 13.900677652
+容摩耳 13.2075304714
+半步 9.30555780184
+弹道 8.84443184663
+药害 11.7034530746
+林区 8.092535162
+林匹 13.900677652
+山道 10.2117981979
+天蓝色 10.9049453784
+总指挥 8.57766767284
+铁手 12.2912397395
+同告 13.900677652
+坪石 12.1089181827
+铁打 10.2371160058
+潘家园 9.58318953844
+简拔 13.900677652
+铁托 10.604840786
+初印 13.2075304714
+汝情 13.900677652
+三千亩 13.2075304714
+蓝黑色 11.0674643079
+帅汤和 13.2075304714
+王亚南 11.8212361103
+林卡 13.900677652
+寡居 11.8212361103
+埃斯蒙 13.2075304714
+阿奎纳 12.5143832909
+圆子 11.4157710022
+低压电器 11.7034530746
+尹洙 12.5143832909
+一按到 13.900677652
+碧蹄 13.2075304714
+典范 8.4801426527
+改成 8.49350588052
+假如能 12.8020653633
+奶羊 12.2912397395
+和莱昂 13.900677652
+迪士尼 7.53592689512
+王勇平 12.1089181827
+开山祖师 12.8020653633
+遥遥领先 9.44633035572
+七九 12.2912397395
+放浪形骸 11.4157710022
+区署 13.2075304714
+据介绍 7.47743068844
+择捉岛 13.900677652
+主祭人 13.900677652
+丁二酮肟 13.2075304714
+例数 13.2075304714
+在某些特 13.2075304714
+男色 11.9547675029
+高斯曲率 11.9547675029
+名导 11.8212361103
+李克强 9.32596667347
+贩卖 8.76487921493
+黄滕 13.900677652
+一千二百里 12.8020653633
+等差数列 11.7034530746
+朱贵笑 13.2075304714
+驼铃 12.8020653633
+丛蕉唷 13.2075304714
+排水渠 12.1089181827
+吸奶器 13.900677652
+墨青 13.2075304714
+父女之情 12.5143832909
+舍己救人 12.5143832909
+若干根 13.2075304714
+无所忌惮 12.5143832909
+顿成 11.598092559
+东盛科技 13.900677652
+襄理 12.8020653633
+藏徐镇 11.3357282945
+多数倍 13.2075304714
+半毫 12.5143832909
+毕沅 11.4157710022
+深刻含义 12.5143832909
+中国传媒 12.8020653633
+王阿毛 12.8020653633
+三千丈 11.9547675029
+塔特 11.4157710022
+林参 13.900677652
+平儿方 12.8020653633
+框起来 13.900677652
+蚂蚁窝 13.2075304714
+异教徒 9.55687223012
+老阎 13.900677652
+桑毛虫 13.900677652
+勇闯 12.5143832909
+伴食中书 13.900677652
+一小撮一小撮 13.900677652
+科雷亚 13.2075304714
+提高认识 10.533381822
+三茶六饭 13.2075304714
+开膛 10.2630914922
+实生苗 11.8212361103
+苏梅岛 12.1089181827
+三千个 13.2075304714
+诗念 12.2912397395
+圆孔 10.3171587135
+胆囊结石 12.8020653633
+林可 13.900677652
+半段 10.6818018271
+一般地说 9.62401153296
+连天 9.4233408375
+活动度 11.598092559
+三千两 10.0294766411
+鼎力支持 11.4157710022
+铁拳 11.2616203224
+甲板 8.27666014579
+出鞘 10.0505300503
+中央情报部 12.5143832909
+吓呆了 10.4994802703
+酯酶 13.900677652
+改投 12.2912397395
+币值 9.4233408375
+范辞 13.900677652
+林分 12.1089181827
+固原市 13.900677652
+老八辈子 13.2075304714
+出险 10.8096351986
+金朝 8.36728816325
+受之有愧 11.8212361103
+改换 9.32596667347
+没话说 11.0103058941
+法制轨道 13.2075304714
+方塔园 13.900677652
+那山洞 11.3357282945
+特朗普 13.900677652
+垂体瘤 12.1089181827
+色林错 10.8561552143
+翁金河北 13.2075304714
+至大至刚 13.900677652
+哪有卖 13.900677652
+黄药师 13.2075304714
+开卷考试 13.900677652
+险绝 12.2912397395
+飞落 11.2616203224
+痒痒 9.45802639549
+心肺 9.44633035572
+抓痒 11.9547675029
+十八周岁 13.2075304714
+任贤齐 12.1089181827
+沿街叫卖 11.7034530746
+抓痕 13.2075304714
+周祖培 12.5143832909
+迎仙 13.2075304714
+风烛 12.5143832909
+法国总理 11.598092559
+团头鲂 11.0674643079
+刚一柔 12.8020653633
+体无完肤 11.4157710022
+降水区 12.8020653633
+耳热 11.8212361103
+高精尖 11.5027823792
+旋转门 12.5143832909
+痒疹 13.900677652
+以耳代目 13.900677652
+人浪 13.900677652
+雉鸡 11.0103058941
+迎人 12.5143832909
+客地 13.900677652
+马布埃 12.5143832909
+二代证 12.8020653633
+出阵 9.48183704418
+迎亲 10.6818018271
+雷泽盖 13.900677652
+客场 9.94943393339
+耶芳斯 12.8020653633
+意外保险 12.1089181827
+第三辆 12.1089181827
+严严 11.1280889297
+祸患无穷 13.2075304714
+大脑皮质 11.3357282945
+超级计算机 12.5143832909
+练淮军 13.900677652
+上晃 12.2912397395
+敲下去 12.8020653633
+关系法 12.1089181827
+加官进爵 13.900677652
+喂奶 9.93038573842
+练新军 11.1926274509
+二百八十七家 13.2075304714
+星罗棋布 9.20019728618
+亢声 11.9547675029
+美言不信 13.900677652
+赭红 12.5143832909
+违规者 12.8020653633
+徐二爷 12.5143832909
+因素 4.925806481
+杜罗 12.5143832909
+尼格 13.2075304714
+铁掌 11.1926274509
+诸文臣 13.2075304714
+闻鲁肃 12.8020653633
+三千余 10.533381822
+撬起来 12.8020653633
+顿挫 10.1871055853
+阴谋 7.91422564669
+某年某月 11.3357282945
+王乐泉 13.900677652
+堆焊 12.8020653633
+啼哭 9.03314320152
+郭祥点 11.7034530746
+分离性 13.2075304714
+无极限 13.2075304714
+草食 11.598092559
+英国伦敦 9.23723855786
+阴谷 13.900677652
+朱锐锦 13.2075304714
+蒋臣 12.5143832909
+杂技界 13.900677652
+水力学 10.3743171274
+员大将 10.9562386728
+抗法战争 11.5027823792
+不得其所 13.2075304714
+曾经 5.88007850208
+穆伊纳 13.900677652
+不吃不喝 10.2117981979
+浦江县 13.900677652
+冬泳 11.8212361103
+山金 11.9547675029
+斯斯文文 11.1926274509
+储藏室 11.1280889297
+花亚科 12.2912397395
+付着 12.8020653633
+多数具 11.9547675029
+符拉迪沃斯托克 10.8561552143
+中纪委 10.2371160058
+缝纫工 13.900677652
+拨回来 13.900677652
+盈亏自负 13.900677652
+梅甘娜 13.900677652
+山里 7.32281629425
+冈萨雷斯 11.5027823792
+山野 8.9102450652
+改掉 11.0674643079
+迎上 10.2117981979
+多数党 10.4994802703
+电流值 12.2912397395
+尼桑 12.8020653633
+变分法 10.4349417492
+痒生 13.900677652
+断得 12.1089181827
+护卫者 13.900677652
+简捷 11.0103058941
+工务局 12.8020653633
+飘走 12.1089181827
+箭尾 12.2912397395
+飘起 10.1630080337
+硫磺味 12.5143832909
+副行长 8.90346537821
+阿库里 13.2075304714
+卡罗尔 11.9547675029
+投袂而起 13.2075304714
+标识物 13.900677652
+档板 12.5143832909
+楼传旨 13.2075304714
+隐迹埋名 13.900677652
+广源州 12.5143832909
+千吨当量 12.8020653633
+捆吊 13.900677652
+顿悟 10.1871055853
+待业 12.1089181827
+爆破筒 11.5027823792
+势所必然 11.4157710022
+评先 13.2075304714
+不象样 12.2912397395
+推广先进 11.5027823792
+投过去 12.2912397395
+关键在于 8.5488195185
+出镜 11.598092559
+湘阴县 12.2912397395
+厅长 9.49395840471
+邵抚之 13.2075304714
+素女经 12.8020653633
+冯保瞅 12.5143832909
+资生堂 12.2912397395
+数据包 12.8020653633
+鸵鸟 9.96885201925
+迪信通 11.598092559
+风炉 11.1926274509
+全面规划 11.7034530746
+独裁者 9.96885201925
+必答题 13.2075304714
+林克 9.72629038208
+改性 10.2117981979
+飞蝗 9.71102290995
+不堪其忧 13.900677652
+过会儿 12.5143832909
+个人所得税 9.04086524761
+双气囊 13.2075304714
+邓克岛 13.900677652
+会计员 13.2075304714
+由相邦 12.8020653633
+曾索 12.2912397395
+高人逸士 13.900677652
+江瑶贝 12.1089181827
+描描 13.900677652
+小黑裙 13.900677652
+橄榄油 9.98865464655
+出锅 11.5027823792
+原苻坚 12.8020653633
+膺品 13.900677652
+读数据 13.2075304714
+排水泵 11.598092559
+林兵 12.2912397395
+档期 10.3743171274
+出错 9.6811699468
+大开眼界 10.765183436
+看了又看 10.9049453784
+聊胜于无 12.1089181827
+林内 10.4666904475
+怦然动心 13.900677652
+链断裂 10.8561552143
+性变态 11.8212361103
+催要 11.9547675029
+侯孝贤 12.8020653633
+小买卖 10.642581114
+规格化 12.5143832909
+盗版 9.55687223012
+手写输入 12.8020653633
+掩面失色 13.900677652
+熟络 11.7034530746
+窑工 12.8020653633
+阿尔卡勒 13.2075304714
+林农 11.8212361103
+冯保眯 12.1089181827
+多数则 12.5143832909
+殊难 12.5143832909
+木材厂 11.9547675029
+见客 11.0103058941
+墨镜 9.94943393339
+林冠 11.1926274509
+项梁 10.8561552143
+狼多肉少 12.8020653633
+寄宿制 12.2912397395
+曹军皆 12.8020653633
+畜群 11.0674643079
+肉猪 10.8561552143
+寸步难移 11.9547675029
+柴火 9.34680076038
+撑过 12.1089181827
+药头 12.5143832909
+雷利亚 12.8020653633
+习字 11.0103058941
+堆积成山 12.1089181827
+写作文 12.5143832909
+日宝钗 13.900677652
+郡县制度 13.900677652
+御家人 13.2075304714
+重庆政府 13.2075304714
+七断八续 11.9547675029
+四千五百 11.8212361103
+商标注册 10.6818018271
+杜少府 12.8020653633
+原叶体 12.2912397395
+热加工 11.2616203224
+扮戏 12.8020653633
+陀罗尼 10.6818018271
+统理 12.2912397395
+踏过 11.0103058941
+林人林 13.2075304714
+鲁迅研究 12.2912397395
+吉尔吉斯语 12.8020653633
+江北岸 10.765183436
+侯国间 11.8212361103
+卡宾达 12.8020653633
+梁书 10.7226238216
+三尖杉 10.2371160058
+积极进取 10.6818018271
+币制 9.48183704418
+埃莉诺 13.2075304714
+改悔 11.7034530746
+众虎同心 13.900677652
+雄略 12.5143832909
+冯保皱 13.900677652
+沾花惹草 12.8020653633
+监控点 12.5143832909
+红绳拴 12.8020653633
+适于 7.69611988941
+第三路 13.2075304714
+经四路 13.2075304714
+杜福宝 12.8020653633
+诸药 11.598092559
+画绢 13.2075304714
+形状 6.73905564904
+欧洲李 13.900677652
+苦差事 11.598092559
+出生入死 9.74179456862
+各型 9.02548032877
+发起烧来 12.5143832909
+极盛时期 9.94943393339
+客商 8.89673134603
+一个二维 11.5027823792
+半桶 11.7034530746
+张文襄 12.2912397395
+府谷县 13.2075304714
+九牛一毛 10.8096351986
+西尔瓦 13.2075304714
+蛙腿 12.1089181827
+保守机密 12.8020653633
+挤眉弄眼 10.4666904475
+遇挫 13.2075304714
+不定型 11.9547675029
+体毛 10.1871055853
+天心岩 12.8020653633
+阴惨 11.9547675029
+舞阳县 11.9547675029
+适从 12.5143832909
+高山仰止 12.2912397395
+画线 11.8212361103
+飘过 10.4994802703
+碟子 9.54396882529
+飘进 11.9547675029
+市场调节 10.8096351986
+斯旺河 13.2075304714
+飘远 12.8020653633
+落叶林 11.598092559
+曹魏时 11.1280889297
+曹阵 13.2075304714
+主动进攻 12.8020653633
+嘉善 11.2616203224
+币原 13.2075304714
+踊跃报名 13.2075304714
+飞虹 12.8020653633
+林健 11.7034530746
+半根 11.1280889297
+吐火罗文 12.2912397395
+卓识 11.1280889297
+贴过去 12.8020653633
+夜长梦多 10.6818018271
+晶闸管 10.7226238216
+金枣 13.2075304714
+前堵后追 13.2075304714
+纪念地 9.34680076038
+抓瞎 11.9547675029
+低血压 10.1630080337
+转弯 8.87679713113
+药壶 13.900677652
+南京路上好八连 12.5143832909
+适任 13.900677652
+六七口 12.8020653633
+得分手 12.2912397395
+寥寥 9.35738286971
+有据可依 12.8020653633
+简意 12.8020653633
+和统军 13.2075304714
+伯塞斯库 11.3357282945
+红白事 12.2912397395
+飞蚁 13.900677652
+颗粒物 11.7034530746
+咸认为 13.900677652
+顿感 11.3357282945
+多万头 12.2912397395
+肚脐眼 11.2616203224
+李弼 13.2075304714
+适中 8.49350588052
+泻出来 13.900677652
+克图珲 13.2075304714
+措勤县 12.8020653633
+骆宾 13.900677652
+文档资料 12.1089181827
+子囊孢子 11.7034530746
+深院 11.8212361103
+李克尔 13.900677652
+若干次 10.4994802703
+一望无垠 12.1089181827
+伟大 6.95852094628
+自动生产 13.900677652
+因缘 9.87532596124
+抓着 9.25628675283
+实际困难 11.0103058941
+落叶松 9.07236391467
+提亲 10.2371160058
+李建平 13.2075304714
+摄氏 11.2616203224
+开发设计 12.2912397395
+解决矛盾 10.9049453784
+心急火燎 9.94943393339
+重出江湖 10.7226238216
+矢无虚发 13.900677652
+冰牛奶 13.900677652
+唐音统 13.2075304714
+喷花 13.900677652
+放火烧 9.89334446674
+娄树华 13.900677652
+出钱 8.70772080109
+黄孔目 12.5143832909
+简慢 11.8212361103
+结局 7.74158226348
+塔尔贝 13.900677652
+飞蛾 10.3743171274
+血友 13.900677652
+第十条 11.1280889297
+统由 11.3357282945
+铝热剂 13.2075304714
+直发抖 13.900677652
+焚香礼拜 11.598092559
+救亡 9.91169360541
+何求 12.8020653633
+易采易 12.5143832909
+半潜 11.9547675029
+难易 9.93038573842
+船票 10.604840786
+殊途 12.1089181827
+四川火锅 12.8020653633
+中小医院 13.900677652
+逝者 10.9049453784
+技术密集 11.3357282945
+坚辞 10.4994802703
+洪汝河 12.5143832909
+包恢 13.2075304714
+嘉勇 13.900677652
+学步车 13.2075304714
+首台 11.0103058941
+麦纳麦 12.1089181827
+伪科学 13.900677652
+门卫 9.06439574502
+体格 9.62401153296
+生态系 12.1089181827
+统独 13.900677652
+身居高位 11.0103058941
+林地 8.62256299275
+抓烂 13.900677652
+美仑美奂 12.1089181827
+林场 9.22784881751
+一前一后 9.4233408375
+解说法 13.900677652
+尖嘴利 13.2075304714
+刘兴国 12.8020653633
+物流业 10.4666904475
+陈之制 13.2075304714
+美术史 9.84023464143
+穆塔利 13.900677652
+山栖霞 13.900677652
+殊遇 11.598092559
+不在乎 8.31342899358
+多不多 10.9049453784
+问青天 12.8020653633
+单冠白 13.900677652
+活荷载 13.900677652
+夸里 11.5027823792
+和百慧 12.5143832909
+烘烤 10.2630914922
+亲闻 12.5143832909
+连套 13.900677652
+老父老母 13.2075304714
+那凤姐 11.598092559
+头风 12.2912397395
+改易 10.4349417492
+九十四年 13.2075304714
+团结乡 13.2075304714
+毡靴 12.5143832909
+吃不住 10.8561552143
+各城 10.765183436
+广场用地 13.900677652
+捡破烂 11.5027823792
+骆岗 12.8020653633
+严老爷 12.8020653633
+简明 9.17328983326
+简易 8.27666014579
+胸径 10.0294766411
+药引 11.7034530746
+弓马显 13.2075304714
+断开 10.2630914922
+林垦 13.900677652
+存储 8.28390655431
+浪花四溅 13.900677652
+纸醉金迷 11.3357282945
+扭亏为盈 8.95903522937
+畜禽 9.5186510173
+绿豆稀饭 13.900677652
+五股 11.7034530746
+曾省吾 12.5143832909
+马布利 12.8020653633
+诗魂 13.2075304714
+一千文 11.0103058941
+王戎相 13.2075304714
+战备训练 11.8212361103
+林城 11.4157710022
+娶媳妇 9.74179456862
+球门柱 12.5143832909
+相辅 11.2616203224
+戈纳尔 12.5143832909
+坎布里亚郡 13.2075304714
+轨道站 12.8020653633
+轻装简行 13.900677652
+列国 9.87532596124
+九峰 11.598092559
+小袁营 8.68574189437
+喷薄 12.1089181827
+固步自封 11.4157710022
+相模湾 13.900677652
+飞至 11.4157710022
+副外长 12.2912397395
+山链 12.5143832909
+箭头 9.30555780184
+张任学 12.5143832909
+储藏库 12.8020653633
+南京大学 9.93038573842
+搽粉 13.2075304714
+戴维森 10.604840786
+精子形成 13.2075304714
+贝亚 13.900677652
+烷基酚 12.8020653633
+屏迹 13.900677652
+十几千米 11.9547675029
+散发性 12.2912397395
+鬼头 10.765183436
+崇阳县 13.900677652
+咽喉部 11.2616203224
+简析 13.900677652
+唐天宝 9.98865464655
+马背 10.3171587135
+药店 9.20932976975
+神情自若 13.900677652
+第三课 13.900677652
+客卿 10.8561552143
+药库 13.900677652
+纹银 9.87532596124
+痄腮 12.5143832909
+天时地利人和 12.1089181827
+副所长 8.44535653662
+硇洲 12.1089181827
+僧侣主义 13.900677652
+烤肉 10.3171587135
+铁木 10.6818018271
+增长率 6.71832554009
+鲇鱼上竹 13.2075304714
+土地庙 10.4349417492
+稀释热 12.2912397395
+开发资源 11.3357282945
+崔道成 11.5027823792
+板寸头 12.8020653633
+付现 13.2075304714
+高氏世 13.2075304714
+贤孙 12.5143832909
+进度缓慢 11.3357282945
+遇救 12.5143832909
+铁杆 10.4994802703
+铁杉 9.49395840471
+喻示 12.1089181827
+恨不得 8.089536659
+里茨 11.598092559
+须一一 12.8020653633
+铁材 12.1089181827
+听其言 11.598092559
+山镇 9.75754292558
+古义治 12.8020653633
+统率 8.10461990121
+潘家口 12.5143832909
+遇敌 11.1280889297
+詹小耳 12.1089181827
+铁条 10.6818018271
+铁杠 12.1089181827
+城市地图 13.2075304714
+因私 11.3357282945
+瓶上 13.2075304714
+炎天 10.9562386728
+有错必纠 13.2075304714
+孔楼 13.900677652
+存入 9.00283785202
+因科 13.900677652
+赛欧 13.2075304714
+仁怀县 13.2075304714
+改期 11.9547675029
+公诸于众 12.1089181827
+铁板 10.1164880181
+无机可乘 12.5143832909
+累累硕果 11.8212361103
+丑女 11.5027823792
+处以 8.57280148319
+三级跳 10.9049453784
+著译 11.0674643079
+药师 10.3453295905
+概率分布 11.0674643079
+表达力 13.2075304714
+钢琴课 12.2912397395
+路加福音 12.2912397395
+药市 12.8020653633
+嘉南 11.7034530746
+金柜 13.2075304714
+春宵 12.8020653633
+屈沉 12.8020653633
+烘焙 11.598092559
+合理要求 11.598092559
+孟森摇 13.900677652
+纳皮尔 11.1280889297
+博闻强记 11.9547675029
+玄德听 13.2075304714
+璧山 12.2912397395
+卖货 10.9049453784
+半滴 13.900677652
+大路货 12.1089181827
+铁枪 11.4157710022
+烘焦 13.900677652
+惨案 9.09665660724
+简本 12.1089181827
+简札 13.2075304714
+表处理 12.2912397395
+五六十名 13.900677652
+曾立 11.7034530746
+平儿情 13.2075304714
+简朴 9.49395840471
+铁架 10.9562386728
+第三十二篇 13.2075304714
+半满 13.2075304714
+同一个 7.44705265308
+神奥丁 13.2075304714
+禹藏花 13.2075304714
+吃不下 9.69598503258
+吃不上 10.2117981979
+太阳眼镜 13.900677652
+王宽诚 13.2075304714
+痔疮 10.2371160058
+宋慈 11.9547675029
+描摹 10.4994802703
+丘岳 11.3357282945
+苏制 10.3743171274
+进口量 9.07236391467
+广汉市 12.8020653633
+急性病 11.5027823792
+宁武关 12.1089181827
+客厅 7.93967231235
+汝安敢 11.4157710022
+山间 8.4801426527
+评审团 11.0674643079
+乌思藏 10.1871055853
+爬满了 10.3743171274
+活动室 12.5143832909
+爬虫 11.4157710022
+曾以彰 13.2075304714
+吴正 11.2616203224
+铁柱 10.9049453784
+山门 8.63798746307
+射影对应 13.900677652
+败毒 11.598092559
+简板 13.2075304714
+活动家 9.05649056552
+汉穆夫 13.2075304714
+罪恶行为 13.900677652
+猪粪 11.9547675029
+鹅冠草 12.8020653633
+上飞旋 13.2075304714
+尹正 13.2075304714
+生鲜食品 13.900677652
+傅宗龙 8.9308643524
+两遭 10.9562386728
+增长点 8.00903344015
+埃德伯 13.2075304714
+模范丈夫 13.2075304714
+郭祥眼 12.8020653633
+安家落户 11.7034530746
+山阳 9.5186510173
+山阴 9.72629038208
+项氏 12.8020653633
+中巴 10.8096351986
+蚂蚁啃骨头 13.2075304714
+山阻 12.8020653633
+卖身 10.0940151622
+铁搭 13.900677652
+民族自决 10.604840786
+曾祖 10.604840786
+联合国教科文组织 9.37888907493
+起重机械 11.5027823792
+科蒂 13.2075304714
+侦探片 12.1089181827
+抓进去 11.9547675029
+麦金农 13.900677652
+汉碑群 12.8020653633
+存到 11.0103058941
+坐轿子 11.3357282945
+家信 10.4041700905
+文慕仁 12.8020653633
+山陕 10.765183436
+木克土 12.1089181827
+结婚典礼 12.2912397395
+万向节 13.900677652
+家俱 12.1089181827
+水洼子 13.2075304714
+山际 13.2075304714
+门球 11.7034530746
+田切秀 13.2075304714
+溶合 11.1926274509
+阴证 11.5027823792
+发声器 11.8212361103
+山陵 10.2897597393
+股评 10.8561552143
+阴生叶 13.900677652
+家俊 13.900677652
+戎狄 10.4349417492
+定神 9.5062284973
+赛格 8.89673134603
+催赶 12.1089181827
+第五件 12.8020653633
+宗教政策 11.0103058941
+碧血 12.1089181827
+山险 10.9049453784
+挂意 12.5143832909
+优良品种 9.77354326693
+家传 9.80633308975
+厅里 9.56994431169
+分离机 12.8020653633
+门方术 12.8020653633
+能源 6.03625774698
+祖藏 13.2075304714
+七擒七纵 13.2075304714
+十分之一 9.20932976975
+希腊 6.86365003729
+公猫 13.900677652
+坚贞 10.8096351986
+殒没 13.900677652
+抓牢 11.2616203224
+轻车 11.9547675029
+啼叫 10.3453295905
+殷钢 13.900677652
+郭祥瞅 12.2912397395
+窑姐 13.900677652
+国语罗马 12.2912397395
+交友平台 13.2075304714
+感情纠葛 11.598092559
+第三行 13.900677652
+全家电 13.900677652
+花亚纲 13.900677652
+铁撬 13.900677652
+碇泊 12.5143832909
+新鲜感 10.4349417492
+家伙 6.93465346487
+践行 10.5684731418
+那国师 13.2075304714
+举杯邀 12.8020653633
+董军门 12.8020653633
+寥廓 11.4157710022
+举止娴雅 11.9547675029
+钧瓷 10.3743171274
+北温带 10.0505300503
+里肯 13.900677652
+橄榄树 11.7034530746
+类项 13.2075304714
+可大可小 12.2912397395
+坚赞 12.8020653633
+两遍 9.33632946051
+商益生 13.2075304714
+滑下来 10.8561552143
+风吹浪打 12.8020653633
+宫圣驾 13.900677652
+罗曼诺夫 11.3357282945
+楚长城 9.6811699468
+龙大哥 13.900677652
+甲孕酮 13.900677652
+后勤工作 11.0103058941
+画笔 10.0720362555
+一六六 13.900677652
+耀目 11.7034530746
+贡品 9.58318953844
+家住 8.44535653662
+詹度 11.3357282945
+雾蒙蒙 10.642581114
+尘俗 11.598092559
+山雨 10.0294766411
+兼有 7.94484028251
+民勤 11.3357282945
+简文 11.8212361103
+飞舞 8.96620371885
+家产 8.75901409547
+翼翼 13.900677652
+百分之六点 11.7034530746
+四度空间 13.900677652
+小球儿 13.2075304714
+宁武县 11.598092559
+金星 7.96578345636
+富浠伙 12.1089181827
+家人 7.00297270885
+亲随 9.20019728618
+遇有 9.28555713513
+飞船 8.92394390956
+叠起来 11.4157710022
+胆绿素 13.900677652
+审美疲劳 12.5143832909
+山霸 12.8020653633
+家事 9.01032852375
+蚕豆病 12.5143832909
+小二黑 11.4157710022
+飞航 11.1280889297
+翼翅 12.8020653633
+步向前 12.5143832909
+代理点 13.900677652
+说好说歹 12.8020653633
+双头蛇 13.900677652
+耀眼 8.39534611604
+出道 10.533381822
+清凉山 10.9049453784
+山青 11.5027823792
+卖过 11.1926274509
+顿时 6.51173155436
+刘备若 12.8020653633
+诸语言 10.2897597393
+覆手为雨 11.0103058941
+改改 10.4994802703
+再其次 11.9547675029
+安景勋 11.4157710022
+烟消雾散 13.2075304714
+屎尿 10.5684731418
+竞斗 13.900677652
+杜审言 12.1089181827
+存单 11.1926274509
+阿努钦 12.5143832909
+堆石 12.5143832909
+硬质 10.0294766411
+家仆 11.1280889297
+家仇 12.5143832909
+锁国 11.0103058941
+清歌妙舞 13.900677652
+刘敦桢 11.9547675029
+里脊 11.7034530746
+出逃 8.55834340001
+外贸公司 11.7034530746
+金明 11.5027823792
+平白无辜 13.900677652
+碟形 10.5684731418
+苏二州 13.2075304714
+魏博牙 13.2075304714
+非池中物 12.5143832909
+录放 13.2075304714
+家严 10.9049453784
+顿改 13.2075304714
+做种 13.2075304714
+九层 9.71102290995
+千帆竞发 13.2075304714
+家中 6.91596133186
+平儿拿 12.5143832909
+炭质 11.598092559
+黄至武 13.2075304714
+兴趣十足 12.5143832909
+郭祥皱 13.900677652
+治病救人 11.1280889297
+铁料 12.5143832909
+宣讲 9.80633308975
+渗透系数 12.5143832909
+改时 13.2075304714
+家丁 9.14708746087
+爱福临 13.900677652
+铁斧 12.1089181827
+飞花 11.2616203224
+简单化 10.1871055853
+嘉兴 8.74738605748
+绥化地区 11.9547675029
+家丑 11.1280889297
+卧轨自杀 13.2075304714
+爆破组 11.7034530746
+家世 9.48183704418
+溅出 11.3357282945
+家业 9.09665660724
+九届 10.3743171274
+半波 11.8212361103
+降赐 13.900677652
+家乡 7.50208271744
+赤褐色 11.2616203224
+家书 9.20019728618
+收盘报 8.59737274392
+做秀 11.5027823792
+汉沽区 11.9547675029
+画稿 10.8561552143
+药局 12.2912397395
+宣读 8.87023973058
+音乐学院 8.94485059437
+波利尼 12.5143832909
+库恰 12.8020653633
+缩起 13.2075304714
+皮肤科 10.604840786
+电子扫描 11.4157710022
+链激酶 12.5143832909
+中国足协 9.74179456862
+堆积物 9.87532596124
+结晶型 12.8020653633
+林哥 13.2075304714
+滑寿善 13.2075304714
+顿教 12.8020653633
+铁旦 12.8020653633
+家乐 13.900677652
+行李 7.64877376881
+无毒性 12.8020653633
+陶大顺 12.2912397395
+埃兹沃尔 13.900677652
+伸展 8.43684584695
+药山 12.2912397395
+沈绿 13.2075304714
+统统 8.25877058104
+伟力 12.2912397395
+会计师 8.08654712015
+在建设中 11.598092559
+卖肉 11.2616203224
+未纳 13.900677652
+首列 11.1926274509
+药厂 10.7226238216
+男子汉 8.61747392324
+一万三千块 13.900677652
+赵歧黄 10.765183436
+商讨问题 13.900677652
+麦金德 11.9547675029
+表达式 9.20019728618
+行杖 13.2075304714
+已婚者 12.1089181827
+飞贼 11.0674643079
+尹敏 12.5143832909
+洪荒时代 13.2075304714
+郎毓秀 13.2075304714
+皮破血流 13.900677652
+计算机断层扫描 12.5143832909
+康德还 13.900677652
+分散控制 12.8020653633
+平靖关 12.8020653633
+方用丹 12.2912397395
+暴起伤 12.2912397395
+舌下腺 12.1089181827
+狂转 13.900677652
+工笔画 11.8212361103
+须髯 12.2912397395
+内幕消息 9.53122979951
+出齐 10.7226238216
+过会子 11.8212361103
+螺旋体 10.0940151622
+奚国皇帝 13.2075304714
+皮肤癌 10.765183436
+药叉 11.7034530746
+戴士衡 12.8020653633
+男子气 11.9547675029
+客席 11.3357282945
+一刹那 8.9102450652
+嘉应 10.9049453784
+苦思冥想 11.3357282945
+拆烂污 12.8020653633
+薰衣草 11.4157710022
+毕摩 13.2075304714
+做学问 11.1926274509
+福马林 13.900677652
+娇声娇气 12.8020653633
+拣择 12.2912397395
+克斯 10.2897597393
+嘉庆 8.68574189437
+付伊籍 13.2075304714
+林学 12.2912397395
+须尊奉 13.2075304714
+飘蓬 13.2075304714
+山顶 7.80035869996
+追诉时效 12.1089181827
+皮肤癣 12.5143832909
+飞赴 10.6818018271
+危笃 12.2912397395
+造桥工程 13.900677652
+焦墨勾 13.2075304714
+赘婿 12.1089181827
+农民工 8.25877058104
+生之幸 12.5143832909
+痔疮膏 12.8020653633
+韩天星 10.8561552143
+套中人 12.5143832909
+卖者 8.87023973058
+第一首歌 13.900677652
+飘萍 12.5143832909
+药包 10.9049453784
+刘备败 12.8020653633
+不得其死 13.900677652
+常迁延 13.900677652
+林宗 12.2912397395
+堆码 12.8020653633
+飞越 9.96885201925
+于富室 13.2075304714
+药匙 13.900677652
+郭祥禽 13.2075304714
+纹饰 9.21854642485
+林宝 12.2912397395
+全身而退 10.1164880181
+堆砌 9.77354326693
+开业庆典 11.9547675029
+幸董贤 13.2075304714
+钧窑 11.1280889297
+诸同存 12.5143832909
+嘉平 7.60910851242
+寒山寺 11.1280889297
+安得烈 13.2075304714
+林家 10.5684731418
+海岸带 10.1164880181
+水务局 11.3357282945
+于志宁 12.2912397395
+飘落 9.66657114738
+曼彻斯特 9.27570483869
+宏道 12.2912397395
+僧袍 13.900677652
+吉河德 12.8020653633
+林密 10.765183436
+客座 10.8096351986
+粘接剂 13.2075304714
+画画 9.62401153296
+王阿提 12.5143832909
+行政官 10.642581114
+李宁牌 13.900677652
+封列侯 11.598092559
+挥汗如雨 11.9547675029
+四八年 12.5143832909
+药单 12.5143832909
+飞跃 8.83177344976
+山风 9.74179456862
+尹文 12.5143832909
+计数法 13.900677652
+飞跨 13.2075304714
+屈曲 10.0720362555
+客店 9.49395840471
+半推 13.2075304714
+元兵 10.604840786
+止痛剂 12.5143832909
+梅汤 12.5143832909
+得意门生 11.5027823792
+形神 9.96885201925
+哪行 12.2912397395
+丑名 13.2075304714
+林寺 12.5143832909
+感化院 12.1089181827
+分成等级 12.8020653633
+范筑先 12.8020653633
+沃思 10.3171587135
+林威 12.8020653633
+改正 8.83808261895
+石版画 11.8212361103
+墨华亭 12.8020653633
+消息闭塞 12.1089181827
+仲景旧 13.2075304714
+预先计划 12.8020653633
+启行 12.5143832909
+药力 10.8561552143
+从献忠 12.8020653633
+钠泵 12.2912397395
+道德水准 12.2912397395
+羽毛球 10.3743171274
+半扇 10.8096351986
+阴蒂 11.9547675029
+衔愤 13.900677652
+新源 11.0674643079
+运城地区 11.9547675029
+外交使节 11.7034530746
+于子城 12.8020653633
+圣马科斯 12.2912397395
+墨黑 11.0103058941
+定林寺 13.2075304714
+凡组合 13.900677652
+提前量 11.3357282945
+传导体 13.900677652
+凑趣儿 11.7034530746
+橄榄枝 11.1280889297
+宗正寺 13.2075304714
+半成 12.8020653633
+梅森数 13.2075304714
+耀祖 13.2075304714
+趾高气昂 13.900677652
+卞城 12.5143832909
+绝育法 13.900677652
+颜为笑 13.900677652
+神经兮兮 12.5143832909
+八亿美元 12.8020653633
+好声好气 12.5143832909
+强兵劲 12.1089181827
+防护林带 10.5684731418
+开发利用 8.21031819765
+李从吉 12.1089181827
+因病 8.83808261895
+精盐 11.2616203224
+僻静 9.44633035572
+嘉德 10.9562386728
+半截 8.40761620864
+建了 9.75754292558
+长得艳 13.900677652
+严守一 13.900677652
+凯里市 12.1089181827
+赌博机 13.900677652
+完美性 13.2075304714
+嘉当 11.598092559
+里迪 13.900677652
+碧螺 12.5143832909
+过滤法 12.8020653633
+调度 8.4801426527
+套版印刷 13.900677652
+半拍 11.2616203224
+花梨加 13.900677652
+因由 10.3171587135
+半拉 12.1089181827
+四百万元 13.2075304714
+封于舒 12.8020653633
+五任 13.2075304714
+同日生 12.1089181827
+酸性土 11.1280889297
+狂欢节 10.4349417492
+审限 13.900677652
+七里桥 13.900677652
+心理健康 10.9049453784
+扯白 13.900677652
+半拳 13.900677652
+饱满度 12.8020653633
+仪器设备 10.1871055853
+催芽 11.7034530746
+注目礼 11.5027823792
+吴樾 13.2075304714
+编写成 13.2075304714
+章可查 13.2075304714
+半折 12.8020653633
+统编 11.9547675029
+木兰科 10.533381822
+欧尼尔 13.900677652
+药剂 9.38981814546
+无处可逃 11.7034530746
+赛果 12.5143832909
+祥瑞之气 12.8020653633
+牛驴 11.9547675029
+十三号 13.900677652
+胶体溶液 11.4157710022
+溅得 10.9049453784
+路环 13.2075304714
+抓紧 8.2273543848
+工薪阶层 10.2117981979
+里边 7.22107846613
+大乐透 11.598092559
+三江师范学堂 13.2075304714
+十八英寸 13.2075304714
+拧下 13.2075304714
+李姑娘 11.7034530746
+狎弄 12.1089181827
+平首布 12.2912397395
+心头肉 11.3357282945
+听听看 12.8020653633
+青铜 7.65651075131
+勘探者 13.2075304714
+子敬岂 13.2075304714
+自叹弗如 11.9547675029
+寿儿 10.1164880181
+和服 10.1630080337
+铁栅 11.4157710022
+交变电场 12.1089181827
+铁坚杉 11.9547675029
+创新纪录 11.9547675029
+春兰秋菊 13.900677652
+铁栏 12.1089181827
+异国他乡 10.8096351986
+细菌武器 11.0674643079
+铁栓 11.9547675029
+药农 13.2075304714
+不关紧要 13.2075304714
+周指周 13.2075304714
+笔挺 10.2897597393
+偷人 10.4041700905
+刷刷声 13.900677652
+林大 13.2075304714
+客居 10.7226238216
+男装 10.3171587135
+尽可能减少 10.4666904475
+势如破竹 10.2117981979
+春山 11.0103058941
+身无分文 11.2616203224
+金香玉 12.5143832909
+红蚂蚁 12.8020653633
+卖花 11.3357282945
+嘉峪 13.2075304714
+郭祥笑 9.26594866375
+淮剧 13.900677652
+安扎克 13.900677652
+邵时昌 11.3357282945
+客属 11.5027823792
+错误观念 11.598092559
+抓细 13.900677652
+内部管理 10.533381822
+混排 13.900677652
+翼状 11.3357282945
+特大新闻 12.5143832909
+盗窃 8.98069672615
+铁案 11.9547675029
+连云樯 13.2075304714
+林奈 11.0674643079
+曾用 9.46986085313
+海兰察 11.9547675029
+三十余里 10.8561552143
+秦安能 13.2075304714
+葛嫩 13.2075304714
+韦尔斯 11.8212361103
+铁桥 11.5027823792
+克索斯 11.598092559
+曾生 13.2075304714
+中西药 12.2912397395
+欧洲游 12.1089181827
+数路 11.0674643079
+蓄意已久 13.2075304714
+飞转 11.4157710022
+飞轮 10.604840786
+同义语 10.4994802703
+蒿子秆儿 13.900677652
+其身正 12.8020653633
+遽然 11.7034530746
+飞车 11.1926274509
+格罗顿 13.900677652
+耿耿 10.3171587135
+大约摸 12.8020653633
+清凉寺 11.8212361103
+张道源 12.8020653633
+小迷糊 9.71102290995
+溶菌酶 11.598092559
+吐属 13.900677652
+涮羊肉 10.8561552143
+吃劲 12.5143832909
+秦震乐 13.2075304714
+存废 12.5143832909
+辣椒水 13.900677652
+国家计划委员会 11.0103058941
+存底 12.8020653633
+波利克 13.2075304714
+飞达 13.2075304714
+嘉山 12.1089181827
+蜜蜂窝 13.900677652
+螟害 13.2075304714
+弯角 12.2912397395
+何在乎 11.9547675029
+画着 9.91169360541
+绣花线 13.900677652
+孔明必 12.5143832909
+杨懋春 13.2075304714
+秦去尘 13.900677652
+偷书 12.2912397395
+译音 10.2630914922
+飞进 10.2371160058
+种植场 11.0674643079
+山高 10.0505300503
+地质矿产部 13.2075304714
+铁棍 10.4666904475
+嘉尔 12.5143832909
+吱溜 13.900677652
+王学文 12.5143832909
+事在必行 13.900677652
+铁棒 8.1902506346
+林姓 11.8212361103
+陶大镛 13.2075304714
+蜂王精 13.900677652
+飞过 9.20019728618
+飞迸 12.2912397395
+贾门 12.5143832909
+白杆兵 11.7034530746
+剥下 10.642581114
+痈疽 10.9562386728
+字调 12.8020653633
+老花眼 13.2075304714
+碧蓝 10.533381822
+能攻善守 12.2912397395
+霉头 12.2912397395
+摄政 8.81927328699
+何首乌 10.533381822
+药典 10.9049453784
+甄诚 12.8020653633
+画眉 9.4233408375
+帽上 11.598092559
+那满山 12.5143832909
+狭巷 13.2075304714
+姬蜂科 13.2075304714
+乌七八糟 11.4157710022
+派出所 8.00352378434
+卞喜 13.2075304714
+谈助 13.900677652
+嘉州 11.5027823792
+存异 12.5143832909
+协同工作 11.598092559
+长白山天池 11.8212361103
+一万二千 11.7034530746
+埃利蒂斯 13.2075304714
+歌谱 12.2912397395
+尤氏笑 10.9049453784
+种植园 9.22784881751
+混血种人 9.40086798165
+秋毫不犯 11.8212361103
+冯保约 12.8020653633
+湿漉漉 9.11318590919
+无始无终 11.598092559
+水秀山明 13.900677652
+达到顶点 11.1280889297
+米山 12.8020653633
+戈执戟 13.2075304714
+课桌椅 12.8020653633
+林堡 12.8020653633
+山鬼 10.4666904475
+山官道 12.8020653633
+爱情海 13.900677652
+益州道 12.8020653633
+添上 9.89334446674
+飞踢 13.900677652
+添乱 10.0720362555
+常含铁 12.5143832909
+燕塞湖 12.1089181827
+王竹溪 12.8020653633
+辛温解 13.2075304714
+那盛 13.2075304714
+李建国 12.5143832909
+恶声恶气 12.5143832909
+半辈子 9.44633035572
+各园 13.900677652
+女客 10.765183436
+二百九十三 12.8020653633
+净重 10.604840786
+卖菜 10.0294766411
+画皮 11.8212361103
+曾琦 11.5027823792
+两者之间 8.93783302172
+富商巨贾 11.8212361103
+记者会 10.2117981979
+西伯卒 13.900677652
+税捐处 13.2075304714
+口水直流 13.2075304714
+椰瓢 12.8020653633
+修会通 12.8020653633
+昆仑饭店 11.5027823792
+翼王 11.8212361103
+寻过 12.8020653633
+蓝五叹 13.2075304714
+堆笑 10.765183436
+墨鱼 10.1630080337
+萨勒诺 12.2912397395
+添人 12.5143832909
+抚心自问 13.900677652
+侯国鲁 13.2075304714
+国际私法学 13.2075304714
+当面错过 12.5143832909
+一堆堆 10.6818018271
+元凤 12.2912397395
+三杰 10.533381822
+催肥 13.900677652
+无形资产 10.0720362555
+丝织厂 11.0674643079
+添些 11.1926274509
+贪婪无厌 12.8020653633
+付素 13.900677652
+公共场所 9.62401153296
+普化尺 13.900677652
+碳铵 12.8020653633
+五十余条 13.900677652
+景观灯 12.2912397395
+各国 5.71365658463
+打进去 11.1926274509
+卖茶 10.0940151622
+不定式 12.1089181827
+自我解嘲 11.3357282945
+小泽征尔 12.1089181827
+母系制度 13.900677652
+一仍旧贯 13.900677652
+存心 9.29550746599
+爬行 8.45825994145
+铁槊 12.2912397395
+皮肤病 9.28555713513
+硕士学位 8.48457724977
+副驾驶员 11.5027823792
+中国民主建国会 10.8096351986
+原班人马 11.5027823792
+皮肤痒 13.2075304714
+梁诗正 12.8020653633
+宠儿 10.533381822
+俞允 12.8020653633
+莱亚 13.2075304714
+溃灭 11.2616203224
+柏文蔚 11.8212361103
+喉长气短 13.900677652
+拍了拍 8.92394390956
+阴虱 12.8020653633
+见习生 12.2912397395
+尼扎 11.598092559
+碳钢 10.8561552143
+赔身下气 13.900677652
+偷作 13.900677652
+赛斯 11.9547675029
+撑腰 9.74179456862
+潴留 10.1164880181
+郭松龄 10.9562386728
+名优产品 11.5027823792
+产品种类 10.0505300503
+瞎掰 13.900677652
+左缘 12.8020653633
+喷起 12.8020653633
+张国祥 11.598092559
+会付 13.2075304714
+难解之谜 11.9547675029
+尼斯 9.37888907493
+蓬首垢面 12.5143832909
+工程学 9.63799777493
+严克强 11.1926274509
+铁渣 12.8020653633
+半板 13.900677652
+母珠贾 13.2075304714
+同类产品 9.72629038208
+光华四射 13.900677652
+描涂 13.900677652
+半杯 10.604840786
+阿卡耶夫 12.8020653633
+挑三拣四 11.9547675029
+堆粪 12.2912397395
+加通湖 13.900677652
+双马 10.9562386728
+赛扬 12.8020653633
+爬过 10.7226238216
+会于 10.2897597393
+半期 10.9562386728
+碧色 11.9547675029
+高谈雄辩 12.8020653633
+甜津津 12.5143832909
+出鬼 12.8020653633
+半月 7.82074445688
+痛痛病 12.5143832909
+很爽 12.1089181827
+明耻教战 13.900677652
+第三节 9.65218240993
+幽愤 12.2912397395
+匡义 12.5143832909
+泡上 11.3357282945
+林彪 8.85725253506
+范炬炜 13.900677652
+仇深似 13.2075304714
+黄济 12.5143832909
+法兰西岛 12.8020653633
+感受性 10.9049453784
+马之战 13.2075304714
+白茫茫 9.71102290995
+一个三四岁 13.900677652
+建瓯县 12.1089181827
+穿梭往返 13.2075304714
+资源类型 12.8020653633
+恒生 8.98069672615
+封一 11.1280889297
+进口额 9.72629038208
+单目潜 13.2075304714
+嫉恶如仇 11.1280889297
+动人心魄 11.4157710022
+宣肺 11.0674643079
+窑口 11.1280889297
+晁错 10.4666904475
+赛拉 12.5143832909
+波利坎 12.5143832909
+嘲戏 12.8020653633
+克什米尔地区 10.6818018271
+窑变 11.598092559
+浮动式 12.8020653633
+碳化物 10.3453295905
+进晚餐 11.9547675029
+冥冥中 10.0940151622
+救助者 12.2912397395
+实验教学 13.900677652
+总以为 10.0088573539
+圆锥体 12.5143832909
+擅离 10.765183436
+颐养 11.1280889297
+毕卡索 12.8020653633
+第三艘 11.598092559
+波森 12.8020653633
+半枝 12.5143832909
+坡口 12.1089181827
+心理因素 9.69598503258
+双行线 13.2075304714
+内地版 12.8020653633
+会上 7.21232293803
+会下 12.2912397395
+去势 11.5027823792
+两袖清风 11.4157710022
+乌孜别克族 11.3357282945
+包拯 10.4666904475
+抓破 10.642581114
+攻城炮 12.5143832909
+天心区 10.9049453784
+活动力 11.4157710022
+外籍人 12.1089181827
+当家立计 13.2075304714
+系统模拟 12.8020653633
+筋疲力竭 12.5143832909
+伦理道德 9.66657114738
+会中 11.3357282945
+若耶溪 13.900677652
+会个 13.2075304714
+绿荧荧 12.5143832909
+谷壁呈 13.900677652
+出人头地 10.533381822
+酿酒 7.70423352418
+黄浊 13.2075304714
+意料到 12.8020653633
+东一句西 11.7034530746
+大白鲨 12.2912397395
+会为 9.21854642485
+令箭荷花 13.900677652
+洪流滚滚 13.2075304714
+大部分种 12.2912397395
+四十二行 13.2075304714
+托里奥 12.1089181827
+源头活水 13.2075304714
+出马 8.76487921493
+李治讳 13.2075304714
+林布 12.2912397395
+宫禁之 12.5143832909
+好几番 12.1089181827
+济济多士 13.900677652
+简明性 12.8020653633
+一针见血 10.1871055853
+股肱 10.2630914922
+戎禹 13.2075304714
+励忠义 12.8020653633
+无能为力 9.09665660724
+力量雄厚 11.4157710022
+数得上 12.8020653633
+薄云 11.2616203224
+林带 9.49395840471
+档案 7.82303540863
+思乡病 13.900677652
+进退裕如 13.900677652
+左后卫 13.2075304714
+林野 12.5143832909
+诈骗者 13.900677652
+肩井 12.5143832909
+氩气 12.8020653633
+苏梅克 13.2075304714
+大麻袋 12.2912397395
+远远不如 10.7226238216
+薄亲 13.900677652
+杜英科 11.5027823792
+于富平 13.2075304714
+嘉定 8.91707103027
+嘉宝 10.3743171274
+莫尔蒂耶 12.2912397395
+画点 13.2075304714
+呼出来 12.5143832909
+徐乐 12.8020653633
+乔伯年 9.69598503258
+森布罗 13.900677652
+生之子 11.598092559
+英国皇家学会 9.10488710638
+飞行 6.84622799384
+歧路 11.5027823792
+旁搜博采 12.8020653633
+缺乏食物 12.8020653633
+反恐精英 13.900677652
+江北区 11.2616203224
+会计学 10.8561552143
+硬石膏 11.1926274509
+分离法 11.598092559
+宫禁中 12.2912397395
+千杯不醉 13.900677652
+活动区 10.765183436
+露宿街头 11.2616203224
+归功于 9.20932976975
+林广 12.8020653633
+第十一层 13.2075304714
+统管 10.1871055853
+七里河 10.4041700905
+经营品种 12.2912397395
+林庄 12.8020653633
+可议之处 12.5143832909
+任玉岭 11.7034530746
+县衙门 10.4666904475
+五洲四海 13.900677652
+足称 13.2075304714
+天下大同 12.2912397395
+巴勒根 13.2075304714
+悉尼大学 11.8212361103
+南诏王 12.1089181827
+大渡桥横铁索寒 13.900677652
+随大流 11.4157710022
+银屑病 10.9562386728
+丹鹊 13.2075304714
+远远不够 9.58318953844
+电视电话会议 10.2897597393
+统筹 8.17382990439
+再婚者 13.900677652
+会计室 12.8020653633
+宠坏 11.3357282945
+出席观看 13.900677652
+暴露目标 11.598092559
+姚旺林 13.900677652
+螟岭 13.2075304714
+肩上 7.97375162601
+特殊照顾 12.1089181827
+龚稼农 12.8020653633
+若干支 12.1089181827
+朝珠 10.9562386728
+客室 13.900677652
+銮驾 10.4349417492
+曹魏正 13.2075304714
+丑儿 13.900677652
+产业基地 10.1394775363
+职业中专 13.900677652
+中共河南省委 11.0103058941
+会会 11.1280889297
+干涉者 12.5143832909
+外孙女 10.1164880181
+伸手不见 13.900677652
+外资项目 12.5143832909
+碳氮比 12.1089181827
+巴克莱银行 10.604840786
+黑白图片 13.900677652
+客官 9.43476953332
+桃胶 13.2075304714
+出饭 13.900677652
+里衣 13.900677652
+窑具 12.5143832909
+溜进来 12.2912397395
+里衬 12.8020653633
+顿河 9.69598503258
+岛民 11.598092559
+山鸟 12.1089181827
+济世救人 13.2075304714
+平儿正 12.8020653633
+小校奉 13.2075304714
+若耶江 13.900677652
+苑川王 12.8020653633
+邪性 11.8212361103
+土地银行 12.5143832909
+米阳坡 12.5143832909
+心苑 8.6966709649
+爱国主义 9.04086524761
+岳城 12.2912397395
+莱卡 12.8020653633
+标志性 9.12155415886
+碳酸 9.48183704418
+翼盒 12.8020653633
+智有勇 13.900677652
+期末余额 11.2616203224
+乘座 12.2912397395
+半数 8.42003872863
+美妙绝伦 12.8020653633
+山鸡 9.80633308975
+孔苁 12.2912397395
+肉颤心惊 13.900677652
+铁水 10.5684731418
+塔吉克族 10.8096351986
+黄流 11.7034530746
+苯二胺 13.2075304714
+习好 13.900677652
+李克农 13.2075304714
+资产值 11.5027823792
+山鹑 12.5143832909
+随大溜 13.900677652
+史称顺 13.2075304714
+第三股 13.900677652
+一个第一次 13.900677652
+抗日军政大学 10.2117981979
+铁汉 12.2912397395
+档次 8.80081122415
+联合国经社理事会 13.2075304714
+成一统 13.900677652
+河东流 9.74179456862
+留俄 13.900677652
+亚沃维 12.5143832909
+何清 11.3357282945
+黄爵滋 12.5143832909
+初冬 9.45802639549
+两亿多年 12.8020653633
+卸入 12.5143832909
+直上青云 13.900677652
+吸食毒品 13.900677652
+山鹰 9.98865464655
+墨香 11.3357282945
+九百二十二 13.2075304714
+唯我独尊 12.2912397395
+留面子 13.2075304714
+超高热 13.900677652
+山鹿 12.8020653633
+裨益 10.6818018271
+从延津 12.1089181827
+堆绣 11.9547675029
+投下来 12.2912397395
+伟哥 10.1394775363
+白尼罗河 11.4157710022
+山麓 7.86280673205
+陆孝彭 12.5143832909
+金兰之 13.900677652
+忽阴忽晴 13.900677652
+活性中心 11.1926274509
+半旗 13.900677652
+杠板归 13.900677652
+简氏 11.0674643079
+优尼科 12.8020653633
+西装裤 11.9547675029
+阴茎 8.9102450652
+佩萨莫 13.2075304714
+飘舞 10.765183436
+丑剧 11.598092559
+铁沙 12.2912397395
+亲弟兄 13.2075304714
+一个二十多岁 11.3357282945
+尼木 12.8020653633
+突破点 11.7034530746
+伊麻尼 13.2075304714
+上天无路 11.1280889297
+李天歌 12.2912397395
+接触不良 12.1089181827
+半时 11.1926274509
+柴米 11.3357282945
+中共中央北方局 12.1089181827
+很爱 10.8561552143
+梁上悬 13.900677652
+掌灯 10.0720362555
+半日 8.06294720481
+半旧 10.1164880181
+日偏食 12.8020653633
+普化天 12.8020653633
+畏惧感 13.2075304714
+女子 6.53613063772
+种植区 11.3357282945
+药商 13.900677652
+半斗 13.2075304714
+上酒家 13.900677652
+角旗 13.900677652
+盘根错节 10.7226238216
+林州 11.0674643079
+币帛 13.900677652
+因特 13.2075304714
+八百余年 13.2075304714
+达观 12.5143832909
+种植 6.64367494488
+第三者 8.87679713113
+大丛 13.900677652
+惊魂未定 9.91169360541
+铁系元素 13.900677652
+冯保答 11.0674643079
+胆小鬼 10.2897597393
+海防港 13.900677652
+充门面 13.900677652
+半新 11.598092559
+爬起 11.0674643079
+刘兴居 12.5143832909
+窑内 12.2912397395
+黄绢幼 13.2075304714
+半斤 9.82314020807
+出首 11.1926274509
+之作 8.0285598625
+帕福斯 13.900677652
+李建华 10.0940151622
+两辈子 12.8020653633
+风物 10.1871055853
+离婚案 11.3357282945
+训戒 12.2912397395
+品牌手机 11.9547675029
+批条子 12.2912397395
+若干枚 11.7034530746
+审查批捕 13.900677652
+跑江湖 11.4157710022
+行政局 13.2075304714
+驻地 7.49544919394
+二四个 12.8020653633
+出项 12.8020653633
+负荆请罪 11.5027823792
+审稿 12.1089181827
+德艺双馨 13.900677652
+椰雕 11.7034530746
+不得其法 12.8020653633
+首相府 13.900677652
+高精度 9.41204128224
+那耶律 12.8020653633
+统称 7.54804825566
+综治办 13.900677652
+重氮盐 11.3357282945
+客套 9.77354326693
+承台 12.5143832909
+国际型 13.900677652
+技术咨询 10.8561552143
+宁致远 10.533381822
+烘箱 13.2075304714
+断电器 12.8020653633
+铁流 11.4157710022
+伊季山 13.900677652
+铁浆 13.900677652
+撑船 10.1394775363
+药品 7.35245854921
+汝托 13.2075304714
+活血 9.43476953332
+男足 11.7034530746
+项数 12.2912397395
+一个家 10.1394775363
+踢回 13.2075304714
+只见 5.70121345436
+畜牲 9.94943393339
+嘲笑地 11.9547675029
+侯俞 12.5143832909
+沃洛夫人 11.7034530746
+信息加工 10.7226238216
+绷簧 13.2075304714
+德黑兰 9.66657114738
+畜牧 8.47572763449
+重庆市委 11.598092559
+十万二十万 13.900677652
+林山 12.5143832909
+桃色 12.2912397395
+任务调度 13.900677652
+开会研究 11.3357282945
+改变程序 13.900677652
+死眉瞪眼 13.900677652
+石秀守 13.2075304714
+药名 11.3357282945
+简洁 8.44535653662
+金斧 12.8020653633
+都安县 12.8020653633
+曼伯 13.900677652
+武帝乃 12.2912397395
+山龟 13.2075304714
+嘉奖 9.61021821083
+寻求真理 12.5143832909
+关系户 12.1089181827
+碟型 13.2075304714
+郁积 10.533381822
+莱布尼兹 9.93038573842
+若干服 12.8020653633
+七里湖 12.5143832909
+初出 11.5027823792
+非手术 11.7034530746
+生育率 11.7034530746
+张开着 12.8020653633
+吴国伦 12.5143832909
+数据库 8.91707103027
+第十次 10.3743171274
+丘县尉 13.2075304714
+画片 11.7034530746
+护法神 11.1280889297
+贫困潦倒 12.5143832909
+桃花 8.44109213783
+公共积累 13.900677652
+简派 11.598092559
+精瘦 10.642581114
+昏昏迷迷 12.1089181827
+外孙子 11.2616203224
+伊凡诺 13.2075304714
+逗人喜欢 13.2075304714
+慈禧站 12.8020653633
+封为郡 13.2075304714
+兵慌马乱 11.9547675029
+鸷鸟 12.5143832909
+饶你狗 12.8020653633
+布尼奥 13.900677652
+匠人 9.36807815882
+城市论坛 13.900677652
+人造纤维 10.3171587135
+吴王光 12.1089181827
+夏金桂 12.8020653633
+领着 7.68606955355
+金斗 13.2075304714
+保平争 13.900677652
+原封不动 10.4994802703
+飘荡 9.5062284973
+太宗皇帝 9.84023464143
+伦钦夏 12.8020653633
+徐信 12.8020653633
+出题 10.642581114
+若干条 11.1280889297
+林峰 13.900677652
+外强中干 11.5027823792
+文伯仁 12.5143832909
+背叛者 11.8212361103
+药味 11.3357282945
+机关枪 9.98865464655
+平定 7.52055511508
+危急关头 10.8561552143
+平实 10.4994802703
+有变 9.41204128224
+哈尔克 12.1089181827
+吃水难 13.900677652
+横巷 13.2075304714
+咸性 13.900677652
+孔泰 12.5143832909
+米糠油 11.9547675029
+平安 6.71604849926
+乌台诗 13.900677652
+五级 10.4041700905
+俗话 9.61021821083
+通志 9.6811699468
+阿塞拜疆 9.61021821083
+升贴 12.1089181827
+张铁嘴 13.2075304714
+宋始 11.9547675029
+俗语 9.55687223012
+李信略 13.2075304714
+和嘉轩 11.9547675029
+晨夕 12.5143832909
+猛击一掌 12.8020653633
+有奶便是娘 12.8020653633
+倒海翻江 11.8212361103
+幸运星 13.900677652
+乌龟 9.71102290995
+回笼觉 12.2912397395
+邹靖华 13.2075304714
+空军政治部 12.8020653633
+舒王 12.8020653633
+丙等 13.900677652
+禁言 13.900677652
+农村公路 10.8096351986
+玄览 12.1089181827
+头等大事 9.87532596124
+五维 13.2075304714
+通往 7.20983537456
+扯裂 12.5143832909
+路局 12.8020653633
+困境 7.65070240972
+海洋能 11.0103058941
+抢话 12.5143832909
+体院 12.2912397395
+通得 12.5143832909
+连年丰收 12.5143832909
+首出 13.900677652
+霎时 9.72629038208
+点验 12.5143832909
+升起 8.092535162
+圆柱 9.74179456862
+五绝 11.4157710022
+古迭儿 12.8020653633
+荣昌 10.4666904475
+世纪 4.68137753863
+技术细节 13.900677652
+专科医院 10.8561552143
+希罗 11.5027823792
+希罕 10.4041700905
+想报 13.2075304714
+价格体系 10.3743171274
+华成 12.1089181827
+余万美元 13.900677652
+五组 12.8020653633
+通德 10.0505300503
+范蠡 10.2897597393
+聂聂雄 12.5143832909
+向豫州 13.2075304714
+审校 13.2075304714
+知识论 12.5143832909
+商王赏 13.2075304714
+阴谋诡计 9.93038573842
+杨本庵 10.3453295905
+二七区 9.46986085313
+高炮旅 12.1089181827
+庄田约 13.900677652
+攻不破 11.598092559
+方文 13.2075304714
+贬逐 11.7034530746
+版籍 11.598092559
+圆月 10.3743171274
+审核 7.19748953873
+华拳 13.900677652
+反语 12.8020653633
+后援存储器 13.2075304714
+庸俗化 11.7034530746
+明码 11.9547675029
+阎良 12.5143832909
+葡萄柚 11.7034530746
+用劲 10.765183436
+梅派 11.598092559
+缔造 9.58318953844
+通彻 13.2075304714
+圆木 10.3743171274
+宋奘 12.2912397395
+偷着乐 11.0674643079
+葡萄架 10.3743171274
+通式 9.93038573842
+曾培炎 11.5027823792
+推过去 11.8212361103
+明确 5.66452199029
+稳固 8.43261751084
+形诸笔墨 13.2075304714
+宋太 13.900677652
+平子 12.1089181827
+十四篇 12.5143832909
+姜维问 13.2075304714
+菜豆 10.604840786
+曹营诸 13.2075304714
+将功折罪 11.4157710022
+安帝隆 12.5143832909
+姜维闻 13.2075304714
+棉铃 12.5143832909
+公道话 10.4349417492
+拟稿 11.7034530746
+轰声 13.900677652
+佐餐 11.3357282945
+泉下 11.0674643079
+冯升 12.8020653633
+押金 10.0505300503
+审案 10.5684731418
+军事演习 9.98865464655
+宋夏 12.1089181827
+溶蚀谷 13.900677652
+西路军 10.1394775363
+特有种 9.77354326693
+四季豆 11.598092559
+格林纳达 10.6818018271
+班房 10.5684731418
+蚀变岩石 13.900677652
+移种 13.900677652
+乌弋山 11.3357282945
+事事躬亲 13.900677652
+世翁 13.2075304714
+开封 6.54248389924
+庄王 11.8212361103
+开射 13.2075304714
+纪国 13.900677652
+横峰 11.9547675029
+开小 11.9547675029
+壁式 12.5143832909
+孔深 11.7034530746
+挂斗 13.900677652
+升调 13.2075304714
+巴斯夫 11.5027823792
+流水声 10.604840786
+兼并额 13.2075304714
+五群 12.5143832909
+淳朴 9.71102290995
+抒情文 12.5143832909
+辖属 12.2912397395
+本科毕业 12.2912397395
+伐树 12.8020653633
+夏克 12.8020653633
+弯矩 12.1089181827
+拔牙 10.8096351986
+挂断 9.66657114738
+虽则 9.40086798165
+带话 12.2912397395
+包成 11.4157710022
+移码 13.900677652
+加罗法 12.8020653633
+五羊 12.1089181827
+押送 9.66657114738
+夺气 12.2912397395
+中柱鞘 11.8212361103
+电子天平 13.900677652
+无根水 12.5143832909
+阿亚拉 13.2075304714
+为时过早 9.59661255877
+开局 9.72629038208
+杨家坪 12.1089181827
+布思麻 13.2075304714
+存取控制 13.2075304714
+一九六六 13.2075304714
+奥运冠军 11.2616203224
+风光带 13.2075304714
+打基础 12.1089181827
+绳子 7.89679058487
+新旧 8.85725253506
+手脚冰凉 11.1280889297
+鱼复诸 12.5143832909
+恰逢 9.35738286971
+南丫岛 12.8020653633
+挂旗 13.2075304714
+开展 6.04358378707
+体面 8.58747167293
+消费类 7.97909923233
+抗风湿 11.9547675029
+令人生厌 11.4157710022
+宋境 11.7034530746
+花荣带 12.8020653633
+调幅器 12.5143832909
+民心所向 12.1089181827
+后庭花 12.2912397395
+主谋者 12.8020653633
+奥特斯 12.8020653633
+横岗 12.5143832909
+漳州人 13.2075304714
+逃之夭夭 10.6818018271
+开山 9.5186510173
+湖景区 12.8020653633
+河北师范大学 12.8020653633
+通庵 12.8020653633
+二联体 12.8020653633
+确切不移 12.8020653633
+鞭辟入里 12.2912397395
+帕特 11.3357282945
+光反射 11.3357282945
+以下内容 11.0103058941
+湖滨区 12.8020653633
+舒爽 11.8212361103
+需求量 8.33615724465
+横山 10.0294766411
+弯着 11.2616203224
+明示 9.38981814546
+明礼 12.8020653633
+希纳 12.5143832909
+长性 13.900677652
+定型化 11.3357282945
+尼奥夫 11.9547675029
+练武术 13.900677652
+裂开来 12.5143832909
+子李寿 13.2075304714
+速射炮 11.2616203224
+孔凡礼 13.2075304714
+揖让 12.1089181827
+李天锡 12.8020653633
+阿德斯 13.2075304714
+几百平方米 12.5143832909
+抄集 12.5143832909
+何逊 13.2075304714
+现代文学 10.0940151622
+金旅 12.1089181827
+钟家湾 12.5143832909
+卜骨 11.4157710022
+菜贩 11.598092559
+虚位 10.765183436
+舌锋 13.900677652
+荣枯 10.9049453784
+史宾赛 13.2075304714
+逃进来 12.5143832909
+杨家埠 11.7034530746
+行李箱 10.604840786
+舒特 13.2075304714
+子伯 12.5143832909
+第六段 13.900677652
+一百一十卷 12.8020653633
+奶茶 10.2630914922
+假新闻 12.2912397395
+老干妈 13.2075304714
+勘察队 12.1089181827
+亚太经社会 13.900677652
+甘温 11.3357282945
+包户 13.2075304714
+生子 9.62401153296
+孔洞 10.4994802703
+抗癌 9.65218240993
+赞佩 12.2912397395
+刑改为 13.2075304714
+八千八百万 13.900677652
+通带 12.5143832909
+柳叶形 12.5143832909
+三床 12.5143832909
+通常 5.45455090899
+明神 11.9547675029
+徐志坚 12.8020653633
+取而代之 8.88339781516
+僧服 13.900677652
+金木水火 13.900677652
+张文远 11.8212361103
+新镇 10.4666904475
+忧闷 10.3171587135
+司仪 10.604840786
+开开 10.765183436
+雷庆送 13.900677652
+鄂毕河 10.4666904475
+长久之计 10.5684731418
+禁行 9.82314020807
+防护力 10.2117981979
+慈禧太后 8.76487921493
+开弓 10.642581114
+通州 8.58255765813
+论我国 12.8020653633
+莫斯科东方大学 11.7034530746
+慌了手脚 9.89334446674
+双料冠军 11.5027823792
+双边合作 11.2616203224
+缠着 12.8020653633
+山梨糖 13.2075304714
+国产化 9.82314020807
+朱剑红 13.900677652
+通工 12.5143832909
+选择指数 12.2912397395
+夫妻生活 10.4349417492
+长排 12.1089181827
+结果枝 12.8020653633
+土土 11.9547675029
+卡佩家族 13.2075304714
+物种 8.46695564842
+道德法庭 13.900677652
+抛出去 11.4157710022
+世系 9.55687223012
+平妥 13.2075304714
+民间故事 9.71102290995
+宋宣 11.598092559
+棒冰 13.900677652
+夏利 10.0505300503
+订阅 8.26588804881
+麻纤维 11.3357282945
+宋宪 11.3357282945
+沃鲁 13.900677652
+墙角处 11.8212361103
+反之亦是 13.900677652
+小力 12.5143832909
+禄父 13.900677652
+撒尼族 13.2075304714
+宋家 11.3357282945
+都拉斯 12.8020653633
+未亡人 11.9547675029
+博山古 12.8020653633
+保健知识 11.9547675029
+兵器工业 11.4157710022
+学法 11.5027823792
+邓荫南 13.2075304714
+地沃宜 12.2912397395
+九百七十九公里 13.2075304714
+抒情曲 13.2075304714
+版纳 11.8212361103
+开彩 13.2075304714
+深槽 11.3357282945
+毕业证 10.765183436
+夏初 10.0505300503
+为政 9.55687223012
+李国柱 11.598092559
+千户所 10.642581114
+路平 13.900677652
+罪该万死 10.2897597393
+宋宝 13.2075304714
+血吸虫 10.765183436
+诸府州 12.5143832909
+开往 8.97342396682
+开征 9.14708746087
+消费群 11.8212361103
+辽代 9.5186510173
+西特拉 12.1089181827
+打磨机 13.900677652
+承包商 9.85762638414
+爸爸 6.83934328507
+路府 13.2075304714
+公开赛 10.642581114
+开得 8.91707103027
+平复 9.75754292558
+断简残篇 13.2075304714
+阿卡亚 13.2075304714
+壮大力量 13.900677652
+西藏 7.1072115194
+十二位 12.2912397395
+于汉魏 12.8020653633
+公告栏 12.8020653633
+贯彻到底 11.8212361103
+搔首 11.9547675029
+尊贵 8.73589167805
+敝处 11.3357282945
+笑傲风月 13.900677652
+焊到 13.2075304714
+入党 9.25628675283
+普通话 9.21854642485
+平头 10.0088573539
+宋子 12.5143832909
+刁钻古怪 11.1280889297
+班加罗尔 11.5027823792
+惊怕 10.8561552143
+沈月泉 13.2075304714
+伊萨卡 13.2075304714
+开心 8.13235665618
+圣马力诺 10.7226238216
+鳞毛 11.5027823792
+丙种 12.8020653633
+五类 10.1630080337
+十四种 12.8020653633
+难料 10.0505300503
+武经 13.2075304714
+姚苌领 12.8020653633
+眼仁 11.8212361103
+鳞比 13.2075304714
+五米 10.9049453784
+李广花 13.900677652
+阵营 8.73019365694
+杜云生 13.900677652
+颜良之 13.900677652
+十万两 10.3453295905
+升迁 9.13850371718
+阿比西尼亚 11.0674643079
+焊剂 13.2075304714
+向众卿 13.900677652
+时云长 13.2075304714
+浅粉红色 13.900677652
+开快 12.8020653633
+胃粘膜 10.7226238216
+斯皮尔伯格 12.5143832909
+为时过晚 11.8212361103
+三座 9.46986085313
+青玉案 13.2075304714
+鳝鱼 10.8561552143
+马拉卡 12.8020653633
+五百五十余万两 13.2075304714
+愚弄群众 13.900677652
+开市 7.71241352889
+成祖朱 13.2075304714
+观音大士 11.1280889297
+澳网 12.2912397395
+师蓝瑛 13.2075304714
+霍万斯 13.900677652
+十二代 12.8020653633
+标引词 13.900677652
+光反应 11.9547675029
+反舰导弹 8.94485059437
+高山峻岭 10.9562386728
+挂果 12.8020653633
+两半部 12.2912397395
+德领兵 12.5143832909
+尽其所能 11.8212361103
+原鸽 12.2912397395
+半大不小 13.900677652
+严济慈 12.1089181827
+喊一声 10.0294766411
+盐铁使 10.2117981979
+挂架 9.7898037878
+拒不履行 11.5027823792
+它能 8.69119149913
+红扑扑 10.4349417492
+伪造证据 11.8212361103
+面是背非 13.900677652
+之世 9.77354326693
+言为然 13.2075304714
+体长 7.53249046563
+唐长庆 12.8020653633
+入睡 8.50705010562
+越共中央 12.5143832909
+长拳 11.5027823792
+断顿 11.8212361103
+十二亿 13.900677652
+八九不离十 10.533381822
+产生矛盾 11.1280889297
+阿克萨清真寺 12.5143832909
+开幕 8.33615724465
+启闭机 13.2075304714
+困守 10.1394775363
+第一产业 10.3743171274
+胡笳十八拍 11.7034530746
+宇里 12.2912397395
+华意 11.598092559
+嗵嗵 11.1926274509
+痞子男 13.900677652
+平声 11.4157710022
+米麦 11.8212361103
+赫梅尔尼 13.900677652
+开平 9.09665660724
+如芒在背 12.5143832909
+开年 11.7034530746
+马出城 10.533381822
+十二五 9.0884932966
+裂隙水 11.1280889297
+平壤 9.38981814546
+守信用 12.2912397395
+富有者 13.2075304714
+周期性地 10.8096351986
+于众生 13.900677652
+上翻门 13.900677652
+路径 7.76295059789
+夏口 10.4349417492
+玄言 12.1089181827
+大山雀 12.2912397395
+彻里至外 13.900677652
+教学设施 12.1089181827
+正用 9.77354326693
+李天霞 13.900677652
+秦昭王 10.3743171274
+软骨头 11.1280889297
+本位币 11.8212361103
+古天乐 12.5143832909
+开府 9.72629038208
+熊十力 13.2075304714
+黄花岗 10.9049453784
+刀疤 11.1926274509
+子笑笑 13.2075304714
+伽蓝 10.0088573539
+三幅 10.9049453784
+深栽 12.5143832909
+明月店 13.2075304714
+卜尼法 12.2912397395
+长成 8.70772080109
+真人不露相 12.1089181827
+宏扬 13.2075304714
+极化效应 13.900677652
+臀围 12.2912397395
+路德 9.7898037878
+横幅 9.69598503258
+幸恢帧 12.5143832909
+通山 10.3453295905
+圆屋顶 13.2075304714
+萨弗里 12.8020653633
+平塘 12.5143832909
+十二个 8.92394390956
+惊怪 11.9547675029
+神山圣 13.2075304714
+赵朴斋 13.900677652
+十二两 12.1089181827
+显陵 11.9547675029
+动力机 11.0103058941
+腋毛 11.7034530746
+配配 12.2912397395
+尉中唯 13.2075304714
+一来二去 10.9049453784
+刀痕 11.2616203224
+贺家庄 12.8020653633
+劳埃德 10.6818018271
+梅济耶 12.8020653633
+晋安帝 13.2075304714
+控制力 10.0940151622
+和智深 12.8020653633
+无烟火药 11.4157710022
+后勤部门 11.1926274509
+长打 13.900677652
+筹组 10.5684731418
+财政资本 12.8020653633
+月黑杀人 11.9547675029
+毛果苔 12.2912397395
+云长公 13.2075304714
+生理机制 11.9547675029
+开建 9.72629038208
+三万八千 12.5143832909
+杀出去 11.3357282945
+学业成绩 11.7034530746
+华晨 9.05649056552
+献上 9.25628675283
+丹参 10.2117981979
+几百千克 12.8020653633
+卤蛋 13.900677652
+长方 10.4041700905
+侠客行 13.900677652
+平得 13.900677652
+演化史 11.8212361103
+循规守旧 13.900677652
+三木 10.8096351986
+开外 9.54396882529
+揣想 13.2075304714
+献丑 11.0674643079
+别开蹊径 13.900677652
+洗手间 10.2897597393
+楚布寺 13.2075304714
+微生物学 10.4349417492
+占巴塞 12.8020653633
+国命 13.2075304714
+主义教育 11.4157710022
+费时费事 13.2075304714
+吴兰修 13.2075304714
+热扩散 12.5143832909
+路堤 12.5143832909
+揣情 13.900677652
+击鼓鸣冤 12.8020653633
+公开课 13.900677652
+锚链 12.8020653633
+连官家 12.5143832909
+长斋 11.7034530746
+漆川岛 13.900677652
+开头 7.96843246453
+任为 9.0884932966
+长文 12.1089181827
+宋州 11.3357282945
+萨苏 13.2075304714
+夏启 11.9547675029
+具体而微 13.2075304714
+中小银行 8.78268383956
+于圣主 13.900677652
+笔顺 13.900677652
+刀片 10.4349417492
+呼哧 12.5143832909
+华映 12.8020653633
+顶门立户 11.8212361103
+万架次 11.8212361103
+董传策 13.2075304714
+三星期 13.2075304714
+通宝 10.0720362555
+童话集 11.7034530746
+开奖 10.8096351986
+酶系统 11.4157710022
+平心 11.9547675029
+长日 11.9547675029
+城东区 13.2075304714
+古邗国 12.8020653633
+克莱森 13.2075304714
+五章 12.1089181827
+科学著作 11.1280889297
+之久 7.56917580208
+炉甘石 12.2912397395
+尚未可知 11.598092559
+精确化 11.598092559
+专业队伍 11.5027823792
+痹症 13.2075304714
+蔬菜类 11.1280889297
+惨毒 12.8020653633
+庄上来 10.8096351986
+物美 10.3453295905
+内科医生 12.1089181827
+通宵 9.40086798165
+化痰药 12.8020653633
+荣成 11.1280889297
+放归 11.1280889297
+开好 11.0103058941
+扯谎 10.7226238216
+智利草莓 13.900677652
+衙内 9.89334446674
+扯谈 12.1089181827
+泰山鸿毛 13.900677652
+克莱格 13.900677652
+玄贞 13.900677652
+困局 9.49395840471
+何键 12.5143832909
+教学信息 13.900677652
+通孔 12.1089181827
+低电平 13.900677652
+海天一色 13.900677652
+孔桥 13.2075304714
+吉甫奏 13.2075304714
+王求仁 13.2075304714
+共同行动 10.765183436
+开回去 12.8020653633
+王致诚 13.2075304714
+宋兵战 13.900677652
+言相求 13.2075304714
+尼克尔 12.8020653633
+赭石色 12.8020653633
+大展身手 11.5027823792
+内务部长 11.0103058941
+归期 11.598092559
+防水涂料 12.5143832909
+慧心 12.8020653633
+子宓 12.2912397395
+正生 12.8020653633
+于敏 13.2075304714
+抒情性 10.604840786
+突破 5.62428294711
+几本书 10.4666904475
+相邦外 13.2075304714
+玄赋 12.8020653633
+机械功 10.8561552143
+德商 12.5143832909
+横头 11.598092559
+该游戏 10.9562386728
+协查 13.900677652
+全部都是 10.2630914922
+动力性 10.2897597393
+大力提高 11.3357282945
+烂秧 12.5143832909
+语象 13.900677652
+雷克吕 13.2075304714
+日来 10.9562386728
+走穴 12.2912397395
+入眼 10.9562386728
+奥尔波特 13.900677652
+占广丰 13.2075304714
+基底层 13.2075304714
+业生 13.900677652
+长效 9.65218240993
+德国队 12.5143832909
+扯来扯去 13.2075304714
+糯玉米 13.900677652
+尚明轩 13.2075304714
+开堂 13.2075304714
+喜相逢 12.8020653633
+梁爱诗 13.2075304714
+五十两一锭 13.2075304714
+翅脉 10.9562386728
+热体 12.8020653633
+巴彦浩特镇 12.5143832909
+曲体 11.4157710022
+电工机械 12.8020653633
+老行家 13.2075304714
+平底 10.604840786
+夏侯尚引 13.2075304714
+玄机暗藏 13.900677652
+站住脚 10.0720362555
+浸剂 13.2075304714
+亿度 9.33632946051
+修梁 11.9547675029
+整一下 12.8020653633
+平庄 11.598092559
+平庸 9.37888907493
+一十五万 13.2075304714
+张申府 13.900677652
+晓东 11.8212361103
+筹码 7.80710788193
+夏商 10.533381822
+之交 9.69598503258
+平康 12.8020653633
+中等水平 10.0088573539
+达仁堂 12.8020653633
+纳吐夫 12.5143832909
+公众形象 12.5143832909
+封禄 13.2075304714
+女上位 13.2075304714
+托利亚 9.89334446674
+路头 11.598092559
+添置 9.56994431169
+王子笑 12.8020653633
+乔尔乔涅 12.1089181827
+罚款单 12.2912397395
+痞子 10.3743171274
+百分之二十点 12.8020653633
+肺泡 10.1164880181
+农业装备 11.0674643079
+本族语 11.598092559
+人物造型 10.8096351986
+八十五天 12.8020653633
+卖弄风情 12.5143832909
+被覆着 13.2075304714
+花香调 13.900677652
+二十三 9.46986085313
+华服 11.8212361103
+颐指气使 9.93038573842
+旧友 10.765183436
+满地跑 13.900677652
+炉温 11.598092559
+挨肩叠背 13.900677652
+粟饭 13.900677652
+桑拿浴 10.9049453784
+五篇 11.7034530746
+炉渣 10.8561552143
+新闸 12.5143832909
+锤击 11.4157710022
+圆成 13.2075304714
+江千佛 13.2075304714
+坐南朝北 12.8020653633
+杜尔伯特蒙古族自治县 11.598092559
+平帝 11.1280889297
+淡灰色 11.3357282945
+二十一 9.13850371718
+十三口 12.8020653633
+翅膀 7.96843246453
+斯达尔 12.8020653633
+禁运 10.4666904475
+宋山 13.2075304714
+笼罩着 9.19114745066
+闽东特委 13.900677652
+通婚 9.19114745066
+和政 12.8020653633
+平布 11.598092559
+侗寨 12.2912397395
+南木错 11.1926274509
+冬桃 12.8020653633
+永垂不朽 11.598092559
+虚浮 11.2616203224
+蔡河诸 13.2075304714
+心中有数 9.63799777493
+支吾 9.27570483869
+五笔 12.8020653633
+顶职 13.900677652
+丙级 13.900677652
+圆房 11.8212361103
+晓事 10.3453295905
+旧县 11.4157710022
+低噪声 10.604840786
+东寨 11.5027823792
+协商会议 11.7034530746
+深港 10.3171587135
+丙纶 11.3357282945
+慧康 13.900677652
+辖境 9.74179456862
+工博会 11.9547675029
+平肝潜阳 12.1089181827
+耳目众多 11.5027823792
+隐形技术 10.8096351986
+深湛 11.8212361103
+鼾音 13.900677652
+晋成帝 12.1089181827
+不能言传 13.2075304714
+献俘 10.3743171274
+对流雨 13.2075304714
+二十三路 12.5143832909
+宋尹 13.2075304714
+机械厂 9.6811699468
+力争上游 12.8020653633
+先例 8.68574189437
+平平 9.00283785202
+藤井健雄 13.2075304714
+蓝三色 12.8020653633
+怎么弄 10.9049453784
+平年 11.4157710022
+遗传基因 10.4349417492
+开壳 13.2075304714
+未结算 11.8212361103
+华枝 12.8020653633
+薛福成 11.598092559
+五等 10.0505300503
+扯起 9.84023464143
+东州城 12.5143832909
+茅岭江 12.5143832909
+库萨克 13.900677652
+华林 10.1871055853
+知其所以然 12.8020653633
+辗转反侧 10.2117981979
+荣恩 13.900677652
+家道中落 11.0674643079
+犹可 10.2630914922
+演化出 11.2616203224
+原山煌 13.2075304714
+之于 9.15574552361
+公式主义 13.900677652
+普通车 12.8020653633
+明线 11.5027823792
+崔大谋 12.5143832909
+之二 9.71102290995
+魏嘉平 12.2912397395
+料仓 13.2075304714
+窠臼 10.604840786
+绳尺 13.2075304714
+众口难调 12.8020653633
+地质公园 12.1089181827
+五碗 12.8020653633
+淮扬菜 12.2912397395
+吴升好 13.2075304714
+气不公 13.900677652
+深涧 9.46986085313
+连续作战 11.0103058941
+李长久 13.2075304714
+多一秒 13.900677652
+四十好几 13.2075304714
+华壁皆 13.2075304714
+平州 10.4349417492
+平川 10.1871055853
+唱到 10.533381822
+挂拍 13.2075304714
+搓到 13.2075304714
+憋足 11.1280889297
+玄远 12.2912397395
+宋德 13.900677652
+三十六万余 13.2075304714
+法人资格 10.604840786
+移置 11.0674643079
+李士实 13.2075304714
+深深 7.41147272065
+水浇地 10.1630080337
+冯国彰 13.900677652
+开学 9.08039608637
+汉尼拔 10.642581114
+棒喝 11.9547675029
+劳资双方 11.7034530746
+信托 7.67216664838
+明细 9.98865464655
+希祖 13.2075304714
+双双把 13.900677652
+简体版 13.2075304714
+丹珠尔 12.5143832909
+长柄 9.69598503258
+筹策 12.5143832909
+确切性 13.900677652
+于晚志 12.8020653633
+长机 11.9547675029
+弗格森 12.1089181827
+不足为虑 10.8096351986
+开完 10.6818018271
+祖氏 12.1089181827
+以策 12.2912397395
+夏国 9.40086798165
+挂成 13.900677652
+开宗 12.2912397395
+年均 6.59414625304
+梦游症 12.1089181827
+开宝 9.87532596124
+长期 5.12112019609
+开审 11.8212361103
+见礼 11.0103058941
+旧历 11.8212361103
+希福 11.8212361103
+核桃木 12.8020653633
+通好 10.9562386728
+击杀 10.7226238216
+通奸 10.604840786
+李皇亲 12.2912397395
+公营企业 12.5143832909
+何震 11.8212361103
+坎坷 9.09665660724
+何需 11.5027823792
+筹算 10.8561552143
+优待金 13.900677652
+长板 12.5143832909
+深浓 13.2075304714
+押韵 10.0940151622
+屈就于 13.900677652
+担保费 11.9547675029
+宫古 13.2075304714
+强横霸道 13.900677652
+一语道破 11.0103058941
+人财两旺 13.900677652
+墨忒耳 12.2912397395
+中共中央组织部 11.4157710022
+通夜 11.3357282945
+轲比能 10.8096351986
+一次 4.66466953325
+深浅 8.87023973058
+系谱法 13.2075304714
+火冒三丈 10.2117981979
+方大人 12.1089181827
+长条 9.84023464143
+刘建新 13.900677652
+林泉兄弟 12.8020653633
+镰状 11.9547675029
+通天 9.09665660724
+深海 8.44109213783
+有巢氏 12.8020653633
+正在流行 12.8020653633
+病情恶化 10.9049453784
+升读 13.900677652
+蜗轮副 13.2075304714
+那可儿 13.2075304714
+洋务派 9.89334446674
+舒畅 9.82314020807
+信纲 13.900677652
+政令畅通 13.2075304714
+人而无信 13.900677652
+长杆 10.4666904475
+亚非拉 11.2616203224
+大堰河 13.900677652
+开导 9.53122979951
+种族主义者 12.2912397395
+助人 12.5143832909
+活立木 10.8096351986
+斯科科 12.5143832909
+通海县 12.2912397395
+挂掉 11.5027823792
+深沟 9.71102290995
+辽中 12.5143832909
+生菜沙拉 13.2075304714
+宋廷 10.0720362555
+马给丁 12.8020653633
+避嫌守义 13.900677652
+鸦片战争 8.15447446144
+宋建 10.9049453784
+禁赛 11.8212361103
+舵杆 12.5143832909
+数辈 13.2075304714
+助产 11.2616203224
+带路 9.36807815882
+挂接 13.2075304714
+汜水镇 11.5027823792
+贺兰县 12.1089181827
+需求面 11.1926274509
+总营业额 13.2075304714
+斯达康 13.2075304714
+消费税 8.64840422393
+即便如此 9.32596667347
+五福 11.3357282945
+立功赎罪 10.9049453784
+美国硅谷 12.1089181827
+处理权 12.5143832909
+忧郁 8.52539924429
+助于 11.598092559
+热点问题 10.1630080337
+夏圭 11.3357282945
+互递 13.900677652
+不会弄错 12.1089181827
+时令性 13.2075304714
+低浓度 10.4041700905
+一发不可 13.900677652
+扯远 11.1926274509
+宋康 12.5143832909
+教务部 13.900677652
+科学基金 12.8020653633
+顶芽 11.1280889297
+雷庆家 11.5027823792
+路子 9.28555713513
+界牌 13.900677652
+宋庆 11.1926274509
+始新世 9.62401153296
+舵机 11.8212361103
+一款 7.66235302694
+蛱蝶 11.7034530746
+深泽 12.8020653633
+雷宾斯 13.2075304714
+夤夜 10.6818018271
+五种 8.92394390956
+糠秕 12.2912397395
+地方税务局 10.8561552143
+儿行千里母担忧 13.2075304714
+功能设计 11.9547675029
+带走 7.77818484246
+周公瑾 11.598092559
+物类 12.1089181827
+多核苷酸 13.900677652
+一条藤 13.900677652
+滴答作响 13.2075304714
+画符念咒 12.2912397395
+带起 11.3357282945
+云江鼎 13.2075304714
+版筑 11.7034530746
+华日 13.2075304714
+斯二氏 12.5143832909
+宋平 11.598092559
+庄生 13.900677652
+避免浪费 13.2075304714
+新义州 11.0103058941
+孔武 12.8020653633
+长春 8.00903344015
+日喀则地区 11.0674643079
+祖洞 10.9049453784
+平射 11.8212361103
+浩浩荡荡 9.12999302751
+司业 11.1926274509
+艾哈德 12.8020653633
+奋臂 11.8212361103
+挂挡 11.8212361103
+先挑 12.1089181827
+花儿乐队 13.2075304714
+大吃一惊 8.26588804881
+压缩文件 12.8020653633
+决定论 10.3171587135
+长明 11.9547675029
+行脚僧 11.4157710022
+铁阁露 13.2075304714
+西湖区 11.9547675029
+庄田 9.77354326693
+华旗 11.5027823792
+原西鹤 12.8020653633
+长智 13.900677652
+纳木湖 12.2912397395
+义务工 12.1089181827
+流水席 13.900677652
+平展 10.3171587135
+置换群 12.5143832909
+谐函数 12.2912397395
+克莱武 13.900677652
+热乎乎 9.63799777493
+华新 10.3743171274
+平局 11.598092559
+为民造福 12.1089181827
+俗谚 11.8212361103
+从轻发落 11.598092559
+政学系 12.2912397395
+六万五千 13.900677652
+三门县 13.900677652
+机不可失 10.3453295905
+丁字街 13.900677652
+纵切面 12.2912397395
+平山 10.3453295905
+交互进行 12.8020653633
+华文 11.8212361103
+牙根 10.4666904475
+禁足 13.900677652
+机制纸 11.2616203224
+体量 10.1394775363
+体重 7.50374799676
+济世安邦 13.2075304714
+苦上加苦 13.2075304714
+宋帝 11.8212361103
+大子儿 12.2912397395
+路名 12.5143832909
+屯街塞巷 13.900677652
+平原 6.05957788655
+很难说 8.55357012126
+驻京办 8.38322475551
+糠皮 13.2075304714
+土地婆 11.4157710022
+路吟 9.94943393339
+康西州 13.2075304714
+毁家纾难 11.9547675029
+体鸣 10.9562386728
+热血动物 13.2075304714
+英雄气短 11.9547675029
+路向 10.6818018271
+不确定性 7.02029356979
+藏蓝色 12.2912397395
+投入产出 10.6818018271
+开售 11.4157710022
+开唱 11.9547675029
+世相 12.2912397395
+金融电子 13.2075304714
+渗透剂 13.2075304714
+库页岛 10.2371160058
+贵南 12.8020653633
+忠清南道 12.8020653633
+平叛 10.3743171274
+带花 13.900677652
+各包 13.900677652
+土豆网 12.5143832909
+行政管理学 11.9547675029
+榉树 12.2912397395
+加罗斯 13.2075304714
+团结互助 11.4157710022
+筹略 13.2075304714
+平叔 11.9547675029
+五目 13.900677652
+机械师 11.1926274509
+务工者 13.900677652
+平反 9.33632946051
+戈迪吉 13.900677652
+衣御史 12.5143832909
+相印亭 12.8020653633
+五盒 12.2912397395
+蒙盖 12.5143832909
+刘崇见 12.8020653633
+干旱地区 9.43476953332
+晨光 9.69598503258
+巴塞罗那队 12.8020653633
+乔志强 12.8020653633
+曼陀罗花 12.2912397395
+奚为遥 13.2075304714
+成矿作用 10.4041700905
+有劳 9.93038573842
+明贾政 12.8020653633
+农药味 13.900677652
+动物保健 13.2075304714
+郭待封 13.2075304714
+召之即来 12.5143832909
+深挖 9.96885201925
+深挚 11.2616203224
+今明两年 9.41204128224
+平化 13.2075304714
+宝柱妈 10.4041700905
+宋公 12.2912397395
+一意孤行 10.2117981979
+鲁斋郎 13.900677652
+拮抗剂 11.5027823792
+卫生防疫 11.1926274509
+长幼尊卑 13.2075304714
+宋典 12.5143832909
+双鱼 12.1089181827
+宋元 8.75318317516
+库萨尔 13.2075304714
+宋兄 12.8020653633
+鲁毕克 13.900677652
+狂吠 11.598092559
+小气候 10.2630914922
+庄稼 7.90921310487
+杨家府 11.9547675029
+牙板 12.5143832909
+长椅 10.642581114
+三门峡 9.09665660724
+孔尚任 11.0103058941
+稚女 13.900677652
+五百 7.89432449237
+雕龙记 13.900677652
+一代文宗 13.900677652
+明火 10.7226238216
+明灭 11.0674643079
+阿敏道 13.2075304714
+明灯 10.533381822
+四九年 11.8212361103
+通圆 12.2912397395
+炉排 12.1089181827
+平南 10.5684731418
+严氏 11.3357282945
+膨胀系数 10.5684731418
+裤长 13.2075304714
+正版 10.4041700905
+活动场所 10.0088573539
+克劳福德 12.5143832909
+大不列颠 9.48183704418
+腰金衣紫 13.900677652
+馋鬼 12.8020653633
+疑阵 11.8212361103
+枯水 9.71102290995
+不为瓦全 11.4157710022
+秘书官 13.2075304714
+贺兰山 9.16447920358
+第一千九百三十七年 13.2075304714
+宋儒 11.8212361103
+困倦 9.36807815882
+嵩明 13.2075304714
+繁殖系数 12.8020653633
+平卢 11.1280889297
+大费周章 13.2075304714
+平卧 10.765183436
+丘翔 12.1089181827
+天道好还 12.5143832909
+撩人 11.0674643079
+帕竹 12.1089181827
+苍石 13.2075304714
+容光 12.5143832909
+开吊 13.900677652
+物质化 12.8020653633
+开合 9.94943393339
+狙击战 13.2075304714
+宏观控制 12.8020653633
+斑衣戏彩 13.900677652
+苟全性命 11.598092559
+开向 11.1280889297
+法扬斯 13.2075304714
+奥尼斯 13.900677652
+克莱斯 12.8020653633
+贺龙任 11.9547675029
+不审慎 12.5143832909
+晋归楚 13.2075304714
+何颜 11.9547675029
+发点 11.0103058941
+热塑性 10.4666904475
+四万顷 11.9547675029
+日较差 10.1630080337
+利物浦队 13.900677652
+殆尽 8.60737282725
+不怕死 9.5062284973
+菜薹 12.5143832909
+摸了摸 8.89673134603
+活跃性 11.598092559
+平动 10.4994802703
+笔锋 10.642581114
+杨建华笑笑 12.8020653633
+雷一军 13.2075304714
+如坠五里 11.4157710022
+带菌 11.1926274509
+姜玉贞 12.2912397395
+寒雁 13.900677652
+圆滑 10.2117981979
+同增 12.2912397395
+马重喜 12.8020653633
+天无二日 11.8212361103
+夏天 6.88317150903
+矛盾性 11.1926274509
+张鼐刚 13.2075304714
+圆滚 13.900677652
+华欣 13.2075304714
+物质基础 8.98069672615
+孔新 12.1089181827
+电子信息 8.53938548627
+五短 12.8020653633
+臀尖 11.8212361103
+郑裕彤 11.8212361103
+机械式 9.71102290995
+狙击手 10.533381822
+闷死 10.4349417492
+中南林学院 13.2075304714
+公文纸 13.900677652
+周瑜之 12.2912397395
+常设性 13.2075304714
+化香 12.2912397395
+康复网 13.900677652
+方明 10.1394775363
+夫贵妻荣 13.900677652
+无脑儿 12.8020653633
+圆满 8.9102450652
+夏夜 10.642581114
+下发文件 11.8212361103
+麦克白 11.2616203224
+无心插柳柳成荫 11.598092559
+五眼 12.1089181827
+二堂 11.3357282945
+上门来 9.89334446674
+宋健 12.2912397395
+彩色电视 10.533381822
+门禁卡 12.5143832909
+平列 11.1926274509
+鲁之孙 13.2075304714
+孔数 13.2075304714
+孔敬 12.5143832909
+核桃树 11.0674643079
+作序 10.2897597393
+武垣 13.2075304714
+任绍庆 13.2075304714
+言相慰 13.2075304714
+全盘接受 12.1089181827
+平分 9.72629038208
+带药 12.8020653633
+揣测 9.49395840471
+杰苏阿 13.900677652
+登录名 13.900677652
+马脸汉子 12.5143832909
+克里斯托 11.9547675029
+拿骚 11.3357282945
+孔教 11.9547675029
+焊头 12.2912397395
+夏姆 12.5143832909
+尼克斯队 12.8020653633
+困兽 11.2616203224
+落落 11.8212361103
+肌纤维 10.6818018271
+俗艳 12.2912397395
+伊利诺斯 12.5143832909
+不哼一声 13.900677652
+姓范 12.8020653633
+导爆管 13.900677652
+通惠河 10.1871055853
+迷人 8.65893063692
+没事人 10.765183436
+横吹 11.4157710022
+何须 10.1164880181
+二十位 11.1280889297
+专题论文 12.8020653633
+受血者 13.2075304714
+云长提 12.8020653633
+无性生殖 9.77354326693
+胡诌乱道 13.900677652
+导弹兵 12.8020653633
+贵族政治 11.7034530746
+科学仪器 11.598092559
+师昌绪 13.900677652
+华殿 13.900677652
+西六宫 11.8212361103
+精确度 10.0505300503
+长桥 11.0674643079
+锈铁 12.8020653633
+傍边 10.4666904475
+屈服应力 12.8020653633
+那海眼 12.8020653633
+辐照度 13.2075304714
+家庭式 11.7034530746
+顽皮赖骨 13.900677652
+欢蹦乱跳 11.3357282945
+夏妈 13.900677652
+潘林 13.900677652
+原银 13.2075304714
+追随着 11.0103058941
+横向 8.0985592766
+审慎 8.2985588311
+扯腿 13.2075304714
+制约性 11.7034530746
+长桌 10.9562386728
+互选 12.2912397395
+平剧 13.900677652
+无光泽 10.9049453784
+杭七 13.900677652
+产茶 9.91169360541
+确有此事 11.3357282945
+清锅冷灶 13.900677652
+菜蚜 13.2075304714
+笔阵 13.900677652
+曹司兵 13.2075304714
+声共振 13.900677652
+宋史 9.5062284973
+平冈 12.8020653633
+长期存在 9.59661255877
+菲酌 12.5143832909
+上空 7.78699547214
+尉陈汤 13.2075304714
+圈椅 10.2630914922
+蒋世隆 13.2075304714
+互相理解 12.8020653633
+令人恐怖 11.1926274509
+埃弗顿 13.2075304714
+顶过 13.900677652
+夏婆 9.71102290995
+开在 10.8561552143
+禁飞区 12.1089181827
+深憾 13.900677652
+圆涡 13.2075304714
+开地 12.2912397395
+扫堂腿 12.5143832909
+圆润 9.37888907493
+一条街 9.69598503258
+开场 9.37888907493
+纳木措 13.900677652
+粘乎乎 11.7034530746
+放之四海而皆准 13.2075304714
+慧光 12.1089181827
+安彩高科 13.900677652
+任吉森 12.8020653633
+慧儿 13.900677652
+章德皇后 13.2075304714
+衬砌 11.7034530746
+多明戈 12.5143832909
+开坏 13.900677652
+方言词 12.2912397395
+玄菟 10.9049453784
+平凉 10.2630914922
+何意呀 13.900677652
+华人社区 12.5143832909
+向慈禧 12.8020653633
+川沙县 12.5143832909
+杨家山 12.8020653633
+修沈增 13.900677652
+屋子里 7.58894284282
+平准 10.765183436
+温兹洛 13.2075304714
+保守派 9.75754292558
+长毛 9.32596667347
+挂满 9.61021821083
+马永成 12.1089181827
+特里斯坦 11.8212361103
+开坯 12.8020653633
+夺权 10.1394775363
+里维埃 13.900677652
+加罗林 11.1280889297
+缠缚 13.2075304714
+有车 9.61021821083
+动力源 10.642581114
+单崩儿 12.8020653633
+觉察出 10.533381822
+杨家岭 11.8212361103
+放进来 11.8212361103
+网络电台 13.900677652
+通商 8.37921673411
+深感 8.4980002701
+赵皇 12.5143832909
+明爽 13.2075304714
+跑警报 10.2117981979
+荣泰 13.2075304714
+稚子 11.7034530746
+深意 9.34680076038
+距今 7.8604229407
+葱花 10.2897597393
+碘化物 11.4157710022
+棉麻 11.4157710022
+胡赤儿 13.900677652
+开垦 8.65365357982
+四百六十章 13.2075304714
+杨元元 11.9547675029
+侵略者 8.31342899358
+怜悯之心 11.8212361103
+圆活 12.1089181827
+宋华 12.5143832909
+克莱昂 13.2075304714
+串亲戚 12.8020653633
+岩鹰 13.900677652
+鲁谟斯 11.5027823792
+带职 13.900677652
+春姑娘 13.900677652
+棒头 12.8020653633
+圆浑 12.5143832909
+萨莱 11.5027823792
+静坐示威 11.9547675029
+里瑟 12.8020653633
+磨光机 13.900677652
+开城 10.1164880181
+平光 12.8020653633
+孔昭 12.5143832909
+横在 10.3171587135
+审批 6.63106090237
+长武 13.2075304714
+平允 13.2075304714
+多平方公里 10.0294766411
+七十篇 13.2075304714
+搭配着 12.2912397395
+纳贤豪 13.2075304714
+库楚克 12.8020653633
+开埠 10.4349417492
+明牌 12.8020653633
+一个拖拉机 13.900677652
+闷棍 10.3171587135
+仪仗 8.77671367257
+原音 13.900677652
+波托马克河 11.598092559
+敝帚自珍 13.2075304714
+整党工作 12.8020653633
+孔明 7.81163277653
+侯德榜 11.5027823792
+恒温动物 11.3357282945
+尤氏心 13.2075304714
+疲惫 8.27305653829
+杏花春雨 12.8020653633
+原队 13.900677652
+带至 11.1926274509
+龙髯紫 13.2075304714
+三式 12.1089181827
+急危重症 13.900677652
+未去 11.5027823792
+菜螟 13.2075304714
+有高有低 11.8212361103
+夏季 6.88048694366
+如胶投漆 13.900677652
+大崩盘 12.5143832909
+三百多公里 13.2075304714
+葱茂 12.8020653633
+性爱抚 13.900677652
+空间结构 10.2630914922
+深悉 12.2912397395
+罗罗斯 12.5143832909
+糠疹 12.1089181827
+伪政府 11.7034530746
+葱茏 10.642581114
+庞统谓 13.2075304714
+虎视耽耽 12.8020653633
+明玉 11.9547675029
+明王 11.3357282945
+绳儿 10.9049453784
+平味甘 11.7034530746
+紫檀木 10.2371160058
+通哥 9.94943393339
+原阳 10.4349417492
+马坝人 11.0674643079
+闹意见 12.1089181827
+检讨书 13.900677652
+杉树 10.9049453784
+坚壁清野 10.9562386728
+中央书记处 9.56994431169
+讲排场 12.5143832909
+盗号者 13.900677652
+葡萄汁 10.6818018271
+招财进宝 12.8020653633
+避暑胜地 9.63799777493
+知识者 12.8020653633
+张高儿 13.900677652
+衔铁 12.8020653633
+普通舱 13.900677652
+各厅 13.2075304714
+夙敌 13.900677652
+明珠 8.44535653662
+买回来 9.59661255877
+钱澄之 12.5143832909
+领用 13.2075304714
+慢慢而行 12.8020653633
+痴愚 12.2912397395
+疾风暴雨 11.8212361103
+禁脔 13.2075304714
+困厄 11.4157710022
+任耶鲁 13.2075304714
+义务兵 11.4157710022
+几层楼 13.2075304714
+身心健康 9.87532596124
+回纥军 13.2075304714
+尽力而为 10.8561552143
+司务小 13.900677652
+孔林 11.2616203224
+冬眠期 11.7034530746
+衣仓 13.2075304714
+表面浓度 13.900677652
+斩下来 13.900677652
+东京市 11.598092559
+不足为训 12.8020653633
+巢内取 13.2075304714
+吴升听 11.9547675029
+搓弄 12.1089181827
+黔西南州 11.7034530746
+叩门 11.2616203224
+激将法 11.2616203224
+第四版 11.3357282945
+通告 9.09665660724
+裱褙 12.8020653633
+回纥兵 11.9547675029
+世界 4.36752940557
+普林斯顿 10.0940151622
+拗体 13.2075304714
+缠绵 9.23723855786
+肾上腺素 9.62401153296
+魏鹤龄 12.2912397395
+丙炔 12.8020653633
+高度自治权 13.900677652
+四恩 13.900677652
+葱莲 13.900677652
+寻找出来 13.900677652
+不帅 13.900677652
+云程 13.2075304714
+庄老秦 13.2075304714
+杨成志 12.8020653633
+曼陀罗 11.2616203224
+十四点 11.0103058941
+平远县 12.8020653633
+缠绕 8.89673134603
+工程建设 8.53470163695
+中夏 12.8020653633
+姜母 13.2075304714
+希瓦 11.598092559
+通名 12.1089181827
+复义 13.900677652
+夏宫 11.3357282945
+二三百个 11.9547675029
+鲁诸道 13.2075304714
+评书连播 13.900677652
+冲州撞府 12.2912397395
+无异议 10.5684731418
+通吃 11.1926274509
+倒行 12.5143832909
+原雍 12.8020653633
+五番 12.5143832909
+王庄那 12.1089181827
+三张 9.66657114738
+牡丹 8.59737274392
+上新世 9.14708746087
+通向 8.06879517469
+产褥热 12.8020653633
+巴基斯坦人民党 12.1089181827
+夏宋 13.2075304714
+配置文件 12.5143832909
+丙烯 9.61021821083
+深恶 11.8212361103
+夏宇 11.598092559
+宋刊 12.8020653633
+农林牧 10.4041700905
+开园 10.4994802703
+济南战役 11.8212361103
+梅开江 12.8020653633
+营私舞弊 11.8212361103
+李延龄 13.900677652
+杰出青年 12.1089181827
+路基 9.74179456862
+夏官 10.765183436
+深恩 11.1280889297
+带脉 11.7034530746
+宋刘 12.8020653633
+玄色 11.5027823792
+测绘法 13.900677652
+宋初 9.12999302751
+开国 8.18364995057
+长臂猿 10.0505300503
+运筹帷幄 10.2117981979
+横出 12.2912397395
+加工资 11.8212361103
+各厢 13.900677652
+生死时速 11.4157710022
+加热器 10.8096351986
+和嘉草 11.1926274509
+卤素 9.45802639549
+舒群 12.8020653633
+通变 11.2616203224
+微分电路 13.900677652
+移用 13.2075304714
+咸水 9.80633308975
+中签号 10.8561552143
+诙谐曲 13.900677652
+菜肴 8.65365357982
+境况 9.13850371718
+黄狮孙 13.2075304714
+为人处世 11.0103058941
+长大衣 12.5143832909
+顶角 11.0103058941
+通司 12.5143832909
+一栋 9.35738286971
+小分 12.5143832909
+三十九号 12.8020653633
+通史 9.21854642485
+误人 11.9547675029
+本溪市 11.3357282945
+舒翰 11.2616203224
+眨眼 8.9102450652
+咸池 11.8212361103
+开光 11.0103058941
+原酒 9.54396882529
+咸汤 13.900677652
+平埔 11.9547675029
+弹跳力 12.2912397395
+长淮 12.2912397395
+原配 11.3357282945
+呼之欲出 10.1394775363
+平城 9.62401153296
+小真真 11.7034530746
+红红火火 10.765183436
+皇甫谧 11.5027823792
+科联 11.9547675029
+葱葱 12.8020653633
+邹靖引 12.5143832909
+瓦解星散 13.900677652
+两大部类 11.598092559
+横写 11.598092559
+开入 11.0103058941
+围城打援 13.900677652
+升腾 9.23723855786
+犹如 7.42833135747
+往北部 13.900677652
+马氏文通 11.9547675029
+开关 8.40350942668
+通县 10.1164880181
+拔河比赛 12.5143832909
+开具 9.72629038208
+马格德堡 11.3357282945
+穿刺术 12.8020653633
+绥德县 13.900677652
+夏尔 10.7226238216
+考核内容 12.2912397395
+拉文斯布吕克 13.2075304714
+艺术形象 9.71102290995
+一钱不值 10.642581114
+秋毫勿犯 13.2075304714
+大体相当 11.0103058941
+深望 11.5027823792
+葱蒜 11.0674643079
+毛混纺 12.8020653633
+体骨 13.900677652
+言谈举止 10.9049453784
+穗花杉 11.0674643079
+光谱仪 10.2897597393
+深有 10.3743171274
+老黑山 12.5143832909
+候官治 13.2075304714
+参数传递 11.1926274509
+华滋 12.8020653633
+楼阁台榭 13.900677652
+难找 10.4666904475
+捣米 12.2912397395
+舒缓 9.53122979951
+帕罗 13.2075304714
+平地 8.37124856446
+通卡 12.5143832909
+明理 10.765183436
+鳞翅目 9.61021821083
+过时不候 13.2075304714
+哪份 13.900677652
+柞蚕丝 10.5684731418
+整封信 13.900677652
+体验 7.43297892587
+诲人不倦 11.9547675029
+多尔多涅 11.8212361103
+戈尔韦 13.900677652
+犹太 8.99540287354
+平坝 10.2371160058
+长海 11.2616203224
+平坐 12.2912397395
+发酵罐 12.5143832909
+还讨 13.900677652
+犹大 10.9049453784
+八百米 13.2075304714
+原野 8.69119149913
+无宁 12.1089181827
+一株株 11.598092559
+克莱恩 11.4157710022
+孔急 13.900677652
+平均 5.16146153691
+集束炸弹 11.8212361103
+蕨类植物 10.0294766411
+体高 10.765183436
+升至 7.2872934336
+五牛 11.598092559
+通匪 11.9547675029
+钓个 13.2075304714
+吐根碱 12.5143832909
+沾益县 11.7034530746
+六十九岁 12.5143832909
+羟色胺 10.8561552143
+夏岚 9.59661255877
+能量守恒 10.604840786
+开出 7.9817837977
+五片 12.2912397395
+平坡 12.2912397395
+开凿 8.09554268306
+长流 10.8561552143
+尊荣 10.6818018271
+桃花开 13.2075304714
+长治 9.63799777493
+深暗 12.1089181827
+荣正 13.900677652
+长河 9.7898037878
+世珍 11.4157710022
+卤簿 9.94943393339
+郭全宝 13.900677652
+刀笔 11.5027823792
+估测 11.1280889297
+定向培育 12.8020653633
+缓办 12.8020653633
+玛丽亚 9.94943393339
+长沟 13.900677652
+长沙 7.31865251308
+通勤 12.1089181827
+彭头山 12.5143832909
+搜索词 13.900677652
+判决 7.75864024639
+路儿 11.8212361103
+欺生 11.3357282945
+网景 12.8020653633
+赖焉 13.2075304714
+维辛斯 13.900677652
+步甲 12.5143832909
+南溪河 12.2912397395
+机械学 11.5027823792
+平四 13.900677652
+匹夫 9.84023464143
+长泰 13.2075304714
+无定 9.59661255877
+舞拳 13.900677652
+五班 13.900677652
+浴佛节 12.5143832909
+通力 11.598092559
+泼皮 9.77354326693
+罗林斯 13.2075304714
+升职 10.8561552143
+咸海 10.1394775363
+枢机 11.4157710022
+希特 11.7034530746
+柳叶可 13.2075304714
+一根 6.41855872842
+齐观山 13.2075304714
+质膜 10.765183436
+日需求量 12.8020653633
+嗜血成性 12.8020653633
+七十米 13.2075304714
+长法 12.5143832909
+再生能源 8.47133202302
+位阁臣 10.3171587135
+弯管 12.5143832909
+一万六千 11.8212361103
+影迹 12.8020653633
+谢诚 12.1089181827
+玉米粒 11.9547675029
+焊工 11.9547675029
+不是味儿 12.5143832909
+遥相应和 13.900677652
+秦占有 12.5143832909
+尼尔吉 13.900677652
+郧县人 12.5143832909
+缺油 12.1089181827
+由荷语 13.2075304714
+风球 13.2075304714
+梁朝伟 11.9547675029
+禁止性 11.0674643079
+赵阔明 13.900677652
+角色定位 12.2912397395
+山万岭 12.5143832909
+路军 9.89334446674
+高级人才 13.2075304714
+审改 13.900677652
+置酒 9.41204128224
+现身说法 10.642581114
+深明 10.3743171274
+壁厢 10.3743171274
+姜维领 12.2912397395
+飘飘摇摇 11.8212361103
+最远到 12.1089181827
+祖本 13.900677652
+湖心亭 10.8561552143
+刀箭 11.2616203224
+冷性 11.4157710022
+夏州 10.4041700905
+懋勤殿 12.5143832909
+熊样儿 13.2075304714
+路况 9.54396882529
+蛏田 13.900677652
+老蒋 9.89334446674
+剪草除根 12.2912397395
+劳工阶层 13.2075304714
+斯之战 12.5143832909
+稚小 13.900677652
+通分 13.900677652
+咸淡 11.5027823792
+右手边 11.7034530746
+聋盲 13.900677652
+蒋仁 13.2075304714
+通则 10.2630914922
+赵用贤 9.36807815882
+芒种 11.1280889297
+咸淳 10.604840786
+嘴软 12.2912397395
+天女下凡 13.2075304714
+吐得 11.4157710022
+长江 6.23211654396
+年后 6.45234379108
+海景房 10.3743171274
+李国桢 13.2075304714
+宗贞元 13.900677652
+通判 9.49395840471
+配电柜 12.8020653633
+宋吏 13.2075304714
+明畅 11.9547675029
+闲工夫 11.1280889297
+祖杲 13.2075304714
+紫荆花 12.8020653633
+通儒院 12.8020653633
+王毓 11.7034530746
+孙俊人 12.8020653633
+永丰舰 13.2075304714
+通到 10.1394775363
+奥托一世 11.7034530746
+长汀 10.4994802703
+宋埠 13.900677652
+五点 9.72629038208
+华池 12.2912397395
+活跃期 11.1926274509
+叶青 11.4157710022
+冀四州 12.2912397395
+许巨源 11.9547675029
+硫氮 12.1089181827
+上界岭 12.8020653633
+大边 13.900677652
+孔明答 12.2912397395
+开化 9.98865464655
+缓口气 11.9547675029
+轰出来 12.5143832909
+序列改变 13.900677652
+伐木 9.85762638414
+温差电堆 12.5143832909
+夏干 13.2075304714
+中国科学院北京天文台 13.2075304714
+夙怨 12.5143832909
+菜花 10.4666904475
+深施 13.900677652
+宋城 11.8212361103
+明皇 12.1089181827
+崇祯帝 9.85762638414
+延迟时间 12.1089181827
+华江 12.5143832909
+艰难曲折 11.0674643079
+丙申 12.8020653633
+骆驼肉 13.900677652
+菜苗 13.2075304714
+横县 11.7034530746
+扯蛋 11.4157710022
+明目 10.2117981979
+苏比拉 12.5143832909
+黑衣人 10.1871055853
+列到 13.900677652
+图灵奖 12.8020653633
+播种量 11.9547675029
+林檎 12.8020653633
+钟明亮 11.598092559
+主从关系 11.598092559
+荣格 11.4157710022
+碳氢化物 13.900677652
+贬黜 11.1280889297
+加州理工学院 11.4157710022
+吴定富 9.85762638414
+路剑 13.900677652
+协济 11.9547675029
+自然环境 8.20694551317
+文化整合 13.2075304714
+垦荒者 12.8020653633
+华氏 10.765183436
+察哈尔 9.63799777493
+侯耀华 10.2371160058
+夏布 10.0720362555
+沃邦 12.2912397395
+自作聪明 10.6818018271
+分布电容 13.900677652
+刘崇远 13.2075304714
+开卷 11.7034530746
+微观量 12.1089181827
+辖区 8.16733637508
+咸湖 12.8020653633
+半中腰 13.900677652
+笙歌 10.4349417492
+误会 8.64840422393
+开厂 13.2075304714
+区别性 13.900677652
+盐价 10.7226238216
+下探 8.31342899358
+太岁头上动土 11.2616203224
+祖国大陆 11.0674643079
+形势严峻 10.4994802703
+撒手归西 13.2075304714
+冰渊 10.5684731418
+华泰 7.68807155622
+铩羽 12.5143832909
+横卧 10.2117981979
+开原 10.642581114
+鲁中南 10.765183436
+孪生 10.8096351986
+地幔 9.22784881751
+消费率 9.75754292558
+劝业场 13.2075304714
+五星上将 11.1280889297
+牙慧 12.5143832909
+路加 12.5143832909
+犹存 9.32596667347
+增长速度 7.57631868959
+掌权者 11.7034530746
+通典 9.98865464655
+雄海马 12.8020653633
+黄氏家族 13.900677652
+农校 13.2075304714
+开去 8.74162235276
+罗坚 12.1089181827
+通关 10.0088573539
+十八罗汉 11.4157710022
+晋安区 13.2075304714
+憧憬未来 11.9547675029
+杨和古 12.2912397395
+舒柔靡 13.900677652
+塔孟良 13.2075304714
+虽已 9.10488710638
+王比 13.2075304714
+孔戴 13.2075304714
+孤军作战 11.5027823792
+鼾息声 13.900677652
+直撅撅 12.5143832909
+韩揖话 13.2075304714
+梁建方 13.2075304714
+帕累 11.9547675029
+开发 5.52689304385
+同父异母 10.4349417492
+孙老九 10.642581114
+高枕勿忧 13.900677652
+领军者 11.1280889297
+没使 12.1089181827
+镯子 9.75754292558
+五言诗 10.4994802703
+开口 6.77298395263
+遇不到 11.8212361103
+菜色 11.1280889297
+甩出来 12.2912397395
+盐井 10.604840786
+夏庄 12.8020653633
+扶下 12.2912397395
+园田化 13.900677652
+华沙 9.00283785202
+关关雎 13.900677652
+袒胸露腹 13.2075304714
+和弦音 12.8020653633
+嬉耍 13.2075304714
+稚弱 12.1089181827
+门灯 13.900677652
+于慈禧 13.900677652
+沃野 10.533381822
+华浦 13.2075304714
+没亮 10.6818018271
+大地构造 9.87532596124
+阿炳抱 13.900677652
+开列 10.533381822
+平和 8.51160592216
+路北 9.89334446674
+开创 7.43920947562
+沃金 12.5143832909
+没人 6.94127913984
+宋国 10.1394775363
+法律委员会 11.7034530746
+姓薛 12.5143832909
+流落他乡 12.8020653633
+殷士儋 12.5143832909
+倾销税 13.2075304714
+得要 10.0088573539
+没事 7.71859274526
+生花妙笔 12.8020653633
+佩罗夫 12.5143832909
+下下策 12.5143832909
+二句话 13.2075304714
+开到 8.39534611604
+夙愿 10.7226238216
+虽小 9.63799777493
+乳汁状 13.900677652
+袒胸露背 13.2075304714
+哈尼族 10.765183436
+圆棒 12.8020653633
+咬牙切齿 8.59240995457
+搜集整理 10.765183436
+先主 9.96885201925
+汪荣宝 13.900677652
+菜菜 13.2075304714
+还乡河 12.5143832909
+公告日 10.765183436
+明知 8.25523075433
+小尾巴 12.1089181827
+多一点 9.13850371718
+桓台县 12.2912397395
+姜维驱 13.2075304714
+路卜 12.8020653633
+明矾 10.1871055853
+长滨 11.7034530746
+路南 9.53122979951
+通钦察 13.2075304714
+带薪 12.2912397395
+明石 13.2075304714
+和平部队 11.598092559
+长满 8.93783302172
+波卡拉 13.2075304714
+讨个吉利 12.1089181827
+华洋 11.9547675029
+新河口 12.5143832909
+爬不起来 10.4349417492
+各种各样 7.84623830571
+葡萄树 10.533381822
+挂毯 10.642581114
+节奏明朗 13.900677652
+红变紫 13.900677652
+农药厂 12.1089181827
+九十五卷 12.8020653633
+谷克多 13.900677652
+阿依古丽 12.1089181827
+喷发物 11.7034530746
+没付 13.900677652
+濯锦 12.8020653633
+上海大众汽车有限公司 13.2075304714
+人事科 13.900677652
+平哥 12.2912397395
+希尔伯特 9.96885201925
+何鸿 11.0674643079
+易合易 13.2075304714
+披星戴月 11.8212361103
+希伯来 11.0674643079
+通假 12.5143832909
+没中 12.5143832909
+八十五号 13.2075304714
+明眸 11.5027823792
+饱学之士 11.1926274509
+明眼 12.5143832909
+贩夫走卒 11.5027823792
+新鞋 10.642581114
+尊者 10.3453295905
+姓蔡 12.2912397395
+那仙 12.8020653633
+开办 8.06879517469
+尊老 12.5143832909
+长渠 13.900677652
+上千年 10.2897597393
+失街亭 12.8020653633
+贾客乐 13.2075304714
+糖醋鱼 12.5143832909
+裱贴 13.2075304714
+楼梯间 11.1280889297
+没下 11.0103058941
+没上 10.1394775363
+柳叶儿 12.8020653633
+直接证明 13.2075304714
+力大无穷 11.1280889297
+张鼐哥 11.8212361103
+稚年 12.8020653633
+乌布苏 12.8020653633
+长清 11.3357282945
+朱家村 13.2075304714
+各行其道 11.0674643079
+法商学院 12.5143832909
+两世为人 12.8020653633
+耳刮子 10.8561552143
+炕去 11.3357282945
+没书 13.2075304714
+横到 12.1089181827
+华润 8.97342396682
+静脉针 12.8020653633
+个案研究 13.2075304714
+今明两天 11.2616203224
+玄虚 10.3743171274
+仰首吟 13.900677652
+阴谋败露 11.5027823792
+楞住 12.5143832909
+尼克坦 12.8020653633
+孤臣孽子 12.8020653633
+孙乾领 12.8020653633
+痛风病 12.8020653633
+圆桌 9.61021821083
+王莽秉 13.2075304714
+葛布 11.1926274509
+萧仲恭 11.8212361103
+圆桶 12.2912397395
+风疹 11.0103058941
+长湖 10.8561552143
+宋嘉 12.2912397395
+横列 11.0103058941
+路口 7.98447558937
+一来二往 12.5143832909
+夏征 13.2075304714
+长恨歌 10.8561552143
+拉过来 10.3453295905
+橡皮树 13.900677652
+拟用 11.8212361103
+困在 9.71102290995
+横切 10.4041700905
+横刀 10.3453295905
+数只 9.89334446674
+物理 6.75548151698
+蒋中正 12.5143832909
+屈服点 13.900677652
+顶门 10.2630914922
+赚下来 13.900677652
+壁上 8.38724890581
+方国珍 11.0103058941
+厉鹗 12.5143832909
+劳动保障部 11.0103058941
+荣登 10.2630914922
+华特 10.604840786
+安大略 11.598092559
+中南欧 12.2912397395
+原肠胚 11.8212361103
+虚应 12.8020653633
+长枪队 13.900677652
+通俗 8.71889410168
+衬托 9.32596667347
+于五军 13.2075304714
+罗圈腿 13.2075304714
+粟谷 13.900677652
+涡轮引擎 13.900677652
+虚度 10.8096351986
+云封雾 12.5143832909
+通信 6.64156152388
+建筑网 11.598092559
+种猪场 12.8020653633
+笔谈 11.2616203224
+原质 13.900677652
+没写 11.3357282945
+十万分之一 11.1280889297
+弯曲 7.63918596765
+移植 8.46695564842
+需求者 10.8561552143
+王为民 12.8020653633
+三屯 13.900677652
+通例 10.3171587135
+红双子 10.4041700905
+央求 9.4233408375
+卢克纳 9.34680076038
+纳维尔 13.2075304714
+王孟获 11.598092559
+植物学家 9.72629038208
+忠武王 12.8020653633
+没出 9.55687223012
+文学馆 12.5143832909
+于五凤 13.900677652
+耳疾 13.900677652
+体虚 10.7226238216
+圆石 11.4157710022
+没准 10.0088573539
+吃小灶 12.8020653633
+美智 13.900677652
+工业产品 9.24671730182
+家燕 11.3357282945
+通便 9.93038573842
+破产者 11.3357282945
+易容改 13.2075304714
+韩文玉 12.5143832909
+双子星 12.2912397395
+放风筝 10.5684731418
+加工量 10.9049453784
+男欢女爱 10.6818018271
+拿获 11.3357282945
+浪迹江湖 11.598092559
+全国台联 13.900677652
+献媚 10.2371160058
+别样红 13.2075304714
+九十九卷 13.2075304714
+定常约束 13.900677652
+无学 11.598092559
+禁得起 11.2616203224
+萝卜缨 12.5143832909
+通体 9.31571017331
+看起来 7.17564400981
+耶律图 13.2075304714
+明四夷 12.2912397395
+名店 11.7034530746
+荣盛 10.533381822
+金水桥 9.91169360541
+圈环 13.900677652
+童话般 11.2616203224
+电磁力 10.533381822
+子弹 7.61841090508
+没入 9.72629038208
+脚心朝天 13.900677652
+累西腓 12.2912397395
+符号逻辑 12.2912397395
+贬职 12.8020653633
+物欲 11.598092559
+罪恶之地 13.900677652
+没关 11.598092559
+东国洛 13.2075304714
+牙缝 10.765183436
+稳如泰山 11.0674643079
+警示牌 11.1926274509
+梅恩 12.2912397395
+建筑群 8.76487921493
+三撇 13.2075304714
+戈尔诺 12.5143832909
+老封君 12.5143832909
+弄回 11.1280889297
+调回来 12.1089181827
+拉雪巴 9.28555713513
+万台 8.85082164473
+五湖 10.765183436
+晓寒 13.900677652
+明桂 13.2075304714
+并过 13.2075304714
+发令枪 11.598092559
+吴升便 11.5027823792
+原路 9.58318953844
+农业用地 10.6818018271
+五一广场 13.2075304714
+缠斗 11.0674643079
+拔掉 9.69598503258
+述论 12.8020653633
+家庭聚会 12.8020653633
+射伤 10.7226238216
+搜索队 13.900677652
+嘶鸣 10.0940151622
+曲子 8.65893063692
+机载设备 9.89334446674
+纪子 12.8020653633
+招贴画 11.5027823792
+美誉度 10.4666904475
+别生气 10.2371160058
+移栽 10.5684731418
+制音器 12.8020653633
+独桅 13.900677652
+核科学家 12.8020653633
+高利贷 8.74738605748
+亚伯特 13.2075304714
+原谅 8.00627481771
+王杨雄 13.2075304714
+全系列 10.7226238216
+十二峰 11.5027823792
+亟需 10.533381822
+横隔膜 12.8020653633
+于震旦 12.5143832909
+相互支持 11.1280889297
+说正经 11.8212361103
+通令 10.4349417492
+平林兵 12.8020653633
+枫杨 11.598092559
+汉章帝 10.9562386728
+曲学 13.2075304714
+赖纳 12.2912397395
+帕拉 10.4994802703
+叶挺部 13.2075304714
+数据交换 11.598092559
+候选人 8.24119543622
+何能 9.91169360541
+圈牛 13.900677652
+圆盒 12.2912397395
+樊哙 11.7034530746
+圆盖 12.5143832909
+通事 10.765183436
+圆盘 9.18217878068
+通了 9.84023464143
+虚心 9.82314020807
+王修植 12.8020653633
+苦中作乐 11.4157710022
+拿糖作醋 13.900677652
+老营 6.99894044532
+七辆 12.2912397395
+杜义 13.2075304714
+岱岳 12.2912397395
+略取 12.2912397395
+万马齐喑 12.2912397395
+采药人 12.8020653633
+顶针 12.1089181827
+澳洲 7.75434839431
+通产 11.598092559
+没像 11.4157710022
+十二岁 9.71102290995
+声浪 9.96885201925
+玄德匹 12.8020653633
+欺上瞒下 12.8020653633
+牙线 12.2912397395
+涵养林 11.3357282945
+乳臭未干 12.1089181827
+普遍规律 10.2630914922
+舒拉 12.8020653633
+原象 12.8020653633
+救亡图存 11.5027823792
+通义 10.533381822
+滚起来 13.900677652
+林学院 11.1280889297
+氟康唑 11.9547675029
+虚开 12.1089181827
+蛮勇 13.2075304714
+维那斯 13.900677652
+原貌 10.0940151622
+献宝 12.1089181827
+拿手好戏 10.533381822
+阅读者 12.2912397395
+外科学 11.2616203224
+日日夜夜 10.0294766411
+优生学 10.6818018271
+利二世 13.2075304714
+速效性 12.1089181827
+十二届 9.87532596124
+阎孝忠 13.900677652
+忧虑 7.39788760606
+几百门 13.2075304714
+绳之以法 10.2897597393
+宽限期 11.9547675029
+通书 11.8212361103
+永续 10.1630080337
+虚张 11.7034530746
+瘤胃 11.5027823792
+十二局 12.8020653633
+盖碗香 12.8020653633
+离异之心 13.900677652
+周公才 12.8020653633
+咸熙 11.3357282945
+刀架 10.8096351986
+肠粘连 13.2075304714
+挂甲 11.7034530746
+何者 10.604840786
+八届全国人大 11.5027823792
+自吹自擂 11.5027823792
+虚弱 8.20358416547
+没借 13.900677652
+挂画 12.8020653633
+固执成见 12.8020653633
+滞差 12.5143832909
+刀柄 10.8096351986
+一千三百零八公里 13.2075304714
+炉窑 12.8020653633
+模拟机 12.8020653633
+人事不醒 12.8020653633
+左司谏 12.5143832909
+蛮力 10.9049453784
+枫林 11.8212361103
+李国瑞 9.5186510173
+习水战 11.7034530746
+药王山 11.598092559
+河海大学 12.5143832909
+华玉 13.900677652
+二三百名 12.8020653633
+深究 9.98865464655
+斯诺普斯 13.900677652
+失去光泽 11.1280889297
+深空 12.5143832909
+旭日东升 11.8212361103
+人事权 12.8020653633
+钢铁贸易 13.2075304714
+纳瓦霍 11.1280889297
+往北走 10.6818018271
+不退反进 13.900677652
+余钱 11.0674643079
+法制观念 11.7034530746
+汇流处 10.4041700905
+欧阳东凤 12.8020653633
+科举考试 9.89334446674
+扩大器 11.9547675029
+纳斯卡 12.2912397395
+路下 11.9547675029
+路上 6.28340983835
+华灯 11.1926274509
+下水 8.0600359946
+希洪 12.8020653633
+五河 11.598092559
+路丁 12.8020653633
+王子江 13.900677652
+路东 10.2371160058
+开会 7.57811241205
+大学物理 12.1089181827
+没去 8.77077893705
+开伙 12.8020653633
+二八佳人 11.7034530746
+明四家 12.5143832909
+奥斯特瓦尔德 11.1280889297
+紫药水 12.5143832909
+费利佩 12.5143832909
+地网天罗 12.8020653633
+引申义 13.2075304714
+朽木 10.2630914922
+脸难看 13.900677652
+离得开 11.8212361103
+佐证 9.12155415886
+黑板报 13.2075304714
+希洛 11.1926274509
+那时快 10.5684731418
+停车换乘 13.900677652
+不断加强 9.15574552361
+懊悔 9.40086798165
+承华首 13.900677652
+黔东南苗族侗族自治州 11.2616203224
+霍城至 13.2075304714
+开低 10.3453295905
+费马数 12.5143832909
+谢鸪翟 13.2075304714
+长班 10.8096351986
+仪器 7.46613113319
+移步 10.8096351986
+深秋 9.21854642485
+仔细观赏 12.8020653633
+挂盘 12.5143832909
+引申为 10.642581114
+开作 13.2075304714
+原载 11.9547675029
+斯科河 13.900677652
+十二律 11.2616203224
+大福晋 11.8212361103
+贯连 11.7034530746
+虎牢关 11.0674643079
+连通器 13.2075304714
+易容术 13.2075304714
+成骨细胞 13.2075304714
+盐分 9.58318953844
+妖雾 11.9547675029
+没受 11.0103058941
+奥地利 7.391908515
+白银时代 12.8020653633
+没变 9.7898037878
+欢迎宴会 12.8020653633
+卿言 11.1280889297
+春假 13.900677652
+顶面 10.9049453784
+棉蚜 12.1089181827
+费厄泼赖 12.8020653633
+菜鸟 12.2912397395
+请问您 11.8212361103
+升龙 11.2616203224
+胡华之 13.2075304714
+电子信箱 11.1926274509
+菲律宾语 13.900677652
+戴逍遥 13.2075304714
+耶尔德 13.2075304714
+小便器 12.8020653633
+禁食 10.1394775363
+禁飞 13.900677652
+懊恼 9.25628675283
+立陶宛人 11.7034530746
+大展经纶 12.8020653633
+除静电 13.2075304714
+王长史 13.900677652
+越传越 10.9562386728
+懊恨 11.3357282945
+路人 9.84023464143
+甘布尔 11.8212361103
+乱弹琴 10.7226238216
+二三百块 13.2075304714
+同龄林 13.900677652
+托利多 13.2075304714
+不无遗憾 11.1280889297
+闷烧 12.5143832909
+冈村 11.1926274509
+金霞 13.2075304714
+宗子维 13.2075304714
+洒得 13.2075304714
+闷热 9.34680076038
+倚玉偎香 13.900677652
+傈僳族 10.8096351986
+十二张 12.5143832909
+贴心朋友 13.900677652
+世民 10.2371160058
+窝棚 9.11318590919
+盐务 10.0720362555
+研究部署 9.72629038208
+动滑轮 12.1089181827
+拆断 12.2912397395
+杜巴 13.900677652
+沙粒疾 13.900677652
+横传 13.2075304714
+何荣 13.2075304714
+暂停营业 13.900677652
+香港廉政公署 13.900677652
+锈迹 11.8212361103
+无数颗 12.5143832909
+望贤妹 12.5143832909
+没升 13.900677652
+拟核 12.5143832909
+愈来愈少 12.8020653633
+勿动 12.2912397395
+束毛藻 11.7034530746
+下岗工人 10.9049453784
+兴平县 12.1089181827
+警示灯 13.900677652
+推动者 11.0674643079
+存量房 11.0674643079
+昏暗暗 13.900677652
+诸水注 13.2075304714
+咸猪 12.8020653633
+玉生香 12.5143832909
+开一 11.7034530746
+郭祥见 10.7226238216
+玷污 10.1630080337
+淡水镇 11.9547675029
+乳胶漆 13.2075304714
+开下 11.9547675029
+独树 11.598092559
+地热资源 10.2897597393
+舒悦 12.5143832909
+没劲 10.604840786
+整形术 13.2075304714
+菜籽 10.7226238216
+淋浴室 12.8020653633
+敌后方 12.2912397395
+摘花 11.5027823792
+彖辞 12.5143832909
+王殿 12.2912397395
+肘部 11.1926274509
+各自为政 10.1871055853
+主合同 12.8020653633
+滑开 12.2912397395
+开个 8.9308643524
+希氏 12.5143832909
+杜立 13.900677652
+长得俊 12.2912397395
+文化快餐 13.900677652
+晚餐饭 13.900677652
+克罗诺 13.900677652
+别有良 12.8020653633
+郎么 13.900677652
+天虹 12.1089181827
+参数设置 13.2075304714
+没办 11.1926274509
+牙粉 12.2912397395
+张尚礼 13.900677652
+岱庙 11.598092559
+辖下 10.9562386728
+活蹦活跳 13.900677652
+大理白族自治州 10.604840786
+何若 13.900677652
+手枪弹 10.765183436
+张英俊 13.900677652
+乳清粉 13.2075304714
+桂香阁 13.2075304714
+寡言 11.8212361103
+印花厂 12.5143832909
+横亘 9.82314020807
+一个鼻孔 11.9547675029
+吴应熊 13.900677652
+横井 12.8020653633
+何苗 12.1089181827
+神户港 11.598092559
+催人奋进 12.5143832909
+师范教育 11.3357282945
+展会 9.74179456862
+标准规范 12.1089181827
+刀数 12.5143832909
+临涧 12.5143832909
+停留长智 12.8020653633
+横事 12.5143832909
+庄稼活儿 13.900677652
+复兴者 12.2912397395
+五派 13.2075304714
+下逐客令 11.7034530746
+抱怨地 11.598092559
+一言难尽 10.2371160058
+朱昌祚 13.900677652
+建筑系 10.765183436
+奶酪 10.0294766411
+假结婚 13.2075304714
+五洲 9.06439574502
+白报纸 13.900677652
+没到 8.80692745117
+圆球 10.0720362555
+翅鞘 13.900677652
+油印 10.9562386728
+十二年 7.78038023302
+没刺 13.900677652
+毛义 12.8020653633
+孔罡 13.2075304714
+张寨主 12.8020653633
+圈点 11.2616203224
+开交 11.3357282945
+没分 12.5143832909
+吉硅 12.8020653633
+揣着 9.75754292558
+升麻 11.8212361103
+平方里 13.900677652
+奶酒 13.900677652
+妙笔生花 13.900677652
+周永康 11.0674643079
+五洋 13.2075304714
+助威 10.3453295905
+病魔 10.533381822
+紧握着 9.85762638414
+阿姆河 9.72629038208
+歌手名 13.900677652
+希波 10.4349417492
+笔迹 9.58318953844
+迹象 6.4174332359
+杭城 10.0088573539
+顺乎民意 13.2075304714
+舞刀跃马 13.2075304714
+揽入 11.4157710022
+红腾腾 13.2075304714
+神枪手 10.4041700905
+顾头不顾尾 13.900677652
+尾端 9.98865464655
+于官田 13.2075304714
+波希霞 13.900677652
+克莱罗 12.1089181827
+长牙 11.598092559
+奥狄浦 11.5027823792
+门缝 8.98802276624
+叶斗峰 12.5143832909
+安土重迁 13.2075304714
+开价 10.5684731418
+横上 13.900677652
+权力观 13.900677652
+天尊玄 13.2075304714
+长征四号 13.900677652
+排污费 9.75754292558
+盐味 12.2912397395
+跳跃式 10.604840786
+咧嘴 10.0720362555
+各自为战 10.533381822
+通宜兰 12.1089181827
+高速传输 13.900677652
+元嘉 10.642581114
+肯回来 13.2075304714
+明治 9.65218240993
+献帝 9.59661255877
+西凤酒 11.8212361103
+跨部门 10.8561552143
+牛背上 11.5027823792
+肉畜 13.900677652
+喇叭声 10.765183436
+逢山开路 11.4157710022
+祖约 11.5027823792
+电针疗法 12.5143832909
+浑铁 11.1926274509
+虎门港 13.900677652
+皈依 8.64318227995
+前空翻 12.8020653633
+满水银 13.2075304714
+明沙 12.5143832909
+费扬古 11.598092559
+坐飞机 10.2371160058
+七十支 13.2075304714
+鄞州区 10.9049453784
+明沟 12.8020653633
+挂点 11.5027823792
+圆环 9.98865464655
+师范大学 9.74179456862
+刘向接 13.2075304714
+玛丽埃 13.2075304714
+刘文彩 13.2075304714
+体色 9.26594866375
+蔬菜汁 12.2912397395
+难度很大 10.2897597393
+政工处 12.5143832909
+哲理 8.98069672615
+一举千里 13.900677652
+体良 12.2912397395
+弯折 11.9547675029
+环己酮 11.7034530746
+荣爱 13.900677652
+助工 13.2075304714
+烟熏火燎 10.8096351986
+明泉 13.2075304714
+汀泗桥 11.1280889297
+金水河 10.2371160058
+衬映 11.2616203224
+丹尼斯 9.31571017331
+深翻 12.1089181827
+热刺队 12.5143832909
+哪去 10.6818018271
+蔬菜汤 13.2075304714
+圆珠 12.5143832909
+馅儿 11.0674643079
+产业资本 8.43684584695
+姓黎 13.900677652
+纸板箱 13.900677652
+蛮地 13.900677652
+揭碑 13.900677652
+平信 12.2912397395
+翻山 11.0674643079
+刑部公 12.5143832909
+姓黄 10.8561552143
+庄明 10.4994802703
+扩大化 9.96885201925
+阉牛 13.2075304714
+那无君 13.900677652
+华目 13.900677652
+长甸 12.2912397395
+卜辞 9.82314020807
+诸臣表 13.2075304714
+溴酚蓝 13.900677652
+没唱 11.1280889297
+杨家庄 9.96885201925
+平伏 11.5027823792
+司马邺讳 12.2912397395
+沿岸地区 10.2897597393
+义务人 10.3743171274
+戈尔达 13.2075304714
+摆放在 10.8096351986
+明水 11.5027823792
+长生 8.75901409547
+帕杜 12.8020653633
+盘丫吉 10.7226238216
+勇于开拓 12.5143832909
+保障型 10.9049453784
+裤褂 11.5027823792
+蚀本 11.4157710022
+环己醇 12.5143832909
+禀告 8.62256299275
+华盛 10.6818018271
+平伯 13.900677652
+跌下去 10.4666904475
+牙签 11.4157710022
+舒服 7.53077666915
+职官表 12.8020653633
+水头镇 13.2075304714
+龚孝升 11.5027823792
+华盖 10.0720362555
+工科大学 11.598092559
+创钜痛深 13.900677652
+白鹿洞 11.1926274509
+长畸 12.5143832909
+佐贺 13.2075304714
+十二大 10.642581114
+舒松 12.8020653633
+桃源 10.1164880181
+戈尔迪 12.8020653633
+姜维至 13.2075304714
+构件 8.75901409547
+拔枪 10.8096351986
+穿街过巷 12.5143832909
+枢纽 7.56031834825
+高可靠性 11.1280889297
+弯成 10.9049453784
+卤族 12.5143832909
+波束波导 12.8020653633
+长留 11.7034530746
+上下左右 10.3453295905
+十二处 12.1089181827
+挂灯 12.5143832909
+火冒三尺 13.900677652
+向玉帝 12.8020653633
+曲度 12.1089181827
+中国教育学会 11.9547675029
+证交所 9.59661255877
+温迪亚 12.8020653633
+七十日 13.2075304714
+止痛针 13.900677652
+潘佩珠 12.5143832909
+仵作人 13.900677652
+挚友 9.91169360541
+顶部 7.65651075131
+东直门 10.604840786
+非公经济 12.5143832909
+一次能源 9.72629038208
+菜馆 11.3357282945
+撩动 12.8020653633
+虚实 8.44535653662
+古漪园 12.8020653633
+毛上 12.2912397395
+照明电 13.2075304714
+月偏食 13.2075304714
+平了 10.604840786
+褴褛 10.765183436
+冉勺 13.2075304714
+移民 7.47905538417
+科迪 12.2912397395
+裤袋 11.9547675029
+圆状 11.4157710022
+包曼 13.2075304714
+拇趾 12.1089181827
+检验单 13.900677652
+葡萄牙 7.83922073305
+公用电话亭 11.598092559
+基本要素 10.4041700905
+裤袜 13.900677652
+深红 10.4041700905
+盐商 9.5062284973
+手枪套 13.900677652
+咸甜 13.2075304714
+假眼 13.2075304714
+晓市 12.8020653633
+孔秀 12.8020653633
+金牌得主 13.900677652
+对苯醌 12.5143832909
+仪典 11.7034530746
+全国政协外事委员会 13.900677652
+平仓 9.02548032877
+深根固蒂 13.900677652
+出有入无 13.2075304714
+花江 11.9547675029
+连锁商店 12.8020653633
+公关能力 12.5143832909
+划子 12.1089181827
+曲式 10.765183436
+炸成 10.642581114
+虚寒 9.7898037878
+平仄 10.6818018271
+柏郎 12.8020653633
+电磁场 8.9102450652
+配电网 11.9547675029
+厉鬼 9.71102290995
+裤裆 9.84023464143
+平仲 13.2075304714
+拱顶 11.2616203224
+平价 9.22784881751
+深绿 10.6818018271
+柴三郎 12.8020653633
+蓝慧珠 10.2630914922
+曲张 11.8212361103
+保证数据 12.8020653633
+狂风暴雪 13.2075304714
+五款 11.9547675029
+高顺引 12.8020653633
+忧色 11.7034530746
+平东 11.7034530746
+对面鼓 12.8020653633
+没听 9.28555713513
+晓庵 12.8020653633
+褐黑色 11.598092559
+周明帝 12.5143832909
+没吵 12.8020653633
+国际天文学联合会 11.4157710022
+没吸 12.5143832909
+报仇雪恨 10.5684731418
+孔祥 10.5684731418
+五次 8.98802276624
+带齐 13.900677652
+伦敦经济政治学院 12.1089181827
+巴勒斯坦全国委员会 12.2912397395
+坏毛病 12.1089181827
+平举 11.5027823792
+油油的 13.900677652
+明洁 12.8020653633
+信符 12.8020653633
+李姥姥 13.2075304714
+没向 11.3357282945
+人工受孕 13.2075304714
+吴江县 10.7226238216
+舒昂 13.2075304714
+地质力学 10.9049453784
+乌苏里江 9.38981814546
+晓庄 11.598092559
+张居正 6.03779561733
+孔礼 11.5027823792
+郎杨仁 13.2075304714
+裤衩 10.8096351986
+虐疾 13.2075304714
+汉军虏 13.2075304714
+俄亥俄河 10.765183436
+北魏太 11.0103058941
+十几杯 13.900677652
+曲径 11.0103058941
+没味 12.5143832909
+玉隆万 13.2075304714
+仪凤 11.9547675029
+谢秋思 9.26594866375
+任何迹象 12.1089181827
+虚字 11.9547675029
+没命 9.45802639549
+秦太学 13.2075304714
+曲律 11.4157710022
+九寨沟 9.13850371718
+尊驾 10.9049453784
+水水生 13.900677652
+滑得 11.5027823792
+平乱 11.1280889297
+人类基因 12.2912397395
+密封器 13.900677652
+洋枪洋炮 11.0674643079
+平乡 11.7034530746
+菜饭 11.7034530746
+银行帐户 12.1089181827
+直观性 11.4157710022
+滑进去 13.900677652
+明溪 12.8020653633
+七十期 13.2075304714
+二三百只 12.8020653633
+审级 11.9547675029
+男高音 11.0103058941
+鬼气森森 11.1926274509
+玄龄 12.2912397395
+阻延 13.2075304714
+地上权 12.2912397395
+圆熟 11.3357282945
+手轻 11.2616203224
+虚增 10.8096351986
+戈麦斯 11.5027823792
+筹款 10.1871055853
+牙科 10.765183436
+周公旦 10.765183436
+曲屏 13.2075304714
+晨会 11.5027823792
+白光光 12.2912397395
+信笺 10.4041700905
+黑珍珠 12.2912397395
+肾衰竭 10.8561552143
+人工繁殖 10.8561552143
+华瑞 13.2075304714
+丫髻 11.1280889297
+平方英里 10.765183436
+昭穆 11.9547675029
+白钨矿 11.4157710022
+帕施 13.2075304714
+禁航区 13.900677652
+喊冤叫屈 12.8020653633
+中南海 10.0294766411
+十二宫 12.1089181827
+岱宗 12.8020653633
+马臣 12.8020653633
+周瑜入 13.2075304714
+长石 9.16447920358
+周又增 13.2075304714
+柳之姿 13.2075304714
+一元醇 12.1089181827
+马阑勒 13.2075304714
+帕斯 11.7034530746
+困了 10.533381822
+野心家 10.6818018271
+诸夏族 13.2075304714
+戊戌六 12.1089181827
+水利学家 12.5143832909
+困于 10.2371160058
+子棋 12.2912397395
+魏曼 12.8020653633
+星土云 12.8020653633
+大衣呢 12.2912397395
+长矛 9.69598503258
+边飞边 12.2912397395
+补时 12.5143832909
+古日山 13.2075304714
+纸电泳 13.900677652
+湘剧院 13.900677652
+头破血流 10.1630080337
+曲尺 12.1089181827
+太极剑 12.5143832909
+秦香莲 11.4157710022
+十字街头 9.89334446674
+审结 10.765183436
+皇恩 9.5186510173
+贾珍方 12.1089181827
+武成帝 12.5143832909
+鹿钟麟 12.2912397395
+柴旦湖 12.1089181827
+虚声 11.8212361103
+应用环境 12.1089181827
+樊口 11.4157710022
+五格 13.900677652
+舵盘 11.9547675029
+五根 10.9049453784
+明渠 10.9562386728
+没在 9.89334446674
+孔穴 11.1280889297
+等不及 9.72629038208
+带鱼 9.41204128224
+咧咧 11.5027823792
+站网 12.8020653633
+买马招军 13.900677652
+五株 13.2075304714
+炊事兵 12.8020653633
+混合系统 13.900677652
+长眠 10.4041700905
+抽空来 13.2075304714
+原设 11.5027823792
+牙祭 13.2075304714
+中医科 13.2075304714
+盲目攀比 12.2912397395
+完人 11.598092559
+无迹可求 13.900677652
+运销 8.85082164473
+开架式 11.0674643079
+孙乾至 13.2075304714
+宋体 13.2075304714
+赵争争 9.24671730182
+蟑螂 9.94943393339
+叩门求见 13.900677652
+五栋 12.2912397395
+白鹿潭 13.900677652
+物流 7.11962002604
+深紫 11.5027823792
+乘敌不备 13.900677652
+原订 11.1926274509
+脚背 10.642581114
+七重奏 13.900677652
+原话 10.2630914922
+景龙间 13.2075304714
+软件生产率 12.1089181827
+体能 10.2117981979
+笛卡尔 9.69598503258
+原诗 12.1089181827
+很多双 13.900677652
+斯忒藩 12.8020653633
+民俗学 10.2897597393
+祖籍 8.6966709649
+龙如林 13.2075304714
+腌制 10.2117981979
+原词 12.5143832909
+羊卓雍错 11.5027823792
+岬角 10.2897597393
+原诉 13.900677652
+货郎 11.1926274509
+史弼 12.8020653633
+蝉鸣声 13.900677652
+明弘光 13.2075304714
+五档 12.2912397395
+性爱网 13.900677652
+有志之士 11.8212361103
+高等教育法 13.2075304714
+李长庚 12.5143832909
+七国集团 10.4666904475
+斯科格 13.2075304714
+索诸水 13.2075304714
+拉郎配 13.2075304714
+化工产品 8.77671367257
+宋仁宗 9.82314020807
+增给 13.900677652
+宋会 11.9547675029
+咸盐 11.9547675029
+版模 13.900677652
+多第站 13.900677652
+明湖 12.2912397395
+长着 8.70218062071
+宋代 6.99392287333
+另据报道 10.8561552143
+司天之 13.2075304714
+圣保罗 9.62401153296
+唱的歌 10.9562386728
+玛丽和 13.2075304714
+成熟技术 11.598092559
+安全卫生 11.4157710022
+长皮 13.900677652
+两四百文 13.2075304714
+拉林河 11.3357282945
+穿孔纸带 13.900677652
+麻风病人 13.900677652
+侨资 12.2912397395
+宋任 12.2912397395
+比对法 13.900677652
+朱文正 13.2075304714
+金属软管 13.900677652
+委阳 13.900677652
+守队 12.5143832909
+战鹰型 13.900677652
+万大哥 13.900677652
+多云转晴 11.3357282945
+拗口 11.0103058941
+被征服者 11.2616203224
+圆点 10.765183436
+仪化 11.0103058941
+行政部门 8.85082164473
+明澄 13.900677652
+大半碗 11.9547675029
+审美 8.36334338496
+救火车 12.8020653633
+恣纵 12.1089181827
+宋仕 12.5143832909
+心动过速 10.2630914922
+哲学笔记 12.5143832909
+佛光寺 12.1089181827
+长相 9.12155415886
+盐场 9.35738286971
+玄黄 12.8020653633
+长直 12.2912397395
+行不通 9.55687223012
+兔儿爷 11.9547675029
+引风吹火 12.8020653633
+一则以喜 13.2075304714
+重于泰山 11.3357282945
+牙碜 12.1089181827
+仪卫 11.1926274509
+宋人 9.17328983326
+赦免令 13.900677652
+如皋县 11.5027823792
+殷纣王 12.8020653633
+华电 8.37124856446
+文件大小 13.900677652
+荣焉 13.2075304714
+望天慈 12.8020653633
+长盛 8.5440913773
+一把子 12.5143832909
+阎浮 12.5143832909
+干干脆脆 12.5143832909
+盐土 9.74179456862
+体腔 9.5186510173
+放开手脚 10.9562386728
+宋云 11.4157710022
+红河哈尼族彝族自治州 10.8096351986
+空速表 12.5143832909
+程序设计 9.29550746599
+学习型 10.6818018271
+三端网络 13.900677652
+澳毛 13.2075304714
+疝气 11.2616203224
+入理 13.900677652
+慕容垂新 13.2075304714
+宋书 10.9049453784
+胥各庄 12.2912397395
+杜野 12.8020653633
+笔记 8.4801426527
+学而优则仕 11.8212361103
+定向选择 13.900677652
+郎中 8.39534611604
+秦武公 12.2912397395
+王宝森 13.900677652
+贾政之 13.2075304714
+拔擢 10.5684731418
+困住 10.642581114
+无可如何 11.598092559
+希梅 13.2075304714
+高碳钢 11.8212361103
+卑躬屈膝 11.8212361103
+宋之 10.8561552143
+蝙蝠 8.80692745117
+宋义 12.1089181827
+周佛海 11.7034530746
+驶动 13.900677652
+增为三倍 13.900677652
+宋乐 13.2075304714
+沃西 12.5143832909
+孙英 13.900677652
+曲差 13.900677652
+盐城 9.91169360541
+适配器 12.8020653633
+粟计 13.900677652
+长百 12.8020653633
+长白 10.2371160058
+情节性 11.598092559
+明潭 13.2075304714
+分身术 12.2912397395
+石粟 13.900677652
+英特尔公司 11.7034530746
+言财利 12.8020653633
+升高 7.2673592187
+笔误 11.9547675029
+王位继承 9.94943393339
+抢过 9.96885201925
+体臭 12.8020653633
+解决之道 10.9049453784
+宋丹 13.900677652
+电视大赛 13.900677652
+丫鬟 8.51618258919
+卓见 11.0103058941
+衬料 12.5143832909
+外群体 12.2912397395
+贝目 11.5027823792
+宋万 9.94943393339
+孔笛 13.2075304714
+秋菱 11.0103058941
+增加三倍 13.900677652
+玄鹤 11.8212361103
+笔试 9.53122979951
+何虑 11.5027823792
+笔译 12.5143832909
+张庄村 12.8020653633
+实落 12.2912397395
+王少舫 13.2075304714
+版次 13.2075304714
+摩弄 12.2912397395
+不断丰富 9.74179456862
+劳力士表 13.900677652
+多一点点 12.8020653633
+用兵一时 12.2912397395
+吴江市 11.8212361103
+染色质 10.4666904475
+钢铁企业 8.38724890581
+戈尔茨 13.900677652
+伊桑阿 11.8212361103
+希朴 13.900677652
+蛮子 9.54396882529
+解放初 11.8212361103
+萧功秦 12.5143832909
+瑞典皇家科学院 10.7226238216
+伏虎式 13.900677652
+大男子主义 12.1089181827
+家用空调 11.9547675029
+阅报栏 12.8020653633
+桑达克 11.9547675029
+筋斗云 9.93038573842
+镇安县 12.8020653633
+啧有烦言 12.8020653633
+曲剧 12.5143832909
+瑞克 11.598092559
+吴洪 13.2075304714
+牙石 12.2912397395
+比嘉 12.2912397395
+仪封 12.8020653633
+樊川 12.8020653633
+亦须 11.0103058941
+春去秋来 12.5143832909
+党祸 12.8020653633
+中美关系 9.46986085313
+记帐式 13.900677652
+五更 8.01179969364
+格林斯潘 10.3743171274
+解释性 12.1089181827
+库斯科 10.642581114
+杜诗镜 13.2075304714
+子模旧 13.900677652
+希松 13.900677652
+物探 10.9049453784
+帕斯捷尔纳克 11.9547675029
+何解 11.7034530746
+丘北县 13.2075304714
+居民区 9.20019728618
+法萨卢 13.2075304714
+淮河流域 9.74179456862
+避人眼目 13.900677652
+华容道 11.2616203224
+贝时璋 12.8020653633
+吉它 12.8020653633
+失盗 11.8212361103
+孔璋 13.2075304714
+汽车尾气 10.7226238216
+穆夫提 12.1089181827
+市场疲软 11.1926274509
+拟报 13.900677652
+菲茨 11.8212361103
+曲利 12.5143832909
+泼掉 12.5143832909
+黄水劫 13.2075304714
+周公死 13.2075304714
+没大 11.3357282945
+遥听 13.2075304714
+华章 11.9547675029
+公共部门 10.9562386728
+避难所 10.5684731418
+夏枯草 11.4157710022
+协管 12.8020653633
+明性 13.2075304714
+没头 10.765183436
+恰克 13.2075304714
+无法控制 9.75754292558
+樊崇 11.598092559
+多保忠 12.5143832909
+实际行动 9.4233408375
+斑马线 11.2616203224
+沈既济 12.2912397395
+挑战性 10.4041700905
+发表声明 8.76487921493
+应变措施 12.8020653633
+拔毒 11.8212361103
+吴引兵 13.2075304714
+每一处 10.765183436
+傍黑 11.3357282945
+祖父 8.21031819765
+祖爷 11.5027823792
+撩开 9.84023464143
+承担风险 10.533381822
+嗡嗡地 10.3743171274
+中地 9.98865464655
+空无一人 10.0088573539
+庾肩吾 11.9547675029
+旧岁 11.9547675029
+鲁凯族 13.2075304714
+三客 13.900677652
+潘又安 13.900677652
+世昌 12.5143832909
+助兴 10.0720362555
+胁从 11.4157710022
+葱郁 10.3453295905
+俗文学 11.8212361103
+押解 9.33632946051
+骆驼队 12.1089181827
+二三例 13.900677652
+杰尼亚 12.2912397395
+那众僧 12.1089181827
+沼泽地带 10.4349417492
+公告牌 13.2075304714
+苏伊士运河 9.24671730182
+枫溪 11.9547675029
+阿布哈兹 11.7034530746
+露光 13.2075304714
+先决条件 9.55687223012
+石佛镇 13.2075304714
+黄山市 10.8096351986
+林凤祥 13.2075304714
+唐纳德 11.8212361103
+农惠农 11.1926274509
+丙戌 13.2075304714
+祖率 12.5143832909
+五架 13.2075304714
+没事干 10.7226238216
+选修科 13.900677652
+凤子龙孙 13.900677652
+开阔地 10.8561552143
+五枪 12.5143832909
+揽客 11.7034530746
+袁术知 13.2075304714
+光谱学 10.3453295905
+阿尔沃兰 13.900677652
+加拿大多伦多大学 11.8212361103
+协税 13.900677652
+肺炎 8.83177344976
+汝明 11.598092559
+五枚 11.7034530746
+嗥叫 11.4157710022
+三阳交泰 13.900677652
+丹尼森 12.2912397395
+五林 12.8020653633
+臣服在 13.900677652
+生柔毛 13.2075304714
+棉质 11.5027823792
+文学部 11.598092559
+寡聚 13.900677652
+电磁学 9.7898037878
+戊戌年 11.8212361103
+留尼旺岛 13.900677652
+波斯 7.35389224122
+朱思本 11.2616203224
+北京大学中国经济研究中心 13.2075304714
+原著 10.1630080337
+花花点子 13.2075304714
+比图 13.2075304714
+十四所 12.1089181827
+结为一体 11.8212361103
+王子朝 12.1089181827
+一毫不差 13.900677652
+丁野夫 12.5143832909
+没声 11.1280889297
+各凭 13.900677652
+溜进去 12.8020653633
+天南星 10.8561552143
+西斯凯 13.2075304714
+战友情 13.900677652
+疑心生暗鬼 11.9547675029
+粳稻 11.0103058941
+一般照明 13.2075304714
+唐槐秋 13.2075304714
+切实有力 13.2075304714
+占星 11.598092559
+印第安那波利斯 13.2075304714
+郑钦谕 13.2075304714
+明正典刑 11.1280889297
+都挑明 13.2075304714
+瑞兆 13.900677652
+东北工学院 12.2912397395
+玛丽娅 11.7034530746
+吃喝玩乐 10.5684731418
+拉据战 13.900677652
+宿豫县 13.2075304714
+美国通用电气公司 11.2616203224
+黑家鼠 13.900677652
+五朵 11.0674643079
+武器系统 8.4284069783
+长命锁 11.9547675029
+任台谏 13.2075304714
+未受教育 12.5143832909
+五本 13.900677652
+铝钒土 11.7034530746
+金少山 12.1089181827
+人满之患 13.2075304714
+曾有文 12.8020653633
+深爱 10.4666904475
+五期 10.765183436
+那众军 13.2075304714
+都指挥使 9.33632946051
+菲英 12.8020653633
+提不起 10.8096351986
+不道德 10.3171587135
+曹伴伴 12.5143832909
+明三园 12.2912397395
+大戟科 10.7226238216
+闹矛盾 10.8561552143
+平平常常 10.533381822
+世杰 11.1926274509
+泼水难收 12.8020653633
+女奴隶 12.8020653633
+五服 10.4349417492
+五月 7.53592689512
+献县 10.5684731418
+瑞典 7.42063309005
+斯科朗 13.2075304714
+五板 13.2075304714
+发神经 12.2912397395
+李亭 13.2075304714
+柿叶 12.2912397395
+没填 12.8020653633
+户籍地 12.5143832909
+孔甲 11.8212361103
+明慧 11.0674643079
+五杯 13.2075304714
+败絮 12.1089181827
+多劳多得 12.5143832909
+刘千总 12.1089181827
+都邑常 12.8020653633
+杭州 6.36271499221
+玄德早 13.2075304714
+五条 9.03314320152
+十二名 11.598092559
+体违 12.8020653633
+往下压 11.8212361103
+澳新 10.604840786
+阿巴嘎旗 13.900677652
+牙瘤 13.900677652
+迁进来 13.900677652
+五村 13.900677652
+塔克世 12.8020653633
+茹茹公主 12.5143832909
+移情 11.8212361103
+中国农业大学 11.4157710022
+一湖 11.2616203224
+教育局长 11.1926274509
+王阳明 11.1280889297
+想望风采 13.2075304714
+护送 8.170577869
+系统分析员 13.900677652
+氧气袋 12.1089181827
+何许 13.900677652
+明抢 11.7034530746
+牙病 11.7034530746
+明报 11.8212361103
+孔目 10.4994802703
+锤造冠 13.900677652
+牙痛 10.7226238216
+参议院 8.4980002701
+赞成者 11.9547675029
+姓邢 12.8020653633
+那根木 12.8020653633
+关陇清 12.8020653633
+宫分 13.2075304714
+望天水 12.8020653633
+无数道 12.5143832909
+模拟法 12.2912397395
+远水不解近渴 12.2912397395
+挂红 12.1089181827
+没安 13.2075304714
+没守 12.8020653633
+没完 9.37888907493
+权力者 11.7034530746
+建筑界 11.598092559
+居中调停 13.900677652
+痛风性 12.2912397395
+中医界 12.8020653633
+和宜林 13.2075304714
+华硕 11.1280889297
+体谅 9.25628675283
+徘徊者 11.7034530746
+杜阿尔特 12.5143832909
+国家决算 13.2075304714
+沃蒂 12.5143832909
+法罗群岛 11.3357282945
+罗贵霜 12.8020653633
+何语 13.900677652
+士义 12.2912397395
+建筑用 10.2117981979
+燕目雨 13.2075304714
+下个季度 12.8020653633
+永安寺 12.8020653633
+李亮 13.900677652
+业师 12.5143832909
+国际标准化组织 11.1926274509
+胆碱酯酶 11.9547675029
+小区业主 11.598092559
+拳勇 13.2075304714
+山阴恒 13.900677652
+各借 12.8020653633
+半官方 10.8561552143
+乡办企业 13.900677652
+冷不防 9.32596667347
+张武 13.2075304714
+再高 11.1926274509
+常设机构 10.2117981979
+晓光 12.5143832909
+中队长 10.2117981979
+牙疼 11.1280889297
+李国翰 13.900677652
+平台式 11.9547675029
+长篇 8.38322475551
+别尔哥罗德 13.2075304714
+挂绿 12.2912397395
+樊忠 13.2075304714
+酒逢知己 13.2075304714
+蛮夷 10.604840786
+不瘟不火 13.2075304714
+虚名 9.53122979951
+不是冤家不聚头 12.2912397395
+黄吉安 12.5143832909
+希斯 12.2912397395
+范围图 13.900677652
+符滕堡 12.5143832909
+永丰镇 13.900677652
+馅心 11.4157710022
+减振器 9.91169360541
+往后方 12.2912397395
+弗列麦 13.2075304714
+太美丽 12.5143832909
+柯克里 12.8020653633
+误码率 12.8020653633
+老花 12.2912397395
+长笛 10.642581114
+坊间 8.96620371885
+马那瓜 11.8212361103
+多行不义 13.2075304714
+丁甲 12.1089181827
+临产 10.4994802703
+民建中央 12.8020653633
+体貌 12.5143832909
+十二块 13.2075304714
+提纯 9.44633035572
+有车族 11.7034530746
+子妇 12.8020653633
+店里 8.1417758781
+火力圈 12.5143832909
+跨湖 13.900677652
+北海公园 10.7226238216
+明扣 13.2075304714
+第七年 12.5143832909
+曹仁必 12.8020653633
+利姆诺 13.900677652
+刀法 9.80633308975
+定速巡航 10.9049453784
+阿姆斯 13.900677652
+拟态 11.3357282945
+玛丽奥 13.900677652
+尊长 10.7226238216
+债转股 10.9562386728
+海景画 13.900677652
+大众日报 13.2075304714
+打盹儿 11.2616203224
+一千公里 12.8020653633
+定弦 10.2897597393
+滑塌 11.5027823792
+明托 12.8020653633
+实心实意 11.1280889297
+南昌人 11.5027823792
+就此结束 10.7226238216
+托利党 10.5684731418
+单臂 11.0674643079
+黄牌警告 12.2912397395
+家用轿车 10.9562386728
+派拉蒙 11.0103058941
+泰德峰 13.900677652
+五方 9.44633035572
+击中要害 11.7034530746
+葡萄籽 12.5143832909
+乖乖女 12.2912397395
+烫头发 11.9547675029
+体贴 8.81927328699
+禁酒 10.9049453784
+五斤 10.5684731418
+几近于 12.1089181827
+曲克 12.8020653633
+升阶 13.900677652
+助力 8.82550383674
+升阳 11.8212361103
+忧患意识 10.4349417492
+五斗 9.98865464655
+热乎劲 12.1089181827
+玄德召 12.8020653633
+炉灶 10.2630914922
+掸帚 12.8020653633
+炉火 10.0088573539
+仪式 7.01721506556
+五文 13.2075304714
+恼火起来 13.900677652
+物情 13.900677652
+牧夫座 11.1926274509
+犹他 11.9547675029
+奇痛 12.2912397395
+升限 9.84023464143
+病毒检测 11.7034530746
+贬词 13.900677652
+学习室 12.2912397395
+聂士成 10.2371160058
+祖燕 13.2075304714
+马勒库 13.900677652
+升降 8.27305653829
+五日 9.09665660724
+晓健 12.8020653633
+吉礼 12.1089181827
+语病 12.8020653633
+樊建 11.9547675029
+不良倾向 13.2075304714
+捞稻草 13.2075304714
+七万六千锭 13.2075304714
+曲儿 10.1394775363
+一个少数派 13.900677652
+很多年 9.40086798165
+保卢斯 12.5143832909
+原虫 10.9562386728
+公主道 11.2616203224
+大屯山 12.1089181827
+辈数 11.4157710022
+酒酿汤圆 13.900677652
+解放以来 13.900677652
+汤若望 8.85082164473
+世故 10.4041700905
+鲜水河 11.9547675029
+往返奔走 13.900677652
+香水味 12.1089181827
+珊瑚礁 8.74738605748
+五支 11.598092559
+奥古斯都 9.91169360541
+祖焘 13.2075304714
+版权 8.98802276624
+锈蚀 10.6818018271
+二三百年 12.8020653633
+朝九晚五 12.8020653633
+独轮 11.4157710022
+产奶量 11.5027823792
+葡萄糖 8.52078029844
+青刀豆 13.2075304714
+石精 11.8212361103
+一元酸 13.2075304714
+明指 13.2075304714
+曲凤 12.2912397395
+裤腰带 10.3453295905
+于世者 13.900677652
+乳胶制品 12.8020653633
+凶巴巴 12.1089181827
+杨振鹏 13.2075304714
+级差地租 9.02548032877
+伯朝拉 12.1089181827
+仪征 9.69598503258
+国际清算银行 11.0103058941
+石榴花 11.0674643079
+王子斐 13.2075304714
+帕格 12.1089181827
+夺目 9.7898037878
+杭忆 8.29120585679
+长空 10.2630914922
+合并式 12.8020653633
+背带裤 13.2075304714
+穆砜 13.2075304714
+刘健明 13.2075304714
+深藏若虚 13.900677652
+向玉儿 13.2075304714
+合成纸 13.900677652
+拥塞 11.0103058941
+相互指责 12.5143832909
+关说 13.900677652
+物性 10.0940151622
+深灰 10.765183436
+玄德取 12.5143832909
+华福 9.37888907493
+盐官 10.642581114
+麦迪霉素 12.8020653633
+笛卡儿 11.8212361103
+献出 8.80692745117
+版本 7.58170953823
+物态 10.8096351986
+苫块 13.900677652
+助剂 10.604840786
+当前任务 12.8020653633
+盐山 11.8212361103
+仇必报 13.900677652
+一溜烟 9.59661255877
+还账 11.3357282945
+宝山区 11.0674643079
+何足 9.94943393339
+四千多年 11.8212361103
+两阶 12.8020653633
+虚功 13.2075304714
+壁垒分明 13.900677652
+佐藤 11.9547675029
+虚力 13.2075304714
+定编 12.1089181827
+换流器 13.900677652
+两阵 9.7898037878
+五折 11.1280889297
+关进牢 12.1089181827
+总参作战部 13.900677652
+通货膨胀率 9.34680076038
+鳞甲 10.1164880181
+笔耕 11.7034530746
+产褥期 11.0674643079
+盐层 10.8096351986
+圆管 11.9547675029
+科贸 12.8020653633
+何超 13.900677652
+作客 10.4349417492
+笔者 6.72748590949
+虚劳 10.9049453784
+押赴 10.642581114
+不以为耻 11.7034530746
+肺痨 11.7034530746
+吴大人 12.2912397395
+委琐 11.2616203224
+索利蒙 13.900677652
+扯铃 12.8020653633
+历朝 9.7898037878
+何路 13.900677652
+肺痿 12.5143832909
+康府兼 13.2075304714
+纺织品 8.22392384971
+知识面 10.9562386728
+医药费 10.3743171274
+和键长 13.2075304714
+肺痈 11.598092559
+五招 12.2912397395
+玄门 11.5027823792
+两分法 13.2075304714
+肺病 9.94943393339
+十四条 11.598092559
+方大同 13.900677652
+排座位 11.2616203224
+樊姬 13.900677652
+狸猫换 12.5143832909
+曾有恩 13.2075304714
+深知 8.0600359946
+浮岛 13.2075304714
+无垢 12.2912397395
+秦明引 12.8020653633
+躲懒 11.4157710022
+棉衣 8.73019365694
+西基利 12.5143832909
+矿内 12.1089181827
+下学 11.9547675029
+圆笔 13.900677652
+洋财 12.5143832909
+五户 10.765183436
+无一物 11.3357282945
+吸铁石 12.5143832909
+欧蓝德 12.2912397395
+华绥 11.4157710022
+深省 13.900677652
+造词法 13.900677652
+倒起 12.5143832909
+棉袍 10.5684731418
+吴泰 11.9547675029
+地压 10.4666904475
+虚列 13.900677652
+源汇区 11.8212361103
+棉袄 8.77671367257
+退一步说 10.4349417492
+荣立 11.0103058941
+士绅 8.96620371885
+十字街口 10.2630914922
+审理 7.70016847793
+大面积 7.38005652442
+泥塑木雕 11.8212361103
+圆笼 12.5143832909
+十二元 11.8212361103
+五成 9.18217878068
+寇栋 12.5143832909
+棉被 9.85762638414
+社会医学 13.2075304714
+裤脚 10.0720362555
+为人忠厚 12.8020653633
+须得先 12.5143832909
+物权 10.2371160058
+黄麻起义 11.7034530746
+武夷山市 11.598092559
+回不去 10.1871055853
+努力学习 11.0103058941
+深沉不露 11.8212361103
+圆筒 10.1871055853
+竹林七贤 10.604840786
+树顶上 11.5027823792
+五批 13.900677652
+开不动 11.9547675029
+防抱死 11.7034530746
+华约 10.4666904475
+伏虎寺 12.8020653633
+裤腿 9.77354326693
+和塔纳 13.900677652
+渐少 10.8561552143
+东床 12.2912397395
+退一步讲 11.8212361103
+华纳 11.0103058941
+裤腰 10.5684731418
+泰耶尔 13.2075304714
+李国祥 13.900677652
+配电盒 13.2075304714
+配电盘 13.900677652
+明摆 12.1089181827
+酸碱性 10.9562386728
+原自 13.2075304714
+加湿器 10.9562386728
+德奎 12.8020653633
+拿过 9.21854642485
+五扇 12.8020653633
+比利亚雷 13.900677652
+棉裤 10.0505300503
+五所 11.0674643079
+李荣融 11.2616203224
+伊博族 12.8020653633
+往下坠 11.1926274509
+基本技能 12.2912397395
+明断 12.1089181827
+消费性 10.4041700905
+升速 12.2912397395
+武毅伯 12.8020653633
+死链接 13.900677652
+虽为 9.55687223012
+刑部堂 12.2912397395
+明方 11.9547675029
+周任 12.8020653633
+员外郎 9.10488710638
+伽马 10.0294766411
+卤水 9.80633308975
+饮弹自尽 11.9547675029
+操自领 11.8212361103
+明斋 12.8020653633
+格利哈 13.900677652
+五排 12.8020653633
+顶风 10.0294766411
+明文 10.7226238216
+扶养费 12.8020653633
+南开区 12.5143832909
+咧开 10.0088573539
+托克劳 11.7034530746
+即告 9.89334446674
+秦安拉 13.2075304714
+棉褥 13.900677652
+著色 13.2075304714
+明旨 11.2616203224
+明早 9.37888907493
+滋阴壮阳 12.2912397395
+菜金 12.8020653633
+汉承秦 11.598092559
+竖行 13.900677652
+明日 6.59012749344
+原职 11.4157710022
+电磁式 11.8212361103
+人心浮动 10.604840786
+都察院 8.85725253506
+虚发 12.1089181827
+广大读者 10.3171587135
+恋慕 13.900677652
+上君亭 12.5143832909
+搞对象 11.8212361103
+橡皮艇 10.9562386728
+带刺儿 12.8020653633
+脑子里 7.87239913175
+保湿霜 11.9547675029
+养晦 13.900677652
+嗝儿 12.2912397395
+卤汁 13.2075304714
+闷罐 12.1089181827
+拍苍蝇 12.2912397395
+何景明 11.7034530746
+隋改今 12.5143832909
+甘谷县 13.2075304714
+挤进来 10.9562386728
+因雨 12.2912397395
+牙牌 10.4666904475
+盐巴 10.9562386728
+角蛋白 13.2075304714
+巴吉耶 13.900677652
+惊风骇浪 11.9547675029
+里通外国 12.2912397395
+牙片 13.900677652
+耳下腺 13.900677652
+一二三四 12.8020653633
+助听 12.2912397395
+物景 13.900677652
+盐工 11.7034530746
+华翰 13.2075304714
+虚化 11.9547675029
+警察队 13.900677652
+扯扯 10.5684731418
+体认 12.2912397395
+扫榻以待 13.900677652
+雷达站 11.0674643079
+中班 12.1089181827
+贬责 12.8020653633
+濮阳兴 13.2075304714
+包村 12.8020653633
+油嘴滑舌 12.2912397395
+赌气 8.9102450652
+何谓 9.89334446674
+双向选择 12.8020653633
+何谈 11.1926274509
+天津美术学院 13.900677652
+阿姆拉 12.1089181827
+华翔 10.7226238216
+垂下去 11.598092559
+杨绛 13.2075304714
+虚华 13.2075304714
+电渗析 11.3357282945
+数十辆 11.8212361103
+白芝麻 12.8020653633
+笔致 10.9049453784
+行李架 11.1926274509
+控制器 9.66657114738
+卢水胡 11.598092559
+灿坤 12.2912397395
+修短 12.2912397395
+春风满面 12.5143832909
+安集延 11.7034530746
+移动电话 10.4349417492
+罗安江 11.4157710022
+吴永 12.5143832909
+华美 9.04086524761
+明敏 12.5143832909
+三星级 11.5027823792
+原胶 12.5143832909
+庄无因 10.8561552143
+体诗 10.8096351986
+真真实实 13.900677652
+龙应台 13.900677652
+希拉 10.9562386728
+协统 11.3357282945
+明教 11.0103058941
+牛亚科 11.9547675029
+体词 13.900677652
+北京科技大学 13.2075304714
+一条龙 9.98865464655
+先下手为强 10.7226238216
+物质利益 11.2616203224
+十二只 13.2075304714
+世情 10.4994802703
+拔海 13.900677652
+烂舌头 12.5143832909
+向学 12.2912397395
+石守信 11.4157710022
+一个十几岁 11.7034530746
+憋闷 10.1630080337
+力大无比 12.5143832909
+拿货 11.8212361103
+十二号 13.900677652
+焊了 12.1089181827
+左谏议 13.2075304714
+黑白电视 12.5143832909
+何辜 11.8212361103
+何辞 13.2075304714
+巴士底狱 11.0674643079
+铅笔头 11.7034530746
+启蒙运动 9.44633035572
+来犯之敌 11.9547675029
+鹰勾鼻 13.2075304714
+流窜到 12.5143832909
+合理安排 9.55687223012
+韦词疏 13.2075304714
+笔舌 13.2075304714
+动力站 12.5143832909
+没得 9.37888907493
+张路峻 13.2075304714
+贡嘎 12.5143832909
+望天树 11.2616203224
+曲周 12.5143832909
+庄河 11.598092559
+明暗 9.53122979951
+畏畏缩缩 10.8096351986
+带钱 11.598092559
+内正毅 13.900677652
+虚像 11.5027823792
+深痕 12.8020653633
+克郎棋 13.900677652
+雷锋精神 13.2075304714
+孔状 12.1089181827
+深痛 12.2912397395
+体衰 12.2912397395
+中英关系 13.2075304714
+拿走 8.71889410168
+押车 11.9547675029
+尊重 7.16489763773
+带钢 12.5143832909
+体表 8.77077893705
+没念 11.598092559
+移来 10.9049453784
+负温度 13.900677652
+欧汉伦 13.900677652
+曲名 11.9547675029
+磨刀不误砍柴工 13.2075304714
+盐帮 13.900677652
+邓散木 12.8020653633
+物料 9.31571017331
+何迟 11.9547675029
+写信给 10.0505300503
+何进 10.533381822
+上方剑 13.900677652
+春秋装 13.900677652
+念起来 11.2616203224
+顾之恩 12.5143832909
+汤佩松 13.2075304714
+切尔克斯 11.9547675029
+白皮松 11.1926274509
+卡尔森 12.5143832909
+掸子 12.1089181827
+庄泳 13.2075304714
+超临界 10.9049453784
+晓喻 13.2075304714
+大烟鬼 11.5027823792
+不卑不亢 10.642581114
+科布多 11.1926274509
+白鹿村 8.80692745117
+夏令 11.598092559
+夏代 9.28555713513
+明春 10.1871055853
+全师东 12.8020653633
+笔芯 12.8020653633
+练成军 12.5143832909
+复兴路 13.900677652
+焊上 13.2075304714
+长缨 11.9547675029
+撒网捕鱼 13.2075304714
+十二卷 10.533381822
+霹雳 8.97342396682
+夏仲 13.2075304714
+霹雷 11.5027823792
+庄民 11.8212361103
+明百官 13.2075304714
+宾馆酒店 12.5143832909
+明昌 11.5027823792
+明明 7.74158226348
+科拉东 13.2075304714
+长编 10.533381822
+伊萨伊 13.2075304714
+小声点 11.3357282945
+俗论 13.2075304714
+丙方 13.2075304714
+迷误 12.1089181827
+刘文喜 12.8020653633
+戚县 13.900677652
+卖狗肉 12.5143832909
+明星 6.7359572732
+花旗参 13.900677652
+甜地丁 13.900677652
+物故 12.1089181827
+刚性杆 13.2075304714
+明晨 11.0103058941
+世态 11.0103058941
+缪俄古 13.2075304714
+排污者 13.900677652
+春秋衫 13.900677652
+命令行 9.03314320152
+莫色雷斯 12.8020653633
+艰苦卓绝 10.7226238216
+头脑发热 10.9049453784
+澳抗 11.2616203224
+刀棍 12.8020653633
+菲薄 11.3357282945
+掩蔽物 13.900677652
+美国全国广播公司 11.3357282945
+淋浴器 13.2075304714
+锈菌 12.2912397395
+十二匹 13.2075304714
+明晰 8.93783302172
+斯图尔特 11.7034530746
+读写磁头 13.900677652
+玄青 13.900677652
+史稽察 13.2075304714
+印花布 10.2630914922
+盐店 12.8020653633
+押运 10.2630914922
+釜山 10.2630914922
+告警信号 13.900677652
+楚暖暖 11.0674643079
+十二包 13.2075304714
+长武县 13.900677652
+十四日 9.89334446674
+铁夹 12.8020653633
+明晚 10.604840786
+忠孝不能两全 11.8212361103
+体裁 8.3555002075
+凸显出 10.8096351986
+平面布置 11.2616203224
+十四时 13.2075304714
+挂空 13.900677652
+涉案者 12.1089181827
+长线 8.81308131674
+明枪 12.2912397395
+肤如凝脂 12.2912397395
+中道而废 13.2075304714
+呼幺喝六 13.900677652
+半条 10.4041700905
+安可复 13.2075304714
+玛丽岛 13.2075304714
+夺爱 13.900677652
+移易 12.2912397395
+逆水行舟 11.4157710022
+月里嫦娥 12.5143832909
+第十一个五年 13.900677652
+粳米 9.91169360541
+水芋 12.5143832909
+十八号 13.900677652
+抵不过 12.2912397395
+极端主义 11.3357282945
+韦尼泽 12.8020653633
+伯勒达 13.2075304714
+没底 9.98865464655
+底盖 13.900677652
+探子 9.72629038208
+希思 11.8212361103
+心功能 10.2897597393
+老婆婆 9.82314020807
+现行制度 11.2616203224
+顶骨 10.9562386728
+长绳 10.8096351986
+盘膝而坐 11.8212361103
+希恩 11.9547675029
+揽工 9.69598503258
+黄晶 12.8020653633
+十年间 10.1871055853
+鳞癌 12.1089181827
+杭子 13.2075304714
+京兆尹 10.8561552143
+拟文 13.2075304714
+明柱 11.9547675029
+动力箱 13.900677652
+目睹者 13.900677652
+长统 11.9547675029
+台北师范 13.900677652
+保障局 10.604840786
+禁锢 9.56994431169
+演说稿 13.900677652
+几米远 11.7034530746
+大海鲢 13.900677652
+小便宜 11.1280889297
+挂篮 13.900677652
+上千亿 11.5027823792
+原色 11.0103058941
+平衡常数 12.1089181827
+第八十九 12.5143832909
+家过夜 13.900677652
+英国首相 9.48183704418
+抗着 13.2075304714
+国家经委 12.5143832909
+密西西比 11.0674643079
+不怕累 12.2912397395
+焦德海 12.5143832909
+共轭酸 13.900677652
+仪宾 13.2075304714
+明末 8.1417758781
+杭宁 12.8020653633
+仪容 10.604840786
+没带 9.61021821083
+军用桥 13.900677652
+好多天 9.84023464143
+纤长 11.4157710022
+束缚电荷 12.1089181827
+满庆堂 11.8212361103
+卫生防护 11.9547675029
+湖心岛 11.2616203224
+明月 8.48903160012
+窝窝头 10.604840786
+永安市 12.1089181827
+天下英雄 10.8561552143
+包运 12.5143832909
+道德规范 9.84023464143
+审看 12.2912397395
+阵脚 9.84023464143
+禁闭 10.4666904475
+樊娲 13.2075304714
+操修者 13.900677652
+祖甲 12.8020653633
+明朝 6.72595334214
+衷心祝愿 12.1089181827
+劈哩啪啦 13.900677652
+文学院 9.54396882529
+体要 12.2912397395
+甲磺酸 13.2075304714
+夏侯 10.2117981979
+筹拨 12.8020653633
+第二碗 11.598092559
+轮转机 13.900677652
+环境保护 8.18364995057
+克里斯琴 12.8020653633
+交谊舞 13.900677652
+拔河 11.2616203224
+夏侠 12.5143832909
+没干 10.3743171274
+跪姿 12.2912397395
+办得好 11.8212361103
+带锯 13.900677652
+肺癌 9.37888907493
+麻剌朗 13.2075304714
+筹拍 12.5143832909
+吹拉弹唱 11.8212361103
+外国投资 9.85762638414
+荣禄 8.30969067146
+临湘县 12.8020653633
+地区 4.45740182622
+没准儿 10.3171587135
+姜立夫 13.2075304714
+晓维 11.5027823792
+灞河 12.8020653633
+精心照料 11.598092559
+体视 13.2075304714
+老友记 13.900677652
+西藏天路 12.1089181827
+调职 11.0103058941
+中间状态 11.8212361103
+咨询服务 9.75754292558
+折算法 12.5143832909
+弯回 13.900677652
+中央警卫团 13.2075304714
+枉口诳舌 13.2075304714
+五度 10.4994802703
+五座 10.4349417492
+治保会 13.2075304714
+王子平 13.2075304714
+焊点 12.2912397395
+结膜 10.3171587135
+诸色民 13.2075304714
+惠岸行 12.2912397395
+个人努力 12.8020653633
+康特湾 13.900677652
+五床 12.8020653633
+牙周膜 12.2912397395
+斜面 9.62401153296
+防范设施 13.2075304714
+癔病 11.598092559
+襄渝铁路 11.0674643079
+通话费 10.8096351986
+五建 11.9547675029
+刘文武 11.3357282945
+建造 6.75233190808
+架飞机 8.93783302172
+单行法 11.8212361103
+二百六十余年 13.2075304714
+曲轴箱 12.5143832909
+贵体 10.9049453784
+九节 11.0674643079
+王尚仪 12.8020653633
+丙子 12.5143832909
+范玮琪 12.5143832909
+肠结核 11.7034530746
+水轮发电 13.2075304714
+坟岗 12.2912397395
+保永全 13.900677652
+禹铸 13.2075304714
+修陵寝 13.2075304714
+跌下来 9.93038573842
+蔡行 12.8020653633
+列强 8.2273543848
+七十八 11.598092559
+瞧热闹 11.1926274509
+聋子 10.1164880181
+七十六 11.7034530746
+犹疑 9.53122979951
+越勤 13.2075304714
+龙机发 13.900677652
+建部 9.41204128224
+五常 11.3357282945
+韦伯分数 13.900677652
+环视 9.93038573842
+性病变 10.5684731418
+九艘 12.5143832909
+光大银行 9.65218240993
+希德 11.0103058941
+五席 11.8212361103
+恰值 11.7034530746
+托君臣 13.2075304714
+三家 7.56739802384
+帕卡 13.2075304714
+丰润县 13.2075304714
+模拟器 11.7034530746
+宋祁 11.2616203224
+逐鹿中原 11.0674643079
+岱海 11.5027823792
+拔取 11.8212361103
+三九药业 13.2075304714
+明堂 10.1394775363
+扩大机 13.900677652
+别生枝节 13.900677652
+竹山县 12.2912397395
+耶律克 12.8020653633
+喊嚷 13.900677652
+五师 11.1926274509
+不得好死 10.765183436
+壁纸 10.7226238216
+十四家 12.5143832909
+高乃依 11.1926274509
+舒卷 11.9547675029
+阿姆德 12.8020653633
+格林维尔 12.1089181827
+五年 6.47950012338
+丙寅 11.598092559
+更鼓 10.533381822
+那可真 10.604840786
+三审 11.7034530746
+平等 6.9731197457
+自由词 13.900677652
+馅料 11.598092559
+澳门地区 12.1089181827
+吴文俊 11.9547675029
+乌珠穆沁 11.5027823792
+拴紧 13.2075304714
+宋礼 11.598092559
+臀疣 12.8020653633
+弄兵 13.2075304714
+通缩 8.79473217808
+五幕 13.2075304714
+成云致 12.8020653633
+晓母 12.8020653633
+五幅 12.2912397395
+保险行业 9.4233408375
+顾崇廉 13.2075304714
+环行 10.642581114
+五德 10.8561552143
+查嗣庭 13.2075304714
+见过面 9.35738286971
+通络 10.765183436
+青磐岩 13.2075304714
+磁鼓 11.8212361103
+无迹可寻 11.8212361103
+小燕儿 12.2912397395
+敬酒不吃吃罚酒 11.598092559
+蒋纬国 12.2912397395
+肖厝 12.5143832909
+结肠 9.98865464655
+世忠 11.4157710022
+反洗钱 10.2630914922
+环衬 13.2075304714
+南竿塘 12.8020653633
+宋磊 10.7226238216
+耳热心跳 12.8020653633
+明妃 12.1089181827
+铭骨 13.900677652
+拔剑 9.55687223012
+办公区 11.0674643079
+败诉方 13.2075304714
+高级神经 11.2616203224
+铁道部长 13.2075304714
+白刷刷 13.2075304714
+五律 10.4666904475
+博山炉 10.9049453784
+懒觉 12.1089181827
+量子态 11.2616203224
+两万七八千 12.8020653633
+棒状 9.71102290995
+维采湖 13.2075304714
+拟定 8.1608847398
+须得治 13.900677652
+帕劳 11.4157710022
+信教 10.3171587135
+没想 8.2985588311
+壅塞 10.1164880181
+变形虫 11.3357282945
+轴功率 13.900677652
+刘大夏 13.2075304714
+王誉封 12.8020653633
+懒得动 13.2075304714
+唐律 10.4041700905
+建筑业 8.66956903512
+蔡襄 11.2616203224
+野葡萄 12.8020653633
+九莲 10.1394775363
+拗断 13.900677652
+通红 7.94743431769
+掌禁卫 13.2075304714
+阿姆布 13.900677652
+米松 13.900677652
+夤缘 12.2912397395
+世德 12.5143832909
+催命鬼 11.9547675029
+合山市 12.5143832909
+平章 9.17328983326
+睫状肌 11.1280889297
+拔刀 10.533381822
+七位数 13.900677652
+明天 6.41855872842
+达斡尔族 10.533381822
+几何图形 10.3171587135
+忙来忙去 13.900677652
+人母 12.2912397395
+黄山松 10.8096351986
+曾浚修 13.900677652
+闪躲 11.0103058941
+明大 13.900677652
+曾文正公 12.1089181827
+闪身 9.6811699468
+吴帝孙 12.2912397395
+舒利 13.2075304714
+五张 11.7034530746
+明夷 13.900677652
+建里 13.900677652
+点错 12.5143832909
+明复 11.8212361103
+吕公望 13.2075304714
+骏马奔驰 13.2075304714
+平稳 6.40402521381
+几百千瓦 13.2075304714
+广告投放 10.765183436
+明处 10.765183436
+敌酋 12.1089181827
+年年岁岁 11.9547675029
+五式 13.900677652
+明夜 13.2075304714
+献殿 11.9547675029
+调至 9.80633308975
+蚀刻 12.1089181827
+探寻 9.38981814546
+慧立 12.1089181827
+赤叶河 13.2075304714
+娇客 12.2912397395
+世异 12.8020653633
+霉菌病 13.2075304714
+加热管 13.900677652
+父职 11.1926274509
+娇宠 11.598092559
+维涅隆 13.900677652
+芝麻街 13.900677652
+五彪 12.2912397395
+西湖畔 13.900677652
+五彩 9.35738286971
+半左右 11.0103058941
+卡尔西 12.8020653633
+世弟 13.900677652
+平空 11.0103058941
+难兄 12.8020653633
+心情愉快 10.765183436
+贩运 9.34680076038
+营养食品 11.8212361103
+铁姑娘 13.2075304714
+赵老爷 13.2075304714
+显赫 8.78268383956
+埃厄忒斯 13.900677652
+朴夏苓 13.2075304714
+写毛笔字 13.900677652
+开疆辟土 12.8020653633
+单耗 12.1089181827
+虽然 4.27413007536
+没接 11.2616203224
+不应期 11.9547675029
+布雷达 12.1089181827
+战九捷 13.2075304714
+五岳 9.41204128224
+五岭 9.87532596124
+夏特 13.900677652
+分派任务 13.2075304714
+沈心友 13.900677652
+孔代 12.5143832909
+斯蒂法 13.2075304714
+彭小枫 13.2075304714
+十四天 12.8020653633
+居民楼 10.1871055853
+浑然不知 11.9547675029
+舒农 12.8020653633
+一则以惧 13.900677652
+十四大 10.642581114
+柿树 10.6818018271
+拟声 12.8020653633
+罗亚尔港 11.7034530746
+功能丰富 13.2075304714
+明媚 9.72629038208
+没排 11.7034530746
+技术培训 11.5027823792
+不成文法 11.9547675029
+卤化 9.98865464655
+调色 12.1089181827
+涵盖面 12.2912397395
+近闻 10.4994802703
+腔壁 12.8020653633
+伎俩 9.5186510173
+过水面 12.8020653633
+棣棠 13.2075304714
+形于辞色 13.2075304714
+盐户 10.9562386728
+困窘 10.8561552143
+孙志刚 11.8212361103
+五峰 10.2117981979
+王为帝 11.9547675029
+孔亮 10.3171587135
+帕冯 12.5143832909
+青楼女子 11.1926274509
+开罗 8.94485059437
+浪者 13.900677652
+孔亦 13.900677652
+云合响应 13.2075304714
+信贷政策 8.33999602096
+如饥似渴 11.0103058941
+三季 10.3171587135
+湛然 11.9547675029
+平移 9.65218240993
+洋相百出 13.900677652
+宽带数据 13.900677652
+明光市 13.2075304714
+开置 11.9547675029
+酸碱度 9.87532596124
+没提 11.1280889297
+九股 11.5027823792
+断后路 13.900677652
+草率了事 13.900677652
+同德耀 13.2075304714
+吴公公 11.4157710022
+一个一个把 13.2075304714
+五尺 9.7898037878
+没挤 13.2075304714
+阿姆巴 12.1089181827
+年原 11.8212361103
+顺天者存 13.900677652
+环评 10.6818018271
+世风日下 12.5143832909
+二三百条 13.2075304714
+奥尔斯姆 13.2075304714
+托钵僧 12.8020653633
+二十八种 13.2075304714
+马圈湾 12.1089181827
+法学博士 10.0940151622
+安提瓜和巴布达 11.2616203224
+碱基配对 12.5143832909
+顾晓鸣 13.2075304714
+困穷 12.8020653633
+孔乙 13.900677652
+明威 12.5143832909
+制成 6.53423250365
+路线 7.02029356979
+五小 12.5143832909
+吴班 10.642581114
+明娜 11.3357282945
+一府两院 13.2075304714
+边府 11.2616203224
+路经 9.94943393339
+佩丁冬 12.5143832909
+西南财经大学 11.8212361103
+舒兰 11.9547675029
+调节 6.53170724978
+世尊 11.0674643079
+难经 10.9562386728
+异丁醇 12.8020653633
+一统江湖 12.5143832909
+朗伊尔城 13.900677652
+世尘 12.8020653633
+虚汗 10.2897597393
+化装师 13.900677652
+李汉俊 12.1089181827
+结荚 11.2616203224
+叶海亚 11.1926274509
+申奏军 13.2075304714
+乔治王 13.900677652
+玉华阁 13.2075304714
+略阳县 13.2075304714
+结草 11.8212361103
+五届 9.61021821083
+阿尔帕德 13.900677652
+五层 10.2897597393
+五局 12.8020653633
+二百八十亿余 13.2075304714
+一文不名 11.598092559
+保障性 8.64840422393
+任提领 13.2075304714
+卷积码 13.900677652
+表示遗憾 12.2912397395
+王金龙 13.2075304714
+迂缓 12.8020653633
+明室 11.5027823792
+源地 9.69598503258
+占夺民 12.8020653633
+地势 6.54759573146
+庄农 12.2912397395
+伊利诺伊 11.4157710022
+维吉纳琴 13.900677652
+官房长 13.900677652
+卤制 13.2075304714
+版心 13.2075304714
+希尼 12.8020653633
+伯克霍 12.2912397395
+神祈雨 13.2075304714
+贩货 11.9547675029
+各例 12.8020653633
+针布 13.2075304714
+没抄 12.8020653633
+夺下 10.2630914922
+自强不息 10.6818018271
+军用品 11.9547675029
+杠杆原理 10.9562386728
+曾立志 13.900677652
+杰西 12.1089181827
+调用函数 12.8020653633
+明宇 12.8020653633
+明官 12.8020653633
+明定 11.0674643079
+独持异议 13.2075304714
+非刑 12.2912397395
+汝观兄 11.2616203224
+结节 9.48183704418
+豪商巨贾 12.2912397395
+献计献策 10.9562386728
+特邀代表 13.2075304714
+明宗 10.4994802703
+乔纳森 11.598092559
+风卷残云 11.1280889297
+析因实验 13.900677652
+诸山之 12.5143832909
+禁止令 12.8020653633
+横纹 10.3171587135
+万古不变 13.2075304714
+五巷 13.900677652
+工作餐 11.9547675029
+中华医学会 10.5684731418
+横纲 13.900677652
+明寺 12.8020653633
+丛山中 12.5143832909
+碑版 11.8212361103
+裙带菜 11.7034530746
+任冀察 12.2912397395
+卡尔诺 12.5143832909
+发下 10.1394775363
+泼墨 10.4994802703
+司徒慧敏 12.5143832909
+孺子可教 13.900677652
+春化 12.8020653633
+阿姆尔 13.900677652
+飞燕草 12.8020653633
+四五万年 13.2075304714
+不胜其烦 11.9547675029
+大眼瞪 11.4157710022
+木工机械 12.8020653633
+国产片 13.900677652
+明察 10.765183436
+体育竞技 12.1089181827
+没招 12.1089181827
+原书名 13.900677652
+七回 13.900677652
+光芒四射 10.9562386728
+九腔 12.8020653633
+捧上去 13.2075304714
+加油量 13.900677652
+依此类推 10.3743171274
+新丝路 13.900677652
+脊神经 11.0103058941
+夏珺 13.900677652
+夺人 10.4666904475
+系列加工 12.5143832909
+剪羊毛 13.900677652
+挪威政府 12.2912397395
+欧锦赛 13.900677652
+闻其名 10.9049453784
+筹委会 11.2616203224
+两成 8.73589167805
+臭鼬 11.7034530746
+愈来愈浓 12.1089181827
+多一层 11.9547675029
+西察合 12.8020653633
+没戏 10.6818018271
+梦见 8.44535653662
+脏话 10.3743171274
+贺金 13.900677652
+阿诺 12.8020653633
+结舌 11.7034530746
+耐候性 11.7034530746
+衬出 10.8096351986
+开线 13.900677652
+晓梅 11.7034530746
+谌家矶 13.900677652
+保皇会 11.5027823792
+多层面 11.5027823792
+养兔场 13.2075304714
+加拿大元 12.2912397395
+一九四四年 11.1280889297
+明季 12.1089181827
+微结构 11.8212361103
+反目成仇 11.5027823792
+群众运动 9.49395840471
+开结 13.900677652
+名利场 11.5027823792
+版式 11.4157710022
+胁痛 11.3357282945
+开给 11.8212361103
+孔传 12.8020653633
+拷绸 13.900677652
+国秀集 12.8020653633
+茨淮新河 11.8212361103
+庄公 10.765183436
+夏王 11.9547675029
+康乃尔 13.900677652
+乱闹 12.2912397395
+佩尔松 13.900677652
+有的是 7.89679058487
+没打 11.1926274509
+加钱 11.9547675029
+棱柱体 12.8020653633
+费劲儿 12.8020653633
+明子 12.2912397395
+曲榭 13.2075304714
+庄兵 11.9547675029
+尿酸 10.2897597393
+灞桥 11.2616203224
+乱闯 11.3357282945
+中唐 9.87532596124
+刀刃 9.69598503258
+刀刀 12.2912397395
+强征来 13.900677652
+骨干力量 10.4666904475
+刀切 11.2616203224
+板边 13.2075304714
+萨尔蒂科 12.5143832909
+祖予 13.2075304714
+健身活动 11.5027823792
+炉体 11.9547675029
+通篇 10.7226238216
+摇鹅毛扇 12.5143832909
+脏象 11.8212361103
+盛菜 13.2075304714
+空无一物 11.1926274509
+掉价 12.5143832909
+阳府君 12.5143832909
+极恶 13.2075304714
+跋山涉水 10.9562386728
+匪特 13.900677652
+敢想敢干 12.1089181827
+连首辅 12.5143832909
+湟鱼 11.8212361103
+王子婴 12.1089181827
+拟建 10.2897597393
+生面 13.900677652
+马前驰 13.2075304714
+十四张 13.900677652
+李凯尔特 12.8020653633
+筹备 8.1641053545
+洛夫蒂 13.900677652
+弯勾 13.900677652
+修华丽 13.2075304714
+夏瑜 13.900677652
+阿罗汉 11.7034530746
+开示 12.8020653633
+刀刻 11.4157710022
+乌鹊 12.2912397395
+仪态 10.7226238216
+生物浓缩 13.900677652
+郑建仙 13.900677652
+刀削 10.9049453784
+品名 11.3357282945
+样子 5.73275828902
+固定成本 10.9562386728
+明朗化 9.66657114738
+皇民化 12.8020653633
+燕麦片 11.9547675029
+六十几个 12.8020653633
+刀剑 9.22784881751
+春秋左氏 11.598092559
+王萧誉 12.5143832909
+一动不如一静 13.2075304714
+曲渊 13.2075304714
+别时圆 13.2075304714
+祖代 11.2616203224
+轻蔑地笑 11.4157710022
+赔不起 10.9049453784
+刀剪 11.9547675029
+中山西路 13.900677652
+开票 10.9049453784
+动漫网 13.2075304714
+杀威棒 11.598092559
+深信 9.49395840471
+甘苦与共 12.8020653633
+舒城 11.4157710022
+派出所长 12.8020653633
+甘泽谣 13.2075304714
+一翻到 13.900677652
+开禁 11.0103058941
+横祸 11.2616203224
+李高成 6.23492422011
+平缓 8.03138073884
+东平县 12.8020653633
+调蓄 10.5684731418
+计划案 13.900677652
+十二楼 13.2075304714
+明尼 13.2075304714
+长幼有序 12.5143832909
+往下滴 11.2616203224
+没收 7.99804431857
+外来干涉 11.598092559
+养上 12.8020653633
+祖业 10.533381822
+帕坦 11.598092559
+民主思想 10.765183436
+转播车 13.900677652
+没放 11.2616203224
+环路 10.1871055853
+中国武术协会 10.9049453784
+半遮半掩 12.5143832909
+绳线 13.900677652
+开禧 11.9547675029
+俄亥俄州 9.75754292558
+陈巴尔虎旗 12.5143832909
+明封 12.5143832909
+自寻 10.765183436
+樱桃汁 13.2075304714
+明将 11.2616203224
+希安 13.900677652
+拔城 13.900677652
+帕坎 13.900677652
+极性相反 13.2075304714
+对偶空间 13.2075304714
+往时 11.3357282945
+利比亚人 12.2912397395
+环跳 12.5143832909
+没敢 8.51618258919
+地勤 12.2912397395
+二十一二岁 12.8020653633
+绳结 11.598092559
+轰动性 13.2075304714
+壁立 10.4994802703
+平罗 11.1926274509
+弯刀 11.4157710022
+闪语 12.8020653633
+舒坦 9.85762638414
+傅钞 13.900677652
+施国光 12.8020653633
+感遇 12.2912397395
+明山 12.2912397395
+边带 12.1089181827
+蓝道 12.2912397395
+张贤亮 13.2075304714
+拗性 13.900677652
+聂政 12.1089181827
+答辩会 13.900677652
+开秤 13.2075304714
+罢兵 10.0088573539
+没效 13.900677652
+素馨花 12.5143832909
+杨柳风 13.2075304714
+孵雏 12.8020653633
+战车团 12.5143832909
+伯克郡 12.5143832909
+离不了 10.9562386728
+朱治 12.5143832909
+三声 9.30555780184
+配合默契 10.6818018271
+弯到 12.5143832909
+士亦 12.8020653633
+机修车间 12.8020653633
+东方电机厂 12.8020653633
+深井 10.1630080337
+主动脉瘤 12.8020653633
+月经血 12.8020653633
+五家 9.01787572939
+许宏涛 10.765183436
+财政厅长 12.2912397395
+船到桥头 12.2912397395
+旧年 10.0720362555
+七十名 13.2075304714
+拉皮手术 12.8020653633
+贼人胆虚 13.900677652
+十二棵 13.2075304714
+粘稠度 11.5027823792
+深于 11.9547675029
+阿尔高 12.5143832909
+平纹 10.533381822
+高耐磨 13.900677652
+六千 10.533381822
+美发店 13.900677652
+五官 8.87023973058
+望秦明 12.8020653633
+博莱罗 13.2075304714
+医治创伤 13.2075304714
+何家槐 13.2075304714
+孙飞虎 13.900677652
+座落在 11.2616203224
+深交 11.598092559
+文教卫生 10.642581114
+案语 13.2075304714
+平级 11.598092559
+照常上课 13.2075304714
+杳无信息 13.2075304714
+通窍 12.2912397395
+移山 10.533381822
+列希 13.900677652
+炉丝 13.900677652
+羹食 13.2075304714
+五寸 10.2117981979
+郁久化 13.900677652
+平绒 11.8212361103
+绳网 13.900677652
+直瞪瞪 11.4157710022
+簪花 11.2616203224
+撩拨 9.54396882529
+炉上 12.1089181827
+人事司 12.8020653633
+直达声 12.5143832909
+深仇 12.2912397395
+世宗 9.43476953332
+招生简章 13.2075304714
+料想到 11.1926274509
+卤味 12.1089181827
+路祭 13.2075304714
+信文 12.5143832909
+双子叶 8.63798746307
+图形界面 12.8020653633
+一去不回 10.9562386728
+澳头 12.5143832909
+连衣裙 10.0088573539
+弯去 12.8020653633
+明川 10.765183436
+世家 8.30225569298
+世宽 10.8096351986
+十四年 7.9817837977
+郑裕玲 13.2075304714
+通风井 13.900677652
+伊丝塔尔 12.8020653633
+祖伊 12.8020653633
+警狗 13.900677652
+优雅风度 13.900677652
+没搬 13.2075304714
+关心群众 12.8020653633
+世子 10.1164880181
+大龙邮票 13.900677652
+阿尔马 11.9547675029
+波蕾若 13.2075304714
+斯二世 10.9562386728
+世孙 9.94943393339
+九十九件 13.900677652
+尼克索 13.2075304714
+评委 9.5186510173
+彩色片 12.1089181827
+优胜队 13.2075304714
+趋缓 9.4233408375
+缴付 10.9562386728
+深为 8.6966709649
+以词害意 13.900677652
+枫叶 10.6818018271
+梦过 13.900677652
+成分论 13.2075304714
+冯简子 13.900677652
+美发师 12.8020653633
+梅耶尔 13.2075304714
+花车游行 13.2075304714
+王为姬 12.8020653633
+回马枪 10.4349417492
+捻起 13.2075304714
+遛弯儿 13.2075304714
+物理模式 13.2075304714
+三菱公司 13.2075304714
+刀叉 11.5027823792
+耶尔森 13.2075304714
+国土资源厅 10.5684731418
+灵太后 12.5143832909
+澳大利亚广播公司 13.2075304714
+蹦蹦 11.1280889297
+杨大人 11.0103058941
+消歇 13.900677652
+梭子鱼 10.533381822
+毛贵原 13.2075304714
+律政司 11.8212361103
+民政厅 11.1926274509
+作奇 13.900677652
+五字 11.598092559
+若不慎 13.900677652
+从建州 13.2075304714
+五子 11.5027823792
+拖家带口 12.8020653633
+通稿 11.9547675029
+揽权 11.5027823792
+但少平 11.3357282945
+乌维拉 13.900677652
+风栗 13.2075304714
+发些 11.8212361103
+不虔诚 13.900677652
+压卷之作 12.2912397395
+解放军艺术学院 12.2912397395
+臭骂 9.87532596124
+诸强国 11.7034530746
+挚情 13.2075304714
+曲江 9.69598503258
+曹宫 13.2075304714
+明度 11.2616203224
+希夷 12.2912397395
+辣椒酱 11.598092559
+开笔 13.900677652
+各上 11.9547675029
+建陶 13.2075304714
+崇文门 10.1871055853
+地生兰 13.2075304714
+稗官 12.2912397395
+锌白 13.2075304714
+日益增长 9.28555713513
+科因 12.5143832909
+商瞿 13.2075304714
+一百六十五辆 13.900677652
+商业部 12.2912397395
+曲池 13.900677652
+孝悌忠信 13.900677652
+潘承洞 12.2912397395
+景况 9.84023464143
+通称 7.28461246684
+夏国建国 13.2075304714
+开笼 12.8020653633
+蹦跳 10.1394775363
+超合金 13.900677652
+于冢宰 13.2075304714
+零七个 12.2912397395
+七十块 12.2912397395
+年值 13.900677652
+五声 10.5684731418
+自娱 10.604840786
+明建 10.5684731418
+开筑 13.900677652
+棒疮 11.598092559
+巨蛋 13.900677652
+明廷 10.0088573539
+曲水 11.1926274509
+厄加勒斯角 12.2912397395
+地利 9.44633035572
+爱妃 11.0103058941
+包租 11.1926274509
+组织细胞 9.94943393339
+人工关节 11.5027823792
+肺俞 13.2075304714
+同调代数 12.2912397395
+开筵 12.8020653633
+秦必楚 13.900677652
+中国解放军 13.900677652
+盎格鲁 10.3743171274
+改造社会 10.604840786
+从建康 12.8020653633
+佩尔戈 13.2075304714
+蛮族 9.5062284973
+会展业 11.8212361103
+反丁烯二酸 11.598092559
+富蕴 11.2616203224
+笔记本 8.66956903512
+楼惟一 13.2075304714
+眨巴 9.33632946051
+通神 11.0103058941
+刘锡为 13.2075304714
+余怒未消 12.8020653633
+曲泉 13.900677652
+明师 12.2912397395
+附注 10.9562386728
+通票 12.5143832909
+商禅臣 13.2075304714
+祖大乐 11.7034530746
+美人迟暮 12.8020653633
+没有 3.11282356515
+曲泽 13.2075304714
+移徙 11.9547675029
+马一合 13.2075304714
+饥饿感 11.5027823792
+品味 9.20932976975
+再现部 12.5143832909
+望风而靡 13.2075304714
+妹子 8.46259834305
+免战牌 13.900677652
+移往 11.4157710022
+明帝 9.62401153296
+曲波 11.7034530746
+商业贷款 9.59661255877
+忽而 9.85762638414
+傅雷 12.2912397395
+平素 9.06439574502
+素面朝天 13.2075304714
+抱残守缺 12.2912397395
+园艺产品 13.900677652
+乌库尔 13.2075304714
+没来 8.60236028543
+开篇 10.7226238216
+蹦起 11.598092559
+板起 11.1280889297
+司铎主 13.900677652
+太极拳 9.93038573842
+王长林 12.1089181827
+十二次 11.1280889297
+货币量 9.26594866375
+忧患与共 13.900677652
+地方军 10.7226238216
+曲沃 11.7034530746
+拟将 9.5062284973
+施莱格尔 12.2912397395
+东武城 11.7034530746
+明年 5.08723915745
+右倾 9.01787572939
+希姆 13.2075304714
+没权 11.3357282945
+子安 11.9547675029
+闻讯赶来 10.2897597393
+位移电流 11.1926274509
+横笛 11.1926274509
+横笔 13.900677652
+磨细 10.7226238216
+建隆 10.533381822
+往下沉 11.5027823792
+世界妇女大会 11.8212361103
+拟就 10.6818018271
+大型活动 10.4994802703
+音乐部 12.8020653633
+斜拉桥 10.4349417492
+黄瓜汁 13.900677652
+安装时间 13.900677652
+邮件 8.94485059437
+扬子鳄 10.2117981979
+汇川 13.2075304714
+星龙渊 13.2075304714
+平粜 13.2075304714
+保津川 13.2075304714
+一丛丛 11.0103058941
+乱说话 11.9547675029
+模拟出 12.5143832909
+建面 12.1089181827
+硫化亚铁 13.2075304714
+神经质 9.74179456862
+曲流 10.4041700905
+风格化 13.900677652
+卡尔达 12.2912397395
+燕四儿 13.2075304714
+聊天儿 12.8020653633
+窦宪 10.9562386728
+明德 10.4041700905
+各举 11.9547675029
+施粉黛 12.1089181827
+往下流 10.4666904475
+郑嘉栋 12.2912397395
+横竖 8.89673134603
+英亲王 10.9562386728
+一文不值 11.2616203224
+锌皮 12.5143832909
+宁沪高速 11.0674643079
+二百多米 13.900677652
+率众 8.86372504956
+杰赤 11.598092559
+绳索 8.26232298264
+移师 10.8096351986
+民政党 13.900677652
+寒证 10.4994802703
+宋红 12.8020653633
+明快 9.03314320152
+夏王陵 12.1089181827
+宋约 12.2912397395
+刀光 10.9049453784
+夏眠 11.7034530746
+香水梨 13.2075304714
+流水线 9.91169360541
+手续费 8.37522471284
+檀香 10.1871055853
+情有独钟 10.0294766411
+对流层 9.93038573842
+望式昼 13.2075304714
+灼烧 10.5684731418
+明心 11.2616203224
+一小堆 11.7034530746
+图波列夫 11.2616203224
+中南局 11.5027823792
+刀具 9.33632946051
+刀兵 9.94943393339
+马可波罗 12.2912397395
+明志 11.0674643079
+创办者 11.0674643079
+横空 10.4041700905
+阿尔顿 12.8020653633
+质优价廉 12.8020653633
+楚汉相争 11.0674643079
+王莽军 13.2075304714
+开窍 9.5186510173
+周而复 12.8020653633
+开窗 9.91169360541
+五天 8.5488195185
+五大 7.30353195009
+杜荀鹤 11.9547675029
+令人生畏 10.8561552143
+高台跳水 11.7034530746
+五夜 11.1926274509
+出鬼入神 13.2075304714
+蓄水量 9.43476953332
+更须 11.0674643079
+明式 11.8212361103
+牢实 13.900677652
+蒙脸 11.9547675029
+江油市 11.1280889297
+灼烫 12.2912397395
+顾曲周郎 13.2075304714
+吴狗 12.8020653633
+舒同 13.2075304714
+马约 11.4157710022
+五处 10.1394775363
+二流子 10.4666904475
+山神庙 10.3743171274
+旧市 13.2075304714
+七十四 10.765183436
+明光宫 12.8020653633
+五好 11.3357282945
+大中小 9.12155415886
+简言之 10.5684731418
+不谙世事 11.7034530746
+拐拐 13.900677652
+学习机 12.5143832909
+明彻 12.8020653633
+满够 13.900677652
+世外 10.604840786
+二三百户 13.2075304714
+印花机 12.8020653633
+上海音乐学院 10.9562386728
+捻转 11.5027823792
+敌对态度 11.9547675029
+盐析 13.900677652
+杉村春子 12.5143832909
+尼奥罗 13.900677652
+平米 8.41588071849
+五套 11.598092559
+开端 8.31718134319
+平籴 11.598092559
+弯儿 10.4349417492
+匹夫匹妇 13.2075304714
+工作温度 10.765183436
+生猛海鲜 12.5143832909
+官民田 12.2912397395
+晨练 11.2616203224
+秘密警察 11.598092559
+斯科夫 12.1089181827
+明光宗 12.8020653633
+黑衣服 12.1089181827
+跨海大桥 11.598092559
+七十多 11.0674643079
+刀币 11.1280889297
+中南区 12.8020653633
+杭氏 11.2616203224
+十二日 9.75754292558
+排上去 13.900677652
+金皇帝 11.2616203224
+平王 11.3357282945
+盛过 12.8020653633
+十二时 11.5027823792
+阿尔韦 13.900677652
+黑沉沉 9.85762638414
+魔术队 13.2075304714
+红脉弦 13.2075304714
+通知 6.04281009264
+运输联系 13.2075304714
+臭钱 11.9547675029
+性病学 13.900677652
+平纬仪 12.8020653633
+激励性 13.2075304714
+双子座 11.1280889297
+磁阻 11.8212361103
+牛腿琴 12.5143832909
+四十公斤 13.900677652
+拟办 13.900677652
+央告 9.84023464143
+方波 11.7034530746
+分期付款 10.0294766411
+王为君 13.900677652
+十二斤 12.8020653633
+立脚点 12.2912397395
+杭汉 7.73316116109
+僧人 7.99531580392
+劣质奶粉 13.900677652
+水速 13.900677652
+移入 9.49395840471
+简大狮 13.2075304714
+迪乔瓦 13.2075304714
+有失体统 12.2912397395
+外币单位 13.2075304714
+特斯科 13.900677652
+伍连德 12.8020653633
+五回 13.2075304714
+阉人 11.5027823792
+五四 8.9519177616
+弯度 12.1089181827
+货运 8.46695564842
+盛达 11.598092559
+筹商 13.2075304714
+巴富尔 12.8020653633
+稳步前进 11.2616203224
+比利时政府 11.8212361103
+时代风气 12.8020653633
+黄巢起义 10.1164880181
+防身 9.75754292558
+十四卷 12.1089181827
+老老 11.3357282945
+开疆 12.5143832909
+大中华 10.4041700905
+继父 10.3453295905
+献技 11.8212361103
+十面 11.5027823792
+荣任 11.8212361103
+耆老 12.5143832909
+花椒 9.49395840471
+西班牙政府 11.3357282945
+慧珠 10.2371160058
+小驿 13.900677652
+战连胜 13.900677652
+特派团 13.900677652
+水缸 9.5062284973
+杰赫勒 13.900677652
+丁拱辰 13.2075304714
+偿付能力 9.82314020807
+绝缘材料 9.82314020807
+往下拉 11.4157710022
+帕子 10.0720362555
+和衣而睡 13.2075304714
+贮存器 12.8020653633
+此类情况 11.9547675029
+心不变 13.900677652
+愆期 13.2075304714
+石羊河 11.0103058941
+曾仲鸣 13.2075304714
+亚马孙 10.2897597393
+神经节 10.8096351986
+一神教 11.5027823792
+十二支 12.1089181827
+圆体 12.8020653633
+车尾灯 12.8020653633
+世嘉 10.8561552143
+曲折 7.29673382738
+金代董 12.8020653633
+虚晃 12.8020653633
+嘲笑者 13.2075304714
+菲亚特集团 12.8020653633
+可好了 10.3453295905
+希基 13.2075304714
+板荡 12.8020653633
+胸像 11.3357282945
+十四只 13.900677652
+横生 10.0088573539
+言官中 12.8020653633
+吴月琴 10.0940151622
+拟制 10.6818018271
+解放以后 10.9562386728
+连累到 12.5143832909
+花容玉貌 12.8020653633
+惠普公司 12.2912397395
+物化 9.16447920358
+十四号 13.2075304714
+开球 11.1926274509
+安民告示 11.5027823792
+不提也罢 12.1089181827
+阿斯勒 13.900677652
+焦山 11.0674643079
+虚构 8.98069672615
+北约集团 11.9547675029
+庄宅 11.9547675029
+助您 12.8020653633
+发表谈话 10.604840786
+通盘 11.3357282945
+鱼食 11.9547675029
+学术期刊 13.2075304714
+捧上天 13.900677652
+庄宗 10.9562386728
+乐善好施 11.0103058941
+女超 13.900677652
+僧俗 10.8561552143
+牙周袋 12.5143832909
+爸妈 9.45802639549
+三堂 11.598092559
+唯物主义者 9.98865464655
+三万四千元 13.2075304714
+空谈家 12.8020653633
+庄客 8.61241062128
+把桶 11.8212361103
+桃李争妍 12.8020653633
+麦春华 13.900677652
+维语 11.8212361103
+甘布林 13.900677652
+左方 11.1926274509
+庄家 8.78268383956
+拟古 11.0674643079
+几百千米 10.8561552143
+帅臣亦 13.2075304714
+脏腑 8.59240995457
+天然屏障 9.84023464143
+王颖入 13.2075304714
+宋江扶 12.5143832909
+明凯 13.900677652
+一十五名 13.900677652
+齿龈 11.9547675029
+错误信息 10.5684731418
+不孕症 10.8561552143
+一泡 9.89334446674
+僧侣 8.76487921493
+五千万两 13.2075304714
+宽城县 12.8020653633
+钮先钟 13.900677652
+首歌曲 11.0674643079
+挤进去 11.5027823792
+实现理想 12.2912397395
+全球排名 11.5027823792
+蛮横 9.53122979951
+钟丽缇 12.5143832909
+革命军人 11.0103058941
+颜筋柳骨 13.2075304714
+明净 10.0088573539
+走上正轨 11.4157710022
+成合子 13.2075304714
+表示祝贺 10.604840786
+五城 9.85762638414
+进销存 13.900677652
+杭海 13.2075304714
+刀影 13.2075304714
+沙雅县 12.2912397395
+布尔戈斯 12.8020653633
+三堰 12.8020653633
+分洪道 11.5027823792
+新安江 10.1871055853
+诸吕之 12.2912397395
+龇牙裂嘴 13.900677652
+第一盏 13.2075304714
+玉露生 13.2075304714
+懒腰 10.2371160058
+女贞 10.9562386728
+柳叶眉 11.9547675029
+圆丘 13.2075304714
+山阴县 11.598092559
+司命 11.5027823792
+曹任西 13.2075304714
+殷士瞻 13.900677652
+偶然误差 12.8020653633
+北郊区 11.598092559
+明儿 8.33233314821
+发包方 13.900677652
+办证 9.84023464143
+忻芮 13.2075304714
+弓弦勒 13.900677652
+施特劳斯 10.5684731418
+夏种 13.900677652
+夏秋 9.04864738806
+湮灭 11.2616203224
+擦过去 12.2912397395
+调解 8.15128466607
+美好心愿 13.2075304714
+弯形 12.8020653633
+晨炊 13.900677652
+肠道 8.79473217808
+健全法制 12.8020653633
+泼剌 12.8020653633
+经久不散 12.1089181827
+粱山 13.2075304714
+关陇川 13.2075304714
+没钱买 10.9562386728
+泼到 10.642581114
+横琴 11.5027823792
+阿达莫夫 12.2912397395
+僧伽 10.765183436
+败血病 13.900677652
+更阑 13.900677652
+来日大难 13.2075304714
+眨动 11.4157710022
+平版 12.1089181827
+夏禹 10.3171587135
+希图 10.1871055853
+种牛 12.8020653633
+弯弓 10.3171587135
+明兵 10.4666904475
+庄子 8.74162235276
+行李厢 11.8212361103
+弯弯 10.6818018271
+消费品 7.37271973435
+不失时机 9.29550746599
+海外经营 12.1089181827
+白日做梦 11.4157710022
+五块 9.48183704418
+建馆 12.2912397395
+往下掉 9.93038573842
+环肽 13.900677652
+哈佛大学医学院 13.2075304714
+黄新 13.900677652
+构造旋回 12.5143832909
+模拟式 11.598092559
+维修部 12.5143832909
+邓子龙 13.2075304714
+结论 6.96142370593
+壁球 12.5143832909
+高水头 11.9547675029
+通病 10.8096351986
+第一盘 12.2912397395
+泼出 11.8212361103
+农林厅 13.900677652
+助推 8.15128466607
+花棒 11.5027823792
+刀尖 10.0294766411
+公余之暇 13.900677652
+迪亚士 11.5027823792
+任皇后 13.900677652
+聋儿 13.2075304714
+并论 12.5143832909
+驻颜益寿 13.900677652
+居西京 13.2075304714
+教派主义 12.8020653633
+机械类 12.5143832909
+托起来 12.2912397395
+特派员 8.96620371885
+招法 11.2616203224
+民政局 9.7898037878
+许美静 13.900677652
+科氏力 13.900677652
+弭兵 11.2616203224
+淋漓尽致 9.37888907493
+唐努图 13.2075304714
+若要人不知 12.2912397395
+样本股 9.74179456862
+帕姆 12.5143832909
+开眼 10.3171587135
+贾鲁河 10.2117981979
+省农科院 11.9547675029
+慷慨陈词 10.2371160058
+于宗敏 13.2075304714
+第一目 13.900677652
+贾鲁治 12.8020653633
+白氏 10.0720362555
+蒽油 13.2075304714
+一首歌 10.642581114
+念尔 12.8020653633
+敬信 12.1089181827
+结语 11.7034530746
+失业人数 9.94943393339
+十二架 13.900677652
+王传福 9.93038573842
+机制化 11.7034530746
+髭毛 13.900677652
+西海岸 8.98802276624
+捉生替死 13.900677652
+摊位 9.74179456862
+换热器 11.5027823792
+宋玉 11.0103058941
+吉利区 11.5027823792
+挂件 11.5027823792
+没毒 12.8020653633
+破纪录 11.8212361103
+没比 13.900677652
+蜡版 13.900677652
+单音字 13.900677652
+结识 8.23425096386
+五品 9.08039608637
+绸缪 11.3357282945
+淋浴房 12.8020653633
+锦帐 11.2616203224
+板脸 13.900677652
+移去 11.4157710022
+磁针 10.3453295905
+英格兰银行 8.83177344976
+塔城市 12.1089181827
+盛赞 10.4349417492
+挂上 13.2075304714
+老样子 10.2371160058
+防不胜防 9.89334446674
+乔儿 11.4157710022
+中下程度 13.900677652
+诸川流 13.2075304714
+隆重举行 10.0505300503
+机械系 11.5027823792
+磁钢 12.2912397395
+盛起 12.5143832909
+民用产品 11.7034530746
+败柳残花 13.900677652
+匹练 13.2075304714
+消费型 10.9049453784
+上台演讲 13.900677652
+北京郊区 11.4157710022
+挂个 10.642581114
+爱惜羽毛 13.900677652
+中央警卫局 13.900677652
+工作部 11.1926274509
+五名 9.08039608637
+明初 8.40761620864
+娑婆 13.2075304714
+育空河 12.1089181827
+帕奇 12.5143832909
+横着 9.89334446674
+个人特长 13.2075304714
+磁铁 9.54396882529
+五味 10.0720362555
+忍苦耐劳 13.900677652
+带我去 9.75754292558
+怀里 7.10050758367
+头破血出 13.2075304714
+没死 9.38981814546
+惊人之举 12.5143832909
+站稳 7.93967231235
+张珏 11.4157710022
+通用 6.56439199195
+十二月 7.79365476423
+帕多 11.8212361103
+韩昌黎 12.5143832909
+腌渍 11.1280889297
+人事局 10.7226238216
+加热炉 11.5027823792
+安茨 12.8020653633
+香蕉园 12.8020653633
+帕夏 11.1280889297
+寒假作业 13.2075304714
+横眉 13.900677652
+炼锌厂 13.2075304714
+篇简 13.900677652
+自由自在 9.49395840471
+离过婚 12.5143832909
+路盲 13.2075304714
+索科洛夫 11.7034530746
+天之云 13.900677652
+补肾阳 11.2616203224
+贵事 13.900677652
+黄公略 12.2912397395
+横直 11.7034530746
+庄妇 13.2075304714
+憔悴 8.56313957227
+虚文 12.2912397395
+投入品 10.9049453784
+慈善会 12.5143832909
+金箔纸 13.900677652
+无序 8.91707103027
+衬套 11.8212361103
+平炉 10.4994802703
+伯巴赫 13.2075304714
+雨季 8.63798746307
+无所不用 13.2075304714
+氯苯 11.0674643079
+木母 10.9562386728
+丧葬 9.5186510173
+土特产品 8.81308131674
+拟出 10.2371160058
+跳跃性 11.0103058941
+南湖大山 11.2616203224
+齐鲁石化 13.2075304714
+坦桑尼亚联合共和国 12.5143832909
+吴江派 11.9547675029
+物像 11.9547675029
+讨米 13.2075304714
+壁画 7.41147272065
+千斤重担 11.1926274509
+焊管 12.2912397395
+獬豸 11.4157710022
+肆意横行 12.2912397395
+乌羊王 9.20932976975
+舒声 13.900677652
+化学工业 8.29120585679
+德布雷 12.8020653633
+过往车辆 11.598092559
+司合 13.900677652
+五氯酚钠 13.2075304714
+版型 13.2075304714
+一九七九年 11.5027823792
+董都监 13.2075304714
+小康水平 11.2616203224
+明史 9.30555780184
+曲意 11.4157710022
+磁镜 12.8020653633
+板胡 10.8096351986
+司吏 12.1089181827
+木下顺 12.5143832909
+写字间 12.8020653633
+香冢飞 13.2075304714
+向贾珍 12.1089181827
+左旗 11.5027823792
+虚无 9.40086798165
+杨柳青 10.1871055853
+同案犯 11.8212361103
+销售总额 10.2117981979
+佩洛塔斯 12.8020653633
+富余 10.2630914922
+明叔 7.14374526273
+加奈隆 13.900677652
+开白 13.2075304714
+四七年 12.2912397395
+闪蒸 13.900677652
+开皇 9.69598503258
+紧身衣裤 13.900677652
+版块 10.6818018271
+无名小卒 11.8212361103
+颠倒阴阳 13.900677652
+臧懋循 12.8020653633
+工作量 9.34680076038
+睾酮 10.7226238216
+延春阁 12.5143832909
+棒硬 13.900677652
+回收公司 11.7034530746
+移动 6.53233796566
+吊起来 10.4994802703
+调试 9.17328983326
+萨基亚 13.2075304714
+助战 9.45802639549
+饬令 11.7034530746
+江东父老 12.8020653633
+庄太 13.900677652
+怪调 13.2075304714
+拟具 13.2075304714
+左膀右臂 11.3357282945
+及早准备 12.5143832909
+铁路运输 8.89004235788
+磨煤机 13.2075304714
+紧握住 11.2616203224
+纷纷不一 13.2075304714
+单行本 10.3453295905
+天随人愿 13.900677652
+除眼袋 13.2075304714
+楞次 11.5027823792
+虚收 13.2075304714
+新墨西哥州 10.8561552143
+腔儿 11.8212361103
+亿头 12.2912397395
+缀集 13.2075304714
+长安街 10.1164880181
+挂住 10.6818018271
+环节 7.11509000697
+锦帛 12.2912397395
+惦挂着 13.900677652
+开盘 6.49154120806
+消费国 9.69598503258
+同对 12.8020653633
+物候 10.8096351986
+章行严 13.900677652
+时布云 13.2075304714
+寿险业 12.1089181827
+调训 13.2075304714
+刀工 11.598092559
+金水区 9.22784881751
+路矿 10.765183436
+非专利 12.5143832909
+助手 8.14810501315
+动力伞 11.8212361103
+六库镇 13.2075304714
+入点 13.2075304714
+庄奴 12.8020653633
+鱼科旗 13.2075304714
+遮羞布 11.598092559
+吉米 9.29550746599
+挑大梁 11.2616203224
+民本主义 13.2075304714
+信条 9.35738286971
+酒儿 12.2912397395
+财政状况 9.84023464143
+坎儿 10.765183436
+逃离现场 11.7034530746
+盐池 9.62401153296
+越野车 9.66657114738
+亚尔果斯 12.5143832909
+五加 10.9049453784
+玄德随 13.2075304714
+舒徐 12.8020653633
+五力 12.8020653633
+卡萨布兰卡 10.6818018271
+于千泉 13.2075304714
+书香人家 12.8020653633
+没消 12.5143832909
+甄选 10.765183436
+王颖合 13.2075304714
+肥胖病 12.2912397395
+樊榭 13.900677652
+增置 10.1871055853
+协会 6.37449873863
+中国人民银行总行 12.2912397395
+沈心工 13.2075304714
+柳叶状 13.2075304714
+冯国用 13.2075304714
+生张汉 12.8020653633
+宋鬼 13.2075304714
+大中型 8.19356738723
+戏彩娱亲 13.900677652
+女裙 12.8020653633
+马鸿逵 13.2075304714
+晓松 11.7034530746
+盐水 9.34680076038
+希卡 13.900677652
+调调 11.7034530746
+慧眼 10.642581114
+一季度 7.19994654243
+秦安县 11.9547675029
+乐学中 12.5143832909
+华为 9.93038573842
+虚拟 8.39534611604
+蔡葵 13.2075304714
+圈住 12.8020653633
+哀矜 13.900677652
+清嘉庆 10.0940151622
+华丰 12.8020653633
+评论者 11.8212361103
+明哲 10.9562386728
+调谐 10.8096351986
+十四块 13.900677652
+马冲进 12.8020653633
+女装 10.2897597393
+揭幕仪式 13.900677652
+路灯 8.99540287354
+世务 11.8212361103
+四千年 11.9547675029
+曾起兵 13.2075304714
+狂放不羁 12.1089181827
+运旺时盛 13.900677652
+迷阵 13.900677652
+中签率 7.55679721785
+贾孝骞 13.900677652
+华东 7.73316116109
+百香果 13.900677652
+舒心 9.89334446674
+庄廷 13.2075304714
+发挥所长 13.2075304714
+拔开 11.4157710022
+女裤 10.7226238216
+合并案 11.7034530746
+助攻 10.765183436
+相似 6.46642026984
+宿迁县 13.2075304714
+怡然自得 11.3357282945
+球轴承 13.2075304714
+变形记 11.5027823792
+盐泽 11.1926274509
+乱骂 10.8096351986
+舒张 9.63799777493
+黄怀玉 13.2075304714
+胡尔达 12.8020653633
+结账 9.62401153296
+应对得体 13.2075304714
+子摇摇 13.900677652
+瑞典文 13.900677652
+肌肽 13.900677652
+曲曲 11.1926274509
+盐法 9.45802639549
+五列 12.2912397395
+晓林 11.8212361103
+本位主义 11.9547675029
+五刑 10.4349417492
+明君 10.8096351986
+舒开 11.8212361103
+没洗 11.4157710022
+五分 9.12155415886
+叶家集 11.8212361103
+宋留 13.2075304714
+盐泉 12.1089181827
+老说是 13.900677652
+踢下去 12.8020653633
+五十五 11.5027823792
+夏粮 10.5684731418
+年羹尧 11.0674643079
+华亭 10.4994802703
+言相告 10.8096351986
+个体经营者 11.8212361103
+蛙皮素 13.900677652
+盐沼 11.2616203224
+世变 11.5027823792
+华人 8.48457724977
+衬底 10.642581114
+旁系亲属 11.9547675029
+献曝 13.2075304714
+瘦金体 13.2075304714
+宋画 12.1089181827
+为我所用 10.8561552143
+难遇 11.9547675029
+樊楼 11.0674643079
+一千六百五十 13.2075304714
+泣鬼神 11.9547675029
+秦安北 12.2912397395
+难民营 12.2912397395
+两百五十余 13.2075304714
+奥氏体 11.1926274509
+烁石流金 13.900677652
+篮球联赛 13.2075304714
+丙基 12.2912397395
+酸碱值 12.8020653633
+王方翼 12.5143832909
+理学博士 10.765183436
+五县 10.8096351986
+梦蝶 13.900677652
+断崖绝壁 13.2075304714
+观光事业 13.900677652
+世友 12.8020653633
+色雷斯 10.2630914922
+郑经部 13.2075304714
+明喻 13.900677652
+世叔 11.3357282945
+左云县 12.8020653633
+没油 12.5143832909
+没治 11.9547675029
+呆板 9.75754292558
+原子理论 11.3357282945
+晓春 13.900677652
+五原 9.63799777493
+武器装备 7.91422564669
+丁建阳 12.5143832909
+晓星 12.2912397395
+虚掩 9.77354326693
+曲松 13.2075304714
+一瘸一拐 10.7226238216
+二三卷 13.2075304714
+双子宫 13.2075304714
+晓明 11.598092559
+筹借 11.8212361103
+工作面 10.8096351986
+清炖鱼 13.900677652
+毕纳依 12.8020653633
+调走 10.7226238216
+很多根 13.2075304714
+青藏公路 10.1164880181
+华佗 9.84023464143
+卸去 10.1630080337
+平盘 9.5062284973
+高水平 7.95003509939
+五叶 12.5143832909
+女角 12.5143832909
+臭老九 12.2912397395
+山梨县 13.2075304714
+五台 10.0720362555
+天南地北 10.7226238216
+七味 13.2075304714
+刀子 8.29487558568
+晓晨 11.3357282945
+五只 9.98865464655
+固体物理 10.9562386728
+盛誉 9.94943393339
+阿姆利 11.3357282945
+言行一致 11.5027823792
+五口 9.91169360541
+革命志士 11.8212361103
+慢性子 11.4157710022
+调质 12.5143832909
+方氏 11.598092559
+周公庙 10.4349417492
+追思会 12.5143832909
+晓晓 12.2912397395
+涅曼河 11.598092559
+行业类别 11.8212361103
+晓晖 12.2912397395
+平直 8.85725253506
+涉及 5.8866726572
+没法 7.40995411747
+多动症 12.2912397395
+曲本 11.3357282945
+西航 11.3357282945
+备齐 11.4157710022
+碳纳米管 12.8020653633
+五匹 11.1926274509
+华信 11.8212361103
+开炉 12.1089181827
+曲柄 10.533381822
+冯国璋 9.96885201925
+电子枪 11.9547675029
+七十岁 10.3171587135
+叶铜矛 13.900677652
+通牒 11.8212361103
+受到限制 8.93783302172
+刀客 11.4157710022
+二十锭 13.2075304714
+那金刚 12.2912397395
+九载 12.1089181827
+周永年 10.4041700905
+世卫 10.4994802703
+开炮 9.87532596124
+宽宽 11.9547675029
+米尔斯 11.3357282945
+针织衫 11.9547675029
+舒布 13.900677652
+九轮 13.900677652
+雨声 9.65218240993
+世卿 11.7034530746
+华侨 8.61747392324
+冯和桂 13.2075304714
+曲林 12.2912397395
+二三百株 13.2075304714
+五卷 9.98865464655
+损人不利己 10.5684731418
+科学知识 9.61021821083
+数队 13.900677652
+托克托 11.9547675029
+虚损 11.1926274509
+五卫 12.2912397395
+华佗再造丸 13.900677652
+三好 12.5143832909
+机务段 10.9562386728
+宏源证券 9.03314320152
+楦子 12.8020653633
+协从 13.900677652
+没求 12.8020653633
+和土尔 13.900677652
+右半 11.5027823792
+帕帕 11.5027823792
+商亭 13.2075304714
+五华 10.8561552143
+丙国 13.2075304714
+倒也不 9.56994431169
+金属色 11.7034530746
+车前草 11.5027823792
+拉图尔 12.1089181827
+虽经 9.69598503258
+世医 11.8212361103
+五千 8.1641053545
+五十 8.25877058104
+乔纳斯 13.2075304714
+傅鹏 12.2912397395
+气壮如牛 12.5143832909
+张安国 12.8020653633
+写信人 11.9547675029
+磁选 12.8020653633
+耕作机具 12.5143832909
+玄德前 12.2912397395
+更重 9.40086798165
+无德无能 11.2616203224
+慷慨陈辞 11.8212361103
+金属膜 11.7034530746
+诸阳之 13.2075304714
+咸丰 8.45825994145
+磁通 10.0505300503
+捆上 11.0674643079
+杨正泉 13.900677652
+厄尔尼诺 10.604840786
+计其功 13.2075304714
+盐湖 8.71889410168
+越野赛 12.2912397395
+立交桥 9.18217878068
+临去秋波 12.8020653633
+遗业 13.2075304714
+论斤 12.1089181827
+屈服于 10.2630914922
+心无挂碍 12.8020653633
+赵松乔 12.1089181827
+魏国攻 12.8020653633
+傅鹰 12.8020653633
+疏浚 8.81927328699
+卡笋 11.1926274509
+民田 9.77354326693
+路牌 10.9049453784
+虚惊 11.8212361103
+罪与罚 11.4157710022
+闪腰 12.5143832909
+磁道 13.2075304714
+明国 11.0103058941
+乐以忘忧 12.8020653633
+李长春 9.10488710638
+长信 9.31571017331
+嫩绿色 13.900677652
+中消协 11.9547675029
+整一整 10.765183436
+份文件 11.8212361103
+安定门 10.604840786
+卷帙浩繁 11.0674643079
+壁灯 11.4157710022
+阻带 13.900677652
+略图 9.87532596124
+稗史 12.2912397395
+哈诺贝 13.900677652
+闪耀着 10.2630914922
+石人俑 11.8212361103
+结过 11.7034530746
+民主评议 11.1926274509
+盐渍 10.3171587135
+千秋 9.10488710638
+咸亨 10.9049453784
+平生 8.13235665618
+景星庆云 13.900677652
+壁炉 10.9049453784
+二三百步 13.2075304714
+长伴 13.900677652
+虚怀 11.2616203224
+明四朝 12.8020653633
+吴江梅 13.2075304714
+夏绿 11.4157710022
+牙音 13.900677652
+废旧物资 12.5143832909
+盐滩 12.8020653633
+长传 12.8020653633
+禅语 12.8020653633
+越野跑 12.1089181827
+伪造证件 13.2075304714
+常年累月 12.1089181827
+希冀 9.7898037878
+光谱法 11.3357282945
+衣锦簇 13.2075304714
+赵雄 13.900677652
+开环 10.5684731418
+长休 13.2075304714
+五倍 9.89334446674
+锯子 11.1926274509
+没演 12.2912397395
+电磁波 8.5440913773
+希军 12.2912397395
+顺溜溜 13.900677652
+自奉 10.9049453784
+明器 8.3555002075
+鞍山市 11.0674643079
+盐溶 13.900677652
+云程万里 13.900677652
+玉如意 11.1926274509
+白纱裙 13.2075304714
+双子塔 12.8020653633
+石秀只 13.2075304714
+拟向 9.54396882529
+乱飞 9.91169360541
+北京市旅游局 12.8020653633
+藏污 13.900677652
+拟合 10.7226238216
+高林密 11.3357282945
+苏门答腊虎 13.900677652
+碎片 8.51160592216
+宽宏 11.1280889297
+石塔寺 13.900677652
+庄屯 13.2075304714
+盐源 11.9547675029
+步奏官 13.2075304714
+禅让 10.2117981979
+于和林 12.8020653633
+山之捷 12.2912397395
+宗纳女 13.2075304714
+哲人 10.765183436
+平畴 11.7034530746
+事件驱动 10.765183436
+死而不悔 13.900677652
+有名 6.93465346487
+通然 13.2075304714
+根据上述 9.94943393339
+北固亭 12.5143832909
+欢欢乐乐 13.900677652
+胶体金 13.900677652
+长人 13.900677652
+十四名 12.8020653633
+这颗 8.67493097826
+维修队 11.8212361103
+侯魏冉 13.900677652
+采样器 13.2075304714
+阿里斯顿 13.2075304714
+小登科 13.2075304714
+长亭 11.0674643079
+引开 10.1394775363
+澳华 13.2075304714
+盛装 9.75754292558
+支化 11.8212361103
+胆识过人 13.2075304714
+海尔集团 11.4157710022
+王莽复 12.8020653633
+单马锡 13.900677652
+包车费 13.900677652
+无幸 13.2075304714
+鹤声 13.900677652
+金冉冉 9.29550746599
+简洁明了 11.8212361103
+调转 10.7226238216
+程序库 12.5143832909
+调车 11.5027823792
+世凯 10.604840786
+长于 8.15447446144
+五册 12.5143832909
+艾合坦 13.2075304714
+十二招 13.900677652
+刀头 11.5027823792
+唐僧藏 13.2075304714
+物品 7.36543638096
+新闻自由 11.2616203224
+九路 9.12155415886
+筹划 7.71241352889
+阿马里 13.2075304714
+志大才疏 12.2912397395
+司马懿引 11.5027823792
+故纸 13.900677652
+没满 13.2075304714
+征管 9.89334446674
+吃了饭 9.20019728618
+五出 12.1089181827
+书归正传 13.900677652
+数家珍 13.2075304714
+慧琼 9.16447920358
+鹤嘴锄 13.900677652
+柳海龙 11.1926274509
+盐漠 12.2912397395
+子孙万代 11.7034530746
+豪萨族 13.900677652
+作如是观 12.1089181827
+五凤 11.3357282945
+罗将军 12.8020653633
+嫁鸡随鸡 11.0103058941
+十二把 13.2075304714
+藏汉 11.0103058941
+软骨病 11.5027823792
+马齐奔 13.900677652
+简体字 12.8020653633
+七十年 10.1871055853
+急剧下降 9.58318953844
+陶斋吉 13.900677652
+科幻电影 12.5143832909
+忽视 7.58531965045
+忽见 7.72481038187
+通点 13.900677652
+盛唐时 11.4157710022
+房明明 13.2075304714
+西三面 10.3171587135
+办货 12.1089181827
+焊缝 12.8020653633
+开犁 13.2075304714
+世兄 11.1280889297
+世充 11.9547675029
+七十四岁 13.900677652
+布雷舰 11.5027823792
+调过 11.2616203224
+长串 12.2912397395
+揽活 12.1089181827
+长丰 9.62401153296
+调进 10.4994802703
+圣地牙哥 13.900677652
+调运 10.1164880181
+宋白 12.2912397395
+盛行 7.31312763715
+舒尔 12.1089181827
+三天 6.94508504358
+执行命令 10.4666904475
+盛衰 9.29550746599
+唐纳森 12.8020653633
+老爷庙 12.2912397395
+人事处 11.1280889297
+民族服装 10.2117981979
+薛国观 9.69598503258
+国家工商行政管理局 13.2075304714
+青蓝色 11.5027823792
+一转瞬间 13.900677652
+紫河车 12.5143832909
+长上 10.8561552143
+长三 12.5143832909
+筹办 9.28555713513
+通灵 10.3171587135
+消费力 10.8096351986
+廓清 10.4666904475
+一混 12.8020653633
+屯留县 13.2075304714
+央及 11.1926274509
+防护网 13.2075304714
+近四百 11.8212361103
+编纂者 11.3357282945
+调较 13.2075304714
+死刑犯 10.8561552143
+里维特 13.2075304714
+桑葚 11.2616203224
+五关 11.598092559
+双翅目 10.1394775363
+栽跟头 11.2616203224
+国家知识产权局 11.1926274509
+曲文 11.1926274509
+五八 12.8020653633
+秧鸡 13.2075304714
+女附中 12.8020653633
+马蹄铁 11.9547675029
+连续剧 10.0088573539
+宗复奔 12.8020653633
+舒展 8.86372504956
+多一倍 10.9562386728
+惹出来 12.8020653633
+帕尔 10.765183436
+叉手 9.77354326693
+弯月形 13.900677652
+长乐 10.1871055853
+叶渚沛 13.2075304714
+亚马尔 12.2912397395
+聋哑 10.642581114
+中国林业 12.2912397395
+筹募 11.7034530746
+保障法 11.8212361103
+内史密斯 12.8020653633
+长久 7.64301006409
+弯头 12.2912397395
+防护罩 13.2075304714
+从建城 12.8020653633
+五亿 13.900677652
+更远 9.35738286971
+阮二人 11.7034530746
+更进 11.2616203224
+世仇 10.9562386728
+炉子 9.30555780184
+家族企业 10.642581114
+更近 10.0940151622
+表面抗原 10.8096351986
+赵博生 12.5143832909
+世仕 12.5143832909
+财大气粗 10.3743171274
+五亩 11.3357282945
+平邦彦 12.5143832909
+开洞 12.8020653633
+梗节 13.2075304714
+世代 8.25877058104
+袁牧之 12.1089181827
+傅聪 12.8020653633
+调遣 9.02548032877
+溪渠 13.2075304714
+五五 10.9562386728
+黄水仙 13.900677652
+猬毛 13.900677652
+五二 12.2912397395
+虚线 10.642581114
+铭记 10.3453295905
+长冈 12.5143832909
+拥有者 10.765183436
+深宫 10.3743171274
+颜阿骨 9.96885201925
+操执其 13.2075304714
+五份 12.8020653633
+翩翩少年 13.2075304714
+阿尔达 12.1089181827
+王孝杰 12.1089181827
+五件 10.9049453784
+调适 10.9562386728
+世事 8.48457724977
+长凳 10.6818018271
+三危山 12.1089181827
+千峰万壑 13.2075304714
+调速 10.4666904475
+两亿五千万法郎 13.2075304714
+安贫乐道 12.8020653633
+犹新 13.2075304714
+平毁 11.1926274509
+黥面 12.5143832909
+五代 7.48885938427
+婚姻观 12.8020653633
+学无止境 12.8020653633
+蓦然回首 12.2912397395
+五仙 12.5143832909
+王侍中 13.2075304714
+蓍草 11.598092559
+一成 8.85082164473
+偏置 12.1089181827
+世亲 10.5684731418
+自如 8.91707103027
+知情者 10.2371160058
+世人 7.95787827685
+花柄 11.7034530746
+刘峰岩 13.900677652
+丁下 13.900677652
+封雍国 13.2075304714
+挂名 10.8096351986
+吴淞青 13.2075304714
+五串 12.8020653633
+祖拜尔 11.8212361103
+五丰 12.1089181827
+孔周 13.900677652
+五中 11.4157710022
+五个 6.97410061875
+圆圆 9.77354326693
+圆圈 9.24671730182
+五两 9.63799777493
+岗位职责 11.8212361103
+卡西克 12.8020653633
+民意沸腾 13.900677652
+宋楼 12.1089181827
+原始股 10.3171587135
+八面风 13.2075304714
+禅门 11.2616203224
+克莱尔 10.3453295905
+五世 9.01787572939
+圆场 10.5684731418
+狗咬吕洞宾 12.2912397395
+开涮 11.598092559
+寿终正寝 10.7226238216
+对抗战 11.7034530746
+路沿 13.900677652
+武术指导 12.5143832909
+防护性 11.3357282945
+不避斧钺 13.900677652
+五下 12.2912397395
+堆龙德庆县 13.900677652
+五三 13.2075304714
+五万 8.6966709649
+曲端 12.8020653633
+横流 9.93038573842
+五一 8.99540287354
+五丁 13.900677652
+王子云 12.5143832909
+炕沿 9.65218240993
+捻须 11.4157710022
+莲塘 11.3357282945
+世上 7.35245854921
+长兴 9.37888907493
+马泰休斯 12.8020653633
+花柳 11.0674643079
+圆坟 13.2075304714
+鬼城 12.1089181827
+两万四千余吨 13.2075304714
+世世 11.4157710022
+精诚所至 13.900677652
+卡尔顿 13.2075304714
+世业 11.3357282945
+顽固立场 13.2075304714
+永遇乐 11.9547675029
+五乡 11.9547675029
+空气层 11.598092559
+五九 11.7034530746
+那小仙 12.2912397395
+黄武 11.0674643079
+华力 11.4157710022
+公交线路 9.94943393339
+邓皇后 12.2912397395
+平正 11.4157710022
+淡如水 12.1089181827
+长兄 9.71102290995
+平武 11.7034530746
+一十八位 12.1089181827
+方积 13.2075304714
+华卫 13.900677652
+三月中 12.1089181827
+吻下去 13.900677652
+调配 9.11318590919
+王二帅 13.2075304714
+三光政策 11.1926274509
+鄢陵之战 10.9562386728
+出席率 13.900677652
+合并症 10.0720362555
+李高瞅 13.2075304714
+煮起来 12.8020653633
+蛮牛 12.8020653633
+多一份 10.7226238216
+吕本中 12.2912397395
+幸运地 10.3453295905
+仵官 13.2075304714
+阿赞德 11.8212361103
+横波 10.4994802703
+摸进去 12.2912397395
+何超明 13.900677652
+梦魔 11.598092559
+叶赫那拉 12.2912397395
+塔娜醒 12.8020653633
+廖瑞鸿 11.2616203224
+杭甬 13.900677652
+掏耳朵 12.5143832909
+华升 12.2912397395
+谈婚论嫁 11.0674643079
+王听得 13.900677652
+五例 12.5143832909
+开水 8.50251495046
+梦魇 10.4349417492
+吃得住 12.8020653633
+排骨汤 11.8212361103
+祖宾 13.900677652
+华南 7.06656891316
+曲笔 12.5143832909
+牙床 10.6818018271
+世侄 12.2912397395
+没烧 11.598092559
+一百九十余 12.5143832909
+漂漂亮亮 11.5027823792
+曲笛 12.5143832909
+侯司徒 13.900677652
+杜峰 13.2075304714
+通源 12.8020653633
+开江 11.5027823792
+献策 7.93709830836
+跛足 11.598092559
+吃败仗 10.7226238216
+横沟 11.5027823792
+西斯科 13.2075304714
+系谱学 13.900677652
+仅此一次 12.8020653633
+蹦高 12.5143832909
+和菊韵 12.5143832909
+快死了 11.8212361103
+稽查员 13.2075304714
+死硬 11.2616203224
+烫烫 11.4157710022
+多一些 9.14708746087
+骑兵团 10.0940151622
+磁轴 11.7034530746
+建筑师 9.11318590919
+祖寺 12.2912397395
+惹草沾花 13.900677652
+寤寐 13.2075304714
+中医师 11.9547675029
+肠衣 11.0674643079
+化险为夷 10.4666904475
+确有其人 11.8212361103
+象蜗牛 13.900677652
+协助 7.07957017972
+成人文学 13.2075304714
+胸腺肽 13.900677652
+一所 7.81163277653
+之城 9.59661255877
+环食 12.5143832909
+汉英 12.2912397395
+环靶 13.900677652
+十二类 12.8020653633
+五伦 12.2912397395
+通湖 12.5143832909
+工作证 11.5027823792
+于黎阳 12.2912397395
+伸到 9.13850371718
+一切正常 9.75754292558
+横江 11.0674643079
+荣城 13.2075304714
+一二千两 13.2075304714
+棒打 10.9049453784
+中叙 12.8020653633
+宋案 13.2075304714
+估计不足 10.7226238216
+穷山恶水 12.5143832909
+贷方余额 13.900677652
+开河 10.765183436
+确有其事 10.3743171274
+宋桐 13.2075304714
+协力 9.74179456862
+萨内蒂 13.900677652
+急水溪 13.2075304714
+华发 9.66657114738
+言相契 13.2075304714
+李贵忙 12.8020653633
+希亚 11.9547675029
+安菲 12.1089181827
+信誓旦旦 9.91169360541
+樊瑞 9.84023464143
+转移因子 12.5143832909
+马监缺 13.900677652
+大户室 11.9547675029
+横水 13.900677652
+一扎 11.2616203224
+八五期间 11.7034530746
+多一两 12.8020653633
+华厦 12.1089181827
+华县 10.3453295905
+自启动 13.900677652
+祖孙 10.2371160058
+斯科伊 11.4157710022
+世传 11.5027823792
+西路 8.60236028543
+作息时间 11.7034530746
+希仁 12.8020653633
+天域 11.0674643079
+时症 12.8020653633
+通渠 13.900677652
+互操作 12.1089181827
+世伯 12.2912397395
+开泰 11.8212361103
+五位 9.15574552361
+多一丝 13.900677652
+路国贤 13.900677652
+长假 6.89579566226
+俄总统 11.8212361103
+辖治 11.8212361103
+高气 12.8020653633
+晓示 11.8212361103
+太夫人 11.5027823792
+深妙 13.900677652
+开封战役 13.900677652
+伯莎 13.900677652
+秦三国 12.5143832909
+那彪军 12.8020653633
+始兴县 12.8020653633
+开演 10.4666904475
+冷水性 10.8561552143
+非农 8.85725253506
+王为义 12.1089181827
+严重者 8.78268383956
+社交圈子 13.2075304714
+邦联 10.8096351986
+单行线 12.2912397395
+铝合金 8.85082164473
+铅笔画 12.1089181827
+官太后 12.2912397395
+羧甲基 13.900677652
+中号 11.7034530746
+末梢神经 11.8212361103
+电磁灶 11.5027823792
+南溪县 13.900677652
+九郡 10.8561552143
+三面体 13.900677652
+丑态毕露 13.900677652
+九部 11.1926274509
+施俊 12.2912397395
+傅色 13.2075304714
+长叹 8.69119149913
+拒绝者 13.900677652
+长号 11.3357282945
+太尉休 12.5143832909
+长史 8.98802276624
+乳链菌肽 13.900677652
+更趋 9.11318590919
+挂回 12.2912397395
+察觉到 9.36807815882
+宋殿 12.8020653633
+惠孟臣 13.900677652
+精白米 12.2912397395
+塔克文 12.8020653633
+孔府 10.6818018271
+通涨 11.0103058941
+平槽 13.2075304714
+孔庙 9.24671730182
+喜娘 12.5143832909
+东耶路撒冷 12.8020653633
+贝洛克 13.900677652
+风险性 10.2371160058
+长发 9.12999302751
+封建时代 9.84023464143
+舒三和 12.8020653633
+主要职责 9.85762638414
+有机可乘 11.0674643079
+冯惟敏 11.9547675029
+太乙三 13.2075304714
+搞笑版 13.900677652
+挽袖 11.7034530746
+王昌龄 11.1280889297
+通济 11.0674643079
+提过来 12.5143832909
+女队 12.5143832909
+九道 10.9049453784
+嵩山 8.63281949291
+北京大学数学力学系 12.5143832909
+焊成 13.2075304714
+通流 11.5027823792
+对抗性 10.765183436
+物业公司 9.28555713513
+阿尔赫 13.900677652
+深处 7.01721506556
+安倍晋三 13.900677652
+火力网 12.8020653633
+圈内 9.63799777493
+姑公 13.900677652
+重庆电信 13.2075304714
+金簪 11.598092559
+一清早 10.1630080337
+沈绿爱 8.41588071849
+绳梯 11.2616203224
+加热棒 13.900677652
+七八百年 13.900677652
+三都赋 13.2075304714
+火花放电 11.0674643079
+华储 13.900677652
+民族主义 8.37522471284
+闻吴 12.8020653633
+伪政权 11.0103058941
+逶迤 9.85762638414
+萧衍献 13.2075304714
+古杉 12.5143832909
+长卷 10.4666904475
+卡尔马 11.8212361103
+遣送回国 13.2075304714
+王应睐 12.5143832909
+九通 12.8020653633
+电磁炉 11.5027823792
+欺罔 11.9547675029
+帮派体系 13.2075304714
+加布里埃尔 13.900677652
+阿尔贡 12.8020653633
+缀连 12.8020653633
+士特 13.2075304714
+敌船 10.2371160058
+犹有 10.7226238216
+版主 12.1089181827
+公安消防 12.1089181827
+抖擞精神 10.0088573539
+阿尔贝 11.9547675029
+克里斯多 12.2912397395
+一找 10.2630914922
+糖豆 12.5143832909
+更贵 11.0674643079
+刘文秀 11.9547675029
+美国中情局 13.900677652
+张殷 12.5143832909
+深奥 9.5062284973
+电磁炮 11.7034530746
+茶饭不思 11.8212361103
+丁日昌 11.9547675029
+瓤子 11.7034530746
+长势 10.4349417492
+捕捉剂 13.900677652
+高堂生 13.2075304714
+克莱德 11.598092559
+卡西勒 12.8020653633
+信号情报 12.8020653633
+一技 11.8212361103
+二级相变 13.900677652
+女鞋 11.4157710022
+华兹 12.5143832909
+横滨 9.93038573842
+稚拙 10.9049453784
+金图 12.8020653633
+学习班 10.2117981979
+九里 10.6818018271
+路演 8.20358416547
+华兴 12.5143832909
+郭鼎堂 13.900677652
+政协常委会 13.900677652
+秧苗 11.0674643079
+华光 9.74179456862
+仪真 13.2075304714
+桓龀 12.1089181827
+横滚 12.5143832909
+全曲 10.765183436
+华元 12.8020653633
+敲上去 13.900677652
+开港 10.642581114
+禅院 11.0674643079
+物理现象 9.98865464655
+献礼 10.3453295905
+碳酸钙 9.66657114738
+焊接 8.44535653662
+审定 9.21854642485
+咸化 11.5027823792
+史莱克 13.2075304714
+翁飞自 13.900677652
+秀色可餐 12.1089181827
+深壑 10.9049453784
+义务献血 13.2075304714
+长勺 11.9547675029
+特斯拉 11.0103058941
+德庆 11.7034530746
+雷恩斯 13.900677652
+孔德 10.2371160058
+比较突出 9.62401153296
+恶仗 11.7034530746
+流散 9.94943393339
+忽闻 9.5186510173
+高年级 11.4157710022
+祖姑 12.8020653633
+黄瓜秧 13.900677652
+乐进引 13.2075304714
+半架 12.2912397395
+班固积 13.2075304714
+横溢 11.2616203224
+忽闪 10.5684731418
+布雷默 13.2075304714
+建设厅长 12.8020653633
+献祭 10.1871055853
+一抓 10.604840786
+双鸭山 11.0674643079
+瓦勒拉 12.1089181827
+窦朝荣 13.2075304714
+君臣 8.0600359946
+印玺 11.2616203224
+润肤乳 13.900677652
+水之阳 12.5143832909
+轮次 11.4157710022
+尽忠 9.29550746599
+东丹国 11.8212361103
+孔径 10.0940151622
+大驾光临 12.1089181827
+审察 12.2912397395
+通河 10.3171587135
+牌坊下 13.2075304714
+拖来拖去 12.8020653633
+于英法 13.2075304714
+乙状结肠 11.7034530746
+二三分 12.2912397395
+长到 9.37888907493
+嘉平正 12.5143832909
+开源 10.8096351986
+通江 11.9547675029
+长别 13.2075304714
+新文化运动 9.71102290995
+炉壁 11.9547675029
+曲种 9.56994431169
+闲置地 13.900677652
+开溜 11.4157710022
+独生子女户 13.2075304714
+华凌 12.1089181827
+克里斯塔 12.5143832909
+有高有矮 12.8020653633
+五毛钱 11.1280889297
+西路招 13.2075304714
+刘责芳 13.2075304714
+和茂堂 13.2075304714
+陈德容 13.2075304714
+旋律优美 11.8212361103
+光荣革命 10.4041700905
+长刀 10.1164880181
+三四十下 13.2075304714
+华冠 12.1089181827
+天体力学 10.0505300503
+数页 13.2075304714
+鲁思汗 12.1089181827
+肌肉注射 10.642581114
+水青树 10.4994802703
+没牵 12.8020653633
+老铁山 10.533381822
+围海造地 12.2912397395
+通气 9.12999302751
+横渡 9.75754292558
+建莲 13.2075304714
+牙尖 12.2912397395
+开满 10.8561552143
+宋降臣 12.5143832909
+整改意见 11.7034530746
+三四万户 13.2075304714
+白油 13.900677652
+一报 11.0674643079
+卖掉 8.21031819765
+初始条件 10.4666904475
+长剑 10.3171587135
+卢安达 13.900677652
+慧梅 7.06549306583
+华军 13.2075304714
+华农 13.2075304714
+棉织物 10.8561552143
+痘病毒 12.2912397395
+韩幕侠 13.2075304714
+圆周 9.94943393339
+曾有信 13.2075304714
+王为侯 12.8020653633
+平桥 12.5143832909
+宋兵势 12.1089181827
+阿尔诺 11.9547675029
+赎款 12.5143832909
+深得 8.55834340001
+路标 10.642581114
+嘉鱼县 13.900677652
+那会子 11.9547675029
+函询 12.1089181827
+乱舞 10.8561552143
+宋淳 13.2075304714
+中医学 9.41204128224
+机械手 10.9049453784
+九集 12.8020653633
+打过仗 10.3743171274
+建筑学 10.3453295905
+祖庙 10.4041700905
+祖庚 12.2912397395
+推过来 11.7034530746
+虽未 9.25628675283
+散装货 11.9547675029
+霉菌性 10.8561552143
+十二种 11.1280889297
+康朗英 12.8020653633
+桂桂 10.1871055853
+问卜 11.2616203224
+横槛 13.900677652
+君子协定 11.3357282945
+紫蝴蝶 13.900677652
+四面八方 8.5440913773
+维修费 11.3357282945
+祖庭 10.8561552143
+炕桌 9.65218240993
+耻辱柱 11.7034530746
+不济事 10.0505300503
+承担责任 9.0884932966
+重武轻文 12.8020653633
+十几代 12.2912397395
+更该 11.8212361103
+虽有 7.4439079964
+十万八千年 13.2075304714
+孔壁 12.8020653633
+荣利 12.8020653633
+十四位 13.900677652
+小气泡 12.2912397395
+殖民主义 9.30555780184
+非出 12.5143832909
+上蹿下跳 10.604840786
+拟于 10.5684731418
+宝钗姊妹 11.8212361103
+女郎 9.38981814546
+孔墨 13.2075304714
+特种车 11.7034530746
+赠送礼品 11.8212361103
+咸味 10.533381822
+心旌摇荡 11.1926274509
+赵朴初 12.1089181827
+圆台 13.2075304714
+调出去 12.2912397395
+一抹 8.9308643524
+没病 10.0088573539
+拟人 11.1280889297
+圆号 11.598092559
+闪存盘 12.5143832909
+路桥 8.87679713113
+九难 13.2075304714
+告诉乃论 11.4157710022
+壁橱 11.3357282945
+教科文卫 13.900677652
+虚竹 13.2075304714
+深忧 12.8020653633
+宋涛 13.900677652
+大面儿 13.2075304714
+多亿支 13.900677652
+粮食加工 10.604840786
+上加奇 13.2075304714
+云长欲 13.2075304714
+养鸭人家 12.5143832909
+油松林 11.1926274509
+华园 13.900677652
+尽快 6.69207731402
+谣言止于 13.2075304714
+祖师 9.37888907493
+没用 8.19356738723
+卢维图 11.7034530746
+没电 10.4666904475
+肉样 13.900677652
+昧着良心 11.4157710022
+牙子 10.604840786
+音乐节 10.9562386728
+曲终 11.3357282945
+寒暑表 13.900677652
+跛行 11.5027823792
+乱花 11.5027823792
+噻唑 11.9547675029
+棒材 11.9547675029
+明洞 11.9547675029
+物体 7.17564400981
+非成员国 13.2075304714
+板鼓 12.2912397395
+不是太好 11.3357282945
+左权 11.3357282945
+棒杀 12.2912397395
+樟木 10.765183436
+宋兵分 13.900677652
+献纳 10.7226238216
+手推车 10.8561552143
+夏播 11.2616203224
+敌营 10.4349417492
+望西 11.2616203224
+宝瓶座 11.8212361103
+建筑家 11.5027823792
+花朝 13.900677652
+九队 12.8020653633
+航空事业 11.1926274509
+南投县 10.604840786
+人体素描 13.900677652
+雅罗斯拉夫尔 12.5143832909
+俗话说得好 11.3357282945
+戴盆望天 13.900677652
+花期 9.85762638414
+非凡 8.09554268306
+薛稷 12.1089181827
+相生 10.533381822
+拉宝琴 13.2075304714
+过荥阳 13.2075304714
+人工地貌 13.900677652
+多肽链 13.2075304714
+拟为 12.2912397395
+九阳 10.4666904475
+莫展 13.900677652
+曲线 7.36688881404
+曲纹 11.8212361103
+二十余丈 12.8020653633
+马非马 13.2075304714
+通款 11.598092559
+压缩空气 10.4666904475
+主应力 11.4157710022
+三十九天 13.2075304714
+朱家尖 11.9547675029
+丢盔卸甲 12.8020653633
+挚爱 10.2371160058
+开槽 12.2912397395
+胁持 12.8020653633
+祖征 13.2075304714
+华坪 13.2075304714
+焊料 12.8020653633
+雨水管 13.900677652
+背压式 13.2075304714
+阿亚图 12.1089181827
+长期贷款 8.9308643524
+华坤 13.900677652
+开栏 13.900677652
+物价 7.53077666915
+物件 8.5440913773
+多第头 13.900677652
+宋泰 11.5027823792
+花月 11.9547675029
+于幽州 11.7034530746
+蒲谐 12.5143832909
+虽是 7.49050277001
+甥女 12.5143832909
+背单词 13.900677652
+官太医 13.2075304714
+十四个 10.1164880181
+挂冠 12.8020653633
+荣华 9.46986085313
+于朗州 13.2075304714
+荣升 11.0674643079
+萜类 11.3357282945
+科学出版社 11.2616203224
+十四两 12.8020653633
+楚武王 12.2912397395
+折中主义 13.900677652
+汪庄茶 13.2075304714
+本外币 11.0674643079
+阿穆尔州 12.1089181827
+深度 6.95755522916
+冰冻蚀刻 13.900677652
+黑陶文化 12.5143832909
+盐田 10.4666904475
+风正 12.5143832909
+词组 10.4041700905
+鳞屑 11.2616203224
+平滑 8.93783302172
+由奇兰 13.2075304714
+宋河 10.765183436
+性福 11.9547675029
+甲壳虫乐队 13.2075304714
+夏收 11.1280889297
+物产 8.83808261895
+千粒重 12.5143832909
+军事装备 10.3743171274
+雷克斯 12.5143832909
+缀补 13.2075304714
+湮没 9.69598503258
+皇甫端 10.765183436
+铁麒麟 12.8020653633
+物事 10.9049453784
+显身 12.5143832909
+秦武王 12.2912397395
+克莱姆 12.2912397395
+火山区 10.9049453784
+结铃 13.900677652
+特惠关税 13.2075304714
+横梁 10.1871055853
+挂出 9.63799777493
+衣蛾 13.2075304714
+代有财 13.900677652
+拟作 11.9547675029
+算盘子 13.900677652
+误写 13.2075304714
+红砂岩 11.3357282945
+汤耀明 13.2075304714
+夏日 9.28555713513
+广征博 12.8020653633
+高考落榜 12.2912397395
+张济之 13.900677652
+纱笼 11.8212361103
+板鸭 10.9049453784
+深市 7.68207753228
+沙千里 12.5143832909
+克莱夫 12.8020653633
+聋人 11.9547675029
+噻吩 12.1089181827
+曾景忠 13.2075304714
+子兴笑 13.2075304714
+横档 12.8020653633
+夏族 10.765183436
+孙广路 13.2075304714
+没球 13.2075304714
+调门 10.9562386728
+家具配件 13.900677652
+振动觉 13.2075304714
+华城 13.2075304714
+一拳 8.76487921493
+中外历史 11.1280889297
+由此看来 9.80633308975
+腔体 11.598092559
+格致公 13.900677652
+长吏 10.9049453784
+哲嗣 13.900677652
+等速运动 13.900677652
+圣经上 12.8020653633
+宋江 6.67884182669
+同配生殖 13.2075304714
+荣叔 11.2616203224
+长命 11.3357282945
+保守力 12.1089181827
+布雷顿 10.0940151622
+平湖 10.3453295905
+整合营销 11.1280889297
+凸出来 11.9547675029
+无党 12.8020653633
+金粒 11.1926274509
+荣县 11.2616203224
+夏方 13.2075304714
+花木 8.76487921493
+大中专 10.0505300503
+老律堂 13.2075304714
+自行式 10.0720362555
+宋永 12.5143832909
+罗平国 12.8020653633
+宋兵卢 13.2075304714
+夏新 9.5062284973
+挂入 11.9547675029
+物业 6.73441167784
+雨夜 11.1280889297
+价格调整 9.38981814546
+非儿 13.2075304714
+宋氏 10.7226238216
+演化成 10.8561552143
+壁毯 11.0674643079
+宋民 13.900677652
+乌波卢 13.900677652
+一拼 11.3357282945
+法医鉴定 10.6818018271
+横标 12.5143832909
+泼上 12.2912397395
+科考船 13.900677652
+张学良 8.86372504956
+蟹肉 12.1089181827
+夏普 10.533381822
+保守党 9.5186510173
+审度 11.5027823792
+华西都市报 10.5684731418
+骑兵军 11.7034530746
+妗子 11.9547675029
+馏出物 13.900677652
+蔬菜业 13.2075304714
+明人 9.43476953332
+活动房屋 13.900677652
+谭钟麟 11.3357282945
+有待于 9.65218240993
+熔断器 11.2616203224
+平涂 11.598092559
+长垣 10.5684731418
+更见 11.3357282945
+宋濂 10.533381822
+基本词汇 12.1089181827
+鬼哭 11.2616203224
+子李势 13.2075304714
+明于 11.598092559
+明亏 12.8020653633
+十二篇 12.1089181827
+明来暗往 13.900677652
+搓手 10.2371160058
+铁的纪律 12.2912397395
+长型 12.5143832909
+广东省委 11.1280889297
+吃现成 12.8020653633
+慧济 12.1089181827
+松竹梅 13.900677652
+热带 6.74606229506
+牛顿定律 12.1089181827
+行李卷儿 13.2075304714
+礼义廉耻 11.598092559
+独孤求败 13.900677652
+梅尔辛 13.2075304714
+通榆 11.8212361103
+明代 6.52667579263
+明令 9.65218240993
+调阅 11.8212361103
+深州 11.1280889297
+投篮 10.533381822
+歼击机 9.20932976975
+吴县西 12.5143832909
+科学管理 10.0088573539
+九针 12.5143832909
+更要 8.47572763449
+平添 9.58318953844
+圆凳 13.2075304714
+炒鱿鱼 12.1089181827
+罗生门 11.8212361103
+深巷 12.2912397395
+开步 10.533381822
+协商 7.47257237929
+禄秩 11.2616203224
+棒料 13.2075304714
+圆凿 13.900677652
+长城 6.70099930628
+保健作用 11.1926274509
+松亭关 11.7034530746
+调防 11.9547675029
+挂勾 13.900677652
+机械性 10.2371160058
+试用 8.9519177616
+维吉尼 13.2075304714
+盛酒 11.4157710022
+修防修 13.2075304714
+慧深 11.9547675029
+阿尔西 12.8020653633
+结露 12.8020653633
+啼血 13.2075304714
+调集 8.4980002701
+劳佛尔 13.2075304714
+明为 10.1164880181
+联合国大会 9.44633035572
+明丽 10.2897597393
+放射疗法 12.8020653633
+长在 9.19114745066
+若引兵 13.2075304714
+普拉蒂尼 12.5143832909
+演进 9.27570483869
+膜翅目 10.4041700905
+二三十道 12.8020653633
+没省 13.900677652
+畜产品 9.26594866375
+公共数据 13.900677652
+维吉尔 10.8096351986
+指纹识别 12.8020653633
+没看 10.1630080337
+略低于 8.9102450652
+加热法 12.8020653633
+挂到 10.0294766411
+别出去 11.7034530746
+长圆 11.9547675029
+谴责 7.86280673205
+平津 9.53122979951
+悄然离去 13.900677652
+贾似道 10.4349417492
+祖居 10.1630080337
+祖屋 12.8020653633
+培养感情 11.9547675029
+干枝 12.2912397395
+点心吃 11.2616203224
+香山县 12.1089181827
+审干 12.1089181827
+虽无 9.74179456862
+歧化 11.598092559
+长安镇 13.2075304714
+耕耘者 12.8020653633
+平流 11.9547675029
+阿罗约 11.2616203224
+封予卿 12.8020653633
+平浅 11.8212361103
+什刹海 11.2616203224
+诸山寨 12.8020653633
+二十五日 10.2630914922
+遁入 10.3171587135
+日本海军 9.94943393339
+抛出来 11.5027823792
+绍兴酒 11.4157710022
+波托 12.2912397395
+闷响 10.4041700905
+从来如此 12.1089181827
+张安世 12.1089181827
+平浪 12.2912397395
+多快好省 12.1089181827
+频率计 13.900677652
+仪狄 13.900677652
+刘继业 13.2075304714
+长坂 10.533381822
+挂历 12.5143832909
+捐款者 12.5143832909
+歌曲集 11.2616203224
+白鹿仓 9.82314020807
+邵抚 12.8020653633
+七喜 12.8020653633
+十二章 12.1089181827
+小蚂蚁 12.8020653633
+六十多里 12.8020653633
+正中下怀 12.5143832909
+荣典 12.1089181827
+幸运儿 10.1164880181
+夙夜 11.598092559
+管涔山 11.1280889297
+邓艾 9.49395840471
+百般奉承 13.900677652
+中长距离 12.5143832909
+九间 11.4157710022
+荣光 10.642581114
+协同 7.95003509939
+协合 13.900677652
+平河 13.900677652
+观点鲜明 11.9547675029
+阿罗罗 13.2075304714
+华商 8.12612610643
+浆衣服 13.2075304714
+长嚎 11.4157710022
+盖耳 12.2912397395
+布鲁内 13.2075304714
+焊枪 13.2075304714
+四百八十 11.9547675029
+移上 13.900677652
+九门 10.6818018271
+各具特色 9.24671730182
+孔宾 13.2075304714
+车子 7.75864024639
+夏末 10.8561552143
+美泰克 13.900677652
+败将残兵 12.5143832909
+孔家 11.8212361103
+万能钥匙 11.9547675029
+学文 10.765183436
+血缘关系 9.11318590919
+蒙字会 13.900677652
+平泉 11.4157710022
+奋斗史 12.8020653633
+荣儿 13.900677652
+精确性 11.0103058941
+团结起来 9.98865464655
+伏于阶 12.8020653633
+加劲木 13.900677652
+李贵妃 8.19356738723
+梅竹图 12.8020653633
+夏服 13.2075304714
+塔博尔 12.2912397395
+平泽 12.8020653633
+旧学 10.765183436
+动力厂 13.2075304714
+倒映在 10.8561552143
+旧道德 12.2912397395
+白皮书 10.604840786
+夏朝 9.98865464655
+挂号 10.4994802703
+凯鲁亚克 13.2075304714
+孔安 13.900677652
+调露 11.4157710022
+结集 9.43476953332
+大陆棚 12.5143832909
+阉党 9.23723855786
+绝路逢生 13.2075304714
+中国敦煌吐鲁番学会 12.8020653633
+侯仁之 12.1089181827
+平民 7.4855806928
+长嘴 10.0505300503
+盐矿 10.0505300503
+明伦 13.2075304714
+幂级数 10.8096351986
+溶洞群 11.598092559
+平氏 12.1089181827
+移交 8.46695564842
+有胆有识 11.7034530746
+远角 13.900677652
+稚晖 11.9547675029
+大灾难 10.4994802703
+加酸 12.5143832909
+伯克莱 13.900677652
+孔孟 10.7226238216
+协和 9.44633035572
+结队 10.765183436
+焊机 12.8020653633
+耐心 7.68407155089
+连通环 13.900677652
+唐代宗 10.604840786
+周东迁 12.2912397395
+平水 10.642581114
+虚礼 11.7034530746
+过目难忘 12.1089181827
+搓揉 11.5027823792
+镁合金 11.2616203224
+许昆林 13.900677652
+陈贞慧 7.82763311788
+一捋 10.8096351986
+调音 11.1926274509
+路段 8.51160592216
+更衣 9.5186510173
+破冰船 10.6818018271
+不借 10.7226238216
+大玉海 12.2912397395
+非专业 11.1280889297
+奥斯曼帝国 8.53470163695
+平江 9.62401153296
+谈叶子 13.900677652
+维西 11.0674643079
+慧沼 12.8020653633
+挂单 10.8561552143
+平汉 11.0674643079
+深层 8.37921673411
+深居 9.93038573842
+芋头 10.2630914922
+宋兵入 13.2075304714
+横模 13.900677652
+横心 11.3357282945
+深山 8.6966709649
+无章可循 12.5143832909
+宋清 9.80633308975
+施瓦茨科普夫 12.5143832909
+感荷 12.8020653633
+党代表 9.85762638414
+青年才俊 12.1089181827
+荣军 12.8020653633
+杜化中 12.2912397395
+乱臣 13.2075304714
+挂印 11.598092559
+屠岸贾 13.900677652
+万元户 11.0103058941
+涝洼 12.2912397395
+夏林 13.900677652
+洪湖市 12.5143832909
+超额完成 10.1394775363
+看在眼里 9.33632946051
+九尺 10.7226238216
+困惑 8.61747392324
+牙城 12.8020653633
+刀下 11.598092559
+深厚 7.79588441956
+黑嫩 12.2912397395
+卡西姆 13.2075304714
+上海南京路 11.7034530746
+荣幸 9.66657114738
+圆径 13.2075304714
+曲牌 9.41204128224
+高度评价 9.20932976975
+春节假期 12.8020653633
+建行 7.34389929582
+华约组织 13.900677652
+侯光 13.2075304714
+益干启 13.2075304714
+几百万元 10.642581114
+那首歌 11.5027823792
+深县 12.2912397395
+夏桀 10.8096351986
+右翼后旗 11.8212361103
+网纹 10.765183436
+何钧谕 12.8020653633
+印上去 13.900677652
+困惫 12.2912397395
+开放 6.59548943658
+秦妇吟 12.5143832909
+虚盈 13.900677652
+汇流点 12.8020653633
+方国安 10.1394775363
+庐山真面目 11.9547675029
+裙带风 12.2912397395
+与时偕行 13.900677652
+巴氏奶 13.2075304714
+深渊 8.59737274392
+首位 7.36109169636
+着重强调 10.8096351986
+横断 10.642581114
+牛津大学 8.94485059437
+键盘输入 11.7034530746
+杨家湾 12.8020653633
+燃气表 13.900677652
+开敞 10.6818018271
+李夫人 11.7034530746
+礼所当然 13.900677652
+横斜 11.4157710022
+戡定 12.8020653633
+华威 12.2912397395
+牙垢 11.7034530746
+没种 11.5027823792
+残存者 12.8020653633
+揭示者 13.2075304714
+因循苟且 12.2912397395
+大陆漂移 10.0505300503
+当奴才 11.4157710022
+绳扣 11.9547675029
+助燃 11.0674643079
+圈定 10.1394775363
+深化 7.391908515
+老母鸡 10.8561552143
+开斋 11.9547675029
+长头 11.9547675029
+通杀 13.2075304714
+澄清湖 12.8020653633
+延安地区 11.4157710022
+高丽藏 12.8020653633
+长天 11.4157710022
+长大 7.09606313191
+苍翠 10.2117981979
+长夜 10.1871055853
+长多 12.8020653633
+千愁万恨 13.900677652
+弄清原因 13.2075304714
+炉台 13.2075304714
+伏伊伏丁那 12.2912397395
+生殖 8.06586691491
+风泵 13.900677652
+长夏 12.2912397395
+谈笑自若 11.5027823792
+蔡邕 10.533381822
+协定 7.40541209604
+祖制 9.84023464143
+圆弧 10.0940151622
+自卫战争 11.0674643079
+开方 10.604840786
+樊素 13.2075304714
+国际部 10.9049453784
+得色 12.2912397395
+降压片 13.2075304714
+马横戈 13.2075304714
+横放 11.7034530746
+盐碱 9.58318953844
+弯下 11.1926274509
+通有 11.3357282945
+深南 10.1871055853
+夏梦 13.2075304714
+僧帽 10.6818018271
+挂屏 11.3357282945
+长女 10.4349417492
+启闭 10.8096351986
+林荫夹道 13.900677652
+一捺 12.1089181827
+侯德宾 13.2075304714
+锻锤 12.5143832909
+开区间 13.900677652
+调频 10.2897597393
+电子信函 12.1089181827
+里应外合 10.0294766411
+贡日嘎 12.5143832909
+遁形 12.2912397395
+嘉森 12.8020653633
+开早 13.900677652
+金鱼胡同 11.8212361103
+地址 7.67216664838
+运城战役 13.2075304714
+圆形 7.44547908864
+开时 10.2117981979
+开旷 12.8020653633
+芝麻酱 11.2616203224
+荣府 10.0088573539
+林权助 12.8020653633
+双双封 12.1089181827
+七十架 13.900677652
+葡萄干 10.7226238216
+群防群治 13.900677652
+嗾使 11.1926274509
+宗景云 12.2912397395
+平抑 9.74179456862
+锻铸 12.5143832909
+伯克贝 12.8020653633
+梅尔胜 12.8020653633
+二者不可得兼 13.2075304714
+炉前 12.1089181827
+胜诉权 13.2075304714
+三坝 13.2075304714
+环道 11.0103058941
+齿鸟类 13.900677652
+敌视 9.85762638414
+肠胃 9.16447920358
+自暴自弃 11.0103058941
+平庆永 13.900677652
+张关保 13.900677652
+路政 11.598092559
+稳当 10.4994802703
+锻铁 11.3357282945
+电话员 11.7034530746
+生态景观 13.900677652
+满鲜花 13.900677652
+轻松自在 11.7034530746
+长途汽车站 11.2616203224
+招子 11.0103058941
+量子场论 10.8561552143
+都江堰 9.63799777493
+病入膏肓 10.7226238216
+日内瓦人 13.900677652
+两面夹攻 11.7034530746
+龚祖同 13.2075304714
+十几丈 10.8561552143
+归还给 10.1871055853
+锻钢 12.1089181827
+平拉 13.2075304714
+全忠全 13.2075304714
+跟踪报道 12.1089181827
+鸾音鹤信 13.900677652
+恢复系数 12.8020653633
+克建昌 13.2075304714
+僧徒 10.4994802703
+江桥 11.0103058941
+税改 12.8020653633
+两百三十三种 13.2075304714
+搓洗 11.3357282945
+六叶 13.2075304714
+核桃壳 13.900677652
+门恭迎 12.8020653633
+稽查局 10.642581114
+降职 11.1280889297
+绝活儿 11.1280889297
+高丽营 13.2075304714
+自弃 12.1089181827
+乱转 9.94943393339
+嘉南大圳 11.7034530746
+路数 10.1394775363
+建筑图 13.900677652
+多一点儿 12.8020653633
+宝瓶口 11.8212361103
+黄窝儿 13.2075304714
+汉晋竹 13.2075304714
+平成 11.9547675029
+韩起祥 12.2912397395
+彩印包装 13.900677652
+别喝了 13.2075304714
+华寺 12.1089181827
+告别式 13.900677652
+钱牧斋 9.96885201925
+没破 12.2912397395
+深切 8.40350942668
+骑兵师 10.8561552143
+长堤 10.2897597393
+二三百米 11.4157710022
+通晓 9.08039608637
+路斯 11.8212361103
+深到 11.8212361103
+黄振华 13.2075304714
+华富 8.9102450652
+四千七百 12.8020653633
+大晴天 12.5143832909
+沾沾自喜 10.4041700905
+埃贝尔 11.1280889297
+证交会 9.96885201925
+圆帽 12.2912397395
+太傅许 13.2075304714
+开播 10.8561552143
+封唐王 13.2075304714
+岚县 12.8020653633
+弹跳板 13.900677652
+新东方 10.4041700905
+萜烯 12.2912397395
+横摆 12.8020653633
+辛伐他汀 13.2075304714
+虞仲文 12.2912397395
+原材料 7.27528528397
+盐种 13.900677652
+藏戏 12.5143832909
+通明 9.82314020807
+今西宁 12.5143832909
+挤压机 13.2075304714
+刀俎 12.5143832909
+不怕官 12.2912397395
+路旁 8.33233314821
+标准刺激 13.2075304714
+平手 11.598092559
+华容 10.9049453784
+调香 12.5143832909
+曲率 9.80633308975
+新力军 13.900677652
+九具 12.5143832909
+平扁 9.59661255877
+壁柜 12.5143832909
+三千件 13.2075304714
+客户端 11.1926274509
+华安 8.23425096386
+化学治疗 11.7034530746
+华宁 12.2912397395
+色情小说 13.900677652
+华宇 11.1926274509
+壁柱 12.8020653633
+乔凡尼 13.2075304714
+通显 12.8020653633
+华宝 8.61747392324
+趟浑水 13.900677652
+国产棉 12.8020653633
+有悖于 10.9049453784
+宋思 13.2075304714
+华宗 13.2075304714
+飘舞着 12.1089181827
+长宽 10.0088573539
+达罗斯 12.8020653633
+夹生饭 12.8020653633
+伐区 12.1089181827
+制宪会议 10.3743171274
+义务性 11.9547675029
+开有 10.0720362555
+圈外 11.2616203224
+晓然 12.8020653633
+庚子年 11.9547675029
+中国科学院学部 12.2912397395
+开朗 9.34680076038
+路易 9.27570483869
+邰氏 12.5143832909
+许可证书 11.9547675029
+长实 10.765183436
+路昭 12.5143832909
+丹东市 10.3453295905
+一回生 11.9547675029
+深冷 13.2075304714
+长官 7.49214886092
+乡镇企业管理局 13.900677652
+缠住 9.20019728618
+炉具 13.900677652
+南学会 11.598092559
+长安 6.87425084328
+连接号 13.900677652
+棒槌 10.2117981979
+巧言 11.3357282945
+毛细现象 11.9547675029
+白鹤梁 12.8020653633
+深冬 11.2616203224
+长宁 11.4157710022
+世家子弟 11.7034530746
+长寿 8.89673134603
+九颗 12.1089181827
+木蝴蝶 12.8020653633
+背负着 10.2117981979
+移走 11.5027823792
+徐旭生 12.8020653633
+万圣宫 13.2075304714
+揣度 10.9049453784
+湖南日报 13.900677652
+克莱因 10.7226238216
+埔里镇 12.1089181827
+下周一 9.16447920358
+肺叶 11.4157710022
+铅垂线 11.1280889297
+灵王 13.2075304714
+狰狞 9.26594866375
+工作者 8.01179969364
+协奏 12.2912397395
+类囊体 12.1089181827
+踢蹬 12.8020653633
+狙击兵 12.5143832909
+开来 7.44862869754
+深凹 11.4157710022
+华中科技大学 12.1089181827
+华堂 12.2912397395
+宋授 12.2912397395
+金属门 12.8020653633
+铁钤钤 13.900677652
+九百二十四名 13.2075304714
+乱象 10.4994802703
+成套率 13.900677652
+阿马蒂 12.5143832909
+状态参数 12.8020653633
+必居其一 11.9547675029
+灿烂 8.23425096386
+刈除 13.900677652
+屠户 10.8561552143
+通敌 10.4994802703
+挂帅 9.75754292558
+华士 12.8020653633
+审判 7.8093677699
+两支 8.0285598625
+氯甲基化 13.2075304714
+对比联想 13.900677652
+一千万元 11.7034530746
+木里藏族自治县 13.2075304714
+全枪 10.1164880181
+调高 8.44535653662
+挂帐 12.8020653633
+金属锑 13.2075304714
+华声 11.9547675029
+自当 9.33632946051
+横杠 11.9547675029
+奥林匹克运动会 9.37888907493
+挂带 12.5143832909
+九顶 11.8212361103
+铁工 11.3357282945
+开枪 8.19689517732
+拧下来 11.7034530746
+金属键 11.7034530746
+木枋 12.1089181827
+九项 11.9547675029
+没笑 10.604840786
+呆愣愣 13.2075304714
+开架 12.8020653633
+苏合香 12.1089181827
+杨家沟 13.2075304714
+负罪感 12.5143832909
+横杆 11.4157710022
+机械波 11.9547675029
+李国强 13.2075304714
+杭纺 11.598092559
+哥达纲领 11.598092559
+金属镁 11.3357282945
+轰出去 11.9547675029
+戈雷斯 12.8020653633
+长篇累牍 13.900677652
+株型 12.5143832909
+金属镉 12.1089181827
+邬贺铨 12.8020653633
+船帆座 13.900677652
+横木 10.9049453784
+一字师 13.900677652
+闪闪 9.44633035572
+闷声 11.3357282945
+京哈线 12.5143832909
+尼姑庵 11.8212361103
+枝繁叶茂 10.4666904475
+没签 12.8020653633
+机械油 13.900677652
+兰癸亚 12.2912397395
+偏北风 10.0720362555
+长孙 9.7898037878
+长存 10.533381822
+萧友梅 12.1089181827
+上上下下 8.85082164473
+印花税 8.79473217808
+长子 7.93967231235
+通政 12.2912397395
+开好局 13.2075304714
+翘望 13.900677652
+安全卫士 13.900677652
+和豪格 11.9547675029
+装样子 12.5143832909
+杭绸 13.2075304714
+汗衣 13.900677652
+牙哈 13.2075304714
+发酵酒 12.8020653633
+棒棰 12.5143832909
+留守人员 13.2075304714
+村村寨寨 12.8020653633
+审计处 13.2075304714
+香水瓶 13.2075304714
+东非大裂谷 10.3743171274
+第八十五回 12.5143832909
+开明 8.98802276624
+慧恺 12.8020653633
+猩猩 10.0720362555
+千不该 11.3357282945
+闷头 10.4994802703
+大用场 11.3357282945
+表达出来 10.3743171274
+衣来伸手 12.8020653633
+金属钙 11.9547675029
+划地为牢 12.8020653633
+开映 12.5143832909
+金属钠 10.4994802703
+亚里士多德 8.64840422393
+棒棒 13.2075304714
+开春 9.93038573842
+自由电子 10.0720362555
+先让人 12.8020653633
+之冤 11.8212361103
+乱贼 12.1089181827
+樊纲 10.3743171274
+子启 11.9547675029
+哲学 6.48129706906
+铁合金 10.4666904475
+参会 9.04086524761
+乱账 13.2075304714
+奥维伦 12.2912397395
+腋窝下 13.900677652
+散装船 13.2075304714
+华天 10.3743171274
+华夫 13.900677652
+竹筒饭 13.900677652
+挂心 9.72629038208
+横暴 10.4666904475
+三星堆 11.598092559
+虚症 12.8020653633
+路权 11.1926274509
+都市男女 12.8020653633
+慧性 13.900677652
+探亲假 13.2075304714
+样本量 12.8020653633
+华夷 11.0674643079
+通播 13.2075304714
+百分之二十五 12.8020653633
+老法子 12.5143832909
+测绘局 12.8020653633
+慧思 12.1089181827
+沾襟 12.5143832909
+路条 12.8020653633
+以诚相见 13.900677652
+挂念 9.58318953844
+金属银 12.5143832909
+唐初设 12.5143832909
+高庆裔 12.2912397395
+有识者 12.8020653633
+杵臼 12.8020653633
+净收入 9.56994431169
+灿然 12.5143832909
+旧话重提 11.7034530746
+宝阁珍 13.2075304714
+樟树 9.87532596124
+周瑜精 13.2075304714
+帝国主义者 10.765183436
+下欠 13.900677652
+痛饮黄龙 13.2075304714
+刘云非 13.900677652
+傅试 13.2075304714
+烦心事 10.4349417492
+刘文炳 10.642581114
+杰里 11.8212361103
+晨报 9.48183704418
+税务所长 11.1926274509
+牙周 11.7034530746
+三民主义 9.35738286971
+腺细胞 11.598092559
+贸易市场 10.4666904475
+阿维兰热 13.2075304714
+咸宁 9.87532596124
+百分之二十九 12.8020653633
+黄狮寨 13.2075304714
+秦律 10.533381822
+夏毛 12.1089181827
+剃光头 11.5027823792
+魏源重 13.2075304714
+司兵 12.2912397395
+梦里 9.12155415886
+乱跑 9.4233408375
+参谋处 11.4157710022
+建议 5.23162211125
+马桶盖 13.2075304714
+祖兄 12.1089181827
+日久生 13.2075304714
+祖先 7.40390266179
+矮树丛 12.2912397395
+祖克 11.4157710022
+平恕 13.2075304714
+建设 4.91248133098
+横是 12.8020653633
+松柴 13.2075304714
+防臭 13.2075304714
+缠人 12.8020653633
+慕雍山 12.8020653633
+上海芭蕾舞团 12.5143832909
+降自 13.2075304714
+孔圣 12.5143832909
+摄谱仪 12.1089181827
+居民点 9.20019728618
+圆山 12.1089181827
+梦醒 11.0103058941
+白泥 12.1089181827
+千真万确 9.63799777493
+濯足 13.900677652
+挂彩 10.1394775363
+封罗虎 12.5143832909
+夺回 8.60236028543
+养鹿业 12.8020653633
+平息 8.0985592766
+贾政一一 12.8020653633
+咸寒 12.5143832909
+空空落落的 12.8020653633
+多场次 12.2912397395
+钻探机 12.8020653633
+禹遂 12.1089181827
+蓝紫色 11.1280889297
+平果 11.598092559
+炉坑 13.900677652
+盐类 9.11318590919
+中西药业 10.3171587135
+平林 11.7034530746
+圆实 13.900677652
+违纪行为 13.2075304714
+托克玛 12.5143832909
+匣式 13.900677652
+岑威引 13.900677652
+反其道而行之 10.8561552143
+有朝一日 8.98069672615
+中岛宏 13.2075304714
+短袖衫 11.4157710022
+华年 13.900677652
+梅朗 13.2075304714
+明罗洪 13.2075304714
+二三百种 12.8020653633
+德尼 12.2912397395
+花旗 8.78868986362
+显花植物 11.4157710022
+牙口 11.1280889297
+个人简介 13.900677652
+谢瓦莱 13.2075304714
+亚伯拉罕 11.3357282945
+北京中山公园 13.2075304714
+恣睢 12.8020653633
+缺医少药 12.1089181827
+国丈 10.3171587135
+十里八乡 11.1926274509
+纸板厂 13.2075304714
+挂壁 11.9547675029
+话剧史 12.8020653633
+长巷 11.598092559
+横看成 13.900677652
+葡萄牙共和国政府 13.2075304714
+测绘学 11.2616203224
+圆寂 10.3743171274
+春之歌 11.1926274509
+妖魔鬼怪 11.0103058941
+遣词 12.8020653633
+侯德强 13.900677652
+深埋 9.82314020807
+仓茶卡 13.2075304714
+三百首 13.2075304714
+加尔默罗 12.1089181827
+夏氏 12.8020653633
+环锭 11.598092559
+宋文 12.5143832909
+伯远帖 12.5143832909
+数数看 13.2075304714
+全民所有 11.9547675029
+向玉皇 12.8020653633
+西太平洋 9.38981814546
+警世钟 12.5143832909
+严重危害 9.89334446674
+配位键 11.1926274509
+祖围 11.598092559
+华帝 10.642581114
+圈形 12.5143832909
+峭寒 13.2075304714
+阮之钿 10.9562386728
+祖国 7.45020722983
+两面作战 11.8212361103
+平望 11.4157710022
+庄上 8.74738605748
+蔡钧 10.9049453784
+建筑史 10.2897597393
+平朔 11.4157710022
+庄东 13.2075304714
+平月 13.2075304714
+特斯洛 13.2075304714
+建材市场 11.4157710022
+验电器 12.1089181827
+肚里蛔虫 13.900677652
+九鹏 13.900677652
+舒伯 13.900677652
+美甲 11.5027823792
+清世祖 11.1926274509
+冯国斌 10.2371160058
+曲直 11.1280889297
+最终目标 10.1871055853
+深圳 5.75657918864
+协律 11.8212361103
+多明哥 13.2075304714
+洗脚水 11.0674643079
+庄严 7.91674137129
+伊拉克共和国 12.1089181827
+养家活口 13.2075304714
+磁芯 11.7034530746
+长崎 9.85762638414
+魏源集 12.8020653633
+美国纽约证券交易所 13.2075304714
+领海范围 12.2912397395
+庄主 10.8561552143
+魔术节 11.8212361103
+唐圭璋 12.8020653633
+曲目 8.92394390956
+美男 12.1089181827
+未留下 12.5143832909
+深坑 10.642581114
+李国奇 10.5684731418
+光谱线 10.4994802703
+黄士陵 12.2912397395
+薄革质 12.5143832909
+禁止入 13.2075304714
+萨尔维尼 13.900677652
+通指 12.5143832909
+帕哈尔 13.900677652
+现代文明 10.4994802703
+沈阳人 12.2912397395
+前滚翻 12.2912397395
+晨早 12.2912397395
+平权 11.2616203224
+冷水滩 13.2075304714
+致富路 12.8020653633
+板面 10.9562386728
+周公传 13.2075304714
+盐粒 12.5143832909
+检流计 12.5143832909
+平板 9.20019728618
+平松 13.900677652
+调制解调器 12.2912397395
+辨认出 10.0505300503
+牙医 11.4157710022
+马守应 12.8020653633
+华府 11.4157710022
+飞禽走兽 10.7226238216
+打了个 8.01735526349
+懊丧 9.74179456862
+元建武 13.2075304714
+龟山 10.8561552143
+启锚 12.8020653633
+仪礼 9.85762638414
+玩具车 13.2075304714
+开怀 10.3453295905
+壁挂 11.2616203224
+华彬 9.80633308975
+嵊州市 13.900677652
+类食品 10.8096351986
+僧寺 11.7034530746
+尼克斯 11.5027823792
+长岭 10.7226238216
+肉眼凡夫 13.900677652
+蔡锷 10.3453295905
+孳生 10.4994802703
+性别差异 12.2912397395
+建起 9.22784881751
+上有老下有小 13.2075304714
+尼奥斯 11.8212361103
+陆相 9.63799777493
+长岛 10.9562386728
+同德齐 12.8020653633
+明枪暗箭 11.9547675029
+加油车 12.2912397395
+爱恨分明 13.900677652
+特斯河 12.5143832909
+梦露 11.3357282945
+嵩县 10.3743171274
+黄色人种 13.900677652
+建账 13.900677652
+九龙 8.55357012126
+山不转路转 12.5143832909
+华强 11.7034530746
+男女双方 9.98865464655
+感觉 5.64147828931
+十二点 9.62401153296
+参战国 11.4157710022
+上门去 11.598092559
+蒋琬奏 12.8020653633
+感观 11.8212361103
+攻丝 13.2075304714
+陆心源 12.5143832909
+游离钙 12.5143832909
+舌根音 13.900677652
+慧星 11.5027823792
+通报 7.63158136827
+开恩 9.41204128224
+神魂颠倒 10.4041700905
+改口说 10.4666904475
+厉色 12.5143832909
+马挺矛 13.2075304714
+夏洛 13.2075304714
+保证质量 11.2616203224
+磁荷 13.2075304714
+宗子兄 12.1089181827
+感触 9.96885201925
+孔内 11.2616203224
+胯下之辱 12.8020653633
+树枝状 9.94943393339
+拧起 12.2912397395
+通才 11.4157710022
+孔兼 13.2075304714
+建路 12.8020653633
+炒钢 11.598092559
+平易 10.4994802703
+僧孺 13.900677652
+归尔甫 12.2912397395
+七八百元 12.8020653633
+冷水澡 11.7034530746
+郝梦龄 12.8020653633
+平明 10.2897597393
+曲高和寡 12.5143832909
+华忱 13.900677652
+邦迪 13.900677652
+夏淳 13.2075304714
+串味 13.2075304714
+臭脚 12.8020653633
+通扬 11.5027823792
+乱讲 10.4994802703
+养虎伤身 13.900677652
+平显 11.8212361103
+镁质 11.0674643079
+达瓦齐 11.9547675029
+陈先生 9.44633035572
+乱设 13.2075304714
+闷得 10.8096351986
+环链 12.8020653633
+拉斯河 12.8020653633
+周公之 12.1089181827
+挂失 10.9049453784
+科学规范 11.8212361103
+孔光 12.5143832909
+舵工 12.1089181827
+抗风力 11.5027823792
+助理 7.89679058487
+孔儿 13.2075304714
+嘉山县 13.900677652
+云安军 12.1089181827
+有慧英 13.900677652
+跛脚 12.1089181827
+荣宠 11.3357282945
+长山 9.85762638414
+锻造 9.71102290995
+农村教师 13.2075304714
+不知所言 13.900677652
+自必 11.3357282945
+稚气 10.0720362555
+知心话 10.642581114
+祖坛 12.2912397395
+和颜悦色 10.0940151622
+祖坟 8.80081122415
+诙谐地 12.1089181827
+乱说 9.36807815882
+音乐课 11.8212361103
+一溜儿 11.0674643079
+揭批 11.8212361103
+荣宁 11.3357282945
+卡西尼 12.5143832909
+财政纪律 12.8020653633
+距离 6.08345486647
+臭氧洞 12.1089181827
+青釉瓷器 12.8020653633
+丁审银 12.8020653633
+长屋 11.7034530746
+克莱克 13.900677652
+伏契克 12.5143832909
+牙刷 10.8096351986
+臭腺 11.5027823792
+医药学家 12.5143832909
+李国安 11.8212361103
+夏湾 12.1089181827
+蔡阳 11.3357282945
+开挖 8.83808261895
+华山 8.99540287354
+针工 12.2912397395
+没羽 12.8020653633
+横握 13.2075304714
+队列训练 12.2912397395
+民族服饰 10.9562386728
+窘迫 9.55687223012
+平方 8.76487921493
+华屋 12.2912397395
+更臻 12.5143832909
+国曹魏 12.2912397395
+只见树木 13.2075304714
+小孤山 11.3357282945
+十数枝 12.8020653633
+服装道具 13.2075304714
+环面 12.8020653633
+国泰君安证券股份有限公司 10.4666904475
+结果实 13.2075304714
+宋某 10.8096351986
+蔡将军 13.2075304714
+吕义 12.8020653633
+长径 10.642581114
+克隆羊 13.900677652
+长征 8.03138073884
+没羞 13.2075304714
+逋逃 13.2075304714
+七十余 10.642581114
+夏温 11.8212361103
+玉貌花容 13.900677652
+土壤改良剂 12.5143832909
+国际队 12.8020653633
+阿同葛 12.8020653633
+夺占 10.0505300503
+诸路军 10.5684731418
+簿记 10.3171587135
+好不好 8.30225569298
+献瑞 13.900677652
+板门 11.5027823792
+冷开水 11.598092559
+咸平 10.8561552143
+放进去 10.2630914922
+乱行 13.900677652
+虚热 10.765183436
+那会儿 8.73589167805
+蓑笠 12.5143832909
+牙冠 11.8212361103
+呜呼 10.0720362555
+平旷 12.1089181827
+平时 6.42194282641
+华罗庚 10.6818018271
+冷水江 11.598092559
+于颍州 13.2075304714
+七八年 9.84023464143
+金环蛇 12.2912397395
+磁控溅射 13.2075304714
+华尔 11.8212361103
+晓畅 11.0103058941
+通扬运河 10.765183436
+畏首畏尾 10.6818018271
+民用船 13.900677652
+白菊花 12.2912397395
+罗森布 12.8020653633
+穗子 10.8096351986
+商业街 10.4994802703
+限位器 13.900677652
+无双 10.0940151622
+夺去 8.88339781516
+华峰 10.1394775363
+开掘 10.1394775363
+咸康 12.1089181827
+感言 11.0674643079
+樊笼 11.1280889297
+诸路兵 12.8020653633
+圆头 10.9562386728
+平放 11.0674643079
+撒拉族 10.8561552143
+呜咽 8.65893063692
+宋李 13.2075304714
+津滨发展 11.2616203224
+卡葛沙 13.900677652
+严申 10.9562386728
+山道年 12.5143832909
+子正 13.900677652
+没缘 12.8020653633
+牙关 9.6811699468
+连老侯 13.2075304714
+牙具 11.9547675029
+简体中文 13.900677652
+满当当 12.8020653633
+华岩 13.900677652
+语音信箱 13.900677652
+二十万零九百一十一 13.2075304714
+新疆维吾尔 12.2912397395
+宋末 10.6818018271
+驾临 10.0294766411
+激光视盘 13.2075304714
+海货 13.900677652
+产棉区 10.5684731418
+长影 13.900677652
+宋本 11.0103058941
+开提 13.900677652
+穆里尼奥 13.900677652
+下达任务 12.5143832909
+大少爷 9.62401153296
+溪河 10.642581114
+直叫人 12.5143832909
+长形 10.3171587135
+静电作用 12.5143832909
+安加拉河 11.598092559
+乌维科 13.2075304714
+闹出笑话 12.1089181827
+任教授 9.27570483869
+虚火 10.0940151622
+圆满完成 10.1164880181
+演说家 11.2616203224
+唐其势 11.9547675029
+平整 8.75901409547
+金属酶 12.8020653633
+华岛 10.9049453784
+僧堂 11.1926274509
+阿兹特 13.2075304714
+女马 13.2075304714
+癥瘕 12.8020653633
+虚灵 13.900677652
+夺取 7.11509000697
+帐籍 13.900677652
+磁能 12.8020653633
+赦免权 12.2912397395
+宋朝 7.71241352889
+华岗 11.9547675029
+结婚登记 10.7226238216
+炸礁 12.2912397395
+衣冠济 13.900677652
+侮蔑 13.900677652
+二三周 13.2075304714
+度曲 11.598092559
+一流大学 12.5143832909
+凌厉攻势 11.9547675029
+开戒 13.900677652
+开成 10.1394775363
+卡赫美 12.8020653633
+电焊工 12.5143832909
+七十七 11.8212361103
+长度 7.18650712207
+开战 8.98802276624
+七十一 11.598092559
+七十万 10.8096351986
+孔口 11.598092559
+棒法 12.2912397395
+盐罐 12.8020653633
+更能 8.61241062128
+大国主义 13.2075304714
+晨星 9.20932976975
+樟油 12.8020653633
+劫色 12.8020653633
+教学设备 12.8020653633
+中国石油天然气集团公司 10.9562386728
+姚清泉 13.900677652
+通惠 12.5143832909
+七十个 12.2912397395
+同性恋爱 13.2075304714
+晨昏 10.0940151622
+动式 13.900677652
+长庆 10.0088573539
+开房 13.2075304714
+狡兔 11.1926274509
+点选 13.900677652
+闪避 10.3743171274
+冷水浴 11.9547675029
+通悉 13.900677652
+七十九 11.9547675029
+矛盾重重 10.5684731418
+捧上来 13.900677652
+开打 10.8561552143
+加送 12.2912397395
+小康社会 10.1630080337
+横披 11.9547675029
+圈层 10.4994802703
+折算率 13.2075304714
+区域试验 12.5143832909
+抗磨损 13.2075304714
+短尾猴 10.533381822
+泼墨山水 13.2075304714
+孔原 13.900677652
+万余家 11.8212361103
+陈蝶仙 13.2075304714
+晨晖 13.900677652
+没经 11.9547675029
+吴侯执 13.2075304714
+呜啦 13.2075304714
+胸墙 12.2912397395
+助益 11.2616203224
+拷打 9.98865464655
+科技咨询 13.2075304714
+蔡靖 9.84023464143
+没给 9.87532596124
+里维拉 11.9547675029
+过气去 11.0674643079
+首一 12.8020653633
+向新月 11.598092559
+卡萨拉 12.2912397395
+横批 12.8020653633
+青壮年人 13.900677652
+就近入学 11.7034530746
+宋景 12.1089181827
+华工 9.63799777493
+七十五 10.7226238216
+袁守芳 13.900677652
+买回去 12.5143832909
+索引 9.28555713513
+推推搡搡 11.3357282945
+七十二 9.0884932966
+长带 12.8020653633
+碘甲烷 11.8212361103
+曹议金 12.8020653633
+邮件门 12.5143832909
+慈善家 11.1926274509
+学习网 13.900677652
+基尔霍夫 10.1394775363
+女鬼 10.765183436
+十二片 13.2075304714
+深吻 13.900677652
+驾上 12.2912397395
+娇艳欲滴 13.900677652
+打问号 12.8020653633
+七十亩 11.8212361103
+主办国 12.8020653633
+龙卷风 10.3453295905
+华州 10.8561552143
+开抵 11.5027823792
+春秋鼎盛 13.2075304714
+按需 12.1089181827
+伊比利亚 9.48183704418
+小阳春 10.4349417492
+咸得 12.8020653633
+尼克松 9.66657114738
+灯火管制 12.2912397395
+开拆 11.7034530746
+晨曲 13.2075304714
+长年 9.15574552361
+长平 9.91169360541
+开拍 10.6818018271
+平摊 11.9547675029
+建达 13.900677652
+听音器 13.900677652
+开拔 9.82314020807
+征缴 10.5684731418
+挂孝 10.765183436
+更者 13.2075304714
+晨曦 10.2117981979
+王廉州 13.900677652
+德岛 11.598092559
+通性 12.8020653633
+浅褐色 11.2616203224
+宋明 10.9562386728
+贡入京 12.8020653633
+单位地址 12.8020653633
+十月底 11.1280889297
+游戏软件 12.8020653633
+车工 11.8212361103
+墨守成规 11.598092559
+亚硝基 11.8212361103
+香消玉殒 11.9547675029
+黄瓦红 12.2912397395
+旧时 9.04864738806
+上首 9.41204128224
+莲心 11.7034530746
+宫前 10.2371160058
+焦墨 11.8212361103
+滴定剂 11.2616203224
+关塔那摩湾 13.900677652
+墓园 11.2616203224
+清清的 11.7034530746
+喝完 9.66657114738
+媒质 10.5684731418
+穆斯利 12.5143832909
+固定不动 11.1280889297
+睡梦中 9.48183704418
+奚斯 13.900677652
+火控 9.37888907493
+张镇 13.2075304714
+三周 8.79473217808
+称出 13.2075304714
+电触头 13.2075304714
+终究 7.99259471381
+吹进 11.0103058941
+新兴力量 11.598092559
+墙边 9.44633035572
+洲际导弹 10.765183436
+望中堂 13.900677652
+专才 12.1089181827
+窃窃私议 11.9547675029
+鹿邑县 11.5027823792
+瓦伊 12.2912397395
+正统思想 11.5027823792
+奚族 10.9562386728
+张锦 13.2075304714
+中国科学院 7.68807155622
+七八寸 13.2075304714
+额巴钦 13.2075304714
+赞哈 12.5143832909
+高价药 12.5143832909
+宫刑 10.4041700905
+氯丁二烯 11.7034530746
+向陈柱子 12.8020653633
+穷愁潦倒 13.900677652
+简又文 12.2912397395
+陶芬家族 12.8020653633
+特案 13.2075304714
+红唇 11.4157710022
+软环境 11.8212361103
+张锋 13.2075304714
+竹黄 12.5143832909
+阻碍交通 12.8020653633
+璧山县 13.900677652
+孔孟之道 11.1280889297
+张锐 12.5143832909
+安西东 11.9547675029
+窃窃私语 9.89334446674
+宫制 11.8212361103
+笔套 12.5143832909
+赭色 11.5027823792
+邢岫烟 11.0103058941
+灯绳 12.8020653633
+埃斯库多 12.8020653633
+阻聚剂 12.5143832909
+布囊 12.8020653633
+第四段 12.8020653633
+终竟 13.900677652
+枝蔓 10.9049453784
+竹鸡 12.8020653633
+以飨读者 11.8212361103
+老调 10.7226238216
+公关部 11.0674643079
+向南西 12.8020653633
+三十四个 13.2075304714
+地面实况 13.900677652
+赞同 7.68407155089
+枯草杆菌 13.900677652
+叉开 10.7226238216
+专拣 11.598092559
+浅笑 10.8096351986
+音韵学 10.4666904475
+鼻子 6.96142370593
+坐便器 13.2075304714
+鼻孔 8.11378027061
+贯流式 12.2912397395
+泯没 13.900677652
+湖南大学 11.1280889297
+战斗故事 11.8212361103
+烟灰 9.65218240993
+民间舞 10.2630914922
+天疱疮 11.7034530746
+烟火 8.80081122415
+终端 7.66626692626
+鸡首 13.900677652
+微露 10.4349417492
+王钱元 13.900677652
+经社理事会 12.8020653633
+丝帕 12.1089181827
+空白点 12.8020653633
+造福人群 13.900677652
+访问 7.22485443034
+玉源 10.3171587135
+奸淫掳掠 11.598092559
+北行 10.4349417492
+屋企 13.900677652
+甲羟戊酸 13.900677652
+北街 9.71102290995
+长春藤 12.8020653633
+巨轮 9.55687223012
+新的篇章 11.8212361103
+逢甲 12.2912397395
+提枪 11.8212361103
+驳杂 11.3357282945
+专报 12.8020653633
+音乐节目 13.2075304714
+洪若翰 13.2075304714
+不遑启处 13.2075304714
+公共电话 13.2075304714
+上饶 9.91169360541
+张顺自 12.8020653633
+黄榜 12.5143832909
+季亚 11.1280889297
+玉溪 10.2897597393
+苏舜钦 11.598092559
+磨砂玻璃 13.900677652
+三名 9.10488710638
+莫斯莱 13.2075304714
+任承应 13.2075304714
+自动线 11.8212361103
+上额 13.900677652
+泰比 12.5143832909
+轰炸机 8.12302532875
+火把 8.06586691491
+祝你们 12.5143832909
+风浪 8.51618258919
+上颌 9.54396882529
+数据位 13.900677652
+刘唐守 13.2075304714
+穆棱河 10.8561552143
+脂肪肝 8.93783302172
+赞善 11.1280889297
+作战区 13.900677652
+斯美尔 12.8020653633
+鲍忠 13.900677652
+银协巴 12.5143832909
+墙身 12.2912397395
+单车 10.3171587135
+跳梁小丑 13.2075304714
+宫卫 11.8212361103
+弗拉基米尔 10.4666904475
+布坦 12.8020653633
+陶阳镇 12.8020653633
+三十余头 13.900677652
+试试看 9.7898037878
+雅诗兰黛 13.900677652
+拉蒂尼 12.5143832909
+现实主义 7.97909923233
+弱碱 10.8561552143
+北见 13.900677652
+三心二意 10.2371160058
+干部群众 10.0505300503
+古镜古 13.2075304714
+买路钱 11.2616203224
+烟熏 10.0720362555
+上风 9.09665660724
+斗鸡眼 11.0103058941
+宫北 13.2075304714
+北角 11.1926274509
+品质因数 12.5143832909
+羽状复叶 9.58318953844
+鱼鹰 10.2897597393
+微雕 12.5143832909
+微雨 10.533381822
+罗氏鬼 12.8020653633
+埃伊萨 13.2075304714
+黄草坝 13.2075304714
+隆起 7.92179188707
+下课时 12.8020653633
+红名 13.900677652
+智谋 9.63799777493
+蒙童 13.2075304714
+大公报 10.0294766411
+梵净山 10.8096351986
+牛鉴 13.2075304714
+理想气体 10.3743171274
+李辅国 11.4157710022
+形旁 12.2912397395
+包装材料 10.1871055853
+遍地开花 11.0674643079
+专指 9.10488710638
+宋文富 9.0884932966
+火拼 12.5143832909
+焦兽目 13.2075304714
+郎蔡邕 12.2912397395
+脱脂奶粉 13.2075304714
+几十万元 10.0720362555
+骨碎补 13.2075304714
+继续加强 9.65218240993
+瓦赫什 12.2912397395
+蓝领阶层 13.900677652
+提醒您 11.7034530746
+千瓦 8.6803218269
+校园爱情 13.900677652
+翻下去 11.8212361103
+颓靡 12.2912397395
+伪学 12.8020653633
+瓦克语 13.2075304714
+宫口 12.1089181827
+韬略 9.80633308975
+白猴 13.900677652
+柔毛 10.533381822
+戊寅年 13.900677652
+三吨 12.8020653633
+谢霆锋 11.4157710022
+墓坑 11.0674643079
+从海道 11.598092559
+上万度 13.2075304714
+数量 5.29327819267
+似曾相识 9.82314020807
+轻质油 11.8212361103
+相当可观 9.69598503258
+伯祥兄 12.8020653633
+汽车新闻 13.2075304714
+银高 13.2075304714
+烟煤 10.4041700905
+雇用 8.47572763449
+耶泽尔察 13.900677652
+麻纺厂 11.2616203224
+张钦 12.2912397395
+张钧 13.900677652
+西沙群岛 9.69598503258
+墓地 8.20023407859
+偶氮 11.0674643079
+七百多年 11.9547675029
+马林迪 12.1089181827
+向云山 12.8020653633
+杨家将 10.6818018271
+远东局 13.2075304714
+专控 11.2616203224
+单面山 11.0674643079
+李虎儿 13.2075304714
+汤里 10.7226238216
+滑囊 11.598092559
+上项 11.4157710022
+灯罩 10.642581114
+唾手可得 10.2897597393
+引风机 13.2075304714
+穷苦人家 12.1089181827
+苏联最高苏维埃 10.4666904475
+必无 10.9562386728
+烟焰 12.2912397395
+查伊璜 13.2075304714
+自应 10.8561552143
+波浪鼓 13.2075304714
+定日 11.1280889297
+北西 9.44633035572
+小两口 9.98865464655
+侍子定 13.2075304714
+违抗上级 13.900677652
+鸡食 13.2075304714
+硅酮 13.900677652
+蔑称 12.1089181827
+平常事 12.2912397395
+探求 9.54396882529
+门阵列法 13.900677652
+便捷 8.4284069783
+厍狻保 13.900677652
+压马路 13.2075304714
+终宵 13.2075304714
+红飞翠舞 13.900677652
+承领 13.900677652
+专恣 12.2912397395
+湟源县 12.5143832909
+窗帘 8.91707103027
+必是 8.12612610643
+称号 7.36398605438
+马文昭 13.2075304714
+晁盖引 13.900677652
+包鸽松 13.2075304714
+芝麻 8.30596627237
+值日生 12.8020653633
+张青 9.71102290995
+卡托维兹 13.900677652
+自序 10.9049453784
+陈夫人 9.55687223012
+玉池 13.2075304714
+皮斯托亚 12.8020653633
+泰森 10.9049453784
+务农 9.19114745066
+驳斥 9.34680076038
+憨傻 13.2075304714
+布吉 11.2616203224
+无助 9.58318953844
+呆里呆气 12.8020653633
+金睛兽 11.7034530746
+南极圈 11.1926274509
+全国妇联 11.5027823792
+子图 12.5143832909
+无名氏 10.6818018271
+卡霍夫 13.900677652
+二手烟 11.9547675029
+采青 10.0505300503
+蓝晶石 11.1280889297
+有效氯 12.5143832909
+月利率 13.2075304714
+规模型 13.900677652
+红场 11.598092559
+抬来 10.4041700905
+五十二辑 13.2075304714
+微闭 10.7226238216
+抬杠 10.533381822
+经济合作与发展组织 11.0674643079
+管弦乐曲 10.4994802703
+波兰语 11.7034530746
+七叶 12.1089181827
+安斯科 13.900677652
+政治性 10.2371160058
+剩馀 12.8020653633
+红土 9.58318953844
+捉赃 13.900677652
+券别 13.900677652
+轻松愉快 10.533381822
+巨贾 11.7034530746
+姻家 12.5143832909
+发布会 7.53420720424
+喝够 11.8212361103
+喝多 9.98865464655
+巨贪 12.1089181827
+天养 12.8020653633
+剩饭 10.3743171274
+陈大夫 13.900677652
+加利福尼亚州 9.11318590919
+竹林精舍 13.2075304714
+下同 9.19114745066
+元古宙 11.0674643079
+呋喃 10.4349417492
+炻器 13.2075304714
+候审 11.8212361103
+巩俐 10.604840786
+艺术享受 12.1089181827
+抬枪 11.598092559
+水果皮 13.900677652
+主动攻击 11.7034530746
+张迁碑 13.2075304714
+前三强 12.5143832909
+原毛 12.8020653633
+开发者 11.0103058941
+不逞之徒 11.3357282945
+专情 13.2075304714
+校门口 11.0103058941
+航空界 12.1089181827
+监听器 13.900677652
+鼻头 10.0720362555
+切实 7.46934657004
+奥尔特 11.598092559
+正仓院 11.5027823792
+眠花宿柳 12.8020653633
+巴族 12.1089181827
+水果盘 12.5143832909
+六分钟 12.5143832909
+向西流 10.5684731418
+巨赞 12.8020653633
+喝好 12.5143832909
+玉河 12.1089181827
+中游 7.28998160726
+种勋贵 12.8020653633
+百老汇 10.2897597393
+为人注意 13.2075304714
+王双礼 13.900677652
+金童 12.8020653633
+招惹 9.43476953332
+巨资 9.20019728618
+七十余万 12.1089181827
+桶装水 11.2616203224
+干部职工 10.3171587135
+必有 7.70016847793
+示踪 11.2616203224
+死而不朽 13.2075304714
+布商 12.8020653633
+国画家 13.900677652
+浅碟 12.5143832909
+枝形吊灯 12.5143832909
+张陵 11.1926274509
+造福人类 11.2616203224
+银须 11.598092559
+淋菌性 13.900677652
+梁方平 11.3357282945
+委靡 12.8020653633
+倾诉人 11.598092559
+许从成 10.2897597393
+填字游戏 13.2075304714
+宁神司 13.900677652
+香辣 11.3357282945
+巩义 9.74179456862
+走家串户 13.900677652
+牛之一毛 13.2075304714
+心腹之患 10.533381822
+拉山头 13.900677652
+指导者 11.5027823792
+羊祜死 13.900677652
+狗贼 10.604840786
+理工学 13.2075304714
+第四款 12.8020653633
+底儿 10.0940151622
+春梦 10.7226238216
+上高 10.8096351986
+火情 13.900677652
+玉洞 13.2075304714
+提携 10.1164880181
+马从云 11.5027823792
+读书看报 13.2075304714
+大房子 10.3171587135
+徐敬业 11.1280889297
+红嘴 10.6818018271
+张阳 12.1089181827
+帕尔提 13.2075304714
+玉洁 12.1089181827
+认罪态度 11.1926274509
+阙遗 12.8020653633
+千田 12.8020653633
+树脂酸 12.2912397395
+留置权 12.1089181827
+上东 11.9547675029
+无心恋战 10.3743171274
+耿耿星河 12.5143832909
+夤缘攀附 13.900677652
+爱岗敬业 11.8212361103
+电脑设备 12.8020653633
+倾点 13.2075304714
+风雨凄凄 13.900677652
+大管家 10.6818018271
+张雨 11.5027823792
+旅客量 12.1089181827
+假孕 13.900677652
+北雁南 13.900677652
+加富尔 12.1089181827
+鬼吹灯 8.15447446144
+张雷 11.2616203224
+待月西厢 13.900677652
+洗澡间 11.3357282945
+高价股 10.1630080337
+清原满族自治县 13.900677652
+火性 11.7034530746
+资本外逃 12.8020653633
+火急 9.71102290995
+科托努 11.8212361103
+登舟 10.604840786
+鼻塞 9.6811699468
+隆达 11.4157710022
+阿里卡 12.8020653633
+别开生面 10.4349417492
+直言勿讳 13.900677652
+三十余家 12.8020653633
+土耳其政府 11.7034530746
+薄刃厚 13.2075304714
+流彩飞霞 13.2075304714
+碎语 13.900677652
+宫内 8.56313957227
+马骑灯 13.900677652
+布登勃 12.2912397395
+巨象 13.2075304714
+作弊者 12.1089181827
+张隽 13.900677652
+篡窃 11.9547675029
+瞿霆发 13.2075304714
+胜有声 12.2912397395
+窒碍难行 12.8020653633
+帆具 13.900677652
+导航台 11.598092559
+玉液 10.9049453784
+公老虎 13.2075304714
+吊带装 13.900677652
+香车 11.598092559
+民告官 12.1089181827
+上镜头 13.900677652
+含苞待放 11.2616203224
+隆迪 13.900677652
+第四次 8.1902506346
+玉润 11.9547675029
+喝得 9.33632946051
+陈应凤 9.7898037878
+脑盖骨 13.900677652
+战李应 13.2075304714
+南极光 13.900677652
+怪现象 10.8561552143
+葛条沟 12.5143832909
+葫芦头 12.2912397395
+轮流转 11.0103058941
+罗友伦 13.2075304714
+万美元 7.38744754106
+美学史 11.5027823792
+俗体字 12.8020653633
+蒙羞 11.8212361103
+刘二祖 13.900677652
+数具 12.5143832909
+非职业 11.8212361103
+文化场所 12.8020653633
+运起 12.5143832909
+边跳边唱 13.900677652
+具体位置 10.8096351986
+火枪 10.0940151622
+神木县 11.5027823792
+红光 8.95903522937
+将士用命 11.7034530746
+俄国 6.61517110345
+路之遥 12.8020653633
+生杀 13.900677652
+眺望 9.27570483869
+单螺杆 13.900677652
+红党 12.5143832909
+银鼠 11.5027823792
+导航员 12.5143832909
+污垢 9.72629038208
+明细账 11.1280889297
+监督岗 13.900677652
+卫仲乐 13.2075304714
+贝内特 11.9547675029
+圣周 12.5143832909
+阳道行 13.2075304714
+电动玩具 12.2912397395
+王朴知 12.8020653633
+红儿 9.40086798165
+布列 10.9562386728
+黄猫 13.900677652
+性经验 13.2075304714
+布利 11.3357282945
+克孜勒 11.9547675029
+兆比特 11.8212361103
+巴甫洛 13.900677652
+视力表 12.2912397395
+火柱 11.2616203224
+地方国营 13.2075304714
+火柴 8.44535653662
+提挈 11.8212361103
+布制 13.900677652
+极容易 10.604840786
+路怀有 13.2075304714
+伞形花序 10.7226238216
+暗礁险滩 12.5143832909
+底图 12.1089181827
+星岛日报 11.8212361103
+收听广播 13.2075304714
+三十本 13.900677652
+终结 7.91171623509
+可真会 11.8212361103
+媒妁之言 11.7034530746
+那名章 13.900677652
+漂泊无定 13.900677652
+渴盼着 13.900677652
+琴棋书画 11.0103058941
+布勒 11.1280889297
+烛光 8.81308131674
+土老财 13.2075304714
+向南走 10.6818018271
+前三天 10.4666904475
+李景俭 12.8020653633
+提提 10.642581114
+红净 13.900677652
+张采 11.7034530746
+无善德 13.900677652
+表现欲 12.8020653633
+拌种 12.2912397395
+宋文帝 10.9562386728
+张量 11.0103058941
+神木医 12.1089181827
+审计官 13.2075304714
+外在美 13.900677652
+卑亲属 13.2075304714
+风动石 11.598092559
+火机 13.2075304714
+肉浆 13.900677652
+绍熙 10.9049453784
+宫图 13.900677652
+万首 11.4157710022
+品质恶劣 12.8020653633
+嘉黎县 13.900677652
+美男子 10.8096351986
+竹马 12.1089181827
+每立方 13.900677652
+不攻自破 10.5684731418
+百姓生活 11.0674643079
+一大部分 10.3171587135
+玉檀 8.53003962385
+摔伤 10.0294766411
+官模样 13.900677652
+加利奇 13.2075304714
+把把关 13.2075304714
+虎纹蛙 11.9547675029
+郑士良 10.9562386728
+强梢允 12.8020653633
+摩崖 9.19114745066
+责罚 9.80633308975
+松下幸之助 12.2912397395
+布势 12.5143832909
+精密 8.27666014579
+布劳 11.4157710022
+油墨味 13.2075304714
+总计有 10.8096351986
+喝彩 9.62401153296
+团体比赛 13.2075304714
+红军 7.62968922012
+电力部门 11.9547675029
+太棒了 11.3357282945
+罗九曜 12.8020653633
+发痧 13.900677652
+切屑 11.9547675029
+卓膺 12.8020653633
+青海高原 11.1926274509
+北越 11.1280889297
+血液病 10.533381822
+窗外 7.52225146832
+政治权 13.2075304714
+连老子 13.900677652
+稳坐钓鱼船 13.2075304714
+特派 10.0940151622
+中国伊斯兰教协会 12.1089181827
+声阻 13.900677652
+涎水 10.6818018271
+专来 11.9547675029
+万顷 10.0940151622
+陈家峪 13.2075304714
+物有所 12.8020653633
+品牌鞋 12.8020653633
+永兴县 11.9547675029
+电子机票 13.900677652
+布卡 12.5143832909
+汤锅 11.598092559
+万顺 13.2075304714
+灯管 12.8020653633
+浅红 10.9049453784
+特洛 12.8020653633
+下咽 9.91169360541
+不锈钢板 12.5143832909
+火暴 10.3453295905
+陈大庆 12.5143832909
+大政方针 10.3453295905
+氨甲喋呤 13.2075304714
+扶起翁 13.900677652
+灯箱 11.8212361103
+电冰箱 10.0505300503
+专机 10.2117981979
+切尔 10.533381822
+便携 10.4349417492
+柳师父 12.8020653633
+去暑 13.2075304714
+布包 9.77354326693
+青蟹 11.3357282945
+赵温关 12.8020653633
+土豪劣绅 11.0674643079
+令人称奇 12.2912397395
+诚诚恳恳 13.900677652
+企划部 11.3357282945
+摔交 12.8020653633
+银鸽 13.2075304714
+氟氯烷 13.900677652
+善罢甘休 10.3171587135
+日本语 13.2075304714
+北路 8.78868986362
+汉留侯 13.2075304714
+切尼 13.900677652
+流泄出来 13.2075304714
+歌王 13.2075304714
+钻狗洞 12.8020653633
+幂指数 13.2075304714
+浅绿 10.4041700905
+布匿 10.3743171274
+帕尔旺 13.900677652
+水泥砂浆 12.2912397395
+郭凤岐 13.900677652
+李福林 13.2075304714
+发痛 11.8212361103
+桂殿兰宫 13.900677652
+阿尔谢尼 13.900677652
+国际威望 12.8020653633
+侄女儿 11.2616203224
+涎沫 12.5143832909
+特效药 10.642581114
+管账 11.1926274509
+鳔胶 12.8020653633
+俞剑华 12.5143832909
+宫城 9.12155415886
+气压表 11.8212361103
+江竹筠 12.8020653633
+传名 11.7034530746
+邮传部 11.0103058941
+转换器 10.1871055853
+提拨 12.8020653633
+火星 8.55834340001
+逮捕权 13.2075304714
+线膛炮 9.80633308975
+德言工容 13.900677652
+银黄 13.2075304714
+提拔 8.092535162
+专柜 10.0940151622
+咏春拳 12.8020653633
+拉托 11.9547675029
+称呼 7.73525979774
+陆军中尉 12.8020653633
+灯笼 8.22392384971
+去冬今春 12.1089181827
+王无诸 12.8020653633
+提拉 10.9049453784
+第六十章 12.8020653633
+疫情报告 12.8020653633
+万颗 11.3357282945
+墓区 12.2912397395
+阶沿 12.8020653633
+布厂 13.2075304714
+劳塔罗 11.9547675029
+千里送鹅毛 13.900677652
+和田润生 12.5143832909
+底垫 13.900677652
+提报 13.900677652
+石梁河水库 12.2912397395
+高音部 13.900677652
+饰非掩丑 13.900677652
+不争气 9.80633308975
+特混 12.1089181827
+葡币 13.900677652
+曹军新 13.2075304714
+串讲 13.2075304714
+喝干 10.0505300503
+张顺脱 13.2075304714
+张邈 11.1926274509
+愿不愿 11.0674643079
+摩尔 8.70218062071
+纤维状 10.0940151622
+北起 8.44963919841
+嘴硬 10.604840786
+系统论 10.1871055853
+摔下 11.598092559
+亿英镑 8.85725253506
+菌斑 12.2912397395
+大而化之 11.7034530746
+玉溅珠 13.900677652
+娇憨 11.7034530746
+洁霉素 13.2075304714
+倾盆 11.1926274509
+体验生活 11.1280889297
+下萨克森州 13.2075304714
+切当 12.8020653633
+益斋 13.2075304714
+石河子市 11.0674643079
+烟盒 9.91169360541
+即速 10.3743171274
+贴近性 13.900677652
+红印 11.0674643079
+附得 13.900677652
+器官移植 10.5684731418
+道乏 11.7034530746
+汤阴 10.9049453784
+玉桂 11.7034530746
+劳逸结合 10.8561552143
+必成 10.8096351986
+便条 11.9547675029
+敌忾同仇 13.2075304714
+流下去 13.900677652
+张清华 13.2075304714
+烛台 9.89334446674
+姻弟 13.2075304714
+新巴尔虎左旗 12.8020653633
+债市 6.92900904725
+正视图 13.900677652
+赞助 9.07236391467
+微醺 12.1089181827
+举世闻名 9.40086798165
+汲郡 12.2912397395
+程咨 13.900677652
+弋腔 12.8020653633
+进攻者 11.0674643079
+剪下来 11.2616203224
+玉桥 12.1089181827
+弄弯 13.900677652
+曹妃甸 11.2616203224
+环颈雉 11.7034530746
+王国成 11.0103058941
+簇生 10.0720362555
+石重贵 11.8212361103
+种质 10.2897597393
+冒尖户 10.6818018271
+一千多米 12.8020653633
+金饰 10.0720362555
+切开 9.12999302751
+墙角 8.38322475551
+鲁桓公 12.8020653633
+红包 9.66657114738
+精度高 9.71102290995
+校改 13.2075304714
+难以想象 9.06439574502
+模子 10.3171587135
+便服 9.84023464143
+卡菲 12.5143832909
+南极区 13.900677652
+谏大夫 12.8020653633
+火旺 10.0294766411
+一九三七年 11.0103058941
+大玩特玩 13.900677652
+帕尔曼 13.900677652
+昌阳 12.1089181827
+海河 8.74162235276
+扯下去 12.5143832909
+布洛诺夫 13.900677652
+希区柯克 12.2912397395
+红叶 9.98865464655
+安图县 12.8020653633
+红史 13.900677652
+晏阳初 11.1926274509
+切忌 9.37888907493
+柔波 13.900677652
+浅紫色 12.2912397395
+宽待 11.3357282945
+索得 13.900677652
+女教员 12.8020653633
+浅紫 13.2075304714
+鲍尔 11.3357282945
+汤隆 10.1871055853
+假寐 11.3357282945
+宇文恺卒 13.2075304714
+风餐露宿 11.2616203224
+赵良嗣 9.28555713513
+三唑 12.8020653633
+荣剑尘 12.2912397395
+魏攻赵 12.5143832909
+惊惶失措 10.8096351986
+参观点 13.2075304714
+火攻 9.59661255877
+寄禄 12.1089181827
+专擅 10.2630914922
+居兰陵 13.2075304714
+仰身直 12.1089181827
+奥尔登 13.2075304714
+迟缓 8.73589167805
+琴心 13.900677652
+风源 13.2075304714
+蹲到 11.5027823792
+椅背 9.71102290995
+互信 10.0294766411
+皮亚琴察 12.8020653633
+支开 10.8096351986
+玉梅 10.9049453784
+字林西报 12.5143832909
+觅取 12.8020653633
+烟瘾 9.89334446674
+师政委 11.7034530746
+安纳托 13.900677652
+川菜馆 12.1089181827
+刘明康 8.33615724465
+城市管理者 11.9547675029
+共析钢 13.900677652
+互保 10.6818018271
+前三季 7.32560181138
+烟瘴 12.8020653633
+避孕套 11.0103058941
+预作 10.8096351986
+东林寺 11.4157710022
+每千人 13.2075304714
+归心如箭 13.900677652
+轻工业品 11.1280889297
+我为鱼肉 13.2075304714
+讷河 10.4349417492
+哨所 10.8096351986
+红原 11.7034530746
+陆空 11.4157710022
+鸡鸡 13.2075304714
+卧下来 13.2075304714
+布光 13.900677652
+司卫 13.900677652
+鸡鸭 10.3453295905
+互为 9.01787572939
+掏心战 13.900677652
+黑中介 12.5143832909
+种系发生 11.598092559
+谷头子 11.598092559
+布兜 12.8020653633
+哨探 9.89334446674
+校政 13.900677652
+方准 12.1089181827
+银鱼 9.84023464143
+专教 12.2912397395
+作响 9.09665660724
+韦贝恩 11.9547675029
+枝芽 12.5143832909
+无职无权 12.8020653633
+南凉王 12.8020653633
+朱国治 12.8020653633
+梵语 9.5186510173
+妒富愧贫 13.900677652
+遗失物 13.2075304714
+北辰 10.3453295905
+互不 8.55357012126
+布兰 10.765183436
+傅秋芳 13.900677652
+各地风俗 13.900677652
+北边 8.14493543839
+驻华使节 12.5143832909
+白厂丝 13.2075304714
+张和龄 13.2075304714
+专政 8.28027678626
+卡萨尔 12.8020653633
+北迁 10.1871055853
+返璞归真 11.8212361103
+永顺县 13.900677652
+罗厄德 13.900677652
+汤面 10.8096351986
+抬手 8.66956903512
+购买决策 13.900677652
+红到 11.0674643079
+窗子 8.80081122415
+大难临头 10.4349417492
+刘炳森 13.900677652
+抬扛 12.8020653633
+普天下 10.4994802703
+固氮 10.4349417492
+礼品公司 13.2075304714
+管过 12.1089181827
+迁怒于 10.8561552143
+驾驶执照 12.5143832909
+老色鬼 13.900677652
+无力感 12.5143832909
+骠悍 12.5143832909
+精子 8.40761620864
+布儿 13.900677652
+黄嘌呤 13.2075304714
+途遇 13.900677652
+直隶省 10.765183436
+司卿 13.2075304714
+明窗净几 12.8020653633
+百姓遭殃 13.2075304714
+地动山摇 10.642581114
+综艺 10.7226238216
+拿起 7.74369866639
+候府 12.2912397395
+强凌弱 12.2912397395
+环城公路 12.5143832909
+无前 11.9547675029
+敢做敢当 13.900677652
+马洛湾 13.2075304714
+寻铃 13.900677652
+殚精竭虑 11.1280889297
+非吃 12.8020653633
+罗马队 12.8020653633
+喝尽 12.2912397395
+抬抬 12.1089181827
+灵虚 12.8020653633
+托运费 13.900677652
+村提留 12.8020653633
+窗格子 12.1089181827
+南亚地区 11.5027823792
+慧嵩 13.2075304714
+强词夺理 11.1280889297
+快上来 11.5027823792
+框架结构 10.9562386728
+银鳞 12.8020653633
+无论何地 13.900677652
+陈元晖 13.2075304714
+鹿兆海 9.96885201925
+落叶果树 11.7034530746
+宫喏 13.900677652
+硬生生 10.0720362555
+品牌策略 13.2075304714
+互以 13.900677652
+地沟油 13.900677652
+银鲳 12.2912397395
+江达县 12.5143832909
+专断 10.6818018271
+爱情小说 12.5143832909
+柔润 10.9562386728
+碱基置换 13.900677652
+魏末晋 12.8020653633
+商务中心 11.0103058941
+版画家 11.0103058941
+营养素 9.4233408375
+需水量 11.2616203224
+布冯 12.5143832909
+鼻尖 9.66657114738
+俄海军 10.2897597393
+污名 13.2075304714
+鸟尽弓藏 12.8020653633
+污吏 13.2075304714
+老贼 10.1394775363
+丁神 12.1089181827
+昌陵 13.2075304714
+四叶参 13.900677652
+王瑶卿 11.1280889297
+抢反弹 10.8561552143
+专文 11.9547675029
+巨螺 12.8020653633
+饱餐 10.9049453784
+特怪 13.900677652
+娇态 11.8212361103
+万镑 9.21854642485
+清俊 11.0674643079
+特急 12.8020653633
+特性 6.77861777035
+气宇不凡 12.8020653633
+应昌一 12.8020653633
+欣赏性 12.5143832909
+隋废郡 12.5143832909
+王溥仕 13.2075304714
+纠正错误 10.642581114
+切克 11.598092559
+那松烛 12.8020653633
+群体压力 13.900677652
+如释重负 9.69598503258
+泰拳 8.5440913773
+清修 11.8212361103
+北京火车站 12.5143832909
+玄天洞 12.5143832909
+汤山温泉 12.5143832909
+布干 11.598092559
+香蒲 11.0103058941
+务实 8.82550383674
+特恩 11.1280889297
+巨蟹 11.9547675029
+布市 13.2075304714
+玉皇传 13.2075304714
+菌株 10.9049453784
+上金 12.8020653633
+布帛 10.3743171274
+专横 9.69598503258
+上野 11.1280889297
+布帘 10.9562386728
+上釉 11.8212361103
+颍阳 12.2912397395
+成荫 11.0103058941
+布帕 13.2075304714
+菌根 11.0674643079
+饱饱 11.1926274509
+如芒刺背 13.900677652
+三十六策 12.8020653633
+宫娥 10.3743171274
+成周公 13.2075304714
+巨蟒 10.1394775363
+索超领 12.8020653633
+布带 11.8212361103
+烟碱 11.3357282945
+司南 11.0103058941
+右侍郎 9.21854642485
+颁给 10.533381822
+不敢肯定 10.8561552143
+喝口 10.8096351986
+公务用车 11.0103058941
+方一藻 12.8020653633
+万锭 11.9547675029
+竹雕 11.2616203224
+管胞 10.9562386728
+嘴甜 11.2616203224
+蔺相如 11.1926274509
+隆头鱼 12.8020653633
+偶数 9.84023464143
+北京电影制片厂 10.6818018271
+称奇 10.1164880181
+营养物 10.8561552143
+宫嫔 11.5027823792
+迷死人 13.900677652
+红巾 11.0103058941
+求乞 11.4157710022
+向洋兵 13.900677652
+巨蜥 11.5027823792
+碎肉 11.1280889297
+万间 12.8020653633
+奋斗终生 12.5143832909
+经邦之 13.900677652
+泛酸 11.5027823792
+切出 11.9547675029
+四季如春 10.5684731418
+多一会 11.4157710022
+消失掉 11.9547675029
+打破沙锅问到底 11.9547675029
+巨蜂 13.900677652
+万门 11.8212361103
+病魔缠身 13.2075304714
+动力设备 11.2616203224
+称多 12.8020653633
+特惠 10.765183436
+合辙押韵 13.2075304714
+自治省 11.7034530746
+滑倒 10.2897597393
+小驴 12.5143832909
+水果糖 10.642581114
+端赖 12.5143832909
+布店 11.3357282945
+山客 10.642581114
+航空网 11.8212361103
+之右 11.3357282945
+荆紫 13.2075304714
+关节 7.85094419674
+联合国人权委员会 13.900677652
+文件创建 13.2075304714
+蓬勃开展 11.8212361103
+愿和你 13.900677652
+望风而降 12.5143832909
+人人喊打 11.0674643079
+东游记 12.8020653633
+香葱 12.2912397395
+尚余 10.9562386728
+烧上 12.5143832909
+保险费 9.84023464143
+血液科 12.8020653633
+抗日民族统一战线 9.45802639549
+磅逊 12.1089181827
+玉材 12.8020653633
+平清盛 12.8020653633
+萧绍矩 13.2075304714
+晁盖听 12.2912397395
+少数干警 13.900677652
+红山 10.0505300503
+天津南开大学 12.5143832909
+职称外语 13.900677652
+急需处理 13.900677652
+便桥 13.2075304714
+清仓 9.89334446674
+论天 12.8020653633
+迂直 13.900677652
+游乐园 10.9049453784
+侯均方 12.8020653633
+乳腺癌 9.89334446674
+严格遵守 9.93038573842
+底孔 11.7034530746
+璀璨 9.69598503258
+墓志 10.2630914922
+底子 9.56994431169
+清代 6.53549752595
+航空线 9.61021821083
+低污染 10.9049453784
+奄忽 13.900677652
+玉杯 11.3357282945
+纸色 12.5143832909
+香薰 12.5143832909
+上邦 11.0103058941
+小学校长 10.642581114
+蔼蔼 11.9547675029
+香薷 11.4157710022
+汤饭 12.1089181827
+戈登 10.7226238216
+专款 10.9562386728
+登山者 13.2075304714
+减水剂 13.900677652
+管自 10.2117981979
+微黄 10.9049453784
+守卫边疆 12.8020653633
+实际成本 12.2912397395
+窨井盖 11.8212361103
+汤饺 13.900677652
+地藏王 11.2616203224
+十年怕井绳 12.1089181827
+杯盖 12.2912397395
+竹韵 13.2075304714
+交互作用 10.1630080337
+健谈 11.1280889297
+清亮 9.43476953332
+有效期 9.01787572939
+未见好转 11.5027823792
+东路军 9.66657114738
+硬设备 13.2075304714
+草虾 13.900677652
+候健 13.2075304714
+抗压强度 10.9562386728
+二三千米 12.5143832909
+之友 10.8561552143
+北至 8.62256299275
+清人 9.58318953844
+盘山道 13.2075304714
+红尘 9.80633308975
+巨蛇 11.598092559
+圩镇 11.3357282945
+没路可走 12.8020653633
+秦直道 13.2075304714
+作战室 10.9049453784
+前三名 9.63799777493
+苯乙酸 13.2075304714
+薪柴 11.7034530746
+南朝梁 9.80633308975
+臊子 10.2630914922
+秦入晋 13.2075304714
+巢雏 13.900677652
+苯乙酮 12.2912397395
+红峰 13.900677652
+上选 12.8020653633
+金束发 13.2075304714
+犛牛 13.900677652
+清乐 11.5027823792
+数据模型 13.2075304714
+天文数字 10.8561552143
+这段话 9.31571017331
+喝到 10.4666904475
+二千文 13.900677652
+玉柱 11.0103058941
+憨子 13.2075304714
+大吐苦水 12.5143832909
+清乡 10.7226238216
+茸毛 10.0294766411
+梅姐 10.604840786
+敏慧 11.9547675029
+寸劲儿 13.900677652
+一脉相通 13.2075304714
+岐阜县 13.2075304714
+宫寺 12.8020653633
+庭长 10.4041700905
+管脚 13.2075304714
+真重 13.2075304714
+麦瓦利 12.8020653633
+官房 12.5143832909
+香蕉 8.00352378434
+昌隆 10.4994802703
+站脚助威 12.8020653633
+埃纳雷斯 13.2075304714
+万钟 13.2075304714
+红岭 10.8096351986
+玛祖卡 12.8020653633
+傲然屹立 13.2075304714
+红岩 10.2117981979
+玉林 9.74179456862
+上道 11.8212361103
+巨虫 10.533381822
+蒙牛 9.37888907493
+烧伤 8.93783302172
+视网膜 8.86372504956
+一百多米 11.4157710022
+圣诞节 8.85725253506
+张鲸 8.63281949291
+宫官 11.7034530746
+金秋 10.3453295905
+埃默森 12.5143832909
+向罗虎 12.8020653633
+屯积 11.8212361103
+张鲁 9.94943393339
+左支右绌 13.2075304714
+宫室 9.11318590919
+突施 13.900677652
+一个五品 12.2912397395
+克耳孙 11.0103058941
+育空 11.8212361103
+蒙特 10.1394775363
+宫宰 13.2075304714
+耶教 13.2075304714
+娱悦 13.2075304714
+摆姿势 13.2075304714
+清丰 12.2912397395
+全手工 12.8020653633
+宁心安神 12.5143832909
+磷酸氢钙 13.900677652
+登记 7.06120121375
+底格里斯河 10.3743171274
+综述 9.59661255877
+十分满意 9.65218240993
+布局 6.40847460936
+永兴岛 10.765183436
+租金 8.230796729
+一晚 9.20932976975
+债券 5.8038601814
+穆斯堡 11.0103058941
+稀里呼噜 13.900677652
+布展 10.1630080337
+竹钉 12.2912397395
+危亡 10.0088573539
+程胜祖 13.900677652
+岳西 12.2912397395
+中沙群岛 10.3743171274
+莫西奥 11.4157710022
+到点 11.5027823792
+梁文楠 13.900677652
+积石山 10.9049453784
+批发价格 10.0720362555
+万面 12.8020653633
+俯首就擒 13.900677652
+东游西 13.900677652
+续谱 10.533381822
+千余艘 13.2075304714
+巨藻 11.598092559
+朱夫子 13.2075304714
+数学模型 8.75318317516
+断剑 9.80633308975
+升成 11.9547675029
+姚察曾 12.8020653633
+特批 11.2616203224
+拼写法 12.1089181827
+曾布任 13.2075304714
+北苑 12.1089181827
+男盗女娼 11.9547675029
+柔性 9.94943393339
+专校 13.900677652
+考古队 9.71102290995
+一秉大公 13.900677652
+注册资金 9.59661255877
+布尔 8.81927328699
+双蝶 13.900677652
+宫堡 12.2912397395
+一晤 11.0103058941
+并购案 11.1280889297
+天崩地坼 13.900677652
+冰清玉洁 11.5027823792
+张鼎 11.598092559
+半导体芯片 13.2075304714
+储备粮库 13.900677652
+喝出 11.8212361103
+张鼐 7.80710788193
+育秧 11.598092559
+专栏 9.36807815882
+芜劣 13.900677652
+模块 8.95903522937
+布尼 12.8020653633
+但宪宗 12.5143832909
+维纳恩湖 12.5143832909
+泰恒 12.8020653633
+轮圈 12.1089181827
+男朋友 8.94485059437
+太油 12.8020653633
+特报 13.900677652
+特护 13.2075304714
+底壳 12.1089181827
+切变 11.8212361103
+俊才 12.1089181827
+述要 13.900677652
+副检察长 10.9049453784
+程序性 11.598092559
+独幕剧 10.4666904475
+摩卡 13.900677652
+碎花 11.1926274509
+事项 6.65931136865
+慰勉 11.0103058941
+同吃同住 12.8020653633
+庭除 12.1089181827
+烛影 11.5027823792
+搁不住 10.9562386728
+红心 10.3743171274
+特技 10.3743171274
+模型 6.808103936
+剩酒 12.8020653633
+北航 11.8212361103
+银量 13.2075304714
+宫声 12.8020653633
+在野 9.87532596124
+汉宣帝 10.3743171274
+滥交 11.9547675029
+磨损量 13.900677652
+柔情 9.45802639549
+呼啸山庄 11.5027823792
+用钱 9.37888907493
+金步摇 12.2912397395
+日出日落 12.2912397395
+鼻儿 13.2075304714
+九万一千余吨 13.2075304714
+刀山 11.4157710022
+三道坎 13.900677652
+中标人 12.8020653633
+杜德美 13.2075304714
+宫墙 10.0940151622
+分配原则 11.2616203224
+布岗 12.5143832909
+之分 7.72897705456
+特拉 9.7898037878
+慰劳 10.0088573539
+终点 8.16733637508
+西藏自治区人民政府 12.8020653633
+性具 13.900677652
+一文钱 10.4666904475
+偶有 9.06439574502
+七公 13.900677652
+切去 11.8212361103
+特招 13.900677652
+红得 10.1164880181
+孤旅 12.2912397395
+张龙 11.4157710022
+梁兄 13.2075304714
+任秦 12.2912397395
+收破烂 11.7034530746
+博落回 13.2075304714
+上万名 11.2616203224
+张鹤 12.5143832909
+王素莉 13.900677652
+伯以田 13.2075304714
+斯拉夫人 9.56994431169
+三十年河东 11.598092559
+算不上 9.11318590919
+归林 13.2075304714
+连捧 13.900677652
+闽侯 10.642581114
+切削 9.23723855786
+拯民 11.9547675029
+天峨县 13.2075304714
+用错 12.5143832909
+轴线 9.20932976975
+大队人马 9.4233408375
+切割 7.94484028251
+心绪不宁 11.1280889297
+子兵 10.642581114
+张鹏 11.9547675029
+特指 10.0720362555
+赞德 12.5143832909
+宫女 6.91688768672
+异同 9.35738286971
+银道 11.5027823792
+巡线 12.8020653633
+有张有弛 12.1089181827
+滕文生 13.900677652
+雕花 9.19114745066
+戎行亲 13.2075304714
+观摩演出 11.9547675029
+浓荫蔽日 12.8020653633
+红带 12.5143832909
+自尊 9.13850371718
+酿造酒 13.2075304714
+二十七八岁 12.8020653633
+红帮 12.8020653633
+陆镜若 12.5143832909
+近几年 8.06294720481
+切切 10.533381822
+切分 11.0103058941
+详略 12.2912397395
+切刀 12.5143832909
+红帽 11.9547675029
+塞奇威 12.2912397395
+空白符 12.2912397395
+张鸿 12.2912397395
+红帅 9.7898037878
+愚公移山 11.5027823792
+红布 9.87532596124
+芒戈 12.2912397395
+嘴直 12.5143832909
+吴老板 11.0103058941
+自封 10.3743171274
+红帕 12.8020653633
+阮黑 8.86372504956
+子敬休 12.8020653633
+两班制 13.2075304714
+一个天 11.9547675029
+切利 12.2912397395
+玄德先 12.5143832909
+谢居士 13.900677652
+断绝关系 10.8096351986
+四面体 10.4349417492
+烟筒 10.604840786
+开上 10.2630914922
+组织路线 11.3357282945
+火树 12.2912397395
+那波里 12.1089181827
+绍纳 11.598092559
+管茶 13.2075304714
+古建筑群 10.4666904475
+算不了 10.1164880181
+赵家璧 12.2912397395
+万零 13.900677652
+五彩纷呈 12.8020653633
+提法 9.01787572939
+朗伯 11.2616203224
+背光灯 13.900677652
+张黎 10.9049453784
+誓死不屈 13.900677652
+稳婆 12.8020653633
+严台端 13.900677652
+布巾 12.5143832909
+见谅 10.6818018271
+范黎 13.900677652
+名垂千古 12.8020653633
+死马当作 12.8020653633
+菌毛 13.900677652
+布巴 12.2912397395
+玉料 11.598092559
+意在沛公 11.9547675029
+梅妻 13.2075304714
+美玉 9.72629038208
+平均功率 12.2912397395
+麻杏石 12.8020653633
+刘司令 8.33615724465
+渺无 12.8020653633
+梅兰芳 9.80633308975
+玉斗 13.900677652
+旗帜鲜明 9.89334446674
+摩利 12.5143832909
+万隆 8.87679713113
+叶和茎 12.5143832909
+故犯 12.2912397395
+债台 12.1089181827
+独资企业 11.0103058941
+佟氏 11.4157710022
+觅路 11.5027823792
+假恶丑 13.900677652
+都匀市 11.9547675029
+费罗兹 13.2075304714
+万难 10.1871055853
+巨著 9.24671730182
+索姆库 13.900677652
+红底 11.4157710022
+吴廷英 10.2630914922
+秦凤军 11.0674643079
+元济匿 12.8020653633
+险象环生 10.9049453784
+绿衫 13.2075304714
+蒙灵 13.2075304714
+红庙 12.5143832909
+翘尾巴 13.2075304714
+委顿 11.2616203224
+极地气象 13.2075304714
+醇酒美人 13.900677652
+陆间海 11.9547675029
+惶遽 13.900677652
+藏伯希 13.900677652
+三十余名 12.5143832909
+莫力达瓦达斡尔族自治旗 11.8212361103
+和超微 13.2075304714
+玉手 11.598092559
+近几天 9.75754292558
+堪忧 9.46986085313
+二百五十万两 12.8020653633
+能言快说 13.900677652
+北蒙 13.2075304714
+白莲花 12.2912397395
+勉为 13.2075304714
+赎回费 9.93038573842
+香肠 10.1871055853
+周维衍 12.2912397395
+示例 12.5143832909
+泰曼 13.2075304714
+营养盐 11.9547675029
+上万匹 12.8020653633
+十强赛 13.900677652
+综观 9.93038573842
+仔细想 10.9562386728
+索伦兵 13.2075304714
+通古今 11.2616203224
+谦虚谨慎 11.3357282945
+金银花 9.41204128224
+综览 13.2075304714
+消磨时光 11.598092559
+聚友网络 13.2075304714
+采购额 11.8212361103
+戈埃尔 13.900677652
+玉成 11.2616203224
+私底下 10.4041700905
+子充 10.2371160058
+提款 11.3357282945
+迟疑 7.73316116109
+共同纲领 9.96885201925
+红头 10.7226238216
+美学家 10.8096351986
+汤鱼 12.8020653633
+红夷 11.9547675029
+烟粉 12.2912397395
+民意机关 12.8020653633
+十七万左右 13.900677652
+口惠而实不至 12.5143832909
+观望不前 12.8020653633
+务必 8.00078029839
+哨棒 10.8096351986
+一百多种 12.8020653633
+贝希特 12.5143832909
+水星号 12.5143832909
+红外 8.06586691491
+上门 8.42003872863
+上闩 11.9547675029
+铁路线 8.91707103027
+灰黄霉素 13.2075304714
+侨领 13.2075304714
+底布 11.9547675029
+伊巴尼 12.8020653633
+终盘 9.58318953844
+心惊胆裂 13.2075304714
+管营 9.75754292558
+上错 13.2075304714
+万金 9.80633308975
+坠入情网 12.8020653633
+习战射 13.2075304714
+心地狭窄 13.2075304714
+帆布 9.5062284973
+一亿一千万元 13.2075304714
+返美 11.7034530746
+万重 12.5143832909
+万里 8.1902506346
+上锁 10.9049453784
+阿里山 10.2371160058
+品牌意识 12.1089181827
+孙沈振 13.2075304714
+人际关系 9.14708746087
+脊髓炎 11.7034530746
+通什市 11.598092559
+堪当 12.5143832909
+屈明泉 12.2912397395
+宫廷 7.25949548224
+宫延 13.900677652
+中国艺术研究院 12.8020653633
+漏芦 13.900677652
+模写 12.5143832909
+泰普 13.900677652
+上镜 12.2912397395
+佐佐木 13.2075304714
+宫庄 11.8212361103
+蒙着 9.16447920358
+各年级 11.5027823792
+烛夜 13.900677652
+浙东 8.48457724977
+底座 9.65218240993
+亮晃晃 12.1089181827
+泰昌 12.2912397395
+宫府 10.6818018271
+苗栗 10.765183436
+红妆 11.4157710022
+北极雪 13.900677652
+浙中 11.598092559
+隆胸 10.7226238216
+李福清 12.8020653633
+承认现实 12.1089181827
+宫庭 11.598092559
+出肉率 12.8020653633
+驳正 11.7034530746
+愿者 12.5143832909
+狼道 13.900677652
+南非语 13.2075304714
+打开门 10.0505300503
+柔板 13.2075304714
+伯颜猛 13.900677652
+万道 10.2630914922
+香膏 12.8020653633
+毗邻 8.58255765813
+终止符 13.900677652
+昔年 10.604840786
+转战千里 13.900677652
+渔鼓 11.1926274509
+弓亚纲 13.900677652
+战秦军 13.2075304714
+火源 11.1926274509
+张顺 8.89673134603
+葡国 12.2912397395
+立明宗 12.1089181827
+便池 12.5143832909
+滚刀肉 12.1089181827
+风潮 8.80692745117
+蒙皮 10.604840786
+万海里 11.7034530746
+无头无尾 11.598092559
+张光斗 12.8020653633
+红塔 10.1164880181
+多普勒 9.31571017331
+上钩 9.89334446674
+霍瓦兹 13.2075304714
+战争论 11.0674643079
+宫巡察 12.8020653633
+电子行业 10.765183436
+上钢 11.598092559
+电话机 9.35738286971
+无名指 10.1164880181
+韩新月 9.62401153296
+红堡 11.8212361103
+帕斯夸尔 13.2075304714
+宫式 12.8020653633
+万通 8.79473217808
+能上场 13.900677652
+合法政府 11.1926274509
+柔术 12.8020653633
+浅盘 13.2075304714
+航空站 10.2897597393
+猛将 9.58318953844
+俊文 10.4994802703
+时事新闻 12.5143832909
+墓室 7.69814213479
+特效 9.75754292558
+上链 13.900677652
+香臭 13.2075304714
+上铺 9.29550746599
+蒙目 12.8020653633
+无以伦比 13.900677652
+便民 10.604840786
+元惠宗 12.2912397395
+特教 12.2912397395
+候命 11.9547675029
+一百万名 13.900677652
+龙头企业 8.42003872863
+红壤 9.12155415886
+簇绒 12.8020653633
+特斯 10.9562386728
+东北财经大学 13.900677652
+平儿一一 13.2075304714
+姜素荣 11.1926274509
+巨舰 11.598092559
+香脂 11.8212361103
+香脆 11.9547675029
+缅因州 10.9562386728
+回春之术 13.900677652
+铁路网 9.59661255877
+倪云林 11.7034530746
+研发 6.77781099338
+坦白讲 12.8020653633
+三利 13.900677652
+普仁特 13.2075304714
+巨舟 12.8020653633
+嗣位 10.0294766411
+高攀不上 13.900677652
+柔柔 11.9547675029
+泰来 9.27570483869
+玄德知 12.8020653633
+闭会 10.2630914922
+张飞 8.61747392324
+万部 10.9562386728
+特早 13.2075304714
+树杪 12.8020653633
+查回来 13.900677652
+衣褶飘 13.2075304714
+宫律 12.8020653633
+布宁 13.2075304714
+异味 9.6811699468
+珠宝网 12.5143832909
+前进报 11.1926274509
+殷正茂 8.65365357982
+印刷纸 12.8020653633
+叶志超 11.4157710022
+坦白说 12.5143832909
+挪威王国 13.2075304714
+中学物理 13.900677652
+二手网 13.900677652
+噤声 11.2616203224
+匡救 11.7034530746
+高等法院 10.2897597393
+布宣 12.8020653633
+山西省临汾地区 12.1089181827
+靳文然 13.2075304714
+浅白 12.1089181827
+万邦 11.5027823792
+了解 5.09665274956
+张颖 11.2616203224
+调下去 13.2075304714
+禁忌症 10.604840786
+思想斗争 10.5684731418
+红墙 9.45802639549
+苯妥英钠 12.8020653633
+切块 11.0103058941
+天津地区 10.7226238216
+红学 11.1280889297
+喝喝 11.4157710022
+碌碌庸才 13.2075304714
+布里格斯 13.2075304714
+银镯 11.8212361103
+称心 10.1871055853
+奥尔级 13.2075304714
+走下 9.14708746087
+土掉渣 13.900677652
+泛音 11.0103058941
+克拉玛依 10.604840786
+计算机主机 12.1089181827
+加强免疫 13.2075304714
+枪乌贼 11.8212361103
+桑结嘉 11.598092559
+示范 8.00627481771
+声誉鹊起 11.9547675029
+研制 6.41462503411
+内司委 13.900677652
+红字 10.604840786
+激酶 12.2912397395
+颓风 11.2616203224
+香花 10.1164880181
+棱锥 12.1089181827
+银镜 12.2912397395
+花招 10.1164880181
+再上去 11.9547675029
+番代 13.900677652
+务工 10.0088573539
+刑事处分 11.5027823792
+孟菲斯 12.8020653633
+汤鹤 12.8020653633
+上万元 10.642581114
+综论 12.8020653633
+银锭 10.0088573539
+模印 12.1089181827
+聚苯 12.1089181827
+灯烛 9.32596667347
+综计 13.2075304714
+詈骂 11.3357282945
+遵化市 11.8212361103
+一服 11.0103058941
+调味酱 13.900677652
+有效性 8.39941944143
+青萝卜 12.2912397395
+断种 12.8020653633
+中间环节 10.2117981979
+九间大殿 13.900677652
+罗勃特 13.900677652
+三友 10.2117981979
+贝克特 11.2616203224
+火淬 13.900677652
+萨宝府 13.2075304714
+尚祈列 13.2075304714
+蒙茹瓦 13.900677652
+登过 11.598092559
+非其所能 13.900677652
+轻工业局 11.9547675029
+广大干群 13.900677652
+加害者 13.2075304714
+停诊 13.900677652
+犹太国 11.5027823792
+玉性 12.2912397395
+商业用途 11.7034530746
+连台好戏 13.900677652
+金文宜 13.2075304714
+香舌 13.900677652
+奇珍异宝 10.9562386728
+余粮收集 12.8020653633
+林水镜 12.8020653633
+日食带 13.2075304714
+墙脚 11.0103058941
+当选者 12.1089181827
+一望 8.56313957227
+阿鲁纳 12.8020653633
+远东区 12.5143832909
+幼发拉底 13.900677652
+叶子花 13.900677652
+说话算话 11.598092559
+中水 10.3453295905
+模压 11.1280889297
+践祚 12.8020653633
+顾应祥 13.900677652
+一期 7.48885938427
+火洲 12.2912397395
+地毡 13.900677652
+美国斯坦福大学 10.4041700905
+剑眉 11.2616203224
+蒙田 12.5143832909
+紫铜 11.5027823792
+红烧鱼 12.8020653633
+迟睡 13.2075304714
+专治 10.5684731418
+侄女婿 13.900677652
+练写 13.900677652
+胡为乱信 13.900677652
+加利卜 13.2075304714
+称引 13.2075304714
+海伦市 12.2912397395
+卢奥 11.9547675029
+百五十亩 13.2075304714
+登载 8.94485059437
+红宫 12.1089181827
+吴为那 10.765183436
+登车 11.0103058941
+异构体 9.48183704418
+一百六十四座 13.2075304714
+目标语言 12.8020653633
+特曲 11.598092559
+艾迪森 13.900677652
+灯火 8.32094782599
+贾诩 10.3171587135
+拉回来 10.0505300503
+红安 11.1926274509
+尔佳 9.87532596124
+杜主管 12.5143832909
+香港队 13.2075304714
+秦淮书 12.5143832909
+蟾宫 10.9049453784
+麦库尔 13.2075304714
+驻在国 11.3357282945
+孙文学说 13.900677652
+伊斯兰共和国 12.5143832909
+劳动部 11.598092559
+红宝 10.4349417492
+香艳 11.3357282945
+葛特 12.8020653633
+头昏脑胀 11.4157710022
+智识 12.2912397395
+上面 5.95973788965
+赶上去 10.0294766411
+济宁市 10.7226238216
+苏兆征 11.4157710022
+虎毒不食子 12.8020653633
+上万倍 12.8020653633
+诬告者 11.7034530746
+李蓉 13.900677652
+银鑫 13.900677652
+关上灯 11.9547675029
+地主之谊 11.7034530746
+闹中取静 11.598092559
+三号 9.96885201925
+张驴 13.2075304714
+模制 12.2912397395
+于仕宦 12.5143832909
+劳动合同 10.0505300503
+博乐市 13.2075304714
+布套 11.9547675029
+泰族 12.1089181827
+萧德言 12.8020653633
+特有 7.12874209614
+特服 11.9547675029
+肆行无忌 13.900677652
+抽样误差 13.900677652
+康心孚 12.8020653633
+二百三十五 13.900677652
+松杉 11.2616203224
+壳质 11.5027823792
+蒙哥马利郡 13.2075304714
+梭织机 12.2912397395
+提案 9.16447920358
+盛情接待 13.2075304714
+特朗 11.598092559
+宏旨 13.900677652
+折进去 11.8212361103
+泰斗 11.2616203224
+微风 9.23723855786
+身外之物 10.4994802703
+晋侯 12.5143832909
+特来 8.19356738723
+宫崎 13.2075304714
+鼻咽 10.2630914922
+簇簇 10.4666904475
+欧美音乐 13.900677652
+称庆 11.9547675029
+泰文 12.1089181827
+火法 10.9049453784
+重言式 13.900677652
+杜国庠 12.1089181827
+上集 10.7226238216
+陈大哥 13.900677652
+市场供应 9.24671730182
+阏氏 11.7034530746
+金世宗 10.4349417492
+参观票 13.900677652
+舰地导弹 13.900677652
+特权 7.5515386606
+雅克萨 11.2616203224
+脸盘儿 11.9547675029
+租钱 11.7034530746
+必死 9.80633308975
+心毒手辣 11.9547675029
+望远镜 8.08654712015
+石岛湾 12.5143832909
+红娘 10.3453295905
+泰斯 11.598092559
+布头 12.2912397395
+吴蔚云 13.2075304714
+妖言惑众 11.5027823792
+淤积 8.51618258919
+养猪业 10.8096351986
+郭景昌 13.2075304714
+全邦 10.1871055853
+香茅 10.2897597393
+布姆 13.2075304714
+装卸区 11.3357282945
+沃斯堡 12.2912397395
+剁成 10.9562386728
+龙禁尉 11.9547675029
+火气 8.86372504956
+一杆 9.28555713513
+购买国 13.2075304714
+床笫之欢 12.8020653633
+香茗 11.8212361103
+银铃 10.6818018271
+合格率 10.1164880181
+上阵 9.41204128224
+俊杰 10.642581114
+香茹 13.900677652
+加利利 11.8212361103
+拉瑟尼 13.2075304714
+属人法 11.5027823792
+二百三十一 13.2075304714
+踏来踏去 13.2075304714
+表现性 12.1089181827
+特林 11.9547675029
+灯焰 11.5027823792
+香草 9.69598503258
+代青贝 13.2075304714
+便溺 12.5143832909
+两件事 8.81927328699
+银钩 12.8020653633
+烟缕 12.8020653633
+俊朗 11.4157710022
+取适量 12.1089181827
+称帝 7.83456956187
+银钱 8.90346537821
+短跑道 13.2075304714
+马占鳌 13.900677652
+拘束力 10.6818018271
+劳动量 8.87679713113
+厄普 12.8020653633
+乳腺炎 11.3357282945
+蒙尼德 12.2912397395
+银针 10.4994802703
+守车 12.2912397395
+猥亵妇女 13.900677652
+张骏 11.9547675029
+鸡雏 11.8212361103
+烃类 10.0720362555
+恶性瘤 13.900677652
+惹起来 13.900677652
+提梁 11.9547675029
+严嵩窥 12.8020653633
+偶或 12.8020653633
+窗台 10.604840786
+大沽口 11.5027823792
+紫钗 12.8020653633
+拼上 10.533381822
+拼下 12.5143832909
+上院 9.85762638414
+脂肪醇 12.2912397395
+清城 11.8212361103
+西连淮 13.2075304714
+五百多年 11.8212361103
+赵铭彝 13.2075304714
+励进 13.900677652
+拼出 10.8561552143
+扑上来 10.1630080337
+跳下去 9.61021821083
+中注 12.8020653633
+提督 8.55834340001
+掰开 10.0294766411
+歌曲 8.32094782599
+特邀顾问 12.8020653633
+深灰色 10.6818018271
+泛览 12.8020653633
+两句话 9.05649056552
+灾变 10.533381822
+马头山 11.9547675029
+巨龙 10.0505300503
+巨龟 11.3357282945
+管领 9.55687223012
+万安县 11.7034530746
+生小孩 11.598092559
+网状 9.22784881751
+精工 9.84023464143
+提着 7.57095674645
+专版 13.2075304714
+畿内 10.8096351986
+子皇帝 13.900677652
+义侠记 13.2075304714
+明唯识 13.900677652
+全国代表大会 8.28754954559
+谢雪桥 13.2075304714
+薄伽梵 11.598092559
+折扣率 11.8212361103
+北风 8.98069672615
+单纹孔 13.2075304714
+蒙毅 12.2912397395
+银行帐号 13.900677652
+上角 12.8020653633
+后掠角 10.6818018271
+开麦拉 11.0674643079
+气象要素 10.533381822
+起飞时 10.9049453784
+浦发银行 8.37124856446
+越久越 12.2912397395
+蒙蒂尼 13.2075304714
+鸡西 11.0674643079
+瓦当 9.98865464655
+正智 13.2075304714
+饱腹 10.9562386728
+明叔见 10.9049453784
+工厂化 10.4994802703
+新罕布什尔 12.1089181827
+晒衣服 12.2912397395
+东向西 9.6811699468
+刍荛之见 13.900677652
+租让 11.1280889297
+万贯 10.7226238216
+走门子 13.900677652
+灾厄 11.7034530746
+上解 11.7034530746
+后勤部 10.3743171274
+勉力 10.7226238216
+老家伙 9.44633035572
+瓦德 12.1089181827
+文过饰非 13.2075304714
+严砺 13.2075304714
+科克雷尔 13.2075304714
+一杯 7.31037660378
+药疗法 13.2075304714
+褚元海 9.77354326693
+激进 8.03138073884
+万紫千红 11.7034530746
+梁兴 11.9547675029
+扑满 12.5143832909
+海军东海舰队 13.2075304714
+薪给 12.2912397395
+巩州 12.8020653633
+勉励 9.7898037878
+和庆连 12.8020653633
+孙绍祖 12.2912397395
+二手房 8.21031819765
+商业伙伴 12.8020653633
+经济评价 11.1280889297
+火猴 12.8020653633
+拼光 13.2075304714
+灾区 9.26594866375
+目瞪口呆 8.47572763449
+巨齿 12.1089181827
+离子轰击 12.8020653633
+岔沟 11.1926274509
+廖化至 12.8020653633
+贺拔度 13.2075304714
+季度 6.43273531969
+朱颜 12.1089181827
+田笑笑 12.8020653633
+二百三十八 13.900677652
+闹腾 9.26594866375
+余秋里 12.8020653633
+太劳神 12.5143832909
+马勺全 12.5143832909
+劫车 13.900677652
+劳考晋 12.8020653633
+万足 11.9547675029
+三十九岁 12.1089181827
+好几条 10.8561552143
+蒙此 13.2075304714
+蒙武 12.8020653633
+变流器 11.7034530746
+脂肪酶 12.2912397395
+安西府 12.5143832909
+香鱼 12.1089181827
+莫斯科红场 11.9547675029
+清场 11.598092559
+达瓦买提 13.2075304714
+歌星 10.7226238216
+空空导弹 9.22784881751
+政治犯 9.91169360541
+脂肪酸 9.02548032877
+重样 11.598092559
+沼气池 11.598092559
+土尔扈特 11.0103058941
+温总理 9.87532596124
+比个高下 12.8020653633
+南非队 12.5143832909
+向仲华 12.8020653633
+赵忠 10.9562386728
+繁荣市场 13.900677652
+胶版印刷 12.8020653633
+凉风阵阵 13.2075304714
+俊秀 10.1630080337
+吴为转 13.2075304714
+谢通门 13.2075304714
+防裂 13.2075304714
+蜚语 12.8020653633
+上万个 11.0674643079
+老家人 10.9562386728
+布留尔 12.8020653633
+发短 12.2912397395
+拖回去 12.1089181827
+宋家寨 9.10488710638
+囊括 9.15574552361
+向南飞 11.9547675029
+政治动员 12.5143832909
+张著 12.1089181827
+万象 9.82314020807
+萧鸾 12.2912397395
+终止 7.33541268194
+钱塞勒 13.900677652
+跳跳床 13.900677652
+思想库 12.2912397395
+万豪 11.8212361103
+贾萍 13.2075304714
+田菁属 12.8020653633
+复读生 12.5143832909
+蜃楼 12.5143832909
+运载火箭 9.13850371718
+弋阳 10.8561552143
+奉行 8.08059472162
+黑色火药 12.1089181827
+新颜 13.900677652
+电话筒 11.5027823792
+上装 10.0294766411
+侵蚀 7.65845438652
+石板路 11.0674643079
+五位数 12.1089181827
+鸡血 10.5684731418
+丁宗洛 13.2075304714
+马军来 13.2075304714
+茶庵 12.5143832909
+相似之处 9.12155415886
+樊楼前 12.8020653633
+恶迹昭著 13.900677652
+张萌 12.2912397395
+辉钴矿 13.2075304714
+支墩坝 12.1089181827
+薛宝琴 12.8020653633
+艾森克 12.1089181827
+四分五裂 9.82314020807
+柔肠百结 13.900677652
+小把戏 11.9547675029
+左氏 11.2616203224
+陆离 12.2912397395
+育成 9.91169360541
+火爆 6.97116088121
+七十余岁 12.5143832909
+容积率 9.41204128224
+碰巧是 11.9547675029
+麻木不仁 10.1394775363
+道德行为 10.765183436
+肾脏科 13.2075304714
+宇文忻 11.9547675029
+解理 9.69598503258
+三十 8.0484751722
+嬉皮士 13.900677652
+相电流 13.2075304714
+建功立业 10.2371160058
+百分之三十 10.8096351986
+自卸 11.8212361103
+糖果花生 13.900677652
+垃圾场 11.5027823792
+浙南 9.96885201925
+鲜明特征 12.8020653633
+巨鸟 12.8020653633
+勉县 12.8020653633
+言不由衷 11.1280889297
+倒萨 13.900677652
+开幕典礼 13.900677652
+诱导型 13.900677652
+簇拥 8.53470163695
+三百余匹 13.2075304714
+自主神经 11.1926274509
+玉翠 11.4157710022
+国尽节 11.0103058941
+巨鹿 10.3743171274
+故宫博物院 9.28555713513
+有幸 9.20019728618
+玉函方 13.2075304714
+巨鹰 13.900677652
+上街 8.78268383956
+汤臣 11.598092559
+测微计 13.900677652
+上行 6.38478856676
+金明昌 11.5027823792
+一夜间 9.89334446674
+剑桥 9.37888907493
+火牛 12.8020653633
+特称 10.8096351986
+季德 12.8020653633
+浙北 10.765183436
+向淘宝 12.8020653633
+特种 7.69208762588
+木板房 11.1926274509
+火物 13.900677652
+新步 13.2075304714
+闽商 11.7034530746
+上表 9.02548032877
+上万份 11.8212361103
+吊铺 13.900677652
+通非通 12.8020653633
+人人有责 11.8212361103
+黑格尔 8.76487921493
+哽噎 12.1089181827
+贫富不均 11.4157710022
+上万件 12.8020653633
+上衣 8.4801426527
+讽诵 12.2912397395
+燕窝汤 11.1280889297
+母鱼科 12.8020653633
+空压机 12.2912397395
+整理行装 12.5143832909
+腓特烈 9.96885201925
+微薄 9.54396882529
+下坡 9.66657114738
+五亿八千万 13.2075304714
+波普拉 13.2075304714
+特稿 10.6818018271
+敬老养老 13.900677652
+讽语 13.2075304714
+薄熙来 10.4349417492
+申鉴 13.900677652
+龙骧虎视 13.2075304714
+步度根 11.598092559
+上访 8.58255765813
+打印文件 12.8020653633
+泛读 13.2075304714
+硝磺 11.8212361103
+万载 10.4041700905
+提留 11.1280889297
+邓波儿 12.5143832909
+李忠笑 13.2075304714
+激起 7.77162744192
+灯油 10.1871055853
+王钟声 12.8020653633
+工程师 7.79811905736
+加尔各达 13.2075304714
+王实甫 10.9049453784
+上计 11.1280889297
+不可自拔 11.7034530746
+创业基金 11.0674643079
+法兰士 12.5143832909
+抬着 9.23723855786
+于巨室 12.8020653633
+红烧肉 10.8096351986
+听的歌 12.8020653633
+徐长卿 12.8020653633
+张顺成 11.2616203224
+上诉 8.85725253506
+开发部 12.5143832909
+海百合 11.3357282945
+农业投入 12.8020653633
+上证 7.19994654243
+街上 6.92807140067
+七帮 13.900677652
+上课 8.46695564842
+有情人 11.8212361103
+宋江央 13.2075304714
+石堡城 12.8020653633
+滋育 13.2075304714
+泛论 13.2075304714
+答应 6.29478765092
+手电筒 8.18694484647
+灯泡 9.58318953844
+贝赫切 13.2075304714
+玉簪 10.533381822
+土默特 10.765183436
+斯洛伐克 9.49395840471
+付汇联 13.2075304714
+纳斯州 13.900677652
+好几本 13.2075304714
+季尔 13.2075304714
+嗡嗡 9.14708746087
+晁盖便 11.1926274509
+毛坯房 12.8020653633
+刘清芬 11.7034530746
+千杯 13.2075304714
+硬指标 10.4349417492
+聚礼会 13.2075304714
+随带 11.2616203224
+异构化 10.604840786
+波特尔 12.1089181827
+火焚 10.7226238216
+魏恩加 12.5143832909
+李光地 11.9547675029
+韬晦 11.8212361103
+华东局 11.0674643079
+一柄 9.04086524761
+铁路桥梁 12.2912397395
+执行局 10.604840786
+电动式 12.5143832909
+君暗臣蔽 13.900677652
+林则徐 9.65218240993
+拼博 13.2075304714
+互定 13.900677652
+管风琴 10.4041700905
+银角 12.2912397395
+到校 11.0674643079
+清啸 13.900677652
+山尖 11.0103058941
+株守 11.9547675029
+小便池 13.900677652
+凌云志 13.900677652
+前三位 9.77354326693
+一百多条 13.2075304714
+蜚蠊 11.8212361103
+氯乙酸 13.2075304714
+激越 9.58318953844
+新飞 12.5143832909
+享福 9.96885201925
+二百三十卷 12.8020653633
+砟子 13.2075304714
+菌状 12.5143832909
+万辆 7.1038539337
+瓦工 12.5143832909
+详注 12.5143832909
+到案 11.5027823792
+贺拔岳 11.4157710022
+拉卜楞寺 11.1926274509
+特立 11.4157710022
+语法错误 12.1089181827
+万达 10.9562386728
+旧梦 11.9547675029
+张融 11.8212361103
+欠钱 13.2075304714
+天演论 11.0674643079
+叙述者 13.2075304714
+不可言状 13.900677652
+清唱 10.604840786
+梁再平 13.2075304714
+巨鲸 11.5027823792
+叶姐 10.0505300503
+出示证件 12.1089181827
+必看 12.1089181827
+哽咽 8.12302532875
+火炉 9.59661255877
+瓦尼 11.3357282945
+火炎 12.8020653633
+各执己见 12.8020653633
+火炕 10.1871055853
+谢落 13.2075304714
+帕尔玛 11.8212361103
+大宁县 13.900677652
+瓦尔 10.0294766411
+淘米水 12.1089181827
+银红色 13.2075304714
+三包 11.0103058941
+隆鼻 11.1926274509
+张虎 11.0103058941
+火炮 7.23499393419
+火炭 10.3743171274
+火炬 9.58318953844
+阳光工程 11.5027823792
+巡逻机 10.4041700905
+等高线 10.4994802703
+在行 10.642581114
+沈家河 12.8020653633
+火点 12.1089181827
+自压 13.2075304714
+火炽 11.8212361103
+石基 11.3357282945
+汤药 9.96885201925
+拼劲 13.900677652
+桶盖 11.4157710022
+提琴 10.4666904475
+吉伯林 12.2912397395
+起居注 10.533381822
+鉴别器 12.8020653633
+若有所思 9.48183704418
+腐刑 11.7034530746
+黄亮 11.7034530746
+浅棕 12.8020653633
+火烟 12.2912397395
+衣冠冢 11.8212361103
+特等 10.4041700905
+甘陕 13.2075304714
+整倍体 13.2075304714
+火烧 8.15128466607
+小周天 13.900677652
+火烤 11.1280889297
+火烫 10.8561552143
+百年之后 10.533381822
+削去 10.3453295905
+前途远大 12.5143832909
+拼力 10.7226238216
+火热 8.33233314821
+西街 9.02548032877
+劫运 13.2075304714
+生物分布 11.9547675029
+名牌产品 10.2630914922
+李博士 13.900677652
+质问 9.11318590919
+晋东 11.5027823792
+命该 12.1089181827
+丘力居 12.8020653633
+封禁 10.6818018271
+教职员工 11.3357282945
+吴晓邦 12.5143832909
+幅频特性 12.8020653633
+信息工程 11.9547675029
+技术转让 9.27570483869
+周起元 12.5143832909
+下毒手 10.1871055853
+国诸臣 13.2075304714
+肯进 13.900677652
+卫道之士 13.900677652
+封禅 10.4994802703
+上言 11.5027823792
+闸坝 11.5027823792
+雇有 11.5027823792
+梁方仲 11.9547675029
+起源 7.26867587458
+烦死人 13.2075304714
+肯迪 12.8020653633
+瓦岗 11.9547675029
+医疗事故 10.4349417492
+天柱山 11.1280889297
+秦淮区 13.2075304714
+赵树理 11.598092559
+经验丰富 9.01787572939
+变阻器 12.1089181827
+西行 9.28555713513
+史金波 10.9562386728
+刷卡机 13.2075304714
+杯水 10.604840786
+甘言 12.8020653633
+人生路 13.2075304714
+拼制 12.8020653633
+心理反映 12.5143832909
+拼到 13.900677652
+边疆地带 13.900677652
+北魏 7.65070240972
+英法军 11.598092559
+拼刺 12.8020653633
+换回去 13.900677652
+元宪宗 12.1089181827
+蔡元培 9.56994431169
+第三十七届 12.5143832909
+模仿 7.87965430263
+代殷商 12.8020653633
+玄宗遂 12.5143832909
+体重增加 10.4349417492
+口形 12.5143832909
+应用科学 10.2117981979
+吐泡 13.900677652
+科技进步 9.80633308975
+核心技术 8.81308131674
+拉迪诺 13.900677652
+奥卡姆 13.900677652
+元廷授 13.2075304714
+诗以言志 13.2075304714
+无功受禄 12.2912397395
+十周年 10.3171587135
+抽水泵 13.900677652
+万身 13.900677652
+中国服装协会 12.8020653633
+新亮点 10.4994802703
+育林 11.2616203224
+葛利普 12.5143832909
+特殊政策 11.2616203224
+酒渣鼻 13.2075304714
+白砂糖 11.3357282945
+激浊扬清 13.900677652
+反粒子 11.0674643079
+银轮 10.604840786
+物资公司 13.2075304714
+情报人员 11.5027823792
+单设 11.5027823792
+下场 8.42003872863
+租过 13.900677652
+思想家 8.05423887692
+童太尉 11.7034530746
+红蜘蛛 11.4157710022
+侨胞 10.9049453784
+委聘 13.2075304714
+轻兵器 13.2075304714
+张腊 12.1089181827
+甲氧基 11.7034530746
+易损件 12.5143832909
+林爽文 11.2616203224
+清口 11.1926274509
+海兰泡 11.8212361103
+综采 12.5143832909
+北鲵 13.900677652
+短平快 12.2912397395
+磺脲 12.8020653633
+制贩 13.900677652
+半截刀 13.900677652
+姿态 7.57452817882
+清史 10.2630914922
+非走不可 11.8212361103
+网上学校 13.900677652
+篇章 9.55687223012
+香风 10.4666904475
+鲍勒 13.900677652
+漠不相关 13.2075304714
+吴昌 13.900677652
+香飘 11.1926274509
+清原 12.2912397395
+海洋性气 13.900677652
+曼萨 11.5027823792
+薰陶 11.9547675029
+张脸 9.33632946051
+登门 9.38981814546
+终清 11.4157710022
+泰纳 11.4157710022
+青藏 9.26594866375
+醉虾 11.598092559
+毒血症 11.1926274509
+笼统 9.48183704418
+笼络 9.09665660724
+火石 9.89334446674
+上路 7.98988100794
+季娜 13.900677652
+科尔沁左翼后旗 12.2912397395
+困竭 13.2075304714
+清华 8.7245279194
+数据通信 10.8561552143
+波尔特 12.2912397395
+嗡叫 13.900677652
+中南美洲 11.4157710022
+仰首 11.8212361103
+金盒 13.900677652
+玉立 11.8212361103
+烟摊 12.2912397395
+配套改革 10.0088573539
+清单 8.86372504956
+做案 13.900677652
+韦伯氏 12.5143832909
+玉竹 10.8096351986
+微茫 12.8020653633
+贾尔岭 13.900677652
+金桂房 13.2075304714
+裂土分茅 13.2075304714
+矩阵的秩 13.900677652
+粘胶纤维 10.5684731418
+歌手 9.14708746087
+侨联 13.900677652
+解不开 10.1394775363
+非政府 9.89334446674
+锯起来 13.900677652
+穷寇勿追 13.2075304714
+十三万户 12.2912397395
+租车 11.1280889297
+上账 12.2912397395
+上货 12.2912397395
+田纪云 13.2075304714
+送电 10.765183436
+单斜晶硫 13.900677652
+楚江情 13.900677652
+烧制 9.28555713513
+提现 11.7034530746
+揪出 10.5684731418
+盘山路 13.2075304714
+粟三石 13.2075304714
+盛田昭 12.2912397395
+卡利斯托 13.2075304714
+婀娜多姿 10.9562386728
+同离子 12.5143832909
+银边 12.8020653633
+喝住 10.3453295905
+清化 10.9562386728
+提环 13.2075304714
+银达 13.2075304714
+西路南 13.2075304714
+机组人员 10.2117981979
+肠绞痛 13.900677652
+入秋 10.8561552143
+银辉 11.598092559
+上起 9.33632946051
+树碑 13.2075304714
+复兴基地 13.900677652
+电子机械 11.7034530746
+荆湖诸 12.8020653633
+卡库斯 13.2075304714
+摔开 12.2912397395
+塔兰托 11.7034530746
+明开国 12.8020653633
+剑河 13.900677652
+陈大人 10.765183436
+守职 13.900677652
+神女峰 11.9547675029
+武钢股份 9.63799777493
+广州白云机场 11.7034530746
+三大寺 11.4157710022
+小玲子 9.12155415886
+剁碎 11.5027823792
+香香 12.1089181827
+心道 10.6818018271
+巨骨 12.8020653633
+挺下去 13.900677652
+吕特 12.5143832909
+万行 11.0674643079
+日本自卫队 12.1089181827
+奥尔斯 13.2075304714
+杜威 10.4349417492
+遥祭 11.5027823792
+诸葛瞻 11.7034530746
+任重而道远 10.765183436
+具体地址 12.5143832909
+缭乱 11.8212361103
+奥尔文 13.2075304714
+靖侯史 12.8020653633
+列明 11.1280889297
+张承志 13.2075304714
+专着 11.8212361103
+黄斑部 12.8020653633
+路断人稀 12.2912397395
+末节 10.9049453784
+玉笛 12.1089181827
+拔苗助长 12.5143832909
+火盆 9.35738286971
+烟斗 9.49395840471
+克劳塞维茨 10.7226238216
+性满足 13.2075304714
+葡京 12.8020653633
+愿闻其详 11.0674643079
+敬鬼神而远之 12.1089181827
+张耳 11.4157710022
+冈特 13.900677652
+电话网 11.598092559
+胃液 9.94943393339
+佘一元 10.3171587135
+果如所料 13.2075304714
+叫唤声 12.1089181827
+左钦察 13.2075304714
+张耀 13.900677652
+供求信息 13.900677652
+浅滩 9.20932976975
+岳阳 9.15574552361
+栉沐 13.2075304714
+个私 13.900677652
+执行官 8.52539924429
+班贝格 13.2075304714
+宋元时 10.9562386728
+诉述 12.8020653633
+小牧童 13.900677652
+艺林 13.900677652
+金矛 13.2075304714
+发明专利 10.0088573539
+铁路权 13.2075304714
+泰罗 12.5143832909
+上谕 9.59661255877
+留神 9.35738286971
+柔翰 13.2075304714
+七度 12.8020653633
+列星 12.8020653633
+禄高登 13.2075304714
+老牛破车 13.2075304714
+重力势能 12.5143832909
+农村用电 13.2075304714
+非她莫属 12.1089181827
+喝下 10.1630080337
+文艺理论 10.1630080337
+烧卖 12.8020653633
+伍斯特 12.1089181827
+离不开 7.85567233794
+网络函数 12.8020653633
+拥兵自重 10.8096351986
+贾蓉 9.4233408375
+帛画 11.2616203224
+沈阳军区空军 13.2075304714
+上谷 10.0720362555
+聱牙 13.2075304714
+清剿 10.9049453784
+十七孔桥 12.5143832909
+人非圣贤 11.4157710022
+张胜 11.9547675029
+艺术 5.87483430782
+薛蟠忙 12.5143832909
+清切 13.2075304714
+郑天挺 11.0103058941
+朗克 13.2075304714
+大静脉 12.8020653633
+清初 8.14493543839
+战术性 10.8096351986
+合情理 12.2912397395
+清创 11.0103058941
+罂粟 9.34680076038
+演出服 13.2075304714
+笼罩 8.0600359946
+经办人 10.8096351986
+沈家门 11.0103058941
+流体力学 9.01032852375
+崔应星 12.8020653633
+微波激射 11.9547675029
+榜贴 13.900677652
+脾肿大 10.5684731418
+布卢斯 13.2075304714
+一万八千 12.1089181827
+柔美 10.2630914922
+定存 10.0294766411
+玉箫 12.1089181827
+答复 7.96578345636
+拜老师 13.900677652
+香饼 13.2075304714
+泰罗斯 12.1089181827
+讽谏 11.598092559
+香饵 11.1926274509
+熊本县 11.7034530746
+拼合 10.7226238216
+张荣 11.598092559
+鱼水之欢 12.8020653633
+清凉 8.76487921493
+梵高 13.2075304714
+三十余万 10.642581114
+专业课程 12.1089181827
+清净 9.32596667347
+奥里诺科河 11.4157710022
+木儿领 13.2075304714
+北麓 8.42003872863
+债主 9.6811699468
+缺陷 7.52906580474
+封兰陵 13.2075304714
+滋生腐败 12.2912397395
+二十四款 13.2075304714
+上达 10.4994802703
+怀孕期 10.8561552143
+育新 13.900677652
+上边 7.33119623156
+一千八百 11.0103058941
+心腹之疾 13.900677652
+大犬座 11.2616203224
+百折千回 13.900677652
+互异 12.5143832909
+清出 11.4157710022
+齑粉 10.4666904475
+犹太人 8.31342899358
+概念股 7.07630398193
+六指儿 12.2912397395
+科瓦鲁 13.2075304714
+中央对外联络部 13.900677652
+范艾伦 12.5143832909
+清册 11.7034530746
+脚脖子 11.0103058941
+赵家楼 11.7034530746
+燕师渡 13.2075304714
+银质 10.5684731418
+疯狂性 13.900677652
+布卢明 13.2075304714
+磨盘 9.87532596124
+支票帐户 13.2075304714
+岩白菜 13.900677652
+顽冥不化 13.900677652
+留城 13.900677652
+左派 9.0884932966
+清军 7.84389363875
+银贷 12.8020653633
+张茹 13.2075304714
+疆界 9.40086798165
+烈火烹油 13.2075304714
+张茂 12.5143832909
+张茅 13.900677652
+多聚糖 12.5143832909
+微臣 8.95903522937
+浅淡 10.642581114
+清冽 11.1280889297
+催化反应 11.0674643079
+罗湖口岸 11.9547675029
+铺板 12.2912397395
+万韩元 13.2075304714
+两厢情愿 12.1089181827
+太阳活动 10.1871055853
+清冷 9.41204128224
+悄然兴起 11.5027823792
+蒙混 11.3357282945
+自利 11.8212361103
+前倨后恭 13.900677652
+杭世骏 13.2075304714
+清光 11.4157710022
+横冲直闯 13.2075304714
+普通本科 13.900677652
+灯标 12.2912397395
+普天忠 13.2075304714
+特级 9.72629038208
+特约 8.9102450652
+张菲 12.1089181827
+尼亚萨兰 12.1089181827
+嵌合体 12.1089181827
+清党 10.1871055853
+辛苦工作 12.5143832909
+特纳 8.70772080109
+万亿里拉 13.2075304714
+租赁 7.91171623509
+出以公心 12.5143832909
+兔儿 11.2616203224
+拘谨 9.29550746599
+凯氏带 13.2075304714
+倾斜 7.19626329701
+养猪场 12.1089181827
+张汉儒 12.8020653633
+师范院校 13.900677652
+七十余家 12.5143832909
+玉磬 11.7034530746
+火电 8.81308131674
+固定化 10.5684731418
+清兵 7.59989185731
+性描写 13.900677652
+广陵郡 12.2912397395
+组合原理 13.2075304714
+下学时 13.2075304714
+乐凯胶片 12.5143832909
+浅浅 10.1394775363
+甲壳素 11.8212361103
+非殖民化 12.8020653633
+萨哈洛夫 13.900677652
+整理剂 12.1089181827
+闽剧 12.2912397395
+佩纳明 12.2912397395
+异国 10.1394775363
+格哈斯 13.900677652
+何敢复 13.2075304714
+张莹 13.2075304714
+拼在 13.2075304714
+上载 11.5027823792
+嗣后 9.55687223012
+灯桩 12.8020653633
+簇新 10.4349417492
+边城 10.642581114
+尿路感染 10.765183436
+生死战 13.900677652
+可充电 13.900677652
+姜维全 13.2075304714
+摩伊 12.1089181827
+上轨 10.1394775363
+万计 11.3357282945
+廖添丁 13.2075304714
+位皇军 13.2075304714
+浅海 8.46695564842
+血管硬化 11.7034530746
+迟滞 9.77354326693
+叔祖母 13.900677652
+严府 12.2912397395
+邸第 13.900677652
+答对 11.5027823792
+拼图 10.8561552143
+顶天立地 10.2630914922
+张良 9.59661255877
+张艳 10.8561552143
+浅沟 11.5027823792
+人淡如菊 12.8020653633
+终济 13.2075304714
+纽卡斯尔 10.9562386728
+互帮 13.900677652
+提灯 10.765183436
+北龙 12.2912397395
+菜羹 13.2075304714
+韩志远 10.4994802703
+巨额 7.23882291143
+饱蘸 12.1089181827
+小半夜 13.2075304714
+季奇 12.5143832909
+烟柱 10.9562386728
+托坎廷 13.2075304714
+浅沼 13.2075304714
+张翼解 13.2075304714
+静水压 13.2075304714
+互市 9.77354326693
+上身 8.70772080109
+巴特尔 11.9547675029
+邓贤 11.4157710022
+因果律 12.5143832909
+提灌 12.2912397395
+跨下来 13.900677652
+荆湖行 13.2075304714
+一角钱 8.28754954559
+闽台 10.642581114
+切丝 12.2912397395
+汉姆生 13.2075304714
+种过 11.598092559
+专电 9.20019728618
+古广陵 13.2075304714
+俊美 9.96885201925
+专用 7.32003851469
+吞噬作用 11.8212361103
+万言 11.4157710022
+上皮细胞 9.65218240993
+平夏城 13.2075304714
+切下 11.8212361103
+切上 13.2075304714
+微胖 11.4157710022
+谢天华 13.900677652
+瓦塔 12.2912397395
+庭训 13.2075304714
+诸法实 12.5143832909
+艺文 10.4349417492
+申酉 11.7034530746
+鹤山区 13.2075304714
+芝诺 11.2616203224
+烟枪 10.9049453784
+切中 11.7034530746
+暌违 11.598092559
+横生枝节 11.9547675029
+叶圣陶 10.604840786
+特罗 11.1280889297
+若魏延 13.2075304714
+火球 9.45802639549
+姻亲 9.84023464143
+驯服 10.4041700905
+色达县 13.900677652
+老街 10.5684731418
+蒙氏 11.5027823792
+张若 8.71329184614
+真羽士 13.2075304714
+承恩门 13.2075304714
+城乡差别 12.8020653633
+浙商 9.11318590919
+购买价 13.900677652
+劳斯莱斯 11.8212361103
+张英 10.533381822
+舒适型 10.0294766411
+硫黄岛 11.0674643079
+烟杆 12.5143832909
+泽侯金 13.2075304714
+韬晦待时 13.900677652
+奥勃洛 12.8020653633
+闽北 10.6818018271
+过宁府 12.5143832909
+查伊拉 13.900677652
+服装界 13.2075304714
+正本 10.9049453784
+张苍 12.8020653633
+陈维稷 13.2075304714
+晃晃 10.604840786
+清偿 9.32596667347
+便益 12.1089181827
+发泡剂 11.598092559
+恍恍荡荡 13.2075304714
+浅水 8.93783302172
+张苞 10.1164880181
+鉴别力 12.1089181827
+烧光 10.0505300503
+蒙汉 11.2616203224
+黄淮 9.89334446674
+猫眼石 11.5027823792
+军民联防 13.2075304714
+提点 10.1164880181
+音乐手机 13.900677652
+吃得了 12.1089181827
+断事 11.1280889297
+蒙江 12.5143832909
+北齐 8.37522471284
+目的地 8.55357012126
+姜叙 12.2912397395
+图片链接 13.2075304714
+战略规划 9.58318953844
+鸿篇巨制 12.8020653633
+闽南 10.0088573539
+摩丝 12.8020653633
+烟机 13.2075304714
+元古代 9.96885201925
+工兵营 10.4666904475
+吴晓铃 13.2075304714
+倍道而进 13.2075304714
+登陆 6.81896906587
+墓木已拱 13.900677652
+四千里 12.2912397395
+试点工作 9.58318953844
+苍浑 11.9547675029
+全北界 11.9547675029
+蜡黄色 12.2912397395
+苯乙胺 13.900677652
+上膛 11.9547675029
+清心 10.4041700905
+金融贸易 12.1089181827
+第一二 13.2075304714
+张起 11.7034530746
+双轨铁路 13.900677652
+高音质 13.900677652
+乡下人 9.61021821083
+饱以老拳 12.2912397395
+火管 13.900677652
+好少 13.900677652
+剩菜 11.2616203224
+北邮 13.900677652
+分配率 12.5143832909
+瓦赫坦 11.9547675029
+威斯特摩兰 12.8020653633
+奖励 7.57631868959
+火箱 13.2075304714
+入神 10.9562386728
+上颌前突 13.900677652
+耸动 10.7226238216
+扛鼎拔山 13.900677652
+冗员 10.533381822
+北邻 9.34680076038
+招文袋 11.1280889297
+详明 11.0103058941
+准噶尔盆地 9.11318590919
+布下 10.5684731418
+周砥微微 13.900677652
+水果汁 12.2912397395
+卢谌 13.900677652
+专稿 10.642581114
+金融业务 9.62401153296
+清律 11.9547675029
+伯高杰 13.2075304714
+终成 10.4666904475
+灾害 8.13548654919
+北郊 9.17328983326
+鞑靼人 10.0294766411
+张贴 9.19114745066
+张贵 9.84023464143
+张贺 13.2075304714
+由诺卡 13.2075304714
+清得 12.5143832909
+特灵 13.2075304714
+子午 9.93038573842
+鸡腿 10.7226238216
+典型调查 12.2912397395
+铡刀 10.5684731418
+五内如焚 13.2075304714
+瓦块 11.1280889297
+北郭 12.5143832909
+上至 9.72629038208
+精心安排 11.5027823792
+第四架 12.8020653633
+上自 10.3171587135
+以逸待劳 9.75754292558
+布丰 11.4157710022
+宫春晓 13.900677652
+景德镇 9.25628675283
+瓦坎 11.9547675029
+子存善 13.2075304714
+执行器 12.1089181827
+玉盘 10.1871055853
+认真完成 13.2075304714
+上脘 13.2075304714
+烧干 12.2912397395
+奖分 12.2912397395
+释迎牟 12.8020653633
+布什 9.41204128224
+张路 11.4157710022
+应昌府 12.8020653633
+特点 5.4067530875
+安肯 10.3171587135
+主使人 13.2075304714
+日本队 12.2912397395
+淡月 12.8020653633
+平衡术 13.900677652
+和润生 11.2616203224
+双重国籍 11.7034530746
+二百三十多 13.2075304714
+上脸 11.598092559
+到户 11.2616203224
+糙米饭 11.9547675029
+便秘 8.52539924429
+语无伦次 10.1164880181
+泰特 12.2912397395
+中国富豪 12.8020653633
+雪光 11.4157710022
+瓦垄 12.8020653633
+代赫纳 12.8020653633
+奖券 13.2075304714
+营养枝 13.2075304714
+莫逆之交 10.6818018271
+巨震 13.900677652
+火笼 13.900677652
+掠地飞行 13.2075304714
+阙词 13.900677652
+政治指导 13.2075304714
+红红绿绿 11.598092559
+诸贝勒 12.5143832909
+隋作护 13.2075304714
+邓艾兵 12.8020653633
+北道 9.80633308975
+战七捷 12.5143832909
+战斗任务 9.94943393339
+烟标 13.900677652
+到手 8.4284069783
+布云 12.1089181827
+正前 13.900677652
+玉皇 9.84023464143
+杯杯 13.2075304714
+参数信息 13.900677652
+上腹 10.765183436
+好出 13.900677652
+致癌物质 10.1871055853
+张越 12.5143832909
+没剩 12.1089181827
+大开方便之门 11.9547675029
+墙面 9.74179456862
+肇俊哲 13.900677652
+抗爆性 11.7034530746
+拙朴 12.8020653633
+膏沃 13.900677652
+好了没 12.5143832909
+管道 7.42524493527
+螫人 11.9547675029
+授权代表 13.900677652
+综合利用 8.65893063692
+农发行 10.4666904475
+每千克 10.8561552143
+广角镜头 13.900677652
+清廉 10.0720362555
+巴特利 13.2075304714
+谢卿材 13.2075304714
+面糊糊 12.8020653633
+萨迪格 12.5143832909
+涉世不深 12.8020653633
+祝融氏 12.2912397395
+亮子 11.9547675029
+喉气管 13.2075304714
+圣域 13.900677652
+银色 9.33632946051
+倒栽葱 11.9547675029
+上肉 13.900677652
+拨弦 11.9547675029
+飘飘欲仙 11.3357282945
+火窟 13.2075304714
+严陵钓 13.2075304714
+姜根迪 12.2912397395
+贪污贿赂 11.8212361103
+利多卡因 11.9547675029
+夏威夷岛 12.8020653633
+自掏腰包 12.2912397395
+具体表现 9.6811699468
+互借 13.2075304714
+劫监 13.900677652
+第八十九回 12.1089181827
+烧心 11.3357282945
+金校卫 13.2075304714
+二亿两 12.5143832909
+灯架 12.1089181827
+清廷 8.1608847398
+巴特列 12.2912397395
+日照时数 9.56994431169
+黄封御 12.5143832909
+疏而不漏 12.1089181827
+弱柳扶风 12.8020653633
+呈拱形 12.2912397395
+玉真 12.2912397395
+螯合 12.5143832909
+第三十七回 12.1089181827
+裁判长 12.5143832909
+北里 11.7034530746
+谈何容易 9.37888907493
+甲级队 13.2075304714
+布伞 12.8020653633
+瓦器 11.9547675029
+车儿 10.9562386728
+子旭烈 12.5143832909
+清库 13.2075304714
+投洽会 12.5143832909
+烧得 8.81308131674
+最高级别 11.0674643079
+可喜可贺 10.8561552143
+一问三不知 11.598092559
+热释光 11.7034530746
+星思凡 13.2075304714
+刀山火海 11.5027823792
+香闺 11.9547675029
+酒石酸钾钠 12.1089181827
+活动中心 9.34680076038
+玉狻猊 10.6818018271
+儿茶酚 12.5143832909
+自动机 10.2897597393
+嗣宗 12.8020653633
+灯柱 11.5027823792
+开远市 11.8212361103
+蒙戈 13.2075304714
+老死不相 13.900677652
+触法 13.2075304714
+坦诚相见 13.2075304714
+有求于 11.3357282945
+知其一 12.8020653633
+巨阳 10.5684731418
+出于无奈 11.0674643079
+姐儿们 11.7034530746
+扩张政策 10.4041700905
+森巴旺 13.900677652
+孙菊仙 11.598092559
+离休干部 12.5143832909
+端阳节 10.1871055853
+脱气 11.9547675029
+三大块 11.2616203224
+烧录 12.1089181827
+巨阙 11.9547675029
+鸡肉 9.45802639549
+玉石 8.45825994145
+提给 12.8020653633
+清幽 9.77354326693
+欢喜佛 13.2075304714
+贝克斯 13.2075304714
+嗣子 11.3357282945
+鸡肝 12.5143832909
+清平 10.2897597393
+提纲 9.91169360541
+转岗 12.8020653633
+马海龙 13.2075304714
+登顶 10.642581114
+侦查学 13.900677652
+上联 10.3453295905
+征状 13.900677652
+登顿 13.2075304714
+戎马倥偬 11.0103058941
+唯心史观 11.1926274509
+银花 9.82314020807
+详查 11.5027823792
+布依 9.03314320152
+扶不起 12.5143832909
+鸡胸 11.7034530746
+专管 9.16447920358
+摇船 11.1926274509
+清帐 12.5143832909
+五六百元 12.2912397395
+无菌室 11.7034530746
+国外 6.31488883024
+租船 11.1926274509
+兰花指 12.5143832909
+不锈钢管 12.8020653633
+自动枪 11.8212361103
+由硝基 13.2075304714
+沃尔夫斯堡 12.1089181827
+碎金 11.4157710022
+五虎上将 12.8020653633
+概念车 10.3453295905
+古里安 12.8020653633
+巴特勒 12.1089181827
+集约式 12.8020653633
+便签 13.2075304714
+火禁 13.2075304714
+杨氏模量 12.8020653633
+张轨 11.0103058941
+标本室 11.5027823792
+顾恤 13.2075304714
+清川 13.2075304714
+年度人物 11.0674643079
+清州 11.598092559
+特爽 13.900677652
+清规戒律 11.1280889297
+炭气 13.2075304714
+格马林 13.900677652
+张载 10.1630080337
+一个四十出头 13.900677652
+电化教学 12.2912397395
+蝉纱 13.900677652
+水西流 12.5143832909
+国际音标 11.9547675029
+宽假 13.2075304714
+劳动营 12.8020653633
+双角 10.4349417492
+小小子 13.2075304714
+库阿语 13.2075304714
+红佛 13.900677652
+上菜 10.2371160058
+倥偬 10.9562386728
+罗马诺 12.2912397395
+密苏里州 10.6818018271
+不虞匮乏 13.900677652
+便笺 13.900677652
+中国保监会 9.74179456862
+语料库 13.900677652
+火种 9.53122979951
+读熟 13.2075304714
+金银铜 11.4157710022
+尖酸 11.9547675029
+萨雅索 13.2075304714
+侵越 11.1280889297
+摇车 12.1089181827
+艾释黎 12.8020653633
+毛状 11.8212361103
+温济泽 13.900677652
+匆促 11.2616203224
+香雪 11.4157710022
+马来半岛 9.35738286971
+表现形式 8.43684584695
+于青萍 13.2075304714
+巴特克 12.8020653633
+奏效 9.20019728618
+玉琴 11.4157710022
+虚根 13.900677652
+卫尉秩 13.2075304714
+十四五斤 12.8020653633
+玉琮 11.4157710022
+玉琢 12.1089181827
+卖俏行奸 13.900677652
+柯柏 12.5143832909
+孙从添 13.900677652
+经营期 12.2912397395
+归根到底 9.74179456862
+香阁 10.2897597393
+武兵 13.900677652
+植食性 9.85762638414
+缪天瑞 13.2075304714
+隆隆 8.80692745117
+马克沁 11.0103058941
+拼字 12.8020653633
+铁路桥 10.4041700905
+新举措 10.1630080337
+张过 12.8020653633
+鲁为氏 13.2075304714
+过洁世 13.2075304714
+折扣票 13.900677652
+抢先报 13.2075304714
+灵药 11.3357282945
+玉瓶 11.5027823792
+执行员 12.5143832909
+不战而退 11.3357282945
+哥伦比亚 8.63798746307
+承德地区 12.1089181827
+寻常路 12.1089181827
+核讹诈 12.5143832909
+第一任 8.81927328699
+索约特 13.900677652
+百年一遇 10.0294766411
+混为一体 11.9547675029
+叶琢堂 13.2075304714
+必经 9.84023464143
+拿刀弄杖 12.1089181827
+玉璜 12.2912397395
+广行 12.1089181827
+指鸡骂狗 13.2075304714
+烧尽 10.9562386728
+喇嘛 7.93453091285
+香附 11.598092559
+统一大业 10.5684731418
+玉璋 13.2075304714
+张清便 11.598092559
+韦伯所 13.900677652
+委身 11.4157710022
+贸易型 12.5143832909
+经营权 9.54396882529
+分类索引 12.8020653633
+金盾 12.5143832909
+张达 12.5143832909
+火神 9.75754292558
+张辽 9.5186510173
+嘴松 12.5143832909
+俊爽 11.8212361103
+互发 13.900677652
+张辅 13.900677652
+饱读 11.1280889297
+贝克曼 12.8020653633
+上药 9.28555713513
+乱吼乱叫 13.2075304714
+贺重宝 13.2075304714
+外汇管制 10.2117981979
+顺路去 11.7034530746
+五年级 10.3743171274
+玉璧 10.1164880181
+揪心 9.75754292558
+比塞大 12.2912397395
+肾积水 11.1926274509
+罗猴山 10.9562386728
+非战 11.7034530746
+烟毒 13.2075304714
+巨钵 12.8020653633
+革命战争 9.04086524761
+士农工商 11.7034530746
+边地 10.3743171274
+外在性 13.900677652
+互利 9.27570483869
+上节 13.2075304714
+斑斑点点 11.598092559
+狠揍 12.2912397395
+巨钟 11.598092559
+盛之象 13.2075304714
+梵音 11.7034530746
+柯特兰 13.2075304714
+朗德 11.8212361103
+门庭如市 13.2075304714
+汝侯刘 11.598092559
+银联 10.4994802703
+石拱桥 11.598092559
+在职 8.96620371885
+百分之二左右 13.2075304714
+鼓鼓的 10.7226238216
+郭掌柜 12.8020653633
+姚苌建 13.2075304714
+穷巷 13.900677652
+半信不信 12.5143832909
+柔然 9.7898037878
+红中 12.5143832909
+班点 13.2075304714
+国破君 13.2075304714
+竹藤 11.8212361103
+上苍 10.1871055853
+银耳 9.62401153296
+高发期 10.2630914922
+航空法 13.900677652
+红丸 10.4349417492
+红丹 12.5143832909
+联唱 12.8020653633
+斯洛伐克语 12.1089181827
+弟子规 12.5143832909
+小相公 12.1089181827
+小性儿 11.7034530746
+红一 10.765183436
+蝉翼 10.4994802703
+下里巴人 11.9547675029
+玉田 10.8096351986
+登高 9.63799777493
+宋孝武帝 11.9547675029
+顺路到 12.8020653633
+考试费 12.2912397395
+搏战 10.5684731418
+红丝 10.0294766411
+小数目 10.9049453784
+责怪 9.05649056552
+清屏 11.8212361103
+巩固 6.72671933222
+岳飞 8.9102450652
+费信岛 12.2912397395
+黄氏 10.533381822
+闭嘴 9.71102290995
+仙剑奇 13.900677652
+微调 7.75864024639
+绿色奥运 13.900677652
+篮球运动 11.8212361103
+郭勒河 11.4157710022
+辽沈战役纪念馆 12.8020653633
+毫无希望 10.9562386728
+廉政文化 13.2075304714
+局限性 8.59240995457
+火砖 13.900677652
+吐沫 10.9049453784
+互动 8.20694551317
+忽快忽慢 13.2075304714
+电磁感应 9.75754292558
+王坚卒 12.8020653633
+上船 8.74738605748
+严阵来 11.8212361103
+大白天下 13.2075304714
+专科 9.65218240993
+剑戟 11.0674643079
+心酸 9.18217878068
+上航 9.19114745066
+详文 12.8020653633
+于中缘 13.900677652
+一十六年 13.900677652
+贝希斯 11.9547675029
+龙胆科 12.2912397395
+气喘嘘嘘 11.1926274509
+难以克服 11.3357282945
+社会观 12.1089181827
+秽迹 12.8020653633
+红亮 12.1089181827
+清将 11.2616203224
+泛舟 10.3743171274
+过兵科 12.5143832909
+传话人 12.8020653633
+归虚青 12.2912397395
+科摩罗 10.765183436
+顺水推船 13.900677652
+筹资额 13.900677652
+颓败 10.8561552143
+涝地 11.8212361103
+蒙恩 10.765183436
+四冲程 11.0103058941
+官保官 13.2075304714
+蒙恬 10.604840786
+红于 13.2075304714
+摔倒 8.91707103027
+上色 11.0103058941
+把握住 9.40086798165
+二手楼 11.598092559
+葛守礼 10.604840786
+红云 10.1630080337
+非成 13.900677652
+脆生生 11.9547675029
+德克碑 13.2075304714
+极坐标 11.4157710022
+比较发达 9.16447920358
+栽培技术 10.642581114
+宫乃 13.900677652
+挠力河 11.598092559
+互唱 13.900677652
+活靶子 11.1926274509
+七届 9.59661255877
+好事儿 10.642581114
+呆头 13.2075304714
+隆通 13.900677652
+玉牒 11.8212361103
+清寂 12.2912397395
+瓦匠 11.598092559
+极端化 11.8212361103
+工兵连 11.0674643079
+银蝶 12.8020653633
+右佥都御史 10.604840786
+菌类 9.98865464655
+玉片 11.3357282945
+清寒 11.2616203224
+乔装改扮 12.5143832909
+激荡 9.12155415886
+进退存亡 13.2075304714
+打起精神 10.0088573539
+禄千钟 12.5143832909
+魏攻韩 13.2075304714
+目标软件 13.900677652
+竹节 10.3171587135
+华汉 13.2075304714
+四四方方 11.2616203224
+中国大饭店 12.5143832909
+六十余 11.598092559
+迟早 8.34384959028
+新西兰人 11.3357282945
+马鞍山市 10.604840786
+称心如意 10.604840786
+红山区 13.900677652
+烟波 10.4041700905
+烟泡 11.0103058941
+哈利斯 13.2075304714
+要账 12.1089181827
+陆委会 13.900677652
+驻华使馆 10.7226238216
+文明单位 13.900677652
+香郁 12.5143832909
+第九城市 12.1089181827
+大雨滂沱 11.1926274509
+清宁 11.1280889297
+抬轿子 10.9562386728
+瓦卡 13.2075304714
+乌力马 13.2075304714
+王迁丰 13.2075304714
+清官 9.72629038208
+隆遇 12.8020653633
+篡改 9.96885201925
+边界点 13.900677652
+感性认识 10.604840786
+思想史 9.55687223012
+包兰铁路 10.4041700905
+笼盖 11.9547675029
+解析映射 13.900677652
+天柱县 13.900677652
+艳无双 13.900677652
+提笔 9.53122979951
+两眼一摸黑 12.5143832909
+卜奎 12.5143832909
+防沉迷 13.900677652
+香火钱 11.8212361103
+宫中 7.12189275429
+清客 10.0088573539
+花样翻新 10.9562386728
+通用电气公司 10.5684731418
+高附加值 10.1394775363
+终是 9.26594866375
+底下 7.16489763773
+特瑞 13.900677652
+宫主 11.598092559
+肖洛霍夫 11.7034530746
+东天山 11.8212361103
+瓯越 12.8020653633
+无可争辩 11.1926274509
+迁徙耕作 13.2075304714
+底价 9.23723855786
+明代宗 12.8020653633
+劳动节 11.0103058941
+第二盘 12.5143832909
+嫌疑者 13.2075304714
+援助者 12.8020653633
+田骨田 13.2075304714
+提篮 11.0674643079
+婆母 10.3743171274
+张作霖 9.43476953332
+饱足 11.9547675029
+澡堂 10.8096351986
+全免费 12.1089181827
+博尔霍夫 13.2075304714
+赵顼 10.6818018271
+张觉 11.9547675029
+习斋记 13.2075304714
+五六百名 13.900677652
+狼毫 11.4157710022
+张角 10.2117981979
+摔坏 10.8096351986
+专利技术 10.604840786
+文斋文 13.2075304714
+刘智远 13.900677652
+蠹政害民 12.8020653633
+订餐 11.9547675029
+自由散漫 12.1089181827
+上蔡 10.9562386728
+一敷 13.900677652
+数据服务 13.2075304714
+第九部 13.900677652
+银莲花 13.900677652
+提箱 13.900677652
+专线 9.84023464143
+华实业 12.2912397395
+南郡城 12.5143832909
+烟气 9.82314020807
+冻土退化 13.2075304714
+依山傍水 10.1871055853
+烟民 10.765183436
+火网 11.598092559
+火罐 11.5027823792
+偶然 7.33259974056
+命中注定 9.71102290995
+合乎规律 12.1089181827
+务使 10.9049453784
+精心 7.87481167815
+红山口 12.5143832909
+汗褂 13.2075304714
+责权 12.2912397395
+三分鼎足 13.900677652
+烟水 11.2616203224
+放线菌素 12.8020653633
+侯喜瑞 11.9547675029
+膝部 10.8561552143
+帕尔米 13.2075304714
+新市镇 10.5684731418
+够不着 10.642581114
+稳妥 8.42421410004
+中距离 11.3357282945
+石里克 11.9547675029
+搏斗 8.79473217808
+宫人 10.0294766411
+灾异 10.4041700905
+实德系 13.2075304714
+万余座 12.1089181827
+香醋 11.4157710022
+张衡 9.54396882529
+答出 12.5143832909
+专署 10.642581114
+万壑争流 12.2912397395
+艳歌 13.2075304714
+快速机动 10.8096351986
+香醇 11.3357282945
+宫体 11.9547675029
+吴公子 13.900677652
+金生 12.5143832909
+微分形式 11.598092559
+不锈钢网 13.900677652
+瓦利 11.8212361103
+事迹 8.19689517732
+拐进来 12.1089181827
+一文 8.39941944143
+大量重 13.2075304714
+火红 9.80633308975
+勉强 6.99192287266
+季华 12.5143832909
+冯叔献 13.2075304714
+先圣先师 13.900677652
+专网 10.4666904475
+保护主义 7.57990935773
+小数点 10.604840786
+人工合成 9.19114745066
+瓦刀 13.2075304714
+草原景观 10.7226238216
+青蝇 13.2075304714
+夏巴尼 12.8020653633
+孙桓引 13.2075304714
+牵五挂四 13.900677652
+评估所 13.2075304714
+不均一性 13.900677652
+刈草 13.2075304714
+火纸 11.0674643079
+火线 9.54396882529
+税契 13.900677652
+产米 13.900677652
+复写纸 12.2912397395
+菌索 13.2075304714
+菌素 13.2075304714
+终朝 13.2075304714
+疏散 9.01787572939
+十里香 13.2075304714
+核心家庭 12.2912397395
+利为民 13.2075304714
+终有 9.94943393339
+几百颗 12.5143832909
+积德累功 13.900677652
+核桃油 13.2075304714
+紫陌 12.2912397395
+人在旅途 13.2075304714
+自动挡 10.2117981979
+好运气 10.4994802703
+全未 11.8212361103
+帕特雷 13.2075304714
+后语 12.8020653633
+扶起林 13.900677652
+先天不足 10.3171587135
+北门 8.65893063692
+火绳 10.9562386728
+终末 11.2616203224
+削减 7.91422564669
+试玩 13.2075304714
+陆峻岭 12.8020653633
+参事室 12.1089181827
+微言 12.5143832909
+四分五落 11.7034530746
+拉了一把 11.8212361103
+灾年 11.598092559
+金合 13.900677652
+马文禄 13.900677652
+陆羽 9.58318953844
+瓦加 13.900677652
+硬帮帮 12.8020653633
+程序转换 13.900677652
+蛛网状 13.900677652
+议会下院 11.8212361103
+发生巨变 12.5143832909
+扶起来 10.0088573539
+哑然失笑 11.8212361103
+设备部 12.5143832909
+浅易 12.8020653633
+顶层楼 13.900677652
+季友 12.5143832909
+德林 11.5027823792
+小布衫 12.5143832909
+私家花园 12.8020653633
+氧水 13.900677652
+银蛇 13.2075304714
+烟海 13.900677652
+万能 9.06439574502
+自由恋爱 11.3357282945
+蒙昧 10.1164880181
+一百多栋 13.2075304714
+桑木张 12.8020653633
+浅显 10.4349417492
+服装网 13.900677652
+应氏杯 13.2075304714
+北京大学党委 13.2075304714
+张裕 9.25628675283
+玉珠 11.7034530746
+支子 13.900677652
+经营性 8.99540287354
+黄体化 13.900677652
+答允 10.8096351986
+水蜜桃 10.1394775363
+彼此之间 9.56994431169
+竹荪 11.1926274509
+靠枕 11.9547675029
+堪为 11.9547675029
+滇茶 13.900677652
+岳麓 12.2912397395
+硬盘容量 13.900677652
+吴二国 12.2912397395
+安西县 13.900677652
+轮到 8.60236028543
+玉王 10.4666904475
+羽毛球队 11.7034530746
+苗正 13.900677652
+终极 9.44633035572
+户曹参军 12.5143832909
+管长 10.8096351986
+几十万名 13.900677652
+韦寿铨 11.8212361103
+大酒店 9.56994431169
+瓦勒 12.2912397395
+玉玺 10.1394775363
+英法德 12.8020653633
+松松散散 13.900677652
+俊男 13.2075304714
+香酥 12.1089181827
+季历 11.7034530746
+周纯全 13.900677652
+徐昭珩 12.8020653633
+灯捻 12.8020653633
+专美 13.2075304714
+玉环 10.3171587135
+到来 6.45526009527
+胃动素 13.900677652
+有效率 9.71102290995
+一手遮天 11.4157710022
+北隅 12.8020653633
+深刻性 11.4157710022
+序列表 13.2075304714
+杂牌军 11.2616203224
+黄波 12.5143832909
+五十多间 12.8020653633
+调聚反应 13.900677652
+责斥 12.2912397395
+阿里什 13.900677652
+亲戚家 9.91169360541
+铁路法 13.900677652
+王无道 13.900677652
+劳动者 7.55328844232
+发布厅 11.8212361103
+薪火 12.2912397395
+离海 11.4157710022
+招女婿 13.2075304714
+耶律宗 13.900677652
+教师资格 12.8020653633
+埃尔金 13.2075304714
+篡权 11.0674643079
+马温加 13.900677652
+蒙斯 12.2912397395
+部长级 9.5186510173
+吕布寨 13.2075304714
+登龙 11.7034530746
+五部委 12.5143832909
+提神 10.604840786
+三八 11.598092559
+搏杀 9.94943393339
+马奇诺 11.4157710022
+收获量 11.598092559
+万荣 11.598092559
+河修运 13.2075304714
+瓦赫兰 12.5143832909
+异地 8.79473217808
+阿月浑子 13.2075304714
+大骗子 11.7034530746
+清妍 13.2075304714
+皮下注射 10.9562386728
+绍武 12.5143832909
+龙兴寺 11.598092559
+蒙族 11.598092559
+提示 6.79982574303
+瓦兹 12.2912397395
+阿里亚 11.8212361103
+地沟 11.5027823792
+玄真观 12.5143832909
+王派 11.1280889297
+管雷 12.8020653633
+粘固剂 12.5143832909
+瓦全 12.5143832909
+蒙旗 11.8212361103
+拼得 12.2912397395
+天兴元 11.5027823792
+张謇 9.00283785202
+自动性 12.8020653633
+上万口 13.2075304714
+顾盼生辉 12.5143832909
+享用 8.99540287354
+地格 13.900677652
+称便 13.2075304714
+陈瞎子 7.50541605386
+王洽 13.2075304714
+季候 13.900677652
+巨野 10.765183436
+剑柄 10.0940151622
+瓣膜 9.98865464655
+瓦克 11.2616203224
+入药 8.52078029844
+新西兰 8.00352378434
+翻了一番 10.1871055853
+伊巴丹 11.8212361103
+王克莱 13.900677652
+称作 8.12302532875
+浓发 11.7034530746
+锦阳 13.900677652
+拼形 13.900677652
+张说 11.1926274509
+全球中文 13.900677652
+本科专业 13.2075304714
+奥尔温 13.2075304714
+新开岭 12.2912397395
+垃圾堆 10.642581114
+系统部 11.5027823792
+温总管 13.2075304714
+谈言微中 13.900677652
+政治系 11.2616203224
+汤豪泽 13.2075304714
+伊犁河 9.46986085313
+清好 12.8020653633
+栾氏 12.8020653633
+颠覆者 12.5143832909
+张诚 10.1164880181
+详悉 12.5143832909
+迟来 11.1280889297
+高结彩 12.8020653633
+上蜡 12.2912397395
+北陆 9.19114745066
+碎雪 12.8020653633
+手足之情 11.2616203224
+巩县 10.0088573539
+登山鞋 13.900677652
+修房 12.5143832909
+集腋成裘 13.900677652
+一族 8.83177344976
+清夜 12.1089181827
+觅食 8.63798746307
+乌进孝 13.2075304714
+俗下文字 13.900677652
+胡你真 13.900677652
+华联商厦 12.5143832909
+国际米兰 12.8020653633
+早生贵子 11.8212361103
+蛤蟆镜 11.9547675029
+花止芳 11.9547675029
+油料库 13.900677652
+中正 9.84023464143
+疏放 12.8020653633
+申先生 13.900677652
+第二眼 12.8020653633
+一教就会 13.900677652
+北陵 11.9547675029
+导航仪 10.7226238216
+八起 13.900677652
+稳扎稳打 10.604840786
+生物力学 10.8561552143
+张银盘 13.2075304714
+高矮不一 13.900677652
+华侨城集团 12.8020653633
+溴甲烷 12.5143832909
+表姐妹 13.2075304714
+鹅掌风 12.8020653633
+伪命 13.900677652
+明月清风 11.598092559
+抗病品种 11.7034530746
+黄沙 9.10488710638
+万艘 10.9562386728
+时装品牌 12.8020653633
+氟化合物 11.3357282945
+电动势 9.5062284973
+渺然 13.2075304714
+季兰 13.900677652
+固定资金 13.2075304714
+杨陵区 13.2075304714
+季兴 13.2075304714
+抹上去 13.900677652
+两条路线 11.7034530746
+万艳 13.900677652
+锉磨 13.900677652
+电脑系统 11.8212361103
+结婚戒指 11.598092559
+老军医 13.900677652
+竹膜 13.900677652
+自况 12.5143832909
+核试验 9.5062284973
+佳讯 13.2075304714
+喇叭 8.45825994145
+汉滩江 13.2075304714
+玉照 12.5143832909
+扶起方 13.900677652
+野食 12.8020653633
+偶犯 11.9547675029
+汉击平 13.2075304714
+反邪归正 12.8020653633
+塞萨洛 13.900677652
+诸戎 11.4157710022
+登山队 11.5027823792
+帕利塞 13.900677652
+开办费 13.900677652
+止跌回升 9.5062284973
+三儿 11.7034530746
+不长不短 11.8212361103
+汇编语言 10.9562386728
+青海华鼎 12.5143832909
+北韩 13.900677652
+范成大 10.9049453784
+侵袭 8.44535653662
+迟暮 11.4157710022
+马丁工 13.900677652
+藏北高原 10.4666904475
+网络理论 12.1089181827
+万般 10.1164880181
+子刘 11.598092559
+负案在逃 13.2075304714
+鲈形目 9.91169360541
+贝子花园 13.900677652
+郭大鑫 12.5143832909
+答卷 10.0720362555
+后悔不迭 11.9547675029
+嗡声 12.5143832909
+聚义厅 10.2897597393
+以前年度 12.8020653633
+清塘 12.5143832909
+更得 11.1280889297
+印江 13.900677652
+新绛县 12.5143832909
+无战事 11.598092559
+福严寺 10.5684731418
+孙国辅 11.598092559
+窥镜 12.5143832909
+留美 10.2897597393
+经营户 11.3357282945
+毛纲海 13.2075304714
+狙击 9.96885201925
+宝叔房 13.900677652
+丰功伟绩 10.604840786
+终日 8.78268383956
+罗光文 13.900677652
+上虞 9.87532596124
+倾泻 9.36807815882
+微行 13.900677652
+事败 10.3743171274
+季冬 13.900677652
+付托 11.4157710022
+倾注 9.36807815882
+神经过敏 11.3357282945
+万节 13.2075304714
+第一人称 11.0674643079
+库鲁河 13.900677652
+北非 8.05135287203
+英雄人物 9.94943393339
+露西亚 13.2075304714
+突飞猛进 9.75754292558
+北面 8.08654712015
+万花 13.2075304714
+称为 4.99374231292
+鸡蛋 7.70219893548
+哽塞 12.8020653633
+清顺治 9.56994431169
+季军 10.8096351986
+魏氏世 12.8020653633
+侪辈 12.8020653633
+第六十五回 12.2912397395
+净资产值 11.3357282945
+倾泄 11.598092559
+贝克尔 10.8096351986
+标记原子 13.900677652
+反踢 13.900677652
+向西华 12.2912397395
+皮节 13.900677652
+申时行 10.9049453784
+德宁殿 12.8020653633
+底物 10.7226238216
+曲河 12.2912397395
+没本事 10.0294766411
+两党制 11.4157710022
+拄杖 11.4157710022
+毛玉 11.1926274509
+走下台 12.1089181827
+不关痛痒 12.1089181827
+灯座 13.2075304714
+望君侯 12.8020653633
+查找文件 13.900677652
+帽缨 12.5143832909
+挥霍无度 11.1926274509
+底牌 10.4349417492
+等离子 9.58318953844
+底版 11.4157710022
+一程 9.48183704418
+舒适性 8.86372504956
+幕天席地 13.2075304714
+底片 9.84023464143
+亮度高 12.2912397395
+看着办 10.0294766411
+倾卸 13.2075304714
+刻薄话 12.2912397395
+文进士 12.8020653633
+玉业 12.1089181827
+单调乏味 12.2912397395
+好了吗 10.0505300503
+倾危 11.7034530746
+农抑商 11.9547675029
+岛山 11.9547675029
+光呼吸 12.2912397395
+气相反应 12.5143832909
+红甲 11.9547675029
+自内 12.2912397395
+庄茶栈 12.8020653633
+篡夺 9.5062284973
+新年礼物 12.5143832909
+忍着 9.15574552361
+兰德尔 11.598092559
+伤筋动骨 10.9049453784
+公瑾之 12.5143832909
+主席台 9.61021821083
+嘴巴 7.43142733518
+猴年马月 11.9547675029
+索隐 12.8020653633
+垛口 10.8561552143
+无条件 8.61241062128
+数源科技 11.8212361103
+京西 9.5062284973
+曹靖华 12.2912397395
+红生 12.1089181827
+抗抑郁 10.7226238216
+开怀一笑 13.2075304714
+嘉年华 10.7226238216
+剑头 12.2912397395
+国相印 12.5143832909
+黄维垣 13.2075304714
+赈救 13.2075304714
+灯市 10.604840786
+反身 10.3743171274
+大手笔 8.96620371885
+盖拉河 13.900677652
+圣土 10.642581114
+嗣承 13.2075304714
+技术学校 9.74179456862
+墙报 12.2912397395
+深水港 10.0088573539
+全能化 13.2075304714
+布盖 13.2075304714
+子丕平 12.5143832909
+簇叶 13.900677652
+子明保 12.2912397395
+折冲府 10.9562386728
+陈家祠 13.2075304714
+揪斗 11.598092559
+焦山寺 13.2075304714
+封面设计 12.8020653633
+卓资北 13.2075304714
+罗王子 13.900677652
+需方 13.900677652
+云屯雾集 12.8020653633
+艾萨克 12.2912397395
+秋子姐 12.8020653633
+攀过 12.8020653633
+张汉杰 12.8020653633
+面粉厂 10.4994802703
+际遇 9.94943393339
+玉井 12.1089181827
+杨业勇 13.2075304714
+目的性 10.3453295905
+皮艇 12.1089181827
+相唯识 12.5143832909
+厦门岛 11.9547675029
+狱门 12.5143832909
+三份 9.82314020807
+清朗 10.8561552143
+合家幸福 13.900677652
+栓塞 9.85762638414
+小奴恩 13.900677652
+玉人 10.9049453784
+焕彩 13.900677652
+下降时间 13.900677652
+潘尼兹 13.2075304714
+枇杷膏 13.2075304714
+视错觉 13.900677652
+参观团 11.8212361103
+借入者 10.6818018271
+冰雪节 13.900677652
+弓式 13.900677652
+士气涣散 13.2075304714
+玉亭 8.56313957227
+皮艾 13.900677652
+烧昏 13.2075304714
+皮色 10.8096351986
+弃瑕取用 13.900677652
+大石头 9.31571017331
+舒适感 11.1280889297
+东一西 12.8020653633
+玉佛 11.9547675029
+烧柴 11.1926274509
+依法严惩 11.7034530746
+墓石 12.2912397395
+南非共产党 12.8020653633
+真实有效 11.598092559
+五部曲 12.8020653633
+碧海青天 13.900677652
+下颚骨 13.900677652
+言开战 13.900677652
+鼻端 10.5684731418
+张溥辑 10.604840786
+滕王阁 11.3357282945
+町村 13.2075304714
+文学批评 9.93038573842
+到家 9.21854642485
+纳黎宣 12.1089181827
+转卖 9.30555780184
+杯座 12.8020653633
+抛头颅 11.1926274509
+头面人物 10.2630914922
+伊萨贝拉 12.8020653633
+内装 9.80633308975
+东明县 11.7034530746
+作伥 13.900677652
+六元 10.765183436
+雪团 11.7034530746
+付之东流 11.1926274509
+广建宫 12.1089181827
+蒋廷锡 12.2912397395
+国文科 13.900677652
+亚速海 10.533381822
+反转 8.00903344015
+灯心 12.5143832909
+自动式 12.5143832909
+负重 9.05649056552
+化工原料 9.31571017331
+鼻窦 11.1280889297
+大力神 10.4666904475
+技术移民 13.2075304714
+剑士 13.900677652
+四部合唱 12.1089181827
+史桂堂 13.2075304714
+赵败魏 13.2075304714
+教育部门 9.6811699468
+平淡无奇 11.0674643079
+红球 10.642581114
+有口难辩 12.2912397395
+语重心长 10.0294766411
+胆碱受体 11.9547675029
+后乐堂 12.2912397395
+航空图 12.2912397395
+互联网安全 10.9049453784
+色彩缤纷 11.3357282945
+引喻失义 13.900677652
+第六篇 11.9547675029
+停表 13.900677652
+评估师 10.8096351986
+红瓦 11.5027823792
+官渡 9.98865464655
+薪俸 11.0103058941
+佯死 12.5143832909
+污物 10.8096351986
+修护 11.1926274509
+工资标准 11.1926274509
+探丧 12.8020653633
+计算机芯片 13.2075304714
+公事公办 10.4041700905
+烧杯 10.9049453784
+南飞 11.4157710022
+比不上 8.70218062071
+出没无常 11.3357282945
+转益多师 11.8212361103
+皮茨 12.1089181827
+不存 9.94943393339
+倾力 10.8096351986
+宣抚使 8.65893063692
+豆蔻年华 11.8212361103
+烟具 11.7034530746
+一百多名 10.642581114
+春分时节 13.2075304714
+索靖 12.5143832909
+绵白糖 13.2075304714
+乱套 10.8561552143
+烧杀 9.84023464143
+出厂日期 13.900677652
+自然法则 10.6818018271
+旧恨 11.598092559
+赵家庄 12.8020653633
+清晰 6.94222925868
+承销 8.3285236198
+业务量 9.43476953332
+奥尔兰 13.2075304714
+清明 8.59737274392
+雷奥 13.900677652
+脑血栓 11.1926274509
+王胆死 12.8020653633
+西夕温 13.2075304714
+麻鹰岗 13.2075304714
+切碎 10.3453295905
+紫翠 12.5143832909
+民有菜色 13.900677652
+马殷死 12.8020653633
+锡林浩特 11.3357282945
+灯彩 11.4157710022
+航空器 9.89334446674
+夫妻关系 10.1394775363
+自净 11.0674643079
+卡万戈 13.2075304714
+萧子蔚 11.3357282945
+暗自 8.32094782599
+起诉人 11.598092559
+驯兽 12.8020653633
+腾龙洞 12.5143832909
+蚕室 11.2616203224
+电极电势 11.8212361103
+内裤 10.2897597393
+终审 10.8096351986
+可怜兮兮 11.3357282945
+灯影 9.63799777493
+亿个 10.4994802703
+皮肉 8.5488195185
+演唱风格 12.2912397395
+绍圣 10.604840786
+需有 10.1164880181
+详尽 8.76487921493
+苑派湫 13.2075304714
+立昌邑 13.2075304714
+奥尔加 12.8020653633
+剑客 11.7034530746
+底火 10.9049453784
+马径奔 13.2075304714
+回教徒 12.8020653633
+小美女 11.9547675029
+赞皇 12.8020653633
+怒形于色 11.0674643079
+鼻科 13.900677652
+雪场 11.8212361103
+反调 12.1089181827
+茶钱 11.5027823792
+东西 4.77328420082
+炼就 11.4157710022
+皮肤 6.49822613116
+悠哉 13.2075304714
+有失公允 11.4157710022
+房内束 12.8020653633
+暗舱 13.900677652
+极端派 11.3357282945
+清旷 11.7034530746
+清时 10.4041700905
+青虾 11.598092559
+钢筋铁骨 12.1089181827
+金旋 13.2075304714
+六十九 11.9547675029
+廖公公 11.8212361103
+闻刘备 12.8020653633
+厦门市 9.98865464655
+地建园 13.2075304714
+拼接 9.85762638414
+一十六枚 12.8020653633
+黑方先 13.900677652
+陆绩 12.5143832909
+红眼 11.1926274509
+称王 8.78268383956
+雍齿 12.2912397395
+倾入 11.8212361103
+一百五十四万余 13.2075304714
+贺拔氏 13.2075304714
+阿家翁 13.2075304714
+季氏 11.598092559
+诸书行 12.8020653633
+仆隶 12.1089181827
+若兴兵 12.8020653633
+歌咏 10.4349417492
+更为理想 12.8020653633
+人烟稀少 9.65218240993
+亚尔代 12.2912397395
+食菌 13.2075304714
+暗色 9.62401153296
+遗失在 12.8020653633
+有所改善 8.98802276624
+楼梯扶手 12.5143832909
+朗曼 11.598092559
+清新 8.25170341381
+皮胶 12.1089181827
+石松粉 13.2075304714
+迈进 8.88339781516
+东角 13.900677652
+宇文泰 9.77354326693
+攀越 11.8212361103
+谋计 11.9547675029
+貂熊 12.5143832909
+呐喊助威 10.8561552143
+贯穿辐射 13.900677652
+漫言 13.900677652
+清教 11.1280889297
+里奥格兰德 12.5143832909
+磨矿 12.8020653633
+红石 10.8561552143
+红矾 13.900677652
+自分 11.9547675029
+绿营 10.0940151622
+封缄 13.2075304714
+童男童女 10.1630080337
+鼻祖 10.0294766411
+盛发期 12.8020653633
+育儿 10.604840786
+责备 7.99804431857
+布瓦 12.5143832909
+唐代 6.54248389924
+暗花 12.2912397395
+汉家女 13.900677652
+崔应元 12.2912397395
+清整 12.2912397395
+蒙头 10.5684731418
+一员大将 9.84023464143
+窗纸 9.84023464143
+倾出 13.900677652
+底点 13.2075304714
+罗宾韦尔 13.2075304714
+吴式芬 11.9547675029
+灯展 13.2075304714
+京话 13.900677652
+萨吉姆 13.900677652
+中央邦 11.4157710022
+鸡犬不闻 13.2075304714
+吓破胆 12.2912397395
+周仓引 13.2075304714
+歌后 13.900677652
+白话诗 11.9547675029
+育养 13.900677652
+发明者 9.69598503258
+一百多块 11.7034530746
+逾量 13.2075304714
+歌吟 13.2075304714
+清收 13.900677652
+嘴形 10.8561552143
+演武厅 11.1926274509
+企信通 13.900677652
+东街 9.05649056552
+大刀阔斧 10.0505300503
+农业化 13.900677652
+老布什 13.900677652
+去接 9.74179456862
+反责 13.900677652
+荫蔽地 13.900677652
+攀谈 10.604840786
+难道说 10.604840786
+反贪 11.7034530746
+皮膜 10.642581114
+拉特纳 11.4157710022
+永久磁铁 11.8212361103
+红白 9.91169360541
+东行 9.91169360541
+移动性 11.598092559
+陈维亚 13.900677652
+摸上去 11.8212361103
+错杂在 13.900677652
+业余教育 11.598092559
+东兴镇 12.8020653633
+古名崇 13.2075304714
+率土之滨 13.900677652
+烟叶 8.66423568915
+倾倒 9.24671730182
+盯守 13.900677652
+曹军 9.58318953844
+烟台 8.43684584695
+医药集团 10.6818018271
+大学校长 10.0940151622
+老陈 8.80081122415
+阿金纳 12.5143832909
+列管 13.2075304714
+灾情 9.74179456862
+取得联系 9.45802639549
+行情看涨 11.7034530746
+历声 13.900677652
+终夜 11.8212361103
+调研材料 12.8020653633
+暴徒 10.0088573539
+艾布拉姆斯 11.0674643079
+每一寸 10.8096351986
+旋流 12.2912397395
+富士 10.4349417492
+十四五岁 10.604840786
+懂得 6.99693039439
+拼抢 11.0674643079
+斯通 11.1280889297
+放在心里 10.8561552143
+污点 10.6818018271
+印求法 12.8020653633
+偶人 11.598092559
+空中缆车 13.900677652
+烟厂 10.9049453784
+寓教于乐 12.5143832909
+帕普斯 13.2075304714
+清华同方 12.5143832909
+少年儿童出版社 13.2075304714
+略加修改 13.2075304714
+形象设计 12.1089181827
+新险种 13.900677652
+唐努山 12.8020653633
+贝文 13.900677652
+歌喉 10.4994802703
+终天 12.5143832909
+安抚司 10.0720362555
+马配驹 13.2075304714
+小钢炮 9.5062284973
+朱国桢 13.2075304714
+皮脂 10.533381822
+大开绿灯 13.2075304714
+漂亮起来 13.900677652
+蛋白激酶 12.8020653633
+朗朗 9.58318953844
+终始 10.8561552143
+院校教育 12.8020653633
+泪汪汪 10.8561552143
+到处 6.49883607323
+驯化 9.24671730182
+阿尔忒弥 12.5143832909
+巴德沙 13.2075304714
+布痕 11.8212361103
+元廷另 13.2075304714
+反超 10.6818018271
+铁老大 13.2075304714
+索镇 12.5143832909
+国土面积 9.62401153296
+到头 9.18217878068
+烟卷 10.4349417492
+碰巧在 12.2912397395
+一隅之地 11.5027823792
+一窝 9.80633308975
+落入法网 12.8020653633
+菜篮子 11.1280889297
+从城旦 13.2075304714
+加勒比 9.5062284973
+二十四步 13.900677652
+三十余篇 13.2075304714
+格林威治 11.1926274509
+国家烟草专卖局 13.2075304714
+红皮 10.7226238216
+装孙子 11.598092559
+白瓜子 12.2912397395
+汉粤川 13.2075304714
+汝识吾 13.2075304714
+非打 12.2912397395
+航空员 13.900677652
+水烟筒 12.5143832909
+基因连锁 13.2075304714
+皮腔 11.8212361103
+塞姆语 12.1089181827
+西门口 12.5143832909
+完璧归赵 11.8212361103
+耳朵眼 12.5143832909
+奥尔南 13.900677652
+拼成 10.4349417492
+斯邦 13.2075304714
+单生花 12.8020653633
+马雄山 11.3357282945
+山铝业 10.642581114
+希有 13.900677652
+同年同月 12.1089181827
+朗松 12.5143832909
+瓦赫河 13.2075304714
+刘海西 13.2075304714
+潭里 12.1089181827
+草诏 11.5027823792
+到底 5.8026428958
+陨首 13.900677652
+互派 11.2616203224
+隆重召开 11.598092559
+布片 10.9562386728
+憨直 12.1089181827
+鼻翼 9.65218240993
+称病 10.3453295905
+浅得 13.2075304714
+一千万年 12.8020653633
+太少宰 13.2075304714
+耕马 13.900677652
+羊开泰 12.8020653633
+赶出来 9.80633308975
+内伤发热 13.900677652
+费城故事 13.900677652
+布特 11.7034530746
+演出团 13.2075304714
+尼罗非 13.2075304714
+鼻翅 13.2075304714
+东软 11.1280889297
+伏羲女娲 13.900677652
+黑布蒙 12.5143832909
+蒙德 11.7034530746
+到庭 10.9562386728
+皮蛋 10.4041700905
+划清界线 12.5143832909
+雄鹿队 13.900677652
+红绸舞 12.8020653633
+绍兴 7.8184587416
+味觉 9.94943393339
+时立制 12.2912397395
+跳上去 11.0674643079
+杨问孙 13.2075304714
+国画系 12.8020653633
+满脑袋 13.900677652
+隔壁邻居 11.7034530746
+拼斗 12.1089181827
+异彩纷呈 11.3357282945
+柔丝 12.8020653633
+意志集中 12.8020653633
+地藏庵 12.2912397395
+剑川 10.7226238216
+古生物学 9.7898037878
+宋方 12.2912397395
+谒见 9.66657114738
+七百万 11.598092559
+互济 11.8212361103
+纯阳 11.7034530746
+航空史 12.2912397395
+危月燕 12.8020653633
+下落不明 9.41204128224
+屹立不动 13.900677652
+不得志 10.3453295905
+班徐宁 13.2075304714
+东进 8.96620371885
+有形损耗 12.8020653633
+蒙其庥 13.2075304714
+宫监 11.3357282945
+狂三诈四 13.900677652
+东迁 9.7898037878
+三丝 12.8020653633
+笼中 10.7226238216
+坐板凳 13.900677652
+承造 13.900677652
+商大贾 12.8020653633
+五十五个 12.5143832909
+底盘 8.0484751722
+下辈子 10.7226238216
+嘴头 12.1089181827
+黄玉 10.9049453784
+烟味 10.4666904475
+十秒钟 11.9547675029
+庚戌 12.2912397395
+大马哈鱼 10.9562386728
+走下坡 12.2912397395
+烛照 10.765183436
+答案 6.75311838079
+安徽人民出版社 13.2075304714
+宫相 11.7034530746
+子宁 13.900677652
+杨柳树 13.900677652
+德密尔 12.8020653633
+尔丹 12.8020653633
+中桥 11.9547675029
+路风 13.2075304714
+余音 10.604840786
+纪念活动 11.598092559
+闪电般 9.89334446674
+跳下来 9.27570483869
+纳格尔 12.1089181827
+扑上去 9.62401153296
+希腊队 13.900677652
+房宇 12.1089181827
+历史事实 10.2630914922
+杯子 8.35160156708
+病毒学家 12.8020653633
+车友 10.765183436
+金锦香 13.900677652
+木板地 13.900677652
+烧成 9.10488710638
+安岐 12.8020653633
+续订 11.5027823792
+双鱼座 11.7034530746
+东边 8.03420959504
+朱祁镇 11.598092559
+殓葬 12.5143832909
+赵家富 11.7034530746
+倾城 11.2616203224
+营养师 11.1926274509
+蒙影 12.2912397395
+三姓家奴 13.2075304714
+松饶 13.2075304714
+小试锋芒 13.900677652
+密特朗 10.9562386728
+空气调节 11.598092559
+联谊会 10.5684731418
+灰锰氧 13.900677652
+大举进犯 10.604840786
+终归 10.1394775363
+雇农 10.4666904475
+凭空猜测 12.8020653633
+红火 8.74738605748
+享乐 9.45802639549
+歌台 13.900677652
+王下令 13.900677652
+辛杜格 12.8020653633
+提成费 13.900677652
+神灭论 11.9547675029
+产业结构 7.81390292506
+电话会 12.1089181827
+庙神 13.2075304714
+碧霞祠 13.900677652
+柔佛 11.0674643079
+轨道交通 7.80260336981
+吴下阿蒙 13.900677652
+任夔 13.900677652
+拉雪兹 13.900677652
+相互交换 11.0674643079
+纪效 13.900677652
+示波镜 13.900677652
+布拉港 13.900677652
+剑峰 11.4157710022
+手骨 11.9547675029
+集体所有 10.533381822
+终弟 13.2075304714
+宁河 11.5027823792
+军政人员 11.7034530746
+探了 10.9562386728
+马尔康 11.9547675029
+喀拉拉邦 12.1089181827
+自傲 11.1926274509
+夭逝 13.2075304714
+物理攻击 13.900677652
+雍顺 13.900677652
+雇凶 13.2075304714
+歌厅 9.65218240993
+阜阳 9.7898037878
+金甲锦 12.8020653633
+正旺 10.9049453784
+逾限 13.2075304714
+平斯克 12.8020653633
+几十毫米 13.2075304714
+拜你为师 12.2912397395
+承重 10.0940151622
+泄水闸 12.2912397395
+煤制油 13.900677652
+主席团 8.98069672615
+三丰 12.8020653633
+佳篇 12.1089181827
+给惠国 13.2075304714
+古柯叶 13.2075304714
+小水电 10.3743171274
+烧掉 9.26594866375
+薄幕呈 13.900677652
+蒙师 11.1280889297
+千颗 12.2912397395
+红烧 10.0294766411
+栗树 12.5143832909
+涂文辅 13.2075304714
+代销点 11.9547675029
+红热 11.7034530746
+蒙布 12.8020653633
+中标 8.01735526349
+剑尾 12.5143832909
+缭绕 8.95903522937
+详审 12.2912397395
+大赏 11.1926274509
+科科河 13.900677652
+诸书达 12.8020653633
+反讽 12.5143832909
+烟商 13.900677652
+干涉 7.42063309005
+格林兄弟 11.8212361103
+反论 13.900677652
+瓦檐 12.8020653633
+清扬 12.5143832909
+停下去 12.8020653633
+宇文毓 11.8212361103
+剑尖 11.7034530746
+烧损 12.8020653633
+貂皮 9.74179456862
+同代人 12.1089181827
+详实 11.1280889297
+预先警告 12.8020653633
+歌单 12.5143832909
+电流效率 13.900677652
+艺坛 11.598092559
+烛火 10.9049453784
+够不上 11.1926274509
+红烟 11.8212361103
+纯音 12.1089181827
+赈恤 12.2912397395
+红烛 10.4041700905
+鲁鲁 13.2075304714
+倾国 10.8096351986
+肖伯纳 13.900677652
+沃斯特 13.2075304714
+反诬 11.3357282945
+温怒 13.2075304714
+偏紧 9.17328983326
+皮蝇 13.2075304714
+仰惟吾 13.2075304714
+医疗保健 9.69598503258
+巍巍荡荡 13.900677652
+煤制气 12.1089181827
+航船 10.2630914922
+既往不究 13.900677652
+红点 11.2616203224
+收队 12.1089181827
+方知其 13.2075304714
+费时间 12.5143832909
+反证 11.3357282945
+灾星 11.3357282945
+反诉 11.0674643079
+账户卡 12.2912397395
+详察 11.3357282945
+倾囊 11.8212361103
+泰伦 11.5027823792
+详密 11.8212361103
+徐世隆 13.2075304714
+反话 11.5027823792
+拼搏 10.0720362555
+反诘 12.8020653633
+寓目 13.900677652
+年老多病 11.3357282945
+水果刀 11.8212361103
+发生争执 10.0720362555
+羊祜乃 12.5143832909
+删补 12.2912397395
+维斯瓦河 11.0103058941
+轿门 10.765183436
+洒家 10.4994802703
+阵发性 10.1164880181
+青蛙 8.78868986362
+荣府内 13.2075304714
+达尔文主义 10.765183436
+特为 10.1630080337
+艾滋病 8.61241062128
+南齐 10.533381822
+标配 8.87679713113
+老秀才 10.1871055853
+东起 8.89673134603
+扎赉特旗 13.2075304714
+洋车 10.5684731418
+哈利德 13.900677652
+中共上海市委宣传部 12.8020653633
+到岸 10.4666904475
+姻缘 9.49395840471
+斧钺之诛 12.8020653633
+烟囱 9.19114745066
+候缺 12.1089181827
+污痕 12.5143832909
+纽约大学 10.1630080337
+七台河市 12.1089181827
+乔应甲 12.5143832909
+红日平 12.8020653633
+会者不难 13.2075304714
+搬起来 12.2912397395
+索邦 12.8020653633
+反衬 11.1926274509
+三四十万元 13.2075304714
+癞蛤蟆想吃天鹅肉 12.1089181827
+一百多只 12.2912397395
+切缘 12.8020653633
+苏建 12.8020653633
+孔明亦 11.4157710022
+天兆 11.0674643079
+精锐部队 10.0940151622
+传统媒体 10.604840786
+巴金 10.3171587135
+终将 9.48183704418
+换证 11.4157710022
+搏弈 13.2075304714
+谷斯根 13.2075304714
+瓦楞 10.3171587135
+绿蒂 12.2912397395
+篡弑 12.8020653633
+归云洞 12.5143832909
+红男绿女 11.9547675029
+观念形态 12.1089181827
+剂量学 13.2075304714
+肌肉发达 10.7226238216
+灯壶 13.2075304714
+东购 13.900677652
+认知科学 11.8212361103
+攀西 11.8212361103
+絮凝 12.8020653633
+姿势 7.85330547293
+桔饼 12.8020653633
+骗马 11.9547675029
+卡皮尼 12.8020653633
+和抗凝 13.900677652
+派遣证 13.900677652
+和央宗 12.5143832909
+打成平手 12.5143832909
+八千万 12.8020653633
+纯铁 12.1089181827
+纯铜 11.598092559
+寻踪 12.1089181827
+标量 10.3453295905
+一百六七十斤 13.900677652
+绝仁弃义 13.2075304714
+一百多匹 13.2075304714
+曹公 10.4666904475
+更凉 13.2075304714
+不得已 8.00352378434
+特事 11.598092559
+特于 12.8020653633
+期交所 11.1926274509
+梁冰 12.5143832909
+摩罗 11.3357282945
+艺员 12.1089181827
+锄奸 12.5143832909
+拼杀 11.0103058941
+电风扇 10.2630914922
+百不失一 12.5143832909
+纯银 11.5027823792
+细胞膜 9.36807815882
+降下去 12.5143832909
+军官学校 10.5684731418
+知其然 11.9547675029
+拉尼西亚 9.94943393339
+回忆录 8.92394390956
+交互技术 13.2075304714
+推断出 10.4666904475
+北京市文联 11.9547675029
+养老保险 9.24671730182
+幸进身 13.900677652
+特以 11.9547675029
+损失惨重 9.07236391467
+嘴子 11.8212361103
+耳挖 13.900677652
+汤加减 10.533381822
+特任 12.5143832909
+剑形 11.8212361103
+来自体内 12.8020653633
+覆水难收 12.8020653633
+旋滚 13.900677652
+蔡京乃 13.2075304714
+月攘一鸡 13.2075304714
+灯塔 9.27570483869
+特价 9.75754292558
+哥达德 13.2075304714
+艺名 9.85762638414
+丰顺 11.7034530746
+八万多 13.2075304714
+烟嘴 11.5027823792
+纯钢 11.8212361103
+犯事儿 13.2075304714
+魏领 13.2075304714
+布点 10.8561552143
+侯府 11.2616203224
+武功 8.81927328699
+航空兵 8.39941944143
+伽利略 9.04864738806
+功首罪魁 13.900677652
+娱乐 7.54804825566
+小波浪 13.2075304714
+李景汉 12.1089181827
+海螺沟 12.2912397395
+二十四平方公里 12.5143832909
+瓦根 12.8020653633
+工艺程序 12.2912397395
+皮薄 10.533381822
+阿炳叫 12.1089181827
+换回来 11.8212361103
+特伦 12.2912397395
+初步阶段 12.5143832909
+汕尾 11.8212361103
+倾听 8.32472854883
+赵家堡 12.5143832909
+阳崖阴 11.9547675029
+义结金兰 13.2075304714
+负相关 10.2371160058
+红片 13.900677652
+连鬼 12.1089181827
+看走了眼 11.7034530746
+倾吐 9.98865464655
+倾向 6.67957255379
+威廉斯 10.2371160058
+喝粥 10.9049453784
+特优 12.5143832909
+傅良佐 12.8020653633
+高衙内 10.9049453784
+公佐武 12.8020653633
+详备 10.9049453784
+科学幻想 11.598092559
+受资国 11.4157710022
+红牛 11.8212361103
+绍剧 12.5143832909
+买上告下 12.8020653633
+增值率 8.9102450652
+俞正燮 12.8020653633
+慷他人之慨 13.900677652
+纪传志 13.2075304714
+棕色 8.50705010562
+成交率 11.598092559
+通古斯 10.0505300503
+和畅 12.5143832909
+陈高祖 12.1089181827
+特使 9.20019728618
+特佳 12.1089181827
+隆重集会 12.5143832909
+四五道 12.2912397395
+东谷 11.9547675029
+夹脊 12.5143832909
+雅温得 11.9547675029
+四平市 11.4157710022
+兴贤 13.900677652
+李雄继 13.2075304714
+揪打 11.9547675029
+脉冲宽度 12.1089181827
+特作 13.900677652
+合肥市 10.0940151622
+特体 12.8020653633
+飘泊不定 13.900677652
+烟垢 12.8020653633
+互溶 11.3357282945
+切结 13.2075304714
+侍应生 12.5143832909
+正文 8.41588071849
+红狮 13.900677652
+伯舒拉 11.598092559
+红蓝铅笔 11.7034530746
+浅尝 12.5143832909
+海水不可 12.5143832909
+大输液 13.900677652
+都群公 13.2075304714
+总的看 11.4157710022
+红狼 13.900677652
+势倾天下 13.2075304714
+联合支持 13.2075304714
+特例 9.65218240993
+反覆 10.0940151622
+反要 11.1280889297
+求亲告友 13.900677652
+臭男人 11.9547675029
+敦请 11.4157710022
+李景波 13.900677652
+颀伟 13.2075304714
+巴兰德 13.900677652
+特供 12.8020653633
+红狐 12.5143832909
+繁华区 13.900677652
+灯头 11.1926274509
+美国民主党 12.2912397395
+烟土 10.4041700905
+瓦棱 12.1089181827
+住交会 11.5027823792
+俊伟 11.2616203224
+绝育手术 13.2075304714
+内至 13.2075304714
+鬼气 11.0103058941
+浅层 9.80633308975
+愧赧 13.2075304714
+鲁麓 12.1089181827
+南麓 8.18364995057
+福鼎县 13.2075304714
+抓住机会 10.4041700905
+烟圈 11.3357282945
+厉行改革 12.8020653633
+数学计算 11.1280889297
+内消旋 11.3357282945
+卜者 12.5143832909
+反观 9.48183704418
+切线 10.4349417492
+斯钦 12.5143832909
+怯生生 10.533381822
+三例 12.1089181827
+邪魔外道 12.8020653633
+卡巴雷 13.900677652
+消化腺 10.642581114
+杜预镇 13.2075304714
+杜注 12.8020653633
+高模量 11.7034530746
+蒙山 10.765183436
+鲁麻 13.2075304714
+负面 7.91926344072
+闭囊壳 13.900677652
+玉函山 11.9547675029
+沃野平畴 13.900677652
+内详 13.2075304714
+韩子奇 7.32142643997
+空军指挥学院 13.2075304714
+高名衡 9.19114745066
+课表 13.2075304714
+肿大 9.18217878068
+丰隆 11.7034530746
+鱼贩子 11.8212361103
+七六年 12.5143832909
+维拉特 11.8212361103
+毫无瓜葛 12.1089181827
+闻良禽 13.900677652
+安史之乱 8.61747392324
+至善至美 12.5143832909
+瓦朗 12.1089181827
+烟壶 10.765183436
+互感 11.3357282945
+人均产值 11.8212361103
+半山坡 11.1926274509
+射精管 12.8020653633
+镇南关 10.533381822
+三五遍 13.900677652
+宫空 13.900677652
+如何是好 8.6966709649
+财政预算 9.54396882529
+叶帅 12.8020653633
+底稿 10.9562386728
+饥肠辘辘 10.604840786
+红素 11.598092559
+清澈 8.53003962385
+清澄 12.1089181827
+自由王国 11.9547675029
+瓦松 12.5143832909
+红紫 11.8212361103
+整形手术 10.8561552143
+京腔 10.8096351986
+鼻环 12.8020653633
+蒙受 9.01032852375
+嫉恶若仇 13.900677652
+事务管理 11.9547675029
+暗补 13.900677652
+季明 12.1089181827
+俯仰无愧 13.2075304714
+再结晶 11.2616203224
+万数 11.2616203224
+蒙古 6.35846418878
+摊头 13.900677652
+乌凯雷 13.900677652
+烟墩 11.598092559
+京二胡 13.900677652
+灾殃 12.2912397395
+信息科学 11.1926274509
+检测工具 13.900677652
+中国华北地区 11.0674643079
+提条件 13.900677652
+南里 13.2075304714
+暗袋 13.2075304714
+宝钗见 10.8561552143
+倾家 12.1089181827
+因果性 12.5143832909
+底端 11.1280889297
+赈济 8.9519177616
+威虎山 11.8212361103
+嘴唇 7.11735245137
+浅化 13.900677652
+蒙化 11.7034530746
+清潭 13.900677652
+先回到 11.7034530746
+舍甫琴柯 13.2075304714
+底站 13.900677652
+三亿七千万 12.8020653633
+布绢 12.5143832909
+三五十万 13.900677652
+宫端 13.2075304714
+玄明宫 13.2075304714
+蒙医 12.1089181827
+花红 10.4041700905
+战秦琼 13.2075304714
+孙可望 10.8561552143
+前三甲 10.604840786
+中国男足 12.1089181827
+时建兴 12.8020653633
+接力赛跑 12.2912397395
+剑兰 13.900677652
+自然法学 11.0674643079
+行冠礼 12.8020653633
+集体福利 12.2912397395
+镇压住 13.900677652
+清漆 11.3357282945
+详图 12.5143832909
+钉鞋 10.4994802703
+懂吗 9.74179456862
+杨春光 13.900677652
+自足自给 13.2075304714
+包学忠 11.7034530746
+经营商 11.4157710022
+糕点店 13.2075304714
+尼赫鲁 10.3743171274
+不合格率 13.900677652
+连铺 13.2075304714
+一筹 10.2630914922
+味蕾 11.3357282945
+负项 13.900677652
+清漪 13.2075304714
+提供 4.68415642092
+闽江 9.5062284973
+三皈依 12.8020653633
+诺达 12.8020653633
+布纹 13.2075304714
+除夕夜 11.1280889297
+基干民兵 12.2912397395
+美音 13.2075304714
+第三十七条 12.8020653633
+布纳 12.5143832909
+肉禽蛋 12.5143832909
+黄爱 12.5143832909
+余二千万 13.900677652
+腐乳 11.0674643079
+狙杀 13.900677652
+一课 9.69598503258
+断绝往来 12.5143832909
+逐步求精 13.900677652
+之复 13.2075304714
+奖掖 10.9049453784
+设计者 9.59661255877
+连销 13.2075304714
+连锁 7.84155445639
+布罗 11.5027823792
+于制陶 13.900677652
+布罩 12.5143832909
+斯马 13.2075304714
+布置 7.0806612873
+先回去 9.33632946051
+庞儿 12.8020653633
+自此刻起 13.900677652
+多马克 13.2075304714
+需水 11.1280889297
+花弄影 12.8020653633
+额敏河 11.7034530746
+接球员 13.2075304714
+次要方面 13.900677652
+湘南特委 13.2075304714
+填报数据 13.900677652
+需求 5.17079536715
+技术论证 11.9547675029
+上镜率 13.2075304714
+南蛇藤 12.5143832909
+格吕内瓦尔德 12.8020653633
+奥达基 13.2075304714
+燕尔新婚 13.2075304714
+歌德 9.58318953844
+小半条 13.900677652
+提个 10.5684731418
+小半杯 13.900677652
+清源 10.8096351986
+墓群 10.0720362555
+四海一家 12.8020653633
+帆篷 13.2075304714
+弹出来 11.9547675029
+秦楼娃 12.8020653633
+鲁迅文学院 13.900677652
+谢顶 11.598092559
+拌合 12.8020653633
+丙寅年 13.900677652
+教育厅长 12.2912397395
+雇工 9.46986085313
+全屏幕 13.900677652
+灌好 13.2075304714
+狩猎 7.99531580392
+提上 9.24671730182
+提下 12.1089181827
+东航 8.1417758781
+三五十个 11.1926274509
+空白处 11.8212361103
+提不 12.2912397395
+专心一意 13.900677652
+布卢姆 12.2912397395
+提价 7.59075937375
+打听出 11.1926274509
+提任 12.5143832909
+一辆辆 10.8096351986
+相许 11.8212361103
+南郊 8.76487921493
+答数 13.900677652
+太原路 13.900677652
+系列报道 11.3357282945
+南郑 10.4041700905
+内包装 13.900677652
+奥尔夫 12.8020653633
+老枪 13.2075304714
+男明星 13.2075304714
+十分想念 11.8212361103
+德永直 13.2075304714
+南郡 9.6811699468
+新秩序 9.25628675283
+缓征 12.1089181827
+救灾物资 12.8020653633
+执行权 11.7034530746
+摔打 10.4994802703
+夹过 13.900677652
+退休干部 11.4157710022
+演出季 11.8212361103
+直接寻址 13.900677652
+认做 11.2616203224
+保甲法 11.8212361103
+南都 10.765183436
+广播电台 8.65365357982
+终古 12.5143832909
+因人而异 9.87532596124
+紫衣 9.75754292558
+脑组织 10.1630080337
+清清 10.5684731418
+东芝 11.0674643079
+管理人员 8.33233314821
+互惠 9.69598503258
+提交 7.52395070408
+廖耀湘 11.4157710022
+卤钨灯 11.3357282945
+龙兴江 12.2912397395
+几率比 11.1280889297
+由朕亲 13.900677652
+误场 13.900677652
+京胡 11.4157710022
+滚动轴承 11.0103058941
+拌和 11.4157710022
+烟头 9.69598503258
+闽浙 9.94943393339
+红粉 10.7226238216
+切点 12.8020653633
+滴定管 12.5143832909
+紫衫 13.900677652
+刘兄 12.5143832909
+鉴别法 13.2075304714
+提了 8.39128931535
+大兴土木 9.69598503258
+正房 9.85762638414
+燕耳 13.2075304714
+南邻 9.7898037878
+文明卫生 13.900677652
+伊曼纽尔 12.1089181827
+产品设计 9.00283785202
+皮袍 12.5143832909
+连队 8.97342396682
+降下帷幕 13.900677652
+刘守光 12.1089181827
+皮袄 10.4666904475
+徒然 9.94943393339
+细胞质 9.27570483869
+经营型 13.2075304714
+蒙军 12.2912397395
+甚高 9.53122979951
+甲基丙烯酸酯 12.2912397395
+崎岖不平 11.0103058941
+工资级别 13.900677652
+蒙卡奇 12.8020653633
+恶劣影响 11.2616203224
+医学书籍 12.1089181827
+获得性状 12.8020653633
+铺户 11.4157710022
+胡为乎 12.8020653633
+清淤 11.3357282945
+连阳 9.01032852375
+清淡 8.40350942668
+蒙冤 10.9562386728
+太公望 12.1089181827
+一箱 9.87532596124
+后台任务 13.2075304714
+蒙冲 12.2912397395
+一百余里 12.1089181827
+明军劫 13.2075304714
+红缨 10.1871055853
+烧油 10.9562386728
+烧沸 11.9547675029
+皮裘 11.8212361103
+清涟 13.900677652
+林心如 12.8020653633
+受益匪浅 10.4994802703
+连降 11.598092559
+互换 8.76487921493
+二五八团 11.9547675029
+一百零八颗 12.8020653633
+陶哲轩 13.900677652
+普力马 10.533381822
+漠然处之 12.8020653633
+函授生 13.900677652
+若有所失 11.5027823792
+终值 10.4349417492
+清涤 13.900677652
+清涧 12.2912397395
+清润 11.0674643079
+高长恭 13.900677652
+威斯巴登 12.5143832909
+卫生状况 11.7034530746
+讲坛 10.0940151622
+爱牙日 13.900677652
+翻砂工 12.8020653633
+钉锤 12.8020653633
+三桅帆船 13.2075304714
+毒气室 12.8020653633
+余波未平 12.8020653633
+清浊 10.2630914922
+兰芷 11.8212361103
+清流 9.49395840471
+拼死 9.01787572939
+甚于防川 12.2912397395
+赛员 13.900677652
+落羽杉 12.5143832909
+王坚执 12.5143832909
+歌山 13.2075304714
+韩赞周 10.4349417492
+电动机 8.59737274392
+嵇康集 12.5143832909
+瓦斯 9.61021821083
+赤身露体 12.1089181827
+东至 8.38322475551
+唐树备 12.8020653633
+豪侠 11.5027823792
+倍赏 12.8020653633
+固有频率 10.8096351986
+闽清 12.5143832909
+存在论 13.900677652
+差向异构 12.2912397395
+账户就 12.1089181827
+强梢缘 13.2075304714
+清洌 12.8020653633
+蒙克 11.598092559
+烧水 9.77354326693
+垃圾池 13.900677652
+奏明 9.20932976975
+蒙兀 12.1089181827
+蒙元 11.9547675029
+金文翔 12.8020653633
+清洁 7.11848559597
+蒙兄 12.8020653633
+纱裙 11.9547675029
+发布权 12.8020653633
+艰深难懂 13.900677652
+巴尔马克 11.9547675029
+丝丝入扣 11.4157710022
+锻压机 12.8020653633
+清洗 8.32094782599
+连集 13.900677652
+朱高炽 12.1089181827
+卫桑梓 13.2075304714
+购买率 13.900677652
+剑南 10.2117981979
+清津 12.8020653633
+流传于世 11.598092559
+红羊 12.8020653633
+加点油 13.900677652
+红少苔 10.533381822
+王朴奉 12.8020653633
+剥削者 10.4666904475
+损失估计 13.900677652
+北入潞 13.2075304714
+抗倭斗争 13.900677652
+东联 12.2912397395
+维持下去 10.4666904475
+惰性气体 10.4041700905
+无可取代 11.5027823792
+抬上 10.642581114
+抬下 11.1280889297
+切牙 12.8020653633
+切片 9.23723855786
+李泓冰 13.900677652
+广见 13.900677652
+赞美 8.55834340001
+必会 9.20019728618
+保留条款 12.5143832909
+夹起 10.8561552143
+终养 13.900677652
+王领 13.900677652
+荆三棱 11.9547675029
+互成 11.9547675029
+货舱 9.12155415886
+八百三十亩 13.2075304714
+朝秦暮楚 12.2912397395
+体力不支 11.4157710022
+伟晶岩 10.2117981979
+鼻烟 11.598092559
+博望城 12.5143832909
+切特 12.5143832909
+抛射体 11.9547675029
+姿式 10.8096351986
+关健雄 13.900677652
+赖以为生 12.5143832909
+熨平 10.3453295905
+抬举 9.43476953332
+去痛片 12.8020653633
+绮窗 12.8020653633
+候爵 12.5143832909
+清泰 11.0674643079
+沿路上 13.2075304714
+注视点 13.900677652
+哈利勒 12.5143832909
+首创精神 11.9547675029
+被采访者 13.900677652
+团圆节 12.8020653633
+白日青天 12.8020653633
+安宁区 13.2075304714
+飞速上升 13.2075304714
+黄犬 13.2075304714
+姿影 13.2075304714
+木板墙 12.1089181827
+群体决策 13.900677652
+拌嘴 10.2897597393
+躬逢其盛 11.9547675029
+诗草 11.598092559
+中楼 13.2075304714
+网瘾 12.8020653633
+顾眉扬 13.2075304714
+凝冰 12.2912397395
+亚平宁半岛 11.5027823792
+互打 13.2075304714
+贾文先 13.2075304714
+引爆剂 13.900677652
+西门子 9.75754292558
+编译器 12.8020653633
+特立尼达 11.8212361103
+真武观 13.900677652
+晕头转向 10.642581114
+千岩万壑 13.2075304714
+清油 11.598092559
+巩昌 11.9547675029
+捉襟见肘 10.0505300503
+鼻炎 9.55687223012
+点收 12.1089181827
+艺妓 11.598092559
+立桂藩 11.9547675029
+红绡 11.7034530746
+课课 12.2912397395
+市工商局 11.0674643079
+东胜 9.87532596124
+动态变化 10.9049453784
+清汁 12.5143832909
+课诵 12.8020653633
+烟子 12.8020653633
+环法赛 13.900677652
+清江 9.55687223012
+春潮 11.598092559
+束花 12.8020653633
+毛峰茶 11.7034530746
+定法 12.8020653633
+红绿 10.0088573539
+红绸 9.40086798165
+跳水赛 12.8020653633
+原始思维 13.2075304714
+还须 9.01032852375
+清汤 11.0674643079
+剑刚 12.8020653633
+经邦济 11.1926274509
+石麦子 11.8212361103
+脊髓型 12.2912397395
+百寿图 13.900677652
+血液学 12.8020653633
+鸷鹰 13.2075304714
+暗记 12.2912397395
+暗访 9.89334446674
+哈利利 13.900677652
+同时并举 12.5143832909
+皮褶 11.2616203224
+言和意顺 13.2075304714
+丰镐 11.0103058941
+红红 11.1926274509
+搏动 10.0720362555
+拉不下 11.7034530746
+杀鼠药 13.900677652
+航空局 11.7034530746
+一百多年 9.71102290995
+承上启下 10.642581114
+季方 13.900677652
+十几平方米 13.2075304714
+百一方 13.2075304714
+毕业考试 11.4157710022
+南澳溪 13.2075304714
+暗话 11.8212361103
+红线 8.83808261895
+外语水平 12.8020653633
+邓艾分 12.8020653633
+必修 11.1280889297
+暗语 10.2897597393
+连音 12.8020653633
+病症状 13.2075304714
+迟到 9.26594866375
+抬价 11.3357282945
+作战科 12.1089181827
+哨位 11.9547675029
+清水 8.03420959504
+斯帕斯克 13.2075304714
+求去 12.8020653633
+溃疡病 10.8561552143
+婆子 8.3555002075
+证明书 10.8561552143
+博弈论 10.9049453784
+耳顺之年 13.900677652
+晋卿岛 12.2912397395
+塔塔尔族 11.7034530746
+发物 13.2075304714
+可逆反应 11.9547675029
+戴生昌 13.2075304714
+小半截 12.1089181827
+专书 10.765183436
+心灵史 13.900677652
+随你便 13.900677652
+秦淮河 9.34680076038
+龙舌兰 11.2616203224
+元好问 10.3453295905
+认亲 10.7226238216
+李信来 13.2075304714
+大宁河 11.3357282945
+未配对 12.1089181827
+四千一百五十四万余两 13.2075304714
+陟罚臧否 13.2075304714
+织布鸟 11.8212361103
+麻豆腐 13.900677652
+一个帖 13.900677652
+巴博萨 13.900677652
+逮捕令 12.5143832909
+伍德合金 13.900677652
+顾功叙 13.2075304714
+专为 8.46695564842
+斯贵支 11.598092559
+烟岚 12.8020653633
+蒙城 11.2616203224
+元古界 10.6818018271
+百余千米 12.8020653633
+副总编 11.5027823792
+于秋冬 13.2075304714
+侯景发 12.8020653633
+金玉 9.58318953844
+憷头 13.900677652
+甚为不解 13.2075304714
+纲领性 10.0294766411
+裕禄 11.8212361103
+互敬 13.2075304714
+一砍 12.8020653633
+慎夫人 13.2075304714
+特兰德 13.2075304714
+专业 6.19316545738
+关胜见 12.2912397395
+互救 12.8020653633
+南锡 11.2616203224
+归纳如下 12.8020653633
+供销合作 11.2616203224
+杯口 11.3357282945
+吉蔑族 13.2075304714
+屁眼 11.2616203224
+全球通 11.7034530746
+半山区 11.2616203224
+连遭 10.3743171274
+光合产物 11.5027823792
+樟柳碱 12.8020653633
+专一 9.11318590919
+课程标准 13.900677652
+刘国光 12.5143832909
+专任 10.1630080337
+清歌 11.9547675029
+土著居民 9.20932976975
+协作网 13.2075304714
+索马 12.8020653633
+科科斯 13.900677652
+玉米油 11.2616203224
+墓穴 8.53938548627
+详加 10.765183436
+互斥 12.5143832909
+函授班 13.900677652
+打家劫舍 10.3743171274
+将计就计 10.2630914922
+数颗 12.2912397395
+蒙在 10.8096351986
+掰掰 13.900677652
+上纲 13.900677652
+火伤 12.8020653633
+值日官 11.8212361103
+签名人 13.900677652
+蒙圣 11.3357282945
+瓦尔德海姆 12.5143832909
+产业群体 13.2075304714
+经营责任制 11.7034530746
+清正 10.604840786
+起痱子 13.2075304714
+三甲基氯硅烷 12.5143832909
+颈长 10.8096351986
+莫尔纳尔 13.2075304714
+贝朋 13.2075304714
+火伴 12.5143832909
+毫厘不爽 13.900677652
+米塞斯 12.2912397395
+终因 9.56994431169
+朗格 11.1926274509
+廊坊市 11.9547675029
+连邦 12.8020653633
+丢下去 12.8020653633
+替代密码 12.5143832909
+专人 8.88339781516
+底线 8.59737274392
+底纹 13.2075304714
+烟尘 9.18217878068
+大环内酯 13.2075304714
+评改 13.900677652
+季报 5.76973534974
+波普尔 11.9547675029
+前事不忘 12.2912397395
+宇文护 10.8096351986
+诸法性 13.900677652
+互无 13.900677652
+喝着 12.1089181827
+加为好友 12.8020653633
+沏茶 9.80633308975
+金文秀 12.8020653633
+删节 10.6818018271
+桂儿 10.4666904475
+艺师 12.8020653633
+婆家 9.72629038208
+航空学 12.1089181827
+俞元良 12.1089181827
+清欠 11.598092559
+彩色钢板 13.900677652
+专事 9.45802639549
+宫纱 13.900677652
+柯拜 13.2075304714
+纯麻 13.900677652
+专于 12.1089181827
+去除率 13.2075304714
+旗语 11.9547675029
+服装业 10.4666904475
+皮辊 13.900677652
+专使 10.9049453784
+历六主 13.2075304714
+五六百斤 13.2075304714
+摊鸡蛋 13.900677652
+荆南镇 13.2075304714
+瓦房 9.82314020807
+此情可待 13.2075304714
+绿林起义 11.1280889297
+翟义亦 13.900677652
+布策 12.8020653633
+举国欢腾 13.2075304714
+胡言乱语 9.80633308975
+洛克菲勒 10.1630080337
+拼法 12.2912397395
+势在必行 9.71102290995
+互相残杀 10.4349417492
+过天星 11.5027823792
+释小龙 12.8020653633
+步履蹒跚 10.9562386728
+烧毛 12.8020653633
+透射电镜 12.8020653633
+三千五百九十 13.2075304714
+东虹 13.2075304714
+符拉基 13.2075304714
+崖石 12.2912397395
+折扣价 12.5143832909
+烧毁 8.38322475551
+非本质 12.2912397395
+能书善 13.2075304714
+互搏 13.900677652
+黄台吉 13.900677652
+门户网 12.8020653633
+三太子 10.6818018271
+婆娑 10.0294766411
+一破 10.7226238216
+奥尔巴 13.2075304714
+婆娘 8.77671367257
+转换方向 13.2075304714
+铁划银 13.2075304714
+再者说 11.1926274509
+罗斯纳 13.900677652
+自动化 7.62028181302
+左利手 13.2075304714
+艺德 13.900677652
+交通路线 10.9562386728
+通气孔 11.9547675029
+终场 11.7034530746
+老铺 12.2912397395
+动力火车 13.900677652
+越养越 13.2075304714
+红砂 10.9562386728
+鸭嘴兽 10.6818018271
+瓦托 11.7034530746
+柳永 10.8561552143
+迈耶 10.604840786
+信道容量 12.8020653633
+炸烂 12.8020653633
+红砖 10.7226238216
+丰西泽 13.900677652
+营养型 11.7034530746
+颠颠簸簸 12.5143832909
+力气活 11.8212361103
+灵肉 13.2075304714
+赫尔曼德 11.8212361103
+火药桶 12.1089181827
+艺徒 12.1089181827
+灯台 10.6818018271
+食火鸡 13.900677652
+关联矩阵 13.900677652
+太过火 12.1089181827
+证明信 12.8020653633
+黄河水利委员会 11.598092559
+火上 9.69598503258
+李应领 13.2075304714
+烧死 9.12999302751
+韬奋 12.8020653633
+沙土地 11.5027823792
+陈家瑛 13.900677652
+红磷 12.1089181827
+雍邱 13.900677652
+专修 10.765183436
+漱过 12.8020653633
+宋家村 11.598092559
+汉阳造 12.8020653633
+现实主义者 11.2616203224
+不舍昼夜 12.2912397395
+卫尉主 13.2075304714
+北庭 9.91169360541
+赞礼 9.91169360541
+口粮田 13.900677652
+倾废 13.2075304714
+到场 9.25628675283
+应聘者 11.0103058941
+鲇鱼 10.3171587135
+那名参 13.900677652
+火中 10.3453295905
+慕容宝乘 12.8020653633
+刑按察 10.8096351986
+歌子 11.0674643079
+内蒙古人民出版社 12.1089181827
+加勒斯 13.2075304714
+跑步机 12.5143832909
+骄横奢侈 13.900677652
+资助金 12.5143832909
+金哲 13.2075304714
+西北缘 12.1089181827
+武得全 13.2075304714
+东蒙 12.8020653633
+多尔芬 13.2075304714
+答茬儿 13.900677652
+巴德拉 13.900677652
+长三角 8.9308643524
+南针 13.900677652
+卫尉之 13.2075304714
+麻巧正 13.900677652
+连里 10.765183436
+寄怀 13.2075304714
+血卟啉 13.2075304714
+美国电影协会 13.900677652
+空间反演 12.8020653633
+鲁钝 12.8020653633
+太仆寺旗 12.8020653633
+专供 9.12999302751
+代续修 13.2075304714
+婆媳 10.2630914922
+百事公司 12.8020653633
+育幼 11.8212361103
+斯麦 13.2075304714
+雇好 12.8020653633
+适如其分 13.900677652
+会谈纪要 11.3357282945
+奖杯 11.2616203224
+人皆有之 11.5027823792
+胸怀磊落 13.900677652
+瓦拉 10.0505300503
+陕北高原 11.2616203224
+两扇门 10.642581114
+王昂 13.900677652
+夹衫 12.5143832909
+丰邑 12.1089181827
+王景略 12.8020653633
+杯内 12.5143832909
+马丹阳 13.2075304714
+宫籍 12.8020653633
+宇文恺 10.9049453784
+终告 11.0103058941
+南靖 11.5027823792
+一百多家 12.2912397395
+亹亹不倦 13.900677652
+渥丹 13.2075304714
+歌声 8.45825994145
+南非 7.68606955355
+固定字长 13.900677652
+刘罗锅 13.900677652
+毒气弹 12.8020653633
+红筹 9.5062284973
+轻声轻气 12.2912397395
+第一零二回 13.2075304714
+答拜 11.8212361103
+求借 11.9547675029
+东欧平原 10.8561552143
+不辞辛劳 12.5143832909
+反而 6.22652473069
+嘴紧 13.900677652
+文从字顺 11.8212361103
+安宁县 12.2912397395
+尔何 12.8020653633
+收出去 13.2075304714
+杨惟中 11.4157710022
+各司其职 10.642581114
+索飞 13.900677652
+需款 13.2075304714
+互有 9.87532596124
+营养品 10.1871055853
+适应控制 11.0674643079
+肺肠 13.2075304714
+东吴大学 10.604840786
+鼻疽 13.2075304714
+流行时尚 11.7034530746
+窗牖 11.8212361103
+摔断 11.8212361103
+亚欧大陆 10.4041700905
+墓碣 13.2075304714
+龙胆紫 13.900677652
+中国证券业协会 9.71102290995
+纷歧 13.2075304714
+武烈皇帝 12.8020653633
+宗达光 12.8020653633
+要端正 13.2075304714
+便会 8.25170341381
+拌匀 10.9562386728
+墓碑 9.06439574502
+王业 11.8212361103
+丰都 12.8020653633
+红笔 11.7034530746
+好儿女 12.5143832909
+称羡 11.3357282945
+起信论 11.7034530746
+菌丝 9.89334446674
+解千愁 13.900677652
+拉上来 11.0674643079
+新开河 11.5027823792
+火上弄冰 13.900677652
+巴特斯 13.900677652
+鱼沼飞 12.8020653633
+铁路局 10.1871055853
+陈至立 12.8020653633
+打主意 10.9049453784
+玩腻 11.3357282945
+二十岁 9.04086524761
+战术学 11.3357282945
+名份 12.1089181827
+叶波一世 13.2075304714
+箕门 13.900677652
+浙江 6.04590846848
+清楚 5.64953551289
+武不武 13.900677652
+蒙唐 13.2075304714
+奚普里 13.2075304714
+出校 13.900677652
+接口界面 13.900677652
+嫖客 10.604840786
+小林觉 13.900677652
+来传旨 10.765183436
+报刊书籍 13.900677652
+人造行星 13.2075304714
+昌郡 13.2075304714
+丛竹林 13.900677652
+南韩 12.2912397395
+小天使 11.7034530746
+奥尔布 13.900677652
+南音 11.4157710022
+造型各异 13.2075304714
+婆姨 10.2897597393
+艺展 13.900677652
+绿意盎然 12.5143832909
+川原 11.7034530746
+姚苌死 12.8020653633
+嫖宿 13.2075304714
+振聋发 12.2912397395
+鼻甲 11.1280889297
+夹被 11.598092559
+胸次 13.2075304714
+匡扶汉 12.2912397395
+如图所示 10.0940151622
+红箭 11.2616203224
+宫粉 13.900677652
+阴司地府 13.2075304714
+麦酒 13.900677652
+垃圾桶 10.533381822
+万光年 11.1926274509
+苹果梨 12.1089181827
+心理过程 10.3743171274
+反能 13.2075304714
+信陵君 10.8561552143
+徐处仁 12.5143832909
+严阵划 13.2075304714
+古邓城 12.8020653633
+赌窝 13.900677652
+夹袍 11.8212361103
+反胃 10.7226238216
+左立 13.2075304714
+冥界 13.2075304714
+夹袄 10.1164880181
+男儿泪 13.2075304714
+定滑轮 12.2912397395
+莠民 12.8020653633
+二百多里 11.7034530746
+帛书 10.0940151622
+涂山氏 12.1089181827
+封庆亲王 12.8020653633
+里乌斯 11.4157710022
+犊鼻 13.900677652
+刘锡 11.5027823792
+田溯宁 13.900677652
+航路 9.4233408375
+蒸汽浴室 13.900677652
+包世臣 12.5143832909
+陶特 13.2075304714
+倾尽 11.3357282945
+吴纲 13.2075304714
+歌姬 11.7034530746
+试笔 13.2075304714
+南陈 13.900677652
+阎鸿唤 8.00903344015
+木棚顶 13.2075304714
+春心荡漾 12.8020653633
+片言只语 12.5143832909
+仰看 11.9547675029
+掌之仇 13.900677652
+歪脑筋 12.8020653633
+布票 11.2616203224
+南院 11.0103058941
+中华牌 11.2616203224
+互易 11.7034530746
+丁恩甜 12.2912397395
+张作梅 13.2075304714
+查询电话 13.2075304714
+兵无血刃 13.900677652
+南陵 11.3357282945
+想用 9.30555780184
+菌体 10.2897597393
+直选 13.2075304714
+木旋 13.900677652
+嫖娼 10.8561552143
+比较落后 9.87532596124
+恒久远 12.8020653633
+侍子留 13.2075304714
+引爆器 13.2075304714
+中国太平洋保险公司 12.8020653633
+以见一斑 13.900677652
+极其丰富 10.4994802703
+齐亚诺 11.598092559
+导航网 13.900677652
+波密 11.2616203224
+基础知识 10.2117981979
+显耀 11.598092559
+流形 10.2630914922
+丰采 11.3357282945
+四十四个 12.5143832909
+奖旗 12.2912397395
+模特 9.7898037878
+半道儿 13.900677652
+相电压 12.5143832909
+紫罗兰色 13.900677652
+豪放不羁 12.1089181827
+朱仝怒 13.2075304714
+五百四十万马克 13.900677652
+邮政局长 12.5143832909
+暗转 13.900677652
+蒙哥 9.48183704418
+劳先生 13.900677652
+无故障 11.7034530746
+巧克力糖 12.2912397395
+高发区 11.598092559
+东营 10.2630914922
+南阳 7.50374799676
+歌妓 9.93038573842
+生理需要 11.1926274509
+一鼻孔出气 11.8212361103
+嘴勤 11.9547675029
+灿烂夺目 11.4157710022
+味苦 10.3743171274
+鲁阿 13.900677652
+大别山区 10.6818018271
+摩登 10.2630914922
+南雄 10.8561552143
+帕利梅 13.2075304714
+姿容 11.3357282945
+思想性 10.1871055853
+附和 8.74738605748
+客观现实 10.7226238216
+阙楼 11.8212361103
+索饵 11.4157710022
+古有明 13.900677652
+歌女 10.2630914922
+姣好 10.6818018271
+恣情纵欲 13.900677652
+篡国 11.9547675029
+嘴刁 13.900677652
+皮质 8.87679713113
+切直 13.2075304714
+必杀技 11.2616203224
+男性疾病 12.5143832909
+切盼 12.2912397395
+浑俗和光 13.900677652
+皮货 10.765183436
+灯儿 12.5143832909
+六根清净 11.9547675029
+烹制 10.642581114
+深入基层 10.9562386728
+负鼠 11.4157710022
+名利双收 11.4157710022
+南隅 9.94943393339
+龙济光 12.5143832909
+灯光 7.32420808293
+权倾中外 13.900677652
+展飞 13.900677652
+斯鲁 12.5143832909
+绿色 6.82233607242
+鲁隐 12.8020653633
+华侨银行 11.8212361103
+维护和平 11.1926274509
+不声不气 13.2075304714
+载玻片 12.8020653633
+头孢曲松 13.2075304714
+福布斯 9.46986085313
+灾民 9.77354326693
+真切感 12.5143832909
+生趣盎然 13.900677652
+便于 7.17085358149
+故乡人 11.7034530746
+绝缘子 11.4157710022
+灯具 9.87532596124
+协作组 12.2912397395
+清样 12.8020653633
+发帖子 12.8020653633
+互为条件 11.1926274509
+姚苌病 13.900677652
+南襄 11.5027823792
+宫扇 12.1089181827
+别清浊 12.2912397395
+暗送 12.5143832909
+谈老庄 12.8020653633
+拄着 8.87023973058
+沿上 10.533381822
+印度豹 13.2075304714
+东魏 9.07236391467
+无机肥料 12.1089181827
+暗通 11.1280889297
+纯良 12.5143832909
+必听 13.900677652
+香榭丽舍 11.9547675029
+底托 13.900677652
+承蒙 10.2897597393
+卢湾区 11.9547675029
+鼻毛 11.8212361103
+艾默里 10.9049453784
+需用 9.00283785202
+海蚀柱 11.7034530746
+咒文 11.4157710022
+苏哈托 11.7034530746
+处子 11.9547675029
+柔婉 11.5027823792
+南西 10.2117981979
+浓浓的 9.66657114738
+蜃气 12.8020653633
+纯色 11.5027823792
+鲁西 9.98865464655
+赏心乐事 11.9547675029
+冷水江市 11.3357282945
+束衣甲 13.2075304714
+玉帝 9.22784881751
+聂拉木 12.2912397395
+冈比亚河 11.8212361103
+专利 7.91422564669
+司和行 13.2075304714
+暗道 8.9102450652
+详细资料 11.8212361103
+贝洛奥里藏特 11.9547675029
+提在 10.4994802703
+莫特雷 13.2075304714
+环境湿度 12.8020653633
+母大虫 11.0674643079
+韩国政府 10.8096351986
+瓦罐 9.37888907493
+闻孔明 12.5143832909
+瓦罗 12.2912397395
+互祝 13.900677652
+专列 11.3357282945
+无核国家 12.8020653633
+专刊 10.8561552143
+滑旱冰 13.900677652
+哨响 12.1089181827
+张光壁 13.900677652
+桑塔 12.1089181827
+陆宣公 12.2912397395
+莫希坎 13.2075304714
+玉带 9.49395840471
+红日 8.27305653829
+钉进 11.8212361103
+和珍 12.8020653633
+灯下 8.97342396682
+摩泽尔 13.900677652
+下课后 12.2912397395
+灯丝 11.3357282945
+折桂 11.9547675029
+火化 9.87532596124
+柔嫩 10.604840786
+海誓山盟 11.598092559
+传统意义 10.0294766411
+未用过 11.9547675029
+金属包装 12.2912397395
+红旗 8.03138073884
+统计人员 12.5143832909
+两条 6.90858122456
+雨城 12.2912397395
+闻神卜 13.2075304714
+脚丫子 11.1280889297
+子伸 13.900677652
+污损 11.7034530746
+汉军镶 12.5143832909
+甚而 10.6818018271
+甚者 11.4157710022
+打屁股 12.5143832909
+修政 13.900677652
+破亡 13.900677652
+清真 9.66657114738
+牵挂着 10.9049453784
+农产量 12.8020653633
+耐克 10.9049453784
+冤沉海底 13.2075304714
+不见不散 12.8020653633
+跳水队 11.7034530746
+称意 13.900677652
+近几日 9.91169360541
+专力 10.1630080337
+聘姑娘 13.2075304714
+人民阵线 10.4349417492
+柔媚 10.4994802703
+专利法 11.5027823792
+云翳 11.598092559
+党委办 12.8020653633
+浮游植物 10.9562386728
+斯特拉 9.94943393339
+称愿 12.5143832909
+金牌 8.71329184614
+红斑 9.43476953332
+深入开展 9.66657114738
+中景 12.1089181827
+斯莱 12.2912397395
+王亮亮 12.5143832909
+薛蟠笑 12.1089181827
+定福庄 12.2912397395
+恩特斯 13.900677652
+病人数 13.900677652
+南行 9.87532596124
+厄境 13.900677652
+特大 8.4980002701
+南街 10.1871055853
+清盘 10.7226238216
+拉特河 13.900677652
+萨那 11.2616203224
+火力 7.53592689512
+窗洞 10.533381822
+可行性研究 9.80633308975
+火功 12.8020653633
+泰富 10.2630914922
+五彩缤纷 9.71102290995
+过饱和 11.2616203224
+东驰 12.8020653633
+布条 9.93038573842
+专卖 9.12999302751
+思比 12.8020653633
+吞食鱼 13.900677652
+熏黑了 12.1089181827
+特多 11.1926274509
+吕调阳 8.97342396682
+加利福尼亚湾 11.7034530746
+连贯 9.5062284973
+余怀则 13.2075304714
+火势 9.62401153296
+连败 10.4041700905
+甚至 4.70018561605
+格林豪 12.1089181827
+专区 8.80692745117
+灶火 10.3453295905
+半山上 12.8020653633
+驳回 9.19114745066
+运输设备 9.98865464655
+政治化 11.0674643079
+泰定 10.8096351986
+巴音布 13.2075304714
+网眼 12.2912397395
+两极分化 9.35738286971
+有害物 12.1089181827
+泰宁 11.3357282945
+特好 11.8212361103
+喀喀湖 11.0103058941
+石湖居士 13.2075304714
+泰安 9.87532596124
+泻药 10.765183436
+朽坏 13.2075304714
+竭泽而鱼 13.900677652
+王嘉胤 11.8212361103
+辛胜破 12.8020653633
+申冤雪恨 13.900677652
+二十尊 12.8020653633
+外交特权 11.0674643079
+服装厂 12.1089181827
+问卷调查 9.61021821083
+一二百名 12.2912397395
+布机 11.4157710022
+遗留物 12.2912397395
+影影绰绰 9.98865464655
+加利波 11.598092559
+侯爷 11.0674643079
+高弹力 13.900677652
+评估价 10.642581114
+专司 9.75754292558
+参不透 13.900677652
+敬谢不敏 12.8020653633
+放光芒 12.1089181827
+专史 10.9562386728
+专号 11.7034530746
+筒裤 13.900677652
+雪冤 13.2075304714
+火刑 11.4157710022
+桑杏汤 12.2912397395
+灯会 10.3743171274
+杨赞画 12.2912397395
+全罗北道 13.900677652
+够尖 13.900677652
+不识时务 10.604840786
+院校体制 13.900677652
+杯中 10.3171587135
+政治史 10.9049453784
+胡庆余堂 11.5027823792
+扛出来 13.900677652
+一百万年 13.900677652
+口味淡 12.8020653633
+筒裙 12.1089181827
+清白 8.64840422393
+瓦杜兹 12.2912397395
+柏林墙 11.1926274509
+销项税额 13.900677652
+烧着 9.35738286971
+封鲁国 13.2075304714
+沉降系数 13.2075304714
+章典制 12.8020653633
+摩根 7.17444424962
+转会费 13.2075304714
+申购 5.94560337871
+麦金 13.2075304714
+铁法县 13.900677652
+暗里 10.1630080337
+轻链 13.2075304714
+赤壁之战 9.94943393339
+亚硫酸 11.3357282945
+宫掖 11.9547675029
+三万四千余吨 13.2075304714
+布林 11.0674643079
+有意无意 9.63799777493
+布列兹 12.8020653633
+新旧交接 13.900677652
+棉花价格 10.4666904475
+笼子 9.23723855786
+火剪 13.900677652
+清瘦 10.2117981979
+秋衣 13.2075304714
+特姆 13.2075304714
+徒手格斗 12.2912397395
+俄帝 13.900677652
+偶尔 7.25949548224
+埋雷 12.1089181827
+十四五个 12.5143832909
+特委 10.3453295905
+烧瓶 11.2616203224
+红杠 12.8020653633
+不知死活 10.4349417492
+玉展 12.1089181827
+潜修 12.2912397395
+烧瓦 13.2075304714
+齐善行 13.2075304714
+锭子 11.0103058941
+玉屏 11.0674643079
+禁核试 13.900677652
+花糕 12.8020653633
+红松 9.58318953844
+马来西亚人 12.8020653633
+瞿烟 12.8020653633
+推诿 9.72629038208
+安德海 12.8020653633
+渺小 9.75754292558
+浪淘沙 12.2912397395
+解纷 13.900677652
+红杏 11.2616203224
+衣裙 9.89334446674
+支部书记 9.85762638414
+平水年 11.8212361103
+连踩 13.900677652
+递水 12.2912397395
+贾珠之 12.8020653633
+尚无太子 12.8020653633
+张柔入 12.8020653633
+连踢 13.900677652
+书社 11.4157710022
+傲视群雄 11.8212361103
+朔望月 10.5684731418
+逾墙 13.900677652
+千百面 13.900677652
+国利民 13.900677652
+红木 9.32596667347
+溜之乎也 13.2075304714
+懂事 8.77671367257
+廿八 12.2912397395
+购买欲 13.2075304714
+舒适版 11.9547675029
+夏风呀 12.1089181827
+猩红 10.1871055853
+百分之三点 12.5143832909
+兰言解 13.2075304714
+说一说 9.6811699468
+孙伯益 13.2075304714
+澡盆 10.8561552143
+季节风 13.2075304714
+重质原油 12.5143832909
+寒蝉 12.8020653633
+秋四官 13.2075304714
+脑血管 9.89334446674
+敢做敢为 13.900677652
+利水渗湿 12.1089181827
+目的物 12.8020653633
+衣被 10.5684731418
+过滤网 12.8020653633
+南诏 9.58318953844
+催产素 10.8096351986
+五鬼闹判 13.2075304714
+径行 12.5143832909
+武库舰 12.5143832909
+大举进攻 9.63799777493
+三捆 12.8020653633
+红柱 10.1871055853
+鲁诗 12.5143832909
+红柳 10.1871055853
+改进型 8.48457724977
+判别式 13.2075304714
+海关监管 12.5143832909
+轻裘缓带 13.900677652
+李华英 13.900677652
+炼胶机 12.8020653633
+大锅水 13.2075304714
+无话不谈 10.4349417492
+一锅端 12.2912397395
+玉峰 9.41204128224
+比赛结果 10.9049453784
+够不够 10.3453295905
+保证系统 12.1089181827
+党守素 12.8020653633
+马孔德 12.8020653633
+连身 11.4157710022
+废旧电池 11.1280889297
+桑代克 12.1089181827
+火儿 10.8561552143
+散布开 13.900677652
+东首 11.8212361103
+真皇后 13.900677652
+红枣 9.00283785202
+提喻 13.900677652
+火光 7.63347710343
+工作电压 11.1280889297
+索萨 11.4157710022
+石马村 13.2075304714
+红枫 12.8020653633
+百平方米 13.2075304714
+人生价值 12.5143832909
+布撒 11.9547675029
+清丽 9.59661255877
+亵衣 12.5143832909
+成年 7.90921310487
+灵车 11.598092559
+暴尸 11.1926274509
+需知 11.9547675029
+鲁讯 13.2075304714
+娱宾 13.900677652
+管弦乐器 11.9547675029
+李雄死 13.2075304714
+应答器 12.2912397395
+火具 11.598092559
+垂死挣扎 10.8561552143
+试演 12.1089181827
+红果 10.604840786
+耶路撒冷 9.05649056552
+纪氏 13.900677652
+告戒 12.5143832909
+抢修车 12.1089181827
+流下来 9.15574552361
+托里亚 13.2075304714
+平安地 11.1280889297
+比金 13.2075304714
+卷铺盖 11.3357282945
+七国首脑 12.2912397395
+优游自在 13.900677652
+惊世震俗 13.900677652
+更弱 11.1926274509
+中国男队 13.900677652
+灰色收入 11.5027823792
+债款 11.0103058941
+梅莱拉 12.8020653633
+罅隙 12.5143832909
+泰始 10.3453295905
+吟诗作对 13.2075304714
+蔗香 12.1089181827
+徐爷 12.5143832909
+三十余次 13.900677652
+丰足 10.9562386728
+朔日 11.4157710022
+惯量椭球 13.900677652
+阿塞拜疆共和国 13.2075304714
+今晚报 13.2075304714
+徐爵 8.0285598625
+布敦 12.8020653633
+回教人 13.900677652
+单光子 13.900677652
+数十页 13.900677652
+百无聊赖 10.7226238216
+商站 11.598092559
+名为 7.22485443034
+泰姬 13.900677652
+张光宇 12.5143832909
+衣袋 9.58318953844
+优惠条件 10.8561552143
+皮里 11.7034530746
+曼光谱 11.598092559
+神智不清 11.0674643079
+散发传单 13.2075304714
+恶德 12.8020653633
+南极星 12.5143832909
+政局稳定 10.9562386728
+吴理真 13.2075304714
+山精树 12.8020653633
+便利 7.27395990273
+年成交额 13.2075304714
+陈璜 12.8020653633
+立耶律淳 12.2912397395
+性保健 13.900677652
+提向 13.900677652
+三十余步 13.900677652
+连载 10.642581114
+人手不足 12.5143832909
+严敦杰 11.7034530746
+蒋校长 13.900677652
+连轴 12.2912397395
+陕西人民出版社 13.2075304714
+文本处理 12.2912397395
+摔碎 10.1394775363
+鼻梁 9.20019728618
+随物赋形 12.8020653633
+布政 12.5143832909
+布放 11.598092559
+叹老嗟卑 13.900677652
+红星 9.05649056552
+知疼着痒 13.900677652
+连轧 11.598092559
+经营业 11.1926274509
+条条框框 10.9562386728
+玉川 12.5143832909
+艳服 12.8020653633
+免疫系统 9.36807815882
+寄意 12.5143832909
+印泥 11.0103058941
+嘴上 8.74738605748
+红曲 12.5143832909
+东风 7.74581955796
+衰世 12.1089181827
+火候 9.62401153296
+皮卡丘 13.900677652
+档案文件 12.2912397395
+得莫利 13.2075304714
+天地英雄 13.900677652
+景公死 13.2075304714
+直言进谏 11.598092559
+赵红梅 11.0674643079
+大专班 13.900677652
+渔业资源 9.75754292558
+牙釉质 11.9547675029
+京骨 13.900677652
+特定 6.80147590842
+闽省 12.5143832909
+庄文皇后 11.8212361103
+宫卫尉 12.5143832909
+嘴严 13.900677652
+玉工 12.8020653633
+称扬 11.0103058941
+东方明珠 10.2630914922
+增加一倍 9.65218240993
+连远 13.900677652
+连连 7.34959731693
+嘴乖 13.2075304714
+计穷力尽 13.900677652
+鼻根 11.5027823792
+清理 7.53420720424
+麻衣相 12.5143832909
+特对 12.8020653633
+布料 9.84023464143
+搜索算法 13.900677652
+一万三千五百一十七 13.2075304714
+严阵会 11.8212361103
+抬回 10.5684731418
+负荆 11.5027823792
+察尔汗盐湖 10.9562386728
+堵起 13.900677652
+艾力达 13.900677652
+过眼云烟 11.9547675029
+阿拉山口 11.1926274509
+周原 10.1394775363
+布斯 10.8096351986
+复合肥料 11.4157710022
+负荷 8.77671367257
+宋天禧 12.2912397395
+风霜雨雪 11.2616203224
+丰赡 12.8020653633
+鸢尾科 11.9547675029
+刘二人 12.5143832909
+布施 9.89334446674
+维苏威 10.765183436
+不得体 11.1280889297
+有性杂交 12.8020653633
+莱特湾 12.2912397395
+高大威武 12.5143832909
+智力年龄 13.2075304714
+窗栏 12.8020653633
+暴沸 13.900677652
+边经略 13.2075304714
+禄宏仁 13.2075304714
+挽起 9.75754292558
+犟劲 12.5143832909
+孟称舜 12.5143832909
+布托 11.5027823792
+补下去 13.900677652
+特尼 13.2075304714
+尊老敬老 13.900677652
+奚军 11.0674643079
+白浮村 13.2075304714
+密西西比州 11.8212361103
+艾赛尼 13.900677652
+小市民 10.2371160058
+抄录下来 11.8212361103
+一百根 13.2075304714
+提单 11.0674643079
+布扣 12.8020653633
+上万次 13.900677652
+鲁赫 11.9547675029
+特将 13.2075304714
+污染 7.23117956212
+党政 9.66657114738
+资金紧张 9.85762638414
+提升 5.57126086804
+提前结束 10.1630080337
+窗格 11.5027823792
+特尔 10.7226238216
+到京 10.1630080337
+宋襄公 11.1926274509
+窗框 11.0103058941
+组织变形 13.900677652
+离情 11.7034530746
+终丝 13.2075304714
+停火协定 13.900677652
+体天格物 13.900677652
+对接口 12.5143832909
+令人瞠目 11.3357282945
+当地化 13.900677652
+自唱 13.2075304714
+古尔奈 12.2912397395
+反驳 8.39128931535
+奖给 10.9049453784
+盅子 13.900677652
+南货 13.900677652
+峡山 12.2912397395
+宫体诗 11.8212361103
+沈克非 13.2075304714
+泰康 10.765183436
+到任 9.21854642485
+清风两袖 13.900677652
+先照 13.2075304714
+开发技术 12.8020653633
+弃如敝屣 13.900677652
+解盐钞 13.2075304714
+提包 9.28555713513
+连衡 12.8020653633
+连衣 11.8212361103
+特展 12.8020653633
+谭鑫培 10.4994802703
+品牌效应 10.604840786
+布拉 9.4233408375
+按摩室 13.900677652
+混下来 13.2075304714
+火圈 11.9547675029
+深水稻 13.900677652
+施术者 12.5143832909
+禄位 11.1280889297
+灌夫骂座 13.900677652
+山丘陵 8.36728816325
+辛比尔 12.5143832909
+把握性 13.900677652
+凯恩斯主义 10.1630080337
+花精 13.900677652
+布拖 13.2075304714
+蒙众 12.5143832909
+山西省忻州地区 12.5143832909
+踏看 11.8212361103
+郝祯 13.2075304714
+提取 7.49544919394
+南路 8.74738605748
+王口温 13.2075304714
+黑云岭 10.8561552143
+真武阁 11.5027823792
+树结构 13.900677652
+新旧交替 12.1089181827
+火场 11.5027823792
+雷约 13.2075304714
+务期 11.5027823792
+托博尔 13.900677652
+促进改革 12.8020653633
+参差不齐 9.85762638414
+窗棂 9.69598503258
+蒙住 9.75754292558
+提去 12.2912397395
+围岩 10.0505300503
+南越 9.48183704418
+皮陆 12.8020653633
+疆域 8.20694551317
+五六百米 12.8020653633
+火坑 10.0940151622
+泰币 13.900677652
+终于 5.36682401967
+曾孙子 13.900677652
+库居积 13.2075304714
+磁悬浮列车 12.5143832909
+终了 10.2630914922
+大园乡 12.2912397395
+连裆 12.5143832909
+摩洛 11.1926274509
+邳县 10.9562386728
+晤谈 11.9547675029
+溶菌素 13.900677652
+千百里 12.8020653633
+装卸货物 11.0674643079
+生死牌 13.900677652
+无为之治 12.8020653633
+管齐射 13.900677652
+袁开缺 13.2075304714
+窗棱 12.8020653633
+纺纱工 12.8020653633
+杀气腾腾 10.3171587135
+底板 10.0088573539
+皮鞋 8.29120585679
+暗锁 13.900677652
+课长 11.9547675029
+临清市 12.1089181827
+玛格丽塔 12.2912397395
+磨合期 11.8212361103
+刘自豫 13.2075304714
+沈容圃 13.2075304714
+倩倩 11.8212361103
+责人 12.8020653633
+高歌一曲 12.8020653633
+挂羊头 12.5143832909
+贾大人 12.2912397395
+索菲 12.5143832909
+木料 8.94485059437
+浅井 11.598092559
+东鹏 11.5027823792
+物理性能 11.3357282945
+中华日报 13.900677652
+穿小鞋 11.8212361103
+周达明 12.8020653633
+教育工作者 11.5027823792
+洛杉矶国际机场 13.900677652
+终使 12.1089181827
+宫来 10.8561552143
+无病呻吟 11.8212361103
+作战服 12.8020653633
+服装城 13.900677652
+吴老大 11.9547675029
+九台市 12.8020653633
+大公国 10.604840786
+享年 10.5684731418
+局限于 8.59240995457
+烈火金钢 12.2912397395
+清士子 13.900677652
+终会 10.6818018271
+专场 9.65218240993
+提到 6.61791647237
+蒙今 12.5143832909
+提制 10.642581114
+必先 9.74179456862
+布依弹 13.2075304714
+连襟 12.8020653633
+翻下来 12.8020653633
+宫服 12.8020653633
+柔弱 9.75754292558
+责任 6.04823856662
+底本 10.0294766411
+专在 10.604840786
+陈家沟 12.1089181827
+唐僧西 13.2075304714
+吴人易 13.2075304714
+穆斯杯 12.5143832909
+不得不 6.06707742831
+遗臭万年 11.4157710022
+窗楣 13.900677652
+泰德 12.1089181827
+千百遍 11.9547675029
+想瘦 13.900677652
+便后 11.8212361103
+便名 13.2075304714
+曾置行 12.5143832909
+若遇明 13.2075304714
+第三十七章 10.9562386728
+耘地 13.900677652
+阿里斯 13.2075304714
+照办不误 13.900677652
+冬园 13.900677652
+到会 10.0505300503
+干什么 6.77700486677
+垃圾猪 13.900677652
+烧杀抢掠 10.8096351986
+浅丘 11.1280889297
+厄尔 10.7226238216
+拦河坝 11.1280889297
+福藩告 13.2075304714
+瓦窑 11.5027823792
+穆斯林 7.30080715276
+赈灾 10.2630914922
+修明 11.0103058941
+蝉儿 11.8212361103
+过后燕 13.2075304714
+营养体 10.8561552143
+藏珍堂 13.2075304714
+人民调解 12.1089181827
+宫柳 12.8020653633
+认真总结 9.98865464655
+一盎司 11.9547675029
+护卫队 10.9562386728
+有豪士 13.900677652
+想定 11.1926274509
+玉官 12.8020653633
+陕西 6.34268269344
+艾兰湖 12.2912397395
+玉宝 11.5027823792
+东麓 8.69119149913
+特差 10.4994802703
+浙省 12.8020653633
+曹哥 10.2371160058
+定额管理 13.2075304714
+特工 9.77354326693
+哨兵 8.6803218269
+模棱 13.2075304714
+连觉 11.7034530746
+描写出来 13.2075304714
+切沃 12.8020653633
+不得了 8.10158499752
+攀高 9.84023464143
+泰式 12.5143832909
+玉宇 12.2912397395
+到位 7.40995411747
+玉容 11.7034530746
+皮革 7.73525979774
+耻笑 9.66657114738
+沿海地带 10.0088573539
+类菌体 13.900677652
+沃斯托 13.2075304714
+皮面 11.3357282945
+火器 8.18036587537
+布控 12.2912397395
+岳阳市 11.1926274509
+海南省旅游局 13.2075304714
+帆板 12.5143832909
+清爽 8.85082164473
+盖骨 10.9049453784
+玉宫 13.2075304714
+空椅 12.5143832909
+汇报提纲 13.2075304714
+恐怖活动 10.604840786
+司宾 12.8020653633
+杨寅秋 12.8020653633
+皮靴 9.53122979951
+高良姜 12.8020653633
+向河心 12.8020653633
+花籽 12.5143832909
+宋文治 13.900677652
+喷洒在 12.1089181827
+党世雄 11.9547675029
+烧烧 12.5143832909
+剑侠 12.5143832909
+筒车 12.5143832909
+烧烤 9.98865464655
+白堤路 12.5143832909
+授权量 11.9547675029
+黄脸婆 11.8212361103
+烧热 11.0674643079
+化妆间 11.7034530746
+布恩 12.2912397395
+专员 8.98069672615
+夏多布 11.9547675029
+商讨对策 12.1089181827
+伯班克 11.7034530746
+品牌设计 13.900677652
+篡位 10.1630080337
+龙吟 11.4157710022
+武松打虎 11.8212361103
+万瓶 12.5143832909
+呼图壁 12.1089181827
+体育锻炼 9.6811699468
+铅中毒 11.4157710022
+上海图书馆 11.5027823792
+夹道 9.72629038208
+死读书 12.5143832909
+李宇明 10.9049453784
+抬升 8.13235665618
+知疼着热 13.2075304714
+电话局 11.9547675029
+米诺 12.8020653633
+烧炼 11.1280889297
+鲍桑尼 12.1089181827
+党世隆 12.8020653633
+烧点 11.3357282945
+耪地 13.2075304714
+布思 11.9547675029
+沙放洋 13.2075304714
+烧炭 10.0720362555
+玉堂 10.9562386728
+殒落 13.2075304714
+郁然 12.5143832909
+鼻涕 8.83808261895
+和光荣 11.8212361103
+站着不动 10.604840786
+专向 12.5143832909
+五年制 12.5143832909
+知冷知热 12.8020653633
+吉礼指 12.5143832909
+时代特点 11.7034530746
+老长 10.9049453784
+专名 10.9562386728
+引起轰动 10.3171587135
+国际机场 8.06294720481
+张洛行 13.2075304714
+三寸舌 12.8020653633
+芜湖 8.7245279194
+子串 10.3171587135
+贞节牌坊 11.7034530746
+鲁迅 8.20023407859
+南迁 8.6966709649
+烧灰 13.2075304714
+赞成 7.74369866639
+突出主题 12.8020653633
+烧灼 10.2897597393
+德高望重 9.72629038208
+第二十回 11.7034530746
+多弹头 11.0674643079
+黑种人 11.1926274509
+南运 10.2630914922
+玉壁 11.598092559
+烧火 9.16447920358
+霍布豪 11.9547675029
+小半碗 12.2912397395
+卡诺 10.1871055853
+一块 5.74675251997
+玉声 13.2075304714
+鲁迪 13.2075304714
+玉壶 11.3357282945
+汛前 12.2912397395
+鲁迷 12.5143832909
+朗爽 13.2075304714
+绿叶成荫 13.900677652
+反题 13.900677652
+玉墙 11.8212361103
+刘明源 13.2075304714
+商业秘密 10.8561552143
+杨诚依然 13.2075304714
+于祠庙 13.900677652
+正思 11.5027823792
+泰尔 10.9049453784
+工字形 11.9547675029
+春意 10.3453295905
+盥洗室 11.9547675029
+索耶 12.8020653633
+徐玑 13.900677652
+数据保护 13.2075304714
+见诸报端 11.2616203224
+圣卡洛斯港 13.2075304714
+加热输送 13.2075304714
+集市贸易 10.8561552143
+唱点 13.900677652
+昌城 13.2075304714
+廖冰兄 12.2912397395
+红掌 13.900677652
+丰原市 13.2075304714
+收益分配 9.63799777493
+赞扬 8.74162235276
+铝厂 10.4349417492
+南辰 11.9547675029
+南达 9.62401153296
+麦克莱兰 12.8020653633
+和庆金 11.7034530746
+栽培法 12.5143832909
+南边 8.25877058104
+鲁达 9.54396882529
+人民教育出版社 12.5143832909
+宽容一点 12.8020653633
+非古典 13.900677652
+申新各 13.900677652
+中央警官 13.900677652
+泰州 9.56994431169
+底数 11.1280889297
+数据共享 12.8020653633
+特强 11.7034530746
+实际上 5.48175902983
+便器 13.900677652
+王国华 11.4157710022
+克耳斯 12.8020653633
+腺苷 10.604840786
+疆吏 11.598092559
+清热 8.53938548627
+上万株 12.8020653633
+美国新闻署 13.2075304714
+东华门 9.26594866375
+胖女人 10.9049453784
+特异 9.20932976975
+拼盘 11.5027823792
+柏林市 12.5143832909
+吸过 11.598092559
+供销合同 13.900677652
+唐再丰 13.2075304714
+三防训练 13.900677652
+陈爱莲 12.5143832909
+迟于 11.8212361103
+提倡 7.39938798144
+马神庙 13.900677652
+六十余艘 13.2075304714
+哨口 11.8212361103
+报国寺 11.9547675029
+中板 11.0103058941
+重楼 12.8020653633
+北京经济技术开发区 12.8020653633
+煞有其事 12.2912397395
+烧熔 13.900677652
+广平府 12.8020653633
+烧熟 11.7034530746
+拉不动 11.1280889297
+丁丁东 13.900677652
+数十颗 12.8020653633
+山精水 13.2075304714
+红红绿绿的 11.3357282945
+清点 9.49395840471
+舍生取义 12.5143832909
+常式 13.900677652
+航天遥感 12.2912397395
+享尽 10.765183436
+曾奉诏 12.8020653633
+社会存在 10.1394775363
+打出手 11.9547675029
+奴才相 13.900677652
+测量 6.83934328507
+特莫尔 13.900677652
+印度语 11.9547675029
+阿克茹 13.900677652
+烧煤 11.7034530746
+初产妇 12.8020653633
+徐大夫 12.5143832909
+烧煮 11.598092559
+富安 11.1280889297
+特徵 13.900677652
+男女平等 10.604840786
+季秋 13.900677652
+喝水 8.59737274392
+生动有趣 11.7034530746
+红拂 11.4157710022
+特征 5.70561996108
+答答 12.8020653633
+反馈 8.28754954559
+余怀和 11.1280889297
+邸宅 11.4157710022
+卜子村 12.8020653633
+必去 11.2616203224
+陈家湾 11.2616203224
+清灵 12.5143832909
+格洛斯特郡 12.8020653633
+俊彦 11.3357282945
+严纲 13.900677652
+遗传物质 9.89334446674
+特快 11.3357282945
+走亲访友 12.2912397395
+鼻水 13.900677652
+河浜 12.8020653633
+纪传体 9.46986085313
+富国强兵 10.1164880181
+合肥人 11.7034530746
+烧焦 10.0505300503
+进进出出 9.84023464143
+连词 13.2075304714
+申谢 13.2075304714
+郎咸芬 13.900677652
+哨卡 12.2912397395
+生涯规划 12.5143832909
+不顾一切 8.80081122415
+连读 12.5143832909
+底料 13.2075304714
+递出来 12.5143832909
+王惠民 13.900677652
+勤奋工作 11.7034530746
+连说 9.44633035572
+发射功率 11.9547675029
+阳性细胞 13.900677652
+黄炳 12.5143832909
+金熙 10.4666904475
+不瞅不睬 13.900677652
+倍速 13.2075304714
+称是 9.91169360541
+驶抵 10.8096351986
+泰勒 8.98069672615
+新西兰政府 12.8020653633
+以货易货 11.9547675029
+兰奇 13.900677652
+助学金 11.0674643079
+删除 7.68807155622
+必将 7.3859649611
+鉴真 10.9049453784
+表现型 12.8020653633
+闽粤 10.4349417492
+下划 13.2075304714
+红海 8.74738605748
+赫尔瓦 13.900677652
+檀道鸾 12.8020653633
+喝掉 11.7034530746
+钢浇铁铸 13.2075304714
+饷客 12.8020653633
+巩留 11.8212361103
+转换开关 11.8212361103
+烧结 9.93038573842
+奥林波斯山 12.5143832909
+邬国舅 12.8020653633
+玉器 8.3555002075
+歌仔 12.5143832909
+污毒 13.900677652
+滋水 9.38981814546
+阳春白雪 11.2616203224
+奖状 10.1394775363
+一点一点把 13.900677652
+臑俞 12.8020653633
+落雁 11.7034530746
+张氏家族 13.900677652
+软钉子 12.8020653633
+连营 11.0103058941
+邳彤 13.2075304714
+廖世承 13.900677652
+经合组织 11.1926274509
+债息 11.9547675029
+凤阁龙楼 12.8020653633
+烧纸 9.93038573842
+北市 12.8020653633
+模数 11.1280889297
+执笔 9.72629038208
+发报员 12.1089181827
+公开选拔 12.1089181827
+巴卡尔 13.900677652
+接回 9.93038573842
+马头琴 11.3357282945
+上万条 12.5143832909
+袁督师 12.2912397395
+黄绍芬 13.2075304714
+海勒水 13.2075304714
+航空信 13.2075304714
+泰加 13.2075304714
+认真落实 9.82314020807
+越出 10.5684731418
+老亨特 12.8020653633
+南极洲 9.17328983326
+响地 13.2075304714
+连蒙 12.1089181827
+争取时间 10.642581114
+前赴后继 11.3357282945
+赋闲在家 12.1089181827
+九台县 13.900677652
+四五辆 13.900677652
+表明态度 11.3357282945
+横七竖八 9.84023464143
+同枕共眠 11.9547675029
+沟沟壑壑 12.8020653633
+上万枚 13.900677652
+享受 6.41630900869
+管窥蠡测 12.5143832909
+一桶桶 12.1089181827
+春江花月夜 11.2616203224
+劳工神圣 13.900677652
+蒙托邦 12.8020653633
+相互交织 10.9562386728
+打紧 11.0674643079
+季直 11.598092559
+青莲 11.7034530746
+非打不可 12.2912397395
+布满 8.21031819765
+一九九二年 13.2075304714
+慌慌张张 9.44633035572
+南自 11.3357282945
+提心 13.900677652
+南至 8.34384959028
+斯诺 10.9562386728
+歌乐 12.2912397395
+唯命是从 13.2075304714
+换算表 13.900677652
+浙江省图书馆 13.900677652
+席地 11.1280889297
+熊猫电子集团 13.900677652
+掺和 9.85762638414
+红润 8.98069672615
+文谕院 11.2616203224
+李伏 13.2075304714
+正回购 9.01032852375
+奖牌 10.1630080337
+马康南 13.900677652
+不共戴天 9.80633308975
+小肥羊 11.7034530746
+六道菜 13.900677652
+纯平 13.2075304714
+浅莫测 13.2075304714
+外交邮袋 12.8020653633
+不着痕迹 11.8212361103
+禁止停车 12.5143832909
+课题 7.78921031247
+钉螺 11.5027823792
+皮马 13.900677652
+提得 10.0088573539
+功败垂成 11.0103058941
+妇幼卫生 12.8020653633
+成玄英 11.9547675029
+面面厮觑 12.5143832909
+闽籍 12.8020653633
+清缴 11.1280889297
+泰利 12.5143832909
+展宏图 12.5143832909
+提干 11.9547675029
+听不进 10.8561552143
+奔赴前线 12.8020653633
+弓一箭 12.5143832909
+推重比 11.1926274509
+阿尔伯达 12.5143832909
+索迪 11.598092559
+胜于蓝 13.900677652
+南联 12.1089181827
+波利维亚 13.900677652
+鲁聘 13.2075304714
+申说 11.9547675029
+反霸 11.5027823792
+义大利 13.900677652
+底止 12.2912397395
+片麻岩 9.20932976975
+申诫 13.2075304714
+一锅煮 12.1089181827
+希腊语 9.36807815882
+两秒钟 11.4157710022
+别具特色 10.9562386728
+大声疾呼 10.4349417492
+尼茨基 11.2616203224
+罗卓英 11.7034530746
+地球体 13.2075304714
+政治学 8.71889410168
+烛泪 12.1089181827
+索还 13.900677652
+赖伊 12.5143832909
+藏羚 10.7226238216
+圣克拉拉 11.9547675029
+一片冰心 13.900677652
+遗踪 13.900677652
+擦脂抹粉 13.900677652
+攀附 10.604840786
+反面 9.18217878068
+磕个头 10.6818018271
+赛珍珠 12.5143832909
+安纳巴 12.1089181827
+王催马 13.900677652
+昔阳县 12.2912397395
+西贝柳斯 11.8212361103
+咿咿呀呀 10.8561552143
+和内廷 12.2912397395
+特兰 10.4666904475
+高气压 11.1280889297
+处士 10.765183436
+特克 11.598092559
+电话卡 12.8020653633
+附在 9.54396882529
+柔化 12.2912397395
+归幽州 13.2075304714
+替死鬼 10.5684731418
+答疑 10.1164880181
+涪城 11.2616203224
+苦苦哀求 10.533381822
+玉圭 12.2912397395
+丁丑年 13.900677652
+修造厂 11.4157710022
+巢城 12.1089181827
+两千五百文 13.2075304714
+红泥 12.1089181827
+天府之国 10.9562386728
+达里奥 12.8020653633
+数据文件 11.1280889297
+答谢辞 13.900677652
+资格赛 11.5027823792
+便壶 13.900677652
+天昏地暗 10.4666904475
+承购 12.1089181827
+蔡依林 12.1089181827
+便士 9.25628675283
+查不到 11.8212361103
+以口问心 13.2075304714
+绞杀 11.1926274509
+欠账 10.642581114
+泰华 11.8212361103
+玻色子 10.6818018271
+暗香 11.1926274509
+昏死过去 11.0674643079
+分歧点 12.5143832909
+南胡 13.900677652
+认真吸取 13.2075304714
+黄眉 12.2912397395
+特内 13.2075304714
+特写 9.91169360541
+在水中央 12.8020653633
+鲁能 10.6818018271
+宜宾市 11.3357282945
+心慌慌 13.2075304714
+鲁肃 9.36807815882
+股票代码 8.76487921493
+充分证明 10.7226238216
+泰北 13.900677652
+时事社 13.900677652
+盟誓 10.1164880181
+玉垒 12.8020653633
+一日千里 12.1089181827
+专家 5.60188925753
+索姆河 10.8561552143
+角套 13.900677652
+红河 9.69598503258
+了然于胸 11.8212361103
+专宠 11.598092559
+红油 11.5027823792
+类动物 9.93038573842
+风险系数 11.2616203224
+俊儿 13.900677652
+张博泉 12.2912397395
+不胜唏嘘 12.8020653633
+政治家 7.63727938938
+歌伎 11.7034530746
+游回去 12.8020653633
+笨笨 11.8212361103
+特准 11.7034530746
+外形尺寸 11.0674643079
+中共浙江省委 12.8020653633
+明叔指 13.2075304714
+瓦盆 10.765183436
+噶举派 10.7226238216
+誓死不渝 13.900677652
+设计部 13.2075304714
+京都 7.6701962044
+歌会 12.5143832909
+聚会所 13.900677652
+特利 12.2912397395
+特别 4.74775455087
+耸肩 11.5027823792
+周老爷 13.2075304714
+红潮 10.765183436
+皮领 13.900677652
+百二十二厘米 13.2075304714
+图布人 13.2075304714
+游北园 13.900677652
+发帖人 11.1926274509
+陆阿果 12.1089181827
+川妹子 12.8020653633
+债户 11.8212361103
+哈萨克斯坦共和国 11.8212361103
+被申请人 11.5027823792
+帘幕 11.4157710022
+挖山 11.9547675029
+特刊 11.0674643079
+二色性 12.8020653633
+门下 7.88941047757
+南药 11.8212361103
+乱点鸳鸯谱 12.8020653633
+雇人 9.94943393339
+辛虎 13.2075304714
+不大可能 9.45802639549
+切换 7.80260336981
+投机者 9.56994431169
+心脑血管 10.2630914922
+缓步而行 11.9547675029
+三十余所 13.2075304714
+鲸蜡 13.2075304714
+布氏 11.9547675029
+小本经营 11.5027823792
+倩影 11.0103058941
+帘布 12.8020653633
+契合点 12.2912397395
+盖洛 12.5143832909
+青艺 13.900677652
+保加尔 11.9547675029
+库泰尼 12.1089181827
+明尼苏达 10.3743171274
+银牌奖 13.2075304714
+标贴 12.2912397395
+特赦权 13.2075304714
+鲁茨 11.9547675029
+加勒特 13.2075304714
+吕础 11.598092559
+和光轴 13.900677652
+一百单八将 12.8020653633
+华航运 11.5027823792
+宿铁 12.8020653633
+哥特 10.4349417492
+介电损耗 12.5143832909
+校党委 12.2912397395
+滚动式 12.1089181827
+宫格 13.900677652
+灾祸 9.16447920358
+角头 12.5143832909
+邳州 11.598092559
+一万四千二百四十三户 13.2075304714
+特务 7.62780064543
+张际春 13.2075304714
+更何况 8.34771806705
+洛本古 12.5143832909
+抬得 11.0674643079
+耸耸 11.3357282945
+乃东县 12.1089181827
+人丁兴旺 11.2616203224
+模架 12.5143832909
+安全漏洞 11.8212361103
+必应 11.5027823792
+东里 11.3357282945
+纺纱厂 10.4994802703
+鲁菜 11.7034530746
+火大 12.5143832909
+集水区 11.2616203224
+汗褂儿 13.2075304714
+欺软怕硬 12.1089181827
+雇主 9.20932976975
+王国建 13.2075304714
+高转速 11.598092559
+流光 10.604840786
+特力 12.1089181827
+挖坑道 13.900677652
+火头 10.4666904475
+预科班 13.2075304714
+纣王 10.1394775363
+玉哥 12.5143832909
+雇个 11.8212361103
+贾琼 12.8020653633
+马洛卡 13.900677652
+小半瓶 12.5143832909
+台之子 12.5143832909
+苏呼米 13.900677652
+刘渊趁 13.2075304714
+慰抚 11.7034530746
+消防工作 12.8020653633
+辐射功率 11.8212361103
+便宴 11.7034530746
+特勤 11.0674643079
+弹力丝 13.900677652
+阴极极化 13.900677652
+帆桁 13.900677652
+丛煨 12.5143832909
+切掉 10.6818018271
+重点部位 11.598092559
+斯太尔 13.2075304714
+便宜 6.95852094628
+穿插在 12.8020653633
+过云雨 12.8020653633
+和妍子 12.8020653633
+一百多位 11.8212361103
+吴健雄 11.2616203224
+两月 9.33632946051
+十床 12.5143832909
+十二万余两 12.8020653633
+特勒 10.5684731418
+鲁莽 9.71102290995
+玩转 11.2616203224
+底楼 11.8212361103
+东道 9.91169360541
+白立忱 13.900677652
+锭剂 13.900677652
+难熔 10.8561552143
+反键 12.1089181827
+集大成 11.0674643079
+王弼集 12.8020653633
+特区 9.07236391467
+火墙 11.0103058941
+明叔拖 13.2075304714
+曾家府 13.900677652
+林科院 12.8020653633
+附图 10.7226238216
+驳岸 12.5143832909
+反锁 10.604840786
+高速铁路 9.71102290995
+卷须 10.9049453784
+沉淀聚合 13.2075304714
+博学多才 10.0940151622
+摩拉 12.8020653633
+白大褂 10.3453295905
+成服 12.1089181827
+柔光 13.2075304714
+鲁艺 12.2912397395
+互助县 12.5143832909
+宫楼 13.2075304714
+量身定做 10.604840786
+切成 9.25628675283
+万平方 11.598092559
+计将安出 11.1926274509
+上静静 13.2075304714
+布洛 12.2912397395
+异重流 13.2075304714
+标调 12.8020653633
+政治处 10.8561552143
+达鲁 12.8020653633
+布洒 11.598092559
+韦贝尔 13.900677652
+广丰县 13.900677652
+厄勒 11.8212361103
+逢人 10.9562386728
+倾慕 10.533381822
+马文彪 13.2075304714
+索超 9.45802639549
+细胞组织 11.0103058941
+预借 13.2075304714
+贫困户 10.765183436
+南航 7.51379833261
+阿伦尼 10.8561552143
+米塞特 13.2075304714
+杜兴道 11.8212361103
+受训者 13.900677652
+窗板 13.2075304714
+奋力拼搏 12.5143832909
+南船 12.8020653633
+特卖 11.9547675029
+一百多两 13.2075304714
+工缴费 13.900677652
+火堆 9.19114745066
+没上没下 12.1089181827
+白沫子 13.900677652
+十几盏 13.2075304714
+鲁苏 12.1089181827
+解缆 13.2075304714
+宫槐 13.2075304714
+顽意儿 11.0674643079
+理科生 11.8212361103
+南苑 9.82314020807
+真除 13.900677652
+古元真 13.900677652
+泰克 11.9547675029
+必得 9.25628675283
+鼻息 10.2371160058
+第根 13.2075304714
+切拉 13.900677652
+攀钢 10.7226238216
+摩托 9.45802639549
+一百多万 10.9049453784
+五金产品 13.900677652
+泰兴 10.9049453784
+分析攻击 13.900677652
+东都 9.87532596124
+民办教育 11.7034530746
+解缙 11.0103058941
+把持不定 13.900677652
+索赔 8.83808261895
+鸡翅膀 12.2912397395
+东郡 10.4041700905
+水蜜丸 11.7034530746
+留根 12.1089181827
+东部 5.95583094097
+索贤 12.8020653633
+谒陵 12.8020653633
+承载 8.9308643524
+赌球 9.06439574502
+施特拉斯堡 12.8020653633
+硬说是 12.1089181827
+马路上 8.94485059437
+反问 8.52539924429
+笼养 12.5143832909
+文臣武将 10.2897597393
+胡你刚 12.8020653633
+反间 11.0674643079
+承转 13.2075304714
+奎达 13.2075304714
+空军航空兵 13.900677652
+一约 13.900677652
+索贿 10.9562386728
+缪尔波 13.2075304714
+严肃查处 10.4994802703
+吉平 11.5027823792
+汉汉初 13.2075304714
+马文忠 11.4157710022
+稷下 10.765183436
+鲁芬 13.900677652
+流感疫苗 8.82550383674
+吴主孙 10.765183436
+鲁花 10.8096351986
+特变 10.0294766411
+雇佣 8.86372504956
+商检部门 13.900677652
+舂米 11.0103058941
+特发 10.8561552143
+棕黄 10.9049453784
+朝仪 10.2897597393
+东邪 13.900677652
+普通职工 12.2912397395
+东方之珠 13.2075304714
+红楠 12.1089181827
+败类 9.89334446674
+玉剑 13.2075304714
+里比多 12.2912397395
+七夜 11.3357282945
+伊巴河 12.5143832909
+汴梁 9.4233408375
+承袭 8.92394390956
+姜子牙 11.0103058941
+紫宸殿 11.8212361103
+红楼 10.4994802703
+气锁 13.2075304714
+互用 11.8212361103
+张国华 13.2075304714
+汗巾 10.3453295905
+提子 13.900677652
+城市职能 12.1089181827
+提存 12.1089181827
+互生 8.88339781516
+周昂二 12.8020653633
+泰国 7.52395070408
+抬头 6.64085804161
+默顿 11.5027823792
+东面 8.42003872863
+贷方 11.7034530746
+韦执谊 11.9547675029
+特向 11.5027823792
+魂不着体 13.900677652
+于同频 13.900677652
+现钱交易 13.2075304714
+心神不定 10.2897597393
+节略 11.2616203224
+哨声 11.3357282945
+晚稻 11.0103058941
+皮黄 12.8020653633
+台北盆地 11.1926274509
+候教 13.900677652
+特命 9.93038573842
+心神不安 11.0674643079
+艺人 8.00903344015
+清算 8.30225569298
+半截子 10.8096351986
+心神不宁 10.0940151622
+杂种优势 10.9049453784
+阿里河 12.8020653633
+纸作 13.900677652
+烧窑 10.4041700905
+艺事 12.8020653633
+呛鼻 12.8020653633
+蝉声 12.2912397395
+玉制 12.1089181827
+服装店 10.533381822
+齐联军 12.8020653633
+中等专业 10.2117981979
+红椒 12.8020653633
+祛风胜湿 12.8020653633
+煤仓 12.5143832909
+紫椴 11.1280889297
+北京电影学院 11.1926274509
+笼嘴 12.2912397395
+落霞 11.3357282945
+通贯书 12.8020653633
+阿里汗 12.8020653633
+七大 8.75318317516
+下年 11.8212361103
+热情奔放 11.0674643079
+标识 9.16447920358
+承乾官 12.5143832909
+一锤定音 11.0674643079
+祖道 12.2912397395
+回锅肉 12.8020653633
+多诺万 13.2075304714
+阿里汉 13.900677652
+花木扶疏 11.8212361103
+倾侧 12.2912397395
+切时 13.2075304714
+一组 7.7083151625
+真诚地 9.85762638414
+故我在 13.900677652
+鲁藩 13.2075304714
+陆煌 13.2075304714
+寸土必争 11.9547675029
+帅才 12.1089181827
+一横 9.65218240993
+标语 8.81927328699
+帕尔尼 13.2075304714
+故城县 13.900677652
+用心用意 13.2075304714
+燕青奏 13.2075304714
+连胜 10.765183436
+以身殉职 12.1089181827
+谢过恩 13.2075304714
+枯木逢春 11.9547675029
+救济难民 12.1089181827
+班戈县 11.7034530746
+睡睡 11.4157710022
+提审 10.533381822
+知人之明 11.8212361103
+英国内政部 12.8020653633
+一时冲动 10.7226238216
+小虎子 11.0103058941
+打架斗殴 11.4157710022
+购买方 11.9547675029
+候旨 10.2630914922
+平民主义 11.4157710022
+标记 8.18364995057
+专库 13.2075304714
+那晴雯 12.8020653633
+京门 13.900677652
+处女 9.87532596124
+火影 13.2075304714
+残暴不仁 13.2075304714
+艺业 12.8020653633
+南薰 11.2616203224
+切斯 12.1089181827
+学术权威 11.3357282945
+眸子 9.63799777493
+艺专 12.5143832909
+表现力 9.04864738806
+红桥 11.7034530746
+红桦 12.1089181827
+柳河 10.5684731418
+惠生出 12.8020653633
+非诉讼 12.5143832909
+诞生 7.06872408641
+宋元汉 13.2075304714
+必备 9.34680076038
+达尔富尔 12.8020653633
+精疲力尽 10.533381822
+工业电器 13.900677652
+皮龟 11.8212361103
+弘佐卒 12.8020653633
+地滑 10.9562386728
+略懂 12.1089181827
+抗冲击 10.9562386728
+索诺 13.900677652
+摩擦 7.33119623156
+宫腔镜 11.9547675029
+宣抚司 8.64318227995
+东陵 11.1280889297
+晒太阳 9.48183704418
+沙赫拉 13.2075304714
+红桃 11.598092559
+洪伟烈 13.2075304714
+玉印 11.5027823792
+红案 13.2075304714
+云长引 12.2912397395
+轻武器 9.12999302751
+偶像 9.23723855786
+多烧 12.8020653633
+倾下 12.2912397395
+东院 11.2616203224
+磁盘驱动器 11.8212361103
+业务费 12.2912397395
+敢死 10.9562386728
+向后看 11.9547675029
+杜求仁 13.2075304714
+兴许 9.36807815882
+主题思想 10.9049453784
+十三陵水库 11.5027823792
+环腺苷酸 12.5143832909
+索讨 13.2075304714
+范可尼 13.2075304714
+擒拿法 13.900677652
+冯家村 12.8020653633
+特色美食 13.900677652
+折扣店 13.900677652
+朗科 10.4994802703
+东阁 9.85762638414
+红格 12.5143832909
+南营 12.8020653633
+东阳 9.35738286971
+连腾 13.2075304714
+理科班 13.2075304714
+言行举止 11.1280889297
+东阿 9.56994431169
+瓦店镇 13.2075304714
+晁盖恐 13.2075304714
+洒下去 12.8020653633
+执行率 12.5143832909
+主席令 13.900677652
+红树 10.2371160058
+帕尔巴 12.5143832909
+瓦片 9.87532596124
+底漆 13.2075304714
+三大王 10.9562386728
+战得胜 12.5143832909
+花笺 12.5143832909
+蔡元禧 12.1089181827
+难以言状 12.2912397395
+叶弗列 12.5143832909
+著作者 13.900677652
+丰茂 10.2117981979
+螫毒 13.900677652
+研制者 13.900677652
+皮鼓 11.7034530746
+南霸天 13.2075304714
+锦绣江山 12.5143832909
+教科书 8.9519177616
+头号新闻 13.2075304714
+红棉 13.2075304714
+玉叶 12.1089181827
+泰坦 12.5143832909
+混合色 12.2912397395
+清空 10.6818018271
+专心 8.53003962385
+负责 5.77890023281
+享国 11.7034530746
+艺体 13.900677652
+第七件 13.900677652
+玉厚 9.94943393339
+土地质量 12.8020653633
+政党政治 12.1089181827
+味道 7.33541268194
+不胜举 13.2075304714
+莫明其妙 11.598092559
+翻肠倒肚 13.2075304714
+土默川 12.2912397395
+食用方法 11.598092559
+答谢词 13.2075304714
+魏久矣 13.2075304714
+犹太教 9.29550746599
+好近 13.900677652
+丰草 13.900677652
+亚尔兑 12.5143832909
+英法美 11.9547675029
+红梅 8.85082164473
+艺伎 12.2912397395
+陈得才 12.5143832909
+安西王 11.7034530746
+吃回扣 12.5143832909
+负起 10.2897597393
+布须曼 10.604840786
+摩搓 13.900677652
+污渍 11.0674643079
+第七十三回 12.2912397395
+地质处置 13.900677652
+富岛 12.8020653633
+囊中 9.45802639549
+数理统计 10.4994802703
+丧心病狂 11.598092559
+垃圾筒 13.2075304714
+火并 9.98865464655
+加异勒 12.2912397395
+专征 12.2912397395
+连臣 13.900677652
+冈田 12.1089181827
+奥塞梯 11.598092559
+英语单词 11.5027823792
+清秋 12.2912397395
+清秀 9.25628675283
+提好 12.8020653633
+政治局 8.61241062128
+公有制 9.30555780184
+苑德军 13.900677652
+针线活儿 13.2075304714
+思想感情 9.32596667347
+翩翩起舞 10.765183436
+清科 10.642581114
+俄尔 12.2912397395
+弗拉尼茨基 13.900677652
+工字型 12.8020653633
+专属 9.66657114738
+不虚此行 11.1280889297
+烟价 12.1089181827
+便当 9.96885201925
+窗户 7.86280673205
+偶发 10.9562386728
+调查取证 10.5684731418
+郑克晟 12.5143832909
+周青臣 10.3453295905
+总书记 8.1417758781
+白毛风 12.2912397395
+国家档案局 12.2912397395
+窗扇 11.5027823792
+清福 11.598092559
+烧碱 9.74179456862
+反遭 10.9562386728
+底水 12.8020653633
+切望 11.7034530746
+凤丫头 9.96885201925
+烟云 10.4041700905
+斯贝 12.1089181827
+脑壳子 13.900677652
+谭震林 10.604840786
+青苍 13.2075304714
+盖拉特 12.1089181827
+汉源县 13.2075304714
+泰和 9.49395840471
+忘情水 13.900677652
+椭圆面 13.900677652
+葡文 13.2075304714
+底气 9.03314320152
+丰胸 11.598092559
+内流区域 12.8020653633
+秦小官 12.5143832909
+遂川县 13.2075304714
+通电话 10.2897597393
+戎事 12.2912397395
+胎次 12.8020653633
+幕僚长 12.1089181827
+火巷 13.900677652
+殷汝耕 11.9547675029
+布格 11.598092559
+敉平 12.8020653633
+侯均初 13.2075304714
+羽毛扇 11.9547675029
+化工企业 10.4994802703
+滴定法 10.4666904475
+谢觉哉 12.8020653633
+奥尔丹 13.2075304714
+独一无二 9.07236391467
+拜启 13.900677652
+鲜明特点 12.1089181827
+字正腔圆 11.5027823792
+密而不宣 13.900677652
+阿伦德 13.2075304714
+芦荻秋 13.900677652
+布森 11.5027823792
+漫无目的 10.642581114
+长江三峡 9.58318953844
+连花 13.900677652
+传统美德 12.1089181827
+污浊 9.98865464655
+进化论 9.15574552361
+温升高 12.2912397395
+相臣常 13.2075304714
+七百五十万两 13.900677652
+逾越 9.98865464655
+衣冠士 13.2075304714
+旁生 12.2912397395
+始末缘由 13.2075304714
+抖掉 11.7034530746
+栎树 11.4157710022
+灰绿色 10.2897597393
+二百七十多年 12.2912397395
+东门 8.60236028543
+北京市政府 10.4994802703
+烟丝 10.0294766411
+季风雨林 11.5027823792
+电话响 10.5684731418
+连苑 13.2075304714
+精神状态 9.20932976975
+异戊巴比妥 13.2075304714
+牵及 13.900677652
+图像处理 10.9049453784
+暗黑 10.8096351986
+特困 11.1926274509
+暗黝 13.2075304714
+泰吉 12.1089181827
+容成公 12.8020653633
+烧砖 11.1280889297
+铜鼓县 13.2075304714
+卡巴迪 12.8020653633
+柔和 8.37921673411
+京韵 13.900677652
+拼缀 13.900677652
+苏尼特右旗 13.2075304714
+任少正 13.2075304714
+特在 10.9049453784
+宝丫头 11.1926274509
+污泥 10.3743171274
+武林中 11.8212361103
+后改鹰 13.2075304714
+口不择言 12.8020653633
+玉兔 10.604840786
+甚远 9.4233408375
+资格证 10.533381822
+纯赚 13.2075304714
+才会赢 12.5143832909
+贷放 9.65218240993
+听不见 8.64318227995
+帘子 8.43261751084
+索伦托 13.2075304714
+省力化 13.900677652
+陆燕 12.2912397395
+玉兹 13.2075304714
+三坊七巷 13.900677652
+玉兽 11.0103058941
+人口质量 11.7034530746
+基本粒子 10.0294766411
+玉兰 9.21854642485
+神箭手 12.2912397395
+司盐校 13.2075304714
+半秒 13.2075304714
+许嘉璐 13.2075304714
+公有化 12.1089181827
+不胜任 11.9547675029
+子玺书 13.2075304714
+旗袍 9.00283785202
+红橙 12.5143832909
+披头士乐队 13.900677652
+千款 13.2075304714
+钉耙 13.900677652
+敏捷地 10.2371160058
+包干制 13.900677652
+承诺 6.46937797682
+全部排 13.900677652
+官封弼 12.8020653633
+归子炽 13.2075304714
+现代战争 9.4233408375
+核聚变 9.61021821083
+斯谟 12.8020653633
+贺锦 12.8020653633
+朱三太子 10.9562386728
+红樱 13.900677652
+明见万里 12.1089181827
+反酸 12.2912397395
+耐受 10.0294766411
+可亲可近 13.2075304714
+索要 9.40086798165
+玉儿 8.6803218269
+驳壳 13.2075304714
+亚尔古 12.2912397395
+必学 13.2075304714
+债权 8.14493543839
+黄土高原地区 12.5143832909
+丰臣 12.2912397395
+赏罚不明 12.5143832909
+阿瓦鲁 13.900677652
+倍频 11.7034530746
+凌波仙子 13.900677652
+永永 12.8020653633
+年终奖金 12.2912397395
+提壶 12.8020653633
+祖龙的 13.2075304714
+孙伯符 12.5143832909
+精神涣散 13.900677652
+萨尔图区 12.5143832909
+满都 13.900677652
+杭寄草 10.3453295905
+芜杂 11.1280889297
+专差 13.900677652
+必定 7.34959731693
+侨务办公室 12.5143832909
+五香豆 12.5143832909
+相生相成 13.900677652
+奥尔伯 13.2075304714
+特型 11.8212361103
+歌唱性 11.4157710022
+玉函 11.1280889297
+表现值 13.900677652
+鬼怪 9.80633308975
+不辞劳苦 10.9049453784
+热刺刺 13.900677652
+检查室 13.900677652
+寄畅园 12.2912397395
+反醒 13.900677652
+贾菌 12.5143832909
+玉凤 10.4349417492
+重特大 12.2912397395
+清真馆 13.900677652
+根线虫病 13.900677652
+火居 13.2075304714
+王国宝 13.2075304714
+互相 6.20765190356
+家庭作业 12.2912397395
+赞歌 10.6818018271
+污水 8.65893063692
+王国宁 12.8020653633
+亚原子 11.1926274509
+皇皇 11.5027823792
+负载 9.32596667347
+务求 10.0720362555
+丰腴 10.1164880181
+耐碱性 13.2075304714
+哨子 10.8561552143
+中华民国 7.96314144689
+夹馅 13.900677652
+犀牛望月 13.2075304714
+何足惜 11.8212361103
+范纯仁 13.900677652
+毛类 13.2075304714
+火山 7.46613113319
+腐败案 11.8212361103
+孽障 10.9562386728
+海砂 13.2075304714
+流别 13.2075304714
+模拟 7.62591563073
+敢于胜利 12.8020653633
+微型 8.58747167293
+漳州 9.27570483869
+扶正培本 12.5143832909
+公用局 13.900677652
+穿戴 8.42003872863
+西部 5.79778851733
+老小孩 13.900677652
+投机分子 11.1280889297
+打印消息 13.900677652
+劳动布 13.900677652
+鸡头 10.2630914922
+梅益 12.1089181827
+上妆 12.5143832909
+在学 11.8212361103
+称量 10.4349417492
+阿里郎 13.900677652
+称重 11.9547675029
+反清 9.10488710638
+纳言物 13.900677652
+山巨源 12.8020653633
+中常会 12.5143832909
+委员 6.71756595023
+市政局 10.0088573539
+印度籍 13.2075304714
+日本产 13.2075304714
+楚军渡 12.8020653633
+银子 6.44537916629
+刑事侦察 13.2075304714
+人生自古谁无死 11.598092559
+电子市场 12.1089181827
+耿耿忠心 11.8212361103
+亿克朗 12.1089181827
+向远海 13.900677652
+奥伯特 13.2075304714
+美容中心 11.7034530746
+难以置信 9.36807815882
+女萝 13.2075304714
+招纳 10.6818018271
+事务 6.9039961638
+耳朵垂 13.900677652
+曲星君 12.8020653633
+大菱鲆 13.900677652
+暗恋 11.8212361103
+装订成册 12.2912397395
+真金第 12.8020653633
+来俊臣 11.598092559
+消费结构 9.66657114738
+闹出 9.85762638414
+千百数 12.2912397395
+那娘子 12.5143832909
+事势 10.8561552143
+瓯江 10.533381822
+个别情况 10.8096351986
+耸立 8.95903522937
+科学素养 12.5143832909
+英国伦敦大学 10.765183436
+概念图 13.900677652
+挖掘潜力 11.9547675029
+马其顿 8.63281949291
+固定资产 7.4407731976
+麦克尔士 12.8020653633
+东欧 8.2985588311
+肯尼 12.2912397395
+化妆镜 13.900677652
+木儿代 13.2075304714
+烧蚀 11.2616203224
+南社 11.2616203224
+事功 11.4157710022
+冈比亚 10.3453295905
+布阵 10.0088573539
+奥拉山 13.900677652
+恐防 11.9547675029
+千百斤 11.5027823792
+昼夜兼程 12.2912397395
+竹席 11.1926274509
+万州 11.8212361103
+万川 11.2616203224
+功夫茶 13.2075304714
+红门 11.3357282945
+租子 10.7226238216
+金银丝 11.3357282945
+下岗女工 13.900677652
+琼筵 13.900677652
+十余公里 13.2075304714
+章坪镇 12.5143832909
+栎阳 11.9547675029
+甘思宣 13.900677652
+股票名称 10.1394775363
+低平 8.3555002075
+马驹子 12.8020653633
+七颠八倒 11.8212361103
+上头 8.21709788464
+施小策 13.2075304714
+灾荒 9.20019728618
+艾尔莎 13.900677652
+事前 8.2273543848
+竹帘 10.5684731418
+竹帛 11.9547675029
+上天 8.26232298264
+牛磺酸 12.1089181827
+快船队 13.2075304714
+南移 9.35738286971
+美塞尼亚 10.6818018271
+西郊 8.79473217808
+斯王 11.8212361103
+原生矿物 12.5143832909
+俞正声 11.7034530746
+上套 11.0674643079
+在家 7.01414600945
+几百万美元 12.5143832909
+皮托 12.2912397395
+上奏 9.54396882529
+斯玛 12.8020653633
+财政经济委员会 10.9562386728
+胳膊肘儿 12.2912397395
+马林代 13.900677652
+墙体 9.96885201925
+答谢 9.48183704418
+李次九 11.9547675029
+上好 13.2075304714
+檐子 13.2075304714
+东段 8.44535653662
+德利布 13.2075304714
+巨作 11.7034530746
+举贤荐能 12.1089181827
+南星桥 11.598092559
+中国东方电气集团 13.2075304714
+那干尸 12.2912397395
+德利希 13.900677652
+苍南县 12.8020653633
+兴师动众 10.1394775363
+解锦州 11.0103058941
+暗想 8.81927328699
+互见 12.5143832909
+噼噼叭叭 12.2912397395
+轻薄型 13.2075304714
+能克服 11.598092559
+老佛爷 8.85725253506
+女朋友 8.84443184663
+屯聚 11.7034530746
+巨人 8.81308131674
+改弦易辙 11.1926274509
+罗叔言 13.2075304714
+刘振声 13.900677652
+签字权 13.900677652
+宇文化及 10.6818018271
+碰到矛盾 13.900677652
+汤儿 13.2075304714
+尼罗特 11.1926274509
+夹板 10.2371160058
+波国 12.5143832909
+布青 12.8020653633
+巴雷托 13.900677652
+粉蝶 12.1089181827
+丰美 10.1164880181
+数以千万计 11.0674643079
+与此有关 10.1630080337
+顺利完成 9.49395840471
+科兹洛夫 12.5143832909
+基本法 10.2897597393
+输气管道 10.604840786
+万山 9.36807815882
+夹杀 13.900677652
+负熵 12.5143832909
+夹杂 9.27570483869
+知天命 11.2616203224
+老挝人民民主共和国 12.5143832909
+卢赛洛 12.8020653633
+反演 11.9547675029
+事发 8.40350942668
+斯特 9.41204128224
+连累 8.81308131674
+奖许 13.900677652
+银婚 13.900677652
+事变 8.48457724977
+王弼注 11.4157710022
+耐用品 10.2897597393
+塞西勒 13.2075304714
+加尔维斯顿 13.2075304714
+耻辱 8.73589167805
+要你管 11.4157710022
+河东区 11.9547675029
+盖拉赫 13.900677652
+阿得雷 13.2075304714
+铁制 9.55687223012
+奠仪 12.2912397395
+君子一言 12.5143832909
+互补 9.11318590919
+参半 10.4666904475
+万封 12.2912397395
+约鲁巴人 11.7034530746
+安其宜 13.900677652
+鼻骨 10.7226238216
+桔红 11.1926274509
+全自动 9.55687223012
+绿帘石 11.1280889297
+张翼德 10.9562386728
+花莲市 12.1089181827
+银环蛇 11.9547675029
+高等专科 12.8020653633
+吴哥城 12.2912397395
+雍籍 12.5143832909
+万尾 13.900677652
+乡宦 9.84023464143
+上声 11.7034530746
+蔫头耷脑 11.7034530746
+张同 12.8020653633
+汤允 12.8020653633
+张副将 12.2912397395
+四五百 10.0294766411
+上士 10.8096351986
+张君 13.2075304714
+克贝里 13.2075304714
+限定性 11.4157710022
+称道 9.00283785202
+墙上 7.2673592187
+波浪形 11.4157710022
+天星哥 12.8020653633
+明瓦 12.2912397395
+摩顶 11.598092559
+西吉县 12.8020653633
+中国航天科技集团公司 13.900677652
+清虚 11.0674643079
+龙王庙 9.89334446674
+意合情投 13.2075304714
+上堂 11.1280889297
+腹案 13.2075304714
+红铅 13.900677652
+六十日 12.2912397395
+将机就机 13.900677652
+益田路 11.0674643079
+万峰 11.7034530746
+在读 10.0940151622
+中国信达资产管理公司 12.8020653633
+万峦 13.900677652
+吴为心 12.8020653633
+子放 12.5143832909
+季连 12.2912397395
+军都山 11.1280889297
+品牌化 11.8212361103
+标目 11.7034530746
+侨商 12.2912397395
+巨万 11.0103058941
+气呼呼 9.58318953844
+布鞋 9.41204128224
+张翼引 12.8020653633
+一头儿 12.1089181827
+候风 12.2912397395
+撒克逊人 10.8096351986
+受限制 9.5186510173
+白旺见 13.2075304714
+改判 10.7226238216
+神秘恐怖 13.2075304714
+标的 7.44862869754
+万岁 7.31037660378
+皮损 10.4994802703
+梦溪笔谈 10.2630914922
+帕秒 13.2075304714
+有效证件 12.1089181827
+五十余岁 12.1089181827
+受助者 13.2075304714
+妍媸 13.900677652
+橡皮圈 13.900677652
+核扩散 11.0674643079
+花柳病 12.8020653633
+蒙头转向 12.8020653633
+自产自销 11.9547675029
+梅林 9.91169360541
+单通 13.900677652
+兰心慧 13.2075304714
+张咏 11.9547675029
+亲切感 10.9562386728
+电化教育 11.9547675029
+上网冲浪 13.2075304714
+越小越 11.598092559
+愧歉 12.8020653633
+描出 11.598092559
+哈诺 13.900677652
+上官 9.65218240993
+安土城 13.900677652
+三氯乙醛 11.8212361103
+于城邦 11.2616203224
+退役军官 13.2075304714
+克雷蒂安 13.900677652
+动态性 11.8212361103
+反水 11.5027823792
+删汰 13.900677652
+和平队 13.2075304714
+启动器 12.8020653633
+标界 12.5143832909
+林祥谦 12.1089181827
+产甲烷 13.2075304714
+上宾 10.6818018271
+不算数 10.4349417492
+香亭 10.9049453784
+张坊 13.900677652
+上家 11.598092559
+隐藏式 12.8020653633
+竹岛 12.1089181827
+新股 5.98059445292
+银奖 11.7034530746
+消防支队 11.5027823792
+暗房 11.7034530746
+子一闪 12.5143832909
+示众 9.69598503258
+蜚声 9.93038573842
+隆中 10.6818018271
+上客 12.5143832909
+睡魔 12.8020653633
+刁明忠 11.5027823792
+报纸杂志 11.598092559
+千百条 11.9547675029
+袁钧 13.2075304714
+张在 11.9547675029
+种养加 13.900677652
+挥霍一空 12.5143832909
+哲学著作 9.89334446674
+消防大队 11.598092559
+旅游者 9.55687223012
+过金军 13.900677652
+泻火 10.642581114
+愿交 13.900677652
+翻江搅海 11.3357282945
+错误码 12.2912397395
+隆乳 13.2075304714
+暗扣 12.8020653633
+开平方 12.8020653633
+可溶解 11.1926274509
+敝邑 12.8020653633
+根本宗旨 13.900677652
+尼姑 8.89673134603
+汤剂 10.604840786
+分类整理 12.2912397395
+鸡子 9.91169360541
+肥皂液 12.8020653633
+万张 9.45802639549
+红霞 8.81308131674
+一羽 13.900677652
+鸡犬不留 12.1089181827
+刘渊病 12.8020653633
+鼻饲 11.8212361103
+菊黄 13.2075304714
+檐头 13.2075304714
+易继发 12.1089181827
+互设 11.3357282945
+海岸阶地 12.8020653633
+汤加 9.71102290995
+调查报告 8.74162235276
+二尊 13.2075304714
+万心 11.0103058941
+倍数 8.10158499752
+取给 12.8020653633
+姜应麟 12.8020653633
+互让 13.900677652
+狼餐虎咽 13.900677652
+中国经济时报 10.2630914922
+恐韩 13.900677652
+事假 12.2912397395
+预先 7.91674137129
+利纳雷斯 13.900677652
+连线 8.4284069783
+天圆地方 11.1280889297
+胃癌 10.2897597393
+烂泥塘 11.598092559
+夭矫 12.8020653633
+信神佛 13.900677652
+圣约瑟 12.5143832909
+香主 13.900677652
+翟之隶 13.2075304714
+阿涅 13.2075304714
+汽车座椅 13.2075304714
+伤口发炎 12.8020653633
+电动车 7.55679721785
+那窝儿 13.900677652
+连络 11.3357282945
+愿为 9.77354326693
+饱受 8.82550383674
+汤勤 13.2075304714
+连结 8.96620371885
+六个月 8.98069672615
+作战部 10.4994802703
+互感器 10.6818018271
+汤勺 11.9547675029
+筒管 13.2075304714
+竹山 10.4994802703
+走读生 12.8020653633
+金靴 12.5143832909
+卡规 13.900677652
+万德 11.8212361103
+皮恩 12.8020653633
+竹屋 13.2075304714
+紊乱 8.11685246965
+有蹄类 10.3171587135
+南管 11.5027823792
+馍馍 10.0294766411
+红鞋 12.1089181827
+反法 9.80633308975
+饱经世故 12.1089181827
+扶阳 12.8020653633
+市政府 7.41451686303
+连续 5.21424814331
+擦不掉 13.2075304714
+狗苟蝇营 13.2075304714
+宫邸 12.8020653633
+互诉 12.1089181827
+章楚红 10.2897597393
+上季 10.642581114
+暗指 10.9049453784
+苇箔 12.5143832909
+欧战前 13.900677652
+迷雾 9.37888907493
+因果论 12.8020653633
+五十二任 13.2075304714
+暗挖 12.8020653633
+万幅 12.1089181827
+墓门 9.61021821083
+锦匣 11.7034530746
+连缀 11.0103058941
+盖埃斯 12.8020653633
+一点半点 12.5143832909
+姜科 12.5143832909
+结膜炎 10.3453295905
+万年 7.90921310487
+肥皂泡 11.5027823792
+东土唐 10.765183436
+触处机来 13.900677652
+兵团农二师 13.2075304714
+汤包 12.1089181827
+产品编号 12.8020653633
+万幸 9.72629038208
+微咸 12.5143832909
+港口区 11.7034530746
+清爽型 13.2075304714
+竭泽而渔 11.5027823792
+汤匙 10.1394775363
+寡二少双 13.900677652
+桐柏 10.3743171274
+习仲勋 12.8020653633
+朱常询 11.7034530746
+激将 11.598092559
+加工水平 13.2075304714
+拼花 12.5143832909
+世界报 10.9049453784
+运行状况 10.4041700905
+混合粉 13.900677652
+夹攻 9.0884932966
+窃用 13.900677652
+张嘴 8.29487558568
+答辩 10.604840786
+研制组 13.900677652
+玻利瓦尔 10.4041700905
+可调节性 13.900677652
+石砂 12.8020653633
+卡托斯 12.5143832909
+管理条例 8.85725253506
+答辞 12.1089181827
+山中建 12.8020653633
+桐林 12.8020653633
+果蝇 10.4041700905
+连署 12.8020653633
+张嘉 11.598092559
+张嘎 12.2912397395
+卡达姆 12.8020653633
+桐果 13.2075304714
+肥皂沫 12.8020653633
+讲来讲去 13.900677652
+汤博 12.8020653633
+清蒸 10.5684731418
+候驾 13.2075304714
+纯然 12.1089181827
+红队 13.900677652
+明火执仗 11.7034530746
+翘首以盼 11.598092559
+清水溪 11.8212361103
+选举事务 13.2075304714
+红雨 13.900677652
+媒人 9.66657114738
+宫里 8.25523075433
+事关 8.82550383674
+森林抚育 13.900677652
+香会 13.2075304714
+示人 10.2897597393
+格林纳 12.8020653633
+组织化学 12.8020653633
+分队长 12.1089181827
+贪生 11.7034530746
+铁力 12.5143832909
+南站 11.3357282945
+张国 11.2616203224
+腺癌 10.9049453784
+都邑镐 12.8020653633
+南越王 10.7226238216
+微启 13.2075304714
+南端 8.24818847171
+西多东 11.9547675029
+后悔不及 11.9547675029
+老伙计 10.2117981979
+幼冲 12.8020653633
+西厢记 9.75754292558
+以柔克刚 11.5027823792
+底里 10.4349417492
+迟疑不前 12.5143832909
+作风过硬 12.5143832909
+颍川 10.0294766411
+一百三十五亿年 13.2075304714
+扯旗放炮 12.8020653633
+南竹 11.4157710022
+言律绝 12.2912397395
+连翘 10.4666904475
+侵吞 9.65218240993
+夹断 12.8020653633
+宏观管理 11.0103058941
+腺瘤 10.3171587135
+英语教学 11.7034530746
+末后 11.3357282945
+闹剧 9.43476953332
+纯熟 10.6818018271
+法兰西 8.19689517732
+东梅 12.2912397395
+南窑 13.2075304714
+一翻 9.72629038208
+桐木 11.598092559
+经典作家 12.2912397395
+事儿 6.61311701167
+韩祥 11.8212361103
+五十二个 12.8020653633
+孙国参 13.2075304714
+颓唐 10.6818018271
+姚依林 12.1089181827
+朱尔典 13.900677652
+万座 11.2616203224
+万度 11.0674643079
+辛斯克 13.900677652
+岸滩 11.8212361103
+军内外 13.900677652
+肯德 13.900677652
+四五瓶 13.2075304714
+骑进 12.8020653633
+媒介 8.26946587015
+万套 9.40086798165
+吴承恩 11.1926274509
+明投顺 12.8020653633
+蜚廉 12.2912397395
+严勇 13.900677652
+用鸭 13.2075304714
+词性 12.8020653633
+张公 11.7034530746
+夹批 13.900677652
+激子 13.2075304714
+人情汹汹 13.900677652
+张兵 13.900677652
+同香兰 12.5143832909
+中国旅行社 12.5143832909
+京洛 13.2075304714
+算总账 11.9547675029
+宫院 9.59661255877
+夹手 13.2075304714
+德格 11.9547675029
+张兄 11.7034530746
+张先 11.598092559
+张光 13.900677652
+底限 12.2912397395
+美国军舰 11.598092559
+托运人 12.1089181827
+纯白 10.4349417492
+翎毛 10.4666904475
+末叶 11.3357282945
+红酒 10.0720362555
+京派 12.8020653633
+西九龙 13.900677652
+有汉儿 13.2075304714
+老牌子 12.2912397395
+上川 13.2075304714
+反对党 9.53122979951
+颓势 9.05649056552
+水来伸手 13.900677652
+机位 11.598092559
+流口 12.1089181827
+年总产 12.5143832909
+索状 11.8212361103
+酱色 11.3357282945
+左金吾 12.5143832909
+梅文鼎 11.8212361103
+银弹 13.900677652
+宫阙 9.7898037878
+包背装 13.900677652
+逮捕 7.62403416263
+沉重感 11.8212361103
+丘云岩 13.2075304714
+万头 9.7898037878
+汉萨德 11.7034530746
+剩得 9.80633308975
+香港岛 10.533381822
+奥体 12.2912397395
+上工 10.0505300503
+刑事犯罪 10.604840786
+清莱 13.2075304714
+耗热 13.900677652
+芝士 12.8020653633
+培养出来 11.0103058941
+监测仪 12.5143832909
+万美金 11.2616203224
+东濒 9.74179456862
+丰稔 11.8212361103
+整理者 12.2912397395
+轩辕 10.3743171274
+费尔柴尔 12.5143832909
+张凯 9.82314020807
+编外人员 12.8020653633
+马德雷 11.8212361103
+陶冶性情 12.8020653633
+侵华 9.13850371718
+侵占罪 12.2912397395
+张出 13.900677652
+礼多人不 13.900677652
+向润润 13.2075304714
+省治 11.3357282945
+西格弗里德 13.2075304714
+巴雅 12.8020653633
+蔗渣 12.1089181827
+连碰 12.5143832909
+老郝 11.1926274509
+龙虎 10.0940151622
+红釉 12.1089181827
+国家自然科学奖 10.0294766411
+杭先生 11.1280889297
+马夫人 10.604840786
+侵占 7.72066099832
+喀什市 11.5027823792
+空城计 10.4994802703
+底向上 12.8020653633
+改修 11.8212361103
+和楠普 13.900677652
+瓦诺 12.8020653633
+小日子 11.0103058941
+浑沦 12.8020653633
+张冬 13.2075304714
+微升 10.0940151622
+张冲 13.900677652
+百亿年 13.2075304714
+青地境 13.2075304714
+鸡巴 10.0720362555
+攀比 10.3743171274
+硬拼 11.0103058941
+任彦生 13.2075304714
+赵开发 9.49395840471
+标王 11.4157710022
+养蜂场 13.2075304714
+争风吃醋 10.8096351986
+事业单位 8.48457724977
+皮普 12.5143832909
+调速器 11.4157710022
+陈大齐 13.2075304714
+忧虑感 13.900677652
+铁勒 10.6818018271
+一百二十岁 13.2075304714
+蒙皇后 12.8020653633
+巴德诺 11.3357282945
+张军 11.1926274509
+闪电战 10.604840786
+清茶 10.7226238216
+羞答答 11.598092559
+东湖 9.56994431169
+汲取 8.89673134603
+红少津 11.9547675029
+负疚 10.9049453784
+鱼精蛋白 12.8020653633
+上岛 11.598092559
+索班 12.5143832909
+上岗 9.63799777493
+埃及文 13.2075304714
+从何下手 12.5143832909
+广督师 12.5143832909
+右肋 13.900677652
+倒角机 13.900677652
+传统性 11.9547675029
+饱合 13.900677652
+标牌 11.1926274509
+清苑 11.9547675029
+皮枕 12.5143832909
+宋役法 13.2075304714
+皮林 12.8020653633
+微动 11.1926274509
+中国体育代表团 12.5143832909
+尖锐对立 11.4157710022
+上岸 8.28027678626
+在京开幕 13.900677652
+郦生 12.8020653633
+红遍 11.598092559
+清苦 10.8561552143
+千根 13.2075304714
+假正经 11.1280889297
+聚沙成塔 12.2912397395
+互谅 12.5143832909
+小高潮 10.533381822
+斯登 12.5143832909
+银幕 9.62401153296
+保管部 12.2912397395
+饱含 9.66657114738
+其属下 12.1089181827
+马殷进 13.2075304714
+券门 11.7034530746
+撬下来 12.8020653633
+补校 13.2075304714
+东渐 11.598092559
+朱由俭 13.2075304714
+一无所能 12.8020653633
+幸灾乐祸 9.35738286971
+张倩 13.2075304714
+课收 13.900677652
+京汉 10.1394775363
+纯真 9.77354326693
+万堆 12.8020653633
+北平 7.33964698608
+向后转 11.1280889297
+赵二媳妇 12.2912397395
+祈愿 11.2616203224
+银币 9.71102290995
+秦孝公 10.8561552143
+知根知底 11.2616203224
+银帆 13.900677652
+昆阳镇 12.8020653633
+夹持 10.6818018271
+刘向校 12.8020653633
+汲县 10.533381822
+家境贫困 11.5027823792
+闹哄 11.9547675029
+东游 11.1280889297
+鸡屎 11.1280889297
+柳湘兰 9.56994431169
+覆盖面广 11.4157710022
+和田见秀 10.3171587135
+东渡 9.32596667347
+锑华 13.2075304714
+东港 10.8096351986
+序列化 13.2075304714
+索玛 11.7034530746
+在建 8.24468584116
+狙诈 13.900677652
+木根如 13.2075304714
+皮服 13.900677652
+影碟 11.9547675029
+霓裳 10.642581114
+揎拳裸袖 13.900677652
+概念化 10.604840786
+微分 8.93783302172
+暗斗 12.2912397395
+亲生骨肉 11.4157710022
+上尉 9.49395840471
+礁湖 12.2912397395
+汤姆斯杯 12.1089181827
+油画布 13.2075304714
+上将 7.76945116249
+饱和 8.53470163695
+皮朗 12.8020653633
+微利 9.63799777493
+烧荒 11.5027823792
+万声 11.8212361103
+长江三角洲 9.33632946051
+卫侯李 13.2075304714
+京沪 9.20932976975
+原无 10.4666904475
+宫音 12.1089181827
+道德素质 12.5143832909
+反殖 11.1280889297
+望霞峰 12.5143832909
+发明权 11.1926274509
+东北三省 9.71102290995
+王路易 11.598092559
+万士 12.8020653633
+东滩 11.9547675029
+生死与共 10.604840786
+上属 9.93038573842
+家祖 13.900677652
+妇女儿童 10.8561552143
+瀛洲 11.0103058941
+连科 13.2075304714
+混合税 13.2075304714
+改办 12.8020653633
+居胥山 12.2912397395
+百战百胜 10.4041700905
+庭外 12.1089181827
+上屈 13.900677652
+胃病 10.0505300503
+上届 10.533381822
+上屋 11.2616203224
+派力司 12.5143832909
+塔尼亚 11.0674643079
+奥拉夫 12.8020653633
+在座 8.56313957227
+上层 7.74581955796
+诸公子 12.5143832909
+南粤 11.2616203224
+皮条 11.0103058941
+零部件 8.28390655431
+上山 7.66822963543
+反比 11.0674643079
+拘役 9.82314020807
+皮板 11.7034530746
+竹子 9.36807815882
+经纬线 11.5027823792
+东溪 11.4157710022
+课文 10.4666904475
+万字 9.25628675283
+不偏不倚 10.533381822
+丰碑 10.642581114
+管亥 12.5143832909
+垃圾股 11.3357282945
+高音区 11.8212361103
+香港入境处 13.900677652
+上得 10.1394775363
+复员军人 11.598092559
+温阳化 13.2075304714
+刘向歆 13.900677652
+角孙 13.900677652
+南罗 13.900677652
+奎特 12.1089181827
+东流 9.21854642485
+布道 10.1394775363
+摔跤 9.66657114738
+管人 11.3357282945
+北亚 10.1394775363
+张胜温 13.900677652
+许仙 13.2075304714
+暗昧 13.2075304714
+东海 7.72897705456
+谢作炎 13.2075304714
+花旗银行 9.72629038208
+切齿 10.1164880181
+管事 8.5440913773
+北京 4.66740230872
+张华 9.59661255877
+雍笈 13.2075304714
+柳先生 12.1089181827
+通讯器 13.900677652
+摔跌 13.900677652
+标煤 11.4157710022
+管井 13.2075304714
+张南 11.0103058941
+好聚好散 13.900677652
+张博 13.2075304714
+人才需求 12.8020653633
+宋江寨 11.4157710022
+迈步 9.69598503258
+布逊 12.8020653633
+百度网 13.2075304714
+科曼奇 13.900677652
+北从 13.2075304714
+特发性 10.9562386728
+米切尔 11.4157710022
+瓦西 11.9547675029
+任王 13.900677652
+管仲 9.93038573842
+北仓 11.5027823792
+北仑 11.5027823792
+私邸 11.2616203224
+互转 12.2912397395
+三五分钟 12.1089181827
+侨务 11.9547675029
+专心致志 9.91169360541
+鲁缟 12.8020653633
+上心 9.94943393339
+连空 13.900677652
+梅叶 13.900677652
+东洲 12.2912397395
+连穿 12.5143832909
+互相关照 12.5143832909
+径流量 8.14493543839
+航海家 9.49395840471
+科萨科夫 11.3357282945
+寝食不安 10.604840786
+齐亚拉 13.2075304714
+张北 10.2897597393
+罗马城 10.3171587135
+管他 13.2075304714
+温病条辨 13.900677652
+新德里 9.98865464655
+泪如泉涌 10.6818018271
+鹑衣百结 13.2075304714
+烧肉 11.4157710022
+丁中制 12.5143832909
+张口 8.6803218269
+职业工会 13.900677652
+代数和 10.4666904475
+时代背景 10.8561552143
+北一 11.8212361103
+储公仓 13.900677652
+管个 12.5143832909
+北上 7.68807155622
+暗暗 7.17444424962
+花遮柳隐 13.900677652
+别创一格 13.900677652
+上式 10.0088573539
+北丐 13.900677652
+北东 9.13850371718
+三顷 12.5143832909
+罗卜 11.8212361103
+总户数 12.2912397395
+布石 11.4157710022
+梁皇 12.8020653633
+鸡泽县 13.900677652
+冥思苦想 11.3357282945
+墓道 8.23425096386
+张友 12.2912397395
+赵天王 12.8020653633
+管上 11.0103058941
+万对 12.1089181827
+二万五千 11.7034530746
+撒泼 10.4349417492
+四五十匹 13.2075304714
+张叔 12.8020653633
+梅厄 12.2912397395
+侵入 7.27131439854
+原油期货 8.17709255002
+管业 12.2912397395
+银川 8.84443184663
+银州 11.1926274509
+范文澜 10.5684731418
+微光 9.37888907493
+微克 10.2897597393
+走门路 13.900677652
+百废待举 13.2075304714
+丰硕 10.0720362555
+南美 8.1608847398
+万宝 9.96885201925
+清脆 8.60236028543
+汤团 11.1926274509
+筐笼 12.5143832909
+上当 8.95903522937
+重新启动 10.1630080337
+瓦解 7.86999239171
+国有经济 10.0940151622
+万宁 10.1871055853
+哈萨克斯坦 8.81308131674
+忍耻含垢 13.900677652
+于阗国 11.7034530746
+万安 9.61021821083
+委办 12.2912397395
+万家 8.10766404359
+鸡心 11.9547675029
+南群 11.9547675029
+北乡 11.8212361103
+无形中 9.19114745066
+绿鬓朱颜 13.900677652
+称霸 9.48183704418
+事后 7.49050277001
+费尔 9.7898037878
+管乐 11.3357282945
+硅钢 11.598092559
+倍感 9.89334446674
+一律平等 10.2117981979
+末儿 12.8020653633
+强行摊派 12.2912397395
+徐照 13.900677652
+锦绣山 13.2075304714
+送祝福 13.900677652
+东江 9.29550746599
+全市性 12.1089181827
+堪察加半岛 11.4157710022
+连笔 13.2075304714
+跋涉山川 12.8020653633
+今年年底 8.39534611604
+银山 10.642581114
+攀树 11.5027823792
+候鸟 9.4233408375
+上庄 12.5143832909
+间谍罪 13.900677652
+闹嚷 12.2912397395
+东汉 6.88048694366
+北侧 8.47133202302
+考古学 8.56795885871
+答话 8.66956903512
+数给 13.900677652
+梁末帝 11.7034530746
+呼救 9.71102290995
+汤圆 10.3743171274
+万左右 9.44633035572
+东汽 12.2912397395
+银屏 10.9049453784
+溽暑 11.8212361103
+张剑 11.9547675029
+千百成 12.2912397395
+个人所得 11.8212361103
+上座 10.9049453784
+首要地位 10.2117981979
+雁过留声 12.8020653633
+向后走 12.5143832909
+暗杀 8.96620371885
+盖德尔 12.1089181827
+连答 13.900677652
+真对不起 11.3357282945
+张到 12.5143832909
+课本 9.33632946051
+鸡年 13.2075304714
+瀛海 12.2912397395
+腺状 13.2075304714
+五尺道 11.0674643079
+侯门艳 13.2075304714
+庭审 9.43476953332
+国家乒乓球队 13.900677652
+指不定 11.1280889297
+哓哓 13.2075304714
+闽菜 13.900677652
+利生 12.8020653633
+正变 12.5143832909
+单乐章 12.8020653633
+奥拉宁 12.5143832909
+中断 7.5393751744
+晁盖之 13.2075304714
+清肺 11.0103058941
+张刚 9.84023464143
+废钢铁 13.2075304714
+管保 11.1926274509
+上帝 7.48068272383
+鬓发皆白 13.900677652
+酒性 11.8212361103
+张勤 11.8212361103
+布里 10.3453295905
+硬抗 11.8212361103
+日记法 13.900677652
+笔墨官司 12.2912397395
+还过得去 11.3357282945
+不幸逝世 13.2075304714
+五十万两 11.5027823792
+租屋 12.5143832909
+兴奋不已 10.9049453784
+北伐 8.0746775446
+信息估计 13.900677652
+布金 13.2075304714
+何曼笑 13.2075304714
+上市 4.79026811862
+管彭其 13.2075304714
+张勇 10.6818018271
+诞辰 10.533381822
+张勋 9.06439574502
+情感冲动 13.2075304714
+宫门 9.09665660724
+千百把 13.900677652
+国际商用机器公司 12.8020653633
+孙二人 11.3357282945
+不至于 7.73525979774
+宫闱 10.4666904475
+李堪 12.5143832909
+四五点 13.2075304714
+纳桃登 13.2075304714
+生鸟羽 13.2075304714
+下得 9.5062284973
+赔偿法 11.2616203224
+宇文觉 11.3357282945
+烧腊 12.8020653633
+硬通货 10.9049453784
+悒郁 11.8212361103
+蔗浆 13.2075304714
+在岸 11.9547675029
+玩赏 10.8096351986
+买东买西 13.2075304714
+东沟 11.0674643079
+丰神 12.2912397395
+矫正器 12.8020653633
+东沙 10.4666904475
+索然 11.2616203224
+肯定 5.59742053112
+良性循环 9.66657114738
+抗病力 11.8212361103
+胡永合 9.93038573842
+激增 8.60737282725
+连篇 11.598092559
+暗查 12.2912397395
+东河 10.4349417492
+梁辰鱼 11.598092559
+图像压缩 12.2912397395
+上年 7.11396070137
+南纬 9.05649056552
+保证车辆 11.9547675029
+不能生存 12.5143832909
+条理分明 11.9547675029
+管体 11.9547675029
+向南东 12.1089181827
+陆炮 13.2075304714
+南线 10.2117981979
+张力 8.89673134603
+共鸣器 12.5143832909
+不咎既往 11.7034530746
+韩先楚 12.8020653633
+和田县 12.2912397395
+巴陵 12.5143832909
+反映 5.41332530257
+金睛鬼 13.2075304714
+连琐 13.900677652
+贝叶经 11.9547675029
+反是 10.9049453784
+保监会 8.59240995457
+索绪 12.8020653633
+银印 10.533381822
+四千两 11.598092559
+天策文 12.8020653633
+墨子或 13.900677652
+西南非洲 10.7226238216
+自由对象 13.900677652
+模锻 12.1089181827
+新莽 9.55687223012
+周伯通 13.900677652
+清运 11.8212361103
+连理 11.3357282945
+微微 6.97704902384
+上冻 11.8212361103
+神经科学 12.8020653633
+泛出 9.61021821083
+喜来登 12.8020653633
+宁远河 12.8020653633
+景福宫 12.2912397395
+砀山县 11.5027823792
+黑手党 11.1280889297
+四千万 11.8212361103
+无休 11.8212361103
+在华 8.51618258919
+工艺流程 10.3743171274
+委屈 7.60725837313
+银南 11.2616203224
+水曲柳 10.2630914922
+银匠 9.35738286971
+玉蝶梅 12.8020653633
+白煮 13.2075304714
+靠外面 13.2075304714
+清辉 11.4157710022
+稳产高产 11.1280889297
+丰盛 8.91707103027
+桐油 9.35738286971
+八七年 13.900677652
+不瞒你说 9.84023464143
+鲍罗丁 12.5143832909
+第三条 9.41204128224
+檐口 13.2075304714
+潘季驯 10.6818018271
+丰盈 10.765183436
+竹围 13.900677652
+嵌银 12.2912397395
+颓废 9.80633308975
+广陵举 13.2075304714
+詹微 13.900677652
+参天大树 11.598092559
+信世凯 13.900677652
+讷河县 12.5143832909
+中央税 12.1089181827
+客服 8.66956903512
+那云青 12.5143832909
+大麻子 12.5143832909
+总该会 13.900677652
+宫为才 12.8020653633
+一百一十多元 13.2075304714
+鸡冠 10.3453295905
+张巡 11.4157710022
+村级 9.25628675283
+周副 11.5027823792
+从中作梗 11.0674643079
+封盖 11.3357282945
+张差 13.900677652
+闹大 10.3171587135
+四千人 11.598092559
+南燕 10.533381822
+银叶 12.5143832909
+内腔 11.5027823792
+财务状况 8.69119149913
+高薪技术 13.900677652
+泛光 13.2075304714
+僻道 13.2075304714
+米亚罗 13.2075304714
+丙丁 11.8212361103
+攀枝 12.2912397395
+简史 8.65365357982
+乐不可支 11.1280889297
+侨属 13.900677652
+黄鼎臣 12.8020653633
+微张 11.8212361103
+购买量 11.8212361103
+诞育 11.8212361103
+阿卜拉 13.2075304714
+死不认错 13.2075304714
+屠儿 13.2075304714
+银发 10.6818018271
+上晶脉 13.2075304714
+海森堡 11.7034530746
+觅人 13.900677652
+台湾海基会 12.8020653633
+途径 6.82910428776
+翻倒 10.3453295905
+侨居 9.36807815882
+几转 11.5027823792
+竹器 10.0505300503
+宋文鉴 13.2075304714
+红水河 9.91169360541
+蔡京奏 13.2075304714
+孤寡老人 11.9547675029
+黄子澄 12.8020653633
+上光 11.8212361103
+数百万头 12.8020653633
+斗不过 10.533381822
+上元 9.7898037878
+国民革命军 8.63798746307
+中央窝 13.900677652
+钟形裙 13.900677652
+上兵 12.1089181827
+弟妇 11.8212361103
+上关 10.9049453784
+体内平衡 13.900677652
+东接 9.61021821083
+路德教 12.2912397395
+刑侦处 12.5143832909
+美丽动人 11.8212361103
+陵夷 12.8020653633
+候选 9.03314320152
+一添 12.8020653633
+犟嘴 11.4157710022
+硼肥 13.2075304714
+连生 11.1280889297
+斯穆 10.6818018271
+老对头 12.2912397395
+中国地震局 13.2075304714
+张山 11.0674643079
+斯顿笃 13.900677652
+新花 12.1089181827
+红鱼 11.2616203224
+人之将死 11.7034530746
+汤头 11.5027823792
+圣约翰 10.0294766411
+静摩擦力 12.2912397395
+五十三日 12.5143832909
+啾啾 11.1926274509
+三江平原 9.65218240993
+天渊之别 13.2075304714
+铡草 11.9547675029
+连用 10.5684731418
+将相和 11.5027823792
+拼装 10.4666904475
+交错带 12.1089181827
+麻风病 11.7034530746
+太晖山 11.3357282945
+闽越 10.4994802703
+乡村干部 12.1089181827
+富庆 13.2075304714
+壬午日 12.8020653633
+千招 13.2075304714
+高一箭 12.2912397395
+万向 10.4349417492
+荣禧堂 12.5143832909
+萨缪尔森 10.765183436
+云官 11.2616203224
+称颂 9.37888907493
+编年史 9.63799777493
+君主政体 9.72629038208
+解调器 13.900677652
+银制 10.9562386728
+张灯结彩 10.604840786
+溃疡面 12.8020653633
+万名 8.52078029844
+异乡 10.3743171274
+互联 10.4349417492
+若干处 12.1089181827
+末座 12.1089181827
+伤口处 11.4157710022
+四千余 11.0674643079
+合同条款 11.1280889297
+代数学 10.0088573539
+托莱多 11.4157710022
+迪肯 12.8020653633
+枇杷树 13.2075304714
+对外劳务 12.8020653633
+无锡人 10.4041700905
+流星雨 10.7226238216
+事实 6.28587228726
+万吨 6.14533883913
+由浙川 13.2075304714
+天蝎星 13.900677652
+棕油 10.4666904475
+睡大觉 10.7226238216
+标统 11.9547675029
+言三藏 12.8020653633
+新开设 13.900677652
+标绘 11.8212361103
+拷贝机 13.900677652
+张峰 10.9049453784
+赵惟一 13.2075304714
+隋废六 13.2075304714
+酿造厂 12.5143832909
+营业网点 9.01032852375
+祸从天降 11.8212361103
+秦大人 11.1280889297
+于证圣 13.2075304714
+堆上去 13.900677652
+陕甘 9.29550746599
+四五级 13.2075304714
+福海县 13.900677652
+微带 11.0103058941
+基罗加 12.8020653633
+索罗 11.7034530746
+末年 7.36980002425
+法库县 13.2075304714
+构造地震 12.5143832909
+罗塞斯 12.5143832909
+胶着状态 10.4994802703
+垃圾车 11.0674643079
+汲引 11.9547675029
+黄疸 9.54396882529
+适航证 12.2912397395
+恩波利 13.900677652
+咏史诗 12.8020653633
+张岩 12.2912397395
+廉江 12.1089181827
+微幅 9.04864738806
+门多萨 11.7034530746
+护理人员 11.9547675029
+布龙 12.2912397395
+张岱 9.44633035572
+林同炎 12.5143832909
+交流活动 10.3171587135
+模铸 13.2075304714
+查资料 10.2630914922
+成佛作祖 12.8020653633
+朱阁 13.900677652
+兵不厌诈 11.2616203224
+无余 10.4666904475
+汤姆 10.0505300503
+自我调节 10.4666904475
+末席 12.5143832909
+窗门 11.5027823792
+奥布莱恩 13.900677652
+重点保护 9.63799777493
+宇文融 11.9547675029
+高岭石 10.3743171274
+宰衡 12.8020653633
+整流器 11.1926274509
+檐前 10.8561552143
+万块 10.1871055853
+喝采声 12.1089181827
+妇产科 9.62401153296
+玉帝差 12.5143832909
+百万千瓦 11.1280889297
+开创者 10.0294766411
+张彩 13.900677652
+拼读 13.900677652
+张彬 13.900677652
+文学青年 11.8212361103
+喇蛄 13.2075304714
+梁焘 13.2075304714
+星级饭店 12.5143832909
+东向北 12.2912397395
+喝醉 8.98069672615
+印模膏 13.900677652
+新出土 12.2912397395
+银元 8.66956903512
+保险丝 11.1280889297
+租出 12.5143832909
+上去 6.43159376705
+庭园 9.37888907493
+银光 10.0505300503
+铁肩担道义 13.900677652
+甘蔗 7.55328844232
+炎酷 13.900677652
+大变样 11.5027823792
+沙坡头 11.5027823792
+角色扮演 11.5027823792
+税管 13.900677652
+阙失 12.8020653633
+大为改观 10.3743171274
+马罗姆 13.2075304714
+出奇制胜 10.2117981979
+皮棉 10.8561552143
+张张 11.9547675029
+张弦 11.7034530746
+三百三十一天 13.2075304714
+清越 11.5027823792
+压进来 13.2075304714
+惨绝人寰 10.9562386728
+单兵云 13.900677652
+付之一笑 13.2075304714
+万圆 13.900677652
+承续 12.8020653633
+蓝马鸡 11.0103058941
+中国注册会计师协会 11.2616203224
+承继 10.1164880181
+东向南 11.8212361103
+吴为听 12.2912397395
+入学率 10.8096351986
+陈请 12.2912397395
+援助国 10.0294766411
+张开 8.01179969364
+上司 8.87023973058
+微差 13.2075304714
+媒介体 13.2075304714
+上叶 12.1089181827
+上台 8.170577869
+万场 13.900677652
+洞庭湖 8.78268383956
+成圣王 13.2075304714
+反间之计 11.5027823792
+德比 10.6818018271
+大山深处 12.1089181827
+上古 8.82550383674
+交流中心 10.2630914922
+改取 12.2912397395
+且不论 10.9049453784
+援助团 12.8020653633
+上口 11.1926274509
+图纸 9.23723855786
+经营层 13.2075304714
+保险人 10.533381822
+银凤 13.900677652
+儿童公园 11.9547675029
+安齐奥 12.5143832909
+短期信贷 12.1089181827
+阙如 13.900677652
+陆启贤 12.5143832909
+物阜民丰 12.2912397395
+细胞液 12.5143832909
+广泛性 10.4041700905
+盘山县 12.1089181827
+一下子脸 12.8020653633
+斯科 11.1280889297
+普世合 13.2075304714
+知名商标 13.900677652
+黑色人种 12.5143832909
+低微 9.96885201925
+上区 11.598092559
+南珠 10.0720362555
+别处 7.97108850859
+鲁班 10.765183436
+大不了 8.89004235788
+相时而动 13.2075304714
+漂起 12.5143832909
+竹君 12.2912397395
+皮格 12.2912397395
+生理需求 12.8020653633
+连皮 11.1280889297
+胳膊肘子 12.8020653633
+处理程序 9.98865464655
+租入 11.7034530746
+法同郡 13.2075304714
+阿里马 13.900677652
+今古奇观 11.7034530746
+银冠 12.5143832909
+八届全国人大常委会 12.1089181827
+张御 13.900677652
+泛化 12.5143832909
+喝酒 7.35964765279
+童便 13.900677652
+鲁王 9.59661255877
+宫颈 9.31571017331
+南王 11.5027823792
+喜马拉雅 8.69119149913
+马罗夫 12.8020653633
+国际交往 10.7226238216
+西京道 12.8020653633
+上午 6.24150628431
+张德 11.1926274509
+上半 10.4994802703
+链锁 13.2075304714
+吉大港 11.2616203224
+特克斯河 11.2616203224
+上升 5.13117053195
+上十 13.2075304714
+推迟 7.92686804011
+柯拉斯 13.2075304714
+幼儿所 13.900677652
+泮汤温泉 12.8020653633
+清贫 10.2371160058
+努比亚 10.642581114
+波纳尔 13.900677652
+泛区 12.5143832909
+上卷 9.09665660724
+皮桦 11.8212361103
+罗马字 12.2912397395
+每战必殆 13.900677652
+张得 10.8096351986
+在册 11.1926274509
+无事 8.25170341381
+清贵 12.1089181827
+调酒 13.900677652
+反向运动 12.5143832909
+庄太后 9.28555713513
+上万间 13.900677652
+纯碱 9.4233408375
+在内 6.15914406269
+红鹤 12.5143832909
+窦泰 12.5143832909
+霓虹 11.8212361103
+圩场 10.8096351986
+卓有建树 12.8020653633
+无罪释放 11.8212361103
+死里逃生 9.87532596124
+京戏 11.1926274509
+福利事业 10.9049453784
+科普特 11.0674643079
+张平 9.21854642485
+红鹰 13.2075304714
+几点钟 11.4157710022
+瓦萨 11.1280889297
+依我看 9.26594866375
+鼻部 10.4666904475
+几幕 13.2075304714
+反攻 8.0229418702
+南洋杉 11.0674643079
+五六万匹 13.2075304714
+航海图 10.2371160058
+陈炯明 9.91169360541
+上劲 10.604840786
+甜而不腻 13.2075304714
+下士 10.4349417492
+仙露明珠 13.2075304714
+数据通道 12.8020653633
+鲁特 9.44633035572
+朗达 12.2912397395
+南特 10.4994802703
+蒲松龄 10.9049453784
+红鸡 11.9547675029
+中央社 10.8096351986
+切分音 12.5143832909
+近人 9.94943393339
+苏托夫 13.900677652
+电业局 11.9547675029
+劝起 13.900677652
+宁远州 13.900677652
+新航 13.900677652
+设计所 12.1089181827
+目的论 10.765183436
+一百八十度 11.1926274509
+中国南极长城站 12.2912397395
+连着 8.67493097826
+数据传输 10.604840786
+生物芯片 13.2075304714
+删改 10.533381822
+富热隆 13.2075304714
+孟津之 13.2075304714
+天崩地陷 12.8020653633
+陈老爷子 11.7034530746
+北京日报 11.4157710022
+张帆 11.598092559
+印空军 11.0103058941
+肯在 12.2912397395
+霍尔丹 11.598092559
+拘出 13.2075304714
+拜占庭 10.3171587135
+鲁爷 13.900677652
+莫尼埃 13.2075304714
+伯德特 12.2912397395
+委弃 12.5143832909
+汤子 12.5143832909
+四五米 11.3357282945
+烧起 11.1280889297
+圩垸 12.1089181827
+纯种 10.8096351986
+母城 12.5143832909
+春风来 12.1089181827
+今年年初 8.58255765813
+孙海便 13.2075304714
+占有者 10.4041700905
+上列 11.8212361103
+边缘化 10.2897597393
+上刑 13.900677652
+上划 10.765183436
+微尘 11.2616203224
+向无此例 13.900677652
+张延 12.1089181827
+鲁狗 12.8020653633
+负笈 11.9547675029
+张建 9.89334446674
+宗乃立 13.2075304714
+反方 13.2075304714
+木马计 13.900677652
+插进来 9.82314020807
+丰田 8.63798746307
+京报 9.65218240993
+闰年 10.8561552143
+见见面 10.3743171274
+万国 9.35738286971
+无以 9.12155415886
+上到 9.61021821083
+非常任 12.8020653633
+浙西 9.12999302751
+狩野 11.5027823792
+金融信息 10.7226238216
+怎办 10.9049453784
+照葫芦画瓢 11.8212361103
+枝丫 11.8212361103
+租借 9.29550746599
+筒状 10.3171587135
+铜梁县 12.8020653633
+搭伙 11.1280889297
+清谈 10.4666904475
+喝道 7.51211624643
+绝无此事 13.900677652
+上紫云 13.2075304714
+张思正 13.2075304714
+讽刺 7.91171623509
+上前 6.97018288602
+王庆只 12.5143832909
+谁是谁非 10.9562386728
+安萨里 11.4157710022
+务须 10.2371160058
+拷贝数 13.900677652
+珠托 13.900677652
+库诺尔 12.1089181827
+红麻 10.604840786
+插齿机 13.2075304714
+张庆 11.9547675029
+胡安岛 13.900677652
+张庄 12.8020653633
+南犯 9.48183704418
+鼻通 13.900677652
+综丝 13.2075304714
+调味品 9.72629038208
+瓦蓝 11.8212361103
+过河拆桥 10.9562386728
+贵人相助 13.900677652
+浑善达克沙地 12.8020653633
+张店 10.9049453784
+张庚 12.5143832909
+微山 11.598092559
+周老爷子 13.2075304714
+综上 10.2371160058
+末尾 9.53122979951
+张府 11.1280889297
+鼻音 10.7226238216
+微安 12.5143832909
+测微器 12.5143832909
+东村 11.1280889297
+南界 9.36807815882
+但秀莲 12.2912397395
+发糕 13.2075304714
+破损处 11.7034530746
+缩小差距 12.5143832909
+清话 12.5143832909
+如牛负重 13.900677652
+万元 5.31526522158
+析产 12.8020653633
+个人观点 9.93038573842
+瓦茨 11.8212361103
+赞颂 9.89334446674
+静观其变 10.604840786
+万克 13.900677652
+大有裨益 10.604840786
+衣修午 13.2075304714
+魏国公 10.765183436
+张奂 12.5143832909
+相宇中 12.2912397395
+貂鼠 11.4157710022
+帷握 13.900677652
+高新产品 13.2075304714
+标签 9.20019728618
+万兽 13.2075304714
+鲁番 11.7034530746
+反戈 11.598092559
+暗沉沉 11.598092559
+乐善堂 13.900677652
+摩肩 12.1089181827
+银坑 11.9547675029
+东来 9.20019728618
+掩盖真相 13.2075304714
+依法治理 11.7034530746
+配给量 13.2075304714
+东条 11.598092559
+汤尔 13.900677652
+半老徐娘 12.1089181827
+反战 9.91169360541
+东杨 13.2075304714
+万全 10.2117981979
+在场 7.94743431769
+鲁巴语 12.5143832909
+依法处理 11.2616203224
+张大 8.50705010562
+席上之珍 13.900677652
+补课费 12.8020653633
+张天 13.2075304714
+讽喻 10.7226238216
+西蒙 9.44633035572
+硬化性 11.8212361103
+激化 8.76487921493
+艾森豪 13.900677652
+荆湖南 11.5027823792
+推辞 8.47572763449
+微寒 11.7034530746
+鸡啼 10.533381822
+东有 9.63799777493
+桐梓 11.5027823792
+偷空 11.9547675029
+清议 10.0505300503
+趋附 12.8020653633
+银圆 11.9547675029
+万儿 13.900677652
+全聚德烤鸭店 12.2912397395
+庄严肃穆 10.4041700905
+吴为刚 12.5143832909
+秦二叔 13.2075304714
+侵害 8.39941944143
+地支 10.2897597393
+日记本 11.2616203224
+高价位 10.4666904475
+反扑 9.53122979951
+素菜 10.533381822
+南田 11.9547675029
+迪茨 12.5143832909
+东木 11.2616203224
+决算表 13.2075304714
+需要 4.3444806435
+不过意 11.4157710022
+劳动力 6.67738197241
+升旗手 13.900677652
+反击战 10.0720362555
+竹刻 11.5027823792
+末子 11.8212361103
+美国联邦储备委员会 9.74179456862
+暗沟 12.1089181827
+博学多闻 12.2912397395
+银基 11.1280889297
+上唇 10.0940151622
+五短身材 11.4157710022
+中技 10.6818018271
+洋金花 13.2075304714
+运输勤务 13.2075304714
+母卞氏 13.2075304714
+政变者 13.900677652
+开发业 13.2075304714
+划清界限 10.604840786
+经典作品 11.1280889297
+万出 13.900677652
+脑机制 13.2075304714
+乳液聚合 11.4157710022
+业务精 13.900677652
+反抗 7.02132184752
+树叶儿 11.9547675029
+暗河 9.48183704418
+棕榈 9.35738286971
+万几 11.1280889297
+白话文 10.4994802703
+李信 8.28754954559
+雍熙 10.5684731418
+反折 11.8212361103
+高速数据 13.900677652
+拉腊峰 13.900677652
+东林 8.88339781516
+拼贴 11.2616203224
+咕噜噜 10.8096351986
+多万千克 12.8020653633
+老少皆宜 13.900677652
+京族 11.1926274509
+知名演员 11.4157710022
+万军 11.8212361103
+怒目而视 11.1280889297
+耍嘴皮子 11.7034530746
+八十万元 12.8020653633
+巴厘巴板 13.900677652
+真空泵 11.8212361103
+报国志 13.900677652
+万册 10.0940151622
+微孔 11.1280889297
+带进来 10.2630914922
+果树园 12.8020653633
+花莲县 10.9049453784
+纯纯 13.2075304714
+叉叉 11.598092559
+桐树 11.3357282945
+内蒙古 7.06013112269
+故作 9.03314320152
+反拍 12.8020653633
+季节 6.72289523578
+张妈 11.3357282945
+丰特 13.2075304714
+罗伯斯庇 13.2075304714
+模量 10.8561552143
+租地 8.43684584695
+克集庆 12.2912397395
+油机 12.8020653633
+细胞毒 11.9547675029
+攀援 9.63799777493
+竹剑 12.8020653633
+总资产 7.8604229407
+红香 11.7034530746
+初步判断 10.8561552143
+沙布洛 12.5143832909
+抽回 10.6818018271
+代数式 11.0674643079
+银器 10.0940151622
+挺得 10.8096351986
+岳乐 9.0884932966
+饱尝 10.4994802703
+现实性 10.0294766411
+千百样 13.2075304714
+红顶 11.9547675029
+数一数 11.598092559
+东南地区 9.65218240993
+阜新蒙古族自治县 12.2912397395
+触景生情 10.604840786
+东晋 7.76079309975
+徐国强 9.55687223012
+暗绿色 10.5684731418
+可争议 13.900677652
+激剧 12.8020653633
+于柔靡 13.900677652
+荣成龙 12.8020653633
+二十六个 12.2912397395
+验关 12.2912397395
+二氢吡啶 13.900677652
+棕树 12.8020653633
+名歌星 13.900677652
+产量比 11.4157710022
+吴晓东 12.1089181827
+波浪发 13.900677652
+评论部 13.900677652
+钉牢 11.9547675029
+瓦舍 10.9562386728
+庭内 13.2075304714
+餐点 12.8020653633
+从木梁 12.2912397395
+激切 11.1926274509
+暗流 9.23723855786
+阿炳妈 9.27570483869
+数据表示 11.2616203224
+小市镇 12.5143832909
+市场监管 9.00283785202
+捕鲸船 11.8212361103
+吴哥寺 11.8212361103
+岳丈 11.0103058941
+东明 11.0674643079
+万倍 9.89334446674
+上品 9.46986085313
+指导书 12.5143832909
+竹叶 10.2117981979
+承租 10.7226238216
+海阔天空 11.1280889297
+打肿脸充胖子 11.8212361103
+聚众斗殴 12.1089181827
+文学作品 8.9102450652
+严素使 13.2075304714
+艺术论文 13.900677652
+等温过程 11.7034530746
+首期款 12.5143832909
+清洁卫生 10.4041700905
+怕累 12.8020653633
+调味剂 11.9547675029
+牦牛肉 11.8212361103
+爬山涉水 12.8020653633
+时装戏 12.8020653633
+东映 13.900677652
+知觉力 13.900677652
+有界性 13.900677652
+口味重 12.2912397395
+抗拒从严 11.4157710022
+银团 10.3171587135
+阿炳如 12.8020653633
+罗马尼 13.900677652
+迭嶂层峦 13.900677652
+达芬奇 11.7034530746
+张士 11.7034530746
+反推 11.9547675029
+扩散作用 11.9547675029
+无为 9.01787572939
+筒瓦 11.9547675029
+后悔不已 12.2912397395
+爱慕者 13.900677652
+劳动厅 13.900677652
+发布者 11.5027823792
+高高大大 11.598092559
+深深房 10.3453295905
+南瓜 9.00283785202
+兴衰成败 12.8020653633
+倾诉者 11.4157710022
+高俅领 13.2075304714
+和政制 13.900677652
+儿童音乐 12.8020653633
+意欲何为 11.0103058941
+鲁瓦 11.598092559
+标竿 12.5143832909
+凌霄殿 12.8020653633
+答腔 11.0674643079
+吓唬吓唬 11.1926274509
+混合物 8.50705010562
+东曹 12.2912397395
+负累 10.9562386728
+七周 10.2897597393
+张清飞 13.2075304714
+金沙江畔 13.2075304714
+肯出 11.2616203224
+热敏电阻 12.8020653633
+令人切齿 13.900677652
+斯维 11.9547675029
+慰问 8.87023973058
+相均衡 13.900677652
+最底层 9.85762638414
+东暖 12.8020653633
+纯美 11.4157710022
+肯再 12.8020653633
+亿万个 12.5143832909
+岳云 12.1089181827
+枯竭 8.90346537821
+欢欣鼓舞 10.3453295905
+指导价 9.30555780184
+搭积木 12.2912397395
+找回去 13.900677652
+挨近 10.3743171274
+上告 10.1871055853
+火麒麟 13.2075304714
+十五六米 13.2075304714
+平头正脸 13.2075304714
+宝光寺 13.2075304714
+惜老怜贫 12.2912397395
+芝兰 11.598092559
+暗淡 8.46259834305
+反对声 12.5143832909
+激动 6.58213810341
+删掉 10.9049453784
+不苟言笑 10.0294766411
+吴为原 13.2075304714
+带头人 10.4994802703
+激励 7.5393751744
+上周 5.89531058466
+愧杀 13.2075304714
+红颜 10.0294766411
+斯纳 11.7034530746
+莫尼克 13.900677652
+水真腊 12.8020653633
+李麦听 11.0674643079
+张学 11.3357282945
+一亿多年 12.8020653633
+千百次 11.7034530746
+末始 13.900677652
+清规 10.9562386728
+激光 7.80485308954
+不延误 13.900677652
+奥里萨 11.1280889297
+上垒 12.1089181827
+出此下策 11.1926274509
+微妙 8.12302532875
+用项 13.900677652
+万千 9.23723855786
+杨树皮 12.8020653633
+种族主义 9.93038573842
+瓦楞子 13.900677652
+京朝 13.900677652
+万卷 10.765183436
+拉彼鲁兹 11.8212361103
+盖毕尔 12.8020653633
+批下来 10.7226238216
+暗渠 12.2912397395
+放鞭炮 10.3743171274
+鸡圈 11.9547675029
+中国企业评价协会 13.900677652
+垃圾袋 12.1089181827
+都监王 12.5143832909
+红魔 13.900677652
+拼过 12.8020653633
+张子 10.5684731418
+激进主义 11.9547675029
+是非不分 12.8020653633
+万卡 13.2075304714
+委婉 8.78268383956
+反思 8.53003962385
+负约 12.8020653633
+畿辅 9.28555713513
+张孟 12.8020653633
+闹得 8.49350588052
+凌空飞行 13.2075304714
+莫特森 13.900677652
+肯切 12.8020653633
+散散漫漫 13.2075304714
+斤斤 11.9547675029
+一群群 10.2897597393
+换肩 13.2075304714
+茹家庄 12.8020653633
+上城 8.99540287354
+甜甜蜜蜜 11.4157710022
+吱吱声 12.8020653633
+抽象代数 11.7034530746
+胆战心惊 9.80633308975
+冰蚕 13.900677652
+航海历 12.8020653633
+连片 9.98865464655
+纷起 10.0720362555
+呼气 9.6811699468
+由彰义 13.2075304714
+漳县 13.2075304714
+五两余 13.2075304714
+闹心 11.598092559
+京杭 11.9547675029
+标示 9.7898037878
+万匹 10.4994802703
+何志孔 12.5143832909
+戈公振 12.5143832909
+预聚物 13.900677652
+反恐 9.54396882529
+鸡块 11.8212361103
+这阵子 11.2616203224
+东支 9.91169360541
+喝问 9.69598503258
+丰臣氏 13.900677652
+求善 12.5143832909
+希腊籍 13.900677652
+万发 12.1089181827
+皮氏 12.5143832909
+庭前 11.3357282945
+方巾 10.0505300503
+猫肉 12.5143832909
+万变 12.5143832909
+实不相 13.900677652
+上圈 12.2912397395
+益寿延年 13.2075304714
+万双 12.2912397395
+纤维网 12.8020653633
+斤数 12.8020653633
+新苗 12.2912397395
+万叶 11.4157710022
+切音 12.8020653633
+标称 11.5027823792
+上地 9.96885201925
+雍王 12.8020653633
+鼻镜 12.1089181827
+反悔 10.2371160058
+万句 12.8020653633
+万古 10.0940151622
+纯系 10.642581114
+李光头 12.8020653633
+罗马式 10.5684731418
+激出 11.4157710022
+东旭 13.2075304714
+需设 12.2912397395
+万只 9.84023464143
+会点 11.8212361103
+主席职位 12.8020653633
+上坟 10.2371160058
+国画院 13.900677652
+冯兰洲 13.2075304714
+张宪 11.8212361103
+同素异形 11.2616203224
+去向不明 11.598092559
+三合板 13.900677652
+连狗 11.2616203224
+万历 7.51043698491
+土地划拨 12.5143832909
+张家 9.32596667347
+少林寺 8.9102450652
+薄情郎 13.900677652
+王荆公 11.9547675029
+张宾 12.1089181827
+冠心病人 13.2075304714
+鸽哨 11.9547675029
+中国内蒙古自治区 9.98865464655
+售房款 12.8020653633
+张宁 12.8020653633
+张宇 11.9547675029
+东新 11.9547675029
+侵夺 9.93038573842
+万县 10.3453295905
+更深人静 12.2912397395
+东施 13.2075304714
+执行者 10.642581114
+暗滩 11.5027823792
+东方 5.99449881158
+扎起来 11.3357282945
+中国农工民主党 10.7226238216
+张宗 11.598092559
+纯粹 7.35820569147
+张定 11.0103058941
+亡灵 9.30555780184
+运输局 11.8212361103
+上坡 9.75754292558
+登位 11.1926274509
+张宝 10.604840786
+圩区 10.4666904475
+连猜 13.900677652
+地主阶级 8.93783302172
+珀西瓦尔 13.2075304714
+异体 10.1394775363
+细胞株 12.2912397395
+右肺 12.8020653633
+牛痘苗 12.8020653633
+苏鲁皖 12.2912397395
+体验版 13.2075304714
+左利者 12.8020653633
+傅淖 12.8020653633
+投资银行 8.98802276624
+细胞核 9.07236391467
+市政协 9.85762638414
+朗讯 13.2075304714
+贝拉 9.72629038208
+反意 12.5143832909
+隐然作痛 13.900677652
+竹内 12.2912397395
+打听一下 10.1630080337
+切除 8.55357012126
+登了 11.3357282945
+反感 8.30596627237
+斯米 13.2075304714
+牙钻 13.900677652
+加廷根 13.900677652
+上回 9.84023464143
+漱洗 11.4157710022
+面目全非 9.82314020807
+兖州煤业 9.96885201925
+几何体 13.2075304714
+万分 8.20358416547
+晨光熹微 12.8020653633
+万刀 13.900677652
+闽语 13.2075304714
+竹凳 12.8020653633
+负翁 13.900677652
+上国 10.4349417492
+上图 10.9562386728
+张威 12.5143832909
+切尔诺贝利核电站 11.9547675029
+呛水 12.5143832909
+谒拜 13.2075304714
+暗潮 11.2616203224
+卑劣地 13.900677652
+中资股 10.533381822
+五风十雨 13.900677652
+朗诵 9.01032852375
+穷日子 11.598092559
+朗读 10.2897597393
+张娜 12.5143832909
+常回来 12.8020653633
+登临 10.3743171274
+白熬 12.8020653633
+戴克里 11.1926274509
+蕴藉 10.9562386728
+重型机械 10.0294766411
+超距作用 11.9547675029
+迈拉 13.900677652
+缩脖子 11.7034530746
+西夜城 11.4157710022
+南监 12.1089181827
+转租 11.0674643079
+南盟 13.900677652
+吴友如 12.8020653633
+事与愿违 10.3171587135
+四五碗 13.2075304714
+现象学 10.3453295905
+种天然 13.2075304714
+满怀希望 10.8561552143
+杨四郎 13.900677652
+草料场 11.1280889297
+万勿 10.2630914922
+华夏文化 10.642581114
+闹市 9.55687223012
+波纳契 13.900677652
+丘比特 11.3357282945
+天山南路 11.0674643079
+鲁直 13.900677652
+摔断了 11.1926274509
+连环 9.22784881751
+登上 7.41451686303
+罗马市 13.900677652
+李德全 9.38981814546
+幼儿期 11.1280889297
+机关算尽太聪明 11.8212361103
+黑骏马 11.1280889297
+坦诚相待 13.900677652
+二十多 10.1164880181
+马罗尼 13.900677652
+无遮挡 12.5143832909
+莫尼卡 13.2075304714
+人参果 10.8096351986
+新开路 12.5143832909
+上海博物馆 10.9562386728
+委实 9.98865464655
+森林王国 13.900677652
+皮浪 13.2075304714
+免疫诊断 12.5143832909
+马上转 13.900677652
+内部网 12.2912397395
+邪不胜正 13.2075304714
+泻出 12.8020653633
+市政厅 9.74179456862
+锅炉管 13.900677652
+笔杆 10.765183436
+都崇信 12.8020653633
+蓬元帅 11.0674643079
+脂肪乳 13.900677652
+掂出 11.9547675029
+连珠 10.1164880181
+交口赞誉 12.5143832909
+万劫 11.2616203224
+水烟袋 9.74179456862
+北境 10.8561552143
+暴土 12.5143832909
+睡午觉 10.9562386728
+葡语 11.5027823792
+超阶级 11.7034530746
+阿美军 11.598092559
+标杆 8.87023973058
+香岛 13.900677652
+装机量 12.5143832909
+岳华 13.2075304714
+冲沙闸 12.1089181827
+连氏 12.5143832909
+山静居 12.8020653633
+此恨绵绵 13.900677652
+帕烈格 13.900677652
+纤维光学 12.1089181827
+本价 12.8020653633
+业务性 13.900677652
+何晏叹 13.2075304714
+崔隐甫 13.2075304714
+翎翅 13.2075304714
+开发办 13.2075304714
+马头鱼 13.900677652
+称臣 9.25628675283
+专制制度 9.63799777493
+隆尧 12.5143832909
+清韵 11.9547675029
+南楼 12.1089181827
+清音 10.642581114
+隔河相望 11.1926274509
+华南农业大学 12.8020653633
+北壁 11.7034530746
+部长会议 9.46986085313
+登出 10.5684731418
+底舱 9.87532596124
+追加预算 12.1089181827
+三千米 13.2075304714
+管壳 11.9547675029
+犹太裔 13.900677652
+流芳百世 10.9562386728
+不限 9.96885201925
+称重量 13.900677652
+多普达 12.2912397395
+标有 9.80633308975
+管壁 9.93038573842
+抽噎 10.8561552143
+互相促进 11.0674643079
+狠斗 13.900677652
+掌禁旅 12.8020653633
+暗火 12.8020653633
+吴为一 11.1280889297
+雨中散步 13.900677652
+丰满 8.43261751084
+免了 13.900677652
+暗灰 12.8020653633
+极地气候 11.2616203224
+标本 8.19689517732
+红藤 12.8020653633
+吴为仰 13.2075304714
+竹中 13.900677652
+北堂 11.8212361103
+墙式 12.8020653633
+逄安 12.8020653633
+中坝镇 13.2075304714
+德伍德 12.8020653633
+间歇期 11.7034530746
+岳叔 13.2075304714
+棒子面粥 12.2912397395
+宫苑 10.2371160058
+磁感应 10.2117981979
+清静 8.6803218269
+民族乐派 11.3357282945
+金融保险 9.04864738806
+电料 13.2075304714
+压缩饼干 11.8212361103
+红藻 10.4666904475
+巫邪 10.9049453784
+竹下 12.8020653633
+连治 13.900677652
+常万全 13.900677652
+东篱 12.1089181827
+高标准 9.87532596124
+帆船 8.91707103027
+糊涂思想 12.8020653633
+恐龙蛋 12.8020653633
+内啡肽 12.5143832909
+竹东 12.1089181827
+岳口 12.8020653633
+通缉犯 13.900677652
+拼配 11.8212361103
+直接插入 12.8020653633
+暗点 13.900677652
+报时器 13.900677652
+竹乡 12.8020653633
+华氏度 12.5143832909
+竹书 11.3357282945
+鹰爪 11.0103058941
+印度河 8.78268383956
+第二炮兵 10.604840786
+切要 13.2075304714
+示巴 13.900677652
+二十九名 11.9547675029
+北塘 10.9562386728
+有职有权 12.5143832909
+弗雷儒斯 13.900677652
+甚急 9.94943393339
+反经 13.900677652
+北塬 12.1089181827
+努美阿 11.8212361103
+揭幕战 13.2075304714
+皮特 10.0720362555
+宫花 12.2912397395
+画传 12.2912397395
+反绑 12.2912397395
+轻重 8.28390655431
+来殿帅 13.900677652
+香山 9.53122979951
+毕业论文 11.598092559
+标枪 9.77354326693
+黄翅大 13.2075304714
+顺序排列 10.3743171274
+蒙冤受屈 13.2075304714
+对华关系 11.598092559
+廉价品 13.2075304714
+清雅 10.1164880181
+多种多样 8.31718134319
+鲁桑 13.2075304714
+打领带 12.8020653633
+楚雄州 12.5143832909
+榴莲果 13.2075304714
+斯托 10.3453295905
+聚乙二醇 11.9547675029
+有恒心 11.5027823792
+西尔斯 11.5027823792
+许翰 11.9547675029
+期会 12.8020653633
+霍闻海 11.598092559
+陶冶情操 11.7034530746
+酒疯 13.2075304714
+味精 8.78268383956
+好逸恶劳 12.2912397395
+规避 7.91674137129
+夹着 9.46986085313
+波福尔 13.2075304714
+汇合点 11.7034530746
+电影摄影机 11.9547675029
+三班倒 11.8212361103
+鄂霍 12.8020653633
+一父 13.2075304714
+比斯开 12.2912397395
+巴雷特 13.2075304714
+巴基斯坦 8.0229418702
+开发史 11.8212361103
+吐方 13.2075304714
+奥诺费 13.900677652
+佳茗 12.1089181827
+田国丈 13.2075304714
+肠溃疡 13.900677652
+饶国华 13.2075304714
+清障 13.2075304714
+香川 12.2912397395
+容情 11.0103058941
+从而 5.17793477765
+讲面子 13.900677652
+坚韧性 13.2075304714
+嵌镶 11.8212361103
+四千块 13.900677652
+陈省身 11.5027823792
+析取 12.2912397395
+西里伯斯 13.2075304714
+黄文炳 9.55687223012
+主持人 7.4407731976
+印度洋 7.65651075131
+越多越好 10.1630080337
+候补 9.14708746087
+刑事案件 9.27570483869
+大西海子 13.900677652
+索林 13.2075304714
+文化冲突 12.8020653633
+管委 11.3357282945
+普世信 13.2075304714
+佛蒙特州 12.1089181827
+谢文东 13.900677652
+咨询性 12.1089181827
+保险商 12.8020653633
+捶床捣枕 13.900677652
+抢帽子 12.8020653633
+消化吸收 9.66657114738
+日本式 11.1926274509
+斯拉 11.1280889297
+开发区 8.5488195185
+东站 10.8561552143
+北外 12.1089181827
+拉玛一世 12.2912397395
+宫腔积 13.2075304714
+广陵城 13.2075304714
+弄得清 13.2075304714
+格林河 13.2075304714
+竹亭 13.2075304714
+称职 10.1871055853
+一缸水 13.2075304714
+北大 8.08356649201
+錾子 13.2075304714
+搜检 10.9049453784
+狂风巨浪 11.3357282945
+清除 7.77599426108
+松下公司 13.900677652
+反美 10.765183436
+马缰绳 12.1089181827
+炎帝 9.69598503258
+牛郎 10.7226238216
+连涨 9.6811699468
+体悉 13.900677652
+旱地农业 11.8212361103
+北头 10.533381822
+进攻型 10.4994802703
+管外 12.2912397395
+负愧 13.900677652
+红蓝 10.9562386728
+宋解放 10.2371160058
+皮猴 13.900677652
+一版 11.1280889297
+反质子 11.7034530746
+吴量恺 13.2075304714
+楚党 13.900677652
+巨幼 11.598092559
+奎斯 13.2075304714
+激于 12.2912397395
+太过谦 12.2912397395
+万全之计 12.1089181827
+那头陀 13.2075304714
+东突 11.7034530746
+迪亚巴克尔 13.900677652
+电脑设计 12.2912397395
+点焊机 13.900677652
+保存信息 13.900677652
+管好 9.72629038208
+向下倾斜 12.8020653633
+劳动和社会保障部 12.5143832909
+反法西斯战争 10.3171587135
+金银彩 12.5143832909
+承教 11.4157710022
+呼玛 11.5027823792
+皮皮鲁 13.900677652
+家常里短 13.2075304714
+音频设备 13.900677652
+李德伦 12.5143832909
+管套 13.2075304714
+诿过 12.8020653633
+祸福相倚 13.2075304714
+堪舆 10.9049453784
+贺秀莲 11.1280889297
+清阳 12.1089181827
+巨幅 9.56994431169
+皖南事变 9.62401153296
+花枝招展 10.3453295905
+非常重视 9.04086524761
+皮炎 9.85762638414
+丰沛 9.46986085313
+丰沙 11.0103058941
+万佛 12.8020653633
+万余 7.77818484246
+血证 12.1089181827
+金银岛 11.0103058941
+香庐 9.72629038208
+万位 12.2912397395
+裁判席 13.900677652
+示弱 9.65218240993
+蘅塘退士 12.8020653633
+四五支 13.2075304714
+三亿三千万余美元 13.2075304714
+安为先 13.900677652
+新开通 12.2912397395
+避祸就福 13.900677652
+岳全 12.1089181827
+不恰当地 12.2912397395
+乌力吉 13.2075304714
+四千名 13.2075304714
+摩诃 9.66657114738
+香庵 12.8020653633
+安家费 11.7034530746
+万众 10.7226238216
+杨延辉 13.2075304714
+登台 8.93783302172
+肯下 12.2912397395
+烧钱 10.765183436
+卡林西亚 13.2075304714
+藏珍 13.900677652
+扑下来 11.7034530746
+乱蓬蓬 10.3171587135
+无欲则刚 12.8020653633
+白公胜 13.2075304714
+一语双关 12.8020653633
+子启继 12.8020653633
+万伏 10.604840786
+负担 7.05479777671
+枝城 10.9562386728
+丰泰 11.8212361103
+隆平 10.9562386728
+巨川 12.1089181827
+丰泽 12.2912397395
+一百三十余篇 13.2075304714
+隐藏住 13.900677652
+肯为 11.0674643079
+混合液 11.0674643079
+离世绝俗 13.900677652
+旧案 11.7034530746
+防避 12.8020653633
+万俟 12.2912397395
+纯情 11.2616203224
+香帅 11.5027823792
+魏少游 13.2075304714
+拥兵自固 13.900677652
+鲁比 9.91169360541
+墓葬 8.33233314821
+孔气鸣 12.2912397395
+高标号 13.2075304714
+优降糖 13.900677652
+轴流式 11.2616203224
+切诊 11.8212361103
+唐式飞 13.900677652
+朱彝尊 10.9049453784
+扶立 12.2912397395
+丰水 10.9562386728
+冶金工业部 13.900677652
+四五斤 13.2075304714
+积极关注 9.32596667347
+代课 11.1280889297
+东移 9.5062284973
+亿万元 12.5143832909
+划分界线 13.900677652
+客星 11.5027823792
+少数几次 13.900677652
+目空一切 10.9562386728
+尚博尔 13.900677652
+败絮其中 12.8020653633
+上饶市 11.7034530746
+石碇 13.2075304714
+锱铢较量 13.900677652
+紫绶金章 12.2912397395
+无休无止 10.533381822
+肯于 12.5143832909
+连滚 12.5143832909
+候诊 13.2075304714
+国家民族事务委员会 12.8020653633
+肿骨鹿 12.1089181827
+一牵 13.900677652
+开场戏 12.8020653633
+高氯酸 11.3357282945
+庭上 11.3357282945
+肯亚 13.900677652
+底肥 13.900677652
+一九八二年 11.9547675029
+泥炭土 12.2912397395
+万例 11.2616203224
+红螺 12.5143832909
+抄录在 13.900677652
+夹丝 13.2075304714
+切记 9.94943393339
+四五日 11.598092559
+蓝飞才 13.2075304714
+瓦卢娃 12.8020653633
+格列佛 12.2912397395
+南段 8.98802276624
+甘蒙 13.900677652
+登山家 13.900677652
+陈佳贵 11.3357282945
+奖项 8.95903522937
+模进 12.8020653633
+小辣椒 12.8020653633
+往南 9.04864738806
+周树人 13.900677652
+十八余里 13.2075304714
+恶有恶报 11.9547675029
+北宁 11.598092559
+碳素钢 10.9049453784
+北宋 6.86277168853
+北安 10.2117981979
+红虫 12.8020653633
+北宗 11.8212361103
+混合法 12.2912397395
+何维新 13.900677652
+巨岩 10.4994802703
+奎松 11.9547675029
+管家 7.83225206373
+水解蛋白 12.2912397395
+链钢 13.900677652
+精梳 10.765183436
+管宁 13.900677652
+尉领兵 13.2075304714
+管它 10.0505300503
+由此可证 13.900677652
+薰风 10.4349417492
+北宫 11.2616203224
+阻挡层 13.900677652
+打恭作揖 11.9547675029
+丰润 10.3453295905
+吆呼 13.2075304714
+混合泳 11.8212361103
+魏国之 12.5143832909
+愿心 11.0103058941
+宋端宗 12.8020653633
+拜科努尔 12.2912397395
+万世 9.77354326693
+云长恐 13.2075304714
+百余公里 10.8096351986
+析出 9.16447920358
+嫁作 12.5143832909
+巨峰 11.4157710022
+索斯 11.0103058941
+肥皂粉 13.900677652
+唐景云 12.2912397395
+万万 8.47133202302
+万一 6.91688768672
+历新政 13.2075304714
+研制开发 11.1280889297
+脂砚斋 12.5143832909
+万三 12.8020653633
+万丈 9.82314020807
+万串 13.2075304714
+底脚 12.8020653633
+殚精竭力 13.900677652
+能力差 10.3171587135
+司库员 13.900677652
+万丹 11.9547675029
+北寨 11.1280889297
+好勇斗狠 12.1089181827
+万两 9.62401153296
+库帕河 13.900677652
+找茬儿 12.5143832909
+夹生 11.0674643079
+栎木 13.2075304714
+阿德默勒尔蒂 13.2075304714
+马子充 10.3743171274
+家用车 12.5143832909
+万个 8.25523075433
+五十二年 11.1280889297
+武断乡曲 13.900677652
+购粮 12.1089181827
+不拘礼节 12.8020653633
+若期望 12.5143832909
+掌朝天 12.8020653633
+万仞 12.1089181827
+不计后果 11.5027823792
+故习 12.5143832909
+气吁吁 13.900677652
+东磁 10.8096351986
+见解独特 12.2912397395
+非上不可 13.900677652
+家童 11.598092559
+吃香喝辣 12.5143832909
+万件 9.7898037878
+氢弹 9.5186510173
+两百名 10.6818018271
+承望 10.7226238216
+龙藏 11.9547675029
+隆德 11.598092559
+蓟州牢 13.900677652
+库仑定律 10.642581114
+万份 8.98069672615
+赵郡王 13.2075304714
+红蛋 13.900677652
+黄钟律 13.900677652
+大脚板 12.5143832909
+鼻血 11.4157710022
+万代 11.1280889297
+鹅湖之会 13.900677652
+取消资格 11.8212361103
+鼻衄 11.8212361103
+模数转换器 12.8020653633
+能征惯战 11.7034530746
+肉头 12.2912397395
+齐闵王 12.5143832909
+次官 10.9049453784
+令人困惑 12.8020653633
+布阿朗 13.2075304714
+万云 13.900677652
+混合气 11.598092559
+怎么会呢 10.533381822
+郭忠恕 13.2075304714
+涉案人员 10.4349417492
+阿恩 10.7226238216
+专家系统 10.3743171274
+万二 13.900677652
+万事 9.14708746087
+瑶草奇花 13.2075304714
+有所提高 9.20932976975
+自有率 13.2075304714
+能文能武 11.9547675029
+尹常 13.2075304714
+万亿 7.06334483729
+千百盏 13.2075304714
+想来想去 8.89673134603
+呈缴本 12.2912397395
+那项 12.8020653633
+由英王 11.0674643079
+兵工厂 9.40086798165
+奖饰 13.900677652
+管子 8.93783302172
+烧锅 10.8561552143
+管孔 13.900677652
+万亭 13.900677652
+科瓦奇 13.2075304714
+白熊 11.1280889297
+万亩 8.71329184614
+沙木罕 13.2075304714
+松松软软 13.900677652
+长钉 11.9547675029
+拘于 12.2912397395
+南流 9.28555713513
+巴斯康蒂 12.5143832909
+酿造业 12.1089181827
+二十七 9.58318953844
+北岗 11.8212361103
+情感性 11.598092559
+居安思危 11.0674643079
+宫虚 13.2075304714
+经济区划 11.9547675029
+北岛 10.642581114
+巨室 11.1926274509
+切起 13.2075304714
+香墨 12.8020653633
+钉死 10.6818018271
+苇河 13.900677652
+皮皮 13.900677652
+逾期 9.53122979951
+博马舍 11.5027823792
+北岭 11.8212361103
+北岩 11.598092559
+南海 7.15779701618
+彭其抢 13.2075304714
+北岳 11.3357282945
+美男计 13.2075304714
+在位 7.37858485381
+恰好相反 10.4041700905
+佳能公司 12.5143832909
+北岸 7.28193866846
+冰晶石 12.1089181827
+仰给 11.4157710022
+斯朋 13.900677652
+韩先生 10.1871055853
+超速行驶 12.1089181827
+碎裂声 13.2075304714
+南洋 8.36728816325
+貂蝉 10.4994802703
+东缘 9.71102290995
+讨价 12.5143832909
+金玉丁香 13.2075304714
+示好 11.1280889297
+奥林匹 13.900677652
+阮咸 11.4157710022
+长城牌 13.2075304714
+轰然 9.05649056552
+耻骨 10.7226238216
+势在必然 12.1089181827
+皮盖 13.2075304714
+搞来搞去 12.2912397395
+银企 11.1926274509
+倍率 10.3743171274
+抽象名词 13.900677652
+答题 11.2616203224
+生化学家 12.2912397395
+皮相 13.2075304714
+中共中央书记处 10.8561552143
+东林西 12.8020653633
+路易斯 10.2117981979
+北峰 11.4157710022
+北京人民艺术剧院 10.4994802703
+碎屑 8.6966709649
+武藏野 12.8020653633
+无副作用 11.5027823792
+亚太地区 8.71329184614
+鲁派 12.5143832909
+二十公里 11.9547675029
+潜踪隐迹 13.2075304714
+布苏 11.3357282945
+穷折腾 12.2912397395
+香堂 11.5027823792
+时尚服饰 13.900677652
+租住 10.3453295905
+山呼海啸 11.2616203224
+接受者 10.8096351986
+擦来擦去 12.8020653633
+东翁 10.8096351986
+震撼人心 10.604840786
+弃暗投明 11.5027823792
+租佃 9.36807815882
+西多夫 13.900677652
+剩余 7.35532799164
+六间房 11.8212361103
+呼盟 11.4157710022
+东翼 11.0103058941
+南势溪 13.2075304714
+标记分子 13.900677652
+爱沙尼亚共和国 12.8020653633
+警总 13.900677652
+媒妁 12.5143832909
+腓尼基 10.4666904475
+花部雅 12.8020653633
+美不美 11.598092559
+索托 12.2912397395
+银保 10.4349417492
+连梦 13.2075304714
+念芦 11.9547675029
+普遍意义 10.4041700905
+舞弊者 13.900677652
+花印 13.900677652
+北展 13.900677652
+保障系统 10.9049453784
+承恩 10.7226238216
+墙子 13.2075304714
+完全一致 9.18217878068
+安其业 12.2912397395
+南涧 11.7034530746
+神学目的论 12.1089181827
+谒祖 13.2075304714
+北屯 13.2075304714
+察右 12.8020653633
+巨子 11.4157710022
+权重股 7.17085358149
+缩减到 11.0674643079
+五十二处 13.2075304714
+东群 11.8212361103
+北山 9.17328983326
+吕翔 11.8212361103
+人参精 13.2075304714
+艾默生 11.2616203224
+浙江农业大学 12.8020653633
+续增专 12.8020653633
+晁盖见 11.9547675029
+马三娘 13.2075304714
+南汇 9.82314020807
+打钻 13.2075304714
+购置 8.31718134319
+几件事 10.533381822
+智勇足 11.9547675029
+王邑发 12.8020653633
+南汉 10.1630080337
+王无子 12.8020653633
+分片包干 13.900677652
+御史大夫 9.17328983326
+铜浇铁铸 12.8020653633
+鲁汗 13.2075304714
+响导 10.9049453784
+博尔塔拉蒙古自治州 11.9547675029
+倩女 13.900677652
+杨小楼 11.3357282945
+佳肴 10.1630080337
+四五成 11.8212361103
+鲁江 12.8020653633
+垫脚石 11.3357282945
+预展 12.2912397395
+甚早 10.9049453784
+负方 12.8020653633
+租价 11.598092559
+火力发电 9.84023464143
+系统学 10.642581114
+各单项 13.900677652
+韦塞尔 13.900677652
+布局谋篇 12.8020653633
+在乎 8.90346537821
+讨论探究 13.900677652
+职称者 13.900677652
+开发型 12.2912397395
+改良场 13.900677652
+银两 8.39128931535
+面有喜色 12.8020653633
+特伍德 12.1089181827
+尖叫声 10.9562386728
+课由 13.900677652
+家主儿 13.900677652
+鲁氏 13.2075304714
+灶王爷 11.598092559
+银丰 10.4666904475
+门德尔松 10.9562386728
+增补本 12.2912397395
+晋明帝 12.5143832909
+天高气爽 11.9547675029
+养勇德 13.2075304714
+妍丽 12.8020653633
+多因子 12.5143832909
+北川 10.8096351986
+操舵仪 13.900677652
+在业 11.3357282945
+卡菲尔 12.8020653633
+牙槽脓肿 13.900677652
+高仁山 12.2912397395
+毫不动摇 11.1280889297
+在世 8.3285236198
+打钩 13.2075304714
+魔鬼般 12.8020653633
+强死强活 13.900677652
+抗美援越 13.2075304714
+战争史 10.1164880181
+改出 13.900677652
+望夫石 12.2912397395
+阿格达 12.8020653633
+马步水 11.8212361103
+李莲英 8.17382990439
+纯朴 9.6811699468
+徐世昌 9.04864738806
+发表演说 10.2897597393
+任集贤 13.2075304714
+史室设 13.2075304714
+四五把 13.900677652
+困惑不解 11.7034530746
+南泉 13.2075304714
+七十余颗 13.900677652
+防护服 11.1280889297
+迎风冒雪 13.2075304714
+银价 10.9049453784
+东经 7.62028181302
+倍特 11.9547675029
+蕴蓄 12.8020653633
+烟草专卖 13.2075304714
+所知 8.16733637508
+卫生洁具 12.8020653633
+管崇 13.2075304714
+特种设备 11.5027823792
+暗疮 10.8096351986
+拘传 11.8212361103
+钙拮抗剂 12.1089181827
+系统对 10.0720362555
+鲁泰 12.1089181827
+斯曼 10.642581114
+温琼 12.8020653633
+武器专家 12.8020653633
+乙醇汽油 12.5143832909
+银付 13.900677652
+檐下 9.54396882529
+张树田 13.2075304714
+暗病 13.900677652
+下九流 11.3357282945
+蛋糕店 13.900677652
+通风报信 10.3171587135
+巨婴 12.5143832909
+慵懒 10.9049453784
+五世同堂 12.5143832909
+租与 11.0103058941
+程君房 12.5143832909
+剩个 11.598092559
+天崩地裂 10.8096351986
+国防部长 8.78868986362
+在京 13.2075304714
+火眼 10.9049453784
+纯林 10.3453295905
+车把式 11.7034530746
+红肿 8.92394390956
+资本主义 6.21084898324
+南沙 9.93038573842
+皇阿玛 8.83808261895
+东线 9.27570483869
+日本学 11.9547675029
+顾杲扶 13.2075304714
+负数 9.61021821083
+编年体 9.96885201925
+碧琉璃 12.8020653633
+在于 5.80477411901
+悬梯 13.900677652
+谋为不轨 12.8020653633
+逛起来 13.900677652
+布莱 11.1926274509
+务虚 11.3357282945
+重蹈覆辙 10.4041700905
+寄过 12.5143832909
+吸上来 12.8020653633
+北庄 13.900677652
+拼音 10.1630080337
+上供 9.94943393339
+偷看 9.53122979951
+封邑制 12.5143832909
+红药 12.5143832909
+脂肪型 12.8020653633
+订车 10.642581114
+拖延战术 13.900677652
+眼快 11.598092559
+转磨 11.9547675029
+上例 11.8212361103
+帕埃斯 13.900677652
+端州 11.598092559
+北府 11.4157710022
+向雪妍 12.8020653633
+洪博里 13.900677652
+管庄 11.9547675029
+中低收入者 10.8096351986
+斯敦 13.2075304714
+桔槔 11.8212361103
+碎布 12.5143832909
+锁定目标 12.5143832909
+比基尼 11.5027823792
+大搞特搞 13.900677652
+山口智子 13.2075304714
+流回 8.97342396682
+壁报 13.2075304714
+陆田 12.8020653633
+南漂 12.5143832909
+雍正 8.33233314821
+全国文联 11.9547675029
+登基 8.69119149913
+清醇 11.9547675029
+那颜 11.1280889297
+娇嫩欲滴 13.900677652
+光前裕后 12.8020653633
+蔗糖 8.64318227995
+红茶 9.34680076038
+内聚性 12.5143832909
+同琼英 13.2075304714
+清醒 7.49876045525
+香嫩 12.5143832909
+任魏玛 11.9547675029
+枝叶 8.6966709649
+佳能 12.8020653633
+肝硬变 10.0505300503
+皮瓣 11.1280889297
+锅炉房 12.1089181827
+候车 11.2616203224
+斯政 13.2075304714
+北延 13.2075304714
+南漳 11.0674643079
+波前 11.9547675029
+灵石县 13.2075304714
+承担 6.42874557373
+但兰香 12.8020653633
+布耶 12.1089181827
+善后事宜 10.3743171274
+科瓦尼 13.900677652
+悉皆 11.3357282945
+六三年 12.1089181827
+旁观者 9.91169360541
+切近 10.604840786
+管带 9.84023464143
+连檐 13.900677652
+登场 8.35941410682
+皮球 9.84023464143
+切进 12.8020653633
+索恩 12.2912397395
+巨头 7.51043698491
+清澈见底 11.1280889297
+切过 11.0674643079
+中国奥林匹克委员会 13.2075304714
+梁末侯 13.2075304714
+成人话题 13.900677652
+课目 11.5027823792
+数据交换机 12.8020653633
+逻辑模拟 13.900677652
+登在 11.4157710022
+土地补偿 12.8020653633
+清酒 11.8212361103
+肝硬化 10.1871055853
+季风 8.33615724465
+吉亨 13.900677652
+出产地 13.2075304714
+元语言 12.8020653633
+管帐 12.2912397395
+斯旺 13.900677652
+双鸭山市 12.1089181827
+斯时 10.5684731418
+上传 9.61021821083
+机动灵活 10.4994802703
+盖造 11.598092559
+巨奸 11.9547675029
+法定期限 11.3357282945
+元旦假期 13.2075304714
+票据打印 13.900677652
+斯文 9.26594866375
+电扇厂 13.900677652
+毕节县 12.2912397395
+逾时 12.2912397395
+上体 9.77354326693
+张昌宗 11.9547675029
+上位 8.94485059437
+税收政策 9.5062284973
+於刀剑 13.2075304714
+柯布西 11.7034530746
+烧造 11.0674643079
+企业邮箱 13.2075304714
+熊彼特 11.598092559
+霍元甲 12.2912397395
+暗盘 11.1926274509
+甚是 8.78868986362
+阜新 10.0720362555
+承托 11.1926274509
+刘振伟 12.2912397395
+阜成门 9.98865464655
+巨奖 10.0505300503
+太抠 13.900677652
+切边 13.900677652
+上佳 10.8096351986
+杜塞 12.5143832909
+东林诸 11.5027823792
+高新产业 11.5027823792
+南澳 11.0674643079
+青年一代 11.598092559
+红莓 13.900677652
+北广 12.2912397395
+薛精通 12.8020653633
+结结实实 10.0940151622
+斯奈德 12.8020653633
+雷锋纪念馆 12.2912397395
+利克特 13.900677652
+和怒晴 13.2075304714
+巴音郭楞蒙古自治州 11.3357282945
+北征 9.89334446674
+素臣 13.900677652
+底蕴 10.4041700905
+胃窦 13.900677652
+南湖 9.53122979951
+麻哈鱼 12.5143832909
+收费处 13.900677652
+红艳 11.1926274509
+承接 8.1417758781
+离质体 12.8020653633
+听觉理论 13.900677652
+负极 10.1630080337
+鸡丁 13.900677652
+管待 9.04864738806
+管径 10.6818018271
+上人 10.0940151622
+王御史 13.900677652
+医药产业 10.3171587135
+香客 9.85762638414
+示威 8.94485059437
+退役军人 11.7034530746
+上京 9.18217878068
+皮疹 9.61021821083
+管得 9.22784881751
+水华鱼 13.900677652
+上交 9.33632946051
+南湾 10.4349417492
+伯祥 11.598092559
+鸡丝 11.0103058941
+一千二百 10.604840786
+徘徊 7.61281909181
+承揽 9.98865464655
+几内亚 9.49395840471
+卢克莱修 11.5027823792
+绣球花 13.2075304714
+巨声 13.2075304714
+醉兮 13.2075304714
+官尚方 13.2075304714
+希腊文 9.45802639549
+北经希 13.900677652
+蒹葭之思 13.900677652
+张华浜 12.8020653633
+保险卡 11.9547675029
+仙王座 11.3357282945
+梁发 12.8020653633
+黄坛口 11.8212361103
+指导员 8.51160592216
+日记簿 13.900677652
+烛花 12.1089181827
+正交投影 13.900677652
+通榆县 13.900677652
+南渡 9.66657114738
+上任 8.07173203437
+南港 11.2616203224
+核威慑 10.1630080337
+许绍 13.2075304714
+媒婆 11.2616203224
+苏禄东 12.8020653633
+德林堡 12.8020653633
+四千元 12.8020653633
+娟秀 10.765183436
+溶剂萃取 10.4994802703
+烛芯 13.900677652
+川岛芳子 13.2075304714
+南游 12.1089181827
+控制软件 11.7034530746
+宋文贵 11.598092559
+法平面 13.900677652
+管弦 11.0103058941
+靖南侯 12.8020653633
+上世 13.900677652
+心悦诚服 11.0103058941
+隆宝 12.8020653633
+与会人士 11.3357282945
+西南农业大学 13.900677652
+上上 11.1926274509
+上下 6.5887914879
+拔回 13.900677652
+隆安 10.7226238216
+三十二席 13.900677652
+成细粉 12.2912397395
+清道 10.642581114
+糊墙 13.900677652
+上举 10.9049453784
+华阴市 12.5143832909
+烧酒 9.22784881751
+南满 10.2371160058
+坎伯 12.5143832909
+杨一指 13.2075304714
+裁判官 11.7034530746
+夏君亭 11.8212361103
+上中 11.3357282945
+黑嘴鸥 12.5143832909
+间歇性 9.66657114738
+上个 9.5186510173
+皮甲 11.4157710022
+印刷物 13.900677652
+混合结构 12.1089181827
+千方 12.8020653633
+月份牌 12.1089181827
+米克洛什 12.1089181827
+上乘 10.2630914922
+不能根除 13.2075304714
+连比 12.8020653633
+清退 10.3453295905
+匆忙之间 13.900677652
+打铃 12.5143832909
+章阁 11.3357282945
+红花 8.99540287354
+设计组 11.9547675029
+底薪 11.3357282945
+刘明辉 13.900677652
+年休 13.900677652
+夭折 9.17328983326
+松钦巴 12.2912397395
+方石岭 12.8020653633
+粮农组织 11.598092559
+金丝小枣 11.0103058941
+悬棺 9.14708746087
+苯妥英 13.900677652
+奥伯斯 12.8020653633
+南溪 10.9562386728
+白虹贯日 10.8561552143
+桔树 12.8020653633
+五口之家 12.1089181827
+低粘度 12.1089181827
+人心不古 12.8020653633
+开发商 6.92713463246
+上书 7.80035869996
+钉梢 13.900677652
+切身 10.4666904475
+徐村之 13.2075304714
+文文山 12.8020653633
+暗码 13.900677652
+圣詹姆斯 13.900677652
+至今已是 13.900677652
+相貌堂堂 11.2616203224
+初出茅庐 10.8561552143
+湖州市 10.5684731418
+广州起义 10.0505300503
+隆吉 12.5143832909
+利己利人 13.900677652
+季陶 13.2075304714
+熊虎之士 13.900677652
+大年三十 10.4349417492
+吴敏霞 12.5143832909
+郎之万 13.900677652
+勃利县 12.5143832909
+墙垣 10.6818018271
+建平县 12.8020653633
+电脑自动 12.2912397395
+沙尔河 13.900677652
+巨型 8.61241062128
+山掘子 11.4157710022
+宾县 11.9547675029
+罗叶 13.900677652
+不请自到 12.5143832909
+于湘淮 12.8020653633
+杨赛因 11.9547675029
+一盏灯 10.765183436
+攀着 10.0720362555
+下树 11.7034530746
+又会有 10.0940151622
+电动门 13.2075304714
+烧麦 12.5143832909
+瓦面 13.900677652
+云游四方 11.8212361103
+务请 10.1630080337
+双所 13.900677652
+缴出 12.2912397395
+玉体横陈 13.900677652
+新专辑 11.3357282945
+承泣 12.8020653633
+切脉 11.1280889297
+非营利性 11.1926274509
+暖气团 11.3357282945
+宇文阐 12.8020653633
+舍间 12.5143832909
+苏小小 12.2912397395
+孟广美 13.900677652
+名震一时 13.2075304714
+裁判员 9.82314020807
+墙基 11.5027823792
+爱窝窝 12.8020653633
+吓死你 11.9547675029
+尼科尔 13.2075304714
+便利店 11.5027823792
+波力 11.7034530746
+身临其境 10.4041700905
+季雨 13.900677652
+格林斯 13.900677652
+微伏 12.8020653633
+梳起来 12.5143832909
+梵呗 11.9547675029
+湖州府 12.1089181827
+早春时节 12.2912397395
+末位 10.9562386728
+桐籽 12.8020653633
+连回 13.2075304714
+香君 11.9547675029
+特别节目 11.9547675029
+老典吏 13.2075304714
+登天 11.1926274509
+吉东 11.598092559
+喝茶 8.13235665618
+作家协会 10.1394775363
+彼得罗维奇 12.5143832909
+六分仪 12.1089181827
+萨默塞特 12.8020653633
+窑址 9.98865464655
+难上难 12.8020653633
+千伶百俐 13.900677652
+烧鹅 11.7034530746
+连播 12.8020653633
+东佃 13.900677652
+连阔如 13.2075304714
+不管部 11.8212361103
+骆氏 13.900677652
+手指画 12.5143832909
+钣金件 13.900677652
+青壮年 9.66657114738
+尹奉 12.8020653633
+益高 13.900677652
+和觉华 13.2075304714
+反目 10.9562386728
+末伏 13.2075304714
+侵伐 11.9547675029
+高文举 12.8020653633
+艳慕 13.900677652
+烧鸡 10.4349417492
+烧鸭 12.2912397395
+詹妮弗 13.900677652
+颓丧 10.0505300503
+听不清 9.94943393339
+直系家庭 12.8020653633
+扭过头去 10.765183436
+愿君 11.598092559
+法拉奇 12.8020653633
+地权 10.9562386728
+打冷颤 13.900677652
+卞祥见 13.2075304714
+海格立斯 11.598092559
+岳家 12.2912397395
+孤苦零丁 12.2912397395
+隆哥 12.2912397395
+香味 8.13548654919
+广陵度 13.2075304714
+混合机 13.2075304714
+继海 13.900677652
+取之不竭 12.5143832909
+丰林 11.2616203224
+暗礁 9.98865464655
+桓黾 12.2912397395
+纤毛虫 11.5027823792
+晴到多云 13.2075304714
+答问 10.2630914922
+途中 7.54630761118
+马头镇 12.8020653633
+肥皂盒 13.900677652
+国防部门 12.8020653633
+双唇音 13.900677652
+胜利果实 9.84023464143
+北军 9.72629038208
+山望见 13.900677652
+康僧会 12.5143832909
+末代 10.0088573539
+红豆 9.69598503258
+管内 9.89334446674
+连放 11.3357282945
+成修吾 13.900677652
+皮管 12.8020653633
+纯正 9.5186510173
+缪荃孙 11.8212361103
+连收 10.8096351986
+飘下来 12.1089181827
+穷寇 11.7034530746
+弗洛勒斯 12.5143832909
+途上 13.900677652
+极为重要 9.09665660724
+印度教 8.44963919841
+皮箱 9.45802639549
+管军 11.1926274509
+阿炳家 11.4157710022
+许氏刊 13.2075304714
+丰枯 12.2912397395
+贾田 13.2075304714
+一百零五个 12.8020653633
+草食动物 12.2912397395
+杠杠 11.598092559
+那样的话 9.80633308975
+末了 8.88339781516
+若干类 12.8020653633
+硝化棉 12.1089181827
+北凉 9.6811699468
+独占鳌头 10.4666904475
+钱南扬 12.2912397395
+闲饭 13.2075304714
+南斯拉夫联邦 11.5027823792
+神佛 10.4994802703
+鲁思 10.8096351986
+山坡羊 13.2075304714
+那童儿 12.8020653633
+购买者 9.36807815882
+马法五 13.900677652
+伯里兹 13.900677652
+互道 12.1089181827
+徐斌州 13.900677652
+后勤处 12.1089181827
+封郡王 11.9547675029
+五六百里 13.2075304714
+夹缝 10.0088573539
+手头上 11.4157710022
+郭大力 12.5143832909
+系统地 8.33233314821
+张人杰 12.5143832909
+加缪 11.7034530746
+一抓到底 13.2075304714
+愿者上钩 13.2075304714
+宫词 12.8020653633
+人杰地灵 12.1089181827
+汪之斌 13.900677652
+登堡 10.3453295905
+荣誉章 11.1280889297
+纯毛 12.2912397395
+波纳佩 12.2912397395
+接收单位 13.900677652
+碎冰 11.9547675029
+现代汉语 10.9562386728
+觅得 10.765183436
+混为一谈 9.4233408375
+机主 12.8020653633
+从属关系 10.765183436
+山莨菪碱 13.900677652
+以工补农 13.900677652
+北回归线 9.56994431169
+小臣墙 13.2075304714
+登堂 11.7034530746
+硬化症 11.2616203224
+杜华举 13.900677652
+镇定自若 10.8561552143
+瓦隆 11.8212361103
+吐来吐去 13.900677652
+招牌 8.78868986362
+预科部 13.900677652
+山东鲁能 11.598092559
+沙窝子 12.2912397395
+德波林 12.2912397395
+无锡市 9.96885201925
+皮筋 13.2075304714
+浦太守孟 13.2075304714
+人均收入 9.84023464143
+瓦雷 12.8020653633
+操场 9.4233408375
+引柴 13.2075304714
+一般见识 10.1630080337
+鱼主 13.2075304714
+订过 12.5143832909
+末世 10.8561552143
+赞赏 8.28390655431
+管养 13.2075304714
+胡朴安 12.5143832909
+切肉 11.5027823792
+有房住 13.2075304714
+裴度继 12.8020653633
+射线作用 13.2075304714
+摊出 13.2075304714
+缧绁之忧 13.900677652
+累增 13.2075304714
+不涨反跌 11.4157710022
+梵唱 13.2075304714
+阿尔杜塞 12.5143832909
+慈光阁 13.2075304714
+北兵 10.0720362555
+切肤 11.598092559
+北关 9.85762638414
+布达 11.5027823792
+黄慕松 13.900677652
+东犯 10.604840786
+贺年片 13.900677652
+连日 8.44109213783
+哈克斯 12.8020653633
+重庆晨报 11.9547675029
+王更广 13.900677652
+数得着 11.9547675029
+康莱特 13.2075304714
+花白 8.97342396682
+赏功罚罪 12.2912397395
+红轩 12.8020653633
+还家 10.9562386728
+生活美满 12.8020653633
+连根儿 12.8020653633
+迈着 9.24671730182
+美国移民 13.2075304714
+同方向 11.5027823792
+务要 9.35738286971
+连本带利 12.2912397395
+更坏 10.0294766411
+称说 11.7034530746
+封恭亲王 12.8020653633
+苏民生 13.900677652
+棕编 13.2075304714
+一现 11.1280889297
+东照 11.7034530746
+缠缠绵绵 12.8020653633
+瓦锅 12.5143832909
+热质说 11.9547675029
+权威性 8.97342396682
+狄欧尼 11.7034530746
+段玉裁 11.0674643079
+环市路 13.2075304714
+乡里乡亲 12.2912397395
+香囊 10.1164880181
+北斗七星 10.1164880181
+璇玑 12.1089181827
+同一性 9.91169360541
+收费员 12.5143832909
+漏尽钟鸣 13.2075304714
+前门大街 12.5143832909
+有理分式 12.8020653633
+欧裔 12.8020653633
+行泉府 13.2075304714
+三十余艘 13.2075304714
+穷形尽相 13.900677652
+唱出来 11.1280889297
+承满 13.900677652
+恐为 11.4157710022
+何仙姑 13.2075304714
+宁镇扬 11.9547675029
+一千二百八十三家 13.2075304714
+布谢 12.8020653633
+称许 11.1926274509
+蓟州管 13.2075304714
+连晴 12.2912397395
+红萝卜 11.0103058941
+鼻膜 12.2912397395
+张伐 13.900677652
+课程 8.06879517469
+拨弄 9.94943393339
+课税 9.69598503258
+布谷 11.5027823792
+张伟 10.604840786
+华家池 12.2912397395
+凯夫拉维克 13.900677652
+张信 13.900677652
+词作家 13.2075304714
+委任 8.85082164473
+纯棉 11.8212361103
+切菜 11.1926274509
+一笔勾销 10.5684731418
+张俭 11.598092559
+竞标者 11.7034530746
+惺惺 12.8020653633
+英语词典 11.4157710022
+底裤 11.2616203224
+侨乡 9.85762638414
+二百多斤 13.2075304714
+闰位 13.2075304714
+亲者痛 12.1089181827
+卡蒂埃 13.2075304714
+数周后 12.5143832909
+索求 12.2912397395
+鼻腔 9.04086524761
+张俊 10.4041700905
+保险库 13.900677652
+成本费用 10.0294766411
+小臣宅 13.2075304714
+杨一清 11.1280889297
+张清连 13.2075304714
+红运 13.2075304714
+禄卿 12.5143832909
+麝香石竹 12.8020653633
+虚晃一下 13.900677652
+黄鼠狼 9.31571017331
+难以想像 11.598092559
+摔下来 10.642581114
+公私不分 13.900677652
+刘义庆 11.8212361103
+波包 13.2075304714
+著作权 10.4349417492
+张侯 13.2075304714
+隆回 12.2912397395
+非洲统一组织 10.9562386728
+孙淑伟 13.2075304714
+周达观 11.598092559
+测试中心 10.7226238216
+尖子生 12.5143832909
+泛珠三角 13.900677652
+红边 11.4157710022
+蒙自县 12.2912397395
+巴特里 13.900677652
+商鸿源 13.2075304714
+京珠 10.0720362555
+金称臣 12.5143832909
+匿名举报 13.2075304714
+过街天桥 11.4157710022
+齐心并力 12.8020653633
+屠宰厂 12.2912397395
+兰州站 12.5143832909
+女高音 10.4994802703
+刘义康 12.5143832909
+不是之处 12.8020653633
+三六九集 13.2075304714
+巨商 11.1280889297
+封山育林 11.7034530746
+免疫性 9.91169360541
+李岩因 12.1089181827
+科学事业 10.642581114
+连望 12.5143832909
+张书 13.2075304714
+窝赃 12.2912397395
+赞辞 12.8020653633
+删略 13.2075304714
+小布什 11.0674643079
+乡政府 8.83808261895
+耿尔直 12.8020653633
+第五十五回 12.1089181827
+连有 11.2616203224
+双桅帆船 12.8020653633
+马刚 13.900677652
+南汉宸 13.2075304714
+暗笑 9.62401153296
+芜菁 11.8212361103
+北原 11.5027823792
+惊涛 11.1926274509
+外部性 11.3357282945
+鼋鱼 13.2075304714
+布赫 12.2912397395
+间歇河 12.5143832909
+底襟 13.900677652
+别居 11.9547675029
+金堂峡 12.2912397395
+安西镇 13.900677652
+张义 13.2075304714
+总的讲 12.5143832909
+候船 13.900677652
+张乐 13.900677652
+中国登山协会 13.2075304714
+邱民仰 10.6818018271
+北县 12.2912397395
+反生 12.2912397395
+张乙 12.5143832909
+北去 10.3743171274
+濠沟 11.8212361103
+鼻背 13.2075304714
+八里桥 11.9547675029
+管口 12.1089181827
+邮戳 11.1926274509
+明如昼 11.8212361103
+南越武 12.5143832909
+管叫 12.2912397395
+夹紧 11.4157710022
+幼儿班 13.2075304714
+奖金 7.8093677699
+张丰 13.2075304714
+民事判决 11.5027823792
+老子天下第一 13.900677652
+皮科 10.9049453784
+皮秒 11.1926274509
+间歇泉 11.0103058941
+本命年 11.7034530746
+连杆 10.0088573539
+张丽 12.1089181827
+委会 10.2371160058
+胡景桂 13.900677652
+各站 10.5684731418
+扶太子登 12.5143832909
+总的说 11.7034530746
+张三 9.44633035572
+要雨得雨 13.2075304714
+张世 11.9547675029
+管叔 11.0674643079
+毕节市 13.2075304714
+巨响 8.77671367257
+南房 11.1926274509
+平均指标 13.900677652
+军事顾问 10.3743171274
+自左而右 12.8020653633
+张东 10.533381822
+布贴 13.900677652
+仰天长啸 12.8020653633
+宫观 10.1394775363
+向西行 11.3357282945
+筒拱 12.8020653633
+垂帘 11.598092559
+宫规 12.2912397395
+张仪 10.3453295905
+拿破仑 8.18364995057
+寻常事 13.2075304714
+巴特那 11.3357282945
+暗算 10.0088573539
+金大监 13.2075304714
+住家 10.3743171274
+管区 10.5684731418
+五卅惨案 11.0674643079
+孔崇儒 13.2075304714
+巨君 12.5143832909
+林果 10.8561552143
+丰收 8.68574189437
+电动阀 13.900677652
+暗箭 10.9562386728
+陈官庄 13.2075304714
+连架 13.900677652
+底角 11.9547675029
+哭哭 12.2912397395
+南拳 11.3357282945
+暗箱 10.642581114
+主波长 13.2075304714
+张仙 13.900677652
+北医 12.8020653633
+北区 9.85762638414
+标注 9.28555713513
+经裕溪 12.8020653633
+香坊 12.8020653633
+高纬度 9.24671730182
+棕绷 13.2075304714
+张亮 11.7034530746
+棕绳 13.2075304714
+谭人凤 12.2912397395
+南投 10.9049453784
+血象 11.5027823792
+鲁抗 11.7034530746
+统筹安排 10.0720362555
+跨专业 13.900677652
+递上去 11.8212361103
+细胞系 12.1089181827
+入渗 11.8212361103
+碎叶 10.4666904475
+两斗 12.5143832909
+舷外 12.5143832909
+切花 11.4157710022
+枝干 10.2371160058
+各院校 13.900677652
+木鱼石 13.900677652
+目前为止 7.99804431857
+计引兵 11.9547675029
+西戎别 12.8020653633
+野蛮女友 13.900677652
+张云 12.2912397395
+一个十七八岁 12.5143832909
+注视者 13.900677652
+濠江 12.5143832909
+索洛 11.3357282945
+后发优势 11.1926274509
+监测器 13.2075304714
+小鬼头 12.8020653633
+届满时 11.9547675029
+耐磨性 9.89334446674
+吃苦头 11.4157710022
+游标 12.2912397395
+文明村 12.5143832909
+事件 5.69627923383
+洛基尔 12.8020653633
+贵重物品 11.1280889297
+杠房 13.2075304714
+联翩 12.1089181827
+农业与农村委员会 13.2075304714
+巨厚 9.85762638414
+山介溪 13.900677652
+牟春光 8.9519177616
+统治集团 8.6966709649
+后勤局 13.900677652
+大砍刀 11.598092559
+四五次 11.7034530746
+苏拉威 13.900677652
+实兵演习 12.2912397395
+皮纸 11.5027823792
+皮纹 11.9547675029
+礁石 9.55687223012
+低度酒 12.8020653633
+累计数 11.9547675029
+皮纳 12.5143832909
+催情药 13.2075304714
+俾能 13.900677652
+福克兰群岛 11.598092559
+朱践耳 12.1089181827
+东真 13.900677652
+改回 10.8561552143
+出山泉水 13.900677652
+污辱 10.1871055853
+阙门力 13.2075304714
+汪谅 13.900677652
+巨口 11.9547675029
+科科长 9.72629038208
+设计界 11.7034530746
+巨变 9.7898037878
+狂犬吠日 13.2075304714
+泻湖 11.8212361103
+填埋场 11.5027823792
+南支 9.56994431169
+四五步 12.5143832909
+维森特 12.2912397395
+喃喃地 8.80081122415
+电须刀 13.900677652
+圭亚那政府 13.2075304714
+龙飞虎 12.8020653633
+红褐 10.8096351986
+听取报告 13.2075304714
+京畿 9.28555713513
+摄影集 13.900677652
+抛丸机 13.900677652
+纤维素 8.75901409547
+北后 12.8020653633
+支付 6.19902528933
+称赞 7.6781013839
+对人对事 12.2912397395
+千万朵 13.2075304714
+北向 10.1871055853
+摩门 13.2075304714
+巨匠 11.1280889297
+反犹 12.8020653633
+称赏 10.9562386728
+张都监 10.3171587135
+枝头 9.6811699468
+军政大学 11.5027823792
+南无 10.5684731418
+融合度 13.900677652
+异化理论 13.2075304714
+答道 7.02441304008
+三十一万七千余 13.2075304714
+赔礼道歉 10.4041700905
+红角 11.0674643079
+本科学历 11.9547675029
+德米特 11.598092559
+缺员 12.5143832909
+金银制 13.900677652
+意犹未尽 10.1394775363
+赈饥 11.7034530746
+支援灾区 13.2075304714
+长城站 12.2912397395
+费点心思 13.900677652
+二十响 10.5684731418
+招投标 9.56994431169
+鲁斋 11.9547675029
+梁父 12.5143832909
+众口烁金 12.8020653633
+恋恋不舍 10.0720362555
+余震不断 13.900677652
+格卢勒 12.2912397395
+避孕药 9.71102290995
+彭蠡泽 12.1089181827
+事主 10.8096351986
+魏南凉 12.5143832909
+互问 13.900677652
+能掐会算 12.8020653633
+电子衍射 11.3357282945
+贾生 12.2912397395
+标段 10.8096351986
+灵活多样 11.0674643079
+南斯 13.2075304714
+千百种 12.2912397395
+鲁斯 10.2630914922
+北周 8.39941944143
+称述 12.5143832909
+蒋仲苓 12.8020653633
+劳动就业 10.8096351986
+事业 6.35740430527
+南方 6.11163725032
+谷甾醇 12.8020653633
+仰天长叹 10.604840786
+阙下 10.9049453784
+椭圆球 13.900677652
+科罗曼德尔 13.2075304714
+红衣 9.53122979951
+儿童剧 11.9547675029
+百度搜 13.900677652
+大不大 10.765183436
+年年如此 12.1089181827
+红衫 11.8212361103
+示值 12.8020653633
+香军 12.8020653633
+清高 9.62401153296
+干老子 12.1089181827
+大量出 12.8020653633
+礁盘 11.0674643079
+沈兆霖 12.8020653633
+巨力 8.70218062071
+松柏常青 13.2075304714
+信息结构 12.5143832909
+向莺儿 12.8020653633
+第三十九条 13.2075304714
+攀爬 10.3453295905
+二十六席 13.900677652
+柔中有刚 12.5143832909
+斯湾 11.8212361103
+软玉温香 13.900677652
+孤魂野鬼 12.1089181827
+甚深 9.69598503258
+叶巢 12.5143832909
+尼科夫 11.0674643079
+皮翁 12.5143832909
+基础行业 13.900677652
+巴勒克 13.900677652
+签字笔 12.8020653633
+韩政府 13.900677652
+莫弄虚 13.2075304714
+栓剂 11.2616203224
+联产承包制 13.900677652
+系统化 9.61021821083
+斯港 12.8020653633
+农科大 13.900677652
+隆兴 10.642581114
+斯温 13.2075304714
+石磬 11.9547675029
+事例 8.91707103027
+相地而衰征 12.8020653633
+受限于 11.7034530746
+一年到头 9.93038573842
+二十六年 8.68574189437
+体验性 12.8020653633
+中碳钢 11.8212361103
+宫迁 12.8020653633
+根红苗正 13.2075304714
+小康型 12.5143832909
+桉树 10.4666904475
+东盟 8.94485059437
+巨制 11.5027823792
+东盛 12.2912397395
+宋君臣 13.2075304714
+觅宝 13.900677652
+山山谷 12.5143832909
+措施不力 11.5027823792
+亿万年 11.0103058941
+允修 11.2616203224
+慰藉 9.74179456862
+东益 13.2075304714
+雅辛 12.2912397395
+甚浓 12.5143832909
+红装 12.2912397395
+跳过去 10.9562386728
+二十六座 12.8020653633
+汝可 10.2897597393
+裁纸刀 11.9547675029
+大量元 13.900677652
+事体 9.61021821083
+布诺 13.2075304714
+登封 8.92394390956
+带病毒 13.2075304714
+藩镇割据 10.1394775363
+速胜论 12.1089181827
+脖领子 12.5143832909
+隆冬 9.87532596124
+和平统一 10.9049453784
+开发式 13.900677652
+养蜂业 11.598092559
+称谓 8.64318227995
+登山 8.28390655431
+快速路 11.0674643079
+底边 11.2616203224
+富有成效 11.1280889297
+李景隆 13.2075304714
+吴承禧 13.2075304714
+人民卫生出版社 13.900677652
+隆准 11.9547675029
+次梯度 12.8020653633
+栗然 12.8020653633
+必备品 12.5143832909
+八抬大轿 11.5027823792
+东皋 13.900677652
+危机意识 12.8020653633
+皮罗 12.8020653633
+立桂王 12.1089181827
+昌邑县 13.2075304714
+科技产业 10.9562386728
+责打 10.9562386728
+红袍 10.533381822
+巨剑 13.2075304714
+糜竺至 13.2075304714
+烈士陵园 9.43476953332
+发酵饲料 13.900677652
+称谢 9.12155415886
+收费口 13.900677652
+红袖 9.32596667347
+一大步 9.6811699468
+布设 9.41204128224
+邢其毅 13.2075304714
+相熟 9.77354326693
+香兰 8.85725253506
+东廊 11.5027823792
+一年之计 13.900677652
+七哥 12.8020653633
+连战 10.9049453784
+同子杰 11.9547675029
+福尔马林 11.7034530746
+水电费 11.0674643079
+连成 8.97342396682
+傻头傻脑 12.8020653633
+舒尔哈 13.900677652
+伊琳娜 13.900677652
+赞誉 9.32596667347
+南村 11.4157710022
+汤丹 12.5143832909
+三大部 11.9547675029
+布衫 9.85762638414
+模范 7.91171623509
+伸筋草 13.900677652
+美学观 11.7034530746
+事务署 12.5143832909
+布衣 9.21854642485
+抬头纹 11.7034530746
+福楼拜 11.0674643079
+高统靴 13.900677652
+金剑 12.5143832909
+岳嵩 13.900677652
+波尔约 11.8212361103
+王莽新 12.2912397395
+铁圈 11.7034530746
+斯海 13.2075304714
+尼伯伦 12.2912397395
+荦荦大端 13.2075304714
+谢李密 12.8020653633
+宫调 10.2117981979
+好为人师 13.2075304714
+斯洋 13.900677652
+罗得西亚 10.7226238216
+底谷 13.900677652
+连打 12.5143832909
+平南王 11.9547675029
+云长领 12.5143832909
+连手 11.8212361103
+清香 8.74738605748
+散布者 13.900677652
+凄迷 11.7034530746
+北回 12.5143832909
+南朝 7.66626692626
+抽出 7.71652876104
+南望 11.0103058941
+秦德让 13.2075304714
+顾拜旦 11.9547675029
+毛票 13.900677652
+清馨 13.2075304714
+东田 10.9049453784
+布隆迪政府 13.2075304714
+纯氧 12.2912397395
+林格勒 12.8020653633
+林昕 13.2075304714
+南木 12.5143832909
+杜塞尔多夫市 13.2075304714
+贾蓉忙 11.7034530746
+鲁朵 9.85762638414
+一古脑 12.2912397395
+一往无前 10.765183436
+北图 12.8020653633
+北国 10.4041700905
+纯水 11.2616203224
+平乐 11.1280889297
+索桥 12.5143832909
+五十二卷 12.5143832909
+岳州 11.0103058941
+康拜因 12.1089181827
+摊到 11.1926274509
+端尖 12.1089181827
+连投 13.2075304714
+芦苇沼泽 12.2912397395
+布裙 12.1089181827
+墓表 12.5143832909
+剖腹自杀 11.2616203224
+半幅 11.4157710022
+阙漏 13.900677652
+毅然投入 13.2075304714
+频带宽度 11.9547675029
+暗红 9.93038573842
+南柯 12.5143832909
+重庆出版社 12.5143832909
+库菲体 13.2075304714
+中国红十字会 11.1926274509
+文献检索 11.5027823792
+窗花 11.598092559
+暗线 11.1280889297
+法马古斯塔 13.900677652
+接迎 13.900677652
+绊脚石 10.6818018271
+连报 13.2075304714
+布袋 9.14708746087
+出新招 13.2075304714
+枝子 11.8212361103
+南极 8.23425096386
+新芬党 11.598092559
+地胆草 13.900677652
+标榜 9.32596667347
+跳船 13.2075304714
+一展风采 13.900677652
+那婆惜 12.1089181827
+路远迢迢 13.2075304714
+贝聿铭 11.1280889297
+索格 13.900677652
+曹薰铉 12.8020653633
+宇文邕 10.8096351986
+固定式 9.85762638414
+舍身为国 13.900677652
+梵刹 13.900677652
+三户 11.1280889297
+泻法 12.2912397395
+箕斗 12.5143832909
+桥桩 11.9547675029
+脱籍 11.5027823792
+开发局 12.1089181827
+公卖局 13.900677652
+设备厂 11.9547675029
+暗绿 11.598092559
+大量列 12.8020653633
+陈禹谟 13.900677652
+瓦里 11.0103058941
+塞双屿 12.8020653633
+贾母先 12.2912397395
+清风 7.63727938938
+上饶县 12.1089181827
+隆化 12.5143832909
+周启明 12.8020653633
+木儿军 12.5143832909
+宋君荣 13.900677652
+斯汀 12.1089181827
+天荒坪 13.900677652
+富国安民 13.2075304714
+以拖待变 13.900677652
+财务公开 13.900677652
+应用化学 10.6818018271
+富有成果 12.2912397395
+恩菲尔德 12.5143832909
+名符其实 10.765183436
+赞许 9.26594866375
+蛀心虫 13.900677652
+闹事 8.37124856446
+迈特 12.2912397395
+恢复主权 13.900677652
+管型 10.9049453784
+体育频道 13.2075304714
+愧疚 9.53122979951
+杨树林 12.2912397395
+布西 12.8020653633
+春柳 11.1926274509
+徐喜辰 13.2075304714
+包打天下 11.8212361103
+毛贵军 13.2075304714
+西国图 13.2075304714
+四五桌 12.8020653633
+南昆 11.598092559
+反照 12.2912397395
+鲁昂 11.1926274509
+南明 9.65218240993
+格卢克 13.900677652
+南昌 8.06879517469
+纯洁 8.5440913773
+半桶水 11.8212361103
+北埔 13.900677652
+底质 9.89334446674
+第一级 9.98865464655
+南星 11.598092559
+毛纱织 11.9547675029
+精简指令 13.2075304714
+装神弄鬼 10.604840786
+斯民 11.598092559
+穆斯赫 13.2075304714
+卡维龙 13.900677652
+杀菌剂 10.2371160058
+美方 9.06439574502
+标格 13.900677652
+齐政权 12.1089181827
+明登州 13.900677652
+连捷 11.8212361103
+扣带回 12.2912397395
+马林克 12.8020653633
+泻流 13.900677652
+等待时间 12.1089181827
+赞语 11.7034530746
+百十首 13.2075304714
+腹胀 9.26594866375
+香台 12.5143832909
+京白 13.900677652
+嚎啕 10.9049453784
+几何形 10.4349417492
+香叶 11.9547675029
+巨债 13.900677652
+肛道 13.900677652
+岳峙 13.2075304714
+二十六岁 10.5684731418
+山和尚 13.900677652
+齐河 11.9547675029
+连排 12.2912397395
+烧饼 8.94485059437
+香包 11.8212361103
+塑料产品 12.8020653633
+市人大 10.8561552143
+租赁费 11.5027823792
+福武直 12.5143832909
+巨熊 11.9547675029
+碳化硼 12.5143832909
+同一时 13.2075304714
+烧饭 10.1871055853
+孙克弘 13.2075304714
+承欢 9.54396882529
+嫌慢 12.8020653633
+登帐 13.2075304714
+卖力气 11.1926274509
+假充 11.5027823792
+斯波 12.5143832909
+语词 10.1394775363
+南曲 10.5684731418
+蔗田 11.9547675029
+东瓯 11.0103058941
+乌斯怀亚 13.2075304714
+斯泰 11.5027823792
+铃铎 12.2912397395
+棕竹 12.8020653633
+环境效应 11.9547675029
+连提 12.5143832909
+照排机 13.900677652
+阎婆 10.0505300503
+目莲救母 13.2075304714
+东阿南 13.2075304714
+艾米利亚 13.900677652
+马林凯 13.2075304714
+西西伯利 13.900677652
+四五代 13.900677652
+尼罗河 8.64318227995
+二一添作五 12.5143832909
+塘鹅 12.8020653633
+恬淡寡欲 13.900677652
+雄踞 10.0088573539
+混合性 10.604840786
+葡萄 7.71036224612
+北坡 8.59737274392
+难道真 10.533381822
+研究科 12.1089181827
+圆盘式 13.2075304714
+高增值 13.2075304714
+孔烂窑 12.8020653633
+九里山 11.7034530746
+饱以 13.900677652
+生物防治 10.604840786
+苏小宝 11.8212361103
+斯河 10.9049453784
+跃然纸上 11.9547675029
+泻到 13.2075304714
+平乃 13.900677652
+多媒体教学 13.900677652
+说话算数 11.0674643079
+一炮 10.1394775363
+老藤 10.9049453784
+金海心 13.2075304714
+冠盖相望 13.900677652
+相媲美 9.75754292558
+反串 11.598092559
+谭家渊 13.2075304714
+美文 11.7034530746
+连射 11.1926274509
+瑞金县 12.1089181827
+反为 10.5684731418
+歌集 10.8561552143
+连尹 12.5143832909
+泛称 9.5062284973
+紫貂皮 11.9547675029
+岳少保 12.2912397395
+巨澜 12.2912397395
+巴马 11.0674643079
+斯卡 11.1926274509
+香油 9.61021821083
+试探性 9.69598503258
+丰度 10.1630080337
+一百八十年 13.2075304714
+磅礴 10.4666904475
+香河 11.5027823792
+增补剂 13.900677652
+不孚众望 13.900677652
+香泉 12.5143832909
+免疫学 9.63799777493
+老天拔地 12.5143832909
+朴素大方 13.2075304714
+等时线 12.2912397395
+紫毫 13.2075304714
+窥见一斑 12.8020653633
+一百多门 13.900677652
+攀住 10.604840786
+负像 13.900677652
+卖春 13.900677652
+稍稍 7.80260336981
+互变异构 12.2912397395
+连屁 12.5143832909
+梁济 13.2075304714
+灯黑 12.8020653633
+南大 11.8212361103
+金银滩 13.900677652
+纯利 10.4994802703
+上移 8.61241062128
+连山 10.8096351986
+香波 12.2912397395
+反义 12.2912397395
+任校 13.2075304714
+反之 7.83456956187
+南夷 11.1926274509
+泻剂 11.7034530746
+南头 10.2897597393
+香泽 12.5143832909
+丁酉年 13.900677652
+蔷薇花 12.5143832909
+张生 11.2616203224
+反过来说 9.85762638414
+反交 13.900677652
+砸过来 13.2075304714
+广河县 13.900677652
+麦克马洪线 11.1926274509
+事物 6.89126871927
+烟道 10.0294766411
+单齿 12.1089181827
+马林溪 13.2075304714
+启动资金 11.8212361103
+二十吨 13.900677652
+英山县 13.900677652
+香气 8.11378027061
+小巷子 10.9049453784
+上礼 12.5143832909
+大学校园 11.1280889297
+负值 9.20932976975
+负债 7.82993992397
+反于 12.2912397395
+和硕亲王 11.4157710022
+宫廷式 12.2912397395
+承节郎 12.8020653633
+老少皆知 13.900677652
+新进 8.47572763449
+服务器发送 13.900677652
+香水 9.32596667347
+考古系 13.900677652
+盛储器 12.8020653633
+斯堪的纳维亚 9.55687223012
+改土 10.3171587135
+直销网 13.2075304714
+比邻而居 12.5143832909
+苇塘 10.9562386728
+唯你是问 13.2075304714
+巨潮 9.84023464143
+红包儿 13.900677652
+香江 10.604840786
+作出评价 11.0674643079
+香汗 12.8020653633
+庸人自扰 11.5027823792
+浅黄色 10.1871055853
+北桥 13.2075304714
+浅粉色 13.900677652
+釉里红 11.8212361103
+丰年 10.533381822
+磅秤 11.9547675029
+火药 8.00903344015
+银箍 13.900677652
+南京房产 13.900677652
+未免太 9.72629038208
+机动船 10.2117981979
+五一劳动 12.5143832909
+雍州 9.80633308975
+磅称 13.900677652
+互相转化 11.0674643079
+耘草 13.900677652
+淬透性 12.1089181827
+攀上 9.34680076038
+一字之师 13.900677652
+译笔 13.900677652
+深圳市政府 10.9049453784
+南塔 12.1089181827
+万籁 11.8212361103
+小温 10.1394775363
+靠旗 13.900677652
+蒙骗 10.8561552143
+鲁塞 13.900677652
+乏人问津 12.2912397395
+平舆县 11.1280889297
+万米 9.41204128224
+宁强县 13.900677652
+责骂 9.93038573842
+拘管 11.2616203224
+万类 13.2075304714
+章子曾 13.2075304714
+玉轩 12.8020653633
+火花 9.10488710638
+列宁格勒 9.35738286971
+博罗胡 13.2075304714
+大体上 8.4801426527
+张瑞 12.5143832909
+张瑟 13.2075304714
+张瑜 12.8020653633
+泰语 11.598092559
+汤煮 11.9547675029
+中央区 11.3357282945
+闹热 11.2616203224
+故去 11.0103058941
+涤纶丝 13.2075304714
+大不敬 11.0103058941
+张琪 12.2912397395
+张琳 11.598092559
+到位率 11.1280889297
+怀特曼 12.5143832909
+瓜子仁 12.5143832909
+张琴 13.2075304714
+随行人员 10.8096351986
+吴为缩 13.2075304714
+纯化 10.3453295905
+南越兴 13.2075304714
+暂放 13.900677652
+尔少校 12.8020653633
+轴流泵 12.8020653633
+锅烟子 12.2912397395
+钉帽 12.8020653633
+斯利 12.1089181827
+随心换 13.2075304714
+移花接木 11.3357282945
+阴道镜 12.5143832909
+桌子山 11.4157710022
+魅人 11.3357282945
+洁尔阴 13.2075304714
+一烫 12.8020653633
+绝版书 12.8020653633
+封禁强 13.900677652
+偶象 13.900677652
+便能 9.01787572939
+倪宽 12.5143832909
+中央台 11.7034530746
+福隆安 13.900677652
+充满活力 9.65218240993
+烟酒 9.5186510173
+火舌 10.604840786
+航空队 9.74179456862
+布依语 11.9547675029
+国乐团 13.900677652
+巨港 10.9049453784
+团山子 10.4349417492
+罐子 8.63798746307
+下载量 13.900677652
+银竹 13.900677652
+斯密司 13.2075304714
+一热 9.20932976975
+技术讲座 13.900677652
+脂肪性 12.1089181827
+刘娘子 13.2075304714
+林产品 9.6811699468
+牛头怪 13.900677652
+府舍 13.2075304714
+烟酸 10.8561552143
+特要 13.900677652
+标图 12.2912397395
+颠扑不破 11.7034530746
+南士 12.2912397395
+叶赫部 13.2075304714
+商战 11.9547675029
+南越军 12.5143832909
+侨界 13.900677652
+旧疾 12.1089181827
+十六世纪 10.6818018271
+香洲 12.1089181827
+密密层层 11.0103058941
+毕吸虫 13.900677652
+挑毛病 12.8020653633
+竹编 9.62401153296
+鲁境 12.5143832909
+南境 10.765183436
+事必躬亲 10.8096351986
+耐老化 11.1280889297
+享誉 9.4233408375
+反修 13.2075304714
+示波 12.1089181827
+逛商店 12.1089181827
+沟满壕平 13.2075304714
+纯厚 12.8020653633
+闹灾 13.900677652
+香浓 11.5027823792
+玉辂 11.4157710022
+白日作梦 13.900677652
+承认错误 11.3357282945
+希腊化 9.69598503258
+永固 10.4349417492
+张璁 11.9547675029
+诀别书 13.900677652
+张璇 11.8212361103
+家道小康 13.900677652
+鲁盖尔 11.9547675029
+张璋 13.2075304714
+发散 9.09665660724
+紧急集合 11.8212361103
+香浦 13.900677652
+渺远 13.900677652
+火色 12.2912397395
+张璐 12.5143832909
+微白 12.8020653633
+菌膜 13.2075304714
+北楼 12.8020653633
+革命现实 13.900677652
+多万千米 12.5143832909
+斯克 9.24671730182
+翌年 7.73316116109
+万网 12.2912397395
+银票 9.12999302751
+丰岛 11.9547675029
+上算 11.598092559
+文潞公 12.8020653633
+蒙馆 12.2912397395
+抓耳挠腮 10.4349417492
+巡逻队 10.642581114
+水宿风餐 13.900677652
+第四季度 7.14026296089
+地税局 9.35738286971
+知识出版社 12.5143832909
+统一口径 12.8020653633
+鸡笼 9.85762638414
+以此为限 13.2075304714
+巨涛 13.2075304714
+现代诗歌 11.8212361103
+香溪 11.5027823792
+筒子 10.0720362555
+宝兄弟 10.1871055853
+夯土墙 12.5143832909
+香溢 11.598092559
+谣言惑众 13.900677652
+一万二千六百八十二箱 13.2075304714
+立成 12.1089181827
+王摇摇 13.900677652
+专职 8.9308643524
+角角落落 11.2616203224
+连带 9.01032852375
+癞蛤蟆 10.2371160058
+收词量 13.900677652
+万缕 12.2912397395
+酒狂 12.5143832909
+社会民主主义 10.9049453784
+一以当十 13.900677652
+弄假成真 11.4157710022
+好性儿 12.2912397395
+於太尉 13.2075304714
+万缘 12.1089181827
+体验式 11.7034530746
+左右两股 13.900677652
+预征 11.7034530746
+盘算着 9.46986085313
+激素 7.71652876104
+本地风光 13.900677652
+骨髓瘤 10.9049453784
+公用企业 13.2075304714
+抽光 13.2075304714
+身子骨儿 11.1280889297
+连平 9.84023464143
+连年 8.14493543839
+息息相关 9.24671730182
+艺术交流 11.2616203224
+上篮 11.9547675029
+谆谆嘱咐 12.1089181827
+甜味剂 10.1871055853
+手工费 13.2075304714
+农一师 11.9547675029
+标售 12.2912397395
+家常便饭 10.1394775363
+秋闱榜 13.2075304714
+图书奖 12.1089181827
+走上台 11.598092559
+雕栏玉砌 12.2912397395
+朱由校 11.9547675029
+奎因 12.2912397395
+大荔县 12.2912397395
+瓦剌兵 13.900677652
+竹簧 13.900677652
+胡本杨 11.5027823792
+张石 13.900677652
+绿柱石 10.4041700905
+日界线 12.1089181827
+求偶者 13.900677652
+修订本 10.604840786
+区议会 13.900677652
+魏攻楚 12.8020653633
+鲁肃领 13.2075304714
+巨洞 11.9547675029
+废铜烂铁 13.2075304714
+香港 5.8121158467
+迈步前进 13.900677652
+黄尾屿 11.5027823792
+北横 13.900677652
+南寨 11.0674643079
+菌苗 11.1926274509
+伦贝格 13.2075304714
+摇尾乞怜 11.598092559
+路德会 13.900677652
+燕丹子 13.2075304714
+工业电视 12.1089181827
+不知疲倦 11.2616203224
+巡演 11.9547675029
+鲁宁 11.1926274509
+叶乔波 13.2075304714
+电功率 11.1280889297
+南宁 8.82550383674
+鲁安 13.900677652
+上策 8.98802276624
+谷特洛 13.2075304714
+朴柱奉 12.8020653633
+南安 9.33632946051
+巨浪 9.7898037878
+斯军 13.2075304714
+刘向依 12.8020653633
+提薪 13.900677652
+有酸味 13.900677652
+热功当量 10.9049453784
+格莱斯顿 10.765183436
+枝杈 10.3453295905
+一个劲儿 8.99540287354
+覆盖面积 9.66657114738
+上签 11.9547675029
+到顶 10.8561552143
+硬面 12.1089181827
+污秽不堪 12.8020653633
+南宫 9.7898037878
+地积 13.900677652
+枝条 8.96620371885
+矛盾激化 9.72629038208
+冲绳岛 10.9049453784
+火腿 9.33632946051
+一美元 12.1089181827
+封片 13.2075304714
+郭若虚 12.5143832909
+庄氏 13.900677652
+新大新 11.7034530746
+行为艺术 13.2075304714
+吉布森 13.2075304714
+库莱布 13.2075304714
+第二折 13.2075304714
+管段 13.900677652
+登报 11.598092559
+向东奔 12.8020653633
+指导性 9.80633308975
+白灵 9.00283785202
+中央党 11.5027823792
+保险期 12.5143832909
+宋先生 10.9049453784
+垫子 10.4041700905
+帕尔莫 12.2912397395
+诉愿 11.9547675029
+花瓣 8.28754954559
+坠马 11.0674643079
+北段 8.74738605748
+生理盐水 10.604840786
+黄灯 11.3357282945
+西弗维 13.900677652
+广陵散 11.4157710022
+德班 11.8212361103
+上站 8.96620371885
+同一天 9.18217878068
+放开来 13.2075304714
+丰州 11.3357282945
+碎步 10.3453295905
+特警 11.5027823792
+平行四边 13.900677652
+一波未平 10.8096351986
+领办 12.1089181827
+里卡多 12.8020653633
+网易公司 11.2616203224
+保险杠 10.0088573539
+秦琴 13.2075304714
+信音乖 13.2075304714
+战战惶惶 13.900677652
+欲跳楼 13.900677652
+负号 11.1926274509
+说心里话 9.93038573842
+五十余天 13.900677652
+麦克法 13.2075304714
+玉质 10.8096351986
+上端 9.19114745066
+美国国家安全局 13.900677652
+醉卧 11.1280889297
+又哭又闹 11.598092559
+上章 12.1089181827
+保真度 13.2075304714
+细胞因子 11.5027823792
+保险杆 13.2075304714
+罗本古 13.900677652
+鸭嘴龙 12.2912397395
+特训 11.5027823792
+民约论 12.5143832909
+哈瑟瑞 13.900677652
+菱铁矿 10.8561552143
+西晋时 10.2897597393
+张目 11.4157710022
+纯净 8.9102450652
+特许 8.62767809341
+上税 11.5027823792
+头昏脑涨 11.9547675029
+退堂鼓 12.1089181827
+特设 9.72629038208
+王弼之 13.2075304714
+北欧 8.44109213783
+插件 12.5143832909
+万维 13.900677652
+偶蹄 11.4157710022
+铁佛寺 11.9547675029
+张益 12.2912397395
+苯并芘 12.1089181827
+泰西 11.598092559
+邱伦 11.3357282945
+帕加马 11.9547675029
+星马 10.6818018271
+张盖 11.8212361103
+木家具 11.4157710022
+拘礼 10.9049453784
+鸡窝 10.3743171274
+船歌 12.5143832909
+父女情 13.2075304714
+连忙 6.43731460646
+见马克思 11.7034530746
+特科夫 12.8020653633
+苇子 9.41204128224
+黄砂 12.1089181827
+张皮 12.8020653633
+芝罘 11.2616203224
+郑哲敏 13.2075304714
+特诺 13.900677652
+李绩原 13.2075304714
+卫尉职 13.2075304714
+连心 11.1926274509
+刘赞画 11.7034530746
+乌梁素海 11.8212361103
+左金王 11.598092559
+拘票 11.8212361103
+中央军 10.2897597393
+保险柜 10.1630080337
+德林河 13.2075304714
+玉趾 13.2075304714
+万线 12.8020653633
+阻塞性 10.5684731418
+玉足 13.900677652
+广陵新 13.2075304714
+绿博会 11.3357282945
+齐氏 13.2075304714
+巨汉 12.2912397395
+备战状态 12.8020653633
+银碗 11.5027823792
+美尔雅 10.9562386728
+日本海 9.69598503258
+小偷小摸 11.9547675029
+斯坎 12.1089181827
+标单 13.900677652
+张照 12.2912397395
+保圣教 13.2075304714
+跳脚 11.0674643079
+钉子 9.20019728618
+举发 11.4157710022
+日记体 12.2912397395
+必考 11.9547675029
+慷慨就义 11.9547675029
+巴塞罗那奥运会 11.5027823792
+景宗皇后 12.5143832909
+饱嗝 11.1926274509
+人文精神 12.8020653633
+管治 12.8020653633
+事相 13.900677652
+抬脚 9.59661255877
+探察 11.3357282945
+阿尔杜斯 13.900677652
+思想保守 11.7034530746
+偶见 10.4666904475
+进攻战 10.9049453784
+行同狗彘 13.2075304714
+张煊 13.900677652
+斯坦 9.38981814546
+戏票 11.1280889297
+向地性 12.2912397395
+末班 13.2075304714
+苇岸 13.900677652
+北河 11.0103058941
+整流管 12.8020653633
+索勒 12.2912397395
+微现 13.900677652
+苄基 12.2912397395
+彭其劫 13.2075304714
+陆连岛 11.5027823792
+抬脸 13.900677652
+一死 8.26588804881
+朱瞻基 11.7034530746
+合恩角 11.9547675029
+登时 8.26588804881
+半数票 13.2075304714
+塞尔吉奥 13.2075304714
+同舟共济 10.3453295905
+德松赞 13.900677652
+四五十 9.77354326693
+魏子建 13.2075304714
+四五千 10.8096351986
+邮寄费 13.2075304714
+雍奴 11.8212361103
+竹竿 9.04086524761
+菌落 10.9049453784
+诸书之 13.2075304714
+二十六条 13.2075304714
+连接时间 13.900677652
+微珠 13.2075304714
+五六万米 13.2075304714
+在编 11.5027823792
+武安市 13.2075304714
+管法 12.8020653633
+新鲜事儿 11.0103058941
+绍酒 12.2912397395
+沦落人 13.2075304714
+格列科 12.8020653633
+停火协议 12.8020653633
+护花 13.2075304714
+通讯兵 12.5143832909
+颁发奖金 12.8020653633
+斯城 12.2912397395
+巨款 9.66657114738
+大放厥词 12.2912397395
+万科 7.50374799676
+岳某 13.900677652
+张燮 12.5143832909
+负向 11.0674643079
+保温桶 13.900677652
+孙权欲 13.900677652
+北京理工 13.900677652
+阜城 11.9547675029
+南川 11.1926274509
+耐火纤维 13.900677652
+黑帐 13.2075304714
+鲁州 13.900677652
+标号 10.8561552143
+南巡 10.2897597393
+言差语错 12.8020653633
+燕民 12.8020653633
+万毕术 12.8020653633
+桔子 11.4157710022
+下情 11.0674643079
+南巴 12.8020653633
+斯基 8.81927328699
+子明诏 12.2912397395
+张燕 10.7226238216
+银翘 13.2075304714
+一万七千多户 13.2075304714
+上紧 11.7034530746
+上变频 13.900677652
+挥霍 9.21854642485
+仆倒 12.1089181827
+马上连 13.2075304714
+整容手术 11.5027823792
+找我聊 13.900677652
+鱼肉百姓 11.7034530746
+今儿个 8.67493097826
+汗水淋漓 11.9547675029
+蝉联 9.87532596124
+演出队 12.1089181827
+一个劲地 9.41204128224
+必胜 9.61021821083
+万福 9.5062284973
+宋果 13.900677652
+保护措施 9.04864738806
+保温材料 12.1089181827
+四五只 12.5143832909
+内聚力 11.3357282945
+连声 8.0484751722
+结论性 12.2912397395
+四五口 12.8020653633
+必能 9.46986085313
+东侧 7.94743431769
+个体老板 12.5143832909
+维持原判 10.765183436
+东侯 12.1089181827
+北汽 9.82314020807
+狄尔泰 11.9547675029
+索古 12.8020653633
+特质 9.61021821083
+张有智 9.18217878068
+鱼鳞松 11.0674643079
+连夜 7.50541605386
+经营额 13.2075304714
+潘文凯 13.900677652
+竹管 11.0674643079
+空气氧化 11.0103058941
+饱汉不知饿汉饥 13.2075304714
+北涌 13.900677652
+丰实 12.1089181827
+柳荫街 13.2075304714
+销蚀 12.5143832909
+卖烧饼 12.5143832909
+柔软 7.8604229407
+治安案件 13.2075304714
+丰宁 11.3357282945
+民办教师 8.7245279194
+张灵 12.5143832909
+巧舌如簧 12.2912397395
+张生月 13.900677652
+融合术 12.2912397395
+香榭 11.1926274509
+摆荡 12.8020653633
+竹简 9.56994431169
+那海洞 12.8020653633
+吓傻 10.765183436
+管涌 12.2912397395
+香榧 11.0103058941
+摩擦系数 10.7226238216
+汤生 12.1089181827
+索取 8.97342396682
+一览表 9.91169360541
+南山 8.28390655431
+东乡 9.89334446674
+咏叹调 10.9562386728
+胚胎学家 11.0674643079
+和黛玉 11.7034530746
+竹篮 10.0720362555
+魔高一丈 12.1089181827
+浅黄 10.4666904475
+东东 10.6818018271
+集成性 11.9547675029
+特赦 10.604840786
+奚胜 11.7034530746
+蒙默 11.9547675029
+屏南县 12.8020653633
+产品安全 11.8212361103
+鲁尔 10.533381822
+香槟 10.3171587135
+竹篾 10.533381822
+竹篱 11.0103058941
+钱谷之 12.8020653633
+育雏 10.3171587135
+东上 10.3743171274
+国兀颜 13.900677652
+丰富 5.4436591836
+东临 9.03314320152
+发帖量 13.900677652
+名声远播 12.1089181827
+东丰 11.7034530746
+箕帚 12.5143832909
+唐僧蒸 13.2075304714
+慈溪县 12.5143832909
+东丽 12.2912397395
+泰达 8.59240995457
+东主 13.900677652
+药液 10.3171587135
+竹篙 10.3743171274
+侵犯 7.6165434909
+权渐移 12.8020653633
+水陆坦克 10.7226238216
+不懂装懂 11.3357282945
+租约 10.533381822
+竹篓 10.4666904475
+可兰经 13.2075304714
+匠心独具 13.2075304714
+红灯记 11.1280889297
+银绢 11.1926274509
+惺忪 11.598092559
+水果醋 13.900677652
+淡妆浓抹 12.1089181827
+鸡粪 11.8212361103
+北洋 8.1386262692
+财经报道 12.2912397395
+万磅 11.8212361103
+苏鲁尔 13.900677652
+竹笼 11.598092559
+商标代理 12.1089181827
+青春活力 11.3357282945
+析木 12.8020653633
+那青龙 13.900677652
+传家宝 11.598092559
+万磊 10.2371160058
+鸡精 11.1280889297
+迟昭平 13.2075304714
+驳船 9.72629038208
+银练 12.2912397395
+油菜地 13.900677652
+解小雀 13.900677652
+张烈 12.5143832909
+装帧 10.9049453784
+烂醉如泥 11.4157710022
+卢文记 13.2075304714
+教科院 13.900677652
+竹笛 11.8212361103
+王国臣 13.2075304714
+福隆德 11.8212361103
+杨小姐 10.5684731418
+南峰 11.598092559
+门坎 9.96885201925
+市场主体 8.99540287354
+东仪 12.2912397395
+商报 7.22359419073
+洛阳 6.36484718918
+银红 11.9547675029
+提花 10.1871055853
+在线 8.00352378434
+北流 9.27570483869
+烦腻 11.598092559
+斤两 10.642581114
+钗荆裙布 13.900677652
+东亚 7.62780064543
+剑鱼 12.5143832909
+南岗 11.5027823792
+不醉 10.9562386728
+南岔 12.5143832909
+沙尔克 13.900677652
+竹签 10.8561552143
+银纸 12.8020653633
+烟锅 10.1630080337
+南岛 9.23723855786
+短期化 10.4666904475
+竹筷 11.598092559
+银线 12.1089181827
+皑皑 10.8096351986
+庞培之 13.2075304714
+考试及格 13.2075304714
+同一律 12.5143832909
+砖窑 9.65218240993
+一百多遍 13.900677652
+南岭 8.91707103027
+愧作 13.900677652
+张炎 11.5027823792
+云从龙 12.1089181827
+承兑 10.1871055853
+北海 8.01179969364
+宣赞休 12.5143832909
+秦琪 12.8020653633
+开发权 11.3357282945
+南岳 10.2117981979
+外分泌腺 12.1089181827
+承光 12.2912397395
+一百多道 13.900677652
+施旺 11.9547675029
+竹筐 11.1926274509
+东京 6.69950676869
+东亭 12.5143832909
+张炜 10.9049453784
+南岸 7.46773755924
+第三十九届 13.900677652
+那宝光 13.2075304714
+红斑毒素 13.900677652
+祷祝 11.4157710022
+偶语 13.2075304714
+示波器 11.2616203224
+二百多天 13.900677652
+医药原料 13.2075304714
+南归 9.65218240993
+北源 10.4041700905
+进攻性 9.65218240993
+王攘夷 10.6818018271
+食古不化 13.2075304714
+烟雾 8.41588071849
+标兵 10.0940151622
+神经毒素 12.5143832909
+钉好 12.1089181827
+单独海损 13.2075304714
+剑龙 12.5143832909
+专著 7.98447558937
+皮下脂肪 10.2117981979
+探骊得珠 12.8020653633
+枝接 12.8020653633
+登极 8.14810501315
+塔格峰 12.1089181827
+外保温 13.2075304714
+玉衡 11.8212361103
+玉衣 11.0103058941
+木板门 11.5027823792
+万笔 11.598092559
+上翘 10.1871055853
+时日曷丧 13.2075304714
+南开 10.0940151622
+疾首蹙额 13.2075304714
+偶记 12.8020653633
+叶黄素 10.765183436
+量分析 13.2075304714
+椭圆体 13.2075304714
+鲁迅文学奖 13.2075304714
+米拉 10.9562386728
+泛美 10.4666904475
+专营 9.04864738806
+刘自强 11.5027823792
+失笑 11.8212361103
+链表 12.5143832909
+那洪亮 12.8020653633
+基金会 8.37921673411
+北满 11.4157710022
+思考问题 10.4666904475
+堂口 12.8020653633
+钉头 12.1089181827
+中国国际贸易促进委员会 11.5027823792
+北滨 11.1280889297
+拘系 11.8212361103
+耸峙 10.765183436
+热吻 12.5143832909
+上下水道 13.2075304714
+打酒 11.1280889297
+纺纱车 12.8020653633
+筒式 10.9562386728
+景状 13.900677652
+先秦时代 11.1280889297
+上缘 11.3357282945
+崔致远 12.5143832909
+登机 10.4994802703
+流体动力 11.598092559
+仰韶文化 9.26594866375
+张班 12.2912397395
+万篇 12.5143832909
+标准 5.41250140963
+大坪里 13.2075304714
+鹿兆谦 11.2616203224
+香樟 11.2616203224
+拍电影 11.1280889297
+西洋画 10.9562386728
+索偿 13.900677652
+雍容 10.0940151622
+闻兵法 12.8020653633
+恋人 9.43476953332
+受冷 12.1089181827
+朱蕴山 11.9547675029
+雍宁 13.2075304714
+尼科拉 12.5143832909
+北港 11.0103058941
+标出 9.82314020807
+有功之臣 11.9547675029
+堂号 12.5143832909
+泰豪 11.2616203224
+名人传 12.2912397395
+苇席 10.9049453784
+登月 10.0088573539
+高气豪 13.2075304714
+下垫面 10.765183436
+博洛格 13.2075304714
+南征 9.13850371718
+南往 12.5143832909
+库里尔 13.900677652
+上网 7.53249046563
+剑齿 13.900677652
+张玲 13.900677652
+北湖 11.0103058941
+见义勇为者 13.2075304714
+米兰达州 13.2075304714
+岳斌 13.2075304714
+送信儿 13.2075304714
+快捷键 13.2075304714
+酆悌 13.900677652
+索债 12.5143832909
+立萧绎 12.8020653633
+了然于心 11.8212361103
+进化史 11.1926274509
+事理 10.1164880181
+万箱 12.8020653633
+二十六日 10.2897597393
+比得哥什 13.900677652
+独眼 10.4994802703
+批准逮捕 10.6818018271
+张玉 10.4041700905
+及物动词 13.900677652
+七叶树 11.8212361103
+南德 11.8212361103
+综指 9.53122979951
+利俱利 13.2075304714
+格雷维 12.8020653633
+鲁德 12.1089181827
+电场力 11.8212361103
+任汪伪 12.5143832909
+魏斯曼 11.4157710022
+开发新 9.85762638414
+四五倍 11.7034530746
+非人生活 12.2912397395
+鄂毕湾 12.5143832909
+设计业 13.2075304714
+飞彩 11.7034530746
+剑麻 9.56994431169
+哈佐尔 12.5143832909
+励磁 10.4349417492
+百团大战 10.4349417492
+仆参 13.2075304714
+阳江市 11.9547675029
+第一审 10.8561552143
+杠头 13.900677652
+入水 9.63799777493
+从葬 12.5143832909
+综括 13.2075304714
+张特 13.2075304714
+桑佩尔 13.900677652
+雪犁 12.5143832909
+听不出 10.3743171274
+上线 8.20694551317
+丁公府 12.8020653633
+情感化 13.2075304714
+爱立信 12.1089181827
+俏生生 13.2075304714
+中国同盟 12.8020653633
+通三营 13.2075304714
+承压 8.85725253506
+京丰 13.900677652
+在籍 10.765183436
+上级 7.48068272383
+电话费 10.8096351986
+张光辅 13.2075304714
+提职 12.8020653633
+南幸 11.7034530746
+四十三万平方米 13.2075304714
+鲁布 11.9547675029
+南市 11.7034530746
+淌泪 13.2075304714
+嘤嘤 9.85762638414
+南希 12.1089181827
+敢摆 13.900677652
+短期内 6.78590820361
+南师 13.900677652
+上坡路 12.1089181827
+呼吸衰竭 10.1871055853
+荆浩 11.1280889297
+南帝 13.900677652
+京九 11.3357282945
+婚丧嫁娶 10.9562386728
+磨损 8.5488195185
+包交换 13.2075304714
+存抚 12.8020653633
+航空部 12.8020653633
+承受 7.25169310195
+标值 13.900677652
+丰姿 11.0674643079
+泛红 10.4666904475
+林觉民 13.2075304714
+砾石路 13.900677652
+善财难舍 13.900677652
+商大东 13.2075304714
+激磁 12.8020653633
+宪法大纲 11.1926274509
+北漂 12.5143832909
+事略 10.642581114
+烟青 13.900677652
+万站 13.900677652
+四方响应 13.900677652
+课外活动 12.1089181827
+索具 8.91707103027
+于景龙 13.2075304714
+多线程 13.900677652
+领单 13.900677652
+张狂 9.66657114738
+教务会议 12.8020653633
+中国医科大学 11.7034530746
+巨树 11.9547675029
+租米 11.3357282945
+墙根 9.17328983326
+南延 10.765183436
+泰赤 12.1089181827
+万章 12.8020653633
+特辑 12.5143832909
+承包 8.1386262692
+温油炸 12.8020653633
+香港网 8.39941944143
+烟霞 10.1394775363
+特迪 12.8020653633
+微灌 13.900677652
+呼吸系统 9.74179456862
+白面儿 13.900677652
+大量次 13.900677652
+颓然 9.48183704418
+承印 11.9547675029
+烟霏 13.900677652
+皴擦 11.8212361103
+事由 9.59661255877
+锅炉厂 12.1089181827
+梁氏 11.0103058941
+热呼 13.2075304714
+南府 11.0103058941
+连寄 13.2075304714
+恨透了 11.5027823792
+烟霾 13.900677652
+微火 11.9547675029
+银粉 12.2912397395
+渺视 13.2075304714
+杀过 10.0940151622
+辩证唯物 13.2075304714
+火葬 9.5062284973
+南康 11.0103058941
+劳德曼 13.2075304714
+烟霭 12.8020653633
+出身高贵 11.8212361103
+网络带宽 12.5143832909
+黄潮土 12.8020653633
+夏风一 12.5143832909
+郝效忠 13.900677652
+灯饰 11.7034530746
+南充 9.72629038208
+忙前忙后 12.1089181827
+维瓦尔第 12.8020653633
+奎屯 10.4666904475
+立意 9.96885201925
+客观情况 11.1280889297
+事端 9.75754292558
+苯乙烯 10.1394775363
+卸甲 10.9049453784
+连同 7.62968922012
+连名 11.7034530746
+巡游 10.4994802703
+油菜籽 8.48903160012
+一班人马 12.2912397395
+龚澎 13.900677652
+密密缝 12.8020653633
+邢姐姐 12.1089181827
+连吴 13.900677652
+原机 13.2075304714
+南兵 10.1394775363
+南关 9.58318953844
+详阅 13.900677652
+学点 10.9049453784
+鲁兹 10.765183436
+犯有罪行 13.2075304714
+原始时代 11.4157710022
+巨构 13.2075304714
+妇孺皆知 11.1926274509
+标引 11.5027823792
+菱形体 13.900677652
+张紧 11.0674643079
+逮住 9.29550746599
+驳运 12.1089181827
+混合型 7.53764954844
+法桐 11.1926274509
+以眼还眼 11.9547675029
+安敦派 13.900677652
+讨论一下 11.598092559
+仁子 13.2075304714
+夹上 12.5143832909
+军民共建 12.2912397395
+二百多块 12.2912397395
+特聘 11.2616203224
+伊犁马 11.4157710022
+细胞体 11.5027823792
+巨柏 12.5143832909
+足指 13.900677652
+草字头 12.5143832909
+竹盒 13.900677652
+逛商场 12.1089181827
+万用 13.900677652
+标志 6.20993448843
+流氓团伙 12.8020653633
+儿男 13.2075304714
+吴荣根 13.900677652
+监察委员 10.8096351986
+财务计划 13.2075304714
+入寐 13.900677652
+南凉 10.3171587135
+襄垣 10.765183436
+步进式 13.2075304714
+巨木 10.5684731418
+糖原分解 12.1089181827
+岳母 8.88339781516
+间歇式 11.1926274509
+微缩 12.1089181827
+七八万元 12.2912397395
+承尘 13.2075304714
+息斯敏 12.1089181827
+鲁凯 13.2075304714
+大大简化 10.8561552143
+不管是谁 10.2117981979
+破格录用 13.2075304714
+提过 9.85762638414
+便览 13.900677652
+港澳同胞 10.5684731418
+对立统一 10.1630080337
+上焦 11.598092559
+南出 11.1280889297
+水性杨花 11.4157710022
+安努斯 12.8020653633
+言亮先 13.2075304714
+宋吴 12.2912397395
+费雷尔 12.5143832909
+京哈铁路 13.900677652
+执持 12.1089181827
+收获机 11.8212361103
+低音大管 13.2075304714
+多雨区 10.765183436
+互相关心 12.2912397395
+全盘皆活 12.8020653633
+承山 13.2075304714
+银环 11.4157710022
+夹人 13.900677652
+木麻黄 11.0103058941
+慈溪市 11.9547675029
+五万余两 13.2075304714
+鲁军 12.2912397395
+百般阻挠 12.2912397395
+团县委 13.900677652
+脚手架 10.6818018271
+作呕 11.3357282945
+收割下来 13.900677652
+无形性 13.2075304714
+收获期 10.4994802703
+提辖 9.23723855786
+火警 11.3357282945
+成事在天 11.4157710022
+索布 11.9547675029
+紫藤 10.7226238216
+保险法 9.01032852375
+磨损率 13.900677652
+巨杉 11.1926274509
+驯顺 11.4157710022
+墙板 11.9547675029
+西首 12.2912397395
+诚恳 8.74162235276
+便要 8.31342899358
+轻气球 13.2075304714
+师生员工 13.2075304714
+考古界 11.3357282945
+叶乔木 13.900677652
+比哈尔 11.0103058941
+不能到达 11.9547675029
+担架车 12.8020653633
+香料 8.22050504296
+双边关系 10.4994802703
+纠纷案件 11.2616203224
+明令禁止 10.3453295905
+野汉子 12.8020653633
+算得什么 10.4994802703
+便衣 10.0720362555
+沙僧宝 13.2075304714
+逮捕证 12.5143832909
+上点 10.3453295905
+夹住 9.96885201925
+银片 13.2075304714
+宏观决策 11.598092559
+百花齐放 9.85762638414
+银牌 9.87532596124
+张籍 11.1280889297
+路易士 13.900677652
+大姑娘 9.12999302751
+银牙 11.7034530746
+三角皮带 13.900677652
+阴三阳 12.5143832909
+便血 10.4994802703
+中央歌剧芭蕾舞剧院 12.8020653633
+闪电侠 13.2075304714
+云岗石窟 12.8020653633
+法案 8.12612610643
+宋元学 12.5143832909
+标帜 12.1089181827
+一古脑儿 10.2117981979
+综治 11.7034530746
+微细 9.94943393339
+听不得 10.8561552143
+菌褶 11.8212361103
+收费权 12.5143832909
+约束性 9.91169360541
+甚妙 11.0674643079
+烟馆 11.7034530746
+梵文 9.07236391467
+诺韦尔 11.598092559
+丰城 11.2616203224
+一瘸 11.1926274509
+英语口语 13.900677652
+泰莱 13.2075304714
+衡东县 13.2075304714
+万全之策 10.604840786
+篡逆 10.8561552143
+勐海县 12.2912397395
+多万千瓦 10.604840786
+倍于 11.0103058941
+西蒙诺夫 12.1089181827
+吴为真 12.8020653633
+秦宗权 11.598092559
+尤以冬 12.2912397395
+两可之间 12.5143832909
+四五年 10.533381822
+星历表 12.2912397395
+跳过来 11.598092559
+米亚康 12.1089181827
+相映成趣 11.0103058941
+诉讼费用 11.1280889297
+木儿朝 12.8020653633
+形状记忆 12.2912397395
+少记 13.900677652
+邢冉 13.2075304714
+租片 11.8212361103
+紫薇 10.642581114
+招揽生意 11.8212361103
+标准溶液 11.2616203224
+希腊字 13.2075304714
+运货车 10.9562386728
+自主经营 10.4041700905
+北京妇产医院 13.900677652
+立体交叉 10.2371160058
+巨星 9.7898037878
+玉蟾 11.0103058941
+香罗 12.5143832909
+申斯克 12.8020653633
+混合器 13.2075304714
+政治课 11.7034530746
+银狐 12.2912397395
+甚好 9.06439574502
+锅炉工 12.8020653633
+美林集团 13.2075304714
+邮品 12.1089181827
+猥亵行为 13.900677652
+便装 10.4041700905
+免疫力 8.6966709649
+右小腿 12.8020653633
+打野 13.900677652
+专论 10.5684731418
+标底 13.2075304714
+大榆树 12.1089181827
+专访 8.35941410682
+专设 9.77354326693
+松宫亲王 12.8020653633
+枝江 10.3171587135
+巨晶 12.8020653633
+武安县 11.9547675029
+两公里 11.3357282945
+动态随机 12.5143832909
+专讯 12.8020653633
+解除婚约 12.1089181827
+甚多 7.92432674268
+干热岩 12.8020653633
+固定资本 8.02574692112
+剑道 12.5143832909
+纪限仪 12.2912397395
+环保部门 9.72629038208
+马洛耶 13.900677652
+隔门 12.5143832909
+甚大 8.88339781516
+标度 11.1926274509
+字母表 10.8561552143
+吉兰 11.598092559
+连根拔 11.0103058941
+提走 11.7034530746
+多尔钦 12.5143832909
+拌面 12.8020653633
+提起 6.96142370593
+卡塞琳 13.900677652
+深山中 11.1280889297
+南华 9.74179456862
+越往后 11.598092559
+博闻多识 13.900677652
+张锦瑟 12.1089181827
+南南 10.642581114
+莎车县 11.7034530746
+北投 11.5027823792
+尼庵 10.8096351986
+鲁南 10.0088573539
+营养部 13.900677652
+百十处 13.2075304714
+多几倍 11.3357282945
+隆昌 11.4157710022
+鲁卜 13.900677652
+捣蛋鬼 12.8020653633
+鲁卡 11.9547675029
+共鸣箱 11.9547675029
+微电子学 11.8212361103
+南卡 12.8020653633
+地空导弹 9.04864738806
+玉葱 12.8020653633
+削苹果 12.1089181827
+承应 11.5027823792
+瑶家 12.8020653633
+沉淀素 13.2075304714
+慢中子 11.9547675029
+张网 11.0674643079
+张罗 8.40350942668
+碎成 10.9562386728
+承建 10.0720362555
+浅释 12.8020653633
+倾情 11.1926274509
+南北 6.26682409229
+提货 10.4041700905
+鲁北 11.1926274509
+黄而厚 13.2075304714
+特色 6.54887778292
+声情并茂 11.3357282945
+佛门 9.77354326693
+维特之 11.7034530746
+嫁犬逐犬 13.900677652
+上班 7.39788760606
+桓鎏 11.1926274509
+素质教育 10.3171587135
+以身殉国 11.5027823792
+哈维兰 12.8020653633
+抬轿 9.94943393339
+南区 9.93038573842
+饥溺 13.900677652
+张翠 13.2075304714
+李暹 12.2912397395
+报帖 13.2075304714
+李昌谷 13.900677652
+领发 13.2075304714
+河东君 11.0674643079
+共和国宫 13.900677652
+东中西部 11.8212361103
+张翰 12.8020653633
+桐乡 10.8561552143
+蔺家坝 12.5143832909
+女飞行员 13.2075304714
+杯盘狼藉 12.1089181827
+丰吉 12.1089181827
+苏拉河 13.2075304714
+竹琴 11.9547675029
+宁远一 13.900677652
+酆泰 13.900677652
+索居 12.8020653633
+数据信号 13.900677652
+心驰神往 11.7034530746
+南口 9.96885201925
+鲁古 12.8020653633
+大姑妈 12.5143832909
+李麦先 13.2075304714
+卫夫人 12.1089181827
+击中目标 10.9562386728
+高尔察克 13.2075304714
+埃尔斯沃 13.2075304714
+鲁台 12.8020653633
+钻空子 11.1280889297
+鲁史 12.8020653633
+南史 11.1926274509
+张翔 10.4041700905
+南台 10.9562386728
+北房 11.598092559
+罩袍 11.8212361103
+君主政治 13.2075304714
+棕黄色 10.5684731418
+惨无人道 11.5027823792
+鲁厄 13.900677652
+张群 10.8096351986
+研磨成粉 13.2075304714
+岑春煊 9.24671730182
+承平 11.7034530746
+禹汤 13.2075304714
+说一千 13.2075304714
+关键环节 9.5062284973
+太原人 11.9547675029
+气压机 13.900677652
+抬进 9.77354326693
+柔肠 11.2616203224
+怀特海 11.598092559
+两三分钟 11.4157710022
+终结状态 13.2075304714
+驯马 11.4157710022
+依地酸二钠 13.2075304714
+徐正 12.5143832909
+一百 8.4284069783
+雍城 12.1089181827
+哆哆嗦嗦 10.6818018271
+赵龙图 11.2616203224
+索尔 10.1164880181
+王徐卢 13.2075304714
+花环 10.8096351986
+管长达 12.5143832909
+南县 10.604840786
+千差万别 9.75754292558
+清清亮亮 12.5143832909
+翘首以待 10.765183436
+恒春镇 12.5143832909
+求教 10.4349417492
+应秉赋 13.900677652
+之珠 11.9547675029
+微粉 12.5143832909
+千百两 13.2075304714
+管控 9.18217878068
+非党人士 13.2075304714
+承德 9.02548032877
+今生今世 10.3453295905
+甚密 10.8561552143
+鸡爪 10.4041700905
+千百个 11.0103058941
+笑面 12.8020653633
+银灰 12.8020653633
+措置裕如 13.900677652
+血手印 12.5143832909
+玉蕊 12.8020653633
+委罪 12.8020653633
+香果 12.2912397395
+轻骑兵 10.642581114
+白大夫 13.900677652
+西南边 11.7034530746
+微粒 9.20932976975
+斯塔 10.9562386728
+斯蒂勒 13.900677652
+香林 12.8020653633
+棕丝 12.1089181827
+任喀山 13.2075304714
+诛连九族 13.900677652
+上犹 11.1280889297
+投笔从戎 11.1280889297
+天菩萨 13.900677652
+营养量 12.8020653633
+图卢兹 11.0103058941
+二百多名 11.8212361103
+四五尺 11.9547675029
+闻贵爵 13.900677652
+馏分油 10.9562386728
+含牙囊肿 13.900677652
+师伯 13.900677652
+提租 12.2912397395
+桑苗 13.2075304714
+马绍尔群岛 10.6818018271
+香柏 11.9547675029
+秦桧死 12.8020653633
+连坐 10.1630080337
+二十余 9.36807815882
+耸出 12.5143832909
+香柚 12.5143832909
+相映成辉 13.2075304714
+吸热反应 13.900677652
+桑枝村 13.2075304714
+北鲁 12.8020653633
+升旗仪式 10.8561552143
+师传 12.1089181827
+毽子 12.2912397395
+苇叶 11.598092559
+巨擘 11.0103058941
+血迹 8.79473217808
+斯堪 11.4157710022
+油画笔 12.2912397395
+详加说明 13.2075304714
+焦尔达 13.2075304714
+标尺 9.94943393339
+斯堡 10.765183436
+提调 10.3171587135
+北援 13.2075304714
+裁判权 11.9547675029
+宿业 13.900677652
+香柱 13.2075304714
+南勇 11.5027823792
+张绣 10.765183436
+蒙逊 11.5027823792
+张继 10.8561552143
+保温板 13.2075304714
+隆林 11.3357282945
+虞王司 13.2075304714
+宏观调节 13.900677652
+万盛 12.8020653633
+四五岁 11.0674643079
+出口导向型 10.3453295905
+保温杯 13.2075304714
+葛先生 13.2075304714
+万盏 11.3357282945
+详细分析 11.0674643079
+长江三角 13.2075304714
+宁安镇 13.2075304714
+足不出户 10.4994802703
+仆役 9.5062284973
+个位数 10.765183436
+倾颓 11.7034530746
+孙铭九 12.5143832909
+张绍 10.765183436
+上爬 8.84443184663
+错落有致 10.6818018271
+必达 12.8020653633
+菜窖 13.900677652
+集装箱 8.84443184663
+史弥远 11.8212361103
+黄绍兹 12.8020653633
+银烛 13.2075304714
+老妹子 13.900677652
+张红 11.7034530746
+怕得很 13.2075304714
+贾夫纳 13.900677652
+松花江畔 11.9547675029
+李德生 11.5027823792
+飞将军 11.4157710022
+张纯 11.7034530746
+班超之 13.2075304714
+耸入 13.2075304714
+上牌 10.0940151622
+特陆子 13.2075304714
+酚类化合物 12.2912397395
+连城 10.3453295905
+调味瓶 13.900677652
+魏国皮 12.8020653633
+米亚尔 13.900677652
+奎德 13.2075304714
+天光云影 13.900677652
+香杨 13.900677652
+泛爱 12.2912397395
+烟鬼 11.5027823792
+愿望 7.42370528909
+描图 13.900677652
+等于 6.52542187397
+承当 9.91169360541
+对望一眼 11.9547675029
+财务纪律 13.900677652
+李石曾 11.9547675029
+专要 11.1926274509
+微米 8.76487921493
+国家税务总局 9.38981814546
+三十五块 13.2075304714
+闰秒 13.900677652
+德祖赞 12.8020653633
+波兰文 13.900677652
+五子棋 12.5143832909
+丰功 13.900677652
+夜班车 13.2075304714
+老马 8.91707103027
+育龄 11.8212361103
+组织观念 12.1089181827
+毫无道理 10.8096351986
+再接再励 13.2075304714
+火辣 10.8561552143
+蹶子 12.5143832909
+示意 7.66626692626
+马梅多夫 13.900677652
+含气面积 13.2075304714
+连分数 11.598092559
+低头 7.13333452671
+玉色 10.9049453784
+水土流失 8.44963919841
+照签不误 13.900677652
+驳议 13.900677652
+两百三十万 13.2075304714
+吴哥窟 12.1089181827
+张祚 13.900677652
+临界期 13.900677652
+奎塔 13.900677652
+扭过头来 10.8096351986
+胡艳萍 12.8020653633
+倒锁 13.900677652
+宋江听 9.75754292558
+阴阳眼 11.0674643079
+疏勒县 13.2075304714
+碳酸气 12.2912397395
+那维亚 11.7034530746
+波浪状 11.9547675029
+嘴里 6.73286846766
+一顿饭 8.74738605748
+逼人太甚 13.900677652
+南唐 8.77077893705
+弃恶从善 13.900677652
+呼中 12.5143832909
+中军帐 10.3171587135
+汤米 13.2075304714
+张礼 12.8020653633
+埋怨起来 12.8020653633
+夭夭 13.2075304714
+维雪克 13.2075304714
+旧知 13.900677652
+惹气 12.1089181827
+叶藻苔 13.900677652
+反对票 10.4041700905
+木儿拥 13.2075304714
+贰本 13.2075304714
+子义真 12.5143832909
+隆恩 10.7226238216
+蒙音 12.8020653633
+指战员 10.0720362555
+皮件 12.1089181827
+亚利安 12.8020653633
+万燕 13.900677652
+皮下 9.20932976975
+提请 8.91707103027
+弄性尚气 13.900677652
+张彦泽 13.900677652
+碑学 12.2912397395
+铁面无私 10.604840786
+便路 13.2075304714
+信丰红 13.2075304714
+第三十九回 12.2912397395
+大清真寺 10.9049453784
+法联军 11.4157710022
+鸣不平 10.8561552143
+银矿 10.0940151622
+巴兰钦 11.5027823792
+敲钟人 13.2075304714
+须至榜 13.2075304714
+鸡犬不宁 10.7226238216
+上画 9.89334446674
+吴书记 11.7034530746
+上田 12.2912397395
+离合悲欢 13.2075304714
+校办工厂 12.8020653633
+皮丹 12.5143832909
+黄安拿 13.2075304714
+姚察者 13.2075304714
+王铨忠 13.2075304714
+剑锋 10.2117981979
+丰利 12.8020653633
+浅露 13.2075304714
+甚小 10.533381822
+登海 9.77354326693
+盐份 13.900677652
+附耳低言 10.4041700905
+标定 10.4041700905
+二百多号 13.2075304714
+上界 9.62401153296
+五十余家 13.2075304714
+二百多只 13.900677652
+隆情 13.2075304714
+末笔 13.900677652
+张禹 12.8020653633
+提议 7.86999239171
+甚少 9.02548032877
+副馆长 11.0103058941
+倾其所有 11.598092559
+火车 7.55679721785
+张禄 13.2075304714
+索娃 13.2075304714
+玉花 12.8020653633
+纯度 9.36807815882
+蒙面 11.0674643079
+火轮 10.6818018271
+竹片 10.7226238216
+埋着 10.0940151622
+党群 12.5143832909
+通缉令 10.533381822
+比斯拉 12.8020653633
+二百多双 13.2075304714
+玉芬 10.1871055853
+子震恐 13.2075304714
+上略 12.5143832909
+蝉衣 12.5143832909
+母党 13.2075304714
+混合区 12.2912397395
+枝梗 13.900677652
+脱空 12.5143832909
+终非 10.8096351986
+渺茫 9.28555713513
+丰厚 8.089536659
+小组会议 11.9547675029
+示性 12.8020653633
+北斋 12.8020653633
+岳湖 12.8020653633
+北斗 9.66657114738
+异曲同工 10.4349417492
+责难 9.77354326693
+压舱物 13.900677652
+银白 10.1630080337
+抽印 13.900677652
+朱衡 8.94485059437
+万灵 11.8212361103
+阜平 11.4157710022
+党羽 9.30555780184
+绞尽脑汁 10.4666904475
+令人同情 13.900677652
+末端 8.07763175649
+丰县 10.8096351986
+纸盒子 13.900677652
+附息 7.00499495423
+龙王爷 10.0505300503
+途程 11.0103058941
+习弓马 12.8020653633
+蒙难 12.1089181827
+章完纳 12.8020653633
+孟良崮 11.598092559
+北方 6.17050285673
+机械效率 11.7034530746
+从头到脚 9.98865464655
+迟钝 9.18217878068
+黄泥河 11.8212361103
+金相学 12.8020653633
+道义感 13.900677652
+自行检验 13.900677652
+南吕 12.2912397395
+连克 10.3171587135
+滴水不漏 10.8561552143
+南向 9.14708746087
+充分保证 12.1089181827
+电器厂 13.900677652
+斯帕 12.5143832909
+马洛蒂 13.2075304714
+种鸟 13.2075304714
+重新安装 13.2075304714
+别当 11.598092559
+丰台 10.3453295905
+脑积水 11.3357282945
+化工公司 11.7034530746
+员工工资 11.0103058941
+百亿立方米 12.8020653633
+连兵 11.8212361103
+苯甲 11.7034530746
+经营部 12.1089181827
+玛拉沁夫 12.5143832909
+又会到 13.900677652
+韩擒虎 11.1280889297
+刽子手 9.6811699468
+延绵 11.0674643079
+连写 11.598092559
+广通渠 11.2616203224
+连接线 12.5143832909
+杨小凯 13.900677652
+获奖作品 10.4349417492
+年轻人 7.05479777671
+波心荡 13.2075304714
+公谋父 13.2075304714
+闯荡江湖 11.7034530746
+厌战心理 13.900677652
+承天 10.4041700905
+成大功 10.9562386728
+老丈人 10.2117981979
+书不尽言 12.5143832909
+银盾 13.900677652
+八里庄 13.2075304714
+狄尔斯 12.2912397395
+愣头青 11.7034530746
+特征描述 13.2075304714
+北支 9.58318953844
+连冲 13.2075304714
+银盐 11.8212361103
+碎料 12.8020653633
+档案管理 11.4157710022
+高磁纬 13.900677652
+连冠 13.2075304714
+蒙阴 11.9547675029
+夸拉州 13.2075304714
+丰南 11.7034530746
+希腊式 12.1089181827
+未可厚非 13.2075304714
+末稍 13.900677652
+没面子 11.598092559
+一百多页 13.2075304714
+冲绳县 12.8020653633
+李保田 13.900677652
+理查德森 12.8020653633
+花猫 11.7034530746
+四部丛刊 10.0940151622
+火奴鲁鲁 11.1280889297
+发条 10.2897597393
+四肢发达 11.598092559
+营养霜 12.5143832909
+特藏 13.2075304714
+俯首就范 13.900677652
+墨笔画 13.900677652
+专辑 11.0674643079
+玉莲 10.4666904475
+偶而 10.4666904475
+万点 9.66657114738
+愿意 5.90167043873
+巨手 11.598092559
+马格尼 11.7034530746
+修订案 12.5143832909
+枝桠 9.96885201925
+那山客 12.5143832909
+管教 9.01787572939
+品牌网 13.2075304714
+奶声奶气 12.1089181827
+交通运输 7.27395990273
+悦意 11.9547675029
+竹炭 12.5143832909
+援例 12.8020653633
+四五处 12.8020653633
+负序 12.8020653633
+纯属 8.96620371885
+鹰洋 11.7034530746
+便车 12.2912397395
+盒式磁带 12.2912397395
+鸡眼 11.1280889297
+贝利尼 11.4157710022
+连刺 12.2912397395
+四五天 10.9562386728
+连到 10.9049453784
+剑鞘 10.604840786
+暗中 7.28060444545
+任家村 13.900677652
+冰糖 9.54396882529
+南坪 10.8096351986
+解毒剂 10.8096351986
+驴唇不对马嘴 12.5143832909
+肯特 10.765183436
+中央局 10.4666904475
+糍粑 11.8212361103
+钉入 13.900677652
+时代广场 11.7034530746
+路引兵 13.2075304714
+网络故障 13.900677652
+十几把 12.8020653633
+吕素初 12.5143832909
+责问 9.56994431169
+黄化病 13.2075304714
+连剑 13.900677652
+兴修水利 9.28555713513
+时代华纳 11.8212361103
+回肠 11.2616203224
+闹翻 10.0294766411
+张含英 12.8020653633
+惶然 11.9547675029
+南土 11.4157710022
+叶志清 9.96885201925
+微秒 11.0674643079
+独立运动 9.7898037878
+南越平 13.2075304714
+碍于面子 13.2075304714
+风罩 13.900677652
+课业 12.1089181827
+姜花族 13.900677652
+歌颂 8.20023407859
+受胎率 12.1089181827
+脱产干部 11.8212361103
+朝气蓬勃 11.0103058941
+职工基本 12.2912397395
+系统性 8.08356649201
+上石 13.2075304714
+复决 13.900677652
+课上 12.2912397395
+阿里巴巴公司 11.0674643079
+北曲 10.4666904475
+上知 11.9547675029
+二百多元 12.8020653633
+上真 11.8212361103
+耸听 13.900677652
+愣愣 9.56994431169
+南城 9.21854642485
+暗事 12.8020653633
+课件 11.7034530746
+鲁城 12.5143832909
+祖恒之 13.900677652
+租界 8.62256299275
+现货交易 10.0294766411
+差以毫厘 13.900677652
+幸存者 9.6811699468
+玉胎 11.4157710022
+排中律 11.7034530746
+课以 11.5027823792
+莫若 10.4041700905
+上眼 10.9049453784
+不得闲 11.1926274509
+呐喊助阵 13.2075304714
+江浙沪 13.2075304714
+知错就改 12.8020653633
+彭水苗族土家族自治县 12.2912397395
+欧共体 9.35738286971
+秦震猛 13.2075304714
+三十二度 13.900677652
+封临淮 13.2075304714
+鹅掌楸 10.2630914922
+甚广 9.22784881751
+敬候佳音 13.900677652
+热力 8.96620371885
+葛洲坝 9.04086524761
+连加 13.2075304714
+夭寿 13.900677652
+衰减系数 12.8020653633
+剑靶 13.900677652
+特许状 11.1280889297
+迫不及待 8.37522471284
+唇齿之邦 13.2075304714
+依法治国 12.1089181827
+黑龙江省政府 13.2075304714
+磨料 10.4994802703
+玉肌 13.2075304714
+一万亿美元 13.900677652
+塔兰顿 12.5143832909
+春耕生产 13.2075304714
+英国牛津大学 10.2630914922
+杯酒 8.21031819765
+新秦中 12.5143832909
+通电子 11.7034530746
+陈植锷 13.2075304714
+新市村 13.900677652
+庞泉沟 13.2075304714
+明道藏 13.2075304714
+虚有 12.2912397395
+紧邻着 13.2075304714
+王用汲 13.900677652
+学生腔 12.8020653633
+艾默伊 13.900677652
+驯鹿 8.39128931535
+近乡情怯 13.900677652
+提要 9.72629038208
+爱小 12.8020653633
+性相近 13.900677652
+租用 9.65218240993
+常用字 12.1089181827
+雇马 13.900677652
+解甲归田 10.9562386728
+杨玉环 11.598092559
+拉杰布 13.2075304714
+陕县 9.94943393339
+碎末 11.3357282945
+北极 8.39534611604
+有效途径 9.91169360541
+政府首脑 9.00283785202
+管枪 13.900677652
+北林 12.8020653633
+采油速率 13.900677652
+种麦 11.3357282945
+同母兄弟 12.8020653633
+不久任 12.8020653633
+屡禁不绝 11.9547675029
+王宗沐 13.2075304714
+力薄才疏 13.2075304714
+茅庐 10.1164880181
+高度化 13.2075304714
+课余 10.765183436
+学员队 13.900677652
+暗伤 12.2912397395
+玉腿 12.8020653633
+互相矛盾 10.6818018271
+梁刚 11.4157710022
+万特 11.8212361103
+格雷罗 12.1089181827
+础石 13.900677652
+上皮 9.40086798165
+憾事 11.7034530746
+承安 11.5027823792
+激灵 9.94943393339
+戴宗兄弟 13.2075304714
+皮尤河 12.8020653633
+岳池 12.5143832909
+王嘉庆 13.900677652
+斯山 12.5143832909
+马超引 13.2075304714
+上盘 11.1926274509
+报界 11.9547675029
+打糕 12.8020653633
+柯贝特 12.5143832909
+暴利 8.76487921493
+假日办 12.8020653633
+四号线 13.2075304714
+连南 11.9547675029
+管柱 12.2912397395
+内衣模特 12.8020653633
+到此为止 9.62401153296
+吸收系数 11.7034530746
+专责 11.3357282945
+内感受器 12.5143832909
+斯尔 13.2075304714
+负心 10.6818018271
+夏后氏 11.3357282945
+奇特性 13.2075304714
+甚微 9.54396882529
+刘义欣 13.2075304714
+上相 12.2912397395
+口语记录 12.5143832909
+中等量 12.1089181827
+通经 10.8096351986
+经济战线 13.2075304714
+二十发 12.2912397395
+掩映着 12.2912397395
+相干长度 13.2075304714
+农忙时节 12.8020653633
+政治账 12.5143832909
+冬妮娅 12.5143832909
+屠拉蒂 12.8020653633
+伯纳姆 13.2075304714
+在理 10.642581114
+纠合 10.1630080337
+汤罐 13.2075304714
+大量排 12.8020653633
+一毛 11.4157710022
+微码 12.8020653633
+激烈 6.50127956864
+一着 9.32596667347
+鸡皮 11.8212361103
+英姿焕发 13.900677652
+马牛羊 11.9547675029
+银瓶 11.1926274509
+汤羹 13.900677652
+其乐融融 10.9562386728
+南回 13.2075304714
+北朝 8.60737282725
+玉臂 12.2912397395
+表现者 11.8212361103
+新街 11.1280889297
+上瘾 10.2117981979
+帕埃尔 13.2075304714
+日俄战争 9.71102290995
+汉平帝 11.598092559
+连县 11.9547675029
+管有 13.900677652
+张立 13.900677652
+南园 12.1089181827
+丰儿 10.6818018271
+泛白 11.4157710022
+剑阁 9.98865464655
+索契 13.900677652
+自行处理 11.7034530746
+南国 9.5186510173
+鲁国 9.49395840471
+河沿 11.0674643079
+可拨打 10.4349417492
+站哨 13.2075304714
+连发 8.85725253506
+收效良好 13.900677652
+会画 13.2075304714
+吴晓波 12.5143832909
+索夫 11.2616203224
+宗耶律 12.1089181827
+拘留 8.85725253506
+斯岛 11.598092559
+北村 13.900677652
+愿挨 12.2912397395
+别弹 13.2075304714
+饱经 11.8212361103
+万状 11.1926274509
+北来 9.91169360541
+善攻者 13.2075304714
+南方网 12.8020653633
+北条 12.8020653633
+消毒水 12.8020653633
+奎宁 10.7226238216
+陕南 9.82314020807
+瓯绣 12.1089181827
+连号 12.5143832909
+官僚资本主义 11.1926274509
+管材 10.7226238216
+黄红麻 10.8561552143
+李普曼 11.8212361103
+必读 9.96885201925
+无产阶级化 12.8020653633
+管束 9.80633308975
+挣了钱 11.5027823792
+香粉 11.7034530746
+西哈努克 10.6818018271
+竹溪 11.8212361103
+二十一幅 13.2075304714
+达尼尔 13.2075304714
+罗塞尔 13.2075304714
+付予 12.8020653633
+侵染 10.5684731418
+张数 11.8212361103
+双溪寺 13.900677652
+钉住 10.3743171274
+团年饭 13.2075304714
+有眉目 10.8561552143
+反常 8.59737274392
+数分钟 10.3743171274
+年轻化 9.94943393339
+蔬菜栽培 11.8212361103
+浅议 13.2075304714
+玉鹰 13.900677652
+张敏 12.1089181827
+宇宙论 12.1089181827
+金银线 11.9547675029
+丰产 9.5186510173
+闰日 12.1089181827
+反帝 8.71889410168
+香粳 12.5143832909
+难割难舍 12.8020653633
+气候资源 11.3357282945
+碎砖 11.4157710022
+郎木寺 12.5143832909
+设计奖 11.9547675029
+型式 8.98802276624
+简到繁 12.8020653633
+斯芬克斯 11.598092559
+石立界 12.8020653633
+华治华 12.2912397395
+皮勒 13.900677652
+办案人 12.5143832909
+下课铃 11.8212361103
+末枝 13.900677652
+触发式 13.900677652
+历二主 13.2075304714
+北平市 11.7034530746
+蒙语 10.2897597393
+轻踏 13.900677652
+土坯房 11.3357282945
+西飘 12.8020653633
+德国汉莎航空公司 13.2075304714
+龙眼肉 11.4157710022
+木儿继 12.5143832909
+梨园戏 12.5143832909
+删帖 13.900677652
+吉剧 13.900677652
+担架队 12.1089181827
+浅说 12.5143832909
+和海子 13.900677652
+努佩 12.8020653633
+钱钟书 11.1926274509
+不稂不莠 13.2075304714
+微服 11.0103058941
+徐静蕾 12.5143832909
+中国摄影家协会 13.900677652
+丰业 12.5143832909
+溃不成军 10.3171587135
+面部轮廓 13.900677652
+张旭 9.91169360541
+乌托邦 10.0294766411
+不能解救 13.900677652
+墙缝 11.1280889297
+混合体 11.0103058941
+红小鬼 13.2075304714
+东富 13.2075304714
+荒谬绝伦 12.5143832909
+马海盆 13.900677652
+侵权 9.29550746599
+反对方 13.900677652
+栽培业 13.900677652
+琉球群岛 10.4349417492
+西风 8.98069672615
+反序 13.2075304714
+毛敏仲 13.2075304714
+东寺 13.2075304714
+惨淡经营 10.533381822
+丰丽 13.2075304714
+反应 5.78008894024
+微机 10.7226238216
+纪及马 13.2075304714
+女低音 12.5143832909
+签字国 11.7034530746
+无所适从 9.85762638414
+文本属性 13.2075304714
+漳浦 11.7034530746
+皮制 11.4157710022
+丹东 9.14708746087
+东宗 13.900677652
+丰乐 9.91169360541
+元昊选 13.2075304714
+鱼鳞状 11.9547675029
+万涛 13.900677652
+卫将军 10.604840786
+君子成人之美 12.8020653633
+伸过 10.765183436
+岳王 11.4157710022
+张新 11.4157710022
+麝牛 11.7034530746
+东宁 11.598092559
+古玩店 11.598092559
+末期 7.57452817882
+育草 13.2075304714
+东安 10.2897597393
+东家 9.22784881751
+丰乳 13.900677652
+侯祥麟 12.8020653633
+张文 10.9049453784
+激进分子 11.8212361103
+六七公里 13.900677652
+摆起 11.1280889297
+白唇鹿 10.0294766411
+张斌 12.1089181827
+有产 11.1926274509
+幽默小说 13.2075304714
+马符验 13.2075304714
+提鞋 13.2075304714
+香米 11.9547675029
+埃默里 12.2912397395
+东宫 9.35738286971
+玉麦 13.900677652
+盛极而衰 11.5027823792
+艺术感染 13.900677652
+葛云飞 12.5143832909
+关起门来 10.533381822
+万江 12.5143832909
+零点公司 13.900677652
+厨房电器 11.8212361103
+航海法 13.2075304714
+付产 13.900677652
+纵横开合 13.900677652
+皮厚 11.4157710022
+寻开心 11.0674643079
+孟弗之 10.6818018271
+反弹 5.59100075599
+上梁 11.2616203224
+芦苇丛 9.94943393339
+愤世疾俗 12.1089181827
+精品化 12.8020653633
+皓首穷经 13.2075304714
+漳泽 10.6818018271
+自动车 11.8212361103
+零三个 12.2912397395
+反式 10.5684731418
+千百名 13.900677652
+便道 8.06879517469
+到访 10.1164880181
+阿姆哈 11.2616203224
+墙纸 11.8212361103
+曼尼普尔 12.2912397395
+红日西 11.8212361103
+天蝎座 10.8096351986
+动态化 12.1089181827
+二百多万 11.8212361103
+提防 8.23771717184
+育苗 9.53122979951
+人造磁铁 13.2075304714
+万民 8.87679713113
+喷火口 12.1089181827
+详载 11.598092559
+暗光 11.598092559
+花莲港 11.5027823792
+烟膏 11.9547675029
+钉下 12.8020653633
+上棉 13.2075304714
+万氏 11.8212361103
+角质层 10.0940151622
+阿加莱 13.900677652
+呛到 11.9547675029
+育英 13.2075304714
+后不巴店 12.8020653633
+漳河 9.80633308975
+伊尔库茨克州 13.900677652
+桔井 13.2075304714
+岳父 8.20358416547
+纠察 10.5684731418
+管科 13.900677652
+库马尔 13.900677652
+魏末郦 13.2075304714
+巨细 11.4157710022
+丰俭 13.900677652
+呼号 10.2897597393
+熊猫手机 13.900677652
+卡逊 13.900677652
+微明 9.96885201925
+近东地区 11.8212361103
+反德 12.5143832909
+上栏 13.900677652
+燕的武 13.2075304714
+往东方 12.8020653633
+微星 12.5143832909
+反击式 13.2075304714
+金针虫 11.8212361103
+上标 11.2616203224
+变节分子 13.2075304714
+呼叫 8.53003962385
+万泉 12.5143832909
+任张嘉 13.2075304714
+参比电极 11.598092559
+厦门路 11.1926274509
+化王噶 13.2075304714
+皮匠 10.2897597393
+吴谷平 13.2075304714
+漱口 9.75754292558
+每头 11.598092559
+侵晨 12.5143832909
+华夏证券 12.2912397395
+莫问奴 13.2075304714
+上校 9.35738286971
+国际海事组织 12.2912397395
+玉龙 9.55687223012
+奇遇记 12.2912397395
+围剿 8.27666014579
+晋伐鲜 12.8020653633
+花莲溪 12.5143832909
+评点 10.2630914922
+上桌 10.642581114
+西至云 12.5143832909
+贾拓夫 12.8020653633
+枣树林 11.1926274509
+山丘区 10.6818018271
+在思想上 9.96885201925
+武帝禁 13.2075304714
+一瞧 9.54396882529
+麻沸散 11.8212361103
+山坡地 11.3357282945
+霍吉斯 11.8212361103
+皮卡 10.8096351986
+王莽托 13.2075304714
+费城 9.08039608637
+北票 11.0674643079
+鸡棚 12.5143832909
+头足纲 11.1926274509
+课内 13.2075304714
+微晶 10.4041700905
+上档 10.0720362555
+东奔 12.2912397395
+激流 8.75901409547
+柔顺 10.642581114
+心苦 13.2075304714
+陕人 13.900677652
+巴雷克 12.5143832909
+张杨 11.3357282945
+马少爷 13.2075304714
+竹沥 12.8020653633
+报业网 12.2912397395
+罗龙文 13.2075304714
+艺能 11.9547675029
+张杰 11.5027823792
+连下 10.6818018271
+心慌撩乱 13.900677652
+派上用场 10.533381822
+圣帕特里克 12.8020653633
+铝勺 13.900677652
+张松 10.1871055853
+还算 8.27666014579
+正兴 13.2075304714
+张权 12.5143832909
+反将 11.4157710022
+历世 11.8212361103
+三国志 9.84023464143
+嘴边 8.73589167805
+激浪 11.4157710022
+上段 10.604840786
+失魂落魄 9.87532596124
+陈其美 10.8096351986
+张李 13.900677652
+迟误 9.55687223012
+香纸 12.2912397395
+连个 8.24818847171
+张村 11.4157710022
+连中 11.9547675029
+徐嘉瑞 13.2075304714
+蔑视 8.89673134603
+详谈 11.1926274509
+管家婆 10.1164880181
+托言 12.2912397395
+二十二艘 13.2075304714
+连乘 12.8020653633
+特马 11.5027823792
+洛依卡 12.5143832909
+蒙见 12.5143832909
+解毒丸 13.2075304714
+浅见 11.2616203224
+评估费 11.7034530746
+火里 10.0294766411
+嗜铬细胞 11.5027823792
+连义 12.5143832909
+平安险 12.2912397395
+开发热 12.5143832909
+北站 10.642581114
+十里长亭 11.598092559
+东夷 9.91169360541
+东头 9.4233408375
+北端 8.73589167805
+潼关县 12.1089181827
+张有 11.4157710022
+悠悠扬扬 13.2075304714
+烟花 9.45802639549
+东大 11.7034530746
+尼普顿 13.900677652
+张朗 12.5143832909
+汇合口 12.5143832909
+北竿 12.8020653633
+张望 8.37522471284
+专送 13.2075304714
+大大降低 8.87023973058
+璇宫 13.2075304714
+阳方口 13.2075304714
+三万余次 13.2075304714
+管弦乐队 10.0294766411
+连云 11.1926274509
+牛蹄 11.8212361103
+委曲 10.1164880181
+紫萁 11.9547675029
+张柬 13.2075304714
+公私分明 12.2912397395
+灯谜 10.8561552143
+连于 11.1280889297
+住址 10.1394775363
+提问 8.2273543848
+京官 9.0884932966
+布线图 13.900677652
+上款 11.2616203224
+哈德拉毛 13.900677652
+泰顺 12.1089181827
+优闲 13.900677652
+张柏 13.900677652
+柔风 12.8020653633
+吃闭门羹 12.5143832909
+张某 9.82314020807
+刘大白 11.8212361103
+张柔 11.0674643079
+果真如此 10.0940151622
+政治部 8.36334338496
+龙颜不悦 13.2075304714
+上次 7.47257237929
+从早到晚 10.0720362555
+良辰美景 10.9562386728
+师师如 12.8020653633
+等速电泳 13.2075304714
+敢扯 12.1089181827
+劳动法 9.85762638414
+田园生活 11.5027823792
+王喜带 13.2075304714
+情绪性 12.1089181827
+平娜 13.900677652
+从重处理 12.2912397395
+壬午年 13.2075304714
+杯赛 10.9562386728
+叙述性 13.2075304714
+颍河 10.2630914922
+张永入 13.2075304714
+闰月 11.0674643079
+印度人 8.77671367257
+奥尔良 10.4994802703
+事态 8.4284069783
+和平鸽 11.5027823792
+隆维 13.2075304714
+春笋 10.9049453784
+抓饭 12.2912397395
+举国欢庆 11.5027823792
+突然袭击 9.22784881751
+大串联 11.1280889297
+眼前一亮 9.85762638414
+迈德 12.5143832909
+血肿 10.5684731418
+特高 11.1926274509
+阿尔诺河 13.2075304714
+回车 10.5684731418
+上步 12.1089181827
+鸡毛 9.46986085313
+讨债人 13.2075304714
+谷城县 12.5143832909
+张果 12.8020653633
+管管 10.3453295905
+谈天说地 11.7034530746
+东塔 12.2912397395
+囊胚 11.598092559
+从一而终 11.5027823792
+回旋余地 10.3743171274
+换尿布 11.8212361103
+上檐 12.8020653633
+皮内 10.8561552143
+东塘 12.5143832909
+渐生 11.7034530746
+解盐司 13.2075304714
+呼入 12.8020653633
+张晶 11.2616203224
+邵维正 12.8020653633
+纪监委 12.8020653633
+自然规律 9.46986085313
+敢找 13.2075304714
+卡拉干达 12.1089181827
+黄狮精 12.5143832909
+门岗 12.1089181827
+闲云野鹤 11.5027823792
+白沫 10.4041700905
+张晏 12.5143832909
+马扎里沙里夫 12.8020653633
+鼓出来 12.1089181827
+育肥 11.7034530746
+在案 10.3171587135
+井田制度 13.900677652
+保护关税 10.1164880181
+扶鸾 12.5143832909
+解盐发 13.2075304714
+市场部 8.88339781516
+桐城 10.2371160058
+雍丘 10.9562386728
+乌鲁木齐县 12.8020653633
+寄售 12.8020653633
+连作 10.7226238216
+张春 10.533381822
+氯乙烷 10.9562386728
+哨音 11.7034530746
+连体 11.0674643079
+张昭 9.85762638414
+氯乙烯 10.6818018271
+进锐退速 13.900677652
+火药枪 13.900677652
+常回家 12.8020653633
+吴健彰 12.8020653633
+银根 9.93038573842
+冬虫草 11.9547675029
+在校 9.20932976975
+下门 12.5143832909
+刘义真 13.900677652
+沙丁鱼 9.96885201925
+囊肿 10.2897597393
+张昊 13.2075304714
+女大须嫁 12.8020653633
+滇西南 11.0674643079
+张明 10.2897597393
+爻象 12.1089181827
+张昌 10.9049453784
+小转弯 13.2075304714
+克里雅河 11.4157710022
+攀山 12.1089181827
+梦中人 11.3357282945
+党纲 10.3171587135
+相配套 10.8561552143
+商务礼品 13.900677652
+维吾尔文 10.9049453784
+刘友 11.9547675029
+汇集点 13.900677652
+科教文卫 12.2912397395
+陆树 13.2075304714
+列特 11.8212361103
+张昌绍 13.2075304714
+呼出 10.2117981979
+广播电视 9.56994431169
+一百五六十年 13.2075304714
+戴密微 11.9547675029
+宪政改革 12.8020653633
+无烟工业 12.2912397395
+东壁 11.1280889297
+火速 8.15447446144
+事实如此 12.5143832909
+张曼 13.2075304714
+激波 10.2371160058
+掀帘子 11.7034530746
+陈诚任 12.2912397395
+丙子年 13.900677652
+攀岩 11.2616203224
+课取 13.900677652
+连侬 12.8020653633
+晴朗朗 13.2075304714
+打鱼人 11.3357282945
+皮儿 11.0674643079
+孩儿巷 13.2075304714
+管笛 12.5143832909
+二十六点 13.900677652
+张曜 13.2075304714
+中国工会 12.5143832909
+当家做主 11.3357282945
+皮克 10.7226238216
+黄纸 9.62401153296
+万源 11.9547675029
+反差 9.19114745066
+银梭 13.900677652
+漏收 12.2912397395
+东墙 10.8561552143
+赤白痢 13.900677652
+东境 10.533381822
+多模 11.8212361103
+酒杯子 12.5143832909
+京片子 12.8020653633
+竹海 12.1089181827
+陆公子 13.2075304714
+八点半 11.8212361103
+笑容可掬 10.0940151622
+浅表 10.8096351986
+简谐波 12.5143832909
+暗叫 12.5143832909
+暗号 9.69598503258
+迎着 8.57280148319
+旧体 13.900677652
+提款机 11.1280889297
+巍巍泰山 13.900677652
+亟待解决 10.6818018271
+西伦佩 12.5143832909
+蒲安臣 12.2912397395
+皮具 11.598092559
+刘向奉 12.8020653633
+夹剪 13.2075304714
+必选 11.4157710022
+张慧 10.8096351986
+费奥 13.900677652
+公交系统 12.1089181827
+自鸣钟 10.2117981979
+雍容华贵 10.604840786
+暗合 10.2117981979
+上涌 10.1630080337
+智化寺 12.8020653633
+眈眈 12.8020653633
+王国遂 12.1089181827
+胶状物 11.8212361103
+产品质量 8.38322475551
+呼噪 13.900677652
+邬作霖 11.9547675029
+碎纸机 11.598092559
+兵油子 11.9547675029
+东影 13.2075304714
+呼噜 10.1394775363
+洛阳纸贵 13.2075304714
+暗含 10.1630080337
+詹森派 12.8020653633
+金针菜 11.4157710022
+打卡机 13.900677652
+倍受 10.1164880181
+上涨 4.69776479583
+金针菇 11.1280889297
+蒙达 11.3357282945
+深深宝 11.9547675029
+新款手机 13.900677652
+窝囊气 11.1280889297
+皮囊 9.62401153296
+东引 12.8020653633
+军体拳 13.2075304714
+库里亚 11.8212361103
+电源屏 12.1089181827
+分散染料 13.900677652
+嘴角 7.75007488353
+怀柔水库 13.2075304714
+刘参 13.2075304714
+埃尔斯特 12.5143832909
+苏拉特 11.9547675029
+填写表格 12.8020653633
+任蒂宾 12.8020653633
+碎米 10.9562386728
+浅近 11.1926274509
+烟蒂 10.604840786
+吉县 12.8020653633
+泰然处之 12.1089181827
+土地开垦 12.1089181827
+高步杰 12.1089181827
+课后 12.1089181827
+课吏 13.2075304714
+墙篱 13.900677652
+型号 7.38744754106
+侵掠 10.6818018271
+共同前进 13.2075304714
+四处张望 11.2616203224
+同治帝 11.5027823792
+身体瘦弱 12.1089181827
+浅根性 12.5143832909
+懂行 10.4666904475
+陈永福 8.68574189437
+玉髓 10.8561552143
+香砂 12.8020653633
+绝不允许 10.2630914922
+灭尸 13.2075304714
+便门 12.5143832909
+赵桓依然 13.2075304714
+绝子绝孙 13.900677652
+南征北伐 13.2075304714
+碎粉 12.8020653633
+布列斯特 10.765183436
+泛海 9.08039608637
+特鲁 11.5027823792
+王弼好 13.2075304714
+欠资邮票 13.900677652
+宿命论者 12.2912397395
+澎湖县 11.8212361103
+字母键 13.900677652
+翎子 10.9562386728
+紧巴 12.2912397395
+专集 10.2117981979
+喷火器 11.0674643079
+共语 12.1089181827
+宣誓书 13.900677652
+管籥 13.900677652
+历书 9.94943393339
+战争片 12.2912397395
+收费站 10.1871055853
+美斯蒂索 13.900677652
+真的假 11.4157710022
+机载雷达 10.4349417492
+火青 13.2075304714
+石板桥 12.5143832909
+东征 8.00352378434
+上浆 11.598092559
+上流 9.77354326693
+情人节 10.6818018271
+伊留申 12.2912397395
+回忆起 9.48183704418
+东德 11.2616203224
+燕青领 13.2075304714
+上海 4.58363766134
+天人关系 11.5027823792
+终身 7.73316116109
+上浮 8.84443184663
+一举多得 11.8212361103
+金雁 13.2075304714
+歌舞 8.27666014579
+泛洪 13.900677652
+卖淫嫖娼 11.5027823792
+鹿兆鹏 8.75318317516
+布雷斯特 12.1089181827
+宁远军 12.8020653633
+阴与阳 12.1089181827
+电站设备 11.8212361103
+泛泛 10.3171587135
+咸镜道 12.8020653633
+玉魔 10.5684731418
+延熹 10.8561552143
+金银箔 13.2075304714
+挥毫落纸 13.2075304714
+武经总要 10.5684731418
+皮垫 13.900677652
+东平 9.18217878068
+了然 10.4041700905
+罗瑞卿 11.3357282945
+粗手粗脚 12.8020653633
+卫汝成 13.2075304714
+到达 6.51917575747
+白毛蒙 12.8020653633
+上河 11.9547675029
+张恒 13.900677652
+睡意全消 11.8212361103
+李杨梅 13.2075304714
+额定电流 11.9547675029
+哈尔迪亚 13.2075304714
+银湖 12.2912397395
+库克群岛 11.2616203224
+逮到 10.642581114
+计量单位 10.2117981979
+颍上县 13.2075304714
+胆战心寒 12.1089181827
+弄璋之喜 13.900677652
+第一处 11.8212361103
+鸡汤 9.85762638414
+万树 11.9547675029
+毛手毛脚 11.598092559
+五十分钟 12.8020653633
+东帝 11.598092559
+秘书组 13.2075304714
+兼收并蓄 11.4157710022
+巴伦支海 10.604840786
+设计局 9.63799777493
+东市 11.4157710022
+迁延岁月 13.900677652
+香科 11.1926274509
+张总 13.900677652
+纶巾 11.9547675029
+丁从征 13.2075304714
+鸡汁 13.900677652
+汤敏 11.8212361103
+抗病性 12.5143832909
+小学同学 11.0674643079
+四平调 12.5143832909
+囊蚴 12.2912397395
+赫夫尔 13.2075304714
+帕尔门 12.8020653633
+雌花 9.6811699468
+要角 13.900677652
+魏巍卫 13.2075304714
+地貌过程 12.1089181827
+京山 10.1164880181
+嫩黄色 12.5143832909
+万株 11.5027823792
+旅客机 11.5027823792
+开鲁县 12.8020653633
+六必居 11.9547675029
+热情洋溢 10.4349417492
+张惠 13.900677652
+赶赶 12.8020653633
+银滩 10.4994802703
+详论 12.2912397395
+白沙黎族自治县 13.900677652
+张惶 12.5143832909
+情同骨肉 12.1089181827
+暗喜 9.5186510173
+一栏 9.72629038208
+哈维亚 13.2075304714
+隆福 12.5143832909
+东延 10.2630914922
+汤斌 11.7034530746
+朱尔朱 13.2075304714
+上水 10.765183436
+着急起来 10.642581114
+东建 12.1089181827
+侵扰 8.74162235276
+剩磁 11.2616203224
+那达 13.2075304714
+泛池 13.900677652
+寇并州 13.2075304714
+快言快语 12.5143832909
+汤料 11.9547675029
+事业成功 11.8212361103
+冈仁波齐峰 10.9049453784
+暗喻 11.7034530746
+尹喜 11.9547675029
+饮马河 11.2616203224
+上江 12.8020653633
+张悦 13.900677652
+土鳖虫 13.900677652
+东府 11.1926274509
+数九寒冬 13.900677652
+西洋景 11.8212361103
+缺席者 13.900677652
+中共中央国务院 13.900677652
+咬下 12.1089181827
+特克斯县 13.900677652
+反导 10.1871055853
+白驹过隙 12.8020653633
+农产品 6.80893553688
+鸡泽 12.2912397395
+漫笔 13.900677652
+香祖 13.2075304714
+上汽 7.84155445639
+印巴 9.58318953844
+才艺超 13.900677652
+沃雷金 12.1089181827
+火险 12.8020653633
+边缘海 10.0720362555
+张悌 12.8020653633
+尼克 10.3743171274
+郭汜知 12.8020653633
+赭石 11.4157710022
+窀穸 13.900677652
+解热剂 13.900677652
+空座位 13.2075304714
+迟迟 8.092535162
+蓟州城 12.1089181827
+姜亮夫 13.900677652
+万念俱灰 10.9049453784
+种畜场 12.8020653633
+呼呼 8.76487921493
+拿下马来 13.900677652
+一票制 13.900677652
+古浪河 12.5143832909
+靶位 12.2912397395
+管纱 13.2075304714
+鲁体 12.5143832909
+张捷 12.2912397395
+毫不利己 13.2075304714
+劳斯特 13.900677652
+机能性 12.2912397395
+管线 9.5062284973
+闹架 12.8020653633
+北约 8.19689517732
+一千六百八十五部 13.2075304714
+委托 7.02441304008
+能玉成 13.900677652
+唯生产力论 13.900677652
+北纬 7.35102690974
+万死 10.4666904475
+小恩小惠 11.7034530746
+后手不接 13.900677652
+万步 12.5143832909
+世界各地 7.79143006921
+北线 10.604840786
+能诗会 12.5143832909
+路德宗 10.4994802703
+现代集团 12.8020653633
+森林保护 12.1089181827
+款留 11.598092559
+东崖 11.9547675029
+汽车坐垫 12.8020653633
+逾分 12.8020653633
+吕根岛 13.900677652
+鲁伊 13.2075304714
+巡逻艇 10.1630080337
+张振 10.765183436
+呼吸 6.83335780332
+产销两旺 10.642581114
+左右盘 13.2075304714
+北绕 12.8020653633
+簇拥着 9.08039608637
+甩出去 12.1089181827
+成国渠 11.598092559
+防火设备 13.900677652
+高产稳产 10.5684731418
+小合唱 13.2075304714
+侨报 13.2075304714
+张挂 10.8561552143
+盖德派 12.8020653633
+竹棍 11.9547675029
+核素图 13.900677652
+馆阁 11.5027823792
+银洋 10.7226238216
+短期计划 13.2075304714
+鲁伯 13.2075304714
+拘泥 11.3357282945
+绷住 12.2912397395
+万次 10.604840786
+呼吁 7.54283538547
+竹棒 12.1089181827
+十二天 10.9562386728
+尚方宝剑 10.9562386728
+杰赫勒姆河 12.8020653633
+火锅 9.58318953844
+东州 8.11685246965
+矫正术 12.8020653633
+东川 9.56994431169
+苇丛 11.3357282945
+阙文 13.900677652
+竹根 11.7034530746
+隆突 12.1089181827
+突变型 10.765183436
+孔少府 13.2075304714
+有无必要 13.2075304714
+上漆 12.8020653633
+浪谷 13.2075304714
+选读课 13.900677652
+呼哨 11.2616203224
+东巴 11.0674643079
+边诸郡 11.3357282945
+竹栏 13.900677652
+库尔甘 12.8020653633
+盛孝章 13.2075304714
+威灵 10.9049453784
+课余时间 11.3357282945
+雇船 11.3357282945
+话题一转 11.5027823792
+沩山 12.2912397395
+香稻 11.8212361103
+五代同堂 12.5143832909
+东巡 10.8096351986
+蒙贵 13.2075304714
+概念性 10.604840786
+巨祸 13.2075304714
+可逆性 10.7226238216
+史周忱 13.2075304714
+棕叶 12.5143832909
+千百只 11.9547675029
+火车站 8.230796729
+千百号 13.2075304714
+疣状增生 13.900677652
+卡岩型 13.2075304714
+倍儿 12.1089181827
+伯努利 10.1630080337
+提醒 6.32048823403
+蒙赫 13.2075304714
+歌者 11.5027823792
+中国台湾地区 11.3357282945
+杰文斯 11.7034530746
+安寝 10.8096351986
+共鸣板 13.900677652
+版权局 13.2075304714
+鲁侯 12.2912397395
+南侨 12.2912397395
+小高岭 13.900677652
+水坡集 10.2117981979
+火镰 11.1280889297
+张掖 9.34680076038
+影视娱乐 10.642581114
+胡佛坝 12.2912397395
+京杭大运河 11.1280889297
+面包片 13.900677652
+蒙起 13.2075304714
+心惊肉跳 9.45802639549
+失调电压 13.900677652
+专长 9.84023464143
+北美 7.44233936863
+多点通信 13.2075304714
+薪饷 12.1089181827
+北伸延 12.1089181827
+张扬 8.92394390956
+呼啦 10.3171587135
+白烟 9.94943393339
+竹榻 11.8212361103
+阿拉伯国家首脑会议 13.2075304714
+短缺商品 13.2075304714
+南乐 11.5027823792
+设计师 8.70218062071
+目不旁视 13.2075304714
+人外有人 13.2075304714
+夹具 11.1926274509
+深山区 11.2616203224
+同床共枕 11.4157710022
+割地称臣 13.900677652
+夹克 10.765183436
+切削速度 12.5143832909
+东山 9.01032852375
+反复 6.24860690586
+银汉 11.598092559
+对系统 9.93038573842
+心黑手辣 12.2912397395
+火钳 11.5027823792
+上溯 8.98069672615
+特帕夏 11.9547675029
+暗地 10.1164880181
+拦河闸 11.7034530746
+左营区 12.8020653633
+流浸膏 13.2075304714
+上溢 12.8020653633
+低坝 12.8020653633
+高草草原 13.900677652
+正统主义 12.5143832909
+户口簿 10.4666904475
+保温箱 13.900677652
+急不择路 13.900677652
+南下 7.01824018098
+阮家庄 13.900677652
+耘锄 13.900677652
+黑色星期 10.9049453784
+沙土路 11.9547675029
+呼唤 7.83456956187
+顾鼎臣 13.2075304714
+仓受纳 13.2075304714
+磅湛 12.5143832909
+梁溥 11.598092559
+福鼎茶 13.2075304714
+媒介物 12.1089181827
+毕方济 13.2075304714
+疙瘩汤 12.5143832909
+克分子 12.8020653633
+礁岩 12.1089181827
+南中 10.765183436
+鲁中 10.3743171274
+提速 8.62767809341
+火铳 9.96885201925
+张成 11.4157710022
+铜锅 10.7226238216
+南丰 10.0720362555
+京广 9.19114745066
+魔高一尺 13.900677652
+专销 12.8020653633
+宣恩县 12.5143832909
+卫青征 12.5143832909
+南丹 11.0674643079
+鲁什 12.2912397395
+平屋顶 13.2075304714
+满脑子 10.0940151622
+冉阿让 13.2075304714
+饱暖 12.1089181827
+防微杜渐 11.9547675029
+朱统缬 11.9547675029
+扫荡残敌 12.8020653633
+统揽全局 12.1089181827
+张拳 11.0103058941
+夹击 8.79473217808
+专门 5.91519329524
+南仓 12.1089181827
+历三主 12.5143832909
+同身寸 13.900677652
+金圣宫 11.7034530746
+上清 11.5027823792
+京府 12.1089181827
+北缘 9.00283785202
+谯城区 13.900677652
+脂肪瘤 11.8212361103
+上游 6.48129706906
+商州市 12.1089181827
+东峰 11.1926274509
+筒仓 12.1089181827
+银泉 13.2075304714
+张拉 13.900677652
+竹椅 10.533381822
+东峻 13.900677652
+余小惠 13.2075304714
+登山绳 10.642581114
+边笑 12.5143832909
+猪婆龙 13.900677652
+迪斯考 13.2075304714
+日本社 13.900677652
+到货 9.96885201925
+鱼鳞病 13.900677652
+米纽斯 13.900677652
+上渡 13.900677652
+斯诺达尔 12.8020653633
+扈驾亲 12.5143832909
+营养费 12.1089181827
+四百六十文 13.2075304714
+东岛 11.1926274509
+微恙 13.2075304714
+银河 7.90921310487
+竹楼 10.9562386728
+王用畏 13.2075304714
+大禾 13.900677652
+宝泉局 11.8212361103
+宗文皇帝 13.900677652
+鲁亚 13.900677652
+少林拳 11.3357282945
+小叶杨 12.1089181827
+呛咳 11.2616203224
+筒井 13.900677652
+独山县 11.4157710022
+第四十六回 12.2912397395
+东岳 10.8561552143
+铁子 12.1089181827
+南亭 11.1280889297
+南京 5.87483430782
+东岸 7.86280673205
+艺工队 13.900677652
+管网 9.40086798165
+详见 9.01032852375
+杨六郎 13.2075304714
+修订版 11.1280889297
+宁远卫 12.5143832909
+仙姿 12.8020653633
+银沙 12.8020653633
+东岭 12.2912397395
+呼喊 8.30969067146
+南人 10.1394775363
+安慰剂 12.8020653633
+联合攻关 12.5143832909
+和术赤 12.8020653633
+万余例 11.4157710022
+双溪口 12.5143832909
+张浩 10.9049453784
+小到中雨 11.0103058941
+保温瓶 12.1089181827
+东升 9.53122979951
+便饭 10.765183436
+国际交流 10.0505300503
+微澜 12.8020653633
+张海 10.2371160058
+东华 9.04086524761
+本科班 13.900677652
+音色甜美 13.900677652
+满席 11.9547675029
+恰达耶夫 13.2075304714
+腠理 11.2616203224
+暗堡 13.2075304714
+反对派 9.08039608637
+孔最 13.2075304714
+张济 11.2616203224
+铜锤 11.0103058941
+宰相肚里 12.2912397395
+管炎 13.900677652
+夜幕沉沉 13.900677652
+拘押 10.4041700905
+贺孟斧 13.2075304714
+张浚 10.4041700905
+吴鼎昌 12.5143832909
+孕穗 12.5143832909
+京兆 9.27570483869
+东北 5.78455922037
+主城区 10.7226238216
+张津 13.2075304714
+张洪 9.85762638414
+反噬 12.8020653633
+嫁狗随狗 11.1926274509
+战孙立 13.2075304714
+嫖赌 12.8020653633
+标会 13.900677652
+重新学习 12.5143832909
+兰花花 12.1089181827
+烟袋 9.29550746599
+香瓜 11.1280889297
+华溪渔 13.900677652
+基合金 11.8212361103
+登科 11.2616203224
+张洁 11.8212361103
+黑火药 10.3743171274
+民防建设 13.2075304714
+张洋 12.8020653633
+夹布 12.8020653633
+喜钱 12.5143832909
+东区 9.58318953844
+便餐 12.2912397395
+灯蛾 12.2912397395
+毋昭裔 13.900677652
+天鹰座 11.1280889297
+老妇人 10.3743171274
+巫聪 12.5143832909
+万支 10.0720362555
+课堂 9.01032852375
+耿精忠 11.3357282945
+索亚 12.2912397395
+齐亚尼 13.2075304714
+遍野 10.4349417492
+涞水 11.0674643079
+香球 13.900677652
+抓住机遇 9.98865464655
+玉雕 9.41204128224
+会管 12.1089181827
+汇合处 9.29550746599
+皮娜 13.900677652
+深深地 7.79365476423
+在握 10.1630080337
+阚维雍 12.5143832909
+逮得 13.2075304714
+斤半 13.900677652
+多路复用 11.7034530746
+差异量数 12.2912397395
+特邀 9.87532596124
+出稿 13.900677652
+奥的斯 12.8020653633
+万日 13.900677652
+姿貌 13.900677652
+中华烟 12.2912397395
+自问自答 11.5027823792
+尸衣 13.2075304714
+故垒 13.2075304714
+侨汇 11.0103058941
+继续移动 13.900677652
+汤森 10.1871055853
+灯虎 13.900677652
+斯涅金娜 13.2075304714
+大观园 9.55687223012
+清暑益气汤 12.1089181827
+全国政协文史资料委员会 12.5143832909
+三氯乙烷 12.1089181827
+东厂 8.53938548627
+迟脉 11.9547675029
+张涵 10.3743171274
+杭汉笑笑 13.2075304714
+李德明 10.642581114
+耗热量 13.900677652
+俊逸 11.2616203224
+青春偶像 13.2075304714
+东县 13.900677652
+碎烂 13.2075304714
+侨民 9.56994431169
+东去 10.0088573539
+万方 8.80081122415
+倾诉 9.20932976975
+哥廷根 12.2912397395
+万斤 10.8096351986
+东厢 11.1280889297
+反推力 12.1089181827
+如日东升 13.2075304714
+万斯 12.5143832909
+张涛 11.1280889297
+巨着 13.900677652
+东方公司 12.2912397395
+浙赣铁路 10.4666904475
+云英 12.8020653633
+暗处 9.61021821083
+四五丈 12.5143832909
+丝氨酸 12.2912397395
+艾卜峰 13.2075304714
+四五万 11.0103058941
+温彦博 12.8020653633
+歌迷 10.765183436
+单过 13.2075304714
+积极争取 10.3453295905
+皮实 11.2616203224
+南里奥格兰德 12.2912397395
+几何学家 12.2912397395
+竹架 13.2075304714
+铜镍 11.0103058941
+薛道衡 12.8020653633
+跑马卖解 11.7034530746
+四五个 9.24671730182
+墙皮 11.8212361103
+四五两 13.900677652
+张汉 9.29550746599
+共振频率 12.5143832909
+万变不离其宗 11.9547675029
+玄德兵 12.2912397395
+电子游戏机 11.9547675029
+标书 11.9547675029
+竹枝 10.533381822
+事毕 10.2117981979
+滕胤入 13.2075304714
+玉面 10.9562386728
+张江 9.41204128224
+竹林 8.9308643524
+绕圈 12.1089181827
+激昂 9.37888907493
+发明家 9.7898037878
+苏花公路 12.2912397395
+梁楷 11.598092559
+蒙苏 12.2912397395
+二十倍 11.2616203224
+菊花岛 12.1089181827
+蒲鱼荷 13.2075304714
+互惠条约 13.900677652
+碎煤 13.900677652
+查格雷 13.2075304714
+宣府监 12.5143832909
+北燕 10.2117981979
+劳动权 12.2912397395
+修配厂 11.5027823792
+魔障 10.7226238216
+潘必正 13.900677652
+张永 9.85762638414
+标下 13.900677652
+标上 10.7226238216
+送信人 11.8212361103
+徐盛船 13.2075304714
+东到 9.40086798165
+大六壬 13.900677652
+标举 11.9547675029
+玉露 10.9562386728
+张氏 10.1164880181
+课外 10.9562386728
+视死如归 10.4349417492
+富贾 13.900677652
+张驹贤 13.2075304714
+富贵利达 13.900677652
+反坐 11.8212361103
+常山县 12.8020653633
+时间知觉 12.5143832909
+九百万 12.5143832909
+日立公司 12.2912397395
+军队院校 11.5027823792
+扪心 13.2075304714
+自然资源 7.80485308954
+上思 11.598092559
+取舍之间 13.900677652
+委内瑞拉政府 13.900677652
+追命 13.900677652
+安特卫普 9.98865464655
+布仑斯 12.5143832909
+方向键 12.5143832909
+香甜 9.49395840471
+炸豆腐 13.900677652
+最低音 13.900677652
+张泽 11.5027823792
+标价 9.66657114738
+一个名 12.1089181827
+蕃衍 12.2912397395
+王白山 13.2075304714
+可卡因 11.4157710022
+玉音 8.33233314821
+打麦 12.1089181827
+视若无睹 12.2912397395
+捉拿归案 11.0674643079
+沉不住气 9.71102290995
+制表机 13.2075304714
+纸砚 13.2075304714
+石磷磷 12.2912397395
+中国建筑学会 12.1089181827
+任魏尹 13.2075304714
+齐云 13.900677652
+索伦 11.2616203224
+在押 10.9562386728
+竹条 11.5027823792
+门叶 13.900677652
+颤颤悠悠 11.7034530746
+东力 11.1280889297
+王渊 10.0940151622
+褂子 9.35738286971
+皮子 9.94943393339
+碎布条 13.2075304714
+皮孔 11.598092559
+瑜珈 12.5143832909
+拘捕 9.80633308975
+租房 9.30555780184
+朱光亚 12.1089181827
+紫石英 12.8020653633
+特里 9.61021821083
+叛乱者 11.9547675029
+合每股 10.642581114
+经营效果 13.900677652
+东势 12.5143832909
+闪电式 11.5027823792
+竹杆 12.2912397395
+东加 13.900677652
+多向性 13.900677652
+一般方程 13.900677652
+竹材 11.1280889297
+拌蒜 13.900677652
+操舵手 13.900677652
+浅色 9.74179456862
+乌姆鲁勒 13.2075304714
+专项 7.64301006409
+能克己 13.2075304714
+元顺帝 9.75754292558
+姚安县 13.2075304714
+上排 11.5027823792
+绳锯木断 13.900677652
+公民投票 9.48183704418
+吉卜赛人 12.8020653633
+东元 13.900677652
+卡米 13.2075304714
+管状 9.15574552361
+段家生 11.0103058941
+老脸皮 13.900677652
+面如傅粉 12.5143832909
+仆从 9.85762638414
+东光 11.1926274509
+微涨 9.20932976975
+数十万美元 12.5143832909
+东兴 9.7898037878
+东关 9.16447920358
+东兰 12.1089181827
+万松 13.2075304714
+逢迎 10.4349417492
+夹层 9.49395840471
+柔道 11.3357282945
+卫东区 13.2075304714
+五六万户 13.2075304714
+蓟州寻 13.900677652
+于拥帝 13.2075304714
+反向 8.60737282725
+万条 10.0088573539
+上接 10.4666904475
+暗娼 11.9547675029
+系统活动 11.7034530746
+分馏法 12.5143832909
+专业科目 12.5143832909
+北狄 11.9547675029
+匡算 11.7034530746
+空口无凭 11.7034530746
+京华 9.43476953332
+饰词 13.2075304714
+万望 9.44633035572
+平平展展 13.2075304714
+京南 10.8561552143
+戴方巾 11.8212361103
+肉芝 10.765183436
+终老 10.4994802703
+弘光帝 11.7034530746
+万有 10.4349417492
+修饰符 13.2075304714
+大喊大叫 9.5062284973
+万朵 11.8212361103
+界内球 13.900677652
+蔺草 11.7034530746
+承付 11.9547675029
+仆人 7.46773755924
+私车 11.0103058941
+来去匆匆 11.0674643079
+万机 11.5027823792
+防震 10.9562386728
+在意 8.14493543839
+五里镇 13.2075304714
+万本 12.2912397395
+万木 11.0103058941
+广西 6.8858633007
+末流 10.8096351986
+轻裘 11.598092559
+二十出 13.900677652
+呼声 8.3555002075
+栩栩如生 9.29550746599
+母忧 12.8020653633
+中音部 13.900677652
+流行时装 13.900677652
+焦文 13.900677652
+交叉科学 13.2075304714
+新元素 10.2630914922
+戊戌变法 9.40086798165
+商州区 13.900677652
+登第 11.9547675029
+死战到底 12.8020653633
+柯贝林 12.8020653633
+汲汲 13.2075304714
+屡禁不止 10.642581114
+一生 6.3664493257
+党员大会 10.4041700905
+并购额 13.900677652
+取证难 13.900677652
+李硕勋 13.900677652
+北爱 12.8020653633
+男子单打 10.765183436
+蝉鸣 11.4157710022
+斑嘴鸭 13.2075304714
+格列朗 13.2075304714
+倾覆 9.96885201925
+腺体 8.96620371885
+埃希氏 13.2075304714
+歌谣 8.9519177616
+孔子像 12.5143832909
+万枝 13.2075304714
+隆盛 11.4157710022
+浙贝母 11.9547675029
+万枚 10.9562386728
+玉钗 12.5143832909
+两三股 13.2075304714
+大呼小喝 13.900677652
+艺委会 13.2075304714
+监测点 13.900677652
+泛指 8.73589167805
+绍述 11.2616203224
+融会贯通 10.9049453784
+副镇长 12.1089181827
+三十二名 13.2075304714
+西洋楼 11.8212361103
+到职 10.9562386728
+怪现状 12.1089181827
+东冶 12.1089181827
+万架 11.9547675029
+寻新欢 13.900677652
+玉钺 12.2912397395
+东冲 12.1089181827
+歌调 12.8020653633
+管片 10.3453295905
+反响 8.9519177616
+倾角 9.33632946051
+京叭 12.5143832909
+署理 10.2630914922
+帕尔马 10.6818018271
+普利茅斯 11.2616203224
+承乏 12.5143832909
+肿块 9.5062284973
+螺旋线 11.5027823792
+平衡理论 11.598092559
+地覆天翻 13.900677652
+练塘镇 13.2075304714
+金銮 12.5143832909
+塞佛特 11.4157710022
+证明题 13.2075304714
+万枪 13.900677652
+张澜 10.2897597393
+刘二虎 10.765183436
+詹来延 13.2075304714
+七八公里 12.8020653633
+百忙中 10.8561552143
+伯木古 12.5143832909
+西洋梨 13.900677652
+古玩商 11.4157710022
+北王 11.3357282945
+莨菪 11.1280889297
+碧落 12.1089181827
+孟庭苇 13.2075304714
+活饵料 13.900677652
+陆兼运 13.2075304714
+漫天要价 11.3357282945
+非法拘禁 10.9562386728
+税率 8.49350588052
+抗干扰性 11.7034530746
+李克智 9.87532596124
+耶律休哥 11.0674643079
+胡母氏 13.900677652
+徐鸿宝 13.2075304714
+巧事 12.1089181827
+肯来 10.642581114
+李德旺 12.8020653633
+辐合思维 12.5143832909
+负干涉 13.900677652
+列祖 11.8212361103
+垂直距离 11.4157710022
+意志力 11.598092559
+张湛 11.8212361103
+西伯 11.0103058941
+茹科夫斯基 11.5027823792
+浊物 11.4157710022
+不断涌现 9.75754292558
+摆擂台 13.900677652
+担负起 9.69598503258
+幸勿见 12.1089181827
+汤武 11.1280889297
+张温 11.5027823792
+乞骸骨 12.5143832909
+承修 12.2912397395
+千百年 10.0294766411
+生杀予夺 11.3357282945
+着慌 11.1280889297
+常回去 13.900677652
+万昌 12.5143832909
+神降仙 13.2075304714
+微法 13.2075304714
+京剧 8.62767809341
+承保 9.94943393339
+细胞层 12.5143832909
+虚飘飘 12.5143832909
+张清 9.01032852375
+城管办 13.900677652
+微波 8.28754954559
+亚音速 10.5684731418
+巡逻车 11.2616203224
+蒙胧 12.8020653633
+万春 11.4157710022
+瓦文萨 11.8212361103
+姨母 11.1926274509
+别有洞天 11.3357282945
+千百度 12.2912397395
+远涉重洋 11.5027823792
+张满 12.5143832909
+切磋琢磨 13.900677652
+讳莫如深 10.4666904475
+链路 11.598092559
+上成 10.9049453784
+张伯义 13.2075304714
+异物感 11.0674643079
+田笑道 12.8020653633
+西特林 13.900677652
+菩萨保佑 11.1280889297
+浅耕 12.2912397395
+着陆 8.69119149913
+齐思 12.1089181827
+夹巷 12.1089181827
+陆和领 12.8020653633
+碎玉 11.5027823792
+发明奖 11.3357282945
+暗室 10.533381822
+黄莺 11.1280889297
+王暗摇 13.2075304714
+专名号 13.2075304714
+终至 10.4041700905
+上户 10.3171587135
+隰县 11.7034530746
+情报部门 11.8212361103
+剑舞 11.5027823792
+吉林长春 11.5027823792
+玉门 9.77354326693
+宋绍兴 11.598092559
+暗害 10.9562386728
+登程 10.3171587135
+慎思笃行 13.2075304714
+徐渭 10.4994802703
+解手 10.604840786
+入梦 11.3357282945
+上托 11.4157710022
+经永定 12.5143832909
+张溥 10.604840786
+登空 13.2075304714
+如数归还 13.900677652
+商曲 13.2075304714
+自叹不如 12.8020653633
+一脉相承 10.1871055853
+野猪林 11.7034530746
+三亚机场 13.2075304714
+上手 9.75754292558
+开发票 11.8212361103
+小节目 13.2075304714
+课室 12.8020653633
+皮套 12.8020653633
+尼科美 12.8020653633
+三万余所 12.8020653633
+夭亡 11.5027823792
+上批 11.8212361103
+马挺戟 12.8020653633
+老陈醋 11.4157710022
+艾窝窝 12.5143832909
+皮奥 12.1089181827
+这么样 10.6818018271
+雇车 11.598092559
+张源 13.2075304714
+国家档案馆 11.0674643079
+承佃 12.1089181827
+专馆 13.2075304714
+黄莹 13.900677652
+香炉 8.71329184614
+阿苏尔 11.8212361103
+张楠 12.2912397395
+上料 12.8020653633
+惹不起 10.9049453784
+连络运 13.2075304714
+删剪 13.2075304714
+东坝 13.2075304714
+灯节 10.1871055853
+自然而然 9.00283785202
+银杯 11.9547675029
+迈克 11.2616203224
+反制 10.1394775363
+反到 11.598092559
+泰雅 12.8020653633
+叶黄杨 13.2075304714
+火龙 8.98802276624
+上文 10.3453295905
+拒腐防变 12.2912397395
+避难者 12.8020653633
+灯芯 10.6818018271
+汤氏 12.8020653633
+反切 10.533381822
+检错 12.8020653633
+上方 6.808103936
+肯恩 13.900677652
+面晤 13.900677652
+反刍 10.7226238216
+银杉 9.96885201925
+真武庙 11.598092559
+玉鉴 12.1089181827
+银杏 8.85725253506
+各口岸 11.1926274509
+东坡 8.94485059437
+张楚 11.8212361103
+吴为才 11.8212361103
+罗马涅 13.900677652
+灯花 11.2616203224
+迈入 9.75754292558
+粗茶淡饭 11.2616203224
+奥伯丁 13.900677652
+比斯特 13.2075304714
+西门豹 11.1280889297
+肥皂厂 13.2075304714
+拦截机 13.900677652
+心理专家 11.8212361103
+东土 9.10488710638
+汤汤 13.900677652
+汤池 11.5027823792
+劳动所 9.89334446674
+向南疾 13.2075304714
+香烛 10.1871055853
+香烟 8.15447446144
+美国哈佛大学医学院 12.8020653633
+浅浅的 10.0720362555
+北瓜 12.2912397395
+张椿 12.5143832909
+拉丝 11.3357282945
+倾轧 9.6811699468
+阿苏山 12.1089181827
+银月 13.900677652
+汤汁 10.9049453784
+上旬 8.18364995057
+一番 6.53107693145
+希腊人 8.40761620864
+呼市 12.5143832909
+必须 4.75508915723
+瓯海 12.8020653633
+上日 10.4041700905
+元廷调 13.2075304714
+呼延 9.37888907493
+责任感 8.88339781516
+巨猿 11.598092559
+欢迎会 13.2075304714
+班超复 13.2075304714
+东域 13.900677652
+凭借着 9.84023464143
+反动 7.92432674268
+抬首 13.900677652
+放在心上 9.25628675283
+寸金难买 13.900677652
+全球华人 11.9547675029
+吴为拥 13.2075304714
+意象派 11.5027823792
+东城 9.11318590919
+李德才 12.8020653633
+拷贝到 11.9547675029
+汤河 11.5027823792
+迈出 8.37921673411
+明火执杖 12.2912397395
+味儿 8.59240995457
+精品店 12.5143832909
+嘴脸 9.18217878068
+绝口不提 11.3357282945
+甘肃省甘南藏族自治州 12.5143832909
+悄语 11.9547675029
+皮带 9.05649056552
+战斗指挥 11.598092559
+埃利奥特 13.2075304714
+皮帽 11.4157710022
+天津经济技术开发区 12.5143832909
+违理 13.900677652
+银柜 13.900677652
+颈子 10.642581114
+反力 11.1280889297
+租期 11.1926274509
+呛得 9.59661255877
+暖气片 10.1630080337
+倾述 13.900677652
+谋私利 11.8212361103
+特需 12.5143832909
+先洗 12.2912397395
+久炼成钢 13.900677652
+哝哝 10.2630914922
+派遣军 11.1926274509
+军法官 12.8020653633
+全军覆灭 10.765183436
+十一万零六百余两 13.2075304714
+科技兴农 13.900677652
+联系实际 10.3171587135
+泰阳 13.2075304714
+呼应 8.69119149913
+车用汽油 11.7034530746
+明信片 10.9562386728
+汤泉 11.3357282945
+谢利姆 12.5143832909
+药效学 13.900677652
+上数 13.2075304714
+泰阿 12.5143832909
+驯象 12.5143832909
+韩儒林 11.1926274509
+亲耳所闻 12.8020653633
+味全 13.2075304714
+生离死别 10.0088573539
+东垣 11.7034530746
+床上用品 12.2912397395
+张榜 11.8212361103
+北疆 9.89334446674
+街路 12.2912397395
+中环线 13.900677652
+有征无战 12.8020653633
+香熏 10.9562386728
+张桥 12.1089181827
+工字钢 13.2075304714
+天星桥 12.5143832909
+陈逢衡 12.8020653633
+以正视听 12.1089181827
+躺直 13.900677652
+弦外有音 13.2075304714
+鸲鹆 13.900677652
+脂肪粒 13.2075304714
+有分有合 13.900677652
+朱可夫 10.6818018271
+皮得 12.8020653633
+万恶 10.8096351986
+东厂侦 12.2912397395
+广土众民 13.900677652
+歌诀 11.1280889297
+模塑 11.4157710022
+歌词 9.13850371718
+纠纠 13.900677652
+激扬 11.0674643079
+古北界 10.4041700905
+流域性 12.1089181827
+二十多丈 13.900677652
+攀到 11.0674643079
+朱拉湾 13.2075304714
+镜花缘 12.1089181827
+升旗台 13.900677652
+夹子 10.0720362555
+巨犀 13.900677652
+大圆满 13.900677652
+视察员 9.13850371718
+水上漂 11.3357282945
+八里乡 13.900677652
+巨狼 11.2616203224
+杀菌灯 13.900677652
+没过几天 10.8561552143
+设计员 13.2075304714
+黄河壶口瀑布 12.1089181827
+军用机场 11.1926274509
+热带作物 9.55687223012
+杜牧之 12.8020653633
+特长 9.0884932966
+党票 13.2075304714
+激战 8.22392384971
+曲线拟合 12.5143832909
+朱国祯 13.2075304714
+继武 13.900677652
+李奇微 12.2912397395
+罗马法 9.7898037878
+胡景义 12.8020653633
+退稿 13.900677652
+徐建中 13.900677652
+惊为天人 12.8020653633
+骠骑 9.66657114738
+京味 13.2075304714
+熟悉路途 13.2075304714
+归案 10.5684731418
+莱芜县 12.2912397395
+银星 10.3171587135
+陈白沙 12.8020653633
+前后相随 13.900677652
+刀枪入库 12.5143832909
+抓人 9.4233408375
+管用 9.33632946051
+东四 10.4666904475
+二甲基亚砜 12.5143832909
+民俗文化 11.5027823792
+八进制 13.2075304714
+南朝鲜 9.7898037878
+柔韧 10.1164880181
+火鸟 11.4157710022
+经营者 8.80081122415
+附庸国 12.2912397395
+肥皂剧 11.7034530746
+通汛员 12.5143832909
+偶遇 10.9562386728
+皮张 10.6818018271
+张棋 12.8020653633
+提高 4.73418467978
+东固 13.2075304714
+遣词用句 13.2075304714
+放牛郎 13.900677652
+平面交叉 12.2912397395
+湘东王 13.2075304714
+邸醒 12.5143832909
+张韶涵 13.2075304714
+东园 11.1926274509
+闹气 12.5143832909
+拉迪斯 13.900677652
+百年大计 11.8212361103
+黄鸣俊 13.2075304714
+反口 12.2912397395
+神气活现 10.9049453784
+北界 9.28555713513
+京哈 10.642581114
+巨物 11.5027823792
+拘束 9.33632946051
+上摊 12.8020653633
+昌邑王 13.2075304714
+大杀风景 12.8020653633
+棕壤 9.26594866375
+低胸 12.2912397395
+游上 12.1089181827
+阋墙 13.2075304714
+南澳县 13.2075304714
+呼天抢地 10.642581114
+张梁 11.3357282945
+回光返照 11.0674643079
+王室贵族 11.1280889297
+放过来 12.5143832909
+二手车 8.87679713113
+大公鸡 10.4041700905
+点火台 12.8020653633
+天台乌药 13.2075304714
+置身于 9.41204128224
+斯人 11.1926274509
+烟贩 11.1926274509
+皮影 11.1280889297
+指导组 12.8020653633
+巨片 12.5143832909
+反叛 8.96620371885
+走私案件 12.5143832909
+考古所 12.5143832909
+掩卷 11.7034530746
+多玲 10.0720362555
+浅薄 9.31571017331
+慕容绍宗 13.2075304714
+塔吉克 9.6811699468
+角质化 11.0103058941
+银数 11.3357282945
+负于 10.7226238216
+皮岛 12.2912397395
+泰晤士报 9.87532596124
+十分必要 10.1394775363
+卡贝略 12.8020653633
+印字 11.7034530746
+皮岩 12.1089181827
+相配合 9.6811699468
+国际金融组织 10.9049453784
+环卫局 11.5027823792
+脉管 11.1926274509
+涂上一层 11.1926274509
+兰州市 10.1630080337
+赛后 10.4666904475
+泰铢 11.7034530746
+多伊奇 12.8020653633
+硬化剂 12.2912397395
+安姆 13.900677652
+半山腰 9.80633308975
+上柜 11.3357282945
+张欣 11.9547675029
+甚于 9.69598503258
+合得来 11.4157710022
+阳络脉 13.2075304714
+蒙藏 11.2616203224
+共享性 13.2075304714
+米涅 11.8212361103
+节目主持 13.900677652
+全智全 13.900677652
+黑白分明 10.4041700905
+幼儿园 8.60236028543
+肤浅认识 13.900677652
+马挺枪 10.4994802703
+四十余万斤 13.2075304714
+科西嘉人 12.2912397395
+数黄道黑 13.900677652
+帕尔默 12.1089181827
+彼特 11.8212361103
+前负荷 12.8020653633
+别具一格 9.77354326693
+银政 12.8020653633
+剩料 13.900677652
+鸡杂 13.2075304714
+麦积山 10.5684731418
+激愤 9.63799777493
+精品展 12.1089181827
+上柴 10.9562386728
+夹菜 10.604840786
+张红苗 13.2075304714
+违约责任 10.8096351986
+丁宽授 13.2075304714
+不辞辛苦 10.9562386728
+禄劝 12.2912397395
+花灯 9.87532596124
+乙丙橡胶 11.598092559
+哇哇声 13.2075304714
+精品屋 13.900677652
+羞耻之心 12.5143832909
+成细丝 11.8212361103
+清忠谱 11.9547675029
+上朝 8.98069672615
+落实工作 11.1926274509
+上期 8.94485059437
+甚么 7.34389929582
+管瘤 13.900677652
+碎皮 13.900677652
+米利都 10.9562386728
+椭圆型 11.5027823792
+巨然 10.765183436
+七八厘米 12.8020653633
+一介书生 11.9547675029
+千百家 13.2075304714
+抗病毒 9.12155415886
+上有 9.63799777493
+颠覆性 10.9562386728
+宣威县 12.2912397395
+示现 12.5143832909
+一九四一年 11.7034530746
+皮尖 13.900677652
+负一 13.2075304714
+奏琴 13.2075304714
+上机 10.4994802703
+张毅 12.2912397395
+歌行 10.7226238216
+黄粉 12.2912397395
+巴伐利亚州 11.5027823792
+后勤组 13.900677652
+扎下去 11.8212361103
+普世性 12.8020653633
+议会上院 13.900677652
+皮尺 12.1089181827
+血花 11.5027823792
+蒙蔽 9.6811699468
+浏河镇 11.8212361103
+混合双打 11.7034530746
+美钞 11.9547675029
+低能儿 12.1089181827
+掩口失声 13.900677652
+郑大人 13.900677652
+皂丝麻线 13.900677652
+电话铃 10.0088573539
+京城 7.01006853183
+入校 11.7034530746
+皮层 9.27570483869
+上村 11.9547675029
+香片 11.9547675029
+撰序 13.2075304714
+单足跳 13.900677652
+上杉 13.900677652
+负义 11.598092559
+插齿刀 13.900677652
+皮屑 10.9049453784
+西驰 13.2075304714
+繁荣富强 10.9562386728
+千百对 13.900677652
+毫无诚意 12.5143832909
+小事一桩 11.1926274509
+向南看 13.2075304714
+提香 10.9562386728
+第十四代 13.2075304714
+航机 13.900677652
+特集 13.900677652
+电极化 11.2616203224
+上杭 10.642581114
+坐火车 9.84023464143
+社运 13.900677652
+甚为 8.53003962385
+上来 6.33799640525
+上条 11.9547675029
+何志毅 11.598092559
+香玉 13.2075304714
+细密画 10.3743171274
+朱载 11.1280889297
+蒙蒂 12.8020653633
+独山子 10.4666904475
+蒙蒙 9.98865464655
+桓仁 12.2912397395
+若干列 12.8020653633
+巨炮 11.9547675029
+宁远守 13.900677652
+万所 11.0103058941
+布良斯克 12.5143832909
+逃下来 12.8020653633
+万手 8.55357012126
+传播效应 13.900677652
+孽子孤臣 13.900677652
+兵工署 12.2912397395
+吹鼓手 10.1871055853
+东哥特 10.6818018271
+过金波 12.8020653633
+殷宏章 13.2075304714
+惶恐 8.80692745117
+离经叛道 11.0674643079
+暗弱 10.8561552143
+兄终弟及 11.1280889297
+纤维板 10.2897597393
+东周 9.41204128224
+轩里 12.2912397395
+六百一十五万户 13.2075304714
+超导金属 13.900677652
+东吕 13.900677652
+惶急 10.9562386728
+东向 10.1164880181
+张横 9.66657114738
+母岩 11.8212361103
+史大司马 12.5143832909
+东君 12.5143832909
+独家报道 11.7034530746
+浅蓝 10.7226238216
+反共 8.69119149913
+马克西莫夫 12.2912397395
+东吁 11.2616203224
+张首辅 11.8212361103
+誉满天下 13.900677652
+留学生 8.86372504956
+夹头 12.1089181827
+雇请 11.5027823792
+末梢 9.71102290995
+东吴 8.0229418702
+素负盛名 10.9562386728
+言听计从 9.93038573842
+刘义符 13.2075304714
+桂珍姐 12.5143832909
+勤劳勇敢 12.2912397395
+保守党人 11.7034530746
+反光 9.77354326693
+暗影 9.94943393339
+锌片 13.2075304714
+倍增 9.28555713513
+插进去 10.9562386728
+阿玛尼 11.5027823792
+叫苦不迭 10.765183436
+一亿三千余万两 13.2075304714
+老槐树 10.7226238216
+修订稿 11.3357282945
+惶惧 12.1089181827
+迈勒 12.8020653633
+敬亭山 11.9547675029
+轻世肆志 13.900677652
+安其敏 13.900677652
+万招 13.900677652
+屐齿 13.900677652
+暗得 12.5143832909
+上明 13.2075304714
+哭喊声 10.8561552143
+失效率 12.8020653633
+惶惶 10.2117981979
+反冲 10.8561552143
+常进节 11.1280889297
+霍梅尼 11.5027823792
+禄勋 11.5027823792
+菜包子 12.8020653633
+利己主义 11.3357282945
+巴音郭 12.8020653633
+贝克莱 11.1926274509
+二手货 12.1089181827
+片言只字 13.900677652
+薪金 9.74179456862
+惶惑 9.25628675283
+独生子女证 13.900677652
+影视文化 11.3357282945
+激惹 11.1280889297
+反写 12.5143832909
+肩宽 10.5684731418
+王皇后 10.7226238216
+挖潜力 13.900677652
+路易丝 13.2075304714
+瓦维洛 12.1089181827
+马岱 9.66657114738
+巨灵 11.0674643079
+新论断 13.900677652
+向官仓 13.2075304714
+花蔡庆 12.5143832909
+预防接种 10.1630080337
+跑冒滴漏 12.8020653633
+碎石 9.00283785202
+龟山岛 13.2075304714
+抬高 8.25877058104
+抽出去 13.900677652
+管着 9.7898037878
+细胞壁 9.25628675283
+离索 13.900677652
+课徒 11.7034530746
+蒙默思 13.2075304714
+忧心忡忡 8.91707103027
+并存着 13.2075304714
+火苗儿 11.9547675029
+饱满 8.69119149913
+电话间 12.1089181827
+迈动 11.7034530746
+提领 11.7034530746
+不及格 10.765183436
+课征 11.1280889297
+囊谦 13.2075304714
+黄粱 11.9547675029
+英语教材 13.900677652
+著名人士 11.9547675029
+坎纳拉 12.1089181827
+李天和 13.2075304714
+穿越时空 11.598092559
+何况 6.86189411059
+邦特 13.2075304714
+严肃处理 9.87532596124
+九招 13.900677652
+光谱色 12.5143832909
+鸣放鞭炮 13.900677652
+寡女 12.2912397395
+利胆素 13.900677652
+蛮荒 11.7034530746
+技术标准 9.32596667347
+心理学系 11.8212361103
+于世宗 13.2075304714
+桓王 12.1089181827
+卡尔梅 12.8020653633
+调息 11.4157710022
+准考证号 10.765183436
+陆大人 13.900677652
+笔尖 10.4349417492
+癫疯 13.2075304714
+公开信 10.9562386728
+玛丽莲 12.1089181827
+半球形 10.2117981979
+鲁瓦尔 13.2075304714
+加蒂诺 13.900677652
+萨查利 13.900677652
+复兴区 13.900677652
+符兹堡 12.5143832909
+人机工程 12.2912397395
+任克溥 11.4157710022
+由素体 12.5143832909
+案源 13.900677652
+沤肥 11.8212361103
+示踪剂 12.8020653633
+更美 11.2616203224
+分散剂 11.8212361103
+走失 10.4349417492
+寡头 8.76487921493
+餐风宿露 13.2075304714
+托利诺 13.900677652
+重山复水 13.2075304714
+透不过气 10.0505300503
+卡莱尔 11.7034530746
+领军人 13.900677652
+癫痫 9.6811699468
+拿单 13.2075304714
+调性 10.3453295905
+潮阳区 13.900677652
+和平利用 10.2630914922
+戈尔孔 13.2075304714
+边界对应 13.2075304714
+风花雪夜 13.2075304714
+廉神兵 13.900677652
+松德赞 12.1089181827
+决策矩阵 11.3357282945
+棚车 13.900677652
+金属漆 13.900677652
+工作站 10.0720362555
+下班时间 11.0103058941
+观点相同 13.2075304714
+张思礼 13.2075304714
+敌火 13.2075304714
+氏杆菌 10.9562386728
+正确区分 11.9547675029
+夏都 11.1280889297
+入情入理 12.1089181827
+袁大人 10.2630914922
+迁葬 11.7034530746
+没脸 9.75754292558
+宗海山 12.8020653633
+通齐 12.8020653633
+抓举 12.5143832909
+三八妇女节 13.2075304714
+大罢工 9.6811699468
+十五万两 11.8212361103
+封奉诚 13.2075304714
+困顿 10.2117981979
+子麻 13.900677652
+苏文忠 13.2075304714
+玩具狗 12.5143832909
+丘陵地形 12.5143832909
+花俏 12.8020653633
+见猎心喜 12.8020653633
+贬值 7.05692770297
+鳞爪 13.2075304714
+已触犯 11.8212361103
+休戚相关 11.3357282945
+可兑换性 13.2075304714
+身分不明 13.2075304714
+淄博市 10.4041700905
+九成 8.95903522937
+吴征镒 11.9547675029
+头胸部 10.4041700905
+何兵 12.8020653633
+音乐盒 12.2912397395
+何其 10.0088573539
+盛期 10.0088573539
+落叶归根 11.9547675029
+馄饨面 13.900677652
+个别指导 13.900677652
+尊位 11.8212361103
+货赂公行 13.900677652
+四好连队 13.2075304714
+孙氏厚 13.2075304714
+佐夫 11.1926274509
+国吴析 12.8020653633
+须菩提 13.2075304714
+板正 12.2912397395
+第二条 9.30555780184
+飞虎队 12.2912397395
+建炎 9.84023464143
+商末 10.7226238216
+寡妇 8.62256299275
+拿取 11.9547675029
+拉合尔 10.3743171274
+霍城南 12.8020653633
+学习者 11.7034530746
+体囊 13.900677652
+楚河汉界 12.8020653633
+入役 11.9547675029
+薄祚 13.900677652
+陪笑 8.83177344976
+彗核 11.9547675029
+惜玉怜香 13.900677652
+办报 10.9562386728
+快速性 11.8212361103
+隋代内 13.2075304714
+分散化 11.8212361103
+第二枚 12.1089181827
+善气迎人 12.8020653633
+忧国 10.9049453784
+渐现 10.9562386728
+乱真 11.7034530746
+拿到 7.16252515738
+和嘉乔 11.7034530746
+竖向 11.9547675029
+八十六 11.7034530746
+君王 8.85725253506
+一扫而空 10.9049453784
+斯皮克 12.8020653633
+女方 9.07236391467
+苦活儿 13.2075304714
+李显甫 13.2075304714
+杨念如 12.8020653633
+橡皮布 13.900677652
+王旭明 12.8020653633
+睦邻关系 11.0674643079
+尊亲 11.8212361103
+信息时报 10.0720362555
+老闺女 13.900677652
+伦琴射线 11.5027823792
+陈方策 11.4157710022
+佩切湾 12.8020653633
+竖吹 12.1089181827
+白登之围 12.5143832909
+拿刀 10.4994802703
+原属 8.9308643524
+旷日持久 10.0294766411
+打嘴仗 13.900677652
+麻札刀 13.900677652
+环保型 10.8096351986
+第三十三条 12.5143832909
+身价倍增 11.8212361103
+押回来 12.5143832909
+关税壁垒 11.0103058941
+没能 7.65263477747
+牛邦喜 12.1089181827
+一百五十万镑 13.2075304714
+体坛 10.9049453784
+陆光 13.900677652
+通麦 12.5143832909
+堆积体 12.2912397395
+龙象 13.2075304714
+招回 11.1280889297
+尊令 13.900677652
+和嘉丽 13.900677652
+玄色布 13.900677652
+肌细胞 11.1926274509
+沃德 10.642581114
+富山 12.8020653633
+感生 10.9562386728
+孙乾回 12.5143832909
+回跳 12.2912397395
+原岗 13.900677652
+没销 13.900677652
+汉乃封 13.2075304714
+智慧 7.391908515
+瘪着嘴 12.1089181827
+斯古德 12.5143832909
+结怨 10.8561552143
+铺上去 13.900677652
+丑星 13.900677652
+愣神儿 13.2075304714
+壁龛 10.8561552143
+氧化铁红 13.900677652
+兽医院 13.900677652
+传中 10.642581114
+拿办 11.8212361103
+揶揄 9.98865464655
+尊为 8.9102450652
+粒病 13.900677652
+献计 10.1871055853
+永丰乡 13.2075304714
+老麻雀 13.900677652
+文教类 13.900677652
+体型 8.13548654919
+原岩 10.8561552143
+尊严 8.27666014579
+元曲选 11.7034530746
+盛景 10.8096351986
+豆腐脑儿 12.5143832909
+海青圆 13.2075304714
+献词 12.5143832909
+不关我事 13.2075304714
+繁重 8.85725253506
+医科大学 10.604840786
+团中央 11.7034530746
+嵌入式 11.1926274509
+忽来 12.2912397395
+描字 13.900677652
+结息 12.8020653633
+敌焰 13.900677652
+言未 9.7898037878
+北王兴 13.2075304714
+献诗 12.1089181827
+虚转 13.900677652
+盛昱 13.2075304714
+地文星 13.2075304714
+昆都士 12.5143832909
+电视大学 12.5143832909
+蒋智由 11.9547675029
+没聊 13.2075304714
+零排放 10.604840786
+毫无二致 11.8212361103
+戴文郡 12.8020653633
+晨风 10.3743171274
+完戏 12.5143832909
+虚轴 12.8020653633
+罚金 9.48183704418
+袒胸露乳 13.900677652
+笔帽 11.3357282945
+神经核 11.2616203224
+建物 13.900677652
+强加在 11.598092559
+火焰刀 13.900677652
+搔头 12.5143832909
+举进士 10.9562386728
+原式 13.2075304714
+萨波特 13.2075304714
+戴胜科 13.2075304714
+男厕所 12.2912397395
+禅杖 9.35738286971
+出言吐气 12.2912397395
+急症室 13.900677652
+复兴党 11.2616203224
+双曲面 11.9547675029
+盛时 9.44633035572
+第二枪 12.5143832909
+结构主义 10.5684731418
+坟园 11.3357282945
+要好看 12.2912397395
+层层剥削 13.2075304714
+檄文 9.31571017331
+胡利奥 13.900677652
+肠管 10.604840786
+调戏 10.0088573539
+张宏昌 11.5027823792
+燕菜席 13.2075304714
+体味 9.85762638414
+人迎 11.3357282945
+钼酸 12.8020653633
+吴伟业 10.4349417492
+何可 11.8212361103
+缀网 13.2075304714
+五峰县 12.8020653633
+调成 10.4994802703
+里耶夫 12.8020653633
+菜价 10.4666904475
+保存率 13.2075304714
+爱丽斯 13.2075304714
+拆毁 9.14708746087
+十二辆 13.900677652
+揽胜 11.3357282945
+决定书 10.0088573539
+玉楼春 12.8020653633
+助词 12.1089181827
+银行费用 13.2075304714
+拿光 13.900677652
+禅机 11.1280889297
+斯德特 13.900677652
+诺福克郡 12.8020653633
+原形 10.0940151622
+灌婴 11.5027823792
+十二辑 13.2075304714
+鲁夸湖 13.900677652
+梅尔策 11.9547675029
+奉调 10.4349417492
+调拌 13.2075304714
+磁粉 11.7034530746
+简单扼要 12.5143832909
+戈迪默 12.2912397395
+十二载 12.1089181827
+半盆 11.7034530746
+黄宗羲 6.82317959841
+环比 6.33281504651
+隋代则 12.8020653633
+敌特 11.5027823792
+受骗者 12.8020653633
+调拨 9.19114745066
+电磁能 11.9547675029
+老爷们儿 12.5143832909
+蕊柱 12.8020653633
+何基沣 13.2075304714
+二羧酸 12.8020653633
+刑讯室 12.1089181827
+王花园 13.900677652
+内乡县 12.1089181827
+敲响丧钟 13.900677652
+杰森 13.900677652
+高野山 12.8020653633
+荆榛 12.2912397395
+拿出 6.70099930628
+那逊 13.900677652
+瑞典语 11.5027823792
+山楂片 12.8020653633
+没药 11.1280889297
+刮走 11.7034530746
+太尉杨 11.9547675029
+何卫 12.2912397395
+赢利点 12.5143832909
+禅林 11.4157710022
+全面战争 11.0674643079
+二分音符 13.900677652
+宝山路 12.5143832909
+沃尔 9.7898037878
+闹嚷嚷 10.9049453784
+何卜 13.2075304714
+家雀儿 13.2075304714
+针织机 12.1089181827
+吗啡 9.93038573842
+丫丫 11.7034530746
+盛放 10.8561552143
+工业地带 11.1926274509
+非理性 8.5440913773
+更累 12.8020653633
+林分改造 13.900677652
+三级 7.82993992397
+披坚执锐 11.7034530746
+沃尼 12.2912397395
+更紧 10.4666904475
+裴满氏 13.2075304714
+激光唱片 12.2912397395
+巩志 13.900677652
+更糟 9.89334446674
+马蹬子 13.2075304714
+思贤若渴 12.1089181827
+认尸 12.8020653633
+押到 10.3453295905
+不论怎么 11.9547675029
+原帖 9.80633308975
+臭美 12.2912397395
+普斯卡 13.900677652
+何劳 11.1280889297
+蝲蛄 12.5143832909
+西夏文 9.69598503258
+粟弋 12.5143832909
+沃州 12.2912397395
+国际歌 10.9562386728
+一方有难 12.1089181827
+升上 10.0505300503
+何功 12.1089181827
+偷奸耍滑 13.2075304714
+何力 12.5143832909
+杜诗中 12.5143832909
+调换 10.0294766411
+乱画 12.2912397395
+潜移默化 10.2897597393
+七百六十六万一千余锭 13.2075304714
+牡蛎 9.34680076038
+手推磨 13.900677652
+查理之 12.5143832909
+曾三异 12.8020653633
+乱用 11.0674643079
+中继站 10.8561552143
+张乐行 11.4157710022
+费尽心机 10.7226238216
+过拜伦 13.2075304714
+德皇 11.1926274509
+劝善惩恶 13.900677652
+盐茶 11.598092559
+平飞 10.3171587135
+国兴兵 12.5143832909
+黄花鱼 10.5684731418
+轴角 13.2075304714
+简单易行 10.7226238216
+孙乾同 13.2075304714
+浸酒 13.900677652
+绕回 12.2912397395
+音乐界 11.7034530746
+平稳性 11.5027823792
+滑精 12.5143832909
+笔形 13.900677652
+一言九鼎 10.8096351986
+更精 12.5143832909
+去秋 11.7034530746
+下星期 11.598092559
+结拜 10.4666904475
+玄武湖畔 13.900677652
+秦入豫 13.2075304714
+笔录 9.56994431169
+原平 11.1926274509
+联盟党 11.8212361103
+参数估计 11.5027823792
+养蚕业 10.9049453784
+大鼻子 10.2630914922
+何勇 11.4157710022
+平度市 12.2912397395
+类此 11.9547675029
+斯坦纳 13.2075304714
+至再至三 13.900677652
+板根 11.7034530746
+数控车床 13.2075304714
+昌图厅 12.8020653633
+力不从心 9.59661255877
+神色自若 11.9547675029
+财政危机 10.5684731418
+福州大学 11.8212361103
+糜蛋白酶 13.900677652
+小气鬼 12.8020653633
+郊区居民 13.900677652
+女服 13.900677652
+赫里河 13.900677652
+没船 13.900677652
+加菜 13.2075304714
+风险金 13.2075304714
+渗透率 10.3171587135
+异丁烷 11.7034530746
+寡嫂 10.9562386728
+板栗 8.96620371885
+高级工 13.900677652
+岳麓山 11.8212361103
+欧安会 11.7034530746
+敢弹 13.900677652
+昌图县 12.1089181827
+推销员 10.1630080337
+一些余部 13.2075304714
+武夷山脉 9.98865464655
+领袖欲 13.2075304714
+阿罗诃 13.900677652
+子服 12.8020653633
+许荣茂 13.2075304714
+里奇蒙 12.1089181827
+农电 13.2075304714
+傅玄 12.2912397395
+于潜航 13.2075304714
+维修站 10.8096351986
+升仙 11.2616203224
+崔府君 13.2075304714
+韦为界 12.8020653633
+改大 11.9547675029
+红卫河 12.5143832909
+女权 12.8020653633
+敢开 13.900677652
+板桥 10.0505300503
+平顺 9.7898037878
+高丽纸 13.900677652
+忖度 10.9562386728
+一月底 13.900677652
+红玫瑰 11.1926274509
+女杰 12.5143832909
+升任 8.43261751084
+平顶 9.84023464143
+彀中 12.1089181827
+吕欠斯 13.2075304714
+蔡毓 12.8020653633
+咸补海 12.8020653633
+琢成 11.8212361103
+结扎 10.1630080337
+谷王朱 13.900677652
+板框 13.2075304714
+空中飞人 12.8020653633
+不多会儿 12.5143832909
+自选动作 11.2616203224
+合战 12.1089181827
+赫里欧 11.9547675029
+虚誉 13.2075304714
+风媒 12.8020653633
+诚服 13.900677652
+以夷制夷 12.1089181827
+撞个满怀 11.598092559
+体制 6.824868788
+环流 8.74738605748
+调摄 10.9049453784
+陈谷子烂 13.900677652
+牺牲品 9.63799777493
+主义精神 13.2075304714
+卜式 13.2075304714
+费尽心思 11.1280889297
+原处 9.66657114738
+何喜 12.1089181827
+环境要素 11.8212361103
+九曲 9.96885201925
+守御 9.23723855786
+蔡氏 11.0674643079
+宝蓝色 12.5143832909
+乖乖虎 12.8020653633
+邯郸路 13.900677652
+串场河 11.2616203224
+三院 9.85762638414
+环海 10.7226238216
+羊狠狼贪 13.2075304714
+胸章 12.1089181827
+卡尔沙 13.2075304714
+翁牛特旗 11.3357282945
+禅意 11.8212361103
+卡尔波 13.2075304714
+翰林 9.17328983326
+姜维入 12.5143832909
+周密计划 12.1089181827
+梦游 10.4041700905
+带人 9.89334446674
+职务行为 12.1089181827
+安帝初 12.8020653633
+赖以生存 9.62401153296
+悉心照料 12.8020653633
+观音殿 12.5143832909
+姜维兵 12.1089181827
+无数个 9.85762638414
+击鼓鸣金 13.2075304714
+王徽之 13.900677652
+忙音 11.7034530746
+音乐片 12.2912397395
+闪烁其辞 11.9547675029
+深入探讨 10.2897597393
+助跑 11.0674643079
+副学士 13.900677652
+考不上 11.0103058941
+带些 9.93038573842
+没藏 11.8212361103
+国清寺 10.604840786
+哈比布拉 11.9547675029
+艳福 11.2616203224
+上下其手 11.7034530746
+无功不受禄 13.900677652
+遗传性状 11.1926274509
+美其名曰 11.7034530746
+国际法 8.66956903512
+伯承 11.4157710022
+建瓯 10.6818018271
+振动磨 13.900677652
+链轮 11.8212361103
+贤伉俪 12.5143832909
+晴转多云 12.8020653633
+虚言 10.7226238216
+戈尔德 11.2616203224
+戴裔煊 13.2075304714
+蔡河 11.1926274509
+瘦下去 11.7034530746
+俗体 12.1089181827
+笔墨 8.51618258919
+药师佛 12.1089181827
+新科状元 11.9547675029
+竖写 11.9547675029
+裤头 10.9562386728
+商业片 11.7034530746
+工作组 8.49350588052
+体力 8.25170341381
+鲜润 11.598092559
+药交会 13.900677652
+献身 9.14708746087
+禁令 8.63798746307
+拉吉夫 13.900677652
+刘文辉 11.8212361103
+见识 8.04274449749
+考试合格 10.7226238216
+利诱 10.765183436
+晓辉 9.53122979951
+李志勇 13.900677652
+报了名 11.7034530746
+以智取胜 13.2075304714
+杭育 11.7034530746
+复写 12.2912397395
+女性 6.69207731402
+盖碗茶 10.604840786
+咪唑类 12.8020653633
+敷文 13.2075304714
+戳入 12.5143832909
+查理三世 13.900677652
+何啻 13.2075304714
+很好 7.4439079964
+原委 9.34680076038
+成果鉴定 12.5143832909
+山洪爆发 13.900677652
+原始 6.59146528628
+锡尔河 9.94943393339
+区区小事 11.7034530746
+封泥 10.2371160058
+带个 9.93038573842
+暴吏 13.900677652
+自然地理 8.79473217808
+成基命 13.900677652
+铁蛋白 12.5143832909
+参拍者 13.900677652
+论事 11.2616203224
+学着点 12.1089181827
+隋代周 11.9547675029
+重安江 13.900677652
+英国国防部 10.6818018271
+纤丝 12.2912397395
+加尔达湖 13.900677652
+徐沛 12.5143832909
+扣除额 12.5143832909
+带上 7.72066099832
+带下 10.7226238216
+切尔卡瑟 12.8020653633
+难以渗透 13.900677652
+预付资本 8.44535653662
+吉祥图案 13.900677652
+洛夫斯 11.5027823792
+沉寂多年 13.2075304714
+腌臢 13.900677652
+易损性 13.900677652
+现场会议 10.4349417492
+伯克伊 13.900677652
+笔头 11.0103058941
+南岳怀让 13.900677652
+乱猜 10.9049453784
+恶声 11.598092559
+环江 11.1280889297
+带信 10.5684731418
+调教 9.58318953844
+通高 10.4994802703
+停经 11.5027823792
+香小筑 13.900677652
+心灵手巧 11.5027823792
+曲轴 10.1630080337
+曼妮芬 11.8212361103
+横飞 10.2117981979
+遮光罩 13.900677652
+阿非利加 11.598092559
+马提亚 11.4157710022
+利斯一世 13.900677652
+夏镇 12.1089181827
+内半缩醛 13.900677652
+发迹史 12.2912397395
+高顺军 12.8020653633
+虚设 10.642581114
+激光治疗 12.2912397395
+野劲儿 13.900677652
+槌子 12.5143832909
+宗教事务 10.7226238216
+精彩演出 12.5143832909
+腌臜 11.2616203224
+中柱原 13.900677652
+挽救不了 13.2075304714
+虚词 10.4994802703
+民防体制 13.900677652
+晚餐会 13.2075304714
+观后感 13.2075304714
+九枝 13.900677652
+岿然 12.2912397395
+突出点 13.900677652
+俗事 11.3357282945
+虚证 9.41204128224
+九枚 12.8020653633
+白鹿原 8.78868986362
+虚话 11.8212361103
+虚诞 12.8020653633
+脏活 11.8212361103
+心理变态 11.9547675029
+滥套 13.900677652
+生龙子 13.2075304714
+板滞 12.2912397395
+吭哧 10.642581114
+九架 13.2075304714
+虎口余生 13.900677652
+环氧 11.598092559
+棉兰 12.2912397395
+肠粉 13.2075304714
+公辞 13.2075304714
+奥古斯丁 10.6818018271
+文胜质 13.900677652
+外祖母 8.4980002701
+神情愉快 13.2075304714
+体协 13.2075304714
+魂断蓝桥 13.2075304714
+萨奥 12.1089181827
+推动型 9.85762638414
+古亭区 13.900677652
+环水 10.765183436
+俗人 10.1394775363
+棉农 12.2912397395
+开颅 12.1089181827
+发绿 11.1280889297
+特种纸 13.900677652
+虽难 13.2075304714
+宣宗大 12.2912397395
+领取证 13.2075304714
+何启 12.2912397395
+美杜莎 13.900677652
+宁沪杭 12.5143832909
+献辞 13.2075304714
+俗乐 11.2616203224
+医药品 12.2912397395
+开题 13.900677652
+分散型 12.5143832909
+没落 8.81927328699
+户籍警 12.5143832909
+开颜 12.2912397395
+贷存比 10.4041700905
+宋江怒 13.2075304714
+十二行 13.2075304714
+愤怨 12.5143832909
+百货大楼 10.4041700905
+拍肩膀 13.2075304714
+臀部 9.03314320152
+腌腊 11.9547675029
+田园城市 13.2075304714
+司礼监 8.29120585679
+评理 11.3357282945
+九条 10.533381822
+彭泽益 12.8020653633
+龙蟠虎踞 12.2912397395
+都心知 13.900677652
+铅笔芯 11.9547675029
+阿尔穆 11.8212361103
+培养液 11.9547675029
+泰顺县 12.8020653633
+人人过关 13.900677652
+用茶 13.2075304714
+曲辞 12.2912397395
+扳转 12.5143832909
+超大规模 10.604840786
+调料 9.77354326693
+狄摩西 13.2075304714
+带伤 10.1394775363
+失落感 11.1926274509
+馋嘴 11.8212361103
+九服 12.5143832909
+会票 13.2075304714
+氯气 9.72629038208
+九月 7.28060444545
+九朵 11.9547675029
+拿回 10.9049453784
+寿州窑 12.5143832909
+佐尔 12.1089181827
+延福寺 12.5143832909
+带会 13.900677652
+贩毒 10.6818018271
+平方公里 6.65146259486
+更稳 12.8020653633
+原声 13.900677652
+络子 11.8212361103
+杨柳科 11.9547675029
+牛家屯 12.5143832909
+台普济 13.2075304714
+堵允锡 12.8020653633
+纪用 13.2075304714
+喷雾器 12.2912397395
+氯水 12.8020653633
+低姿态 13.2075304714
+片层 11.9547675029
+鳞片 8.87023973058
+闲置不用 11.4157710022
+直贡呢 13.900677652
+项内 13.900677652
+公孙大娘 12.8020653633
+英语系 12.2912397395
+保管费 13.2075304714
+狐媚魇道 13.900677652
+孙乾先 12.2912397395
+忽悠 9.04086524761
+磁砖 11.8212361103
+奇美 11.4157710022
+家庭医生 12.5143832909
+庶人 9.38981814546
+二十三个 11.8212361103
+一千二百株 13.900677652
+驿城区 11.7034530746
+一神论 12.1089181827
+计算错误 12.1089181827
+六八面 13.900677652
+结果 4.94561670134
+庶事 11.5027823792
+昏睡不醒 11.598092559
+沃壤 13.2075304714
+敢不承命 13.900677652
+一日为师 11.9547675029
+束胸 13.2075304714
+锚固 11.3357282945
+胶体磨 13.2075304714
+金吉列 12.5143832909
+不同点 10.3453295905
+唐初相 13.2075304714
+胁逼 12.1089181827
+结构 4.8309796098
+百鸟争鸣 13.2075304714
+柘城 12.1089181827
+闾弟夫 12.8020653633
+避讳 9.66657114738
+原子 7.14957618304
+成双成对 10.9562386728
+十顷 11.5027823792
+小婶 13.900677652
+说嘴郎中 13.900677652
+曲调 8.64840422393
+抛起 11.5027823792
+一万余吨 13.2075304714
+整体铸造 12.5143832909
+夏阳 12.1089181827
+法兰西斯 11.9547675029
+体健 12.1089181827
+于汉律 12.8020653633
+黄道日 13.900677652
+曲谱 10.4041700905
+笔述 13.900677652
+刘家峡水电站 11.0674643079
+安杰利 12.5143832909
+郁金香 10.3453295905
+外运量 12.8020653633
+闯南走北 13.900677652
+利奥波 13.2075304714
+白无常 13.900677652
+余弦定理 13.900677652
+与民更始 11.598092559
+哈乃斐 11.5027823792
+原宜 13.900677652
+发酵法 11.1280889297
+东欧地区 11.5027823792
+没骨气 12.8020653633
+夏雨 8.84443184663
+结束符 11.9547675029
+查梅莱 13.900677652
+何地 10.1871055853
+结末 13.2075304714
+仲景 12.1089181827
+何在 8.39941944143
+有法可依 11.4157710022
+十二生肖 11.1926274509
+六十亿美元 13.2075304714
+磁碟 13.900677652
+再煎 13.2075304714
+初来乍到 10.533381822
+牡荆 12.8020653633
+二十多万 10.765183436
+机械部 12.8020653633
+花卉图 13.900677652
+傅相 12.5143832909
+宣战书 11.9547675029
+原宥 13.2075304714
+交战状态 12.2912397395
+原审 11.598092559
+同心合胆 13.2075304714
+性无能 12.2912397395
+调兵山 13.2075304714
+皮化生 12.8020653633
+衔头 12.8020653633
+朱谦 12.2912397395
+闲隙 13.2075304714
+软骨鱼 10.642581114
+爱洛伊 13.900677652
+玄佛 13.2075304714
+需提交 11.2616203224
+安见得 12.8020653633
+游来 11.598092559
+盛意 11.4157710022
+夏随 12.8020653633
+虚表 13.2075304714
+管道配件 13.900677652
+中华苏维埃共和国 9.54396882529
+胁肩谄笑 13.2075304714
+裤子 8.00352378434
+静电感应 11.1280889297
+通风 8.26946587015
+支撑危局 12.2912397395
+芦管儿 13.900677652
+板油 12.5143832909
+女排 11.1926274509
+负担沉重 10.9562386728
+无坐力炮 10.6818018271
+沃姆 13.900677652
+邦畿 12.2912397395
+邹普胜 11.7034530746
+往下走 10.1394775363
+雍六州 12.8020653633
+盛情 9.74179456862
+客户端程序 13.900677652
+环湖 10.5684731418
+社会保险 9.27570483869
+星占术 13.900677652
+意绪 12.2912397395
+棉区 10.7226238216
+王孝通 11.9547675029
+调来 9.07236391467
+娱乐场所 10.1394775363
+九日 10.3453295905
+此钟 13.900677652
+窘相 13.2075304714
+振动筛 13.2075304714
+九旬 11.7034530746
+腌菜 11.0103058941
+流下 8.80692745117
+六千出 13.2075304714
+何国 11.9547675029
+癫狂 10.1871055853
+丰田汽车公司 11.7034530746
+拓扑图 13.900677652
+秦置延 12.5143832909
+嬉笑怒骂 11.4157710022
+战略武器 10.1871055853
+何园 11.9547675029
+体全 13.2075304714
+横骨 12.5143832909
+凤翅银 13.2075304714
+二手设备 13.900677652
+灵醒 11.2616203224
+中继线 13.2075304714
+肠线 13.2075304714
+染色剂 12.2912397395
+武汉东湖开发区 13.900677652
+笔字 13.2075304714
+补肝肾 11.3357282945
+九方 13.900677652
+九斤 11.7034530746
+禅房 10.2630914922
+开驶 13.900677652
+环游 12.5143832909
+携家带眷 12.8020653633
+弗兰克斯 13.900677652
+美中不足 10.2630914922
+棒针 11.4157710022
+抗战史 13.2075304714
+镁矿 12.2912397395
+左丞相 9.40086798165
+开骂 13.900677652
+何去何从 9.30555780184
+虾油 13.2075304714
+叫惯 11.2616203224
+喜峰口 10.533381822
+廖思源 9.75754292558
+往下跳 10.4994802703
+谈话会 12.5143832909
+蒸煮 10.4994802703
+季孙氏 12.5143832909
+万荣县 12.1089181827
+德国马克 11.1280889297
+九数 12.8020653633
+司密斯 13.2075304714
+癖性 11.9547675029
+锪孔 13.900677652
+真心真意 12.8020653633
+吾自有处 13.900677652
+难民潮 13.2075304714
+乌纳水 12.8020653633
+调查 5.48485295495
+简装修 13.2075304714
+束缚电子 13.900677652
+归周公 12.8020653633
+通顺 11.0103058941
+赏不遗贱 12.8020653633
+花些 11.7034530746
+体内 6.64791523392
+悬想 12.1089181827
+扯住 8.58255765813
+盛怒 10.3453295905
+弹不出 13.900677652
+时先主 13.2075304714
+玄义 12.2912397395
+普通人 8.83808261895
+超低压 13.900677652
+结晶 7.88208443748
+巴达赫 13.900677652
+杭菊 12.1089181827
+锻模 12.5143832909
+挪用 9.00283785202
+曹霁阳 13.900677652
+贪污案 12.5143832909
+别区 13.900677652
+开高 9.46986085313
+宋鸿 12.1089181827
+三百七十七万 13.2075304714
+沃夫 13.2075304714
+发酵液 12.5143832909
+谷寿夫 12.8020653633
+押回 11.0103058941
+盐铁论 10.6818018271
+社会保障 7.94743431769
+紧密配合 11.1280889297
+晋宋 11.4157710022
+报文交换 13.900677652
+阅读器 10.9049453784
+九支 13.900677652
+城市污水 12.1089181827
+锚地 10.9049453784
+粮尽援绝 11.1926274509
+泰纳尔 13.2075304714
+玻璃缸 12.2912397395
+南北议和 11.8212361103
+押头 13.900677652
+开锁 10.2897597393
+懒惰 10.2371160058
+村野匹夫 13.900677652
+开锄 13.900677652
+开锅 12.1089181827
+流风余韵 13.2075304714
+低利率 8.59737274392
+认认真真 10.604840786
+天地人 12.1089181827
+加强团结 11.598092559
+何妨 9.5186510173
+布雷斯 10.2630914922
+何妥 13.2075304714
+介质击穿 11.8212361103
+一长一短 11.9547675029
+存栏 10.765183436
+没要 10.9049453784
+开锣 10.5684731418
+开始运行 11.7034530746
+藉由 12.5143832909
+贯彻落实 8.16733637508
+鲮鲤 11.7034530746
+曲艺 9.37888907493
+寓居 10.0940151622
+宋金 9.5062284973
+笔名 8.9519177616
+忧心 9.49395840471
+杨力劝 12.8020653633
+西莫诺 13.900677652
+何如 8.61747392324
+强五 13.900677652
+产品名称 10.765183436
+体平 13.900677652
+梁时赐 13.2075304714
+卜卜 12.2912397395
+李志常 13.2075304714
+群臣 8.02014466558
+皮相之见 13.2075304714
+蛾术 13.900677652
+牵线人 12.1089181827
+施今墨 12.8020653633
+仪象 10.9562386728
+曝光率 10.8096351986
+没见 7.44705265308
+挪窝 12.2912397395
+左招右 12.5143832909
+调校 10.7226238216
+阿齐木 13.2075304714
+卜卦 10.1871055853
+于汉军 12.8020653633
+献艺 10.9049453784
+毒副作用 10.6818018271
+遗害无穷 13.2075304714
+大恩大德 11.5027823792
+住区 11.9547675029
+申末 11.8212361103
+安达鲁西亚 13.2075304714
+驻屯军 12.1089181827
+镁砂 12.5143832909
+山名青 12.8020653633
+社民党 10.604840786
+卢安瓜 13.2075304714
+撤席 12.1089181827
+豫园 9.98865464655
+扶雪妍 13.2075304714
+镁砖 12.8020653633
+工作狂 12.8020653633
+迹地 12.1089181827
+杰拉 11.3357282945
+药枕 13.900677652
+讹谬 12.8020653633
+夏风 8.73589167805
+杞人之忧 11.8212361103
+拿定 9.96885201925
+何夕 13.900677652
+瑰姿 13.900677652
+绝密文件 13.900677652
+桑家口 12.8020653633
+纳帕塔 12.8020653633
+埃克塞特 13.2075304714
+老干部 9.16447920358
+何处 7.31588625959
+乌兹别克斯坦共和国 12.2912397395
+乱纪 13.2075304714
+有名无实 10.4994802703
+不断更新 9.80633308975
+一次方程 11.9547675029
+金属杆 12.8020653633
+苯丙胺 12.8020653633
+盛演 11.1280889297
+拷问 9.7898037878
+玉翠儿 13.2075304714
+瑶族自治县 12.1089181827
+吐绿 13.2075304714
+海盐县 11.1280889297
+懒怠 11.8212361103
+先演 12.2912397395
+虚虚 11.3357282945
+磁盘 9.7898037878
+孙乾往 12.8020653633
+半球型 13.900677652
+水到渠成 9.6811699468
+声辩 13.2075304714
+克服困难 10.5684731418
+事母至孝 12.1089181827
+开门 7.36109169636
+时代风貌 11.9547675029
+连续光谱 11.8212361103
+鲮鱼 12.1089181827
+开间 11.0674643079
+开闸 8.49350588052
+金属板 10.9562386728
+富图纳 11.9547675029
+柳阴树 12.2912397395
+电泳漆 13.900677652
+一成不变 9.72629038208
+啸叫 13.900677652
+一拥而入 11.3357282945
+羽状脉 11.5027823792
+苍松翠柏 11.0103058941
+艾丽丝 13.900677652
+斯皮奥 13.2075304714
+盎司 8.0746775446
+设奠 12.8020653633
+原名 7.11848559597
+自发发射 13.2075304714
+原吉 12.8020653633
+八十五万英镑 13.2075304714
+尖扎县 12.8020653633
+板报 12.5143832909
+文学工作者 12.1089181827
+邝安 13.2075304714
+幕剧 11.0674643079
+不知所终 10.9562386728
+金大人 9.21854642485
+蚁酸 12.2912397395
+懒懒 10.4666904475
+傅祥 13.2075304714
+更直 13.900677652
+萨利纳斯 13.900677652
+家败人亡 13.900677652
+泡网吧 12.5143832909
+套色版 13.900677652
+相面 10.4041700905
+盛满 10.0940151622
+体式 11.0674643079
+欧美均 13.2075304714
+二百多万元 13.2075304714
+坐上来 12.5143832909
+武鸣县 11.7034530746
+相靠 13.2075304714
+梆子 9.29550746599
+时日无多 12.5143832909
+易拉罐 13.2075304714
+嘴皮子 11.3357282945
+方腊见 12.1089181827
+音乐网 13.900677652
+庄希泉 13.900677652
+出席证 13.900677652
+束手就擒 11.0103058941
+色情狂 13.900677652
+体彩 10.9562386728
+拉那烈 12.1089181827
+信息产业部 11.0674643079
+原告 8.9102450652
+阿尔皮 13.900677652
+钢琴师 12.8020653633
+验印 13.900677652
+怀德县 13.900677652
+厮缠 13.2075304714
+朱大昀 13.2075304714
+位置矢量 13.2075304714
+壁面 10.4666904475
+波澜不惊 9.94943393339
+输过 13.900677652
+挖角 11.598092559
+改回去 12.1089181827
+原味 11.598092559
+群体行为 11.7034530746
+可接受性 13.900677652
+堂妹 11.9547675029
+多特 12.8020653633
+青桃 13.900677652
+书桌上 10.9562386728
+有事之秋 13.900677652
+章前冠 13.2075304714
+菲利 12.2912397395
+爱因斯坦 8.65893063692
+阿尔登 12.8020653633
+机械故障 12.1089181827
+菲勒 13.900677652
+下载站 13.900677652
+商业网 12.2912397395
+渠帅移 13.2075304714
+胡道 11.598092559
+卜力 12.5143832909
+臀鳍 8.9102450652
+红军总政治部 12.1089181827
+纪效新 11.1926274509
+贩枪 13.2075304714
+哥伦比亚政府 13.2075304714
+何堪 12.8020653633
+曲菌 13.2075304714
+九歌 10.604840786
+孔繁森 13.900677652
+鄂豫 11.598092559
+傅科 11.2616203224
+弃甲丢盔 13.2075304714
+灰塌塌 13.900677652
+吸水性 10.3743171274
+士官 9.62401153296
+虚拟盘 13.900677652
+缺铁性 10.6818018271
+助耕 13.900677652
+官朗声 13.2075304714
+歉然 11.598092559
+夏加尔 12.8020653633
+延用 11.4157710022
+兼爱 11.2616203224
+立案侦查 10.5684731418
+助老 13.2075304714
+开钻 12.5143832909
+欧文斯 11.2616203224
+美玉无瑕 13.900677652
+高秆作物 12.8020653633
+告老还家 13.900677652
+无往而不胜 13.900677652
+望宣赞 13.900677652
+同德殿 13.900677652
+尼克酸 11.1926274509
+预支 11.0103058941
+雄蜂 11.0674643079
+电工学 12.2912397395
+风化区 13.2075304714
+体念 11.9547675029
+逆城市化 13.900677652
+霍先生 13.2075304714
+书法展 11.9547675029
+落九天 11.9547675029
+酒后失态 13.2075304714
+玩具箱 13.2075304714
+女流 10.7226238216
+齐施 13.900677652
+耗电量 10.2117981979
+忙什么呢 13.2075304714
+狡兔三窟 11.7034530746
+分压器 12.8020653633
+何塞 11.3357282945
+晋军先 13.2075304714
+磁矩 9.63799777493
+多神教 11.0674643079
+柳宿增 13.900677652
+磁石 10.1164880181
+结案 9.55687223012
+九次 10.9562386728
+蚬壳 11.0103058941
+永安街 13.900677652
+开铺 13.900677652
+铁幕 12.2912397395
+气压 8.75901409547
+游离态 12.2912397395
+密密实实 11.9547675029
+超常发挥 13.2075304714
+不吉之兆 12.2912397395
+查理五世 10.642581114
+没让 9.94943393339
+没讨 11.598092559
+一万五千一百四十四卷 13.2075304714
+办案 9.0884932966
+没记 12.1089181827
+同乡会 11.1280889297
+拿大 11.9547675029
+棉布 8.97342396682
+神经性 10.0720362555
+平台车 13.900677652
+菲克 13.900677652
+花乡 12.5143832909
+雅马哈 13.900677652
+棉帽 11.598092559
+不变价格 12.1089181827
+臭皮 13.2075304714
+贺凤英 10.1394775363
+原地 8.30969067146
+何宏 11.598092559
+何安 11.8212361103
+姜维引 11.1280889297
+原在 9.29550746599
+颜面 9.63799777493
+贴膜 11.9547675029
+百分之七十 11.4157710022
+蒸熟 10.0294766411
+筲箕 13.2075304714
+樊迟 13.2075304714
+千古遗恨 13.900677652
+七八道 13.900677652
+中资企业 10.6818018271
+平金 13.2075304714
+班鸠 13.900677652
+膜分离 11.8212361103
+卜兆 12.5143832909
+曲者 12.2912397395
+卫成公 12.8020653633
+平野 11.4157710022
+没请 11.9547675029
+月经期 10.7226238216
+原址 10.0940151622
+浣溪纱 13.900677652
+半场 10.7226238216
+刘老板 13.2075304714
+有过 7.64877376881
+没词 12.2912397395
+皮管子 13.2075304714
+培元固本 13.900677652
+公孙胜先 13.2075304714
+姜维归 13.2075304714
+没试 13.2075304714
+盛润 11.7034530746
+辛丑年 13.2075304714
+体层 12.8020653633
+任兴元 12.8020653633
+原坡 10.3743171274
+抓进来 13.900677652
+笨人 12.1089181827
+难民所 13.2075304714
+梦想 7.75007488353
+结款 13.900677652
+计都星 12.2912397395
+宁为玉碎 11.2616203224
+泰山压顶 11.7034530746
+赫里斯 11.1926274509
+建章 10.8561552143
+路障 11.0674643079
+原型 8.37522471284
+抽样法 12.8020653633
+曲背 13.900677652
+严严实实 9.41204128224
+壁钟 13.900677652
+尼氏体 12.8020653633
+建立 4.6215577646
+花面狸 11.7034530746
+拿妖 12.2912397395
+押宝 10.533381822
+顶住 8.78868986362
+收信人 11.0674643079
+更番 13.900677652
+建站 11.1280889297
+抹不掉 12.1089181827
+巴哈尔 12.5143832909
+走一遍 12.2912397395
+汪蓉 13.900677652
+搓麻 10.642581114
+更生 11.1280889297
+黄山谷 12.8020653633
+商业城市 10.1630080337
+印尼政府 12.5143832909
+领唱 11.5027823792
+鼾声 9.34680076038
+花丝 10.0505300503
+活动房 13.900677652
+王少弟 12.8020653633
+撩起 9.33632946051
+瑰宝 9.91169360541
+宋齐梁 12.5143832909
+甘不察 12.1089181827
+翁之意 13.900677652
+那青 12.2912397395
+钢铁市场 10.765183436
+拓扑学 10.0505300503
+挺伸 13.900677652
+戚绩 13.900677652
+骂骂咧咧 10.3171587135
+音乐系 10.533381822
+原基 11.598092559
+姜维必 13.2075304714
+九格 13.900677652
+连带关系 12.5143832909
+红蒙蒙 13.2075304714
+柳江县 12.8020653633
+嫉贤妒能 11.9547675029
+闪族 12.2912397395
+铜字 13.900677652
+磁瓶 12.5143832909
+维修班 12.2912397395
+自然科学 7.87481167815
+陈矫 11.9547675029
+小保姆 10.1164880181
+两千零五十名 13.2075304714
+争强好胜 11.4157710022
+高利圣 12.5143832909
+西斯莱 11.9547675029
+挪移 10.1871055853
+跳跃者 13.2075304714
+深圳经济特区 11.5027823792
+平邑 12.8020653633
+孔融让梨 13.2075304714
+保密制度 12.8020653633
+近一半 9.61021821083
+试工 13.900677652
+可见光 9.01032852375
+开阔 7.85804481829
+王兴 12.5143832909
+国家外国专家局 13.2075304714
+花下 11.1926274509
+阿尔瓦 11.7034530746
+隋代定 13.2075304714
+染色布 13.900677652
+侯家窑 12.8020653633
+克斯霍尔 12.1089181827
+普特曼 11.5027823792
+闭合电路 13.900677652
+调正 13.2075304714
+接受任务 11.1926274509
+环扣 12.1089181827
+几千美元 13.900677652
+盛泽 11.4157710022
+广谷 11.9547675029
+磁电 11.8212361103
+演员阵容 12.5143832909
+喀斯特 8.83177344976
+宋江唤 12.1089181827
+扣除非 9.16447920358
+拨来 11.4157710022
+建筑 5.81457511631
+龈炎 13.2075304714
+换骑 13.900677652
+急诊病人 12.2912397395
+铁床 11.7034530746
+拉亚 13.2075304714
+煤炭厅 13.900677652
+触霉头 11.9547675029
+公侯勋 12.1089181827
+剡溪 12.1089181827
+张鼐速 13.2075304714
+成训教 13.2075304714
+须飘然 13.2075304714
+眼观四面 13.2075304714
+仪轨 11.0674643079
+苏尔瓦 12.8020653633
+锚定 11.598092559
+感情投资 13.900677652
+铺盖卷 10.4041700905
+维吉尼亚 13.900677652
+吼道 8.98802276624
+淙淙 10.642581114
+王少康 12.8020653633
+开除 8.49350588052
+边大绶 13.2075304714
+横隔 11.7034530746
+顶事 10.3743171274
+滑行道 11.0674643079
+嵌进 11.3357282945
+淡而无味 11.8212361103
+切割片 13.900677652
+杂交育种 10.8561552143
+市场走势 7.74369866639
+视觉后象 13.900677652
+故步自封 13.900677652
+结新欢 13.900677652
+怀德军 12.8020653633
+钝刀 12.8020653633
+中小城镇 10.642581114
+衔命 12.1089181827
+售楼员 10.8561552143
+文人墨客 11.3357282945
+捕拿 13.2075304714
+书海 12.5143832909
+甘孜藏族自治州 11.1926274509
+磁疗 11.7034530746
+仲康死 12.8020653633
+中立区 11.598092559
+钤印 11.8212361103
+水墨画 10.2371160058
+麂皮 11.598092559
+梅尔特 13.900677652
+自发辐射 12.8020653633
+佐剂 12.2912397395
+伊万诺 12.8020653633
+取悦于民 13.2075304714
+捻指 13.2075304714
+盛汤 12.1089181827
+阿尔琼 13.900677652
+求全之毁 13.900677652
+盛气 12.2912397395
+寡助 13.900677652
+体已 12.8020653633
+顶个 10.8096351986
+建管 12.1089181827
+柏乡 13.900677652
+辛德勒 12.5143832909
+建立相应 11.0674643079
+踉踉跄跄 9.66657114738
+临界状态 11.598092559
+宽宽的 11.0103058941
+那株梅 12.8020653633
+原图 12.5143832909
+横队 10.9049453784
+消极性 13.2075304714
+档案资料 10.9049453784
+标准规定 10.7226238216
+顶上 8.03138073884
+亮亮的 10.9562386728
+王定保 12.8020653633
+讲定 11.4157710022
+西平 9.22784881751
+糌粑 11.5027823792
+应受谴责 12.8020653633
+六百余亩 13.2075304714
+平遥 10.533381822
+原因 4.9518319227
+路透 9.01787572939
+没趣 9.71102290995
+金玉满堂 12.8020653633
+笔债 11.7034530746
+王湘浩 12.5143832909
+镁粉 13.2075304714
+浦东 8.32094782599
+宋门 9.7898037878
+访问速度 13.900677652
+路通 11.598092559
+法塔赫 11.4157710022
+沃勒 11.9547675029
+覆上 13.900677652
+路途 8.96620371885
+城市污染 12.8020653633
+金属材料 9.16447920358
+翻墙而过 13.900677652
+硬件 8.42421410004
+赏罚分明 10.9049453784
+徐淮 11.3357282945
+西斯蒙 11.1280889297
+慧静 11.4157710022
+蹦极 12.5143832909
+黑老大 11.1280889297
+宽大处理 11.3357282945
+肐膊 12.8020653633
+彭孚 13.2075304714
+板极 13.900677652
+拿开 10.9562386728
+修辞格 12.1089181827
+第四十六 13.2075304714
+磁片 12.2912397395
+路遇 10.4349417492
+词汇表 13.2075304714
+没路 10.9049453784
+早得很 11.9547675029
+仪表 7.70423352418
+报每桶 10.2630914922
+原先 7.39041931145
+朱贵 9.13850371718
+十局 13.2075304714
+杰明 11.5027823792
+丁先儿 12.5143832909
+何川 13.900677652
+阿诺德 10.533381822
+吴继善 13.2075304714
+阿尔玛 12.8020653633
+高级别 10.642581114
+纺织物 11.1926274509
+几天几夜 10.4994802703
+路遥 11.8212361103
+董昌 11.4157710022
+乱穿 12.8020653633
+大海侵 12.2912397395
+易货贸易 12.5143832909
+冷气团 10.9049453784
+悄无声息 9.44633035572
+周信芳 11.3357282945
+抖动着 10.3743171274
+斯皮尔 13.900677652
+九溪 9.89334446674
+十字线 13.2075304714
+卞之琳 12.5143832909
+原军 11.0103058941
+板机 11.7034530746
+伊洛克 12.2912397395
+乱吼 12.1089181827
+罗齐 13.2075304714
+乱窜 9.58318953844
+两周岁 12.8020653633
+中共十一届三中全会 10.9562386728
+参会者 12.1089181827
+商政 13.900677652
+喷雾式 13.2075304714
+游息 12.2912397395
+捻搓 12.5143832909
+十几枚 13.2075304714
+体育竞赛 11.1926274509
+开展调研 12.5143832909
+拿得 10.4666904475
+须城安 12.8020653633
+未来派 12.2912397395
+救生设备 11.7034530746
+川沙镇 10.6818018271
+嫌人家 12.1089181827
+废弃物 9.93038573842
+瞎操心 11.9547675029
+分散度 13.2075304714
+参数表 12.5143832909
+女校 11.7034530746
+可人儿 12.5143832909
+经世文 11.9547675029
+班师回朝 12.2912397395
+平静 6.88766186234
+松果腺 11.5027823792
+傅粉 13.900677652
+开采 7.14026296089
+那艮岳 13.2075304714
+开释 11.0103058941
+齐放 11.598092559
+瞳人 11.8212361103
+十几枝 13.900677652
+平靖 13.900677652
+晨间 12.8020653633
+齐政 13.2075304714
+它会 8.51618258919
+开金 11.8212361103
+孙乾守 13.2075304714
+没赶 13.2075304714
+王同军师 12.5143832909
+异径管 13.900677652
+共同话题 13.900677652
+耙平 13.2075304714
+环斑 13.2075304714
+多毫米 10.7226238216
+大满贯 11.3357282945
+阿罗蒙 12.8020653633
+一万多块 12.2912397395
+力反馈 13.900677652
+油粕 11.2616203224
+阿基坦 11.7034530746
+胃镜 11.1926274509
+板材 9.27570483869
+调治 10.0088573539
+裤兜 10.9049453784
+火上添油 13.2075304714
+长男 13.900677652
+风光旖旎 11.8212361103
+平面 7.43608934829
+奶业 11.598092559
+没赚 11.3357282945
+索约河 13.2075304714
+调测 12.8020653633
+灰蒙蒙 10.3171587135
+歉疚 10.0940151622
+调济 12.8020653633
+同性恋者 11.1280889297
+押尾 12.8020653633
+卡尔斯 11.4157710022
+开选 13.2075304714
+波尔克 11.598092559
+故吏 10.8561552143
+寡味 12.8020653633
+忽律 11.1926274509
+大人大量 13.900677652
+挚诚 13.2075304714
+豁然醒悟 13.900677652
+康那拉 12.5143832909
+晋安郡 13.2075304714
+任兵科 12.8020653633
+分散式 12.5143832909
+卡尔文 11.7034530746
+杰杰 13.2075304714
+原值 10.642581114
+马燕红 12.5143832909
+排污口 13.900677652
+它们 5.00737950776
+护身法 13.2075304714
+越海军 13.900677652
+大本营 8.95903522937
+赵开心 12.2912397395
+复壁 12.8020653633
+请君入瓮 11.4157710022
+八十卷 11.9547675029
+药材 7.81163277653
+叩打 13.2075304714
+小不忍则乱大谋 11.8212361103
+骨转移 10.4994802703
+穿着打扮 11.1926274509
+热液 9.30555780184
+棉套 11.9547675029
+开遍 11.4157710022
+节节上升 11.9547675029
+高级化 11.8212361103
+肥美 10.4994802703
+盐贩 11.8212361103
+欧美化 13.900677652
+美国西北航空公司 13.900677652
+雷锡恩 12.2912397395
+结法 13.900677652
+格莱格 12.8020653633
+秉性难移 12.8020653633
+二千五百六十余 13.2075304714
+调派 10.7226238216
+副流感 13.900677652
+梦有 13.2075304714
+宋钞 12.8020653633
+封上柱 13.2075304714
+阿尔特 11.7034530746
+平面工艺 12.1089181827
+跟追 12.8020653633
+陈撄宁 12.5143832909
+体宽 10.9049453784
+诸臣入 13.900677652
+系统结构 10.9049453784
+侧耳细听 11.598092559
+稳打稳扎 13.900677652
+蔡斯 11.598092559
+平阔 13.900677652
+没谱 10.9049453784
+横遭 11.7034530746
+菌群失调 11.598092559
+核蛋白 12.2912397395
+来去自如 12.8020653633
+终成泡影 13.900677652
+凝成 10.4041700905
+何尝 8.58747167293
+写作家 13.900677652
+晨钟 13.2075304714
+要人命 12.2912397395
+平阳 9.06439574502
+征帆 13.900677652
+女病人 12.5143832909
+性刺激 10.765183436
+平阴 11.598092559
+稚鱼 12.2912397395
+通鉴 9.63799777493
+曲意逢迎 12.8020653633
+乱箭 9.29550746599
+武装带 11.2616203224
+托身 12.5143832909
+磁探仪 12.5143832909
+水文站 10.9049453784
+何山 12.8020653633
+白瑞德 13.900677652
+拧紧 11.3357282945
+王少堂 12.5143832909
+中国花卉协会 13.2075304714
+平陈 11.7034530746
+平降 13.2075304714
+宗立派 13.900677652
+新宁县 12.5143832909
+平陆 11.7034530746
+高效廉洁 13.900677652
+青红帮 12.1089181827
+天气炎热 10.3453295905
+航海模型 12.2912397395
+护墙板 13.900677652
+体察 10.2897597393
+知友 13.2075304714
+行程表 13.2075304714
+惯偷 13.900677652
+煞是好看 11.8212361103
+培养料 12.2912397395
+伯恩斯坦 10.604840786
+平陵 11.2616203224
+亲属称谓 12.8020653633
+横逆 12.8020653633
+宁一山 13.2075304714
+结汇 10.0294766411
+裘马清狂 13.900677652
+通里 13.2075304714
+出人命 9.75754292558
+通量 10.533381822
+通释 12.1089181827
+红叉叉 13.2075304714
+晨露 13.2075304714
+何德 11.9547675029
+排遣 10.0940151622
+穿孔卡片 12.1089181827
+乱码 12.5143832909
+扬砂走石 13.2075304714
+泼出去 11.3357282945
+谱牒 10.3453295905
+出去玩 10.3171587135
+素食者 12.2912397395
+板斧 10.3171587135
+索塔 12.2912397395
+九泉 10.3743171274
+本特利 13.900677652
+业余赛 13.900677652
+大山子 12.8020653633
+孙诒让 11.4157710022
+板料 11.9547675029
+人间烟火 11.1926274509
+漏斗状 10.1394775363
+大力提倡 10.3171587135
+笔划 10.4994802703
+蔡昌 13.2075304714
+蔡明 11.7034530746
+没输 13.900677652
+站出 12.8020653633
+调湿 12.8020653633
+器宇不凡 12.8020653633
+海道南 13.2075304714
+没辙 11.1926274509
+县团级 12.8020653633
+空军部队 10.3453295905
+无数种 13.2075304714
+顾虑到 13.2075304714
+瀑河 11.7034530746
+棉婚 13.900677652
+不善言辞 13.2075304714
+大有希望 11.4157710022
+地狱般 11.598092559
+贸然行事 12.5143832909
+竖子 11.9547675029
+原华 13.2075304714
+东亚人 13.900677652
+锻接 13.900677652
+欧几里德 10.765183436
+卡尔曼 10.9049453784
+调温 10.765183436
+碑廊 12.5143832909
+权弄威 13.900677652
+陈敏章 13.2075304714
+水壶盖 12.2912397395
+困难 5.85188936844
+笔墨纸砚 11.2616203224
+因事制宜 13.900677652
+前瞻性 9.0884932966
+瞿安德 13.2075304714
+笔削 12.8020653633
+首席记者 8.83808261895
+磁灶 12.8020653633
+何必 7.33541268194
+没进 10.3743171274
+两周年 11.3357282945
+擅离职守 11.8212361103
+蔡晟 12.8020653633
+单人滑 13.900677652
+笔势 11.2616203224
+铁弗 11.4157710022
+宁江州 12.2912397395
+九江 8.4980002701
+办法 5.33755552867
+切片机 13.900677652
+仙湖 13.900677652
+霍普韦尔 13.2075304714
+虚耗 11.8212361103
+沉箱 11.7034530746
+平锅 12.8020653633
+高泳源 12.5143832909
+树碑立传 11.9547675029
+仰人鼻息 12.5143832909
+翰海 13.900677652
+颜钧 13.2075304714
+段仁 12.5143832909
+军令状 10.5684731418
+林业站 13.2075304714
+于格兰 13.900677652
+锋面雨 12.1089181827
+业绩考核 10.4041700905
+押往 11.1926274509
+十二经别 12.5143832909
+教务处 12.2912397395
+耐久性 10.7226238216
+晓薇 12.1089181827
+金云翘 11.9547675029
+举例说明 11.1280889297
+虚职 12.1089181827
+平度县 12.8020653633
+系列讲座 13.900677652
+妒贤嫉能 12.8020653633
+卡尔普 13.2075304714
+额勒登 12.8020653633
+原发 9.56994431169
+诸臣立 13.2075304714
+体壮 11.1926274509
+云轩里 13.2075304714
+八十匹 12.8020653633
+亚油酸 10.6818018271
+雷海宗 12.5143832909
+重新做人 12.1089181827
+冷心冷面 13.900677652
+免不得 10.765183436
+加克利 13.900677652
+知县 8.0746775446
+何当 13.900677652
+音乐教育 10.8096351986
+滕文公 11.3357282945
+刑部详 13.900677652
+唐河县 10.9562386728
+体壁 10.0505300503
+傅纳 13.2075304714
+原初 10.5684731418
+幼发拉底河 9.77354326693
+原创 5.77741633285
+江御史 12.1089181827
+原则 5.71979670998
+滨河路 12.2912397395
+传上来 12.8020653633
+欧美国家 9.40086798165
+卜吉 13.2075304714
+兵器装备集团公司 11.0103058941
+人事档案 11.9547675029
+体外 8.26588804881
+徇私作弊 12.8020653633
+两封信 10.8096351986
+通都 13.900677652
+更热 12.8020653633
+驴打滚 12.2912397395
+永兴 9.69598503258
+呼喝 11.598092559
+原判 11.5027823792
+建网 11.9547675029
+系统控制 10.8096351986
+敌群 12.5143832909
+地面灌溉 13.900677652
+身先士卒 10.3453295905
+高梁酒 13.900677652
+赫希斯 12.5143832909
+陆德明 12.5143832909
+乱神 13.900677652
+糊味 12.8020653633
+昌江黎族自治县 13.900677652
+加工业 8.94485059437
+发展势头 9.41204128224
+板擦 13.900677652
+结满 11.2616203224
+六中全会 10.1164880181
+调演 12.5143832909
+平铺 11.0674643079
+通邮 11.9547675029
+解固基 12.8020653633
+市场萎缩 11.598092559
+平铲 12.5143832909
+胡达林 12.8020653633
+后边 6.99192287266
+平银 11.598092559
+摆上来 11.9547675029
+转登 13.900677652
+布雷拉 12.5143832909
+武装力量 8.14810501315
+偎倚 12.8020653633
+灭弧 12.1089181827
+痛打一顿 11.8212361103
+何时休 13.900677652
+退回来 10.4041700905
+解愁 12.2912397395
+北王志 13.2075304714
+夏鼐 11.2616203224
+沃克 10.4994802703
+科学楼 13.900677652
+夏王纳 12.8020653633
+平埔族 11.3357282945
+目眩头晕 13.2075304714
+豆象科 13.2075304714
+波士顿市 13.2075304714
+揽货 13.900677652
+过洋操 13.900677652
+宋陵 11.1926274509
+观礼台 12.1089181827
+通道 6.63664750908
+比利时法郎 13.2075304714
+穆艾津 12.1089181827
+金属性 11.7034530746
+魏成子 12.5143832909
+原始群 11.598092559
+谢伟 13.900677652
+乱离 11.8212361103
+宋陈 13.2075304714
+赡养费 11.3357282945
+肠癌 11.7034530746
+瀑流 12.2912397395
+沃兹 12.8020653633
+大螯虾 13.2075304714
+两平方米 13.2075304714
+十二艘 12.5143832909
+加工件 12.8020653633
+虚脱 10.642581114
+结清 10.2630914922
+通透 9.96885201925
+体姿 12.8020653633
+脱羧 11.2616203224
+何年 11.1280889297
+黑龙江人民出版社 11.9547675029
+盐边 12.8020653633
+何平 11.1926274509
+何干 9.82314020807
+务头 13.900677652
+套节目 12.2912397395
+涞源 12.8020653633
+特殊用地 13.900677652
+生物化学系 12.8020653633
+通途 11.4157710022
+偎傍 13.900677652
+保留住 11.0674643079
+芤脉 13.2075304714
+雌配子 11.2616203224
+笔受 13.900677652
+九派 13.900677652
+体委 11.3357282945
+蹲苗 13.2075304714
+吴升那 13.2075304714
+寄费 13.900677652
+笔友 13.900677652
+卡尔杜 12.2912397395
+太尉教 13.2075304714
+浅普庵 12.5143832909
+在结构上 9.71102290995
+必然联系 10.604840786
+层层包围 11.9547675029
+不知自量 12.8020653633
+李长顺 13.900677652
+棚舍 13.2075304714
+通迅 12.8020653633
+通过 4.03447668423
+爵士乐团 13.900677652
+牒文 11.598092559
+从辰 11.4157710022
+通连 11.3357282945
+横跨 8.83808261895
+全日空 12.5143832909
+行政区划 8.45394028031
+赤豆粥 13.2075304714
+妙尼 10.1871055853
+凑够 11.0103058941
+通运 13.2075304714
+孔明谏 13.2075304714
+王萧绎 12.2912397395
+是古非今 13.900677652
+敌情 9.34680076038
+饭前 10.642581114
+原始性 11.1280889297
+没醉 12.1089181827
+袁大帅 11.598092559
+约翰福音 12.2912397395
+甲藻黄素 13.2075304714
+动力舱 10.2371160058
+李守中 13.2075304714
+当前工作 10.765183436
+平议 12.8020653633
+拷贝 9.65218240993
+满腹疑团 13.2075304714
+有大有小 10.533381822
+佼佼 13.900677652
+建恒 13.2075304714
+涉案人 13.2075304714
+三都澳 11.4157710022
+电烤箱 12.1089181827
+紫葳科 12.5143832909
+任镇南 13.2075304714
+平话 10.9049453784
+一分耕耘 13.900677652
+环礁 10.0294766411
+蔡确 12.1089181827
+亮底牌 10.4994802703
+忸怩作态 12.8020653633
+开赛 10.8561552143
+佳木斯大学 13.2075304714
+木窗 12.1089181827
+通辑 13.2075304714
+祛斑霜 13.2075304714
+钻天杨 12.8020653633
+排水口 12.5143832909
+大顺国 10.533381822
+内镜 11.0674643079
+青少年犯 13.2075304714
+遁世离群 13.900677652
+合称 7.96843246453
+通辽 10.642581114
+开走 9.5186510173
+开起 10.3453295905
+油漆味 12.8020653633
+邦戈 12.2912397395
+洗脸池 13.900677652
+王萧纪 12.8020653633
+许久方 13.2075304714
+施瓦辛格 12.2912397395
+见见 8.89673134603
+高元钧 12.2912397395
+管事人 11.8212361103
+近月来 12.8020653633
+文学奖 10.1394775363
+盐都 10.9562386728
+俗字 11.7034530746
+臭气 9.85762638414
+九片 13.900677652
+把握 6.50679936187
+红豆集团 13.2075304714
+奥弗涅 13.2075304714
+俗子 12.2912397395
+装进去 10.7226238216
+结焦 12.8020653633
+臭氧 9.65218240993
+益州刘 13.900677652
+侍臣奏 13.2075304714
+郑之珍 12.5143832909
+宋襄 12.8020653633
+通车 7.97909923233
+钱开宗 12.8020653633
+心回意转 13.900677652
+开足 11.9547675029
+言人人殊 13.900677652
+盗名欺世 13.2075304714
+花椰菜 11.2616203224
+十几棵 11.7034530746
+度人 11.5027823792
+毕克 13.900677652
+走味 13.2075304714
+欧美人 13.2075304714
+沃丁 12.5143832909
+河西区 12.8020653633
+助饷 12.5143832909
+不能允许 11.4157710022
+无孔不入 10.533381822
+横贯 8.14810501315
+确定性 8.092535162
+金属网 10.2117981979
+玄奘 9.14708746087
+王忠引 13.2075304714
+丁字形 11.7034530746
+横财 10.2897597393
+磁滞 11.3357282945
+随地吐痰 11.598092559
+青蓝紫 12.2912397395
+波斯尼亚 10.0720362555
+开路 8.98802276624
+承德县 12.1089181827
+没酒 12.8020653633
+贪污罪 10.765183436
+偎依 11.0674643079
+静静心 13.2075304714
+钻天柳 12.5143832909
+哪部 12.1089181827
+曲骨 13.2075304714
+玄女 10.642581114
+部副 9.16447920358
+课程计划 13.2075304714
+结点 11.1280889297
+乔老爷 13.900677652
+催乳素 12.1089181827
+磁漆 13.900677652
+盐酸 8.98069672615
+费纳喀 13.2075304714
+禁子 10.3743171274
+缚住 10.642581114
+数量型 10.3171587135
+困觉 13.900677652
+阿尔瓦拉多 12.8020653633
+转播站 13.900677652
+麦尼克 13.2075304714
+杭锦 12.8020653633
+牙周炎 12.2912397395
+夏腊 13.900677652
+别击伊 13.2075304714
+雁栖湖 12.8020653633
+木弓弩 13.2075304714
+黛绿 12.5143832909
+旱苗得雨 13.900677652
+禁得住 11.598092559
+文学士 10.4041700905
+二十三处 13.2075304714
+氯磺 13.2075304714
+柏培拉 12.8020653633
+寿康太 12.8020653633
+大屏幕 10.8561552143
+金属线 11.9547675029
+保加利亚共和国 13.2075304714
+荆河州 13.900677652
+土建 10.9562386728
+福州人 11.2616203224
+爬出去 10.8561552143
+开豁 11.8212361103
+曲鬓 12.8020653633
+马如龙 11.3357282945
+禅理 11.9547675029
+带宽 10.1630080337
+一官半职 10.8561552143
+西都宾 13.2075304714
+河西务 11.598092559
+北戴河 10.3171587135
+叱咤风云 10.3453295905
+管营相公 12.1089181827
+晨衣 12.8020653633
+子母船 12.5143832909
+不留情面 10.9049453784
+斯定会 12.5143832909
+从平阳 11.9547675029
+通身 10.1871055853
+普救寺 11.9547675029
+晚疫病 11.8212361103
+调焦 12.5143832909
+计量局 12.2912397395
+长尾病毒 13.900677652
+乱来 10.9562386728
+毋庸置言 13.900677652
+腻友 12.5143832909
+聊以塞责 12.8020653633
+氯碱 9.89334446674
+上同调群 13.2075304714
+破格晋升 13.2075304714
+女生 8.44963919841
+埃尔祖鲁 13.2075304714
+解溪 13.900677652
+龙津桥 12.8020653633
+动手动脚 10.4666904475
+古圣先贤 13.2075304714
+内资股 12.1089181827
+尊师 11.2616203224
+期约 10.6818018271
+心有灵犀一点通 11.598092559
+大厂回族自治县 12.8020653633
+热浪 10.1630080337
+夏至 9.7898037878
+神经管 10.4349417492
+永吉县 11.8212361103
+带子 9.36807815882
+嵩明县 11.5027823792
+杨杏接 13.2075304714
+韩翊 13.900677652
+有种乎 11.7034530746
+桑那浴 13.900677652
+带孝 11.8212361103
+捉拿犯人 13.2075304714
+凝乳酶 13.2075304714
+伏麒麟 13.2075304714
+机械运动 10.2117981979
+女用 11.4157710022
+办班 12.5143832909
+王彦章 11.598092559
+数据中心 10.3743171274
+通用型 10.8561552143
+没通 12.8020653633
+黄氏兄弟 11.7034530746
+随机化 13.900677652
+沃伊 12.1089181827
+由奢入俭 13.900677652
+回想到 12.2912397395
+横谷 11.598092559
+葱姜 12.1089181827
+空蒙雨 13.2075304714
+玛雅文 12.8020653633
+跨越式 9.18217878068
+爱人以德 13.2075304714
+城市之光 12.2912397395
+朱舟 13.2075304714
+顶吹 12.2912397395
+云冈石窟 10.9049453784
+快熟了 13.2075304714
+闪络 12.5143832909
+颜思烈 13.2075304714
+梁乾化 12.2912397395
+沃伯 13.900677652
+弗之微 11.8212361103
+敌意 9.49395840471
+姓字 11.4157710022
+沃伦 10.2371160058
+椭圆偏振 12.2912397395
+食管炎 12.1089181827
+剪字 13.900677652
+夏良 13.2075304714
+菜店 13.900677652
+送灶神 12.8020653633
+塔希提 11.1280889297
+活动主体 12.8020653633
+眼科学 12.5143832909
+胡若愚 13.2075304714
+母阔阔 12.8020653633
+乱搞 10.8561552143
+张学文 11.0674643079
+解溲 12.1089181827
+濒临灭绝 10.9049453784
+玄宗 9.11318590919
+引人深思 12.2912397395
+女皇 10.3453295905
+张学斌 11.1926274509
+庆云寺 12.2912397395
+指导老师 13.900677652
+通路 9.01787572939
+更添 10.9562386728
+厉山 13.2075304714
+不逃 11.5027823792
+摆放着 10.2117981979
+横运 13.900677652
+点鬼火 13.2075304714
+宋词 10.0294766411
+疲劳强度 10.9562386728
+出家人 9.03314320152
+宋诗 10.765183436
+笔下 9.36807815882
+台湾海洋 13.2075304714
+骆驼峰 13.900677652
+横过 10.8561552143
+毛毛山 12.5143832909
+吓跑 9.74179456862
+祖宗 7.61281909181
+闾丘 11.7034530746
+原作 9.82314020807
+黄连山 12.8020653633
+椴木 12.8020653633
+关键作用 9.89334446674
+赢利性 13.2075304714
+原体 11.1926274509
+原位 9.93038573842
+动态分析 11.8212361103
+锈住 12.2912397395
+欧阳溥存 13.2075304714
+谢旭人 9.96885201925
+宋论 12.5143832909
+纳罕 10.1630080337
+丁受田 13.2075304714
+魏王太子 13.900677652
+平视 10.0720362555
+撒网 11.3357282945
+开车 7.82993992397
+总路线 10.2897597393
+很多面 13.2075304714
+顺磁性 11.1280889297
+灵妙 13.900677652
+九点 9.85762638414
+琢玉 9.82314020807
+窒碍 13.2075304714
+中国残疾人联合会 12.8020653633
+乱坟岗 13.2075304714
+梁朝部 13.2075304714
+外勤人员 13.2075304714
+仁义之师 10.4994802703
+加工区 10.2630914922
+桂中 11.5027823792
+茅庵草 11.7034530746
+茶饭 9.72629038208
+待字闺中 12.2912397395
+建成 6.18377151668
+亚美利 12.8020653633
+触类而长 13.900677652
+升得 11.1926274509
+淋雨 11.4157710022
+皮光肉 13.900677652
+慈禧拿 12.5143832909
+横轴 11.0674643079
+唐初才 13.2075304714
+成本计算 11.9547675029
+樟脑 9.96885201925
+输了钱 11.9547675029
+继续前进 9.30555780184
+菜市 10.9049453784
+纂辑 11.1280889297
+轧花机 11.1926274509
+第四十三届 13.2075304714
+曲风 12.2912397395
+尊崇 9.21854642485
+开辟 7.0590621755
+沙湾县 13.2075304714
+通赤 13.900677652
+鸡饲料 13.2075304714
+裕华区 13.900677652
+敌手 9.5186510173
+拗陷 9.69598503258
+翠玉 11.5027823792
+闪闪烁烁 10.6818018271
+奥希金斯 12.2912397395
+慧观 12.8020653633
+唐初承 13.2075304714
+开达 13.900677652
+言声儿 12.2912397395
+呼韩邪 11.0674643079
+云屯雨 13.900677652
+晨读 12.8020653633
+晨课 13.2075304714
+开过 9.27570483869
+巴罗斯 12.5143832909
+加工厂 9.24671730182
+王定国 13.900677652
+开运 10.4666904475
+开近 12.1089181827
+周瑜闻 12.8020653633
+慈禧竟 13.2075304714
+德鲁特 12.8020653633
+玄孙 10.533381822
+开进 8.99540287354
+施托尔 13.2075304714
+雄蚁 12.8020653633
+曲颈 12.5143832909
+开远 10.4349417492
+斯行健 13.2075304714
+磁泡 12.2912397395
+盛甲 13.900677652
+平西 10.1164880181
+排水工程 11.3357282945
+拧成 11.0103058941
+玄学 9.35738286971
+春儿 13.900677652
+审判监督 11.4157710022
+宜昌橙 13.900677652
+通财 13.2075304714
+龙南县 12.8020653633
+保障金 9.98865464655
+绿春县 13.900677652
+巴基斯坦穆斯林联盟 13.2075304714
+安热罗 13.900677652
+敌我 8.84443184663
+通贵 12.2912397395
+果实累累 13.2075304714
+刘崇卒 12.8020653633
+受惊吓 11.5027823792
+拉迪奇 13.2075304714
+群策群力 11.8212361103
+阿尔泽 13.900677652
+升帐 10.1394775363
+阿尔泰 9.18217878068
+国际原子能机构 11.2616203224
+八项注意 10.9049453784
+慨然 9.7898037878
+奥黑尔 13.900677652
+升帆 13.2075304714
+特殊气味 10.9049453784
+参变量 12.8020653633
+妇道 11.5027823792
+阿尔波 13.2075304714
+劳苦大众 10.5684731418
+获最佳 10.604840786
+白门楼 11.9547675029
+影视剧 10.1630080337
+原主 11.0103058941
+原为 7.42370528909
+乱收 13.900677652
+谈话室 13.900677652
+口是心非 11.4157710022
+封赵王 12.5143832909
+海南航空公司 13.2075304714
+阿尔法 9.21854642485
+配套成龙 13.2075304714
+锻练 13.2075304714
+诸仙 11.7034530746
+薹菜 13.900677652
+第一分 12.8020653633
+日日春 13.900677652
+奥古斯塔 11.9547675029
+母寺 12.5143832909
+自由职业 12.1089181827
+乱支 13.900677652
+潴龙河 11.598092559
+柿饼 10.4666904475
+横躺 11.3357282945
+感染 6.81728980435
+吉塔 13.2075304714
+徐树兰 13.900677652
+学剑不成 13.900677652
+升幅 8.12923652885
+扎针 11.1926274509
+原义 10.765183436
+多亿亩 13.900677652
+夏茶 11.8212361103
+平装 13.900677652
+姓姚 12.5143832909
+升平 9.93038573842
+路轨 12.5143832909
+利福平 11.598092559
+笔体 13.900677652
+磁浮 12.1089181827
+伯克来 13.2075304714
+出人预料 11.9547675029
+枉费心思 13.2075304714
+口吐 10.0720362555
+车辆保养 12.5143832909
+原乡 11.9547675029
+走哇 11.598092559
+天文学史 11.9547675029
+善于引导 12.8020653633
+克己奉公 13.2075304714
+女真 8.39128931535
+丁字尺 13.900677652
+折回来 11.2616203224
+弹性硫 13.2075304714
+带好 11.7034530746
+不孝有三 11.8212361103
+第一列 11.598092559
+保留区 13.900677652
+占黎川 12.2912397395
+快速反应 9.17328983326
+六安县 12.8020653633
+文部大臣 11.598092559
+升序 13.900677652
+江自西 11.9547675029
+锈了 12.2912397395
+脚踏实地 10.1394775363
+原人 11.598092559
+板砖 11.8212361103
+摔了一跤 10.9049453784
+女眷 9.58318953844
+范镇 13.900677652
+阿尔汗 12.5143832909
+升座 11.1280889297
+金行 12.2912397395
+路边 7.61841090508
+原产 8.170577869
+原交 11.7034530746
+匍匐 9.22784881751
+朱英 13.2075304714
+培养箱 13.900677652
+带头 8.2985588311
+纤夫 10.8096351986
+通谊 13.2075304714
+虽能 10.5684731418
+排酸 13.2075304714
+保障部 12.2912397395
+曲香 13.900677652
+塔克萨 12.8020653633
+辛普森 11.4157710022
+原从 13.2075304714
+耕田 9.93038573842
+路远 10.1394775363
+顶嘴 10.6818018271
+身在其中 13.2075304714
+平衍 12.8020653633
+平行 7.34389929582
+客户部 11.7034530746
+通谕 11.8212361103
+真天子 12.5143832909
+计算机机房 13.900677652
+原任 11.3357282945
+城口县 13.900677652
+原价 9.74179456862
+原件 9.77354326693
+特任官 13.2075304714
+银熊奖 13.2075304714
+带够 13.900677652
+庶子 10.4994802703
+冯保朝 12.5143832909
+晓风 13.2075304714
+话剧表演 12.5143832909
+原以 10.2371160058
+通谷 13.2075304714
+原代 12.8020653633
+通谱 13.2075304714
+电脑屏幕 11.8212361103
+感悟 10.1871055853
+乱成 10.0720362555
+续修成 13.2075304714
+金丸信 13.2075304714
+广道抚 13.2075304714
+卜休 13.2075304714
+虚骄 12.2912397395
+概念分析 12.8020653633
+朱慈娘 13.2075304714
+洞口县 12.1089181827
+坊子 12.1089181827
+池中物 13.900677652
+曲院风 12.2912397395
+通话 9.00283785202
+平辈 11.2616203224
+令人注目 11.4157710022
+顶凶 13.900677652
+韩太大 11.598092559
+龙袍 9.48183704418
+尚弗勒 13.2075304714
+痛悔前非 13.900677652
+通译 12.2912397395
+结疤 12.5143832909
+计量学 10.604840786
+瓜德罗普岛 11.8212361103
+二三百里 11.9547675029
+金属管 11.0103058941
+氢氧化铝 11.598092559
+绕完 13.900677652
+汉末魏 12.2912397395
+强直性 11.7034530746
+阿尔比 11.3357282945
+东尼 13.900677652
+黄室韦 12.8020653633
+卜伦 12.8020653633
+俗念 12.8020653633
+三台山 12.2912397395
+通读 11.8212361103
+通说 12.8020653633
+氢氧化铁 12.1089181827
+杭逸 11.9547675029
+升天 9.53122979951
+中央处理 13.2075304714
+顶冠 11.9547675029
+乱打 9.61021821083
+乱扒 13.900677652
+反英 10.1871055853
+氢氧化钾 10.765183436
+逃不掉 11.3357282945
+平远 11.4157710022
+纤度 11.8212361103
+没门 11.0674643079
+德施仁 12.5143832909
+调理 9.12155415886
+臭棋 12.2912397395
+葱属 11.8212361103
+肠液 11.598092559
+枉费心机 12.1089181827
+九皇 12.8020653633
+警惕心 12.8020653633
+电磁阀 13.2075304714
+氢氧化钡 13.2075304714
+清明菜 13.900677652
+开襟 11.3357282945
+九皋 13.2075304714
+年画 9.04864738806
+通训 12.2912397395
+氢氧化钙 11.4157710022
+通讯 7.32699748502
+偏向角 13.2075304714
+湟水 9.43476953332
+感想 10.2897597393
+牙周病 11.1280889297
+顶冒 13.900677652
+招降纳叛 13.2075304714
+二十三层 12.2912397395
+通论 9.93038573842
+胳膊扭不过大腿 12.8020653633
+甘托克 12.5143832909
+结痂 10.765183436
+二十三届 12.5143832909
+乱扯 11.8212361103
+调琴 12.5143832909
+感思 13.2075304714
+姓常 12.8020653633
+顶入 12.8020653633
+股票指数 9.96885201925
+山恶岭 13.2075304714
+盐铺 12.2912397395
+刘陶任 12.8020653633
+孙文越 12.2912397395
+秦东向 12.2912397395
+法隆寺 12.1089181827
+一喊出 13.900677652
+倭瓜 11.7034530746
+肿瘤性 12.5143832909
+撕毁合同 13.2075304714
+感怀 10.7226238216
+政法部门 11.5027823792
+士女 11.5027823792
+北高峰 12.5143832909
+度日如年 10.6818018271
+慧远 10.9562386728
+使性子 11.8212361103
+矩形脉冲 13.900677652
+一个七岁 13.2075304714
+盐铁 9.53122979951
+民歌手 12.8020653633
+二十三岁 10.4994802703
+感性 9.21854642485
+葱岭 9.91169360541
+更正 9.53122979951
+整场戏 13.900677652
+利行 13.2075304714
+丁督师 11.7034530746
+杜勋原 13.2075304714
+纳顺 13.2075304714
+顾不过来 11.8212361103
+可选择性 12.8020653633
+带帽 13.2075304714
+社会意识 10.3171587135
+不知所指 13.2075304714
+贴出来 11.598092559
+卡尔米 13.2075304714
+带带 12.8020653633
+奥古斯德 13.900677652
+落落寡欢 13.900677652
+宁前兵 13.900677652
+廿五日 13.900677652
+顶儿 12.2912397395
+开解 12.2912397395
+大篷车队 13.900677652
+永安镇 12.2912397395
+贝器 12.8020653633
+范旭东 12.8020653633
+菲德尔 13.2075304714
+感恩 9.09665660724
+结界 13.2075304714
+进出口银行 11.598092559
+那么些 10.0720362555
+抽穗期 12.8020653633
+平车 12.1089181827
+黄崖关 12.8020653633
+更次 10.5684731418
+邦杰 13.900677652
+控制数据 11.8212361103
+清明节 9.72629038208
+寻水泉 13.900677652
+差远 12.8020653633
+老翁 10.4666904475
+板纸 11.8212361103
+樟蚕 12.8020653633
+瓦哈卡 12.2912397395
+赢回来 12.5143832909
+袅袅余音 13.2075304714
+样本分布 12.8020653633
+山光水色 11.8212361103
+多一事不如少一事 11.3357282945
+三万两万 13.2075304714
+犹能 12.2912397395
+升堂 10.9049453784
+少先队员 11.7034530746
+永平 8.97342396682
+月经过多 11.1926274509
+言不顺 11.5027823792
+科里亚 13.900677652
+平躺 11.1280889297
+戈尔丁 13.2075304714
+通用化 10.6818018271
+阿里斯托 12.8020653633
+青岛港 10.642581114
+易州定 12.8020653633
+傍午 13.900677652
+平身 10.0505300503
+瓦哈卜 12.5143832909
+翅儿 11.7034530746
+乱挤 12.1089181827
+小苏打 11.9547675029
+危城 11.598092559
+纤微 13.2075304714
+燕麦草 13.900677652
+玛丽雅 13.900677652
+塞卢斯 13.900677652
+孟福尔 12.5143832909
+很多遍 12.8020653633
+华纳公司 13.900677652
+改属 9.98865464655
+芝麻糊 13.900677652
+开行 10.642581114
+裒多益寡 13.900677652
+方针政策 9.44633035572
+芝麻糖 12.1089181827
+有问有答 12.1089181827
+建政 12.5143832909
+线性元件 13.2075304714
+拉什 11.1926274509
+海上保险 11.5027823792
+敌方 8.20023407859
+诸郡常 13.2075304714
+搓脚 13.2075304714
+调用 8.43684584695
+请示报告 13.2075304714
+热气 8.5440913773
+取保候审 10.6818018271
+开衩 11.3357282945
+板结 10.7226238216
+神经网 12.8020653633
+带往 11.0103058941
+加油机 9.69598503258
+终战国 13.2075304714
+近亲繁殖 11.7034530746
+欧委会 11.4157710022
+收敛剂 12.2912397395
+老母猪 12.1089181827
+数量化 10.0505300503
+割捆机 13.2075304714
+掸邦 11.3357282945
+禁忌 8.48903160012
+查理士 13.2075304714
+乱掉 13.900677652
+珠海市 10.1394775363
+中国茶叶博物馆 12.2912397395
+姓张 9.48183704418
+尊威 13.2075304714
+晚清时期 12.1089181827
+菜头 12.8020653633
+岱顶 13.900677652
+异地相逢 13.900677652
+横街 11.0103058941
+刷刷牙 13.2075304714
+横行 8.94485059437
+流变学 10.8096351986
+入味 11.2616203224
+氢氧化镍 12.5143832909
+感愧 11.8212361103
+乱推 13.900677652
+臭椿 11.3357282945
+感愤 11.5027823792
+菲仪 12.8020653633
+金山寺 10.6818018271
+开裂 9.00283785202
+缴款 8.88339781516
+乐得嘴 13.2075304714
+法律认可 12.5143832909
+开裆 13.900677652
+宋谦 13.2075304714
+禁律 13.2075304714
+熊友兰 13.900677652
+玩具枪 12.8020653633
+菲亚 12.5143832909
+表现出色 9.38981814546
+随手 8.0285598625
+行政区域 9.46986085313
+建新 9.18217878068
+处分权 12.5143832909
+纤弱 10.6818018271
+斑蝥素 13.2075304714
+祖家 12.1089181827
+德治国 13.2075304714
+带引 11.598092559
+日本大学 12.2912397395
+九眼 13.900677652
+厉害 6.92432958153
+建文 9.80633308975
+谷大用 11.7034530746
+感慰 13.900677652
+带开 13.2075304714
+佛口蛇心 13.900677652
+丫头 7.61281909181
+说笑声 12.1089181827
+乘龙佳婿 13.900677652
+高君宇 12.5143832909
+带式 10.9049453784
+家庭和睦 12.1089181827
+山西省晋中地区 11.7034530746
+来健妇 12.2912397395
+感抗 13.2075304714
+无税 11.7034530746
+发射能力 13.900677652
+捻线 13.900677652
+日益加剧 10.3453295905
+马如飞 12.2912397395
+由谁来 9.93038573842
+平越 12.2912397395
+顶叶 12.1089181827
+振兴中华 11.1926274509
+发水 11.5027823792
+玄微 11.9547675029
+车载式 11.2616203224
+故意犯罪 13.900677652
+平足 12.5143832909
+冯玉祥 9.03314320152
+富比 12.8020653633
+通解 11.7034530746
+绚丽 9.07236391467
+女犯 12.8020653633
+乱性 12.1089181827
+六法全书 12.1089181827
+杜勋入 13.2075304714
+精心培养 12.1089181827
+音乐性 11.1280889297
+容小可 13.2075304714
+评头论足 12.1089181827
+二十三年 8.65365357982
+门电路 11.7034530746
+因人施教 13.2075304714
+排成一列 11.3357282945
+结石 9.23723855786
+建春 10.7226238216
+表里不一 12.8020653633
+耕耘机 13.2075304714
+尊姓 12.2912397395
+九万三千九百九十多公里 13.2075304714
+泥雕 13.2075304714
+诺诺连声 11.4157710022
+黄丝桥 12.8020653633
+希求 11.0103058941
+柚子 10.4994802703
+宋达 13.2075304714
+宋辽 10.9049453784
+低倍 12.8020653633
+建昌 10.4666904475
+建明 13.900677652
+偷出去 12.8020653633
+一拥而上 10.0088573539
+中国地质科学院 13.2075304714
+断裂带 9.13850371718
+直译式 13.900677652
+林姐姐 11.5027823792
+盐阜 12.5143832909
+升学 10.2897597393
+陆军军官 10.1871055853
+友邦保险 9.87532596124
+亨森 13.2075304714
+藉此 11.1280889297
+充其量 9.4233408375
+计划单列 12.5143832909
+二十余万平方公里 13.2075304714
+玉泉营 13.2075304714
+直言无讳 13.900677652
+扯帆 13.900677652
+慈善机构 11.1926274509
+几何异构 11.5027823792
+王雄渠 12.1089181827
+佐使 12.8020653633
+升官 9.48183704418
+顶向下 13.2075304714
+卢沟河 12.1089181827
+吴升见 12.2912397395
+林浩 12.1089181827
+电磁铁 10.4994802703
+廿五 12.2912397395
+铁山 11.2616203224
+机械能 9.53122979951
+排泄器官 11.598092559
+顶升 13.2075304714
+硕大无比 11.3357282945
+厉声 7.9526426628
+普罗夫迪夫 12.2912397395
+开议 11.1926274509
+公侯伯 11.5027823792
+开讲 10.765183436
+新闻纵横 11.0103058941
+调相 11.8212361103
+王宏志 12.5143832909
+发挥出来 11.4157710022
+开设 7.53249046563
+腻味 10.8096351986
+梦粱 11.9547675029
+雷尼克 13.2075304714
+唐物茶 12.8020653633
+神经系 13.2075304714
+开诊 13.900677652
+倚靠着 12.5143832909
+湟源 11.598092559
+南锣鼓巷 13.900677652
+中央政法委员会 12.2912397395
+磁棒 13.2075304714
+尊奉 10.0294766411
+发酵粉 12.8020653633
+鱼复山 13.2075304714
+佐伯 13.2075304714
+发气 13.900677652
+纤小 11.9547675029
+乱想 11.9547675029
+闭户读书 13.2075304714
+调皮 8.58747167293
+河图洛书 12.1089181827
+平起 12.5143832909
+时载淳 12.8020653633
+平方和 11.8212361103
+江亢虎 13.2075304714
+国际级 10.9562386728
+伯克拥 13.2075304714
+纤尘 12.5143832909
+富加德 12.8020653633
+沂蒙山区 11.598092559
+大势已去 9.56994431169
+商业性 9.65218240993
+侵害人 12.2912397395
+石竹 11.0674643079
+开言 10.3453295905
+百部碱 13.900677652
+音乐感 11.9547675029
+施托姆 12.5143832909
+纤巧 11.1280889297
+针尖对麦芒 12.2912397395
+调着 13.900677652
+丰壤 13.900677652
+贺龙部 12.8020653633
+郏县 11.0103058941
+盖里克 13.900677652
+侍传奏 12.8020653633
+氨甲蝶呤 13.2075304714
+玄应 12.1089181827
+袁大头 11.5027823792
+高嵌体 13.900677652
+肺炎球菌 11.1926274509
+杨林引 13.2075304714
+油漆匠 12.5143832909
+四六分 11.8212361103
+杨玄感 11.0103058941
+马欢岛 12.2912397395
+红松林 12.1089181827
+深圳华侨城 13.2075304714
+变色镜 12.5143832909
+三年五载 11.5027823792
+格莱特 12.8020653633
+封大官 13.900677652
+困迫 12.8020653633
+食管癌 11.0103058941
+建材 7.09717239437
+案秤 13.2075304714
+引吭高歌 11.5027823792
+狼虫虎豹 11.598092559
+热汤 11.0103058941
+赵郡李 13.2075304714
+萧特末 13.2075304714
+信息隐蔽 13.900677652
+私船 13.2075304714
+柳五儿 12.8020653633
+宾主尽欢 13.2075304714
+子昭王 13.2075304714
+李树青 12.8020653633
+王权神 12.8020653633
+结盟 8.74162235276
+建有 6.96725462625
+石纤 13.2075304714
+沙僧取 13.900677652
+无规噪声 13.2075304714
+路警 12.8020653633
+盐霜 12.2912397395
+鬼王 10.9562386728
+玉三踅 13.900677652
+获致 11.3357282945
+王绍禹 10.9562386728
+操自勒 13.2075304714
+旷野 9.01787572939
+蒽醌 11.4157710022
+大雨天 13.2075304714
+通行 7.46452728361
+忽然 5.56788818356
+油漆厂 13.2075304714
+纳瓦兹 13.900677652
+王处一 12.2912397395
+冲过去 9.74179456862
+卷袖 13.900677652
+一百四五十 12.2912397395
+扯开 9.35738286971
+形似 8.22050504296
+丫子 12.8020653633
+衰变常数 11.9547675029
+第一六三 13.900677652
+原始林 11.1280889297
+平调 11.598092559
+保留地 10.642581114
+环绕 8.03138073884
+智能建筑 11.9547675029
+引经据古 12.8020653633
+结瘤 13.900677652
+柏树林 11.9547675029
+曾登宝 12.8020653633
+堆下 11.0103058941
+香积 13.2075304714
+陶里斯 13.2075304714
+稚虫 11.5027823792
+矽卡岩 11.598092559
+能被通过 13.900677652
+麦尼埃 13.2075304714
+憋屈 11.8212361103
+平谷 11.4157710022
+通衡 13.900677652
+通衢 10.2897597393
+难民署 12.1089181827
+陆战 9.62401153296
+眼浅 13.900677652
+针织物 12.1089181827
+哈弗尔 12.8020653633
+金属硅 13.2075304714
+被打乱 11.1280889297
+菲律宾人 11.2616203224
+菜子 11.598092559
+周瑜部 12.5143832909
+常规裁军 13.900677652
+公侯之 12.5143832909
+顶到 11.0674643079
+任克礼 13.900677652
+远谋 13.2075304714
+谈话录 12.5143832909
+寡人 9.27570483869
+敌机 8.63798746307
+艾哈迈 12.2912397395
+邦斯 12.8020653633
+排量 8.64318227995
+九田 12.8020653633
+工作液 12.8020653633
+柳江人 11.1280889297
+矫顽力 11.1926274509
+贾母方 12.1089181827
+王旭烈 13.2075304714
+环线 9.41204128224
+立陶宛语 11.8212361103
+玄幻 12.5143832909
+环纹 10.604840786
+齐齐尔 13.2075304714
+贩私 11.3357282945
+蔡翘 13.2075304714
+驰名中外 8.98802276624
+臭死 11.7034530746
+宋臣 13.2075304714
+警察厅 12.2912397395
+沪综指 8.58255765813
+加丹加省 13.2075304714
+静静地 7.93197009199
+十二门 11.1280889297
+一七 12.8020653633
+是非自有公论 13.900677652
+建桥 10.8096351986
+夏衣 12.5143832909
+建档 11.0674643079
+跃进桥 13.2075304714
+美国普林斯顿大学 11.0674643079
+谢率兵 13.2075304714
+中央政治局常委 9.53122979951
+安帝义 13.900677652
+朱格朱 13.900677652
+肖下唇 10.9562386728
+变形缝 13.2075304714
+夏衍 10.3453295905
+才气 10.8096351986
+全量表 13.2075304714
+胡蒂拉 13.2075304714
+玄冥 12.5143832909
+知识化 11.9547675029
+含鄱口 13.2075304714
+一上 9.46986085313
+齐齐发 13.900677652
+九章 9.94943393339
+于先帝 13.2075304714
+撒泼耍赖 13.2075304714
+玄冰 12.1089181827
+通融 9.93038573842
+带劲 11.2616203224
+一三 11.4157710022
+简装版 13.2075304714
+国家杰出青年基金 13.2075304714
+衰神 12.5143832909
+圣迭戈市 13.2075304714
+内斯尔 13.900677652
+建校 10.4994802703
+壁虎 9.96885201925
+豇豆 10.4994802703
+走唱 13.900677652
+办税 12.1089181827
+挂职锻炼 12.5143832909
+九窍 11.2616203224
+平菇 11.4157710022
+玉渊潭 11.1280889297
+示意图 9.48183704418
+调研 7.24010250214
+行唐县 12.8020653633
+死也瞑目 11.7034530746
+赋格曲 12.1089181827
+刘宗敏 6.89488863272
+春煊 13.900677652
+既得利益者 11.1280889297
+人工孵化 12.8020653633
+卞急 13.900677652
+壁虱 12.8020653633
+金山嘴 12.2912397395
+蛴螬 11.5027823792
+吸顶灯 11.5027823792
+禁制 10.9049453784
+假球 9.31571017331
+短小精悍 11.0103058941
+闪着 9.01787572939
+波立特 13.2075304714
+康平县 13.900677652
+四小龙 11.3357282945
+乱源 12.2912397395
+五十九厘米 13.2075304714
+结社 9.61021821083
+迟迟疑疑 9.82314020807
+矿井口 12.5143832909
+高丽族 13.900677652
+推回来 12.8020653633
+大海子 12.1089181827
+肘子 10.9049453784
+菜名 12.1089181827
+扯倒 12.8020653633
+泥洹 12.2912397395
+如梦初醒 10.1164880181
+赫拉特 10.642581114
+姓刘 9.77354326693
+格拉斯哥 10.0720362555
+夏装 11.8212361103
+西临 9.49395840471
+慷慨仗义 12.8020653633
+桓石 12.5143832909
+发生意外 10.0720362555
+磁暴 10.765183436
+认知失调 13.2075304714
+急忙忙 13.2075304714
+交割日 11.7034530746
+崔子忠 12.2912397395
+带到 7.67216664838
+虽说 7.48231271604
+满面笑容 10.765183436
+阿杜瓦 12.1089181827
+稍候片刻 11.3357282945
+带刺 10.6818018271
+纪程 11.9547675029
+没饭 10.4041700905
+不务正业 10.7226238216
+闪石 11.1280889297
+叮当声 13.2075304714
+忧伤 8.89004235788
+簪缨 11.0674643079
+金晃晃 13.2075304714
+切肤之痛 11.4157710022
+共生矿 11.7034530746
+秋水盈盈 13.900677652
+黛眉 12.8020653633
+王孝迪 10.8096351986
+捻灭 13.900677652
+阮章竞 12.5143832909
+三角叶杨 13.900677652
+诸郡县 11.9547675029
+首五 13.2075304714
+商业港 13.900677652
+商君书 11.7034530746
+马卡良 12.1089181827
+奶娘 9.91169360541
+夹枪带棒 12.1089181827
+拐弯抹角 10.4041700905
+七月份 11.0674643079
+珠海 8.40761620864
+郝梦笔 13.2075304714
+布鲁日 12.2912397395
+杜诗名 13.2075304714
+板状 9.48183704418
+十二铢 12.2912397395
+促脉 11.9547675029
+顶峰 8.4980002701
+九篇 11.8212361103
+风流韵事 11.5027823792
+嘶嘶 11.0103058941
+回见 9.31571017331
+初权臣 12.5143832909
+更替 8.99540287354
+西埔湾 12.8020653633
+退给 11.1926274509
+叼走 12.1089181827
+银锞子 11.9547675029
+企业管理者 11.8212361103
+禁卫 10.8561552143
+基底膜 11.598092559
+曹营分 12.8020653633
+任检校 13.2075304714
+维修性 12.1089181827
+短线交易 9.89334446674
+施子 12.8020653633
+捻熄 13.900677652
+李斯德 13.900677652
+上海人民出版社 9.72629038208
+庶几 10.2371160058
+美国化学会 12.5143832909
+无限感激 12.2912397395
+水旱轮作 11.8212361103
+项奴儿 13.2075304714
+堵不如疏 12.1089181827
+飚升 11.9547675029
+胡传揆 13.2075304714
+党八股 11.9547675029
+别无他法 11.0674643079
+中国农学会 13.2075304714
+聚酯树脂 11.598092559
+苯丙酮 11.1926274509
+垦荒地 10.3743171274
+随州市 11.3357282945
+庶出 11.4157710022
+磁条 12.2912397395
+人影儿 10.765183436
+俗务 11.0103058941
+盖世英雄 11.5027823792
+有知 10.3171587135
+榕树 9.84023464143
+胶质瘤 13.900677652
+体位 10.1164880181
+顶岗 12.5143832909
+十二钗 11.1280889297
+禁区 9.77354326693
+伽师 13.2075304714
+巡更 12.1089181827
+磁极 10.4041700905
+犹豫 7.17564400981
+更晚 11.2616203224
+慧英 8.03989142851
+利乌斯 11.1926274509
+成绩排名 12.5143832909
+黄芽 12.2912397395
+蛮高 13.2075304714
+不足为奇 9.55687223012
+平面镜 11.7034530746
+平舌 13.900677652
+磷酸肌醇 13.900677652
+无数只 11.3357282945
+亟待 9.25628675283
+平方寸 13.2075304714
+九等 11.7034530746
+平舆 11.8212361103
+入厨 13.900677652
+克什米尔 9.38981814546
+寄居蟹 10.9562386728
+顶层 10.0720362555
+濒危种 13.900677652
+宪法学 12.1089181827
+支炉 13.900677652
+十运会 12.8020653633
+棋盘式 11.7034530746
+聚餐 10.3743171274
+阿马杜 13.2075304714
+面杖 13.2075304714
+惮烦 13.900677652
+林务局 13.900677652
+体例 8.83177344976
+电气化 9.30555780184
+关门主义 12.2912397395
+夏尔凡 12.5143832909
+环烷 13.2075304714
+敖德萨 10.5684731418
+乌呼鲁 13.2075304714
+无数双 12.1089181827
+开开心 12.8020653633
+中知 13.2075304714
+开基创业 11.8212361103
+子禹 13.2075304714
+忖量 13.2075304714
+更易 9.19114745066
+罗斯托夫州 13.2075304714
+美国联邦 9.35738286971
+猫和老鼠 13.900677652
+没顶 11.7034530746
+慧芬 13.2075304714
+两性霉素 13.2075304714
+断脚 13.900677652
+更显 9.4233408375
+程序变换 13.2075304714
+软着陆 11.0674643079
+腻子 13.900677652
+昨天下午 8.60737282725
+板牙 11.4157710022
+贰心 12.5143832909
+写字板 12.8020653633
+第二十九章 10.7226238216
+胁迫 9.03314320152
+自卫军 10.3743171274
+调离 9.69598503258
+更是 5.83761474065
+可贺 11.2616203224
+顶尖 8.89673134603
+卢森堡 9.0884932966
+单声道 13.900677652
+髭须 10.642581114
+乱民 10.765183436
+庶务 11.2616203224
+仪鸾 12.5143832909
+棉丝 13.900677652
+王应龙 13.2075304714
+脏物 10.9562386728
+浴血奋战 10.4666904475
+玄历 13.900677652
+闪电 8.28754954559
+蓄水池 10.4041700905
+第二招 12.2912397395
+专卖权 11.8212361103
+绵竹县 13.2075304714
+开拓精神 12.1089181827
+普通卡 13.2075304714
+于河东 13.2075304714
+第二段 11.0103058941
+扑下去 13.2075304714
+国际版 10.8096351986
+锡尔特 13.900677652
+声誉 8.0484751722
+德布林 13.2075304714
+扯动 10.8561552143
+文学史 8.53470163695
+爬墙虎 11.9547675029
+惊魂失魄 13.900677652
+结算 7.04211261718
+基底节 12.5143832909
+菲德勒 13.900677652
+东渡港 12.2912397395
+叶绿素 9.49395840471
+贝克 9.66657114738
+刘崇官 12.8020653633
+更早 9.35738286971
+女红 11.1926274509
+后庭姬 12.8020653633
+升在 13.2075304714
+房地产商 9.59661255877
+婢女 10.3453295905
+初露头角 11.598092559
+解潜 13.900677652
+玄参 11.0103058941
+建模 10.8096351986
+大禅林 12.8020653633
+朱二人 12.1089181827
+朝庭 12.5143832909
+蔡牵 12.5143832909
+可辩论 13.2075304714
+一书 7.30763311783
+史蒂文森 12.5143832909
+一周岁 12.2912397395
+货币流 10.9049453784
+革命党人 9.66657114738
+更新 6.65573610564
+夏言 10.6818018271
+解深密 12.1089181827
+染色体 8.17382990439
+后过 11.2616203224
+新形势下 9.80633308975
+搔首弄姿 12.1089181827
+硕大无朋 12.8020653633
+大壮 12.2912397395
+菜园 9.89334446674
+鬼名堂 10.9562386728
+阿尔文 11.598092559
+罗兰德 12.2912397395
+大昭寺 10.7226238216
+藜芦 12.8020653633
+士林中 10.6818018271
+十二面 11.5027823792
+城东路 11.0674643079
+害人不浅 12.5143832909
+万笏朝 13.2075304714
+首尾夹攻 13.2075304714
+吉多 12.1089181827
+惊诧不已 11.7034530746
+铭感 12.5143832909
+衣象奴 13.2075304714
+恭恭敬敬 9.01787572939
+顾秀莲 13.2075304714
+浔江 10.4994802703
+董遇注 13.2075304714
+修持者 13.2075304714
+油腔 13.900677652
+嘶喊 11.4157710022
+盖斯凯 11.9547675029
+二百六十 12.5143832909
+自生自灭 10.6818018271
+就职仪式 13.2075304714
+苹果皮 12.5143832909
+神经炎 10.642581114
+膀胱 8.79473217808
+张学津 13.900677652
+钟表厂 13.2075304714
+感温 11.9547675029
+超低价 11.4157710022
+皮木柜 13.900677652
+秧歌 9.65218240993
+南溪李 13.2075304714
+吉隆滩 12.2912397395
+穆巴拉克 11.2616203224
+品种齐全 10.3453295905
+呈酸性 11.2616203224
+春小麦 9.65218240993
+真伪莫辨 13.2075304714
+刻毒 10.604840786
+眷恋着 12.8020653633
+袁大哥 13.900677652
+黎圣宗 12.8020653633
+决策制定 12.8020653633
+预备立宪 10.2897597393
+唬住 10.6818018271
+社团活动 12.2912397395
+棋盘山 12.2912397395
+齐齐儿 12.5143832909
+卡尔特 13.2075304714
+环环 11.7034530746
+贾平凹 12.8020653633
+导弹艇 10.4666904475
+方言学 11.8212361103
+更改 8.56795885871
+波形发生器 13.900677652
+纳瓦尔 11.2616203224
+小孙女 11.8212361103
+棉价 10.765183436
+承船厢 13.2075304714
+有点痛 11.8212361103
+陶唐氏 11.3357282945
+黄口小儿 12.2912397395
+刘文金 12.2912397395
+华容区 13.900677652
+两万余名 13.900677652
+北高南 9.27570483869
+猾贼 13.900677652
+平肝 11.1280889297
+建武 9.32596667347
+仁风 13.900677652
+胸甲 12.2912397395
+宋英 11.8212361103
+刻意追求 10.9049453784
+肠激酶 13.2075304714
+驾校 12.2912397395
+九种 11.0103058941
+嘶吼 12.8020653633
+慧聪 13.900677652
+那小沙弥 13.2075304714
+物各有主 13.2075304714
+切割成 10.2630914922
+高开冲 12.8020653633
+利达 10.9049453784
+卡尔王 13.900677652
+没骑 13.900677652
+禁兵 10.7226238216
+侵略军 8.98802276624
+不讲方法 13.900677652
+半周 10.0294766411
+关沉伏 13.900677652
+塔维亚尼 13.2075304714
+闹出去 12.2912397395
+泊秦淮 13.2075304714
+来龙去脉 9.34680076038
+陈睦 12.1089181827
+不可胜纪 13.900677652
+乱流 9.55687223012
+库斯塔奈 13.900677652
+三穗 13.2075304714
+调笑 10.3171587135
+越西 11.9547675029
+感激 7.45495783259
+板烟 13.900677652
+竹杠 12.1089181827
+平胸 11.4157710022
+陶西平 13.900677652
+奶妈 10.0088573539
+廿一枝 13.900677652
+信达资产管理公司 11.598092559
+星殿前 12.8020653633
+东郊 8.89004235788
+一个七十 13.900677652
+责任事故 12.2912397395
+二十三十 12.8020653633
+对准目标 12.1089181827
+众所周知 8.58255765813
+堂兄妹 13.2075304714
+王云五 11.0103058941
+傅母 13.2075304714
+带兵 8.80081122415
+斯达舒 13.900677652
+西塔尔 11.9547675029
+慧能 11.3357282945
+简谐运动 12.2912397395
+全无心肝 12.8020653633
+阿尔摩 12.1089181827
+乱涂 13.2075304714
+带入 9.11318590919
+奶奶 7.06120121375
+一些 4.03515160573
+沣河 10.5684731418
+雷尼尔 13.2075304714
+晓邦 13.900677652
+牡鹿 12.1089181827
+加冕礼 12.2912397395
+服务器软件 13.900677652
+集中统一 10.2630914922
+第三人称 11.8212361103
+菜地 9.96885201925
+安定性 11.3357282945
+菜场 11.2616203224
+魏克拉玛 13.2075304714
+陈玉和 11.9547675029
+詹光笑 13.900677652
+夏诚 12.5143832909
+由上至下 11.8212361103
+乱涨 13.2075304714
+相互作用 7.42678695562
+卫军 11.4157710022
+杨柳枝 11.1926274509
+懒猴 11.0103058941
+夏训 13.2075304714
+烧香磕头 11.598092559
+天文学家 8.29487558568
+大市镇 13.900677652
+和嘉和 10.8096351986
+丘王 13.900677652
+平方英尺 12.2912397395
+带儿 11.9547675029
+谢金德 13.2075304714
+陈胜吴广 12.5143832909
+集约型 11.1926274509
+百一十万 13.2075304714
+献金 12.2912397395
+禁军 8.91707103027
+懒猪 13.900677652
+李处温 9.59661255877
+尊命 11.9547675029
+案由 11.9547675029
+结穗 13.900677652
+三氧化二铁 11.3357282945
+王致和 12.5143832909
+嘶哑 9.12999302751
+呼风唤雨 9.71102290995
+发红包 11.7034530746
+环状 8.66423568915
+全班学生 13.2075304714
+保留字 12.5143832909
+火井 13.2075304714
+贺长龄 13.2075304714
+红其拉甫 12.5143832909
+草莽英雄 10.6818018271
+浑然不觉 10.4666904475
+下乡 7.86759143018
+平方英寸 13.2075304714
+蔡琰 11.9547675029
+带团 11.7034530746
+查理六 11.5027823792
+合法经营 11.8212361103
+下书 9.65218240993
+十二里 13.900677652
+十二重 13.2075304714
+龙船花 13.2075304714
+晓霞 8.15767446417
+小方块 12.5143832909
+辛普朗 12.2912397395
+江城子 12.8020653633
+金属环 12.8020653633
+逆转录 11.5027823792
+受援国 11.2616203224
+带回 8.19689517732
+冀察 10.8096351986
+调类 13.2075304714
+馅饼 9.75754292558
+开脱 9.56994431169
+子虚赋 11.9547675029
+六十一岁 12.8020653633
+空晶石 12.8020653633
+阿马拉 13.2075304714
+开脸 12.1089181827
+正中间 10.0294766411
+汇寄 13.2075304714
+傅氏 12.8020653633
+龈成形术 13.900677652
+从慧梅 11.7034530746
+曲阜 9.63799777493
+戴文赛 12.8020653633
+季亚科 13.2075304714
+板石 12.8020653633
+肠断 11.598092559
+侵略国 12.2912397395
+单姓吕 13.900677652
+法律界 10.604840786
+开腔 10.9049453784
+张中宝 13.900677652
+建水 10.9049453784
+武帝纪 12.5143832909
+落花有意 12.8020653633
+林学家 11.1926274509
+三十六万镑 13.2075304714
+蔡瑁 10.4349417492
+晓静 13.2075304714
+曲阳 10.4041700905
+柏姆 12.8020653633
+九线 11.4157710022
+曲阿 11.4157710022
+一亿 10.604840786
+拿住 9.36807815882
+九级 10.5684731418
+扶帝 12.8020653633
+案犯 11.2616203224
+刘文静 12.8020653633
+系统阐述 10.4666904475
+开腹 12.1089181827
+梅尔斯 13.900677652
+靳杖子 12.8020653633
+尊口 12.8020653633
+板眼 11.1926274509
+通草 11.598092559
+水之秀 13.900677652
+外祖父 9.48183704418
+办结 11.0674643079
+闪现 9.07236391467
+六千名 12.8020653633
+阿尔捷 13.2075304714
+颗粒化 13.900677652
+曲集 11.7034530746
+气势磅礴 9.77354326693
+吴为常 13.2075304714
+案牍 11.1926274509
+加快步伐 11.0103058941
+投递局 13.900677652
+鼠窃狗盗 12.8020653633
+情深如海 12.8020653633
+伸懒腰 11.3357282945
+丁加奴 11.7034530746
+翰藻 13.900677652
+熟门熟路 11.1926274509
+盛筵 12.5143832909
+辛卯日 13.900677652
+公先王 12.2912397395
+硃批 13.900677652
+知识型 13.2075304714
+车加言 13.2075304714
+白藜芦醇 12.5143832909
+盐铁部 13.900677652
+建法 13.2075304714
+更换 7.44233936863
+国将不国 12.8020653633
+助长 8.83808261895
+君主制 9.19114745066
+单行道 12.5143832909
+嘶叫 10.4666904475
+尊卑 9.54396882529
+张侍立 12.5143832909
+兴宁市 13.2075304714
+顶头 10.4041700905
+医方 11.1280889297
+古典主义 9.35738286971
+公开化 10.9049453784
+千八百 11.7034530746
+国家专利 11.4157710022
+建河 12.8020653633
+肘弯 11.0674643079
+国家科委 10.604840786
+黄花菜 10.0088573539
+升出 12.2912397395
+项目名称 11.0674643079
+骆驼刺 11.1926274509
+玩票性质 13.900677652
+张学武 12.5143832909
+顶多 8.62767809341
+讲演术 13.900677652
+合拍 10.0294766411
+阿塞西 13.2075304714
+往下面 12.8020653633
+转载自 9.17328983326
+安徽省立医院 13.900677652
+跨上去 12.5143832909
+十二部 13.2075304714
+恰当 8.19356738723
+晓阳 11.9547675029
+菜农 10.5684731418
+仁义之兵 13.2075304714
+皇甫嵩 11.2616203224
+板皮 10.604840786
+蔡申 13.2075304714
+锻烧 13.2075304714
+拿个 9.89334446674
+赶时髦 11.1926274509
+危亡之秋 13.2075304714
+社区卫生 10.1630080337
+人烟稠密 10.9562386728
+火药库 11.8212361103
+反射光栅 13.900677652
+榕江 11.0674643079
+柿霜 13.2075304714
+象不象 12.5143832909
+于谦击 12.8020653633
+升值 6.44653657383
+照常上班 13.2075304714
+贪污犯 11.8212361103
+办罪 13.900677652
+盛章 12.5143832909
+拿下 8.31718134319
+池中筑 13.2075304714
+绿莹莹 10.7226238216
+博伊德 12.8020653633
+闪爆 13.900677652
+马克图姆 11.1280889297
+塞内加 11.9547675029
+三千五百七十九卷 13.2075304714
+资金积累 13.2075304714
+夏在汉 12.8020653633
+淋浴间 13.900677652
+环球 7.66626692626
+卷装 12.2912397395
+锻炼 7.74581955796
+柳叶菜 12.8020653633
+坐化 11.7034530746
+薛先生 12.1089181827
+一屁股债 13.2075304714
+睡眼惺忪 11.4157710022
+曲霉 10.8561552143
+电棍 13.2075304714
+蔡畅 12.5143832909
+通用字 12.5143832909
+鸡尾酒会 12.1089181827
+花大钱 12.8020653633
+拖下来 11.4157710022
+禁地 9.98865464655
+平蛮 11.9547675029
+锻炉 12.5143832909
+带型 12.5143832909
+金山区 11.7034530746
+拿人 11.3357282945
+玉海集 12.5143832909
+禁城 11.4157710022
+坐不安席 13.900677652
+马皇后 12.1089181827
+大本钟 13.900677652
+蚍蜉撼大树 13.900677652
+获能 12.8020653633
+停战协定 9.28555713513
+阿尔托 11.4157710022
+曲韵 13.2075304714
+一条心 10.0505300503
+拿些 10.2897597393
+金山口 11.4157710022
+康科德 11.4157710022
+松迪亚 11.8212361103
+濒河 12.2912397395
+对流云 11.7034530746
+真功夫 10.9562386728
+歉收 10.0088573539
+顶塔 13.900677652
+限电 12.8020653633
+弭兵之会 12.8020653633
+高尔夫球 10.5684731418
+十二道 11.598092559
+带坏 11.0674643079
+百色起义 11.8212361103
+开胃 10.4994802703
+金属片 11.5027823792
+颗粒剂 11.598092559
+晓雾 11.3357282945
+结籽 11.7034530746
+石继芳 13.2075304714
+反季节 11.1926274509
+厉厉 13.900677652
+晓雪 13.2075304714
+胡尔维 13.2075304714
+晓雨 12.8020653633
+商军前 13.2075304714
+品相 11.2616203224
+堂兄弟 10.3171587135
+两半个 12.2912397395
+横度 13.900677652
+机械论 11.2616203224
+绫罗绸缎 10.4041700905
+通航 7.62215622781
+夏超 11.9547675029
+亲密无间 10.533381822
+金属物 12.8020653633
+阿尔戈 12.8020653633
+捶鼓 13.900677652
+变色龙 11.1280889297
+金山县 11.4157710022
+异类 10.3453295905
+高中学生 12.1089181827
+热地 13.900677652
+铭文 8.38724890581
+德令哈 11.3357282945
+专欲难成 13.2075304714
+维修期 13.2075304714
+杰瑞 13.2075304714
+环着 11.9547675029
+遮起来 13.900677652
+购房款 11.598092559
+下为 9.93038573842
+卢日支 12.5143832909
+问倒 12.8020653633
+卢字母 12.5143832909
+黄腔 12.8020653633
+检察业务 12.8020653633
+磁性 8.71889410168
+火流星 12.2912397395
+家庭装 13.900677652
+武毅谋 12.8020653633
+机械表 11.5027823792
+杂技团 10.9049453784
+新高潮 10.4994802703
+山额真 10.2371160058
+查理十 11.0103058941
+建湖 12.1089181827
+焦菊隐 11.7034530746
+底栖生物 10.8561552143
+仪驾 12.5143832909
+白家疃 12.8020653633
+桑白皮 12.5143832909
+铭旌 13.2075304714
+瑰伟 12.8020653633
+开荒 9.56994431169
+国产车 11.1280889297
+二七路 11.2616203224
+一伍 11.5027823792
+王俊生 13.900677652
+飘流 11.3357282945
+准信儿 13.900677652
+米希依 12.8020653633
+朱耷 10.7226238216
+开荤 11.8212361103
+小酥鱼 13.900677652
+方至圣 12.5143832909
+崔夫人 13.900677652
+开药 11.5027823792
+暧昧关系 11.7034530746
+有益 7.91926344072
+分析测试 11.8212361103
+林务官 13.2075304714
+何家劲 13.900677652
+梁末 12.8020653633
+女童 10.1630080337
+一池春水 12.5143832909
+全祖望 12.2912397395
+大通回族土族自治县 12.8020653633
+小本买卖 13.2075304714
+金门大桥 12.5143832909
+调经 10.8561552143
+工程力学 10.9562386728
+米修斯 12.5143832909
+王金战 13.900677652
+御用文人 12.8020653633
+课程体系 13.900677652
+第四十六章 11.3357282945
+立体照片 12.8020653633
+何伯 13.2075304714
+智者千虑 12.2912397395
+菜刀 9.85762638414
+二十八行 13.900677652
+结缡 12.8020653633
+博伊尔 12.2912397395
+升压 11.0103058941
+那玉红 13.900677652
+中小学校 10.2117981979
+健忘症 13.2075304714
+宣传部长 9.33632946051
+九米 13.900677652
+何休 12.2912397395
+承不承认 13.2075304714
+九类 12.8020653633
+结缔 13.900677652
+顶子 10.4349417492
+转到第 13.900677652
+火亮 12.5143832909
+姓名 7.15661846566
+通信网 10.2371160058
+贬为 10.533381822
+贵州省遵义地区 12.5143832909
+扭腰 11.8212361103
+花关索 12.5143832909
+信赖感 12.2912397395
+真材实料 12.5143832909
+喝啤酒 11.3357282945
+玄秘 13.2075304714
+培养皿 13.2075304714
+贬义 11.3357282945
+毛翅目 12.2912397395
+通讯设备 10.0294766411
+多三十岁 13.900677652
+洗浴城 12.5143832909
+大势已定 11.7034530746
+卡尔登 12.5143832909
+没齿 13.900677652
+长篇大论 10.765183436
+升号 12.2912397395
+斥骂 10.4666904475
+六百余家 12.5143832909
+特尔斯 13.900677652
+结网 11.1280889297
+贝特森 12.8020653633
+小桌子 11.598092559
+园林管理 13.900677652
+蕃薯粉 13.900677652
+向宗子 13.2075304714
+王时建 12.8020653633
+柏子 12.5143832909
+又臭又长 13.900677652
+结线 13.2075304714
+立足本职 13.900677652
+立方厘米 10.7226238216
+结纳 11.1926274509
+通胀 5.8582996468
+现政权 12.1089181827
+铁木辛 12.1089181827
+做不来 11.3357282945
+断金 12.8020653633
+逃到 8.15767446417
+升到 9.44633035572
+开航 11.5027823792
+关注点 9.49395840471
+何云 11.3357282945
+更想 11.1280889297
+雪里蕻 11.5027823792
+刘老爷 10.9049453784
+汗臭味 12.8020653633
+咧嘴一笑 10.9049453784
+厉公 11.8212361103
+更惨 10.3743171274
+主台 12.5143832909
+流刺网 12.8020653633
+瑞典队 13.2075304714
+开船 9.93038573842
+押上 11.9547675029
+彩色电影 13.2075304714
+闪灼 11.3357282945
+残存本 13.900677652
+斋堂 11.1926274509
+结绳 11.7034530746
+集约化 9.85762638414
+档位 10.8096351986
+壮怀 12.8020653633
+湖滨路 12.2912397395
+尊像 13.900677652
+何仪 12.8020653633
+何以 7.75220935606
+设备齐全 11.0103058941
+焊过 12.8020653633
+杰吉尔 12.8020653633
+翅子 11.5027823792
+乌布利 12.1089181827
+菜叶 10.5684731418
+务工地 13.900677652
+万泉河 11.2616203224
+摩尔多瓦 10.1630080337
+结结 13.900677652
+箭矢 9.91169360541
+奇风异俗 12.1089181827
+隋代修 13.2075304714
+热力四射 13.2075304714
+瑰丽 9.72629038208
+裱工 12.8020653633
+鲁尔河 11.7034530746
+每间房 13.2075304714
+何仇 13.900677652
+核子反应 12.8020653633
+伪县长 12.8020653633
+托克逊 11.1280889297
+中国儿童少年基金会 13.2075304714
+山立祠 13.2075304714
+和香兰 11.7034530746
+施托克 11.8212361103
+多层次 8.41173992582
+疑难问题 10.9562386728
+升力 10.1394775363
+牡马 13.2075304714
+安东尼斯 13.900677652
+符合实际 9.89334446674
+子璋亦 13.2075304714
+炒股票 10.604840786
+通联 11.3357282945
+辛几何 13.900677652
+何东 11.9547675029
+都受了 11.0674643079
+商业楼 12.2912397395
+升势 8.10461990121
+周瑜领 12.5143832909
+守门人 11.9547675029
+何不 7.6761192227
+上海第二医科大学 13.900677652
+开花 8.0600359946
+乐得屁 13.2075304714
+十日谈 11.4157710022
+码分多址 13.2075304714
+板球 12.1089181827
+工作日 7.43920947562
+布雷特 13.2075304714
+十五万元 13.900677652
+菜单 10.1630080337
+无目地 13.900677652
+道依茨 11.9547675029
+巴芬岛 11.8212361103
+俗名 9.87532596124
+更怕 11.2616203224
+马玉昆 12.5143832909
+髌骨 12.1089181827
+通考 9.74179456862
+工作失误 11.7034530746
+八十名 13.900677652
+肘尖 12.8020653633
+练武场 12.2912397395
+故夫 13.2075304714
+加诺夫 12.1089181827
+神经痛 11.2616203224
+生鱼片 13.2075304714
+对抗赛 10.5684731418
+略逊一筹 12.5143832909
+调羹 11.8212361103
+金兰湾 12.2912397395
+约束方程 12.5143832909
+举止失措 11.598092559
+诈称 10.765183436
+神经病 9.85762638414
+肯进去 13.900677652
+免不了 8.57280148319
+事务主义 13.900677652
+闪烁 8.30225569298
+车流量 11.3357282945
+柏斯 13.900677652
+抗真菌 11.1280889297
+朱白氏 10.533381822
+更忙 12.1089181827
+贴出去 11.8212361103
+塞德莱 12.5143832909
+柏施 13.900677652
+伊尔河 13.2075304714
+主忧臣辱 12.8020653633
+随机噪声 13.900677652
+糠麸 12.5143832909
+圆融 10.8096351986
+胭脂鱼 12.5143832909
+红衫儿 9.6811699468
+长膘 11.9547675029
+屏息以待 13.900677652
+扑起来 12.5143832909
+案件 6.86540905269
+菜油 10.1630080337
+魔术师 10.4349417492
+胡椒粉 11.9547675029
+更快 8.5440913773
+法国国民议会 11.4157710022
+武宗至 12.8020653633
+海晏堂 13.2075304714
+华航 12.1089181827
+生死之交 10.533381822
+云和月 11.5027823792
+指手划脚 10.9562386728
+林复恒 13.900677652
+阿尔德 12.8020653633
+顶新 11.9547675029
+挪动 9.17328983326
+腔骨 13.900677652
+经济援助 10.2897597393
+体癣 12.5143832909
+曾醉心 13.900677652
+夺走 9.26594866375
+士彦 12.8020653633
+模组化 13.900677652
+先捡 13.900677652
+粟类 12.5143832909
+示踪物 13.900677652
+勾过来 13.900677652
+要能 10.0940151622
+粟米 10.5684731418
+给事中 8.59737274392
+列缺 12.1089181827
+张苍水 12.2912397395
+共生体 12.5143832909
+卜筮 10.3453295905
+超轻型 11.9547675029
+长臂 11.598092559
+窘况 12.1089181827
+基米尔 13.900677652
+卜算 12.8020653633
+教师工资 11.3357282945
+长脸 11.1280889297
+转动惯量 11.0674643079
+粟粒 12.1089181827
+传颂千古 13.900677652
+村前村后 13.2075304714
+赤峰市 10.3453295905
+强压怒火 13.2075304714
+华英 8.85082164473
+七嘴八舌 9.46986085313
+被代理人 11.7034530746
+武二 10.9049453784
+姐姐 6.64862370012
+咸肉 11.7034530746
+长脚 9.93038573842
+牙轮 12.8020653633
+顶效 13.2075304714
+买点儿 11.9547675029
+焚符破玺 13.2075304714
+不怕苦 12.2912397395
+商吴天 13.900677652
+一段距离 9.55687223012
+楚将庄 11.9547675029
+升涨 12.8020653633
+周僖王 13.2075304714
+夺路 9.24671730182
+臭屁 11.4157710022
+巴巴急急 13.2075304714
+脾气急躁 12.5143832909
+福建南纸 10.604840786
+姐妹 7.90921310487
+存车处 13.2075304714
+崇文区 11.8212361103
+邦加 12.8020653633
+冷温水 13.2075304714
+菜汁 12.8020653633
+孔谦 13.2075304714
+编纂会 13.2075304714
+胖大海 12.2912397395
+阿尔弥 13.2075304714
+孟太太 11.3357282945
+王金山 11.3357282945
+更强 8.57280148319
+克罗夫特 12.8020653633
+东江纵队 12.2912397395
+泛泛之辈 12.2912397395
+绒绒的 12.8020653633
+乱国 11.598092559
+阿尔弗 12.8020653633
+蒲场巷 12.8020653633
+菜汤 10.9049453784
+热那亚 9.77354326693
+经络学 11.7034530746
+梅尔夫 13.2075304714
+陆希荣 8.64840422393
+鲁尔区 11.598092559
+起手 10.9049453784
+更张 11.7034530746
+感喟 12.1089181827
+科维尔 13.900677652
+珠玉 10.1394775363
+高相 13.900677652
+华药 11.4157710022
+预热器 12.8020653633
+国务院发展研究中心 9.0884932966
+柴油车 11.1926274509
+核桃肉 11.4157710022
+专卖局 12.8020653633
+舱门口 12.8020653633
+出米率 12.8020653633
+商业城 11.8212361103
+迹线 12.8020653633
+圈舍 11.9547675029
+建兴 9.98865464655
+摆长 12.2912397395
+建兰 13.900677652
+如数奉还 12.8020653633
+河津南 12.8020653633
+带毒 12.2912397395
+禁止 6.81812908262
+执法违法 13.2075304714
+五龙 10.3743171274
+加油卡 13.900677652
+车轱辘话 13.2075304714
+扫射 9.33632946051
+悔恨交加 12.8020653633
+祖训 10.7226238216
+建元 9.40086798165
+东亚地区 10.0505300503
+女裸体 12.5143832909
+竖琴 10.604840786
+纤毛 9.74179456862
+建党 10.1630080337
+一例 9.12999302751
+何炅 13.2075304714
+徐恭 13.2075304714
+梅诺卡 12.8020653633
+十分注意 10.2897597393
+只怪 10.642581114
+升汞 13.2075304714
+更应 9.49395840471
+伊尹相 13.2075304714
+汝有何 12.1089181827
+案例 7.77162744192
+原籍 8.48903160012
+鲤鱼打挺 11.598092559
+印加王 11.7034530746
+河田鸡 12.1089181827
+戴学稷 13.2075304714
+刀面 11.5027823792
+右白虎 12.5143832909
+长胜 10.7226238216
+商酌 13.2075304714
+审视 8.71889410168
+长胖 11.9547675029
+华茂 11.9547675029
+加工性 11.3357282945
+卜空 12.1089181827
+枫露 12.8020653633
+金属件 12.2912397395
+禁欲 10.1630080337
+与此无关 11.7034530746
+咫尺 10.6818018271
+会昌县 13.900677652
+文学梦 13.900677652
+敌军 8.0600359946
+顶撞 9.82314020807
+激光制导 10.4994802703
+禁毁 10.8096351986
+令尊大人 10.642581114
+新建县 12.8020653633
+空旷旷 13.2075304714
+卫生带 13.900677652
+旌旗招展 13.900677652
+吴中四 11.9547675029
+轰成 13.2075304714
+概率密度 12.8020653633
+林权证 13.900677652
+深言 13.900677652
+闪亮 8.90346537821
+禁毒 12.5143832909
+放宽心 11.5027823792
+建出 13.900677652
+思想解放 10.2117981979
+无尖牙 13.900677652
+金属丝 10.8096351986
+刀鞘 10.3453295905
+伸畅 13.900677652
+舒鲍 13.2075304714
+升沉 12.1089181827
+粉霜 13.2075304714
+生物污染 11.9547675029
+更广 9.98865464655
+技术手段 9.48183704418
+人之初 11.2616203224
+热效率 10.4349417492
+井里汶 13.2075304714
+气味相投 11.7034530746
+原粮 11.0674643079
+一个整团 13.2075304714
+长者 8.94485059437
+敌党 13.900677652
+长老 7.33259974056
+人体模特 13.900677652
+丁字湾 12.8020653633
+磁心 12.5143832909
+发奖仪式 13.2075304714
+河津县 12.8020653633
+原糖 10.3453295905
+客体化 13.900677652
+一举数得 12.1089181827
+康里部 12.5143832909
+雄风犹在 13.900677652
+杳无音讯 12.2912397395
+喳喳叫 13.2075304714
+贾珩 13.2075304714
+纪检监察 10.3171587135
+大海战 12.2912397395
+创新者 12.2912397395
+待战 13.2075304714
+贾兰便 12.5143832909
+一百三十多万户 13.2075304714
+玩具厂 12.2912397395
+曹丕听 13.2075304714
+追寻着 12.2912397395
+阿尔帕 13.900677652
+何灌 11.0103058941
+异母兄弟 12.5143832909
+林彪任 12.2912397395
+建军 9.30555780184
+右手掌 11.7034530746
+禀白 13.900677652
+工作室 9.56994431169
+外骨骼 10.765183436
+实时处理 11.7034530746
+加泰罗尼亚 11.4157710022
+药物制剂 12.2912397395
+缴枪不杀 11.598092559
+初生 9.43476953332
+阿尔巴 12.2912397395
+明骥 11.3357282945
+李香香 12.1089181827
+告捷 10.4349417492
+女职工 12.2912397395
+弓月城 12.8020653633
+带电作业 12.1089181827
+沙颍河 11.4157710022
+乱吵 13.900677652
+中国科学院金属研究所 13.2075304714
+帕金 13.900677652
+由臣 12.8020653633
+更差 11.4157710022
+鬣羚 11.0674643079
+柏枝 12.2912397395
+藏东 10.7226238216
+正颜厉色 12.1089181827
+想法子 9.91169360541
+柏林 7.49214886092
+华联 10.0294766411
+音乐吧 13.2075304714
+竖着 10.4666904475
+磁层 10.0088573539
+李桐轩 13.900677652
+拟题 12.8020653633
+世界领先 10.9562386728
+楠木 9.35738286971
+景延广 12.8020653633
+团团围住 9.89334446674
+施罗德 8.30596627237
+深觉 12.2912397395
+建制 8.21709788464
+决策准则 12.5143832909
+吴文赏 12.5143832909
+炒花生 12.2912397395
+敏感区域 12.5143832909
+襄州 11.1280889297
+越来越低 10.4041700905
+牛毛细雨 13.900677652
+忧疑 11.3357282945
+梦遗 12.5143832909
+舵舱 13.2075304714
+千家 9.94943393339
+磁山 10.765183436
+建初 11.598092559
+原罪 10.3743171274
+却似龙 12.8020653633
+刘易斯 10.0720362555
+田丰劝 12.5143832909
+对乙酰氨基酚 11.9547675029
+深褐 11.7034530746
+耶律楚材 10.3453295905
+柏木 10.1394775363
+建勤 11.0103058941
+葡萄藤 12.1089181827
+华能 9.35738286971
+诸军州 13.2075304714
+柏朵 12.8020653633
+梁石鱼 12.5143832909
+顶板 10.6818018271
+洛贡河 12.8020653633
+永德县 13.2075304714
+追不上 10.0720362555
+中国科学院近代物理研究所 11.7034530746
+敌前 11.8212361103
+民权县 12.1089181827
+邓艾之 11.9547675029
+肠子 9.05649056552
+裤缝 13.900677652
+华胜 12.5143832909
+不予置评 11.4157710022
+强雄弱 13.900677652
+艾丽斯 12.5143832909
+大泽乡 11.7034530746
+立法局 12.8020653633
+乱咬 10.9049453784
+八王坟 13.900677652
+齐桓公 9.69598503258
+柏杨 11.5027823792
+于燕 11.3357282945
+南传上座 13.900677652
+演个 12.8020653633
+三笔 12.1089181827
+分析化学 9.98865464655
+西安卫星测控中心 12.8020653633
+梅拉伦湖 13.2075304714
+顺杆爬 13.2075304714
+加工订货 12.2912397395
+陈鲤庭 12.5143832909
+长荣 11.2616203224
+须弥 12.1089181827
+牙质 13.900677652
+挪借 11.8212361103
+阿马尔 12.1089181827
+鸽群 11.0674643079
+玄武 10.1164880181
+刘延东 11.3357282945
+独立自主 8.9102450652
+夺过 9.48183704418
+萧遏鲁 11.598092559
+牛虻 10.8561552143
+凭处方 13.900677652
+矜功自伐 13.900677652
+学术年会 12.5143832909
+瑰玮 13.900677652
+三五十只 13.2075304714
+审计 7.35532799164
+长芽 13.2075304714
+审订 12.5143832909
+锻件 11.4157710022
+挪出 12.5143832909
+刀锋 10.2897597393
+笔饱墨酣 13.900677652
+审讯 8.88339781516
+狱讼 10.5684731418
+裤线 12.5143832909
+专科医生 11.598092559
+体用 11.0674643079
+向红娘子 10.9049453784
+敌台 9.84023464143
+私设公堂 13.2075304714
+内院 9.18217878068
+阿齐兹 11.5027823792
+顶替 9.53122979951
+建华 8.26232298264
+文化之乡 12.2912397395
+体生 13.2075304714
+苏满 13.2075304714
+敌友 12.2912397395
+几顿 11.0103058941
+收信机 13.900677652
+西藏高原 10.0940151622
+禽产品 12.8020653633
+小方桌 11.2616203224
+炉衬 12.5143832909
+一个终生 13.2075304714
+邦克 11.9547675029
+升温 7.62403416263
+封广陵 13.900677652
+庄重 8.55834340001
+卧倒在地 12.2912397395
+叶亦心 9.55687223012
+涧头 13.900677652
+何独 11.9547675029
+一失足成千古恨 13.900677652
+冲过来 9.94943393339
+线天线 13.900677652
+安东尼奥 10.6818018271
+李志甫 13.2075304714
+殊途同归 10.604840786
+昼夜节律 11.598092559
+检索服务 12.8020653633
+审评 11.5027823792
+三五千两 13.2075304714
+国有 6.94508504358
+高太尉 9.0884932966
+庶母 11.8212361103
+寒气逼人 11.3357282945
+港人治港 13.900677652
+十四项 12.2912397395
+抓周 12.8020653633
+赞成票 10.6818018271
+林义军 13.2075304714
+奥芬巴 12.2912397395
+刘根民 9.98865464655
+性命交关 12.8020653633
+六味地黄 10.2630914922
+傅友 13.900677652
+阿尔山 11.4157710022
+衬里 10.604840786
+抗惊厥 11.4157710022
+鞭痕 12.1089181827
+翅果 10.8096351986
+计量法 13.900677652
+方面军 8.9519177616
+长航 10.0940151622
+医科大 12.2912397395
+惹人注意 11.9547675029
+乱喊 11.2616203224
+建台 13.2075304714
+园林植物 11.9547675029
+大雨淋 12.8020653633
+千寻 11.8212361103
+缓冲存储器 12.8020653633
+红二十五军 12.1089181827
+王太傅 13.2075304714
+宓牧俳 13.2075304714
+携家带口 12.2912397395
+舒通 13.2075304714
+长舌 11.0103058941
+新来 8.85082164473
+舒适 7.69007757495
+不悱不发 13.2075304714
+致幻剂 13.900677652
+点铁成金 13.2075304714
+多利德 13.900677652
+临界体积 12.5143832909
+七九年 12.5143832909
+汉字输入 11.598092559
+郭淑珍 12.8020653633
+三资企业 11.4157710022
+好恶不同 13.900677652
+更少 8.9102450652
+房地产法 13.900677652
+台湾海峡 8.96620371885
+荣大人 12.1089181827
+何物 9.35738286971
+谈笑自如 13.2075304714
+高丽庄 13.2075304714
+齐祖 13.900677652
+梁明 13.2075304714
+敌区 13.2075304714
+入列 13.2075304714
+遑遑 12.5143832909
+枢要 11.8212361103
+旧约 10.2897597393
+清丽俊逸 13.900677652
+中心质 13.900677652
+王莽闻 13.900677652
+牵在 12.5143832909
+建厂 10.2117981979
+亚马逊 10.5684731418
+科利奥 13.2075304714
+橡皮糖 13.900677652
+噶尔 9.33632946051
+咸菜 10.0294766411
+担保金 13.2075304714
+深表 10.8096351986
+疏伐 13.900677652
+新闻热线 11.9547675029
+菜梗 13.900677652
+独生子 10.9562386728
+刘心武 12.2912397395
+沙僧 7.76511276089
+货币化 9.94943393339
+林祖涵 11.8212361103
+戳透 13.900677652
+梦乡 10.1164880181
+医药界 12.5143832909
+乱切 13.900677652
+全宋词 11.8212361103
+时举明 13.2075304714
+中生 9.84023464143
+音感 13.900677652
+乱到 13.2075304714
+两分钟 9.96885201925
+俭约 10.9562386728
+笔砚 9.98865464655
+阿尔察 13.2075304714
+尚然 11.9547675029
+乱刺 11.8212361103
+何疑 11.8212361103
+陈德高 9.71102290995
+深达 9.62401153296
+奥鲁赤 11.9547675029
+张令徽 10.9049453784
+杰书 11.0103058941
+纳瓦拉 12.1089181827
+瓦扬 12.1089181827
+卜罗 12.8020653633
+更定 10.9049453784
+多萝西 13.2075304714
+铭心 13.2075304714
+深远 7.5871296057
+科维奇 13.2075304714
+百色地区 11.8212361103
+悔之莫及 13.2075304714
+张学友 11.7034530746
+实用程序 12.1089181827
+梦中 9.49395840471
+百无一事 13.900677652
+赵和尚 12.8020653633
+神经纤维 9.63799777493
+李国臣 13.900677652
+极端困难 11.0103058941
+吴中区 13.2075304714
+卢水神 11.7034530746
+余有丁 11.7034530746
+橡皮筋 11.4157710022
+簿册 11.0103058941
+西安飞机工业公司 13.2075304714
+八十块 12.8020653633
+中乐 13.900677652
+音乐剧 11.7034530746
+皋兰山 12.1089181827
+唐菖蒲 11.8212361103
+橡皮管 12.1089181827
+朱安璋 13.900677652
+植物群落 10.3743171274
+邦国 10.0940151622
+数亿美元 12.1089181827
+新长征 11.598092559
+赫拉之 13.2075304714
+王待 13.900677652
+何用 8.83808261895
+孤儿院 10.7226238216
+停止下来 11.5027823792
+濒临破产 10.765183436
+先头部队 9.93038573842
+河西村 13.900677652
+中电 10.765183436
+二五户 13.2075304714
+居代郡 12.8020653633
+艰苦奋斗 9.91169360541
+曾凯 13.2075304714
+雄图大略 13.2075304714
+菜根 11.7034530746
+乱加 13.900677652
+珠宝商 11.9547675029
+褒义词 13.900677652
+弹性体 10.3743171274
+千手佛 12.8020653633
+胶囊剂 12.5143832909
+顾圣婴 12.8020653633
+南美国家 13.2075304714
+挂职 11.3357282945
+唐初名 12.2912397395
+陆性 13.900677652
+靠拢过来 12.2912397395
+英国剑桥大学 9.93038573842
+五马 11.8212361103
+萨帝鹏 10.1871055853
+科教组 13.900677652
+聊以自娱 13.900677652
+江阴市 11.4157710022
+炉边 10.6818018271
+谷冰川 13.2075304714
+珊瑚虫 10.1394775363
+北京画院 11.598092559
+马林诺夫斯基 11.8212361103
+分散相 11.1280889297
+庄院 10.0505300503
+维修工 11.1280889297
+奶昔 13.900677652
+肉眼凡胎 11.0674643079
+侯宝璋 13.2075304714
+中圈套 13.900677652
+僧舍 11.5027823792
+内防 12.8020653633
+羊粪 12.5143832909
+一条条 9.01032852375
+归并在 12.2912397395
+青岛市 9.85762638414
+祖辈 9.75754292558
+帕雷 12.8020653633
+原研 13.900677652
+感冒 7.74369866639
+杰作 8.62767809341
+相宇 12.2912397395
+枢轴 11.7034530746
+骆驼毛 12.5143832909
+云长交 12.8020653633
+躲不了 11.8212361103
+胆碱能 10.9562386728
+租起来 13.900677652
+克当量 12.5143832909
+饵名钓禄 13.900677652
+骆驼比 12.1089181827
+原码 13.900677652
+云里飞 13.2075304714
+真核细胞 10.2897597393
+郦道元 11.0674643079
+德里达 12.5143832909
+水来土掩 11.3357282945
+升格 10.2630914922
+理智型 13.900677652
+鼠窟 12.1089181827
+周而复始 9.96885201925
+祖迁 13.2075304714
+陈友谅 10.1164880181
+宁兴 12.8020653633
+王时敏 11.2616203224
+开卷有益 13.900677652
+包天 11.5027823792
+立法权 9.22784881751
+蛀木水虱 13.900677652
+一百六十多 12.5143832909
+禁演 10.8096351986
+杰伊 11.8212361103
+鼾睡 12.1089181827
+十几步 10.8561552143
+独行者 13.2075304714
+伯克兰 12.2912397395
+贾母因 10.0940151622
+阿妈妮 9.80633308975
+磁学 10.4994802703
+葡萄牙政府 11.598092559
+万一开 13.2075304714
+板仓 12.8020653633
+扯淡 10.1164880181
+祖述 12.1089181827
+感极涕零 13.900677652
+尚仲贤 13.2075304714
+繁衍生息 10.9562386728
+花卉画 12.8020653633
+不论怎样 10.1164880181
+燕与齐 12.8020653633
+岂可 8.78868986362
+换防 11.2616203224
+金钿 12.8020653633
+缓冲寄存器 13.900677652
+竖炉 11.8212361103
+标准大气 12.2912397395
+体现 6.05761363528
+魔术家 12.8020653633
+茶院 13.2075304714
+何琳 13.900677652
+早籼稻 10.765183436
+牛蛋 12.8020653633
+打靶场 13.900677652
+调整布局 12.2912397395
+挥臂 11.9547675029
+爬出来 9.44633035572
+音乐厅 10.0294766411
+捕蝇草 12.5143832909
+塔霍河 13.2075304714
+于汉籍 12.8020653633
+利州路 12.8020653633
+臭头 13.900677652
+掺杂使假 12.8020653633
+自行车 7.09495509856
+一幅幅 10.3171587135
+片冈 13.2075304714
+消费额 10.8096351986
+乱发 10.3743171274
+饱眼福 12.1089181827
+葡萄花 13.2075304714
+格物致知 11.0674643079
+闲趣 13.900677652
+郁气 12.5143832909
+商业化 9.4233408375
+大辟 10.7226238216
+世纪东方 13.900677652
+营养物质 8.75318317516
+三碗 10.1394775363
+感光 9.85762638414
+板书 12.5143832909
+荣获 8.60737282725
+大跌眼镜 9.80633308975
+陈田鹤 13.2075304714
+商业区 8.87023973058
+家长制 10.2897597393
+长葛 10.533381822
+异位症 11.0674643079
+帕格尼尼 11.0674643079
+音乐台 12.5143832909
+音乐史 10.604840786
+感兴 12.2912397395
+入境游 12.5143832909
+特罗姆 12.5143832909
+周公阅 13.2075304714
+静磁学 13.2075304714
+屋里 6.53866710072
+代替品 12.5143832909
+张思德 12.1089181827
+精神振奋 10.9049453784
+熊由奉 13.2075304714
+张学军 11.0103058941
+华董 12.2912397395
+世风 11.2616203224
+裤管 10.765183436
+咖喱粉 13.2075304714
+出生地点 13.2075304714
+更始 10.2897597393
+通用性 10.4349417492
+无暗影 13.2075304714
+敌国 9.89334446674
+金钢 11.2616203224
+颜宗磐 11.9547675029
+柏格森 11.0674643079
+职能资本 13.2075304714
+大敌当前 10.4666904475
+共进退 11.5027823792
+带法 13.2075304714
+环佩 10.765183436
+坠下来 12.5143832909
+巴罗克 13.2075304714
+问出 10.0940151622
+幸运者 10.9562386728
+诸郡海 13.2075304714
+元祥兴 12.2912397395
+逃不出 10.3743171274
+感动 7.09717239437
+伯克利 10.8561552143
+借机报复 13.900677652
+吴中公 13.2075304714
+庄田顷 12.8020653633
+傅嘏 12.2912397395
+人事部 11.4157710022
+时取 11.7034530746
+更妙 10.9049453784
+宗永福 13.2075304714
+卤面 13.2075304714
+件产品 11.598092559
+懒人 11.598092559
+考据学 11.4157710022
+电视接收 13.2075304714
+请带 13.900677652
+王莽遂 13.2075304714
+康乃馨 10.9562386728
+降低生产 10.642581114
+性肺炎 11.2616203224
+三十二三岁 13.2075304714
+唐斌见 12.8020653633
+大山猫 11.1926274509
+细粒度 13.900677652
+雾气腾腾 12.1089181827
+二氯化锰 13.900677652
+荣耀 9.01787572939
+明黄 10.8561552143
+斯蒂格 12.8020653633
+母马母 13.900677652
+僧肇 11.8212361103
+入内 9.61021821083
+扯下来 11.598092559
+环伺 11.9547675029
+加工机 12.2912397395
+命作 12.5143832909
+懒于 11.598092559
+卜巧 13.2075304714
+蔡九 10.1871055853
+地五会 13.900677652
+建园 10.533381822
+短小精干 13.2075304714
+落了空 10.9562386728
+蔡京 8.80081122415
+民政部 10.642581114
+河北梆子 10.9562386728
+建国 7.62403416263
+环保 6.61448593727
+风府穴 13.900677652
+齐人立 13.2075304714
+下侧 11.4157710022
+波兰议会 12.5143832909
+君合 12.5143832909
+弯道 10.0088573539
+财产纠纷 13.2075304714
+志士仁人 11.8212361103
+傅园 13.900677652
+基本国策 10.533381822
+冠袍带履 13.2075304714
+基础设施 7.28863661714
+圆脸 10.1164880181
+戈罗恩 12.5143832909
+商王武 12.2912397395
+感到 5.26197504316
+讲学 8.28390655431
+榕城 12.1089181827
+委托收款 12.5143832909
+湖边 8.50705010562
+佛罗里达州 10.1630080337
+傻里傻气 13.900677652
+五顿 13.2075304714
+十几次 11.1926274509
+更多 5.39920742102
+五顶 13.2075304714
+五顷 11.7034530746
+过杆 12.8020653633
+蔡仪 13.2075304714
+鹤唳风声 13.900677652
+笔端 11.8212361103
+现政府 12.8020653633
+惠宁 13.2075304714
+乌干达先令 13.900677652
+体热 11.9547675029
+节省时间 11.4157710022
+雷兽科 12.8020653633
+奏章 9.16447920358
+低位 7.26604429411
+咸蛋 11.4157710022
+循化撒拉族自治县 13.900677652
+复苏 5.13584343764
+刻痕 12.1089181827
+铺盖卷儿 12.2912397395
+葡萄膜 11.9547675029
+财产权利 10.6818018271
+艾斯勒 12.8020653633
+毛子水 13.2075304714
+更夫 11.8212361103
+更大 6.54823655173
+全中文 13.900677652
+裤筒 12.2912397395
+李天王 9.91169360541
+业余大学 13.900677652
+长颈鹿 10.0294766411
+蔡伦 10.765183436
+不跌反涨 11.2616203224
+愈易 13.900677652
+王福晋 10.3743171274
+师夷 13.900677652
+忧烦 12.2912397395
+女中丈夫 13.900677652
+那金甲 13.900677652
+垄断市场 11.9547675029
+王国势力 11.3357282945
+原稿 10.5684731418
+小打小闹 11.0103058941
+彭云鹤 13.2075304714
+五香 10.8561552143
+五首 11.1280889297
+笔笔 10.9562386728
+王太后 12.1089181827
+倾谈 11.5027823792
+更声 13.2075304714
+农业知识 12.5143832909
+氯仿 9.5062284973
+磁头 10.2897597393
+模拟量 11.8212361103
+头发丝 10.9562386728
+窘困 11.8212361103
+乔师望 13.2075304714
+建在 8.89673134603
+逢低买进 12.2912397395
+感受 6.89398242514
+乱党 13.2075304714
+容直 12.2912397395
+感发 12.2912397395
+总经济师 10.2897597393
+警察法 13.2075304714
+心理学家 9.01032852375
+目色 13.900677652
+高立士 13.2075304714
+环中 10.9049453784
+多云转阴 11.9547675029
+乱兵 10.0294766411
+柏拉 13.2075304714
+帕姆格伦 13.2075304714
+布饶尔 12.2912397395
+原穴 11.3357282945
+笔筒 10.9562386728
+借此机会 9.61021821083
+五星级 9.13850371718
+撞入 10.2897597393
+高级社 12.5143832909
+感召 10.765183436
+谭其骧 10.3743171274
+长蛇 10.4994802703
+维新派 9.71102290995
+宣传词 13.900677652
+方程解 11.9547675029
+李村 12.1089181827
+跛子 10.2371160058
+活学活用 10.8561552143
+林洋港 13.2075304714
+深谙 10.2897597393
+感化 10.2630914922
+乱军 10.0720362555
+剧艺 13.900677652
+安忍弃 12.8020653633
+蔡侯 11.4157710022
+王铁崖 12.8020653633
+公告费 13.900677652
+煤炭网 13.900677652
+捐钱 11.598092559
+建基 12.8020653633
+封耶律 13.900677652
+深谈 10.0940151622
+笔管 11.598092559
+靠海吃海 13.2075304714
+缴清 11.8212361103
+金书铁券 13.900677652
+深谷 9.12999302751
+笔算 13.900677652
+阿尔塔 11.8212361103
+五餐 12.8020653633
+新岁 13.2075304714
+奥敦周 13.2075304714
+巴拿马人 12.8020653633
+十五六万 12.5143832909
+安乐村 13.2075304714
+稀树草原 10.4041700905
+葡萄胎 11.7034530746
+忆秦娥 12.5143832909
+杰帕德 13.2075304714
+左尹非 13.2075304714
+信贷管理 10.7226238216
+谭希思 13.2075304714
+蔡信 13.900677652
+二十桌 13.2075304714
+长虹 8.50705010562
+七十厘米 13.900677652
+诸降臣 13.2075304714
+荣膺 10.1394775363
+宋都 10.6818018271
+俗气 10.4994802703
+长虫 10.9049453784
+牛子厚 13.900677652
+吕夷简 12.5143832909
+路大军 12.5143832909
+梅尔希 13.2075304714
+第一关 11.0103058941
+吉隆县 13.2075304714
+范加尔 13.900677652
+唐宣宗 12.1089181827
+行为主义 10.1164880181
+门里 9.09665660724
+明暗不定 13.900677652
+道听途说 10.2630914922
+两半球 10.4666904475
+憋气 10.7226238216
+禄山 12.1089181827
+直放站 13.2075304714
+宗任皇 13.2075304714
+原子光谱 10.3453295905
+原生 8.91707103027
+阿尔基 13.900677652
+世雄 13.900677652
+伯克尔 11.2616203224
+摇着头 9.0884932966
+吃水线 12.8020653633
+姜维累 13.2075304714
+不胜感激 11.7034530746
+相遇 8.19689517732
+低估 7.97108850859
+退步抽身 12.8020653633
+奥康 11.598092559
+遁辞 11.598092559
+额外收费 13.900677652
+原画 12.8020653633
+深获 12.1089181827
+美妙 8.65365357982
+偎着 11.2616203224
+克莱蒙 11.8212361103
+贝克兰 13.2075304714
+原由 9.61021821083
+运钞车 11.8212361103
+高梦丸 12.8020653633
+线形动物 11.9547675029
+当代小说 13.900677652
+李处巽 13.2075304714
+望紫石 13.2075304714
+原用 11.598092559
+瘴疠 11.9547675029
+商运商 12.1089181827
+繁荣经济 13.2075304714
+五零 13.900677652
+往后面 11.0103058941
+虞仲 13.900677652
+禁戒 11.9547675029
+高梦九 10.1394775363
+明都 12.2912397395
+鹤岗 10.2630914922
+达努彪 13.900677652
+无缘 8.9308643524
+手推式 13.900677652
+棉籽 11.0674643079
+左手边 12.2912397395
+磁器 11.7034530746
+工作制 10.8096351986
+变形体 11.8212361103
+英文单词 12.1089181827
+何种 8.23425096386
+何来 9.40086798165
+王太子 11.9547675029
+本地股 8.3285236198
+会接 13.900677652
+遁迹 12.2912397395
+丁先生 12.5143832909
+升斗 12.2912397395
+协议 5.9494704955
+臭名 11.8212361103
+五阵 13.2075304714
+燃烧室 10.4666904475
+钱达尔 12.2912397395
+玄感 12.1089181827
+王太宰 11.5027823792
+疏通 8.94485059437
+体纯 9.87532596124
+广金 12.8020653633
+垃圾站 12.5143832909
+捆着 11.0103058941
+憧憬 8.84443184663
+乱序 12.8020653633
+精白 12.2912397395
+翁山 11.0103058941
+大眼袋 13.900677652
+肺脏 10.604840786
+纤手 11.4157710022
+直接参与 9.63799777493
+李俊民 13.2075304714
+王太守 11.9547675029
+黑加仑 13.2075304714
+音量控制 13.2075304714
+无罪 9.0884932966
+中提琴 11.1280889297
+阿尔坎 13.2075304714
+磨平 11.1926274509
+长褂 13.900677652
+升旗 10.9049453784
+一片丹心 13.900677652
+蜡刀 13.900677652
+测控站 11.4157710022
+盛会 8.99540287354
+唐贤 13.2075304714
+五陵 13.2075304714
+内酯 11.3357282945
+绚烂 10.2371160058
+金樱子 13.2075304714
+查理斯 12.5143832909
+更圆 13.900677652
+臆说 12.8020653633
+鲁勉采 12.2912397395
+六十多万 12.8020653633
+菜摊 11.598092559
+龙音 13.900677652
+光焰万丈 13.900677652
+锈病 10.1871055853
+寇将军 12.8020653633
+黑人区 13.900677652
+何神 13.2075304714
+体统 9.7898037878
+沙发垫 13.2075304714
+林树森 13.2075304714
+腥味儿 12.5143832909
+押租 10.8561552143
+山神野 12.8020653633
+韩非 10.3453295905
+活劳动 9.40086798165
+燕然勒 13.900677652
+草乌 11.8212361103
+盛传 9.54396882529
+六十多个 12.8020653633
+很高 7.02854955064
+并驾齐驱 10.533381822
+明道 11.1926274509
+挪威 7.48721869481
+绍兴人 11.1926274509
+李宗伟 13.900677652
+贺华姐姐 13.2075304714
+笔画 9.13850371718
+明光瓦 12.8020653633
+爆破声 12.8020653633
+牛腿 11.9547675029
+缀合 12.2912397395
+沙图克 12.5143832909
+拿稳 12.1089181827
+建好 10.1871055853
+禁捕 13.900677652
+归里包堆 13.2075304714
+柏油 10.6818018271
+辛普利 13.900677652
+取悦于人 13.900677652
+原理 6.516688194
+君安 12.8020653633
+官僧录 13.2075304714
+黄连木 12.8020653633
+阉过 12.5143832909
+西城区 10.604840786
+不等边 12.2912397395
+长袜 12.5143832909
+亮晶晶 9.84023464143
+乱弹 10.8561552143
+长袖 10.5684731418
+悬突 13.900677652
+菲特 11.598092559
+脱卜察 13.2075304714
+长袍 9.08039608637
+恐胁 13.900677652
+永恒不变 10.7226238216
+姜桂茶 13.2075304714
+高迎祥 9.89334446674
+子阿尔 13.2075304714
+磁场 7.93197009199
+富贵在天 12.2912397395
+罗晓维 9.32596667347
+提档线 13.900677652
+充分说明 9.89334446674
+窘境 9.7898037878
+建大 11.9547675029
+所有权证 12.2912397395
+蹩脚 10.6818018271
+壮胆 9.77354326693
+盛事 10.3453295905
+长裤 10.1164880181
+王时楚 12.8020653633
+牛腩 12.8020653633
+噹啷 13.900677652
+削波器 13.900677652
+风风雨雨 10.3453295905
+体罚 10.8096351986
+农林部 12.5143832909
+趁空 13.2075304714
+阿芙乐尔 12.1089181827
+长裙 9.63799777493
+胡编乱造 11.8212361103
+相乙儿 12.5143832909
+琦善 11.4157710022
+实业计划 13.900677652
+警示语 12.8020653633
+汽笛声 11.0674643079
+建外 12.1089181827
+玄想 11.5027823792
+盛京 8.83177344976
+祖茂 13.2075304714
+盛乐 11.1280889297
+不遗余力 9.65218240993
+华语 10.9562386728
+五霸 10.765183436
+问嘉 12.1089181827
+食不知味 13.900677652
+相逆 12.5143832909
+石斛 10.765183436
+潢川县 11.7034530746
+间歇 9.01032852375
+膏子 12.2912397395
+世青 13.900677652
+玄思 13.900677652
+祖茔 12.5143832909
+任何人 7.35676580641
+全等变换 12.8020653633
+海迷失 12.2912397395
+海夫纳 13.900677652
+阿契美尼 11.2616203224
+哈士奇 11.7034530746
+循环论证 13.900677652
+相通 7.73525979774
+挂账 12.8020653633
+平八郎 11.7034530746
+优良传统 9.5062284973
+市面上 9.41204128224
+拔高 10.604840786
+建始 11.2616203224
+鱼汁 13.2075304714
+工作台 10.4349417492
+白谷兄 11.7034530746
+远洋航行 11.3357282945
+专门利人 13.2075304714
+华诚 12.8020653633
+第四十三条 13.2075304714
+活跃股 13.2075304714
+无论如何 7.2872934336
+华诞 10.0294766411
+屯集 13.900677652
+建委 9.72629038208
+文勤公 13.900677652
+铭刻 10.4041700905
+从长商议 12.8020653633
+安定剂 12.8020653633
+君子 8.1417758781
+警察所 12.8020653633
+盛世 8.18036587537
+百分之七点 12.5143832909
+中俄总理定期会晤委员会 11.5027823792
+盛业 11.1926274509
+德福雷 12.8020653633
+闻言色 13.900677652
+戈洛文 12.1089181827
+希雷 11.8212361103
+年少时 11.598092559
+断肢 11.3357282945
+长衫 8.86372504956
+荣达 12.5143832909
+腻歪 11.8212361103
+荣辱 9.93038573842
+长衣 11.7034530746
+国朝中 13.2075304714
+深色 9.62401153296
+新野县 11.8212361103
+安乐椅 12.8020653633
+长街 9.63799777493
+周边产品 12.8020653633
+祖荫 12.5143832909
+李国豪 11.8212361103
+盛举 12.8020653633
+唐僧转 13.2075304714
+储备 6.63594747405
+不可收拾 9.25628675283
+上海籍 13.900677652
+挂起 10.1871055853
+呼来喝去 12.2912397395
+追究其 11.0674643079
+云高 13.900677652
+带挈 11.1280889297
+轻伤者 13.900677652
+发声器官 12.2912397395
+文学性 10.9049453784
+禅位 10.765183436
+振动器 13.2075304714
+王太太 12.2912397395
+血饮 13.900677652
+打磕睡 12.1089181827
+感应 8.39534611604
+赖宁 13.2075304714
+慷慨解囊 10.9049453784
+五钱 10.6818018271
+名牌服饰 13.900677652
+分洪区 11.9547675029
+照价赔偿 13.900677652
+乱射 11.3357282945
+鳞茎 10.6818018271
+叶尔莫洛 12.2912397395
+黄少敏 12.5143832909
+非战公约 11.7034530746
+润肤霜 11.8212361103
+女人 5.53967054375
+势如劈竹 13.2075304714
+多路径 12.8020653633
+蒙击兵 13.2075304714
+寻览 13.2075304714
+一扫而光 10.4666904475
+卡西诺 12.1089181827
+磕磕巴巴 12.1089181827
+维修区 12.8020653633
+润肤露 12.8020653633
+江相望 10.8096351986
+傅婴 13.2075304714
+链转移 12.5143832909
+航空航天部 13.900677652
+斯定理 13.900677652
+女仙 11.9547675029
+三秒 12.5143832909
+特种兵 10.8561552143
+扯拉 11.9547675029
+丁大哥 11.7034530746
+干瞪眼 11.4157710022
+白泉 12.8020653633
+五音不全 13.2075304714
+张郁兰 13.2075304714
+傍水 11.9547675029
+哲言 13.2075304714
+平方根 10.6818018271
+五铢 11.8212361103
+女仆 9.56994431169
+原着 12.1089181827
+陈德良 13.900677652
+长话 11.7034530746
+狮吼 12.8020653633
+虚席以待 13.2075304714
+丙酮 9.34680076038
+长诗 8.81927328699
+不随意肌 12.8020653633
+血肉横飞 11.3357282945
+建威 11.1280889297
+临沭县 11.5027823792
+刀开关 12.8020653633
+丙酸 10.8561552143
+升来 12.8020653633
+大同盆地 11.0674643079
+尊旨 13.2075304714
+土窑 10.4349417492
+万向集团 13.2075304714
+梆硬 12.2912397395
+百粒 13.2075304714
+刀鱼 11.0103058941
+求救 8.75901409547
+万事俱备 10.9049453784
+生产布局 10.8561552143
+王雅兹 13.2075304714
+意料不到 10.604840786
+琴箫 12.2912397395
+侵略性 10.765183436
+沉重打击 8.83177344976
+杜利特 12.5143832909
+丙醇 11.7034530746
+丙醛 13.2075304714
+这五种 11.7034530746
+孔虫 12.1089181827
+维修厂 11.4157710022
+商业局 10.9049453784
+除味剂 13.2075304714
+扯成 11.2616203224
+棉纸 11.1926274509
+棉纺 9.04086524761
+朴直 12.8020653633
+棉线 11.4157710022
+秧子 11.7034530746
+棉纱 8.76487921493
+三河坝 11.9547675029
+连锁式 12.5143832909
+格拉斯曼 12.1089181827
+孚日山 12.8020653633
+追究制 11.9547675029
+华裔 9.33632946051
+洛龙区 11.1280889297
+笔下留情 13.2075304714
+体系 5.83039675858
+炉膛 10.5684731418
+师姑 13.900677652
+是非功过 13.2075304714
+演说辞 12.2912397395
+女乒 13.900677652
+笔直 8.91707103027
+棉绒 11.7034530746
+喧哗声 11.8212361103
+高等教育部 11.598092559
+新桥镇 13.900677652
+明鉴 10.9049453784
+棉织 11.3357282945
+米阴坡 11.8212361103
+原矿 11.8212361103
+杨尚昆 10.9562386728
+军团长 10.8096351986
+高庆奎 11.7034530746
+赔付率 12.2912397395
+优胜奖 13.2075304714
+何策 10.9049453784
+笔盒 12.2912397395
+充填剂 12.8020653633
+利雅得 11.0674643079
+尊敬 7.92941581219
+遁走 11.3357282945
+全民公决 10.765183436
+生产链 13.900677652
+何等 7.98717464634
+原知 13.2075304714
+深不见底 10.1630080337
+乌拉圭人 12.5143832909
+扯掉 10.1394775363
+内里 9.45802639549
+塔德努 13.900677652
+紫微星 11.8212361103
+安杰罗 13.900677652
+女侍 11.5027823792
+华西 9.71102290995
+尧舜禹汤 12.5143832909
+傅子 13.2075304714
+敌对 8.87679713113
+敌寇 11.598092559
+选修课 12.2912397395
+肯进来 12.8020653633
+海军医院 13.900677652
+十五万斤 13.2075304714
+备受瞩目 10.2117981979
+海滨浴场 10.533381822
+夹起来 12.1089181827
+阿尔哈 13.2075304714
+斯金斯 10.0088573539
+乘船 9.21854642485
+世间 8.29487558568
+邦奇 13.900677652
+韩维 13.2075304714
+赵四公子 11.8212361103
+女侠 11.9547675029
+吕海 12.8020653633
+椰干 10.3743171274
+贺盛瑞 13.2075304714
+挂过 11.9547675029
+别树一帜 12.8020653633
+决定权 9.82314020807
+威士忌酒 11.8212361103
+芳烃抽提 13.900677652
+说妥 11.2616203224
+皋兰县 13.2075304714
+水文局 12.5143832909
+希伯莱 12.1089181827
+敌害 9.6811699468
+五门 10.2371160058
+十四道 10.8561552143
+佛拉芒 11.598092559
+塔勒奇 13.2075304714
+撮药 13.900677652
+隔膜阀 13.900677652
+好酒贪杯 13.900677652
+停靠点 12.2912397395
+棉纺织品 11.2616203224
+感念 10.4994802703
+人气儿 13.900677652
+李作鹏 12.8020653633
+鸟笼子 11.0103058941
+孔融 10.4349417492
+琳琅满目 9.91169360541
+不断完善 8.71889410168
+数十亿美元 10.5684731418
+三秦 10.533381822
+匍伏 10.765183436
+文学报 12.2912397395
+海晏县 11.598092559
+女优 13.900677652
+深耕 10.6818018271
+吉备真 12.8020653633
+祖脉 11.9547675029
+丢眼色 13.2075304714
+动力车 10.9049453784
+恋物癖 13.900677652
+卡其色 13.2075304714
+切尔滕纳姆 12.8020653633
+几千亿颗 13.2075304714
+神佑 12.8020653633
+饿狼 10.3453295905
+学棍 13.2075304714
+安乐死 11.9547675029
+文学所 11.9547675029
+圆谎 12.2912397395
+路德教派 13.900677652
+乌衣巷 12.8020653633
+高丽图 13.2075304714
+肝吸虫 13.900677652
+华观 13.900677652
+威望素著 12.8020653633
+感觉神经 11.3357282945
+华视 13.900677652
+女伴 9.96885201925
+毛诗传 12.8020653633
+封师 13.900677652
+版面 10.0720362555
+津津乐道 9.91169360541
+竖线 11.7034530746
+绿州 13.2075304714
+镇静自若 13.900677652
+可吸入颗粒物 12.8020653633
+俗态 12.8020653633
+原盘 13.900677652
+刘佐龙 13.2075304714
+煤炭部 13.2075304714
+无所作为 10.0720362555
+原盐 10.3453295905
+鸦髻 13.900677652
+揖别 13.900677652
+更名 7.75864024639
+流水线结构 12.8020653633
+大跨一步 13.2075304714
+中南部 8.38724890581
+盎然 10.2117981979
+重新补充 13.900677652
+挂车 10.4349417492
+精练 9.80633308975
+纳瓦洛 13.2075304714
+建宇 13.2075304714
+一着不慎 12.5143832909
+筹集 8.57280148319
+挂轴 12.5143832909
+落落寡合 11.9547675029
+瞬息间 11.7034530746
+氢镍 13.900677652
+女佣 11.5027823792
+挂载 10.0294766411
+万亿韩元 13.900677652
+下眼睑 10.5684731418
+婚姻状况 11.5027823792
+九仙 12.1089181827
+毫不关心 13.900677652
+明钦 13.900677652
+拖后腿 11.598092559
+创作自由 11.8212361103
+卧虎山 13.2075304714
+埃尼克 13.900677652
+中医药 9.96885201925
+文艺团体 11.2616203224
+伯南布哥州 13.2075304714
+莱芜战役 11.9547675029
+九件 12.5143832909
+阿尔发 12.8020653633
+棉纺织厂 10.3743171274
+山顶洞人 10.4666904475
+卜将军 12.2912397395
+鄂入湘 13.2075304714
+愈是 10.4349417492
+明钞 12.8020653633
+图形符号 12.2912397395
+傅山 11.7034530746
+九井 12.5143832909
+九五 10.2630914922
+伸伸手 13.2075304714
+辛集市 11.5027823792
+噶厦 11.8212361103
+推回去 11.9547675029
+遁词 12.8020653633
+三都县 12.8020653633
+数额较大 11.3357282945
+刘夫人 11.598092559
+德沃夏克 11.7034530746
+平肝熄风 10.9562386728
+长跪 10.642581114
+九二 13.900677652
+颐和园 8.77671367257
+达到抑制 12.8020653633
+尽量减少 9.7898037878
+腻滑 12.8020653633
+戈达尔 12.1089181827
+彼得罗夫斯基 12.8020653633
+徐明 10.8561552143
+九亿 11.7034530746
+广为人知 10.9562386728
+长跑 9.82314020807
+饿狗 12.5143832909
+曲校录 12.8020653633
+水文学 9.96885201925
+河津市 12.5143832909
+大中小学 12.5143832909
+原煤 9.08039608637
+九亩 13.2075304714
+告贷无门 13.900677652
+官置吏 11.8212361103
+丁大利 13.900677652
+以邻为壑 12.5143832909
+九九 10.2630914922
+亚伯迪 13.900677652
+能相容 13.900677652
+鄂境川 12.5143832909
+植根于 11.0674643079
+阿尔卡 11.9547675029
+唐初属 12.1089181827
+芋艿 12.5143832909
+柳亚子 11.1926274509
+布政使 8.85082164473
+多边合作 11.9547675029
+喽罗 8.67493097826
+瓦隆人 12.1089181827
+阿尔卑 13.2075304714
+每百人 13.2075304714
+孙德清 12.8020653633
+寒暑假 11.5027823792
+沃特 10.533381822
+优先购买 11.0674643079
+十五万户 12.8020653633
+青龙满族自治县 13.2075304714
+工作团 11.5027823792
+徐悲鸿 10.604840786
+主心骨 10.6818018271
+冷温性 12.1089181827
+圈进 13.2075304714
+九世 10.8561552143
+实施细则 8.84443184663
+梅特罗 13.2075304714
+高丽军 12.5143832909
+长起 11.598092559
+原燕 12.8020653633
+轰下台 12.1089181827
+难者不会 13.2075304714
+按部就班 10.2117981979
+九万 11.598092559
+办事 7.25558668247
+九七 13.900677652
+玄教 11.9547675029
+九三 11.3357282945
+九丈 13.2075304714
+九下 13.2075304714
+敌将 10.5684731418
+荣誉 7.54456999128
+政事堂 9.71102290995
+挂衣 13.900677652
+拟阵 13.2075304714
+挂表 13.2075304714
+消费量 8.86372504956
+玩具店 12.2912397395
+刘海粟 11.598092559
+协进 13.900677652
+九中 11.7034530746
+八十余年 12.5143832909
+说不清楚 8.83177344976
+九个 8.28390655431
+敌巢 13.900677652
+刚性链 13.900677652
+活色 12.1089181827
+光鲜亮丽 12.1089181827
+马前卒 11.2616203224
+缄口 10.8561552143
+爱情灵药 13.900677652
+工作坊 13.2075304714
+无数条 11.0103058941
+邦彦 12.8020653633
+磁化 9.41204128224
+不称职者 12.5143832909
+马雅可 13.900677652
+杨柳儿 13.900677652
+麋羚 13.900677652
+禁条 13.900677652
+扯断 10.765183436
+危及 8.47572763449
+一百六十六 12.2912397395
+三铁 12.2912397395
+阿尔勒 13.900677652
+拟音 13.900677652
+巴芬湾 11.9547675029
+双索面 13.2075304714
+计算机本身 12.2912397395
+俗曲 11.4157710022
+伤天害理 10.3743171274
+洪春桥 12.2912397395
+顶棚 9.96885201925
+两万余户 13.2075304714
+测控网 11.8212361103
+乱子 9.61021821083
+比德尔 11.9547675029
+法兰西银行 11.1280889297
+补丁包 13.900677652
+南岸陆 13.2075304714
+润滑性 11.7034530746
+沃玛 13.900677652
+朗朗上口 11.598092559
+圣马力诺共和国 13.2075304714
+温州人 10.1394775363
+阿尔加 13.900677652
+安宗社 13.2075304714
+带枪 10.9562386728
+油箱盖 13.900677652
+磁卡 11.0674643079
+顶梁 11.8212361103
+明降州 12.5143832909
+连长 7.83456956187
+涕泪滂沱 13.900677652
+写字台 9.48183704418
+证券公司 7.32003851469
+舒默 13.900677652
+国外品牌 12.1089181827
+退房 10.3171587135
+八片 12.5143832909
+泄火 12.8020653633
+更动 11.1926274509
+升息 8.11993413618
+九侯 12.1089181827
+音乐季 12.8020653633
+大炼钢铁 11.8212361103
+更加 5.31079177517
+西科斯基 13.900677652
+深得民心 11.598092559
+俭省 12.5143832909
+孔腹 13.900677652
+长谷 13.2075304714
+建工 9.5186510173
+磁压 13.2075304714
+方才能 13.2075304714
+建巢 12.2912397395
+肯尼迪航天中心 11.598092559
+六千块 13.2075304714
+转椅 12.2912397395
+十杯酒 13.900677652
+九位 11.0103058941
+和田地区 12.5143832909
+羚角 11.8212361103
+带材 11.5027823792
+珠宝展 13.2075304714
+高级班 12.2912397395
+坤表 13.900677652
+禁止者 12.1089181827
+原点 9.94943393339
+新高峰 12.8020653633
+柯克曼 13.900677652
+音乐家 9.26594866375
+韩绛 13.2075304714
+傅巽 13.2075304714
+色价 13.900677652
+建州 10.0294766411
+王戎好 13.2075304714
+互感系数 12.5143832909
+长谈 10.2630914922
+明锐 12.1089181827
+影视帝国 13.900677652
+长调 11.598092559
+静水压力 12.2912397395
+磁县 10.5684731418
+革履 13.900677652
+深虑 11.598092559
+勤工 11.7034530746
+邦德 11.2616203224
+隆兴元 11.7034530746
+带机 13.900677652
+国际护士节 13.2075304714
+二十三日 10.2897597393
+感奋 10.9049453784
+美国贝尔实验室 12.5143832909
+华达 11.4157710022
+华辰 12.8020653633
+荣记 13.900677652
+禁果 11.1926274509
+棉秆 12.5143832909
+入超国 13.900677652
+克兰科 12.8020653633
+半球状 12.8020653633
+吴文英 11.0103058941
+拿给 9.87532596124
+玉垒山 12.1089181827
+文廷式 9.12155415886
+身份验证 12.2912397395
+锚索 13.2075304714
+漫漶 12.8020653633
+监院 11.9547675029
+佐理 11.598092559
+姓李 9.40086798165
+新闻热点 13.900677652
+航海技术 10.7226238216
+挪开 10.3743171274
+缚鸡之力 11.0674643079
+哈弗斯 13.2075304714
+投入量 11.598092559
+青红皂白 11.3357282945
+长边 13.900677652
+清嗓子 11.3357282945
+高太公 12.5143832909
+刘氏劝 13.900677652
+交割单 13.900677652
+踢回去 13.900677652
+乱堆 11.598092559
+最新更新 12.2912397395
+一氧化二氮 12.5143832909
+音乐堂 13.2075304714
+竖笛 12.1089181827
+宁夏平原 11.7034530746
+建平 9.02548032877
+长辞 13.2075304714
+强弓劲弩 12.5143832909
+更出 13.2075304714
+退耕还林 10.2897597393
+搞糊涂 12.1089181827
+美国国家档案馆 13.2075304714
+中途岛 10.4349417492
+毛毛 9.7898037878
+成文法 9.91169360541
+罗雷亚尔 13.2075304714
+金光灿烂 11.5027823792
+升挡 12.1089181827
+长辈 8.80081122415
+夯土层 11.9547675029
+超低空 9.91169360541
+卡西迪 13.900677652
+石屏县 13.900677652
+荣衔 12.5143832909
+调上 12.2912397395
+圆角 11.3357282945
+牙膏 9.93038573842
+游仙诗 13.900677652
+巴罗夫 12.8020653633
+数学论文 12.8020653633
+邦尼 12.8020653633
+类杂志 12.8020653633
+毫无关系 9.5186510173
+催化裂化 11.4157710022
+蛋黄派 13.2075304714
+圆规 11.0674643079
+加里曼丹 10.8096351986
+五部 10.1394775363
+和晶界 13.2075304714
+贵不可言 11.5027823792
+窘得 12.1089181827
+国家煤矿安全监察局 13.900677652
+调个 12.1089181827
+华谊 7.30080715276
+长远 7.45495783259
+阿尔农 12.2912397395
+粟特 10.533381822
+消极态度 11.9547675029
+圈起 11.7034530746
+模拟题 12.8020653633
+五郎 11.598092559
+调为 11.4157710022
+爱不爱 11.4157710022
+高效能 10.765183436
+长过 11.598092559
+商竟增 13.2075304714
+礼拜 8.49350588052
+九亿八千二百多万两 13.2075304714
+布列斯 13.2075304714
+拧干 11.3357282945
+成熟度 10.2897597393
+王侍郎 11.5027823792
+收发报机 13.2075304714
+盯问 12.8020653633
+结伴 9.43476953332
+大权旁落 11.0103058941
+世道 9.32596667347
+僧衣 11.2616203224
+演说词 12.5143832909
+袁将军 9.77354326693
+高丽参 12.2912397395
+奶汁 11.1280889297
+结伙 10.5684731418
+走光 11.4157710022
+五通 12.8020653633
+物镜 10.7226238216
+古尔伯 13.900677652
+革命斗志 13.2075304714
+稠人广坐 13.900677652
+调令 10.9049453784
+调任 9.02548032877
+阿尔克 11.4157710022
+玄机 9.0884932966
+料斗 13.2075304714
+值得纪念 11.3357282945
+调价 8.1608847398
+李名逵 13.2075304714
+法不责众 11.598092559
+石油大学 11.9547675029
+调了 13.2075304714
+阅读网 7.34532076017
+康节级 11.7034530746
+湖泊相 12.2912397395
+奶水 10.3743171274
+斯皮纳 13.2075304714
+建康 8.78268383956
+明陈 13.2075304714
+千锤 12.5143832909
+君山 10.2630914922
+被抛弃了 12.1089181827
+原以为 8.87023973058
+结体 10.3453295905
+笔酣墨饱 12.8020653633
+豆沙包 13.900677652
+搔痒 11.2616203224
+五道 10.1164880181
+夏都城 12.8020653633
+调人 11.2616203224
+原班 12.5143832909
+五遍 12.8020653633
+流变性 12.1089181827
+处得来 12.2912397395
+死就死 11.3357282945
+美华裔 13.900677652
+臭味相投 13.2075304714
+柯克斯 12.8020653633
+移防 11.2616203224
+阿木岗 12.5143832909
+调低 9.35738286971
+调位 13.900677652
+装完 11.7034530746
+结亲 9.80633308975
+小容子 11.4157710022
+弗里亚 13.900677652
+卤鸡 12.2912397395
+更像 9.89334446674
+陆徵祥 12.2912397395
+荣西 11.1280889297
+肉联厂 11.7034530746
+心理学史 12.2912397395
+敌忾 12.1089181827
+詹石 8.24468584116
+结果表明 9.25628675283
+傅彩 13.900677652
+充满信心 9.12155415886
+傅彪 13.900677652
+东古儿 13.900677652
+渠引洛 12.8020653633
+华资 11.5027823792
+毛毡 10.4994802703
+乔柏年 9.58318953844
+缝纫线 13.900677652
+舵轮 12.1089181827
+挂记 12.1089181827
+马跑泉 13.2075304714
+侯家庄 11.1926274509
+糠醛 10.8561552143
+揠苗助长 12.2912397395
+盛花期 12.2912397395
+结了 9.5186510173
+一百六十卷 13.2075304714
+预先指定 12.8020653633
+虎门镇 13.2075304714
+二级企业 12.8020653633
+带方 12.8020653633
+爬坡度 9.25628675283
+深蓝 10.3743171274
+靠水吃水 12.1089181827
+音乐奖 13.2075304714
+苏州园林 11.9547675029
+奶液 12.8020653633
+移除 12.2912397395
+原片 12.5143832909
+转攻为守 13.900677652
+调休 11.2616203224
+哈异译 13.2075304714
+华贵 9.69598503258
+切割器 12.2912397395
+冰球队 13.900677652
+圣彼得斯堡 13.900677652
+珠宝店 11.1926274509
+观察镜 10.5684731418
+晋王甘 13.2075304714
+棉签 11.1926274509
+改良品种 12.5143832909
+五金 10.0940151622
+招商 6.59481761929
+缕陈 13.900677652
+五里 9.09665660724
+五重 11.5027823792
+山梨醇 12.8020653633
+原物 10.4041700905
+一九九九年 11.9547675029
+马守贞 13.2075304714
+建筑者 13.2075304714
+结仇 11.8212361103
+克里斯蒂 11.2616203224
+禁放 13.2075304714
+玄明 13.2075304714
+结为 8.85725253506
+单打独斗 11.3357282945
+奏过 11.1926274509
+田听罢 13.2075304714
+克兰福德 13.900677652
+依头顺尾 13.900677652
+贾瑞见 13.2075304714
+索特尔 13.2075304714
+中继器 13.2075304714
+杂税 11.1926274509
+千钧重负 13.900677652
+文化产业 8.1641053545
+大势所趋 9.18217878068
+财迷心窍 11.9547675029
+牢门 10.8096351986
+会议纪要 11.0103058941
+振动台 13.2075304714
+轴突延伸 13.900677652
+三不管 11.3357282945
+结业 10.6818018271
+腿伤 12.1089181827
+大拜拜 13.900677652
+高利率 9.94943393339
+原状 10.6818018271
+桑家瓦 13.2075304714
+俭用 12.8020653633
+结下 9.69598503258
+结上 12.1089181827
+交通工具 8.9102450652
+二马路 11.8212361103
+明霞 11.598092559
+求新 11.1280889297
+无数句 12.1089181827
+由你定 13.900677652
+何光显 12.5143832909
+戈达德 12.2912397395
+机构调整 12.2912397395
+调侃 9.40086798165
+陶芬 12.1089181827
+明面 13.900677652
+竖立 9.55687223012
+七十一岁 12.5143832909
+弧矢焦线 13.900677652
+仲景之 12.5143832909
+体积 7.43142733518
+彭克 11.2616203224
+会恨 11.9547675029
+枫香 11.1280889297
+建德 9.66657114738
+李天策 13.900677652
+安锁子 9.91169360541
+莫谢希 12.8020653633
+农业劳动 10.533381822
+公开性 10.9562386728
+沉积作用 10.2630914922
+不论如何 11.8212361103
+押给 12.1089181827
+结义 9.91169360541
+幸国丈 13.2075304714
+珠宝市 12.8020653633
+拧开 10.3743171274
+何高明 12.8020653633
+此间人士 13.900677652
+二百四十 11.3357282945
+举止洒脱 13.2075304714
+孔范 13.2075304714
+结冻 11.9547675029
+美在 11.4157710022
+顾诸 11.8212361103
+李七长 13.2075304714
+几十亿美元 11.9547675029
+政治气候 12.2912397395
+结冰 8.89673134603
+决定簇 11.598092559
+运动服装 13.2075304714
+上方宝剑 12.8020653633
+丹尼尔 10.4994802703
+沈相公 12.8020653633
+布政史 13.900677652
+物语 10.8096351986
+锻工 12.2912397395
+调停 9.25628675283
+布政司 9.98865464655
+涂长望 13.2075304714
+伏于其 13.2075304714
+结冤 13.900677652
+长安县 11.0103058941
+象人 12.1089181827
+嘲笑声 13.900677652
+管文案 13.2075304714
+国家能源委员会 13.2075304714
+挂钩 8.1641053545
+孔鳐 12.5143832909
+咸通 11.1926274509
+助桀为虐 12.8020653633
+长醉 13.900677652
+拔草 11.8212361103
+物证 10.1630080337
+审题 13.2075304714
+晒谷场 13.900677652
+闪开 9.48183704418
+牙龈 10.0088573539
+竞赛题 13.900677652
+物论 13.2075304714
+头窍阴 13.900677652
+刘牢之 11.1280889297
+吧台 12.2912397395
+于基性 13.2075304714
+体晶 12.8020653633
+案底 13.900677652
+泰兴县 11.9547675029
+办刊 12.1089181827
+吴楚 11.0674643079
+湖南省政府 11.8212361103
+物议 10.9562386728
+荣阳 12.1089181827
+原浆 12.2912397395
+孔鲤 12.8020653633
+尊翁 12.2912397395
+挂记着 13.2075304714
+奥文本杜 12.8020653633
+安夷 12.8020653633
+办到 9.53122979951
+立生 12.8020653633
+克霉唑 12.8020653633
+梦娜 13.900677652
+菜系 10.9049453784
+递眼色 11.5027823792
+人声嘈杂 10.8561552143
+长野 12.8020653633
+绍兴城 12.5143832909
+训练项目 12.2912397395
+美国国家航空航天局 11.2616203224
+调值 12.5143832909
+拐出来 12.5143832909
+倒胃口 12.2912397395
+老江湖 10.3453295905
+分宜县 12.5143832909
+牙本质 13.900677652
+秦寡妇 13.2075304714
+更低 8.90346537821
+戒忌 13.900677652
+三十文 12.5143832909
+阳高境 12.1089181827
+僧院 12.1089181827
+基本要领 12.5143832909
+丹皮尔 13.2075304714
+十辆车 13.2075304714
+舒茨 12.2912397395
+汉阳郡 11.9547675029
+党代会 12.1089181827
+诸臣求 13.2075304714
+更使 12.2912397395
+何愚 12.8020653633
+劈面 10.4666904475
+忻定 11.7034530746
+大泽山 11.4157710022
+映射函数 13.2075304714
+原液 12.8020653633
+希辉 13.2075304714
+何意 9.63799777493
+彭其 7.88208443748
+拿掉 10.642581114
+刘云山 12.2912397395
+奶牛 9.54396882529
+何愁 10.4666904475
+屈侯 13.2075304714
+九列 13.2075304714
+更会 9.54396882529
+新会员 13.2075304714
+更优 11.2616203224
+美国洛斯阿拉莫斯国家实验室 13.2075304714
+顶用 9.91169360541
+总蒸发 13.900677652
+九则 13.2075304714
+明补 13.900677652
+希尔顿酒店 12.5143832909
+骗腿 12.8020653633
+剪贴 11.5027823792
+九分 10.3453295905
+玷辱 10.8096351986
+阿尔伯 12.8020653633
+烧火棍 11.1926274509
+王畿内 12.1089181827
+无容置疑 13.900677652
+结党 10.1630080337
+九制 13.900677652
+文学社 10.604840786
+空盒子 13.900677652
+碑名 13.900677652
+第三十三回 11.9547675029
+笔法 9.17328983326
+祖马 12.2912397395
+美林公司 12.1089181827
+板子 9.77354326693
+诚信度 11.8212361103
+卡尔塔 13.900677652
+长期保持 10.2371160058
+少林功夫 11.1926274509
+电泳图 13.900677652
+盛在 10.8096351986
+计划单列市 10.9562386728
+寄信人 13.900677652
+甘德县 13.900677652
+国际奖 11.1926274509
+九发 10.8096351986
+因年 11.1926274509
+五边 12.8020653633
+北投区 12.8020653633
+进而言之 13.2075304714
+蒙古人 8.36334338496
+吆喝 8.06879517469
+遁隐 12.1089181827
+麦当劳 10.0294766411
+联队长 12.1089181827
+常少卿 11.8212361103
+吆喊 12.8020653633
+利物浦港 13.900677652
+何患 10.9049453784
+针织品 10.642581114
+九号 10.7226238216
+李梅 11.598092559
+九台 10.9049453784
+拟请 12.1089181827
+笔洗 11.5027823792
+原水 12.5143832909
+蔡复 13.900677652
+调入 9.24671730182
+一尸两命 13.900677652
+调养 9.34680076038
+托蒂 13.2075304714
+中共十四大 11.9547675029
+九叠 11.9547675029
+关注度 8.85725253506
+五辆 12.5143832909
+封建王朝 9.14708746087
+有所创造 12.5143832909
+三化螟 11.4157710022
+禅味 13.900677652
+九只 10.9049453784
+三汊河 12.2912397395
+圆雕 9.96885201925
+九原 10.6818018271
+大操大办 13.2075304714
+段儿 12.5143832909
+磁体 9.89334446674
+冯保坐 11.7034530746
+更事 13.900677652
+丹毒 10.9049453784
+神经学 12.2912397395
+拉赫莫诺夫 12.8020653633
+盖尤斯 12.5143832909
+拟设 12.8020653633
+捍卫者 12.8020653633
+添有 13.900677652
+灵验 9.71102290995
+中央革命军事委员会 10.2897597393
+明视 12.5143832909
+张爱萍 12.1089181827
+封侯非 13.900677652
+拟议 10.765183436
+发梢 11.0103058941
+拿手 9.33632946051
+猪饲料 10.765183436
+袁雪芬 12.2912397395
+明角 11.8212361103
+蒂格赖 12.2912397395
+僧鞋 11.2616203224
+拟订 10.0294766411
+伊洛河 11.7034530746
+第一百九十六条 13.900677652
+调减 7.93967231235
+忽地 8.34771806705
+可靠消息 11.7034530746
+脐带血 13.2075304714
+库夫拉 13.2075304714
+瘴气 11.0103058941
+六十多块 13.2075304714
+卡尔夫 13.900677652
+骑兵队 11.1926274509
+男性用品 13.900677652
+吴县人 11.7034530746
+九十 10.1871055853
+僧面 12.8020653633
+九千 11.0674643079
+何怪 13.2075304714
+公布栏 13.900677652
+更久 10.6818018271
+伊本吉 13.900677652
+拐弯儿 12.2912397395
+梦寐 11.5027823792
+布希曼 11.9547675029
+九卷 11.9547675029
+曹遵 12.5143832909
+原油 6.81896906587
+卤肉 12.2912397395
+九卿 9.61021821083
+长途 8.7245279194
+宁冈县 12.2912397395
+调出 9.65218240993
+瘦西湖 11.1280889297
+单点系泊 13.2075304714
+金玉良缘 12.8020653633
+卡尔多 13.2075304714
+塞班岛 11.0103058941
+青蛇 12.1089181827
+五载 11.4157710022
+同德县 13.900677652
+阿尔丰 13.900677652
+体柱 13.2075304714
+环境 5.18201408493
+目无王法 13.2075304714
+更丑 13.900677652
+地上天宫 12.8020653633
+德鲁兹 11.8212361103
+帕航 13.2075304714
+坦波夫 12.5143832909
+吃起饭来 13.2075304714
+办厂 11.598092559
+复兴报 12.2912397395
+找点活干 13.2075304714
+带笑 10.2371160058
+德鲁克 12.1089181827
+民族融合 10.2630914922
+母所生 11.3357282945
+九匹 13.900677652
+烟消云散 9.61021821083
+留条 10.9049453784
+门可罗雀 11.4157710022
+考试卷 13.2075304714
+淳佑 13.2075304714
+加工点 11.5027823792
+原注 12.8020653633
+方志敏 11.5027823792
+晋察冀 10.1394775363
+卜居 12.5143832909
+平陈之 13.2075304714
+拔节 11.1280889297
+阿尔万 12.8020653633
+子司业 12.5143832909
+希贤 13.900677652
+纷纷攘攘 11.8212361103
+浅显易懂 13.2075304714
+阳二阴 12.2912397395
+调剂 9.62401153296
+周公致 12.8020653633
+十一烯酸 13.900677652
+庙寺 13.2075304714
+贬抑 10.8096351986
+王煦华 11.2616203224
+底特律 9.25628675283
+勘测 9.58318953844
+呵呵大笑 9.94943393339
+芝麻官 12.2912397395
+徐祯卿 11.9547675029
+冰硼散 12.1089181827
+水毛花 13.2075304714
+汝之能 12.8020653633
+有色玻璃 12.5143832909
+审验 11.5027823792
+庄股 11.8212361103
+几十几百 12.8020653633
+俗称 7.30763311783
+吹吹拍拍 12.2912397395
+封炎帝 13.2075304714
+李祖陶 13.2075304714
+土地类型 11.4157710022
+阎敬铭 10.604840786
+棉纤维 11.1926274509
+余淡心 11.8212361103
+故常 10.642581114
+女囚 13.2075304714
+抵抗力量 11.1280889297
+地上茎 11.0103058941
+王昌 13.2075304714
+小蒙蒙 10.2117981979
+沃沃 12.8020653633
+彭冲 12.8020653633
+一百六十万 12.8020653633
+门墩儿 13.2075304714
+寡欲 11.2616203224
+腻烦 10.8096351986
+鼾息 13.2075304714
+往后走 12.1089181827
+超计划 11.598092559
+腰椎病 13.2075304714
+忽哨 10.9049453784
+竖条 13.900677652
+至公无私 13.900677652
+一百六十个 12.8020653633
+拔脚 10.604840786
+惊惶无措 13.2075304714
+牛首山 11.8212361103
+角砾岩 10.765183436
+结发 10.3743171274
+克莱默 12.8020653633
+城上城 11.4157710022
+必然之事 13.900677652
+不求上进 12.1089181827
+华通 10.765183436
+百里洲 12.5143832909
+海平线 12.1089181827
+川端 12.1089181827
+沃河 13.900677652
+女团 13.900677652
+调到 8.52539924429
+闭上 8.86372504956
+调制 8.96620371885
+三十六天 12.2912397395
+禅城 13.2075304714
+同功酶 12.8020653633
+於制刀 13.2075304714
+吉利话 11.7034530746
+五谷 9.5062284973
+王满银 9.00283785202
+徐杰 13.2075304714
+何振 12.5143832909
+卤莽 11.9547675029
+伊洛潘 13.2075304714
+华都 12.5143832909
+班士子 12.2912397395
+一言丧邦 13.900677652
+圆锉 13.900677652
+鼓足勇气 10.604840786
+柳绿桃红 13.2075304714
+霉烂 10.5684731418
+诸王军 12.8020653633
+明言 10.2117981979
+圆锹 12.1089181827
+三月不知肉味 12.8020653633
+寡母 11.5027823792
+聊天记录 10.9562386728
+甲乙双方 13.900677652
+企业界 9.89334446674
+王光祈 12.8020653633
+玄笺 12.8020653633
+圆锥 9.35738286971
+平平淡淡 11.1280889297
+福清市 12.5143832909
+圆锯 13.900677652
+谈笑之间 12.8020653633
+面窄 12.8020653633
+盛唐 9.30555780184
+川乌 11.9547675029
+环宇 12.1089181827
+扬眉剑出鞘 12.8020653633
+救世军 12.1089181827
+安全门 11.9547675029
+世谔 13.2075304714
+塾师 10.9049453784
+圈里 9.94943393339
+九倍 12.2912397395
+拉布拉多 11.0103058941
+公侯止 13.2075304714
+移译 13.900677652
+调动 7.77599426108
+字纸篓 13.900677652
+富兰克 13.900677652
+多利亚 12.1089181827
+姜日广 10.1871055853
+张永红 9.96885201925
+卤菜 12.5143832909
+达到目标 11.0103058941
+从化市 13.2075304714
+体操 9.58318953844
+地裂山崩 12.5143832909
+德纳 12.1089181827
+横线 10.2897597393
+西瓦利 12.5143832909
+花容月貌 11.1926274509
+红瓦白 13.2075304714
+坚信不移 12.8020653633
+调协 13.2075304714
+明订 13.900677652
+徐来 13.900677652
+调升 10.0940151622
+刘老师 12.2912397395
+加成聚合 11.9547675029
+圈选 13.900677652
+棉服 12.5143832909
+黄连素 11.4157710022
+老把戏 13.900677652
+圆钉 13.900677652
+明讲 12.2912397395
+衔泥 12.5143832909
+五趟 13.900677652
+说法不一 9.96885201925
+板墙 12.1089181827
+化验员 13.900677652
+柏皇 13.2075304714
+稽查队 12.8020653633
+作曲家 8.28027678626
+托卡塔 11.9547675029
+生产队 9.59661255877
+纤秀 12.5143832909
+耆宿 12.1089181827
+圆钢 11.7034530746
+办公 7.98447558937
+顶盖 10.642581114
+脏字 11.5027823792
+自我认识 12.1089181827
+黑风山 11.5027823792
+振动体 13.900677652
+叫来 8.53470163695
+十四行 11.8212361103
+李存孝 12.2912397395
+致开幕词 12.8020653633
+调匀 10.642581114
+调包 13.2075304714
+打人者 12.2912397395
+五路 9.43476953332
+徐村 11.4157710022
+戒备森严 10.1394775363
+梦游者 12.8020653633
+明说 9.37888907493
+贾府之 12.5143832909
+牺牲掉 11.9547675029
+月经带 13.900677652
+馨香 10.765183436
+王萧嶷 13.2075304714
+信号处理器 11.9547675029
+菲格 12.8020653633
+明证 10.0088573539
+没有特权 13.2075304714
+断裂强度 12.8020653633
+洛美协定 12.2912397395
+明诚 12.8020653633
+闷酒 10.9562386728
+棉条 11.9547675029
+杰夫 11.598092559
+该文 10.4994802703
+板壁 10.4994802703
+孙慎行 12.5143832909
+年终 8.3555002075
+认帐 12.8020653633
+姑息迁就 11.7034530746
+五六十岁 12.1089181827
+片基 12.8020653633
+计日而待 12.8020653633
+杰姆 12.8020653633
+四仰八叉 11.4157710022
+阿杜德 11.8212361103
+树桠 12.1089181827
+堂而皇之 10.0940151622
+调取 10.8561552143
+梦姑 9.18217878068
+立体化学 10.8096351986
+一两间 12.8020653633
+华里 10.8096351986
+华野 12.5143832909
+养蚕织 13.900677652
+宝严寺 12.8020653633
+转播塔 13.900677652
+牛股 9.59661255877
+巴彦淖尔盟 10.4994802703
+宣慰司 9.91169360541
+彩纸 13.2075304714
+柏树 9.72629038208
+九六 12.5143832909
+调号 12.8020653633
+节节上涨 12.8020653633
+防止网络 13.2075304714
+调压 11.0674643079
+橡皮泥 13.900677652
+一个终日 13.2075304714
+顺之者昌 13.900677652
+英法意 13.900677652
+五起 11.598092559
+许美人 12.8020653633
+黑剑 13.900677652
+榆树林子 12.2912397395
+快速化 13.900677652
+沃洛 12.2912397395
+自我保健 11.7034530746
+价格行情 11.5027823792
+一万一千五百二十颗 13.2075304714
+贬损 11.4157710022
+记录时间 11.7034530746
+永子 10.8561552143
+盛名 8.78268383956
+首回合 12.5143832909
+巴伦斯 13.900677652
+捻子 10.8096351986
+挂靠 10.5684731418
+有瑞利 13.2075304714
+挂面 10.1871055853
+群众团体 10.8096351986
+调去 11.0103058941
+手无寸铁 10.8096351986
+富贵病 11.7034530746
+精选本 13.900677652
+条陈 9.46986085313
+富于幻想 11.9547675029
+沃洲 12.5143832909
+喻理 13.2075304714
+藉以 10.765183436
+以手加额 11.7034530746
+周公老 12.8020653633
+满负荷 10.0720362555
+揖拜 12.8020653633
+笔格 13.2075304714
+何方 8.75901409547
+绍兴县 11.598092559
+淘金者 12.1089181827
+菲律宾海 12.1089181827
+齐心合力 11.3357282945
+祝龙 10.9049453784
+梦幻 9.16447920358
+爱建 9.93038573842
+九四 12.1089181827
+苏门答腊岛 9.80633308975
+财务人员 10.5684731418
+干鲜果品 11.2616203224
+煤炭法 13.2075304714
+一溜风 12.8020653633
+纤维 7.25819085061
+复古主义 11.9547675029
+弃明投暗 13.900677652
+纤绳 11.8212361103
+鸣金收军 10.6818018271
+纤细 9.11318590919
+带给 8.1417758781
+燕乘胜 12.8020653633
+泼进 13.900677652
+于公卿 12.8020653633
+结喉 13.900677652
+带练 13.900677652
+欧文堡 13.2075304714
+夏满芒 13.2075304714
+九团 12.8020653633
+调味 9.16447920358
+时信哥 12.2912397395
+高丽国 11.598092559
+谈玄理 12.2912397395
+调合 11.3357282945
+央行 5.77386393125
+调名 12.2912397395
+纤纤 11.0103058941
+何时 7.33823355828
+参加国 11.1280889297
+带线 12.8020653633
+长安城 9.23723855786
+官载师 13.2075304714
+泼辣 9.53122979951
+长门 11.4157710022
+何日 9.53122979951
+调向 12.2912397395
+华阳 10.1394775363
+华阴 10.533381822
+设定值 13.2075304714
+能跟楚 13.2075304714
+闪存 12.1089181827
+淡褐色 11.1280889297
+布商麇 12.8020653633
+薄惩 11.8212361103
+过热液体 13.2075304714
+小鸟球 13.900677652
+床第之欢 13.900677652
+河卵石 13.2075304714
+编纂家 12.8020653633
+十四载 11.0103058941
+缠脚 11.8212361103
+惹人注目 11.0674643079
+路程遥远 12.5143832909
+寡淡 11.3357282945
+黄河路 10.0720362555
+黄玉昆 13.2075304714
+冯保回 12.5143832909
+跨平台 12.8020653633
+躲不开 10.9562386728
+农村公社 10.6818018271
+图形适配器 13.900677652
+首都北京 10.642581114
+禁绝 10.0088573539
+奶白 13.2075304714
+溯江而上 11.4157710022
+李岩召 13.2075304714
+明谊 12.5143832909
+多时辰 11.3357282945
+茶科所 11.598092559
+华雄 11.9547675029
+七八颗 13.900677652
+山茶花 11.0674643079
+板式 9.61021821083
+幌子 9.53122979951
+巴生河 13.900677652
+明谕 11.2616203224
+五言 9.91169360541
+暗视场 13.900677652
+睾丸 8.93783302172
+剀切 11.2616203224
+调和 8.13235665618
+明中叶 9.62401153296
+克莱顿 12.2912397395
+太常音 13.2075304714
+闷雷 10.2371160058
+方今 10.4994802703
+公誓辞 13.2075304714
+西瓦吉 12.1089181827
+水晶制品 12.8020653633
+住在一起 9.53122979951
+迈斯特 13.900677652
+金属学 12.5143832909
+包法利 11.8212361103
+尹为世 12.8020653633
+禁约 11.5027823792
+佐洛 13.900677652
+梦庚 12.2912397395
+方从 11.9547675029
+连瞎子 13.900677652
+三维线 13.900677652
+李斯特 10.3171587135
+满身 8.75318317516
+何故 8.230796729
+染色性 12.1089181827
+从水生 13.2075304714
+拉菲特 11.8212361103
+霎那 13.900677652
+马鸣寺 12.5143832909
+五记 13.900677652
+体育器材 12.8020653633
+双袖 11.1926274509
+无耻之尤 11.9547675029
+原西河 10.8096351986
+祖龙 11.5027823792
+牙髓 11.5027823792
+行李车 11.9547675029
+协防 12.2912397395
+文学系 10.2117981979
+贬斥 10.2897597393
+捞一票 13.900677652
+原核 9.93038573842
+原样 9.77354326693
+任耶拿 12.2912397395
+犒军 9.84023464143
+火烧眉毛 11.5027823792
+小邦威 11.4157710022
+移调 11.9547675029
+世说 12.5143832909
+云谷寺 12.5143832909
+制度 5.16692252061
+长针 11.8212361103
+野菜 9.23723855786
+蹦床 13.2075304714
+平整机 13.2075304714
+铁皮屋 12.5143832909
+抵赖 10.533381822
+拒绝给予 12.8020653633
+明路 12.2912397395
+佐治 11.598092559
+贾纳五 12.8020653633
+调唆 10.604840786
+师宗 13.2075304714
+三星队 13.2075304714
+五百五十万元 13.2075304714
+深黄 11.7034530746
+原案 12.5143832909
+奈良县 12.2912397395
+菜种 13.900677652
+黟县 11.1280889297
+芦柑 12.1089181827
+波司登 10.9562386728
+打拳 11.4157710022
+年纸 13.900677652
+贩子 9.38981814546
+山资纪 12.8020653633
+卡桑德拉 12.8020653633
+冥王星 10.1630080337
+新婚燕尔 11.7034530746
+喷薄而出 11.1926274509
+反射 7.61096208107
+外研社 13.900677652
+叶尔羌河 10.1630080337
+王萧子 13.2075304714
+铭万 13.2075304714
+波跃浪 13.900677652
+商民 10.4349417492
+鼎足之势 11.598092559
+案子 8.45394028031
+立案侦察 13.900677652
+第一响 13.2075304714
+顶灯 11.1926274509
+工厂倒闭 11.8212361103
+多洛夫 13.900677652
+写出去 13.900677652
+板带 13.900677652
+计量站 13.2075304714
+问名 12.8020653633
+十四身 13.2075304714
+芯线 12.8020653633
+女儿 6.01572470622
+听起 13.2075304714
+情深意切 13.2075304714
+禅僧 10.9049453784
+磁流体 10.1630080337
+厨师长 12.5143832909
+结合 5.73873185251
+巧姐儿 10.4666904475
+年纪 6.82910428776
+控制指令 11.4157710022
+数百万美元 12.5143832909
+环己烷 11.0103058941
+鳞鳞 13.900677652
+美日韩 12.8020653633
+报仇雪耻 11.598092559
+扫兴 9.40086798165
+裤档 13.900677652
+央视 8.1641053545
+王恭自 13.2075304714
+肺鱼 10.8561552143
+第三十一回 11.9547675029
+环岛 10.3453295905
+原棉 11.5027823792
+某种事物 12.1089181827
+挑战赛 11.7034530746
+明起 11.9547675029
+维他命 10.0088573539
+储安平 12.8020653633
+一啃 13.2075304714
+梦得 13.900677652
+掌王命 13.2075304714
+钟罩状 13.2075304714
+大腹便便 11.1926274509
+国家劳动和社会保障部 13.900677652
+那曲县 12.2912397395
+车前子 10.9562386728
+九场 13.900677652
+连出 12.1089181827
+夺食 12.2912397395
+需求方 10.9049453784
+抬棺 11.4157710022
+蔡州 10.3171587135
+体总 13.900677652
+祖鲁 12.1089181827
+索氏体 12.8020653633
+露珠儿 12.5143832909
+城防工事 12.5143832909
+闪失 9.48183704418
+长鞭 12.2912397395
+九品 9.16447920358
+奶瓶 11.3357282945
+毕众敬 13.900677652
+九响 13.900677652
+咸阳 8.26946587015
+特尔科 13.2075304714
+体性 11.8212361103
+柘林 12.1089181827
+忙得很 11.7034530746
+制革厂 12.5143832909
+建国方略 11.3357282945
+葡萄酒 8.230796729
+巴生港 13.2075304714
+拾不得 12.8020653633
+晋卿 11.2616203224
+环形 8.60236028543
+燕平凉 12.2912397395
+抹不开 11.9547675029
+电工设备 10.4994802703
+五袋 13.900677652
+伏阶 13.900677652
+白家巷 13.2075304714
+半秒钟 13.900677652
+体态 8.9308643524
+康复者 11.598092559
+山环合 12.8020653633
+蒙尘 11.5027823792
+卡鲁 12.5143832909
+黑咕隆咚 10.8561552143
+杰尔 11.7034530746
+联邦区 11.9547675029
+长音 11.8212361103
+体息 12.2912397395
+叛党叛国 13.2075304714
+希西 13.2075304714
+盛冈 13.900677652
+封赵国 12.2912397395
+歉仄 13.900677652
+一万册 13.2075304714
+体恤 10.2371160058
+伊金霍洛旗 11.8212361103
+吧嗒 10.765183436
+盛况 9.32596667347
+夺魄 13.2075304714
+瓜子壳 11.9547675029
+尊称 9.04086524761
+世袭 8.00903344015
+夺魂 11.8212361103
+耀县 10.7226238216
+凤妈 12.8020653633
+湟中 10.765183436
+魅力四射 13.900677652
+夹竹桃 10.0294766411
+阿诺斯 9.58318953844
+潘金莲 11.5027823792
+隋代曾 12.8020653633
+南国风光 12.5143832909
+腓肠肌 11.9547675029
+筹议 11.5027823792
+汉廷悬 13.2075304714
+晋军渡 12.8020653633
+九员 13.900677652
+雾里看花 11.1280889297
+霍华德 10.604840786
+吧唧 12.2912397395
+竖排 11.9547675029
+结在 11.598092559
+开发方法 12.5143832909
+调回 9.62401153296
+拉弥斯 13.2075304714
+筹设 12.1089181827
+环志 12.8020653633
+利则利 13.900677652
+族人 8.45825994145
+费尽心力 11.598092559
+宝石花 11.9547675029
+先来后到 12.5143832909
+倚靠在 11.7034530746
+僧道 9.43476953332
+何望 13.2075304714
+蔡庆 10.642581114
+盛典 9.84023464143
+幸得众 13.900677652
+金竹公 13.2075304714
+灰黑色 9.7898037878
+儿童文学 10.533381822
+何月 13.900677652
+阿根廷 7.95003509939
+晋南 9.80633308975
+地摊货 13.900677652
+物资 7.19015454252
+很静 10.4666904475
+物贸 11.2616203224
+譬如 8.1608847398
+晋王治 13.2075304714
+长靴 11.598092559
+何杰 13.2075304714
+刀背 11.0103058941
+物质 5.6932758186
+忧愤 10.3743171274
+卡尔平 12.2912397395
+发送数据 13.2075304714
+母女之情 13.2075304714
+随机抽样 11.7034530746
+拟调 13.900677652
+长靠 12.5143832909
+掩门而去 13.2075304714
+格浦尔 12.1089181827
+无明火 13.900677652
+它用 9.84023464143
+满荡荡 13.2075304714
+奥尼 11.598092559
+五街 13.900677652
+结块 11.3357282945
+忻州 10.1630080337
+葱绿 10.6818018271
+五行 8.49350588052
+移过 11.4157710022
+昂仁县 12.1089181827
+叹一口气 9.56994431169
+圈闭 11.1280889297
+腔调 9.44633035572
+在某处 12.2912397395
+明辨 11.1280889297
+资阳县 13.2075304714
+破土动工 11.2616203224
+那紫微 13.2075304714
+翻翻看 13.900677652
+脱盐 11.5027823792
+客观主义 12.8020653633
+女厕 13.900677652
+忧惧 10.765183436
+卡尔德 12.5143832909
+贩夫 13.2075304714
+南木林 13.2075304714
+波伏瓦 12.8020653633
+板岩 9.49395840471
+卜氏 13.2075304714
+环幕 12.5143832909
+货柜车 13.900677652
+华阴东 11.7034530746
+明辉 11.8212361103
+新会县 11.3357282945
+宙斯 9.53122979951
+蓝屏 12.8020653633
+王麻子 12.8020653633
+内地税 10.8561552143
+眦裂 13.2075304714
+国展 12.8020653633
+何暇 13.2075304714
+任开普 13.900677652
+粟二石 12.5143832909
+无光采 13.900677652
+何曼 10.6818018271
+低姿势 13.900677652
+柴儿 10.8096351986
+神经嵴 11.8212361103
+登记注册 10.3171587135
+柴世宗 12.1089181827
+美如画 12.5143832909
+女友 9.30555780184
+忧患 10.2630914922
+门头 10.8561552143
+女双 13.900677652
+拔营 10.765183436
+意外事件 10.1630080337
+吕潭 12.8020653633
+活命要紧 13.900677652
+懒得 8.78268383956
+帽沿儿 13.900677652
+吧哒 13.2075304714
+女史 10.8561552143
+五角 10.533381822
+升空 9.6811699468
+钗头凤 13.2075304714
+非学历 13.900677652
+明远 9.72629038208
+承运人 10.9562386728
+菜篮 12.1089181827
+爱琳娜 12.5143832909
+菲利浦斯 12.2912397395
+拔萃 11.8212361103
+百舌鸟 12.1089181827
+帕蒂 11.598092559
+遁逃 11.1926274509
+藻绘 12.2912397395
+戴金冠 12.5143832909
+郭汜令 13.2075304714
+锚杆 11.9547675029
+长阳 8.29120585679
+近乎零 12.5143832909
+欧洲委员会 11.9547675029
+盗匪 10.7226238216
+言孟德 13.2075304714
+张紫阳 12.5143832909
+忧恤 13.2075304714
+物象 9.85762638414
+任群牧 13.2075304714
+初步设计 10.9562386728
+长队 10.4041700905
+叶青谷 13.2075304714
+群鸟 12.1089181827
+卢旺达 10.1164880181
+裱画 12.1089181827
+圈钱 9.29550746599
+七十余万斤 13.2075304714
+圈内人 12.5143832909
+运输区划 13.900677652
+何昌 11.5027823792
+高档礼品 13.900677652
+丢盔弃甲 12.2912397395
+树上开花 13.900677652
+皮厚肉 13.2075304714
+顶牛 12.2912397395
+弯腰 8.67493097826
+商旗昌 11.9547675029
+村民 7.28595205177
+李章达 12.8020653633
+石镜镇 12.8020653633
+于外邦 13.2075304714
+菜筐 13.2075304714
+长陵 10.5684731418
+普通纸 12.2912397395
+案外 13.900677652
+女单 12.2912397395
+任人唯 12.5143832909
+闷闷 9.96885201925
+班巴拉 12.1089181827
+穆罕默德 8.32472854883
+奋笔疾书 11.598092559
+攻上来 11.9547675029
+从重从快 12.5143832909
+乌孙诸 12.5143832909
+低收益 10.604840786
+蔡卓妍 12.5143832909
+带累 10.4349417492
+被害者 11.598092559
+察见渊鱼 13.900677652
+金发碧眼 11.2616203224
+侯宝林 12.1089181827
+胸牌 12.5143832909
+设计概算 13.2075304714
+案头 10.0720362555
+五百二十门 13.900677652
+葱翠 12.1089181827
+何晏 10.4349417492
+板屋 12.2912397395
+化学成分 8.63798746307
+教科文部 13.900677652
+脏得 11.3357282945
+副性征 11.9547675029
+板层 13.900677652
+沙悟净 11.1926274509
+伦家族 11.598092559
+使用不当 11.1926274509
+梅河口市 12.1089181827
+停着 9.98865464655
+帕诺 13.900677652
+寻寻法 13.2075304714
+白纱帘 12.8020653633
+遑论 11.2616203224
+乱丝 12.8020653633
+肚子痛 11.7034530746
+教育经费 10.642581114
+体温 8.26946587015
+发酵剂 13.2075304714
+黑幽幽 11.9547675029
+迈斯纳 12.2912397395
+溽热 13.900677652
+多渠道 9.69598503258
+餐饮行业 11.7034530746
+具体劳动 11.5027823792
+哈尔滨市委 12.2912397395
+第四十六届 12.5143832909
+带狗 12.1089181827
+禁物 12.1089181827
+卖花女 13.2075304714
+卢受晋 13.2075304714
+纽约市政府 13.900677652
+乱丢 11.8212361103
+受试者 11.2616203224
+搜集情报 11.9547675029
+数量级 9.56994431169
+破产案 9.77354326693
+例行工作 12.1089181827
+梦到 11.0103058941
+扶贫开发 11.0103058941
+指示器 10.3743171274
+带状 8.4801426527
+梅加拉 11.8212361103
+戒网瘾 13.2075304714
+菜瓜 12.8020653633
+行李舱 12.5143832909
+三权分离 13.2075304714
+相依为命 9.69598503258
+原故 9.12999302751
+明胶 10.8561552143
+文渊阁 9.80633308975
+衣带诏 11.5027823792
+盛德 10.5684731418
+王拔都 12.5143832909
+景明中 13.2075304714
+捏坏 13.900677652
+利科罗 13.900677652
+赵姨奶奶 11.9547675029
+左轮手枪 10.604840786
+映照 9.26594866375
+菜瓮 13.900677652
+吴川县 13.2075304714
+音乐书 12.8020653633
+中立性 12.2912397395
+播种期 11.7034530746
+克兰河 12.1089181827
+原料 6.24860690586
+宝子碑 12.5143832909
+口齿伶俐 11.2616203224
+锈斑 11.7034530746
+金属圈 13.900677652
+脚腕子 12.2912397395
+军用车 11.8212361103
+王喜忙 12.1089181827
+单身贵族 12.5143832909
+蒙朕 12.8020653633
+呛起来 13.900677652
+裘颓 13.2075304714
+原文 8.97342396682
+毛栗 13.900677652
+乱事 10.8561552143
+一个排 10.4994802703
+公有土地 12.5143832909
+女将 9.32596667347
+结夥 13.2075304714
+扰乱治安 12.5143832909
+西德尼 12.8020653633
+女尸 8.34771806705
+锚桩 13.900677652
+女尼 10.9049453784
+六十多年 11.5027823792
+刀身 11.4157710022
+牙面 12.1089181827
+维埃纳 13.2075304714
+无性繁殖 10.0088573539
+乱交 13.2075304714
+商王畿 12.1089181827
+滚瓜溜圆 13.900677652
+知心人 11.7034530746
+移至 8.97342396682
+水网纵横 13.900677652
+夺门 10.4349417492
+吉凶难卜 12.8020653633
+板卷 13.900677652
+安全形势 10.8561552143
+家长会 12.5143832909
+募兵 10.4349417492
+忻口 10.9049453784
+缠足 10.6818018271
+盛开 9.18217878068
+调增 12.8020653633
+捉下来 13.900677652
+孔塔多 12.2912397395
+糠虾 11.5027823792
+难以达到 10.765183436
+奈良市 12.8020653633
+采暖设备 13.2075304714
+施以青 13.2075304714
+纳役钱 12.8020653633
+夫妻之情 11.2616203224
+脏东西 10.7226238216
+五虎 11.4157710022
+王押司 12.5143832909
+先有 9.20019728618
+断裂点 13.900677652
+觉悟程度 12.8020653633
+原旧 11.7034530746
+八一队 13.900677652
+你死我活 9.54396882529
+罗林逊 13.900677652
+音乐会 9.03314320152
+乱涨价 12.8020653633
+寡恩 11.5027823792
+云开日出 12.8020653633
+示踪原子 12.8020653633
+刘老吉 12.2912397395
+中医院 9.59661255877
+孔门 11.3357282945
+奥古斯特 11.0103058941
+弹涂鱼 11.7034530746
+牙雕 10.5684731418
+吉布 11.598092559
+堪培拉 10.1871055853
+卡尔内 12.5143832909
+蓄水位 11.4157710022
+非实质 12.8020653633
+马王堆 9.65218240993
+王夷甫 13.2075304714
+缺页 12.8020653633
+倭奴 12.1089181827
+不知所以 12.5143832909
+李锁爷 11.7034530746
+调好 10.9562386728
+乱伦 11.3357282945
+何梅 11.5027823792
+怀亚特 13.2075304714
+贾兰坡 12.5143832909
+九寨 10.765183436
+梦华 11.0674643079
+往北方 11.2616203224
+长臂虾 12.5143832909
+肺部 9.21854642485
+不知所云 10.9049453784
+忽忽 11.2616203224
+逃不了 11.0103058941
+明臣 11.1280889297
+袁大督 13.900677652
+结霜 13.900677652
+笔数 11.5027823792
+调处 10.1394775363
+商河 11.7034530746
+满足要求 11.2616203224
+肘窝 12.1089181827
+格莱尔 13.2075304714
+毛样 13.2075304714
+秦昭襄 11.8212361103
+不宣而战 10.9562386728
+边值问题 10.9049453784
+带环 12.1089181827
+九宵 13.900677652
+建筑队 11.1280889297
+九家 9.94943393339
+玄烨 10.5684731418
+基础学科 10.4349417492
+青少年宫 12.8020653633
+枷锁 9.72629038208
+原始型 12.8020653633
+传代培养 13.900677652
+女巫 10.8096351986
+长风 10.9049453784
+黄秋雅 10.4041700905
+甬台温 13.900677652
+飘游 11.8212361103
+互联网站 11.8212361103
+宝山钢铁总厂 11.0103058941
+张鼓峰 12.5143832909
+九宫 9.75754292558
+调头 9.96885201925
+积极性 7.75864024639
+九孔 12.2912397395
+耆儒 13.900677652
+排污权 12.2912397395
+披枷戴锁 12.8020653633
+板刷 12.2912397395
+滏阳新河 11.8212361103
+何样 12.8020653633
+物色 9.35738286971
+白鹿联 12.8020653633
+开一开 13.900677652
+八百块 13.900677652
+非专职 13.900677652
+常誓继 13.2075304714
+专横跋扈 11.2616203224
+埃卢亚尔 13.900677652
+菲拉 11.8212361103
+神经原 12.1089181827
+寡情 11.9547675029
+菜田 11.7034530746
+盛年 11.9547675029
+班巴河 13.900677652
+何栗 10.8561552143
+领港员 12.5143832909
+俗物 11.1280889297
+王同享 13.2075304714
+搜索网 13.900677652
+静静的 9.54396882529
+一百八十 11.1926274509
+四五枝 13.2075304714
+绍兴市 11.0103058941
+麦当娜 12.5143832909
+海子湖 12.5143832909
+羽毛未丰 13.900677652
+麻黄根 13.900677652
+待理不理 12.2912397395
+宅园 11.598092559
+项目经理 10.8561552143
+甲酰胺 12.5143832909
+四倍体 11.9547675029
+长顺 9.84023464143
+长项 12.2912397395
+采回来 13.2075304714
+飒爽英姿 12.1089181827
+敢死队 7.1038539337
+半休 13.900677652
+肾下垂 12.8020653633
+有空 9.44633035572
+办完 9.21854642485
+撒种 11.9547675029
+司马王甫 13.2075304714
+佛骨 11.9547675029
+茶馆 8.87679713113
+隋唐演义 12.1089181827
+实足 12.5143832909
+德鲁奇 13.900677652
+艳照 11.9547675029
+爷们儿 11.8212361103
+金属器 11.8212361103
+平胃散 12.2912397395
+菜畦 12.1089181827
+中牟县 9.49395840471
+检测时间 12.2912397395
+染色法 11.9547675029
+打药 13.900677652
+托少平 13.2075304714
+何桂 12.8020653633
+龈切除术 13.900677652
+磨擦力 13.2075304714
+日耳曼人 9.54396882529
+押款 12.5143832909
+法律化 11.598092559
+中央信托 13.900677652
+铁汉子 11.3357282945
+感于 11.7034530746
+原有 6.64015505389
+葱爆 12.2912397395
+水泼不进 12.1089181827
+媲美 9.36807815882
+棉子油 13.900677652
+自传式 13.2075304714
+毛诗序 12.2912397395
+鸡零狗碎 11.598092559
+环卫 10.1630080337
+感人 9.27570483869
+削短 13.900677652
+禁火 11.8212361103
+小书童 13.2075304714
+衬衫 9.12999302751
+坞墩 13.900677652
+原本 6.82910428776
+原木 10.2371160058
+海峡交流基金会 11.9547675029
+遥遥在望 12.1089181827
+孔雀 8.65893063692
+地缝里 12.8020653633
+丙腈 13.2075304714
+结对 11.5027823792
+刀豆 11.598092559
+房地产界 10.8561552143
+带点 9.61021821083
+拒不执行 11.5027823792
+磷酸解 13.900677652
+板凳 8.89004235788
+原材 12.8020653633
+十六字诀 11.8212361103
+斯科蒂 12.8020653633
+秀山土家族苗族自治县 13.900677652
+环化 11.2616203224
+报告文学 10.4041700905
+深重 9.27570483869
+六十多岁 10.4666904475
+腔肠 12.2912397395
+窖子 12.1089181827
+调调儿 13.2075304714
+火灾事故 11.9547675029
+李志民 13.900677652
+孔隙 9.36807815882
+痹证 11.8212361103
+安帝永 10.8561552143
+再试一次 13.2075304714
+红药水 12.5143832909
+玄珠 12.1089181827
+虹膜炎 13.900677652
+颜师古 11.7034530746
+环区 12.8020653633
+原来 5.04373189582
+年产能力 11.9547675029
+陈敏任 12.8020653633
+原条 13.900677652
+安乐窝 11.598092559
+板儿 10.4994802703
+理过其辞 13.900677652
+帕西 11.8212361103
+加格尔 13.2075304714
+顶罪 12.5143832909
+孔祥星 13.2075304714
+库班河 12.5143832909
+九塘 12.8020653633
+禅心 11.3357282945
+拇战 13.2075304714
+卡迈勒 13.2075304714
+树形象 13.2075304714
+特务连 12.8020653633
+祖逖 11.1280889297
+圣赫勒拿岛 11.1280889297
+五营 10.9562386728
+普通班 12.8020653633
+衬裙 12.8020653633
+书剑飘零 12.8020653633
+衬裤 11.7034530746
+白生 12.8020653633
+女帽 12.5143832909
+喀斯特水 11.598092559
+甩手 9.63799777493
+洛夫娜 13.900677652
+四十多米 13.900677652
+铁琴铜 12.5143832909
+幕客 11.3357282945
+资阳市 13.2075304714
+鹅毛大雪 11.3357282945
+李存勖 11.0103058941
+施工工艺 12.5143832909
+刚好 7.90174109003
+象牙海岸 11.4157710022
+总计 7.58170953823
+陈敏之 13.900677652
+患苦 12.5143832909
+印共 12.1089181827
+欧风 12.1089181827
+顶缸 11.7034530746
+体波 11.9547675029
+何武 12.8020653633
+等奖项 13.2075304714
+陈敏乘 12.8020653633
+何止 9.16447920358
+结存 13.2075304714
+第六十二回 12.2912397395
+结子 11.4157710022
+李金吾 11.7034530746
+共商国是 11.8212361103
+红庙子 12.8020653633
+招唤 13.2075304714
+环县 11.5027823792
+纳木那尼峰 11.9547675029
+陈昌本 13.900677652
+未来学 11.7034530746
+创作员 12.8020653633
+贱号 13.2075304714
+川上 12.8020653633
+譬喻 11.0103058941
+美国 4.15659623166
+孔先生 13.900677652
+九姓 11.0674643079
+诸葛爽 12.2912397395
+成本计划 13.2075304714
+蒋介石 7.23117956212
+深邃 8.97342396682
+笔札 12.8020653633
+南西川 11.8212361103
+长骨 11.4157710022
+华饰 12.8020653633
+杰克 10.2371160058
+多不少 13.900677652
+打破常规 11.7034530746
+对象国 11.5027823792
+奔雷 12.2912397395
+办好 8.60737282725
+能重立 13.2075304714
+猴面包树 12.2912397395
+当一当 13.2075304714
+荡漾出 13.900677652
+原是 7.14607355249
+报春 11.5027823792
+原昭 12.8020653633
+乳草 13.900677652
+粟末 11.8212361103
+互相制约 11.0103058941
+侯二人 11.5027823792
+长程计划 13.900677652
+古土壤 11.8212361103
+美国杜邦公司 12.1089181827
+黄甲 13.900677652
+国际化 7.63347710343
+禅师 9.6811699468
+顶级 8.56313957227
+千金之躯 13.2075304714
+聋聩 13.900677652
+未附 12.8020653633
+庄观 11.0103058941
+梦儿 12.2912397395
+星占学 12.8020653633
+汉灵帝 10.9049453784
+画好 11.9547675029
+药监局 10.4041700905
+环列 10.8561552143
+办处 13.900677652
+四六名 13.2075304714
+肯尼亚人 13.900677652
+收归国有 9.89334446674
+沃斯 10.7226238216
+辉县 10.4994802703
+长高 10.0088573539
+该村 10.0940151622
+八二三 13.2075304714
+商赵乙 13.2075304714
+体测 11.598092559
+统计图表 11.9547675029
+因私护照 13.900677652
+一臂之力 9.84023464143
+于主脉 12.8020653633
+翰墨 11.4157710022
+神经元 9.56994431169
+温都尔汗 11.7034530746
+倭寇 9.08039608637
+女弟 13.900677652
+笔架 10.7226238216
+体液 8.71889410168
+深通 10.765183436
+控股公司 8.0746775446
+调寄 12.2912397395
+放贷 8.17382990439
+卖儿鬻女 13.900677652
+丙肝 9.84023464143
+米萨尔 12.8020653633
+尼科尔斯 12.1089181827
+踟蹰 11.0103058941
+深透 11.9547675029
+白白浪费 11.1280889297
+退回去 9.74179456862
+稠化剂 13.2075304714
+坏男孩 13.900677652
+名牌服装 13.900677652
+于宝山 13.900677652
+杰出 7.73736284794
+商籁体 12.8020653633
+金竹山 13.2075304714
+萨拉赫丁 12.8020653633
+只怕有心人 12.5143832909
+摆上去 13.900677652
+深造 9.0884932966
+西山麓 12.5143832909
+子理 13.900677652
+感伤 9.37888907493
+封斋 11.8212361103
+二重积分 13.2075304714
+百无禁忌 11.598092559
+彻底否定 10.7226238216
+奔驰车 10.6818018271
+橡皮擦 13.900677652
+长驻 11.598092559
+松糕鞋 13.900677652
+缠身 9.77354326693
+五蕴 11.1280889297
+长驱 9.53122979951
+九处 12.2912397395
+刘宝全 11.4157710022
+汤太夫人 13.2075304714
+杰内 12.8020653633
+蔡司 11.9547675029
+老尔依 11.8212361103
+针织布 13.2075304714
+明名臣 13.2075304714
+鲍曼氏 13.2075304714
+结婚 6.56439199195
+九夷 11.7034530746
+负担过重 10.9049453784
+忧民 12.2912397395
+孔明闲 13.2075304714
+望其项背 11.2616203224
+原曲 12.5143832909
+物耗 11.8212361103
+会晤 8.45825994145
+九大 9.01787572939
+丙胺 12.5143832909
+蔡叔 11.0103058941
+感佩 10.9049453784
+破折号 11.7034530746
+挂齿 12.2912397395
+九天 9.65218240993
+办妥 9.5062284973
+十四部 12.8020653633
+鹞子翻身 12.1089181827
+摔跤手 12.8020653633
+女墙 11.598092559
+麻立 13.900677652
+旋开 13.900677652
+锚泊 12.5143832909
+耐久力 12.2912397395
+晋军撤 13.2075304714
+徐日 12.2912397395
+五花 10.3453295905
+原意 8.87023973058
+头头是道 9.87532596124
+第五十五 12.2912397395
+翘首以望 13.900677652
+长驱而入 13.900677652
+杭忆站 13.2075304714
+郭祥喊 12.8020653633
+板垣 11.2616203224
+载到 13.900677652
+热处理炉 13.2075304714
+释慧琳 13.2075304714
+于汉族 11.5027823792
+何涛 10.4349417492
+宫里来 12.2912397395
+龌龊 10.0940151622
+菜点 11.598092559
+壅蔽 12.1089181827
+明蒙 13.900677652
+筛糠 9.93038573842
+爬下来 11.9547675029
+牛舌 12.2912397395
+五节 11.598092559
+内加尔 13.2075304714
+悉尼奥运会 12.5143832909
+当仁不让 9.77354326693
+希荣 12.2912397395
+弹冠相庆 11.3357282945
+挨揍 11.7034530746
+蛋品 12.1089181827
+盛宝 13.900677652
+结巴 10.1630080337
+多数两项 13.900677652
+白开水 9.87532596124
+易田之 13.2075304714
+军团菌 11.9547675029
+岁月流逝 12.5143832909
+乱采 11.7034530746
+棉桃 12.2912397395
+衔接 8.35160156708
+孔明问 11.2616203224
+盛宴 8.71329184614
+女声 10.533381822
+陈毅任 12.5143832909
+女士 7.5273578624
+九座 12.1089181827
+九度 13.900677652
+变性人 13.900677652
+曾密 11.8212361103
+氯喹 12.1089181827
+周公辅 11.4157710022
+费改税 11.5027823792
+柏科 11.5027823792
+九幕 13.2075304714
+悔悟之意 13.900677652
+骆驼牌 12.1089181827
+碗盆 13.900677652
+八十余万 11.8212361103
+纳木错 10.6818018271
+温度梯度 10.765183436
+利尔杰 12.2912397395
+有机玻璃 10.7226238216
+九幅 13.2075304714
+知春里 12.8020653633
+金属化 12.1089181827
+德齐弟 13.2075304714
+文学界 10.4994802703
+蚱蝉 12.8020653633
+两万二千米 13.2075304714
+四秒钟 13.2075304714
+工读生 12.5143832909
+九年 7.28595205177
+第五十二 11.8212361103
+躬身行礼 11.5027823792
+魏青龙 13.2075304714
+君主 7.44862869754
+罗森博格 13.900677652
+簪子 9.93038573842
+孔道 9.82314020807
+梦回 11.8212361103
+卡尔吉 13.2075304714
+金盒子 13.900677652
+碗盏 10.4994802703
+毕业生 8.13548654919
+袭取 10.642581114
+厌氧发酵 12.8020653633
+调峰 11.1926274509
+何洁 11.8212361103
+画夹 12.8020653633
+干鲜果 11.3357282945
+菲林 13.2075304714
+九帐 12.8020653633
+十有八九 9.66657114738
+克林顿政府 12.1089181827
+纤瘦 11.9547675029
+五色 9.0884932966
+隽永 10.4349417492
+拍门 12.2912397395
+板坯 12.5143832909
+南方日报 10.0505300503
+邦交 11.3357282945
+祖堂 13.2075304714
+九市 12.8020653633
+斯科舍 12.8020653633
+瞬间即逝 13.2075304714
+顶礼 10.765183436
+干净利索 11.2616203224
+一条线 9.75754292558
+李作见 13.2075304714
+陈德铭 9.28555713513
+真象科 13.2075304714
+五艘 10.8096351986
+板块 5.1573055207
+三四日 11.3357282945
+瀑布 7.60725837313
+蚱蜢 11.7034530746
+于明军 13.900677652
+祖陵 11.5027823792
+夺金 11.4157710022
+明著 13.2075304714
+库斯鲁 12.8020653633
+卜易 13.2075304714
+网络管理 11.5027823792
+庄辉 13.2075304714
+案发 9.85762638414
+五莲 11.9547675029
+女妖 11.5027823792
+邮报 10.1394775363
+汝之过 13.2075304714
+基本味觉 13.900677652
+流态化 12.1089181827
+少相 13.2075304714
+敢喊 13.2075304714
+一个千 12.2912397395
+伏于山 11.5027823792
+宝贝儿 11.4157710022
+胡于蔡 13.2075304714
+纽芬兰省 13.2075304714
+假发票 10.7226238216
+禁止显示 12.8020653633
+从生到死 12.1089181827
+学苑 13.900677652
+颗粒状 10.0720362555
+笔意 10.3743171274
+延森 13.2075304714
+原性 11.3357282945
+乔路埃 13.2075304714
+本学期 12.8020653633
+黎刹公园 13.2075304714
+肝胆相照 10.642581114
+黑垆土 11.3357282945
+闩住 13.900677652
+活祭 13.2075304714
+环合 12.1089181827
+女姓 13.900677652
+祖宗家法 11.1926274509
+七十一万 13.2075304714
+审问 8.73589167805
+电气石 10.9562386728
+百炼千锤 13.900677652
+龙门石窟 10.1164880181
+生效日 13.900677652
+中京 10.2117981979
+水库养鱼 12.8020653633
+鱼库 12.5143832909
+基本权利 10.2117981979
+贾琏忙 11.5027823792
+斯科普里 12.2912397395
+何法 11.7034530746
+六十多家 13.2075304714
+多年不见 10.4349417492
+躲让 12.8020653633
+押汇 13.900677652
+君信 13.2075304714
+附属国 10.533381822
+升火 12.8020653633
+互联网络 11.1926274509
+糠菜 11.7034530746
+起因于 10.2371160058
+李丹丹 11.8212361103
+结尾 9.07236391467
+九归 13.900677652
+玄理 11.9547675029
+奶罩 13.900677652
+流电 12.8020653633
+不相适应 10.7226238216
+类推法 13.900677652
+纳帕海 13.2075304714
+绞接 12.8020653633
+薤白 12.1089181827
+闪动 8.98802276624
+窠穴 13.2075304714
+口头报告 13.900677652
+玉清观 13.2075304714
+缠裹 11.3357282945
+朱智贤 13.2075304714
+深刻理解 10.6818018271
+挪作 12.1089181827
+因变量 11.5027823792
+杰基 13.900677652
+焦头烂额 9.7898037878
+冷气机 13.900677652
+郭庄 13.2075304714
+案卷 10.8561552143
+官容儿 12.8020653633
+带着 9.15574552361
+俭朴 10.2117981979
+何氏 11.9547675029
+日本联合舰队 11.2616203224
+均衡化 13.2075304714
+白纱宫 13.2075304714
+第七十六个 13.900677652
+移项 13.900677652
+印象主义 9.37888907493
+接嘴 12.5143832909
+世茂 10.2371160058
+隋代流 13.900677652
+伊万见 12.5143832909
+呼奴唤 13.900677652
+四清六活 13.900677652
+齐齐整整 10.642581114
+输导组织 11.7034530746
+办得 9.26594866375
+安史部 13.2075304714
+厉王 10.9049453784
+拔身 13.900677652
+命薄相穷 13.900677652
+过武举 12.5143832909
+五荤 12.8020653633
+戈尔曼 13.2075304714
+手搭凉棚 11.7034530746
+李卜克内 10.765183436
+押注 9.93038573842
+图画文字 11.9547675029
+勾云形 13.2075304714
+自我刺激 12.8020653633
+冯保先 12.8020653633
+深陷 8.80081122415
+富户 9.30555780184
+同化政策 11.9547675029
+休伦湖 11.0674643079
+泰兴市 13.900677652
+温州市 10.0294766411
+女奴 10.7226238216
+华龙 10.1394775363
+大幅让利 13.900677652
+城市给水 13.2075304714
+挂饰 12.8020653633
+九张 13.900677652
+惯称 12.5143832909
+衬边 13.2075304714
+升势受阻 12.5143832909
+脏器 8.82550383674
+拔起 10.5684731418
+调幅 10.642581114
+祖堂寺 13.2075304714
+平方米 7.1356386752
+红卫兵 9.06439574502
+顶篷 11.5027823792
+一线生机 10.642581114
+体校 10.604840786
+骑驴 10.8096351986
+扯皮 10.642581114
+梦呓 11.0103058941
+抽象层次 13.2075304714
+长龙 10.1630080337
+高姿态 11.7034530746
+禅学 11.5027823792
+结得 11.5027823792
+实报实销 13.900677652
+政策优惠 10.4666904475
+魔道 11.3357282945
+奶糖 12.2912397395
+调干 13.2075304714
+柏树下 12.5143832909
+富司迪 12.8020653633
+哥本哈根 6.84191949946
+共轭点 12.1089181827
+建中 9.40086798165
+梅氏犀 13.2075304714
+故得名 10.9562386728
+诸郡生 13.2075304714
+语不成句 12.5143832909
+鲍桑 13.900677652
+景园 12.2912397395
+物质奖励 12.1089181827
+九岁 10.0720362555
+七七四十九日 12.5143832909
+闪入 11.7034530746
+裱糊 10.604840786
+敌人 5.84425088445
+奶精 12.8020653633
+五胡 11.9547675029
+刘白羽 11.598092559
+唐初亦 12.8020653633
+金墉城 11.2616203224
+现金价格 12.2912397395
+佐林 13.2075304714
+高等师范 10.642581114
+小型张 12.5143832909
+奶粉 9.03314320152
+被告席上 12.1089181827
+深闺 11.1926274509
+葱白 11.0674643079
+馋涎 12.1089181827
+外星人 10.0088573539
+独身主义 13.2075304714
+装扮成 10.4349417492
+知识界 10.4349417492
+闪光 8.79473217808
+建业 8.66956903512
+锻压 10.5684731418
+钦此 10.1394775363
+玄石 13.900677652
+云鹤 12.5143832909
+环城 10.1630080337
+瓶装水 12.1089181827
+布雷区 12.8020653633
+长鼻 11.1280889297
+腹部 7.5273578624
+戈尔斯 11.7034530746
+呜钟 13.900677652
+禅寂 13.2075304714
+应变仪 13.900677652
+坚信不疑 11.8212361103
+利六世 13.900677652
+女娃 10.3743171274
+奶类 10.4994802703
+女娇 13.900677652
+焰火晚会 11.8212361103
+沃恩 12.8020653633
+钢绳 10.2117981979
+田丰之 13.2075304714
+女娲 10.0720362555
+甘德尔 12.5143832909
+长鼓 12.2912397395
+盛好 13.2075304714
+道德教育 10.533381822
+炉门 10.8561552143
+焦裕禄 9.77354326693
+禅寺 10.4349417492
+藤家具 13.900677652
+原始人 9.84023464143
+技术秘密 13.2075304714
+建仓 7.24266660611
+格林尼治 10.0505300503
+广安县 13.2075304714
+环型 12.1089181827
+巴拿马城 11.3357282945
+闪出 8.77671367257
+闪击 12.1089181827
+建交 8.37921673411
+对象化 12.8020653633
+菜牛 10.9562386728
+结彩 11.4157710022
+技术交流 10.7226238216
+明虾 13.2075304714
+禅定 11.1280889297
+禅宗 9.28555713513
+盛夏 9.33632946051
+建于 7.46132728088
+傅亮 13.900677652
+女婿 7.93967231235
+案值 11.7034530746
+五联 11.8212361103
+九尾 11.4157710022
+圆饼 12.1089181827
+干细胞 10.0505300503
+深长 10.0088573539
+女婴 10.2371160058
+正面攻击 11.8212361103
+迷途知返 11.9547675029
+带球 12.8020653633
+盛大 8.13235665618
+中国第一历史档案馆 11.5027823792
+人困马乏 10.5684731418
+女婢 11.5027823792
+菲斯 12.2912397395
+楚亲晋 13.2075304714
+癖好 10.7226238216
+廉访休 12.2912397395
+未雨绸缪 9.16447920358
+女官 9.94943393339
+福清县 12.5143832909
+谢里夫 11.8212361103
+朱慈焕 12.8020653633
+卖弄风骚 13.900677652
+九州 8.95903522937
+顶端 7.85094419674
+夏熟作物 13.900677652
+圆领 10.0505300503
+陈德霖 11.2616203224
+修辞学 10.4994802703
+靖宁 12.8020653633
+大吃一顿 12.5143832909
+跑上跑下 11.9547675029
+安桑式 13.900677652
+世臣 11.8212361103
+女宾 11.2616203224
+精神家园 11.2616203224
+傅佥 11.4157710022
+结庐 11.8212361103
+女家 10.8561552143
+王子腾 10.7226238216
+速去速回 12.2912397395
+桑干河 10.0940151622
+带病 10.0294766411
+料想得到 12.8020653633
+胖小子 11.0674643079
+案几 10.6818018271
+秦安背 13.2075304714
+满地瞅 13.2075304714
+温布尔登 11.1280889297
+宋臣民 13.900677652
+调式 10.0720362555
+盎斯 10.533381822
+从化县 12.2912397395
+梅赫伦 13.900677652
+调开 11.3357282945
+衔悲 13.900677652
+调弄 11.598092559
+何滨 13.900677652
+龙骨山 11.7034530746
+卡尔基 11.9547675029
+案内 13.900677652
+阿诺河 13.900677652
+截断误差 13.900677652
+禁用 9.28555713513
+丫环 8.2985588311
+调弦 10.6818018271
+长黑 13.900677652
+抓准 13.2075304714
+脏土 13.2075304714
+调强 13.900677652
+于明初 11.5027823792
+不足称道 13.900677652
+雄鹰 10.604840786
+压滤机 13.900677652
+气候区划 11.5027823792
+模式图 12.2912397395
+美目盼兮 12.5143832909
+刘崇结 13.2075304714
+龙虾肉 13.900677652
+黄萎病 12.8020653633
+文化公园 10.8096351986
+半丝 11.0674643079
+培养基 10.2630914922
+扬水站 12.5143832909
+孙志远 12.8020653633
+卖契 13.2075304714
+衔恨 13.900677652
+孙麻哈 13.2075304714
+长鸣 10.1871055853
+强的松龙 12.2912397395
+调快 12.8020653633
+结帐 11.8212361103
+庄贾 12.8020653633
+五脏 9.32596667347
+敌体 13.2075304714
+马王庙 12.8020653633
+拧住 11.8212361103
+尼赫鲁大学 13.2075304714
+宝贵意见 12.2912397395
+娇红 12.2912397395
+名门闺秀 12.1089181827
+棉毛 11.7034530746
+带电 9.33632946051
+高等院校 8.44963919841
+调往 9.69598503258
+敌伪 10.8561552143
+言犹未尽 13.2075304714
+欧吕丰 13.900677652
+两利 11.598092559
+百科词典 11.9547675029
+组阁 9.46986085313
+调得 11.1926274509
+羞辱 9.37888907493
+穿刺针 11.9547675029
+万立方 10.9562386728
+郭祥呵 13.2075304714
+牛铃 11.9547675029
+董源 10.8561552143
+蛋黄粉 13.900677652
+圆顶 9.75754292558
+组队 11.8212361103
+房地产热 12.2912397395
+告扰 13.2075304714
+大羽 12.5143832909
+圆顿 13.2075304714
+寄出 10.9049453784
+女孩 7.46452728361
+六十多天 13.2075304714
+棉毯 12.8020653633
+六二年 12.5143832909
+夏绿蒂 13.900677652
+报纸堆 13.2075304714
+蓝色妖姬 13.900677652
+鸡兔同笼 13.900677652
+火烈鸟 11.9547675029
+好戏连台 13.900677652
+亿年 8.53003962385
+黑虎泉 13.2075304714
+作弄 11.4157710022
+全身上下 10.3171587135
+金布律 12.2912397395
+作弊 9.85762638414
+浊流 10.1394775363
+人民法院 7.76295059789
+密结 13.900677652
+撮箕 13.2075304714
+蔡方荫 12.5143832909
+有票 13.900677652
+麻袋片 11.3357282945
+意表 13.2075304714
+兼容并包 11.3357282945
+步话机 11.7034530746
+约基 12.8020653633
+四聚体 12.8020653633
+众院 11.7034530746
+磨碎 10.7226238216
+浊浪 10.8561552143
+单薄 8.74162235276
+藩镇 9.41204128224
+藏毯 12.2912397395
+雪中送炭 10.9562386728
+鄙陋 12.1089181827
+孟斐斯 11.3357282945
+新姑爷 11.8212361103
+悟道 10.9562386728
+未知数 9.43476953332
+磨磨 11.2616203224
+侧面 7.5393751744
+后生可畏 11.9547675029
+外商独资 11.4157710022
+黄振 12.8020653633
+董事局 9.26594866375
+粟一石 13.2075304714
+文学事业 11.0674643079
+硫化机 12.5143832909
+亩产值 12.8020653633
+统一论 12.2912397395
+窝铺 10.4349417492
+长途电话 10.1871055853
+初盛唐 13.2075304714
+坏块 12.8020653633
+侍中萧 13.2075304714
+税法 9.98865464655
+丹化 9.80633308975
+磨砺 10.765183436
+哈大线 11.4157710022
+兴利 10.8561552143
+千思万想 11.7034530746
+饮料类 13.900677652
+晚清 9.14708746087
+磨破 10.4666904475
+宋一欣 9.84023464143
+乙级 11.7034530746
+渗透压 9.54396882529
+耐人寻味 9.5062284973
+话频 13.900677652
+赵忠贤 13.2075304714
+眼中 7.37271973435
+耦联 13.900677652
+闳达 13.900677652
+美美 10.2117981979
+赌桌 13.900677652
+几公里 10.8561552143
+见习官 13.900677652
+商品交换 8.87023973058
+白帆那 11.598092559
+火山学 13.900677652
+血运重建 13.900677652
+磨砂 12.2912397395
+求职者 10.4349417492
+拿大顶 12.8020653633
+眼下 6.50618454476
+欺瞒 10.9049453784
+偷懒 10.1164880181
+米诺夫 13.2075304714
+惹火 11.9547675029
+文化交往 11.5027823792
+聚苯乙烯 10.8561552143
+第六款 12.8020653633
+漂行 13.2075304714
+守门 9.45802639549
+维持会 11.0674643079
+话题 6.88856235767
+目不别视 13.900677652
+八仙 9.91169360541
+收回成命 10.6818018271
+陡然 8.80692745117
+第六次 9.18217878068
+几万 8.70218062071
+玄奘新 13.2075304714
+劝阻无效 13.900677652
+得该 12.8020653633
+七千万年 13.2075304714
+周世俭 12.2912397395
+鹤立 12.2912397395
+辛康宗 12.5143832909
+布兰肯堡 13.2075304714
+征粮 10.0505300503
+引发出 11.2616203224
+菏泽地区 11.8212361103
+盛德之 12.5143832909
+黎塘 13.2075304714
+脑空 12.8020653633
+祖厉河 11.0674643079
+薄明 12.8020653633
+试点区 13.2075304714
+阵容整齐 13.2075304714
+中药铺 11.2616203224
+苗族 9.00283785202
+调和鼎鼐 12.8020653633
+宽大无边 13.900677652
+匹夫无罪 12.8020653633
+隐身技术 11.7034530746
+毛全白 13.2075304714
+您们 11.3357282945
+占星学 12.8020653633
+劳动强度 9.30555780184
+刘儒林 13.2075304714
+梨花带雨 13.900677652
+于泓水 12.8020653633
+用户界面 11.5027823792
+阜成路 12.8020653633
+旮旮旯旯 12.2912397395
+鸽子 9.15574552361
+卢克索 11.5027823792
+梁士诒 11.4157710022
+阶下 9.15574552361
+白骆驼 11.1926274509
+渗透到 9.30555780184
+五边形 11.8212361103
+扶苏 11.598092559
+喜冲冲 13.900677652
+七十多发 13.2075304714
+太素 12.2912397395
+访求 10.765183436
+刘三吾 13.900677652
+苗文 11.7034530746
+性格开朗 11.4157710022
+浊气 10.8561552143
+发光度 13.2075304714
+占据 6.6076599722
+栋梁 10.5684731418
+吹萧 11.9547675029
+餐巾纸 11.5027823792
+陈洪进 12.5143832909
+董酒 11.9547675029
+合成橡胶 9.53122979951
+小儿麻痹 11.7034530746
+和懿安 12.8020653633
+轻粉 13.2075304714
+子岭 11.0103058941
+詹光 12.1089181827
+吸尘机 13.2075304714
+敢练 13.900677652
+浊水 11.0674643079
+损耗量 13.900677652
+动感超人 13.2075304714
+暴乱 10.1394775363
+第五十日 13.2075304714
+工贸 10.1871055853
+阶乘 12.1089181827
+连接不断 13.2075304714
+安加拉 11.598092559
+邱处机 11.3357282945
+滴雨未下 13.900677652
+子山 10.604840786
+自然科学家 11.1280889297
+凝定 12.8020653633
+渗透力 11.598092559
+萨菲 11.3357282945
+作废 9.94943393339
+国际漫游 12.2912397395
+真巴儿 13.2075304714
+学派 7.25169310195
+腐生 10.4349417492
+丁银才 13.2075304714
+淄川 10.6818018271
+氯丙嗪 11.5027823792
+长鼓舞 11.7034530746
+股权结构 9.49395840471
+宋伟臣 13.2075304714
+戴家干 13.900677652
+瘦身法 12.8020653633
+单萜 13.900677652
+音容笑貌 11.0103058941
+考问 11.9547675029
+建网站 13.900677652
+载运量 12.5143832909
+访法 13.900677652
+热敷 10.5684731418
+千群 12.8020653633
+桃花岛 13.900677652
+但凡 8.99540287354
+热带雨林 8.50251495046
+漏进 12.8020653633
+千羽 13.2075304714
+文人雅士 11.598092559
+粮田 11.7034530746
+锂电池 9.48183704418
+发扬光大 10.3171587135
+大陆性 8.74162235276
+轧棉 11.3357282945
+砌墙 11.0103058941
+继电 11.8212361103
+猛升 11.8212361103
+继由 13.2075304714
+学海 12.1089181827
+占星家 12.8020653633
+总服务台 13.2075304714
+伤残人 12.5143832909
+若雷霆 13.2075304714
+连州市 12.8020653633
+萨莫 12.2912397395
+黄宗英 12.5143832909
+春衣 13.900677652
+修德养 13.900677652
+拉里亚 13.2075304714
+沾腥 13.900677652
+东大寺 11.4157710022
+晚潮 13.900677652
+齐岳山 12.8020653633
+子尚 11.9547675029
+库库塔 13.2075304714
+检讨 8.85082164473
+业务素质 11.598092559
+叶纹 13.900677652
+滑州 11.1926274509
+卡尔纳普 11.9547675029
+郭祥和 9.98865464655
+孤掌难鸣 10.4666904475
+八十点 12.8020653633
+古诗词 13.2075304714
+梁朱温 12.5143832909
+高活性 12.1089181827
+解难 11.598092559
+黄慎 12.2912397395
+胞弟 11.0674643079
+满地找牙 13.900677652
+略论 10.765183436
+轧死 11.5027823792
+崖柏 12.2912397395
+巴苏 11.5027823792
+子忠 12.1089181827
+数十亿年 13.900677652
+利用职权 10.642581114
+跃居首位 12.5143832909
+注意分配 13.900677652
+雷观笑 13.2075304714
+夜行军 11.8212361103
+试场 13.900677652
+景红 13.900677652
+短论 12.1089181827
+埃马兰吉 13.900677652
+香蕉叶 13.2075304714
+重罪轻判 11.9547675029
+照妖镜 11.5027823792
+童山濯濯 13.900677652
+税源 10.4349417492
+学历教育 12.8020653633
+寄灵 12.8020653633
+马勺娃 12.8020653633
+遇水迭桥 13.2075304714
+生死相依 12.5143832909
+扭送 10.9562386728
+双块 13.900677652
+美籍华人 11.1280889297
+本协定 13.900677652
+陈履安 13.2075304714
+良好率 13.900677652
+严寒酷暑 11.9547675029
+漏谷 13.900677652
+遮不住 11.2616203224
+安丰塘 11.7034530746
+张公谨 13.2075304714
+子微 13.2075304714
+唐置安 12.5143832909
+衰弱 8.9308643524
+判断能力 10.3743171274
+孙立便 12.5143832909
+最新进展 8.83177344976
+巴芬 12.2912397395
+枕戈达旦 13.900677652
+体育彩票 11.0103058941
+卓行 13.900677652
+千米 5.87352754514
+无状 10.5684731418
+东印度群 10.1630080337
+跑步走 13.2075304714
+试纸 10.9049453784
+考试网 11.9547675029
+有懿旨 12.8020653633
+以和为贵 12.2912397395
+丹凤 10.642581114
+优秀教师 11.7034530746
+吴都平 13.2075304714
+糯米饭 12.5143832909
+盗魁 9.69598503258
+马石山 12.8020653633
+伦理片 13.2075304714
+明识远 13.2075304714
+王凤姐 12.2912397395
+补救性 12.2912397395
+几炷香 13.900677652
+商业保险公司 12.5143832909
+封食邑 13.2075304714
+浑身是汗 12.2912397395
+巴色 12.2912397395
+密尔顿 12.8020653633
+颤音 10.6818018271
+恩图曼 12.5143832909
+十字架 9.33632946051
+收风 12.5143832909
+北京人民大会堂 10.765183436
+磨穿 12.2912397395
+副部级 11.4157710022
+侧闻 13.900677652
+义气相投 12.8020653633
+絮絮不休 13.2075304714
+子张 12.5143832909
+故意杀人罪 11.0674643079
+介东 11.0674643079
+调度员 12.1089181827
+一百零九页 13.2075304714
+市民意识 13.900677652
+挣不脱 11.9547675029
+侧门 9.93038573842
+高起潜 9.36807815882
+常侍之 11.7034530746
+怎了 12.8020653633
+子弟 7.80260336981
+戊辰年 13.900677652
+饿坏 10.9562386728
+常德路 13.900677652
+征纳 12.5143832909
+作工 11.598092559
+输多赢少 12.8020653633
+宁静致远 13.900677652
+子盛 13.2075304714
+筏子 9.91169360541
+衰微 9.40086798165
+子式 12.2912397395
+亿岁 13.2075304714
+密码机 10.9562386728
+中小学生 9.5186510173
+网技 13.900677652
+百多斤 13.900677652
+检测仪 12.5143832909
+接听电话 11.3357282945
+捷报频传 11.4157710022
+胭粉 12.5143832909
+每节 10.642581114
+生津解渴 12.8020653633
+苏刘义 12.8020653633
+密码本 11.8212361103
+拐来 12.5143832909
+堤顶 11.9547675029
+晋平公 12.1089181827
+匈牙利政府 12.8020653633
+同奉军 13.2075304714
+沃顿 11.598092559
+智藏 13.900677652
+拐杖 8.62767809341
+衰年 13.900677652
+洗洁精 12.1089181827
+白马寺 10.1164880181
+廖化作先锋 13.2075304714
+当归鸭 13.900677652
+促膝长谈 13.900677652
+个别现象 11.598092559
+北四环路 13.900677652
+通信情报 12.8020653633
+霍光秉 13.2075304714
+子康 13.2075304714
+羌胡 11.1280889297
+阿河 13.900677652
+有翅难飞 13.900677652
+反复强调 10.1164880181
+三四两句 12.8020653633
+详情请 10.9049453784
+泄天机 12.5143832909
+辛酉 10.6818018271
+高鼻梁 10.604840786
+冷言冷语 11.7034530746
+标下去 13.900677652
+美籍 9.89334446674
+致富之道 13.900677652
+解释权 9.85762638414
+辛酸 9.30555780184
+巴莱 13.900677652
+地仙封 13.900677652
+巴莫 11.9547675029
+春交会 10.6818018271
+杳无 11.9547675029
+眉山市 13.2075304714
+粤高速 11.8212361103
+子平 13.2075304714
+检视 10.6818018271
+热化学 11.4157710022
+沉迷于 11.0103058941
+平卧在 13.2075304714
+夏桀之 12.8020653633
+嘈嘈杂杂 11.9547675029
+出走 8.62256299275
+破铜烂铁 12.8020653633
+辛醇 13.900677652
+组队参加 12.8020653633
+实地调查 10.0294766411
+桃花庵 11.1926274509
+天地豪情 13.900677652
+水灯 13.2075304714
+窃据 11.4157710022
+苗条 9.71102290995
+科利尼 12.5143832909
+输不起 11.9547675029
+黄惠 13.900677652
+轨枕 12.1089181827
+钱眼儿 13.2075304714
+游林泉 13.2075304714
+俱乐部赛 13.900677652
+半亩 11.598092559
+受苦受难 11.1926274509
+第六根 13.900677652
+辛金 12.5143832909
+金谷里 11.5027823792
+艺术院校 11.598092559
+壳菜 13.900677652
+国之政 12.5143832909
+会员中心 13.900677652
+唐吉诃德 11.598092559
+临沧县 12.8020653633
+拿回去 9.96885201925
+招标 7.56917580208
+西南部 7.09495509856
+白三烯 13.2075304714
+苗期 10.7226238216
+最轻量级 13.900677652
+月貌花容 13.2075304714
+学潮 11.9547675029
+常用对数 11.8212361103
+雷都 11.9547675029
+阿玛可 13.900677652
+范文程 8.45825994145
+沙塘川 12.5143832909
+清幽幽 13.900677652
+吹蚀 12.5143832909
+丝路花雨 12.2912397395
+芳纶 11.8212361103
+盲目崇拜 11.598092559
+苗木 10.0720362555
+杭嘉平 9.26594866375
+子布 11.3357282945
+四大洲 12.5143832909
+西南郊 10.3171587135
+纺织厂 8.69119149913
+马波乔 13.900677652
+扔回 12.1089181827
+四面楚歌 11.1926274509
+苗情 13.2075304714
+巴松 13.2075304714
+敢管 11.2616203224
+黄杉 10.8096351986
+谱线宽度 12.5143832909
+绘图仪 11.9547675029
+相思树 11.8212361103
+赌注 9.62401153296
+劫持者 13.2075304714
+水井坊 10.4666904475
+要端 13.2075304714
+楚庄王 10.9562386728
+锋矢 13.2075304714
+竹板书 13.2075304714
+水资源 8.32094782599
+无限深情 12.1089181827
+黄村 11.9547675029
+临时演员 12.5143832909
+美味 8.97342396682
+詹同 11.598092559
+黄杨 10.1164880181
+磨粒 13.2075304714
+搜狐公司 13.900677652
+转流 11.4157710022
+里德尔 11.9547675029
+伏羲考 13.2075304714
+黄松 10.765183436
+濡养 10.9562386728
+磨粉 11.5027823792
+阿部规秀 12.5143832909
+钢铁公司 9.22784881751
+二十多次 13.2075304714
+落发为僧 11.9547675029
+寒来暑往 13.2075304714
+吹腔 11.5027823792
+黄杰 13.2075304714
+小王庄 11.9547675029
+滞存 13.900677652
+规谏 11.598092559
+考选 11.598092559
+许次 12.5143832909
+韩夫人 12.5143832909
+没味儿 12.5143832909
+法尼醇 13.900677652
+济南人 11.4157710022
+国籍法 11.7034530746
+甲醇溶液 12.2912397395
+果如 12.1089181827
+恢复正常 8.81308131674
+巴蒂 12.8020653633
+西南面 10.4666904475
+西南非 11.4157710022
+黄木 12.1089181827
+作孽 10.0940151622
+师师 8.1386262692
+搓澡工 13.900677652
+文化差异 12.2912397395
+纯碱厂 11.9547675029
+虚假性 13.900677652
+第三十五届 12.8020653633
+宫与苑 13.2075304714
+子女 7.67414098269
+子皙 13.2075304714
+光明前途 12.5143832909
+学样 12.5143832909
+留美学生 12.5143832909
+空调主机 13.900677652
+作官 11.2616203224
+出乎意料 8.77077893705
+学校 5.69218590024
+同调群 11.8212361103
+标准工资 12.5143832909
+窝逃 13.900677652
+加伦 11.2616203224
+庄哥哥 11.5027823792
+宋史丛 12.5143832909
+黄染 12.5143832909
+黄某 10.9562386728
+作家 6.66361862585
+胞妹 12.5143832909
+白马山 13.2075304714
+单脚 12.5143832909
+谢尔曼 10.8561552143
+陨越 11.598092559
+德海姆 13.900677652
+宋宁宗 10.533381822
+子奇 11.0103058941
+时湘军 12.8020653633
+指挥仪 10.7226238216
+师帅 13.2075304714
+新浪网 11.1280889297
+黄柳 13.900677652
+洒上 12.8020653633
+洒下 10.4041700905
+得过 9.7898037878
+王颁胡 13.2075304714
+采购部 10.4994802703
+麦克拉伦 12.8020653633
+胞姐 13.900677652
+喇叭形 10.5684731418
+继往 12.5143832909
+黄极 11.8212361103
+黄果 11.598092559
+辛集 11.9547675029
+黄林 10.6818018271
+鸾凤 11.4157710022
+前后部 13.900677652
+淤灌 13.2075304714
+东州建 13.2075304714
+伪善者 12.8020653633
+子夜 10.0720362555
+作对 9.12155415886
+英女王 12.8020653633
+审美观点 12.8020653633
+福塞利 13.2075304714
+巴萨 10.533381822
+左柱国 11.7034530746
+学案 11.7034530746
+自酌 13.2075304714
+超过滤 13.2075304714
+子夏 11.8212361103
+景福 10.4666904475
+丹器 13.900677652
+一十五员 11.8212361103
+党群干群 11.3357282945
+滑头 10.3453295905
+特茹河 13.2075304714
+架不住 10.1394775363
+孙完颜 12.5143832909
+宗庙社稷 11.7034530746
+独裁统治 8.98802276624
+民国时期 9.45802639549
+多公顷 11.1280889297
+单肩 12.8020653633
+海厄特 12.8020653633
+黄晖 13.2075304714
+蒙代尔 9.71102290995
+单股 11.8212361103
+议会制 10.2371160058
+短话 13.900677652
+黄景 12.8020653633
+连命儿 13.2075304714
+辟谷 10.8561552143
+挖肉补疮 13.2075304714
+占有 6.49761656089
+舌上 11.2616203224
+舌下 11.3357282945
+美术院 11.5027823792
+那护法 12.5143832909
+招满 12.8020653633
+季度初 11.598092559
+吹弹歌舞 12.5143832909
+支出 6.7721817063
+假道学 11.8212361103
+饮料厂 12.5143832909
+装弹 9.5062284973
+远近皆知 13.2075304714
+鹏泰 13.900677652
+辟谣 10.2117981979
+子系统 10.0720362555
+中心论 12.1089181827
+黄明 13.900677652
+黄昏 7.50708689803
+黄昆 11.9547675029
+生活区 10.4666904475
+黄星 12.8020653633
+转弯子 13.2075304714
+支农 11.1280889297
+捕役 12.5143832909
+尽读 13.900677652
+测量队 13.2075304714
+广隆 12.5143832909
+窝里 8.9308643524
+罔知所措 11.7034530746
+黄易 11.9547675029
+让人真 13.2075304714
+国营经济 11.5027823792
+第八十七 12.8020653633
+生活化 12.1089181827
+第八十三 13.900677652
+商队 10.2117981979
+胸腔镜 13.2075304714
+阿普利亚 11.4157710022
+震旦纪 9.63799777493
+春装 13.2075304714
+科普性 13.900677652
+克塔迪 12.8020653633
+张唱片 12.1089181827
+闲话家常 13.900677652
+收发报 13.2075304714
+雀儿 10.7226238216
+打包票 11.598092559
+活蹦 13.2075304714
+考释 10.3743171274
+生活史 9.30555780184
+考量 8.77077893705
+年龄特征 12.2912397395
+娄罗 13.2075304714
+联合国安全理事会 11.8212361103
+广州大学 13.900677652
+三万美元 13.2075304714
+瓜达拉哈拉 11.9547675029
+柴米夫妻 13.900677652
+军事路线 11.7034530746
+规距 13.900677652
+招收新生 12.5143832909
+气象情报 12.1089181827
+图书城 12.5143832909
+电动车窗 11.598092559
+画家 7.0590621755
+漏诊 11.1926274509
+煌煌 10.9049453784
+吃不消 9.80633308975
+饿倒 12.1089181827
+饮食男女 12.5143832909
+顾名世 13.900677652
+编组站 10.5684731418
+啼猿 13.900677652
+林铭球 9.77354326693
+灵柩 9.65218240993
+李丽静 11.9547675029
+说怪话 11.8212361103
+冯保叹 13.2075304714
+美因茨 11.598092559
+商品交易 9.54396882529
+八万 10.2117981979
+博奈尔 13.2075304714
+英国式 11.1926274509
+高速性 13.900677652
+丰沙尔 13.900677652
+千篇 13.2075304714
+牙缝里 10.8096351986
+漏计 13.900677652
+臭豆腐 10.765183436
+精准度 13.900677652
+子堤 13.900677652
+作嫁 13.2075304714
+线条美 13.900677652
+几十万年 12.5143832909
+屈右膝 13.2075304714
+漂流瓶 13.900677652
+脏得很 13.900677652
+竞赛部 13.900677652
+慕鹗 10.9562386728
+辅导工作 13.900677652
+泽之谊 13.900677652
+试种 11.0674643079
+破土而出 11.0103058941
+势大力沉 11.9547675029
+太白楼 11.5027823792
+漂走 12.8020653633
+王薨 13.2075304714
+胡有为 13.2075304714
+朱桓引 13.2075304714
+罗伞 12.1089181827
+佚文 10.642581114
+作多 12.2912397395
+殖民统治 8.65893063692
+彩色缤纷 12.8020653633
+扫刮 13.900677652
+智能 7.16015829237
+流失率 13.900677652
+吴用授 13.2075304714
+孙女儿 10.9562386728
+黄教 10.642581114
+寒武纪 9.14708746087
+关帝爷 11.8212361103
+平均分配 10.3171587135
+划花 12.2912397395
+漏行 13.900677652
+邮亭 12.1089181827
+高枝儿 12.1089181827
+本地网络 13.2075304714
+堵塞物 13.2075304714
+哈钦松 13.900677652
+大陆架 8.81927328699
+子察 12.2912397395
+智胜 10.9562386728
+街名 12.1089181827
+碳循环 11.5027823792
+不一会儿 8.74738605748
+二十八万五千两 13.2075304714
+缴交 12.2912397395
+题画 12.2912397395
+司夜巡 13.2075304714
+试穿 11.0674643079
+订造 10.642581114
+不讲道理 10.9562386728
+征程 10.0940151622
+难以忘怀 10.9049453784
+征税 8.170577869
+子宣 12.2912397395
+富临 13.2075304714
+可缓和 13.900677652
+伦理学 9.16447920358
+子宫 7.97642185456
+富丽 9.31571017331
+智育 11.0674643079
+基库尤 12.8020653633
+支助 13.2075304714
+子官 13.900677652
+作好 9.03314320152
+子实 10.9049453784
+子宜 10.3171587135
+美国共和党 11.3357282945
+玩枪 12.2912397395
+盘结 11.3357282945
+磨练 9.7898037878
+扯破 11.0674643079
+征稽 13.900677652
+老世翁 12.5143832909
+征稿 13.900677652
+中日友好协会 13.2075304714
+代湖广 13.900677652
+支前 11.2616203224
+京剧院 13.2075304714
+登记在册 10.533381822
+核准权 11.9547675029
+序齿 11.9547675029
+漆座屏 12.2912397395
+以此为证 13.900677652
+芭乐 13.900677652
+最佳时期 11.9547675029
+史妹妹 12.2912397395
+黄旗 9.94943393339
+颂扬备至 13.900677652
+水面 6.62481305143
+国之恩 13.2075304714
+子子 12.2912397395
+黄旭 13.900677652
+各尽其 11.1926274509
+喊破 11.9547675029
+千万分之一 12.2912397395
+子孙 7.68606955355
+可可粉 12.1089181827
+最佳时机 9.85762638414
+辛钦 11.8212361103
+智联 12.5143832909
+三大战役 10.4041700905
+铜质 10.2630914922
+记笔记 12.8020653633
+军事情报 10.4994802703
+富产 11.598092559
+黄斌 11.9547675029
+无物 9.93038573842
+更优越 11.7034530746
+煤黑 13.2075304714
+黄文 11.7034530746
+一点五米 13.2075304714
+日本松下公司 13.2075304714
+神兵神 13.900677652
+廿四日 12.5143832909
+几百里 10.0294766411
+美称 9.40086798165
+模数转换 12.5143832909
+分内分外 13.900677652
+富人 8.33233314821
+浪荡 10.2897597393
+合成系 13.2075304714
+稀土矿 10.533381822
+德克士 12.8020653633
+欢歌笑语 13.2075304714
+水污染 10.1630080337
+富于 7.92179188707
+智者 9.66657114738
+魏都 11.598092559
+鞍辔 10.4994802703
+李继耐 12.5143832909
+西北大学 10.604840786
+萨蒂 12.2912397395
+侧重 8.5488195185
+商建国 12.8020653633
+贾木纳 12.8020653633
+孤身一人 10.4994802703
+等同于 9.28555713513
+第二十三届 10.4994802703
+单花 11.9547675029
+浪花 9.41204128224
+李荣著 13.2075304714
+晶晶亮 12.5143832909
+贞操 11.2616203224
+支取 9.96885201925
+震旦系 10.2897597393
+史学家 8.95903522937
+亿套 13.2075304714
+人类史上 12.8020653633
+物色人才 13.900677652
+克尔曼省 13.900677652
+满腹狐疑 10.8561552143
+后燕复 12.8020653633
+右旋糖酐 11.9547675029
+烽火 9.69598503258
+孔明只 11.598092559
+分拆函数 13.900677652
+替考 10.8096351986
+均依 12.8020653633
+单节 11.7034530746
+马约特岛 12.5143832909
+漂过 12.2912397395
+参议长 12.8020653633
+游览车 12.2912397395
+千间 13.900677652
+火山岛 9.55687223012
+飘来飘去 13.900677652
+几百道 12.8020653633
+蓟门 12.8020653633
+顾健翎 11.8212361103
+寄生 8.06294720481
+几百遍 13.900677652
+恰切 11.598092559
+丰子恺 11.3357282945
+怙恩恃宠 13.900677652
+奥地利共和国 11.9547675029
+攻歼 13.900677652
+想像出 12.8020653633
+丹吉 13.2075304714
+党代表大会 11.8212361103
+维龙加 13.2075304714
+半途上 13.900677652
+亿多 9.59661255877
+车斗 11.1280889297
+可不可以 10.1630080337
+榆中 10.533381822
+倒霉事 11.4157710022
+王汉斌 12.5143832909
+悔过 11.0103058941
+火山岩 9.04864738806
+巴契亚 13.900677652
+捋胳膊 13.2075304714
+卞氏兽 12.5143832909
+羹饭 12.8020653633
+浪船 13.900677652
+崔宗之 13.2075304714
+核反击 13.2075304714
+东南半壁 12.5143832909
+单舰 12.2912397395
+克劳馥 12.8020653633
+宋明帝 12.2912397395
+惹眼 10.5684731418
+税款 9.12999302751
+摇头丸 13.900677652
+试管 10.2897597393
+藏氏 11.7034530746
+内务部 10.7226238216
+张炜先生 12.5143832909
+水压计 13.900677652
+保水剂 12.8020653633
+景符 12.8020653633
+隔音材料 11.9547675029
+千禧 12.2912397395
+卓越 8.02014466558
+删繁就简 12.5143832909
+霁色 13.2075304714
+订金 10.4666904475
+纺织城 11.9547675029
+藏民 10.2117981979
+编辑者 13.2075304714
+八世 10.8561552143
+商务礼仪 13.900677652
+招民 11.2616203224
+国家火炬计划 11.3357282945
+自知之明 11.1280889297
+千种 9.94943393339
+生生死死 11.5027823792
+海澄公 13.2075304714
+别乡 13.900677652
+糖果店 11.2616203224
+单色 9.77354326693
+文津阁 11.7034530746
+学步 11.5027823792
+学武 11.9547675029
+及笄 13.2075304714
+千秒 11.9547675029
+布逊湖 11.7034530746
+巴蜀 9.15574552361
+瓦尔塔 11.9547675029
+西南铝 13.900677652
+竞争者 9.30555780184
+涉县 11.7034530746
+虚拟世界 11.5027823792
+藏汇 13.2075304714
+阿默栋 13.900677652
+右半部 13.900677652
+校友录 13.2075304714
+及第 9.71102290995
+几百部 12.8020653633
+裹起来 11.9547675029
+子威 13.900677652
+坎农 11.7034530746
+非盈利性 11.7034530746
+基诺族 11.4157710022
+单艇 13.900677652
+贡其物 13.2075304714
+电池板 11.0103058941
+默思 11.0103058941
+输液管 11.9547675029
+勉为其难 10.604840786
+磨炼 10.0505300503
+黄歇 12.1089181827
+八五计划 12.8020653633
+单足 11.9547675029
+子嗣 10.4349417492
+市妇联 13.900677652
+赵明恩 13.2075304714
+三月底 11.4157710022
+热压机 13.900677652
+吹起 10.533381822
+阳刘沟 13.2075304714
+滑向 11.0674643079
+美眉 11.9547675029
+东京城 9.58318953844
+游览者 12.2912397395
+一对一 9.14708746087
+消极悲观 12.5143832909
+招揽 9.85762638414
+插花 10.8561552143
+火山口 9.29550746599
+王凤卿 12.5143832909
+厦门市委 13.900677652
+纳斯塔 12.8020653633
+音乐喜剧 12.5143832909
+生殖细胞 10.1630080337
+单超 12.8020653633
+藏掖 13.2075304714
+宣判无罪 12.5143832909
+泰阿剑 13.2075304714
+胜利品 12.2912397395
+于岭北 13.2075304714
+几十万只 12.5143832909
+漫溢 12.1089181827
+喇叭口 10.533381822
+凄风苦雨 11.5027823792
+参事 10.4666904475
+从政者 13.900677652
+左性 13.2075304714
+把它买 12.2912397395
+普斯海洋 13.900677652
+作坊 8.21709788464
+拨付 9.30555780184
+修道士 10.7226238216
+省委党校 11.598092559
+补给舰 12.5143832909
+罗尔纲 11.5027823792
+格瓦拉 12.5143832909
+坎市 13.2075304714
+千则 13.2075304714
+哪一刻 12.5143832909
+陆基型 12.8020653633
+合成物 13.2075304714
+千百 10.1164880181
+那国丈 11.8212361103
+埃及民族民主党 12.2912397395
+几十万发 13.2075304714
+宫慕久 12.5143832909
+赶羊 13.900677652
+鲜叶 11.2616203224
+赵城藏 13.2075304714
+晚明 11.4157710022
+阿勒曼尼 11.8212361103
+浪费 7.79588441956
+里亚蒂 11.3357282945
+黄毅 11.9547675029
+川黔滇 12.5143832909
+支局 12.2912397395
+支属 13.900677652
+黄毛 10.7226238216
+访旧 13.900677652
+访日 11.4157710022
+黄毒 11.2616203224
+胡德章 13.2075304714
+一对二 13.900677652
+富春山 11.7034530746
+晚春 11.8212361103
+系列赛 13.900677652
+二十多架 13.2075304714
+恰巧 9.32596667347
+别上 12.2912397395
+坏得 11.5027823792
+柴油机厂 10.8096351986
+救济型 13.900677652
+沙二世 13.900677652
+环保署 12.5143832909
+丹宫 10.4666904475
+三段式 11.7034530746
+奥克萨 13.900677652
+佐拉 13.900677652
+参与 5.29914331213
+中国国民党临时行动委员会 11.598092559
+子长县 11.598092559
+便衣侦探 13.2075304714
+无创伤 12.2912397395
+磨灭 11.1280889297
+沾衣 13.2075304714
+宝珠寺 11.5027823792
+八分斋 13.2075304714
+崖洞 12.2912397395
+煮鹤焚琴 13.900677652
+环保网 13.900677652
+晚景 11.2616203224
+葡糖胺 13.900677652
+丹宁 12.1089181827
+年轻气盛 10.8096351986
+萨韦河 13.900677652
+坏心 11.0103058941
+气概不凡 13.900677652
+牟财 13.900677652
+单赏 13.900677652
+平衡感 12.5143832909
+挖地洞 13.900677652
+晚晴 12.8020653633
+秽行 11.4157710022
+录放机 11.5027823792
+西姆拉 11.1926274509
+解释法 13.900677652
+镇宁县 12.8020653633
+威尔克斯 12.1089181827
+招招 11.9547675029
+种养业 13.2075304714
+詹大 13.2075304714
+斟上 10.0505300503
+子哥 11.2616203224
+参保 9.40086798165
+占款 8.77671367257
+暴风雨 8.97342396682
+暴风雪 10.0940151622
+汉臣之 13.2075304714
+支差 12.1089181827
+陈郡阳 11.4157710022
+多灾多难 11.0103058941
+李继迁 10.4994802703
+支左 12.1089181827
+支工 12.8020653633
+倒时差 13.900677652
+阿什利 13.900677652
+徙边 13.2075304714
+悬肠挂肚 13.900677652
+抵抗者 12.1089181827
+千眼 11.5027823792
+卓茂 13.900677652
+黄竹浦 11.0103058941
+英国史 11.4157710022
+无线网络 11.2616203224
+巴解 11.7034530746
+坏帐 11.5027823792
+比例扩张 13.900677652
+零四个 12.8020653633
+鳌园 12.2912397395
+孙图蒙 13.2075304714
+学时 11.8212361103
+砖模 13.900677652
+招抚 9.08039608637
+有路 10.4349417492
+总瓢把子 13.2075304714
+孙元化 13.900677652
+黄樟 12.8020653633
+鞣酸 10.6818018271
+免疫能力 10.8096351986
+高架铁路 13.2075304714
+克萨哥 12.1089181827
+征用 9.30555780184
+复用技术 12.5143832909
+学而不厌 12.8020653633
+考考你 11.4157710022
+探试 13.2075304714
+赢定 10.4666904475
+藏拙 13.2075304714
+别个 11.0674643079
+优哉游哉 11.5027823792
+污闪 13.2075304714
+连环保 13.900677652
+李仙蕙 12.8020653633
+瘦身操 13.900677652
+詹妮 12.5143832909
+立方公里 13.2075304714
+学政 10.2897597393
+忽闪忽闪 12.5143832909
+蓟镇 10.3453295905
+晚期 7.13103567512
+替身 10.1871055853
+税政 10.9049453784
+招手 8.53470163695
+税收 6.84191949946
+雀巢 10.6818018271
+巴西 7.09828288865
+夜深人静 9.77354326693
+西一路 13.2075304714
+采莲 11.5027823792
+异想天开 10.642581114
+瞟一眼 10.8096351986
+葵花 10.3743171274
+伯涵 12.8020653633
+瞄准 7.86519621945
+解疑释惑 12.8020653633
+叶贵 13.2075304714
+呼拉拉 12.5143832909
+单调 8.76487921493
+自然科学史 11.7034530746
+黑杰克 13.2075304714
+试讲 13.2075304714
+巴契斯 13.900677652
+玛雅人 10.1871055853
+美目 11.5027823792
+算度 13.2075304714
+高雄港 10.5684731418
+百年好合 12.8020653633
+黄背草 12.5143832909
+平衡性 10.9049453784
+遗鸥 13.900677652
+黄檀 10.8561552143
+惹祸 9.94943393339
+黄檗 11.9547675029
+汉高祖 8.85082164473
+小常识 12.2912397395
+卷入漩涡 13.900677652
+坎德 12.1089181827
+日报社 10.4666904475
+铜色 11.7034530746
+英语专业 11.5027823792
+拨作 13.2075304714
+测评 9.66657114738
+作图 10.4994802703
+晚来 10.533381822
+平衡态 9.84023464143
+跳舞场 12.8020653633
+扫灭 11.8212361103
+詹姆 12.1089181827
+德苏 12.1089181827
+图书室 11.0674643079
+测试 7.14723973338
+彭总才 12.8020653633
+句首 12.8020653633
+曼佗罗 13.900677652
+大陆桥 13.2075304714
+诺维萨德 12.5143832909
+单边 7.99531580392
+多哥共和国 13.2075304714
+瞄瞄 12.5143832909
+回航 13.2075304714
+学术化 13.2075304714
+团圆饭 11.5027823792
+食品科学 13.2075304714
+钴胺素 13.900677652
+里德利 13.2075304714
+俞国良 13.900677652
+继续 4.26742525829
+发钞 11.9547675029
+静荡荡 12.8020653633
+妨事 13.2075304714
+桑戈语 13.2075304714
+重实效 13.900677652
+伯颜邀 13.2075304714
+一大笔 10.3171587135
+十六所 13.2075304714
+继绝 13.2075304714
+守口如瓶 10.1630080337
+子域 13.2075304714
+工程建设者 13.900677652
+乐融融 13.900677652
+利润分配 9.75754292558
+西京赋 12.2912397395
+子城 12.8020653633
+约束 6.7054903318
+塔贾隆 12.1089181827
+浪迹 11.1926274509
+凌云塔 13.2075304714
+弃城而逃 12.8020653633
+站不稳 10.765183436
+时紧时松 13.2075304714
+夏西秦 11.9547675029
+坎尼 11.1280889297
+雷东达 12.5143832909
+亿吨 7.51379833261
+犯罪团伙 10.4349417492
+打招呼 8.49350588052
+支应 10.7226238216
+支库 13.900677652
+纺织娘 12.8020653633
+千里迢迢 9.65218240993
+百万英镑 13.2075304714
+赌技 13.900677652
+支座 11.0103058941
+试做 13.2075304714
+编目部 12.8020653633
+杨辅清 12.5143832909
+桃花坞 10.765183436
+幼年时期 11.1926274509
+锁起来 11.5027823792
+铜臭 11.8212361103
+置之度外 9.93038573842
+十年内乱 12.8020653633
+伯济 13.2075304714
+占梦 13.900677652
+全脂奶粉 12.2912397395
+隐形眼镜 9.89334446674
+撞坏 12.5143832909
+敢用 11.7034530746
+恽代英 10.8561552143
+双江口 11.9547675029
+东山再起 9.74179456862
+回送 12.5143832909
+北口 10.2117981979
+访查 11.9547675029
+一二两 13.2075304714
+牙克石 11.5027823792
+面线 13.2075304714
+子坚 12.1089181827
+优越性 9.23723855786
+糯米酒 12.8020653633
+吹过 9.94943393339
+合规性 11.1280889297
+中辍 12.1089181827
+各项政策 9.77354326693
+拉忒亚 13.2075304714
+一炮而红 13.900677652
+禀赋 10.0505300503
+积极参与 8.15447446144
+径向速度 12.2912397395
+米粮川 12.8020653633
+支干 12.1089181827
+穆尔西亚 13.2075304714
+二十多斤 13.2075304714
+四百余万头 13.2075304714
+检肃 13.900677652
+高树勋 13.900677652
+封毕万 12.8020653633
+黄榆 12.8020653633
+美术馆 9.08039608637
+公安人员 10.4041700905
+沔阳县 12.8020653633
+司赞女 12.5143832909
+单轮 11.1926274509
+绿森森 12.2912397395
+单轨 12.1089181827
+糖果厂 13.900677652
+江南运河 10.0294766411
+转过身 7.68207753228
+全日制 10.5684731418
+磨牙 10.2630914922
+中信公司 12.8020653633
+第六感 12.5143832909
+肖克莱 11.598092559
+背诵着 11.8212361103
+点主 13.2075304714
+翻箱倒柜 10.5684731418
+首创人 11.8212361103
+标题新闻 13.2075304714
+争权夺利 9.7898037878
+磨片 12.8020653633
+视死若生 13.2075304714
+美琪 11.8212361103
+阿斯马拉 11.9547675029
+莫克沙 13.900677652
+子围 13.900677652
+子固 13.2075304714
+镍氢电池 10.3453295905
+视觉作用 13.2075304714
+黄桃 12.5143832909
+慕邮 13.2075304714
+辉煌 7.60910851242
+滞后 8.00352378434
+王用修 11.598092559
+中日友好医院 12.8020653633
+刘芳亮 8.47133202302
+黄桐 12.5143832909
+黄桑 12.8020653633
+射雕 12.2912397395
+学林 12.1089181827
+拉托维亚 13.2075304714
+陡立 11.1926274509
+黄桥 11.4157710022
+雄鱼 10.1871055853
+亦非 10.1871055853
+未上市 10.0294766411
+孙文良 12.8020653633
+三百零六幅 13.2075304714
+官茶行 13.2075304714
+试看 10.604840786
+子囊 10.8096351986
+黄桷 13.900677652
+命令句 13.900677652
+被录用者 13.900677652
+黄栌 11.8212361103
+入学 8.74738605748
+零丁洋 11.9547675029
+乌龙潭 12.2912397395
+规范 6.42760856394
+滑坡 9.37888907493
+慢坡 10.604840786
+绮思 13.2075304714
+教学大楼 12.8020653633
+财务总监 9.59661255877
+寓意深远 12.8020653633
+滑块 12.5143832909
+吕通 13.2075304714
+亿唐 13.900677652
+亦需 12.2912397395
+戈达瓦里 11.9547675029
+吉凶祸福 10.765183436
+王叔 12.8020653633
+关勤王 12.1089181827
+合成照 13.900677652
+试着 9.31571017331
+初为人 12.1089181827
+抓去 10.6818018271
+海成阶 12.1089181827
+冒冒险 13.900677652
+齐纳 12.8020653633
+缝下去 13.900677652
+辛香 12.5143832909
+邪魔歪道 13.2075304714
+农牧结合 10.9562386728
+朱志刚 12.5143832909
+安丰军 12.8020653633
+黄棕 12.1089181827
+坎巴 13.900677652
+排泄量 11.4157710022
+喷云吐雾 11.7034530746
+学术 7.32699748502
+捉起来 13.900677652
+滑垒 13.2075304714
+几十万倍 12.5143832909
+满兵 11.1280889297
+地衣 9.56994431169
+拣起 10.5684731418
+学军 13.900677652
+学期 9.63799777493
+送医急救 13.2075304714
+藏思 13.2075304714
+绮想 13.900677652
+广韵 10.8096351986
+诸行百 13.2075304714
+绒线 10.8096351986
+桃花园 13.2075304714
+形势 5.74589007921
+史蒂文斯 10.8096351986
+黄梅 10.5684731418
+干戈扰攘 12.2912397395
+地肤子 12.2912397395
+胞囊 13.2075304714
+江苏舜天 11.9547675029
+学来 9.87532596124
+李卓吾 11.5027823792
+作品 5.88106485758
+得胜 8.30969067146
+知不知道 9.7898037878
+青花瓷 10.1630080337
+非统组织 12.1089181827
+漂荡 11.9547675029
+黄梨 11.3357282945
+丹墀 9.05649056552
+屋上架屋 13.900677652
+税权 13.900677652
+报话机 10.642581114
+刘巧儿 12.1089181827
+西南风 10.0505300503
+救济品 11.9547675029
+丹增 11.598092559
+于谦统 13.2075304714
+单蹄 13.900677652
+怯阵 12.2912397395
+招怨 12.8020653633
+和增仓 13.2075304714
+一概不知 10.7226238216
+景炎 11.3357282945
+尸骨 8.95903522937
+第二通 12.5143832909
+室韦 10.1630080337
+自然遗产 11.2616203224
+耿马傣族佤族自治县 12.5143832909
+常胜将军 11.7034530746
+尸骸 9.26594866375
+琉璃河 10.604840786
+聪明者 13.2075304714
+百分之七 13.900677652
+目标区 11.3357282945
+授精 11.598092559
+划时代 9.04086524761
+伏到 11.4157710022
+黄潭 12.2912397395
+舒曼 10.4994802703
+扶过 13.2075304714
+防火门 12.8020653633
+磨合 10.3171587135
+恰好 7.47580862807
+敏感 6.97018288602
+管理软件 11.9547675029
+辛酸泪 12.8020653633
+景点 9.01787572939
+全息图 11.8212361103
+除旧迎新 13.900677652
+齐鲁晚报 11.5027823792
+密度梯度 12.8020653633
+米洛舍维奇 13.900677652
+税收理论 13.900677652
+白鱼入舟 13.900677652
+张子高 13.2075304714
+身强体壮 11.7034530746
+王瑜 13.900677652
+行为主体 12.8020653633
+亿利 12.1089181827
+玄之又玄 12.5143832909
+作协 10.642581114
+窝风 13.2075304714
+胞兄 11.8212361103
+龙头股 9.36807815882
+招架 9.96885201925
+支墩 11.9547675029
+停船 11.0103058941
+木碗 10.8561552143
+汪直皆 13.2075304714
+单角 12.8020653633
+黄钟之 13.2075304714
+纳斯尔 12.5143832909
+亿分 11.5027823792
+付现金 12.8020653633
+影响面 12.5143832909
+攸县 11.2616203224
+疲惫不堪 9.6811699468
+子关 13.900677652
+子兰 12.2912397395
+试点 7.43142733518
+考风 13.2075304714
+子兴 11.598092559
+赛伯伊 13.900677652
+扶轮 12.8020653633
+滞压 13.2075304714
+寄给 9.48183704418
+巴豆 11.3357282945
+第六条 10.604840786
+美玲 12.2912397395
+晚成 11.8212361103
+衰减 8.98802276624
+黄瑞 12.5143832909
+社会心理学家 11.598092559
+拐棒 11.9547675029
+不胜其扰 13.2075304714
+藏服 13.900677652
+政委员会 12.8020653633
+寻事 11.0674643079
+藏有 8.62256299275
+多公里 8.66956903512
+丹心 11.0103058941
+彭总望 13.2075304714
+杨业之 12.8020653633
+手扶拖拉机 10.0088573539
+子允 13.2075304714
+招来 8.63281949291
+坏官 13.2075304714
+潘叔嗣 13.2075304714
+吹角 12.8020653633
+赵舒翘 11.9547675029
+打灯笼 11.4157710022
+大小球 13.900677652
+黄澎 11.2616203224
+部类 8.20358416547
+公证人员 11.8212361103
+怎个 11.5027823792
+地黄丸 10.8096351986
+弯曲状 13.2075304714
+留尼汪 11.3357282945
+条件刺激 12.1089181827
+子儿 9.71102290995
+钱晓虎 12.8020653633
+刘三姐 11.8212361103
+考题 10.1164880181
+自我牺牲 10.6818018271
+轧断 12.5143832909
+包办代替 13.2075304714
+尔赐 13.2075304714
+第六期 10.533381822
+曹典奇 13.900677652
+王妈妈 11.4157710022
+平镇注 13.2075304714
+作古 11.598092559
+罗利 12.2912397395
+刘嫂子 13.900677652
+丹徒 10.5684731418
+招术 13.2075304714
+孤单单 11.8212361103
+几十万块 12.8020653633
+一滴 8.70218062071
+偶发事件 12.8020653633
+崤函之固 13.900677652
+陨落 10.9049453784
+创造发明 11.5027823792
+中央文史馆 12.8020653633
+单被 11.9547675029
+匈牙利语 11.9547675029
+罗以智 13.2075304714
+机电井 12.8020653633
+公共厕所 10.9562386728
+支委 11.4157710022
+壹仟 13.2075304714
+行骗者 13.2075304714
+数十亿元 11.0674643079
+作到 11.9547675029
+牛疯子 11.2616203224
+调度室 12.1089181827
+二十多户 13.2075304714
+徐复祚 12.5143832909
+八十米 13.2075304714
+双女户 13.2075304714
+新诺明 11.9547675029
+古荥镇 11.8212361103
+唐置伊 12.8020653633
+作别 9.74179456862
+高门卢 12.5143832909
+粮种 13.2075304714
+甘茂德 13.2075304714
+黄清 13.900677652
+智计 12.5143832909
+涉外 9.55687223012
+美特 11.9547675029
+讴歌 9.74179456862
+跳舞厅 13.900677652
+滑入 11.1926274509
+单裤 11.9547675029
+里奇兰 12.8020653633
+排外 10.8096351986
+堤防 9.24671730182
+合成图 12.2912397395
+美版 11.9547675029
+保家卫国 10.9049453784
+呼衍王 11.8212361103
+空战 9.14708746087
+大陆泽 12.5143832909
+善刀而藏 13.900677652
+粮秣 10.0940151622
+化外之民 13.900677652
+学懂 13.900677652
+诺亚方舟 11.1280889297
+刘醒龙 12.2912397395
+会教 13.2075304714
+巴赞 11.9547675029
+滑冰 10.642581114
+保荐人 8.35941410682
+作功 10.0294766411
+几桶 12.1089181827
+亿台 11.598092559
+萨迪 10.8561552143
+望乡 11.8212361103
+样片 13.2075304714
+亿只 11.4157710022
+子健 13.900677652
+芳烃 9.82314020807
+二百一十五章 12.8020653633
+壁上观 12.1089181827
+北风吹 11.5027823792
+萨迦 10.5684731418
+第二十三回 11.7034530746
+魁伟 10.604840786
+班加拉 12.8020653633
+小村镇 11.9547675029
+彭总昕 12.8020653633
+笨拙 9.27570483869
+江郎才尽 12.5143832909
+明群礁 12.1089181827
+作势 10.8096351986
+辉石 9.75754292558
+袁时泰 10.765183436
+亿发 12.8020653633
+十副 13.900677652
+马齿徒增 13.900677652
+巴赫 9.96885201925
+深呼吸 10.3743171274
+稀释剂 11.598092559
+一立方米 12.1089181827
+国内法 10.2117981979
+巴贝 13.2075304714
+萨达 12.5143832909
+乌梁海人 13.2075304714
+悄悄话 10.4666904475
+慕陵 13.900677652
+提腕 13.900677652
+滑出 11.3357282945
+胜利归来 11.8212361103
+敏惠 13.900677652
+难得一见 10.7226238216
+万苦千辛 13.2075304714
+农复会 13.900677652
+生抽 12.2912397395
+单衫 12.8020653633
+美发 11.1926274509
+回潮率 12.1089181827
+伏坦主 13.2075304714
+手挽袋 13.900677652
+谭宗亮 13.900677652
+单衣 10.8561552143
+惠崇 12.8020653633
+磁滞回线 11.5027823792
+脱落下来 12.1089181827
+安之若素 12.8020653633
+出口商品 9.0884932966
+坎宁 11.9547675029
+香加皮 13.900677652
+修真养性 12.5143832909
+广宁镇 12.8020653633
+单行 9.85762638414
+实验点 12.8020653633
+帘子线 12.2912397395
+虹吸式 12.8020653633
+主管者 13.2075304714
+类药物 9.37888907493
+蒸糕 13.2075304714
+盘庚弟 12.8020653633
+日寇 9.29550746599
+子史 11.8212361103
+滑到 10.765183436
+油椰子 13.900677652
+寄籍 12.5143832909
+子叶 10.4666904475
+第二遍 11.598092559
+辉瑞 11.598092559
+贞淑 13.900677652
+余舟 12.8020653633
+承东启 13.900677652
+子口 9.7898037878
+电器产品 11.8212361103
+蔫耷耷 12.8020653633
+学报 9.34680076038
+滑利 11.5027823792
+夏大豆 13.900677652
+部级 10.4666904475
+战斗活动 11.9547675029
+动物细胞 11.4157710022
+二十二里 13.900677652
+弛懈 12.5143832909
+拥护者 10.0505300503
+黄浦 11.3357282945
+坏处 9.87532596124
+土壤条件 11.598092559
+测谎 13.900677652
+明细表 12.8020653633
+白厉厉 12.2912397395
+甘南藏族自治州 11.1926274509
+以此为荣 12.1089181827
+餐椅 13.900677652
+随俗 11.5027823792
+黄海 8.1902506346
+滑天下之大稽 13.900677652
+发汗药 13.2075304714
+铁娘子 13.900677652
+金克木 11.9547675029
+黄洋 13.2075304714
+警视厅 13.2075304714
+单说 9.72629038208
+轧机 11.4157710022
+随便 6.76578680041
+粮站 10.1394775363
+素洁 12.8020653633
+封盘 11.0674643079
+敏捷 8.80692745117
+常香玉 11.3357282945
+俸钱 13.2075304714
+藏族 8.22392384971
+随侍 10.1164880181
+隐然敌国 13.900677652
+娃娃脸 11.8212361103
+雕铸 13.900677652
+要言妙道 13.2075304714
+别使 13.900677652
+太乙金 12.5143832909
+卓著 9.40086798165
+凌云山 11.8212361103
+单词 9.21854642485
+砌块 12.1089181827
+亿倍 12.1089181827
+李信笑 11.8212361103
+宣告破产 10.4666904475
+类地行星 12.5143832909
+历史使命感 12.5143832909
+子厉 13.2075304714
+单证 11.2616203224
+正经人 11.4157710022
+赵明明 13.900677652
+丹崖 11.3357282945
+文艺性 12.8020653633
+薛尚书 11.7034530746
+解除合同 11.598092559
+粮税 13.900677652
+白费蜡 13.900677652
+衰变 9.04086524761
+子卿 13.2075304714
+几百首 12.8020653633
+一大群 8.7245279194
+斯泰德 13.2075304714
+甄氏 12.2912397395
+涉嫌 7.63727938938
+扶起 8.9519177616
+不甘雌伏 13.900677652
+滑动 9.19114745066
+行为障碍 11.9547675029
+丹巴 11.4157710022
+税户 10.7226238216
+学成 10.2371160058
+安歇吧 12.5143832909
+招数 9.37888907493
+轧染 13.900677652
+不久重 13.900677652
+外联部 12.8020653633
+平衡杆 12.1089181827
+有着落 11.5027823792
+千点 11.0674643079
+好时机 9.15574552361
+不断创新 9.80633308975
+子华 13.2075304714
+棘手 8.98802276624
+眉山县 13.2075304714
+平衡木 11.2616203224
+但应 9.91169360541
+考验 7.07630398193
+子区 13.2075304714
+德布勒森 13.900677652
+扶贫 9.82314020807
+罗近溪 12.8020653633
+一两遍 13.900677652
+令人心醉 11.9547675029
+爷儿仨 13.2075304714
+作准 12.5143832909
+平衡机 12.5143832909
+小人儿 10.4041700905
+贞洁 11.1926274509
+欣喜欲狂 13.2075304714
+任宣差 12.2912397395
+不知下落 10.4666904475
+罗西里 11.8212361103
+子化 13.2075304714
+招收 8.92394390956
+景物 8.65893063692
+第十三层 12.8020653633
+第三十五回 11.9547675029
+作出 5.72653830855
+拨万论千 13.900677652
+叶轮式 12.1089181827
+暂时性 9.72629038208
+高树图 13.2075304714
+来去自由 12.1089181827
+十万顷 13.2075304714
+电炉 10.0940151622
+能伸能屈 13.900677652
+沾边 10.0088573539
+子勰 13.2075304714
+景王 12.1089181827
+城工部 12.5143832909
+油光光 11.8212361103
+潜行者 12.8020653633
+助力器 13.2075304714
+失传已久 11.3357282945
+税控 12.1089181827
+詹弹 13.2075304714
+萨赫 12.1089181827
+雀子 12.8020653633
+小红帽 12.8020653633
+淄博 9.24671730182
+子勤 11.9547675029
+双列杂交 13.900677652
+目标值 10.4349417492
+敢点 13.900677652
+糖馅 13.900677652
+随从 8.41173992582
+黄汤 10.5684731418
+萨赖 12.1089181827
+国内游 11.5027823792
+黄池 11.9547675029
+勾股形 13.900677652
+彪悍 11.4157710022
+巴迪 12.1089181827
+随他 9.89334446674
+亿元 4.49889081543
+贝可勒尔 11.1926274509
+博尼法 11.9547675029
+中央委员会 8.70218062071
+贸易条件 11.3357282945
+颅息 13.900677652
+巴辛 13.900677652
+磨石 11.4157710022
+丁德尔 12.8020653633
+腐植酸 12.1089181827
+林间空地 12.5143832909
+作假 10.3743171274
+丹尼 11.7034530746
+从头来起 12.5143832909
+两只手 8.30969067146
+炒房者 11.7034530746
+讨还血债 12.8020653633
+大守宫 11.9547675029
+巴达 11.4157710022
+史学史 10.1164880181
+文物展 13.900677652
+莫洛修 13.2075304714
+柯尔律 11.2616203224
+子力 13.2075304714
+放下去 11.1926274509
+几百顷 13.2075304714
+扫盲 10.3171587135
+陈瑞如 13.2075304714
+巴吞鲁日 12.1089181827
+凯普莱特 13.2075304714
+文物局 10.5684731418
+黄水 9.28555713513
+绷场面 13.900677652
+凡尔赛 9.33632946051
+餐桌 9.82314020807
+烟消火灭 13.900677652
+几十万吨 12.8020653633
+瓦尔多 13.900677652
+一百亿美元 13.2075304714
+黄泉 10.2897597393
+滑去 13.2075304714
+性本善 12.2912397395
+滑县 9.6811699468
+何训示 12.8020653633
+招摇 10.1871055853
+胡猜 11.598092559
+秦大哥 12.8020653633
+涉密 10.8096351986
+万永年 9.46986085313
+合同额 11.1926274509
+短不了 12.8020653633
+随之 6.7981782962
+霍布逊 13.900677652
+木制品 11.4157710022
+黄泥 9.77354326693
+勤杂工 12.1089181827
+帘子布 11.0674643079
+钥匙 7.93453091285
+多聚甲醛 12.8020653633
+本溪县 12.2912397395
+波莫瑞 12.5143832909
+有头无尾 13.2075304714
+葡聚糖 12.2912397395
+会改 13.900677652
+张璁倡 13.2075304714
+沃茨 13.900677652
+莫合烟 13.2075304714
+部署 6.71000161764
+赌本 13.2075304714
+陈光崇 12.5143832909
+陆海空 11.1280889297
+纲常扫地 13.900677652
+淀粉样变 12.8020653633
+任命者 13.2075304714
+一概不理 12.8020653633
+随上 11.9547675029
+呼呼大睡 10.8096351986
+子刚 12.8020653633
+研究生班 11.598092559
+铁钩 11.598092559
+小儿子 9.29550746599
+黄沾 13.900677652
+丁丁当当 11.9547675029
+近距离 8.97342396682
+亿册 12.5143832909
+黄油 10.3743171274
+税捐 11.7034530746
+李补之 12.2912397395
+试验装置 11.9547675029
+黄河 6.26392553954
+测距 9.66657114738
+冒雪 10.9049453784
+诸门 11.598092559
+征求 8.57280148319
+小石坝 12.5143832909
+作伐 13.2075304714
+山开石 13.2075304714
+守门员 10.8561552143
+认真细致 13.2075304714
+三万二千 12.8020653633
+指头肚儿 13.900677652
+胃仓 13.900677652
+神圣职责 11.9547675029
+拳师 12.1089181827
+正负号 12.2912397395
+二硫化物 12.5143832909
+暴弃 13.900677652
+低声下气 10.7226238216
+砥柱中流 13.900677652
+建筑机械 11.9547675029
+作伴 10.2117981979
+眼底 9.36807815882
+眼库 13.900677652
+参团 13.900677652
+匪窝 13.900677652
+不远万里 11.3357282945
+整体健康 12.8020653633
+漫反射光 12.5143832909
+年均值 11.2616203224
+宣传者 11.8212361103
+侦破小说 13.2075304714
+严格纪律 12.8020653633
+扁桃腺 13.2075304714
+作伪 11.0103058941
+幼鱼 9.93038573842
+思想开放 13.2075304714
+巴郡 10.604840786
+作何 10.533381822
+四战之地 12.2912397395
+单间 10.2371160058
+黄猄 13.2075304714
+学系 10.2371160058
+调回去 13.2075304714
+诺比 13.900677652
+单门 12.1089181827
+黄须儿 13.2075304714
+望红娘子 13.900677652
+亦谨 13.900677652
+世俗之见 12.5143832909
+作出姿态 13.2075304714
+亿两 12.2912397395
+李继隆 12.8020653633
+张掖市 11.9547675029
+拨回 10.2371160058
+有线 9.84023464143
+累积下来 13.2075304714
+弘时 11.5027823792
+油脂粒 12.8020653633
+小商贩 10.9562386728
+降尘 12.8020653633
+智障 11.2616203224
+主体化 13.2075304714
+随军 8.83808261895
+表层结构 12.8020653633
+亿万 9.7898037878
+城乡居民 9.27570483869
+杨业功 13.900677652
+农业布局 11.8212361103
+马踏连 12.8020653633
+牵牛花 11.4157710022
+防辐射 10.1630080337
+亿份 8.18364995057
+试油 13.2075304714
+第九人 13.900677652
+农业机器 12.8020653633
+资讯中心 13.900677652
+惹急 11.8212361103
+全村人 9.82314020807
+免疫抗体 13.900677652
+心脏病发 13.900677652
+单键 10.9562386728
+崖畔 11.4157710022
+小石城 11.8212361103
+景气 7.54456999128
+广达 11.4157710022
+起急 13.2075304714
+小茅屋 9.59661255877
+黄班 13.2075304714
+格兰迪 13.900677652
+亚铁 11.2616203224
+冯尼格 13.2075304714
+一百五十公里 12.8020653633
+眼帘 9.94943393339
+华东师大 12.8020653633
+苗瑶 10.8096351986
+军威 10.3171587135
+离子化 13.900677652
+步步进逼 11.2616203224
+流过去 12.8020653633
+惹怒 11.1926274509
+发光体 11.2616203224
+农转非 12.8020653633
+请进去 11.4157710022
+荆忠 13.2075304714
+黄王 13.2075304714
+作俑 13.2075304714
+吴延陵 12.8020653633
+作保 10.765183436
+宫密奏 13.2075304714
+利亚语 13.2075304714
+检验 7.12189275429
+就地正法 11.0674643079
+李逢吉 12.8020653633
+税类 13.900677652
+惹恼 10.1164880181
+亿亩 10.4666904475
+学术报告 12.8020653633
+宾果 13.2075304714
+利亚诺 12.5143832909
+北约组织 10.2371160058
+能吃能喝 12.5143832909
+黄玮 12.5143832909
+忍下来 12.8020653633
+才德兼备 13.2075304714
+及冠 13.900677652
+籍京师 12.2912397395
+一两辆 13.2075304714
+单镒 12.8020653633
+千里驹 12.8020653633
+崖画 11.9547675029
+黄玲 13.900677652
+学籍 10.642581114
+吹绵蚧 12.5143832909
+千滴 12.8020653633
+海得尔 12.8020653633
+黄牌 11.0674643079
+安睡在 13.900677652
+生存型 12.2912397395
+作东 12.1089181827
+公园路 13.2075304714
+作业 7.30900391997
+讼费 13.900677652
+巴里 9.84023464143
+单钩 13.2075304714
+卡盖拉 12.1089181827
+黄牙 10.8096351986
+第六章 9.38981814546
+拨款 9.18217878068
+转捩 12.2912397395
+第六站 13.900677652
+性情温和 11.7034530746
+伊里齐 13.2075304714
+珍异 10.4666904475
+应变能力 10.4349417492
+作主 9.24671730182
+伸起 12.5143832909
+控制技术 10.3743171274
+汪芒氏 13.900677652
+衣原体 10.604840786
+专用地图 13.900677652
+腊玛古猿 11.1926274509
+祖国各地 12.2912397395
+波义耳 13.900677652
+冷板凳 11.598092559
+淤斑 13.900677652
+苗疆 11.7034530746
+单链 10.765183436
+绘图室 13.900677652
+作乐 10.5684731418
+瘪瘪的 12.8020653633
+北京对外经济贸易大学 13.900677652
+中央政策研究室 12.2912397395
+卜午 13.2075304714
+灶口 11.8212361103
+知人善任 10.7226238216
+窝藏 10.0720362555
+占多数 9.28555713513
+成链状 12.8020653633
+邂逅相遇 12.1089181827
+江奈生 13.2075304714
+合成孔径 11.5027823792
+作乱 9.44633035572
+测量船 10.8096351986
+赔偿款 11.5027823792
+退格 13.2075304714
+密码界 12.5143832909
+商标法 10.765183436
+黄父 13.2075304714
+执迷不悟 10.3171587135
+相传已久 13.900677652
+景深 11.9547675029
+征派 11.1280889297
+蒙着红 11.9547675029
+丁子峻 13.900677652
+金循宋 12.5143832909
+团费 11.8212361103
+柔能克刚 13.2075304714
+第二次国内革命战争 9.91169360541
+罹患 10.2897597393
+尸蜡 12.5143832909
+作些 10.3171587135
+涧磁村 12.8020653633
+试液 11.1280889297
+耕作机 12.5143832909
+胚体 11.4157710022
+戏本 12.5143832909
+日产量 10.4349417492
+亿俩 13.900677652
+厥为 13.900677652
+黄狗 10.765183436
+理想国 10.6818018271
+黄狐 13.900677652
+原核细胞 10.9562386728
+盖房子 9.69598503258
+景洪 11.0674643079
+芳泽 13.900677652
+本片 12.5143832909
+食欲不振 9.71102290995
+作人 11.8212361103
+黄狼 12.2912397395
+协商一致 10.1164880181
+富姐 13.2075304714
+赌神 13.900677652
+点将台 12.2912397395
+电池组 10.3171587135
+林斤澜 12.8020653633
+飘飘然 10.9562386728
+泰得 13.900677652
+眼影 11.598092559
+美满 9.96885201925
+津浦路 11.4157710022
+面包车 9.75754292558
+新安江水库 12.1089181827
+紫茉莉 12.2912397395
+目标价 8.74738605748
+高台县 13.900677652
+壳里 10.7226238216
+拳心 12.5143832909
+迫害致死 10.9049453784
+狄克逊 12.5143832909
+克劳迪 13.2075304714
+餐盒 12.8020653633
+作价 9.58318953844
+城管局 11.5027823792
+轩昂 10.4041700905
+指挥家 9.84023464143
+波爱修 13.2075304714
+况兼 11.5027823792
+沾酒 12.2912397395
+时乖运蹇 13.2075304714
+霍光死 13.2075304714
+朱紫国 11.1280889297
+沈顺招 13.2075304714
+指挥室 11.1280889297
+轧碎 13.2075304714
+石漫滩 12.8020653633
+地形模型 13.900677652
+章台柳 13.2075304714
+赔偿案 13.2075304714
+随叫 13.900677652
+挠头 10.604840786
+无法估量 11.1280889297
+指挥塔 10.0940151622
+随口 8.71329184614
+单鞭 12.2912397395
+舌头 7.72897705456
+滨海区 11.9547675029
+先期到达 12.5143832909
+学级 13.900677652
+雷电交加 12.2912397395
+贫无立锥 13.2075304714
+考虑 5.19352547664
+严智怡 13.2075304714
+高克 12.8020653633
+富婆 11.9547675029
+马艳丽 11.4157710022
+爷娘 11.0103058941
+黄煦 13.900677652
+博阿兹 12.8020653633
+动肝火 12.5143832909
+季米特里 12.8020653633
+铁笼子 11.598092559
+系统软件 10.1630080337
+民族意识 10.1394775363
+可可树 12.2912397395
+第六种 13.2075304714
+单鞋 13.2075304714
+不冻港 11.1926274509
+滑下 11.0674643079
+辅酶 10.604840786
+测速 10.8561552143
+备用系统 13.2075304714
+催眠术 12.1089181827
+单音 12.2912397395
+硫代磷酸 13.2075304714
+中非国家 13.900677652
+扫毒 12.8020653633
+序论 11.5027823792
+黄焖 12.8020653633
+两万名 11.7034530746
+招福 13.900677652
+扮得 12.8020653633
+欺敌 12.5143832909
+魏禄 13.2075304714
+一百零八响 13.2075304714
+霅溪 13.2075304714
+许定国 11.598092559
+和岩脉 13.2075304714
+藏私 13.900677652
+给你爱 13.2075304714
+学组 13.900677652
+认识一下 11.3357282945
+子侄 9.69598503258
+宣威市 13.2075304714
+美浓 13.2075304714
+鹿谷乡 12.8020653633
+薛尚功 12.8020653633
+何烧戈 13.2075304714
+寄情 11.1926274509
+国储铜 11.9547675029
+滨海县 13.2075304714
+部门化 13.2075304714
+阿萨勒 12.2912397395
+做手脚 10.4994802703
+扁平足 13.2075304714
+黄燕 12.2912397395
+随即 6.03702638653
+牵回 12.1089181827
+眼尖 10.1394775363
+子体 11.7034530746
+孟昭英 13.2075304714
+随叫随到 11.7034530746
+一大排 11.9547675029
+跖骨 12.1089181827
+红娘子 7.25428713713
+广泛开展 9.61021821083
+腹水 10.0088573539
+开发署 12.2912397395
+长期债务 12.1089181827
+子雅谑 13.2075304714
+阴阴沉沉 12.8020653633
+疮痍满目 11.7034530746
+擒敌 12.5143832909
+发过来 11.7034530746
+单于入朝 13.2075304714
+呼和浩特 9.08039608637
+王立司南 13.900677652
+葛洛夫 12.8020653633
+支小小 13.2075304714
+参合 10.9562386728
+渔翁得利 12.1089181827
+辛胜 12.8020653633
+黄熟 11.3357282945
+检查督促 12.5143832909
+用得着 9.01787572939
+美国丽人 13.900677652
+破竹之势 11.9547675029
+传统名称 12.8020653633
+爱别离苦 13.900677652
+单靠 9.75754292558
+单面 10.533381822
+精金美玉 13.900677652
+子休 12.8020653633
+呼衍氏 13.2075304714
+子会 12.5143832909
+元天福 12.1089181827
+篇幅 8.94485059437
+逃上来 13.900677652
+甲胎蛋白 11.4157710022
+访美 11.0103058941
+眼屎 11.1926274509
+公门中 11.9547675029
+决策当局 12.2912397395
+萨德科 13.900677652
+子仲 11.9547675029
+鱼腥味 12.1089181827
+胃炎 10.3453295905
+回龙 12.5143832909
+鞍马 9.20932976975
+略见一斑 13.2075304714
+轧空 13.900677652
+折卖 12.8020653633
+磺化煤 13.2075304714
+贞烈 12.8020653633
+子代 9.96885201925
+一大截 9.96885201925
+丹纳 11.2616203224
+絮叨 10.8561552143
+娃娃鱼 10.5684731418
+衰乱 11.7034530746
+富孀 12.2912397395
+添油加醋 10.8096351986
+唯能论 12.5143832909
+俄罗斯联邦政府 12.2912397395
+栓子 11.1280889297
+拐着 13.900677652
+玉屏侗族自治县 11.9547675029
+美气 11.5027823792
+双滦区 12.5143832909
+鹤城 11.9547675029
+燃烧剂 11.9547675029
+斯莫尔尼宫 12.1089181827
+林斯克 12.5143832909
+随动 10.765183436
+博登湖 11.7034530746
+邮寄 9.71102290995
+排量车 9.91169360541
+迎来 6.74528135008
+程序模块 13.2075304714
+子产 10.642581114
+罗那 13.2075304714
+高架桥 11.8212361103
+王传淞 13.2075304714
+北京公交 12.8020653633
+克莱斯特 11.1926274509
+磨毛 13.2075304714
+阶层 7.85094419674
+子云 11.9547675029
+诸王同 13.2075304714
+朱小兰 13.900677652
+二十多米 11.7034530746
+石城郡 12.8020653633
+陈祥生 10.1630080337
+千口 11.9547675029
+一亿二千万 12.8020653633
+偷水 11.598092559
+封建制度 9.21854642485
+白城 9.69598503258
+立宪保 13.2075304714
+正派人 11.3357282945
+满门 11.5027823792
+参商 12.2912397395
+吹雪 11.9547675029
+高科技股 12.2912397395
+皇子皇孙 13.900677652
+衰仔 11.598092559
+裴合 12.1089181827
+史学会 10.4349417492
+鄙薄 10.642581114
+杨业兵 13.2075304714
+黄烟 11.9547675029
+子书 11.7034530746
+蒋红星 12.5143832909
+求死不能 13.2075304714
+指日成功 13.900677652
+危地马拉政府 12.8020653633
+四十多万两 12.8020653633
+六欲 12.8020653633
+子乐 11.9547675029
+五里雾中 12.1089181827
+小队长 10.642581114
+子乙 13.900677652
+德意志银行 9.29550746599
+汀江 10.765183436
+心善 12.5143832909
+日用化工 10.5684731418
+萨里 11.0103058941
+具体分析 9.98865464655
+黄烷 13.2075304714
+子么 11.9547675029
+师傅 7.25558668247
+气垫船 10.4994802703
+黄炎 12.1089181827
+暴虐无道 12.8020653633
+黎曼积分 11.9547675029
+缴存 10.3171587135
+四十五六岁 12.8020653633
+恰巧是 11.2616203224
+子丹 11.4157710022
+吹棒 13.900677652
+疫区 11.7034530746
+富家 9.7898037878
+一江之隔 12.2912397395
+望洋兴叹 11.2616203224
+万英尺 12.8020653633
+极小值 10.9049453784
+无所不容 13.900677652
+随到 10.7226238216
+饿殍载道 11.7034530746
+和修佛 13.900677652
+有史以来 8.84443184663
+洗衣店 13.2075304714
+富宁 11.9547675029
+子丘 13.900677652
+胆汁质 12.8020653633
+序言 9.37888907493
+衰亡 9.65218240993
+舐犊情深 13.2075304714
+噪杂 11.8212361103
+交接仪式 11.9547675029
+集体领导 11.0103058941
+富实 11.7034530746
+支出额 12.2912397395
+武宗子 12.5143832909
+美法 12.2912397395
+老奴才 12.1089181827
+信息港 12.2912397395
+试样 9.80633308975
+许文 11.9547675029
+开关电源 12.1089181827
+关门大吉 12.8020653633
+拨动 9.98865464655
+大田作物 11.7034530746
+生存力 10.6818018271
+想得到 9.20019728618
+绮罗 11.1280889297
+藏羌 13.2075304714
+序跋 10.9049453784
+古庙中 13.900677652
+罗塞蒂 11.9547675029
+离子型 10.4994802703
+三十出头 11.1926274509
+保存起来 11.5027823792
+程普保 13.2075304714
+舌弓 13.2075304714
+十四目 12.8020653633
+聚变反应 11.0674643079
+饥寒 10.2897597393
+寄居 9.93038573842
+暴动 8.48903160012
+考考 11.8212361103
+水路运输 10.7226238216
+一个六口 13.900677652
+谐振子 11.598092559
+曾子亲 13.2075304714
+液体石蜡 11.8212361103
+图形工作站 12.8020653633
+不完全性 11.598092559
+欠费 11.1926274509
+零存整取 12.8020653633
+夏皮罗 12.2912397395
+孙德崖 13.2075304714
+参加 5.0710122193
+会计凭证 13.2075304714
+利古里亚 12.2912397395
+安格隆 12.8020653633
+一千六百一十六万余 13.2075304714
+富尔 11.9547675029
+英国人 7.6165434909
+画栋雕梁 11.5027823792
+理想化 9.93038573842
+唇腭裂 13.2075304714
+胃石 13.900677652
+普瓦图 12.5143832909
+参劾 11.0103058941
+芳华 13.900677652
+比亚河 13.900677652
+新浪潮 10.9049453784
+用得上 10.642581114
+铜鼓 10.1164880181
+撞墙 11.5027823792
+网络新闻 11.8212361103
+拨到 11.0674643079
+同流合污 10.604840786
+方逢时 13.2075304714
+载沣 9.96885201925
+铜鼎 10.2897597393
+宋哥哥 11.8212361103
+格拉茨 10.8096351986
+周世宗 9.98865464655
+忐忑 9.96885201925
+女足赛 13.900677652
+傅察 11.8212361103
+蛋白尿 9.91169360541
+鱼贯登 13.2075304714
+毒辣辣 13.2075304714
+小军鼓 12.8020653633
+信息源 11.3357282945
+黄石 9.85762638414
+辅音 9.61021821083
+校长助理 12.5143832909
+萨丽哈 13.2075304714
+悲惨遭遇 10.604840786
+邮局 9.14708746087
+空间转动 13.2075304714
+拐点 7.93453091285
+吴桥 11.9547675029
+胡一雅 13.2075304714
+暴富 9.09665660724
+金嗓子喉宝 12.8020653633
+富岳 13.2075304714
+载波 10.4994802703
+利率差 13.2075304714
+二十多篇 13.900677652
+邮展 11.1280889297
+一大早 8.61747392324
+及格 10.9562386728
+受众 10.0088573539
+康克俭 9.20932976975
+高架铁道 13.900677652
+八十斤 11.598092559
+中计 9.5062284973
+身体虚弱 10.642581114
+梁鸿 12.8020653633
+济南市 9.91169360541
+悄悄儿 11.0103058941
+解可表 13.2075304714
+斯廷罗 13.900677652
+圣母子 11.7034530746
+当回事 9.63799777493
+两千八百二十匹 13.2075304714
+拨去 12.2912397395
+和好如初 12.2912397395
+鞣质 11.4157710022
+总后勤部 11.5027823792
+桐油树 13.900677652
+擒拿 10.2897597393
+陆子冈 11.8212361103
+透析机 13.900677652
+掷标枪 12.5143832909
+业务收入 8.94485059437
+设宴招待 12.1089181827
+北京政府 9.36807815882
+于佛义 13.2075304714
+周宣王 10.0720362555
+阿拉木图宣言 11.9547675029
+罗戴恩 12.2912397395
+藏纳 10.7226238216
+流盼 12.5143832909
+风从虎 12.5143832909
+低下去 11.0674643079
+萨非 11.1280889297
+千次 12.1089181827
+寄来 9.38981814546
+格拉芙 12.2912397395
+黄白 10.4666904475
+刘宗周 8.96620371885
+乱麻 10.5684731418
+粤方言 11.598092559
+阿尔穆尼亚 11.2616203224
+武进区 11.598092559
+香港大学 10.533381822
+依法行事 13.900677652
+奄奄待毙 12.2912397395
+拨号 11.0103058941
+秽闻 13.2075304714
+省立医院 13.900677652
+拨叫 13.900677652
+受伤 7.25169310195
+寄望 10.0940151622
+守兵 10.642581114
+火药味 10.4349417492
+比例中项 12.8020653633
+藏经 10.765183436
+学科 6.71832554009
+一对半 13.2075304714
+随和 9.48183704418
+税种 9.04086524761
+邮差 12.8020653633
+巴黎大学 9.26594866375
+吹送 11.3357282945
+拨发 13.2075304714
+千步 10.6818018271
+莫拉维 11.598092559
+限定词 13.900677652
+丁甲神 13.900677652
+部族 8.04274449749
+深圳大学 12.5143832909
+珍存 12.5143832909
+日入而息 13.900677652
+立英宗 13.2075304714
+几十万个 12.2912397395
+远远地 8.21709788464
+举杯畅饮 13.900677652
+换斗移星 12.5143832909
+状子 9.77354326693
+假分数 13.900677652
+几十万两 13.2075304714
+学社 10.2117981979
+亚洲司 13.900677652
+东西南北中 12.1089181827
+黄盖 9.96885201925
+广东核电集团 11.5027823792
+古尔德 11.8212361103
+非淋菌性 12.8020653633
+犁锄 13.2075304714
+张国梁 12.8020653633
+告病 11.2616203224
+徐泰来 9.74179456862
+顾长卫 12.8020653633
+忘忧草 12.8020653633
+安丰侯 13.2075304714
+低等动物 11.0103058941
+撒哈拉 9.02548032877
+审断 11.1926274509
+向敏 13.2075304714
+单选 13.900677652
+随员 10.604840786
+珍宝 8.75901409547
+富川 11.9547675029
+叫个不停 11.0674643079
+维翰为 13.900677652
+税票 12.5143832909
+纪胜 11.7034530746
+浮屠 11.0674643079
+武进县 10.9049453784
+装出 8.99540287354
+曾家岩 13.900677652
+笔杆儿 13.900677652
+栏目主持 13.900677652
+盛宣怀 8.33615724465
+可切除 12.2912397395
+格格儿 12.2912397395
+翻白眼 10.9049453784
+爱弥儿 12.5143832909
+黄皮 11.1926274509
+随后 5.68756695438
+眼孔 11.4157710022
+随同 8.78268383956
+寻人启事 11.2616203224
+单道 11.1926274509
+唐陈玄 13.2075304714
+价值形式 9.29550746599
+罗思诸 12.1089181827
+按摩院 13.900677652
+从显庆 12.8020653633
+空欢喜 11.8212361103
+抢救出来 12.1089181827
+滚齿机 12.1089181827
+巴锡 11.0103058941
+咳声 12.1089181827
+格林纳丁斯 11.2616203224
+临时中央政治局 11.9547675029
+棘突 11.5027823792
+刘铭传 11.1926274509
+任蜀州 13.2075304714
+合成气 11.4157710022
+美兰 12.8020653633
+辩论 8.37522471284
+富平 11.1280889297
+党纪政纪 12.1089181827
+附带性 13.900677652
+孢子异型 13.900677652
+窃盗 11.8212361103
+影视节目 11.9547675029
+利隆圭 12.1089181827
+和慧剑 11.9547675029
+可可西里山 10.765183436
+济阳 11.7034530746
+占理 12.5143832909
+女警官 13.2075304714
+巴雷 11.8212361103
+扶持着 11.7034530746
+添水 11.2616203224
+眉间 10.2630914922
+化为泡影 10.8561552143
+凌叔华 13.2075304714
+一千五百里 12.8020653633
+合成氨 9.77354326693
+文化水准 13.900677652
+花工 13.900677652
+千样 12.2912397395
+波纹管 12.2912397395
+吉木萨尔 10.765183436
+腹沟 13.2075304714
+江宁监 13.2075304714
+白马井 11.8212361103
+币种 10.3171587135
+侧腹 12.8020653633
+转手 9.05649056552
+胃痛 10.4666904475
+学童 10.8096351986
+无放射性 13.900677652
+巴隆 12.2912397395
+女警察 13.2075304714
+护肤用品 13.2075304714
+言谈话语 12.2912397395
+刘太监 11.5027823792
+砌体 12.8020653633
+肯过来 13.900677652
+深南电 10.1164880181
+从里向外 12.8020653633
+载湉 11.1280889297
+黄田 12.5143832909
+拉拉山 13.2075304714
+您好 8.73019365694
+继承 6.60290936944
+牙槽骨 11.8212361103
+第三十条 12.8020653633
+亨廷顿 11.2616203224
+宋江定 13.2075304714
+耍嘴皮 13.900677652
+翻箱倒箧 13.900677652
+输出阻抗 12.1089181827
+漏风 11.2616203224
+妙极了 11.3357282945
+时气 11.7034530746
+匍匐茎 11.1926274509
+河桥东 13.2075304714
+听说 5.61870059311
+华宫 12.2912397395
+辩认 12.8020653633
+不大想 13.2075304714
+边望 12.5143832909
+卡奔塔 12.2912397395
+生鲜 11.7034530746
+大王峰 12.5143832909
+天天向上 12.2912397395
+田买土 13.2075304714
+昏昏沉沉 9.75754292558
+白而青 13.2075304714
+转换率 12.1089181827
+学究 9.09665660724
+未尝不可 10.1164880181
+晋升制度 13.900677652
+阳相火 13.2075304714
+焦孔达 13.2075304714
+富庶 9.04086524761
+富康 12.2912397395
+载满 11.598092559
+二十多种 13.900677652
+随地 10.3171587135
+削减成 13.2075304714
+子玉 10.2897597393
+继成 13.2075304714
+和振型 13.2075304714
+踱去 10.2117981979
+合理配置 10.0720362555
+鱼肉人民 12.2912397395
+伏尔加河 9.00283785202
+智通 12.1089181827
+人造黄油 12.5143832909
+六韬三略 12.5143832909
+试剂 8.62767809341
+艺术细胞 12.5143832909
+连接反应 13.900677652
+武宗微 13.2075304714
+封密奏 11.9547675029
+侧耳 9.32596667347
+焕发起来 12.1089181827
+刘昌蓉 11.9547675029
+新鲜事 10.642581114
+占用 8.35941410682
+耐久 10.0294766411
+桃园县 11.3357282945
+占田 10.2630914922
+海鲜酒楼 13.900677652
+里德伯 11.5027823792
+照射率 13.900677652
+梅香帮 13.2075304714
+赫赫扬扬 12.8020653633
+颁证会 13.900677652
+学生档案 13.900677652
+炉顶 11.7034530746
+格拉肖 12.8020653633
+素油 12.8020653633
+广东音乐 11.0674643079
+中讲 12.8020653633
+集体合同 11.9547675029
+巴音 10.5684731418
+拳头 7.71241352889
+舌尖 9.4233408375
+挺不错 10.8096351986
+热意 13.900677652
+苦挣 11.9547675029
+拨出 9.66657114738
+恣横 12.5143832909
+呼噜声 12.5143832909
+中级工 13.900677652
+晚秋 10.2897597393
+华伦斯 11.9547675029
+法德勒 13.2075304714
+那舜 13.900677652
+拳套 11.9547675029
+编辑部 9.54396882529
+磨嘴 12.5143832909
+迅猛发展 9.38981814546
+骒马 12.5143832909
+富弼 11.0103058941
+富强 9.18217878068
+特权车 12.2912397395
+分子力 12.8020653633
+参军 8.44109213783
+珍奇 9.96885201925
+香味扑鼻 12.8020653633
+信息流 11.3357282945
+林姑娘 9.48183704418
+一十九岁 13.2075304714
+普里什蒂纳 13.2075304714
+春卷 11.1280889297
+包青天 11.7034530746
+寄放 12.1089181827
+魏先生 13.2075304714
+望月楼 12.1089181827
+杰弗森 13.900677652
+相顾 9.91169360541
+公正无私 11.9547675029
+录取名额 13.900677652
+解锁 11.3357282945
+宝旺旺 12.8020653633
+珠蛋白 12.2912397395
+暴增 9.63799777493
+戏是 11.9547675029
+第六类 13.900677652
+邓文俊 13.2075304714
+扫清 9.18217878068
+都为燕 13.2075304714
+觥觥 13.900677652
+抑扬顿挫 10.2371160058
+珍妮 11.4157710022
+巴青 13.2075304714
+美梦 10.0940151622
+凤虚凰 12.8020653633
+黄瓜 9.00283785202
+无资格 13.900677652
+铁钉子 12.8020653633
+烧埋 12.1089181827
+凡此等等 13.2075304714
+射击场 11.598092559
+专科专业 13.2075304714
+班委会 13.900677652
+校友会 13.900677652
+吃海鲜 11.5027823792
+接壤处 11.9547675029
+松鹤图 12.8020653633
+黄瓦 11.3357282945
+杳然 11.7034530746
+和孝文 12.1089181827
+解疑释结 13.900677652
+地理坐标 11.7034530746
+砸锅卖铁 11.3357282945
+萨萨克 12.8020653633
+哑炮 13.2075304714
+装假 12.2912397395
+比你早 12.5143832909
+开关电流 13.900677652
+蚕食鲸吞 13.2075304714
+工业锅炉 11.8212361103
+金川县 13.900677652
+中国文化书院 13.2075304714
+欠身 8.5488195185
+猜测法 13.900677652
+惹来 11.1926274509
+试办 11.2616203224
+神炮手 13.900677652
+金丹之 12.1089181827
+膝行 10.642581114
+搭机去 13.900677652
+曾家庄 11.598092559
+蛛丝马迹 9.45802639549
+黑泽明 11.8212361103
+神狄奥 12.8020653633
+漏馅 13.900677652
+齐天大圣 9.43476953332
+南京航空航天大学 13.900677652
+阳谷县 10.8561552143
+晚祷 12.2912397395
+收进去 12.8020653633
+北京首都机场 11.9547675029
+尸身 9.26594866375
+黄筌 11.3357282945
+可进可退 11.598092559
+文件属性 12.2912397395
+美术 7.59257921047
+装做 9.44633035572
+预售票 13.900677652
+阶地 8.76487921493
+克鲁伊夫 12.8020653633
+半乳糖 10.8561552143
+萨马 12.8020653633
+左翊卫 12.8020653633
+真服了 12.5143832909
+大伯子 12.8020653633
+希腊半岛 11.7034530746
+邮储 10.0940151622
+不单单是 11.1280889297
+勾股定理 10.9049453784
+藏王 10.7226238216
+藏玉 11.8212361103
+心脏病学 13.2075304714
+集电环 13.2075304714
+阎若璩 11.5027823792
+电报局 11.3357282945
+肿瘤学 12.1089181827
+销金窟 12.5143832909
+粮油 8.98069672615
+美军 7.34389929582
+师兄 8.43261751084
+淤沙 12.5143832909
+参建 11.5027823792
+信息战 11.598092559
+巴颜 12.1089181827
+产值 8.01735526349
+眼图 11.8212361103
+淤泥 8.97342396682
+环江毛南族自治县 11.7034530746
+指挥刀 12.1089181827
+怯薛 10.4666904475
+撂荒 11.9547675029
+满腔热情 11.598092559
+唐将军 11.8212361103
+舒新城 11.9547675029
+处乱不惊 12.8020653633
+诸苗决 13.2075304714
+士咸 13.2075304714
+达玛拉 9.71102290995
+壳顶 11.4157710022
+秦山核电站 11.0103058941
+人脑 9.41204128224
+计直隶 13.2075304714
+六步 12.1089181827
+南瓜饼 13.900677652
+动之以情 11.1280889297
+支流 6.98495420334
+含苞欲放 11.5027823792
+呶呶 13.900677652
+充好 12.2912397395
+捧心西子 13.900677652
+商陆 12.1089181827
+漏雨 11.2616203224
+尘埃落定 9.22784881751
+坎代 12.8020653633
+落泊 13.900677652
+侧边 10.3743171274
+试播 12.5143832909
+中立政策 11.0103058941
+豺狼虎豹 12.8020653633
+临阵脱逃 10.4994802703
+尼雷尔 12.1089181827
+几百辆 12.8020653633
+花正芳 8.83177344976
+巴顿 10.0505300503
+卷扬机 11.8212361103
+但庆金 13.2075304714
+测验 9.17328983326
+美术课 13.900677652
+学理 11.5027823792
+辩词 13.900677652
+一百零二岁 13.900677652
+半文 11.598092559
+美林 9.32596667347
+敢来 10.1871055853
+祸福无常 12.5143832909
+编发 11.7034530746
+母体 8.73019365694
+红口白牙 11.7034530746
+千上万 11.7034530746
+舌叶 13.900677652
+在表面上 10.2630914922
+康惠太 13.2075304714
+停放在 10.2630914922
+毫州 11.0674643079
+通讯业 13.2075304714
+慕荣 12.8020653633
+哈济亲王 13.900677652
+施治者 13.2075304714
+请得 10.9049453784
+侧近 12.1089181827
+敌对势力 11.1926274509
+古尔勃 13.900677652
+应适当 10.2371160058
+随处 10.2117981979
+伯纳尔 13.2075304714
+按下不表 13.2075304714
+换马甲 13.900677652
+元明两代 12.2912397395
+爱弥尔 12.8020653633
+赵城镇 13.2075304714
+俱乐部队 12.5143832909
+涧口 12.8020653633
+测高 11.8212361103
+藏獒 11.2616203224
+沈姑娘 12.5143832909
+承安宝 13.2075304714
+玉玲珑 12.8020653633
+几何平均 13.900677652
+景文 13.2075304714
+粉黛 11.7034530746
+网络科技 11.3357282945
+富兴 13.900677652
+对角线 10.4666904475
+煞有介事 9.98865464655
+饥困 12.2912397395
+随声 12.2912397395
+无睹 11.8212361103
+并发 9.32596667347
+想得开 11.1280889297
+及时 5.9675978801
+拨得 12.8020653633
+鲁提菲 12.1089181827
+文成县 13.2075304714
+及早 8.4801426527
+竹板 11.0674643079
+将遇良才 12.5143832909
+到发场 13.900677652
+雀窝 13.900677652
+见诸于 12.1089181827
+千朵 12.8020653633
+拳坛 12.8020653633
+格利维 13.900677652
+适可而止 10.2371160058
+手摇泵 13.900677652
+世界市场 9.09665660724
+美景 9.25628675283
+勾住 10.4666904475
+占筮 12.2912397395
+无着 10.1871055853
+和孝武 11.9547675029
+无德律 13.900677652
+拨快 13.2075304714
+平衡点 9.74179456862
+猪头肉 10.765183436
+富儿 13.2075304714
+守候多时 12.8020653633
+山楂糕 12.1089181827
+楚军战 13.900677652
+甄士隐 11.3357282945
+耶宇之 13.2075304714
+智龄 13.2075304714
+千条 10.5684731418
+舌前 13.2075304714
+巧做 13.900677652
+黄稠 12.2912397395
+寄款 13.900677652
+眉骨 11.1280889297
+谐振器 12.5143832909
+征收 6.90216800973
+彭泽民 12.8020653633
+刘尧 12.1089181827
+重义轻利 13.2075304714
+鱼口 12.5143832909
+动手做 12.2912397395
+验货 12.8020653633
+文津街 13.900677652
+富凯 12.5143832909
+学画 9.45802639549
+鞍部 11.9547675029
+千枚 12.5143832909
+智齿 11.8212361103
+瑞典克朗 10.6818018271
+坏人 8.46695564842
+千枝 12.8020653633
+挡风遮雨 13.2075304714
+学用 12.8020653633
+侧身 9.01787572939
+霍斯陆 13.2075304714
+购销 9.62401153296
+指挥台 10.765183436
+坏事 8.32094782599
+跺跺脚 11.598092559
+黄童 13.2075304714
+波导管 12.1089181827
+学生 5.76328182192
+第六版 13.2075304714
+平儿斟 13.2075304714
+辟邪 10.4349417492
+黄竹 12.2912397395
+春意盎然 11.5027823792
+拨开 8.96620371885
+千架 11.8212361103
+眼圈 8.74162235276
+嘱咐 7.39339993959
+征文 11.598092559
+萨姆松 13.2075304714
+花知寨 11.1926274509
+国际贸易中心 11.4157710022
+护理产品 13.2075304714
+辛诃 13.2075304714
+真空室 12.2912397395
+昌国君 12.2912397395
+美国最高法院 11.598092559
+景教 10.3171587135
+相思病 11.7034530746
+唐乾符 13.2075304714
+品系 10.5684731418
+辛词 12.5143832909
+文件精神 10.9562386728
+舔食 11.9547675029
+验资 10.0505300503
+指挥舰 11.5027823792
+辛诵 12.2912397395
+后殿中 11.9547675029
+田连阡陌 12.5143832909
+拳打脚踢 10.1394775363
+淤浅 10.0294766411
+死灰复燃 10.4349417492
+富冈 12.8020653633
+武宗元 13.2075304714
+关进去 13.2075304714
+儿女情长 11.5027823792
+坚决贯彻 10.8096351986
+三年制 13.2075304714
+阴森可怖 11.5027823792
+富农 9.31571017331
+缴入 12.8020653633
+学界 9.23723855786
+诱之以利 12.5143832909
+劳工阶级 12.8020653633
+投资额 8.67493097826
+信息性 12.8020653633
+反渗透膜 13.900677652
+不稳定地 13.900677652
+欧冶子 11.5027823792
+芳村 12.2912397395
+第八十八 12.5143832909
+八记 12.8020653633
+公德心 13.900677652
+刮舌 13.2075304714
+宝剑 8.03420959504
+试映 13.2075304714
+磨折 12.1089181827
+扫掠 13.900677652
+棘皮 13.2075304714
+八十步 13.2075304714
+王灵官 11.9547675029
+上刀山 10.9562386728
+邮务 11.7034530746
+哑然 11.4157710022
+沉迷在 13.2075304714
+七分钟 13.900677652
+黄祸 12.5143832909
+就聘 13.900677652
+航天史 11.9547675029
+脸上无光 11.1926274509
+血气 10.0940151622
+总人口 8.18364995057
+国格 13.2075304714
+税目 11.3357282945
+窃窃 11.1926274509
+半点儿 10.4349417492
+假性幻觉 13.900677652
+克东县 13.2075304714
+扫描 8.50705010562
+涉世 12.8020653633
+卡日曲 11.598092559
+珍味 13.900677652
+学监 12.1089181827
+八十次 12.8020653633
+信用合作 13.900677652
+科南 13.2075304714
+利萨 13.2075304714
+天仙配 11.7034530746
+供给制 11.9547675029
+恰似 9.40086798165
+淤滞 12.1089181827
+知过能改 13.900677652
+随宜 12.5143832909
+苦杏仁 11.7034530746
+卓遂 12.8020653633
+吹鼓 12.8020653633
+茅于轼 12.8020653633
+揪起来 12.8020653633
+潜逃 9.71102290995
+景明 11.598092559
+黄种 12.5143832909
+问来问去 12.1089181827
+拉多姆 13.2075304714
+西耶那 13.900677652
+景星 11.2616203224
+心灵学 11.8212361103
+一场虚惊 11.1926274509
+弄笔 13.900677652
+苍哑 11.8212361103
+工业贸易 11.9547675029
+支书 8.92394390956
+磨成 9.94943393339
+桃园市 13.2075304714
+浪鼓 13.900677652
+威廉港 11.8212361103
+富勒 11.0103058941
+盖天说 10.9049453784
+广饶 11.598092559
+种桑 11.598092559
+归根究底 13.900677652
+汉墓群 11.3357282945
+孙抚台 11.9547675029
+黄福 12.8020653633
+痫证 12.1089181827
+二硫化碳 11.0674643079
+那尼庵 13.900677652
+分子式 8.36334338496
+美日 10.2117981979
+百多米 13.900677652
+红孩儿 11.4157710022
+涉事 12.5143832909
+原质团 13.900677652
+业协会 11.8212361103
+鸾俦 13.900677652
+格拉赫 12.5143832909
+汝焉敢 12.5143832909
+珍品 8.49350588052
+言而威 12.5143832909
+敦聘 13.900677652
+发配 10.0940151622
+变速器 8.78868986362
+西南角 9.44633035572
+辽东军区 12.8020653633
+十六扇 13.2075304714
+波库斯 13.900677652
+办不到 9.5186510173
+鸭公 13.2075304714
+卢克曼 13.900677652
+天地生 11.9547675029
+干将莫邪 12.2912397395
+敢撤 13.2075304714
+哈根达斯 12.2912397395
+李精白 12.8020653633
+暴君 9.74179456862
+电抛光 13.2075304714
+风烟 12.5143832909
+扫把 10.604840786
+利空消息 9.75754292558
+短袖 10.4666904475
+硬实 11.8212361103
+只求自保 13.2075304714
+外汇存底 13.2075304714
+弥渡县 13.900677652
+甘倍尔 13.2075304714
+得逞 9.24671730182
+经产妇 12.5143832909
+临潼县 10.8096351986
+莽莽撞撞 11.9547675029
+腐烂 8.43684584695
+佛教协会 12.5143832909
+千支 11.3357282945
+殖吸虫 11.9547675029
+公式 7.51379833261
+呼衍族 13.900677652
+富华 10.9562386728
+参差 9.59661255877
+扶风 9.61021821083
+磨掉 11.3357282945
+怫然作色 13.2075304714
+胸衣 12.2912397395
+鄙贱 11.8212361103
+傅惜华 12.8020653633
+来永平 13.2075304714
+订货 9.12155415886
+眉额 13.2075304714
+年票 12.1089181827
+精神枷锁 11.8212361103
+订购 8.71329184614
+征服 6.99693039439
+马哈蒂尔 12.8020653633
+伯纳德 11.598092559
+稗官小说 13.900677652
+得道 10.2897597393
+涉企 13.900677652
+已待 13.2075304714
+谷道 11.7034530746
+征期 13.900677652
+叶枯病 11.9547675029
+因噎废食 10.9049453784
+王传旨 11.9547675029
+小石桥 11.1280889297
+马家寨 11.5027823792
+赌王 12.8020653633
+中国万网 10.9049453784
+明秀轩 13.900677652
+惹得 9.48183704418
+查韦斯 12.8020653633
+千数 11.7034530746
+满出 13.900677652
+蒙冲斗 12.2912397395
+热情 6.57027244013
+退换货 11.4157710022
+王世才 10.2371160058
+分茅裂土 13.900677652
+十句 11.2616203224
+检测器 10.5684731418
+考过 11.3357282945
+邮包 11.3357282945
+堆好 13.2075304714
+唾沫星子 10.9049453784
+晚生 9.29550746599
+句读 11.3357282945
+日喀则 10.2371160058
+跻身 8.84443184663
+临潼区 13.2075304714
+重围 9.35738286971
+载脂蛋白 12.1089181827
+十万贯 11.0674643079
+东源县 13.900677652
+招灾 12.1089181827
+千斤 9.29550746599
+支使 10.0720362555
+邮区 12.8020653633
+法国政府 9.37888907493
+行不行 8.9519177616
+万一把 12.5143832909
+黄磷 10.6818018271
+扫房 12.8020653633
+慈石能 13.900677652
+及期 13.2075304714
+堆积层 11.598092559
+青娱乐 13.900677652
+调解机制 12.1089181827
+索巴特 13.900677652
+复杂程度 10.1394775363
+涉笔 13.900677652
+黄碟 12.8020653633
+支会 12.2912397395
+富县 11.7034530746
+窃笑 11.2616203224
+吞口水 12.8020653633
+追根问底 13.900677652
+趁兴 13.900677652
+价格表 12.8020653633
+延安抗大 13.2075304714
+神赫菲 12.5143832909
+吉纳默 13.2075304714
+美廉美 13.2075304714
+中国中央电视台 11.8212361103
+缴卷 13.2075304714
+自用车 13.900677652
+顺达 11.9547675029
+千日 12.5143832909
+申绍芳 12.8020653633
+学着 9.12155415886
+朱两军 13.2075304714
+卓里 12.5143832909
+高棉 10.3743171274
+窝轮 11.8212361103
+富厚 12.2912397395
+武宗卒 12.2912397395
+输送量 12.1089181827
+敢接 11.7034530746
+花瑶草 13.900677652
+小石子 10.533381822
+王爱卿 13.900677652
+湖滨南路 13.900677652
+店小二 9.7898037878
+一千零二十 13.900677652
+光滑 7.95787827685
+黄罗 11.7034530746
+曲水县 13.2075304714
+无相 11.7034530746
+水门汀 12.8020653633
+将遇良材 13.900677652
+行若无事 12.8020653633
+眼力 9.48183704418
+白尾海 12.1089181827
+随州 10.0720362555
+丹佛 11.8212361103
+聊天工具 12.8020653633
+维引兵 12.8020653633
+幼鹿 11.9547675029
+莱哈尔 13.2075304714
+千户 9.45802639549
+千手 11.2616203224
+粮棉 9.93038573842
+逻辑运算 11.9547675029
+丹伯 13.2075304714
+检阅 8.90346537821
+陈序经 12.8020653633
+七里河区 13.2075304714
+千所 12.8020653633
+暴卒 11.8212361103
+富含 7.94225295895
+格拉诺 11.8212361103
+葵青 13.900677652
+笨猪 12.8020653633
+西子湖 11.5027823792
+脑梗死 12.8020653633
+操领兵 13.2075304714
+黄缘 12.8020653633
+地贫 13.900677652
+海洛夫斯 13.900677652
+铅桶 13.900677652
+磨擦 10.4666904475
+加班费 10.8096351986
+巴鲁 10.6818018271
+六百名 12.5143832909
+北京钓鱼台国宾馆 13.2075304714
+恣意 9.7898037878
+黄缨 12.8020653633
+向绣桔 13.900677652
+向皇爷 13.2075304714
+历尽沧桑 11.598092559
+条顿人 11.9547675029
+威廉森 13.2075304714
+司郎官 12.5143832909
+辉映 10.2117981979
+西子湾 13.900677652
+追求理想 12.2912397395
+粮栈 12.5143832909
+千把 10.4994802703
+历险记 10.765183436
+眼到 12.5143832909
+联系业务 13.900677652
+槭树 10.4349417492
+教学大纲 11.1926274509
+暴厉 12.8020653633
+彭总眯 13.900677652
+黄翔 13.2075304714
+众人国士 13.900677652
+那狗日 12.1089181827
+占线 11.1280889297
+萨默 13.2075304714
+构模 11.5027823792
+相匹敌 11.0674643079
+袁时中 7.63727938938
+飘忽不定 11.0103058941
+磨搓 13.900677652
+塞贝克 13.2075304714
+桂儿娘 13.2075304714
+发出声响 10.9049453784
+黄翼 12.8020653633
+克尔曼沙 12.5143832909
+直立起来 11.2616203224
+亮化 11.4157710022
+张师傅 11.4157710022
+吴曾通 12.8020653633
+蹙眉 10.4041700905
+摭采 13.2075304714
+白澳政策 12.8020653633
+欠薪 10.3743171274
+杯水车薪 10.1630080337
+义务兵役制 10.4994802703
+试想 9.54396882529
+暴发 9.19114745066
+真空度 11.8212361103
+武宗命 13.2075304714
+理想家 13.900677652
+酥酥的 12.8020653633
+厉王太子 13.2075304714
+美援 10.642581114
+中国象棋 12.1089181827
+卡尔德拉 13.900677652
+合法利益 11.0674643079
+安加罗 13.900677652
+验血 11.8212361103
+舒马瓦 13.900677652
+优点 7.43608934829
+吉里寨 13.2075304714
+招眼 12.8020653633
+安营扎寨 10.6818018271
+扫数 12.5143832909
+乔先生 13.2075304714
+一等舱 13.900677652
+眼前 6.12288502564
+会道门 11.9547675029
+沪东 11.4157710022
+眉黛 12.5143832909
+贝拉港 13.900677652
+老当益壮 11.8212361103
+高起点 10.4994802703
+苗种 11.7034530746
+秦家庄 12.1089181827
+书报刊 12.8020653633
+十台 13.900677652
+文华路 13.2075304714
+一百余员 13.2075304714
+磨断 12.5143832909
+国防法 11.8212361103
+霍童溪 12.1089181827
+树叶子 10.6818018271
+星火计划 12.1089181827
+富商 9.31571017331
+多重人格 13.900677652
+见微知着 12.8020653633
+自适 12.1089181827
+窃位 13.900677652
+湘妹子 11.8212361103
+会计簿 13.2075304714
+可敬可佩 13.2075304714
+大湖塘 13.2075304714
+新策略 11.5027823792
+平谷县 11.9547675029
+敢抓 11.9547675029
+受孕率 12.8020653633
+眼压 10.9049453784
+个人电脑 10.9562386728
+日灼病 13.900677652
+铜雕 11.5027823792
+说经 11.9547675029
+玻利维亚共和国 12.8020653633
+丹丹 11.0674643079
+丹丸 10.9562386728
+陡河 11.0103058941
+更深一层 10.765183436
+家用电脑 12.5143832909
+拾荒者 13.900677652
+用熟 13.900677652
+尉即军 13.2075304714
+晚班 11.1280889297
+丹下 12.8020653633
+单飞 11.5027823792
+毫无目标 13.2075304714
+美才 12.8020653633
+梅树姿 13.2075304714
+精缩 13.900677652
+多一分钟 13.900677652
+要约 9.28555713513
+化工局 13.2075304714
+丹丘 11.9547675029
+人命关天 10.9562386728
+生殖系统 9.62401153296
+有起色 10.1871055853
+陈向平 13.2075304714
+敢拜 13.900677652
+平面媒体 11.2616203224
+黄经 11.598092559
+封官赐 13.2075304714
+黄绍 10.9049453784
+暴力 8.05423887692
+层峦叠嶂 11.7034530746
+摇头吧 13.900677652
+辛辛 12.8020653633
+连杆机构 11.1280889297
+暂定为 10.3743171274
+中国科技大学 10.604840786
+扮做 10.1394775363
+电子能级 12.8020653633
+孙白谷 12.5143832909
+船老大 9.36807815882
+比亚斯 13.900677652
+百般折磨 13.2075304714
+锋芒 9.45802639549
+机用户 13.900677652
+吹风 10.0720362555
+陈懋恒 13.2075304714
+蒲苇 11.5027823792
+黄绢 12.1089181827
+恣情 13.900677652
+辛辣 8.89673134603
+黄绿 10.0505300503
+载文 10.4666904475
+发烧友 11.598092559
+黑林山 12.5143832909
+谐振动 12.8020653633
+杨业归 13.2075304714
+黄维 10.8096351986
+端口号 12.8020653633
+投币口 13.900677652
+毛骨耸然 12.1089181827
+单项 9.58318953844
+鞍钢 8.96620371885
+乳头肌 12.2912397395
+会计核算 11.2616203224
+往来账 13.2075304714
+癣疥之疾 11.9547675029
+吴丙丁 11.7034530746
+邮商 13.900677652
+寻寻觅觅 11.7034530746
+一对对 10.8561552143
+拳参 13.2075304714
+景慕 12.5143832909
+检测值 12.2912397395
+织带机 12.8020653633
+黄纬 13.900677652
+铜陵 10.0294766411
+稼穑 11.0674643079
+拨子 10.4349417492
+黄红 13.900677652
+徐鹏 13.900677652
+一展身手 13.900677652
+黄线 10.9049453784
+鼍鼓 11.4157710022
+辛迪 13.2075304714
+陨铁 11.2616203224
+丹井 10.5684731418
+黄纱 12.8020653633
+法金汉 12.1089181827
+加班车 13.900677652
+龙方 13.2075304714
+咬牙恨齿 13.2075304714
+产品策划 13.900677652
+试戴 12.8020653633
+指挥员 8.75318317516
+整体橱柜 12.8020653633
+人老 9.91169360541
+巴黎 6.53170724978
+干巴巴 10.7226238216
+四十七八岁 13.2075304714
+林神 12.5143832909
+钱伟长 11.4157710022
+禀覆 11.8212361103
+勾股义 13.2075304714
+红颜色 11.4157710022
+胆大心粗 13.2075304714
+拜坟 13.900677652
+奥布尔 13.900677652
+脊椎动物 8.03989142851
+美意 10.6818018271
+鲁思东 13.2075304714
+随心 10.8096351986
+年届花甲 13.2075304714
+人粪尿 11.8212361103
+极光 9.82314020807
+修道人 13.900677652
+宁边州 12.8020653633
+晚点 10.2371160058
+但书 10.9562386728
+美感 9.5062284973
+戴紫金 12.5143832909
+拧动 13.900677652
+载明 10.9562386728
+搭茬儿 11.9547675029
+应征入伍 10.3453295905
+缴回 12.8020653633
+零四天 13.2075304714
+武宗因 13.2075304714
+达声 12.8020653633
+但丁 9.89334446674
+野蔷薇 12.1089181827
+旅顺口区 13.2075304714
+读存储器 12.1089181827
+暴光 12.8020653633
+帅王宗 12.8020653633
+征战 8.77077893705
+尔博士 12.2912397395
+低热值 13.2075304714
+面向对象分析 13.900677652
+防寒保暖 11.7034530746
+纺织业 9.04864738806
+云蒸霞蔚 13.2075304714
+周世六 13.2075304714
+娓娓道来 11.1926274509
+琵琶 8.27666014579
+探出去 12.8020653633
+小石头 9.49395840471
+黄素 10.8561552143
+柳太太 11.0674643079
+黄茅尖 12.5143832909
+瞄到 13.900677652
+试手 13.2075304714
+第五十章 11.2616203224
+穿衣服 9.41204128224
+气候异常 11.5027823792
+铜门 10.9562386728
+诽谤者 12.8020653633
+公路局 12.5143832909
+帆布包 13.2075304714
+丝裂霉素 12.5143832909
+十句话 11.8212361103
+鲁至魏 13.2075304714
+卡特琳 13.2075304714
+一百三十七万两 13.2075304714
+武进士 12.5143832909
+藏画 11.8212361103
+汉左校 13.2075304714
+铜锁 10.7226238216
+富国 7.86519621945
+贝特南 13.900677652
+棘爪 12.5143832909
+瓜子儿 12.2912397395
+洒向 11.1280889297
+大萝卜 11.9547675029
+汉光武帝 9.71102290995
+獭皮 11.8212361103
+孙树侠 13.900677652
+鬼才 10.9562386728
+行动敏捷 10.9049453784
+科技网 13.900677652
+铜锣 10.2371160058
+查巡 13.2075304714
+寿陵君 13.2075304714
+饶毓泰 12.8020653633
+万物 7.75434839431
+扩散式 12.5143832909
+原指 9.98865464655
+魏宪辑 13.2075304714
+个体化 11.8212361103
+铜镜 8.71329184614
+格拉西 13.900677652
+招生 8.63281949291
+叹口气 7.90921310487
+夏主 11.3357282945
+西南路 12.5143832909
+乱花钱 11.9547675029
+直言切谏 13.2075304714
+齐王 9.80633308975
+吹奏乐器 11.7034530746
+经济社会 7.61281909181
+六七千年 11.598092559
+但亏 13.900677652
+透析法 13.900677652
+经济法制 13.2075304714
+招男 11.4157710022
+会泽县 12.2912397395
+扫来 11.9547675029
+两不相干 12.8020653633
+涂脂抹粉 11.3357282945
+郭祥存 13.2075304714
+侧视 11.0103058941
+得闲 11.2616203224
+招用 11.5027823792
+睡下去 11.2616203224
+乌耳姆 13.2075304714
+两天晒网 11.8212361103
+黄籍 11.8212361103
+阿尔巴尼亚人 10.6818018271
+铜钟 10.604840786
+连环套 11.7034530746
+验讫 13.2075304714
+彪炳 11.9547675029
+晚熟 10.642581114
+王琼 12.1089181827
+万丈高楼 12.8020653633
+无人知晓 10.4994802703
+主营业务 7.58894284282
+信息冗余 13.900677652
+张应元 11.1926274509
+北京大学出版社 13.2075304714
+铜钉 11.5027823792
+保质期 10.604840786
+铜钵 13.2075304714
+君主立宪派 11.7034530746
+铜钱 8.97342396682
+舌后 12.8020653633
+捷克斯洛伐克 8.71329184614
+单骑 9.96885201925
+腹背受敌 9.84023464143
+铜钹 13.2075304714
+路昭回 13.2075304714
+眼内 10.3743171274
+英雄气概 10.0088573539
+继母 9.66657114738
+伊庇罗 13.900677652
+载有 8.93783302172
+黄米 11.2616203224
+模板合成 13.2075304714
+秦震朝 13.2075304714
+张月鹿 12.8020653633
+短日照植物 11.9547675029
+阿玛赐 12.5143832909
+尸解 11.2616203224
+但会 9.85762638414
+王兆国 13.2075304714
+沃尔沃公司 13.2075304714
+适有 12.8020653633
+载来 12.8020653633
+书法报 13.900677652
+铜铃 9.69598503258
+悲观主义 11.4157710022
+第十七 10.8561552143
+贡奉无 12.8020653633
+美恶 11.8212361103
+和威廉 11.7034530746
+敢情 9.75754292558
+叉路 12.8020653633
+红磨坊 12.1089181827
+验证 7.84389363875
+割恩断义 13.900677652
+铜铸 10.2897597393
+王和众 13.900677652
+发烟硝酸 12.5143832909
+昌隆丝 12.5143832909
+项周延 13.900677652
+肤廓 13.900677652
+拉特兰 11.5027823792
+磨机 12.2912397395
+卢塞恩 13.900677652
+师援襄 12.8020653633
+晶胞参数 12.8020653633
+透析液 12.8020653633
+眼儿 9.63799777493
+考证 8.0985592766
+参奏 11.598092559
+白塔区 13.2075304714
+考评 10.4666904475
+华伦海 12.8020653633
+碗碟 10.3743171274
+大闸蟹 11.3357282945
+宋鸿钊 13.2075304714
+妇女部 13.900677652
+黄糖 13.900677652
+时装设计 12.8020653633
+武宗权 13.2075304714
+考试 7.43453292774
+试探 8.11685246965
+洗起 12.5143832909
+网状组织 13.2075304714
+考语 12.2912397395
+迷走神经 10.4994802703
+两岸三地 12.2912397395
+揉木为耒 13.900677652
+扯篷 13.900677652
+堂会 10.533381822
+粮款 12.1089181827
+慕萄 12.5143832909
+笔杆子 11.1926274509
+惊堂木 11.5027823792
+向往已久 12.5143832909
+以产定销 13.900677652
+硫化剂 13.2075304714
+家常事 10.9049453784
+拨好 13.900677652
+美惠 13.2075304714
+赶工期 13.2075304714
+摸来摸去 11.8212361103
+鄙视 9.31571017331
+千里镜 12.1089181827
+随常 12.8020653633
+黄粒 13.900677652
+拳击 10.3743171274
+经济区 9.00283785202
+有事吗 10.3743171274
+今昔对比 13.2075304714
+刨花板 10.642581114
+考订 9.40086798165
+晚照 13.2075304714
+参天 9.93038573842
+黄精 10.642581114
+由辉格 13.2075304714
+秦震望 12.1089181827
+浮上去 12.8020653633
+石城县 12.2912397395
+华伦洛 13.2075304714
+降血压 10.6818018271
+眼光 7.12303105834
+春夏季 11.0674643079
+分子病 12.1089181827
+斑驳 10.0294766411
+堂伯 12.2912397395
+肩周 13.900677652
+西北军政委员会 11.4157710022
+格劳宾 13.900677652
+帝舜 11.1280889297
+滞缓 11.4157710022
+库容量 11.1280889297
+磨墨 11.0103058941
+沪西 11.9547675029
+具保 11.9547675029
+入围者 12.1089181827
+一心同体 13.900677652
+颜雍 11.9547675029
+紧身 10.1630080337
+斑马 10.533381822
+医疗纠纷 9.74179456862
+石头河 12.8020653633
+美式 9.7898037878
+八十八 11.5027823792
+七八里 10.642581114
+不胜其任 13.900677652
+云浮县 13.2075304714
+君主立宪制 9.59661255877
+转义字符 12.5143832909
+缴械 11.5027823792
+清除出党 12.5143832909
+个里 12.8020653633
+杜遵道 12.1089181827
+国际奥委会执委会 12.8020653633
+眼线 11.1280889297
+悠闲自在 11.9547675029
+试射 9.98865464655
+大梦初醒 11.9547675029
+蟠龙 10.8096351986
+景岳 13.900677652
+前提条件 9.58318953844
+小王子 11.1926274509
+骨肉之情 12.1089181827
+呼吸相通 13.2075304714
+过远 11.2616203224
+电子染色 13.2075304714
+千幅 12.8020653633
+过过 11.4157710022
+人迹 10.0940151622
+二十多位 13.2075304714
+国防军 9.75754292558
+征尘 10.8096351986
+新仙林 13.900677652
+投资体制 11.7034530746
+徐偃王 11.9547675029
+姬鹏飞 12.8020653633
+王喜回 12.8020653633
+临时准备 13.900677652
+吴激 12.5143832909
+仅靠 9.37888907493
+灰叶猴 12.5143832909
+楚拔郢 13.2075304714
+下愚 13.900677652
+细面条 12.5143832909
+茶道 9.30555780184
+作罢 9.20019728618
+滩羊皮 11.7034530746
+怎样才能 9.05649056552
+寄到 10.765183436
+千年 7.8604229407
+高龙巴 13.2075304714
+千丝 12.8020653633
+晚上 5.96223210081
+基本词 13.900677652
+丹珠 11.9547675029
+一百八十里 11.5027823792
+觉醒 8.53003962385
+三街六市 13.900677652
+潜龙 11.8212361103
+藏家 10.9049453784
+作美 13.900677652
+季克西 13.2075304714
+重量计 12.8020653633
+美德 9.23723855786
+代议制 10.0940151622
+嫁接法 12.8020653633
+子淮 12.8020653633
+沁园春 11.598092559
+千度 13.2075304714
+有湘桂 12.2912397395
+协会主席 9.62401153296
+类节目 11.7034530746
+洗舱 13.900677652
+滑粉 13.2075304714
+对外贸易 7.72273353793
+草茉莉 13.900677652
+于悼王 12.2912397395
+农林牧副渔 11.598092559
+美得 10.5684731418
+杨晶 11.0103058941
+强奸案 13.2075304714
+数据表 13.900677652
+白三叶 12.8020653633
+子素 13.2075304714
+郭汜领 12.5143832909
+蹲大牢 12.8020653633
+飞英塔 12.5143832909
+岁首 10.9049453784
+许州治 12.8020653633
+翁城 13.900677652
+随意 7.44233936863
+诱导反应 13.900677652
+心电感应 12.5143832909
+过载 10.4349417492
+向皇亲 11.7034530746
+亚里士 13.2075304714
+随感 12.1089181827
+维加 11.4157710022
+敢当 10.1630080337
+天地会 11.3357282945
+喇叭筒 10.3453295905
+贺国勇 13.2075304714
+景山 9.93038573842
+酒涡 12.8020653633
+人身 8.36728816325
+潜鸟 11.8212361103
+共产党员 8.35160156708
+重新组合 10.5684731418
+扫墓 10.2630914922
+李柏拴 11.7034530746
+金大中 11.5027823792
+继嗣 11.598092559
+指环 10.604840786
+艾连特 13.900677652
+朱贵全 13.2075304714
+寄卖 12.8020653633
+铁路干线 9.05649056552
+随想 11.9547675029
+残疾证 13.900677652
+罗一听 13.900677652
+广东省 7.50374799676
+港口机械 11.2616203224
+千张 11.3357282945
+藏宝 11.5027823792
+单身在外 13.900677652
+胡海波 11.3357282945
+砌砖 12.1089181827
+二十多个 9.89334446674
+牙山 11.2616203224
+法律条文 10.604840786
+美帝 10.9562386728
+检测法 12.1089181827
+签过 11.598092559
+除臭剂 13.900677652
+信息学 11.0674643079
+一万五千 10.3743171274
+澜沧江 8.81927328699
+鸽笼 11.2616203224
+紧追 10.642581114
+卢作孚 12.5143832909
+百分之一百 13.2075304714
+控制程序 11.8212361103
+李信听 11.8212361103
+晚自习 10.2630914922
+景州 11.9547675029
+惹出 9.5186510173
+陈立 11.7034530746
+伯纳斯 13.2075304714
+普瓦提 11.598092559
+五台县 11.2616203224
+洗菜 11.0674643079
+紧迫 8.17382990439
+仅限 10.1394775363
+易潮解 11.8212361103
+子粒 9.27570483869
+过程线 12.2912397395
+石烈执 12.5143832909
+英国管 12.1089181827
+瓜田李下 13.900677652
+耐用性 12.1089181827
+张家口 9.0884932966
+三滤 11.4157710022
+戏文 10.0088573539
+茶酒 11.7034530746
+赢回 13.900677652
+召集人 9.85762638414
+工作细则 12.1089181827
+心有余而力不足 11.0103058941
+候元孟 13.2075304714
+稳中求进 12.1089181827
+参杂 12.1089181827
+子类 12.8020653633
+孙文转 13.900677652
+六千元 13.2075304714
+磨头 11.2616203224
+袒护 9.84023464143
+约束则 13.900677652
+生存期 11.5027823792
+阳群 13.900677652
+晚会 9.35738286971
+小红点 12.2912397395
+和野津 13.2075304714
+秦家或 13.2075304714
+汪一鸣 10.2117981979
+孵仔 13.900677652
+寄发 12.5143832909
+第二十三章 10.4041700905
+硫化氢 10.0720362555
+十一碗 13.900677652
+暴脾气 13.900677652
+七八遍 12.8020653633
+容犹胜 13.2075304714
+滞纳 13.900677652
+基督教徒 9.38981814546
+地板蜡 12.2912397395
+二十多亩 12.2912397395
+铁蒺藜 11.0674643079
+儿童活动 12.8020653633
+伸舌头 10.7226238216
+数一半 13.900677652
+暴溢 13.2075304714
+画圆 12.8020653633
+开足马力 10.9562386728
+衰迈 12.5143832909
+掩盖着 10.604840786
+勤政殿 10.9562386728
+法沃尔斯 13.2075304714
+尚和玉 12.1089181827
+粮商 10.765183436
+生存权 12.1089181827
+黄赌毒 13.900677652
+风洞试验 12.2912397395
+小鞋穿 12.1089181827
+敢干 11.7034530746
+散射体 13.900677652
+硫化汞 11.4157710022
+饥渴 9.75754292558
+国际红十字会 11.598092559
+熊熊燃烧 10.8096351986
+经济腾飞 11.7034530746
+马水河 12.8020653633
+后果堪忧 13.2075304714
+难逃法网 13.900677652
+那道锈 13.2075304714
+洗荡 11.5027823792
+支用 11.1926274509
+倒不如说 10.4994802703
+令人瞩目 9.7898037878
+扩散性 13.900677652
+可造之才 13.900677652
+普瓦捷 13.2075304714
+寄去 11.1280889297
+物以群分 12.8020653633
+图文 10.1630080337
+阿兰若 13.2075304714
+文神武 13.2075304714
+收购部 13.900677652
+鱼具 13.900677652
+针角 13.900677652
+学人 10.9049453784
+亿米 11.8212361103
+子翼 11.598092559
+地理界线 10.533381822
+景府 13.2075304714
+中国科学院自然科学史研究所 13.2075304714
+招安 8.92394390956
+李福忙 12.8020653633
+白玉龙 12.8020653633
+移樽就教 13.2075304714
+过足 10.9049453784
+洗肠 11.598092559
+同分异构 10.4994802703
+条鳎 13.900677652
+千尺 11.0103058941
+踱来 10.1630080337
+学了 9.72629038208
+陡变 11.8212361103
+领事团 13.2075304714
+一首七 12.8020653633
+没有规矩 11.7034530746
+洗胃 9.82314020807
+蜂产品 12.5143832909
+千层 10.765183436
+扶危济贫 12.8020653633
+导致用户 12.2912397395
+饮料瓶 11.8212361103
+合成塔 12.8020653633
+眼波 10.604840786
+自查自纠 11.598092559
+子群 11.9547675029
+罗鼐 11.598092559
+李锡尼 12.2912397395
+眼泪 6.48309724956
+国家栋梁 12.8020653633
+暴流 11.9547675029
+成语故事 13.900677652
+曼秀雷敦 12.8020653633
+学术思想 10.642581114
+各学科 10.4994802703
+遇害身亡 13.900677652
+杀人不见血 13.2075304714
+送钱 11.0103058941
+储油构造 11.2616203224
+夏东 12.5143832909
+二十万万马克 13.900677652
+砌筑 10.2117981979
+过路 9.26594866375
+千山 9.82314020807
+攘除 13.900677652
+一大半 9.62401153296
+指挥棒 11.7034530746
+人质 8.81308131674
+千岁 10.4666904475
+分指数 12.1089181827
+花纹板 13.900677652
+滑线 13.900677652
+千岛 11.598092559
+景帝 9.43476953332
+氢氧 11.4157710022
+芳心 11.1926274509
+囊中之物 11.5027823792
+条鱼 12.8020653633
+连升 10.0940151622
+子网 12.2912397395
+攘夷 11.3357282945
+子罗 12.8020653633
+子罕 12.2912397395
+钦敬 10.533381822
+学业 9.25628675283
+雀目 13.900677652
+丝竹管弦 13.2075304714
+过费 12.5143832909
+喜蛋 13.900677652
+过账 12.5143832909
+声象 12.5143832909
+洗耳 12.2912397395
+米启尔 13.2075304714
+暴涨 7.52565283215
+议会斗争 13.2075304714
+学上 11.1280889297
+部分 4.41051098351
+陆凯 13.900677652
+美差 11.1926274509
+挞伐 11.8212361103
+意趣 9.84023464143
+曼荼罗 12.5143832909
+美工 11.598092559
+拳法 10.8096351986
+学习 5.77711981691
+声调 8.44963919841
+寄生物 11.4157710022
+一大口 9.87532596124
+第三十五章 11.0674643079
+孔明驱 12.8020653633
+萨洛尼卡 11.3357282945
+扮演 7.66822963543
+罗龙 13.2075304714
+过起 11.598092559
+前后门 10.9049453784
+柯林斯 11.4157710022
+防御者 11.598092559
+实验性 10.6818018271
+阴司里 11.2616203224
+扳起 12.1089181827
+亿粒 13.900677652
+鹤壁 10.0088573539
+帝胤 13.900677652
+匿名 9.5186510173
+龙文鼎 13.900677652
+磨洗 13.2075304714
+四川话 13.2075304714
+千峰 11.4157710022
+宗曾命 13.900677652
+范增 10.7226238216
+新闻部长 12.8020653633
+沃林岛 13.900677652
+交易方式 9.23723855786
+黄三耀 10.7226238216
+黄双 12.8020653633
+袁鹏 13.900677652
+暴民 11.8212361103
+状态方程 10.3743171274
+有性生殖 9.26594866375
+子继 11.7034530746
+陈家姐姐 12.5143832909
+鹩哥 13.2075304714
+执鞭 11.4157710022
+舌根 10.4349417492
+收购量 10.3453295905
+酥脆可口 13.900677652
+有损 9.5062284973
+漂流到 11.7034530746
+铁镍 11.0103058941
+襄汾县 12.2912397395
+动画影片 13.2075304714
+坏球 13.900677652
+芳年 13.900677652
+恶意透支 12.2912397395
+寄养 10.8096351986
+马连登 13.2075304714
+欺君 10.533381822
+景德 9.7898037878
+美尔 12.2912397395
+提线木偶 12.2912397395
+子纲 12.5143832909
+子纳 12.8020653633
+主体性 12.2912397395
+向阳处 11.8212361103
+打滚撒泼 13.900677652
+浊世 12.2912397395
+所在单位 10.1164880181
+毛发悚然 13.900677652
+内错角 13.900677652
+征引 10.5684731418
+非西方 10.9049453784
+电报机 11.598092559
+巴兰基亚 12.8020653633
+埃耶 13.900677652
+三湖 10.9562386728
+逐月 9.09665660724
+定盘星 12.2912397395
+寒号鸟 13.900677652
+袁鸣 13.900677652
+实习医生 12.5143832909
+紧跟 8.84443184663
+铁铮铮 12.5143832909
+心胸开朗 13.900677652
+承包方 12.2912397395
+美舒雅 11.7034530746
+柳条湖 13.900677652
+中央财政 9.16447920358
+乙烷 10.4041700905
+叨唠 12.5143832909
+短骨 12.2912397395
+捕风捉影 9.94943393339
+起落架 9.56994431169
+艰难竭蹶 13.900677652
+紧贴 9.65218240993
+环境异常 12.2912397395
+幼年时代 12.2912397395
+透了心 11.2616203224
+应答机 11.9547675029
+支着 10.4994802703
+长江水利委员会 12.5143832909
+却见鲁 13.900677652
+洗脑 11.7034530746
+载客 9.44633035572
+饿瘦 12.2912397395
+救济粮 11.0103058941
+聚散 10.1871055853
+洗脚 9.89334446674
+罗默 10.9049453784
+误删除 13.900677652
+氢气 9.03314320152
+蔡松 13.2075304714
+吴称臣 13.2075304714
+蓄洪量 13.2075304714
+深山老林 9.58318953844
+刊谬补缺 12.8020653633
+学会 6.75076081584
+各奔东西 11.7034530746
+好离好散 12.5143832909
+田福堂 7.78258045393
+过谦 10.604840786
+乌尔马尼斯 13.900677652
+苏氨酸 12.2912397395
+陈纳德 12.2912397395
+洗脱 10.4666904475
+拍马 9.20019728618
+黄发 11.8212361103
+原始数据 11.598092559
+贝格 9.77354326693
+铁镐 12.8020653633
+洗脸 8.67493097826
+杨承祖 11.0674643079
+南夷兵 13.2075304714
+首都区 12.5143832909
+访人 13.900677652
+石井乡 12.8020653633
+谢若萍 8.56313957227
+梅树村 11.9547675029
+伦理化 13.900677652
+猛虎下山 12.1089181827
+访亲 12.8020653633
+孽种 11.3357282945
+塔赫塔 12.1089181827
+访京 12.8020653633
+丹炼 12.2912397395
+征得 9.45802639549
+管理法 10.0294766411
+送错 13.900677652
+鹿师傅 13.2075304714
+羊绒 11.1926274509
+军用飞机 9.80633308975
+沈一贯 11.598092559
+滑翔 9.80633308975
+欺哄 11.7034530746
+周襄王 11.2616203224
+磨子 11.0674643079
+燕臣 13.2075304714
+无害化 11.1926274509
+火山砾 11.8212361103
+赫斯塔尔 12.2912397395
+赞比亚 9.43476953332
+参政 9.21854642485
+饥民 8.40761620864
+学位 8.35160156708
+萨德伯 12.5143832909
+再借不难 13.2075304714
+古香古色 12.8020653633
+放火烧山 12.1089181827
+许多股 12.1089181827
+巩固国防 11.598092559
+坎特 12.2912397395
+人设 13.2075304714
+卫生用品 11.5027823792
+人论 12.5143832909
+弗莱姆 13.2075304714
+参拜 9.5062284973
+随时 6.66074506066
+直面人生 12.5143832909
+骨干分子 11.4157710022
+盗宝 11.2616203224
+人非木石 13.900677652
+断然地 11.0674643079
+子科 10.9562386728
+质量检验 11.1926274509
+过访 12.1089181827
+姐妹花 11.9547675029
+疑难杂症 11.598092559
+谅解 8.76487921493
+富汉 13.900677652
+子秀 13.2075304714
+七六 12.5143832909
+陆海军 10.0088573539
+门演礼 11.5027823792
+抽空 9.7898037878
+比亚山 13.2075304714
+人语 10.765183436
+作答 9.6811699468
+粪胆素 13.900677652
+比白帆 12.2912397395
+招供 10.4349417492
+过话 10.4349417492
+有据 11.2616203224
+发光管 12.5143832909
+美学 8.37522471284
+值班人员 11.598092559
+压滤 13.900677652
+斑鸠 9.66657114738
+富水 10.765183436
+洒满 11.1280889297
+小顺子 11.5027823792
+躲藏 9.56994431169
+透析器 12.5143832909
+止境 11.9547675029
+主光轴 11.2616203224
+正负极 11.9547675029
+盐溶液 11.1280889297
+暴死 11.0103058941
+丁丁咣 13.2075304714
+随文 12.5143832909
+百日红 13.900677652
+退步 10.4041700905
+人证 11.7034530746
+汪兆龄 13.2075304714
+金药 13.900677652
+努尔 10.765183436
+赢取 11.0674643079
+拨拉 11.0103058941
+支点 9.85762638414
+富民 9.72629038208
+弥留之际 11.1280889297
+态度暧昧 12.8020653633
+美字 13.900677652
+华润集团 10.8096351986
+牧神节 12.8020653633
+凝集力 13.2075304714
+乌兰巴托市 13.900677652
+千万把 13.2075304714
+加拉斯 13.900677652
+华国锋 10.9049453784
+免于一死 13.2075304714
+藏传 11.7034530746
+寄回 11.0674643079
+牛筋 11.8212361103
+阶段 5.32126111738
+富泰 13.2075304714
+六百六十 12.2912397395
+凸字形 12.5143832909
+宛平县 10.6818018271
+魁星 10.9049453784
+不能医治 13.900677652
+店东 13.2075304714
+千余年 9.85762638414
+欺压 9.65218240993
+鹤庆 11.5027823792
+温文宝 13.900677652
+子神 12.1089181827
+骚体 11.2616203224
+程序语言 11.8212361103
+周末版 13.900677652
+信息库 11.5027823792
+第六位 10.4349417492
+时报周刊 13.900677652
+行政当局 11.7034530746
+补习学校 10.8096351986
+白毛女 10.2897597393
+暴毙 12.8020653633
+何保卫 13.900677652
+百万分之一 11.0103058941
+声言 9.66657114738
+波轮式 12.8020653633
+惊心吊胆 13.900677652
+林芝地区 11.2616203224
+吴作贺 13.900677652
+茶铺 13.2075304714
+参战 8.11993413618
+健康长寿 11.0103058941
+单纯化 13.900677652
+藏住 12.1089181827
+孝感人 13.2075304714
+部员 11.9547675029
+经营学 13.2075304714
+加聚型 13.2075304714
+细胞样本 13.900677652
+拨打 8.36728816325
+掩盖物 13.900677652
+闻得孙 12.8020653633
+熙来攘往 11.1926274509
+汤里来 13.900677652
+地效 12.8020653633
+李信军 13.2075304714
+有备无患 10.9049453784
+罗阿丝 13.2075304714
+离子束 11.7034530746
+生与死 10.6818018271
+第六任 12.8020653633
+仙鹤草 12.2912397395
+全真道人 13.2075304714
+第六件 13.900677652
+富海 13.2075304714
+孙文说 13.2075304714
+粮农 13.2075304714
+藏人 10.8096351986
+一两项 13.900677652
+赵邦杰 10.8561552143
+一两页 13.900677652
+第六代 10.4349417492
+藏匿在 11.7034530746
+过誉 11.5027823792
+拨接 12.2912397395
+声请 13.900677652
+西什库 12.1089181827
+茶锈 13.2075304714
+燃点 10.9562386728
+签诗 11.7034530746
+说者 11.4157710022
+系统监控 11.9547675029
+吸管虫 13.2075304714
+纺织界 13.900677652
+平南夷 13.2075304714
+出租车 7.63537643924
+令人起敬 13.900677652
+蓄能器 13.2075304714
+签证 9.18217878068
+不如意 9.84023464143
+因在 8.78268383956
+李信停 13.2075304714
+胡亚雷斯 12.1089181827
+膀臂 10.2630914922
+可拉明 13.900677652
+明星队 13.2075304714
+基建工程 11.5027823792
+招些 12.2912397395
+未获 8.99540287354
+真空机 13.900677652
+吊胃口 13.2075304714
+那脸儿 13.900677652
+纺织用 11.9547675029
+屡战屡败 11.7034530746
+语锋 13.900677652
+签订 6.21313888577
+千字 12.1089181827
+印加帝国 10.4349417492
+磨工 12.2912397395
+四十一年 10.2117981979
+招亲 11.9547675029
+家喻户晓 9.72629038208
+宗崇信 12.8020653633
+普四世 12.2912397395
+东床快婿 13.2075304714
+招人 9.7898037878
+征夫 11.598092559
+二百一十一亩 13.2075304714
+二锤 11.2616203224
+税局 12.1089181827
+罗贡坝 12.2912397395
+绮丽 10.0088573539
+声讨 9.6811699468
+居晋阳 12.8020653633
+声讯 12.8020653633
+封鲁 12.5143832909
+云贵高原 9.12155415886
+湿湿的 11.3357282945
+黑曲霉 13.2075304714
+赢利 9.25628675283
+赢到 12.8020653633
+苏浙镇 13.2075304714
+二千五百 11.0674643079
+总行 8.97342396682
+皮质素 13.2075304714
+伤亡者 13.900677652
+阮玲玉 11.5027823792
+甘油三酯 10.8561552143
+景天 12.2912397395
+开仗 11.4157710022
+人言 9.87532596124
+空投物资 13.2075304714
+千秋万岁 12.1089181827
+濉溪 12.1089181827
+望尘莫及 10.1871055853
+曲尽其妙 12.1089181827
+墨江 12.1089181827
+站开 12.5143832909
+试妆 13.900677652
+儒略历 11.1926274509
+扫尾 12.1089181827
+唐明皇 10.7226238216
+富润 12.1089181827
+从炀帝 12.5143832909
+智利硝 13.900677652
+一百有余 13.2075304714
+三港 13.900677652
+丹皮 11.0674643079
+榆树市 12.2912397395
+藏书 9.04864738806
+滑移 10.8561552143
+回归估计 13.900677652
+股票论坛 11.1926274509
+泛非主义 11.4157710022
+敢作 13.2075304714
+第六个 10.2897597393
+邓太妙 10.8096351986
+绮云 13.900677652
+幕后指挥 13.2075304714
+燕妒莺惭 13.900677652
+等量齐观 12.1089181827
+河南省政府 9.72629038208
+己二胺 11.598092559
+失职人员 13.900677652
+互助合作 10.8561552143
+阳亭侯 12.2912397395
+车架号 13.2075304714
+第二次世 13.2075304714
+各个单位 11.9547675029
+蓝墨水 12.1089181827
+未能 6.43846271221
+天不绝人 12.8020653633
+电解锰 13.2075304714
+豁边 13.900677652
+方向机 11.9547675029
+滑稽 8.89673134603
+斯托夫 13.900677652
+眼梢 11.598092559
+千伏 9.98865464655
+征婚 9.85762638414
+丹扬 13.2075304714
+晋察冀军区 9.85762638414
+窃国大盗 13.900677652
+植被状况 13.2075304714
+地迎 10.2630914922
+托罗 12.5143832909
+吕金丹 12.8020653633
+柳敬亭 9.04086524761
+美多 13.2075304714
+卞甫 11.9547675029
+基督教堂 11.598092559
+杨庆善 13.2075304714
+书法家 8.75318317516
+第几处 13.900677652
+面议 11.4157710022
+寄名 12.1089181827
+作祟 9.93038573842
+天空海阔 13.900677652
+韩月乔 13.900677652
+柴拉琴 13.900677652
+郭祥往 12.1089181827
+轧伤 13.2075304714
+茶陵 10.8561552143
+潘达雷 13.2075304714
+丹田 10.2630914922
+爱情故事 9.82314020807
+参悟 10.4041700905
+洒泪 10.3171587135
+鹤山 11.0674643079
+一大块 9.22784881751
+试婚 12.5143832909
+边撑 13.900677652
+求稳怕乱 13.900677652
+人见 9.19114745066
+春大麦 12.8020653633
+打乒乓球 11.3357282945
+快有 12.1089181827
+饶乐郡 12.8020653633
+西藏药业 11.7034530746
+开始运转 12.2912397395
+酤酒 13.900677652
+洒水 11.598092559
+淮山 10.8561552143
+霍光尊 13.2075304714
+忙里 12.2912397395
+哈兹木 13.2075304714
+李信叫 13.2075304714
+施暴者 12.8020653633
+正负数 12.5143832909
+牟取暴利 10.2371160058
+饿猫 12.8020653633
+格则勒 12.2912397395
+无影无踪 9.0884932966
+古尔河 13.2075304714
+劳伦斯伯克利 13.2075304714
+欢乐祥和 13.900677652
+齐爷 13.2075304714
+而立之年 11.598092559
+宋慈圣 13.2075304714
+螺纹钢 8.33233314821
+埃扎纳 12.8020653633
+公忠义 12.5143832909
+石化集团 13.900677652
+找齐 12.1089181827
+不滑稽 13.900677652
+生存性 12.5143832909
+花衣服 12.5143832909
+驱车前往 11.9547675029
+吕克昂 13.2075304714
+煤气公司 11.4157710022
+考试学 12.5143832909
+韩仲良 13.2075304714
+白衬衫 11.5027823792
+就可以看 11.1926274509
+牛津郡 11.9547675029
+弘愿 13.900677652
+送送 10.8096351986
+任楚郡 13.2075304714
+美姬 11.9547675029
+高良河 13.2075304714
+器乐曲 10.2117981979
+七八间 11.8212361103
+银行贷款 8.31718134319
+徐庄村 13.900677652
+鱼冻 13.2075304714
+彭泽县 12.2912397395
+脱口秀 12.2912397395
+藻类植物 10.5684731418
+随机 8.14493543839
+作秀 10.4994802703
+美姿 12.8020653633
+异氰酸 13.2075304714
+古尔泰 12.1089181827
+算好 11.598092559
+鹤峰 11.3357282945
+赫斐斯 12.5143832909
+欺凌 9.63799777493
+芳容 11.7034530746
+子笑 11.3357282945
+敢奏 13.2075304714
+美国加州理工学院 11.5027823792
+浮法玻璃 11.7034530746
+富源 11.7034530746
+滞积 13.900677652
+美姑 12.5143832909
+咕隆 11.7034530746
+敢于 7.90671622467
+单手操作 13.900677652
+射频武器 13.900677652
+齐天府 12.1089181827
+金刚钻 11.2616203224
+惠兴 13.2075304714
+人口地理 11.598092559
+暴栗 13.900677652
+商民皆 12.8020653633
+景宁 11.598092559
+波西奥 13.2075304714
+音频接口 13.900677652
+千多 11.9547675029
+一百七十亩 13.2075304714
+倾家破产 12.1089181827
+景定 11.1280889297
+生活照 12.8020653633
+景宗 9.85762638414
+声觉 13.2075304714
+子端 12.5143832909
+丁托列 12.2912397395
+千夫 13.2075304714
+居天子 12.5143832909
+继发 9.07236391467
+杨秋玲 13.900677652
+移动硬盘 12.8020653633
+罗马 6.66074506066
+磨得 10.2897597393
+高台教 11.7034530746
+繁育 9.69598503258
+娇里娇气 13.900677652
+紧要 9.0884932966
+丹瑞 13.900677652
+子立 13.900677652
+渠帅罗 13.900677652
+摇曳生姿 12.8020653633
+繁难 11.8212361103
+奥迪氏 13.2075304714
+池宇峰 11.7034530746
+著者索引 12.8020653633
+纳子法 13.2075304714
+磨快 12.2912397395
+惠允 13.900677652
+老大昌 13.2075304714
+涉猎 9.84023464143
+千套 12.1089181827
+话锋 12.5143832909
+载录 11.8212361103
+南温带 11.7034530746
+防洪措施 13.2075304714
+哄抬物价 12.2912397395
+香蕉皮 13.2075304714
+明楼 10.8096351986
+满腔热忱 13.2075304714
+辩证唯物主义 9.32596667347
+罗知悌 13.2075304714
+景寿 12.2912397395
+追过去 11.2616203224
+聚星 11.2616203224
+俾路支省 12.2912397395
+轴承合金 12.2912397395
+幼龟 12.5143832909
+张皇后 11.1280889297
+茌平县 13.900677652
+弯曲处 13.900677652
+阚泽来 13.2075304714
+轧上 13.900677652
+打击乐 11.1926274509
+无棣 12.2912397395
+百分之一点 11.5027823792
+德薄能鲜 13.900677652
+阶梯 9.00283785202
+比宙斯 13.900677652
+滞碍 13.900677652
+八十四 11.3357282945
+扫帚 9.37888907493
+今草 12.5143832909
+不则声 13.2075304714
+八十回 13.2075304714
+陈记室 13.2075304714
+棒极了 12.2912397395
+埃马努 12.8020653633
+洒洒 11.7034530746
+吴称藩 13.2075304714
+宗乾顺 13.2075304714
+一百七十三 12.5143832909
+湿地松 13.900677652
+高句丽 9.66657114738
+李龙眠 13.900677652
+额济纳旗 10.5684731418
+构筑物 10.3171587135
+衰竭 8.51160592216
+过街 11.5027823792
+奔窜 11.2616203224
+觌面 11.0103058941
+耶和华 11.598092559
+东印度 9.06439574502
+粉扑扑 13.2075304714
+高良涧 11.9547675029
+高公 11.3357282945
+美声 12.8020653633
+臧威霆 10.7226238216
+斟情 12.8020653633
+几十万米 12.1089181827
+霍英东 12.1089181827
+征实 11.4157710022
+人行 9.4233408375
+丁肇中 11.5027823792
+特沃思 11.9547675029
+电解铝 9.34680076038
+电解铜 11.7034530746
+任前军 13.2075304714
+辞退 9.94943393339
+关闭电源 13.900677652
+扫平 11.4157710022
+戈特芒 13.2075304714
+不知进退 12.5143832909
+生双翅 12.8020653633
+卅年 12.8020653633
+海林县 13.900677652
+利马 10.1394775363
+列日涅夫 10.8096351986
+絮棉 13.2075304714
+万余平方米 11.1280889297
+一孔 10.0940151622
+经济滑坡 11.1280889297
+归春河 13.900677652
+厚遇 12.2912397395
+试听 11.2616203224
+指挥所 8.79473217808
+零落 10.5684731418
+热络 11.0674643079
+子痫 11.598092559
+说了算 8.97342396682
+厚道 10.1394775363
+死心眼 11.1926274509
+人性本善 12.5143832909
+敌百虫 11.598092559
+玛雅潘 13.900677652
+餐会 13.900677652
+自顾自 10.3453295905
+滑琛 13.2075304714
+美圆 11.9547675029
+郭默 12.8020653633
+赢得 7.19259356812
+支系 9.11318590919
+广惠王 13.2075304714
+奥古 11.9547675029
+雀类 13.900677652
+千百户 12.5143832909
+锐钛矿 12.8020653633
+试吃 12.8020653633
+刘国正 13.2075304714
+罗锅 11.9547675029
+红十字 10.533381822
+骂咧 13.900677652
+机群 11.1926274509
+丹符 13.2075304714
+粗中有细 12.2912397395
+八十多 12.8020653633
+芳唇 13.900677652
+合理密植 12.2912397395
+陈友定 11.9547675029
+勤俭节约 11.598092559
+余香满口 12.5143832909
+富态 11.1926274509
+程德全 13.2075304714
+八十天 12.8020653633
+相融 11.598092559
+戴宗随 13.2075304714
+角鲨烷 13.900677652
+四百三十八万余吨 13.2075304714
+榆树县 13.900677652
+凤求鸾 13.900677652
+扫出 11.9547675029
+敌众我寡 11.7034530746
+游牧民族 8.98069672615
+单发前 13.2075304714
+杨继盛 12.2912397395
+换步 13.900677652
+百多个 12.8020653633
+王改封 13.2075304714
+非农业 9.53122979951
+拉斯峰 13.2075304714
+白跑一趟 12.8020653633
+弄散 13.2075304714
+争斗不休 12.5143832909
+华人华侨 13.2075304714
+但愿 8.27666014579
+成昆线 12.2912397395
+割据一方 10.604840786
+难以估计 11.8212361103
+中国足球队 12.8020653633
+残酷无情 11.1280889297
+屡战屡胜 13.2075304714
+扮演者 11.8212361103
+终唐之 12.8020653633
+信息办 13.900677652
+大权在握 11.1280889297
+骄阳 10.9562386728
+生二胎 11.5027823792
+天灵盖 11.1926274509
+子甲 11.1280889297
+居无定所 12.5143832909
+万一出 10.604840786
+扫光 13.2075304714
+张监军 12.2912397395
+情报研究 13.900677652
+丰满水库 11.4157710022
+千四 13.900677652
+天灾人祸 10.4041700905
+建行就 12.5143832909
+猛冲 9.75754292558
+领航员 10.9049453784
+轰下来 13.2075304714
+洒扫 10.8561552143
+衰疲 13.900677652
+眼晕 10.9562386728
+依允 10.3171587135
+冯云山 11.598092559
+拳曲 12.2912397395
+艾条灸 12.5143832909
+连明叔 12.2912397395
+欺心 10.533381822
+泪流满面 9.12999302751
+敢坐 11.7034530746
+罪恶根源 13.900677652
+夹杂着 8.88339781516
+亚乙基 13.2075304714
+茶食 12.1089181827
+万石山 13.900677652
+演绎法 11.5027823792
+谋生之道 12.2912397395
+慢性病 9.5062284973
+攻下来 13.2075304714
+珍本 11.1926274509
+塔兰泰 12.8020653633
+李延一 11.0674643079
+许十年 13.2075304714
+辉南 11.8212361103
+小婆子 13.900677652
+体面起来 13.900677652
+寄存 10.642581114
+跟我走 9.65218240993
+踟躇 13.2075304714
+姜维 8.86372504956
+陡壁 10.4349417492
+寄希望于 9.55687223012
+潜阳 13.2075304714
+艾塔斯 13.2075304714
+未进 11.3357282945
+猜测到 11.7034530746
+十八万两 13.2075304714
+一大堆 8.46695564842
+信息化 7.75220935606
+蒋二人 13.2075304714
+木薄壁 13.2075304714
+拳术 9.98865464655
+白玉钏 13.2075304714
+露头角 12.5143832909
+青康藏高 13.2075304714
+人怕出名猪怕壮 12.2912397395
+舌战 11.598092559
+磨出 10.6818018271
+未达 10.765183436
+唐兀或 13.2075304714
+信息卡 13.900677652
+低分辨率 12.5143832909
+梁中 12.8020653633
+惊悚片 13.900677652
+马列主义 9.98865464655
+暴晒 10.3453295905
+硅灰石 11.1926274509
+钞券 13.2075304714
+载入 10.2897597393
+讲过来 13.900677652
+海洛因 10.2371160058
+全国会计 13.2075304714
+虹吸管 11.598092559
+千块 11.8212361103
+高雄人 13.900677652
+王喜快 13.2075304714
+孙权闻 12.8020653633
+染上去 13.900677652
+伍遵契 13.2075304714
+都市人 11.3357282945
+品花宝鉴 12.8020653633
+人蛇 13.900677652
+美人 8.51618258919
+部委 8.82550383674
+化学武器 9.82314020807
+咬了一口 10.2897597393
+曹汝霖 10.642581114
+毛莨科 12.5143832909
+三四条 12.1089181827
+陡增 10.4349417492
+戴宗面 13.2075304714
+厚重 8.53938548627
+糖生成 13.900677652
+支教 10.6818018271
+潜隐 12.5143832909
+躲逃 13.900677652
+威慑力量 11.3357282945
+劳动定额 12.1089181827
+部头 13.2075304714
+扫倒 12.8020653633
+夏风哩 12.5143832909
+英国皇家 9.40086798165
+贪鄙 10.9049453784
+占去 9.85762638414
+贾家庄 11.7034530746
+未艾方兴 13.900677652
+寄寓 10.9049453784
+瞄向 11.598092559
+加尔西 13.2075304714
+等同性 12.1089181827
+无根 9.93038573842
+奋斗不息 12.1089181827
+化学材料 12.5143832909
+萨利亚 12.5143832909
+倘不 10.5684731418
+子瑜 11.7034530746
+一千六百元 13.2075304714
+织锦 9.69598503258
+茶馓 12.5143832909
+脚尖儿 12.1089181827
+找遍 10.765183436
+兵器工业集团公司 13.2075304714
+基洛夫 10.4994802703
+茶香 10.5684731418
+燕山大学 11.9547675029
+语不惊人 13.900677652
+花雕酒 12.8020653633
+同等待遇 11.598092559
+过虑 10.3171587135
+斯彭斯 12.5143832909
+磨具 11.0674643079
+化安山 12.1089181827
+锡耶纳 12.8020653633
+参演 10.642581114
+一审 9.4233408375
+六千多 11.598092559
+美图 13.900677652
+青莲岗 11.9547675029
+山颉 12.2912397395
+夏风哥 13.2075304714
+子琮 12.8020653633
+史学界 9.69598503258
+麝香草 13.900677652
+古拉格 12.8020653633
+抵触情绪 10.9049453784
+发散透镜 13.2075304714
+友邻 11.0103058941
+饮料罐 12.8020653633
+不吝珠玉 12.8020653633
+传功 13.900677652
+拒按 11.0674643079
+名列第一 10.6818018271
+寄宿 9.80633308975
+磨光 10.1630080337
+罗钳 13.900677652
+刀耕火种 9.77354326693
+蓉城 11.8212361103
+坪寨 11.4157710022
+吞武里 12.5143832909
+斟满 9.62401153296
+鹤发 13.2075304714
+余永定 10.533381822
+子石 10.4041700905
+电流强度 10.533381822
+支绌 12.2912397395
+杜拉克 13.900677652
+千名 7.79811905736
+义务兵役 13.2075304714
+悠闲自得 13.900677652
+暧昧 9.31571017331
+哈密尔顿 11.2616203224
+和辽军 12.8020653633
+支给 11.3357282945
+诸职司 12.2912397395
+坤伶 13.2075304714
+门墙 10.8096351986
+俾斯麦 9.56994431169
+粮库 10.8561552143
+内环线 12.2912397395
+粮店 11.8212361103
+暴政 9.59661255877
+千吨 10.1394775363
+魁梧 9.84023464143
+子方兄 12.5143832909
+作画 9.29550746599
+分类目录 11.9547675029
+刘副将 12.5143832909
+丁香油 12.8020653633
+活阎王 11.598092559
+议会厅 12.2912397395
+扫去 11.1926274509
+敢喝 12.5143832909
+捷尔任斯基 12.2912397395
+埃斯塔克 13.2075304714
+作用 4.48870341217
+滞留 8.9519177616
+罗霄 10.6818018271
+暴敛 11.8212361103
+浓眉毛 11.598092559
+通今博古 12.1089181827
+吉卜赛 12.5143832909
+光学录音 13.900677652
+有效温度 11.598092559
+正上方 11.0674643079
+大喜过望 10.4666904475
+子瞧 13.2075304714
+阿武 12.5143832909
+胡德堡 10.9562386728
+珍摄 12.8020653633
+奇经八脉 11.0103058941
+珍羞 12.2912397395
+东姊儿 13.2075304714
+向法军 13.2075304714
+广东籍 11.9547675029
+美商 10.8561552143
+支线 8.26232298264
+脸子 10.8561552143
+试一下 10.4041700905
+不远处 8.33615724465
+伦巴 10.7226238216
+拐上 11.3357282945
+不论是 8.17709255002
+苗人 10.533381822
+装订机 11.598092559
+归平阳 13.900677652
+白瓷 9.82314020807
+整体利益 10.4041700905
+亿瓶 13.2075304714
+磨到 12.1089181827
+磨制 9.91169360541
+拨水 11.9547675029
+马香 13.900677652
+金鸡岭 12.2912397395
+叙事诗 9.28555713513
+通志初 13.900677652
+第五十一 12.8020653633
+家族 6.73441167784
+居天园 13.2075304714
+第五十三 11.5027823792
+邵仲光 12.2912397395
+芳基 11.3357282945
+首尾两端 13.900677652
+狂风恶浪 12.8020653633
+白玉霜 12.1089181827
+苗乡 13.900677652
+公路桥 10.0720362555
+阿德里亚 13.900677652
+岳州窑 12.5143832909
+美善 12.1089181827
+富拉 12.8020653633
+探出来 11.598092559
+旋乾转坤 13.900677652
+罗音 11.1926274509
+个字符 10.5684731418
+刘太公 10.604840786
+丹科 12.2912397395
+来永寿 13.2075304714
+磨刀 10.8561552143
+毛里 11.5027823792
+防老 12.1089181827
+手摇式 12.1089181827
+直营店 10.4349417492
+沃尔维 12.5143832909
+试图 7.07413242842
+播送 10.8096351986
+美不胜收 11.4157710022
+第五十九 11.8212361103
+便盆 11.8212361103
+作痛 11.3357282945
+前所未有 7.73106691948
+乐清县 13.2075304714
+弘恩 13.900677652
+倪宽赞 13.2075304714
+办不成 9.98865464655
+地理考察 11.598092559
+仰韶 10.8096351986
+残疾者 12.1089181827
+蝙蝠洞 13.2075304714
+汝言正 12.8020653633
+武宗才 13.2075304714
+洗衣 9.22784881751
+荐拔 11.0103058941
+在城镇 9.10488710638
+滑盖 13.900677652
+耕作层 11.7034530746
+中国财政部 11.4157710022
+关天培 11.1926274509
+梁主 13.2075304714
+照理说 10.9562386728
+皮德蒙 13.2075304714
+磨削 11.0674643079
+诸尹 12.8020653633
+热身赛 11.7034530746
+庄生晓 13.2075304714
+家庭旅馆 12.2912397395
+四川菜 13.900677652
+喜滋滋 10.2371160058
+磨去 12.8020653633
+国际展览 12.8020653633
+罗陀 11.598092559
+涉网 13.900677652
+任沪军 13.2075304714
+藏族同胞 13.2075304714
+夕阳工业 13.900677652
+文化部门 12.1089181827
+辉光 10.6818018271
+住房供给 10.3743171274
+胆小如鼠 10.642581114
+子目 11.3357282945
+立安敦 13.2075304714
+继志 12.8020653633
+子监 13.900677652
+子盖 12.8020653633
+美名 10.0294766411
+浮上来 11.1280889297
+两万八千多 13.2075304714
+市易法 11.9547675029
+患者 6.34791556776
+未跌 13.900677652
+糖尿病 7.71859274526
+寄好 13.900677652
+视杆细胞 12.1089181827
+尚无礼 12.5143832909
+单瘫 13.2075304714
+端口数 13.2075304714
+二十三亿美元 12.5143832909
+眼时 12.2912397395
+客户群 10.0940151622
+齐齐哈尔市 10.4666904475
+唐杖子 13.900677652
+高长壮 13.900677652
+灵怪 11.8212361103
+书报摊 13.900677652
+箝口 13.900677652
+维西傈僳族自治县 12.8020653633
+朱乃正 12.8020653633
+苏比克 13.900677652
+网络软件 11.3357282945
+刘国栋 13.900677652
+阿科斯塔 13.900677652
+鸡鸭鱼肉 10.8561552143
+子皮 12.8020653633
+灵性 9.62401153296
+从世民 12.8020653633
+丹砂 10.6818018271
+白玉雕 13.2075304714
+征地 9.21854642485
+王曾灭 13.2075304714
+罗阳 12.1089181827
+典狱长 12.8020653633
+杜近芳 12.8020653633
+延揽人才 13.2075304714
+铝线 13.2075304714
+票然 13.900677652
+自由发挥 11.8212361103
+体育精神 13.900677652
+向红河 12.5143832909
+目连 11.598092559
+唐兀惕 13.2075304714
+衰敝 11.7034530746
+发烧时 13.2075304714
+白玉阶 11.2616203224
+没那回事 12.2912397395
+知识经济 11.7034530746
+文化部长 12.1089181827
+荆钗 13.900677652
+火山灰 10.0505300503
+洗净度 13.900677652
+国家自然科学基金委员会 13.2075304714
+罗雪 8.82550383674
+梁武帝 9.56994431169
+扫到 10.8096351986
+开路机 13.900677652
+孙官人 13.2075304714
+中共天津市委 12.8020653633
+肾动脉 11.598092559
+审美观念 11.5027823792
+景地 13.2075304714
+变速杆 11.9547675029
+范比滕 12.8020653633
+滑石 9.54396882529
+会计部 13.900677652
+编辑出版 9.44633035572
+燃烧器 12.5143832909
+未贴 13.900677652
+扬威 11.2616203224
+谈古说今 13.2075304714
+怀远镇 11.8212361103
+伏道傍 13.2075304714
+侍孙海 12.8020653633
+袁隗 12.5143832909
+罗隐 11.8212361103
+万古长存 13.900677652
+养济院 12.2912397395
+刘国梁 13.900677652
+睡下来 13.2075304714
+身材高大 10.0940151622
+时运 10.9049453784
+八神庵 13.2075304714
+丢饭碗 12.8020653633
+南半球 9.34680076038
+耗时间 12.1089181827
+全线贯通 11.1280889297
+环保局 9.87532596124
+特训班 11.9547675029
+重新组建 10.9049453784
+斯米尔诺夫 13.900677652
+白茆 12.8020653633
+甘乃光 12.8020653633
+撂挑子 11.1926274509
+占个 11.5027823792
+哪些因素 11.0674643079
+千刀 11.9547675029
+奥贝尔 13.900677652
+千分 12.5143832909
+谢尔久 13.2075304714
+赢家 9.12155415886
+书面语言 11.5027823792
+朴学大师 12.8020653633
+占为 11.9547675029
+公车私用 11.598092559
+无把握 11.0674643079
+黄体 10.533381822
+南京军区 11.1280889297
+郑凤荣 12.5143832909
+三顾草庐 12.2912397395
+刘以敬 12.2912397395
+占下 13.900677652
+您提 13.2075304714
+歪处 13.900677652
+洗身 13.2075304714
+淫秽内容 11.9547675029
+不眠不休 13.900677652
+庞驳 12.5143832909
+一寸 9.16447920358
+亿片 13.2075304714
+汉阳铁 9.7898037878
+美化 9.20932976975
+沈绍安 12.8020653633
+景像 11.7034530746
+披褂 13.900677652
+望空 10.0505300503
+一药 13.2075304714
+巢呈梨 13.2075304714
+拳打 10.9049453784
+奶皮子 13.2075304714
+逃出虎口 13.2075304714
+历史舞台 9.7898037878
+拳手 11.7034530746
+司法官员 11.7034530746
+翦除 10.604840786
+胃俞 13.2075304714
+征候 11.2616203224
+征借 11.5027823792
+关天关 12.8020653633
+黄伯 12.5143832909
+生小穗 13.2075304714
+面生 10.642581114
+美协 11.8212361103
+国民革命 9.65218240993
+儿童文学家 12.5143832909
+眼拙 12.1089181827
+省高院 10.7226238216
+合成器 11.2616203224
+齐东野语 12.2912397395
+修辞学家 13.900677652
+鸟语花香 11.1926274509
+美南 13.900677652
+肋软骨 11.9547675029
+苏文卿 12.1089181827
+着火 9.03314320152
+稳操 13.900677652
+音容如在 13.900677652
+罗里 13.2075304714
+黄泥堡 13.900677652
+粮堆 12.2912397395
+袁野 10.9049453784
+任格致 12.8020653633
+沙僧闪 13.2075304714
+相犯者 12.5143832909
+胸无城府 12.2912397395
+人造美女 12.8020653633
+声色 9.82314020807
+一两重 12.8020653633
+一两里 13.2075304714
+抢生意 11.3357282945
+线条图 12.8020653633
+朗润园 13.900677652
+缓凝剂 12.8020653633
+黄信 9.11318590919
+东州修 12.8020653633
+准对称 13.900677652
+陡直 12.5143832909
+织造 8.77671367257
+部将 8.42421410004
+某种 6.5092624173
+马克辛 13.2075304714
+莺啼燕语 13.2075304714
+放录像 13.2075304714
+楚楚动人 10.6818018271
+子然 12.8020653633
+驻马店市 9.85762638414
+一百二十八万 13.2075304714
+画儿 10.2117981979
+凤尾竹 13.2075304714
+景亭 12.8020653633
+富甲天下 11.8212361103
+什一税 10.7226238216
+张臭嘴 12.2912397395
+白头偕老 11.8212361103
+唐二哥 13.2075304714
+反转片 13.900677652
+向玉娘 13.900677652
+三泽 11.598092559
+发国难财 11.3357282945
+方率军 13.2075304714
+类人猿 11.7034530746
+中美洲地区 12.2912397395
+棘皮动物 10.3743171274
+部属 8.96620371885
+排山倒海 10.5684731418
+马巷 13.900677652
+开杀戒 11.9547675029
+拳拳 11.9547675029
+哜哜嘈嘈 13.2075304714
+闻声转 13.900677652
+十二件 13.2075304714
+淤塞 9.69598503258
+机舱门 13.900677652
+陡崖 10.0294766411
+获嘉县 12.8020653633
+广东站 13.900677652
+皮罗阁 12.8020653633
+贺国强 10.9562386728
+华尔兹 11.598092559
+桓阶 12.2912397395
+结小群 12.2912397395
+黄义 12.8020653633
+汽车附件 13.2075304714
+征免 11.3357282945
+布鲁氏菌 13.900677652
+作活 12.1089181827
+指挥权 10.1394775363
+褚应璜 12.8020653633
+有夫之妇 11.9547675029
+阎锡山 9.32596667347
+景军 12.8020653633
+秦邦宪 11.4157710022
+袁遗 13.900677652
+动心忍性 13.900677652
+未详 11.4157710022
+厘金 10.1630080337
+美制 10.0294766411
+暴戾 10.1871055853
+特地去 12.5143832909
+向阳坡 12.1089181827
+齐楚浙 11.7034530746
+秦砖汉 11.9547675029
+作爱 13.900677652
+黄书 13.900677652
+潮阳市 12.2912397395
+有分寸 10.3171587135
+美分 8.13235665618
+千匹 10.9562386728
+千座 11.7034530746
+征兵 9.01787572939
+报幕员 12.5143832909
+播音 10.0720362555
+远红外 10.8561552143
+敢劝 12.2912397395
+占优 10.1630080337
+喜脉 13.2075304714
+洗过 10.1394775363
+未设 10.9049453784
+试养 12.8020653633
+防空警报 11.7034530746
+千千 12.2912397395
+找钱 11.0103058941
+武宗旧 12.2912397395
+千升 13.900677652
+暴打 11.598092559
+望你早归 13.900677652
+酰胺键 12.8020653633
+钻地弹 13.2075304714
+谢尔伍 12.5143832909
+数字控制 11.1926274509
+武宗时 11.4157710022
+三千七百 11.9547675029
+黄兴 9.58318953844
+龙马 10.9049453784
+利马窦 13.900677652
+机构编制 11.9547675029
+骊驹 13.900677652
+千卡 10.4994802703
+改于 12.2912397395
+占住 10.4349417492
+占位 11.3357282945
+雅加达 10.1394775363
+黄丽 11.0674643079
+支离 12.1089181827
+大棕桐 12.5143832909
+千卷 12.8020653633
+妥坝 13.900677652
+柜门 11.1926274509
+作物 7.18893725692
+招妓 13.2075304714
+栅网 13.900677652
+继女 12.8020653633
+脱过 13.900677652
+雷士祯 11.5027823792
+一两部 13.900677652
+美加 12.1089181827
+昏庸无道 12.5143832909
+袁郊 13.900677652
+浪子回头 11.7034530746
+帝辛 11.598092559
+诸葛孔明 10.8096351986
+春闺梦 13.900677652
+云浮市 12.5143832909
+黄仕 12.8020653633
+卷帘门 13.2075304714
+丹维 13.900677652
+敢刻 13.900677652
+兄死弟及 13.2075304714
+龙驹 9.82314020807
+邓楠 13.900677652
+向北看 13.900677652
+争胜好强 13.900677652
+罗郡 13.900677652
+支票 9.87532596124
+及其 5.2359268962
+景儿 11.0674643079
+邮政 8.74738605748
+无形压力 13.2075304714
+几家欢乐 12.2912397395
+丹绒 13.900677652
+汉阳镇 12.8020653633
+西班牙皇家马德里队 13.900677652
+纠众 12.8020653633
+问供 13.900677652
+八十岁 10.7226238216
+试出 12.8020653633
+黄了 11.3357282945
+丹红 13.2075304714
+景元 11.7034530746
+室内装饰 10.6818018271
+初生仔 11.8212361103
+积少成多 11.3357282945
+资金周转 9.91169360541
+人艺 13.900677652
+近百年来 9.96885201925
+小金库 11.3357282945
+千发 13.2075304714
+绘图机 12.5143832909
+三十万两匹 13.2075304714
+黄云 12.5143832909
+最远 9.12155415886
+洗车 11.4157710022
+供给方 10.765183436
+景公 12.1089181827
+涉禽 11.598092559
+范文同 13.2075304714
+贞丰 12.5143832909
+千叠 12.8020653633
+琥珀 9.21854642485
+千句 13.900677652
+千古 8.37921673411
+黄人 12.8020653633
+一整瓶 13.2075304714
+晁保正 10.765183436
+千台 13.2075304714
+千叶 11.0674643079
+骨干企业 9.58318953844
+书法史 11.5027823792
+千倍 10.8096351986
+民族形式 11.8212361103
+过膝 11.5027823792
+试制 9.15574552361
+滑爽 11.1926274509
+送风 12.1089181827
+遮人眼目 13.900677652
+洗精煤 11.9547675029
+佟国维 13.900677652
+嗬哟 12.8020653633
+写歌 12.5143832909
+新闻线索 13.900677652
+香格里拉酒店 12.8020653633
+潇湘子 13.900677652
+奥本海默 10.8096351986
+红盖头 11.4157710022
+仰靠 11.2616203224
+声能 11.3357282945
+乘龙快婿 11.8212361103
+踱步 9.44633035572
+试刊 13.2075304714
+糖糕 11.7034530746
+敢写 12.5143832909
+遮丑 11.8212361103
+富春 11.1280889297
+颜颜 12.8020653633
+英美烟 11.1280889297
+人臣 10.4041700905
+揭竿起义 12.8020653633
+躲过 8.83808261895
+第三十八回 11.9547675029
+数程 12.8020653633
+涉税 11.7034530746
+长跑队 12.8020653633
+子环 13.900677652
+敢出 11.9547675029
+美光 13.900677652
+及人 11.4157710022
+给你个 10.642581114
+礼拜一 13.2075304714
+美元 5.18528955461
+一民 12.8020653633
+征到 13.900677652
+子玄 13.2075304714
+钻过来 12.8020653633
+赵五娘 12.5143832909
+圆周角 13.2075304714
+铁冠道 13.900677652
+染黑 11.5027823792
+信息员 11.9547675029
+阳安关 12.2912397395
+仁仁义 13.2075304714
+文王演 13.2075304714
+汉阳陵 12.8020653633
+过脆 13.900677652
+化解矛盾 11.7034530746
+人脸 9.91169360541
+奶品 12.8020653633
+五台山 8.83808261895
+汉高帝 11.9547675029
+回收期 10.8561552143
+未补 11.8212361103
+詹纳 12.2912397395
+父老兄弟 10.765183436
+街坊四邻 11.5027823792
+征募 11.1280889297
+夜黑风高 13.900677652
+幸福家庭 13.2075304714
+珠纹 13.900677652
+人脉 10.2371160058
+四分之三 9.55687223012
+史乘考 13.2075304714
+四分之一 8.97342396682
+戴宗道 9.74179456862
+扫地 9.31571017331
+青莲寺 12.8020653633
+王霸业 12.8020653633
+艺术体操 11.9547675029
+六千年 11.9547675029
+极压 12.8020653633
+演播厅 10.7226238216
+水能载舟 11.598092559
+子猷 11.9547675029
+辛思忠 11.9547675029
+克勒青 12.1089181827
+染色 8.66956903512
+美凤 12.5143832909
+三来一补 11.7034530746
+顺顺利利 12.5143832909
+科鹰属 13.2075304714
+砌石 11.1926274509
+那毓贤 13.900677652
+精挑细选 10.1871055853
+河风光 13.900677652
+克西宴 13.900677652
+格雷斯 12.8020653633
+百分之一秒 12.5143832909
+离子流 12.8020653633
+坏种 11.2616203224
+墨缘汇 13.2075304714
+参校 11.4157710022
+动手术 10.8561552143
+气力输送 12.8020653633
+贾作光 12.8020653633
+珍惜 8.70218062071
+岁末年初 10.4041700905
+装订所 13.900677652
+嘱托 9.58318953844
+暴怒 9.49395840471
+找零 13.2075304714
+空肚子 12.8020653633
+繁茂 9.02548032877
+孙武子 12.2912397395
+中央宣传部 11.0674643079
+库尼亚 11.5027823792
+一大帮 10.8561552143
+鹤唳 11.7034530746
+活靶 13.2075304714
+阳光明媚 10.642581114
+人肉 9.30555780184
+北路军 11.3357282945
+纺织网 13.900677652
+佛眼相看 12.5143832909
+景县 10.9049453784
+武大郎 10.765183436
+盖特威 13.2075304714
+缴枪 11.5027823792
+未觉 12.1089181827
+八十年 10.8561552143
+味十足 11.7034530746
+尽量少 10.0294766411
+未见 8.22050504296
+不大好 9.5186510173
+倘使 9.7898037878
+千克 6.93276845017
+王曾瑜 11.1280889297
+萨米恩 13.2075304714
+何海霞 12.5143832909
+陡度 12.5143832909
+千元 9.03314320152
+试卷 9.77354326693
+千兆 13.2075304714
+勃兰特 11.4157710022
+侧向侵蚀 13.900677652
+金城武 13.900677652
+继室 12.1089181827
+副反应 10.9049453784
+阿兰达 12.8020653633
+东北民主联军 10.6818018271
+女白领 12.5143832909
+支箭 11.598092559
+隐没 10.2630914922
+试卖 13.900677652
+谰言 13.2075304714
+门禁森严 13.900677652
+富有 7.02338158048
+脑梗塞 11.9547675029
+李信问 11.9547675029
+景东 11.3357282945
+芭芭拉 12.1089181827
+刘太保 12.8020653633
+媚世 13.900677652
+假洋鬼子 12.8020653633
+自制力 11.2616203224
+古尔斯 13.2075304714
+声腔 9.87532596124
+良禽择木 11.9547675029
+粗声粗气 12.2912397395
+征友 13.900677652
+糖果盒 13.2075304714
+吕爱红 11.1926274509
+红蓝白 13.900677652
+征发 9.13850371718
+离子水 13.900677652
+中建岛 11.1926274509
+保河阳 12.8020653633
+阴魂不散 10.642581114
+形而下者 12.1089181827
+人耳 10.8096351986
+解析几何 10.604840786
+藏头 11.0674643079
+立党之本 13.900677652
+继子 12.5143832909
+满洞群 12.8020653633
+罗进 8.5488195185
+子牙 11.8212361103
+送饭 9.62401153296
+征召 9.41204128224
+骑过来 13.900677652
+武宗朝 12.8020653633
+古泽 12.5143832909
+油温 11.598092559
+景区 8.06879517469
+王兆明 9.91169360541
+敢借 12.8020653633
+磨圆 11.7034530746
+方志学 12.8020653633
+苯胺 10.3171587135
+嵊县 10.4349417492
+子爵 10.9049453784
+景升 11.4157710022
+鱼场 13.900677652
+创作技巧 12.2912397395
+北部 5.89231208166
+四千八百万口 13.2075304714
+债务人 9.23723855786
+扮成 10.3171587135
+祖庵 12.1089181827
+诺埃尔 13.900677652
+颜守贞 12.8020653633
+比较简单 9.36807815882
+五大类 11.0103058941
+有猫儿 12.8020653633
+窦融 11.4157710022
+磨坊 10.0940151622
+富林 11.3357282945
+维持性 13.900677652
+柜面 11.8212361103
+德蒙 13.900677652
+多结 12.5143832909
+昌与昆 12.8020653633
+副议长 10.5684731418
+黄华 11.3357282945
+大陆军 11.5027823792
+千三 13.900677652
+千丈 10.533381822
+滑水 11.9547675029
+坎普 11.598092559
+车匪路霸 12.5143832909
+千万 6.85751773599
+非油 13.2075304714
+骄躁 13.900677652
+蒙皇爷 12.8020653633
+人权委员会 12.8020653633
+占到 8.00627481771
+眼红 9.84023464143
+学位证书 13.2075304714
+基卢瓦岛 12.5143832909
+黄南 12.2912397395
+能之士 11.7034530746
+千个 10.1164880181
+两百多斤 13.2075304714
+怀特海德 13.2075304714
+言导帝 12.8020653633
+桐城派 10.604840786
+罗赫 11.7034530746
+反应器 10.7226238216
+絮烦 11.0103058941
+千两 11.598092559
+位在 12.5143832909
+省军区 9.98865464655
+平面曲线 12.8020653633
+未公开 10.6818018271
+黔驴技穷 12.1089181827
+榜首 8.39534611604
+着手从事 13.900677652
+真心话 10.2371160058
+那悟净 13.2075304714
+墙头草 13.2075304714
+法罗海 13.900677652
+招宝 11.9547675029
+逃过一劫 12.1089181827
+三池 12.8020653633
+黄化 11.4157710022
+罗贝 12.5143832909
+支撑 5.76944110228
+帝鉴 12.2912397395
+四体书 12.5143832909
+王传令 13.900677652
+胃口 8.39534611604
+摩托化 9.22784881751
+千乡 11.5027823792
+九华灯 13.900677652
+康乃狄克 13.900677652
+坎昆 12.8020653633
+一洗尘俗 13.900677652
+尘土飞扬 10.3453295905
+肯尼迪 9.82314020807
+美体 11.8212361103
+尼乌斯 11.2616203224
+中共十三大 12.1089181827
+想当然 10.1394775363
+黄友 11.4157710022
+律师费 11.7034530746
+高鼻子 12.8020653633
+一氧 13.900677652
+谷可成 10.3453295905
+制图者 13.900677652
+中秋佳节 11.2616203224
+腊雪 12.8020653633
+元天寿 12.8020653633
+寄生性 10.2117981979
+县检察院 13.2075304714
+千五 12.5143832909
+降血糖 11.4157710022
+一百七十多 12.5143832909
+千亩 10.8096351986
+茶肆 11.1280889297
+纳米比亚共和国 13.2075304714
+黄口 12.1089181827
+合资方 13.2075304714
+朝鲜劳动党中央委员会 12.8020653633
+千人 9.40086798165
+千亿 8.9308643524
+黄叶 10.4994802703
+挤成一团 11.8212361103
+子延昭 13.2075304714
+奋不顾身 9.98865464655
+匠气 13.900677652
+潜近 13.2075304714
+黄历 12.1089181827
+藏学 10.7226238216
+甜瓜子 13.900677652
+韦尼奥 13.900677652
+罗越 13.900677652
+赌咒发誓 10.9049453784
+科研机构 8.81308131674
+黄原 7.92941581219
+魏均田 13.2075304714
+滑波 12.8020653633
+煎饼果子 12.8020653633
+峰嶂 13.900677652
+彪形 13.2075304714
+连阴雨 10.8096351986
+欧里 10.8096351986
+破伤风 10.3453295905
+千代 12.8020653633
+初生叶 13.2075304714
+朱特 12.1089181827
+刘公岛 10.3453295905
+千份 12.2912397395
+晚年 7.49214886092
+纳粹德国 9.71102290995
+千件 11.7034530746
+同蒲线 12.5143832909
+宗崇宁 13.2075304714
+美中 10.533381822
+驱动电流 12.5143832909
+由隆 13.900677652
+国之基 13.900677652
+谢尔博 13.2075304714
+子波 13.900677652
+梆子腔 10.765183436
+美丽 6.95562658825
+鹰潭市 12.1089181827
+觉者 11.8212361103
+上颌骨 10.2117981979
+磷酸酶 10.6818018271
+云雷 12.5143832909
+朴硝 13.2075304714
+开户行 11.8212361103
+秦长吏 13.2075304714
+埃尔富特 13.900677652
+敢争 12.1089181827
+其他用户 11.9547675029
+孔孟学会 13.2075304714
+美东 10.4041700905
+安息香酸 13.2075304714
+美丑 11.3357282945
+磷酸酯 11.598092559
+潜踪 11.2616203224
+从这以后 11.5027823792
+认真负责 11.0674643079
+子河 12.1089181827
+叶均可 13.900677652
+占卦 11.7034530746
+千位 11.598092559
+衡山路 12.1089181827
+袁谋 13.2075304714
+历七主 13.2075304714
+万人空巷 12.5143832909
+过江之鲫 11.9547675029
+千余 8.98069672615
+黄初 11.1280889297
+学工 12.8020653633
+丹房 12.1089181827
+果戈里 13.900677652
+个股 5.45476566256
+条达 12.5143832909
+云南红塔集团 12.5143832909
+莫克图 13.2075304714
+智利政府 11.8212361103
+丹戎 12.1089181827
+袁谭 10.765183436
+吴达海 10.2897597393
+抵挡不住 10.1164880181
+二十多年 8.80692745117
+桃花汛 12.2912397395
+游龙戏凤 12.5143832909
+渴慕 12.5143832909
+鲍廷博 12.5143832909
+话茬 10.4349417492
+岐山县 11.4157710022
+占卜 9.01032852375
+听风是雨 13.900677652
+内格夫沙漠 13.900677652
+阶级 6.77942519873
+黄勇 11.8212361103
+截止频率 12.5143832909
+魏观 13.2075304714
+战斗准备 10.9562386728
+某大学 11.3357282945
+东京湾 10.9562386728
+登陆舰 9.36807815882
+滑润 11.1280889297
+找补 11.7034530746
+小四儿 11.8212361103
+美事 10.8561552143
+悲伤地 11.598092559
+怀特兄弟 12.2912397395
+藏娇 13.2075304714
+占压 13.900677652
+如丧考妣 11.8212361103
+招婿 11.8212361103
+俞万春 13.900677652
+美亚 12.2912397395
+调度机 13.2075304714
+受检者 10.9049453784
+虚构性 13.900677652
+子汉 13.900677652
+本宫 11.2616203224
+支数 11.7034530746
+国家兴亡 10.8561552143
+若巨雷 13.2075304714
+舌端 13.900677652
+安度晚年 11.7034530746
+参看 10.2897597393
+雀斑 10.642581114
+胃痉挛 13.900677652
+五百五十余平方公里 13.2075304714
+晚归 12.1089181827
+眼罩 11.598092559
+邮票 9.26594866375
+登陆艇 9.6811699468
+拣选 11.0103058941
+子民 10.4666904475
+不孝之子 11.8212361103
+统购统销 11.0674643079
+躲避 7.89679058487
+圈儿 10.3171587135
+缺血性 10.7226238216
+占取 12.2912397395
+绘图笔 13.900677652
+相适应 7.79811905736
+美仑 12.1089181827
+书写纸 13.2075304714
+毁誉不一 12.8020653633
+佩奇制 13.900677652
+文化交流 8.40350942668
+腹板 11.2616203224
+深南光 13.900677652
+黄光 13.2075304714
+孙新入 12.8020653633
+晚岁 13.900677652
+崖城 13.900677652
+视听产品 13.900677652
+偿债基金 13.2075304714
+马剌丁 12.8020653633
+和家富 13.2075304714
+景云 11.3357282945
+黄公 12.1089181827
+初生儿 13.2075304714
+稻苞虫 13.900677652
+拉各斯 10.8096351986
+作派 10.9049453784
+景亦 13.2075304714
+学府 9.87532596124
+袁转 13.2075304714
+黝帘石 11.8212361103
+滞洪 11.1926274509
+敏锐地 10.4994802703
+应召东 12.8020653633
+辩证法 8.60236028543
+循法 13.900677652
+哈里法克斯 13.2075304714
+潜质 10.2371160058
+征丁 11.0674643079
+英美法 9.98865464655
+解释器 11.5027823792
+帝道 13.900677652
+见不得人 9.5186510173
+招妙 13.900677652
+手外科 12.1089181827
+第五十四 11.7034530746
+景仁 12.2912397395
+摩拉维亚 10.4349417492
+及于 10.8096351986
+福州市 9.58318953844
+茶艺 11.9547675029
+葱油鸡 13.900677652
+东环路 12.5143832909
+哲里木 12.8020653633
+曲沃县 12.8020653633
+捷足先登 10.8561552143
+明星脸 12.2912397395
+试乘 13.900677652
+戒坛院 13.2075304714
+抽样调查 9.75754292558
+哥伦比亚共和国 11.0103058941
+经典电影 12.5143832909
+戈特霍 12.5143832909
+四百二十二家 13.2075304714
+若有情 13.2075304714
+可兑换 10.8561552143
+湘赣 9.66657114738
+素月 13.2075304714
+絮状 11.5027823792
+景仰 10.1871055853
+泡澡 11.8212361103
+素有 7.85567233794
+非守不可 13.900677652
+一夕 10.5684731418
+柞蚕 9.59661255877
+洗选 11.598092559
+罗迈 13.900677652
+缴税 10.2117981979
+茶花 9.98865464655
+装甲车 8.6966709649
+三聚体 13.2075304714
+密不可分 9.62401153296
+蒙尚书 12.8020653633
+隆鼻术 13.2075304714
+试产 11.598092559
+贞元 9.44633035572
+白乃心 12.2912397395
+外班 12.5143832909
+罗迦 13.900677652
+管凤头 12.8020653633
+证书及 13.2075304714
+男女皆可 13.900677652
+焦景颜 12.2912397395
+如花似月 13.900677652
+滑溜 10.4994802703
+繁芜 13.2075304714
+滞涩 11.9547675029
+开动脑筋 11.5027823792
+草坪植物 13.2075304714
+农宜牧 12.8020653633
+雀替 13.2075304714
+黄册 11.0674643079
+应运而生 9.07236391467
+学年 10.604840786
+黄冈 10.1164880181
+试件 11.9547675029
+披毛犀 11.2616203224
+罗辉 13.900677652
+吊死鬼 10.8561552143
+第六天 11.0103058941
+藏好 11.3357282945
+黄军 12.2912397395
+藏奸 13.2075304714
+试以 11.8212361103
+孙冶经 13.900677652
+史重平 13.2075304714
+繁荣 6.8549010751
+市场动态 11.2616203224
+帝都 10.8096351986
+秦长城 11.2616203224
+收购者 11.598092559
+国之君 9.94943393339
+黄冠 12.1089181827
+中石化集团 10.9049453784
+英烈传 12.8020653633
+衍射图样 11.8212361103
+筷子 7.91422564669
+黄冶 12.8020653633
+陈君石 13.900677652
+吴有一 12.5143832909
+年秋冬 11.1926274509
+庄树旗 13.2075304714
+生长锥 13.900677652
+稻秧 13.2075304714
+未闻 10.4041700905
+石滩村 13.2075304714
+团结紧张 13.900677652
+前生 10.3171587135
+会演 10.9562386728
+相互信任 11.3357282945
+毛边纸 12.5143832909
+茶茶 12.8020653633
+郭象注 13.2075304714
+层楼 10.5684731418
+推不开 11.4157710022
+窃取 9.6811699468
+妥用 13.900677652
+学徒 9.30555780184
+六点钟 11.7034530746
+学得 9.45802639549
+江宁县 11.598092559
+纠举 11.5027823792
+黄健 13.2075304714
+谢尔兹 13.900677652
+织边 13.2075304714
+图报 10.9562386728
+繁花 10.642581114
+邮箱 9.96885201925
+渗透性 10.5684731418
+支柱 7.94225295895
+永乐宫 11.4157710022
+金刚胺 13.2075304714
+婺剧 11.8212361103
+赌客 11.0103058941
+多亿度 12.1089181827
+离子烫 13.900677652
+半推半就 10.9562386728
+子溢 13.2075304714
+征伐 8.85725253506
+焦思苦虑 12.5143832909
+子溥 12.1089181827
+繁苛 12.1089181827
+梅克夫人 13.2075304714
+检测线 13.2075304714
+回收站 12.2912397395
+日久郁 13.2075304714
+编目条例 12.2912397395
+试作 11.9547675029
+支枪 10.9562386728
+石亨见 13.2075304714
+热合 13.900677652
+占先 11.598092559
+占光 13.900677652
+民事权利 10.642581114
+贝齐 13.2075304714
+慌张张 12.5143832909
+富而思进 13.2075304714
+抱成一团 11.5027823792
+试住 12.5143832909
+怀隼础 13.2075304714
+支架 8.67493097826
+含英咀华 13.900677652
+密西根 12.1089181827
+个人见解 11.4157710022
+云南高原 10.2371160058
+敏度 12.8020653633
+涕零 13.2075304714
+占领国 12.5143832909
+中长铁路 12.8020653633
+绣起来 13.900677652
+制衡作用 13.900677652
+控制参数 13.900677652
+分给 8.25877058104
+社会工作 10.4994802703
+死狐狸 13.900677652
+邓张二 12.8020653633
+二十多岁 9.89334446674
+碳氢化合物 10.3171587135
+稳赚不赔 11.4157710022
+分化成 10.533381822
+征信 10.2117981979
+顿住 10.0505300503
+利顿 12.2912397395
+俗不可耐 12.2912397395
+浑然无知 13.900677652
+江宁区 10.9562386728
+支条 13.900677652
+企业主 9.20019728618
+脱胎 9.82314020807
+作法 8.9308643524
+苗圃 10.4349417492
+白乃庙 12.5143832909
+菱湖 12.2912397395
+子游 13.2075304714
+克莱斯勒 9.48183704418
+条贯 13.2075304714
+游艺场 11.9547675029
+人鱼 10.2897597393
+该种 9.72629038208
+邮筒 11.4157710022
+疾雷 13.2075304714
+如花似朵 13.900677652
+帝释 12.8020653633
+王与马 12.5143832909
+织轴 12.5143832909
+纪诚 13.2075304714
+沉得住气 10.4041700905
+罗契得 12.5143832909
+油渍 11.7034530746
+苗圩 12.8020653633
+第一一九回 12.8020653633
+涉枪 13.900677652
+记挂着 9.94943393339
+梁门 13.2075304714
+子渊 12.8020653633
+浊度 12.8020653633
+核准制 11.1280889297
+旋风式 13.900677652
+飞檐翘角 12.5143832909
+好几百年 13.900677652
+救济款 11.598092559
+织袜 11.9547675029
+了身达命 12.5143832909
+单眼 9.87532596124
+那珍 13.2075304714
+找路 10.642581114
+诺亚 13.2075304714
+从左往右 12.5143832909
+核医学 11.8212361103
+加尔铁 13.900677652
+冯保家 12.8020653633
+科普兰 13.900677652
+珍稀 8.81927328699
+裘卫四 12.5143832909
+总览 13.900677652
+唐古拉山 9.41204128224
+眼窝 8.95903522937
+数组名 13.2075304714
+全真道士 12.2912397395
+坎托 11.598092559
+罗西 11.0103058941
+信息业 13.2075304714
+舌缘 13.900677652
+亚洲版 13.2075304714
+苗傅 11.8212361103
+丹术 13.2075304714
+王朝闻 12.2912397395
+毛鹤 13.2075304714
+奥狄氏 12.8020653633
+黄土 7.89679058487
+招待 8.56313957227
+视频文件 13.900677652
+孝感市 10.9049453784
+学士 8.02574692112
+帝陵 10.2117981979
+白马河 13.2075304714
+一点点 7.96314144689
+阿尔瓦雷 11.5027823792
+己二酸 10.2897597393
+鹊桥会 12.8020653633
+连环画 10.4994802703
+国之力 13.2075304714
+洗雪 11.7034530746
+厚谢 13.2075304714
+唐至德 11.2616203224
+送花 11.598092559
+红景天 13.2075304714
+唐俊生 10.604840786
+砀山 10.0088573539
+阿玛雅 13.900677652
+八日下午 12.8020653633
+永济市 12.2912397395
+躲闪 9.08039608637
+圣安娜 11.7034530746
+同志会 10.4349417492
+弄来 9.6811699468
+招录 10.3743171274
+宿疾 12.8020653633
+德裔瑞士 13.2075304714
+氧分子 11.598092559
+反清复明 11.3357282945
+昌江县 11.8212361103
+找起 12.5143832909
+人鬼 11.1280889297
+乘除 11.5027823792
+插班生 13.2075304714
+指挥组 11.0674643079
+机械工业部 10.533381822
+己二醇 13.2075304714
+黄埔 9.33632946051
+丁银均 12.8020653633
+滑梯 11.1280889297
+藏式 11.598092559
+磷酸铵 13.900677652
+金丹派 12.5143832909
+颜色 6.49457427074
+金大定 10.5684731418
+赌局 13.2075304714
+听雷 12.1089181827
+子楚 13.900677652
+难上加难 10.9049453784
+开塞露 13.2075304714
+二十多家 13.2075304714
+学堂 8.0600359946
+名人坊 13.900677652
+餐厅 8.40761620864
+颜良 10.4666904475
+一点五万 12.8020653633
+丹枫 12.8020653633
+水牛角 13.2075304714
+招引 10.2117981979
+招弟 10.2630914922
+磷酸钙 11.0103058941
+学塾 11.7034530746
+吉川幸次 12.8020653633
+暴利税 11.8212361103
+生活报 11.4157710022
+晚婚 12.1089181827
+山桐子 13.900677652
+招式 11.5027823792
+古尔维 12.8020653633
+停不下来 11.4157710022
+年收 12.2912397395
+窃听 9.61021821083
+马俊仁 12.8020653633
+占领军 10.1394775363
+泛出来 13.2075304714
+织补 13.2075304714
+磷酸钠 12.8020653633
+强行通过 12.2912397395
+万儿八千 13.2075304714
+小红旗 11.0103058941
+一好 11.1280889297
+亨利四世 10.533381822
+丹林 13.2075304714
+葱油饼 13.900677652
+纳雷王 13.2075304714
+播迁 10.8096351986
+晚安 11.2616203224
+供不应求 8.77671367257
+创业精神 11.4157710022
+聚丁二烯 11.598092559
+餐券 13.900677652
+生存率 11.1280889297
+帽儿 10.9562386728
+占地 8.14493543839
+委决不下 11.3357282945
+石星 13.2075304714
+拐入 11.7034530746
+司法院长 13.900677652
+比热戈斯 13.900677652
+汉和帝 11.7034530746
+后果严重 11.1280889297
+送菜 11.598092559
+恰恰 7.46934657004
+罗衣 12.1089181827
+宋郭茂 13.2075304714
+门牌号 11.9547675029
+米丽雅 13.2075304714
+昆廷 13.900677652
+罗衫 11.1280889297
+穷小子 11.2616203224
+无任 11.8212361103
+哼起来 13.2075304714
+米提利 12.5143832909
+餐刀 12.8020653633
+埃达鲁 13.900677652
+柞丝 13.900677652
+迷恋着 12.2912397395
+晚宴 9.85762638414
+跳舞毯 13.900677652
+子棉 13.900677652
+没趣儿 11.8212361103
+四十一个 13.2075304714
+闲荡 12.2912397395
+支曲儿 12.2912397395
+有恒 12.8020653633
+贝尔纳斯 12.5143832909
+黄嘉 13.900677652
+合成体 13.900677652
+岩溶地貌 11.2616203224
+过高 7.49544919394
+饿惯 13.900677652
+孙权览 12.8020653633
+窃喜 10.642581114
+磷酸锌 13.2075304714
+单克隆 11.0103058941
+移居者 11.7034530746
+黑布老者 12.8020653633
+模具钢 12.2912397395
+第六度 13.2075304714
+名牌货 13.900677652
+学姐 13.900677652
+天河 9.37888907493
+三年级 10.4041700905
+拨用 13.2075304714
+山北坡 10.8561552143
+平原郡 12.8020653633
+叶苔草 12.5143832909
+浣溪沙 12.1089181827
+活性部位 11.9547675029
+余公里 9.0884932966
+维奥蒂 12.8020653633
+白莱 12.5143832909
+火山湖 11.9547675029
+拐出 12.1089181827
+请勿打扰 13.900677652
+耍态度 13.2075304714
+第六年 11.7034530746
+光绪帝 9.12999302751
+亡魂丧胆 12.8020653633
+火工品 11.8212361103
+长阳县 12.8020653633
+莫拉布 13.2075304714
+内容梗概 13.900677652
+双边贸易 10.0505300503
+计穷力竭 12.8020653633
+罗裙 11.1280889297
+暴突 11.9547675029
+子桓 12.5143832909
+越葱岭 11.9547675029
+梅特涅 11.5027823792
+德清县 11.3357282945
+藏布 9.89334446674
+第六幕 12.5143832909
+送药 11.0674643079
+苗兵 12.8020653633
+黄国 12.1089181827
+罗裳 12.8020653633
+拒谏饰非 12.8020653633
+武宗皇帝 10.8561552143
+争求 12.8020653633
+库尔勒市 11.5027823792
+人马 5.98204899863
+时间推移 10.3171587135
+杭州市委 13.900677652
+子样 13.2075304714
+诸神执 13.900677652
+甘油三脂 11.9547675029
+子核 11.598092559
+教师队伍 12.2912397395
+滑槽 13.2075304714
+学好 10.0505300503
+开路神 12.5143832909
+电泳槽 13.2075304714
+怡情悦性 13.900677652
+虫白蜡 12.5143832909
+孟德斯鸠 10.4666904475
+参展 8.68574189437
+综上所述 9.01032852375
+同盟国 9.01032852375
+子树 11.8212361103
+过驳 11.8212361103
+洗面 10.765183436
+周拔贡 12.5143832909
+欸乃 13.900677652
+海菊蛤 12.2912397395
+占城 10.4666904475
+空中摄影 11.8212361103
+短路器 13.2075304714
+萧宝融 13.2075304714
+武家诸 12.8020653633
+苗儿 11.8212361103
+扬子江 10.4994802703
+第五十六 12.8020653633
+第五十八 12.2912397395
+邱茂华 12.8020653633
+清帝逊 13.2075304714
+磨人 12.8020653633
+小红本 12.1089181827
+装坛 13.900677652
+防卫过当 12.5143832909
+亿桶 9.84023464143
+保时捷 10.2897597393
+晚境 12.8020653633
+慢车道 10.3171587135
+大陆型 11.598092559
+萨科夫 13.2075304714
+支招 10.2117981979
+衰歇 12.2912397395
+表形 12.8020653633
+英国法 11.9547675029
+捕鲸 10.3743171274
+病毒破坏 13.2075304714
+万一会 12.1089181827
+支拨 13.900677652
+克丽西 13.2075304714
+芽苞 13.2075304714
+缴纳 7.76945116249
+桑诸羌 13.2075304714
+滨海省 13.900677652
+藕荷色 11.9547675029
+二十多天 10.4994802703
+穿衣戴帽 11.9547675029
+阿塞拜疆人 11.7034530746
+招工 9.77354326693
+火牛阵 12.8020653633
+金流 12.5143832909
+翻毛 11.9547675029
+子母 9.94943393339
+思想活跃 11.9547675029
+声频 10.642581114
+报喜鸟 10.7226238216
+亿根 12.8020653633
+定活两便 13.900677652
+除病 11.598092559
+封文王子 13.2075304714
+糊状物 13.2075304714
+极乐世界 10.8561552143
+傍晚时候 11.8212361103
+古长江 11.9547675029
+送股 10.6818018271
+找辙 13.900677652
+桃花源 10.4349417492
+老君炉 12.2912397395
+果真会 13.900677652
+支护 10.4994802703
+立秋 10.3743171274
+亚欧 11.0103058941
+宫殿式 11.4157710022
+冰雪严寒 12.8020653633
+邓柯 11.8212361103
+萨利克 12.1089181827
+勋伯格 12.1089181827
+廖山涛 13.2075304714
+白马湖 12.5143832909
+罗雅各 12.8020653633
+邹哲开 13.900677652
+载人 8.9308643524
+富绶 11.3357282945
+未遭 11.1280889297
+老世伯 11.9547675029
+贝拉斯克斯 13.2075304714
+支托 13.2075304714
+股票软件 12.2912397395
+探囊取物 11.3357282945
+总领馆 11.0674643079
+菜圃 12.2912397395
+富绅 11.7034530746
+都市女性 11.9547675029
+指挥系 13.900677652
+小鱼儿 13.2075304714
+三洞 10.6818018271
+随着 4.63983429783
+支承 9.36807815882
+弓和箭 13.2075304714
+向日葵 9.40086798165
+肯尼亚政府 13.2075304714
+一言蔽之 13.900677652
+佳构 12.2912397395
+案发地点 12.2912397395
+未遂 9.91169360541
+第七十二回 12.2912397395
+帕邢系 13.900677652
+薛万备 13.2075304714
+烧灼感 11.1280889297
+宫嫔妃 13.900677652
+随眠 13.900677652
+城镇人口 9.7898037878
+甘恩 12.8020653633
+公平 7.16134102462
+锌元素 12.2912397395
+行大运 12.8020653633
+访客 11.8212361103
+许天 13.2075304714
+布衲 13.900677652
+有识之士 10.1394775363
+喜不自禁 11.1926274509
+未通 12.2912397395
+安塔拉 11.9547675029
+三洋 9.31571017331
+牛郎织女 10.6818018271
+马蛋果 13.900677652
+赌帐 13.900677652
+暴秦 13.900677652
+大陆坡 10.533381822
+未退 11.5027823792
+泡泡 10.0294766411
+阎宇 13.2075304714
+采伐量 11.5027823792
+轧平 13.900677652
+乘用车 8.57280148319
+学家 8.62256299275
+反退 13.900677652
+帕多瓦 10.8561552143
+回弹性 12.8020653633
+封思北 13.2075304714
+纸牌儿 13.2075304714
+查剌阿 13.2075304714
+边境县 11.8212361103
+学宫 10.6818018271
+夏皮尔 12.5143832909
+云间 11.2616203224
+干漆 12.8020653633
+戴宗见 13.2075304714
+拐卖 11.2616203224
+条规 11.3357282945
+落后状况 11.8212361103
+袁侍郎 13.900677652
+铝粉 12.1089181827
+王凤池 11.5027823792
+税官 11.9547675029
+送至 9.75754292558
+高强度 8.9519177616
+奶奶家 12.1089181827
+望女成 13.900677652
+变速箱 8.34384959028
+眼福 11.598092559
+支援 7.08613475472
+代理处 12.2912397395
+卡比 13.2075304714
+瞿鸿 9.98865464655
+纺织机 11.598092559
+枣庄市 11.598092559
+俞汝捷 12.8020653633
+金佛山 11.7034530746
+鸽派 12.8020653633
+相思子 12.1089181827
+夫唱妇随 12.1089181827
+网络传媒 13.900677652
+帝镇 11.7034530746
+和壁儿 12.1089181827
+滑步 12.2912397395
+潜血 12.1089181827
+过路人 10.765183436
+潜行 10.7226238216
+作案 9.19114745066
+化学剥蚀 12.5143832909
+呼拉尔 12.1089181827
+赵弘殷 13.2075304714
+王力宏 13.900677652
+排起来 13.2075304714
+载体 8.28390655431
+眼科 8.0600359946
+厘订 11.598092559
+责任意识 10.2897597393
+三派 11.3357282945
+风水先生 10.8096351986
+易释文 13.2075304714
+灵渠 10.3171587135
+游艺厅 13.2075304714
+赌徒 9.85762638414
+油苗 13.900677652
+斯泰因 11.598092559
+高灵敏 13.2075304714
+躲雨 11.598092559
+科普利 10.8561552143
+佚名 10.1164880181
+柴油机油 13.900677652
+五百五十万两 13.2075304714
+贾水儿 12.8020653633
+招展 9.94943393339
+国陆军 12.8020653633
+赌彩 13.900677652
+新东家 11.1280889297
+债务国 10.9562386728
+变通办法 13.900677652
+珍禽 10.0720362555
+清镇市 13.900677652
+大彻大悟 12.1089181827
+邮编 10.8561552143
+搭上去 12.1089181827
+数码科技 13.2075304714
+参照 7.84389363875
+富翁 9.63799777493
+粮食部门 13.900677652
+秦可卿 12.2912397395
+专线电话 12.8020653633
+阿依达 13.900677652
+作梦 11.3357282945
+第六届 8.66423568915
+赖小子 11.8212361103
+值得 6.01760830067
+响器 11.1926274509
+卸责 13.900677652
+管理课 13.2075304714
+第六层 11.9547675029
+黄哲 12.2912397395
+知识点 12.5143832909
+芽茶 11.598092559
+拐去 13.2075304714
+支持 5.07702970278
+一百七十年 13.2075304714
+乌瓦白 13.900677652
+学学 9.96885201925
+盖起来 10.7226238216
+瞿麦 12.8020653633
+项目分析 12.5143832909
+输气管 11.8212361103
+学子 9.87532596124
+龙章凤 12.8020653633
+眼神 7.6604018068
+周书补 12.8020653633
+生长量 12.1089181827
+强奸罪 11.0674643079
+轨范 13.900677652
+随笔集 12.1089181827
+仅能 9.31571017331
+司法部门 10.1630080337
+于富贵 13.900677652
+巡防 9.43476953332
+经理 5.85125059487
+崖刻 12.8020653633
+瞒来瞒去 12.8020653633
+转出去 13.900677652
+国内外 6.80395627348
+子时 10.8096351986
+金耳环 11.5027823792
+诺维奇 11.1280889297
+甘思 11.7034530746
+布哈里 11.9547675029
+接收者 11.8212361103
+蟠螭 11.4157710022
+不长进 11.0103058941
+美国哥伦比亚大学 10.2897597393
+管朝珠 13.2075304714
+眼皮 8.45825994145
+黄字 12.8020653633
+观战者 13.2075304714
+第六句 13.2075304714
+黄子 11.7034530746
+出乎意外 10.7226238216
+防弹服 12.5143832909
+藏历 11.1926274509
+竹扉 12.8020653633
+尤加利树 13.2075304714
+新创意 13.900677652
+姚宏校 12.8020653633
+紧随 9.33632946051
+荡荡悠悠 12.8020653633
+纾忧 13.900677652
+纳加尔 13.900677652
+一师 10.0720362555
+轧光 12.1089181827
+灵巧型 13.900677652
+伏龙芝 11.598092559
+萨德弥 13.2075304714
+韩战 12.2912397395
+盛到 13.2075304714
+鸽房 13.900677652
+子方 10.6818018271
+二十多块 12.8020653633
+无名英雄 11.7034530746
+声障 12.8020653633
+无涯 11.9547675029
+支沟 11.4157710022
+古尔特 12.8020653633
+出国人员 12.2912397395
+司马德 12.5143832909
+眼目 9.98865464655
+饮食起居 10.8096351986
+蚕子 13.900677652
+相若 11.7034530746
+无纸化 11.3357282945
+房屋中介 11.5027823792
+拨给 9.62401153296
+蒋方良 13.900677652
+宽阔无边 13.900677652
+香草美人 13.2075304714
+过来人 10.3171587135
+苗岭 10.2117981979
+网络商城 12.5143832909
+茶行 9.72629038208
+涉水 9.12155415886
+子文 12.5143832909
+皮之不存 11.9547675029
+呻吟声 11.4157710022
+劳太后 13.2075304714
+垂涎三尺 11.0674643079
+波尔顿 13.2075304714
+中央财经 9.24671730182
+欺侮 9.27570483869
+邓析 12.5143832909
+转文 13.900677652
+欣欣向荣 10.2117981979
+费力劳心 13.900677652
+赵秉文 11.4157710022
+第六卷 10.4041700905
+藏匿 9.55687223012
+郝振基 13.2075304714
+法罗斯 11.9547675029
+藏区 10.604840786
+虫眼 13.2075304714
+岛根县 13.2075304714
+算器 13.2075304714
+时执金 12.8020653633
+子敬 10.1394775363
+忙迫 13.900677652
+马克思列宁主义 9.25628675283
+苟从 13.900677652
+税名 13.2075304714
+税后 9.04086524761
+税吏 11.2616203224
+金钗石 13.2075304714
+青仁乌 13.2075304714
+茶袋 13.900677652
+耕作业 10.8096351986
+版画 9.40086798165
+梅瑞狄 13.2075304714
+活字印刷 10.7226238216
+多种手段 11.4157710022
+藏北 9.72629038208
+第六十 12.1089181827
+清吏司 11.1926274509
+罗藻 12.5143832909
+门户开放 11.3357282945
+黄宏 13.2075304714
+红旗谱 11.2616203224
+双箭齐 13.2075304714
+好时光 11.3357282945
+眼白 10.8096351986
+景献羊 13.2075304714
+子政 11.8212361103
+人面 9.38981814546
+随礼 13.2075304714
+理论知识 11.2616203224
+百多年 12.5143832909
+黄宗 11.4157710022
+赌债 12.8020653633
+藏印 10.9049453784
+樟树镇 12.1089181827
+谋定 13.900677652
+元天历 11.598092559
+学员 9.0884932966
+崖崩 12.5143832909
+金寨县 11.7034530746
+学呀 13.900677652
+黄宽 13.2075304714
+分配关系 10.1630080337
+三朝元老 11.3357282945
+黄家 11.0103058941
+觉解 13.900677652
+奥迪牌 13.900677652
+段大功 12.8020653633
+无涉 10.9562386728
+眼瞳 11.8212361103
+送过 10.604840786
+黄婆 11.7034530746
+招募 7.97642185456
+信息时代 11.1280889297
+殷代 10.5684731418
+送进 8.69119149913
+黄坡 13.2075304714
+中道 9.61021821083
+亿条 11.9547675029
+检束 13.2075304714
+声音 5.32182508017
+悬揣 13.2075304714
+政治情报 13.900677652
+宗白华 12.5143832909
+声韵 10.1630080337
+鲜明性 13.2075304714
+由孝文 12.2912397395
+茶褐 11.8212361103
+眼瞅 9.32596667347
+厚腻 10.9562386728
+眼瞎 10.9562386728
+黄婷 13.2075304714
+刘步蟾 10.2117981979
+缺一不可 10.1394775363
+于少阳 13.900677652
+戴松恩 13.2075304714
+招办 10.2117981979
+好好 6.50189137656
+发窘 10.7226238216
+黄娜 10.1871055853
+太原理工 11.0674643079
+征敛无度 12.5143832909
+接风 9.54396882529
+颜辉 13.2075304714
+马默德 13.2075304714
+宗乾道 12.8020653633
+开户者 13.2075304714
+袁营 11.598092559
+排球场 12.8020653633
+五分之二 11.4157710022
+美国有线电视新闻网 11.9547675029
+臧晋叔 12.8020653633
+占领市场 10.9562386728
+罗萨 11.7034530746
+钢材网 13.900677652
+消费水平 9.6811699468
+萧长华 11.598092559
+黑体字 12.8020653633
+风雪帽 13.900677652
+崖岸 12.2912397395
+送达 9.21854642485
+眼眶 8.62256299275
+五成新 13.900677652
+海北藏族自治州 12.1089181827
+眼眵 13.900677652
+深表遗憾 13.2075304714
+根河市 13.900677652
+伊瓜苏 11.598092559
+眼眸 11.598092559
+舌状 11.2616203224
+赌具 12.5143832909
+欺人 10.3743171274
+人阵 12.1089181827
+十三站 12.8020653633
+乌德丁 12.8020653633
+人防 10.642581114
+张佳胤 10.4994802703
+招徕 9.72629038208
+保障制度 10.3171587135
+一幅 7.68606955355
+头脑冷静 12.1089181827
+藏刀 11.4157710022
+展愁眉 13.2075304714
+种子法 12.5143832909
+晚场 13.2075304714
+话语 8.85082164473
+午间 9.30555780184
+牢靠 9.84023464143
+眼看 7.01926634833
+大多数 6.15784169655
+梅萨 12.8020653633
+白衣天使 12.2912397395
+罗蒂 13.900677652
+古尔班 12.5143832909
+计划供应 13.2075304714
+繁衍 8.56795885871
+昂头挺胸 13.900677652
+张琪玉 13.2075304714
+紧靠 9.45802639549
+扎尔 10.8561552143
+罗蒙 12.2912397395
+罗塔岛 13.2075304714
+不惜重金 11.7034530746
+招到 10.4994802703
+作曲 8.78268383956
+高雄市 10.765183436
+第一百零六回 13.900677652
+眼睑 9.21854642485
+乙丑日 13.900677652
+人际 10.3743171274
+五分之一 9.69598503258
+暴盲 12.1089181827
+眼睛 5.13366003066
+支派 9.85762638414
+两间房 11.7034530746
+饿汉 13.2075304714
+党营 13.2075304714
+四十周年 13.2075304714
+喷油器 13.2075304714
+萨德勒 12.2912397395
+入出境 13.2075304714
+回收率 11.0103058941
+李向阳 12.1089181827
+凤爪 11.2616203224
+举手表决 12.5143832909
+讣文 13.900677652
+辛弃疾 10.1164880181
+继任 8.58255765813
+丹楹 13.900677652
+斯瓦 11.598092559
+皮特凯恩群岛 13.900677652
+淙淙流水 13.2075304714
+肿物 10.642581114
+绘图纸 13.2075304714
+总枢纽 12.1089181827
+南来顺 11.8212361103
+黄奕 12.2912397395
+全校学生 12.2912397395
+宝通寺 11.2616203224
+富特 11.598092559
+顺治帝 10.4666904475
+洁白如玉 12.2912397395
+冻结深度 12.5143832909
+金莲 9.30555780184
+招出 11.598092559
+窑灶 13.900677652
+强奸犯 12.5143832909
+粮人 13.900677652
+藏军 13.2075304714
+五氧化二磷 12.5143832909
+黄奴 13.2075304714
+齐相 12.1089181827
+岁贡 11.1280889297
+伏龙肝 12.8020653633
+秦朗 13.2075304714
+吴承瑛 13.900677652
+招军 11.8212361103
+依旧会 10.8096351986
+方成培 13.2075304714
+苗床 13.2075304714
+田信秀 13.2075304714
+辱骂 9.32596667347
+拐带 11.598092559
+比亚里茨 13.2075304714
+子枪 13.2075304714
+丹服 13.900677652
+粮仓 9.01787572939
+学园 11.5027823792
+贞妇 13.900677652
+过闷 12.8020653633
+京畿道 11.598092559
+三十三个 11.598092559
+作数 12.2912397395
+黄天 11.8212361103
+去年末 11.0103058941
+衰朽 12.5143832909
+以民为本 11.7034530746
+胡冲 13.900677652
+四五路 12.5143832909
+过问 8.76487921493
+桃花村 11.9547675029
+反共抗俄 13.900677652
+过门 9.34680076038
+于庆历 12.8020653633
+子杰 10.7226238216
+肖玲坐 12.8020653633
+格雷果 12.5143832909
+从永平 11.9547675029
+扮着 13.900677652
+坎波 13.2075304714
+子板 11.2616203224
+过错 8.77671367257
+作料 10.4994802703
+作文 9.27570483869
+黄姜 12.8020653633
+子来 10.1871055853
+肿瘤科 13.2075304714
+子杨 12.5143832909
+作歹 13.2075304714
+接受命令 12.1089181827
+暴疾 12.1089181827
+几角 12.8020653633
+潜滋暗长 13.900677652
+招兵 10.8561552143
+削株掘根 13.2075304714
+健身车 13.2075304714
+贞女 12.2912397395
+王生下 13.2075304714
+崭新面貌 11.8212361103
+眼球 7.84858848305
+预算书 13.900677652
+修修补补 11.5027823792
+继之 9.34680076038
+气势恢宏 11.7034530746
+仅足 13.900677652
+子朱 11.9547675029
+屈指一算 13.900677652
+叩头虫 12.2912397395
+反过来 7.79143006921
+和晶格 12.8020653633
+藏入 11.598092559
+泥脚 12.1089181827
+餐巾 11.7034530746
+烤面包片 13.900677652
+吕氏春秋 9.71102290995
+找茬 12.1089181827
+泰山 8.30969067146
+雷火焚 11.9547675029
+防护门 13.900677652
+子未 13.900677652
+潜藏 10.1394775363
+子木 12.8020653633
+暴病 10.642581114
+帮不上 10.8096351986
+钦慕 11.4157710022
+磁方位 13.900677652
+宁古塔 10.533381822
+王力嘉 13.2075304714
+过长 8.85725253506
+招儿 10.9562386728
+维希 10.3743171274
+转换期 12.2912397395
+支渠 11.7034530746
+码头工人 11.9547675029
+描了 13.2075304714
+赤铁矿 9.96885201925
+学而不思 13.900677652
+十五支 13.900677652
+无家可归者 12.2912397395
+子曲 13.2075304714
+萨耶赫 13.900677652
+中国羽毛球队 13.900677652
+花子 10.0505300503
+眼疾 10.6818018271
+罗虎 8.56795885871
+国际玉米小麦改良中心 13.2075304714
+窃密 12.1089181827
+时机成熟 10.0505300503
+边旁 13.900677652
+油舱 12.8020653633
+水调歌头 11.4157710022
+灵石 11.7034530746
+二十多名 11.8212361103
+双屏幕 12.5143832909
+千伏安 13.2075304714
+酒色财气 12.8020653633
+坏水 11.4157710022
+懵里懵懂 11.8212361103
+保障机制 10.642581114
+八十八年 13.900677652
+恩恩怨怨 11.4157710022
+新民晚报 11.3357282945
+丹桂 11.0674643079
+赌友 13.2075304714
+肯尼亚山 11.9547675029
+生米 11.3357282945
+扮相 11.598092559
+砌成 9.35738286971
+女士们 10.7226238216
+声门 11.5027823792
+轧制 10.4349417492
+送粪 11.8212361103
+杨朔 12.8020653633
+受灾人口 11.598092559
+藏僧 13.900677652
+胃壁 11.0674643079
+滑板 11.4157710022
+擦下来 13.900677652
+亿支 11.5027823792
+税基 10.6818018271
+喜结连理 13.900677652
+加九锡 10.9562386728
+紧闭 8.35941410682
+股票投资 8.61747392324
+拐弯 9.26594866375
+母慈子 13.900677652
+护驾 9.66657114738
+攀缘植物 12.2912397395
+问政于民 12.5143832909
+南奥塞梯 12.8020653633
+王改信 13.2075304714
+结构限制 12.8020653633
+平衡力 12.5143832909
+赵孟頫 10.533381822
+眼病 9.80633308975
+武昭仪 11.8212361103
+滑杆 13.900677652
+会同县 11.3357282945
+韦尼勒 13.900677652
+沸热 13.900677652
+彭泽令 12.2912397395
+亚热带 6.76897914151
+矽质 13.2075304714
+神策门 13.2075304714
+秋庄稼 10.4994802703
+笕桥 12.5143832909
+参将 9.20019728618
+晚唐 9.49395840471
+逻辑推理 10.4349417492
+萧萧 9.71102290995
+滑枕 12.8020653633
+黄士 13.2075304714
+舌炎 12.8020653633
+眼生 11.5027823792
+黄壤 9.31571017331
+天地诛灭 13.2075304714
+去邪归正 11.8212361103
+送走 8.42421410004
+后甲板 11.4157710022
+紧锁 9.82314020807
+封周王 13.2075304714
+集粹 13.2075304714
+子晋 12.8020653633
+继位 7.85330547293
+溜过来 13.900677652
+赌博 8.2273543848
+古圣贤 11.9547675029
+空和尚 10.9049453784
+堡垒作用 12.2912397395
+患部 11.3357282945
+亿方 12.8020653633
+山南地区 11.1280889297
+押运员 12.8020653633
+顺路来 12.2912397395
+风俗画 10.0294766411
+靠窗户 12.1089181827
+陆子网 12.8020653633
+子春 13.2075304714
+一度 6.19092078752
+初生壁 11.9547675029
+亿斤 10.0088573539
+葬身大海 12.5143832909
+财务检查 12.5143832909
+一座 6.11620441624
+那双明 13.900677652
+科廊 10.1871055853
+成祖北 12.5143832909
+送货 9.85762638414
+子昕 13.2075304714
+潘及丹 12.8020653633
+彭总停 12.2912397395
+共产党人 8.50251495046
+子星 11.2616203224
+击节称赏 12.2912397395
+子昂 12.1089181827
+一两二两 13.2075304714
+薄幸郎 13.900677652
+眼界 9.14708746087
+子明 9.93038573842
+茶话 13.2075304714
+子昌 11.9547675029
+同仇敌忾 10.533381822
+歌剧舞剧院 11.8212361103
+引以自豪 11.5027823792
+中国科学技术协会 11.1926274509
+晕机 13.900677652
+宣召皇 13.900677652
+穷光蛋 10.3743171274
+瞻情顾意 13.900677652
+涉案 8.78268383956
+但求 10.2117981979
+路经略 11.5027823792
+珍爱 10.2630914922
+池北偶 13.2075304714
+巴札尔 12.8020653633
+宏观调控 7.71859274526
+面有菜色 12.8020653633
+厚葬 10.2117981979
+无用论 12.8020653633
+第二十三条 12.1089181827
+瞿镛 13.900677652
+类义词 13.2075304714
+基本面 6.46878573517
+八万九千元 13.2075304714
+面相 9.91169360541
+面黄饥瘦 12.1089181827
+打扫战场 11.5027823792
+曹尚书 13.2075304714
+岳武穆 11.0103058941
+肠肝循环 13.900677652
+凌云渡 12.1089181827
+支棱 11.7034530746
+乌错 12.1089181827
+浑身是劲 12.8020653633
+寄上 13.2075304714
+米诺斯 10.5684731418
+亿户 10.4041700905
+物流园区 11.1280889297
+珍物 11.598092559
+戕害 10.8096351986
+古尔登 12.1089181827
+氧分压 11.5027823792
+陈老先生 11.9547675029
+坏死 8.75901409547
+衙门作风 13.2075304714
+卖字 12.8020653633
+学僧 12.5143832909
+两部委 11.9547675029
+一买 10.8561552143
+科学杂志 12.5143832909
+诵读 9.85762638414
+六连冠 13.900677652
+襟抱 11.7034530746
+嘉禾 10.4994802703
+素数 9.65218240993
+贞德 10.604840786
+赌咒 10.6818018271
+寄主 9.32596667347
+三言两语 10.1871055853
+袁脸 11.1926274509
+七八趟 13.2075304714
+呼拉圈 13.2075304714
+轻金属 11.598092559
+符玺郎 13.2075304714
+沈明仁 13.900677652
+恰如其分 10.4041700905
+判断者 13.2075304714
+不规矩 13.2075304714
+吃粉笔灰 13.900677652
+退潮 9.36807815882
+尊处 13.2075304714
+士仁 12.8020653633
+孔融谏 13.2075304714
+尥蹶子 12.1089181827
+深文周纳 13.2075304714
+鲜红色 10.2630914922
+加尧姆 13.900677652
+餐室 11.2616203224
+力能扛鼎 12.8020653633
+来样加工 13.900677652
+亏损企业 9.94943393339
+敖闰之 12.8020653633
+那葛 13.900677652
+向健妇 12.5143832909
+鱼唇 13.2075304714
+刘太尉 11.598092559
+判乱 13.900677652
+黄忠 9.62401153296
+子拴 13.900677652
+罗致 11.2616203224
+解盟 13.900677652
+通讯器材 11.2616203224
+萨利安 13.900677652
+藏匿于 13.2075304714
+晚到 11.0103058941
+寄于 12.2912397395
+余公顷 10.6818018271
+第六场 13.900677652
+公辅之 13.2075304714
+空壳子 12.5143832909
+金校慰 12.5143832909
+周思聪 12.2912397395
+湔洗 13.900677652
+解决不了 9.5062284973
+抛砖引玉 11.5027823792
+闻声齐 13.900677652
+从涌泉 13.900677652
+诸将军 11.7034530746
+漫无 11.5027823792
+占廷 8.38322475551
+马公市 12.1089181827
+黄得 11.8212361103
+彻底解决 9.36807815882
+反面教员 12.8020653633
+糜烂面 12.5143832909
+共同海损 11.598092559
+您猜 13.2075304714
+王爱玛 13.2075304714
+寄交 13.900677652
+军官 6.95082119697
+塔胡穆 13.2075304714
+李兆基 12.1089181827
+二十多只 12.5143832909
+发动机舱 11.0674643079
+国之威 13.900677652
+二十多口 13.2075304714
+黄德 11.7034530746
+初见成效 11.0103058941
+电池厂 12.5143832909
+西双版纳州 13.2075304714
+崖壁 9.65218240993
+三角恋爱 12.1089181827
+作成 9.34680076038
+薄氏 12.8020653633
+茶质 12.8020653633
+成君之 13.2075304714
+聂卫平 12.8020653633
+作战 5.65686922831
+山北开 13.2075304714
+子惠 13.2075304714
+斑蝥 13.900677652
+作戏 11.3357282945
+第六团 13.900677652
+送话 12.8020653633
+罗聘 12.2912397395
+谋臣武将 13.900677652
+哈得逊 13.2075304714
+第六回 11.7034530746
+美纽斯 11.4157710022
+粗细 8.56795885871
+宣之于 13.2075304714
+学农 11.8212361103
+黄幡 13.2075304714
+有价证券 9.08039608637
+装修工 13.900677652
+整改措施 11.5027823792
+药理 9.96885201925
+不相干 9.12155415886
+陈友仁 13.2075304714
+妇幼用品 13.900677652
+黄平 13.900677652
+丹湖 9.63799777493
+袁老 11.9547675029
+袁耀 13.2075304714
+居间人 11.8212361103
+包小包 10.9562386728
+暴牙 13.2075304714
+中联重科 9.65218240993
+傻瓜式 12.5143832909
+屹立 9.58318953844
+汪自新 12.5143832909
+占星术 10.9562386728
+崖墓 10.604840786
+富甲 12.1089181827
+眼珠 8.9519177616
+闪铄 13.2075304714
+检测点 13.900677652
+钢丝圈 13.2075304714
+茶资 12.8020653633
+心胸狭隘 13.2075304714
+孙权至 12.8020653633
+必有近忧 11.8212361103
+二万五千里长征 11.3357282945
+北方四岛 13.900677652
+罗耶 12.8020653633
+黄帽 12.8020653633
+吐舌 11.7034530746
+学龄儿童 11.1280889297
+满天世界 13.900677652
+日耳曼语 10.9562386728
+霍尔瓦特 13.2075304714
+王重民 11.9547675029
+非此即彼 11.5027823792
+南卡罗来纳 11.7034530746
+珍玩 11.1280889297
+软兜 13.900677652
+拳王 10.4666904475
+胡赖 13.2075304714
+公路网 9.27570483869
+患难 9.54396882529
+美化环境 11.0103058941
+严密掌握 12.5143832909
+子息 12.1089181827
+子恒 12.5143832909
+诸多 7.02751381776
+长生果 11.9547675029
+肿痛 9.6811699468
+约书亚 13.2075304714
+絮絮 11.8212361103
+露体 13.900677652
+吴之策 13.2075304714
+寄信 11.7034530746
+向北朝 12.8020653633
+宣之世 13.2075304714
+讲述者 11.5027823792
+占得 11.4157710022
+令人羡慕 10.8096351986
+艾哈迈迪 11.5027823792
+逃避责任 12.1089181827
+邮电 9.71102290995
+电子组态 11.7034530746
+宫宸 11.8212361103
+攻打 8.11993413618
+丹溪 12.5143832909
+五大湖 10.1394775363
+珍珠 7.98717464634
+藏器 12.5143832909
+厚薄 9.77354326693
+黄庄 12.5143832909
+百灵庙 11.3357282945
+攻扑 13.900677652
+步人后尘 12.8020653633
+撒诈捣虚 13.900677652
+黄庙 13.900677652
+楚天舒 12.8020653633
+税关 9.17328983326
+装饰布 11.8212361103
+向红端 12.5143832909
+黄庭 12.1089181827
+但林彪 13.2075304714
+单纯形 13.900677652
+全息术 11.5027823792
+爱好者 8.99540287354
+子思 11.9547675029
+吕兆龙 12.2912397395
+诡辩术 13.900677652
+拉多纳 12.8020653633
+法人地位 12.5143832909
+那蒂 12.5143832909
+花汤 13.900677652
+史春生 10.0088573539
+虚情 11.8212361103
+骄肆 13.900677652
+税务 8.57766767284
+江宁府 10.9049453784
+紧邻 9.94943393339
+砌末 11.5027823792
+眼点 10.7226238216
+学务 11.5027823792
+惹人 10.3743171274
+世界遗产 12.1089181827
+八十余 12.1089181827
+国之士 13.2075304714
+海不扬波 13.900677652
+古尔琴 13.2075304714
+玉簪记 11.9547675029
+惹事 10.2897597393
+织花 12.2912397395
+意气相投 12.1089181827
+续无统 13.900677652
+学力 13.2075304714
+海鹰 9.35738286971
+拴缚 11.0103058941
+访华 7.78921031247
+饿殍 11.5027823792
+水红花子 13.2075304714
+眼炎 12.5143832909
+敏化 11.9547675029
+声部 10.1630080337
+口无遮拦 11.1280889297
+南彝陵 13.2075304714
+中营 10.9049453784
+政法委员会 12.5143832909
+心荡神驰 12.5143832909
+部份 10.0088573539
+踮着 10.3453295905
+康克清 12.1089181827
+得而复失 10.1394775363
+部件 7.76945116249
+撒赖 13.2075304714
+张宝顺 13.2075304714
+英沐王爷 13.900677652
+巩简公 13.900677652
+占山 13.2075304714
+王清任 12.2912397395
+罐头瓶 11.9547675029
+过量 8.37921673411
+过重 9.26594866375
+后备力量 10.1871055853
+救亡运动 11.8212361103
+促狭 10.7226238216
+六千亩 13.2075304714
+占居 10.8096351986
+科技事业 11.598092559
+买入 6.18021595738
+极带 13.900677652
+二三斤 12.5143832909
+罗茨 11.8212361103
+恍恍惚惚 10.1394775363
+抱上去 13.2075304714
+气化炉 12.8020653633
+六千人 11.4157710022
+垦丁公园 12.1089181827
+电子计算 12.1089181827
+另一封 12.8020653633
+未领 13.2075304714
+誓同生死 11.1926274509
+学到 9.20932976975
+税利 12.8020653633
+学制 9.35738286971
+交流心得 13.2075304714
+秋风纨扇 13.900677652
+衡量标准 11.0674643079
+农十师 13.2075304714
+乐山市 10.9049453784
+访台 13.900677652
+黄州 10.3171587135
+碑林区 13.900677652
+王夫之 9.80633308975
+电影厅 12.8020653633
+访古 12.2912397395
+敢作敢为 10.642581114
+税制 9.71102290995
+五大洲 10.642581114
+和歌 10.2117981979
+惹下 10.6818018271
+关爷 11.7034530746
+马向前 10.9049453784
+厚赐 10.8561552143
+显微外科 11.598092559
+黄巢 9.87532596124
+陈三谟 11.598092559
+棘刺 10.5684731418
+部下 7.61841090508
+金丹术 13.2075304714
+访友 10.765183436
+学分 10.6818018271
+学刊 11.7034530746
+原平市 12.8020653633
+饿死 7.84623830571
+糖酶 13.2075304714
+六千万 12.2912397395
+再也不能 9.01032852375
+玛四世 12.5143832909
+仅见 11.1926274509
+声速 10.1871055853
+糖酸 13.900677652
+视频会议 11.0674643079
+栓皮 11.9547675029
+刘太平 13.2075304714
+子挥 13.2075304714
+程普收 12.8020653633
+比下有余 12.8020653633
+家景 13.900677652
+甲地孕酮 12.8020653633
+仁恕 13.2075304714
+税前 9.74179456862
+宾恩 13.900677652
+悻悻然 10.4349417492
+罗莫 13.900677652
+玄德大 10.765183436
+扁头 11.3357282945
+分子热 12.1089181827
+萨利姆 13.900677652
+随缘 10.8096351986
+海陵王 11.1926274509
+暖房 12.1089181827
+学前 12.5143832909
+输出功率 10.0505300503
+目标性 12.8020653633
+御林军 10.1871055853
+黄屋 12.1089181827
+滚滚红尘 12.8020653633
+戴宗自 12.2912397395
+学去 12.8020653633
+以势压人 12.8020653633
+作态 11.9547675029
+八十九 11.598092559
+屹然 13.2075304714
+拐子 9.0884932966
+跑出去 9.34680076038
+一鼻孔 13.900677652
+赌城 10.9049453784
+眼熟 9.84023464143
+素日 8.91707103027
+苗寨 11.9547675029
+转型期 11.1280889297
+重要途径 9.35738286971
+常绿植物 12.8020653633
+学历 8.98802276624
+四川队 12.1089181827
+第六品 12.1089181827
+大陆度 11.7034530746
+立刘询 13.900677652
+黄山 8.6803218269
+五寨县 13.2075304714
+参禅 9.87532596124
+八十一 10.4666904475
+八十万 10.3171587135
+学号 13.900677652
+八十三 11.9547675029
+解释学 11.9547675029
+子押 13.900677652
+居住舱 12.1089181827
+作业状态 12.8020653633
+第三十五条 13.900677652
+勒热夫 13.900677652
+切不可 9.06439574502
+税史 13.900677652
+几何级数 11.0103058941
+丹水 11.598092559
+税号 12.5143832909
+作恶 10.2630914922
+春芽 12.8020653633
+长海县 11.2616203224
+耶利内克 12.8020653633
+蛋白石 11.2616203224
+八十两 11.9547675029
+八十个 11.7034530746
+密码子 12.2912397395
+话费 9.48183704418
+藏品 9.40086798165
+孔多塞 12.2912397395
+苗家 12.2912397395
+从永宁 12.8020653633
+镣铐 10.642581114
+使用寿命 9.71102290995
+刘仪伟 13.900677652
+学友 12.2912397395
+龙心 12.5143832909
+无人性 13.900677652
+中式服装 13.900677652
+章爷 11.4157710022
+稠人广众 11.9547675029
+平衡器 13.2075304714
+野战条令 11.8212361103
+过速 11.5027823792
+文溯阁 12.8020653633
+学区 11.7034530746
+涉毒 11.9547675029
+人造 8.41173992582
+益母草 11.0103058941
+第六周 11.4157710022
+亲如手足 11.7034530746
+成纯合 13.2075304714
+苗子 9.32596667347
+富矿 10.2897597393
+同形词 13.2075304714
+瞳仁 10.9049453784
+隔墙有耳 11.8212361103
+部会 12.5143832909
+美酒佳肴 11.9547675029
+武候祠 13.900677652
+人选 8.28754954559
+过逾 13.2075304714
+疲惫感 13.2075304714
+支正 12.8020653633
+招呼 7.03166320131
+望垂慈 13.2075304714
+罗英 12.5143832909
+镍铬 11.9547675029
+滑掉 12.5143832909
+话路 12.5143832909
+阿德里安 11.9547675029
+丹法 11.8212361103
+丘基萨 13.2075304714
+黄峰 12.8020653633
+全公社 10.533381822
+过道 9.85762638414
+理货 13.2075304714
+蓝点颏 12.8020653633
+盒内 11.1280889297
+税卡 13.2075304714
+散射光 11.1280889297
+姿态万千 13.2075304714
+八十二 11.9547675029
+窑炉 11.598092559
+黄岛 11.0674643079
+暴烈 10.4349417492
+八十五 11.9547675029
+黄岗 11.9547675029
+丹河 12.1089181827
+数十万平方公里 13.900677652
+赌场 8.9519177616
+黄岐 12.5143832909
+安安生生 11.8212361103
+转换成 8.83808261895
+直性子 11.598092559
+层峦叠翠 13.2075304714
+黄岩 10.4994802703
+学博 12.2912397395
+潜能 9.38981814546
+铿锵有力 11.1280889297
+硫化物 9.18217878068
+侦查终结 11.9547675029
+曹魏诸 13.2075304714
+暴热 12.8020653633
+罗芳 12.8020653633
+第六名 11.0103058941
+部位 6.72748590949
+瘸子 10.6818018271
+脉动阵列结构 13.900677652
+税单 12.1089181827
+铁凿 13.2075304714
+人道 9.00283785202
+旅舍 11.7034530746
+娴熟 9.4233408375
+侍官 12.1089181827
+谢尔盖 11.3357282945
+马屁 10.604840786
+分枝杆菌 11.5027823792
+比年 12.1089181827
+钳子 10.3453295905
+雷夫 13.900677652
+科洛诺斯 13.900677652
+发送者 11.9547675029
+应章奏 13.2075304714
+励精图治 9.98865464655
+通鉴论 12.1089181827
+中央电视台 8.94485059437
+雷德尔 12.8020653633
+综合法 11.8212361103
+阿纳托尔 12.8020653633
+王浑爵 12.8020653633
+噩运 11.0103058941
+非现金 11.3357282945
+整杯 13.2075304714
+内切圆 13.900677652
+帕纳勒 13.900677652
+马山 10.5684731418
+人气指标 13.900677652
+蓝彩 13.2075304714
+籽儿 12.1089181827
+任相邦 13.2075304714
+整条 9.80633308975
+日以继夜 11.7034530746
+格巴 13.2075304714
+德维纳 12.8020653633
+胡温 13.900677652
+凯特尔 11.9547675029
+卡杜纳 13.2075304714
+哈气 10.9562386728
+硬手 13.2075304714
+马尔 9.21854642485
+华奎 13.2075304714
+李谅祚 11.2616203224
+蒯通 12.2912397395
+整月 11.9547675029
+秦桧 9.32596667347
+冷冻剂 12.2912397395
+望母 12.8020653633
+雷奇 12.8020653633
+马尤 13.900677652
+赫章 11.7034530746
+整机 9.69598503258
+新工艺 9.91169360541
+城门洞 10.7226238216
+雷奈 12.2912397395
+整本 12.1089181827
+雷奔 13.2075304714
+朱唇微 13.2075304714
+为五斗米折腰 13.2075304714
+蹈袭 12.2912397395
+马尾 9.31571017331
+马尿 11.7034530746
+马尼 11.5027823792
+罪过 8.74738605748
+大扫除 11.4157710022
+马尹 13.2075304714
+太平桥 12.1089181827
+强身 10.4041700905
+中华全国青年联合会 12.5143832909
+用人权 12.2912397395
+乐陵 10.4041700905
+笔架山 10.9049453784
+积分器 13.2075304714
+塔罗牌 13.900677652
+探讨问题 12.8020653633
+和义勇 11.9547675029
+伦图纳 13.900677652
+霍夫曼 10.0940151622
+雷妻 12.8020653633
+复子明辟 13.900677652
+科巴 12.2912397395
+水鬼 11.3357282945
+越线 11.4157710022
+英国曼彻斯特大学 11.8212361103
+哈泽 12.5143832909
+停步 9.48183704418
+日高 10.7226238216
+马峰 13.2075304714
+意气风发 10.604840786
+贝勒爷 10.2371160058
+辜恩背义 13.2075304714
+梁鞋 13.900677652
+负载电阻 13.2075304714
+渡过难关 10.1871055853
+整枝 12.1089181827
+整枚 13.2075304714
+陈绍禹 13.2075304714
+陕西历史博物馆 12.8020653633
+功高 10.8096351986
+庄王初 13.2075304714
+孝衣 11.598092559
+边储充 13.2075304714
+拉达泽 12.5143832909
+蹿火 13.900677652
+保安族 11.5027823792
+掀翻 9.45802639549
+疗效显著 11.5027823792
+橄榄绿 11.8212361103
+竺叔兰 13.2075304714
+损人利己 11.598092559
+成为事实 10.604840786
+收集 7.2673592187
+淘换 11.598092559
+马岭 12.5143832909
+抢劫案 11.9547675029
+乐队 8.37522471284
+农垦区 11.1926274509
+陈家庄 10.9562386728
+石灰粉 12.2912397395
+克孜尔 11.1926274509
+颁奖仪式 10.8096351986
+马岳 13.900677652
+济阳县 13.900677652
+严锡命 12.8020653633
+政者 12.2912397395
+度夏 11.1280889297
+桑田沧海 13.900677652
+大猩猩 11.0674643079
+乐音 10.8561552143
+整晚 11.1280889297
+谈虎色变 10.8561552143
+刘奇 12.8020653633
+笑儿 12.2912397395
+一征 13.2075304714
+膏蟹 13.2075304714
+光吃 11.9547675029
+雹害 12.8020653633
+酒坛 11.1280889297
+苏澳 10.6818018271
+陈清泉 13.2075304714
+红霞呵 13.2075304714
+也好 7.0080360108
+藏文 9.6811699468
+马嵬 11.8212361103
+归本邦 13.900677652
+格岛 13.900677652
+瑞纶 13.2075304714
+能成善 13.900677652
+表明 5.61844758868
+小山坡 10.9049453784
+事实真相 10.9049453784
+水力发电 9.33632946051
+邢台市 11.7034530746
+厂址 10.6818018271
+列车 8.089536659
+通花莲 11.9547675029
+亚洲纪录 11.8212361103
+刘备 8.24468584116
+孙文 9.37888907493
+糗得 13.900677652
+蓝布 9.55687223012
+终其天年 13.2075304714
+改图 13.2075304714
+扎囊县 13.900677652
+摸着石头过河 10.9049453784
+牵连速度 13.900677652
+干燥机 12.5143832909
+历昭帝 13.2075304714
+外交辞令 11.5027823792
+罗夫斯 13.2075304714
+蔡中郎 11.9547675029
+比弗 13.2075304714
+秦楚 11.9547675029
+有罪之身 13.900677652
+写作技巧 11.7034530746
+刘大 11.9547675029
+县吏 10.7226238216
+县后 12.5143832909
+县名 11.1280889297
+伊图里河 12.8020653633
+字国瑞 13.900677652
+孙新 9.54396882529
+辣乎乎 13.2075304714
+画蛇添足 11.1926274509
+莫里亚 12.5143832909
+广海九 13.2075304714
+油脂 7.81390292506
+爆发式 9.55687223012
+孙敏 12.5143832909
+格尼 12.5143832909
+集成显卡 13.900677652
+李初梨 13.900677652
+打油诗 11.5027823792
+藤架 12.5143832909
+杨干贞 13.900677652
+德威治 13.900677652
+吉他曲 13.2075304714
+孙敞 13.2075304714
+不在其位 11.598092559
+刘姓 10.5684731418
+刘姐 12.5143832909
+冷冻厂 13.900677652
+贵宾楼 12.1089181827
+但嘉平 12.2912397395
+格尔 9.89334446674
+简狄 12.5143832909
+流了泪 12.2912397395
+通透性 9.96885201925
+军战史 12.8020653633
+政腐 13.900677652
+燕为国 13.2075304714
+放长线 13.900677652
+天下为一 13.900677652
+秦榆 12.8020653633
+供求平衡 10.533381822
+散兵线 13.2075304714
+刘妈 11.8212361103
+驱寒 11.7034530746
+冷气设备 12.8020653633
+招干 12.8020653633
+节足动物 13.2075304714
+吃喝拉撒 11.3357282945
+收音 12.2912397395
+抖出来 11.5027823792
+雷声 8.6803218269
+长生殿 10.6818018271
+郭威迎 12.8020653633
+特长生 11.8212361103
+卵翼 11.8212361103
+发送至 11.7034530746
+蒹葭倚玉 13.900677652
+比得 10.604840786
+冰岛克朗 13.2075304714
+测高仪 12.5143832909
+子宫帽 13.900677652
+二四六 12.5143832909
+格局 6.05839887286
+翼梢 12.2912397395
+披红挂绿 12.8020653633
+四千七百七十二万余两 13.2075304714
+欧战 11.3357282945
+云卷云舒 13.2075304714
+秋千 10.1871055853
+关村坝 12.8020653633
+卢见曾 13.2075304714
+厂名 11.8212361103
+泡制 12.8020653633
+稳稳地 10.2371160058
+司户佐 12.8020653633
+保安服 13.2075304714
+罗托鲁 13.900677652
+落落大方 10.642581114
+苏河 13.2075304714
+尚要 13.2075304714
+闺女 8.25170341381
+觉得很没 12.8020653633
+举手投足 10.8096351986
+塌毁 12.2912397395
+胡汉 10.4994802703
+塞佩姆 13.900677652
+整整 7.27661242418
+唐一禾 12.8020653633
+整数 7.74581955796
+烧高香 12.2912397395
+章札委 12.5143832909
+马年 12.5143832909
+马平 13.2075304714
+梁陈 11.598092559
+莫克利 13.900677652
+格律 9.44633035572
+一德 11.3357282945
+比尼 11.8212361103
+马市 11.1280889297
+保安村 12.8020653633
+马希 11.3357282945
+刘威 12.5143832909
+苏波 12.5143832909
+马师 12.5143832909
+形容枯槁 12.5143832909
+处女地 10.765183436
+稀稀拉拉 10.5684731418
+创意作品 13.900677652
+会动 10.9562386728
+复线 10.0940151622
+马帝 13.2075304714
+咩咩叫 13.2075304714
+经典名曲 13.900677652
+钳夹 11.9547675029
+情景交融 11.0103058941
+叶利钦 10.1394775363
+整改 8.75901409547
+马帮 10.604840786
+林冲见 11.1926274509
+比尔 9.32596667347
+杨姐姐 13.900677652
+乐钟 12.5143832909
+胡氏 10.6818018271
+比少 13.900677652
+整支 12.8020653633
+两道 7.99804431857
+贾菱 12.1089181827
+普莱斯利 11.8212361103
+临城 10.9562386728
+苏法 13.900677652
+役卒 12.8020653633
+敲榨 12.2912397395
+钢筋混凝 12.8020653633
+王霸之 12.1089181827
+陶瓶 13.2075304714
+泼水节 10.765183436
+桑椹 10.9562386728
+胡注 12.8020653633
+草木子 12.8020653633
+胖嘟嘟 12.2912397395
+卡杜米 13.900677652
+封口费 12.1089181827
+收钱 9.71102290995
+历尽磨难 11.7034530746
+荷兰猪 13.900677652
+陆文夫 13.900677652
+孙晓 12.5143832909
+硅砖 12.8020653633
+包缝机 13.2075304714
+罪责 9.72629038208
+县域 9.87532596124
+心脏疾患 13.2075304714
+刮风 9.89334446674
+代位 13.2075304714
+证券法 9.41204128224
+收针 13.2075304714
+新疆吐鲁番地区 12.2912397395
+交锋 8.53003962385
+哈韦尔 11.9547675029
+阳澄 13.2075304714
+马延 12.1089181827
+县城 7.00196311765
+昂然 9.87532596124
+反犹太 12.5143832909
+林古乔 12.8020653633
+格式 8.44535653662
+关中地区 10.2897597393
+整日 9.00283785202
+桑植 10.765183436
+苏民 12.5143832909
+秋冬少 11.598092559
+进出境 12.2912397395
+社会现状 11.4157710022
+越糟 11.8212361103
+远洋货轮 12.5143832909
+跨行业 10.2897597393
+孙明 11.1280889297
+精整 12.1089181827
+文臣班 12.5143832909
+厌氧菌 11.1926274509
+导弹系统 9.30555780184
+马店 12.2912397395
+割让土地 12.1089181827
+技俩 13.900677652
+民营 7.79588441956
+马库 13.900677652
+收银 11.5027823792
+避着 11.9547675029
+马府 13.2075304714
+吉德玛 13.2075304714
+好美家 13.900677652
+马庙 13.2075304714
+贝氏莫 13.900677652
+陆春龄 12.2912397395
+水饺 10.8096351986
+阿塔科 13.900677652
+孙春 13.900677652
+郎舅 12.2912397395
+望楼 10.8561552143
+苏江 13.900677652
+水饭 11.8212361103
+律师事务 13.900677652
+胡沙 13.2075304714
+乐闲 13.2075304714
+弘德殿 13.900677652
+航图 13.900677652
+出口量 9.00283785202
+套包 13.900677652
+复合型 9.89334446674
+主观努力 12.8020653633
+代代 10.604840786
+乐闻 12.8020653633
+二极管 9.56994431169
+薏仁粉 13.900677652
+痰盂 11.4157710022
+冲锋陷阵 9.61021821083
+马当 12.1089181827
+胡海 12.5143832909
+张夫人 11.1280889297
+孙某 10.4994802703
+刘子 9.48183704418
+二十几分钟 13.2075304714
+代价 7.28461246684
+经济学说 10.8561552143
+架线 13.2075304714
+马彦 13.900677652
+桑梓 10.2897597393
+一忙 11.5027823792
+蓝山 11.598092559
+遮光板 13.2075304714
+依兰镇 13.2075304714
+受着 10.4666904475
+烤牛肉 13.900677652
+越累 13.900677652
+尿囊 11.8212361103
+一息尚存 11.3357282945
+收错 13.900677652
+雷娜 13.900677652
+药学院 12.2912397395
+厂商 7.7083151625
+中西部 8.05423887692
+航运界 13.900677652
+挡不住 9.18217878068
+马弁 10.604840786
+希奇古怪 11.7034530746
+一日三省 13.2075304714
+一忠 13.2075304714
+代交 12.5143832909
+代人 10.9049453784
+榨汁机 11.7034530746
+三百八十家 13.2075304714
+马弓 12.8020653633
+福特基金会 12.2912397395
+键子 13.2075304714
+悠着点 11.0674643079
+血肉之躯 10.2117981979
+圆圈式 13.900677652
+私议 12.1089181827
+主持公道 11.1280889297
+竭智尽忠 11.9547675029
+昂热 13.2075304714
+养心殿 9.09665660724
+珊德 13.2075304714
+取其精华 12.1089181827
+德文版 12.8020653633
+配分函数 13.900677652
+叶希八 13.2075304714
+澜沧 11.1280889297
+貌似强大 12.1089181827
+大金塔 11.8212361103
+马强 13.2075304714
+撑得住 11.5027823792
+大处着眼 10.9049453784
+猿啼 11.598092559
+营业员 10.3743171274
+罗斯蒙特 13.900677652
+二虎相斗 12.8020653633
+不为己甚 13.900677652
+孙权 8.24818847171
+复置 8.93783302172
+关连性 13.900677652
+灵江 11.7034530746
+刘寅 13.2075304714
+樊梨花 11.9547675029
+确权 12.1089181827
+杨杏 8.82550383674
+九江市 11.0674643079
+苏洵 11.0674643079
+代买 13.900677652
+率队参加 13.2075304714
+预防性 10.2897597393
+桑树 9.82314020807
+孙杨 13.900677652
+何药治 13.2075304714
+马忠 10.4666904475
+言神宗 12.8020653633
+孙来 13.2075304714
+缫丝机 13.2075304714
+东南西北 9.96885201925
+余年前 11.8212361103
+量减少 10.3171587135
+格布 12.5143832909
+东奔西窜 12.8020653633
+采给 13.900677652
+陆通 13.900677652
+康文涛 13.900677652
+葬身湖底 13.2075304714
+刘宋 10.0505300503
+邵真 13.900677652
+刘安 10.2630914922
+刘宏 10.8561552143
+胡润 9.72629038208
+房遗爱 12.5143832909
+马後 11.598092559
+刘宁 11.9547675029
+刘宇 11.8212361103
+蓝岛 13.2075304714
+印度政府 9.34680076038
+日常化 12.8020653633
+马得 11.8212361103
+哄劝 13.900677652
+被骗 10.4994802703
+邓普顿 11.7034530746
+散瞳 11.9547675029
+玺印 10.8096351986
+刘宗 12.2912397395
+相互了解 10.9562386728
+桑桑 12.5143832909
+赫梅利 12.8020653633
+颚骨 11.8212361103
+哄动 10.604840786
+跳来跳去 11.1926274509
+莫迪利 12.8020653633
+苏晋 13.2075304714
+王丁棉 13.2075304714
+马德 11.8212361103
+薏仁米 13.2075304714
+苏浙 11.9547675029
+蓝岭 12.8020653633
+刘家 9.94943393339
+马里奥 12.5143832909
+有老有少 12.1089181827
+十七项 13.2075304714
+蓝字 13.2075304714
+形意 13.2075304714
+中国社会科学院社会学研究所 13.2075304714
+水龙 9.93038573842
+哈桑 9.93038573842
+马塔 11.5027823792
+法军任 13.2075304714
+马塞 12.2912397395
+忍饿 12.2912397395
+骗婚 13.900677652
+大娄山 10.9049453784
+锡瓦斯 12.2912397395
+赴死 10.8096351986
+德意军 12.1089181827
+连锁业 12.1089181827
+会剿 11.1926274509
+刘山 11.3357282945
+科研开发 12.2912397395
+郭从谦 13.900677652
+秦氏 10.1394775363
+广西艺术学院 13.900677652
+联防队员 13.900677652
+马堂 13.2075304714
+中年期 12.5143832909
+束手受缚 12.2912397395
+尚存有 11.8212361103
+刘封 10.2117981979
+电势差 11.3357282945
+李凯先生 13.900677652
+群众反映 10.2117981979
+容人 10.6818018271
+扬雄 10.9049453784
+营业厅 10.4994802703
+上海浦东 9.96885201925
+酒城 12.5143832909
+温良郡 13.2075304714
+绊跌 13.900677652
+哈根 11.1280889297
+礼宾司 13.2075304714
+哈格 13.2075304714
+马堡 11.8212361103
+狭路 12.2912397395
+塞音 10.9562386728
+孙悦 12.5143832909
+惦着 10.0505300503
+愧悔 11.598092559
+马斯一世 13.900677652
+排萧 13.2075304714
+越南社会主义共和国 12.1089181827
+秦汉 7.62968922012
+罪证 10.3171587135
+悄声 8.65893063692
+电源接口 13.900677652
+秦河 9.36807815882
+散热 9.32596667347
+千万次 12.1089181827
+水鼓 12.8020653633
+负面效应 10.0088573539
+传送数据 12.8020653633
+怀沙 12.2912397395
+保持高速 10.1871055853
+厂办 13.2075304714
+几许 10.533381822
+格外 7.20735398371
+两广总督 9.28555713513
+刘大人 10.8096351986
+厂务 12.8020653633
+上海电视台 13.900677652
+翻供 11.3357282945
+顾正红 12.2912397395
+摘自 10.2371160058
+葶苈子 12.8020653633
+养心汤 12.8020653633
+哈森 13.900677652
+科学试验 10.8561552143
+申奶奶 10.9562386728
+安赛蜜 13.2075304714
+家庭用户 12.8020653633
+瑞符 13.2075304714
+皮包公司 13.2075304714
+欧罗巴洲 12.8020653633
+菲舍尔 11.8212361103
+恐怖分子 10.3743171274
+整排 13.2075304714
+遮挡住 11.8212361103
+蓝宇 13.900677652
+怜贫惜贱 13.900677652
+新闻官员 12.8020653633
+盐化工业 12.5143832909
+任校书 13.2075304714
+契友 12.5143832909
+率师 9.7898037878
+格套 13.2075304714
+容下 12.2912397395
+刘岩 10.0940151622
+秦法 11.5027823792
+极化过程 12.2912397395
+二十一项 13.2075304714
+盯紧 10.9562386728
+新张 13.2075304714
+袁天罡 12.8020653633
+雷州 10.4994802703
+县内 9.98865464655
+先声 9.71102290995
+民舍 12.1089181827
+马奇 10.1871055853
+鬼哭狼嗥 12.5143832909
+册数 13.900677652
+三棵 11.598092559
+化学溶蚀 13.2075304714
+陆文康 12.5143832909
+马奈 12.1089181827
+蹄铁 12.2912397395
+马奔 10.6818018271
+电脑板 13.900677652
+马契 13.900677652
+比学 13.2075304714
+翻个 10.604840786
+秦洪 10.3453295905
+雷尼 12.2912397395
+电灯光 11.8212361103
+收上来 11.9547675029
+刘嵩 13.900677652
+层面 7.08394177138
+整批 11.9547675029
+复种 10.533381822
+缚成 13.900677652
+冷夏暖 13.900677652
+吉他手 13.900677652
+马奶 11.598092559
+心慈面软 11.8212361103
+右心房 11.4157710022
+雷尔 12.5143832909
+瓦尔港 13.2075304714
+大不如前 10.604840786
+翻下 11.9547675029
+翻上 11.0674643079
+自杀性 12.1089181827
+厂区 9.71102290995
+频谱 10.0720362555
+青海省 8.4284069783
+洗钱 10.2897597393
+水漂儿 12.8020653633
+地壳运动 9.35738286971
+发放 7.22991133113
+汉中门 11.8212361103
+随机取样 13.2075304714
+绵延不断 11.8212361103
+国浩罕 13.2075304714
+刘崇 10.9562386728
+整成 12.8020653633
+心电监护 13.2075304714
+厉以宁 10.4994802703
+小山包 11.0103058941
+周高中 12.2912397395
+表扬 9.16447920358
+议价空间 13.2075304714
+签合同 10.2630914922
+滴溜溜 10.2630914922
+派生词 12.8020653633
+伏允 12.5143832909
+硬抠 13.900677652
+鄂焕 12.5143832909
+伊利运河 11.9547675029
+香港机场 12.5143832909
+二滩电站 12.5143832909
+马太 11.4157710022
+马夫 9.16447920358
+厂卫 10.3743171274
+马头 8.6966709649
+十二万 10.4994802703
+校医院 12.5143832909
+苏毗 11.8212361103
+以儆效尤 11.0674643079
+找过 10.0940151622
+元英宗 11.1280889297
+马夸 12.5143832909
+马夹 13.900677652
+膏药 9.36807815882
+一层 6.53044701017
+桥本龙太郎 12.5143832909
+比对 9.62401153296
+阿尼斯 13.900677652
+哄哄 10.2897597393
+综合楼 11.5027823792
+型管 12.5143832909
+雷岩 13.900677652
+蜻蜒点水 13.900677652
+纽伦堡 9.87532596124
+神色异常 11.9547675029
+阿摩利 12.5143832909
+积分电路 13.2075304714
+完成率 11.0674643079
+植物蛋白 10.6818018271
+整担 13.2075304714
+晋惠帝 10.5684731418
+餐具 9.66657114738
+门格尔 12.5143832909
+巴林右旗 12.1089181827
+沙河市 13.900677652
+博尔斯克 12.2912397395
+传递性 12.2912397395
+四十五篇 13.2075304714
+酮酸 12.5143832909
+袄儿 11.0103058941
+狭谷 12.2912397395
+水鸭 12.1089181827
+吖啶 13.900677652
+打照面 11.9547675029
+卵管 13.2075304714
+贿赂 8.38724890581
+刘巴 12.8020653633
+水鸡 13.2075304714
+表彰会 11.5027823792
+占领区 9.56994431169
+抽球 13.2075304714
+三十五里 12.5143832909
+比容 11.8212361103
+恬美 12.5143832909
+萎靡 9.31571017331
+次黄嘌呤 13.900677652
+栽下去 11.5027823792
+讨烦 13.900677652
+的里雅斯特市 13.2075304714
+分时图 9.58318953844
+操雷 13.900677652
+平王敦 12.8020653633
+整把 13.900677652
+毛希丁 13.2075304714
+雷峰 12.5143832909
+替代品 10.1164880181
+轰动 8.57280148319
+秦淮 10.3743171274
+跟读 13.900677652
+水鹿 10.9049453784
+贡献率 9.37888907493
+诸军之 12.8020653633
+付晶 13.2075304714
+香蕉林 13.2075304714
+工业战线 12.1089181827
+太平洋 6.82233607242
+家声 11.9547675029
+日龙 12.5143832909
+厂史 13.900677652
+宇文莫槐 13.2075304714
+水鹤 13.900677652
+李明 10.2371160058
+国营农场 10.1871055853
+燃素 11.2616203224
+四万七千 12.5143832909
+白马股 11.598092559
+分离点 13.900677652
+王连年 12.8020653633
+一展 10.3171587135
+枋寮 12.5143832909
+乐都 10.3743171274
+玉树琼花 13.900677652
+一便士 13.900677652
+抢镜头 12.8020653633
+悠忽 13.2075304714
+雷马根 12.8020653633
+胡桃 9.82314020807
+于建隆 13.2075304714
+鼻子眼儿 13.900677652
+苏梅 12.1089181827
+霞石 11.1280889297
+一百棵 13.900677652
+羟乙基化 13.900677652
+胡桐 13.2075304714
+保守党政府 12.1089181827
+斯托帕 12.8020653633
+刘平 12.1089181827
+液晶电视 9.01787572939
+系统资源 11.9547675029
+争口气 11.0103058941
+二十分钟 10.2117981979
+派驻 8.97342396682
+县区 10.8561552143
+吴祥来 13.2075304714
+刘帅 12.5143832909
+二百海里 13.2075304714
+翁氏 12.1089181827
+种果 12.8020653633
+摩天岭 10.604840786
+比堤 13.2075304714
+一百两百 13.2075304714
+险滩 9.77354326693
+蓝夷 13.2075304714
+妄自 11.3357282945
+备用金 11.4157710022
+萧树文 9.44633035572
+三生石 11.0674643079
+导致系统 12.2912397395
+红楼梦 9.01032852375
+法齐 12.5143832909
+鬼哭狼嚎 10.6818018271
+露天煤矿 10.6818018271
+保税区 10.3171587135
+安步当车 13.900677652
+被选举权 10.7226238216
+臧征 11.5027823792
+气嘘嘘 12.8020653633
+存取方法 13.900677652
+口腔溃疡 11.598092559
+朱燮 13.2075304714
+蓝天 8.75318317516
+物以类聚 11.4157710022
+外贸学院 13.900677652
+姿质 13.900677652
+擦掌磨拳 13.900677652
+中越关系 12.5143832909
+弹腿 12.2912397395
+债务缠身 13.2075304714
+出敌不意 10.6818018271
+留点神 11.8212361103
+专类花园 13.2075304714
+雷德 10.0940151622
+山脉 6.98099380213
+两局 11.0674643079
+望洋 12.2912397395
+唐大沛 12.8020653633
+乐道 13.2075304714
+烤钵 13.2075304714
+挖煤 10.765183436
+遮雨 11.8212361103
+金斯顿 12.2912397395
+南市区 13.2075304714
+刘建 10.5684731418
+太平湖 11.1280889297
+布兰代斯 12.1089181827
+持戈试马 13.900677652
+孙承 13.2075304714
+各器官 10.1630080337
+石料场 13.2075304714
+刘延 12.5143832909
+刘廷 12.8020653633
+钳工 11.1280889297
+县县 11.2616203224
+焕然 12.5143832909
+滑橇 12.5143832909
+桑海 10.8096351986
+名优特 13.900677652
+越冬场 12.8020653633
+刘庄 10.1164880181
+兽性大发 12.8020653633
+楚昭王 11.9547675029
+刘府 12.2912397395
+尼可刹米 12.8020653633
+放贷人 12.2912397395
+那就算了 11.2616203224
+比增 13.2075304714
+二十碗 13.2075304714
+望海 11.8212361103
+画法 9.74179456862
+格子 9.26594866375
+卖不掉 12.5143832909
+激光测距仪 9.93038573842
+石灰窑 11.3357282945
+泊地 12.2912397395
+网情 13.2075304714
+超现实主义 10.1164880181
+但是 4.17362899308
+刘康 13.900677652
+桑河 12.8020653633
+病毒科 11.2616203224
+赤心报国 12.5143832909
+美洲开发银行 12.8020653633
+宏观 6.75469318426
+牛皋 12.8020653633
+化害为利 13.900677652
+刘彝 13.2075304714
+政治面貌 12.2912397395
+访寻 13.900677652
+推行者 12.2912397395
+比奥 11.8212361103
+小而精 12.8020653633
+唱起歌 10.9049453784
+马季 12.2912397395
+皎洁 9.84023464143
+吵起 11.9547675029
+分泌液 12.8020653633
+刘彦 11.1280889297
+刘彤 13.2075304714
+刘彻 9.93038573842
+外国籍 12.8020653633
+廖浩然 13.2075304714
+比奇 12.2912397395
+雷帝 11.598092559
+表态 7.19626329701
+能复官 13.900677652
+盆地 6.78428350788
+诉讼法学 13.900677652
+愈演愈烈 8.83808261895
+双亡 12.5143832909
+白珍珠 13.2075304714
+刘弘 12.1089181827
+标准时区 13.2075304714
+比夫 13.2075304714
+比大 10.7226238216
+黑恶势力 10.642581114
+航务 12.5143832909
+蔷薇 9.08039608637
+工会 8.42421410004
+比多 12.5143832909
+扶幼主 13.900677652
+有效 5.29620645245
+泽祖鲁 13.900677652
+否定 7.48885938427
+由亨利 13.2075304714
+识字班 13.2075304714
+刘强 10.8561552143
+朱熹 8.95903522937
+腰缠 12.2912397395
+胡椒 8.40761620864
+慈禧一 11.3357282945
+打斗声 13.900677652
+哈欠 9.55687223012
+桑泊 11.1280889297
+表演系 12.1089181827
+布儒斯 12.1089181827
+燕青笑 12.5143832909
+荣辱兴衰 11.7034530746
+曾游 12.1089181827
+罗译 13.900677652
+散班 10.5684731418
+机械防治 12.8020653633
+四十余日 13.900677652
+描一描 13.900677652
+舟桥团 12.8020653633
+滇黔桂 12.5143832909
+雷康 12.5143832909
+一叶扁舟 12.1089181827
+插接 12.5143832909
+复合化 12.8020653633
+承先启后 11.9547675029
+膏腴 11.2616203224
+海柿树 13.2075304714
+刘志 10.0088573539
+雷庆 10.0294766411
+叶齐德 12.5143832909
+三余度 12.8020653633
+纪工委 13.900677652
+竞争手段 11.8212361103
+古今谭 13.2075304714
+刘忠 11.9547675029
+蹊跷 8.56313957227
+岐阜 12.2912397395
+封建迷信 10.0294766411
+硫辛酸 13.900677652
+比姆 12.8020653633
+斯克里亚宾 12.2912397395
+扳平 11.9547675029
+盗墓贼 9.03314320152
+桑氏 13.2075304714
+举重若轻 11.4157710022
+哈瓦特 13.900677652
+马宇 12.8020653633
+装框 13.900677652
+塞拉西 11.1926274509
+卢巴纳 13.900677652
+斯特罗 11.0674643079
+刘征 13.2075304714
+望江 11.7034530746
+洗发露 11.9547675029
+可容忍 12.5143832909
+轨道衡 13.2075304714
+说不来 11.1926274509
+颐年堂 12.2912397395
+炕席 10.5684731418
+架空 9.63799777493
+马宝 13.900677652
+房间内 10.4349417492
+泗阳县 12.1089181827
+满面春风 10.1164880181
+水鱼 11.5027823792
+替代国 13.2075304714
+马宣 13.900677652
+鹳山 12.8020653633
+特奥蒂 12.1089181827
+王存才 13.2075304714
+中高档 9.96885201925
+马家 9.71102290995
+阶段性 7.47905538417
+华夏 6.66433830922
+互联网 7.12189275429
+海伦县 12.8020653633
+刘徽 10.3743171274
+祖法儿 13.2075304714
+虚功原理 13.2075304714
+马来族 13.2075304714
+比如 5.86087530824
+刘德 10.9562386728
+表情 6.88766186234
+仗胆 12.2912397395
+荒山坡 13.900677652
+赋性 11.8212361103
+德善行 13.900677652
+种性 11.8212361103
+人口数量 10.1871055853
+东内特 12.8020653633
+秦怡 12.5143832909
+搜索前进 13.900677652
+沙河县 13.900677652
+投书 11.7034530746
+巨野泽 12.5143832909
+就业者 12.1089181827
+特殊使命 11.5027823792
+三桩 12.5143832909
+实因 10.6818018271
+平绥路 13.2075304714
+世博园 10.4994802703
+神奈川 12.2912397395
+孙波 11.0674643079
+表演 6.93182727363
+刘健 11.7034530746
+马莱伯 13.2075304714
+以次充好 11.1280889297
+八家子 12.5143832909
+橘子洲 12.8020653633
+荣誉心 13.900677652
+山腰 9.7898037878
+沙河口 12.8020653633
+雷公 9.54396882529
+保命钱 12.8020653633
+多种文 13.900677652
+马吉 12.8020653633
+投中 10.4994802703
+实验剧场 13.2075304714
+那琪官 12.8020653633
+苏曼 12.8020653633
+四例 11.9547675029
+有先有后 10.8096351986
+告退 9.26594866375
+三档 9.71102290995
+虚无主义 10.9562386728
+胡显 12.8020653633
+卵白 12.8020653633
+草草率率 13.900677652
+载于 10.4666904475
+胸有丘壑 13.900677652
+罪行 8.47133202302
+诺贝 13.900677652
+金属元素 10.1394775363
+杨雪义 12.8020653633
+除草 10.4349417492
+雷克 11.598092559
+若使 11.2616203224
+万余枚 13.900677652
+制品业 11.0674643079
+山腹 9.71102290995
+相联 9.32596667347
+投下 8.87679713113
+君臣佐使 12.5143832909
+孙海客 12.2912397395
+孙河 13.2075304714
+官归田 12.5143832909
+二段式 13.2075304714
+四体 11.2616203224
+比国 11.4157710022
+线性网络 13.900677652
+收麦 11.598092559
+家底儿 12.2912397395
+子郭思 13.2075304714
+昏沉沉 11.3357282945
+间道 11.1926274509
+老毛病 10.2371160058
+冶容 13.900677652
+县差 13.2075304714
+陈仲举 13.2075304714
+投以 10.6818018271
+曾征其 13.2075304714
+斯维至 13.2075304714
+东西连 11.7034530746
+四位 8.94485059437
+数百毫升 13.2075304714
+抖下去 13.900677652
+操作速度 12.8020653633
+久仰大名 13.900677652
+白晋进 12.8020653633
+七情六欲 10.9562386728
+党的领导 9.35738286971
+中英对照 13.2075304714
+呋喃糖 12.8020653633
+马哲 13.900677652
+钳口 12.5143832909
+驱动 7.06656891316
+火车撞 13.900677652
+雷军 13.2075304714
+龙安区 13.2075304714
+苏普 12.8020653633
+越盟 11.598092559
+四众 9.26594866375
+淮沭河 11.5027823792
+孙氏 10.604840786
+千万条 12.2912397395
+四会 12.5143832909
+硅片 10.8096351986
+董廷献 12.2912397395
+投亲 12.2912397395
+地下活动 11.5027823792
+凤头雨 13.900677652
+尿崩 13.2075304714
+隆回县 13.900677652
+脚不点地 12.2912397395
+投产 7.73525979774
+雷击 10.1871055853
+周贫济老 13.900677652
+受宠若惊 9.89334446674
+特拉华州 11.1280889297
+单眼皮 11.2616203224
+戈里亚 12.8020653633
+伯朗士 12.8020653633
+投井 10.7226238216
+斯特灵 11.9547675029
+飞行体 13.2075304714
+平均主义 10.2117981979
+示范带头 12.5143832909
+家山 12.2912397395
+老框框 13.900677652
+瑞芳 11.8212361103
+赫特 11.7034530746
+投了 9.61021821083
+辛散温 13.2075304714
+村规民约 12.2912397395
+演起 13.900677652
+麻花辫子 12.8020653633
+刘光 11.3357282945
+胡来 10.0088573539
+恤贫 12.8020653633
+刘元 11.598092559
+贫贱夫妻 12.5143832909
+乌娜吉 12.8020653633
+锌盐 12.8020653633
+间里 10.4041700905
+明异典 13.2075304714
+越看 9.82314020807
+价格 4.54675655152
+宋二公 11.7034530746
+一衣带水 11.598092559
+价标 13.2075304714
+民运 11.4157710022
+令人气愤 12.5143832909
+四价 12.5143832909
+四件 10.9049453784
+刘公 11.4157710022
+合理合法 10.9562386728
+四任 12.8020653633
+民进 10.4041700905
+疏附县 12.8020653633
+抚松 11.598092559
+四份 11.1926274509
+勾取 12.2912397395
+四代 10.3453295905
+盒装 11.8212361103
+为政不廉 13.900677652
+苏林 11.0103058941
+殴伤 12.5143832909
+信任投票 11.9547675029
+权威部门 10.2897597393
+在所不计 12.2912397395
+刘兴 11.1926274509
+古装片 12.5143832909
+灰沉沉 13.900677652
+玲珑 9.36807815882
+四五 9.20019728618
+键元 13.900677652
+哄堂 13.2075304714
+桑拿 11.1926274509
+废品收购 11.9547675029
+若何 9.14708746087
+孙涛 13.900677652
+普列文 13.2075304714
+能屈能伸 11.598092559
+贵州铝厂 13.900677652
+白刺属 13.2075304714
+北野 12.8020653633
+四二 12.1089181827
+过饱 11.7034530746
+戴维因 13.900677652
+王江州 13.2075304714
+四人 7.97909923233
+胡服 10.8096351986
+钳制 10.0720362555
+碰面 10.4666904475
+福余卫 12.5143832909
+高大挺拔 12.1089181827
+县尉 10.0294766411
+四亩 11.3357282945
+普列斯 13.900677652
+刑侦局 13.900677652
+二十一间 13.900677652
+政要 9.65218240993
+操纵基因 13.900677652
+库平银 10.6818018271
+发展性 12.8020653633
+敲打 9.01032852375
+觉得很有 11.1926274509
+四乙 11.7034530746
+四九 11.5027823792
+昌言无忌 13.900677652
+片甲不留 11.0674643079
+雷傲 11.9547675029
+妇人之仁 10.8561552143
+有机酸 9.62401153296
+一万二千余 13.2075304714
+再传 11.5027823792
+投保 8.85725253506
+进出口 7.33119623156
+刘凯 12.8020653633
+居正父 13.900677652
+航展 11.0103058941
+驱去 13.900677652
+刘凡 10.604840786
+石广元 12.8020653633
+胡某 11.0103058941
+四乡 10.1164880181
+四书 9.46986085313
+冈底斯山脉 10.4041700905
+去死吧 12.1089181827
+胡柚 13.2075304714
+黄穗 13.2075304714
+冷冻室 11.9547675029
+孙海 8.87023973058
+哈日 12.8020653633
+苏杭 10.4994802703
+四世 9.12999302751
+习学得 13.2075304714
+孙洁 12.1089181827
+冲翼艇 12.1089181827
+杯状病毒 13.900677652
+复用 10.765183436
+四七 11.5027823792
+刘军 11.9547675029
+四丁 12.2912397395
+四一 12.1089181827
+四万 9.71102290995
+法部 12.5143832909
+百分之二十 10.4994802703
+塞尔柱 9.77354326693
+四上 13.900677652
+四丈 11.7034530746
+形态 5.8391907851
+四串 13.900677652
+从明年起 11.3357282945
+桥底下 13.900677652
+有言在先 11.0674643079
+任主其 13.2075304714
+卵石 9.84023464143
+学习材料 11.7034530746
+越短 10.4041700905
+法郎 9.93038573842
+哈斯 11.2616203224
+情报信息 11.8212361103
+四两 10.1630080337
+鼬獾 12.5143832909
+四个 6.13850704484
+复生 9.94943393339
+中国儿童艺术剧院 12.2912397395
+芥子 11.1280889297
+四中 11.9547675029
+宋知夏 13.2075304714
+发货票 13.2075304714
+文化背景 10.2371160058
+赴救 13.2075304714
+赴敌 11.4157710022
+妃嫔媵嫱 13.900677652
+列车长 12.5143832909
+涌现 8.58255765813
+价款 9.20019728618
+集中制 12.8020653633
+理事 8.32472854883
+雷区 10.604840786
+腰牌 10.2630914922
+整流 9.75754292558
+洪江市 12.5143832909
+收缩起来 13.900677652
+地图搜索 13.2075304714
+电脑桌 13.900677652
+管道泵 13.900677652
+派队 11.7034530746
+山区农业 11.7034530746
+卧佛 11.0103058941
+坑害百姓 13.2075304714
+根本点 11.8212361103
+复盖 13.2075304714
+复盐 11.9547675029
+电离辐射 11.2616203224
+旅行 7.96314144689
+启德机场 11.9547675029
+理他 9.59661255877
+柳体 12.2912397395
+清川江 10.7226238216
+郎吴硕 13.2075304714
+娇贵 11.0103058941
+马嘉 12.5143832909
+刘刚 13.2075304714
+水量 7.60541165054
+水里 7.79588441956
+议论声 11.5027823792
+勇猛过人 12.8020653633
+玉堂富贵 12.8020653633
+败柳 13.2075304714
+整洁 9.04864738806
+长强 12.8020653633
+耳机 9.38981814546
+胡搅 11.8212361103
+职工群众 12.8020653633
+宣托司 13.2075304714
+农耕社会 13.2075304714
+德意志 8.05135287203
+西府里 11.9547675029
+马嘶 10.4994802703
+反补贴 8.56795885871
+公言 11.2616203224
+比吉 12.2912397395
+刮风下雨 10.9562386728
+硅烷 11.1280889297
+八百公里 12.8020653633
+反应力 12.8020653633
+剪片 13.900677652
+大锅饭 10.6818018271
+胡搞 13.900677652
+厨艺 11.9547675029
+刘勋 13.2075304714
+许之物 12.8020653633
+盗墓者 9.6811699468
+持法 12.8020653633
+瑞生 12.5143832909
+邢王二 10.2630914922
+马蹄粉 12.8020653633
+刘勇 13.900677652
+三四顿 13.2075304714
+姜块 13.900677652
+救火队 11.9547675029
+泣红亭 13.2075304714
+蒸发皿 12.8020653633
+理上 11.5027823792
+划进 12.1089181827
+经验值 13.2075304714
+火电厂 9.69598503258
+颇为得意 11.1280889297
+监守 11.7034530746
+环己基 12.5143832909
+范文仲 13.2075304714
+潜下去 13.900677652
+哈曼 13.900677652
+小山峰 12.8020653633
+县志 9.94943393339
+承包户 13.900677652
+钳口结舌 13.900677652
+蒙养院 12.8020653633
+李文海 13.2075304714
+杀人狂 12.8020653633
+妄费 13.900677652
+马图 12.2912397395
+韩服 12.8020653633
+理个 11.8212361103
+马国 10.5684731418
+宋江入 12.1089181827
+六年级 10.1630080337
+鹿精灵 12.2912397395
+粉坊 13.900677652
+敢肯定 10.6818018271
+何大一 13.2075304714
+功夫不负有心人 11.0674643079
+曼哈顿 9.94943393339
+咋个 10.3453295905
+审核员 13.900677652
+留难 11.8212361103
+水酒 11.1926274509
+青风藤 13.900677652
+构造运动 8.75318317516
+制造费用 12.8020653633
+民谣 9.82314020807
+摩擦片 12.2912397395
+军事科学院 11.0103058941
+萎顿 11.598092559
+善门难开 13.900677652
+荼蘼 11.8212361103
+洪英植 12.8020653633
+难解 9.82314020807
+刘劭 11.4157710022
+装卸量 13.2075304714
+民谚 10.1630080337
+霍尼亚拉 12.8020653633
+静若处子 13.900677652
+民调 10.8561552143
+赌博罪 11.3357282945
+叶显恩 13.2075304714
+吕蒙袭 12.2912397395
+刘劲 12.2912397395
+五线谱 11.2616203224
+箬竹 13.900677652
+苏斯 11.4157710022
+心安理得 9.85762638414
+卵生 9.5062284973
+压水井 13.900677652
+刘华 11.8212361103
+刘协 13.2075304714
+柳丝 11.4157710022
+虚套 12.5143832909
+唱起来 10.0294766411
+马坊 13.900677652
+雷利 12.5143832909
+县处级 11.1926274509
+终归于 13.900677652
+泼成 13.900677652
+苏方 12.5143832909
+马坑 11.2616203224
+低级趣味 10.9562386728
+马坝 12.5143832909
+马坚 12.5143832909
+箬笠 11.598092559
+马坡 11.5027823792
+苏文 12.5143832909
+吾民 11.4157710022
+止于 9.48183704418
+胡敏 13.900677652
+钱重银 13.900677652
+酱料 12.1089181827
+区越远 13.2075304714
+胞外基质 13.900677652
+个体主义 13.2075304714
+单刀直入 10.604840786
+薄剑 13.2075304714
+韩柳 11.8212361103
+五权分立 12.5143832909
+王宠惠 11.2616203224
+鼓书 12.5143832909
+政论 9.58318953844
+柴荣乘 13.2075304714
+胖汉 12.5143832909
+苏日 13.2075304714
+轻型车 12.8020653633
+隐晦曲折 11.8212361103
+哈朗 9.5062284973
+处理工艺 12.2912397395
+古人云 9.5062284973
+伊纳克 12.8020653633
+靖远 10.2897597393
+半套 12.5143832909
+检测站 13.900677652
+居藩 12.8020653633
+鸾凤和鸣 13.900677652
+跗骨 12.5143832909
+恬然 12.2912397395
+磨烂 12.2912397395
+膏泽 13.900677652
+尿床 10.9562386728
+水部 12.8020653633
+病毒疣 13.2075304714
+任钧 13.2075304714
+复种面积 13.900677652
+主角奖 11.0103058941
+县市 8.73019365694
+淋巴液 10.9562386728
+降到 8.1386262692
+投上来 13.900677652
+复合式 11.0103058941
+比赛规则 10.2630914922
+图库 11.0674643079
+艾莲 11.8212361103
+妄谈 11.598092559
+雷加 13.900677652
+马城 12.8020653633
+理会 7.6468488404
+石灰石 8.05423887692
+缺乏经验 10.6818018271
+赵薇 10.533381822
+石制品 10.8096351986
+去年同期 7.19503855712
+杨铿内 12.8020653633
+哈柏 13.900677652
+飞黄腾达 10.0720362555
+张北县 12.1089181827
+僻远 12.8020653633
+复合弓 13.900677652
+刘叔 12.8020653633
+率先 6.82825575144
+丁达尔 12.5143832909
+率兵 8.14493543839
+桑怒 13.900677652
+成都市 9.08039608637
+自决权 11.598092559
+胡旋 13.2075304714
+阿摩尔 12.5143832909
+瑞琴 13.2075304714
+不怕牺牲 11.0674643079
+胡族 11.2616203224
+封妻荫子 11.3357282945
+通文墨 11.1280889297
+代表大会 7.94743431769
+赫然 8.62256299275
+流下泪来 10.2630914922
+肩前 13.900677652
+刘台 11.9547675029
+清河门 13.2075304714
+马基 11.7034530746
+汕尾市 11.7034530746
+比喻 8.44535653662
+二十四丈 13.2075304714
+塞尔日 13.2075304714
+哈林 12.8020653633
+胡斯 10.2897597393
+备份文件 12.5143832909
+马里克 13.900677652
+报单 12.1089181827
+木菠萝 11.9547675029
+复眼 9.43476953332
+捧腹大笑 11.1280889297
+卵裂 10.7226238216
+蒋益沣 13.2075304714
+县府 7.63918596765
+整治 7.59075937375
+苏黎世 9.35738286971
+驱出 12.2912397395
+胡斌 13.900677652
+千多名 13.900677652
+生意经 11.8212361103
+尿布 10.4349417492
+古蔺县 12.8020653633
+礼宾官 13.900677652
+混浊 9.10488710638
+唐大明 13.900677652
+七八圈 13.2075304714
+文艺观 13.2075304714
+胡扯 10.3453295905
+邱得用 9.0884932966
+胡志明 10.765183436
+李君如 12.5143832909
+堪萨斯 10.765183436
+唐长老 10.9562386728
+马健 11.2616203224
+广德军 12.2912397395
+桑林 11.7034530746
+青出于蓝 12.5143832909
+三长两短 9.71102290995
+佛学界 13.2075304714
+光合强度 13.900677652
+桑枝 12.8020653633
+毒蕈碱 13.2075304714
+哈恩 11.1280889297
+率团 10.604840786
+地下军 12.8020653633
+气动工具 13.900677652
+两万家 12.8020653633
+立福临 12.5143832909
+刘吉 12.5143832909
+恤衫 11.8212361103
+塞尔扣 13.900677652
+铅灰色 11.0103058941
+比到 11.8212361103
+更新世 8.45394028031
+巴茵宫 13.2075304714
+什维克 13.900677652
+老爷车 12.2912397395
+化工机械 11.1926274509
+刘向 10.0294766411
+榛榛 13.900677652
+报到证 13.900677652
+太平洋集团 12.8020653633
+照相馆 9.77354326693
+妄语 10.9049453784
+毫无根据 11.1280889297
+司法部长 10.2117981979
+苏拉 10.6818018271
+忽上忽下 11.2616203224
+桑柘 12.2912397395
+石炭酸 12.5143832909
+比划 9.56994431169
+海水鱼 13.2075304714
+武当山风景区 12.2912397395
+营业室 12.8020653633
+摄影记者 11.1280889297
+妄说 12.5143832909
+追溯到 9.14708746087
+何作霖 13.2075304714
+三十五顷 13.2075304714
+居舍 13.2075304714
+舅子 12.5143832909
+王初年 13.2075304714
+头颈 9.96885201925
+观日亭 13.2075304714
+望望 7.75007488353
+格儿 11.9547675029
+冷冻库 13.2075304714
+被卧 12.2912397395
+哈韦利 13.900677652
+艾姆斯 12.8020653633
+鄂豫皖 9.96885201925
+奥文斯 13.900677652
+蝰蛇 12.5143832909
+因缘际会 13.900677652
+孙桓 11.7034530746
+望月 10.9049453784
+忆菊 12.5143832909
+碳丝灯 13.900677652
+弯弯的 10.2630914922
+司马彪 13.2075304714
+马克萨 12.1089181827
+水霸 13.900677652
+胡拉 12.1089181827
+程邑 13.2075304714
+县委 8.7245279194
+模拟计算 13.2075304714
+洛尔卡 13.2075304714
+刘哥 12.5143832909
+从献公 12.8020653633
+内部言语 13.900677652
+盼儿 8.98802276624
+宝华山 12.2912397395
+晓行夜住 12.2912397395
+雷喜 13.900677652
+桑杰 11.8212361103
+叶向高 11.9547675029
+浮船坞 12.5143832909
+不当之处 11.4157710022
+格兰 10.3453295905
+工作指南 13.900677652
+水青 12.2912397395
+熊洞里 12.8020653633
+综合性 7.30900391997
+吩嗪 13.2075304714
+航天 7.93453091285
+证券报 6.56634830168
+死拼 11.7034530746
+变废为宝 11.4157710022
+散碎 10.1164880181
+维罗纳 11.9547675029
+天一明 12.1089181827
+面如满月 11.598092559
+玄策 11.9547675029
+越狱 9.98865464655
+石敬瑭 10.3453295905
+当众出丑 13.2075304714
+含到 13.900677652
+苏打 11.0674643079
+邢台县 12.1089181827
+双眼视差 13.2075304714
+潜研堂 13.900677652
+马兄 12.8020653633
+马元 11.1280889297
+作梗 11.1926274509
+尿壶 12.5143832909
+马克 8.5488195185
+马先 12.2912397395
+秦政 11.9547675029
+杨英 12.8020653633
+客客气气 10.1394775363
+马兜 13.900677652
+比卢 13.900677652
+曾向东 13.900677652
+皎月 12.1089181827
+单斜晶系 10.604840786
+铸就 10.0720362555
+提前完成 10.5684731418
+复燃 12.2912397395
+马公 10.8096351986
+雷同 9.62401153296
+三极管 10.7226238216
+酒商 11.8212361103
+雷吉 12.8020653633
+围垦地 13.2075304714
+马具 10.642581114
+马兵 11.3357282945
+马关 10.765183436
+马兰 9.91169360541
+昂纳 13.2075304714
+民诉 13.900677652
+装卸队 12.1089181827
+张兆武 13.2075304714
+脑神经 10.3171587135
+封为贞 13.2075304714
+悠悠的 11.8212361103
+求三拜四 13.900677652
+新斯科舍 11.5027823792
+萨法尔 12.1089181827
+恒源祥 12.8020653633
+寝不成寐 13.900677652
+水集 13.900677652
+刘唐 8.90346537821
+窒息 8.77671367257
+基里巴斯共和国 13.2075304714
+水雾 10.4994802703
+经济昆虫 13.900677652
+泊岸 13.2075304714
+王田 11.598092559
+水雷 8.84443184663
+卡布拉尔 11.8212361103
+棺材瓤子 12.1089181827
+金绍尔 13.2075304714
+七步成诗 13.900677652
+此一时 10.9562386728
+马儿 10.0088573539
+二百多万两 13.2075304714
+年终考评 13.900677652
+硅石 10.0505300503
+五角大楼 10.765183436
+一体机 12.2912397395
+轰倒 13.900677652
+积分学 11.8212361103
+全国青联 13.2075304714
+腰痛 9.82314020807
+额娘 9.19114745066
+瓦尔河 12.8020653633
+砸伤 11.1280889297
+笑人 13.900677652
+阿尔泰山 8.80692745117
+宫壁 13.2075304714
+越王 10.4666904475
+比古 13.900677652
+水阀 13.900677652
+水阁 11.1280889297
+二百余家 12.8020653633
+孙楠 13.2075304714
+精神压力 10.5684731418
+洋墨水 12.5143832909
+阿赫迈德 11.598092559
+厂家 7.72897705456
+比反 13.900677652
+比及 9.62401153296
+圣萨尔瓦多 11.3357282945
+秦文 13.2075304714
+周氏兄弟 12.2912397395
+挖空 11.0103058941
+政资 12.5143832909
+土阿莫土 12.8020653633
+孙楷 13.2075304714
+挖穿 13.900677652
+弗莱克斯 13.900677652
+多元性 12.2912397395
+壮志凌云 11.7034530746
+百八十块 13.900677652
+对应点 11.7034530746
+快热式 13.900677652
+那本 9.06439574502
+科技园区 11.1926274509
+百货业 10.3453295905
+臧否 11.9547675029
+大金国 11.4157710022
+含化 12.1089181827
+颗卫星 10.5684731418
+苏捷 12.5143832909
+西北侧 10.8096351986
+水际 12.8020653633
+搞不定 13.2075304714
+甘新 10.765183436
+德文系 13.900677652
+桑普 13.2075304714
+兄弟二人 9.93038573842
+宋大爷 13.2075304714
+和叔妹 13.2075304714
+腰疼 11.1926274509
+书面报告 10.4349417492
+司马承祯 12.1089181827
+马冲 11.5027823792
+说一是一 12.8020653633
+水险 13.2075304714
+萨默德 13.900677652
+县境 7.49214886092
+核算单位 12.5143832909
+横断山脉 9.19114745066
+靖西 11.4157710022
+领回来 11.598092559
+民族文化宫 12.5143832909
+首尾相接 11.7034530746
+阿坝藏族羌族自治州 11.5027823792
+胡恩 12.1089181827
+马前 9.53122979951
+扣扣 13.900677652
+猿声 13.2075304714
+会稽王 11.8212361103
+研究所里 11.1926274509
+普拉拉 13.2075304714
+哈扎 12.8020653633
+秦春 13.900677652
+黄润甫 11.9547675029
+县学 10.9562386728
+好赖 11.598092559
+蓝光 10.0720362555
+蹿红 11.3357282945
+桑斯 12.1089181827
+特殊要求 10.4041700905
+被面 10.4994802703
+比做 10.1871055853
+请上去 13.900677652
+向忠发 12.2912397395
+酸牛奶 11.598092559
+协和式 12.8020653633
+佛罗伦萨 9.04864738806
+休息痢 13.2075304714
+喜上加喜 12.2912397395
+航寄 13.2075304714
+臧城 12.8020653633
+压倒多数 11.4157710022
+望断 12.1089181827
+师伐楚 12.5143832909
+比值 8.64318227995
+马刀 10.8561552143
+生产总值 7.31037660378
+有所增加 8.56313957227
+间隔 8.05423887692
+鉴赏会 12.5143832909
+苏惠 13.900677652
+塌架 13.900677652
+马列 10.2117981979
+淘淘 11.0674643079
+山色 10.3171587135
+海伦娜 12.2912397395
+攻得 11.9547675029
+铸工 12.8020653633
+望族 10.4349417492
+帕魈宸 13.2075304714
+子姚兴 13.2075304714
+液晶显示 10.9049453784
+核裂变 9.71102290995
+水闸 10.3171587135
+紫金牛 11.8212361103
+马利 11.5027823792
+马制 13.900677652
+凌州 11.7034530746
+望日 11.9547675029
+李清照 10.3453295905
+灯草 11.1280889297
+航宇 11.8212361103
+根据地 7.4023955025
+外倾 11.5027823792
+执法检查 11.7034530746
+哔叽 11.8212361103
+马勃 11.7034530746
+远走高飞 9.93038573842
+居者 10.604840786
+造型师 11.8212361103
+普列托 13.900677652
+流动量 12.2912397395
+胡想 11.598092559
+哈拉 9.74179456862
+落水洞 10.7226238216
+水锈 12.8020653633
+胡八一 10.0294766411
+日银 12.1089181827
+淘洗 10.642581114
+手榴弹 8.4980002701
+病毒灵 13.2075304714
+盖世太保 11.1926274509
+憎厌 12.5143832909
+敲敲 10.2630914922
+玉树 10.4041700905
+爱情价更高 13.2075304714
+刘因 12.1089181827
+样板房 12.2912397395
+体大思精 13.900677652
+说不清 8.59240995457
+刘国 10.604840786
+伊亚德 13.900677652
+千多元 13.900677652
+水锤 11.9547675029
+马勺 9.98865464655
+民行 10.3171587135
+胡惟 10.6818018271
+惠明茶 11.598092559
+水镜 11.7034530746
+宇宙火箭 13.2075304714
+装死 10.604840786
+不动声色 8.64318227995
+袋中 10.0294766411
+越烈 11.0103058941
+窜犯 13.900677652
+营业处 12.5143832909
+哄得 13.2075304714
+立案查处 11.9547675029
+率同 12.8020653633
+吉丁科 12.8020653633
+马力 7.97642185456
+物质享受 11.9547675029
+马加 11.2616203224
+县官 9.5062284973
+否则 6.29230317759
+牛鼻子 11.0103058941
+生擒 9.29550746599
+格林著 13.900677652
+萨法德 13.2075304714
+妙趣 11.8212361103
+韩晓 11.1926274509
+郭祥接 12.5143832909
+溶血性 9.89334446674
+事务部长 12.1089181827
+表格 9.26594866375
+马华 13.900677652
+比兴 10.2897597393
+玉米种子 11.9547675029
+孙毅 13.900677652
+马午 13.2075304714
+堂正 13.900677652
+刘坚 13.900677652
+马南 13.900677652
+厂外 12.8020653633
+淘沙 11.5027823792
+官戴铣 12.8020653633
+水针 11.7034530746
+胡作非为 9.94943393339
+无期徒刑 9.53122979951
+马卜 11.7034530746
+秦末 9.94943393339
+垂落 11.1926274509
+水钻 11.598092559
+马卡 11.2616203224
+郎迁 12.5143832909
+格力 8.47133202302
+吮吸 10.2897597393
+说来惭愧 11.9547675029
+旅费 11.4157710022
+比克 13.2075304714
+什维利 12.8020653633
+唯物辩证法 10.2630914922
+经济主义 12.5143832909
+曾侯乙 10.4349417492
+不疼不痒 11.8212361103
+猪笼草 11.4157710022
+出国前 11.598092559
+打游戏 12.5143832909
+子闻 13.900677652
+整栋 11.9547675029
+财政收入 8.03704647638
+高宗皇帝 13.900677652
+盖戳 13.2075304714
+犄角 9.91169360541
+黑气 9.93038573842
+起动机 13.900677652
+法院 6.86893639321
+小山头 10.8561552143
+格勒 11.1280889297
+含冤 11.3357282945
+水银 9.03314320152
+日销 12.5143832909
+腰眼 11.0674643079
+铁算盘 13.2075304714
+老视眼 13.900677652
+竖穴墓 11.2616203224
+含冰 13.2075304714
+整株 11.3357282945
+山羊胡 12.5143832909
+祀祖 13.900677652
+金灵含 13.2075304714
+资料片 11.598092559
+戥子 11.9547675029
+马匹 7.80260336981
+法难 12.5143832909
+比出 12.1089181827
+上有老 12.8020653633
+孙歆 12.8020653633
+帅府太 13.900677652
+种子消毒 13.900677652
+加德满都 10.7226238216
+边放 12.2912397395
+三毛七孔 13.2075304714
+惠特拉姆 13.2075304714
+淘气 9.4233408375
+遁世 11.598092559
+久演不衰 12.8020653633
+马口 11.3357282945
+马可 9.55687223012
+整棵 12.8020653633
+孙武 9.98865464655
+刘基 10.7226238216
+马号 9.72629038208
+一己 10.1630080337
+敌敌畏 11.3357282945
+装殓 10.0088573539
+八千万法郎 13.2075304714
+博望侯 12.8020653633
+马子 13.900677652
+马司 11.1280889297
+脚蹬 9.66657114738
+纳绸绢 13.2075304714
+马厂 10.7226238216
+游下 13.900677652
+关节轴承 12.2912397395
+人头熟 13.900677652
+无节制 10.9562386728
+风化作用 10.1394775363
+托玛斯 11.9547675029
+统一认识 10.8096351986
+强庄股 12.5143832909
+账单 9.93038573842
+秦某 12.5143832909
+检察长 9.41204128224
+拳拳盛意 13.900677652
+安远县 13.900677652
+松柏类 11.1280889297
+交代罪行 13.900677652
+噩耗 9.84023464143
+马厩 10.6818018271
+法雍 12.8020653633
+有眼如盲 13.900677652
+心潮翻滚 13.900677652
+宣统皇帝 13.2075304714
+洪流 9.22784881751
+淘汰 7.55679721785
+汪丁丁 13.2075304714
+初露峥嵘 12.8020653633
+千佛山 12.5143832909
+固镇县 13.900677652
+武城西 13.2075304714
+挡一挡 12.2912397395
+合议庭 10.8096351986
+清水冲净 13.900677652
+非饱和 13.2075304714
+社情民意 11.4157710022
+化合量 11.8212361103
+教育学家 12.1089181827
+复泳 13.900677652
+黑尔堡 13.2075304714
+塔达峰 13.900677652
+苏纶 12.8020653633
+苏纳 12.1089181827
+种师道 8.2273543848
+胡家那 13.2075304714
+普拉东诺夫 12.8020653633
+一会儿头 13.2075304714
+两亿年 13.900677652
+郎郎 13.2075304714
+乐和乐 13.900677652
+塞莱 13.900677652
+罗丞相 11.7034530746
+一百二十文 13.2075304714
+极夜 11.598092559
+代州 10.6818018271
+盒里 11.1280889297
+比久 13.900677652
+一会儿天 13.2075304714
+加些 11.0103058941
+张允 11.3357282945
+法西 11.7034530746
+有毒 7.20117731181
+比为 8.30596627237
+张鲸双 13.900677652
+苏继 12.5143832909
+万多公里 10.4349417492
+石灰水 10.8561552143
+捕食 8.44963919841
+蹄膀 12.8020653633
+水溶液 8.88339781516
+于夷狄 13.2075304714
+威力侦察 13.2075304714
+天微微 12.1089181827
+陆阳 13.2075304714
+比个 12.2912397395
+英格玛 12.5143832909
+摆事实 13.2075304714
+区声白 13.2075304714
+声气相求 12.8020653633
+苏维 13.2075304714
+精通于 13.900677652
+李过刚 12.2912397395
+苏绰 11.3357282945
+一发发 12.8020653633
+俞鼎孙 13.2075304714
+被褥 8.91707103027
+乐而忘忧 13.900677652
+埃迪沃 13.900677652
+血脑屏障 11.7034530746
+温彻斯特 11.5027823792
+滋滋 11.1926274509
+章钦臣 11.5027823792
+水语 12.2912397395
+比上 7.97909923233
+比下 12.2912397395
+竞技场 10.765183436
+白鹦鹉 11.3357282945
+漫画化 12.8020653633
+龙归 12.1089181827
+衣单食薄 13.2075304714
+胸式呼吸 13.2075304714
+四块 10.2371160058
+译述 11.5027823792
+含义 7.47095817394
+综合类 9.66657114738
+跑上来 10.6818018271
+平元宝 13.2075304714
+胡绳 11.7034530746
+脚踏 8.81308131674
+孙瑜 12.1089181827
+东府珍 12.8020653633
+再上 12.5143832909
+那也好 11.1926274509
+咋呼 11.7034530746
+人民剧场 12.8020653633
+穆祥雄 13.900677652
+邂逅相逢 12.2912397395
+空穴来风 10.0940151622
+借记卡 9.85762638414
+德维湖 13.900677652
+吐蕃 8.3285236198
+戴宗笑 12.1089181827
+淘汰赛 12.1089181827
+压铸机 13.900677652
+广西壮族 11.8212361103
+四千一百二十四箱 13.2075304714
+千万缕 13.900677652
+比什 12.8020653633
+翻完 13.2075304714
+微分学 11.2616203224
+民防 10.8096351986
+比人 10.0720362555
+鄂尔泰 11.0674643079
+散播 10.3743171274
+情深似海 12.8020653633
+多点儿 12.8020653633
+含上 12.1089181827
+顺风 9.29550746599
+清税 13.900677652
+大锅菜 13.900677652
+赴美 9.12155415886
+比京 13.900677652
+四圆 13.2075304714
+蒋心莲 11.8212361103
+四圈 8.1386262692
+千佛岩 11.9547675029
+塞尔维 11.7034530746
+吵骂 12.2912397395
+中国羽毛球 12.5143832909
+西梁女 12.1089181827
+链球 11.598092559
+比亚 10.4666904475
+拈线 12.8020653633
+四场 11.8212361103
+加利福尼亚州大学 13.2075304714
+阿托品 10.5684731418
+谈均田 13.2075304714
+楷体 13.900677652
+封沈王 12.8020653633
+法规 7.11962002604
+孙琳 12.2912397395
+枪杆子 10.5684731418
+多情多义 12.8020653633
+责任能力 11.8212361103
+攀登 9.43476953332
+葛兰素 11.7034530746
+换场 13.2075304714
+四四 12.5143832909
+华中农业大学 11.7034530746
+千万级 13.2075304714
+涤纶厂 12.5143832909
+操舵 11.8212361103
+魏兵抢 13.2075304714
+野火 10.8096351986
+派购 11.8212361103
+止咳 9.84023464143
+养德斋 10.1164880181
+匣钵 12.5143832909
+艳舞 12.8020653633
+苏美 11.7034530746
+比作 9.5062284973
+证券网 7.76295059789
+许帕提 13.900677652
+圣克里斯托瓦尔 12.8020653633
+忍痛割爱 11.1926274509
+杨再兴 12.2912397395
+平衡条件 11.0103058941
+理喻 11.7034530746
+北半球 8.52539924429
+四国 8.81927328699
+若以 8.84443184663
+齐奥塞斯库 11.8212361103
+四因 12.2912397395
+肥猪 11.2616203224
+广州某 10.9562386728
+石灰浆 12.8020653633
+一刷 11.9547675029
+股评家 11.4157710022
+宁海州 13.900677652
+西北区 11.5027823792
+航运权 13.2075304714
+泣血稽颡 13.900677652
+张恭庆 13.2075304714
+杨锋引 13.900677652
+沿途见闻 13.2075304714
+远大于 9.06439574502
+受制于人 10.4994802703
+一刻 7.87481167815
+腰椎 10.0505300503
+落水狗 12.5143832909
+布娃娃 12.2912397395
+脚踩 9.6811699468
+鄂尔浑 10.0505300503
+计算机设备 12.2912397395
+情况有变 11.5027823792
+秦祚 13.2075304714
+天隐子 13.900677652
+车门口 12.8020653633
+洗发膏 13.900677652
+秦祁 12.5143832909
+凤冠霞帔 11.9547675029
+胡编 10.9562386728
+景帝立 13.2075304714
+冷暖空气 11.1926274509
+心不跳 12.5143832909
+一千多部 13.2075304714
+日语 9.65218240993
+咋啦 9.80633308975
+被装 10.5684731418
+马荣起 13.2075304714
+尿毒症 9.63799777493
+含住 11.5027823792
+宋庆龄故居 12.5143832909
+胡翰 13.2075304714
+表皮 8.60737282725
+行政长官 9.44633035572
+可变资本 7.58170953823
+民革 11.4157710022
+长住 10.642581114
+机械论者 13.900677652
+丁得孙 10.533381822
+报停 13.900677652
+物价水平 9.43476953332
+岩茶 11.1280889297
+非线性失 12.2912397395
+复测 13.2075304714
+瓦齐尔 12.1089181827
+止吐 12.5143832909
+出版事业 11.4157710022
+解宝谢 13.2075304714
+晨昏定省 13.900677652
+尉屠耆 13.2075304714
+郎酒 11.9547675029
+黄泛区 9.5186510173
+楷书 9.33632946051
+表相 13.2075304714
+偷偷地 8.83808261895
+地产股 7.63537643924
+被袋 13.900677652
+受田 10.642581114
+汤都西 12.2912397395
+千多个 11.3357282945
+世博会 8.57280148319
+安山质 13.2075304714
+派息日 11.3357282945
+发送量 11.8212361103
+日记 8.47133202302
+复活 8.85725253506
+频频 7.64301006409
+功课 8.79473217808
+表盘 11.8212361103
+取之不尽 10.2897597393
+昂扬 10.1871055853
+法裔 11.2616203224
+越长越 10.2630914922
+不成才 12.8020653633
+散文 7.92941581219
+阿慕尔 13.2075304714
+民需 13.900677652
+实在性 11.5027823792
+耳根子 11.2616203224
+比例 5.35179201383
+赴约 11.2616203224
+衣锦还乡 10.8561552143
+进口设备 13.2075304714
+曾建天 13.2075304714
+代尔 10.765183436
+彼岸花 13.900677652
+日表 13.900677652
+赫梅 12.2912397395
+不平则鸣 13.2075304714
+证券类 9.75754292558
+孙盛 12.2912397395
+容声 12.5143832909
+翻天 10.765183436
+花型 11.5027823792
+季度末 8.00078029839
+幻想力 12.8020653633
+戒严地区 13.900677652
+彻底 6.32817466696
+张玉兽 13.2075304714
+吃药时 13.2075304714
+您瞧 11.2616203224
+清风店战役 12.8020653633
+孙相 12.8020653633
+苏炳文 13.900677652
+报冤 11.598092559
+子关平 12.5143832909
+马滕斯 12.8020653633
+专升本 12.8020653633
+东西长 8.50705010562
+靖难 10.0294766411
+滑膜炎 13.2075304714
+刻钟 12.2912397395
+越江 12.5143832909
+马丁 8.75318317516
+十八式 13.900677652
+马上 5.6981952054
+四喜 10.8096351986
+二百四十六道 13.900677652
+出了门 9.16447920358
+占婆 11.9547675029
+孙皓 10.765183436
+孝义市 12.2912397395
+卧在 11.1926274509
+桑科 10.7226238216
+乐工舞 13.900677652
+巴图鲁 11.8212361103
+成燕粉 13.900677652
+天河石 12.8020653633
+扬国威 13.2075304714
+代征 11.8212361103
+杨锐朗 13.900677652
+室内运动 13.900677652
+韩联社 12.2912397395
+马临 13.900677652
+时荷戈 13.2075304714
+评述 9.6811699468
+秦穆 12.8020653633
+白塞氏 13.2075304714
+挖方 13.2075304714
+言实 13.900677652
+马丽 12.8020653633
+水解 8.85725253506
+马丹 13.2075304714
+危害面 13.900677652
+杜尚别 11.7034530746
+马什 11.598092559
+被评 10.8561552143
+硅栅 13.900677652
+庞丽娜 9.49395840471
+绝处逢生 11.1926274509
+按需分配 11.8212361103
+粟帛 12.1089181827
+格伦 10.8561552143
+代役 10.9049453784
+寇三边 13.2075304714
+谨致谢意 13.2075304714
+散曲 10.1164880181
+镀镍 12.8020653633
+吉丁斯 12.2912397395
+古者圣 12.8020653633
+鬓发 10.0505300503
+决不再 10.8096351986
+踢出去 12.1089181827
+第一炮 11.1280889297
+俞鸿钧 12.5143832909
+日裔 13.2075304714
+赫根 13.900677652
+代录 13.900677652
+高原病 11.8212361103
+扶优扶强 13.900677652
+法诺 12.2912397395
+那娇秀 12.5143832909
+马二 12.8020653633
+异想 12.5143832909
+一百二十条 13.2075304714
+保唐僧 10.0088573539
+法语 8.56795885871
+赖众兄弟 12.8020653633
+垄作 11.8212361103
+邵明 13.2075304714
+制片方 11.8212361103
+马云 9.29550746599
+轻巡洋舰 12.5143832909
+人不可貌 11.4157710022
+马亚 10.1871055853
+长春新碱 11.7034530746
+子陵滩 13.900677652
+水西 12.2912397395
+叶先生 13.2075304714
+王敬堂 11.0103058941
+李可夫 11.9547675029
+怒火万丈 13.900677652
+康熙帝 9.56994431169
+巳时 9.85762638414
+世易时移 13.900677652
+董瑶阶 12.8020653633
+和杏山 12.8020653633
+萧颖 13.900677652
+收货人 12.8020653633
+齐崭崭 11.9547675029
+格位 13.900677652
+卵泡 10.1164880181
+普罗迪 13.900677652
+袋口 11.8212361103
+民间 6.13341365522
+带头作用 12.2912397395
+水袖 11.0674643079
+韩国三星 12.8020653633
+哈罗 10.3171587135
+百姓家 11.0103058941
+日西 13.2075304714
+三晚 12.2912397395
+散板 11.9547675029
+水袋 13.2075304714
+越洋 12.5143832909
+欲盖弥彰 11.1926274509
+装装样子 12.5143832909
+无愧 10.3743171274
+结党营私 10.7226238216
+望风响应 13.2075304714
+隔坨区 13.900677652
+垄亩 12.8020653633
+沆瀣一气 11.0103058941
+皇子 8.65365357982
+海因里希 10.4041700905
+由玉儿 13.900677652
+霍奇金 11.3357282945
+战败 7.83456956187
+王浑愧 12.8020653633
+碧波万顷 11.5027823792
+四哥 8.42421410004
+李百万 13.900677652
+容姐 13.2075304714
+告警 9.91169360541
+分散主义 13.900677652
+贫困落后 12.2912397395
+架满 13.900677652
+狄慈根 12.1089181827
+首尾相继 13.900677652
+痼疾 10.3171587135
+水溶溶 13.900677652
+马伊 12.8020653633
+荣启期 13.900677652
+获得者 9.04864738806
+整形外科 11.1926274509
+若于 12.8020653633
+不成想 11.4157710022
+美洲地区 12.5143832909
+马休 12.8020653633
+整理 6.30428534791
+越浅 13.900677652
+敲碎 11.0103058941
+增加出口 10.8096351986
+友好往来 10.4349417492
+派车 12.2912397395
+什邡县 13.900677652
+马伦 13.2075304714
+周边城市 11.598092559
+九块 12.5143832909
+方生方 13.2075304714
+扒土 13.2075304714
+铜绿色 13.2075304714
+枸橘 13.900677652
+黄河集团 11.0674643079
+发飘 12.5143832909
+藏医 10.9562386728
+瑞波 13.900677652
+轻拍 10.4666904475
+手下人 8.56795885871
+再于 11.8212361103
+钱慧安 13.2075304714
+居养静 13.2075304714
+四员 10.2117981979
+马俊 13.2075304714
+柴进教 13.2075304714
+所到之处 9.22784881751
+力量型 13.2075304714
+局部 6.66577923166
+告诉 5.02009212887
+血债 11.1280889297
+料想不到 10.642581114
+盆儿 12.5143832909
+交公 12.1089181827
+伏特加 11.1926274509
+四味 13.2075304714
+千钧之重 13.900677652
+惺惺作态 12.1089181827
+非核心 10.8561552143
+社会沙文 12.1089181827
+日规 13.900677652
+翻墙 10.8561552143
+日见 9.66657114738
+祖右社 12.5143832909
+四呼 12.5143832909
+秦简 11.5027823792
+两峰 11.0103058941
+肌肉疲劳 13.2075304714
+满巷 12.8020653633
+四周 6.58679082034
+梅梅正 12.5143832909
+孙眉 11.8212361103
+四向 11.9547675029
+华兴会 10.9562386728
+述异记 12.5143832909
+乌江流域 13.2075304714
+胆色 10.9562386728
+制酸剂 13.900677652
+成熟期 9.59661255877
+近似值 10.5684731418
+放爆竹 12.8020653633
+张守敬 10.765183436
+四合 10.3743171274
+散架 10.604840786
+四名 9.11318590919
+敲破 11.8212361103
+聊斋志异 10.5684731418
+那兀颜 12.2912397395
+匹敌 10.3743171274
+西北军 10.0720362555
+行走不便 12.8020653633
+代币 13.2075304714
+挤过来 11.1926274509
+越深 10.0505300503
+收藏 7.56031834825
+房屋设计 13.2075304714
+水表 11.3357282945
+净利润率 11.0674643079
+徐刚 11.9547675029
+四吨 13.900677652
+特征分析 11.9547675029
+一动 7.69611988941
+水衡 12.5143832909
+卧具 11.5027823792
+天主堂 10.8561552143
+四发 11.8212361103
+四叔 9.27570483869
+闻鹤 13.900677652
+无意 7.69410172525
+龙虎榜 9.48183704418
+山草 11.8212361103
+铺面房 12.8020653633
+真金不怕火炼 12.8020653633
+超标准 11.1926274509
+霍夫特 12.8020653633
+西宽东 11.9547675029
+自做主张 12.2912397395
+四台 10.6818018271
+四号 10.765183436
+复检 8.43261751084
+水边 9.00283785202
+提拔任用 13.2075304714
+质量守恒 12.5143832909
+崇桢 11.0103058941
+出门儿 12.8020653633
+四口 9.82314020807
+芽豆 12.8020653633
+接受 5.22426095501
+四句 9.13850371718
+语言不清 12.8020653633
+四只 8.73589167805
+荷兰文 12.5143832909
+大庄园 11.4157710022
+海瑞公园 12.8020653633
+主导力量 9.87532596124
+硅藻土 10.3453295905
+中等学校 10.9562386728
+阳黄柏 13.2075304714
+夏伯昆 13.2075304714
+越橘 12.2912397395
+孙炎 12.2912397395
+耶鲁大学 9.34680076038
+挖掉 10.9049453784
+橄榄 9.19114745066
+投到 9.04086524761
+水运 7.9526426628
+财经部 13.900677652
+邵悌 12.8020653633
+民用飞机 10.642581114
+居高 11.1280889297
+漂过来 12.2912397395
+挖掘 7.21606592431
+南北向 9.0884932966
+得法 10.5684731418
+朱瑞 11.1280889297
+容庵 12.5143832909
+前半晌 12.1089181827
+粒屑 12.5143832909
+魏大炮 11.1926274509
+雅库茨克 12.5143832909
+做好事 10.0940151622
+渊深 11.3357282945
+被贬 9.63799777493
+段接枝 13.2075304714
+纪念碑 8.66956903512
+容庚 11.7034530746
+变得复杂 10.9049453784
+李井泉 12.8020653633
+皮包骨头 11.0103058941
+乾隆皇帝 10.8561552143
+巴厘虎 13.2075304714
+唐语林 13.2075304714
+全面实现 10.604840786
+往还于 13.900677652
+靖逆 12.2912397395
+武装到牙齿 11.3357282945
+图尔 10.4041700905
+表现 4.4954286077
+观沧海 13.900677652
+代奥 12.5143832909
+违礼 13.900677652
+四千 9.91169360541
+四十 8.64318227995
+万国表 13.2075304714
+几十千米 10.7226238216
+抗药性 10.604840786
+科夫 9.7898037878
+百分之二三 12.5143832909
+李春明 13.900677652
+络头 12.8020653633
+后天免疫 13.2075304714
+翻得 11.1280889297
+顺旨 12.5143832909
+宗会 12.1089181827
+黄安 8.94485059437
+原子反应 13.900677652
+里程计 12.8020653633
+逆温层 11.0674643079
+绝无此意 12.5143832909
+无言以对 10.0720362555
+重迭 11.8212361103
+敬天爱 13.900677652
+雅鲁藏布江大峡谷 12.8020653633
+豺狼当道 13.900677652
+势单力孤 12.2912397395
+表率 9.58318953844
+物尽其用 11.4157710022
+白骨精 11.1926274509
+复校 10.9049453784
+四化 11.5027823792
+地下管道 11.5027823792
+孙维世 13.2075304714
+纳资代 12.2912397395
+涌浪 11.3357282945
+投劳 12.8020653633
+鬼鬼崇崇 13.900677652
+间谍 9.15574552361
+四包 12.2912397395
+复根 13.900677652
+复核 9.94943393339
+代夏 13.2075304714
+油藏 11.4157710022
+弓注矢 13.2075304714
+涌流 10.2630914922
+成熟性 12.8020653633
+四匹 10.4041700905
+渊海 13.900677652
+乐舞 9.72629038208
+约瑟夫 9.5186510173
+水轮 10.3453295905
+阿美士 12.1089181827
+细细长长 13.2075304714
+阶石 12.5143832909
+手不释卷 12.1089181827
+山药 9.41204128224
+不成材 11.7034530746
+水车 10.2897597393
+滥官污吏 12.1089181827
+罪魁 12.1089181827
+守规矩 11.598092559
+颚足 11.7034530746
+都拥兵 13.2075304714
+公牛队 13.900677652
+桑纳 12.1089181827
+间距 8.98802276624
+快睡吧 12.2912397395
+青纱帐 11.4157710022
+散慢 13.2075304714
+辛辛苦苦 9.34680076038
+田际云 12.2912397395
+合作现象 13.900677652
+整版 11.4157710022
+信贷部 11.5027823792
+中子星 10.3171587135
+国家主权 9.41204128224
+孙燕 11.4157710022
+粗粒度 13.900677652
+架梁 12.2912397395
+独立词 13.900677652
+容忍 8.65893063692
+均窑 12.2912397395
+文艺部 13.2075304714
+肖潇 9.5062284973
+白领阶层 11.4157710022
+郭祥抢 13.2075304714
+男客人 13.900677652
+曹可凡 13.900677652
+银光闪闪 11.1280889297
+李化龙 12.8020653633
+千尊 12.8020653633
+胡答 13.2075304714
+泥菩萨 11.598092559
+管壁增 12.8020653633
+那画儿 12.8020653633
+制造舆论 11.1280889297
+谏壁镇 13.2075304714
+闺中 10.6818018271
+告负 11.9547675029
+桂枝汤 11.9547675029
+投医 12.1089181827
+单姓谷 13.900677652
+一干二净 9.65218240993
+悬臂梁 12.8020653633
+胡笳 11.5027823792
+渊泉 13.900677652
+顾双凤 11.5027823792
+楚米扬 12.1089181827
+可计算性 11.2616203224
+会元 13.2075304714
+法象 11.9547675029
+刘武周 12.8020653633
+王秉真 10.3453295905
+卧倒 10.533381822
+色厉胆薄 13.900677652
+颂扬 9.24671730182
+十六亿吨 13.2075304714
+理出 11.0103058941
+告贷 12.5143832909
+很不简单 12.2912397395
+井木犴 11.2616203224
+驱使 8.74738605748
+涌泉 10.604840786
+脾气好 11.8212361103
+满头大汗 9.53122979951
+兴奋异常 11.2616203224
+总重量 10.4666904475
+郭祥抱 12.8020653633
+旧地重游 11.5027823792
+吮乳 13.900677652
+容得 10.533381822
+人民共和国 9.44633035572
+昂昂 11.4157710022
+顾先生 11.1280889297
+胡说乱道 12.8020653633
+鸣锣开道 13.2075304714
+扒出 11.7034530746
+罗摩笈 12.5143832909
+血气方刚 11.1926274509
+狂涛巨浪 12.8020653633
+太坦神 11.4157710022
+正有此意 12.5143832909
+收获 7.35102690974
+医学士 12.8020653633
+卫戍区 11.598092559
+崔呈秀 11.9547675029
+雨丝风片 13.2075304714
+寻索 13.2075304714
+白石道人 11.598092559
+油纸伞 11.2616203224
+乌黑亮丽 13.2075304714
+泽尔士 13.2075304714
+彻夜 9.89334446674
+高平市 13.900677652
+抓来 10.1394775363
+日进 11.4157710022
+各忙各 11.2616203224
+瓦努阿 13.2075304714
+四副 13.900677652
+输入额 13.900677652
+开辟通路 11.9547675029
+波澜起伏 11.598092559
+四列 12.8020653633
+架桥 8.63798746307
+投去 10.2897597393
+军事院校 11.1926274509
+有机质 8.9519177616
+翻建 11.9547675029
+四则 11.8212361103
+李春来 9.91169360541
+拆迁户 10.533381822
+张榜公布 12.8020653633
+容弹 11.2616203224
+学田 13.900677652
+日达 12.1089181827
+四分 9.80633308975
+功过 10.0720362555
+理光 13.2075304714
+以身试法 11.5027823792
+随机变量 10.0720362555
+日辰 13.2075304714
+水田 8.70218062071
+曲苑 13.900677652
+未完待续 11.9547675029
+砸坏 10.9049453784
+制品厂 11.8212361103
+急不择言 12.5143832909
+大龙潭 13.2075304714
+廿六 13.900677652
+操蛋 11.9547675029
+舍身崖 12.2912397395
+高邮市 13.2075304714
+郎大佐 13.900677652
+阳离子 9.77354326693
+间质 9.89334446674
+奚国华 11.8212361103
+延烧到 13.900677652
+恤金 13.2075304714
+居民小区 10.8561552143
+萨利赫 10.4349417492
+军令部 12.8020653633
+刘乃 13.2075304714
+随人俯仰 13.900677652
+阻滞剂 11.1926274509
+举世无匹 13.900677652
+一会儿开 12.1089181827
+消炎痛 11.598092559
+步行者 12.1089181827
+民妇 13.900677652
+越格 11.9547675029
+篷帆 13.2075304714
+篷布 11.9547675029
+卵核 12.5143832909
+托儿所 11.1280889297
+静下心来 10.3743171274
+四出 9.55687223012
+夏惠宗 11.7034530746
+素愿 13.2075304714
+暇日 12.8020653633
+礼包 11.0674643079
+硅油 11.4157710022
+篷帐 13.900677652
+散打 9.20932976975
+会典 10.8096351986
+电脑配置 13.900677652
+利丰 10.765183436
+身在江湖 12.8020653633
+代宫 13.900677652
+白俄罗斯 9.20019728618
+根本法 10.9049453784
+朱琰 12.5143832909
+越桔 11.9547675029
+刘七 12.8020653633
+刘一 12.8020653633
+刘万 13.900677652
+助困 12.5143832909
+法晋唐 13.900677652
+沈国放 11.598092559
+腹胀满 11.598092559
+刘东 10.7226238216
+纪实文学 12.1089181827
+中国科学院生物学部 13.2075304714
+孝顺父母 13.2075304714
+百分之八十五 13.900677652
+散户 7.37125881371
+农牧林 12.1089181827
+北京军区 10.7226238216
+四册 12.2912397395
+散戏 12.5143832909
+中欧国家 13.900677652
+一个六十多岁 13.2075304714
+伺服电机 13.900677652
+笨嘴笨舌 13.2075304714
+川楝 11.9547675029
+水路 8.37124856446
+布二司 13.2075304714
+刘丽 11.0103058941
+忆良 13.2075304714
+代宗 10.642581114
+咋办 8.74738605748
+栈桥 10.765183436
+连二赶三 11.9547675029
+架次 10.7226238216
+释法 13.900677652
+鞭长莫及 10.7226238216
+四党 13.2075304714
+傍若无人 12.5143832909
+刘仁 12.8020653633
+赫氏 12.5143832909
+邓泽如 13.2075304714
+四元 10.4041700905
+别由 12.8020653633
+送还 9.72629038208
+鱼贯而 11.7034530746
+秦纪 13.2075304714
+理到 13.900677652
+陪你去 10.9562386728
+四具 11.5027823792
+存栏数 11.0674643079
+产婆 12.2912397395
+文安县 11.8212361103
+桩子 11.598092559
+提示音 12.5143832909
+赢人 13.2075304714
+水质 8.40350942668
+刘仲 12.8020653633
+水货 10.8561552143
+谢香如 13.900677652
+能源管理 11.7034530746
+洛斯阿拉莫斯 13.2075304714
+冤假错案 11.1926274509
+刘二 10.8561552143
+涌潮 10.9562386728
+堵施蛮 12.5143832909
+于光 11.9547675029
+尸居余气 13.900677652
+塌缩 13.2075304714
+刘亚 12.2912397395
+二百多两 13.900677652
+颅底 11.9547675029
+霍博肯 13.2075304714
+科雷希 12.8020653633
+先后顺序 10.765183436
+举世无双 10.8561552143
+刘京 13.2075304714
+三聚氰胺甲醛树脂 12.8020653633
+柳叶 10.1871055853
+喀什地区 11.2616203224
+禁受住 13.2075304714
+椰汁 12.5143832909
+乐者 13.2075304714
+矿物纤维 12.8020653633
+孙爷 13.900677652
+乐至 12.2912397395
+拉姆齐 11.1280889297
+牙龈炎 13.2075304714
+乳化剂 10.1164880181
+帕尔姆岛 13.900677652
+棕榈园 13.2075304714
+莱亚尔 12.8020653633
+鸡血藤 12.1089181827
+杨怡 13.2075304714
+尚小云 11.3357282945
+飞雁 12.5143832909
+投入 5.92133875671
+塞蒂 11.598092559
+居首 9.34680076038
+水貂 10.765183436
+房辑佚 11.9547675029
+雷丸 13.900677652
+苏福 12.8020653633
+党纪国法 10.9562386728
+萨拉热窝 10.8096351986
+胡祈 13.900677652
+苏禄 11.3357282945
+理县 11.5027823792
+柬埔寨王国 12.5143832909
+化学反应 8.20358416547
+容川 12.5143832909
+楚归汉 12.8020653633
+视觉器官 11.4157710022
+刘佳 11.0674643079
+雷丝 13.900677652
+雷东 11.9547675029
+从官寨 12.5143832909
+万头攒动 10.765183436
+孙玉 11.3357282945
+理发 10.0940151622
+国徐整 13.2075304714
+键位 13.900677652
+人迹罕至 10.4041700905
+苏秦 10.1394775363
+日货 10.9562386728
+迟慢 11.598092559
+名留青史 12.8020653633
+巴尔扎克 10.1871055853
+一区 10.4666904475
+日费 12.2912397395
+刘伟 10.2117981979
+收腹 11.2616203224
+欺世 13.2075304714
+专属经济区 10.1164880181
+庆典活动 11.2616203224
+雷乃 11.9547675029
+刘伯 12.8020653633
+里程表 11.9547675029
+梅塞德斯 11.3357282945
+瑞金医院 13.2075304714
+旅长 9.29550746599
+踢起 11.8212361103
+兴衰史 12.5143832909
+统收 13.900677652
+吉文衮 13.2075304714
+刘伶 10.9049453784
+宣政殿 12.2912397395
+喷射泵 13.900677652
+刘俊 10.5684731418
+杜尚在 13.900677652
+异花传粉 11.598092559
+萎蔫 12.5143832909
+磷酸二氢钙 13.900677652
+理化 9.55687223012
+投出 10.5684731418
+胡明复 13.900677652
+沙岛群 13.900677652
+连部 10.3453295905
+新爱尔兰 13.2075304714
+三枚 10.604840786
+形式逻辑 10.4994802703
+法身 10.9049453784
+刘保 13.2075304714
+吉尔德 12.8020653633
+地理学史 11.7034530746
+闻云长 12.8020653633
+布兹嘎 12.8020653633
+高端 7.14723973338
+迭创新高 10.604840786
+磷酸二氢钾 11.8212361103
+高射炮弹 13.900677652
+瑞格 13.2075304714
+独立战争 9.04864738806
+悠久 8.41173992582
+胡秉 10.4041700905
+水谷 10.5684731418
+东西部 10.3171587135
+外国法 12.1089181827
+斩尽杀绝 10.642581114
+一半 6.09398127945
+工作日内 9.63799777493
+雷云 13.2075304714
+公安分局 9.6811699468
+圣安东尼奥 11.5027823792
+毕马威 11.8212361103
+磷酸二氢钠 13.2075304714
+吕纯阳 13.900677652
+女娲补天 11.9547675029
+告辞 7.8161782389
+晁天王 10.7226238216
+遗觉象 12.8020653633
+斯特潘 13.2075304714
+价目 13.900677652
+表达方式 10.4994802703
+赶不回来 12.2912397395
+国家环保局 13.2075304714
+碰见 8.7245279194
+通臂拳 13.900677652
+捏把冷汗 12.5143832909
+调试程序 12.8020653633
+中胡 13.2075304714
+抽肥补瘦 12.8020653633
+晋武公 13.2075304714
+翻天覆地 10.0088573539
+努瓦迪布 13.900677652
+千龙网 9.6811699468
+张镐 13.2075304714
+殴击 12.8020653633
+投军 10.0294766411
+整点 9.98865464655
+杰佛逊 12.8020653633
+磷酸二氢铵 12.8020653633
+嗜好 9.21854642485
+羊质虎皮 13.2075304714
+说不着 11.0674643079
+实战经验 10.3743171274
+碰触 11.8212361103
+洪水猛兽 10.4666904475
+苏祗 12.2912397395
+环境模拟 13.2075304714
+但他却 9.84023464143
+沪宁线 11.7034530746
+朱孟春 9.5186510173
+哈瑙 12.8020653633
+砖壁 13.900677652
+换上去 13.2075304714
+方声洞 13.2075304714
+高平县 12.5143832909
+剧作家 8.21031819765
+阳郡治 11.9547675029
+工联主义 11.9547675029
+仓促间 11.7034530746
+龙虎斗 11.8212361103
+胡白 13.2075304714
+风雨同舟 11.1280889297
+韩素音 12.8020653633
+越显 11.9547675029
+二百八十本 13.2075304714
+贱买贵卖 11.5027823792
+平家物 12.1089181827
+憧憧 11.2616203224
+水莲 13.900677652
+高平原 10.604840786
+杨潮观 12.5143832909
+灵明 13.2075304714
+政风 11.3357282945
+越是 7.63158136827
+擂台 11.1926274509
+甩到 11.0103058941
+四快 13.2075304714
+苏皖 10.9562386728
+唐末天 13.900677652
+景天科 12.1089181827
+厂主 10.765183436
+刘彻通 13.2075304714
+翻印 11.9547675029
+翻卷 10.642581114
+猿人 10.1164880181
+日航 12.2912397395
+整编 9.5186510173
+赫拉 10.3171587135
+高邮县 12.5143832909
+纵深处 12.2912397395
+春蚕 10.8561552143
+麦克弗森 12.5143832909
+一百万贯两匹 13.2075304714
+小事儿 11.1926274509
+金盆洗手 10.9562386728
+无情地 9.43476953332
+散水 12.2912397395
+黄宽重 13.2075304714
+塞诺 12.2912397395
+形同 10.1871055853
+突发奇想 11.1926274509
+不诚实 12.2912397395
+代善 10.9049453784
+退向 10.9562386728
+牙婆 13.900677652
+投师 12.2912397395
+停板 12.2912397395
+转归 10.3171587135
+客轮 10.0720362555
+对不上 10.9562386728
+投币 12.8020653633
+司苑 13.2075304714
+师氏 11.7034530746
+罗兀城 13.2075304714
+丢卒保车 11.8212361103
+油泵 11.1926274509
+同酬 13.900677652
+排得 11.0103058941
+方镁石 13.2075304714
+湖州人 11.2616203224
+咳喘 10.6818018271
+广州湾 10.604840786
+丰姿绰约 13.900677652
+让蒂尔港 13.900677652
+快如闪电 12.1089181827
+危急情况 11.9547675029
+两百公里 13.900677652
+三架 10.6818018271
+身手不凡 11.598092559
+宾客 8.73019365694
+几时 8.30225569298
+海德尔 11.7034530746
+日苏 12.5143832909
+复摆 11.9547675029
+斯维里 13.2075304714
+一亿一千多万 13.900677652
+小龙女 12.5143832909
+心血瘀阻 12.2912397395
+嚣然 12.2912397395
+从头做起 13.2075304714
+相对论性 11.598092559
+晋公子 12.5143832909
+站上去 12.1089181827
+版权所有 10.0088573539
+一卷 8.45825994145
+烤全羊 12.2912397395
+红二军团 11.3357282945
+水荒 12.1089181827
+价廉物美 10.765183436
+剧艺社 11.7034530746
+邵氏 11.7034530746
+四开 11.598092559
+水草 8.53003962385
+转盘式 13.2075304714
+幼稚园 11.8212361103
+漫画家 11.1280889297
+托兰德 12.5143832909
+生机勃勃 10.3743171274
+士林区 12.2912397395
+四强 10.8096351986
+黑泉 12.2912397395
+吉子玉 11.598092559
+柳巷 12.8020653633
+动力装置 8.45825994145
+赫扬 13.2075304714
+分泌物 8.53003962385
+搬起 10.2897597393
+散沙 12.8020653633
+江泰新 12.5143832909
+搬走 9.23723855786
+整群 13.2075304714
+双重人格 12.5143832909
+控制策略 11.5027823792
+柳工 10.4041700905
+水荡 12.5143832909
+王国生 13.900677652
+邓军挥 13.2075304714
+复旧 10.3743171274
+翻到 9.87532596124
+松弛法 13.900677652
+翻刻 10.9049453784
+深综指 10.7226238216
+建设祖国 12.8020653633
+汨罗市 12.5143832909
+泡杯茶 12.8020653633
+龚定敬 13.2075304714
+沆瀣 13.2075304714
+越有 11.3357282945
+窗台上 9.89334446674
+议员团 13.2075304714
+强烈推荐 10.1630080337
+频遭 11.1280889297
+蓊郁 11.7034530746
+大夏河 11.0103058941
+无性 10.1630080337
+三束 12.8020653633
+价码 10.4349417492
+水芹 13.2075304714
+乐进 10.4666904475
+野性美 13.2075304714
+沉住气 10.4994802703
+贿金 12.8020653633
+水花 9.55687223012
+综合症 10.0720362555
+无怪 11.1280889297
+法者 11.598092559
+江川县 13.900677652
+无怨 10.604840786
+对不住 9.59661255877
+山太保 8.89004235788
+四库 11.3357282945
+万能论 12.8020653633
+安徽医科大学 13.2075304714
+投弹 10.0088573539
+收车 13.2075304714
+中学部 13.900677652
+几秒钟 9.65218240993
+宋武帝 11.9547675029
+乐达 12.5143832909
+侍宗爱 12.8020653633
+抑制剂 9.71102290995
+每逢 8.20694551317
+水苏 12.8020653633
+立和林 13.2075304714
+复新 12.8020653633
+容县 11.2616203224
+恳亲会 13.900677652
+古邳镇 13.2075304714
+活鱼 10.642581114
+复方 9.66657114738
+收载 11.1926274509
+越权 9.74179456862
+宜嗔宜喜 13.900677652
+望城县 12.8020653633
+停尸间 13.900677652
+瑞曼 13.900677652
+吉尔克 12.8020653633
+千万盏 13.2075304714
+没有防备 11.2616203224
+医学部 11.4157710022
+先露 11.7034530746
+卧射 13.2075304714
+四座 10.0088573539
+理工 9.23723855786
+古装戏 11.8212361103
+越来 11.2616203224
+行百里者半九十 13.2075304714
+乐辉 13.900677652
+内控 9.71102290995
+数据压缩 11.598092559
+高竿 11.9547675029
+水舞 13.900677652
+管道网 12.5143832909
+副研究员 9.6811699468
+四幕 13.2075304714
+瑞星 12.2912397395
+散淡 10.9049453784
+整经 11.7034530746
+瑞昌 11.0674643079
+花沙纳 12.8020653633
+四幅 11.0103058941
+飘风 12.5143832909
+整组 13.900677652
+翻动 9.7898037878
+一厘 10.1164880181
+络合 10.3743171274
+跟定 10.9049453784
+嵇康 10.0940151622
+四年 6.59952984612
+刃口 11.9547675029
+一行行 11.0674643079
+四幢 13.2075304714
+动不动 8.58255765813
+领导全党 11.9547675029
+宗显庆 12.1089181827
+三杆 12.8020653633
+增城市 12.2912397395
+刘转运 11.2616203224
+圆满成功 10.2897597393
+练好 11.0674643079
+痰气 12.2912397395
+颅内 9.71102290995
+抽点 11.9547675029
+机加工 12.5143832909
+间脑 10.4994802703
+常书鸿 12.1089181827
+一半多一点 12.8020653633
+日莲 12.2912397395
+张锡 11.8212361103
+格调 9.06439574502
+代名 12.8020653633
+收过 10.3171587135
+投得 12.2912397395
+想得美 11.8212361103
+水色 9.85762638414
+隆福寺 9.80633308975
+高射炮兵 11.2616203224
+淘空 13.900677652
+转引 9.80633308975
+瑞普 13.2075304714
+增效剂 12.5143832909
+颜福庆 13.2075304714
+帝汶岛 11.5027823792
+永无休止 11.9547675029
+四席 11.3357282945
+尹礼 12.8020653633
+桩基 11.9547675029
+理应 8.34384959028
+添入 12.1089181827
+功耗 10.2630914922
+间苗 11.598092559
+抢劫犯 11.9547675029
+四川 6.15049348972
+工业污染 10.9049453784
+吃不得 10.6818018271
+甩袖子 11.8212361103
+雍容大度 11.5027823792
+有机化学家 12.2912397395
+柳开 12.8020653633
+子康王 12.1089181827
+昼长夜短 12.8020653633
+瑞文 13.900677652
+哈登 13.2075304714
+储望华 13.2075304714
+晋中市 12.5143832909
+湿渌渌 11.8212361103
+哈钦森 11.598092559
+和建康 12.8020653633
+胡瑗 11.9547675029
+瑞斯 11.3357282945
+孙绰 12.5143832909
+胡瑛 13.2075304714
+代垫 11.7034530746
+牵拉着 12.8020653633
+卷纬 12.8020653633
+共培养 13.900677652
+航标灯 11.4157710022
+苏瓦 11.598092559
+喷油泵 13.900677652
+孔明随 12.8020653633
+多亿吨 10.4349417492
+许奉 13.900677652
+伯灵顿 11.0674643079
+胡琴 10.1630080337
+搬运 8.28390655431
+秦牧 12.2912397395
+价签 13.2075304714
+器材厂 11.4157710022
+审美感受 12.5143832909
+塞规 13.900677652
+搬进 9.11318590919
+扑进来 12.2912397395
+喜上眉梢 11.0103058941
+代型 12.8020653633
+科堡 12.2912397395
+施洗约翰 12.8020653633
+真性情 12.1089181827
+人事关系 11.1280889297
+眩晕 8.98069672615
+多边条约 11.4157710022
+小地主 11.1280889297
+烤乳猪 13.900677652
+泼冷水 10.642581114
+围过来 10.1394775363
+卧式 10.3453295905
+投射 9.17328983326
+眼眉 12.1089181827
+强击机 10.1871055853
+徽章 10.4349417492
+暮色苍茫 11.1926274509
+营房 9.74179456862
+水脚 12.5143832909
+不稳固 9.0884932966
+零组件 13.900677652
+第五十二章 11.3357282945
+以小人之心 12.5143832909
+大醉侠 13.900677652
+小龙子 12.5143832909
+宣王命 11.8212361103
+伊拉克人 11.4157710022
+左伊育 13.2075304714
+气不气 13.900677652
+热泪盈眶 9.5062284973
+管梅谷 13.900677652
+诗词曲赋 13.900677652
+贵宾版 12.2912397395
+架有 11.9547675029
+终席 13.2075304714
+腐朽没落 12.5143832909
+间色 12.5143832909
+根本性 8.50705010562
+雷斯皮 12.8020653633
+汉璇存 12.8020653633
+元嗣圣 13.2075304714
+卷纸 12.5143832909
+胡瓜 11.8212361103
+如水般 13.900677652
+乐谱 10.3743171274
+眯起来 11.9547675029
+翻出 9.20932976975
+独立营 12.1089181827
+隋末唐 11.8212361103
+塞尔瓦 13.900677652
+阿里斯蒂德 12.1089181827
+降半旗 13.2075304714
+瞅见 9.54396882529
+亚特兰大奥运会 13.900677652
+武强县 13.2075304714
+招远县 12.2912397395
+挖洞 10.2117981979
+功能 5.51177248086
+架杆 12.8020653633
+操观 12.2912397395
+少年老成 12.5143832909
+赫恩 12.8020653633
+复明 10.3453295905
+白玉 9.27570483869
+广电总局 9.93038573842
+半表半里 12.1089181827
+军邮 11.9547675029
+磁通量 10.6818018271
+龟背 10.8561552143
+封门 10.9562386728
+中国预防医学科学院 12.8020653633
+复星 9.7898037878
+可逆过程 10.4994802703
+守旧派 10.4994802703
+各有所职 13.900677652
+孙翊 12.5143832909
+埃文斯 11.4157710022
+理得 12.1089181827
+真空管 10.9562386728
+潇湘晨报 10.8096351986
+伊特拉 11.7034530746
+收贮 11.1926274509
+文肇求 13.2075304714
+浮皮潦草 13.900677652
+唐改其 12.8020653633
+法航 13.900677652
+收费 7.45654639528
+缩聚反应 11.8212361103
+靠边走 13.900677652
+中江县 12.8020653633
+喉咙痛 12.5143832909
+水肿 8.230796729
+四峰 13.900677652
+水肺 10.4349417492
+挖泥 12.2912397395
+孙燕姿 13.2075304714
+熔铸工 13.900677652
+美苏关系 12.8020653633
+陈宏绪 13.900677652
+厄瓜多尔 9.19114745066
+宝坻县 11.598092559
+氙气 10.6818018271
+证券行情 12.8020653633
+抚摸 8.07173203437
+小阿敏 13.900677652
+水肥 11.8212361103
+刃具 12.2912397395
+翠缕 11.1280889297
+翻倍 9.15574552361
+散漫 10.0294766411
+双回路 12.8020653633
+麻林 12.2912397395
+脾气坏 12.8020653633
+挂名夫妻 13.2075304714
+四岛 13.2075304714
+郝大通 12.5143832909
+洪积扇 9.85762638414
+敷衍塞责 12.1089181827
+何生亮 12.2912397395
+墨荷 9.4233408375
+收走 11.1926274509
+乐趣 8.61241062128
+四岁 9.91169360541
+收起 8.77077893705
+往上升 11.8212361103
+挖沟 10.7226238216
+必然规律 12.5143832909
+县丞 10.8561552143
+水能 8.40350942668
+拉文纳 11.5027823792
+理念 7.05586217277
+甩动 11.7034530746
+鄂博矿 12.1089181827
+操行 11.7034530746
+一句 5.39232340923
+屋内 8.77671367257
+却是 5.77238748037
+扒开 9.5186510173
+县上 8.56313957227
+奥西诺 13.900677652
+混频器 12.5143832909
+沃岛 13.2075304714
+居间 10.2371160058
+县份 9.33632946051
+谢尔宾 12.8020653633
+旅馆 8.74162235276
+耻居王后 13.900677652
+趁便 11.1280889297
+四层 10.4994802703
+幸禾宓 13.2075304714
+变速运动 13.2075304714
+漂出 13.900677652
+日臻 10.9562386728
+刘知远 10.4994802703
+四届 9.29550746599
+县令 8.66956903512
+城厢镇 12.5143832909
+素可泰 11.3357282945
+国内首创 11.2616203224
+表演性 11.3357282945
+作威作福 10.4666904475
+越方 12.5143832909
+复权 9.98865464655
+复杂 5.83950629228
+出自内心 12.1089181827
+潮汐通道 13.900677652
+打白条 12.8020653633
+连小学 13.2075304714
+袋子 9.26594866375
+白牡丹 11.5027823792
+探析 13.900677652
+秦王 8.39534611604
+三本 11.5027823792
+二十一名 13.900677652
+理当 9.7898037878
+科罗拉多州 11.0103058941
+丛拥枚 13.2075304714
+复本 11.7034530746
+吉尔古 13.2075304714
+教学研究 11.9547675029
+整粒 13.900677652
+吵醒 10.2897597393
+四封 11.9547675029
+诰封 11.4157710022
+展览品 13.900677652
+容儿 9.75754292558
+历史名人 11.8212361103
+四尊 12.5143832909
+四小 11.1280889297
+复合体 10.4349417492
+赤乌 11.4157710022
+卧底 11.2616203224
+铝皮 13.900677652
+中国新民主主义青年团 11.9547675029
+越旺 11.5027823792
+结合态 12.8020653633
+天葬场 13.900677652
+硬盘机 13.2075304714
+多英里 12.2912397395
+木乃伊 10.0088573539
+桐乡市 12.8020653633
+越早 10.3171587135
+小寨亦 13.2075304714
+均田 10.3743171274
+天长日久 10.3453295905
+诸吕 11.598092559
+功臣 8.24119543622
+卧床 9.44633035572
+上海交大 11.1280889297
+黄奎 12.5143832909
+几十千瓦 13.2075304714
+翻地 11.8212361103
+越战 10.7226238216
+沼地 12.8020653633
+刘中山 13.900677652
+高海况 13.2075304714
+秦琼 11.2616203224
+东西魏 11.5027823792
+不求人 12.8020653633
+青海湖 9.40086798165
+胡特 13.900677652
+先钓 13.900677652
+水螅 10.3453295905
+痠疼 13.900677652
+矫若惊龙 13.900677652
+高回报 10.4041700905
+栈房 11.2616203224
+吉尔吉 11.9547675029
+写景文 13.2075304714
+四对 11.7034530746
+四寸 11.1280889297
+翻土 11.3357282945
+哈灵 12.8020653633
+转念 9.32596667347
+理学士 10.4666904475
+鄂尔怀 12.8020653633
+盘龙镇 12.2912397395
+熄掉 12.8020653633
+德维拉 13.900677652
+庙坪 9.72629038208
+商兑 13.900677652
+塞进 8.4980002701
+全球定位系统 10.4349417492
+救护所 12.1089181827
+颂歌 10.1630080337
+四定 13.900677652
+整笔 13.900677652
+娴淑 13.900677652
+塞尔特 13.900677652
+挤牙膏 11.8212361103
+混凝土泵 13.900677652
+皎白 13.900677652
+小店主 11.5027823792
+四不像 11.9547675029
+心在魏阙 13.900677652
+法利亚 12.5143832909
+烟笼雾罩 13.900677652
+通鉴音 12.5143832909
+四害 11.9547675029
+摊牌 10.8096351986
+金氏法 13.2075304714
+仄韵 13.900677652
+四家 8.28390655431
+铁路部门 10.0294766411
+伸过来 10.2897597393
+曾毅 12.5143832909
+张汝梅 12.8020653633
+代写 11.3357282945
+哭哭啼啼 9.6811699468
+镀锡 12.8020653633
+痠痛 13.900677652
+张鲸念 12.8020653633
+腐旧 13.900677652
+容器 8.49350588052
+四字 9.0884932966
+西尔维斯 12.2912397395
+代公 11.7034530746
+卧姿 12.5143832909
+心不老 13.2075304714
+代养 13.900677652
+剔了 12.1089181827
+寒温 10.2897597393
+宋妈 12.2912397395
+休息权 13.900677652
+犯罪行为 9.85762638414
+合议制 11.598092559
+结石病 13.900677652
+整篇 12.5143832909
+孙硕 12.5143832909
+代克 13.900677652
+禹为平 13.2075304714
+第五十一回 12.2912397395
+出血量 10.4994802703
+皎皎 11.598092559
+保暖性 11.1280889297
+古印格 13.900677652
+三叉路口 12.8020653633
+望眼 13.2075304714
+四季 8.04274449749
+那世里 11.5027823792
+新鸿基 10.7226238216
+民族自治 10.8561552143
+无核白 11.9547675029
+宝镜 11.4157710022
+夏雨扶 13.2075304714
+贿赂公行 11.598092559
+阿尔布佐 12.2912397395
+霞浦 12.1089181827
+复性 11.9547675029
+著名品牌 13.900677652
+防晒油 13.2075304714
+董宋臣 12.8020653633
+山楂树 12.5143832909
+军械部 11.598092559
+世事变迁 12.5143832909
+韵尾 11.1926274509
+出发地 11.5027823792
+不废江河 13.900677652
+和彦生 13.2075304714
+过福堂 13.2075304714
+吉州庐 12.5143832909
+平伏下来 13.2075304714
+柴明 13.2075304714
+谨身 10.8561552143
+眩惑 13.900677652
+牛口峪 13.2075304714
+日蚀 11.2616203224
+整箱 12.5143832909
+预约 8.74162235276
+篡党夺权 12.5143832909
+梆铃 11.5027823792
+代儒 11.3357282945
+狭长 8.40350942668
+塞车 11.598092559
+孙秉 13.900677652
+森本薰 12.5143832909
+冯邦宁 10.642581114
+宁海军 11.598092559
+张立勇 12.2912397395
+科技前沿 13.900677652
+孙秀 11.9547675029
+变温动物 11.598092559
+两三只 12.5143832909
+碣石 10.604840786
+解衣伏 13.900677652
+芬必得 11.0674643079
+孙科 11.1926274509
+勤劳者 12.2912397395
+水蚀 11.9547675029
+桑皮 12.2912397395
+财经委员会 10.604840786
+消夜 11.3357282945
+容城 12.5143832909
+星月旗 13.2075304714
+旅鼠 11.1926274509
+斯特斯 13.2075304714
+良渚文化遗址 12.1089181827
+那伯钦 12.8020653633
+水蚤 10.8096351986
+洛继统 13.900677652
+柳堤 12.2912397395
+成衣铺 13.2075304714
+乐记 11.3357282945
+百货店 10.4041700905
+孙福 11.4157710022
+万余张 13.2075304714
+一家独大 10.9562386728
+气密性 11.5027823792
+邻近地区 10.1164880181
+祝允明 11.8212361103
+瑞拉 12.8020653633
+齿舌 12.1089181827
+羊腥汤 12.5143832909
+对应性 12.2912397395
+避而不见 11.598092559
+德宝斋 13.2075304714
+抑制器 12.8020653633
+苏珊 12.2912397395
+工业区位 13.900677652
+崔仁师 12.8020653633
+磴口 13.2075304714
+水蛭 11.3357282945
+不饮盗泉 13.900677652
+解饿 13.900677652
+双规 10.8096351986
+棕榈岛 10.2117981979
+明仁宗 12.2912397395
+热病 9.87532596124
+马鼻疽 13.2075304714
+内招 13.900677652
+住院病人 12.2912397395
+加大力度 10.0088573539
+收讫 11.7034530746
+胡班 12.2912397395
+后含物 13.900677652
+代偿 9.62401153296
+中子源 11.2616203224
+鞠养 13.900677652
+摩擦阻力 11.1280889297
+礅子 13.900677652
+孙祖 13.2075304714
+郭家 10.3171587135
+伤风败化 13.900677652
+提进来 13.2075304714
+压铸模 13.900677652
+张太雷 10.9049453784
+更新快 11.9547675029
+御道 9.84023464143
+赫本 11.598092559
+手机游戏 11.598092559
+简化汉字 12.2912397395
+山西财经大学 13.900677652
+投寄 13.900677652
+段木 12.2912397395
+投宿 10.0720362555
+蒯越 11.8212361103
+庄王伐 12.8020653633
+居委会 10.0940151622
+胡明华 13.2075304714
+数字电话 13.2075304714
+半群 13.2075304714
+你一言我一语 10.4349417492
+地铁口 12.2912397395
+表章 11.0674643079
+年老色衰 12.8020653633
+专用基金 12.5143832909
+利翁河 13.2075304714
+客运处 12.8020653633
+帮不了 10.642581114
+橡胶雨衣 13.2075304714
+流来流去 12.8020653633
+海老清 8.53470163695
+干燥箱 13.900677652
+收词 11.1280889297
+千万片 13.2075304714
+水虱 12.5143832909
+柴进欧 13.900677652
+辅仁大学 10.4666904475
+水虫 12.5143832909
+几易其稿 13.900677652
+割席分坐 13.900677652
+马拉松赛 12.2912397395
+腰斩 10.0505300503
+中年级 13.900677652
+炒来炒去 12.8020653633
+表示 3.91321666566
+孙立 9.13850371718
+三一学院 10.2371160058
+长生不老 9.66657114738
+平南县 13.900677652
+干部战士 11.3357282945
+内转载 13.2075304714
+人间 7.41451686303
+宠信 9.0884932966
+优秀企业 10.3743171274
+千部 12.2912397395
+陷入僵局 10.8096351986
+代号 8.75318317516
+养心益 13.2075304714
+体育中心 10.9562386728
+娼妓 9.98865464655
+民食 11.4157710022
+一时半晌 13.900677652
+张柔献 12.8020653633
+休息日 10.9562386728
+信称义 12.1089181827
+刘遵宪 13.2075304714
+废金属 12.8020653633
+代发 11.4157710022
+面目一新 11.7034530746
+西北局 11.0674643079
+正反两面 11.0103058941
+代叔 12.2912397395
+魏无知 13.900677652
+中子流 12.8020653633
+动地 10.642581114
+柳子 11.598092559
+李春波 13.2075304714
+经量部 11.3357282945
+尼狄克 12.2912397395
+日落 9.69598503258
+操起 10.2630914922
+郭威遂 12.8020653633
+代县 11.1926274509
+役使 9.80633308975
+长期抗战 11.2616203224
+居郑 12.8020653633
+马鸿良 11.4157710022
+高宗死 12.1089181827
+斯特曼 13.2075304714
+雷斯特 12.2912397395
+水藻 11.2616203224
+希曼 12.8020653633
+止回阀 12.8020653633
+哄传 9.63799777493
+罪重 12.5143832909
+闲磕牙 12.8020653633
+枸杞 9.59661255877
+磊磊落落 13.900677652
+刮面 13.2075304714
+门旗影 11.4157710022
+桑田 11.598092559
+四套 11.7034530746
+汝康有为 13.900677652
+刘坤一 10.3453295905
+萎谢 13.900677652
+柳大纲 13.2075304714
+动鼠标 13.900677652
+互相冲突 11.8212361103
+庾亮记 12.8020653633
+物理地址 12.2912397395
+黑啤酒 11.9547675029
+司户参 11.9547675029
+莫里兹 12.8020653633
+姜姓有 13.2075304714
+但文帝 12.5143832909
+正规渠道 11.1280889297
+墨渍 13.2075304714
+胡烈 13.2075304714
+柳家 10.6818018271
+仲卿 12.2912397395
+恶性肿瘤 9.12155415886
+锋电位 13.900677652
+展望未来 9.72629038208
+秦皇 11.3357282945
+不成体统 10.9049453784
+塞责 11.0103058941
+时间尺度 11.4157710022
+林牧业 11.8212361103
+抿着嘴 10.6818018271
+毛难族 12.5143832909
+孙程 13.2075304714
+肋木 12.5143832909
+提供商 9.69598503258
+四外 11.5027823792
+无敌舰队 11.0103058941
+秦相 11.4157710022
+一百二十步 12.1089181827
+别费 13.900677652
+桓石民 12.5143832909
+和事佬 11.8212361103
+警卫人员 11.7034530746
+网格化 13.900677652
+航班时刻 12.8020653633
+卧室 8.20023407859
+胡绳武 13.2075304714
+未必尽然 12.8020653633
+四处 7.76511276089
+恨臣 13.900677652
+苏灵 13.900677652
+侧芽 12.1089181827
+母仪天下 11.9547675029
+殷殷期望 12.8020653633
+寒色 13.2075304714
+安全火柴 13.2075304714
+四头 12.8020653633
+科普活动 13.2075304714
+托盘 9.56994431169
+病毒性 9.61021821083
+四大 6.74840879594
+杜伦尼 13.900677652
+四天 8.87023973058
+粮价 9.34680076038
+代北 11.0103058941
+若干股 12.8020653633
+从容就义 11.7034530746
+杭少爷 10.4349417492
+比较严重 9.62401153296
+吴为学 13.900677652
+魏朝得 12.8020653633
+理宗 12.2912397395
+斯特林 10.4041700905
+擂响 11.9547675029
+疾病诊断 11.3357282945
+散步 8.80692745117
+四壁 9.01787572939
+利翁湾 13.900677652
+腰杆 9.93038573842
+能源供应 10.0720362555
+腊味 13.2075304714
+理完 12.5143832909
+狭隘 9.40086798165
+矫诏立 13.2075304714
+四声 9.94943393339
+水蒸 11.8212361103
+高清晰度 12.1089181827
+投奔 8.1641053545
+投契 11.1280889297
+腰板 10.1630080337
+小公子 12.8020653633
+乐观 6.07823292249
+叶舌 11.4157710022
+乐见 10.6818018271
+漫画展 13.2075304714
+近情理 13.2075304714
+哄乱 13.900677652
+侯鸟 11.8212361103
+居里 9.74179456862
+伊迪丝 12.8020653633
+居野 12.8020653633
+马莱塔 13.900677652
+宝钢 6.80644280605
+口腔卫生 11.4157710022
+四境 11.5027823792
+黄毛狗 13.900677652
+多端网络 12.1089181827
+海洋污染 11.5027823792
+代劳 10.765183436
+张广才岭 10.4041700905
+水蓄 12.1089181827
+赤道面 11.0103058941
+玉坊中 12.1089181827
+铁特河 12.8020653633
+买得起 9.80633308975
+神州行 11.8212361103
+理学家 9.75754292558
+千里之堤 12.8020653633
+于占田 13.2075304714
+山蔬 13.900677652
+归墟龙 13.2075304714
+乘龙 11.1926274509
+中国投资有限公司 12.5143832909
+复排 13.900677652
+钎子 12.5143832909
+抗日救国 9.91169360541
+越慢 11.0674643079
+大木梁 12.5143832909
+斯特朗 11.7034530746
+四塘 13.2075304714
+佩尔修斯 12.8020653633
+车牌号 10.2630914922
+雨打风吹 12.8020653633
+感情世界 11.8212361103
+荷兰港 13.900677652
+刘贤 13.2075304714
+哈珀 11.2616203224
+肠胃病 11.9547675029
+学术交流 9.96885201925
+病虫 10.9562386728
+批阅 9.77354326693
+蒸发掉 11.2616203224
+水落 11.9547675029
+吵闹 9.26594866375
+温软 11.7034530746
+跗蹠 10.533381822
+袖里乾坤 13.900677652
+朴刀倚 12.5143832909
+电气设计 13.900677652
+斯维雅 13.900677652
+富尔曼 12.8020653633
+架成 11.8212361103
+卡迪蓬 13.900677652
+邵武 10.4994802703
+一九五二年 12.2912397395
+准格尔 11.3357282945
+类图书 12.5143832909
+整碗 12.8020653633
+腰果 10.8561552143
+堕胎药 13.900677652
+一言既出 11.7034530746
+品牌女装 13.900677652
+原子轨道 11.1280889297
+地理学家 9.05649056552
+胃舒平 13.900677652
+医学院 8.38322475551
+黄姨 13.2075304714
+四堵 11.598092559
+亡党亡国 13.2075304714
+段寿辉 13.2075304714
+坎坷道路 13.900677652
+袋式 13.2075304714
+水葱 11.8212361103
+特维斯 13.900677652
+水葬 11.5027823792
+张柔独 12.8020653633
+哄人 11.0103058941
+齐元振 12.8020653633
+理学 8.74162235276
+六旬万 12.5143832909
+不可逆性 10.642581114
+斯特来 13.2075304714
+大型超市 11.0674643079
+文长之 13.2075304714
+王臣 11.5027823792
+转帐 11.7034530746
+层层加码 13.2075304714
+得利于 12.5143832909
+哈森海德 13.900677652
+金华人 11.9547675029
+胡乱 8.08356649201
+海部俊树 12.2912397395
+将届 12.5143832909
+富尔奈 13.900677652
+四十五年 10.3171587135
+北纬度 13.900677652
+四柱 11.1280889297
+穆太奈 12.2912397395
+天摧地塌 12.8020653633
+共同奋斗 12.5143832909
+十足把握 13.2075304714
+不期而会 12.2912397395
+瑞德 11.8212361103
+无损于 11.7034530746
+鲅鱼 11.2616203224
+县界 11.5027823792
+贼军 11.0674643079
+象声词 12.8020653633
+太阳膜 12.5143832909
+居心叵测 10.6818018271
+马类 11.5027823792
+二头肌 13.2075304714
+蓝缕 12.8020653633
+紫金山 11.0103058941
+杀菌作用 10.9049453784
+四枚 10.8096351986
+痰喘 13.900677652
+伐木者 12.8020653633
+四极 11.8212361103
+敖仓 12.5143832909
+谷利 13.2075304714
+胡主 13.2075304714
+胡为 11.1926274509
+贷记卡 12.5143832909
+中国社会科学院近代史研究所 11.5027823792
+鼓锤 13.900677652
+能译 13.900677652
+四架 11.1926274509
+数万亿美元 12.8020653633
+证券业 9.96885201925
+达摩剑 13.900677652
+披红挂彩 12.8020653633
+佚失 11.1280889297
+休要 8.96620371885
+西吉斯蒙德 12.8020653633
+休息室 10.2371160058
+干股 11.9547675029
+荆扬晏 12.8020653633
+哄然 10.8561552143
+雷神 10.4994802703
+随口说说 12.5143832909
+刘磊 13.2075304714
+抽成真空 12.5143832909
+苏中 10.8096351986
+梧桐雨 11.7034530746
+武乡县 11.5027823792
+五雷轰顶 11.8212361103
+侯嫂 11.0103058941
+乙亥 12.5143832909
+宫叩见 13.2075304714
+早间 9.21854642485
+七千多万 13.900677652
+霞光 9.62401153296
+芸芸 11.598092559
+闻吾之 13.2075304714
+四杆 13.900677652
+苏丹 7.79811905736
+柳斌 11.598092559
+刘磐 13.2075304714
+蓝翎 12.5143832909
+敖东 12.5143832909
+背井离乡 10.6818018271
+风纪扣 12.2912397395
+七千多个 13.900677652
+朱琳 13.2075304714
+平邑县 12.8020653633
+绊脚 11.1926274509
+苏三 11.8212361103
+复层 12.2912397395
+边宣慰 13.2075304714
+重新估价 12.1089181827
+四条 8.82550383674
+比绍 11.598092559
+迁过去 12.8020653633
+悸动 11.4157710022
+胡仙 13.900677652
+四杯 12.8020653633
+马系 13.2075304714
+田秀才 12.8020653633
+伏身 11.3357282945
+斜巷 11.8212361103
+四望 10.765183436
+放生池 12.8020653633
+四期 10.3171587135
+编制程序 11.7034530746
+石灰岩 7.84155445639
+竞投人 13.900677652
+自动售货机 13.2075304714
+选调 11.7034530746
+胡人 8.80692745117
+张博学 13.900677652
+挖土 10.0720362555
+吕国祥 13.900677652
+斯断层 13.2075304714
+夏雨帮 13.900677652
+零十四天 13.2075304714
+四朵 12.8020653633
+出门时 9.58318953844
+蓝羽 13.900677652
+运筹决策 13.900677652
+马粪 9.61021821083
+压寨夫人 11.8212361103
+挖地 11.5027823792
+众星拱月 12.5143832909
+雪茄烟 10.9562386728
+雷科 13.900677652
+阿歇特 12.5143832909
+情况紧急 10.3171587135
+拒绝接受 9.82314020807
+四本 12.1089181827
+复工 10.2117981979
+王胡 13.2075304714
+总述 12.8020653633
+石扬沙 12.8020653633
+塞尔伯 12.8020653633
+吴升心 13.2075304714
+朱襄氏 13.2075304714
+刘祁 12.5143832909
+传播媒介 10.5684731418
+查慎行 12.5143832909
+沈德潜 11.1280889297
+十六分音 13.900677652
+活到 9.30555780184
+墨累河 11.3357282945
+赴义 13.2075304714
+投来 10.1394775363
+赫定 11.8212361103
+王能 12.8020653633
+齐刷刷 9.66657114738
+教诫 12.8020653633
+砸掉 11.4157710022
+邮递 10.9562386728
+越强 9.94943393339
+泼进来 13.900677652
+泛亚 11.2616203224
+瑞康 12.2912397395
+饶雪漫 13.900677652
+墨色 10.1630080337
+木竹石 12.2912397395
+修治浚 13.2075304714
+教课 11.598092559
+文学革命论 13.2075304714
+胡佛 10.6818018271
+教诲 9.14708746087
+牧草 8.83808261895
+王胜 11.598092559
+陆子刚 13.2075304714
+蹿出 9.94943393339
+投机 7.02647915652
+会址 9.91169360541
+送机 12.2912397395
+于岷江 13.2075304714
+可挽回 13.900677652
+焦散线 13.2075304714
+王育 12.2912397395
+卡兰萨 11.5027823792
+太阳能 7.50541605386
+外人田 13.900677652
+含羞 10.533381822
+核子潜艇 13.900677652
+王肃 11.7034530746
+荆豫 13.2075304714
+教训 7.38153036404
+总辖 11.7034530746
+烽火台 10.3171587135
+三百二十五座 13.2075304714
+马累 11.8212361103
+枉死鬼 13.900677652
+千佛洞 10.2371160058
+查理定律 12.5143832909
+总辞 13.900677652
+冻顶乌龙 11.9547675029
+复分析 12.8020653633
+乔木林 11.4157710022
+东南边 12.8020653633
+代沟 11.7034530746
+王总兵 11.8212361103
+毫无惧色 11.2616203224
+二百八十年 13.2075304714
+紫巍巍 12.8020653633
+胡伟 12.5143832909
+卵形 8.90346537821
+大肚量 13.900677652
+比翼 12.1089181827
+千万个 11.598092559
+干腐 13.900677652
+天津碱厂 13.2075304714
+接受下来 11.598092559
+刘秀 9.5186510173
+容止 13.900677652
+唐一娜 7.95003509939
+不可终日 12.8020653633
+风尘肮脏 13.2075304714
+后代子孙 11.0674643079
+分层抽样 13.900677652
+未声明 12.8020653633
+罗摩休 13.2075304714
+邵哥 10.7226238216
+无损伤 11.598092559
+米尔顿 12.2912397395
+画龙点睛 11.0674643079
+宋景德 12.8020653633
+文化频道 13.900677652
+一百二十名 13.900677652
+代汉 11.1280889297
+赴任 9.7898037878
+冷冷青 13.2075304714
+蓝绿 11.8212361103
+胡俊 11.4157710022
+花发夫 13.2075304714
+苏伟 12.2912397395
+赵攻燕 13.2075304714
+兰帕德 13.2075304714
+腑脏 13.2075304714
+山水相连 13.900677652
+那东土 11.598092559
+刘福 12.8020653633
+奥运金牌 12.8020653633
+僵持不下 11.598092559
+另眼相待 12.5143832909
+喀喇昆仑山 9.63799777493
+刘禅 10.4349417492
+彩色显示 12.5143832909
+干脆 7.10050758367
+投枪 11.8212361103
+好家伙 10.2371160058
+四明 10.4994802703
+波克堡 13.900677652
+王考 11.7034530746
+王老 9.77354326693
+王耀 11.4157710022
+王者 9.25628675283
+没心肝 11.8212361103
+反应类型 12.2912397395
+蓝线 11.598092559
+会稽山 10.2897597393
+卤代烃 10.6818018271
+比美 11.7034530746
+赴京 9.54396882529
+选购 9.11318590919
+图画课 13.900677652
+越快 9.29550746599
+临界距离 12.8020653633
+厂矿 9.77354326693
+苏体 13.2075304714
+龙虎山 10.4349417492
+雷耶斯 13.900677652
+冯提尔 13.900677652
+敢留 12.8020653633
+乳山县 13.2075304714
+社会关系 8.58747167293
+含糊 9.17328983326
+丛拥幕 12.2912397395
+赵堂官 12.8020653633
+起重船 12.2912397395
+伏象 13.900677652
+生意场 11.3357282945
+王菲 11.3357282945
+越小 9.4233408375
+含糖 10.0088573539
+艰难险阻 10.6818018271
+暖水瓶 11.9547675029
+鼓面 10.6818018271
+蒙抚台 12.5143832909
+路精兵 12.8020653633
+复建 11.1926274509
+十分激烈 10.0720362555
+吉林工业大学 12.5143832909
+四时 9.12155415886
+规定动作 12.1089181827
+美容 8.35941410682
+心理活动 9.44633035572
+夷人 10.2371160058
+克勒芒 13.2075304714
+马尔可夫 11.5027823792
+无冕之王 12.1089181827
+四旧 9.69598503258
+四日 9.94943393339
+土邦 10.9562386728
+动了心 10.7226238216
+会计准则 8.96620371885
+画框 12.1089181827
+四斗 12.1089181827
+汉译 10.1164880181
+酒精中毒 10.3453295905
+柳村 12.8020653633
+二十亿元 13.2075304714
+武状元 12.8020653633
+徐小农 11.1280889297
+汉诗 11.3357282945
+告示板 13.900677652
+王莲 11.5027823792
+柳杉 10.9049453784
+都素知 13.900677652
+四文 13.900677652
+能解 10.8096351986
+富平县 13.2075304714
+王莹 12.2912397395
+哈丁 11.2616203224
+王莽 8.80081122415
+数艘 12.8020653633
+四新 13.2075304714
+喧杂 13.2075304714
+早霜 12.8020653633
+平如镜 12.8020653633
+四方 7.84389363875
+白塞尔 13.2075304714
+明正 11.9547675029
+新华制药 10.8096351986
+中共军队 13.2075304714
+牧者 12.1089181827
+齿颊生香 13.900677652
+汉语 7.89186446653
+蓝素 12.5143832909
+单身汉 11.0674643079
+四斤 11.9547675029
+柳条 9.61021821083
+潴泡 13.900677652
+蓝紫 12.2912397395
+武天皇 12.1089181827
+干员 12.8020653633
+艾兹拉 13.2075304714
+王水溶 13.900677652
+赌台 13.2075304714
+柳枝 10.0088573539
+步行虫 13.900677652
+老实话 10.6818018271
+抗过敏 10.9562386728
+马绍 9.91169360541
+柳林 10.1164880181
+金鳞玉 13.2075304714
+戍卫 11.9547675029
+蹿到 10.2117981979
+丛长毛 13.900677652
+马绕 13.900677652
+布老虎 11.1926274509
+哈什 12.8020653633
+青海省循化撒拉族自治县 12.8020653633
+足球学校 13.900677652
+正面教育 13.2075304714
+母珠 13.2075304714
+架开 13.2075304714
+四数 12.8020653633
+唐封其 12.5143832909
+凤台县 11.8212361103
+刘章 11.7034530746
+马续 12.8020653633
+漂亮仗 12.5143832909
+怒视 11.4157710022
+对外经济贸易大学 11.9547675029
+架式 9.87532596124
+四散 8.5440913773
+越岭 11.7034530746
+王秀才 13.2075304714
+实证性 11.9547675029
+戍卒 11.4157710022
+哈代 10.7226238216
+卷缩 12.5143832909
+土造 12.2912397395
+哈亚 12.8020653633
+上海中央局 13.2075304714
+总谱 11.5027823792
+童立本 9.24671730182
+吉剌部 12.2912397395
+花花肠子 12.1089181827
+吸油纸 11.9547675029
+支援前线 12.1089181827
+龚定庵 13.2075304714
+韩德让 11.5027823792
+南征北战 10.1394775363
+表演奖 12.5143832909
+揎拳捋袖 13.2075304714
+容格 13.900677652
+赫塔 12.1089181827
+仁术 13.900677652
+南道东 13.900677652
+土遁 13.2075304714
+两脚规 13.900677652
+航空遥感 11.8212361103
+格罗 10.5684731418
+太宰王 12.2912397395
+干舷 12.8020653633
+马红 12.5143832909
+格网 13.900677652
+四十五岁 11.4157710022
+理智 8.00903344015
+渥惠 13.900677652
+闹起来 10.0294766411
+重大突破 9.44633035572
+马纳 11.9547675029
+夷平作用 11.9547675029
+声闻 11.0674643079
+市场繁荣 11.7034530746
+使用者 9.20932976975
+一百二十块 12.5143832909
+四支 10.9562386728
+接单 11.8212361103
+货币回笼 10.9562386728
+王茜 12.8020653633
+哈佛 10.0505300503
+腰子 10.8561552143
+信息安全 10.3743171274
+格纳 10.642581114
+王若 11.7034530746
+铬铁 11.9547675029
+干菜 11.1280889297
+教规 10.3453295905
+工程决算 13.900677652
+未定稿 11.9547675029
+马罗 12.1089181827
+王英 9.98865464655
+大专院校 9.7898037878
+摈弃 10.4041700905
+选过 13.2075304714
+香皂 10.1630080337
+声势汹汹 12.5143832909
+蘸酱 12.1089181827
+邵基 12.2912397395
+刘筠 12.2912397395
+轻水 11.9547675029
+王苏 13.2075304714
+后现代 12.1089181827
+装配工厂 13.900677652
+瑞岩 13.2075304714
+消隐 12.1089181827
+投效 11.0103058941
+三角型 13.2075304714
+尿盆 11.0103058941
+培训中心 9.85762638414
+厂甸 12.8020653633
+左梦庚 10.1871055853
+平板式 11.9547675029
+边宣抚 13.2075304714
+投放 7.01414600945
+一二三四五 13.900677652
+山洪暴发 10.2897597393
+国际棋联 13.2075304714
+选辑 11.1926274509
+宣和书 12.5143832909
+张鲸情 13.2075304714
+王芬 13.900677652
+哈伊 11.5027823792
+散场 10.533381822
+粗粗细细 13.2075304714
+土里 9.77354326693
+两姐妹 11.0674643079
+调制器 11.2616203224
+花哨 11.1280889297
+伏贴 11.9547675029
+比索 11.0103058941
+端出来 10.7226238216
+姜大人 12.2912397395
+王节 13.2075304714
+铬钢 13.900677652
+于楚州 13.900677652
+哪些项目 11.5027823792
+飞行轨道 11.9547675029
+块砖 11.9547675029
+替代物 12.1089181827
+照像馆 12.8020653633
+复得 11.0103058941
+宋之问 11.4157710022
+散土 13.2075304714
+理查 10.4041700905
+三支两军 12.2912397395
+铬钼 13.2075304714
+翻案 9.85762638414
+哈伦 11.0103058941
+卡若 12.2912397395
+伏路 11.3357282945
+马再战 12.8020653633
+下三路 13.2075304714
+记挂 10.8096351986
+复形 12.5143832909
+窣窣 11.7034530746
+殴斗 12.5143832909
+郭万有 11.4157710022
+县直 12.8020653633
+瑞尔 10.9562386728
+王艮 12.1089181827
+真糟糕 12.2912397395
+引流术 12.5143832909
+混水摸鱼 11.5027823792
+宏观世界 11.9547675029
+独脚戏 12.1089181827
+顾亭林 12.8020653633
+干草 9.28555713513
+双处理器 13.900677652
+一别多年 12.8020653633
+内驱力 12.1089181827
+综合体 9.15574552361
+仙游县 11.7034530746
+须加盖 13.900677652
+大学教授 8.42003872863
+资料库 11.5027823792
+两千四百辆 13.900677652
+终归是 10.4041700905
+哇哇叫 12.5143832909
+袁应泰 12.5143832909
+复归 9.14708746087
+砖头 8.56313957227
+头昏眼花 11.0674643079
+降为 8.86372504956
+孟斯 13.2075304714
+李健华 13.900677652
+较大型 11.598092559
+接待费 13.2075304714
+安德拉邦 13.900677652
+火电站 10.4666904475
+顾安 13.2075304714
+雄黄酒 11.3357282945
+沙摩柯 11.9547675029
+应用软件 9.96885201925
+通不过 11.1280889297
+总责 12.1089181827
+老姐儿 13.900677652
+张立民 13.900677652
+总账 12.1089181827
+承唐宋 12.5143832909
+硬盘式 12.8020653633
+煽炉子 13.900677652
+运通卡 13.900677652
+李春兰 12.8020653633
+嫉视 12.2912397395
+柳贻徵 13.2075304714
+内河运输 10.7226238216
+投料 10.765183436
+科纳克里 11.7034530746
+复式 9.69598503258
+团结一致 10.2371160058
+闻风 10.0088573539
+关保儿 13.900677652
+垦种 10.9562386728
+摩擦学 11.8212361103
+翻检 11.3357282945
+铁矿 7.97108850859
+帕维尔 12.2912397395
+蹿升 10.9562386728
+能行 9.22784881751
+小军监 12.8020653633
+本生灯 11.7034530746
+卵巢 8.77671367257
+渐凉 13.900677652
+主管人员 11.0674643079
+虾皮 11.8212361103
+须子 12.2912397395
+复壮 13.2075304714
+五千六百四十一万余两 13.2075304714
+表达方法 12.2912397395
+瑞安 9.74179456862
+酒具 10.4349417492
+挖取 13.2075304714
+祛除 10.604840786
+左手指 12.8020653633
+选装 11.0674643079
+火硝 12.5143832909
+姚大力 11.8212361103
+东二环 13.2075304714
+科柯施 13.2075304714
+蓝筹 7.16489763773
+没多久 9.80633308975
+心心念念 11.9547675029
+再取 10.4994802703
+三文 11.9547675029
+投手 11.7034530746
+一下全部 12.8020653633
+赫马尼 11.9547675029
+占好 13.2075304714
+优胜劣败 12.8020653633
+弄潮 12.8020653633
+立福晋 13.900677652
+五十一岁 13.2075304714
+厂牌 13.2075304714
+红外制导 10.9562386728
+新娘子 9.4233408375
+殴打 9.05649056552
+掐尖儿 12.5143832909
+海虎绒 13.900677652
+吹火筒 13.2075304714
+可压缩性 11.7034530746
+隐隐地 10.1630080337
+道义上 10.3171587135
+书评人 13.900677652
+美国农业部 9.56994431169
+蓝姨 12.8020653633
+宁死不屈 10.8561552143
+腾出来 10.0505300503
+王薄 12.8020653633
+陶潜 11.7034530746
+鱼汤 10.2630914922
+能进 10.7226238216
+四部曲 12.1089181827
+凉凉的 11.7034530746
+役畜 10.3743171274
+半截道 13.2075304714
+三新 10.7226238216
+淮阳 9.43476953332
+淮阴 9.31571017331
+隙间 11.5027823792
+厚茧 12.5143832909
+望众 12.8020653633
+疗程 9.59661255877
+斯特尔 12.2912397395
+丈二和尚 12.8020653633
+赫希 12.8020653633
+一铲 12.5143832909
+演习场 13.900677652
+邢大舅 11.9547675029
+竞猜活动 12.5143832909
+起早 11.5027823792
+王蕾 13.900677652
+全国工会 12.2912397395
+排尾 12.8020653633
+斯特尼 11.9547675029
+床边 8.48457724977
+一关 10.0088573539
+板门店 11.3357282945
+中国天文学会 12.5143832909
+投拍 12.5143832909
+伤食 12.2912397395
+摇动不停 13.900677652
+留言 9.20019728618
+夏洪波 13.900677652
+张方平 12.8020653633
+唐大人 11.8212361103
+一百二十六 13.2075304714
+说老实话 10.3743171274
+那娇俏 12.8020653633
+一百二十八 12.5143832909
+合法婚姻 11.9547675029
+张敬修 12.2912397395
+羞怯 9.43476953332
+一穷二白 11.0103058941
+亚美尼亚共和国 12.1089181827
+错那县 12.5143832909
+汉赋 10.8096351986
+奖金税 12.5143832909
+卡努里 12.2912397395
+萨布克 13.2075304714
+齿印 12.2912397395
+应予以 9.94943393339
+危室壁 13.2075304714
+奠都 13.2075304714
+絮絮叨叨 10.533381822
+度君子之腹 12.8020653633
+拉巴赫 12.5143832909
+羰基 9.58318953844
+数最多 8.95903522937
+芍陂 11.1280889297
+有眼力 11.3357282945
+制片厂 9.62401153296
+三斤 10.2630914922
+风云变态 13.900677652
+塞外风光 13.2075304714
+横列式 13.2075304714
+王蔚 12.2912397395
+低头不见抬头见 11.9547675029
+陈新民 13.2075304714
+三教 9.98865464655
+彼竭我盈 13.900677652
+打开天窗说亮话 13.2075304714
+误约 13.900677652
+科研活动 12.1089181827
+总说 9.94943393339
+四招 12.8020653633
+千万种 12.5143832909
+姬蜂 12.2912397395
+教过 10.4666904475
+空地导弹 10.0294766411
+马祖 10.765183436
+帕特拉 13.2075304714
+赣西 11.9547675029
+星光照耀 13.900677652
+业余活动 12.5143832909
+恶形 13.2075304714
+王瑾 12.5143832909
+悔不当初 12.5143832909
+由慧英 12.8020653633
+散兵 10.604840786
+数码港 10.9049453784
+逼肖 12.8020653633
+若干门 11.598092559
+散光 11.0103058941
+家电产品 10.9049453784
+刘絮 13.900677652
+阿弗尔 11.598092559
+万劫不复 10.765183436
+六响 13.900677652
+赫德 10.9562386728
+马世龙 13.900677652
+复姓 10.2630914922
+总评 11.9547675029
+柯树 12.5143832909
+答辩状 12.2912397395
+望亭 12.1089181827
+望京 10.0505300503
+体检表 12.8020653633
+斯特雷奇 13.2075304714
+琐屑 11.7034530746
+撒开来 13.2075304714
+总论 10.3453295905
+虫媒花 12.8020653633
+教辅 12.2912397395
+卵子 9.23723855786
+黄金岁月 12.5143832909
+油池 13.2075304714
+航炮 11.4157710022
+西印度群 9.27570483869
+雷米 12.8020653633
+一册 10.4666904475
+北洋军阀 8.93783302172
+更新期 12.8020653633
+古迪逊 13.900677652
+春秋正富 13.900677652
+子昂然 13.2075304714
+早逝 11.1926274509
+马刺队 13.900677652
+创造性地 9.66657114738
+尿炕 13.900677652
+装潢门面 12.8020653633
+土音 12.2912397395
+沙赫里 12.8020653633
+奠酒 11.2616203224
+磁力线 10.1164880181
+郭祥望 11.598092559
+早退 11.7034530746
+稀硫酸 10.8561552143
+干薪 12.5143832909
+立宪运动 10.8096351986
+哈德逊 12.8020653633
+轿车市场 11.9547675029
+乐寿堂 10.4349417492
+土壤环境 11.8212361103
+主要参数 11.9547675029
+望东 11.3357282945
+丹棱 12.2912397395
+望丁 13.900677652
+四所 11.9547675029
+四扇 11.598092559
+再压 11.9547675029
+陷入困境 9.29550746599
+四手 11.598092559
+李大人 9.19114745066
+嗜欲 11.9547675029
+黄蜡蜡 12.1089181827
+幻化成 11.7034530746
+七弟 12.8020653633
+桑丘 11.598092559
+四批 11.2616203224
+凶杀案 11.598092559
+鹿衔草 13.2075304714
+病毒学 11.1926274509
+王著 11.9547675029
+床身 12.2912397395
+电影机 11.9547675029
+雷德福 13.2075304714
+小铁铲 12.8020653633
+柯涅楚 12.5143832909
+四成 8.60236028543
+破罐破摔 12.5143832909
+心得体会 12.1089181827
+王营 12.5143832909
+太皇太后 10.9049453784
+投掷 9.00283785202
+猿猴 9.91169360541
+不成器 10.5684731418
+范伦铁 13.2075304714
+逆流而上 11.8212361103
+含笑 8.29487558568
+饭菜 8.55834340001
+威斯特法伦 11.5027823792
+蒂默 13.2075304714
+商品资本 8.24818847171
+若干组 11.9547675029
+并打印 13.900677652
+四户 12.2912397395
+桑乔 13.2075304714
+翻滚 8.75318317516
+相互讨论 13.900677652
+望乾 13.2075304714
+休谟 10.8096351986
+挖到 10.4349417492
+史薛璋 13.2075304714
+司法解释 10.1630080337
+全国人大民委 13.900677652
+诚至 13.900677652
+罔替 11.598092559
+哈丽雅特 13.900677652
+罗斯号 12.5143832909
+刘繇 11.3357282945
+航班 8.62256299275
+相距仅 11.598092559
+仍旧会 12.8020653633
+小花脸 12.8020653633
+洛尔科 13.2075304714
+清唱剧 10.2630914922
+阿瓦朗 13.900677652
+如鱼饮水 13.900677652
+唐末朱 13.2075304714
+涌往 12.8020653633
+赠阅 12.1089181827
+美元兑 8.53938548627
+秦业 12.2912397395
+六年制 13.900677652
+包佶充 13.2075304714
+成都王 11.7034530746
+三华里 12.8020653633
+氨苄西林 13.900677652
+含磷 10.7226238216
+痛苦 6.47412857958
+总装 10.4994802703
+市场准入 9.0884932966
+养起来 11.5027823792
+挖出 8.61241062128
+不失为 8.68574189437
+挖壕机 13.2075304714
+关堂官 12.8020653633
+简亲王 10.2897597393
+扒手 11.7034530746
+白范阳 12.1089181827
+发落 9.00283785202
+特维尔 11.3357282945
+干一行 11.5027823792
+休达 12.5143832909
+腰布 12.2912397395
+三年计划 13.900677652
+储蓄银行 10.6818018271
+贝京 11.9547675029
+街舞 11.9547675029
+医学专业 11.9547675029
+满肚子火 13.900677652
+贾朝轩 7.9817837977
+都御使 12.8020653633
+赃物 10.6818018271
+东方集团 11.7034530746
+路小军 12.5143832909
+郭老驹 13.2075304714
+黄帝内经 10.1164880181
+王融 12.5143832909
+含碳 10.0720362555
+淡褐 11.9547675029
+真好玩 12.8020653633
+腰带 8.6803218269
+翻浆 13.2075304714
+痰厥 12.2912397395
+曼丁戈 11.8212361103
+一路盘升 13.900677652
+宗哥川 13.2075304714
+长丝 10.4994802703
+理成 12.1089181827
+沼液 13.900677652
+太平乡 11.2616203224
+白蚂蚁 12.2912397395
+刘绍 10.3171587135
+第十三天 13.900677652
+秦人 10.4666904475
+再割 13.2075304714
+补鞋 11.8212361103
+代步 10.3453295905
+超级市场 10.7226238216
+元璐 13.2075304714
+国际协会 12.1089181827
+赫尔 10.4666904475
+资料室 11.3357282945
+听鹂 13.2075304714
+总表 11.5027823792
+越境 11.2616203224
+先裁 13.2075304714
+冷冷道 11.2616203224
+含硫 10.1871055853
+伍文 12.8020653633
+亚铁氰化钾 12.1089181827
+刘继 12.5143832909
+蓝移 12.5143832909
+易切削 13.2075304714
+容汝 12.2912397395
+辉银矿 12.2912397395
+扒拉 10.3743171274
+铬酸 11.4157710022
+复婚 10.533381822
+秦仲 11.9547675029
+彭小姐 13.900677652
+金家三 13.2075304714
+王葆仁 13.2075304714
+娘子军 10.0720362555
+坐标轴 11.1926274509
+秦代 9.08039608637
+避不见面 13.900677652
+查希尔 13.2075304714
+教谕 10.4994802703
+许子 13.900677652
+刘纪 13.900677652
+王蜂 13.2075304714
+帕金森 11.5027823792
+刘红 10.8561552143
+卵壳 11.2616203224
+我辈 8.81927328699
+架子 8.46695564842
+利水通 12.8020653633
+裂变物质 13.900677652
+东太后 12.8020653633
+贾迎春 12.1089181827
+止损 8.85082164473
+石刻像 12.2912397395
+振声 12.1089181827
+越多 8.67493097826
+选译 12.2912397395
+莫里森 11.9547675029
+一九五八年 12.1089181827
+云开月 13.900677652
+越夏 13.2075304714
+选词 13.2075304714
+编起来 12.8020653633
+外汇交易 10.533381822
+战斗保障 11.5027823792
+向延展 13.2075304714
+发文者 13.2075304714
+秦伯 13.2075304714
+总角 12.5143832909
+选读 11.0674643079
+王蛇 12.8020653633
+选课 12.5143832909
+阿塔尔 12.5143832909
+多亏是 12.8020653633
+无后为大 11.9547675029
+相贴 12.8020653633
+由盛京 12.5143832909
+总觉 11.598092559
+越大 7.59622884955
+也罢 7.80260336981
+科伯恩 12.5143832909
+令媛 13.900677652
+四十五天 12.5143832909
+容桂芳 9.89334446674
+复审 9.74179456862
+廿三 11.9547675029
+卧房 10.0720362555
+一几 13.2075304714
+西昌市 11.7034530746
+沼池 13.900677652
+贲之师 13.900677652
+拐得 13.900677652
+越好 9.31571017331
+营业点 12.1089181827
+邹渊领 13.2075304714
+廿七 13.2075304714
+竞技性 12.5143832909
+鲍德温 11.5027823792
+罗非鱼 11.7034530746
+总要 7.78038023302
+瑞士 7.27528528397
+土门 11.3357282945
+腰弯 11.8212361103
+刘缵 13.2075304714
+怪鱼 11.2616203224
+射虎 12.5143832909
+布鲁塞尔 8.78868986362
+复学 11.1926274509
+赫崇 13.2075304714
+老城 9.62401153296
+嗫嚅 9.34680076038
+支离破碎 9.89334446674
+孽海 12.8020653633
+县狱 13.2075304714
+虏掠 11.3357282945
+哈瓦利 11.8212361103
+良玉 10.0940151622
+芸薹 11.598092559
+雷纳 12.1089181827
+斯蒂德 12.8020653633
+欧防风 13.900677652
+刘翔 10.1871055853
+帕维亚 11.9547675029
+中直机关 13.2075304714
+淡装 13.2075304714
+六百一十九万五千七百五十七 13.900677652
+黄祖 10.7226238216
+乌莱玛 12.5143832909
+瑞士政府 12.2912397395
+运粮河 11.5027823792
+刘复之 13.2075304714
+一百二十刀 13.2075304714
+劳雷尔 13.2075304714
+创作经验 11.1280889297
+夏禹建国 12.8020653633
+富民政策 13.900677652
+合作意向 10.604840786
+噶伦 11.9547675029
+尿片 11.8212361103
+散发 8.04560572977
+轰响 10.2630914922
+教起 12.8020653633
+等着瞧 10.1630080337
+西北方 10.3453295905
+拼字游戏 13.900677652
+迁西县 13.2075304714
+千佛殿 12.2912397395
+沼泽 7.86280673205
+秋道 12.8020653633
+诉说着 10.765183436
+散去 8.71329184614
+再别 11.3357282945
+浮山县 13.900677652
+妻贤夫祸少 13.2075304714
+梦幻泡影 11.9547675029
+一鳞半爪 12.1089181827
+侯之子 12.8020653633
+秦俑 11.598092559
+挡风玻璃 9.96885201925
+骨质增生 11.8212361103
+受访者 9.21854642485
+塌下 12.5143832909
+金阁寺 12.5143832909
+竹林镇 12.1089181827
+便民措施 13.900677652
+混凝土块 13.2075304714
+雷统 12.8020653633
+姑嫂俩 11.9547675029
+学坏 11.1926274509
+新文艺 12.1089181827
+两三杯 13.2075304714
+向襄邑 12.8020653633
+比登 10.4041700905
+避难 8.86372504956
+穿甲弹 9.46986085313
+止涨 11.9547675029
+等势面 11.9547675029
+暗褐色 9.91169360541
+古墓葬 10.642581114
+含盐 10.8096351986
+生男生女 12.2912397395
+启明星 10.604840786
+大石镇 13.900677652
+富尔克 12.5143832909
+马瑟 12.8020653633
+泡桐树 11.598092559
+错误诊断 13.900677652
+星火 10.533381822
+伏虎 10.9562386728
+福份 12.8020653633
+体认到 13.2075304714
+砍铁如泥 13.900677652
+邵峰 13.2075304714
+散居 8.97342396682
+孔藻 12.8020653633
+马瑶 13.900677652
+雷焕 13.2075304714
+初创期 10.8561552143
+无意之中 11.0674643079
+代旗 12.8020653633
+飞速发展 9.27570483869
+代斯 13.2075304714
+理法 11.4157710022
+尹者极 12.8020653633
+新税法 12.2912397395
+这两点 10.2630914922
+廿九 13.900677652
+赫勒 12.2912397395
+休息厅 11.9547675029
+空气流通 10.1871055853
+空气流速 13.2075304714
+挖得 10.8096351986
+七张 11.9547675029
+涌出 8.36728816325
+属国 9.36807815882
+商茶 12.1089181827
+外国化 13.900677652
+马琬 13.2075304714
+死掉 9.89334446674
+突出者 12.8020653633
+散射 8.87679713113
+柳浪 13.2075304714
+马琳 12.8020653633
+表演台 12.8020653633
+切削用量 12.8020653633
+汉臣 10.4666904475
+宝塔山 11.598092559
+梁清标 12.8020653633
+理气 9.62401153296
+珊瑚 7.66235302694
+瑞土 13.900677652
+集安县 12.5143832909
+比目 12.5143832909
+吾侪 13.2075304714
+背诵 9.02548032877
+马瓒 13.900677652
+寸长 12.8020653633
+复命 9.44633035572
+第十版 13.900677652
+一千二百多万 13.2075304714
+代数 8.61747392324
+王西 11.8212361103
+性命之忧 11.4157710022
+生产秩序 11.9547675029
+寺里 9.06439574502
+厂级 13.900677652
+华阳路 13.900677652
+赫利 13.2075304714
+藏亚菊 12.1089181827
+厂纪 13.900677652
+老河口 10.765183436
+颂德 12.2912397395
+另一家 8.87679713113
+小黑子 10.7226238216
+海城人 11.9547675029
+翻掉 12.5143832909
+复员 9.27570483869
+表侄 11.8212361103
+挖开 9.30555780184
+贡献度 10.1871055853
+准备就绪 9.53122979951
+逼走 11.0103058941
+二十多匹 12.8020653633
+侯老爷 13.900677652
+打吊针 13.900677652
+悠然 10.0940151622
+刘炜 12.2912397395
+王瑞 11.0103058941
+选萃 13.900677652
+灰蓬蓬 13.2075304714
+鱼虞模 13.900677652
+代收 9.93038573842
+望翠华 13.2075304714
+尿素 8.99540287354
+越国 10.0088573539
+牧誓 11.9547675029
+里利昂 13.900677652
+复名 9.91169360541
+第六十九章 13.2075304714
+胶鞋 10.1630080337
+复合 7.53420720424
+幸桓鲂 12.8020653633
+王褒 11.1280889297
+王公公 10.8561552143
+帝鸿 12.8020653633
+实在太 8.1641053545
+铬黄 13.900677652
+吾主 10.4666904475
+利可图 12.2912397395
+不近人情 10.5684731418
+淑芳 11.1280889297
+孺子不可 13.2075304714
+利物浦 9.29550746599
+柳氏 10.642581114
+马享佐 12.8020653633
+室外运动 13.900677652
+羁留 11.1926274509
+婕妤 12.8020653633
+杜敬臣 13.900677652
+穆尔西 12.8020653633
+绿皮书 9.43476953332
+古装剧 13.900677652
+翻成 11.2616203224
+陆放翁 12.2912397395
+阿尔明尼 13.2075304714
+蓝白 11.3357282945
+四季常青 11.1926274509
+寸铁 12.8020653633
+米脂县 10.604840786
+四满 13.900677652
+投入资本 10.5684731418
+使用证 10.765183436
+比着 11.2616203224
+元义宁 12.2912397395
+刘焉 11.598092559
+柳江 10.0940151622
+夏雨型 12.8020653633
+卵块 11.5027823792
+雷火 10.7226238216
+翻找 10.8096351986
+埃文基 13.900677652
+四溅 10.5684731418
+天主教 7.44233936863
+乔山 13.2075304714
+渐近线 12.8020653633
+马蹄形 9.98865464655
+包庇 9.62401153296
+刘焯 12.2912397395
+砸毁 12.2912397395
+授予权 13.900677652
+四溢 10.0088573539
+诉诸武力 11.5027823792
+涂饰 11.1280889297
+德罗夫 13.900677652
+翻手 12.5143832909
+死心塌地 9.53122979951
+黄影 13.2075304714
+斯特凡 11.5027823792
+偏转板 13.900677652
+吾人 12.5143832909
+含着 8.71329184614
+遗老遗少 11.598092559
+四湖 11.7034530746
+表亲 11.0674643079
+运筹帷幄之中 12.8020653633
+散工 12.2912397395
+止水 11.7034530746
+二八线 11.8212361103
+艾火纳 13.900677652
+补骨脂 11.8212361103
+十三枪 13.900677652
+擂打 13.2075304714
+子宫癌 12.8020653633
+瞎了眼睛 11.598092559
+阳虎 12.8020653633
+整份 13.900677652
+整件 11.5027823792
+草木灰 11.0674643079
+维护正义 13.2075304714
+王衍 10.8561552143
+家当 9.25628675283
+瞿希贤 12.5143832909
+搞不清楚 10.2630914922
+克洛代尔 11.9547675029
+胖人 12.1089181827
+打比方 12.1089181827
+伦帕河 13.900677652
+教范 13.900677652
+洪范九畴 13.900677652
+微绒毛 13.2075304714
+个人隐私 10.8096351986
+刘熙 11.2616203224
+斯特克 12.8020653633
+阿美族 12.5143832909
+四清 10.9049453784
+整了 10.604840786
+未成年工 12.2912397395
+国际会议中心 11.1280889297
+四渎 11.1926274509
+萨维奇 12.2912397395
+整人 10.642581114
+奋迅 13.900677652
+格瑞 13.900677652
+行为能力 10.2117981979
+斯特兰 12.1089181827
+对着干 11.2616203224
+棕榈树 11.4157710022
+奋进 11.0103058941
+无时 10.3453295905
+蓝皮 13.2075304714
+十二金牌 13.900677652
+降伏 10.2897597393
+翻拍 11.8212361103
+入禀 13.900677652
+身无立锥 13.900677652
+切片检查 12.5143832909
+数十遍 13.2075304714
+王侗继 12.8020653633
+落地窗 11.3357282945
+进行批评 11.598092559
+电感应 12.5143832909
+原官品 13.900677652
+修桥铺路 13.2075304714
+摩擦力 9.87532596124
+自寻死路 11.4157710022
+臭名远扬 11.8212361103
+汉莎 11.8212361103
+复国 9.49395840471
+王诸 13.2075304714
+抵得过 12.2912397395
+涌去 11.3357282945
+孙长老 12.5143832909
+金融危机 5.70479226066
+投江 10.642581114
+阴骘 11.1280889297
+邵建 12.2912397395
+孙代 13.900677652
+非地带性 10.6818018271
+斯特劳 11.7034530746
+刘牧 12.5143832909
+埃奈斯 12.5143832909
+宋抗金 11.1280889297
+古印度 9.91169360541
+尉犁县 12.2912397395
+伊塞克湖 10.8096351986
+热升华 13.900677652
+拆白道字 13.900677652
+人权记录 13.900677652
+单枪匹马 10.2371160058
+孙仲 12.5143832909
+马登 13.900677652
+不问青红皂白 11.0103058941
+邵府 11.9547675029
+饭豆 12.5143832909
+酸味 10.2897597393
+张立文 13.2075304714
+散席 11.2616203224
+未命名 12.2912397395
+投水 10.0505300503
+莫里斯 10.1630080337
+斯特勒 13.2075304714
+王元琰 13.900677652
+赛神 11.598092559
+白面书生 11.5027823792
+土风 12.5143832909
+腰刀 9.33632946051
+军旗 10.0294766411
+能臣 11.3357282945
+谷叶子 13.2075304714
+浮想 13.2075304714
+陶使君 13.2075304714
+逼迫 8.63798746307
+哄笑 9.56994431169
+吉尔扎 12.1089181827
+寝食 11.7034530746
+蓝田 9.0884932966
+逼近 7.4023955025
+鼓鼓 11.7034530746
+养媳妇 13.2075304714
+戍守 10.0294766411
+各从其类 13.900677652
+逼过 12.8020653633
+散帙 13.900677652
+延平 10.9049453784
+卢先生 12.8020653633
+教育 5.6783925781
+刘父 13.2075304714
+刘爷 8.89004235788
+十五六天 12.8020653633
+工农子弟 12.8020653633
+孙么 13.900677652
+孙之 10.8561552143
+陈宝柱 8.73589167805
+猿类 12.2912397395
+教职 10.3743171274
+斯特列 12.2912397395
+幸桓黾 12.8020653633
+驻港部队 13.2075304714
+识时务者为俊杰 11.598092559
+玛蒂 12.8020653633
+四流 13.2075304714
+投注 10.3171587135
+马监 10.9562386728
+徐玉兰 12.2912397395
+东胜市 11.7034530746
+大球场 13.2075304714
+风清月明 13.900677652
+鬓毛 13.2075304714
+关破秦 13.2075304714
+四海 8.70772080109
+软件程序 13.900677652
+对外贸易经济合作部 13.900677652
+民俗风情 11.7034530746
+投法 12.8020653633
+科罗拉多河 11.0103058941
+梁氏告 12.8020653633
+关键人物 10.765183436
+马直 11.9547675029
+许多程 13.900677652
+斯特利 13.2075304714
+孙乾 10.0720362555
+蜗壳 12.8020653633
+白银区 13.900677652
+第一桶金 11.0103058941
+容恕 12.8020653633
+言犹在耳 11.7034530746
+渊博 9.94943393339
+阿斯塔 13.900677652
+腰力 12.2912397395
+黄薇 13.900677652
+散座 12.2912397395
+四洞 13.2075304714
+容性 11.598092559
+昂奋 11.9547675029
+桩木 12.8020653633
+往上拉 12.5143832909
+摩擦剂 13.900677652
+雹灾 11.1926274509
+刘大夫 13.900677652
+毁于蚁穴 13.900677652
+取之有道 11.3357282945
+从明叔 12.8020653633
+桓帝 10.2897597393
+马皮 11.7034530746
+丛牡丹 12.8020653633
+四派 13.900677652
+公路线 10.8561552143
+扎龙 11.0674643079
+转弯处 10.642581114
+枕头套 12.5143832909
+伏蒙 12.8020653633
+代朕 11.0674643079
+孙俊 11.2616203224
+宝塔式 13.2075304714
+威斯汀 10.6818018271
+扳起来 13.2075304714
+投海 11.3357282945
+球面三角 12.1089181827
+脍炙 13.2075304714
+巴伦西 13.900677652
+代替 6.54951942555
+特维克 13.2075304714
+如此说来 9.98865464655
+兰姆赛 12.8020653633
+宗教音乐 11.0674643079
+腹心之患 11.8212361103
+头孢菌素 11.1926274509
+强逞暴 13.900677652
+中龙 11.8212361103
+事故现场 10.5684731418
+抑制性 10.8561552143
+达标 9.00283785202
+轻浮 9.98865464655
+安人运 12.2912397395
+背街 12.1089181827
+去死皮 12.5143832909
+宋大哥 13.900677652
+恶作剧 9.89334446674
+喀喇沁左翼 13.2075304714
+夺标 11.7034530746
+三大法宝 12.2912397395
+亲临现场 11.1926274509
+三打 11.4157710022
+精神失常 10.8561552143
+航线 7.36253782821
+一会儿打 13.900677652
+比画 10.9049453784
+国家气象中心 13.900677652
+有善德 12.5143832909
+曹两营 10.9562386728
+刁吉儿 12.8020653633
+简政放权 12.8020653633
+卧游 13.2075304714
+翟宏营 13.900677652
+汨罗江 10.9049453784
+散弹 12.8020653633
+克制不住 12.1089181827
+可用资金 12.1089181827
+角动量 9.91169360541
+腰包 9.37888907493
+马真 13.900677652
+草木犀 11.8212361103
+财务部门 9.72629038208
+雷特 11.8212361103
+出芽生殖 11.8212361103
+自由贸易区 9.87532596124
+充放电 12.1089181827
+耶律宗云 13.2075304714
+宝塔形 12.2912397395
+养正兄 11.7034530746
+散开 8.79473217808
+三手 13.2075304714
+占卜者 12.8020653633
+襟里 13.2075304714
+立身行事 11.8212361103
+马眼 11.9547675029
+仰脸 10.1630080337
+犯贱 11.9547675029
+斯波莱 12.8020653633
+各尽所能 11.598092559
+刘珏 13.2075304714
+刘珍 13.2075304714
+市管县 12.2912397395
+张家弟弟 13.2075304714
+抢占市场 10.4041700905
+止渴 10.9562386728
+玉圣宫 13.2075304714
+分不清楚 11.3357282945
+抒情歌 13.900677652
+蒙特苏 12.1089181827
+代晋 12.8020653633
+能耗 8.71889410168
+高热量 10.642581114
+能耐 8.84443184663
+赵秉钧 9.74179456862
+司户曹 13.2075304714
+散心 10.2117981979
+现世现报 12.8020653633
+滨海公路 13.900677652
+怪道 9.55687223012
+能者 11.3357282945
+兄长 7.90422556336
+干警 10.4666904475
+时报讯 10.7226238216
+淡蓝 11.0674643079
+四民 10.8096351986
+刘玉 11.4157710022
+病毒唑 12.2912397395
+孙伏 13.2075304714
+三步并作两步 10.3743171274
+李少春 11.8212361103
+改变现状 11.9547675029
+长江路 11.2616203224
+扁形动物 10.8561552143
+往上提 11.5027823792
+刘玄 10.8561552143
+延秋门 11.7034530746
+吕布败 13.900677652
+谋篇布局 11.3357282945
+县级 8.49350588052
+颉颃 11.5027823792
+周安王 13.2075304714
+罗城县 13.2075304714
+寸阴 12.8020653633
+率然 13.2075304714
+三千九百两 13.900677652
+三角测量 10.642581114
+子李期 13.2075304714
+势单力薄 11.5027823792
+资本输出 10.4349417492
+小驴子 13.900677652
+背袋 12.8020653633
+单身族 12.8020653633
+必经阶段 13.2075304714
+邵弥 13.2075304714
+齐亦 12.5143832909
+赫兹 9.77354326693
+由此可知 10.9049453784
+四氯 13.2075304714
+街边 10.2371160058
+蒙霜特 12.8020653633
+类产品 8.64840422393
+听诊器 10.4994802703
+连锁反应 9.35738286971
+三几年 12.8020653633
+比特 10.2630914922
+四毛 12.8020653633
+刘瑁 13.900677652
+王路 12.8020653633
+朱桓 12.1089181827
+中止执行 13.2075304714
+靖援台 12.8020653633
+雷电 8.90346537821
+那秀士 12.2912397395
+早饭 7.8093677699
+贝勒庙 13.2075304714
+刘瑜 13.900677652
+侯无人 13.2075304714
+越分 11.7034530746
+李可染 11.7034530746
+王跃 9.94943393339
+率直 11.1280889297
+祛邪 10.8561552143
+街衢 11.1926274509
+马灯 9.55687223012
+湿淋淋 10.0940151622
+越到 10.7226238216
+伍站 13.2075304714
+党龄 11.1280889297
+辞岁 12.5143832909
+刘瑾 9.77354326693
+胃穿孔 13.2075304714
+答词 12.5143832909
+寸金 12.5143832909
+凉飕飕 11.4157710022
+中子弹 10.9562386728
+老海瑞 12.8020653633
+党团组织 12.5143832909
+飞回去 13.2075304714
+刘球 13.900677652
+八廓街 13.900677652
+灰漠土 11.8212361103
+广通仓 12.5143832909
+审批权 10.9562386728
+喜闻乐见 10.8561552143
+退坡 13.2075304714
+陈梦雷 13.2075304714
+汉藏 10.6818018271
+淡茶 12.2912397395
+火灾现场 13.900677652
+架出 13.900677652
+土黄 12.1089181827
+吴川市 13.900677652
+伤透 10.642581114
+刘琨 11.1280889297
+刘琮 11.1280889297
+四段 11.7034530746
+冲昏头脑 11.7034530746
+早餐 8.59737274392
+选育 9.7898037878
+刘琦 10.604840786
+朱明江山 12.8020653633
+四十五分 12.8020653633
+逼视 10.4041700905
+延师 12.2912397395
+叶芽 11.3357282945
+伤逝 11.598092559
+庚午日 13.900677652
+刘琼 13.2075304714
+刘琳 12.1089181827
+越剧 10.3743171274
+于夷仪 13.2075304714
+鸟枪换炮 11.9547675029
+复健 13.900677652
+选聘 11.0674643079
+备受凌辱 13.900677652
+抗原呈递 13.900677652
+龙木 12.8020653633
+卧槽 13.900677652
+收养人 12.8020653633
+苦功夫 13.2075304714
+换羽 11.598092559
+携带方便 10.8561552143
+萨维尼 12.2912397395
+银贵铜 13.2075304714
+多磨 12.2912397395
+背过 9.28555713513
+斯特拉福德 12.8020653633
+寄予 9.72629038208
+一百二十处 13.2075304714
+几千千瓦 13.2075304714
+心手相应 13.900677652
+庇护权 12.2912397395
+老桂树 12.8020653633
+萨维尔 12.1089181827
+磨床 10.8096351986
+交换文件 12.2912397395
+四步 11.7034530746
+辗米 13.900677652
+技术科 13.2075304714
+越加 9.55687223012
+淡菜 11.8212361103
+土鸡 11.9547675029
+刘璋 9.7898037878
+个贷 9.38981814546
+不成形 11.8212361103
+惦念 10.9049453784
+干谒 13.900677652
+殷商 9.16447920358
+晴雨表 9.16447920358
+卧榻 10.3453295905
+刘璇 12.8020653633
+大金矿 11.8212361103
+王贲 10.8096351986
+高温作业 13.900677652
+咋样 9.22784881751
+翻查 11.8212361103
+身子骨 9.7898037878
+套来套去 13.900677652
+黄征 13.2075304714
+蓝玉 10.533381822
+李春平 13.900677652
+晓色 11.598092559
+罗斯托夫 10.533381822
+斯卡罗 13.900677652
+遂昌县 13.2075304714
+干谷 11.4157710022
+比奈智 12.2912397395
+百分之二百 12.1089181827
+斯岛巨 12.5143832909
+四款 10.8561552143
+掩不住 10.8561552143
+土门关 13.2075304714
+函谷关 10.1164880181
+四次 8.71889410168
+多亿元 8.63798746307
+菜子油 10.9049453784
+一截 9.04086524761
+反担保 12.1089181827
+容易 5.41394366804
+殊荣 9.37888907493
+剔出 11.9547675029
+古尔盾 13.900677652
+汉蒙 12.2912397395
+柳树 8.9102450652
+蓝牙 10.8561552143
+插足于 13.2075304714
+蓝牛 12.8020653633
+刘畅 11.4157710022
+心灵感应 12.8020653633
+椰树 11.5027823792
+韩祗 13.900677652
+一四 13.2075304714
+复函 11.1280889297
+中办发 13.900677652
+痛觉 10.4994802703
+雷琼 11.4157710022
+名正言顺 9.41204128224
+复出 9.04086524761
+李俊见 12.1089181827
+含珠 11.7034530746
+越区 13.900677652
+保慈丹 13.900677652
+一回 6.71832554009
+密密丛丛 13.900677652
+余味无穷 12.8020653633
+吴伐越 12.2912397395
+棕榈泉 13.2075304714
+运河区 11.7034530746
+东乡语 12.8020653633
+选自 10.7226238216
+章京统 13.2075304714
+干路 13.2075304714
+散套 12.2912397395
+生殖器 9.38981814546
+机动性 8.31342899358
+越南 7.38744754106
+分秒不差 12.8020653633
+种类物 13.2075304714
+栈单 12.8020653633
+汉蓉 13.2075304714
+金盆 11.0103058941
+成心 9.91169360541
+家帮 13.900677652
+先存 12.1089181827
+少男 12.2912397395
+散失 9.4233408375
+北京医科大学 11.598092559
+日本东京大学 11.8212361103
+众说不一 11.4157710022
+不可思议 8.37921673411
+惊天地泣鬼神 13.900677652
+逐客 12.2912397395
+表演团 12.8020653633
+露在 12.8020653633
+音波 13.900677652
+师北征 11.5027823792
+眩光 12.1089181827
+不更事 13.2075304714
+郑文公 12.5143832909
+一箭地 13.2075304714
+夏雨去 11.8212361103
+改则 13.2075304714
+乡土文学 11.9547675029
+张国强 12.8020653633
+高中文化 12.5143832909
+吉尔斯 12.5143832909
+王象 12.8020653633
+蓝狐 13.2075304714
+左翼文化运动 12.1089181827
+一如往昔 12.8020653633
+坷垃 12.5143832909
+张开嘴巴 11.1926274509
+基马尔 12.8020653633
+昏昏然 11.8212361103
+街角 11.7034530746
+复关 13.900677652
+堆有 13.900677652
+黑尔斯 13.2075304714
+玛莉 12.2912397395
+玛莎 11.598092559
+起不来 9.93038573842
+林金树 12.5143832909
+垂周分裂 12.8020653633
+干起 10.0720362555
+复元 11.8212361103
+大剑师 13.2075304714
+霞山 13.2075304714
+在精神上 10.1394775363
+夏雨占 13.900677652
+余情 13.900677652
+投毒 11.5027823792
+汉萨 10.6818018271
+鼓风 10.765183436
+涌向 9.69598503258
+邦政府 11.8212361103
+柳梢 11.8212361103
+情不自禁 8.6966709649
+王谧 13.900677652
+王谦 13.2075304714
+三岔路口 11.2616203224
+率真 10.9562386728
+干贝 11.9547675029
+乌溪南 12.5143832909
+马熊 10.8096351986
+越发 7.19748953873
+肠绒毛 12.1089181827
+永定县 12.5143832909
+索马里 8.9308643524
+营业税 8.47133202302
+马变龙 12.8020653633
+富士康 10.4349417492
+现象界 12.2912397395
+半岛网 12.5143832909
+中年人 8.88339781516
+百分之七十五 13.900677652
+郑佩佩 13.900677652
+灵界 13.2075304714
+从腔子 12.8020653633
+交响曲 9.19114745066
+柳棵 11.5027823792
+和尾羽 12.2912397395
+花明楼 12.2912397395
+干货 11.1926274509
+深居简出 11.1280889297
+比率 7.67414098269
+巴亭广场 12.8020653633
+江洋大盗 11.5027823792
+但东林 13.2075304714
+李瞎子 11.5027823792
+尝尝鲜 12.8020653633
+瑞军 13.2075304714
+好的开始 11.3357282945
+稍纵即逝 10.2897597393
+卫浴 9.89334446674
+翻改 13.900677652
+健步如飞 12.1089181827
+气头上 10.604840786
+月白色 11.1280889297
+异文 10.5684731418
+居皇后 13.2075304714
+阴谋活动 10.8561552143
+滞后性 9.96885201925
+人生在世 10.533381822
+一百二十家 12.5143832909
+母熊 11.9547675029
+马牛 11.4157710022
+白塔路 13.900677652
+黯淡无光 12.1089181827
+涂鸦 12.1089181827
+中国人民解放军军事科学院 12.8020653633
+正因如此 9.77354326693
+王迎 13.2075304714
+洞内 9.28555713513
+关帝山 11.7034530746
+贪官污吏 9.80633308975
+马牵 10.765183436
+上沃尔特 12.8020653633
+投案 10.9049453784
+刘白 13.2075304714
+王进 9.66657114738
+箬帽 13.900677652
+一圈 7.62968922012
+马特 10.604840786
+踢毽子 11.9547675029
+吉打 11.598092559
+史无详 13.2075304714
+土鳖 12.2912397395
+二百八十元 13.900677652
+一万九千余 13.2075304714
+局里 10.2630914922
+秦氏笑 12.5143832909
+金青罗 13.2075304714
+各考点 12.8020653633
+手携手 13.900677652
+吕布袭 12.2912397395
+金吾耿 12.2912397395
+航管 12.2912397395
+玄岳门 12.8020653633
+五万七千多 13.2075304714
+拘神遣将 13.900677652
+东巴文 11.9547675029
+无利可图 10.533381822
+价低 11.7034530746
+王辉 11.2616203224
+芸豆 11.7034530746
+交朋结友 13.900677652
+赫哲 11.1926274509
+巾帼英雄 10.6818018271
+王辛 13.900677652
+背负 9.32596667347
+投标 8.60737282725
+先记 11.9547675029
+鲜甜嫩 13.900677652
+扑进去 12.5143832909
+梳洗打扮 11.5027823792
+人头像 12.5143832909
+翻新 9.72629038208
+东北方向 10.2117981979
+陈绍基 12.2912397395
+代换 11.5027823792
+饭袋 12.5143832909
+硝酸汞 13.2075304714
+集团型 13.2075304714
+实效性 11.2616203224
+比热 10.533381822
+吴兵远 12.5143832909
+贝勒尔 13.900677652
+多级火箭 11.9547675029
+北昭武 12.8020653633
+奋袂 13.2075304714
+悠着 12.5143832909
+翻斗 13.900677652
+腰围 10.4994802703
+健全性 13.900677652
+围过去 12.8020653633
+吴书的 13.2075304714
+美国芭蕾舞剧院 12.8020653633
+没错儿 11.4157710022
+四楼 10.1871055853
+霞彩 11.598092559
+小龙潭 12.1089181827
+颔下 11.1280889297
+表演唱 12.8020653633
+挤时间 12.8020653633
+黄头发 11.2616203224
+杨锐密 12.8020653633
+止步 9.65218240993
+天津队 13.900677652
+弓阿帕 13.2075304714
+低损耗 13.2075304714
+复利 9.71102290995
+投梭 12.2912397395
+中华预防医学会 13.900677652
+龚宝铨 12.2912397395
+复制 7.91171623509
+明安图 12.8020653633
+涂黑 11.7034530746
+於帝 13.900677652
+复刻 12.2912397395
+艺术大师 11.0674643079
+总耗 13.900677652
+鄂尔勒 12.8020653633
+鲁梅尼 12.8020653633
+葛城臣 13.900677652
+运算符 13.2075304714
+仓促应战 12.2912397395
+马蹄声 8.70772080109
+掌舵者 12.5143832909
+博物馆学 11.598092559
+官田额 12.8020653633
+青堂瓦舍 12.8020653633
+格状 10.4994802703
+复古 9.53122979951
+伏羲陵 13.900677652
+扎马 12.8020653633
+意外获得 13.900677652
+活食 13.900677652
+干连 13.2075304714
+散学 13.2075304714
+寺院 7.83225206373
+萨维德 12.8020653633
+癔症 12.8020653633
+复叶 10.0505300503
+故事梗概 12.5143832909
+北京音乐厅 12.8020653633
+存根联 13.900677652
+大事不好 10.4994802703
+架势 8.69119149913
+库尔察 13.2075304714
+于银河 12.8020653633
+蓝灰 12.5143832909
+四棵 11.3357282945
+出死力 11.1280889297
+康泰和 13.2075304714
+一紧 9.5186510173
+贡献奖 10.7226238216
+复发 8.98069672615
+子弘略 13.2075304714
+石灰华 12.5143832909
+文献片 13.900677652
+蓝灯 13.900677652
+纤纤玉手 12.5143832909
+复变 10.2630914922
+数控系统 12.2912397395
+柳橙 13.2075304714
+达文西 13.900677652
+偏得 12.8020653633
+纨扇 12.1089181827
+背谬 13.900677652
+放长假 13.900677652
+吉尔松 12.8020653633
+动了动 10.1871055853
+鄂托克 13.2075304714
+一百十一万 13.2075304714
+兼容性问题 13.2075304714
+恍若隔世 11.4157710022
+紫金山天文台 10.2630914922
+夏雨冬 12.5143832909
+容斋 11.598092559
+不知深浅 10.765183436
+伏脉 12.2912397395
+越兴 12.8020653633
+潜航 11.0674643079
+干达 12.1089181827
+安知非 13.2075304714
+越共 11.9547675029
+西谷米 12.5143832909
+莫折念 13.2075304714
+马猴 11.598092559
+从迎霜 13.2075304714
+复原 8.5440913773
+碾碎 10.7226238216
+乔戈里峰 10.4666904475
+希尔特 13.900677652
+雄师百万 13.2075304714
+非上市 9.59661255877
+三开 12.1089181827
+航空 6.46582977676
+越军 10.4041700905
+代扣 11.3357282945
+装满 8.74162235276
+蓝烟 10.9562386728
+犯规 9.94943393339
+紫金县 13.900677652
+舞刀弄枪 12.2912397395
+架到 11.9547675029
+相让 10.1871055853
+索尔仁 12.5143832909
+复印 9.80633308975
+锋不可当 13.2075304714
+陈潭秋 11.4157710022
+拉乔夫 13.2075304714
+柴进奏 13.900677652
+李麦忙 11.7034530746
+展览馆 10.1871055853
+斯蒂格利茨 10.0294766411
+痛苦万分 11.9547675029
+官王振 12.8020653633
+逃开 10.3453295905
+复华 11.9547675029
+古树盘 13.2075304714
+盛仲文 12.8020653633
+刘知 12.5143832909
+四档 12.1089181827
+周八师 12.1089181827
+汤老爷 12.1089181827
+县立 11.9547675029
+有源 10.0088573539
+乳山市 12.8020653633
+雾灵山 11.5027823792
+物美价廉 10.2630914922
+三排 11.0103058941
+豚草 13.2075304714
+封闭疗法 12.2912397395
+昨夜里 11.2616203224
+整朵花 13.2075304714
+连三接四 13.900677652
+霞帔 11.598092559
+马王 13.900677652
+李守耕 11.9547675029
+格特 12.5143832909
+骆绎不绝 13.900677652
+皇庙 13.900677652
+真豪杰 12.8020653633
+奥列格 12.1089181827
+四栋 13.2075304714
+搭上 9.18217878068
+大剑山 12.2912397395
+格物 11.1280889297
+深度知觉 12.5143832909
+四样 10.642581114
+童子军 10.6818018271
+潜艇 7.37271973435
+四根 10.0940151622
+蓝点 12.5143832909
+一坐 10.2117981979
+威悉河 12.8020653633
+四格 13.2075304714
+大师傅 10.9562386728
+黄帝 8.68574189437
+颂声 13.2075304714
+昂山 11.7034530746
+航程 8.31342899358
+先声夺人 11.2616203224
+四株 13.900677652
+通用机架 13.2075304714
+国家工商 13.2075304714
+比湿 13.2075304714
+清洁用品 12.2912397395
+柳生 12.2912397395
+农业县 10.533381822
+网友聚会 13.900677652
+整块 9.85762638414
+鲁米 11.8212361103
+胶轮 12.2912397395
+马汉 11.5027823792
+布拉格堡 11.1280889297
+蚕桑业 11.3357282945
+宿儒 12.2912397395
+苏康 13.2075304714
+马江 11.7034530746
+望安 13.2075304714
+胡广 13.900677652
+椰林 11.5027823792
+怪话 10.4666904475
+怪诞 9.89334446674
+弥天大祸 12.2912397395
+电脑前 10.8561552143
+表土 10.533381822
+马池 12.8020653633
+瞎子摸象 13.2075304714
+刘桢 12.5143832909
+很圆 13.2075304714
+朱棣 9.41204128224
+王重 12.1089181827
+罗希洛夫 12.2912397395
+干燥器 11.7034530746
+乌伊 12.8020653633
+枪子儿 10.3453295905
+两服 12.8020653633
+瑞丽市 12.5143832909
+暖暖地 13.900677652
+预科 10.3171587135
+干部 6.29379312076
+司卫所 11.0103058941
+狄奥克 13.900677652
+县政 12.2912397395
+烤化 13.900677652
+四十五个 13.2075304714
+带电体 10.8561552143
+文化氛围 10.4994802703
+布拉德利 12.8020653633
+马氏 10.4349417492
+雅科夫列夫 12.8020653633
+哈尔 9.87532596124
+民族语言 9.54396882529
+顺风耳 10.9562386728
+文帝霸 13.900677652
+螺旋形 10.3171587135
+二百八十余 13.900677652
+凸凹性 13.900677652
+逼问 10.2371160058
+马尔克斯 11.8212361103
+州际 12.2912397395
+王得禄 13.2075304714
+广州中山大学 12.1089181827
+胡布 13.900677652
+整场 12.2912397395
+张立群 10.1630080337
+破绽百出 13.2075304714
+兰州军区 11.2616203224
+整地 10.6818018271
+四十五万 13.2075304714
+油气藏 10.765183436
+刘根 13.2075304714
+止痒 10.7226238216
+联系方法 13.2075304714
+国之宝 12.5143832909
+马永 10.5684731418
+止痛 9.08039608637
+两万八千余 13.2075304714
+雷德河 13.2075304714
+干道 9.87532596124
+库伦旗 12.2912397395
+地铁线 11.7034530746
+七十里 10.9562386728
+竹筒倒豆子 11.4157710022
+果胶酶 12.8020653633
+张可旺 9.7898037878
+理理 12.1089181827
+李大宽 12.8020653633
+班杜拉 12.5143832909
+第五十一章 11.3357282945
+唱票 12.1089181827
+以罚代刑 12.5143832909
+巴勒斯坦地区 11.8212361103
+苏希 13.900677652
+埃林顿 12.5143832909
+宕昌 12.2912397395
+家庭教育 10.4994802703
+九百五十六万七千二百六十一户 13.2075304714
+故计重施 13.2075304714
+格洛 11.8212361103
+张敬安 13.900677652
+会计信息 11.5027823792
+卧病 10.4041700905
+药源性 13.2075304714
+马泰 13.900677652
+综合局 13.900677652
+中华世纪坛 13.900677652
+实告 11.3357282945
+传神写照 13.900677652
+生理卫生 12.1089181827
+袁纯清 12.8020653633
+望子 12.2912397395
+品行端正 12.2912397395
+整型 11.0103058941
+胡康 12.8020653633
+四十五亿 13.900677652
+狂风骤雨 11.8212361103
+雷槽 12.8020653633
+干透 10.8096351986
+苏平 13.2075304714
+资料汇编 10.9049453784
+日常性 13.900677652
+马儿跑 12.5143832909
+胶辊 13.2075304714
+比人强 12.1089181827
+土色 11.5027823792
+四眼 12.1089181827
+整垮 11.5027823792
+犯难 10.3453295905
+涂胶 12.5143832909
+加强连 11.9547675029
+瓦克夫 12.8020653633
+马河 11.1280889297
+全耗 13.900677652
+辅导站 13.900677652
+马沽 13.2075304714
+拈度 12.5143832909
+孙吴 9.7898037878
+蒂诺 11.8212361103
+敖广 11.598092559
+计算机系统 9.11318590919
+洛钟宫 13.900677652
+带队参加 13.900677652
+格河 12.8020653633
+小山村 11.3357282945
+理疗 10.1164880181
+二百八十万 13.2075304714
+瑞云 11.9547675029
+林宝仁 13.900677652
+四盘 11.598092559
+熊赐履 9.30555780184
+参加考试 10.4994802703
+千万座 13.900677652
+千万度 13.2075304714
+垄沟 11.1926274509
+滴水岩 12.5143832909
+四盆 13.900677652
+苏德 9.71102290995
+回家途中 13.2075304714
+价值 4.86528608246
+憎水 13.900677652
+王都 11.0674643079
+多愁善感 11.0674643079
+甘肃省 8.28390655431
+大肚腩 12.5143832909
+两败俱伤 10.765183436
+眼明心亮 13.900677652
+覆盆子 12.8020653633
+解下红 13.2075304714
+长生子 13.900677652
+古楚汗 13.2075304714
+遂心如意 13.2075304714
+本主儿 13.900677652
+德威尔 12.5143832909
+涂脸 12.5143832909
+四目 10.3171587135
+替代性 10.4041700905
+喻于义 13.900677652
+保安员 11.1280889297
+狗尾巴草 12.5143832909
+刘植 13.900677652
+说不出 7.47095817394
+吴太子入 13.2075304714
+伤财 13.2075304714
+扎营 9.49395840471
+越位 10.9049453784
+和兆海 13.2075304714
+钨酸盐 12.5143832909
+餍足 11.7034530746
+从下向上 12.8020653633
+马洛 11.7034530746
+拈弄 13.2075304714
+霏霏 11.598092559
+五七斤 12.8020653633
+格法 12.5143832909
+麻制绳 13.2075304714
+袋熊 12.8020653633
+宋大人 11.9547675029
+电脑包 12.5143832909
+法人股 9.37888907493
+王邑 12.1089181827
+赴席 10.5684731418
+兵无常势 13.2075304714
+孙如琦 12.8020653633
+死中求生 12.2912397395
+苏志 12.8020653633
+元素符号 11.7034530746
+书信集 11.598092559
+泰陵 11.4157710022
+黄酮类 10.9562386728
+电脑化 13.2075304714
+亚太经济合作组织 10.1871055853
+立福王 11.1280889297
+德维佳 13.2075304714
+面密度 13.2075304714
+东五环 12.8020653633
+胡厚宣 11.8212361103
+立信 10.9049453784
+投石 11.0674643079
+布多夫 13.2075304714
+臧桥 12.5143832909
+顾嗣立 12.8020653633
+凌人 12.5143832909
+王遵 12.8020653633
+旷达 11.598092559
+涂膜 13.2075304714
+周自公 12.8020653633
+古树森 13.900677652
+反演中心 13.900677652
+别支 12.8020653633
+狗牙草 13.900677652
+苏式 10.6818018271
+龙羊峡 10.533381822
+扑翻 11.9547675029
+整固 8.95903522937
+瑞丽 11.2616203224
+海桐花 12.8020653633
+哈巴 10.8561552143
+街门 10.2897597393
+王道 9.59661255877
+一九三二年 12.8020653633
+盘陀路 12.8020653633
+胡志 11.8212361103
+霍芬 11.0674643079
+格氏 12.5143832909
+第五十一篇 13.2075304714
+整团 12.8020653633
+干酪 10.642581114
+芳名 10.9049453784
+收上去 13.900677652
+仇兼琼 12.5143832909
+吾国 11.8212361103
+连篇累牍 11.5027823792
+外商投资 9.35738286971
+兰蒂 12.8020653633
+满庚哥 10.4994802703
+贼兵 8.65893063692
+荒诞不经 10.4994802703
+王逵 12.5143832909
+乌桓族 13.2075304714
+德国西门子公司 12.2912397395
+基尼斯 13.900677652
+王逸 11.7034530746
+千万年 10.2371160058
+头壳 12.5143832909
+老君眉 12.8020653633
+英格利 13.900677652
+王选 11.8212361103
+雷棋 12.2912397395
+股肱之力 13.2075304714
+平分秋色 11.1280889297
+键槽 13.2075304714
+伏龙 11.7034530746
+温带气候 10.7226238216
+秦始 11.8212361103
+雷棚 13.900677652
+蹴鞠 12.5143832909
+欧内斯特 12.8020653633
+上百 10.1630080337
+苏岩 10.8096351986
+甘草片 12.8020653633
+石灰乳 12.1089181827
+毛活儿 13.900677652
+随风而去 12.1089181827
+施瓦茨 13.900677652
+拉三扯四 13.900677652
+八仙洞 12.5143832909
+小小子儿 12.8020653633
+托莫河 13.900677652
+荣作佳 13.2075304714
+复任 10.1164880181
+复仇 8.80081122415
+孙园 12.8020653633
+含泪 9.17328983326
+孙嘉绩 9.16447920358
+长生塔 13.900677652
+卧着 11.5027823792
+滔滔滚滚 13.900677652
+苗女 12.5143832909
+土肥 10.8096351986
+许仲琳 13.2075304714
+复交 10.4041700905
+柯萨可 13.900677652
+却会 9.75754292558
+胶质 9.12999302751
+于广陵 13.900677652
+家庭用品 11.9547675029
+闭门羹 11.3357282945
+燕交飞 13.2075304714
+大商股份 9.40086798165
+母懿旨 13.900677652
+苏峻 11.5027823792
+袋状 11.598092559
+哈希 11.9547675029
+搞不搞 12.2912397395
+美国加州大学洛杉矶分校 13.2075304714
+含沙 12.5143832909
+良好环境 10.4349417492
+无往不胜 13.2075304714
+银带 12.2912397395
+岂止 9.49395840471
+指距 13.900677652
+砸烂 9.91169360541
+坎比 12.8020653633
+印度尼西亚盾 13.900677652
+王鎏 12.8020653633
+马温 10.2117981979
+脑溢血 11.1926274509
+尝鼎一脔 13.2075304714
+冷夏凉 11.8212361103
+胡尔 11.9547675029
+蛭石 10.3453295905
+塌实 11.8212361103
+胡尘 12.8020653633
+含油 9.96885201925
+恨入骨髓 12.8020653633
+投球 11.4157710022
+羞羞 11.1926274509
+眩人 13.2075304714
+刘昭注 13.2075304714
+复习 10.1164880181
+涂节 13.2075304714
+私营企业 9.19114745066
+小尾寒羊 12.5143832909
+刻划出 12.8020653633
+东海县 11.8212361103
+心如铁石 12.1089181827
+张皇亲 11.9547675029
+地球科学 10.8561552143
+痛陈 11.0103058941
+桃花源记 11.7034530746
+含汞 11.9547675029
+桂离宫 11.9547675029
+苏小 13.2075304714
+刃磨 13.2075304714
+赫苏斯 11.9547675029
+怔住 9.33632946051
+李大妈 13.2075304714
+梆梆响 12.8020653633
+博达 13.2075304714
+师恩 12.1089181827
+饭钱 10.6818018271
+初征银 13.2075304714
+四番 12.2912397395
+苏尔 11.2616203224
+真假难辨 10.9049453784
+蜕皮激素 11.9547675029
+英格兰 8.27305653829
+航权 11.2616203224
+骑着马 9.40086798165
+学养 11.9547675029
+项目风险 11.7034530746
+居首位 9.46986085313
+莫里索 12.5143832909
+四生 11.9547675029
+亲自出马 9.98865464655
+巴藏卜 12.2912397395
+居汲郡 13.2075304714
+汉魏 8.96620371885
+扒皮 11.9547675029
+平板仪 11.9547675029
+含氟 10.8096351986
+望奎 12.1089181827
+代缴 11.8212361103
+望女 13.900677652
+含氢 11.3357282945
+航期 12.5143832909
+含氧 10.3743171274
+沉鱼落雁 11.8212361103
+含氮 10.1394775363
+飞跃性 12.1089181827
+决心很大 12.2912397395
+喜形于色 10.604840786
+农业区 8.16733637508
+桑奇 12.1089181827
+含水 9.74179456862
+迭代法 12.1089181827
+吕彦直 12.5143832909
+复业 11.8212361103
+饭锅 11.7034530746
+唐兵复 13.2075304714
+酪蛋白 11.9547675029
+复信 11.2616203224
+容积 8.58747167293
+魏在河 12.5143832909
+刘歆 10.3171587135
+雷横 9.15574552361
+袁绍处 11.4157710022
+觊觎 9.48183704418
+瓶口 9.94943393339
+宏论 11.1926274509
+内流河 10.9049453784
+黄底 12.2912397395
+窗帷 13.2075304714
+四瓶 12.2912397395
+宋末元 11.8212361103
+房间数 13.900677652
+刘正 12.1089181827
+刨坑 12.8020653633
+刘武 12.1089181827
+不吭声 8.77671367257
+基础代谢 12.2912397395
+四瓣 11.7034530746
+翻砂 11.7034530746
+使用量 10.0940151622
+含混 10.2371160058
+整周 13.2075304714
+桓冲 13.2075304714
+向探春 12.8020653633
+卖方 9.15574552361
+汉高 12.8020653633
+向福临 11.9547675029
+贵宾室 11.0103058941
+研拟 12.5143832909
+六哥 13.2075304714
+刨地 13.900677652
+吃不起 11.0103058941
+送递 12.8020653633
+福公司 12.1089181827
+却不 13.900677652
+犯错 10.8561552143
+代纳 12.8020653633
+蓝氏 12.2912397395
+付清 10.0940151622
+坚忍不拔 11.9547675029
+常朝礼 11.1926274509
+长叹一声 8.76487921493
+称多县 13.900677652
+比洛 11.8212361103
+专利权人 12.2912397395
+岳托 13.2075304714
+拔萝卜 13.2075304714
+涂药 13.2075304714
+止盈 10.3453295905
+视如珍宝 12.8020653633
+苏州 7.08394177138
+过境旅客 13.900677652
+林丹太太 13.900677652
+山地同胞 13.900677652
+综合征 8.25523075433
+一阵阵 8.24468584116
+片假名 13.2075304714
+矛尾鱼 11.3357282945
+衢州 10.1871055853
+桂花香 12.2912397395
+理短 13.2075304714
+思维过程 11.0674643079
+秦家 10.604840786
+赵至魏 12.8020653633
+摩天楼 13.900677652
+架个 13.900677652
+背部 8.37124856446
+刘毅 10.642581114
+及时雨 10.0940151622
+扑翼机 12.1089181827
+王鉴 11.4157710022
+活雷锋 12.8020653633
+秦宫 12.8020653633
+结婚证书 12.1089181827
+格温 13.900677652
+环境空气 12.8020653633
+秦宓 12.2912397395
+香蕉水 13.900677652
+复位 9.23723855786
+伤过 11.9547675029
+架上 8.94485059437
+毕诗成 12.8020653633
+豚鼠 11.0674643079
+硬膜外 12.2912397395
+宗弘历 11.1280889297
+诸候 12.2912397395
+生存条件 10.3171587135
+秦安 9.44633035572
+朱明门 13.2075304714
+华富里 13.2075304714
+胡州 11.7034530746
+混合制 12.8020653633
+阶级矛盾 9.19114745066
+望塔 12.2912397395
+秦寺 13.2075304714
+纳西族 10.1871055853
+死挨 13.900677652
+一会儿站 11.5027823792
+四球 12.8020653633
+宋孩儿 12.1089181827
+准备后事 11.9547675029
+表哥 9.31571017331
+职业妇女 13.2075304714
+哄抬 10.9562386728
+东普鲁 13.2075304714
+产业部 13.900677652
+柯尼斯堡 10.3453295905
+请功 10.533381822
+齐达内 13.900677652
+哈德 10.2630914922
+医学专家 10.604840786
+复合板 13.2075304714
+草木樨 12.5143832909
+两千余里 12.2912397395
+文情并茂 13.900677652
+逼降 13.2075304714
+理睬 8.86372504956
+不可同日而语 9.87532596124
+复会 12.5143832909
+鼓腹 11.7034530746
+刘汉 11.4157710022
+背面 8.0229418702
+滴答响 13.900677652
+桑德 11.8212361103
+蛾眉 10.8561552143
+张如圭 13.900677652
+苍生涂炭 13.2075304714
+王问 13.2075304714
+第三十四 12.5143832909
+外国佬 13.900677652
+街道 7.15779701618
+刘江 11.0103058941
+圣菲波哥大 12.1089181827
+马桑 12.5143832909
+干燥剂 11.5027823792
+代称 9.94943393339
+整千 13.900677652
+硝酸盐 10.0940151622
+千万家 12.8020653633
+拦截导弹 11.5027823792
+马桥 11.3357282945
+莫贺弗 13.2075304714
+贾琏陪 13.2075304714
+整卷 13.2075304714
+鲁济济 13.2075304714
+马桩 12.8020653633
+马桶 10.2630914922
+一吊 11.3357282945
+代租 13.900677652
+一百一十余名 13.2075304714
+厂房 8.46695564842
+高原区 10.4349417492
+涌泉寺 12.2912397395
+四班 11.9547675029
+背静 13.2075304714
+罗桑顿 13.2075304714
+选题 11.0674643079
+防弊 12.8020653633
+赫什 13.2075304714
+刘氏 10.0294766411
+太平岭 12.5143832909
+真定府 9.55687223012
+魏俊仁 13.900677652
+福利制度 11.2616203224
+阳虚者 12.2912397395
+滚汤 11.5027823792
+容纳 8.26588804881
+演出成功 12.5143832909
+云雨至 13.900677652
+多胚生殖 12.8020653633
+整区 13.900677652
+宣和奉 13.2075304714
+热熔 11.8212361103
+电信 8.01179969364
+向慧珠 13.2075304714
+无机化合物 10.642581114
+数字键盘 13.900677652
+表单 11.7034530746
+风门水口 13.900677652
+刘永 10.9562386728
+联想力 12.1089181827
+财产保险 10.6818018271
+信用贷款 10.3743171274
+马格 11.9547675029
+四环 10.7226238216
+太平岛 11.2616203224
+蓝毛 11.7034530746
+整发 13.2075304714
+平乃颜 13.2075304714
+太平山 11.3357282945
+王长 10.9562386728
+秦岭 7.67414098269
+留不住 10.0088573539
+曹兵远 13.2075304714
+选项 8.22392384971
+临难苟免 12.8020653633
+盘坐在 12.5143832909
+之玉 11.8212361103
+整叶 13.900677652
+复合性 12.1089181827
+注音字母 11.7034530746
+孙健 12.5143832909
+苏威 10.4349417492
+不及格者 13.900677652
+哈士 11.7034530746
+毕拉勒 12.8020653633
+整只 11.0103058941
+刘泽 13.900677652
+表厂 13.2075304714
+符合条件 8.37921673411
+抑菌 10.9562386728
+马梅 13.900677652
+姑子 10.1630080337
+翻翻 9.56994431169
+西宗谷 13.900677652
+殷族 12.8020653633
+渭河流域 11.4157710022
+刘沛 11.1280889297
+无极 10.604840786
+敲开 9.71102290995
+发热量 9.96885201925
+天堂地狱 13.900677652
+装懂 13.2075304714
+禁卫军 10.0294766411
+鼓膜 10.0505300503
+惑乱 11.1280889297
+地铁站 10.8096351986
+赴宴 9.35738286971
+表叔 9.96885201925
+尿意 12.2912397395
+上议院 11.3357282945
+灭顶之灾 10.1164880181
+王锐 13.2075304714
+格鲁巴 12.8020653633
+太阳镜 11.4157710022
+冀二州 13.2075304714
+轮班制 13.2075304714
+胡母 13.900677652
+银装素裹 12.2912397395
+黄金分割 11.0674643079
+顶班 11.5027823792
+锡安山 12.2912397395
+科林斯式 13.2075304714
+马晓霖 11.9547675029
+普列姆 11.7034530746
+战略意义 9.53122979951
+比武 10.1871055853
+怎讲 9.65218240993
+统治阶级 8.06879517469
+赫依 12.1089181827
+池座 13.900677652
+国家奥林匹克体育中心 12.8020653633
+王铁 12.8020653633
+冷冻机 12.5143832909
+胡志强 11.3357282945
+考勤制度 13.2075304714
+雷氏 11.8212361103
+乌洛托品 13.2075304714
+表列 12.5143832909
+苏宁 8.10461990121
+闻问 12.2912397395
+放大系数 12.8020653633
+胡子 7.65845438652
+客人 6.68323422028
+常青藤 12.8020653633
+海城区 13.900677652
+伏魔 11.9547675029
+刘海 9.04086524761
+威斯特 12.5143832909
+欧阳震华 13.2075304714
+刘洋 12.1089181827
+维柳伊 12.8020653633
+雷池 13.2075304714
+郧县 11.1280889297
+整列 12.8020653633
+马植 11.8212361103
+教龄 12.1089181827
+孙军 12.5143832909
+从武英 12.8020653633
+格森 13.2075304714
+嘉丽 13.2075304714
+平等待遇 12.5143832909
+刘洪 10.2897597393
+柳灿 13.900677652
+酒徒 12.2912397395
+沈德符 11.9547675029
+长揖不拜 13.2075304714
+武帝天 12.5143832909
+独立宣言 9.7898037878
+格蕾斯 13.900677652
+酒禁 13.2075304714
+刘派 12.2912397395
+一吼 12.1089181827
+宇文邕确 12.8020653633
+雷汞 12.5143832909
+肯尼亚航空公司 13.900677652
+积分换 12.2912397395
+孙克 13.900677652
+肌球蛋白 11.8212361103
+一拨儿 13.2075304714
+芥末 10.9562386728
+不介意 10.2371160058
+勤杂 13.900677652
+格格 8.67493097826
+通邑大都 12.8020653633
+马槊 12.1089181827
+刘淇 13.900677652
+米尔豪 12.2912397395
+庆元县 13.900677652
+翻红 8.83808261895
+雷河 13.900677652
+吸附 8.56795885871
+马槐 10.9049453784
+受众面 13.900677652
+明正言 13.900677652
+云里金刚 11.598092559
+四版 12.5143832909
+营业所 11.3357282945
+土蜂 12.8020653633
+曹门 9.91169360541
+综合奖 13.2075304714
+吴祥和 12.1089181827
+表功 11.4157710022
+阿卡西 12.8020653633
+高雪氏 13.2075304714
+小商小贩 10.6818018271
+赫伯 13.900677652
+磺胺脒 13.900677652
+袅袅婷婷 10.9562386728
+金耀门 12.8020653633
+格栅 9.6811699468
+一体式 10.9562386728
+夸赞 9.7898037878
+县情 12.8020653633
+马槽 11.9547675029
+钱恩 13.2075304714
+外国人 8.01735526349
+管道化 13.900677652
+肆意妄为 13.2075304714
+土蝗 13.2075304714
+丹津 11.2616203224
+连选连任 10.3743171274
+早育 12.8020653633
+开上来 11.8212361103
+胡家 9.91169360541
+三和土 13.900677652
+尿急 10.765183436
+孙儒 11.4157710022
+机关炮 9.5062284973
+长坂坡 11.0674643079
+胡宁 12.5143832909
+张清领 12.2912397395
+四爷 9.85762638414
+蕨菜 10.4666904475
+格桑 12.8020653633
+胡安 11.0674643079
+胡守 11.9547675029
+代码 7.17444424962
+掊斗折衡 13.900677652
+秦川 10.5684731418
+粒子束 10.2117981979
+贾巴尔 11.9547675029
+雷法 12.1089181827
+综合处 11.4157710022
+孙儿 10.2371160058
+李林 11.1280889297
+一千八百余 13.2075304714
+再立新功 13.900677652
+孙绳祖 11.7034530746
+苏子 11.1280889297
+东南风 9.98865464655
+矫诏召 13.2075304714
+淡饭 12.5143832909
+大队长 9.63799777493
+孙勇 13.900677652
+红艳艳 10.4666904475
+王音 13.2075304714
+刘湛 13.2075304714
+刘湘 11.3357282945
+单脉冲 12.1089181827
+帕腊奈 13.900677652
+朱槿 13.2075304714
+触景 12.8020653633
+秦明战 13.2075304714
+进化速率 11.9547675029
+一流人才 12.8020653633
+眼热 11.0674643079
+整具 12.5143832909
+异黄酮 12.5143832909
+和雨子 11.9547675029
+秦帝 13.2075304714
+刨削 12.5143832909
+弥天大罪 11.7034530746
+索尔坦 13.900677652
+那婆子 9.44633035572
+胡塔 13.900677652
+解放牌 11.2616203224
+天庆元 12.5143832909
+炼铜厂 12.2912397395
+会密 13.900677652
+刘渊 10.3743171274
+比格 12.5143832909
+桑巴 11.8212361103
+老字号 10.1630080337
+代管 10.1394775363
+池底 11.598092559
+花决 13.900677652
+早茶 11.598092559
+原丝体 12.2912397395
+孙力 12.8020653633
+螺丝钉 11.0674643079
+宿元景 11.7034530746
+新民主主 13.900677652
+腰上 10.642581114
+鲜菊花 13.900677652
+拉出去 10.4041700905
+捏造事实 10.4994802703
+太平庄 13.2075304714
+捞起来 12.1089181827
+周志道 13.900677652
+辽河平原 10.2117981979
+华影艺 12.8020653633
+王夫人 7.82303540863
+物流配送 10.2117981979
+巴伊亚州 13.2075304714
+总额 6.38642299916
+地形区 11.3357282945
+单调枯燥 12.8020653633
+曾南侵 13.2075304714
+宋春丽 13.900677652
+太平店 12.5143832909
+刨刀 12.5143832909
+王昭君 10.4349417492
+表兄 10.4994802703
+荀蔼守 13.2075304714
+卷进 10.2897597393
+窝藏祸心 13.900677652
+一顾倾城 13.900677652
+驾船 10.2630914922
+表决 8.68574189437
+过冷蒸气 13.900677652
+苏堤 10.8561552143
+浙江省人民政府 13.900677652
+生育能力 10.533381822
+一掌 9.49395840471
+代签 12.2912397395
+杨光辉 11.9547675029
+那润叶 13.2075304714
+易顺鼎 12.8020653633
+刘志英 11.1280889297
+保安厅 12.5143832909
+秦庭 12.8020653633
+大过年 12.1089181827
+斯特丽 12.8020653633
+整出 11.1280889297
+花冠 9.21854642485
+溜溜平 13.900677652
+革命英雄 11.9547675029
+耗血 12.2912397395
+东正教 8.90346537821
+任得敬 11.3357282945
+陪你玩 12.5143832909
+一批 6.32714638923
+王靖 11.0674643079
+表册 12.1089181827
+唇形科 11.1280889297
+泊来 12.2912397395
+王静 10.4041700905
+汽车工人 13.2075304714
+王非 13.2075304714
+表出 12.8020653633
+整军 10.4994802703
+土著 8.39534611604
+炔雌醚 13.900677652
+秦建 11.7034530746
+隋大业 10.1394775363
+贵宾席 12.2912397395
+福见义 13.2075304714
+任新民 12.8020653633
+孙刚 12.8020653633
+炔雌醇 13.900677652
+无忠君 13.2075304714
+王霸 10.8096351986
+泰奥蒂 11.9547675029
+大啬夫 13.2075304714
+王震 11.2616203224
+整个 5.09650263322
+美孚石油公司 11.7034530746
+理工学院 9.27570483869
+耐水性 12.1089181827
+土葬 9.49395840471
+茴香油 13.900677652
+混拼 13.900677652
+碧霞 11.3357282945
+赤裸 9.75754292558
+州郡 8.64318227995
+杉叶藻 12.2912397395
+呆人 13.900677652
+阿富诺 13.900677652
+代笔 10.9562386728
+张敬尧 12.2912397395
+塞尔夫 13.900677652
+哈孙 11.3357282945
+吴婉容 9.40086798165
+康西瓦 12.1089181827
+声道 9.29550746599
+孙参 13.900677652
+多位 8.01735526349
+王雷 11.9547675029
+缫丝厂 11.0674643079
+两把刷子 12.8020653633
+孙叔 12.5143832909
+吴婉客 12.5143832909
+予人 12.2912397395
+世界排名 10.8561552143
+王雁 13.2075304714
+绿衣人 13.2075304714
+凝结 8.62256299275
+高大乔木 11.2616203224
+直板 13.900677652
+虞山派 12.8020653633
+电脑商 13.2075304714
+细腻入微 12.8020653633
+但英军 12.8020653633
+任全印 12.8020653633
+良好经营 12.1089181827
+吴春晗 13.2075304714
+紧逼 10.2117981979
+十一种 13.2075304714
+袈裟 8.96620371885
+胡大 10.0088573539
+八仙桌 9.24671730182
+胡天 12.1089181827
+胡夫 11.4157710022
+怎解 13.900677652
+太阳雨 12.8020653633
+粉饼 11.9547675029
+送行 8.66423568915
+待机而动 11.9547675029
+重出 11.8212361103
+太上皇 9.7898037878
+大快朵颐 11.1926274509
+相补 12.8020653633
+看不清楚 8.9519177616
+巨野县 12.8020653633
+连接功能 13.2075304714
+石寨山 11.598092559
+告示牌 13.2075304714
+马欢 12.8020653633
+鼓舞 8.03138073884
+一时半会 11.3357282945
+四点 9.20019728618
+腰伤 12.8020653633
+韦嗣立 12.5143832909
+予以 6.68470264932
+搞不懂 11.5027823792
+孙华 12.2912397395
+望尘 12.2912397395
+腰俞 13.900677652
+桑尼 11.8212361103
+斯特伐 10.7226238216
+一叶障目 12.5143832909
+无机 8.56795885871
+刘濞 11.598092559
+王陵 9.91169360541
+并州 9.30555780184
+哈密 8.92394390956
+马毛 13.2075304714
+遗世独立 12.5143832909
+百桌 13.900677652
+游仙乡 13.2075304714
+证券委 12.8020653633
+搞过来 13.900677652
+勃朗 11.598092559
+卓正大 12.1089181827
+男女之间 10.1871055853
+涌上 9.01787572939
+商业系统 13.900677652
+刘总宪 12.5143832909
+和廷尉 13.2075304714
+分子筛 10.9049453784
+干面 12.2912397395
+造型机 13.900677652
+斯特伦 12.1089181827
+来苏 11.598092559
+淡食 13.2075304714
+认真读书 12.2912397395
+乌蒙山 10.604840786
+饭量 10.3453295905
+怪谲 13.900677652
+嗷嗷 10.0720362555
+质量上乘 12.5143832909
+荣昌县 13.2075304714
+破坏分子 13.2075304714
+赵皇帝 11.9547675029
+陈潜夫 12.8020653633
+悠游 11.5027823792
+黎湛铁路 11.4157710022
+哈德良 11.9547675029
+络穴 12.1089181827
+野外作业 11.7034530746
+孙匡 13.2075304714
+百姓网 13.900677652
+胶袋 12.8020653633
+摆地摊 11.2616203224
+马殷 11.1280889297
+怪谈 13.2075304714
+塞恩城 13.2075304714
+营业性 11.598092559
+文东武 12.2912397395
+二极体 13.900677652
+海城市 11.598092559
+寡不敌众 10.2630914922
+名胜古迹 7.0883325578
+扩散阻力 12.8020653633
+早走 13.2075304714
+吴飞鹏 12.5143832909
+鼓起 9.63799777493
+稀稀 10.9049453784
+早起 8.64318227995
+合群性 13.2075304714
+航运业 9.74179456862
+淘宝 8.45394028031
+刘恒 11.4157710022
+格斯 11.7034530746
+万辆次 13.900677652
+摔跟头 12.1089181827
+刘恕 12.1089181827
+格斗 9.10488710638
+说时迟 10.4041700905
+垄断 6.93748766611
+七千多万口 13.2075304714
+表弟 10.1630080337
+税则 10.1394775363
+望去 8.1641053545
+小山湾 11.598092559
+定义出 12.8020653633
+丁烷脱氢 13.900677652
+金和银 10.5684731418
+孙峻 11.598092559
+淡青 11.9547675029
+清平调 13.2075304714
+望厦 10.533381822
+恶向胆边生 11.7034530746
+棕榈科 10.8561552143
+一千二百多座 13.2075304714
+整形 8.84443184663
+虬须 13.2075304714
+技能型 13.900677652
+倚天拔地 13.900677652
+苏园 11.0103058941
+搞不清 9.89334446674
+致病菌 9.69598503258
+王江泾 12.1089181827
+虱目鱼 13.900677652
+孽根 13.900677652
+表彰 8.58255765813
+建制镇 11.7034530746
+尿液 9.08039608637
+干预 7.32979468964
+整式 11.4157710022
+哈吉 11.0674643079
+无望 9.04864738806
+证书编号 12.5143832909
+最高人民法院 8.9519177616
+热阴极 13.2075304714
+国际小行星中心 13.2075304714
+倚草附木 13.2075304714
+望台 11.7034530746
+译著 9.5186510173
+塞尔维亚共和国 12.5143832909
+个人用品 12.8020653633
+拓跋 9.04086524761
+刘总 12.8020653633
+填海造地 12.1089181827
+柳絮 10.6818018271
+伏阙 11.0674643079
+乌拉特前旗 11.3357282945
+桑叉 13.2075304714
+售解禁 9.69598503258
+孙岳 12.5143832909
+整张 10.8561552143
+王班直 12.2912397395
+止疼片 11.8212361103
+航海 7.68807155622
+醒世姻缘 13.900677652
+宗泽入 13.2075304714
+房屋里 11.7034530746
+总院 11.7034530746
+哈哈 7.88208443748
+山西 6.31946782578
+胖得 11.598092559
+哪吒 9.7898037878
+立鹤方 12.2912397395
+张守业 10.5684731418
+超薄型 13.900677652
+两德 11.9547675029
+小康人家 12.1089181827
+智擒鳌 12.8020653633
+粮票 10.3171587135
+英语翻译 12.2912397395
+罗莎 12.5143832909
+山杨林 12.5143832909
+表征 8.97342396682
+登山越岭 13.900677652
+涂装 10.9049453784
+代用 10.604840786
+望南 10.7226238216
+鼓足 10.7226238216
+整得 10.642581114
+柴进东 13.2075304714
+四缘 11.8212361103
+拈阄 10.9049453784
+没声没息 13.900677652
+马撒 12.1089181827
+玛雅 9.74179456862
+吻别 13.900677652
+党馨 13.2075304714
+吉州窑 12.2912397395
+瞟见 12.2912397395
+矿业法 12.8020653633
+好当 11.4157710022
+三年生 13.2075304714
+乐东黎族自治县 12.8020653633
+一千二百多年 13.2075304714
+总队 9.00283785202
+邓广铭 10.642581114
+斯康蒂 13.2075304714
+恨宝玉 12.8020653633
+先跳 11.7034530746
+海关法 11.9547675029
+干燥度 10.1394775363
+马斯普 12.8020653633
+索尔塔 13.2075304714
+交巡警 11.7034530746
+十余万年 12.8020653633
+主副食品 11.7034530746
+李大利 13.2075304714
+四绝 10.9562386728
+简阳市 13.900677652
+单身女人 11.1280889297
+无标题 12.8020653633
+特别法庭 10.7226238216
+克隆选择 12.5143832909
+整幅 11.8212361103
+表带 12.8020653633
+尿泡 10.9562386728
+道拉吉里峰 12.8020653633
+严介和 10.533381822
+行内人士 11.9547675029
+图图 11.8212361103
+榨菜 10.642581114
+四维 8.13548654919
+哈啰 13.900677652
+王风 12.8020653633
+非法利润 13.900677652
+吾师 10.3743171274
+黑鼠 13.900677652
+前不见古人 13.900677652
+角色规范 12.8020653633
+整幢 11.9547675029
+王飞 11.598092559
+一百一十余处 13.2075304714
+肉袒面缚 13.900677652
+拆迁人 10.0088573539
+悠悠 8.82550383674
+宗完颜 11.3357282945
+秦兵 11.1280889297
+南北战争 9.72629038208
+适合 6.66650047223
+如泣如诉 10.8096351986
+雷恩 11.7034530746
+巴坚赞 13.2075304714
+精湛 8.63281949291
+肿瘤发生 11.9547675029
+整师 12.1089181827
+赵子林 12.8020653633
+保安局 11.8212361103
+干馏 10.6818018271
+秦公 11.7034530746
+保险条例 13.900677652
+恃宠而骄 13.900677652
+王颂 12.1089181827
+举目无亲 11.0103058941
+投缘 12.1089181827
+四纵 13.2075304714
+康沃利斯 12.8020653633
+调理阴阳 13.900677652
+太阳风 10.2630914922
+县民 12.5143832909
+土语 10.9562386728
+四级 9.04864738806
+王颖 12.2912397395
+汉郡 12.2912397395
+马政 9.11318590919
+翻版 10.0720362555
+太平军 9.25628675283
+唐大历 11.2616203224
+刘懋 13.900677652
+涂覆 11.5027823792
+羁旅 11.8212361103
+环球旅行 13.2075304714
+黑与白 12.5143832909
+放射免疫 11.3357282945
+免税商店 12.1089181827
+立体主义 10.7226238216
+马旗 11.598092559
+方腊正 12.8020653633
+东南非 12.1089181827
+胡培 12.8020653633
+攀高枝 13.900677652
+胡基 11.7034530746
+王顾 12.5143832909
+性情急躁 12.2912397395
+索因卡 12.2912397395
+招架不住 10.4666904475
+淡雅 9.69598503258
+八十五篇 12.8020653633
+东南面 11.0674643079
+会子 10.1871055853
+秦军 9.35738286971
+一体化 7.45973111134
+宫来见 13.2075304714
+几十千克 12.5143832909
+太尉蛮 13.2075304714
+商务酒店 12.2912397395
+热河省 11.1926274509
+干饭 10.604840786
+古人类 9.74179456862
+不然的话 10.0940151622
+坠落在 12.2912397395
+选错 10.6818018271
+魁北克省 11.0674643079
+县治 9.32596667347
+汉天子 11.9547675029
+自由放任 10.765183436
+小惠全 13.2075304714
+含有 6.30378321383
+尿水 12.1089181827
+审核权 12.5143832909
+拐过去 13.900677652
+不败之地 12.2912397395
+秦凤 11.598092559
+不管部长 11.7034530746
+制片人 10.2117981979
+无核化 10.8096351986
+徐凯一 13.2075304714
+马料 11.7034530746
+中国铁路工程总公司 12.5143832909
+斯特罗姆 11.7034530746
+节肢 12.5143832909
+暖煦煦 12.8020653633
+一朵朵 10.604840786
+代理 7.17444424962
+古加拉 13.2075304714
+普里马科夫 13.900677652
+闽江流域 11.9547675029
+无核区 11.2616203224
+性冲动 11.8212361103
+塌倒 12.1089181827
+嗜睡 9.93038573842
+卫生指标 13.2075304714
+朱清 10.533381822
+立三 12.2912397395
+侵入体 10.3743171274
+马方 13.900677652
+弗隆 13.900677652
+拓边 13.900677652
+超越性 11.4157710022
+翻然 12.8020653633
+秦制 10.8561552143
+子拳 11.9547675029
+柳编 11.2616203224
+高登宝 12.5143832909
+杭申 12.1089181827
+马晓 11.9547675029
+卟啉 11.4157710022
+作怒 12.1089181827
+散乱 9.0884932966
+肺静脉 11.8212361103
+磨拳擦掌 11.8212361103
+选集 8.77077893705
+大声喊叫 10.2630914922
+格林 9.61021821083
+赠言 12.2912397395
+砸碎 10.0940151622
+祝圣寺 12.8020653633
+刘扬 11.8212361103
+一万遍 12.8020653633
+秦刚 11.4157710022
+冯大人 11.7034530746
+嵯峨 10.533381822
+敲出 11.3357282945
+敲击 9.46986085313
+往上爬 9.96885201925
+心照不宣 9.96885201925
+孙建 11.4157710022
+刘承 11.3357282945
+民营公司 11.7034530746
+积分法 11.5027823792
+滑膛枪手 12.8020653633
+魏营 11.4157710022
+孙乾保 13.900677652
+推介会 10.0294766411
+刘戈 13.2075304714
+马昂 13.900677652
+哈尔滨铁路局 13.900677652
+十厘米 13.2075304714
+马明 13.2075304714
+相触 12.5143832909
+直喷式 12.5143832909
+书画卯酉 13.900677652
+海平面 8.90346537821
+分工负责制 12.5143832909
+胡吴 12.2912397395
+占夺军 12.8020653633
+立业 10.765183436
+张汝京 11.1926274509
+刘成 10.6818018271
+呋喃丹 12.5143832909
+秦剑 11.2616203224
+五角枫 13.900677652
+络石 13.2075304714
+视觉神经 12.2912397395
+满满当当 10.4994802703
+阳公样 13.2075304714
+胡同 7.97375162601
+弗雷 11.0674643079
+排斥性 13.2075304714
+宋神宗 9.5062284973
+能量 6.51420680315
+力役 10.0720362555
+瞥见 9.16447920358
+蓝旗 10.6818018271
+山南行 13.2075304714
+未成年人 9.43476953332
+嘲弄地 11.0103058941
+经验性 11.3357282945
+胡哨 11.9547675029
+安安静静 10.0720362555
+管道局 13.2075304714
+司乃祖 13.2075304714
+要港 12.2912397395
+连滚带爬 10.604840786
+种鳞均 13.2075304714
+英语水平 12.8020653633
+砸破 10.6818018271
+加油添醋 11.598092559
+特米尔 13.2075304714
+姆指 13.900677652
+王魁 12.5143832909
+苏吉 12.1089181827
+刘佐臣 13.900677652
+摊着 11.0103058941
+拉齐奥 12.5143832909
+皇太后 7.87965430263
+难驯服 13.900677652
+散仙 12.8020653633
+扎进 9.38981814546
+久经风霜 13.2075304714
+猫腻 9.87532596124
+二泉映月 11.7034530746
+孙干 13.2075304714
+玉昆部 13.2075304714
+建德市 12.8020653633
+随波逐浪 12.5143832909
+邵东 13.2075304714
+冯启聪 13.2075304714
+反窃听 13.900677652
+蓝斑 12.8020653633
+主星序 11.598092559
+没听说过 9.15574552361
+卜雷加 13.900677652
+据险固守 13.900677652
+四十余只 13.900677652
+生米煮成 12.2912397395
+周吴郑 12.5143832909
+荧光素酶 12.8020653633
+部手机 11.1280889297
+子午卯酉 12.2912397395
+领回去 11.2616203224
+加官 10.3453295905
+表工 11.9547675029
+杀鸡吓猴 12.2912397395
+巧语花言 12.2912397395
+邵为 11.9547675029
+虎跳峡 10.604840786
+未经许可 11.2616203224
+烤鱼 11.5027823792
+褥子 10.1394775363
+刨床 11.3357282945
+李素芬 13.900677652
+浙江大学 9.43476953332
+一百二十余 12.5143832909
+曹仲达 13.2075304714
+泛美主义 12.8020653633
+滴溜儿 13.2075304714
+贼眉鼠眼 11.8212361103
+别替 12.2912397395
+表尺 10.4349417492
+踏破铁鞋 11.1926274509
+比数 12.2912397395
+外乡人 10.0088573539
+从兀良 13.2075304714
+杨在冰 13.2075304714
+浪子回头金不换 13.2075304714
+红缨长 13.2075304714
+自然观 10.2630914922
+东歪西倒 13.2075304714
+技术权威 12.8020653633
+整层 11.7034530746
+羁束 13.900677652
+七局 11.7034530746
+植物性神经 11.1280889297
+马来 8.68574189437
+胡商 11.7034530746
+楚归晋 13.2075304714
+胡佳 13.900677652
+赏心悦目 10.3743171274
+景补子 13.2075304714
+散佚 9.56994431169
+怪胎 10.7226238216
+证券商 11.1926274509
+管道工 13.2075304714
+散体 10.8096351986
+流通费用 10.1394775363
+说不完 9.98865464655
+范承谟 13.900677652
+秦印 13.2075304714
+四粒 13.900677652
+塞巴斯蒂安 13.900677652
+闺怨 11.5027823792
+丹江 10.4349417492
+方仙道 12.8020653633
+出发点 8.63798746307
+各负其责 11.4157710022
+马服 13.900677652
+瓦萨拉 13.900677652
+弦乐队 13.2075304714
+李思摩 13.2075304714
+刘挚 12.8020653633
+宋司马光 13.2075304714
+行房 11.2616203224
+宝顶 10.3743171274
+荣宝斋 11.0103058941
+戚夫人 12.5143832909
+孙徐 13.900677652
+钮永建 13.900677652
+价电子 10.8096351986
+整尺 13.900677652
+贵宾厅 12.8020653633
+名垂竹帛 12.5143832909
+卷收 12.2912397395
+程序处理 11.7034530746
+马术 10.642581114
+王骏 13.2075304714
+胡斯党 12.8020653633
+散伙 10.4349417492
+几百万镑 12.1089181827
+新华通讯社 10.6818018271
+秦升 12.5143832909
+表层 8.26588804881
+对口相声 12.2912397395
+综合型 10.6818018271
+双厚坪 12.2912397395
+孙德 12.2912397395
+雷托 11.9547675029
+尿湿 11.8212361103
+贵宾卡 12.8020653633
+熊渠 12.8020653633
+消防器材 12.2912397395
+睢宁 11.2616203224
+麦二叉蚜 13.900677652
+热电效应 12.1089181827
+怒责 13.2075304714
+刘揆 13.2075304714
+悠扬 9.26594866375
+生意人 9.55687223012
+住院费用 11.9547675029
+排起 10.4041700905
+伏闻 13.900677652
+马某 9.6811699468
+言简意深 12.8020653633
+排走 12.8020653633
+雷先生 12.1089181827
+王驾 11.8212361103
+四米 11.8212361103
+翻炒 11.1926274509
+千万名 12.8020653633
+我爱你 9.75754292558
+背风 9.37888907493
+一百二十万 12.8020653633
+键控 12.8020653633
+李可灼 13.900677652
+世事难料 12.8020653633
+芸香 9.93038573842
+能退 13.2075304714
+面对面 8.63281949291
+譩譆 13.900677652
+庄河县 12.8020653633
+作业本 11.5027823792
+比方 10.0505300503
+祝融 10.4994802703
+内积 11.598092559
+热烈 7.43453292774
+马林 10.765183436
+五角星 11.5027823792
+率意 13.2075304714
+迷失方向 10.9049453784
+航渡 9.4233408375
+牧首 11.5027823792
+游艺室 13.2075304714
+探听出 12.2912397395
+马枪 11.598092559
+活见鬼 11.0674643079
+雷拉 13.2075304714
+马架 13.2075304714
+邵伯 11.598092559
+孙强 13.900677652
+多情种子 12.5143832909
+服装服饰 11.4157710022
+那方和尚 12.8020653633
+卫戍部队 11.598092559
+百蕊草 13.900677652
+区宇 12.8020653633
+终末期 11.8212361103
+牲口棚 11.0674643079
+陀螺仪 10.3171587135
+整字 13.900677652
+悄悄 7.29132840881
+戴春荣 13.900677652
+常想 11.3357282945
+线光源 13.900677652
+四篇 11.0674643079
+反省起来 13.900677652
+名词解释 10.9562386728
+罗摩功 11.5027823792
+异族通婚 12.2912397395
+假彩票 13.900677652
+散射截面 11.7034530746
+川之兵 12.8020653633
+辣白菜 13.2075304714
+万分钟 13.2075304714
+比托 12.5143832909
+五子登科 13.900677652
+密码学 13.2075304714
+十八相送 12.8020653633
+住用 12.8020653633
+股份有限 13.2075304714
+马恩 12.1089181827
+红园 13.2075304714
+大金朝 11.7034530746
+比才 11.4157710022
+肥水不流外人田 12.8020653633
+普通中学 10.6818018271
+贝勒人 12.5143832909
+翻看 9.04864738806
+水东岸 12.2912397395
+专科学院 11.9547675029
+一百七十四 12.5143832909
+佳士得 12.8020653633
+千万只 12.1089181827
+桑基 11.3357282945
+胖子 5.60089448003
+雷数 12.1089181827
+孙仙姑 13.900677652
+学生名单 11.3357282945
+望城 10.4349417492
+四箱 12.8020653633
+德威克 13.900677652
+乘马 9.56994431169
+吾子 11.9547675029
+福尔土 13.2075304714
+伤者 9.17328983326
+湿生植物 11.8212361103
+电视业 12.8020653633
+工业协会 10.533381822
+贝勒代 13.2075304714
+翻着 9.98865464655
+接防 11.1926274509
+孙传芳 9.80633308975
+每集 11.7034530746
+兼听则明 12.2912397395
+共和县 11.598092559
+舟山群岛 10.0505300503
+江河水 11.4157710022
+爱慕 9.6811699468
+韩揖喊 13.2075304714
+四筒 13.2075304714
+比拼 10.0720362555
+诸陵 12.5143832909
+苏利 12.5143832909
+雷斯 11.0103058941
+贡唐仓 13.900677652
+晋通 13.900677652
+新旧社会 13.900677652
+千万匹 13.2075304714
+荀蔼入 13.2075304714
+李北海 13.2075304714
+求同存异 11.0103058941
+武乡侯 11.3357282945
+相亲会 11.9547675029
+马里昂 12.8020653633
+四等 10.0294766411
+反渗透 12.1089181827
+海剌儿 13.2075304714
+比拟 9.20932976975
+劳动合同制 12.5143832909
+右心室 10.9562386728
+教院 13.900677652
+伤胃 11.4157710022
+中明器 12.8020653633
+高平省 12.8020653633
+全速前进 12.1089181827
+灵清 13.2075304714
+打游击 10.2117981979
+多种具 13.2075304714
+弄死 9.71102290995
+嗡嗡嘤嘤 11.9547675029
+四笔 12.5143832909
+苏剧 13.900677652
+价差 8.79473217808
+柳科 13.2075304714
+俞兴茂 13.2075304714
+大雅大俗 13.900677652
+伤肺 11.4157710022
+能面 13.900677652
+选送 10.6818018271
+东平湖 10.8096351986
+油脂厂 13.2075304714
+伯尔萨 13.900677652
+力心 12.8020653633
+哌替啶 12.8020653633
+铁砧 11.9547675029
+史臣论 12.1089181827
+整容 9.37888907493
+天庆宝 13.2075304714
+馆外 13.2075304714
+生瑞霭 13.2075304714
+选定 8.18694484647
+地图学史 13.2075304714
+抢救运动 11.9547675029
+因公负伤 13.2075304714
+对得住 11.8212361103
+南方人才 12.8020653633
+单音词 12.8020653633
+神话故事 9.96885201925
+体察到 12.2912397395
+胡卢 12.1089181827
+第十三代 12.2912397395
+稳步增长 8.9102450652
+净车价 13.900677652
+热汤面 13.900677652
+早衰 10.5684731418
+胡卫 13.900677652
+金华县 12.8020653633
+哈克 11.1926274509
+不省人事 9.82314020807
+真定城 12.1089181827
+衢县 11.9547675029
+代烷 10.4041700905
+秦校长 10.8096351986
+存为 13.900677652
+艾瓦佐夫 13.2075304714
+中纬度 9.85762638414
+胡庄村 13.900677652
+时时处处 11.1926274509
+哈兰 12.5143832909
+禁闭室 11.3357282945
+三峡工程 10.6818018271
+野生动物 7.97909923233
+奋发进取 12.5143832909
+异服 13.2075304714
+敢告 12.2912397395
+董建华 12.8020653633
+宋国公 12.5143832909
+四一二 10.0940151622
+刘整 12.2912397395
+尿检 11.5027823792
+憎恨 9.16447920358
+日趋完善 10.533381822
+学医 9.77354326693
+汪乔年 10.533381822
+寸肠 13.900677652
+弗里 10.4041700905
+黑牡丹 10.3171587135
+翻白 12.1089181827
+子承 13.2075304714
+电光源 10.4349417492
+杨的飞 12.8020653633
+锰土 13.900677652
+免费送 10.7226238216
+苏叶 12.5143832909
+桑园 10.5684731418
+憎恶 9.56994431169
+卜商帖 13.2075304714
+教鞭 11.9547675029
+哈儿 11.5027823792
+拉达克 10.8096351986
+曹兵败 13.2075304714
+环绕速度 13.900677652
+齐学启 13.2075304714
+勇者胜 11.8212361103
+于二龙 8.08059472162
+郎家庄 13.2075304714
+刘放 12.2912397395
+胡北 13.900677652
+胡化 12.8020653633
+低年级 12.1089181827
+增效益 13.900677652
+骨干人物 12.5143832909
+胡口 12.5143832909
+敖包 11.2616203224
+谢国祯 13.2075304714
+香港旅游 12.8020653633
+尿桶 11.7034530746
+爱达荷州 11.9547675029
+玉帝准 12.8020653633
+夹送 13.900677652
+胡可 11.5027823792
+东海岸 9.25628675283
+四两拨千斤 11.0103058941
+选配 10.3453295905
+露出 6.50372904935
+帕图斯 12.2912397395
+翻皮 13.900677652
+袁绍闻 13.2075304714
+摄像机 9.53122979951
+有求 11.5027823792
+代考 12.8020653633
+刘旭 12.5143832909
+兀鹫 11.598092559
+七百里 11.0674643079
+国务秘书 11.7034530746
+东海岛 12.2912397395
+兀鹰 11.8212361103
+金生水 11.9547675029
+哀求地 12.2912397395
+苏北 8.59240995457
+孙女 9.06439574502
+观赏价值 10.4994802703
+敏感话题 11.3357282945
+俩眼 11.598092559
+玩牌 12.1089181827
+哈军 12.8020653633
+孙复 12.2912397395
+光可鉴人 11.9547675029
+被动语态 12.1089181827
+尿样 13.2075304714
+意志薄弱 13.2075304714
+替代法 13.900677652
+刘文 9.63799777493
+立陶夫 12.2912397395
+苏卿 13.2075304714
+虎虎生风 12.5143832909
+利钝 13.2075304714
+拍卖行 10.533381822
+航校 11.8212361103
+吴哥通 13.2075304714
+赛球 13.900677652
+那西亚斯 13.900677652
+翻盖 11.2616203224
+红毛儿 13.900677652
+异体字 11.1280889297
+四一九 13.2075304714
+异本 13.2075304714
+开关门 12.8020653633
+颗粒细胞 11.9547675029
+能降 11.9547675029
+刘新 12.8020653633
+航标 10.2117981979
+加密技术 13.900677652
+东南郊 11.1926274509
+小超人 11.7034530746
+四科 11.9547675029
+硬质小麦 12.5143832909
+刘晏 10.8561552143
+含情 11.4157710022
+怎肯 10.0088573539
+马扎 9.53122979951
+定义域 10.533381822
+腰酸腿痛 12.1089181827
+胜任者 13.900677652
+起动器 12.5143832909
+科技大楼 13.2075304714
+表头 13.2075304714
+教个 12.2912397395
+宜春市 11.598092559
+碎尸案 12.5143832909
+钢铁长城 12.5143832909
+贯甲提兵 13.900677652
+比恩 13.2075304714
+刘晓 9.61021821083
+总部 7.04949272448
+常规赛 11.7034530746
+四种 8.42421410004
+郭逵 13.2075304714
+东南部 7.00297270885
+整好 10.3743171274
+通台东 13.2075304714
+代珍 12.8020653633
+尿毒 13.900677652
+产业布局 9.77354326693
+马扩 6.85751773599
+刘智 11.8212361103
+航母 8.58255765813
+阳政范 12.8020653633
+地形学 11.9547675029
+胖头 11.9547675029
+符合国际 11.1926274509
+秦嘉 12.2912397395
+机械工业 8.87679713113
+伏道 11.598092559
+整夜 9.80633308975
+刘明 10.3743171274
+梅特林 11.1280889297
+细微差别 13.2075304714
+徐达 10.0940151622
+裸体美女 13.900677652
+柳筐 13.900677652
+薄姬 13.2075304714
+痛骂 9.94943393339
+整复 11.598092559
+怎能 7.9817837977
+劳资纠纷 12.1089181827
+整备 10.4666904475
+上述情况 9.65218240993
+马战 12.8020653633
+疾如风 13.900677652
+代王 10.604840786
+行有行规 12.8020653633
+披肝沥胆 11.7034530746
+文法书 13.900677652
+中魔 13.900677652
+整头 12.8020653633
+计略 13.900677652
+刘春 10.5684731418
+含悲 11.1926274509
+哈利 11.0674643079
+刘显 13.2075304714
+刘昼 10.604840786
+卖国求荣 12.5143832909
+丁基锂 12.5143832909
+孙媳 11.9547675029
+格里戈里耶夫 13.900677652
+北艾尔湖 13.2075304714
+早读 12.5143832909
+表妹 10.2897597393
+居昌黎 12.8020653633
+胡僧 13.2075304714
+早课 12.2912397395
+哈勒 11.7034530746
+米特族 13.900677652
+留连 11.0103058941
+早说 10.4994802703
+马拉 9.62401153296
+刘曜 10.533381822
+哈勃 10.4041700905
+早该 9.94943393339
+惭愧 8.45394028031
+寸草 11.1280889297
+认出来 9.30555780184
+徐兰沅 12.8020653633
+点钞机 13.2075304714
+含恨 12.1089181827
+爆发性 9.82314020807
+别斯谢 13.900677652
+老汤 10.8096351986
+相比之下 8.20023407859
+王齐 13.900677652
+鼓词 11.1926274509
+动刀动枪 11.8212361103
+奴隶制度 9.71102290995
+木素尔 13.2075304714
+高继冲 13.900677652
+孙婷 12.5143832909
+伏邪 13.2075304714
+吻吻 13.900677652
+孙娃 12.8020653633
+秦国 8.80081122415
+工人工资 11.1280889297
+子房 8.39534611604
+常安慰 13.900677652
+含怒 12.5143832909
+表姨 13.900677652
+犯颜 12.5143832909
+味之素 12.1089181827
+孙娟 11.8212361103
+土豆 8.74738605748
+饭食 9.74179456862
+林肯纪念堂 11.8212361103
+航次 11.7034530746
+厂棚 13.900677652
+戴莱洛 11.9547675029
+终身伴侣 12.8020653633
+马护 13.900677652
+危如累卵 11.8212361103
+土豹 13.2075304714
+千万元 9.63799777493
+成建制 11.8212361103
+王鼎 12.8020653633
+八十道 13.900677652
+引进技术 11.2616203224
+多元化 7.84389363875
+土豪 9.77354326693
+扒窃 13.2075304714
+福州军区 12.8020653633
+母髦智 13.2075304714
+吻合 8.6803218269
+胶膜 11.9547675029
+羁押 9.98865464655
+四海飘零 13.900677652
+芙拉 12.5143832909
+价带 11.9547675029
+刘李 13.2075304714
+摧锋陷阵 13.900677652
+荷兰人 8.94485059437
+理算 11.8212361103
+欧洲理事会 12.8020653633
+宗泽因 13.2075304714
+文臣中 11.5027823792
+胡公 11.9547675029
+综合司 11.9547675029
+娴于 11.8212361103
+胡兰 13.900677652
+出路 7.94225295895
+胡兵 12.2912397395
+苦思 10.642581114
+比肩而立 13.900677652
+玛尼 11.9547675029
+优秀作品 9.80633308975
+偶一为之 11.5027823792
+缅甸人 12.2912397395
+文化区 9.98865464655
+刘杨 10.4666904475
+说不得 9.5062284973
+胡先 12.1089181827
+胡克 10.2371160058
+蒂萨 12.1089181827
+王黎 13.900677652
+金员外 12.5143832909
+秦土 12.2912397395
+接待量 11.4157710022
+苏军 8.36728816325
+赃款 9.82314020807
+苏冕 13.2075304714
+总量 6.49457427074
+不难猜测 12.8020653633
+总重 9.54396882529
+孙安 10.2117981979
+四碗 11.8212361103
+马持 12.8020653633
+李济贤 12.8020653633
+南宁市 10.1394775363
+李好义 12.5143832909
+雷马克 11.598092559
+桑哥 11.9547675029
+活生生 9.10488710638
+宅心忠厚 13.900677652
+宽大为怀 11.5027823792
+避难就易 13.900677652
+胡儿 12.8020653633
+先睹为快 12.1089181827
+旧金山市 12.8020653633
+于本司 13.2075304714
+一束花 12.5143832909
+土路 10.642581114
+青砖青 13.2075304714
+驱散 9.24671730182
+亚平宁 10.765183436
+病理解剖 11.8212361103
+大失所望 9.89334446674
+雷斯卡 13.2075304714
+八十亩 13.2075304714
+积分榜 12.1089181827
+孙家 10.1164880181
+汉阙 13.2075304714
+饭馆 8.9519177616
+夹心饼 13.2075304714
+望君 11.3357282945
+六公园 13.2075304714
+阳虚证 11.2616203224
+党风 10.9562386728
+泌乳素瘤 13.900677652
+交叉渡线 13.900677652
+雷暴 10.0088573539
+补给量 10.8561552143
+孙子 7.75864024639
+刘某 9.72629038208
+龙石 12.8020653633
+千万倍 13.2075304714
+金属产品 11.9547675029
+胖墩 13.900677652
+汉阳 9.16447920358
+背鳍 8.53938548627
+塞尔内 13.2075304714
+耶律大石 8.53470163695
+钟磐 12.8020653633
+百货类 11.9547675029
+容留 11.2616203224
+马援 10.9049453784
+马自强 11.598092559
+教长 10.604840786
+土质 8.89673134603
+土货 10.1630080337
+太阳鸟 11.1280889297
+肖山令 12.5143832909
+御史台 9.58318953844
+李大哥 10.6818018271
+容甫 13.2075304714
+苏公 12.1089181827
+阮让 13.900677652
+表壳 12.1089181827
+马掌 12.5143832909
+地理分布 9.29550746599
+含意 9.62401153296
+综合区 12.2912397395
+礼坏乐崩 13.900677652
+教错 13.2075304714
+情报活动 13.2075304714
+澳门基本法 12.8020653633
+英格尔 13.2075304714
+斜墙 12.5143832909
+王鸿 8.58747167293
+刘林 11.9547675029
+苏共 10.4349417492
+虬龙 12.8020653633
+活命之恩 11.8212361103
+全权负责 11.8212361103
+白屈菜 13.2075304714
+苏克 11.9547675029
+床铺 9.32596667347
+灵牌 10.9562386728
+润笔 13.2075304714
+苏兄 13.900677652
+汉陵 12.8020653633
+油麻 12.5143832909
+价廉 10.604840786
+哲学原理 10.5684731418
+粒子流 11.0674643079
+中国投资银行 10.4041700905
+邻里关系 12.8020653633
+白颖苔 13.2075304714
+明叔忙 13.2075304714
+胡军 10.8096351986
+鲁马河 13.900677652
+娴习 13.2075304714
+施普雷 13.2075304714
+县长 8.05713323494
+李晨 11.7034530746
+居于 7.69814213479
+山魈 11.598092559
+三十五名 12.8020653633
+二十一岁 10.2897597393
+夜间部 13.2075304714
+熊出没 12.2912397395
+茨坪 12.1089181827
+尿闭 13.2075304714
+有勇无谋 11.1926274509
+被套 8.73589167805
+龙丙 13.2075304714
+一拉 9.48183704418
+壬子癸丑 12.8020653633
+万民法 12.2912397395
+专门机构 9.59661255877
+心理定势 12.5143832909
+间壁 10.4349417492
+黑色素 10.3743171274
+新鲜肉 12.5143832909
+高级小学 12.2912397395
+软坚散结 11.8212361103
+饮食卫生 11.1280889297
+奥塞罗 13.900677652
+土状 10.604840786
+法外 11.0103058941
+派尔 12.8020653633
+水害 10.8096351986
+种祸 13.900677652
+主次颠倒 13.900677652
+赣江 9.4233408375
+视民如子 13.2075304714
+县镇 11.598092559
+戈亚尼 12.8020653633
+华家岭 11.7034530746
+水客 10.6818018271
+奥贝 11.9547675029
+淡漠 9.66657114738
+路至凤 13.900677652
+说慌者 13.900677652
+土狗 11.8212361103
+比干 11.0103058941
+二八面 13.2075304714
+任继荣 10.2630914922
+旁系血亲 12.1089181827
+保修期 12.2912397395
+干扰素 9.96885201925
+水富 13.900677652
+安山岩 10.0720362555
+一场空 10.642581114
+法奥 11.8212361103
+乡土风味 13.900677652
+磕头礼拜 11.1926274509
+弓着腰 10.6818018271
+铜陵县 13.2075304714
+能比 9.40086798165
+严谕李 13.900677652
+昆德拉 12.2912397395
+早生 10.8096351986
+走势图 10.3453295905
+冷冷的 9.7898037878
+师老兵疲 13.2075304714
+李思齐 11.4157710022
+英宗皇帝 12.1089181827
+重大任务 11.1926274509
+岳塘区 13.2075304714
+访察 12.2912397395
+塞古 12.5143832909
+驱马 11.598092559
+克斯伯爵 13.900677652
+王慧 12.8020653633
+吉洛姆 13.900677652
+四百多篇 12.8020653633
+居上 13.2075304714
+出版日期 12.8020653633
+颜总帅 13.2075304714
+油气田 10.1394775363
+塞北 10.4041700905
+中西医 9.94943393339
+居东 11.7034530746
+几下子 10.8561552143
+狗头军师 11.8212361103
+梁师爷 11.5027823792
+尹盛章 11.9547675029
+居业 13.2075304714
+锯下 12.2912397395
+乐器 7.78038023302
+内部消息 12.2912397395
+承淡安 13.2075304714
+居中 9.03314320152
+西昆体 11.5027823792
+涂炭 11.0103058941
+居丧 11.598092559
+王慈 12.5143832909
+茨城 13.2075304714
+卷轴 10.8096351986
+螺丝扣 13.900677652
+终清之 12.1089181827
+服现役 11.5027823792
+插拔 13.2075304714
+湘乡人 11.7034530746
+代购 11.5027823792
+马鲁 11.7034530746
+选民 9.00283785202
+二十一局 13.2075304714
+水孔 11.598092559
+谢菲尔德 11.0674643079
+房间隔 12.8020653633
+付汇 12.2912397395
+小腿肚子 12.2912397395
+踩扁 12.8020653633
+怦怦 9.08039608637
+戏曲片 11.9547675029
+刘颖 11.1926274509
+马鲛 11.8212361103
+晋文侯 12.5143832909
+唐末至 11.8212361103
+翻译 7.49214886092
+丰寄禄 12.8020653633
+独立师 11.9547675029
+世界纪录 9.37888907493
+蓬尘 13.2075304714
+乌尔基萨 12.5143832909
+发热时 12.1089181827
+交警大队 10.0294766411
+干急 12.5143832909
+干性 10.3171587135
+赵亮 9.08039608637
+四不象 11.5027823792
+对称因素 12.5143832909
+塞卡 13.2075304714
+乐嘉 12.2912397395
+土牢 12.5143832909
+收回 7.18650712207
+孟兰盆 13.2075304714
+不满情绪 9.93038573842
+教母 11.3357282945
+霍耳 11.9547675029
+罪人 8.91707103027
+支胜捷 13.2075304714
+收在 9.18217878068
+爱劳动 12.2912397395
+启发法 13.900677652
+殷勤 8.53938548627
+黄蓉 12.2912397395
+带动力 11.0674643079
+囊尾蚴 11.9547675029
+解药 11.2616203224
+收场 9.22784881751
+强烈欲望 12.5143832909
+后院起火 11.7034530746
+异物 8.98069672615
+结了婚 9.26594866375
+操刀 10.2897597393
+驱鬼 10.4994802703
+朱衡劝 13.2075304714
+回娘家 9.74179456862
+浙江师范大学 13.2075304714
+格鲁 11.5027823792
+言抚谕 12.8020653633
+咯咯笑 10.9049453784
+检察室 13.900677652
+格鲍 13.900677652
+乐城 12.2912397395
+日子 5.92786686785
+柳营 12.5143832909
+法堂 10.7226238216
+容让 12.2912397395
+王悦 12.8020653633
+犯有 10.0940151622
+明正统 10.8561552143
+立元恭 12.2912397395
+蓝鸟 13.900677652
+侍养 12.5143832909
+汉德逊 13.2075304714
+调压井 13.2075304714
+容许 9.37888907493
+五七百 11.2616203224
+卡迪林耶 12.1089181827
+经济模型 10.8096351986
+满庭芳 11.8212361103
+有来有往 12.5143832909
+分蘖期 12.8020653633
+专业术语 11.8212361103
+甘宁百 13.2075304714
+司宪中 13.2075304714
+夏风才 13.2075304714
+宛转悠扬 13.900677652
+冷冷瞅 13.2075304714
+人多嘴杂 11.598092559
+汉森 11.1280889297
+会仙楼 13.900677652
+挖矿 12.2912397395
+女居士 12.8020653633
+肖明子 10.3453295905
+用惯 12.2912397395
+布坎南 11.8212361103
+北高加索 11.4157710022
+夹心板 13.900677652
+碰得 10.2630914922
+吴为家 12.2912397395
+间套 12.1089181827
+纳巴拉 12.8020653633
+王恭 11.1926274509
+间奏 13.2075304714
+吕布来 12.1089181827
+力量强大 11.7034530746
+刻丝 11.8212361103
+操劳 9.62401153296
+王恺 12.2912397395
+酸酸 11.7034530746
+桓叔 13.900677652
+弗洛 12.2912397395
+王恂 12.2912397395
+梨花大鼓 13.2075304714
+层叠 10.3171587135
+罪业 12.1089181827
+塞到 9.19114745066
+乐坛 11.1280889297
+教正 13.900677652
+两用人才 11.8212361103
+化腐朽为神奇 11.7034530746
+塞利 12.1089181827
+暖气费 11.598092559
+台中县 10.7226238216
+王恕 13.900677652
+韦特 12.5143832909
+刘徽约 13.2075304714
+操办 9.74179456862
+米凯尔 13.2075304714
+居住 6.48009874656
+伤亡事故 11.2616203224
+麦莱丹 13.900677652
+代谢 7.37125881371
+刻蜡纸 13.900677652
+维诺格 12.1089181827
+阿尔衮琴 12.8020653633
+眯缝 9.69598503258
+销售收入 7.62215622781
+派差 12.8020653633
+胶纸 13.2075304714
+张守直 10.8096351986
+地大物博 11.1280889297
+发光强度 11.1926274509
+独立式 11.5027823792
+青干班 12.2912397395
+令师 12.5143832909
+选派 9.30555780184
+朝不保夕 10.9049453784
+窦婴驻 12.8020653633
+收埋 13.900677652
+乐土 10.5684731418
+被动 7.35389224122
+浯屿 13.900677652
+王怒 13.900677652
+四合房 13.900677652
+副董事长 8.71889410168
+国于民 11.9547675029
+运动神经 10.9562386728
+兴冲冲 8.90346537821
+汉桥 13.900677652
+王思 11.8212361103
+雁塔 11.4157710022
+天津站 12.8020653633
+塞军 12.5143832909
+计算机领域 12.8020653633
+水妖 12.2912397395
+土炕 9.62401153296
+帅府园 13.900677652
+收听 10.0940151622
+非决定性 12.2912397395
+高力士 11.0674643079
+猫科 11.1926274509
+被子 7.85804481829
+早睡 10.9562386728
+刘丽华 9.59661255877
+雷鬼 13.900677652
+塞内 10.9562386728
+久治县 13.900677652
+北柱兽 13.2075304714
+街景 10.0720362555
+走背运 13.2075304714
+我区 13.900677652
+土炮 11.5027823792
+化纤厂 11.2616203224
+伏汛 11.9547675029
+花道 13.2075304714
+毫米波 10.533381822
+尸位素餐 11.8212361103
+隐恶扬善 12.1089181827
+鼓着 10.4666904475
+稳定上升 11.1280889297
+语音卡 13.900677652
+重则 9.82314020807
+涂片 10.1630080337
+轧轧声 13.900677652
+水委 11.7034530746
+纸浆厂 12.2912397395
+杨靖宇 10.4666904475
+牧性 12.8020653633
+率领 6.32611916777
+扎眼 11.3357282945
+法学 8.26588804881
+操典 11.598092559
+文件传送 13.900677652
+伏氏 10.9562386728
+赛克斯 11.598092559
+张必先 13.900677652
+马鸣 11.598092559
+发热板 13.900677652
+土工布 13.900677652
+和兆鹏 12.5143832909
+法子 8.56795885871
+军事训练 9.4233408375
+魏阵 11.8212361103
+金盆坡 11.8212361103
+专科学校 8.5440913773
+淡淡 8.37124856446
+教案 10.604840786
+特尼尔 12.5143832909
+代转 13.900677652
+乳浊液 12.1089181827
+心潮难平 12.5143832909
+法家 9.61021821083
+夏侯阳算 13.2075304714
+伏波 11.5027823792
+舒翰统 13.2075304714
+乐命 13.2075304714
+刘高 10.2371160058
+休止 10.4994802703
+好几杯 13.2075304714
+宣露 13.2075304714
+干才 11.4157710022
+零备件 13.2075304714
+早知 9.6811699468
+覆巢之下 11.7034530746
+法宝 9.32596667347
+大使夫人 13.900677652
+紫草茸 13.900677652
+岐化 13.900677652
+法官 7.90921310487
+汉璇达 12.2912397395
+法定 7.75220935606
+水头 10.1871055853
+发胶 11.598092559
+十二三万 13.2075304714
+懵然无知 13.2075304714
+总汇 10.642581114
+翻覆 12.2912397395
+伏法 12.5143832909
+中巴车 11.598092559
+通信线路 11.4157710022
+蹄印 11.3357282945
+宝应县 13.900677652
+严景耀 12.8020653633
+刘骏 13.2075304714
+王振 10.1630080337
+高温气候 13.900677652
+大拇指 8.69119149913
+塞克 11.8212361103
+乐吧 13.900677652
+三重 9.26594866375
+冰河时期 12.2912397395
+马麟 9.74179456862
+张维赤 9.59661255877
+干戈 10.2117981979
+节能灯 10.765183436
+驱风 11.598092559
+洗劫一空 11.1280889297
+被宠 12.5143832909
+鄯善国 12.5143832909
+塞兰 13.2075304714
+土灶 11.7034530746
+做得来 12.8020653633
+平地青云 13.900677652
+土灰 12.2912397395
+被害 9.30555780184
+日增 9.53122979951
+奎斯特 11.4157710022
+伏沙 13.2075304714
+独奏家 12.5143832909
+那龙马 12.8020653633
+二十一年 8.65365357982
+汉武 11.7034530746
+本分 9.38981814546
+数十面 13.2075304714
+破土 11.0674643079
+歌舞剧 10.4041700905
+曹溪宗 13.2075304714
+酿酒厂 11.9547675029
+小脚丫 11.598092559
+爽肤水 10.2897597393
+国子学 10.8096351986
+三棱锥 13.900677652
+东乡族 11.2616203224
+马齐 11.9547675029
+吾令 11.1926274509
+拱肩缩背 13.900677652
+超导磁体 11.8212361103
+一听之下 12.8020653633
+止蚀 12.1089181827
+山西省吕梁地区 12.1089181827
+恨少 12.5143832909
+伏流 10.3171587135
+胡子兵 13.900677652
+神山 10.0505300503
+功夫 7.55328844232
+水墨 9.32596667347
+胡滨 13.2075304714
+马齿 11.598092559
+转让款 10.604840786
+农垦部 13.2075304714
+日夫 11.8212361103
+眉目之间 13.2075304714
+保皇派 10.533381822
+管蔡之 13.900677652
+景亦大 13.900677652
+两万三千户 13.2075304714
+摩德纳 12.8020653633
+淡水 7.43920947562
+搬回 10.3453295905
+日头 9.04864738806
+上海市人大常委会 12.5143832909
+开门七件事 13.900677652
+干掉 9.80633308975
+毛茶 11.0103058941
+萨尔茨堡 10.7226238216
+母丝杠 13.900677652
+遥相呼应 10.0294766411
+审批表 13.2075304714
+印第安那州 12.8020653633
+水壶 8.98802276624
+劳加族 13.900677652
+大庆石化 13.2075304714
+秦将王 11.1280889297
+两千次 13.900677652
+日夜 7.74581955796
+手术器械 12.2912397395
+劳动卫生 12.1089181827
+服装辅料 11.9547675029
+一路路 13.900677652
+乐善 11.9547675029
+日夕 10.8096351986
+弯着腰 9.94943393339
+厂长 8.15128466607
+街机 13.900677652
+曾当过 11.0103058941
+震天价响 11.8212361103
+黄贻钧 13.900677652
+桔红色 11.3357282945
+流行性感 13.900677652
+国子寺 13.2075304714
+投井下石 12.8020653633
+撒下来 12.1089181827
+疏肝理气 12.1089181827
+肥头大耳 12.5143832909
+检察处 13.900677652
+名实相符 12.5143832909
+徐汇区 11.0103058941
+棒球 10.6818018271
+受过伤 11.4157710022
+水尽节 12.5143832909
+总体目标 11.2616203224
+姚平仲 9.89334446674
+抱头鼠窜 10.4349417492
+淡泊 10.4041700905
+活性炭 10.1871055853
+中国互联网络信息中心 11.1926274509
+王才 12.5143832909
+史无明 12.2912397395
+砸脚 13.900677652
+奋斗 8.23771717184
+派往 9.36807815882
+拼音字母 12.2912397395
+成都队 13.2075304714
+剧作者 11.598092559
+层出 12.2912397395
+第九届全国人民代表大会常务委员会 13.2075304714
+告官 11.598092559
+水塘 9.66657114738
+水塔 10.8096351986
+谁主张 12.8020653633
+鼠尾草 13.900677652
+每况愈下 10.1394775363
+眼花缭乱 9.31571017331
+扬雄著 13.2075304714
+流动岗 12.8020653633
+切切私语 13.900677652
+许衡凡 13.2075304714
+薄壁 10.4349417492
+十一只 13.900677652
+马龙 9.63799777493
+九期 13.2075304714
+口到 10.9562386728
+史诗性 11.7034530746
+徇私舞弊 11.0103058941
+胶粉 13.900677652
+蓝鲸 11.1280889297
+防热层 13.900677652
+胶粒 11.9547675029
+王成 11.2616203224
+答出来 13.900677652
+碰巧 9.84023464143
+四营 12.1089181827
+胶粘 11.1926274509
+姜伯约 11.8212361103
+王战 10.8561552143
+云南省人民政府 13.2075304714
+尚武 11.0674643079
+四千文 13.2075304714
+萧山县 11.2616203224
+带动型 13.2075304714
+程昌寓 13.2075304714
+操在 10.8561552143
+王旭 11.0674643079
+痛惜 10.2371160058
+收到 6.67957255379
+草履虫 11.8212361103
+蠲免 10.5684731418
+认知结构 11.7034530746
+背板 10.2630914922
+本利 10.9562386728
+宗初祖 12.1089181827
+刻度盘 12.2912397395
+后燕主 13.2075304714
+地产商 9.45802639549
+潼南 11.9547675029
+马晓春 12.5143832909
+围歼 9.72629038208
+两幕 12.5143832909
+王族 9.62401153296
+结成 7.76727960898
+尿量 9.77354326693
+耸了耸 11.2616203224
+屠宰率 11.7034530746
+吕洞宾 10.765183436
+扎煞 12.1089181827
+外人道 13.900677652
+马顿 13.2075304714
+痛惩 13.900677652
+奋战 9.40086798165
+哼个 13.900677652
+佛牙 11.5027823792
+每加仑 11.5027823792
+太阳日 12.1089181827
+容身 10.604840786
+迫切希望 11.5027823792
+痛悔 11.5027823792
+假定性 11.4157710022
+郑亲王 9.28555713513
+表里为奸 13.2075304714
+隆隆声 10.604840786
+一世英名 12.5143832909
+太阳时 11.1280889297
+王新 11.1926274509
+日常 7.09384829158
+退学 9.98865464655
+王方 11.3357282945
+体温表 12.1089181827
+犯戒 13.2075304714
+翻转 9.36807815882
+越级 10.604840786
+王文 9.27570483869
+晚半天 13.2075304714
+画影图形 11.7034530746
+从高 10.8096351986
+乐力 12.8020653633
+柳腰 12.1089181827
+日币 13.900677652
+地理学者 12.5143832909
+深万科 12.5143832909
+王斌 12.2912397395
+焰口 11.7034530746
+太阳旗 11.8212361103
+铀矿床 11.7034530746
+日韩剧 13.900677652
+钢筋水泥 10.765183436
+世世代代 9.75754292558
+搬出 9.08039608637
+四荒 13.2075304714
+误工费 11.4157710022
+人迹罕到 12.8020653633
+王敦 10.1164880181
+功底 9.85762638414
+喀斯特地貌 9.09665660724
+工人下岗 12.2912397395
+滚筒式 11.8212361103
+刘墉 12.2912397395
+久旱逢甘 12.8020653633
+怪罪 9.26594866375
+连人 9.36807815882
+马飞 12.5143832909
+英文系 11.598092559
+片儿警 13.900677652
+间层 13.900677652
+能演 12.1089181827
+高玉凤 11.9547675029
+痛恶 13.2075304714
+太子港 11.4157710022
+引为鉴戒 13.2075304714
+罪轻 12.1089181827
+王敏 10.2630914922
+一万九千 13.2075304714
+县里 8.29487558568
+经验之谈 11.3357282945
+阳宗海 12.1089181827
+元德明 13.2075304714
+痛恨 8.68574189437
+福赛思 13.2075304714
+胶管 11.598092559
+东长安 12.1089181827
+屯粮 10.9562386728
+青岛市政府 12.8020653633
+化成美女 13.900677652
+飞下去 13.2075304714
+佛蒙特 13.2075304714
+热线电话 10.3743171274
+满汉席 13.2075304714
+阿维安 13.900677652
+惊惶不安 13.900677652
+罂粟花 10.8096351986
+加姆 12.5143832909
+降本增效 11.598092559
+王政 9.34680076038
+罗汉堂 11.9547675029
+搬入 11.0103058941
+土登 13.2075304714
+早熟 9.32596667347
+只字未提 11.0674643079
+线道 13.900677652
+铰刀 12.8020653633
+选样 11.1926274509
+行踪飘忽 11.9547675029
+牧暇 13.2075304714
+安特尔 13.900677652
+搬兵 11.598092559
+翻过 8.87679713113
+清源山 11.9547675029
+饱和溶液 11.598092559
+选校 13.2075304714
+何相公 13.2075304714
+禹为前 13.2075304714
+平地机 12.8020653633
+能溶 13.900677652
+赖文光 11.9547675029
+背景 5.83321498497
+水底 8.07763175649
+派头 9.48183704418
+时世 10.8096351986
+金凤花 13.2075304714
+投药 13.2075304714
+算法语言 12.2912397395
+乐句 10.9049453784
+九百九十九步 13.900677652
+日影 10.1164880181
+徐闻县 11.9547675029
+性需求 10.2630914922
+干时 11.598092559
+谢宋江 13.2075304714
+一砖一瓦 11.9547675029
+干旱 7.36109169636
+牧村 12.8020653633
+同步性 12.5143832909
+马饮 12.8020653633
+法尔 11.0103058941
+县道 12.5143832909
+武荣州 13.2075304714
+马岛 10.0088573539
+伤神 11.1926274509
+雨蒙蒙 12.8020653633
+马饰 12.1089181827
+蓝马 13.2075304714
+白日飞升 12.8020653633
+写来写去 13.900677652
+涂画 13.900677652
+普罗塔 13.2075304714
+隆尧县 12.2912397395
+解运京 13.2075304714
+雷姆 13.2075304714
+烘漆 13.900677652
+汉法 10.9049453784
+王播 12.8020653633
+特西斯 12.8020653633
+四节 11.9547675029
+梁上君子 13.2075304714
+弥天大谎 12.8020653633
+及时性 10.2897597393
+低音提琴 11.9547675029
+日式 11.8212361103
+法属 9.6811699468
+三十五六 12.8020653633
+优胜劣汰 10.0294766411
+土石 9.98865464655
+往上走 10.2630914922
+整架 12.8020653633
+抑爆 10.9049453784
+报夹 13.900677652
+关羽皆 13.2075304714
+肯辛顿 12.1089181827
+兖矿 13.2075304714
+中饭时 13.2075304714
+代表 4.95978658419
+鹳鸟 12.5143832909
+开放市场 11.0674643079
+水帘 11.4157710022
+汉民 9.98865464655
+春节晚会 12.2912397395
+四艘 10.7226238216
+王敬轩 13.2075304714
+挟天子以令诸侯 12.1089181827
+逼急 11.0674643079
+水师 9.09665660724
+撞毁 11.598092559
+井田制 10.604840786
+剪票口 13.900677652
+收去 10.9049453784
+鹿儿岛 11.0674643079
+闻江湖 13.900677652
+得益于 7.96843246453
+四色 10.533381822
+解运之 12.8020653633
+刘知几 11.0674643079
+代行 9.72629038208
+功德 9.12999302751
+分辨率 9.20019728618
+尿道 9.31571017331
+汉水 9.05649056552
+日心 10.9562386728
+航道 7.87481167815
+热成像仪 12.1089181827
+海桐皮 13.2075304714
+无声片 12.8020653633
+水带 11.598092559
+整枪 13.2075304714
+日志 10.533381822
+乐华 12.2912397395
+伤科 12.2912397395
+大石碑 11.9547675029
+鼓点 10.642581114
+收口 10.8561552143
+汉江 8.48903160012
+岑溪市 13.900677652
+李秉衡 12.5143832909
+痛感 10.2630914922
+马首 13.2075304714
+昭觉寺 12.8020653633
+数十公里 11.0674643079
+大商所 10.1871055853
+弹词 9.98865464655
+拓跋氏 10.4349417492
+注入式 11.9547675029
+机械行业 10.1164880181
+产品产量 10.0294766411
+智力投资 13.2075304714
+土着 11.598092559
+张涤生 13.2075304714
+使用期 11.4157710022
+竺娲颍 13.900677652
+干政 9.82314020807
+水平 4.85474033629
+绛紫色 13.2075304714
+收发 10.1164880181
+大大缩短 10.3453295905
+收取 7.63347710343
+收受 9.65218240993
+高血压病 10.8561552143
+干支 9.59661255877
+唐宗汉 13.2075304714
+京白梨 12.8020653633
+夏二郡 12.8020653633
+准稳态 13.900677652
+刘鹏 12.8020653633
+何为俊 13.900677652
+煤渣路 13.900677652
+金瓶梅 10.7226238216
+层呈 12.2912397395
+阴阳 7.47257237929
+冀中南 12.8020653633
+易趣 12.8020653633
+南校区 11.1280889297
+怪模怪样 10.765183436
+选择 5.15078669644
+本厂 11.9547675029
+收债 12.8020653633
+刻作 13.2075304714
+教法 9.14708746087
+刘鹗 11.598092559
+四至 10.1630080337
+必然之势 13.2075304714
+代词 10.5684731418
+伏案 10.4994802703
+马马 13.2075304714
+榨糖 12.1089181827
+刘鹤 12.5143832909
+玛格 12.8020653633
+法式 10.4041700905
+保驾护航 10.3171587135
+时尚杂志 11.0674643079
+马驰 11.7034530746
+四自 13.2075304714
+太子河 10.642581114
+九位数 13.900677652
+马驹 9.66657114738
+城东湖 12.1089181827
+水川 11.9547675029
+翻起 10.3453295905
+代议 11.598092559
+单梁长 13.2075304714
+代订 13.900677652
+一挂 10.4349417492
+频传 10.8561552143
+辛店镇 13.900677652
+先达 12.8020653633
+酸葡萄 12.5143832909
+髋臼 13.2075304714
+李过营 13.2075304714
+梁令瓒 12.2912397395
+任相国 11.8212361103
+收假 13.900677652
+日射 12.5143832909
+犯急 13.2075304714
+以弱制强 13.900677652
+振荡器 10.4349417492
+柳荫 11.5027823792
+去逛 10.8561552143
+王林 11.7034530746
+土瓦 13.2075304714
+翻筋斗 10.2630914922
+伯尔纳 12.8020653633
+网络营销 11.3357282945
+福建省宁德地区 11.8212361103
+投考 11.2616203224
+痛打 10.4994802703
+四十三处 13.2075304714
+柯名引 13.900677652
+王来 12.1089181827
+收储 8.45394028031
+自动测试 13.2075304714
+王杨 13.2075304714
+馋涎欲滴 11.2616203224
+仗义 9.63799777493
+贿买 11.598092559
+背时 11.3357282945
+王杲 13.2075304714
+王杰 11.7034530746
+早班 11.2616203224
+陆贾 11.598092559
+四海九州 13.900677652
+挪不开 12.1089181827
+街招 13.900677652
+白铁矿 13.900677652
+凡勃伦 13.2075304714
+王权 9.01032852375
+柳莺 12.5143832909
+泪痕斑斑 13.900677652
+历日 13.900677652
+山穷水尽 10.0294766411
+脚指甲 12.8020653633
+工布江达 12.5143832909
+喷着水 13.900677652
+王李 10.9562386728
+交回去 13.2075304714
+王村 10.8096351986
+投胎 9.96885201925
+图形后效 13.900677652
+法律 5.64355136598
+严重困难 10.604840786
+翻越 9.38981814546
+唤出 10.8561552143
+民主党派 9.21854642485
+雷龙 13.900677652
+独断论 12.5143832909
+装卸工 11.0103058941
+一个系列 11.8212361103
+马骏 9.77354326693
+子武王 13.2075304714
+乔安 12.8020653633
+秦椒 12.8020653633
+王朱 11.0674643079
+碰壁 9.96885201925
+刘麟 13.900677652
+嗜血 10.4994802703
+王朴 10.8096351986
+教民 10.3743171274
+成化 9.59661255877
+沙赫特 13.2075304714
+投股 13.2075304714
+检察局 12.5143832909
+大肚皮 11.8212361103
+格雷博 13.2075304714
+爱尔兰 8.1641053545
+性心理 11.1280889297
+三焦俞 13.2075304714
+厂部 11.7034530746
+马骨 11.2616203224
+咋舌 10.8096351986
+鼓王 12.8020653633
+辞句 11.8212361103
+茨冈 11.8212361103
+马埃斯 12.2912397395
+能流 11.8212361103
+金斯堡 13.2075304714
+王朔 12.8020653633
+王望 13.900677652
+背斜 9.19114745066
+低分子烃 12.8020653633
+告饶 10.533381822
+王朝 6.34059718695
+郑州大学 9.35738286971
+焦耳定律 12.1089181827
+假彩色 13.2075304714
+读书笔记 13.2075304714
+归政成 12.8020653633
+汉源 11.8212361103
+扎牢 12.2912397395
+相亲相爱 11.0103058941
+萘酚 11.5027823792
+大飞跃 13.900677652
+逼抢 13.900677652
+度假者 13.900677652
+石琴 13.900677652
+乐凯 12.5143832909
+王曼 12.2912397395
+干柴 9.71102290995
+举起手来 10.765183436
+碰头 10.3171587135
+法帖 10.8096351986
+搬动 10.4994802703
+春秋繁露 11.598092559
+四胡 11.3357282945
+营业部 6.87247621992
+法师 8.87023973058
+枣红 12.1089181827
+雷鸟 10.5684731418
+厂地 13.900677652
+法币 10.3453295905
+霍博克 12.5143832909
+吃白食 12.8020653633
+篷车 12.5143832909
+巴伦支 12.8020653633
+春麦 10.8561552143
+涂着 11.1926274509
+收入 5.28563206039
+干果 9.91169360541
+牧放 11.7034530746
+尊贤使能 12.5143832909
+博览会 8.39534611604
+卡迪尔 13.2075304714
+静宁县 12.8020653633
+犯愁 9.82314020807
+万国宫 13.2075304714
+弹性散射 11.1926274509
+米尔纳 13.900677652
+子宫颈 10.1394775363
+收养 9.35738286971
+马衔杯 13.2075304714
+酸罐 13.900677652
+自然课 13.900677652
+汪妻 11.598092559
+卡努特 13.900677652
+展示中心 13.2075304714
+柳色 11.9547675029
+各个击破 10.4041700905
+选段 12.5143832909
+素称 9.31571017331
+收兑 11.5027823792
+四股 12.1089181827
+艾闻 13.2075304714
+汉满 13.2075304714
+胡诌 10.3743171274
+干枯 8.92394390956
+土生 10.5684731418
+若列藩 13.2075304714
+日差 13.2075304714
+四联 10.4666904475
+日工 10.8561552143
+周为氏 13.2075304714
+王晨 13.2075304714
+王景 10.7226238216
+四万余顷 13.2075304714
+歌舞团 9.80633308975
+吉尔达 13.2075304714
+塞吉 12.5143832909
+体温计 12.8020653633
+法规性 12.8020653633
+虏获 11.8212361103
+数学力学系 13.2075304714
+法座 11.598092559
+法度 9.27570483869
+两千余斤 13.2075304714
+水封 13.900677652
+小龙虾 12.8020653633
+派定 12.1089181827
+床沿 9.45802639549
+宁晋县 12.2912397395
+逼成 11.9547675029
+鄯善县 12.5143832909
+王晋 11.4157710022
+柳花 11.9547675029
+刘复 12.5143832909
+含山县 13.900677652
+法库 11.8212361103
+土田 11.5027823792
+王晓 10.533381822
+踢脚线 13.900677652
+搬到 8.61747392324
+山戎 11.2616203224
+乐克 13.2075304714
+褚晓亮 13.2075304714
+张闻天 10.9562386728
+频仍 9.87532596124
+偏来 12.8020653633
+魏武帝 10.6818018271
+派对 10.3743171274
+平等互惠 12.8020653633
+萘醌 12.2912397395
+厂里 8.47133202302
+恨声 11.3357282945
+狭义 8.00352378434
+乐儿 12.5143832909
+王昭 13.900677652
+白铁皮 12.5143832909
+厚壁组织 11.3357282945
+戏曲界 12.1089181827
+蓝领 11.2616203224
+耍脾气 12.5143832909
+王昶 12.1089181827
+迎向 11.598092559
+乱葬岗子 13.2075304714
+收出 8.58747167293
+虬枝 11.9547675029
+水层 10.1394775363
+文滋 13.900677652
+立福藩 11.9547675029
+红头文件 10.533381822
+牧斓 12.1089181827
+王昆 12.8020653633
+偏松 11.5027823792
+毕希纳 11.8212361103
+历史长河 10.8561552143
+代言 9.40086798165
+王明 9.59661255877
+新闻出版局 11.8212361103
+张自忠 10.642581114
+斯维亚 13.2075304714
+土番 13.2075304714
+王昕 13.900677652
+教派 8.44963919841
+共同愿望 12.2912397395
+拓片 9.82314020807
+柳若 13.900677652
+雷默 12.5143832909
+土窟 13.900677652
+水原 10.9562386728
+法儿 9.01032852375
+暂缓实行 13.900677652
+濑田 13.900677652
+日剧 11.8212361103
+请赏 10.9562386728
+容若 12.8020653633
+蓝靛 11.1280889297
+能接 13.900677652
+太宗传 12.5143832909
+独立国 11.7034530746
+水压 10.0294766411
+乌拉尔军区 11.7034530746
+怨艾 11.7034530746
+通讯稿 13.2075304714
+告假 10.642581114
+水厂 10.4666904475
+吵起来 10.604840786
+正方体 12.8020653633
+供求关系 8.41588071849
+收市 8.60236028543
+袋装 11.1280889297
+信用原则 13.900677652
+华为公司 11.4157710022
+礞石 13.2075304714
+埃达克 13.900677652
+收帐 13.900677652
+浪荡子 12.1089181827
+比降 8.79473217808
+柳贯 12.5143832909
+功利 9.65218240993
+不堪回首 10.642581114
+比附 11.5027823792
+光密 9.31571017331
+胡昭曦 11.2616203224
+济贫拔苦 13.900677652
+张鼎延 12.8020653633
+代薪 13.900677652
+四辑 12.5143832909
+告借 11.7034530746
+日利 13.900677652
+法典 8.43684584695
+猫王 11.1280889297
+党委书记 8.1386262692
+云木香 12.8020653633
+法共 10.8561552143
+法兰 11.5027823792
+告倒 12.2912397395
+扎紧 10.9562386728
+刘通 11.9547675029
+焰心 13.2075304714
+查土丁 13.2075304714
+洪山区 12.2912397395
+四辆 11.1280889297
+休憩 10.4041700905
+印陆军 12.5143832909
+安眠酮 13.2075304714
+巴林国 13.900677652
+派员 9.45802639549
+日刊 11.9547675029
+止跌 8.86372504956
+哲里木盟 10.6818018271
+四边 9.61021821083
+成单 11.9547675029
+四达 12.5143832909
+乐府 9.23723855786
+杨镐之 12.8020653633
+二等兵 12.8020653633
+隆隆响 11.7034530746
+摆摊儿 12.1089181827
+日创 13.2075304714
+恳切地 10.3743171274
+贺圣朝 13.2075304714
+民事 8.19356738723
+吴兵屯 13.2075304714
+水口 10.2897597393
+苏格兰 7.89186446653
+选摘 13.900677652
+薛兼崇 13.2075304714
+功力 9.30555780184
+马铃 12.8020653633
+湛江港 10.765183436
+哼唷 13.900677652
+广彩瓷 12.2912397395
+水北 11.8212361103
+黄继光 11.3357282945
+金镶宝 13.2075304714
+王楷 12.5143832909
+智能仪表 13.900677652
+共收缴 13.2075304714
+容色 12.1089181827
+我中有你 11.8212361103
+民乐 10.604840786
+傻气 11.9547675029
+水区 12.1089181827
+皮增厚 12.8020653633
+法军 8.64318227995
+于惠陵 13.2075304714
+鬓角 9.94943393339
+引入歧途 12.1089181827
+功劳 8.19689517732
+操守 9.89334446674
+四载 11.8212361103
+十指连心 12.2912397395
+能指 13.2075304714
+郗鉴 12.1089181827
+长江源 13.2075304714
+特大案件 13.900677652
+柳二爷 13.900677652
+符合国情 11.5027823792
+王楚 13.2075304714
+四轮 9.91169360541
+民丰 10.533381822
+朱拉隆功 13.900677652
+磺胺类 11.0674643079
+于孝惠 13.2075304714
+塞子 11.0103058941
+水南 12.5143832909
+民主 6.79243351224
+臭小子 12.1089181827
+夜郎自大 12.5143832909
+兰香先 13.2075304714
+教战 12.8020653633
+石油工业部 11.9547675029
+功勋 8.83177344976
+投身 8.56795885871
+热气球 10.8561552143
+庞士元 11.598092559
+刘邓 9.87532596124
+石门镇 12.2912397395
+干栏 10.5684731418
+九江镇 13.900677652
+临门 11.598092559
+马钧 11.0674643079
+外资银行 9.23723855786
+猫猫 11.8212361103
+刘邦 8.51618258919
+终端设备 10.765183436
+鸣唱 11.9547675029
+顺德人 11.8212361103
+科索沃 10.8561552143
+干校 9.82314020807
+马钰 12.8020653633
+赫林耶 12.2912397395
+噪声源 11.7034530746
+乐师 10.1394775363
+杨雄醉 12.8020653633
+伏暑 12.8020653633
+临死时 10.4666904475
+休想 9.20019728618
+扒起 12.8020653633
+水力 8.48903160012
+第九十二 13.900677652
+灵露 13.900677652
+翻船 10.4994802703
+强台风 11.4157710022
+王森 13.2075304714
+专项经费 12.5143832909
+装门面 11.9547675029
+屈切克 13.2075304714
+物欲横流 12.8020653633
+螺丝母 13.900677652
+十二平均 11.3357282945
+检察厅 12.2912397395
+黑芝麻糊 13.900677652
+赠礼 11.8212361103
+沈万山 12.2912397395
+大侠 11.1280889297
+水势 9.03314320152
+吉拉林 12.5143832909
+温带植物 11.7034530746
+塔拉基 12.5143832909
+卖钱 10.3743171274
+弗斯 11.3357282945
+高行健 13.900677652
+马镫 10.4994802703
+月儿圆 12.8020653633
+乐心 13.900677652
+理趣 11.7034530746
+日南 10.9562386728
+牧歌 10.4666904475
+奔走钻营 13.900677652
+前程似锦 12.8020653633
+土管 13.900677652
+水务 9.54396882529
+选料 10.9049453784
+教授 5.71895719685
+完形 11.7034530746
+解放以前 12.8020653633
+赠票 13.2075304714
+柴明达 11.7034530746
+怎知 10.2371160058
+千多年 10.0294766411
+火头上 12.8020653633
+波呈峰 12.5143832909
+表姨夫 13.2075304714
+玄宗时 10.4349417492
+自由支配 11.4157710022
+颅脑 10.5684731418
+戏单 11.9547675029
+选文 12.2912397395
+身教 13.2075304714
+杨韵谱 13.2075304714
+王梁 12.5143832909
+明殿学士 13.900677652
+乐得 9.13850371718
+马锡 11.8212361103
+马尔维纳斯群岛 10.8096351986
+惩办 9.66657114738
+百分之五 11.2616203224
+伤生 11.0103058941
+收归 9.91169360541
+健脾胃 12.2912397395
+伏望 10.9049453784
+收录 8.84443184663
+金城川 13.2075304714
+五角钱 12.5143832909
+大肠菌群 12.2912397395
+日化 10.4349417492
+随口答应 11.9547675029
+引火烧身 10.9049453784
+卧谈 13.900677652
+淘气鬼 12.8020653633
+王桥 13.2075304714
+眯着 10.8096351986
+花样儿 11.8212361103
+朱化麟 12.8020653633
+着作权 9.96885201925
+季子白 12.1089181827
+四蹄 10.1394775363
+水分 7.42987814819
+巴丫儿 13.900677652
+刘金 11.1280889297
+科技含量 10.1164880181
+休息 6.27703570546
+学位办 13.900677652
+王桂 13.2075304714
+止疼药 12.1089181827
+马川 11.8212361103
+百分之九 11.8212361103
+能成 10.2897597393
+投进 9.80633308975
+伤病 10.3743171274
+服装设计 10.604840786
+马门 11.8212361103
+殴辱 12.5143832909
+桃红色 13.2075304714
+理财 6.58213810341
+点多 9.58318953844
+妄为 11.0103058941
+伤痛 9.32596667347
+收得 9.87532596124
+色迷 13.900677652
+投过 11.3357282945
+伤痕 9.36807815882
+红缨枪 11.1280889297
+理赔 9.07236391467
+任文学 12.1089181827
+总机 10.7226238216
+伤疤 9.45802639549
+天目山 9.30555780184
+胶皮 10.6818018271
+土筐 13.900677652
+区委 9.55687223012
+经济模式 9.21854642485
+漳州战役 13.2075304714
+休怪 9.58318953844
+水剂 10.9562386728
+执事官 12.1089181827
+收心 11.5027823792
+民众 7.07196558033
+理起 12.8020653633
+王栋 13.2075304714
+猫爪 12.2912397395
+乐亭县 11.598092559
+一掉头 13.900677652
+六角网 13.900677652
+并发程序 12.5143832909
+民企 9.06439574502
+所向无敌 10.1394775363
+王树 11.598092559
+眯眼 10.4041700905
+半兜 13.2075304714
+总有 7.98447558937
+高层次 9.56994431169
+能手 9.35738286971
+马陆 11.7034530746
+驱逐 8.0285598625
+含铁 9.65218240993
+养尊处优 10.3171587135
+水军 8.70218062071
+法医 11.1280889297
+千乘万骑 13.900677652
+豫章 10.3453295905
+努着嘴 12.1089181827
+千红万紫 12.8020653633
+卧车 11.5027823792
+朱浒 13.2075304714
+被单 10.2897597393
+收尸 10.5684731418
+包米 12.8020653633
+护林员 13.2075304714
+金砖银 13.900677652
+收尾 10.1394775363
+卧轨 13.900677652
+疑无路 11.598092559
+共进午餐 12.1089181827
+王毅 10.1164880181
+三十五席 13.2075304714
+水冷 9.4233408375
+选曲 12.5143832909
+水冲 10.5684731418
+畸变 9.84023464143
+王母 10.533381822
+含铬 11.0103058941
+与时俱进 9.7898037878
+森林工业 10.533381822
+马陵 10.9049453784
+开创性 9.65218240993
+赫奈斯 13.2075304714
+语音学 10.642581114
+四跨 13.900677652
+非官方 10.6818018271
+刘鉴 13.900677652
+扎罗 11.9547675029
+蕨类 9.87532596124
+敞开式 11.4157710022
+水凝 12.2912397395
+被包 11.9547675029
+党政领导 10.765183436
+四趟 13.2075304714
+翻腾 9.00283785202
+含钒 12.5143832909
+探险队员 13.900677652
+水凉 12.8020653633
+水准 8.41588071849
+马队 9.96885201925
+含钙 10.5684731418
+胶画 13.900677652
+暨南大学 9.74179456862
+塞姆 12.2912397395
+三万五千四百四十五箱 13.2075304714
+密云不雨 12.5143832909
+一万二千名 13.2075304714
+含钡 12.8020653633
+背椅 13.900677652
+二十一团 13.2075304714
+搭进去 11.5027823792
+嫉恶 13.900677652
+军务院 12.5143832909
+额枋 12.2912397395
+法华 10.4349417492
+文词儿 12.8020653633
+全盛期 11.7034530746
+卡涅姆 11.4157710022
+两千户 12.8020653633
+偏析 11.7034530746
+蛙鸣 11.4157710022
+三十五年 9.94943393339
+王正 11.7034530746
+伧父 12.5143832909
+搬弄 11.4157710022
+乐山 9.28555713513
+王武 12.5143832909
+搬开 10.4666904475
+白刃战 11.9547675029
+上犹县 12.2912397395
+安文思 12.5143832909
+马雍 11.7034530746
+黏合 11.5027823792
+塞外 9.18217878068
+行汉法 11.4157710022
+四通集团 12.5143832909
+许兄 11.9547675029
+王死 11.598092559
+犯法 9.27570483869
+人口压力 11.598092559
+项武忠 13.900677652
+蹄子 8.4284069783
+州治 9.75754292558
+四起 9.09665660724
+李伟眯 13.2075304714
+王浚联 13.2075304714
+被叫 10.4041700905
+辐射损伤 12.8020653633
+艺术片 11.4157710022
+管通情 13.2075304714
+马雷 11.9547675029
+塞夫 12.1089181827
+比德 11.2616203224
+法厄 13.900677652
+驱邪 10.2897597393
+马隆 12.1089181827
+王欢 12.1089181827
+服务水平 9.54396882529
+国电电力 10.1164880181
+专题性 11.8212361103
+牛角 9.61021821083
+法号 10.8096351986
+边防线 11.9547675029
+罗桑曲 13.2075304714
+定于一尊 12.1089181827
+刘大顺 9.44633035572
+水光 11.2616203224
+秧歌剧 12.2912397395
+法律宣传 13.900677652
+重义气 13.2075304714
+塞奇 12.5143832909
+忙忙乱乱 12.8020653633
+吉尔苏 12.8020653633
+核裁军 11.0674643079
+格非 13.2075304714
+水具 13.900677652
+水兴 12.5143832909
+水兵 9.44633035572
+水关 10.765183436
+王玉真 13.900677652
+靖乱 13.900677652
+大师级 11.9547675029
+咋回事 10.4041700905
+二不休 10.2897597393
+阿霉素 12.1089181827
+日公 13.900677652
+派场 12.8020653633
+净剩 13.2075304714
+四百九十七章 13.2075304714
+容臣 11.0674643079
+脑中风 12.2912397395
+小娃子 13.900677652
+三读通过 12.8020653633
+弗林 11.9547675029
+扒车 13.2075304714
+比昂迪 13.2075304714
+法利 12.8020653633
+力尽 11.3357282945
+大骨节 12.5143832909
+乐工 9.98865464655
+接待日 13.900677652
+赛狗 11.5027823792
+韩家潭 12.5143832909
+日共 11.2616203224
+就业观 13.900677652
+肉粽 12.8020653633
+日光 8.80081122415
+翻耕 10.4994802703
+用手 7.45178825783
+广播设备 12.8020653633
+形式化 10.2371160058
+靖侯 13.900677652
+格隆 12.2912397395
+列车员 11.8212361103
+投资 3.89017595179
+马豫兴 13.2075304714
+三折肱 13.2075304714
+鬼魅伎俩 13.900677652
+杰维斯 13.2075304714
+刃脊 12.2912397395
+倒骑驴 13.900677652
+宁国 10.1164880181
+睁只眼 10.4994802703
+久保田 13.2075304714
+膜结构 11.1280889297
+特地回 13.900677652
+鲁乃湖 13.2075304714
+理过 12.8020653633
+万言书 10.533381822
+赵大锤 9.80633308975
+合成树脂 10.3743171274
+背根 13.2075304714
+门之谊 13.900677652
+被删 13.900677652
+尼基人 13.900677652
+被判 9.04086524761
+磨光面 12.8020653633
+东南方 10.1164880181
+容膝 13.2075304714
+运兵船 11.9547675029
+赠答 11.3357282945
+阿雷瓦洛 12.5143832909
+割包皮 13.900677652
+恶语伤人 13.900677652
+显性化 10.765183436
+总数 6.91781490051
+老莱子 13.900677652
+提供者 11.0674643079
+选材 10.2897597393
+伏日 13.2075304714
+告发 9.15574552361
+航向 9.35738286971
+弗朗 11.2616203224
+仙霞岭 10.4041700905
+日出 8.61747392324
+印尼盾 11.7034530746
+二等功 11.2616203224
+法务 11.5027823792
+伏旱 10.642581114
+镇静钢 13.900677652
+郑人买履 13.2075304714
+法办 11.2616203224
+毫米数 13.2075304714
+法力 9.53122979951
+养廉银 13.900677652
+埃兹 13.900677652
+马韩 12.5143832909
+留置送达 13.2075304714
+不为已甚 13.2075304714
+活性碳 11.598092559
+怎生 8.10766404359
+尼泊尔人 12.5143832909
+河姆渡 9.89334446674
+西北地区 8.23771717184
+弃权票 13.900677652
+收工 9.98865464655
+塞塞 12.8020653633
+宪兵营 13.900677652
+四谛 11.0103058941
+马鞍 9.27570483869
+塞塔 12.8020653633
+投足 12.1089181827
+含锌 11.598092559
+七百架 13.900677652
+羁縻 9.5186510173
+雹子 11.4157710022
+孟小冬 12.1089181827
+谦逊地 10.3453295905
+总支 11.2616203224
+含锡 11.8212361103
+选机 12.8020653633
+何相干 11.598092559
+被劫 11.1280889297
+休战 10.2371160058
+无巧不成书 11.1926274509
+法勒 13.2075304714
+含锰 11.3357282945
+选本 10.6818018271
+日军 7.23754495598
+交回 11.598092559
+日冕 10.765183436
+潦草 10.3743171274
+刘新民 12.8020653633
+防波堤 10.3171587135
+仅供参考 8.9308643524
+卷曲 9.56994431169
+干法 10.5684731418
+有去无来 13.900677652
+其他费用 11.0674643079
+托古改制 10.8096351986
+东荆河 11.2616203224
+格德 12.5143832909
+代臣 13.2075304714
+专心诚意 13.900677652
+巴斯德 10.2117981979
+延安大学 11.7034530746
+劳师动众 12.8020653633
+压缩版 13.2075304714
+马道 11.3357282945
+旅业 11.1280889297
+维查峰 13.900677652
+董贤举 13.2075304714
+栖息 7.52055511508
+选情 12.8020653633
+汉文 8.26588804881
+文言文 10.7226238216
+汉方 13.2075304714
+拉巴斯 11.5027823792
+碰到 7.34247984916
+北海道 9.58318953844
+土纸 10.9049453784
+通行本 10.6818018271
+雷锋 10.765183436
+袭击者 10.8096351986
+塞德 12.5143832909
+马遵 11.598092559
+小长梁 11.9547675029
+景气衰退 13.900677652
+汉斯 10.4994802703
+水垢 11.7034530746
+水域 7.6604018068
+通行权 12.2912397395
+卡塔罗 13.2075304714
+干沟 11.5027823792
+马逊 13.900677652
+水城 10.4041700905
+丁抚台 12.2912397395
+酒足饭饱 11.2616203224
+汉族 6.7981782962
+神宗皇帝 11.4157710022
+清晰度 10.8561552143
+马速 12.2912397395
+插销 12.1089181827
+休斯 10.2117981979
+统计数字 9.74179456862
+四讲 13.900677652
+床板 10.2117981979
+水基 11.9547675029
+告吹 11.0103058941
+止观 11.598092559
+水培 13.900677652
+手则 13.2075304714
+数十公顷 13.900677652
+撤回来 11.1280889297
+铁线 11.8212361103
+王涛 11.9547675029
+总把 12.5143832909
+格里 9.54396882529
+法商 11.5027823792
+汽车零件 11.3357282945
+入市 7.70627226087
+水土 9.4233408375
+佩文韵 13.2075304714
+危险物 13.900677652
+休整 8.46259834305
+宰牲亭 13.900677652
+大侃 12.8020653633
+马郎 12.5143832909
+干汝 13.900677652
+王浩 12.1089181827
+纠缠 8.17382990439
+探听到 11.3357282945
+迂回前进 12.8020653633
+子衡 11.9547675029
+猿马 12.5143832909
+王海 9.56994431169
+水圈 10.0940151622
+当代作家 13.900677652
+悠长 10.0294766411
+反走私 12.5143832909
+络脉 10.8096351986
+数毫米 12.8020653633
+基本一致 8.97342396682
+肌红蛋白 10.8096351986
+王浆 12.5143832909
+键钮 12.2912397395
+刘铭 13.900677652
+床架 12.5143832909
+国龙亢 13.2075304714
+王济 12.2912397395
+水地 10.2371160058
+削职为民 11.598092559
+白行简 11.8212361103
+变起 11.5027823792
+旅人 10.4666904475
+能有 8.1641053545
+翼城县 13.900677652
+刘钊 13.900677652
+水坝 9.80633308975
+相去不远 11.598092559
+王津 13.900677652
+率队 11.0674643079
+俞丽拿 12.2912397395
+莫里茨 12.8020653633
+雷闪 11.7034530746
+马邈 12.8020653633
+转型 7.07521761572
+测速仪 12.2912397395
+马邑 11.598092559
+玛拉 13.2075304714
+伸缩式 11.2616203224
+完胜 11.0103058941
+法嗣 12.5143832909
+宁海人 13.900677652
+扦子 12.8020653633
+言外之意 10.9562386728
+代脉 12.2912397395
+总成 9.82314020807
+瘌痢头 13.2075304714
+操心 7.82303540863
+奇瓦瓦州 12.8020653633
+刘钢 13.900677652
+意识形态化 13.2075304714
+刘钧 12.8020653633
+裸细胞 13.900677652
+制盐人 13.2075304714
+肛交 13.900677652
+领导有方 13.900677652
+王洙 13.2075304714
+猫眼 10.1164880181
+王波 13.2075304714
+酒色之徒 11.8212361103
+怪相 11.598092559
+红喷喷 12.2912397395
+乐寺 11.9547675029
+被告 8.31342899358
+艾马克 12.5143832909
+官一齐 12.2912397395
+北京世界公园 13.2075304714
+总揽 9.91169360541
+文件汇编 13.900677652
+包扎法 13.900677652
+马耀华 11.8212361103
+比较级 13.900677652
+湮没无闻 11.7034530746
+跟包 10.4041700905
+中山纪念中学 12.8020653633
+胶片 9.85762638414
+胶版 12.5143832909
+推荐性 11.598092559
+日均 8.05713323494
+法名 9.53122979951
+斯拉夫斯基 10.4666904475
+起搏 11.3357282945
+头陀 10.0505300503
+王法 9.84023464143
+胎死腹中 11.5027823792
+旅伴 12.8020653633
+游标卡尺 12.2912397395
+尉伍琼 13.2075304714
+簸箕 9.82314020807
+埃明帕 13.900677652
+姐弟恋 13.2075304714
+无线电台 10.7226238216
+桑榆 13.2075304714
+派兵 7.88696249593
+免费资源 12.5143832909
+唐以朱 12.8020653633
+王河 13.2075304714
+俩个 11.9547675029
+水囊 12.1089181827
+一下子站 11.1926274509
+日场 13.900677652
+陈旧性 12.1089181827
+刘锐 13.2075304714
+鹳雀 13.900677652
+电视转播 11.9547675029
+日地 10.533381822
+奋勇向前 12.2912397395
+木桩 9.58318953844
+婚期定 12.5143832909
+日圆 9.80633308975
+干涸 8.84443184663
+闺阁 9.94943393339
+尿频 10.0940151622
+尼基塔 11.7034530746
+日土 12.8020653633
+派克 10.8096351986
+宽敞明亮 11.2616203224
+关南原 12.2912397395
+收字 11.9547675029
+收存 11.8212361103
+俩一 11.5027823792
+乐安 10.533381822
+水团 10.642581114
+干涩 9.89334446674
+东荡西除 13.900677652
+收审 10.9562386728
+近海渔业 11.4157710022
+王汤 13.900677652
+袁翰青 13.2075304714
+痛楚 9.35738286971
+教权 10.533381822
+饱餐秀色 13.900677652
+诺维 13.900677652
+马金 12.5143832909
+意蕴 11.1280889297
+收容 9.62401153296
+释严颜 12.2912397395
+嗜茶 13.900677652
+水田芥 13.900677652
+派军 10.642581114
+激发 7.53420720424
+投诚 10.0940151622
+教条 9.93038573842
+王汉 12.2912397395
+收完 11.5027823792
+汪道涵 11.598092559
+投诉 8.07763175649
+陈炳德 13.2075304714
+也门 9.49395840471
+收官 9.09665660724
+惠晖 13.900677652
+没计奈何 12.1089181827
+屠宰税 12.8020653633
+从东州 12.1089181827
+修饰语 11.8212361103
+派出 7.37564799413
+岐山 9.93038573842
+猪丹毒 12.5143832909
+管制区 13.2075304714
+抽砂 13.900677652
+泄泄沓沓 12.2912397395
+阿波利奈 12.1089181827
+支那人 10.7226238216
+姆贝基 13.900677652
+胶状 10.9562386728
+王水 9.87532596124
+土壤温度 12.8020653633
+李青山 11.8212361103
+王永 11.7034530746
+压缩率 12.8020653633
+修饰词 13.900677652
+铜陵市 11.3357282945
+止血 8.77671367257
+教本 11.0674643079
+叶羽状 12.8020653633
+超越数 11.9547675029
+两千斤 12.2912397395
+老调重谈 13.2075304714
+王氏 9.53122979951
+鬼物 13.900677652
+干活 7.77818484246
+结交 9.03314320152
+骄傲自大 13.900677652
+整套 9.94943393339
+捞刀河 12.5143832909
+水器 11.8212361103
+王气 10.6818018271
+独立化 10.642581114
+杨胖子 13.2075304714
+雷铜 11.2616203224
+代耕 12.1089181827
+隐隐然 11.7034530746
+碰倒 11.5027823792
+四角 9.15574552361
+画语录 12.1089181827
+哂笑 11.0674643079
+怀其德 13.2075304714
+层层 8.28390655431
+犯案 11.598092559
+派到 10.1394775363
+张慎言 11.0674643079
+穆尼埃 12.8020653633
+选拔 8.1417758781
+汪道渊 13.2075304714
+功名 8.86372504956
+比丘尼 10.8561552143
+溜冰场 13.900677652
+贝氏体 12.8020653633
+政令 9.17328983326
+戏中戏 12.5143832909
+雷震 10.1394775363
+雷霆 9.69598503258
+连成线 12.5143832909
+金朝建国 12.5143832909
+改置 9.56994431169
+泰王国 13.2075304714
+搬家 8.37124856446
+选拨 12.8020653633
+土粪 12.5143832909
+怪病 10.9562386728
+选拣 11.8212361103
+刘陶 13.2075304714
+王濞 11.0103058941
+球茎甘蓝 13.900677652
+技术类 12.8020653633
+萧嘉穗 11.598092559
+封起 12.8020653633
+主打产品 10.604840786
+一捆 9.56994431169
+饭桌 8.94485059437
+一亿人次 13.900677652
+弗拉 10.8561552143
+罗文又 13.900677652
+青年教师 11.8212361103
+塔山 9.96885201925
+福通弟 13.2075304714
+釉瓷 10.642581114
+孕育 8.36728816325
+续稿 12.1089181827
+王都尉 11.2616203224
+芦芽山 11.2616203224
+余毫米 11.3357282945
+日后 6.95755522916
+土系 12.2912397395
+犬儒主义 13.900677652
+法坛 11.5027823792
+王澄 12.2912397395
+同心合意 12.2912397395
+回母校 12.1089181827
+怨嗟 13.900677652
+乐境 13.900677652
+饭桶 11.3357282945
+政事 8.0985592766
+土坷垃 11.4157710022
+杰哈德 13.900677652
+车师六 13.2075304714
+宗一郎 12.5143832909
+闺门 11.0103058941
+酿酒师 11.1926274509
+刘集 11.8212361103
+王潮 11.9547675029
+能攻 12.2912397395
+二十一分 13.900677652
+无家可归 9.74179456862
+选手 8.62767809341
+层次分明 10.4666904475
+隙缝 11.7034530746
+妇人之见 11.9547675029
+方寸大乱 13.2075304714
+蓝釉 12.1089181827
+报德 12.8020653633
+施普林 11.9547675029
+分频器 12.8020653633
+汉中市 11.8212361103
+贪食者 13.2075304714
+棒球队 12.2912397395
+林丛 13.2075304714
+干湿 9.13850371718
+蹄形 12.5143832909
+役龄 12.2912397395
+永田 13.900677652
+林业 7.7083151625
+索尔莫沃 12.5143832909
+东翻西 12.8020653633
+汉末 9.31571017331
+陈长蘅 12.5143832909
+秋冬养 12.8020653633
+努尔丁 12.8020653633
+赫谢尔 13.900677652
+鬓边 9.87532596124
+比邻 12.2912397395
+检察员 12.5143832909
+杨坚灭 12.2912397395
+聚着 12.1089181827
+雷子 12.2912397395
+周宝珠 11.5027823792
+圣戈班 13.900677652
+臧霸 11.4157710022
+收声 13.2075304714
+雷音 10.4349417492
+柳词 12.2912397395
+爸爸妈妈 9.56994431169
+刘隐 11.7034530746
+副局长 8.12302532875
+涂绘 12.5143832909
+刘隗 11.9547675029
+保持原状 11.7034530746
+干渴 10.7226238216
+法域 13.900677652
+总怕 11.1926274509
+真空开关 13.2075304714
+奠立 11.1926274509
+钱普 9.33632946051
+六百三十四 12.5143832909
+沙河镇 13.2075304714
+临危不惧 11.8212361103
+瘾君子 13.2075304714
+干渠 9.75754292558
+满汉合 13.2075304714
+刘隽 13.2075304714
+满汉各 12.2912397395
+许旺氏 12.8020653633
+赠给 10.1871055853
+能效 9.6811699468
+临场经验 13.900677652
+隔壁家 13.2075304714
+塞岛 13.2075304714
+千里之行 13.900677652
+将建 11.2616203224
+大发慈悲 12.5143832909
+发不到 13.2075304714
+王滨 12.5143832909
+含量 6.78104201396
+钞录 13.900677652
+含金 11.0674643079
+公积金 8.36334338496
+周去非 12.1089181827
+兵疲意阻 13.900677652
+扎穿 13.2075304714
+刘青 13.900677652
+翁大人 12.8020653633
+青龙顿 12.8020653633
+毓璜顶 12.8020653633
+最高人民检察院 10.4994802703
+教旨 11.7034530746
+科学实践 12.2912397395
+王永华 13.900677652
+十二金钗 12.8020653633
+司法警察 12.1089181827
+理论 5.25843897159
+日商 11.0674643079
+比酒 13.900677652
+收复 7.12645376562
+通胀率 9.40086798165
+寻妹记 13.2075304714
+对称中心 11.8212361103
+康氏粉 13.2075304714
+柏吉尤斯 12.8020653633
+全面实施 10.0505300503
+阴邪 12.1089181827
+阻聚作用 13.2075304714
+营业额 9.30555780184
+苟延残喘 10.2117981979
+腰站 12.1089181827
+山货 10.7226238216
+王溥 11.598092559
+转让权 13.900677652
+水代兵 12.1089181827
+刘震 11.4157710022
+姆斯基 13.2075304714
+背水 11.1280889297
+承包经营 10.9562386728
+法器 10.4349417492
+环岛游 13.900677652
+四袋 12.8020653633
+波束宽度 13.900677652
+敖氏 12.1089181827
+收好 10.2371160058
+蜗角 13.900677652
+约瑟芬 12.2912397395
+月亮代表 13.900677652
+背气 13.2075304714
+王源 12.5143832909
+东烂西 12.5143832909
+管理局长 13.2075304714
+灯塔县 13.900677652
+宗废太子 12.1089181827
+地下商场 12.5143832909
+斯克航 13.900677652
+望昭德 13.2075304714
+欧洲盟军 12.1089181827
+第十位 10.4041700905
+吴景旭 13.900677652
+消极情绪 11.9547675029
+消除隐患 12.2912397395
+阿多诺 12.8020653633
+代言人 9.28555713513
+吉林敖东 11.1280889297
+全局观念 12.1089181827
+教教 11.5027823792
+戮力 10.9049453784
+汉昌 11.9547675029
+水合 10.4349417492
+汉明 13.900677652
+市场机制 8.94485059437
+被囚 10.1630080337
+锤子敲 11.9547675029
+九点钟 11.4157710022
+金斯克 13.2075304714
+王湾 12.2912397395
+四行 10.2117981979
+金像奖 11.8212361103
+综合派 11.4157710022
+公会堂 13.2075304714
+痛死 12.8020653633
+不得不尔 13.2075304714
+吴方言 12.1089181827
+痛歼 11.5027823792
+比量 11.7034530746
+比重 6.45350929238
+独立党 11.1926274509
+晋元帝 10.4994802703
+防眩 13.900677652
+俄空军 11.8212361103
+含酸 11.598092559
+报忧 9.93038573842
+法国 5.36152729321
+苏氏 10.2117981979
+宋体字 13.900677652
+徐自华 13.900677652
+开关柜 11.7034530746
+武昌路 13.2075304714
+滑石粉 11.9547675029
+另换 11.4157710022
+雷雨 9.23723855786
+雷雷 13.900677652
+汉晋 10.8561552143
+硫酸铝钾 12.8020653633
+盒中 12.8020653633
+花如雪 13.900677652
+乐天 10.642581114
+法因 11.2616203224
+煤末子 13.2075304714
+网络服务 10.8561552143
+极地冰川 11.7034530746
+碰击 11.0674643079
+拐枣 13.900677652
+划代原则 13.900677652
+自洽场 12.5143832909
+伊格林 13.2075304714
+势函数 11.2616203224
+外白渡桥 11.8212361103
+汉普 12.8020653633
+轰走 10.7226238216
+粟都尉 13.2075304714
+政企 12.2912397395
+厮守 10.2371160058
+于心不忍 11.1280889297
+徐芳 8.98802276624
+热线联系 12.5143832909
+王燮 9.69598503258
+民团 10.4994802703
+巴伦特 13.900677652
+土壤学家 11.7034530746
+碰上 7.61841090508
+碰下 12.5143832909
+汉禅 12.5143832909
+输粮 12.8020653633
+草炭 12.8020653633
+四音 12.8020653633
+刘表 9.29550746599
+淮扬 9.94943393339
+成长型 10.0088573539
+更待何时 9.94943393339
+十二三岁 10.6818018271
+刘衡 13.2075304714
+总统 6.17844290727
+日食 10.0940151622
+投降 6.5123497924
+上影线 10.2897597393
+居庸 11.1926274509
+王燕 11.9547675029
+干热 9.49395840471
+试验报告 11.598092559
+戴铁 11.598092559
+优劣势 12.8020653633
+总纲 10.8096351986
+汽车兵 12.1089181827
+交配季节 12.5143832909
+老成持重 10.8096351986
+汉科 11.598092559
+那石椁 11.9547675029
+马蹄金 12.2912397395
+火炉子 12.2912397395
+总线 10.4349417492
+莫尔多瓦 12.1089181827
+阴都 13.2075304714
+昆明巫家坝机场 13.2075304714
+乌丘 13.2075304714
+特尼河 12.8020653633
+剖示 13.900677652
+文人相轻 13.2075304714
+心肠歹毒 12.5143832909
+红灯区 12.2912397395
+无可挑剔 10.4666904475
+凸轮轴 10.9562386728
+拍卖时 12.8020653633
+马谡 10.3171587135
+四清运动 12.2912397395
+阿西恩 13.2075304714
+干点 9.7898037878
+总纂 12.1089181827
+持币观望 10.533381822
+九江路 12.8020653633
+皱眉头 9.17328983326
+湘乡市 9.48183704418
+居延 10.3743171274
+危险源 13.900677652
+废塑料 11.8212361103
+范托夫 11.2616203224
+老艾 11.9547675029
+王照 12.1089181827
+田面权 12.5143832909
+北惠庭 13.900677652
+亡命徒 11.8212361103
+马庄 12.5143832909
+怕苦怕累 13.900677652
+早早 8.0484751722
+逆映射 13.2075304714
+支委会 11.1926274509
+蔡健雅 13.900677652
+自觉自愿 11.598092559
+收集家 13.2075304714
+图列 13.900677652
+早日 8.22050504296
+一万六千三百户 13.2075304714
+刘裕 9.85762638414
+土房 11.0674643079
+汉礼 12.2912397395
+第二十九条 13.2075304714
+会徽 10.9562386728
+俩发 13.900677652
+五十六线 13.2075304714
+战于江 13.2075304714
+赵世延 11.9547675029
+四面 7.64877376881
+梁师成 10.604840786
+安哈拉 11.8212361103
+使用版 13.2075304714
+福特汽车公司 10.4666904475
+天津桥 13.900677652
+王煜 11.9547675029
+王平引 12.1089181827
+教程 9.77354326693
+汉祚 11.7034530746
+石秀大 13.900677652
+时好时坏 11.0674643079
+通鉴学 13.2075304714
+离别多年 13.900677652
+汉祖 13.2075304714
+医学奖 9.94943393339
+钱佐 12.8020653633
+詹天佑 10.4994802703
+王然 13.2075304714
+饭盒 9.56994431169
+卞赛赛 10.765183436
+有云贵 13.900677652
+别着急 10.1394775363
+谋事在人 11.1926274509
+蒋先生 11.9547675029
+金字招牌 10.9049453784
+一九九五年 13.2075304714
+莱哈尼耶 13.2075304714
+王焕 11.4157710022
+王焘 13.2075304714
+海尔斯 13.2075304714
+痛痒 11.5027823792
+香港中华总商会 13.2075304714
+疯牛病 13.2075304714
+伏罪 11.1926274509
+汉碑 12.1089181827
+何言 10.6818018271
+高速公路 7.45337178943
+里亚诺 12.5143832909
+四集 12.8020653633
+雷达探测 11.3357282945
+好参谋 13.900677652
+千条万条 11.4157710022
+经验论 10.2371160058
+捐弃 11.9547675029
+就业处 12.8020653633
+马赛 9.89334446674
+百分之四 12.5143832909
+查理一世 10.4041700905
+乌连戈 12.8020653633
+卧虎藏龙 12.2912397395
+痛痹 13.2075304714
+马赫 9.33632946051
+化机制 13.900677652
+干燥 7.00095454469
+岳尚方 13.900677652
+碰伤 11.5027823792
+甘草酸 12.5143832909
+嵇阮 12.8020653633
+自家门 12.5143832909
+吕览 13.900677652
+里加斯 13.900677652
+海爱琴 12.8020653633
+糖茶 12.2912397395
+女队员 12.8020653633
+高倍率 12.5143832909
+居心 10.2897597393
+柴进庄 12.5143832909
+光学图像 12.5143832909
+留英 12.8020653633
+竞技队 13.900677652
+毛绒玩具 11.2616203224
+女校长 13.900677652
+反射定律 11.2616203224
+凉风习习 11.7034530746
+抑是 13.2075304714
+马里诺 12.5143832909
+马贤 13.900677652
+科伊 10.8096351986
+白灵羞 13.2075304714
+汤寿潜 10.642581114
+教管 13.900677652
+王炎 13.2075304714
+马嘶人 11.8212361103
+妄图 9.19114745066
+芥菜 10.4994802703
+叶常绿 12.2912397395
+植榆柳 13.2075304714
+公共开支 12.1089181827
+牧猎 12.8020653633
+马贼 11.8212361103
+使用率 10.765183436
+索诺木 12.5143832909
+总署 8.88339781516
+两千种 12.5143832909
+史诗片 12.5143832909
+王火 13.900677652
+卧铺 11.0674643079
+涕泪交流 11.8212361103
+香港上海汇丰银行有限公司 13.900677652
+常冠 13.900677652
+王灿 11.598092559
+西拉雅 12.8020653633
+淡绿 11.0674643079
+王灼 13.2075304714
+内皮层 12.8020653633
+芥茉 13.900677652
+政党 7.28461246684
+信贷员 10.8096351986
+莫舒舒 12.1089181827
+马路 8.58255765813
+鲱鱼 10.6818018271
+公积转 13.900677652
+恨事 11.9547675029
+早操 11.7034530746
+海蚀作用 12.5143832909
+库存商品 13.900677652
+额鲁特 13.2075304714
+比过 11.0103058941
+球门线 11.8212361103
+假善人 13.2075304714
+经济学奖 10.2897597393
+比达 9.82314020807
+淡红 10.0720362555
+怦然 11.8212361103
+一丝两气 13.2075304714
+显着性 12.5143832909
+太阳灯 13.900677652
+四队 10.8561552143
+镶宝石 13.2075304714
+长葛县 13.2075304714
+刘玄德 9.7898037878
+太阳灶 12.8020653633
+提不起来 12.8020653633
+胶溶 13.900677652
+余兴节目 13.900677652
+键角 11.7034530746
+绽出 11.2616203224
+伏羲 9.75754292558
+体外循环 12.1089181827
+楚梅布 12.8020653633
+四阶 12.8020653633
+四阵 13.900677652
+杀了人 10.642581114
+四阿 13.2075304714
+内生 8.4284069783
+车满为患 13.900677652
+膏土 13.900677652
+拿酒 12.2912397395
+马趴 11.5027823792
+马足 11.7034530746
+高通量 12.5143832909
+莱尼亚诺 12.8020653633
+洛杉矶市 10.9049453784
+比较 4.7717642787
+爱爱仰 13.2075304714
+马蹄 8.57280148319
+鼓板 10.9049453784
+韩国公司 12.5143832909
+花骨朵 12.1089181827
+雌雄异株 9.6811699468
+尼一世 11.0674643079
+郑智化 12.8020653633
+烧香拜拜 13.900677652
+混合列车 13.900677652
+玛格丽特 10.6818018271
+涂成 11.4157710022
+血泪史 12.5143832909
+汉简 10.1630080337
+早来 9.56994431169
+召开大会 11.598092559
+受穷 11.1926274509
+殷鉴不远 11.8212361103
+官僚机构 9.75754292558
+发送到 10.7226238216
+四间 10.8096351986
+马蹬 11.7034530746
+窦建德 10.3453295905
+王珍 13.2075304714
+医学家 9.24671730182
+弗纶 13.900677652
+远大路 13.2075304714
+几枝 10.8096351986
+王珙 12.5143832909
+四门 9.0884932966
+现实情况 10.1630080337
+钟点工 11.7034530746
+成穗状 11.8212361103
+周瑞发 12.8020653633
+柳青 13.900677652
+淡紫 11.7034530746
+演讲辞 13.2075304714
+王玲 12.8020653633
+于京兆 12.5143832909
+王玺 12.2912397395
+玉泉区 13.2075304714
+吴头楚尾 13.900677652
+意在笔先 13.900677652
+瓦加杜古 11.8212361103
+质和量 11.2616203224
+女警 12.8020653633
+早朝 9.62401153296
+选线 11.2616203224
+王玄 12.5143832909
+展开攻势 11.7034530746
+王玉 10.2371160058
+孕妇装 10.9049453784
+早有 7.90921310487
+微醉 11.5027823792
+容颜 9.59661255877
+灰飞烟灭 10.1630080337
+干犯 11.8212361103
+靖国 12.5143832909
+不绝如缕 12.2912397395
+派人 7.30216862336
+牛蒡子 13.2075304714
+考试制度 10.9562386728
+空腹吃 13.2075304714
+风正一帆悬 13.900677652
+民命 12.1089181827
+千娇 12.5143832909
+拓朴 13.900677652
+低买高卖 11.9547675029
+四镇 9.49395840471
+未定论 11.9547675029
+梅内克 13.900677652
+拓本 10.4349417492
+干版 12.5143832909
+食用酒精 13.2075304714
+轰得 12.8020653633
+认起 11.7034530746
+二十一个 11.8212361103
+雷华 11.3357282945
+逼真 8.95903522937
+和建阳 13.2075304714
+挎包 9.54396882529
+逐出 8.85082164473
+汽车厂 10.9562386728
+军械库 11.9547675029
+西北郊 10.0720362555
+土性 11.9547675029
+扎染 11.8212361103
+理学院 10.1630080337
+开关站 12.8020653633
+保命丹 13.900677652
+内画 11.5027823792
+居屋 12.1089181827
+政制 9.91169360541
+雷语 11.7034530746
+牧炼 12.8020653633
+频宽 12.2912397395
+王献 11.0103058941
+跑下来 10.8561552143
+四锅 13.900677652
+魏尔斯 10.6818018271
+比较慢 10.2371160058
+教研 11.9547675029
+厨娘 10.8096351986
+欢迎光临 12.5143832909
+艾丁湖 10.6818018271
+颅骨 9.87532596124
+热忱地 12.1089181827
+陕西国力 12.5143832909
+干爽 11.7034530746
+温吞 13.2075304714
+照进来 11.7034530746
+干爹 9.61021821083
+数十所 12.5143832909
+盐务局 11.9547675029
+巴图尔 11.7034530746
+连封信 12.5143832909
+兀然 12.5143832909
+探友 13.900677652
+四锤 13.900677652
+王猛 10.1630080337
+背熟 11.0674643079
+高世宣 10.604840786
+任职 7.60541165054
+扑天盖地 13.900677652
+蓬蓬 11.2616203224
+四锭 12.8020653633
+国务院令 11.7034530746
+唐昭宗 10.6818018271
+安德烈耶维奇 13.2075304714
+世冰川 12.1089181827
+比起 7.80260336981
+政史 13.2075304714
+盐区 10.4666904475
+早晨 7.07521761572
+没交 12.5143832909
+教科 13.2075304714
+钨酸钙 13.2075304714
+胡济 12.5143832909
+巴甫洛达尔 13.900677652
+马车 7.99259471381
+萨特兰 12.8020653633
+商品资金 13.900677652
+早晚 7.56739802384
+比赛 6.83335780332
+政变 7.8093677699
+李思谏 13.2075304714
+吉舍夫 12.5143832909
+政发 12.2912397395
+柳阴 11.2616203224
+四铢 12.8020653633
+贾芹 11.2616203224
+代付 12.2912397395
+供销部门 13.900677652
+蒲绥昌 13.2075304714
+干爷 10.9049453784
+蒂格 12.2912397395
+特级教师 13.2075304714
+奖惩制度 12.1089181827
+严察 13.900677652
+洛佩斯 11.7034530746
+翻页 12.8020653633
+比费 11.8212361103
+富蕴县 11.9547675029
+费唇舌 13.2075304714
+听话者 13.2075304714
+探取 12.8020653633
+东西向 8.96620371885
+州界 11.8212361103
+选美 11.8212361103
+九十多块 13.2075304714
+早春 9.34680076038
+经济学家 6.45994394459
+常规性 11.4157710022
+韩珩 13.900677652
+四钱 11.9547675029
+五七杯 12.1089181827
+初步解决 12.2912397395
+居巢 11.4157710022
+审计法 12.1089181827
+主机厂 13.2075304714
+迸开 13.2075304714
+脯氨酸 12.5143832909
+谢天恩 11.8212361103
+双灵敏 13.2075304714
+豁朗 11.1926274509
+分节歌 12.1089181827
+郎卫 12.1089181827
+财务数据 9.29550746599
+马迁 13.900677652
+新来乍到 11.1280889297
+鼓曲 13.2075304714
+犯病 9.96885201925
+涂掉 12.2912397395
+胡侃 12.2912397395
+马拉开波 11.9547675029
+罪尤 13.900677652
+扎曲 11.4157710022
+直感 12.8020653633
+刘诗 13.2075304714
+铁栅栏 11.0674643079
+教祖 11.7034530746
+维纳斯 10.1630080337
+吞了下去 11.2616203224
+普雷斯帕 13.2075304714
+刘询 12.5143832909
+厨子 10.0088573539
+海尔曼 12.5143832909
+三千匹 12.8020653633
+王牌 9.35738286971
+政协 9.05649056552
+过雪妍 13.900677652
+翻领 11.5027823792
+出了名 9.75754292558
+民商 12.5143832909
+王牛 12.5143832909
+马追 11.8212361103
+一本正经 8.80081122415
+苏兹达 13.2075304714
+续大统 13.2075304714
+白费力气 12.1089181827
+政区 9.41204128224
+竹东镇 13.2075304714
+怪样 12.8020653633
+莱辛 10.4994802703
+捐建 11.5027823792
+选编 10.4041700905
+弗罗 11.8212361103
+王爷 7.77818484246
+热动力 11.3357282945
+王爵 10.3171587135
+丁韪良 12.1089181827
+古墓群 9.77354326693
+罗武英 12.8020653633
+忘事 13.900677652
+马辛 13.900677652
+益州 8.87023973058
+干扰源 12.8020653633
+居嵩 12.5143832909
+泊船 11.5027823792
+也许 5.56308970986
+形象思维 11.1926274509
+蒂森 11.7034530746
+翻飞 10.0505300503
+邻苯二甲酸酐 11.2616203224
+梁萧统 11.9547675029
+明确责任 11.598092559
+刘徽注 12.5143832909
+南嘉错 13.900677652
+融安县 13.900677652
+马驱兵 13.2075304714
+马达 9.77354326693
+荒年 11.0674643079
+马边 10.9049453784
+兰阳西 13.2075304714
+跪得 12.2912397395
+功业 9.5186510173
+八百余亩 13.2075304714
+贸易口岸 12.2912397395
+日书 11.9547675029
+穿透力 9.94943393339
+航至 12.2912397395
+教给 9.63799777493
+马街 13.2075304714
+卡维尔 13.900677652
+总章 11.4157710022
+耐磨材料 12.1089181827
+纪伯伦 12.2912397395
+如歌如诉 13.900677652
+吕安系 13.2075304714
+抓乖卖俏 13.900677652
+早慧 13.2075304714
+师东伐 12.8020653633
+刘豫 10.9562386728
+尘凡 12.2912397395
+专题组 13.900677652
+马衣 13.900677652
+背着 7.35102690974
+马衡 12.1089181827
+街灯 11.1926274509
+捷克斯洛伐克共和国 12.1089181827
+总站 10.604840786
+复合肥 10.6818018271
+马表 13.900677652
+实际证明 13.2075304714
+欢爱 11.5027823792
+太阳升 10.4666904475
+蓬蒙 12.5143832909
+厄运 9.5186510173
+两千米 13.2075304714
+地高辛 12.5143832909
+黄初平 13.900677652
+干爸 11.5027823792
+鉴察 11.8212361103
+丧门星 11.9547675029
+莫可奈何 11.3357282945
+股权证 13.2075304714
+两岁半 13.900677652
+万死不辞 11.1926274509
+日丽 11.5027823792
+罗桑确 13.900677652
+嘎嘎声 13.900677652
+政战部 13.2075304714
+就业局 11.7034530746
+策马扬鞭 13.900677652
+成长史 13.900677652
+日丰 13.2075304714
+调压室 12.8020653633
+宋寨主 10.9562386728
+营业证 12.8020653633
+日下 11.1926274509
+民力 10.3171587135
+镂花 11.1280889297
+理都 11.4157710022
+民办 10.1630080337
+柳同 13.900677652
+日东 13.900677652
+立方根 12.8020653633
+政和 10.3171587135
+反党集团 10.9049453784
+铁石人 12.8020653633
+铁路职工 11.7034530746
+满怀激情 11.1926274509
+州牧 10.4666904475
+土星 9.29550746599
+李思训 11.1926274509
+朱生豪 12.5143832909
+功亏 13.900677652
+水帘洞 9.62401153296
+几柱 13.900677652
+勾去 12.1089181827
+谈诗论 12.5143832909
+小划子 11.4157710022
+牛斗 12.8020653633
+反盗版 11.1926274509
+王畿 10.8561552143
+寸楷 13.900677652
+射流技术 12.8020653633
+马裤 12.5143832909
+上海铁路局 13.2075304714
+王畅 13.2075304714
+诺基亚公司 11.9547675029
+中集集团 9.84023464143
+故地重游 12.2912397395
+膏剂 11.1926274509
+水伯 11.3357282945
+徐州人 13.2075304714
+白娘子 11.598092559
+黯然失色 10.3171587135
+挑拣出 13.900677652
+百分之十 10.6818018271
+文艺兵 12.5143832909
+地热能源 13.900677652
+按语 10.9562386728
+罪孽 9.66657114738
+点缀着 10.3743171274
+青风寨 13.900677652
+王甫 11.8212361103
+格西 11.9547675029
+日产 8.56313957227
+军械士 12.5143832909
+水体 8.4980002701
+王申 12.5143832909
+无颜以对 13.900677652
+擂鼓 8.81308131674
+民利 12.2912397395
+超越阶段 12.8020653633
+臧质 12.1089181827
+千多岁 12.2912397395
+米家沟 13.900677652
+韦后立 13.2075304714
+主视 13.900677652
+天与地 12.1089181827
+美国耶鲁大学 10.0505300503
+神秘色彩 9.6811699468
+郎君 9.80633308975
+体外受精 10.765183436
+宫户世 13.2075304714
+明升暗降 13.2075304714
+功令 13.2075304714
+王生 12.5143832909
+麦乳精 12.8020653633
+一通百通 12.2912397395
+王小鹰 13.2075304714
+独领风骚 10.4666904475
+无边无涯 12.1089181827
+选科 12.5143832909
+水井 9.11318590919
+银行职员 10.9562386728
+水云 10.765183436
+艾迪德 13.900677652
+复合膜 13.2075304714
+惠特克 9.58318953844
+选种 10.8096351986
+居官 10.3743171274
+四端网络 13.900677652
+选秀 10.7226238216
+俭以养廉 13.2075304714
+黄河流域 8.46695564842
+抑扬 11.1926274509
+西北面 10.8096351986
+李师傅 11.0103058941
+尿胞 13.900677652
+军械处 13.900677652
+妄动 10.1630080337
+故智 12.5143832909
+偏轻 12.5143832909
+居室 9.48183704418
+猿啸 12.8020653633
+妄加 11.1926274509
+徐良 13.900677652
+落井下石 10.5684731418
+电熨斗 10.9562386728
+早恋 12.5143832909
+水亭 10.9562386728
+大石桥 9.89334446674
+土枪 11.8212361103
+马西 11.0674643079
+居家 9.21854642485
+涂改 11.4157710022
+章佳氏 13.2075304714
+潘谷墨 13.900677652
+赴法 10.7226238216
+马褂 10.5684731418
+水仙 10.0505300503
+伏符 13.900677652
+赖特曼 12.8020653633
+代书 10.7226238216
+高尚情操 11.7034530746
+总管 7.6604018068
+新闻专科 13.900677652
+刘贞 12.8020653633
+李旦 12.8020653633
+普渡众生 12.1089181827
+琉善 12.2912397395
+甄老爷 12.5143832909
+特别是在 7.8161782389
+巴旦杏 11.598092559
+水份 10.3453295905
+总算 7.35245854921
+巴布亚新几内亚 10.0505300503
+能结 12.1089181827
+抑或 8.94485059437
+王璋 11.598092559
+水价 9.07236391467
+代领 11.3357282945
+胸中 8.85082164473
+首都剧场 12.5143832909
+顺德区 13.900677652
+王璐 12.1089181827
+刘贾 13.2075304714
+平定县 12.2912397395
+驱车 10.0940151622
+较完整 9.05649056552
+于浅海 11.598092559
+伏笔 10.0940151622
+斯维尔 12.2912397395
+王璞 13.900677652
+十二三天 13.2075304714
+水东 9.98865464655
+齿孔 12.5143832909
+比诺 12.5143832909
+偏方 10.0088573539
+刘跃 10.8096351986
+狭小 8.55357012126
+家族式 11.0103058941
+辨证论治 10.0294766411
+压缩比 11.8212361103
+瘦骨嶙嶙 13.900677652
+定兴县 13.2075304714
+中国电子商会 12.5143832909
+代顿 13.2075304714
+水下 7.34959731693
+楚科奇 11.2616203224
+淡竹 12.2912397395
+陆家嘴 8.70772080109
+坦佩雷 12.8020653633
+雪兰莪州 13.2075304714
+台球室 13.900677652
+打麦场 10.6818018271
+侵凌 11.7034530746
+乱序执行 13.900677652
+鼓惑 12.5143832909
+比试 9.84023464143
+韩王 12.8020653633
+寂静地 13.900677652
+选票 9.25628675283
+待客之道 13.900677652
+书呆子气 12.2912397395
+驱遣 12.5143832909
+金甲茅 11.5027823792
+土木 9.45802639549
+王瑛 13.2075304714
+政商 12.8020653633
+思前想后 9.82314020807
+反攻倒算 11.7034530746
+钢丝绳 10.0505300503
+化学降解 13.2075304714
+王琦 12.1089181827
+于本博 13.2075304714
+刘超 11.598092559
+王琳 11.8212361103
+专看 12.8020653633
+复仇记 12.2912397395
+汉籍 10.9562386728
+蹊径 12.1089181827
+瞎胡闹 11.9547675029
+杨二人 11.1926274509
+杨育才 13.900677652
+平代克 12.5143832909
+尊夫人 12.2912397395
+德茨 13.900677652
+多善德 13.900677652
+老师傅 9.98865464655
+西濒波 13.900677652
+硬气 10.9562386728
+腰缠万贯 11.1280889297
+甘珠尔 11.8212361103
+代总理 11.4157710022
+刘建华 13.900677652
+道官 12.1089181827
+苏峻起 12.8020653633
+顺德县 11.8212361103
+驱迫 12.8020653633
+古夷民 13.2075304714
+初步统计 9.91169360541
+水乡 9.71102290995
+正该 10.4666904475
+主沉浮 12.1089181827
+房之宠 12.8020653633
+茴香豆 12.5143832909
+照出来 11.7034530746
+肩并肩 10.533381822
+禹受禅 13.900677652
+需要量 9.58318953844
+王石 10.533381822
+赤道带 10.8561552143
+百分之几 11.0674643079
+彻骨 10.4666904475
+政团 12.1089181827
+四重 11.2616203224
+四里 11.0674643079
+基础油 11.8212361103
+法会 10.0940151622
+广大群众 9.12155415886
+机上安装 12.5143832909
+芥蒂 10.4041700905
+停妻再娶 12.2912397395
+硝酸银 10.642581114
+六百三十三 13.2075304714
+斯波维 13.900677652
+硝酸铵 11.2616203224
+董衡 13.2075304714
+悠远 10.4994802703
+温和 6.80478443088
+切机 13.900677652
+张树声 12.8020653633
+榨油 8.92394390956
+金蘸斧 12.1089181827
+坚毅不屈 13.900677652
+托卡马克 11.9547675029
+思茅市 13.2075304714
+摆列着 11.3357282945
+郭沫若 9.04864738806
+刘国杰 12.8020653633
+明襄王 13.2075304714
+华氏温标 12.1089181827
+广东省政府 11.598092559
+陈丽娜 13.2075304714
+硝酸钙 13.2075304714
+战可擒 13.2075304714
+人无千日 12.8020653633
+公交车站 11.1926274509
+大大增加 8.65893063692
+鲁难未已 13.2075304714
+都亭侯 12.5143832909
+吴摩西 8.67493097826
+铁精矿 11.9547675029
+耳闻目睹 11.2616203224
+居士 9.29550746599
+化学分子 12.5143832909
+柴油 8.47133202302
+法体 12.8020653633
+硝酸钡 12.8020653633
+硝酸钾 12.1089181827
+花叶病毒 12.2912397395
+惠明寺 11.598092559
+光大 7.46934657004
+岑建功 13.2075304714
+陈妈妈 11.1926274509
+考察干部 11.9547675029
+扭成 11.2616203224
+包扎着 12.2912397395
+进影院 13.900677652
+抢救无效 10.1394775363
+杂和菜 13.900677652
+共济会 11.7034530746
+中青 12.2912397395
+马径 13.2075304714
+寸步 11.3357282945
+百分之八 12.5143832909
+百分之六 11.7034530746
+警政署 13.900677652
+红原县 12.8020653633
+雷达 7.05055148583
+被俘 7.73947033028
+王睿 13.2075304714
+线性组织 13.900677652
+正而八经 12.8020653633
+怎样 5.90301452496
+隋开永济 13.2075304714
+代魏 11.8212361103
+确定无疑 10.9562386728
+经验谈 12.5143832909
+加图 11.8212361103
+墙根儿 12.1089181827
+雅虎网站 13.2075304714
+鹦鹉学语 13.900677652
+美茵河 13.2075304714
+触犯刑律 11.7034530746
+萘胺 11.7034530746
+故意伤害罪 11.2616203224
+黑胡桃 13.2075304714
+硅藻门 11.4157710022
+平平的 10.5684731418
+素白 10.9049453784
+雷辛 13.900677652
+背痛 12.2912397395
+阈值电压 13.900677652
+一蹴而就 9.44633035572
+火头军 11.5027823792
+汉网 13.900677652
+拒用 12.2912397395
+雷迪 11.8212361103
+安泽县 12.8020653633
+不见棺材不掉泪 11.9547675029
+黄册库 12.5143832909
+董贤自 13.2075304714
+伊格纳 12.5143832909
+良工巧匠 13.900677652
+老套路 12.8020653633
+北京师范大学 9.84023464143
+率谷 13.2075304714
+发言盈庭 13.900677652
+再侵染 13.900677652
+柳德米拉 12.2912397395
+代为 9.07236391467
+逃来逃去 13.900677652
+无耻下流 13.2075304714
+加强营 12.8020653633
+厨师 9.11318590919
+地灵星 13.2075304714
+天津港 10.1394775363
+鼓掌 9.30555780184
+王真 13.900677652
+承包责任制 12.1089181827
+汽车城 10.7226238216
+比西 12.5143832909
+动画师 13.2075304714
+总称 7.61096208107
+任金陵 12.1089181827
+居妇 13.2075304714
+刘宝 10.9562386728
+涂有 10.2897597393
+年老力衰 12.2912397395
+大窑湾 13.900677652
+奋然 10.765183436
+怀仁可汗 12.5143832909
+四郊 10.3743171274
+王相 11.5027823792
+沙隆达 12.5143832909
+坐标纸 13.900677652
+铁线莲 12.1089181827
+占官田 13.2075304714
+扎手 11.3357282945
+土方 9.91169360541
+汉纳 12.2912397395
+牧畜 11.1926274509
+成衣店 12.5143832909
+美好 7.63727938938
+芥兰 13.900677652
+鼓手 10.765183436
+脚底抹油 12.2912397395
+土断 11.598092559
+汉纪 11.2616203224
+蓝衣 11.9547675029
+闾伐越 12.8020653633
+轻型化 12.2912397395
+猿臂 11.7034530746
+蓝衫 11.4157710022
+砸门 11.7034530746
+李顺答 12.8020653633
+隐形飞机 11.4157710022
+净土宗 10.4041700905
+髋部 12.8020653633
+微波遥感 12.2912397395
+谷正想 12.8020653633
+土族 10.533381822
+店儿 13.900677652
+胡涂 11.1926274509
+否认 7.53764954844
+频带 10.604840786
+瓣膜病 11.4157710022
+低烧 11.7034530746
+背理 13.2075304714
+驱走 11.1280889297
+寂寂无闻 13.2075304714
+王皇 13.2075304714
+天津警备区 13.2075304714
+驱赶 9.04086524761
+四邻 10.3453295905
+解韩胤 13.2075304714
+法乐 13.900677652
+爱女心切 13.900677652
+张总管 13.900677652
+法义 12.8020653633
+一不做 10.2371160058
+石道尽 13.900677652
+饭煲 13.900677652
+扎成 10.1871055853
+文艺领域 12.5143832909
+四道 9.93038573842
+间作 10.4041700905
+海湾大桥 12.8020653633
+中非政府 12.5143832909
+法人 7.94743431769
+居处 10.642581114
+恩深义重 13.2075304714
+间体 12.8020653633
+郎坦 13.900677652
+尚校 11.7034530746
+包膜抗原 13.2075304714
+间位 11.8212361103
+风里来 12.8020653633
+居多 7.96314144689
+王登 12.2912397395
+姜舜源 13.2075304714
+逞威风 12.8020653633
+哈德成 12.8020653633
+扎拉 11.5027823792
+狭带 12.8020653633
+伏秋 12.2912397395
+早拜 13.900677652
+土改 9.40086798165
+民党 11.4157710022
+平放鱼 13.900677652
+五位一体 11.9547675029
+砸锅 11.598092559
+不安宁 11.2616203224
+胶棒 13.900677652
+以古非今 13.2075304714
+法事 10.533381822
+马诺 13.2075304714
+防民之口 12.5143832909
+刘辉 13.2075304714
+模糊起来 10.9562386728
+科克伦 13.900677652
+吕丽萍 13.900677652
+四通 12.2912397395
+居奇 12.1089181827
+总社 9.72629038208
+间伐 12.2912397395
+苏丹政府 12.2912397395
+汽车团 13.900677652
+彻夜未眠 12.1089181827
+涂某 12.2912397395
+富勒烯 12.8020653633
+未成熟 10.2630914922
+涂染 13.2075304714
+法令 7.56562340048
+偷换 11.2616203224
+想唱 12.8020653633
+早报 7.61841090508
+额菲尔士 13.900677652
+房展会 10.6818018271
+美女 8.12923652885
+攻城掠地 12.5143832909
+伤残 9.59661255877
+素衣 11.5027823792
+黑胡椒 12.8020653633
+干眼 12.8020653633
+拓扑 9.56994431169
+交通安全 10.1871055853
+健康活泼 12.5143832909
+愚者千虑 13.900677652
+刘达 13.900677652
+救过 10.7226238216
+硝酸锶 13.2075304714
+骄人成绩 11.8212361103
+家福爹 11.1280889297
+胶条 13.2075304714
+佛吉尼亚 13.900677652
+谱出 13.900677652
+多义字 13.2075304714
+民建 11.7034530746
+匙吻鲟 12.5143832909
+一棵树 9.30555780184
+尿路 10.7226238216
+鼓浪 11.598092559
+扬子晚报 9.82314020807
+六下 12.8020653633
+总目 9.91169360541
+刘聪 11.0103058941
+秩序性 13.2075304714
+总监 7.29132840881
+王秀 12.2912397395
+竭忠尽智 13.900677652
+史丹利 11.8212361103
+王秋 8.7245279194
+指挥大师 12.8020653633
+王秉 13.900677652
+收下 8.73019365694
+师张宇 13.900677652
+便学 13.2075304714
+总任务 10.8096351986
+突发状况 13.2075304714
+能率 12.8020653633
+那群狗 13.2075304714
+气嘟嘟 13.900677652
+背筐 12.2912397395
+三四尊 13.2075304714
+翁多河 13.900677652
+乐从 12.5143832909
+才貌双绝 13.900677652
+胶束 12.5143832909
+银联卡 11.1280889297
+刑兹 13.2075304714
+胶木 11.8212361103
+阿波罗 9.40086798165
+顺德市 12.8020653633
+审判制度 11.9547675029
+能安眠 13.2075304714
+米一升 12.5143832909
+收买 8.68574189437
+受到冲击 9.71102290995
+诸方面 9.66657114738
+实力比 13.2075304714
+一派胡言 11.2616203224
+干碍 12.5143832909
+王禹 10.7226238216
+民庭 13.900677652
+乐亭 10.8561552143
+第比利斯 11.4157710022
+龙芽草 12.5143832909
+文信国 13.900677652
+马营 11.4157710022
+王禅 12.1089181827
+向碧初 12.8020653633
+王福 12.5143832909
+武警北京总队 13.900677652
+马萨 11.9547675029
+闺范 12.1089181827
+回转窑 13.900677652
+遇害者 11.8212361103
+绿头鸭 11.3357282945
+牧稀 10.8561552143
+乐事 10.4349417492
+妄念 12.1089181827
+乐于 8.74738605748
+毛边 11.5027823792
+罔顾 12.1089181827
+仁皇后 13.2075304714
+更适宜 11.0674643079
+王祥 11.9547675029
+赤裸裸 9.34680076038
+卡箍 12.5143832909
+频出 9.61021821083
+王祯 11.4157710022
+九十多岁 13.2075304714
+阿波美 12.5143832909
+逼紧 12.5143832909
+牧童 10.2117981979
+汪太太 13.2075304714
+刘胜 10.765183436
+狐火 13.900677652
+收人 11.5027823792
+马蓝 12.5143832909
+抗热性 13.2075304714
+反潜巡逻机 10.9562386728
+体育赛事 12.1089181827
+乐乐 11.1926274509
+宋守 12.1089181827
+雍布拉 12.8020653633
+专题片 12.1089181827
+菩萨低眉 13.900677652
+糖色 12.8020653633
+绿色通道 10.1630080337
+背篓 11.8212361103
+狮子大张口 12.8020653633
+外交部驻香港特派员公署 13.900677652
+虚虚实实 11.1280889297
+四两多 13.2075304714
+帕木竹 12.5143832909
+张可 13.900677652
+须得依 13.900677652
+马蒂 11.0674643079
+黄门郎 12.2912397395
+格朗日 13.900677652
+拓跋焘 10.1871055853
+日常事务 10.2371160058
+托色尼 10.9562386728
+鼓涨 12.2912397395
+收件 12.8020653633
+张鼎丞 12.1089181827
+够得着 12.8020653633
+幡儿 12.8020653633
+马蒙 12.5143832909
+冯保正 11.9547675029
+北京体育学院 12.5143832909
+连战连捷 13.2075304714
+乐业 10.9562386728
+贵池市 12.5143832909
+逸出功 12.8020653633
+代销 8.55834340001
+乐东 12.2912397395
+传动装置 8.79473217808
+阳虚治 13.900677652
+使用税 9.5186510173
+加州大学洛杉矶分校 12.2912397395
+特诺奇 11.3357282945
+收付 10.3743171274
+充电电流 12.1089181827
+太阳神 9.72629038208
+银质奖章 12.1089181827
+油气流 12.5143832909
+男性病 12.5143832909
+城乡建设 10.4349417492
+流氓集团 12.5143832909
+糅合 10.4349417492
+兀立 10.4994802703
+卧鱼 13.2075304714
+原国芳 13.2075304714
+维西县 13.2075304714
+牵过 11.3357282945
+大盘走势 8.80081122415
+合口 11.4157710022
+犯罪 7.20364340431
+工商行政管理局 10.2371160058
+怪招 12.5143832909
+时报社 13.900677652
+王磊 10.604840786
+政委 7.2439511278
+收伏 10.6818018271
+民心 8.62256299275
+王磐 13.2075304714
+格蒂 12.5143832909
+长板凳 12.2912397395
+嫖娼者 13.900677652
+频偏 13.900677652
+加进来 12.2912397395
+金本杜 13.2075304714
+兀突 11.2616203224
+拍卖法 13.900677652
+民德 12.1089181827
+卢二人 13.900677652
+梅巧玲 13.2075304714
+扶余县 11.7034530746
+干禄 12.2912397395
+一个万里 13.2075304714
+两万二 13.900677652
+石黄涂 13.2075304714
+一百六十万元 13.2075304714
+变质岩 8.53938548627
+靖州 12.5143832909
+杜尔迦 12.5143832909
+倚山傍水 13.900677652
+压缩机 9.80633308975
+罪囚 12.1089181827
+十一章 12.2912397395
+国内长途 11.9547675029
+牧笛 12.2912397395
+鼓气 11.598092559
+半瓶醋 12.8020653633
+一吐为快 11.4157710022
+择吉开张 13.900677652
+家族史 10.1630080337
+于山溪 11.8212361103
+伏案写作 13.900677652
+那柄长 13.2075304714
+马蔺 11.598092559
+浓黑 10.4666904475
+袁潜斋 12.8020653633
+选留 12.5143832909
+新沂河 10.7226238216
+蓝翡翠 13.900677652
+文化城 11.9547675029
+厨具 12.2912397395
+总督 6.7721817063
+刘玉民 13.900677652
+家族化 12.2912397395
+人头税 10.642581114
+葛振峰 13.900677652
+刘七爷 12.8020653633
+被子植物 9.22784881751
+杨行密 10.765183436
+刘七爹 9.25628675283
+酷酷 13.2075304714
+格萨 10.6818018271
+电刺激器 13.900677652
+穷期 12.5143832909
+下厨房 11.7034530746
+雷霆万钧 11.3357282945
+实习期 12.1089181827
+调压器 12.8020653633
+旅客 8.08059472162
+怪才 10.4666904475
+折堕 13.900677652
+怪手 11.5027823792
+图册 10.9562386728
+早泄 9.80633308975
+收信 11.2616203224
+满洲问题 13.900677652
+泥菩萨过江 13.900677652
+利滚利 12.1089181827
+悬望 11.5027823792
+居址 11.4157710022
+扎姆 13.900677652
+暖火 13.900677652
+赴美国 9.07236391467
+上百年 10.533381822
+宁海镇 13.2075304714
+三十万斤 12.8020653633
+陶诗言 12.8020653633
+频催 13.2075304714
+战斗行动 10.1871055853
+秦池 13.2075304714
+含蜡 12.1089181827
+简作兴 13.2075304714
+靖嵩 13.900677652
+南屏山 11.8212361103
+张震 11.7034530746
+艳阳 11.598092559
+危险期 11.598092559
+吞噬细胞 11.2616203224
+卓玛背 12.8020653633
+夸下海口 11.7034530746
+科亚 13.900677652
+航迹 10.8096351986
+皮肤性病 13.2075304714
+含蓄 8.93783302172
+马虎 9.44633035572
+三十五万 12.1089181827
+雷茨 13.900677652
+汉玉 11.9547675029
+汉王 9.72629038208
+高智商 11.1926274509
+早潮 12.5143832909
+超前意识 13.2075304714
+历史数据 9.20932976975
+梅内姆 11.8212361103
+痛经 9.89334446674
+三十五个 12.1089181827
+聚礼 11.4157710022
+饮鸠止渴 13.2075304714
+光绪皇帝 10.3743171274
+牛街 11.3357282945
+封信里 11.8212361103
+外县 10.765183436
+爽然若失 13.2075304714
+俯卧撑 12.2912397395
+大石板 11.1280889297
+刘艺 13.900677652
+碱业 13.2075304714
+负债者 12.8020653633
+肠毒素 11.7034530746
+靖康 9.89334446674
+侍师父 13.900677652
+玛琪 13.900677652
+朝朝暮暮 11.8212361103
+基础训练 11.0674643079
+冰消云散 13.2075304714
+一推 9.35738286971
+臧获 12.5143832909
+爱不忍释 13.900677652
+羟脯氨酸 12.2912397395
+刘彻初 13.900677652
+玛瑙 8.62256299275
+干扰机 11.0674643079
+描红 12.8020653633
+众人皆知 11.8212361103
+土棍 13.900677652
+承欢能 13.2075304714
+扒鸡 11.598092559
+刘舜 12.5143832909
+福佑 11.9547675029
+本团 11.598092559
+维多利亚海湾 13.2075304714
+安眠药 10.2371160058
+斯多葛派 11.4157710022
+一个几亿 13.900677652
+狭口 12.1089181827
+日本公明党 13.2075304714
+恶语相向 13.900677652
+无庸置疑 13.2075304714
+河宣省 13.2075304714
+运输网络 11.9547675029
+奥斯卡奖 10.6818018271
+张宇清 13.900677652
+北京电影学院摄影系 12.8020653633
+仗势 10.765183436
+德高 12.5143832909
+行检 13.900677652
+悠荡 12.5143832909
+就业办 13.2075304714
+地道 8.31342899358
+赚大钱 9.89334446674
+南斯拉夫 8.51160592216
+崇拜偶像 12.2912397395
+慕士山 12.8020653633
+马格努斯 13.2075304714
+世界知识出版社 13.900677652
+噬菌体 10.3171587135
+双响炮 12.8020653633
+饭粒 11.9547675029
+惠特曼 10.6818018271
+射穿 11.2616203224
+深耕易耨 13.2075304714
+频发 9.55687223012
+已婚 9.74179456862
+灌进来 11.7034530746
+周大人 11.5027823792
+沈西苓 13.2075304714
+挫辱 12.1089181827
+蓝藻 9.85762638414
+失业者 10.4994802703
+西北风 9.17328983326
+民居 9.7898037878
+受气包 13.900677652
+承露盘 12.5143832909
+斯波特 12.5143832909
+刘英 12.5143832909
+维纳河 13.2075304714
+拘挛 12.2912397395
+皮希科 13.900677652
+塑胶工业 13.900677652
+离狱 13.900677652
+冯子材 11.3357282945
+搞不到 11.8212361103
+许昱华 13.900677652
+巴基耶 12.1089181827
+坏疽 11.0674643079
+坦诚以待 13.900677652
+通过观察 10.4666904475
+本图 13.900677652
+闯江湖 12.5143832909
+强硬手段 12.5143832909
+一个几万 12.1089181827
+阴化寒 13.900677652
+背离 8.74738605748
+王笃 13.2075304714
+本国 7.18650712207
+阿济格 9.87532596124
+比蒙 12.8020653633
+尉梁怀 13.2075304714
+聚神 12.5143832909
+卧龙 8.9102450652
+豹皮帽 13.2075304714
+王笑 12.5143832909
+总理 6.53866710072
+克斯弗 13.900677652
+刘芳 8.56313957227
+土桥 12.5143832909
+伊拉克阿拉伯复兴社会党 13.2075304714
+广梅汕 11.8212361103
+马蝇 13.2075304714
+澧水 10.1164880181
+赤道区 12.8020653633
+对不起 7.59257921047
+刘荆 12.5143832909
+照相仪 12.2912397395
+怪想 13.2075304714
+牧袁绍 13.2075304714
+翻造 12.8020653633
+民工 9.18217878068
+雷舰 12.1089181827
+先入为主 10.3743171274
+蒙唐王 12.8020653633
+片面强调 11.0103058941
+旅外 11.7034530746
+赠款 11.0103058941
+二千八百六十五万余两 13.2075304714
+容重 12.1089181827
+程序编制 12.8020653633
+王立 10.4994802703
+牧神 11.7034530746
+旅大 10.642581114
+大当家 13.900677652
+言简意赅 10.4994802703
+桓嘉 13.900677652
+吴调侯 13.2075304714
+夏宗神 12.2912397395
+格鲁门 10.9562386728
+方掬芬 13.2075304714
+伦港 13.900677652
+布兰塔斯 13.2075304714
+斯维利 12.5143832909
+马蜂 10.9562386728
+追过来 11.9547675029
+洞察一切 12.2912397395
+刘茂 13.900677652
+刘范 13.2075304714
+股行情 8.94485059437
+越窑 10.9049453784
+交通运输业 9.54396882529
+万古愁 12.8020653633
+难为人 12.8020653633
+政客 9.38981814546
+政审 11.3357282945
+留日学生 10.6818018271
+雷艇 11.8212361103
+从百宝 12.8020653633
+空闲地 13.2075304714
+玛旁雍错 11.0674643079
+阿思哈 13.900677652
+赃车 13.900677652
+郭老板 12.8020653633
+尼光佛 12.2912397395
+伏生 11.8212361103
+政治体制 9.77354326693
+刘峙 11.3357282945
+干管 13.2075304714
+亚穆纳河 11.9547675029
+环保主义者 13.900677652
+批量生产 9.06439574502
+茂林修竹 11.8212361103
+力学性能 9.75754292558
+广东省政协 12.2912397395
+梅内塞 12.1089181827
+蓝蓝 13.2075304714
+掏摸 12.1089181827
+搬上 10.533381822
+搬下 13.2075304714
+恩哈德 13.900677652
+人道报 11.598092559
+鼓满 13.2075304714
+酮体 12.2912397395
+陆家堰 11.0103058941
+郭祥推 12.5143832909
+簧片 11.4157710022
+米尔扎 12.2912397395
+李师师 9.20932976975
+代际 10.6818018271
+致病性 11.0674643079
+罪名 8.03704647638
+百弊丛生 13.900677652
+取样器 13.900677652
+李士美 13.900677652
+含蕴 12.8020653633
+丛飘蓬 13.2075304714
+宿雨餐风 13.900677652
+季耶夫 13.900677652
+金维他 13.900677652
+孙恩 11.7034530746
+刘莉 11.7034530746
+干笑 10.2897597393
+内眼角 12.1089181827
+手办 13.900677652
+怎敢 8.64840422393
+马融 11.4157710022
+石油危机 10.4666904475
+赵滦浅 12.5143832909
+太阳穴 9.72629038208
+夏国之 13.2075304714
+欲喷 13.900677652
+宝黛 13.2075304714
+王广福 12.5143832909
+王稽 13.900677652
+汉特 11.0674643079
+维西克 12.2912397395
+南方证券 12.1089181827
+重大损失 9.35738286971
+总甙 13.900677652
+国有资产管理局 12.8020653633
+豆浆机 11.8212361103
+摇臂钻 13.900677652
+挪用公款 10.1871055853
+克里斯托弗 11.2616203224
+表示满意 10.8561552143
+拉巴特 10.9562386728
+卡霍夫卡 13.900677652
+吕思诚 13.2075304714
+万花筒 11.3357282945
+章宗祥 11.1280889297
+鼓楼 9.37888907493
+比色 12.1089181827
+马士 12.8020653633
+居功 11.3357282945
+抑止 10.4994802703
+钳蝎 13.2075304714
+伏特 10.9562386728
+实验员 12.8020653633
+含苞 12.1089181827
+关厘卡 12.5143832909
+刘峻 12.5143832909
+熊皮 11.8212361103
+师南征 12.1089181827
+过街老鼠 12.1089181827
+小邦成 10.4666904475
+伏牛 9.65218240993
+筐子 10.2897597393
+雷将舒 13.900677652
+代金 12.2912397395
+拉闲散闷 13.900677652
+经济封锁 10.8561552143
+耿延禧 12.5143832909
+寻章摘句 12.2912397395
+格致 11.4157710022
+马者 12.1089181827
+停机位 13.2075304714
+刘萍 13.900677652
+户籍管理 11.0674643079
+出血性 10.4994802703
+压缩成 11.8212361103
+教皇 8.57280148319
+能知 10.8561552143
+撑竿跳 12.8020653633
+司行方 12.5143832909
+青春文学 13.2075304714
+雷蕾 12.8020653633
+长江中下游地区 10.4666904475
+干粉 12.2912397395
+李伟心 13.900677652
+选点 12.1089181827
+涂污 12.8020653633
+磨砂灯泡 13.900677652
+牛杂 12.5143832909
+吵嘴 10.8096351986
+袄裤 13.2075304714
+新民主主义论 11.7034530746
+一朵花 10.1394775363
+伤怀 11.1926274509
+刘营 12.5143832909
+含芳 13.900677652
+托多洛夫 13.2075304714
+支支吾吾 10.0940151622
+马耳 12.2912397395
+操作 5.50882095187
+干粮 8.75901409547
+紫水晶 11.598092559
+疾病基因 13.2075304714
+小舅子 10.4349417492
+凸透 13.900677652
+电四极矩 11.7034530746
+蓄长发 13.2075304714
+怪杰 11.9547675029
+优秀儿女 13.900677652
+中立国家 13.2075304714
+响应函数 13.900677652
+塞伊 12.8020653633
+拨冗 13.900677652
+飞驶 11.5027823792
+郗虑 12.2912397395
+密支那 10.9562386728
+蓝菌 11.598092559
+旅店 9.74179456862
+驱蚊 11.7034530746
+膝阳关 13.2075304714
+李时珍 10.2630914922
+解放军信息工程大学 11.8212361103
+粤汉铁路 10.4041700905
+鲷鱼 11.2616203224
+保皇狗 11.3357282945
+发球区 12.2912397395
+伤情 9.61021821083
+美国国会众议院 12.2912397395
+海皇 13.2075304714
+民船 11.0103058941
+于祁山 11.7034530746
+碱面 12.2912397395
+阿西河 13.2075304714
+鼓槌 10.533381822
+触目皆是 13.900677652
+容限 13.2075304714
+嘴啃泥 12.1089181827
+涂油 11.9547675029
+政局 8.34771806705
+总爱 10.4666904475
+王素 10.1394775363
+不打不成相识 13.900677652
+蓝莓 11.9547675029
+泛太平洋 12.2912397395
+白面馒头 11.9547675029
+王累 12.8020653633
+伤患 12.8020653633
+马肉 10.9049453784
+硬派 11.5027823792
+伤悼 11.7034530746
+州立 10.7226238216
+塔什库尔干 10.6818018271
+层云 11.5027823792
+塞住 10.2630914922
+恶语相加 12.8020653633
+普及读物 12.1089181827
+私愤 12.5143832909
+涂泥 12.8020653633
+吸金 10.1871055853
+背诵课文 12.2912397395
+第二十九次 13.900677652
+两键 13.900677652
+脱硫剂 12.5143832909
+吵嚷 9.71102290995
+沿阶草 13.2075304714
+骄阳似火 11.7034530746
+成因 7.97909923233
+西北麓 11.2616203224
+沈西蒙 12.8020653633
+孙继海 13.900677652
+嘲讽地 10.9562386728
+歌坛上 13.900677652
+白云岭 10.765183436
+涂泽 13.900677652
+乌查利 13.900677652
+宗翰 13.2075304714
+林冲娘子 12.2912397395
+愚直 12.8020653633
+九十多处 13.2075304714
+路德维希港 13.2075304714
+代郡 10.4349417492
+髋骨 12.1089181827
+犯罪分子 9.5186510173
+浪漫史 13.2075304714
+固原地区 11.5027823792
+王系 13.2075304714
+于京师 10.765183436
+政工 10.6818018271
+汉璇 11.3357282945
+民航 8.33999602096
+县衙 9.87532596124
+蓝色 7.58170953823
+坐赃 13.2075304714
+阿富汗人 10.9049453784
+翻修 10.0294766411
+中西亚 13.2075304714
+蒙先皇帝 12.8020653633
+全国人大外事委员会 13.2075304714
+尼尼微 11.0674643079
+翻阅 9.16447920358
+飞骑 10.0940151622
+文清 13.2075304714
+心血管 8.67493097826
+容某先 13.2075304714
+气昂昂 10.1871055853
+马腹 11.1280889297
+小少爷 10.8096351986
+民害 13.2075304714
+一十二个 12.8020653633
+官为民 12.5143832909
+民家 11.7034530746
+没份 12.5143832909
+班加西 11.3357282945
+东川路 12.5143832909
+于学宫 13.2075304714
+三十五部 12.2912397395
+扎根 9.66657114738
+毒魔 12.1089181827
+大连商品交易所 10.0720362555
+高教部 13.2075304714
+蓝舌 13.900677652
+这么久 9.34680076038
+马脚 10.2371160058
+太阳系 8.56313957227
+哈德森 13.2075304714
+汽车展 11.9547675029
+伤愈 11.0103058941
+秦喜 10.1871055853
+乓乓 11.2616203224
+布尔吉巴 12.5143832909
+财经委 9.89334446674
+高原沼泽 12.8020653633
+命名权 12.5143832909
+平恒星 13.2075304714
+刘玄北 12.8020653633
+伤感 8.37522471284
+民宅 10.4666904475
+银汉鱼 12.8020653633
+签到处 13.900677652
+民安 10.6818018271
+马脸 11.5027823792
+于学官 11.3357282945
+峨嵋山 12.2912397395
+单峰函数 13.900677652
+农林牧渔业 11.9547675029
+涂涂 13.2075304714
+教着 12.8020653633
+斯特里特 13.900677652
+雷西昂 13.900677652
+塞上 10.0940151622
+阮公欢 13.2075304714
+马斯卡尼 13.2075304714
+古风 10.1164880181
+老粗 12.1089181827
+苯二酚 12.8020653633
+弯弯绕 12.2912397395
+雷蒂 12.1089181827
+计算机屏幕 13.2075304714
+鼓棒 12.8020653633
+雷济 13.900677652
+罪刑 11.7034530746
+释迦牟尼 9.40086798165
+航行 7.53764954844
+束手待毙 10.8561552143
+新疆自治区 11.8212361103
+八仙花 12.8020653633
+客户档案 12.5143832909
+选煤 11.598092559
+雷蒙 11.8212361103
+尿血 10.9562386728
+背约 11.1926274509
+冲倒 10.9049453784
+平型关 10.8096351986
+鲍格米 13.2075304714
+美索不达米亚 8.9102450652
+文件传输 13.2075304714
+刘薇 13.900677652
+克里斯托夫 12.1089181827
+六六六 11.3357282945
+牧群 12.5143832909
+怪念头 12.5143832909
+李素文 13.900677652
+跑买卖 12.1089181827
+好感度 13.900677652
+一片苦心 11.3357282945
+脑充血 13.900677652
+软体动物 8.82550383674
+蓝花 10.9562386728
+三千六 13.2075304714
+干胶 11.9547675029
+任亚夫 13.2075304714
+争长论短 13.900677652
+高二上 13.900677652
+梅卡瓦 11.4157710022
+万国邮政联盟 11.7034530746
+巴尔瑙尔 13.900677652
+塔院寺 12.2912397395
+惭色 13.900677652
+日德兰半岛 11.5027823792
+克里琴 13.900677652
+牧羊 9.61021821083
+徐总爷 12.8020653633
+土沟 11.9547675029
+民声 11.1926274509
+早死 10.0088573539
+刘虎 11.9547675029
+王翦 10.9049453784
+慢性期 11.598092559
+格莱 11.3357282945
+第二行 12.1089181827
+王翳 12.8020653633
+王翰 12.5143832909
+刘虞 12.5143832909
+望尊者 13.2075304714
+干练 9.38981814546
+慈禧火 13.2075304714
+晋文公 10.3171587135
+碧油油 13.900677652
+王翼 12.5143832909
+水绘园 13.2075304714
+噼里啪啦 10.4994802703
+靠山边 13.900677652
+马良 10.3453295905
+管教所 11.8212361103
+奉天承运 11.1280889297
+国家航空航天局 13.2075304714
+眼冒金星 10.9049453784
+王翔 13.2075304714
+廉洁奉公 11.1926274509
+劝出去 13.900677652
+四首 11.1926274509
+王群 10.4349417492
+旅居 9.62401153296
+须眉男子 13.2075304714
+土法 11.4157710022
+玄德曰 8.70772080109
+李百药 12.1089181827
+一丁点儿 10.8561552143
+小脚印 13.900677652
+淡然 9.58318953844
+重大胜利 10.1871055853
+剩水残山 13.900677652
+公方代表 12.5143832909
+歌舞伎 10.9562386728
+复仇者 10.9562386728
+干纳 13.900677652
+吵吵 10.604840786
+干线 7.71859274526
+维沙卡 11.7034530746
+干纺 13.900677652
+被拍者 13.900677652
+松不松 12.5143832909
+奥庞波 13.900677652
+绰约 11.1926274509
+唯心主义 8.42421410004
+干红 11.5027823792
+怀麓堂 13.2075304714
+古来有之 13.900677652
+压缩性 11.0674643079
+梧桐树 10.0294766411
+新郎官 12.1089181827
+泡蘑菇 13.900677652
+万超尘 12.5143832909
+子宫腔 10.9562386728
+计在民 13.2075304714
+马苏 12.2912397395
+土气 10.533381822
+纯属骗局 13.900677652
+安德烈斯 12.5143832909
+区寒武 13.2075304714
+饭碗 8.76487921493
+酿酒业 12.2912397395
+好地解决 10.3453295905
+郎平 11.598092559
+能用 8.80081122415
+格茨 13.2075304714
+投食 12.5143832909
+可调式 12.2912397395
+文艺学 10.9562386728
+蒂斯 11.1280889297
+处暑 11.9547675029
+频域 11.5027823792
+丝带 10.8096351986
+神采飞扬 10.2117981979
+宇文邕平 13.2075304714
+王罕 13.900677652
+马英 13.900677652
+发热管 13.2075304714
+泊车 11.0103058941
+迪迪埃 12.5143832909
+兴安省 13.900677652
+慎重从事 12.8020653633
+噩兆 13.900677652
+穿凿附会 12.2912397395
+四餐 13.2075304714
+这阵儿 10.9049453784
+喜孜孜 10.8561552143
+米尔本 12.2912397395
+危险性 9.19114745066
+郗萌 13.2075304714
+六公里 12.5143832909
+教理 10.5684731418
+居停 12.5143832909
+雷射 10.533381822
+孙又生 13.900677652
+比肩 10.4349417492
+机顶盒 11.0103058941
+拭目以待 9.56994431169
+万神庙 12.1089181827
+大肚溪 11.5027823792
+涂满 11.0674643079
+馄饨 9.98865464655
+艳丽夺目 13.2075304714
+班务会 12.8020653633
+能留 13.2075304714
+津津有味 9.63799777493
+埃菲尔铁塔 12.5143832909
+高平镇 12.8020653633
+谈谈情 12.1089181827
+数字信息 11.4157710022
+叽叽嘎嘎 12.1089181827
+匣子 8.64840422393
+土池 12.8020653633
+从现在起 9.80633308975
+涂漆 11.0674643079
+丑八怪 12.5143832909
+卡瑟琳 13.900677652
+傅二氏 13.2075304714
+靖宇 11.4157710022
+投饵 12.2912397395
+靖安 11.9547675029
+王绩 11.598092559
+淡灰 11.9547675029
+蒋延 13.900677652
+王绶 12.2912397395
+王维 9.7898037878
+叶盛兰 11.9547675029
+张维邦 12.1089181827
+须虾纲 12.8020653633
+乔贵妃 11.8212361103
+和和美美 13.2075304714
+吴兄 13.2075304714
+免费片 13.900677652
+殊不知 9.41204128224
+王绂 12.2912397395
+阿散蒂 11.5027823792
+民委 12.5143832909
+活性氧 12.2912397395
+英文名称 9.77354326693
+司正堂 13.900677652
+代总统 11.7034530746
+郎心 12.5143832909
+苏维埃政府 10.2117981979
+王绎 13.2075304714
+王绍 12.8020653633
+教学管理 12.8020653633
+伤损 10.533381822
+吴汝康 13.2075304714
+王统 11.9547675029
+燕昭王 10.765183436
+淮海 9.98865464655
+刃锋 13.900677652
+王红 10.0940151622
+小时候 8.12612610643
+四颗 10.765183436
+任本兵 11.9547675029
+油酥 12.5143832909
+恤孤 12.8020653633
+不识好歹 11.4157710022
+鹦鹉学舌 11.8212361103
+长岛县 11.8212361103
+王纬 13.900677652
+王纲 13.2075304714
+国民警卫 13.900677652
+王纶 12.8020653633
+头童齿豁 13.900677652
+赖平原 13.900677652
+么妹儿 12.8020653633
+兴安盟 10.9562386728
+枝柯 12.5143832909
+毵毵 13.2075304714
+莫使 12.8020653633
+比较法 11.1926274509
+饭票 11.5027823792
+整杯水 13.2075304714
+封信付 13.900677652
+干群 11.2616203224
+例程 12.8020653633
+中负载 13.2075304714
+沉思默想 11.598092559
+行汉礼 11.9547675029
+坐墩 11.7034530746
+西梁国 11.7034530746
+朱世杰 11.8212361103
+信之理 12.8020653633
+四万五千余家 13.2075304714
+往上面 12.1089181827
+戴陵 11.598092559
+八六三计划 13.900677652
+福建林学院 13.2075304714
+静止不动 10.5684731418
+惠敏 12.2912397395
+鲁呼奴 12.8020653633
+魏献安 12.8020653633
+荣新江 11.7034530746
+主力部队 9.80633308975
+法利赛 12.2912397395
+李济深 10.1164880181
+春城 11.3357282945
+里首 13.2075304714
+汽车库 13.900677652
+四顷 11.2616203224
+四顶 12.8020653633
+四页 12.8020653633
+粗蛋白质 12.2912397395
+投诉无门 12.8020653633
+孙文宏亮 13.900677652
+四顾 9.85762638414
+通过培训 11.7034530746
+甩手掌柜 11.7034530746
+本城 10.5684731418
+至今 5.9067201044
+郝大哥 12.5143832909
+天琴座 10.7226238216
+技压群芳 13.2075304714
+嫁过去 11.598092559
+刘亦菲 12.5143832909
+阿尔格 11.9547675029
+属概念 13.900677652
+厂规 13.900677652
+牛柳 12.2912397395
+袋鼠 10.4041700905
+嗜酒 10.2897597393
+居先 13.900677652
+命名日 12.8020653633
+赃证 11.5027823792
+仇先生 12.8020653633
+逼空 9.96885201925
+管状花 11.8212361103
+犯禁 11.1926274509
+必然性 8.89673134603
+中华民族解放先锋队 12.2912397395
+盒带 12.8020653633
+何乐而不为 10.0294766411
+碧野 12.8020653633
+冯子才 12.8020653633
+民夫 9.93038573842
+洗漱间 12.8020653633
+楚留香 13.2075304714
+铁盒子 11.9547675029
+赔不是 10.8096351986
+平等主义 11.8212361103
+马莫 13.900677652
+莫里逊 10.9562386728
+容错 11.8212361103
+教画 13.900677652
+马莲 12.1089181827
+婴儿期 10.9049453784
+发春 13.900677652
+马莱 11.598092559
+石嘴山市 11.7034530746
+翻书 11.1926274509
+亚细亚 9.77354326693
+可长可短 11.7034530746
+张名振 12.2912397395
+总价 8.7245279194
+雷山 9.94943393339
+扎啤 13.900677652
+加利福尼亚州立大学 13.2075304714
+工分 10.0940151622
+有机磷 10.6818018271
+封建礼教 10.0720362555
+畅所欲言 10.765183436
+敲诈 9.91169360541
+两相宜 12.5143832909
+巴勒斯 13.2075304714
+战略伙伴 11.1926274509
+改扮 11.9547675029
+卖官鬻爵 10.604840786
+明正德 11.1280889297
+四百座 13.2075304714
+铁岭县 13.900677652
+掩耳偷铃 13.900677652
+政情 12.2912397395
+活性区 12.5143832909
+制药业 11.5027823792
+水管 9.54396882529
+细心地 10.0088573539
+公安部门 9.5186510173
+天公地道 13.2075304714
+掌舵人 11.1280889297
+危险度 13.2075304714
+唱筹量沙 13.2075304714
+问罪之师 13.2075304714
+东南亚 7.34532076017
+常规化 11.7034530746
+铈量法 13.900677652
+总产 9.71102290995
+殷州 13.2075304714
+望诊 11.0103058941
+怪客 13.2075304714
+杨坚建 13.2075304714
+少年班 12.8020653633
+伏下 10.8561552143
+日程 8.78268383956
+告破 10.6818018271
+母慈子孝 13.900677652
+还原作用 12.5143832909
+双绞线 13.2075304714
+浪打浪 13.900677652
+驱役 12.8020653633
+海关人员 12.1089181827
+塞班 11.598092559
+岭南文化 11.8212361103
+哈谢 9.71102290995
+中铺 12.8020653633
+交待 8.25170341381
+强取民 13.2075304714
+倒也罢了 10.0940151622
+水笔 13.2075304714
+民智 10.6818018271
+猫子 12.8020653633
+投资决策 9.34680076038
+文峰区 12.5143832909
+雷阵 12.8020653633
+地全顶 13.2075304714
+变了样 10.642581114
+陶器厂 12.5143832909
+希克斯 11.5027823792
+民主作风 13.900677652
+日立 10.642581114
+土制 11.7034530746
+无往不利 13.900677652
+搬用 11.7034530746
+张起岩 13.2075304714
+成长期 9.85762638414
+谯楼 11.0674643079
+撞破 10.0940151622
+总之 7.10050758367
+钼矿 10.2630914922
+协调世界时 12.1089181827
+法禁 12.8020653633
+爱恨 11.8212361103
+草率从事 12.8020653633
+被禁 11.598092559
+派系 9.22784881751
+奥帕特拉 11.3357282945
+司棋因 13.2075304714
+三十七团 12.8020653633
+水筒 13.900677652
+谶语 10.9562386728
+陈绍馨 12.8020653633
+须弥山 11.1926274509
+拍卖商 13.2075304714
+卵黄 10.6818018271
+波罗地海 12.5143832909
+杜亚泉 13.2075304714
+谈笑风生 10.0940151622
+颔联 12.5143832909
+半死 9.82314020807
+景宁畲族自治县 11.9547675029
+老大无成 13.2075304714
+音视频 12.5143832909
+证监会 6.57552869402
+华氏温度 13.2075304714
+收监 10.8096351986
+层状 9.38981814546
+热敏 11.0674643079
+伏明霞 13.2075304714
+广州队 11.9547675029
+收盘 6.07184312439
+锰矿石 11.598092559
+彭赛列 11.5027823792
+危机四伏 10.2371160058
+黄毛貂 13.2075304714
+诚诚 13.900677652
+受用无穷 12.8020653633
+法砺 12.8020653633
+水窖 13.900677652
+健康状况 9.41204128224
+泥人儿 12.5143832909
+酮症 10.9562386728
+苏达 11.9547675029
+两极化 12.1089181827
+间种 11.9547675029
+蒂娜 11.8212361103
+第二十九回 11.9547675029
+吕留良 12.8020653633
+宗教建筑 11.1926274509
+腰饰 12.8020653633
+红冠 12.5143832909
+俩打 13.2075304714
+收看 9.71102290995
+富尔顿 11.3357282945
+皮克河 13.2075304714
+函授学校 11.7034530746
+那龙符 13.2075304714
+苏辙 10.8561552143
+寺塔 10.0294766411
+平卧着 13.900677652
+哈赤 12.5143832909
+中性化 12.8020653633
+赀财 13.900677652
+约翰内斯堡 10.533381822
+活性剂 10.1630080337
+三千份 12.8020653633
+胶带 10.0720362555
+战黄忠 13.2075304714
+打赤脚 11.7034530746
+住院治疗 9.7898037878
+冥纸 12.5143832909
+考完试 12.8020653633
+社会动态 12.2912397395
+淮北 9.11318590919
+千丝万缕 9.82314020807
+扎吉 12.5143832909
+胶布 10.642581114
+楷模 9.45802639549
+水竹 11.2616203224
+囊状体 12.2912397395
+尽心尽力 10.4349417492
+戏曲史 10.6818018271
+东南侧 10.3743171274
+土台 11.3357282945
+水端 12.5143832909
+宣谕 10.4041700905
+满身是汗 12.8020653633
+耕牛 9.77354326693
+国务院新闻办 12.8020653633
+提示性 10.3453295905
+官功曹 13.900677652
+太尉行 12.8020653633
+清炒虾仁 13.900677652
+中午饭 10.7226238216
+放烟火 12.2912397395
+洞头 12.5143832909
+城市户口 11.8212361103
+空腹服 12.5143832909
+瓦尔纳 11.598092559
+皮克氏 12.8020653633
+断背山 13.900677652
+水程 11.8212361103
+够得上 11.2616203224
+副线圈 12.8020653633
+行政化 13.2075304714
+土包 11.5027823792
+散闷 11.598092559
+涂写 13.2075304714
+田园诗人 13.2075304714
+总体 6.04358378707
+挖除 12.2912397395
+水稻 6.98594675926
+等候多时 10.6818018271
+洞天 10.2117981979
+胡迈 12.5143832909
+沾染到 13.2075304714
+民权 9.34680076038
+野望 13.2075304714
+土匪 8.25877058104
+周妈 12.8020653633
+表报 13.2075304714
+开放地带 12.8020653633
+莫朗格 13.2075304714
+塞牙 12.5143832909
+内射 13.900677652
+德文郡 11.0674643079
+冷冷地 8.28390655431
+民机 10.8561552143
+魔邪 13.2075304714
+杜康酒 11.5027823792
+苏轼 8.85725253506
+中小企业 6.8106008162
+再假定 10.604840786
+喀斯喀特 11.7034530746
+自行车赛 12.8020653633
+化合态 13.900677652
+民本 11.598092559
+打赤膊 13.900677652
+胡达 11.8212361103
+塞特 10.9562386728
+有何意义 11.598092559
+俄罗斯研究会 12.8020653633
+碰翻 11.5027823792
+民望 11.7034530746
+阴跌 10.0088573539
+清废帝 10.9049453784
+重大新闻 11.5027823792
+谈谈心 11.8212361103
+秦观 11.0103058941
+俩把 13.2075304714
+元亨利 13.2075304714
+铁女寺 11.598092559
+民有 11.3357282945
+牢牢记 11.8212361103
+方方面面 9.36807815882
+硬叶林 12.5143832909
+于濠州 12.2912397395
+罗桑丹 12.8020653633
+贞卜文字 13.900677652
+何腾蚊 13.2075304714
+刘巧 11.598092559
+邵雍 11.598092559
+操然 11.2616203224
+二锅头 11.0103058941
+填鸭 11.9547675029
+居沛 13.2075304714
+立基 12.8020653633
+识货者 13.900677652
+含碳量 10.0294766411
+刘工 11.598092559
+矮个儿 13.900677652
+凌绝顶 13.900677652
+冲突性 13.2075304714
+鲁禾帖 11.7034530746
+电脑管理 13.900677652
+簧风琴 13.2075304714
+胡豆 12.2912397395
+胜负手 13.900677652
+十点钟 10.642581114
+蒂夫 12.8020653633
+姜二公 13.2075304714
+涂刷 11.7034530746
+涂到 12.2912397395
+不回话 11.7034530746
+三千五 13.900677652
+良知良能 13.2075304714
+伙伴儿 12.8020653633
+七百两 12.8020653633
+早场 13.2075304714
+石炭 9.61021821083
+防震棚 13.2075304714
+小圆圈 11.7034530746
+分时操作系统 12.8020653633
+守旧观念 13.900677652
+事务处理 12.5143832909
+徒费 12.2912397395
+硫氢基 13.900677652
+望见 7.83225206373
+奥美 13.2075304714
+克雷福德 13.900677652
+方章钺 13.2075304714
+梁虎 13.900677652
+水秀 10.9049453784
+何腾蛟 10.2117981979
+生死未卜 11.7034530746
+特鲁姆 12.8020653633
+短信铃声 13.2075304714
+师范类 13.2075304714
+昭昭 11.8212361103
+面制品 11.3357282945
+侯氏制 12.5143832909
+羞愤自杀 13.900677652
+香火很盛 13.900677652
+赣东 11.9547675029
+首尾相连 11.4157710022
+学位证 12.2912397395
+郑板桥 10.8096351986
+俞伯牙 13.900677652
+王永吉 9.96885201925
+拖欠工资 11.7034530746
+拓地 11.0103058941
+飞影 13.900677652
+尼日利亚联邦共和国 13.900677652
+简括 10.765183436
+朱慈 10.4041700905
+石烟 11.598092559
+居民 5.82883450237
+问一答十 12.5143832909
+总罢工 10.533381822
+即时贴 13.900677652
+速录 13.900677652
+青石桥 13.900677652
+拍卖场 11.8212361103
+言一动 13.2075304714
+任职者 11.7034530746
+数典忘祖 12.2912397395
+苏武 10.4666904475
+无性杂交 13.900677652
+那僧道 11.7034530746
+冬至点 12.5143832909
+升学压力 13.900677652
+胶州 10.6818018271
+告竣 11.9547675029
+水神 10.4041700905
+蒂姆 11.5027823792
+频段 10.4041700905
+荣毅仁 11.0103058941
+私心杂念 11.5027823792
+大灾之年 11.7034530746
+选上 10.9562386728
+多重国籍 13.2075304714
+敬老怜贫 13.900677652
+塔吉克斯坦 9.82314020807
+瑞穗 11.8212361103
+姚黄魏紫 13.900677652
+米粒儿 12.5143832909
+都胜臣 13.900677652
+数见不鲜 13.900677652
+选为 9.59661255877
+电线杆 9.85762638414
+选举 6.93088698207
+平壤之战 11.8212361103
+没考上 11.5027823792
+浙江日报 12.8020653633
+群轻折轴 13.900677652
+邵阳 10.0505300503
+半次 13.900677652
+作品展览 11.8212361103
+选个 11.0674643079
+选中 9.13850371718
+猫头 11.0103058941
+新晚报 13.2075304714
+腰骨 11.8212361103
+东西方 8.80081122415
+赫顿 12.2912397395
+岳月砚 12.8020653633
+故无 11.7034530746
+廷素拉暖 13.2075304714
+于金滕 13.2075304714
+摄政王 8.00352378434
+收用 11.598092559
+印钤盖 12.8020653633
+怪声 11.1926274509
+水碓 12.1089181827
+明哲保身 11.3357282945
+鼓噪 9.0884932966
+烧化 10.0088573539
+王相府 13.2075304714
+土冈 11.4157710022
+一山之隔 13.2075304714
+从嘉平 13.2075304714
+贝阿塔 13.900677652
+太冲兄 10.642581114
+财力物力 12.1089181827
+美国国防部 10.0505300503
+苏越 13.2075304714
+黑色带 12.8020653633
+翻旧账 12.1089181827
+立方形 12.8020653633
+歌舞片 12.1089181827
+大自在天 13.2075304714
+日神 11.8212361103
+由钦天 12.8020653633
+鱼竿 12.2912397395
+民族 5.48330479584
+七百余 12.2912397395
+丛林地带 12.2912397395
+京沪高速铁路 13.900677652
+山山岭岭 13.900677652
+明抢暗偷 13.900677652
+洛阳玻璃 12.1089181827
+坏人坏事 11.9547675029
+郭南垣 13.2075304714
+香气扑鼻 11.4157710022
+踢飞 11.8212361103
+胡贾 13.2075304714
+由大鸿 13.2075304714
+进退为难 13.900677652
+凯维 12.2912397395
+老搭挡 13.2075304714
+无头公案 12.2912397395
+骨细胞 11.5027823792
+近视眼镜 10.8096351986
+斧斤 12.1089181827
+富士通 12.8020653633
+退休者 13.900677652
+水磨 10.1630080337
+收留 9.04086524761
+四十二员 12.8020653633
+整营 12.5143832909
+难逃一死 12.2912397395
+舞动着 12.1089181827
+枸骨 13.2075304714
+红妆素 13.900677652
+义薄云天 11.9547675029
+秦论 13.2075304714
+原子学 12.5143832909
+达孜县 12.8020653633
+立场 7.20364340431
+圈围 11.9547675029
+电流元 11.1926274509
+慕雅女 13.2075304714
+弗伦 12.2912397395
+西花厅 11.9547675029
+雷斯达 12.1089181827
+核乳胶 12.1089181827
+翻悔 11.7034530746
+伤心 7.46934657004
+私愿 12.5143832909
+南加利福尼亚 13.900677652
+抉择 8.22392384971
+技术壁垒 9.94943393339
+于观津 12.8020653633
+公安部队 11.9547675029
+都领兵 13.2075304714
+临事而惧 12.2912397395
+李来群 13.2075304714
+被窃 12.5143832909
+贿款 10.6818018271
+浪漫派 10.4349417492
+跻身于 10.1394775363
+湖岛 12.1089181827
+民政 8.78268383956
+绝地大 11.8212361103
+郎挺 13.900677652
+山百子 13.2075304714
+吴越常 12.8020653633
+奠基 9.34680076038
+秋征 13.900677652
+被窝 8.5488195185
+顶尖儿 12.8020653633
+鼻涕虫 11.7034530746
+哈达 9.87532596124
+氏硬度 12.2912397395
+小邦巅 13.2075304714
+顿口无言 12.8020653633
+于文侯 12.8020653633
+马妻 13.900677652
+电磁兼容 11.9547675029
+伤得 10.9562386728
+擂主 13.2075304714
+酝酿 7.74581955796
+爽歪歪 13.900677652
+副总干事 13.2075304714
+和籽实 13.2075304714
+斜挎包 13.900677652
+实力型 13.2075304714
+热熔胶 13.900677652
+麻烦事 10.9562386728
+桑达 11.4157710022
+敲过 11.4157710022
+空间点阵 12.5143832909
+催讨 12.2912397395
+上树 10.9562386728
+玳瑁 9.87532596124
+荻村伊智朗 12.8020653633
+歹事 12.1089181827
+破甲弹 9.93038573842
+聪明一世 11.1926274509
+扎克 11.0674643079
+袁绍兵 12.5143832909
+地产界 10.9049453784
+教令 11.3357282945
+紧急情况 9.38981814546
+破脸 13.900677652
+早先 8.73019365694
+手机号码 10.5684731418
+黑天白日 13.2075304714
+地球空间 13.900677652
+纤柔 12.2912397395
+油花花 13.900677652
+李恢 12.1089181827
+令人作呕 11.1280889297
+向辽圣 13.2075304714
+三总部 13.900677652
+蓟辽 9.98865464655
+张敬轩 9.69598503258
+小精灵 11.5027823792
+林县 11.2616203224
+教些 13.900677652
+散逸 12.1089181827
+民报 10.2897597393
+警备司令 11.0674643079
+边军帅 13.2075304714
+德国外交部 13.900677652
+兵役法 11.1926274509
+桑迪 12.5143832909
+那群人 11.7034530746
+牛昶 12.5143832909
+一百二十里 11.7034530746
+胡言 11.3357282945
+内生孢子 12.5143832909
+刘玉凤 12.8020653633
+客货车 11.8212361103
+伶牙俐齿 11.7034530746
+广大职工 11.5027823792
+困而不学 13.900677652
+米斯之 13.900677652
+怪得 11.4157710022
+宓谋砻 13.2075304714
+文豪 11.1926274509
+教人 9.31571017331
+慈禧往 13.900677652
+夏伯阳 12.8020653633
+激昂慷慨 11.598092559
+卡朗加 13.900677652
+教义 8.06879517469
+鼓出 11.3357282945
+早出 11.1280889297
+微量天平 13.900677652
+戏侮 13.900677652
+澧县 11.0674643079
+充腹 13.2075304714
+赴试 13.2075304714
+偷食禁果 13.900677652
+解到县里 13.900677652
+日本航空自卫队 11.9547675029
+不伦瑞克 11.5027823792
+不辞而别 10.0940151622
+布达拉 12.8020653633
+不分皂白 12.5143832909
+陈述句 13.2075304714
+人约黄昏 13.2075304714
+三纲五常 10.8561552143
+日经 9.02548032877
+拭目而待 13.900677652
+塔茜娅 13.900677652
+土木系 12.1089181827
+教习 9.71102290995
+中央文史研究馆 12.2912397395
+盲目乐观 10.2371160058
+教书 8.93783302172
+子独承 13.2075304714
+挂虑 12.8020653633
+分辨力 11.7034530746
+不敢自专 11.9547675029
+资料馆 12.2912397395
+彭楚藩 13.2075304714
+教上 13.900677652
+越高 8.32094782599
+普罗科 12.1089181827
+民户 9.22784881751
+张永琪 13.900677652
+孙老 13.2075304714
+三千万 11.4157710022
+孙者 13.900677652
+水罐 11.2616203224
+水网 9.07236391467
+索尔薇 13.2075304714
+塞着 11.8212361103
+获赃款 13.900677652
+新闻出版署 11.3357282945
+寸头 12.8020653633
+处理软件 12.2912397395
+赠品 10.4994802703
+二十顷 12.5143832909
+人头骨 11.2616203224
+铁拐 13.900677652
+层皮 11.1280889297
+息烽县 12.1089181827
+颁奖典礼 10.5684731418
+老洪 11.8212361103
+安理会常任理事国 11.5027823792
+北地 9.55687223012
+教主 9.96885201925
+点估计 12.8020653633
+伯尔尼 10.1394775363
+斯勃罗 12.5143832909
+功绩 8.40761620864
+晏子春秋 10.9049453784
+江苏省国画院 12.2912397395
+怪异 8.73589167805
+汽车族 13.900677652
+发明 6.71377663156
+渥太华 10.6818018271
+恰在此时 10.9562386728
+整艘 12.1089181827
+脱勒哈 13.900677652
+斯特纳 13.2075304714
+区内外 11.598092559
+瞟向 12.5143832909
+能人 10.604840786
+管教好 12.5143832909
+烧包 11.8212361103
+米尔峰 13.2075304714
+床上 6.71075548123
+床下 10.2371160058
+鸡血石 11.598092559
+哈瓦那 10.3743171274
+神仙中人 13.2075304714
+企口板 13.900677652
+寺山 13.900677652
+乐班 11.0103058941
+水线 10.4994802703
+存亡绝续 13.900677652
+哈西 12.8020653633
+水纹 11.0674643079
+雷诺萨 12.8020653633
+盘龙江 11.9547675029
+布尔吉斯 13.900677652
+瘢痕 10.0294766411
+民主党人 10.5684731418
+散酒 12.1089181827
+锒铛 12.5143832909
+水红 11.5027823792
+能事 10.8561552143
+表意 10.5684731418
+抑制 6.5160672688
+能自生 13.2075304714
+向双喜 10.642581114
+扛回 12.8020653633
+能以 9.25628675283
+土城 9.98865464655
+千多万吨 13.2075304714
+孙膑 10.3743171274
+林口 11.598092559
+苏维尔 13.2075304714
+土埂 11.8212361103
+逃漏税 13.2075304714
+水绿 12.1089181827
+苏词 12.1089181827
+复馆 13.900677652
+俩目 12.5143832909
+派神 13.900677652
+伤处 10.8561552143
+水绵 13.2075304714
+王者兴 13.2075304714
+法籍 11.9547675029
+能仁 13.900677652
+功罪 12.2912397395
+货物保险 12.8020653633
+药学 11.0674643079
+苏诗 12.1089181827
+热辣辣 9.89334446674
+泊头 10.533381822
+米尔岛 11.5027823792
+战苻坚 12.8020653633
+褚衣仆 13.2075304714
+伙伴国 11.0103058941
+内盛 11.0103058941
+苏森 13.900677652
+胡语 13.2075304714
+能为 8.60737282725
+谈一谈 9.37888907493
+上百户 13.2075304714
+胡说 7.97108850859
+梧桐叶 12.2912397395
+流动站 12.8020653633
+振翅高飞 12.5143832909
+避暑山庄 10.5684731418
+罗罗嗦嗦 12.8020653633
+展览厅 11.598092559
+安德鲁斯 11.0674643079
+政教 9.72629038208
+收率 11.8212361103
+纸盒装 13.900677652
+营养障碍 11.9547675029
+藕色 12.2912397395
+本品 10.9049453784
+居次 11.7034530746
+各种规格 12.2912397395
+山南坡 9.96885201925
+土地 5.24285333082
+政敌 9.53122979951
+没多远 12.1089181827
+古镜拿 13.2075304714
+秦越 12.5143832909
+胡话 11.1280889297
+大骨节病 11.7034530746
+能上 10.642581114
+土坝 10.533381822
+涂梢粤 12.2912397395
+危害性 9.84023464143
+法系 10.4041700905
+土块 10.3171587135
+戴高帽子 11.0103058941
+鲜衣怒马 12.2912397395
+土坑 9.31571017331
+土坎 11.598092559
+教会 7.50708689803
+家传之 13.900677652
+折价率 8.9519177616
+河鲜 13.900677652
+狼狈相 11.2616203224
+任人唯亲 10.9562386728
+弗里波 13.900677652
+教众 10.6818018271
+花奉旨 13.2075304714
+有双凤 13.900677652
+日美 9.98865464655
+能乐 12.5143832909
+老嬷嬷 10.2897597393
+熟练工 12.1089181827
+居武 12.8020653633
+检察署 11.9547675029
+飞火流星 13.2075304714
+居正 10.4666904475
+爱尔特 12.8020653633
+土坯 9.63799777493
+土坪 11.8212361103
+共产主义青年团 12.1089181827
+人质事件 12.5143832909
+操盘 9.29550746599
+土坡 9.45802639549
+瑞香 11.5027823792
+尤卡坦 11.1280889297
+鼻中隔 11.0103058941
+偷鸡不着蚀把米 12.1089181827
+扎卡 12.8020653633
+凤歌笑 13.2075304714
+跑下去 11.1280889297
+四十五项 13.2075304714
+铅笔盒 13.900677652
+山鸦 13.900677652
+耶林克 12.8020653633
+唐室 12.8020653633
+日籍 12.8020653633
+世达赖 10.765183436
+日中则移 13.900677652
+奚琴 13.900677652
+低潮 9.15574552361
+碰破 11.2616203224
+等级分 12.8020653633
+佘太君 12.5143832909
+被罩 11.9547675029
+赵杰娘子 10.9562386728
+和莱恩 13.900677652
+胡行 12.2912397395
+喀喇沁旗 12.2912397395
+盛杏荪 13.900677652
+民情 9.74179456862
+国父遗嘱 13.900677652
+于在邦 13.900677652
+能量子 11.9547675029
+层理 10.1394775363
+扶下去 13.2075304714
+斯特默 13.900677652
+两千万 11.5027823792
+毛虎燕 12.2912397395
+明若观火 13.900677652
+发信人 12.5143832909
+小跑步 12.1089181827
+米尔德 13.2075304714
+出院 8.6803218269
+阳刚之气 11.8212361103
+街谈巷语 13.900677652
+斯发明 13.2075304714
+多元论 12.1089181827
+于峰巅 13.900677652
+婴儿床 13.900677652
+孟继懋 13.2075304714
+两千个 13.900677652
+整脸 13.900677652
+复验 13.2075304714
+法罗 12.2912397395
+张宇初 13.2075304714
+法网 11.8212361103
+渎职侵权 12.8020653633
+英子见 13.2075304714
+推进剂 9.96885201925
+同化作用 11.9547675029
+台球桌 13.900677652
+卷旗息鼓 12.8020653633
+刨成 13.2075304714
+鼓包 12.8020653633
+厮混 10.3743171274
+望大圣 11.598092559
+油气区 12.8020653633
+暴露文学 13.900677652
+任全苏 12.8020653633
+新沂县 11.9547675029
+闯过来 12.5143832909
+鼓号 12.2912397395
+当世 9.80633308975
+擒纵装置 13.900677652
+逃奔 9.66657114738
+良金美玉 13.900677652
+告终 8.63798746307
+宗敏又 11.9547675029
+收点 11.2616203224
+碰碎 11.7034530746
+炽焰 13.2075304714
+玄德疑 13.2075304714
+突尼斯共和国 13.2075304714
+一家老小 10.2117981979
+敲起 11.1280889297
+抗氧剂 11.0674643079
+赵士祯 12.8020653633
+穿透性 11.5027823792
+隙地 11.7034530746
+偶极子 11.8212361103
+喝杯 10.3453295905
+李玮峰 12.1089181827
+黑石关 12.8020653633
+越飞 11.8212361103
+陈雪飞 12.8020653633
+山丹丹 12.2912397395
+陈宏范 12.8020653633
+娴静 11.1926274509
+刨花 11.1926274509
+痠软 13.900677652
+冷冲模 13.900677652
+民性 13.2075304714
+休伦 11.1280889297
+福利待遇 10.9049453784
+民怨 10.765183436
+天津市 8.44963919841
+茶炊 10.8561552143
+居桐 12.8020653633
+五马分尸 11.598092559
+省党部 11.7034530746
+见危授命 12.8020653633
+恭喜发财 12.5143832909
+膏肓 11.4157710022
+休会 11.2616203224
+土味 12.8020653633
+军容严整 12.5143832909
+万分之 10.0088573539
+董允 11.598092559
+两千人 10.3453295905
+休伊 11.4157710022
+白碑子 13.900677652
+重新分配 9.85762638414
+钱乐之 13.2075304714
+资本有机 11.0674643079
+鲍丘水 12.1089181827
+统计资料 9.93038573842
+呆呆地 8.4980002701
+蒂尔 11.1280889297
+操琴 11.2616203224
+金属光泽 9.5186510173
+黄新波 13.2075304714
+水粉 11.9547675029
+告罄 10.5684731418
+李彦 11.1926274509
+兄姐 13.900677652
+采薪之患 13.900677652
+水精 11.598092559
+汉人 7.46292600224
+库罗耶多夫 12.2912397395
+出乎预料 11.0674643079
+涂在 13.2075304714
+施耕伊 13.2075304714
+规律性 8.79473217808
+陈绍鹏 12.8020653633
+早前 8.79473217808
+告罪 10.8561552143
+政柄 11.8212361103
+尚可喜 10.765183436
+使用暴力 10.765183436
+电器 6.89126871927
+腰鼓 10.8096351986
+凯尔盖朗 13.2075304714
+桑皮纸 12.1089181827
+老派 11.0674643079
+早到 9.41204128224
+抓乖弄俏 13.900677652
+张微黑 13.2075304714
+破晓时分 13.900677652
+明眸皓齿 11.0674643079
+伯之霸 13.2075304714
+克里希纳 11.7034530746
+扎到 11.1926274509
+孙大圣 8.65365357982
+娴雅 11.5027823792
+扎制 11.8212361103
+噩梦 8.73019365694
+宋德珠 13.900677652
+水系 7.31175117444
+告缺 13.900677652
+文艺报 11.8212361103
+漳州市 11.0674643079
+面墙 11.9547675029
+中型企业 11.598092559
+苏格 12.5143832909
+小意儿 13.2075304714
+兄妹 9.15574552361
+汉代 7.21356904411
+工作汇报 11.0103058941
+核装置 11.8212361103
+塞瓦 13.2075304714
+法线 10.3171587135
+风萧萧 12.1089181827
+成长性 7.27661242418
+望谟 13.2075304714
+桥梁工程 10.8561552143
+近在眼前 10.0720362555
+被绑 10.2897597393
+灰不溜秋 13.2075304714
+舞蹈学院 13.2075304714
+休书 11.1280889297
+南京大屠杀 11.2616203224
+清者自清 12.5143832909
+里程碑 8.64840422393
+汉丹 11.7034530746
+荷兰队 12.5143832909
+漂亮话 11.8212361103
+封于燕 11.7034530746
+死脑筋 12.5143832909
+孙荣 13.2075304714
+农副产品 8.85725253506
+金章宗 10.5684731418
+卵胎生 9.82314020807
+曹魏代 12.8020653633
+烈火干柴 13.2075304714
+李元昊 10.4041700905
+永城市 10.9562386728
+汉中 8.0985592766
+日光灯 10.9562386728
+形式美 10.8096351986
+扎勒 12.8020653633
+伤寒 9.15574552361
+南京机场 12.8020653633
+既来之 11.7034530746
+陈少白 11.1280889297
+荣蝶仙 13.2075304714
+坚固耐用 11.1926274509
+鼓劲 10.642581114
+鼓励 6.46878573517
+中旅总社 13.2075304714
+一个三层 13.2075304714
+郎机 11.7034530746
+记忆减退 11.598092559
+民愤 10.2371160058
+胖胖 11.7034530746
+气候因子 12.8020653633
+挖通 11.7034530746
+髀里肉生 13.900677652
+伤害 7.12645376562
+何休著 13.2075304714
+厂矿企业 11.0674643079
+法统 11.0103058941
+吉兰丹 12.2912397395
+字体大小 13.900677652
+田和莱 13.2075304714
+旅日 12.1089181827
+秦远 12.8020653633
+水米 11.0103058941
+老实人 9.5062284973
+法经 10.604840786
+抗氧化 9.96885201925
+罪案 10.9049453784
+寺庙 8.1608847398
+柯尔克孜 10.2371160058
+万精兵 11.8212361103
+数学分析 10.2897597393
+焰火 9.96885201925
+海珍品 10.9049453784
+民意 7.93197009199
+汉书 8.2985588311
+索古一世 12.8020653633
+第六十二章 13.2075304714
+二恶英 11.7034530746
+越国公 12.8020653633
+七七四十九个 13.2075304714
+向夏国 12.1089181827
+程文书 13.2075304714
+浪漫曲 11.4157710022
+护心镜 11.3357282945
+北京理工大学 11.8212361103
+陈述彭 12.8020653633
+怪叫 10.1630080337
+救护队 11.8212361103
+欲速则不达 11.598092559
+自准直 12.8020653633
+磁带设备 13.2075304714
+香港股市 9.17328983326
+日版 11.9547675029
+夏雨雪 13.900677652
+推进力 12.8020653633
+猫叫 10.765183436
+老搭档 11.1280889297
+销售税 13.2075304714
+不锈钢 9.15574552361
+吵扰 12.8020653633
+胡虏 11.1926274509
+皮克斯 13.900677652
+整轮 13.900677652
+余怀皱 13.2075304714
+压缩器 12.8020653633
+直属机构 10.0940151622
+德维雅 13.2075304714
+伤员 8.3285236198
+胶块 13.2075304714
+汪某深 13.900677652
+二月河 10.0294766411
+农业丰收 12.2912397395
+两栖动物 10.4349417492
+七七四十九乡 13.2075304714
+犯下 9.5186510173
+犯上 10.8561552143
+神兆时 13.900677652
+尚存时 12.5143832909
+旋钮 10.4666904475
+周武仲 13.2075304714
+内侄女 12.5143832909
+复句 13.900677652
+丧父之痛 13.900677652
+许晓轩 13.2075304714
+剖面图 11.4157710022
+蒂博 11.4157710022
+朱缨 11.4157710022
+弧间盆地 13.900677652
+蒂卡 13.900677652
+胶圈 13.900677652
+科学考察 9.84023464143
+哈萨 13.2075304714
+矮个子 11.1926274509
+天河路 12.1089181827
+三十五米 13.2075304714
+李慧娘 13.2075304714
+水珠 9.36807815882
+加号 11.0674643079
+越障 12.2912397395
+斯特拉迪瓦里 12.5143832909
+王占元 12.1089181827
+仗恃 11.1280889297
+神志不清 10.3743171274
+早已 6.11246609413
+轻描淡写 9.80633308975
+畜类 11.0674643079
+相联接 11.3357282945
+收纳 10.2117981979
+布艺沙发 13.2075304714
+优势种群 13.2075304714
+整过 11.8212361103
+扎巴 12.5143832909
+居易 12.2912397395
+太平渡 13.900677652
+抢劫者 13.2075304714
+创业项目 11.598092559
+架锅 12.8020653633
+图三 13.900677652
+操作技能 12.2912397395
+胡梦 13.2075304714
+涂墨 12.8020653633
+米尔克 13.900677652
+吾辈 10.4349417492
+克诺索斯 11.4157710022
+酮类 11.3357282945
+吕布乃 12.1089181827
+战役学 11.598092559
+沙赫尔 13.900677652
+腰部 8.98802276624
+路易斯安那州 10.765183436
+吕布之 11.4157710022
+一拖再拖 10.4994802703
+缩头缩颈 13.900677652
+萧颖士 13.2075304714
+沙陀 10.3743171274
+哈蒙 13.2075304714
+犯事 10.9049453784
+斯基亚 13.2075304714
+表述 7.78258045393
+胶垫 13.2075304714
+起拍价 10.5684731418
+宋国蒙 12.8020653633
+发球权 12.2912397395
+众志成城 11.5027823792
+外包装 10.4041700905
+胡梯 12.1089181827
+子牙新河 11.3357282945
+哈蒂 13.2075304714
+有利于 6.14149021347
+注意力 7.8161782389
+恒定性 13.2075304714
+居侧宫 12.8020653633
+佳人 10.1394775363
+黄皮子 8.49350588052
+欣喜若狂 10.4666904475
+书信体 11.4157710022
+未成交 12.2912397395
+孙谦 13.2075304714
+封齐王 12.2912397395
+水獭 9.72629038208
+亚健康 10.1394775363
+紫百合 13.2075304714
+力场 11.1280889297
+共收录 11.5027823792
+郑介民 12.8020653633
+南昆山 12.5143832909
+黄曲霉素 12.5143832909
+季分明 10.3743171274
+通济堰 12.8020653633
+土宜 12.8020653633
+发财梦 12.8020653633
+收缩 7.01926634833
+鼓山 11.4157710022
+晴空万里 11.5027823792
+收缰 12.8020653633
+董其昌 10.3171587135
+收缴 9.28555713513
+胡蝶 11.9547675029
+郝大手 9.56994431169
+甲午海战 12.2912397395
+婚否 12.8020653633
+有苦难言 11.7034530746
+酸碱 9.01032852375
+第六十二篇 13.2075304714
+爱尔纳 13.900677652
+陆抗 11.3357282945
+派生 9.35738286971
+外贸服装 13.2075304714
+土家 9.26594866375
+旅欧 11.2616203224
+长生草 12.1089181827
+阿西夫 13.900677652
+保卫工作 11.2616203224
+傻乎乎 9.93038573842
+操闻 11.0674643079
+收编 9.10488710638
+未免太没 13.900677652
+碳黑 12.2912397395
+隔水相望 11.5027823792
+桑英 13.2075304714
+王永在 13.900677652
+定时器 11.7034530746
+存活期 13.2075304714
+早就 6.20628484935
+水狗 12.5143832909
+竹林寺 13.900677652
+懊悔不已 11.8212361103
+碰着 9.71102290995
+浴火重生 12.1089181827
+飞机场 9.46986085313
+电动吊杆 13.900677652
+气急攻心 13.2075304714
+平价店 13.900677652
+胡蜂 10.604840786
+秦腔 8.89673134603
+好玩儿 11.0674643079
+怪力 11.3357282945
+优缺点 11.2616203224
+图仪 12.1089181827
+收网 11.4157710022
+瑞雪 11.0103058941
+台上台下 11.1926274509
+收罗 10.6818018271
+挥手告别 11.5027823792
+图们 11.9547675029
+斯威尔斯 13.2075304714
+乐美 11.7034530746
+日班 11.8212361103
+法炼 12.5143832909
+万事具备 12.5143832909
+赤身 11.2616203224
+手把手 11.5027823792
+相炫耀 13.900677652
+寺僧 10.8561552143
+孙资 12.8020653633
+再不来 11.598092559
+海利丰 10.6818018271
+功率 7.39339993959
+圆锯片 13.2075304714
+海关总署 10.2630914922
+腰里 8.65893063692
+偏安一隅 12.2912397395
+王卖婆 12.5143832909
+发家史 12.1089181827
+文艺晚会 12.8020653633
+宰臣 12.1089181827
+影片奖 10.6818018271
+胶囊 9.28555713513
+辛散轻 13.2075304714
+霍夫迈 13.2075304714
+尼伦伯格 13.2075304714
+刘玉尺 8.67493097826
+中性溶剂 13.900677652
+怀疑者 12.2912397395
+高景德 13.2075304714
+望王庆 12.8020653633
+华东政法学院 13.2075304714
+水牛 9.10488710638
+白磊 13.2075304714
+四川省阿坝藏族羌族自治州 12.8020653633
+怪到 12.8020653633
+水牌 13.900677652
+蒂勒 13.900677652
+李教授 11.2616203224
+厮打 9.56994431169
+应征税 13.2075304714
+六角形 10.1164880181
+密云水库 11.0103058941
+天恒 13.900677652
+浸礼会 12.5143832909
+从嘉和 12.1089181827
+发文件 12.8020653633
+中心医院 9.63799777493
+巧夺天工 11.1280889297
+拓展 7.21982297319
+瑞祥 12.8020653633
+整身 13.2075304714
+马自西 13.900677652
+靖海 13.2075304714
+碱性溶剂 12.8020653633
+知其不可 12.1089181827
+二十一家 13.2075304714
+通盘计划 13.900677652
+水牢 13.2075304714
+成擒 12.8020653633
+宓汝成 13.2075304714
+负责人 5.96473254862
+白马非马 12.5143832909
+土墙 9.69598503258
+西二旗 11.8212361103
+大石坝 13.2075304714
+枕戈待旦 11.598092559
+西非国家 13.2075304714
+胡葱 13.2075304714
+抹墙 13.900677652
+菲利普斯 11.598092559
+毛里求斯 10.0505300503
+皮克林 13.2075304714
+天方夜 13.900677652
+维纳尔 13.2075304714
+数亿次 13.900677652
+梧桐山 11.8212361103
+偏南风 10.8096351986
+民法 9.22784881751
+留得青山 13.900677652
+深深浅浅 11.5027823792
+秩序井然 10.642581114
+危险品 10.4666904475
+逼供 11.2616203224
+阿列克谢耶夫 11.9547675029
+吊销其 12.8020653633
+唯唯否否 13.900677652
+泾源 11.9547675029
+土墩 11.0674643079
+塔拉瓦 11.7034530746
+钥匙链 13.2075304714
+恬适 11.9547675029
+何休见 13.2075304714
+东西洋 11.1280889297
+民治 11.598092559
+秦艽 11.1926274509
+污泥浊水 11.8212361103
+长春市委 12.5143832909
+膏油 12.1089181827
+唐守 12.8020653633
+和廷臣 13.2075304714
+可转债 8.52539924429
+孙揆 13.2075304714
+谭山 11.1926274509
+误差 8.1641053545
+事到临头 9.98865464655
+宋江部 13.2075304714
+有心无力 11.0103058941
+黑诊所 11.4157710022
+阿古斯丁 13.2075304714
+一片至诚 12.2912397395
+柳斯金 13.900677652
+鼓式 11.598092559
+唐安 13.900677652
+土壤 6.70174641129
+滚上来 13.900677652
+鼓弄 12.1089181827
+伍廷芳 9.06439574502
+怪兽 10.3171587135
+蹄筋 12.5143832909
+苏萨 12.1089181827
+招了 11.9547675029
+有机物 8.61241062128
+叩门声 11.3357282945
+宰者 13.2075304714
+建瓯市 13.2075304714
+赴藏 12.1089181827
+处理意见 10.604840786
+埋葬地 13.900677652
+里尼奥 13.900677652
+伯纳迪 12.1089181827
+土堆 9.74179456862
+形象气质 12.8020653633
+湘云 8.93783302172
+宣政院 10.4041700905
+负异常 13.2075304714
+化学分析 10.2371160058
+人文荟萃 11.7034530746
+布拉柴维 13.900677652
+留言簿 13.2075304714
+敦煌艺术研究所 12.2912397395
+时俗 11.8212361103
+法王 9.45802639549
+经学 9.24671730182
+土堤 12.2912397395
+土堡 13.900677652
+越礼 12.1089181827
+厨房 7.62403416263
+化胡 11.9547675029
+逼使 10.9562386728
+旅检 12.8020653633
+名实相副 13.900677652
+青石路 13.900677652
+宗正卿 13.2075304714
+反击 7.63347710343
+向东流 9.91169360541
+左英杰 13.2075304714
+八小时 10.7226238216
+收存着 13.900677652
+疏密度 13.900677652
+民气 10.6818018271
+告状 8.44109213783
+李之薇 12.2912397395
+按道理讲 12.8020653633
+双季稻 9.94943393339
+早得 10.533381822
+内焰 13.900677652
+水煮 10.2371160058
+跨门 13.2075304714
+寸土 11.8212361103
+太阿倒持 13.2075304714
+逼住 10.604840786
+神奈川县 11.8212361103
+保险期限 11.9547675029
+猫儿 9.96885201925
+博士点 13.2075304714
+榨出 10.9049453784
+中介性 13.900677652
+滴水檐 12.5143832909
+怪僻 11.3357282945
+有心有意 13.900677652
+日照 8.44535653662
+日煦 13.2075304714
+逼人 9.12155415886
+早年 6.95274058336
+坚持己见 11.8212361103
+旱作区 11.7034530746
+塞拉斯 11.8212361103
+卢基扬诺夫 13.900677652
+孙运 13.900677652
+球磨机 12.5143832909
+割手 13.900677652
+香溪宽 13.2075304714
+大肚子 9.98865464655
+节食 10.0505300503
+填充物 11.0103058941
+损公肥私 13.2075304714
+陈平之 12.2912397395
+中国科学院计算技术研究所 12.8020653633
+西岗区 13.2075304714
+水炮 12.8020653633
+驾走 13.2075304714
+萨其玛 12.5143832909
+局势稳定 12.2912397395
+新沂市 12.2912397395
+吉洛特 12.1089181827
+紧身裤 11.9547675029
+红古区 13.2075304714
+水烟 10.6818018271
+和朝臣 12.5143832909
+法特 11.4157710022
+科研任务 12.1089181827
+文贵 11.8212361103
+赫里 12.2912397395
+在劫难逃 10.8096351986
+法物 11.3357282945
+内燃 11.5027823792
+向少平 13.2075304714
+于睦州 12.5143832909
+表象 9.27570483869
+脉率 11.9547675029
+股票价格 8.92394390956
+上海公报 12.5143832909
+越长 9.07236391467
+带毒者 12.5143832909
+零五分 13.2075304714
+胶合 10.8561552143
+东益地 13.2075304714
+扎布 11.1926274509
+枕头风 13.2075304714
+起早床 13.900677652
+瑞银 7.78478552649
+逼仄 11.1926274509
+鼓师 12.2912397395
+霞辉 13.900677652
+戈纳夫 13.900677652
+牛拦军 11.598092559
+淮夷 10.4666904475
+封闭抗体 12.5143832909
+过失罪 13.900677652
+从奇珍 12.8020653633
+五十出头 12.1089181827
+第二十九届 11.7034530746
+家庭财产 11.1926274509
+净流量 11.2616203224
+右都御史 10.642581114
+清慧姐 12.8020653633
+取义成仁 12.8020653633
+市净率 8.89673134603
+联想起 9.56994431169
+小卖部 11.1280889297
+哈蟆 13.2075304714
+拉维尔 13.2075304714
+掏枪 12.2912397395
+平等待人 13.2075304714
+虹鳟鱼 11.8212361103
+苏联政府 9.77354326693
+空名 11.0103058941
+邓牧 12.5143832909
+许四 13.900677652
+层积 12.8020653633
+死也不放 12.5143832909
+广告设计 13.900677652
+图二 13.900677652
+紧身衣 11.3357282945
+逼上 11.8212361103
+逼下 13.2075304714
+弦子 10.2117981979
+萧望之 12.2912397395
+歇一宿 13.2075304714
+拓广 11.2616203224
+百脑汇 12.5143832909
+斯公学 13.2075304714
+妄求 13.900677652
+怎啦 11.2616203224
+无可不可 12.8020653633
+水灌 11.9547675029
+洞彻 12.2912397395
+紧急会议 9.89334446674
+品牌优势 9.38981814546
+阵地防御 12.1089181827
+于美制 13.900677652
+鼓座 13.2075304714
+于广信 13.2075304714
+隋至唐 12.5143832909
+水灾 9.32596667347
+卡皮察 12.1089181827
+伤型 13.2075304714
+水灵 11.0103058941
+钟会构 13.2075304714
+葛巢甫 13.2075304714
+早床 13.900677652
+海天亮 12.1089181827
+水火 8.99540287354
+苏蕙 13.2075304714
+还本付息 9.93038573842
+文峰塔 11.4157710022
+资料集 12.8020653633
+周恩来 7.90671622467
+频数 10.9049453784
+声气相通 12.8020653633
+苏芬 12.1089181827
+氯化铅 13.900677652
+开发人员 12.2912397395
+时间延缓 12.1089181827
+土库 13.900677652
+愧不敢当 11.5027823792
+重元素 11.4157710022
+胶印 11.8212361103
+阿西尔 12.1089181827
+乐章 9.72629038208
+扎好 11.2616203224
+胶卷 10.8096351986
+乡干部 12.1089181827
+软禁 9.49395840471
+秋收起义 10.0720362555
+受热捧 12.2912397395
+散页 13.900677652
+收稿 11.8212361103
+认清形势 11.1280889297
+浇灌 10.0720362555
+石片 10.4349417492
+贝弗利 12.5143832909
+空袭警报 10.4349417492
+苔藓植物 10.3171587135
+收税 9.6811699468
+喷药 12.5143832909
+平地上 10.6818018271
+斜入 13.2075304714
+旅游 6.41855872842
+胶南 11.3357282945
+恰帕斯州 13.2075304714
+单身男人 12.8020653633
+搬离 11.4157710022
+燕射歌 13.2075304714
+担保责任 10.6818018271
+洗发精 11.5027823792
+背伤 13.900677652
+政治 5.13584343764
+暖瓶 11.0674643079
+涂层 10.0088573539
+束手待死 13.900677652
+副官处长 13.900677652
+牧主 12.5143832909
+两三件 12.2912397395
+鄂豫陕 12.5143832909
+荆棘丛生 11.8212361103
+四氧化二氮 11.9547675029
+苏英 13.2075304714
+苏苏 11.9547675029
+倍受尊敬 13.900677652
+东西欧 12.8020653633
+比尔盖茨 12.5143832909
+比较忙 11.9547675029
+心不烦 11.3357282945
+风云录 13.900677652
+牧业 8.47133202302
+法界 10.642581114
+堆雪人 12.8020653633
+涂山 10.9049453784
+胶化 13.2075304714
+报刊杂志 11.7034530746
+侯莫陈 11.598092559
+神经内科 12.2912397395
+背会 12.2912397395
+搬移 11.9547675029
+但楚军 12.8020653633
+关东地区 11.3357282945
+背信 10.1630080337
+表记 11.598092559
+食槽 13.2075304714
+五味瓶 11.9547675029
+止不住 8.47572763449
+胡英 13.2075304714
+熊孝义 13.900677652
+因此之故 12.1089181827
+布莱梅 11.8212361103
+四脚朝天 11.9547675029
+土布 10.2117981979
+排水沟 10.6818018271
+南宁路 13.900677652
+不了情 12.5143832909
+日益 6.42081352081
+沙家浜 11.7034530746
+装笑 13.900677652
+乔乔桑 13.900677652
+胡苏 12.8020653633
+审判大会 13.900677652
+溶液聚合 11.598092559
+龚书铎 13.900677652
+痰饮 10.4994802703
+千与千寻 13.900677652
+压缩力 13.900677652
+外交部驻港特派员公署 13.900677652
+若干艘 13.2075304714
+流动率 11.7034530746
+井田 10.0505300503
+聚伞花序 9.58318953844
+从业 8.59240995457
+东方歌舞团 12.1089181827
+心窝子 10.7226238216
+居所 9.66657114738
+塞罗 12.5143832909
+尚祈见 12.8020653633
+美姑县 13.2075304714
+丁未七款 13.2075304714
+采暖期 13.900677652
+表语 13.900677652
+单指令 13.900677652
+浇灭 10.533381822
+胶县 11.598092559
+虎体熊腰 13.900677652
+相符合 9.93038573842
+层级 10.4666904475
+王相公 11.5027823792
+正反两方 12.2912397395
+德令哈市 11.9547675029
+心不由意 13.900677652
+卵圆形 9.04086524761
+拈花 13.2075304714
+复选 11.2616203224
+在押犯 12.2912397395
+狼狈逃窜 12.1089181827
+小邦勒 13.2075304714
+整训 10.9049453784
+怪圈 9.54396882529
+哈肯 11.9547675029
+张卫 11.8212361103
+表识 12.8020653633
+大良 11.9547675029
+胶原 11.0674643079
+背书 9.96885201925
+卑劣手段 12.5143832909
+金红石 10.0505300503
+厂内 12.5143832909
+拉开序幕 9.66657114738
+诲盗 13.900677652
+体积小 9.25628675283
+披麻救火 13.900677652
+长见识了 12.2912397395
+全盘托出 13.900677652
+一场场 11.0674643079
+马晓伟 13.900677652
+斯台普 13.2075304714
+伤兵 10.8561552143
+胡荽 12.8020653633
+吴兵见 12.5143832909
+恬静 10.2897597393
+贼喊捉贼 11.7034530746
+桑蚕 9.82314020807
+苑学政 11.2616203224
+雨刮器 12.1089181827
+哈腰 12.1089181827
+塞纳 11.2616203224
+水皮 10.4349417492
+监督管理 8.62256299275
+黑芝麻 10.604840786
+收笔 12.8020653633
+潜伏性 12.5143832909
+散了架 10.3453295905
+行使主权 10.4349417492
+法理 10.3743171274
+上百人 10.9049453784
+兄台 9.4233408375
+拐卖人口 12.1089181827
+塞给 13.900677652
+怎可 10.9562386728
+泰奥弗 11.9547675029
+胡茬 11.4157710022
+水监 12.5143832909
+东摇西摆 13.900677652
+诗礼传家 13.2075304714
+水盆 10.3453295905
+殿军 12.8020653633
+铁匠工场 13.900677652
+苏菲 12.1089181827
+胸透 11.9547675029
+阿眉 12.2912397395
+怎及 13.900677652
+丰韵 12.1089181827
+榆叶 11.8212361103
+内伤 9.91169360541
+国子生 12.2912397395
+山羊胡子 9.98865464655
+张尔公 12.8020653633
+塞维 12.8020653633
+背下 11.9547675029
+扎堆 8.98802276624
+设置成 11.3357282945
+吉约姆 12.1089181827
+苏菜 12.1089181827
+马欢著 12.2912397395
+正体字 12.8020653633
+萎缩 7.0254455647
+展览室 11.8212361103
+西凉力 12.8020653633
+公平合理 10.3453295905
+生意萧条 13.2075304714
+铁岭市 11.4157710022
+次要矛盾 12.8020653633
+玉木 12.2912397395
+操纵 7.01619099993
+周大福 11.9547675029
+丁节 13.2075304714
+英气 10.8561552143
+无限风光 12.5143832909
+表演队 13.2075304714
+皇太子 8.89673134603
+金融部门 10.604840786
+吃尽苦头 13.900677652
+腰间 8.30225569298
+毛泽东故居 11.9547675029
+复配 13.2075304714
+有机界 11.8212361103
+青石条 13.2075304714
+赴英 10.6818018271
+青石板 9.54396882529
+封常清 12.2912397395
+阿伯丁 11.3357282945
+腰门 11.598092559
+民歌 8.43261751084
+施复亮 12.8020653633
+果树林 13.2075304714
+血尿酸 12.2912397395
+苏荣 13.900677652
+那龙虎 13.900677652
+诸司 10.6818018271
+里萨 12.8020653633
+危险区 11.7034530746
+相应不理 12.5143832909
+射出去 11.2616203224
+法瓦 12.8020653633
+背人 11.9547675029
+黄蝴蝶 12.5143832909
+敲过去 13.900677652
+衷心希望 11.1280889297
+会议记录 11.1280889297
+第三十三篇 13.2075304714
+操练 8.4980002701
+蒸发量 9.36807815882
+吵架 8.61747392324
+何哲 13.900677652
+郎洞 12.5143832909
+懊恼不已 13.2075304714
+安特生 12.2912397395
+点化 11.0674643079
+蒂固 13.900677652
+法眼 10.8561552143
+女特务 11.598092559
+干仗 12.2912397395
+操素 13.2075304714
+拓宽 8.22050504296
+涂布 11.0103058941
+土岗 12.1089181827
+水疗 11.8212361103
+寺坡 12.8020653633
+金饭碗 11.8212361103
+晓行夜宿 11.598092559
+家庭教师 10.7226238216
+拉贾斯坦邦 11.8212361103
+文林街 12.8020653633
+硅钙 13.2075304714
+腰际 11.2616203224
+阮公墩 13.2075304714
+一语惊人 13.900677652
+硕儒 12.2912397395
+鸟嘴 11.7034530746
+告白 12.1089181827
+普陀区 12.8020653633
+王俊 10.8096351986
+早孕 10.9562386728
+秒针 11.4157710022
+水疱 10.4994802703
+难以启齿 10.9049453784
+土岭 11.8212361103
+瑞金市 13.2075304714
+量体重 13.900677652
+从海洞 13.2075304714
+软磁盘 11.5027823792
+宫来帮 13.2075304714
+郎溪 12.8020653633
+举棋不定 10.1871055853
+干云 13.2075304714
+水痘 11.7034530746
+电动葫芦 13.2075304714
+瑞金 9.5062284973
+王侯 9.4233408375
+各家各户 10.4349417492
+宗教自由 11.598092559
+贵港市 11.598092559
+草垛子 11.2616203224
+摊出去 13.900677652
+殁世 13.900677652
+伤到 11.3357282945
+干事 8.08059472162
+胡耀 13.900677652
+爱如珍宝 12.2912397395
+斯特雷 12.2912397395
+岁月不饶人 12.5143832909
+淘汰率 11.3357282945
+膏梁 13.900677652
+起居室 10.2371160058
+王侗 13.900677652
+有余味 13.2075304714
+布拉迪 12.5143832909
+高大英俊 13.2075304714
+巴黎埃菲尔铁塔 13.2075304714
+精兵简政 11.7034530746
+甘末林 13.2075304714
+国家食品质量监督检验中心 12.8020653633
+巢氏 13.2075304714
+扎寨 10.7226238216
+水生 8.25170341381
+荒山秃岭 13.900677652
+王佥 13.2075304714
+寻常疣 13.2075304714
+苏维埃 8.22050504296
+整角 11.8212361103
+王佳 12.5143832909
+略多于 10.533381822
+波浪翻滚 13.2075304714
+哈苏 13.900677652
+狎妓 11.598092559
+百色市 11.7034530746
+庭外和解 13.900677652
+干么 11.9547675029
+垂念 12.8020653633
+牌坊店 13.900677652
+刘聚 13.900677652
+国子监 9.15574552361
+水电 7.99531580392
+向少安 12.5143832909
+赠序 12.2912397395
+王位 8.14493543839
+发烟硫酸 12.5143832909
+王佐 11.9547675029
+王何 13.900677652
+罪愆 11.598092559
+解说 8.98069672615
+门插销 13.2075304714
+啤酒大麦 12.8020653633
+王传 10.9562386728
+石津渠 12.5143832909
+总仓库 13.900677652
+干丝 13.2075304714
+手眼通天 11.8212361103
+立元修 12.8020653633
+王伯 12.5143832909
+青山绿水 11.0674643079
+电脑内存 13.900677652
+水界 13.2075304714
+冲突法 12.2912397395
+土屋 11.0674643079
+探戈舞 11.8212361103
+旅法 12.2912397395
+土居 12.2912397395
+胶冻 12.1089181827
+土层 8.29120585679
+干上 10.3453295905
+鼓室 10.9562386728
+新闻出版界 13.900677652
+玻璃制品 10.9049453784
+王伉 12.8020653633
+王伏 12.8020653633
+土山 10.2630914922
+定日县 13.2075304714
+早安 11.4157710022
+戏园子 11.5027823792
+伤力 13.900677652
+扎实 8.31342899358
+任蔚 13.900677652
+表观 9.77354326693
+王会 11.7034530746
+圈墙 13.900677652
+苏联 6.02822250191
+王伟 9.55687223012
+干个 11.4157710022
+成霸业 12.8020653633
+颜阿鲁 13.2075304714
+佛学院 12.8020653633
+谢灵顿 11.8212361103
+王仪 12.8020653633
+千多万年 12.5143832909
+商载 11.4157710022
+王仲 12.5143832909
+每盎司 8.21031819765
+秀才人情 13.2075304714
+性情豪爽 13.900677652
+富浠汇 12.8020653633
+出门 6.8787012289
+收礼 11.1926274509
+播种机 10.7226238216
+胡腾 13.900677652
+王仁 10.6818018271
+早婚 11.4157710022
+不进反退 13.2075304714
+厨柜 13.2075304714
+越秀 10.2897597393
+陆志韦 11.9547675029
+勤政廉政 12.8020653633
+受测者 13.900677652
+乌蒙蒙 12.5143832909
+綦江 10.8561552143
+秦蜀 12.1089181827
+全国总工会 10.642581114
+怪哉 11.2616203224
+孙权少 13.2075304714
+马自达 9.19114745066
+视频信号 11.4157710022
+鹦哥绿 12.1089181827
+王仙 10.8561552143
+整补 13.2075304714
+整衣 10.3743171274
+持续保持 10.533381822
+赤道板 12.8020653633
+三十五等 13.2075304714
+日用 8.83808261895
+皮奥拉 13.900677652
+索马里人 11.8212361103
+大祸临头 10.0940151622
+四百多名 12.5143832909
+王亮 11.2616203224
+国营商业 11.9547675029
+王京 12.1089181827
+王亲 13.900677652
+滥伐林木 13.900677652
+捱了过来 13.900677652
+田纳西 11.0103058941
+瑞郎 10.3743171274
+森山 12.5143832909
+日电 7.14374526273
+闻者足戒 12.2912397395
+韩国大宇 12.8020653633
+万家乐 12.1089181827
+兖州 9.13850371718
+中途站 12.2912397395
+屈家岭 11.1926274509
+类风湿性 12.8020653633
+摩擦音 12.1089181827
+水瓶 11.3357282945
+猫咪 13.900677652
+吉斯卡尔 11.9547675029
+普罗特 12.1089181827
+王二 11.1926274509
+水瓮 11.5027823792
+王云 10.2897597393
+合同文书 13.900677652
+商轮 13.2075304714
+王五 12.2912397395
+共基极 13.2075304714
+土工 11.4157710022
+水瓢 11.3357282945
+筹安会 11.8212361103
+布隆方丹 12.5143832909
+明宗太子 13.2075304714
+女流之辈 10.4041700905
+郧西 11.598092559
+军法从事 10.8561552143
+采石场 11.0674643079
+伤口 7.84623830571
+怪味 11.3357282945
+政潮 12.1089181827
+鬼剃头 13.900677652
+匹兹堡 8.71329184614
+伤号 11.1926274509
+整装 10.9562386728
+王乃 12.2912397395
+张纪中 9.84023464143
+双水村 7.81163277653
+孔孟朱 13.900677652
+伤及 9.62401153296
+向孝文 12.8020653633
+王之 10.3171587135
+赙赠 13.2075304714
+国利病 11.3357282945
+乐神 12.8020653633
+利率政策 9.21854642485
+授旗仪式 13.900677652
+土崩 12.8020653633
+斯政府 13.2075304714
+奠定 6.80230201338
+告知 7.67216664838
+法皇 12.5143832909
+辅助单位 12.2912397395
+拂袖而去 10.3743171274
+法相 10.8096351986
+三跪九叩 10.2371160058
+黄铜矿 10.765183436
+罪恶 8.24468584116
+王中 10.9049453784
+焰硝 11.3357282945
+越野 8.84443184663
+王丰 12.5143832909
+整袋 13.900677652
+老糊涂 10.533381822
+常规岛 11.1280889297
+王丽 10.642581114
+不知人间有羞耻事 13.2075304714
+加劲 11.8212361103
+乡土气 13.900677652
+魏黄初 12.5143832909
+桑著 13.2075304714
+人民日报 8.60737282725
+干扰力 13.2075304714
+理解 6.04358378707
+电离能 12.2912397395
+观天象 11.1280889297
+素爱 13.2075304714
+王世 11.2616203224
+寇上谷 13.2075304714
+派珀 13.900677652
+花卉草木 12.8020653633
+英仙座 11.3357282945
+王东 10.765183436
+乐曲 8.60737282725
+资料费 13.900677652
+新家具 12.8020653633
+王凤 10.642581114
+做爱时 11.9547675029
+多态性 12.5143832909
+能容 10.4994802703
+枢机主教 11.2616203224
+徐玉诺 13.2075304714
+飞下来 11.9547675029
+蓝眼睛 10.4994802703
+云片 13.2075304714
+李春芳 11.7034530746
+水殿 11.1926274509
+操持 9.77354326693
+冉森派 13.900677652
+鹤峰县 13.900677652
+吴元年 10.604840786
+民盟 10.1871055853
+王凌 13.2075304714
+娇美 11.4157710022
+胶体 9.40086798165
+提插补泻 13.900677652
+休姆 12.5143832909
+南卡罗 13.900677652
+万应灵丹 12.5143832909
+整面 12.5143832909
+能守 11.0674643079
+痛哭 7.91171623509
+林冲 7.78699547214
+地开石 13.2075304714
+王冠 10.1394775363
+无所不用其极 11.7034530746
+杨坚代 12.5143832909
+走私汽车 13.2075304714
+汉姓 11.1280889297
+床子 10.9562386728
+终场哨 13.900677652
+问责制 10.3171587135
+解放公园 13.900677652
+水母 9.45802639549
+散落 8.82550383674
+医学科 11.9547675029
+表面 6.10544272297
+终元之 12.5143832909
+呼救声 12.2912397395
+保安镇 12.5143832909
+汉姆 11.7034530746
+总库 11.598092559
+背包 8.85725253506
+总店 10.0505300503
+隔栅 12.2912397395
+运河镇 12.1089181827
+总应 13.900677652
+原尔朱 13.2075304714
+苏黄 12.5143832909
+捆绑带 13.900677652
+孙钧 13.2075304714
+总府 13.2075304714
+伏帝 13.2075304714
+礼盒装 13.900677652
+王冕 11.598092559
+王军 10.5684731418
+解构主义 13.2075304714
+獠牙 10.0294766411
+总序 11.8212361103
+蛙肉 13.2075304714
+操控 8.53470163695
+三亲六故 12.8020653633
+贬低者 13.900677652
+六合彩 12.1089181827
+王八 9.5062284973
+先走一步 10.4349417492
+高科 8.50251495046
+民百 12.5143832909
+政法系统 12.2912397395
+弗尔 11.8212361103
+王兵 11.8212361103
+辞典 10.2630914922
+逐件 12.8020653633
+寻找机会 9.98865464655
+东盟自由贸易区 12.5143832909
+黄显声 13.2075304714
+王元 10.8561552143
+王允 10.642581114
+成败利钝 11.7034530746
+金融监管 8.71329184614
+怎不 10.2897597393
+王充 10.0088573539
+王兄 11.0674643079
+王克 12.2912397395
+王光 11.9547675029
+王先 13.900677652
+金明馆 12.2912397395
+表字 9.91169360541
+不可逆转 9.85762638414
+胡默 12.8020653633
+压水堆 10.2117981979
+闻名丧胆 13.900677652
+怒冲冲 10.642581114
+犯困 11.8212361103
+郧阳 9.31571017331
+眯上 11.7034530746
+干倒 13.900677652
+丁郎 13.900677652
+表音 11.1926274509
+中医医院 11.9547675029
+民瘼 12.2912397395
+饭囊 13.900677652
+泰勒展 13.900677652
+面无人色 10.3171587135
+架起 9.48183704418
+任亚琛 12.8020653633
+胡麻 9.53122979951
+王儿 12.5143832909
+汉奇 13.2075304714
+怎么 4.41962335578
+汉奸 8.27666014579
+总帐 11.598092559
+关满 12.8020653633
+复调 10.765183436
+饭团 11.1926274509
+金银铜铁 12.1089181827
+塑性体 13.2075304714
+珠兰 11.9547675029
+杨坚之 13.900677652
+李俊同 12.2912397395
+法槌 13.900677652
+扩张主义 10.0940151622
+价金 12.1089181827
+赫迪夫 13.2075304714
+猗顿 13.2075304714
+总师 13.900677652
+秦风 12.5143832909
+深入敌后 10.9049453784
+吉拉德 13.900677652
+派活 12.8020653633
+王僧 12.2912397395
+情报所 13.2075304714
+茶楼酒肆 13.2075304714
+拔刀相助 11.5027823792
+汉墓 9.03314320152
+胶乳 11.8212361103
+干净 6.94127913984
+马周 12.1089181827
+日死 11.4157710022
+发暗 11.0103058941
+董寅初 12.8020653633
+袭击战术 13.2075304714
+干凉 13.2075304714
+零利率 10.2117981979
+基金组织 10.533381822
+收有 10.4666904475
+发球线 12.8020653633
+收服 11.1280889297
+干出 9.77354326693
+于土石 13.900677652
+日常生活 7.85330547293
+传递函数 11.8212361103
+宋嬷嬷 12.5143832909
+宋德方 13.2075304714
+键值 13.900677652
+整除 10.5684731418
+婚姻关系 10.0088573539
+宇田道 13.2075304714
+伸出手 8.39534611604
+吹牛拍马 13.900677652
+收条 11.8212361103
+蛮横无理 11.9547675029
+以权谋私 10.765183436
+排阵 13.2075304714
+收来 10.4349417492
+摩擦角 12.1089181827
+低沉 8.80081122415
+王储 10.604840786
+牧区 8.44535653662
+两千余卷 13.2075304714
+石灰质 10.3743171274
+塞拉 9.74179456862
+金本位 11.5027823792
+两千多 9.82314020807
+背到 10.0088573539
+孙泰 12.8020653633
+胶丸 12.8020653633
+缩头缩脑 12.2912397395
+雨后春笋 10.0505300503
+唱主角 10.765183436
+千金之子 13.900677652
+教宗 12.2912397395
+汽车灯 13.900677652
+救护车 9.28555713513
+干冷 10.5684731418
+干冰 11.2616203224
+吉丁虫 12.8020653633
+越轻 12.1089181827
+英译本 10.9562386728
+金奉如 11.1926274509
+却静静 13.2075304714
+教室 8.31342899358
+乐果 11.5027823792
+七八千里 13.2075304714
+越轨 10.642581114
+醒过来 9.33632946051
+东海道 11.7034530746
+胶东 9.85762638414
+收束 11.5027823792
+眯住 13.900677652
+会阴部 10.765183436
+王健 10.9562386728
+加洛尔 13.2075304714
+言出必行 13.2075304714
+粗糙度 10.8096351986
+牧司 11.9547675029
+有利条件 8.63798746307
+停战线 13.2075304714
+教子 10.8561552143
+狗仗人势 12.2912397395
+总归 9.85762638414
+厨神 13.900677652
+白净净 13.900677652
+帕子揩 13.2075304714
+史诗剧 12.1089181827
+改正错误 11.1926274509
+一进到 12.5143832909
+教学 7.40390266179
+陈燕燕 12.5143832909
+怎会 9.46986085313
+左联遂 13.2075304714
+管内充 12.2912397395
+赣州 9.56994431169
+随风而逝 12.8020653633
+汉堡 9.12155415886
+闻过 12.1089181827
+倾箱倒箧 13.900677652
+马纹鎏 13.2075304714
+复赛 11.7034530746
+越远 9.29550746599
+加剂 13.900677652
+中国嘉陵 11.2616203224
+四五十万年 13.2075304714
+尼斯河 12.5143832909
+冷锻法 13.2075304714
+上中下游 11.3357282945
+东海郡 11.8212361103
+李俊唯 13.2075304714
+光灿灿 11.7034530746
+语方 12.8020653633
+杨春心 13.900677652
+疯长 10.6818018271
+元贵靡 12.5143832909
+轻生重义 13.2075304714
+越过 7.57990935773
+巳蛇 12.8020653633
+山茱萸 10.9049453784
+仰起 8.76487921493
+太英明 13.900677652
+街道绿化 13.900677652
+黑穗病 11.8212361103
+于麦克 13.2075304714
+旷世未 13.900677652
+蓝圆 11.9547675029
+财经界 12.1089181827
+龙虎豹 13.900677652
+蜕皮 10.0505300503
+马锡五 12.5143832909
+曲麻莱 13.2075304714
+克瑞翁 13.2075304714
+一致意见 9.91169360541
+古巴政府 11.598092559
+恩威并行 13.900677652
+汉官 9.54396882529
+石化工业 11.0674643079
+薛仁杲 13.2075304714
+空心砖 12.1089181827
+马都拉 11.3357282945
+明珠暗投 12.8020653633
+饭后 8.73019365694
+五倍子 10.3453295905
+表演区 12.5143832909
+晶体振荡 13.2075304714
+马列著作 12.8020653633
+王台 12.8020653633
+王号 11.9547675029
+州名 11.7034530746
+鬼神不测 12.8020653633
+阿卡什 11.8212361103
+汉宁 12.8020653633
+肃清残敌 13.2075304714
+敖顺 11.4157710022
+雷兽 12.1089181827
+刨除 13.2075304714
+越调 11.9547675029
+六百零六家 13.2075304714
+越狱犯 13.900677652
+太阳历 11.4157710022
+饭否 12.1089181827
+孙雯 12.8020653633
+床头 8.83808261895
+越谷 13.900677652
+大师赛 12.5143832909
+汉宫 11.1926274509
+水榭 10.5684731418
+工展会 13.900677652
+汉室 9.69598503258
+被歼 10.1164880181
+几曲 13.2075304714
+挑肥拣瘦 11.5027823792
+搬下来 11.7034530746
+富锦市 12.5143832909
+羞花闭月 13.2075304714
+郑白渠 12.1089181827
+腿走路 11.7034530746
+日校 12.8020653633
+性欲望 12.8020653633
+孙隆 10.2117981979
+猎鹿 13.2075304714
+四五十名 12.8020653633
+集锦式 13.900677652
+宠姬 11.4157710022
+非同寻常 9.91169360541
+风冷式 13.2075304714
+张德耀 12.1089181827
+纠纠武夫 13.2075304714
+抽查 9.59661255877
+水槽 11.0103058941
+型文法 13.900677652
+五七千里 13.900677652
+干劲 10.765183436
+赵成文 12.2912397395
+收摊 10.9049453784
+休宁 11.2616203224
+东南岸 10.3453295905
+兄妹俩 11.1926274509
+班朝贺 12.8020653633
+行易知难 13.900677652
+伏尔 12.2912397395
+太平广记 11.0103058941
+禄兀 13.2075304714
+哈默 11.598092559
+昨天夜里 9.43476953332
+吉拉尼 12.5143832909
+走走过场 12.1089181827
+德日意 12.8020653633
+臑会 13.900677652
+王印 11.7034530746
+休学 10.8561552143
+错号 13.900677652
+背出 11.3357282945
+子晚子 13.2075304714
+秦安媳妇 12.8020653633
+老前辈 10.3171587135
+协理员 12.8020653633
+叶方杉 13.900677652
+王升 12.8020653633
+妄用 12.8020653633
+移掉 13.900677652
+立陶宛共和国 12.8020653633
+能够 4.91736335858
+王华 11.8212361103
+柴燃 11.598092559
+敬贺 13.2075304714
+总局 8.57766767284
+王南 12.8020653633
+整门 13.900677652
+萧甬线 12.1089181827
+王博 12.1089181827
+富尔语 13.2075304714
+冲突点 13.2075304714
+王匡 10.9562386728
+架车 13.2075304714
+若干段 12.1089181827
+弯起来 13.2075304714
+汉子 7.69814213479
+照相术 11.1280889297
+寝具 12.5143832909
+汉字 8.0484751722
+伤亡 8.0600359946
+海月水母 12.5143832909
+李麦问 10.9049453784
+慈禧尝 13.900677652
+伤人 8.74162235276
+非关键 13.900677652
+阿尔尼姆 12.8020653633
+清晰性 12.5143832909
+主键 13.2075304714
+照相机 8.73019365694
+辐射计 11.4157710022
+日瓦戈 11.9547675029
+干制 11.3357282945
+搬来 9.33632946051
+绰绰有余 10.1394775363
+评比会 13.2075304714
+遛弯 13.900677652
+比萨 9.72629038208
+收操 11.9547675029
+谢亚龙 10.1394775363
+龙翔凤舞 12.8020653633
+能奇 12.8020653633
+王化 11.2616203224
+可操纵 11.8212361103
+是因为 5.88435975347
+汉学 9.62401153296
+狭窄 7.28193866846
+保安队 10.6818018271
+明斯克 10.5684731418
+太子妃 11.9547675029
+春闺 12.5143832909
+牧养 11.4157710022
+街坊 9.14708746087
+收支 8.83808261895
+提示牌 11.598092559
+于欣欣 10.9562386728
+复述 9.93038573842
+总工 9.87532596124
+立方体 10.4666904475
+陆家炳 11.0103058941
+教委 11.9547675029
+收放 10.4349417492
+陈翰伯 13.2075304714
+王勇 10.0940151622
+绰号 8.5488195185
+半包围 13.2075304714
+双睛红 13.2075304714
+弗德 11.2616203224
+复返 11.598092559
+卵质 11.8212361103
+地下通道 10.7226238216
+元谋县 10.9562386728
+孙韶 12.5143832909
+装卸桥 13.2075304714
+有铁粉 13.2075304714
+海城镇 12.5143832909
+武庚北 13.2075304714
+实出无奈 12.8020653633
+总产量 8.18694484647
+乐施 13.2075304714
+碗儿 12.5143832909
+马哈 11.7034530746
+四神丸 12.2912397395
+平板车 11.0674643079
+军心涣散 11.9547675029
+背债 13.900677652
+宾至如归 12.8020653633
+黄酮醇 13.900677652
+分花拂柳 13.900677652
+收效 9.84023464143
+喘喘气 12.2912397395
+奥克森菲 13.2075304714
+伐木区 12.8020653633
+获得性 10.3171587135
+募款 12.8020653633
+人头费 11.9547675029
+威重令行 13.2075304714
+遗传学家 10.2897597393
+王力 10.9049453784
+隶属于 8.23425096386
+高纯度 10.604840786
+收敛 8.06586691491
+王功 13.2075304714
+贾湖 11.9547675029
+布莱松 12.8020653633
+庙儿沟 12.8020653633
+史丹福 11.7034530746
+吸收剂量 12.5143832909
+汉娜 12.8020653633
+水栖 10.3743171274
+复转 11.5027823792
+甜品 11.2616203224
+选录 10.1394775363
+黑松岩 12.8020653633
+至关紧要 11.598092559
+假戏真做 11.7034530746
+孙静 11.4157710022
+干草堆 13.2075304714
+采蛋 9.48183704418
+无穷动 13.2075304714
+汉威 9.33632946051
+辣辣的 11.9547675029
+一点很多 13.900677652
+变黏 13.900677652
+收文 11.9547675029
+水样 10.1630080337
+带动性 12.1089181827
+集装箱运输 10.4994802703
+王剑 11.2616203224
+化合物 7.05055148583
+证监局 8.67493097826
+游牧部落 9.87532596124
+仅仅只是 9.5186510173
+教女 13.900677652
+不积跬步 13.2075304714
+牧凉 13.2075304714
+中华全国集邮联合会 13.900677652
+何广沂 13.2075304714
+哈龙 13.2075304714
+表链 13.900677652
+七巧板 11.8212361103
+宣赞可 12.5143832909
+王利 13.900677652
+符合国家 9.7898037878
+建立联系 10.3171587135
+链增长 11.8212361103
+本报记者 7.16015829237
+中西方 11.2616203224
+街垒 11.1926274509
+历史记录 10.1164880181
+挖地道 11.9547675029
+民用 8.30225569298
+车务段 13.900677652
+尚书省 9.19114745066
+尼亚斯 13.900677652
+水桶 9.13850371718
+诸葛丞相 11.3357282945
+美国驻华大使馆 11.9547675029
+宗初亦 12.5143832909
+民生 7.19994654243
+整钱 12.5143832909
+三千五千 12.1089181827
+疥癣之疾 13.900677652
+两千家 12.8020653633
+王刚 10.5684731418
+王则 12.8020653633
+王刘 11.8212361103
+赫西 13.900677652
+家庭解体 12.8020653633
+班驳 13.900677652
+淡季 8.71889410168
+推推揉揉 13.900677652
+言邓艾 12.8020653633
+飞虎 9.65218240993
+一似 10.3171587135
+米丘林 12.5143832909
+胡马 11.3357282945
+塞林 11.5027823792
+戴复古 12.2912397395
+干品 11.5027823792
+报到率 13.2075304714
+光利 10.8561552143
+中革军委 13.2075304714
+力所能及 10.2897597393
+哈顿 13.2075304714
+成长率 10.8561552143
+方克勤 13.900677652
+渠导荥 13.2075304714
+收成 9.13850371718
+干哥 12.2912397395
+调移 13.900677652
+能征 12.1089181827
+罪恶贯盈 13.2075304714
+二度梅 12.1089181827
+干哭 12.5143832909
+埃及政府 11.5027823792
+年度计划 11.0674643079
+布松公 13.2075304714
+教廷 9.5062284973
+恨死 10.3453295905
+汉川 10.604840786
+塞尔马 13.900677652
+收执 12.2912397395
+陡然间 10.4666904475
+溜出去 11.3357282945
+法海 11.7034530746
+逼出 11.2616203224
+富尔贝 11.598092559
+脱涩法 13.900677652
+阳关 10.0940151622
+背地 11.9547675029
+启动市场 12.2912397395
+胡子昂 12.8020653633
+膏状 11.1280889297
+琉璃 8.9308643524
+罗定市 13.900677652
+径流系数 11.2616203224
+扦插 9.89334446674
+双胞胎 9.96885201925
+统计数据 7.11962002604
+干咳 9.75754292558
+日清 12.8020653633
+养精蓄锐 10.5684731418
+伏威 12.1089181827
+唐武德 9.54396882529
+演唱 8.28390655431
+伊格尔 12.5143832909
+李大齐 13.900677652
+写书人 13.900677652
+比帕夏 12.5143832909
+良苦用心 11.0674643079
+日渐 7.82533162089
+王喜 9.37888907493
+干呕 11.0674643079
+拆去 11.3357282945
+经典之作 10.4349417492
+收报 7.70219893548
+安徒生 10.604840786
+叶盛章 12.5143832909
+噙着 9.22784881751
+苹果酱 12.5143832909
+胡髭 13.900677652
+加速上扬 10.2117981979
+潺潺 9.7898037878
+伯罗奔 12.5143832909
+贺圣寿 12.8020653633
+水漂 10.8561552143
+世界末日 10.0088573539
+刘新华 9.36807815882
+鹭鹚 13.900677652
+用武 11.2616203224
+加载 10.0294766411
+达维多维奇 13.900677652
+水漱 12.5143832909
+女主播 12.8020653633
+飞虫 10.4349417492
+能开 10.8561552143
+一举两全 13.900677652
+奋力 8.50251495046
+乐手 11.7034530746
+被淹 10.3743171274
+含嘉 11.4157710022
+迪耶普 13.2075304714
+那甜甜 12.8020653633
+教师 7.19381531537
+收拢 9.72629038208
+苏马 12.2912397395
+乐户 11.598092559
+千里马 10.642581114
+速战速决 10.604840786
+赵超构 12.8020653633
+刘迎胜 12.5143832909
+有机氯 11.3357282945
+丁特起 10.8561552143
+涌起 9.48183704418
+滁州市 11.5027823792
+琉球 10.642581114
+高盛集团 9.75754292558
+收拾 6.59280487121
+于夷陵 12.5143832909
+诺丁汉大学 13.900677652
+瑞典人 10.7226238216
+诸笔伐 13.900677652
+南海舰队 9.96885201925
+奋勉 13.900677652
+董希文 12.1089181827
+东床娇婿 13.900677652
+纽约州 9.5062284973
+英王室 11.8212361103
+敬天鉴 13.2075304714
+吕布分 13.2075304714
+水潭 9.61021821083
+民爆 10.2630914922
+倒街卧巷 13.900677652
+肉墩墩 12.8020653633
+自我知觉 12.8020653633
+减速运动 12.8020653633
+奥罗莫 12.5143832909
+高速旋转 10.4994802703
+梅宁迪 13.2075304714
+风梨 13.900677652
+临危受命 11.0674643079
+桑麻 11.2616203224
+巴伦坦 12.2912397395
+解放军报社 13.2075304714
+一百二十股 13.2075304714
+水源 7.6165434909
+守正不阿 13.2075304714
+兴安岭 10.7226238216
+亚细安 12.5143832909
+张亮基 12.8020653633
+坚决拥护 11.2616203224
+雷西亚 12.8020653633
+省际 10.765183436
+未整理 13.2075304714
+酩酊 12.5143832909
+成邦江 13.2075304714
+超现实 11.8212361103
+渠蒙逊 10.7226238216
+复视 11.598092559
+雷动 11.9547675029
+杨指 13.2075304714
+挖苦 9.36807815882
+痛击 11.0103058941
+四伏 11.9547675029
+床帷 13.900677652
+蒙兀室韦 11.8212361103
+爱出风头 12.5143832909
+崔世珍 13.2075304714
+床席 12.2912397395
+调和油 10.4041700905
+阿波利 12.8020653633
+臭事 12.5143832909
+层板 12.5143832909
+丰华 12.8020653633
+石秀都 12.5143832909
+察核 13.900677652
+温旨慰 13.2075304714
+金秀瑶族自治县 11.8212361103
+四百多万 12.8020653633
+牧地 9.55687223012
+德干高原 11.1926274509
+牧场 8.17709255002
+收据 10.0294766411
+两百余处 13.2075304714
+接待室 11.1926274509
+防御工事 9.7898037878
+赫连 10.1164880181
+教得 11.3357282945
+重新犯罪 11.9547675029
+差异化 8.85082164473
+倚势凌人 13.900677652
+经互会 11.9547675029
+区雄楚 13.900677652
+水滴 9.33632946051
+四百多个 12.8020653633
+方得通 13.900677652
+固若金汤 11.3357282945
+雌雄异体 9.61021821083
+多洛雷斯 12.8020653633
+拐到 10.9562386728
+很久没 9.75754292558
+水滨 12.2912397395
+怪事 9.23723855786
+节约资源 11.0674643079
+传闻失实 13.900677652
+备注栏 12.1089181827
+七百多 11.8212361103
+医学系 11.5027823792
+长生不死 10.0940151622
+水满 11.7034530746
+饭厅 11.1926274509
+兰坪白族普米族自治县 13.2075304714
+岩穴之士 13.2075304714
+曲周县 12.8020653633
+偏东南 13.2075304714
+床底 12.1089181827
+逼债 11.7034530746
+逍遥镇 12.8020653633
+莫问前程 13.2075304714
+老住户 12.5143832909
+卢受封 12.8020653633
+水渍 11.5027823792
+三教九流 10.3453295905
+价钱 8.05713323494
+李俊兴 13.900677652
+张柔领 12.8020653633
+基加利 11.9547675029
+水清 10.8561552143
+王命 10.2897597393
+汉将 10.7226238216
+盐度计 12.5143832909
+乐捐 13.900677652
+选好 9.91169360541
+州县 8.66956903512
+收授 13.2075304714
+收掉 13.2075304714
+童子试 12.1089181827
+马蹄莲 12.5143832909
+拉巴尼 12.8020653633
+投于 11.1280889297
+明斯基 11.8212361103
+安德烈亚 12.5143832909
+水渠 10.1164880181
+叫床 13.900677652
+哇呀呀 13.2075304714
+居维叶 11.2616203224
+北半部 10.642581114
+远方来 11.8212361103
+王含 12.2912397395
+殷夫 12.2912397395
+王启 11.5027823792
+炒鸡蛋 10.6818018271
+里勾外连 13.900677652
+格鲁西 12.1089181827
+层析 11.1926274509
+绥远战役 13.2075304714
+嗖嗖 9.98865464655
+王吴 13.2075304714
+郎甲 12.5143832909
+毛袜 13.900677652
+趋光性 10.5684731418
+收揽 10.5684731418
+都乐岩 12.8020653633
+水湾 11.7034530746
+水湿 10.0720362555
+公测版 13.2075304714
+伏安 11.4157710022
+越说 9.5062284973
+亲兄弟 9.93038573842
+王后 9.34680076038
+王名 11.3357282945
+越语 12.5143832909
+奋发 10.1871055853
+耍心眼 13.2075304714
+党内外 10.3453295905
+王君 11.9547675029
+渭源县 11.8212361103
+往南方 12.2912397395
+医学类 13.900677652
+宋景诗 11.8212361103
+系统文件 12.5143832909
+水涝 11.598092559
+普列高 12.5143832909
+毕尔腾 12.8020653633
+封蒙 13.900677652
+水涌 11.598092559
+采花 10.604840786
+书报杂志 13.2075304714
+同步化 13.2075304714
+谈今论古 13.2075304714
+胡须 8.46259834305
+架设 8.7245279194
+塞文 12.8020653633
+拈须 10.5684731418
+海协会 12.5143832909
+破庙 9.80633308975
+助理员 11.7034530746
+漫游者 12.8020653633
+领海权 13.2075304714
+水涯 12.8020653633
+吉尔吉斯斯坦共和国 12.8020653633
+哈马 11.9547675029
+塞斯 11.5027823792
+之日起 7.73316116109
+两千年 9.89334446674
+聚结 12.5143832909
+都拥立 13.2075304714
+洛斯特 13.900677652
+玛塔 12.8020653633
+昂藏 13.900677652
+汉志 11.1926274509
+水淋 11.8212361103
+塞族 12.8020653633
+外国货 12.1089181827
+干嚎 11.2616203224
+敛衽 11.9547675029
+局部性 10.3453295905
+中非金融合作法郎 12.8020653633
+吸湿性 10.4349417492
+鱼种 11.0103058941
+三纵两横 13.2075304714
+玉林市 11.9547675029
+休得 9.10488710638
+水淹 9.71102290995
+瓮中之鳖 11.598092559
+塔蓬博 12.5143832909
+太阳城 11.9547675029
+决胜千里 11.7034530746
+掏槽 13.900677652
+于京畿 12.8020653633
+光感受器 11.8212361103
+苏飞 12.5143832909
+抢来抢去 13.900677652
+塔格特 13.2075304714
+涌进 9.62401153296
+秦鹏 10.4994802703
+水洞 9.91169360541
+蜜罐 12.8020653633
+膏火 13.900677652
+广州日报 8.85725253506
+凝眉 12.8020653633
+咪康唑 12.1089181827
+调和漆 13.900677652
+眠花卧柳 13.2075304714
+水洒 12.1089181827
+负责制 10.0294766411
+新文化 10.3453295905
+咨询业 13.2075304714
+异戊二烯 10.642581114
+魏有司 13.2075304714
+狭缝 11.1280889297
+伊甸园 10.7226238216
+麦秋 12.5143832909
+竭智尽力 13.2075304714
+宠大 13.2075304714
+水洼 10.4349417492
+扬眉吐气 10.1164880181
+丹波哲郎 13.2075304714
+晕沉沉 12.2912397395
+收悉 12.1089181827
+却说 6.47950012338
+特洛克 12.8020653633
+一万左右 13.2075304714
+胡风 10.8096351986
+敌我矛盾 11.4157710022
+王坚 10.5684731418
+硅谷 9.74179456862
+归总 12.5143832909
+张葛许 12.8020653633
+米尔佛 13.2075304714
+王圣 12.5143832909
+对应物 12.8020653633
+儒学家 12.5143832909
+着恼 10.533381822
+县属 10.9049453784
+功法 10.8096351986
+分外妖娆 12.5143832909
+刘全 11.4157710022
+干嘛 9.25628675283
+痛切 10.642581114
+李青松 13.900677652
+鲁朵制 12.2912397395
+便利性 10.2117981979
+麦种 10.8096351986
+长台 13.2075304714
+水浅 10.0940151622
+表演赛 11.1280889297
+塌鼻 12.8020653633
+大异其趣 12.2912397395
+交友 10.2371160058
+年俗 13.900677652
+实到 13.2075304714
+细大不捐 12.8020653633
+徐蓉 13.900677652
+玲玲 12.1089181827
+水浸 10.1630080337
+淡妆 11.1926274509
+挎着 9.84023464143
+水浴 11.4157710022
+刘六 12.2912397395
+中央民族乐团 12.5143832909
+同仁堂 10.4666904475
+级数解 12.8020653633
+姚两 12.8020653633
+胡颓 12.1089181827
+几经周折 10.765183436
+犯傻 11.3357282945
+加农 11.4157710022
+表里 9.54396882529
+龙画凤 13.2075304714
+腰身 9.94943393339
+三潭印月 11.1926274509
+王土 11.5027823792
+蓝光高 13.900677652
+熊雨殷 12.2912397395
+派款 13.2075304714
+水沙 11.4157710022
+玛多 12.2912397395
+散荡 13.900677652
+王园 12.5143832909
+双水翼 13.2075304714
+复诵 12.2912397395
+新快报 9.59661255877
+龟鉴 13.2075304714
+干城 10.9562386728
+复课 12.5143832909
+复读 11.1280889297
+选对 10.4994802703
+复评 13.900677652
+盒盖 10.9049453784
+水沸 12.8020653633
+复词 12.2912397395
+喀秋莎 11.598092559
+水河 10.3743171274
+复诊 12.5143832909
+复试 11.9547675029
+青年辅导 13.2075304714
+纽约市 9.77354326693
+层数 11.3357282945
+水沫 11.7034530746
+北白川 13.900677652
+法渊 13.2075304714
+王四 9.80633308975
+纳希切 13.900677652
+拒签 11.2616203224
+十数招 13.900677652
+丁基正 13.900677652
+王嬷嬷 13.900677652
+伏天 10.604840786
+复训 13.900677652
+复议 10.2630914922
+撒下去 12.8020653633
+莱州 10.2897597393
+水泊 10.4349417492
+水泉 11.598092559
+武器展 13.900677652
+水泄 12.2912397395
+休庭 11.9547675029
+孙淳 12.8020653633
+妆饰 10.7226238216
+水泼 11.598092559
+盛果期 12.5143832909
+水泻 13.2075304714
+折冲尊俎 12.8020653633
+咨询电话 9.26594866375
+训练有素 9.5186510173
+加兰 11.9547675029
+汉廷 11.5027823792
+核算 9.19114745066
+单歧藻 12.8020653633
+伐木场 13.900677652
+凄绝 11.8212361103
+钞本 11.0674643079
+政见 9.74179456862
+水注 11.9547675029
+背向 10.4041700905
+大头针 12.8020653633
+水泥 6.83506428838
+水波 9.48183704418
+多任务 11.4157710022
+水泡 9.23723855786
+新老用户 13.2075304714
+汉帝 10.9562386728
+幕阜山脉 11.598092559
+逼到 10.3743171274
+光变 10.765183436
+文艺片 12.8020653633
+水气 9.30555780184
+才貌双全 11.5027823792
+选字 13.900677652
+吕布入 12.8020653633
+诸位先生 11.0674643079
+宁死不辱 11.8212361103
+新家园 13.2075304714
+越要 10.0088573539
+阿加尼亚 12.5143832909
+七行诗 13.900677652
+街口 9.62401153296
+硅质 9.72629038208
+徐才厚 12.5143832909
+干坤 10.4666904475
+双折射 10.533381822
+驾车 8.59737274392
+整部 10.4041700905
+能力差异 12.8020653633
+赤子之心 11.4157710022
+张阁 13.900677652
+橘子汁 12.8020653633
+选学 12.5143832909
+如诉如泣 13.900677652
+拈香 10.2897597393
+行万里路 12.8020653633
+干土 11.4157710022
+顺利进行 9.30555780184
+多难兴邦 13.900677652
+换气扇 12.1089181827
+巴波亚 13.900677652
+埃托奥 12.8020653633
+秋香色 12.2912397395
+卡兰加 13.2075304714
+昂立 12.5143832909
+万有引力 9.59661255877
+马歇尔 9.4233408375
+供过于求 9.84023464143
+水汽 9.20019728618
+黄羊 9.98865464655
+海南出版社 13.900677652
+赫赫 10.1164880181
+灵武 9.93038573842
+王嘉 12.5143832909
+普罗提诺 12.2912397395
+乐感 12.1089181827
+醋坛子 12.1089181827
+污染监测 11.9547675029
+扭断 12.1089181827
+休市 8.9308643524
+心不死 11.1926274509
+事已至此 9.71102290995
+太平鼓 12.1089181827
+接待处 11.3357282945
+乐意 8.87679713113
+水池 9.31571017331
+接待国 13.900677652
+寻进礼 13.2075304714
+汉军 8.86372504956
+原子序 12.8020653633
+旅程 9.65218240993
+挖过 13.2075304714
+总图 11.4157710022
+圆括号 10.9562386728
+王姬 13.900677652
+六角亭 12.8020653633
+烘炉 12.5143832909
+对数定律 13.2075304714
+合影留念 11.598092559
+风流潇洒 11.4157710022
+州市 11.3357282945
+武器化 12.2912397395
+卡拉巴尔 13.2075304714
+塔拉曼 13.900677652
+热当量 13.900677652
+长句 13.900677652
+收清 13.900677652
+西小方 12.8020653633
+质量体系 11.9547675029
+永结同心 13.900677652
+酒醒 10.1394775363
+法意 11.2616203224
+王姐 13.900677652
+一百次 11.8212361103
+日托 13.2075304714
+背子 11.5027823792
+经度 9.62401153296
+副将 8.42003872863
+新太科技 10.6818018271
+易弓矢 13.2075304714
+未成年 9.71102290995
+王姝 13.2075304714
+主体工程 10.533381822
+床单 9.66657114738
+激素水平 10.642581114
+圜丘 11.3357282945
+吕萨克 11.0674643079
+对话者 12.5143832909
+三十三天 11.598092559
+混合经济 10.7226238216
+碘仿 13.900677652
+茅茅 11.8212361103
+香涛 12.8020653633
+手足癣 13.2075304714
+张柔镇 12.8020653633
+掌财赋 13.2075304714
+海军陆战队 8.44535653662
+两栖纲 11.9547675029
+王妃 9.5186510173
+王如 13.900677652
+镂空雕 13.2075304714
+能取 12.8020653633
+红灯笼 10.6818018271
+英国利兹大学 13.2075304714
+东扯西拉 13.2075304714
+教务 10.2371160058
+怀旧感 13.900677652
+人才出众 13.2075304714
+七百名 13.2075304714
+溜出来 11.2616203224
+能变 11.4157710022
+顿消 12.8020653633
+秦遂 12.8020653633
+啊啊啊 12.8020653633
+告急 9.13850371718
+不成话 11.1926274509
+张耀光 11.4157710022
+能及 10.7226238216
+惦记 9.58318953844
+饭庄 10.642581114
+李元礼 13.2075304714
+牛排 10.2630914922
+四亿 13.900677652
+休养 9.23723855786
+汉儒 11.2616203224
+厨灶 13.2075304714
+键入 11.2616203224
+吴阶平 12.8020653633
+普罗文 11.9547675029
+刺刺 11.3357282945
+船长室 10.9562386728
+腰背 10.4041700905
+背对 10.8561552143
+收齐 12.1089181827
+涨钱 13.2075304714
+汉儿 8.91707103027
+可支配 9.06439574502
+谢灵运 10.8096351986
+湛江市 10.4666904475
+北京市高级人民法院 11.7034530746
+撤回去 11.5027823792
+豆面 11.8212361103
+大甸子 12.5143832909
+尹楷 13.2075304714
+太平道 11.5027823792
+休克 8.63281949291
+上周二 9.53122979951
+腰胯 11.1926274509
+塞尔杜 13.900677652
+相接处 12.8020653633
+小长山 13.900677652
+溆浦 11.9547675029
+窑子 9.69598503258
+王夫 13.900677652
+王天 10.604840786
+秦都 11.4157710022
+衣阿华 13.2075304714
+汉光 13.2075304714
+驻防军 12.8020653633
+千秋伟业 12.8020653633
+幡然 11.8212361103
+看不出来 8.81927328699
+不正之风 10.642581114
+尼龙线 13.900677652
+电工材料 12.2912397395
+复萌 12.1089181827
+汉兵 10.9562386728
+汉兴 10.9049453784
+王复 12.1089181827
+苏陀 13.2075304714
+真溶液 11.9547675029
+东医寿 12.8020653633
+嗲得 13.2075304714
+乐清 10.642581114
+教到 13.2075304714
+林圭 11.598092559
+借花献佛 11.7034530746
+超额利润 8.96620371885
+教友 11.0103058941
+干姐 11.9547675029
+圆形动物 13.2075304714
+专栏作家 11.0674643079
+伏坦 12.2912397395
+不相上下 9.85762638414
+两千元 10.8096351986
+成功经验 9.75754292558
+独弦琴 13.2075304714
+专题史 13.2075304714
+北京大学国际政治系 13.2075304714
+习小乘 13.2075304714
+乌斯带 12.2912397395
+法儿真 13.900677652
+蔚县 9.94943393339
+能动 9.26594866375
+易读性 13.2075304714
+男艺人 13.900677652
+两千八 13.900677652
+牧子 12.2912397395
+颔首 9.69598503258
+万寿寺 12.8020653633
+告慰 11.2616203224
+能力 4.93534307817
+睁大眼睛 9.16447920358
+内江市 11.7034530746
+吕布必 11.9547675029
+量才录用 12.2912397395
+承德避暑山庄 10.8096351986
+康复训练 12.2912397395
+事实上 6.12834607681
+展览会 9.25628675283
+神恩利 12.8020653633
+排列五 13.900677652
+克森 13.900677652
+锦州湾 13.2075304714
+玄鸟 10.9562386728
+铸下 12.5143832909
+散财 12.1089181827
+塑性变形 10.1871055853
+太子参 12.5143832909
+散货 10.4994802703
+神农架 10.2630914922
+胡柯 12.5143832909
+惊吓 8.9308643524
+凶狠残暴 12.5143832909
+干妈 10.2630914922
+敢于创新 12.2912397395
+填土 11.0674643079
+伏地 9.33632946051
+宋庆龄基金会 11.8212361103
+层次 7.57452817882
+城门口 10.4666904475
+体检 8.25877058104
+白玉盒子 13.900677652
+二十一日 9.93038573842
+干妹 12.8020653633
+独到见解 10.2897597393
+活动分子 12.1089181827
+胡霖 13.900677652
+龙超科 13.2075304714
+淫贼 13.900677652
+碰杯 10.5684731418
+贝伦斯 12.8020653633
+全国运动会 10.604840786
+减退症 12.8020653633
+能到 9.89334446674
+水战 10.3453295905
+峥峥 12.1089181827
+扭捏作态 13.2075304714
+功德圆满 12.2912397395
+竹地板 13.2075304714
+柳折花残 13.900677652
+派斯 12.1089181827
+坐标值 13.2075304714
+中邪 12.2912397395
+天造地设 12.1089181827
+工部 8.65365357982
+聚硅酸盐 13.900677652
+建筑物 7.38153036404
+水房 11.7034530746
+苏霍 12.2912397395
+多里斯 12.8020653633
+曱甴 13.900677652
+怆然 10.9049453784
+总坛 12.8020653633
+水户 12.2912397395
+戈亚斯 13.2075304714
+赫茨 12.1089181827
+十八尊 12.2912397395
+人口减少 10.8561552143
+再就是 9.48183704418
+街巷 8.81308131674
+敖鲁 13.2075304714
+文艺类 13.900677652
+巴吉尔米 11.8212361103
+奔劳 13.900677652
+价额 12.8020653633
+四群 13.2075304714
+月明楼 13.900677652
+管制权 13.2075304714
+谁又能 9.61021821083
+松门山 12.2912397395
+总场 12.5143832909
+引水渠 10.9049453784
+拿贼拿赃 13.900677652
+武装部 11.1926274509
+高斯定理 11.0103058941
+能剧 12.5143832909
+崔判官 11.598092559
+水手 8.69119149913
+嗦嗦 11.7034530746
+逃路 12.8020653633
+日中则昃 13.900677652
+总在 9.26594866375
+严重错误 10.7226238216
+教化 9.34680076038
+赴难 11.9547675029
+罗定县 13.900677652
+吕布引 12.5143832909
+缘何 9.58318953844
+淡水区 11.7034530746
+洪宪元 12.1089181827
+十七点七 13.900677652
+共同利益 9.80633308975
+苏非 10.533381822
+初一学生 12.5143832909
+教区 9.55687223012
+奋志 13.2075304714
+自作多情 11.0103058941
+曾遇异 13.2075304714
+加莱拉 12.8020653633
+气不过 10.8561552143
+给排水 11.0674643079
+里瓦斯 12.8020653633
+牧守 10.9562386728
+小组第一 12.5143832909
+日息 12.2912397395
+蓝图 9.4233408375
+谑称 12.8020653633
+沙孟海 12.1089181827
+马令旨 13.2075304714
+上有天堂 12.8020653633
+太阳宫 13.900677652
+硫胺素 11.8212361103
+梁冰玉 8.89004235788
+被捕 7.66430806177
+王寻 12.5143832909
+王寺 13.900677652
+王寿 13.900677652
+面巾 11.8212361103
+王导 10.3453295905
+逼得 9.05649056552
+反常现象 11.0674643079
+第二十八款 13.2075304714
+早作 10.9049453784
+王寅 12.2912397395
+黄河旋风 13.900677652
+奠下 12.2912397395
+痰迹 13.900677652
+可不是 7.50541605386
+高效快捷 12.8020653633
+挖路 13.900677652
+沅江市 13.2075304714
+曹丕之 12.8020653633
+罗桑嘉 13.2075304714
+硅肺 11.2616203224
+戏弄着 12.5143832909
+王宣 13.2075304714
+八十多岁 11.1926274509
+饭局 10.4666904475
+焦虑不安 10.5684731418
+王宫 8.52078029844
+一举两得 10.4349417492
+萨托利 13.900677652
+告成 10.2630914922
+可维护性 12.1089181827
+意面 13.900677652
+荷兰语 10.9049453784
+潜伏着 10.604840786
+王家 8.89004235788
+何许人也 11.2616203224
+颂赞 11.8212361103
+种猪 11.8212361103
+立身处世 11.5027823792
+王宾 13.900677652
+膏粱 11.5027823792
+思贤如渴 12.5143832909
+王宁 11.0103058941
+成安 12.2912397395
+王宇 11.2616203224
+长江局 10.8561552143
+赫胥 13.2075304714
+清平乐 12.8020653633
+綦毋怀 13.2075304714
+王安 10.8561552143
+床具 12.5143832909
+王宏 11.1926274509
+苏铁 10.4041700905
+实在论 10.6818018271
+王宗 10.604840786
+典型示范 11.9547675029
+宋重修 12.8020653633
+王定 12.2912397395
+侃侃而谈 10.0088573539
+王官 12.5143832909
+絮语 11.598092559
+普天率土 13.900677652
+总和 7.89926277401
+王季 13.2075304714
+水感 13.2075304714
+以色列 7.60541165054
+千万锭 12.8020653633
+王学 11.0674643079
+孙鹏 12.5143832909
+类风湿病 13.900677652
+历阳 11.1280889297
+胡铨 12.5143832909
+拍卖会 9.84023464143
+碰撞 8.05423887692
+马善 12.8020653633
+汉化 9.5062284973
+乐池 12.1089181827
+日惹 11.598092559
+旱区 12.5143832909
+两栖类 9.34680076038
+收油 12.5143832909
+收治 10.2117981979
+龋齿 10.2371160058
+胡链 13.900677652
+汉医 12.5143832909
+香灼 13.900677652
+接待员 12.8020653633
+活不了 10.3171587135
+若山 12.8020653633
+哈雷 9.54396882529
+社会心理学 10.3743171274
+镜记 12.2912397395
+挖走 10.642581114
+王子 8.12923652885
+朱敏 13.900677652
+壁挂炉 10.3453295905
+人文景观 10.9562386728
+王存 11.8212361103
+通守郭 13.2075304714
+苏来 13.900677652
+王孝 12.1089181827
+九九表 12.8020653633
+海空军 10.4349417492
+胡钧 13.2075304714
+苗贲皇 12.8020653633
+间或 9.17328983326
+锡盟 12.2912397395
+三线放松 13.900677652
+汉南 12.1089181827
+炸毁 9.32596667347
+兼性离子 13.900677652
+级新生 13.900677652
+兵荒马乱 9.35738286971
+干娃 12.2912397395
+汉十 13.900677652
+总吨 12.2912397395
+哈隆 12.8020653633
+复电 12.2912397395
+腰花 12.8020653633
+被控 10.1871055853
+汉卿 12.2912397395
+苏松 11.4157710022
+汉印 11.8212361103
+区政府 9.53122979951
+盖以文 13.2075304714
+吕布射 12.8020653633
+抚掌大笑 11.5027823792
+阿维斯 13.2075304714
+汉卡 12.8020653633
+总合 12.8020653633
+总后 11.5027823792
+谷类作物 11.0103058941
+发信号 11.5027823792
+牧奴 12.8020653633
+牧女 11.9547675029
+万寿宫 11.9547675029
+干寒 11.0103058941
+拉诺卡 13.900677652
+勾勾搭搭 11.8212361103
+机关大院 12.5143832909
+美国微软公司 13.2075304714
+延续下去 10.0294766411
+痛心 8.7245279194
+斯维特 12.8020653633
+淡味 12.5143832909
+钉下去 13.900677652
+收活 13.900677652
+毛枝藻 13.2075304714
+张旭东 13.2075304714
+秋处露 13.2075304714
+被扣 10.4041700905
+硕彦 13.900677652
+王耀武 12.1089181827
+王允坚 13.900677652
+拍卖人 13.900677652
+鼓乐 9.01032852375
+教出 12.5143832909
+风华绝代 12.2912397395
+痛快 7.8161782389
+苏杰 13.2075304714
+两千余处 13.2075304714
+水患 10.0294766411
+粑粑 12.1089181827
+动画版 13.900677652
+采暖炉 12.1089181827
+痛得 9.98865464655
+封其僧 13.2075304714
+打毛衣 13.900677652
+苏门 10.4349417492
+干宝 11.5027823792
+动画片 10.0505300503
+选型 10.8096351986
+失之偏颇 12.8020653633
+分泌量 10.9562386728
+遗传因子 11.2616203224
+干完 10.0088573539
+法执 13.900677652
+水情 10.642581114
+国际乒联 12.8020653633
+派来 8.56313957227
+喘振 13.2075304714
+马汝珩 11.7034530746
+扎上 11.8212361103
+扎下 10.0294766411
+怜贫惜老 12.8020653633
+拍卖价 12.2912397395
+屏蔽器 13.900677652
+应用卫星 11.9547675029
+安新县 12.5143832909
+敖闰 12.1089181827
+一心一德 12.2912397395
+早下 11.9547675029
+塔拉斯 11.7034530746
+剖决如流 13.900677652
+间接 7.09384829158
+衣香鬓影 13.2075304714
+高出一筹 11.7034530746
+贝氏立 13.900677652
+政纪处分 12.2912397395
+表演者 11.0103058941
+韩德勤 12.8020653633
+干子 12.2912397395
+拍卖业 12.8020653633
+于广德 13.2075304714
+生命统计 13.2075304714
+扭摆 11.598092559
+乐浪 10.9049453784
+选址 8.96620371885
+总参谋部 9.87532596124
+偏激 9.87532596124
+早以 12.5143832909
+宠幸 10.2117981979
+就业率 10.0940151622
+土风舞 13.2075304714
+王婆 9.32596667347
+痛彻 11.1926274509
+政策 4.52567065844
+能借 13.900677652
+散过 13.2075304714
+乍浦港 13.2075304714
+金斯敦 10.9562386728
+教养 9.18217878068
+哈韩 12.8020653633
+水怪 11.2616203224
+总商 11.7034530746
+李家店 13.2075304714
+干季 10.1871055853
+万国权 13.900677652
+水性 8.80081122415
+第三十二章 10.9049453784
+教具 11.598092559
+寓言诗 12.8020653633
+自配 13.900677652
+防病治病 11.7034530746
+一惊 6.88048694366
+皮斯卡 12.2912397395
+那僧笑 12.5143832909
+太子党 13.900677652
+居留 9.94943393339
+回转头 11.5027823792
+御者 12.5143832909
+梵蒂冈 9.98865464655
+早产 9.77354326693
+以利于 9.71102290995
+早些 8.90346537821
+选场 13.2075304714
+特种行业 13.2075304714
+品学兼优 11.598092559
+潘光旦 11.8212361103
+二十一条 10.0940151622
+财经网 9.45802639549
+李大郎 13.2075304714
+阴柔气 13.900677652
+胡果 12.8020653633
+景帝遂 13.2075304714
+法拉 9.85762638414
+非磁性 13.2075304714
+遗憾终身 13.900677652
+早于 9.26594866375
+休刊 12.8020653633
+汉剧 10.9562386728
+价高 10.604840786
+榴弹炮 8.86372504956
+流亡国外 9.69598503258
+程序逻辑 13.2075304714
+土井 12.2912397395
+降价求售 13.900677652
+布吕尔 13.2075304714
+本少爷 13.900677652
+背影 7.96050639926
+釜中之鱼 13.900677652
+日晷 10.7226238216
+宣赞尽 12.8020653633
+六万五千美元 13.2075304714
+斯特蒂 12.2912397395
+综合部 13.2075304714
+王四同 13.2075304714
+晋封懿 13.900677652
+土人 9.55687223012
+甘州卫 12.2912397395
+教团 10.4666904475
+何香凝 10.8096351986
+王巍 12.5143832909
+得道成仙 11.8212361103
+苦海无边 11.7034530746
+操演 10.0940151622
+渊薮 11.2616203224
+健康成长 9.77354326693
+水枪 10.765183436
+日晕 12.2912397395
+玛利 11.8212361103
+阿古斯塔 13.900677652
+伏剑 12.2912397395
+平均价格 8.85082164473
+保票 11.8212361103
+水柜 11.8212361103
+两千名 11.9547675029
+吞声忍气 13.900677652
+独立报 10.604840786
+两千余年 12.5143832909
+六合县 10.9049453784
+线性组合 11.8212361103
+师秦洪 13.900677652
+宽边帽 13.900677652
+派息 10.3743171274
+七步成章 13.900677652
+汉太尉 13.2075304714
+列出来 11.598092559
+维修保养 10.4994802703
+民窑 11.5027823792
+多元醇 11.1280889297
+农业区划 11.0103058941
+压箱底 11.1926274509
+成长篇 13.900677652
+由易到难 13.900677652
+科瓦尔 13.900677652
+慢慢吞吞 12.8020653633
+支部委员 11.4157710022
+频生 12.8020653633
+水柱 9.84023464143
+唐文宗 11.8212361103
+日星 11.5027823792
+淡化 8.7245279194
+表面文章 11.598092559
+半翅目 11.598092559
+生于忧患 13.900677652
+捍御 12.8020653633
+西二环 13.900677652
+法施 13.2075304714
+苞米 12.5143832909
+法方 12.2912397395
+理了 10.9562386728
+哲伦 13.900677652
+集会游行 12.1089181827
+汉唐 8.62256299275
+鞘翅目 10.0294766411
+法新 11.0103058941
+王嵬 13.2075304714
+王广廉 13.2075304714
+法斯 12.5143832909
+山遇仙 11.2616203224
+中国民用航空总局 12.8020653633
+土上 11.1280889297
+水月 11.9547675029
+除雪 10.642581114
+竹林中 11.8212361103
+多元酸 12.5143832909
+微粒体 12.8020653633
+番荔枝 11.3357282945
+小阿苔 12.1089181827
+面包师傅 13.2075304714
+刘剑 13.2075304714
+水机 13.900677652
+背心 9.10488710638
+胡克定律 10.9049453784
+宋国都 12.8020653633
+熯天炽地 13.2075304714
+散装 9.98865464655
+秦钟 10.2630914922
+搬下去 12.5143832909
+水术 12.8020653633
+木灵星 13.2075304714
+骨朵儿 13.2075304714
+达官 11.2616203224
+水木 12.5143832909
+清洗剂 11.2616203224
+四十一岁 12.8020653633
+法文 9.20932976975
+理亏 11.0103058941
+到来之际 10.3453295905
+多元酚 12.5143832909
+中学生 9.43476953332
+牧庵 13.2075304714
+日暮 10.604840786
+派生物 11.9547675029
+水浒传 9.59661255877
+医学界 10.1164880181
+洗发水 10.765183436
+菩萨顶 12.8020653633
+名花异草 12.8020653633
+有负众望 13.900677652
+史诗式 12.2912397395
+一朝天子一朝臣 11.9547675029
+干将 10.1871055853
+颂诗 10.7226238216
+六合区 13.900677652
+法旨 10.604840786
+填充料 11.8212361103
+水杉 9.84023464143
+外交惯例 13.2075304714
+消化器官 11.1926274509
+黑甲军 13.2075304714
+仁天皇 11.8212361103
+万花山 13.900677652
+珠江电影制片厂 13.900677652
+水松 11.0103058941
+凝集素 11.8212361103
+法柜奇兵 13.900677652
+资产负债 9.66657114738
+振荡波 13.900677652
+螺丝帽 12.5143832909
+总则 10.3171587135
+陆文军 11.5027823792
+干尸 8.94485059437
+应征者 11.1926274509
+何太后 11.7034530746
+纳巴德 12.2912397395
+总分 10.4349417492
+水杨 13.2075304714
+光密介质 12.2912397395
+大龙虾 12.8020653633
+内斜视 13.2075304714
+总台 11.0103058941
+库邦戈 13.900677652
+水暖 11.7034530746
+罪状 9.43476953332
+总司 13.2075304714
+太平门 12.8020653633
+太平间 10.1164880181
+十二颗 12.1089181827
+坦克部队 10.4666904475
+罪犯 8.42003872863
+守土 10.2897597393
+游回来 12.1089181827
+技术设备 10.1164880181
+传位 10.4994802703
+吵着 10.765183436
+收款 10.3453295905
+选准 11.1926274509
+干巴 11.1926274509
+披头散发 9.80633308975
+选出 8.05135287203
+七百元 12.2912397395
+管见 11.5027823792
+恨成 13.900677652
+会议室 8.29487558568
+总体设计 10.4666904475
+日杂 13.900677652
+奥斯克 13.2075304714
+瑞芬 11.1280889297
+广州话 13.2075304714
+文左武 12.8020653633
+那沙沙 12.8020653633
+太阳岛 11.7034530746
+背带 10.9562386728
+日本 5.00614451618
+俗务缠身 13.900677652
+乐段 11.7034530746
+土俗 11.7034530746
+蹿跳 11.1280889297
+洗发液 13.2075304714
+乌拉草 11.9547675029
+王岳 12.5143832909
+淡到 12.2912397395
+王岱 13.2075304714
+受挤 13.900677652
+比较仪 13.900677652
+无不及 13.900677652
+丁营 12.2912397395
+马德拉斯 10.0088573539
+王者师 12.8020653633
+能振动 13.900677652
+日月 8.23425096386
+自走式 12.5143832909
+任务在身 13.2075304714
+遮藏 12.8020653633
+科普读物 12.1089181827
+孙馥 13.2075304714
+连骨肉 13.900677652
+选冶 12.8020653633
+总厂 9.82314020807
+日期 7.01824018098
+间断 9.0884932966
+千万富翁 10.9562386728
+接待厅 13.2075304714
+塞满 9.66657114738
+印度议会 13.900677652
+满坡 11.3357282945
+杨大哥 12.5143832909
+州官 11.3357282945
+水星 9.55687223012
+汉君 12.8020653633
+教坊 9.53122979951
+王履 12.5143832909
+乐死 13.2075304714
+张太监 13.2075304714
+被担保人 13.2075304714
+伍员山 13.900677652
+先遣部队 11.598092559
+阿维拉 12.8020653633
+教坛 13.900677652
+二万平方米 13.900677652
+防军 11.7034530746
+哈里 10.5684731418
+杀出重围 10.642581114
+民间传说 8.97342396682
+前置条件 12.5143832909
+二十万全部 13.2075304714
+中华文明 10.1394775363
+气功师 12.5143832909
+太平镇 11.9547675029
+经济学界 10.1164880181
+制药厂 10.2371160058
+王屋 13.900677652
+功架 12.5143832909
+自花传粉 11.598092559
+刘弗陵 12.8020653633
+闻见 10.0088573539
+伐木工 13.2075304714
+敲除 12.8020653633
+王稼祥 11.2616203224
+收殓 11.0103058941
+万分感激 12.5143832909
+土伦 11.5027823792
+武胜关 11.9547675029
+选入 9.14708746087
+乐歌 11.5027823792
+汉员 11.598092559
+丁能通 7.02235118368
+王尧 11.598092559
+波利尼西亚人 10.1394775363
+大寺安纯 13.2075304714
+导向性 10.9562386728
+土体 10.1164880181
+朱洪武 10.533381822
+风档 13.2075304714
+太阳山 13.2075304714
+痛处 10.0720362555
+一笑置之 11.2616203224
+昏头昏脑 11.1926274509
+团结一心 11.7034530746
+开花期 11.3357282945
+存活率 10.9562386728
+一百二十行 13.2075304714
+红彤彤 10.4994802703
+痛失 10.642581114
+结合实际 10.4994802703
+敬天法 10.765183436
+水晶 7.87239913175
+虚拟空间 12.5143832909
+王小 10.0505300503
+增上 12.2912397395
+回转式 10.4994802703
+可比性 9.40086798165
+东南区 11.9547675029
+水景 11.4157710022
+教场 10.1164880181
+整骨 13.900677652
+弗兰 11.598092559
+王尚 13.2075304714
+荷兰豆 13.900677652
+河东柳 12.5143832909
+赫蒂 13.900677652
+王忠 9.66657114738
+淡入 13.2075304714
+管内廷 13.900677652
+饭堂 11.598092559
+水斗 12.1089181827
+赣剧 12.2912397395
+总参谋长 9.01032852375
+涂上 9.84023464143
+二十一折 13.2075304714
+法术 9.65218240993
+胡遵 11.598092559
+政绩 8.73589167805
+竹书纪年 10.0940151622
+寅吃卯粮 11.598092559
+党的基本 10.8096351986
+赫蒙 12.2912397395
+章服 11.4157710022
+房坡 10.5684731418
+逼宫 10.8561552143
+王心 13.900677652
+就这样办 11.1926274509
+硬着 10.9562386728
+王必 11.9547675029
+谭元春 13.900677652
+赠与 9.87532596124
+整饰 11.7034530746
+政经 10.8561552143
+整饬 9.28555713513
+王志 11.8212361103
+恨意 10.765183436
+澎湖湾 12.2912397395
+主客 9.87532596124
+敲门 8.4284069783
+大兴县 11.2616203224
+王御 13.900677652
+生一子 11.8212361103
+秦陵 11.8212361103
+驷马难追 11.4157710022
+政纲 10.4994802703
+被服 11.598092559
+地狱变相 13.2075304714
+水族 9.45802639549
+王德 10.604840786
+政纪 13.900677652
+汉城 9.20019728618
+熊熊烈火 11.7034530746
+齐聚一堂 11.4157710022
+转义 9.80633308975
+戍边 9.96885201925
+夫特 12.5143832909
+王徽 13.900677652
+汽车网 10.9049453784
+王征 12.5143832909
+胡适 10.3171587135
+三千八百万两 13.2075304714
+千万里 11.8212361103
+包销商 13.900677652
+李氏 9.32596667347
+相沿成俗 12.8020653633
+苑深宫 13.2075304714
+水旱 9.85762638414
+王徒 13.2075304714
+家里人 8.51618258919
+秦陇 11.5027823792
+驻防地 13.900677652
+商路 9.87532596124
+朴素唯物 13.2075304714
+伏倒 11.9547675029
+法权 10.9049453784
+苛细 12.8020653633
+德胜门 9.85762638414
+安福县 13.2075304714
+理论依据 9.75754292558
+秦隶 13.2075304714
+吐音 12.8020653633
+艾马拉 11.3357282945
+王彩 10.0940151622
+公驴 12.8020653633
+中藏 10.1630080337
+近些年 10.1164880181
+马蹄袖 11.5027823792
+人老珠黄 13.2075304714
+盛行于 9.05649056552
+淡出 9.5062284973
+年月日 10.4666904475
+韩德培 13.2075304714
+郑思肖 13.2075304714
+水政 12.8020653633
+洛喜密 13.2075304714
+郭士 12.5143832909
+被查 10.2897597393
+芬兰政府 12.2912397395
+汉地 9.27570483869
+赠予 10.642581114
+方知端 12.5143832909
+兆麟 12.1089181827
+弗利 12.5143832909
+农村妇女 10.2371160058
+王当 13.2075304714
+昂贵 8.25523075433
+法规处 11.5027823792
+现代科学 9.7898037878
+一决雌雄 11.4157710022
+对得起 9.29550746599
+德恩 11.9547675029
+高层人士 10.8096351986
+教名 11.8212361103
+克利奥 12.2912397395
+王弥 11.8212361103
+赠以 12.5143832909
+整首 13.900677652
+独立性 8.47572763449
+犯境 11.1280889297
+总值 8.83177344976
+河北省委 11.598092559
+选刊 12.5143832909
+赵世炎 11.2616203224
+干布 11.4157710022
+劳顿 10.8561552143
+轻薄透明 13.2075304714
+王弼 10.1394775363
+新文学 9.63799777493
+越能 10.5684731418
+万尼亚 11.2616203224
+闻邦国 13.2075304714
+玩票 12.2912397395
+民权运动 10.8096351986
+所向无前 13.900677652
+派拉 13.900677652
+昂起 10.3743171274
+地质博物馆 11.5027823792
+敲锣 10.0088573539
+两国政府 9.85762638414
+秦雍 12.1089181827
+纽约城 12.5143832909
+法显 10.8561552143
+层流 10.3171587135
+严格说来 11.1280889297
+七七四十九天 12.1089181827
+沙贾汗 12.5143832909
+选取 8.40761620864
+刚直不阿 11.3357282945
+王廷 12.5143832909
+王延 12.1089181827
+背山 10.1164880181
+拖拉机 8.43684584695
+两千块 11.7034530746
+伏兵 8.87679713113
+虎虎生威 13.2075304714
+日数 9.63799777493
+杨推 13.2075304714
+整顿 7.45654639528
+千万支 13.900677652
+整项 13.900677652
+恨怒 13.2075304714
+保皇党 11.7034530746
+榆叶梅 12.2912397395
+港台地区 12.8020653633
+光辉夺目 12.8020653633
+除霜 12.2912397395
+选号 12.1089181827
+一千有余 13.900677652
+广寒仙子 13.900677652
+吴汝纶 13.900677652
+秦震 7.20240959786
+伏兔 13.900677652
+爱与恨 11.598092559
+苏醒 9.41204128224
+修佛 13.900677652
+锯出 13.900677652
+千万部 13.900677652
+干得 8.58747167293
+王座 10.9049453784
+矮人一等 13.900677652
+告朔 13.900677652
+小越儿 12.2912397395
+五老峰 11.598092559
+敲钟 10.604840786
+普罗托 13.2075304714
+刘克庄 11.9547675029
+功效 7.69410172525
+一九四九年 9.55687223012
+电子伏特 10.2630914922
+叶斑病 11.0674643079
+饥馁 11.7034530746
+选去 12.8020653633
+苏里 13.2075304714
+动物区系 10.3171587135
+流动性 5.97769169326
+歇一会 12.5143832909
+石羊 11.5027823792
+间架 11.9547675029
+十员 10.8561552143
+无水乙醇 11.9547675029
+分忧解愁 13.2075304714
+王店 11.9547675029
+智虑 11.1926274509
+硅藻 10.3171587135
+扩大内需 7.71036224612
+卡迪里 13.2075304714
+王庙 10.642581114
+赣北 11.0103058941
+李泽 9.61021821083
+卵膜 11.9547675029
+总共 7.61467955747
+乌哈笃 13.2075304714
+麻宣慰 13.900677652
+波托西 12.1089181827
+日日 8.97342396682
+新兴学科 11.5027823792
+疲劳极限 11.8212361103
+多党制 9.80633308975
+塌陷 8.85082164473
+能否 6.39904319409
+伏击 9.43476953332
+烧香拜佛 11.598092559
+太阳帽 12.5143832909
+郎署 12.8020653633
+加倍 8.98069672615
+王广 11.3357282945
+盘龙目 12.8020653633
+野战 8.68574189437
+公之尊 13.2075304714
+周自齐 13.900677652
+纳税户 11.9547675029
+为之动容 11.4157710022
+胡里 13.2075304714
+李大钊 9.41204128224
+司马师引 13.900677652
+胡金 12.1089181827
+随声附和 10.8096351986
+余冠英 13.2075304714
+但君亭 11.4157710022
+居然 7.04316358943
+间期 10.9562386728
+奇峰突起 12.8020653633
+电刑 12.5143832909
+州委 11.8212361103
+宣赞快 13.2075304714
+沙尘暴 11.9547675029
+教唆 9.98865464655
+太阳年 11.3357282945
+地陪 11.5027823792
+男性化 11.9547675029
+日方 9.84023464143
+翠寒 13.900677652
+樊知古 13.2075304714
+干式 10.3453295905
+日新 11.4157710022
+喘息 8.30596627237
+选区 10.2371160058
+千万遍 12.5143832909
+红旗轿车 11.9547675029
+保皇军 13.2075304714
+日文 10.4349417492
+王师 10.3453295905
+逼婚 12.1089181827
+王希 11.5027823792
+操法 12.8020653633
+承浆 13.2075304714
+宣怀位 13.900677652
+咕嘟嘟 11.7034530746
+于海东 13.2075304714
+皮克特 12.8020653633
+田子方 12.1089181827
+戚阳 12.8020653633
+日斑 13.900677652
+摒挡 12.1089181827
+未曾 7.62215622781
+汇丰银行 8.90346537821
+慕容 9.62401153296
+洮南市 12.1089181827
+西南区 10.7226238216
+败胃 13.2075304714
+左兵东 12.5143832909
+铁杖 13.900677652
+双金属 12.5143832909
+发自内心 10.5684731418
+半疑半信 13.900677652
+谈得来 11.2616203224
+霍守业 13.900677652
+基希纳 12.2912397395
+克泽河 13.900677652
+屯留 11.7034530746
+脱髓鞘 12.1089181827
+中上游 9.12155415886
+诸溪洞 12.8020653633
+拜辞 9.38981814546
+商鸿逵 13.2075304714
+电刀 13.2075304714
+支链 10.2897597393
+条绒 13.900677652
+行大礼 11.3357282945
+骄纵 10.765183436
+向西军 13.2075304714
+面包店 13.2075304714
+广东队 13.2075304714
+声源 10.604840786
+延津新 10.9562386728
+考后 13.2075304714
+中国国际交流协会 12.8020653633
+条约 6.57948909524
+请说出 13.2075304714
+象州县 11.8212361103
+几百块 10.4349417492
+咀嚼效能 13.900677652
+明穆宗 12.5143832909
+有效射程 9.41204128224
+西基雄 12.8020653633
+巴里坤 10.642581114
+条纹 9.04086524761
+科尔尼 13.900677652
+正交变换 12.8020653633
+刘勰 10.765183436
+中西餐 12.1089181827
+狡猾地 10.9049453784
+罗索 11.2616203224
+罗素 9.93038573842
+沃尔姆 11.7034530746
+叭叭 11.0103058941
+第二军医大学 13.2075304714
+错上加错 12.2912397395
+补体结合 11.1926274509
+电刷 12.1089181827
+二百多年 11.3357282945
+预警线 13.2075304714
+流河 11.598092559
+日义兵 13.2075304714
+电视剧集 13.2075304714
+斑竹 11.4157710022
+经心 10.8096351986
+甘博阿 13.900677652
+风高放火 11.8212361103
+微重力 12.5143832909
+师生关系 12.1089181827
+纺织部 12.5143832909
+眼花雀乱 13.900677652
+日邮 11.4157710022
+李中堂 9.18217878068
+恋家 12.1089181827
+洗成 12.8020653633
+茶点 9.98865464655
+絮聒 11.9547675029
+元圣武 13.2075304714
+酬金 10.7226238216
+辛劳 9.74179456862
+临高县 13.900677652
+面包师 12.2912397395
+办公厅 9.04864738806
+裴宣喝 13.2075304714
+圣经神学 13.900677652
+茶炉 11.7034530746
+驴粪蛋 13.2075304714
+雷叠 13.900677652
+瓦窑堡会议 11.0674643079
+汉学界 12.2912397395
+晴间多云 11.4157710022
+陶成章 10.9049453784
+厘米 6.61860399388
+加格达奇 12.5143832909
+灌溉区 11.4157710022
+扮起 12.5143832909
+人潮 10.6818018271
+欠妥 10.9562386728
+洗手 9.28555713513
+孔明惊 12.8020653633
+有机硅 9.4233408375
+方殿中 12.8020653633
+渭源 12.8020653633
+传统节目 12.8020653633
+体改委 13.2075304714
+病虫草害 13.900677652
+盖天军 12.8020653633
+染污 11.9547675029
+检测费 12.1089181827
+徐凤鸣 13.2075304714
+三千六百二十余卷 13.2075304714
+游蛇科 12.1089181827
+要路 11.0674643079
+削发为僧 11.598092559
+水合氯醛 11.9547675029
+碰铃 13.900677652
+有条有理 11.9547675029
+商陆科 12.8020653633
+伊里亚 12.5143832909
+萧渊明 11.9547675029
+未明 9.21854642485
+贵重品 13.2075304714
+山城堡 11.9547675029
+点点滴滴 10.8096351986
+辛勤 9.77354326693
+共同犯罪 11.0103058941
+理论物理学 11.0103058941
+防御战 10.4994802703
+吉库尤 12.2912397395
+中央社会治安综合治理委员会 13.2075304714
+卷册 13.2075304714
+砬子 11.4157710022
+惨伤 13.2075304714
+新钢钒 13.900677652
+染液 13.900677652
+皇家学院 10.6818018271
+进退有度 12.8020653633
+洗掉 10.642581114
+驳回去 13.2075304714
+国电 9.22784881751
+麦金利 11.1280889297
+赵公明 10.765183436
+解孟获 12.5143832909
+公众股 13.900677652
+一两米 11.9547675029
+被害案 13.900677652
+霍德勒 13.2075304714
+打败仗 11.3357282945
+瘢儿 13.900677652
+桂陵 11.4157710022
+一元化 12.2912397395
+同室操戈 12.8020653633
+敦实 11.3357282945
+承华宫 13.2075304714
+事件真相 12.5143832909
+岑嘉州 13.2075304714
+罗米 13.2075304714
+高危期 13.2075304714
+生长期 9.71102290995
+贾瑞笑 13.900677652
+不知真假 11.8212361103
+置产 12.2912397395
+找碴 12.5143832909
+电阻加热 13.900677652
+居水泊 12.8020653633
+粉蒸肉 12.5143832909
+貌似公正 13.900677652
+苟安 10.642581114
+桃花鱼 13.2075304714
+那小和尚 12.2912397395
+七八点 13.900677652
+见异思迁 11.8212361103
+未果 9.28555713513
+迁回来 12.5143832909
+叙事性 11.3357282945
+子常浩 12.8020653633
+岛国 9.41204128224
+几亿年 11.5027823792
+温州 8.15447446144
+采购商 10.0505300503
+厚礼 9.98865464655
+胡雪岩 12.8020653633
+过滤 8.58255765813
+大弟嘉 12.8020653633
+一切照旧 11.2616203224
+塞饱 13.2075304714
+养由基 11.9547675029
+悟入 12.8020653633
+防风固沙林 11.8212361103
+辛卯 13.2075304714
+那朵珠 13.900677652
+纡回 13.900677652
+不贰过 13.900677652
+象征性 9.0884932966
+止住 8.21031819765
+苟存 13.2075304714
+苦雨 12.5143832909
+晋惠公 12.1089181827
+嘉华 11.9547675029
+琉球王国 12.2912397395
+一匡天下 12.8020653633
+柿子树 11.9547675029
+守中立 13.2075304714
+亩产量 12.5143832909
+二十二年 8.40350942668
+失去知觉 10.8561552143
+秘书局 13.900677652
+暴躁 9.69598503258
+阿雷格 11.598092559
+厚积 12.8020653633
+鲁定公 12.1089181827
+白姐姐 11.3357282945
+连石湖 13.2075304714
+五角场 12.8020653633
+明视距离 13.900677652
+过渡 6.94986288353
+常住 10.0940151622
+悠悠然 12.5143832909
+曹正 10.0940151622
+真不简单 11.5027823792
+坟茔 10.533381822
+古尔语 13.2075304714
+几百回 13.900677652
+厚禄 12.5143832909
+治学严谨 11.2616203224
+健身球 11.7034530746
+玄览堂 12.5143832909
+古亚述 12.1089181827
+务实性 12.8020653633
+化费 11.5027823792
+十万块 12.5143832909
+叫座 11.1926274509
+任哈雷 12.5143832909
+榜样 8.7245279194
+金家户 11.7034530746
+提炼厂 12.5143832909
+与那国岛 12.8020653633
+娃娃亲 13.2075304714
+互相爱护 13.900677652
+一九五三年 13.2075304714
+未有 8.14493543839
+谋取私利 12.1089181827
+拿大头 11.8212361103
+言之有理 10.1871055853
+叶尼塞河 9.80633308975
+担不是 12.8020653633
+仪表板 10.9049453784
+电子服务 12.8020653633
+帝怒 11.7034530746
+太湖石 10.533381822
+人人自危 10.3453295905
+利亚太 12.5143832909
+探口风 12.8020653633
+罗罗 11.7034530746
+张协 11.7034530746
+鄙吝 12.5143832909
+罗网 10.2371160058
+凤英才 13.2075304714
+散置 12.5143832909
+在短期内 8.18036587537
+贡比涅 11.1926274509
+仅用 9.58318953844
+狄利克 10.9562386728
+怕麻烦 11.8212361103
+拳谱 13.2075304714
+强对流 12.5143832909
+填在 12.2912397395
+织纹 11.9547675029
+乖违 13.2075304714
+声波 8.97342396682
+占空比 13.900677652
+利亚多 13.900677652
+明星照 13.900677652
+讼师 12.1089181827
+游牧民 9.58318953844
+开工率 9.01787572939
+罗缎 11.598092559
+泰安市 11.1280889297
+雄心勃勃 9.80633308975
+刘升 12.5143832909
+王爱财 13.900677652
+地下建筑 10.2117981979
+赵盼儿 13.2075304714
+拔火罐 11.8212361103
+收购点 13.2075304714
+尧舜 9.94943393339
+窝囊 9.45802639549
+清词丽句 13.2075304714
+织绵 13.900677652
+叉齿 11.9547675029
+过深 11.3357282945
+暴起 10.533381822
+子龙 9.98865464655
+车船税 11.7034530746
+罗缪 13.2075304714
+暴走 13.900677652
+奋勇争先 13.900677652
+电子签名 11.9547675029
+渭水 9.74179456862
+企业级 12.2912397395
+织绣 11.598092559
+胸肋膜 13.900677652
+黑家白日 13.2075304714
+堤外 11.1280889297
+寇境 13.2075304714
+养养 11.3357282945
+辐射效率 13.900677652
+十万名 13.2075304714
+检测车 13.900677652
+唐六臣 12.8020653633
+临产前 12.5143832909
+霍德兹 13.2075304714
+巡回演出 9.96885201925
+卡富埃 12.5143832909
+斯洛文尼亚共和国 13.900677652
+很难说服 12.5143832909
+过洋 10.8096351986
+卞孝 10.9562386728
+眼谗 13.2075304714
+古塔山 10.604840786
+十万吨 12.5143832909
+聪明人 8.94485059437
+桑普顿 13.2075304714
+过活 9.31571017331
+谦恭下士 12.1089181827
+班委 13.900677652
+科幻小说 11.9547675029
+以史为鉴 11.0103058941
+戴琳 13.900677652
+法定标准 12.8020653633
+流落江湖 11.598092559
+从朝彦 13.900677652
+防御性 8.53470163695
+杰科布 12.5143832909
+过浓 11.9547675029
+中标者 11.9547675029
+昌化 11.3357282945
+埃尔兰根 13.2075304714
+采购团 12.2912397395
+性情爽直 13.900677652
+无剑胜 13.900677652
+难接近 13.2075304714
+支队 8.0746775446
+接收站 10.5684731418
+子鼠 12.8020653633
+封建主 8.66956903512
+于安西 12.1089181827
+人海 10.9049453784
+有何见教 10.6818018271
+宰谷 13.2075304714
+过海 10.8561552143
+鸸鹋 11.2616203224
+阶跃 12.2912397395
+肇事案 13.900677652
+前言不搭后语 12.1089181827
+终身难忘 12.5143832909
+欠安 10.8561552143
+暴跳 11.0674643079
+进益 11.1280889297
+亦庄 11.8212361103
+渭河 8.83808261895
+低价卖出 11.9547675029
+怯弱 10.9562386728
+面山 12.1089181827
+跟我来 9.37888907493
+董承自 13.900677652
+一站站 13.900677652
+铅合金 11.9547675029
+播种 8.21709788464
+未时 10.3453295905
+埃德加 12.8020653633
+珍贵 7.17684521115
+滑鼠 13.900677652
+永久化 11.4157710022
+属望 13.900677652
+几百名 9.96885201925
+拣拾 12.5143832909
+生二歧 13.2075304714
+新厂 10.9562386728
+那道石 13.900677652
+登陆点 11.8212361103
+过河 8.56795885871
+侧向 9.96885201925
+重吸收 10.2371160058
+法国巴黎 8.86372504956
+叫上来 13.900677652
+过油 11.598092559
+铁柜 11.3357282945
+几百吨 12.1089181827
+主开关 13.900677652
+迢递 13.2075304714
+侧后 10.765183436
+丹道 12.5143832909
+哲罗鱼 12.8020653633
+水清如 13.2075304714
+战皆胜 12.8020653633
+拳赛 13.2075304714
+迢遥 13.2075304714
+夸大其辞 12.2912397395
+眼跳 12.8020653633
+麦穗 10.4666904475
+丁声树 13.900677652
+电势 9.91169360541
+滑齿 12.5143832909
+金刚烷 12.8020653633
+不法常可 13.900677652
+脉码调制 12.5143832909
+万众欢腾 13.2075304714
+靖边 10.4994802703
+辛克 13.2075304714
+原版书 12.8020653633
+胡得禄 11.598092559
+山东师范大学 13.2075304714
+堤堰 11.5027823792
+刑法 8.18364995057
+英吉利海峡 9.75754292558
+第六十三回 11.9547675029
+赛段 13.900677652
+振兴老 12.5143832909
+珍赏 13.900677652
+二十二岁 10.4666904475
+李适之 11.7034530746
+考场 9.53122979951
+苏中英 13.2075304714
+萧笛 12.2912397395
+琴杆 11.1280889297
+控告权 12.2912397395
+追求幸福 11.1926274509
+罗织 10.6818018271
+诸善必 13.900677652
+过气 11.1926274509
+藩国 11.7034530746
+兑换券 11.8212361103
+疼疼 12.5143832909
+天兵天将 11.9547675029
+袁绍 8.66423568915
+李洪 13.900677652
+灵光 10.3171587135
+发表权 12.2912397395
+涉世未深 13.2075304714
+斯里兰卡人 12.8020653633
+罗统 13.2075304714
+公安大学 13.900677652
+句号 9.53122979951
+盗用 10.4349417492
+兼用型 11.7034530746
+提炼出 11.0103058941
+未敢 9.10488710638
+刘国能 9.37888907493
+人氏 8.9102450652
+二十二届 13.2075304714
+罗绮 11.7034530746
+英商怡 11.8212361103
+过氧 11.9547675029
+斑秃 11.9547675029
+亦必 11.1926274509
+包孝肃 12.8020653633
+法律承认 12.1089181827
+人气 7.45020722983
+魏建国 13.900677652
+人民 5.20936310033
+秦腔戏 11.8212361103
+水磨沟 12.8020653633
+冬麦 11.4157710022
+未改 9.96885201925
+织网 12.8020653633
+泛光照明 13.900677652
+东林党 9.48183704418
+芽眼 12.5143832909
+未收 11.4157710022
+存贮区 13.900677652
+袒胸 12.8020653633
+晋二王 13.2075304714
+子鸣 13.2075304714
+遇难成祥 13.900677652
+子鸡 13.900677652
+都能安 13.2075304714
+小商店 11.7034530746
+盖天力 13.900677652
+辛凉 12.1089181827
+紧张性 11.0674643079
+越界 11.1926274509
+诗谶 13.900677652
+八会穴 12.5143832909
+广宁子 13.900677652
+庖厨 11.1926274509
+紫阳县 13.900677652
+疼痛 7.08284708052
+并日而食 13.900677652
+别派 13.900677652
+诸善德 12.8020653633
+涿州市 11.8212361103
+未来型 13.900677652
+罗纳 12.8020653633
+太宗皇后 12.8020653633
+罗纱 11.9547675029
+陆抗死 13.900677652
+额金岭 13.2075304714
+罗纹 11.4157710022
+方遂 13.2075304714
+子拖雷 11.3357282945
+疼爱 9.30555780184
+帝星 11.5027823792
+财务制度 11.0674643079
+富豪 7.29944753325
+休耕 11.8212361103
+戴河流 12.8020653633
+茶饭无心 12.1089181827
+办公地 11.598092559
+丹徒区 13.900677652
+新华出版社 12.5143832909
+中国历史博物馆 10.3171587135
+一半处 13.2075304714
+前所未见 11.0103058941
+三十一卷 12.5143832909
+从吾言 13.2075304714
+帝明 13.900677652
+凌云阁 13.2075304714
+攒钱 10.9049453784
+几百匹 12.8020653633
+安贞医院 13.900677652
+罗祥 12.5143832909
+乌贼骨 12.8020653633
+支部 8.87023973058
+苟延 11.598092559
+奥迪车 11.7034530746
+何其芳 11.7034530746
+何以自处 12.2912397395
+支郡 11.7034530746
+居丹徒 12.8020653633
+大人先生 11.7034530746
+缔合 10.8561552143
+鱼腥草 11.2616203224
+环绕声 13.900677652
+丁香花 10.7226238216
+卯是卯 12.1089181827
+芫荽 11.1280889297
+得住 10.1871055853
+未抵 13.900677652
+金刚石 8.82550383674
+首创者 11.3357282945
+格拉古 11.3357282945
+五河县 13.900677652
+教学科研 12.2912397395
+得体 9.31571017331
+冠绝一时 13.2075304714
+四百三十万 13.2075304714
+西利斯 12.8020653633
+显赫家世 13.900677652
+干瘦 10.2371160058
+丹霍 11.9547675029
+应理雅 12.8020653633
+长白猪 12.8020653633
+没得说 13.2075304714
+支那 10.0940151622
+参芪 12.2912397395
+卓之 13.900677652
+三思而后行 11.9547675029
+白登云 13.2075304714
+铃木春信 12.8020653633
+众乡亲 12.5143832909
+负反馈 10.7226238216
+于省吾 12.2912397395
+踮起 10.9049453784
+西河沿 11.598092559
+罗秀 12.8020653633
+十万分 12.5143832909
+未受损伤 13.2075304714
+齐民要术 10.3743171274
+支遁 12.5143832909
+世界和平理事会 11.4157710022
+令人心寒 12.2912397395
+罗科 13.2075304714
+丹徒县 11.1926274509
+中国青少年研究中心 13.900677652
+不能自己 10.0720362555
+不能自已 11.598092559
+冯世宽 9.46986085313
+修官 13.900677652
+人欲 10.8561552143
+未扣 13.900677652
+诬赖好人 13.2075304714
+宋威 12.8020653633
+远水救不了近火 12.8020653633
+传导电流 11.598092559
+嘁嘁嚓嚓 11.7034530746
+破罐子破摔 11.1280889297
+两枝 10.1394775363
+乱云飞渡 13.2075304714
+侧厅 12.1089181827
+天象图 13.2075304714
+古诗文 13.2075304714
+平尼亚 13.2075304714
+子祖 12.1089181827
+流石滩 11.8212361103
+难免会 9.21854642485
+一两秒 13.900677652
+罗禅 12.8020653633
+叙事文 13.900677652
+神经元网络 12.8020653633
+小红门 12.8020653633
+大步流星 10.765183436
+人武 13.900677652
+难分高下 13.2075304714
+颜元之 13.2075304714
+诸岛 9.43476953332
+不同寻常 9.56994431169
+恋念 13.2075304714
+精气神 11.4157710022
+苍自 13.2075304714
+可品尝 13.900677652
+金谷园 13.900677652
+拨草寻蛇 12.8020653633
+未战 12.1089181827
+马场 10.9562386728
+伟岸 11.3357282945
+过死 12.8020653633
+电脑操作 12.8020653633
+市盈率 6.2595934028
+汪惟效 12.5143832909
+几百只 11.2616203224
+木本植物 10.0940151622
+灵兽 11.7034530746
+几百口 13.2075304714
+应激反应 12.8020653633
+骊珠 13.900677652
+身体语言 13.900677652
+考克 12.5143832909
+睫毛膏 11.598092559
+宣言 7.36834335975
+中药饮片 11.1280889297
+肿起 12.5143832909
+合同制 11.8212361103
+得下 10.4349417492
+本处 9.82314020807
+窝内 10.8561552143
+罗硕 11.7034530746
+刘叉 13.900677652
+佟娘娘 12.8020653633
+身份证明 10.4041700905
+墨西哥市 13.900677652
+政治危机 10.9049453784
+扬二州 11.9547675029
+朱庄坝 13.2075304714
+丹陵 13.900677652
+声母 10.1164880181
+测量器 11.8212361103
+统一价 13.900677652
+帝朱 13.900677652
+桓伊 12.2912397395
+大题目 12.8020653633
+铜人 10.2371160058
+肯上去 13.900677652
+乌卢阿 13.900677652
+华夫脱 11.8212361103
+模范村 12.8020653633
+大顺朝 8.63281949291
+足足有 10.3171587135
+指挥车 9.82314020807
+颜珠 11.1926274509
+险种 9.87532596124
+得主 8.89004235788
+造船公司 11.5027823792
+金熊奖 12.5143832909
+牛皮鞋 13.2075304714
+白皑皑 12.5143832909
+继续下去 9.27570483869
+演讲 8.00078029839
+好威风 13.900677652
+不根之论 13.900677652
+收入支出 12.8020653633
+孙德谦 13.2075304714
+消融术 12.2912397395
+洗染 13.900677652
+土库曼 9.94943393339
+帝权 13.900677652
+铜仁 10.6818018271
+加尔文 10.1164880181
+反潮流 12.8020653633
+丹阳 8.84443184663
+帝李 12.8020653633
+阿蕴庄 12.5143832909
+郭祥真 13.2075304714
+铜价 8.55834340001
+乐意于 13.900677652
+青州府 11.7034530746
+松烟 12.5143832909
+经画邦 13.2075304714
+范堡罗 12.5143832909
+瞿氏 13.2075304714
+金莲花 12.1089181827
+尸变 9.4233408375
+布哈河 11.2616203224
+引起惊慌 13.900677652
+正月十五 10.0505300503
+民事或 13.900677652
+十万台 13.900677652
+无人之地 12.5143832909
+支配 7.33119623156
+随葬 9.7898037878
+火力点 10.3453295905
+铜丝 11.2616203224
+铜业 8.6966709649
+吴嘉禾 12.2912397395
+品行好 13.900677652
+繁琐 9.19114745066
+先接 12.5143832909
+谐趣园 12.2912397395
+粗筋 13.2075304714
+方公里 13.2075304714
+陶式 11.0103058941
+长立幼 11.8212361103
+未换 13.900677652
+窑头 12.5143832909
+交兵 11.3357282945
+邮购 11.3357282945
+电阻炉 12.8020653633
+缴费 9.26594866375
+托付给 9.93038573842
+毕节地区 12.1089181827
+检修 9.12155415886
+文凭者 13.900677652
+交关 11.2616203224
+柠檬酸钠 12.8020653633
+考出 13.2075304714
+十万匹 12.5143832909
+土豆泥 12.5143832909
+曹雪芹 10.4349417492
+柳青娘 12.8020653633
+熬不过 11.1280889297
+这盒 12.8020653633
+蛋白质 7.02958635737
+不买账 10.765183436
+西柏林 10.8096351986
+中级车 10.0294766411
+季谢夫 13.900677652
+邮资 11.2616203224
+人以群分 11.5027823792
+周明泰 13.900677652
+独立设置 12.2912397395
+富足 10.0505300503
+福贡县 13.900677652
+二氧化碳气 13.2075304714
+中国国际信托投资公司 11.7034530746
+得以 6.50434235817
+得令 10.4666904475
+不使 9.04086524761
+辛基 13.2075304714
+斑羚 11.5027823792
+千叮咛 12.8020653633
+验光 11.5027823792
+地图分析 13.900677652
+芫花 11.8212361103
+学术探讨 13.2075304714
+玄宗召 11.7034530746
+中成药 9.41204128224
+十万卷 12.2912397395
+青州市 11.9547675029
+空空落落 13.900677652
+刘志祥 10.533381822
+参茸 13.2075304714
+自动武器 10.642581114
+漂了 11.2616203224
+考前 11.598092559
+抓壮丁 10.9562386728
+京剧团 12.5143832909
+王总管 11.3357282945
+亿页 13.900677652
+睡过了头 13.2075304714
+伽马刀 13.900677652
+松一松 12.2912397395
+通鉴考 12.8020653633
+许多歌 13.900677652
+脑出血 11.0103058941
+辛吉 13.2075304714
+雷劈 11.3357282945
+扶宝玉 13.2075304714
+恼恨 10.0294766411
+渭桥 11.598092559
+滴下来 11.598092559
+漂亮 7.02647915652
+广宁府 12.5143832909
+大肠经 11.3357282945
+酶法 12.2912397395
+临津江 11.2616203224
+庄户 11.598092559
+眼袋 10.4041700905
+订做 11.1926274509
+辟作 13.2075304714
+增修 10.2371160058
+农科所 11.9547675029
+一言半语 12.5143832909
+不久天 13.900677652
+考分 12.8020653633
+观者如堵 11.9547675029
+二十步 12.1089181827
+觉着 8.23425096386
+雅罗斯拉夫 11.8212361103
+第一百九十七条 13.900677652
+尸僵 13.2075304714
+辛味 12.1089181827
+洗擦 12.8020653633
+考利 13.2075304714
+参议员 9.18217878068
+恼怒 8.9102450652
+参股 7.96050639926
+胡黄连 12.1089181827
+昵爱 13.900677652
+安享晚年 12.5143832909
+状况不佳 12.1089181827
+阿根廷政府 11.8212361103
+十亿美元 11.7034530746
+建州卫 11.7034530746
+塔马拉 12.5143832909
+考到 11.7034530746
+景德镇市 11.4157710022
+俯拾即是 13.2075304714
+十万倍 13.2075304714
+池水 10.4041700905
+生存者 12.2912397395
+病毒感染 9.63799777493
+农机站 12.2912397395
+准定 10.0720362555
+王含守 13.2075304714
+顺序号 12.5143832909
+存贮器 10.604840786
+黄菠萝 11.1280889297
+膝头 10.1164880181
+电阻率 9.96885201925
+制造矛盾 12.5143832909
+考勤 12.5143832909
+自力救济 13.900677652
+茧绸 12.1089181827
+问一问 9.46986085313
+物管费 13.2075304714
+次级债 8.96620371885
+声桥 13.900677652
+安吉丽娜 13.900677652
+演说 8.91707103027
+囊中羞涩 11.9547675029
+参考 7.12759727632
+墨西哥州 13.2075304714
+戚属狄 13.900677652
+侧击 12.5143832909
+格拉兹 13.2075304714
+闪来闪去 13.900677652
+水道 8.20358416547
+分析表明 10.4666904475
+欲死欲仙 13.900677652
+走起 12.2912397395
+条码 9.89334446674
+世良 13.2075304714
+关键时期 9.04086524761
+茶盅 9.7898037878
+高门大户 12.2912397395
+亿颗 13.2075304714
+膨胀剂 13.900677652
+考务 13.2075304714
+潜移 13.900677652
+茶盏 9.49395840471
+厚纸 12.2912397395
+茶盘 10.0294766411
+酒神节 12.8020653633
+利亚州 12.8020653633
+破屋 11.4157710022
+香喷喷 9.82314020807
+辅助设计 11.5027823792
+人梯 12.8020653633
+试行期 12.8020653633
+弹雨 11.2616203224
+白土关 11.7034530746
+年龄阶段 11.2616203224
+埃利森 12.5143832909
+传人 9.55687223012
+骑上去 11.8212361103
+几百倍 11.0103058941
+羊三木 13.900677652
+过梁 12.1089181827
+安重根 13.900677652
+济南路 12.5143832909
+独立电源 11.9547675029
+坏透 11.598092559
+知心朋友 11.7034530746
+摔断了腿 12.8020653633
+辟为 9.16447920358
+晋谒 10.6818018271
+白术散 12.2912397395
+七八盏 13.900677652
+条理井然 12.2912397395
+李涵 12.5143832909
+抵抗能力 10.8561552143
+福费廷 13.2075304714
+啫喱 11.9547675029
+利亚尔 12.5143832909
+埋得 11.1926274509
+考卷 10.7226238216
+磷钙石 12.8020653633
+帝敕 12.5143832909
+卦爻 13.2075304714
+随意注意 13.900677652
+的确良 12.1089181827
+佳侣 13.900677652
+暴行 9.43476953332
+激流勇进 13.900677652
+潲水 13.2075304714
+嘈杂 9.03314320152
+缴过 13.900677652
+繁盛 8.43261751084
+变轻 11.9547675029
+嵇中散 12.5143832909
+藤之木 13.2075304714
+明叔希望 12.8020653633
+家威廉 13.900677652
+眼角 8.30596627237
+曾亲耳 13.900677652
+染毒 11.1280889297
+超历史 12.5143832909
+公曹髦 12.5143832909
+扑空 10.533381822
+设宴款待 11.0674643079
+考区 10.9562386728
+克劳奇 13.900677652
+十万出 13.2075304714
+睁一眼 13.900677652
+眼见 8.26588804881
+叶尔玛 13.900677652
+慕峁 10.0720362555
+九章算术 9.93038573842
+邮迷 13.900677652
+不公平地 13.900677652
+马里兰 11.2616203224
+大主教 9.87532596124
+拼死一搏 13.2075304714
+美术品 11.8212361103
+程序执行 13.2075304714
+人格 8.28390655431
+鹿儿 12.8020653633
+言之有物 11.4157710022
+丢魂失魄 12.8020653633
+天下无双 11.5027823792
+七八百 10.9049453784
+考取 10.0940151622
+订出 11.4157710022
+柑皮 13.900677652
+扔来 13.900677652
+送煤 12.5143832909
+激发态 9.69598503258
+半脱产 13.2075304714
+罗竭 13.900677652
+宝源祥 12.8020653633
+考古 7.5871296057
+叙事曲 11.4157710022
+三百六十六万七千七百多顷 13.2075304714
+动画文件 13.900677652
+现行犯 12.1089181827
+序幕 8.40761620864
+五千多名 13.900677652
+吸音 11.4157710022
+桕脂 13.900677652
+摇起来 13.2075304714
+主少国疑 12.5143832909
+撒丫子 11.5027823792
+规例 12.8020653633
+盘状石 13.2075304714
+邓廷桢 11.8212361103
+十万元 10.2630914922
+丹钦 11.8212361103
+六十八款 13.2075304714
+海因斯 12.8020653633
+堤岸 9.37888907493
+作风 8.092535162
+魏建功 13.2075304714
+装幌子 13.2075304714
+洪葭管 11.2616203224
+和兆域 13.2075304714
+一乙醇胺 12.8020653633
+锡耶那 13.2075304714
+预料不到 12.2912397395
+高处不胜 10.2630914922
+电击 10.0505300503
+句型 11.9547675029
+名窑 11.1280889297
+第九十二回 12.2912397395
+邮车 11.1926274509
+千余处 12.8020653633
+忙点 12.8020653633
+减压阀 12.5143832909
+过桥 9.80633308975
+未愈 10.604840786
+红卫 11.3357282945
+格拉德 12.5143832909
+罗地亚 13.900677652
+阿季尼 13.900677652
+几丁质 10.765183436
+送终 11.0103058941
+汝宁王 12.8020653633
+刑天氏 13.900677652
+送经 13.900677652
+条目 10.0505300503
+第六日 12.5143832909
+踮脚 13.2075304714
+发动机盖 11.3357282945
+巴耶夫 12.8020653633
+濮阳县 10.5684731418
+侧弯 12.2912397395
+美术字 13.2075304714
+未满 9.65218240993
+茨城县 13.2075304714
+键名 13.900677652
+家常饭 13.2075304714
+活性钙 13.900677652
+上寒秀 13.2075304714
+七八种 12.2912397395
+中央音乐学院 10.4041700905
+美术学 13.900677652
+但须 10.3453295905
+敦劝 11.8212361103
+测量学 9.6811699468
+石拱 12.2912397395
+捅娄子 12.1089181827
+冼星海 11.4157710022
+茶砖 11.7034530746
+收购站 12.8020653633
+尘网 12.5143832909
+几百张 13.2075304714
+全心全意 9.58318953844
+又打又骂 13.2075304714
+匈牙利人 10.533381822
+契科 13.900677652
+中国南方航空公司 13.900677652
+侧影 11.1280889297
+书房门 12.2912397395
+案宗 12.8020653633
+姚祖恩 13.2075304714
+调色板 12.1089181827
+宣誓 9.05649056552
+三四名 13.2075304714
+智人 10.0505300503
+那高俅 12.5143832909
+扭转乾坤 11.598092559
+供给者 12.1089181827
+考尔 11.7034530746
+作案工具 12.5143832909
+指挥舱 11.0674643079
+与民同乐 11.2616203224
+高些 10.4041700905
+指挥船 13.2075304714
+关键因素 9.05649056552
+宋光宗 11.7034530746
+忙而不乱 12.8020653633
+摔筋斗 13.900677652
+彩条 11.9547675029
+袁甲 12.8020653633
+大部分 5.50565209453
+目不忍睹 12.8020653633
+罗姆尼 13.2075304714
+罗田 11.7034530746
+红种人 13.2075304714
+封官墨 13.2075304714
+下中农 11.9547675029
+亡羊补牢 10.7226238216
+罗甸 12.1089181827
+人本 10.6818018271
+哈得斯 12.5143832909
+陈太监 13.900677652
+办公室 6.49214708508
+过期 9.7898037878
+牛尿 12.5143832909
+过望 12.8020653633
+子长 11.2616203224
+张子布 12.8020653633
+茶碱 11.8212361103
+那双长 13.2075304714
+千代田区 13.2075304714
+人机 10.3171587135
+诺曼第 12.8020653633
+验尿 12.5143832909
+东街村 13.900677652
+汉语系 13.900677652
+验尸 11.2616203224
+花正劳 13.2075304714
+扳机 9.56994431169
+魏降梁 12.5143832909
+人月 13.2075304714
+直纹曲面 13.900677652
+西峡县 11.2616203224
+尸布 13.900677652
+斯泰纳 12.8020653633
+漆着 13.2075304714
+慈石召 12.8020653633
+罗宾斯 11.0674643079
+接收点 12.8020653633
+里昂市 13.900677652
+兑换处 13.900677652
+吃法呢 13.900677652
+北非国家 13.2075304714
+茶碗 9.53122979951
+涂九轨 13.2075304714
+肿胀 8.95903522937
+肿肿 13.2075304714
+山进香 11.9547675029
+订座 13.900677652
+温都尔 11.8212361103
+剪头发 13.2075304714
+兰托公 13.2075304714
+拼在一起 11.9547675029
+菱镁 11.598092559
+人民法庭 12.5143832909
+官融州 13.2075304714
+庭院式 11.9547675029
+楼道口 12.8020653633
+宿将 11.0103058941
+利阿斯 13.900677652
+人杰 11.2616203224
+眼虫 11.3357282945
+一个三十多岁 11.0674643079
+潮润润 13.900677652
+魔术 9.72629038208
+悔过自新 11.7034530746
+生物灾害 13.2075304714
+美术室 13.900677652
+关泉 11.8212361103
+老三样 13.900677652
+子错 13.900677652
+脱思麻 13.2075304714
+人权 8.89673134603
+振拔 12.5143832909
+破家 11.1280889297
+过来 5.39353479641
+慕华 13.900677652
+厚点 13.900677652
+仇兆鳌 13.2075304714
+惜墨如金 12.5143832909
+一致性 9.05649056552
+美术家 9.96885201925
+十万年 13.900677652
+人材 9.91169360541
+画符 12.1089181827
+森林法 12.1089181827
+美貌女 13.900677652
+本庭 13.900677652
+贺逢圣 13.2075304714
+唇枪舌剑 11.4157710022
+话筒 9.12155415886
+雪鞋 12.8020653633
+鄙弃 11.5027823792
+没齿不忘 11.9547675029
+分辨善恶 13.900677652
+和亨利 12.8020653633
+繁碎 13.900677652
+万绳楠 13.2075304714
+条石 10.6818018271
+拉孜县 13.2075304714
+三十一年 9.04086524761
+罗瑜 13.2075304714
+何谦 13.900677652
+茶社 11.1926274509
+土壤溶液 11.2616203224
+染料 8.51618258919
+移居国外 11.5027823792
+发动机短 13.900677652
+敦厚 10.4041700905
+出离 10.765183436
+酒精依赖 11.9547675029
+光纤网络 13.900677652
+司马师妻 13.2075304714
+藩屏 12.1089181827
+自卸车 12.5143832909
+刚构桥 12.8020653633
+佛光山 13.2075304714
+沙墙 12.8020653633
+找点 10.1871055853
+科斯托夫 12.8020653633
+残垣断壁 12.8020653633
+马志尼 11.3357282945
+江左军 13.2075304714
+西京丸 12.8020653633
+帕尔马斯 12.8020653633
+直僵僵 13.900677652
+暴虐 9.53122979951
+下问 11.9547675029
+措手不及 8.78268383956
+骄矜 11.598092559
+电报费 13.900677652
+救济院 12.1089181827
+派送 11.3357282945
+欠债 9.94943393339
+董事长 6.65573610564
+几百幅 13.2075304714
+宁夏回族 13.2075304714
+袁琦 13.2075304714
+狄利娅 13.900677652
+那凉凉 13.2075304714
+荆湖占 13.2075304714
+几百年 8.52539924429
+安第斯集团 13.2075304714
+光催化 13.900677652
+酣歌醉舞 13.900677652
+袁琳 11.8212361103
+罗琳 12.2912397395
+窝巢 10.9049453784
+可口可乐 10.0720362555
+作陪 10.0088573539
+五味子 9.7898037878
+影响力 7.47418919452
+小商品 9.40086798165
+替人 10.3171587135
+成平 12.1089181827
+地板漆 13.900677652
+意志缺失 13.900677652
+造谣言 12.8020653633
+金勒马 13.2075304714
+斯维尔德洛夫斯克州 13.2075304714
+风标 13.2075304714
+刨根 12.8020653633
+牛王庙 13.900677652
+白莲教 9.40086798165
+涕泪 10.6818018271
+祖翁 12.1089181827
+签条 13.2075304714
+涕泣 11.0674643079
+牵牛子 12.5143832909
+罗瓦 11.0674643079
+面包圈 13.900677652
+随行 8.73019365694
+浇筑 11.1926274509
+敦化 11.3357282945
+织田 13.2075304714
+作难 10.0940151622
+紧张状况 10.642581114
+银华 7.82533162089
+织画 13.2075304714
+磁化强度 10.604840786
+池沿 12.5143832909
+人体实验 12.8020653633
+泥灰岩 10.4349417492
+凌晨时分 12.5143832909
+酒绿灯红 13.2075304714
+不久回 13.2075304714
+淘金汉 13.900677652
+马倌 12.5143832909
+稀土元素 10.0294766411
+几百度 12.8020653633
+德国式 12.2912397395
+光秃秃 9.84023464143
+声望 8.71329184614
+后会无期 13.2075304714
+过晚 11.2616203224
+染整 11.3357282945
+桃花铺 11.1926274509
+内务府 9.84023464143
+拨转 10.1871055853
+真空计 13.900677652
+一千五百两 12.5143832909
+鲲鹏 9.87532596124
+替代 7.26473109629
+农曰羲 13.2075304714
+安身之地 12.5143832909
+五六十斤 12.2912397395
+接送车 13.2075304714
+签有 9.87532596124
+舌苔 9.28555713513
+高仙 10.7226238216
+一千五百万 12.8020653633
+非公莫入 13.900677652
+南池子 13.2075304714
+般般 11.2616203224
+繁简 10.642581114
+广开财源 13.900677652
+卡利亚里 12.5143832909
+龙羊峡水电站 10.8561552143
+退休费 12.5143832909
+富良 13.2075304714
+西南夷 9.84023464143
+比利 11.7034530746
+心急如焚 10.0505300503
+俯览 13.900677652
+桥归桥 12.5143832909
+未泯 11.2616203224
+亚洲象 10.6818018271
+滞销 10.2897597393
+混成旅 10.1871055853
+单侧 10.4041700905
+转体 10.765183436
+鞣制 11.0674643079
+郭鹤年 13.900677652
+百闻不如一见 13.900677652
+子山波 13.900677652
+派遣 7.67414098269
+从中取利 13.2075304714
+国别史 11.9547675029
+嵌套 11.4157710022
+真才实学 10.604840786
+飞舟 13.2075304714
+家用电器 8.55357012126
+蒙昧主义 11.9547675029
+滑阀 12.5143832909
+雀鹰 11.8212361103
+生铁 8.89673134603
+简斋 13.2075304714
+西陵督 13.2075304714
+协作关系 12.5143832909
+但马 12.8020653633
+鲁贡玛 12.8020653633
+党建读物出版社 13.900677652
+和平村 13.900677652
+棠棣 12.1089181827
+中西合璧 11.598092559
+李文华 12.8020653633
+詹马 13.900677652
+凤尾鱼 11.7034530746
+白玉石 12.1089181827
+蔡楚生 11.5027823792
+埃利斯 11.0674643079
+养儿防老 11.8212361103
+四星级 10.604840786
+潜留 13.900677652
+随访 10.4041700905
+二三月份 12.2912397395
+住校 11.8212361103
+指挥者 10.5684731418
+星芒状 12.8020653633
+人时 9.22784881751
+雀鸟 12.1089181827
+刘启 11.4157710022
+过时 8.85082164473
+求活 13.900677652
+褚亨 12.8020653633
+定义新 13.900677652
+地召民 13.2075304714
+吴熙 11.0674643079
+鞣剂 12.5143832909
+利亚克 13.2075304714
+过旺 11.5027823792
+送粮 11.1280889297
+图穷匕见 13.900677652
+王鸿祯 13.2075304714
+生银 12.8020653633
+各党派 10.2897597393
+滑降 11.8212361103
+厚爱 9.80633308975
+过早 8.4801426527
+富农经济 13.2075304714
+管不了那 12.5143832909
+萎黄 10.8096351986
+里窝那 12.8020653633
+福安殿 12.5143832909
+徐娘半老 11.9547675029
+水文学家 11.8212361103
+斯威士兰 10.5684731418
+管兀者 13.2075304714
+单传 10.9562386728
+鸡鸣不已 12.5143832909
+纽芬兰 10.0294766411
+弓强弩 13.2075304714
+荣民 13.900677652
+泥火山气 13.900677652
+梅格纳 13.900677652
+子静 11.9547675029
+子非 12.2912397395
+格纳特 12.2912397395
+兰后 13.900677652
+邮船 11.2616203224
+杨奉营 13.2075304714
+经明帝 13.2075304714
+歌舞杂耍 13.900677652
+乌韦阿 13.2075304714
+睡眠不足 10.4666904475
+目不邪视 12.5143832909
+李明森 10.5684731418
+弊大于利 11.0674643079
+斑点 8.7245279194
+采取有效 9.98865464655
+参谋 7.77380846786
+发射场 10.0720362555
+比分 10.2117981979
+仓山亚 12.5143832909
+从松山 11.9547675029
+参谒 11.598092559
+施政报告 11.8212361103
+申韩之 13.2075304714
+合同工 11.9547675029
+滑雪 9.54396882529
+人数 6.40125436138
+抽提 11.598092559
+单作 11.7034530746
+雀麦 12.2912397395
+过数 12.2912397395
+弘慈广 12.8020653633
+雪铁龙 9.62401153296
+白土岗 11.8212361103
+单体 8.56313957227
+单位 5.36074497359
+林启 12.5143832909
+吉格梅 13.900677652
+壮心不已 11.9547675029
+怯场 11.598092559
+吉姆斯博 13.2075304714
+乌里斯 13.2075304714
+出庭作证 12.8020653633
+三弦琴 13.2075304714
+李媚姐 11.8212361103
+浪人 10.604840786
+单人 9.12999302751
+广宁县 12.5143832909
+布哈拉 10.2371160058
+鼓噪声 13.900677652
+卓怒 12.2912397395
+未深 12.5143832909
+单亲 12.2912397395
+鼓浪屿 11.0674643079
+一两百 11.598092559
+声旁 12.2912397395
+受惩 13.900677652
+撂倒 10.8561552143
+吹乱 11.4157710022
+本市 8.47133202302
+单产 8.87679713113
+考录 12.1089181827
+梦中见 11.598092559
+植物种子 10.4349417492
+暴落 10.9049453784
+辛夷 10.8561552143
+权分立 12.5143832909
+媳妇儿 10.1871055853
+鸾鸟 13.2075304714
+单井 11.2616203224
+缴获 9.02548032877
+街办 11.9547675029
+本币 9.02548032877
+亿镑 12.2912397395
+大一岁 10.9562386728
+索福克 11.0674643079
+子集 10.1394775363
+吹乐 13.900677652
+丝毫不爽 13.900677652
+罗登 13.2075304714
+句子 9.11318590919
+神禾村 11.598092559
+小红马 12.5143832909
+面面俱到 11.2616203224
+鲜竹 13.900677652
+单价 8.80081122415
+单件 10.4349417492
+芭莉 13.900677652
+炒下去 13.900677652
+战争罪犯 11.8212361103
+未涨 11.8212361103
+窝心 11.0103058941
+茶汤 10.0505300503
+不能自制 11.7034530746
+翩翩 10.2630914922
+吹下 13.900677652
+机芯 12.5143832909
+岳阳楼记 11.9547675029
+波粒二象性 10.604840786
+问讯 9.6811699468
+叶尔羌 10.2371160058
+拉里萨 13.900677652
+单从 9.71102290995
+大腿骨 11.9547675029
+体貌特征 11.7034530746
+三四千元 11.598092559
+生啤酒 13.900677652
+马拉进 13.2075304714
+免蹈覆辙 13.900677652
+心急如火 12.8020653633
+孙权知 12.8020653633
+爱面子 11.7034530746
+钟开莱 13.900677652
+洒脱 9.45802639549
+西乌珠穆沁旗 13.900677652
+参赌 11.4157710022
+唐才常 10.0940151622
+岸信 12.2912397395
+滞针 12.2912397395
+苟免 12.5143832909
+布袋子 13.2075304714
+大块文章 12.8020653633
+单个 7.33119623156
+银离子 11.8212361103
+专业培训 11.3357282945
+声效 13.900677652
+体改办 13.900677652
+参赛 9.23723855786
+单丝 12.5143832909
+肩摩毂击 13.900677652
+手颤 11.4157710022
+糜烂性 11.8212361103
+无师自通 11.5027823792
+期末考试 10.642581114
+染有 13.2075304714
+苏京 12.8020653633
+苟全 12.1089181827
+索貌阅 13.2075304714
+瘦肉型 11.4157710022
+金刚砂 11.7034530746
+早奏 11.3357282945
+单丁 12.2912397395
+单一 7.15779701618
+修密书 12.5143832909
+滑音 11.9547675029
+夜尿症 13.900677652
+西辽皇帝 13.2075304714
+单买 13.2075304714
+签收 11.1926274509
+四十四万多平方公里 12.2912397395
+图书馆 7.57811241205
+句容 10.765183436
+李中华 12.1089181827
+孙铁匠 11.7034530746
+马佐维耶茨基 13.2075304714
+广宁卫 12.5143832909
+好开心 13.2075304714
+二十二名 13.2075304714
+益州诸 12.8020653633
+带岭区 13.2075304714
+子阔 13.2075304714
+阮圆海 9.80633308975
+珍藏 9.03314320152
+大量库存 10.9562386728
+三十一岁 11.8212361103
+价值尺度 10.1394775363
+个税 10.8096351986
+单义 13.900677652
+动压 11.8212361103
+序列 8.0229418702
+卡子 11.8212361103
+紧抱 11.4157710022
+眼花 9.48183704418
+相烦 10.533381822
+比勒 12.5143832909
+斑白 10.3171587135
+堤坡 11.9547675029
+阿内尔卡 13.2075304714
+全聚德 11.1926274509
+王郢 12.8020653633
+染患 12.8020653633
+辅佑 13.2075304714
+米卢斯 12.5143832909
+乐清市 12.1089181827
+陶工 11.4157710022
+流气 13.900677652
+患有 8.46259834305
+子金 13.900677652
+紧抓 11.5027823792
+茉莉花茶 10.6818018271
+托波尔 12.8020653633
+再慢 12.1089181827
+孙起孟 11.9547675029
+堤坝 9.69598503258
+刘国轩 13.900677652
+生命力 8.47572763449
+高举 8.83808261895
+杀人不眨眼 10.604840786
+恭王府 10.604840786
+找病 11.9547675029
+订婚 10.0940151622
+代部长 11.598092559
+家什 10.4666904475
+签押 10.4666904475
+声抗 13.900677652
+萨丽 13.900677652
+支领 12.1089181827
+转悲为喜 12.1089181827
+高丽 8.96620371885
+骄狂 12.5143832909
+左思右想 10.0720362555
+口似悬河 12.8020653633
+包容百川 13.900677652
+关兰馨 11.1280889297
+榜文 10.4994802703
+圆白菜 13.900677652
+竞赛奖 13.2075304714
+条状 10.3171587135
+孙文抿 13.900677652
+周景王 12.8020653633
+孙家寨 12.2912397395
+林久实 13.900677652
+舌蝇 12.2912397395
+滑道 11.1926274509
+红霞姐 12.2912397395
+丹鼎 10.533381822
+加尔河 12.5143832909
+迎香穴 12.5143832909
+行不得 11.0674643079
+辱没 10.3171587135
+声报 13.900677652
+仇怨 11.598092559
+丹参片 12.8020653633
+签批 12.8020653633
+洗清 10.5684731418
+辛店 10.9049453784
+从古至今 10.7226238216
+衣冠整洁 13.2075304714
+斯德丁 13.2075304714
+德化碑 12.2912397395
+制造事端 11.3357282945
+西尼萨 13.2075304714
+撑篙 11.9547675029
+玛雅语 13.900677652
+侧室 10.9049453784
+辛庄 12.8020653633
+子丑寅卯 11.0674643079
+二十二卷 13.2075304714
+象征派 11.0103058941
+扳指 10.9562386728
+茶精 13.900677652
+蒸发热 13.2075304714
+古典式 11.2616203224
+辅修 13.900677652
+辛康 12.8020653633
+自定义 12.8020653633
+买卖婚姻 11.1280889297
+亚麻油 12.2912397395
+堤埂 13.2075304714
+几百家 10.9562386728
+徒长 12.1089181827
+多米尼加共和国 10.8096351986
+辅导组 13.900677652
+测井 11.8212361103
+露出原形 13.2075304714
+扶余 10.4994802703
+爱丽舍宫 11.598092559
+皮萨列夫 13.2075304714
+讲学习 13.900677652
+声扬 12.5143832909
+饥荒 9.01787572939
+压光机 13.900677652
+检疫局 9.7898037878
+武警战士 11.8212361103
+眼色 7.69611988941
+悲歌慷慨 12.8020653633
+测仪 13.2075304714
+紧扼 13.900677652
+一九四七年 10.8561552143
+饿饭 12.8020653633
+圣菲省 13.900677652
+紧扣 10.0294766411
+工艺水平 10.1871055853
+空间布局 10.4349417492
+进刀 13.2075304714
+墨西哥城 9.82314020807
+一百三十 11.0103058941
+萨格勒布 11.1926274509
+进产房 12.5143832909
+几百对 12.8020653633
+追溯力 13.2075304714
+真儿 13.2075304714
+均告失败 11.1926274509
+心满意足 9.23723855786
+加得 12.1089181827
+啮齿类 10.642581114
+利亚城 12.5143832909
+很早 9.02548032877
+纡子 12.5143832909
+接触应力 12.2912397395
+胡大爷 13.900677652
+法门 9.98865464655
+参评 10.3453295905
+超时空 12.5143832909
+武勇 11.3357282945
+探出 8.99540287354
+束手束脚 12.5143832909
+署名权 12.5143832909
+紧接 10.7226238216
+有快有慢 12.5143832909
+团圆年 13.2075304714
+子部 12.1089181827
+种上 10.9562386728
+参详 11.0674643079
+子郑 13.900677652
+洽谈会 10.0294766411
+声援 9.4233408375
+齐宣王 11.0103058941
+不久前 8.10158499752
+适用范围 9.6811699468
+干部学校 11.5027823792
+邹衡 13.900677652
+提盒 12.8020653633
+单脚跳 13.900677652
+用坏 12.2912397395
+测量师 13.900677652
+美术师 12.5143832909
+打箭炉 11.9547675029
+应力场 11.598092559
+改日 9.58318953844
+过招 10.9049453784
+武早喝 13.2075304714
+书生气 10.8561552143
+生命史 11.2616203224
+衰退 7.4023955025
+厚生 11.3357282945
+肉孜节 12.5143832909
+萨伯 11.8212361103
+紧握 10.0294766411
+黑桦 11.8212361103
+松楠 12.8020653633
+罗思南 12.8020653633
+胆小 8.81927328699
+襟怀 11.0674643079
+母系社会 12.1089181827
+看门人 11.0103058941
+挺不住 11.7034530746
+隋开皇 8.90346537821
+洗濯 11.5027823792
+参议 9.23723855786
+预算编制 10.765183436
+诗中有画 12.1089181827
+话匣 13.900677652
+萨伊 10.9049453784
+降血脂 11.1280889297
+声控 12.2912397395
+金刚经 10.3171587135
+尼布尔 12.1089181827
+参访 12.5143832909
+清过来 13.900677652
+日隆 11.2616203224
+奥巴 13.900677652
+荣辱毁誉 13.900677652
+扶乩 11.0674643079
+辅仁 10.4041700905
+海龙王 10.4994802703
+七八米 10.604840786
+堤围 11.598092559
+四周围 10.9049453784
+紧挨 10.2371160058
+过户 8.9102450652
+窝头 10.7226238216
+柯林 13.2075304714
+家主 10.642581114
+逆时针 10.2371160058
+过房 12.1089181827
+富藏 11.4157710022
+一刀斩 10.6818018271
+精品课程 13.900677652
+昵称 11.4157710022
+罗烨 13.2075304714
+电子传递 10.9049453784
+加速度计 12.1089181827
+紧持 12.8020653633
+芭蕾 9.18217878068
+陈通筹 13.2075304714
+爱辉镇 12.2912397395
+五千多年 13.2075304714
+天然杂交 13.2075304714
+到极点 10.533381822
+郭盛四 12.5143832909
+丹麦 7.58170953823
+扳手 11.2616203224
+一两点 11.8212361103
+工商管理学士 13.900677652
+眼药 10.8096351986
+毛狼王 11.9547675029
+过手 9.71102290995
+左国城 11.598092559
+人才 6.58545926222
+择人而事 13.900677652
+星星峡 11.7034530746
+溜下去 12.8020653633
+人手 8.38322475551
+检察院 8.65365357982
+恶劣手段 13.900677652
+狼山鸡 12.1089181827
+乌普萨拉 11.0103058941
+羹匙 11.9547675029
+里亚金 12.2912397395
+王鸿绪 13.2075304714
+接回来 10.642581114
+纳尼亚 13.900677652
+大血藤 12.5143832909
+磐安 12.2912397395
+连环计 11.3357282945
+订定 10.8561552143
+作业控制 11.8212361103
+秽亵 12.2912397395
+孔明之 10.533381822
+张二公 11.8212361103
+龙墀 12.5143832909
+大树将军 13.900677652
+找矿 9.93038573842
+那道童 13.2075304714
+沾亲 11.9547675029
+吝啬鬼 11.5027823792
+无损压缩 13.900677652
+电子装置 10.4666904475
+王母正 13.2075304714
+坎顿 13.2075304714
+湿婆大神 13.2075304714
+左上方 11.8212361103
+万籁鸣 12.1089181827
+几百处 12.5143832909
+打通经脉 13.900677652
+现金交易 11.8212361103
+向西南方 11.4157710022
+稀缺资源 9.61021821083
+宽洪海量 13.2075304714
+基社盟 12.8020653633
+几百头 12.2912397395
+随迁 13.2075304714
+萨伐尔 12.1089181827
+序域 13.900677652
+濛濛 11.3357282945
+土豆条 13.900677652
+旷奇逸 13.900677652
+赫奕 13.900677652
+古典音乐 11.3357282945
+眼肌 11.2616203224
+巴以 11.3357282945
+庄世平 13.900677652
+巴亚 12.5143832909
+谐振腔 11.4157710022
+蒙武虏 13.2075304714
+亏负 11.598092559
+觉罗 10.9562386728
+石砖 11.1926274509
+香豌豆 13.900677652
+洗法 13.900677652
+钢丝网 12.1089181827
+阿雷格里港 12.2912397395
+李武 11.598092559
+皮质激素 9.10488710638
+布哈林 11.598092559
+日面 11.5027823792
+软件产业 13.2075304714
+几亿元 12.5143832909
+金布里 13.2075304714
+阻尼作用 12.8020653633
+有句名言 11.8212361103
+帝汶 11.598092559
+巴人 10.642581114
+曾庆云 9.87532596124
+一二例 13.900677652
+三十一处 13.2075304714
+后发制人 11.0103058941
+格拉姆 11.7034530746
+罗猴 13.2075304714
+应星曜 13.2075304714
+伺机而动 11.1280889297
+张扬出来 13.900677652
+时光荏苒 13.2075304714
+分子论 13.2075304714
+钩心斗角 11.9547675029
+饿鬼 10.3453295905
+染房 12.5143832909
+数据库管理员 13.900677652
+振兴路 13.2075304714
+二位数 12.1089181827
+随车 10.9562386728
+巴乔 13.2075304714
+宝珍珠 13.900677652
+巴乌 11.9547675029
+人愿 11.598092559
+托孤 10.1871055853
+亿部 12.1089181827
+袁珙 11.8212361103
+繁缛 10.5684731418
+地金喜 13.900677652
+电阻箱 13.900677652
+格拉夫 11.9547675029
+联合推出 10.642581114
+人意 10.1394775363
+渐进性 11.1280889297
+嫁接苗 12.8020653633
+忤逆 11.1280889297
+古尔蒂 13.2075304714
+染成 9.65218240993
+汽车电机 13.900677652
+刹帝利 10.765183436
+沾上 9.71102290995
+卓如兄 13.900677652
+病有所医 13.2075304714
+办事组 12.5143832909
+心高气傲 11.0103058941
+声息 9.20019728618
+泌尿外科 11.0103058941
+巴东 9.91169360541
+石头火锅 13.900677652
+巴丘 11.4157710022
+咬啮 12.1089181827
+玄宗入 12.8020653633
+罗王 12.2912397395
+霍去病 9.98865464655
+苟同 11.3357282945
+苟合 11.9547675029
+于秀峦 13.2075304714
+都远胜 13.900677652
+编目员 13.900677652
+还报 11.7034530746
+厚皮 10.8561552143
+张兵备 13.2075304714
+萨图尔 12.5143832909
+嘉峪关市 11.598092559
+巴丹 11.0103058941
+亦力 11.3357282945
+茶经 9.96885201925
+巴中 11.0674643079
+过慢 12.1089181827
+火山锥 9.82314020807
+苏格兰人 10.533381822
+舍近求远 12.8020653633
+基建投资 9.7898037878
+不负使命 13.900677652
+织物 8.58255765813
+拳脚 10.0720362555
+经验型 13.2075304714
+柴进 8.70218062071
+参见 7.55328844232
+南半部 10.4041700905
+汤晓丹 12.5143832909
+楚考烈 11.9547675029
+洗消 11.1926274509
+维新运动 10.8096351986
+几亿倍 13.900677652
+东京都 10.9562386728
+茶缸 10.3743171274
+订好 11.3357282945
+陆丰县 12.2912397395
+脉冲电流 11.8212361103
+鄙夫 12.8020653633
+洗涤 9.17328983326
+部门法 12.1089181827
+穿着者 12.8020653633
+一两片 12.5143832909
+洗涮 11.8212361103
+眼膜 12.5143832909
+考学 12.5143832909
+瘦瘦高高 12.8020653633
+洗液 11.3357282945
+满城风雨 10.6818018271
+洗头 9.77354326693
+土黄色 10.9562386728
+宣说 11.5027823792
+鄙夷 9.09665660724
+一身清白 12.5143832909
+早夭 11.598092559
+随身 8.74738605748
+粉身碎骨 9.12155415886
+繁细 12.5143832909
+壳体 9.44633035572
+饥肠 11.2616203224
+眼疾手快 10.1630080337
+晋阳湖 13.2075304714
+闻名遐迩 11.0674643079
+牛心 11.598092559
+句式 10.1394775363
+私人生活 11.8212361103
+悟彻 12.5143832909
+人情 8.45825994145
+鸡声鹅斗 13.900677652
+个体差异 10.6818018271
+茶罐 11.5027823792
+凉爽呢 13.2075304714
+北镇 10.3453295905
+袁爷 11.9547675029
+单栋全 13.2075304714
+毫不犹豫 8.71889410168
+阳光普照 12.5143832909
+西南局 11.8212361103
+宪宗 9.82314020807
+句子成分 12.2912397395
+洗洁 12.5143832909
+业务主管 11.2616203224
+颜神 12.5143832909
+人性 8.17709255002
+高攀不起 13.900677652
+横坐标 11.5027823792
+八营 13.2075304714
+承办人 13.900677652
+苍莽 12.8020653633
+否决 8.83808261895
+考察 6.41912195007
+十万多 12.1089181827
+千二八百 13.2075304714
+公路赛 13.900677652
+中国科技部 11.8212361103
+齐帝 13.900677652
+加时赛 12.2912397395
+亦可 7.92179188707
+知识分子 7.57274086825
+斑痕 11.2616203224
+何执中 12.5143832909
+蝙蝠衫 13.2075304714
+北美版 12.2912397395
+现实表现 12.8020653633
+盼星星 11.598092559
+慕名 10.1871055853
+过急 10.4666904475
+亿里 13.900677652
+临床医学 10.3453295905
+染指 10.2117981979
+人身安全 10.0720362555
+大后方 10.4666904475
+窝子 9.96885201925
+顾影自怜 12.2912397395
+斑疹 10.9049453784
+偏正 12.2912397395
+遏恶扬善 13.900677652
+据估计 9.35738286971
+姑塘 13.2075304714
+考官 9.74179456862
+班乃岛 13.900677652
+小铺子 12.2912397395
+鱼鳞坑 13.900677652
+黑漆漆 9.56994431169
+斯洛博 13.900677652
+齐师 12.2912397395
+暴胀 13.900677652
+辛巳 12.1089181827
+潘秉衡 12.5143832909
+辛己 12.8020653633
+格拉塞 13.2075304714
+王范 12.8020653633
+方显 11.1280889297
+低噪音 12.8020653633
+动作片 11.8212361103
+洗浴 9.41204128224
+畸形物 13.2075304714
+侧壁 10.765183436
+生活馆 12.5143832909
+巴伦 11.1926274509
+满电 13.900677652
+潜热 10.7226238216
+相逢恨晚 13.900677652
+送礼 9.08039608637
+仅有 6.911342386
+施温格 12.5143832909
+丹药 10.1871055853
+日前 6.09154225386
+人群 6.53613063772
+顺义县 11.598092559
+过内丹 13.2075304714
+测到 11.4157710022
+哈依洛 12.5143832909
+第二十八条 12.5143832909
+眷恋 9.96885201925
+富顺 12.5143832909
+子路 11.4157710022
+银包 13.900677652
+信口吹 13.900677652
+智囊 10.8561552143
+卓娜 13.2075304714
+月朗风清 13.2075304714
+罗浮 11.0674643079
+冰冰凉 13.2075304714
+强益骄 12.8020653633
+顾念 10.9049453784
+罗浩 13.2075304714
+大雄殿 12.2912397395
+罗海 11.7034530746
+上市日 10.4666904475
+凝血因子 10.9049453784
+畜生 8.6966709649
+图腾崇拜 10.4349417492
+肉用鸡 13.900677652
+卓娅 13.900677652
+水平如镜 13.900677652
+紧绷 9.74179456862
+近似于 10.604840786
+织法 12.5143832909
+伦道夫 12.5143832909
+纸衣 13.900677652
+还原熔炼 13.900677652
+葵子 12.2912397395
+萨利 11.5027823792
+送暖 12.1089181827
+仪表盘 9.96885201925
+扶去 13.900677652
+拔宅飞升 13.900677652
+签约 7.83922073305
+声纳 9.62401153296
+眉县 10.9049453784
+临终关怀 10.3453295905
+声纹 13.900677652
+哈兹里 12.2912397395
+声线 12.2912397395
+蕃庶 13.2075304714
+天仙子 11.598092559
+衰败 9.21854642485
+罗派 13.900677652
+王学权 13.2075304714
+解放军出版社 13.2075304714
+鬼怕恶人 13.2075304714
+石将军 11.7034530746
+诉辩 13.900677652
+子赵 12.8020653633
+颜晟 12.1089181827
+顺义区 11.2616203224
+得安 12.1089181827
+龙头山 12.2912397395
+扶危 12.1089181827
+卓如你 13.2075304714
+第一行 10.642581114
+戎行粤 13.2075304714
+得宜 11.7034530746
+摆出来 10.2117981979
+二十二位 13.900677652
+参院 12.1089181827
+得宠 10.3453295905
+萨勒 11.9547675029
+一千五百块 12.1089181827
+但能 9.41204128224
+丁光训 12.5143832909
+罗思人 12.5143832909
+人缘 9.94943393339
+扶南 10.642581114
+测力 11.9547675029
+甜糯 12.8020653633
+糜芳守 12.8020653633
+参阅 10.765183436
+子贷 12.8020653633
+桑菊饮 12.1089181827
+子贵 12.2912397395
+克尼杜 12.8020653633
+门前门后 13.900677652
+洗牌 9.5062284973
+周复唐 13.2075304714
+回归年 10.1164880181
+北美洲 7.89926277401
+作过 8.83177344976
+章公公 11.598092559
+奥克尼 11.9547675029
+大会战 10.9049453784
+古树名 12.8020653633
+跑腿儿 12.8020653633
+安巴尔 13.900677652
+设起 12.8020653633
+罗涛 13.900677652
+阴翳 13.2075304714
+加洲 13.2075304714
+灌米汤 12.2912397395
+崛起 7.16727576014
+扳罾 13.900677652
+瞒得过 11.0674643079
+情况严重 10.9562386728
+校订本 12.8020653633
+边界地区 10.9049453784
+洪金宝 13.2075304714
+漏底 13.900677652
+埃巴 13.900677652
+方格纸 13.900677652
+超产奖励 13.900677652
+嚣杂 12.1089181827
+殉教者 12.8020653633
+健身操 12.2912397395
+那道旨 13.2075304714
+痛起来 12.2912397395
+零时许 12.2912397395
+两万六千 13.900677652
+南军阵 12.1089181827
+伍德华 13.2075304714
+罗汉 9.27570483869
+伊吾城 12.8020653633
+富饶 9.25628675283
+检字 12.5143832909
+对口词 13.900677652
+已损坏 12.2912397395
+罗江 11.9547675029
+未知 7.82993992397
+萨卡 11.9547675029
+常德市 11.1280889297
+巴固甫 13.900677652
+上海地区 9.30555780184
+萨博 9.48183704418
+壳儿 11.7034530746
+洛勒斯 13.900677652
+萨卜 13.900677652
+鱼片 11.4157710022
+过线 11.8212361103
+悄悄地 7.6761192227
+照相侦察 11.8212361103
+预备党员 12.5143832909
+潜游 12.2912397395
+严素见 13.2075304714
+合作镇 12.8020653633
+元田盛 12.8020653633
+古巨基 12.8020653633
+垫底儿 12.8020653633
+房学度 12.8020653633
+路振飞 12.8020653633
+真想念 13.900677652
+石碑 8.17709255002
+滑走 12.1089181827
+规复 12.8020653633
+车尔臣河 11.598092559
+公物 11.598092559
+忙昏 13.900677652
+元世祖 8.70772080109
+扶助 9.34680076038
+山生成 13.2075304714
+城市公交 11.7034530746
+袁氏 10.4994802703
+树挂 12.2912397395
+平平稳稳 12.2912397395
+过细 11.1926274509
+西陵氏 13.2075304714
+万亿千瓦 12.5143832909
+张赢川 10.8561552143
+种仁 10.765183436
+圣乔治 10.4666904475
+达因 12.8020653633
+连职 12.5143832909
+偏殿 10.0294766411
+西平王 11.3357282945
+美日关系 13.900677652
+诡辩论 12.1089181827
+雁过拔毛 13.900677652
+厢式 11.8212361103
+过继 10.4041700905
+内里费 13.900677652
+三平方米 13.2075304714
+袁水 11.2616203224
+职称评定 13.900677652
+欲望 7.91422564669
+油罐车 10.3171587135
+心胸狭窄 11.2616203224
+人自为战 12.5143832909
+吹哨 12.8020653633
+数位化 12.1089181827
+觉悟 8.68574189437
+袁泉 12.8020653633
+嘉义县 11.4157710022
+民警 7.61096208107
+定义 7.19381531537
+紧缺 9.04864738806
+舌骨 12.8020653633
+青楼艳妓 13.900677652
+充分准备 9.93038573842
+巴克 10.0720362555
+颜李 13.2075304714
+赵忠尧 13.2075304714
+格兰仕 12.5143832909
+检察 9.56994431169
+紧缩 7.29402746578
+膝上 10.9049453784
+李晓光 11.9547675029
+冷水机组 13.2075304714
+吹响 9.6811699468
+生命财产 9.84023464143
+巴兹 12.1089181827
+借调 11.8212361103
+电视屏 13.2075304714
+单向 9.19114745066
+弗吉尼亚州 10.5684731418
+巴兰 11.7034530746
+帝玺 13.2075304714
+单名 10.9049453784
+巴公 13.2075304714
+电动工具 13.2075304714
+枪机 9.30555780184
+千万户 13.900677652
+曹兵齐 13.2075304714
+环境因素 9.34680076038
+魏之名 12.5143832909
+客帮 13.900677652
+登陆战 12.1089181827
+加洗 13.900677652
+粒子系统 12.2912397395
+和龙市 13.900677652
+琅琊 10.2371160058
+琅琅 10.8096351986
+那声儿 13.2075304714
+人影憧憧 12.5143832909
+编辑器 11.7034530746
+招之 13.900677652
+一代风流 12.8020653633
+对景伤情 13.900677652
+检定 10.642581114
+脂质体 13.900677652
+个性 7.41147272065
+未眠 10.604840786
+罗沙 11.1926274509
+颜元孙 12.8020653633
+滑跑 10.0940151622
+辅助 7.20487873492
+蔡鹤卿 13.2075304714
+符合率 13.900677652
+政府门户 13.2075304714
+凤双飞 13.2075304714
+生命体 11.2616203224
+沾光 10.9562386728
+瓦子街 13.2075304714
+付给 8.62256299275
+头盖骨 10.0940151622
+医治无效 11.8212361103
+吩咐 6.30730345885
+漂好 13.900677652
+自由电荷 11.9547675029
+全家老小 11.4157710022
+哭丧脸 13.2075304714
+满城 8.83808261895
+清泉岗 12.2912397395
+于湖广 11.7034530746
+富马 13.2075304714
+林子 8.95903522937
+巴勒 10.642581114
+挺起来 12.2912397395
+江定仙 13.2075304714
+孙策分 13.2075304714
+弩机 11.1926274509
+宗乾符 12.8020653633
+安戈斯 12.8020653633
+公共道德 12.8020653633
+侯马 10.1871055853
+扶出 11.1926274509
+两权分离 13.900677652
+茶房 10.4666904475
+初生牛犊不怕虎 12.5143832909
+漏屋 13.2075304714
+光在 10.0720362555
+极小量 13.900677652
+作贼 12.1089181827
+帐房 10.1630080337
+子远 12.8020653633
+断无此理 13.900677652
+鞍子 10.4041700905
+得失 8.55357012126
+现场直播 11.0103058941
+测候 12.5143832909
+洗炼 11.8212361103
+储备物资 13.2075304714
+亦丰 10.2371160058
+牧韩馥 12.5143832909
+确信无疑 11.9547675029
+中宣部 10.3743171274
+扈驾 10.3171587135
+勘测局 13.900677652
+咽下去 9.93038573842
+握紧拳头 11.598092559
+得奖 10.1164880181
+潜流 9.71102290995
+平桓玄 13.2075304714
+岁次 12.8020653633
+子输 13.900677652
+亦且 10.8096351986
+港澳办 13.900677652
+蛛形纲 10.8096351986
+心胸开阔 11.3357282945
+张宝瑞 12.2912397395
+杜波伊 13.2075304714
+洗烫 12.2912397395
+用器 11.598092559
+飞走 9.93038573842
+守活寡 11.9547675029
+邓嗣禹 12.8020653633
+齐军 10.3171587135
+茶托 12.1089181827
+博莱斯瓦 12.8020653633
+污水净化 13.2075304714
+染织 10.8096351986
+人员素质 10.8096351986
+找死 10.2630914922
+太宗乃 13.2075304714
+喊话 9.59661255877
+雀蛋 13.2075304714
+尚明 12.2912397395
+家常菜 11.2616203224
+单在 11.0674643079
+变革时代 12.1089181827
+骄气 11.598092559
+飞起 9.38981814546
+棚外 12.8020653633
+饭时 10.8096351986
+嘉陵江流域 11.9547675029
+襟翼 10.4994802703
+电子情报 11.3357282945
+特尼芬 13.900677652
+应有尽有 9.77354326693
+带上去 12.1089181827
+过紧 10.8096351986
+石嘴山 11.0674643079
+提拔干部 11.9547675029
+鸟啼 11.1926274509
+禁书 11.0674643079
+糊粉层 12.8020653633
+讼事 12.1089181827
+精神痛苦 12.1089181827
+讼争 13.900677652
+铜奖 12.8020653633
+铜套 13.900677652
+倒霉鬼 11.9547675029
+固有文化 12.2912397395
+孔家店 12.2912397395
+厘清 10.1871055853
+共享资源 12.2912397395
+河南大学 10.5684731418
+接回去 12.8020653633
+破旧立新 13.900677652
+饥附饱飏 13.900677652
+作践 9.80633308975
+绰有余裕 13.2075304714
+吊罗山 11.8212361103
+撤诉 11.2616203224
+玻璃 6.89398242514
+巴别 13.900677652
+德凡特 13.2075304714
+巴利 11.1926274509
+任率兵 12.8020653633
+奥克帕 13.2075304714
+桃花运 10.9562386728
+牙克西 13.900677652
+解象力 13.900677652
+颜旗 13.2075304714
+亦佳 11.3357282945
+高丽乐 12.5143832909
+徐一夔 13.2075304714
+港澳台 10.4994802703
+萨兰 12.8020653633
+唐大 11.7034530746
+石油勘探 10.0088573539
+灰喜鹊 11.4157710022
+水陆 8.45394028031
+人精 13.900677652
+祸福无门 13.2075304714
+作业组 12.8020653633
+铺张扬厉 12.2912397395
+文件目录 13.900677652
+潜水 8.10158499752
+帝然 13.2075304714
+装熊 13.2075304714
+马军 9.35738286971
+柞木 12.2912397395
+萨克 10.3453295905
+签名运动 13.900677652
+罗湾 12.1089181827
+巴古 12.8020653633
+输油 10.0505300503
+杨春霞 13.900677652
+萨克斯管 11.5027823792
+园林绿化 10.765183436
+巴厘 9.63799777493
+秽史 13.2075304714
+潜江 10.5684731418
+颜料 8.89673134603
+低温干燥 13.2075304714
+不肖子孙 11.0674643079
+多音节词 13.2075304714
+滑车 10.7226238216
+送料 12.8020653633
+滑轨 11.598092559
+和君亭 11.4157710022
+第八十三回 12.2912397395
+马球 11.0103058941
+滑轮 10.0720362555
+铜壶 10.642581114
+巴县 10.8561552143
+东莞县 12.2912397395
+立体音响 13.900677652
+骨肉团圆 12.5143832909
+点法 12.8020653633
+测光 11.3357282945
+何许人 11.9547675029
+噶伦堡 13.900677652
+角频率 11.5027823792
+长期化 10.4041700905
+寄生菌 11.4157710022
+质监局 9.94943393339
+春天气息 13.2075304714
+染缸 11.9547675029
+巴南 13.900677652
+围坐在 10.4041700905
+紧紧 6.76339921472
+鲳鱼 10.6818018271
+韩诗外传 11.8212361103
+基尼系数 11.3357282945
+圣费尔南多 12.5143832909
+紧急 6.95948759691
+神行太保 10.2117981979
+卫凌难 11.4157710022
+切向速度 12.8020653633
+掌中宝 13.900677652
+古文字学 10.4666904475
+施纳贝尔 12.8020653633
+内陆国 11.1926274509
+老弱残兵 11.9547675029
+荷兰籍 13.900677652
+天学国 12.8020653633
+吡啶 10.2897597393
+以下犯上 13.2075304714
+学者气 13.900677652
+沾化 12.2912397395
+老妪 11.2616203224
+崆峒山 11.0103058941
+汤化龙 11.4157710022
+战略地位 9.35738286971
+傅家坡 13.900677652
+胡大海 12.2912397395
+卓如 10.3453295905
+中关村地区 13.2075304714
+巴卢 11.8212361103
+巴卡 13.2075304714
+孙文紧 13.900677652
+小胖 10.2117981979
+李过笑 11.7034530746
+立异 12.2912397395
+自旋磁矩 10.9049453784
+象征物 12.5143832909
+人口过剩 10.8096351986
+吕振羽 11.598092559
+家御宇 13.2075304714
+上个星期 11.1926274509
+规定 4.88903215091
+钱谦益 6.84020128598
+罗源 12.2912397395
+住屋 11.0674643079
+梅里雪山 12.2912397395
+参错 12.5143832909
+萨军 13.2075304714
+洗煤 11.8212361103
+潜泳 11.3357282945
+洞悉 9.7898037878
+武拒统 13.2075304714
+滑进 11.598092559
+施威 10.8561552143
+邵友濂 13.2075304714
+心向往之 11.598092559
+一千五百名 11.9547675029
+乐平县 13.2075304714
+滑过 10.9562386728
+酒保 9.20019728618
+哇啦哇啦 11.5027823792
+打抖 11.7034530746
+从御营 13.900677652
+七八日 11.7034530746
+逊克县 13.900677652
+耶律延禧 10.8561552143
+袒露 10.4349417492
+仅指 9.55687223012
+前十强 12.2912397395
+吹入 10.9562386728
+池峰城 13.900677652
+向川甘 12.8020653633
+北京民族文化宫 13.2075304714
+李家峡水电站 12.2912397395
+巴哈 11.4157710022
+准素分解 13.900677652
+签章 11.598092559
+成方 11.0674643079
+个旧 9.94943393339
+糜芳引 12.8020653633
+冷清清 11.1926274509
+山颠 12.8020653633
+智勇 10.642581114
+巴哲 12.8020653633
+鱼之乐 13.900677652
+第一角 13.2075304714
+精子细胞 12.8020653633
+玻片 13.2075304714
+子规 11.8212361103
+哼哈二将 11.7034530746
+思茅县 12.8020653633
+打扑 13.900677652
+生活舱 13.2075304714
+六斤 12.2912397395
+多顾虑 12.8020653633
+菱角 10.2630914922
+林宰 12.8020653633
+巴罗萨 11.9547675029
+单凭 9.40086798165
+得当 8.91707103027
+平凡社 12.2912397395
+四十九里 13.2075304714
+洗盘 8.99540287354
+沪深股市 8.00903344015
+仅据 12.1089181827
+送报 12.5143832909
+溢人 13.900677652
+茶摊 11.4157710022
+厥证 11.8212361103
+马亨德 13.2075304714
+大蒜素 12.5143832909
+江户城 12.2912397395
+智力 7.99259471381
+秦良 13.2075304714
+滑行 9.27570483869
+放电灯 12.5143832909
+一百零九个 13.2075304714
+小麦粥 13.900677652
+个数 8.73019365694
+乡味 13.900677652
+得得 13.2075304714
+果戈理 10.1394775363
+帝皇 12.8020653633
+产业部门 9.49395840471
+官小吏 13.900677652
+特约服务 13.2075304714
+桐庐县 11.4157710022
+晕晕乎乎 11.5027823792
+商永宁 13.2075304714
+左冲右 10.3453295905
+宽带用户 11.8212361103
+子萨木 12.8020653633
+骄横 9.38981814546
+萨达特 10.765183436
+分拣机 12.5143832909
+小麦粉 11.7034530746
+支苏利 13.900677652
+吉莫 13.2075304714
+厚泽 12.8020653633
+寇梁兄弟 12.1089181827
+飞跑 9.72629038208
+善善恶恶 13.900677652
+作训 11.2616203224
+作诗 9.34680076038
+劫持人质 12.1089181827
+步步高 10.8096351986
+单养 13.900677652
+绑成 13.2075304714
+单兵 9.41204128224
+七八支 12.2912397395
+苟且 10.4666904475
+过筛 12.2912397395
+金刚杵 13.900677652
+齐儿 13.900677652
+中文歌曲 13.900677652
+发行商 10.9562386728
+交响 10.2117981979
+木版 10.0940151622
+金城郡 10.7226238216
+作证 8.92394390956
+九江县 12.1089181827
+妇联会 13.2075304714
+作词 11.0674643079
+谌斯 13.2075304714
+帝益 13.2075304714
+鹰瞵虎视 13.900677652
+集邮家 12.8020653633
+红海洋 11.4157710022
+深州市 13.900677652
+愤世嫉俗 11.0674643079
+石板道 13.900677652
+倚天剑 13.900677652
+田千秋 11.9547675029
+曹军遂 12.5143832909
+马克西姆 11.7034530746
+耦合 9.23723855786
+炒房客 11.1926274509
+私塾 9.29550746599
+测回 12.2912397395
+单元 7.70627226087
+西撒哈拉 10.7226238216
+冢中枯骨 13.2075304714
+铛铛 12.8020653633
+尚无 7.93709830836
+绝对温度 11.1926274509
+引火上身 12.8020653633
+韩永禄 12.5143832909
+撂下 9.94943393339
+悬胆鼻 13.900677652
+过窄 12.8020653633
+鞍山 9.45802639549
+罗桑 11.8212361103
+张树义 13.900677652
+弥天 10.642581114
+韩殿甲 13.2075304714
+沪江 11.2616203224
+团委书记 11.9547675029
+饿肚 13.2075304714
+卡雷尔 12.2912397395
+玄甲 13.2075304714
+基本功能 10.533381822
+智叟 13.900677652
+交互性 12.1089181827
+一丝丝 10.2897597393
+漏字 12.2912397395
+楚灵王 11.9547675029
+智取 9.91169360541
+怔忡 10.4041700905
+舔吃 13.900677652
+西陵桥 13.2075304714
+太鲁阁 11.7034530746
+免费入场 13.900677652
+掉以轻心 9.44633035572
+一两株 13.2075304714
+送掉 10.9049453784
+诸镇遂 13.2075304714
+大百科全书 9.75754292558
+姚先生 13.2075304714
+二十出头 10.7226238216
+徐爱云 10.9562386728
+零九个 11.7034530746
+夸辩之徒 13.900677652
+一两根 13.2075304714
+三百八十四 13.2075304714
+一两样 11.7034530746
+忙成 13.2075304714
+籍归田 13.2075304714
+骗得 11.2616203224
+伊儿汗 11.0674643079
+堤上 9.55687223012
+洛厄尔 12.8020653633
+四川籍 12.8020653633
+魏格林 11.8212361103
+累不累 12.1089181827
+话机 11.9547675029
+敦促 9.01032852375
+郭冬临 10.4666904475
+话本 9.93038573842
+侯之封 12.8020653633
+胞衣 11.9547675029
+凤尾草 12.8020653633
+萨基 11.2616203224
+单值 11.1280889297
+和微尘 12.8020653633
+云横秀 13.2075304714
+曹思正 12.5143832909
+冬候鸟 11.8212361103
+常绿栎 12.2912397395
+皮秒超 13.2075304714
+福美来 12.8020653633
+韩康伯 12.2912397395
+话柄 11.4157710022
+票面价值 12.1089181827
+铜币 10.6818018271
+全封闭式 11.1280889297
+利亚人 12.8020653633
+过程 4.63897898772
+仔细观察 9.34680076038
+生长率 12.8020653633
+砻市 13.900677652
+罗森 10.3743171274
+签筒 11.598092559
+间隙 8.14493543839
+夏聚秋 13.2075304714
+墨西哥人 10.8561552143
+铜带 11.8212361103
+孙叔敖 11.4157710022
+萨城 13.900677652
+换为 11.1280889297
+暴骨 12.2912397395
+寇州 13.2075304714
+洗眼 12.8020653633
+哄弄 13.900677652
+祝颂 12.1089181827
+淡不上 13.2075304714
+墨勒根 12.5143832909
+精神分裂症 10.4994802703
+支脉 9.43476953332
+泉州 8.43684584695
+王衍之 12.8020653633
+多重态 13.2075304714
+马蜂窝 10.642581114
+乌裕尔河 11.8212361103
+三官 10.9562386728
+半接 13.900677652
+小哥儿 12.5143832909
+胡齐斯 12.8020653633
+白玉桥 12.8020653633
+条款 7.42370528909
+丛枝病 12.5143832909
+周淑贞 13.2075304714
+柔道队 13.900677652
+王俊武 13.2075304714
+多重性 12.8020653633
+己二烯 12.8020653633
+白莲社 13.2075304714
+政躬 13.900677652
+声符 11.5027823792
+真龙天子 11.4157710022
+伊里安 10.9562386728
+按摩器 12.8020653633
+单县 11.8212361103
+蝴蝶效应 11.5027823792
+送情 12.8020653633
+硕士 8.87023973058
+卓尼 12.8020653633
+艾拜都 13.900677652
+旧唐书 10.0940151622
+欠佳 9.46986085313
+榛莽 12.2912397395
+颂祝 13.2075304714
+说三道四 10.2897597393
+提供线索 10.8561552143
+恼火 8.80692745117
+辟开 12.8020653633
+巴图 11.8212361103
+人福 11.1926274509
+缺额 10.8561552143
+本明和尚 12.8020653633
+人尽皆知 11.1926274509
+教育家 8.70218062071
+钙长石 12.8020653633
+满登登 13.900677652
+测向 11.8212361103
+媾和 9.69598503258
+虫媒病毒 12.8020653633
+会务费 12.5143832909
+地衣红 13.2075304714
+螳螂拳 12.1089181827
+冈比西斯 11.8212361103
+紧张症 12.8020653633
+石没羽 12.1089181827
+立破义 13.2075304714
+三十多斤 12.5143832909
+于薄壁 12.8020653633
+单号 11.5027823792
+单叶 9.12999302751
+斟酒 9.34680076038
+一两次 9.87532596124
+彼得保罗 12.8020653633
+斟酌 8.38322475551
+作奸犯科 11.9547675029
+露珠 10.2630914922
+茶晶 12.5143832909
+单只 8.92394390956
+单句 12.5143832909
+横结肠 13.2075304714
+单另 11.0103058941
+人称 8.0229418702
+狄克型 13.900677652
+施政者 13.900677652
+沙落雁 12.1089181827
+人种 8.44963919841
+敦刻尔克 10.9562386728
+罗欣 13.900677652
+有点像 8.9308643524
+凭白无故 13.900677652
+布褂 12.1089181827
+才旦卓玛 12.8020653633
+单反 12.2912397395
+李明瑞 12.2912397395
+过秤 11.8212361103
+若蜀兵 12.8020653633
+饥馑 10.4349417492
+添注 11.8212361103
+七八枚 13.900677652
+罗毅 13.900677652
+磷酸盐 9.10488710638
+觉果 13.2075304714
+时计 12.5143832909
+牛万才 10.533381822
+经营策略 10.9562386728
+离子键 10.9562386728
+答非所问 10.3453295905
+饥饿 7.99804431857
+罗比 12.8020653633
+参道 13.2075304714
+漏壶 11.0674643079
+酶类 11.9547675029
+生长点 11.5027823792
+吹号 12.5143832909
+偶蹄目 10.2897597393
+拨通 9.24671730182
+序位 12.5143832909
+逻辑联系 11.9547675029
+加尔登 13.2075304714
+条案 11.8212361103
+二十多封 12.8020653633
+过礼 11.0103058941
+柑果 11.9547675029
+描眉 12.1089181827
+萨哈 11.3357282945
+七三年 13.2075304714
+弯来弯去 13.900677652
+射击队 11.598092559
+文学思想 11.8212361103
+地毯厂 12.2912397395
+一千五百元 11.9547675029
+胡说白道 13.900677652
+坎肩 11.0103058941
+龙标遥 13.900677652
+繁杂 9.43476953332
+水门 9.84023464143
+小个子 11.0103058941
+光度法 11.4157710022
+参透 12.5143832909
+怒从心头起 12.1089181827
+参选 10.3743171274
+巴嘎 12.1089181827
+寄生虫 9.24671730182
+吹去 11.598092559
+人祸 11.1280889297
+法罗语 13.2075304714
+玉琢金 13.2075304714
+得州 12.2912397395
+鸡飞狗叫 13.900677652
+民族出版社 13.2075304714
+绝粮 10.6818018271
+秦晋 10.533381822
+系列化 9.66657114738
+北京大学法学院 11.0674643079
+马刺 12.2912397395
+繁育场 13.900677652
+喷血 11.7034530746
+沂南县 13.2075304714
+救应 9.40086798165
+美国众议院 10.642581114
+万样 11.9547675029
+氟硅酸 13.2075304714
+扮鬼 13.900677652
+得已 13.900677652
+经历 5.7568696752
+罗殿 12.8020653633
+学过来 13.900677652
+每台 10.1164880181
+日据时代 13.2075304714
+伍之清 13.2075304714
+五十余日 11.9547675029
+柯西金 12.5143832909
+马勇 11.8212361103
+茶末 11.598092559
+魏为氏 12.2912397395
+闹元宵 13.900677652
+联结词 11.8212361103
+交游广阔 12.8020653633
+汝宁沙 13.2075304714
+单务 13.2075304714
+任意性 11.2616203224
+马连良 10.9562386728
+巴基 11.9547675029
+森林狼 12.5143832909
+新利 13.2075304714
+苑川城 13.2075304714
+作用力 9.08039608637
+湿球温度 13.2075304714
+鲜绿色 12.2912397395
+社会科学 8.20358416547
+伊里奇 12.8020653633
+远水解不了近渴 13.2075304714
+伫足 13.2075304714
+人工免疫 13.2075304714
+詹首先 13.2075304714
+眼馋 10.765183436
+鸾舆 12.8020653633
+宁安府 12.5143832909
+学术讨论 11.7034530746
+晚年时期 13.900677652
+刘胡兰 10.765183436
+安理会 10.1394775363
+茶杯 8.37921673411
+芽接 11.598092559
+燃机 13.900677652
+过磅 12.8020653633
+五虎将 11.5027823792
+收购方 10.642581114
+吹到 10.9562386728
+伏龙涅 13.900677652
+漏失 12.5143832909
+随随 13.900677652
+庆典 8.73589167805
+未熟 11.9547675029
+聂崇歧 13.2075304714
+欠下 9.94943393339
+额尔古纳河 9.34680076038
+漏夜 12.2912397395
+马勒 10.1871055853
+模范生 13.900677652
+腐朽性 12.1089181827
+参酌 11.3357282945
+舍甫琴科 13.2075304714
+瞿维 12.2912397395
+繁昌 12.1089181827
+不透水 11.1280889297
+唯灵论 13.900677652
+单利 9.74179456862
+系列剧 13.900677652
+有点儿 8.34771806705
+优礼有加 13.2075304714
+优秀党员 12.1089181827
+繁星 10.1394775363
+远郊区 12.1089181827
+智光 10.0505300503
+依然故我 11.7034530746
+白度母 12.5143832909
+厘正 13.2075304714
+秽土 13.2075304714
+随附 12.8020653633
+施工现场 10.3743171274
+章子 12.2912397395
+不透气 11.7034530746
+审时度势 10.0720362555
+话旧 12.8020653633
+珍馐 10.604840786
+北京宣武医院 13.2075304714
+巴坦 13.2075304714
+那沙僧 11.2616203224
+欠付 12.1089181827
+个人用户 11.598092559
+跳上来 13.2075304714
+单刀 10.4041700905
+基本系 12.8020653633
+谁举证 13.2075304714
+鞍座 12.8020653633
+方铅矿 10.9049453784
+欠交 13.2075304714
+铜屑 13.2075304714
+赛期 12.8020653633
+未然 12.8020653633
+涨工资 10.9049453784
+丁香酚 13.2075304714
+营营苟苟 13.900677652
+丽贝卡 13.2075304714
+层系 12.1089181827
+宁安市 12.8020653633
+替人家 10.8561552143
+蟠桃 10.0940151622
+茶树油 13.900677652
+辟建 11.7034530746
+铜山 10.8096351986
+舌鳎 12.2912397395
+片儿 11.3357282945
+瘘管 11.7034530746
+单剑 13.900677652
+王镇邺 13.2075304714
+随队 11.1280889297
+发号施令 9.89334446674
+东大路 12.2912397395
+满盈 13.900677652
+械斗 10.8096351986
+钻石矿 13.2075304714
+富龙 11.598092559
+左企弓 10.6818018271
+订书 13.2075304714
+太沉太 13.2075304714
+用典 10.642581114
+健美操 12.5143832909
+铜厂 13.2075304714
+由三军 12.8020653633
+膏血 12.8020653633
+白线 10.3171587135
+罗敦 13.900677652
+前所未闻 11.598092559
+厚恩 9.98865464655
+洗消剂 13.2075304714
+温妈 11.0103058941
+无限小数 12.5143832909
+暴露 7.30626419223
+尺码 11.7034530746
+麦克斯韦 9.05649056552
+未结 12.5143832909
+罗敷 13.2075304714
+装甲旅 10.2897597393
+高朗亭 12.2912397395
+十万人 10.1394775363
+青石板路 13.2075304714
+离题万里 11.9547675029
+光听 11.2616203224
+司马仲达 12.5143832909
+公路沿线 11.4157710022
+子薰 13.2075304714
+私弊 13.900677652
+例证法 13.900677652
+喂入 12.2912397395
+婚姻恋爱 12.8020653633
+感激不尽 10.1630080337
+羌寨 13.2075304714
+平林诸 13.2075304714
+几百位 13.900677652
+紧盯 9.28555713513
+智庵 12.8020653633
+漏嘴 13.900677652
+预产期 11.1926274509
+订为 12.5143832909
+选举地理 13.2075304714
+播报 10.2897597393
+荔波县 11.1926274509
+三聚氰胺 9.82314020807
+增强版 13.900677652
+茶桌 11.0674643079
+上海民族乐团 12.8020653633
+订下 10.2371160058
+蒺藜 10.533381822
+德国人 8.33615724465
+十万份 13.2075304714
+婺绿 11.9547675029
+乐至县 13.900677652
+龙少爷 13.900677652
+坚苦 13.2075304714
+旅资 13.900677652
+智库 10.0505300503
+巴塞 12.2912397395
+巴塘 10.9562386728
+激流勇退 12.8020653633
+硫化锌 11.598092559
+一些则 10.765183436
+细胞工程 11.4157710022
+蓄积性 13.900677652
+土八路 12.1089181827
+人眼 9.53122979951
+订价 12.8020653633
+第一第二第三第四 13.2075304714
+移植手术 11.8212361103
+硫化锑 12.8020653633
+磻溪 13.2075304714
+产品类别 11.2616203224
+办手续 10.604840786
+缴送 13.2075304714
+坐享其成 11.0674643079
+裴李岗 11.4157710022
+十万个 12.2912397395
+丹诏 10.8096351986
+播扬 12.5143832909
+罗旭 11.5027823792
+写出 7.84155445639
+水磨石 11.598092559
+无水氢氟酸 12.5143832909
+辅导 9.21854642485
+银道面 11.0103058941
+供给部 12.8020653633
+石炭纪 9.65218240993
+优先选择 11.0103058941
+特种邮票 12.1089181827
+敬义皇帝 13.2075304714
+跑腿 10.4994802703
+防务展 13.2075304714
+订交 13.2075304714
+统一化 12.5143832909
+库兹巴 12.1089181827
+号啕大哭 10.765183436
+转口贸易 10.604840786
+白细胞 8.78268383956
+硫化镉 11.8212361103
+大大方方 10.0940151622
+功过相抵 12.8020653633
+蓝军 11.9547675029
+订亲 11.1280889297
+过着 12.2912397395
+扳着 9.84023464143
+罗斛 13.2075304714
+乳白色 9.29550746599
+丰衣足食 11.598092559
+怒不可遏 9.72629038208
+检务 12.8020653633
+铜印 10.533381822
+给面子 11.0674643079
+支谦 12.8020653633
+订于 11.2616203224
+葵叶 12.2912397395
+出海打鱼 12.5143832909
+巴利亚多利德 11.9547675029
+任太仆 13.900677652
+茶棚 12.2912397395
+喂养 9.0884932966
+多维科 13.900677652
+检察工作 11.8212361103
+二硫键 11.8212361103
+得分 8.96620371885
+人皮 9.49395840471
+十五匹 13.2075304714
+染疾 12.1089181827
+预警机 9.6811699468
+千变万化 10.0088573539
+强间 13.900677652
+高楼大厦 10.3453295905
+战精兵 13.900677652
+案发前 10.8561552143
+葛罗米柯 13.2075304714
+巴姆 12.8020653633
+喇叭花 12.1089181827
+石滚子 13.900677652
+几百万 9.04864738806
+杀人放火 9.69598503258
+支路 10.2897597393
+随风 9.5186510173
+严惩凶手 13.2075304714
+国民生产 12.1089181827
+静极思动 13.900677652
+硫化钠 12.1089181827
+西章武 13.900677652
+得利 9.62401153296
+雷基 12.8020653633
+调给 13.900677652
+几百个 9.89334446674
+刚来时 11.0674643079
+雀起 12.8020653633
+得到 4.60931044136
+订作 12.5143832909
+猴头菇 12.2912397395
+几百两 11.4157710022
+捎带脚儿 13.900677652
+硫化铅 12.2912397395
+三十一个 13.2075304714
+硫化铁 11.8212361103
+靠右走 13.2075304714
+生理病害 13.2075304714
+内环路 12.5143832909
+推己及人 12.5143832909
+本地网 13.900677652
+小灵通 10.7226238216
+倒上来 13.2075304714
+放鸽子 12.1089181827
+合同书 11.4157710022
+硫化铜 13.900677652
+智德 11.5027823792
+茶楼 8.99540287354
+和德秀 11.1926274509
+过盈 12.5143832909
+交合 11.1280889297
+道路设计 11.8212361103
+铜勺 12.5143832909
+喜树碱 11.8212361103
+硫化银 12.5143832909
+测字 9.93038573842
+未羊 12.8020653633
+几百乡 12.8020653633
+过目 9.28555713513
+阿曼尼 13.900677652
+染病 9.77354326693
+大型犬 13.2075304714
+条条 10.0088573539
+雀跃 11.3357282945
+南普陀 12.1089181827
+掩护物 13.900677652
+鱼珠 11.9547675029
+景谷傣族彝族自治县 12.5143832909
+戴宗来 12.2912397395
+一千五百年 12.8020653633
+脚麻 12.1089181827
+单就 13.900677652
+神农架林区 10.9562386728
+骨髓细胞 11.9547675029
+但见 7.80485308954
+未置 11.9547675029
+七八桶 13.900677652
+供给量 9.72629038208
+汽车连 12.5143832909
+巴奇 13.900677652
+洽谈室 12.8020653633
+盐运使 10.0940151622
+十一点半 12.8020653633
+角钱 11.2616203224
+铜制 10.3171587135
+努力提高 9.48183704418
+王静安 12.8020653633
+几百人 9.49395840471
+几百亿 11.5027823792
+过瘾 9.71102290995
+浪尖 11.598092559
+温溜 13.900677652
+红参 12.5143832909
+几百亩 11.5027823792
+小车子 13.2075304714
+中产阶级 8.9519177616
+个案 9.01032852375
+得劲 12.8020653633
+十数步 12.5143832909
+得势 9.69598503258
+忘恩负义 9.77354326693
+炒房团 10.4041700905
+漂儿 13.2075304714
+京郊 10.2371160058
+令人高兴 11.5027823792
+支走 12.1089181827
+万亿千米 12.5143832909
+秦剑含 13.900677652
+现行法 12.2912397395
+萨宾 12.1089181827
+圣迭戈 11.1926274509
+合同价 12.5143832909
+偏二甲肼 12.5143832909
+各凭本事 13.900677652
+渔女 13.900677652
+但要 8.14810501315
+罗纳河 13.900677652
+鄙俚 11.9547675029
+十万余 11.0103058941
+出租率 11.1280889297
+一些半 12.2912397395
+七八根 13.2075304714
+陈平生 13.900677652
+鄙俗 11.1926274509
+林中飞 12.8020653633
+蛋白酶 10.4994802703
+捕获 8.4980002701
+几百份 13.2075304714
+炸起来 12.5143832909
+尸位 12.2912397395
+恼羞 13.2075304714
+过百 11.1280889297
+涉足 8.43261751084
+中心广场 11.0674643079
+上颌牙 13.900677652
+解决方案 8.56795885871
+几百件 11.8212361103
+暴雪 8.80692745117
+大总统 8.60236028543
+富平侯 12.8020653633
+封祁国 13.2075304714
+尸体 6.75706004927
+沙头角镇 13.2075304714
+地下组织 10.4041700905
+单层 9.80633308975
+一两杯 12.8020653633
+私人侦探 12.8020653633
+包勇 11.3357282945
+求仁得仁 13.2075304714
+角钢 12.2912397395
+坏账 9.10488710638
+培训基地 10.8096351986
+越坏 12.5143832909
+洗碗 10.4994802703
+风流冤孽 13.2075304714
+病亡 11.598092559
+罗村 13.2075304714
+繁殖 7.05586217277
+七手八脚 10.3453295905
+沃耶伊 12.8020653633
+格卡农 13.900677652
+集装箱船 10.8096351986
+不理不睬 10.7226238216
+发怵 10.1871055853
+战略情报 13.2075304714
+恢复原状 10.4041700905
+高韧性 12.5143832909
+姜铁 13.2075304714
+漂动 12.2912397395
+迫不得已 9.32596667347
+地毯式 11.4157710022
+汉得朔 13.2075304714
+罗杰 11.598092559
+科米诺 13.900677652
+郑州火车站 10.3743171274
+清虚观 12.8020653633
+肯尼斯 12.2912397395
+考上 9.06439574502
+屯田制 12.8020653633
+张应力 12.8020653633
+王建平 13.900677652
+得免 10.9562386728
+纵断面 12.8020653633
+彗尾 11.5027823792
+吹弹 11.4157710022
+上半夜 11.0103058941
+巴渝 13.2075304714
+规则 6.55209012105
+南瓜子 12.1089181827
+若有 8.3555002075
+气流 8.02574692112
+规划 5.96187540382
+矮人一截 13.900677652
+伊夫尼 13.900677652
+宁安县 10.9562386728
+杨业领 13.2075304714
+郝家庄 13.900677652
+剪应力 10.9562386728
+考中 9.98865464655
+维塞尔 12.2912397395
+真不知道 9.26594866375
+吹开 11.5027823792
+辅大 13.900677652
+罗本 13.900677652
+袁术 9.4233408375
+罗木 12.8020653633
+流涎 10.9562386728
+知者 11.7034530746
+忙活 9.36807815882
+规制 9.96885201925
+微音器 12.8020653633
+七八步 12.1089181827
+上寒武 12.5143832909
+新赛欧 13.2075304714
+古新统 11.8212361103
+单弱 11.1280889297
+古尔邦 13.900677652
+统一党 10.604840786
+家常话 10.9562386728
+袁某 12.2912397395
+权大惊 12.5143832909
+罗某 11.9547675029
+单弦 11.2616203224
+单张 11.3357282945
+棋牌室 13.2075304714
+饶乐水 12.8020653633
+过电 12.1089181827
+收购案 10.765183436
+柜房 13.2075304714
+本合同 13.900677652
+乳糜管 13.900677652
+窝主 11.3357282945
+口哨声 12.8020653633
+单式 11.8212361103
+人生 6.84795660274
+漂到 11.3357282945
+芨芨草 11.598092559
+指挥部 8.33999602096
+单开 13.900677652
+万英镑 9.66657114738
+貌美如花 13.2075304714
+平房区 12.8020653633
+七八次 12.2912397395
+康暗沙 12.1089181827
+电解槽 10.4994802703
+徙居 10.4666904475
+话梅 12.2912397395
+丹凤县 11.7034530746
+规劝 10.0505300503
+送气 11.1280889297
+任东郡 12.8020653633
+颜氏 11.1280889297
+替工 13.900677652
+袁枚 11.0103058941
+采购价 11.8212361103
+时谚 13.900677652
+虎虎有生气 13.900677652
+忠义 8.65893063692
+戒定慧 13.900677652
+路费 9.71102290995
+石炭系 10.7226238216
+按摩女 13.2075304714
+洪湖赤卫队 12.2912397395
+飞艇 10.8096351986
+沙为平 13.2075304714
+周定公共 13.900677652
+电路图 12.5143832909
+银货两讫 13.900677652
+原子反应堆 11.8212361103
+人畜 8.9102450652
+亚寒带 10.3453295905
+中国家电协会 13.2075304714
+性本能 12.5143832909
+昧着 12.5143832909
+克丽斯 12.8020653633
+洒遍 11.9547675029
+裒辑 13.900677652
+得出 6.89943202991
+吹得 9.12155415886
+联锁 11.598092559
+传奇人物 10.765183436
+华尔特 13.900677652
+自我完善 11.9547675029
+生长素 10.4994802703
+防办 10.8096351986
+卫红的 12.5143832909
+秦朝 9.6811699468
+经卷 9.62401153296
+萨摩亚语 12.5143832909
+土豆片 13.2075304714
+魁首 10.2630914922
+游览区 9.23723855786
+单座 10.4994802703
+北大学生 11.9547675029
+安闲自在 13.2075304714
+加减乘除 11.0674643079
+任达华 12.1089181827
+孳生地 13.900677652
+潮汕人 13.2075304714
+形象艺术 13.2075304714
+国际金融报 9.33632946051
+罗普 12.8020653633
+单店 10.642581114
+二百四十多名 13.2075304714
+巴利斯 13.900677652
+转移酶 12.2912397395
+伶牙利齿 12.8020653633
+三班制 13.900677652
+俞国华 12.8020653633
+讲究卫生 11.9547675029
+于安邑 13.2075304714
+萨奇 13.900677652
+行为性 13.2075304714
+漂去 12.8020653633
+不划算 10.1630080337
+民用化 13.2075304714
+罗昂 12.1089181827
+生活费 9.59661255877
+罗明 11.4157710022
+单廷 10.0720362555
+壳子 10.4994802703
+生息繁衍 11.2616203224
+麻索 11.8212361103
+熔于一炉 11.9547675029
+罗易 12.2912397395
+武术比赛 12.8020653633
+掌诏敕 12.2912397395
+罗星 12.8020653633
+铜像 9.34680076038
+条施 13.900677652
+发觉到 11.9547675029
+崇左市 12.8020653633
+萨多 13.900677652
+炎陵县 12.2912397395
+急火攻心 11.9547675029
+搞不好 10.1871055853
+考伯 13.2075304714
+情深意长 13.900677652
+条文 9.04864738806
+小姨妈 11.9547675029
+十三次 12.5143832909
+久而久之 9.19114745066
+茶歌 12.8020653633
+条斑 12.8020653633
+红发 12.1089181827
+薛昂 10.642581114
+支边 12.8020653633
+袁昶 12.8020653633
+用手挤 12.2912397395
+过些天 12.1089181827
+验伤 12.2912397395
+靠右边 13.900677652
+责任田 11.0674643079
+石椁里 12.5143832909
+三宫 10.6818018271
+巴子 11.0103058941
+帝禅 11.7034530746
+条数 11.9547675029
+洛茨基 13.900677652
+管制员 12.5143832909
+呈贡县 13.900677652
+惊险刺激 12.8020653633
+不透性 13.900677652
+涉过 11.2616203224
+露天甲板 13.900677652
+眉来眼去 10.9049453784
+御赐 9.93038573842
+子虚 13.900677652
+人理 10.765183436
+织机 9.33632946051
+鄂百灵 11.8212361103
+木腐菌 13.2075304714
+检出 9.58318953844
+德帕迪 13.2075304714
+罗曼 10.0940151622
+军事博物馆 12.2912397395
+名标青史 13.2075304714
+骄敌 13.900677652
+千里光 13.2075304714
+明末清初 8.74738605748
+作物气象 13.900677652
+家政公司 12.2912397395
+条支 11.7034530746
+单干 10.2897597393
+递出去 13.900677652
+想都不想 13.2075304714
+王永庆 12.2912397395
+用手掌 10.1164880181
+范石湖 13.2075304714
+雷器 13.2075304714
+珍闻 13.900677652
+泉台 13.2075304714
+眼镜 7.98988100794
+次测试 12.8020653633
+绝热层 12.8020653633
+公开监督 11.8212361103
+人瑞 12.8020653633
+尘埃云 12.2912397395
+罗克韦尔 11.5027823792
+护士长 10.604840786
+单幅 11.4157710022
+按程序 10.533381822
+伦博 13.900677652
+羌塘 9.71102290995
+复现 10.8561552143
+辛丑 10.1630080337
+柞树 11.0103058941
+满眶 11.1280889297
+桥涵 11.4157710022
+茶水 8.57766767284
+开户数 8.89673134603
+非斩不可 12.5143832909
+李晓峰 13.900677652
+眉心 10.3743171274
+屏退 9.74179456862
+编辑室 11.9547675029
+万千米 8.64840422393
+直流电 9.13850371718
+未竟 11.3357282945
+吹奏 9.84023464143
+汉武帝 7.95787827685
+原巴勒 13.2075304714
+哦唷 13.2075304714
+临淄区 12.2912397395
+第九日 13.2075304714
+克勒斯 10.9562386728
+和岩体 11.9547675029
+麝鼠 10.5684731418
+办公会 11.5027823792
+阴君火 13.2075304714
+遮太阳 12.8020653633
+洗练 10.0505300503
+戴宗报 13.2075304714
+一千五百家 13.2075304714
+胞腔 12.8020653633
+刑满释放 10.4666904475
+漏刻 11.7034530746
+一目了然 9.54396882529
+铜城 9.62401153296
+恩威并用 12.1089181827
+齐齐站 13.2075304714
+可圈可点 10.0720362555
+铁树 10.2897597393
+根瘤菌 10.642581114
+得梅因 13.900677652
+学成归国 13.2075304714
+仅此 9.89334446674
+慌张起来 12.5143832909
+大研镇 12.5143832909
+铜基 12.8020653633
+单姓 11.0103058941
+普定府 13.2075304714
+辅弼 11.2616203224
+三段论 10.604840786
+岁收 12.1089181827
+形成层 10.2371160058
+方正集团 13.2075304714
+漏划 13.2075304714
+支行 8.62256299275
+胞膜 12.2912397395
+测度 10.5684731418
+浪头 10.4349417492
+单头 13.2075304714
+标准厂房 12.8020653633
+玄学家 11.1280889297
+过猛 9.89334446674
+闪烁不定 10.8096351986
+破壳 11.0674643079
+迷迷蒙蒙 12.2912397395
+霍都 13.2075304714
+人猿 13.2075304714
+还带 13.900677652
+漂向 12.8020653633
+网络相册 13.900677652
+茶油 10.5684731418
+西南侧 10.765183436
+石穴 11.8212361103
+铜圈 12.8020653633
+辛二 13.2075304714
+芥川 11.4157710022
+骑坐 11.1926274509
+富铁 11.1280889297
+双百方针 13.2075304714
+卡介苗 11.4157710022
+陆承伟 9.35738286971
+巴山 9.16447920358
+冒昧 9.75754292558
+紫色土 10.6818018271
+母以子贵 11.5027823792
+辛亥 10.8561552143
+本已 9.6811699468
+眉形 13.2075304714
+快感 9.22784881751
+帝纪 11.2616203224
+铜块 11.5027823792
+北京市第二中级人民法院 11.4157710022
+价格低 10.2897597393
+交叉感染 10.9562386728
+巴尔 9.6811699468
+大豆磷脂 13.2075304714
+毕星 12.8020653633
+收件箱 13.900677652
+朱府 13.2075304714
+导引头 10.8561552143
+舌音 13.2075304714
+爱国统一战线 11.2616203224
+游刃 13.2075304714
+卡扬德 13.2075304714
+白孝武 10.4666904475
+辗成 13.900677652
+巴尼 10.9562386728
+艺术系 11.0674643079
+营养繁殖 10.765183436
+韩侨 13.900677652
+犷悍 12.5143832909
+美洲国家 11.4157710022
+张佩纶 12.5143832909
+马医 12.1089181827
+非市场 11.3357282945
+坏话 9.75754292558
+排名赛 12.2912397395
+清远市 11.0674643079
+无量山 11.2616203224
+瞄准具 9.94943393339
+充分性 12.8020653633
+滑脱 10.9562386728
+漏卮 13.900677652
+人犯 9.25628675283
+贩毒集团 13.2075304714
+夹缠不清 12.8020653633
+内亲 12.5143832909
+觉民 12.8020653633
+午时 9.56994431169
+冉璞计 13.2075304714
+子胡 13.2075304714
+室外天线 12.8020653633
+子胤 11.1926274509
+子胥 12.1089181827
+兵备道 10.765183436
+四五十只 13.2075304714
+萨彦 13.2075304714
+常恐秋 13.2075304714
+参议会 10.7226238216
+潇水 11.598092559
+孔明今 13.900677652
+于家务 13.2075304714
+富镁 11.7034530746
+巴巴 9.24671730182
+没等我 10.2117981979
+欧洲核子研究中心 12.2912397395
+罗恩 11.8212361103
+作船 13.900677652
+拦路抢劫 12.8020653633
+占上风 9.96885201925
+朱序 12.5143832909
+紫斑病 13.2075304714
+毛长达 12.5143832909
+吹塑 11.598092559
+屯溪市 13.2075304714
+盐基性 13.900677652
+石窑 11.2616203224
+富锦 11.1280889297
+普列谢茨克 13.900677652
+许州鄢 13.2075304714
+藤花厅 13.2075304714
+长轴距 10.9049453784
+平克尔 13.900677652
+滑腻 10.4349417492
+辅币 11.4157710022
+切菜机 13.900677652
+单壳 12.1089181827
+神术金 13.2075304714
+衰老 8.44109213783
+富锰 13.2075304714
+罗思 10.7226238216
+西南乡 12.8020653633
+子肯 13.900677652
+姐妹篇 12.2912397395
+送殡 10.6818018271
+刘处玄 12.5143832909
+作色 11.598092559
+米诺蒂 13.2075304714
+未算 13.900677652
+作艺 13.900677652
+每匹 11.4157710022
+狮身人面像 11.0103058941
+赃官 11.5027823792
+检场 11.8212361103
+查耳酮 13.900677652
+张若锦 13.900677652
+哪家 9.20019728618
+农垦局 13.900677652
+林奇 11.0103058941
+八十多条 13.900677652
+病原体 9.53122979951
+柏抱槐 13.2075304714
+塔恩 13.900677652
+比斯开湾 11.8212361103
+海陵郡 13.2075304714
+路乌古 13.2075304714
+送礼人 12.8020653633
+日间 9.34680076038
+子聪 12.8020653633
+张克侠 13.2075304714
+薛暮桥 12.2912397395
+按摩师 12.1089181827
+缴销 12.5143832909
+奥克兰 10.9562386728
+重大意义 9.24671730182
+刀马旦 11.8212361103
+测量仪 11.2616203224
+禄忠臣 13.2075304714
+秋收作物 13.2075304714
+吉萨 11.8212361103
+商品名称 9.96885201925
+滑膛 10.9562386728
+滑膜 13.2075304714
+酸度计 13.900677652
+每十年 11.598092559
+测得 9.31571017331
+五千多万 12.5143832909
+溅射 11.9547675029
+私念 12.2912397395
+送死 9.75754292558
+格利 10.9049453784
+智子 13.900677652
+杜亚莉 11.5027823792
+裸子植物 9.36807815882
+阿尔瓦罗 13.900677652
+人物 5.7902504144
+释宋围 13.2075304714
+一日日 11.8212361103
+性情温顺 11.7034530746
+历立成 13.2075304714
+马大猷 13.2075304714
+正规军 9.56994431169
+徐致靖 11.4157710022
+蓝不蓝 12.8020653633
+黄旗海 12.1089181827
+桑戈尔 12.2912397395
+相互关系 8.26232298264
+班彪续 13.2075304714
+山港 13.2075304714
+狂悖 10.9562386728
+洗罪 13.2075304714
+言谈间 12.2912397395
+光唱 13.900677652
+新剧 10.4349417492
+分赃不均 13.2075304714
+广东话 11.7034530746
+铜器 8.52539924429
+筛分 11.4157710022
+送检 10.2371160058
+农机手 13.900677652
+骄悍 12.8020653633
+智士 12.8020653633
+比鲁尼 12.5143832909
+木成堰 13.2075304714
+糖原生成 13.900677652
+钩状物 13.2075304714
+扁桃体 10.2630914922
+烟雾弹 12.5143832909
+替夫 13.900677652
+衰草 10.9049453784
+卖弄玄虚 13.900677652
+稳压器 12.1089181827
+浪客 13.900677652
+坝桥 12.2912397395
+望乡台 13.2075304714
+内耳 9.98865464655
+四川省 7.61281909181
+孢粉学 12.1089181827
+侦缉队 10.8561552143
+作脸 13.900677652
+辟地 12.8020653633
+刘培 12.5143832909
+沈阳北站 13.2075304714
+第一辆 9.45802639549
+土窑洞 11.5027823792
+制法 8.89673134603
+单宁 10.0088573539
+效益型 11.8212361103
+东大营 11.0103058941
+参预 9.20932976975
+庖丁 11.9547675029
+白眉白 13.900677652
+特隆赫姆 12.5143832909
+毛蓝 13.900677652
+拳道 13.900677652
+岁月 7.87239913175
+央视国际 12.5143832909
+邮集 13.2075304714
+潇潇 11.0674643079
+富阳 10.1630080337
+播撒 11.5027823792
+子莫 12.8020653633
+漂回 13.900677652
+精英教育 13.900677652
+孙休 12.5143832909
+往来于 9.93038573842
+一百多间 13.2075304714
+岁末 9.04864738806
+帕德方程 13.900677652
+萨尔 10.1630080337
+单寒 13.2075304714
+重新点燃 11.598092559
+吸声板 13.900677652
+两档子 13.900677652
+比较清楚 10.765183436
+伊夫堡 13.900677652
+沿海各县 13.2075304714
+高速成长 10.2897597393
+电解液 10.3171587135
+织成 9.45802639549
+简森 13.900677652
+走后 8.24119543622
+沈思孝 10.3453295905
+柳林里 12.5143832909
+一朝一夕 10.1630080337
+山驿 13.900677652
+安东尼 9.77354326693
+地板砖 13.2075304714
+风起云涌 9.59661255877
+添作 13.2075304714
+找来 8.55357012126
+向西伸 12.5143832909
+富集 8.86372504956
+知彼知己 11.3357282945
+始料所及 13.2075304714
+临桂县 12.1089181827
+福建省人民政府 12.5143832909
+颇费猜测 13.2075304714
+第一辑 11.9547675029
+游回 11.1280889297
+拉维斯 12.5143832909
+水德王 12.1089181827
+铁桶 10.0720362555
+农村面貌 12.2912397395
+变音 11.5027823792
+抠字眼 12.5143832909
+巴布 10.9049453784
+单季 8.79473217808
+剪应变 12.5143832909
+披红戴花 12.2912397395
+打落水狗 13.900677652
+一千五百多 11.9547675029
+布袋中 12.5143832909
+单孔 11.2616203224
+单字 10.533381822
+苏星 12.8020653633
+浪子 9.85762638414
+单子 9.41204128224
+患病 8.52078029844
+绝对几何 12.8020653633
+喊救命 11.9547675029
+洗米 13.2075304714
+广州地区 10.765183436
+浑浑沌沌 13.2075304714
+子茅 11.7034530746
+草儿 12.2912397395
+席梦思 10.3171587135
+叶石栎 12.8020653633
+法雨 11.9547675029
+罗扇 12.5143832909
+孙策引 12.5143832909
+支词 13.900677652
+电解水 12.2912397395
+表嫂 11.8212361103
+学雷锋 11.9547675029
+得名 6.789981529
+二龙戏珠 12.1089181827
+灰熊队 13.900677652
+作者 5.87091913153
+子若 13.900677652
+睡前服 12.2912397395
+岁晚 13.900677652
+兰新线 11.5027823792
+操令众 13.2075304714
+罗托 11.7034530746
+菱花 11.5027823792
+雪停了 11.5027823792
+一两手 13.2075304714
+漏光 12.5143832909
+下酒 10.1630080337
+眉峰 11.4157710022
+谈出 11.7034530746
+温经散寒 11.598092559
+童书业 13.2075304714
+救济者 12.8020653633
+接收机 9.53122979951
+厚板 10.2897597393
+化痰 9.5062284973
+康昆仑 12.8020653633
+前十名 9.27570483869
+洗过澡 11.8212361103
+鄂西北 10.8096351986
+子花 11.2616203224
+眼泡 11.0103058941
+爬上来 10.0940151622
+生存背景 13.2075304714
+潇湘 9.26594866375
+挡回来 13.900677652
+正规化 9.72629038208
+案发后 9.94943393339
+罗成 12.1089181827
+卡瓦列 13.2075304714
+岁星 10.9562386728
+互相承认 12.8020653633
+轴心国 9.7898037878
+多年冻土 10.2371160058
+卡瓦利 13.900677652
+克勒曼 13.2075304714
+巴德 10.1871055853
+罗戬 11.7034530746
+坏血 13.900677652
+魏曹植 12.8020653633
+人烟 9.31571017331
+厚朴 9.69598503258
+药学系 12.2912397395
+过热 8.53470163695
+剜肉补疮 13.900677652
+市党部 12.8020653633
+张爱玲 11.7034530746
+降志辱身 13.2075304714
+宋一鹤 11.4157710022
+象雄 12.2912397395
+恸哭 10.4994802703
+昧爽 12.8020653633
+声名狼藉 10.4349417492
+肯尼思 12.5143832909
+萨巴 12.2912397395
+苏莱姆 13.2075304714
+漏出 10.6818018271
+横盘 8.71329184614
+罗拜 12.1089181827
+糖腺苷 11.9547675029
+痴人说梦 11.0674643079
+斑迹 13.2075304714
+林根 11.8212361103
+达拉斯市 13.2075304714
+兴庆宫 11.5027823792
+蜥脚类 11.8212361103
+眉山 10.4666904475
+滞育 10.8561552143
+漂在 10.7226238216
+副博士 13.900677652
+第十四届 10.3453295905
+生活观 12.8020653633
+两虎相斗 13.900677652
+巴彦 11.5027823792
+东方航空 10.3743171274
+叶泰安 11.4157710022
+现查 13.2075304714
+细雨绵绵 13.2075304714
+伊赛克 12.2912397395
+客观性 9.58318953844
+年龄层 13.2075304714
+千多倍 13.2075304714
+眉尖 11.2616203224
+东窗事发 11.4157710022
+泉城 11.9547675029
+滞胀 9.65218240993
+民用型 11.7034530746
+半个世纪 9.02548032877
+阳化风 12.5143832909
+电解法 10.533381822
+驱动程序 13.2075304714
+汪宇明 12.5143832909
+珍重 10.0505300503
+半点钟 13.900677652
+叫冤 12.8020653633
+骄慢 13.900677652
+岁暮 11.8212361103
+恩荣并济 13.900677652
+孙文焕 11.8212361103
+中君臣 13.2075304714
+恒流源 13.2075304714
+一两折 13.2075304714
+蟪蛄 13.900677652
+播放 8.68574189437
+土豆皮 12.1089181827
+战略思维 11.4157710022
+宋一鸟 13.2075304714
+十三四 13.900677652
+单方 10.0294766411
+第六课 13.900677652
+黄草 11.5027823792
+黄荆 12.2912397395
+农机局 11.2616203224
+吹散 10.2897597393
+汇报情况 11.3357282945
+镇雄县 12.2912397395
+千鸟 10.9049453784
+繁冗 11.598092559
+彷徨 9.59661255877
+亿比索 12.5143832909
+后视镜 9.43476953332
+生命线 9.62401153296
+镜花水月 11.9547675029
+送回 8.77671367257
+普雷 11.0674643079
+萨托 11.0674643079
+伊拉苏 13.900677652
+创利税 13.900677652
+凭祥市 11.8212361103
+铜殿 11.9547675029
+单斗 12.1089181827
+舒兰县 13.2075304714
+一百二十斤 12.8020653633
+话剧 8.4801426527
+唐诗宋词 12.1089181827
+金木 11.9547675029
+得款 12.1089181827
+台翠岩 13.900677652
+安全隐患 9.4233408375
+安格拉 13.2075304714
+子常洛 12.1089181827
+沾惹 11.4157710022
+长期性 9.98865464655
+麻酱面 12.8020653633
+李嗣源 11.598092559
+修昔底 11.2616203224
+五等奖 12.8020653633
+黄茅 11.5027823792
+马大人 11.598092559
+洗衣粉 10.1871055853
+若明 12.2912397395
+代工 9.91169360541
+单日 8.11993413618
+相思豆 13.2075304714
+访贤 12.5143832909
+试点经验 12.8020653633
+统帅部 8.89004235788
+教书匠 12.2912397395
+透射系数 12.8020653633
+高力 12.2912397395
+子常洵 12.1089181827
+施潘达 13.900677652
+人保 9.40086798165
+规格 7.88452049228
+稻糠 13.900677652
+悔棋 13.2075304714
+扶掖 13.2075304714
+招认 11.2616203224
+非洲大陆 9.32596667347
+直发毛 13.2075304714
+话别 11.0674643079
+行为学 11.8212361103
+孙权尚 13.2075304714
+声乐 9.25628675283
+繁文缛节 10.9049453784
+黄菊 11.598092559
+找好 12.2912397395
+测报 12.2912397395
+自传体 10.3743171274
+绊子 11.3357282945
+厚壁 11.3357282945
+八十里 10.8096351986
+聂崇岐 13.2075304714
+七八具 13.900677652
+条干 13.2075304714
+游牧人 12.2912397395
+瘦肉粥 13.900677652
+罗川 13.2075304714
+氢硫酸 12.8020653633
+二十多辆 12.8020653633
+袁州 11.7034530746
+秦特 13.2075304714
+美术班 13.900677652
+条幅 10.0294766411
+绮语 13.900677652
+织就 11.9547675029
+积重难返 10.9562386728
+苏莱曼 10.6818018271
+每节课 11.9547675029
+审计工作 11.0674643079
+新西伯利亚 10.8096351986
+德里克 11.598092559
+敌我不分 12.2912397395
+冠状沟 12.5143832909
+罗巾 12.8020653633
+云杉林 10.0505300503
+人众 10.1871055853
+欠租 11.8212361103
+外管局 8.96620371885
+青君兄 10.9049453784
+七窍冒烟 13.900677652
+签为 13.2075304714
+个儿 9.19114745066
+左右间 13.900677652
+赢面 12.8020653633
+散摊 13.2075304714
+飞返 11.9547675029
+单数 10.3171587135
+沾恩 12.1089181827
+智显 13.2075304714
+句点 13.2075304714
+潜心 9.19114745066
+没头没脑 9.69598503258
+过低 8.90346537821
+张押班 12.2912397395
+加莱义 13.2075304714
+扶持 7.32979468964
+水粉画 11.8212361103
+觉出 10.1630080337
+胃药 11.8212361103
+玉堂金马 13.900677652
+倒为 13.2075304714
+地计丁 13.2075304714
+扑出来 12.1089181827
+人工呼吸 10.0940151622
+怨女旷夫 13.900677652
+悦服 12.1089181827
+签上 10.2630914922
+签下 10.604840786
+话务 13.2075304714
+诗刊社 13.900677652
+明廷命 12.2912397395
+实业公司 10.3171587135
+物有所值 10.8096351986
+黄莲 13.2075304714
+人体 6.42081352081
+心身关系 13.900677652
+六千里 13.900677652
+晚辈 9.48183704418
+黄旗军 12.8020653633
+美术片 11.1280889297
+过些 9.89334446674
+只延 13.900677652
+诽谤罪 11.8212361103
+力源 11.9547675029
+路府州 11.1926274509
+人人 7.1038539337
+还难 11.1280889297
+过于 6.69727213089
+小心翼翼 7.96843246453
+没理由 11.0103058941
+女青年会 12.2912397395
+二十周年 13.900677652
+白绢 10.7226238216
+人事 7.94225295895
+斋戒沐浴 12.1089181827
+过人 8.65893063692
+周念 13.2075304714
+海飞丝 13.900677652
+过亮 12.8020653633
+隶农 11.0674643079
+人云 12.2912397395
+季风气候 7.66235302694
+吠舍离 13.2075304714
+人们 4.68147665157
+北卡罗 13.900677652
+吡嗪 11.5027823792
+弓开满 13.2075304714
+可悲可叹 12.5143832909
+一个两万四千元 13.2075304714
+合同诈骗 12.5143832909
+人份 11.7034530746
+黄舜 13.900677652
+罗尔 10.8096351986
+考生 8.02014466558
+大四喜 13.900677652
+茶具 9.4233408375
+撑杆跳高 13.900677652
+贞节 10.6818018271
+袁尚 10.3453295905
+罗尚 12.8020653633
+孔太公 11.5027823792
+苗民 10.533381822
+林博士 13.900677652
+朱亮祖 13.900677652
+派调 13.900677652
+米尔一世 13.2075304714
+过份 11.3357282945
+含锌量 11.8212361103
+睹物思人 11.598092559
+庄可隶 13.2075304714
+织工 10.3171587135
+小种红茶 13.900677652
+赛锦体 12.8020653633
+部里 9.48183704418
+访谈 9.24671730182
+紧俏 10.2117981979
+少年文学 13.900677652
+罗尼 11.1926274509
+李碧华 13.900677652
+柜外 13.2075304714
+人中 8.44109213783
+平衡表 11.9547675029
+测控 10.8096351986
+学费 9.04086524761
+打草惊蛇 10.4349417492
+湖南永州 13.2075304714
+过万 12.2912397395
+税费 8.24468584116
+车轱辘 11.8212361103
+人为 7.00398332035
+人主 10.9049453784
+崔家庄 13.900677652
+忽高忽低 10.6818018271
+调节作用 8.71889410168
+氮氧化合物 12.8020653633
+眉批 11.7034530746
+机关报 9.5186510173
+扶手 9.31571017331
+崖葬 12.8020653633
+第一劝业银行 12.5143832909
+翻白草 13.2075304714
+过严 11.0674643079
+城郊型 13.900677652
+福州路 11.9547675029
+税负 9.98865464655
+痈疮 11.9547675029
+西陵峡 10.5684731418
+茶农 10.0294766411
+茶几 8.56795885871
+美泉宫 13.900677652
+智术 12.5143832909
+价格牌 12.8020653633
+学起 11.2616203224
+苏绣 11.5027823792
+黄节 12.5143832909
+油亮亮 12.8020653633
+一明 10.4666904475
+罗岗 12.8020653633
+于虎翼 13.2075304714
+李继朱 12.2912397395
+凤山市 12.8020653633
+侧目 9.96885201925
+卖艺 9.77354326693
+札幌市 13.2075304714
+喇叭裤 12.1089181827
+博时基金 8.24818847171
+黄芪 9.05649056552
+黄芩 10.2117981979
+七八倍 12.8020653633
+别房 12.2912397395
+抄后路 13.900677652
+一两岁 12.1089181827
+袁岳 12.8020653633
+藤泽 13.900677652
+阶级教育 12.8020653633
+天气形势 11.4157710022
+爱戴 9.5062284973
+单摆 10.8096351986
+电离作用 12.1089181827
+河口瑶族自治县 11.8212361103
+黄花 9.32596667347
+七八句 13.900677652
+由子懋 13.2075304714
+找寻 9.02548032877
+测性 13.2075304714
+狄克提 13.2075304714
+靛青 12.2912397395
+吹来 9.32596667347
+七八只 12.2912397395
+糖盒 13.2075304714
+豆科作物 12.2912397395
+骑墙派 12.8020653633
+北东东 11.598092559
+通水 10.7226238216
+单枪 12.2912397395
+消肿止痛 11.598092559
+廉义自立 13.2075304714
+中铁二局 11.598092559
+上古史 12.5143832909
+单枝 12.8020653633
+单果 12.1089181827
+自顾不暇 10.8096351986
+伊热夫斯克 13.2075304714
+苗蛮 12.8020653633
+哭死了 13.2075304714
+活蹦乱跳 10.2371160058
+胞饮作用 13.900677652
+精神感召 13.2075304714
+黄腻 10.642581114
+公费医疗 11.9547675029
+裹住 9.62401153296
+单极 10.8561552143
+二律背反 11.8212361103
+智擒 12.8020653633
+林密草 13.900677652
+张皇其事 13.900677652
+封面照 13.2075304714
+中国人民解放战争 12.2912397395
+找家 11.8212361103
+寄送 11.7034530746
+颜氏异 13.2075304714
+平衡论 11.1926274509
+下条子 13.900677652
+找碴儿 13.900677652
+鹤顶 12.8020653633
+蒸馏罐 13.900677652
+漏水 9.72629038208
+寄递 11.0674643079
+丢三忘四 13.900677652
+英郡王 12.8020653633
+刺细胞 11.7034530746
+比丘 9.96885201925
+借宿一晚 13.2075304714
+规模 4.91874466099
+别提 9.25628675283
+赌誓 12.8020653633
+明轮船 13.2075304714
+哈拉湖 12.5143832909
+骗赔案 13.900677652
+一千五百文 13.2075304714
+检核 11.8212361103
+漏气 10.9049453784
+薛明 13.900677652
+医学会 11.598092559
+占股 10.1630080337
+将台堡 11.9547675029
+巴托 10.765183436
+单机 9.98865464655
+墨守陈规 13.2075304714
+赤小豆 10.765183436
+从天梁 13.2075304714
+温夏凉 11.2616203224
+巴扎 12.1089181827
+敏达 13.2075304714
+胃脘 10.642581114
+织布 8.86372504956
+添个 11.7034530746
+打广告 12.2912397395
+结绳纪事 13.2075304714
+玉春院 11.9547675029
+亚特兰蒂斯 12.2912397395
+交通堵塞 10.604840786
+单期 12.2912397395
+七八十 10.533381822
+七八千 10.9049453784
+漏泄 11.5027823792
+条屏 12.8020653633
+单服 12.8020653633
+织带 12.8020653633
+巴扬 13.2075304714
+个协 12.8020653633
+单月 8.11071748108
+舔掉 12.8020653633
+杂花生树 12.8020653633
+戈卡尔 12.5143832909
+亦经 13.2075304714
+单板 11.7034530746
+沐雨栉风 13.2075304714
+通天本领 12.5143832909
+系列机 12.8020653633
+铸锻件 12.5143832909
+加压素 11.4157710022
+繁华 8.06586691491
+罗得 11.9547675029
+法恩佐 12.8020653633
+占山为王 12.5143832909
+烟草行业 11.8212361103
+漏油 11.2616203224
+赔偿额 12.8020653633
+下北 13.900677652
+送君 11.598092559
+辛烈 13.900677652
+单条 11.2616203224
+单杠 11.0674643079
+慧眼识 13.2075304714
+胃腔 12.5143832909
+恩恩爱爱 11.8212361103
+讲交情 11.9547675029
+弓羽箭 13.2075304714
+瞧不起人 13.900677652
+辛烷 11.9547675029
+炭笔 13.2075304714
+列别杰夫 13.900677652
+同地 8.55834340001
+罗德 10.6818018271
+胃腺 11.8212361103
+造言生事 12.8020653633
+沾手 11.9547675029
+班干部 12.1089181827
+双翼飞机 13.900677652
+沪宁 9.91169360541
+隔夜茶 12.2912397395
+得标 13.2075304714
+智旭 12.5143832909
+刘将闾 13.2075304714
+缁黄 12.8020653633
+庙台 11.9547675029
+布达山 11.9547675029
+战备等级 12.5143832909
+北恩古 13.2075304714
+赢钱 11.5027823792
+景龙 10.9562386728
+脑颅 10.8096351986
+失去机会 13.900677652
+月之女神 13.2075304714
+一两年 8.99540287354
+软硬 9.85762638414
+柴窝堡 13.2075304714
+藏袍 12.1089181827
+写作方法 12.8020653633
+扶贫县 13.900677652
+胃肠 9.06439574502
+营火 11.4157710022
+规正 12.2912397395
+陕甘红军 13.2075304714
+概不追究 13.900677652
+罗平 11.3357282945
+罗干 13.2075304714
+比价 8.66956903512
+昧于 11.7034530746
+空降兵 9.4233408375
+思宗 13.2075304714
+罗帅 11.2616203224
+停留时间 10.8096351986
+罗布 10.5684731418
+电阻器 11.0674643079
+南三环 10.1871055853
+无从说起 11.8212361103
+于邦国 12.5143832909
+土拨鼠 11.9547675029
+黄老 10.2630914922
+巴掌 8.67493097826
+潜居 12.1089181827
+台盟 12.5143832909
+平地起家 13.900677652
+唐南诏 11.5027823792
+八五折 12.1089181827
+孙权必 12.8020653633
+学运 12.8020653633
+石斋 10.9562386728
+李光里 13.2075304714
+潜山 10.642581114
+东门逐兔 13.900677652
+藏装 12.8020653633
+属地化 12.5143832909
+欠税 10.9562386728
+红地毯 10.5684731418
+漏洞 8.70218062071
+国会制 13.2075304714
+真实感图形 13.2075304714
+龚云甫 12.8020653633
+学过 9.46986085313
+别善恶 13.900677652
+智斗 13.900677652
+单显 13.900677652
+欧碧 12.1089181827
+黄胆 13.900677652
+角色散 13.900677652
+黄胄 12.5143832909
+孙瑞 12.5143832909
+郭士立 12.5143832909
+糜夫人 11.7034530746
+孙权引 13.2075304714
+内存大小 13.900677652
+理合 11.1280889297
+单是 8.91707103027
+大会党 10.4994802703
+大都如此 12.8020653633
+办公点 13.900677652
+政治工作者 12.8020653633
+装版 12.8020653633
+灯红酒绿 11.2616203224
+茶厂 10.6818018271
+刘志强 13.2075304714
+健身器 13.900677652
+石文 13.900677652
+绝对温标 12.8020653633
+仲雍 11.4157710022
+樟树下 12.1089181827
+验看 11.598092559
+三十四两几 13.2075304714
+区域合作 10.2897597393
+分泌系统 13.900677652
+汪曾祺 12.5143832909
+围栏 10.5684731418
+行车证 12.5143832909
+柜子 9.04864738806
+电多极矩 13.900677652
+大踏步 8.89673134603
+一百一十六个 13.2075304714
+单晶 10.1164880181
+铁砂掌 13.900677652
+李益 11.8212361103
+蔡金涛 13.2075304714
+罗店 12.2912397395
+平凡人 13.900677652
+厚实 9.21854642485
+投回 12.2912397395
+无与伦比 9.85762638414
+一千二百余种 13.2075304714
+茶叶 6.86893639321
+个别 6.76658393078
+梁武陵 12.8020653633
+罗府 12.5143832909
+六曲 13.900677652
+袁府 13.900677652
+齐根 11.598092559
+挖来 10.7226238216
+七八分 10.4349417492
+赫达亚 12.8020653633
+关禁闭 12.5143832909
+繁剧 12.8020653633
+别排 13.900677652
+桂图旗 12.8020653633
+农安县 11.9547675029
+摩托艇 11.0103058941
+二乙醇胺 12.8020653633
+测量点 13.900677652
+隶卒 13.2075304714
+金俊斌 10.9562386728
+摩门教会 13.900677652
+辛燥 13.2075304714
+晚起 12.1089181827
+装甲师 8.9308643524
+人有旦夕祸福 11.9547675029
+几百瓦 13.900677652
+罗奇 10.7226238216
+祖尚浮 13.2075304714
+景颇 10.3453295905
+陡门 13.2075304714
+汉阳峰 12.2912397395
+鹤鸣 11.7034530746
+招远 11.598092559
+或然率 13.2075304714
+罗奔 12.2912397395
+均三甲苯 12.5143832909
+旱农 11.7034530746
+塞茨 13.2075304714
+绦虫 10.1871055853
+露点仪 13.900677652
+唐僧入 12.8020653633
+标识符 11.598092559
+真他妈 10.3171587135
+窝点 10.642581114
+泉水 8.32472854883
+格拉玛 9.59661255877
+许衡成 13.2075304714
+独角兽 12.8020653633
+黄蝶 13.900677652
+叫停 9.03314320152
+费赛斯 13.2075304714
+用印 11.3357282945
+秦长脚 12.8020653633
+柴禾 9.69598503258
+竞赛心理 13.900677652
+基亚岛 13.2075304714
+一两天 9.04864738806
+罗夏 13.2075304714
+不预则废 13.2075304714
+黄蜂 10.3171587135
+漂泊 9.4233408375
+机场跑道 11.1280889297
+一表人材 12.8020653633
+电视机厂 12.5143832909
+流失量 13.900677652
+替换 7.89679058487
+王千总 12.5143832909
+抗虫性 13.900677652
+言贾政 13.2075304714
+残疾人 8.6803218269
+依依难舍 13.2075304714
+大葆台 11.8212361103
+一两处 11.4157710022
+罗夫 10.1164880181
+严文井 12.2912397395
+黄蜡 11.5027823792
+斯坦利港 12.1089181827
+萨明 13.900677652
+一两多 12.8020653633
+集中处理 11.5027823792
+泉池 11.5027823792
+言兴圣 13.2075304714
+乌合之众 9.82314020807
+祖弘忍 12.2912397395
+罗姆 10.4994802703
+扶来 13.2075304714
+萨曼 10.9049453784
+内饰件 13.900677652
+髂骨 12.8020653633
+停职反省 12.2912397395
+金杯奖 13.900677652
+决一死战 9.5062284973
+朱紫 12.2912397395
+不能偿还 12.5143832909
+概念设计 13.900677652
+卓溪 13.2075304714
+承办方 12.5143832909
+第六轮 11.7034530746
+殷根福 13.900677652
+第十四条 11.0674643079
+幸第录 12.8020653633
+规法 13.900677652
+登陆场 11.5027823792
+被覆 10.2117981979
+塞伦盖蒂 13.900677652
+没有学问 12.8020653633
+试题 9.59661255877
+武打片 12.5143832909
+杨虞候 13.2075304714
+泉河 11.8212361103
+岁差 10.4349417492
+翻寻 12.8020653633
+围标 11.8212361103
+扶杖 12.2912397395
+钟鼓馔玉 13.900677652
+访视 13.900677652
+双双对对 11.598092559
+新凤霞 12.8020653633
+芳香 8.52539924429
+模拟能力 13.900677652
+仅及 10.7226238216
+命里注定 10.8561552143
+那锋利 13.900677652
+金仲华 12.8020653633
+制图员 13.2075304714
+港监 12.8020653633
+布莱希特 10.4994802703
+探空火箭 10.8561552143
+才华盖世 13.2075304714
+闻马超 13.2075304714
+粮道 9.84023464143
+国之航 13.900677652
+单丝不线 12.1089181827
+机器指令 12.8020653633
+艰苦环境 12.5143832909
+试飞 9.04864738806
+学衔 11.7034530746
+仅只 11.4157710022
+地方风味 11.9547675029
+出租人 12.1089181827
+溶解性 11.598092559
+喘息未定 12.2912397395
+基桑加尼 12.8020653633
+送到 6.68470264932
+考点 10.1871055853
+芳馨 13.900677652
+画法几何 11.598092559
+认过 12.8020653633
+塞莫斯 13.2075304714
+学行 13.900677652
+窝火 10.4994802703
+知识性 10.8096351986
+藏身 9.31571017331
+冷色调 12.2912397395
+膝窝 12.8020653633
+沙雅 11.9547675029
+止血钳 12.8020653633
+文化性 13.900677652
+莫折大提 13.900677652
+手工劳动 10.7226238216
+电阻值 11.7034530746
+觥筹 13.900677652
+寄静 12.8020653633
+罗塞 12.1089181827
+汝宁府 11.5027823792
+敢骂 10.8561552143
+报名点 10.4041700905
+余祥贞 13.900677652
+露脸儿 13.900677652
+满足用户 11.5027823792
+金俊文 9.62401153296
+低眉顺眼 12.1089181827
+罪证确凿 12.8020653633
+切利尼 12.5143832909
+益生菌 13.2075304714
+基本上 6.39518537724
+奶牛场 11.7034530746
+辽宁人民艺术剧院 13.2075304714
+十几招 13.900677652
+泉流 11.8212361103
+巴文 12.1089181827
+咕唧 12.1089181827
+苗沛霖 13.2075304714
+吴夫人 12.8020653633
+政通 13.900677652
+吴门派 11.4157710022
+奥特朗托 13.2075304714
+小步舞曲 11.9547675029
+海峡西岸 10.1871055853
+巴方 11.8212361103
+拐脚 12.8020653633
+目不暇给 13.2075304714
+巴新 12.2912397395
+脂油 12.8020653633
+睁眼瞎 11.7034530746
+巴斯 10.642581114
+晚课 13.900677652
+连更晓夜 13.2075304714
+占领者 11.0103058941
+日本银行 11.1926274509
+必胜信念 11.9547675029
+送去 8.45825994145
+市政府办 13.2075304714
+地下党员 11.1280889297
+逼过来 12.1089181827
+杀人案件 12.1089181827
+李继捧 11.7034530746
+赌赢 12.8020653633
+由下向上 11.8212361103
+韦伊 12.5143832909
+只身 9.46986085313
+皮划艇 11.9547675029
+克勒尔 12.5143832909
+韦伯 9.48183704418
+利亚纳 12.5143832909
+治事 10.7226238216
+清官难断 12.5143832909
+单性 8.83808261895
+卖出 6.98594675926
+营养卫生 12.1089181827
+一两声 11.0674643079
+哪些地方 11.2616203224
+惊群动众 13.900677652
+赌资 11.0674643079
+哈尔格萨 12.8020653633
+木刻本 13.2075304714
+子代细胞 13.900677652
+历战阵 12.8020653633
+稀土钴 12.5143832909
+陈化粮 13.900677652
+宗上元 12.1089181827
+邹城市 11.9547675029
+条子 8.97342396682
+连茶蓬 13.2075304714
+蒋经国 10.8096351986
+白玉堂 12.8020653633
+颜卫 12.5143832909
+播弄 12.1089181827
+制霉菌素 12.5143832909
+部长 6.48009874656
+测查 12.1089181827
+常以臣 13.900677652
+生得 8.60236028543
+结核菌素 11.9547675029
+芽儿 12.2912397395
+燃气公司 9.72629038208
+苗脉 13.2075304714
+黄蚁 13.900677652
+坦噶尼喀 10.9562386728
+瘸腿 10.8561552143
+系列性 12.8020653633
+女叛徒 13.900677652
+额尔古纳市 13.900677652
+骄子 11.3357282945
+先进青年 12.2912397395
+横移动 13.900677652
+刻录 12.5143832909
+空中爆炸 12.2912397395
+七八名 12.8020653633
+漂浮 8.61747392324
+立射 12.5143832909
+萨林 12.5143832909
+不期而遇 10.642581114
+张桓侯 13.2075304714
+单恋 13.2075304714
+送医 12.1089181827
+理塘县 13.900677652
+美术界 11.9547675029
+黄蕊 13.2075304714
+小侄 9.74179456862
+退远 11.8212361103
+叶宪祖 12.5143832909
+吹捧 10.533381822
+苗苗 12.5143832909
+萨摩 11.0103058941
+被山带河 13.900677652
+第六路 13.2075304714
+芳魂 11.9547675029
+咕噜 11.0103058941
+法政 10.2630914922
+再放 9.98865464655
+千思万虑 13.900677652
+中西合壁 13.2075304714
+帕拉瓦 12.1089181827
+野宴 13.900677652
+单排 11.9547675029
+散散 11.5027823792
+克丽奥 13.900677652
+飞身 9.63799777493
+收秋 12.8020653633
+美餐 10.9562386728
+陈三和 12.5143832909
+乌克兰政府 13.900677652
+太湖县 13.900677652
+磁州窑 10.765183436
+成功实践 11.8212361103
+晚装 13.2075304714
+严子陵 11.9547675029
+四回 12.8020653633
+沃尔德 13.2075304714
+纳吉布拉 11.9547675029
+欠缴 10.9049453784
+美饰 13.900677652
+九亿八千万两 13.900677652
+远水救不 13.900677652
+冰床 11.598092559
+黄肠题 11.9547675029
+祖大弼 11.5027823792
+咕嘟 10.1164880181
+汉阳府 11.5027823792
+羌族 9.55687223012
+核事故 11.8212361103
+秀外慧中 12.2912397395
+基里尔 12.1089181827
+辅政 8.6803218269
+旧习惯 13.2075304714
+疯牛 11.9547675029
+盂县 12.2912397395
+千顷 10.765183436
+解解闷 11.5027823792
+无以为报 11.598092559
+长安汽车 9.18217878068
+党中央 7.94743431769
+瓜达尔卡纳尔岛 12.2912397395
+车船廪 13.2075304714
+算到 11.1280889297
+招赘 10.4994802703
+头等舱 11.8212361103
+孙云球 13.2075304714
+妇人 7.68207753228
+葵涌 11.8212361103
+诚信通 13.2075304714
+一两寸 13.900677652
+阴虚 9.15574552361
+高钙血症 11.9547675029
+方隆 13.900677652
+内科主任 12.8020653633
+转眼间 8.98802276624
+检波 11.4157710022
+极爱 12.2912397395
+招起 12.1089181827
+部队 5.65581825606
+儒林外史 10.9049453784
+黄藤 12.8020653633
+御车 13.2075304714
+钻空 13.2075304714
+铜活 13.900677652
+漏检 13.900677652
+试验 6.66505851091
+七八块 12.5143832909
+甘菊花 13.2075304714
+黄藻 11.598092559
+埃罗斯 12.1089181827
+柔软体操 13.900677652
+丁名楠 11.9547675029
+单指 11.3357282945
+漂游 11.8212361103
+卧龙自然保护区 11.3357282945
+通同一气 13.2075304714
+藏语 8.98069672615
+东南亚国家联盟 11.7034530746
+罗宁 12.5143832909
+九百八十卷 12.5143832909
+袁安 12.2912397395
+带团建 13.900677652
+蔚为大观 12.2912397395
+阿雷佐 11.9547675029
+袁宏 11.4157710022
+罗宗 12.2912397395
+兼营农业 11.1280889297
+辅料 10.604840786
+慢吃 13.900677652
+袁宗 13.900677652
+部院 9.98865464655
+三法印 12.8020653633
+可播放 13.900677652
+开明人士 11.8212361103
+吹掉 11.598092559
+缔盟 13.2075304714
+赵一曼 11.8212361103
+胖瘦 11.1280889297
+李晓明 11.9547675029
+招贴 11.0674643079
+读本 10.765183436
+召人 12.8020653633
+厚度 7.58894284282
+掌昭阳 13.2075304714
+标志旗 13.900677652
+罗家 11.7034530746
+藩王 9.74179456862
+袁家 10.642581114
+人才流动 10.8096351986
+畸形学 13.900677652
+北京吉普 12.8020653633
+轧辊 11.3357282945
+部际 11.0674643079
+茶圣 10.9049453784
+卡巴雷罗 13.900677652
+江口县 13.2075304714
+易变性 12.2912397395
+检测 6.85316043062
+辛甘 13.2075304714
+一线希望 9.7898037878
+亚硝酸 10.6818018271
+得气 11.2616203224
+国之臣 11.1926274509
+茶场 11.0674643079
+播州 10.7226238216
+谈情说爱 10.3743171274
+步枪射击 12.5143832909
+董克毅 12.8020653633
+赌过 12.8020653633
+富民县 13.900677652
+衣不蔽体 11.598092559
+印裔 13.2075304714
+四团 12.8020653633
+坤舆 12.2912397395
+单抗 12.5143832909
+戴叔伦 12.2912397395
+膨胀率 12.8020653633
+游湖群 13.2075304714
+对偶句 11.9547675029
+南货店 12.5143832909
+新疆伊犁哈萨克自治州 13.900677652
+土壤腐蚀 13.900677652
+病休 11.9547675029
+漆包线 13.2075304714
+吹打 10.4994802703
+送出 8.64318227995
+木栓层 12.2912397395
+羊毛绒 13.900677652
+学说 6.85316043062
+蒸腾作用 11.0674643079
+罗威 12.8020653633
+扫黄 11.3357282945
+巴林 9.61021821083
+茶坪 12.8020653633
+几十株 12.8020653633
+皮尔卡丹 13.900677652
+因着 13.2075304714
+土豆丝 11.9547675029
+厘定 10.9049453784
+扫黑 11.598092559
+断子绝孙 10.8561552143
+散射角 12.5143832909
+寄错 13.900677652
+拉煤车 13.2075304714
+安格斯 13.900677652
+环保部 10.4041700905
+邓昌友 13.900677652
+振荡周期 13.2075304714
+餬口 13.2075304714
+陈捷先 12.8020653633
+比利时外交部 13.900677652
+茶坊 9.61021821083
+沾染 9.55687223012
+历谱 11.9547675029
+假基因 12.5143832909
+糯米粉 11.3357282945
+螳臂挡车 12.5143832909
+赌输 11.598092559
+学识 9.32596667347
+吹成 11.9547675029
+沪市 7.28595205177
+陈太太 12.2912397395
+茶垢 13.900677652
+气雾剂 12.2912397395
+凡事预则立 13.2075304714
+挖苦话 13.2075304714
+找平 12.8020653633
+移民城市 13.2075304714
+柔情万种 12.8020653633
+庞葛城 12.8020653633
+正圆形 11.7034530746
+颜元 10.9049453784
+罹难 10.8096351986
+柜式 12.5143832909
+斯科会 13.2075304714
+同工不同酬 12.2912397395
+千首 11.9547675029
+几百点 12.8020653633
+胜出一筹 12.8020653633
+送入 8.85725253506
+大饱口福 13.2075304714
+扶摇 12.5143832909
+魏之战 13.2075304714
+吹拂 10.1630080337
+精力充沛 9.98865464655
+仙客来 12.8020653633
+坑人 11.598092559
+沾有 12.8020653633
+美颜 12.5143832909
+望宛州 13.2075304714
+一万三千余种 13.2075304714
+慑服 11.2616203224
+离子注入 11.7034530746
+绊手绊脚 12.5143832909
+扎波罗热 13.2075304714
+巴望 10.9562386728
+昏过去 10.1394775363
+诳言 13.900677652
+厚待 10.9562386728
+藏象 13.2075304714
+醇醚 12.5143832909
+宣叙调 12.1089181827
+风流儒雅 12.8020653633
+万古长青 13.2075304714
+测时 11.8212361103
+和缓地 12.5143832909
+厚得 11.8212361103
+榜上 9.7898037878
+海浪声 12.8020653633
+由德华 13.2075304714
+丘钟惠 13.2075304714
+舒马迪 12.8020653633
+消魂 12.1089181827
+郭祥站 12.2912397395
+骄奢 10.9049453784
+单打 10.604840786
+经营风险 9.20019728618
+清洁器 13.900677652
+郭士纳 13.900677652
+平蔡州 13.900677652
+单手 10.2371160058
+美食 9.09665660724
+季米特洛夫 11.4157710022
+厚德 11.7034530746
+脱着 12.2912397395
+投在 8.24818847171
+马拉松式 12.5143832909
+六十五卷 13.2075304714
+找出 7.77599426108
+党小组 12.1089181827
+振兴实业 12.5143832909
+石炭世 10.4349417492
+白孝德 13.2075304714
+看破红尘 11.4157710022
+十七员 13.900677652
+不知凡几 12.5143832909
+不尽人意 10.5684731418
+毛翼虫 13.2075304714
+临朝 9.69598503258
+悔悟 11.598092559
+茶堂 13.900677652
+高发 9.21854642485
+岁入 9.10488710638
+好几百米 13.900677652
+浪涛 9.93038573842
+莫拉莱 13.2075304714
+丁斐 13.900677652
+内陆海 11.8212361103
+浪涌 10.533381822
+滥觞 10.7226238216
+季前赛 12.8020653633
+法衣 11.1280889297
+起劲地 10.7226238216
+千阳 12.1089181827
+国产电影 11.7034530746
+罗摩衍那 10.4994802703
+潜在 6.96725462625
+体育课 11.0103058941
+红五军团 12.5143832909
+鱼白 13.900677652
+夜禁 13.2075304714
+斯菲尔德 11.2616203224
+德朗 12.2912397395
+突显出 12.8020653633
+自食其力 10.2371160058
+危房改造 10.8096351986
+餐车 11.3357282945
+织品 10.9562386728
+明公宜 13.2075304714
+未交 12.5143832909
+战纹鉴 13.2075304714
+东非国家 12.5143832909
+牛津布 13.900677652
+鹧鸪 7.18650712207
+虎狼之威 13.900677652
+王国维 9.91169360541
+背盟 10.9562386728
+上床 8.78868986362
+颜庵 11.4157710022
+货车运输 13.900677652
+载道 11.8212361103
+八万多倍 13.2075304714
+河外星系 10.4666904475
+天塌下来 10.5684731418
+任陆军 10.1394775363
+挟山超海 13.900677652
+未予 10.0720362555
+怒气填胸 11.7034530746
+声音文件 12.5143832909
+未了 8.60236028543
+徒劳往返 12.8020653633
+隐形眼睛 13.900677652
+扶正 9.98865464655
+苯并咪唑 11.7034530746
+议论纷纷 9.49395840471
+高难度 10.6818018271
+童威 9.91169360541
+狗胆 12.2912397395
+北青网 12.2912397395
+繁复 9.85762638414
+未乱 12.8020653633
+诸儒臣 12.5143832909
+一上台 11.8212361103
+忙忙 9.56994431169
+吴良镛 13.2075304714
+沃尔弗 11.2616203224
+黄诚 13.2075304714
+锃光瓦亮 12.2912397395
+繁多 7.6781013839
+议论纷纭 13.900677652
+宫主位 11.3357282945
+罗嗦 10.8561552143
+任命权 11.9547675029
+本地人 9.77354326693
+来势汹汹 10.0088573539
+膝眼 13.2075304714
+神崎 12.8020653633
+杨广为 11.8212361103
+缚绑 13.900677652
+刮痕 12.5143832909
+岁凶 13.900677652
+本地产 12.8020653633
+未久 10.642581114
+岁出 11.2616203224
+断无此事 13.900677652
+订给 13.900677652
+光学系统 10.3453295905
+藏药 10.4666904475
+阿母河 10.8561552143
+订约 10.3171587135
+试铸 12.2912397395
+大煞风景 12.2912397395
+个头 8.29487558568
+睡眠中枢 13.900677652
+李真 13.900677652
+七八天 10.765183436
+贵州大学 13.2075304714
+国家青年队 13.2075304714
+怯生 12.8020653633
+七八头 13.900677652
+机器脚踏 13.900677652
+悔恨 9.5062284973
+通灵知 13.2075304714
+第十四次 10.2371160058
+罗思监 13.2075304714
+个大 13.2075304714
+高台 9.74179456862
+弗洛伦斯 12.2912397395
+七八处 12.5143832909
+巴格 11.598092559
+芽尖 13.2075304714
+宗上尊 12.8020653633
+孙权命 12.8020653633
+残留边带 13.2075304714
+无限花序 12.8020653633
+刘太行 13.900677652
+冲刺班 13.2075304714
+宁夏人民出版社 13.2075304714
+丘基卡 12.8020653633
+播到 12.8020653633
+未上 11.9547675029
+未下 11.1926274509
+解得开 13.2075304714
+黄桥镇 13.2075304714
+沧海横流 11.5027823792
+拐走 11.9547675029
+康郡王 12.2912397395
+格拉纳 10.7226238216
+测试函数 13.2075304714
+沃雷 13.900677652
+夜蛾 10.6818018271
+操作规程 11.1926274509
+恋爱 7.85567233794
+柜内 11.9547675029
+奥斯陆市 13.900677652
+住持 9.41204128224
+得成 10.4994802703
+凝神 9.28555713513
+工业革命 8.66956903512
+萨武 13.900677652
+出入人罪 12.8020653633
+醇酒 11.2616203224
+谢夫隆 12.8020653633
+试错 11.1926274509
+整盘 12.5143832909
+郭汜兵 13.2075304714
+部首 10.5684731418
+书声琅琅 13.900677652
+及门 13.2075304714
+六点二 13.900677652
+被压迫 9.61021821083
+浑江市 11.598092559
+铣头 12.8020653633
+试销 13.2075304714
+大西门 12.2912397395
+奥克斯 12.2912397395
+送往 8.21370229564
+打折扣 10.7226238216
+有限性 11.1280889297
+指使人 12.8020653633
+整盒 13.900677652
+美院 11.4157710022
+舜帝 12.1089181827
+得手 8.77671367257
+罗吉 11.8212361103
+炒菜锅 12.8020653633
+同出一辙 12.8020653633
+孕母 12.8020653633
+袁君 13.2075304714
+德清西 13.2075304714
+和亨特 12.1089181827
+牛家 11.7034530746
+汉阳军 12.1089181827
+熊掌 9.6811699468
+一两名 12.1089181827
+子结构 12.8020653633
+千面 12.8020653633
+武家坡 13.900677652
+岳先生 13.2075304714
+姐妹俩 11.0103058941
+别无选择 10.1164880181
+包裹单 13.900677652
+宋献策 6.85751773599
+沿海经济 9.85762638414
+第六节 10.765183436
+吹气 10.4994802703
+昏眩 12.1089181827
+一架次 13.900677652
+常寄情 13.2075304714
+巴楚 12.2912397395
+那英俊 13.2075304714
+侧线 9.16447920358
+鹿食草 13.2075304714
+淌血 11.8212361103
+斯特拉特 13.2075304714
+水标 13.900677652
+疯狗 10.9049453784
+效益性 13.900677652
+宋敏姐 13.2075304714
+农耕业 12.8020653633
+韩百诗 13.2075304714
+恩冈代雷 13.2075304714
+库木吐 12.5143832909
+拐跑 11.9547675029
+李汝珍 12.8020653633
+报以 9.62401153296
+单氏 13.900677652
+条块 11.1926274509
+义务劳动 11.0674643079
+吹法 13.2075304714
+巴鲁迪 12.2912397395
+要言之 13.900677652
+收件人 12.1089181827
+姜诸公 12.5143832909
+潜回 10.3453295905
+曲台殿 13.2075304714
+大家风范 11.9547675029
+试问 9.6811699468
+颜异 13.900677652
+钟鼓楼 10.3453295905
+化除 12.5143832909
+工长 12.1089181827
+占课 13.900677652
+破车 11.0674643079
+清汤寡水 12.2912397395
+检控 10.604840786
+轨距 11.1280889297
+颜弼 12.8020653633
+内陆河 10.4666904475
+缔约过失 12.5143832909
+吹沙 13.2075304714
+得票数 12.1089181827
+崖谷 12.1089181827
+载重 9.15574552361
+知难而退 10.9049453784
+载量 11.3357282945
+由其子 11.0103058941
+信贷资金 8.86372504956
+得意 7.41757030052
+餐费 12.2912397395
+得愈 11.3357282945
+验线 13.2075304714
+贞观 8.5488195185
+醇酸 13.900677652
+吃得起 11.3357282945
+从长远看 10.2117981979
+招致 8.62256299275
+李厚基 13.900677652
+胡大哥 12.1089181827
+萨桑 12.5143832909
+飞行高度 10.1394775363
+吉人自有天相 11.8212361103
+做小伏低 13.900677652
+黎巴嫩 9.02548032877
+监督局 11.7034530746
+罗摩 10.533381822
+花椒油 12.8020653633
+靳尚谊 12.2912397395
+古新世 10.4666904475
+萨根 13.2075304714
+诬控 13.900677652
+辛硕 12.8020653633
+繁密 10.6818018271
+汉阳劳 12.5143832909
+罗圈 11.2616203224
+当道者 11.9547675029
+太阳电池 10.604840786
+七八家 11.7034530746
+一两场 13.900677652
+忿忿不平 12.2912397395
+阿迪达斯 11.4157710022
+陈太后 10.1394775363
+黄褐 10.2371160058
+试院 12.2912397395
+柑子 12.5143832909
+厚利 10.4994802703
+牟安世 13.2075304714
+均数 12.5143832909
+欧空局 12.1089181827
+芽庄 13.900677652
+南江县 13.2075304714
+李焕之 11.8212361103
+业务知识 12.5143832909
+想一想 8.20023407859
+武代李 13.2075304714
+和林格尔 10.5684731418
+司输纳 13.2075304714
+控告人 12.5143832909
+陶壶 11.4157710022
+德国籍 12.8020653633
+征集 8.17382990439
+罗城 9.19114745066
+按摩椅 13.900677652
+寄食 11.0674643079
+口头文学 10.4994802703
+头胸甲 10.1871055853
+天兵神将 12.5143832909
+浪漫 8.37522471284
+方音 12.2912397395
+德勒穆 13.2075304714
+半本 11.1280889297
+考绩 11.598092559
+好又多 11.7034530746
+颜山 13.900677652
+戴宗告 13.2075304714
+个字 10.4041700905
+千钧 10.8561552143
+团粒结构 11.9547675029
+钻木取火 12.1089181827
+都承旨 11.7034530746
+少说废话 12.5143832909
+何克赤 13.2075304714
+景阳 12.1089181827
+罗基 13.900677652
+郯城 10.642581114
+在工作中 10.0088573539
+居功不傲 13.900677652
+觉察 8.94485059437
+复合控制 13.2075304714
+大会堂 12.2912397395
+题注 13.900677652
+信息部 10.6818018271
+浪潮 8.18694484647
+罗纳德 11.8212361103
+咋唬 11.1280889297
+花格子 13.2075304714
+国家主义 11.1280889297
+桀骜不驯 10.642581114
+考纪 13.2075304714
+智氏 12.8020653633
+协约国 9.12999302751
+操欲立 13.900677652
+电子干扰 10.0940151622
+韦茅斯 12.8020653633
+考级 13.900677652
+扶植 9.06439574502
+戴宗同 13.2075304714
+孙志强 13.900677652
+慕煌 11.598092559
+不透光 11.3357282945
+考纲 13.2075304714
+景陵 11.8212361103
+第一信使 13.2075304714
+碰过 10.8096351986
+西西里岛 9.5062284973
+好时节 12.1089181827
+啃青 13.900677652
+元天聪 13.2075304714
+巴比 10.5684731418
+西藏自治 12.8020653633
+垂成 12.8020653633
+内陆湖 10.8096351986
+架构 8.93783302172
+阿贺野 13.2075304714
+辛礁 11.7034530746
+装甲团 10.9049453784
+盐贩子 13.2075304714
+沪剧 11.5027823792
+不良率 10.9562386728
+班举兵 12.8020653633
+黄衫 11.9547675029
+石氏 11.1926274509
+留日 11.598092559
+陪审制 12.8020653633
+移送 9.71102290995
+黄衣 11.8212361103
+顾问团 11.1280889297
+书法集 12.5143832909
+宝贝 7.65651075131
+长白山 9.0884932966
+水压机 10.604840786
+劳金 13.900677652
+阿曼湾 11.5027823792
+播出 8.82550383674
+贻误戎机 10.9562386728
+汉阳县 11.4157710022
+四十一道 12.8020653633
+智力开发 12.1089181827
+双月刊 11.1280889297
+扶梯 11.4157710022
+马步 10.2371160058
+百发百中 10.1164880181
+张灵甫 11.8212361103
+酞菁 12.2912397395
+德穆兰 12.8020653633
+岁初 12.2912397395
+沟通了解 13.900677652
+话头 8.41588071849
+不祥之兆 10.2630914922
+柜台 8.68574189437
+孙巡抚 12.2912397395
+史学方法 12.8020653633
+校场口 13.900677652
+电路板 10.604840786
+骊山 10.1164880181
+泰卢固 11.2616203224
+宋范晔 12.8020653633
+招股 7.19503855712
+尊号 9.75754292558
+采供血 13.900677652
+茚三酮 12.5143832909
+采购网 13.2075304714
+眉梢 9.59661255877
+匀速圆周 11.9547675029
+主题鲜明 11.598092559
+茶客 10.2630914922
+浪游 12.8020653633
+陈水扁 12.5143832909
+和平攻势 13.2075304714
+外围地区 12.1089181827
+表盖 13.2075304714
+环绕着 10.0505300503
+应声虫 12.5143832909
+得悉 10.4666904475
+挡回去 12.5143832909
+爬上去 9.80633308975
+贼眉贼眼 13.900677652
+宵旰忧勤 13.2075304714
+令孙 13.2075304714
+中国东方资产管理公司 12.5143832909
+拐进 10.2371160058
+不丹 9.71102290995
+成欢 13.900677652
+软枣 12.1089181827
+扶桑 10.8561552143
+考试院 10.604840786
+佐酒 11.8212361103
+谩骂 9.84023464143
+用到 8.88339781516
+圣园 13.900677652
+汉阳区 11.9547675029
+若曦会 13.2075304714
+黄袍 10.2897597393
+刘志坚 13.900677652
+西略华 13.2075304714
+轧花 10.6818018271
+银灰色 9.82314020807
+小园赋 12.8020653633
+司马金龙 12.8020653633
+燕青便 11.4157710022
+编出来 11.4157710022
+招考 9.91169360541
+敬邢傻 13.900677652
+厚厚 9.89334446674
+湘妃 12.5143832909
+红和翠 13.900677652
+宗赵桓 13.900677652
+康力龙 13.2075304714
+千门 12.2912397395
+焦振国 11.4157710022
+毛人凤 12.8020653633
+信息量 10.1164880181
+孔明先 11.7034530746
+扶栏 11.9547675029
+制图学 12.2912397395
+统一性 10.0940151622
+得想 13.2075304714
+卡雷拉 12.5143832909
+隶字 13.2075304714
+漏斗 9.54396882529
+黄玉米 13.900677652
+敦煌 7.89679058487
+没做 13.900677652
+一两八 12.5143832909
+变色机能 13.900677652
+那道士 10.1871055853
+方便之门 12.1089181827
+测温 10.4041700905
+罗克 10.3453295905
+帝丘 11.9547675029
+藤围椅 12.5143832909
+帝业 11.598092559
+无理取闹 10.9562386728
+洗井 12.2912397395
+苗裔 10.765183436
+惨象 11.3357282945
+阿保机 10.8561552143
+牛王笑 13.2075304714
+立法者 10.1394775363
+五万零五百公里 13.2075304714
+林德 10.9049453784
+巴泽 12.2912397395
+洛斯阿 12.8020653633
+季后赛 12.5143832909
+罗公 11.4157710022
+袁公 12.1089181827
+巴泰 13.900677652
+许衡劾 13.2075304714
+辟支 12.5143832909
+日东月西 13.900677652
+罗兵 13.2075304714
+牧业区 11.4157710022
+孙多森 13.2075304714
+罗兰 9.49395840471
+工程学院 9.72629038208
+合理流动 11.0103058941
+罗兹 11.0103058941
+厚味 10.9049453784
+替死 12.8020653633
+祁山伐 13.2075304714
+巴沙 12.2912397395
+银行汇票 12.1089181827
+帝乙 11.598092559
+内格罗 13.2075304714
+丢面子 11.8212361103
+亓诗教 13.900677652
+茶山 10.3743171274
+密码表 13.900677652
+征途 9.84023464143
+帝乃 11.598092559
+粮食 6.1058544998
+厢房 8.46695564842
+圣教序 12.1089181827
+沾泥 12.1089181827
+考研 11.8212361103
+得来 8.28754954559
+宁国府 10.2630914922
+铜柱 11.1280889297
+引而不发 12.1089181827
+凤山县 11.5027823792
+巴河 11.4157710022
+劳动致富 12.8020653633
+纳塔尔 10.9049453784
+装甲兵 8.93783302172
+阿玛临 13.2075304714
+马多尔 13.2075304714
+女驸马 13.2075304714
+洗三 13.2075304714
+黄连 9.14708746087
+等离子态 13.2075304714
+毁于一旦 10.4041700905
+药学会 12.2912397395
+艾尔芬斯 13.2075304714
+玄宗命 13.2075304714
+朱建国 11.2616203224
+鄂巴 13.900677652
+罗凤 11.8212361103
+帝亲 12.2912397395
+三十一篇 12.2912397395
+双通道 13.2075304714
+慈禧叹 13.900677652
+潜去 12.2912397395
+袁凯 13.900677652
+订立 8.11071748108
+坠下去 11.598092559
+甘丹 13.2075304714
+方寸无主 13.2075304714
+学者 6.34686679997
+帝京 11.4157710022
+东钱湖 11.598092559
+辞职报告 10.9049453784
+武装部队 8.87023973058
+贺天健 12.5143832909
+同一时间 9.46986085313
+案发现场 11.598092559
+王琳娜 13.900677652
+蒯良 11.7034530746
+比特率 13.2075304714
+铜材 11.5027823792
+黄辉 13.900677652
+轻机枪 9.61021821083
+白玉兰 10.7226238216
+漏报 11.9547675029
+柜员 13.900677652
+封建性 11.0103058941
+欢声笑语 10.7226238216
+偿债率 11.9547675029
+叶莲子 7.02029356979
+寻老高 13.2075304714
+灌溉网 12.1089181827
+补充协议 10.3743171274
+沾污 11.8212361103
+袁军 10.604840786
+罗军 12.2912397395
+罗德港 12.8020653633
+几百篇 12.5143832909
+二号桥 12.8020653633
+骨关节 10.4349417492
+会东 11.8212361103
+学联 11.0103058941
+表示歉意 10.7226238216
+蒋高明 12.8020653633
+塔特拉山 13.2075304714
+铜板 9.5062284973
+颛臾 12.5143832909
+两次三番 12.5143832909
+研究生部 11.0103058941
+黄达 11.8212361103
+克劳狄 11.2616203224
+单发阻 12.8020653633
+珠影 13.900677652
+皮切成 12.5143832909
+奖学金 9.91169360541
+条列 13.2075304714
+为政者 12.1089181827
+非洲金融共同体法郎 11.9547675029
+坤角 13.2075304714
+通讯地址 11.8212361103
+隶属 7.89186446653
+孙权军 13.2075304714
+刘志军 11.7034530746
+遭劫持 11.9547675029
+鱼贯进 12.8020653633
+自然经济 9.63799777493
+皱眉 9.16447920358
+计耳 11.9547675029
+祁山乃 12.8020653633
+鄙笑 13.900677652
+夸饰 11.598092559
+祁山之 12.1089181827
+潜到 11.5027823792
+怀远县 10.8096351986
+贝卡里 12.5143832909
+薛宝钗 10.4349417492
+卓有 11.1926274509
+石木 12.8020653633
+于维 13.900677652
+国会山 12.1089181827
+格兰特 10.604840786
+规整 9.77354326693
+闭关政策 10.9562386728
+单梁 13.2075304714
+农机具 10.533381822
+越思越 13.2075304714
+李瑞 13.900677652
+陪审员 11.1926274509
+发动机厂 11.7034530746
+托庇 11.0674643079
+统一指挥 9.54396882529
+居留权 12.1089181827
+加赠 11.9547675029
+帝位 8.64840422393
+骇人听闻 9.7898037878
+李森科 13.2075304714
+送审 11.8212361103
+一两倍 13.2075304714
+人民大会堂 9.5062284973
+七八岁 10.3171587135
+任粤军 12.1089181827
+肾上腺 8.70772080109
+张名帖 13.900677652
+除雾器 13.2075304714
+合成革 11.2616203224
+大峪谷 10.7226238216
+质监所 13.900677652
+光亮度 11.8212361103
+凤凰来仪 12.5143832909
+金伯利 10.4666904475
+桂金 12.5143832909
+共价键 9.93038573842
+单根 11.7034530746
+单核 10.4349417492
+颜子 12.8020653633
+悔改 10.7226238216
+美术组 13.2075304714
+岂不怪哉 12.8020653633
+艾自引 12.8020653633
+加工过程 10.0720362555
+潜力 7.07196558033
+杳无人迹 12.5143832909
+挺尸 12.5143832909
+送子 10.8561552143
+票面价格 13.2075304714
+汉帝禅 12.8020653633
+主攻手 12.8020653633
+单株 11.1280889297
+认识不清 13.2075304714
+送存 13.900677652
+头虱 13.2075304714
+打家截舍 13.900677652
+拐角 10.3453295905
+灵通人士 13.900677652
+能不能够 11.7034530746
+磨错 13.900677652
+铜制品 11.7034530746
+花更艳 13.2075304714
+浑天仪 10.8096351986
+连续区 13.900677652
+阿玛会 12.8020653633
+理疗科 12.5143832909
+三十四五 13.2075304714
+窑厂 12.1089181827
+联系汇率 10.9562386728
+单栋 13.900677652
+帝侯 10.8096351986
+窃走 13.2075304714
+名演员 10.8096351986
+萧墙祸起 12.8020653633
+慈禧又 11.0674643079
+悻悻 9.5062284973
+充内行 13.900677652
+会主 13.900677652
+验票 13.900677652
+台怀镇 13.2075304714
+资金短缺 10.9562386728
+帝俄 11.7034530746
+禁住 11.598092559
+黄表 11.9547675029
+经营思想 12.8020653633
+李尔本 11.598092559
+敦睦 12.5143832909
+丹麦克朗 11.9547675029
+浪桥 13.900677652
+混口饭吃 11.598092559
+茶巾 13.900677652
+七八尺 11.4157710022
+蒲绶昌 9.21854642485
+占过 12.2912397395
+漏掉 10.7226238216
+局局长 9.37888907493
+忸怩不安 13.2075304714
+身份证件 10.7226238216
+莴苣 10.9562386728
+房利美 11.1280889297
+蕃客 12.8020653633
+试采 13.900677652
+帝修 11.598092559
+学成归来 12.8020653633
+孙权入 12.8020653633
+秽浊 12.2912397395
+业务部 10.0294766411
+磨难 9.32596667347
+核酸酶 13.900677652
+白玉县 13.900677652
+窝窝 10.642581114
+罗华 11.9547675029
+董平见 12.8020653633
+大阪府 13.2075304714
+叙事体 13.900677652
+仅够 10.9562386728
+几番 9.29550746599
+相互间 9.08039608637
+咿呀学语 12.8020653633
+判断力 9.77354326693
+马东 11.9547675029
+府学 11.8212361103
+茶市 11.2616203224
+法警 11.3357282945
+紫荆关 11.0674643079
+罗卡 12.8020653633
+印度尼西亚共和国 13.2075304714
+黄赤 11.0674643079
+发音器 12.2912397395
+一两千 10.3743171274
+萨汗 13.2075304714
+歪门邪道 11.598092559
+杨志领 12.8020653633
+玫瑰 8.45825994145
+见微知著 13.900677652
+言玄德 13.2075304714
+苄胺 12.5143832909
+无所用心 12.5143832909
+骄傲 8.16733637508
+考究 9.24671730182
+晚育 12.8020653633
+作出努力 11.598092559
+康茂德 13.2075304714
+阿兰亦 13.2075304714
+千遍 11.9547675029
+罗逸 13.2075304714
+得救 9.56994431169
+袁化 12.8020653633
+繁忙 8.34771806705
+沾满 9.44633035572
+杰弗里 10.6818018271
+一奇 12.2912397395
+正规战 12.5143832909
+阿兰人 11.5027823792
+接收器 10.9049453784
+半晌 7.37271973435
+吉兰特 11.1280889297
+日华 12.8020653633
+羞赧 11.3357282945
+戚旧 13.2075304714
+腻腻歪歪 12.8020653633
+潜入 8.48903160012
+重中之重 9.02548032877
+四五十万 11.7034530746
+上甲板 10.9049453784
+美酒 9.71102290995
+方靖 13.900677652
+那层楼 13.2075304714
+陆震天 10.0294766411
+广东中山大学 13.2075304714
+艾宾浩斯 12.5143832909
+一两只 10.9049453784
+茶座 11.3357282945
+藩篱 11.0674643079
+投向 7.65457088649
+一两句 10.8561552143
+木雕像 13.900677652
+一两口 13.900677652
+觉得 4.82890992986
+低效能 13.900677652
+声名显赫 10.9562386728
+严气正性 13.2075304714
+萨波 12.1089181827
+一两叶 13.900677652
+羌活 10.9562386728
+织制 11.0103058941
+茶庄 8.17382990439
+一十四个 13.900677652
+罗可 13.900677652
+昌废佛 11.5027823792
+巴昔农 13.900677652
+案发时 12.1089181827
+萨法 12.8020653633
+罗号 13.900677652
+点校 12.1089181827
+衣物箱 13.900677652
+心焦如焚 13.900677652
+茶店 12.2912397395
+勤洗手 10.604840786
+学舌 11.3357282945
+学舍 12.1089181827
+一两发 13.2075304714
+投合 10.8561552143
+港澳游 11.8212361103
+罗厄 11.4157710022
+七八张 11.7034530746
+沾湿 11.7034530746
+莫合金 12.2912397395
+学艺 9.28555713513
+摩托车 7.6604018068
+万里长空 13.900677652
+花石纲 10.8561552143
+张应昌 13.2075304714
+几百种 11.0103058941
+成日成夜 13.900677652
+复溜 13.900677652
+孔鲤科 13.2075304714
+反告 12.8020653633
+乐官 11.8212361103
+单正 13.900677652
+饱餐一顿 10.0294766411
+萨沙 10.0505300503
+东土圣 12.5143832909
+埋没人才 13.900677652
+洋洋自得 11.3357282945
+潜出 11.9547675029
+缔结 8.34771806705
+马主 13.900677652
+骊姬 11.9547675029
+得时 13.2075304714
+采购站 13.2075304714
+稀有动物 11.1926274509
+赵谦见 13.2075304714
+美金 9.85762638414
+黑乎乎 9.53122979951
+邢夫人 8.98802276624
+嘉手纳 11.7034530746
+序目 12.2912397395
+三壁 11.7034530746
+柴桑口 13.900677652
+黄豆 9.10488710638
+行政界线 13.2075304714
+冰碛物 11.0674643079
+订票 10.9562386728
+拨云见日 11.7034530746
+条凳 10.4994802703
+巨蛇座 11.7034530746
+卫所军 12.2912397395
+贺功 12.5143832909
+犯罪事实 10.0088573539
+陨星 10.765183436
+找回 9.49395840471
+白尾鹿 12.8020653633
+罗副 10.765183436
+苗语 11.5027823792
+尼亚美 12.1089181827
+规条 12.5143832909
+验算 11.7034530746
+美通 10.3171587135
+国林 13.900677652
+加格 13.900677652
+急就章 11.598092559
+老妖 9.5062284973
+按摩法 12.2912397395
+七八座 13.900677652
+胜残去杀 12.8020653633
+龙李俊 11.598092559
+以此为戒 13.2075304714
+来台访问 13.900677652
+里格尼 12.1089181827
+罗列 9.26594866375
+二十二点 13.2075304714
+漂染 11.9547675029
+定住 11.3357282945
+个度 12.2912397395
+鄙夷不屑 13.2075304714
+刘备才 13.2075304714
+农机化 12.2912397395
+萨洛 12.5143832909
+测流 13.900677652
+秦德纯 13.2075304714
+民用机 12.1089181827
+扫雪 11.0674643079
+贾笑天 11.9547675029
+马仔 11.598092559
+再起波澜 11.2616203224
+小菊 13.2075304714
+藏蓝 13.900677652
+扫雷 8.88339781516
+孙权召 13.2075304714
+骤风 13.900677652
+布篷 12.2912397395
+米公祠 13.2075304714
+数十朵 13.900677652
+扶沟 10.3743171274
+罗勇 13.900677652
+东安市场 11.598092559
+拐诱 13.900677652
+刘艳 11.5027823792
+背脊骨 13.2075304714
+泉林 13.900677652
+冯伯爵 13.900677652
+九段 11.4157710022
+报修 11.5027823792
+罗勒 12.1089181827
+芽孢 9.91169360541
+李克勤 13.900677652
+娓娓而谈 13.2075304714
+溪钓 13.900677652
+单模 12.5143832909
+七层楼 13.2075304714
+免费大餐 13.2075304714
+环城路 11.9547675029
+大腕儿 12.2912397395
+曹芳 11.7034530746
+试一试 9.49395840471
+两眼一抹黑 11.7034530746
+访苏 12.2912397395
+瘦肉率 11.4157710022
+美术系 11.2616203224
+冯保领 12.1089181827
+狎客 11.1280889297
+行路者 13.2075304714
+邻里纠纷 12.2912397395
+千重 11.9547675029
+厚型 12.5143832909
+金刚山 11.2616203224
+农机厂 12.2912397395
+小四轮 13.2075304714
+史学观点 12.2912397395
+测深 11.0103058941
+赫洛亚 13.2075304714
+磨面 10.6818018271
+千金 8.6803218269
+鸟啼花落 13.900677652
+罗力 8.36728816325
+暴纱亭 11.4157710022
+棕钙土 10.0940151622
+黄旗影 13.2075304714
+扫除 8.99540287354
+石镜古 12.1089181827
+和微晶 13.2075304714
+妙师父 12.5143832909
+乳头状 10.8561552143
+七里沟 9.18217878068
+老迈无能 13.2075304714
+拖起来 11.598092559
+万一集 13.2075304714
+检方 10.1164880181
+陪审团 11.0103058941
+舟车劳顿 11.8212361103
+山西旅游 13.900677652
+侯方域 8.40350942668
+富集区 11.9547675029
+萨特 10.1871055853
+衣端肃 13.2075304714
+投怀送抱 12.8020653633
+武臣常 13.2075304714
+大年初三 13.900677652
+货比三家 11.1280889297
+化学性质 8.67493097826
+无后座力 12.8020653633
+最深处 8.78268383956
+哈维 10.642581114
+胡大仙 10.6818018271
+过往 8.44535653662
+面貌全非 13.2075304714
+潜伏 7.90671622467
+合同期 10.7226238216
+格里夫斯 11.9547675029
+帝制 9.30555780184
+唐藩 13.2075304714
+超低温 11.4157710022
+赌风 13.900677652
+段名 13.900677652
+加查 11.8212361103
+洗劫 7.70219893548
+八八六十四个 13.2075304714
+补充兵 13.900677652
+刘卫兵 13.900677652
+好几步 11.8212361103
+骄人 10.4349417492
+控系统 10.765183436
+铜管 10.3453295905
+悟性 11.0674643079
+勃拉姆斯 10.7226238216
+阿斯特拉罕 10.604840786
+紧俏商品 13.2075304714
+谅已 13.900677652
+征调 9.71102290995
+扫视 10.0505300503
+侧板 11.4157710022
+琉特琴 12.1089181827
+任许州 13.2075304714
+跌多涨少 10.2371160058
+过心 11.7034530746
+瘦肉汤 11.4157710022
+卧城 13.900677652
+住手 9.82314020807
+孙楚庭 9.35738286971
+有奖销售 13.2075304714
+同流合 13.900677652
+粘度计 12.2912397395
+民阵 12.2912397395
+嘉宾 8.53938548627
+亚速尔群岛 11.0674643079
+六十八岁 13.900677652
+恋歌 11.598092559
+销售业 13.900677652
+从澄海 13.2075304714
+只多不少 13.2075304714
+财产险 11.0674643079
+几百条 11.9547675029
+金善宝 12.5143832909
+过快 7.59440236503
+全队 9.91169360541
+孤苦伶仃 10.8561552143
+利欲 12.8020653633
+穆尔克 13.2075304714
+几百枚 13.2075304714
+车间主任 10.4994802703
+短兵接战 13.900677652
+帝力 12.2912397395
+招魂 9.91169360541
+钱法堂 12.5143832909
+单用 11.3357282945
+美达 9.96885201925
+菱形 9.21854642485
+孙文广 13.2075304714
+傻了眼 10.3453295905
+扳开 11.598092559
+晃动起来 12.1089181827
+悄悄的 8.85725253506
+单生 9.62401153296
+地震震级 13.2075304714
+何以堪 11.9547675029
+侧枝 10.4666904475
+金木水火土 12.1089181827
+过强 10.533381822
+还够用 12.8020653633
+农耕地 11.2616203224
+重难点 13.2075304714
+美辛 12.2912397395
+新增额 12.8020653633
+洗到 13.2075304714
+景谷 12.5143832909
+林平 13.900677652
+漂砾 12.2912397395
+成王败寇 12.5143832909
+大河村 11.2616203224
+走向前去 11.3357282945
+过当 12.1089181827
+洗剂 11.4157710022
+侧柱 13.2075304714
+薛史之 12.8020653633
+贺国英 12.8020653633
+暴力革命 11.3357282945
+人形 8.98802276624
+胡大一 10.765183436
+抹脸 13.2075304714
+憩息 10.9562386728
+堤段 12.2912397395
+涂有防 12.8020653633
+人影 8.06294720481
+法院系统 10.9562386728
+武大伟 13.2075304714
+柴伐蒂 12.2912397395
+同文同种 12.5143832909
+身份证号 10.9562386728
+景象 7.48068272383
+招鬼 12.5143832909
+少儿读物 13.2075304714
+洇湿 13.2075304714
+声带 10.642581114
+碧草 12.5143832909
+消纳 11.9547675029
+侧柏 10.4666904475
+子仲康 12.8020653633
+别当真 13.900677652
+柳城 10.3171587135
+四五十支 13.2075304714
+徐达之 13.2075304714
+肯尼亚 8.9519177616
+篝火狐鸣 13.900677652
+张应科 13.900677652
+撰稿 10.3171587135
+葛庭燧 13.900677652
+十万枝 13.2075304714
+来恭领 13.2075304714
+天龙山 11.7034530746
+指令 8.17709255002
+天下无敌 11.5027823792
+万四千余里 12.8020653633
+潜下 12.8020653633
+办公房 12.1089181827
+验方 10.6818018271
+紧得 12.5143832909
+钱谦吾 13.2075304714
+方格形 13.900677652
+喂喂 11.1926274509
+瞿塘 12.8020653633
+汽油桶 11.8212361103
+彼众我寡 13.2075304714
+关栅 13.900677652
+徐宝 13.900677652
+过度 6.63875055927
+加利西亚 11.2616203224
+丁思甜 7.89679058487
+文法学 13.900677652
+密码锁 12.8020653633
+洗去 10.1394775363
+漏网 10.2371160058
+先驱新党 13.900677652
+马克西米 12.8020653633
+狼来了 11.5027823792
+烘烘 10.7226238216
+消融区 13.2075304714
+小淘气 13.2075304714
+白三色 13.2075304714
+存储密度 13.900677652
+榆木 11.2616203224
+寿诸州 13.2075304714
+罗东 13.2075304714
+一些篇 12.2912397395
+西平县 12.2912397395
+外婆家 11.598092559
+声律 10.4041700905
+漏缴 13.900677652
+戴宗便 11.5027823792
+单瓣 11.0674643079
+赌馆 13.900677652
+扶犁 13.2075304714
+兔走乌飞 13.900677652
+笨鸟 13.900677652
+条例 7.36980002425
+一表人物 13.900677652
+征购 10.9562386728
+千车 12.8020653633
+紧忙 11.0103058941
+签得 13.2075304714
+诸如此类 9.82314020807
+孟少农 13.2075304714
+李明博 10.642581114
+千载 10.2897597393
+谄媚 10.4041700905
+孤儿寡女 13.900677652
+议事日程 9.55687223012
+漂移 9.56994431169
+五千多户 13.2075304714
+浪琴 13.2075304714
+沃野千里 11.0674643079
+乳臭 13.900677652
+渐进式 10.5684731418
+加强防卫 13.2075304714
+验收 8.71889410168
+平炉钢 13.2075304714
+黄粱梦 12.8020653633
+净洁 13.2075304714
+黑天半夜 11.9547675029
+秦仁昌 12.8020653633
+紧张 6.05997120023
+验放 12.1089181827
+别教 12.5143832909
+刘建锋 12.8020653633
+吹瓶 13.900677652
+百家争鸣 10.0088573539
+随话答话 13.900677652
+人师 12.5143832909
+百分之六七 13.2075304714
+龙齐诺 13.2075304714
+大阪市 12.5143832909
+舍不得 7.88696249593
+景贤 13.2075304714
+发威动怒 13.900677652
+承启官 10.6818018271
+躲债 11.9547675029
+塔伦坦 13.2075304714
+酿造 8.94485059437
+谅山 11.0103058941
+西秦灭 13.2075304714
+戴宗传 13.2075304714
+藏马 11.0103058941
+无以为生 11.1926274509
+任美锷 12.8020653633
+愤起 13.2075304714
+试跳 12.2912397395
+三周年 11.1280889297
+许昌县 11.1280889297
+陈立夫 10.8561552143
+三次方 12.8020653633
+人类 5.6306645897
+办公设备 10.8096351986
+石门集 13.2075304714
+少数步 13.2075304714
+邓士载 12.8020653633
+模范县 13.900677652
+凌源市 11.8212361103
+阻止不了 11.9547675029
+于子午 12.8020653633
+萨玛 11.4157710022
+帝号 11.598092559
+过年 8.12302532875
+小麻烦 13.2075304714
+声强 12.2912397395
+张从正 12.8020653633
+乙烯厂 12.5143832909
+埃利希 12.5143832909
+萧天润 13.900677652
+奎松城 13.2075304714
+声张 9.36807815882
+斜风细雨 13.2075304714
+洗印 11.7034530746
+帝召 13.900677652
+配器法 11.8212361103
+国内部 11.8212361103
+自由女神 11.8212361103
+相思鸟 10.533381822
+公忠体国 12.5143832909
+测定方法 10.9049453784
+嫁衣裳 13.2075304714
+严酷性 13.900677652
+大顺倡 12.8020653633
+道教协会 12.8020653633
+侍宫女 12.8020653633
+半曲 13.900677652
+鲜明 7.30489713801
+伴食宰相 13.2075304714
+呼吸作用 10.8561552143
+龙岭迷 11.0103058941
+格拉斯 11.1280889297
+黄酒 9.45802639549
+宗主督 10.8096351986
+黄酮 11.598092559
+没弄脏 13.2075304714
+垂直绿化 13.900677652
+国际关系学院 11.3357282945
+创新型 8.55357012126
+寇员外 11.8212361103
+罗佩 12.8020653633
+患处 10.0088573539
+会使 11.598092559
+藏香 12.2912397395
+汪中求 10.8561552143
+叫嚷 9.71102290995
+贾诩引 13.2075304714
+黄酱 12.8020653633
+规程 9.69598503258
+辛恕 11.8212361103
+人工 6.81812908262
+罗伊 10.765183436
+卜卡勒 13.2075304714
+邵某 10.2117981979
+拣去 11.5027823792
+沙风 13.2075304714
+壳牌 10.0720362555
+罗伟 10.4666904475
+转个 11.3357282945
+加参劾 12.8020653633
+欠款 9.89334446674
+瞒心昧己 11.7034530746
+袁伟 13.900677652
+罗伦 11.8212361103
+恐怖袭击 10.3171587135
+中上层 10.2371160058
+叶落知秋 13.900677652
+罗伯 11.3357282945
+泰然自若 11.0103058941
+美资 11.8212361103
+四品 9.08039608637
+得票 10.8561552143
+占道 11.0103058941
+昧心 10.6818018271
+姜亚科 13.900677652
+模具厂 13.900677652
+马体 13.2075304714
+勺园 12.2912397395
+三十一日 11.8212361103
+藤制品 13.2075304714
+羹汤 11.8212361103
+城主 11.7034530746
+马亨祖 12.1089181827
+好雨 12.2912397395
+可忍受 12.2912397395
+测点 11.8212361103
+囚衣 12.2912397395
+巴里斯 12.8020653633
+库尔德斯坦 12.5143832909
+黄金 5.68485986014
+千头 12.5143832909
+龙原府 12.8020653633
+罗帕 12.2912397395
+刘志丹 11.2616203224
+验明 11.1280889297
+桫椤 10.7226238216
+规章 9.20932976975
+西辽河 10.9049453784
+宁荣街 12.5143832909
+转嫁危机 12.1089181827
+宗乾宁 12.2912397395
+景洪市 12.2912397395
+染布 11.5027823792
+腐蚀性 9.91169360541
+载誉 12.8020653633
+楚军见 13.900677652
+检疫所 13.900677652
+曳光弹 10.3171587135
+序次 12.5143832909
+安乐 9.31571017331
+玻璃产品 12.8020653633
+未含 12.8020653633
+西子胜 13.2075304714
+五六顿 13.2075304714
+秽物 11.1926274509
+勾挂 12.8020653633
+石显 12.2912397395
+照价收买 13.900677652
+售后服务 8.85082164473
+难乎为继 13.2075304714
+罗侯 12.2912397395
+止付 13.900677652
+话把儿 11.7034530746
+客家 10.1164880181
+未同 12.8020653633
+未名 11.9547675029
+胃酸 10.0940151622
+有迹可循 13.900677652
+加尔利 13.2075304714
+滴下去 13.900677652
+鲁谒居 13.2075304714
+促销员 12.2912397395
+厕身 13.2075304714
+索尔特 13.900677652
+魏建晋 13.2075304714
+大利 10.8561552143
+张惟忠 13.2075304714
+哪年哪月 11.7034530746
+郑贵妃 11.1280889297
+概而言之 12.8020653633
+荷叶 9.15574552361
+朱常洛 11.7034530746
+不高不低 11.5027823792
+翁心存 13.900677652
+小舍儿 13.900677652
+招风 11.8212361103
+生二子 11.598092559
+会众 11.1280889297
+检票 11.7034530746
+加来 11.1280889297
+柬埔寨王国政府 12.1089181827
+匿藏 12.8020653633
+一壶酒 10.3171587135
+学龄 12.8020653633
+张珏任 13.2075304714
+口角春风 13.2075304714
+朱常洵 11.3357282945
+岩溶洞 12.2912397395
+链霉素 10.4349417492
+尸斑 11.598092559
+轻吹 13.900677652
+罗万 12.8020653633
+磷酸化 10.9562386728
+验查 12.8020653633
+民意调查 11.2616203224
+单相 10.4349417492
+软件工程学 12.5143832909
+景迈 12.8020653633
+沈萍连 13.2075304714
+容姑 10.533381822
+凭票供应 13.2075304714
+泉城路 12.5143832909
+蹙额 12.8020653633
+周赧王 11.4157710022
+捷尔吉 13.2075304714
+李晓玲 13.900677652
+试车 10.0720362555
+罗丛 13.900677652
+一些种 10.8096351986
+千赫 10.8096351986
+藏风 11.9547675029
+胃部 10.533381822
+一两下 12.8020653633
+慎重对待 11.1926274509
+一两丈 12.2912397395
+一两万 10.4994802703
+征文竞赛 13.900677652
+轻骑简从 13.900677652
+朱常浩 13.2075304714
+遣使 7.98717464634
+探测系统 11.1280889297
+芳踪 13.2075304714
+手下留情 10.8096351986
+气在心里 13.900677652
+高温高压 10.0088573539
+曾用名 11.1280889297
+高长胜 13.2075304714
+长短不齐 13.900677652
+破产法 11.1926274509
+罗丹 11.1280889297
+罗仇 12.8020653633
+第六项 12.5143832909
+载记 11.1280889297
+过少 9.93038573842
+罗什 10.0505300503
+智略 12.5143832909
+膨胀机 12.5143832909
+韩老板 12.2912397395
+柯钦南 12.2912397395
+上岗证 12.2912397395
+过小 11.1926274509
+一两件 10.6818018271
+李厚义 11.1926274509
+着书立说 13.900677652
+吹直 13.900677652
+股份公司 8.60236028543
+人小 13.2075304714
+寄自 11.8212361103
+樟树市 11.7034530746
+可疑人物 12.5143832909
+透析膜 13.2075304714
+请回 10.4041700905
+敢谈 13.900677652
+搦战 9.48183704418
+考查 9.89334446674
+唐良相 13.2075304714
+照曝光 13.900677652
+大顺军 8.48903160012
+陆口寨 13.2075304714
+智清禅师 12.5143832909
+人少 9.30555780184
+连城县 13.900677652
+天龙座 11.4157710022
+织体 10.9049453784
+关键时刻 8.53003962385
+形形色色 9.26594866375
+金柱 12.5143832909
+灵便 10.2897597393
+失眠症 11.2616203224
+稳压管 12.8020653633
+水德应 12.5143832909
+陆口守 13.2075304714
+开物成务 13.900677652
+拣到 12.5143832909
+比亚语 13.900677652
+征辟 10.4994802703
+埃利尼 13.2075304714
+围坐着 12.2912397395
+人居 10.1394775363
+罗亭 13.2075304714
+试运 13.900677652
+鹤见 12.5143832909
+怫然 13.2075304714
+电流密度 11.1280889297
+翻山越岭 10.765183436
+担当不起 11.1926274509
+试过 10.7226238216
+长江下游 9.0884932966
+名山县 12.1089181827
+十万数 13.2075304714
+昨天早上 11.2616203224
+枸橼 12.2912397395
+结核杆菌 10.8561552143
+于荥阳 11.5027823792
+龙泓涧 13.2075304714
+千言 12.5143832909
+蒙天恩 12.8020653633
+游动 8.91707103027
+抬高自己 11.3357282945
+克拉斯诺雅尔斯克 12.8020653633
+克拉默 13.2075304714
+十一日 9.7898037878
+敢讲 11.9547675029
+成熟林 12.2912397395
+皱痕 13.2075304714
+打防结合 13.900677652
+玩世 13.2075304714
+征衣 11.9547675029
+面向基层 12.2912397395
+鼋头渚 11.9547675029
+八分饱 13.900677652
+无霜期 8.1902506346
+军管区 11.8212361103
+王典吏 11.4157710022
+配置管理 12.5143832909
+斯马国 13.2075304714
+吞舟之鱼 12.1089181827
+过客 10.8561552143
+人定 11.0103058941
+梁大娘 12.2912397395
+巴瓦 13.2075304714
+回铃音 13.900677652
+康天文 13.2075304714
+擒获 9.53122979951
+爬越 12.5143832909
+条块分割 12.5143832909
+敢请 11.1926274509
+未动 9.66657114738
+薄弱环节 9.04086524761
+若比 13.2075304714
+代序 12.8020653633
+不期而至 10.4041700905
+春秋季 11.598092559
+凡尔登 10.2117981979
+试衣 12.8020653633
+漏税 11.4157710022
+未办 12.1089181827
+秦策 12.8020653633
+腿肚子 10.3453295905
+饿不死 11.0674643079
+轨道 6.93559730637
+得罪 7.76079309975
+凯维奇 12.1089181827
+百灵鸟 11.7034530746
+周穆王 10.2117981979
+测量机 13.2075304714
+订成 12.5143832909
+黄霸 12.8020653633
+剑桥大学出版社 13.2075304714
+读心术 12.1089181827
+讼案 12.2912397395
+四川省委 12.2912397395
+民怨沸腾 10.8096351986
+部落 6.95178042966
+封为安 13.2075304714
+膨胀性 12.2912397395
+内格林 13.900677652
+边垂泪 13.2075304714
+绊住 10.8561552143
+官兵们 10.2371160058
+扶着 8.44535653662
+飞龙镇 11.9547675029
+黄韬 12.1089181827
+彻底清除 10.9562386728
+栖身之地 12.1089181827
+居静室 13.2075304714
+化钱 13.2075304714
+达令河 11.4157710022
+萨盖 12.5143832909
+市场推广 10.0940151622
+眉睫 12.1089181827
+吐出来 9.09665660724
+地板刷 13.900677652
+农耕区 10.533381822
+怜香惜玉 10.9562386728
+订报 10.1164880181
+刘璋闻 13.2075304714
+几公斤 12.2912397395
+美语 11.9547675029
+点来点去 13.900677652
+铜网 12.8020653633
+人学 10.2371160058
+对牛弹琴 11.0674643079
+未到 8.97342396682
+播下 10.4041700905
+扫赌 10.2371160058
+牵牛星 13.2075304714
+税项 11.5027823792
+替班 12.8020653633
+克劳修斯 10.765183436
+过路费 11.598092559
+纪红层 11.5027823792
+海豆芽 12.2912397395
+未判 12.8020653633
+赵忠祥 11.8212361103
+名角儿 12.1089181827
+美词 12.5143832909
+遍布整个 12.1089181827
+鱼贯阵 13.900677652
+帝国 6.42363917966
+从此以后 8.81927328699
+卓索图 12.5143832909
+锌粉 11.4157710022
+武打戏 13.900677652
+六点半 11.9547675029
+过季 12.2912397395
+漏窗 13.2075304714
+未分 10.3743171274
+讼棍 12.2912397395
+人子 11.1280889297
+建筑光学 13.900677652
+基纳巴卢山 12.2912397395
+污水处理 9.80633308975
+吹火 11.7034530746
+预见性 10.8561552143
+单点 11.7034530746
+吹灯 11.1280889297
+卢肇钧 13.2075304714
+替父 11.598092559
+程德谋 13.2075304714
+任真州 13.900677652
+黄陂 10.4666904475
+足足地 13.2075304714
+作用点 11.3357282945
+载货 9.72629038208
+吕元祜 12.5143832909
+合二为一 10.7226238216
+梅花三弄 11.4157710022
+国产软件 13.2075304714
+句数 12.8020653633
+窝憋 13.2075304714
+酒好不怕巷子深 13.900677652
+未变 8.84443184663
+美言 11.2616203224
+铜线 11.3357282945
+未取 13.2075304714
+未受 9.59661255877
+未发 10.8561552143
+声导 12.2912397395
+摆正位置 13.900677652
+政治立场 11.0674643079
+学馆 10.765183436
+眉目 9.08039608637
+燃气设备 13.900677652
+封前朝 12.8020653633
+传真照片 13.900677652
+黄陵 10.642581114
+辛术 13.2075304714
+载起 13.900677652
+一百一十九种 13.2075304714
+雪上运动 12.8020653633
+德勒斯 11.9547675029
+人样儿 12.8020653633
+图为 9.29550746599
+景观 7.96050639926
+中国香港 9.22784881751
+塔米 12.5143832909
+勺儿 11.7034530746
+领导组 12.1089181827
+同德同心 13.900677652
+漏景 13.900677652
+文字说明 10.642581114
+剥皮机 13.900677652
+左右开弓 10.765183436
+文本编辑 12.5143832909
+小丁 11.0103058941
+铜绿 10.8561552143
+墨西哥湾 9.41204128224
+声容 12.2912397395
+防御型 10.1164880181
+物色人选 13.2075304714
+乐子 10.533381822
+雍荣华贵 13.900677652
+紧密 7.57811241205
+止戈为武 13.900677652
+燕妮 12.5143832909
+签完 12.2912397395
+秋风过耳 13.900677652
+小一 13.900677652
+增城 10.8561552143
+异型材 13.900677652
+黄集 12.1089181827
+期货交易 8.88339781516
+八十七年 13.2075304714
+水循环 12.1089181827
+匆促之间 13.2075304714
+成都路 13.2075304714
+蓝道行 12.8020653633
+乙烯基 11.1926274509
+主治 9.44633035572
+破旧不堪 12.2912397395
+掘起来 13.2075304714
+几千声 13.2075304714
+红玉笑 12.2912397395
+未卜 10.4994802703
+美誉 9.35738286971
+征解 13.900677652
+行为人 10.533381822
+敢言 10.2630914922
+勾掉 12.1089181827
+签子 11.1280889297
+完密 11.9547675029
+未卖 13.900677652
+东方美女 13.900677652
+模范城 13.900677652
+签字 8.15447446144
+轮椅车 12.8020653633
+声学 9.00283785202
+洗地 13.900677652
+遗留下来 9.23723855786
+驻极体 12.2912397395
+巴生 13.900677652
+测知 11.3357282945
+伏羲庙 12.1089181827
+治安拘留 13.900677652
+丰富多彩 8.98802276624
+连云港 9.41204128224
+彪马 12.8020653633
+直链反应 13.900677652
+布哈尔 13.2075304714
+吹炼 11.9547675029
+一首首 12.1089181827
+言行不符 13.2075304714
+质监站 12.1089181827
+榜尾 13.2075304714
+贡生之 12.8020653633
+青委 12.8020653633
+存储芯片 13.2075304714
+马修 10.4349417492
+今兴安 12.5143832909
+台塑集团 12.8020653633
+斧正 13.2075304714
+论道 10.604840786
+新沂 12.1089181827
+同进士 11.8212361103
+催眠药 13.2075304714
+巴盟 12.8020653633
+茅盾故居 12.8020653633
+力戒 12.8020653633
+韦尔奇 13.900677652
+黄镇 12.2912397395
+帝君 10.2117981979
+黎耀祥 13.2075304714
+单环 12.1089181827
+邬梨 10.765183436
+粉细砂 12.1089181827
+郭汜之 12.8020653633
+涉足其间 13.900677652
+诰命 10.3743171274
+营养过剩 10.4666904475
+声声 9.71102290995
+山鹊 12.8020653633
+多说无益 12.8020653633
+扶病 11.1280889297
+殉道精神 13.2075304714
+立姿 12.2912397395
+救死扶伤 11.3357282945
+辱国 11.598092559
+平原县 11.9547675029
+诽谤案 12.2912397395
+花都区 11.3357282945
+遗物箱 13.2075304714
+从容应对 10.9049453784
+董厥 11.8212361103
+谋臣如雨 13.900677652
+晚风 10.3743171274
+有点烦 12.1089181827
+农村土地 10.2117981979
+千行 12.8020653633
+困处 13.2075304714
+道口镇 12.5143832909
+告诫 8.52078029844
+发情 9.59661255877
+负弩前驱 12.8020653633
+越抗美 13.2075304714
+美西 11.0103058941
+扫进 12.5143832909
+公民权利 9.96885201925
+离子反应 11.2616203224
+希托夫 13.900677652
+广学政 11.9547675029
+私刑 12.1089181827
+谠言 13.900677652
+可可豆 11.8212361103
+客堂 9.24671730182
+糯米糕 13.2075304714
+黄锦 12.2912397395
+调薪 12.8020653633
+煞费苦心 10.2117981979
+夜明珠 11.1926274509
+有效积温 12.8020653633
+等效于 11.598092559
+第一信号 13.900677652
+机会难得 11.8212361103
+哈得孙 10.8561552143
+舔着 10.533381822
+考拉 13.900677652
+西南方 10.3171587135
+人天 11.9547675029
+埃利奥 13.900677652
+人夫 10.5684731418
+装睡 11.1926274509
+人大 8.12923652885
+过多 7.33400522217
+三宫六院 11.0674643079
+过处 11.0674643079
+人头 8.20694551317
+萨瓦 10.8561552143
+返祖 13.900677652
+过头 8.50251495046
+埃利奇 13.2075304714
+巴登 10.5684731418
+黄门 9.84023464143
+平原区 9.12155415886
+丁丁虫 12.8020653633
+岁修 13.2075304714
+过大 7.78258045393
+粮船 10.0505300503
+半支 11.8212361103
+魏伯阳 11.7034530746
+吃劳保 13.900677652
+面包树 12.1089181827
+规绳 13.900677652
+过天 12.8020653633
+过奖 10.1871055853
+外经委 13.900677652
+徐州市 10.3743171274
+广阔 7.02854955064
+埃洛石 13.2075304714
+山河大地 13.2075304714
+驼队 11.3357282945
+二硫化钼 12.1089181827
+纪大椿 11.8212361103
+索额图 11.5027823792
+逗趣儿 13.900677652
+美国加利福尼亚大学 10.9562386728
+抛到 10.0294766411
+伊莎贝尔 12.5143832909
+磨蹭 9.91169360541
+灵丹 11.598092559
+奇装异服 11.2616203224
+叶成朵 13.2075304714
+疮口 10.8561552143
+达智桥 13.2075304714
+五十万元 13.900677652
+规约 10.533381822
+马甲 10.2630914922
+过好 10.4666904475
+席面 9.87532596124
+森林区 10.604840786
+今年以来 6.2888352524
+私利 9.61021821083
+轰雷掣电 13.900677652
+跑码头 11.9547675029
+柱塞泵 13.900677652
+子话儿 12.5143832909
+庆祝大会 11.0103058941
+香獐子 13.2075304714
+海拔高度 10.0294766411
+未出 10.7226238216
+孔望山 12.1089181827
+片面之词 13.2075304714
+姚璇秋 12.8020653633
+连红儿 13.900677652
+两百余名 13.2075304714
+衰老期 12.8020653633
+未几 10.7226238216
+表情丰富 11.5027823792
+信息费 13.900677652
+申请费 13.900677652
+运输能力 9.94943393339
+考据 10.0940151622
+人要衣装 13.900677652
+挣命 10.9049453784
+八字宪法 13.900677652
+炸酱面 11.598092559
+巴石 13.900677652
+摆来摆去 12.1089181827
+内部结构 8.91707103027
+人墙 11.0674643079
+中国数学会 11.598092559
+周国舅 12.8020653633
+未准 12.8020653633
+创新力 13.2075304714
+乘胜追击 10.3743171274
+青莲色 13.2075304714
+昙花一现 9.53122979951
+辣子鸡丁 13.2075304714
+霍布森 12.1089181827
+找人 9.44633035572
+乡间别墅 12.8020653633
+句末 13.2075304714
+人士 5.10995202371
+品牌形象 9.72629038208
+抠抠搜搜 13.900677652
+制止动乱 12.8020653633
+费斯廷 12.8020653633
+未决 10.1871055853
+单独 6.92339631035
+刘蜀永 13.2075304714
+形态各异 10.533381822
+正义党 11.5027823792
+人声 9.16447920358
+建文帝 10.4041700905
+检索 9.40086798165
+找些 9.80633308975
+填补 8.59240995457
+帅察罕 12.8020653633
+张中行 12.8020653633
+清爽爽 13.900677652
+开口闭口 12.1089181827
+总统套房 13.2075304714
+景询 12.8020653633
+开关电路 12.1089181827
+赔偿费 11.9547675029
+称霸全球 13.900677652
+不惜工本 11.598092559
+内视反听 13.900677652
+以我为主 11.3357282945
+读读书 12.5143832909
+填表 11.0674643079
+才姗姗 13.900677652
+签好 12.8020653633
+试论 10.9562386728
+云杜姆 13.2075304714
+马舞刀 10.5684731418
+多多关照 12.2912397395
+芭蕾舞剧院 13.2075304714
+试训 11.598092559
+原封 11.7034530746
+罗进刚 13.2075304714
+过堂 10.9049453784
+霍布根 13.2075304714
+蓝片岩 13.2075304714
+晚餐 9.16447920358
+趁哄打劫 13.900677652
+紧缚 12.8020653633
+征询 9.08039608637
+爱国阵线 12.1089181827
+多头政治 12.5143832909
+萼片 9.46986085313
+找乐 12.5143832909
+朝鲜族 9.58318953844
+人堆 10.6818018271
+帝喾 10.3743171274
+向阳路 13.2075304714
+怒江大峡谷 13.900677652
+小册子 9.5186510173
+未免 8.2273543848
+重新安排 11.2616203224
+狠下功夫 13.900677652
+系列片 12.1089181827
+辛斯 13.900677652
+郑作新 12.1089181827
+调试器 13.900677652
+粮草 8.24468584116
+阿林顿 13.900677652
+柳园 11.8212361103
+试读 13.900677652
+演起来 12.5143832909
+长篇大套 13.900677652
+张汉又 12.2912397395
+冯保笑 12.2912397395
+上发条 12.8020653633
+黄钟 11.5027823792
+找个 7.5515386606
+再生制动 13.900677652
+扶琴 12.5143832909
+侍中王 12.2912397395
+安远侯 12.8020653633
+谠论 13.900677652
+文艳 12.8020653633
+粮荒 11.9547675029
+比亚迪 8.4801426527
+考不倒 13.900677652
+无影无形 10.9049453784
+晚饭 7.71036224612
+征订 13.2075304714
+苟活 10.4666904475
+载运 9.74179456862
+试试 8.14810501315
+征讨 8.83177344976
+公哥 12.2912397395
+湖北省 7.9526426628
+找上 11.4157710022
+天章阁 12.2912397395
+黄钺 10.9049453784
+黄经臣 11.5027823792
+单片 10.642581114
+魏敦瑞 13.2075304714
+人口贩子 13.900677652
+阳跷脉 13.900677652
+喜临门 12.5143832909
+窗式空调 13.2075304714
+马里亚 11.598092559
+扶人 13.900677652
+飙发电举 12.8020653633
+皮糙肉厚 11.1926274509
+勿施于人 12.1089181827
+诞生石 13.2075304714
+夹到 12.2912397395
+罗汉松 10.765183436
+闪闪地 11.4157710022
+吸者 13.900677652
+丐帮 13.900677652
+紧张状态 10.4994802703
+班尼汗 12.1089181827
+苏木 8.85082164473
+测程 11.9547675029
+大耳贼 13.900677652
+录放音 13.2075304714
+王筠 12.2912397395
+七十余里 12.8020653633
+铜环 10.2117981979
+并线 12.1089181827
+师师爹 13.900677652
+格兰杰 12.8020653633
+硅胶 10.765183436
+隐名 13.2075304714
+百听不厌 13.2075304714
+紧固 11.2616203224
+慕容伏允 13.2075304714
+承诺书和 13.900677652
+替罪 13.900677652
+谋刺 12.2912397395
+无可反驳 12.8020653633
+送些 10.4349417492
+价格比 9.4233408375
+唐乾宁 13.2075304714
+株洲市 10.8561552143
+青眼有加 12.8020653633
+赢过 12.8020653633
+以此为由 11.598092559
+送交 9.75754292558
+增强团结 13.2075304714
+尤三姐 11.0103058941
+多维奇 12.8020653633
+民族精英 13.2075304714
+夏姆斯 13.900677652
+斧头帮 13.900677652
+水轮机 10.3743171274
+颜亦 13.2075304714
+皮卡迪 12.8020653633
+送亲 11.1280889297
+实像 11.7034530746
+沦陷区 10.7226238216
+颜亮 12.8020653633
+有敌无我 13.2075304714
+送人 10.1630080337
+卖力 9.44633035572
+窝气 12.5143832909
+订满 13.900677652
+盛称尧 13.2075304714
+短斤少两 13.900677652
+齐地 10.642581114
+未平 11.2616203224
+萱草 11.7034530746
+一夜情 11.3357282945
+董鄂妹妹 12.8020653633
+风驰电掣 10.3171587135
+游览点 11.3357282945
+人地 10.4349417492
+欺辱 11.598092559
+考法 13.900677652
+兴国县 13.900677652
+瞬间反应 13.900677652
+方领 11.8212361103
+周克芹 13.2075304714
+声光化电 12.2912397395
+程壁光 13.2075304714
+女秀才 11.7034530746
+磨耗 12.5143832909
+茶屋 13.2075304714
+颜书 13.900677652
+耿耿兮 13.2075304714
+麾下 8.30596627237
+逃命要紧 12.5143832909
+偏爱 8.78868986362
+显微图 13.2075304714
+金融体制 10.0720362555
+四双 12.8020653633
+人头攒动 10.604840786
+羌笛 12.8020653633
+粮谷 11.7034530746
+多公斤 11.7034530746
+净水 10.533381822
+四史 11.7034530746
+送下 11.8212361103
+送上 8.87023973058
+眉笔 12.8020653633
+建材装饰 13.900677652
+送与 9.24671730182
+六千个 13.900677652
+环保车 12.1089181827
+从未有过 9.0884932966
+柳儿 13.2075304714
+未带 11.8212361103
+萨雷阔 12.5143832909
+逻辑移位 13.900677652
+奈斯 11.1926274509
+要区 12.1089181827
+智力技能 13.900677652
+送丧 11.8212361103
+失官 12.1089181827
+送个 11.1280889297
+弗拉斯 12.8020653633
+数目字 12.5143832909
+中央新闻纪录电影制片厂 13.2075304714
+陵水黎族自治县 13.900677652
+向阳花 12.8020653633
+咏桑寓柳 13.900677652
+一举成名 9.87532596124
+铁法 11.598092559
+测站 10.4994802703
+辛甘性 13.900677652
+兴海县 12.8020653633
+维也纳爱乐乐团 11.9547675029
+扇起 12.8020653633
+总皂甙 12.5143832909
+裣衽 12.5143832909
+忙乎 11.0674643079
+浦口区 12.5143832909
+洗完 9.53122979951
+实际汇率 12.5143832909
+克尼亚 13.900677652
+戚务生 12.8020653633
+造成危害 10.4994802703
+郭化若 13.2075304714
+第十四章 9.77354326693
+伦理观 11.4157710022
+送信 9.62401153296
+对号入座 11.1926274509
+尖顶帽 13.900677652
+关系密切 8.31342899358
+组织体制 10.604840786
+古地图 12.8020653633
+说服力 9.40086798165
+送修 12.8020653633
+辛欣 13.900677652
+范景文 13.2075304714
+无休止 10.1164880181
+翻开 9.06439574502
+杀猪刀 11.1280889297
+面包果 12.1089181827
+赌金 12.2912397395
+忙乱 9.34680076038
+未必 6.8367736905
+吐鲁番 8.61747392324
+恋战 9.96885201925
+顾媚生 10.0088573539
+格格笑 13.2075304714
+混成团 11.5027823792
+和丽丽 11.0674643079
+共进会 11.0103058941
+妥否 13.900677652
+帝子 11.9547675029
+单系 12.2912397395
+帝孝 13.900677652
+二十余万口 12.8020653633
+仔细观看 9.91169360541
+建行河南省分行 12.5143832909
+祖泽远 12.5143832909
+唇枪舌战 11.9547675029
+辐射强度 10.5684731418
+本廷克 13.2075304714
+善体 13.2075304714
+孢子体 10.533381822
+学门 13.2075304714
+返回地面 11.0103058941
+维尔斯基 12.8020653633
+晋益州 13.2075304714
+学问 7.74794495727
+戈莱托 13.2075304714
+扶突 13.900677652
+礼乐 9.87532596124
+除暴安良 11.5027823792
+单簧管 10.9049453784
+单糖 10.1394775363
+光彩照人 10.4041700905
+水野清 13.900677652
+李尔王 11.3357282945
+鄂北 10.6818018271
+合成药 12.2912397395
+钟茶来 12.8020653633
+由他去 10.642581114
+编辑组 13.2075304714
+社会效益 9.45802639549
+继起 10.604840786
+藤森 11.9547675029
+仅于 11.0103058941
+醇酸树脂 11.5027823792
+颜体 11.1280889297
+反共宣传 12.1089181827
+名重一时 11.0103058941
+顾君恩 10.1164880181
+渭城 11.9547675029
+磴道 11.9547675029
+埃富蒂 13.2075304714
+大吹大擂 10.765183436
+面包机 13.2075304714
+扶危济困 12.2912397395
+晚霞 9.75754292558
+信笔涂鸦 13.900677652
+奥梅尔 12.8020653633
+数据库系统 11.3357282945
+帝安 13.900677652
+磕磕碰碰 11.1926274509
+卓玛 8.98069672615
+清正廉洁 11.4157710022
+中和作用 13.2075304714
+金门绣户 13.900677652
+欠情 13.900677652
+卡瓦瓦 13.2075304714
+赈粮 11.9547675029
+帝室 10.5684731418
+孙四 13.2075304714
+测算 7.23626863163
+处斩 10.4041700905
+帝宣 13.2075304714
+生命期 12.5143832909
+埃尔尼诺 13.2075304714
+谢列兹尼奥夫 13.900677652
+划得来 11.9547675029
+忙于 8.63798746307
+仅仅 6.31743012767
+八分钟 12.5143832909
+杀虎口 12.2912397395
+黄骅 10.533381822
+要口 11.9547675029
+铜牙 13.2075304714
+校领导 12.2912397395
+铜片 11.4157710022
+测试通过 13.900677652
+利与弊 13.900677652
+祸祟 12.5143832909
+铜牌 10.1164880181
+下底传中 13.900677652
+铜版 11.598092559
+生命权 11.2616203224
+墨卡托 11.598092559
+宏阔 11.5027823792
+森森 9.91169360541
+侧滑 10.9562386728
+声场 11.4157710022
+恳谈会 12.2912397395
+斑驳陆离 13.2075304714
+石沉 13.2075304714
+明抗清 12.8020653633
+债务额 13.900677652
+亦文 13.2075304714
+管理机构 8.85082164473
+悱恻 12.8020653633
+弹指神功 13.900677652
+霍布斯 10.9049453784
+一刀切 9.77354326693
+大寨村 13.2075304714
+二十二日 10.0294766411
+李德任 13.2075304714
+上海石化 11.3357282945
+石涛合 13.2075304714
+马大哥 12.8020653633
+应纳课 13.2075304714
+古北口 10.1630080337
+晚钟 11.598092559
+患儿 9.28555713513
+天地间 9.10488710638
+胡雪柏 13.2075304714
+萨斯喀彻温省 12.8020653633
+紧咬 10.3743171274
+罗西尼 11.7034530746
+德国法 11.9547675029
+声响 7.57811241205
+马大哈 13.900677652
+梁大同 12.1089181827
+办公椅 12.8020653633
+叙事学 13.900677652
+同温层 11.8212361103
+乱世儿女 13.900677652
+辛根 13.900677652
+西江流域 12.2912397395
+辛格 10.1164880181
+石桥镇 12.5143832909
+欺负 8.33999602096
+柳兄 13.2075304714
+无以为继 11.7034530746
+会计处 13.900677652
+单翼 10.4041700905
+娃娃生 12.2912397395
+安慕客 13.2075304714
+门庭若市 11.0103058941
+守空房 12.1089181827
+轮齿 12.1089181827
+于国赋 13.900677652
+姜丝熬 13.900677652
+那道人 10.4994802703
+辉耀 12.5143832909
+齐国 8.62767809341
+办公楼 9.08039608637
+四千零三十 13.2075304714
+藏量 11.2616203224
+玻尔 9.66657114738
+竞选活动 11.8212361103
+水迹 11.4157710022
+宏观物理 13.2075304714
+格林童话 13.2075304714
+中国金属学会 13.2075304714
+求援信 13.2075304714
+国防论 13.2075304714
+戈特弗 13.2075304714
+金家兄弟 13.2075304714
+焦仲卿 13.2075304714
+皮盾 12.8020653633
+声呐 9.7898037878
+榜单 8.88339781516
+单缸 11.5027823792
+无稽之言 13.900677652
+凭良心讲 12.2912397395
+打抱不平 10.4041700905
+应给以 13.900677652
+没取 13.2075304714
+人种学 11.3357282945
+自测题 13.900677652
+莫里安 12.8020653633
+栖身之处 12.5143832909
+阮文灵 12.8020653633
+网络体系结构 12.8020653633
+火箭发动 13.900677652
+节流阀 12.1089181827
+救生伞 13.2075304714
+政治势力 10.0720362555
+养鱼塘 12.5143832909
+有机颜料 12.8020653633
+法制日报 11.5027823792
+占领 6.31997789975
+王浑 12.5143832909
+漂流记 12.1089181827
+通用设备 11.5027823792
+纳塔尔省 12.5143832909
+燎原烈火 13.900677652
+每日电讯 11.9547675029
+浊音 10.9562386728
+签呈 13.900677652
+伦常 11.0103058941
+韦晃 12.2912397395
+胡蓉蓉 12.8020653633
+课业负担 11.8212361103
+华沙公约 13.900677652
+交些 13.900677652
+凭良心说 11.7034530746
+帕米尔高原 9.69598503258
+玉体违 13.2075304714
+出水芙蓉 11.5027823792
+宋达成 12.8020653633
+华北大学 11.0103058941
+闻声奔 12.8020653633
+核科学 12.2912397395
+课时 11.3357282945
+苦练内功 11.9547675029
+较为简单 10.8561552143
+宠妃 10.8561552143
+声名 9.17328983326
+陆建瀛 13.2075304714
+未尝 9.20019728618
+扫荡 8.52078029844
+望经楼 13.900677652
+石慧 13.2075304714
+斯洛普 12.8020653633
+奉系军阀 10.3171587135
+乐天派 12.1089181827
+宋公明 8.82550383674
+标本兼治 11.1280889297
+检点 9.75754292558
+辽东湾 10.1164880181
+阙无载 13.2075304714
+单线 10.1394775363
+莫尔斯比港 13.900677652
+唐老爷 10.8096351986
+恶小而 13.900677652
+花都市 12.5143832909
+单纱 11.7034530746
+卓然 10.9562386728
+水成岩 12.5143832909
+第六部 10.4349417492
+单纯 6.92619874095
+所闻所见 13.900677652
+单级 10.5684731418
+招郎 12.2912397395
+单红 13.2075304714
+出厂价 8.64318227995
+原肠祖 13.900677652
+晒图纸 13.900677652
+黄金树 13.900677652
+美萍 13.900677652
+子非鱼 13.900677652
+中央工艺美术学院 12.1089181827
+抹除 13.900677652
+陇西高原 12.1089181827
+继进 12.8020653633
+雷州半岛 9.45802639549
+下结论 9.87532596124
+乐艺 11.8212361103
+电阻丝 12.2912397395
+高等职业 11.9547675029
+私募 6.80893553688
+李元儒 13.2075304714
+确定型图灵机 13.900677652
+腺病毒 11.0103058941
+亚得里亚海 10.0720362555
+远交近攻 11.5027823792
+得理不饶 12.5143832909
+增殖率 12.5143832909
+载荷 8.6803218269
+刘鸿训 13.2075304714
+汉谟拉 13.900677652
+抢走了 10.0088573539
+采购供应 13.2075304714
+大中专生 13.2075304714
+米林 11.598092559
+柳冕 13.2075304714
+北美自由贸易协定 12.2912397395
+漏电 10.8096351986
+提问者 13.2075304714
+铁活 13.900677652
+格尔木市 10.765183436
+孔安国 12.2912397395
+公孙渊兵 13.2075304714
+恋恋 11.7034530746
+死伤无数 13.2075304714
+杨八姐 13.2075304714
+出公差 12.8020653633
+办公桌 9.14708746087
+晚间 7.71241352889
+证据规则 12.1089181827
+磨菇 12.8020653633
+单练 11.8212361103
+黄风 10.8096351986
+水波纹 12.8020653633
+表姑 13.2075304714
+有点累 11.5027823792
+鉴定证书 13.2075304714
+石桥铺 12.1089181827
+迎新送旧 13.900677652
+产水量 13.2075304714
+黄飞 12.1089181827
+染在 13.900677652
+深沪湾 13.2075304714
+粗衣恶食 12.8020653633
+挖空心思 10.3171587135
+过后 7.08723305246
+克劳斯 10.8096351986
+鼯鼠 11.3357282945
+英法联军 9.46986085313
+放电影 11.7034530746
+人名 9.56994431169
+人后 10.3171587135
+黄焦焦 13.2075304714
+诸亲好友 13.900677652
+芽体 11.7034530746
+梵宫 13.900677652
+萨科 11.7034530746
+国厚恩 12.2912397395
+布尊丹 10.8561552143
+人君 11.5027823792
+假按揭 12.2912397395
+不能自拔 10.4041700905
+得点 11.9547675029
+进化树 13.900677652
+民革中央 11.9547675029
+侧泳 13.2075304714
+丁二石 13.2075304714
+自然天成 12.1089181827
+紧俏货 13.2075304714
+灵仪 12.8020653633
+西盟佤族自治县 12.5143832909
+石油 5.7353140195
+人命 8.75318317516
+端过去 12.8020653633
+四卷 10.0088573539
+广金岛 12.2912397395
+陆抗卒 13.2075304714
+人味 11.4157710022
+方晶 13.900677652
+红葡萄酒 10.4349417492
+恋情 9.74179456862
+邢妹妹 12.2912397395
+合同法 9.82314020807
+依赖性 9.14708746087
+房交会 10.4994802703
+北京机场 13.2075304714
+染坊 9.84023464143
+淫虐 13.900677652
+人员 5.59100075599
+颜其额 13.2075304714
+可证实 12.1089181827
+洗好 11.7034530746
+北彝陵 12.8020653633
+朗吉努斯 13.900677652
+粮袋 12.5143832909
+旅行网 11.598092559
+记过处分 13.900677652
+印加公主 13.900677652
+九十七篇 13.2075304714
+浊酒 12.2912397395
+成仿吾 11.4157710022
+过厅 11.9547675029
+谢夫莱 13.2075304714
+滁州 10.3171587135
+人去 8.25170341381
+毛涤薄 13.900677652
+硫醇 11.3357282945
+美茵 13.900677652
+沾粘 13.900677652
+爱国运动 9.59661255877
+谪仙 12.2912397395
+顾锡畴 11.598092559
+千般 10.0294766411
+可取之处 11.5027823792
+绮靡 11.598092559
+桓胱印 13.2075304714
+过去 4.75519585235
+辟田 13.2075304714
+正三角形 11.9547675029
+单福 11.7034530746
+刘丹 12.5143832909
+免费餐 13.900677652
+概不 11.2616203224
+几百次 11.4157710022
+辛温 11.2616203224
+未嫁 11.7034530746
+试考 13.900677652
+金鸡独立 12.2912397395
+陈副将 13.2075304714
+司号员 12.2912397395
+大麦芽 13.2075304714
+赵公子 11.8212361103
+分委会 11.598092559
+机械性能 10.4666904475
+人口 5.30800599938
+地守候 12.2912397395
+小椅子 11.598092559
+收购人 12.1089181827
+妮儿 11.0103058941
+绮霞 13.900677652
+赌钱 10.0720362555
+学部 9.87532596124
+法托斯 13.2075304714
+防治 7.48885938427
+侯方夏 13.2075304714
+惹乱子 13.2075304714
+鹤虱 13.2075304714
+凌源县 12.2912397395
+黄鼬 10.2117981979
+序文 11.4157710022
+铜矿 8.38724890581
+李汝昌 13.900677652
+单科 11.5027823792
+声势 8.39534611604
+黄鼠 11.0674643079
+独断专行 10.8096351986
+奶牛业 12.1089181827
+拎不清 13.900677652
+唐之奇 12.8020653633
+脱颖出 13.900677652
+产茧量 13.900677652
+几百步 12.1089181827
+经营不善 11.0103058941
+临淄王 12.5143832909
+代夫 13.900677652
+吐舌头 10.604840786
+萨维 12.8020653633
+摸索到 12.8020653633
+儿童玩具 11.598092559
+凡尔纳 12.2912397395
+陡起 11.1926274509
+饔飧 13.900677652
+洪加威 12.1089181827
+辟疆 9.01787572939
+序数 10.3171587135
+抑制发芽 13.2075304714
+下工夫 10.1164880181
+吴贻弓 13.2075304714
+未婚 9.54396882529
+言为心声 13.900677652
+巴米 13.900677652
+额手称庆 11.8212361103
+辅翼 12.5143832909
+句法 10.2371160058
+人化 12.5143832909
+夏军来 13.2075304714
+怯意 12.8020653633
+朝贵 12.5143832909
+分类广告 13.900677652
+坐天下 10.9049453784
+根本措施 11.3357282945
+一大跳 10.0940151622
+清华大学化学系 12.1089181827
+签到 11.9547675029
+青花菜 13.900677652
+基本型 10.2371160058
+挺而走险 11.598092559
+科普馆 13.900677652
+司龙神 12.8020653633
+黄龙 9.30555780184
+美菱 9.87532596124
+过半 8.87023973058
+过午 11.1280889297
+得知 6.89036578467
+大白鼠 12.1089181827
+欺诈 8.86372504956
+寄身 11.5027823792
+会要 9.74179456862
+上传下达 11.9547675029
+淤血 10.5684731418
+正经八百 12.5143832909
+科技交流 12.8020653633
+无产者 9.96885201925
+百万锭 12.8020653633
+国防费 12.2912397395
+创新奖 12.8020653633
+测绘 9.22784881751
+雨夹雪 10.4041700905
+遮风 12.1089181827
+声发 13.900677652
+扶绥 11.9547675029
+订正 9.89334446674
+两重天 9.65218240993
+黄鹄 11.2616203224
+心心相连 13.900677652
+黄鹂 10.8561552143
+汉字键盘 13.2075304714
+格兰扁 13.2075304714
+洗得 9.87532596124
+渭南 9.72629038208
+别杀 12.8020653633
+游牧区 11.598092559
+第一股 10.0720362555
+股票市场 7.39339993959
+朝贺 9.53122979951
+油松 9.49395840471
+血染沙场 12.8020653633
+单碟 12.1089181827
+过劲 12.5143832909
+国本 10.7226238216
+签发 9.09665660724
+黄鹤 11.0103058941
+加尔巴 13.900677652
+萨罗 11.3357282945
+及至 8.68574189437
+东昌区 13.900677652
+访遍 13.2075304714
+扳动 11.2616203224
+整个儿 10.2897597393
+人力 7.71446902808
+铜皮 12.5143832909
+楼诗钞 13.2075304714
+费孝通 11.4157710022
+紧压 11.598092559
+黄鹰 11.7034530746
+人欲横流 13.900677652
+交与 9.75754292558
+富连成社 11.9547675029
+洗心 11.5027823792
+扛来 12.1089181827
+铜盘 12.1089181827
+年龄组 11.4157710022
+满脸堆笑 9.84023464143
+黄鸟 13.2075304714
+渭北 10.1394775363
+打滚儿 12.1089181827
+白毛狗 13.900677652
+姬手制 13.2075304714
+声压 11.4157710022
+美色 10.3453295905
+书呆子 9.85762638414
+吹破 12.2912397395
+乙酰唑胺 13.900677652
+眉纹 11.9547675029
+洛神赋 11.1926274509
+未定 8.53470163695
+勿药 13.900677652
+分裂主义 11.0674643079
+潦潦草草 13.2075304714
+未完 11.0103058941
+光亮亮 12.8020653633
+南瓜籽 11.598092559
+四区 13.2075304714
+税金 10.0720362555
+一个八岁 13.2075304714
+景致 9.20932976975
+第九路 12.8020653633
+新疗法 12.8020653633
+敦朴 12.8020653633
+吓唬人 11.2616203224
+人别 11.7034530746
+张献忠 7.45337178943
+黄黄 12.1089181827
+十八般 12.8020653633
+夜明砂 13.2075304714
+打嘴巴 11.8212361103
+过分 7.24910577839
+斯迪克 12.8020653633
+修行者 11.7034530746
+必然趋势 9.89334446674
+招降 9.01032852375
+霍斯特 13.2075304714
+灌溉渠 11.9547675029
+李来亨 9.34680076038
+过到 11.9547675029
+增强型 9.87532596124
+征自 12.5143832909
+永乐镇 12.8020653633
+签单 12.1089181827
+十万次 13.900677652
+朱翊钧 7.14374526273
+荣庆社 13.2075304714
+鞣料 11.9547675029
+声卡 13.900677652
+伪满洲国 10.2630914922
+崖顶 11.8212361103
+寄迹 12.2912397395
+第三十七 12.8020653633
+老校 13.900677652
+地窖子 12.1089181827
+江州州 12.8020653633
+南宜洋 12.5143832909
+经雨淋 12.8020653633
+机械动力 11.598092559
+大麦茶 13.2075304714
+孙文匪 13.900677652
+盼望着 9.5186510173
+女艺人 11.7034530746
+恋曲 11.8212361103
+考试者 12.8020653633
+吃软不吃硬 12.8020653633
+烹龙炮凤 13.900677652
+轧钢 10.0294766411
+帝心 12.1089181827
+外围设备 11.3357282945
+美英 9.45802639549
+宝剑锋 13.900677652
+扁平苔藓 12.5143832909
+惹起 10.2371160058
+微软 9.02548032877
+怯怯 10.0088573539
+人前 10.1630080337
+甘巴里 12.2912397395
+朱翊铭 12.8020653633
+美苏 10.0720362555
+声区 13.900677652
+恣肆 10.9562386728
+寄达 13.2075304714
+朱工 13.2075304714
+辅线 12.5143832909
+黄麻 9.01032852375
+非下不可 13.900677652
+编著者 13.900677652
+纪委书记 10.0088573539
+无尖锋 13.900677652
+过剩 6.59079616615
+巴统 11.7034530746
+欠条 11.2616203224
+开口笑 13.2075304714
+土豆块 13.2075304714
+赵剑华 13.2075304714
+卓琳 11.9547675029
+萨米 12.5143832909
+巴结 8.78868986362
+领口 9.80633308975
+慕斯 13.2075304714
+日轮 11.5027823792
+帝封 12.8020653633
+训练场地 13.2075304714
+试航 10.8561552143
+单管 9.96885201925
+声像 10.4994802703
+过冷 10.604840786
+拉维拉 13.900677652
+牛圈 11.7034530746
+见光死 10.3453295905
+统收统支 13.900677652
+塞曼效应 11.1926274509
+新兵连 13.900677652
+得用 10.3453295905
+帝尧 10.8561552143
+始作俑者 10.3171587135
+导航系统 9.05649056552
+尼昂 12.5143832909
+磨蚀 11.1280889297
+一间 7.35102690974
+茶乡 11.2616203224
+风雨交加 11.5027823792
+中爪哇 11.598092559
+搁起 12.1089181827
+蝇头微利 13.2075304714
+弓小箭 13.2075304714
+弘农湖 12.8020653633
+太古时代 12.1089181827
+刘南奎 13.2075304714
+丹凤眼 10.8561552143
+胯骨 11.7034530746
+美腿 12.5143832909
+一千七百 10.9049453784
+海兴县 11.8212361103
+餐饮 8.65365357982
+蛙跳 12.8020653633
+过凉 12.8020653633
+洋甘菊 12.8020653633
+编起 13.900677652
+刃具厂 13.2075304714
+国营事业 12.5143832909
+尸检 11.0103058941
+芒果树 12.5143832909
+巴纳 11.9547675029
+吹笙 11.4157710022
+吹笛 10.3453295905
+春秋时代 9.80633308975
+手段恶劣 13.2075304714
+单篇 11.598092559
+认到 12.5143832909
+不识起倒 12.1089181827
+藤榻 12.2912397395
+词源学 13.2075304714
+一九七七年 11.4157710022
+托卡 12.5143832909
+陈复表 13.2075304714
+胭脂 8.9519177616
+茶亭 11.3357282945
+利亚斯 12.8020653633
+张丘建 12.2912397395
+凌霄花 13.900677652
+无亲无故 11.1926274509
+躲开 8.71889410168
+连环图画 13.900677652
+整片 10.9562386728
+乐而不淫 13.900677652
+茶人 10.2630914922
+密切关系 8.26946587015
+帚子 12.2912397395
+杰尼索夫 13.900677652
+卡西亚诺夫 13.900677652
+千门万户 11.5027823792
+既成事实 10.1394775363
+许之深 13.2075304714
+藏锋 12.8020653633
+过儿 11.4157710022
+单笔 9.85762638414
+东窗事犯 12.8020653633
+平越府 13.2075304714
+个体 7.11848559597
+个位 12.2912397395
+森林学 12.8020653633
+餐馆 9.28555713513
+发案率 13.900677652
+笨重 9.15574552361
+钓鱼台国宾馆 12.2912397395
+唐之安 12.8020653633
+吹箫 10.765183436
+独个儿 11.1926274509
+隶书 9.66657114738
+磁力仪 11.5027823792
+吹管 11.598092559
+陨石 9.12155415886
+人仰马翻 10.9049453784
+独出机杼 13.2075304714
+繁体 11.8212361103
+不计前嫌 11.9547675029
+漏点 12.8020653633
+二十多里 11.3357282945
+桃李春风 13.2075304714
+周延 11.7034530746
+室壁瘤 13.2075304714
+辛泰 11.8212361103
+过关 9.56994431169
+拐骗 11.1926274509
+防腐蚀 11.2616203224
+木冰川 12.8020653633
+国朝 10.0088573539
+华西协合大学 13.2075304714
+一十四年 13.2075304714
+漂白 10.1630080337
+景色 7.92179188707
+罂粟碱 11.9547675029
+生态平衡 9.33632946051
+得票率 11.8212361103
+七八代 13.900677652
+靳尚 12.2912397395
+萘乙酸 13.2075304714
+景洪县 12.2912397395
+侧根 10.3453295905
+觉世 13.2075304714
+三百多斤 13.900677652
+帝崇 13.900677652
+父慈子孝 13.900677652
+借钱 8.73589167805
+萨达姆 11.0674643079
+罗退尔 13.2075304714
+冷畏寒 13.2075304714
+公而 13.900677652
+贺国贤 13.2075304714
+连阴天 13.2075304714
+咯咯吱吱 13.900677652
+陈光甫 12.5143832909
+注意转移 13.2075304714
+泉眼 10.533381822
+农业生产者 11.2616203224
+余万立方米 12.5143832909
+福安市 12.5143832909
+寄赠 12.1089181827
+黄鱼 10.604840786
+茶色 10.6818018271
+未始 11.7034530746
+截面积 11.0103058941
+茶会 10.9049453784
+矽钢片 13.900677652
+勺子 9.65218240993
+柴智屏 13.2075304714
+宣告无罪 11.7034530746
+小亭 11.2616203224
+个人 5.37829793387
+七八亩 12.8020653633
+眇眇 13.900677652
+试药 13.2075304714
+积石山保安族东乡族撒拉族自治县 12.2912397395
+陈五事 11.1926274509
+楚军营 12.8020653633
+豫东平原 11.4157710022
+提升机 11.4157710022
+价格法 13.2075304714
+孙坚引 13.900677652
+签写 12.8020653633
+人像 9.55687223012
+张岚 11.9547675029
+紧凑 8.9308643524
+鲜之意 13.900677652
+敢背 12.8020653633
+徒步旅行 13.2075304714
+染发 10.765183436
+丑化 11.2616203224
+铜瓦 11.0674643079
+单立 13.900677652
+冬去春来 11.4157710022
+轿夫 9.43476953332
+尔冰川 12.8020653633
+阿勒山 13.2075304714
+贫贱之交 12.8020653633
+因时制宜 11.598092559
+扳倒 9.89334446674
+家居饰品 13.900677652
+多维度 12.2912397395
+景茂 12.8020653633
+黄鳝 9.89334446674
+铜球 11.9547675029
+辛涅 12.5143832909
+拒绝域 13.2075304714
+横剖面 10.9562386728
+美育 10.9562386728
+不拘泥 12.1089181827
+测量法 11.5027823792
+塑料机械 12.8020653633
+劳而无功 11.4157710022
+诗歌评论 13.2075304714
+吃大亏 10.604840786
+纯金 9.93038573842
+规矩 7.34674424795
+当局者 11.2616203224
+牛城 12.5143832909
+灌溉水 11.598092559
+卢克莱 13.900677652
+单程 11.2616203224
+靠右边走 13.900677652
+繁丽 12.8020653633
+中国人民解放军总后勤部 12.1089181827
+装相 13.900677652
+七八两 11.598092559
+苗洞 12.2912397395
+圣塞巴斯蒂安 12.8020653633
+变过来 12.8020653633
+拖拉机手 11.5027823792
+七八个 8.98069672615
+供货渠道 13.2075304714
+膀子 9.38981814546
+失业工人 10.9562386728
+个个 7.78038023302
+于都县 12.8020653633
+人偶 12.8020653633
+保护法 10.9562386728
+狭鳕 12.1089181827
+七八万 11.0674643079
+奥瑞纳 11.2616203224
+格式化 10.4041700905
+绿蓑青笠 13.900677652
+显色性 12.5143832909
+泉石 11.7034530746
+几百棵 13.900677652
+七八丈 12.2912397395
+七八下 12.8020653633
+繁乱 12.5143832909
+病历本 12.8020653633
+堆置 13.2075304714
+谷氨酸钠 11.7034530746
+虽败犹荣 12.5143832909
+神策军 10.5684731418
+寄足 13.900677652
+汽车电器 13.900677652
+令人心悸 11.5027823792
+铅锌 9.54396882529
+不学无术 11.1280889297
+奸险 11.7034530746
+真力 13.900677652
+美满生活 13.900677652
+楼兰 9.84023464143
+永宁县 11.0103058941
+里泛青 12.8020653633
+踏步 11.598092559
+寄住 11.9547675029
+洪武 8.0985592766
+小腿 9.16447920358
+率团参加 12.8020653633
+十一员 13.2075304714
+墨吏 12.5143832909
+空竹 11.1280889297
+小腹 9.74179456862
+电视频道 11.4157710022
+构思新颖 11.9547675029
+宁乡县 11.4157710022
+涡线 13.2075304714
+农民日报 13.900677652
+铅锭 13.2075304714
+价格公道 13.900677652
+踏歌 12.2912397395
+供应部 11.9547675029
+供制 11.1280889297
+贴纸 12.5143832909
+凡心 11.598092559
+好心好意 11.0103058941
+铅锤 13.900677652
+看住 11.1280889297
+看低 12.5143832909
+刘永好 12.1089181827
+类目 11.1280889297
+造假者 12.8020653633
+古力 11.598092559
+有喜有忧 12.5143832909
+古格王 12.2912397395
+农业产业 11.0674643079
+追随 8.22392384971
+安富尊荣 12.2912397395
+看作 7.11396070137
+巾帼 11.1926274509
+燃尽 10.765183436
+太傻 11.0103058941
+芦根 10.642581114
+忘私 13.900677652
+粉煤灰 10.6818018271
+势利 10.1164880181
+小脸 9.62401153296
+疯瘫 12.5143832909
+巴尔塔 13.2075304714
+看似 8.12612610643
+东朝西 13.900677652
+石壕吏 13.2075304714
+依法逮捕 11.9547675029
+催交 13.2075304714
+钛酸 12.2912397395
+加入适量 10.8561552143
+巾帕 12.1089181827
+摘来 12.2912397395
+赊购 11.1280889297
+麻省 11.7034530746
+小脚 9.5186510173
+防化兵 11.3357282945
+空搜索 11.1280889297
+美媒体 12.8020653633
+太傅 9.13850371718
+赊账 11.598092559
+小脑 9.82314020807
+郎格尔 13.900677652
+麻石 12.8020653633
+夏侯霸引 12.8020653633
+斩落 11.9547675029
+安盟 11.9547675029
+古利 13.2075304714
+安监 11.3357282945
+小臣 9.59661255877
+商业间谍 12.8020653633
+不景气 8.86372504956
+知法犯法 12.2912397395
+官有权 13.900677652
+司马望 11.598092559
+空空 9.20019728618
+古刹 9.94943393339
+真切 8.73589167805
+把好关 13.900677652
+来源不明 11.2616203224
+变量名 11.0674643079
+小至 10.642581114
+平宁 13.2075304714
+婚戒 13.2075304714
+真刀 13.2075304714
+识数 12.1089181827
+武信君 12.8020653633
+罗林森 13.2075304714
+坦途 10.8561552143
+保护环境 9.82314020807
+胜似 10.5684731418
+小臂 12.1089181827
+奸雄 10.533381822
+后勤部队 11.5027823792
+颁奖词 12.8020653633
+捉摸不定 10.9049453784
+亚基 11.0103058941
+古列 13.2075304714
+须眉 9.96885201925
+管闲事 10.8561552143
+以近 10.2630914922
+封君制 13.2075304714
+贾敬贾 13.2075304714
+荣禄病 13.2075304714
+主动型 8.93783302172
+亚型 10.5684731418
+各有所好 12.8020653633
+套鞋 12.1089181827
+卡罗瑟斯 12.2912397395
+真剑 13.900677652
+小东江 12.5143832909
+大扫荡 12.8020653633
+婚托 12.8020653633
+骇异 10.765183436
+份饭 13.2075304714
+无可奉告 11.7034530746
+东北网 12.1089181827
+医术 9.65218240993
+没法儿 9.5186510173
+条田 11.8212361103
+卫王仪 13.2075304714
+势力 6.38424434906
+介草 13.2075304714
+膏盲 11.5027823792
+迟疑观望 13.900677652
+小苏学士 12.8020653633
+保级 12.5143832909
+楼内 10.9049453784
+安的列斯 11.2616203224
+身段 9.65218240993
+纵横 7.76079309975
+配镜 11.9547675029
+潮阳 11.5027823792
+诉不尽 13.900677652
+古剑 10.9562386728
+赵员外 10.1630080337
+保罗 8.62256299275
+供应量 7.97375162601
+看书 8.64840422393
+关文运 13.2075304714
+工业涂料 13.900677652
+俳谐 11.9547675029
+肖夏春 12.5143832909
+朱温代 13.2075304714
+籴米 13.2075304714
+古县 13.2075304714
+眠山 13.2075304714
+摘星 12.1089181827
+取得成功 9.28555713513
+胜于 9.7898037878
+蹦蹦车 13.900677652
+深有体会 10.9049453784
+招工难 12.1089181827
+圣卡洛斯 12.5143832909
+计如 13.900677652
+校阅 11.5027823792
+我委 12.5143832909
+安知非福 13.2075304714
+份额 6.94508504358
+看么 12.1089181827
+其母 9.69598503258
+地宜选 12.2912397395
+古原 12.8020653633
+气舍 13.2075304714
+十段 11.598092559
+小聚 11.9547675029
+哥德堡大学 12.8020653633
+安睡 10.6818018271
+潮音 10.9562386728
+校队 13.2075304714
+克劳迪斯 13.900677652
+催青 12.5143832909
+胜仗 9.01787572939
+聊生 12.5143832909
+许贯忠 12.1089181827
+生存能力 9.62401153296
+太冷 10.1871055853
+气色 9.27570483869
+空管 11.7034530746
+看中 8.1902506346
+司马曜 12.2912397395
+遮障 13.2075304714
+弗纳斯 13.900677652
+态度强硬 12.2912397395
+乔家栅 12.8020653633
+古号 13.900677652
+古史 9.54396882529
+空箱 12.8020653633
+武昌站 13.900677652
+校际 12.5143832909
+大檐帽 12.1089181827
+看下 11.1280889297
+看上 9.19114745066
+小者 10.0505300503
+小考 12.8020653633
+这时候 6.72289523578
+视频短片 13.2075304714
+真可 11.598092559
+次子 8.75318317516
+孽海花 11.9547675029
+真叫 10.7226238216
+计委 11.5027823792
+我妈 8.85082164473
+伴奏者 12.8020653633
+封建残余 11.8212361103
+贫血 8.35941410682
+那雪雁 12.8020653633
+太兴 12.5143832909
+小胡 11.3357282945
+太公 8.91707103027
+纵歌 13.900677652
+帕拉河 12.5143832909
+运动战 10.4041700905
+太全 12.8020653633
+督课 12.8020653633
+壶流河 12.2912397395
+篮球迷 13.900677652
+恶臭味 12.2912397395
+十次 10.4349417492
+陶唐 13.2075304714
+司马昭 9.40086798165
+凝固时间 12.8020653633
+杨锦麟 13.900677652
+那僧官 12.2912397395
+游会稽 12.1089181827
+性感受 13.2075304714
+魏宫人 10.0505300503
+撑不下去 11.598092559
+错认 11.0103058941
+行天下 11.598092559
+错讹 11.7034530746
+小胜 10.9562386728
+周顺昌 11.1926274509
+五百余次 13.2075304714
+古北 11.4157710022
+吴仲平 10.0940151622
+依赖感 12.1089181827
+气节 10.5684731418
+岩石学 10.4994802703
+认证工作 11.5027823792
+十款 11.7034530746
+其次 6.07943556845
+刘焉之 12.8020653633
+蒙太古 12.8020653633
+七八十年 12.8020653633
+以身 10.604840786
+周皇亲 12.1089181827
+冯其庸 12.8020653633
+铅铁 11.9547675029
+小股 9.55687223012
+小肠 9.07236391467
+操亦笑 13.2075304714
+忍冬花 13.900677652
+错话 11.0674643079
+阳茎 12.8020653633
+至情至性 12.8020653633
+警卫队 9.33632946051
+错译 13.900677652
+看人 9.48183704418
+销给 13.900677652
+麻皮 12.1089181827
+古华 11.9547675029
+收蚁 13.900677652
+区旗 12.8020653633
+十步 10.2897597393
+错误 6.49214708508
+维索 13.2075304714
+一上场 12.5143832909
+视星等 9.71102290995
+马塔潘角 13.2075304714
+纵欲 10.3743171274
+东阳市 11.598092559
+我处 11.5027823792
+缓和 7.42216800977
+看些 11.598092559
+古南 12.5143832909
+明帝东 12.8020653633
+遮阳 11.0674643079
+遮阴 12.8020653633
+短撅撅 13.900677652
+劈手 10.533381822
+集结 8.30225569298
+安全事件 10.2630914922
+山鸡椒 13.900677652
+依依 9.71102290995
+亚商 13.2075304714
+眼见得 9.87532596124
+幼吾幼以及人之幼 13.900677652
+吴皇帝 12.8020653633
+吸塑机 13.900677652
+情感游戏 13.900677652
+依侍 13.900677652
+缓坡 9.93038573842
+杏黄色 11.598092559
+布卡武 13.900677652
+依例 10.6818018271
+交际性 13.2075304714
+湖北省公安厅 13.900677652
+急驶 11.2616203224
+真傻 10.8561552143
+不以为然 8.3555002075
+小草 10.0294766411
+有职无权 13.2075304714
+以资 10.2371160058
+亿万家财 11.9547675029
+十五户 12.5143832909
+气脉 11.7034530746
+莫念莫 13.2075304714
+专辑语言 13.900677652
+西枝江 12.2912397395
+至死 9.19114745066
+黄遵宪 11.0103058941
+麻田 12.5143832909
+苏笙 13.900677652
+套锁 12.8020653633
+摸索 8.52078029844
+谈道 11.7034530746
+溜溜 9.26594866375
+红姿娇 13.900677652
+婚介所 11.5027823792
+九三学社 11.4157710022
+真像 9.16447920358
+李远哲 12.8020653633
+配音 10.3743171274
+克期 11.8212361103
+纵梁 11.8212361103
+三十余万匹 13.2075304714
+校长 6.42081352081
+纹风 13.900677652
+吃香的喝辣的 11.8212361103
+集纳 12.1089181827
+供货商 10.3743171274
+养羊业 10.3743171274
+气腔 12.8020653633
+求名利 13.900677652
+小范 12.1089181827
+指为 10.2630914922
+幸会 11.8212361103
+商都县 13.2075304714
+安琪 11.1926274509
+十棵 13.2075304714
+参考消息 11.1926274509
+集约 9.7898037878
+一半脸 13.900677652
+真僧 11.598092559
+颜忤旨 13.900677652
+一百四十九 12.2912397395
+安琦 13.900677652
+楼号 13.2075304714
+数百幢 13.900677652
+平均额 12.8020653633
+血红素 10.5684731418
+楼台 9.43476953332
+密切协作 11.1926274509
+多多指教 13.900677652
+麻痹 8.80692745117
+角斗士 11.1926274509
+文鸟 13.900677652
+学界泰斗 13.900677652
+府城 9.4233408375
+文字学家 11.8212361103
+莫往 13.900677652
+运动感 10.642581114
+口角流涎 12.2912397395
+须用 10.0294766411
+坐药 13.900677652
+卑琐 11.5027823792
+真值 10.5684731418
+腐烂变质 11.9547675029
+五经 9.25628675283
+套问 13.2075304714
+战得 12.2912397395
+十株 13.900677652
+站进来 13.900677652
+小菜 9.66657114738
+指代 12.2912397395
+齐格勒 10.7226238216
+联邦储备委员会 11.598092559
+十根 10.7226238216
+一路出 12.1089181827
+舒绣文 11.598092559
+蜂刺 13.900677652
+略有不同 10.0088573539
+视而不见 9.44633035572
+维尼奥 13.2075304714
+婚恋 11.2616203224
+尧西 13.900677652
+校门 9.98865464655
+医改 9.23723855786
+抢购潮 13.2075304714
+十桌 12.2912397395
+演剧队 10.9049453784
+次声 10.9049453784
+弓上射 13.2075304714
+吉诺 12.5143832909
+土台子 11.1280889297
+须略 12.8020653633
+节约水 13.900677652
+真假 8.88339781516
+二百只 12.8020653633
+指事 11.5027823792
+小莲 9.69598503258
+托管地区 13.900677652
+锐角 11.1926274509
+太初 10.4041700905
+十档 13.900677652
+赫曼汗 12.5143832909
+我娘 9.71102290995
+须留 13.900677652
+北岛群 12.5143832909
+畏怯不前 13.2075304714
+易辨 12.5143832909
+替您 12.1089181827
+妄加评论 13.900677652
+十桶 13.900677652
+至此 7.02338158048
+应举 11.0103058941
+苏林家族 13.2075304714
+突围而出 11.2616203224
+次大 11.1926274509
+阿松 13.900677652
+连科夫 13.2075304714
+黄梦然 10.1630080337
+一千四百 12.1089181827
+大宛王 12.8020653633
+闭上眼睛 8.78868986362
+博爱路 13.900677652
+包车去 13.900677652
+小艺 10.765183436
+耳红面赤 12.5143832909
+医疗机构 8.47133202302
+伏后仰 12.2912397395
+烩面 9.84023464143
+聊着 10.765183436
+十一块 13.2075304714
+喷火分队 13.2075304714
+豆乳 12.8020653633
+白森森 10.8096351986
+指使 8.77671367257
+一万二千五百 12.1089181827
+眼镜店 12.8020653633
+依人 12.1089181827
+七八十岁 11.5027823792
+颁发奖状 13.900677652
+州府 8.77077893705
+近程 9.24671730182
+楼前 9.5062284973
+埃尔萨 13.900677652
+王辟方 13.2075304714
+将近 7.27528528397
+打擂台 12.1089181827
+舒猿 11.9547675029
+亚吉 12.5143832909
+安生 9.20932976975
+我家 7.31726842982
+正行 9.72629038208
+轰动一时 10.0940151622
+一无是处 11.1926274509
+豆丝 13.900677652
+坐而待毙 13.900677652
+言浪语 13.2075304714
+半卷 11.4157710022
+次女 11.9547675029
+桂子飘香 13.900677652
+小船 8.27666014579
+楚王陵 13.900677652
+特殊教育 11.1280889297
+顾苓 9.62401153296
+依从 10.4666904475
+集美 10.4994802703
+邓友梅 13.900677652
+太原 7.34247984916
+誓辞 13.900677652
+太厚 10.6818018271
+介胄 11.8212361103
+供养 8.46695564842
+真凶 11.9547675029
+电子媒体 12.5143832909
+另谋高就 12.1089181827
+区域评价 13.900677652
+小舟 9.71102290995
+揣摸 11.1280889297
+集群 8.5440913773
+麻理 12.8020653633
+陈一舟 13.900677652
+隐忍不发 12.1089181827
+小毛头 13.900677652
+气肿 12.8020653633
+陷落地震 13.900677652
+亚哈 12.8020653633
+循环制 13.900677652
+金伐辽 12.5143832909
+蹦蹦跳 13.900677652
+短时期 10.0088573539
+利摩日 13.2075304714
+诚意金 12.5143832909
+练武艺 12.1089181827
+目不斜视 10.9049453784
+决非偶然 12.5143832909
+阿来 13.900677652
+小英 13.900677652
+萧劲光 12.5143832909
+上证综指 7.15191810448
+时快时慢 11.7034530746
+供冷 13.2075304714
+童府 13.2075304714
+弘文馆 11.8212361103
+亚哥 12.5143832909
+原子公式 13.2075304714
+隔起来 13.900677652
+运动性 10.2117981979
+胸怀祖国 13.900677652
+犯颜直谏 11.1280889297
+小苗 11.4157710022
+贴紧 11.0674643079
+唐家岭 13.900677652
+细菌学 10.4666904475
+错觉 8.93783302172
+沟沿 11.9547675029
+古公 11.1926274509
+折岭 12.8020653633
+随便说说 11.2616203224
+泡沫塑料 10.642581114
+计学 13.900677652
+蒙恩召 12.8020653633
+福贤 12.2912397395
+黑五类 11.7034530746
+福贡 12.8020653633
+第十九次 11.598092559
+绝经期 10.9562386728
+古典 7.35102690974
+为数众多 9.91169360541
+林徽音 13.900677652
+笑个 10.7226238216
+小芳 9.94943393339
+古兰 11.9547675029
+安疆 12.8020653633
+幸事 10.2897597393
+马斯巴特 13.2075304714
+再作道理 11.3357282945
+幸亏 8.04560572977
+玉戈 13.2075304714
+供出 10.3171587135
+菜谱 11.1280889297
+小节 9.87532596124
+外地人 9.87532596124
+王置府 13.2075304714
+旋涡泵 13.900677652
+挂搭 11.5027823792
+维克特 9.93038573842
+松有柏 13.2075304714
+魅力十足 13.2075304714
+死钱 13.2075304714
+广东省物价局 11.598092559
+立国 9.03314320152
+次席 10.4994802703
+文源阁 12.5143832909
+缓兵 12.8020653633
+梅花桩 12.5143832909
+砝码 9.75754292558
+狮子 8.1902506346
+南开大学 9.69598503258
+阴补阳 11.598092559
+唐太宗 8.64840422393
+生殖隔离 12.8020653633
+次帅 13.900677652
+唐入宋 13.2075304714
+盲童 12.5143832909
+未确定 10.3171587135
+强笑 11.1280889297
+财务主管 12.8020653633
+农业户口 12.5143832909
+供应链 9.32596667347
+章华寺 12.8020653633
+汗味 12.5143832909
+门尼德 13.2075304714
+执政为民 11.4157710022
+冯府 11.598092559
+维德丽 13.2075304714
+太咸 11.598092559
+地理经度 12.8020653633
+十一倍 13.2075304714
+三十七八 13.2075304714
+皤皤 13.900677652
+庾子山 13.900677652
+小蔡 13.900677652
+古图 11.598092559
+空忙一场 13.900677652
+鲅鱼圈 11.4157710022
+古国 9.4233408375
+次年 6.43903725977
+兽人 13.900677652
+保税 10.604840786
+防治规划 12.8020653633
+多伦多市 12.2912397395
+太姥山 11.9547675029
+爆发力 9.94943393339
+宣传费 12.5143832909
+配重 11.598092559
+杨红英 10.1164880181
+变法儿 12.5143832909
+端正 9.17328983326
+黑山南 13.2075304714
+太和 8.97342396682
+阎应元 12.5143832909
+那仙长 13.2075304714
+军事力量 8.9308643524
+铅酸 11.1926274509
+金平府 11.3357282945
+阳虚 10.0720362555
+司马懿功 13.2075304714
+摘掉 9.63799777493
+山本英夫 13.900677652
+压力表 11.9547675029
+运动服 11.4157710022
+尤详 11.5027823792
+崽子 10.4349417492
+圆全 13.900677652
+宋忠 12.2912397395
+床头灯 11.7034530746
+发展中国家 6.96142370593
+尤诺 13.900677652
+绢花 10.8096351986
+中小城市 8.71329184614
+十渡 12.2912397395
+布兰克 12.8020653633
+油布伞 13.900677652
+鱼烂虾 11.9547675029
+相对主义 10.7226238216
+战袍 10.1164880181
+次序 8.5440913773
+豪华轿车 10.4349417492
+熊光楷 13.900677652
+里外夹攻 13.900677652
+缓减 12.8020653633
+贝尔加拉 13.900677652
+宝威 13.2075304714
+克罗德 13.900677652
+散手 11.8212361103
+芦河 11.7034530746
+古器 11.598092559
+不成文 10.3171587135
+缓冲 9.29550746599
+亚历 12.1089181827
+傀儡政府 11.0103058941
+新华区 11.9547675029
+痛改前非 11.9547675029
+噬人鲨 12.2912397395
+定评 13.2075304714
+塔斯马尼亚 10.9049453784
+用布 10.0505300503
+热火队 13.2075304714
+寄予希望 12.1089181827
+和勒威 13.2075304714
+一致同意 9.56994431169
+法科大学 12.5143832909
+协力同心 11.9547675029
+太君 10.0294766411
+小薇 13.900677652
+锐进 12.8020653633
+野炮营 13.900677652
+摩加迪沙 10.765183436
+芦沟 11.7034530746
+格陵兰 9.66657114738
+太后 6.8566447547
+太合 13.900677652
+两百元 13.2075304714
+三四个 8.98069672615
+孤孤零零 13.900677652
+埃及王国 11.9547675029
+边宗王 12.8020653633
+新康德 10.765183436
+查达河 13.900677652
+再不去 11.1926274509
+陈长庚 13.900677652
+咬舌 11.9547675029
+炒上去 12.5143832909
+辰星 11.8212361103
+将要 7.57095674645
+于阗僧 12.5143832909
+塑料大棚 11.5027823792
+空翻 11.5027823792
+卫辉市 11.7034530746
+填写内容 12.8020653633
+四世同堂 11.3357282945
+小葱 11.9547675029
+包装厂 13.900677652
+严厉批评 10.6818018271
+马巨贤 10.7226238216
+喊回来 12.8020653633
+九间朝殿 13.900677652
+机台 13.900677652
+溜槽 13.2075304714
+闻讯而动 13.900677652
+生活安定 12.5143832909
+最高点 7.73947033028
+泥水工 13.900677652
+第七十四届 12.8020653633
+严凤笙 10.9562386728
+辞书 10.7226238216
+波河平原 12.8020653633
+凑近 8.98802276624
+仲霖 12.8020653633
+绷紧神经 13.2075304714
+计工 12.8020653633
+水火不容 11.598092559
+白罗衫 13.2075304714
+小营 13.2075304714
+传单 9.24671730182
+喜怒哀乐 10.2371160058
+辞世 10.4666904475
+榆社县 12.2912397395
+弱国 11.2616203224
+医护 10.7226238216
+劈裂 11.9547675029
+工农兵学员 12.5143832909
+空架子 11.598092559
+几十年如一日 11.1926274509
+建安风骨 12.1089181827
+左中允 12.8020653633
+古城 7.4191005227
+襄赞 12.8020653633
+棋品 13.900677652
+却步 11.3357282945
+气虚 9.54396882529
+信号旗 11.7034530746
+凉如水 12.2912397395
+开工 7.24781462262
+错车 13.900677652
+阿朗 13.900677652
+党总支 11.1926274509
+痛责 11.0103058941
+普通百姓 9.93038573842
+蟹苗 11.9547675029
+原癌基因 12.5143832909
+战败者 11.5027823792
+空置 10.533381822
+小蓬 12.5143832909
+中国人民武装警察部队 11.2616203224
+妫览 12.8020653633
+施爱 13.900677652
+摘抄 12.5143832909
+普兰店市 13.2075304714
+根系 8.74162235276
+婚期 10.4994802703
+阑入 13.2075304714
+负担得起 11.8212361103
+司马或 13.2075304714
+安珂 12.5143832909
+炖菜 12.2912397395
+张季子 12.5143832909
+市委党校 12.8020653633
+十五斤 11.8212361103
+配送 9.02548032877
+小蓉 12.5143832909
+孔氏 11.0674643079
+医托 13.900677652
+三八线 10.2117981979
+传道授业 11.9547675029
+真地 10.9049453784
+小蓟 12.2912397395
+孙犁 11.9547675029
+死锁 13.900677652
+采煤 8.65893063692
+赢球 11.9547675029
+机变 10.9562386728
+内政部 9.71102290995
+辞令 11.0103058941
+气蚀 12.1089181827
+陈永正 13.900677652
+皇城根儿 12.5143832909
+高龄产妇 11.8212361103
+翡冷翠 13.900677652
+错过 8.30969067146
+坐落 8.53938548627
+真坏 11.9547675029
+钛铁 12.1089181827
+主动力 10.9049453784
+空缺 9.38981814546
+癸二酸 12.5143832909
+罗贝勒 11.2616203224
+头头儿 12.8020653633
+羧酸 9.65218240993
+允许量 13.2075304714
+中下游 7.71446902808
+内在化 13.2075304714
+解升仙 13.2075304714
+束腰带 12.1089181827
+十五日 9.35738286971
+政策方针 12.2912397395
+和顺县 13.2075304714
+自由往来 12.8020653633
+外兴安岭 10.7226238216
+势垒 11.0103058941
+古坟 10.4041700905
+法轮 11.1280889297
+保管 8.39128931535
+困难户 11.2616203224
+小蒙 10.0940151622
+赫哲语 13.2075304714
+正比例 11.598092559
+王晋卿 13.2075304714
+亚光 11.7034530746
+亚克 11.0674643079
+死难 10.4041700905
+以西 7.31450599712
+阿曼 9.43476953332
+劫富济贫 11.4157710022
+清醒剂 13.2075304714
+予取予夺 13.900677652
+厩肥 12.1089181827
+面碗 13.2075304714
+错谬 13.2075304714
+唐斌领 12.8020653633
+诱骗性 13.900677652
+近缘 10.765183436
+劳宸忧 13.2075304714
+农业地带 11.0103058941
+蒙太后 13.2075304714
+精神饱满 10.7226238216
+楼址 12.5143832909
+女性美 11.9547675029
+循环型 12.8020653633
+公卿奏 12.2912397395
+纵波 11.0103058941
+化身为 11.2616203224
+卡斯特罗 10.8096351986
+成绩显著 11.5027823792
+陈永森 9.35738286971
+临界值 11.7034530746
+四十多个 11.1926274509
+无接缝 13.900677652
+一表人才 11.7034530746
+郊县 10.2897597393
+郝思嘉 12.8020653633
+前置词 13.2075304714
+濮之战 11.2616203224
+满清 10.3453295905
+古哲 12.5143832909
+真品 10.6818018271
+武神 13.900677652
+意见书 10.765183436
+马疾 13.2075304714
+艳福不浅 12.8020653633
+小蜂 11.5027823792
+说说看 10.765183436
+魏巍立 10.765183436
+小蜜 11.1926274509
+亮泽 12.2912397395
+狮头 11.9547675029
+四十多万 12.1089181827
+棋圣 12.2912397395
+崇高威望 13.900677652
+真君 10.0294766411
+克吾力 13.900677652
+值得注意 7.08723305246
+追逼 11.8212361103
+普遍现象 10.1394775363
+两百匹 13.2075304714
+闷在心里 11.598092559
+真名 10.8561552143
+空类 12.5143832909
+科学态度 11.1926274509
+个人修养 12.5143832909
+野孩子 11.7034530746
+古名 9.77354326693
+追逐 7.91422564669
+古吉 12.2912397395
+延伸度 13.900677652
+谈钱 12.2912397395
+人间天上 12.2912397395
+工艺厂 12.5143832909
+足部 10.2897597393
+哈夫斯 11.8212361103
+追逃 11.9547675029
+思想汇报 12.1089181827
+传化 10.0505300503
+穷大方 13.900677652
+科系 13.900677652
+奸邪 10.1164880181
+发狂地 12.5143832909
+旧迎新 13.900677652
+任用干部 12.8020653633
+炖肉 11.7034530746
+阁下 9.25628675283
+孕产妇 11.1926274509
+终南捷径 12.5143832909
+向棂星 12.8020653633
+姚兴 10.765183436
+供品 10.642581114
+坐蜡 13.2075304714
+阳萎 11.2616203224
+跚跚 13.900677652
+亚军 9.63799777493
+妮子 10.5684731418
+拉根尼 11.0674643079
+放下屠刀 11.9547675029
+享有者 13.900677652
+微生物学家 11.598092559
+昆山 8.98802276624
+真命 11.9547675029
+云脚 12.8020653633
+辰时 9.63799777493
+犬吠 10.8561552143
+熟菜 12.1089181827
+不守信用 12.2912397395
+医林改错 12.8020653633
+校释 10.9049453784
+亚冠 9.84023464143
+千左右 13.2075304714
+鹤岗市 11.5027823792
+我市 8.04560572977
+坦陈 10.9049453784
+舒头探脑 13.900677652
+阁主 13.900677652
+誓言 9.35738286971
+湖西 10.1394775363
+高吊 11.5027823792
+列宁格勒大学 11.1926274509
+小虫 10.0940151622
+拙口钝腮 13.2075304714
+文昭皇后 13.900677652
+加工能力 10.2117981979
+村务公开 11.598092559
+避一避 11.1280889297
+斩获 9.40086798165
+小虾 10.604840786
+电泳分析 13.2075304714
+信号枪 11.1926274509
+出疹子 13.900677652
+李当泰 13.2075304714
+计征 10.8096351986
+小虎 11.1926274509
+刘维尔 11.9547675029
+步军饶 13.2075304714
+高名 11.1280889297
+纵深 8.36334338496
+二百二十五卷 13.2075304714
+将设 11.9547675029
+将计 13.900677652
+我心 8.75901409547
+誓词 10.9562386728
+沟洫 10.9562386728
+十一卷 11.5027823792
+鲦鱼 13.900677652
+如沐春风 11.8212361103
+于宫禁 12.8020653633
+汤逢士 13.2075304714
+督责 10.9049453784
+夏侯和 12.8020653633
+压力计 11.7034530746
+圣布拉斯 13.2075304714
+医患 9.98865464655
+唧唧咕咕 12.5143832909
+牧于喀 12.5143832909
+司马懿克 13.2075304714
+鼎足而三 12.5143832909
+踏水 13.900677652
+大气物理 10.765183436
+颗粒无收 10.765183436
+船舶设计 11.7034530746
+俨若 11.4157710022
+一番话 8.9519177616
+瓦砾 9.72629038208
+昆巴 13.900677652
+十五条 12.5143832909
+司马懿兵 13.2075304714
+缓刑 10.642581114
+韵音 12.8020653633
+安然 9.43476953332
+再生父母 12.8020653633
+概不考虑 13.900677652
+练瑜珈 13.900677652
+陈吉余 12.5143832909
+颟顸无能 13.900677652
+家财万贯 11.598092559
+坦露 12.8020653633
+信号机 11.598092559
+采访报道 11.8212361103
+相视而笑 10.9049453784
+南横公路 13.2075304714
+保安大队 12.1089181827
+足金 11.4157710022
+密咒 11.8212361103
+领路人 13.900677652
+乐府诗 10.1394775363
+晋爵 12.1089181827
+杨忠烈 12.8020653633
+足量 10.604840786
+麻烦 7.05799436974
+身法 10.2117981979
+公卿士 12.5143832909
+内罗毕 10.4994802703
+分界点 11.0103058941
+官晋秩 13.2075304714
+引狼入室 11.7034530746
+金门马祖 13.900677652
+学海无涯 13.2075304714
+小蛇 11.598092559
+十一口 13.900677652
+史传克 13.900677652
+魏蜀吴 12.8020653633
+人民网 8.81927328699
+流芳后世 13.2075304714
+太坏 10.9049453784
+根绝 11.2616203224
+加工者 13.2075304714
+根结 11.8212361103
+早有所闻 11.4157710022
+南乐县 12.5143832909
+三余 12.1089181827
+桑德拉 13.900677652
+尤袤 11.7034530746
+根红 13.900677652
+有益无害 12.2912397395
+表面层 10.9049453784
+撞击声 11.5027823792
+死面 13.900677652
+演唱家 13.900677652
+号音 12.1089181827
+唐赛儿 11.9547675029
+根线 12.5143832909
+冰岛人 12.2912397395
+咸宣治 13.2075304714
+汗垢 13.900677652
+河鳗 13.900677652
+石窟寺 10.2371160058
+由约翰 12.8020653633
+沉香木 12.2912397395
+我弟 12.2912397395
+博普林 13.900677652
+宗和世 13.2075304714
+被迫 6.55919379961
+钟镇西 13.2075304714
+炭画 13.900677652
+批好 13.900677652
+所见略同 12.8020653633
+中炬高新 10.1164880181
+煞车 11.8212361103
+十一届 9.06439574502
+愈来愈热 13.900677652
+按序 12.1089181827
+唐宁街 11.598092559
+金鹰节 13.900677652
+霍普金 13.900677652
+十把 13.900677652
+保固 13.900677652
+小西 12.5143832909
+苍海郡 12.5143832909
+胳膊窝 11.4157710022
+艾滋病毒 11.3357282945
+履任 11.9547675029
+咸水歌 13.2075304714
+不成比例 10.9049453784
+亚当 9.25628675283
+杨用霖 13.2075304714
+鱼贯而出 11.5027823792
+不寒而栗 9.74179456862
+灰不溜丢 13.2075304714
+举世瞩目 8.39128931535
+不欢而散 10.7226238216
+葵花油 12.5143832909
+筛选机 13.2075304714
+计有畏 13.2075304714
+坐视 10.0505300503
+端机 13.900677652
+垂直面 11.7034530746
+永宁寺 11.5027823792
+十担 11.8212361103
+赐宴 10.4349417492
+主动式 10.4994802703
+周密调查 13.900677652
+叶哗哗 12.5143832909
+世贸中心 13.900677652
+四八 12.1089181827
+嫌贵 11.7034530746
+普瓦蒂埃 13.2075304714
+近照 13.900677652
+王出宫 13.2075304714
+诊断书 12.1089181827
+十招 13.900677652
+刚醒 13.2075304714
+财政年度 9.82314020807
+楼外 10.765183436
+猕猴桃 9.26594866375
+卡瓦拉多西 13.2075304714
+代子 13.900677652
+宛城区 12.2912397395
+基层人员 12.8020653633
+端来 9.33632946051
+小褂 10.9562386728
+介词 13.2075304714
+斯凯尔 12.8020653633
+西哥特 10.3171587135
+九届全国政协 11.9547675029
+代孕 10.8096351986
+铜管乐队 12.1089181827
+份量 9.94943393339
+骗倒 13.900677652
+数黑论黄 13.900677652
+狮城 12.2912397395
+依存度 10.0088573539
+错节 12.5143832909
+小解 11.1926274509
+帕拉斯 13.2075304714
+亚心 13.900677652
+尘肺病 11.9547675029
+十成 11.2616203224
+十戒 11.9547675029
+八辈子 11.0103058941
+表面化 11.5027823792
+反宾为主 13.2075304714
+勒孔特 13.900677652
+其所 8.78868986362
+施正柏 13.900677652
+李肇星 11.3357282945
+宽怀大度 13.2075304714
+天色已晚 9.98865464655
+小视 9.74179456862
+醒悟 8.76487921493
+慧书 9.62401153296
+陈永明 9.87532596124
+洛清汴 13.2075304714
+解放军总装备部 13.900677652
+尘雾 11.2616203224
+鱼贯而入 11.3357282945
+包装带 13.900677652
+冒起 10.604840786
+小角 11.8212361103
+小觑 9.21854642485
+韩瑶 13.2075304714
+咬过 12.1089181827
+家守制 10.9049453784
+知行 10.2117981979
+潜心于 10.8096351986
+十一岁 10.642581114
+阑尾 11.4157710022
+韩山童 11.4157710022
+保皇 10.8096351986
+经廷议 12.5143832909
+摸摸底 13.2075304714
+数过 12.8020653633
+李抱玉 13.2075304714
+王恭厂 12.8020653633
+南卫滩 12.8020653633
+气话 9.87532596124
+翻译片 13.900677652
+悲惨境遇 12.1089181827
+安纳 9.94943393339
+明显好转 9.20932976975
+土地平整 13.2075304714
+徐晃兵 13.2075304714
+其成 11.1280889297
+封印木 12.8020653633
+吕天成 11.8212361103
+集琦 12.5143832909
+昆剧 11.4157710022
+时不时 8.64318227995
+麻羊 13.900677652
+三叉神经痛 12.2912397395
+听得出 10.1394775363
+真实 6.52042186355
+冬季运动 11.4157710022
+古宫 13.2075304714
+茅庐三顾 13.900677652
+身手 9.43476953332
+小补 13.2075304714
+夏太康 13.2075304714
+古宾 13.900677652
+大宇公司 13.900677652
+十排 13.900677652
+西兰花 12.2912397395
+山口组 13.2075304714
+阳证 11.5027823792
+封猗卢 13.2075304714
+真宁 13.900677652
+刘云 12.2912397395
+真容 11.598092559
+苕帚 13.900677652
+故作神秘 11.598092559
+通世务 13.900677652
+古宅 12.8020653633
+清华园 11.9547675029
+恭敬地 8.43684584695
+两百岁 13.900677652
+辅助工具 11.598092559
+安置 7.59440236503
+小街 10.0505300503
+离心管 13.900677652
+风平浪静 9.56994431169
+亚平 11.8212361103
+家务事 10.4666904475
+大城山 12.8020653633
+庾翼 12.8020653633
+最低标准 10.9562386728
+撞击器 13.900677652
+保真 11.9547675029
+亚拉巴马 11.9547675029
+陶峙岳 12.8020653633
+美联储 6.80478443088
+瓦里亚 12.2912397395
+旗舰版 10.8561552143
+万古常青 13.900677652
+沈萍 9.07236391467
+指来指去 13.2075304714
+五出戏 13.900677652
+薰天 13.900677652
+太妙 12.1089181827
+真对 12.1089181827
+文化大革命 7.72481038187
+第九届全国政协 12.8020653633
+我军 7.55679721785
+动若脱兔 13.2075304714
+搬上去 12.8020653633
+玉玩器 12.2912397395
+姜椿芳 12.1089181827
+楼堂 12.5143832909
+古公父 13.900677652
+须经 9.18217878068
+太妃 9.94943393339
+麻绳 9.17328983326
+太好 9.63799777493
+严格执法 12.5143832909
+安翔 13.2075304714
+江可通 12.5143832909
+抗酸性 12.8020653633
+挂一漏万 13.900677652
+一九六三年 11.9547675029
+市场占有率 8.28754954559
+九十多万 12.8020653633
+三十七岁 11.9547675029
+子展 13.2075304714
+分界线 8.52078029844
+我党 10.9049453784
+武侯区 13.2075304714
+戎机 11.0674643079
+为时已晚 10.4349417492
+夏侯婴 13.2075304714
+无辜者 11.7034530746
+麻织 12.1089181827
+王化贞 12.1089181827
+太奇 13.900677652
+试验车 11.8212361103
+抱进去 13.900677652
+麻纱 11.0674643079
+信号楼 13.2075304714
+计入 8.77671367257
+挂冠而去 12.2912397395
+以农立国 12.8020653633
+古学 12.5143832909
+麻纺 10.8096351986
+珠江三角 13.900677652
+麻纸 10.4041700905
+白癜风 10.0720362555
+金亮架 13.2075304714
+热成层 13.900677652
+旅欧中国少年共产党 11.8212361103
+孙爱 10.4994802703
+富贵不淫 13.900677652
+太太 6.82571445401
+掌作礼 12.8020653633
+太大 6.80230201338
+有所不同 8.1608847398
+贴着 8.20023407859
+布干维尔 12.2912397395
+特高特 9.72629038208
+小袋 11.0674643079
+失足者 13.900677652
+太多 6.62066939909
+列夫斯基 11.598092559
+溜放 12.5143832909
+固醇 10.765183436
+杰姆斯 12.5143832909
+周镳才 13.2075304714
+王拥立 13.2075304714
+昆卡 13.2075304714
+邓政委 12.5143832909
+小袖 11.4157710022
+惠孙 13.2075304714
+缓役 13.900677652
+蓟门烟 12.8020653633
+棋室 13.900677652
+酱菜厂 13.2075304714
+特腊山 12.2912397395
+肝肠欲裂 13.900677652
+苔类 12.5143832909
+荣禄缓 13.2075304714
+纵情 10.2371160058
+阎君之 13.2075304714
+刘永华 13.900677652
+承租人 10.642581114
+杰出人物 10.2630914922
+金不换 12.1089181827
+第二十次 11.8212361103
+黧黑 10.2630914922
+唐三藏 9.75754292558
+永年县 13.900677652
+中头 12.8020653633
+纵惯 13.900677652
+蔓延到 9.87532596124
+第一二九 13.2075304714
+坐诊 12.1089181827
+古墓 6.90858122456
+来华访问 11.5027823792
+空炮 11.5027823792
+得计 12.8020653633
+古士 12.1089181827
+食蚜蝇 11.8212361103
+渊源 8.4284069783
+婚检 10.2897597393
+林小姐 12.8020653633
+言之史 13.2075304714
+叫嚷声 13.2075304714
+爱我吗 11.7034530746
+练功夫 13.2075304714
+小猫儿 13.900677652
+这辈子 8.31718134319
+布兰德 11.1280889297
+五千余里 13.2075304714
+防化学 11.4157710022
+搞钱 12.5143832909
+柳宗元 9.69598503258
+测试运行 13.2075304714
+父老乡亲 10.6818018271
+讲古人 13.2075304714
+方鲁 9.59661255877
+苛性钠 12.8020653633
+高层论坛 10.9562386728
+足以自豪 13.2075304714
+覃加耀 12.8020653633
+城标 13.900677652
+承兑人 12.5143832909
+港务费 13.900677652
+由上向下 12.8020653633
+阑干 13.2075304714
+大公无私 10.9562386728
+于东夷 12.2912397395
+精馏塔 12.5143832909
+民不堪命 12.8020653633
+背后议论 11.3357282945
+古堡 9.98865464655
+工业布局 10.3453295905
+零摄氏度 13.2075304714
+液化气 10.0294766411
+空灵 10.642581114
+小说 6.2177344821
+民办公助 12.8020653633
+变相涨价 11.1926274509
+猛子 10.8561552143
+张良庙 13.2075304714
+计分 10.8561552143
+松花江流域 10.6818018271
+白头鹤 11.7034530746
+存储体 12.2912397395
+没法子 9.91169360541
+计划 4.97349626372
+端方 11.0103058941
+小诗 10.6818018271
+太婆 11.7034530746
+祠庙 10.7226238216
+扎猛子 12.8020653633
+小议 11.598092559
+雅戈尔 10.533381822
+炮手 9.62401153296
+表面光 13.900677652
+一举三得 12.8020653633
+究其原因 9.38981814546
+小计 11.8212361103
+布达佩斯 9.54396882529
+投递员 13.900677652
+欺人之谈 12.8020653633
+捉摸不出 13.900677652
+贝勒斯 13.2075304714
+小许 12.2912397395
+丁胺卡那霉素 12.5143832909
+十八粒 13.2075304714
+小记 10.9562386728
+钱之利 13.2075304714
+大渡口区 12.5143832909
+游乐场 10.1164880181
+埃萨拉 12.8020653633
+十一座 13.2075304714
+楼宇 10.3743171274
+王登殿 13.2075304714
+棋子 9.13850371718
+配齐 11.1926274509
+华君武 12.5143832909
+十恶 11.0674643079
+烙花 12.1089181827
+古塔 9.85762638414
+一整张 13.2075304714
+司擢 12.8020653633
+出道时 13.900677652
+维护阶段 11.8212361103
+劈荆斩棘 13.900677652
+福藩 10.4041700905
+麻类 9.94943393339
+刀世勋 13.2075304714
+长恨 12.5143832909
+保留 6.48972577639
+玄德打 13.2075304714
+性感女 13.900677652
+根特 11.4157710022
+两百座 13.2075304714
+富安娜 13.900677652
+强调 5.75890544732
+真如 9.5186510173
+罗贝尔 12.5143832909
+果柄 13.900677652
+抱上 11.8212361103
+贫苦 8.78268383956
+十五次 11.598092559
+口德 12.8020653633
+元宵夜 11.8212361103
+最高级 9.85762638414
+史阁部 12.5143832909
+扬名世界 13.900677652
+大城市 7.31037660378
+鬼笔毒素 13.900677652
+县局 13.900677652
+尤著 12.8020653633
+基希讷乌 13.2075304714
+捐资助学 12.5143832909
+太宽 12.5143832909
+满门抄斩 11.3357282945
+身怀 10.8096351986
+哭坟 13.2075304714
+凭眺 12.8020653633
+医治 8.84443184663
+海事局 11.7034530746
+势头 6.86717116769
+太宰 9.98865464655
+电算化 13.2075304714
+我县 13.2075304714
+萧墙之祸 13.2075304714
+三十七年 10.1630080337
+亚尔 11.0674643079
+坐不垂堂 13.900677652
+供奉 8.26232298264
+收脚 13.900677652
+督脉 10.765183436
+卜问吉 12.8020653633
+轻声细语 12.2912397395
+保甲 9.85762638414
+气街 12.5143832909
+十一张 13.2075304714
+太宗 8.5440913773
+泥人 10.6818018271
+小言 13.900677652
+亚尼 11.5027823792
+谢母 12.2912397395
+我厂 12.8020653633
+太守 7.83922073305
+太安 11.1926274509
+碉堡 9.54396882529
+狼尾草 13.2075304714
+懈怠 9.49395840471
+真丝绸 12.8020653633
+太宁 11.8212361103
+气血 8.25523075433
+真够 9.5186510173
+缓建 12.8020653633
+真多 11.1926274509
+年深月久 12.5143832909
+空照 12.8020653633
+缓延 12.2912397395
+讨公道 12.8020653633
+死鬼 10.2897597393
+歼灭战 10.7226238216
+独臂刀 13.900677652
+市政中心 12.8020653633
+家禽家畜 11.9547675029
+给予帮助 11.2616203224
+古夷 13.2075304714
+太学 9.11318590919
+连宝贝 13.900677652
+封君太 12.1089181827
+阳西 13.2075304714
+瓦利德 11.9547675029
+私定终身 13.900677652
+懈惰 13.900677652
+太子 6.57289711355
+刘荣 12.5143832909
+十几排 13.2075304714
+印子钱 12.2912397395
+瞒过 10.0294766411
+古多 13.2075304714
+气袋 13.2075304714
+贴用 12.2912397395
+海柯尔 11.9547675029
+真大 10.3453295905
+夏军 11.0103058941
+家庭设备 13.2075304714
+装配图 13.2075304714
+七八十名 13.2075304714
+搞错 9.80633308975
+大杂院 10.9562386728
+集中兵力 9.75754292558
+东照誓 13.2075304714
+古奥 11.7034530746
+足衣足食 12.5143832909
+圈拢 13.900677652
+紧密结合 9.29550746599
+应邀前来 13.2075304714
+真奇 13.2075304714
+白豆杉 10.765183436
+利己 10.8096351986
+针法 10.4994802703
+黑素瘤 11.9547675029
+架子床 12.8020653633
+身患 10.533381822
+真好 9.11318590919
+古奇 13.2075304714
+南康县 12.1089181827
+连枝带叶 13.2075304714
+行伍出身 10.5684731418
+过小红 13.900677652
+犯罪现场 11.7034530746
+泥水匠 11.4157710022
+钱仲联 13.2075304714
+否定词 13.900677652
+贾诩见 13.2075304714
+荀爽 12.8020653633
+初加工 11.598092559
+药理学 10.8096351986
+性工作者 12.8020653633
+一千二 13.2075304714
+聚合作用 12.5143832909
+一步步 8.56313957227
+民心向背 12.8020653633
+不明说 11.9547675029
+尤荣 13.900677652
+踏板 9.41204128224
+显微照片 12.8020653633
+身材 7.78478552649
+我哥 9.62401153296
+小赵 9.62401153296
+完整性检查 13.2075304714
+一千五 11.9547675029
+祠堂 8.51618258919
+身条 13.2075304714
+当头一棒 10.604840786
+小赋 11.3357282945
+油葫芦 12.8020653633
+三十七处 13.2075304714
+干瘾 13.900677652
+古庄 13.2075304714
+小资 12.8020653633
+魏延射 13.2075304714
+弘文阁 12.5143832909
+肃然危坐 13.900677652
+日月无光 11.8212361103
+空盘 13.2075304714
+小赚 11.1926274509
+古庙 10.0720362555
+受委屈 10.2371160058
+真度 12.2912397395
+身板 10.3743171274
+空盒 12.1089181827
+假使能 13.900677652
+刘禅继 12.5143832909
+酉阳县 13.2075304714
+布兰妮 12.2912397395
+小账 12.5143832909
+小败 12.8020653633
+弘文院 11.2616203224
+形式主义 9.72629038208
+近畿 10.8561552143
+太岳 9.53122979951
+马德拉 11.5027823792
+古建 12.8020653633
+小贺 13.900677652
+小费 9.61021821083
+但金朝 13.900677652
+根由 10.4041700905
+齐梁间 12.8020653633
+剧中 8.70218062071
+塑料工业 11.5027823792
+周期表 9.91169360541
+刚刚开始 8.89673134603
+强似 9.91169360541
+招远市 12.5143832909
+白体 13.900677652
+归来 7.84389363875
+安稳 8.90346537821
+苕子 12.5143832909
+年度报告 9.80633308975
+小负 13.900677652
+达标者 12.5143832909
+烦透了 11.4157710022
+十曲 13.900677652
+傈僳 10.0940151622
+白金版 12.5143832909
+五七十 12.1089181827
+太岁 9.98865464655
+膳费 13.900677652
+小路 7.91926344072
+坐起 9.12999302751
+端掉 11.5027823792
+供应 6.2888352524
+柠檬皮 13.900677652
+踏查 12.8020653633
+吴家样 13.2075304714
+一千万 10.642581114
+源文件 12.1089181827
+空白 8.13235665618
+安立 13.2075304714
+橙子 10.5684731418
+东晋时期 12.2912397395
+张鼐奉 12.8020653633
+南京东路 13.900677652
+霍普镇 13.900677652
+一千个 10.1394775363
+古希 12.2912397395
+小跌 11.0103058941
+吃荤 10.765183436
+总工会 9.93038573842
+韦祖辉 11.9547675029
+真常 13.900677652
+端接 13.2075304714
+休养地 11.8212361103
+史思明 10.4349417492
+苦尽甜来 12.8020653633
+一千两 9.85762638414
+两百多 10.6818018271
+研制成功 8.51618258919
+身柱 13.900677652
+古帝 11.3357282945
+配餐 11.3357282945
+安端 12.5143832909
+马盖蒂 13.900677652
+青蒿素 12.2912397395
+南达科他州 12.2912397395
+椎弓 12.2912397395
+安童 11.0674643079
+安检员 12.2912397395
+小跑 8.89004235788
+水果罐头 11.2616203224
+撤营 13.900677652
+子之仇 13.2075304714
+七八十卷 13.2075304714
+阿空加瓜 12.8020653633
+正则表达式 9.91169360541
+司马歆 12.5143832909
+砾石 9.11318590919
+开张 8.69119149913
+孙师毅 13.2075304714
+煎炸 11.2616203224
+亚宝 10.604840786
+配饰 11.4157710022
+福船 12.1089181827
+夫人道 12.5143832909
+贴片 11.5027823792
+十晚 13.900677652
+每一款 11.598092559
+怪里怪气 12.5143832909
+香港联交所 9.6811699468
+地接社 13.900677652
+保状 12.5143832909
+莫罗佐夫 12.8020653633
+小越 12.8020653633
+挪威议会 12.1089181827
+太尔 12.8020653633
+太尖 13.2075304714
+太少 8.30596627237
+气运 10.765183436
+毕业典礼 11.598092559
+白俄 12.2912397395
+报表 8.53470163695
+太小 8.39128931535
+快活人 13.2075304714
+太尉 8.29487558568
+中国航空工业第一集团公司 13.900677652
+规模经营 11.7034530746
+煎炒 11.7034530746
+马斯特 12.2912397395
+祖儒 13.2075304714
+次回 13.900677652
+古微 11.9547675029
+咸水湖 9.58318953844
+黄巢事 12.8020653633
+帕金森氏症 13.900677652
+非赢不可 12.8020653633
+区公所 11.0674643079
+煎煮 10.533381822
+楼山 13.900677652
+真得 10.2630914922
+五粒 13.2075304714
+隔离病房 13.2075304714
+汗毛孔 11.9547675029
+故国之思 11.9547675029
+拉木罕 12.8020653633
+暗地里 9.23723855786
+太差 9.5062284973
+另搞 13.2075304714
+小豹 13.2075304714
+谆谆教导 11.8212361103
+古德 11.0103058941
+新颖别致 11.8212361103
+捡起来 9.93038573842
+繁征博引 13.900677652
+二百七十九目 13.2075304714
+摸牌 12.2912397395
+铺胸纳地 13.900677652
+财务费用 10.0088573539
+小豆 11.0103058941
+古径 13.900677652
+剧作 8.18036587537
+贴现 8.18364995057
+白丁 11.5027823792
+刚铺 13.900677652
+韦方 13.2075304714
+配额 9.41204128224
+玄论 13.2075304714
+过路车 13.900677652
+绕远 12.8020653633
+特迪贝尔 13.2075304714
+雨滴 10.3171587135
+障碍者 11.4157710022
+十一处 12.2912397395
+亚娜 12.5143832909
+乌鲁古 13.2075304714
+加持 12.1089181827
+美香菱 13.2075304714
+郝一 13.900677652
+无所用之 13.900677652
+鳞次 13.2075304714
+小谷 13.2075304714
+遐迩闻名 12.2912397395
+角斗场 11.5027823792
+真心 8.30969067146
+执委会 10.0088573539
+何时何地 10.4994802703
+言之过早 11.7034530746
+劈胸 11.7034530746
+十一天 12.5143832909
+蜂巢 9.62401153296
+温莎公爵 13.900677652
+心理咨询 10.4994802703
+小调 9.65218240993
+十一大 11.7034530746
+燕太子丹 12.2912397395
+坐而待旦 12.2912397395
+真快 10.642581114
+顾视 13.900677652
+货币主义 10.604840786
+缺点错误 12.2912397395
+天虚 13.2075304714
+慎重处理 11.9547675029
+羞耻感 12.1089181827
+鸩毒 11.5027823792
+福荫 11.1280889297
+二十世纪 9.20019728618
+十月 6.79325217787
+麻竹 12.8020653633
+张养蒙 13.2075304714
+楚城 12.8020653633
+白人 8.51618258919
+谷霁光 13.2075304714
+金岳霖 12.8020653633
+六千余 11.4157710022
+荤油 13.2075304714
+治理环境 12.1089181827
+白亮 12.1089181827
+借阅 11.5027823792
+古式 11.9547675029
+白云 8.47572763449
+阿方 11.7034530746
+宋室 11.598092559
+空着 9.23723855786
+十本 12.8020653633
+造纸机 11.8212361103
+校长室 13.900677652
+十朵 13.2075304714
+货运站 11.3357282945
+哥德巴赫猜想 10.9562386728
+白二 13.900677652
+势必 7.93197009199
+梅梅依然 13.2075304714
+文殊院 12.1089181827
+安提瓜 13.2075304714
+史重史 13.2075304714
+黄巢之 13.900677652
+煎熬 8.88339781516
+古彩 11.1926274509
+军人专政 12.5143832909
+胰脏炎 13.2075304714
+白令 11.8212361103
+一千余 10.6818018271
+纵有 9.28555713513
+下颚 10.5684731418
+罗德斯 12.2912397395
+越城岭 10.7226238216
+十条 9.80633308975
+农历 8.87023973058
+绝望者 13.2075304714
+棋局 10.2630914922
+十来 8.48903160012
+三角钱 13.2075304714
+恬淡 10.604840786
+马尔蒂尼 13.900677652
+花玛拐 11.3357282945
+十杰 12.8020653633
+湖色 12.5143832909
+古彝 13.900677652
+扎下来 11.8212361103
+苛性钾 13.2075304714
+科尔沁沙地 11.7034530746
+古录 10.765183436
+瓦拉纳西 12.1089181827
+带状谱 13.900677652
+小轮 10.2117981979
+两百家 12.8020653633
+骠勇 13.2075304714
+身故 10.4041700905
+济贫所 12.8020653633
+小车 8.42003872863
+中下旬 9.19114745066
+我国 4.93572644026
+惊飞 10.5684731418
+袁绍未 13.2075304714
+罗梅罗 13.900677652
+荣禄笑 13.900677652
+气质 8.08356649201
+果绿色 13.900677652
+棚圈 12.2912397395
+空瓶 12.2912397395
+网络股 11.1280889297
+古岳 13.2075304714
+缓存 11.4157710022
+谈论着 10.4349417492
+嫩江 9.35738286971
+岛状冻土 11.598092559
+芮邢 12.5143832909
+什物 9.69598503258
+莫测 9.91169360541
+信号源 11.1280889297
+错落 9.53122979951
+贾诩谏 12.8020653633
+电管局 13.2075304714
+机关 6.2927995787
+假仁假义 12.5143832909
+张骞改 12.8020653633
+情报局长 12.1089181827
+生物学部 12.8020653633
+心存芥蒂 12.2912397395
+太康 9.08039608637
+气走 13.2075304714
+民用航空 9.6811699468
+过渡内阁 12.8020653633
+到哪去 9.82314020807
+套餐 9.31571017331
+固阳 11.9547675029
+太庙 9.98865464655
+亚太 8.0985592766
+妮可 13.2075304714
+业业兢兢 13.900677652
+埃尔西 13.2075304714
+伟大意义 11.7034530746
+李燕 12.8020653633
+阿斗 10.4994802703
+前不巴村 12.2912397395
+男同事 12.2912397395
+李成军 12.8020653633
+奥联军 11.8212361103
+追风 11.1280889297
+泄露 8.11685246965
+干瘪 10.2897597393
+身旁 7.75220935606
+横得 13.2075304714
+足食 12.1089181827
+弁言 13.900677652
+库楚姆 13.900677652
+梅花拳 13.2075304714
+介质 7.82763311788
+坐轿 10.2630914922
+太平 7.52225146832
+谈立宪 13.900677652
+衣长齐 13.900677652
+古尼 12.2912397395
+坐车 9.34680076038
+古尸 8.37921673411
+缺阵 13.900677652
+以致 7.12759727632
+织女 10.3743171274
+亚姐 12.1089181827
+以至 7.20117731181
+麻科 13.900677652
+小过 10.642581114
+压住 8.88339781516
+压低 7.92179188707
+同心协力 10.0088573539
+可先去 12.8020653633
+尤甲仁 10.8561552143
+六万人 11.7034530746
+古尔 10.642581114
+晋州市 12.8020653633
+循环式 11.9547675029
+搞通 12.5143832909
+抗菌 9.45802639549
+小辫 10.8096351986
+足额 9.18217878068
+装配厂 11.7034530746
+道徒 13.2075304714
+信访工作 11.7034530746
+蠢猪 13.2075304714
+阳谋 11.8212361103
+冷期 13.900677652
+抢劫罪 10.8561552143
+巴倍虫 12.8020653633
+朝生暮死 12.8020653633
+古山 11.3357282945
+次品 11.2616203224
+纸屑 11.0674643079
+霍尔果斯 10.9049453784
+古屋 12.8020653633
+小辈 10.3743171274
+不起作用 9.84023464143
+卢三 11.1926274509
+四十余 10.1164880181
+陶勇 13.900677652
+阳谷 11.4157710022
+古里耶夫 12.8020653633
+唸佛 13.2075304714
+七八十元 12.8020653633
+渣滓洞 11.3357282945
+太师 8.16733637508
+摸熟 12.5143832909
+太帅 13.2075304714
+萧伯纳 10.3453295905
+李成儒 13.900677652
+现学现教 13.900677652
+十文 11.7034530746
+安神 9.72629038208
+二少爷 10.6818018271
+李和儿 13.2075304714
+安祖 13.900677652
+八角枫 12.2912397395
+压仰 13.900677652
+压价 10.642581114
+醋瓶 13.2075304714
+其时 8.08356649201
+太快 8.70772080109
+掌财 13.900677652
+四十亩 12.5143832909
+醒木 11.5027823792
+一贯道 12.1089181827
+宋学 11.8212361103
+用词不当 12.2912397395
+帕斯科 12.1089181827
+重点高校 12.2912397395
+太忙 10.0720362555
+四十五 10.5684731418
+美观 8.5440913773
+胰脏 11.8212361103
+蝼蚁儿 13.900677652
+阳路 13.900677652
+四倍 10.4666904475
+丰义 13.2075304714
+十方 10.4041700905
+哈姆雷特 9.69598503258
+安祥 12.5143832909
+影剧院 11.0103058941
+四十二 10.765183436
+发扬蹈厉 13.900677652
+裹足不前 11.0674643079
+更具 8.28027678626
+根瘤 10.5684731418
+近百 10.2630914922
+醒来 7.68008748188
+司马懿奏 12.8020653633
+古巴 8.7245279194
+气象 7.62780064543
+戴安娜 12.5143832909
+咸水水 12.5143832909
+普京 8.87679713113
+日趋 7.59440236503
+其文 10.5684731418
+金牌奖 13.900677652
+凑趣 10.604840786
+山东丘陵 11.2616203224
+人格结构 12.5143832909
+齐格弗 12.2912397395
+真差 13.900677652
+古川 13.900677652
+楼市 6.5123497924
+十时 11.7034530746
+真巧 11.598092559
+反函数 11.7034530746
+冷水浇头 13.2075304714
+建阳县 12.5143832909
+边吏 13.2075304714
+不生不灭 11.0674643079
+安科 8.48457724977
+滑吏 12.8020653633
+专项资金 9.28555713513
+吴中兵 12.8020653633
+来者不拒 11.0674643079
+笑脸迎人 13.900677652
+第十九条 11.9547675029
+普九 12.8020653633
+测震学 12.5143832909
+普乐 11.8212361103
+四十个 10.604840786
+棋布 10.8561552143
+民族共同语 12.2912397395
+鱼与熊掌 12.5143832909
+一步棋 10.2371160058
+半成品 9.49395840471
+圆桌会议 10.4349417492
+棋师 12.1089181827
+十支 11.4157710022
+四十七 10.765183436
+尤胜 12.5143832909
+四十一 10.765183436
+四十万 10.0720362555
+普雷斯科特 12.8020653633
+四十下 13.900677652
+雷仓 13.900677652
+四十三 10.8561552143
+医案 11.0103058941
+转向节 12.8020653633
+四百余万 12.8020653633
+刘孔昭 10.8096351986
+太强 10.1871055853
+红澄澄 12.2912397395
+弓石燕 13.2075304714
+太弱 10.4041700905
+亚砷酸 12.8020653633
+楼座 12.1089181827
+护理部 13.900677652
+积习难改 12.8020653633
+对胃口 12.8020653633
+销烟 12.2912397395
+杨家和 13.2075304714
+斯博斯岛 12.5143832909
+楼底 13.2075304714
+蟹行 13.900677652
+处置权 11.0103058941
+芦林 12.8020653633
+压下 10.1394775363
+薛元辉 13.900677652
+楼府 10.0940151622
+荣禄端 13.900677652
+四十九 10.3743171274
+校风 12.1089181827
+十数 9.38981814546
+斯琴格勒 13.2075304714
+箔片 12.5143832909
+台湾艺术 13.900677652
+十一家 12.5143832909
+一去不复 12.5143832909
+窄路 12.5143832909
+陈永红 13.2075304714
+上油 10.8561552143
+烤饼 12.8020653633
+老虎滩 12.1089181827
+白区 10.9562386728
+力所不逮 13.2075304714
+库普林 12.5143832909
+长挑 13.2075304714
+处子站 13.900677652
+压出 11.1926274509
+汤公公 11.1926274509
+苏丹红 11.4157710022
+见分晓 9.49395840471
+行车时间 13.2075304714
+垂直轴 12.1089181827
+小酌 11.5027823792
+生态学家 11.4157710022
+朔州市 11.598092559
+子逊昵 13.2075304714
+保湿 9.44633035572
+压减 11.5027823792
+帅长 11.8212361103
+祛病延年 12.5143832909
+设若 10.1394775363
+白包 13.900677652
+导热油 13.900677652
+结果期 12.5143832909
+麻杆 12.2912397395
+集注 10.2117981979
+仲良 11.7034530746
+燮理 13.2075304714
+小酒 11.9547675029
+指尖 9.96885201925
+白卷 11.7034530746
+徐根宝 13.2075304714
+潜来 12.8020653633
+蒋正华 13.900677652
+令人吃惊 9.74179456862
+不待说 13.900677652
+艾尔弗雷德 12.8020653633
+冯先生 12.1089181827
+安昌 12.8020653633
+互相配合 10.642581114
+麻木 8.30225569298
+墙体开裂 13.900677652
+二重性 10.765183436
+谈艺 13.2075304714
+十章 11.8212361103
+看开 11.7034530746
+根植 11.0674643079
+混混沌沌 12.8020653633
+肢离破碎 13.900677652
+丙烯酰胺 11.3357282945
+子杼立 12.8020653633
+鲁普努 13.900677652
+糨糊 11.2616203224
+迪克森 11.8212361103
+舰尾 11.7034530746
+文史界 13.2075304714
+金钱松 9.94943393339
+保温 9.34680076038
+天安门 8.99540287354
+死背 13.2075304714
+舍出 13.900677652
+金枝玉叶 10.9562386728
+犹在 10.1394775363
+酣然入梦 13.900677652
+假喀斯特 13.2075304714
+青龙刀 11.1280889297
+胡逗洲 12.5143832909
+抱怨声 13.2075304714
+追求者 11.1926274509
+男人婆 13.900677652
+泰加林 11.5027823792
+比西子 12.5143832909
+黄巢北 12.8020653633
+小量 10.2371160058
+小野 12.1089181827
+纵穿 11.9547675029
+与己无关 11.5027823792
+安曼 11.1926274509
+近一年来 9.75754292558
+守株待兔 10.9049453784
+压光 13.2075304714
+宋学疑 13.2075304714
+中下等 12.1089181827
+孙礼领 13.2075304714
+白厅 11.8212361103
+乱花渐欲迷人眼 12.2912397395
+众星捧月 11.1280889297
+普兰 10.9562386728
+日色 10.4349417492
+小金 11.7034530746
+辞官 9.5062284973
+亏量 13.900677652
+白叶 12.2912397395
+台湾籍 12.5143832909
+矫形术 13.900677652
+寿延千 12.8020653633
+名画家 11.7034530746
+供应者 11.4157710022
+金融交易 11.2616203224
+信号灯 9.59661255877
+推想 10.4994802703
+火箭筒 10.1164880181
+剧务 12.5143832909
+羊皮 7.48885938427
+四十八 10.8096351986
+骨颤肉惊 13.900677652
+四十六 11.1280889297
+缄默无言 13.900677652
+纵然会 13.900677652
+热电偶 11.4157710022
+白发 8.83808261895
+物理科 13.900677652
+看待 7.42216800977
+仲芳 13.900677652
+历史渊源 10.765183436
+三千万美元 12.5143832909
+刷洗 10.7226238216
+看得 7.52565283215
+公示栏 12.8020653633
+七八十位 13.2075304714
+白及 11.1280889297
+调节性 13.2075304714
+天文家 12.5143832909
+三餐 10.2371160058
+分布图 10.2630914922
+白刺 11.0674643079
+麦茬 11.4157710022
+喝牛奶 10.642581114
+踏空 10.2117981979
+承受能力 8.25170341381
+朱温建 12.8020653633
+直勾勾 10.0940151622
+搞过 10.604840786
+天都峰 12.5143832909
+传真号码 13.900677652
+十二海里 12.8020653633
+就地解决 11.9547675029
+号脉 11.7034530746
+茁壮 10.533381822
+幻境 10.9049453784
+青龙县 12.2912397395
+五斗橱 11.4157710022
+烙饼 9.94943393339
+白刃 10.3171587135
+剧协 13.2075304714
+网上网 9.48183704418
+爪哇 9.08039608637
+身穿 7.75434839431
+严亮祖 10.765183436
+六万元 11.7034530746
+柳垂金 13.2075304714
+皂角刺 13.900677652
+蛟龙 9.85762638414
+小嫦娥 11.9547675029
+周期长 10.1164880181
+举重选手 13.900677652
+陆景 13.900677652
+急风 12.5143832909
+闹闹哄哄 12.1089181827
+严厉打击 9.21854642485
+辰牌 10.765183436
+一千只 12.8020653633
+艾红军 11.5027823792
+男人家 10.8096351986
+韵致 10.2371160058
+骇人 9.96885201925
+马健翎 12.2912397395
+摸清 9.84023464143
+摘登 12.5143832909
+个人住房 10.2371160058
+工艺师 12.5143832909
+教导师 13.900677652
+电路状态 13.2075304714
+联邦快递 10.7226238216
+一堂课 11.7034530746
+睡不到 13.900677652
+岑氏刊 13.2075304714
+小郭 10.533381822
+沈士柱 8.9519177616
+起伏不定 11.8212361103
+涡漩 13.900677652
+柳庄相 13.2075304714
+李方训 13.2075304714
+小郡 12.8020653633
+一千包 12.5143832909
+好奇心 9.05649056552
+集流 11.9547675029
+潜进 12.1089181827
+七八十两 12.5143832909
+斯塔维斯 12.5143832909
+棉红铃虫 13.2075304714
+对比度 11.598092559
+七八十个 11.7034530746
+兢兢业业 9.80633308975
+伊藤博文 9.24671730182
+民穷财匮 13.900677652
+和丹根 11.7034530746
+没劝 12.8020653633
+中央军事委员会 9.46986085313
+爷爷奶奶 10.3171587135
+剧变 9.63799777493
+端线 10.9562386728
+裹起 13.2075304714
+一千匹 12.1089181827
+七八十万 13.900677652
+尖峰岭 11.8212361103
+七八十下 13.2075304714
+端纳 12.5143832909
+超期服役 13.900677652
+回心转意 9.46986085313
+母老虎 11.0674643079
+运动版 11.0103058941
+看座 12.1089181827
+张道原 12.8020653633
+液态氧 12.5143832909
+十等 11.8212361103
+小邦 10.2630914922
+农牧民 11.5027823792
+安枕 11.4157710022
+马德罗 12.5143832909
+野战军 8.60737282725
+白勺 13.900677652
+防盗网 13.2075304714
+聊斋 11.1926274509
+文化底蕴 10.642581114
+福鼎 12.1089181827
+缩短距离 13.2075304714
+洋山芋 13.900677652
+依山 9.29550746599
+金属货币 10.2371160058
+宁夏省 11.8212361103
+桑珠 13.900677652
+长短期 11.598092559
+压倒 8.74738605748
+一顶 8.15128466607
+看店 12.8020653633
+应召入伍 12.8020653633
+皮姆贝 13.900677652
+一千卷 11.9547675029
+普及 7.72066099832
+护理费 12.5143832909
+陈良臣 13.2075304714
+千余间 12.8020653633
+卡位 12.8020653633
+唐诗三百 11.7034530746
+隆胸术 13.900677652
+十碗 13.900677652
+多种类型 9.7898037878
+依律 11.5027823792
+集训队 11.3357282945
+蒙乐山 13.900677652
+科教兴国 12.8020653633
+吕太后 13.900677652
+化学品 9.58318953844
+告老 11.598092559
+马斯河 11.598092559
+小球藻 11.8212361103
+空棘 11.8212361103
+医病 12.8020653633
+刚读 13.2075304714
+阳郡 10.604840786
+杨书兴 11.2616203224
+依循 12.5143832909
+白兴 13.900677652
+杨伯祥 12.8020653633
+保民 11.3357282945
+剽窃 10.8096351986
+发生量 11.7034530746
+小妖精 12.1089181827
+阳邑 12.5143832909
+连成一气 12.1089181827
+白养 11.9547675029
+仲老 10.2897597393
+软绳 13.900677652
+暗管 11.9547675029
+四德 12.5143832909
+极移 10.8561552143
+剪个 13.900677652
+保水 10.7226238216
+四十发 12.8020653633
+医疗 6.57684708577
+小丫头 8.50705010562
+试剂盒 12.2912397395
+压压 11.2616203224
+披肩发 12.5143832909
+自动装弹机 11.4157710022
+功能位置 13.2075304714
+柠檬桉 13.900677652
+廉租房 9.40086798165
+阳邪 12.2912397395
+宿鸟栖 13.900677652
+从暖阁 12.2912397395
+白金汉 11.598092559
+西弗吉尼亚 12.8020653633
+杰拉德 11.4157710022
+白光 9.12999302751
+哈尔滨医科大学第二附属医院 13.900677652
+私人化 12.5143832909
+深山大泽 13.900677652
+笑影 11.9547675029
+奉献给 9.91169360541
+普华 13.900677652
+一千倍 12.8020653633
+邵庵 13.2075304714
+芦竹 12.8020653633
+四十匹 12.8020653633
+须放 12.8020653633
+斯登堡 12.8020653633
+空档 10.9562386728
+口音 8.64840422393
+压印 11.5027823792
+压卷 13.900677652
+满坑满谷 13.900677652
+预先安排 12.1089181827
+老大爷 10.8096351986
+戈尔什科夫 11.3357282945
+空桶 12.1089181827
+沙河口区 12.8020653633
+荀正 13.900677652
+讨贼 9.61021821083
+阴转晴 12.5143832909
+孟浩然 10.8561552143
+贴水 9.6811699468
+金秘术 11.0674643079
+白军 10.9049453784
+石门县 12.1089181827
+根毛 10.6818018271
+台尔曼 11.9547675029
+反光板 13.2075304714
+空桑 12.8020653633
+梁宣帝 13.900677652
+宝相花 12.8020653633
+小芽 10.642581114
+私囊 11.8212361103
+四十卷 11.3357282945
+依归 11.9547675029
+货摊 11.9547675029
+先锋号 12.5143832909
+即时清结 13.2075304714
+空格 9.59661255877
+白凤 12.8020653633
+没有止境 11.7034530746
+栋梁之材 11.4157710022
+氨苯喋啶 12.2912397395
+医用 9.41204128224
+幸德 13.2075304714
+刷漆 12.5143832909
+化学名 12.5143832909
+几句话 7.66822963543
+简笔字 13.900677652
+建筑创作 12.5143832909
+医生 6.31997789975
+石浦 11.8212361103
+气量 9.40086798165
+石门口 13.900677652
+遮蔽 9.23723855786
+整棵树 13.2075304714
+天然材料 12.5143832909
+贱内 11.3357282945
+听力 9.16447920358
+供应舰 12.2912397395
+幸得 9.12155415886
+五六十年代 10.9562386728
+几千只 12.8020653633
+沙鲁里山 11.1926274509
+俄联邦政府 12.2912397395
+胡贝图 12.5143832909
+复合地板 11.1926274509
+公育 13.900677652
+古玩城 12.5143832909
+幸幸 13.900677652
+热电厂 10.0088573539
+依序 12.1089181827
+开席 11.0103058941
+床头柜 10.1164880181
+整体实力 10.604840786
+识相 10.4666904475
+炮管 9.94943393339
+八世纪 11.8212361103
+魏惠王 10.642581114
+郝健 12.1089181827
+中央统战部 11.7034530746
+快枪手 11.598092559
+小芹 13.2075304714
+安敢 9.38981814546
+清水河县 13.2075304714
+安敦 13.2075304714
+强盛时期 11.7034530746
+指引 8.26946587015
+令人讨厌 11.2616203224
+开火 9.61021821083
+乱石滩 12.8020653633
+十种 10.4666904475
+超净 12.8020653633
+十科 13.2075304714
+曳光 12.1089181827
+十秒 12.5143832909
+保洁 11.7034530746
+胡凤莲 13.900677652
+和适航 13.900677652
+章名涛 13.2075304714
+肝胆过人 13.900677652
+点戏 12.2912397395
+安政 11.9547675029
+安放 8.89673134603
+芦笙 11.2616203224
+芦笛 11.9547675029
+三江口 10.4994802703
+气道 10.1630080337
+潜育期 13.900677652
+白做 13.900677652
+保津 13.2075304714
+吹熄 11.0674643079
+雄才伟略 13.2075304714
+秉笔直书 13.900677652
+压力 5.11881516242
+氮化合物 10.3453295905
+满腔仇恨 12.8020653633
+芦笋 10.3171587135
+演唱会 10.6818018271
+小兰屿 12.5143832909
+避而不谈 11.1926274509
+存储器 9.4233408375
+谬传 13.900677652
+空楼 13.900677652
+拉切尔 13.900677652
+照签 13.900677652
+妮丝 12.5143832909
+相关者 11.4157710022
+斯佩雷 13.2075304714
+马斯洛 11.7034530746
+国计民生 9.56994431169
+和平共处 9.71102290995
+端粒 11.9547675029
+半梦半醒 12.8020653633
+统计法 11.598092559
+神仙般 12.1089181827
+挖潜 11.2616203224
+上码头 12.5143832909
+十二亩 13.2075304714
+搞起 10.4994802703
+又舒 12.8020653633
+先锋霉素 12.2912397395
+国际卫生组织 13.2075304714
+宋承唐 12.8020653633
+剧减 11.1926274509
+左不过 11.3357282945
+三万六千顷 13.900677652
+六案 12.2912397395
+乱了阵脚 10.604840786
+现金流 8.53470163695
+相关联 9.94943393339
+一千元 10.9562386728
+四十多家 12.8020653633
+潦倒 10.533381822
+坦荡 9.5062284973
+压到 10.2117981979
+压制 7.52395070408
+胜局 11.3357282945
+变法运动 10.8561552143
+奥得河 10.8561552143
+炮筒 10.5684731418
+涡流 10.1394775363
+普利 9.89334446674
+阿亚库乔 11.598092559
+金复州 12.8020653633
+鹞鹰 11.8212361103
+中学语文 12.8020653633
+有所不为 12.1089181827
+波斯顿 13.900677652
+科西嘉 10.8096351986
+便衣警察 11.8212361103
+文札则 13.2075304714
+望穿秋水 11.8212361103
+醋栗 12.2912397395
+医理 11.2616203224
+发行中心 11.7034530746
+喷吐 10.4994802703
+私图 13.900677652
+簪缨世胄 13.900677652
+静谥 13.900677652
+酬庸 12.5143832909
+嫌隙 10.765183436
+安托 13.900677652
+木栏 11.8212361103
+加的夫 12.8020653633
+罪莫大焉 12.8020653633
+空滤 11.9547675029
+尝点 13.900677652
+弹指一挥间 12.1089181827
+外国文学 10.1630080337
+科研项目 10.8561552143
+因人成事 12.2912397395
+杨子荣 13.2075304714
+沈安 12.5143832909
+将领 6.54823655173
+幸好 8.7245279194
+砾漠 11.7034530746
+工艺学 10.9562386728
+变法维新 10.2630914922
+同行业 9.14708746087
+十级 11.8212361103
+小镇 8.65365357982
+足色 13.2075304714
+白土 11.1280889297
+六万吨 13.900677652
+自主运动 11.8212361103
+小镜 12.8020653633
+加拿大 6.86893639321
+近洋 12.2912397395
+辅助材料 9.22784881751
+十线 13.2075304714
+铁穆耳 10.0720362555
+昆仑 8.56795885871
+偏硅酸 12.8020653633
+宫灵霄 13.2075304714
+十组 13.2075304714
+近海 8.23771717184
+小锣 10.9562386728
+续玄怪 13.2075304714
+化学势 11.1926274509
+音效卡 13.900677652
+挤落 13.2075304714
+白坡 12.1089181827
+广协济 13.2075304714
+下马 7.37271973435
+思杰 12.5143832909
+并称 8.12302532875
+纵线 11.0674643079
+公路工程 11.7034530746
+大财团 12.1089181827
+白坝 13.2075304714
+石涧 13.2075304714
+次之 8.18364995057
+柏原崇 13.900677652
+张岂之 13.2075304714
+远视者 13.900677652
+抱腰 12.2912397395
+陈天桥 11.598092559
+小错 11.8212361103
+亮绿 13.2075304714
+宿卫 9.84023464143
+沫儿 11.598092559
+艾里克 12.2912397395
+小闯 10.0940151622
+同行人 12.2912397395
+横店 10.0294766411
+敖陶孙 13.2075304714
+小门 9.44633035572
+蒙蒙亮 10.5684731418
+西攻宛 13.2075304714
+听不出来 11.0674643079
+武术馆 13.900677652
+安拉 9.63799777493
+剧团 8.32472854883
+小间 11.0103058941
+白垩 9.18217878068
+代售 12.2912397395
+消耗量 9.96885201925
+中控锁 12.2912397395
+遮荫 11.5027823792
+楚国 8.2985588311
+用学 13.900677652
+铄金 13.900677652
+化学剂 12.5143832909
+阳陵 12.1089181827
+次于 9.30555780184
+须持 12.2912397395
+廖锡龙 12.8020653633
+坐镇 8.94485059437
+快速增长 7.56739802384
+莫奇利 11.9547675029
+须按 10.765183436
+巫卜之 12.8020653633
+刚走 13.900677652
+李红 11.2616203224
+硚口区 13.900677652
+看客 9.84023464143
+安抚 7.86519621945
+可测性 13.2075304714
+分布区 8.57280148319
+气韵 10.3171587135
+万树园 13.2075304714
+待摊费用 13.900677652
+示威性 13.2075304714
+咬去 12.5143832909
+中书平 11.4157710022
+赔偿损失 10.1630080337
+看家 9.58318953844
+千数百 12.8020653633
+嫩皮 11.9547675029
+八圈 13.2075304714
+里维廉 13.2075304714
+泸水 10.4994802703
+成反比 9.18217878068
+官蕊官 12.8020653633
+铁磁性 10.3453295905
+李纹 11.4157710022
+阳阳 11.1280889297
+神武帝 13.2075304714
+看守 8.21370229564
+安抵 13.2075304714
+苏白 11.8212361103
+看完 9.14708746087
+男人帮 13.2075304714
+乌苏河 12.5143832909
+曹仁守 12.5143832909
+刚贴 13.900677652
+无为而治 10.642581114
+杂事缠身 13.900677652
+四十多岁 9.58318953844
+荀派 12.8020653633
+指套 12.2912397395
+笑声 7.70423352418
+尤马 12.8020653633
+配股 8.03989142851
+气阻 12.5143832909
+隐形遗传 13.900677652
+东观汉 11.8212361103
+妄自尊大 11.1926274509
+关汉卿 10.0088573539
+巴颜喀拉 12.2912397395
+用字 10.642581114
+理屈 13.2075304714
+腺垂体 10.9562386728
+馆藏品 12.5143832909
+须报 12.5143832909
+葱花饼 13.900677652
+数百万项 13.900677652
+石叔诚 13.900677652
+琼楼玉宇 12.1089181827
+广积粮 11.7034530746
+禄劝彝族苗族自治县 12.5143832909
+并科 13.900677652
+四式 12.5143832909
+校舍 9.32596667347
+阳韵 13.900677652
+武平侯 13.2075304714
+费彝民 13.2075304714
+套色 11.0674643079
+辛勤工作 10.9049453784
+血汗钱 10.4041700905
+次优 11.3357282945
+白嘉 13.900677652
+麻扎 11.9547675029
+气阀 11.4157710022
+中下级 10.6818018271
+县市长 13.2075304714
+大惑不解 10.3171587135
+摘牌 10.0088573539
+那波帕 12.8020653633
+剧场 8.95903522937
+文景之治 10.3453295905
+裹脚布 12.5143832909
+过于自信 11.8212361103
+老年性痴呆 12.1089181827
+宋影 13.2075304714
+俄顷 10.8096351986
+刘德胜 12.5143832909
+指头 8.0746775446
+懋功 11.4157710022
+履历 10.4349417492
+次位 13.2075304714
+经济效益 7.72689154807
+严格把关 10.765183436
+毛颖 12.2912397395
+中程导弹 10.642581114
+战略战术 9.82314020807
+覆盖度 10.3743171274
+达成协议 8.38724890581
+关宁精 11.5027823792
+修桥补路 12.8020653633
+指天 11.598092559
+醋溜 12.1089181827
+真实气体 13.900677652
+成功率高 12.2912397395
+古卦 10.8561552143
+阿摩 12.5143832909
+百分之十点 12.5143832909
+安插 10.3171587135
+身经 11.598092559
+王裕民 13.2075304714
+校花 10.8096351986
+小铺 11.598092559
+小银 11.598092559
+容分 11.3357282945
+眼花耳热 13.900677652
+专家学者 9.12155415886
+尚仪 12.8020653633
+泡菜坛 12.8020653633
+见上图 13.900677652
+气隙 11.598092559
+小铃 12.8020653633
+蓊蓊郁郁 13.900677652
+小铁 11.8212361103
+咸水相 13.900677652
+丧居 13.900677652
+四张 10.533381822
+四百余名 12.8020653633
+用心良苦 10.765183436
+阳面 11.8212361103
+盆景花卉 13.900677652
+窗口单位 13.900677652
+四十名 11.598092559
+驰名天下 12.1089181827
+气雾 11.9547675029
+普吉 12.5143832909
+切实增强 9.72629038208
+斯特恩 10.0940151622
+轩辕氏 11.7034530746
+反应迟钝 10.533381822
+炭炉 11.8212361103
+安排 5.77327308928
+打板子 13.900677652
+荀氏 12.5143832909
+物理系 9.71102290995
+塞德尔 13.2075304714
+使劲儿 11.5027823792
+根治 9.19114745066
+德通宝 13.2075304714
+元谋猿人 11.9547675029
+招出来 13.900677652
+根河 11.2616203224
+看定 10.4994802703
+一千块 10.642581114
+小钱 9.27570483869
+不得开交 13.900677652
+代唐 13.2075304714
+族里 10.9562386728
+小针 11.9547675029
+和栎林 12.8020653633
+话音未落 9.48183704418
+小钟 13.900677652
+小钞 12.8020653633
+跳井自尽 13.900677652
+逸闻趣事 13.900677652
+化学化 12.5143832909
+门德尔 12.8020653633
+豆子 9.49395840471
+却露 13.2075304714
+籼米 11.8212361103
+小革 12.8020653633
+刚过 8.82550383674
+双打比赛 12.5143832909
+依官 11.9547675029
+四十多年 10.3171587135
+足联 13.900677652
+追肥 11.1280889297
+皂化 11.5027823792
+柠檬水 12.2912397395
+打破记录 13.900677652
+光彩夺目 10.8096351986
+光泽度 11.8212361103
+牧羊人 11.598092559
+开庭 9.43476953332
+依安 12.8020653633
+我们 3.39131796699
+看好 6.19902528933
+国舅 10.0088573539
+贸易协定 9.82314020807
+模模糊糊 9.29550746599
+怨尤 13.2075304714
+辐条 11.2616203224
+尼翁河 11.9547675029
+幸存 9.15574552361
+安恬 12.8020653633
+小静 11.4157710022
+空泛 11.4157710022
+合水县 13.900677652
+液化点 13.900677652
+气锅 13.900677652
+刷毛 12.5143832909
+小青 9.48183704418
+千余里 11.1926274509
+泸溪 11.9547675029
+红宝石 9.5186510173
+理财网 12.5143832909
+法耶 12.8020653633
+立世子 12.8020653633
+卡利亚 13.2075304714
+笑容 7.31450599712
+毛和丝 13.900677652
+看天 10.5684731418
+紫白 13.2075304714
+压垮 10.3171587135
+运动病 12.8020653633
+戈纳伊夫 12.5143832909
+计价 8.66956903512
+看头 10.3453295905
+狗儿爷 12.2912397395
+分类程序 13.2075304714
+疑难病 13.900677652
+好几打 13.900677652
+白芥子 13.2075304714
+柠檬汁 10.7226238216
+压型 12.2912397395
+靠左边 12.1089181827
+见惯不惊 13.900677652
+武毅军 12.8020653633
+英国队 13.900677652
+挂机 12.2912397395
+风流倜傥 10.7226238216
+挖掘出 10.4349417492
+计付 11.7034530746
+乱世英雄 12.5143832909
+麻意 12.5143832909
+内含子 13.2075304714
+沧州市 11.0674643079
+武断专横 13.900677652
+相同点 11.598092559
+小韩 10.2630914922
+一千名 11.1926274509
+文体活动 11.8212361103
+爪印 13.2075304714
+马盖麻 13.2075304714
+刘得富 13.900677652
+绕阳河 11.9547675029
+詹大悲 11.9547675029
+内地工业 11.8212361103
+借领 13.2075304714
+白海豚 13.900677652
+这步田地 10.4041700905
+柠檬油 12.8020653633
+大言不惭 10.8561552143
+一千吨 13.2075304714
+阿莫西林 11.9547675029
+凶相毕露 11.7034530746
+白喝 13.2075304714
+白喜 13.900677652
+流通量 10.1164880181
+压坏 11.2616203224
+一言为定 10.2371160058
+压块 13.2075304714
+高拱朝 12.5143832909
+三节课 13.900677652
+安惠 11.4157710022
+莫卜 12.5143832909
+白喉 10.3743171274
+辞工 11.8212361103
+酬对 12.5143832909
+阿列曼 13.2075304714
+幻影 9.40086798165
+沙普利 11.8212361103
+气闸 12.2912397395
+劫后余生 11.0103058941
+继承法 10.8561552143
+涡桨 10.765183436
+游手好闲 10.5684731418
+压在 8.63798746307
+依存 10.3171587135
+当时 4.67584283385
+抹擦 12.5143832909
+一千员 13.2075304714
+气门 9.7898037878
+亿多次 13.900677652
+压场 12.2912397395
+幻彩 12.5143832909
+夏县 10.533381822
+小鞋 12.2912397395
+烧烤店 13.900677652
+商品经济 8.70218062071
+双声道 13.2075304714
+骗入 13.2075304714
+不仁不义 11.3357282945
+十米 10.765183436
+青面獠牙 11.5027823792
+空气 6.32509300042
+十类 11.8212361103
+花白色 11.1280889297
+燕北 12.1089181827
+收摊儿 13.900677652
+另日 12.8020653633
+司马炎 10.4349417492
+四十九万 13.900677652
+循环系统 9.69598503258
+海南州 13.2075304714
+从乾方 13.2075304714
+谢大玉 12.5143832909
+小院 8.73019365694
+利清谷 11.8212361103
+弓马熟 11.9547675029
+特言道 13.2075304714
+尤须 11.8212361103
+徐晃二 13.2075304714
+我俩 9.20019728618
+小陶 13.2075304714
+显示目录 13.900677652
+马德禄 13.2075304714
+结构单元 10.9562386728
+墨玉河 13.2075304714
+小陈 9.36807815882
+安慰 7.14957618304
+独臂人 13.2075304714
+炮群 12.8020653633
+毛约尔 13.2075304714
+阳间 10.8096351986
+药物性 11.598092559
+司马炽 12.5143832909
+瞪住 10.4349417492
+耐磨性能 12.2912397395
+白吃 10.4666904475
+夏鸾翔 13.900677652
+凝神专注 13.2075304714
+严恺 13.2075304714
+压回 13.900677652
+动物医院 13.2075304714
+经手人 11.598092559
+科西加 12.8020653633
+荣禄扎 13.900677652
+正反交 12.8020653633
+缴费卡 13.900677652
+应试教育 10.8096351986
+套耕 13.900677652
+六万块 13.2075304714
+子键 13.900677652
+泛湖 11.9547675029
+陈七师 13.2075304714
+骨灰坛 13.2075304714
+嘉定区 12.1089181827
+晋昌军 13.2075304714
+痦子 11.9547675029
+荣禄执 13.900677652
+单轨铁路 13.900677652
+四十四 10.9049453784
+救护机 12.8020653633
+格斯特 12.5143832909
+四十回 13.2075304714
+李罕 13.2075304714
+小队 8.87023973058
+纪功碑 11.9547675029
+荣禄扶 13.900677652
+马雷斯 13.2075304714
+汉璇翠 12.1089181827
+坍塌 9.02548032877
+缴费单 13.2075304714
+沾亲带故 11.1280889297
+持枪者 11.9547675029
+应届生 12.5143832909
+小雯 11.598092559
+平步登天 12.5143832909
+起行 10.1164880181
+小雪 9.30555780184
+谐语 13.2075304714
+小雨 8.95903522937
+丽水市 11.9547675029
+奸臣 9.28555713513
+查干诺尔 13.900677652
+克地曼 12.8020653633
+恬不为怪 12.8020653633
+小雾 13.900677652
+矿山压力 13.900677652
+何人之手 12.8020653633
+发出臭味 13.2075304714
+疵瑕 13.2075304714
+端碗 11.5027823792
+醉翁之意 13.2075304714
+摸棱 12.2912397395
+于云浮 13.2075304714
+撒沙子 13.900677652
+厉颜厉 13.2075304714
+农奴阶级 12.2912397395
+铅芯 13.2075304714
+没法没天 13.900677652
+季节性 7.73947033028
+高拱明 13.2075304714
+勇武 10.5684731418
+小集 11.5027823792
+小雅 11.0674643079
+指导 6.37396009062
+时间差 10.5684731418
+同宗配合 13.900677652
+攀上去 12.5143832909
+亚洲区 10.0720362555
+泪盈盈 13.2075304714
+计会 12.1089181827
+四五分钟 13.2075304714
+红灵丹 13.900677652
+栋梁之才 12.8020653633
+马钱子 11.8212361103
+彻底消除 11.1926274509
+指定 6.9039961638
+路线斗争 10.4349417492
+一千二百七十二处 13.2075304714
+醇香 11.2616203224
+配色 11.0103058941
+如梦如幻 11.3357282945
+停工待料 13.900677652
+苍苍茫茫 12.1089181827
+子伯禽 11.8212361103
+睡梦之中 12.1089181827
+长围巾 13.900677652
+扈伦 12.8020653633
+中莹然 13.900677652
+我会 7.34106241448
+百衲衣 12.1089181827
+文孝武 12.2912397395
+物理组 13.900677652
+卡尼斯 12.1089181827
+空洞 8.85725253506
+不亦乐乎 10.1630080337
+伊斯兰教 6.98000614773
+乐昌市 13.2075304714
+中华按蚊 12.1089181827
+根源 7.66822963543
+汤端 13.2075304714
+液体动力 13.900677652
+一千三百个 13.2075304714
+乌恰县 12.8020653633
+小饮 13.2075304714
+阳高 11.598092559
+迟滞不前 13.900677652
+里运河 10.0940151622
+玛沁县 12.5143832909
+胡师 12.8020653633
+庞蒂亚 12.1089181827
+小饼 13.2075304714
+良家妇女 10.7226238216
+警卫连 10.3453295905
+福雷 12.2912397395
+阁僚 12.5143832909
+摘编 10.9562386728
+顶极群落 13.900677652
+空拳 11.8212361103
+套车 11.0674643079
+追进来 12.5143832909
+质量观 13.900677652
+华普 10.5684731418
+膳食费 13.2075304714
+金成一 13.900677652
+看坏 12.2912397395
+阴亲 13.2075304714
+洪涝灾害 10.1394775363
+扛进去 13.900677652
+毯子 9.91169360541
+冲撞 8.83808261895
+戈梅兹 13.900677652
+号衣 9.63799777493
+指向 8.0484751722
+校车 11.8212361103
+续随子 13.2075304714
+靠着 8.17709255002
+走红运 13.2075304714
+饶有兴趣 10.5684731418
+亚伟 8.08059472162
+刷新 8.20023407859
+豪华型 9.72629038208
+看场 11.5027823792
+指名 10.2897597393
+赊销 12.1089181827
+姣美 13.2075304714
+视听享受 12.2912397395
+炖鸡 11.5027823792
+白字 11.4157710022
+亚伯 13.2075304714
+白子 11.7034530746
+冯秉铨 13.2075304714
+白孝 12.1089181827
+福隆 12.5143832909
+亚伦 12.5143832909
+迈巴赫 12.5143832909
+王承胤 13.900677652
+隐隐约约 8.83808261895
+酬唱 11.5027823792
+空投 9.65218240993
+气魄 9.10488710638
+讲课 9.61021821083
+波光荡漾 13.900677652
+但彦章 12.8020653633
+嫩竹 12.8020653633
+立楚公子 13.2075304714
+口香糖 10.6818018271
+批得 12.8020653633
+亿万富豪 9.63799777493
+回龙观 12.1089181827
+秘宝 11.7034530746
+普奇 13.2075304714
+白室 12.1089181827
+子伯益 13.2075304714
+真皮沙发 13.900677652
+四十天 12.5143832909
+套进 12.8020653633
+白宫 8.91707103027
+追踪 8.5440913773
+特殊津贴 11.8212361103
+猛地 7.33259974056
+阳驿 12.5143832909
+胜地 9.04086524761
+空手 9.93038573842
+四十多 10.4994802703
+亚信 12.5143832909
+西敏寺 13.900677652
+情哥哥 12.8020653633
+白宇 13.900677652
+翻译成 10.3171587135
+十爷 11.8212361103
+数十万路 13.2075304714
+魏复盛 13.2075304714
+人工干预 12.5143832909
+团市委 11.8212361103
+抱得 11.5027823792
+就业机会 9.24671730182
+胜在 11.9547675029
+四度 10.7226238216
+倍增器 12.2912397395
+保暖 9.12155415886
+福利型 13.900677652
+十片 13.900677652
+轮胎气压 12.1089181827
+安源 10.4666904475
+履带 8.44963919841
+八十万镑 13.2075304714
+阳维脉 11.9547675029
+亮片 11.598092559
+潘安再世 13.900677652
+空房 10.533381822
+崖头 12.1089181827
+重操旧业 10.8561552143
+其父 8.29487558568
+人民性 11.0103058941
+一悲一喜 13.900677652
+额手 13.2075304714
+开大 11.2616203224
+国家体委 9.89334446674
+普天 11.4157710022
+湖面 7.91674137129
+辞去 8.07173203437
+数行 11.2616203224
+应运而起 13.900677652
+王师北 12.2912397395
+计算机网络 9.98865464655
+安溪 10.4349417492
+葵花籽 10.765183436
+投弃 13.2075304714
+珙县 12.5143832909
+沙普尔 12.2912397395
+绕指柔 13.900677652
+空成 13.900677652
+分布式 10.3743171274
+财运亨通 13.2075304714
+当成 7.63347710343
+放臭屁 13.900677652
+秦景教 11.8212361103
+侥幸心理 10.4994802703
+坐卧不安 10.642581114
+小项 12.2912397395
+石沟 12.1089181827
+通老鹳 13.2075304714
+叶象科 13.2075304714
+福音 9.54396882529
+坐卧不宁 11.598092559
+单靠着 13.900677652
+以降 10.4349417492
+王府井 9.30555780184
+乘专机 12.2912397395
+亚书 13.2075304714
+锐增 13.2075304714
+天下 5.98059445292
+费思量 11.1280889297
+穷奢极侈 12.1089181827
+死要 12.2912397395
+一百五十套 13.2075304714
+热力学温度 10.765183436
+一个四十多岁 11.0674643079
+军需 8.88339781516
+博陵王 13.2075304714
+扬汤止沸 12.8020653633
+动物纤维 12.8020653633
+午餐会 10.8096351986
+七处 11.1926274509
+四十声 13.900677652
+打圆场 10.1164880181
+追述 10.3743171274
+宇野宗佑 13.2075304714
+集料 12.5143832909
+戎务 12.1089181827
+明粟 12.8020653633
+造币厂 10.9049453784
+根性 12.1089181827
+忘情 9.71102290995
+亚东 11.0103058941
+滚水 11.0674643079
+冷二郎 13.2075304714
+三十四年 9.89334446674
+肖特 12.8020653633
+保有 8.9308643524
+视为儿戏 13.2075304714
+直辖市 8.36334338496
+压境 10.0720362555
+死角 9.75754292558
+巩乃斯河 12.8020653633
+反钓鱼 13.900677652
+荀悦 11.1926274509
+化工网 12.5143832909
+汉志和 11.9547675029
+氨化 12.8020653633
+蟹黄 11.8212361103
+追进 10.5684731418
+中国音乐家协会 10.2897597393
+褶子 11.5027823792
+太紧张 10.5684731418
+追过 11.5027823792
+辞别 9.27570483869
+青龙寺 11.7034530746
+将门 9.77354326693
+保本 8.80081122415
+幻像 13.2075304714
+复数 9.38981814546
+活到老 12.5143832909
+后患无穷 10.8561552143
+委陵菜 11.7034530746
+总额近 11.1280889297
+忘怀 10.533381822
+端的 8.04274449749
+塞雷尔 12.2912397395
+贴服 12.8020653633
+贴有 11.4157710022
+村山富市 12.2912397395
+王盘山 12.1089181827
+想将来 12.8020653633
+所有者 7.35532799164
+主动仗 12.5143832909
+谈论 7.84858848305
+小风 11.2616203224
+足迹 8.66956903512
+角闪石 10.2897597393
+没用过 10.9562386728
+配调 13.900677652
+有权有势 10.5684731418
+西谚 12.8020653633
+张鲁之 13.2075304714
+忘性 11.9547675029
+压塌 10.9049453784
+小食 11.4157710022
+小飞 12.8020653633
+压塑 13.2075304714
+南青龙 13.900677652
+荀恺 12.8020653633
+卢布林 11.4157710022
+四平 10.2117981979
+亚于 13.2075304714
+岳城水库 12.8020653633
+安澜 13.900677652
+谈话 7.0389663115
+王胡立 13.2075304714
+十五种 13.2075304714
+埃尔默 11.5027823792
+空挡 10.642581114
+抓捕归案 12.8020653633
+领导小组 8.71329184614
+澳大利 12.8020653633
+顶得住 10.9562386728
+三角肌 13.2075304714
+选上来 12.5143832909
+蒋管区 12.8020653633
+端盖 13.2075304714
+白嫩 10.2630914922
+老虎机 11.9547675029
+化学式 9.75754292558
+尘螨 12.1089181827
+忘恩 11.4157710022
+护舒宝 12.8020653633
+纪律严明 10.0088573539
+压力锅 12.8020653633
+爪尖 12.8020653633
+胡贝尔 12.8020653633
+谈说 12.8020653633
+异国风光 13.900677652
+巴解组织 11.0674643079
+小额 9.16447920358
+水右坝 12.2912397395
+近情 13.900677652
+号角 9.55687223012
+端相 12.8020653633
+花土沟 12.1089181827
+婚筵 13.900677652
+意见函 13.900677652
+端直 10.5684731418
+仲让 13.2075304714
+白头 9.91169360541
+忘掉 9.05649056552
+杰出人才 11.5027823792
+安江 13.2075304714
+根据 4.4026052088
+如许 11.1926274509
+鞍马劳顿 11.1926274509
+安汉 12.5143832909
+阿穆尔河 10.9049453784
+三差两错 13.900677652
+萧韩家奴 12.1089181827
+福银 13.900677652
+指挥系统 9.65218240993
+白天 7.07957017972
+空想 9.29550746599
+小魏 9.75754292558
+火焰山 10.0940151622
+反贪局 10.2117981979
+泌尿系统 9.63799777493
+遮路 13.900677652
+泰梅尔 11.7034530746
+白夜 8.60737282725
+霍普菲 13.2075304714
+客座率 11.8212361103
+然而 5.40880226854
+曲三 13.900677652
+套起 12.8020653633
+亮点 7.64877376881
+东北方 10.4349417492
+三十多里 11.4157710022
+判断是非 11.8212361103
+近指 13.900677652
+火星子 11.7034530746
+十点 9.74179456862
+继承性 10.8561552143
+炖鱼 12.8020653633
+心导管 11.598092559
+怀博纳 12.8020653633
+普安 11.8212361103
+超党派 12.5143832909
+袁宝儿 13.900677652
+平原地带 10.642581114
+海洋气候 12.1089181827
+安民 8.98802276624
+普宁 11.4157710022
+督造 10.5684731418
+化工类 11.0674643079
+识羞 13.2075304714
+比西军 13.2075304714
+普定 12.2912397395
+小鬼 8.80081122415
+各段落 13.900677652
+安氏 11.598092559
+人民报 10.9049453784
+十一个 9.91169360541
+安永 11.0674643079
+郑和宝 12.1089181827
+磷脂酸 13.900677652
+一个一千多年 13.2075304714
+温湿度 12.8020653633
+套购 11.9547675029
+铮铮铁骨 13.2075304714
+车木匠 11.8212361103
+小鬟 13.900677652
+张老师 9.84023464143
+郝大 12.5143832909
+大发作 12.5143832909
+西安门 12.1089181827
+侧旁 11.3357282945
+压雪求油 13.900677652
+结构合理 10.2117981979
+于殷周 13.2075304714
+压实 10.533381822
+压宝 13.900677652
+使不得 9.12999302751
+贺吉 12.1089181827
+指回 12.8020653633
+家杖子 12.8020653633
+杂务缠身 13.900677652
+杀富济贫 12.2912397395
+仲裁 8.56313957227
+神情开朗 13.2075304714
+隋时官 13.2075304714
+大谬不然 12.2912397395
+天义 11.598092559
+牛河梁 11.5027823792
+幻化 10.5684731418
+套路 9.65218240993
+安泰 9.33632946051
+豆腐脑 11.9547675029
+糊涂人 10.8096351986
+赵子岳 13.2075304714
+坦言 8.42421410004
+桑特 12.8020653633
+贷金 12.5143832909
+阿尔贝蒂 12.2912397395
+纵火 9.58318953844
+酸枣 9.85762638414
+安波 12.5143832909
+气馁 10.0720362555
+五端 13.2075304714
+安沛 13.900677652
+十一二 13.900677652
+核武 10.1394775363
+宇文阁学 11.7034530746
+空性 11.5027823792
+化工系 12.1089181827
+卑污 11.5027823792
+思恭 11.598092559
+麻涧 10.3453295905
+科教兴市 12.8020653633
+醒狮 11.598092559
+十一五 8.83808261895
+箔条 10.9562386728
+符合规定 9.75754292558
+木盘托 13.900677652
+德沙尔 12.5143832909
+最高潮 10.765183436
+亮灯 11.1926274509
+万无一失 9.05649056552
+剧增 9.5062284973
+张秀眉 11.7034530746
+醋意 10.3743171274
+高棉语 12.2912397395
+十多遍 13.2075304714
+李泽楷 10.8561552143
+呈交 10.9562386728
+一百四十四 12.5143832909
+分红险 12.1089181827
+脑瘤 12.2912397395
+小马 8.94485059437
+拂拂 11.9547675029
+富贵花 12.8020653633
+三十七个 13.2075304714
+高孝 12.5143832909
+光泽县 12.2912397395
+两百人 11.4157710022
+紧急召开 11.9547675029
+白堤 11.598092559
+摸摸 8.66423568915
+勇气 7.68008748188
+武信侯 13.900677652
+增进友谊 11.9547675029
+安济 13.2075304714
+刘兰芳 13.900677652
+挂怀 11.5027823792
+发生额 11.9547675029
+秘书长 7.2673592187
+死讯 10.0505300503
+互相间 11.1926274509
+残忍度 11.7034530746
+国家中医药管理局 11.8212361103
+工艺员 12.2912397395
+形踪 13.900677652
+拂拭 11.2616203224
+三十七丈 13.2075304714
+麻江 13.900677652
+中共中央政法委员会 13.2075304714
+季节河 12.5143832909
+刁明生 13.2075304714
+刘兰芝 13.900677652
+王老太 11.1926274509
+缓缓的 11.2616203224
+麻醉科 13.2075304714
+宋大明 12.2912397395
+耀眼夺目 11.598092559
+侍闯 13.900677652
+袖长 12.5143832909
+安洛 13.900677652
+错配 11.1280889297
+两百份 13.900677652
+韵诗 12.8020653633
+欧阳谦叔 13.900677652
+轻压 12.2912397395
+安洋 13.900677652
+奸贼 10.4349417492
+压电性 12.5143832909
+坐骨 11.3357282945
+安全法 9.43476953332
+白填 12.8020653633
+玉康级 12.5143832909
+朱温和 12.1089181827
+坐骑 9.35738286971
+九百二十二万余两 13.2075304714
+广五州 12.8020653633
+坦诚 9.6811699468
+看后 9.94943393339
+泰山移 13.900677652
+韵语 11.1280889297
+王盘庚 13.2075304714
+一百四十块 13.2075304714
+王师傅 10.8561552143
+死词 13.900677652
+指在 9.56994431169
+集材 13.900677652
+伯克利加州大学 13.2075304714
+编档 13.900677652
+简支梁桥 13.900677652
+自爱自重 13.900677652
+陈树生 11.1280889297
+台湾省 8.03420959504
+小狼 12.2912397395
+叠床架屋 12.8020653633
+依样画葫芦 11.9547675029
+一千处 13.2075304714
+集束 10.5684731418
+一千多 9.34680076038
+两百两 12.8020653633
+出头鸟 13.2075304714
+集权 9.69598503258
+玄德拜 13.2075304714
+刘家峡 10.8096351986
+忘我 10.3171587135
+白墨 13.900677652
+男同学 10.1630080337
+刘高倬 13.900677652
+格斯纳 13.2075304714
+一千天 13.900677652
+杜布雷 13.2075304714
+隍城 12.2912397395
+白墙 11.5027823792
+婚礼 7.85567233794
+两百万 11.5027823792
+小高 10.9562386728
+运算量 13.900677652
+落花无言 13.900677652
+工艺品 8.08356649201
+一千头 12.8020653633
+潮起 10.765183436
+执法权 12.1089181827
+追赶 7.46934657004
+热电子 11.4157710022
+试用品 13.900677652
+麻油 10.9049453784
+模块接口 13.900677652
+染印法 13.900677652
+非断不可 13.2075304714
+三家子 13.2075304714
+追赠 10.4041700905
+心肠软 12.8020653633
+错金 11.1280889297
+如霞 11.8212361103
+小坚果 10.642581114
+缓交 12.5143832909
+颜鲁公 12.2912397395
+黄平府 12.8020653633
+收进 10.4349417492
+足趾 11.0674643079
+足足 8.87023973058
+纵然 7.44547908864
+卫文公 12.8020653633
+牛刀 11.4157710022
+白壁 13.2075304714
+追赃 10.1630080337
+生产基金 12.1089181827
+张文明 10.0505300503
+神经褶 12.2912397395
+第一拖拉机 12.8020653633
+衙府 13.900677652
+违法者 10.9562386728
+眼馋肚饱 13.2075304714
+身着 8.42003872863
+朱唇 10.765183436
+桃花人面 12.8020653633
+煤厂 13.900677652
+古交 13.2075304714
+笑出 10.9049453784
+压差 11.3357282945
+邓小平 8.02014466558
+古人 7.46934657004
+附睾炎 11.4157710022
+互相切磋 12.8020653633
+断头率 13.900677652
+近支 11.2616203224
+辫儿 12.5143832909
+新闻资讯 13.2075304714
+真人 8.6803218269
+幸免 9.53122979951
+婚约 10.642581114
+一千度 13.900677652
+郁而激 13.900677652
+踏着 8.80081122415
+西工区 12.5143832909
+纵目 11.1926274509
+古亚 12.8020653633
+陌路 11.2616203224
+张天锡 12.5143832909
+古井 9.89334446674
+四部委 12.1089181827
+婚纱 9.98865464655
+失声痛哭 10.0720362555
+姚崇 10.4349417492
+紧肤水 13.2075304714
+亲善访问 13.2075304714
+真仙 10.604840786
+古代 5.60988330459
+工具包 11.598092559
+白彦 13.900677652
+亲子活动 13.900677652
+正当竞争 10.604840786
+督阵 11.0103058941
+中国经贸 13.2075304714
+背逆 13.900677652
+保户 13.2075304714
+古今 8.05135287203
+走走看 13.900677652
+剪刀 8.64318227995
+空暇 12.8020653633
+陈道明 11.3357282945
+忘旧 13.900677652
+不足介意 13.900677652
+中南美 12.2912397395
+亮相 7.68606955355
+好景不常 12.8020653633
+十五米 12.1089181827
+配角 10.0940151622
+依凭 11.8212361103
+武警总部 13.900677652
+萨杜尔 12.8020653633
+猛可 11.2616203224
+郝海东 13.2075304714
+守备队 11.5027823792
+真丝 11.3357282945
+校订 9.87532596124
+端王 10.4994802703
+嫩绿 10.3743171274
+仵作 11.3357282945
+强化训练 12.5143832909
+销掉 12.5143832909
+校训 12.1089181827
+丈二和尚摸不着头脑 11.1280889297
+看台 10.2117981979
+空智 13.900677652
+供事 12.5143832909
+阁员 10.5684731418
+套话 10.3453295905
+杜莉莉 12.1089181827
+韵调 12.8020653633
+四十万两 11.0674643079
+白得 10.0294766411
+真主 8.66423568915
+真为 10.6818018271
+古丈 11.7034530746
+戈斯林 13.900677652
+供人 9.93038573842
+套语 12.2912397395
+安立甘 11.1280889297
+导热性 10.1871055853
+等等等等 10.2897597393
+真中 12.1089181827
+三百五十 11.0674643079
+真个 7.8184587416
+开始 3.84502710804
+三八枪 13.2075304714
+从乾清 10.4994802703
+宅急送 13.2075304714
+舒张压 11.0674643079
+白念 13.900677652
+叶菜类 12.1089181827
+古书 8.98069672615
+宋清远 13.2075304714
+外宽内明 13.900677652
+马车夫 11.4157710022
+深潜 11.1926274509
+婷婷 10.0505300503
+龈下牙石 13.900677652
+近日 5.88106485758
+真义 12.1089181827
+全南 12.8020653633
+副省长 8.6966709649
+金宣宗 10.8561552143
+嫩红 12.5143832909
+普通高校 10.4994802703
+祖公公 13.2075304714
+无数里 12.2912397395
+思情 13.900677652
+空明 12.5143832909
+依其 9.61021821083
+依兰 10.533381822
+涡扇 10.3743171274
+古义 11.1280889297
+白忙 11.9547675029
+阿姆斯壮 13.2075304714
+保护 5.39900427222
+铺展开来 12.8020653633
+粟芒蝇 13.900677652
+摸排 12.1089181827
+真书 11.8212361103
+孤零零 9.44633035572
+衣不重帛 12.8020653633
+箪食壶浆 11.9547675029
+一千年 10.4666904475
+十百 13.900677652
+皮杜鲁 13.900677652
+贫铀 12.5143832909
+聚氯乙烯 9.63799777493
+瓦赤喇 12.2912397395
+府南 13.2075304714
+猛力 9.74179456862
+经营项目 12.2912397395
+胥江 12.5143832909
+寂若无人 13.900677652
+追认 10.9049453784
+白带 10.0940151622
+依傍 10.6818018271
+微风吹拂 12.8020653633
+追讨 10.9049453784
+挤走 11.2616203224
+第七种 13.2075304714
+猛劲 12.2912397395
+布鲁西洛夫 13.2075304714
+学院奖 11.9547675029
+白帝 11.598092559
+胜势 13.2075304714
+西江月 10.8561552143
+白帛 11.3357282945
+斩首 8.35160156708
+石之声 13.900677652
+四十岁 9.48183704418
+白帆 7.48068272383
+赛拉图 12.2912397395
+白布 8.7245279194
+四盒 13.900677652
+常盘贵子 13.900677652
+张彭春 12.8020653633
+笑傲 11.4157710022
+见上帝 12.2912397395
+空枪 11.0674643079
+白干 10.6818018271
+供佛 11.4157710022
+最高检 11.7034530746
+娶媳 12.5143832909
+看到 4.86480972185
+保持 4.85615576469
+万多千瓦 12.2912397395
+化学家 8.1386262692
+槁木死灰 13.2075304714
+死路 10.6818018271
+意味深长 9.44633035572
+扭亏增盈 12.2912397395
+吃粮 10.9049453784
+配装 11.4157710022
+石门山 11.8212361103
+压岁 13.900677652
+思想 5.58756094916
+安身之处 11.5027823792
+黏合剂 12.8020653633
+三回五次 11.598092559
+令亲 12.2912397395
+埃尔马 13.2075304714
+福利制 13.900677652
+赐予 9.59661255877
+谋女郎 12.5143832909
+追诉 11.2616203224
+石茂良 13.2075304714
+信仰者 11.2616203224
+氨基 9.30555780184
+史李柏 12.5143832909
+真会 9.23723855786
+山书会 13.2075304714
+古伦 13.900677652
+荤粥 12.5143832909
+跟前儿 12.8020653633
+古传 12.5143832909
+黔西南布依族苗族自治州 11.4157710022
+竖眉瞪眼 13.900677652
+白度 11.598092559
+死账 13.900677652
+萨摩藩 11.5027823792
+紫光阁 13.900677652
+革命文学 11.5027823792
+幻听 11.1280889297
+白底 10.533381822
+奸诈 10.0088573539
+真似 11.0674643079
+黄来儿 11.7034530746
+缨络 11.2616203224
+国内安全 11.1926274509
+猛刺 11.7034530746
+跳回 13.900677652
+搬迁 8.46695564842
+白庙 11.9547675029
+指出 5.0814557944
+胜券 12.1089181827
+空权 13.2075304714
+肯纳 12.1089181827
+白庄 13.900677652
+无义之 11.7034530746
+亮眼 10.4349417492
+真伪 9.08039608637
+黏合力 13.900677652
+山绵羊 12.5143832909
+空气稀薄 10.9562386728
+往返机票 12.8020653633
+胜利 6.1406369711
+萨塞克斯 12.5143832909
+皮吉特 12.8020653633
+配衬 13.900677652
+临床表现 7.96314144689
+奸计 10.3171587135
+劝学篇 12.1089181827
+诸如 7.6468488404
+小鲵 11.7034530746
+依偎 9.65218240993
+普尔 8.0484751722
+谈过 8.9102450652
+真使 11.5027823792
+石神奴 13.2075304714
+识破 9.37888907493
+空有 10.4994802703
+安殿 12.1089181827
+躁动 10.0505300503
+仲达 10.4041700905
+明人不做暗事 11.7034530746
+吞咽困难 10.9049453784
+救命恩人 10.0088573539
+得益 9.98865464655
+赐与 9.98865464655
+古体 11.0103058941
+信号线 12.1089181827
+尹升厅 12.8020653633
+佛劳伦斯 13.900677652
+翻入 11.9547675029
+魏巍直 13.2075304714
+黄罗伞 11.9547675029
+说漏嘴 12.5143832909
+不识局面 13.900677652
+小齿 11.1280889297
+暑天 11.4157710022
+谈谈 7.95003509939
+沫子 12.1089181827
+如期举行 11.3357282945
+根杰 13.900677652
+指前 11.2616203224
+茅津渡 12.1089181827
+返朴归真 12.8020653633
+固有特征 12.8020653633
+医科 10.9562386728
+普快 13.2075304714
+楼体 12.5143832909
+筛锣擂鼓 13.900677652
+近期 5.24407040478
+太仓 8.88339781516
+销货款 13.900677652
+集拢 12.8020653633
+近有 11.1926274509
+近月 10.604840786
+保息 12.1089181827
+筹备工作 9.55687223012
+安桥 13.900677652
+冷恭 12.8020653633
+打打杀杀 11.598092559
+小齐 11.5027823792
+根本 5.5301300409
+金士珍 11.5027823792
+湖里 9.19114745066
+小鼠 10.4349417492
+满月酒 12.2912397395
+根机 13.900677652
+近来 7.17684521115
+豆包 11.3357282945
+咸丰帝 10.1871055853
+猛减 13.900677652
+邮袋 13.2075304714
+小半袋 13.2075304714
+指到 11.1280889297
+猛击 10.4994802703
+聚合酶 12.1089181827
+胜出 9.55687223012
+刷掉 12.5143832909
+青龙峡 13.2075304714
+鼓捶 13.900677652
+压得 8.96620371885
+深泽县 13.900677652
+髫年 12.8020653633
+煎成 11.7034530746
+小鼓 11.0103058941
+动眼神经 12.5143832909
+辽太祖 10.604840786
+安棚 12.2912397395
+应时盛 12.2912397395
+苦不堪言 10.2117981979
+物价部门 10.8561552143
+根柢 11.3357282945
+安提柯 12.8020653633
+四十张 12.8020653633
+胡琏 13.2075304714
+秉公执法 12.1089181827
+看出 6.47591589015
+能成仙 13.2075304714
+长期斗争 10.5684731418
+芦盐 12.2912397395
+侍禁庐 12.8020653633
+尤里 10.6818018271
+看准 9.15574552361
+忘本 11.0674643079
+数万里 13.2075304714
+凹陷型 13.900677652
+爪子 9.19114745066
+男人味 12.2912397395
+各尽其妙 13.900677652
+民穷财尽 11.7034530746
+进社区 11.7034530746
+郑简公 12.8020653633
+安森 13.2075304714
+微带线 12.8020653633
+太久 8.44963919841
+中书君 13.900677652
+汉乐府 11.0674643079
+尤金 10.9049453784
+集成 8.19689517732
+台湾版 12.5143832909
+白己 11.3357282945
+挤身 13.2075304714
+太为 12.2912397395
+机器设备 9.77354326693
+战略物资 10.5684731418
+旅顺 9.38981814546
+压弯 11.1926274509
+李娘娘 10.7226238216
+干群关系 10.4994802703
+手夹 13.900677652
+阿拜 12.2912397395
+红军团 13.900677652
+地精 13.900677652
+太严 10.9049453784
+醒目 9.00283785202
+陆承业 11.2616203224
+非礼勿视 11.4157710022
+百炼成钢 11.598092559
+被统治者 10.4041700905
+魏巍盘 12.2912397395
+校规 13.2075304714
+盘根问底 13.900677652
+桃源路 12.8020653633
+证券期货 9.5062284973
+依卿 12.1089181827
+浅海养殖 12.1089181827
+太丑 11.9547675029
+猛兽 9.32596667347
+尘肺 10.8561552143
+贴息 9.4233408375
+同气相求 12.1089181827
+小龙 9.94943393339
+卢维杜 13.2075304714
+战略重点 10.2371160058
+青龙山 11.0103058941
+指南 8.46259834305
+带进 9.37888907493
+砍过来 13.2075304714
+挤车 12.2912397395
+挤轧 13.900677652
+打得火热 10.533381822
+空无 12.2912397395
+两万多两 13.2075304714
+小萝卜 13.2075304714
+辞呈 10.4349417492
+往复泵 12.8020653633
+以避 10.4666904475
+妻儿老少 13.900677652
+压延 10.2371160058
+冰洲石 10.6818018271
+加总 11.4157710022
+蔬果 10.4349417492
+空旷 9.19114745066
+纰漏 10.642581114
+小鹰 11.8212361103
+中国青年报 9.75754292558
+太保 7.76511276089
+假途灭虢 13.2075304714
+满拧 12.8020653633
+指印 10.3453295905
+潮解 12.1089181827
+传统友谊 12.1089181827
+刷拉 12.2912397395
+男同志 11.1280889297
+门面房 10.8561552143
+举止轻浮 13.900677652
+搞臭 11.4157710022
+看做 9.01032852375
+屏声静气 11.8212361103
+格兰格 13.900677652
+蠢拙 13.900677652
+福金 11.2616203224
+怕老婆 11.1280889297
+指北 11.9547675029
+小鸭 12.5143832909
+白山 10.3171587135
+阿拉 8.99540287354
+可读性 11.1926274509
+牛劲 12.8020653633
+带过 10.765183436
+楼主 10.6818018271
+小鸡 10.0088573539
+美军官兵 12.8020653633
+埃拉 10.4349417492
+空方 9.5186510173
+小黄瓜 12.5143832909
+坦迪 13.900677652
+振武学社 12.2912397395
+婚介网 13.2075304714
+谈资 10.7226238216
+中国书画 11.7034530746
+张辽引 11.8212361103
+埃尔顿 12.5143832909
+谈起 8.38322475551
+普度 11.3357282945
+撤销职务 11.8212361103
+小鸟 8.94485059437
+费歇尔 10.9562386728
+安委会 12.1089181827
+羽毛丰满 11.8212361103
+活字印刷术 11.1926274509
+上证指数 6.90125518447
+楼上 7.56208357377
+楼下 8.03704647638
+白屋 12.5143832909
+顾臣 13.2075304714
+楼价 8.83808261895
+套装 10.2630914922
+挤迫 12.8020653633
+套裁 13.2075304714
+须根 10.533381822
+已是 9.55687223012
+袖里 11.1926274509
+机密文件 11.598092559
+压平 11.3357282945
+部品 11.7034530746
+幸勿 11.1280889297
+笑剧 11.3357282945
+拂晓 9.63799777493
+祖承训 12.8020653633
+足见 9.00283785202
+白岩 11.7034530746
+套裙 12.1089181827
+小黎 11.1280889297
+互通情报 12.8020653633
+造纸用 12.1089181827
+伊纳爵 12.8020653633
+挤过 11.9547675029
+小黄 10.642581114
+抢白 10.1630080337
+负面影响 7.85804481829
+气象观测 9.98865464655
+太低 8.9308643524
+十甲 12.5143832909
+炮眼 11.2616203224
+挤进 9.65218240993
+端点 10.7226238216
+炕头 9.5186510173
+万寿门 12.5143832909
+化学奖 11.9547675029
+第二阶段 8.43261751084
+高守义 11.7034530746
+小黑 10.4994802703
+清宁宫 10.2630914922
+压带 13.2075304714
+四十年 8.75901409547
+杨对陈 13.2075304714
+小麦 6.67811163315
+套袋 13.2075304714
+庾楷 13.2075304714
+套袖 11.5027823792
+空政 12.8020653633
+上市公司 5.30652341942
+熟虑 12.1089181827
+四面出击 12.8020653633
+专业对口 12.2912397395
+额敏 11.2616203224
+悍匪 13.2075304714
+指压 11.1926274509
+阉掉 12.8020653633
+拉包尔 12.8020653633
+性行 13.2075304714
+额数 11.7034530746
+太会 12.5143832909
+楼云 12.8020653633
+饮酒作乐 10.9049453784
+基本工资 12.2912397395
+十番 11.8212361103
+青尼罗河 11.8212361103
+蕴积 13.900677652
+国何益 13.2075304714
+酬劳 10.6818018271
+以暴易暴 13.2075304714
+壁孔 12.8020653633
+一千把 13.2075304714
+摸彩 13.2075304714
+卡丽娜 13.900677652
+向右看 13.2075304714
+掌握者 12.8020653633
+不问 8.07763175649
+骋目 13.900677652
+太热 10.642581114
+谢方立 11.9547675029
+豆浆 9.35738286971
+共命运 11.4157710022
+太烦 12.8020653633
+霜降 11.0103058941
+白挨 13.2075304714
+人口总数 10.3171587135
+陈树人 11.7034530746
+保平 13.900677652
+刘家村 13.900677652
+船舵 12.8020653633
+都哄然 12.2912397395
+罗敷夸 13.900677652
+李彩凤 12.2912397395
+称功颂德 13.2075304714
+东郭先生 11.8212361103
+透镜 9.14708746087
+得意忘形 10.3453295905
+近处 8.34771806705
+雌性花 13.900677652
+荞麦 9.03314320152
+夏侯玄 11.5027823792
+消暑 10.8096351986
+魏自道 12.8020653633
+曹洪领 12.8020653633
+惝恍迷离 13.2075304714
+触须 10.4041700905
+包装盒 11.3357282945
+麦田 9.66657114738
+白捡 11.8212361103
+撬不开 13.2075304714
+隔声门 13.900677652
+安溪县 12.1089181827
+黑茫茫 11.2616203224
+无源之水 11.9547675029
+三等奖 10.1630080337
+一方水土养一方人 12.2912397395
+车水马龙 10.4041700905
+四海之内 11.5027823792
+叶清 10.4349417492
+看漏 13.900677652
+摸弄 13.900677652
+灌醉 10.9049453784
+太炎 12.2912397395
+波谷 11.4157710022
+讽刺作品 13.900677652
+降低利率 11.5027823792
+莅场 13.900677652
+剪取 12.8020653633
+硬件资源 13.900677652
+张永棋 13.2075304714
+销往 9.19114745066
+加热式 13.2075304714
+叙词 12.8020653633
+里料 13.900677652
+刑事追究 12.2912397395
+依洛 13.900677652
+剪发 10.765183436
+金平苗族瑶族傣族自治县 11.9547675029
+高新区 9.4233408375
+型基金 6.50127956864
+叙话 9.98865464655
+销得 12.8020653633
+石鸣琴 13.900677652
+厦门 7.76079309975
+不长 8.31342899358
+鬼故事 11.9547675029
+可骑 12.8020653633
+狂歌醉舞 13.900677652
+楼燕 12.5143832909
+安国 9.69598503258
+供状 11.0674643079
+安图 12.2912397395
+轩哥 11.598092559
+索斯纳 13.900677652
+敲牛宰马 13.900677652
+真爱 10.0940151622
+顺应时代 12.1089181827
+觐见 9.45802639549
+灌酒 12.5143832909
+挖掘机 9.75754292558
+圣餐 10.765183436
+霜雪 10.1394775363
+叙说 9.5186510173
+听力计 13.900677652
+保底 10.8561552143
+守正不移 13.900677652
+早稻田大学 10.9562386728
+美联社 9.80633308975
+集尘 13.2075304714
+刘信 12.5143832909
+玄自广 13.2075304714
+电脑培训 13.2075304714
+麦饭 13.2075304714
+神行法 11.0103058941
+伙食 9.44633035572
+古特 12.8020653633
+司马相如 10.4349417492
+刘永福 11.3357282945
+公司老总 10.4994802703
+粉嘟嘟 13.2075304714
+保康 11.4157710022
+夹塞儿 12.8020653633
+防脱发 13.900677652
+引逗 11.1926274509
+不锈 10.2630914922
+涉外经济 10.5684731418
+自斟自酌 13.2075304714
+邱公公 10.0505300503
+刺青 12.5143832909
+缆车 11.0674643079
+现实存在 11.0674643079
+白描 10.0505300503
+不错 6.1882338177
+摸得 11.1280889297
+带电粒子 9.29550746599
+魏三公 12.8020653633
+端下 13.900677652
+端上 10.1164880181
+古玩 8.83177344976
+安坐 11.4157710022
+仙人指路 12.2912397395
+次第 9.30555780184
+额定 10.2630914922
+豆汁 10.9049453784
+古玺 12.2912397395
+翻译家 9.74179456862
+真玉 13.900677652
+空寻 13.2075304714
+真率 11.8212361103
+宝和珍 13.2075304714
+牵动人心 12.2912397395
+承租方 12.2912397395
+易勿真 13.2075304714
+静态平衡 13.900677652
+陈鲁豫 13.900677652
+玄谈 12.5143832909
+古玉 9.84023464143
+普惠 9.77354326693
+压惊 10.2630914922
+有价无市 10.642581114
+对骂 11.1926274509
+湘西土家族苗族自治州 10.9562386728
+空寂 10.3743171274
+逻辑图 13.2075304714
+山高水低 11.8212361103
+摩尔多瓦共和国 13.2075304714
+艾山 12.5143832909
+翻译官 10.8096351986
+安坦 13.2075304714
+依法 7.0993946175
+古班 12.5143832909
+癞疮 12.8020653633
+健全制度 13.900677652
+不像样 11.2616203224
+空客 10.9049453784
+私人性 13.900677652
+暖暖和和 12.1089181827
+吴太后 13.900677652
+白扯 13.900677652
+金光灿灿 11.598092559
+医学美容 12.5143832909
+贴心 9.5062284973
+普及面 12.5143832909
+山阴道上 13.900677652
+霜露 12.1089181827
+无核武器 12.2912397395
+看清 7.76945116249
+橙皮 12.2912397395
+指派 9.05649056552
+荐举 10.0720362555
+安在 6.4174332359
+灵圣 13.2075304714
+阿列克 13.2075304714
+脱离险境 11.5027823792
+空宗 12.2912397395
+白手 11.3357282945
+统计师 12.2912397395
+挖上 13.2075304714
+矫形器 13.900677652
+不早不晚 11.7034530746
+卡加 12.8020653633
+佯输诈败 11.8212361103
+杨椒山 13.2075304714
+丁至帝 13.900677652
+优雅 8.64318227995
+楼烦 10.2897597393
+麻团 12.5143832909
+贝纳特 13.2075304714
+亚盛 10.7226238216
+土包子 11.598092559
+勤奋学习 11.9547675029
+奥登堡 13.2075304714
+面肥 13.900677652
+安培 9.62401153296
+双双折 13.900677652
+亚目 8.77077893705
+安基 11.8212361103
+空气囊 12.8020653633
+刷屏 13.900677652
+滴虫 11.5027823792
+梁赤民 13.2075304714
+窄巴巴 13.900677652
+空子 9.69598503258
+阁楼 9.34680076038
+可执行性 12.5143832909
+后进村 13.2075304714
+宣太后 12.8020653633
+程序实施 13.2075304714
+赐爵 10.7226238216
+计票 11.598092559
+江中沙 12.5143832909
+倍低音 13.2075304714
+赵金 13.900677652
+我社 11.598092559
+安全软件 12.2912397395
+平常 7.30763311783
+信任别人 13.900677652
+赵国都 11.8212361103
+胯档 13.900677652
+依汉 13.2075304714
+落荒而走 11.2616203224
+指涉 13.900677652
+穷山沟 13.2075304714
+书生之见 11.4157710022
+保德 11.3357282945
+笑气 12.2912397395
+豆油 8.16733637508
+豪华游 13.900677652
+通心粉 11.4157710022
+不明不暗 13.900677652
+时间段 9.01032852375
+龙骨水车 13.2075304714
+司马懿知 13.2075304714
+白衬衣 11.0674643079
+傲睨一世 13.900677652
+舾装 13.2075304714
+自变量 10.4994802703
+摸底 10.0940151622
+古炮 12.8020653633
+公格尔山 12.1089181827
+验证码 10.8096351986
+美西林 13.900677652
+按压 9.56994431169
+财产目录 13.900677652
+殷商本 13.2075304714
+荀寅 13.2075304714
+承佳惠 13.2075304714
+岂知 9.48183704418
+赠与者 13.900677652
+不韪 12.2912397395
+打造出 10.1394775363
+合二而一 12.1089181827
+昔为 12.1089181827
+外汇业务 11.0674643079
+皮笑肉不笑 11.1280889297
+太狠 10.3743171274
+空壳 10.0294766411
+格里姆斯 12.8020653633
+索索地 10.4349417492
+罗可汗 11.9547675029
+保山 9.75754292558
+收账 12.1089181827
+头份镇 13.2075304714
+棋王 13.2075304714
+蓼莪 13.2075304714
+收货 11.4157710022
+涌进去 13.900677652
+川楚陕 12.1089181827
+法不徇情 13.900677652
+台湾人 10.5684731418
+六万户 13.2075304714
+两截式 12.8020653633
+当众脱 13.900677652
+根子 9.31571017331
+那石宝 13.900677652
+猛涨 9.87532596124
+六记 11.7034530746
+保尔 10.3743171274
+廖先生 13.900677652
+巴颜喀喇 12.2912397395
+祖康熙 13.900677652
+暴躁如雷 13.2075304714
+俯首帖耳 11.1280889297
+收购 6.1552420417
+安吉 10.604840786
+熟石膏 13.900677652
+真烈 13.900677652
+灵幡 12.2912397395
+水平角 11.8212361103
+眼睁睁 8.83177344976
+五芳斋 12.8020653633
+神神秘秘 11.1926274509
+表面积 10.0088573539
+阿利亚 13.2075304714
+南到 9.48183704418
+屈光力 13.2075304714
+安吴 13.2075304714
+倒不如 9.20932976975
+聪明能干 11.4157710022
+插秧 10.9049453784
+良心不安 12.2912397395
+范子愚 7.89926277401
+看淡 9.33632946051
+不靠 9.33632946051
+望风 9.62401153296
+庞统之 12.8020653633
+加美 13.2075304714
+论理学 13.900677652
+坐视不救 12.2912397395
+荀子 9.11318590919
+拂子 13.2075304714
+拉凤姐 13.2075304714
+叩问 11.0674643079
+太牢 12.1089181827
+演唱组 11.9547675029
+超新星 9.94943393339
+杰姆代 11.8212361103
+荀学 13.2075304714
+五零四散 12.5143832909
+打打气 13.2075304714
+计程 12.1089181827
+竭力虔心 13.900677652
+计税 10.765183436
+剧情 9.13850371718
+县乡 10.9049453784
+美术设计 11.1926274509
+悲观失望 11.5027823792
+孝男 13.900677652
+安哥 10.7226238216
+库仑场 13.2075304714
+可风 13.2075304714
+公证人 11.7034530746
+对饮 10.3171587135
+看涨 8.64318227995
+更为严重 9.5186510173
+保持稳定 8.20023407859
+八掌溪 13.2075304714
+童贯而 12.8020653633
+集市 9.01787572939
+郭汜引 12.8020653633
+养马业 11.7034530746
+计穷 11.9547675029
+不露 9.63799777493
+莫里哀 10.642581114
+热血男儿 12.1089181827
+溜下 11.0674643079
+多长时间 9.10488710638
+昌乐县 13.2075304714
+不需 9.04086524761
+放心大胆 11.3357282945
+如雨 9.84023464143
+如雪 10.604840786
+弓鞋 10.9562386728
+如雷 9.77354326693
+霍屯督 11.2616203224
+吏治 8.80081122415
+如雾 11.9547675029
+麻喏 11.0674643079
+供热 8.77671367257
+溴酸盐 11.5027823792
+赴会 10.4994802703
+普拉 10.4349417492
+易腐 12.5143832909
+如需 9.17328983326
+棉制品 12.2912397395
+负分 13.900677652
+蜂王 11.3357282945
+亚瑟 11.598092559
+黄门迁 12.8020653633
+国葬 12.1089181827
+如霜 11.2616203224
+珙桐 9.56994431169
+性感照 13.2075304714
+学法语 13.2075304714
+三复 13.900677652
+不雅 10.5684731418
+拉木兹 13.2075304714
+百川归海 13.2075304714
+宜都 10.604840786
+三位数 11.8212361103
+科技部 9.35738286971
+计算 5.5984118571
+统计局 8.83808261895
+空委 13.2075304714
+四十把 13.900677652
+空姐 11.8212361103
+侯河 12.8020653633
+析骨而炊 13.900677652
+司马懿留 13.2075304714
+复染 13.900677652
+德豪润 10.3453295905
+降温 7.96050639926
+孑孓 12.1089181827
+碧海银沙 13.900677652
+石渣 12.1089181827
+路线方针 13.900677652
+绿豆象 13.2075304714
+亚琛 11.2616203224
+雷嗔电怒 13.900677652
+不难 7.42678695562
+履新 10.604840786
+调节剂 10.8096351986
+低吟浅唱 13.900677652
+辞格 12.8020653633
+劳动英雄 11.8212361103
+麻吕 12.8020653633
+不随 10.0505300503
+何文秀 13.2075304714
+药品监督管理局 9.56994431169
+二重化 11.7034530746
+贴己 13.900677652
+泸定 10.765183436
+压抑 7.99531580392
+豆渣 12.1089181827
+证券界 11.5027823792
+矮一截 13.900677652
+杞人忧天 10.765183436
+阿历克 12.2912397395
+亿多年 11.1280889297
+额外 7.88696249593
+四川省人民政府 11.0674643079
+透雨 11.4157710022
+肾盂肾炎 10.7226238216
+尉常惠 13.2075304714
+班有钱 13.900677652
+聊城 9.84023464143
+苦思苦想 12.5143832909
+戴红冠 13.900677652
+牛鬼蛇神 9.80633308975
+先锋报 12.8020653633
+额头 7.79811905736
+压扁 10.6818018271
+空中客车 11.1926274509
+汗珠 9.20019728618
+不降 9.20019728618
+实质成长 13.2075304714
+屈居人 12.2912397395
+煲汤 11.1280889297
+饽饽 10.6818018271
+高拱刚 12.5143832909
+石窟群 10.9562386728
+看法 6.58479414747
+调节力 13.2075304714
+透雕 10.8561552143
+硫磺粉 13.900677652
+七八十米 12.8020653633
+安喜 13.2075304714
+野战排 13.900677652
+溶剂回收 13.900677652
+以策安全 12.8020653633
+阿戈 13.2075304714
+求职网 13.2075304714
+弈棋 10.9562386728
+延英殿 13.2075304714
+一个四圈 13.900677652
+圣驾 8.90346537821
+南方电网 10.765183436
+不防 9.75754292558
+空头 8.07763175649
+守边 11.0103058941
+法色 13.900677652
+安善 13.2075304714
+明帝永 10.3171587135
+瓜亚基尔 11.2616203224
+枯草热 13.2075304714
+滴落 10.1164880181
+太猛 10.0294766411
+空处 11.8212361103
+延安东路 11.9547675029
+精卵融合 13.900677652
+棋牌 12.1089181827
+别尔乌 11.5027823792
+埋下 8.85725253506
+罪恶深重 13.2075304714
+武侯祠 10.4349417492
+寻宋江 12.8020653633
+计策 8.66423568915
+谢宴 12.8020653633
+王乃颜 11.9547675029
+装配线 11.598092559
+薄周孔 12.2912397395
+秦从孝 12.2912397395
+换下去 13.900677652
+炭疽热 13.900677652
+白朴 11.0103058941
+韩寒 12.2912397395
+藤原良房 13.2075304714
+颜面骨 13.900677652
+关泉群 12.8020653633
+一个尺 13.2075304714
+十二 7.61467955747
+二十四首 13.2075304714
+身体 5.69956600753
+统计学 9.09665660724
+卑劣 9.82314020807
+混日子 11.2616203224
+十五 8.01457362053
+皮下组织 10.9049453784
+保亭黎族苗族自治县 13.900677652
+看死 13.2075304714
+白术 9.98865464655
+真的 5.63374230437
+三八式 11.5027823792
+网格法 13.900677652
+保婴 13.900677652
+白朗 11.1926274509
+陵谷变迁 13.900677652
+正常化 9.03314320152
+十亩 10.8561552143
+赵本山 9.82314020807
+白河县 10.9049453784
+真皮 9.12155415886
+额度 6.70399108114
+四十文 13.900677652
+其他 4.26827729832
+火车票 8.9102450652
+货运单 12.1089181827
+十人 9.65218240993
+膨胀起来 10.4349417492
+十亿 10.7226238216
+森美兰 13.2075304714
+穷苦 9.35738286971
+迎刃而解 10.0505300503
+如遇 9.31571017331
+滤色镜 13.900677652
+男娃子 13.900677652
+郎石秀 13.900677652
+白板 11.4157710022
+白松 12.8020653633
+麻匿 13.2075304714
+九一三 11.9547675029
+指标 6.07823292249
+销子 12.8020653633
+氧乙炔 13.2075304714
+白条 11.8212361103
+四十日 11.8212361103
+国内定价 13.2075304714
+其人 8.69119149913
+电工钢 10.9049453784
+白杨 9.82314020807
+安分 10.4041700905
+迪金森 12.8020653633
+须发 9.98865464655
+金波哥 12.1089181827
+宽心丸 13.900677652
+空床 12.5143832909
+真相 8.06586691491
+虎头虎脑 11.7034530746
+其事 8.74738605748
+其二 7.88941047757
+跷蹊 11.0103058941
+杭氏家族 10.1871055853
+安利 12.8020653633
+水胶 12.5143832909
+西达 10.3453295905
+普施 12.5143832909
+麻包 11.1926274509
+十件 10.5684731418
+海樽纲 12.8020653633
+白杏 13.2075304714
+十份 13.2075304714
+巫溪县 12.5143832909
+厉行 10.9562386728
+明帝武 13.2075304714
+十一 7.15309112515
+十七 8.40761620864
+剧曲 13.2075304714
+十万 7.98717464634
+十三 6.99693039439
+十丈 10.4349417492
+十下 12.5143832909
+凑上来 11.7034530746
+造纸业 10.4349417492
+刘隗劝 12.5143832909
+华山论剑 11.1280889297
+遍计所执 12.2912397395
+不足道也 13.2075304714
+晋厉公 12.1089181827
+不酸 12.2912397395
+五百余万 12.8020653633
+乱说乱动 12.1089181827
+令誉 13.900677652
+真吓 13.900677652
+密友 10.0088573539
+政通人和 13.2075304714
+苏必利尔湖 10.7226238216
+不配 9.26594866375
+施密特 10.4994802703
+十个 7.8184587416
+压敏 12.1089181827
+文具用品 13.900677652
+卡利 10.1630080337
+夺冠军 13.2075304714
+德萨林 12.1089181827
+亮丽 9.11318590919
+武术学校 11.7034530746
+叙述 7.50208271744
+连理枝 13.2075304714
+如此等等 9.93038573842
+雪兰莪 13.2075304714
+保媒 12.8020653633
+无限公司 12.8020653633
+没法用 12.2912397395
+伊都锦 13.900677652
+其中 3.92654525987
+代尔诺 13.2075304714
+流行 6.41406433884
+褶曲 11.7034530746
+秣马厉兵 12.8020653633
+贾姆谢 13.900677652
+鹏程万里 12.8020653633
+黄时鉴 12.2912397395
+其为 8.43684584695
+陶伯 12.5143832909
+十九 9.5186510173
+首旅股份 10.765183436
+其一 7.76727960898
+翘楚 10.533381822
+汪幼读 13.2075304714
+金属支架 13.900677652
+玩器 11.1280889297
+宣徽南 12.5143832909
+水泥公司 12.1089181827
+其下 9.45802639549
+计籍 13.2075304714
+灭门 10.9562386728
+因利乘便 12.1089181827
+十一点 10.3171587135
+包装物 12.8020653633
+失语症 11.4157710022
+混沌初开 11.9547675029
+化学战 11.0674643079
+对齐 11.4157710022
+一百二十四个 13.2075304714
+云淡风 13.900677652
+弓太软 13.2075304714
+一下二十 13.900677652
+玄玄 12.5143832909
+安博 13.2075304714
+光艳 11.7034530746
+潘生丁 11.5027823792
+白昼 9.01787572939
+西边 7.89679058487
+胁从犯 12.2912397395
+保存 6.45759927763
+安南 9.82314020807
+劳动价值论 11.0674643079
+汽油费 13.900677652
+门面 9.38981814546
+色彩鲜艳 9.93038573842
+维尼纶 10.9049453784
+长短句 10.8561552143
+最合适 9.4233408375
+民族特点 10.3743171274
+称臣纳贡 10.8561552143
+众怒难犯 12.8020653633
+郝晋 12.1089181827
+严肃性 10.3171587135
+宇文直 12.8020653633
+安危 8.69119149913
+白星 12.1089181827
+所分 11.1926274509
+戾气 11.598092559
+空心 9.20019728618
+傲贤慢士 13.900677652
+泸州 8.63281949291
+亚特 12.1089181827
+博赞克 13.2075304714
+幸桓 10.604840786
+宿营地 10.2117981979
+一千架 13.900677652
+河南坠子 11.1926274509
+安卧 11.598092559
+水耕 12.8020653633
+白晰 13.900677652
+演进到 12.5143832909
+身下 9.26594866375
+身上 5.30245762192
+译电员 12.2912397395
+安北 11.1926274509
+安化 10.8561552143
+身世 9.0884932966
+麻利 9.5062284973
+剧本 7.6761192227
+十信 13.900677652
+赵长 13.2075304714
+锚雷 11.8212361103
+上海证券交易所 8.05135287203
+踏上 8.21370229564
+合同纠纷 10.2897597393
+茂竹 13.2075304714
+史传王 13.900677652
+画虎刻鹄 13.900677652
+四局 11.1926274509
+粉煤灰砖 13.2075304714
+身临 11.0674643079
+郝昭 11.4157710022
+身为 7.74369866639
+真知 11.2616203224
+空得 12.5143832909
+白晋 11.1280889297
+根尖 11.7034530746
+真真 9.49395840471
+监票 13.900677652
+须到 11.8212361103
+灵床 11.1280889297
+南宁站 12.8020653633
+全气密 12.8020653633
+虚无飘渺 12.1089181827
+近岸 9.15574552361
+旗舰店 9.89334446674
+形式多样 10.0940151622
+投工 13.2075304714
+帕斯卡 9.94943393339
+保密 8.07173203437
+一万八千多元 13.2075304714
+于乐艺 13.900677652
+不避 9.72629038208
+晾衣 13.2075304714
+中立地带 12.8020653633
+令人不安 10.4994802703
+纵使 9.59661255877
+李当之 13.900677652
+乱石堆 11.7034530746
+一千本 12.8020653633
+不遂 10.4994802703
+宫皆设 13.2075304714
+延胡索 11.3357282945
+安史 10.5684731418
+近岁 12.8020653633
+不遗 13.2075304714
+身价 8.46695564842
+日至 6.64367494488
+最高值 9.45802639549
+其余 5.81796651774
+柳庄 11.7034530746
+年复一年 10.0505300503
+身份 6.60155618926
+空当 10.6818018271
+莫斯科大学 9.6811699468
+万贯家私 13.2075304714
+安厝 12.8020653633
+辞源 12.2912397395
+十位 9.4233408375
+容克 9.98865464655
+贴子 12.8020653633
+高密度 9.32596667347
+第一国际 10.1630080337
+保宁 11.1280889297
+空弹 12.8020653633
+十余 8.9102450652
+斯柯达 10.4666904475
+保安 8.0746775446
+保守 7.42216800977
+太甜 12.1089181827
+身亡 8.55357012126
+保家 11.4157710022
+不送 10.642581114
+不退 9.41204128224
+太甚 10.1871055853
+不适 8.07763175649
+不透 9.58318953844
+一千条 13.2075304714
+当当网 12.5143832909
+二十四页 13.2075304714
+双面板 13.900677652
+不逊 10.9049453784
+十佳 9.72629038208
+碱度 12.5143832909
+豆梨 13.2075304714
+剧情片 11.9547675029
+不逞 12.2912397395
+二万万两 12.5143832909
+不通 8.19356738723
+欧德宁 11.4157710022
+贴墙 12.5143832909
+太直 11.598092559
+迁调 12.5143832909
+木变石 13.2075304714
+邗江 11.9547675029
+腓利 12.5143832909
+西岸地区 13.2075304714
+胜概 13.2075304714
+抗辩 10.4994802703
+金融市场 7.11396070137
+八角亭 11.598092559
+茫然不知 11.598092559
+代闯王 12.1089181827
+炎阳 13.2075304714
+奥菲莉 13.2075304714
+醒世 11.1280889297
+涑水河 12.1089181827
+太盛 10.9562386728
+张顺只 13.900677652
+朝西北 12.5143832909
+普查 9.04086524761
+赵阳 13.2075304714
+辞海 10.642581114
+亚高山 9.40086798165
+索尼娅 13.900677652
+伊拉姆 12.8020653633
+珍藏密敛 13.900677652
+欢迎仪式 11.8212361103
+重得 11.2616203224
+其他配件 13.900677652
+维珍 13.2075304714
+瞥闪 11.7034530746
+幸欢 10.642581114
+氨水 10.2897597393
+登界游方 13.900677652
+强加于人 12.1089181827
+弓取箭 11.8212361103
+氨氮 12.5143832909
+切尔诺贝利 11.8212361103
+炎陵 13.900677652
+须凭 12.2912397395
+普林 11.7034530746
+于宝庆 13.2075304714
+大型项目 10.4666904475
+一本万利 11.0103058941
+库希特 11.4157710022
+根式 11.7034530746
+空首布 11.8212361103
+构形 11.8212361103
+蒙头大睡 11.7034530746
+聊到 11.0103058941
+忘忧 7.65845438652
+氨气 11.8212361103
+芦丁 12.5143832909
+燕又战 13.2075304714
+面茶 12.5143832909
+胡风似 13.2075304714
+空岗 12.8020653633
+奇瓦瓦 12.8020653633
+檑木 13.2075304714
+压枝 13.2075304714
+于阗王 12.1089181827
+伏虎降龙 12.1089181827
+太白 9.55687223012
+压条 10.3453295905
+加维 12.2912397395
+平巷 12.8020653633
+白方 13.2075304714
+马斯 10.9049453784
+中日合作 13.900677652
+先农坛 11.9547675029
+真理 7.96050639926
+古琴 10.2630914922
+赵隆 8.94485059437
+压板 12.8020653633
+空山 10.7226238216
+秕子 13.900677652
+腓力 10.0720362555
+邓忠 11.8212361103
+白斑 9.93038573842
+荀彧 11.0674643079
+近得 11.598092559
+空屋 11.5027823792
+戴法 13.2075304714
+李正己 13.900677652
+明贾母 11.4157710022
+堆上来 13.900677652
+鬼神莫测 13.900677652
+白文 10.9562386728
+风刀霜剑 12.2912397395
+依次 7.13448593732
+刷子 9.94943393339
+乐呵呵 10.3171587135
+马地臣 12.1089181827
+伯爷 9.69598503258
+卓迁太 13.2075304714
+出售者 11.0103058941
+保墒 11.1926274509
+化学性 10.4349417492
+四十五斤 13.2075304714
+临界点 9.40086798165
+现金买卖 13.900677652
+一己之私 11.9547675029
+高奇 13.2075304714
+白日 8.96620371885
+杜岭方 12.5143832909
+四十条 12.5143832909
+清教徒 10.3171587135
+近忧 11.4157710022
+压机 13.2075304714
+不倒翁 11.1280889297
+两百六十公里 13.2075304714
+普朗 11.8212361103
+白旗 9.07236391467
+曹军寨 13.2075304714
+川陕宣 12.8020653633
+忘形 10.7226238216
+染料植物 12.5143832909
+二路纵队 13.900677652
+压服 11.1280889297
+依此 10.2897597393
+农学院 9.75754292558
+顾主 12.8020653633
+白族 9.69598503258
+人民币 5.59050862999
+郑和曾 12.8020653633
+荣禄分 13.900677652
+理则学 13.900677652
+一亿三千多万年 13.2075304714
+庾冰 12.5143832909
+溶解油 13.900677652
+四射 10.2630914922
+正常值 10.0088573539
+贝拉尔 12.8020653633
+空巢 11.2616203224
+欧亚非 11.0103058941
+太短 9.98865464655
+太矮 12.2912397395
+什字 12.8020653633
+增征 12.8020653633
+白搭 10.1164880181
+真吾 11.1926274509
+发报 9.89334446674
+阿斯图里亚斯 11.598092559
+火车皮 13.900677652
+本岛居民 13.900677652
+辞汇 13.900677652
+个人利益 10.1394775363
+安养 12.8020653633
+杨义臣 13.2075304714
+三四万块 13.2075304714
+供电 8.43261751084
+任港英 13.900677652
+地雷战 11.0674643079
+反剪 10.8096351986
+种类表 13.2075304714
+洪积层 13.2075304714
+一千斤 11.7034530746
+安全 5.54529775672
+鹭鸶 10.642581114
+指正 11.0674643079
+发电机组 9.38981814546
+杨传广 12.8020653633
+阑珊 11.8212361103
+狄纳莫 13.900677652
+模糊集 12.1089181827
+叙谈 10.7226238216
+优选 7.60356833204
+赵静 13.900677652
+近年 7.68606955355
+土茯苓 12.2912397395
+调节器 10.1394775363
+汽油车 11.4157710022
+轩辕庙 11.8212361103
+集宁 10.765183436
+哈工大 12.8020653633
+看样 11.7034530746
+杨双旦 12.8020653633
+集安 10.9562386728
+分蘖力 12.8020653633
+七十七国集团 11.0103058941
+航业 13.2075304714
+安儿 11.1280889297
+潜育化 12.1089181827
+宋时轮 12.2912397395
+司通政 12.8020653633
+封爱育 13.2075304714
+复兴门 12.5143832909
+使节 8.77077893705
+驽下 13.900677652
+四尺 10.3171587135
+红云飞 12.8020653633
+后屋 13.2075304714
+棋盘 8.77671367257
+拒人千里 11.8212361103
+球类运动 10.8096351986
+集子 10.1871055853
+商品销售 10.642581114
+罗彻斯特 11.7034530746
+真甜 12.8020653633
+管炮 11.2616203224
+再不然 10.4994802703
+中国国防部 13.2075304714
+最高分 11.7034530746
+田佃 13.2075304714
+能成佛 13.2075304714
+布兰特 10.8096351986
+保姆 8.4801426527
+古画 10.0940151622
+聊友 13.900677652
+赵鞅 12.1089181827
+进步事业 11.598092559
+某一地方 12.1089181827
+古田 9.77354326693
+楼盖 11.7034530746
+亚热 13.900677652
+冲昏 11.5027823792
+视听资料 12.2912397395
+证券交易 7.72897705456
+蓼花 11.8212361103
+忘带 11.5027823792
+楼盘 8.03420959504
+古生 12.5143832909
+向伊军 13.2075304714
+市场潜力 10.0940151622
+幕间 12.2912397395
+伊里亚特 13.2075304714
+炮位 10.4349417492
+连过 12.8020653633
+含淀粉 10.8096351986
+老虎头 12.5143832909
+小道士 10.0940151622
+严重局面 12.1089181827
+灌阳 12.8020653633
+按好 13.2075304714
+素席 12.8020653633
+安内 11.5027823792
+内部空间 10.0940151622
+江滩 12.5143832909
+优先发展 9.56994431169
+贴好 12.8020653633
+瞪羚 11.9547675029
+爱乐乐团 11.0674643079
+绝世武功 13.900677652
+赵韪 13.900677652
+白操 11.7034530746
+用品店 13.2075304714
+根底 10.7226238216
+中国石油化工集团 11.9547675029
+垂了下来 11.3357282945
+点线 11.8212361103
+看来 5.54977520028
+空勤 12.1089181827
+椎管 10.765183436
+胜果 13.2075304714
+舞俑 13.900677652
+舍小家 12.8020653633
+韩太监 13.2075304714
+指摘 10.3453295905
+特高压 10.2117981979
+摘借 13.2075304714
+李正华 13.900677652
+试用期 12.1089181827
+箜篌 11.0674643079
+亚罗 11.7034530746
+茅津堡 12.8020653633
+须得 9.32596667347
+包装纸 10.8561552143
+登记表 10.5684731418
+安平 10.2117981979
+供稿 10.9562386728
+马里政府 13.900677652
+医保 8.56313957227
+墨玉县 12.5143832909
+销地 13.2075304714
+引风 13.2075304714
+见义勇为 10.6818018271
+翻场 13.2075304714
+越轨行为 11.4157710022
+科普 9.53122979951
+锢囚 11.9547675029
+古窑 11.2616203224
+三等兵 12.8020653633
+崇高品德 12.8020653633
+三亿两 13.900677652
+安帝 10.2897597393
+越成 12.8020653633
+压榨 9.10488710638
+通风管 13.2075304714
+澄海县 12.5143832909
+开源节流 11.3357282945
+演播室 11.0103058941
+高庄 11.5027823792
+根儿 11.0103058941
+服务部 10.2897597393
+年轻夫妇 11.598092559
+安布 12.5143832909
+高压手段 12.8020653633
+金池长老 13.2075304714
+贴图 12.5143832909
+安常 12.8020653633
+大喜大悲 11.8212361103
+分散系统 11.7034530746
+颠覆 8.87023973058
+年轻夫妻 12.8020653633
+贺朔礼 12.5143832909
+笑料 10.533381822
+看有 10.7226238216
+堵阳 13.2075304714
+山杨 9.87532596124
+二十四门 12.1089181827
+认领 10.8096351986
+依旧 6.60697993137
+引颈 10.6818018271
+荀况 13.2075304714
+看望 7.92179188707
+引领 7.61096208107
+王庆越 12.8020653633
+图象处理 13.900677652
+真章 13.2075304714
+加的斯 11.598092559
+警方正 13.900677652
+武昌区 13.2075304714
+近况 10.2371160058
+胜朝 11.5027823792
+南大冉 12.5143832909
+沉重负担 11.2616203224
+贤侯 13.900677652
+许呆子 13.2075304714
+昌河集团 13.900677652
+管理手段 11.5027823792
+真稀 13.2075304714
+空前 7.5393751744
+女歌星 12.5143832909
+保国 10.9562386728
+经济体制 8.44535653662
+古稀 10.9562386728
+天论 12.1089181827
+计划周密 13.900677652
+石椅 12.8020653633
+陈如为 13.900677652
+胳肢 12.8020653633
+阿利雅 12.1089181827
+默记 11.598092559
+塞万提斯 10.8561552143
+愁云惨淡 13.900677652
+亚美 13.2075304714
+赵飞 13.2075304714
+江景则 13.2075304714
+谢宝 11.5027823792
+根冠 11.9547675029
+诸富室 13.900677652
+深度分布 13.2075304714
+道尔吉 13.2075304714
+辞掉 10.5684731418
+重理旧业 13.2075304714
+焦点访谈 10.9562386728
+集合 7.39489359185
+依敏 13.2075304714
+空到 13.900677652
+古兹密 13.2075304714
+白毫 11.2616203224
+安庆 8.89004235788
+人口老化 12.5143832909
+真空 7.95525704337
+历朝历代 10.2897597393
+亚群 12.2912397395
+白毛 9.63799777493
+大洪山 10.8561552143
+大如斗 11.598092559
+奔行 13.2075304714
+纽带 8.79473217808
+国公景 12.8020653633
+汗碱 12.8020653633
+管叔监 13.2075304714
+版税 11.8212361103
+有阴有晴 13.900677652
+耍赖皮 13.900677652
+安度 11.8212361103
+摘下 8.74738605748
+于云台 13.2075304714
+悯恤 12.5143832909
+德达善 13.2075304714
+弓鱼 12.1089181827
+高度 6.01346906616
+指教 9.32596667347
+空口 11.3357282945
+罗罗罗 13.2075304714
+叶春善 13.2075304714
+杨柳岸 12.5143832909
+昆玉 11.7034530746
+空号 12.2912397395
+卑微 9.7898037878
+宣传教育 10.0294766411
+普森 12.8020653633
+指数 4.89000847513
+咆哮起来 11.0103058941
+依我来看 13.900677652
+新宠儿 13.2075304714
+重点高中 12.5143832909
+安彩 11.1280889297
+夏雨拿 12.8020653633
+二重奏 12.1089181827
+严复译 12.8020653633
+凄凄 11.1926274509
+富尔敦 13.900677652
+幻想 7.63158136827
+战斗队 10.1630080337
+吹水 13.2075304714
+凯尔奈克 13.2075304714
+恭维话 11.5027823792
+七十五部 13.2075304714
+保土 11.7034530746
+婉拒 10.9562386728
+看是 9.77354326693
+学院派 10.4041700905
+醋劲 12.8020653633
+又哭又笑 12.5143832909
+荒林 13.2075304714
+男子篮球 11.3357282945
+刘家港 11.1926274509
+拨电话 11.2616203224
+包装容器 12.2912397395
+穷追 10.0940151622
+陆奥君 13.900677652
+额叶 11.8212361103
+人民军 9.69598503258
+巴尔迪维 13.900677652
+学生家长 10.3171587135
+布基纳 12.8020653633
+急公好义 12.8020653633
+橙红 11.598092559
+麻布 8.66956903512
+吴之议 12.8020653633
+灭顶 12.5143832909
+讲唱文学 12.5143832909
+内在美 13.2075304714
+最高峰 7.48885938427
+罗基蒂 13.2075304714
+设备简陋 11.0103058941
+剑术 10.3743171274
+古符 10.604840786
+猝倒病 12.2912397395
+黑啤 13.2075304714
+灌顶 10.2897597393
+胳膊 7.07088391446
+松香酸 12.5143832909
+安忍 10.8096351986
+医书 10.2630914922
+广征贡 12.8020653633
+白德尔 11.9547675029
+四宗 11.0674643079
+安心 7.90671622467
+先知先觉者 11.9547675029
+犀鸟 10.4666904475
+小狄 9.77354326693
+掏粪 12.8020653633
+太祝 12.2912397395
+太神 12.8020653633
+人民党 9.46986085313
+剧毒 9.32596667347
+藿香 10.3743171274
+专利发明 13.900677652
+耿汝光 13.2075304714
+一千次 11.4157710022
+贴地 11.2616203224
+群龙无首 10.6818018271
+张鲸心 12.8020653633
+指日 10.9049453784
+楚卿 8.63281949291
+于昆阳 12.1089181827
+白檀 11.598092559
+安全事故 10.1871055853
+别无所求 12.8020653633
+水平舵 11.9547675029
+隋初唐 12.8020653633
+隆尧东 13.2075304714
+两百米 12.1089181827
+本周一 8.20023407859
+最高层 10.9562386728
+改编权 13.900677652
+留党查看 13.2075304714
+安得 9.54396882529
+公安系统 11.1926274509
+子相立 12.8020653633
+阿虎 11.2616203224
+连慈禧 13.900677652
+扶上马 11.598092559
+胳臂 9.49395840471
+压根 10.0720362555
+亿多吨 10.4994802703
+欧阳铎 12.5143832909
+医专 11.7034530746
+罗奇法 13.2075304714
+怪怪的 10.642581114
+安徽 6.79407151425
+力斗 13.900677652
+陈胜部 12.8020653633
+石孔里 13.2075304714
+再聚合 13.900677652
+畏缩不前 11.0103058941
+安德 9.7898037878
+商学院 9.48183704418
+指斥 10.0720362555
+古筝 11.5027823792
+石大哥 12.5143832909
+宫保鸡 13.2075304714
+圣道 12.5143832909
+胜景 9.33632946051
+空化 11.1280889297
+亚纲 8.25523075433
+亚纳 11.7034530746
+桑德伊 13.900677652
+可选 7.65263477747
+死不承认 12.8020653633
+可逆 9.23723855786
+猛料 11.4157710022
+庾岳 13.2075304714
+五百里 10.533381822
+一二千米 12.5143832909
+笨鸟先飞 13.900677652
+娼寮 13.2075304714
+突发性 9.75754292558
+何难 10.5684731418
+庾岭 13.900677652
+桩冠 13.900677652
+蜂窝 9.20019728618
+速度表 11.7034530746
+由喜贵 13.900677652
+安居 9.71102290995
+乌第河 11.4157710022
+老俩口 12.8020653633
+间连接 13.900677652
+奥伦治 12.2912397395
+蜂窠 13.2075304714
+衷心祝福 13.2075304714
+聒聒 11.7034530746
+杭白菊 11.9547675029
+保命 10.9049453784
+维尼熊 13.2075304714
+销售 5.31825867564
+毛遂自荐 11.2616203224
+夏令时 13.2075304714
+胜方 11.8212361103
+集团 4.92859446912
+冻结资金 7.81163277653
+笑柄 10.5684731418
+轩辕台 13.900677652
+化学法 12.5143832909
+李家芬 12.5143832909
+美术作品 10.7226238216
+两百余万两 13.2075304714
+幸未 11.5027823792
+江风吹 12.8020653633
+聒耳 12.1089181827
+葵花仁 13.900677652
+白楼 13.2075304714
+扛上来 13.900677652
+白楹 12.8020653633
+学年考试 13.2075304714
+任海霞 13.2075304714
+服务措施 12.1089181827
+根区 13.900677652
+白楠 13.2075304714
+西珠市 12.8020653633
+辞意 12.8020653633
+指明 8.65893063692
+近卫 10.604840786
+科技馆 11.0674643079
+铁板钉钉 11.5027823792
+言孟达 13.2075304714
+含在口中 12.1089181827
+对重 12.5143832909
+安尼 12.1089181827
+时间性 11.7034530746
+季节工 12.8020653633
+缓缓 7.2439511278
+种田人 12.1089181827
+转圜之地 13.2075304714
+朝中社 13.900677652
+詹传教 12.8020653633
+赐福 11.0674643079
+拂去 10.765183436
+太空 8.53470163695
+太穷 10.765183436
+伊斯兰堡 11.598092559
+流程化 13.900677652
+鱼目混珠 11.4157710022
+乌苏勒 13.2075304714
+深沉 8.13548654919
+麻巧 10.9049453784
+贴合 11.1280889297
+压死 10.0720362555
+不齿 10.642581114
+根号 13.900677652
+上个季度 11.5027823792
+冲任失调 13.900677652
+黑山头 12.5143832909
+猛攻 8.70218062071
+猛政 13.2075304714
+女性化 10.9562386728
+白榆 12.5143832909
+古砚 11.598092559
+不齐 9.71102290995
+乌里亚 13.2075304714
+美国加州大学 11.8212361103
+荀卿 12.5143832909
+如麻 11.0103058941
+安岛 13.900677652
+依杖 13.900677652
+赵高 10.0294766411
+我爹 9.27570483869
+我爸 9.61021821083
+高灵敏度 10.8561552143
+简文帝 11.2616203224
+公示制 13.900677652
+露地栽培 11.7034530746
+郭样见 13.2075304714
+近古 12.5143832909
+四十步 12.5143832909
+保和 12.5143832909
+荣禄忙 13.2075304714
+删减成 13.2075304714
+农牧场 11.1280889297
+对酌 11.9547675029
+胜数 13.2075304714
+如虎添翼 10.4994802703
+胶粘剂 9.74179456862
+安岳 11.5027823792
+青龙桥 12.2912397395
+众人皆醉 12.5143832909
+家务活 11.1280889297
+湘潭县 11.4157710022
+推倒重来 11.1280889297
+卑屈 12.5143832909
+奇丑 13.2075304714
+商务车 11.4157710022
+焦宝石 12.2912397395
+忘却 9.01787572939
+记功碑 13.2075304714
+家弦户诵 13.2075304714
+史李光 13.2075304714
+美国西北大学 13.2075304714
+急不及待 13.2075304714
+阁揆 12.5143832909
+白根 13.2075304714
+瓦赤掌 12.8020653633
+坏分子 10.642581114
+天未明 11.7034530746
+荀勖 12.2912397395
+空出 10.8096351986
+近利 13.2075304714
+不足以 7.98447558937
+一九七一年 13.900677652
+蔚然成风 11.2616203224
+伊斯兰会议组织 12.2912397395
+熊备加 13.2075304714
+不黏 13.900677652
+细致入微 10.765183436
+百分之十一 13.2075304714
+百分之十七 13.900677652
+蜂箱 11.8212361103
+诗兴大发 13.2075304714
+滋生事端 12.8020653633
+过小年 12.1089181827
+阿拉伯联盟 11.5027823792
+白栋 13.2075304714
+可配 11.2616203224
+利夫兰 13.2075304714
+婉惜 13.900677652
+马横枪 11.9547675029
+狮球 12.5143832909
+指望 7.38893232233
+供神 12.2912397395
+白桦 9.61021821083
+谈论到 12.8020653633
+纳丝料 13.2075304714
+从雄体 13.2075304714
+现而今 13.2075304714
+古称 8.17709255002
+法律制裁 11.5027823792
+陶忠信 11.2616203224
+和众僧 13.900677652
+经赫德 13.2075304714
+依曼 11.0103058941
+百分之十九 13.2075304714
+偷漏税 11.7034530746
+麻将 9.94943393339
+空军 6.76339921472
+海德堡 9.75754292558
+近前 8.25170341381
+盛佛宝 13.2075304714
+登记证 11.598092559
+推力器 13.900677652
+狄杰斯 13.900677652
+安州 11.7034530746
+迪尔维尔 13.900677652
+古礼 11.7034530746
+陶折腹 13.2075304714
+屈光学 13.900677652
+西亚斯 12.8020653633
+轩辕剑 13.900677652
+熊皮熊 12.8020653633
+诸候王 13.2075304714
+扶优限劣 11.3357282945
+皮萨诺 13.2075304714
+遮遮掩掩 10.4994802703
+百分之十五 11.8212361103
+帝王之相 12.2912397395
+成亮 13.2075304714
+三等功 10.8561552143
+喜歌剧 10.8561552143
+瞬间 7.99259471381
+蓟门关 12.8020653633
+白梅 12.1089181827
+堵门 12.5143832909
+于西陵 12.8020653633
+暴过度 13.2075304714
+百分之十二 13.900677652
+真神 10.6818018271
+新闻宣传 11.3357282945
+日元 7.84623830571
+各安职守 13.900677652
+分批进行 11.9547675029
+狗王 12.2912397395
+聊得 10.8096351986
+小型汽车 11.0674643079
+松节油 10.7226238216
+空儿 9.36807815882
+太笨 11.8212361103
+交叉耦合 13.900677652
+砍过去 13.900677652
+建中靖国 12.2912397395
+帕洛阿尔托 12.8020653633
+婆媳关系 11.9547675029
+天子门生 12.5143832909
+楼窗 11.9547675029
+供称 12.2912397395
+满目凄凉 12.5143832909
+靠山吃山 11.5027823792
+刘家沟 12.5143832909
+成井 12.8020653633
+笑星 11.7034530746
+自拍照 13.900677652
+古神 12.8020653633
+忽明 13.900677652
+犹犹豫豫 10.533381822
+扯进 11.2616203224
+公共性 11.598092559
+白棉 13.2075304714
+乌苏县 12.8020653633
+白棋 12.8020653633
+何雨 13.2075304714
+脱氧腺苷 13.2075304714
+劣质 9.82314020807
+先锋派 10.4666904475
+张仪之 13.2075304714
+婚事 8.4980002701
+幻方 11.0674643079
+苏特尔 13.900677652
+劣货 12.8020653633
+石门洞 13.2075304714
+空闺 13.900677652
+古纳 12.8020653633
+徐锦江 13.2075304714
+非常适合 10.0088573539
+深埋在 11.1926274509
+憨态可掬 12.5143832909
+尼多斯 13.2075304714
+婚事新办 13.900677652
+力量悬殊 10.604840786
+哈纳斯 13.2075304714
+常务委员 8.71329184614
+白漆 12.2912397395
+数百套 13.900677652
+和勒狗 13.2075304714
+王庆见 12.1089181827
+销区 11.1280889297
+布兰科 12.8020653633
+猛推 11.7034530746
+可防 10.4666904475
+临财不苟 13.900677652
+陈川平 13.900677652
+门德斯 12.8020653633
+贝拉坝 13.2075304714
+安娜 9.96885201925
+婚介 10.4666904475
+须寻 13.2075304714
+真经 9.43476953332
+蜂糕 13.900677652
+门下省 10.4994802703
+赦令 12.8020653633
+佩雷 12.1089181827
+边际效应 11.0674643079
+成事 9.89334446674
+金朝分 13.2075304714
+撒手锏 12.2912397395
+李成玉 12.1089181827
+经理室 12.8020653633
+太粗 11.9547675029
+断垣残壁 12.8020653633
+关了灯 11.598092559
+雾沉沉 12.8020653633
+精神焕发 11.2616203224
+仙风道骨 11.5027823792
+保利 8.21709788464
+四姑娘山 11.1280889297
+刷写 13.2075304714
+如须 12.5143832909
+依法打击 12.5143832909
+燕国 9.35738286971
+杨载福 12.8020653633
+郑观应 10.8096351986
+纳余庆 13.2075304714
+五金交电 12.5143832909
+内生菌根 13.2075304714
+千数两 13.900677652
+缉私局 12.5143832909
+最高处 9.31571017331
+运动会 8.9102450652
+章以功 12.8020653633
+同则不继 13.2075304714
+膘肥体壮 11.5027823792
+旗舰型 11.0103058941
+贴切 9.62401153296
+不饿 10.8096351986
+五科 13.2075304714
+蓝铜矿 11.4157710022
+联合国开发计划署 10.8561552143
+勾娌充 12.8020653633
+锡罐 12.1089181827
+安侯 13.2075304714
+乌苏哩 12.8020653633
+女娃儿 13.2075304714
+贴到 10.2371160058
+华达呢 11.8212361103
+东北区 10.8096351986
+理塘 10.8561552143
+贵州省政府 12.8020653633
+深圳华强 9.93038573842
+亿多元 9.69598503258
+纳闷儿 11.3357282945
+超显性 13.2075304714
+销去 13.900677652
+法条 12.5143832909
+稻城县 13.900677652
+狮王 11.598092559
+冬作物 13.900677652
+新春快乐 13.900677652
+供给 6.67011449857
+对面 7.13679274341
+秦和赵 12.8020653633
+装填子弹 12.8020653633
+看样子 8.37522471284
+裘卫 12.2912397395
+六灶镇 11.7034530746
+防渗墙 13.900677652
+银基发展 11.1926274509
+本义 10.0505300503
+最高奖 11.5027823792
+畸人 13.900677652
+吃水量 13.2075304714
+子弟书 11.5027823792
+宗同族 11.7034530746
+婚书 11.9547675029
+往复式 11.3357282945
+忘啦 11.9547675029
+斯勒普 12.5143832909
+达弗林 13.2075304714
+销号 12.5143832909
+女歌手 11.8212361103
+古塘 11.7034530746
+普洱 10.3743171274
+冷战 8.52539924429
+追进去 13.2075304714
+国策顾问 12.1089181827
+笑意 8.38322475551
+保单 9.6811699468
+商务信息 12.8020653633
+河北省人民政府 12.8020653633
+老虎口 13.2075304714
+猛抛 13.2075304714
+机动车道 9.77354326693
+真美 10.6818018271
+宜黄 11.4157710022
+企业名单 10.4666904475
+白渠 11.0674643079
+空基 13.900677652
+透顶 10.1394775363
+隐介藏形 13.2075304714
+普法 9.46986085313
+安特南 13.900677652
+魏德迈 11.3357282945
+看扁 11.0674643079
+柱面阵 13.900677652
+史传篇 13.2075304714
+抽刀断水 12.5143832909
+赐给 8.67493097826
+包装箱 11.9547675029
+猛抽 10.9049453784
+小不点儿 11.4157710022
+秦穆公 11.0674643079
+麻婆 13.900677652
+多彩多姿 12.1089181827
+金甲神 11.7034530746
+岩爆 11.9547675029
+不食 10.0088573539
+保卫 7.50042020667
+蓄谋 11.2616203224
+杨志便 12.1089181827
+工艺礼品 11.3357282945
+胜招 13.900677652
+流言蜚语 10.1871055853
+核技术 10.1871055853
+桐庐 10.6818018271
+猛拉 11.7034530746
+婚俗 11.4157710022
+政研室 12.5143832909
+影视频道 13.900677652
+南霁云 12.8020653633
+移步换形 13.900677652
+不领 10.604840786
+有隙可乘 12.2912397395
+牛黄狗宝 13.2075304714
+看戏 8.93783302172
+接触眼镜 12.5143832909
+可靠 7.13910488317
+二十四部 12.1089181827
+看成 7.58894284282
+聊天 8.39128931535
+登记费 11.8212361103
+数日之久 13.900677652
+和小罗 12.8020653633
+人面桃花 11.8212361103
+晋永嘉 13.2075304714
+哈耶克 11.8212361103
+未受阻 13.900677652
+瞎说八道 12.5143832909
+世祖 9.91169360541
+亥猪 12.8020653633
+私怨 11.0103058941
+世界潮流 10.8096351986
+窍门 8.63281949291
+绿豆芽 11.4157710022
+不顾 7.3741827924
+对阵 9.36807815882
+汪荣华 12.8020653633
+不须 8.86372504956
+不顺 9.4233408375
+透风 10.1394775363
+公理会 12.8020653633
+安寺 12.8020653633
+五里店 12.5143832909
+酮康唑 11.9547675029
+藏踪蹑迹 13.900677652
+白狼王 11.9547675029
+想问 13.900677652
+肉食鸡 13.900677652
+邓岳 12.8020653633
+烦心 10.4666904475
+非法组织 13.2075304714
+擦屁股 11.3357282945
+沉舟破釜 13.900677652
+新疆维吾尔自治区 8.50251495046
+计生 10.0940151622
+猛打 10.4349417492
+命令提示符 13.2075304714
+猛扑 9.65218240993
+安定 7.72689154807
+深信不疑 9.84023464143
+看报 10.4041700905
+看护 10.1164880181
+科罗曼 13.900677652
+吴奇伟 13.2075304714
+安安 11.1280889297
+鲍彪 12.8020653633
+太累 9.22784881751
+空场 11.0103058941
+安宁 8.26232298264
+太紧 10.1871055853
+特丽丝 12.5143832909
+白滨 12.1089181827
+依恋 9.45802639549
+看押 11.598092559
+占民田 11.2616203224
+朽败 12.5143832909
+于亚述 12.1089181827
+铬酸盐 11.5027823792
+华族 12.5143832909
+西南 5.88766554161
+安家 9.77354326693
+安宫 11.1926274509
+掌叶大黄 12.8020653633
+压气 12.1089181827
+郭淮亦 13.900677652
+四十六个 12.2912397395
+安室 12.5143832909
+十五万 10.0088573539
+麒麟 9.22784881751
+两百箱 13.2075304714
+小道儿 13.900677652
+安塞 11.4157710022
+畸轻畸重 13.2075304714
+近场 13.900677652
+心狠手辣 10.5684731418
+白活 11.4157710022
+费迪南德 12.8020653633
+东北军 9.0884932966
+一首五 12.5143832909
+几起几落 13.900677652
+可防性 13.900677652
+落后地区 11.0103058941
+之能事 10.4041700905
+柏舟 13.900677652
+十五两 13.2075304714
+穆萨拉 13.2075304714
+灭鼠 11.2616203224
+酒桌上 11.4157710022
+白洞 12.5143832909
+十五个 10.2117981979
+布格河 12.2912397395
+保健 8.37522471284
+公子爷 11.5027823792
+白洁 8.89004235788
+引黄 9.6811699468
+太细 11.1926274509
+青龙河 12.1089181827
+白洋 11.7034530746
+真糟 13.2075304714
+对门 10.2371160058
+白海 10.8561552143
+稀有金属 9.33632946051
+维持现状 10.642581114
+燕地 11.598092559
+混淆黑白 12.8020653633
+赵鹏 10.8561552143
+逢场作戏 10.3453295905
+屈光度 12.2912397395
+金龟子 10.8561552143
+亲眼看见 9.18217878068
+白浮 11.9547675029
+刷去 12.2912397395
+宗子嗣 12.8020653633
+农牧厅 13.900677652
+佛山市 10.1871055853
+港大道 13.900677652
+清西陵 11.5027823792
+相见恨晚 12.2912397395
+单线铁路 11.8212361103
+保值 7.50208271744
+硝烟味 12.1089181827
+瓜藤 13.900677652
+白浆 11.9547675029
+白流 12.1089181827
+魔芋 9.89334446674
+托绍夫斯基 13.900677652
+安堡 13.2075304714
+蒙特卡洛 11.3357282945
+描眉画眼 13.2075304714
+达萨克 13.900677652
+郝洪 11.9547675029
+打下基础 9.93038573842
+亚种 9.19114745066
+瓜蔓 11.1280889297
+刷卡 9.62401153296
+八一镇 12.2912397395
+达浦生 12.8020653633
+腱鞘 12.5143832909
+八哥 9.09665660724
+深表谢意 13.900677652
+摸出 9.21854642485
+瞪目 11.4157710022
+根基 8.62767809341
+固体酒精 12.8020653633
+平形四边 13.900677652
+和琢玉 13.2075304714
+碳化铁 13.2075304714
+幻术 10.765183436
+亚科 8.71329184614
+商都网 9.75754292558
+李仙江 12.8020653633
+麻姑 11.2616203224
+资料性 12.1089181827
+普列汉诺 11.2616203224
+韩企先 12.5143832909
+黑客攻击 11.598092559
+湖北省委 12.1089181827
+摸准 11.7034530746
+借款者 11.8212361103
+对错 11.0103058941
+安士 12.8020653633
+免疫化学 13.900677652
+香港电影 11.5027823792
+指拨 11.598092559
+安徽师范大学 13.900677652
+文不加点 13.900677652
+触雷 12.8020653633
+穆利诺 12.8020653633
+盛况空前 10.6818018271
+江汉路 12.8020653633
+青龙江 12.8020653633
+劣迹 9.80633308975
+空吸 13.900677652
+比格尔 13.2075304714
+赐紫 13.2075304714
+植物纤维 10.4041700905
+自我介绍 10.642581114
+探路者 8.70772080109
+农牧区 10.4666904475
+骇然 10.0720362555
+古籍 8.46259834305
+李承晚 10.4349417492
+忠恳 11.8212361103
+光和热 11.5027823792
+炎黄 10.8096351986
+瓷釉 11.7034530746
+叩首 10.0940151622
+十五件 13.900677652
+监管部门 7.32003851469
+销出 12.8020653633
+坐车去 11.9547675029
+依据 6.2644080486
+凤仪亭 11.9547675029
+为国牺牲 11.9547675029
+高欢命 13.2075304714
+白水 10.1164880181
+讽刺作家 12.1089181827
+违章行为 13.2075304714
+碧水青山 13.2075304714
+马斯内 13.2075304714
+尉迟曜兼 12.8020653633
+探鱼仪 13.900677652
+施展才华 13.2075304714
+人体艺术 12.1089181827
+五步蛇 12.8020653633
+安奉 11.3357282945
+计程仪 12.8020653633
+赵鼎 13.2075304714
+瓜蒂 13.2075304714
+次男 13.900677652
+弓马 10.3743171274
+对比性 12.2912397395
+瓜蒌 12.2912397395
+逆定理 13.2075304714
+感觉器官 10.0088573539
+白气 10.5684731418
+安好 10.2371160058
+王汪古 13.2075304714
+彻头彻尾 10.3743171274
+俗谛 13.900677652
+保养 8.10158499752
+自我暗示 12.2912397395
+丘阿尔 13.2075304714
+杭方越 11.0674643079
+二十八九岁 13.2075304714
+北大方正 13.2075304714
+律己甚严 13.900677652
+不高 7.14490872999
+次生 8.80692745117
+逆转录酶 13.2075304714
+瞪眼 9.82314020807
+安多 11.1926274509
+蒲吾县 12.8020653633
+销假 13.2075304714
+埃姆努 12.5143832909
+学术团体 10.0294766411
+结起来 12.5143832909
+十五位 12.5143832909
+蠢动 11.8212361103
+古公后 12.8020653633
+安外 13.900677652
+指指 8.70772080109
+白汤 12.5143832909
+白池 12.8020653633
+李之龙 13.900677652
+河开成 13.2075304714
+于舰 13.900677652
+工艺性 11.9547675029
+柳堡 13.2075304714
+陈天华 11.0103058941
+挂下去 13.900677652
+富拉顿 10.8561552143
+贴出 10.0720362555
+流程图 11.2616203224
+空喊 13.2075304714
+储水瓶 13.900677652
+福利性 11.9547675029
+白江 13.900677652
+取巧 12.5143832909
+工具性 11.9547675029
+释道安 13.900677652
+中止犯罪 13.900677652
+圣雄 13.2075304714
+空喜 13.2075304714
+坐车到 13.2075304714
+指挥 6.03818045475
+不骑 11.9547675029
+星河湾 11.7034530746
+金龟婿 12.8020653633
+见缝插针 11.1926274509
+于祭仪 13.900677652
+安大 13.900677652
+和卫葑 11.8212361103
+声气相投 13.2075304714
+内迁 9.56994431169
+宗竟 13.2075304714
+女中豪杰 11.598092559
+白河 9.01787572939
+几内亚比绍共和国 13.2075304714
+十一篇 12.1089181827
+袁祖铭 13.2075304714
+保准 10.4041700905
+子密诏 13.2075304714
+土谢图汗 10.9562386728
+打量出 13.900677652
+滴血 10.4349417492
+信号传 12.2912397395
+燃料工业 12.2912397395
+大力协助 12.8020653633
+铁磁学 13.2075304714
+煎反 13.2075304714
+白沟 9.74179456862
+松子糖 13.2075304714
+白沙 9.53122979951
+真累 12.2912397395
+乐论 11.9547675029
+弗里西亚 12.1089181827
+什叶 12.8020653633
+科斯 10.0720362555
+战斗部 8.90346537821
+真紧 12.5143832909
+柳笛儿 12.2912397395
+大义灭亲 11.0674643079
+布琼尼 12.1089181827
+零星小雨 11.9547675029
+透骨 10.533381822
+白泽 12.8020653633
+却没能 10.7226238216
+妇女运动 11.598092559
+四十多架 13.2075304714
+依托 7.76295059789
+刷刷 9.5186510173
+近因 10.5684731418
+妇婴 11.1926274509
+红宝书 10.8561552143
+煦煦 13.2075304714
+白波 13.2075304714
+瓷都 11.0103058941
+幻景 11.598092559
+木器漆 13.900677652
+可问 11.5027823792
+酬报 11.5027823792
+再燃 12.2912397395
+缕缕 10.5684731418
+普渡 13.900677652
+梯级开发 10.2117981979
+指控 8.56313957227
+可闻 10.2897597393
+安妮 10.8561552143
+头上末下 13.900677652
+贴入 13.900677652
+眼镜片 11.8212361103
+芝山 12.5143832909
+安敢怀 13.2075304714
+美少年 11.1926274509
+三万五千余顷 13.2075304714
+梅花山 11.3357282945
+白猿 10.3171587135
+主动权 8.89004235788
+通城 11.598092559
+可言 8.76487921493
+两百斤 12.2912397395
+台湾岛 8.82550383674
+身子 6.23680039327
+专程前往 12.8020653633
+身孕 10.1394775363
+水蛇 10.5684731418
+三峡总公司 12.1089181827
+米喜子 12.8020653633
+皂甙 11.7034530746
+白猫 10.2630914922
+白猪 12.2912397395
+叶子奇 13.2075304714
+易元吉 13.2075304714
+取分 13.2075304714
+阈值 11.1926274509
+皮大衣 10.8561552143
+长豇豆 13.2075304714
+供房 11.9547675029
+东北侧 11.4157710022
+高志 12.8020653633
+风吹不动 13.900677652
+李浩培 13.2075304714
+突击队 9.04864738806
+罪不容赦 13.900677652
+格里茨 13.900677652
+贴付 13.900677652
+梁序昭 13.2075304714
+合霉素 13.900677652
+对读 13.900677652
+谢家骧 12.5143832909
+沙姆山 13.900677652
+谢家骥 10.9049453784
+十二三里 13.900677652
+名词术语 12.2912397395
+皮基氏 12.5143832909
+纠察队 10.3743171274
+物理奖 11.7034530746
+对词 12.2912397395
+古拉 12.1089181827
+对证 10.6818018271
+保举 10.1630080337
+尿石症 12.2912397395
+后玄武 12.8020653633
+美好世界 13.2075304714
+于阗文 11.598092559
+对话 7.45654639528
+黑雾 9.5186510173
+古拙 10.9562386728
+风烛残年 11.1280889297
+运动史 11.3357282945
+名士风流 13.900677652
+市场原油 11.5027823792
+身密 13.900677652
+但金富 12.8020653633
+升班马 13.900677652
+飒然 12.5143832909
+真成 11.5027823792
+满车 13.900677652
+寸步不让 11.5027823792
+贴上 9.91169360541
+房里呆 12.5143832909
+白环 12.2912397395
+信誉度 11.8212361103
+平方公尺 13.900677652
+古戎 12.8020653633
+保价 11.4157710022
+三十七文 13.2075304714
+擦粉 13.900677652
+麻醉剂 10.604840786
+下个月 9.89334446674
+邓尼 11.2616203224
+均匀分布 10.3453295905
+普照 11.2616203224
+亦不例外 12.2912397395
+邓茂七 11.598092559
+贴个 12.2912397395
+招兵买马 10.3743171274
+保鲜膜 12.2912397395
+何足忧 12.8020653633
+婚前 9.94943393339
+地飘散 11.9547675029
+烧饼油条 13.2075304714
+司法制度 10.8096351986
+供招 12.8020653633
+以卵敌石 13.900677652
+分离主义 12.2912397395
+爪甲 11.5027823792
+我校 11.9547675029
+制高点 8.90346537821
+白班 10.604840786
+太急 9.74179456862
+炮塔 7.8093677699
+于圣历 12.8020653633
+赵能 10.7226238216
+火箭学 13.900677652
+闻讯而来 11.7034530746
+北洋政府 8.9102450652
+压焊 13.900677652
+液化器 13.900677652
+滴露 13.2075304714
+李家顺 13.900677652
+踏实 8.43684584695
+保产 13.2075304714
+冬练三九 13.900677652
+身家 8.71329184614
+万三千户 13.2075304714
+保亭 12.2912397395
+玄德正 11.5027823792
+野战炮 11.7034530746
+三居室 11.7034530746
+丧家之狗 12.1089181827
+次次 11.5027823792
+植入 9.77354326693
+执行程序 10.9562386728
+保佑 8.37921673411
+值钱 8.47133202302
+引致 9.59661255877
+东北亚 9.98865464655
+老羞成怒 12.8020653633
+太难受 11.9547675029
+十宗 13.2075304714
+引自 10.7226238216
+男人篇 13.900677652
+保住 8.02014466558
+不明不白 9.69598503258
+谢温谕 13.2075304714
+假撇清 13.2075304714
+十宣 12.1089181827
+惊蜇 13.900677652
+宁夏城 12.8020653633
+百万美元 10.7226238216
+难以获得 10.7226238216
+太懒 13.900677652
+据理力争 10.3743171274
+石梓 12.1089181827
+九万大山 11.3357282945
+照直说 13.900677652
+滴雨 12.8020653633
+十家 7.44862869754
+蓝田城 13.2075304714
+升级换代 9.74179456862
+稀土金属 10.4349417492
+亚明 13.2075304714
+狐假虎威 10.7226238216
+贵阳市 9.98865464655
+灌肠 10.2117981979
+的话 4.89785357543
+婚变 11.9547675029
+胆管癌 12.1089181827
+惊倒 11.598092559
+杂乱不堪 13.900677652
+政务官 11.9547675029
+不能缓和 13.2075304714
+摸上 12.1089181827
+摸下 13.900677652
+其它 6.64649980552
+纵容 9.01787572939
+钱德拉 13.2075304714
+环境法 10.8561552143
+十五六 11.9547675029
+白牙 10.2897597393
+调过去 12.1089181827
+白牛 11.8212361103
+唐家湾 13.2075304714
+宗英雄 13.2075304714
+布尔什维 13.900677652
+干劲十足 13.900677652
+十对 13.900677652
+端平 11.3357282945
+白版 13.900677652
+其实 5.12760270066
+圣裔 12.8020653633
+天山山脉 9.94943393339
+小道人 12.8020653633
+销了 13.2075304714
+真挚 8.91707103027
+孤身只影 13.2075304714
+端庄 8.85725253506
+浙西平原 13.900677652
+嫩叶 10.0088573539
+金娃娃 13.900677652
+和衷共济 10.0088573539
+微分方程 8.64318227995
+白犬 12.5143832909
+杨匏安 12.8020653633
+太慢 9.6811699468
+第一顿 12.5143832909
+土洋并举 13.900677652
+吞云吐雾 11.8212361103
+遥遥相对 10.642581114
+低气压区 12.5143832909
+帮助者 13.2075304714
+其子 8.22392384971
+可设 11.7034530746
+白犀 12.5143832909
+由内而外 11.4157710022
+且末县 12.5143832909
+章平 13.900677652
+保修 10.765183436
+图书市场 12.5143832909
+辉煌成就 10.6818018271
+八点钟 10.9562386728
+豆粒 10.8096351986
+电荷转移 11.8212361103
+文史哲 11.4157710022
+豆粕 8.36728816325
+可诉 11.9547675029
+格里芬 13.2075304714
+白狼 9.94943393339
+信号兵 13.900677652
+贴体 11.9547675029
+保供 12.8020653633
+贴住 10.9562386728
+院长室 13.2075304714
+闪光盲 13.2075304714
+汤化裁 12.5143832909
+十字 8.73589167805
+浓妆艳裹 12.5143832909
+不落 9.7898037878
+豆粉 13.900677652
+一百二十一万 13.2075304714
+内德 13.900677652
+触角 8.62767809341
+白狐 11.9547675029
+农妇 11.0674643079
+副驾驶 10.3171587135
+楚州 10.4041700905
+街市 9.85762638414
+白狄 11.4157710022
+张俊美 13.2075304714
+左路传 13.2075304714
+销价 11.1280889297
+农八师 11.9547675029
+亚暴 11.9547675029
+触觉 9.65218240993
+可说 9.13850371718
+砸开 10.3453295905
+十五分 12.1089181827
+五四运动 8.49350588052
+庄上歇 13.900677652
+紫式部 11.2616203224
+孙祥 12.8020653633
+什么 3.5669023059
+纪登奎 13.2075304714
+瓷质 11.5027823792
+于圣克 13.2075304714
+诺斯罗普 10.604840786
+防风 9.7898037878
+穆萨维 12.2912397395
+惨变 11.3357282945
+丁阿姨 13.900677652
+班师回 10.2117981979
+徐名材 13.2075304714
+弓杠岭 12.8020653633
+洞萧 11.8212361103
+句法关系 13.900677652
+灭茬 12.1089181827
+利四民 12.8020653633
+文学名著 10.4349417492
+李官桥 12.5143832909
+喇嘛教徒 12.5143832909
+一千点 13.2075304714
+雷雨云 11.9547675029
+司母辛 13.900677652
+外汇资金 9.93038573842
+膨胀 7.55504129115
+可行 7.93453091285
+赵国荣 12.8020653633
+身处 8.7245279194
+物理学 7.23626863163
+收容遣送 12.8020653633
+身外 10.765183436
+集了 13.900677652
+真情 8.89673134603
+一个十二三岁 12.8020653633
+蜂拥 9.22784881751
+利奇尔 13.2075304714
+缓期 10.8096351986
+方便使用 12.8020653633
+真想 8.09554268306
+三十五六岁 12.1089181827
+对视 9.17328983326
+十声 12.5143832909
+格斯坦 13.2075304714
+圣诞 9.17328983326
+灵吉 11.1926274509
+对角 11.4157710022
+圣诗 12.2912397395
+结存额 12.8020653633
+势态 10.1164880181
+物理家 13.900677652
+平台 6.24434048555
+古怪 7.78038023302
+畏惮 12.8020653633
+挑逗性 12.8020653633
+灌药 11.9547675029
+亮堂 10.6818018271
+依缘 12.5143832909
+指给 10.6818018271
+大篇幅 11.7034530746
+廉洁 9.66657114738
+万众一心 11.1926274509
+圣托马斯 11.5027823792
+云霄县 12.8020653633
+人工费 12.5143832909
+河大桥 13.2075304714
+整风运动 10.0720362555
+紧急警报 11.5027823792
+冷飕飕 11.3357282945
+五盏 12.5143832909
+轻侮 12.2912397395
+十堰 10.9049453784
+发展潜力 8.65893063692
+益禄 13.2075304714
+真怪 11.7034530746
+真性 10.4041700905
+青花鱼 13.900677652
+蜂房 10.8561552143
+身姿 9.85762638414
+骇浪 13.2075304714
+贝塞麦 11.2616203224
+剧烈 6.99492437566
+牛乳 10.4349417492
+记叙体 13.900677652
+平姐姐 11.9547675029
+灭菌 10.4349417492
+婚假 12.2912397395
+宋军 8.27666014579
+光有 10.4349417492
+下岗人员 12.8020653633
+姚嫂 12.1089181827
+引航 12.5143832909
+持有者 9.25628675283
+岱山县 12.5143832909
+施京明 13.2075304714
+机动车辆 10.2630914922
+白燕 12.8020653633
+以法为教 11.8212361103
+亚斯 11.1280889297
+演化过程 10.0294766411
+百公斤 13.2075304714
+葫蔓藤 13.900677652
+古龙水 13.2075304714
+集为 11.598092559
+刚成立 10.1871055853
+指纹 10.0940151622
+安全性 8.02014466558
+十七级 13.2075304714
+被忽视 9.87532596124
+对襟 10.0940151622
+化工品 10.1871055853
+一千零五 13.900677652
+集中 5.24790516632
+角闪岩 11.1926274509
+现如今 10.0505300503
+说到就到 12.8020653633
+紧蹙 11.4157710022
+王镇恶 12.2912397395
+绳套 10.604840786
+婚内 12.8020653633
+快快活活 11.2616203224
+贺闯王 13.900677652
+调料瓶 13.900677652
+剧照 8.45394028031
+可以信赖 10.9562386728
+水溶性 9.61021821083
+赵范 12.2912397395
+弓虚 13.2075304714
+羊肚 11.0674643079
+依纳 12.8020653633
+反动集团 12.8020653633
+脑膜瘤 13.2075304714
+宝货 10.0940151622
+海事仲裁 12.2912397395
+识图 12.8020653633
+全体成员 10.1394775363
+阿堵物 12.8020653633
+依约 11.0674643079
+帕拉帕 12.8020653633
+真直 13.900677652
+历官太 12.1089181827
+非住宅 11.9547675029
+汉字改革 13.900677652
+依纪 12.5143832909
+酬应 12.5143832909
+十一月 7.75649201785
+股票行情 11.4157710022
+水虿 13.900677652
+笑纹 11.5027823792
+楼房 8.43684584695
+政策主张 11.3357282945
+金牌数 12.5143832909
+信号台 13.2075304714
+严格考核 11.7034530746
+九六年 13.900677652
+十一期 12.8020653633
+广曰征 13.2075304714
+云梦秦 10.2630914922
+其妻 9.6811699468
+景观设计 11.5027823792
+格里耶 12.2912397395
+蠢人 11.5027823792
+亿多亩 12.2912397395
+予取予求 13.900677652
+史奉使 13.2075304714
+刚柔并济 11.8212361103
+元法 11.1926274509
+蠢事 10.533381822
+织金县 13.900677652
+十五卷 10.8096351986
+人民文学出版社 10.1630080337
+摸清底细 13.2075304714
+剩余价值率 8.30596627237
+敢怒不敢言 11.4157710022
+民兵 8.01179969364
+石油资源 9.53122979951
+皂白 12.1089181827
+科技股 9.80633308975
+胡王 13.900677652
+赵荣 11.598092559
+吉力湖 12.2912397395
+狮泉 12.8020653633
+巩汉林 13.2075304714
+集体 6.39353657225
+司马懿料 12.8020653633
+宋兵 9.26594866375
+白炽 12.1089181827
+第五十五章 12.1089181827
+肉食者 13.2075304714
+顶起 11.4157710022
+白点 10.6818018271
+可要 8.37921673411
+后进生 12.8020653633
+真意 10.8561552143
+网络广告 12.1089181827
+梁家辉 12.8020653633
+按址 13.900677652
+鼎足而立 11.3357282945
+十多 10.9049453784
+十夜 13.2075304714
+浪迹天涯 11.4157710022
+古意 10.9562386728
+面目狰狞 10.9049453784
+化学界 12.2912397395
+广之旅 12.2912397395
+黄幸强 13.2075304714
+十大 6.59280487121
+十天 8.23771717184
+圣言 13.2075304714
+夏侯恩 13.2075304714
+引荐 10.0505300503
+豆绿 13.2075304714
+普特 10.2371160058
+帕拉库 13.2075304714
+十头 12.1089181827
+意见箱 13.900677652
+继电保护 11.0674643079
+手风琴 11.2616203224
+不虞 11.3357282945
+四十多篇 13.2075304714
+不虚 10.2630914922
+农牧业 8.44109213783
+对表 13.2075304714
+非关税 12.2912397395
+可视 9.62401153296
+集会 8.37522471284
+可观 8.089536659
+可见 6.42137801419
+生聚教训 13.900677652
+梁弄镇 13.2075304714
+亿多两 13.900677652
+十套 12.1089181827
+出生日期 11.2616203224
+白热 12.8020653633
+天诛地灭 11.0103058941
+配套技术 12.8020653633
+亿多个 13.900677652
+呼伦贝尔盟 10.1871055853
+中外运 12.5143832909
+做市商 10.7226238216
+汤显祖 10.2897597393
+棋手 10.604840786
+百分之十四 12.8020653633
+晋穆帝 11.8212361103
+格斯图 12.8020653633
+刷上 13.2075304714
+宋克 12.8020653633
+眼皮儿 11.0674643079
+婚典 13.900677652
+阮正隆 12.8020653633
+其外 10.6818018271
+卜地桓 13.2075304714
+成功之路 11.9547675029
+触诊 11.3357282945
+子弟兵 10.2897597393
+十一架 13.2075304714
+赦免 9.17328983326
+杜迁 9.84023464143
+运动型 10.2897597393
+胜算 10.3743171274
+火烛小心 13.2075304714
+不臭 12.5143832909
+白眼 9.7898037878
+南康江 12.8020653633
+弓腰 11.8212361103
+翻唱 13.2075304714
+不自 11.5027823792
+对边 12.8020653633
+赵萌 12.5143832909
+南美各国 12.2912397395
+计大妙 11.1280889297
+邹德华 13.900677652
+无精打采 9.82314020807
+缓慢 6.6493326686
+郑骞 13.2075304714
+架接 13.900677652
+身形 9.5186510173
+狗急跳墙 10.9562386728
+十座 12.1089181827
+冻裂 11.8212361103
+暗箭伤人 13.2075304714
+尉陈 13.900677652
+压电体 12.8020653633
+亮度 9.00283785202
+三番五次 10.2897597393
+身影 7.40089061132
+压痕 13.2075304714
+压痛 9.5186510173
+马望北 12.8020653633
+渔乡 13.900677652
+白眉 11.0103058941
+白看 12.5143832909
+获利盘 8.81308131674
+活便 13.2075304714
+懈弛 12.8020653633
+动员大会 11.0674643079
+流于形式 11.0674643079
+交通不便 9.96885201925
+老大哥 10.604840786
+杜月笙 11.598092559
+天放 13.900677652
+正确方向 11.0103058941
+卡内 11.8212361103
+百分之十八 12.8020653633
+百分之十六 11.9547675029
+特蕾西亚 11.5027823792
+嗨哟 12.8020653633
+司马召 13.2075304714
+蒙在鼓里 9.48183704418
+异性恋 12.1089181827
+对过 12.2912397395
+但金强 13.2075304714
+里静 11.8212361103
+倾陷 11.9547675029
+范汉杰 13.2075304714
+露白 13.900677652
+老林哥 9.77354326693
+闽南话 12.2912397395
+司马台 13.2075304714
+身心 8.43684584695
+豆科 9.62401153296
+出井 13.2075304714
+供暖 8.81927328699
+火箭式 11.1926274509
+微贱 10.765183436
+牛宰马 10.4994802703
+迁延观望 12.8020653633
+圣贤 9.44633035572
+褶皱 7.93967231235
+钱之江 7.45654639528
+十九具 12.5143832909
+吉赛尔 11.4157710022
+医卫 13.2075304714
+剧目 8.3285236198
+斜纹 10.3453295905
+豆种 13.900677652
+额上 9.34680076038
+国语日报 13.900677652
+合速度 13.900677652
+空乏 13.2075304714
+可身 13.900677652
+空义 13.2075304714
+继承人 8.53003962385
+豆秸 13.2075304714
+强力胶 13.900677652
+十席 12.2912397395
+黄雀在后 12.2912397395
+真是 5.6767822718
+运动场 9.85762638414
+空乘 11.4157710022
+邵东县 13.2075304714
+香橙 13.2075304714
+第十九届 11.598092559
+黑克勒 13.2075304714
+古昔 12.8020653633
+掌子面 10.604840786
+火箭弹 9.01787572939
+空中 6.54121001372
+看管 8.93783302172
+十幅 11.8212361103
+对转 13.2075304714
+白石 9.80633308975
+白矾 11.3357282945
+氨纶 9.36807815882
+玄德视 11.9547675029
+玄德便 11.7034530746
+百分之十几 12.1089181827
+耐读 13.900677652
+哈特 9.93038573842
+不脱 9.11318590919
+遽闻 13.900677652
+压电 9.87532596124
+卫气营 11.7034530746
+许作梅 10.2897597393
+摘取 10.4041700905
+格莹莹 13.2075304714
+空串 13.2075304714
+于云中 13.2075304714
+电子管厂 12.2912397395
+船边 10.4666904475
+那老龙 11.9547675029
+幸福 6.808103936
+南康河 13.900677652
+霜花 11.0674643079
+窦叔蒙 13.2075304714
+轻俏 11.7034530746
+足球之乡 13.900677652
+五百余年 11.5027823792
+谱仪 11.2616203224
+行业资讯 13.900677652
+王军霞 12.8020653633
+十年 6.40125436138
+光明正大 9.94943393339
+踏得 10.9562386728
+如能 8.9308643524
+工具箱 11.5027823792
+宿一 10.8561552143
+俩双双 13.900677652
+真果 12.2912397395
+项圣谟 12.8020653633
+太旺 12.5143832909
+贝勒寨 13.2075304714
+绿林中 10.4994802703
+反封建 8.85725253506
+发行股票 7.90671622467
+风狂雨骤 12.8020653633
+光学设备 12.5143832909
+太早 9.12999302751
+赖大之 13.2075304714
+不能 3.9901648345
+太旧 11.598092559
+踏平 10.7226238216
+弱市中 13.2075304714
+优良 7.08394177138
+娼妇 10.9562386728
+孟德尔 10.2630914922
+甄子丹 10.8096351986
+五十余 10.3743171274
+交际圈 13.900677652
+展露出来 13.2075304714
+阴维脉 12.5143832909
+真枪 13.2075304714
+不胜 8.13548654919
+摘到 12.5143832909
+拔管 13.900677652
+牛仙 13.2075304714
+婉约 10.2897597393
+古柯 11.5027823792
+奉为圭臬 12.1089181827
+永锡 13.2075304714
+上万公里 13.900677652
+白白 8.83177344976
+蓝田县 11.0103058941
+不肯 6.03204075779
+足窍阴 13.2075304714
+于亚非 12.8020653633
+医务 10.1394775363
+王庆那 13.2075304714
+小狐 13.2075304714
+不育 8.98802276624
+看稿 13.2075304714
+缓急 9.98865464655
+布罗伊尔 12.1089181827
+研发部门 12.1089181827
+鲍罗廷 10.533381822
+井然有条 13.2075304714
+卡兰 12.5143832909
+指示 7.01516798194
+代取 13.900677652
+商务部 7.31312763715
+不肖 9.82314020807
+物理层 11.3357282945
+民风 10.2897597393
+张正明 11.3357282945
+脑膜炎 10.1394775363
+小有成就 13.900677652
+古本 10.4349417492
+郑州路 12.2912397395
+耳旁风 11.4157710022
+古木 10.2630914922
+出门子 12.1089181827
+卡其 11.598092559
+克雷莫纳 12.5143832909
+供果 11.9547675029
+非我所愿 13.2075304714
+阿儿浑 13.2075304714
+真有 7.73106691948
+识假 13.2075304714
+古朴 9.04086524761
+白皮 11.4157710022
+水蜂子 12.8020653633
+空位 10.1630080337
+远距离 8.65365357982
+拉登 10.8561552143
+古月 13.2075304714
+可辨 9.94943393339
+白皙 9.74179456862
+熟语 13.2075304714
+芦州 13.900677652
+可达 6.42533841541
+杨霹雳 13.2075304714
+化工厂 9.40086798165
+空余 10.9049453784
+白底黑字 12.1089181827
+弓背 11.7034530746
+长江上游 9.38981814546
+十强 10.8096351986
+圣谕 10.0720362555
+卓按剑 13.2075304714
+太政 11.7034530746
+笑破 13.900677652
+可过 11.3357282945
+军功章 11.4157710022
+古来 9.37888907493
+索斯比 13.900677652
+白相 11.7034530746
+中关村 9.48183704418
+高欢亲 13.2075304714
+古松 10.0720362555
+古板 10.8561552143
+可进 11.3357282945
+汗斑 13.2075304714
+煤炭企业 9.22784881751
+义马市 12.8020653633
+法国队 11.2616203224
+调查结果 8.86372504956
+不耻 12.2912397395
+可运 13.900677652
+白盔 13.2075304714
+彻底改变 9.74179456862
+不老 10.5684731418
+锃亮 10.4994802703
+不考 12.1089181827
+如臣 12.5143832909
+计测 13.900677652
+农夫 9.30555780184
+了不得 8.88339781516
+不耐 9.62401153296
+随处可见 9.77354326693
+加金紫 13.900677652
+毛南语 12.5143832909
+眼镜框 12.8020653633
+陈永孝 10.2630914922
+十岁 8.79473217808
+田径场 11.4157710022
+白甲 11.598092559
+分别部居 13.2075304714
+楼板 9.59661255877
+可调 9.48183704418
+近似 7.69410172525
+防化服 12.2912397395
+酬答 11.0674643079
+棋枰 11.4157710022
+不菲 9.38981814546
+有令不行 12.1089181827
+木质部 9.7898037878
+可谓 7.08284708052
+腾格里 10.9562386728
+卫星镇 12.5143832909
+昆河 11.5027823792
+下海经商 13.2075304714
+张秀寅 12.5143832909
+不足取 10.9562386728
+麻醉品 12.8020653633
+反映出 13.900677652
+换帖 12.8020653633
+猛禽 10.1630080337
+炮座 11.8212361103
+落入俗套 12.2912397395
+量产 9.45802639549
+宗敏见 12.8020653633
+未感染 13.2075304714
+闯世界 11.9547675029
+意兴索然 13.900677652
+与世隔绝 9.48183704418
+跷了 13.2075304714
+端头 12.8020653633
+王光英 13.2075304714
+形而上学 9.00283785202
+灭蝇 13.2075304714
+潜水表 12.5143832909
+啧啧声 13.2075304714
+对路 11.7034530746
+打闷葫芦 13.900677652
+冰厂 12.5143832909
+丁未 12.1089181827
+拍桌子 9.72629038208
+段正坤 12.8020653633
+传递信息 9.98865464655
+刚回来 10.8096351986
+浅部微 12.5143832909
+马中锡 12.1089181827
+使者 7.87723005901
+伊德里西 12.5143832909
+立统军 13.2075304714
+柏森森 12.2912397395
+阿姆斯特 13.900677652
+贝纳文 13.2075304714
+摊下 13.900677652
+太暗 11.0103058941
+近作 12.2912397395
+霸王别姬 11.1926274509
+假大空 12.8020653633
+临界态 12.8020653633
+暖寿 12.5143832909
+攻城略地 10.5684731418
+鹊山 10.2371160058
+对质 10.8561552143
+婚后 8.74738605748
+克林德 12.5143832909
+八角帽 12.8020653633
+计温 13.900677652
+白疼 12.2912397395
+第一书记 9.18217878068
+医典 11.4157710022
+棋术 12.1089181827
+近便 12.5143832909
+对账 11.598092559
+极限速度 12.2912397395
+狄奥倪 13.2075304714
+神龙教 13.900677652
+花生豆 12.2912397395
+压着 9.18217878068
+笑答 11.1926274509
+太晚 9.31571017331
+贾鲁修 12.8020653633
+液晶彩电 13.2075304714
+赐教 10.1394775363
+森林学系 13.900677652
+穷途 13.2075304714
+单体单元 13.900677652
+如花 10.8561552143
+柯象峰 12.8020653633
+指端 11.4157710022
+向小建 13.2075304714
+马德堡 12.5143832909
+近侍 9.66657114738
+穷通 11.2616203224
+取得成效 11.3357282945
+十层 12.1089181827
+激发极化 13.900677652
+贾府园 13.2075304714
+司马光 9.59661255877
+十届 10.0294766411
+繁华世界 13.900677652
+内在性 11.8212361103
+新闻记者 9.98865464655
+出量 13.900677652
+白痢 12.8020653633
+瓦利拉 12.8020653633
+对起 13.2075304714
+水液 10.642581114
+笑笑 7.75007488353
+如若 8.74738605748
+司马公 11.9547675029
+慧剑 9.12155415886
+中国地图出版社 12.5143832909
+望顾荣 12.1089181827
+角落里 8.69119149913
+变换编码 12.8020653633
+摘出 11.598092559
+对赛 11.9547675029
+欧阳询 10.8561552143
+俞康宰 9.4233408375
+太昊 11.1280889297
+抗艾滋 13.900677652
+壕沟战 13.900677652
+罪不容诛 10.9562386728
+不若 9.80633308975
+古斯 10.4349417492
+普益 10.1164880181
+不苦 11.3357282945
+加西亚 10.8096351986
+身居 9.82314020807
+人心涣散 10.9562386728
+开启 7.77599426108
+光荣传统 10.8096351986
+华歆 10.9562386728
+古方 11.8212361103
+理财师 9.21854642485
+高小 11.7034530746
+激光遥感 13.900677652
+辞类 12.1089181827
+古斋 12.1089181827
+近世 10.0940151622
+偏僻地区 11.598092559
+古文 8.6966709649
+法螺 11.5027823792
+近东 10.0505300503
+如茵 13.2075304714
+门急诊 10.5684731418
+宗喀巴 10.0720362555
+不苟 11.2616203224
+瞎了眼 10.1394775363
+一万二千里 12.8020653633
+内庭 11.5027823792
+投壶 12.1089181827
+七八十棵 13.900677652
+两百拳 13.900677652
+一二片 13.2075304714
+闪光灯 10.5684731418
+玄德久 12.8020653633
+野上 12.8020653633
+优者 12.2912397395
+十五块 11.4157710022
+安提丰 13.2075304714
+不花 9.55687223012
+看破 10.4349417492
+古时 8.38322475551
+高加索 8.80692745117
+厦航 13.2075304714
+可赔 13.900677652
+并列第一 12.8020653633
+中国食品工业协会 13.2075304714
+铨叙 11.9547675029
+文化用品 11.8212361103
+泊位 9.03314320152
+易其疆 13.2075304714
+张氏医通 13.900677652
+李成梁 10.8561552143
+灭虫 11.5027823792
+主动性 8.60737282725
+同心圆 10.533381822
+土壤生物 12.1089181827
+真早 13.2075304714
+秦二州 12.8020653633
+太极 9.15574552361
+近乎 8.28027678626
+近亲 9.56994431169
+溜子 10.8096351986
+五矿 9.63799777493
+露相 12.8020653633
+不良 7.70219893548
+昆洛 11.9547675029
+孙师傅 11.5027823792
+胆管炎 13.2075304714
+依稀 9.20019728618
+海湾战争 9.16447920358
+操自引 12.1089181827
+闪光点 12.8020653633
+对谈 13.900677652
+匹夫之勇 11.5027823792
+靠点 13.900677652
+习惯成自然 12.2912397395
+中下层 10.0294766411
+核苷酸 10.0940151622
+对调 11.9547675029
+猛砸 10.8561552143
+剧痛 9.58318953844
+广播电影电视部 12.1089181827
+倩女离魂 11.7034530746
+王辟光 12.1089181827
+炮弹 7.62028181302
+批起 13.900677652
+秦皮 12.8020653633
+后现代主义 11.4157710022
+照常进行 11.3357282945
+近于 8.93783302172
+魔鬼 8.65365357982
+城里人 9.02548032877
+忘乎 12.1089181827
+对象 5.89898767388
+亿万户 13.2075304714
+巴雅西 13.900677652
+杂活儿 13.2075304714
+烁金 13.900677652
+毫无作用 11.8212361103
+近代 6.54375940962
+运动员 7.68606955355
+八角形 10.3453295905
+痞块 11.9547675029
+穷酸 10.6818018271
+一月份 11.4157710022
+不舍 9.71102290995
+糨子 12.8020653633
+真数 12.5143832909
+孙明瑾 13.900677652
+伊兹梅 13.900677652
+太有 10.2630914922
+优育 13.2075304714
+桐乡县 11.9547675029
+识别 7.6468488404
+看碟 13.900677652
+真敢 11.0103058941
+迪乌夫 12.2912397395
+关税同盟 10.533381822
+汉字学 13.2075304714
+非凡地 13.900677652
+通讯卫星 12.5143832909
+柴油机 7.95525704337
+贵极人臣 13.900677652
+热闹非凡 10.2371160058
+弓起 11.4157710022
+薏苡 11.8212361103
+高其佩 11.7034530746
+道衣 12.8020653633
+莫哭 10.9562386728
+庾亮 10.765183436
+特征方程 12.2912397395
+摘引 11.0674643079
+白笔 13.900677652
+令人满意 9.33632946051
+看着 5.41849006976
+皂素 13.2075304714
+宝珍斋 13.2075304714
+变味儿 13.2075304714
+匈牙利 7.90422556336
+缨子 11.598092559
+须依 12.1089181827
+砍出去 13.900677652
+车伊洛 13.2075304714
+喷射器 11.4157710022
+婚媾 12.8020653633
+不跑 11.1926274509
+数字滤波 12.5143832909
+安乡 11.1926274509
+那琴造 13.900677652
+大跃进 9.63799777493
+魔铃 13.900677652
+化学纯 12.5143832909
+安丘 12.1089181827
+一碗水端平 12.1089181827
+安业 12.2912397395
+医德 11.1280889297
+安东 9.65218240993
+三板斧 12.2912397395
+流星掣电 13.900677652
+履约 9.6811699468
+用电器 12.8020653633
+婚嫁 9.91169360541
+安世 11.9547675029
+安上 10.5684731418
+不足 5.71282220828
+永远的痛 12.2912397395
+核设施 11.8212361103
+自激振荡 12.1089181827
+丛玫瑰 13.900677652
+摘录 9.94943393339
+钉尖 13.900677652
+王登天 12.8020653633
+看看 5.41044464214
+安丰 10.765183436
+赵衰 11.9547675029
+幸甚 10.3453295905
+线头儿 13.2075304714
+四百余种 13.2075304714
+打点滴 13.900677652
+渍涝 12.5143832909
+四十种 13.2075304714
+海上花 13.900677652
+荡然无存 9.7898037878
+公买公卖 13.2075304714
+强将手下无弱兵 12.8020653633
+白箱 13.900677652
+至尊无上 12.5143832909
+后勤机关 11.9547675029
+脑啡肽 13.900677652
+赐死 9.80633308975
+猛省 10.9562386728
+涌来 9.75754292558
+身强力壮 10.604840786
+十则 11.4157710022
+玄猿 11.7034530746
+李子花 12.2912397395
+摘得 10.4041700905
+高屏 13.2075304714
+私会 12.2912397395
+安份 13.900677652
+不赀 12.5143832909
+朱拜尔 13.900677652
+老寿星 11.1926274509
+历朝均 13.900677652
+三点式 11.1280889297
+李蒙 12.5143832909
+古樟 12.8020653633
+中国电力企业联合会 12.8020653633
+不赖 10.3743171274
+投石问路 11.9547675029
+亮到 13.2075304714
+闲言闲语 12.8020653633
+婚娶 10.4349417492
+不败 9.62401153296
+身历 13.2075304714
+在理儿 12.8020653633
+朝欢暮乐 13.2075304714
+传播价值 13.900677652
+摘心 12.5143832909
+纵列 10.7226238216
+驾去 13.2075304714
+程喜霖 12.2912397395
+计息 9.25628675283
+不贵 9.75754292558
+妇炎洁 13.2075304714
+傅宅 13.2075304714
+不贰 12.5143832909
+疑心病 13.2075304714
+安于 10.642581114
+来者不善 10.5684731418
+纵切 12.2912397395
+四夜 11.8212361103
+不费 9.85762638414
+安了 10.642581114
+金属陶瓷 11.4157710022
+滴眼剂 13.900677652
+安人 12.1089181827
+我怕 8.23771717184
+滴鼻 11.2616203224
+防盗器 13.900677652
+史家庄 11.9547675029
+运动学 10.3171587135
+三四千里 13.900677652
+须作 12.8020653633
+安享 10.765183436
+砂磨机 13.900677652
+安亭 11.8212361103
+昼伏夜出 10.8561552143
+不负 8.71329184614
+不贞 11.2616203224
+韩当 10.2897597393
+细菌性 10.0088573539
+杏仁核 13.900677652
+十五处 13.2075304714
+赔钱货 13.900677652
+和隐逸 13.2075304714
+格斯尔 12.5143832909
+造纸厂 9.69598503258
+古殿 12.2912397395
+赦宥 11.5027823792
+不可究诘 13.2075304714
+斯三世 12.1089181827
+对花 12.5143832909
+水涡 12.5143832909
+十五夜 12.2912397395
+桑德尔 12.5143832909
+老调重弹 11.0103058941
+安享清福 13.2075304714
+中国塑料 12.2912397395
+十五大 10.4349417492
+灌装 11.9547675029
+西格蒙德 13.900677652
+老大妈 13.2075304714
+陕西省政府 13.2075304714
+十五天 11.1926274509
+蕙兰 12.8020653633
+勤劳致富 12.2912397395
+蓄须 12.8020653633
+摘帽 9.98865464655
+婚宴 10.1630080337
+须予 12.5143832909
+引见 9.65218240993
+杨龙 13.2075304714
+低档车 13.900677652
+颠颠 11.1280889297
+酒吧女 13.900677652
+身分 7.40843781696
+注重事实 12.8020653633
+赵汝适 11.8212361103
+清迈府 13.2075304714
+下联 10.3171587135
+安众 12.2912397395
+起航 10.0720362555
+十发 11.598092559
+涞源县 11.9547675029
+图格里克 13.900677652
+多管齐下 11.5027823792
+庾信 11.598092559
+基地化 13.2075304714
+邻苯二酚 11.7034530746
+高车山 12.1089181827
+踏到 12.1089181827
+沿路 9.23723855786
+白穗 13.2075304714
+统战部 10.604840786
+指甲 8.53003962385
+卑俗 13.2075304714
+节约型 11.7034530746
+白尚相 13.900677652
+十只 9.84023464143
+指画 11.0103058941
+后天性 10.9049453784
+麻丝 12.8020653633
+缓气 13.2075304714
+围护结构 11.7034530746
+片甲不回 11.4157710022
+壁垒 8.89673134603
+亚太经合组织 9.5062284973
+十号 12.2912397395
+莅临 10.3743171274
+光闪闪 10.0294766411
+杜普勒 13.2075304714
+楼栋 12.2912397395
+宣三朝 13.2075304714
+指用 10.2371160058
+老滑头 11.9547675029
+安保 9.71102290995
+资金外流 11.5027823792
+司马师 10.1394775363
+正常人 8.79473217808
+三百五百 12.8020653633
+皂粉 13.900677652
+急需资金 12.2912397395
+柳州地区 11.7034530746
+依理 12.5143832909
+桑德岛 13.900677652
+僧众 10.1871055853
+出世离群 13.900677652
+樵采 11.8212361103
+看相 10.2897597393
+眼皮子 9.87532596124
+曹国伟 10.9562386728
+五百余匹 12.8020653633
+魔镜 12.5143832909
+一百二十四卷 12.5143832909
+旅居海外 12.1089181827
+国防科工委 11.3357282945
+圣者 11.1280889297
+任为卿 12.8020653633
+满足用户要求 13.900677652
+立原山 13.2075304714
+麻仁 12.1089181827
+豆瓣 11.1280889297
+斥候 11.598092559
+踏勘 10.9049453784
+安信 8.70218062071
+虑无不周 13.900677652
+坐月子 9.84023464143
+有恩利 13.900677652
+托塞尼 13.900677652
+没门儿 12.2912397395
+十十 13.900677652
+大前天 11.2616203224
+谬种 12.2912397395
+漏进来 13.900677652
+笑琴 12.8020653633
+上吊自杀 11.8212361103
+密山 11.598092559
+白竹 13.2075304714
+亲家翁 11.8212361103
+吓不倒 11.9547675029
+渍水 11.598092559
+甄少爷 13.2075304714
+或于 11.5027823792
+薛文起 13.2075304714
+压破 12.2912397395
+楼梯 8.12923652885
+休养所 12.5143832909
+幻灯 11.1926274509
+秦益 13.2075304714
+幻灭 10.4041700905
+古歌 11.7034530746
+试衣间 13.900677652
+真死 12.5143832909
+不调 10.7226238216
+圣职 11.3357282945
+白满仓 13.900677652
+不谈 8.79473217808
+不谋 11.5027823792
+被调查者 10.7226238216
+十卷 9.89334446674
+真武 11.598092559
+医师 8.94485059437
+真正 5.29583995071
+炮兵 7.96314144689
+甜酸苦辣 12.8020653633
+帝国主义 7.21982297319
+长远打算 12.2912397395
+蜒蚰 13.2075304714
+会做人 13.2075304714
+溜回 11.9547675029
+踏入 9.7898037878
+可考 10.5684731418
+眼镜架 12.8020653633
+速决战 11.4157710022
+化学系 9.80633308975
+七八十斤 12.5143832909
+医工 12.5143832909
+大雅之堂 11.4157710022
+童自荣 13.900677652
+张骞入 13.2075304714
+一千碗 13.900677652
+茶余饭后 11.0103058941
+冉细丛 13.2075304714
+不过 4.24571556336
+碉楼 11.598092559
+装卸车 13.2075304714
+古梅 12.8020653633
+芬兰语 11.8212361103
+米输纳 13.2075304714
+李春润 12.5143832909
+滤过性病 13.2075304714
+可耻 9.38981814546
+军事法庭 9.82314020807
+不远 7.06549306583
+不迟 8.40761620864
+不进 8.80081122415
+身兼 10.4349417492
+古森 12.8020653633
+工艺画 12.5143832909
+发展经济学 11.5027823792
+今运河 13.2075304714
+南北移动 11.9547675029
+热电站 10.4349417492
+陈王廷 13.900677652
+聊上 12.2912397395
+起舞 9.5062284973
+圣菲 11.8212361103
+供案 13.2075304714
+菜蔬 9.72629038208
+圭多 12.5143832909
+长足发展 10.0940151622
+克拉索夫 11.4157710022
+优质 6.73441167784
+荣禄你 13.2075304714
+做东道 13.900677652
+不辍 10.604840786
+在所不辞 11.3357282945
+尚书府 13.2075304714
+转移阵地 12.1089181827
+文丘里 12.1089181827
+勤学好问 13.2075304714
+四十篇 12.8020653633
+不输 10.7226238216
+蛔虫药 13.900677652
+程伯休 12.1089181827
+不辞 10.2897597393
+台湾独立 12.1089181827
+亚洲 5.92031188686
+黑克尔 12.2912397395
+玄德亲 13.2075304714
+狄奥尼 12.1089181827
+谢大帅 12.8020653633
+宣花斧 12.8020653633
+深圳市人民政府 11.0674643079
+十倍 8.66956903512
+不轨 10.8096351986
+指盘 12.5143832909
+古格 10.4994802703
+马德吉 13.900677652
+踏出 10.2897597393
+景教僧 13.2075304714
+恩平市 13.900677652
+两性离子 13.2075304714
+邱少云 11.8212361103
+不轻 8.98802276624
+奴颜媚骨 13.2075304714
+真格 11.9547675029
+猛男 12.8020653633
+自扩散 13.2075304714
+看病 8.35941410682
+阎罗 10.1164880181
+透过 7.62403416263
+否定一切 12.1089181827
+波嘉尼 13.2075304714
+婉然 13.900677652
+计成 9.65218240993
+起运港 13.900677652
+透进 11.1926274509
+却译成 13.900677652
+芦勇 13.900677652
+聊以 11.2616203224
+光阴似箭 12.1089181827
+比例失调 10.604840786
+粉妆玉琢 12.5143832909
+炮制 9.75754292558
+古树 9.53122979951
+优越 7.68407155089
+细菌战 11.3357282945
+可背 13.900677652
+圣药 13.900677652
+七鳃鳗 11.4157710022
+易升华 12.1089181827
+贸工部 13.2075304714
+笑眼 11.8212361103
+剪影 11.0674643079
+普通高中 11.8212361103
+待价而沽 11.5027823792
+美国法院 11.598092559
+和碧初 11.1926274509
+实底 12.2912397395
+产前诊断 11.0103058941
+雅趣 11.598092559
+霍峻守 12.8020653633
+戴安澜 11.2616203224
+纵倾 12.5143832909
+吻痕 13.900677652
+汉志省 12.8020653633
+马尔索 12.5143832909
+千呼万唤 10.6818018271
+曝气池 13.2075304714
+释道三 11.9547675029
+透辟 11.9547675029
+可能 3.74802798573
+领导集体 10.604840786
+翰林院 8.30596627237
+白秀 13.2075304714
+白种 11.598092559
+尼古拉耶夫 11.8212361103
+持续音 12.5143832909
+高桥虫麻 13.2075304714
+引言 10.4349417492
+古桐 12.8020653633
+剪彩 10.4994802703
+三分法 12.2912397395
+博尔塔拉 11.7034530746
+硅酸钠 11.1926274509
+赫斯 10.8561552143
+勇于进取 11.9547675029
+十册 12.8020653633
+壳牌石油公司 12.1089181827
+巴蒂安 13.2075304714
+指着 6.74606229506
+十军 12.1089181827
+二龙路 13.900677652
+存亡之际 13.900677652
+经验总结 10.9049453784
+金玉其 13.900677652
+关了机 13.900677652
+失足青年 12.5143832909
+治外法权 10.533381822
+比比划划 11.2616203224
+闵园竹 12.5143832909
+九一八 10.8096351986
+斥力 11.3357282945
+任何一方 9.66657114738
+弗洛拉 13.900677652
+引证 10.2897597393
+万无 12.5143832909
+硅酸钙 12.8020653633
+刘永成 12.8020653633
+摆阔气 12.8020653633
+引论 10.8561552143
+剧社 10.1630080337
+恨金莲 13.2075304714
+库洛赫 11.1926274509
+胬肉 13.2075304714
+石景山游乐园 13.900677652
+一般来讲 11.1926274509
+蜂毒 11.9547675029
+完全避免 11.598092559
+叩谢 10.3453295905
+灯蛾扑火 13.900677652
+那笛声 12.5143832909
+看球 12.2912397395
+十几 9.30555780184
+海贼 12.8020653633
+其内 8.9519177616
+炮口 9.65218240993
+历劫 12.5143832909
+供楼 12.2912397395
+计提 9.19114745066
+亮出 9.72629038208
+李祖 13.900677652
+婚姻 7.16252515738
+炮台 8.59737274392
+硅酸铝 13.2075304714
+最高价 8.56795885871
+踏倒 11.4157710022
+古槐 11.0103058941
+练瑜伽 12.5143832909
+易宪容 10.4666904475
+第十九卷 10.642581114
+芦叶 12.1089181827
+欢跳 12.5143832909
+橙汁 10.765183436
+佩尔狄 13.2075304714
+每顿饭 11.0103058941
+公卿之 12.8020653633
+急躁情绪 13.2075304714
+铁磁体 11.0103058941
+要付 10.8096351986
+非到 11.9547675029
+婚外 13.2075304714
+汗毛 9.85762638414
+太正 12.8020653633
+强弓射 13.2075304714
+缓滞 13.2075304714
+力量之源 12.5143832909
+其先 11.2616203224
+佛像 8.38724890581
+表面性 13.900677652
+完扬声 13.2075304714
+驴驹 13.2075304714
+十五家 11.9547675029
+富比王侯 13.2075304714
+七百年 11.9547675029
+家庭手工 13.900677652
+内边 12.2912397395
+亮儿 12.2912397395
+剧种 9.02548032877
+亚泰 11.5027823792
+神祭 13.900677652
+亮光 8.85082164473
+十元 10.2117981979
+无情打击 11.8212361103
+步辇图 11.5027823792
+宏伟事业 12.2912397395
+英国广播公司 10.8561552143
+帕姆帕斯 13.2075304714
+古楼 11.7034530746
+赵评 13.2075304714
+海事法 12.8020653633
+太次 13.2075304714
+帕拉图 13.900677652
+一千二百多种 13.2075304714
+轮下来 13.900677652
+哥哥妹妹 12.5143832909
+十全 11.0103058941
+十八 7.97909923233
+十六 7.58531965045
+搭船 11.5027823792
+常东 13.900677652
+负荷量 12.5143832909
+赵诩 12.1089181827
+十具 12.2912397395
+打扮起来 11.9547675029
+祖大典 12.5143832909
+绥中县 12.5143832909
+对联 8.41173992582
+鳞介 12.5143832909
+杭嘉湖 9.75754292558
+天下一家 12.1089181827
+李嫂子 12.5143832909
+不解 7.8093677699
+婚庆 10.2630914922
+凑拢 11.8212361103
+胜率 11.9547675029
+民事行政 13.900677652
+要塞区 11.8212361103
+论调 9.98865464655
+不见 6.17844290727
+李家钰 12.8020653633
+尸骨未寒 12.1089181827
+人际交往 11.1280889297
+不觉 7.0080360108
+斥喝 13.900677652
+传遍全国 11.9547675029
+蒙特卡罗 11.7034530746
+等闲视之 11.1280889297
+星毛虫 13.900677652
+其四 9.6811699468
+乱葬 10.604840786
+顶下去 13.900677652
+如血 11.0103058941
+医家 9.89334446674
+桑德奇 13.900677652
+炭块 11.9547675029
+十五届 10.1871055853
+赫然在目 11.4157710022
+批判 7.05799436974
+却浑然 13.900677652
+砍来砍去 13.900677652
+轻装师 13.900677652
+十四 7.19503855712
+地久天长 12.8020653633
+可虑 10.5684731418
+十回 11.598092559
+昆曲 9.33632946051
+不分性别 12.5143832909
+不要 4.8929431801
+李世民 9.21854642485
+古滇 12.8020653633
+断头台 10.4349417492
+身在 9.14708746087
+如表 11.0103058941
+双面绣 12.5143832909
+汗水 8.39128931535
+太沉 10.8561552143
+猫儿眼 11.8212361103
+至意 12.8020653633
+十国 10.1394775363
+杏仁油 13.900677652
+十五岁 9.19114745066
+白羽 10.7226238216
+到头来 8.51160592216
+桑木 12.8020653633
+巴蒂尔 11.4157710022
+武疆氏 13.900677652
+纽约爱乐乐团 11.9547675029
+民航总局 11.2616203224
+医学 7.02854955064
+江右湖 13.2075304714
+机械局 13.2075304714
+昆明 7.55504129115
+早些时候 9.28555713513
+训导主任 13.900677652
+依然 5.5301300409
+甜玉米 13.2075304714
+透视 8.80692745117
+颁赏 12.5143832909
+述略 13.2075304714
+落荒而逃 10.2897597393
+台司勋 12.8020653633
+剧组 10.2371160058
+端去 11.9547675029
+工业部门 7.73947033028
+黄淮地区 11.8212361103
+胡格尔 13.2075304714
+代办 9.5186510173
+朱亚 9.56994431169
+压紧 11.4157710022
+各河 9.61021821083
+无论谁 10.9049453784
+帕西班 13.900677652
+候风地动仪 11.0674643079
+成效显著 11.3357282945
+张鲁欲 13.2075304714
+面店 12.8020653633
+司马孚 12.8020653633
+蒙恩泽 13.2075304714
+天然煤气 13.900677652
+广播讲话 11.4157710022
+发邮件 11.8212361103
+麻醉师 12.2912397395
+亿光年 11.5027823792
+端口 10.1871055853
+指点 8.06294720481
+出远门 10.604840786
+依照 7.6604018068
+顺应时势 12.1089181827
+与会代表 11.0674643079
+别尔克 13.900677652
+图形用户界面 13.2075304714
+掩蔽体 12.1089181827
+指法训练 13.900677652
+克里莫夫 13.900677652
+温言慰 13.900677652
+耍起来 13.900677652
+汗流 11.0103058941
+蜂涌 12.1089181827
+太深 9.33632946051
+下帖 13.2075304714
+引路 8.9308643524
+傀儡政权 10.7226238216
+清贫如洗 12.2912397395
+宋双 12.2912397395
+应弦而倒 13.900677652
+不装 10.6818018271
+看片 12.2912397395
+赵贵 11.9547675029
+设置障碍 11.2616203224
+渺渺茫茫 11.7034530746
+猛犸 11.4157710022
+溜出 10.7226238216
+牛车上 11.8212361103
+斜长石 10.5684731418
+忽然间 9.54396882529
+十一楼 13.2075304714
+李世济 13.900677652
+欧美地区 12.1089181827
+债权人 8.01179969364
+猛犬 13.2075304714
+私信 12.8020653633
+冰态水 13.900677652
+循环泵 11.3357282945
+缨帽 13.900677652
+我方 9.10488710638
+小津安 11.9547675029
+林耶意 13.2075304714
+计时 9.29550746599
+普兰店 12.8020653633
+比来比去 11.8212361103
+督查组 11.5027823792
+脲醛树脂 12.2912397395
+人浮于事 11.7034530746
+交易价格 8.9102450652
+陈紫函 13.900677652
+有忠君 13.900677652
+渊明 12.5143832909
+战斗舰 12.5143832909
+卡利斯 13.900677652
+金抗蒙 12.8020653633
+耗油量 10.4349417492
+数码单反 13.900677652
+拉木伦 12.8020653633
+坚守阵地 11.4157710022
+躁狂 11.3357282945
+循环水 12.8020653633
+如要 9.77354326693
+十圈 13.2075304714
+引起 4.99958353037
+白纹 11.7034530746
+白纸 9.25628675283
+灵台 10.1871055853
+珠宝饰品 12.5143832909
+生杀之权 13.900677652
+不衰 9.49395840471
+计收 12.2912397395
+赵超 13.2075304714
+郝经 11.9547675029
+豪华版 11.0103058941
+骤风暴雨 13.900677652
+溜光 11.1280889297
+增透膜 13.2075304714
+中书省 8.44109213783
+籍无名 13.2075304714
+底格里斯 12.5143832909
+刘蒙 13.900677652
+四十六年 10.533381822
+七五期间 12.8020653633
+不行 6.30932060528
+光线方向 12.8020653633
+子恭道 13.2075304714
+太浓 11.3357282945
+亲骨肉 10.4349417492
+五瓶 12.8020653633
+郭庚茂 9.30555780184
+运动帽 13.900677652
+夺来 11.0674643079
+太浅 11.4157710022
+窝阔台 8.94485059437
+普米 11.0674643079
+它要 12.5143832909
+四十米 13.2075304714
+秀眉 10.765183436
+下层组织 13.2075304714
+如见 10.7226238216
+索尔维 11.4157710022
+行情表 12.5143832909
+白绸 11.0674643079
+夏侯渊 9.77354326693
+计数 9.19114745066
+诸宫府 13.2075304714
+骨碌碌 11.1926274509
+三脚两步 11.598092559
+船货 11.3357282945
+十块 10.6818018271
+对虾 9.08039608637
+澳门特别行政区 11.1280889297
+云梦睡 13.2075304714
+梁羽生 13.900677652
+金葵花 11.9547675029
+夜分 13.2075304714
+戈维诺 11.5027823792
+靠前面 13.900677652
+粉末冶金 10.642581114
+舆马 13.900677652
+白给 11.2616203224
+身败名裂 10.0940151622
+瓠子 11.9547675029
+杂技节 12.5143832909
+汉字库 13.900677652
+中诚信 11.2616203224
+白练 10.533381822
+抗辐射 11.3357282945
+起至 10.2117981979
+溪畔 12.2912397395
+射进去 12.1089181827
+不该 7.12189275429
+不详 7.91674137129
+诺贝尔和平奖 9.77354326693
+供气 9.19114745066
+不语 8.48457724977
+不误 9.43476953332
+占便宜 10.5684731418
+依玛 12.2912397395
+埃伦 13.900677652
+不说 7.04843508292
+大咧咧 10.8561552143
+驮背 13.900677652
+活体 10.0940151622
+基本保障 11.9547675029
+古河 11.4157710022
+缓步 9.20932976975
+灌过 13.2075304714
+不识 8.5440913773
+供水 8.47133202302
+右上角 11.1280889297
+心气儿 11.7034530746
+环境退化 13.2075304714
+印把子 11.8212361103
+由来已久 9.72629038208
+奔儿 13.2075304714
+连师父 13.900677652
+洛克希德 9.61021821083
+汗湿 11.3357282945
+农安 11.0103058941
+灌进 10.0294766411
+指物 12.1089181827
+十品 13.2075304714
+不认 9.72629038208
+阿父 13.2075304714
+导光板 13.900677652
+不计 8.98802276624
+恒河沙数 13.900677652
+必恭必敬 12.8020653633
+汗渍 11.1280889297
+不让 6.52730334207
+识宝 11.598092559
+犀角 10.2897597393
+李家集 13.900677652
+社会分工 9.58318953844
+太溪 12.8020653633
+李科 11.9547675029
+鹊巢鸠占 13.900677652
+半导体存储器 11.5027823792
+郑和群 11.9547675029
+不许 6.68912091866
+不论 6.96336357075
+西子湖畔 11.5027823792
+识家 12.1089181827
+梅赜 12.5143832909
+钾盐 9.55687223012
+炮团 11.9547675029
+理式 13.900677652
+袁花镇 13.900677652
+恒等式 11.2616203224
+十五年 7.97375162601
+事件调查 13.2075304714
+灌输 9.7898037878
+帕拉南 13.900677652
+兔死狐悲 11.1280889297
+古法 10.4349417492
+中央民族大学 11.9547675029
+指爪 12.8020653633
+太湿 12.5143832909
+之所以 6.54951942555
+识字 8.5488195185
+左御史 13.900677652
+夏娃 10.4666904475
+真气 11.4157710022
+十名 9.5062284973
+医好 11.5027823792
+瓜德罗普 11.2616203224
+五百余名 13.900677652
+秦国国君 12.5143832909
+西涅莱 13.2075304714
+中共中央党校 10.6818018271
+普罗 10.6818018271
+你追我赶 11.4157710022
+招聘广告 11.1926274509
+猛然 7.42524493527
+西朱封 12.8020653633
+高拱伏 13.2075304714
+司马大 13.900677652
+供油 11.0103058941
+幻真 13.2075304714
+七百七十六年 13.2075304714
+汗滴 12.1089181827
+同楼 13.900677652
+胜读十年书 13.900677652
+叩见 9.69598503258
+保安人员 10.765183436
+塞尔维亚社会党 13.2075304714
+辄筋 13.900677652
+压缩 7.68606955355
+纵向 8.50705010562
+宰食 13.2075304714
+两百步 12.1089181827
+闹情绪 12.5143832909
+医大 13.2075304714
+生冷食物 12.5143832909
+通盘考虑 10.9049453784
+转圈儿 12.8020653633
+垣曲 11.3357282945
+计智 13.2075304714
+别尔卡 13.900677652
+辰巳 11.9547675029
+演讲术 13.900677652
+热血青年 11.598092559
+古汉 11.1926274509
+十周 11.1926274509
+其名 9.65218240993
+其后 6.94699344111
+柴达木盆地 9.20932976975
+赵普罢 13.2075304714
+十四记 13.2075304714
+端出 11.0674643079
+太渊 13.2075304714
+太清 10.4041700905
+灭迹 12.2912397395
+抢着 13.900677652
+鄂侯 12.2912397395
+汉乐 13.2075304714
+雍热田 12.5143832909
+经理层 12.5143832909
+引述 9.38981814546
+遂宁市 12.5143832909
+唐府 11.7034530746
+医士 10.9562386728
+宫爆鸡丁 13.900677652
+二十四节 13.2075304714
+曹率军 13.2075304714
+副刊 9.85762638414
+滋补药 12.1089181827
+溜号 12.8020653633
+死板板 12.8020653633
+端倪 9.18217878068
+引进 7.01006853183
+猛炸 13.900677652
+灯不亮 12.1089181827
+黄巢部 13.2075304714
+宋卫 13.2075304714
+资源贫乏 10.7226238216
+向献忠 11.5027823792
+引过 11.9547675029
+特殊 5.6935484839
+化学科 13.2075304714
+两万户 12.2912397395
+势派 11.0674643079
+白米 10.2117981979
+钾矿 11.8212361103
+男士品牌 13.900677652
+将进酒 12.8020653633
+幻相 11.598092559
+身后 6.6905980238
+坂下 13.900677652
+唱大戏 11.3357282945
+次数 7.53764954844
+四十六岁 12.1089181827
+穷凶恶极 13.2075304714
+装配成 11.9547675029
+小学校 9.87532596124
+杨正超 10.7226238216
+猛烈 7.52395070408
+压线 11.9547675029
+方剂学 12.2912397395
+文水县 11.9547675029
+天高任鸟飞 12.2912397395
+矿床 7.9817837977
+乌豆 13.2075304714
+收视 11.3357282945
+加强锻炼 11.7034530746
+当务之急 8.96620371885
+冷加工 11.598092559
+十一次 12.5143832909
+汗漫 13.900677652
+十一款 12.5143832909
+管理效率 10.9562386728
+白籍 12.8020653633
+普通丝瓜 13.900677652
+普纳 11.8212361103
+顺藤摸瓜 10.7226238216
+枫糖 13.900677652
+朱温灭 11.8212361103
+月光花 13.900677652
+运作者 13.2075304714
+浏览器 10.8561552143
+信号弹 10.4041700905
+世罕 11.9547675029
+通商惠工 13.2075304714
+香港特区政府 11.7034530746
+晋帝 12.8020653633
+比雷埃夫斯 11.9547675029
+王瑞兰 12.5143832909
+白粥 12.5143832909
+以人为镜 12.8020653633
+次方 10.642581114
+黄脸 11.598092559
+通天彻地 12.8020653633
+三千五百两 13.900677652
+我村 12.2912397395
+脚镣手铐 12.5143832909
+金牌榜 12.8020653633
+钩索 13.900677652
+古洋 13.2075304714
+瑞恩 13.2075304714
+计有 9.14708746087
+躁热 13.2075304714
+豺狼野心 13.900677652
+保济丸 13.2075304714
+高青县 13.2075304714
+珊瑚树 10.0940151622
+年销售额 10.4994802703
+陈子山 11.5027823792
+白粉 9.94943393339
+董先生 11.0674643079
+可藏 12.1089181827
+鹤庆县 13.2075304714
+次日 6.91318740497
+冠军杯赛 13.2075304714
+考过来 13.900677652
+夏侯氏 12.8020653633
+通用汽车 7.99259471381
+马德克 13.2075304714
+甑子 13.900677652
+如诗 13.2075304714
+害人精 13.2075304714
+调节价 11.9547675029
+掷地有声 11.2616203224
+贝纳永 13.900677652
+葵花子 11.5027823792
+看点 8.52078029844
+难以相处 13.2075304714
+温如玉 13.2075304714
+白糖 8.27305653829
+风吹雨打 11.3357282945
+不言 9.11318590919
+豆状 11.5027823792
+黎巴嫩人 11.598092559
+瓷胎 11.4157710022
+雇佣工人 8.86372504956
+依特 12.2912397395
+赵述 13.2075304714
+无过错 11.4157710022
+猛火 11.4157710022
+排来排去 13.900677652
+陆子 11.9547675029
+谢里曼 11.7034530746
+商家庭 12.5143832909
+蔡文姬 11.2616203224
+巡回检查 12.8020653633
+题词 10.1164880181
+彭氏 12.2912397395
+第二列 12.5143832909
+横坑 12.8020653633
+轮盘 11.5027823792
+岛礁 10.2897597393
+绿色食品 10.5684731418
+炭黑 10.3453295905
+忍到 11.7034530746
+知无不言 11.3357282945
+毛囊 10.604840786
+解困 10.9562386728
+翘首 10.4994802703
+丙型肝炎 12.2912397395
+交货值 11.7034530746
+发售 8.37522471284
+购入 8.22050504296
+荆山 10.6818018271
+加过 12.5143832909
+黄白混 13.900677652
+连绵不断 9.7898037878
+面色苍白 9.43476953332
+胡书 13.2075304714
+点过 11.5027823792
+村办 11.3357282945
+彭水 11.1926274509
+马小柱 12.8020653633
+小来亨 11.4157710022
+林护驾 13.2075304714
+计算机所 11.9547675029
+史湘云 9.94943393339
+加进 9.35738286971
+白水台 13.900677652
+讨情 11.598092559
+中一 10.4666904475
+武论艺 13.900677652
+计算机房 12.8020653633
+中三 12.2912397395
+中下 10.765183436
+中上 10.2117981979
+难以解决 10.5684731418
+爆米花 11.0103058941
+中世 11.9547675029
+王韵笙 12.8020653633
+伯颜入 13.2075304714
+中专 10.0088573539
+中东 7.53249046563
+莎士比亚 8.80081122415
+三十四万 13.900677652
+长岭子 12.1089181827
+消雾 12.2912397395
+体检费 12.5143832909
+通训定 12.8020653633
+领扣 11.9547675029
+第二副 11.7034530746
+白水县 12.8020653633
+涞水县 12.2912397395
+甘蓝型 12.8020653633
+阿勒楚 13.2075304714
+题记 10.1871055853
+中举 10.2117981979
+中丹 13.2075304714
+唐咸通 11.4157710022
+产钳 13.2075304714
+明世记 13.2075304714
+四百六十九公里 13.2075304714
+管仓 13.2075304714
+廊子 10.5684731418
+先套 11.598092559
+中介 7.89186446653
+吕公 11.4157710022
+伸伸 11.7034530746
+流路 10.8096351986
+韦利 12.1089181827
+耳鼻咽 12.1089181827
+聪明绝世 13.2075304714
+无穷远 11.1926274509
+中仙 13.2075304714
+梁州 10.4994802703
+摄人魂魄 12.2912397395
+雷礼 13.2075304714
+撤案 12.8020653633
+消防 9.24671730182
+同贺 12.5143832909
+圣母颂 13.900677652
+马哈吉 13.2075304714
+四五十米 12.1089181827
+三环路 10.9562386728
+中价 12.1089181827
+印满 11.8212361103
+吕光 10.9049453784
+领报 13.2075304714
+吕克 12.1089181827
+山崩地陷 12.5143832909
+任丘市 12.5143832909
+儋州 11.4157710022
+吕元 10.3453295905
+点窜 13.2075304714
+龙凤胎 12.1089181827
+小扁豆 12.8020653633
+改良种 13.900677652
+炼金术 11.7034530746
+新地产 12.8020653633
+勿以恶小而为之 13.2075304714
+攀龙附凤 11.3357282945
+陆宗 11.0674643079
+粮食市场 12.2912397395
+铸造 8.02574692112
+全部折 13.900677652
+丹江口水库 11.5027823792
+一个舒服 12.8020653633
+乌拉尔 9.19114745066
+诺尔 9.7898037878
+赠送 8.60737282725
+中云 11.598092559
+花钱买 10.1164880181
+耗子 9.00283785202
+天鹅堡 13.900677652
+原子能 8.90346537821
+李翰林 12.8020653633
+运动竞赛 11.8212361103
+伊利诺伊州 9.98865464655
+中亚 7.52906580474
+中产 10.4349417492
+圣三一 12.5143832909
+陆家 10.2897597393
+简洁性 13.900677652
+力诺 10.3171587135
+桂皮 10.6818018271
+经营收入 10.3171587135
+吕思勉 12.8020653633
+先头 10.1871055853
+烂漫 10.642581114
+先夫 12.2912397395
+先天 8.3285236198
+彭泽 11.5027823792
+独掌大权 12.5143832909
+阙朝贺 13.2075304714
+消除 6.6303647659
+中人 8.57280148319
+公兔 13.900677652
+运筹决算 13.900677652
+零首付 13.2075304714
+更衣间 13.900677652
+中低 9.7898037878
+紫胶虫 11.0674643079
+绿杨树 12.2912397395
+艳事 12.5143832909
+金弘道 13.2075304714
+杨将军 12.8020653633
+苦日子 10.4666904475
+服务提供者 12.5143832909
+草原土壤 11.2616203224
+大力推广 10.765183436
+发向 11.4157710022
+各大军区 12.5143832909
+第二匹 13.2075304714
+帽子 7.68207753228
+支原体 10.8096351986
+胡乐 12.8020653633
+前车之鉴 9.56994431169
+七七年 13.2075304714
+受水区 13.2075304714
+绕成 11.7034530746
+梁山 9.12999302751
+露营 10.6818018271
+晋民 12.2912397395
+阿房宫遗址 13.2075304714
+产销 8.53470163695
+多万美元 11.4157710022
+中使 10.2630914922
+铸金 12.8020653633
+殷虚 12.1089181827
+尼扬韦 13.2075304714
+梁封 11.9547675029
+潜伏学习 13.2075304714
+导流洞 13.900677652
+村史 13.900677652
+中企 11.0674643079
+崇明岛 10.2117981979
+中伏 11.0674643079
+阴转多云 13.2075304714
+新加坡国立大学 13.2075304714
+割尾巴 13.2075304714
+第二半 11.7034530746
+村口 9.62401153296
+王小倜 10.8096351986
+佩斯 10.4994802703
+第二千 13.2075304714
+封官 10.6818018271
+第二十 10.642581114
+毂辘 11.0103058941
+纤维化 10.1164880181
+中会 9.21854642485
+择校热 13.900677652
+中伤 10.3171587135
+彭浦 12.1089181827
+辅助生产 11.7034530746
+长辛店 10.4349417492
+翁师傅 9.75754292558
+消音 11.7034530746
+第二卷 8.37921673411
+北京人艺 12.5143832909
+赛乃姆 12.2912397395
+销售费用 10.1394775363
+发呆 8.85082164473
+凉了半截 10.4041700905
+大做文章 10.4349417492
+龙光寺 12.8020653633
+晋江 9.84023464143
+梁峁 11.1926274509
+毛坑 13.2075304714
+高州市 13.900677652
+千万英镑 12.8020653633
+套牢 8.4801426527
+轮着 10.1630080337
+川端康成 11.598092559
+老矣 11.7034530746
+荆川 13.900677652
+荆州 7.41451686303
+蔚模 13.2075304714
+都柳江 11.2616203224
+禄星 12.5143832909
+侧目而视 11.598092559
+选用 7.76079309975
+中保 11.1926274509
+封存 9.34680076038
+梅科 10.9562386728
+冒傻气 11.9547675029
+片段 10.1164880181
+发咒 13.900677652
+中信 7.63727938938
+艳丽 8.83177344976
+油印机 12.5143832909
+中修 12.5143832909
+耳鼻喉 12.5143832909
+点穴 11.4157710022
+一天两天 10.0940151622
+晁盖庄 12.8020653633
+昙花 11.3357282945
+手到拈来 13.2075304714
+毛坯 11.1926274509
+沃地 13.900677652
+尤西堂 13.900677652
+晋波 10.4349417492
+癌瘤 11.3357282945
+几千次 13.2075304714
+水洗 9.74179456862
+赶过来 9.6811699468
+第二发 12.8020653633
+观察使 10.0720362555
+本手册 13.900677652
+骂山门 13.2075304714
+云和山 13.2075304714
+射回 11.9547675029
+认栽 12.8020653633
+烟草专卖局 11.7034530746
+四枝 12.2912397395
+洞察力 10.2630914922
+痴心人 13.900677652
+袭占 11.1280889297
+发哑 12.8020653633
+斜谷 10.4041700905
+羊肉汤 11.1926274509
+填写数字 13.900677652
+德国慕尼黑大学 12.2912397395
+第二台 12.5143832909
+亦对于 13.2075304714
+电离层 9.5186510173
+黄建华 13.900677652
+撑门面 12.8020653633
+第二只 10.6818018271
+忍受 7.95525704337
+汝可乘 13.2075304714
+八拜之交 11.9547675029
+甄家娘子 13.900677652
+第二口 12.5143832909
+繁荣党 12.8020653633
+布里耶 13.900677652
+发响 12.1089181827
+周杰伦 10.8096351986
+第二句 10.9562386728
+椰子汁 13.900677652
+见仁见智 10.9049453784
+欧三洲 12.8020653633
+萨斯奎 12.8020653633
+战争场面 11.0674643079
+吉拉 12.8020653633
+游手好闲者 13.2075304714
+王小博 13.2075304714
+冯礼 13.900677652
+先富 12.1089181827
+久后 10.8561552143
+发在 11.2616203224
+孰轻孰重 11.7034530746
+政闻社 11.9547675029
+恼羞成怒 10.1164880181
+呐喊声 9.94943393339
+先寄 13.900677652
+嬉闹 11.0674643079
+癌症 8.58747167293
+侦察车 8.6966709649
+癌病 13.900677652
+先导 9.28555713513
+科技 5.83227469341
+题解 12.5143832909
+魏振亮 13.2075304714
+心安神 11.1926274509
+薄壳核桃 13.900677652
+囚房 11.9547675029
+陆奥 10.765183436
+聂米 11.8212361103
+董卓 9.16447920358
+慷慨激烈 13.900677652
+同杨诚 11.1280889297
+知晓 8.50705010562
+般阳 12.8020653633
+角状 11.3357282945
+十一亿元 13.2075304714
+彭湃 11.3357282945
+梁式 11.5027823792
+加足 12.5143832909
+先守 13.2075304714
+针对 6.04087847141
+产院 13.900677652
+临时工 10.0294766411
+举世无敌 13.900677652
+天字第一号 11.7034530746
+电加工 13.900677652
+产险 10.3171587135
+网络体系 11.7034530746
+地理信息系统 11.2616203224
+私人 6.824868788
+非常态 13.2075304714
+哈德门 13.900677652
+吴因唐 13.2075304714
+尚延心 12.8020653633
+客户名单 11.9547675029
+斜边 11.4157710022
+堪察加州 13.900677652
+商业价值 10.5684731418
+阿炳真 12.8020653633
+解咒 13.2075304714
+消防通道 11.8212361103
+传檄而定 11.1280889297
+故意 6.68396816527
+波级 13.2075304714
+长方型 12.8020653633
+川盐 13.900677652
+沙发椅 12.2912397395
+使然 9.69598503258
+流程 7.76511276089
+婷婷玉立 12.8020653633
+齿白 13.900677652
+领悟 9.53122979951
+朱衡薄 12.8020653633
+认死 13.900677652
+布喇顿 11.8212361103
+波纳 13.900677652
+朝令夕改 12.8020653633
+侦察连 11.7034530746
+池边 10.8561552143
+波纹 10.3743171274
+点起 9.10488710638
+斜轴 12.8020653633
+全景电影 13.2075304714
+勾线 12.8020653633
+气定神闲 11.4157710022
+几十平方公里 13.900677652
+毛呢 11.9547675029
+先公后私 13.900677652
+民丰县 12.5143832909
+卡在 10.0720362555
+副乡长 10.765183436
+加赛 13.2075304714
+发型 9.44633035572
+黄江镇 13.900677652
+欧普祥 13.2075304714
+练武功 13.2075304714
+蛔虫病 11.8212361103
+手指头 8.58255765813
+永靖县 11.3357282945
+表示层 12.1089181827
+包公祠 11.8212361103
+人心归向 13.900677652
+荆府 13.900677652
+点货 13.2075304714
+交通系统 10.8096351986
+解吸 12.8020653633
+广开财路 13.900677652
+领情 11.0674643079
+加贴 12.2912397395
+四枪 12.8020653633
+加贺 12.5143832909
+稚嫩 9.93038573842
+比善德 13.900677652
+吉房 13.900677652
+简答题 13.900677652
+体全息图 13.900677652
+着地 8.59240995457
+封堵 9.94943393339
+傲慢 8.98069672615
+姬路 13.2075304714
+玛巴尔 13.900677652
+宋思明 11.7034530746
+椰子油 12.8020653633
+阿法 13.900677652
+养性殿 13.900677652
+小嘎儿 11.3357282945
+久安 12.5143832909
+党争 10.2117981979
+尧舜禹 11.9547675029
+一千多年 10.533381822
+巡洋舰 8.73589167805
+四村 13.2075304714
+苏沃洛 10.9049453784
+料定 9.48183704418
+於由 13.900677652
+滩涂地 13.900677652
+那御弟 12.2912397395
+付诸实践 10.8096351986
+选民证 13.2075304714
+主导工业 13.2075304714
+射向 10.1630080337
+流管 12.8020653633
+烂泥 9.96885201925
+层压板 13.2075304714
+格拉泽 12.2912397395
+臭棋篓子 12.8020653633
+买手机 13.900677652
+再聊 11.9547675029
+梁平 12.8020653633
+叔丁醇 12.5143832909
+村内 11.2616203224
+党人 9.08039608637
+村冈 13.900677652
+压脚 13.900677652
+坦白交代 12.2912397395
+传旨 8.43684584695
+薛札 13.900677652
+光学薄膜 11.7034530746
+开嘴 11.8212361103
+梁师 13.2075304714
+浓淡适中 13.900677652
+南方人 9.7898037878
+半掩门 12.5143832909
+富有经验 10.765183436
+佩枪 13.2075304714
+耍钱 12.2912397395
+知机 12.2912397395
+航空学院 12.1089181827
+发器 12.8020653633
+德安府 11.4157710022
+丁充夫 12.8020653633
+老城区 9.87532596124
+力行 11.0674643079
+再者 8.81927328699
+安吉尔 13.2075304714
+原住民 12.2912397395
+香香甜甜 13.900677652
+挖坑 9.74179456862
+消闲 10.8561552143
+赫赫战功 11.0103058941
+火爆场面 11.2616203224
+斜躺 11.1280889297
+设法 7.51211624643
+佩林 11.7034530746
+波罗 9.06439574502
+至急 12.8020653633
+萧普贤 12.1089181827
+交货单 13.900677652
+有效成分 9.87532596124
+力表 12.8020653633
+阿钦斯 12.8020653633
+儿童医院 10.533381822
+中甸县 12.5143832909
+公证法 13.900677652
+势成骑虎 12.8020653633
+忍冬 10.9562386728
+独资经营 11.598092559
+若能 8.83177344976
+才略过人 13.900677652
+非战斗 11.1926274509
+封套 10.6818018271
+第二册 12.2912397395
+狩猎者 11.1280889297
+吕剧 12.2912397395
+高成 9.61021821083
+关平恐 12.8020653633
+轮番 8.44535653662
+陆壳 11.1926274509
+陆震声 13.900677652
+依法行政 10.8561552143
+川石 12.8020653633
+流走 11.2616203224
+有滋有味 10.7226238216
+波美 13.900677652
+无机盐 9.27570483869
+名落孙山 11.7034530746
+蕴藏量 8.27666014579
+梁廷 12.8020653633
+拿顶 12.8020653633
+业务人员 10.5684731418
+历纪 13.900677652
+封好 10.2897597393
+跃然 11.598092559
+维贾亚 13.900677652
+薛某 12.2912397395
+数百处 13.900677652
+党义 13.2075304714
+亚甲蓝 13.2075304714
+驾到 9.26594866375
+马绍纳兰 13.2075304714
+升华作用 13.2075304714
+担心者 12.5143832909
+有机肥料 11.0674643079
+灯光效果 13.900677652
+梅杜萨 13.2075304714
+历练 10.0940151622
+久存 11.9547675029
+水敬洪 9.80633308975
+料子 10.2117981979
+购办 12.1089181827
+六胎 13.2075304714
+不缩水 13.900677652
+历经 7.96314144689
+分切 12.2912397395
+招风惹草 13.900677652
+心如刀搅 13.2075304714
+赵之琛 12.8020653633
+消长 9.91169360541
+心怀不满 10.1630080337
+马哈坎 13.900677652
+周礼注 13.2075304714
+发回 9.85762638414
+佩服 8.17382990439
+新疆军区 11.8212361103
+深情 8.49350588052
+富贵不能淫 13.2075304714
+葛可久 13.2075304714
+耶酥 13.2075304714
+殷末周 12.8020653633
+知恩 12.1089181827
+病歪歪 13.2075304714
+王钟翰 12.5143832909
+煮烂 11.1926274509
+着凉 10.1871055853
+种军阵 13.2075304714
+文职人员 9.63799777493
+斜视 11.0674643079
+茅厕 10.5684731418
+和忠王妃 13.2075304714
+弘光 10.1871055853
+南征楚 12.8020653633
+恐怖主义 9.71102290995
+加诸 12.8020653633
+加课 12.2912397395
+煮热 13.2075304714
+扈家庄 11.3357282945
+透透气 11.7034530746
+转世灵童 12.1089181827
+铸铁 9.41204128224
+露脸 10.4666904475
+点评 7.54456999128
+苏东 13.900677652
+相对说来 11.4157710022
+铸铜 10.4349417492
+加试 13.2075304714
+连芬军 13.2075304714
+封建 6.60562123551
+线西 12.5143832909
+胡仔 11.8212361103
+加计 11.4157710022
+发兵 8.59240995457
+铸钢 10.4349417492
+魏都区 12.5143832909
+菩萨心肠 10.8096351986
+铁道线 13.2075304714
+中国军方 12.1089181827
+供水管 11.7034530746
+麦金莱 13.2075304714
+无间断 12.8020653633
+帽带 12.8020653633
+千叮咛万嘱咐 11.1926274509
+低电压 11.4157710022
+天外飞仙 13.900677652
+刘家峡水库 11.598092559
+第十五位 13.900677652
+花先叶 12.8020653633
+大凤 13.900677652
+加设 11.9547675029
+韩嵩 12.8020653633
+克莱德河 12.8020653633
+产道 10.4666904475
+胆石症 10.9562386728
+梁天 13.2075304714
+主干渠 12.8020653633
+焦虑症 11.1926274509
+工场手工 13.900677652
+行政诉讼 9.85762638414
+饿着肚子 10.2630914922
+老面孔 11.0103058941
+铸钟 12.8020653633
+解劝 10.1164880181
+发光 8.17382990439
+晋楚 11.9547675029
+姜春云 13.2075304714
+印度尼西亚政府 13.2075304714
+轮状 11.8212361103
+伺侯 11.3357282945
+故有 8.47133202302
+亳州 9.93038573842
+发冷 9.91169360541
+片源 11.9547675029
+斜襟 12.2912397395
+卢蒙巴 11.5027823792
+炭棒 12.8020653633
+唯分数论 13.2075304714
+孙二娘 9.94943393339
+佩恩 12.2912397395
+大气污染 9.61021821083
+半胱氨酸 12.5143832909
+神魂飘荡 12.8020653633
+千万千瓦 13.900677652
+古玉器 11.9547675029
+痢疾 9.69598503258
+打先锋 12.2912397395
+烈属 10.9562386728
+接轨 9.0884932966
+不可救药 10.5684731418
+斯拉夫 9.01787572939
+鲁昭公 12.1089181827
+勾连 11.4157710022
+曹公知 13.2075304714
+知情 7.66235302694
+重庆市公安局 10.6818018271
+水晶棺 12.8020653633
+力达 12.8020653633
+轮牧 13.2075304714
+贾氏家族 13.2075304714
+第八品 12.8020653633
+宫应选 13.900677652
+射去 10.4994802703
+航电 10.0940151622
+被试者 11.9547675029
+解剖 8.91707103027
+腋窝 10.3171587135
+勾过 13.900677652
+怦然心动 10.8096351986
+第二回 10.6818018271
+久居 9.85762638414
+首脑会晤 11.0674643079
+再好不过 10.3171587135
+发出 5.8026428958
+发函 10.8096351986
+充分运用 10.4994802703
+发凡 12.5143832909
+连芬兰 13.2075304714
+林纾译 12.8020653633
+本版 10.3453295905
+有序性 11.9547675029
+和义渠 12.8020653633
+步入正轨 10.9562386728
+罗斯川 13.2075304714
+水化学 11.1926274509
+知悉 10.3171587135
+一亿七千万 12.8020653633
+方理 11.7034530746
+波磔 12.8020653633
+炒过 13.900677652
+角球 12.1089181827
+发凉 10.0720362555
+第二团 13.2075304714
+毛利 8.70218062071
+李应道 11.7034530746
+南蛇藤果 13.900677652
+磨砖对缝 12.5143832909
+毛发 8.83808261895
+六千米 13.900677652
+高一功 8.25170341381
+周希汉 13.900677652
+若虫 10.5684731418
+富阳镇 13.2075304714
+薛愚 13.2075304714
+发债 8.59737274392
+碾场 12.8020653633
+第二圈 12.5143832909
+搜求 10.533381822
+榆社 10.9049453784
+高打 12.8020653633
+吕哥 13.900677652
+领有 9.84023464143
+救助金 11.0674643079
+范甘迪 13.2075304714
+张于湖 13.900677652
+第二场 11.0103058941
+四月 7.68207753228
+轮班 10.642581114
+回眸一笑 11.9547675029
+姚某 12.1089181827
+梁塬 13.900677652
+吉时 11.8212361103
+大玉儿 13.900677652
+此地无银三百两 11.3357282945
+病疫苗 13.2075304714
+吉日 9.7898037878
+逍遥丸 11.7034530746
+射到 10.2371160058
+入世 10.4666904475
+真真切切 10.642581114
+挂漏 13.2075304714
+肉制品 9.82314020807
+深思 8.95903522937
+第二块 11.1280889297
+廊庑 10.9049453784
+守望者 11.9547675029
+小焕 11.0674643079
+螺旋运动 12.8020653633
+玩忽职守 10.4349417492
+煮熟 9.08039608637
+陆师 12.2912397395
+流露出来 10.1164880181
+陆希 13.2075304714
+二次电子 11.598092559
+吉文 13.2075304714
+解压 11.3357282945
+白里安 11.598092559
+黯然伤神 12.8020653633
+撤消 10.2897597393
+塑造 7.7083151625
+引以为傲 11.598092559
+操纵员 13.2075304714
+林丫头 11.8212361103
+高中毕业 9.55687223012
+遵章守纪 13.900677652
+凹陷处 11.2616203224
+裁决书 11.2616203224
+吉斯 10.0505300503
+五千三百户 13.2075304714
+环环相扣 10.9562386728
+久已 9.40086798165
+照炒不误 12.8020653633
+毛南 10.642581114
+濒危 10.3171587135
+春耕大忙 13.900677652
+桂珍 10.6818018271
+发傻 13.2075304714
+方略 8.35160156708
+豪情壮志 11.7034530746
+小炉匠 12.5143832909
+银水成 13.2075304714
+财务处 11.9547675029
+中枢神经 8.52539924429
+解危 12.1089181827
+天台县 12.5143832909
+北卫滩 12.2912397395
+如期而至 10.642581114
+讨教 10.4349417492
+经济情报 11.9547675029
+蛋清 10.5684731418
+水池子 11.9547675029
+池袋 12.8020653633
+莫知所措 12.8020653633
+怒射 13.900677652
+写进去 12.1089181827
+纤腰 11.5027823792
+康泰克 13.900677652
+塔伊 11.7034530746
+运筹帏幄 12.2912397395
+封开 12.8020653633
+程毅中 13.2075304714
+无拘无束 10.2630914922
+海基会 12.5143832909
+怒山 10.5684731418
+铸锭 11.1926274509
+帽徽 11.0674643079
+融进 10.7226238216
+占有量 10.3171587135
+混迹江湖 13.2075304714
+南征梁 12.8020653633
+桂王 11.2616203224
+便民店 13.900677652
+铸锻 12.2912397395
+雷福斯 11.3357282945
+西餐店 13.900677652
+钟祥县 13.2075304714
+荆妇 13.2075304714
+露背 13.2075304714
+鬼佬 13.900677652
+平均收敛 13.900677652
+先将 8.96620371885
+上海市工人文化宫 13.900677652
+蔡大姐 13.900677652
+精兵政策 13.900677652
+陆康 13.900677652
+国际博览 12.1089181827
+个人信用 10.9049453784
+解包 12.5143832909
+李宗盛 13.900677652
+降魔 10.4041700905
+吕后 9.96885201925
+豹子胆 10.642581114
+方生 12.2912397395
+产量 6.16480733202
+毛匪 12.8020653633
+法律咨询 11.2616203224
+村坊 10.0720362555
+奉新县 13.900677652
+延平津 13.2075304714
+题跋 10.2371160058
+黑无常 13.900677652
+桶口 13.2075304714
+窦太后 11.7034530746
+勾走 12.8020653633
+记日记 13.900677652
+点解 12.5143832909
+电离室 11.5027823792
+马哈努 13.2075304714
+风尘碌碌 13.900677652
+勾起 9.59661255877
+梁子 11.7034530746
+第二名 9.27570483869
+修汴渠 12.5143832909
+思想作风 11.598092559
+雍二州 13.2075304714
+声罪致讨 13.900677652
+广东明珠 11.1926274509
+缠结 12.2912397395
+时代特征 10.2897597393
+庄礼 13.2075304714
+料度 13.900677652
+杜尔伯特 10.9562386728
+子进关 13.900677652
+方盛 11.7034530746
+高带宽 13.900677652
+切出来 13.900677652
+点角 13.2075304714
+藏而不露 12.8020653633
+东静静 13.900677652
+流线 10.8096351986
+强化措施 11.7034530746
+行销量 13.900677652
+炒起 13.900677652
+发卷 12.5143832909
+小穹顶 13.900677652
+崔永元 12.5143832909
+先得 9.80633308975
+流经 7.5393751744
+地保 11.1926274509
+发卡 10.1630080337
+古准 12.5143832909
+椰子树 11.0103058941
+从严处理 12.2912397395
+咖啡色 11.1926274509
+先往 10.4349417492
+先征 12.5143832909
+连芯锁 12.8020653633
+天鹅座 10.8561552143
+博采众长 10.8096351986
+春义 8.18036587537
+发卖 11.3357282945
+吓过 13.900677652
+故旧 9.85762638414
+射入 9.69598503258
+危楼 11.7034530746
+肿节风 13.900677652
+黑寡妇 10.2897597393
+第二周 9.98865464655
+方天定 11.3357282945
+故时 12.1089181827
+牢牢地 9.40086798165
+铜川 10.9049453784
+通同 11.1926274509
+榨油厂 11.9547675029
+骤灭 13.900677652
+千万亿 13.2075304714
+庄严宣告 11.7034530746
+消逝 9.20932976975
+锉子 12.8020653633
+发去 11.7034530746
+事业费 13.2075304714
+椎动脉 11.8212361103
+陆川 10.4349417492
+核禁试 13.900677652
+连塔娜 13.2075304714
+蒋闻 12.8020653633
+槐花 10.8561552143
+子敬乃 12.8020653633
+使用 4.51629994279
+萨斯州 13.900677652
+吕坤 12.8020653633
+消退 8.42003872863
+门票费 13.900677652
+德国大众 11.7034530746
+付诸实行 11.598092559
+在会谈中 12.5143832909
+解偏 13.900677652
+性感 8.99540287354
+尤氏乃 13.2075304714
+等压过程 12.2912397395
+班前会 13.2075304714
+词眼 13.2075304714
+封山 10.2630914922
+财经学院 9.96885201925
+吉普 9.19114745066
+益州治 12.8020653633
+转速表 11.4157710022
+爷孙 12.8020653633
+十年规划 12.5143832909
+封封 13.2075304714
+二三百两 12.8020653633
+田敬仲 13.2075304714
+蓓蕾 11.2616203224
+吉星 11.1280889297
+四曲 13.2075304714
+里亚语 13.900677652
+一千多家 13.2075304714
+佩戴 8.95903522937
+两万里 12.5143832909
+吴元载 13.2075304714
+梁宗 13.900677652
+封尘 13.2075304714
+先开 10.604840786
+澹台勉 12.5143832909
+地低 11.1926274509
+地位 5.20651051009
+女博士 12.8020653633
+俱乐部 7.69208762588
+不难想像 12.8020653633
+土鲮鱼 13.900677652
+封尧 12.8020653633
+苍柏 13.900677652
+封世子 13.2075304714
+毛值 13.900677652
+大结局 12.5143832909
+代码优化 12.8020653633
+射出 8.89004235788
+射击 7.30080715276
+梁家 10.2897597393
+民诉法 13.900677652
+消遣 9.43476953332
+测体温 13.900677652
+电离子 12.8020653633
+发到 10.0294766411
+纪录片 9.46986085313
+三部合唱 13.900677652
+地亚 11.3357282945
+方知 9.40086798165
+只读光盘 12.8020653633
+浮燥 13.900677652
+解出 10.4994802703
+吃一堑长一智 12.2912397395
+编程序 12.2912397395
+折多山 11.598092559
+水翼船 12.1089181827
+历程 8.05713323494
+料得 11.8212361103
+专题讨论 12.1089181827
+数据分析 9.89334446674
+吕四 11.3357282945
+加装 8.52539924429
+帝国大厦 11.3357282945
+俄勒冈州 11.5027823792
+理发室 13.2075304714
+缝上去 13.900677652
+财务室 11.7034530746
+河洛凡 13.2075304714
+经济纠纷 12.2912397395
+地产 5.6767822718
+解凝 12.5143832909
+五输穴 13.900677652
+地亩 10.4349417492
+降香 10.9049453784
+马六甲 9.75754292558
+鱼箭 11.5027823792
+脱不了身 11.8212361103
+地仓 12.2912397395
+小黄鱼 10.7226238216
+巩固率 13.900677652
+领教 9.46986085313
+黄巾者 13.2075304714
+干臣 11.0674643079
+和荷荷 12.8020653633
+吉林 7.74369866639
+品貌双全 13.2075304714
+解冻 8.55357012126
+领主 9.01787572939
+登山涉岭 13.900677652
+百兽之王 13.2075304714
+解决 5.33985042354
+着力 7.40541209604
+蟾宫折桂 12.5143832909
+院辖市 11.9547675029
+并不需要 9.33632946051
+地价 8.60236028543
+基础体温 11.9547675029
+切实际 13.2075304714
+先借 11.9547675029
+祖慧 13.900677652
+黑名单 10.4349417492
+歪谈乱道 13.900677652
+二三百万 12.5143832909
+性情 8.27666014579
+高弹性 11.1280889297
+年轻干部 10.7226238216
+平一平 13.2075304714
+万丈深渊 11.1926274509
+猪儿 13.900677652
+下一代 8.91707103027
+男变女 11.7034530746
+铁子儿 12.8020653633
+手拙 13.900677652
+苏修 11.598092559
+领料 11.7034530746
+科一科 13.900677652
+胜不骄 13.2075304714
+解入 12.2912397395
+郎心似铁 13.900677652
+性急 9.05649056552
+地丁 11.1926274509
+秦军交 13.900677652
+地上 5.68377907106
+发动 6.23492422011
+购回 11.2616203224
+罗布泊湖 12.1089181827
+拉泽斯 11.5027823792
+陆峰 12.2912397395
+一敲 11.0674643079
+凤雏乎 13.2075304714
+民法通则 10.4994802703
+环境效益 11.4157710022
+地主 7.01108634362
+家庭出身 9.98865464655
+驱策 11.1280889297
+凤姑娘 12.1089181827
+何朝宗 12.8020653633
+加行 12.8020653633
+史玉柱 10.4994802703
+姚燕 11.0674643079
+一票否决制 13.900677652
+主办人 12.5143832909
+商品流通 8.70218062071
+耗尽 9.09665660724
+还原染料 13.900677652
+合成染料 11.4157710022
+地中 10.4666904475
+宋贵 13.900677652
+性恶 12.1089181827
+郁保四 10.3743171274
+德拉克马 13.2075304714
+论罪 10.5684731418
+蛋汤 13.2075304714
+多种形式 9.13850371718
+黄华华 11.9547675029
+军命 13.900677652
+吉朗 12.5143832909
+渊壑 13.900677652
+流网 12.5143832909
+东灵山 13.2075304714
+先师 11.4157710022
+努尔哈 12.2912397395
+吉服 11.598092559
+攻击能力 9.94943393339
+深恨 10.533381822
+骤然 8.1902506346
+希萨诺 13.2075304714
+平远号 13.2075304714
+手指尖 12.1089181827
+文章宗匠 13.2075304714
+认清 9.54396882529
+摔成两半 13.900677652
+拿不出手 11.8212361103
+若蒙 11.3357282945
+吉本 11.8212361103
+中华人民 10.604840786
+大张挞伐 11.2616203224
+语体文 13.900677652
+佩挂 13.2075304714
+先带 11.1926274509
+糖基化 13.2075304714
+红花油 12.2912397395
+可验证 12.2912397395
+榛树 13.900677652
+梁商 13.900677652
+轮组 13.2075304714
+历三帝 12.5143832909
+能上能下 12.1089181827
+论点 8.90346537821
+川籍 13.2075304714
+松姆河 12.8020653633
+刊文 11.1280889297
+薛氏 13.900677652
+造假 9.59661255877
+先出 10.5684731418
+晋绥边区 11.9547675029
+方磊 9.74179456862
+射弩 13.2075304714
+韩国游 13.900677652
+佩烈杰 13.2075304714
+危机 5.88568075763
+滥杀 11.1280889297
+杜鹃啼血 12.8020653633
+赵炅命 12.8020653633
+师夷长 12.1089181827
+书论 12.1089181827
+腌制品 13.2075304714
+世缟 12.5143832909
+吉森 11.5027823792
+流点 12.2912397395
+挟书律 12.8020653633
+参数 6.99492437566
+耗去 10.9562386728
+中缝核 12.8020653633
+人工制品 12.1089181827
+张孚敬 12.8020653633
+董天 9.44633035572
+力荐 10.6818018271
+广深铁路 11.1926274509
+红颜薄命 11.9547675029
+科学依据 9.62401153296
+碧螺春 10.6818018271
+降雨 8.84443184663
+灵猫科 11.8212361103
+降雪 8.98802276624
+建设周期 10.4994802703
+生壶 13.900677652
+祭吊 12.5143832909
+比君亭 12.5143832909
+顾学颉 13.2075304714
+满处 13.900677652
+古根汉姆 13.900677652
+拉贾斯坦 10.9049453784
+去世 7.1049718768
+照相法 12.8020653633
+先决 11.8212361103
+雷之声 12.8020653633
+咖啡豆 11.8212361103
+煮粥 10.4349417492
+王小大 12.5143832909
+代销店 13.2075304714
+官镇东 13.900677652
+久坂玄瑞 12.8020653633
+孩子家 12.1089181827
+血腥气 11.7034530746
+解库 12.2912397395
+潘长江 12.8020653633
+丰九域 11.3357282945
+干涉技术 13.2075304714
+韦博 13.900677652
+射影 10.4666904475
+离退休 9.48183704418
+苏俄 9.44633035572
+几千公里 12.8020653633
+戏剧实验 11.8212361103
+王婆房 12.2912397395
+薛沙 13.2075304714
+原子荧光 11.3357282945
+倒装句 13.900677652
+再说 6.11495675544
+夷陵 10.1164880181
+久候 11.1926274509
+金巧巧 13.900677652
+王小姐 10.3171587135
+分析仪 10.8561552143
+先兆 9.5186510173
+神乎其技 13.2075304714
+再读 10.9049453784
+第三折 13.900677652
+陆台 11.598092559
+伏炽磐 11.9547675029
+晋文 11.7034530746
+林斯高 13.900677652
+沈绿村 9.29550746599
+企业宣传 12.8020653633
+尝到了 9.62401153296
+设有 6.62273907903
+马哈尔 13.2075304714
+先公 13.900677652
+既往不咎 10.3171587135
+知法 12.5143832909
+西餐厅 11.8212361103
+波瓦 12.8020653633
+由安拉 12.8020653633
+二千多里 13.2075304714
+波瓣 13.900677652
+预算赤字 9.54396882529
+奥德翁 12.1089181827
+再议 9.87532596124
+许显纯 11.9547675029
+毛布 12.2912397395
+理发员 13.900677652
+再记 13.2075304714
+为人所用 13.2075304714
+何策胜 13.2075304714
+顺顺当当 10.9562386728
+中国驻韩国大使馆 13.900677652
+降附 10.1871055853
+东方发白 11.7034530746
+吉格 13.2075304714
+炒菜 9.65218240993
+故此 8.31718134319
+流火 11.4157710022
+威风凛凛 9.75754292558
+桑那州 13.900677652
+桑吉涅 13.2075304714
+蔡克廉 13.2075304714
+亚利桑那大学 13.2075304714
+抗菌药 11.0103058941
+加蜜 13.900677652
+方砖 10.0940151622
+专门知识 11.1926274509
+似能 13.2075304714
+圣彼得 11.1926274509
+新店子 13.2075304714
+村容 12.2912397395
+解忧 10.8096351986
+行奉义 13.2075304714
+银雀山 10.4666904475
+苯丙 13.900677652
+会议费 13.900677652
+耗力 12.8020653633
+肤浅性 13.900677652
+数万件 12.2912397395
+封口 10.5684731418
+诺德 9.35738286971
+放上去 12.5143832909
+村官 10.5684731418
+印板 12.8020653633
+巴特农 13.2075304714
+续存 13.2075304714
+沿行 12.5143832909
+发射 6.54759573146
+封号 9.37888907493
+闭花羞月 13.900677652
+琵琶曲 11.598092559
+中国戏剧家协会 11.2616203224
+撒下 10.7226238216
+渐佳 13.900677652
+晕动病 13.900677652
+蓬发戴 13.900677652
+阡表 13.900677652
+无字碑 12.1089181827
+候补者 12.2912397395
+迫降 10.533381822
+一千多吨 12.8020653633
+苯乙 12.8020653633
+村寨 10.0940151622
+奥福特 12.8020653633
+印有 9.53122979951
+沾体涂足 13.900677652
+王文斌 12.5143832909
+发展 3.57506455044
+公司财务 11.598092559
+印机 13.900677652
+听从指挥 11.7034530746
+解往 11.0674643079
+陈继儒 11.7034530746
+抹香鲸 11.2616203224
+梁启 12.2912397395
+一千多名 12.1089181827
+随波逐流 10.3453295905
+苍桑 13.900677652
+欧非混 13.2075304714
+附设 9.7898037878
+送报员 12.5143832909
+第二季 10.2897597393
+欧洲航天局 12.8020653633
+发屋 13.900677652
+二百万两 12.8020653633
+射干 11.5027823792
+颈饰 13.2075304714
+印本 10.6818018271
+六十五元 12.8020653633
+印染 9.24671730182
+彭文 11.7034530746
+那一刻 8.77077893705
+吸毒上瘾 13.900677652
+考夫曼 11.9547675029
+施以援 11.7034530746
+薛涛 11.4157710022
+第二宗 13.900677652
+龙二虎 12.8020653633
+去信 11.3357282945
+走私车 11.2616203224
+首目 13.900677652
+卜青 13.2075304714
+基督教社会联盟 12.5143832909
+角票 12.5143832909
+赤岗 13.2075304714
+古潜山 12.5143832909
+胡萝卜 8.86372504956
+暗淡无光 11.0674643079
+彭斯 11.1280889297
+引领者 10.765183436
+发起组 13.900677652
+封印 10.9562386728
+虐杀 11.1926274509
+陆勤 13.900677652
+卢卡斯 11.598092559
+第二审 11.3357282945
+核心点 13.2075304714
+大叶茶 11.9547675029
+斯海尔德河 12.1089181827
+发射台 10.765183436
+塞尔柯克 12.8020653633
+引力质量 11.7034530746
+先倒 11.8212361103
+科学计算 11.3357282945
+背水一战 10.8561552143
+三十多种 13.2075304714
+豁然开朗 10.0940151622
+轮缘 12.2912397395
+青贮 12.1089181827
+女娃娃 10.0294766411
+村学 12.1089181827
+勾芡 11.9547675029
+东川市 11.9547675029
+集合号 13.2075304714
+村子 7.48721869481
+敲进 13.2075304714
+半睡眠状 13.2075304714
+下岗职工 10.604840786
+范钦 12.5143832909
+甘德 11.9547675029
+波痕 11.8212361103
+李淑一 13.900677652
+情意深重 13.900677652
+酸心 13.900677652
+蒙大拿 12.8020653633
+唯名论 11.4157710022
+风筝会 12.8020653633
+拨出去 12.5143832909
+等会儿 9.63799777493
+子赵雍 13.900677652
+搜捕 9.66657114738
+修葺一新 11.598092559
+设施 6.73828015462
+加藤 10.9562386728
+先发 10.2630914922
+先取 9.58318953844
+针线活 10.5684731418
+肌电图 11.5027823792
+方竹 11.5027823792
+陆兄 13.2075304714
+为人所知 10.8561552143
+嘉实多 12.2912397395
+论辨 12.1089181827
+彭春 12.8020653633
+毛峰 10.604840786
+发引 12.1089181827
+陆兵 13.2075304714
+下馆子 11.0674643079
+列侯 10.2117981979
+一千多块 11.7034530746
+列侬 12.1089181827
+脂肪 7.41299363349
+赵云引 11.0103058941
+喀纳斯湖 11.8212361103
+梅特 11.1280889297
+宴游 13.900677652
+发式 10.604840786
+杭忆便 12.8020653633
+勾脸 13.2075304714
+访问期间 10.9562386728
+怒号 12.2912397395
+怒叱 11.9547675029
+海地人 12.1089181827
+治理整顿 10.9562386728
+周礼考 12.8020653633
+串联式 12.1089181827
+吕家 11.1926274509
+臭气熏天 11.1926274509
+名利思想 13.900677652
+天台山 9.77354326693
+恐怖行动 12.1089181827
+诊疗所 13.2075304714
+滥收 13.900677652
+卸下 9.23723855786
+摩根斯坦利 11.5027823792
+怒发 11.2616203224
+正吻 13.900677652
+贝和诺 12.8020653633
+琛航岛 11.9547675029
+藏兵峡 12.5143832909
+耿耿不忘 13.900677652
+长方形 8.15128466607
+吼起来 11.1280889297
+花福鹿 13.2075304714
+无论怎样 9.63799777493
+吕安 12.8020653633
+怎行 13.2075304714
+张瑞敏 11.4157710022
+压出来 13.2075304714
+儿女亲家 11.4157710022
+老先生 7.97108850859
+九中全会 12.5143832909
+列伊 12.2912397395
+收敛性 10.8561552143
+请求书 13.2075304714
+卸任 9.4233408375
+大儿 12.2912397395
+着录 13.900677652
+肩外俞 13.900677652
+西至直 13.2075304714
+越忙 13.2075304714
+再见 8.30225569298
+久别 10.4666904475
+列传 8.85725253506
+危方 13.2075304714
+佐治亚州 10.5684731418
+刊本 9.06439574502
+发往 9.77354326693
+反应速度快 12.2912397395
+轩辕黄帝 11.4157710022
+云南昆明 10.5684731418
+辅导院 13.900677652
+料到 7.67414098269
+先占 11.3357282945
+阴晴圆 12.8020653633
+认捐 11.9547675029
+加工费 11.8212361103
+毛尖 10.2630914922
+流片 12.1089181827
+爱人儿 13.2075304714
+清河县 10.8561552143
+四星 10.8096351986
+列位 8.57766767284
+陆军 6.7907981889
+村塾 12.5143832909
+滥施 11.0674643079
+力臂 12.8020653633
+三四种 12.5143832909
+生了病 11.2616203224
+封蔡国 12.2912397395
+梅轩 13.900677652
+列作 12.8020653633
+五百二十一位 13.2075304714
+董家 10.4349417492
+摇杆 13.2075304714
+先包 13.900677652
+陆冰 13.2075304714
+方程 7.56739802384
+西六师 12.2912397395
+再要 9.27570483869
+弗赖 11.4157710022
+王李冲 13.2075304714
+解封 12.2912397395
+第二声 12.1089181827
+若要 8.39941944143
+迫问 13.2075304714
+鱼盐之利 13.900677652
+左丘明 11.1280889297
+黄启东 13.2075304714
+特拉纳 13.900677652
+王继恩 12.2912397395
+黄素蒽 13.900677652
+即令 8.77077893705
+黄白术 13.2075304714
+再补 10.9049453784
+宁宗死 12.8020653633
+大连经济技术开发区 12.8020653633
+第二夜 13.900677652
+列于 10.1164880181
+射射 13.900677652
+脂膏 11.3357282945
+原生植物 13.2075304714
+水淋淋 10.533381822
+加蓬 10.0294766411
+夷门 12.1089181827
+严明法纪 13.900677652
+中淋溶 12.8020653633
+冠周炎 13.900677652
+与会者 9.71102290995
+发带 13.900677652
+长活 11.9547675029
+有加利 13.900677652
+第二处 12.2912397395
+印数 12.2912397395
+桑占东 13.900677652
+发帖 8.95903522937
+再行 8.87679713113
+六节 13.900677652
+勾联 12.8020653633
+毛巾 8.28390655431
+做买卖 9.41204128224
+第二天 6.52793128557
+发市 11.9547675029
+解州 11.9547675029
+村妇 11.8212361103
+可视化 11.1926274509
+流年似水 13.2075304714
+腋生 9.71102290995
+奠基礼 13.2075304714
+民俗村 13.2075304714
+一个十四五岁 12.2912397395
+搀杂 12.1089181827
+延展性 10.2897597393
+料及 11.598092559
+改良版 13.900677652
+着床 10.6818018271
+普选权 11.1926274509
+避免出现 10.4041700905
+南浔镇 13.900677652
+第二套 9.98865464655
+铁刀木 12.2912397395
+贝叶斯 11.598092559
+戡乱 11.8212361103
+八届人大常委会 13.900677652
+绕桩 11.9547675029
+睚眦必报 11.9547675029
+互利性 12.8020653633
+输点 13.900677652
+加蒂 13.2075304714
+竹影 12.1089181827
+村委 10.5684731418
+撤掉 10.2897597393
+瑞典文学院 12.5143832909
+非球面 12.2912397395
+谢菲联 10.9562386728
+欲说还休 12.5143832909
+多维图灵机 13.900677652
+封冰 11.9547675029
+鏖兵 12.1089181827
+施工人员 10.1394775363
+对象性 11.9547675029
+麻油鸡 13.900677652
+风花雪月 10.604840786
+低温泵 13.2075304714
+禄氏 12.8020653633
+少尉军官 13.900677652
+村头 9.55687223012
+立法法 13.2075304714
+撤换 9.72629038208
+列上 12.2912397395
+文正欲 13.900677652
+炒股 7.86999239171
+先前 7.34532076017
+襁褓之中 12.2912397395
+村夫 11.1926274509
+憨乎乎 13.900677652
+寡闻 13.2075304714
+原子论 10.765183436
+原子频标 13.2075304714
+碑拓 13.2075304714
+典狱 13.2075304714
+封入 12.1089181827
+抄小路 11.3357282945
+村外 9.59661255877
+炒肝 12.5143832909
+成瘾者 13.900677652
+柳夫人 11.5027823792
+封关 12.5143832909
+启动盘 12.8020653633
+月龄 11.1280889297
+列举 8.5440913773
+并非易事 10.6818018271
+一年半载 10.2371160058
+梁国 11.0103058941
+列为 7.16252515738
+杂技表演 12.2912397395
+方策 13.2075304714
+冲水 11.9547675029
+少数民族 6.78590820361
+梅玉 12.8020653633
+行气活血 11.5027823792
+二氧六环 12.2912397395
+蓝红 13.900677652
+虐政 12.1089181827
+过桥米线 12.1089181827
+万福金安 13.2075304714
+涌塞 13.2075304714
+印文 10.8561552143
+著书立说 10.4349417492
+走私货 13.900677652
+背对背 12.8020653633
+印斋 12.8020653633
+雅宝路 13.2075304714
+包工队 13.900677652
+西林吉镇 12.5143832909
+傻大姐 11.9547675029
+老东家 11.1280889297
+乌拉圭 9.55687223012
+先到 8.03704647638
+印方 10.2117981979
+力能 12.2912397395
+二氯苯 12.8020653633
+先别 9.74179456862
+设摊 12.8020653633
+时卫国 12.8020653633
+发廊 12.5143832909
+认成 12.2912397395
+未置可否 11.0674643079
+吴升叹 12.5143832909
+阿瑞斯 11.8212361103
+奥维尔 12.8020653633
+搜救 10.4994802703
+发夹 12.8020653633
+梁克 13.2075304714
+目标程序 11.598092559
+斯科特 10.8096351986
+盈利率 13.2075304714
+何尝不可 12.8020653633
+封四 13.900677652
+单于请兵 13.2075304714
+熟能生巧 13.2075304714
+师由龙 12.8020653633
+中生植物 12.8020653633
+屈万乘 13.900677652
+青青草 13.2075304714
+怒喝 10.7226238216
+梁公 13.900677652
+陆坡 11.8212361103
+四郎探母 11.5027823792
+村庄 7.38893232233
+和田玉 11.1280889297
+煊赫 11.0674643079
+知识结构 11.4157710022
+单峰骆驼 13.900677652
+荒唐事 11.3357282945
+封固 11.598092559
+封国 10.1164880181
+彭总 8.23425096386
+方糖 11.8212361103
+德伦 12.8020653633
+印成 11.1926274509
+丘九儿 13.2075304714
+先喝 11.2616203224
+德伯 12.2912397395
+榆荚 12.8020653633
+东河区 12.1089181827
+烂掉 10.642581114
+第二幕 11.4157710022
+杂草 8.71329184614
+意向性 11.2616203224
+连续不断 9.48183704418
+苍海 13.2075304714
+加莱 11.7034530746
+非处方药品 13.900677652
+每件事 11.5027823792
+射孔 11.1280889297
+纪传 11.0103058941
+第二幅 12.8020653633
+陆地 7.34816976494
+惩恶扬善 12.2912397395
+蒙嘉慧 12.8020653633
+性比 11.8212361103
+发套 13.900677652
+发奖 11.8212361103
+吉河 11.7034530746
+露西 12.1089181827
+技术储备 10.8561552143
+四旁 11.1926274509
+第二年 8.11071748108
+玉树临风 11.598092559
+一代新人 12.1089181827
+纪伊 12.8020653633
+眼饧耳热 13.900677652
+生日蛋糕 11.7034530746
+退休金 9.85762638414
+发奋 11.3357282945
+个展 12.8020653633
+食品机械 10.5684731418
+蒲昌 12.5143832909
+董巨 12.5143832909
+石刁柏 12.8020653633
+性欲 9.08039608637
+发妻 12.5143832909
+肯起来 13.2075304714
+陆域 10.3743171274
+划伤 10.9562386728
+劫数 10.9049453784
+变化无常 10.604840786
+生变熟 12.8020653633
+廊坊 11.0103058941
+亚马孙地区 13.900677652
+卡希尔 12.5143832909
+纪信 13.900677652
+李本深 12.8020653633
+再过 8.42421410004
+洞烛其奸 13.900677652
+优先级 11.3357282945
+陆基 10.0940151622
+江西省政府 12.2912397395
+排风扇 13.900677652
+钳口不言 12.5143832909
+轮空 13.900677652
+丘大人 13.2075304714
+大安市 13.2075304714
+产草量 11.2616203224
+再远 12.2912397395
+德保 11.7034530746
+第二座 11.9547675029
+第二度 12.8020653633
+悲怆 9.96885201925
+心怀鬼胎 10.9562386728
+踢伤 12.5143832909
+梁冀 11.3357282945
+控制感情 12.8020653633
+安吉县 11.4157710022
+系风捕影 13.900677652
+驾崩 10.1394775363
+德尔纳 13.2075304714
+爷儿 11.3357282945
+汗涔涔 11.0103058941
+梁军 11.598092559
+庄繁 13.900677652
+两三百名 12.5143832909
+任凭风浪起 13.900677652
+吉永 12.8020653633
+行动者 12.2912397395
+麦吉尔 11.598092559
+中国企业家协会 13.2075304714
+先唱 11.598092559
+吉水 11.5027823792
+抱下来 12.5143832909
+兀自 8.63281949291
+退居二线 11.5027823792
+碑文 9.41204128224
+史道邻 9.96885201925
+清德宗 11.7034530746
+通山县 12.1089181827
+计划指标 11.8212361103
+送出门 11.0674643079
+大手印 13.900677652
+伊莎贝拉 10.8561552143
+章鸿钊 12.8020653633
+室上性 11.598092559
+望海涵 12.2912397395
+金牛能源 10.604840786
+关岭境 13.2075304714
+通化 9.75754292558
+黄会计 10.9562386728
+甲基对硫磷 13.2075304714
+先哲 11.598092559
+施国祁 12.8020653633
+解密 10.0940151622
+危房 11.1280889297
+黄庭经 11.9547675029
+朱里斯 13.2075304714
+柳木 11.1926274509
+第三十四章 11.0674643079
+先哭 12.8020653633
+第二张 11.1926274509
+德乙 13.900677652
+风光秀丽 10.6818018271
+划价 13.900677652
+轮箍 11.8212361103
+片材 12.8020653633
+不大清楚 10.7226238216
+乌达盟 11.2616203224
+列支敦士登公国 13.900677652
+闻风而逃 11.598092559
+圆舞曲 11.1280889297
+德丰 11.4157710022
+宝镜空 13.2075304714
+命丧 11.0674643079
+讲究礼貌 12.5143832909
+川滇黔 11.598092559
+着墨 11.1926274509
+吕才曾 13.2075304714
+划付 11.5027823792
+太妙了 12.1089181827
+连蜈蚣 13.900677652
+解官 11.0103058941
+解宝 9.16447920358
+广运潭 13.2075304714
+罗尼科 13.900677652
+不相为谋 12.8020653633
+帽圈 12.5143832909
+斜肩 12.8020653633
+圆圆胖胖 13.900677652
+同车 10.9049453784
+毛子 11.7034530746
+比金秀 13.2075304714
+东官郡 13.2075304714
+毛孔 9.40086798165
+怒吼 9.63799777493
+初仕魏 13.2075304714
+症候 10.5684731418
+加色 13.900677652
+黄金价格 8.00078029839
+埋头工作 12.5143832909
+错题 12.5143832909
+机心 11.5027823792
+岁寒三友 11.8212361103
+嘉峪关 10.2117981979
+石坝 10.2371160058
+国资 8.57766767284
+流用 13.900677652
+长途运输 10.9049453784
+历炼 13.2075304714
+桴鼓相应 12.5143832909
+银川平原 10.0720362555
+忍得 10.6818018271
+划一 9.80633308975
+天台宗 10.2117981979
+马超新 13.900677652
+用心险恶 12.1089181827
+解字 13.2075304714
+乖戾 11.4157710022
+划下 12.1089181827
+发声 9.16447920358
+吉洛 12.8020653633
+流畅 8.15128466607
+明瑞 12.5143832909
+无字天书 13.900677652
+二十一部 13.2075304714
+石块 8.24119543622
+先向 9.11318590919
+索金 13.2075304714
+第六十七章 13.2075304714
+心劲儿 12.5143832909
+负心汉 13.900677652
+华源 11.3357282945
+先后 5.40409541446
+毛毛茸茸 13.900677652
+先同 10.765183436
+不顾后果 12.8020653633
+撤收 11.0674643079
+先吃 10.1394775363
+沈吉线 12.8020653633
+恶直丑正 13.900677652
+祖智 12.8020653633
+封土 10.604840786
+动员群众 11.3357282945
+舒舒 13.2075304714
+先吸 12.5143832909
+除莠剂 12.5143832909
+忍心 9.37888907493
+吕尚 12.1089181827
+忍忍 11.7034530746
+封在 10.1164880181
+拉维赤 12.8020653633
+孝昌县 12.2912397395
+平坦 7.42833135747
+东起海 12.8020653633
+封地 9.16447920358
+小金铃 12.8020653633
+衬纸 13.900677652
+先听 11.0103058941
+纪事 8.9519177616
+案中案 13.900677652
+小军军 11.8212361103
+炒蛋 13.900677652
+云和县 13.900677652
+亚历克 13.900677652
+数以亿计 10.8561552143
+再赢 13.2075304714
+台湾糖业 11.5027823792
+老有所乐 12.5143832909
+若赢 11.9547675029
+尼格莱斯 13.900677652
+百事大吉 13.900677652
+再起 8.85082164473
+反作用力 10.2117981979
+红三叶 12.8020653633
+狙击枪 12.1089181827
+反民主 11.8212361103
+曾庆存 13.2075304714
+五号线 12.8020653633
+漫不经意 12.5143832909
+鱼尾板 13.2075304714
+天恩祖 13.2075304714
+匡庐图 12.8020653633
+毛壶 13.900677652
+南岳镇 13.2075304714
+桃之夭夭 12.8020653633
+再赌 12.8020653633
+克莱德曼 12.8020653633
+斯克里 12.8020653633
+王承恩 8.65365357982
+再赔 12.8020653633
+鸥鸟 11.9547675029
+解夏节 13.2075304714
+门把手 12.1089181827
+纳世通 13.2075304714
+窗玻璃 9.7898037878
+错误操作 13.900677652
+无记名 10.8561552143
+共济失调 11.1926274509
+再败 11.2616203224
+查普特佩 13.2075304714
+秦基伟 12.2912397395
+消食 10.3743171274
+豁然开悟 13.900677652
+说好听 11.3357282945
+吕德 12.1089181827
+方红 13.2075304714
+亨德 12.8020653633
+诸路招 13.2075304714
+第二届 8.41173992582
+汉诺 13.2075304714
+水浪 10.7226238216
+王士俊 13.900677652
+第二层 9.63799777493
+第二局 12.5143832909
+着实 7.82074445688
+波特 10.3171587135
+干花 11.9547675029
+恕道 12.8020653633
+老有所为 12.8020653633
+达拉西 13.900677652
+五环 11.598092559
+佩蒂翁 11.7034530746
+荆刺 13.2075304714
+李健超 9.71102290995
+崇明县 11.1926274509
+炒粉 13.900677652
+炒作股票 12.5143832909
+忧愤成疾 11.8212361103
+搀扶 8.83177344976
+王所传 13.900677652
+诸王诸 13.900677652
+德安县 12.8020653633
+数理系 11.9547675029
+第四十九条 13.2075304714
+王莉 12.1089181827
+哼起 11.4157710022
+拥军优属 11.598092559
+发家 10.765183436
+波兹南 10.7226238216
+归档 10.765183436
+刑事侦查学 12.1089181827
+发审 10.0505300503
+波状 9.20019728618
+黑黝黝 10.1394775363
+彗发 12.5143832909
+教学改革 11.8212361103
+不落俗套 12.8020653633
+连东洋 13.900677652
+悬灯结彩 12.8020653633
+一般而言 9.11318590919
+坑家败业 13.900677652
+从大清 11.7034530746
+馊主意 10.5684731418
+召开 5.57804055502
+池莉 13.900677652
+一会儿步 13.2075304714
+女娃子 12.8020653633
+桶子 12.5143832909
+总星系 11.598092559
+搜查 8.77671367257
+卫于楚 13.2075304714
+蛇影杯弓 13.2075304714
+能见 10.604840786
+降速 12.2912397395
+取土 11.598092559
+偕老 10.9562386728
+发完 10.533381822
+村小 12.1089181827
+村山 12.8020653633
+近程导弹 11.2616203224
+淡黄色 9.30555780184
+经济危机 7.49379766591
+萨斯喀 13.900677652
+罗斯基 13.2075304714
+二冲程 11.3357282945
+投出去 12.8020653633
+欣悉 13.900677652
+手炉 10.533381822
+购得 9.44633035572
+扶海洲 13.2075304714
+一事无成 10.5684731418
+封君 10.8561552143
+用不着 7.59805867623
+石坡 11.2616203224
+村屯 10.765183436
+目击耳闻 13.900677652
+中东问题 10.8561552143
+何升赏 13.900677652
+反问句 13.900677652
+碑林 9.80633308975
+好生了得 11.4157710022
+第二峰 12.8020653633
+郑氏佚 13.2075304714
+火鸡 10.1630080337
+国际商业机器公司 11.1926274509
+先在 8.57766767284
+召引 11.8212361103
+村居 12.1089181827
+多幕剧 11.5027823792
+先圣 10.3453295905
+尤利西斯 11.7034530746
+凤凰卫视 11.8212361103
+生橡胶 13.900677652
+先回 9.35738286971
+轮种 12.1089181827
+荆南 9.87532596124
+冶炼炉 12.5143832909
+壕堑 10.8096351986
+文宣帝 12.8020653633
+直挺挺 9.93038573842
+若象 12.2912397395
+千员 11.9547675029
+毛姆 12.1089181827
+王美娘 13.2075304714
+下陵上替 13.900677652
+董平 9.45802639549
+方翰 12.1089181827
+数百匹 13.900677652
+雷管 9.82314020807
+一般而论 12.5143832909
+子集合 13.2075304714
+国家一级 9.87532596124
+夏特尔 13.2075304714
+巴特 10.2371160058
+外部边界 13.2075304714
+发威 10.1164880181
+北京猿人 11.0103058941
+购并 11.0103058941
+危急 8.2985588311
+烟雾迷漫 13.900677652
+暴发出来 12.5143832909
+石垒 13.2075304714
+王小平 12.5143832909
+煮茗 13.2075304714
+地质灾害 11.5027823792
+孙逸仙 11.7034530746
+再谢 12.2912397395
+吕庵 13.900677652
+奏书 13.2075304714
+设想 7.4855806928
+王小帅 13.900677652
+绳带 13.900677652
+乌浩宫 13.900677652
+不清不白 11.8212361103
+二十六万余 13.2075304714
+大山顶 13.2075304714
+对头冤家 13.2075304714
+若谷 12.5143832909
+自取其辱 12.1089181827
+吕府 11.4157710022
+流矢 10.4349417492
+酗酒滋事 13.900677652
+温血动物 11.598092559
+领海 9.31571017331
+荷花奖 13.900677652
+再谈 9.80633308975
+财务司 13.900677652
+腹壁 10.6818018271
+流石 12.8020653633
+陆清河 13.2075304714
+贵恙 12.1089181827
+绥滨县 13.900677652
+宗知州 13.2075304714
+顺序控制 12.2912397395
+奏乐 9.46986085313
+怪力乱神 11.598092559
+二连浩特市 11.7034530746
+神机莫测 13.2075304714
+螳螂捕蝉 12.2912397395
+肉包子打 12.8020653633
+性格 7.11735245137
+符水驱 13.2075304714
+苍溪 11.598092559
+袍泽 11.3357282945
+过人之处 10.1871055853
+毛奇 11.598092559
+真实情况 9.89334446674
+正合对 13.900677652
+乐游宴 13.2075304714
+男女老少 9.46986085313
+知母 10.4994802703
+无线电话 11.9547675029
+珠光宝气 11.0103058941
+奥维德 11.7034530746
+滥情 12.8020653633
+岩居穴处 13.2075304714
+三两缕 13.2075304714
+二十多条 12.8020653633
+料场 12.1089181827
+品牌价值 10.0940151622
+北京工商大学 10.765183436
+片断 9.10488710638
+同边 13.900677652
+解套 9.25628675283
+速测仪 13.900677652
+购建 11.1926274509
+举报线索 12.5143832909
+流着 9.12999302751
+如登春台 13.2075304714
+木木地 11.8212361103
+吕常 13.2075304714
+太乙山 12.8020653633
+急急匆匆 12.8020653633
+无常鬼 12.8020653633
+梁畿 13.2075304714
+加耶 12.8020653633
+次声波 10.9049453784
+锉刀 11.4157710022
+水沟 10.0940151622
+久坐 10.604840786
+认明 13.900677652
+片时 9.82314020807
+透进去 13.900677652
+祸福 9.63799777493
+第一一四回 13.2075304714
+毛头 10.7226238216
+闭门谢客 11.1926274509
+论着 12.5143832909
+总裁兼 9.4233408375
+池苑 13.900677652
+英语听力 13.900677652
+李东生 12.5143832909
+危惧 12.2912397395
+土沥青 13.900677652
+穆西 13.900677652
+吕布 8.85725253506
+心如火焚 12.2912397395
+增音机 12.8020653633
+弦音 12.2912397395
+德卡 12.5143832909
+专美于前 13.900677652
+闺秀 11.7034530746
+滑动摩擦 12.2912397395
+释例 11.598092559
+德集群 13.2075304714
+划去 11.7034530746
+内容提要 11.7034530746
+羽翼未丰 13.900677652
+国家技术监督局 13.2075304714
+消蚀 13.2075304714
+樱桃木 13.2075304714
+史密斯 9.46986085313
+玉石不分 12.5143832909
+得到许可 11.9547675029
+控制电路 11.0103058941
+闻风而起 13.2075304714
+高保真 12.2912397395
+五线 11.8212361103
+叁天 13.2075304714
+德华 10.604840786
+背光 11.0103058941
+纪南 11.3357282945
+娇养 11.5027823792
+不下雨 10.6818018271
+矫揉造作 10.7226238216
+中年 8.22050504296
+玛丽仙 10.2371160058
+中平 9.6811699468
+轮替 12.1089181827
+如冰似雪 13.900677652
+中广 12.2912397395
+桃色新闻 12.8020653633
+过过瘾 13.2075304714
+相持 8.52539924429
+深恶痛绝 9.87532596124
+北魏军 11.9547675029
+泻下来 12.8020653633
+中师 13.900677652
+诸城县 12.8020653633
+王二叔 13.900677652
+石垣 13.900677652
+凯尼恩 13.2075304714
+翘角 12.8020653633
+称誉 10.4349417492
+军职人员 13.900677652
+梅树 10.2630914922
+汝可念 13.2075304714
+游进 11.0103058941
+铁三角 13.2075304714
+牟尼 11.7034530746
+空集东 13.2075304714
+娇儿 11.8212361103
+马监太监 13.900677652
+礼拜天 11.2616203224
+范贤 12.8020653633
+占为己有 11.7034530746
+德化 8.70218062071
+竞折腰 11.8212361103
+方悟 11.9547675029
+抱出来 11.2616203224
+水质评价 13.900677652
+中常 8.80692745117
+靳于 12.8020653633
+保护意识 11.8212361103
+松散型 13.900677652
+启示录 10.7226238216
+谢里登 12.1089181827
+裁决定 12.1089181827
+伸张 10.9049453784
+去国 11.8212361103
+几首歌 13.2075304714
+龙江路 12.2912397395
+滴出来 13.900677652
+挡住 7.83689244329
+地处 7.0590621755
+波河 10.9562386728
+薛璋 13.2075304714
+地痞流氓 11.1926274509
+申达表 13.2075304714
+阿里巴巴 8.70772080109
+十余架 13.2075304714
+蝾螈 10.4994802703
+梅森 12.1089181827
+一小半 10.7226238216
+地头 9.6811699468
+按动 11.3357282945
+每项 10.4041700905
+诺兰 12.2912397395
+伸开 9.65218240993
+个人信息 10.4041700905
+陈其尤 12.5143832909
+天生地设 13.2075304714
+和硕县 13.900677652
+秋末冬 11.1280889297
+阴阳鱼 13.900677652
+闹来闹去 12.5143832909
+地大 10.3453295905
+纪及 9.06439574502
+无票 12.8020653633
+常听到 11.9547675029
+奏凯 11.4157710022
+黄昏时候 10.0088573539
+中庆 11.9547675029
+岭澳 12.1089181827
+波波 11.5027823792
+梅梅 9.61021821083
+峨山 11.4157710022
+灵岩山 11.8212361103
+迫近 9.65218240993
+奏出 10.533381822
+设置 6.35370353446
+建材局 13.900677652
+涨回 13.900677652
+夏玉米 12.8020653633
+许光达 10.4349417492
+地区冲突 11.8212361103
+中度 9.84023464143
+中庭 11.7034530746
+一小包 11.3357282945
+小蒋 10.3743171274
+西至沙 12.8020653633
+伺察 12.2912397395
+市场营销部 12.2912397395
+审查室 11.598092559
+该守 12.2912397395
+北部湾 9.05649056552
+体魄 10.0294766411
+中庸 9.93038573842
+推拖 13.2075304714
+春天 7.19871728597
+预备会 13.2075304714
+管理文件 12.8020653633
+类书籍 12.5143832909
+阿炳摸 13.2075304714
+拉蒂洛 12.5143832909
+消融 9.56994431169
+段三娘 11.3357282945
+殷明略 13.2075304714
+划动 11.5027823792
+旧金山 8.91707103027
+证果 12.8020653633
+人为因素 10.3171587135
+春夏 9.49395840471
+老有所养 11.4157710022
+米黄色 11.0674643079
+当家理财 13.900677652
+中彩 12.2912397395
+公孙康之 13.2075304714
+春夜 10.7226238216
+广宗城 12.8020653633
+中影 11.3357282945
+胶州市 11.8212361103
+孵出来 13.2075304714
+此致敬礼 13.2075304714
+中国邮政 11.7034530746
+岚山 10.8096351986
+王平陵 13.2075304714
+中国围棋 12.5143832909
+老顽固 13.2075304714
+一两碗 13.900677652
+赏罚信明 13.900677652
+积分球 13.900677652
+中式 9.71102290995
+皮痒 13.900677652
+德利 11.2616203224
+性相 13.900677652
+波海 13.900677652
+直跳脚 13.2075304714
+撤离 8.02574692112
+德维尔 11.3357282945
+霍大娘 12.8020653633
+伸延 10.533381822
+闹乱子 13.2075304714
+林业局 10.4994802703
+地壳 7.73525979774
+波流 13.2075304714
+方裕 13.2075304714
+抗原性 11.0103058941
+桂木 12.2912397395
+尘世间 12.5143832909
+乌特利 13.2075304714
+司马光任 13.2075304714
+吕潭镇 13.900677652
+办后事 12.8020653633
+卧牛山 11.9547675029
+没听到过 12.1089181827
+纪分 12.8020653633
+中弹 9.91169360541
+狂热性 13.900677652
+轮架 13.2075304714
+德勤 11.598092559
+划到 11.1926274509
+中心 4.82010433806
+密集架 13.900677652
+列名 10.9049453784
+白卫军 11.7034530746
+殷雪 13.2075304714
+电源线 11.598092559
+贾珍便 11.598092559
+稍胜一筹 13.900677652
+谢贝利 11.9547675029
+梁经理 11.598092559
+镇静剂 10.4349417492
+划划 11.8212361103
+王婆笑 11.8212361103
+制热 11.0674643079
+埃特 9.93038573842
+兔子 8.70218062071
+划分 6.6261980932
+地堡 10.0940151622
+德勒 11.3357282945
+桂柳 11.8212361103
+收转 12.1089181827
+发家致富 10.5684731418
+示威运动 13.2075304714
+波涛 9.13850371718
+历法 8.64318227995
+德加 11.5027823792
+力高 12.5143832909
+去垢 13.900677652
+碑碣 10.5684731418
+桂林 8.10766404359
+填涂 13.900677652
+赫舒斯 12.5143832909
+桂枝 10.7226238216
+贾代儒 12.8020653633
+感同身受 10.8561552143
+大受打击 11.8212361103
+特色学校 12.1089181827
+姚旷 10.3743171274
+鬼子 8.76487921493
+南中国海 11.1280889297
+原子量 9.21854642485
+王有何 13.2075304714
+慕贤良 13.2075304714
+峨嵋 11.598092559
+轮机 11.4157710022
+颁赠给 13.2075304714
+休息天 12.8020653633
+奥德曼 13.900677652
+让你玩 13.2075304714
+宋兴 12.5143832909
+聚乙烯醇 11.4157710022
+中居 9.63799777493
+一千余年 13.2075304714
+新旧观念 12.8020653633
+中局 12.5143832909
+中层 9.26594866375
+纪其 12.8020653633
+曹少钦 13.900677652
+爷俩 11.8212361103
+胡宗铎 12.8020653633
+帝乎 12.5143832909
+德兴 10.604840786
+德兰 11.0674643079
+雷暴雨 13.2075304714
+苍猿 10.2630914922
+马赫主义 11.3357282945
+海魂衫 13.900677652
+党徒 11.2616203224
+斯帕尔 12.5143832909
+蓟瀛 11.4157710022
+大盘股 7.12759727632
+露露 11.3357282945
+长曲棍球 13.900677652
+再配 10.2630914922
+春娇 12.5143832909
+奇花异草 10.9562386728
+德克 11.8212361103
+德光 11.8212361103
+党徽 13.900677652
+应武举 13.2075304714
+中山 7.47743068844
+帕默斯顿 11.9547675029
+乌珠弹 13.2075304714
+症侯 13.900677652
+地宫 8.87023973058
+封王信 13.2075304714
+蜾蠃 12.5143832909
+第十五天 12.8020653633
+恍惚之间 12.5143832909
+纪元 10.533381822
+角抵 11.0674643079
+罪加一等 11.1280889297
+中封 12.1089181827
+贝利 9.89334446674
+列城 12.1089181827
+中小 7.10162178992
+武破楚 13.2075304714
+中尉 9.58318953844
+同做 12.8020653633
+划出 8.70772080109
+党心 12.5143832909
+几刀 10.9562386728
+竖井 9.61021821083
+炒饭 11.9547675029
+胃出血 11.9547675029
+林改名 13.2075304714
+地富 11.598092559
+别睡了 12.8020653633
+镇政府 10.4349417492
+去向 8.36334338496
+马玉仁 12.5143832909
+各楼层 12.8020653633
+方技 11.0674643079
+热带植物 10.765183436
+阎生华 12.2912397395
+薛白 13.900677652
+枢纽区 13.2075304714
+性病 9.94943393339
+九湾 13.2075304714
+露面 8.43261751084
+中尾 13.900677652
+合抱之木 13.900677652
+温内特 12.8020653633
+蒴果 8.84443184663
+拍照片 12.2912397395
+普米语 12.5143832909
+总储量 9.59661255877
+北魏南 12.8020653633
+殷门 13.900677652
+范进 13.900677652
+寇吕侯 13.2075304714
+水河川 11.9547675029
+禀帖 11.8212361103
+防城各族自治县 12.2912397395
+鱼肉乡民 13.2075304714
+中国新闻社 12.5143832909
+尉领其 12.8020653633
+康普顿 10.8096351986
+数百双 13.2075304714
+吉特 12.1089181827
+傲然 10.3171587135
+囚犯 9.03314320152
+方才 7.06227245113
+母曰简 13.2075304714
+降调 12.5143832909
+领点 13.900677652
+梁子湖 11.1280889297
+卢卡约 13.900677652
+桥头堡 10.5684731418
+波源 12.1089181827
+感悟到 12.1089181827
+二三十米 12.5143832909
+罗恩格 12.1089181827
+三四十种 12.2912397395
+禄田 11.3357282945
+拦污栅 13.2075304714
+戚将军 11.8212361103
+临难 11.7034530746
+拉丁字母 8.98069672615
+请假条 11.9547675029
+池畔 11.598092559
+连花清 13.900677652
+史密松 13.2075304714
+划入 8.58747167293
+软刀子 13.2075304714
+读者来信 11.7034530746
+和平主义者 12.1089181827
+面黄肌瘦 10.7226238216
+中岛 11.3357282945
+摆摊设点 13.2075304714
+神仙下凡 12.5143832909
+赵老师 10.4666904475
+多节式 13.2075304714
+由弱到强 12.1089181827
+桑蚕丝 11.1926274509
+做点事 10.9049453784
+梁侯 13.2075304714
+熏笼 11.8212361103
+地学 9.59661255877
+中岳 10.4041700905
+孩提 11.598092559
+新地岛 11.598092559
+方成 11.7034530746
+章攻杨 12.8020653633
+德农 11.1280889297
+德军 7.99531580392
+囚狱 13.900677652
+赵炅亲 13.2075304714
+戴得牢 13.900677652
+外双溪 12.8020653633
+良好开端 11.3357282945
+云山雾罩 11.1280889297
+爷们 9.38981814546
+和田河 10.8561552143
+民脂民膏 10.6818018271
+烂糊 13.2075304714
+九九八十一日 13.2075304714
+晶体振荡器 11.5027823792
+林御史 13.900677652
+西至潼 12.8020653633
+立其子 12.2912397395
+营养元素 10.3743171274
+梁乙 11.598092559
+发行人 7.58351296523
+梁九 12.2912397395
+上学时 10.604840786
+再遇 11.1280889297
+小齿轮 13.2075304714
+撒向 11.2616203224
+一百万贯 13.900677652
+投敌 9.96885201925
+唱赞歌 11.9547675029
+蔡美彪 11.7034530746
+吴懿四 13.2075304714
+雷扎耶 13.900677652
+蔡京那 12.8020653633
+车飞黄 12.8020653633
+铝硅酸盐 10.9562386728
+兴妖作怪 13.2075304714
+再造 9.41204128224
+罗尼柯 13.2075304714
+梁上 9.71102290995
+恭候大驾 13.900677652
+春季 7.87239913175
+漏着 13.900677652
+流毒 10.6818018271
+徐盛二 12.8020653633
+一千多个 11.7034530746
+梁丘 12.1089181827
+梁凤仪 12.2912397395
+通利 11.2616203224
+谢诺阿 13.2075304714
+阿音扎 12.8020653633
+再选 11.0674643079
+洁净室 13.900677652
+销声匿迹 9.85762638414
+整形科 13.900677652
+黄白红 13.900677652
+二手钢琴 13.900677652
+党建 10.1164880181
+艾奥瓦 11.2616203224
+一千多万 11.5027823792
+春子 12.5143832909
+改革者 10.7226238216
+几千株 13.2075304714
+考务费 12.8020653633
+小吃摊 12.8020653633
+晋级 10.0294766411
+春宫 12.5143832909
+斜过去 13.900677652
+五百多万 12.2912397395
+崔州平 12.5143832909
+不利条件 11.0103058941
+粉笔画 11.8212361103
+一百万斤 12.8020653633
+奴儿干 10.4666904475
+生田川 13.2075304714
+债各有主 12.5143832909
+中州 8.35941410682
+石榴裙 11.7034530746
+梅毒 9.63799777493
+安排表 13.2075304714
+梁代 11.5027823792
+小兄弟 10.3171587135
+金登干 12.8020653633
+奏功 12.8020653633
+性理 11.1926274509
+秋水共长天一色 12.5143832909
+秋收季节 12.5143832909
+波澜 9.02548032877
+佩着 11.3357282945
+军阀统治 11.2616203224
+会员国 9.77354326693
+踢来踢去 12.8020653633
+北魏初 11.7034530746
+泽登巴尔 12.5143832909
+北方昆曲剧院 13.2075304714
+晋绥 10.4666904475
+无源元件 13.900677652
+和琏儿 13.2075304714
+降起 13.900677652
+苍狼 11.1926274509
+片种 12.2912397395
+揽住 11.1280889297
+贾代化 13.2075304714
+吉顼 12.8020653633
+科主任 10.604840786
+王芳 12.1089181827
+伸屈 11.7034530746
+梁亦 13.2075304714
+皇袍 13.900677652
+博闻强识 12.8020653633
+任光禄 13.900677652
+宽网 13.2075304714
+钥匙孔 11.5027823792
+踢倒 10.4041700905
+论者 9.48183704418
+彭翼 13.2075304714
+戈拉腊 13.2075304714
+丰塔纳 12.5143832909
+春寒 11.4157710022
+为什么 5.28672079213
+一百万户 12.8020653633
+宣王转 13.2075304714
+斑点狗 12.5143832909
+梅汁 12.5143832909
+梅汝 12.2912397395
+梅江 10.8561552143
+平喘 10.533381822
+一窝蜂 9.48183704418
+于襄州 13.2075304714
+流沙 8.98802276624
+蛋羹 11.7034530746
+叶亦 13.900677652
+宗赐皇后 13.2075304714
+史亦称 12.8020653633
+伺弄 12.8020653633
+背信弃义 10.0505300503
+陈凯歌 11.2616203224
+开包 12.8020653633
+那小龙 12.5143832909
+改良派 10.1394775363
+产者 12.2912397395
+若非 9.04086524761
+护发品 13.900677652
+岛津 13.2075304714
+一个二十三岁 12.8020653633
+苍生 9.62401153296
+历顺宗 13.2075304714
+许久许久 11.8212361103
+乔丹 10.8561552143
+小本儿 12.5143832909
+一盘棋 10.9562386728
+梅氏 11.598092559
+晋祠 10.2897597393
+德比尔 13.2075304714
+流泄 12.8020653633
+露酒 12.1089181827
+流泉 10.8561552143
+同义词 10.4349417492
+房产频道 13.900677652
+封二 11.598092559
+配料表 13.900677652
+德克斯特 13.900677652
+新年 8.83177344976
+党委 8.17709255002
+倡导者 9.55687223012
+遗留下 10.8096351986
+白礼文 10.533381822
+犯罪心理 13.900677652
+故知 10.6818018271
+流注 10.4666904475
+流泪 8.02014466558
+满足感 11.0674643079
+若需 12.1089181827
+查严阵 13.2075304714
+懿行 12.8020653633
+搜索 7.46934657004
+白酒业 11.1280889297
+市场营销 10.0088573539
+论法 11.4157710022
+流泻 11.3357282945
+绥阳县 13.900677652
+列出 8.39128931535
+刘阁学 12.5143832909
+新兴产业 7.75649201785
+保正庄 12.8020653633
+胡庸医 13.2075304714
+娇嗔 10.533381822
+划地 11.598092559
+本尼迪克 13.2075304714
+兔年 13.900677652
+怡然 11.2616203224
+安土桃 13.2075304714
+撒去 12.5143832909
+流民 9.08039608637
+流氓 8.6803218269
+柠条 12.5143832909
+被动挨打 11.1926274509
+开疆拓土 10.5684731418
+女阿姨 13.900677652
+党外 10.9562386728
+划在 11.7034530746
+德培 10.2371160058
+总投资额 9.91169360541
+吴军兵 12.8020653633
+美参议院 12.5143832909
+梅隆国民 13.2075304714
+歇气 11.0674643079
+德城 12.1089181827
+片约 12.5143832909
+印章 8.98069672615
+三五十米 13.2075304714
+鬼市 11.1926274509
+流水 7.90174109003
+发行价 7.07413242842
+招生网 12.5143832909
+一小块 9.20932976975
+嘘声 11.1280889297
+原子钟 10.9049453784
+常含银 13.2075304714
+控制联想 13.900677652
+练下去 13.900677652
+哈伯 11.3357282945
+流汁 13.900677652
+私藏枪支 13.900677652
+三岔镇 11.9547675029
+管不住 10.2117981979
+原动力 10.2630914922
+封三 12.1089181827
+自娱性 11.8212361103
+产能 6.23492422011
+封上 10.0720362555
+列克 10.8561552143
+若鞠 12.5143832909
+梅沃 12.8020653633
+娇喘 12.5143832909
+轮战 13.2075304714
+马克尼 13.900677652
+蔚竹庵 12.8020653633
+一闪而过 10.4349417492
+流汗 10.4994802703
+取暖器 12.1089181827
+封丘 9.98865464655
+谁给我 11.1926274509
+蛙叫声 13.900677652
+勾龙 13.2075304714
+列入 7.46292600224
+靶标 12.2912397395
+铆钉机 13.900677652
+戴星冠 13.2075304714
+封个 12.2912397395
+点心店 13.2075304714
+考核成绩 13.900677652
+列兵 11.0103058941
+慷慨激昂 9.45802639549
+主干线 11.0674643079
+封主 12.1089181827
+封为 8.04274449749
+翘起 9.72629038208
+趁势 9.11318590919
+赫特尔 12.5143832909
+性状 8.69119149913
+般的 6.90582766614
+坡面流 13.2075304714
+计算题 12.5143832909
+知照 12.1089181827
+英明领导 13.2075304714
+管不了 9.32596667347
+殷鉴 12.1089181827
+流涕 9.74179456862
+中子 8.4801426527
+遮盖着 12.1089181827
+主干网 13.2075304714
+外观设计 10.1871055853
+封信 8.12612610643
+中共福建省委 11.4157710022
+偏西南 12.5143832909
+中学 7.17925195119
+渐化 13.900677652
+台钟 12.8020653633
+再降 10.765183436
+和鼎晖 12.8020653633
+描绘下来 13.2075304714
+地貌学 10.533381822
+闷气 9.65218240993
+陆书 13.2075304714
+千多米 12.1089181827
+加高 9.75754292558
+优先权 10.4041700905
+历桑 13.900677652
+尤利 13.2075304714
+辛苦 7.5273578624
+藏语文 12.5143832909
+缸瓦 13.900677652
+分批交货 13.2075304714
+娜娜 11.9547675029
+施乐公司 12.2912397395
+流淌 8.83808261895
+上网卡 11.0103058941
+方方 10.604840786
+彭祖 11.1926274509
+梅洛 10.9049453784
+抗干扰能力 10.1394775363
+陆上 8.15447446144
+三两日 12.5143832909
+供求矛盾 10.8561552143
+斜颈 11.8212361103
+陆丰 11.5027823792
+设站 11.5027823792
+偏西北 12.8020653633
+角斗 11.1280889297
+螯合物 12.1089181827
+拉米夫定 11.3357282945
+划回 12.8020653633
+封侯 9.94943393339
+信叔 10.604840786
+设立 6.00300950125
+渐升 12.5143832909
+日知录 11.1926274509
+涅涅茨 12.8020653633
+三代同堂 13.900677652
+邵醉翁 13.2075304714
+设计模式 12.5143832909
+性爱 9.59661255877
+中富 11.5027823792
+封住 8.75318317516
+滥竽 13.900677652
+小辫儿 12.2912397395
+挑选出 10.7226238216
+德国 5.52597010886
+鲁克往 13.2075304714
+方整 11.3357282945
+奶油色 12.8020653633
+去取 8.55357012126
+楚健 10.5684731418
+轮换 8.96620371885
+紧急命令 12.1089181827
+铆是铆 13.900677652
+大阳线 9.14708746087
+迎风招展 12.2912397395
+苑西筑 13.2075304714
+农畜产品 10.0720362555
+中导 11.9547675029
+鲁灵光殿 12.8020653633
+呼啸而过 11.8212361103
+栽进去 12.5143832909
+流派 7.80710788193
+流流 12.1089181827
+陆云 11.598092559
+贝克勒尔 12.2912397395
+钢笔尖 12.2912397395
+中宁 11.5027823792
+酸性染料 12.5143832909
+鬼影 10.0720362555
+禀奏 9.56994431169
+轮指 13.2075304714
+地层 7.43453292774
+专有名称 13.2075304714
+溺婴 12.8020653633
+选载 13.2075304714
+危立 12.8020653633
+中实 11.7034530746
+产自 9.98865464655
+林镇抚 12.8020653633
+奏响 11.2616203224
+分子离子 13.900677652
+三十亩 11.4157710022
+香港科技大学 12.8020653633
+中客 12.5143832909
+吉田 10.642581114
+渐变 9.6811699468
+流浪 8.76487921493
+封伯 11.598092559
+春川 13.900677652
+国联军 11.7034530746
+吉甫 11.8212361103
+举止端庄 13.2075304714
+朴实无华 10.3453295905
+再障 13.900677652
+倒来倒去 12.8020653633
+搜罗 9.43476953332
+料事 11.8212361103
+文书处理 13.2075304714
+救苦 11.1280889297
+成熟 6.13426075396
+法体恒 12.8020653633
+城市气候 12.2912397395
+六万五千余箱 13.2075304714
+艳妆 12.2912397395
+会员卡 11.0103058941
+常厥居 12.8020653633
+流溢 11.1926274509
+消肿 9.56994431169
+压气机 10.9049453784
+西海固 12.5143832909
+闾而立 13.2075304714
+春帆 11.1280889297
+气死人 11.8212361103
+高赛尔 12.2912397395
+历次 8.78868986362
+希尔顿饭店 13.900677652
+守土有责 11.1926274509
+言可喻 13.900677652
+严挺之 13.2075304714
+骨瘦如柴 10.604840786
+乖离 10.8096351986
+外资保险 13.900677652
+景昌极 13.2075304714
+支付款 13.900677652
+地志 10.3171587135
+中堂 8.50251495046
+木棍子 10.9562386728
+任士人 13.2075304714
+地心 10.1871055853
+溪口镇 11.9547675029
+平等性 13.900677652
+扛不住 11.7034530746
+卸到 12.5143832909
+德格尔 13.2075304714
+挑选到 11.9547675029
+堂姊妹 13.900677652
+流满 11.8212361103
+主导者 11.9547675029
+梅港 13.900677652
+新闻电影 12.8020653633
+鸩酒 11.1926274509
+洁净度 12.8020653633
+盐业 9.21854642485
+立体影片 13.900677652
+下起 9.59661255877
+加香 12.8020653633
+林昌彝 12.5143832909
+久仰 10.7226238216
+料件 13.900677652
+佩特 11.9547675029
+若问 10.765183436
+认罪 9.7898037878
+异性 9.17328983326
+戎马余 13.2075304714
+转变思想 12.2912397395
+窦固 11.0674643079
+科技实业 13.2075304714
+消耗 7.04106274832
+加饭 11.8212361103
+寿香腾 13.2075304714
+佩带着 12.8020653633
+乔德里 13.900677652
+红塔集团 11.9547675029
+大九卿 11.2616203224
+责任内阁 10.9562386728
+伸头 10.533381822
+延平路 13.900677652
+一水儿 12.8020653633
+村民代表 9.89334446674
+料中 12.5143832909
+中士 10.7226238216
+贡礼 12.2912397395
+步步登高 13.900677652
+认罚 13.900677652
+韩剧 12.1089181827
+方晓 11.9547675029
+蒋士铨 11.8212361103
+先会 12.8020653633
+地当 9.5062284973
+竹岐 12.1089181827
+久之 10.604840786
+久久 8.30225569298
+祸患 10.1394775363
+社会民主工党 10.0088573539
+刘联军 11.7034530746
+服刑犯 13.2075304714
+经久耐用 11.1926274509
+科教卫 13.900677652
+保密性 10.642581114
+煮成 10.4666904475
+认缴 11.5027823792
+护士服 13.900677652
+粉笔灰 12.8020653633
+支修益 12.8020653633
+凯末尔 10.4666904475
+梅溪 11.8212361103
+姜堰市 12.8020653633
+地形 6.57355435972
+加餐 11.5027823792
+莫哈夫 13.900677652
+牵进去 13.900677652
+来乾清 11.0674643079
+司法公正 12.8020653633
+列印 13.2075304714
+迷踪失路 12.8020653633
+鬼屋 13.900677652
+一个多元 13.2075304714
+地库 11.9547675029
+先付 11.598092559
+罗斯丹 12.5143832909
+角柱 13.2075304714
+地底 8.9519177616
+负债人 12.8020653633
+道边 12.1089181827
+地府 10.4994802703
+热喷涂 13.900677652
+中套 11.9547675029
+中奖 9.17328983326
+明月山 12.8020653633
+麻黄草 12.5143832909
+桔黄色 12.1089181827
+方柱 10.9049453784
+农委会 13.900677652
+阿炳扶 12.1089181827
+卓别林 11.0674643079
+三两枝 12.5143832909
+辅导课 13.900677652
+唐长安 11.8212361103
+麦洛村 13.2075304714
+蛋粉 12.1089181827
+加盐 11.2616203224
+殷遗 12.5143832909
+加拉白垒峰 12.5143832909
+黄柏富 13.900677652
+认给 13.2075304714
+先代 11.9547675029
+两碗饭 12.5143832909
+蒸腾系数 13.2075304714
+乌达河 12.8020653633
+先以 9.84023464143
+外宽内忌 13.900677652
+中备 12.1089181827
+南岳谢 13.2075304714
+特奈斯 11.8212361103
+降解 9.58318953844
+国光社 12.8020653633
+四山五岳 12.2912397395
+艺术工作者 11.4157710022
+宋之制 12.5143832909
+察合台 9.19114745066
+马群 10.9562386728
+黑心肝 13.900677652
+久保 9.87532596124
+先予 13.2075304714
+中外 7.59440236503
+渐入 10.1394775363
+苍白 8.39941944143
+引航员 13.2075304714
+街心 10.2117981979
+灵岩寺 11.0103058941
+惊叹不已 11.3357282945
+第十五届 10.765183436
+先人 9.05649056552
+中大 9.27570483869
+散杂货 12.8020653633
+角果 11.3357282945
+小表哥 13.900677652
+中央 5.16370656672
+中天 9.24671730182
+阡陌 10.7226238216
+德吉 13.900677652
+佩玉 11.7034530746
+点题 12.2912397395
+黑心肠 13.900677652
+领略 9.46986085313
+蛋糕 8.71889410168
+扭过头 9.82314020807
+怀朔镇 12.5143832909
+未登记 13.2075304714
+深文周内 12.8020653633
+先交 11.4157710022
+成天价 12.8020653633
+家电行业 9.6811699468
+网罗人才 12.2912397395
+破格录取 12.2912397395
+去函 13.900677652
+生态乡 13.900677652
+地市 10.1164880181
+波段 7.56917580208
+三两本 13.2075304714
+轮辋 11.9547675029
+耶里 13.900677652
+方杰 11.9547675029
+吹牛 9.69598503258
+加顿 13.900677652
+窝里斗 11.9547675029
+罗大帅 12.5143832909
+沙滩排球 12.8020653633
+牟寻 12.8020653633
+卢瑟福 9.94943393339
+先买 10.6818018271
+一九一四年 13.900677652
+地带 6.75076081584
+圆椎 12.8020653633
+紧地 11.7034530746
+于襄平 12.8020653633
+于北魏 10.2630914922
+潜在状态 13.900677652
+粗饲料 12.2912397395
+方木 11.5027823792
+性灵 10.533381822
+牟定 13.900677652
+方术 9.40086798165
+鲁滨逊 11.1280889297
+阿炳抢 12.8020653633
+先世 9.80633308975
+薄昭 13.2075304714
+先上 9.96885201925
+先下 10.7226238216
+汉嘉郡 13.2075304714
+蛋类 10.533381822
+弦线 11.3357282945
+千村万户 13.900677652
+去冬 11.0674643079
+先为 10.2117981979
+地平 10.3171587135
+致人死命 11.7034530746
+十余头 13.900677652
+鱼尾纹 10.765183436
+耍耍 10.5684731418
+好人家 10.3171587135
+春心 11.2616203224
+波比 12.8020653633
+张志新 13.2075304714
+春忙 13.2075304714
+桂林山水 10.604840786
+撤编 12.8020653633
+国朝文 12.5143832909
+王舜 12.1089181827
+戎马中 13.2075304714
+渐减 11.1926274509
+先严 12.1089181827
+历三世 12.1089181827
+华东政法 12.1089181827
+去年 5.53152053939
+鸡叫 9.66657114738
+川江 10.0505300503
+不用谢 12.5143832909
+解任 11.8212361103
+陈诚系 13.2075304714
+轮滑 12.8020653633
+罗尼河 13.2075304714
+煮法 12.5143832909
+如若不然 12.1089181827
+乾乾净净 13.2075304714
+多半儿 13.2075304714
+江西省上饶地区 11.8212361103
+官府菜 13.2075304714
+娇女 12.5143832909
+特快车 13.900677652
+方济各 10.533381822
+内向 9.01787572939
+娇好 12.5143832909
+划定 8.55834340001
+不屑于 10.4994802703
+麻渣 13.900677652
+貌合神离 11.4157710022
+解付 11.8212361103
+撒开 9.69598503258
+惠皇后 13.2075304714
+官翰林 12.2912397395
+射住 10.5684731418
+沉渣泛起 13.900677652
+麻札塔 13.2075304714
+劳资科 13.900677652
+聂昌 12.8020653633
+成瘾 10.4994802703
+篆刻家 10.6818018271
+加鞭 10.3743171274
+片片 10.3453295905
+解人 12.5143832909
+寻丁霸 13.2075304714
+历数 9.82314020807
+第十五卷 10.6818018271
+施济 13.2075304714
+益州牧 11.1280889297
+激振器 13.2075304714
+领空 10.0088573539
+于基尔 12.5143832909
+文艺工作者 10.6818018271
+解了 9.11318590919
+开县 10.6818018271
+煮沸 9.69598503258
+中国护士 13.900677652
+卫立煌 11.7034530746
+角梁 12.8020653633
+濒于 9.49395840471
+坐江山 10.8561552143
+三百三十一 13.2075304714
+盘星藻 13.2075304714
+阿炳洗 13.2075304714
+吉卜利 12.1089181827
+印盒 13.900677652
+发射系统 10.0294766411
+伸在 11.598092559
+九九乘法 13.900677652
+五千亿元 13.900677652
+煮汁 13.900677652
+水法 10.5684731418
+卡萨斯 12.5143832909
+博采众议 13.900677652
+了如指掌 9.65218240993
+硫酸锰 12.8020653633
+灵平 13.2075304714
+往昔 9.62401153296
+德寿 11.1280889297
+洪水横流 13.2075304714
+启动时 11.1926274509
+虎背熊腰 12.1089181827
+方案 5.85220890831
+解义 12.2912397395
+解乏 10.6818018271
+方桌 9.6811699468
+迷天大罪 11.9547675029
+地貌图 11.8212361103
+煮汤 11.1926274509
+地儿 10.3171587135
+方框 11.1280889297
+架出去 12.8020653633
+石志坚 12.1089181827
+卫国战争 9.72629038208
+中国 3.02732068666
+中图 13.2075304714
+中固 13.900677652
+濒临 8.45394028031
+开叉 12.8020653633
+毛丛 13.2075304714
+控制情绪 12.2912397395
+川沙 9.21854642485
+解严 13.2075304714
+方根 12.5143832909
+送旧迎新 12.8020653633
+玄德惊 11.8212361103
+方格 9.87532596124
+独立思考 10.4666904475
+水幕 12.1089181827
+硫酸锌 12.5143832909
+地光 11.8212361103
+驱雷掣电 13.900677652
+德容 12.8020653633
+解下 9.14708746087
+纪实 10.4041700905
+黄奇帆 11.598092559
+苍秀 12.5143832909
+历时 7.60725837313
+德宏 11.0674643079
+轮渡 9.93038573842
+娓娓动听 11.4157710022
+夏承德 11.3357282945
+娇妻 11.3357282945
+业余人员 13.900677652
+德安 10.2117981979
+改装车 11.4157710022
+德宗 10.2630914922
+石闵 13.2075304714
+危矣 10.2371160058
+解丘 12.8020653633
+陈文洪 7.83456956187
+沙姆沙伊赫 12.5143832909
+人无远虑 11.8212361103
+摔到 10.5684731418
+中国地产 11.5027823792
+内难 12.5143832909
+交付 7.88452049228
+煮水 11.3357282945
+限高 12.1089181827
+马里兰大学 11.9547675029
+明白 5.21847862598
+渐弱 11.1926274509
+射上 13.900677652
+流向地 13.2075304714
+纳坦兹 13.900677652
+沙头角 12.1089181827
+灯光师 12.1089181827
+阴阳界 12.2912397395
+不假思索 9.84023464143
+印着 9.85762638414
+川流 11.3357282945
+加雷 13.2075304714
+中坝 13.2075304714
+中坜 12.5143832909
+彭生 13.900677652
+列岛 9.33632946051
+第一趟 13.900677652
+中坚 10.0505300503
+中坤 13.900677652
+超凡脱俗 11.598092559
+射中 9.15574552361
+亲丁 12.5143832909
+缚牢 12.8020653633
+陵水 10.8096351986
+现成 8.38322475551
+伐柯 13.900677652
+单口相声 12.5143832909
+印督 13.900677652
+渐开 12.1089181827
+妙不可言 10.7226238216
+通儒 12.5143832909
+歌曲体裁 13.900677652
+撒布 10.7226238216
+心如刀绞 10.9562386728
+盐亭 11.9547675029
+徒有虚名 10.9562386728
+孙大闹 13.900677652
+除甲醛 13.2075304714
+洄游 9.48183704418
+陆费逵 12.1089181827
+中圈 12.2912397395
+第六十一回 12.2912397395
+波数 11.5027823792
+一百多里 10.642581114
+中土 10.1164880181
+余本 11.598092559
+春兰 9.93038573842
+傲立 11.5027823792
+唐继尧 10.533381822
+春光 9.96885201925
+德威 11.598092559
+自动楼梯 13.900677652
+春元 13.900677652
+光纤 9.77354326693
+杭汉便 12.8020653633
+用不惯 13.2075304714
+字里行间 10.3453295905
+范复粹 12.1089181827
+解散国会 10.6818018271
+金瓜银 13.2075304714
+中场 10.6818018271
+党名 11.9547675029
+福禄诺 12.8020653633
+尚衅鳌 12.8020653633
+石门 7.95525704337
+角楼 10.4349417492
+小黄花 11.9547675029
+中城 11.9547675029
+尊重事实 12.5143832909
+囚禁 8.93783302172
+烦言 13.900677652
+刘秀兄弟 12.8020653633
+高一丈 11.4157710022
+造船工业 10.4666904475
+阴应节 13.2075304714
+气候分类 12.1089181827
+眨巴眼 11.7034530746
+大桥路 13.900677652
+鸦雀无闻 11.9547675029
+流感 7.40089061132
+毛儿盖 13.2075304714
+乘人之危 11.0103058941
+承旨学士 13.2075304714
+渐得 13.900677652
+娇声 10.6818018271
+幸会幸 12.8020653633
+布里顿 12.5143832909
+跌碎 12.1089181827
+春军 13.900677652
+解体 7.97375162601
+属鸡 11.9547675029
+文如其人 12.8020653633
+吉祥 8.62256299275
+死循环 11.9547675029
+列居 12.8020653633
+姓付 13.900677652
+藤原京 13.900677652
+党政军 10.9562386728
+飞扬跋扈 11.0103058941
+中型 7.70423352418
+变得丰美 13.900677652
+党员 7.78478552649
+石钟健 13.2075304714
+批下去 13.900677652
+戴之功 13.2075304714
+看看书 11.7034530746
+点阵 9.96885201925
+春凳 11.7034530746
+朱学范 11.9547675029
+女妖精 12.5143832909
+中垦 12.1089181827
+波旁 10.9562386728
+绿林军 10.8096351986
+往来 7.24523730161
+三年期 10.9049453784
+洞穿 11.2616203224
+点阅 13.900677652
+大嚼 10.7226238216
+去往 10.8096351986
+至日 11.5027823792
+德格县 13.900677652
+刘开渠 12.5143832909
+德奥 10.4994802703
+窦婴 12.2912397395
+荆棘丛 12.2912397395
+娇子 12.2912397395
+下式 10.8096351986
+开刀 9.56994431169
+小朵 12.8020653633
+帅风 13.900677652
+再立 11.5027823792
+旱涝保收 10.3453295905
+历月 11.1280889297
+继任人 11.8212361103
+桂江 10.8561552143
+轮法 13.900677652
+碱土金属 10.4994802703
+去屑 12.1089181827
+列车运行 11.0674643079
+保密法 11.4157710022
+抚州市 12.1089181827
+滚下来 10.2897597393
+春分 10.1630080337
+明月光 12.8020653633
+地县 12.1089181827
+交纳 8.23425096386
+若遂凌 13.900677652
+扈氏战 13.2075304714
+故离 13.2075304714
+榔榆 13.2075304714
+渐小 11.1280889297
+德大 12.8020653633
+东半边 13.2075304714
+沃里戈 13.900677652
+滥用 8.66423568915
+操召入 12.8020653633
+川渝 12.5143832909
+波普 11.9547675029
+傅衣凌 11.5027823792
+德天 13.900677652
+雾灵 13.900677652
+聚头 12.2912397395
+奚王霞 12.5143832909
+理想 6.57618767263
+窦娥 11.9547675029
+阿拉善地区 11.8212361103
+病险 12.1089181827
+小妮子 12.2912397395
+长方体 12.2912397395
+祸水 10.765183436
+地台 9.04864738806
+露齿 11.9547675029
+发作 7.50708689803
+从益州 13.2075304714
+没亲 13.2075304714
+历来 7.43764819506
+洪太尉 12.2912397395
+魏振国 12.1089181827
+脱屣 13.900677652
+吉兰达 12.5143832909
+危疑 12.2912397395
+梅拉 11.7034530746
+列式 12.5143832909
+孙无终 13.900677652
+明瞿 12.8020653633
+英勇斗争 10.7226238216
+无穷的 9.49395840471
+防毒衣 11.7034530746
+阵痛期 11.9547675029
+耍起 12.8020653633
+加镶 13.2075304714
+降落 8.65893063692
+加长 9.07236391467
+法定年龄 13.2075304714
+正正堂堂 13.2075304714
+三四米 11.4157710022
+鼻黏膜 11.598092559
+留底稿 12.8020653633
+纪委 9.31571017331
+瑶草 10.9562386728
+王之世 13.900677652
+经不住 9.96885201925
+适应症 9.91169360541
+数值孔径 13.900677652
+薛红 11.5027823792
+耍赖 10.533381822
+论战 9.11318590919
+吉木乃县 13.2075304714
+斜靠 10.2371160058
+平平凡凡 12.8020653633
+符合标准 9.84023464143
+开初 11.5027823792
+奥斯陆大学 11.3357282945
+性体验 13.2075304714
+电子玩具 12.2912397395
+齐纨鲁缟 13.2075304714
+西客站 12.8020653633
+利卡基 13.2075304714
+党政办 13.900677652
+发信 11.1280889297
+列当 11.8212361103
+特拉维夫 10.8561552143
+铁血网 13.900677652
+力量 5.55664807957
+乌里雅苏台 11.1926274509
+中国残联 12.8020653633
+桑俊 13.2075304714
+诸生求 12.8020653633
+炒金 10.3743171274
+白龙潭 12.5143832909
+事后诸葛亮 12.1089181827
+鸠山由纪夫 8.24818847171
+薛综 12.8020653633
+大相国寺 10.6818018271
+煤堆 10.9049453784
+去岁 10.765183436
+喷赤河 13.2075304714
+非我族类 12.2912397395
+桂河 13.2075304714
+行动队 13.2075304714
+加错 13.2075304714
+闷头闷脑 12.5143832909
+吴懿引 12.8020653633
+中商 10.533381822
+俞之阴 13.900677652
+流掉 12.8020653633
+地力 10.0940151622
+发为 10.9562386728
+降薪 11.7034530746
+池阳 11.8212361103
+拉瓦锡 10.2371160058
+发丧 9.96885201925
+彭真 11.3357282945
+发个 10.2117981979
+被领导者 13.2075304714
+重要职责 12.2912397395
+长夜短 13.2075304714
+枉费唇舌 13.900677652
+发丝 10.3743171274
+大吵一架 11.9547675029
+脉冲功率 13.2075304714
+囚笼 11.3357282945
+起居饮食 11.7034530746
+王惠平 9.4233408375
+伺候 7.95003509939
+老有所学 13.2075304714
+德塞 12.8020653633
+地动 10.0940151622
+发上 10.642581114
+发不 11.3357282945
+北国风光 12.2912397395
+力道 10.4994802703
+病从口入 12.1089181827
+发乳 10.2897597393
+倾倒垃圾 12.2912397395
+摸上来 13.2075304714
+圆梦 10.9562386728
+德堡 13.2075304714
+地勘 11.598092559
+娇娜 13.2075304714
+段时间 7.75220935606
+输血反应 12.2912397395
+娇娘 13.900677652
+娇娇 11.598092559
+娇娆 12.5143832909
+蒿本 13.2075304714
+娇娃 11.8212361103
+畸胎瘤 12.2912397395
+方殿 12.1089181827
+发书 11.8212361103
+点钱 11.3357282945
+连绵不绝 11.2616203224
+事业部 9.59661255877
+侦察队 12.1089181827
+苍穹 10.4994802703
+晋王镇 13.2075304714
+勾通 11.1926274509
+春华 11.1926274509
+往日 7.69208762588
+明叔去 12.2912397395
+陈贻范 13.2075304714
+力避 11.598092559
+党团 10.4041700905
+党国 10.2117981979
+麻酱 12.5143832909
+中唱 13.2075304714
+点钟 9.84023464143
+点钞 13.900677652
+彩墨画 13.900677652
+承揽人 13.900677652
+吉拉尔 13.900677652
+波束 10.4994802703
+发乎 12.8020653633
+搜狗 12.1089181827
+钱匣子 13.2075304714
+搜狐 8.81308131674
+印痕 10.6818018271
+轮流 8.05713323494
+方正 8.9102450652
+发人 11.9547675029
+子目录 11.4157710022
+报复性 9.84023464143
+郭载代 13.2075304714
+韩景侯 11.9547675029
+传输速率 13.2075304714
+张结义 13.2075304714
+紧靠在 11.5027823792
+艳后 12.2912397395
+于豫皖 13.2075304714
+审查 7.48394536946
+老婆子 8.70772080109
+发亮 8.83177344976
+榆钱 11.598092559
+汽车论坛 13.900677652
+消费 5.28165015468
+方歌 13.900677652
+地刺 11.8212361103
+列席 10.3743171274
+可做饭 13.900677652
+樱桃沟 11.598092559
+佩罗 11.7034530746
+电影剧本 10.0505300503
+后殿里 12.8020653633
+柴草堆 12.8020653633
+波林 12.2912397395
+伢子 12.1089181827
+立国安邦 13.900677652
+江湖骗子 11.4157710022
+发了 7.99804431857
+奥德河 13.900677652
+伸向 8.94485059437
+大竹岭 12.8020653633
+娇嫩 9.58318953844
+发于 9.69598503258
+民族音乐 10.765183436
+论据 10.0720362555
+鬼兵 13.900677652
+花和尚 10.5684731418
+发件 13.900677652
+大阳烛 13.900677652
+奥尔良城 13.2075304714
+开榫机 13.2075304714
+发语词 13.900677652
+发令 10.3743171274
+靶机 11.0103058941
+三两步 13.2075304714
+阿尔斯通 12.5143832909
+周延儒 9.59661255877
+德境 13.2075304714
+斜阳 10.0940151622
+刊登 7.74794495727
+热情接待 11.8212361103
+发付 10.6818018271
+掷骰子 10.8096351986
+教育性 12.8020653633
+阿尔及利亚 8.61747392324
+年根儿 13.2075304714
+是非口舌 13.900677652
+崔胤兼 13.2075304714
+冲激 11.1926274509
+雷震会 13.900677652
+脂酸 13.2075304714
+禄米 10.8096351986
+有益于 9.40086798165
+祁连山脉 9.96885201925
+公园区 13.900677652
+不必因 12.5143832909
+算了吧 9.66657114738
+摩肩接踵 11.0103058941
+党内 8.43684584695
+村人 9.94943393339
+德彪 13.2075304714
+伸去 12.2912397395
+判若两人 10.4349417492
+眺览 13.900677652
+党军 13.2075304714
+印版 11.2616203224
+信用等级 9.96885201925
+施食坛 13.2075304714
+温玉 13.900677652
+村井 13.900677652
+横穿马路 12.5143832909
+明通 13.2075304714
+圆柱齿轮 11.5027823792
+纪录 7.52395070408
+斯数域 13.900677652
+流播 12.8020653633
+忍下 11.5027823792
+第二个 6.93465346487
+江卫 11.7034530746
+沙捞越 10.9562386728
+通经致 12.2912397395
+方法 4.96780503004
+复印纸 13.2075304714
+选修科目 13.900677652
+列姆 13.900677652
+中切 12.8020653633
+中分 10.4994802703
+城乡人民 11.1280889297
+烟味儿 12.8020653633
+不发火 12.5143832909
+一国之主 11.0674643079
+黄世仁 12.2912397395
+波恩 9.77354326693
+伯阳父 12.2912397395
+骄傲情绪 12.5143832909
+宋之天 13.2075304714
+禁风 13.900677652
+炒面 10.604840786
+纪弦 12.8020653633
+中创 11.8212361103
+供水量 12.5143832909
+快没了 12.5143832909
+炒青 11.9547675029
+艳史 11.9547675029
+碳酸氢钠 10.0720362555
+封灵藏 12.8020653633
+萧大观 13.2075304714
+珠圆玉润 12.5143832909
+领导带头 12.5143832909
+中学校长 9.63799777493
+领圈 13.2075304714
+艾伯特湖 12.5143832909
+英人 10.765183436
+安联保险公司 12.8020653633
+林玉露 13.2075304714
+重离子 10.5684731418
+纪念 7.4191005227
+百万人次 12.8020653633
+露馅 11.2616203224
+陕西省榆林地区 12.8020653633
+无偿援助 12.1089181827
+召募 10.4666904475
+排版系统 12.8020653633
+廉节 13.2075304714
+村中 9.04086524761
+囚粮 13.900677652
+问道 5.643810803
+闻风而至 13.900677652
+曾令木 13.2075304714
+联席会 11.7034530746
+列夫 10.2117981979
+村东 11.598092559
+九百九十六年 13.2075304714
+风声水起 13.900677652
+彭先生 13.900677652
+蓝飞陪 13.2075304714
+绑架人质 12.8020653633
+划开 10.8561552143
+店钱 12.5143832909
+梅梅尔 12.8020653633
+村上 10.3743171274
+领结 11.1926274509
+辖制 11.5027823792
+有功者 11.7034530746
+纪德 11.3357282945
+张嬴川 12.5143832909
+黑塞哥维那 10.604840786
+细胞器 9.80633308975
+民主法制 11.4157710022
+中办 13.2075304714
+连康熙 12.8020653633
+土壤湿度 12.2912397395
+民族民间 11.7034530746
+第二任 10.6818018271
+部党组 10.8096351986
+列奥 12.2912397395
+霍将军 13.900677652
+踢开 9.82314020807
+中加 9.54396882529
+第二份 11.0103058941
+进门处 12.2912397395
+第二件 9.53122979951
+池里 11.8212361103
+认生 11.9547675029
+列女 10.7226238216
+数百具 13.2075304714
+纪律 8.03420959504
+第二代 8.79473217808
+片目 13.900677652
+颞颥 11.4157710022
+诏示 11.3357282945
+论断 9.03314320152
+稍逊风骚 13.2075304714
+自动记录 12.2912397395
+纪年 9.17328983326
+相处 8.2985588311
+轮毂 9.96885201925
+中华 7.21232293803
+中午 6.99693039439
+汪伪政权 11.598092559
+中南 8.61747392324
+去学 10.5684731418
+汉弗莱 11.4157710022
+伸脚 12.8020653633
+兵凶战危 12.8020653633
+资产负债率 9.26594866375
+殉节 10.3171587135
+大学生 7.49710345404
+计算机网 11.5027823792
+力阻 12.5143832909
+性关系 10.4041700905
+论文 7.32142643997
+吴王夫 10.2630914922
+中卫 10.4666904475
+架好 12.2912397395
+勾陈 12.5143832909
+射成 11.9547675029
+撒娇 9.56994431169
+量力而为 12.2912397395
+中印 9.21854642485
+贾家沟 12.2912397395
+牢不可破 11.3357282945
+王蔼 13.2075304714
+财贸战线 13.900677652
+夷为平地 10.4041700905
+防水材料 12.1089181827
+罗大哥 13.900677652
+颇具规模 11.1280889297
+论旨 11.7034530746
+方步 11.598092559
+冯保刚 12.5143832909
+铩羽而归 11.0674643079
+小额贷款 9.30555780184
+知礼 10.8561552143
+中北 11.2616203224
+中化 9.96885201925
+第二位 8.18036587537
+娇小 10.3453295905
+力陈 10.9049453784
+掰腕子 13.900677652
+史密森 11.5027823792
+虚则实之 13.900677652
+长港 12.5143832909
+露顶 12.5143832909
+统购派购 13.2075304714
+德布 13.2075304714
+石函 12.8020653633
+村俗 12.5143832909
+命该如此 12.2912397395
+忍住 8.50251495046
+太乙仙 13.900677652
+薛祥 13.2075304714
+流时 13.2075304714
+店长 11.598092559
+领罪 11.5027823792
+黄昏时分 9.84023464143
+特兰斯 13.2075304714
+中医 7.56385192083
+中区 10.9049453784
+骈四俪六 12.5143832909
+芦林潭 12.8020653633
+绕线 12.5143832909
+烂片 13.2075304714
+盆腔 9.7898037878
+郑汝成 12.5143832909
+欺人自欺 13.2075304714
+年轻有为 10.765183436
+石棉制品 13.2075304714
+价值千金 11.7034530746
+中友 12.5143832909
+家传注 13.2075304714
+第二例 11.4157710022
+论政 11.7034530746
+中发 11.5027823792
+薛禄 13.900677652
+七百二三十枚 13.2075304714
+眼科医院 10.6818018271
+一百二十元 12.5143832909
+弦马 13.900677652
+地名 8.4284069783
+中古 9.87532596124
+处女膜 11.4157710022
+划帐 13.900677652
+方济 12.8020653633
+解解渴 12.8020653633
+咖啡馆 9.98865464655
+超市货架 12.5143832909
+中叶 6.97704902384
+金鼓旗 11.9547675029
+中台 11.3357282945
+流放 8.62767809341
+中厅 11.4157710022
+萧衍之 13.2075304714
+詹金斯 13.900677652
+大曲酒 11.1926274509
+惊恐万分 11.9547675029
+德克勒克 11.7034530746
+放大镜 10.0940151622
+第十五回 11.7034530746
+体香 11.9547675029
+中压 11.8212361103
+清凉剂 12.8020653633
+过站 13.900677652
+中原 6.15480942218
+今年冬天 11.2616203224
+怜贫恤老 13.900677652
+蛋白 7.98988100794
+中厚 11.8212361103
+论敌 13.2075304714
+奥德赛 9.58318953844
+梅斯 10.9562386728
+片石 11.9547675029
+目瞪口歪 13.900677652
+方洁 13.900677652
+吉林省政府 12.8020653633
+卸妆 10.3453295905
+店门 10.2897597393
+露天剧场 12.1089181827
+诸城市 11.5027823792
+隐忍着 11.5027823792
+熬日子 13.2075304714
+扭过去 11.5027823792
+绕组 10.2371160058
+中县 12.1089181827
+开动 9.27570483869
+中去 7.60725837313
+地垒 11.0674643079
+苍大头 13.2075304714
+留余地 13.900677652
+列宁 7.9526426628
+认知 8.70772080109
+望云 13.900677652
+伸冤 10.1871055853
+中央细胞 12.2912397395
+列宗 12.1089181827
+副局级 12.1089181827
+处女航 13.900677652
+二百六十五块 13.2075304714
+地垄 12.8020653633
+郁化火 11.3357282945
+海蓝色 12.1089181827
+廉者 13.2075304714
+钵盂 10.2897597393
+廉耻 10.4349417492
+莫须有 10.4349417492
+力量感 11.4157710022
+李翰祥 13.2075304714
+布里尔顿 13.2075304714
+七角井 11.8212361103
+套个 13.900677652
+艳冶 13.900677652
+加里 10.4994802703
+加重 7.21731670621
+炒锅 11.5027823792
+烘云托月 13.900677652
+楼花厅 13.2075304714
+点金 11.1926274509
+列宾 11.3357282945
+主办地 13.900677652
+无症状 9.85762638414
+岛村 13.900677652
+翱翔 9.84023464143
+虫媒传粉 13.2075304714
+塌陷地 13.900677652
+南宫市 13.900677652
+地域 7.25688791883
+党参 9.11318590919
+帕契姆 13.2075304714
+伸出 7.13103567512
+人事行政 11.3357282945
+祸根 9.75754292558
+爱丁堡 9.84023464143
+桂树 11.1280889297
+杰日尼奥夫角 13.900677652
+徐溥 13.2075304714
+下一场 10.3171587135
+烂熟 10.1394775363
+同希洛 13.2075304714
+盆花 10.4666904475
+怀着鬼胎 11.7034530746
+娇弱 11.1926274509
+茶褐色 11.3357282945
+地基 9.16447920358
+加醋 11.2616203224
+吉纳 12.5143832909
+成眠 11.4157710022
+白浪掀天 12.8020653633
+百万富翁 10.1394775363
+砂金石 13.900677652
+牟利 9.46986085313
+烂熳 12.8020653633
+勾销 11.2616203224
+中值 9.82314020807
+点醒 11.4157710022
+外交关系 8.88339781516
+无量数 13.900677652
+党史 11.2616203224
+千美元 11.7034530746
+前后一致 12.5143832909
+碑石 10.642581114
+去声 11.8212361103
+总该 10.4994802703
+永安乡 13.2075304714
+高枝 11.0103058941
+修仙求 12.2912397395
+计算机系 13.900677652
+倾城而出 13.2075304714
+流明 13.2075304714
+临危时 13.900677652
+德巴 12.2912397395
+到处跑 11.8212361103
+地圈 11.9547675029
+林业厅 12.5143832909
+互补性 11.0674643079
+流星 8.90346537821
+硬货 13.900677652
+郾城县 13.2075304714
+玉蕊科 12.5143832909
+湄潭 12.8020653633
+古波斯 10.4994802703
+晋王 9.48183704418
+桂森 12.8020653633
+内部测试 11.7034530746
+渐增 9.5062284973
+告老在家 13.900677652
+华尔街 8.45825994145
+加酒 13.900677652
+梅曼 12.1089181827
+降耗 11.8212361103
+本神 12.5143832909
+奏得 13.2075304714
+德州 9.58318953844
+德川 10.0294766411
+德尔福 10.9049453784
+波折 9.34680076038
+斯梅尔塞 12.8020653633
+中央委员 8.26588804881
+春园 11.8212361103
+空酒瓶 12.2912397395
+地坑 12.5143832909
+洛伦索 13.900677652
+地块 7.61467955747
+地坛 10.8561552143
+短叹长吁 13.2075304714
+英商立 13.2075304714
+毁灭者 13.900677652
+王蓁 11.3357282945
+广开言路 11.5027823792
+伸入 8.9308643524
+沉淀剂 11.7034530746
+艳光 13.2075304714
+禄祚 13.900677652
+亨伯 11.8212361103
+专题研究 10.8561552143
+口喊 13.2075304714
+春困 12.1089181827
+施虐癖 13.900677652
+齐乃霸 12.8020653633
+经折儿 11.9547675029
+廉能 13.900677652
+达卢普 13.900677652
+炊金馔玉 13.2075304714
+作品展 11.598092559
+钮扣 10.533381822
+中储 10.765183436
+内地 6.38969989996
+颞骨 12.1089181827
+认真 6.40847460936
+耍酒疯 13.900677652
+鬼呀 11.5027823792
+地坪 12.1089181827
+白冠长 11.8212361103
+哈尼法 11.9547675029
+赵王歇 13.2075304714
+单纯词 12.1089181827
+王小义 11.4157710022
+设点 11.0103058941
+陇西县 13.900677652
+中允 11.8212361103
+信丰县 11.7034530746
+中元 8.61241062128
+审查员 13.2075304714
+樱桃核 13.2075304714
+榻板 13.2075304714
+纪山 12.2912397395
+周密安排 11.9547675029
+水位计 12.8020653633
+党办 13.900677652
+办嫁妆 13.2075304714
+德山 10.4041700905
+孙必达 13.900677652
+宗皇帝 12.8020653633
+梅村 11.0674643079
+历戎 11.7034530746
+遣词造句 12.5143832909
+樱桃树 12.8020653633
+购书 11.9547675029
+片甲 11.9547675029
+避避风头 12.2912397395
+公学里 13.900677652
+间隔号 13.900677652
+党务 9.89334446674
+强夺民 12.5143832909
+上海银行 10.8561552143
+大奖赛 10.642581114
+董乙 12.8020653633
+梅松 13.900677652
+中共 7.29402746578
+购买 5.74560276416
+中关 12.2912397395
+少东家 10.9049453784
+顺城街 11.8212361103
+澳柯玛 11.5027823792
+梅杰 11.5027823792
+斯帕克 12.8020653633
+廷根 13.900677652
+武馆 13.2075304714
+去头 13.900677652
+王奶奶 11.0103058941
+陈九如 12.8020653633
+人民代表大会 9.10488710638
+救荒 11.8212361103
+禀受 11.8212361103
+降至 7.72273353793
+马尔维纳斯 11.8212361103
+吕产 12.8020653633
+纾解 12.8020653633
+碎石机 13.900677652
+吴王孙 13.900677652
+大包干 13.2075304714
+王小丫 13.2075304714
+斜过来 13.2075304714
+店面 9.40086798165
+亿立方米 7.37564799413
+驾云 9.85762638414
+吉林大学 10.9049453784
+地图 6.93182727363
+塑化剂 13.900677652
+转让费 11.0103058941
+吕二 9.18217878068
+斯帕兹 12.8020653633
+德尔 9.91169360541
+去处 8.11378027061
+一星半点 11.2616203224
+消解 9.7898037878
+脾气暴躁 10.642581114
+去夏 11.9547675029
+战战栗栗 13.900677652
+出国者 13.900677652
+温特 11.9547675029
+里边儿 11.598092559
+党刊 11.0674643079
+马克坦 13.2075304714
+牟取 10.1164880181
+王二小 12.5143832909
+彭玉 12.8020653633
+拽了起来 12.2912397395
+吉罗 11.5027823792
+必无此事 12.8020653633
+知荣辱 13.2075304714
+环坐 12.5143832909
+超员 11.7034530746
+驾乘 9.54396882529
+降脂 11.2616203224
+钥匙圈 13.2075304714
+中凯 13.900677652
+莫名其妙 8.03420959504
+购价 12.1089181827
+捉贼捉赃 12.8020653633
+犏牛 11.3357282945
+未尽事宜 13.900677652
+盈利性 10.6818018271
+越江隧道 12.1089181827
+露骨 9.80633308975
+中出 10.1871055853
+羊肉片 12.1089181827
+四折 11.0103058941
+王小二 11.9547675029
+董亭 12.1089181827
+阿蒂 11.9547675029
+明其理 13.900677652
+中册 12.1089181827
+伯颜任 12.5143832909
+黑双色 13.2075304714
+轮椅 9.74179456862
+梅枝 12.5143832909
+五百万两 11.4157710022
+阳宅 10.9049453784
+梅拉拉 11.5027823792
+中农 9.77354326693
+不用说 7.96578345636
+奥帕林 13.900677652
+中军 7.80260336981
+董事 6.99592688201
+国联安 9.66657114738
+流来 11.1926274509
+敌对状态 11.9547675029
+卸完 11.2616203224
+溃兵游勇 13.2075304714
+加选 12.2912397395
+杜麦特 13.2075304714
+胶体化学 11.9547675029
+马鞍桥 13.2075304714
+再种 11.598092559
+中冷 11.8212361103
+中冶 8.22392384971
+刊物 8.15128466607
+兔唇 12.8020653633
+安琪马 12.5143832909
+加速 6.1766729953
+古意盎然 12.8020653633
+列文 12.2912397395
+发电 7.08943327337
+岛外 11.5027823792
+克服缺点 13.900677652
+内资 10.4349417492
+封立 12.8020653633
+睦邻 10.9049453784
+地榆 11.0674643079
+推向市场 10.3171587135
+轮回 8.58747167293
+梅塔 13.2075304714
+名同实异 12.8020653633
+脱氧剂 12.2912397395
+基础薄弱 9.29550746599
+跃动 10.765183436
+五反运动 12.5143832909
+川味 13.2075304714
+列斯 11.4157710022
+阿炳进 12.2912397395
+发生 4.3489485776
+劈风斩浪 13.900677652
+波尔 10.0088573539
+天娱 11.5027823792
+三万里 13.900677652
+印书 10.9562386728
+基本前提 11.5027823792
+鸿篇 13.900677652
+语言特点 11.8212361103
+科教文 12.8020653633
+解盐 12.2912397395
+先秦 7.84155445639
+划掉 11.2616203224
+吉马 13.2075304714
+邕宁县 11.5027823792
+聂帅 13.900677652
+武汉长江大桥 11.7034530746
+沉淀法 13.2075304714
+孩子王 12.8020653633
+中渎 12.2912397395
+艺术团 11.3357282945
+干湿表 13.900677652
+撒来 13.2075304714
+来旺儿 13.900677652
+数百万 9.20932976975
+窦性 11.9547675029
+印上 10.8561552143
+印下 12.8020653633
+建设银行 7.57631868959
+鲜荷叶 12.8020653633
+高尔基体 10.7226238216
+嘘气 12.8020653633
+中渚 13.900677652
+吴先生 9.44633035572
+列日 11.4157710022
+种豆 11.4157710022
+内质 11.5027823792
+谜儿 12.8020653633
+中港 11.0103058941
+来时路 12.5143832909
+踢掉 11.7034530746
+春桃 10.6818018271
+地槽 9.5186510173
+糟透了 11.5027823792
+内贸 10.765183436
+聚胺 13.2075304714
+催款单 13.900677652
+首都师范大学 13.900677652
+叉形 10.4666904475
+毛皮 8.71889410168
+胭脂虎 13.900677652
+换货 12.8020653633
+发疹 12.2912397395
+换购 10.4666904475
+山东电力 12.1089181827
+先祖 9.66657114738
+民运部 13.2075304714
+兴高采烈 9.20932976975
+加拉茨 13.2075304714
+福利彩票 10.7226238216
+韩语 13.2075304714
+解百 11.7034530746
+祸国 11.2616203224
+穆里埃 12.2912397395
+发疯 8.80692745117
+驾照 10.5684731418
+唐巾 12.8020653633
+渐暗 12.1089181827
+列支 11.3357282945
+桂园 13.2075304714
+恩赐者 13.900677652
+韩诗 11.9547675029
+罗斯福 9.04864738806
+古镜卦 13.2075304714
+设伏 10.5684731418
+人力资本 9.77354326693
+往常 7.93453091285
+耐不住 10.1871055853
+续费 13.900677652
+私营经济 10.2117981979
+同命相连 12.8020653633
+羞面见人 13.2075304714
+无可争议 10.9562386728
+设使 12.1089181827
+次生矿物 12.5143832909
+紫江企业 9.74179456862
+何其相似 12.1089181827
+换起 13.900677652
+波峰 10.604840786
+聚聚 11.9547675029
+长舌妇 12.2912397395
+宝钗进 12.8020653633
+王蒙 10.533381822
+续赛 13.2075304714
+暗通款曲 12.8020653633
+过竿 13.900677652
+中国民间文艺家协会 13.900677652
+发痒 9.63799777493
+斯凡语 13.900677652
+弦索 10.604840786
+陶鼎 12.5143832909
+沉淀池 13.2075304714
+发病 7.48721869481
+往年 7.6604018068
+见貌辨色 13.900677652
+必争之地 11.1280889297
+十四次 12.1089181827
+逃下去 12.8020653633
+宽衣解带 11.8212361103
+往往 5.53616954823
+钱少胆 13.900677652
+变速齿轮 13.900677652
+召见 7.83456956187
+米家镇 9.94943393339
+使劲 7.72689154807
+六十四天 13.900677652
+模型模拟 13.2075304714
+岑毓英 11.7034530746
+蔡京命 13.2075304714
+兔毫 10.9049453784
+理事长 8.3555002075
+马角 13.2075304714
+方凳 11.5027823792
+自然语言 10.4349417492
+狼奔豕突 12.8020653633
+毛石 13.2075304714
+兔毛 11.8212361103
+丰滦密 12.8020653633
+梅奥 12.1089181827
+德才 11.8212361103
+塑胶袋 13.900677652
+历尽 9.84023464143
+表姨父 13.900677652
+问题解答 12.2912397395
+发球 10.533381822
+设于 8.90346537821
+攀登者 13.900677652
+渐有 9.87532596124
+涨过 11.598092559
+党河 11.2616203224
+桂圆 10.3453295905
+才疏学浅 11.7034530746
+阿炳听 11.5027823792
+一饱眼福 11.8212361103
+划拳 10.8096351986
+胶州湾 9.89334446674
+卡莫 12.8020653633
+韩军 12.5143832909
+内调 11.8212361103
+卡莱 11.8212361103
+中演 12.5143832909
+种起 12.8020653633
+入木三分 11.3357282945
+愈富 12.8020653633
+独立行使 12.1089181827
+党法 13.2075304714
+历届 8.9102450652
+庄太太 13.2075304714
+划拨 9.29550746599
+危乎 12.5143832909
+历山 11.1280889297
+栽进来 13.900677652
+原动机 11.0103058941
+散出 10.8096351986
+耗竭 10.9049453784
+陆稻 13.900677652
+方内 13.900677652
+产成品 9.54396882529
+笔调 10.0720362555
+封箱 13.2075304714
+薪火相传 13.2075304714
+方军 13.900677652
+德成 13.900677652
+匕鬯不惊 13.900677652
+趁机 7.8604229407
+划拉 10.8561552143
+若明若暗 12.1089181827
+设为 9.82314020807
+封神演义 11.598092559
+地栗 12.8020653633
+后空翻 11.9547675029
+陆站 12.5143832909
+十九世纪 9.89334446674
+马科 10.2371160058
+棉织业 10.8096351986
+聚脂 11.7034530746
+荷里活 13.900677652
+地标 10.533381822
+数理化 9.98865464655
+婚姻制度 10.6818018271
+方兴 10.765183436
+充塞着 13.2075304714
+方克 13.900677652
+卷逃 12.2912397395
+物排放 13.2075304714
+换调 13.2075304714
+论处 10.1394775363
+地核 10.3171587135
+方兄 12.5143832909
+德拉 9.71102290995
+高朗 10.4349417492
+流失 8.33233314821
+设下 9.66657114738
+调试信息 13.2075304714
+邵元 13.2075304714
+骑车去 12.8020653633
+踢打 11.4157710022
+娇惯 11.1926274509
+德拜 10.8096351986
+和田市 12.5143832909
+聚脲 12.2912397395
+日常支出 11.9547675029
+非农产业 13.2075304714
+生角 12.5143832909
+赫维留 13.2075304714
+班达亚齐 13.900677652
+卡茨 11.9547675029
+角儿 10.2117981979
+跃升 9.44633035572
+梅妃 13.2075304714
+三两六 13.2075304714
+乖乖 8.67493097826
+花柱异长 13.900677652
+大出风头 11.9547675029
+褚绍唐 13.2075304714
+樱桃园 11.598092559
+马秣 12.1089181827
+拿药 11.3357282945
+谭嗣同 8.87679713113
+叼上 12.8020653633
+十年生聚 12.2912397395
+霍罗波 13.2075304714
+卸料 12.1089181827
+壮夫不为 13.2075304714
+科迪亚克岛 13.2075304714
+杉谷先生 13.2075304714
+尚书 6.81980975528
+划手 10.9562386728
+德慧 12.8020653633
+古德伊尔 11.8212361103
+中汇 11.2616203224
+同袍 13.2075304714
+美通公司 13.900677652
+阿勒波 13.2075304714
+撒放 12.2912397395
+物质刺激 12.8020653633
+左后方 11.7034530746
+用不完 10.9049453784
+意向书 8.21031819765
+银甲峡 12.8020653633
+夫运 13.900677652
+热热身 13.2075304714
+说书人 12.2912397395
+加瓦 12.5143832909
+中江 10.8096351986
+值星官 13.900677652
+蒙圣恩 11.9547675029
+内小臣 13.2075304714
+内转 11.3357282945
+米厂 11.598092559
+地段 7.91171623509
+牵进来 13.900677652
+仙灵脾 13.2075304714
+吕珍 12.2912397395
+爱国热情 10.4666904475
+陆祥 13.900677652
+驾驶员 8.0746775446
+不可胜数 10.2630914922
+伏诛 10.9049453784
+射电 9.13850371718
+探亲流 12.1089181827
+尸毗王 12.8020653633
+射界 10.4041700905
+岛子 11.1280889297
+南方澳 13.2075304714
+使出 8.6966709649
+不等量 11.0674643079
+素质 7.83922073305
+乌达姆 12.8020653633
+身兼多职 13.900677652
+慈恩大师 12.8020653633
+中气 10.4994802703
+于彝陵 12.8020653633
+梅娘 12.8020653633
+苯教 12.8020653633
+奏捷 11.7034530746
+节气门 12.2912397395
+波幅 9.26594866375
+传世之作 11.2616203224
+装聋作哑 10.604840786
+牛鼻 11.7034530746
+商汤陈 12.8020653633
+角力 10.3171587135
+发着 9.63799777493
+生男育女 12.8020653633
+余起 11.3357282945
+国家药监局 10.604840786
+大宅门 12.8020653633
+须防仁 12.5143832909
+地毯 8.13548654919
+种地 8.61241062128
+哭天嚎地 13.900677652
+天涯若比邻 11.8212361103
+四氢吡咯 12.1089181827
+独到之处 10.1164880181
+一万五千元 12.2912397395
+姜太公钓鱼 13.2075304714
+毛瑟 11.1926274509
+列有 11.5027823792
+中法 9.16447920358
+赵炅统 13.2075304714
+磺胺 10.0940151622
+腹足 10.2371160058
+万般皆下品 13.900677652
+第二点 10.3453295905
+先签 13.900677652
+中波 10.9562386728
+用书 11.0103058941
+方剂 9.31571017331
+彭亨 11.5027823792
+李良嗣 13.2075304714
+夜郎国 10.9562386728
+伟大事业 11.1926274509
+洗脸盆 11.2616203224
+绝代佳人 11.8212361103
+中泰 9.45802639549
+桂花树 10.765183436
+中泽 13.900677652
+换车 10.604840786
+全固态 13.2075304714
+醉过 13.2075304714
+历志 12.5143832909
+往届 12.5143832909
+使其 10.9562386728
+任何理由 10.3171587135
+阔叶树 9.61021821083
+成矿 9.24671730182
+撒旦 10.8096351986
+发矢 12.5143832909
+国家行政学院 11.4157710022
+打门 10.765183436
+耗神 13.900677652
+阿赫玛 12.5143832909
+唯唯喏喏 12.8020653633
+中沙 10.4349417492
+噍类 13.900677652
+三二百个 12.8020653633
+解宝便 12.2912397395
+拍掉 12.8020653633
+廉政 10.6818018271
+功能分析 12.5143832909
+张永年 13.900677652
+弃旧图新 12.2912397395
+唐传奇 11.4157710022
+金交椅 10.9562386728
+阿方索 11.5027823792
+夷族 11.0103058941
+方刚 13.900677652
+大好河山 11.7034530746
+中河 11.4157710022
+地步 7.43764819506
+接满 13.900677652
+尤勒 11.4157710022
+中油 9.87532596124
+着眼 7.85094419674
+侯东莱 13.2075304714
+宫粉黛 12.5143832909
+先站 11.3357282945
+中流 9.69598503258
+方可 8.1386262692
+一句句 10.9562386728
+方口 11.5027823792
+官能单体 13.900677652
+流完 12.8020653633
+晋中 10.1630080337
+保护层 10.7226238216
+万水千山 11.3357282945
+毛病 7.8161782389
+彭伟 13.2075304714
+李他娘 13.900677652
+梅子 8.15447446144
+郑氏抗 13.2075304714
+原子笔 12.5143832909
+靶心 10.6818018271
+清凉油 12.1089181827
+购物 7.93197009199
+解痛 13.900677652
+召请 11.4157710022
+中海 8.23771717184
+青河县 12.1089181827
+先端 9.77354326693
+涨跌 7.8604229407
+师夷智 12.8020653633
+敲下 13.2075304714
+方叔 12.5143832909
+止暴禁非 13.2075304714
+德性 9.96885201925
+谋财 12.5143832909
+症结 9.44633035572
+晋书 10.1164880181
+波形 9.59661255877
+每周六 11.9547675029
+三峡库区 12.1089181827
+闻见香 12.5143832909
+望江州 13.2075304714
+发白 9.31571017331
+搀住 10.4994802703
+田不礼 13.2075304714
+内踝 11.8212361103
+流寓 10.8096351986
+三两只 12.1089181827
+方向舵 10.8096351986
+三两句 13.900677652
+行业性 10.9562386728
+宿鸟 11.5027823792
+春歌 13.2075304714
+纸上谈兵 10.9562386728
+历年 8.40350942668
+专业名词 12.8020653633
+一九六二年 12.2912397395
+路军夫 13.2075304714
+川圹 12.8020653633
+南非政府 13.900677652
+牛鸣 13.2075304714
+跃出 10.0505300503
+雷坛 12.8020653633
+中洲 12.1089181827
+张狼皮 12.8020653633
+解疑 13.900677652
+中派 11.0103058941
+波雅尔 12.2912397395
+万大溪 12.8020653633
+夜游症 13.900677652
+韩国现代 11.598092559
+亨特 8.38322475551
+产业政策 8.33615724465
+德惠 12.5143832909
+汕头 9.16447920358
+奏报 9.32596667347
+涨起 11.8212361103
+晋京 11.4157710022
+齿音 12.5143832909
+波德 11.5027823792
+王萍 13.2075304714
+牛黄 10.3171587135
+溺水 10.533381822
+撒播 10.9049453784
+常看到 12.8020653633
+黄白之 11.9547675029
+透视镜 13.900677652
+封神 13.2075304714
+吕牙 12.8020653633
+趁早 8.80692745117
+重结晶 10.5684731418
+梁绪 12.1089181827
+方升 11.7034530746
+羊肉串 12.1089181827
+请求权 10.9562386728
+发皇 13.900677652
+奏折 8.4284069783
+高松 10.533381822
+外家 11.3357282945
+薛凤祚 12.8020653633
+晋代 9.56994431169
+即刻 8.2985588311
+久等 10.2117981979
+发直 10.2117981979
+不连贯 10.8561552143
+石殿中 12.8020653633
+三两卷 13.2075304714
+吕爷 13.900677652
+剩余价值 6.81477618761
+吕爱 13.2075304714
+清凉江 12.5143832909
+郑芒 12.5143832909
+解甲 10.9049453784
+百日维新 10.765183436
+伯颜独 12.1089181827
+擅长于 10.8096351986
+饭后漱口 13.900677652
+美政府 10.3171587135
+角化 10.3171587135
+西洋镜 12.5143832909
+尚丰 13.900677652
+跃入 10.4666904475
+重铬酸钠 12.8020653633
+陵园 9.53122979951
+重铬酸钾 13.2075304714
+护国佑民 13.2075304714
+婢子 10.0294766411
+越君 12.5143832909
+轮唱 12.5143832909
+丝瓜络 12.8020653633
+方化 13.900677652
+射猎 9.85762638414
+杨长得 13.900677652
+卖国贼 10.3171587135
+老掉牙 10.604840786
+梅屋 12.1089181827
+趁手 13.2075304714
+室性早搏 12.2912397395
+公安局长 11.1926274509
+鹿子霖 8.42421410004
+木刻水印 13.900677652
+管理费 8.87023973058
+便民网 12.5143832909
+梅展 12.1089181827
+春水 10.2630914922
+梁祝 10.3743171274
+岛崎 12.5143832909
+李文蔚 13.900677652
+对我讲 10.4994802703
+第一零一回 13.2075304714
+衙门 6.83335780332
+渐成 10.1630080337
+桂剧 12.2912397395
+耗羡 13.2075304714
+大润发 13.2075304714
+八脚 13.2075304714
+数百人 9.04086524761
+任基尔 12.8020653633
+片中 10.0294766411
+梅山 10.6818018271
+牛饮 11.8212361103
+癌变 10.2897597393
+和琴音 13.900677652
+走露 11.1926274509
+立少子 13.2075304714
+陆缘 11.4157710022
+叉子 10.8561552143
+连四明 13.900677652
+鲁克湖 11.9547675029
+涢水 11.8212361103
+光照度 11.8212361103
+佛老 12.2912397395
+汉川市 13.900677652
+职业联赛 11.1280889297
+纪末 12.1089181827
+梅尔 10.765183436
+床帐 11.1926274509
+水青冈 10.9049453784
+炸油饼 13.900677652
+广告公司 10.7226238216
+伏皇后 11.8212361103
+轻飘 11.0103058941
+回答者 12.8020653633
+购用 12.8020653633
+纤维瘤 12.2912397395
+春江 10.6818018271
+棕衣 13.2075304714
+溺毙 12.2912397395
+春汛 10.2117981979
+周共王 13.2075304714
+波塞 12.8020653633
+德望 12.5143832909
+轻风 11.1280889297
+刘渊回 13.900677652
+费多尔 12.1089181827
+延平南路 13.900677652
+灵山 9.22784881751
+内视 12.2912397395
+地洞 9.5062284973
+双扇门 13.900677652
+抚远 10.8561552143
+艺术水平 10.0720362555
+毛片 11.598092559
+洛克希 13.2075304714
+鲁梅哈 13.2075304714
+求知欲 11.3357282945
+忍辱偷生 12.8020653633
+内角 11.8212361103
+韩进 11.8212361103
+自选集 13.2075304714
+两本书 10.9562386728
+全唐诗 10.2371160058
+秦中 13.2075304714
+聚落 9.49395840471
+用量 8.4980002701
+酸懒 13.900677652
+能冶铸 12.8020653633
+黄庭坚 9.93038573842
+流尽 10.7226238216
+孙天勤 13.900677652
+玩艺 10.9049453784
+腹语 12.8020653633
+薛定谔 10.4041700905
+春泥 13.2075304714
+职业赛 13.2075304714
+伸展出 12.2912397395
+波士 13.900677652
+定海区 12.5143832909
+乌拉尔山脉 9.91169360541
+优选法 11.598092559
+溺死 10.3171587135
+营养价值 8.96620371885
+章鱼 10.642581114
+梅岭 11.3357282945
+方合 11.598092559
+文学理论 10.4349417492
+北魏改 11.5027823792
+胶柱鼓瑟 12.5143832909
+北魏攻 13.2075304714
+封王礼 11.8212361103
+艺校 12.2912397395
+手指缝 11.1280889297
+牺牲者 10.2897597393
+液体状态 12.2912397395
+发货量 11.8212361103
+方君 13.900677652
+不茶不饭 13.900677652
+匿名性 12.1089181827
+收运 13.2075304714
+散剂 11.1926274509
+方向 5.34638137261
+单放机 13.2075304714
+填实 11.4157710022
+内行 9.59661255877
+吉百利 11.1926274509
+电焊机 12.8020653633
+德普 12.1089181827
+有林地 10.4041700905
+顾问公司 10.604840786
+十几万元 11.2616203224
+波夫 11.0674643079
+网情深 13.2075304714
+桂南 10.9049453784
+独裁政权 10.765183436
+涂料 8.96620371885
+柳二哥 13.900677652
+没养 12.2912397395
+知己知彼 10.5684731418
+内衬 10.6818018271
+倪欣雷 12.5143832909
+全国科学大会 12.2912397395
+一日三餐 10.4994802703
+中止 8.39941944143
+牛顿 8.27666014579
+总裁 7.25428713713
+内衣 9.26594866375
+生逢圣 13.2075304714
+观赏鸟类 13.900677652
+须海棠 13.900677652
+往家 9.98865464655
+骤变 10.4666904475
+级服务器 13.900677652
+轮台 10.533381822
+天不怕 11.8212361103
+但薇薇 13.2075304714
+逍遥游 11.598092559
+波多 12.2912397395
+核心层 11.9547675029
+政务次官 12.1089181827
+佳话 10.1164880181
+财务科 13.900677652
+疯疯癫癫 10.8096351986
+佛脚 12.8020653633
+千多种 11.3357282945
+负隅顽抗 10.4666904475
+吸水率 11.7034530746
+桂北 11.1280889297
+奏摺 13.900677652
+驽马 13.900677652
+发火 8.87023973058
+使团 9.48183704418
+佳评 13.900677652
+换装 8.83808261895
+中欧 8.39941944143
+莎草科 10.642581114
+德昂 10.8561552143
+阿赖耶识 11.5027823792
+毛玻 13.2075304714
+德明 12.2912397395
+德昌 11.3357282945
+岛屿 7.1241706596
+董理 12.5143832909
+用途 6.96725462625
+泻下剂 12.2912397395
+地波 11.8212361103
+工资水平 10.2371160058
+相保奏 13.900677652
+王为治 13.2075304714
+敬茶 11.7034530746
+纪昀 11.598092559
+甘谷 11.8212361103
+撒手 9.46986085313
+灵芝 9.48183704418
+绑架案 10.9049453784
+领馆 10.9049453784
+地气 10.604840786
+文艺思想 11.2616203224
+奥金莱 12.8020653633
+通传 11.0674643079
+陶马 12.1089181827
+中比 10.9049453784
+台钻 13.900677652
+梅州 11.1926274509
+司法腐败 11.9547675029
+施光南 12.5143832909
+于襄江 13.900677652
+中毒 7.59622884955
+陆终 11.598092559
+濒湖脉学 13.900677652
+德曼 12.5143832909
+冰浴 13.900677652
+发炮 11.1280889297
+祸及 11.0674643079
+查哈尔 10.1394775363
+周年纪念 11.0103058941
+首都经贸大学 12.8020653633
+那坡 13.2075304714
+今冬明春 10.6818018271
+倾巢来犯 13.900677652
+党校 10.0088573539
+吕蒙引 12.5143832909
+阿拉伯联合酋长国 10.1630080337
+访问量 11.5027823792
+苟且之心 13.900677652
+埃罗芒 13.900677652
+右半球 12.2912397395
+用以 7.0590621755
+拿的出手 12.8020653633
+陆续 6.31336714595
+发炎 9.55687223012
+健力宝 10.8561552143
+岳父母 11.598092559
+轻饶 9.82314020807
+换衣 11.0674643079
+续行 10.9562386728
+中奖人 12.5143832909
+虚幻 9.43476953332
+谋议 11.1926274509
+川军 10.2371160058
+量块 13.2075304714
+鹑衣 13.900677652
+施艺 13.2075304714
+发烧 8.64840422393
+大盖帽 11.2616203224
+蒙大那 13.2075304714
+称奇道绝 13.900677652
+发热 7.6468488404
+董璋 12.2912397395
+钢笔水 13.900677652
+周境有 12.8020653633
+换血 11.8212361103
+毛猴 12.8020653633
+换行 10.4994802703
+张民表 10.7226238216
+余秋雨 8.84443184663
+毛猿 12.1089181827
+续表 13.900677652
+发烟 10.2117981979
+普通商品 10.1630080337
+中段 8.28390655431
+复音词 12.8020653633
+大群人马 13.900677652
+毛猫 13.900677652
+毛猪 12.1089181827
+去掉 8.49350588052
+偃师县 11.9547675029
+睨视 13.2075304714
+撒拉 10.1871055853
+奏本 9.27570483869
+朱里亚 13.900677652
+解热 9.89334446674
+罗尼加 12.8020653633
+花格 11.4157710022
+高血糖素 11.0103058941
+丛一丛 12.5143832909
+营缮 11.0674643079
+方国 10.4994802703
+春游 10.9562386728
+成岩成 13.2075304714
+归田录 12.2912397395
+脱贫致富 11.7034530746
+卡伯特 11.8212361103
+傍靠 13.900677652
+逍遥津 11.4157710022
+轻骑 9.27570483869
+阿炳半 13.2075304714
+卷叶螟 13.2075304714
+中档 10.7226238216
+陵区 10.1630080337
+事竟成 13.900677652
+天鹅绒 10.5684731418
+川剧 10.3171587135
+岛弧 9.84023464143
+法亚尔 13.2075304714
+逍遥派 12.5143832909
+手起刀落 10.4994802703
+管理中心 8.86372504956
+久经 9.80633308975
+纪政 12.8020653633
+囫囵吞枣 12.2912397395
+通什 11.7034530746
+中栏 13.900677652
+四分天下 13.900677652
+满布 10.4994802703
+大马士革 9.7898037878
+八面来风 13.2075304714
+梁孝王 11.8212361103
+伯颜督 12.8020653633
+太尉蒋 13.2075304714
+七千两 12.5143832909
+德政 10.2630914922
+二百七十余年 13.2075304714
+卡蒂 12.2912397395
+中校 9.96885201925
+成活率 10.642581114
+一幕幕 10.0720362555
+满帆 12.2912397395
+牛鬼 12.2912397395
+武高 13.2075304714
+奥德兹 12.2912397395
+临河区 13.900677652
+澎湖列岛 9.89334446674
+卡蒙 12.8020653633
+鲁庄公 12.1089181827
+劳动密集 11.1926274509
+通仙 13.900677652
+发现 4.3730478628
+流布 10.4994802703
+娇柔 11.2616203224
+历官 10.4041700905
+偃卧 12.8020653633
+纪时 11.4157710022
+内证 13.2075304714
+于取媚 13.900677652
+崔念月 12.1089181827
+栅栏门 11.3357282945
+纪日 11.5027823792
+鲁克沁 12.5143832909
+历宋 12.8020653633
+地漏 12.2912397395
+守卫者 12.8020653633
+陵县 10.0940151622
+历害 12.5143832909
+饮水困难 13.2075304714
+棕榈林 13.2075304714
+萨雷姆 13.2075304714
+胡安诺 13.2075304714
+渐悟 11.9547675029
+养性修 13.2075304714
+滋蔓 12.2912397395
+认作 10.4041700905
+玩耍 8.98069672615
+驾着 9.96885201925
+麦克奈尔 13.900677652
+王小石 13.2075304714
+银企合作 11.8212361103
+玩者 13.900677652
+苍髯 11.9547675029
+胡安国 13.2075304714
+特丁基 13.900677652
+甘辉 12.8020653633
+中梁 13.2075304714
+卷面 13.2075304714
+先缝 13.900677652
+德斯 11.1926274509
+卡萨 11.2616203224
+潘朵拉 13.2075304714
+赵鹤寿 11.3357282945
+吸透 13.900677652
+萨彦诺 13.900677652
+箱箧 13.900677652
+德方 12.2912397395
+移栖 13.2075304714
+德文 9.46986085313
+支付宝 10.1164880181
+一毛钱 10.9049453784
+撤下 10.0720362555
+内讧 9.08039608637
+钱士升 12.8020653633
+德国社会民主党 10.2371160058
+纪斌 13.900677652
+国际标准 9.28555713513
+内设 9.91169360541
+轮值 10.642581114
+流年 11.2616203224
+北魏末 10.765183436
+韩超 13.2075304714
+流往 10.8096351986
+川南 10.642581114
+先给 9.08039608637
+伸展到 9.82314020807
+邹应龙 12.8020653633
+复发性 12.5143832909
+桂元 12.8020653633
+计算机辅助 9.87532596124
+李宗吾 13.900677652
+粉面朱唇 13.900677652
+拉美地区 10.9562386728
+国际竞争 10.0940151622
+流得 10.8561552143
+赵之谦 11.4157710022
+流徙 10.1394775363
+越墙 11.7034530746
+骤减 10.0720362555
+列报 13.900677652
+没当回事 11.2616203224
+方城 10.4666904475
+张朝阳 11.0674643079
+素行 13.900677652
+蒿子 12.1089181827
+中楷 13.900677652
+桂兰 11.5027823792
+方域 11.1926274509
+王滩港 12.5143832909
+渐愈 12.2912397395
+花架子 11.598092559
+吹牛皮 11.0674643079
+牛马 8.92394390956
+一小撮 10.2630914922
+鬼混 10.3453295905
+川北 9.96885201925
+川化 10.9049453784
+卷叶蛾 12.1089181827
+从潇湘 13.900677652
+梅开 12.2912397395
+列拉 12.8020653633
+马立 11.9547675029
+渐慢 12.8020653633
+认人 10.765183436
+桶状 11.4157710022
+倍半萜 12.2912397395
+骤冷 12.5143832909
+巩留县 12.8020653633
+关者王 12.8020653633
+平反昭雪 10.7226238216
+射灯 9.34680076038
+方型 12.2912397395
+算一天 11.598092559
+认了 9.36807815882
+苯并呋喃 13.900677652
+拔不出 10.9562386728
+省政府 7.7083151625
+别见怪 12.1089181827
+自重自爱 12.1089181827
+一百万元 12.8020653633
+第二番 13.2075304714
+聂夷 12.2912397395
+发片 13.2075304714
+黄梅山 11.9547675029
+副司令 9.12999302751
+成渝线 12.5143832909
+去意 11.4157710022
+发牌 12.2912397395
+趁愿 12.5143832909
+禽兽不如 11.8212361103
+玄风 12.5143832909
+营房保障 13.900677652
+雨花台烈士陵园 12.2912397395
+高高在上 9.74179456862
+发状 12.5143832909
+物在人亡 12.8020653633
+流弊 10.9049453784
+流式 11.2616203224
+往复 9.6811699468
+素食主义者 12.2912397395
+往外 7.80260336981
+列成 10.3171587135
+数百位 12.5143832909
+素裹 13.2075304714
+两千多个 12.8020653633
+博望坡 12.5143832909
+建新厂 13.900677652
+使君 10.2897597393
+可宽恕 13.900677652
+同论 13.2075304714
+德操 12.2912397395
+合家欢 11.9547675029
+撤佃 13.900677652
+梁端 13.2075304714
+芭堤雅 12.8020653633
+靶子 9.89334446674
+美国大使馆 12.5143832909
+方坚 13.900677652
+谜团 9.94943393339
+川口 10.9049453784
+流弹 11.8212361103
+地温 10.7226238216
+澹台玮 11.1280889297
+方块 10.4994802703
+曹军飞 13.2075304714
+使命 7.96578345636
+由朝庭 13.2075304714
+尉迟伏师 13.2075304714
+核导弹 10.9049453784
+一万五千名 12.8020653633
+罗尼卡 12.8020653633
+辈子 10.1871055853
+风云突变 10.9049453784
+杭忆才 12.5143832909
+临江镇 12.5143832909
+中立主义 12.5143832909
+发狠 9.58318953844
+雁红 11.5027823792
+认为 3.83553904644
+波导 10.2371160058
+闹翻天 12.5143832909
+碑亭 9.96885201925
+奏曲 13.900677652
+桂军 10.5684731418
+数百余 12.5143832909
+风马牛不相及 10.8096351986
+卸掉 10.5684731418
+桂冠 9.85762638414
+任于阗 13.2075304714
+水冻凝 13.900677652
+王小皤 13.2075304714
+方圆 8.7245279194
+臆造 11.4157710022
+绥芬河市 12.2912397395
+发狂 10.0720362555
+奥柏林 12.8020653633
+通中原 11.9547675029
+菩提树 10.7226238216
+乱纷纷 9.84023464143
+梅德 9.91169360541
+牛骨 11.4157710022
+忍痛 9.84023464143
+强刺激 13.2075304714
+毛绒 11.598092559
+方士 9.5186510173
+后悔药 11.5027823792
+色泽斑驳 13.900677652
+春性 12.8020653633
+霍洛曼 13.900677652
+章邯 11.0103058941
+必要性 8.81927328699
+宿一室 13.900677652
+塞林格 12.2912397395
+互通有无 11.3357282945
+毛织 11.0103058941
+毛细 10.9049453784
+发紧 10.6818018271
+踢毽 13.900677652
+发紫 10.3171587135
+轮廓 7.92686804011
+正下方 11.4157710022
+郑荫 13.2075304714
+方壶 10.4041700905
+渐渐 6.36218265256
+利多消息 11.4157710022
+董祀 12.8020653633
+购票 10.5684731418
+今文学 13.900677652
+解组 12.1089181827
+卷首 10.4994802703
+谋虑 11.8212361103
+透光镜 12.1089181827
+桂平 10.8561552143
+解结 13.2075304714
+内蕴 10.765183436
+切萨皮克湾 12.5143832909
+清扫工 13.900677652
+比翼双飞 12.5143832909
+北京中医药大学 11.8212361103
+多次重 13.2075304714
+立法会 11.598092559
+罄尽 11.1926274509
+解约 12.2912397395
+三两声 13.900677652
+越古超今 13.900677652
+博涉文 13.2075304714
+村童 12.2912397395
+中易 11.1280889297
+中星 9.0884932966
+党旗 11.9547675029
+往回 8.15447446144
+拉扎尔 12.8020653633
+毛纲 11.2616203224
+毛纱 11.5027823792
+铁灰色 12.2912397395
+毛纺 9.37888907493
+怵场 13.2075304714
+毛线 9.63799777493
+子亦可 12.5143832909
+吸水纸 13.900677652
+道道 13.900677652
+八页 13.900677652
+孤家寡人 10.8096351986
+莫泽 13.2075304714
+禄俸 13.900677652
+青稞酒 11.0103058941
+吕禄 12.1089181827
+韩范 12.8020653633
+含硼 12.1089181827
+惊觉 10.0088573539
+内藏 10.0088573539
+枫木 13.900677652
+同时代 9.20932976975
+禁而不止 12.8020653633
+载满了 13.900677652
+王钟印 11.1280889297
+划款 11.0674643079
+回避行为 13.2075304714
+炒年糕 13.2075304714
+顾怀远 10.1871055853
+钱益多 12.8020653633
+高才生 12.1089181827
+岛内 9.96885201925
+被动局面 10.3171587135
+托帕希 12.2912397395
+密集度 11.1280889297
+救灾款 12.2912397395
+柿子 9.48183704418
+上上大吉 12.8020653633
+踢死 10.8561552143
+拒赔 11.2616203224
+封牢 13.2075304714
+浦东发展银行 13.900677652
+满座 10.604840786
+山清水秀 11.4157710022
+强夺官 13.2075304714
+吕祖 12.5143832909
+应付裕如 11.7034530746
+心忙意乱 11.4157710022
+董秘 8.32094782599
+川峡 10.9562386728
+桌子板凳 12.2912397395
+笑眯眯 9.05649056552
+表面质量 12.2912397395
+中曾 8.80692745117
+方塔 11.7034530746
+利息收入 9.30555780184
+陵川 11.1926274509
+第二站 11.8212361103
+恪尽职守 10.8561552143
+谢里丹 11.9547675029
+秀水 10.8561552143
+拒贿 12.5143832909
+董禧 12.8020653633
+川岛 11.598092559
+伸来 11.598092559
+英雄形象 11.0103058941
+认识论 8.70218062071
+中暑 9.91169360541
+荐贤 12.8020653633
+侯慧 12.5143832909
+德殿 12.1089181827
+闷得慌 11.0674643079
+陆王 11.7034530746
+变化无穷 10.8096351986
+氢脆 12.8020653633
+宣告成立 9.72629038208
+春情 12.2912397395
+闪锌矿 11.1926274509
+陶晋生 13.2075304714
+樊家岗 13.2075304714
+第六十一条 13.900677652
+炒栗子 11.5027823792
+马克思 7.57274086825
+封爵 9.18217878068
+卡秋莎 13.2075304714
+万纳姆 13.2075304714
+第二章 8.92394390956
+米千石 13.2075304714
+辰阳 13.900677652
+天容 13.900677652
+移过来 12.1089181827
+人力资源 8.19356738723
+梅克 13.2075304714
+沃里克 11.9547675029
+牛作马 12.2912397395
+捏了一把汗 11.0103058941
+暂收 13.900677652
+第二笔 12.2912397395
+邢长春 13.2075304714
+先烈 11.1926274509
+性交 9.38981814546
+中村 13.2075304714
+中材 10.1630080337
+氢能 10.9049453784
+发簪 11.9547675029
+子为帝 11.5027823792
+改弦更张 10.9562386728
+回光反照 13.2075304714
+华蓥山 10.9049453784
+方始 10.1871055853
+中条 12.8020653633
+扭过来 11.8212361103
+待承 12.2912397395
+王宏信 13.2075304714
+管理者 8.94485059437
+春愁 12.1089181827
+明明灭灭 11.4157710022
+秦明领 13.2075304714
+诸王拜 12.8020653633
+梅兹 13.2075304714
+中杰 12.8020653633
+嵌金 11.7034530746
+兵站部 12.8020653633
+工学院 8.98802276624
+性事 12.5143832909
+梅兰 13.2075304714
+梅关 12.1089181827
+轻闲 12.5143832909
+黑方 13.900677652
+噗噗跳 11.8212361103
+中服 12.1089181827
+施特 11.9547675029
+封王 9.89334446674
+中有 6.18778669049
+站得住脚 12.1089181827
+小相岭 11.598092559
+焉敢 10.4349417492
+中朝 9.34680076038
+中期 6.05643693383
+川崎 11.0103058941
+小吃店 10.2630914922
+利用生物 11.5027823792
+富室 10.6818018271
+外交部门 12.2912397395
+先点 11.2616203224
+鹰爪王 12.8020653633
+祖笑 13.2075304714
+谢太后 10.7226238216
+北京科技大学管理学院 13.2075304714
+复合物 10.1394775363
+葡萄牙语 10.2371160058
+毛羽 11.7034530746
+方妙 11.598092559
+王格格 11.8212361103
+四路纵队 12.8020653633
+流出 6.88138099826
+玩过 10.4666904475
+瞬息之间 11.7034530746
+耻辱感 12.8020653633
+中国第二历史档案馆 12.1089181827
+强冷空气 10.3171587135
+艳星 12.8020653633
+芝加哥市 12.1089181827
+戊戌政变 11.5027823792
+沿门 12.8020653633
+王两氏 13.2075304714
+市民化 12.5143832909
+三两天 11.598092559
+主视图 13.900677652
+解署 12.5143832909
+满流承 13.900677652
+主要矛盾 9.84023464143
+不降反升 11.598092559
+脚趾尖 13.900677652
+减摇鳍 13.900677652
+多音字 13.900677652
+卡座 13.900677652
+祸心 12.2912397395
+轮形 13.900677652
+校正曲线 13.900677652
+射线 7.50708689803
+中柱 11.3357282945
+帝女花 13.900677652
+发粉 13.900677652
+波诡云谲 12.8020653633
+贾母歪 12.8020653633
+拉希德港 13.2075304714
+禄丰 10.8561552143
+方天 12.5143832909
+岱山 11.0103058941
+中极 10.533381822
+轮式 8.78868986362
+梅内 13.900677652
+甘肃 6.98000614773
+响叮当 13.2075304714
+方大 9.87532596124
+内蒂 12.2912397395
+梅农 13.2075304714
+中林 13.2075304714
+内蒙 9.11318590919
+撒满 11.5027823792
+历九帝 13.2075304714
+展子虔 11.8212361103
+第二篇 10.604840786
+方头 11.1280889297
+犹疑不决 12.8020653633
+怒火 8.86372504956
+战辽国 13.900677652
+后门进狼 13.900677652
+多次遭 11.8212361103
+流入 6.35528790236
+行血 11.9547675029
+中枢 8.15447446144
+明玉格 11.1926274509
+早上好 11.7034530746
+中枪 11.0674643079
+刀枪 9.10488710638
+爱民模范 13.2075304714
+外交部长 8.89004235788
+破五 11.3357282945
+拒谏 13.900677652
+乔梓 11.8212361103
+方外 11.0103058941
+胱胺酸 13.900677652
+脑细胞 10.642581114
+甘草 8.96620371885
+判例汇编 13.900677652
+偷窥者 13.2075304714
+毛糙 13.2075304714
+化仙 11.598092559
+票面额 11.8212361103
+啄食 10.4349417492
+去污 11.2616203224
+天宗 13.900677652
+伯扬父 13.2075304714
+甘英西 13.2075304714
+甲乙丙丁 12.1089181827
+梁睛 11.598092559
+花纸伞 13.2075304714
+官闻言 13.2075304714
+胡安娜 12.5143832909
+冤家债主 13.2075304714
+耶律重元 13.2075304714
+流动 6.67011449857
+增损 11.598092559
+无码 13.900677652
+地探 12.5143832909
+负债率 9.46986085313
+以毒攻毒 11.3357282945
+论功 10.8561552143
+七百多名 13.2075304714
+桂山 11.7034530746
+西一晃 13.900677652
+核心区 9.31571017331
+德楞 12.8020653633
+定点医院 10.0720362555
+深仁厚泽 11.9547675029
+天宏 12.5143832909
+钱春弦 12.8020653633
+甘茂 13.2075304714
+荣辱观 12.1089181827
+渺无人迹 12.2912397395
+先王 10.5684731418
+私酒 13.900677652
+麻核桃 13.2075304714
+轮岗 11.8212361103
+骨干网 11.9547675029
+伊斯帕尼奥拉岛 12.2912397395
+内涵式 12.8020653633
+梅利 12.5143832909
+苯加氢 12.8020653633
+满汉全席 10.765183436
+收报机 13.2075304714
+强龙不压地头蛇 11.5027823792
+情况通报 11.2616203224
+往哲 13.900677652
+五两一锭 12.8020653633
+胆囊 10.1630080337
+十几年来 9.89334446674
+封点 13.900677652
+太宰白 12.1089181827
+甘菊 13.900677652
+曾荫权 10.4349417492
+操纵箱 13.900677652
+齐文宣 13.900677652
+服劳役 10.642581114
+创始者 10.7226238216
+拒载 10.9562386728
+榔头 11.598092559
+往后 7.73736284794
+笑了笑 8.21031819765
+不值一顾 12.8020653633
+王震将军 13.2075304714
+东南角 9.18217878068
+委中 12.5143832909
+湘潭市 10.1394775363
+胥溪 12.8020653633
+仿制者 13.2075304714
+结雅河 11.7034530746
+论到 11.9547675029
+梅勒 11.9547675029
+感到烦闷 13.900677652
+石刀 10.4666904475
+通上 12.1089181827
+流利 9.45802639549
+酸奶 9.85762638414
+名牌战略 11.598092559
+频谱仪 13.2075304714
+保密局 11.2616203224
+流到 9.13850371718
+抗拒 8.13548654919
+省政协 10.4349417492
+屏蔽掉 12.8020653633
+论列 11.9547675029
+和麟德 13.2075304714
+先猜 12.5143832909
+涨落 9.5062284973
+知交 11.1280889297
+使女 10.642581114
+沼气 9.72629038208
+党权 11.4157710022
+成功感 13.900677652
+泽拉夫 11.8212361103
+无恶不为 13.900677652
+王谢堂前燕 13.900677652
+牛鞅 13.900677652
+知人 10.642581114
+通用汽车公司 9.80633308975
+易筋经 11.8212361103
+马打蓝 12.1089181827
+十一位 12.5143832909
+以私害公 13.2075304714
+历城 10.8096351986
+一万五千多 12.8020653633
+象鼻虫 13.2075304714
+观察员 9.77354326693
+帕斯卡尔 12.2912397395
+热带病 11.9547675029
+知事 10.0720362555
+太乙神 13.2075304714
+一二十里 12.5143832909
+种蛋 13.2075304714
+闭塞性 11.8212361103
+百元大钞 11.8212361103
+瞻前顾后 10.3171587135
+一十七 12.5143832909
+和粉儿 13.2075304714
+论剑 12.8020653633
+牛鞭 11.9547675029
+体系结构 10.0720362555
+萧朝贵 12.2912397395
+极性键 12.1089181827
+私逃 12.2912397395
+哈尼夫 12.8020653633
+骆雨 9.38981814546
+大汗淋漓 10.1871055853
+方寸 10.4041700905
+胸有城府 11.9547675029
+窦武 11.0674643079
+陶铸 12.5143832909
+历嘉 13.2075304714
+来参禅 13.900677652
+私通 10.0940151622
+万古千秋 12.8020653633
+撒气 11.3357282945
+晚学 13.2075304714
+聚议 12.2912397395
+胡马雍 12.8020653633
+中散 11.4157710022
+灵谷 11.598092559
+景帝悉 13.2075304714
+困而学之 13.2075304714
+耗煤量 10.765183436
+聚讼 12.8020653633
+薛传 12.5143832909
+一九四三年 11.0103058941
+炸薯条 12.8020653633
+城乡规划 10.2897597393
+流去 10.8096351986
+不信邪 11.1280889297
+罪责难逃 12.2912397395
+小绵羊 13.900677652
+推来推去 11.8212361103
+罗斯特 12.8020653633
+结发夫妻 12.1089181827
+陶钧 13.900677652
+以文会友 11.7034530746
+女教师 9.6811699468
+临河市 12.2912397395
+改良剂 12.5143832909
+硗薄 13.2075304714
+陶钵 11.9547675029
+行贿者 11.9547675029
+流变 10.642581114
+地拉 9.29550746599
+格德林 11.5027823792
+赭红色 11.5027823792
+方家 9.93038573842
+种蝇 12.2912397395
+浮石 10.8096351986
+论及 9.69598503258
+十华里 11.9547675029
+中支 11.4157710022
+华蓥市 12.2912397395
+波你尼 12.1089181827
+少量 6.86717116769
+知会 9.55687223012
+吴军溯 13.2075304714
+中放 10.8561552143
+景王死 13.2075304714
+中旅 11.7034530746
+太仓港 13.900677652
+陵庙 12.1089181827
+漠河县 11.8212361103
+铁道兵 10.8561552143
+温灸 12.2912397395
+德森 11.4157710022
+梁益 12.8020653633
+村社 9.61021821083
+佩佩 13.900677652
+中旗 12.8020653633
+发红 8.98069672615
+宜清营 13.2075304714
+农业化学 11.0103058941
+宿雨 13.900677652
+司吏目 12.8020653633
+羽化成仙 13.900677652
+桂州 11.598092559
+黄梅调 13.2075304714
+韩胤 11.9547675029
+卡西 10.9562386728
+中日 8.03138073884
+曲室 13.900677652
+角子 12.1089181827
+个人帐户 13.900677652
+驽钝 11.598092559
+中旬 7.06980341733
+甘苦 10.8561552143
+撒沙 13.2075304714
+反常吸收 13.900677652
+射精 10.2897597393
+中时 9.48183704418
+无恶不作 10.6818018271
+方子 10.0720362555
+甘英 11.2616203224
+纪检 10.4041700905
+方孔 11.0674643079
+方字 13.900677652
+摸不着头脑 9.46986085313
+不识货 12.2912397395
+中文 8.14810501315
+陈文帝 12.8020653633
+间隔期 11.9547675029
+通为 12.5143832909
+滋补 9.34680076038
+始料未及 10.8561552143
+解索 12.2912397395
+玩起 10.6818018271
+第二种 8.82550383674
+三千三百五十七刀 13.2075304714
+驰名于世 11.4157710022
+靶场 10.3171587135
+余辆 10.642581114
+划桨 10.765183436
+和菊娃 12.2912397395
+间谍网 12.5143832909
+兵强马壮 10.8096351986
+发给 8.20694551317
+波城 13.2075304714
+先父 10.6818018271
+温火 12.2912397395
+全体学生 11.2616203224
+扭秧歌 12.2912397395
+梅县 10.2897597393
+中新 9.29550746599
+戴上去 12.8020653633
+怪腔怪调 12.2912397395
+中方 7.71036224612
+抚育 9.72629038208
+人声鼎沸 10.1871055853
+居住权 11.3357282945
+湿空气 11.8212361103
+甘蕉 13.900677652
+角峰 10.765183436
+中所 7.13333452671
+九十五万 13.900677652
+湄州 10.765183436
+撒欢 12.1089181827
+朱德庸 12.8020653633
+佳节 9.82314020807
+权教阶 13.900677652
+付款人 11.4157710022
+刎颈 12.5143832909
+伺服 10.9049453784
+一声声 9.6811699468
+斜照 11.598092559
+使得 5.59890788886
+趵突 13.2075304714
+毛竹 9.01787572939
+地方 4.41589243433
+使徒 10.2897597393
+熔融缩聚 12.5143832909
+朱素甫 12.5143832909
+荐见 13.900677652
+颜之推 11.9547675029
+赵子龙 10.1394775363
+咧嘴大笑 13.900677652
+小英予 13.2075304714
+欣羡 12.5143832909
+鱼米之乡 9.74179456862
+方岩 12.2912397395
+内脏 8.25170341381
+范围广 9.69598503258
+黄大豆 12.2912397395
+理想主义 10.533381822
+阿廖欣 12.8020653633
+杭嘉 13.900677652
+梁赞州 12.8020653633
+内出 12.5143832909
+海曙区 12.5143832909
+萎陷 13.2075304714
+虚岁 10.9562386728
+裁决权 11.8212361103
+舞池 11.598092559
+官景州 13.2075304714
+历元 11.2616203224
+发祥 11.7034530746
+中成 10.0940151622
+发票 9.16447920358
+方岳 13.900677652
+角岩 11.7034530746
+齐太公 12.8020653633
+银汉横 13.2075304714
+用餐 9.55687223012
+工商业界 13.900677652
+计算机业 13.2075304714
+扬名后世 13.2075304714
+封皮 10.1630080337
+复印件 9.98865464655
+第十五条 11.4157710022
+村组 11.1280889297
+领书 12.5143832909
+蹁跹 12.1089181827
+中房 10.9049453784
+三维重建 13.2075304714
+窦氏 10.1394775363
+春播 10.1630080337
+牛金 11.7034530746
+故伎 12.8020653633
+戳脊梁骨 12.2912397395
+切夫斯基 10.8561552143
+胸部手术 13.900677652
+薰香 12.5143832909
+料理 8.33615724465
+流向 7.35964765279
+解空 12.2912397395
+好高 12.8020653633
+方山 10.1164880181
+普通员工 11.8212361103
+混响时间 12.1089181827
+领事 8.86372504956
+找水 12.5143832909
+罗三国 13.900677652
+中招 10.1394775363
+近代思想 12.1089181827
+射箭 8.68574189437
+第二线 10.4349417492
+禀性 10.8096351986
+人老眼花 11.9547675029
+领人 10.4666904475
+几十几条 13.2075304714
+地政 12.2912397395
+内臣 9.36807815882
+冯承钧 11.0103058941
+方言土语 12.5143832909
+洛伦佐 13.2075304714
+主办方 9.37888907493
+二滩水电站 11.9547675029
+刺耳 9.15574552361
+第二级 9.98865464655
+奥特曼 13.900677652
+发福 10.6818018271
+先生 5.56404756434
+使役 10.8561552143
+耗着 12.2912397395
+管不着 10.4041700905
+角尺 13.2075304714
+往前 7.60910851242
+中投 8.28754954559
+内膜 9.0884932966
+方尺 13.900677652
+瓜达尔卡纳尔 12.8020653633
+子目标 13.2075304714
+第二组 11.1280889297
+中报 8.43261751084
+持之以恒 10.3453295905
+福世子 13.2075304714
+甘薯 8.44963919841
+袁绍相 12.5143832909
+先由 9.56994431169
+振作起来 10.3171587135
+哈伊亚 11.4157710022
+彭天锡 12.8020653633
+先用 8.74162235276
+韩融 12.5143832909
+宿醉 13.2075304714
+于径山 12.5143832909
+罔极 12.5143832909
+间隔性 13.2075304714
+换肤 12.5143832909
+清除剂 12.8020653633
+出名门 13.900677652
+故于 11.4157710022
+固特异 11.8212361103
+射程 7.5273578624
+故事 6.12037456407
+方差 9.96885201925
+九十五个 12.8020653633
+领会 8.98802276624
+卡迪 11.7034530746
+郑氏治 13.2075304714
+放化疗 13.2075304714
+渐次 8.89673134603
+桂子 11.5027823792
+内聚 13.2075304714
+遮盖住 11.9547675029
+内联 11.8212361103
+换肾 13.2075304714
+春收 12.8020653633
+绿荫蔽日 13.900677652
+玛兹达 12.1089181827
+勃朗特 11.1280889297
+李隆 13.900677652
+趁此 9.6811699468
+郝老爷 11.1926274509
+故交 11.2616203224
+非常低 9.43476953332
+傲人 11.598092559
+牟慰 13.2075304714
+中捷 10.4994802703
+故人 9.14708746087
+忏悔 9.24671730182
+工艺品厂 13.900677652
+故亲 13.2075304714
+马克斯 10.8096351986
+中指 9.15574552361
+娇气 10.8096351986
+纪游 11.598092559
+坟丘 10.1630080337
+久病 9.31571017331
+寇琛 13.2075304714
+阔叶林 8.0600359946
+方口阔 13.2075304714
+德温 12.2912397395
+菽庄花园 12.8020653633
+江浙 8.43684584695
+副司长 9.65218240993
+波兰 7.46773755924
+六线 10.9049453784
+内耗 10.9049453784
+范阳卢 11.8212361103
+发硬 10.9562386728
+卡达 12.1089181827
+辈出 10.1164880181
+德清 10.2371160058
+行话 10.533381822
+致橡树 13.900677652
+端口扫描 13.900677652
+换胎 13.2075304714
+波光 10.4666904475
+一九七三年 13.2075304714
+世泽 13.2075304714
+平安县 13.2075304714
+往右 10.765183436
+李雪峰 13.2075304714
+二百首 12.8020653633
+轻量 12.2912397395
+仅凭 9.59661255877
+总裁班 13.900677652
+莫哈托 13.900677652
+吓阻 12.8020653633
+傲世 13.2075304714
+内胎 10.765183436
+牟合方 13.2075304714
+卡车 8.16733637508
+内胆 12.5143832909
+鲁克林 13.900677652
+陵墓 8.1386262692
+代国君 12.2912397395
+汩汩 9.98865464655
+私隐 13.900677652
+中国移动 8.4801426527
+往北 9.20019728618
+甘蓝 10.765183436
+轮子 9.56994431169
+故世 11.0103058941
+方便面 10.3743171274
+娜拉 9.66657114738
+第二十八届 13.2075304714
+溜掉 11.1926274509
+袭警 11.9547675029
+凤昌之 13.900677652
+常务会议 8.59737274392
+党性 10.0720362555
+七百三十余万两 13.900677652
+聚财 11.3357282945
+武定之 12.8020653633
+内能 9.44633035572
+划清 11.1926274509
+江翻海沸 13.900677652
+所剩无几 9.6811699468
+故主 10.533381822
+故为 10.0088573539
+利类思 12.8020653633
+月月年年 13.2075304714
+董糖 12.8020653633
+解答 8.42421410004
+聚赌 11.7034530746
+吉卜林 11.8212361103
+聚丙烯酸 13.2075304714
+无济于事 9.10488710638
+金鼓喧 13.2075304714
+毛笔 8.85725253506
+春日 10.4349417492
+闷火 13.2075304714
+认错 9.25628675283
+建筑行业 11.1280889297
+波莱罗 13.2075304714
+石钻 13.900677652
+久留 9.20932976975
+泄气话 12.2912397395
+中排 10.0294766411
+地摊 10.5684731418
+祸害 9.15574552361
+康先生 11.1926274509
+春旱 10.1630080337
+续聘 12.1089181827
+高支 12.8020653633
+伸手 6.97018288602
+论著 8.4284069783
+孢原质 13.2075304714
+北魏永 12.8020653633
+孔明唤 11.5027823792
+天外飞来 12.2912397395
+库兴氏 11.598092559
+故乡 7.75434839431
+樊城 9.26594866375
+桂宫 12.5143832909
+官征官 13.900677652
+周昭王 11.3357282945
+奏法 11.7034530746
+门斯基 12.8020653633
+一百二十分 13.2075304714
+战区 8.26946587015
+邬桥真 13.2075304714
+取暖油 10.6818018271
+塞姆化 13.2075304714
+黄克诚 11.8212361103
+波利 11.1280889297
+吉他 10.3743171274
+络绎于途 13.900677652
+地极 11.2616203224
+套上去 12.8020653633
+毛磊 13.900677652
+南联盟 12.8020653633
+陆界 12.5143832909
+财经新闻 11.2616203224
+发笑 9.5186510173
+抑郁 9.00283785202
+波分 13.2075304714
+发笔 12.1089181827
+禀报 7.18166449759
+偎贴 12.1089181827
+儿童剧院 12.2912397395
+云骑尉 12.8020653633
+谋职 13.2075304714
+犁耙 11.598092559
+陶金 11.9547675029
+五七里 12.1089181827
+费尔法克斯 12.2912397395
+明法审令 13.900677652
+芙蓉花 12.2912397395
+蔡大爷 11.1280889297
+湖南省委宣传部 13.2075304714
+先知 8.73019365694
+讨人 11.8212361103
+无差别 10.6818018271
+科尔尼洛 12.1089181827
+讨亲 13.2075304714
+去核 11.8212361103
+步谈机 11.3357282945
+主办权 12.5143832909
+陆生 9.15574552361
+角度 6.24434048555
+考稽 13.2075304714
+清静无为 11.3357282945
+南涧彝族自治县 13.900677652
+翻沉 12.8020653633
+楚雄市 12.1089181827
+第二类 9.41204128224
+中性 7.58894284282
+吉人 12.1089181827
+逍遥散 11.2616203224
+华而不实 11.5027823792
+陶醉 8.80692745117
+贾珍见 12.5143832909
+方庄 12.2912397395
+奥德奥 13.2075304714
+骤增 9.94943393339
+久盼 12.8020653633
+方府 13.900677652
+春晚 9.75754292558
+春晖 10.9562386728
+德洛 11.598092559
+腹腔 9.33632946051
+春晓 10.3743171274
+中情 13.900677652
+液化气船 12.5143832909
+换茬 12.8020653633
+互利互惠 12.8020653633
+波动 5.94140169186
+全部九十名 13.900677652
+李陵碑 12.1089181827
+赤条条 9.69598503258
+种花 11.4157710022
+历历 10.533381822
+董翳 13.2075304714
+滋贺 11.9547675029
+方平 12.5143832909
+辈分 9.91169360541
+梅园 11.1280889297
+费耀色 10.6818018271
+先睹 12.2912397395
+讨乞 12.5143832909
+地机 12.8020653633
+睛明穴 12.5143832909
+泻得 13.900677652
+嘉荫县 12.5143832909
+梅因 11.7034530746
+耗用 10.604840786
+忍饥挨饿 11.2616203224
+耗电 10.4666904475
+腹膜 10.2897597393
+囚人 12.5143832909
+集合论 9.87532596124
+乌拉特 13.2075304714
+钮制 12.5143832909
+联储局 9.91169360541
+陵寝 9.17328983326
+高廉见 13.2075304714
+手指甲 10.604840786
+带领 6.98893035172
+苹果日报 12.5143832909
+照明设计 12.8020653633
+跃层 12.1089181827
+梁王 10.3453295905
+换药 10.3453295905
+结合膜 13.2075304714
+奥德姆 12.5143832909
+跃居 8.9519177616
+讨个 9.63799777493
+先看 9.56994431169
+远水不救近火 13.2075304714
+陆疆 13.900677652
+佳县 12.8020653633
+紫丁香 11.598092559
+胡图族 13.2075304714
+岛城 12.1089181827
+丛目 13.2075304714
+历史 4.60324257315
+惠民河 11.2616203224
+受害者 8.50251495046
+解码 10.9562386728
+聂荣 13.2075304714
+地板 8.15128466607
+独裁政治 12.5143832909
+种苗 10.9562386728
+专管员 13.900677652
+张季鸾 12.1089181827
+波勒 13.2075304714
+滚下去 10.8096351986
+温热 8.80081122415
+点水不漏 13.900677652
+知我者 11.9547675029
+弗拉索夫 12.1089181827
+陈淑芳 13.900677652
+老妈妈 9.35738286971
+陶郡 13.2075304714
+马数依 12.8020653633
+吉保 13.900677652
+春木 10.765183436
+往内 13.2075304714
+流型 12.2912397395
+发稿 8.96620371885
+鬼方 10.8561552143
+靶台 13.900677652
+西印度联 11.9547675029
+夜游神 11.7034530746
+特兰城 11.9547675029
+陶都 11.9547675029
+军事学院 9.33632946051
+万多人次 12.5143832909
+症状 6.59347533721
+负心人 12.8020653633
+共享税 13.900677652
+努力实现 9.28555713513
+党报 10.5684731418
+平喘药 11.7034530746
+解秘 12.8020653633
+宝树唤 13.2075304714
+攻心为上 11.8212361103
+开例 13.900677652
+王僧辩 11.0674643079
+孟灵己 11.4157710022
+方志 10.2630914922
+岑大人 11.8212361103
+封疆 8.98069672615
+中意 9.45802639549
+塞得港 11.2616203224
+解离 11.7034530746
+陆军学院 12.5143832909
+电加热 11.5027823792
+下午茶 11.1280889297
+加达默尔 12.5143832909
+吕纪 12.2912397395
+怒目 9.84023464143
+威虎 11.7034530746
+先皇 10.642581114
+流域 6.62412124926
+划法 12.1089181827
+捡回来 10.4994802703
+解禁 6.54695532158
+大败敌军 13.900677652
+种草 10.765183436
+雄性不育 11.9547675029
+论域 12.1089181827
+环境噪声 11.9547675029
+反托拉斯 12.1089181827
+料石 12.2912397395
+内舱 11.9547675029
+方得 9.77354326693
+长姊 13.900677652
+谋臣 10.4041700905
+细细品味 11.7034530746
+曾领兵 12.8020653633
+梅城 11.5027823792
+德波 12.1089181827
+官僚主义者 12.5143832909
+方形 8.20358416547
+佛诞 12.8020653633
+比海鹰 13.2075304714
+恋母情结 12.2912397395
+角形 11.598092559
+终结符 12.5143832909
+德泽 13.2075304714
+如雷轰顶 13.2075304714
+攻来 13.900677652
+救援飞机 13.2075304714
+娇滴 13.2075304714
+尤氏李 12.2912397395
+腹肌 10.9562386728
+流在 10.4666904475
+奇峰镇 12.8020653633
+结合能 10.604840786
+续航 9.66657114738
+轮奸 11.2616203224
+德法 10.765183436
+陶道 13.900677652
+鲁克斯 13.2075304714
+路云 12.8020653633
+流场 10.3743171274
+佛语 12.5143832909
+卡赞 11.9547675029
+门外汉 10.8096351986
+迍邅 12.1089181827
+谜底 9.59661255877
+填表格 12.8020653633
+永生永世 11.0674643079
+欧姆定律 10.533381822
+莲蓉月饼 13.900677652
+爷爷 7.32979468964
+远近闻名 10.642581114
+伯颜继 12.8020653633
+教学活动 11.0103058941
+曲声 12.1089181827
+由此可见 8.12923652885
+德治 10.9049453784
+发端 9.59661255877
+玉檀笑 11.2616203224
+腹背 11.4157710022
+方式 4.80149232937
+角弓 11.598092559
+不乐意 9.93038573842
+讨伐 8.30969067146
+罗斯监 13.2075304714
+子徐信 12.5143832909
+波及 8.25877058104
+来元廷 13.2075304714
+神经细胞 9.63799777493
+流星锤 11.3357282945
+吉伯 11.7034530746
+论坛 6.44769532251
+种菜 9.4233408375
+吉伦 13.900677652
+鸦青 11.8212361103
+往事 7.96314144689
+分蘖节 12.8020653633
+比赛项目 9.20019728618
+荆江 9.71102290995
+知命 12.5143832909
+孟冲府 12.8020653633
+语言不通 11.1926274509
+乖得 12.8020653633
+下笔有神 13.900677652
+灵霄 10.1630080337
+领到 8.64840422393
+茹苦含辛 13.900677652
+腋下 9.54396882529
+中心小学 10.6818018271
+滑落 8.87679713113
+设得 12.5143832909
+中央集权 8.30225569298
+中外合资 9.91169360541
+梁海 11.4157710022
+助动词 12.5143832909
+大学堂 10.7226238216
+羊骨 13.900677652
+艳羡 10.0505300503
+天长地久 10.8096351986
+蝎蝎螫螫 12.8020653633
+北京自然博物馆 12.5143832909
+故友 10.533381822
+阿格里 11.1280889297
+地租 7.26999426633
+射杀 9.58318953844
+整体 5.33298147839
+第二手 12.2912397395
+郎秦钟 13.2075304714
+村两委 11.1926274509
+公共绿地 11.9547675029
+李书 11.5027823792
+叉住 13.2075304714
+李高听 12.8020653633
+坟包 10.9562386728
+第二所 11.5027823792
+新奇 8.6803218269
+知名 7.08284708052
+第二批 7.87481167815
+集美学村 12.5143832909
+增稠剂 11.1280889297
+交通干道 13.2075304714
+田洛合 13.2075304714
+射来 9.6811699468
+面卷 13.900677652
+锯木屑 13.900677652
+感情破裂 12.2912397395
+彭山 11.598092559
+地秤 13.900677652
+解暑 11.2616203224
+喜不自胜 10.533381822
+胃肠病 12.8020653633
+太极图 11.1926274509
+伸缩 8.97342396682
+干裂 10.5684731418
+性地 10.9049453784
+往上 8.68574189437
+往下 7.88696249593
+中经 10.1871055853
+熊德基 13.2075304714
+陶轮 12.2912397395
+拆开来 11.1926274509
+第二把 11.3357282945
+思盖 13.2075304714
+往世 10.9049453784
+陆毅 11.598092559
+溶点 12.8020653633
+毛晋 11.9547675029
+妥贴 10.765183436
+中统 9.19114745066
+斜点 13.2075304714
+往东 8.94485059437
+乖张 11.2616203224
+中继 9.75754292558
+雾茫茫 12.2912397395
+哈伊勒 13.900677652
+官老爷 11.9547675029
+辛酸苦辣 13.900677652
+房一厅 13.900677652
+着数 10.9562386728
+幕后 8.76487921493
+发文 7.65845438652
+赶不出 13.2075304714
+伦巴第 10.4349417492
+私访 11.9547675029
+私设 11.598092559
+讨债 10.8096351986
+荆沙 12.5143832909
+遮盖力 12.2912397395
+梁刘勰 12.2912397395
+大学士 7.78258045393
+甘香 12.1089181827
+绿藻 9.71102290995
+中国戏曲 9.01032852375
+林乐知 12.8020653633
+认头 12.5143832909
+戈迪亚 13.900677652
+私话 11.0674643079
+去皮 10.2117981979
+于豫州 13.2075304714
+中级 8.24119543622
+帽檐 11.0103058941
+第二拳 13.900677652
+中纬 12.1089181827
+定轴转动 11.3357282945
+苍凉 9.49395840471
+宋得民 13.900677652
+耳听为虚 12.2912397395
+印度 5.63399920867
+佳句 10.765183436
+平陆北 12.8020653633
+冯官屯 13.2075304714
+一笑百媚 13.2075304714
+中线 7.7083151625
+晋州 10.9049453784
+窦炎 12.2912397395
+中纺 7.22737968421
+讨出 13.900677652
+趁着 7.76945116249
+讹误 10.4994802703
+往例 12.5143832909
+腹鸣 13.900677652
+绕到 9.94943393339
+走走看看 11.9547675029
+历三朝 11.9547675029
+操纵性 10.8561552143
+哈继铭 10.5684731418
+中网 11.2616203224
+文臣夏 13.2075304714
+聚醚 11.7034530746
+数理经济学 11.2616203224
+韩国 6.9431802811
+乡野 11.2616203224
+梁汝 13.900677652
+讹诈 10.4041700905
+晋封 9.62401153296
+出入证 12.5143832909
+十步之内 13.2075304714
+中置 11.5027823792
+吉凶 8.98069672615
+艳红 11.1280889297
+助学 10.604840786
+穿穿 12.1089181827
+旅游地理 12.8020653633
+护念 13.900677652
+应属 9.93038573842
+有机磷类 12.8020653633
+中缀 13.900677652
+温开水 10.2117981979
+片子 9.29550746599
+艰难困苦 10.1871055853
+夜静更深 11.9547675029
+生克之 12.2912397395
+廊檐 10.3743171274
+电力工业部 12.8020653633
+毛果 11.7034530746
+地磁 9.55687223012
+树墩子 13.2075304714
+郑其贵 11.7034530746
+中缝 12.5143832909
+生克乘 12.8020653633
+斯拉法 12.8020653633
+亚利桑纳 11.9547675029
+防霉剂 13.2075304714
+团结合作 11.3357282945
+计算机化 11.5027823792
+领教过 10.7226238216
+晋居 12.5143832909
+赵宣子 12.8020653633
+和硕特 10.5684731418
+家电市场 10.5684731418
+解构 12.1089181827
+安哥拉 9.24671730182
+宗教仪式 9.5062284973
+印张 13.900677652
+春神 12.5143832909
+子壮 13.2075304714
+虐待 9.29550746599
+叶锈病 13.2075304714
+梁永 11.0103058941
+助色团 12.8020653633
+解析 8.5440913773
+纂修 9.55687223012
+去石 10.8561552143
+轻贱 11.4157710022
+地砖 10.642581114
+第二排 10.5684731418
+熔炼炉 12.8020653633
+枯涸 12.8020653633
+灵隐 10.2897597393
+鬼符 12.2912397395
+轻财 11.8212361103
+独得之见 13.900677652
+女明星 11.1926274509
+橡胶作物 13.900677652
+吉元 10.0940151622
+轻质 9.12155415886
+麻里 12.5143832909
+中介费 12.5143832909
+吉兆 10.1871055853
+报纸广告 12.2912397395
+鬼笔 12.5143832909
+普吕坦尼 13.900677652
+彭大雅 13.2075304714
+封武 12.1089181827
+一小片 10.3453295905
+领去 11.0674643079
+单季稻 11.9547675029
+无人过问 11.1926274509
+毛条 12.8020653633
+陈恩凤 13.2075304714
+见招拆招 13.2075304714
+非常悲哀 13.900677652
+封死 9.12999302751
+电离气 13.900677652
+服务体系 9.12999302751
+图像增强 12.2912397395
+云扶石 12.8020653633
+党籍 9.6811699468
+站立起来 9.55687223012
+印得 12.1089181827
+领取 8.1386262692
+领受 9.63799777493
+紫竹院 12.5143832909
+中美 7.4439079964
+文正公 11.598092559
+五内俱焚 11.4157710022
+小巧玲珑 10.2897597393
+柔顺剂 13.900677652
+一百三十年 13.2075304714
+宝钗黛 13.900677652
+彭州 11.7034530746
+常到 9.87532596124
+性器 11.1926274509
+春种 11.7034530746
+自古迄今 12.8020653633
+聚酯 9.85762638414
+撒盐 11.5027823792
+平均收入 10.8096351986
+春秋 6.94603878709
+钵头 12.2912397395
+轫致辐射 11.3357282945
+契丹语 11.9547675029
+梁河 12.1089181827
+划片 12.8020653633
+第十五章 9.91169360541
+沙斐仪 11.4157710022
+胡佩衡 12.5143832909
+托亚拉 13.900677652
+彭帅 13.2075304714
+一千八百八十余个 13.2075304714
+忍性 13.900677652
+种鸡 11.9547675029
+荆湖 11.1926274509
+危崖 11.0103058941
+荆湘 12.2912397395
+吉勒 11.8212361103
+蒋斌守 13.2075304714
+盖棺论定 11.8212361103
+谢耶夫 11.8212361103
+茫茫无际 11.9547675029
+佛陀 9.36807815882
+刘繇寨 13.900677652
+先母 12.1089181827
+轻身 11.0103058941
+发木 11.2616203224
+从公 12.8020653633
+筋疲力尽 10.4994802703
+人为财死 12.2912397395
+坟典 13.900677652
+杀一儆百 10.9049453784
+上贼船 13.900677652
+黑日 13.900677652
+上个世纪 9.66657114738
+韩全诲 13.2075304714
+性善 11.598092559
+传记片 13.2075304714
+牛车 9.22784881751
+取暖炉 13.900677652
+没动 9.25628675283
+发有 12.5143832909
+德昂族 11.0674643079
+榨油机 13.2075304714
+第二性 11.2616203224
+李隆基 10.2630914922
+牛轭 12.2912397395
+相当严重 10.4349417492
+历佐 12.8020653633
+望月怀 13.2075304714
+解宝引 13.2075304714
+肋骨 9.26594866375
+面瘫 11.598092559
+物价表 13.900677652
+表示法 10.7226238216
+谋叛 10.642581114
+佛阁 12.5143832909
+发来 9.17328983326
+有甲叶 13.2075304714
+围棋子 12.5143832909
+演讲台 13.2075304714
+姚瀛艇 13.2075304714
+瓦西特 13.2075304714
+龙绘凤 13.2075304714
+天天 6.86277168853
+灵长 12.8020653633
+拉广告 13.900677652
+乖巧 9.55687223012
+普罗塔哥 12.8020653633
+上义夫 13.900677652
+印尼 8.43684584695
+余股 11.2616203224
+苍南 11.9547675029
+曲奇 13.900677652
+认定 7.20611559345
+西至东 11.0674643079
+审判机关 10.7226238216
+越南籍 13.2075304714
+著文 10.533381822
+机缘巧合 11.5027823792
+盐卤 10.6818018271
+狮头山 12.2912397395
+价格水平 9.01787572939
+常委会 8.45825994145
+开业 8.00352378434
+十数家 12.5143832909
+师傅领进门 13.2075304714
+口口相传 12.1089181827
+颇费周折 12.2912397395
+中共党史 12.1089181827
+洛伦兹 9.85762638414
+飞流直下 12.1089181827
+李封 13.2075304714
+截杀 10.0940151622
+在职干部 13.900677652
+包惠僧 12.5143832909
+宋阵 11.9547675029
+搜寻 8.77671367257
+高度肯定 12.2912397395
+张效祥 13.2075304714
+大札萨 13.2075304714
+滴水成冰 11.5027823792
+认字 11.598092559
+两三百里 13.2075304714
+功能齐全 11.4157710022
+宿迁 10.3171587135
+排排坐 13.900677652
+逡巡 11.1926274509
+苍古 12.5143832909
+江苏省政协 13.2075304714
+窦状 12.8020653633
+陶质 11.8212361103
+讨到 11.9547675029
+吉列 12.8020653633
+别连科 13.2075304714
+封树 12.1089181827
+吕振 13.2075304714
+踏下来 13.900677652
+牛辅 12.8020653633
+阿加莎 13.2075304714
+耍横 13.2075304714
+韩馥 11.7034530746
+吴应寿 12.5143832909
+农田水利 9.29550746599
+超导电性 10.4666904475
+器械体操 13.2075304714
+罗斯比 11.1280889297
+中粮 8.31718134319
+投之以桃 12.8020653633
+薛国 12.2912397395
+许久以前 13.2075304714
+吉利 8.0229418702
+口碑载道 12.5143832909
+冶金部 13.900677652
+如假包换 13.2075304714
+故典 11.8212361103
+蟠龙镇 13.900677652
+玄宗自 13.2075304714
+荆溪 11.3357282945
+卡通 10.5684731418
+坟冢 11.8212361103
+贱躯 12.5143832909
+佛青 13.900677652
+波伦 12.8020653633
+地窖 9.7898037878
+猛龙过江 12.8020653633
+逻辑思维 10.4666904475
+纪灵 11.4157710022
+礼服呢 11.9547675029
+地窟 12.8020653633
+磺酸 10.4349417492
+马力克 12.5143832909
+梁湖 12.5143832909
+吴改吴 12.5143832909
+硬推 13.900677652
+非对称 11.3357282945
+靳薇 13.2075304714
+冬菜 11.3357282945
+片头 13.2075304714
+党纪 12.1089181827
+门巴族 10.4994802703
+宋乾德 12.1089181827
+去留 9.80633308975
+凡例 11.1280889297
+讨取 12.8020653633
+卡里 10.2897597393
+刘承奉 11.3357282945
+阴谋家 11.0674643079
+时尚女性 12.1089181827
+陆桥 10.9049453784
+抚顺 9.20932976975
+拉洋片 11.7034530746
+郎陆琼 13.2075304714
+甜瓜 10.1164880181
+发昏 10.4994802703
+灭绝人性 11.598092559
+玩闹 11.598092559
+去甲 10.642581114
+公开出来 12.5143832909
+陆栖 10.1164880181
+党组 9.54396882529
+毛料 11.2616203224
+方荣翔 12.8020653633
+蛋壳 9.93038573842
+危局 9.96885201925
+毛文 13.900677652
+历久 11.2616203224
+荦荦 13.900677652
+陆标 12.2912397395
+领先 7.06764591919
+海信 8.85082164473
+子从德 13.2075304714
+合资企业 9.53122979951
+撤完 13.900677652
+信以为真 9.77354326693
+发晕 10.8561552143
+领兵 8.12923652885
+撤守 11.9547675029
+功能定位 11.0103058941
+彭彭 13.900677652
+背上 7.39788760606
+重作冯妇 13.900677652
+领养 12.2912397395
+赤脚大仙 11.4157710022
+领入 11.9547675029
+讨厌 8.18036587537
+贾彰挥 13.2075304714
+无偿性 12.8020653633
+购房 7.65457088649
+交代作用 10.8561552143
+黄永胜 12.2912397395
+司局长 12.8020653633
+何患无辞 11.5027823792
+解散 7.76295059789
+内黄 10.9049453784
+陆棚 12.2912397395
+领军 8.83808261895
+钵子 12.2912397395
+马哈木 11.598092559
+副作用 8.47572763449
+王志纲 13.900677652
+卡式 12.2912397395
+苍劲 9.72629038208
+一反常态 10.1871055853
+水上运动 11.2616203224
+活儿干 10.765183436
+地税 9.37888907493
+初名子 11.9547675029
+鹭岛 12.5143832909
+刊布 10.8096351986
+日丽风和 13.2075304714
+性向 12.5143832909
+莫怪 10.2630914922
+无常形 13.2075304714
+前后排 11.7034530746
+卷舌 13.900677652
+吕才 12.8020653633
+锂电 11.5027823792
+卷舒 12.2912397395
+工商大学 13.2075304714
+危岩 11.9547675029
+廊桥 11.9547675029
+解救 8.60737282725
+诊疗室 12.5143832909
+麝猫 13.2075304714
+乙醇溶液 12.2912397395
+性味 10.9049453784
+历仕 11.8212361103
+陶谦 10.642581114
+轻轻 6.58612481965
+熟道 13.2075304714
+性命 6.86540905269
+轻载 11.8212361103
+宦富豪 13.900677652
+栽入 13.900677652
+解放 6.99894044532
+非营利 11.2616203224
+楚材世 12.8020653633
+轻轨 10.2117981979
+轻软 10.4349417492
+薛城 12.5143832909
+干部处 12.8020653633
+危峰 12.2912397395
+派人参加 12.1089181827
+天冠山 12.8020653633
+腹鳍 9.13850371718
+津浦铁路 10.0720362555
+地穴 9.84023464143
+鬼神 8.61747392324
+鬼祟 10.8096351986
+领出 11.1926274509
+历任 6.94699344111
+肾囊肿 12.2912397395
+赵启正 12.5143832909
+见告 12.1089181827
+历代 6.99994698793
+公证费 13.2075304714
+不自重 13.2075304714
+设局 11.2616203224
+烂尾 10.8096351986
+余绪 12.5143832909
+小到中雪 10.765183436
+吕旷 11.7034530746
+理解力 10.9562386728
+设宴 9.04086524761
+党禁 11.8212361103
+发愿 10.5684731418
+发愣 9.36807815882
+刘承干 12.5143832909
+发愤 10.5684731418
+卡雷 12.5143832909
+燧石 10.4666904475
+毛拉 11.7034530746
+珠玉在前 13.900677652
+整修 8.88339781516
+设定 8.04560572977
+何苦 8.91707103027
+天姿国色 12.1089181827
+李仙 13.900677652
+一元函数 12.1089181827
+不骗你 11.7034530746
+彬彬 12.2912397395
+艾曼纽 13.2075304714
+怒涛 10.4349417492
+发愁 8.6966709649
+针线包 12.5143832909
+钤记 13.2075304714
+久治 12.1089181827
+陶诚 12.5143832909
+墨龙睛 13.900677652
+内饰 8.63798746307
+母细胞 10.604840786
+中空 9.05649056552
+荆树 12.2912397395
+需索 12.1089181827
+故城 9.19114745066
+吕方 9.71102290995
+古茨 13.900677652
+明中期 11.5027823792
+罗斯海 13.900677652
+大牛市 9.22784881751
+中程 9.46986085313
+子惠王 11.9547675029
+吕斯 12.8020653633
+一端 8.33999602096
+解押 12.5143832909
+盐化 9.74179456862
+秋月春风 13.900677652
+坟场 11.4157710022
+引以为憾 13.2075304714
+四言诗 11.7034530746
+扭转 7.46132728088
+时时刻刻 9.84023464143
+用脑 11.2616203224
+坟地 9.35738286971
+梁云构 12.1089181827
+冬耕 13.2075304714
+轻装 9.98865464655
+冒着危险 13.2075304714
+门诺派 13.2075304714
+中稻 11.1280889297
+访问者 11.7034530746
+存货量 12.2912397395
+董明珠 10.4666904475
+发憷 11.2616203224
+荆棘 9.48183704418
+塞特郡 12.5143832909
+中立 8.62767809341
+倚门 11.8212361103
+丁文江 11.1280889297
+先测 13.2075304714
+故土 9.56994431169
+涌入 7.02132184752
+陈文 10.7226238216
+野牛草 13.900677652
+鸡肠狗肚 13.900677652
+加塔梅 13.2075304714
+吴喜公 13.900677652
+中站 11.0103058941
+葡萄牙队 13.2075304714
+苯环 10.604840786
+危害 7.12531156104
+娇痴 12.8020653633
+蛇欲吞象 13.2075304714
+易挥发 10.2630914922
+复发率 11.7034530746
+刊头 12.8020653633
+许久以后 12.8020653633
+马伦戈 13.2075304714
+六千五百平方公里 13.2075304714
+般地 8.53003962385
+郎和嘉 13.900677652
+羚羊挂角 13.2075304714
+故地 8.99540287354
+带馅 13.2075304714
+扭过 9.94943393339
+德基坝 12.5143832909
+够味儿 13.900677652
+牛高马大 13.900677652
+纪瞻 12.5143832909
+用膳 9.44633035572
+封渊 13.900677652
+着意 9.89334446674
+领回 10.604840786
+吉吉 12.8020653633
+良好氛围 10.9049453784
+乖孩子 11.1926274509
+防晒霜 11.3357282945
+孔父嘉 13.900677652
+咯咯叫 13.900677652
+侍之名 12.8020653633
+购料 12.5143832909
+形式演算 13.900677652
+热爱劳动 13.2075304714
+韩龙 13.900677652
+走乡串户 12.8020653633
+发懒 13.2075304714
+先派 10.4666904475
+布谷鸟 11.0103058941
+黑蚂蚁 12.8020653633
+承天护 13.2075304714
+满口答应 10.3743171274
+领国 13.900677652
+封港 12.5143832909
+司马光死 13.2075304714
+鹏飞 11.3357282945
+绕城 10.2117981979
+划着 9.46986085313
+玄德同 12.5143832909
+京西宾馆 13.900677652
+讨吃 10.765183436
+卡尔巴拉 11.9547675029
+印子 11.2616203224
+第二期 9.54396882529
+职能部门 9.15574552361
+沙发床 12.2912397395
+总领事馆 12.1089181827
+绕嘴 13.900677652
+荆楚 10.9562386728
+再而三 9.98865464655
+中等 7.51379833261
+印孟 12.5143832909
+领土 7.13679274341
+中策 11.1280889297
+发急 10.1394775363
+伊成格 12.8020653633
+发性 11.0674643079
+赶过去 10.4666904475
+片式 11.7034530746
+寸断 13.2075304714
+慕名而来 11.4157710022
+丁基胶 13.2075304714
+牛行 12.8020653633
+领地 8.0285598625
+时限 9.21854642485
+和竹青 11.9547675029
+发怒 9.04086524761
+梁桥 11.0103058941
+发怔 10.1871055853
+不为所动 10.0294766411
+五代史 10.0294766411
+耳闻目见 13.2075304714
+着想 8.31342899358
+罗斯氏 12.8020653633
+吕擎 8.81308131674
+中共党员 11.0103058941
+计算结果 10.3171587135
+胃肠炎 10.8096351986
+第二本 12.5143832909
+内页 12.2912397395
+中签 8.9308643524
+偷叫 13.900677652
+和栖霞 13.900677652
+第二束 12.5143832909
+射手 9.05649056552
+卢卡契 13.900677652
+梁栋 11.7034530746
+许财发 11.1926274509
+螯合剂 12.8020653633
+幼君 12.5143832909
+自掘坟墓 12.1089181827
+卢卡奇 12.1089181827
+双风贯 13.900677652
+轻触 11.8212361103
+市场规律 9.80633308975
+故园 10.6818018271
+薛兰 13.2075304714
+负债累累 10.4041700905
+释免 13.900677652
+陆游 9.72629038208
+先河 8.90346537821
+第六十一章 13.2075304714
+故国 9.93038573842
+广州市 7.93453091285
+再启动 12.2912397395
+第二杯 12.1089181827
+轻视 8.64318227995
+让你在 10.6818018271
+皮皮尔 13.900677652
+盘山公路 11.3357282945
+用者 11.8212361103
+前后方 12.5143832909
+红帽子 11.7034530746
+第二枝 12.1089181827
+换句 13.900677652
+薛军 13.900677652
+佩兰 11.3357282945
+中钨高新 13.900677652
+正义路 12.5143832909
+休息区 10.0940151622
+真实写照 10.1164880181
+心如刀割 11.0674643079
+滋阴 9.10488710638
+两千七百七十二尺 13.2075304714
+酒店式 11.7034530746
+性别 8.49350588052
+封潞 13.2075304714
+怒气 8.61747392324
+伏白首 13.2075304714
+纪盛 13.900677652
+换口 12.8020653633
+素髎 13.900677652
+第二架 11.598092559
+扭身 10.3743171274
+带饭 13.2075304714
+卡岩 11.5027823792
+佩克 10.9562386728
+时加关 13.900677652
+张匡邺 13.2075304714
+孙现袭 13.900677652
+龙牙草 13.900677652
+心律不齐 11.1280889297
+个人行为 10.0505300503
+陆源 10.9562386728
+植煌 10.642581114
+第七层 12.5143832909
+上西天 10.0294766411
+先民 9.09665660724
+王承宗 12.5143832909
+领域 5.41229554241
+阿瑜 11.1280889297
+潮气量 12.8020653633
+李云 9.80633308975
+内颖 13.900677652
+地籍 11.598092559
+村村 10.9562386728
+品德课 13.900677652
+岫岩满族自治县 13.2075304714
+相对速度 10.8561552143
+着急 7.46452728361
+中箭 9.5186510173
+怒江 9.20932976975
+党甘亭 13.2075304714
+吊脚楼 9.74179456862
+推算出 9.85762638414
+着重地 12.5143832909
+一声不吭 8.51160592216
+领出去 12.5143832909
+陆浑 11.3357282945
+土制品 13.2075304714
+供养人 11.0674643079
+鬼精 12.1089181827
+薛刚 12.8020653633
+薛则 12.8020653633
+流于 9.80633308975
+流云 10.642581114
+交班 11.5027823792
+发挥 6.17623100634
+用药 8.01457362053
+巢居穴处 13.900677652
+国中罕 12.8020653633
+纪略 11.5027823792
+流亡 8.16733637508
+伏暮末 12.5143832909
+私财 11.5027823792
+讨回 11.1926274509
+论争 9.93038573842
+流产 8.68574189437
+陆海 10.8096351986
+私贩 11.2616203224
+放纵不羁 13.900677652
+肺栓塞 11.0674643079
+山杭 12.2912397395
+一竿 11.3357282945
+涨风 13.2075304714
+开裆裤 11.4157710022
+发指 12.8020653633
+择日子 13.2075304714
+私费 13.2075304714
+解惑 10.9562386728
+流人 11.7034530746
+林大可 10.0720362555
+弗洛伊德 9.93038573842
+卡钦 11.0103058941
+宋初沿 13.2075304714
+种马 11.4157710022
+聚集 7.0806612873
+凤尾菇 12.1089181827
+购有 12.8020653633
+印堂 11.598092559
+严怡民 13.2075304714
+卡钳 12.8020653633
+窦瘤 13.2075304714
+德甲 12.8020653633
+经济林木 9.59661255877
+赫特纳 12.5143832909
+论价 13.2075304714
+划痕 11.0674643079
+婢仆 11.598092559
+片山 11.598092559
+衢州市 11.5027823792
+谷贵则 12.8020653633
+手钳 13.900677652
+领命 9.10488710638
+马哈拉 13.2075304714
+内鬼 12.8020653633
+扭起 13.2075304714
+操纵杆 11.5027823792
+解悟 12.8020653633
+贪赃舞弊 13.900677652
+德生 13.2075304714
+认得 7.32003851469
+贝采里 12.8020653633
+频率段 13.900677652
+购机 10.7226238216
+毛烘烘 13.900677652
+解恨 10.4041700905
+元章武 12.8020653633
+地缘 9.53122979951
+流上 12.2912397395
+船形帽 12.8020653633
+地缝 10.765183436
+震慑力 11.598092559
+纸类 12.8020653633
+撤并 11.1926274509
+封汝 12.8020653633
+马达声 11.1280889297
+山丹丹花 13.2075304714
+晋宁 10.2630914922
+子虚乌有 10.4994802703
+碑志 11.1280889297
+佩剑 9.91169360541
+发掘 7.30080715276
+晋安 11.9547675029
+沈田子 13.900677652
+趁热 10.533381822
+发议论 11.5027823792
+天鹅湖 10.4666904475
+传输速度 11.9547675029
+安金槐 13.2075304714
+轻言 9.91169360541
+论丛 9.7898037878
+董某 11.1280889297
+流丽 11.3357282945
+设备 5.8011233696
+驾机 11.7034530746
+解怨 13.2075304714
+设好 11.8212361103
+乱来乱去 13.900677652
+帽沿 11.5027823792
+胡笑红 11.9547675029
+解性 12.5143832909
+陈慧琳 12.5143832909
+封氏 10.4041700905
+姆卡帕 13.900677652
+佩利 12.2912397395
+阳痿早泄 12.1089181827
+马略 11.3357282945
+明武 12.8020653633
+哈姆雷特式 12.8020653633
+袁术资 12.8020653633
+怒潮 11.1926274509
+滋长 10.1164880181
+梅亭 12.2912397395
+文辞优美 13.2075304714
+败血症 9.82314020807
+梅亨 13.2075304714
+吕望 11.1280889297
+无所措手 12.5143832909
+西西 12.8020653633
+幕前 11.598092559
+老弱病残 10.8561552143
+尿糖 11.1280889297
+划界 11.1280889297
+佩刀 10.2630914922
+印墨 11.8212361103
+异常现象 10.642581114
+佩带在 12.5143832909
+梁殿 11.4157710022
+竹制品 11.5027823792
+董晨 12.8020653633
+灵通 10.1394775363
+用色 10.8561552143
+卡门 10.2117981979
+李幼滋 12.1089181827
+酶工程 11.598092559
+横眉怒目 12.2912397395
+毕肖 13.900677652
+灵透 12.1089181827
+静摩擦 12.2912397395
+滚回来 13.2075304714
+光敏 9.96885201925
+岛上 7.85567233794
+明逊国 13.2075304714
+百事可乐 10.7226238216
+发成 11.9547675029
+巴锡谒 12.8020653633
+岛主 12.5143832909
+闪速炉 12.5143832909
+地线 11.5027823792
+印好 11.598092559
+滚滚而来 11.598092559
+琼山县 11.9547675029
+第二支 11.4157710022
+地级 10.4349417492
+李作 9.75754292558
+它途 13.2075304714
+交货期 12.8020653633
+耗油 10.8561552143
+高殿 13.2075304714
+用船 11.1926274509
+穿衣镜 10.5684731418
+董昭 12.2912397395
+鼠窜狼奔 12.8020653633
+六百万英镑 13.2075304714
+灵道 13.900677652
+天赐福 13.900677652
+彭子 13.2075304714
+流俗 11.5027823792
+无米之炊 11.8212361103
+曹国王 13.900677652
+长备 13.900677652
+发扬 8.65893063692
+陆氏 12.2912397395
+陆水 11.2616203224
+董明 12.8020653633
+碑帖 10.765183436
+饶有兴味 11.7034530746
+夫子庙 10.8096351986
+梅伦 13.2075304714
+党章 9.96885201925
+熔岩流 10.4994802703
+一百五十二 13.2075304714
+六千五百 12.5143832909
+幕友 12.1089181827
+浑身上下 9.21854642485
+故名 7.54979193526
+彭宇 12.1089181827
+危墙 13.900677652
+着手 6.87070474027
+屏蔽线 13.2075304714
+中秋 8.55357012126
+危境 11.8212361103
+耗气 11.4157710022
+中科 9.48183704418
+百二十千 13.2075304714
+用不上 10.4666904475
+小劫 13.900677652
+电子线路 10.9562386728
+流传 6.83591862418
+发抒 12.8020653633
+北魏登 12.8020653633
+发抖 8.46259834305
+向懿律 12.8020653633
+耗水 11.8212361103
+养性延 11.8212361103
+知取 13.2075304714
+繁荣期 10.3171587135
+素食 9.87532596124
+八日上午 12.2912397395
+新民主主义 9.7898037878
+忙中出错 13.2075304714
+腾云驾雾 10.4666904475
+换马 11.0674643079
+引以为戒 11.1280889297
+横下 10.4666904475
+章轲 13.900677652
+断然措施 11.5027823792
+何患无词 13.900677652
+碑座 11.9547675029
+陆沉 11.5027823792
+趁水和泥 13.2075304714
+死不悔改 12.8020653633
+薛史 12.8020653633
+达卢佩 11.5027823792
+波节 12.8020653633
+踢球 10.4349417492
+有序化 12.2912397395
+垂直地带 12.5143832909
+陆治 12.1089181827
+日月逾迈 13.900677652
+盛开着 11.598092559
+敬请期待 13.2075304714
+同此 11.598092559
+小动 12.2912397395
+科教片 12.1089181827
+擎天柱 11.1926274509
+第二日 9.37888907493
+素面 11.0103058941
+闹市区 10.6818018271
+故宅 12.1089181827
+香馥馥 12.5143832909
+白驹荣 12.8020653633
+捉摸 10.3453295905
+苍天 9.43476953332
+耗掉 12.1089181827
+不速之客 9.74179456862
+苍头 10.7226238216
+故实 11.8212361103
+认出 8.12302532875
+故官 12.1089181827
+一百万两 11.598092559
+鏖战 9.46986085313
+一百万个 12.1089181827
+羊太傅 12.8020653633
+祸乱 10.8096351986
+茯苓 9.10488710638
+西北欧 10.3171587135
+划算 9.37888907493
+故宫 9.24671730182
+信用制度 9.34680076038
+认准 10.0088573539
+阿加西 11.1926274509
+片刻 6.68323422028
+投身于 9.7898037878
+抱下去 13.900677652
+吉士 10.2371160058
+晋唐 12.1089181827
+性征 11.598092559
+杭迎霜 10.9562386728
+泡泡纱 13.2075304714
+边边角角 12.5143832909
+中百 10.0505300503
+黄炎培 10.4041700905
+越描越黑 12.8020653633
+洗脸水 10.3743171274
+危坐 12.5143832909
+用费 11.598092559
+国泰人寿 12.1089181827
+史文译 13.2075304714
+成功率 9.5062284973
+异抗坏血酸钠 13.900677652
+谁给了 11.1926274509
+内销 9.5062284973
+车开进 11.7034530746
+片剂 10.4666904475
+郭汴河 13.2075304714
+天资聪颖 12.2912397395
+桂东 11.0103058941
+资料员 13.2075304714
+六十周年 10.5684731418
+每片 11.0103058941
+春灌 13.900677652
+康塞普西翁 12.2912397395
+晋商 11.9547675029
+正义者 11.5027823792
+狱中 8.22392384971
+救心丸 12.1089181827
+辛纪功 13.2075304714
+秦明见 11.598092559
+颓坏 13.900677652
+料想 9.61021821083
+明廷派 12.8020653633
+灵龟 11.4157710022
+腥风血雨 12.1089181827
+枯树枝 12.1089181827
+卡马 11.598092559
+搀和 11.4157710022
+设在 7.17564400981
+先慈 12.8020653633
+贡绢 13.2075304714
+北沙参 13.900677652
+卖来卖去 13.900677652
+连续谱 10.4666904475
+赖歇尔 13.2075304714
+转让方 10.533381822
+氢酸 12.2912397395
+中盘 10.7226238216
+薛岳 11.0674643079
+金项链 10.9562386728
+内门 11.598092559
+周军进 13.2075304714
+盘陀 11.4157710022
+搜出 9.69598503258
+中直 11.3357282945
+表义 13.2075304714
+赵州茶 13.2075304714
+纷飞 10.4994802703
+进口成本 11.3357282945
+怒意 11.4157710022
+熊性蠢 13.2075304714
+轮上 11.2616203224
+轮下 13.2075304714
+梁文 12.8020653633
+略表寸心 13.2075304714
+一笑 6.71226491548
+用足 10.642581114
+喝风 12.2912397395
+滥垦 11.2616203224
+地煞 10.9562386728
+甘醇 12.2912397395
+蛋卷 13.2075304714
+耗损 10.604840786
+英雄辈出 12.5143832909
+卫青因 12.8020653633
+闹市口 12.8020653633
+庄里 10.1164880181
+陈其瑗 13.2075304714
+解渴 10.0720362555
+祸事 9.55687223012
+划策 11.9547675029
+设坛 10.9049453784
+奥德修 10.8561552143
+个人主义 10.3171587135
+伸着 9.53122979951
+佩尔 10.8096351986
+轮为 12.2912397395
+韦寿栓 11.8212361103
+官僚资本 9.6811699468
+公张溶 11.9547675029
+丛峰林 12.8020653633
+彬县 11.0674643079
+矮矮胖胖 12.8020653633
+远洋船 11.598092559
+言益语 13.900677652
+谋面 10.8096351986
+地炕 11.7034530746
+甘遂 12.1089181827
+速告 12.8020653633
+新疆大学 12.1089181827
+吹头发 12.8020653633
+额定负载 13.900677652
+冤枉路 11.7034530746
+撤出 8.00078029839
+换钱 11.1926274509
+唐武宗 10.6818018271
+埃克哈德 13.900677652
+聚首 10.2371160058
+地炉 12.5143832909
+靳辅 11.7034530746
+吉姆 9.5186510173
+卡尺 11.9547675029
+第二款 11.0103058941
+嘟嘟囔囔 10.604840786
+鉴别信息 13.900677652
+先想 11.0103058941
+孔明善 13.2075304714
+地点 6.68250081357
+片区 10.1871055853
+三万四千 13.900677652
+相形之下 10.2897597393
+古民居 12.5143832909
+感情 6.37557690585
+渺无踪影 13.900677652
+轻薄 9.38981814546
+晋君 12.1089181827
+第二次 6.53170724978
+众说 13.2075304714
+查维斯 13.900677652
+领子 9.82314020807
+石岐 12.1089181827
+中省 12.5143832909
+封掉 13.2075304714
+封授 10.9562386728
+晋周 12.5143832909
+房产证 10.0940151622
+贻笑 11.8212361103
+中看 9.74179456862
+毛澄 13.900677652
+苦楝树 11.2616203224
+宿营 9.58318953844
+伸直 9.40086798165
+印地 13.2075304714
+行距 11.1926274509
+禄廪 13.2075304714
+汗流浃背 10.765183436
+发汗 9.89334446674
+元通宝 11.9547675029
+佳音 11.5027823792
+李必达 11.9547675029
+胡后马 13.2075304714
+龙净环保 10.0294766411
+撤军 9.18217878068
+灵鹫 11.5027823792
+招生办 9.93038573842
+同蒲 10.0505300503
+尤太太 12.5143832909
+吕梁 10.5684731418
+石家河 12.1089181827
+第二步 9.28555713513
+地热 9.30555780184
+彭善 13.900677652
+约旦 9.41204128224
+现场报道 11.9547675029
+讨好 8.43684584695
+发油 12.5143832909
+伯朗宁 13.900677652
+刊名 12.8020653633
+轮作 9.77354326693
+歪缠 12.5143832909
+陶虹 10.2630914922
+撤兵 9.33632946051
+知己 9.16447920358
+文化流氓 13.900677652
+知已 13.900677652
+贾政 8.39128931535
+轻蔑 8.80081122415
+撤免 13.2075304714
+天广 12.5143832909
+万果 13.900677652
+素雅 11.0103058941
+中短 12.2912397395
+管得茶 13.2075304714
+塔姆鲁 13.2075304714
+洁净煤 11.4157710022
+发射光谱 10.9049453784
+知州 9.55687223012
+中石 11.8212361103
+内铺 11.4157710022
+中矿 12.8020653633
+吉奥 11.5027823792
+罗国士 13.2075304714
+诺曼底 9.5062284973
+烫手山芋 10.765183436
+穆里亚 13.900677652
+管理部 9.38981814546
+团脸 13.900677652
+硬拷贝 12.2912397395
+释放器 13.2075304714
+百看不厌 13.2075304714
+维城典 12.8020653633
+阿玲 13.2075304714
+发泡 11.0103058941
+观察哨 13.900677652
+久慕 11.1280889297
+轮休 11.598092559
+陆相沉积 10.3743171274
+葛兰西 11.9547675029
+信息压缩 12.8020653633
+取乐 9.82314020807
+薛己 12.1089181827
+廊房 11.0103058941
+那禁子 12.8020653633
+地灵 12.8020653633
+一道道 9.12155415886
+红蕊 13.2075304714
+领导 5.25649944881
+一九三一年 12.5143832909
+林子里 8.66423568915
+冷冻箱 13.2075304714
+牛蒡 12.1089181827
+清晰明确 13.2075304714
+发泄 8.56313957227
+春燕 10.4994802703
+地火 12.5143832909
+英国文化委员会 13.2075304714
+哥廷根大学 12.1089181827
+吉大 12.1089181827
+蛏子 12.2912397395
+认可 7.25298927841
+明月照 12.2912397395
+宋江转 13.2075304714
+鲍旭引 13.900677652
+歪成 13.900677652
+先提 12.2912397395
+啧啧称奇 11.1926274509
+忠诚老实 11.9547675029
+地王 8.05423887692
+用车 9.04086524761
+维纳滤波 13.2075304714
+平平和和 13.900677652
+晓云 12.5143832909
+章节 9.65218240993
+幕府 8.71889410168
+第二根 11.8212361103
+自右而左 12.1089181827
+射洪 13.900677652
+和硕礼 12.1089181827
+七七数 12.5143832909
+毛泽 13.900677652
+内面 10.4666904475
+罗尼亚 11.9547675029
+尚书郎 10.9049453784
+讨嫌 11.8212361103
+吕毅 13.900677652
+扭脸 11.3357282945
+解法 9.65218240993
+星月光 13.2075304714
+彩虹桥 11.9547675029
+石景山区 11.8212361103
+先排 11.8212361103
+川东 9.25628675283
+慎之又慎 10.4041700905
+内需 6.91967191125
+射流 10.7226238216
+矢忠不二 13.2075304714
+桓仁满族自治县 12.8020653633
+外交部亚洲司 12.8020653633
+反动分子 11.1926274509
+久拖 12.8020653633
+梁朝 10.8096351986
+荷花池 11.9547675029
+薛平 13.2075304714
+十几万个 13.900677652
+魏都洛 13.2075304714
+梁木 12.2912397395
+十几万两 12.5143832909
+坟头 9.77354326693
+第二桶 13.900677652
+杨庄镇 10.7226238216
+谢宗信 13.900677652
+第二桩 12.5143832909
+阿炳会 12.8020653633
+插入式 13.2075304714
+特吕德 13.900677652
+第二档 11.9547675029
+二千一百七十六万五千四百文 13.2075304714
+陈寺福 13.900677652
+奚王牙 13.2075304714
+国家药品监督管理局 13.900677652
+红莲寺 12.5143832909
+气死我 12.1089181827
+远景规划 11.1926274509
+南少陵 12.5143832909
+解池 12.2912397395
+素问 10.2371160058
+琼山市 12.8020653633
+傅以渐 9.66657114738
+村校 13.900677652
+列编 13.900677652
+围棋队 13.2075304714
+斯拉朗 13.2075304714
+素闻 11.7034530746
+纸包不住火 12.1089181827
+柳梢青 13.2075304714
+博伊特 13.2075304714
+默兹河 12.8020653633
+伯南布哥 12.8020653633
+德秀 9.7898037878
+拼了命 11.0103058941
+全面性 10.604840786
+败走麦城 12.1089181827
+梁柱 10.4666904475
+梓潼县 13.2075304714
+德科 13.900677652
+七七日 13.2075304714
+用过 8.9519177616
+幕布 11.1926274509
+川仪 13.900677652
+洼陷 13.2075304714
+脆弱不堪 13.2075304714
+新沭河 11.3357282945
+梁枋 12.1089181827
+夏银绥 12.5143832909
+甘诸州 13.2075304714
+根本好转 10.9049453784
+鸡胸肉 12.5143832909
+毛氏 12.1089181827
+鬼火 9.37888907493
+撤到 9.6811699468
+佩带 10.1871055853
+纯白色 11.0103058941
+煮个 13.900677652
+吓退 10.3743171274
+储存起来 11.0674643079
+薛延 10.642581114
+砸死 9.72629038208
+德福 13.900677652
+私自 8.6803218269
+晋城 10.0720362555
+喧宾夺主 11.1280889297
+期待已久 10.4041700905
+横空出世 10.4666904475
+知府 7.76727960898
+苏仙岭 12.5143832909
+蔡京依 13.2075304714
+知底 12.8020653633
+胖仔 12.5143832909
+解民 11.5027823792
+一千余里 12.5143832909
+就手 13.2075304714
+解气 10.2897597393
+内降 12.8020653633
+平儿理 13.2075304714
+亲临一线 13.900677652
+内陆 7.60541165054
+万余平方公里 10.3743171274
+工商业户 12.8020653633
+奥尔加斯 13.2075304714
+泰晤士河 10.2371160058
+先拍 12.1089181827
+薛式 13.900677652
+塞克斯 11.8212361103
+罗文藻 13.2075304714
+领头 8.79473217808
+明辨真伪 13.900677652
+齐鲁大地 13.900677652
+搜剿 11.7034530746
+彭圯 11.7034530746
+宣传报道 11.3357282945
+血常规 11.9547675029
+荆条 10.4349417492
+结秦晋之 12.8020653633
+梁晴 8.33999602096
+内陷 10.7226238216
+韩遂 10.3171587135
+封懿 12.1089181827
+匀速转动 12.8020653633
+刘文淇 12.5143832909
+段琪瑞 13.900677652
+续集 10.3453295905
+现阶段 8.16733637508
+点烟 10.3743171274
+领奖 10.1630080337
+青铜峡铝厂 12.8020653633
+先抓 11.0674643079
+碑刻 9.20019728618
+私聊 13.900677652
+内阁 6.808103936
+听之任之 10.3171587135
+佩德 12.8020653633
+一周年 9.65218240993
+吉安 9.65218240993
+撤去 9.65218240993
+棉织品 10.0940151622
+拉姆语 13.2075304714
+彗星 9.18217878068
+坟堆 10.8096351986
+言归正传 10.8096351986
+塔伊夫 12.1089181827
+叶学齐 12.5143832909
+瓦列里 13.900677652
+工业产值 8.64318227995
+腐败透顶 11.8212361103
+地狱 8.15447446144
+罗斯托 11.9547675029
+搜到 11.2616203224
+先抽 11.8212361103
+陈翔华 12.5143832909
+先抱 13.2075304714
+寿眉 13.2075304714
+中用 8.83808261895
+送上门 9.7898037878
+素餐尸位 13.2075304714
+列维 11.4157710022
+中田 12.1089181827
+内阻 10.604840786
+毛涤 12.1089181827
+搜刮 9.24671730182
+动物模型 11.7034530746
+中甸 11.1926274509
+先报 11.1926274509
+划破 10.2117981979
+近光灯 12.1089181827
+濒海 10.642581114
+彼此彼此 11.598092559
+先打 10.2897597393
+牛蛙 9.96885201925
+绣楼 13.900677652
+打围 11.8212361103
+先手 11.3357282945
+元四家 11.5027823792
+蔡京任 13.2075304714
+悬移质 11.5027823792
+内雕 13.2075304714
+管理器 13.900677652
+毒瓦斯 13.2075304714
+碑阴 13.2075304714
+私股 12.5143832909
+发源 7.87239913175
+李弥昌 11.598092559
+先找 9.94943393339
+石峪 12.5143832909
+囚室 10.8561552143
+明显化 13.2075304714
+莫额尼 13.2075304714
+欲壑难填 12.5143832909
+四至八道 13.2075304714
+峨眉 9.37888907493
+溢出 8.82550383674
+纳肯 12.8020653633
+探身一看 13.900677652
+撤单 10.604840786
+信守不渝 13.900677652
+牛蛭 13.2075304714
+荆柯 13.900677652
+先战 13.900677652
+圈里人 12.1089181827
+自我管理 11.2616203224
+佛龛 10.604840786
+彭城 9.58318953844
+坟墓 8.26232298264
+德克萨斯 11.1926274509
+贼头狗脑 13.2075304714
+内障 11.598092559
+嫩豆腐 12.8020653633
+全生育期 12.2912397395
+飞来飞去 10.5684731418
+讹脱 13.900677652
+内隔 13.900677652
+射法 11.1280889297
+石峡 11.4157710022
+晋国 9.16447920358
+闭门造车 12.2912397395
+几杆 11.3357282945
+牛爱江 10.6818018271
+印度半岛 9.84023464143
+不瞒您说 12.5143832909
+章草 11.5027823792
+金融风暴 8.88339781516
+铁胆 13.2075304714
+地牢 11.598092559
+项城县 12.5143832909
+无息贷款 11.5027823792
+狱警 11.3357282945
+心有余力 13.900677652
+地物 10.2630914922
+怀塔布 9.56994431169
+荷花淀 12.8020653633
+保防 12.2912397395
+段位制 13.2075304714
+传记类 12.2912397395
+喜剧色彩 11.5027823792
+卓资县 13.2075304714
+怒斥 10.1394775363
+绕弯 12.8020653633
+陆权 13.2075304714
+棉织厂 12.5143832909
+甘镜 12.8020653633
+王完颜 13.2075304714
+中牟 8.73589167805
+滥印 12.8020653633
+踢翻 10.3453295905
+熊有伦 12.8020653633
+游行 8.64318227995
+牛腱 12.5143832909
+牛腰 13.900677652
+幕墙 10.4994802703
+床脚 11.7034530746
+梁慧 13.2075304714
+难以完成 11.2616203224
+上海浦东国际机场 11.9547675029
+牛腹 12.8020653633
+韩青 12.5143832909
+中物 12.2912397395
+廊柱 10.5684731418
+德罗 10.4666904475
+苍崖 12.8020653633
+国富民强 11.4157710022
+领带 9.5186510173
+卡默 13.900677652
+设厂 10.2630914922
+新乐府 10.1630080337
+绕开 9.75754292558
+尼扬贾 13.2075304714
+宋之礼 13.2075304714
+短途游 13.2075304714
+孔中钻 13.900677652
+搀假 13.2075304714
+母弟旭 13.2075304714
+卡麦 13.2075304714
+设台 12.8020653633
+牛脚 13.900677652
+爬下去 13.900677652
+地痞 11.1280889297
+李幼斌 12.8020653633
+晋公 11.2616203224
+兔皮 12.2912397395
+国中生 13.900677652
+佟大霄 13.2075304714
+晋兵 11.7034530746
+明民 13.900677652
+鹿场 12.5143832909
+灵魂 7.36980002425
+晋元 13.900677652
+英迪拉 12.5143832909
+印到 12.1089181827
+印制 9.45802639549
+印刷 7.49544919394
+刊出 10.533381822
+小本票 13.900677652
+印刻 11.598092559
+陆机 10.8096351986
+田径项目 11.8212361103
+发楞 12.2912397395
+没上去 13.2075304714
+禄寺 9.94943393339
+射死 9.20932976975
+先断 11.598092559
+御敌于国门之外 13.900677652
+神霄殿 13.2075304714
+怒族 10.9049453784
+十三丈 13.900677652
+陆某 12.8020653633
+跃上 10.0720362555
+设区 10.4349417492
+尼伯尔 13.900677652
+时过境迁 10.533381822
+表示慰问 11.7034530746
+故弄 12.1089181827
+怒放 10.4994802703
+先救 11.7034530746
+凉丝丝 11.8212361103
+顾曲斋 13.2075304714
+清圣祖 11.8212361103
+第一零六回 13.2075304714
+危厄 12.8020653633
+目光炯炯 10.4994802703
+粥样 10.0088573539
+一万五千余 11.8212361103
+十三万 10.8561552143
+豆腐节 13.900677652
+牛至 13.2075304714
+晋冀 11.0103058941
+马内奇 12.5143832909
+地电 12.8020653633
+平作 12.5143832909
+电子技术 9.12999302751
+发榜 11.9547675029
+回到未来 13.900677652
+曲府 10.0088573539
+轻者 9.61021821083
+晋军 9.91169360541
+性命攸关 12.1089181827
+滥发 10.2371160058
+列示 12.1089181827
+旁证博引 13.900677652
+操知布 13.2075304714
+氢键 10.4041700905
+冈底斯 9.77354326693
+吉尔 10.1394775363
+牛膝 11.2616203224
+卷起 8.89673134603
+性学 12.2912397395
+南征军 13.2075304714
+耗材 11.3357282945
+轿车 7.26080181815
+养营汤 12.2912397395
+蛏干 13.2075304714
+地界 9.43476953332
+撤后 13.2075304714
+虐刑 13.2075304714
+丘天官 12.2912397395
+陆架 10.9562386728
+性子 8.35941410682
+起起伏伏的 12.5143832909
+钢笔画 12.2912397395
+中国登山队 11.1280889297
+印加 10.4041700905
+印务 12.1089181827
+那报子 13.900677652
+间谍案 11.7034530746
+脱扣器 13.900677652
+新店溪 11.9547675029
+沈有鼎 13.2075304714
+蓝幽幽 11.1926274509
+购汇 10.4041700905
+罪与非罪 12.5143832909
+领引 11.9547675029
+戴头识脸 13.900677652
+递阶控制 12.8020653633
+发根 11.1280889297
+抛物面 10.765183436
+划线 11.0103058941
+结核菌 11.0103058941
+灵墟 13.900677652
+能传粉 13.2075304714
+牟煌 11.1926274509
+薛备 13.2075304714
+上原 13.900677652
+肋间 11.2616203224
+愧恨 13.900677652
+百分之二点 11.2616203224
+讨巧 13.900677652
+内道 12.5143832909
+拨出来 13.2075304714
+蕺菜 12.8020653633
+二项式 11.7034530746
+酸式盐 11.9547675029
+刘家兄弟 13.900677652
+梁恩 11.0674643079
+纠错码 11.9547675029
+克塞尔 12.2912397395
+拒食 11.7034530746
+片场 11.7034530746
+两千六百一十万余 13.2075304714
+春生 9.65218240993
+湾仔区 13.2075304714
+入选者 12.8020653633
+上药膏 13.2075304714
+发标 13.900677652
+解毒 8.35941410682
+用血 10.7226238216
+圣济总录 12.2912397395
+毛毯 9.69598503258
+军代表 11.3357282945
+解巨鹿 13.2075304714
+梁怀 13.2075304714
+在所难免 9.04086524761
+舀水 11.0103058941
+牛耕 11.4157710022
+换部 12.8020653633
+内退 12.8020653633
+地瓜 10.1394775363
+金桂见 12.8020653633
+董永 11.5027823792
+苍山 9.87532596124
+王诚 13.2075304714
+邓子恢 11.7034530746
+使令 10.9049453784
+西汉时期 10.2630914922
+牛耳 10.9049453784
+董氏 12.2912397395
+歪打正着 11.2616203224
+华特林 13.2075304714
+特拉法加 12.8020653633
+软木塞 12.5143832909
+王钦若 11.5027823792
+惊恐万状 11.4157710022
+卡龙 13.2075304714
+发案 12.1089181827
+洼里 11.598092559
+今臣 12.2912397395
+久旱 10.8561552143
+封杀 9.48183704418
+封权 13.900677652
+印发 9.13850371718
+艺术歌曲 10.9049453784
+领得 11.9547675029
+设到 13.900677652
+削平 10.2897597393
+危力 13.900677652
+邓公 13.900677652
+苍岩 13.900677652
+设制 11.8212361103
+濒死 11.7034530746
+地球 6.28982486158
+认命 10.4041700905
+地理 6.76101731601
+无耻之徒 11.2616203224
+陶艺 13.2075304714
+溺爱 10.0940151622
+牛背 11.5027823792
+封条 10.3171587135
+区域科学 12.8020653633
+内部 5.63811867897
+阿木尔 12.5143832909
+德绍 12.2912397395
+王小波 10.4041700905
+香槟酒 10.8096351986
+车公庄 12.5143832909
+油头滑脑 13.900677652
+隋代旧 13.2075304714
+韩雍 13.900677652
+小吃街 13.900677652
+厂籍 13.2075304714
+年岁已久 13.900677652
+佩奇 11.5027823792
+铁西区 12.5143832909
+可靠保证 12.5143832909
+殷八师 12.2912397395
+轨道电子 11.9547675029
+牛肚 11.8212361103
+黄陶庵 13.2075304714
+中玉 13.900677652
+纪纲 10.765183436
+去管 10.3743171274
+护发素 12.8020653633
+牛肉 8.40350942668
+容悦 13.2075304714
+三阳开泰 11.7034530746
+吉乃尔 13.900677652
+予及 13.2075304714
+认同 7.75649201785
+韩隐 13.2075304714
+中环 10.3453295905
+卫青取 13.2075304714
+气势汹汹 9.74179456862
+伊子亦 13.2075304714
+有所为 11.2616203224
+吕氏 11.1926274509
+中国外汇交易中心 9.87532596124
+李宗仁 9.43476953332
+放上来 13.2075304714
+佛寺 9.06439574502
+北京师大 13.2075304714
+购油 12.5143832909
+古镜中 12.1089181827
+召集 7.52565283215
+宋江守 12.8020653633
+交点 9.38981814546
+久暂 11.9547675029
+相似性 9.75754292558
+缎被 13.2075304714
+赵升东 13.2075304714
+甘青 11.7034530746
+片名 9.44633035572
+功在千秋 13.2075304714
+西为汉 13.2075304714
+韩镛 13.2075304714
+喝口水 11.4157710022
+鲁哀公 11.9547675029
+尔禄 13.2075304714
+能忍则安 13.900677652
+围产期 12.1089181827
+中火 11.9547675029
+撤回 8.5488195185
+刘抑曹 13.2075304714
+春瘟 13.900677652
+中灶 13.2075304714
+晋北 10.1164880181
+宋良民 13.900677652
+长程力 12.8020653633
+傲物 12.8020653633
+荆扬 12.8020653633
+先查 12.5143832909
+孢子植物 12.5143832909
+程正揆 13.2075304714
+方亭 12.2912397395
+紧张局势 10.2371160058
+菲莫维奇 11.8212361103
+刊发 9.69598503258
+领属 11.5027823792
+储存罐 13.900677652
+释放出 8.85082164473
+甘霖 11.3357282945
+米粉肉 13.900677652
+渐硬 13.900677652
+吉庆 10.1394775363
+卷过 11.9547675029
+浮财 11.4157710022
+字符识别 13.900677652
+晋升 8.91707103027
+忧苦 13.900677652
+驰驱 10.533381822
+远在他乡 12.8020653633
+孙亮 9.22784881751
+亚纳耶夫 13.2075304714
+晋华 12.8020653633
+耗时 9.89334446674
+非常少 10.5684731418
+王必甚 13.900677652
+高开低走 8.77671367257
+良苦 12.1089181827
+甘露 9.34680076038
+内丘县 13.2075304714
+常青树 11.5027823792
+奴颜婢膝 11.2616203224
+佳通 10.4349417492
+冯三才 11.8212361103
+灵香 12.2912397395
+股份制 7.8161782389
+塞格雷 13.2075304714
+乌鲁木齐市 9.75754292558
+讨平 10.3171587135
+窦绾 11.7034530746
+方书 12.1089181827
+毛桃 13.2075304714
+国际石油 10.2117981979
+居住小区 12.5143832909
+三两个 10.3171587135
+南院宣 13.2075304714
+老有所终 13.900677652
+用语 9.27570483869
+贴身衣服 12.2912397395
+晋县 11.7034530746
+印像 13.2075304714
+隆武元 13.900677652
+方义 13.900677652
+阿喀斯 13.2075304714
+坦赞铁路 12.2912397395
+防护区 13.2075304714
+成本核算 11.5027823792
+子羽 11.1280889297
+轻舟 11.3357282945
+拧成一股绳 11.5027823792
+汩罗 12.5143832909
+推广应用 9.71102290995
+陈师鞠旅 13.900677652
+去磁 11.8212361103
+三两下 11.598092559
+吴国将军 13.2075304714
+用词 10.0505300503
+羽林军 11.5027823792
+都市快报 12.8020653633
+先来 8.80081122415
+彭勇 12.8020653633
+方中 11.2616203224
+先期 8.87023973058
+登出来 12.5143832909
+娇羞 10.8561552143
+端网络 13.2075304714
+私藏 10.4041700905
+方丹 12.1089181827
+方为 9.63799777493
+佛宝 11.3357282945
+高人雅士 13.900677652
+先服 13.2075304714
+脑缺血 11.8212361103
+青年志愿者协会 13.900677652
+牛莉 12.2912397395
+用计 9.7898037878
+先机 9.24671730182
+方丈 8.89673134603
+设党 13.2075304714
+耗散 9.93038573842
+许慎著 12.8020653633
+毛根 12.1089181827
+阿卜杜勒 10.1394775363
+刊印 9.85762638414
+内功 10.765183436
+刺激作用 9.22784881751
+董澄 12.5143832909
+王之爵 13.2075304714
+罗海琼 10.6818018271
+宁宗庆 13.2075304714
+沉淀物 11.0103058941
+中点 10.0294766411
+物竞天择 11.7034530746
+拉脱维亚 9.75754292558
+幕宾 10.765183436
+热带性 10.9049453784
+方信 11.0674643079
+母女间 13.900677652
+逐字逐句 11.7034530746
+蕃茄 12.2912397395
+无穷乐趣 13.900677652
+玉溪市 12.2912397395
+德米 13.900677652
+聚龙 12.5143832909
+江苏省政府 11.8212361103
+西双版纳傣族自治州 10.9049453784
+比手 13.900677652
+事到如今 8.71329184614
+王将明 12.2912397395
+中国基督教三自爱国运动委员会 12.1089181827
+达鲁花赤 9.93038573842
+中煤 9.63799777493
+王炳南 11.9547675029
+方俊 11.0674643079
+私营 8.83808261895
+蒲将军 12.2912397395
+新营销 11.598092559
+德籍 12.2912397395
+傲岸 12.5143832909
+陶胎 12.8020653633
+白水泥 13.2075304714
+遭人暗算 12.8020653633
+飘飘荡荡 10.765183436
+北魏继 12.8020653633
+谢里姆 11.9547675029
+地皮 9.32596667347
+甘陵 12.8020653633
+风云际会 10.9562386728
+晋剧 11.8212361103
+柳二人 11.2616203224
+少年队 12.2912397395
+地盘 8.5488195185
+彭华 13.900677652
+语音输入 13.900677652
+薛斗南 12.8020653633
+四百多里 13.2075304714
+片商 13.2075304714
+通过议案 13.2075304714
+方便 6.30077569277
+佳里 13.2075304714
+荐骨 13.900677652
+哭个够 13.900677652
+物价指数 9.06439574502
+尼罗河畔 13.900677652
+彭博 10.3743171274
+灵顿 13.2075304714
+中焦 10.642581114
+地直 10.533381822
+主平面 13.2075304714
+那尖尖 12.8020653633
+讨得 10.6818018271
+彭卫 13.2075304714
+宿舍 7.8161782389
+宋之程 13.900677652
+交响诗 10.4349417492
+白水河 11.9547675029
+黄种人 10.6818018271
+乖僻 12.5143832909
+霍来特 13.2075304714
+理清 10.0088573539
+一百六十多万 13.2075304714
+解放日报 10.4994802703
+校准器 13.900677652
+身体力行 10.5684731418
+李潭镇 13.900677652
+挫损 13.900677652
+全国同胞 12.2912397395
+白水江 11.3357282945
+三五十块 13.2075304714
+拒马 12.8020653633
+流放地 10.8096351986
+临时性 9.32596667347
+雇用军 13.900677652
+囚徒 9.29550746599
+孙权皆 13.2075304714
+和幺妹 10.1871055853
+甘雨 11.3357282945
+繁礼多仪 13.900677652
+方位 8.04274449749
+薛家 10.2371160058
+刊刻 9.80633308975
+印出 10.5684731418
+西娅节 12.8020653633
+送温暖 11.8212361103
+十二万五千余次 13.2075304714
+实质性 7.39339993959
+历史潮流 10.765183436
+课堂教学 11.8212361103
+今天天气 12.2912397395
+结合部 11.0674643079
+妃色 13.900677652
+彭县 11.598092559
+逼起来 13.900677652
+尼格罗 9.05649056552
+古涅昆 13.2075304714
+明确分工 11.5027823792
+卫青击 12.8020653633
+灵飞 12.8020653633
+私蓄 11.9547675029
+方伯 11.5027823792
+故居 8.87023973058
+印军 9.69598503258
+访问记 12.1089181827
+三二百匹 13.2075304714
+行使政权 12.1089181827
+知客 10.2897597393
+牛节 12.5143832909
+张大嘴巴 11.1926274509
+吕温 12.5143832909
+孩子气 10.1394775363
+罗耀 12.8020653633
+黄洋界 12.1089181827
+查干 12.2912397395
+聚齐 11.1926274509
+爱说 11.0674643079
+实施办法 10.6818018271
+娇纵 12.8020653633
+佳酿 11.0103058941
+陶者 13.2075304714
+湖北省财政厅 13.900677652
+法孝直 12.8020653633
+贫嘴恶舌 13.900677652
+酱园 11.8212361103
+领巾 13.900677652
+伊瓦尔沃 13.2075304714
+大学城 10.9049453784
+先是 7.32979468964
+讲上 13.2075304714
+方休 11.3357282945
+五四式 12.8020653633
+暖暖的 8.60737282725
+华夷阁 13.2075304714
+沿门乞讨 13.900677652
+内测 11.4157710022
+往西方 11.3357282945
+控股集团 9.34680076038
+津要 12.2912397395
+内流 10.1394775363
+顷刻间 8.70218062071
+试车手 13.900677652
+毛绒绒 11.5027823792
+治安管理 10.8561552143
+韩正 7.41757030052
+涨满 11.1280889297
+女管家 13.2075304714
+密度板 13.900677652
+荣国府 10.1394775363
+阨塞 12.8020653633
+铸像 11.8212361103
+灵机 12.8020653633
+卡拉 8.9308643524
+文曲星 12.8020653633
+解雇 9.87532596124
+兴衰存亡 13.2075304714
+一个五十多岁 11.1926274509
+掩护着 11.4157710022
+产后 8.71329184614
+内海 10.3453295905
+紫竹林 11.2616203224
+六一散 13.2075304714
+地角 11.598092559
+吉林省人民政府 12.8020653633
+多锤 13.900677652
+忆往昔 13.2075304714
+归约机 13.900677652
+王天民 12.8020653633
+发长 12.8020653633
+用电 8.59240995457
+拒斥 11.9547675029
+用用 11.598092559
+蛋白沉淀 13.900677652
+两万块 11.0103058941
+杀人成性 13.900677652
+五毛 12.2912397395
+精神面貌 10.2897597393
+丹溪心法 13.900677652
+董鄂 11.9547675029
+阿炳猛 12.8020653633
+天昏地转 13.900677652
+以使 9.18217878068
+伸进 9.26594866375
+方向感 10.8561552143
+卷入纠纷 13.900677652
+赔得起 11.9547675029
+射靶 13.900677652
+见面会 10.0940151622
+化民成俗 13.900677652
+卡扣 13.900677652
+女孩子 7.74581955796
+镇静药 10.9562386728
+多罗斯 12.8020653633
+杨中时 12.1089181827
+卡扬 13.900677652
+解除 7.29132840881
+麻醉药品 12.5143832909
+近百家 11.7034530746
+夷平 10.533381822
+德菲 13.2075304714
+供暖系统 13.2075304714
+体育类 10.5684731418
+范志毅 13.900677652
+红契 13.2075304714
+流网渔船 13.900677652
+点位 7.95003509939
+莫无礼 13.2075304714
+岗位数 12.8020653633
+陶罐 10.4041700905
+封驳 11.598092559
+换洗 10.533381822
+党费 11.5027823792
+闭只眼 11.0674643079
+卡托 11.3357282945
+董金 11.8212361103
+大圣依 13.900677652
+灵枢 10.3743171274
+兵家必争之地 9.6811699468
+鸡东县 12.8020653633
+拒收 11.1280889297
+续流 12.8020653633
+侯事惠 13.2075304714
+发闷 10.8561552143
+公学中 13.2075304714
+两千节 13.2075304714
+谨禀 13.2075304714
+拖拉机站 11.9547675029
+处女峰 13.900677652
+内涝 10.5684731418
+神无 13.2075304714
+水至清则无鱼 12.8020653633
+制成品 9.27570483869
+投河 10.9049453784
+黄永玉 12.2912397395
+陶缸 12.5143832909
+关山阻隔 13.900677652
+梅梅划 13.2075304714
+发问 9.20019728618
+降幅 7.32420808293
+李为民 8.33233314821
+换流 13.900677652
+加伊 12.5143832909
+珊瑚石 13.900677652
+僵住 10.2897597393
+友好邻邦 13.900677652
+智力测验 10.533381822
+平均误差 12.8020653633
+产品 4.55685588863
+广济河 11.1280889297
+内涵 8.1608847398
+更向 13.900677652
+多胞胎 13.2075304714
+书法作品 10.9562386728
+推下来 13.2075304714
+迟疑未决 13.2075304714
+同开普 13.900677652
+灵星 10.8561552143
+软件系统 10.4666904475
+加以 6.43846271221
+茅草棚 13.900677652
+佛教 6.84450236788
+百会穴 13.2075304714
+宋刑统 12.8020653633
+调委会 13.900677652
+攒眉苦脸 13.2075304714
+铸出 11.9547675029
+内江 10.0940151622
+瘈脉 13.900677652
+加价 9.46986085313
+陈掌公 11.8212361103
+何计破 13.2075304714
+换油 13.900677652
+誊写版 13.900677652
+阿特 11.1926274509
+最强者 11.5027823792
+中转 9.31571017331
+中软 13.900677652
+负债额 11.5027823792
+袁宗道 12.8020653633
+中轴 9.33632946051
+降得 10.8096351986
+加仑 10.6818018271
+地被 8.089536659
+加付 12.8020653633
+藻类学 12.1089181827
+射阳 10.7226238216
+鎏金 9.6811699468
+王有龄 13.2075304714
+相差近 10.3743171274
+陶红 12.8020653633
+四十三个 13.900677652
+宝姐姐 9.93038573842
+点亮 9.38981814546
+方向性 9.03314320152
+赫图阿拉 11.598092559
+加亮 12.2912397395
+点交 13.2075304714
+去蜡 13.900677652
+泡沫式 13.900677652
+皲裂 10.604840786
+德舰 12.8020653633
+加人 10.9049453784
+树立 7.71241352889
+鉴频 13.2075304714
+淡薄 9.87532596124
+山上山下 11.1280889297
+加了 9.36807815882
+孤傲不群 12.8020653633
+灵智 13.2075304714
+白里泛 13.900677652
+鬼话 9.87532596124
+加于 10.533381822
+口腹 11.5027823792
+天真烂熳 13.900677652
+容态 13.900677652
+平行力系 13.900677652
+不痛 10.1164880181
+卷烟 8.32094782599
+咕咚一声 10.8096351986
+阳起石 11.2616203224
+芮康 12.2912397395
+普普通通 9.65218240993
+恭听 10.4994802703
+龙户文 13.2075304714
+发钱 11.9547675029
+缩起来 13.900677652
+软下疳 12.2912397395
+传达员 13.2075304714
+方便筷 13.900677652
+帕特玛 13.900677652
+重复劳动 13.900677652
+划船 9.41204128224
+换水 11.4157710022
+马克西 13.900677652
+涨潮 10.0505300503
+中远 9.6811699468
+武陟 11.1280889297
+节度使 7.79143006921
+中进 11.5027823792
+袭来 9.00283785202
+石门水库 11.7034530746
+平一 13.900677652
+外馆 13.900677652
+轩敞 13.2075304714
+动脑子 11.3357282945
+加之 7.22485443034
+尿不湿 13.900677652
+八宝粥 11.7034530746
+庄客取 12.8020653633
+内波 11.4157710022
+换气 9.65218240993
+切实做好 10.3453295905
+运管处 12.1089181827
+胡汉三 12.8020653633
+流动红旗 13.900677652
+百般抚慰 12.8020653633
+善罢干休 13.900677652
+换汤 12.5143832909
+灵曜 12.8020653633
+点个 11.8212361103
+点中 11.7034530746
+光灯 13.2075304714
+加个 10.8561552143
+别错过 12.5143832909
+私立 9.26594866375
+望海寺 13.2075304714
+味道鲜美 10.1630080337
+林龄 12.8020653633
+耍嘴 12.8020653633
+预制板 12.2912397395
+滋扰 11.3357282945
+网络空间 12.2912397395
+清风店 12.2912397395
+加为 11.1280889297
+毛霉 12.2912397395
+日有所思 12.8020653633
+孔斯坦 12.8020653633
+业精于勤 13.900677652
+杭冠 13.2075304714
+亨通 11.0674643079
+和硕英 13.2075304714
+流通证券 13.900677652
+换汇 11.1280889297
+荧惑 11.3357282945
+雅各宾派 10.3453295905
+加上 5.52874147322
+零的突破 11.2616203224
+柴尔德 11.5027823792
+牛精 12.8020653633
+主导型 10.6818018271
+八极拳 13.2075304714
+内沿 11.8212361103
+划艇 12.1089181827
+俄罗斯国家杜马 11.9547675029
+中辰 11.1280889297
+肤轻松 13.2075304714
+牛粪 10.4041700905
+地表 7.47580862807
+中达 11.8212361103
+伸张正义 11.0103058941
+内河 8.3285236198
+福人 12.8020653633
+客观因素 11.1280889297
+轻纱 10.8096351986
+帽顶 11.4157710022
+巴德西 13.2075304714
+一千四百多 12.5143832909
+轻纺 8.5488195185
+国防科委 12.2912397395
+见风转舵 13.2075304714
+自卑感 11.1926274509
+两岸关系 10.6818018271
+偃师 9.72629038208
+过犹不及 11.4157710022
+纷扰 10.1871055853
+山崩地裂 10.765183436
+双方同意 10.0505300503
+谋求 8.15128466607
+平治天下 13.900677652
+永嘉县 12.2912397395
+解铃 12.1089181827
+涨法 13.900677652
+呼喝声 13.2075304714
+新姿 13.900677652
+唐生智 10.9562386728
+醚类 11.598092559
+发霉 9.91169360541
+木犀科 11.2616203224
+香港市民 12.5143832909
+章章 13.900677652
+范式 11.0674643079
+盆底 10.765183436
+由帝师 13.2075304714
+第二道 9.58318953844
+木迭儿 12.2912397395
+参考价值 9.00283785202
+周立勋 11.7034530746
+灵敏 8.31718134319
+发面 11.1280889297
+涌动 8.74738605748
+值不值得 11.7034530746
+韩延徽 12.8020653633
+科隆市 13.900677652
+燕顺道 12.1089181827
+靖伯 12.5143832909
+议题 8.17709255002
+毛钱 9.66657114738
+发青 9.75754292558
+宿缘 13.2075304714
+美国科学院 9.85762638414
+各院系 13.2075304714
+终澈霞 13.900677652
+聚拢 10.2117981979
+吴于廑 11.8212361103
+一九六九年 11.8212361103
+中谷 12.1089181827
+收复河山 13.900677652
+阴阳人 11.8212361103
+诸道行 12.1089181827
+夙兴夜寐 12.2912397395
+青铜器时代 11.3357282945
+周境才 13.2075304714
+孙大人 11.8212361103
+心头撞鹿 13.2075304714
+李王渠 13.2075304714
+素淡 11.598092559
+大连理工大学 12.2912397395
+编码数据 13.900677652
+卡恩 9.82314020807
+公田法 13.2075304714
+本台消息 13.900677652
+巢呈浅 12.5143832909
+逆来顺受 10.533381822
+敌对者 12.8020653633
+猛追 10.7226238216
+硕果仅存 12.2912397395
+踢腾 12.2912397395
+踢腿 11.1926274509
+范志 12.1089181827
+大陆军队 13.2075304714
+药囊 11.8212361103
+拖走 10.4349417492
+降将 10.0940151622
+阿爹 11.2616203224
+死的死 10.4349417492
+章程 8.06294720481
+阿爸 11.1280889297
+石帆 13.900677652
+艳质 12.8020653633
+种源 11.598092559
+封顶 10.2630914922
+包文正 13.2075304714
+视如己出 13.2075304714
+稳步发展 9.54396882529
+大城镇 11.5027823792
+几家愁 11.0103058941
+发音 8.81308131674
+收市报 10.1394775363
+街车 11.9547675029
+满满登登 13.900677652
+财政困难 10.0088573539
+纷披 11.4157710022
+涨水 10.4041700905
+武装侵略 11.7034530746
+日久见人心 11.598092559
+蓟运河 10.765183436
+牛羊 9.07236391467
+淡马锡 10.765183436
+盛筵必散 13.900677652
+福井 11.5027823792
+净流入 7.76079309975
+扭秤 11.0103058941
+公路运输 9.09665660724
+射门 10.5684731418
+掐指一算 11.2616203224
+五光十色 10.2630914922
+秦凤路 11.4157710022
+第二部 9.17328983326
+一千二百多 11.9547675029
+老农夫 13.900677652
+牛群 10.4041700905
+张北川 12.1089181827
+范德 11.9547675029
+钱德勒 12.2912397395
+踢脚 12.5143832909
+中资 9.00283785202
+所费不赀 13.900677652
+峨边 11.9547675029
+产地 7.38300637906
+撒落 11.1926274509
+梁鹏 12.2912397395
+池中 9.80633308975
+发掘出来 11.3357282945
+笔触 9.56994431169
+李文成 13.2075304714
+工伤保险 9.98865464655
+内湖 11.0674643079
+解闷 9.65218240993
+星座号 12.8020653633
+打油 11.9547675029
+通信产业 13.2075304714
+无先例 11.4157710022
+五步 10.5684731418
+娇艳 9.87532596124
+拿上 13.900677652
+池上 11.2616203224
+烧眉之急 13.2075304714
+阿加特 13.2075304714
+取保 12.1089181827
+精河 11.9547675029
+哈博罗内 11.9547675029
+人前人后 11.4157710022
+小金娃 12.8020653633
+怒骂 9.87532596124
+拉交情 13.900677652
+斜井 11.0103058941
+产权交易 9.27570483869
+都虞候 12.1089181827
+阿格拉 11.4157710022
+甜睡 13.2075304714
+涨涨 12.5143832909
+先验 10.1871055853
+多次站 13.2075304714
+委员制 12.8020653633
+除风湿 13.900677652
+热带鱼 10.765183436
+灵宪 12.2912397395
+茄子 9.36807815882
+笑嘻嘻 8.4284069783
+内窥镜 10.604840786
+内港 10.9562386728
+王银满 11.2616203224
+不必要 8.70772080109
+法兰西第五共和国 11.9547675029
+德耀 9.91169360541
+角锥体 13.2075304714
+七一年 12.8020653633
+边防哨所 13.2075304714
+千夫所指 11.2616203224
+斜交 10.9562386728
+发际 11.1280889297
+通背拳 11.1280889297
+引上来 13.900677652
+纪耆 13.2075304714
+村里 7.00702129737
+签署日 12.8020653633
+村野 10.642581114
+艾纳香 12.8020653633
+大一统 10.0940151622
+饮食结构 11.0103058941
+结合法 12.8020653633
+尔顿 10.8561552143
+懿德 11.7034530746
+行谊 13.2075304714
+宝钗沉 13.2075304714
+原因无他 13.900677652
+郭祥正 11.7034530746
+章第 9.80633308975
+发难 9.28555713513
+茯神 12.2912397395
+嚼舌根 11.598092559
+复垦 11.0674643079
+准确无误 10.2117981979
+北府军 13.2075304714
+铸印 12.1089181827
+溺谷 11.3357282945
+蕉布 13.900677652
+陆风 11.8212361103
+轻缓 12.1089181827
+搀扶着 9.10488710638
+陈国明 13.900677652
+偷窃罪 13.900677652
+米洛斯岛 13.2075304714
+芸香苷 13.900677652
+中路 8.25523075433
+先驱 8.37921673411
+燃油税 12.8020653633
+一个一百多年 13.2075304714
+野果子 11.9547675029
+力疾 13.900677652
+叼着 9.61021821083
+鳞次节比 13.900677652
+钢丝床 11.8212361103
+滑铁卢 9.72629038208
+德胜 8.80692745117
+基伍湖 11.8212361103
+输送顺序 13.900677652
+德莫利 12.8020653633
+赫哲人 12.5143832909
+急进 10.4349417492
+廉州 11.8212361103
+代代相承 12.5143832909
+北二环 12.8020653633
+中越 9.7898037878
+腹泻 8.53003962385
+格格先 13.2075304714
+德育 11.0103058941
+第二重 11.5027823792
+怒马 13.2075304714
+轻罪 11.0103058941
+香港特别行政区政府 11.7034530746
+内源 11.598092559
+贵族化 11.8212361103
+奇遇 10.1630080337
+希夏邦 12.1089181827
+知恩图报 11.598092559
+明玉珍 11.5027823792
+轻罚 13.2075304714
+马应龙 10.9562386728
+轩朗 12.5143832909
+再进一步 9.77354326693
+馒头山 12.8020653633
+记数法 10.4666904475
+生拖死拽 13.900677652
+春试 13.900677652
+奋起 8.97342396682
+一个十五岁 11.9547675029
+范康 13.900677652
+遑遑不可 12.8020653633
+呼啸声 11.5027823792
+东坡肉 12.5143832909
+下加利福尼亚州 12.2912397395
+二倍 11.5027823792
+第二队 11.3357282945
+蓝球 12.5143832909
+灵宝市 11.9547675029
+王莽自立 13.2075304714
+心里不安 11.598092559
+地趟 12.1089181827
+着重 7.93709830836
+瓜皮帽 11.2616203224
+半条命 12.5143832909
+马里斯 12.5143832909
+春谷 12.1089181827
+米萨德 12.8020653633
+卡曼 13.900677652
+徐秀才 13.2075304714
+木卫四 13.2075304714
+卸职 11.3357282945
+胚芽 11.4157710022
+叼烟 12.8020653633
+呜呜声 12.5143832909
+第二阵 12.5143832909
+阿格斯 11.7034530746
+产品升级 10.9049453784
+汤玉麟 13.2075304714
+种树 10.533381822
+一忍再忍 12.8020653633
+去模糊 13.900677652
+察隅县 11.3357282945
+仪制 10.533381822
+养分 8.92394390956
+四河 11.3357282945
+采果 13.900677652
+发酵 8.24468584116
+狼狈不堪 10.4994802703
+党规 12.8020653633
+发酸 9.62401153296
+艳诗 12.8020653633
+百下百着 12.8020653633
+力作 10.0720362555
+甘洛 12.5143832909
+成祖 10.765183436
+第三世界 9.11318590919
+楼里 9.38981814546
+柳湾 11.4157710022
+宝钗正 13.2075304714
+董必武 10.4041700905
+伸诉 13.900677652
+风筝节 12.5143832909
+大比分 11.7034530746
+孔端 12.8020653633
+炒作 6.47710920772
+力使 12.8020653633
+虎头蛇尾 10.3171587135
+韧皮纤维 11.1280889297
+产假 11.9547675029
+斩钉截铁 9.19114745066
+佛性 10.4994802703
+大运会 12.8020653633
+克莱蒙费朗 13.900677652
+十余万两 13.900677652
+怀着 7.54456999128
+牛科 10.5684731418
+性交时 11.2616203224
+盆塘 13.2075304714
+羚牛 10.2897597393
+并非如此 9.71102290995
+卡普 11.0674643079
+雷根斯堡 11.9547675029
+顾眉 9.05649056552
+章大郎 9.04086524761
+搬运工 10.765183436
+针灸学 11.1926274509
+水尺 12.5143832909
+食不裹腹 13.900677652
+白玫瑰 11.4157710022
+好搭档 13.2075304714
+胭脂扣 13.900677652
+迫害 7.91674137129
+格杀 12.1089181827
+袭扰 9.91169360541
+不良情绪 11.7034530746
+地质 6.79735558945
+目迷五色 13.2075304714
+麦尔登 12.5143832909
+小军飞 13.2075304714
+先富起来 10.9049453784
+翡翠水库 13.2075304714
+卸肩 13.2075304714
+浦城县 12.2912397395
+包工头 10.1164880181
+力保 9.80633308975
+陆龟 12.5143832909
+力促 10.1164880181
+同义字 12.5143832909
+俄克拉荷马州 12.2912397395
+相继问世 10.1630080337
+玛哈尔 12.5143832909
+第二集 12.2912397395
+礼拜日 13.2075304714
+吴为好 13.2075304714
+作物栽培 12.1089181827
+一千句 13.2075304714
+庵主 9.58318953844
+古色古香 10.642581114
+瞿绍基 13.900677652
+小金川 10.604840786
+甘润 13.2075304714
+卡昌 12.8020653633
+局骗 12.8020653633
+运管局 11.9547675029
+副产 13.2075304714
+王骥主 13.2075304714
+伪满政府 13.2075304714
+泸溪县 13.2075304714
+延秋镇 13.2075304714
+危若累卵 13.900677652
+衔冤 13.2075304714
+冀中平原 11.1280889297
+产儿 11.9547675029
+黄启臣 13.2075304714
+一千多顷 13.2075304714
+理发馆 12.2912397395
+石庙 12.8020653633
+用火 10.2897597393
+甘汞 12.1089181827
+训诫 10.1630080337
+流通渠道 11.598092559
+全套设备 13.2075304714
+地貌 7.2872934336
+消去 11.0674643079
+老城镇 12.2912397395
+满蒙汉 11.4157710022
+联合国国际贸易法委员会 12.8020653633
+力主 8.69119149913
+硅微粉 13.900677652
+发送 7.79588441956
+风蚀洼地 11.4157710022
+自动进样 13.900677652
+降官 10.3743171274
+炒上 13.2075304714
+炒下 12.8020653633
+竞选人 13.2075304714
+炒买 13.900677652
+贝勒府 11.0674643079
+苔原 10.2371160058
+走钢丝 11.4157710022
+两千一百万 13.2075304714
+内标 12.2912397395
+消受 10.4994802703
+巴拉哈斯 13.900677652
+李广利 11.5027823792
+中山服 12.5143832909
+少爷兵 13.900677652
+蚕豆 9.29550746599
+艺术专科 13.2075304714
+石床 11.1280889297
+盖尔曼 13.900677652
+陶窑 10.9562386728
+勾上 12.5143832909
+流星群 11.598092559
+内核 10.0940151622
+马哈金 13.2075304714
+炊火 13.2075304714
+第二面 12.8020653633
+奉劝 10.9562386728
+妙手回春 11.4157710022
+假图 12.1089181827
+由于 3.86056350191
+高级阶段 11.0103058941
+安全意识 10.765183436
+关系逻辑 12.8020653633
+甘泉 9.84023464143
+廉宜 13.900677652
+林斯基 11.5027823792
+中词 13.2075304714
+村霸 11.8212361103
+利文斯 11.598092559
+抬下来 11.9547675029
+消化 6.94413220882
+西斯廷 11.5027823792
+侍班阁 13.2075304714
+黄君汉 13.2075304714
+中试 11.0103058941
+瑶山 11.1280889297
+瓦剌军 12.2912397395
+中译 13.900677652
+乌梢蛇 13.2075304714
+黄梅戏 11.7034530746
+没事儿 9.58318953844
+力争 7.93709830836
+薰炉 12.5143832909
+贱种 11.8212361103
+监测 7.17804785712
+范士 13.900677652
+内森 12.8020653633
+康斯特 11.598092559
+唐霍塞 13.900677652
+韩滔 10.1164880181
+习汉俗 11.9547675029
+性恶论 12.2912397395
+布宜诺斯艾利斯 9.77354326693
+二十六元 13.900677652
+翘尾 9.63799777493
+绸缎庄 11.5027823792
+内棺 11.2616203224
+石庄 13.900677652
+备尝 11.8212361103
+官运亨通 11.4157710022
+题上 13.2075304714
+题下 12.5143832909
+勾人 11.1926274509
+炊烟 9.71102290995
+二十名 9.66657114738
+换档 10.7226238216
+租赁期 11.9547675029
+产出 8.0285598625
+鬼车 13.900677652
+暴力片 13.900677652
+消协 10.8096351986
+扭结 11.0103058941
+聚敛 9.84023464143
+权势者 12.2912397395
+扭绞 12.8020653633
+司法独立 12.2912397395
+题个 13.900677652
+爬开 12.8020653633
+北京市工商行政管理局 12.5143832909
+帕金斯 13.900677652
+题中 12.8020653633
+记名投票 12.8020653633
+良药苦口 13.900677652
+延平府 11.7034530746
+长短 7.8161782389
+满头白发 10.765183436
+题为 8.55834340001
+灵括 13.2075304714
+甘油 9.80633308975
+光焰 10.642581114
+南岳庙 12.8020653633
+甘河 11.598092559
+新竹市 11.598092559
+白菊 12.8020653633
+哲学理论 10.8096351986
+一日三秋 13.2075304714
+中论 11.1926274509
+抗虫棉 12.5143832909
+麻菽麦 13.2075304714
+灵感 9.00283785202
+似非而是 13.900677652
+中行 7.49379766591
+硬件检验 13.900677652
+小看人 12.8020653633
+韩浩 11.598092559
+十二家 12.1089181827
+中街 9.5186510173
+呼唤声 12.2912397395
+与你何干 11.8212361103
+佛手 10.4041700905
+池田勇人 12.5143832909
+胡梅尔 13.2075304714
+行动代号 12.5143832909
+饱和点 13.900677652
+虎视眈眈 9.7898037878
+解郁 11.4157710022
+分析案情 13.2075304714
+中国矿业 13.2075304714
+大好局面 12.1089181827
+金雁桥 13.2075304714
+断断不可 13.2075304714
+韩流 12.2912397395
+董青 13.900677652
+店主 8.85082164473
+郑和奉 12.2912397395
+张季直 13.2075304714
+去职 9.40086798165
+望海山 12.5143832909
+两万元 10.1871055853
+撒腿 10.7226238216
+党证 13.2075304714
+环境中运行 13.900677652
+拒接 12.8020653633
+卸船 12.5143832909
+消像 12.5143832909
+玩惯 13.2075304714
+联接关系 13.900677652
+颜小将军 11.8212361103
+原子结构 10.2371160058
+伊藤傅文 13.2075304714
+石槽里 12.2912397395
+彩色图像 11.4157710022
+时光隧道 12.2912397395
+安乡侯 13.900677652
+寿命长 10.0088573539
+南子北 12.2912397395
+要花费 10.4349417492
+唐宋诸 11.9547675029
+很水 13.900677652
+困人 13.900677652
+党课 12.2912397395
+李文杰 12.1089181827
+去者 12.1089181827
+贫铀弹 13.900677652
+产前 10.604840786
+十一担 12.2912397395
+董霖 13.2075304714
+换毛 12.1089181827
+中装 11.4157710022
+水利资源 10.4041700905
+唐淮源 13.2075304714
+凭你是谁 13.2075304714
+中远期 11.2616203224
+毛遂 13.2075304714
+流浪生活 11.2616203224
+权相宇 13.900677652
+沙以城 13.2075304714
+首因效应 13.900677652
+贼不走空 11.9547675029
+挣钱 8.48457724977
+玩性 13.2075304714
+拒捕 12.1089181827
+乌特河 13.2075304714
+刀刀见血 13.900677652
+非接触性 12.8020653633
+钱养先 10.1164880181
+重画 13.900677652
+过不下去 11.1280889297
+煎点 13.900677652
+饺子 8.61747392324
+轻税 12.5143832909
+拗劲 13.900677652
+温和性 12.2912397395
+消停 10.0720362555
+拉格朗 10.0294766411
+取法于 12.2912397395
+范宁 12.2912397395
+燃油箱 12.1089181827
+磷灰石 10.1871055853
+孙太甲 12.8020653633
+拒挡 11.5027823792
+缅甸政府 11.598092559
+长期投资 8.42421410004
+毛选 11.0103058941
+七十条 12.5143832909
+养鹰鹞 13.2075304714
+嫠妇 13.900677652
+谢胡 13.2075304714
+穷极 11.7034530746
+地轴 10.3453295905
+下一辈 11.7034530746
+脱离苦海 12.2912397395
+解送 10.9049453784
+韩涔 12.8020653633
+两三百文 13.2075304714
+趁此机会 9.71102290995
+范宽 11.598092559
+用率 13.2075304714
+地转 9.54396882529
+原发癌 12.5143832909
+约旦人 12.5143832909
+葡萄牙文 12.5143832909
+翻本 12.2912397395
+产区 7.33823355828
+民族民主 13.2075304714
+射速 8.90346537821
+结深 12.8020653633
+去腥 13.900677652
+卸荷 13.2075304714
+毛重 13.2075304714
+艾尔湖 12.1089181827
+解释 5.71282220828
+纷杂 11.1926274509
+韩江 10.0505300503
+触礁 11.0674643079
+红光照 12.5143832909
+莫猎骄 13.2075304714
+见贤思齐 13.900677652
+翁家山 10.3743171274
+第三季度 6.31641283359
+操教唤 13.2075304714
+望外 13.2075304714
+婺州 10.1871055853
+降妖 9.37888907493
+吕雉 12.5143832909
+体育 7.70016847793
+正开着 13.2075304714
+中西 9.03314320152
+苛政猛于虎 12.5143832909
+舒放 13.2075304714
+产卵 7.88452049228
+哲盟 12.8020653633
+荣秋谢 13.2075304714
+风马牛 13.900677652
+伏毛 12.8020653633
+卡斯 10.1630080337
+德萨 12.8020653633
+保险条款 11.9547675029
+消减 10.2897597393
+西环路 10.8096351986
+中山医科大学 12.8020653633
+艳装 12.8020653633
+小中见大 12.8020653633
+铸型 11.4157710022
+康南海 12.8020653633
+性交易 11.598092559
+东挪西撮 13.900677652
+卡文 13.2075304714
+申屠氏 13.2075304714
+一个九十度 13.2075304714
+内模 13.2075304714
+少年游 13.900677652
+易异构 13.900677652
+战略家 10.7226238216
+喷香的 11.4157710022
+引燃 9.94943393339
+韩氏 11.9547675029
+如画 10.8096351986
+一个两岁 12.2912397395
+二千多年 11.8212361103
+陶瓷餐具 13.900677652
+盆子 9.43476953332
+空山鸟 11.9547675029
+中视 11.598092559
+聚有 13.900677652
+半城 12.1089181827
+中观 10.2897597393
+韩泰 11.5027823792
+吕陶 13.2075304714
+中觉 11.5027823792
+王纪 11.7034530746
+和义律 12.8020653633
+甲胺 11.2616203224
+积压产品 11.9547675029
+十八万余 13.2075304714
+孙代王 13.2075304714
+战略学 11.4157710022
+春辉 13.900677652
+格雷厄姆 10.8561552143
+王小雯 11.598092559
+两审终审 13.2075304714
+白色 6.51296841289
+救助卡 13.900677652
+第二国际 9.84023464143
+困乏 9.62401153296
+苯肼 12.1089181827
+玩意 10.4041700905
+酸酸的 10.533381822
+解酒 11.2616203224
+体肤 12.1089181827
+即兴之作 12.8020653633
+魏都邺 12.5143832909
+露肚脐 13.900677652
+村长 8.0229418702
+壁画墓 10.9562386728
+雨零星散 13.2075304714
+消光 11.1280889297
+魏咎 13.2075304714
+体面地 11.3357282945
+庄客托 13.2075304714
+证明文件 10.765183436
+第二间 12.8020653633
+棉花 6.68030381525
+保险箱 10.9049453784
+宽猛相济 12.5143832909
+村镇 8.87023973058
+出国境 11.0674643079
+陶砚 13.2075304714
+嵌缝 13.2075304714
+吕阁 13.900677652
+春运 10.5684731418
+面向农村 12.1089181827
+抚河 10.4041700905
+续文 13.900677652
+素来 9.15574552361
+热击穿 13.2075304714
+划设 12.2912397395
+来苏水 12.8020653633
+近期内 9.98865464655
+地膜 11.2616203224
+明清 7.5871296057
+换新 10.9562386728
+归结为 8.43261751084
+敕令 9.53122979951
+照明用 10.9562386728
+徐濉 12.1089181827
+沼泽率 13.900677652
+换文 10.9049453784
+续断 11.4157710022
+迫在 12.5143832909
+托素湖 12.2912397395
+素材 8.89004235788
+改革家 10.0088573539
+鬼节 13.2075304714
+河豚毒素 11.8212361103
+春耕 10.6818018271
+出尔反尔 10.604840786
+换料 12.8020653633
+石膏板 10.8096351986
+勒布朗 12.1089181827
+广告商 11.7034530746
+新竹县 11.598092559
+卷积 11.7034530746
+不下于 10.9049453784
+一夕之间 11.4157710022
+克赛钦 11.598092559
+宝钗李 13.900677652
+此项工作 10.8096351986
+司天鱼 11.598092559
+十五点八 13.900677652
+姗姗 11.1280889297
+以下 5.19302940387
+睹物伤情 13.900677652
+圣诞歌 12.2912397395
+摄像管 11.3357282945
+夫斯 12.8020653633
+无法弥补 10.604840786
+素服 11.0103058941
+内政 8.5440913773
+内放 11.4157710022
+甘愿 9.29550746599
+冠亚军 11.9547675029
+有瑶琳 13.2075304714
+会员费 12.1089181827
+春联 10.3453295905
+招募新兵 13.900677652
+后置词 12.8020653633
+防护用品 12.5143832909
+没骨山水 13.2075304714
+郁郁 10.1630080337
+辅导员 10.9562386728
+房产税 9.5062284973
+涎着脸 11.3357282945
+佛法 9.29550746599
+斯沃普 13.900677652
+地脚 13.900677652
+砷中毒 12.1089181827
+德语 9.26594866375
+牛痘 12.1089181827
+丑恶嘴脸 11.8212361103
+鬼船 11.5027823792
+陵迟 12.1089181827
+张冠李戴 11.5027823792
+地脉 9.45802639549
+德诺 12.5143832909
+和灌丛 10.604840786
+外八庙 11.7034530746
+柯达公司 12.5143832909
+德斯特 13.2075304714
+工业性 11.598092559
+巢呈杯 13.2075304714
+遗传病 9.91169360541
+韩揖 9.46986085313
+挂牌 6.94508504358
+湿纸巾 13.900677652
+倪志钦 13.2075304714
+竞跑 13.2075304714
+指责 7.68606955355
+萨尔托 11.9547675029
+抚掌 11.598092559
+国务院办公厅 9.71102290995
+鲔鱼 13.2075304714
+樊南 13.2075304714
+抹来抹去 13.2075304714
+本级 9.5062284973
+向潇湘 13.900677652
+内文 12.8020653633
+降噪 10.765183436
+内斜 13.900677652
+赙仪 13.2075304714
+荆针 13.2075304714
+物质财富 10.0294766411
+内斗 12.1089181827
+失人者亡 13.900677652
+耍弄 10.604840786
+内斯 10.604840786
+千叮万嘱 12.2912397395
+农技站 13.900677652
+释名 11.3357282945
+罗斯金 12.5143832909
+忠于祖国 13.2075304714
+笑貌 12.8020653633
+大赢家 10.765183436
+早稻田 12.8020653633
+佳景 11.8212361103
+颜守忠 12.8020653633
+陶真 12.1089181827
+彻悟 12.2912397395
+腾贵 11.9547675029
+主办者 12.8020653633
+消得 11.5027823792
+银发族 13.900677652
+属于 5.36387793092
+基本点 10.3171587135
+石头 6.87070474027
+孔明同 12.5143832909
+姨太太 8.80692745117
+谋杀 9.05649056552
+光触媒 11.9547675029
+可行性 8.94485059437
+代职 13.2075304714
+世界反法西斯战争 10.604840786
+人脉关系 12.8020653633
+形象性 11.2616203224
+马灵 10.642581114
+艾伦 10.2897597393
+地肤 12.8020653633
+峰峦起伏 11.3357282945
+一两千平方米 13.900677652
+无晶格 13.900677652
+苏联部长会议 11.1926274509
+太酷 13.2075304714
+略胜一筹 10.6818018271
+奏表 11.9547675029
+渐轻 12.8020653633
+卸货 10.4666904475
+六星期 13.900677652
+种数 10.2371160058
+抗干扰 10.8561552143
+满员 10.8096351986
+泼洒 10.8096351986
+散掉 12.2912397395
+抱头 10.3743171274
+万斯同 11.598092559
+阶下囚 10.604840786
+能源消耗 9.61021821083
+陶皆 13.2075304714
+上缴利润 9.75754292558
+孽畜 9.98865464655
+方向标 13.2075304714
+艾伟 12.8020653633
+路沙城 13.2075304714
+和义兰 11.7034530746
+心膂股肱 13.900677652
+八五一 13.2075304714
+商标权 11.3357282945
+达吉斯坦 13.2075304714
+佳期 11.598092559
+浮躁 9.66657114738
+福禄寿 11.7034530746
+北魏行 12.2912397395
+属下 9.20019728618
+炭坑 13.900677652
+刘天韵 13.2075304714
+正当行为 12.2912397395
+卡死 11.2616203224
+弦乐 9.72629038208
+分配制度 9.87532596124
+首脑人物 11.2616203224
+后燕军 13.2075304714
+清圣象 13.2075304714
+挂牵 11.5027823792
+红棕色 10.4666904475
+湖东 10.2117981979
+轻生 10.765183436
+塔姆沃 13.2075304714
+毛依罕 12.5143832909
+齐败魏 13.2075304714
+去过 8.03420959504
+李广廉 12.5143832909
+消弭 10.3743171274
+荆门 10.0088573539
+先遣 10.4349417492
+初亚非 13.2075304714
+肝移植 12.8020653633
+消弥 12.8020653633
+难以捉摸 10.4994802703
+两部鼓吹 13.900677652
+缪色奥 13.900677652
+定向井 13.900677652
+七颗 11.2616203224
+张孙振 11.598092559
+翻板 11.8212361103
+妇科病 10.6818018271
+电子白板 13.900677652
+武都 9.69598503258
+哽哽咽咽 11.2616203224
+王平令 13.900677652
+显著性 12.2912397395
+用粮 12.5143832909
+罗斯部 12.1089181827
+黄道面 11.3357282945
+料酒 11.5027823792
+殷人 11.598092559
+孙玉厚 8.61747392324
+请功受赏 12.8020653633
+自食其言 11.8212361103
+穆德吉 13.2075304714
+南子岛 12.2912397395
+渐进 9.11318590919
+种族 8.05135287203
+丁二酸酐 13.900677652
+利用系数 13.900677652
+毛鼠 13.2075304714
+轻罪重判 12.8020653633
+袁慰亭 12.8020653633
+沈雁冰 12.1089181827
+玄德再 12.1089181827
+送上来 10.3171587135
+乘火打劫 13.900677652
+翻来 11.7034530746
+臭烘烘 11.3357282945
+匀出来 13.900677652
+红旗区 12.8020653633
+卡森 13.2075304714
+瑶台 11.4157710022
+武部 13.900677652
+弱冷空气 12.8020653633
+阮家三 11.0103058941
+廉吏 13.2075304714
+德西 13.2075304714
+东红 13.900677652
+廉四世 13.900677652
+封郡 13.900677652
+迪斯科 11.1926274509
+中葡 10.9562386728
+景两帝 13.2075304714
+灵活 6.79653355899
+原文书 13.900677652
+佛湾 13.2075304714
+孙传庭 8.75901409547
+虚妄 10.2630914922
+肉丝面 13.900677652
+于内廷 11.9547675029
+趔趄 9.65218240993
+史大官人 13.900677652
+抚慰 8.82550383674
+内服 9.72629038208
+科波菲 12.1089181827
+安全网 10.9049453784
+内有 7.63347710343
+王士诚 12.5143832909
+凤姐儿 8.5440913773
+亿余两 13.900677652
+嫁衣 11.1926274509
+当然 5.20768412076
+封邑 10.1630080337
+指路 10.5684731418
+和硕襄 13.2075304714
+外项 13.900677652
+箱式装置 13.900677652
+春色 10.0505300503
+原文中 11.8212361103
+正取 13.900677652
+第二项 10.4349417492
+第二顿 12.8020653633
+王超 10.4666904475
+轩然大波 9.91169360541
+绳捆索绑 13.2075304714
+新堡 12.5143832909
+玩法 10.3743171274
+玄色衫 13.2075304714
+第二页 12.2912397395
+韩愈 9.34680076038
+观察力 10.604840786
+实习员 13.2075304714
+兔肉 10.7226238216
+中落 11.7034530746
+福禄堂 13.2075304714
+轻盈 8.94485059437
+通货膨胀 7.04632314972
+拉斯韦尔 12.2912397395
+盲流 11.7034530746
+夫权 11.5027823792
+奏议 10.533381822
+小金县 13.900677652
+靠不住 9.58318953844
+第二颗 10.9562386728
+玩水 12.8020653633
+起点站 12.2912397395
+深入研究 8.69119149913
+退避三舍 10.8096351986
+内柔 12.8020653633
+续期 10.7226238216
+未损坏 13.900677652
+春花 10.4666904475
+荆雍 12.8020653633
+换机 12.2912397395
+可用内存 13.900677652
+戈锡克 12.5143832909
+肠胃炎 12.2912397395
+一华里 13.2075304714
+苍蝇见血 13.900677652
+茧丝 11.0674643079
+素族 12.8020653633
+瑶华 13.900677652
+春节 7.54283538547
+借去 11.3357282945
+青菜萝卜 13.2075304714
+杂贷 13.2075304714
+宝钗方 12.2912397395
+原文件 13.900677652
+内柱 12.5143832909
+产床 13.900677652
+范型 12.5143832909
+换来 8.59737274392
+居民消费 7.78258045393
+初装费 13.2075304714
+德士古 12.5143832909
+硬功夫 12.2912397395
+扫地出门 11.9547675029
+奏请 8.81308131674
+王奉戴 13.2075304714
+九天仙女 13.2075304714
+一切顺利 10.6818018271
+瓜熟蒂落 10.9049453784
+迄今已 10.9049453784
+表层下 13.900677652
+官右宣 13.2075304714
+女孩儿 8.84443184663
+杨高虎 10.9562386728
+科达里 13.900677652
+六十六卷 13.900677652
+对空 9.26594866375
+卷筒 11.3357282945
+保境安 11.3357282945
+协理 9.96885201925
+签名簿 13.900677652
+春苗 12.8020653633
+全唐文 10.8561552143
+纪要 10.2371160058
+岳武穆王 13.900677652
+钢铁集团 9.66657114738
+理赔金 13.2075304714
+封信来 11.7034530746
+陆道 11.2616203224
+华传教 11.598092559
+结核病 10.1394775363
+陶瓦 13.2075304714
+接茬 11.8212361103
+灵气 10.1164880181
+卸车 11.3357282945
+封里 13.2075304714
+陶瓮 12.5143832909
+补充物 12.8020653633
+中原地区 8.7245279194
+陶瓷 7.47257237929
+含片 11.9547675029
+春茶 10.642581114
+潮间带 9.54396882529
+内景 10.642581114
+断章取义 11.8212361103
+抚恤 9.84023464143
+德行 9.28555713513
+张肯堂 12.8020653633
+别拿洋 13.900677652
+下楼去 9.63799777493
+纪行 11.4157710022
+金融风险 9.20019728618
+错别字 11.1926274509
+圣诞树 11.2616203224
+撒谎 8.9519177616
+轻石 13.900677652
+己酉 13.900677652
+春药 10.4666904475
+渐起 11.0674643079
+陶情适性 13.900677652
+怀有成 13.900677652
+鬼臼 12.5143832909
+宁王马 13.2075304714
+牛瘟 12.5143832909
+春荣 12.5143832909
+支出费用 12.1089181827
+不理 7.87723005901
+算错 12.2912397395
+泰康人寿 9.54396882529
+聂荣臻 10.1630080337
+吕骥 11.9547675029
+陆逊 9.6811699468
+高清 9.98865464655
+二元 8.78268383956
+佳旺 13.900677652
+努嘴儿 12.1089181827
+春草 11.0103058941
+轻矛 13.900677652
+尿道口 11.2616203224
+管理所 11.1926274509
+亚洲协会 13.900677652
+射鱼 12.8020653633
+单芯片 13.900677652
+松涧火 11.9547675029
+闸刀 13.900677652
+佳日 13.900677652
+春荒 11.8212361103
+封审知 12.5143832909
+似笑非笑 10.1871055853
+发麻 9.71102290995
+茄子河区 13.2075304714
+第二首 12.5143832909
+驾驶 7.23117956212
+廊道 10.8096351986
+高守中 12.8020653633
+驾驭 8.80081122415
+艳萍 10.2897597393
+高压电器 11.4157710022
+能先知 13.2075304714
+换姓 13.900677652
+去路 8.70772080109
+陆郎 13.900677652
+录相 12.8020653633
+张其昀 13.2075304714
+干尼亚 13.900677652
+荆州区 13.2075304714
+德裕 12.5143832909
+卫生局长 11.7034530746
+轻看 11.598092559
+渐趋 8.36334338496
+铸字 11.8212361103
+暴风 10.4994802703
+范围 5.19468393767
+打江山 9.77354326693
+用纸 9.46986085313
+同母 11.9547675029
+夜会 12.8020653633
+成功者 10.9049453784
+田归 13.2075304714
+仓遂兼 13.2075304714
+溢利 11.8212361103
+犬牙相错 13.900677652
+马太福音 12.8020653633
+高温 7.23754495598
+灵泉 11.9547675029
+十七八个 13.2075304714
+温和派 10.2630914922
+杨叶甲 13.2075304714
+白苏 11.9547675029
+发黑 9.14708746087
+鲁克至 12.5143832909
+千只 11.4157710022
+萨赫尔 13.2075304714
+聚歼 11.7034530746
+培训费 11.5027823792
+少年报 13.2075304714
+发黄 9.33632946051
+划行 11.598092559
+牛皮 8.73019365694
+柱状体 12.8020653633
+晶体结构 9.62401153296
+不知 4.99985604706
+立即行动 11.5027823792
+叶清望 13.2075304714
+牟聘 12.5143832909
+轻点 11.1926274509
+重力场 10.1871055853
+范兄 13.900677652
+寡食性 12.8020653633
+朱古达 12.8020653633
+用票 13.900677652
+道院 11.1280889297
+泡沫剂 13.900677652
+贾琏领 13.2075304714
+风景名胜 9.89334446674
+点心虚 12.2912397395
+乩童 13.900677652
+拜墓 13.900677652
+范公 11.8212361103
+输过来 13.900677652
+刻意模仿 13.900677652
+吕西斯 12.8020653633
+肥实 12.5143832909
+清河镇 12.5143832909
+民间文艺 11.1926274509
+建水县 12.8020653633
+王周士 12.5143832909
+严如平 10.9049453784
+深褐色 10.1630080337
+虞离沪 12.8020653633
+踢进 12.8020653633
+发饰 11.7034530746
+吊斗 13.900677652
+扭着 10.1871055853
+发饷 11.1926274509
+公共广播 13.2075304714
+西直门外 11.5027823792
+睡起 12.5143832909
+灵歌 11.9547675029
+低息贷款 11.5027823792
+洒水车 12.8020653633
+阴电 13.900677652
+数据通讯 13.900677652
+五保户 11.9547675029
+奏起 11.4157710022
+某种原因 10.4994802703
+雷有终 12.5143832909
+马烽 13.900677652
+韩朝 12.2912397395
+炼油厂 9.12155415886
+伏苓 13.900677652
+重力坝 10.4349417492
+陶王 13.2075304714
+中航 8.40350942668
+见者有份 13.900677652
+李直夫 12.5143832909
+划过 9.93038573842
+范儿 12.1089181827
+阿加索 13.2075304714
+若会 13.900677652
+演绎推理 11.0103058941
+看起 10.3171587135
+八十年代 9.5062284973
+中船 9.55687223012
+财务部 10.7226238216
+再会 10.9049453784
+卷紧 13.900677652
+吵闹声 11.1926274509
+掂掇 13.2075304714
+携眷 11.0103058941
+中苏 9.56994431169
+程婴 13.900677652
+巴里奥 13.2075304714
+叶对生 9.87532596124
+陈丽卿 13.900677652
+管理方 11.9547675029
+投资气氛 11.598092559
+回软 12.5143832909
+大减价 13.900677652
+围困战 11.9547675029
+陈丽华 13.900677652
+总舵 13.900677652
+毛驴 9.61021821083
+蓬江区 13.900677652
+王贤 11.9547675029
+素描 9.35738286971
+受托人 11.598092559
+卸装 12.1089181827
+超大型 10.2371160058
+低洼地 10.2117981979
+疲劳感 11.1926274509
+中英 9.10488710638
+耍子 9.72629038208
+内勤人员 13.900677652
+决策程序 11.3357282945
+易纲 9.98865464655
+王质 12.5143832909
+王揖唐 11.9547675029
+轻灵 11.1280889297
+娄山关 11.0103058941
+主食品 13.900677652
+华生 10.4666904475
+艾尔文 13.900677652
+先锋 7.19748953873
+复式票 13.2075304714
+划转 9.31571017331
+牛熊 9.69598503258
+先销 13.2075304714
+为时尚早 9.29550746599
+刑事法庭 12.1089181827
+孔明听 12.1089181827
+获工学 12.5143832909
+艾尔斯 12.8020653633
+高湛 13.2075304714
+不可胜计 11.3357282945
+涨成 12.1089181827
+扭矩 8.9102450652
+德辉 12.8020653633
+若依 10.765183436
+理所应当 10.765183436
+下好 12.5143832909
+纷沓 12.1089181827
+周仁回 13.2075304714
+千万千万 11.1926274509
+封阻 13.900677652
+没回 10.3453295905
+夷则 13.2075304714
+申文书 12.5143832909
+赵父 12.2912397395
+二千多名 12.8020653633
+念念不忘 9.66657114738
+作战经验 10.4994802703
+司建官 13.2075304714
+生长发育 8.47133202302
+声色货利 13.900677652
+陆陆 13.2075304714
+界面 8.74162235276
+降县 13.2075304714
+取得实效 10.4349417492
+新塘 12.1089181827
+证券日报 7.77162744192
+白脉弦 13.900677652
+二千多吨 13.2075304714
+中华人民共和国政府 10.4041700905
+成绩 6.98694030132
+苏霍姆 12.8020653633
+序号 9.53122979951
+贾政命 11.9547675029
+中药 7.54804825566
+韩晔 12.1089181827
+降压 9.62401153296
+动脉硬化 9.5062284973
+一千多遍 13.2075304714
+旖旎风光 12.1089181827
+服务类型 12.8020653633
+贤良方正 11.7034530746
+子孙后代 9.96885201925
+再也 6.46464983562
+宝钗房 12.8020653633
+伯兄 12.5143832909
+帕特罗 12.5143832909
+全国人大常委会办公厅 13.900677652
+热爱生活 11.598092559
+孔小或 13.900677652
+中国青少年发展基金会 12.5143832909
+泡沫化 9.75754292558
+无隙可乘 11.0674643079
+难以忍受 9.69598503258
+饭前洗手 13.900677652
+特性阻抗 13.900677652
+公田按 12.8020653633
+若为 10.533381822
+照明灯 10.7226238216
+视察工作 11.7034530746
+再为 10.2371160058
+若不 13.900677652
+权悉归 12.8020653633
+陆防 13.900677652
+岩屑堆 12.5143832909
+春蕊 12.5143832909
+内急 11.5027823792
+毫无原则 12.5143832909
+再三 7.70627226087
+再下 10.0720362555
+新蔡县 11.7034530746
+乌鸡汤 13.900677652
+黄守瓜 13.2075304714
+久闻 9.36807815882
+韩明 13.900677652
+久间 12.8020653633
+东京证券交易所 11.7034530746
+再以 9.21854642485
+马道婆 12.2912397395
+新加坡共和国 12.2912397395
+母海中 12.5143832909
+木谷实 13.2075304714
+内情 9.12999302751
+照相簿 13.900677652
+木卫影 13.900677652
+林和靖 12.1089181827
+口才好 12.5143832909
+电影工业 13.2075304714
+发颤 9.59661255877
+鬼蜮 11.9547675029
+常规战争 11.2616203224
+交瘁 13.900677652
+关壮缪 13.2075304714
+梁郡 12.8020653633
+幸喜 10.4349417492
+黑簇簇 13.2075304714
+封面 8.28390655431
+陶片 10.9049453784
+石榴园 13.2075304714
+农田基本 13.2075304714
+套牌车 13.2075304714
+方国瑜 12.5143832909
+产妇 9.01032852375
+若仙 13.2075304714
+皮褥子 10.8096351986
+中菲 13.900677652
+副厅级 11.9547675029
+上港集箱 13.900677652
+物资局 12.5143832909
+李文治 12.1089181827
+粥饭 13.900677652
+再交 11.9547675029
+玩死 13.900677652
+义正辞严 11.0103058941
+踢踢 11.7034530746
+燕东园 12.8020653633
+绑架者 11.8212361103
+私益 13.2075304714
+工部尚书 9.61021821083
+私盐 10.533381822
+炭化 11.7034530746
+陆隆 13.900677652
+房产网 11.8212361103
+五十六万两 13.2075304714
+耍娇 13.900677652
+盐埔 13.900677652
+李文波 12.5143832909
+发飙 10.642581114
+艳色 12.2912397395
+大败亏输 11.1926274509
+踢踏 11.0103058941
+天水市 11.1926274509
+少先队 11.0103058941
+内患 11.8212361103
+列表 8.75901409547
+久长 11.598092559
+难不倒 10.9562386728
+刑事法律 11.3357282945
+私相 11.2616203224
+切尔斯基 12.5143832909
+全神贯注 9.44633035572
+厚重感 11.7034530746
+掌心雷 11.9547675029
+卡波 12.5143832909
+滋润 8.56313957227
+中职 12.1089181827
+久隆 13.900677652
+德赫 13.900677652
+曹之计 13.2075304714
+中联 9.48183704418
+种户 13.2075304714
+鸠山 9.7898037878
+拉维亚 13.900677652
+韩敬 13.2075304714
+意见反馈 10.5684731418
+两万多 10.3453295905
+美其名 12.1089181827
+案牍劳形 13.900677652
+铅块 11.9547675029
+私生 13.900677652
+续接 12.2912397395
+发鬓 13.900677652
+私用 11.8212361103
+视觉艺术 12.2912397395
+原始积累 9.85762638414
+换掉 10.4041700905
+左部帅 13.900677652
+甘来 12.8020653633
+阿维尼翁 11.1926274509
+邗江县 12.5143832909
+甘松 11.598092559
+贱物 12.8020653633
+虚夸 11.598092559
+猛跌 11.5027823792
+德赛 9.98865464655
+西街白 12.5143832909
+捧角 13.900677652
+渐衰 10.3171587135
+中老 12.2912397395
+麦克沃特 13.900677652
+中考 10.7226238216
+甘服 13.900677652
+少年期 11.8212361103
+佛图澄 12.5143832909
+自我检讨 12.5143832909
+毛额 13.2075304714
+中耕 10.642581114
+战地钟声 13.2075304714
+卡河 10.8096351986
+王朝建都 11.9547675029
+表决制 13.2075304714
+毛领 13.2075304714
+汝等亦 12.8020653633
+破窑 11.1280889297
+鸠尾 13.2075304714
+谛听 10.3743171274
+美女用 13.900677652
+成汉 10.533381822
+久雨 12.5143832909
+磁带控制器 13.900677652
+消声 10.8096351986
+隐隐作痛 10.3453295905
+用笔 9.38981814546
+管理权 10.1630080337
+芦田 13.900677652
+轻狂 10.642581114
+解题 10.0940151622
+和娈童 13.900677652
+中耳 10.2371160058
+非法操作 13.2075304714
+德贝 11.2616203224
+硅单晶 12.2912397395
+会员证 13.900677652
+第一个 5.96939289045
+贤者 10.4666904475
+换挡 9.48183704418
+卷缠 13.900677652
+燕礼 12.8020653633
+风沙源 12.5143832909
+特大事故 11.7034530746
+泼水 10.9562386728
+轻爽 12.2912397395
+亚锡 13.900677652
+熟铜 12.1089181827
+踢走 12.8020653633
+呻唤 10.9049453784
+降值 13.900677652
+灵榇 13.900677652
+韩日 11.1280889297
+岩浆岩 9.94943393339
+引人注目 8.21370229564
+计算机操作 12.5143832909
+魏桓子 11.7034530746
+吕齐 13.900677652
+魏徵遂 12.8020653633
+地蜡 11.8212361103
+和德华 11.598092559
+邗江区 13.900677652
+中能 9.06439574502
+内援 11.0674643079
+衙署 10.1164880181
+啄米 11.5027823792
+嫂夫人 11.1926274509
+韩方 11.3357282945
+划起 12.2912397395
+划走 12.2912397395
+斑海豹 13.2075304714
+换换 9.96885201925
+中共六届六中全会 12.8020653633
+悲天悯人 11.8212361103
+革命生涯 11.4157710022
+日尔曼 10.7226238216
+原子价 12.2912397395
+柿子皮 13.2075304714
+新会 9.96885201925
+陶然 12.2912397395
+符合规范 11.9547675029
+牛王 10.4041700905
+伸腰 12.2912397395
+迪斯累 11.598092559
+白小姐 11.8212361103
+可撤回 13.900677652
+酩酊大醉 11.3357282945
+透光率 13.900677652
+中肯 10.3743171274
+铸币 8.98802276624
+卡氏 11.2616203224
+周成王 10.4041700905
+暗送秋波 12.8020653633
+范县 11.1926274509
+英商义 13.2075304714
+萧燕燕 13.2075304714
+迫击 12.2912397395
+阳散寒 12.2912397395
+副领队 13.900677652
+韩文 11.1926274509
+习中学 12.8020653633
+石堰 13.900677652
+一下子打 12.2912397395
+牛牛 12.1089181827
+十三四岁 10.8561552143
+五五数 13.2075304714
+霸占住 12.8020653633
+内托 11.2616203224
+人口比例 10.604840786
+兵器谱 13.900677652
+达契亚 12.2912397395
+福克兰岛 12.5143832909
+何休亦 13.2075304714
+神权 9.80633308975
+抚摩 9.54396882529
+牛牵 12.1089181827
+陈长文 13.2075304714
+白发红颜 13.2075304714
+近百名 10.8561552143
+封闭 7.5393751744
+深振业 10.7226238216
+内扣 13.900677652
+巴颜喀拉山 10.0294766411
+亓俊 11.9547675029
+疾声厉色 13.900677652
+轻率 9.77354326693
+绿油油 10.8096351986
+胜负 8.39941944143
+潜水夫 13.900677652
+和田海民 11.4157710022
+中腹 12.8020653633
+布勒斯 12.1089181827
+必杀 11.1280889297
+齐燕铭 13.2075304714
+素性 11.3357282945
+一下子成 11.7034530746
+人口统计 11.598092559
+长城汽车 10.4349417492
+配在 12.1089181827
+熊大人 11.9547675029
+愈来愈多 10.0720362555
+中脑 10.4349417492
+内战 7.50541605386
+布里亚 12.8020653633
+胡小胖 13.2075304714
+新名词 10.765183436
+更衣室 12.5143832909
+如皋 9.31571017331
+副班长 11.7034530746
+中脘 11.7034530746
+解馋 11.8212361103
+李怀仙 12.2912397395
+国防建设 10.0294766411
+产子 12.5143832909
+粉末涂料 13.2075304714
+世侯 12.1089181827
+卷绕 11.0103058941
+地层学 10.0294766411
+上海交通大学 9.80633308975
+威茨 11.2616203224
+德谟 12.2912397395
+交流思想 11.8212361103
+和硕豫 13.2075304714
+金桂笑 12.8020653633
+肋条 11.598092559
+帕伦克 13.2075304714
+额木尔 12.5143832909
+赵启霖 11.8212361103
+取暖费 11.5027823792
+联合演习 12.1089181827
+擢发难数 13.900677652
+动量矩 11.9547675029
+因购买 13.900677652
+消夏 10.9562386728
+人身保护 12.8020653633
+先降 12.8020653633
+吴清源 12.8020653633
+阿赫默 13.2075304714
+解饱 13.900677652
+换房 10.604840786
+测音器 13.900677652
+射频 9.96885201925
+施琅 12.5143832909
+召来 9.74179456862
+浦归帆 13.900677652
+直接税 12.1089181827
+羽绒服装 13.2075304714
+肩摩踵接 13.900677652
+同年龄组 13.2075304714
+消失 6.22327722146
+呻吟 8.39941944143
+佝偻 9.4233408375
+栅子 13.900677652
+谢香斋 11.8212361103
+换成 8.07763175649
+全株含 12.2912397395
+恶性竞争 10.4666904475
+封锁 8.07763175649
+吕鸿 12.8020653633
+灵棚 11.4157710022
+发髻 9.31571017331
+张志民 11.2616203224
+吊放 11.598092559
+有利措施 13.900677652
+另有所指 13.900677652
+牛犁 11.7034530746
+荣国公 12.1089181827
+撤职查办 11.8212361103
+侯潮 12.5143832909
+牛犊 10.4041700905
+一下子把 9.7898037878
+旧庄 13.900677652
+计算尺 12.2912397395
+二二 13.2075304714
+幕后英雄 13.900677652
+却又静 12.8020653633
+汗脚 13.900677652
+中国人民解放军 7.78038023302
+佛殿 10.3453295905
+埃加迪 13.2075304714
+换手 9.0884932966
+折变 10.6818018271
+马后炮 11.1926274509
+静下去 13.900677652
+卡洛 11.4157710022
+战略区 11.2616203224
+闻风而动 10.533381822
+李氏家族 13.2075304714
+店堂 10.3453295905
+沃格尔 13.2075304714
+加快 5.83227469341
+轻油 11.5027823792
+再循环 11.8212361103
+金宝善 13.2075304714
+李继筠 13.2075304714
+先觉 13.2075304714
+器质性 9.87532596124
+簧管 12.2912397395
+去除 8.84443184663
+毛蛋 10.6818018271
+发蔫 12.8020653633
+先见 10.1394775363
+吕臣 12.8020653633
+梁赞 11.7034530746
+廉丹 12.2912397395
+公司化 11.598092559
+邕江 11.4157710022
+窦道 11.2616203224
+马哈蒂 13.900677652
+勾子 11.8212361103
+点心 8.19689517732
+降于 10.9049453784
+强烈反应 11.0674643079
+一会儿摊 13.2075304714
+私欲 11.0674643079
+棕榈油 9.19114745066
+西海郡 11.5027823792
+齐人著 13.900677652
+贱民 9.98865464655
+惯用语 13.900677652
+第二艘 11.1926274509
+一千多公里 13.900677652
+翻晒 13.2075304714
+彭四保 12.8020653633
+刘度 13.2075304714
+九鲤湖 12.8020653633
+牛洞 13.2075304714
+傅抱石 11.9547675029
+肥肠 13.900677652
+两口儿 10.4666904475
+降价 8.12302532875
+加德 12.5143832909
+种籽 10.9562386728
+先要 9.00283785202
+管叔鲜 12.8020653633
+种类 6.0366419929
+钓丝 12.1089181827
+加征 10.0505300503
+伤亡惨重 9.91169360541
+毛蚶 12.1089181827
+毛蚴 11.9547675029
+中国气象局 11.8212361103
+宿主机 13.900677652
+素缎 12.8020653633
+陶澍 12.5143832909
+扭歪 11.3357282945
+宋所赐 12.8020653633
+佳绩 10.3453295905
+翟廷玉 12.8020653633
+力学 7.56031834825
+牛津 9.40086798165
+核心 5.85252855031
+胡胡 13.2075304714
+会议员 12.2912397395
+迫使 6.98297204214
+隋平陈 13.2075304714
+点得 11.8212361103
+渐降 10.8096351986
+中黄 13.900677652
+炒家 10.2371160058
+监考人 13.900677652
+沃格岛 13.900677652
+丰塞卡 12.5143832909
+豁子 13.900677652
+种粮 10.4349417492
+用时 10.1630080337
+精彩绝伦 12.5143832909
+妥洽 13.900677652
+降临 8.39941944143
+库券 11.1926274509
+中共十五大 13.900677652
+盗车贼 12.5143832909
+卡特 9.65218240993
+第二节 9.65218240993
+考勤钟 13.900677652
+发薪 12.5143832909
+西康省 11.5027823792
+题字 10.765183436
+传统模式 11.4157710022
+明世宗 10.5684731418
+卡片 10.0088573539
+轻气 13.900677652
+属地 8.9519177616
+胜利渠 11.5027823792
+康泰著 12.8020653633
+毛虾 10.8561552143
+降下 9.93038573842
+购自 11.8212361103
+拉大旗 13.2075304714
+太乙散 12.8020653633
+降世 11.4157710022
+再发 10.3743171274
+去雄 13.2075304714
+毛虫 10.4994802703
+量才施用 13.900677652
+村舍 10.2117981979
+港人 11.9547675029
+迫促 13.900677652
+卡马西平 12.8020653633
+周良霄 10.5684731418
+元金统 13.2075304714
+张缙彦 11.4157710022
+不安分 10.3743171274
+雷瑟 13.900677652
+谢尔 10.8096351986
+下陆区 13.2075304714
+加强 5.35840168019
+苏瓦松 12.8020653633
+种系 11.5027823792
+寿光县 12.2912397395
+加开 12.5143832909
+用料 9.62401153296
+点式 12.2912397395
+点开 11.1926274509
+别守 13.900677652
+六星级 12.5143832909
+廉价 8.33233314821
+鬼灵精 12.2912397395
+李怀光 12.2912397395
+变奏曲式 12.8020653633
+温莱特 12.8020653633
+令人焦虑 13.900677652
+空手道 11.2616203224
+池州 10.9049453784
+管理科 11.8212361103
+刘采云 11.1280889297
+公司制 11.4157710022
+神话学家 13.2075304714
+从业者 9.96885201925
+板着脸 9.7898037878
+趁热打铁 10.7226238216
+再剪 13.900677652
+时淮西 12.8020653633
+衣起立 13.2075304714
+以身相许 12.5143832909
+佳美 12.1089181827
+主河道 11.8212361103
+活神仙 11.3357282945
+商汤攻 12.8020653633
+四十三年 9.96885201925
+亲交 13.900677652
+前后脚 11.5027823792
+小铁锤 12.8020653633
+曹变蚊 12.8020653633
+毛蟹 11.9547675029
+偏重于 9.89334446674
+耷拉 9.20932976975
+操纵者 12.1089181827
+封诰 12.5143832909
+日本料理 11.8212361103
+库兹涅佐夫 11.0103058941
+王树森 13.2075304714
+购者 12.8020653633
+加座 13.900677652
+牛气 10.4666904475
+戚戚然 12.8020653633
+一英寸 12.2912397395
+卡环 13.900677652
+春饼 12.2912397395
+再到 8.092535162
+一百只 11.7034530746
+穹苍 12.5143832909
+牛氏 11.9547675029
+份子 11.1280889297
+再分 10.8096351986
+狂欢 9.13850371718
+复兴 7.78921031247
+一缕缕 10.4041700905
+董老 13.900677652
+陈泰引 12.5143832909
+希望 5.20533827518
+晋爵魏 13.2075304714
+回转半径 13.2075304714
+卡玛 11.8212361103
+武器精良 13.2075304714
+再则 10.2371160058
+再创 8.39534611604
+彭宾 12.1089181827
+素绢 11.7034530746
+日落时分 12.8020653633
+合法性 9.13850371718
+开工日期 11.1926274509
+能传送 12.5143832909
+轻活 11.7034530746
+鬼鬼 12.1089181827
+迫于 8.99540287354
+北魏道 12.5143832909
+血泪斑斑 12.2912397395
+小么儿 13.2075304714
+先行 7.46613113319
+池岸 12.8020653633
+七十家 13.2075304714
+寻点儿 13.2075304714
+秦明怒 12.5143832909
+发蒙 11.4157710022
+聚焦 8.2985588311
+金銮殿 10.0088573539
+媒染剂 11.9547675029
+玄德来 12.5143832909
+小厨房 11.5027823792
+春香 11.5027823792
+泽特贝尔 13.2075304714
+樽俎 12.8020653633
+立炀帝 12.5143832909
+忸怩 10.7226238216
+楝树 12.2912397395
+再加 8.85725253506
+败军之将 11.8212361103
+经检测 11.8212361103
+天昏地黑 12.8020653633
+斜射 11.2616203224
+马西尼 13.2075304714
+运载工具 10.2371160058
+切菜刀 11.5027823792
+隋场帝 12.8020653633
+高地价 11.1280889297
+多媒体计算机 11.8212361103
+负债表 9.02548032877
+陈富忠 8.44963919841
+鬼魔 12.8020653633
+迫令 10.604840786
+瓦西里 11.0674643079
+牛油 10.8561552143
+降低 5.64614877004
+发蓝 11.0103058941
+鬼魅 10.2117981979
+鬼魂 9.13850371718
+巩珍著 12.8020653633
+定乾坤 12.5143832909
+柳林坡 13.2075304714
+玩着 11.4157710022
+腹结 13.900677652
+再办 11.1280889297
+风吹草动 9.36807815882
+何良策 11.1926274509
+石膏线 13.900677652
+着落 9.28555713513
+再入 9.65218240993
+封装 10.1394775363
+加工 6.01384465302
+职业道德 9.7898037878
+由统军 13.2075304714
+定西地区 12.8020653633
+卸除 12.1089181827
+发蜡 11.0674643079
+电视直播 13.2075304714
+加巴 13.2075304714
+电子系统 9.85762638414
+内网 12.1089181827
+若兰 10.8561552143
+遇水架桥 13.2075304714
+用来 6.30378321383
+拉瓦尔 11.0103058941
+大坝 9.01787572939
+游来游去 11.5027823792
+应收款 9.82314020807
+露地 11.5027823792
+瑞利 10.3743171274
+力夺 13.2075304714
+用材 9.20932976975
+若允 13.2075304714
+先请 10.2371160058
+先说 9.09665660724
+卸磨杀驴 12.2912397395
+忍耐 8.39941944143
+明经略 13.900677652
+用权 12.1089181827
+力天 13.2075304714
+加州 8.94485059437
+养老保险金 12.2912397395
+苏峻祖 13.2075304714
+踢下来 13.2075304714
+叶天士 11.598092559
+市场导向 12.2912397395
+无线电视 13.900677652
+悄然 8.17382990439
+柱状图 13.2075304714
+美宣王 13.900677652
+范伟 11.9547675029
+内缘 11.1926274509
+于北庭 13.2075304714
+欺行霸市 11.8212361103
+无关紧要 9.59661255877
+速度慢 9.87532596124
+管理水平 8.7245279194
+先讲 11.598092559
+玄德引 11.0674643079
+船篷 10.8561552143
+左邻右舍 9.87532596124
+先讨 12.5143832909
+先让 9.55687223012
+评论集 11.0103058941
+太不容易 12.1089181827
+月洞门 11.0674643079
+邸钡囊 13.2075304714
+臆断 12.2912397395
+肋窝 11.7034530746
+宋高宗 9.59661255877
+特寻芳 13.900677652
+章动 11.0103058941
+周武帝 10.1394775363
+虐待老人 13.900677652
+枫港 13.2075304714
+收帆 13.900677652
+鹿姓兆 13.900677652
+免疫增强 13.2075304714
+续编 10.0294766411
+握手道别 13.900677652
+小神通 13.900677652
+吴镇军 12.8020653633
+惧内 11.9547675029
+再出 10.1164880181
+分析阶段 12.1089181827
+赵景深 12.8020653633
+能量色散 12.8020653633
+不敢越雷池一步 11.9547675029
+德里 9.08039608637
+碰击声 11.1280889297
+西道诸 12.2912397395
+规章制度 9.36807815882
+作品选 11.7034530746
+德金 13.2075304714
+玩球 12.8020653633
+超短 10.9562386728
+辅导书 13.900677652
+原子力 12.5143832909
+范例 9.59661255877
+拇指 9.07236391467
+中鲁 12.5143832909
+阴阳师 12.8020653633
+咖啡园 12.1089181827
+谜一样 12.1089181827
+咖啡因 10.3743171274
+凄苦 10.2897597393
+赫坎 13.2075304714
+山德里娜 13.900677652
+职工食堂 11.7034530746
+第二胎 11.9547675029
+悬置 12.2912397395
+题外 12.2912397395
+肥源 12.2912397395
+庵堂 11.3357282945
+劈劈啪啪 11.4157710022
+二千三百九十一条 13.2075304714
+克吕兹 12.2912397395
+吸毒者 11.598092559
+哈尔斯克 13.2075304714
+醍醐 11.4157710022
+韩福 12.8020653633
+海南省政府 11.598092559
+运营部 12.5143832909
+同心毕力 13.900677652
+捞摸 13.2075304714
+盆中 10.4349417492
+吕范 11.0103058941
+圆滚滚 11.0674643079
+换约 12.1089181827
+公开招标 11.7034530746
+海民哥 13.2075304714
+奸商 10.604840786
+题壁 11.8212361103
+公司债 7.31175117444
+殷周 10.642581114
+洛劳斯 13.900677652
+陆行 12.8020653633
+寇准力 12.8020653633
+荆轲 11.5027823792
+续约 10.1871055853
+毛藻 11.8212361103
+纪遗 13.2075304714
+代立拉 11.598092559
+范书 12.2912397395
+斯塔西娅 13.900677652
+绩效 8.65893063692
+原子化 12.1089181827
+体育网 13.900677652
+耐湿性 13.2075304714
+陆表 12.5143832909
+朱衡听 12.2912397395
+冶金焦 11.2616203224
+巴勒斯坦民族权力机构 12.8020653633
+沃姆斯 13.2075304714
+年增率 13.2075304714
+白考 13.2075304714
+无穷小 10.8561552143
+修于清 12.8020653633
+神差鬼使 11.9547675029
+柔肠百转 13.900677652
+店子 11.0674643079
+晁家庄 12.5143832909
+高潮 7.60541165054
+伤风败俗 11.1280889297
+货币制度 10.0294766411
+一九二八年 12.8020653633
+处女作 10.0720362555
+弗里斯兰 12.2912397395
+发虚 10.765183436
+斜度 11.598092559
+突击队员 10.533381822
+拉维叶 13.2075304714
+无穷尽 11.4157710022
+种群 9.0884932966
+内经 9.93038573842
+骂是爱 12.5143832909
+七一五 11.7034530746
+粗浅 10.765183436
+远东国家 13.900677652
+大致 6.57421203814
+属名 12.5143832909
+属吏 10.4349417492
+列队 9.77354326693
+呼玛尔 13.900677652
+以一儆百 12.8020653633
+规画 12.8020653633
+葛不律 12.1089181827
+配套化 13.900677652
+巴里坤湖 11.1926274509
+不费吹灰之力 10.642581114
+店家 9.63799777493
+列阵 9.96885201925
+几百万名 13.900677652
+卷成 10.765183436
+本署 12.8020653633
+灵璧 11.1926274509
+属员 11.1280889297
+横加阻拦 13.900677652
+章武 10.604840786
+侦查局 12.8020653633
+五星 9.29550746599
+石膏粉 12.8020653633
+卷扬 12.2912397395
+东德人 13.900677652
+德城区 13.900677652
+华立 11.9547675029
+解蔽 11.9547675029
+马蹄寺 12.5143832909
+范云 12.8020653633
+加尾 13.2075304714
+有毒气体 10.6818018271
+加尼 10.9562386728
+拔毛 11.8212361103
+加封 9.58318953844
+但润生 13.2075304714
+赵州桥 10.8561552143
+范亭 12.8020653633
+卸鞍 11.3357282945
+液化气罐 11.598092559
+压花 12.1089181827
+四十三岁 12.5143832909
+点将 10.0720362555
+中心主义 11.5027823792
+内线 9.75754292558
+管理站 11.598092559
+加尔 9.72629038208
+法苑珠 12.8020653633
+力士 9.07236391467
+李太常 13.2075304714
+宫泽喜一 12.5143832909
+样品费 13.900677652
+张安 13.2075304714
+先跑 10.9562386728
+雨山 13.2075304714
+产品认证 12.1089181827
+宝钗笑 9.62401153296
+不加考虑 12.2912397395
+主教团 13.2075304714
+党首 13.900677652
+加对 13.2075304714
+归结到 10.9049453784
+王迦 12.8020653633
+甘蓝菜 12.8020653633
+加密 9.74179456862
+中马 12.1089181827
+勾当 8.00627481771
+万岁千秋 13.900677652
+赛门铁克 12.5143832909
+卡盒 13.900677652
+李文田 13.900677652
+滤色片 12.8020653633
+灵猫 9.75754292558
+长方脸 11.7034530746
+行贿罪 10.8096351986
+卡盘 13.2075304714
+佛灯 12.8020653633
+曹侍郎 13.2075304714
+军费开支 10.4041700905
+大受欢迎 10.765183436
+糖化酶 13.900677652
+园洲 13.2075304714
+滑翔机 10.4041700905
+章泯 12.5143832909
+海舶 11.4157710022
+加害 10.1871055853
+服务提供商 10.4666904475
+总能 8.85725253506
+竺法护 12.2912397395
+纪思道 12.8020653633
+素笺 11.598092559
+续租 13.2075304714
+掌上观文 13.900677652
+孤军深入 10.8561552143
+加宽 9.56994431169
+自取其咎 12.8020653633
+几百万吨 12.5143832909
+背起 9.61021821083
+媾和案 12.2912397395
+加守 12.2912397395
+勾引 9.09665660724
+加完 12.8020653633
+自行其事 12.5143832909
+直到现在 8.56795885871
+事业心 10.2630914922
+高沙 11.9547675029
+大涌谷 13.900677652
+用意 8.40761620864
+章法 9.5186510173
+作品集 10.8096351986
+皮埃蒙特 12.5143832909
+亚松森 11.1280889297
+高沟 13.2075304714
+陆运 10.0940151622
+连续性 7.62780064543
+伏两军 12.5143832909
+流氓气 13.900677652
+秦明放 13.900677652
+小鹿儿 13.900677652
+内秀 12.2912397395
+热膨胀 10.533381822
+精梳棉 13.900677652
+奉天省 11.4157710022
+谈兴 11.8212361103
+鸦雀无声 9.32596667347
+津贴 9.34680076038
+卡登 13.2075304714
+谈兵 10.8096351986
+内科 9.35738286971
+中高 10.1164880181
+题录 12.2912397395
+萨斯迦 11.8212361103
+毛色 9.22784881751
+淡青色 11.3357282945
+架去 13.900677652
+育龄妇女 11.598092559
+打食 13.900677652
+狩猎场 10.9562386728
+灵玺 13.900677652
+格雷布纳 12.5143832909
+性交痛 12.8020653633
+章氏 11.9547675029
+牛槽 11.7034530746
+安琪儿 12.8020653633
+多次派 11.598092559
+城建局 11.7034530746
+草人 11.7034530746
+幼驹 13.900677652
+点子 8.75318317516
+邓演达 11.0674643079
+拳棒 11.598092559
+边疆区 11.2616203224
+始于足下 13.900677652
+贵池县 12.5143832909
+发至 11.2616203224
+折旧费 11.1280889297
+北京奥运 11.2616203224
+料豆 13.900677652
+玩物 10.1871055853
+抛物线 9.7898037878
+卷数 11.7034530746
+发叶 12.8020653633
+韦尔 10.1394775363
+发自 8.90346537821
+发臭 10.4994802703
+折叶 13.900677652
+车师前 11.2616203224
+调频台 13.900677652
+海晏河清 12.2912397395
+何心隐 8.49350588052
+改收 13.2075304714
+李太太 11.0674643079
+隆贵远 12.8020653633
+普恩加莱 12.2912397395
+袭爵 10.8561552143
+牛马不如 13.2075304714
+横刀夺爱 12.2912397395
+韩美 13.2075304714
+解舒 12.1089181827
+灵珠 12.8020653633
+先贤 10.7226238216
+子寻爷 12.2912397395
+枝节问题 11.7034530746
+积年累月 12.5143832909
+报恩寺 11.7034530746
+中魁 13.900677652
+完井法 13.900677652
+梁行 11.5027823792
+格玛 10.1394775363
+玩玩 9.46986085313
+掏腰包 11.1926274509
+王传志 10.1871055853
+荆襄 10.0505300503
+力帆 9.34680076038
+腹稿 10.9049453784
+修理起来 13.900677652
+水成土 12.5143832909
+毛菌 13.2075304714
+律历志 11.8212361103
+仪表堂堂 10.6818018271
+白孝布 13.2075304714
+相辅而行 11.598092559
+麻扎塔 12.8020653633
+亿余元 10.765183436
+深夜 7.94225295895
+跳井自杀 13.2075304714
+满含热泪 12.8020653633
+王箭法 13.900677652
+络腮胡子 9.7898037878
+艾尔米 11.9547675029
+换碟 13.2075304714
+两条腿走 10.9049453784
+酶制剂 11.2616203224
+新竹人 13.900677652
+地鳖 13.2075304714
+宿根 10.642581114
+宣王中 13.2075304714
+波浪发电 12.8020653633
+杜宏域 12.8020653633
+明枪易躲 12.5143832909
+殷制 12.2912397395
+口谈 13.900677652
+德阳 10.3453295905
+科教部 13.900677652
+电吉他 13.2075304714
+不正经 11.0103058941
+题库 11.9547675029
+弄清情况 12.5143832909
+紧贴住 12.5143832909
+牛栏 11.1926274509
+咖啡具 13.900677652
+赵子曰 13.2075304714
+五女山 13.2075304714
+殷切 10.1394775363
+警卫员 9.36807815882
+能言善 13.2075304714
+瓦西镇 13.2075304714
+吕蒙 9.87532596124
+久跪 12.8020653633
+罗德尼 13.900677652
+仪表非凡 12.5143832909
+高层住宅 11.2616203224
+八达 10.533381822
+西尔金 13.2075304714
+王骥德 11.7034530746
+赵玉 13.2075304714
+池塘 8.76487921493
+王远 11.8212361103
+宋开宝 11.598092559
+蔼然 11.5027823792
+斜塔 12.8020653633
+发育 6.32714638923
+圣胡安河 13.900677652
+胡宗南 10.3453295905
+牛棚 10.0294766411
+神经系统 8.28390655431
+若因 11.5027823792
+发肿 12.8020653633
+德雷 12.2912397395
+不白 10.6818018271
+吴军遂 13.2075304714
+发肤 12.8020653633
+种禽 11.7034530746
+毛草 12.8020653633
+血流如注 11.1280889297
+灵犀 12.5143832909
+近百人 10.9049453784
+文洛克 13.900677652
+谋篇 13.900677652
+农民起义 8.0746775446
+伏乾归 12.2912397395
+古印加 13.900677652
+趣味性 10.8561552143
+实证法 13.2075304714
+赵子昂 12.8020653633
+玄德往 13.2075304714
+狱政 13.900677652
+杜袭引 13.900677652
+集合点 13.900677652
+力度 6.06985465684
+勿庸置疑 12.5143832909
+难胞 13.900677652
+曹溪寺 13.2075304714
+再回 9.28555713513
+用情 11.4157710022
+磨来磨去 13.2075304714
+向金朝 12.2912397395
+着者 13.900677652
+毛茛 11.1926274509
+药物学 10.7226238216
+和崇仁 13.900677652
+帽边 13.900677652
+罗德岛 11.8212361103
+一千余匹 13.2075304714
+老光棍 12.2912397395
+先谈 10.8096351986
+陈国灿 11.9547675029
+言唐僧 13.2075304714
+呖呖 12.2912397395
+管理系 12.1089181827
+二十遍 12.2912397395
+美国防部 11.5027823792
+韩红 12.1089181827
+重力仪 11.598092559
+石少华 13.2075304714
+满怀信心 10.8096351986
+德隆 11.8212361103
+池壁 12.5143832909
+格罗德诺 12.8020653633
+安得拉邦 11.8212361103
+啄木 11.8212361103
+发胖 9.65218240993
+种种 6.52479550376
+赵宏博 13.2075304714
+胃肠道 9.41204128224
+风疹块 13.900677652
+水肿病 12.8020653633
+发胀 10.3453295905
+穗状花序 9.94943393339
+谋算 10.8096351986
+党项 9.20932976975
+同工酶 11.5027823792
+坎帕拉 11.4157710022
+射线照片 12.5143832909
+范志红 11.4157710022
+马路边 10.3743171274
+一支花 13.2075304714
+章溢 13.900677652
+先进 6.26247940769
+王建民 12.2912397395
+灯光灿烂 13.2075304714
+沙捞越州 13.900677652
+卡瓦 11.5027823792
+稀缺性 9.94943393339
+地龙 10.8096351986
+生老病死 10.8096351986
+战略决策 10.1394775363
+王半仙 12.8020653633
+先过 11.1926274509
+种稻 10.765183436
+马向东 13.900677652
+放射出来 12.1089181827
+殷兄 13.2075304714
+鹏程 12.1089181827
+清凌凌 12.8020653633
+打扰到 13.2075304714
+隋代杨 13.2075304714
+玄宗改 12.8020653633
+资料卡 13.900677652
+渐退 10.5684731418
+换算 9.18217878068
+牛步 12.8020653633
+杨家传 13.2075304714
+宿歇 10.8561552143
+客货船 13.2075304714
+私活 12.5143832909
+续篇 11.3357282945
+拉下脸 11.7034530746
+浙赣线 10.9049453784
+四十三天 12.8020653633
+玄宗敕 13.2075304714
+毛肚 13.2075304714
+下个世纪 11.4157710022
+达吉雅娜 13.900677652
+一小部分 8.73589167805
+蹒跚而行 12.2912397395
+先辈 10.4349417492
+苯酚 9.85762638414
+许慎注 13.2075304714
+舍本求末 13.2075304714
+山不容 12.8020653633
+无穷大 10.8096351986
+佛爷 9.93038573842
+陶榆 13.2075304714
+卷柏 11.3357282945
+江津市 12.5143832909
+曝露 12.2912397395
+陆贽 11.5027823792
+去逝 12.8020653633
+池子 10.2630914922
+李太宰 12.8020653633
+价位 8.089536659
+安于心 13.900677652
+公孙之子 12.8020653633
+苯醌 11.9547675029
+纪闻 11.3357282945
+牛毛 11.2616203224
+内篇 10.7226238216
+中风 9.37888907493
+村落 8.26232298264
+保留节目 12.8020653633
+点好 11.2616203224
+厚此薄彼 11.1926274509
+容量瓶 13.900677652
+头版新闻 13.2075304714
+加好 12.5143832909
+辉砷镍矿 13.900677652
+骨膜炎 12.8020653633
+类物质 10.4994802703
+养兵 10.604840786
+解职 9.6811699468
+五枢 13.2075304714
+泪眼汪汪 11.9547675029
+社会转型 11.7034530746
+好男儿 11.598092559
+解聚 11.8212361103
+地鼠 11.1280889297
+解聘 10.9562386728
+加套 13.900677652
+言辞恳切 12.5143832909
+引以为荣 12.2912397395
+滋生 8.78868986362
+耗费 7.93967231235
+陆路 8.51618258919
+无待蓍龟 13.900677652
+卷来 12.2912397395
+耗资 8.70772080109
+甘美 10.765183436
+加大 5.85862124192
+原子团 10.9049453784
+哼唱 11.1926274509
+将作 10.9049453784
+麻叶 12.1089181827
+造谣中伤 12.8020653633
+党魁 10.7226238216
+类物资 13.2075304714
+私淑 12.1089181827
+哼唧 11.9547675029
+玩火 11.598092559
+连破洪 13.2075304714
+中频 10.4041700905
+铁栅门 13.900677652
+霍城县 11.5027823792
+银赛富 12.1089181827
+点头 6.40402521381
+最强音 11.9547675029
+保正承 13.2075304714
+露台 10.4041700905
+弄得好 11.598092559
+公学堂 13.900677652
+发菜 10.6818018271
+乌兰察布 12.8020653633
+三四百 9.94943393339
+恋爱观 13.2075304714
+用掉 10.2897597393
+卷材 13.2075304714
+加多 11.4157710022
+撒野 10.3171587135
+续签 11.8212361103
+殷军 13.2075304714
+簌簌 9.45802639549
+政权机构 10.2117981979
+望东门 13.2075304714
+王小虎 13.900677652
+发船 13.2075304714
+十一二岁 11.2616203224
+僵卧 12.1089181827
+房书办 12.8020653633
+刘盈 12.5143832909
+生擒活捉 11.1926274509
+贝龙根 11.8212361103
+哼哧 12.8020653633
+孔明乃 11.0103058941
+杭老二 12.8020653633
+良久方 12.1089181827
+臆想 11.2616203224
+少顷 9.5062284973
+中饭 11.1280889297
+民间团体 11.0674643079
+封路 11.1280889297
+汕头大学 12.5143832909
+宋渔父 13.900677652
+中饱 13.2075304714
+吕刚 13.900677652
+末大必折 13.900677652
+黄汲清 12.8020653633
+井牧其 12.8020653633
+刘丽川 12.8020653633
+属僚 12.5143832909
+封超 13.2075304714
+用房 9.89334446674
+根本大法 12.2912397395
+张掖地区 13.2075304714
+封越 11.8212361103
+用户 6.82233607242
+焙烧炉 13.2075304714
+夏克达 13.2075304714
+久违 9.27570483869
+久远 9.01787572939
+达美航空公司 13.900677652
+回形针 13.900677652
+全球性 7.96578345636
+地黄 11.1280889297
+痴心汉 12.8020653633
+查良镛 13.900677652
+貂皮大衣 13.2075304714
+固安 11.4157710022
+努力争取 10.9562386728
+排水管道 11.3357282945
+张松江 13.2075304714
+灵灵 10.0294766411
+国师宗 12.8020653633
+检拾 13.900677652
+养兔 12.1089181827
+保护圈 13.2075304714
+昼夜不息 12.5143832909
+主甲板 12.8020653633
+陆谦 11.1926274509
+小时工 13.2075304714
+阴阳家 10.8096351986
+六周年 12.8020653633
+加增 12.1089181827
+发花 10.9049453784
+大众文学 12.2912397395
+掌一扬 13.900677652
+复式房 13.2075304714
+总吨位 10.4666904475
+子女教育 11.0103058941
+贝鲁姆 12.1089181827
+哈杰泰 13.2075304714
+发芽 9.03314320152
+智囊团 11.3357282945
+封赏 9.89334446674
+齐州历 12.5143832909
+封赐 11.0674643079
+少年组 12.5143832909
+桅座 13.900677652
+青云路 13.900677652
+甘结 12.1089181827
+欢聚一堂 11.598092559
+周藤吉 13.2075304714
+封赠 11.1280889297
+谋私 12.8020653633
+会议厅 10.1871055853
+黑素细胞 12.2912397395
+统治权 9.24671730182
+颞叶 11.4157710022
+咖啡厅 10.8096351986
+着色 9.49395840471
+希普 12.8020653633
+佛珠 9.38981814546
+赫维茨 12.8020653633
+方向盘 8.63281949291
+抗日救亡 9.98865464655
+土司官寨 11.1926274509
+人本主义 10.8561552143
+加塞 13.900677652
+大团圆 11.0103058941
+德钦 11.5027823792
+致贺 11.7034530746
+主计处 11.9547675029
+蒙崇祯 13.2075304714
+王道乐土 13.2075304714
+权之争 10.8096351986
+纳形炼 12.5143832909
+多汗症 13.900677652
+李健吾 12.5143832909
+纶音佛语 13.900677652
+时机未到 11.1926274509
+沉着应战 11.8212361103
+私法 10.9562386728
+电位移 11.7034530746
+营口县 12.1089181827
+解脱 8.21709788464
+二十峰 13.2075304714
+封贡 11.7034530746
+哼哼 9.15574552361
+毛脸 10.7226238216
+料车 13.900677652
+恶性膨胀 11.3357282945
+贝岛 13.900677652
+夜半更深 12.5143832909
+无线电厂 12.5143832909
+解放组织 13.2075304714
+张钟俊 12.5143832909
+黄集伟 13.2075304714
+再学 11.5027823792
+分文不取 12.2912397395
+发贴 13.2075304714
+过少安 12.5143832909
+洗着 11.0103058941
+十捉九着 13.900677652
+不良分子 13.2075304714
+正是如此 9.80633308975
+十四打 13.900677652
+发财 8.78268383956
+九十八万两 13.900677652
+发货 10.1871055853
+韧皮 13.2075304714
+消了 10.0294766411
+兽药 10.5684731418
+钢条 12.2912397395
+玄宗欲 12.8020653633
+传毒 13.900677652
+孙大哥 13.2075304714
+雷声大雨 11.0103058941
+个别人 9.96885201925
+种球 12.8020653633
+中院 9.5186510173
+婉辞 12.5143832909
+菖蒲 10.8096351986
+和荷尔 13.2075304714
+年长者 11.5027823792
+李家沟 13.900677652
+通铺 11.3357282945
+宿敌 12.1089181827
+若存 13.2075304714
+金波妈 12.8020653633
+文化遗产 9.19114745066
+消亡 8.90346537821
+题号 13.900677652
+用活 11.8212361103
+尚宝司 11.8212361103
+正义性 11.4157710022
+温福 12.8020653633
+发起 6.74372128736
+加垫 13.2075304714
+扭捏 10.604840786
+情急之下 10.3743171274
+毛躁 10.9562386728
+送报童 13.900677652
+轻擦 13.900677652
+劳什子 10.2630914922
+冯翊夏 13.2075304714
+中队 7.66430806177
+两万余 10.4994802703
+司局级 11.5027823792
+清沿明 11.9547675029
+地里 7.65263477747
+蝼蚁尚且 12.2912397395
+咖啡屋 12.5143832909
+炒卖 10.6818018271
+日本天皇 10.765183436
+中阮 13.2075304714
+苏三国 11.9547675029
+胭脂红 11.3357282945
+天鹅肉 12.5143832909
+中医理论 11.2616203224
+先天下之忧而忧 12.5143832909
+殷弓 10.7226238216
+中阳 8.42421410004
+穆公虎 11.8212361103
+帽舌 13.900677652
+殷忧 11.4157710022
+中集 11.0674643079
+架卡 11.7034530746
+找岔子 12.5143832909
+布里奇 11.0674643079
+换用 11.3357282945
+王鼎一 11.9547675029
+聚砜 12.5143832909
+行商坐贾 12.5143832909
+脾胃论 12.8020653633
+经不起 9.02548032877
+车师常 13.2075304714
+很狡猾 12.1089181827
+内痔 12.8020653633
+阿连德 11.7034530746
+想不出 8.62256299275
+再寄 12.8020653633
+钢板 8.9102450652
+阿特拉斯 10.533381822
+溶解度 9.12999302751
+布里奥 12.1089181827
+非法手段 11.2616203224
+中雨 12.1089181827
+党锢 10.9562386728
+中雪 11.2616203224
+德比郡 12.8020653633
+怨敌 12.8020653633
+朝鲜民主主义人民共和国政府 13.900677652
+九十袋 13.2075304714
+石膏矿 11.1280889297
+颜色适应 13.900677652
+功莫大焉 12.8020653633
+牟钜 13.900677652
+再审 10.1630080337
+丝瓜藤 13.900677652
+射过 12.1089181827
+加在 9.77354326693
+不定冠词 13.900677652
+封梁王 12.5143832909
+中隔 11.2616203224
+绩溪 11.598092559
+射进 10.4666904475
+内疚 9.32596667347
+累死累活 11.8212361103
+陆莉 12.8020653633
+个人冠军 13.2075304714
+内格罗河 12.1089181827
+忍辱含羞 12.2912397395
+弦弓 13.2075304714
+王十朋 13.2075304714
+五笔划 13.900677652
+封航 12.1089181827
+若不然 11.7034530746
+滴滴涕 11.3357282945
+红血球 11.1280889297
+观念更新 12.8020653633
+题匾 11.9547675029
+茧层 11.598092559
+种瓜 11.4157710022
+韩玄 11.8212361103
+物权法 9.89334446674
+再定 10.5684731418
+狠狠心 11.4157710022
+炒制 11.598092559
+骨架子 13.2075304714
+氢离子 10.2630914922
+岗位津贴 13.2075304714
+八五年 12.8020653633
+刘盛佳 10.3743171274
+立时三刻 12.8020653633
+麝香 9.23723855786
+女上司 13.900677652
+极大值 10.604840786
+林少猫 13.2075304714
+种田 9.72629038208
+辽宁抚顺 11.9547675029
+加固 8.69119149913
+中非 9.22784881751
+明清两代 9.5062284973
+中介方 12.8020653633
+加国 12.5143832909
+刘秉忠 10.9049453784
+老东西 10.2371160058
+工商业者 10.4666904475
+阿猫阿狗 12.8020653633
+秦失其鹿 13.900677652
+排练场 12.8020653633
+先能 12.8020653633
+两万个 12.8020653633
+迪纳拉 12.5143832909
+苦大仇深 11.598092559
+南斯拉夫队 13.2075304714
+姚秋尔 10.9562386728
+中靶 12.2912397395
+沙拉酱 12.5143832909
+柳毅 12.8020653633
+李广之 13.900677652
+弛豫时间 12.2912397395
+室女座 10.765183436
+阵容强大 11.3357282945
+用汇 12.2912397395
+私房 10.5684731418
+再婚 10.9049453784
+中医药大学 12.5143832909
+甄克思 12.8020653633
+重色轻友 13.900677652
+李广为 13.2075304714
+韩爱 13.900677652
+常佣耕 13.2075304714
+用水 8.10461990121
+明公先 13.2075304714
+生物群落 10.1871055853
+再娶 10.7226238216
+八万五千 13.900677652
+扭打 10.9562386728
+补充性 13.2075304714
+像素点 12.8020653633
+瑞兽 12.5143832909
+昂首挺胸 10.9049453784
+聚积 10.0294766411
+刘备依 12.8020653633
+天厨 11.9547675029
+扭扭 11.1280889297
+勾划 12.5143832909
+村话 12.8020653633
+用气 9.30555780184
+叶蝉科 13.2075304714
+缪补逸 13.2075304714
+种畜 12.2912397395
+陆航 11.0674643079
+正义感 10.5684731418
+抚爱 10.9562386728
+引人注意 9.80633308975
+春酒 11.4157710022
+薰沐 12.5143832909
+勾勾 13.900677652
+大有可观 13.900677652
+忍让 10.1630080337
+轻放 11.5027823792
+力劝 10.3171587135
+打雪仗 12.8020653633
+先聊 12.8020653633
+三维空间 10.4666904475
+两万五 13.2075304714
+复刊 10.3743171274
+宫天挺 12.8020653633
+貌似 9.35738286971
+闯红灯 11.4157710022
+再嫁 10.4994802703
+丁建华 13.900677652
+解除权 13.2075304714
+厂家直销 13.900677652
+内瓤 13.2075304714
+勾勒 9.24671730182
+第二记 13.900677652
+前臼齿 10.8096351986
+相沿成习 12.5143832909
+用法 8.53938548627
+提前退休 11.1280889297
+引以为豪 12.2912397395
+力加 12.2912397395
+中音 11.0103058941
+两万人 10.4041700905
+吕凯 11.598092559
+贝藻类 11.7034530746
+轻敲 11.1280889297
+用油 9.59661255877
+青坡 12.1089181827
+李太后 7.01926634833
+炒勺 12.1089181827
+美海军 10.4349417492
+水陆两用 10.0940151622
+呦呦 11.8212361103
+护目镜 12.2912397395
+抗菌剂 12.8020653633
+着重点 11.7034530746
+求亲靠友 13.900677652
+翁偶虹 13.2075304714
+董太 13.900677652
+连续流 12.5143832909
+西往东 11.8212361103
+二甲基苯胺 13.2075304714
+图穷匕现 13.2075304714
+陶明 10.9049453784
+本类 13.900677652
+台柱子 11.7034530746
+题刻 10.4994802703
+中东欧 11.9547675029
+两万件 13.2075304714
+希逢 13.2075304714
+唱片集 13.900677652
+殷府 12.8020653633
+种痘 12.1089181827
+私拿 13.900677652
+轻敌 9.20932976975
+宿松 11.5027823792
+家庭型 13.900677652
+薄为雷 13.900677652
+塔特姆 12.1089181827
+捂住 8.68574189437
+勾兵 11.9547675029
+私意 11.0674643079
+腐蚀剂 11.4157710022
+体育明星 13.900677652
+品管 13.900677652
+手底下 10.642581114
+许钦文 13.900677652
+炽热 9.44633035572
+产中 12.8020653633
+五七日 11.1926274509
+牛李 12.2912397395
+鸳鸯蝴蝶 11.8212361103
+护理学 12.1089181827
+轻暖 13.900677652
+从松林 12.5143832909
+勾兑 10.604840786
+产业 5.46469451599
+着述 13.900677652
+着迷 9.93038573842
+溜来溜去 12.5143832909
+唯识 10.4041700905
+魏都赋 13.2075304714
+产下 10.1164880181
+炽烈 9.98865464655
+两口子 8.47133202302
+洪经略 12.2912397395
+突击手 12.2912397395
+再大 9.45802639549
+产乳 13.2075304714
+胭脂粉 13.900677652
+若夫 11.8212361103
+内省 11.2616203224
+不难想象 10.765183436
+圣诞票 13.900677652
+陶斯 13.2075304714
+题写 10.0720362555
+发车 10.4041700905
+力克 11.5027823792
+陶方 13.2075304714
+发轫 10.533381822
+发软 9.5186510173
+失认症 13.2075304714
+营口市 11.0674643079
+拆牌道字 13.900677652
+陶文 11.7034530746
+翻来翻去 12.1089181827
+陶斋 12.8020653633
+详详细细 11.3357282945
+奚王名 13.2075304714
+金西林 13.2075304714
+封育 11.9547675029
+强烈反响 9.65218240993
+行聘 13.2075304714
+哥伦比亚大学 8.97342396682
+内眷 11.1280889297
+卷毛 10.3743171274
+琐呐 13.900677652
+莫敖 13.900677652
+勾出 11.2616203224
+沥胆 13.2075304714
+中铁 9.13850371718
+阿尔斯兰 12.2912397395
+几千千米 11.4157710022
+种皮 10.2117981979
+西莫娃 12.5143832909
+发达 5.86410424227
+贺一龙 11.7034530746
+靳氏 12.8020653633
+毛豆 12.8020653633
+轻纺产品 13.2075304714
+发辫 10.3453295905
+臆测 11.3357282945
+佛经 8.89673134603
+通科技 12.5143832909
+轻易 7.14957618304
+大蛇 11.1280889297
+成事不足 11.1280889297
+城西区 13.900677652
+托里霍斯 13.2075304714
+去鳞 12.8020653633
+花聚顶 13.900677652
+偕同 10.3453295905
+免疫组化 13.900677652
+中银 8.90346537821
+原阳县 11.5027823792
+斜坡 8.87023973058
+产于 7.71652876104
+富士山 10.8561552143
+何清笑 12.8020653633
+咖啡店 10.9049453784
+荆蛮 11.1280889297
+脑缺氧 12.2912397395
+拒缴 12.8020653633
+藏身之处 12.5143832909
+小歌剧 11.8212361103
+发迹 9.6811699468
+禀陈 13.2075304714
+疏勒河 10.4994802703
+斯科尔尼 13.2075304714
+越儿 9.74179456862
+伸长 8.78268383956
+四百公里 13.900677652
+克绍箕裘 12.8020653633
+方便性 12.2912397395
+航站 12.5143832909
+发运 11.1280889297
+产仔 9.55687223012
+倡导人 12.1089181827
+中钢 11.0674643079
+解调 11.5027823792
+发还 10.4041700905
+地拉那 11.2616203224
+水压驱动 13.2075304714
+腹痛 8.73019365694
+发过 9.69598503258
+解谜 13.2075304714
+主教堂 13.2075304714
+椒江市 12.5143832909
+挤向 13.900677652
+纽约商品交易所 9.04086524761
+老奶奶 10.0294766411
+帕特森 12.1089181827
+麻雀虽小 12.1089181827
+毒害性 13.2075304714
+沙可夫 12.8020653633
+谋略 9.23723855786
+加蒂斯 11.2616203224
+搪瓷 9.80633308975
+豆角 10.2897597393
+阻生牙 13.900677652
+艳阳高照 11.5027823792
+三千余年 13.2075304714
+殷山 13.2075304714
+狗洞 12.8020653633
+凡胎肉眼 13.900677652
+轩翠 13.2075304714
+论文索引 13.2075304714
+十余万元 13.900677652
+德顺 12.2912397395
+追到 9.10488710638
+英商宝 12.8020653633
+封臣 11.1926274509
+小喜 12.8020653633
+拒绝 6.36378052241
+弩弓 12.5143832909
+侦察器 13.900677652
+高又壮 13.900677652
+正始之音 12.5143832909
+西塞山怀古 13.900677652
+中长 10.0505300503
+来照 12.1089181827
+量力而行 10.0720362555
+弗莱 11.8212361103
+都市化 10.9049453784
+唐史 11.1280889297
+中锋 10.642581114
+陆耀 12.8020653633
+陆老 12.2912397395
+加伦将军 13.2075304714
+置身其中 11.8212361103
+袁家骝 12.8020653633
+黄翰晨 11.598092559
+巴腊贡 12.2912397395
+韩瀛 10.604840786
+力偶 11.9547675029
+都市区 10.9562386728
+轻柔 9.32596667347
+客货轮 10.4994802703
+限量 9.37888907493
+气泡室 11.7034530746
+会议录 12.1089181827
+耗能 10.3171587135
+谋生 8.4980002701
+国家赔偿 10.8096351986
+常用软件 13.900677652
+露底 12.8020653633
+前沿阵地 10.7226238216
+开后门 11.2616203224
+百计千方 12.8020653633
+长金志 12.8020653633
+加味 10.2117981979
+育龄夫妇 13.2075304714
+拉丁民族 13.900677652
+引领到 12.2912397395
+内盗 12.8020653633
+轻木 11.7034530746
+第六十七回 12.2912397395
+几十几道 13.2075304714
+韦专政 12.8020653633
+宿曜 12.8020653633
+六两四 12.1089181827
+编作 13.900677652
+中门 10.7226238216
+中间 5.8764701662
+金主亮 13.900677652
+百分之四十 11.1926274509
+原子实 12.5143832909
+小阿儿 13.2075304714
+龙蛇混杂 12.2912397395
+马上拉 12.5143832909
+两块钱 10.604840786
+私情 9.63799777493
+糊弄人 11.7034530746
+怒色 11.0674643079
+那辽兵 13.900677652
+有目共睹 9.85762638414
+周总理 9.62401153296
+轻松 7.04001398053
+客货运 11.0103058941
+水泥制品 11.2616203224
+江津县 12.8020653633
+保险装置 12.1089181827
+时代特色 11.0103058941
+日美德 13.2075304714
+翘起来 11.7034530746
+司马光著 12.8020653633
+侦查员 11.9547675029
+心仪已久 12.5143832909
+内皮 11.1926274509
+点名 9.28555713513
+毛贵 12.5143832909
+来历不明 11.0674643079
+苏霍伊 12.5143832909
+外婆桥 12.8020653633
+市政当局 11.5027823792
+饿着肚皮 12.2912397395
+分文不值 12.5143832909
+毛贼 10.9562386728
+店号 12.8020653633
+七十多万户 13.2075304714
+根生土长 13.900677652
+挖墓 11.8212361103
+桂花酒 13.2075304714
+海阳县 12.8020653633
+继电器 10.0294766411
+韩炎 12.8020653633
+正气歌 11.8212361103
+少年犯 11.598092559
+猪鬃 10.642581114
+王毓铨 11.3357282945
+点召 13.2075304714
+属实 8.77671367257
+偷着哭 12.5143832909
+私有 9.12999302751
+店名 12.2912397395
+私服 12.8020653633
+孙冶方 11.0103058941
+必受其乱 13.900677652
+那石洞 13.900677652
+卡维 12.2912397395
+南湖公园 13.2075304714
+杨斯岑 13.900677652
+宿慧 13.900677652
+性幻想 12.1089181827
+紧接在 12.5143832909
+国基永 13.2075304714
+点号 13.900677652
+露头 9.84023464143
+群众组织 10.2117981979
+炽盛 11.0103058941
+侦察兵 10.2371160058
+加发 12.5143832909
+窦娘娘 11.0103058941
+德齐 10.642581114
+点发 13.900677652
+事业型 12.2912397395
+灵符 13.2075304714
+露天 8.71889410168
+三十多位 12.8020653633
+宿愿 11.1926274509
+题型 11.598092559
+扭杆 10.0720362555
+查波罗 13.2075304714
+神秘莫测 10.533381822
+类比性 12.8020653633
+桑给巴尔 10.3171587135
+卡纳 11.8212361103
+甘甜 10.0940151622
+场效应管 12.1089181827
+打哆嗦 10.6818018271
+卡纸 13.2075304714
+聚糖 11.4157710022
+救难 11.1280889297
+羊楼洞 13.2075304714
+董贵 10.2630914922
+店员 9.80633308975
+扭来 12.8020653633
+购货 10.9049453784
+政工组 12.5143832909
+美国市场 8.94485059437
+加压 9.44633035572
+散结 10.533381822
+满圆 12.8020653633
+单霁翔 12.1089181827
+青粗饲料 12.8020653633
+订条约 12.8020653633
+鬼雄 12.2912397395
+舍命陪君 12.8020653633
+木卫二 12.8020653633
+吕越 13.900677652
+加厚 9.7898037878
+清华北大 13.900677652
+皮开肉绽 10.533381822
+如入无人之境 10.4349417492
+正气水 12.1089181827
+黑鲁帖 13.2075304714
+金角银 13.2075304714
+点卯 10.5684731418
+点卡 12.8020653633
+天上人间 10.6818018271
+再快 11.1926274509
+驾起 10.6818018271
+加印 12.5143832909
+鹰爪虾 12.8020653633
+峨冠博带 12.1089181827
+郭寄峤 13.900677652
+尉王祥 12.8020653633
+轻轻松松 10.4666904475
+鲁滨孙 11.8212361103
+捺印 12.8020653633
+提纯复壮 13.900677652
+费尔南多 12.5143832909
+加升 12.5143832909
+池内 11.0674643079
+何计 10.9562386728
+殷富 11.0103058941
+冕旒 13.2075304714
+啄木鸟 9.91169360541
+班查尔 12.8020653633
+亢进症 13.2075304714
+地锦 13.900677652
+奥特雷 13.2075304714
+再忙 11.1926274509
+追剿 10.4349417492
+梅什科 13.2075304714
+施甸 11.9547675029
+阿谀谄媚 13.900677652
+那绳儿 13.2075304714
+王闻言 11.7034530746
+童贯明 12.8020653633
+殷家 12.8020653633
+秦后来 12.5143832909
+二周 11.9547675029
+下菜 13.2075304714
+屏蔽门 10.7226238216
+咖啡壶 12.5143832909
+饼子 10.3453295905
+小猩猩 12.8020653633
+重要依据 9.07236391467
+西樵山 11.7034530746
+董超 10.4666904475
+武三思 10.642581114
+发见 12.2912397395
+开镜 13.900677652
+木卫三 12.2912397395
+发觉 7.87481167815
+殷实 9.6811699468
+二味 12.2912397395
+断裂处 12.8020653633
+三氟乙酸 12.1089181827
+毛诗 10.642581114
+佛祖 8.89673134603
+解语 11.7034530746
+着装 10.0088573539
+村边 9.56994431169
+声严色厉 11.9547675029
+唐和尚 12.2912397395
+解读 7.62591563073
+禄千 13.900677652
+换点 11.0674643079
+陆虎 10.2897597393
+若干 6.68617323782
+长途汽车 10.0940151622
+地钱 12.5143832909
+桶装 11.2616203224
+信奉宗教 13.2075304714
+石栏杆 12.5143832909
+资讯科技 12.2912397395
+蚌类 12.5143832909
+加勒 12.1089181827
+国富论 11.1926274509
+蛋炒饭 12.5143832909
+中高级 9.62401153296
+解译 12.2912397395
+五七担 13.2075304714
+冷冻固定 13.900677652
+庄敬 13.900677652
+加加 13.2075304714
+再带 11.0674643079
+水暖器材 11.3357282945
+吹下来 13.2075304714
+骨肉同胞 13.2075304714
+透光性 12.2912397395
+换热 11.5027823792
+赖林诸 13.2075304714
+遗传性 9.41204128224
+孟樾 11.3357282945
+才华出众 11.8212361103
+劳动成果 10.6818018271
+近几周来 11.598092559
+地铁 8.20023407859
+控油 10.8096351986
+宿怨 11.2616203224
+发表 5.75309991577
+寿光市 12.1089181827
+博赫纳 12.5143832909
+黄君璧 12.5143832909
+党部 9.65218240993
+云吞面 13.2075304714
+地铺 9.71102290995
+金角铜 12.5143832909
+由西向东 9.69598503258
+欧米加 12.1089181827
+牛性 13.900677652
+第二轮 9.04086524761
+廖若一 13.900677652
+加力 9.89334446674
+毕苏斯 12.1089181827
+发行 4.78673805429
+木呆呆 12.5143832909
+加剧 6.89943202991
+主办单位 11.3357282945
+第二辑 13.2075304714
+同花 12.8020653633
+十三四万 13.2075304714
+再延 12.1089181827
+忍辱 11.2616203224
+五百三十余万 13.2075304714
+排练厅 12.8020653633
+拾得 10.4349417492
+第二辆 10.533381822
+通用件 13.2075304714
+军政界 12.8020653633
+内热 10.4994802703
+十三四个 12.8020653633
+人类文明 9.34680076038
+炮兵营 10.3453295905
+奥特韦 12.2912397395
+玩笑 8.30596627237
+通用机械 10.4994802703
+葛罗希 13.900677652
+本初子午线 11.0103058941
+会展中心 9.66657114738
+伺隙 11.9547675029
+卡罗 10.8096351986
+四桌 13.2075304714
+行动党 11.0103058941
+罗斯蒂 13.900677652
+梁肃 13.2075304714
+再度 5.98972026913
+塞克荷 12.8020653633
+加利 9.91169360541
+斜倚 10.604840786
+交界 8.30596627237
+几床 13.2075304714
+点刹 12.8020653633
+点券 12.8020653633
+加到 8.92394390956
+联合内阁 11.1280889297
+点到 8.89004235788
+完成使命 12.5143832909
+拖人落水 13.900677652
+踽踽独行 12.2912397395
+封蜡 13.900677652
+忍过 12.2912397395
+赫维西 11.9547675029
+加分 9.98865464655
+安如磐石 13.900677652
+惶惶然 11.4157710022
+糖酒会 10.8561552143
+力图 7.98988100794
+与会国 11.7034530746
+加刑 11.8212361103
+阳春砂 13.2075304714
+林业部 12.2912397395
+扭曲 8.44109213783
+灵童 12.1089181827
+秘密会议 11.3357282945
+广济桥 13.2075304714
+列项 13.2075304714
+郑国公 12.5143832909
+燕青唱 12.8020653633
+熟练工人 11.1280889297
+刘文典 13.900677652
+害人虫 12.8020653633
+连山壮族瑶族自治县 13.2075304714
+爱丁顿 11.1280889297
+西海黑 13.900677652
+点击 8.83177344976
+点出 10.642581114
+加出 13.900677652
+桑狄 13.900677652
+基本定律 10.604840786
+铸件 10.533381822
+春阳 10.8096351986
+昭平县 13.900677652
+越冬 8.55834340001
+购车 8.59240995457
+纷繁 9.82314020807
+失足落水 12.5143832909
+轻抚 10.5684731418
+扔出去 11.0674643079
+加减 9.46986085313
+貌合心离 13.900677652
+财物 7.99259471381
+华格纳 12.8020653633
+唐咸亨 13.2075304714
+殷契 12.1089181827
+喜从天降 11.8212361103
+人代会 11.598092559
+驾过 13.2075304714
+联合阵线 11.8212361103
+加冠 12.2912397395
+赵宏声 9.17328983326
+用款 11.4157710022
+急死人 12.2912397395
+命途多舛 13.900677652
+汇报工作 10.6818018271
+换班 10.0294766411
+中选 9.93038573842
+省公安厅 9.63799777493
+加冬 12.1089181827
+共同商定 12.5143832909
+人间正道 11.9547675029
+中途 8.25523075433
+加冰 13.2075304714
+军事学术 10.2117981979
+太闲 13.900677652
+殷殷勤勤 13.900677652
+列昂尼 13.900677652
+中速 10.7226238216
+轻拨 13.2075304714
+唐陆羽 13.2075304714
+斜压 11.3357282945
+宇文懋昭 13.900677652
+舍不得你 11.0103058941
+大开大合 12.1089181827
+驾辕 11.8212361103
+冕服 13.2075304714
+轻拂 12.2912397395
+供需 8.00627481771
+如一日 12.2912397395
+委员会 5.65450609212
+加冕 9.45802639549
+急死了 11.598092559
+轻拉 13.900677652
+加写 13.2075304714
+十三多年 13.2075304714
+蠡测 13.2075304714
+黄金水道 11.598092559
+黑罗斯 13.2075304714
+解表 10.2371160058
+东海龙王 11.9547675029
+加入 5.99560480248
+解衣 10.8096351986
+陈国符 13.900677652
+中郎 10.765183436
+非君莫属 13.900677652
+丹佛市 13.900677652
+元阳县 13.900677652
+凝固汽油 11.4157710022
+地震 7.06013112269
+私斗 12.2912397395
+荆苇 13.2075304714
+家贼难防 13.2075304714
+罗德城 12.5143832909
+点兵 10.9049453784
+购进 8.80692745117
+使用费 10.1871055853
+灵禽 13.2075304714
+加元 9.77354326693
+黄巢败 13.2075304714
+千古骂名 11.9547675029
+钱以文 13.2075304714
+谢德林 11.7034530746
+窦默 12.1089181827
+财政监督 12.5143832909
+钟小鸟 13.900677652
+露宿 10.3743171274
+中部 6.11537246944
+努目 13.900677652
+全攻略 13.2075304714
+毛衣 9.34680076038
+话声 12.5143832909
+艾从其 12.8020653633
+玻璃屋 13.900677652
+散客 11.3357282945
+私方 13.900677652
+顾晓宁 12.5143832909
+边缘科学 11.1280889297
+偏西风 11.9547675029
+邹一桂 12.8020653633
+池口 11.3357282945
+强筋骨 11.9547675029
+春雨 9.61021821083
+历所闻 12.2912397395
+春雪 11.4157710022
+纷纭 10.4041700905
+挂绳 12.8020653633
+意乱心慌 13.900677652
+沃格勒 12.8020653633
+轧花厂 12.5143832909
+纷纷 5.74704016559
+二十好几 12.8020653633
+赵人孩 11.4157710022
+点儿 7.90422556336
+露富 12.1089181827
+权术 10.9049453784
+春雷 10.8561552143
+贝弗里 12.2912397395
+射角 10.9562386728
+灵秀 10.4994802703
+轻扬 13.2075304714
+轻打 12.5143832909
+如日中天 10.9562386728
+内环 11.1926274509
+商品检验 12.1089181827
+结核性 10.8096351986
+霍克森 11.8212361103
+萨姆 9.84023464143
+发话 9.6811699468
+伍家岗区 13.2075304714
+董辅 13.2075304714
+刘和谦 13.2075304714
+发证 10.8561552143
+新声 11.1280889297
+指日可数 13.900677652
+荆芥 11.3357282945
+一九九三年 13.900677652
+李太医 11.1926274509
+放大器 9.46986085313
+超音波 13.2075304714
+弦声 12.5143832909
+牛扒 12.5143832909
+胆汁酸 12.1089181827
+足印 10.9562386728
+皇亲国戚 9.82314020807
+解解 11.598092559
+瑞丽县 12.8020653633
+同期相比 8.98069672615
+奏鸣 12.2912397395
+毛佩琦 12.5143832909
+瞳孔 9.25628675283
+超范围 12.2912397395
+酣畅 10.1394775363
+孙大发 13.900677652
+保洁员 12.5143832909
+洪积物 12.1089181827
+忠骨 12.5143832909
+轻推 12.8020653633
+一报到 13.900677652
+原子弹 8.61241062128
+立朝纲 13.2075304714
+韩瑛 13.900677652
+二上 12.1089181827
+殷小龙 12.2912397395
+韩瑗 13.2075304714
+胡改荐 13.2075304714
+和茶清 11.4157710022
+发言 7.93967231235
+春霞 11.9547675029
+内特 11.2616203224
+责有攸归 12.8020653633
+周慕莲 12.8020653633
+宁夏战役 13.2075304714
+国际期货 9.12999302751
+拉维德 12.1089181827
+侯外庐 11.7034530746
+吉达港 11.9547675029
+西海龙 12.8020653633
+题咏 11.4157710022
+店址 12.8020653633
+阴阳历 10.9562386728
+亚利桑那 12.2912397395
+副大队长 11.598092559
+人民武装 10.8561552143
+南水关 12.8020653633
+专案小组 13.900677652
+义务教育法 11.0674643079
+前后轮 11.5027823792
+小鼐子 10.0505300503
+意外险 10.642581114
+吸附力 11.0674643079
+鬼门 11.2616203224
+韩琦 11.0674643079
+黑钙土 10.3453295905
+三百二十步 13.2075304714
+地雷 8.46695564842
+射表 12.1089181827
+三项式 13.900677652
+恒河平原 10.9562386728
+并条机 12.5143832909
+励精求治 12.8020653633
+抚琴 11.0674643079
+轻揉 13.900677652
+西式 9.94943393339
+二三 9.4233408375
+麻扎刀 12.8020653633
+亿阳信通 11.3357282945
+齿间 12.1089181827
+第二趟 13.900677652
+吸附剂 11.0103058941
+买空卖空 12.1089181827
+夹层玻璃 12.8020653633
+若弃城 12.5143832909
+中量 11.2616203224
+中野 11.598092559
+迪纳摩 12.2912397395
+梁苑 12.8020653633
+中金 8.03704647638
+嵌板 12.2912397395
+牛拉 11.4157710022
+软件厂商 13.2075304714
+金玉其外 12.8020653633
+炮队镜 12.1089181827
+吉野川 13.900677652
+发誓 8.61241062128
+克吕尼 11.8212361103
+猛力一击 13.2075304714
+蒙量表 11.9547675029
+痕量 10.4349417492
+褒斜道 11.598092559
+蓓尔 13.2075304714
+排尿功能 12.2912397395
+轻按 12.8020653633
+沙鱼 12.1089181827
+衔住 12.1089181827
+晓军 11.1280889297
+相结纳 12.5143832909
+孙毓 10.765183436
+轻捷 9.82314020807
+锡林郭勒 11.3357282945
+题名 9.7898037878
+无分彼此 13.900677652
+谢德曼 11.598092559
+华莱土 13.2075304714
+斜切 11.9547675029
+方向线 12.2912397395
+第一一二回 13.2075304714
+都市型 13.2075304714
+艳遇 12.1089181827
+元嘉体 12.8020653633
+内犯 12.2912397395
+地陷 10.9562386728
+德鲁 11.1926274509
+茧子 11.2616203224
+结合点 11.7034530746
+中学校园 12.5143832909
+三数十年 13.2075304714
+大众文化 12.8020653633
+梁芳 13.900677652
+章村 13.2075304714
+第二路 11.9547675029
+殷墟 9.10488710638
+宇文泰遂 13.2075304714
+扇门 10.533381822
+换牙 13.900677652
+弦柱 12.8020653633
+降级 9.56994431169
+结合体 11.1926274509
+再捡 12.8020653633
+骤雨 10.2630914922
+方郡 12.2912397395
+涨价 7.3859649611
+领舞 11.1280889297
+一家亲 12.8020653633
+公田之 12.2912397395
+片言 10.9562386728
+毋宁死 12.5143832909
+一家人 7.46613113319
+分割线 13.2075304714
+轿厢 13.900677652
+迪斯可 13.2075304714
+关键步骤 12.5143832909
+卷内 12.8020653633
+编些 13.2075304714
+费巨万 12.8020653633
+纪上起 13.2075304714
+余风 11.9547675029
+资源整合 8.80692745117
+素体 10.642581114
+论题 10.2117981979
+以攻为守 11.3357282945
+帕特利 13.900677652
+朱衡本 13.2075304714
+领航 10.1630080337
+郭兴 13.2075304714
+透视图 12.2912397395
+种玉 13.900677652
+再挤 13.900677652
+戴金凤 13.900677652
+赤金色 13.2075304714
+岗警 13.900677652
+封贝子 12.5143832909
+黄金首饰 10.642581114
+推搪 11.598092559
+流风 12.1089181827
+挡墙 12.8020653633
+香料群岛 11.7034530746
+谋主 11.0103058941
+受害人 9.49395840471
+江都县 11.2616203224
+深远影响 9.12155415886
+流食 12.5143832909
+明确指出 8.86372504956
+桓宗纯 12.8020653633
+汾河湾 12.8020653633
+私学 10.7226238216
+节约用电 12.1089181827
+赏劳罚罪 13.900677652
+桂阳 10.765183436
+殷朝 12.8020653633
+殷望 12.8020653633
+不等号 11.8212361103
+设过 11.9547675029
+黄丕烈 12.2912397395
+华尔登 13.2075304714
+采访记者 12.2912397395
+私宅 10.4041700905
+林琴南 13.2075304714
+亿多人次 12.8020653633
+孙思邈 10.5684731418
+因地制宜 9.16447920358
+可用性 10.9562386728
+擦鞋童 12.5143832909
+耿南仲 11.5027823792
+止疼 11.1926274509
+中央组织部 10.0294766411
+工艺技术 9.71102290995
+胡锦涛 8.08356649201
+卷儿 11.4157710022
+贺拔胜 12.1089181827
+穆柯寨 13.2075304714
+哈局 13.900677652
+宿州 10.4994802703
+骤降 9.38981814546
+宁八州 13.2075304714
+佳丽 10.642581114
+头昏目眩 11.8212361103
+没学 11.1280889297
+号啕 11.0103058941
+无法平息 12.8020653633
+私宰 12.5143832909
+陶录 12.8020653633
+私家 9.69598503258
+学龄前 10.6818018271
+康斯坦 12.2912397395
+消瘦 8.73019365694
+轮陷 13.900677652
+再接 11.5027823792
+卷入 8.67493097826
+测量误差 11.5027823792
+私密 9.93038573842
+欧莱雅 10.2117981979
+玄甲军 13.900677652
+洛伦茨 11.4157710022
+近水楼台 11.8212361103
+歇息 8.30596627237
+梯架 12.8020653633
+工程项目 9.30555780184
+北凉王 12.1089181827
+古战场 10.3743171274
+角逐 9.03314320152
+聚酯漆 13.900677652
+谋事 10.8096351986
+杜立德 11.5027823792
+吉耶 12.8020653633
+题款 11.8212361103
+加演 12.2912397395
+弦月 13.2075304714
+伏丹墀 13.900677652
+车式炉 13.2075304714
+岳寺塔 12.5143832909
+怀殷忧 12.5143832909
+五指峰 12.5143832909
+加满 11.1926274509
+腹中 8.89004235788
+元绍汉 13.2075304714
+用命 10.8096351986
+鲁棒性 12.5143832909
+非洲法郎 11.1926274509
+谷草 11.9547675029
+贩卖人口 12.8020653633
+但愿人长久 13.2075304714
+养地 12.1089181827
+布莱德雷 12.5143832909
+苍耳 12.5143832909
+王婆计 13.2075304714
+啄取 12.8020653633
+刘桥 13.900677652
+点滴 9.74179456862
+郭阿多 13.2075304714
+牛山 11.8212361103
+王树声 12.5143832909
+苍老 9.31571017331
+方里 13.2075304714
+方量 13.900677652
+产生 4.54062500677
+白云宗 12.5143832909
+冲出重围 10.6818018271
+王金 10.0505300503
+霍尔木兹 12.1089181827
+不灭 9.40086798165
+高中化学 13.900677652
+李约瑟 11.5027823792
+三四样 12.8020653633
+私娼 12.5143832909
+陈忠实 13.900677652
+孔明方 12.8020653633
+帕特南 11.7034530746
+阿睦尔撒纳 11.0103058941
+晋豫 12.2912397395
+薛蕙 13.900677652
+呋喃唑酮 12.8020653633
+轻巧 9.24671730182
+轻工 8.43261751084
+急需品 13.900677652
+以太网 12.5143832909
+温习功课 13.2075304714
+般若 9.75754292558
+陶庄 13.2075304714
+如皋市 12.5143832909
+座右铭 10.3453295905
+总会计师 10.8561552143
+牛尾 11.4157710022
+片警 12.2912397395
+低气压 10.604840786
+三两重 13.900677652
+用后 11.2616203224
+搀起 10.1164880181
+嬉皮 12.8020653633
+点源 12.8020653633
+产界 13.900677652
+再战 9.63799777493
+面缚舆榇 13.900677652
+彭超 13.900677652
+回得来 12.1089181827
+五指山 10.1630080337
+素以 9.77354326693
+奚臣属 13.2075304714
+金銮宝 11.8212361103
+五七年 11.4157710022
+王建宙 11.598092559
+北涛南 13.2075304714
+彭越 10.604840786
+池河 11.5027823792
+素仰 12.5143832909
+印过 12.8020653633
+王建安 13.900677652
+加湿 11.3357282945
+池沼 10.6818018271
+特异性 8.73019365694
+印符术 13.2075304714
+周皇后 11.5027823792
+怪论 11.3357282945
+枯干 11.0674643079
+一曲曲 13.900677652
+四川电视台 12.8020653633
+印迹 10.7226238216
+再拉 11.598092559
+阴之品 12.8020653633
+氯离子 11.1280889297
+动脑筋 9.96885201925
+傩戏 11.5027823792
+公孙龙则 12.8020653633
+再拜 9.21854642485
+用品 8.29120585679
+新约全书 12.8020653633
+路地 13.2075304714
+保释金 12.8020653633
+佳作 9.37888907493
+三十华里 13.2075304714
+加温 9.96885201925
+儿童服装 12.2912397395
+儿茶酚胺 11.2616203224
+梅香 10.2117981979
+敲定 9.02548032877
+冲风破浪 13.900677652
+科技队伍 13.900677652
+技术开发区 9.65218240993
+茄科 10.642581114
+陶布 12.5143832909
+童贯来 12.8020653633
+九牛二虎之力 10.765183436
+佳佳 12.5143832909
+许再提 12.5143832909
+点清 12.1089181827
+章奏 10.4041700905
+复习资料 12.8020653633
+吸附水 12.5143832909
+史保林 10.1164880181
+三十篇 12.8020653633
+政权机关 10.6818018271
+商品质量 10.9562386728
+片语 12.5143832909
+思绪 8.71889410168
+情恕理遣 13.2075304714
+捂着 8.71329184614
+私处 11.1926274509
+牛录 11.4157710022
+从头开始 10.604840786
+照明弹 9.40086798165
+曼纽尔 13.2075304714
+红布条 11.7034530746
+苍茫 9.16447920358
+鹏举 12.1089181827
+加深 7.85567233794
+轻度 8.80692745117
+薛蘅 12.8020653633
+加添 11.1926274509
+美国联邦政府 10.2371160058
+卷去 12.5143832909
+内体 13.2075304714
+滥赌 13.900677652
+生产资料 7.1049718768
+文盲率 10.7226238216
+认识 5.67946755805
+左右两员 11.8212361103
+谷源冰 13.900677652
+种下 10.2630914922
+认证 8.52078029844
+扭头 8.28027678626
+印象 7.15074645819
+种业 9.28555713513
+用场 9.24671730182
+历史悠久 7.75864024639
+南伸延 12.1089181827
+唐古拉 11.0103058941
+内伊 12.8020653633
+含而不露 11.0674643079
+十二团 13.900677652
+用地 7.52055511508
+牛弘 13.2075304714
+李广田 12.2912397395
+孔石 12.2912397395
+乌林之 13.2075304714
+私奔 10.0940151622
+范缜 11.1926274509
+续保 11.3357282945
+专项规划 10.765183436
+切变线 11.8212361103
+魏延寨 13.2075304714
+宦之家 10.604840786
+出入境 9.55687223012
+印谱 11.5027823792
+哈尼 9.71102290995
+鳗鲡 9.93038573842
+加涅 13.900677652
+贬义词 13.2075304714
+防人之心 11.8212361103
+续修 11.4157710022
+内传 11.5027823792
+心怀不轨 13.2075304714
+多抹 13.900677652
+降糖 11.0674643079
+宿弊 13.2075304714
+卷发 9.91169360541
+若愚 11.8212361103
+屏气凝神 11.8212361103
+肯德尔 12.2912397395
+炭精 13.2075304714
+张伟达 12.8020653633
+趋化性 12.8020653633
+鹿喜欢 13.2075304714
+铸物 13.900677652
+赶不上 9.22784881751
+少儿英语 12.5143832909
+吴自牧 12.8020653633
+拉瓦河 12.5143832909
+锄田 13.2075304714
+拉肚子 10.4994802703
+代府 13.2075304714
+问到她 13.2075304714
+梅高 13.900677652
+访问团 11.9547675029
+夫余 10.9049453784
+布莱德利 13.2075304714
+绕膝 12.2912397395
+康王死 12.5143832909
+续传 12.8020653633
+地旷人稀 13.900677652
+晚年生活 11.0103058941
+桅竿 13.900677652
+让你能 13.2075304714
+单翼机 12.2912397395
+票面值 13.2075304714
+合法化 9.87532596124
+成扁 13.2075304714
+达拉斯 11.0103058941
+副主编 10.0940151622
+食蚊鱼 12.2912397395
+鳗鱼 10.2897597393
+种些 11.598092559
+内侍 8.57766767284
+碑记 11.1926274509
+诚信 8.25877058104
+传统习俗 10.765183436
+整在 13.2075304714
+愤愤不平 9.72629038208
+内侄 10.3453295905
+温李 12.8020653633
+微生 11.9547675029
+迪纳夫 13.900677652
+医疗卫生 8.62767809341
+千锤百炼 10.9562386728
+邓军举 12.8020653633
+最下策 13.900677652
+柱状晶 13.900677652
+权柄 10.5684731418
+加派 10.533381822
+父志 13.900677652
+刊载 9.63799777493
+烂账 12.5143832909
+烂货 12.2912397395
+纳哈尔 13.900677652
+饱食终日 11.9547675029
+谷雨节 13.2075304714
+换位 10.2117981979
+内侧 8.34771806705
+红血丝 12.2912397395
+幻象 10.765183436
+饶有兴致 11.1926274509
+禄寺少 13.2075304714
+防雷设计 13.900677652
+配偶 8.78868986362
+桅帆 13.900677652
+波黑 10.3453295905
+串串香 12.8020653633
+王莽派 12.2912397395
+内侵 11.5027823792
+加洛 12.8020653633
+成才 11.0103058941
+冕宁 10.642581114
+威迫 13.2075304714
+妥当 8.18364995057
+由谷英 12.8020653633
+中央气象局 12.2912397395
+只身一人 11.1280889297
+日利率 12.8020653633
+玄宗倚 13.2075304714
+加注 10.604840786
+卷动 11.598092559
+加泰 13.2075304714
+温塞特 12.8020653633
+换亲 13.2075304714
+孙卿 13.2075304714
+自取灭亡 11.1280889297
+黄色小说 12.1089181827
+北扬 13.2075304714
+轻微 7.82763311788
+换人 10.3171587135
+有才无命 13.2075304714
+轻得 11.1280889297
+牛年 9.69598503258
+以卵击石 12.2912397395
+章安 12.8020653633
+内乡 10.4349417492
+连续型 11.9547675029
+陆缘冰 12.8020653633
+小吃铺 13.2075304714
+轻待 13.2075304714
+加法 9.96885201925
+电力企业 9.43476953332
+蹑足潜踪 13.2075304714
+内乱 8.75318317516
+呼玛河 12.5143832909
+提出批评 11.0674643079
+波士顿咨询公司 13.2075304714
+模态逻辑 11.8212361103
+咖啡杯 12.1089181827
+换代 10.1394775363
+樊梁湖 12.8020653633
+徐铸成 12.5143832909
+肖海 11.598092559
+余架次 12.8020653633
+户齐民 11.9547675029
+轻忽 11.598092559
+牛市 7.46132728088
+换件 10.9562386728
+内丘 12.2912397395
+签约国 11.7034530746
+内业 12.1089181827
+轻快 9.20932976975
+狱友 12.2912397395
+加油 8.80692745117
+死而后已 11.1926274509
+内中 9.61021821083
+一百万镑 12.2912397395
+陪我玩 13.2075304714
+叉鱼 12.8020653633
+亿千瓦时 9.82314020807
+唐乾封 13.2075304714
+狱司 11.7034530746
+消痰 11.7034530746
+忻然 11.2616203224
+危象 11.7034530746
+光扫描器 13.900677652
+由安西 12.2912397395
+小凌河 10.765183436
+内丹 9.77354326693
+内主 13.2075304714
+勾栏 10.4041700905
+夫人 6.01798544569
+天不从人 13.900677652
+加沙 10.9562386728
+坝址 9.84023464143
+故而 8.98069672615
+衙前 10.604840786
+中国足球协会 12.2912397395
+超水平 12.8020653633
+晋身 11.598092559
+轻弹 12.8020653633
+故老 11.9547675029
+帕特农 13.900677652
+换个 9.15574552361
+照过去 12.1089181827
+弄神弄鬼 12.2912397395
+再想 9.24671730182
+变节者 13.900677652
+曹锟瞅 13.2075304714
+舰载 9.01032852375
+互相照顾 12.2912397395
+若想 9.61021821083
+卡哈马卡 12.5143832909
+描出来 13.900677652
+塔形 11.0103058941
+变速装置 13.2075304714
+拔根 11.5027823792
+乖谬 12.5143832909
+换上 8.10461990121
+换下 10.2117981979
+邵洵美 13.2075304714
+陈抚台 11.8212361103
+井头 13.900677652
+妥帖 10.3743171274
+嫁祸于 11.9547675029
+三番四次 12.8020653633
+阳玛诺 13.2075304714
+加氢 10.6818018271
+燕窝 10.0720362555
+狱卒 9.63799777493
+内争 10.9562386728
+沙茨 12.8020653633
+公刚 13.900677652
+透光度 11.9547675029
+加氯 12.5143832909
+等效电路 12.8020653633
+徐子平 13.900677652
+加水 9.09665660724
+牛庄 10.604840786
+由少府 12.2912397395
+反复性 12.5143832909
+彭连 13.900677652
+一半儿 10.6818018271
+宿府 13.2075304714
+炭素 11.5027823792
+苍苍 10.2371160058
+轮锤 13.900677652
+吡啶酮 13.2075304714
+恒温箱 13.900677652
+席地而坐 10.4349417492
+欢心鼓舞 13.900677652
+薛蟠 9.43476953332
+陶尔 13.2075304714
+清华紫光 12.5143832909
+加气 8.73589167805
+内人 11.0674643079
+库加河 13.900677652
+换乘 10.1630080337
+安迪诺 12.8020653633
+天公 11.1280889297
+再来 7.75434839431
+认路 11.9547675029
+母草 13.2075304714
+只想出 13.900677652
+扭开 11.3357282945
+川道 10.642581114
+牛奔 13.2075304714
+马锡龄 13.2075304714
+楞枷经 13.900677652
+盲目性 10.8561552143
+用具 8.92394390956
+用兵 7.82993992397
+庚子赔款 11.1280889297
+若松 13.900677652
+寺观 9.65218240993
+本州岛 11.0103058941
+潜势力 12.8020653633
+设计 5.52712391076
+陶寺 11.4157710022
+尚书令 9.36807815882
+李义山 12.1089181827
+彭蠡 11.598092559
+牛奶 8.0229418702
+表型 10.533381822
+同心合力 12.5143832909
+经衬纬 13.900677652
+产后检查 13.2075304714
+范祥 12.8020653633
+物议沸腾 11.9547675029
+榆次 10.7226238216
+用光 9.98865464655
+角铁 12.8020653633
+加比 13.900677652
+创始人 7.32003851469
+坎坷不平 11.4157710022
+吉普车 8.48457724977
+镧系元素 11.4157710022
+文摘报 13.2075304714
+林甫之 13.2075304714
+轻声 7.91171623509
+金华市 11.0674643079
+白蔹 12.8020653633
+世界知识产权组织 11.3357282945
+喉咙干 13.900677652
+食品工业 8.61747392324
+罗德洛 13.900677652
+翁源县 13.2075304714
+全国人大常务委员会 11.2616203224
+王镇长 12.5143832909
+彭定求 12.5143832909
+透视力 13.900677652
+梁贞明 11.3357282945
+波顿 12.8020653633
+晋西 10.6818018271
+围棋赛 12.2912397395
+方针 7.34674424795
+断章取意 13.900677652
+布里斯 13.2075304714
+全球化 8.4801426527
+韩伟 13.2075304714
+高考制度 11.9547675029
+炊具 10.4666904475
+再有 7.7083151625
+于豪亮 13.2075304714
+格格直 13.900677652
+珍肴异馔 13.900677652
+出入库 11.3357282945
+七八口 11.4157710022
+音频芯片 13.900677652
+皮碗 13.900677652
+虎步龙行 13.900677652
+沙茶 13.900677652
+视觉享受 12.5143832909
+再查 11.5027823792
+斜楔 13.900677652
+卫生条件 10.6818018271
+寻地仙 13.900677652
+斜楞 13.900677652
+戴青巾 13.900677652
+知能 13.900677652
+扭得 11.1926274509
+航政 13.2075304714
+不妨一试 11.0103058941
+韩信 9.38981814546
+为官一任 12.2912397395
+郝柏村 12.1089181827
+赌瘾 12.8020653633
+狱吏 10.3453295905
+哈韩族 13.900677652
+点歌 11.8212361103
+天时地利 11.2616203224
+独当一面 10.4349417492
+立方分米 13.900677652
+陶子 13.900677652
+赵桓靖 12.8020653633
+素车白马 12.8020653633
+私德 13.900677652
+认赔 12.1089181827
+哥儿们 11.598092559
+陶孟 12.1089181827
+私心 9.32596667347
+认购 6.98000614773
+常捷军 12.8020653633
+认账 11.7034530746
+单双 10.4349417492
+梅鲁 12.8020653633
+套入 12.8020653633
+耍猴 11.598092559
+八千多元 13.2075304714
+康熙字典 10.9562386728
+饶得 12.5143832909
+夸大其词 11.1926274509
+晋见 10.5684731418
+北子岛 12.2912397395
+彩色图片 12.2912397395
+瑞昌市 13.2075304714
+若果 10.4041700905
+宠辱不惊 11.3357282945
+屡增 13.2075304714
+危语 13.900677652
+张卫东 12.8020653633
+流体密度 11.5027823792
+哼声 13.2075304714
+夹克衫 11.598092559
+兼筹并顾 13.900677652
+约旦河 11.2616203224
+管民官 12.2912397395
+弘清水 13.2075304714
+危言 11.4157710022
+五脏俱全 12.1089181827
+母女俩 10.3743171274
+阿维森 13.900677652
+两棵树 11.2616203224
+角门 9.84023464143
+昼夜不分 13.900677652
+用做 10.642581114
+诊疗费 11.9547675029
+刀把儿 12.8020653633
+国立大学 10.2630914922
+矢志不移 12.5143832909
+供应国 11.2616203224
+以为后图 13.900677652
+轻妙 13.900677652
+巩留野 12.1089181827
+西米亚 12.2912397395
+刃儿 13.900677652
+深宅大院 10.9049453784
+巴昔卡 11.7034530746
+露怯 12.2912397395
+闽北话 13.900677652
+红五星 12.5143832909
+两万片 13.2075304714
+哈尔切夫 12.8020653633
+竞走比赛 12.1089181827
+勇猛 8.89004235788
+法律顾问 10.4041700905
+宗元贞 13.2075304714
+延伸段 13.2075304714
+原子数 11.0103058941
+伊延普 13.900677652
+八骏图 12.8020653633
+朱衡才 13.2075304714
+刘家岛 13.2075304714
+萨尔卡 13.900677652
+归绥 11.7034530746
+殉难 10.2371160058
+若昂 11.7034530746
+扮作 9.77354326693
+仅仅如此 13.2075304714
+花奶牛 12.2912397395
+禄寺官 13.2075304714
+艾利斯 12.2912397395
+众寡不敌 11.5027823792
+兵役制 11.2616203224
+提督署 13.2075304714
+索科特拉岛 12.2912397395
+若曦 8.48903160012
+平光镜 13.900677652
+车迷 10.9049453784
+印证 8.13235665618
+信心十足 9.91169360541
+萨尔诺夫 13.2075304714
+索尼亚 13.900677652
+宋儒赵 13.2075304714
+虞姬伴 13.2075304714
+撤走 9.12155415886
+偏回 13.900677652
+撤资 10.533381822
+总冠军 11.1926274509
+章伯颜 13.2075304714
+国魏孙 13.2075304714
+斜桥 12.2912397395
+圣马丁岛 13.900677652
+米南卡保 11.9547675029
+泣不成声 9.63799777493
+亚洲电视 13.900677652
+韩人 12.5143832909
+无稽 11.3357282945
+翁加雷 13.2075304714
+科西莫 13.2075304714
+群起而攻之 11.9547675029
+韩国菜 13.2075304714
+赴汤蹈火 10.8096351986
+刊行 9.16447920358
+角锥 13.2075304714
+没道理 10.642581114
+胡汉各 12.8020653633
+四十五度 11.1280889297
+胆色素原 13.900677652
+印记 9.26594866375
+韩亚 13.2075304714
+四通八达 8.98069672615
+扼腕叹息 12.8020653633
+生僻字 13.2075304714
+行贿人 13.2075304714
+布拉柴维尔 11.5027823792
+冯铨 11.4157710022
+降等 12.5143832909
+水经注 9.85762638414
+贱妾 10.6818018271
+世界之窗 11.9547675029
+警卫军 13.2075304714
+六百五十二 13.2075304714
+方锐 12.8020653633
+轻奏 13.900677652
+处女秀 13.2075304714
+于剑阁 13.2075304714
+榛蘑 12.5143832909
+如鲠在喉 12.5143832909
+吉普赛 11.2616203224
+遗传学 8.52539924429
+润色 10.2897597393
+枣红马 10.5684731418
+海珠区 11.1280889297
+消炎 9.75754292558
+甘作 11.9547675029
+九死一生 10.4041700905
+印行 9.80633308975
+角雕 12.5143832909
+涂脂 12.8020653633
+靖远县 12.8020653633
+宿存 9.84023464143
+跌跌撞撞 9.44633035572
+如操左券 12.5143832909
+李怀林 13.900677652
+沉毅 12.1089181827
+谜面 12.5143832909
+非工程 11.4157710022
+输精管 10.4041700905
+高分辨率 10.1164880181
+左氏春秋 11.5027823792
+若敖 12.8020653633
+公闻 13.900677652
+角雉 10.2630914922
+玉如命 13.2075304714
+自由选择 10.3171587135
+消烟 13.2075304714
+横拖倒拽 11.4157710022
+乖觉 10.533381822
+狱囚 11.5027823792
+扭转局势 12.5143832909
+翘翘 11.9547675029
+装糊涂 10.4041700905
+傻劲 13.2075304714
+袖头 11.1280889297
+冻猪肉 12.2912397395
+产物 6.89579566226
+达果 13.900677652
+苍蝇 8.62767809341
+物价局 10.1871055853
+抗法 10.642581114
+检察系统 13.2075304714
+发货单 13.2075304714
+师才会 13.2075304714
+栽下来 11.7034530746
+邦加岛 13.900677652
+财政负担 11.4157710022
+总体经济 10.4666904475
+弩手 12.1089181827
+斯盖鲁 13.2075304714
+立子亮 12.8020653633
+京杭运河 8.71889410168
+陆健笑 12.5143832909
+温一词 13.2075304714
+周光召 12.2912397395
+认输 9.89334446674
+用毒 13.900677652
+再日 13.2075304714
+产状 9.91169360541
+岳桦 12.1089181827
+艰苦性 12.8020653633
+孔眼 11.598092559
+明显 4.63964416568
+陈镜开 12.5143832909
+暖色调 13.2075304714
+古镜镇 12.5143832909
+阿戈斯蒂 12.8020653633
+属意 11.5027823792
+皮博迪 12.5143832909
+妃子 9.34680076038
+跳舞草 12.8020653633
+羚羊 8.82550383674
+忽悠悠 12.8020653633
+四盏 11.4157710022
+真铭 12.8020653633
+桥台 11.7034530746
+用友 11.0103058941
+张惶失措 12.5143832909
+题海 13.900677652
+章帝 10.4041700905
+用去 11.2616203224
+放声大哭 8.98069672615
+贼头贼脑 12.1089181827
+楚元王 13.900677652
+性腺 9.75754292558
+施惠国 13.900677652
+套儿 11.7034530746
+唐文雅 12.5143832909
+若羌县 11.1926274509
+盖瑟斯 12.5143832909
+乳糖酶 13.900677652
+无线电报 11.4157710022
+方阵 9.4233408375
+壹年 13.2075304714
+着重指出 11.2616203224
+戏叫 13.2075304714
+巴洛特 13.2075304714
+消灾 9.96885201925
+空见 13.2075304714
+勾涔 11.9547675029
+田先 12.2912397395
+世界资源研究所 12.8020653633
+勾消 12.8020653633
+登记手续 9.77354326693
+福尼亚 13.2075304714
+一千二百六十二万余两 13.2075304714
+方队 10.9049453784
+消灭 6.75706004927
+三四千年 11.2616203224
+阿姆斯特朗 10.642581114
+榆树 9.59661255877
+丑脸 13.900677652
+互通信息 12.8020653633
+出站口 10.765183436
+力气 7.39339993959
+商业行为 11.3357282945
+王郎 12.8020653633
+案宣判 11.8212361103
+以上学历 10.765183436
+铸石 12.1089181827
+雪莲 10.4994802703
+柳琴 12.5143832909
+史孟麟 13.900677652
+妃嫔 8.99540287354
+小吃部 11.9547675029
+再摇 12.2912397395
+炮兵部队 10.4666904475
+噱头 9.75754292558
+孙卫红 12.2912397395
+点检 10.6818018271
+降福 11.5027823792
+飞上去 13.900677652
+悲伤欲绝 13.900677652
+不少第五等 13.2075304714
+何惧哉 11.0103058941
+魂不著体 13.900677652
+宿娼 12.1089181827
+海产品 9.98865464655
+千千万万 9.43476953332
+再搬 11.7034530746
+性能 6.30629640942
+才貌出众 11.9547675029
+百公里 9.40086798165
+绿乔木 12.8020653633
+力求 8.16733637508
+北九州 11.3357282945
+雷尼替丁 13.2075304714
+女司机 11.7034530746
+过江青 13.2075304714
+非盈利 11.9547675029
+靳准 12.1089181827
+蔬菜基地 11.8212361103
+孽子 12.1089181827
+竹篱茅舍 12.5143832909
+秦明回 12.5143832909
+解阳山 12.2912397395
+用刑 10.3453295905
+点电荷 11.1280889297
+哈杰尔 13.2075304714
+甘为 11.1926274509
+炒汇 11.598092559
+财团法人 13.2075304714
+液压油 12.1089181827
+中共中央办公厅 11.3357282945
+用刀 9.80633308975
+原子束 12.5143832909
+一首一尾 11.7034530746
+奥亚波 13.900677652
+怏怏不乐 11.9547675029
+剑南春 11.9547675029
+方面 4.26311068011
+化学变化 9.61021821083
+一定之规 11.2616203224
+单核心 13.900677652
+相控阵 9.84023464143
+崂山区 12.1089181827
+渤海地区 12.5143832909
+数数儿 13.2075304714
+主干路 12.8020653633
+九成新 13.2075304714
+摩尔体积 12.8020653633
+薏米 10.7226238216
+增生 8.59240995457
+勾法 13.900677652
+穷民 11.7034530746
+陶塑 10.9562386728
+唯利是图 11.0674643079
+唐朝廷 13.900677652
+傅兰雅 12.5143832909
+属性 7.50208271744
+玉华 11.9547675029
+甘于 10.8561552143
+廉租 9.34680076038
+公证处 10.533381822
+房产商 10.604840786
+赵保吉 12.8020653633
+看见 5.08530765102
+罗虎刚 12.8020653633
+民俗论 13.2075304714
+碑身 11.7034530746
+三两面 13.2075304714
+点样 12.5143832909
+大运河 9.48183704418
+用力 7.30353195009
+偷窃行为 13.900677652
+胰岛素瘤 11.9547675029
+用功 9.62401153296
+形影相随 12.8020653633
+着重于 9.87532596124
+张勋入 12.5143832909
+少年人 11.1926274509
+安徽省巢湖地区 12.1089181827
+吨公里 12.5143832909
+农业试验 13.2075304714
+万多一点 13.900677652
+邕宁 11.8212361103
+搜身 11.9547675029
+接班人 9.54396882529
+国务院台湾事务办公室 12.8020653633
+炭盆 12.2912397395
+软木质 13.2075304714
+石室中 11.8212361103
+尿道炎 11.0103058941
+甲吡酮 13.900677652
+开展业务 10.4349417492
+石泉西 12.5143832909
+超穷基数 13.900677652
+垂花门 11.9547675029
+红花草 13.2075304714
+荜茇 13.2075304714
+症候群 11.2616203224
+败俗伤风 13.900677652
+钮钟 12.5143832909
+十英里 13.2075304714
+三十五岁 10.604840786
+原子核 8.43261751084
+轻咬 12.2912397395
+多凶少吉 12.8020653633
+史发兵 13.2075304714
+泄忿 12.8020653633
+杨邦宪 13.900677652
+妥善 8.78268383956
+张辉瓒 12.8020653633
+商汤尊 12.8020653633
+决不食言 11.7034530746
+陶城 12.1089181827
+伏生授 13.2075304714
+走回头路 11.5027823792
+挂碍 11.3357282945
+饱和度 10.6818018271
+陶埙 12.1089181827
+点染 10.604840786
+圆圆的 9.32596667347
+范畴 7.42987814819
+再次 5.44876992726
+但嘉乔 13.2075304714
+团结友爱 13.2075304714
+明明白白 9.06439574502
+灵位 10.5684731418
+私卖 10.8561552143
+差之毫厘 12.5143832909
+预制件 13.2075304714
+雏菊 11.7034530746
+私占 12.5143832909
+风电场 11.0103058941
+赵之龙 10.9049453784
+十余万户 12.1089181827
+俞菊笙 12.8020653633
+乍一看 9.89334446674
+私印 11.598092559
+多次出 12.1089181827
+加林 12.2912397395
+蹭蹬 11.2616203224
+技术人员 8.4801426527
+布克赛 11.7034530746
+袭人 8.089536659
+力排 12.1089181827
+赵川镇 13.900677652
+容并茂 13.2075304714
+榆林 8.9308643524
+轻吻 12.1089181827
+马洪 11.3357282945
+大奖章 12.5143832909
+节约开支 12.5143832909
+点来 11.7034530746
+沼泽化 10.3171587135
+方顺 13.2075304714
+港务 10.4666904475
+产粮 10.1394775363
+流通 6.11454121419
+流逝 9.53122979951
+机伶 11.9547675029
+流速 8.6803218269
+用工 9.6811699468
+加权 8.04560572977
+撤职 9.21854642485
+绿地面积 11.9547675029
+红模子 13.900677652
+片花 12.8020653633
+轻吟 12.8020653633
+稍不留神 11.598092559
+周军胜利 13.2075304714
+蒋家王朝 12.5143832909
+斯科拉 11.1280889297
+铁罗汉 13.900677652
+勾描 13.2075304714
+饱和带 13.2075304714
+工期紧 13.2075304714
+哼歌 12.8020653633
+力推 9.89334446674
+才子佳人 10.765183436
+唯物辩证 13.900677652
+羊蹄甲 12.1089181827
+拉关系 11.8212361103
+普慧辅 12.8020653633
+凡胎浊骨 13.900677652
+侦查权 11.598092559
+壁立千仞 12.2912397395
+流遍 13.2075304714
+范疆 12.5143832909
+泰西封 11.5027823792
+目录学 10.1630080337
+流道 13.900677652
+辉瑞公司 11.7034530746
+支公司 12.1089181827
+北齐书 11.2616203224
+吴淳夫 12.2912397395
+药学专科 13.900677652
+跃马 9.54396882529
+孙苻登 12.5143832909
+玩乐 11.1280889297
+尖头鞋 13.2075304714
+加有 11.0103058941
+走走停停 10.4041700905
+廉直 12.5143832909
+轿子 8.12923652885
+出粉率 12.5143832909
+梅州市 11.4157710022
+灵修 12.8020653633
+加朗 12.5143832909
+延平王 12.8020653633
+吉诃德 11.0674643079
+公孙龙子 12.8020653633
+陶土 9.59661255877
+出入口 10.2630914922
+宿命 10.0940151622
+首脑会议 9.56994431169
+灵丘 11.1280889297
+私分 12.2912397395
+邵晋涵 12.8020653633
+力战 9.85762638414
+光纤通信 10.642581114
+拥军爱民 13.2075304714
+奥维尔斯 9.96885201925
+纳贡称臣 13.2075304714
+星火燎原 12.5143832909
+瑞丝 13.900677652
+露水 9.32596667347
+罪孽深重 11.7034530746
+牛津纺 12.2912397395
+核心理念 11.4157710022
+张瑞图 12.8020653633
+访问控制 11.2616203224
+上消化道 10.9562386728
+焕发 9.28555713513
+水乳交融 11.5027823792
+扭到 11.1926274509
+日新月异 10.0505300503
+后悔莫及 10.8096351986
+那话儿 10.9562386728
+装饰一新 12.2912397395
+公司公告 9.00283785202
+用尽 9.26594866375
+想方设法 9.07236391467
+钓起来 13.2075304714
+鲁肃相 13.2075304714
+流量 7.40541209604
+认股 11.8212361103
+流金 11.598092559
+自给性 12.5143832909
+起点处 12.5143832909
+波长 8.07173203437
+王建华 11.7034530746
+呆呆挣挣 12.1089181827
+虐待狂 12.5143832909
+无依无靠 9.98865464655
+众将士 11.9547675029
+谷斑皮蠹 13.2075304714
+适应性 8.40350942668
+无差错 12.5143832909
+附属中学 12.2912397395
+林芝县 11.598092559
+解上州 11.9547675029
+范琼 11.598092559
+亿载金城 13.900677652
+丁颖 13.2075304714
+讨要 10.1871055853
+麻黄素 11.1280889297
+安居梦 13.2075304714
+力抓 13.2075304714
+梅里 10.765183436
+嵌入 9.33632946051
+红樱桃 11.9547675029
+陶器 8.01179969364
+各项任务 10.604840786
+石药集团 13.2075304714
+勾拳 13.2075304714
+玩伴 11.598092559
+文学语言 10.4994802703
+眉开眼笑 9.98865464655
+西暖阁 8.91707103027
+供货量 11.598092559
+肯德基 10.8561552143
+吹下去 13.2075304714
+种桑养蚕 11.5027823792
+扭力 10.9049453784
+黑古隆冬 12.8020653633
+雅绅特 13.900677652
+千年一遇 12.1089181827
+感慨 7.64109618791
+花似锦 13.2075304714
+一百一十多万户 13.2075304714
+扭动 9.5062284973
+花花绿绿 9.66657114738
+塞尔德 13.900677652
+力护 13.2075304714
+制鞋厂 13.900677652
+王小梅 12.2912397395
+渺无踪迹 13.2075304714
+黑底白字 12.2912397395
+陪不是 12.5143832909
+力拒 11.7034530746
+灵仙 13.900677652
+三四千克 13.2075304714
+理由 6.23680039327
+破裂 7.77380846786
+流配 11.4157710022
+南怀仁 11.1926274509
+谜题 11.8212361103
+神法 12.5143832909
+领证 12.1089181827
+会坏 13.2075304714
+如箭在弦 12.8020653633
+千沟万壑 12.2912397395
+非常设 12.5143832909
+变着法儿 10.8096351986
+方腊国 13.2075304714
+知足 10.1630080337
+淡黄 9.48183704418
+菲利普 10.2371160058
+几席 11.5027823792
+点明 10.604840786
+挺过 11.9547675029
+壹元 13.2075304714
+领读 12.5143832909
+力拼 11.9547675029
+布里格 12.8020653633
+港剧 13.2075304714
+通渭 12.5143832909
+因车祸 11.4157710022
+孙玉玺 11.9547675029
+医务人员 9.36807815882
+佛乐 11.8212361103
+答不答应 12.2912397395
+公共卫生 9.09665660724
+沥沥拉拉 13.900677652
+殷浩 11.4157710022
+四百 9.38981814546
+哌啶 11.9547675029
+好几分钟 12.2912397395
+郁郁寡欢 10.533381822
+性趣 12.1089181827
+四白 12.8020653633
+解解馋 12.8020653633
+波阳 10.9049453784
+经济制裁 10.533381822
+生了锈 11.7034530746
+铁道部 9.20019728618
+施可汗 13.2075304714
+斗来斗去 12.5143832909
+安皇太后 13.2075304714
+七一眼 13.2075304714
+更让人 9.4233408375
+溶解氧 11.7034530746
+范睢 12.2912397395
+卷宗 10.1871055853
+工作到位 12.8020653633
+明路儿 13.2075304714
+标高 11.0674643079
+西济胜 13.2075304714
+桂鱼 13.2075304714
+使馆 9.11318590919
+霍克尼 13.2075304714
+方骨 12.5143832909
+糜烂不堪 13.2075304714
+领衔 9.6811699468
+玄宗奔 12.1089181827
+尼瓦尔 11.9547675029
+营口港 11.7034530746
+不惜成本 12.5143832909
+加斯 11.2616203224
+宿地 13.900677652
+傲视 11.1280889297
+高新技术 8.18694484647
+巴哈马籍 13.900677652
+胥吏汇 13.2075304714
+私党 11.0674643079
+间接选举 11.0103058941
+集合体 9.24671730182
+加施 13.900677652
+百白破 13.900677652
+参加锻炼 12.8020653633
+加文 13.900677652
+陶喆 12.2912397395
+再植 10.9562386728
+饮食疗法 11.5027823792
+埃莱阿 13.2075304714
+池杉 13.900677652
+断层山 13.2075304714
+盘星石 13.2075304714
+气息奄奄 11.2616203224
+改变面貌 12.5143832909
+私养 13.2075304714
+加料 11.4157710022
+抱去 12.8020653633
+侦察机 8.78868986362
+川黔 9.87532596124
+德新社 12.2912397395
+领袖 6.97606525593
+病菌 9.24671730182
+霍利卡 13.900677652
+哌嗪 12.8020653633
+耶古卜 12.8020653633
+斜杆 12.8020653633
+加数 12.1089181827
+公证员 11.9547675029
+李约翰 13.2075304714
+角马 11.598092559
+点数 9.82314020807
+刚回 11.9547675029
+天铜仪 13.900677652
+点整 11.2616203224
+性质 5.61541651791
+夹袋人物 13.900677652
+语音 8.45394028031
+花妖狐魅 13.900677652
+扪虱而谈 13.2075304714
+乌江镇 13.900677652
+人品出众 13.2075304714
+用心 8.06294720481
+凌振放 13.2075304714
+章则 12.5143832909
+由博古 13.2075304714
+包举 13.900677652
+苏格拉底 9.56994431169
+性起 11.1280889297
+轩为 13.2075304714
+小兰子 12.5143832909
+题意 12.8020653633
+史大哥 13.900677652
+交欢 11.1926274509
+孙太太 12.1089181827
+瓦加诺 12.5143832909
+右颊 13.900677652
+波雷 12.8020653633
+加收 10.3171587135
+佛事 10.0720362555
+吉言 11.7034530746
+禁阻 12.8020653633
+王女士 9.87532596124
+胡姬花 13.2075304714
+丁向民 13.2075304714
+玉茗堂 12.2912397395
+遗传型 12.5143832909
+大牛股 10.4349417492
+云骑风 13.2075304714
+用得 9.82314020807
+诸王公主 12.2912397395
+言孔明 12.5143832909
+扔出来 12.5143832909
+琼州海峡 10.2117981979
+保持一致 9.30555780184
+卷子 10.0088573539
+产经 11.8212361103
+都市报 9.56994431169
+不育症 11.1280889297
+私函 13.900677652
+摄像头 10.0720362555
+阴雨连绵 11.9547675029
+小凤仙 12.8020653633
+前中期 12.5143832909
+殷汤 13.2075304714
+佛佗 13.900677652
+胡德 11.3357282945
+炊帚 13.900677652
+狱官 11.9547675029
+布察克 13.2075304714
+鼓囊囊 13.900677652
+蒙雨露 13.2075304714
+十年动乱 11.2616203224
+佩迪 13.2075304714
+尚阳堡 11.7034530746
+公雷神 13.900677652
+汝师兄 11.598092559
+配位聚合 11.9547675029
+坦噶尼喀湖 11.0103058941
+齿条 11.1280889297
+拒付 12.2912397395
+士隐 10.765183436
+蒋月泉 12.8020653633
+实习生 7.82074445688
+吉语 12.1089181827
+轻型 7.83689244329
+德米特里 10.8561552143
+希尧 13.2075304714
+石吊兰 13.900677652
+补充剂 11.598092559
+讨论 6.28144423575
+点播 11.0103058941
+周萌 13.900677652
+波面 11.598092559
+章句 10.2371160058
+陈国令 13.2075304714
+孟秋 13.2075304714
+铸管 10.642581114
+三千六百九十 13.2075304714
+拒交 12.1089181827
+付诸实施 9.72629038208
+谁的心 12.5143832909
+历陈 13.900677652
+铺路石 13.900677652
+鄂东北 12.5143832909
+壹号 13.900677652
+香精油 10.9562386728
+殷氏 13.2075304714
+姑表亲 13.2075304714
+年终分配 12.8020653633
+黑龙江省 8.13235665618
+绕行 9.5186510173
+中奖者 9.75754292558
+殷民 11.1926274509
+轨道电路 12.5143832909
+炭疽 11.0674643079
+历险 11.5027823792
+谷宽水 12.5143832909
+这番话 8.58747167293
+特殊字符 10.9562386728
+斜晖 12.5143832909
+生闲气 11.9547675029
+桐城人 11.0103058941
+拒买 13.900677652
+维空间 11.1926274509
+王建军 11.5027823792
+第九届全国人大 13.2075304714
+成瘾性 11.7034530746
+贝义渊 13.2075304714
+事业性 11.8212361103
+鱼龙混杂 10.765183436
+自言自语 8.53470163695
+夜幕降临 10.9049453784
+火凤凰 12.1089181827
+设营 11.2616203224
+通泉草 13.900677652
+非常规 9.58318953844
+产羔 13.2075304714
+宿四 10.9562386728
+放屁添风 13.2075304714
+冯保伸 12.1089181827
+连续式 11.1926274509
+知过 13.900677652
+泡沫痰 12.2912397395
+外资股 10.765183436
+殷法 13.2075304714
+几百万倍 13.2075304714
+余叔岩 10.9562386728
+降生 9.59661255877
+魂牵梦萦 12.2912397395
+示范作用 10.4349417492
+入选国 13.2075304714
+跌停板 8.75318317516
+鲁国公 11.598092559
+波音 9.0884932966
+利耶夫 12.5143832909
+用度 9.91169360541
+整个来说 12.8020653633
+争锋吃醋 13.900677652
+唾手可取 13.900677652
+所托非人 13.900677652
+章华 11.598092559
+一磅 11.1280889297
+吵来吵去 13.2075304714
+好榜样 11.598092559
+联合型 12.5143832909
+龙虎风云 12.5143832909
+半睡半醒 11.1926274509
+冶金业 11.3357282945
+王里姆 13.900677652
+公共汽车 8.83808261895
+小王爷 13.900677652
+用好 10.642581114
+不认账 10.9562386728
+玻璃市 13.900677652
+发条橙 13.900677652
+诺贝尔 9.04864738806
+孽债 12.1089181827
+改天换地 12.5143832909
+偏听 12.1089181827
+几无二致 13.900677652
+煮食 11.0674643079
+声誉卓著 12.2912397395
+金宗英 13.2075304714
+印色 12.8020653633
+卡什 11.1926274509
+赵保忠 13.2075304714
+深切关怀 12.8020653633
+指导教授 12.5143832909
+强烈反抗 11.598092559
+丽质 12.8020653633
+私地 12.8020653633
+加强力量 13.2075304714
+北京吉普汽车有限公司 12.8020653633
+葡萄牙人 8.67493097826
+波速 10.6818018271
+拉维河 11.9547675029
+好斗 9.98865464655
+拜天地 11.0674643079
+购置税 8.74162235276
+祥云县 12.8020653633
+异宝奇珍 13.900677652
+米泉县 13.900677652
+毛质 11.9547675029
+绕转 11.1926274509
+陈政 13.2075304714
+安全瓣 13.900677652
+卡人 11.5027823792
+角鲨 12.1089181827
+逃脱责任 13.2075304714
+小火柴 13.900677652
+碾伯镇 12.5143832909
+湘雅医院 13.900677652
+巴希尔 13.2075304714
+大命 11.598092559
+神经科 11.9547675029
+牛儿 11.8212361103
+东方时空 12.2912397395
+会议桌 12.5143832909
+加排 13.900677652
+再演 10.9562386728
+意向者 13.900677652
+故迹 12.5143832909
+费加罗 10.3453295905
+卡亚 12.8020653633
+一秒钟 9.91169360541
+用处 8.65893063692
+塞尔尼 13.900677652
+王平殷 12.8020653633
+同日而语 11.1280889297
+不等式 10.4349417492
+西里村 12.2912397395
+有理函数 11.9547675029
+笔记本型 13.900677652
+三水市 13.2075304714
+机修 11.0674643079
+平行六面 12.8020653633
+各乡镇 11.1926274509
+片蚀 13.900677652
+加捻 13.900677652
+题材 6.19271612014
+人模狗样 11.9547675029
+移时 12.5143832909
+团党委 11.8212361103
+科尔沁草原 10.9562386728
+升档 13.900677652
+沼泽地 8.88339781516
+一盘散沙 10.604840786
+周瑜寨 13.2075304714
+矿山机械 9.74179456862
+荣高棠 12.8020653633
+中央气象台 10.2897597393
+湿度计 12.5143832909
+石榴石 11.2616203224
+轮驳 12.8020653633
+弦歌 11.3357282945
+五七千 12.8020653633
+马提尼克岛 11.4157710022
+两万篇 13.2075304714
+偏后 12.5143832909
+嬉笑 10.0088573539
+跪地求饶 12.5143832909
+遭致 11.5027823792
+租赁业 12.2912397395
+径山寺 12.1089181827
+殷殷 10.7226238216
+多摄氏度 13.2075304714
+那杨志 12.8020653633
+水蒙蒙 13.2075304714
+湘潭人 12.1089181827
+卡丹 11.9547675029
+流传下去 11.9547675029
+不合标准 12.2912397395
+王演卦 13.2075304714
+小哥 11.7034530746
+加挂 10.8561552143
+陈皇后 9.14708746087
+印花 9.71102290995
+烧塌 13.2075304714
+世外桃源 10.604840786
+打得赢 12.5143832909
+哇噻 12.8020653633
+泡沫状 11.598092559
+嵌合 12.5143832909
+耍笑 10.765183436
+绕过 8.15447446144
+入乡随俗 10.604840786
+点拨 10.4994802703
+陪陪 10.4041700905
+加拨 11.0674643079
+拉维涅 11.8212361103
+诸帅皆 12.8020653633
+代主任 7.96843246453
+跃龙 11.598092559
+五四路 11.2616203224
+上馆子 12.5143832909
+笑口常开 13.2075304714
+加拿 13.900677652
+王道成 12.2912397395
+郡王府 12.2912397395
+滋事 10.6818018271
+就地取材 10.8561552143
+加拈 11.8212361103
+加拉 10.5684731418
+固沙林 12.8020653633
+比嘉平 13.2075304714
+高点 6.77942519873
+聚宝盆 10.9049453784
+常含海 13.2075304714
+宿债 12.1089181827
+加护 12.1089181827
+加报 13.900677652
+轻击 12.2912397395
+贫乏 8.85082164473
+转包合同 13.900677652
+有样学样 11.7034530746
+营业日 12.5143832909
+十分相似 9.91169360541
+须芒草 13.2075304714
+蛋蛋 11.4157710022
+展展 12.8020653633
+晋职 13.2075304714
+脸容 11.5027823792
+王田私 11.598092559
+鼓子词 11.7034530746
+两口气 11.3357282945
+延胡索酸 12.5143832909
+蕃兵 12.1089181827
+依言 9.5062284973
+方腊加 13.2075304714
+周忠介 13.2075304714
+再满 13.900677652
+指证 11.8212361103
+佩西 12.8020653633
+元明宗 12.2912397395
+卡佩 11.3357282945
+张瑞芳 12.5143832909
+改恶向善 13.900677652
+小邦象 13.2075304714
+毛燥 12.5143832909
+再做道理 12.8020653633
+手下无情 13.2075304714
+卷尾 11.8212361103
+带队 9.55687223012
+卷尺 12.2912397395
+禄寺卿 11.7034530746
+跨州连郡 11.9547675029
+重庆力帆 13.900677652
+透视学 11.598092559
+煮饭 10.3743171274
+二场 13.900677652
+仲德之 13.2075304714
+加扎 12.8020653633
+万艾可 11.4157710022
+卡住 9.58318953844
+艺文志 9.4233408375
+加打 13.2075304714
+吉赫 11.0103058941
+讨赏 12.5143832909
+美女图 13.900677652
+栗成之 13.2075304714
+吾将上下而求索 13.900677652
+妄口巴舌 13.900677652
+金钱万能 12.2912397395
+德斯坦 11.9547675029
+中国农业银行 9.54396882529
+店方 13.2075304714
+及时努力 13.900677652
+摄像师 12.5143832909
+惠寺华 12.5143832909
+吉贝 11.7034530746
+轻兵 11.598092559
+卡伦 11.5027823792
+设色 9.98865464655
+领进 10.3453295905
+相得益彰 10.3743171274
+用墨 11.1280889297
+瑶琳 12.2912397395
+男女朋友 12.8020653633
+陶制 10.9562386728
+领过 12.2912397395
+汕头人 12.8020653633
+杨雄道 10.1871055853
+讨账 12.5143832909
+太静 12.1089181827
+吸附性 11.9547675029
+江都市 12.1089181827
+大叶杨 13.900677652
+忆旧游 12.8020653633
+产科 10.642581114
+波里 11.5027823792
+石榴皮 12.2912397395
+卡伊 11.598092559
+扛长工 12.1089181827
+岛链 11.3357282945
+军国主义 9.63799777493
+加成 9.98865464655
+五七分 12.8020653633
+英烈千秋 13.900677652
+富有诗意 10.4666904475
+流长 12.5143832909
+天河城 13.2075304714
+总体水平 10.8096351986
+留宾 13.900677652
+斜插 10.3743171274
+卫星广播 12.2912397395
+保川会 12.5143832909
+啧啧称赞 10.8561552143
+胞间层 13.2075304714
+哈市 12.2912397395
+论难 13.2075304714
+李太提 13.900677652
+救助站 12.1089181827
+纷乱 9.09665660724
+最丑 12.2912397395
+降点 13.2075304714
+顺风船 12.1089181827
+吃干饭 12.1089181827
+鸡鸣犬吠 12.8020653633
+题旨 11.8212361103
+力攻 12.2912397395
+唐乾元 12.2912397395
+圆窗 11.9547675029
+轻功 11.598092559
+火眼金睛 10.1164880181
+告诉您 10.5684731418
+私售 11.8212361103
+吡唑 13.2075304714
+无防备 12.1089181827
+莱昂纳德 11.598092559
+周派军 13.2075304714
+天地 7.20364340431
+角黍 12.8020653633
+基本农田 11.4157710022
+产程 11.1926274509
+抗震救灾 10.8096351986
+怀俄明 12.2912397395
+私商 10.9049453784
+降热 13.2075304714
+绕起 13.2075304714
+敖钦 12.2912397395
+陶冬 10.4041700905
+冶工 12.8020653633
+哇哇 9.7898037878
+出谋献策 11.598092559
+成都双流机场 11.1926274509
+国富民丰 12.2912397395
+废矿 13.900677652
+陶冶 10.2630914922
+费尔巴哈 10.1164880181
+消磁 12.2912397395
+强宁斯 13.2075304714
+鄱阳 10.4666904475
+邓文原 13.2075304714
+无数面 12.5143832909
+孟节 13.900677652
+水位站 12.2912397395
+论集 9.96885201925
+梅阡 13.2075304714
+知言 12.8020653633
+勤学苦练 11.9547675029
+消磨 9.44633035572
+你推我让 12.8020653633
+章回 12.2912397395
+新闻出版 9.08039608637
+宾夕法尼亚大学 10.9562386728
+追兵 8.98802276624
+多成 10.8561552143
+罗嘉良 10.765183436
+夷灭 12.5143832909
+梅集 11.8212361103
+自查报告 12.5143832909
+收市价 9.84023464143
+代代相传 10.642581114
+轻判 12.1089181827
+轻利 13.2075304714
+苏门答腊 9.6811699468
+个体劳动 12.1089181827
+吡喃 11.1280889297
+梅雨 9.89334446674
+千古不朽 12.8020653633
+轻则 9.85762638414
+章嘉 11.1280889297
+炭火 9.43476953332
+衙役 8.94485059437
+炭灰 12.1089181827
+走私案 12.1089181827
+多元回归 13.2075304714
+湖南投资 12.2912397395
+宿县 10.6818018271
+聚义 10.1394775363
+后燕相 12.8020653633
+挡开 11.0674643079
+翘着 10.2630914922
+梅隆 10.1394775363
+用家 13.2075304714
+房产局 11.1926274509
+降火 10.3171587135
+绕路 10.8561552143
+个人主页 13.2075304714
+沃格拉 13.2075304714
+侦察排 12.2912397395
+哇呀 13.900677652
+黄大仙 9.7898037878
+安家立业 13.2075304714
+打拱作揖 13.2075304714
+辛白林 12.8020653633
+妥协 7.93967231235
+蒙德里安 12.1089181827
+西善桥 12.5143832909
+宜古宜今 13.900677652
+加意 10.4041700905
+纷争 8.79473217808
+唆使 9.45802639549
+军代室 13.2075304714
+伦敦大学 9.55687223012
+滴水之恩 11.9547675029
+拉丁美洲 8.44109213783
+上场比赛 12.5143832909
+速滑队 13.900677652
+睡过去 11.2616203224
+连衽成帷 13.900677652
+封东王 12.8020653633
+李哨 13.900677652
+加惠 12.5143832909
+佩诺 13.900677652
+防弹背心 12.2912397395
+向小校 12.2912397395
+贱卖 10.533381822
+专题研讨 13.900677652
+历五朝 12.8020653633
+妥加 12.1089181827
+三叶期 13.900677652
+协同效应 10.2117981979
+郑鸿逵 12.8020653633
+人多手杂 11.8212361103
+架结构 11.9547675029
+采油 9.94943393339
+上荷珠 13.900677652
+多头管理 13.900677652
+夏玉莲 8.230796729
+私吞 11.3357282945
+讨还 11.1280889297
+山根里 11.5027823792
+玛佐夫 13.2075304714
+冯乃超 11.8212361103
+伏一军 13.2075304714
+礼拜三 13.900677652
+辅导班 12.1089181827
+攀登上 13.2075304714
+北京友谊医院 12.5143832909
+领购 13.2075304714
+少说几句 12.8020653633
+梅霍 13.900677652
+众毛攒裘 13.900677652
+和颍水 13.2075304714
+鱼肉乡里 11.7034530746
+哥伦比亚省 11.9547675029
+刀把子 11.8212361103
+往里 8.44109213783
+权威专家 10.6818018271
+勾搭 10.3743171274
+性气候 12.1089181827
+不给你看 13.2075304714
+轻叩 12.5143832909
+非婚生 13.900677652
+蛮干 11.4157710022
+领赏 11.5027823792
+领走 10.4666904475
+增盈 13.2075304714
+李文书 13.900677652
+系统优化 13.2075304714
+轻取 11.4157710022
+吉达 9.56994431169
+戈贝尔 12.8020653633
+宗务隆 11.9547675029
+囚车 10.4666904475
+认购价 11.1926274509
+深水港区 13.2075304714
+史迁普 12.5143832909
+流音 13.900677652
+翘盼 13.2075304714
+口角锋芒 13.2075304714
+湿度表 11.9547675029
+卫懿公 12.8020653633
+布面 11.0674643079
+蓝飞教 13.2075304714
+顾云章 12.8020653633
+主把 12.8020653633
+吐峪沟 12.1089181827
+激于义愤 12.8020653633
+加恩 11.4157710022
+加息 6.28685896717
+吡咯 11.2616203224
+若泽 12.8020653633
+六七百元 11.1926274509
+牛勇 11.598092559
+聚伙 12.8020653633
+聚会 8.28390655431
+溢于言表 10.3453295905
+标准状况 13.2075304714
+聚众 8.70772080109
+平移变换 12.8020653633
+靠岸 9.72629038208
+千百道 13.2075304714
+黄白色 10.0940151622
+妻子儿女 10.642581114
+卷布 12.5143832909
+释放者 13.900677652
+罗德曼 13.2075304714
+万古霉素 11.8212361103
+知识 6.44885541545
+全体人员 11.2616203224
+礼拜五 12.8020653633
+流露 8.80081122415
+富兰克林 9.15574552361
+阿格丽 13.900677652
+卷帙 11.1926274509
+卷帘 10.4666904475
+领跑 9.15574552361
+数值积分 11.4157710022
+解运 13.2075304714
+布里渊 12.2912397395
+加急 10.4994802703
+追悔莫及 11.1280889297
+平均差 13.2075304714
+迪斯尼 6.67374163348
+金波湾 12.5143832909
+微量分析 11.3357282945
+回顾总结 11.9547675029
+伯宁 12.5143832909
+三四千块 13.900677652
+薄利多销 11.7034530746
+试点单位 11.5027823792
+宿务 11.9547675029
+岛外居民 13.2075304714
+桂馥 12.2912397395
+小时数 10.9562386728
+祝家庄 9.59661255877
+密封材料 12.1089181827
+方鼎 12.8020653633
+供应地 10.9562386728
+一千三百多年 12.8020653633
+筇竹 11.9547675029
+哇啦 11.1280889297
+跳跃传导 13.900677652
+卓问肃 13.2075304714
+龙腾虎跃 12.5143832909
+习用语 13.2075304714
+遗传力 12.5143832909
+花蕊石 13.900677652
+祸首 10.8561552143
+领路 10.2630914922
+内嵌 10.765183436
+西摩特 13.2075304714
+黑板擦 13.900677652
+航材 12.5143832909
+经济秩序 9.85762638414
+玉棺中 10.7226238216
+韩国队 11.598092559
+方能 8.61747392324
+波谱 10.604840786
+布衣裤 13.900677652
+李沛瑶 13.900677652
+宣王死 13.2075304714
+雍丘非 13.2075304714
+刻版印刷 12.2912397395
+提审犯人 13.900677652
+尚好 10.642581114
+管理处 8.62767809341
+李卫公 11.7034530746
+只字片语 12.2912397395
+陶俑 10.3453295905
+卡勒 11.8212361103
+水温表 12.5143832909
+明时 10.1164880181
+角背 13.900677652
+下楼梯 10.765183436
+换工 11.7034530746
+接插件 13.2075304714
+圣诞卡 12.8020653633
+兰盖 12.5143832909
+设拉子 11.1280889297
+卡努 12.8020653633
+利家 13.900677652
+点群 12.5143832909
+谷苗 12.2912397395
+原子灰 13.900677652
+礼拜六 11.7034530746
+程继先 12.1089181827
+灵均 13.900677652
+瓜维亚雷 13.900677652
+第口 11.3357282945
+如汤泼雪 13.900677652
+弗里斯特 12.8020653633
+陶侃 10.9562386728
+朱广沪 13.2075304714
+签署国 12.8020653633
+一九八五年 12.5143832909
+李文公 13.2075304714
+十四回 12.2912397395
+南开数学研究所 13.2075304714
+说说笑笑 9.91169360541
+总产值 7.96578345636
+天坑 13.900677652
+多音节 12.5143832909
+种属 9.22784881751
+叉车 11.2616203224
+王鼎昌 13.2075304714
+漠然视之 13.900677652
+所言非虚 12.8020653633
+韩寿 12.8020653633
+关口守御 13.2075304714
+原子序数 9.30555780184
+高淳县 11.3357282945
+宫装 12.2912397395
+叶河房 10.8561552143
+排排长 12.5143832909
+烦厌 12.5143832909
+双菱藻 12.8020653633
+和田晓霞 11.1280889297
+唯理论 10.3453295905
+应发 13.2075304714
+伤身 10.8561552143
+素心 11.9547675029
+轮虫 11.1280889297
+张遇贤 13.2075304714
+摇摇欲坠 9.6811699468
+公证书 12.5143832909
+熊金超 13.900677652
+智利人 11.9547675029
+丹麦王国 12.2912397395
+题签 12.1089181827
+加罗 12.5143832909
+青史留名 11.5027823792
+加罚 12.5143832909
+康奈尔大学 10.1164880181
+地蜜 13.900677652
+平均分 11.4157710022
+狮头鹅 13.2075304714
+涨幅 5.39272704193
+宝钗心 13.2075304714
+流血 8.10158499752
+吉通 12.5143832909
+精神污染 13.900677652
+欧伦施 12.1089181827
+动作性 12.1089181827
+胡岭 13.2075304714
+自由民主 11.1280889297
+论衡 10.4994802703
+韩家 9.94943393339
+嚷起来 10.2117981979
+卡到 12.8020653633
+拉帕尔马 13.900677652
+再现 7.65845438652
+长大成人 9.91169360541
+韩宣 13.2075304714
+结合律 12.2912397395
+红袖添香 11.8212361103
+忍辱含垢 13.2075304714
+耿仲明 11.2616203224
+大动干戈 10.9049453784
+学道者 12.5143832909
+点缀 9.11318590919
+腹心 10.1164880181
+扯闲 11.9547675029
+母梁氏 12.5143832909
+卡列 11.9547675029
+象鼻山 12.1089181827
+八亩 12.5143832909
+韩宇 13.900677652
+死胡同 10.642581114
+大相径庭 9.45802639549
+卡口 12.2912397395
+内屋 12.5143832909
+吉金 11.9547675029
+华星 9.22784881751
+张卫寨 13.900677652
+体察下情 13.900677652
+冯太后 11.8212361103
+刨根究底 13.900677652
+内层 9.56994431169
+申请材料 9.85762638414
+吉里 11.8212361103
+卡号 11.8212361103
+吉野 10.2371160058
+消极 8.01179969364
+白狗精 12.2912397395
+加练 13.900677652
+主导权 10.2117981979
+再版 10.0088573539
+活性染料 12.5143832909
+梅西 11.3357282945
+换岗 11.1926274509
+奇思妙想 12.2912397395
+协约 10.3743171274
+绕梁三日 12.2912397395
+寡人之疾 13.900677652
+加给 11.8212361103
+内山 12.8020653633
+立法院 10.4041700905
+电力系统 9.14708746087
+无力自拔 13.2075304714
+出国游 12.5143832909
+范氏 11.0674643079
+言语不通 13.2075304714
+关木通 13.900677652
+府治 9.25628675283
+加纳 9.17328983326
+愁肠百结 12.1089181827
+光华路 13.900677652
+抬下去 12.1089181827
+往返 8.44963919841
+绢丝 11.598092559
+内尔 10.6818018271
+素常 12.1089181827
+网络资源 11.3357282945
+闻遐迩 13.900677652
+加线 12.8020653633
+流觞 12.2912397395
+属相 10.9049453784
+甲胄鱼类 13.2075304714
+软皮 13.2075304714
+贪图便宜 13.900677652
+角膜 9.36807815882
+印鼻 13.2075304714
+二倍体 10.3743171274
+涨得 8.88339781516
+扶手椅 11.4157710022
+千古不磨 13.2075304714
+知错 10.8561552143
+鸾交凤友 13.900677652
+层次感 11.9547675029
+直接原因 9.71102290995
+磺化 11.1926274509
+为数甚少 11.9547675029
+卡卡 11.0103058941
+蓄势待发 10.1164880181
+周仆正 12.2912397395
+合蕊柱 12.5143832909
+顶顶 11.598092559
+好旺 13.900677652
+使舵 13.900677652
+伊拉克 7.81390292506
+哈康 12.8020653633
+赫耳墨斯 12.8020653633
+聂远 12.8020653633
+王恭举 13.2075304714
+雕塑公园 12.8020653633
+顽强拼搏 11.8212361103
+雄赳赳地 12.5143832909
+雅兰 13.2075304714
+方腊 9.56994431169
+盆浴 11.598092559
+易接近 12.8020653633
+无间道 13.900677652
+特兰西 11.2616203224
+陶乐 13.2075304714
+雷比 12.8020653633
+肃然起敬 10.1394775363
+咬住 8.66423568915
+清都绛阙 13.2075304714
+殷盛 12.5143832909
+增援部队 10.8096351986
+冯野王 12.8020653633
+聚光 11.2616203224
+马直冲 12.8020653633
+真髓 13.900677652
+再犯 9.98865464655
+种差 12.8020653633
+周逸群 11.9547675029
+续展 13.2075304714
+何罪之有 11.8212361103
+采水 12.2912397395
+五七个 11.2616203224
+土壤特性 12.2912397395
+店租 13.900677652
+返销粮 12.8020653633
+遭遇战 10.8096351986
+武警官兵 12.1089181827
+灵囿 13.900677652
+苍郁 11.4157710022
+非国有化 12.8020653633
+商住楼 11.8212361103
+高自位置 13.900677652
+碑额 12.1089181827
+选矿厂 11.7034530746
+换届 10.9049453784
+伊丽莎白港 12.5143832909
+谋得 11.9547675029
+拒吃 13.900677652
+陶丘 13.2075304714
+陶业 12.5143832909
+饭铺 9.0884932966
+沂水县 11.3357282945
+力竭 10.604840786
+煮蛋 12.5143832909
+棕漠土 11.0103058941
+代人受过 11.9547675029
+吕西安 12.2912397395
+怀有孕 13.900677652
+吴仞之 12.8020653633
+甘孛 12.5143832909
+毛收入 12.5143832909
+向奉宸 13.900677652
+甘孜 10.533381822
+岳大壮 10.0720362555
+甘子 11.8212361103
+中介人 11.1280889297
+牛佳 13.2075304714
+贱买 12.5143832909
+定襄县 12.8020653633
+玉湘云 13.900677652
+堑壕 10.642581114
+睿明 13.900677652
+中外合作 11.0674643079
+金雀花 11.2616203224
+长辛店镇 13.2075304714
+种师 9.36807815882
+硬了起来 12.5143832909
+换得 10.1871055853
+两三百元 12.8020653633
+方苞 11.0103058941
+中共上海市委 11.1280889297
+轻于 11.4157710022
+韩奇 13.900677652
+秦淮惊 12.8020653633
+独到之见 12.5143832909
+故里 8.81927328699
+应邀参加 11.1280889297
+圆柱型 13.900677652
+夜来香 12.2912397395
+管理学 10.1164880181
+贱业 12.1089181827
+云铝股份 10.4349417492
+内弟 10.3453295905
+露着 10.0940151622
+江泽涵 12.8020653633
+阿穆 12.8020653633
+方芳 13.900677652
+若然 10.1630080337
+使臣 8.57766767284
+贾琏越 13.2075304714
+摄影留念 13.900677652
+李重润 12.2912397395
+换心 13.2075304714
+原子物理 11.598092559
+内弦 13.900677652
+言清行浊 13.900677652
+推三推四 13.900677652
+韩复 11.1926274509
+缩微平片 13.900677652
+杜绝言路 13.900677652
+商标局 10.8561552143
+龙宫洞 13.2075304714
+流言 9.43476953332
+开关插座 13.900677652
+变戏法 10.8561552143
+存在 4.57051188693
+无所遁形 11.9547675029
+角色 7.02235118368
+花月痕 12.5143832909
+管理室 13.900677652
+公民自由 11.5027823792
+带露 11.9547675029
+内心 7.16015829237
+飞标 13.2075304714
+降水 7.39489359185
+天基 10.765183436
+肄业 9.89334446674
+苏门羚 9.84023464143
+来颁赐 13.2075304714
+玩吧 11.3357282945
+嚼舌头 10.642581114
+云麾勋章 13.900677652
+本国货币 10.0088573539
+优先股 10.2371160058
+续弦 10.9049453784
+单纯林 13.900677652
+贱价 11.8212361103
+韩姐 12.1089181827
+内忧 11.0674643079
+意大利共和国 11.8212361103
+尖尖角 11.9547675029
+佛国 10.3171587135
+降气 12.1089181827
+蕉园 13.900677652
+夫役 11.5027823792
+斯瓦德 13.2075304714
+扑热息痛 11.7034530746
+良渚镇 13.2075304714
+颜色混合 11.9547675029
+玩命 10.2117981979
+加紧 7.89679058487
+烟草市场 13.2075304714
+内径 10.8561552143
+玩味 10.604840786
+般配 10.4349417492
+廉泉 12.8020653633
+蛮人 11.8212361103
+学术著作 10.642581114
+骤落 13.2075304714
+於方田 13.900677652
+黯然销魂 13.900677652
+薛雄 13.2075304714
+滋养 9.16447920358
+贱事 13.900677652
+街面 10.6818018271
+时不再来 12.1089181827
+有闻必录 13.900677652
+蓬江海 13.2075304714
+热情欢迎 11.8212361103
+数字通讯 13.900677652
+贱人 10.0294766411
+首四句 12.8020653633
+肄习 13.900677652
+方舆 12.8020653633
+方舟 10.4349417492
+薛雪 12.2912397395
+铸成 9.40086798165
+少年宫 11.7034530746
+八七 10.4041700905
+裂罅 12.5143832909
+入选为 13.2075304714
+轻便 8.61747392324
+秤盘 11.9547675029
+桂蕊 13.2075304714
+四十三类 13.2075304714
+内幕 7.9526426628
+曲麻莱县 11.4157710022
+申请加入 11.8212361103
+风沙区 11.5027823792
+报名单 12.8020653633
+更衣柜 13.2075304714
+熊希龄 11.3357282945
+产期 11.8212361103
+古比雪夫 11.7034530746
+薛霸 10.533381822
+巴拉巴 12.5143832909
+加糖 10.9562386728
+佛坪 11.8212361103
+可望而不可即 11.2616203224
+八三 13.900677652
+知青 9.26594866375
+论语 8.93783302172
+八丈 11.5027823792
+宿主 9.19114745066
+奉赵 13.900677652
+轻率地说 13.900677652
+吉良乘 11.7034530746
+波轮 11.9547675029
+金西京 13.2075304714
+佛土 12.8020653633
+望海楼 10.4666904475
+奚啸伯 13.900677652
+山乌桓 12.8020653633
+消旋 10.4041700905
+轻信 9.56994431169
+十二倍 13.2075304714
+聚变 10.4349417492
+石榴树 11.0103058941
+畅销小说 13.900677652
+论说 10.4041700905
+通草花 13.900677652
+四万块 13.2075304714
+水豆腐 12.5143832909
+高压电源 13.900677652
+穿连裆裤 12.8020653633
+转危为安 9.7898037878
+以色列政府 12.2912397395
+发案单位 13.900677652
+咽不下 10.3453295905
+打字员 11.5027823792
+论评 13.2075304714
+斜线 10.533381822
+中央级 11.9547675029
+论证 7.54630761118
+绕道 8.99540287354
+马格达莱纳 11.9547675029
+故都 10.0940151622
+产权 8.0600359946
+加粗 10.9049453784
+素尔 13.900677652
+跃至 12.8020653633
+论诗 10.2630914922
+宿七 11.3357282945
+卡农 12.1089181827
+续建 10.4349417492
+若热 11.7034530746
+可望而不可及 11.7034530746
+方药 10.1871055853
+牛仔 10.7226238216
+日月星辰 9.85762638414
+黑白胶片 13.900677652
+加米 11.9547675029
+王丙乾 13.2075304714
+卡具 13.2075304714
+轻伤 9.55687223012
+卡兹 13.900677652
+知音 9.87532596124
+于豪奢 13.900677652
+沉浸于 11.598092559
+北京城 8.02014466558
+早产儿 11.4157710022
+阿格利 12.8020653633
+筚路蓝缕 12.8020653633
+桂藩 12.1089181827
+航天飞机 9.22784881751
+种得 11.598092559
+溢洪道 10.5684731418
+布里特 13.900677652
+内建 9.53122979951
+宿仇 13.900677652
+内廷 8.99540287354
+十三块 12.8020653633
+优游岁月 13.2075304714
+让开 9.38981814546
+弦琴 12.1089181827
+轻佻 10.5684731418
+刘裕代 12.8020653633
+密切注意 9.59661255877
+崔济愚 13.900677652
+内府 10.0505300503
+商业道德 12.8020653633
+魔瓶 12.8020653633
+东挪西借 13.2075304714
+夷洲 12.1089181827
+礼乐之邦 13.900677652
+内应 9.13850371718
+好人儿 12.8020653633
+故道 9.26594866375
+牛二 10.4666904475
+轻体 12.5143832909
+漫山塞野 12.8020653633
+牛人 10.8096351986
+八两 10.9049453784
+王天德 13.2075304714
+人情味儿 12.8020653633
+上位法 11.1926274509
+江泽民 9.5186510173
+宿二 10.6818018271
+私欲膨胀 12.2912397395
+扭成一团 13.900677652
+消散 8.73019365694
+马可尼 10.3743171274
+私企 10.642581114
+卡因 12.2912397395
+养娘 11.0674643079
+整合 6.65716467731
+退晕 13.2075304714
+吴国太 12.1089181827
+领队 9.43476953332
+夫姓 12.8020653633
+络绎 10.3171587135
+八中 12.5143832909
+渤海 7.38893232233
+联网 7.33541268194
+卡图 12.5143832909
+推下去 11.1280889297
+制鞋业 11.1926274509
+奇行 13.2075304714
+西华县 11.1926274509
+黄梅县 13.2075304714
+知遇 11.0103058941
+桂良 10.5684731418
+纷呈 10.1871055853
+内奸 10.9049453784
+对答如流 11.1926274509
+豆藤 13.2075304714
+天冬氨酸 12.8020653633
+知道 3.97410854
+煮肉 11.2616203224
+定慧寺 11.598092559
+回天乏术 12.8020653633
+夫妇 7.31726842982
+德莫斯 13.900677652
+蓝水 11.9547675029
+抚弄 10.604840786
+扭住 10.2371160058
+讨钱 10.765183436
+投生 11.598092559
+茄汁 13.900677652
+官薛昂 12.8020653633
+讹人 12.2912397395
+祖李耳 12.8020653633
+劳动新闻 13.2075304714
+居长安 11.4157710022
+内外 6.98198243296
+团团圆圆 12.5143832909
+闸子 13.2075304714
+工业部长 11.8212361103
+走私犯 12.8020653633
+法老王 13.2075304714
+亿左右 8.83177344976
+高瞻远瞩 10.2117981979
+戚戚君 13.2075304714
+勾缝 12.8020653633
+内夫 11.7034530746
+至小无内 13.900677652
+贴片机 13.900677652
+溶解物 13.2075304714
+州长 9.56994431169
+透水性 10.9562386728
+若真 9.89334446674
+加算 13.900677652
+韩式 11.9547675029
+师西征 11.598092559
+夫妻 7.1241706596
+射线管 11.4157710022
+婺源 10.3743171274
+点算 12.8020653633
+琼浆玉露 13.900677652
+聚合 8.40761620864
+顾问 7.01926634833
+玩到 11.3357282945
+家反宅乱 13.900677652
+朝野上下 10.6818018271
+休戚 11.7034530746
+换头 12.2912397395
+公主岭 11.5027823792
+甘州 9.84023464143
+庄于谐 13.2075304714
+甘川 11.5027823792
+齐天乐 13.2075304714
+韩忠 10.5684731418
+大比拼 12.5143832909
+张鹏翮 12.8020653633
+灵县 12.1089181827
+杨浦区 12.8020653633
+师西归 12.8020653633
+国家民委 11.598092559
+保安器 11.9547675029
+四十三篇 13.2075304714
+加等 13.2075304714
+眼柄 12.8020653633
+百分号 13.900677652
+兰陵笑笑 13.2075304714
+陆健叹 13.2075304714
+塞翁失马 11.8212361103
+属猪 11.8212361103
+加筑 11.7034530746
+桂英 10.5684731418
+六通 13.2075304714
+敲响警钟 10.9049453784
+矿业权 11.598092559
+一些美金 13.900677652
+角落 8.18694484647
+分出层次 13.900677652
+韩德 11.9547675029
+三百余 10.8096351986
+机场路 13.900677652
+胡服骑射 10.9049453784
+历观 12.8020653633
+领进去 13.2075304714
+轮舞 11.9547675029
+秦伯未 13.2075304714
+历览 12.2912397395
+换好 11.0674643079
+韦克斯勒 11.4157710022
+创维集团 11.1926274509
+华籍 12.2912397395
+血肉模糊 10.0088573539
+颏颔 13.2075304714
+佳婿 12.1089181827
+枫桥 11.8212361103
+小凤儿 11.8212361103
+野味十足 13.900677652
+殷王 12.1089181827
+盆栽 10.3171587135
+非法活动 11.1280889297
+轮船 7.82993992397
+桂花 8.98069672615
+实景拍摄 12.2912397395
+文学运动 10.9049453784
+权衡得失 13.2075304714
+三熟制 10.6818018271
+云楼宫 13.2075304714
+耶尔先生 13.2075304714
+私下 8.26232298264
+赵磊 13.900677652
+柠檬 9.36807815882
+甘居 13.2075304714
+故障 8.23771717184
+十滴水 12.2912397395
+消掉 13.2075304714
+单纯性 10.6818018271
+登机牌 11.9547675029
+一家家 11.4157710022
+佛光 10.4994802703
+均是由 11.9547675029
+大肠杆菌 9.87532596124
+构造作用 11.3357282945
+佳宾 13.900677652
+车师王 12.8020653633
+佛典 10.642581114
+原崇信 12.5143832909
+公共交通 9.28555713513
+宋陈师 13.900677652
+缝下来 13.900677652
+佩里 10.3171587135
+住校生 13.900677652
+佳客 12.2912397395
+玉洁冰清 12.5143832909
+统一行动 10.642581114
+抚平 10.7226238216
+张蓉芳 13.2075304714
+清歌曼舞 13.2075304714
+灵剑 13.900677652
+八乡 12.1089181827
+属狗 11.598092559
+灵前 10.1630080337
+高等考试 13.2075304714
+都必领 13.900677652
+换壳 13.900677652
+立体仓库 13.900677652
+波西 13.900677652
+没着没落 11.0674643079
+李提摩太 12.2912397395
+女娘 12.2912397395
+行不更名 12.5143832909
+蛋黄 9.84023464143
+戴起来 12.5143832909
+管理局 8.36334338496
+管理层 7.19994654243
+耍把 13.900677652
+私买 11.8212361103
+孙坚 10.0720362555
+观察家 9.59661255877
+甘尼 13.900677652
+韩币 12.8020653633
+廉正 12.8020653633
+五五开 12.8020653633
+方向向 11.598092559
+知音难觅 13.900677652
+瑶池 10.1394775363
+蛋鸡 11.9547675029
+流星体 10.7226238216
+私了 11.8212361103
+程太太 13.900677652
+私事 9.48183704418
+行金穗 13.2075304714
+内壁 9.28555713513
+名牌商品 13.900677652
+申屠建 12.8020653633
+改装成 10.0505300503
+与我何干 11.7034530746
+宝象国 11.4157710022
+升学率 11.3357282945
+勾绘 12.8020653633
+儿女之情 12.5143832909
+联勤部 13.2075304714
+私交 10.7226238216
+私产 10.1164880181
+流质 10.9049453784
+勾结 8.11378027061
+露点 11.7034530746
+华尼拉 12.5143832909
+秋高马肥 12.1089181827
+灵动 9.98865464655
+热对流 11.4157710022
+局外人 9.91169360541
+速滑赛 13.900677652
+轩兄 12.5143832909
+行政复议 9.49395840471
+言事御 13.2075304714
+消损 13.900677652
+马玉 12.1089181827
+倒插门 11.9547675029
+讹传 11.9547675029
+刘金霞 11.9547675029
+夏神宗 13.2075304714
+谋害 9.63799777493
+内墙 12.1089181827
+嬉戏 9.71102290995
+解宝领 13.900677652
+南运河 10.0088573539
+色香味 10.9562386728
+世说新语 10.9562386728
+肖树 13.2075304714
+聚落类型 13.900677652
+人味儿 11.8212361103
+加税 10.5684731418
+枫树 10.9562386728
+一家子 9.02548032877
+论赞 11.9547675029
+迷濛 11.9547675029
+从这一点 9.91169360541
+刘希尧 10.9562386728
+传奇色彩 10.4666904475
+五加皮 11.598092559
+图像识别 11.9547675029
+韩庄 11.0674643079
+权之治 12.8020653633
+韩庆 13.2075304714
+楼顶 9.33632946051
+高敬亭 13.2075304714
+地形图 9.91169360541
+六道 10.604840786
+轮胎 7.29402746578
+产房 10.9562386728
+续完 12.2912397395
+脂粉 9.20932976975
+章京 9.29550746599
+豺狼 10.2117981979
+素女 12.8020653633
+封印先知 13.2075304714
+房屋结构 12.5143832909
+内存 9.96885201925
+十几分钟 9.65218240993
+佛兰德 9.96885201925
+佳境 11.4157710022
+甘当 10.9049453784
+内子 12.2912397395
+公安工作 12.1089181827
+养家 10.2897597393
+灵儿 12.8020653633
+拒受 12.8020653633
+点种 12.1089181827
+普遍如此 13.900677652
+麦克阿瑟 9.74179456862
+伊吕 12.1089181827
+卡哈 13.900677652
+内学 11.7034530746
+切细 12.5143832909
+吉雷 12.2912397395
+白城地区 11.5027823792
+蒙城县 12.2912397395
+煨汤 13.900677652
+豺狗 11.9547675029
+加租 13.900677652
+不泄气 11.7034530746
+德育处 13.2075304714
+主导性 11.3357282945
+阳春县 12.5143832909
+咬上 12.5143832909
+闵四官 12.1089181827
+再用 8.01457362053
+仲孙 13.2075304714
+眯起 10.0720362555
+改打 13.900677652
+结合处 11.9547675029
+优秀分子 11.8212361103
+牧野 10.8561552143
+亟须 10.3743171274
+怀有异 12.5143832909
+等厚条纹 13.900677652
+见面礼 10.3743171274
+怪癖 10.8096351986
+阿尔及利亚人 11.8212361103
+章动角 13.900677652
+格但斯克 10.8096351986
+吴入蜀 13.900677652
+厂方 10.8096351986
+补课 10.604840786
+夫家 10.4349417492
+食品站 13.900677652
+团拜会 12.8020653633
+年轻美貌 11.3357282945
+再生 8.21709788464
+黄金湖 12.5143832909
+陈国发 10.3743171274
+川航 12.8020653633
+项绍芳 13.2075304714
+栩栩然 13.2075304714
+神鬼莫测 11.9547675029
+大计 8.30969067146
+桐城县 11.9547675029
+求之过急 13.900677652
+谋士 8.91707103027
+甘心 8.15128466607
+三四千万 13.2075304714
+世豪杰 12.5143832909
+警匪片 13.900677652
+良能 12.8020653633
+抚州 10.2630914922
+夫子 10.4349417492
+归结点 13.2075304714
+降格 11.0674643079
+朱舜水 12.5143832909
+干湿度 12.2912397395
+历记 12.2912397395
+领钱 11.1926274509
+祸胎 11.9547675029
+壹一 13.2075304714
+高校教师 12.1089181827
+申贺 13.2075304714
+布勒尼 13.2075304714
+历访 11.5027823792
+民间组织 11.0674643079
+舒淇 11.9547675029
+吴日生 12.2912397395
+抗菌素 10.533381822
+章丘 10.765183436
+归州镇 13.2075304714
+谈艺录 12.1089181827
+溶解烃 13.900677652
+冷丝丝 12.8020653633
+换季 10.8096351986
+内宅 9.58318953844
+一码事 12.1089181827
+电务段 13.2075304714
+草窝 10.4994802703
+玩偶 10.4666904475
+初承元 12.5143832909
+内定 10.8561552143
+川芎 10.3453295905
+铤而走险 9.7898037878
+陈国华 11.7034530746
+从瑷珲 13.2075304714
+内室 10.0088573539
+吉阳 12.8020653633
+点到点 13.2075304714
+内审 13.2075304714
+溶解热 11.9547675029
+腾房 12.8020653633
+黄口孺子 12.2912397395
+内宾 13.900677652
+内容 5.13428337493
+消息 5.03989475617
+常见病 9.66657114738
+内家 10.642581114
+辞色 11.3357282945
+脂类 10.2630914922
+佳妙 12.8020653633
+梅艳芳 12.1089181827
+论辩 10.5684731418
+丘敦氏 13.2075304714
+氢碘酸 11.9547675029
+韩山 13.900677652
+摆脱困境 10.4041700905
+霍费尔 12.8020653633
+防晒品 13.900677652
+斗成 13.2075304714
+筹措 8.73019365694
+煮菜 13.900677652
+二妈 9.6811699468
+任安国 12.5143832909
+陈李 13.900677652
+首左右 13.2075304714
+骤至 11.5027823792
+金钢伞 10.2630914922
+旧书摊 13.2075304714
+跗阳 13.2075304714
+秦震喊 13.900677652
+程太守 11.9547675029
+轩叔 12.5143832909
+鄂尔多斯 9.4233408375
+七十多万件 13.2075304714
+于里昂 12.8020653633
+卓依 13.2075304714
+甘平 12.5143832909
+袭击 7.25949548224
+兰阳溪 12.1089181827
+玩出 11.3357282945
+宜章 12.5143832909
+流过 8.83808261895
+炒米 12.5143832909
+十四文 13.2075304714
+加油添酱 12.5143832909
+狂想 12.2912397395
+贡生出 12.8020653633
+癌肿 11.5027823792
+流进 10.0940151622
+论述 7.37271973435
+马任加 13.900677652
+流连 10.1630080337
+模造 13.900677652
+英安岩 11.9547675029
+云水全 13.2075304714
+王树人 13.900677652
+危须 11.598092559
+闾伐楚 13.2075304714
+史泰龙 13.900677652
+种子 6.90858122456
+加碘 12.8020653633
+南原山 12.8020653633
+塔尔 9.89334446674
+丰州滩 12.2912397395
+形象店 13.900677652
+于华雄 13.900677652
+窃听器 11.0674643079
+多次下 11.598092559
+玩儿 9.33632946051
+川菜 11.0674643079
+风雨剥蚀 11.8212361103
+重言 12.8020653633
+理论战线 13.900677652
+牙髓变性 13.900677652
+刻骨仇恨 11.8212361103
+说实话 7.87965430263
+潘昂霄 13.2075304714
+消愁 11.8212361103
+武延基 13.900677652
+安身乐业 13.900677652
+搪塞 9.48183704418
+精雕细镂 13.900677652
+聚在 10.4041700905
+揽辔中原 13.900677652
+魔方 11.9547675029
+搪塑 13.2075304714
+脖颈 8.83177344976
+续娶 11.5027823792
+位太子 11.9547675029
+嵌体 12.5143832909
+雎鸠 13.900677652
+无懈可击 10.4666904475
+夫婿 10.9049453784
+孙显祖 12.5143832909
+神游 11.0674643079
+语助词 13.900677652
+塞格德 13.2075304714
+没开 10.642581114
+肉包子 11.598092559
+韩岳 13.900677652
+智能水表 13.900677652
+玩兴 13.900677652
+玩具 8.10461990121
+滋味 7.83456956187
+凛然正气 12.5143832909
+吡咯烷酮 13.2075304714
+无私奉献 10.7226238216
+二姨 11.598092559
+和荷珠 12.8020653633
+象鼻子 13.2075304714
+点破 10.2630914922
+习天文 13.2075304714
+加码 9.72629038208
+昏天暗地 13.900677652
+豆萁 13.2075304714
+力系 12.2912397395
+东藏西躲 12.5143832909
+炕桌儿 13.900677652
+日土县 13.2075304714
+流转 8.71889410168
+韩岗 11.9547675029
+煮茧 12.1089181827
+拉蒂诺 13.900677652
+梅达 11.5027823792
+谢俊色 12.8020653633
+撞人案 13.900677652
+解方程 11.5027823792
+无大无小 13.2075304714
+乖顺 12.1089181827
+布莱尔 10.533381822
+郭保山 12.2912397395
+往西 8.93783302172
+煮茶 10.604840786
+轩峻 13.2075304714
+橡皮膏 12.1089181827
+敖秀才 13.2075304714
+阿炳赢 12.8020653633
+蓬头散发 13.900677652
+封孙权 12.5143832909
+整体规划 10.5684731418
+穿旧 12.8020653633
+池田 12.8020653633
+川豆 13.900677652
+块根作物 13.2075304714
+廉明 11.4157710022
+腹地 8.44535653662
+点石 13.900677652
+耐温性 13.900677652
+受害国 11.5027823792
+维奥 13.900677652
+灵异 10.9562386728
+佛山 8.43261751084
+柯察金 11.598092559
+背靠 9.33632946051
+独立思想 13.900677652
+消溶 12.2912397395
+刀械 13.900677652
+小户人家 10.604840786
+沾不上边 13.2075304714
+斯博士 13.900677652
+去任 13.900677652
+麻黄汤 11.7034530746
+波萝 12.8020653633
+范数 12.5143832909
+警官证 12.1089181827
+抱头痛哭 10.4994802703
+边微露 13.900677652
+怒火冲天 13.2075304714
+下任总统 12.8020653633
+佛尔 11.4157710022
+食品科技 13.900677652
+三角债 12.1089181827
+百分之四点 12.8020653633
+雷洪 13.900677652
+编译系统 12.8020653633
+名贵药材 9.94943393339
+苏霍沃 12.8020653633
+讣告 10.642581114
+精彩纷呈 10.533381822
+世界之最 11.0674643079
+诸文武 12.2912397395
+轩岗 12.5143832909
+起锚 11.4157710022
+明叔抱 13.2075304714
+四十几岁 11.4157710022
+佳园 12.8020653633
+梅耶 12.2912397395
+英国皇家芭蕾舞团 12.2912397395
+五五分 11.8212361103
+鼓腮 13.900677652
+又坏了 12.8020653633
+领骑 13.2075304714
+甘凉 12.5143832909
+死缠烂打 12.1089181827
+表显 13.900677652
+提在手上 12.8020653633
+范旃 13.2075304714
+由朝臣 13.2075304714
+真真是 11.3357282945
+玳玳花 13.900677652
+产油 10.9049453784
+王闻 12.8020653633
+小生产者 10.1630080337
+王兆龄 12.2912397395
+打击面 11.9547675029
+莫向人 13.900677652
+益西丹 12.8020653633
+查出来 9.87532596124
+优化结构 10.4666904475
+阶梯教室 12.8020653633
+谋国 10.9049453784
+清谈家 13.900677652
+内紧外松 13.900677652
+游学之 13.2075304714
+咖啡粉 12.8020653633
+方尖碑 12.1089181827
+波蒂 13.900677652
+点着 8.06294720481
+庄汉 13.900677652
+唉唉 10.2897597393
+徐晃部 13.2075304714
+消渴 11.0103058941
+中央银行 8.2985588311
+点睛 11.598092559
+偏到 12.1089181827
+克莱特 13.900677652
+女招待 12.8020653633
+社会学家 8.77671367257
+非意愿 13.900677652
+后勤部长 11.7034530746
+从左到右 11.3357282945
+精算师 11.8212361103
+羽绒制品 12.1089181827
+另请高明 12.5143832909
+三维动画 13.2075304714
+甘军 11.5027823792
+大学部 11.598092559
+华中局 11.598092559
+甘冒 10.765183436
+僻处一隅 13.900677652
+树王 13.2075304714
+没影 10.1164880181
+比慧英 12.5143832909
+卡娅 11.9547675029
+尼国 13.900677652
+恶性案件 11.7034530746
+六神不安 13.2075304714
+铅山 10.7226238216
+锦囊妙计 11.0674643079
+明智 8.97342396682
+撤退 7.46452728361
+撤销原判 11.7034530746
+向美商 13.900677652
+劝善戒恶 13.900677652
+甘冽 12.1089181827
+副主教 13.2075304714
+掩蔽部 11.598092559
+插回 12.8020653633
+缪云台 12.8020653633
+爵士乐队 12.1089181827
+灵帝 9.69598503258
+胸宽 13.900677652
+追求真理 10.9562386728
+天智叔 12.8020653633
+清微淡远 13.900677652
+三五十里 12.5143832909
+轮过 12.2912397395
+甘做 11.9547675029
+川资 12.2912397395
+知疼 13.2075304714
+余天 11.598092559
+唐张太 13.2075304714
+拟话本 11.3357282945
+抚剑 12.2912397395
+消费基金 9.45802639549
+方觉 11.1926274509
+城墙根 11.4157710022
+徒唤奈何 12.8020653633
+地下铁 13.900677652
+玩得 10.0940151622
+核爆炸 9.77354326693
+吉兰泰 11.598092559
+加盖 9.87532596124
+礼拜堂 10.533381822
+加盟 8.65893063692
+卡察 12.5143832909
+陈芳允 12.8020653633
+玩忽 12.8020653633
+谏言 12.5143832909
+川贝 11.9547675029
+记数器 13.900677652
+吉首 11.5027823792
+过程中将 11.0103058941
+问心无愧 10.0940151622
+董福祥 10.4041700905
+卡宴 11.7034530746
+幻出 13.2075304714
+轮辐 12.2912397395
+二天 11.598092559
+特种玻璃 12.1089181827
+国防科技 10.8096351986
+卡宾 11.1280889297
+卡宁 13.2075304714
+绩优 9.25628675283
+渴而掘井 13.900677652
+帕洛 11.8212361103
+内含 9.05649056552
+阿加迪尔 13.2075304714
+节约用水 11.2616203224
+力特 11.8212361103
+另辟蹊径 10.4666904475
+重庆大学 11.0674643079
+非经济 11.4157710022
+产流 11.9547675029
+危险 6.38642299916
+马圭省 13.2075304714
+玩心 13.900677652
+冶金学 10.8561552143
+贾政忙 11.598092559
+雅古布 13.900677652
+若端 12.2912397395
+拐过来 12.8020653633
+尼亚奈 13.2075304714
+重金收买 11.9547675029
+降本 11.7034530746
+设防 9.4233408375
+搞坏 11.8212361103
+讨饶 10.7226238216
+赫仁 13.2075304714
+流脑 12.1089181827
+足心 12.2912397395
+流脓 11.4157710022
+敲得 10.4666904475
+新能源 6.43330658506
+方西 12.5143832909
+讨饭 9.61021821083
+加登 12.1089181827
+走私罪 12.5143832909
+参差不一 13.2075304714
+林肯郡 11.8212361103
+博世 11.4157710022
+芙琳 8.53003962385
+轮轨 13.900677652
+农村党员 11.0103058941
+轮转 10.3171587135
+重力加速 13.900677652
+降服 9.91169360541
+换名 12.8020653633
+国朝诗 12.8020653633
+蒙疆经 13.2075304714
+苍颉 12.8020653633
+没当 11.0674643079
+在职人员 10.6818018271
+危难 9.26594866375
+商肆 12.5143832909
+同饮 11.1926274509
+换向 12.2912397395
+雷斯塔 13.900677652
+求全责备 12.2912397395
+苍颜 12.8020653633
+指挥有方 12.8020653633
+黄相公 11.1280889297
+轮轴 11.4157710022
+玩弄 9.28555713513
+榆皮 13.900677652
+哈尼语 12.5143832909
+殷红 9.93038573842
+洗漱 9.46986085313
+母野利 13.2075304714
+孙傅 11.5027823792
+河流阶地 11.0674643079
+阴阳生 13.2075304714
+半身像 13.2075304714
+懿旨 9.45802639549
+夫君 10.765183436
+英商祥 13.2075304714
+腹围 12.8020653633
+水系格局 13.2075304714
+史天倪 12.8020653633
+嬉游 12.2912397395
+明晓 13.900677652
+在此期间 8.10766404359
+设限 10.9562386728
+可不可能 13.2075304714
+魔教 13.900677652
+诸吕秉 13.2075304714
+天烛峰 13.900677652
+盆地分析 12.8020653633
+子婴 11.8212361103
+死多 13.2075304714
+续命 13.2075304714
+命根子 10.1630080337
+藏垢纳污 13.900677652
+形象化 10.8561552143
+办得到 10.8096351986
+贝虾类 13.900677652
+范权 12.8020653633
+古尔班通古特沙漠 10.8561552143
+相冲突 10.642581114
+文物保护法 12.1089181827
+几十位 11.8212361103
+重孝 11.5027823792
+卡壳 11.1926274509
+消沉 9.56994431169
+韩公 11.8212361103
+管理区 11.0674643079
+比奥科 12.5143832909
+主干道 10.1394775363
+极端负责 13.900677652
+甘南 10.0294766411
+梅思平 12.8020653633
+用作 7.04526885337
+花样不同 13.900677652
+高等动物 9.82314020807
+成景 12.5143832909
+流花 12.8020653633
+商标名 13.900677652
+流芳 10.5684731418
+妒妇 12.5143832909
+彭阳 13.2075304714
+抚养 8.64840422393
+茅台镇 11.598092559
+圣诞夜 11.7034530746
+林大人 11.9547675029
+雅砻江 9.89334446674
+韩兄 13.900677652
+内圈 12.8020653633
+殷素 11.2616203224
+李友听 13.2075304714
+内圆 12.1089181827
+流苏 10.4041700905
+消法 11.598092559
+参考价格 12.1089181827
+四十几度 13.2075304714
+设问 11.3357282945
+蒙古草原 10.4041700905
+佳品 9.71102290995
+二夜 13.900677652
+消泺 13.900677652
+新郎新娘 10.8561552143
+观塘区 13.2075304714
+内在 7.29402746578
+特产品 10.8561552143
+范本 10.1630080337
+居勒尼 12.5143832909
+二多 13.900677652
+商汤之 12.2912397395
+梁赞诺 12.8020653633
+消泯 13.900677652
+内场 12.8020653633
+山汇 11.8212361103
+金瓜石 11.9547675029
+汇报思想 13.900677652
+八册 12.2912397395
+孙爷爷 12.2912397395
+内城 8.89004235788
+杭盼 9.69598503258
+向锡兰 13.2075304714
+孙庞斗智 12.8020653633
+加略 12.5143832909
+云长之 11.598092559
+出国时 12.2912397395
+消气 11.5027823792
+进出港 11.1280889297
+五十只 12.5143832909
+着重号 13.2075304714
+华北电力大学 11.9547675029
+陈国强 11.9547675029
+内埔 13.900677652
+口不应心 13.900677652
+有鼻子有眼儿 13.2075304714
+甘受 11.3357282945
+再移 11.9547675029
+登广告 12.5143832909
+二次大战 10.3171587135
+朱木纳 13.900677652
+杰尔达 13.900677652
+开发储量 13.2075304714
+炒熟 10.604840786
+李刚 10.2371160058
+李信命 13.2075304714
+千平方米 12.5143832909
+卡塔 10.533381822
+狐群狗党 11.0674643079
+必读书 11.7034530746
+谜语 10.0720362555
+梅英 12.2912397395
+斜睨 10.4349417492
+盆景 9.65218240993
+灵川 12.2912397395
+礼拜寺 11.1280889297
+范志军 12.2912397395
+灵州 10.4041700905
+种因 13.2075304714
+阙特勤 12.2912397395
+韩冰 13.2075304714
+铸模 12.1089181827
+印钞 10.4666904475
+原子级 12.8020653633
+英锐 13.2075304714
+点画 11.8212361103
+伯姬 13.900677652
+管理司 11.0674643079
+八位 10.4349417492
+论艺 12.8020653633
+受困者 13.2075304714
+冀六州 12.2912397395
+撑场面 13.900677652
+苯磺酸 12.8020653633
+库夫 12.5143832909
+益州郡 10.2630914922
+火星人 12.5143832909
+荐引 12.2912397395
+方言 7.92686804011
+斜眼 10.2371160058
+李特尔 11.7034530746
+交响乐 9.74179456862
+自给率 10.4666904475
+氢化 9.69598503258
+镇雄 12.8020653633
+方振武 11.9547675029
+灵巧 9.12999302751
+卸得 13.2075304714
+梅花 8.04274449749
+加生 13.2075304714
+侧翻 10.7226238216
+第三阶段 9.35738286971
+鲁能泰山 12.5143832909
+敢死队员 11.5027823792
+中国北方工业公司 11.1280889297
+大钟寺 12.5143832909
+云南铜业 9.82314020807
+晋阳 9.84023464143
+聚宝 12.5143832909
+消消 11.2616203224
+放大率 11.2616203224
+轮距 9.62401153296
+聚酯瓶 13.900677652
+五十五年 10.4666904475
+范晓 12.5143832909
+耍泼 12.5143832909
+管理制 13.900677652
+韩健 13.2075304714
+爬灰 13.2075304714
+范晔 11.4157710022
+表决权 10.3171587135
+学习效果 12.5143832909
+静下来 10.2630914922
+卡姆 11.0674643079
+方证 13.2075304714
+前仰后合 10.4349417492
+陈自强 11.1280889297
+第二汽车制造厂 11.8212361103
+十一二点 13.2075304714
+受表彰 12.1089181827
+吴升半 13.2075304714
+下略 13.2075304714
+一迳 10.3743171274
+流莺 13.2075304714
+联合王国 9.87532596124
+棉鞋 10.2117981979
+用为 11.1280889297
+科格斯 13.900677652
+鼻唇囊肿 13.900677652
+融冰 11.0103058941
+邓贤寨 12.8020653633
+驰名世界 11.0674643079
+降旨 9.94943393339
+罗尼迦 13.2075304714
+形势危急 11.0103058941
+品德高尚 11.5027823792
+耿瑞义 12.8020653633
+梳头发 12.2912397395
+张集 13.900677652
+权之战 13.900677652
+保健食品 10.6818018271
+半决赛 11.1926274509
+梅茨 12.1089181827
+领饷 12.5143832909
+米食 13.2075304714
+用世 12.2912397395
+张来娣 13.900677652
+用上 9.59661255877
+阿瑟尔 13.2075304714
+降旗 10.9562386728
+口试 11.598092559
+晋陕 10.8561552143
+歃血为盟 11.8212361103
+换回 9.87532596124
+片酬 11.1280889297
+汤思 12.8020653633
+客座教授 10.7226238216
+发货人 12.8020653633
+洼地 7.73316116109
+内囊 12.8020653633
+寻见孙 13.900677652
+文学教师 13.2075304714
+仲容 13.2075304714
+佛心 12.1089181827
+旅客列车 11.1280889297
+重叠构象 13.900677652
+炊事 10.3453295905
+骤起 10.3171587135
+累卵之危 11.9547675029
+华尔浦 13.900677652
+内园 13.2075304714
+子娘娘 11.598092559
+大青龙汤 13.2075304714
+炒炒 13.2075304714
+茂兰喀斯特 13.900677652
+马棚 9.94943393339
+力点 12.8020653633
+内因 9.69598503258
+玄集 12.2912397395
+内图 12.5143832909
+灵岩 11.8212361103
+范曾 12.2912397395
+李太白 10.9562386728
+用人 8.40350942668
+浸信会 13.2075304714
+默默地 7.40390266179
+革命主义 13.900677652
+脑子 7.93453091285
+卡夫 10.4994802703
+仲宣 13.900677652
+隔湖相望 13.2075304714
+明查 13.2075304714
+枝枝节节 13.2075304714
+石窟门 13.2075304714
+炒热 11.4157710022
+嫘祖 12.5143832909
+流荡 11.3357282945
+鹏城 13.900677652
+遗情书 13.900677652
+丽莉 12.8020653633
+点球 10.7226238216
+灵峰 11.8212361103
+承式桥 13.900677652
+用事 10.4349417492
+池盐 11.598092559
+靖宇县 11.598092559
+用于 5.28146953515
+阳春市 12.8020653633
+臧浞 12.2912397395
+子孟昶 12.2912397395
+化学工程 10.1871055853
+卡多 13.2075304714
+小李广 10.4994802703
+纽约联合国总部 11.598092559
+信息网 9.7898037878
+内克 10.8561552143
+佛塔 9.40086798165
+内兄 10.9049453784
+居住用地 11.5027823792
+伺机报复 12.5143832909
+加班 9.34680076038
+和承欢 12.8020653633
+路宣抚 12.8020653633
+整台 12.1089181827
+下载安装 13.900677652
+圣泉 11.9547675029
+工厂用电 13.900677652
+续写 10.765183436
+姚氏尚 12.8020653633
+张卫国 13.2075304714
+跃身 12.5143832909
+二个月 11.0103058941
+中共贵州省委 12.8020653633
+原子簇 11.1926274509
+魄户 13.900677652
+焕然一新 9.72629038208
+印鉴 11.9547675029
+永无止境 11.2616203224
+高晓松 13.2075304714
+瑶族 9.65218240993
+灌篮 13.2075304714
+掣肘 9.22784881751
+内典 12.2912397395
+头脑灵活 13.2075304714
+主教练 10.2897597393
+郁达夫 10.9562386728
+五万三千多公里 13.2075304714
+内关 11.598092559
+点玩 13.900677652
+眼外伤 12.2912397395
+涨势 7.77162744192
+连合纤维 13.900677652
+青蛙肉 13.900677652
+权标 12.2912397395
+谋利 10.604840786
+长春园 11.9547675029
+灵子 13.900677652
+唐刘 13.2075304714
+科林伍德 13.900677652
+佛堂 9.94943393339
+背对着 9.62401153296
+推故 11.1926274509
+杜伯秋 13.2075304714
+二点三万 13.900677652
+梅拉腊 12.1089181827
+换出 12.5143832909
+整句 13.900677652
+卡哇伊 13.900677652
+两万步 13.2075304714
+滑翔伞 13.2075304714
+孙大炮 13.2075304714
+闻名全国 9.91169360541
+照明设备 10.4349417492
+创始国 11.5027823792
+谋划 8.36334338496
+紧接着 7.75007488353
+押解到 10.9049453784
+周立波 11.8212361103
+灵学 13.900677652
+准入条件 10.0294766411
+灵宝 9.29550746599
+口传心授 12.8020653633
+灵官 11.1926274509
+伯尼埃 12.8020653633
+独身生活 13.2075304714
+题着 11.5027823792
+通知单 11.2616203224
+不存芥蒂 13.2075304714
+长绒 12.8020653633
+手倒立 13.2075304714
+上千人 10.8096351986
+房产业 12.5143832909
+咖啡碱 11.0103058941
+公学特 13.2075304714
+刚取 13.900677652
+腋芽 11.8212361103
+流萤 11.7034530746
+五素 13.900677652
+普米族 11.4157710022
+旧恩 12.1089181827
+韦后妹 13.2075304714
+古安切 12.5143832909
+国际共产主义运动 10.2371160058
+根本保证 11.1280889297
+党支部 8.90346537821
+佳利 13.900677652
+蜂腰削背 13.900677652
+择校费 11.9547675029
+降成 12.8020653633
+房产主 13.2075304714
+韩城 10.0720362555
+吊嗓子 13.900677652
+三千六百天 13.2075304714
+流落 8.75901409547
+魏围赵 12.8020653633
+灵寝 13.900677652
+换入 13.900677652
+削尖 11.4157710022
+卡带 12.2912397395
+互补色 12.5143832909
+聚居 8.170577869
+涨到 8.73019365694
+自行其是 11.3357282945
+宋乾道 11.9547675029
+索尼埃 13.2075304714
+夏众 12.8020653633
+美国威斯康星大学 11.598092559
+动迁房 13.900677652
+金属纤维 13.900677652
+说不出来 8.43261751084
+席应真 13.2075304714
+若羌 10.0505300503
+灵寿 11.0674643079
+战略性 7.75864024639
+军事素质 12.2912397395
+主战 8.29487558568
+天秤 11.5027823792
+有鉴于此 10.604840786
+安茹伯爵 13.2075304714
+健全人 10.2371160058
+布里索 11.9547675029
+蛋青 13.900677652
+查无此人 13.900677652
+卡帕 11.598092559
+肺原性 12.1089181827
+力矩 9.63799777493
+躐等 13.2075304714
+颀长 10.4349417492
+福寿无疆 13.900677652
+水净化 12.8020653633
+内偏 13.900677652
+两三百年 11.9547675029
+钱德洪 13.2075304714
+大比武 13.2075304714
+惺松 13.2075304714
+玩家 9.01032852375
+过短 11.1280889297
+二三公里 12.8020653633
+宋两军 12.8020653633
+李树德 10.1630080337
+于北燕 13.900677652
+送上去 11.8212361103
+题目 8.31342899358
+枚举法 13.2075304714
+英雄所见略同 11.5027823792
+川西 9.23723855786
+不堪入目 11.598092559
+麦鸡 13.900677652
+玩完 10.765183436
+甘味 13.2075304714
+揍人 13.2075304714
+一十八架 13.2075304714
+六万三千七百一十九亩 13.2075304714
+不耐烦 8.00078029839
+小树林 10.3171587135
+长媳 13.900677652
+消毒 8.30969067146
+跃迁 9.38981814546
+跃过 10.765183436
+烈士暮年 12.1089181827
+跃进 9.69598503258
+身体发肤 12.1089181827
+卡德 12.2912397395
+国际互借 13.2075304714
+方足 12.8020653633
+波腹 13.900677652
+种养 12.5143832909
+点状 10.6818018271
+汕头市 11.0674643079
+方越 9.45802639549
+轮训 12.8020653633
+佛头 11.598092559
+藏传佛教 9.59661255877
+投弹手 13.900677652
+晋鲍敬 13.2075304714
+范性 13.2075304714
+凤祥银 13.2075304714
+瞒不住 10.7226238216
+王锋 13.900677652
+内倾 11.598092559
+管理员 9.54396882529
+片面 8.9102450652
+卡得 11.5027823792
+内债 12.5143832909
+声乐系 11.7034530746
+交通民警 11.0674643079
+长溜儿 13.2075304714
+若续 12.5143832909
+交清 11.2616203224
+降挡 11.9547675029
+驾驶舱 9.17328983326
+搬出来 9.91169360541
+霍尤克 13.900677652
+再续 9.94943393339
+佩饰 11.3357282945
+惊心怵目 13.2075304714
+不无关系 9.74179456862
+灵媒 13.900677652
+小妖怪 12.8020653633
+唐有祺 13.2075304714
+不露痕迹 11.598092559
+父债子还 13.900677652
+都市病 12.8020653633
+续借 13.900677652
+加特 11.7034530746
+碑铭 10.4994802703
+硝酸钠 11.8212361103
+一个样儿 12.2912397395
+没套 13.900677652
+拉开帷幕 9.38981814546
+分管领导 11.5027823792
+剧本创作 11.4157710022
+再经 9.04086524761
+娄氏 12.2912397395
+谋反 8.7245279194
+杨慎幼 13.2075304714
+青蛙腿 13.2075304714
+忍不住 6.61722942322
+谋取 9.26594866375
+女经理 10.6818018271
+郑君里 11.598092559
+封梁国 12.8020653633
+谋变 12.2912397395
+阿格尼 13.2075304714
+涨升 8.65893063692
+俗话说 8.15767446417
+别具手眼 13.900677652
+多排 11.9547675029
+五感 11.7034530746
+结合力 10.9562386728
+燕和北 13.2075304714
+足尖 11.9547675029
+唐张巡 13.900677652
+托举 11.4157710022
+代主席 11.2616203224
+三十八万余 13.2075304714
+角质 9.03314320152
+和德性 12.5143832909
+心如古井 12.8020653633
+孙眉刚 13.900677652
+美髯公 10.4666904475
+召唤 9.22784881751
+福冈市 12.8020653633
+撤销 7.43142733518
+收缩期 11.1280889297
+山术 11.9547675029
+尉健行 11.9547675029
+玄宗令 12.5143832909
+灰鼠皮 10.9562386728
+康乐活动 13.900677652
+睦亲 13.2075304714
+采取相应 9.85762638414
+神经线 12.2912397395
+吉黑 11.4157710022
+鲍鱼之肆 13.2075304714
+辛武贤 13.2075304714
+种别 13.2075304714
+伯奢 13.2075304714
+枣红色 11.598092559
+猪大肠 13.2075304714
+灵夏 12.2912397395
+固定沙丘 10.2897597393
+种到 12.2912397395
+虢国 11.2616203224
+召回 8.73589167805
+素养 9.59661255877
+雄辩家 13.900677652
+换去 12.5143832909
+勾留 11.7034530746
+夷情 12.5143832909
+大学队 13.900677652
+保外就医 12.1089181827
+点燃 7.64109618791
+茅台酒 9.01787572939
+日落西山 11.3357282945
+任我行 12.8020653633
+知晓率 11.7034530746
+榛鸡 11.1926274509
+内卷 12.5143832909
+天赐礼 12.1089181827
+槛车 11.1280889297
+石刻群 13.2075304714
+勾画 10.604840786
+钟灵毓秀 13.2075304714
+吕惠卿 11.2616203224
+内包 13.2075304714
+烂醉 11.2616203224
+斜率 9.94943393339
+测量深度 13.2075304714
+换台 13.2075304714
+拒客 13.900677652
+春风得意 11.0103058941
+嗲地 13.900677652
+内化 11.5027823792
+平方千米 6.11995676586
+暮雨朝云 13.900677652
+沃格特 13.2075304714
+权作 11.5027823792
+无原则 11.7034530746
+叉腰 10.8561552143
+五十四座 13.2075304714
+人员编制 10.3743171274
+杨普雄 13.2075304714
+沙打旺 12.2912397395
+换取 8.24468584116
+换发 10.8561552143
+聂耳 10.7226238216
+总兵力 9.53122979951
+甘地 9.41204128224
+明朗 7.59440236503
+广播节目 11.9547675029
+留意到 10.1630080337
+口服药 11.598092559
+财务收支 11.4157710022
+中国石化集团 11.5027823792
+官督商 10.4041700905
+一下子发 12.8020653633
+泰利斯 11.4157710022
+雪岭 11.5027823792
+撤除 10.533381822
+二两五 12.5143832909
+中国基督教三自爱国运动 13.2075304714
+胴体 11.0674643079
+内参 10.3171587135
+社会活动家 9.87532596124
+所得者 12.5143832909
+夫南 13.2075304714
+内变 12.1089181827
+间苯二甲酸 12.8020653633
+唐北庭 13.2075304714
+程度较高 9.55687223012
+农专 12.8020653633
+增塑剂 10.5684731418
+素净 11.0674643079
+王铸 13.900677652
+龙里 11.1280889297
+涨停 6.45642900248
+管理型 10.3453295905
+刘丽琴 12.5143832909
+江丙坤 13.2075304714
+腹内 9.82314020807
+轮补 13.900677652
+世太平 13.2075304714
+共同进步 12.2912397395
+开苞 13.900677652
+事业团 13.900677652
+鲭鱼 11.9547675029
+改革派 10.5684731418
+苍龙 10.7226238216
+赶不到 11.5027823792
+内史 9.94943393339
+波阳县 12.5143832909
+换卡 13.900677652
+于贤良 13.900677652
+李大帅 13.900677652
+内厅 11.1926274509
+降息 9.32596667347
+世修行 11.1926274509
+万物之灵 11.7034530746
+钎焊 13.2075304714
+萨哈连 12.8020653633
+宝贝疙瘩 12.5143832909
+刘浩 12.2912397395
+缀辑 13.2075304714
+利奥波德 10.7226238216
+危重 9.87532596124
+卡尼 11.7034530746
+点焊 11.9547675029
+李文忠 11.598092559
+眼科医生 11.3357282945
+新疆地区 9.59661255877
+佳偶 10.8561552143
+杭老板 10.4666904475
+五圣山 13.900677652
+凯尔特 10.6818018271
+续卷 12.8020653633
+大权独揽 10.765183436
+老师上课 13.900677652
+卡尔 8.61241062128
+公田藉 13.2075304714
+齐去楚 13.2075304714
+卡尚 13.900677652
+精雕 11.9547675029
+涨出 12.2912397395
+贵德县 13.900677652
+危途 13.900677652
+尼伯龙 12.8020653633
+波茨 13.900677652
+师阐化 12.8020653633
+加热 7.52395070408
+周武王 9.5186510173
+卡巴 11.598092559
+片锁 13.900677652
+陈胜王 12.5143832909
+黑心棉 13.2075304714
+灵堂 9.5186510173
+牢记于心 13.900677652
+楚投汉 12.8020653633
+高名凯 13.2075304714
+宝殿非 13.2075304714
+整副 11.7034530746
+敏感性 9.13850371718
+佛学 9.5186510173
+蒿草 10.0720362555
+干静静 13.2075304714
+布里维 13.900677652
+桂西 11.0103058941
+苏定 11.9547675029
+酸酸乳 13.900677652
+目无尊长 13.2075304714
+萨摩亚群岛 11.598092559
+赶不及 13.900677652
+波荡 13.2075304714
+苍鹭 12.1089181827
+灵塔 10.9049453784
+内分 11.0103058941
+外挂式 13.900677652
+工矿企业 9.40086798165
+刘泽清 9.75754292558
+点点 8.97342396682
+禄食 12.5143832909
+缔造者 10.2897597393
+华尔兹舞 12.5143832909
+苍鹰 10.765183436
+一盘菜 12.8020653633
+二十一万元 13.2075304714
+伯夫 12.8020653633
+加点 10.3171587135
+跟踪服务 11.4157710022
+柴科夫斯基 10.3453295905
+曹福田 12.8020653633
+解除管制 13.900677652
+公主坟 13.2075304714
+金家巷 12.5143832909
+罗海城 9.77354326693
+心静气 11.8212361103
+片长 12.2912397395
+十二分 9.85762638414
+人物描写 12.5143832909
+石秀兄弟 12.5143832909
+竞聘上岗 13.2075304714
+翘曲 13.2075304714
+戮力同心 11.2616203224
+内制 11.9547675029
+保全申请 12.8020653633
+点火 8.41588071849
+点灯 9.37888907493
+明哲端 13.900677652
+谷昌平 13.2075304714
+石膏像 11.5027823792
+搜集 8.06294720481
+鱼跃龙门 12.8020653633
+换到 10.6818018271
+樊稠 11.598092559
+刘洎 12.2912397395
+灵境 12.8020653633
+内勒 12.8020653633
+马达里 13.900677652
+靠得住 9.58318953844
+卷上 11.0103058941
+粗墩墩 13.900677652
+平等观 12.5143832909
+触犯 8.89004235788
+圣诞岛 12.2912397395
+中共陕西省委 13.2075304714
+私带 13.2075304714
+伊奥尼亚海 12.1089181827
+松果体素 13.900677652
+紧压茶 11.3357282945
+烂透 13.2075304714
+腋臭 13.2075304714
+埃德蒙顿 12.2912397395
+内力 10.4349417492
+踟蹰不前 13.2075304714
+中高层 11.8212361103
+林木业 12.8020653633
+严密性 11.3357282945
+苍黄 11.598092559
+五百多封 13.2075304714
+组组长 9.94943393339
+佛家 9.96885201925
+束手 11.1280889297
+防病毒 12.8020653633
+内务 9.82314020807
+背阴 10.7226238216
+穷开心 13.2075304714
+下楼来 9.94943393339
+有鼻子有眼 11.4157710022
+救助款 13.900677652
+苍黑 11.8212361103
+立体广告 13.900677652
+难不成 10.4041700905
+郝员外 11.8212361103
+路宣慰 12.2912397395
+信口开合 12.8020653633
+应允 9.02548032877
+跃起 9.61021821083
+肥冬瘦年 13.2075304714
+保成 13.900677652
+袭夺 11.2616203224
+麒麟区 13.2075304714
+白茶 10.4666904475
+封卫国 12.5143832909
+前怕狼后怕虎 11.1280889297
+浓硫酸 9.96885201925
+铸造件 12.8020653633
+席卷全国 10.7226238216
+亚非 9.4233408375
+但少安 11.2616203224
+文殊兰 13.900677652
+打通关 13.900677652
+看轻 10.8096351986
+校场 9.72629038208
+尤佳 10.7226238216
+瓷缸 12.1089181827
+公共课 13.900677652
+城下之盟 11.4157710022
+文殊寺 13.2075304714
+男同胞 12.8020653633
+永久充填 13.900677652
+谈到 7.30489713801
+魔法 10.2117981979
+闭月羞花 12.2912397395
+工具车 13.2075304714
+高矗 13.900677652
+白茅 11.0103058941
+以作 10.4666904475
+太郎 10.604840786
+精神食粮 12.2912397395
+十三元 12.2912397395
+自动绘图 13.900677652
+幸赖 11.1280889297
+鸽子笼 12.2912397395
+谈判 6.39793944122
+兴味索然 12.1089181827
+蓄意 9.35738286971
+第六十四回 12.2912397395
+凸镜 12.8020653633
+猛进 11.1280889297
+篮球 9.61021821083
+成材 10.604840786
+套圈 12.5143832909
+六七十米 13.2075304714
+胜过 8.98069672615
+值日 11.1926274509
+婉词 13.2075304714
+通俗易懂 10.2117981979
+白药 12.1089181827
+瓦努阿图 10.9049453784
+校址 9.89334446674
+正反馈 12.1089181827
+赵灵 12.8020653633
+追回 10.0505300503
+黄色炸药 11.9547675029
+熏火腿 13.2075304714
+胜迹 10.1394775363
+可穿 11.598092559
+下世纪初 12.1089181827
+幻视 11.3357282945
+瓷罐 10.8096351986
+满肚子 10.7226238216
+幻觉 8.84443184663
+人工成本 10.4349417492
+白草 11.1280889297
+余平方米 11.598092559
+曹禺戏剧文学奖 13.900677652
+白莲 10.0088573539
+圆柱形 8.83808261895
+掌厨 13.2075304714
+配售 7.26341962069
+洛博斯 13.2075304714
+童贯才 12.5143832909
+伍联德 13.900677652
+茸茸 11.2616203224
+上甘岭战役 11.5027823792
+配唱 12.2912397395
+质量关 12.1089181827
+引火 10.2630914922
+圣礼 12.1089181827
+赵炅 11.4157710022
+校工 11.7034530746
+躁进 13.900677652
+压腿 12.8020653633
+仲勉 13.2075304714
+褶裥 12.5143832909
+不畅 8.40761620864
+修宪 12.5143832909
+打地铺 12.2912397395
+看过 7.32003851469
+炎炎 11.1280889297
+信用放款 12.8020653633
+不畏 9.84023464143
+半地穴式 10.8096351986
+卡塞姆 13.900677652
+曲成团 13.900677652
+豪华车 9.38981814546
+桃源县 12.1089181827
+赵萍萍 13.2075304714
+王懿荣 12.1089181827
+不顾死活 11.3357282945
+不留 8.48903160012
+对笔 13.2075304714
+福乐 11.9547675029
+福中 11.9547675029
+依赖 6.96433491614
+炎热 8.15447446144
+三反 11.7034530746
+不缩 13.2075304714
+圣祠 12.8020653633
+套型 12.2912397395
+不用 6.00897299265
+偏南 9.5062284973
+以便 6.68396816527
+刚够 11.598092559
+不由 7.73736284794
+透疹 11.9547675029
+抓下来 12.8020653633
+古鉴 12.2912397395
+福临 7.36109169636
+不远千里 11.4157710022
+上级部门 10.7226238216
+辞讼 12.5143832909
+白菜 9.00283785202
+彭俐侬 12.8020653633
+无风三尺浪 13.900677652
+说明性 12.8020653633
+辞让 12.1089181827
+霍普夫 13.2075304714
+刚夹 13.900677652
+以供 9.04086524761
+不甜 11.2616203224
+战斗群 10.8096351986
+贺宜 12.5143832909
+不甘 8.90346537821
+对策 8.00078029839
+足坛 9.69598503258
+威严地 9.96885201925
+棉兰老 11.8212361103
+搀杂着 13.900677652
+民办科技 13.900677652
+禹王庙 12.5143832909
+挤入 10.765183436
+劣性 12.5143832909
+莱斯特 11.4157710022
+格里特 13.2075304714
+仲升 13.2075304714
+豆豆 9.37888907493
+森鸥外 12.1089181827
+豆豉 10.8096351986
+仲华 10.9049453784
+顶梁柱 10.533381822
+徐晃领 12.8020653633
+可笑 8.07173203437
+指起 13.900677652
+晋杜预 13.2075304714
+千里姻缘一线牵 12.2912397395
+楼道 9.53122979951
+七连冠 13.900677652
+以久 13.2075304714
+警卫团 11.0674643079
+李可 10.4349417492
+如用 9.48183704418
+身中数枪 13.2075304714
+太重 8.70218062071
+一刀两段 12.5143832909
+半数左右 12.8020653633
+利泽门 12.8020653633
+太空飞行 12.2912397395
+挤兑 10.765183436
+徐晃飞 13.2075304714
+边州军 12.1089181827
+薛子斌 13.2075304714
+张择端 11.0103058941
+赵普胜 11.8212361103
+搞得 12.2912397395
+尤为 7.53077666915
+破成 11.8212361103
+以为 5.54977520028
+宜兴人 11.2616203224
+化油器 11.8212361103
+文仲容 11.3357282945
+李大亮 13.2075304714
+灌点 13.900677652
+对立 7.60910851242
+酬谢 9.69598503258
+清苑县 12.1089181827
+以上 4.5452850083
+色彩鲜明 10.765183436
+灭灯 11.1280889297
+征服者 9.06439574502
+灭火 9.21854642485
+数十万吨 12.1089181827
+以东 7.21856905453
+垂直带 9.53122979951
+江格尔 11.5027823792
+四片 11.1280889297
+后援团 13.900677652
+莱齐耶 13.900677652
+骄傲自满 11.598092559
+龙川王 12.5143832909
+白芷 10.2630914922
+白花 9.40086798165
+联合党 10.9562386728
+伴食 13.2075304714
+白芽 13.2075304714
+尘心 12.8020653633
+湖上 9.13850371718
+尤以 7.35245854921
+唯我论 12.8020653633
+张方佐 13.2075304714
+优盘 12.8020653633
+尚普兰 12.2912397395
+挤出 8.3555002075
+季戊四醇 11.7034530746
+燕群 13.2075304714
+可算 9.58318953844
+婉言 10.9562386728
+王猷定 13.2075304714
+向威廉 12.8020653633
+白芨 11.8212361103
+十一门 13.900677652
+冷汗直流 12.2912397395
+固始 10.8096351986
+哈姆 10.765183436
+噌噌 12.8020653633
+历是存 13.2075304714
+配合 6.33178198857
+临考 13.900677652
+巡航导弹 8.61241062128
+段思平 11.8212361103
+白芍 10.2897597393
+随侍在侧 13.900677652
+福体 13.900677652
+十一间 12.2912397395
+赵建中 13.900677652
+旧病复发 11.4157710022
+白英 13.900677652
+几千几百 13.900677652
+赵燕 12.8020653633
+汝之力 13.2075304714
+医务处 13.900677652
+校园 8.52539924429
+中共中央政治局常委会 13.2075304714
+谈及 8.65893063692
+四海之内皆兄弟 12.8020653633
+刮胡子 11.2616203224
+关怀备至 11.7034530746
+潮土 10.533381822
+峨嵋派 13.2075304714
+敕书 9.94943393339
+水彩画家 13.900677652
+红赤赤 13.900677652
+以于 12.5143832909
+死党 10.0294766411
+语文课 11.1926274509
+南四环 12.1089181827
+技术改造 8.47572763449
+笑谈 10.1630080337
+死光 10.765183436
+坦克 6.64791523392
+比比 10.533381822
+合作金库 12.5143832909
+死劲 11.7034530746
+爪蟾 12.8020653633
+俳优 11.4157710022
+滞纳金 11.0674643079
+宝授真 13.2075304714
+不短 10.3743171274
+开年以来 13.900677652
+白脸 10.4349417492
+伪证罪 13.2075304714
+助记符 13.900677652
+男人装 13.2075304714
+将于 6.53676415057
+陈被举 13.2075304714
+死力 10.765183436
+时间表 8.27666014579
+赵爷 13.900677652
+总后方 12.8020653633
+桑布 12.8020653633
+配型 11.9547675029
+透着 9.15574552361
+蕉岭 11.598092559
+笑过 10.5684731418
+液力传动 12.2912397395
+弓着 11.4157710022
+白脉 11.3357282945
+第五十四章 11.598092559
+三角学 11.0674643079
+刚完 12.2912397395
+盖帽儿 13.900677652
+魏大统 11.8212361103
+群雄逐鹿 12.1089181827
+看货 12.2912397395
+颤颤巍巍 10.9049453784
+病毒血症 13.2075304714
+象形文 13.900677652
+依违 11.8212361103
+尘封 10.8561552143
+白腹 10.9049453784
+古郡 12.1089181827
+文经武纬 13.900677652
+古都 9.03314320152
+优生 10.6818018271
+刚定 12.1089181827
+蜈蚣 8.20023407859
+对称 7.37858485381
+康宝莱 11.4157710022
+库托坎 11.1280889297
+生日舞会 13.900677652
+挤到 9.58318953844
+配基 12.1089181827
+猛跳 11.0674643079
+自寻短见 11.3357282945
+双面胶 13.2075304714
+李叔 13.900677652
+宁蒗彝族自治县 13.2075304714
+阿布罗斯 12.5143832909
+进见 10.8096351986
+相去甚远 10.1394775363
+将令 8.57766767284
+溶洞 8.76487921493
+福利费 10.8096351986
+普莱 12.2912397395
+惯用手法 12.1089181827
+水立方 13.2075304714
+寸步不离 10.4994802703
+大农场 12.1089181827
+狗咬 10.4666904475
+风中残烛 13.2075304714
+泄密 10.642581114
+不睬 10.4666904475
+值机 12.2912397395
+杀退 9.74179456862
+铅垂 11.8212361103
+桑干 12.5143832909
+死别 11.4157710022
+弓矢 10.1871055853
+呱唧 13.900677652
+怀俄明州 12.1089181827
+宁夏回族自治区 9.20019728618
+雷波 12.2912397395
+中点站 13.2075304714
+死刑 8.34384959028
+不着 9.62401153296
+不像话 10.2371160058
+倒春寒 11.4157710022
+看跌 9.94943393339
+街子 11.8212361103
+胆颤 11.9547675029
+胜败 8.93783302172
+安清帮 13.900677652
+冒血 12.1089181827
+幸运 8.01457362053
+尉耿夔 12.5143832909
+经义进士 12.2912397395
+尊颜 10.3743171274
+将乐 13.2075304714
+誓为 11.5027823792
+泄完 13.900677652
+八块钱 13.2075304714
+收权 13.2075304714
+江总书记 13.2075304714
+林徽因 13.900677652
+小娘子 10.2117981979
+额喇克 13.2075304714
+丁点儿 12.5143832909
+旧雨新知 12.8020653633
+过眼 10.9562386728
+兰斯敦 12.8020653633
+潮向 13.900677652
+关胜勒 13.2075304714
+龙绣凤 13.900677652
+的确 6.48731031628
+赵凯球 11.7034530746
+格洛夫 12.8020653633
+近海航运 13.2075304714
+刘涛 10.8096351986
+联合制 11.7034530746
+镇暴 13.900677652
+不看 8.65365357982
+孔四贞 11.9547675029
+王府镇 13.2075304714
+十八般兵器 11.598092559
+唐古文 13.2075304714
+不真 10.3171587135
+引爆 8.70772080109
+古道 9.91169360541
+死前 10.3453295905
+帽子戏法 12.2912397395
+由立克 13.2075304714
+死去 7.39638947844
+五十五岁 11.1926274509
+刚嫁 12.8020653633
+挤占 10.1630080337
+李宫裁 11.1926274509
+白龙庙 11.598092559
+辞行 9.85762638414
+缠绵悱恻 11.8212361103
+第五十四篇 13.2075304714
+顺理成章 9.32596667347
+不相 10.1164880181
+须得海 13.900677652
+单笔石 12.8020653633
+十一面 12.8020653633
+师师可 12.1089181827
+校名 12.2912397395
+笸箩 10.9049453784
+运回去 11.9547675029
+未来主义 10.765183436
+至理名言 11.3357282945
+四体不勤 13.2075304714
+指桑说槐 13.2075304714
+三台 9.71102290995
+性骚扰 12.8020653633
+即成 9.77354326693
+宝天曼 12.2912397395
+数百万两 13.2075304714
+数百万个 12.5143832909
+三分钟 10.1164880181
+瓜棚 12.8020653633
+真金 10.3453295905
+湿润气候 8.9519177616
+枯藤 11.0674643079
+绿豆汤 10.9562386728
+中国专利 12.8020653633
+配图 13.2075304714
+源源不绝 11.4157710022
+正交系 13.2075304714
+古里 10.4666904475
+这台 9.5186510173
+深得人心 11.7034530746
+不为人知 10.0720362555
+中国现代文学馆 12.2912397395
+庚午元 12.8020653633
+时代性 11.598092559
+速度感 11.598092559
+萨克迪纳 12.1089181827
+害人者 13.2075304714
+戎幕策 13.2075304714
+十岁时 12.5143832909
+死友 13.900677652
+出售方 12.5143832909
+木垒哈萨克自治县 13.2075304714
+凡纳明 12.8020653633
+炎黄艺术馆 12.8020653633
+谈入 13.900677652
+多态 12.2912397395
+吴为能 12.2912397395
+碳酸酐酶 12.5143832909
+超负荷 10.604840786
+伊利诺伊大学 11.5027823792
+死区 12.2912397395
+将会 5.92442570823
+不知悔改 13.2075304714
+库容 8.98069672615
+一万四千 13.2075304714
+亚铜 12.5143832909
+小球员 13.2075304714
+高清晰度电视 11.598092559
+秦州 10.4349417492
+赵王 10.3453295905
+冷冷清清 9.94943393339
+氨解 12.2912397395
+赵率 13.900677652
+指迷 9.05649056552
+国彰德 13.2075304714
+利息费用 12.1089181827
+迪图瓦 12.8020653633
+绿豆沙 13.900677652
+主流线 13.2075304714
+丁腈橡胶 11.598092559
+骨坏死 13.2075304714
+文具盒 13.2075304714
+心理特征 11.0103058941
+白肉 10.8096351986
+安德纽 13.900677652
+将佐 9.20932976975
+远日点 12.8020653633
+虞候和 12.2912397395
+数百万亩 12.8020653633
+号召 7.54283538547
+号叫 11.1926274509
+配器 10.4041700905
+滑稽剧 12.1089181827
+可租 13.900677652
+压舱 12.5143832909
+五帝 10.0088573539
+挤去 12.1089181827
+魏孝庄 13.2075304714
+镶牙 11.4157710022
+果酱瓶 13.900677652
+福至心灵 13.2075304714
+刘好礼 12.5143832909
+如知 13.2075304714
+白胖 11.7034530746
+固守 8.56313957227
+挤压 8.25170341381
+司马懿闻 13.2075304714
+白胜 9.61021821083
+国际主义者 13.900677652
+幔帐 12.5143832909
+灰指甲 13.900677652
+贝纳通 13.2075304714
+固定 6.16743200545
+仲冬 12.1089181827
+刚娶 13.900677652
+孤伶伶 12.5143832909
+肃然 9.30555780184
+可称 10.1630080337
+莫雷亚斯 13.2075304714
+中国社科院 9.04864738806
+从俊武 13.2075304714
+半湿润 9.29550746599
+十一遍 13.900677652
+透照 13.900677652
+供应品 11.2616203224
+代西魏 13.2075304714
+希律 12.8020653633
+黄罗销 13.2075304714
+白蜡 9.93038573842
+追加 7.43764819506
+阅读写作 13.2075304714
+校医 11.9547675029
+校区 9.75754292558
+固山 11.5027823792
+摄去 10.765183436
+真难 10.3743171274
+斩首示众 10.6818018271
+利辛 13.2075304714
+古隆 12.5143832909
+汉城大学 12.5143832909
+刚巧 11.9547675029
+魔棒 12.2912397395
+结脉 11.9547675029
+竟如 10.9562386728
+卖淫案 11.4157710022
+莫泊桑 10.765183436
+套印 11.3357282945
+牛庚 13.2075304714
+维尼龙 13.900677652
+三十几号 13.2075304714
+桉叶油 13.2075304714
+配军 10.604840786
+错义 13.900677652
+君主主义 12.8020653633
+白蝶 13.2075304714
+虚渺 13.900677652
+水解酶 10.9049453784
+势阱 13.900677652
+金霉素 12.2912397395
+帅印 12.1089181827
+没用到 13.900677652
+二十四种 12.8020653633
+背道而驰 9.91169360541
+赵瑁 13.900677652
+花荣挺 12.2912397395
+太钢 10.2897597393
+胜诉 9.80633308975
+冷敷法 13.900677652
+躲躲藏藏 11.5027823792
+牛刀小试 13.2075304714
+霍奇森 12.5143832909
+孺子婴 12.2912397395
+古雅 10.5684731418
+开现场会 13.900677652
+如火 10.0294766411
+铁力县 13.900677652
+先读 13.2075304714
+错乱 9.93038573842
+两百里 11.9547675029
+不熟 9.29550746599
+王韶 12.5143832909
+错事 10.4041700905
+冯永生 13.2075304714
+十一郎 13.900677652
+第二十一次 11.9547675029
+郑公子 12.1089181827
+督令 13.900677652
+套取 10.2630914922
+认证标志 13.900677652
+纷纷扰扰 12.5143832909
+黄段子 12.5143832909
+垂直起落 12.5143832909
+娱乐网 13.900677652
+鼓荡 10.2630914922
+楼门 10.5684731418
+通缉 9.5062284973
+承租者 13.900677652
+十一部 12.8020653633
+冰红茶 13.900677652
+套叠 11.7034530746
+棋锋 13.2075304714
+空心球 13.900677652
+脚底板 11.2616203224
+杨素工 12.8020653633
+潮剧 12.1089181827
+缓释 11.1280889297
+大规 12.8020653633
+交泰 10.4041700905
+鹅毛扇 12.8020653633
+死后 7.1083332245
+功能完善 12.1089181827
+单打一 13.2075304714
+朋党论 13.2075304714
+号哭 10.8096351986
+红色盲 13.900677652
+死命 9.5062284973
+不然 7.27794132803
+内掌柜 13.900677652
+古陶 13.900677652
+格洛弗 13.900677652
+连接性 13.900677652
+如烟 10.8096351986
+半八度 12.1089181827
+夏家和 13.2075304714
+纳拉扬 12.8020653633
+积食 12.5143832909
+滴沥 12.2912397395
+相基体 13.2075304714
+龙岩市 11.7034530746
+古陆 9.91169360541
+未见得 11.4157710022
+校友 10.8561552143
+东台市 11.8212361103
+韵味 9.48183704418
+石牛溪 13.2075304714
+受话人 13.900677652
+婉转 9.07236391467
+真险 12.8020653633
+哲蚌寺 10.765183436
+策动者 13.900677652
+王尚书 12.1089181827
+引理 11.598092559
+夏侯霸 10.4994802703
+哈格斯 12.2912397395
+不烦 10.6818018271
+宜温阳 12.8020653633
+不热 9.34680076038
+对红 12.1089181827
+不胫而走 10.4666904475
+以礼相待 10.3171587135
+追去 10.2371160058
+检察队伍 13.900677652
+巴西人 11.3357282945
+错会 11.9547675029
+足协 9.46986085313
+对线 13.2075304714
+可编 13.2075304714
+生物学家 9.5062284973
+龙纹尊 13.2075304714
+骗出来 12.2912397395
+昏惨惨 12.2912397395
+山东省政府 11.9547675029
+山岳冰川 10.533381822
+校刊 10.9562386728
+唐山大兄 13.900677652
+大豪杰 13.900677652
+今日要闻 11.9547675029
+警卫局 13.2075304714
+时间轴 12.1089181827
+滴汗 13.900677652
+感激涕零 10.3171587135
+砍瓜切菜 12.5143832909
+梳毛机 12.8020653633
+一年期 8.9102450652
+第三十四回 12.1089181827
+搞定 10.2897597393
+错位 9.6811699468
+白虾 11.4157710022
+白虹 11.5027823792
+二婚头 12.8020653633
+三十多亩 12.8020653633
+搞完 11.5027823792
+组装厂 10.7226238216
+古韵 11.0103058941
+不点 10.765183436
+古音 10.2371160058
+卡塞尔 12.1089181827
+临死前 9.38981814546
+霍婆子 9.03314320152
+对练 11.2616203224
+狗吠 11.0103058941
+追叙 12.5143832909
+套利 7.74794495727
+巴塔维 13.2075304714
+遗传疾病 12.5143832909
+尤斯特 12.8020653633
+套到 11.8212361103
+白虎 9.63799777493
+交响乐团 9.19114745066
+校务 10.4041700905
+哈利逊 12.8020653633
+透热 12.5143832909
+太长 8.99540287354
+普及率 10.3171587135
+就学年龄 13.900677652
+禹王宫 12.5143832909
+供应商 7.78921031247
+博仪 12.8020653633
+足取 13.900677652
+白龙堆 12.2912397395
+不灵 9.29550746599
+广雅书局 13.2075304714
+立决 11.8212361103
+客房部 12.2912397395
+登记日 8.4284069783
+兮兮 10.533381822
+督促 8.45825994145
+叶卵状 12.8020653633
+嘉肴美馔 13.900677652
+白蚁 9.66657114738
+督俞 13.900677652
+瓷窑 10.3171587135
+宣布免除 13.2075304714
+尘寰 11.7034530746
+系统目录 13.900677652
+校办 11.8212361103
+田同耕 13.900677652
+第三十六回 11.9547675029
+配角奖 11.598092559
+白蛾 13.2075304714
+引申 9.87532596124
+如燕 13.2075304714
+三十多个 10.604840786
+古典文学 9.4233408375
+引用 7.17204903889
+指要 11.2616203224
+犀牛 9.43476953332
+戴安邦 13.2075304714
+白蛮 11.7034530746
+哈朗辅 13.2075304714
+闪过 8.44109213783
+革命道路 10.4349417492
+马拉巴尔 11.7034530746
+芮季 13.2075304714
+干隆 10.0088573539
+有形资产 11.8212361103
+炎症 8.10461990121
+白蛇 10.765183436
+咬耳朵 11.9547675029
+刷墙 12.8020653633
+校勘 9.26594866375
+相关器 13.900677652
+杀人如麻 10.642581114
+白蛉 11.8212361103
+超凡入圣 12.5143832909
+盐山县 13.900677652
+垂下来 10.2371160058
+后援军 12.8020653633
+水波荡漾 13.2075304714
+奴隶主 8.71889410168
+刑禁勒 13.2075304714
+推托之词 13.900677652
+谈吐 10.1164880181
+马裕藻 13.900677652
+突击性 12.1089181827
+托买 13.900677652
+谢家泽 13.2075304714
+化学能 9.77354326693
+辞赋 10.3171587135
+楼面 10.2897597393
+所有制 8.3555002075
+搞脏 13.900677652
+阳邵江 13.2075304714
+细菌性痢疾 11.7034530746
+老大徒伤 12.5143832909
+上海医科大学 13.2075304714
+古钱 11.2616203224
+理财产品 7.56739802384
+联合国 6.84191949946
+苇草 12.2912397395
+九世纪 12.2912397395
+笑话 7.68807155622
+犯疑 11.2616203224
+口若悬河 10.9049453784
+古钟 13.2075304714
+依计 10.2897597393
+三角形 8.0229418702
+足健 13.900677652
+无业人员 12.5143832909
+太难 9.75754292558
+铅华 11.7034530746
+钢棒 13.900677652
+精确测量 11.5027823792
+于政制 13.900677652
+不玩 11.8212361103
+掌声雷动 13.2075304714
+田汉写 13.2075304714
+配号 10.8561552143
+死因 9.89334446674
+得过且过 11.1926274509
+潘美削 13.2075304714
+潘美前 13.2075304714
+皂荚 11.4157710022
+二十四篇 12.1089181827
+七一下子 13.2075304714
+朱家江山 12.8020653633
+系出名门 13.2075304714
+死囚 10.4666904475
+畜牧时代 13.900677652
+质量型 11.8212361103
+搞啥 13.900677652
+古铜 10.5684731418
+批示 8.85082164473
+配发 10.4041700905
+杭州市政府 13.900677652
+雌伏 13.2075304714
+巨幼样 13.2075304714
+防雨布 12.8020653633
+铅印 10.8561552143
+默多克 11.1280889297
+遮光 11.7034530746
+近于零 10.0720362555
+主审官 12.5143832909
+公开审理 11.3357282945
+天外有天 11.8212361103
+名声大噪 11.7034530746
+点头称是 10.1394775363
+从定仙 13.2075304714
+业务局 13.900677652
+追债 12.5143832909
+总统府 8.98802276624
+科技界 10.2630914922
+偷汉子 12.5143832909
+滑稽地 12.8020653633
+白薯 10.9562386728
+于津梁 13.900677652
+亚金 13.2075304714
+宋兆霖 13.900677652
+履职 11.1926274509
+咬咬牙 9.89334446674
+校内 10.3453295905
+看视 10.1630080337
+灌着 12.8020653633
+幔子 11.9547675029
+飞过来 10.765183436
+白薇 11.9547675029
+鸿鹄之志 12.8020653633
+可胜者 13.2075304714
+套出 12.8020653633
+背前面后 12.8020653633
+太阿 12.5143832909
+百花洲文艺出版社 13.900677652
+太阴 9.87532596124
+追偿 10.765183436
+埃曼 12.8020653633
+太阳 6.22791975533
+白藤 11.3357282945
+幸许 12.1089181827
+中电集团 13.2075304714
+教育科 12.8020653633
+泄得 13.900677652
+寻求 7.1060910711
+网络通信 10.8096351986
+赵盾 11.9547675029
+校准 10.765183436
+李家湾 13.900677652
+发乎情 13.900677652
+焙烤 12.2912397395
+焙烧 10.3453295905
+八出 12.8020653633
+刘德华 10.8561552143
+原大清 13.2075304714
+帕塔克森 13.900677652
+布吕恩 12.5143832909
+刚强 9.53122979951
+兴之所至 11.1926274509
+太阁 13.900677652
+药剂科 13.2075304714
+少管闲事 12.5143832909
+配平 12.8020653633
+不独 10.7226238216
+看表 9.7898037878
+圣约 13.2075304714
+李作同 13.2075304714
+水平沟 13.2075304714
+供销 9.20932976975
+汗青 11.8212361103
+主流程 13.900677652
+厦门大学 9.96885201925
+哥儿俩 9.94943393339
+白头发 11.4157710022
+穿来 13.900677652
+大后年 13.900677652
+不狂 12.8020653633
+童贯早 12.8020653633
+子禹阳 13.900677652
+奸党 10.4349417492
+瓷砖 10.7226238216
+玛格雷 13.2075304714
+高球 11.8212361103
+铅制 12.8020653633
+活火山 9.96885201925
+猛袭 12.5143832909
+宿迁市 11.1280889297
+彩色 7.89679058487
+急进派 13.900677652
+不犯 10.0720362555
+核污染 12.8020653633
+克豪森 13.900677652
+二千亿颗 13.2075304714
+追击 8.46259834305
+一百三十万两 13.900677652
+好一朵 12.5143832909
+相互影响 8.71889410168
+久病成医 13.900677652
+西美昂 13.2075304714
+郝萌 11.9547675029
+三角帆 12.1089181827
+钢梁 10.4349417492
+触网 13.2075304714
+一审判决 9.6811699468
+圣经 8.27305653829
+抽起来 11.1280889297
+刚度 9.85762638414
+水火棍 10.3171587135
+登记本 13.2075304714
+打字室 12.8020653633
+缺口处 11.1926274509
+脸色苍白 9.53122979951
+叙永 11.8212361103
+没轻没重 11.9547675029
+楼阁 9.18217878068
+辞谢 10.4666904475
+刘延庆 9.35738286971
+死城 11.5027823792
+三角带 13.2075304714
+斥之为 11.4157710022
+死地 9.49395840471
+昨夜 7.75434839431
+冲浪板 13.2075304714
+杀人偿命 12.2912397395
+李密败 12.8020653633
+如玉 9.69598503258
+一个七八岁 12.5143832909
+配制 9.06439574502
+白纹羽 13.900677652
+配到 11.8212361103
+勒贝尔 12.1089181827
+枕戈待命 13.900677652
+南冲 13.2075304714
+不特 12.1089181827
+地址变换 12.8020653633
+硅酸根 12.8020653633
+指说 12.2912397395
+搞好 8.57766767284
+穷愁 13.2075304714
+仇真人 13.900677652
+一目十行 11.9547675029
+号型 11.9547675029
+千万头 13.900677652
+瓷碗 10.0505300503
+建设项目 8.21370229564
+汉口站 12.2912397395
+宇航服 11.8212361103
+哑口无言 10.1630080337
+降妖除魔 13.900677652
+水上警察 12.8020653633
+全羊席 12.5143832909
+盆腔炎 10.8096351986
+粗放经营 11.3357282945
+引着 8.61241062128
+挤垮 12.8020653633
+棋院 12.2912397395
+菲力浦 12.2912397395
+试用装 13.900677652
+应召者 12.5143832909
+天河区 10.642581114
+规划设计 9.71102290995
+张金定 12.1089181827
+锦衣 9.27570483869
+弓状 12.8020653633
+追入 10.8561552143
+不爱 8.34771806705
+周子昆 12.2912397395
+坦坦 13.2075304714
+煞住 10.9049453784
+不爽 10.2371160058
+常异交 13.2075304714
+司之议 13.2075304714
+马军拴 13.2075304714
+从业人员 8.30225569298
+机场灯标 13.900677652
+关卡税 13.900677652
+王庆成 12.1089181827
+空间体系 13.900677652
+古镇 9.6811699468
+搞头 12.5143832909
+闹灾荒 12.8020653633
+亚那 11.0674643079
+笑言 11.0674643079
+古镜 9.23723855786
+指认 10.5684731418
+杏仁露 12.8020653633
+第十三章 9.84023464143
+保卫国家 10.4349417492
+空身 12.8020653633
+四十多辆 13.2075304714
+代帝陵 12.8020653633
+肃立 8.99540287354
+铜管乐器 11.598092559
+意见者 12.5143832909
+富丽华 12.8020653633
+狞笑 10.8096351986
+伯林 12.2912397395
+能者多劳 12.8020653633
+我部 11.5027823792
+亚齐 11.4157710022
+钾肥 9.65218240993
+私立学校 10.3171587135
+咬伤 9.46986085313
+雍容典雅 12.8020653633
+泄入 10.642581114
+全文如下 10.6818018271
+遵照指示 13.2075304714
+铁饭碗 11.1280889297
+刚出 9.82314020807
+意大利里拉 12.8020653633
+然则 10.4349417492
+白头峰 12.8020653633
+埃尔伯 13.2075304714
+可爱 7.61841090508
+应社友 13.2075304714
+赵硕 13.2075304714
+职工福利 11.598092559
+炖上 12.8020653633
+互相攻击 11.598092559
+李富春 11.9547675029
+感到悔恨 13.2075304714
+舶来品 12.2912397395
+死士 11.5027823792
+执行主席 10.6818018271
+蒙恩顾 13.2075304714
+外存储器 12.2912397395
+米德湖 13.2075304714
+陈良宇 13.900677652
+靠墙 9.96885201925
+粒粒 12.8020653633
+个人简历 11.598092559
+豆蔻 11.1280889297
+张金吾 13.2075304714
+礼泉 11.7034530746
+郭样正 12.8020653633
+生命诚可贵 13.900677652
+须纳复 13.2075304714
+包围圈 9.84023464143
+一百亿年 13.2075304714
+牛郎星 11.1280889297
+刮胡刀 12.5143832909
+眼睫毛 10.1871055853
+太顺 12.8020653633
+白讲 13.900677652
+二百三十余条 13.2075304714
+触点 11.0674643079
+份儿 9.82314020807
+套子 10.533381822
+普洱哈尼族彝族自治县 13.2075304714
+肃穆 8.85082164473
+发动革命 11.9547675029
+三两层 13.2075304714
+乌脸 11.7034530746
+唐鸿 12.5143832909
+校徽 12.5143832909
+连祖宗 13.2075304714
+卢卡诺夫 13.900677652
+有害无利 13.2075304714
+分子生物 12.8020653633
+亚俱罗 12.2912397395
+已达成 10.3171587135
+参拜者 13.900677652
+质量奖 10.0940151622
+泄出 11.7034530746
+班行礼 12.2912397395
+瓜挠 13.900677652
+近日点 10.765183436
+白头山 10.604840786
+氨苄 12.8020653633
+阁老 10.3171587135
+白说 10.8096351986
+古马 13.900677652
+优美 7.72273353793
+第二十一条 12.2912397395
+灭种 11.9547675029
+粗帆布 13.900677652
+不累 10.533381822
+足底 10.9562386728
+藁城 11.4157710022
+套得 12.1089181827
+滴漏 11.598092559
+成稀汁 13.2075304714
+号声 11.5027823792
+白语 12.1089181827
+汗颜 10.7226238216
+读书会 12.8020653633
+塔克拉玛干大沙漠 12.8020653633
+胡茬子 12.8020653633
+白诗 12.8020653633
+真驹 13.900677652
+孙刘 12.5143832909
+白话 9.77354326693
+尘嚣 11.8212361103
+有根有据 12.1089181827
+智有谋 13.2075304714
+外门 12.2912397395
+二十四番 11.5027823792
+计算器 10.0294766411
+风暴潮 10.7226238216
+豆薯 11.8212361103
+椎骨 11.0103058941
+结构域 13.900677652
+仲子 13.900677652
+千余件 12.1089181827
+那修真 13.900677652
+铅封 13.900677652
+橙黄 10.6818018271
+历仕刘 13.2075304714
+平均化 9.35738286971
+劣根 12.2912397395
+号头 13.900677652
+掷铁饼 12.5143832909
+尚无纤 13.2075304714
+挤奶 11.0103058941
+上下调整 12.5143832909
+堵着 11.8212361103
+四百八十元 13.2075304714
+营养器官 11.3357282945
+压裂 12.8020653633
+满人 9.5062284973
+九届全国人大常委会 12.8020653633
+自惭形秽 10.8096351986
+滴滴 9.84023464143
+引种 9.12999302751
+号外 12.2912397395
+锦橙 11.598092559
+十一项 13.2075304714
+追征 12.1089181827
+君辱臣死 13.2075304714
+李欣 11.1926274509
+法律意识 10.8561552143
+消防队员 10.4041700905
+追念 11.5027823792
+桥名 12.8020653633
+滴溜 11.7034530746
+药材店 12.8020653633
+左军青 13.900677652
+芮城 11.3357282945
+肥力高 11.5027823792
+足弓 12.5143832909
+骨子里 9.00283785202
+丁民 12.2912397395
+东台县 12.8020653633
+小琉球 13.2075304714
+椎髻 12.8020653633
+前悬架 12.2912397395
+尘土 8.80692745117
+王国藩 13.2075304714
+花刺子模 12.2912397395
+安帝元 13.2075304714
+俄罗斯国防部 12.2912397395
+萨沙便 13.2075304714
+泯灭 10.642581114
+班子成员 11.1280889297
+车八岭 12.8020653633
+故又称 8.1641053545
+笑蒙 12.8020653633
+海峡两岸关系协会 11.9547675029
+计重 12.8020653633
+棋风 11.8212361103
+计量 8.37124856446
+塔外 13.900677652
+赵祯 11.598092559
+追忆 10.1630080337
+搞垮 10.5684731418
+拓荒 11.9547675029
+来来来 10.604840786
+牛儿苗 12.1089181827
+读书人 8.50705010562
+服务设施 10.3171587135
+谈定 12.2912397395
+克洛斯 13.900677652
+申请报告 10.6818018271
+明杨 13.2075304714
+尘埃 8.45825994145
+太饱 11.5027823792
+隐踪 13.900677652
+赵福 12.5143832909
+差下 11.8212361103
+谈完 10.2371160058
+全年收入 11.0674643079
+书卷气 11.5027823792
+棉花套子 12.1089181827
+黄金海岸 10.4041700905
+活体解剖 12.2912397395
+国师若 13.900677652
+种子岛 13.2075304714
+赵禹 12.2912397395
+闻汉中 13.2075304714
+校庆 10.7226238216
+刚健 10.1394775363
+全党同志 12.8020653633
+中西关系 13.2075304714
+梦语 13.900677652
+三百下 13.900677652
+剧评 12.1089181827
+少者 10.1630080337
+发生爆炸 9.84023464143
+咬人 10.5684731418
+扒犁 13.900677652
+圣火 12.1089181827
+透骨草 12.8020653633
+五弟 11.9547675029
+供应处 12.1089181827
+铁力市 12.2912397395
+自卖自夸 13.900677652
+计酬 13.900677652
+波澜壮阔 10.0505300503
+燕小乙 12.8020653633
+构词法 11.8212361103
+犬儒学派 12.8020653633
+千余个 12.8020653633
+张真人 12.1089181827
+猛虎 9.31571017331
+圣灵 10.604840786
+霞飞路 12.2912397395
+流亡海外 11.4157710022
+仲家 12.2912397395
+淹灌 12.8020653633
+尘垢 11.7034530746
+西周时代 11.9547675029
+优级 11.3357282945
+桑加尔 13.2075304714
+杭汉见 12.1089181827
+梁敬帝 11.9547675029
+千余万 13.2075304714
+瓷盒 13.900677652
+关了门 10.0505300503
+亚麻 8.9102450652
+奸徒 12.2912397395
+教导有方 13.900677652
+配属 10.0294766411
+钱某 11.7034530746
+卫太太 12.2912397395
+瓷盘 11.8212361103
+几大块 12.1089181827
+分段进行 12.5143832909
+尽责任 13.900677652
+二峰 12.5143832909
+各尽其责 12.2912397395
+法制网 13.2075304714
+梁安僖 13.2075304714
+一百四十余户 13.2075304714
+脑壳 8.92394390956
+俩一眼 13.900677652
+梦话 10.9049453784
+坛子 9.91169360541
+腔子 10.4041700905
+韦大哥 11.8212361103
+钙镁磷肥 12.2912397395
+莲菜 13.900677652
+瓷画 13.900677652
+国内贸易 10.4666904475
+圣王 11.1926274509
+反相 12.5143832909
+太高 8.03989142851
+平均值 8.50251495046
+单身公寓 13.2075304714
+光交联 13.900677652
+汗马 12.1089181827
+局数 13.2075304714
+海金砂 12.8020653633
+念珠菌性 11.8212361103
+配得 10.4994802703
+苏卡乔 13.2075304714
+铅弹 12.1089181827
+哈希姆 12.2912397395
+树皮 8.18694484647
+总统制 9.72629038208
+夏侯尚 11.2616203224
+克洛普 12.2912397395
+别巷 13.2075304714
+异乎寻常 9.84023464143
+仫佬族 11.1926274509
+似是而非 10.1630080337
+芟除 11.8212361103
+蓄洪 10.5684731418
+结拜兄弟 10.9049453784
+趣闻轶事 13.2075304714
+绳愆纠谬 13.900677652
+哈姆丹 13.2075304714
+李典 10.0088573539
+三角区 11.0103058941
+仪文 11.9547675029
+不羁 10.1630080337
+天天开心 11.598092559
+斩仓 11.8212361103
+套绳 11.7034530746
+放空炮 11.1280889297
+割下去 13.900677652
+修三司 12.8020653633
+慷慨捐生 12.8020653633
+中央大学 9.01787572939
+刚去 11.9547675029
+飞龙 9.69598503258
+翘辫子 13.2075304714
+马上马 13.900677652
+历仕八 13.2075304714
+焙粉 13.2075304714
+后皆召 13.2075304714
+布特列 12.2912397395
+尔萨 12.5143832909
+德沃德 13.900677652
+谢抚台 13.900677652
+追尾 10.642581114
+多指 10.1871055853
+对焦 13.2075304714
+鲁迅公园 12.5143832909
+马特奥 13.2075304714
+英姿勃勃 11.9547675029
+义务教育 8.63281949291
+魏宫薄 13.2075304714
+搐动 12.8020653633
+业务水平 10.533381822
+并发症 8.63798746307
+滴流 11.8212361103
+狮门 13.2075304714
+伴游 13.2075304714
+如约 10.2117981979
+对焊 13.2075304714
+说得上 10.8561552143
+颜延之 11.9547675029
+武训 12.2912397395
+改道 8.9102450652
+斩下 12.5143832909
+穷气 12.5143832909
+追封 10.2371160058
+一千箱 13.2075304714
+可点 12.8020653633
+格里科 13.900677652
+奇谈 12.2912397395
+宿儒黄 13.2075304714
+马武 12.1089181827
+如织 11.7034530746
+报复陷害 12.8020653633
+呢绒 9.96885201925
+仇家 10.2897597393
+美国务院 12.8020653633
+编写教材 12.2912397395
+对照 8.26232298264
+进身 10.7226238216
+虼蚤 11.5027823792
+有借有还 13.2075304714
+来而不往非礼也 11.4157710022
+达成谅解 13.2075304714
+足岁 13.2075304714
+传声器 11.3357282945
+新丰县 13.900677652
+斯捷罗 12.5143832909
+不缺 9.22784881751
+童非 12.8020653633
+少儿不宜 12.5143832909
+东南亚地区 9.87532596124
+串通一气 11.2616203224
+王雄 12.2912397395
+小九卿 13.2075304714
+穷汉 10.6818018271
+次郎 11.1926274509
+泄去 13.900677652
+不缝 12.2912397395
+褶裙 11.7034530746
+两国关系 9.06439574502
+胡奋 12.8020653633
+辞聘 13.900677652
+不祥 8.47133202302
+供餐 13.900677652
+强制执行 9.37888907493
+真香 10.7226238216
+明来 13.2075304714
+刚勇 11.9547675029
+半懂不懂 12.1089181827
+西泠印社 11.1926274509
+痛骂一顿 12.2912397395
+如缕 12.2912397395
+借款方 12.2912397395
+辞职 7.63727938938
+潮州 9.40086798165
+不听话 10.0088573539
+玖艘 12.8020653633
+篮网 12.5143832909
+鲜嫩嫩 13.900677652
+英国广播电台 12.8020653633
+挑眼 13.2075304714
+瓷球 13.900677652
+校射 11.4157710022
+妊娠期 8.96620371885
+捉摸不透 10.9562386728
+校尉 8.64840422393
+不经 9.09665660724
+领会到 11.598092559
+数十万年 12.5143832909
+科顺天 13.2075304714
+忍耻偷生 13.900677652
+谈天 10.642581114
+滴泪 10.0720362555
+滴注 12.1089181827
+法制科 13.900677652
+不绝 8.27305653829
+靠外 12.1089181827
+死守 8.71329184614
+不给 8.45825994145
+倏忽之间 12.5143832909
+不约 11.9547675029
+朱逖先 13.2075304714
+沙蒿 11.598092559
+蚌珠 10.8561552143
+三大差别 13.900677652
+白边 11.7034530746
+不纯 10.3171587135
+赵策 12.5143832909
+弄脏了 10.6818018271
+刚办 13.900677652
+天主教会 9.31571017331
+白衣 8.99540287354
+通心阳 12.8020653633
+别利伯爵 12.8020653633
+仲夏 11.1926274509
+漏出去 12.5143832909
+白衫 12.1089181827
+二百五十名 12.8020653633
+独具只眼 13.900677652
+护理员 11.9547675029
+谈好 10.9049453784
+赖嬷嬷 12.5143832909
+丛礁 12.5143832909
+夏威夷 9.08039608637
+巴黎圣母院 10.6818018271
+聚一聚 11.5027823792
+白血 13.900677652
+号子 9.98865464655
+下子 12.1089181827
+固化 10.0088573539
+本方 9.87532596124
+刚劲 10.4349417492
+登记法 13.2075304714
+英姿勃发 12.8020653633
+梁丘赐 13.2075304714
+配带 11.9547675029
+论持久战 11.2616203224
+晾晾 12.8020653633
+唐光启 12.2912397395
+突尼斯人 12.2912397395
+叙情 12.8020653633
+奸巧 13.900677652
+两不误 11.9547675029
+一九七四年 13.2075304714
+圣父 11.1926274509
+寻兆鹏 13.2075304714
+标记牌 13.900677652
+第五十六回 12.2912397395
+官架子 12.2912397395
+不繁 13.900677652
+魔杖 12.5143832909
+足已 13.2075304714
+晾晒 10.2117981979
+欲晓 11.9547675029
+红太阳集团 11.7034530746
+呼兰镇 13.2075304714
+裘盛戎 11.598092559
+施利芬 11.8212361103
+白袍 10.8561552143
+鸵鸟政策 12.5143832909
+圣诞快乐 12.8020653633
+谈妥 10.604840786
+冷古丁 12.5143832909
+对火 12.5143832909
+七百八十二万三千两 13.900677652
+可燃 10.2371160058
+斯奇提 13.900677652
+瓷瓶 10.1630080337
+千枚岩 10.0720362555
+刚刚 5.78366356424
+嫌人 13.2075304714
+红薯面 13.2075304714
+颠颠倒倒 13.2075304714
+一心一意 9.46986085313
+关胜寨 13.2075304714
+可供执行 13.2075304714
+梁丘贺 13.2075304714
+滴水 9.6811699468
+二封 12.1089181827
+白裙 12.1089181827
+心痛定 12.8020653633
+固原 9.80633308975
+保卫人员 11.5027823792
+陈林展 13.900677652
+刚到 8.74162235276
+夏令营 10.5684731418
+豆腐 7.86280673205
+桑田之 13.2075304714
+优等 11.1926274509
+计算力 13.900677652
+重弹老调 13.900677652
+于刀剑 13.2075304714
+瓜果 8.98802276624
+压路 13.900677652
+地铁票 13.900677652
+平高球 13.2075304714
+好些 7.79143006921
+津巴布韦共和国 12.8020653633
+穆太公 11.598092559
+金俊海 10.2897597393
+不移 10.3453295905
+瓜架 13.2075304714
+劳师父 13.2075304714
+浑然天成 11.4157710022
+仲平 10.533381822
+于乐毅 12.8020653633
+类粘蛋白 13.900677652
+中央顾问委员会 10.4666904475
+二分院 13.2075304714
+一个八九十岁 13.900677652
+今鲁 13.2075304714
+凹透镜 11.3357282945
+针砭时弊 11.0674643079
+魏策 13.2075304714
+无障碍 10.604840786
+郭常之 13.2075304714
+不少次 12.8020653633
+朱越莉 13.2075304714
+摇尾巴 12.1089181827
+巴林左旗 10.9049453784
+尽情欢乐 13.900677652
+剃着 12.2912397395
+自然通风 12.2912397395
+马良奏 13.900677652
+拊掌 11.4157710022
+于清初 11.8212361103
+看茶 11.3357282945
+青灯古佛 12.1089181827
+计银 12.2912397395
+行业龙头 8.83808261895
+布特哈 11.8212361103
+不离 8.87023973058
+不禁 6.5111136983
+本无 10.4349417492
+位置图 13.900677652
+有先帝 13.900677652
+坏掉 11.8212361103
+数十万头 12.8020653633
+气体 6.57487014938
+农学系 12.5143832909
+个人奖 13.2075304714
+甲鱼 9.93038573842
+鸭绿江 8.85725253506
+眼泪汪汪 9.96885201925
+依臣 10.9562386728
+肉果 12.5143832909
+外长 9.44633035572
+阳交 13.2075304714
+滕云汉 11.8212361103
+十二亿五千余万两 13.2075304714
+圆满结束 10.5684731418
+成高格 13.900677652
+幸臣 12.1089181827
+死尸 8.44535653662
+坦尼 13.900677652
+类木行星 12.8020653633
+气侯 10.4994802703
+傻瓜相机 13.900677652
+对眼 11.3357282945
+小玩艺儿 12.1089181827
+她家 8.61747392324
+配备 7.36980002425
+昆阳 10.4666904475
+流露出 8.34384959028
+隐身法 11.5027823792
+介休 10.9049453784
+战斗班 13.2075304714
+气疯 11.9547675029
+校官 10.0720362555
+校定 11.598092559
+施陶丁 12.1089181827
+三十辆 13.2075304714
+压货 13.900677652
+皮包骨 13.900677652
+淮城镇 12.5143832909
+笑脸 8.55834340001
+菲力普 13.2075304714
+阳世 11.0674643079
+四百余起 13.2075304714
+球状物 12.2912397395
+拉力赛 11.3357282945
+好鞋 13.900677652
+陈良弼 12.1089181827
+洋车夫 13.900677652
+成效 7.6781013839
+国际共运 12.2912397395
+阳丹 11.7034530746
+仲康 12.1089181827
+走投无路 9.25628675283
+佟家姐姐 13.900677652
+搞到 10.4994802703
+魔怔 12.5143832909
+文理科 10.9049453784
+普贤 10.4994802703
+田俊荣 13.900677652
+介体 12.8020653633
+群情愤慨 13.2075304714
+配套 7.16134102462
+死局 13.2075304714
+嗽血 13.900677652
+阴经行 13.900677652
+魔怪 12.1089181827
+蔡州城 12.5143832909
+气促 10.9049453784
+侯薛汴 12.2912397395
+于清华 10.9049453784
+范阳 9.89334446674
+关意权 13.2075304714
+玄德教 11.9547675029
+可看 10.0505300503
+触电 9.61021821083
+真龙 11.1926274509
+吉林路 13.900677652
+采去 12.2912397395
+野三坡 12.1089181827
+杂集 11.9547675029
+巴斯蒂亚 13.900677652
+校对 10.642581114
+莲子心 12.5143832909
+摆酒席 12.1089181827
+边下 13.900677652
+代天抚 11.7034530746
+谈开 11.9547675029
+斯加夫 12.8020653633
+亚马 12.5143832909
+二十四点 13.2075304714
+十六万九千四百三十一亩 13.2075304714
+三十辑 13.2075304714
+望尔 13.900677652
+黄宾虹 11.2616203224
+介于 7.65651075131
+持续性 7.82993992397
+赵累 12.1089181827
+相关度 10.9049453784
+程瑶田 12.8020653633
+古龙 11.7034530746
+阳信 13.900677652
+将有助 12.1089181827
+逆向行驶 12.8020653633
+耕作制度 10.9562386728
+潮安 11.5027823792
+小浪底 11.3357282945
+死巷 13.900677652
+金前线 12.8020653633
+懔然 13.2075304714
+婴儿车 12.5143832909
+方卓芬 13.2075304714
+对比色 12.8020653633
+追寻 9.5062284973
+胡姬 12.8020653633
+开缺 11.5027823792
+帕尼奥尔 13.2075304714
+多媒体数据库 13.2075304714
+好一派 11.8212361103
+戊酸 13.900677652
+如神 10.533381822
+脱缰野马 13.2075304714
+成就感 10.6818018271
+瓷片 10.3171587135
+手五里 13.900677652
+小鹰号 13.2075304714
+卢米埃尔 11.8212361103
+商务楼 13.2075304714
+幸而 8.50251495046
+不碍 10.9049453784
+光洋 11.4157710022
+羊儿风 13.2075304714
+蕉叶 11.5027823792
+春和景明 13.900677652
+功高望重 13.900677652
+一贯制 11.2616203224
+颠沛 11.5027823792
+蓄水 8.9308643524
+五岁 9.20019728618
+孙子兵法 9.75754292558
+波矢量 13.900677652
+南宇兄 12.8020653633
+鲍叔牙 12.5143832909
+气人 11.4157710022
+布斯塔尼 13.2075304714
+谈得 9.4233408375
+双重领导 11.0103058941
+蔬菜园艺 12.2912397395
+热情帮助 13.2075304714
+幸能 13.2075304714
+不置一词 12.2912397395
+褶边 13.900677652
+金尼阁 12.1089181827
+分时系统 13.2075304714
+江华县 12.8020653633
+古鼎 11.3357282945
+淹留 11.598092559
+高官显贵 13.2075304714
+步军司 11.9547675029
+经营方式 9.94943393339
+连三接二 13.900677652
+脱口而出 9.29550746599
+气井 12.5143832909
+差人 8.05713323494
+怪象 11.3357282945
+优良作风 12.1089181827
+戊酯 11.8212361103
+市中心区 9.77354326693
+有多强 12.5143832909
+鄢懋卿 13.900677652
+科研课题 12.2912397395
+托来山 12.2912397395
+质而不野 13.900677652
+熊廷弼 11.0103058941
+阳伞 11.8212361103
+角度观察 12.1089181827
+宛子城 12.2912397395
+不破 9.53122979951
+看花 10.9049453784
+禹王台 10.3453295905
+对白 10.4349417492
+仲征 13.2075304714
+于权宜 13.900677652
+谈心 9.94943393339
+穷死 12.5143832909
+金丝柳 13.900677652
+成方圆 12.5143832909
+寻主母 13.900677652
+黎明前 9.85762638414
+以人为本 9.43476953332
+向可旺 12.8020653633
+可知 7.92432674268
+触痛 11.1926274509
+介乎 9.6811699468
+小事化了 11.8212361103
+空洞无物 12.2912397395
+缓颊 12.5143832909
+休养院 13.900677652
+人工牙 12.8020653633
+米哈伊洛夫 11.8212361103
+白贵 13.900677652
+气举 13.2075304714
+真鲜 12.5143832909
+返销 12.1089181827
+吴黎平 12.1089181827
+瑶草琪花 12.8020653633
+压迫 7.63537643924
+豆荚 11.0674643079
+白费 10.0294766411
+行险徼幸 13.900677652
+套套 11.3357282945
+柳条制品 13.900677652
+毛小狗 12.8020653633
+看腻 12.1089181827
+引火焚身 13.900677652
+遗传工程学 12.8020653633
+白质 10.8096351986
+梅里纳 12.2912397395
+压过 11.1280889297
+程序运行 12.1089181827
+真鲷 11.9547675029
+太黑 11.5027823792
+然后 4.80732063549
+古鲁 11.598092559
+进进 13.2075304714
+压近 13.900677652
+西尔维亚 13.2075304714
+唐兀 12.1089181827
+校外 10.4666904475
+潮声 11.4157710022
+加强监督 10.9049453784
+小体 10.8561552143
+引线 9.98865464655
+不管 5.78336519037
+虚有其表 12.8020653633
+夺位 10.7226238216
+小传 10.2630914922
+丹麦政府 11.598092559
+文件袋 12.8020653633
+别有滋味 13.900677652
+素未谋面 12.5143832909
+铅字 11.0103058941
+配对 9.69598503258
+须臾不离 12.2912397395
+瓜时 13.900677652
+建造师 12.5143832909
+小伍 13.900677652
+太阳队 11.7034530746
+准生证 11.7034530746
+三角地 11.7034530746
+挤身于 13.900677652
+对症 8.94485059437
+花鸟画家 13.900677652
+小伟 11.7034530746
+史论家 12.8020653633
+不算 6.91503583434
+套头 11.9547675029
+小会 11.0674643079
+小伙 9.56994431169
+小众 10.6818018271
+简约型 13.900677652
+类同 10.1164880181
+七八十里 11.598092559
+搞反 13.900677652
+追堵 13.2075304714
+小修 11.598092559
+连茶清 13.2075304714
+份地 10.9049453784
+娱乐界 11.598092559
+优种 12.1089181827
+七十卷 12.5143832909
+优秀 6.78347214881
+高能耗 10.1630080337
+豆菜 13.900677652
+正反面 11.598092559
+我院 13.2075304714
+冠冕堂皇 9.89334446674
+欧阳玄 12.5143832909
+三角城 12.8020653633
+乡镇企业 9.55687223012
+教学材料 13.2075304714
+蜂鸟 10.9562386728
+压载 11.5027823792
+履行 7.11509000697
+共赴国难 11.4157710022
+辞藻 10.7226238216
+洛扎诺 13.2075304714
+坦帕 11.2616203224
+泼妇 10.2371160058
+凶魔 12.5143832909
+司坊官 13.2075304714
+昌源河 12.2912397395
+叙旧 10.604840786
+赵纲 13.2075304714
+阜宁县 13.2075304714
+郭药师 8.41173992582
+心脏麻痹 13.2075304714
+魔手 13.2075304714
+对生 9.21854642485
+坐位 10.0088573539
+小侯 13.2075304714
+伊利埃斯库 12.1089181827
+白守礼 12.8020653633
+不符 8.79473217808
+夏家店 11.7034530746
+乔里乔 13.2075304714
+白消安 13.900677652
+警卫处 13.900677652
+不笨 11.7034530746
+叙文 12.8020653633
+小便 8.96620371885
+值此 9.94943393339
+色彩斑斓 10.642581114
+指节 11.9547675029
+弓箭 8.41173992582
+天突穴 13.900677652
+进考场 11.8212361103
+触目 10.4994802703
+那苗 13.2075304714
+王阳 12.5143832909
+赵绾 13.900677652
+白跑 11.5027823792
+镇江人 12.2912397395
+最起码 9.35738286971
+魔戒 13.2075304714
+大祚荣 11.7034530746
+软体部 13.900677652
+楼龄 12.8020653633
+水土资源 10.9562386728
+不笑 9.84023464143
+配子 9.94943393339
+州里 12.5143832909
+趾高气扬 10.3171587135
+交活 13.900677652
+试用者 11.4157710022
+马特峰 13.900677652
+蕉农 12.2912397395
+不竭 11.0103058941
+祝枝山 11.8212361103
+不端 11.1926274509
+一鼻子灰 11.0103058941
+萍踪浪迹 12.5143832909
+新生代 8.53470163695
+宋时有 12.2912397395
+二十八岁 10.9562386728
+汽油机 9.59661255877
+透空 11.7034530746
+韵律 9.53122979951
+扎花 13.900677652
+篮筐 11.2616203224
+拔出 8.31718134319
+鼓皮 12.5143832909
+好会 12.1089181827
+世居 9.93038573842
+艾伦级 12.5143832909
+搞出 10.765183436
+八思巴 10.1871055853
+死得 8.94485059437
+小义 12.1089181827
+可用 6.60020483771
+瓦格宁 13.900677652
+坚强意志 11.5027823792
+王叔英 13.900677652
+练之士 13.2075304714
+拉选票 13.2075304714
+一百八十八天 13.2075304714
+提回去 12.8020653633
+谈崩 12.2912397395
+军委主席 11.7034530746
+小乙 10.9562386728
+小乘 9.59661255877
+气上 11.9547675029
+小乔 11.3357282945
+宓牟煌 13.2075304714
+可由 8.30225569298
+小乐 10.9049453784
+可畏 10.5684731418
+奸夫 10.4994802703
+足够 6.5801506897
+大学女生 12.8020653633
+纳卡州 13.900677652
+麒麟山 12.1089181827
+司卢镗 12.8020653633
+太行山区 10.7226238216
+王阁 13.900677652
+职业高中 12.5143832909
+医学院校 12.2912397395
+第三十六届 11.8212361103
+死忠 12.1089181827
+白象 11.0103058941
+一一二 10.765183436
+次长 9.85762638414
+粗面岩 11.2616203224
+眼底病 11.7034530746
+境外游 12.5143832909
+挤弄 13.900677652
+君临天下 12.1089181827
+挤开 12.8020653633
+丽珠集团 10.1164880181
+死心 9.91169360541
+魔掌 11.7034530746
+小东 11.9547675029
+侍臣闻 13.900677652
+小丘 10.3743171274
+清点人数 11.9547675029
+超级 7.59257921047
+小丑 10.3171587135
+盖盖儿 13.900677652
+打小算盘 12.8020653633
+天梯 11.1926274509
+零件图 13.2075304714
+铬酸钾 12.8020653633
+小令 10.6818018271
+心细如发 11.3357282945
+北京十月文艺出版社 12.8020653633
+胜者 10.2117981979
+谢先帝 13.2075304714
+九十八个 13.2075304714
+罅漏 13.2075304714
+曲棍 13.2075304714
+小件 10.6818018271
+不穿 10.0940151622
+可疑 8.78268383956
+仲巴 13.900677652
+科技类 10.3743171274
+固城 11.598092559
+无挂无碍 12.8020653633
+萨尔温江 11.2616203224
+五千余名 13.900677652
+贾琏方 12.8020653633
+夏斗寅 12.5143832909
+小仆 13.900677652
+黄腹角雉 10.4994802703
+钢渣 12.1089181827
+中心原子 11.0674643079
+我非 10.642581114
+纷纷议论 9.75754292558
+小付 13.900677652
+小仗 12.2912397395
+电子警察 13.900677652
+小仓 11.598092559
+踯躅 11.1926274509
+小亮 13.900677652
+班行章 12.8020653633
+纤维长度 12.5143832909
+小产 11.9547675029
+仲弘 13.2075304714
+该病 9.08039608637
+汉学者 13.900677652
+中华人民共和国国防部 12.8020653633
+小人 7.22233553732
+不稳 8.28390655431
+伏首 13.900677652
+灭绝 8.87023973058
+峰顶 9.48183704418
+马泉河 12.2912397395
+申呈本 12.8020653633
+死当 12.5143832909
+小于 7.00905175492
+小二 10.8561552143
+小事 7.88696249593
+国际制裁 12.1089181827
+韦后之 11.2616203224
+路淮宁 13.2075304714
+豆芽 10.5684731418
+小演员 13.900677652
+附生植物 10.765183436
+托斯卡纳区 13.900677652
+小些 10.4666904475
+小亚 11.0103058941
+坐上 8.96620371885
+坐下 6.17932903936
+小井 11.7034530746
+小五 12.8020653633
+潮头 10.8561552143
+童贯派 12.8020653633
+小云 12.2912397395
+不日 9.0884932966
+坐凳 13.900677652
+塞瑟布尔 13.900677652
+普里 10.4349417492
+不无 8.59737274392
+那怒晴 12.8020653633
+猛龙 11.0674643079
+飒沓 13.900677652
+不早 9.05649056552
+潇洒不羁 13.900677652
+房产 7.33823355828
+小兽 10.4994802703
+不时 7.22107846613
+福建 6.67519617919
+司马元显 12.1089181827
+楼宴聚 12.8020653633
+小兵 10.3453295905
+恩加拉 13.900677652
+小关 12.1089181827
+看船 12.1089181827
+葛贤 13.2075304714
+小兰 10.3743171274
+粘多糖 12.2912397395
+小光 13.900677652
+气化 9.32596667347
+太胖 11.8212361103
+主流派 11.598092559
+国际宇航科学院 12.2912397395
+看齐 10.4994802703
+极力推荐 11.598092559
+科雅罗 11.9547675029
+浊漳河 12.8020653633
+参加者 9.15574552361
+小兔 11.5027823792
+外汇兑换 11.8212361103
+包围住 12.5143832909
+霜晨 13.2075304714
+粲然一笑 12.2912397395
+透支 8.0985592766
+若弘照 12.8020653633
+工部侍郎 11.3357282945
+搞些 10.8561552143
+中国香港队 11.9547675029
+帕克 10.3743171274
+唱独角戏 12.8020653633
+不断 4.80518712168
+三十多家 11.7034530746
+赵恒 11.3357282945
+小儿 8.03420959504
+天梁 10.4349417492
+多尔戈鲁基 13.900677652
+不新 13.900677652
+加舒尔 12.5143832909
+龙山区 13.2075304714
+福康 12.8020653633
+尘世 9.72629038208
+十七所 13.2075304714
+不文 13.2075304714
+欧阳海 13.2075304714
+吕碧 12.8020653633
+饰品店 12.8020653633
+记录下来 9.63799777493
+拉默德 12.5143832909
+六十三艘 13.2075304714
+公益广告 13.2075304714
+蜂胶 12.1089181827
+四百余里 13.2075304714
+奖牌榜 13.900677652
+声学家 13.900677652
+高架公路 12.8020653633
+徐晃解 13.2075304714
+首四卷 13.2075304714
+不料 7.42063309005
+对比 6.89670351525
+四十里 10.1394775363
+小凯 13.900677652
+唐三彩 10.4349417492
+柰子 13.900677652
+大远 12.1089181827
+坐具 11.8212361103
+不散 9.15574552361
+不敢 5.13085977992
+丧魂落魄 11.598092559
+不敬 10.0088573539
+大禹岭 12.5143832909
+小凤 10.765183436
+不差毫厘 13.900677652
+帕儿 13.900677652
+亚俱杯 13.900677652
+不敷 10.9562386728
+古船 10.9049453784
+金信安 13.2075304714
+都江堰市 11.0103058941
+大过 10.4994802703
+牧马 10.1871055853
+搞乱 11.2616203224
+马姆斯 12.5143832909
+韶关市 10.9049453784
+清悠悠 12.8020653633
+千层浪 11.0674643079
+元宵节 9.35738286971
+贝贝 11.1280889297
+冰糖葫芦 11.1280889297
+埋电缆 13.900677652
+赵悦 12.2912397395
+我行 10.1394775363
+小冯 13.900677652
+阳刚 11.1926274509
+硬梆梆 11.9547675029
+烟台市 10.3743171274
+凡政制 13.900677652
+对正 11.7034530746
+对此 5.90942372214
+冰溜子 13.2075304714
+跳出去 11.3357282945
+膏药旗 12.1089181827
+不收 9.16447920358
+寿春府 12.2912397395
+董时升 13.2075304714
+大学毕业 8.75318317516
+不放 8.02574692112
+不改 8.60236028543
+气口 13.900677652
+蜂聚 13.900677652
+小冰 13.900677652
+谗佞 11.4157710022
+洮砚 12.1089181827
+南三府 11.598092559
+黄热病 11.1926274509
+以待 8.89673134603
+偏师 10.9562386728
+芒刺在背 12.2912397395
+以往 6.69652835994
+埃尔基 13.900677652
+师克陕 13.2075304714
+爆发变星 12.8020653633
+小农 9.31571017331
+小军 10.765183436
+婚外性 13.900677652
+小写 10.6818018271
+菲茨杰拉德 12.8020653633
+搞丢 13.2075304714
+当否 12.8020653633
+太老 11.8212361103
+协管员 11.0674643079
+祖安童 13.2075304714
+香烟头 13.900677652
+小健 13.2075304714
+督学 10.9562386728
+荷枪 12.1089181827
+韩木林 9.25628675283
+兴旺发达 10.2371160058
+湖底 9.13850371718
+小偷 9.11318590919
+浩翰 12.5143832909
+刘永行 13.900677652
+汝水 11.7034530746
+汗腥 13.900677652
+盒子枪 11.9547675029
+命根儿 12.8020653633
+价外 10.7226238216
+老成见到 13.2075304714
+借酒消愁 13.2075304714
+阳台 9.09665660724
+苏黎世大学 10.3453295905
+林小芳 8.83808261895
+普及本 13.900677652
+物理疗法 12.2912397395
+咬嘴 13.900677652
+林红梅 12.8020653633
+心怀忐忑 12.2912397395
+可欺 11.1280889297
+听得见 9.7898037878
+军分区 9.72629038208
+汗腺 10.0294766411
+力图振作 13.900677652
+总集 9.34680076038
+教唆犯 12.1089181827
+如故 9.93038573842
+适度性 12.8020653633
+小倩 13.900677652
+弱肉强食 11.2616203224
+霜期 12.8020653633
+方岳宗 10.7226238216
+气割 13.2075304714
+试验型 11.598092559
+堵漏 12.5143832909
+真菌 8.51160592216
+爪钩 11.9547675029
+福德 9.82314020807
+阳历 9.94943393339
+错字 11.598092559
+千儿八百 12.2912397395
+缆绳 9.91169360541
+七八百个 12.5143832909
+宝轮 12.5143832909
+马褡子 11.4157710022
+咬噬 11.0674643079
+晕倒 9.49395840471
+胡噜 13.2075304714
+人间地狱 12.2912397395
+如数 9.85762638414
+子献公 13.2075304714
+暂无 9.55687223012
+艾笑 12.5143832909
+请留下 12.5143832909
+科技报 13.2075304714
+气势 8.04560572977
+福彩 9.93038573842
+小僧 10.4349417492
+人工港 11.1926274509
+万象森罗 13.900677652
+斯普鲁恩 12.5143832909
+气动 9.33632946051
+督导 9.62401153296
+释放出来 9.56994431169
+阳升 13.2075304714
+西安市 9.29550746599
+妫川 12.8020653633
+赵建平 13.900677652
+气功 10.0088573539
+蓄热 11.8212361103
+气力 8.62767809341
+鲍恩氏 12.8020653633
+复杂型 13.2075304714
+恶意代码 13.900677652
+汗臭 11.8212361103
+如斯 10.8561552143
+固原县 11.0674643079
+翁声甫 13.900677652
+骨肿瘤 11.9547675029
+督察 8.9519177616
+屋顶花园 12.5143832909
+壁垒森严 13.900677652
+延续性 10.2371160058
+晋恭帝 13.2075304714
+咬嚼 12.1089181827
+麒麟座 13.900677652
+普选 9.40086798165
+科言官 11.9547675029
+泥屋 11.4157710022
+狗吃屎 12.2912397395
+家子样 12.8020653633
+悬而未决 10.2897597393
+彻彻底底 13.900677652
+扎扎实实 10.3743171274
+阳化 13.2075304714
+加里宁格勒 11.2616203224
+鲍二 10.8096351986
+普通 5.93895883599
+敏锐性 11.8212361103
+真草 12.8020653633
+吃饱穿暖 12.2912397395
+市井无赖 12.1089181827
+可比 7.52906580474
+基戈马 12.8020653633
+模糊性 11.3357282945
+试验场 10.1630080337
+宜兴市 11.8212361103
+跳伞运动 12.1089181827
+如无 9.6811699468
+钳形攻势 11.4157710022
+乌里扬诺夫 12.5143832909
+劈山 11.8212361103
+美利 12.5143832909
+蜂腰 11.2616203224
+棋联 13.900677652
+周继红 13.900677652
+湖广 7.67414098269
+不查 10.3453295905
+气儿 9.74179456862
+坐台 12.1089181827
+辗转难眠 12.8020653633
+赵战 13.2075304714
+不敢高攀 12.8020653633
+十三届 9.71102290995
+绛州 12.2912397395
+小卡 13.900677652
+贫富 8.98069672615
+如昔 11.7034530746
+贫寒 9.66657114738
+明宫 12.2912397395
+圣殿 10.4041700905
+卢逊 13.900677652
+供者 12.2912397395
+快速通道 11.0674643079
+太苦 10.4994802703
+试验品 11.7034530746
+五十八名 13.900677652
+可树 13.2075304714
+小华 10.9562386728
+小半 10.4994802703
+恩多拉 13.2075304714
+如是 8.5488195185
+哈默斯 13.2075304714
+削足适履 11.8212361103
+四美 12.8020653633
+讵料 13.900677652
+采办 10.1871055853
+司马懿营 13.2075304714
+小卖 13.2075304714
+李子树 10.0088573539
+弓杆 13.2075304714
+右上方 11.4157710022
+华中科技 12.2912397395
+言之语 12.8020653633
+中控台 9.82314020807
+鞍马劳倦 13.900677652
+小区 7.50374799676
+东戈壁省 13.2075304714
+湖州 8.75318317516
+供职 8.87679713113
+如晤 12.1089181827
+真能 8.90346537821
+圣母 8.45394028031
+白酒 7.73736284794
+盖棺定论 11.8212361103
+小包 9.93038573842
+不枉 9.22784881751
+相顾失色 11.8212361103
+皂靴 11.7034530746
+瓜秧 11.7034530746
+如晶 13.900677652
+弓月 12.8020653633
+福岛 11.4157710022
+贫家 11.1926274509
+小匙 11.4157710022
+糟糕透顶 12.2912397395
+不果 11.9547675029
+荀灌娘 12.8020653633
+糊涂虫 11.598092559
+小可 8.85082164473
+炖品 13.2075304714
+势能 9.98865464655
+小叫 12.1089181827
+挑衅性 12.2912397395
+卫慕 13.2075304714
+气冷 11.4157710022
+灭掉 9.85762638414
+白走 13.2075304714
+李帅 11.0674643079
+亲人或 12.5143832909
+副产物 10.533381822
+将帅 9.41204128224
+鹞式 11.5027823792
+小号 10.3171587135
+小叶 9.18217878068
+劈开 10.0294766411
+不松 11.2616203224
+小史 10.9049453784
+福山 11.2616203224
+心肠好 11.9547675029
+穷理 11.598092559
+小双 10.9049453784
+对植 12.5143832909
+不杀 9.01787572939
+小叉 13.900677652
+熔模铸造 13.2075304714
+谢良 13.2075304714
+莫爱 11.9547675029
+古老 6.66722223335
+盈缺 13.2075304714
+缆索 11.1926274509
+强磁场 10.7226238216
+发令员 13.900677652
+熟练者 13.900677652
+光顺 12.5143832909
+小叔 11.598092559
+交朋友 10.642581114
+白醋 10.8096351986
+堵波 11.1926274509
+小厮 8.18036587537
+李世芳 13.2075304714
+于营官 13.2075304714
+介入 6.81980975528
+小厨 13.900677652
+九十八卷 13.2075304714
+虞洽卿 11.4157710022
+通奸罪 12.5143832909
+介公 11.7034530746
+三十多天 13.900677652
+淹死 8.90346537821
+历后梁 13.2075304714
+蓝本 9.72629038208
+不朽 8.9519177616
+克洛维 11.1926274509
+轻重武器 12.8020653633
+糊涂蛋 12.1089181827
+超然 10.4349417492
+白金 9.29550746599
+消耗型 13.2075304714
+大车 9.02548032877
+不服 8.03989142851
+福将 12.1089181827
+艾奥瓦州 11.598092559
+邻苯二甲酸 11.8212361103
+小原 10.9562386728
+赵括 11.3357282945
+能源危机 10.4666904475
+誓师 9.71102290995
+银行担保 12.8020653633
+次韵 12.2912397395
+半制品 12.8020653633
+福尔 11.0674643079
+白釉 10.8561552143
+子穆王 13.2075304714
+透析 9.44633035572
+手弹 13.900677652
+县市区 11.2616203224
+坐不稳 11.1926274509
+哲学范畴 10.1164880181
+方老爷 10.604840786
+受贿人 12.8020653633
+如月 11.598092559
+错处 11.1280889297
+咬合 10.8561552143
+计议 8.47133202302
+人工河 11.9547675029
+卖淫罪 11.9547675029
+康涅狄格 11.598092559
+做生日 11.7034530746
+数百万年 13.2075304714
+婚纱照 11.4157710022
+不替 10.1871055853
+不曾 6.5656957731
+颠狂 11.7034530746
+无远弗届 12.8020653633
+大转 13.900677652
+一刻间 13.2075304714
+气候 5.82074988122
+门迎凉 13.2075304714
+布转印 13.2075304714
+柳暗花明又一村 11.5027823792
+戈利科 12.8020653633
+希尔 8.91707103027
+如未 11.7034530746
+核武器库 12.8020653633
+吐故纳新 12.1089181827
+福州 7.8093677699
+杀伤力 9.01787572939
+篮板 11.0674643079
+错失 9.5062284973
+巴格达省 13.2075304714
+小剑 13.2075304714
+亚萍 13.900677652
+小别 11.5027823792
+小利 11.4157710022
+用功读书 12.1089181827
+袁胤 13.900677652
+封学武 12.8020653633
+赊帐 13.900677652
+犯罪地理 13.900677652
+楼船 10.9049453784
+潮州菜 13.900677652
+春宵一刻 13.2075304714
+酪氨酸 11.1280889297
+表徵 13.900677652
+砷黄铁矿 13.2075304714
+直线式 12.2912397395
+微风习习 13.900677652
+透明 7.08943327337
+不暇 10.0294766411
+自卫权 13.2075304714
+白道 10.9562386728
+熊宦途 12.8020653633
+坐力 12.5143832909
+坐功 13.900677652
+狞恶 12.5143832909
+小刀 9.80633308975
+伦敦城 11.7034530746
+小则 11.7034530746
+小刘 9.21854642485
+战败国 10.7226238216
+强硬派 12.2912397395
+王饶 13.900677652
+肃慎 10.4994802703
+对校 12.2912397395
+氧化镍 13.2075304714
+同呼吸共命运 13.2075304714
+光与影 13.2075304714
+石柱土家族自治县 12.8020653633
+行住坐卧 13.2075304714
+把儿 10.2630914922
+阳光 6.60494257923
+如林 10.2630914922
+小勺 11.1280889297
+绿豆粥 12.1089181827
+如果 3.96612757399
+郁闭度 11.9547675029
+尤峰 13.2075304714
+卡森堡 12.8020653633
+次要 8.74738605748
+肉食性 9.59661255877
+十三岁 9.63799777493
+咬咬 10.7226238216
+阳具 11.4157710022
+死亡事故 12.1089181827
+皂隶 9.59661255877
+伊岭岩 12.2912397395
+人民公社化 10.9562386728
+不晓 10.0088573539
+进万家 13.900677652
+归亚蕾 13.2075304714
+绿豆粉 13.2075304714
+敕封 10.3171587135
+肠骨 11.598092559
+不晚 9.93038573842
+化学键 9.74179456862
+坐到 8.39534611604
+何秋涛 13.2075304714
+扒糕 13.2075304714
+不是 3.7898101433
+黄巢遂 13.2075304714
+辛西娅 13.900677652
+深有感触 10.2630914922
+上海体育馆 12.8020653633
+上月底 9.93038573842
+真腊 10.0088573539
+徒劳无功 11.8212361103
+棋艺 10.9562386728
+不显 9.36807815882
+金鹰奖 11.9547675029
+辉煌金碧 13.900677652
+对案 12.8020653633
+几套 10.1394775363
+乐玉华 13.2075304714
+绿豆糕 13.2075304714
+雌雄同株 9.62401153296
+不明 7.58351296523
+昆西 11.5027823792
+小功 11.5027823792
+杏仁茶 12.8020653633
+大新县 13.900677652
+力所不及 11.8212361103
+身份证 8.37522471284
+千余名 11.1926274509
+微指令 13.900677652
+气场 12.5143832909
+龙子龙孙 10.8561552143
+白露 10.4349417492
+杨嘉墀 12.8020653633
+作文题目 13.900677652
+修国史 10.6818018271
+剧院 8.03420959504
+气在 11.8212361103
+可燃冰 10.3171587135
+压力壳 12.8020653633
+吉尼斯世界纪录 11.8212361103
+不求名 12.8020653633
+欺天罔地 13.900677652
+然否 11.8212361103
+不懂 12.1089181827
+生津思 12.8020653633
+小商 11.7034530746
+朱勒迪 13.2075304714
+存储量 12.2912397395
+不懈 9.44633035572
+张道陵 11.4157710022
+引擎 8.22050504296
+路网 10.1164880181
+陈启源 11.5027823792
+眼巴巴 9.27570483869
+五站 13.900677652
+民风淳朴 12.5143832909
+古田会议 11.1280889297
+宜林 10.8096351986
+埃尔南 12.8020653633
+青龙集 13.900677652
+立山区 13.2075304714
+航测 11.9547675029
+弹子房 13.2075304714
+病狂 13.900677652
+牛步化 13.2075304714
+贾兰贾 13.2075304714
+大熊猫 8.91707103027
+如恒 12.8020653633
+白面 9.25628675283
+坎坎坷坷 12.1089181827
+特色化 11.598092559
+督师 8.44109213783
+气块 12.8020653633
+雪路 12.5143832909
+二十万左右 13.900677652
+驰名商标 9.63799777493
+轰雷贯耳 13.2075304714
+蓄电 12.5143832909
+瞒天过海 10.6818018271
+小唐 10.2630914922
+鞍马劳困 13.900677652
+弟妹们 13.2075304714
+亚菊 11.598092559
+不慢 10.765183436
+一九一六年 13.900677652
+金风玉露 12.8020653633
+五常市 12.8020653633
+羽化登仙 13.900677652
+川山甲 12.8020653633
+教学要求 12.8020653633
+气垫 10.3171587135
+札达县 13.900677652
+珍禽异兽 10.2117981979
+四十锭 12.8020653633
+桓公沟 13.2075304714
+史载秦 12.5143832909
+煞尾 13.2075304714
+不慌 10.5684731418
+圣洁 9.98865464655
+不慎 9.01032852375
+长毛象 13.900677652
+劈头 9.34680076038
+歌咏队 13.900677652
+圣洛 13.2075304714
+剧集 11.7034530746
+坐商 13.900677652
+发生地 10.5684731418
+包买商 11.3357282945
+可溶 11.0103058941
+照样做 11.8212361103
+小嗓 12.5143832909
+紧要关头 10.1164880181
+美利奴 13.2075304714
+有国难投 11.7034530746
+生长抑素 11.5027823792
+不愧 8.81927328699
+网球王子 13.900677652
+白音 11.4157710022
+科尔沁右翼前旗 11.9547675029
+川东地区 12.8020653633
+领导成员 10.8096351986
+刘裕灭 12.8020653633
+艾大惊 12.5143832909
+不愿 6.38587789149
+接面 13.900677652
+公卿议 13.2075304714
+松香水 13.900677652
+寻大圣 13.2075304714
+不愁 9.13850371718
+锐志 12.1089181827
+鸭绿江大桥 11.9547675029
+不意 9.16447920358
+从始至终 11.4157710022
+福娃 12.1089181827
+咬定青山不放松 13.2075304714
+平均价 10.1871055853
+心上人 10.533381822
+尤宜 12.8020653633
+锒铛入狱 11.1280889297
+督府 12.1089181827
+毒物学 13.900677652
+不感 11.9547675029
+不惧 9.5062284973
+一两万美元 13.2075304714
+白阳 12.2912397395
+小周 11.7034530746
+淹没 7.93453091285
+错开 10.0720362555
+斩决 11.7034530746
+如意 8.69119149913
+机炮 9.32596667347
+田四田 12.2912397395
+丘沈 13.2075304714
+袖子 8.0600359946
+寸草不生 10.7226238216
+小命 10.1871055853
+阳城 9.66657114738
+不想 5.96437495877
+心甘情愿 9.20932976975
+压铸 12.2912397395
+曳引机 12.8020653633
+阳基 13.2075304714
+上弦月 11.598092559
+堵死 9.48183704418
+飞驰而去 11.2616203224
+试验台 12.1089181827
+人生七十古来稀 12.8020653633
+昆达 13.900677652
+袁恕己 12.5143832909
+商业银行总行 13.2075304714
+不惑 10.8096351986
+咬到 11.1280889297
+女儿红 12.8020653633
+蛋白聚糖 13.2075304714
+不惜 8.08356649201
+复杂化 9.66657114738
+如愿 9.5186510173
+埃尔利 12.2912397395
+自变数 13.2075304714
+不悦 9.18217878068
+第二十一章 10.0940151622
+轮廓线 11.1280889297
+许国石 12.8020653633
+普钙 12.8020653633
+赵敏 11.598092559
+寸草不留 12.1089181827
+试验厂 12.8020653633
+小吵 12.8020653633
+小吴 9.69598503258
+小吏 9.82314020807
+高架道路 13.900677652
+小名 9.80633308975
+福安 11.1926274509
+五十八卷 12.8020653633
+滴状 13.900677652
+小吃 9.40086798165
+福宝 13.2075304714
+墨水笔 13.900677652
+小型 6.75154605342
+邓伯温 13.2075304714
+太薄 11.0674643079
+无父无君 11.9547675029
+小吕 11.5027823792
+当家立事 13.900677652
+法制性 12.5143832909
+侯门深似海 12.8020653633
+不恤 11.598092559
+快抓紧 13.2075304714
+膨松 12.5143832909
+和小孔 10.4666904475
+不恭 10.7226238216
+李庄 9.34680076038
+不息 9.0884932966
+肃杀 11.0103058941
+三十多年 9.40086798165
+白起 10.7226238216
+李庆 11.5027823792
+计费 10.0294766411
+赵文 10.4994802703
+淹水 11.9547675029
+错得 13.900677652
+圣水 10.0505300503
+魔神 12.5143832909
+炊事员 9.62401153296
+叩拜 9.91169360541
+尧帝 12.8020653633
+小品 9.21854642485
+柚子茶 13.2075304714
+坐呀 11.598092559
+庄公子 13.900677652
+埃尔加 12.8020653633
+化工行业 9.46986085313
+过盛 11.5027823792
+李府 10.4994802703
+阳坡 10.1394775363
+橙色 9.85762638414
+不急 8.88339781516
+持有期 10.9562386728
+小咬 12.5143832909
+种植园主 10.642581114
+老虎皮 12.8020653633
+郭样盛 13.2075304714
+白雾 9.96885201925
+不怨 10.2630914922
+不怪 9.21854642485
+优抚 11.1280889297
+石铭鼎 11.8212361103
+十分宝贵 12.8020653633
+于本周 9.49395840471
+麻剌子 12.8020653633
+宜昌 8.78268383956
+传媒业 11.5027823792
+气团 9.87532596124
+机读目录 13.2075304714
+赵旃 13.2075304714
+白雪 8.03420959504
+试验区 9.7898037878
+汗淋淋 11.4157710022
+冷热板 12.1089181827
+不怀 12.2912397395
+魏长贤 12.8020653633
+大苦湖 12.8020653633
+发生器 9.56994431169
+不怕 6.75864107727
+宜春 10.2117981979
+气囊 9.58318953844
+周瑜打黄盖 11.9547675029
+萨萨尼亚 13.2075304714
+地域观念 11.9547675029
+朱雀玄武 13.2075304714
+中美商贸联委会 10.8561552143
+对二甲苯 11.4157710022
+福士 13.2075304714
+化学部 12.8020653633
+说得动 12.5143832909
+固习 13.900677652
+第一零九回 13.2075304714
+小坡 11.5027823792
+孝子顺孙 12.5143832909
+张女士 9.77354326693
+十一艘 13.2075304714
+赵明 11.1926274509
+白锡 12.5143832909
+五花大绑 9.89334446674
+地下道 11.3357282945
+可气 11.0103058941
+赵昀 11.7034530746
+历后汉 12.5143832909
+赵昂 12.8020653633
+对消 13.900677652
+普及性 12.5143832909
+余量 11.7034530746
+不揍 11.9547675029
+尤奇 13.900677652
+幻龙 12.8020653633
+密集型 9.5062284973
+古蒂 13.2075304714
+梨花枪 12.5143832909
+赵昭 9.24671730182
+小坝 12.2912397395
+地方党委 11.1926274509
+不提 8.81927328699
+第十三次 10.4994802703
+小块 8.9519177616
+木石塞 13.2075304714
+小坑 11.598092559
+小坐 11.8212361103
+主动脉 10.1630080337
+灭杀 13.2075304714
+以太 10.0505300503
+赵晔 13.2075304714
+告别 7.73736284794
+小圣 11.7034530746
+可求 10.8561552143
+赵晓 13.2075304714
+闻君侯 13.2075304714
+小场 12.8020653633
+陈启泰 12.8020653633
+阳和 10.642581114
+可汗 9.0884932966
+酸催化 12.2912397395
+值班 8.37921673411
+有气无力 9.71102290995
+魔窟 11.2616203224
+小圈 12.5143832909
+大江南北 9.93038573842
+小圆 9.74179456862
+以备 8.56795885871
+不掉 9.74179456862
+小土 10.8096351986
+一五一十 9.40086798165
+赵普 10.8561552143
+艾穆 9.20019728618
+不近情理 11.5027823792
+何高见 13.2075304714
+以外 6.2438675605
+户内运动 13.900677652
+蜂蛹 12.8020653633
+橡实 12.8020653633
+巴塔洛 13.2075304714
+保马法 13.900677652
+古萨 13.2075304714
+引智 12.5143832909
+大相岭 12.5143832909
+四组 11.7034530746
+非关税壁垒 11.7034530746
+义无反顾 9.84023464143
+当政者 12.2912397395
+垦殖场 13.2075304714
+小培 12.8020653633
+应劭注 13.2075304714
+泣数行下 12.8020653633
+白赚 13.2075304714
+中国战区 10.533381822
+救人如救 13.900677652
+刚体 9.59661255877
+拦着 10.1630080337
+坐坐 9.04864738806
+比来 11.9547675029
+太平洋铁路 11.2616203224
+气喘 9.66657114738
+小伞 12.2912397395
+魏巍空 12.5143832909
+为今之计 10.7226238216
+万世开 13.900677652
+千余元 13.2075304714
+橡子 10.8096351986
+湖头 13.2075304714
+于莱喀 13.900677652
+一塌胡涂 13.900677652
+法律手段 10.2630914922
+阴气森 12.1089181827
+烁烁 12.8020653633
+坐地 9.23723855786
+唱起 9.4233408375
+不挡 11.2616203224
+鹞子 11.0674643079
+根瘤细菌 13.900677652
+不振 8.53470163695
+大部地区 9.22784881751
+古董 8.87023973058
+灌木 7.88941047757
+感知器 13.900677652
+午餐肉 12.2912397395
+刚会 12.2912397395
+贡方物 12.5143832909
+坐在 5.53082504846
+如拟 12.2912397395
+狗嘴里 11.8212361103
+花果山 9.46986085313
+杭嘉草 12.1089181827
+无论是 6.68764599214
+自然景观 9.01032852375
+开快车 13.2075304714
+麦地那 9.84023464143
+不挂 11.1280889297
+对流 9.23723855786
+萨摩亚 10.8561552143
+消消气 11.3357282945
+尤如 12.5143832909
+总统令 12.1089181827
+贫弱 10.9562386728
+筹建 8.21370229564
+吊下来 12.1089181827
+夏侯蔼 9.75754292558
+整年 10.3743171274
+业内人士 6.31387411681
+违法违纪 11.0103058941
+世系表 10.8096351986
+坐困 11.598092559
+次货 13.2075304714
+小器 11.5027823792
+将官 9.53122979951
+赵朔 12.1089181827
+将定 11.8212361103
+不择 11.1926274509
+整平 12.2912397395
+张天师 11.1280889297
+艾尔维斯 13.900677652
+对治 13.2075304714
+变狭 13.900677652
+都庞岭 11.8212361103
+袖套 13.900677652
+亚联 13.900677652
+紫蓝 12.8020653633
+聒絮 13.900677652
+爱顾 12.8020653633
+克莱佩 13.2075304714
+炭疽菌 12.8020653633
+所有人 7.6701962044
+先锋队 10.8561552143
+庄内庄 13.900677652
+像不像 10.5684731418
+绞股蓝 13.2075304714
+弓手 10.6818018271
+不拔 11.1280889297
+夜静 10.4349417492
+好景不长 10.1871055853
+那伙群 13.2075304714
+哭天喊地 13.900677652
+不拘 9.36807815882
+西兰岛 12.5143832909
+不报 9.5186510173
+甲午战争 8.6966709649
+泄下 12.8020653633
+占满 11.0674643079
+救回来 11.3357282945
+何足挂齿 10.642581114
+古藤 11.8212361103
+罗那顺 12.8020653633
+读书种子 12.8020653633
+气味 7.43608934829
+十六顷 12.2912397395
+小嘴 9.84023464143
+利努斯 13.2075304714
+小嘎 12.8020653633
+滴点 13.900677652
+马陵山 12.1089181827
+赵杰 9.30555780184
+次呼叫 13.900677652
+笑骂 10.4666904475
+封冻期 10.604840786
+三十多岁 9.41204128224
+亚耶 13.2075304714
+对法 10.5684731418
+不折 11.9547675029
+热昏 13.900677652
+高末儿 12.8020653633
+小园 13.2075304714
+微乎其微 9.35738286971
+普降 10.8096351986
+不扣 12.8020653633
+普陀 9.66657114738
+不扬 11.8212361103
+这么回事 9.75754292558
+住房面积 10.4666904475
+土话 11.3357282945
+督工 12.5143832909
+一百八十七条 13.2075304714
+滴灌 11.7034530746
+白钦 12.2912397395
+古蔺 13.2075304714
+王杰书 12.1089181827
+白钢 12.2912397395
+引来 8.29487558568
+赵构 10.0505300503
+村店 11.1926274509
+航油 8.90346537821
+婚生子 12.8020653633
+紫菜汤 13.900677652
+开镰 12.8020653633
+所有主 11.8212361103
+印度谷螟 13.900677652
+小囊 11.0103058941
+肃敬 12.1089181827
+不才 9.46986085313
+主管机关 9.7898037878
+优惠 6.74606229506
+专辑名称 13.900677652
+窝边草 11.8212361103
+小回 11.8212361103
+弓拉 11.7034530746
+敷设 9.7898037878
+建国以来 10.0294766411
+不打 9.82314020807
+龟背竹 13.900677652
+一马平川 11.0674643079
+不托 13.2075304714
+奋战到底 13.2075304714
+洪水期 9.82314020807
+白银 8.07763175649
+尧山 11.0103058941
+福大 11.0103058941
+青龙镇 11.5027823792
+赵某 9.98865464655
+小九九 11.8212361103
+基金净值 8.0484751722
+戴安芬 13.900677652
+民族特色 9.31571017331
+执法如山 11.5027823792
+压阵 11.4157710022
+信访局 11.8212361103
+湖塘 11.3357282945
+毕达哥拉斯 10.3171587135
+如糖似蜜 13.2075304714
+赵仅存 13.2075304714
+桥宽 10.5684731418
+喜马拉 12.5143832909
+中村正雄 12.8020653633
+架子花 11.9547675029
+胡地 11.7034530746
+白铜 10.3171587135
+瓜籽 11.0103058941
+瓜类 10.4041700905
+萨福克县 13.2075304714
+柱面波 13.900677652
+闺房 10.4349417492
+白铁 12.2912397395
+不成 6.63875055927
+刚为 12.8020653633
+不戒 12.1089181827
+成武 11.3357282945
+开绽 13.900677652
+法制报 13.900677652
+做生意 8.30969067146
+美国白宫 10.2630914922
+人士处 9.75754292558
+不等 6.73286846766
+二百二十八卷 13.2075304714
+对接 8.41588071849
+坐姿 10.0088573539
+返祖现象 11.598092559
+搂入 12.5143832909
+不深 9.49395840471
+治保 11.598092559
+虞候作 13.2075304714
+晚风习习 13.900677652
+错划 10.8561552143
+小女 10.2897597393
+错列 13.2075304714
+茫然不解 11.5027823792
+校企 12.1089181827
+光氧化 12.8020653633
+触怒 9.65218240993
+错误倾向 11.5027823792
+锐化 12.1089181827
+四十首 13.900677652
+主动轮 10.2630914922
+绢布 11.7034530746
+丰桥 13.2075304714
+汗衫 10.4666904475
+错判 12.8020653633
+源源不断 8.67493097826
+如水 9.35738286971
+看青 13.900677652
+蛋液 13.900677652
+人工林 10.0720362555
+墙里墙外 13.900677652
+兴城市 11.8212361103
+小套 13.2075304714
+小奖 12.5143832909
+治史者 12.1089181827
+校会 13.2075304714
+主动轴 12.2912397395
+云顶山 12.2912397395
+滴翠 11.4157710022
+绢帛 10.604840786
+金亦设 13.2075304714
+十四开 13.900677652
+小夫 12.8020653633
+平衡位置 10.642581114
+瓷杯 11.8212361103
+孜孜 11.598092559
+不涩 13.2075304714
+不涨 9.96885201925
+赵桓 11.2616203224
+石宝那 13.2075304714
+足下 8.56795885871
+西安城 10.9562386728
+战斗服 11.8212361103
+蹦达 12.2912397395
+瓷板 12.5143832909
+小头 10.4041700905
+旁求俊彦 13.900677652
+介导 11.4157710022
+小夏 13.2075304714
+战斗机 7.71241352889
+不涂 13.2075304714
+悲愤交加 13.2075304714
+气孔 9.27570483869
+小处 13.2075304714
+不消 8.85725253506
+二十四时 12.5143832909
+向右转 10.5684731418
+介寒 13.2075304714
+赊售 13.900677652
+总费用 11.1926274509
+小帅哥 13.2075304714
+帕西基 12.5143832909
+二十四日 10.5684731418
+一千万斤 13.2075304714
+段太尉 13.2075304714
+毛茸茸 9.69598503258
+后援会 13.2075304714
+小姨 9.85762638414
+四线 10.533381822
+李学智 13.900677652
+坐好 10.3453295905
+咬得 10.3171587135
+阁道 12.8020653633
+坦平 13.900677652
+魂飞魄散 10.0505300503
+龙山寺 11.9547675029
+引桥 10.765183436
+双声带 13.900677652
+可投 12.5143832909
+将同 10.765183436
+将名 13.2075304714
+真言 9.27570483869
+不浅 10.4041700905
+蓄积 9.63799777493
+埃尔德 12.1089181827
+不流 10.8561552143
+木车 12.1089181827
+不济 8.99540287354
+虎山行 13.2075304714
+王频 11.7034530746
+不测 9.20932976975
+太行 9.49395840471
+全空间 12.5143832909
+小姜 12.5143832909
+楼观 11.1926274509
+香奈尔 12.2912397395
+残积土 13.900677652
+二十四支 13.2075304714
+气宇 12.8020653633
+企业经营者 10.1394775363
+亚述 9.45802639549
+小姑 10.1871055853
+小姐 7.102737239
+她俩 10.0088573539
+昏头转向 13.900677652
+李氏房 12.8020653633
+坐失 11.3357282945
+王宙斯 12.8020653633
+吴兵尽 12.8020653633
+可拉 11.7034530746
+值得羡慕 13.900677652
+钱老儿 13.900677652
+克洛瓦 11.0674643079
+奸人 10.6818018271
+皮鱼纲 12.5143832909
+坐大 11.3357282945
+小妹 10.2897597393
+亚辛 13.2075304714
+连通性 12.2912397395
+可拔 12.8020653633
+受寒 10.7226238216
+指针 9.26594866375
+如泥 11.0674643079
+猛抓 13.2075304714
+不洁 9.72629038208
+云顶岩 13.2075304714
+劣种 11.9547675029
+劈啪 11.3357282945
+小妞 11.4157710022
+不洗 12.2912397395
+介子 9.87532596124
+督办 8.89004235788
+中金公司 7.97642185456
+气密 10.5684731418
+小妖 8.64840422393
+翻牌 11.7034530746
+瓦楞纸 11.8212361103
+顺手牵羊 10.8096351986
+含权 11.1280889297
+现已查明 11.3357282945
+被执行人 10.7226238216
+大象 8.78868986362
+信访办 11.2616203224
+小丑鱼 13.900677652
+两千里 13.900677652
+电机工程 10.4994802703
+如洗 10.2371160058
+连体服 13.900677652
+劫掠一空 12.1089181827
+问事处 13.900677652
+锐利 8.99540287354
+家协会 12.2912397395
+套书 11.9547675029
+一去不返 10.9562386728
+四棱豆 13.2075304714
+骑田岭 11.0674643079
+保障体系 10.0088573539
+摧枯拉朽 10.8096351986
+福利院 10.765183436
+百岁老人 12.1089181827
+触感 10.6818018271
+不法 9.10488710638
+对折 11.2616203224
+怒涛汹涌 13.2075304714
+麻麻糊糊 13.2075304714
+奸佞 10.4349417492
+铁勒布 13.2075304714
+真让 10.4994802703
+马前马 13.900677652
+游猎赋 13.2075304714
+小塔 11.9547675029
+对抗 7.4407731976
+奸伪 12.5143832909
+吊楼 13.900677652
+真话 8.76487921493
+古语 10.9562386728
+真诚 8.28754954559
+查验 9.77354326693
+数百万吨 12.2912397395
+白驹 11.9547675029
+套上 9.89334446674
+指错 12.5143832909
+城关镇 8.97342396682
+阳安 11.598092559
+雷洁琼 11.9547675029
+千余座 11.7034530746
+丝绸之路 8.61747392324
+博斯普鲁斯 12.2912397395
+白马 8.25170341381
+透水 11.1280889297
+低温冰箱 13.900677652
+可捐 13.900677652
+十分艰巨 10.7226238216
+小堆 12.8020653633
+这点儿 10.6818018271
+小堂 12.5143832909
+数百万名 13.900677652
+优渥 11.8212361103
+阳宫 13.2075304714
+优游 11.598092559
+古话 10.3453295905
+硅酸盐 9.04864738806
+嫌少 10.4349417492
+古诗 9.44633035572
+毓秀 11.9547675029
+台生子 13.2075304714
+巴西利 12.1089181827
+潮位 11.1926274509
+好言相劝 11.4157710022
+优异成绩 9.82314020807
+胜队 12.8020653633
+阳子 8.75318317516
+锐势 13.2075304714
+明月当空 13.2075304714
+攻击点 12.8020653633
+蜘蛛 9.00283785202
+吴则虞 12.8020653633
+以图 8.95903522937
+压顶 11.598092559
+小壶 11.8212361103
+和浓丽 13.2075304714
+白骨 9.23723855786
+小声 7.0080360108
+朱温降 12.8020653633
+二十多一点 13.2075304714
+指间 11.0674643079
+直接经验 11.7034530746
+几十公里 11.4157710022
+对戏 13.900677652
+自行决定 11.2616203224
+可控 8.55357012126
+过往甚密 11.8212361103
+弓法 12.1089181827
+嚷出 13.2075304714
+套件 11.598092559
+魔界 13.900677652
+一勇之夫 12.2912397395
+四十多里 12.1089181827
+中外文 11.9547675029
+转念之间 12.5143832909
+对成 13.2075304714
+布局合理 11.0674643079
+皓月当空 11.9547675029
+鄄城 10.6818018271
+遮上 12.5143832909
+尤二姨 13.2075304714
+四十顷 12.8020653633
+她们 6.09194834523
+金子般 12.8020653633
+玛纳斯湖 11.3357282945
+碧桂园 9.87532596124
+蛛丝 10.9049453784
+瓜片 11.3357282945
+望到 11.3357282945
+拔地 12.8020653633
+整建 12.8020653633
+白髯 13.2075304714
+溥杰 13.2075304714
+猛降 12.2912397395
+福地 10.1164880181
+碾磨 10.9562386728
+对手 7.18650712207
+千余帐 13.2075304714
+耍滑 11.7034530746
+本次 5.78934964869
+坐堂 10.8096351986
+不气 10.6818018271
+老凤祥 11.1280889297
+潘哈德 10.1394775363
+一九二五年 12.5143832909
+热容量 11.8212361103
+苏圆 10.8096351986
+生物卫星 13.900677652
+君集 13.900677652
+教练 8.43261751084
+二十四枚 13.2075304714
+叶木属 13.2075304714
+二十四枝 12.8020653633
+小孩 7.53592689512
+小学 6.97508245487
+气头 12.2912397395
+奴隶制 7.99531580392
+小季 13.900677652
+司马懿谓 12.8020653633
+表店 13.900677652
+表面膜 12.8020653633
+洗涤液 12.8020653633
+可怜 6.90308166899
+神品 11.2616203224
+可怖 9.91169360541
+可怕 6.84536480864
+自因 13.2075304714
+蹦迪 13.2075304714
+指陈 11.8212361103
+鹿城区 11.7034530746
+不少汪 13.2075304714
+魔盘 13.900677652
+魔盒 11.7034530746
+塔安纳 13.2075304714
+小孟 13.900677652
+二一回 13.900677652
+小孝 13.900677652
+架子车 10.1394775363
+军事部长 11.4157710022
+小孙 11.598092559
+小书 12.1089181827
+小字 9.03314320152
+驴肝肺 12.1089181827
+小孔 8.36334338496
+狼毫笔 12.1089181827
+同行者 11.3357282945
+小子 7.39638947844
+计若 13.900677652
+和湘湘 12.2912397395
+锐兵 13.2075304714
+莫林 12.8020653633
+坐客 12.2912397395
+粒雪盆 11.8212361103
+庄园 8.96620371885
+迂夫子 12.8020653633
+布兰达 13.900677652
+房管所 12.1089181827
+白饭 11.4157710022
+新厂区 13.2075304714
+希腊神话 9.7898037878
+透漏 11.5027823792
+红光满面 11.3357282945
+维克里 13.2075304714
+嫌弃 9.44633035572
+可恨 9.00283785202
+坐定 8.21370229564
+古装 10.765183436
+历仕各 13.2075304714
+事故率 12.5143832909
+西蒙丝 13.2075304714
+向右走 12.2912397395
+有头没尾 13.900677652
+富忠 9.89334446674
+第十三条 10.8561552143
+可恶 8.81927328699
+看错 9.4233408375
+触手 9.55687223012
+吴楚材 13.2075304714
+马文 11.4157710022
+居住期限 11.8212361103
+看门 10.1630080337
+万亿斤 13.900677652
+伊德里斯 11.4157710022
+美利坚 10.642581114
+卡纳瓦罗 13.900677652
+国家元首 8.40350942668
+高等 7.73947033028
+笑靥 11.5027823792
+校园文化 12.1089181827
+关胜引 12.5143832909
+有眼不识泰山 11.3357282945
+声强级 13.2075304714
+钩取 12.8020653633
+灌死 13.2075304714
+刀割 9.74179456862
+小富 12.5143832909
+配伍 10.0720362555
+隐忍不言 13.2075304714
+咨询中心 10.765183436
+尤二姐 10.2897597393
+亿次 10.9562386728
+晾着 11.0103058941
+徐秋斋 7.80035869996
+红色素 12.5143832909
+伦敦市 11.9547675029
+女公子 13.2075304714
+邵大哥 12.2912397395
+挖下 12.2912397395
+小宫 11.9547675029
+拜码头 13.900677652
+鲍旭挺 13.2075304714
+商务网 13.2075304714
+区区此心 13.2075304714
+数千亿美元 12.5143832909
+可惜 6.76499030495
+贫化 11.7034530746
+小容 13.2075304714
+南豫州 12.8020653633
+曹洪战 13.2075304714
+小家 10.642581114
+阿克苏地区 12.2912397395
+预报员 12.2912397395
+二子一女 12.8020653633
+小宋 10.642581114
+小安 10.8561552143
+配位 9.33632946051
+不漏 10.5684731418
+美零售商 13.2075304714
+中国人民解放军总政治部 11.0674643079
+小宁 10.0720362555
+国税局 10.7226238216
+尤喜 10.765183436
+小宛 9.98865464655
+依靠 6.31083613979
+汽车贸易 11.1280889297
+小官 9.98865464655
+小宗 10.5684731418
+古街 12.1089181827
+可想 10.0505300503
+锐减 8.65893063692
+转让金 13.2075304714
+可意 11.8212361103
+氨酸 10.765183436
+伦福德 12.8020653633
+不满 6.81645122988
+映入眼帘 10.4349417492
+港务局 11.7034530746
+小婧 11.5027823792
+魔石 13.2075304714
+配享 11.9547675029
+铅丝 11.7034530746
+梁锦松 12.2912397395
+一百八瓶 13.2075304714
+德天瀑布 12.5143832909
+税收制度 10.2117981979
+缩写字母 13.2075304714
+拿架子 11.3357282945
+真要 8.28754954559
+抹下来 12.8020653633
+慧眼识英 13.900677652
+配了 11.8212361103
+黑色幽默 11.3357282945
+经典语录 12.8020653633
+一笔笔 11.4157710022
+种子选手 11.3357282945
+哈喇 11.5027823792
+可愿 11.9547675029
+繁华都市 12.2912397395
+铅丹 13.2075304714
+铅丸 13.900677652
+指靠 10.6818018271
+烙印 9.54396882529
+小婕 10.765183436
+祖上 8.80692745117
+上演税 13.900677652
+戴宝冠 13.900677652
+一九一五年 13.900677652
+掷弹筒 11.0103058941
+兰叶 12.5143832909
+董皇后 10.8561552143
+力有未逮 13.900677652
+诺维茨基 13.900677652
+白须 10.9049453784
+介壳 10.3171587135
+尤侗 11.8212361103
+配件 9.12155415886
+转向器 12.5143832909
+格里格 11.4157710022
+施贵宝 13.2075304714
+来复枪 11.7034530746
+学历证明 12.2912397395
+降雨量 9.94943393339
+午餐费 13.900677652
+以后 4.34497609596
+出气筒 11.9547675029
+明确性 11.1280889297
+广播式 13.900677652
+如潮 10.2117981979
+英雄无敌 13.2075304714
+小娃 9.03314320152
+小威 13.900677652
+数十万个 12.5143832909
+天溪 13.900677652
+相对误差 12.5143832909
+外轮山 13.2075304714
+比林 12.5143832909
+赵武 12.5143832909
+眼镜蛇 10.533381822
+神名 11.8212361103
+可憎 10.4994802703
+十八位 13.900677652
+传粉 10.3171587135
+司礼韩 13.2075304714
+杜洛周 12.5143832909
+秦良引 13.2075304714
+偏心 10.2371160058
+章怀太子 11.8212361103
+湖名 11.9547675029
+远远近近 10.0720362555
+仓央嘉 11.8212361103
+无花果树 12.8020653633
+触探 13.900677652
+程度较 9.62401153296
+揽你 12.8020653633
+浓妆艳抹 10.533381822
+小丫 12.5143832909
+由简而繁 12.5143832909
+萃取 9.71102290995
+王鲁彦 12.8020653633
+董监事 12.8020653633
+同时在线 13.2075304714
+扫帚眉 11.3357282945
+包装费 13.900677652
+马卡迪 13.900677652
+尤哈 13.900677652
+如临其境 12.8020653633
+科尔多凡 9.69598503258
+龙胜各族自治县 11.8212361103
+配上 9.61021821083
+茗茶 12.1089181827
+高能键 13.2075304714
+白领 8.78268383956
+古为今用 11.8212361103
+高足弟子 13.900677652
+乌斯湖 13.900677652
+周期律 10.5684731418
+初等教育 10.4349417492
+敕命 10.8096351986
+月光曲 13.900677652
+昆腔 10.9049453784
+季莫申科 13.2075304714
+气壳 11.598092559
+阿利斯 13.900677652
+依附 8.50251495046
+木质素 11.0674643079
+阳夏 11.7034530746
+舴艋 13.2075304714
+辚辚 11.9547675029
+苑琼丹 13.900677652
+赵毅 11.5027823792
+汉委奴 12.8020653633
+爬泳 13.900677652
+天主教徒 9.77354326693
+毛南族 11.2616203224
+圣手 10.4349417492
+钢水 11.5027823792
+顾问组 13.900677652
+漆园 13.900677652
+工具钢 10.8561552143
+宜多吃 11.8212361103
+希宁 13.2075304714
+小丽 10.5684731418
+昆腾 13.900677652
+督军 9.4233408375
+数十万亩 13.2075304714
+配乐 9.85762638414
+不渝 12.1089181827
+治丧 11.1280889297
+马斯特里赫特 11.5027823792
+势要 11.598092559
+整分 13.2075304714
+垮掉 10.3171587135
+小嵩 12.5143832909
+半倒 12.5143832909
+水月庵 11.1926274509
+南四湖 10.4041700905
+谈上 12.8020653633
+大路 8.19689517732
+圣方 10.8561552143
+白鼠 12.2912397395
+浊水溪 9.91169360541
+钾钠 11.8212361103
+白鼬 12.2912397395
+忽必烈 8.23771717184
+运算器 10.7226238216
+数百万元 11.1280889297
+豆酱 12.1089181827
+赠券 13.2075304714
+受话器 12.8020653633
+酬酢 11.2616203224
+缅甸联邦 12.2912397395
+米托斯 12.8020653633
+青儿 11.8212361103
+真身 10.0940151622
+天愁地惨 12.5143832909
+以博 11.9547675029
+俨如 11.9547675029
+太小太 12.5143832909
+福勒 11.8212361103
+程序代码 12.1089181827
+嫌大 13.2075304714
+圣旨 7.98447558937
+千余家 12.2912397395
+阳府 13.900677652
+柴佩尔 13.900677652
+穷竭 12.2912397395
+棋路 11.7034530746
+天主教堂 10.533381822
+引河 11.3357282945
+捕捉到 9.94943393339
+仲丁 12.1089181827
+箭不虚发 13.900677652
+宜兴县 11.3357282945
+治世 10.3453295905
+演唱者 11.0103058941
+笑醒 12.5143832909
+左军阵 12.8020653633
+小三 11.1280889297
+中尼公路 11.5027823792
+绛县 12.2912397395
+罗得岛 10.8561552143
+小银勺 13.900677652
+阿德儿 11.598092559
+堵截 9.56994431169
+以北 6.89217246989
+激起公愤 12.2912397395
+嫌多 11.7034530746
+平安保险 10.6818018271
+登记簿 11.3357282945
+小差 11.3357282945
+排土场 13.2075304714
+小巫 11.8212361103
+对本 9.4233408375
+蔡康永 13.900677652
+小巧 9.19114745066
+辣子鸡 12.5143832909
+发挥特长 13.900677652
+佩鲁吉诺 12.5143832909
+患麻疹 13.900677652
+穿插 9.14708746087
+献殷勤 10.3453295905
+谈事 11.598092559
+小巽 13.900677652
+除此而外 10.533381822
+湖北 6.68103561185
+小巷 9.4233408375
+奖牌数 13.2075304714
+小巴 13.2075304714
+咬定 10.533381822
+上楼去 9.89334446674
+文治武功 11.598092559
+灌浆 10.5684731418
+亚语 12.2912397395
+如梦 10.642581114
+毛将焉附 12.1089181827
+小校飞 12.2912397395
+不少篇 12.8020653633
+以及 3.99509230136
+阳平 10.8096351986
+气得 7.67216664838
+白龟 12.8020653633
+白龙 10.604840786
+三十多块 12.5143832909
+电梯公司 13.2075304714
+小川 12.1089181827
+塞罕坝 13.900677652
+日观峰 13.2075304714
+亚诺 11.0674643079
+流质食物 12.5143832909
+闹革命 10.604840786
+双汇发展 10.5684731418
+湖区 8.59240995457
+党总支部 12.8020653633
+电脑软件 12.8020653633
+茁长 13.2075304714
+黄刺玫 12.5143832909
+气忿 11.3357282945
+贾政便 10.8561552143
+投鞭断流 12.8020653633
+福利 8.11993413618
+引水 8.73019365694
+太谷 11.1926274509
+肃清 9.4233408375
+攀起 12.5143832909
+穷究 10.8096351986
+湖南 6.59548943658
+太谦 11.9547675029
+土石山区 12.8020653633
+现成话 12.8020653633
+颤抖抖 10.7226238216
+串行总线 13.2075304714
+预先审查 13.900677652
+没数 11.4157710022
+李梦阳 11.3357282945
+福分 9.87532596124
+真金不怕 13.900677652
+循环赛 12.8020653633
+谈价 13.900677652
+椿树 10.3743171274
+数百万册 13.2075304714
+美国通用 11.0103058941
+圣教 11.5027823792
+没敲 13.2075304714
+远大目标 12.5143832909
+美人香草 13.900677652
+一年级 9.80633308975
+转户口 13.2075304714
+昆虫 7.31312763715
+小屯 10.8096351986
+谦虚有礼 13.900677652
+可有 7.56208357377
+白鸽 10.9562386728
+将军 6.01760830067
+灌注 9.74179456862
+可期 8.85725253506
+苏美曲 12.5143832909
+借剑杀人 12.5143832909
+可望 8.63798746307
+君不见 10.4666904475
+板车 11.2616203224
+谆谆教诲 12.8020653633
+指配 13.2075304714
+江南水乡 10.7226238216
+异议书 12.8020653633
+小山 8.73589167805
+以前 5.29145237511
+小屋 8.44109213783
+风生水 10.3453295905
+明词综 12.8020653633
+豆苗 13.900677652
+幸遇 11.0674643079
+多里 10.9049453784
+斩妖 11.8212361103
+开庭审理 9.98865464655
+初试锋芒 13.2075304714
+缓行 10.9049453784
+瓜皮 10.9049453784
+十四员 13.2075304714
+一视同仁 9.82314020807
+朱希忠 12.5143832909
+博爱县 11.8212361103
+冰隙 13.900677652
+以利 9.33632946051
+一千六百多文 13.2075304714
+白鹳 11.1280889297
+碱式盐 12.2912397395
+幸逢 12.5143832909
+普鲁 11.3357282945
+白鹿 9.44633035572
+气平 13.900677652
+四颗星 11.598092559
+谈何 11.9547675029
+阳律 13.900677652
+白鹤 9.53122979951
+李世贤 12.1089181827
+肌萎缩 11.9547675029
+为虎作伥 10.765183436
+古迹 7.86280673205
+白鹭 11.0103058941
+针头线脑 11.3357282945
+锐器 12.2912397395
+潘敏立 12.8020653633
+曼切斯特 13.900677652
+小小 8.24818847171
+真迹 9.89334446674
+硒鼓 13.900677652
+小将 8.51160592216
+将出 13.900677652
+小封 13.2075304714
+敕勒 11.8212361103
+白鹅 10.3743171274
+美好愿望 11.9547675029
+白鹇 10.2371160058
+四亿人 13.2075304714
+绢子 10.604840786
+偏少 10.4349417492
+液体燃料 10.642581114
+试验室 10.9049453784
+一无可取 13.900677652
+刘戊 13.2075304714
+营盘 9.25628675283
+磷矿粉 12.5143832909
+劈倒 12.1089181827
+对映 12.8020653633
+三五十件 13.2075304714
+子康叔 12.8020653633
+不少端 13.900677652
+棋谱 11.5027823792
+参赛选手 10.6818018271
+盆景园 12.8020653633
+垮成 13.2075304714
+溴素 12.5143832909
+疲劳过度 11.0674643079
+小峰 11.3357282945
+不输给 13.2075304714
+福华 11.2616203224
+笑道 6.42477168261
+袖口 9.38981814546
+迪科夫 13.900677652
+公正执法 11.9547675029
+疲累不堪 13.2075304714
+懔懔 13.900677652
+封学文 12.8020653633
+向法王 13.2075304714
+金榜提名 13.900677652
+朱希彩 12.8020653633
+引流 9.85762638414
+马特之 13.2075304714
+异议人 10.7226238216
+小岭 13.2075304714
+床褥 12.5143832909
+对景 10.9562386728
+阿房宫赋 12.1089181827
+太贵 9.65218240993
+小胡子 10.604840786
+资费套餐 12.8020653633
+灰黄色 10.7226238216
+香精香料 13.2075304714
+油母页岩 11.8212361103
+菌核病 12.2912397395
+小岷 12.2912397395
+颠簸 8.81308131674
+临近 7.00297270885
+可染 13.2075304714
+戈梅拉 13.900677652
+说得好 9.22784881751
+宜清利 12.1089181827
+供述 10.1394775363
+将兵 10.604840786
+不爽快 11.9547675029
+可查 10.4666904475
+将养 11.7034530746
+思维力 13.900677652
+灌气 12.8020653633
+蜂起 10.1394775363
+小岛 8.30225569298
+小岗 11.9547675029
+胡吵 13.2075304714
+光滑度 13.900677652
+人为刀俎 13.2075304714
+号丧 12.8020653633
+猛醒 11.1280889297
+小彭 13.2075304714
+诺克斯 11.0674643079
+复用器 13.900677652
+穷乡僻壤 10.6818018271
+蠹国害民 13.900677652
+王汝丰 13.2075304714
+死人 8.73019365694
+南小街 13.900677652
+孙庞 13.900677652
+对方 6.10379730919
+胡吹 11.3357282945
+死亡 6.25527995255
+死产 12.1089181827
+裘锡圭 11.9547675029
+包装袋 11.1926274509
+尤其 5.2778639787
+于阗语 13.2075304714
+以其 7.76511276089
+弓步 12.2912397395
+以免 7.46773755924
+浓妆艳服 13.900677652
+仍须努力 12.8020653633
+禾嘉 11.3357282945
+土地价格 9.54396882529
+赵无极 12.8020653633
+坐忘 11.4157710022
+阳峰 13.2075304714
+乌迪内 13.900677652
+对文 12.1089181827
+不比 8.65365357982
+饮弹身亡 13.2075304714
+圣果 13.2075304714
+死于 7.73525979774
+不毛 11.8212361103
+埃尔夫 13.900677652
+疑罪从有 13.900677652
+错告 13.2075304714
+越聚越 10.4994802703
+芮儿 13.2075304714
+对日 9.09665660724
+财产损失 10.1630080337
+小张 8.92394390956
+一人份 12.5143832909
+劈叉 12.8020653633
+棋迷 13.900677652
+小强 9.15574552361
+明皇醒 13.2075304714
+木尔图 13.2075304714
+李示田 13.900677652
+甲酰 11.9547675029
+广兴 11.7034530746
+镇江市 10.3453295905
+纸笺 13.2075304714
+胃酸过多 12.5143832909
+挤上 10.8096351986
+坐得 10.2897597393
+冷思考 13.2075304714
+基本核算 13.900677652
+外文书 12.5143832909
+姨姊妹 13.900677652
+小异 12.5143832909
+传达室 10.9049453784
+小弟 7.73106691948
+里水 12.8020653633
+坐待 10.765183436
+软件技术 11.4157710022
+不死心 9.74179456862
+王朝改换 13.2075304714
+恭人 12.2912397395
+光想 11.7034530746
+数百万口 12.8020653633
+伊朗议会 13.900677652
+刘戡 13.2075304714
+真谛 9.6811699468
+不正 9.21854642485
+不止 7.26210986281
+甲酸 10.7226238216
+淤地坝 12.8020653633
+乍暖乍寒 13.900677652
+马尼干戈 12.8020653633
+小忠 13.900677652
+神仙会 13.900677652
+对攻 11.5027823792
+数百万台 13.900677652
+整到 12.1089181827
+解放出来 9.98865464655
+不死 8.46259834305
+枳实 11.3357282945
+鲁明善 12.5143832909
+杜洛克 12.2912397395
+瓜田 12.5143832909
+关胜交 13.2075304714
+阳山 10.8561552143
+梁昭明 12.2912397395
+不少种 11.9547675029
+看重 7.86280673205
+冷热水 12.8020653633
+五一劳动节 13.2075304714
+坦丁 12.8020653633
+强买强卖 11.7034530746
+子团圆 13.900677652
+古谚 12.1089181827
+小忙 13.2075304714
+传入神经 11.5027823792
+亲戚关系 11.2616203224
+石牢中 12.5143832909
+完达山 10.765183436
+亲不亲 11.9547675029
+读书处 12.5143832909
+号令 8.25170341381
+圣杯 12.5143832909
+千余头 13.2075304714
+湖光 10.604840786
+摇摆舞 13.900677652
+刀匠 11.9547675029
+无形之中 11.598092559
+合理化 9.96885201925
+未长成 12.2912397395
+声嘶力竭 9.71102290995
+魔爪 11.5027823792
+缓议 12.5143832909
+不欲 10.7226238216
+对数 9.69598503258
+封飞奏 12.5143832909
+鲶鱼 10.9562386728
+天府广场 12.5143832909
+对敌 8.77671367257
+发电所 13.2075304714
+何足道哉 10.642581114
+可擦 12.8020653633
+小径 9.4233408375
+计虑 11.3357282945
+作贡献 11.1926274509
+龙献寿 13.2075304714
+以军 10.4666904475
+人事厅 12.8020653633
+零声母 12.2912397395
+韵书 10.8096351986
+坐式 12.8020653633
+真象 10.2630914922
+小徐 9.63799777493
+亚行 10.6818018271
+生物转化 13.2075304714
+熊山君 12.8020653633
+朱温部 13.2075304714
+灌满 9.94943393339
+陈仓城 11.7034530746
+沙皇统治 12.1089181827
+逆反心理 11.7034530746
+二十四把 12.2912397395
+保证供给 12.2912397395
+小幸 13.2075304714
+胡哥 11.598092559
+颜延寿 12.2912397395
+小年 10.4349417492
+小平 9.61021821083
+职工队伍 12.5143832909
+神武门 11.4157710022
+太远 8.43261751084
+太迟 10.4994802703
+古越 11.4157710022
+如次 12.8020653633
+鹿乡约 12.1089181827
+照样写 13.900677652
+小幅 6.40014816658
+满以为 10.4994802703
+太近 9.37888907493
+念着 9.75754292558
+耗油率 11.9547675029
+可放 10.8096351986
+皮萨罗 10.9562386728
+贫困 7.73106691948
+供货 9.61021821083
+性别歧视 12.8020653633
+读书声 11.3357282945
+对撞 11.4157710022
+醉翁之意不在酒 10.6818018271
+可收 10.8561552143
+太过 8.24818847171
+贫国 12.2912397395
+埃尔塔 13.2075304714
+公民 6.94794900735
+必不可缺 11.4157710022
+豆花 12.1089181827
+瓜瓞 13.900677652
+白鱼 10.642581114
+瓜瓜 11.9547675029
+触板 13.900677652
+音乐作品 10.1871055853
+宋老 13.900677652
+小帽 10.2897597393
+大赔 12.5143832909
+各有特色 10.6818018271
+差别阈限 12.5143832909
+可教 10.8096351986
+蟹壳 11.7034530746
+说得对 8.86372504956
+张之洞 8.1386262692
+吴全节 12.5143832909
+可救 10.3743171274
+必有后福 12.5143832909
+如此 4.92226933735
+可敬 10.3171587135
+近日来 10.1164880181
+满足私欲 13.900677652
+福冈 10.642581114
+徒具形式 11.8212361103
+小帅 11.9547675029
+小布 11.1280889297
+小市 12.8020653633
+湖北日报 13.2075304714
+触杀 11.3357282945
+瓜瓤 12.5143832909
+惠以功 12.8020653633
+福军 9.96885201925
+魔王 9.35738286971
+坐庄 10.533381822
+坐床 11.0674643079
+战斗性 10.6818018271
+尿沉渣 11.9547675029
+可数 11.8212361103
+各怀鬼胎 13.2075304714
+太轻 10.604840786
+冰雾 13.2075304714
+古贤 13.2075304714
+联合体 9.29550746599
+白鲸 12.5143832909
+奸妇 12.8020653633
+交恶 10.7226238216
+太软 10.5684731418
+小建 8.95903522937
+白鲢 11.5027823792
+亚裔 11.1926274509
+从价税 12.2912397395
+福兴 12.1089181827
+白鲨 11.9547675029
+种豆得豆 11.2616203224
+劈刺 11.9547675029
+临界角 12.8020653633
+白鲑 13.2075304714
+圣明 9.49395840471
+司母戊 12.2912397395
+福利部 13.2075304714
+白鲜 13.900677652
+真贵 12.8020653633
+五对 12.8020653633
+代位权 13.2075304714
+颜行书 12.1089181827
+不断进步 10.0294766411
+散件 12.5143832909
+恭奉 13.900677652
+赫蒂彻 12.2912397395
+余万度 12.5143832909
+真贫 13.900677652
+格木 11.598092559
+真货 11.3357282945
+外阴 9.85762638414
+高棉人 11.2616203224
+讲师团 12.5143832909
+第五十四条 12.8020653633
+夹层锅 13.900677652
+妊娠率 13.900677652
+趑趄 13.900677652
+体积计 13.900677652
+一十员 12.1089181827
+联合会 7.43142733518
+特征向量 12.1089181827
+土默特右旗 12.2912397395
+大旋涡 12.8020653633
+分头去 10.3743171274
+进贤 11.3357282945
+薄弱点 12.8020653633
+盐政 10.4041700905
+劈削 13.2075304714
+冰雪 7.94743431769
+何益焉 13.2075304714
+挤得 9.82314020807
+小康 8.88339781516
+齐格达 12.5143832909
+小庵 12.5143832909
+司马懿见 11.5027823792
+坐席 10.0940151622
+死体 11.7034530746
+艺术厅 13.2075304714
+路神 12.1089181827
+白鳝 13.900677652
+熬出 11.7034530746
+本校 10.4994802703
+劣绅 11.5027823792
+三十多名 12.1089181827
+虬髯 10.7226238216
+小店 9.41204128224
+荣归故里 13.2075304714
+喜洋洋 10.7226238216
+叶卵圆 12.5143832909
+赵倜 13.2075304714
+信号肽 13.2075304714
+埃尔朗 13.2075304714
+外来文化 11.3357282945
+五寨 11.4157710022
+积土成山 13.900677652
+如同 6.62897394509
+如后 12.2912397395
+通河县 13.900677652
+借款人 9.34680076038
+罗饶余 12.5143832909
+煎鱼 12.5143832909
+魏家庄 12.8020653633
+五千余箱 13.2075304714
+否定性 12.2912397395
+西里西亚 10.0294766411
+对家 11.9547675029
+萨灵阿 13.2075304714
+破阵子 13.2075304714
+速写 10.4994802703
+交际舞 12.8020653633
+科技史 10.8096351986
+超期羁押 13.900677652
+安陵 11.1280889297
+主导作用 9.85762638414
+双耳瓶 13.900677652
+来日 9.49395840471
+糖苷键 13.2075304714
+猫腰 11.598092559
+挡板 10.9562386728
+测量学家 12.1089181827
+足癣 12.2912397395
+垂杨柳 12.5143832909
+一草一木 11.0103058941
+詹科道 13.2075304714
+四部备要 11.2616203224
+江湖义气 11.8212361103
+号灯 13.2075304714
+军火交易 12.8020653633
+荤腥 10.9562386728
+彭孟 12.8020653633
+乐宫钟 13.2075304714
+蚌壳 9.75754292558
+贫困山区 12.5143832909
+蔬食 12.5143832909
+西燕 10.3743171274
+科技厅 10.4994802703
+不善 8.74162235276
+仲父 12.2912397395
+车马喧阗 13.2075304714
+桑维翰 12.8020653633
+安阳 8.18364995057
+安防 10.8561552143
+赵国光 11.598092559
+娱乐室 13.900677652
+曹孟德 11.3357282945
+小渊惠三 12.5143832909
+男女老弱 13.2075304714
+供应点 13.2075304714
+三十秒 13.900677652
+福源 12.2912397395
+阿剌吉 11.8212361103
+灌入 10.1394775363
+李岩 7.17444424962
+交际花 11.2616203224
+配用 9.43476953332
+木底鞋 12.5143832909
+配电 10.0505300503
+融为一体 9.34680076038
+反光镜 11.598092559
+纳璞福 13.2075304714
+空驶 13.2075304714
+玉亭柱 13.2075304714
+不啻 10.1164880181
+六七十岁 11.5027823792
+熟练地 9.85762638414
+公开审判 11.5027823792
+黑黑白白 13.900677652
+怨入骨髓 13.2075304714
+双开门 12.1089181827
+辉县市 11.1926274509
+嫩苗 13.2075304714
+缴租 13.900677652
+科林托 13.900677652
+阳城县 12.5143832909
+深一步 13.900677652
+解决问题 8.1608847398
+锦团花簇 13.900677652
+城市集群 11.8212361103
+死灰 11.1280889297
+嫩芽 9.74179456862
+明州 10.4041700905
+小憩 10.9562386728
+国家机器 9.98865464655
+端过 11.4157710022
+麻经 13.900677652
+郑重宣布 11.7034530746
+韩国外交通商部 12.5143832909
+踏访 12.2912397395
+鸳侣 12.5143832909
+圣女 10.9562386728
+速冻 10.9562386728
+人民商场 13.900677652
+门吏阻 13.900677652
+死灭 13.2075304714
+反把 11.598092559
+其言 9.02548032877
+舒散 12.8020653633
+老君堂 13.2075304714
+纳斯尔丁 13.900677652
+福清 11.0103058941
+烟台港 12.2912397395
+格里历 12.2912397395
+不明朗 8.53938548627
+遮眼 12.5143832909
+康纳维 12.8020653633
+麻鞋 10.4349417492
+对子 10.2630914922
+懂道理 13.2075304714
+普照大地 13.2075304714
+安静 7.48068272383
+触头 11.598092559
+肃反 10.2897597393
+引出 8.46259834305
+不哭 9.69598503258
+前因后果 10.1871055853
+望兄 12.5143832909
+抬筐 13.900677652
+信息提取 12.8020653633
+安靖 12.8020653633
+吸出来 12.5143832909
+根须 10.2371160058
+情节剧 12.2912397395
+斩断 9.59661255877
+二十四岁 10.8096351986
+以壮行色 13.2075304714
+透味 13.900677652
+乌伦贝克 12.8020653633
+袜底 11.1280889297
+伙夫 10.7226238216
+药剂师 10.9562386728
+圣境 12.5143832909
+和隶农 12.5143832909
+中国崛起 10.2897597393
+几大类 11.0103058941
+气成 11.1926274509
+嫩草 12.1089181827
+十记 12.5143832909
+进行性 9.91169360541
+绿色革命 11.8212361103
+冻豆腐 13.900677652
+食不充口 13.900677652
+经理助理 10.3171587135
+伙头 13.900677652
+麻阳 11.4157710022
+雷斯国 13.900677652
+书启 12.8020653633
+门世族 12.5143832909
+石元雅 13.2075304714
+蝇营狗苟 12.2912397395
+昼伏夜行 12.5143832909
+桃山区 13.2075304714
+宗大德 11.8212361103
+一日不见 12.2912397395
+赵光 13.2075304714
+亮话 11.9547675029
+踌蹰 13.900677652
+阳掌 13.2075304714
+赵兄 13.2075304714
+第十三届 10.2630914922
+莱斯利 12.5143832909
+社科文献出版社 12.2912397395
+欧阳山 12.1089181827
+安霸 13.2075304714
+人事不省 11.5027823792
+纵论 11.5027823792
+湖滨 9.04086524761
+可学 12.1089181827
+兰那泰 12.2912397395
+这么点儿 11.7034530746
+赵公 12.8020653633
+万贯家 13.900677652
+潘汉年 11.4157710022
+赵全 12.1089181827
+翟俊杰 13.900677652
+嫩茎 10.9049453784
+藏身处 12.1089181827
+青苍色 13.2075304714
+房县 9.93038573842
+不明智 10.765183436
+增纳 12.5143832909
+麻醉药 11.0103058941
+赵军 10.2630914922
+人事不知 11.5027823792
+普及型 12.5143832909
+和冬云 12.5143832909
+杰斯 12.2912397395
+第一百回 13.2075304714
+不周 9.93038573842
+小惠 10.765183436
+湖心 9.56994431169
+易卜拉欣 9.62401153296
+羊杂碎 12.1089181827
+引入 7.08394177138
+谢志光 12.8020653633
+肃南 13.900677652
+堵心 12.8020653633
+客观唯心主义 10.642581114
+小玫瑰 13.900677652
+合心 11.598092559
+台统兵 13.2075304714
+溜走 10.0720362555
+山高水远 12.8020653633
+圣堂 11.1926274509
+分裂细胞 12.8020653633
+唇系带 13.900677652
+麻雀 8.58747167293
+山猫队 13.900677652
+可容 10.0294766411
+说地谈天 13.900677652
+足矣 9.84023464143
+摸黑 10.1871055853
+立锥之地 11.4157710022
+从未能 12.5143832909
+祖传 9.48183704418
+引儿 13.900677652
+暗室亏心 13.900677652
+尤溪 12.1089181827
+试验期 13.2075304714
+洗涤器 13.900677652
+灵壁 13.900677652
+不含 8.38322475551
+熠熠生辉 10.765183436
+保龄 11.8212361103
+关法 13.900677652
+迦南人 11.2616203224
+湖湘 12.5143832909
+肃北 11.9547675029
+宣徽院 12.1089181827
+维金人 11.1926274509
+新生事物 9.6811699468
+试验机 10.765183436
+炎凉 12.5143832909
+柳翠 13.2075304714
+不吃 7.57631868959
+埃尔曼 13.900677652
+不同 4.36391537923
+垂直线 11.598092559
+第次 12.8020653633
+膨化 13.2075304714
+不合 8.1608847398
+不向 9.44633035572
+不吐 11.598092559
+可对 8.85725253506
+从文中 13.900677652
+不吝 10.642581114
+妄想症 13.2075304714
+醒觉 12.2912397395
+湖湾 10.642581114
+灌口 11.9547675029
+张骞西 13.2075304714
+搞糟 12.2912397395
+项目管理 10.1871055853
+十袋 12.8020653633
+随机因素 11.7034530746
+紫云英 11.0674643079
+酱黄瓜 13.2075304714
+巴尼河 13.900677652
+福泽 12.2912397395
+两得其便 13.900677652
+杨师傅 13.2075304714
+气愤 8.25877058104
+天然湖泊 10.9562386728
+纵裂 11.0103058941
+山寻龙 11.8212361103
+福泉 12.2912397395
+许辛之 12.2912397395
+维埃克斯 12.8020653633
+沉疴难起 13.2075304714
+八回 12.8020653633
+空飞 13.2075304714
+空飘 13.2075304714
+婚育 13.2075304714
+剃头 9.54396882529
+湖淀 13.2075304714
+错案 10.9049453784
+外文版 13.2075304714
+宣武门 9.56994431169
+八团 12.1089181827
+十四颗 13.2075304714
+空气锤 13.2075304714
+宜农 10.7226238216
+抗毒血清 13.900677652
+坐探 10.9049453784
+生物学系 12.8020653633
+骨伤病 13.900677652
+引动 10.9049453784
+狼狈为奸 10.9049453784
+六七十年 11.4157710022
+足球 8.20358416547
+灌县 10.6818018271
+福河 12.5143832909
+可塑 11.7034530746
+医疗保险 8.95903522937
+引力 8.50705010562
+挤爆 12.8020653633
+穷兵黩武 11.0674643079
+号牌 9.7898037878
+蛟河 11.1926274509
+能征善战 12.1089181827
+套用 10.2630914922
+空额 10.7226238216
+端起 8.61241062128
+量成 12.8020653633
+满朝忠义 13.900677652
+不坠 11.598092559
+符在王 12.8020653633
+卫国保家 13.900677652
+纵行 10.3743171274
+埃尔文 13.2075304714
+医疗保障 10.3171587135
+士可杀不 13.900677652
+宗二朝 13.900677652
+式调度 13.900677652
+扑面而来 9.91169360541
+对头 9.28555713513
+毫无把握 11.0674643079
+铜版印刷 13.900677652
+触媒 11.5027823792
+谈点 11.3357282945
+克雷洛夫 11.8212361103
+宜兰 10.2897597393
+圭臬 12.1089181827
+不坏 9.40086798165
+咬断 10.2117981979
+介意 10.3743171274
+陈吏部 12.8020653633
+雷霆之怒 11.4157710022
+灌南 12.2912397395
+官汉儿 13.2075304714
+大韩民国 11.8212361103
+口密腹剑 13.900677652
+平均地权 10.4666904475
+埃尔斯 11.4157710022
+苑监官 12.8020653633
+对外 6.21911728942
+得不偿失 9.98865464655
+湖流 12.1089181827
+明力 12.8020653633
+代益 12.8020653633
+保鲜 10.0940151622
+物理课 12.8020653633
+帕拉迪 12.2912397395
+引到 8.86372504956
+相互辉映 12.1089181827
+十街 13.2075304714
+红一方面军 10.604840786
+尘粒 11.7034530746
+赵勇 11.2616203224
+鞠躬礼 11.8212361103
+灌区 8.95903522937
+嫩肤 11.8212361103
+阴转阳 13.2075304714
+宋守军 13.900677652
+如因 10.3453295905
+配着 11.0103058941
+灭口 11.1280889297
+模糊化 13.900677652
+张金线 13.900677652
+嫩肉 13.2075304714
+荤菜 10.9562386728
+湖海 11.5027823792
+如图 9.04864738806
+圣子 11.0103058941
+阳性 8.47133202302
+不见踪影 9.89334446674
+膨出 10.5684731418
+唐总章 13.2075304714
+不因 9.98865464655
+伏在鞍 13.2075304714
+朱东润 12.5143832909
+李齐贤 13.2075304714
+引号 10.2371160058
+特高频 12.2912397395
+韦塞克 13.900677652
+溜进 10.3743171274
+孟家和 13.2075304714
+严旨切 11.4157710022
+篮坛 12.8020653633
+纵览 10.6818018271
+小批 11.2616203224
+王子安 12.8020653633
+赵包 13.2075304714
+气性 10.3171587135
+不图 10.6818018271
+没这回事 12.5143832909
+喘出 13.2075304714
+人气旺盛 11.8212361103
+小手 8.81308131674
+夏文 10.3171587135
+华势力 11.598092559
+可大 10.4666904475
+引取 13.900677652
+胡启立 12.1089181827
+以求 8.43261751084
+参考文献 11.5027823792
+坦率 9.80633308975
+人工岛 10.8096351986
+下场门 12.8020653633
+不回 8.60737282725
+湖沼 9.20932976975
+气态 9.61021821083
+篮圈 12.5143832909
+于废帝 12.8020653633
+气恼 9.46986085313
+马杰 11.9547675029
+引去 11.4157710022
+刀口 10.4041700905
+远视眼 11.9547675029
+湖泊 7.11622058934
+新生报 12.8020653633
+小房 10.3453295905
+气息 7.64492761022
+十角 13.2075304714
+赵午 13.2075304714
+帕西法 13.900677652
+小户 9.7898037878
+耍花招 11.7034530746
+小戏 10.0720362555
+来踪去迹 13.2075304714
+节庆日 13.900677652
+衫裤 11.9547675029
+溜达 10.4349417492
+汉口市 12.5143832909
+分析程序 13.900677652
+山西梆子 12.1089181827
+稻城 11.9547675029
+铅白 13.2075304714
+至阴 12.8020653633
+可好 9.00283785202
+周绍良 13.900677652
+赵卫 12.5143832909
+小战 12.5143832909
+天地不容 11.4157710022
+万八千 12.2912397395
+湖泽 11.7034530746
+小成 12.8020653633
+片言折狱 13.2075304714
+人物肖像 11.0103058941
+优哉 13.2075304714
+抠到 13.2075304714
+惹人烦 13.900677652
+加塞儿 13.900677652
+赛先生 13.900677652
+衬垫 10.765183436
+魏弘简 13.2075304714
+萧绎命 12.8020653633
+陈永贵 12.5143832909
+贫穷落后 11.1280889297
+福海 10.8561552143
+古礼义 13.2075304714
+瘟疫论 13.900677652
+小拳 12.5143832909
+互相标榜 12.8020653633
+费尽周折 11.3357282945
+介怀 12.2912397395
+王骥 12.8020653633
+加泰罗尼亚语 13.900677652
+安闲 10.7226238216
+龙引兵 13.2075304714
+玉门镇 12.2912397395
+西斯一世 13.2075304714
+湖水 7.68807155622
+二十四席 13.900677652
+吞吐能力 10.6818018271
+以法 10.8561552143
+大宛国 13.900677652
+叫骂声 11.1926274509
+格曼 11.598092559
+麻钱 11.3357282945
+疯人院 11.598092559
+护理系 13.2075304714
+说得来 11.8212361103
+小报 10.3453295905
+哈姆林 13.2075304714
+真定军 12.1089181827
+灌制 12.2912397395
+翻搅 11.8212361103
+灌到 11.9547675029
+语焉不详 10.642581114
+秦良玉 9.5062284973
+圣婴 11.2616203224
+衫衣 13.2075304714
+轰到 13.900677652
+拼版 13.900677652
+伛偻 12.5143832909
+最高院 12.5143832909
+时时事事 12.8020653633
+赵叶 12.2912397395
+二十四年 8.40350942668
+玉良马 13.2075304714
+不敌 9.87532596124
+斩杀 10.8096351986
+邵抚台 12.8020653633
+受损害 10.1630080337
+周砥见 13.900677652
+粮食产量 9.46986085313
+气机 10.1164880181
+空目录 13.900677652
+赵君 13.2075304714
+红六军团 11.7034530746
+以此 6.79407151425
+透入 10.5684731418
+狄奥芳 13.900677652
+弓兵 12.1089181827
+加把劲 11.4157710022
+赵同 13.2075304714
+本乡本土 11.4157710022
+诸猛安 13.900677652
+霜剂 12.8020653633
+解梦 13.900677652
+宜城 10.7226238216
+盗窃案 12.8020653633
+好高骛远 11.2616203224
+大栅栏 11.598092559
+小数 10.1630080337
+小敏 12.2912397395
+不准 7.15544130249
+透光 10.4994802703
+创纪录 9.0884932966
+正羽 13.2075304714
+阳曲 11.4157710022
+不减 8.59737274392
+保驾 10.4994802703
+对待 7.17925195119
+混淆不清 12.2912397395
+顶风冒雨 12.8020653633
+煤焦 11.7034530746
+特制订 12.5143832909
+干打雷 12.5143832909
+焙制 12.8020653633
+销魂 10.2371160058
+须发皆白 11.3357282945
+弓儿 13.2075304714
+巴尼帕 12.8020653633
+谱估计 13.900677652
+以次 10.642581114
+天水 8.78868986362
+科技型 10.2117981979
+不冷 10.765183436
+建院 11.0103058941
+小改 13.900677652
+房管局 9.04864738806
+马略卡岛 13.2075304714
+一百数十 12.2912397395
+安立路 13.900677652
+卡卢加 13.2075304714
+绢扇 11.9547675029
+多样式 13.900677652
+阿亚克斯 13.2075304714
+不再 5.46643138138
+疾控中心 9.71102290995
+糖苷酶 13.900677652
+连体婴 13.900677652
+玉田县 11.0103058941
+网络实名 11.8212361103
+引咎 12.5143832909
+长工 9.04086524761
+赵周 12.8020653633
+纵身 8.86372504956
+不冒 11.7034530746
+张养浩 11.8212361103
+那蜂儿 13.2075304714
+不入 9.17328983326
+前朱雀 13.900677652
+农村政策 11.7034530746
+十八九个 13.900677652
+唐玄宗 8.79473217808
+不公 9.35738286971
+互谅互让 12.1089181827
+不全 8.43684584695
+斥责 8.99540287354
+咬掉 10.9562386728
+不兴 9.94943393339
+汽车交易 12.5143832909
+气枪 11.8212361103
+透出 8.83808261895
+不关 10.0940151622
+勇于 9.48183704418
+长距离 9.5062284973
+小时 5.74589007921
+出勤率 12.1089181827
+故又名 9.96885201925
+医药 6.10667856247
+消费市场 8.94485059437
+程子华 13.2075304714
+索长林 11.598092559
+小族 12.5143832909
+对弈 10.7226238216
+不允 9.93038573842
+采茶戏 13.900677652
+平均线 10.0720362555
+散会 9.91169360541
+不免 7.11509000697
+对开 9.4233408375
+不光 8.05423887692
+不先 10.4349417492
+不克 9.80633308975
+五十余只 13.2075304714
+死球 11.7034530746
+将校 8.87679713113
+踏进 9.26594866375
+死理 12.8020653633
+福橘 12.2912397395
+小旗 10.1164880181
+瓷实 11.7034530746
+道尔顿 10.5684731418
+不支 10.604840786
+气极 12.5143832909
+昌吉回族自治州 11.598092559
+特意 7.60172840512
+坐收 10.642581114
+如像 12.1089181827
+认罪服法 12.8020653633
+优厚 9.53122979951
+阳明 9.44633035572
+原原本本 10.6818018271
+农场地 13.2075304714
+比赛场地 10.765183436
+流行病学 10.2897597393
+数字相机 13.900677652
+吴敬琏 9.6811699468
+坐支 13.900677652
+台湾街 13.2075304714
+小新 13.2075304714
+蜻蜓 9.54396882529
+蜻蜒 12.8020653633
+气柜 13.2075304714
+铁元素 11.1926274509
+润湿剂 11.9547675029
+新生儿 8.62767809341
+小文 10.4041700905
+端详 8.71889410168
+土球移植 13.900677652
+引向 9.44633035572
+龙山县 13.900677652
+赵哲 12.8020653633
+消色差 12.5143832909
+万多公顷 9.24671730182
+套现 7.94743431769
+可延 12.2912397395
+身边 5.8250950153
+中华全国总工会 10.5684731418
+阳春 10.2897597393
+别之弟 13.2075304714
+屈光间 12.8020653633
+来攻 9.25628675283
+错漏 11.9547675029
+千万吨 10.9562386728
+黄飞鸿 12.5143832909
+陆军总部 13.2075304714
+套版 13.2075304714
+嫌恶 10.8561552143
+钼酸铵 13.2075304714
+煎饼 10.4994802703
+普及化 12.5143832909
+北岳区 11.8212361103
+以德 10.7226238216
+陈胜少 13.2075304714
+副线 13.900677652
+国家版权局 11.7034530746
+掌其金 13.2075304714
+小摊 10.2117981979
+只可意会 11.7034530746
+宿于家 13.2075304714
+交还 9.43476953332
+气昏 13.900677652
+变焦镜头 13.900677652
+移开 9.72629038208
+小南河 11.1280889297
+科技园 10.765183436
+第一一五 12.8020653633
+蜻蛉 13.900677652
+对应 6.75311838079
+黄群藻 12.5143832909
+青光眼 10.1164880181
+消耗性 11.3357282945
+鄯善 9.80633308975
+埃尔托 12.1089181827
+嫌怨 12.5143832909
+奸猾 11.4157710022
+做一天和尚撞一天钟 13.2075304714
+专修科 10.9562386728
+安卡拉 10.533381822
+阳极 9.58318953844
+王马 13.2075304714
+可当 9.96885201925
+对歌 11.3357282945
+读书报 13.2075304714
+水平仪 12.8020653633
+面人儿 13.2075304714
+鳞伤 13.2075304714
+大勃律 12.5143832909
+校牌 12.5143832909
+乔姆斯基 12.1089181827
+唐西州 12.5143832909
+元遗山 12.2912397395
+如其 9.5062284973
+政务信息 12.8020653633
+瓜代 13.900677652
+篮儿 11.1280889297
+总统大选 11.1280889297
+贫油 11.1280889297
+清夜扪心 13.900677652
+可推断 11.9547675029
+有失远迎 11.3357282945
+德雷格尔 13.900677652
+赤老温 12.5143832909
+中石器时代 10.6818018271
+地远山险 13.900677652
+宋国荣 13.900677652
+可得 8.0600359946
+肃坐 13.900677652
+出色完成 11.9547675029
+发财致富 9.91169360541
+霜叶 12.1089181827
+不假 8.89004235788
+上道儿 13.2075304714
+可循 9.96885201925
+低洼地区 10.765183436
+纵轴 11.0103058941
+更香 12.5143832909
+死生 10.8096351986
+剃度 10.604840786
+归墟卦 10.604840786
+真金先 13.2075304714
+一百七十多个 13.900677652
+一十八年 12.8020653633
+不停 6.74919218807
+追猎 11.9547675029
+生存竞争 10.9049453784
+眼珠儿 11.8212361103
+叙事 8.64318227995
+不倦 10.2371160058
+联汇制 13.2075304714
+套犁 12.8020653633
+承让 13.900677652
+搞笑 10.533381822
+穆列什 13.2075304714
+众醉独醒 13.900677652
+阳朔 10.3171587135
+谁来管 12.5143832909
+布列塔尼 10.533381822
+马雷霍 12.8020653633
+不值 9.58318953844
+圣山 10.9562386728
+差劲 10.8096351986
+芬兰马克 13.2075304714
+洗涤剂 10.5684731418
+齐眉棍 12.5143832909
+十车 12.1089181827
+优劣 8.73589167805
+身躯 8.28390655431
+镰刀 9.44633035572
+小东西 10.0940151622
+橡树 8.51618258919
+四类 9.63799777493
+胡蓝之 13.2075304714
+保山市 11.7034530746
+达旺 11.7034530746
+优势 5.64562874922
+不倒 9.94943393339
+不足者 11.8212361103
+十载 10.4041700905
+富韬略 11.3357282945
+小杯 10.9562386728
+优先 7.47580862807
+堵塞 8.11685246965
+数以百计 10.3743171274
+小杨 9.29550746599
+红高粱 11.4157710022
+岑仲勉 10.9562386728
+不可 5.47933478622
+复杂性 8.75318317516
+中国地质学会 11.8212361103
+坚持下去 9.91169360541
+不叫 8.79473217808
+小板 11.8212361103
+小松 11.1280889297
+如初 10.0720362555
+一百二十七 12.8020653633
+圣德 10.2630914922
+现金额 10.0940151622
+小杰 13.2075304714
+小李 9.44633035572
+水果 7.09274270828
+炮身 10.2371160058
+潮热 10.0294766411
+欢喜若狂 13.2075304714
+韩三国 10.5684731418
+耍花枪 13.900677652
+小权 12.8020653633
+启东市 12.2912397395
+二十四家 13.2075304714
+不及 7.0590621755
+葛巾 13.900677652
+不受 7.07957017972
+小杜 12.2912397395
+不发 9.38981814546
+圣徒 10.2117981979
+建阳 10.9562386728
+不平等性 13.900677652
+不变 6.26392553954
+小村 9.01787572939
+光荣牺牲 12.2912397395
+猛然间 9.71102290995
+初体验 12.8020653633
+绒毡层 12.5143832909
+小木 11.0674643079
+尘砂 13.900677652
+如前 9.7898037878
+库普里 13.2075304714
+死相 13.2075304714
+法制化 10.6818018271
+超细粉 11.7034530746
+如剑 11.4157710022
+增氧机 13.2075304714
+集约经营 11.4157710022
+安适 11.2616203224
+身负 10.604840786
+小朱 11.2616203224
+吴兵折 13.2075304714
+安逸 10.2371160058
+日夜不停 10.2897597393
+七五计划 13.2075304714
+小有 10.2630914922
+小月 11.4157710022
+圣心 10.2630914922
+不厌 10.533381822
+砍价 12.1089181827
+坐果 12.5143832909
+邓中夏 11.0674643079
+一纸 8.57766767284
+两万斤 11.9547675029
+女医生 10.4994802703
+坐不住 9.25628675283
+赊欠 11.9547675029
+小柯 13.2075304714
+叩击 10.642581114
+叩出 13.900677652
+萨摩维 13.2075304714
+小事化无 12.1089181827
+透镜光心 13.900677652
+长宁区 11.5027823792
+玄德感 13.2075304714
+诸国 8.22392384971
+贼怎 12.5143832909
+识荆 12.5143832909
+楚汉争 13.900677652
+小柱 12.8020653633
+舷外机 13.900677652
+不升 10.765183436
+货运量 9.25628675283
+三角翼 11.1926274509
+触底 8.12612610643
+象徵性 13.900677652
+古莲 12.1089181827
+法制史 11.1280889297
+不单 9.40086798165
+安部 11.9547675029
+铁工厂 11.7034530746
+基础架构 12.8020653633
+卫鼎高 13.900677652
+偏左 12.1089181827
+安郡 11.5027823792
+内蒙古地区 10.4349417492
+古莱 13.2075304714
+固结 9.7898037878
+堵墙 11.1280889297
+二十四孝 12.2912397395
+赵四 12.5143832909
+保额 10.9562386728
+微机联锁 13.2075304714
+布样儿 13.2075304714
+历学应 13.2075304714
+小枣 11.8212361103
+坦白 9.49395840471
+灌在 12.8020653633
+札木合 11.8212361103
+三二日 12.2912397395
+纵谈 11.9547675029
+万平方米 7.34247984916
+宋江本 13.2075304714
+小架 13.900677652
+踏足 11.9547675029
+申呈中 13.900677652
+赵国基 13.2075304714
+赵国 9.48183704418
+肮肮脏脏 12.8020653633
+绿地率 13.2075304714
+长短途 13.900677652
+客运专线 9.20019728618
+纵谷 10.1871055853
+卓于伊 13.2075304714
+服务到位 11.9547675029
+养路 13.900677652
+司马腾 12.8020653633
+小枝 9.69598503258
+小果 11.3357282945
+气旋 9.55687223012
+小林 9.37888907493
+麻醉 9.04086524761
+琼林玉树 13.900677652
+试验性 10.9562386728
+难以为继 9.74179456862
+安邦 10.4041700905
+小景 11.4157710022
+国土资源部 9.15574552361
+软件应用 13.2075304714
+车将君 13.2075304714
+篮协 13.2075304714
+延安鲁迅艺术学院 11.7034530746
+待补 13.900677652
+跬步 13.900677652
+局所 12.8020653633
+申状 11.5027823792
+宫冥殿 12.5143832909
+对岸 8.49350588052
+终究会 10.7226238216
+石油输出国组织 10.5684731418
+不断进取 13.2075304714
+十趟 13.2075304714
+滑进来 13.900677652
+培训班 9.38981814546
+调节阀 12.2912397395
+阿泰斯特 13.2075304714
+锐气 8.86372504956
+呢喃 10.9049453784
+打退 9.37888907493
+毫无例外 11.2616203224
+极少数人 10.6818018271
+赵地 12.1089181827
+分析员 9.5062284973
+十足 8.0600359946
+小洞天 12.5143832909
+灭鼠药 13.900677652
+援笔 11.8212361103
+哈斯特 13.2075304714
+带菌者 11.4157710022
+以桐 12.8020653633
+科林斯 10.0940151622
+小昭 13.2075304714
+十二步 13.900677652
+东北风 9.5186510173
+铅版 12.2912397395
+错流 12.8020653633
+军事史 10.642581114
+小春 11.5027823792
+营业时间 11.7034530746
+雹暴 13.2075304714
+不动 7.1083332245
+肉食品 11.9547675029
+归城邦 13.2075304714
+尤格 13.900677652
+五堰 12.8020653633
+高亮度 11.8212361103
+拾遗补缺 12.2912397395
+锡林郭勒盟 10.2897597393
+新洲县 13.900677652
+曼努埃尔 11.5027823792
+阳文 11.598092559
+如博 12.8020653633
+伊兰咬 13.900677652
+老元臣 13.2075304714
+小明 11.1280889297
+中学教师 10.7226238216
+鸱尾 13.2075304714
+阳新 10.0294766411
+东欧各国 10.6818018271
+坐像 10.3453295905
+对峙 8.14493543839
+水鸪鸪 13.900677652
+一向如此 12.5143832909
+消耗战 11.1280889297
+生物学科 12.5143832909
+不力 8.98802276624
+仲甫 12.5143832909
+誓死 9.96885201925
+猥猥 13.900677652
+阿斯塔那 11.2616203224
+喀喇昆仑 12.5143832909
+静一动 12.5143832909
+蠢驴 12.5143832909
+如厕 11.598092559
+毁灭性 9.28555713513
+校点 10.1871055853
+阳原 11.8212361103
+小曲 9.69598503258
+路直隶 13.2075304714
+第五十六章 11.3357282945
+马派 12.2912397395
+浮夸风 12.2912397395
+粮源 11.5027823792
+杨文意 12.8020653633
+卑鄙 9.41204128224
+阳数 11.9547675029
+对射 10.8096351986
+梅花诗 13.2075304714
+生活道路 10.9562386728
+须送 12.8020653633
+循环反复 12.5143832909
+铁手镯 13.900677652
+西方人 9.06439574502
+塔吊 10.4994802703
+帕西格 13.900677652
+董邵南 13.2075304714
+垮塌 11.1926274509
+武昌鱼 10.4666904475
+法制办 10.6818018271
+中原军区 11.0103058941
+中国水产学会 13.2075304714
+不利 6.72518793835
+宜君 11.9547675029
+休闲服 12.1089181827
+瓷壶 12.2912397395
+赵城 11.0103058941
+七十五年 13.900677652
+不到 5.33621926809
+反朴归真 13.900677652
+国家机关 8.85082164473
+左良玉 7.60541165054
+新洲区 13.900677652
+弓力 11.9547675029
+传声筒 11.598092559
+不切 12.1089181827
+不分 7.96314144689
+陈果夫 10.604840786
+天沟 12.2912397395
+进行曲 9.71102290995
+铱金笔 12.8020653633
+可液化 13.900677652
+对局 11.0103058941
+酢浆草 11.9547675029
+广义坐标 11.0103058941
+霜冻 9.26594866375
+炮车 10.642581114
+南坪县 11.9547675029
+纵贯 8.06294720481
+将此 12.8020653633
+医者 11.0103058941
+如右 12.8020653633
+炮轰 9.49395840471
+置装 12.8020653633
+小暑 11.9547675029
+亮起 9.75754292558
+尤杯 13.900677652
+不巧 9.87532596124
+十节 12.8020653633
+以来 4.67210451174
+可分 8.19356738723
+不差 8.83177344976
+当过兵 10.9562386728
+小楠 12.8020653633
+惩治腐败 11.8212361103
+桑德贝 13.2075304714
+小楼 8.87679713113
+不已 7.68008748188
+小楷 10.765183436
+谦躬下士 13.2075304714
+如尘 13.900677652
+穷人 7.96843246453
+仙气 9.82314020807
+夏帕克 13.2075304714
+可别 8.5440913773
+号码 8.30969067146
+马达加斯 13.900677652
+穷于 10.642581114
+可判 12.1089181827
+竺监藏 13.2075304714
+开箱 11.1280889297
+灭失 11.1280889297
+持久之计 13.900677652
+瓷土 9.74179456862
+日行一善 11.8212361103
+保险 6.20128824572
+见票即付 13.900677652
+可到 8.83808261895
+上楼来 9.69598503258
+阍人 13.900677652
+处理过程 10.8561552143
+气死 9.69598503258
+优异 8.092535162
+对口 9.80633308975
+达尔文港 13.2075304714
+司马迁 9.23723855786
+娱乐厅 12.5143832909
+向御营 13.2075304714
+国际金融公司 10.765183436
+缥缈录 13.900677652
+遮羞 12.2912397395
+宜宁 13.900677652
+对台 10.8561552143
+如属 11.3357282945
+陆学 12.2912397395
+债券市场 7.37858485381
+宜安 13.2075304714
+宜家 10.8561552143
+叶卵形 12.8020653633
+以月 12.5143832909
+组装线 13.900677652
+宜宾 9.40086798165
+堵嘴 13.900677652
+潮红 9.98865464655
+登个 13.900677652
+以期 8.77077893705
+识趣 11.598092559
+如山 9.85762638414
+杨真 8.93783302172
+可操作性 9.43476953332
+指点迷津 10.8561552143
+叩开 12.8020653633
+备注 10.1871055853
+蛛网 9.98865464655
+本源 10.4041700905
+宝庆寺 12.8020653633
+扎西 11.3357282945
+庞尚鹏 11.7034530746
+滋补品 10.9562386728
+方密之 10.8561552143
+涡阳 11.8212361103
+共同条令 12.2912397395
+长期负债 12.5143832909
+节油器 12.1089181827
+穷举 13.2075304714
+吴师败 13.2075304714
+遮罩 13.2075304714
+互争雄长 12.5143832909
+福晋 8.2273543848
+披心相付 13.2075304714
+胫骨 10.6818018271
+不断深入 10.1871055853
+可加 10.533381822
+酸性反应 11.9547675029
+看守所 9.61021821083
+巴露丽 12.8020653633
+先进事迹 11.8212361103
+婚姻生活 11.1926274509
+痱子 10.9562386728
+首户 12.1089181827
+邓稼先 10.9049453784
+四百五十万平方米 13.2075304714
+保障 6.05839887286
+中国光大银行 10.8561552143
+美容美发店 12.8020653633
+优待 9.04864738806
+阳樊 13.2075304714
+圣典 11.3357282945
+凤姐 7.84623830571
+呜呜咽咽 9.80633308975
+十艘 11.7034530746
+贴附 11.598092559
+洒出 12.8020653633
+嗳声叹气 12.8020653633
+卡斯特里 11.9547675029
+特律昂 13.2075304714
+圣光 13.2075304714
+对半 12.1089181827
+赵壹 12.2912397395
+对华 8.6966709649
+东北面 10.7226238216
+庄客牵 13.2075304714
+小榄 11.2616203224
+赵声 13.900677652
+叩得 12.5143832909
+娱乐区 11.9547675029
+督抚 9.45802639549
+隐私权 10.765183436
+识货 10.642581114
+外流河 10.9049453784
+亮色 10.533381822
+盐枭 13.900677652
+墨索里尼 9.15574552361
+福柯 12.5143832909
+维德曼 12.8020653633
+保靖 12.1089181827
+梦工厂 12.5143832909
+孟家庄 11.3357282945
+小桥 9.75754292558
+谈笑 9.48183704418
+挤水分 12.5143832909
+本府 10.0940151622
+东北隅 11.4157710022
+特许加盟 13.900677652
+炮膛 10.4349417492
+法制局 10.4666904475
+可化 11.9547675029
+对劲 10.642581114
+堵破洞 13.900677652
+普遍 5.54130854575
+小桌 10.4666904475
+醒脑 11.3357282945
+水磨功夫 12.5143832909
+炎夏 11.5027823792
+徐夫人 13.900677652
+魏元忠 12.8020653633
+刚烧 13.2075304714
+高拱领 12.8020653633
+厚生省 13.900677652
+以晚 12.8020653633
+赵大 12.2912397395
+埃尔温 12.5143832909
+督捕 12.1089181827
+高线 10.604840786
+以是 12.1089181827
+品行不良 12.8020653633
+阿卡胡 13.900677652
+将旗 12.8020653633
+施朱傅粉 13.900677652
+甜言蜜语 10.604840786
+肃宁 11.9547675029
+含糊其词 12.5143832909
+瓷器 8.17382990439
+小格 13.900677652
+进退无门 11.9547675029
+由洛尔 13.2075304714
+小样 11.3357282945
+惊喜交集 12.8020653633
+固然 7.58170953823
+洗碗机 12.2912397395
+简易程序 11.1280889297
+麻鸭 10.2897597393
+尤明 13.2075304714
+近道 12.5143832909
+工作日程 12.8020653633
+圣像 10.0940151622
+庄周 9.17328983326
+秦玉兰 13.900677652
+彩装 13.900677652
+透射 10.1871055853
+煎锅 13.900677652
+苏尼特 12.8020653633
+中学化学 12.2912397395
+天主教派 11.9547675029
+肃容 11.1280889297
+心到神知 13.2075304714
+女色 10.0940151622
+福林 11.5027823792
+烟袋锅 11.4157710022
+绿丛丛 13.900677652
+小树 9.94943393339
+重新 5.29309546083
+刚灌 13.900677652
+追缴 10.2897597393
+可厌 11.0674643079
+铅粉 12.1089181827
+校级 12.1089181827
+浮沉 10.2630914922
+近邻 9.75754292558
+投稿 10.3743171274
+缩印本 12.1089181827
+合作伙伴 8.60236028543
+套结 13.900677652
+二十四名 12.5143832909
+集镇 9.22784881751
+行政主管 13.2075304714
+动作迅速 13.2075304714
+帕拉蒂 13.900677652
+疑神见鬼 12.1089181827
+白豆蔻 12.8020653633
+单胞菌 11.3357282945
+不屈 9.40086798165
+对分 12.5143832909
+吴法宪 11.0674643079
+可去 9.41204128224
+小棚 11.9547675029
+耍花样 13.900677652
+麻黄 9.49395840471
+呈献给 12.5143832909
+教学模式 11.9547675029
+紧密性 13.2075304714
+不属 9.72629038208
+追缉 11.4157710022
+阳武 11.1926274509
+安龙 12.1089181827
+拂逆 11.8212361103
+自动驾驶 12.2912397395
+小船坞 13.900677652
+南梁 11.4157710022
+民政厅长 12.5143832909
+触击 12.1089181827
+滴眼药 11.9547675029
+三十多户 13.2075304714
+正正经经 11.4157710022
+战数合 12.2912397395
+舟桥器材 13.2075304714
+滴下 10.2371160058
+号称 7.57811241205
+不尽 7.93197009199
+可取 8.95903522937
+可发 11.7034530746
+可可 8.7245279194
+联合社 11.4157710022
+不封 11.2616203224
+套红 13.2075304714
+滴丸 12.1089181827
+浏览者 13.900677652
+不小 7.18893725692
+芮伯 12.2912397395
+可口 8.9519177616
+死神 9.34680076038
+小梁 10.9562386728
+华中科大 12.1089181827
+实际工资 11.1926274509
+正镶白旗 13.900677652
+不少 5.04458659672
+坐标 8.35941410682
+集锦 12.1089181827
+第三十六章 11.1280889297
+饮食文化 11.598092559
+近郊 8.60236028543
+战略眼光 11.1280889297
+触到 9.77354326693
+自转轴 10.0294766411
+赵娟 13.900677652
+马引军 11.9547675029
+胶合板厂 12.8020653633
+青枝绿叶 12.1089181827
+小武 12.1089181827
+小步 9.62401153296
+不快 7.92941581219
+不念 10.0505300503
+透彻 9.20932976975
+供应站 11.8212361103
+芯片组 13.900677652
+弓形 10.1630080337
+对决 11.0103058941
+消耗品 12.8020653633
+热定型 13.2075304714
+十股 13.900677652
+马思 12.8020653633
+炖汤 11.9547675029
+汪辟疆 13.2075304714
+于圣西 12.1089181827
+以故 12.1089181827
+贪吃懒做 13.900677652
+对内 8.31718134319
+协和医院 10.8561552143
+贴钱 12.5143832909
+库洛尔 12.5143832909
+一式一样 13.2075304714
+如常 9.15574552361
+不忘 9.14708746087
+格里夫 13.900677652
+肖克 13.2075304714
+刚玉 10.2897597393
+过明叔 12.5143832909
+别上来 13.900677652
+一九七五年 12.8020653633
+狗东西 9.98865464655
+小欣 12.5143832909
+大儿子 9.01787572939
+托起 10.3453295905
+弓弩 9.44633035572
+可停 13.2075304714
+弓弯 12.8020653633
+郭兰英 12.8020653633
+烙成 12.8020653633
+弓弦 9.89334446674
+医院地址 13.900677652
+不待 9.07236391467
+醋酸乙烯酯 13.2075304714
+赵元奴 11.3357282945
+不往 9.33632946051
+赵婴 13.2075304714
+劈柴 10.2117981979
+对准 8.27305653829
+不得 5.62606570577
+摸错 12.5143832909
+出品人 12.2912397395
+喜极而泣 11.7034530746
+如干 13.900677652
+摘走 11.5027823792
+李娃 12.1089181827
+和风细雨 11.5027823792
+二龙山 10.8561552143
+灾难片 11.1926274509
+转向架 13.2075304714
+科技奖 12.5143832909
+征婚者 11.9547675029
+将星 10.8561552143
+坐正 11.5027823792
+伯斯坦 13.2075304714
+对儿 10.9562386728
+鹌鹑蛋 12.2912397395
+触动 8.5440913773
+七十五匹 13.2075304714
+醋酸 9.17328983326
+额前 10.8096351986
+减噪 12.5143832909
+赛努西 13.2075304714
+头脑 7.51886163457
+公子华 12.8020653633
+天津 6.45994394459
+其职 10.1164880181
+赵君徽 12.2912397395
+小毛 10.6818018271
+不当 7.6701962044
+不归 9.82314020807
+炮舰 10.6818018271
+李娜 12.1089181827
+气概 9.14708746087
+教子有方 12.8020653633
+芦花 7.33823355828
+吴县月 13.2075304714
+某时某分 13.900677652
+竟陵派 11.598092559
+曹洪分 13.900677652
+死穴 11.9547675029
+橡木 11.3357282945
+毛惟正 12.8020653633
+配置 5.94911832082
+芦芽 12.8020653633
+远程网 12.8020653633
+巴塔克 12.2912397395
+千年健 13.2075304714
+明律 11.1926274509
+以方 10.9049453784
+林从龙 11.9547675029
+修嗣修 12.5143832909
+宋儒臣 13.2075304714
+小殷 13.900677652
+小段 11.1280889297
+柯尼希 11.7034530746
+点石成金 10.8096351986
+不强 8.25523075433
+对光 9.85762638414
+好心不得好报 13.2075304714
+苏有朋 11.8212361103
+不开 8.08654712015
+不弃 9.32596667347
+同班同学 10.765183436
+尤文 12.1089181827
+赵普遂 13.2075304714
+里奥斯 12.8020653633
+日本共产党 11.8212361103
+空速 11.3357282945
+高维 11.8212361103
+八块 11.1280889297
+范博梅 13.900677652
+书面材料 10.8561552143
+引导 6.71604849926
+保镖 10.2897597393
+贝奇 13.900677652
+化大为 13.900677652
+战斗员 11.5027823792
+桑地 12.8020653633
+宁夏路 12.8020653633
+狗叫 10.3453295905
+福日 11.4157710022
+白头翁 11.4157710022
+芦荡 11.0103058941
+王庆令 13.2075304714
+货物贸易 11.598092559
+分头来 12.8020653633
+配线 12.8020653633
+朝乾夕惕 11.8212361103
+透平 11.0103058941
+长宁店 13.900677652
+用人单位 8.93783302172
+半停产 11.9547675029
+亿万富翁 8.94485059437
+集韵 11.8212361103
+台中盆地 11.5027823792
+正交和 13.900677652
+保长 9.80633308975
+叫天子 13.2075304714
+圭表 10.6818018271
+芦荟 10.9562386728
+风情月债 13.2075304714
+好学上进 13.900677652
+行百艺 13.2075304714
+芦草 11.598092559
+转座子 13.900677652
+吃穿用度 12.5143832909
+吕桑德 13.2075304714
+中外关系 10.9049453784
+福斯 10.3453295905
+妈拉巴子 12.5143832909
+可免 10.9562386728
+修水县 11.8212361103
+可先 9.77354326693
+同学聚会 11.9547675029
+伊勒 11.9547675029
+赵子 12.1089181827
+运动装 12.8020653633
+城市更新 13.2075304714
+尤利塞 12.8020653633
+如旧 10.533381822
+三十二两卷 13.2075304714
+纵膈 13.2075304714
+一亲芳泽 12.8020653633
+惠王死 13.2075304714
+芦茨 12.8020653633
+柠檬酸 10.0940151622
+三十七八岁 13.2075304714
+联委会 12.1089181827
+汪笑侬 12.2912397395
+史府治 13.2075304714
+多氯 13.2075304714
+紧靠着 11.0103058941
+运动裤 13.900677652
+不应 7.40541209604
+号筒 13.2075304714
+塑料薄膜 10.4994802703
+斯克罗普 12.5143832909
+配给 10.0294766411
+险恶用心 12.1089181827
+工资福利 11.1926274509
+望圆 13.2075304714
+骂谁 11.4157710022
+强壮有力 11.9547675029
+赵官 13.900677652
+十四届 10.1394775363
+憋不住 9.93038573842
+销钉 13.2075304714
+老而弥坚 13.2075304714
+切尔诺梅尔金 12.8020653633
+身背 10.9049453784
+赵宏 12.1089181827
+皇家宫苑 12.8020653633
+认沽权证 13.2075304714
+可写 11.0674643079
+哈默尔 12.5143832909
+苯甲酰基 13.900677652
+周宜兴 13.900677652
+不幸 6.96142370593
+国务院新闻办公室 11.5027823792
+五万二千 13.2075304714
+半厘米 12.8020653633
+摩门教 11.8212361103
+流感病毒 9.41204128224
+国步艰难 12.5143832909
+高士其 12.8020653633
+赵家 10.2630914922
+引子 10.0940151622
+大儿媳 12.1089181827
+犬马之报 13.2075304714
+工本费 11.9547675029
+性科学 13.900677652
+人工湖 10.1630080337
+连小娃 13.2075304714
+触压 12.2912397395
+肝肠寸断 11.5027823792
+体操队 11.9547675029
+不带 8.47133202302
+销铄 13.900677652
+如心 11.8212361103
+第十三回 11.7034530746
+桓公台 12.8020653633
+宇都宫 13.900677652
+曲阳县 11.8212361103
+赫哲族 11.0674643079
+五十五类 13.2075304714
+压力机 11.8212361103
+自报家门 11.7034530746
+枯萎病 11.5027823792
+膨大 9.16447920358
+对偶 9.63799777493
+运动衫 11.598092559
+触发 8.45825994145
+可凭 11.0674643079
+运动表 13.2075304714
+运动衣 11.9547675029
+历官至 11.8212361103
+西直门 10.9562386728
+所有物 10.8561552143
+文具店 12.2912397395
+贫户 11.8212361103
+可出 10.9049453784
+王庆一 12.2912397395
+鼓角 10.3743171274
+小檗 11.1926274509
+触及 7.57452817882
+娱乐城 9.63799777493
+伙同 9.89334446674
+可嘉 10.4666904475
+袖手 11.7034530746
+五十余万平方公里 13.2075304714
+识见 10.2897597393
+影剧界 13.900677652
+套筒 10.9049453784
+根长 12.1089181827
+新造型 13.2075304714
+赵将 11.8212361103
+水分子 9.93038573842
+重映 13.900677652
+千形万状 13.2075304714
+小济 12.1089181827
+三十九篇 13.2075304714
+大邱 12.5143832909
+战斗支援 10.4666904475
+弹着点 10.9049453784
+空集 11.7034530746
+正负电子 10.8096351986
+四川人民出版社 11.9547675029
+气极败坏 13.900677652
+常务副 8.71329184614
+三白草 13.2075304714
+端茶 10.4349417492
+对垒 10.3171587135
+兰萨罗 13.900677652
+不妥 8.49350588052
+四十六辑 13.2075304714
+尔辈 13.900677652
+有害无益 11.9547675029
+根键 13.900677652
+战斗化 13.900677652
+福报 11.8212361103
+比拉 11.8212361103
+不妨 7.06227245113
+魏绍旭 13.2075304714
+卢辩 11.8212361103
+小派 13.900677652
+空难 11.9547675029
+玛特卡 13.2075304714
+上海警备区 13.2075304714
+富矿石 13.900677652
+千军 12.2912397395
+小洋 12.2912397395
+举行仪式 10.8561552143
+不如 6.08910916263
+配种 10.4041700905
+反映论 11.1926274509
+堵到 12.5143832909
+稗官野史 13.2075304714
+三八面 13.900677652
+看清楚 8.30969067146
+巴尼拔 11.8212361103
+伸手不见五指 10.1394775363
+出生年月 11.5027823792
+第六十四章 13.2075304714
+萝卜丝 11.1280889297
+不妙 8.52078029844
+集邮 10.642581114
+检查指导 11.2616203224
+心理特点 11.2616203224
+巴西木 11.0674643079
+下巴颏儿 11.5027823792
+坐浴 11.2616203224
+想尽办法 10.3171587135
+童贯之 11.9547675029
+溜完 13.900677652
+肾结石 10.4041700905
+十拿九稳 10.765183436
+阳湖 11.8212361103
+足立 13.900677652
+国防科学技术大学 12.5143832909
+卡斯泰尔 13.2075304714
+不好 5.67116653301
+呢帽 11.8212361103
+爱洗 13.900677652
+太陡 11.9547675029
+空降 8.6803218269
+搬口弄舌 13.900677652
+吴楚兵 13.2075304714
+瓷厂 11.1926274509
+三缄其口 11.0103058941
+自转角 12.8020653633
+封侯赐 13.2075304714
+空际 13.2075304714
+不奏 11.9547675029
+不奈 12.8020653633
+送话器 11.7034530746
+人工化 13.2075304714
+八九丈 13.2075304714
+泪人儿 11.4157710022
+吐露真情 13.900677652
+英美两国 11.9547675029
+娱乐圈 8.93783302172
+追究 7.89186446653
+如春 10.4994802703
+任海军 10.8096351986
+不太 7.50708689803
+狄道城 12.2912397395
+端菜 11.5027823792
+不失 8.63281949291
+伦敦桥 11.8212361103
+摘译 13.2075304714
+产权制度 11.8212361103
+炮龙烹凤 13.900677652
+伤肾 11.0103058941
+可园 11.8212361103
+什邡 11.7034530746
+干太监 13.2075304714
+套管 10.8096351986
+米兰队 12.1089181827
+闹脾气 12.5143832909
+掏尽 12.5143832909
+可因 9.40086798165
+娱乐场 12.1089181827
+可图 10.4994802703
+优容 11.1926274509
+外文系 11.0103058941
+空阔 10.8096351986
+不够 6.50066813481
+阳渠 11.8212361103
+将息 9.6811699468
+唐献名 13.2075304714
+乌苏镇 13.2075304714
+山山水水 11.1926274509
+众寡悬殊 11.0674643079
+小池 11.5027823792
+东皇太 12.8020653633
+疯得 13.2075304714
+严格执行 8.5488195185
+横穿 9.28555713513
+最高额 11.3357282945
+气温 7.09274270828
+坚定性 11.5027823792
+周口店地区 13.2075304714
+嗟叹 9.63799777493
+城府甚深 12.8020653633
+含糊其辞 10.4666904475
+博古通今 11.4157710022
+阴云密布 11.2616203224
+可在 10.2630914922
+挫敌 13.2075304714
+地基承载 13.2075304714
+马德莱 13.900677652
+栅瓣 13.900677652
+小江 10.2897597393
+研究员级 13.900677652
+陈豪 13.2075304714
+从实招来 11.9547675029
+灭尽 12.5143832909
+十四岁 9.65218240993
+怀仁县 13.2075304714
+尼亚加拉大瀑布 13.2075304714
+整宿 12.5143832909
+软骨素 12.2912397395
+错杂 10.4994802703
+吐真言 11.9547675029
+大杂烩 11.5027823792
+吊儿郎当 10.765183436
+富贵逼人 12.8020653633
+头脸 11.0103058941
+一发而不可收拾 12.5143832909
+圣哲 11.8212361103
+小水 11.7034530746
+圆柱状 10.0505300503
+形而上者 12.1089181827
+可坐 11.9547675029
+六七十元 12.8020653633
+宗大历 11.8212361103
+达佛涅 12.5143832909
+齐高帝 11.8212361103
+国家机密 10.533381822
+纵贯线 13.2075304714
+障碍性 10.4349417492
+自由体操 11.0674643079
+专门词汇 13.900677652
+小气 10.0088573539
+唐圣历 12.8020653633
+小民 9.02548032877
+法国人 8.34771806705
+仲翔 12.8020653633
+霜寒 13.2075304714
+海迹湖 12.5143832909
+保德信 9.30555780184
+督查 10.2371160058
+小泽 12.5143832909
+公子发 13.2075304714
+小泉 11.4157710022
+看风使舵 12.8020653633
+大包大揽 10.6818018271
+杨奉 10.8096351986
+宋皇帝 11.9547675029
+刷新纪录 11.1926274509
+圣君 10.2371160058
+毒蘑菇 12.8020653633
+血肉相连 11.2616203224
+德班港 13.900677652
+阿尔泰山脉 10.642581114
+外科手术 9.66657114738
+堵口 11.7034530746
+证治准绳 13.2075304714
+赵州 10.533381822
+誓愿 10.6818018271
+战斗力 8.29120585679
+自选股 12.8020653633
+安眉带眼 13.900677652
+得意之色 11.4157710022
+不堪 7.77380846786
+徐扬 13.2075304714
+帕利基尔 13.900677652
+尝胆卧薪 13.2075304714
+许常惠 13.2075304714
+盐度 9.04086524761
+任务书 11.9547675029
+郁律 12.8020653633
+气滤 13.900677652
+教育为本 13.2075304714
+小河 8.69119149913
+野鸭蛋 13.900677652
+海洋性气候 9.24671730182
+气滞 9.82314020807
+打砸抢 11.4157710022
+霜害 12.8020653633
+小沈 13.900677652
+溥仪先 13.900677652
+武职 9.5186510173
+宝庆府 12.8020653633
+下笔成文 13.900677652
+小沟 11.0674643079
+压力感 12.5143832909
+洁面乳 11.0674643079
+小沛 10.4349417492
+秘密文件 11.8212361103
+额面 12.8020653633
+合理性 8.94485059437
+大同世界 12.5143832909
+一贯煎 12.8020653633
+小潮 12.5143832909
+小潭 13.2075304714
+第五十四回 12.2912397395
+满宠谏 13.2075304714
+云冷杉 12.5143832909
+罗摩历 13.900677652
+宜州 12.5143832909
+张金牙 12.1089181827
+金冲及 12.1089181827
+宜川 11.3357282945
+滋补剂 13.900677652
+子朝栋 13.2075304714
+阳泉 10.533381822
+负责管理 9.98865464655
+伊萨尔河 12.5143832909
+诸子前 13.900677652
+铅笔 9.72629038208
+失写症 13.900677652
+不对 7.6781013839
+万里迢迢 12.8020653633
+可向 9.29550746599
+震颤麻痹 12.2912397395
+王南征 13.900677652
+网上聊 13.900677652
+安顺 9.5186510173
+安顿 8.74738605748
+吴晗因 13.2075304714
+可否 9.07236391467
+识读 11.8212361103
+穷酸相 13.2075304714
+套票 12.8020653633
+支持不住 10.0940151622
+神宗见 12.8020653633
+零度以下 12.8020653633
+零度以上 13.900677652
+小潘 11.8212361103
+不察 11.0103058941
+霍尔斯特 12.1089181827
+李季 11.7034530746
+博城 9.28555713513
+不宣 11.7034530746
+气海 11.8212361103
+降临到 10.4994802703
+叩头 7.45813748551
+气浮 12.5143832909
+东洋车 12.1089181827
+楚康王 13.2075304714
+保送 10.7226238216
+加快调整 11.4157710022
+恰到好处 9.56994431169
+博山区 13.900677652
+不容 7.96314144689
+小本生意 10.7226238216
+死结 10.6818018271
+马礼逊 11.9547675029
+淹埋 12.5143832909
+神圣 7.83922073305
+不宁 9.82314020807
+圣城 10.604840786
+淹城 12.2912397395
+阳河 11.4157710022
+不完 10.6818018271
+二十四史 10.4349417492
+不安 7.07304841747
+不守 9.77354326693
+赵平 11.2616203224
+灌得 11.0103058941
+二十四只 12.1089181827
+东区人 13.2075304714
+莲子粥 12.8020653633
+八层楼 11.598092559
+工宣队 12.8020653633
+不宜 7.07630398193
+不实 9.22784881751
+维新 8.87023973058
+不定 7.90174109003
+具体方法 10.3171587135
+薜荔 12.5143832909
+不学 9.91169360541
+阳江 9.58318953844
+双性恋 13.2075304714
+风扫落叶 13.2075304714
+配第 10.7226238216
+套种 10.8096351986
+摘要 8.70772080109
+水生动物 10.1871055853
+圆筒筛 13.2075304714
+腓骨 11.9547675029
+尘烟 12.5143832909
+对唱 10.2371160058
+赵庄 12.8020653633
+根音 13.900677652
+圣地 8.57280148319
+人民院 12.1089181827
+计程车 13.900677652
+持币待购 11.5027823792
+二十四匹 13.900677652
+绞脑汁 13.2075304714
+十营 12.8020653633
+拂面 10.8561552143
+披甲 10.642581114
+不成人 11.2616203224
+铅管 13.900677652
+逃汇 13.2075304714
+契约型 12.1089181827
+不孕 9.30555780184
+数字通信 11.7034530746
+灌录 13.900677652
+放眼看去 12.8020653633
+荤辛 13.900677652
+气消 11.4157710022
+开立 9.14708746087
+不孝 9.38981814546
+粗米 13.900677652
+艾夫斯 12.8020653633
+自然疗法 12.8020653633
+世贸组织 9.40086798165
+诲淫 12.5143832909
+类库 13.900677652
+须饶 13.900677652
+孙姨 12.8020653633
+宗惊忧 12.8020653633
+必然选择 9.69598503258
+乌洛侯 13.2075304714
+销量 6.74060844438
+阳气 9.26594866375
+销金 10.5684731418
+宽甸满族自治县 12.1089181827
+潘先生 10.8096351986
+将才 10.2371160058
+胜利油田 10.6818018271
+川贝母 12.1089181827
+障碍因素 12.8020653633
+赵建 9.53122979951
+赵廷 12.5143832909
+文体用品 12.5143832909
+重拳出击 10.3171587135
+福态 13.900677652
+二十四卷 12.5143832909
+圣坛 11.5027823792
+代烃 12.1089181827
+囊中物 12.5143832909
+张颢 12.8020653633
+孤子 12.2912397395
+补阳药 11.9547675029
+抢劫案件 13.900677652
+罗斯林 13.900677652
+娈童 11.0674643079
+不来 7.06656891316
+空门 10.604840786
+盛者 11.8212361103
+卡卢姆 13.900677652
+娱乐品 13.2075304714
+希俄斯 12.5143832909
+根除 10.3743171274
+固氮菌 11.2616203224
+几大片 12.8020653633
+坐满 9.61021821083
+南浅北 12.2912397395
+膝下 9.7898037878
+空闻 11.9547675029
+空间 5.2778639787
+贻误终身 13.900677652
+兔子不吃窝边草 12.5143832909
+赵开 12.1089181827
+空闲 9.75754292558
+阳明胃 11.598092559
+李存 11.9547675029
+不嫁 11.598092559
+气氛 6.70699183358
+产生纠纷 11.598092559
+气气 12.1089181827
+立体角 12.1089181827
+固着 9.21854642485
+李孚 13.900677652
+冰川学家 12.5143832909
+四章 11.5027823792
+错放 13.2075304714
+刚直 10.9562386728
+小湖 10.0720362555
+统一祖国 11.4157710022
+不粘锅 12.5143832909
+眼皮跳 13.2075304714
+更上一层楼 11.2616203224
+殖民政策 11.7034530746
+货真价实 9.7898037878
+掌握住 11.3357282945
+熊腰虎背 12.8020653633
+有血有肉 10.4994802703
+蚌埠 9.84023464143
+小口 10.0720362555
+大安溪 12.1089181827
+列昂诺夫 11.9547675029
+杂合性 13.900677652
+贴金 10.604840786
+杂鱼 12.2912397395
+敏锐度 13.2075304714
+一巴掌 9.07236391467
+朱师傅 12.1089181827
+扩增到 13.2075304714
+安提阿 12.8020653633
+粗粗 9.94943393339
+东北部 7.18045749684
+余闲 13.900677652
+摸透 10.4349417492
+震撼 8.34384959028
+四端 12.2912397395
+引得 8.79473217808
+专修班 12.1089181827
+马合木 12.5143832909
+余间 10.9049453784
+和衣而卧 12.2912397395
+亿万家 13.900677652
+有棱有角 12.8020653633
+抗休克 11.598092559
+十五载 11.4157710022
+不堪设想 9.12999302751
+霜天 12.1089181827
+保金 12.8020653633
+理科 10.2371160058
+劈成 11.0103058941
+前置式 13.2075304714
+小满 11.5027823792
+气沮 13.2075304714
+必胜客 11.7034530746
+可喜 9.24671730182
+保重 9.4233408375
+如实 8.56795885871
+小滴 13.900677652
+保释 10.4666904475
+死缓 11.4157710022
+电子器材 11.598092559
+错断 11.8212361103
+劣于 12.5143832909
+堵击 11.5027823792
+宜山 11.0103058941
+以情 11.9547675029
+赵德 11.8212361103
+燮理阴阳 12.1089181827
+吴硕 12.8020653633
+眼珠子 9.0884932966
+保鲜库 13.2075304714
+如家 11.4157710022
+英名 10.7226238216
+连上善 13.2075304714
+上传者 13.900677652
+麻风 10.9562386728
+司马衍 12.8020653633
+胡匪 10.1164880181
+一潭死水 11.3357282945
+小溪 9.45802639549
+从夷陵 12.2912397395
+须须 13.2075304714
+赵志 10.9049453784
+气泵 12.1089181827
+宜将 12.2912397395
+配穴 11.8212361103
+赫希贝 12.8020653633
+高拱鹰 13.2075304714
+死罪 8.74162235276
+对味 13.900677652
+桑图 13.900677652
+赵心 12.8020653633
+气泡 9.26594866375
+桎梏 10.1394775363
+娱乐吧 13.900677652
+食品包装 10.8096351986
+港府 11.9547675029
+愚民政策 12.2912397395
+粗粮 10.2897597393
+脂粉气 11.7034530746
+如对 9.55687223012
+于弘州 12.8020653633
+小源 13.900677652
+发生率 9.54396882529
+崔鸿 12.2912397395
+小照 12.1089181827
+谈成 10.9562386728
+贝塞尔 10.9562386728
+校本 10.4349417492
+下水典礼 13.900677652
+黄澍命 13.2075304714
+成就展 13.2075304714
+五十一卷 13.2075304714
+急诊部 13.2075304714
+别弟笃 13.2075304714
+配方 8.89673134603
+创产值 13.900677652
+魏设江 13.2075304714
+南无宝 12.5143832909
+想也不想 11.2616203224
+华南地区 9.30555780184
+校服 11.7034530746
+一计 9.27570483869
+整党 11.1280889297
+励志社 13.2075304714
+阿利乌 12.8020653633
+精神分析学家 12.8020653633
+贴身 8.52539924429
+郑鹤声 11.5027823792
+法国史 13.900677652
+天气预报 9.18217878068
+含冰量 12.8020653633
+配料 9.62401153296
+东观西 13.900677652
+烟台山 12.8020653633
+溥仪 9.54396882529
+哀鸿 13.2075304714
+本户 12.8020653633
+套服 13.900677652
+高凤翰 12.5143832909
+山分甲 10.4666904475
+苏双 13.900677652
+十五道 11.9547675029
+洛墨达 12.8020653633
+穷困 9.89334446674
+生死搏斗 11.1926274509
+穷国 10.2630914922
+关渡 11.9547675029
+冬运会 13.900677652
+文殊殿 13.2075304714
+邓家湾 13.900677652
+渲染法 13.900677652
+西潘王 11.8212361103
+一年制 13.2075304714
+风土民情 12.8020653633
+半信半疑 9.59661255877
+寄生植物 10.7226238216
+细微处 12.1089181827
+莫桑比克共和国 12.8020653633
+国营企业 9.91169360541
+荤酒 12.1089181827
+都会区 13.900677652
+吴敬恒 12.5143832909
+体操赛 12.8020653633
+任务区 13.900677652
+边塞诗 11.1926274509
+刷起 13.2075304714
+矫诏之 13.2075304714
+古地理学 11.0103058941
+贴换 13.2075304714
+气象预报 10.5684731418
+柳暗花明 10.533381822
+张天禄 11.4157710022
+导航键 13.900677652
+王军华 13.900677652
+追星 12.2912397395
+一千遍 12.5143832909
+显著地位 11.4157710022
+摸过 11.5027823792
+朴朴 12.8020653633
+暗藏玄机 12.5143832909
+几十吨 11.7034530746
+费雯丽 11.8212361103
+普通邮票 13.900677652
+马都监 10.3743171274
+小燕 11.1926274509
+知名人士 10.1630080337
+中国人民大学 8.95903522937
+阿尔赫西 12.8020653633
+销过 13.2075304714
+瓜子 9.35738286971
+副炮 12.2912397395
+急不容缓 13.900677652
+电源模块 12.2912397395
+阿保 13.900677652
+哀毁骨立 13.2075304714
+绶带鸟 13.900677652
+陈庆之 12.2912397395
+配数 13.2075304714
+正月初五 12.5143832909
+飞云掣电 13.900677652
+童贯则 13.2075304714
+从宏德 13.2075304714
+搞清 10.1630080337
+丁志刚 13.2075304714
+阳爻 11.8212361103
+铁力木 11.9547675029
+尤伯杯 12.5143832909
+千载一时 12.8020653633
+茨瓦纳 11.598092559
+甜不辣 13.900677652
+空言 11.0674643079
+十五部 13.2075304714
+朝鲜队 12.5143832909
+归义羌 13.2075304714
+近观 11.9547675029
+江北地区 13.900677652
+伯苗 13.2075304714
+嫌疑 8.61241062128
+谈拢 12.1089181827
+数十万斤 13.900677652
+十驾 13.2075304714
+炖着 11.7034530746
+南京艺术学院 12.2912397395
+小火 9.53122979951
+编外 11.7034530746
+程不识 12.5143832909
+千万别 8.40761620864
+花朵儿 12.1089181827
+声势浩大 9.56994431169
+堵住 8.39534611604
+俪句 13.2075304714
+空说 12.5143832909
+小灶 11.3357282945
+千古佳话 12.2912397395
+另一 7.87481167815
+特律翁 12.8020653633
+八员 10.533381822
+张金海 13.2075304714
+科恰班巴 13.900677652
+山为垒 12.8020653633
+呼朋引 12.5143832909
+空话 9.61021821083
+必不可免 12.1089181827
+苟利国家生死以 13.2075304714
+力挫群雄 13.900677652
+吕精义 13.900677652
+穷家富路 13.900677652
+瓷业 10.4994802703
+马斯喀特 11.8212361103
+一百四十余处 13.2075304714
+郝思文 10.1871055853
+功在当代 13.900677652
+抖威风 12.2912397395
+贴进 12.2912397395
+仰山慧 13.2075304714
+湖绉 12.8020653633
+乱鸦 13.900677652
+贴近 8.92394390956
+追查 9.36807815882
+倾下来 13.900677652
+足有 9.01032852375
+足月 10.9562386728
+孙奇 12.2912397395
+空论 11.4157710022
+贴过 11.7034530746
+骑毛驴 12.5143832909
+宋金人 13.2075304714
+线偏振 12.5143832909
+静物画 11.0674643079
+埃洛 12.1089181827
+现行法令 13.900677652
+短时间 7.82303540863
+外推法 12.8020653633
+金霞岭 13.2075304714
+圣歌 11.598092559
+摘除 10.2117981979
+知书明理 12.8020653633
+你好坏 13.900677652
+肾阴虚 10.4041700905
+盛衰荣辱 13.2075304714
+钉齿耙 12.2912397395
+小历 12.5143832909
+李导 11.2616203224
+上攻 7.6701962044
+苏区 9.41204128224
+出在 12.2912397395
+柳橙汁 12.2912397395
+铿锵声 11.8212361103
+法比尤斯 13.900677652
+高加索地区 11.7034530746
+蔓延性 13.900677652
+丙午 12.5143832909
+配搭 11.8212361103
+言简意 13.900677652
+小厂 10.1871055853
+浓积云 12.8020653633
+医院 5.86281141727
+地市级 11.598092559
+深切体会 12.1089181827
+集资 8.39534611604
+泸西 11.8212361103
+赶来赶去 11.9547675029
+和恩格 13.900677652
+身高 8.26232298264
+邓蒂斯 13.900677652
+八味 12.5143832909
+所有格 12.2912397395
+可怜巴巴 9.93038573842
+拂衣 13.900677652
+垂暮之年 11.598092559
+物理题 13.900677652
+千平方公里 13.2075304714
+莫里特 13.2075304714
+施文绣 13.2075304714
+禁欲主义 10.3743171274
+中国政协 13.2075304714
+诚实可靠 13.2075304714
+西蒙斯 11.1280889297
+那荣府 13.2075304714
+栅栏 9.65218240993
+数字电路 11.8212361103
+煞神 10.8096351986
+十五里 10.2630914922
+登记册 11.1280889297
+须虾 13.2075304714
+涡轮 8.50251495046
+追来 9.43476953332
+五十里 9.59661255877
+硬撑下去 13.900677652
+穆瓦桑 12.5143832909
+白龙江 10.3743171274
+两万八千 12.8020653633
+面告 13.2075304714
+备战 8.93783302172
+工作场地 13.2075304714
+交感神经 9.63799777493
+藤井有 13.900677652
+康惠 12.2912397395
+偏安 10.2371160058
+草食性 11.0103058941
+三十多处 12.8020653633
+三四斤 13.2075304714
+球状体 11.7034530746
+王庆看 11.8212361103
+颠倒 8.31718134319
+栅格 12.5143832909
+集贤 10.1871055853
+追杀 8.90346537821
+福缘 11.9547675029
+明宝钞 12.5143832909
+王庆同 13.2075304714
+竖蜻蜓 11.8212361103
+新景观 12.2912397395
+小炒 12.1089181827
+克里米亚半岛 11.3357282945
+阳烛 13.900677652
+丙三醇 12.8020653633
+夏毛红 12.8020653633
+通行证 9.80633308975
+课外作业 13.2075304714
+梅花鹿 9.59661255877
+速办 12.8020653633
+薄海同 13.900677652
+刚毅 8.45825994145
+闫副参 12.5143832909
+搞法 11.8212361103
+气焰 9.46986085313
+交权 12.8020653633
+炊事班 10.8096351986
+新闻资料 13.900677652
+死抠 12.8020653633
+金创药 12.5143832909
+罚踢 13.2075304714
+十颗 12.1089181827
+刚毛 10.0940151622
+号房 11.9547675029
+真够甜 13.900677652
+可怜虫 11.0674643079
+物理性质 9.02548032877
+摸起 13.2075304714
+赛依特 13.900677652
+坐班 12.1089181827
+孜然 11.8212361103
+白海棠 12.1089181827
+六七十万 11.3357282945
+小标题 11.7034530746
+魏大人 11.1280889297
+六七十丈 13.900677652
+仲恺 13.2075304714
+挤扁 12.8020653633
+腊日 12.8020653633
+气焊 12.2912397395
+老吾老 13.2075304714
+创意设计 12.1089181827
+仲恭 13.2075304714
+忘记 6.84364067028
+谈性 12.8020653633
+颁奖礼 12.5143832909
+空袭 8.98069672615
+运动量 10.3171587135
+小猪 11.4157710022
+忘词 12.8020653633
+江汉关 11.9547675029
+选择网络 12.8020653633
+如有 7.90671622467
+太平洋保险公司 11.5027823792
+回不来 9.5186510173
+魏心镇 12.1089181827
+波德莱尔 11.2616203224
+钱贵物 13.2075304714
+气煤 11.1926274509
+第十三位 13.2075304714
+誓约 10.7226238216
+气煞 13.900677652
+入户门 12.2912397395
+古宗列 11.9547675029
+值域 11.1280889297
+沈钧儒 10.5684731418
+代售处 12.8020653633
+飞过去 10.7226238216
+社长兼 11.4157710022
+安萨 13.900677652
+铅板 12.5143832909
+登记制 12.8020653633
+建造成 11.7034530746
+联合报 11.8212361103
+安营 10.0940151622
+挤成 11.598092559
+小班 11.5027823792
+丁无粮 13.2075304714
+工作作风 10.4349417492
+波亨斯 13.2075304714
+下笔成章 13.2075304714
+读书界 13.900677652
+有生力量 9.40086798165
+小珠 12.8020653633
+神采焕发 11.598092559
+希姆莱 10.8561552143
+无兴复 13.900677652
+司马错 11.598092559
+麻藤 12.5143832909
+校方 9.71102290995
+西和县 13.2075304714
+批在 13.2075304714
+蓄发 11.5027823792
+空行 10.6818018271
+如期 8.39941944143
+无法忍受 10.0294766411
+崔鹏 12.5143832909
+位点 11.5027823792
+死战 9.16447920358
+配有 8.37124856446
+刚正 11.3357282945
+魏大中 11.1926274509
+教职工 11.0103058941
+石中含 12.5143832909
+与人为善 11.4157710022
+刚死 11.0103058941
+捷达车 12.8020653633
+重机 9.56994431169
+于清泰 13.2075304714
+威赫 13.2075304714
+安蒙 13.900677652
+米德哈 11.9547675029
+孔明坐 12.2912397395
+云南大学 10.5684731418
+第十一部分 13.900677652
+管理策略 11.9547675029
+郑遵谦 11.8212361103
+坦承 10.0720362555
+死扣 11.9547675029
+尘沙 11.3357282945
+二十四位 13.2075304714
+玉具剑 12.1089181827
+校时 13.900677652
+借景抒情 12.5143832909
+安蒂 11.8212361103
+悠哉悠哉 13.2075304714
+小玲 11.0674643079
+套料 13.2075304714
+谈情 12.8020653633
+美仁 13.2075304714
+小王 9.63799777493
+不当人子 11.5027823792
+小玉 11.3357282945
+悲不自胜 13.900677652
+销路 9.44633035572
+越南政府 12.1089181827
+遮放 12.8020653633
+军事法院 11.598092559
+十项 10.8561552143
+贾皇后 13.900677652
+欧阳修 9.22784881751
+集运 10.7226238216
+陶弘景 10.8096351986
+瓦里斯 13.900677652
+追施 11.8212361103
+枪子 11.2616203224
+滴哒 10.9049453784
+樵子 10.533381822
+小剂 12.2912397395
+大岩桐 13.900677652
+莆田人 12.5143832909
+丙酮酸 11.5027823792
+休息时间 10.0720362555
+十首 11.0674643079
+两百一十五册 13.2075304714
+参联会 12.5143832909
+千余公里 11.1926274509
+测定目标 11.598092559
+绢画 11.9547675029
+登记卡 11.9547675029
+小牌 11.3357282945
+三四十岁 12.2912397395
+祖居地 12.2912397395
+小片 9.44633035572
+足数 13.2075304714
+思恋 12.5143832909
+三民路 13.900677652
+搞混 12.5143832909
+农神 12.5143832909
+关胜 9.27570483869
+小牛 9.02548032877
+学历证书 12.5143832909
+得意忘象 13.2075304714
+白送 10.642581114
+三点钟 10.533381822
+盗窃罪 10.3171587135
+第十三个 11.8212361103
+潮时 12.8020653633
+肾结核 11.0674643079
+夜不闭户 12.5143832909
+集输 12.1089181827
+围点打援 13.2075304714
+额角 9.96885201925
+高尔吉亚 12.2912397395
+挤挤 9.91169360541
+左后 12.8020653633
+立蒙哥 12.8020653633
+申呈宿 12.8020653633
+湖岸 9.30555780184
+后台作业 13.2075304714
+配曲 12.2912397395
+埋下去 12.1089181827
+杨和孙 12.2912397395
+中国男篮 11.8212361103
+实不相瞒 10.4994802703
+奥木列 10.9049453784
+二十四份 13.2075304714
+刀库 13.900677652
+检查程序 13.2075304714
+保费 8.26946587015
+凌轹 13.900677652
+唐古 13.2075304714
+大醉 9.85762638414
+唯其如此 11.4157710022
+二十四代 12.8020653633
+保质 12.5143832909
+李家寨 10.4349417492
+人物形象 8.69119149913
+翻盘 10.533381822
+孙悟空 8.87679713113
+览胜 12.8020653633
+数千颗 12.8020653633
+晾干 10.3743171274
+煞笔 13.900677652
+魔影 11.8212361103
+坐牢 9.37888907493
+狼犺 11.9547675029
+碾子山区 13.2075304714
+劣势 8.78868986362
+叶秀峰 12.8020653633
+吴冠中 11.5027823792
+李宇 12.2912397395
+某件事 11.7034530746
+二十四万 12.1089181827
+一千里 12.2912397395
+滑稽戏 12.2912397395
+费尔特 11.1280889297
+刘璋亦 13.2075304714
+宓睦 13.2075304714
+粗线期 12.8020653633
+刘方 13.900677652
+贫穷 8.38322475551
+相关性 8.98069672615
+登记号 12.8020653633
+小狗 9.22784881751
+纪事报 12.2912397395
+茅以升 11.2616203224
+于吉 11.9547675029
+二十四两 12.5143832909
+安藤 11.8212361103
+勒贝格 11.3357282945
+堰塞湖 10.1394775363
+婚配 9.41204128224
+小犬 11.4157710022
+墨玉衔 13.900677652
+烦细 13.2075304714
+阿克陶县 12.5143832909
+秦岭山脉 10.765183436
+粗线条 11.7034530746
+名声大振 10.6818018271
+尤精 9.7898037878
+苏南 9.49395840471
+吴楚七 11.7034530746
+蓄力 11.9547675029
+炮火连天 11.0674643079
+周期短 10.765183436
+租额 11.2616203224
+刑审 12.8020653633
+说得着 10.5684731418
+搞活 11.1280889297
+万岁军 13.2075304714
+挤掉 10.4041700905
+贴起 13.900677652
+试验田 11.1926274509
+总公司 8.1902506346
+旧书店 12.5143832909
+蓄势 7.41147272065
+武侠片 12.5143832909
+李二先生 13.2075304714
+明军攻 13.900677652
+桑德雷 12.8020653633
+追敌 12.1089181827
+脚踏板 11.4157710022
+切实加强 9.4233408375
+轮胎式 11.598092559
+柳笛 12.1089181827
+可不 7.5515386606
+周公孔 13.2075304714
+可下 10.765183436
+可上 10.4666904475
+宾西法尼亚 12.2912397395
+直言贾祸 13.2075304714
+能容容 13.2075304714
+请留步 11.9547675029
+集装 10.8096351986
+聊聊 9.98865464655
+每克 9.87532596124
+胡健 13.900677652
+阿佐 13.900677652
+麻药 10.4041700905
+应明 12.2912397395
+死撑 12.5143832909
+刑宪 12.5143832909
+连在一起 9.04864738806
+虚诈 12.8020653633
+败下阵来 10.1630080337
+读书班 13.2075304714
+薏仁 11.9547675029
+小林光一 12.8020653633
+小巫见大巫 10.9562386728
+可为 8.15447446144
+文登县 13.900677652
+保龄球 11.3357282945
+没脸没皮 11.8212361103
+小到 9.65218240993
+副产品 9.38981814546
+瓦桥关 12.5143832909
+宝鸡峡 12.1089181827
+保护视力 11.598092559
+并行算法 12.5143832909
+如来 8.84443184663
+现场办公 11.0103058941
+物华 13.900677652
+金钱草 12.8020653633
+流窜作案 12.8020653633
+介石 12.2912397395
+反光膜 12.5143832909
+可乘 10.765183436
+鱼水之 12.8020653633
+劳动部门 10.604840786
+可乐 9.80633308975
+遮掩 9.02548032877
+泄洪 9.54396882529
+子诸樊 12.8020653633
+可真有 11.3357282945
+三角洲 7.98717464634
+生得俊 12.8020653633
+昌宝顺 13.2075304714
+同态 11.9547675029
+小生 8.85082164473
+仲春 11.3357282945
+新加坡 7.31865251308
+偿还期 13.2075304714
+对保 12.8020653633
+李家峡 12.5143832909
+刑官 11.4157710022
+尽在不言中 12.2912397395
+第三十六条 13.900677652
+临界乳光 13.900677652
+商业渠道 13.2075304714
+吊瓶 11.9547675029
+气着 13.2075304714
+真够玄 13.2075304714
+曹国舅 12.8020653633
+可予 11.4157710022
+俨然 8.59240995457
+修竹乔 13.900677652
+倒打一耙 11.8212361103
+雌雄同体 9.98865464655
+湖笔 11.0674643079
+各安生业 11.598092559
+质量数 10.5684731418
+卫星城 10.3171587135
+白茯苓 12.2912397395
+尼安岛 12.8020653633
+追截 13.2075304714
+袖章 11.598092559
+鸡冠区 13.2075304714
+新生界 11.3357282945
+姚锡铭 10.2371160058
+阳白 12.8020653633
+紧急状态法 13.900677652
+小病 10.533381822
+眼底下 13.2075304714
+怨怼 12.5143832909
+突击力 10.765183436
+铨选 10.9049453784
+抗感染 10.4349417492
+至宝丹 12.1089181827
+移出 11.0674643079
+茏葱 13.2075304714
+可亲 10.4666904475
+穷酸气 12.8020653633
+出油率 12.5143832909
+娥眉月 12.5143832909
+横田 12.5143832909
+卡末林 11.7034530746
+刘晨 13.2075304714
+气短 9.19114745066
+氖气 13.900677652
+宗圣政 13.2075304714
+大野 11.8212361103
+尤尔 10.6818018271
+近路 11.2616203224
+销售一空 11.3357282945
+罗来纳 12.5143832909
+套接 13.2075304714
+对位 10.1871055853
+追打 11.1280889297
+遮挡 9.26594866375
+低水平 8.3285236198
+米元章 12.1089181827
+近距 9.71102290995
+武昌县 11.598092559
+错综 10.4041700905
+周姐姐 12.1089181827
+仪注 10.6818018271
+段南坡 12.2912397395
+古宗 12.1089181827
+版本控制 13.2075304714
+农电工 13.900677652
+克洛夫 12.5143832909
+李慈铭 12.5143832909
+卖淫女 12.8020653633
+当代 7.52906580474
+袖筒 10.1164880181
+水资源量 12.1089181827
+和红梅 11.5027823792
+岳家军 10.8096351986
+成就奖 10.8096351986
+督署 12.5143832909
+韵文 10.0505300503
+调解书 11.8212361103
+狗奴才 12.5143832909
+名额有限 12.2912397395
+对事 11.5027823792
+三氯乙烯 12.2912397395
+同一首歌 12.8020653633
+对于 4.38860438433
+贼星 13.900677652
+王庭筠 12.5143832909
+德沃思 13.900677652
+遮拦 9.48183704418
+可传 11.7034530746
+集解 10.2897597393
+杰格佳 13.2075304714
+庄门 10.0088573539
+沙荒 12.1089181827
+少装 13.2075304714
+圆明园 9.44633035572
+空运 8.61747392324
+追授 10.9049453784
+旅次 13.900677652
+尼古拉斯 11.0674643079
+全面落实 9.58318953844
+冻结资产 13.900677652
+米兰达 11.598092559
+眼前利益 11.4157710022
+势至 12.8020653633
+随传随到 12.5143832909
+尿色素 13.900677652
+子相肖 13.900677652
+阿兹特克 9.85762638414
+可作 7.6761192227
+三倍 9.44633035572
+得意忘言 12.8020653633
+号数 11.5027823792
+泄气 9.71102290995
+可体 12.5143832909
+卢大人 13.900677652
+对价 9.26594866375
+咬牙 8.63798746307
+安茹 11.4157710022
+高粱 8.03420959504
+可佩 12.8020653633
+产油量 11.3357282945
+躲上 13.900677652
+相续 12.1089181827
+小球 10.1164880181
+掩埋 8.97342396682
+可使 7.78038023302
+对付 6.89670351525
+试车场 13.900677652
+引据 12.2912397395
+证券犯罪 11.598092559
+供应方 12.1089181827
+套房 8.04560572977
+泄水 10.1164880181
+对仗 10.3453295905
+压敏胶 13.900677652
+不敢相信 8.77671367257
+满布红 13.900677652
+蟹爪 11.8212361103
+校报 12.8020653633
+不由自主 8.21370229564
+空车 9.71102290995
+小瓣 12.5143832909
+魔女 11.1926274509
+最高者 10.2371160058
+龙沙区 13.2075304714
+空载 10.6818018271
+可依 10.0720362555
+保证 5.66452199029
+小瓶 11.8212361103
+套招 13.900677652
+莫理 12.8020653633
+阿伏 10.8096351986
+对上 10.8096351986
+卫星国 11.1926274509
+石珠 12.2912397395
+避实击虚 11.8212361103
+习惯势力 11.3357282945
+潘家口水库 12.2912397395
+浦熙修 13.2075304714
+被值 13.900677652
+处理函数 13.900677652
+眼见为实 10.6818018271
+嗜烟 12.5143832909
+卡尔波夫 12.2912397395
+卢沟晓 12.5143832909
+有始无终 11.8212361103
+心存侥幸 10.8561552143
+愁云惨雾 11.3357282945
+麻花 9.85762638414
+酒吧间 12.8020653633
+气相 9.54396882529
+调解人 12.5143832909
+死命挣扎 13.900677652
+妇女解放 10.533381822
+魔头 9.71102290995
+周政 13.900677652
+大模大样 10.4666904475
+荀谌 13.2075304714
+娱乐业 10.9562386728
+熟练程度 10.8561552143
+追捧 7.52565283215
+逸豫 12.5143832909
+由理藩 12.5143832909
+足掌 12.8020653633
+铁路医院 13.900677652
+泄沓 13.900677652
+毛太公 10.5684731418
+追捕 9.23723855786
+袖管 11.2616203224
+瓜干 11.2616203224
+气盛 10.9562386728
+二十万两匹 11.9547675029
+劣品 13.2075304714
+吴师道 12.8020653633
+袖箭 12.2912397395
+可信 8.99540287354
+臧家桥 12.8020653633
+号旗 10.604840786
+小勇 11.9547675029
+没边儿 13.2075304714
+流血事件 10.765183436
+富农分子 11.9547675029
+白豆 13.900677652
+追捉 11.598092559
+死敌 10.3453295905
+西方式 11.3357282945
+运载车 11.7034530746
+贾静雯 13.900677652
+追悼 11.1280889297
+安联 10.3743171274
+小睡 12.2912397395
+老大难 10.8561552143
+期期艾艾 11.4157710022
+板式家具 13.900677652
+李后主 11.4157710022
+三味书屋 12.8020653633
+翻番 8.51618258919
+倒好 8.91707103027
+劣地 12.8020653633
+常用工具 13.2075304714
+祝彪 10.6818018271
+商务厅 9.63799777493
+西河水 13.2075304714
+体操课 13.900677652
+麻腐 13.2075304714
+光敏电阻 12.8020653633
+福善祸淫 12.8020653633
+腐蚀电流 13.900677652
+庄田地 12.8020653633
+十五阵 12.8020653633
+魏孝武 12.8020653633
+蠢话 11.3357282945
+雕虫小计 13.900677652
+行李卷 11.9547675029
+天球仪 11.0103058941
+传帮带 13.2075304714
+授奖仪式 12.5143832909
+以暴制暴 13.900677652
+追想 12.8020653633
+瓜州 10.4349417492
+阈限 10.8561552143
+麻脸 10.4349417492
+厥阴俞 12.8020653633
+须臾 8.67493097826
+时卫尉 13.2075304714
+消耗掉 10.3453295905
+兰斯凯 12.5143832909
+小眼 10.4349417492
+减轻负担 11.598092559
+以示 8.34384959028
+东北角 9.54396882529
+柳眉踢竖 13.900677652
+钱山漾 11.1926274509
+造口术 13.900677652
+死囚牢 11.598092559
+彩釉陶 12.8020653633
+小看 9.20019728618
+胸中有数 13.900677652
+光未然 12.1089181827
+衬字 11.9547675029
+径一周三 13.900677652
+惟妙惟肖 10.4041700905
+王吴监 13.2075304714
+将章 13.2075304714
+阿们 13.900677652
+桓公之 12.5143832909
+澜沧拉祜族自治县 11.9547675029
+姑丈 13.900677652
+炖烂 13.2075304714
+经世奇才 13.900677652
+介甫 12.8020653633
+新疆巴音郭楞蒙古自治州 12.8020653633
+信噪比 11.5027823792
+下一阶段 8.78868986362
+介甲 12.5143832909
+通贝斯 13.900677652
+安胎 11.2616203224
+工装裤 13.900677652
+布镇集 13.2075304714
+小石 11.4157710022
+商务区 10.533381822
+宝鸡市 11.0674643079
+安能 9.48183704418
+吕布领 12.8020653633
+追思 10.765183436
+楼花 12.2912397395
+奸情 11.9547675029
+坐着 7.42370528909
+追怀 12.1089181827
+滴入 10.5684731418
+介生 11.7034530746
+天然资源 11.1926274509
+但宝柱 13.900677652
+唐德宗 9.93038573842
+谢家就 13.900677652
+宣和博 11.9547675029
+张志勇 13.900677652
+小瞧 10.3453295905
+整天 7.80485308954
+平均法 10.9562386728
+门面话 12.2912397395
+滴滴答答 10.8096351986
+高青高 13.2075304714
+炖炖 13.900677652
+安肃 12.1089181827
+顽固 8.9519177616
+化工部 12.1089181827
+近近 13.2075304714
+货币政策 5.82074988122
+空谈 9.91169360541
+袍子 9.72629038208
+校史 13.2075304714
+消耗率 11.2616203224
+由果毅 13.2075304714
+尚大哥 11.0103058941
+空调 7.50708689803
+然法 13.2075304714
+涡街 13.2075304714
+高浩荣 13.900677652
+圣体 10.604840786
+贾姆希 13.2075304714
+卑职 8.22050504296
+追恋 13.900677652
+副省级 10.765183436
+摘选 12.8020653633
+一蹦三跳 13.2075304714
+忠于 8.70772080109
+坐相 13.900677652
+怨不得 9.7898037878
+瓜岛 12.1089181827
+石礁 13.2075304714
+汽油弹 11.598092559
+圣人 8.28390655431
+小白 8.51160592216
+吾妻 13.2075304714
+半丝半缕 13.900677652
+性命关天 13.900677652
+公司党委 12.8020653633
+复合元音 12.5143832909
+统计表 11.4157710022
+田径队 12.2912397395
+择捉 13.900677652
+千余吨 12.5143832909
+阳痿 9.43476953332
+细川护熙 12.5143832909
+囫囵竹 13.900677652
+埃尔哈 13.900677652
+授阶仪式 13.2075304714
+灭国 11.9547675029
+刚满 10.6818018271
+炖煮 12.5143832909
+明军 8.60737282725
+正常者 12.1089181827
+倒金字塔 12.8020653633
+双球菌 12.1089181827
+七八分钟 11.7034530746
+自有一套 12.8020653633
+伙伴 7.65651075131
+圣井 11.7034530746
+王大令 13.2075304714
+麻耳 13.900677652
+福禧 13.900677652
+庄容 13.2075304714
+帕拉马 12.1089181827
+销行 11.9547675029
+通直 10.2897597393
+值勤 10.533381822
+魔宫 13.900677652
+立麻力 11.3357282945
+三峡水库 11.7034530746
+度德量力 12.5143832909
+广济寺 11.4157710022
+杭派 12.1089181827
+娶妻生子 10.765183436
+盗用公款 12.8020653633
+福禄 11.7034530746
+西便门 11.3357282945
+高频放电 13.900677652
+数十万户 12.2912397395
+红脸 9.54396882529
+宫外孕 11.1926274509
+与子偕老 11.8212361103
+路由 10.765183436
+铺下去 13.900677652
+米德兰 11.7034530746
+集训 9.72629038208
+小目 13.2075304714
+瓜尔 11.598092559
+挥手致意 12.8020653633
+生产过剩 9.45802639549
+死机 12.5143832909
+三十多米 12.1089181827
+怀庆府 11.598092559
+圣主 10.765183436
+配戴 10.9562386728
+麻胡 13.900677652
+河东平阳 11.7034530746
+时开田 12.2912397395
+童痴 13.900677652
+收听到 12.8020653633
+配房 12.5143832909
+空走 13.900677652
+数十万担 12.5143832909
+乌吉亚 13.900677652
+中华全国 9.82314020807
+圣上 8.85082164473
+史主察 13.2075304714
+南山区 11.0674643079
+福祉 10.0294766411
+七十五万 11.9547675029
+八角鼓 11.3357282945
+配戏 11.9547675029
+接口标准 11.9547675029
+死期 10.9049453784
+平衡装置 13.900677652
+亿株 13.2075304714
+福神 12.1089181827
+配成 10.533381822
+仅以身免 12.1089181827
+小盘 7.35389224122
+小盒 10.8561552143
+小监 13.900677652
+小盐 13.2075304714
+每平方 11.4157710022
+秀吉 11.1926274509
+咬烂 11.5027823792
+不易 7.16134102462
+齿牙余论 13.900677652
+气瓶 10.8561552143
+嫌犯 10.0088573539
+令人不解 10.8096351986
+三千二百二十七万余 13.2075304714
+死板 10.765183436
+驾轻就熟 11.1926274509
+葬身之地 11.598092559
+穷兵 12.8020653633
+仲文 11.8212361103
+俊马 13.2075304714
+空费 11.9547675029
+秋田县 13.2075304714
+两种制度 11.3357282945
+太尉恩 12.2912397395
+阿塔图尔克 11.598092559
+追慕 12.1089181827
+佐治亚大学 13.2075304714
+联合机 12.5143832909
+阿亮 12.5143832909
+运回来 11.598092559
+下功夫 9.22784881751
+阳电 13.900677652
+保存期 11.7034530746
+南达科他 13.900677652
+砖瓦窑 11.598092559
+渗进 11.3357282945
+德沃拉 12.1089181827
+天然纤维 10.8561552143
+娱乐活动 9.93038573842
+俄北方舰队 13.900677652
+贝瓦尔 13.900677652
+小票 12.1089181827
+货运车 13.2075304714
+以观后效 11.1926274509
+话茬儿 11.4157710022
+波特率 13.900677652
+通俗歌曲 13.2075304714
+崔美善 12.8020653633
+福相 11.598092559
+皮革制品 10.4666904475
+追溯 9.30555780184
+牛头刨床 13.2075304714
+马入城 10.8561552143
+毋亦 13.900677652
+昌乐西 12.8020653633
+潮滩 11.8212361103
+技艺高超 11.1926274509
+以此为准 13.2075304714
+心比天高 12.2912397395
+人寿保险 9.44633035572
+中国贫富 13.900677652
+马拴 10.4041700905
+伯理复 13.2075304714
+游园活动 12.2912397395
+赣榆县 12.1089181827
+蝶形花 11.4157710022
+有才干 10.5684731418
+樱花树 11.598092559
+华盛顿邮报 10.9049453784
+孙相公 13.2075304714
+金算盘 9.93038573842
+错爱 10.7226238216
+梁中书 9.27570483869
+莫特尔 13.900677652
+吴敬梓 11.7034530746
+更难 9.43476953332
+姬蛙科 13.2075304714
+嫌累 12.2912397395
+物力 8.99540287354
+史载唐 13.900677652
+小礼 12.8020653633
+安踏 10.8561552143
+借款国 12.5143832909
+强盛起来 10.9562386728
+李正茂 13.2075304714
+半文半白 12.1089181827
+未见其人 13.900677652
+马拽 12.5143832909
+试验线 12.5143832909
+流通股东 7.63918596765
+不修边幅 11.9547675029
+泄愤 10.9049453784
+采声 12.8020653633
+魔咒 10.8561552143
+固态 8.92394390956
+寇洪 12.1089181827
+十五顷 12.8020653633
+根脚 12.5143832909
+家无担石 13.900677652
+坐禅 10.5684731418
+阜平县 11.9547675029
+柳州市 11.5027823792
+违法必究 12.5143832909
+优伶 10.8561552143
+山以东 12.1089181827
+十五项 13.900677652
+鲁塞尔 13.900677652
+行百里 12.1089181827
+看一看 7.95525704337
+宫辟疑 13.2075304714
+小秦 10.1394775363
+轮胎厂 11.598092559
+个人兴趣 12.8020653633
+叙叙 12.2912397395
+真空包装 12.5143832909
+多多少少 9.7898037878
+坐票 12.8020653633
+绢纺 12.2912397395
+气管 8.82550383674
+中国联通 8.70218062071
+小种 10.4666904475
+辛烯 13.2075304714
+荡来荡去 11.7034530746
+柯尔培 12.8020653633
+桑椹胚 12.5143832909
+当众表明 13.2075304714
+唐古忒 13.2075304714
+黎世留 13.2075304714
+试镜 13.900677652
+旧大陆 10.642581114
+潮湿 7.71859274526
+隆武皇帝 12.2912397395
+停职检查 12.1089181827
+科弗 13.900677652
+反应时间 10.1630080337
+小科 12.5143832909
+刘德洁 12.8020653633
+理财金 12.2912397395
+被占领土 12.8020653633
+潘祖彝 13.2075304714
+名誉扫地 12.5143832909
+刘德海 12.5143832909
+涡虫 11.3357282945
+酚醛树脂 10.7226238216
+麻达 11.7034530746
+麻辣 10.3743171274
+行李包 12.2912397395
+近臣 9.63799777493
+黄泉路 11.5027823792
+空船 11.1280889297
+南济水 13.2075304714
+空舰 10.6818018271
+坦桑 12.8020653633
+华强北 11.9547675029
+灾难性 9.4233408375
+樊少皇 13.900677652
+政教处 12.5143832909
+集落 12.5143832909
+聂部武 13.2075304714
+梅花针 13.2075304714
+安身 9.43476953332
+沙宗琪 10.4041700905
+白霜 11.5027823792
+物理量 8.83808261895
+尘暴 11.1926274509
+环渤海地区 10.9562386728
+高大魁梧 11.8212361103
+豆饼 11.3357282945
+患上 9.01032852375
+减压渣油 12.8020653633
+柠檬茶 12.8020653633
+米安钠 13.900677652
+黛安娜 13.900677652
+五场 12.2912397395
+普洛斯 12.5143832909
+皮条客 13.2075304714
+泄恨 12.1089181827
+聊起 10.8561552143
+卑辞 11.8212361103
+穷得 9.6811699468
+人喊马嘶 10.8096351986
+孟家人 10.765183436
+一损俱损 11.598092559
+端阳 10.6818018271
+舛错 11.5027823792
+生骄 13.2075304714
+整捆 13.2075304714
+登记处 13.900677652
+气圈 12.2912397395
+湖盆 9.02548032877
+桑加河 13.900677652
+气穴 12.2912397395
+濮阳西水 13.2075304714
+吃准 12.5143832909
+真面目 10.4666904475
+第一百七 13.2075304714
+铅汞 11.5027823792
+千余级 12.8020653633
+衣冠南 13.2075304714
+小破 11.598092559
+苏塞克斯 12.5143832909
+戴姆勒 10.1394775363
+叙别 12.8020653633
+钒铅矿 13.900677652
+醒酒 10.8096351986
+柠檬草 13.2075304714
+配法 13.900677652
+有求于人 12.2912397395
+樊氏 13.2075304714
+第一百个 13.900677652
+小砖 12.1089181827
+第二十一回 11.7034530746
+潘多拉 10.9049453784
+表姐 9.62401153296
+穷忙 11.7034530746
+安进 12.1089181827
+含怨 12.1089181827
+安远 11.4157710022
+小磨 11.1926274509
+连云山 12.5143832909
+藏量丰富 12.5143832909
+文登市 12.5143832909
+空荡 11.9547675029
+死无全尸 13.2075304714
+瓜分 8.47133202302
+三八节 12.5143832909
+考入 8.40350942668
+云片糕 13.900677652
+提示信息 12.2912397395
+坚实基础 9.55687223012
+女性朋友 10.642581114
+于竟宁 13.2075304714
+毒日头 11.2616203224
+沙岭子 12.5143832909
+计算机 6.80478443088
+醒醒 10.3171587135
+枉费心计 13.900677652
+气窗 12.8020653633
+跌进去 12.8020653633
+特大型 9.44633035572
+斥退 11.1280889297
+巴楚县 13.2075304714
+鼻子头儿 13.900677652
+安迪 13.2075304714
+将用 10.2117981979
+优价 13.900677652
+燕京啤酒 10.533381822
+优于 8.11378027061
+挤榨 12.8020653633
+空茫 13.2075304714
+端雅 13.2075304714
+上上之策 13.900677652
+腹足动物 13.900677652
+安辉 13.2075304714
+关肃霜 12.2912397395
+叙功 11.1280889297
+大熊座 10.8561552143
+商务局 11.4157710022
+安家乐业 13.900677652
+全委会 12.2912397395
+安边 10.9049453784
+塞泽尔 13.900677652
+王友贞 13.2075304714
+出口配额 12.2912397395
+佩文斋 12.2912397395
+刚性 8.15128466607
+督率 9.74179456862
+铁磁质 12.1089181827
+解析数论 10.8561552143
+小碟 10.4666904475
+荤食 12.2912397395
+长袍马褂 10.8561552143
+将略 11.9547675029
+三十一部 13.2075304714
+除尘器 12.5143832909
+小碗 10.1164880181
+安不忘危 12.8020653633
+劳师糜饷 12.2912397395
+低空飞行 11.0674643079
+阿乔 11.5027823792
+不信 7.27131439854
+马德钟 13.2075304714
+瓜农 13.2075304714
+固执 8.41588071849
+如上 9.94943393339
+如下 6.75706004927
+小契 8.60236028543
+张香桐 11.7034530746
+替代者 11.598092559
+列队行进 13.900677652
+如东 10.765183436
+如丝 10.9049453784
+荣华富贵 9.69598503258
+米德尔 11.5027823792
+前遮后拥 12.2912397395
+咬紧 10.2371160058
+从天而降 9.65218240993
+天授 10.5684731418
+肉夹馍 12.8020653633
+方巡抚 12.1089181827
+介福 12.1089181827
+疲于奔命 10.0294766411
+视音频 13.900677652
+不俗 8.46259834305
+小唱 11.7034530746
+成活 10.1630080337
+不保 9.72629038208
+虚幻性 13.2075304714
+景教遂 13.2075304714
+小筐 12.1089181827
+根茨 13.900677652
+篮下 11.5027823792
+那老儿 10.3743171274
+麻贵 11.8212361103
+应有 7.47095817394
+空肠 11.7034530746
+林周 13.2075304714
+小笠 11.2616203224
+神魂不定 12.5143832909
+过龙兵 12.2912397395
+人才资源 10.642581114
+云烟氤氲 13.900677652
+潮沟 13.900677652
+不便 7.30763311783
+黄马褂 11.1280889297
+租下 11.4157710022
+机窗 12.8020653633
+根茎 9.24671730182
+荣禄转 13.900677652
+十部 10.3453295905
+因故取消 13.900677652
+默沙东 12.1089181827
+盘底 12.5143832909
+尤甚 10.0720362555
+泥沙俱下 12.1089181827
+不依 8.77077893705
+拉下脸来 11.4157710022
+潮河 11.2616203224
+穆特萨 13.2075304714
+安谧 11.2616203224
+投票 7.86999239171
+应松 13.900677652
+朝西边 13.900677652
+李金龙 11.4157710022
+轻言细语 13.2075304714
+如于 13.900677652
+和而不同 12.2912397395
+身量 10.533381822
+透信 13.900677652
+邮运 13.900677652
+潮汛 12.5143832909
+查考 10.533381822
+不佳 7.85567233794
+敲响 8.89004235788
+潮汐 8.58747167293
+明公 10.1871055853
+穷尽 10.533381822
+十通 12.8020653633
+电影票房 11.0103058941
+不但 6.12372324865
+阿丹 11.4157710022
+说说话 9.31571017331
+人工智能 9.45802639549
+生闷气 11.4157710022
+不住 6.5566048014
+不低 9.6811699468
+条条大路通罗马 12.2912397395
+上万千米 12.8020653633
+湖田 11.9547675029
+古巴人 11.8212361103
+忍冬科 11.8212361103
+无精打彩 11.9547675029
+卡波雷 13.2075304714
+不作 8.53003962385
+坐等 9.7898037878
+谈梦 13.2075304714
+舒玛彻 13.900677652
+不伤 10.2897597393
+闯出来 12.8020653633
+搞搞 11.5027823792
+教门 10.642581114
+温碧霞 12.8020653633
+毓婷 10.9049453784
+如今 5.01676018077
+王非王 13.2075304714
+水晶之恋 13.900677652
+十道 10.3743171274
+墨西哥政府 11.9547675029
+老元良 12.1089181827
+不似 8.98069672615
+夜凉如水 12.2912397395
+潮气 10.642581114
+如仙 12.5143832909
+利用人体 13.900677652
+运动用品 12.8020653633
+那老军 12.8020653633
+如以 9.25628675283
+将士 6.52604863676
+完好如新 13.2075304714
+广告行业 13.2075304714
+刑讯逼供 10.3453295905
+苏冈 13.900677652
+宽城区 13.900677652
+庄孝 13.2075304714
+不休 8.9519177616
+追求 6.62966911369
+四十六七岁 12.8020653633
+甸子 11.0674643079
+空耗 12.2912397395
+潮水 8.92394390956
+刨子 11.9547675029
+乌提卡 12.5143832909
+不会 4.41172117956
+套汇 10.9049453784
+壮烈牺牲 9.96885201925
+温带林 12.5143832909
+绢素 13.2075304714
+表现对象 11.7034530746
+风味小吃 11.1280889297
+动如脱兔 12.1089181827
+教职员 11.7034530746
+中下部 11.1280889297
+孀妇 13.2075304714
+开庭审判 12.1089181827
+外贸企业 10.4666904475
+挤死 11.598092559
+大阳 10.4349417492
+汉隶 12.1089181827
+追涨 8.71889410168
+宝鸡县 12.2912397395
+兼职教师 13.900677652
+不仅 5.02190158027
+纪功铁 13.2075304714
+踏遍 10.6818018271
+毫不迟疑 10.3743171274
+不什 13.900677652
+辛店村 13.2075304714
+其里 13.2075304714
+潜了 13.2075304714
+麻豆 12.8020653633
+小穗 10.7226238216
+于亚太 13.900677652
+不伤和气 13.900677652
+踏道 12.8020653633
+电子器件 9.37888907493
+内陆地区 10.0720362555
+不交 9.74179456862
+潮涌 10.2630914922
+明光 11.5027823792
+户籍制度 10.0505300503
+独立王国 11.3357282945
+十重 13.2075304714
+十里 8.18694484647
+橡皮 9.93038573842
+韵母 10.4041700905
+如何 4.77654897682
+计生委 11.0103058941
+五百余里 12.8020653633
+蔬菜 6.87691869724
+刘杰 12.2912397395
+刚抬 11.9547675029
+加密传输 13.900677652
+依样 12.2912397395
+不了 6.03818045475
+大元帅 7.83456956187
+曹日昌 13.2075304714
+埃尔米 11.598092559
+防盗门 11.598092559
+不二 9.85762638414
+不争 8.87023973058
+不予 8.33233314821
+刚抢 12.8020653633
+关胜正 12.5143832909
+安贫 12.1089181827
+伊萨尔科 12.2912397395
+以对 13.900677652
+乃兄 13.2075304714
+借刀杀人 11.1926274509
+金钱豹 9.4233408375
+周勃重 13.2075304714
+卑贱 9.93038573842
+刚才 5.75570823489
+临沐县 13.900677652
+神女 10.642581114
+阳神 12.2912397395
+李天 12.2912397395
+朱希祖 12.2912397395
+潮流 8.03138073884
+小童 10.0088573539
+徐碧云 12.8020653633
+卢沟桥 9.84023464143
+纵酒 10.9562386728
+织田信长 11.598092559
+号段 11.598092559
+不乱 9.00283785202
+不买 9.41204128224
+小竹 11.598092559
+大阮 13.900677652
+模范作用 11.598092559
+保藏 10.7226238216
+聊过 12.2912397395
+终变期 13.900677652
+自信心 10.0720362555
+不久 5.90335082898
+小立 12.2912397395
+不乏 8.03704647638
+不义 9.55687223012
+感激万分 13.900677652
+康纳斯 12.8020653633
+古鲁孙 10.7226238216
+旭日初升 13.2075304714
+鹰犬之才 13.900677652
+不乐 9.96885201925
+小站 9.44633035572
+野百合 13.900677652
+空腔 10.2117981979
+开瓶 12.8020653633
+唐森德 11.9547675029
+根苗 11.0674643079
+何洛会 11.5027823792
+不严 9.01787572939
+透亮 9.93038573842
+李思恭 13.2075304714
+阿三 11.8212361103
+开山祖 13.2075304714
+索然无味 11.3357282945
+死死 9.07236391467
+校注 9.62401153296
+郑铸 13.2075304714
+批出来 12.5143832909
+阿万 13.900677652
+蟹类 10.604840786
+白颜树 12.5143832909
+学士府 11.7034530746
+施加影响 10.642581114
+宇航学 13.900677652
+南欧 9.94943393339
+不举 10.8096351986
+刚成 13.900677652
+跷出 12.2912397395
+福田 9.6811699468
+不一 7.52225146832
+邓通 13.2075304714
+乐极悲生 12.8020653633
+担风险 11.4157710022
+连夜赶去 13.900677652
+关格 12.8020653633
+提回来 11.7034530746
+喘喘 13.2075304714
+不下 7.34674424795
+连锅端 11.9547675029
+打字机 9.58318953844
+补附 13.900677652
+艺术修养 11.598092559
+计谋 9.7898037878
+试验站 10.9562386728
+线虫病 11.0103058941
+压条法 13.900677652
+气缸 10.2371160058
+从浙川 13.2075304714
+八角钱 12.8020653633
+仓容 12.8020653633
+于乐寿 13.2075304714
+搐搦 12.5143832909
+田珠光 12.8020653633
+李家和 13.2075304714
+聒噪 10.0294766411
+兰平贵 13.2075304714
+中美合作 11.0103058941
+违法性 12.1089181827
+森森凉 13.2075304714
+比孝文 13.2075304714
+寿梦 13.2075304714
+龙吟虎啸 12.8020653633
+悠然自得 11.0674643079
+和执礼 13.900677652
+阳维 13.900677652
+晾凉 10.4994802703
+羊痫疯 13.2075304714
+倚老卖老 10.604840786
+巴基斯 13.2075304714
+自苦寒 13.900677652
+方言俚语 12.8020653633
+普通地图 11.7034530746
+踏青 10.9562386728
+校正 9.23723855786
+滴定 9.94943393339
+十集 13.900677652
+纵隔 10.7226238216
+灌救 13.900677652
+重峦迭嶂 13.900677652
+叶镇城 12.8020653633
+茉莉 10.0720362555
+雷体 11.2616203224
+拉赫峰 13.900677652
+东北菜 12.5143832909
+汽油味 11.9547675029
+喜刷刷 12.8020653633
+公羊家 13.2075304714
+阳线 8.05135287203
+无奇不有 11.598092559
+中密度 11.8212361103
+持有人 8.0229418702
+阳纲 13.900677652
+微积分 9.85762638414
+中国政府 7.33541268194
+校歌 12.5143832909
+气罐 11.4157710022
+伊哈尼 13.2075304714
+于田县 12.5143832909
+悟出来 13.900677652
+松科常 13.2075304714
+思丁 11.9547675029
+西蒙森 13.2075304714
+保苗 13.900677652
+学徒工 11.7034530746
+死水 10.533381822
+集聚 8.53003962385
+辰龙 12.8020653633
+四叠体 12.2912397395
+大陵 12.5143832909
+汝若有 13.2075304714
+公羊学 12.8020653633
+辣手摧花 13.900677652
+福特 8.37522471284
+象形字 11.1926274509
+汽车轮胎 10.8561552143
+商务处 13.900677652
+小学文化 12.8020653633
+杀妻求将 13.2075304714
+和田福军 11.598092559
+莫测高深 11.1926274509
+采宋 12.1089181827
+值夜 10.2630914922
+二乙二醇 13.900677652
+躺过来 13.900677652
+文史馆 12.1089181827
+愁眉 11.598092559
+空虚 8.14493543839
+施展才能 13.2075304714
+演唱艺术 12.5143832909
+嫩黄 10.9049453784
+辽东半岛 8.9519177616
+供认不讳 10.9562386728
+纵队 8.55357012126
+份数 11.3357282945
+徐用仪 13.900677652
+搞成 9.87532596124
+特勤团 11.4157710022
+法国式 11.4157710022
+计算长度 13.900677652
+巴尔特 11.9547675029
+倚财仗势 13.2075304714
+王庆大 13.2075304714
+严凤英 12.2912397395
+近藤 12.8020653633
+泰殿 12.8020653633
+版图 8.21370229564
+巴尼特 13.900677652
+周韵 13.2075304714
+蕉扇 13.900677652
+计算所 11.7034530746
+煎肉 13.2075304714
+陪审制度 12.1089181827
+婚纱店 13.2075304714
+阳嘉 11.7034530746
+陆缘地 13.2075304714
+瓦斯卡尔 12.8020653633
+归义王 12.5143832909
+格拉 9.72629038208
+欧亚大陆 8.092535162
+荀蔼 10.2897597393
+白如玉 10.4994802703
+河南蒙古族自治县 11.7034530746
+错看 12.5143832909
+阳翟 10.3453295905
+保荐 8.31718134319
+中央美术学院 10.1630080337
+尤物 10.4041700905
+婚龄 10.9049453784
+娄底市 11.7034530746
+颠峰 11.3357282945
+结古镇 12.5143832909
+展现出 9.75754292558
+五十一年 10.8561552143
+尤特 11.4157710022
+中国人民解放军总参谋部 12.5143832909
+北京服装学院 13.900677652
+小米 9.16447920358
+祖安国 13.2075304714
+杨用成 10.604840786
+宋名臣 13.2075304714
+暗中摸索 12.2912397395
+目光灼灼 11.1926274509
+国难当头 11.1280889297
+世耀 11.3357282945
+惭怍 12.5143832909
+身陷 9.87532596124
+大险 11.8212361103
+校史馆 13.900677652
+山泉水 12.2912397395
+胡艾克 12.2912397395
+尤利乌 11.1280889297
+行权价 9.61021821083
+宗初立 12.8020653633
+妯娌 10.533381822
+荣禄血 13.900677652
+神洲海 13.2075304714
+外财 11.8212361103
+不成气候 12.8020653633
+本洋 12.2912397395
+搞掉 11.1280889297
+转向灯 10.642581114
+阿瓜维 13.2075304714
+萨尼亚 12.2912397395
+宜于 9.22784881751
+拉斯姆森 13.900677652
+搞掂 12.1089181827
+格里丰 12.8020653633
+那真君 13.2075304714
+揭开序幕 12.2912397395
+炮门 12.5143832909
+数十万根 13.900677652
+福王 8.49350588052
+魔军 13.900677652
+外货 12.8020653633
+波动声学 13.2075304714
+介绍 5.53453993548
+烙画 12.5143832909
+阳羡 11.4157710022
+瓜园 12.1089181827
+麻婆豆腐 12.5143832909
+王道士 13.2075304714
+弄来弄去 13.900677652
+坦洲 13.2075304714
+魔兽 8.52539924429
+踏雪 11.0674643079
+死活 8.3555002075
+不愉 12.8020653633
+追款 13.900677652
+固无 13.2075304714
+袖珍 9.93038573842
+博卡 11.2616203224
+摸摸索索 11.3357282945
+火箭队 10.8096351986
+速度快 8.53470163695
+烙痕 13.900677652
+产乳量 13.2075304714
+大兵团 11.1280889297
+安诺 12.5143832909
+普鲁卡因 11.2616203224
+锡剧 11.8212361103
+中前场 13.2075304714
+稍逊一筹 11.8212361103
+膨体 13.900677652
+个人卫生 10.4994802703
+艾捷克 11.8212361103
+可怜见 9.94943393339
+似水流年 12.1089181827
+固氮酶 12.1089181827
+一千四百多年 13.2075304714
+黄砚秋 11.1926274509
+安详 9.27570483869
+残积物 12.2912397395
+四五万块 13.2075304714
+死海 10.3453295905
+追歼 11.0103058941
+以定 10.533381822
+中国环境科学研究院 11.1280889297
+特大号 11.9547675029
+国际奥委会 10.2117981979
+聪明绝顶 11.1280889297
+血红色 11.1926274509
+肖小 13.900677652
+毋乙 12.8020653633
+萨摩斯 12.8020653633
+刚搬 12.1089181827
+蹲坑 12.5143832909
+小粉 12.5143832909
+安设 11.1280889297
+神仙池 13.2075304714
+斯科尔斯 11.1926274509
+赵元任 11.598092559
+气结 11.3357282945
+败军 9.85762638414
+关文献 13.2075304714
+曹端 13.900677652
+银钞 11.598092559
+得民心 10.4994802703
+小粒 11.8212361103
+赵东 13.2075304714
+接送 9.56994431169
+赵世 12.5143832909
+劣弧 13.900677652
+汉阴 13.900677652
+王南侵 13.2075304714
+桃源洞 11.3357282945
+刚柔 10.8561552143
+蒙厚恩 13.2075304714
+配殿 10.533381822
+萧荫堂 13.900677652
+哀痛不已 13.900677652
+赵丹 10.8561552143
+唐古特 11.9547675029
+角落处 11.9547675029
+三角板 12.5143832909
+公若有 12.8020653633
+真假参半 13.2075304714
+丁果仙 13.2075304714
+华歆引 13.2075304714
+十钱 12.2912397395
+须要 9.22784881751
+满青藤 13.900677652
+栾廷玉 11.0674643079
+小罗 9.56994431169
+王鹗 11.5027823792
+贴肤 12.8020653633
+贫矿 11.5027823792
+不惯 9.75754292558
+值守 11.2616203224
+啦啦队 13.2075304714
+不惮 11.3357282945
+引人 9.94943393339
+玉真散 13.900677652
+王端臣 13.2075304714
+栅极 12.1089181827
+刚果 8.78268383956
+红十字会 10.0088573539
+摸脸 13.2075304714
+万圣节 11.9547675029
+引产 11.2616203224
+化生成 12.2912397395
+端酒 12.2912397395
+现形记 12.2912397395
+聚散浮生 13.900677652
+福寿 10.2371160058
+轮廓仪 13.900677652
+魔力 10.0720362555
+仲永 13.2075304714
+督理 10.5684731418
+配比 9.84023464143
+医馆 12.1089181827
+踏错 10.5684731418
+足校 12.5143832909
+赵书 12.5143832909
+东便门 12.2912397395
+延绥曰 13.2075304714
+介素 11.8212361103
+国家文物鉴定委员会 13.2075304714
+怀尔德 11.9547675029
+赵五 12.8020653633
+荆襄之 11.4157710022
+单性结实 12.5143832909
+赵云 8.89004235788
+放任不管 12.5143832909
+赵二 10.8561552143
+小翼 11.9547675029
+颗粒 7.9526426628
+炮队 11.4157710022
+坐罪 12.2912397395
+县市级 12.5143832909
+保胎 11.9547675029
+安装 6.70249407487
+微分拓扑 11.598092559
+可演 13.900677652
+沈昆铜 11.7034530746
+赵人 11.5027823792
+刚来 9.62401153296
+阿勒格尼 11.598092559
+科尔多瓦 10.8561552143
+芦雁 12.1089181827
+五响 13.2075304714
+莲子汤 12.2912397395
+第三十四届 12.8020653633
+未归人 13.2075304714
+秦五城 13.2075304714
+端量 9.98865464655
+麻粒岩 11.7034530746
+邓牧自 13.2075304714
+金钱观 12.2912397395
+空营 12.5143832909
+小群 9.6811699468
+步于庭 13.900677652
+土屋里 12.2912397395
+纳米技术 11.0103058941
+小羽 13.2075304714
+掌治释 13.2075304714
+水晶石 9.66657114738
+庾衮 13.2075304714
+大要案 13.2075304714
+所有权 7.72481038187
+俯视图 12.5143832909
+安福国会 10.7226238216
+妄断 12.5143832909
+帕拉丁 12.8020653633
+小美 13.900677652
+煞白 9.26594866375
+保育 10.604840786
+三角架 11.5027823792
+人心惟危 13.900677652
+搞怪 12.2912397395
+会计制度 11.9547675029
+享有声誉 11.5027823792
+引下 13.2075304714
+埋藏地 13.900677652
+小盘股 7.37125881371
+盗窃犯 11.9547675029
+减压蒸馏 11.8212361103
+色氨酸 11.0103058941
+冷暖箱 12.5143832909
+人才难得 12.5143832909
+煎药 10.4994802703
+无缺 11.8212361103
+注水泵 13.900677652
+贺敬之 11.7034530746
+李建民 13.900677652
+麻衣 11.9547675029
+其间 7.20859390947
+校样 13.2075304714
+校核 11.0103058941
+搞懂 12.5143832909
+有效分蘖 13.900677652
+引信 8.87679713113
+赵国为 13.900677652
+错用 12.5143832909
+芦青 13.900677652
+将错就错 11.2616203224
+广济县 12.2912397395
+安西 9.0884932966
+水平线 10.9562386728
+信号处理 9.94943393339
+咸水鱼 13.900677652
+蒙特利尔 9.93038573842
+代父 11.8212361103
+咬破 10.1630080337
+通畅 9.08039608637
+堂姐妹 13.2075304714
+刁钻刻薄 13.900677652
+医风 12.1089181827
+乔家院 13.2075304714
+固本 11.7034530746
+公羊墨 13.2075304714
+核基地 13.900677652
+综合化 10.8561552143
+穆加贝 12.2912397395
+外电路 11.5027823792
+赵佗 11.0103058941
+赵体 12.1089181827
+菱锰矿 12.1089181827
+马德里 9.14708746087
+墨水儿 12.8020653633
+含愧 13.900677652
+抗心律 13.900677652
+保证供应 11.3357282945
+不惟 8.93783302172
+两万五千六百七十八吨 13.2075304714
+中央政治局 8.30969067146
+固有 8.16733637508
+平均数 9.33632946051
+赵佶 10.6818018271
+海宁市 11.3357282945
+官逼民反 11.4157710022
+有多深 10.1630080337
+垂直性 13.2075304714
+何足道 12.2912397395
+引例 13.2075304714
+灌云 11.8212361103
+百分之九十九 11.5027823792
+针管 11.9547675029
+太超前 12.5143832909
+胞嘧啶 11.3357282945
+十锅 13.2075304714
+咬碎 10.765183436
+福煦 11.4157710022
+打棍子 13.900677652
+洪水位 11.3357282945
+低位沼泽 12.5143832909
+白陶 11.8212361103
+魏王旨 13.2075304714
+福宫 13.900677652
+光吸收 13.900677652
+加温器 11.5027823792
+纵长 11.1926274509
+灭亡 7.46773755924
+尤烈 12.2912397395
+气粗 11.598092559
+小组 7.34674424795
+十锭 12.5143832909
+仲淹 12.5143832909
+狗咬狗 11.9547675029
+百分之九十五 12.5143832909
+镶嵌画 11.0103058941
+凌振 10.2117981979
+天悦 13.900677652
+小结 10.5684731418
+张观准 13.2075304714
+刘彦宗 10.4666904475
+鼻子嘴巴 12.8020653633
+引伸 10.2117981979
+马鸣著 13.2075304714
+缘分 9.34680076038
+蛇咬伤 11.5027823792
+小红 9.25628675283
+内河航运 9.54396882529
+摘食 13.900677652
+赵俊 11.2616203224
+耳力 13.2075304714
+卢沟水 13.2075304714
+五十八种 13.2075304714
+双眼皮 10.4041700905
+中国台湾 9.21854642485
+蒙思宠 13.2075304714
+一较高低 12.8020653633
+贫瘠 9.32596667347
+梁家渡 13.2075304714
+斗地主 12.5143832909
+老伯伯 12.2912397395
+用劲儿 13.2075304714
+用电量 9.41204128224
+灌上 12.1089181827
+灌下 11.0103058941
+凌纯声 12.8020653633
+达标率 13.900677652
+秦城 12.2912397395
+麻袋 9.31571017331
+灌丛 8.41588071849
+王卫东 11.2616203224
+救民水火 10.8096351986
+奥迪 8.46695564842
+思想动态 13.900677652
+缉毒 12.1089181827
+仙人洞 10.604840786
+燕麦粥 12.8020653633
+只用 8.11685246965
+吸纳 8.31718134319
+郑中基 13.900677652
+脚注 12.1089181827
+阿莱城 12.8020653633
+随想曲 11.0674643079
+丁烯 10.6818018271
+大半条 13.2075304714
+昭陵 10.1630080337
+董嫂 11.4157710022
+狗年 13.900677652
+生幼仔 12.2912397395
+丁烷 10.2630914922
+省时 11.1926274509
+喷丝头 12.2912397395
+自然性 11.9547675029
+奥运 9.43476953332
+于安丰 13.900677652
+从宙斯 13.2075304714
+梁家楼 13.2075304714
+殃及池鱼 12.8020653633
+民族学家 10.7226238216
+艾利和 13.900677652
+兄弟姐妹 9.5186510173
+善男信女 10.9049453784
+浮郄 13.900677652
+这年头 9.20932976975
+大红花 11.2616203224
+菲律宾共和国 13.2075304714
+一是一 12.2912397395
+有仇必报 13.900677652
+特雷维 13.900677652
+丁炔 12.8020653633
+肥乡县 13.2075304714
+雅德 12.8020653633
+挥兵 10.4994802703
+器宇轩昂 11.7034530746
+乐团 9.93038573842
+挣开 11.598092559
+寡情薄意 13.2075304714
+变淡 11.1926274509
+牡丹乡 13.2075304714
+供暖费 12.5143832909
+头端 11.4157710022
+师表 12.5143832909
+个性特征 10.9562386728
+昭阳 10.642581114
+丁点 11.3357282945
+霪雨 13.2075304714
+接触面 10.3453295905
+野种 12.2912397395
+盛大网络 10.533381822
+宰和邑 13.2075304714
+节概 13.2075304714
+庞统 10.2117981979
+笑颜 10.765183436
+劳淋 13.900677652
+弗莱舍 13.2075304714
+语丝 11.5027823792
+广胜寺 12.2912397395
+招商会 13.900677652
+牡丹亭 10.2371160058
+不言而明 13.900677652
+戴礼 12.2912397395
+丁火 12.5143832909
+复员费 13.2075304714
+文类 11.5027823792
+昭雪 10.1164880181
+戒台寺 12.5143832909
+挥写 11.598092559
+朝东南 12.8020653633
+挥军 10.4666904475
+两节课 12.2912397395
+宋哲元 10.9562386728
+别项 13.2075304714
+乐园 8.53938548627
+李吉甫 10.8096351986
+硬节 13.900677652
+精神病人 10.8561552143
+挺快 11.7034530746
+机要处 11.0674643079
+变流 11.598092559
+出血病 13.2075304714
+承销人 13.900677652
+变浅 10.1164880181
+发育成 9.28555713513
+餐风沐雨 13.900677652
+窜逃 12.1089181827
+脚气 10.6818018271
+变浓 11.8212361103
+涨跌幅 8.37522471284
+兰芝 9.07236391467
+宗任嵬 13.2075304714
+引文 10.533381822
+洗头膏 13.2075304714
+领导班子 8.77671367257
+浓烟 9.14708746087
+一百万两则 13.900677652
+鹿子 11.598092559
+文簿 11.5027823792
+和田玉产 13.2075304714
+康涅狄格州 10.533381822
+祁山 9.63799777493
+似懂非懂 10.3743171274
+浓烈 8.85082164473
+朝东北 12.1089181827
+抢购风 13.900677652
+交换法 11.9547675029
+女民警 13.900677652
+淫秽 8.58747167293
+子高澄 12.5143832909
+受雇 10.1630080337
+粘合剂 10.2117981979
+目前 3.91528758382
+不可触摸 13.900677652
+抽闲 13.2075304714
+骄傲地 10.8096351986
+闲居 10.0088573539
+二氧化矽 13.900677652
+支持软件 12.8020653633
+第五十三章 11.3357282945
+瓦尔迪 12.1089181827
+魏延听 12.2912397395
+谨此 12.1089181827
+杭得茶 8.75901409547
+子高湛 13.2075304714
+唐物女子 13.2075304714
+八包 13.900677652
+大理石 7.91674137129
+车辆段 12.5143832909
+南柯子 12.8020653633
+无路可走 10.3171587135
+禁烟令 13.900677652
+亿法郎 10.8096351986
+据说 6.92153237691
+兴城县 12.8020653633
+马南雅 13.2075304714
+中证网 7.92432674268
+陈东同 13.2075304714
+别馆 12.5143832909
+海拉尔河 10.642581114
+花笺记 12.1089181827
+错待 13.900677652
+劳民 13.2075304714
+保护主义者 13.2075304714
+一等奖 9.00283785202
+不恨 9.77354326693
+衔枚疾走 12.2912397395
+立方米 7.73106691948
+经济委员会 10.2630914922
+出埃及记 13.2075304714
+劳氏 13.900677652
+退下去 10.5684731418
+尼达姆 13.2075304714
+变法 8.0985592766
+法洛氏 12.8020653633
+硬茧 11.9547675029
+五员 11.2616203224
+强好胜 13.900677652
+非分之想 10.604840786
+均须 9.93038573842
+杯酒言欢 13.900677652
+洛可可式 13.900677652
+于城镇 11.9547675029
+方面大耳 12.8020653633
+受难 9.72629038208
+抵御 7.62591563073
+御用 9.31571017331
+受降 9.93038573842
+斧钺 11.0674643079
+硫酸铝铵 13.900677652
+莫言 10.8561552143
+受限 9.04086524761
+杨陵 11.9547675029
+维斯宁 12.8020653633
+膝上型 13.900677652
+碾米机 12.8020653633
+开着车 10.4349417492
+天竺僧人 13.900677652
+除掉 8.77077893705
+代王嘉 12.1089181827
+大中学校 10.765183436
+第三磨牙 13.900677652
+七辆车 13.900677652
+关系正常 13.900677652
+责任编辑 11.8212361103
+玉檀端 11.8212361103
+人大代表 8.83808261895
+没爹 12.5143832909
+装装 12.2912397395
+上进心 11.8212361103
+罗宗贤 13.2075304714
+目力 10.5684731418
+语体 12.2912397395
+头等 9.62401153296
+粘合力 12.5143832909
+全斗焕 12.1089181827
+彭其关 12.8020653633
+汽车旅馆 13.2075304714
+右安门 11.9547675029
+梅雨季节 10.9562386728
+头筹 9.75754292558
+两千左右 13.2075304714
+低龄 12.8020653633
+努沙登加拉 11.5027823792
+开矿 9.96885201925
+异烟肼 11.7034530746
+逛来 13.2075304714
+乐而忘返 13.900677652
+鲁特旗 11.598092559
+受阻 8.31718134319
+仲兄 11.598092559
+不常出现 13.2075304714
+除怪 13.900677652
+放情 13.2075304714
+爆粗 12.8020653633
+粢饭 13.900677652
+生达命 13.900677652
+水密 11.598092559
+淫笑 11.9547675029
+移到 8.63798746307
+攫取 8.9308643524
+分来分去 13.900677652
+老声老气 13.900677652
+扩能 11.1926274509
+超轻薄 12.1089181827
+宝玉 6.97410061875
+大震 9.23723855786
+杂感 11.9547675029
+节次 12.5143832909
+一群 6.74372128736
+泌尿系 10.3171587135
+五六枚 13.900677652
+水杯 11.1280889297
+金井中 12.2912397395
+宝玺 13.900677652
+飞也似 9.85762638414
+于南征 13.2075304714
+节欲 10.4666904475
+扬声大 12.1089181827
+顿首再拜 13.900677652
+三军 8.0229418702
+阿雷基帕 12.5143832909
+孤岛 9.77354326693
+除息 9.98865464655
+鹿产仔 13.2075304714
+多浪 12.8020653633
+逼出来 10.8561552143
+先见之明 10.642581114
+维斯塔 12.1089181827
+小门儿 12.8020653633
+福字 11.0674643079
+闲弃 13.900677652
+除恶 10.2630914922
+共舞 11.1280889297
+急救室 11.1926274509
+刘光弟 12.1089181827
+优生优育 11.8212361103
+马嚼子 12.5143832909
+艺高 13.2075304714
+篱笆墙 12.8020653633
+机要室 13.900677652
+吕贝克 11.2616203224
+公则活 13.2075304714
+雾腾腾 10.6818018271
+常常见 13.2075304714
+历史状况 12.2912397395
+减刑 10.2371160058
+主族 13.2075304714
+攫去 13.900677652
+女人体 12.8020653633
+张照云海 13.900677652
+主阵地 11.4157710022
+封闭型 11.598092559
+歪诗 12.1089181827
+文学遗产 11.2616203224
+等功 13.900677652
+卡尔莱 13.2075304714
+皱襞 11.4157710022
+新思维 11.4157710022
+从临颍 12.2912397395
+中重型 13.900677652
+闲心 9.6811699468
+五六本 13.900677652
+王七人 13.2075304714
+俏佳人 12.5143832909
+省来 13.900677652
+张维迎 11.1926274509
+头破 12.8020653633
+明黄缎 13.2075304714
+油腻感 12.8020653633
+装订 10.2630914922
+目击 10.2371160058
+霍桑 11.2616203224
+奥赛 11.9547675029
+地缘政治学 11.9547675029
+五六月 11.9547675029
+三氯甲烷 12.1089181827
+母钟 13.900677652
+安装工 13.900677652
+别驾 10.7226238216
+戴笠 10.9562386728
+联络网 13.2075304714
+终生事业 12.8020653633
+水寨 9.58318953844
+蒋子龙 12.2912397395
+炎日 12.8020653633
+副校长 8.98802276624
+烟腾腾 13.2075304714
+加农炮 9.75754292558
+中山狼 10.6818018271
+千秋功罪 12.1089181827
+白球放 13.900677652
+松果体 12.8020653633
+皱褶 9.93038573842
+麻花儿 12.1089181827
+明初复 12.1089181827
+古德曼 12.8020653633
+要不了 10.1164880181
+艺术人生 10.6818018271
+联于 13.900677652
+朝朝 11.8212361103
+货郎担 12.8020653633
+帕麦斯 12.8020653633
+接植 13.900677652
+挥发 9.20932976975
+不识阵势 13.900677652
+必经之地 9.71102290995
+九龙湾 13.900677652
+一连串 8.44535653662
+致命伤 10.9562386728
+挥别 12.5143832909
+种广布 13.900677652
+安义县 13.2075304714
+治疗机 13.2075304714
+结婚照 12.2912397395
+飨宴 13.2075304714
+官修日 13.2075304714
+飨客 13.900677652
+漕河泾 11.0674643079
+免开尊口 12.5143832909
+费米子 10.9049453784
+谥号 10.0940151622
+举案齐眉 11.9547675029
+玄德求 13.2075304714
+心粗胆大 13.900677652
+文翰 13.2075304714
+童贯真 13.900677652
+硬腭 12.5143832909
+丁班 13.900677652
+挥刀 9.94943393339
+白雨 12.5143832909
+侯相公 11.8212361103
+仙人渡 12.1089181827
+神宫 10.6818018271
+孤峰 10.4994802703
+瞎搞 13.2075304714
+发卡行 13.900677652
+塘堰 12.1089181827
+胚芽鞘 12.8020653633
+硬脂 13.2075304714
+天意 8.75318317516
+辅导材料 13.900677652
+官修方 13.2075304714
+军容风纪 11.7034530746
+别忙 10.765183436
+美元汇率 8.0746775446
+老娘们儿 12.1089181827
+和婷婷 11.9547675029
+瞎摸 12.1089181827
+一统天下 10.2371160058
+塘塞 13.900677652
+偷偷摸摸 9.49395840471
+千家诗 11.9547675029
+艺高胆大 12.8020653633
+遍寻 11.0103058941
+八卦 8.70772080109
+马鳖 13.900677652
+或然论 13.900677652
+径流模数 12.5143832909
+莫桑比克解放阵线党 12.5143832909
+发毛 9.96885201925
+装傻充愣 12.8020653633
+两张床 11.7034530746
+老鼠会 13.2075304714
+方今先 13.2075304714
+丁玲 10.604840786
+一肚子 8.92394390956
+布拉维 12.8020653633
+杨琏真 13.2075304714
+孕育期 12.5143832909
+挥剑 10.3743171274
+茶饮料 11.8212361103
+叶方霭 11.598092559
+澄明 11.5027823792
+售完 11.1926274509
+挥动 8.86372504956
+勤谨 10.7226238216
+那宝钗 12.8020653633
+莲花县 11.9547675029
+急修 13.900677652
+变清 13.2075304714
+过玉娘 13.900677652
+实物量 13.2075304714
+常结群 12.1089181827
+依顺 12.1089181827
+变温 12.2912397395
+拟写 12.8020653633
+临颍 10.9562386728
+荣成市 12.8020653633
+岂肯 9.66657114738
+应时 11.0674643079
+对答 9.72629038208
+鲍尔斯 13.2075304714
+木耳 8.84443184663
+乌兰布和沙漠 10.604840786
+斯里巴加湾 13.2075304714
+孟州温 13.2075304714
+可捕量 13.2075304714
+杰亨斯 13.2075304714
+硬膏 13.2075304714
+搓手顿足 13.900677652
+官修政 13.2075304714
+奥谢 13.900677652
+青年湖 13.900677652
+混饭吃 10.9562386728
+里亚斯 12.1089181827
+较高级 10.533381822
+九届全国人大 12.8020653633
+学大庆 13.900677652
+尔玛 13.900677652
+今不如昔 12.2912397395
+铸造冠 13.900677652
+高浮雕 11.1280889297
+祁彪 13.900677652
+轻重工业 10.4041700905
+师说 12.1089181827
+通久源 13.2075304714
+右前锋 13.900677652
+变湿 13.900677652
+扭转身 11.4157710022
+岂能 8.39941944143
+沥酒 12.2912397395
+宝物 9.25628675283
+莫莫格 13.2075304714
+持续时间 8.4801426527
+浆湖 13.900677652
+外迁 11.0103058941
+王元直 12.2912397395
+可回收 11.7034530746
+观光农业 12.8020653633
+维斯帕 12.2912397395
+二万人 11.9547675029
+幸恢盅 13.2075304714
+奥诺 11.9547675029
+小猴子 10.604840786
+仙乐 11.4157710022
+雄体 10.5684731418
+龙永图 9.96885201925
+玻璃体 10.4994802703
+仙乡 11.598092559
+装货 10.6818018271
+八开 12.2912397395
+头纱 12.5143832909
+小娇娘 13.900677652
+愈战愈勇 13.2075304714
+与世长辞 11.3357282945
+克瑞西 13.2075304714
+节流 11.1926274509
+利维坦 11.7034530746
+燕国于 12.8020653633
+白嘉轩 7.95525704337
+雄伟 8.25877058104
+明友 13.2075304714
+接演 13.900677652
+倏然 10.0720362555
+情况汇报 10.3453295905
+年轻力壮 10.6818018271
+艾林瓦 13.900677652
+环卫工人 10.0294766411
+未竟事业 13.2075304714
+赵昌 11.9547675029
+爆竹 9.80633308975
+头维 13.2075304714
+头绳 11.7034530746
+仙丹 10.1871055853
+阿勒泰市 12.1089181827
+那梦中 12.8020653633
+白锦 11.7034530746
+头绪 8.92394390956
+花萼 9.63799777493
+十八种 12.2912397395
+洋红色 13.2075304714
+鑫诺 13.900677652
+时装节 13.900677652
+漫无限制 12.8020653633
+虹吸现象 13.2075304714
+碰碰运气 10.8561552143
+上玉皇 13.2075304714
+修书付 11.9547675029
+排球赛 11.8212361103
+百家饭 12.5143832909
+二万两 11.1926274509
+步行机 12.1089181827
+推荐表 12.8020653633
+量子光学 11.9547675029
+除暴 12.2912397395
+瞎掉 12.5143832909
+王朝佐 12.2912397395
+攫夺 13.2075304714
+些许 8.9102450652
+初生生长 12.8020653633
+乌山头 13.900677652
+算得了 9.96885201925
+乳沟 12.2912397395
+五六两 13.2075304714
+周小川 8.91707103027
+邮电所 11.598092559
+魏朝聘 13.2075304714
+马直来 13.2075304714
+沉缅于 12.1089181827
+程元振 12.8020653633
+燕国下 13.2075304714
+于桐城 13.900677652
+古人类学家 11.9547675029
+大西洋 7.23244940356
+耶克斯 13.2075304714
+莲蓬头 12.5143832909
+震耳欲聋 9.80633308975
+白鹿书院 10.1394775363
+兰茨 12.5143832909
+党李璜 13.2075304714
+小燕子 11.8212361103
+课间操 12.5143832909
+纲举目张 12.1089181827
+但俊德 13.2075304714
+柯九思 12.8020653633
+大西洲 12.1089181827
+御寒衣 12.2912397395
+大钞 13.2075304714
+排放口 13.900677652
+史叙论 12.5143832909
+修书令 12.5143832909
+抽选 12.8020653633
+根哥布 13.900677652
+燕国为 12.8020653633
+八大关 13.900677652
+第八届全国政协 12.5143832909
+省情 12.2912397395
+文科 9.21854642485
+艾特 12.1089181827
+吸管 11.3357282945
+领风骚 12.1089181827
+文秘 11.598092559
+节气 10.0294766411
+纤维结构 12.8020653633
+担子菌 10.4994802703
+开着 8.49350588052
+文秀 11.9547675029
+文种 11.598092559
+克沃兹 13.900677652
+不遂意 12.8020653633
+纠集 9.77354326693
+赋有 10.7226238216
+十八碗 13.900677652
+真空地带 11.3357282945
+节水 8.56313957227
+爆管 11.2616203224
+武能安 13.900677652
+白沙县 13.900677652
+瞎成 13.2075304714
+基尔比 11.5027823792
+方龄贵 11.598092559
+飞利浦 10.7226238216
+浦融 13.2075304714
+周太王 12.2912397395
+货到付款 11.9547675029
+红衣服 12.8020653633
+包润石 13.900677652
+反相器 13.2075304714
+瞎扯 11.0103058941
+风景不殊 13.900677652
+许国璋 13.2075304714
+特沛彝 13.2075304714
+眼线液 13.900677652
+地下火 13.2075304714
+小型车 10.4994802703
+背黑锅 11.5027823792
+悔之晚矣 10.604840786
+尿蛋白 10.4349417492
+师资 9.91169360541
+赋权 13.900677652
+祸国殃民 10.7226238216
+洋专家 13.2075304714
+花溪里 12.2912397395
+劳格 12.5143832909
+三万八千元 13.2075304714
+师走 13.900677652
+自然数 9.69598503258
+除杂 12.5143832909
+除权 10.1164880181
+卷烟厂 10.3453295905
+倾尽全力 12.2912397395
+泌尿管 13.900677652
+晋辟雍 12.8020653633
+气汹汹 12.1089181827
+惠远 12.1089181827
+咬起来 11.9547675029
+爆笑 12.5143832909
+大吹大打 13.2075304714
+弗朗西亚 12.8020653633
+似醉如痴 12.8020653633
+各县市 10.4666904475
+百余部 12.5143832909
+侯相埒 13.2075304714
+怪笑 11.598092559
+醛固酮 10.4349417492
+李义河 9.0884932966
+郦寄击 12.8020653633
+吴玉章 11.2616203224
+拿主意 10.0505300503
+不了了之 9.46986085313
+宝琴 9.54396882529
+棋瘾 12.8020653633
+文祺 13.900677652
+氅衣 12.8020653633
+出血点 11.8212361103
+好命 11.7034530746
+文祥 10.8096351986
+居乾 12.5143832909
+劳森 12.2912397395
+变格 12.5143832909
+周镳 8.67493097826
+司隶校 10.0294766411
+节油 9.72629038208
+李晋伟 13.900677652
+沙僧领 13.2075304714
+没想到 6.32150968458
+土物 12.2912397395
+星移斗转 12.8020653633
+线路图 11.8212361103
+精心组织 10.5684731418
+巴尔沃亚 12.5143832909
+盖叫天 11.598092559
+夜市 10.0505300503
+死亡枕藉 13.2075304714
+晓悟 13.2075304714
+诸夷内 13.2075304714
+彩球 12.1089181827
+何至于此 11.9547675029
+发育期 10.9049453784
+周大哥 11.4157710022
+出血热 11.5027823792
+大洋网 11.9547675029
+文社 11.3357282945
+仙侣 12.5143832909
+普适常量 13.2075304714
+千禧年 13.900677652
+丁田 12.1089181827
+丁申 13.900677652
+谭氏 12.5143832909
+丁男 10.4349417492
+头罩 11.1280889297
+今欣 13.900677652
+躲躲闪闪 10.4994802703
+显赫一时 11.3357282945
+赵晋 13.2075304714
+陈东升 13.2075304714
+司马道子 11.5027823792
+受重 13.2075304714
+挺大 10.7226238216
+王弟叔 13.2075304714
+马拉维 10.0720362555
+浆汁 11.0674643079
+王惠 11.9547675029
+马罗基 13.2075304714
+坐垫 10.2630914922
+滑石片 13.900677652
+富子梅 13.900677652
+池鱼之殃 13.900677652
+加以克服 13.900677652
+屠龙之 13.2075304714
+深耕细作 12.5143832909
+检察官 9.49395840471
+闻笛 12.2912397395
+霍泉 12.5143832909
+没人接 10.8561552143
+文竹 12.8020653633
+传动轴 11.1926274509
+特兰湖 13.900677652
+挺多 12.1089181827
+文章 6.62342992534
+现代级 11.598092559
+闻名四方 13.900677652
+归仁 11.9547675029
+中吨位 13.900677652
+大铖 11.5027823792
+省掉 11.8212361103
+标准分数 13.2075304714
+斋醮 10.4994802703
+粘土砖 12.5143832909
+挺好 10.2630914922
+迷惑不解 10.604840786
+交代问题 11.3357282945
+氢气球 12.5143832909
+补钉 10.8561552143
+庄头 11.0674643079
+昭通 10.3171587135
+团体性 13.900677652
+浆水 10.8561552143
+宝石 8.11071748108
+封金挂印 13.2075304714
+法华寺 10.765183436
+装车 10.2117981979
+学风 9.84023464143
+装载 8.46259834305
+沧江 12.8020653633
+大众化 9.93038573842
+毛朱诗 12.8020653633
+粉饰太平 11.8212361103
+压舌板 12.1089181827
+李殿仁 13.900677652
+病理性 9.98865464655
+第八队 12.2912397395
+赔偿 7.46292600224
+母邦 12.1089181827
+圣神文武 13.900677652
+铬盐 13.900677652
+余怀转 12.8020653633
+共沉淀 11.9547675029
+问题所在 11.7034530746
+别念 12.5143832909
+尚衣监 11.7034530746
+酸度 10.4041700905
+下弦月 10.9049453784
+重新聚集 11.4157710022
+宝眷 10.6818018271
+薄荷脑 11.598092559
+爆破 8.63798746307
+品竹调弦 13.900677652
+遍布 7.97108850859
+阿莱克 11.9547675029
+易学 10.1164880181
+姑奶奶 9.63799777493
+王玄谟 13.900677652
+子合赞 12.2912397395
+低飞 11.8212361103
+隔起 13.2075304714
+蓝鹊 13.2075304714
+脱芯克 13.900677652
+个人风格 11.0103058941
+浓相 13.2075304714
+六篓 13.900677652
+装过 11.2616203224
+闲官 11.9547675029
+操切 13.900677652
+突击师 11.2616203224
+铁匠铺 10.533381822
+擒捉 10.533381822
+西昆仑 12.2912397395
+装进 8.85725253506
+技击 10.604840786
+胰岛腺 13.900677652
+鼓瑟 11.5027823792
+装运 9.87532596124
+钝顶 13.900677652
+临床实践 10.5684731418
+三十八位 12.8020653633
+暴力事件 11.1280889297
+霍氏 11.1280889297
+病猪 12.8020653633
+田仰 11.598092559
+低领 13.2075304714
+保持身材 11.7034530746
+刀山剑树 13.900677652
+童公 12.8020653633
+低频 9.55687223012
+纠错 10.4349417492
+毋得违 12.8020653633
+泌尿科 12.1089181827
+赔出 12.5143832909
+穆弘庄 12.5143832909
+只爱 10.9049453784
+羔皮 11.0674643079
+西高止山 12.8020653633
+莫可原 13.900677652
+腿骨 10.6818018271
+自润滑 12.2912397395
+御玺 11.7034530746
+于承圣 12.8020653633
+眉冲 13.2075304714
+宛然 11.1926274509
+卧病在床 10.8561552143
+小汤山 10.4041700905
+抵押品 10.0940151622
+电传递 13.900677652
+浓眉 9.96885201925
+格尔毕 13.2075304714
+一百三十多万 12.5143832909
+沙僧驾 13.900677652
+五六把 13.2075304714
+冯绳武 9.74179456862
+戴红 12.2912397395
+睡美人 11.0674643079
+重金属 9.80633308975
+宝盖 10.8561552143
+吸积 11.3357282945
+绶带 11.5027823792
+受邀 10.8561552143
+三十八代 12.5143832909
+自然村 11.0103058941
+封闭剂 13.900677652
+宇文 10.3453295905
+祁寒 13.900677652
+新型建材 11.0103058941
+陈东则 13.900677652
+文简 12.5143832909
+鱼贯 10.3743171274
+浓睡 12.8020653633
+宝盈 9.40086798165
+除数 11.5027823792
+鱼贩 12.8020653633
+努埃尔 12.5143832909
+电脑产品 13.900677652
+七七事变 9.91169360541
+省报 10.2630914922
+戴维 9.22784881751
+熊树梅 9.74179456862
+宝相 11.8212361103
+流血牺牲 11.0674643079
+镂骨铭心 13.2075304714
+五六担 13.2075304714
+茜素 12.1089181827
+赋敛 10.7226238216
+戴宗取 13.2075304714
+劳模 9.61021821083
+三十八个 12.2912397395
+湖外 11.9547675029
+枭雄 10.765183436
+通讯部 13.2075304714
+陆军官校 13.900677652
+日置益 12.1089181827
+新途径 9.89334446674
+阿尔代什 13.2075304714
+五六成 13.2075304714
+万物化 13.2075304714
+莫道石 13.900677652
+赵温讯 13.2075304714
+中国人民大学出版社 12.8020653633
+脚步 6.96725462625
+尔特 10.0940151622
+方程式 9.49395840471
+清康熙 8.53938548627
+榻榻米 11.9547675029
+种牛痘 12.1089181827
+塘岸 13.2075304714
+鱼跃 10.642581114
+赔光 11.4157710022
+黑棋子 13.900677652
+塞勒 13.2075304714
+双氧水 10.604840786
+波利克拉 13.900677652
+文笔 9.49395840471
+小城 8.98069672615
+冰箱门 12.5143832909
+除旧 11.7034530746
+转移视线 11.0103058941
+冰岛共和国 13.2075304714
+案侦破 12.8020653633
+井灌井 12.8020653633
+邢邵 13.2075304714
+营造尺 13.900677652
+财产法 13.900677652
+斯人也 12.2912397395
+玉叶金枝 13.2075304714
+天津日报 11.9547675029
+演讲时 9.87532596124
+一百一十三个 13.2075304714
+浆液 10.3453295905
+帕其尼 13.900677652
+太虚 10.4994802703
+成都日报 11.5027823792
+虚数 10.1164880181
+产业群 11.8212361103
+藏羚羊 11.4157710022
+群呼 13.900677652
+独自个 11.1926274509
+惠赐 13.2075304714
+双曲线 10.4041700905
+没词儿 13.2075304714
+止血棉 13.900677652
+迎新年 13.2075304714
+通报情况 12.2912397395
+运输车 9.65218240993
+劳教 9.94943393339
+冀鲁 12.2912397395
+母鸡 9.36807815882
+攻击力 10.765183436
+母鸭 12.5143832909
+丹阳市 12.5143832909
+粉体 12.8020653633
+丁磊 10.765183436
+北莫尔斯克 12.8020653633
+精彩节目 12.5143832909
+枪支罪 12.8020653633
+师者 12.1089181827
+可沿 12.5143832909
+契约性 13.900677652
+佯装不知 11.2616203224
+坂田黄 13.900677652
+充当人质 13.2075304714
+头状 10.8561552143
+孙本孝 11.1280889297
+霍拉 12.2912397395
+灵活机动 11.1926274509
+结构化程序 12.1089181827
+农博会 12.8020653633
+阿尔及利亚民主人民共和国 13.2075304714
+盐市口 13.2075304714
+回传 11.9547675029
+变新 12.2912397395
+方柱石 12.1089181827
+变旋 11.9547675029
+弘仁普 13.2075304714
+缝起来 11.7034530746
+营养配餐 13.900677652
+燃气灶 13.900677652
+售假 10.6818018271
+正言不讳 13.900677652
+惠英 10.2117981979
+成像仪 12.2912397395
+回位 12.5143832909
+师职 12.2912397395
+炎暑 11.7034530746
+李自成起义 11.1280889297
+母鹿 10.765183436
+齐威 13.900677652
+菜青虫 12.2912397395
+低阶 11.9547675029
+边诸军 13.2075304714
+劳改 9.71102290995
+延绳钓 12.8020653633
+内尚存 13.2075304714
+自食恶果 13.2075304714
+飞豹 11.4157710022
+中油气 12.8020653633
+壮大 8.15128466607
+摇身一变 9.12155415886
+发展观 8.230796729
+曹昂 12.1089181827
+通话质量 13.900677652
+权衡利弊 10.4994802703
+开化县 13.2075304714
+在职工人 13.2075304714
+五十间 12.8020653633
+图西族 13.2075304714
+一炮打响 12.2912397395
+缉捕 10.0088573539
+不论是谁 11.8212361103
+劳旋 13.2075304714
+达尔丘 13.2075304714
+唾沫 8.68574189437
+淫逸 11.4157710022
+财综 13.2075304714
+民法学 12.8020653633
+格里斯 12.8020653633
+鱼苗 10.1394775363
+乐基儿 13.2075304714
+哥德巴赫 13.2075304714
+福临扬 13.900677652
+骨髓移植 11.7034530746
+一而再 9.82314020807
+北方交通大学 13.2075304714
+便携机 12.8020653633
+达到最佳 11.0103058941
+嗷嗷叫 10.8096351986
+空柜子 13.2075304714
+芦沟河 10.9562386728
+锄把 12.8020653633
+沙僧闻 11.8212361103
+何乐不为 11.9547675029
+腿长 11.9547675029
+双峰驼 11.7034530746
+头牛 11.0103058941
+封伯封 12.5143832909
+鱼花 13.900677652
+兴和县 12.8020653633
+惠良 10.642581114
+山苍子 11.2616203224
+变故 8.83177344976
+文理 10.4349417492
+头牌 11.4157710022
+性观念 12.2912397395
+别逗 12.5143832909
+头版 10.8561552143
+除错 13.2075304714
+刚出道 11.3357282945
+荆湖路 12.8020653633
+时为燕 11.598092559
+中国政法大学 10.4994802703
+劳方 12.8020653633
+计温学 13.2075304714
+治疗法 12.5143832909
+寒江雪 11.9547675029
+五六丈 11.8212361103
+劳斯 11.7034530746
+垃圾 7.98988100794
+虚报 10.3171587135
+喻世明 11.3357282945
+澄海 10.3171587135
+变数 8.47572763449
+闭门读书 13.900677652
+凄然泪下 13.900677652
+社科联 13.2075304714
+上场门 13.2075304714
+酷好 13.2075304714
+低靡 13.2075304714
+沿江路 13.900677652
+丁种 13.900677652
+盛乐城 12.8020653633
+零售价 9.25628675283
+邸阁 12.8020653633
+蓝黑 11.8212361103
+赫德总 12.8020653633
+南京医科大学 13.900677652
+丰田佐吉 12.8020653633
+范立刚 12.5143832909
+白问 12.2912397395
+可复性 13.2075304714
+闫砦 13.2075304714
+缉拿 10.8561552143
+耍阴谋 12.8020653633
+吕宋海 12.8020653633
+职场 10.1164880181
+干事长 12.1089181827
+拉米尔 11.8212361103
+文字游戏 11.0674643079
+回个 11.5027823792
+回中 12.2912397395
+律法 10.604840786
+插图本 13.2075304714
+用户程序 11.8212361103
+抵埠 13.2075304714
+科学主义 12.1089181827
+粉丝 9.31571017331
+屈银华 12.8020653633
+蓄热器 13.900677652
+精工细作 13.2075304714
+除此 10.2117981979
+忠诚度 11.0103058941
+住院 8.22392384971
+巴拉顿湖 12.5143832909
+东北地区 8.05135287203
+羰基镍 11.9547675029
+腐朽思想 12.1089181827
+古德里安 11.4157710022
+鹿脯 12.5143832909
+柯尔劳 13.900677652
+帕西奥 13.900677652
+赔得 11.1926274509
+克鲁克斯 11.8212361103
+一等兵 12.2912397395
+讨老婆 12.8020653633
+引导人 12.5143832909
+原可宽 13.2075304714
+尼杜迎 13.900677652
+山仙宫 12.5143832909
+省油 9.98865464655
+回乡 8.71329184614
+复员证 13.2075304714
+回书 9.62401153296
+毛岸英 10.642581114
+唾液 9.35738286971
+吉田松阴 11.8212361103
+神路街 12.8020653633
+福堂 9.72629038208
+回事 7.93453091285
+昏花 10.6818018271
+影业公司 9.72629038208
+银广夏 9.29550746599
+淫羊藿 12.1089181827
+赔偿制度 12.2912397395
+回人 11.4157710022
+壮士 9.14708746087
+肆无忌惮 9.23723855786
+生烛 10.6818018271
+飘散在 12.8020653633
+费尽心血 13.2075304714
+丁祭 12.5143832909
+杨却先 13.2075304714
+通玄 11.9547675029
+硬说 11.7034530746
+惜春 9.33632946051
+回京 8.81308131674
+粘土矿 10.0505300503
+母龟 13.900677652
+竞争机制 10.533381822
+回交 11.7034530746
+缪昌期 13.2075304714
+让行 11.0674643079
+埃伏尔 12.5143832909
+报关单 12.5143832909
+文生 13.900677652
+撵出来 11.4157710022
+雷慕沙 13.2075304714
+摄录机 13.900677652
+爱想 12.8020653633
+鲁达基 11.9547675029
+华严 10.533381822
+诸葛巾 13.2075304714
+博兴 11.4157710022
+制冷系统 12.2912397395
+柳蒿 13.900677652
+次新股 9.27570483869
+鹿脚 13.900677652
+文电 12.2912397395
+团泊洼 12.5143832909
+不平衡性 10.9562386728
+不可开交 9.65218240993
+吸着 9.35738286971
+导入期 12.8020653633
+唐建中 12.5143832909
+甩不掉 11.7034530746
+售出 9.32596667347
+搜房网 13.2075304714
+铁板桥 11.8212361103
+磷矿石 10.642581114
+云屯雨集 13.900677652
+和和气气 11.2616203224
+指骨 11.598092559
+回令 13.900677652
+零售业 9.09665660724
+华丽 8.08654712015
+奏鸣曲式 11.4157710022
+闲坐 10.4994802703
+余上沅 13.2075304714
+封闭式 7.68606955355
+吻合术 11.9547675029
+诱供 12.1089181827
+变构 13.900677652
+群贤毕至 13.900677652
+白沙岛 11.8212361103
+庭荫树 12.2912397395
+除根 11.2616203224
+白喉毒素 13.2075304714
+文益 10.6818018271
+聚氨酯 10.2371160058
+赋格 11.5027823792
+左梦梅 11.0674643079
+马尾黄连 13.900677652
+文盲 9.59661255877
+淫猥 13.2075304714
+王恒 11.7034530746
+硬衬 13.2075304714
+拖时间 12.2912397395
+裂体生殖 13.2075304714
+胶结 10.1394775363
+看热闹 8.73019365694
+六盘 13.900677652
+四五万元 13.2075304714
+近三成 10.4349417492
+师范学院 9.44633035572
+居全洲 13.900677652
+售前 11.1280889297
+酒泉卫星发射中心 13.2075304714
+塔努斯 12.5143832909
+数字电视 10.1164880181
+印度理工学院 13.2075304714
+下不来台 11.4157710022
+母鱼 11.9547675029
+辽宁人 13.2075304714
+惠能 11.8212361103
+亚足联 11.7034530746
+装药 8.93783302172
+动态数据 11.8212361103
+闲地 12.1089181827
+纸牌 10.4349417492
+瓦尔蒙 13.2075304714
+茱萸 11.4157710022
+宋哲宗 10.2630914922
+挫骨扬灰 13.900677652
+宇宙速度 11.8212361103
+铁拐李 12.8020653633
+淀区 13.2075304714
+苏布台 13.2075304714
+于邺郡 11.9547675029
+止血敏 13.900677652
+鱼胶 11.9547675029
+钠离子 10.4349417492
+榆林地区 12.2912397395
+祖师庙 12.8020653633
+移山倒海 12.2912397395
+一等功 11.2616203224
+货源充足 12.2912397395
+一男二女 12.2912397395
+彩画 10.1164880181
+科苏特 12.1089181827
+到会者 13.2075304714
+低产田 12.2912397395
+糖精钠 11.4157710022
+青年期 11.7034530746
+开化党 13.2075304714
+母鲸 12.8020653633
+不乏先例 12.5143832909
+抵命 12.1089181827
+孕期 9.10488710638
+空包 12.8020653633
+八十度 13.900677652
+文白 11.598092559
+文登 11.3357282945
+看顾 10.765183436
+南增厚 13.2075304714
+协作 8.25170341381
+唐孔颖 11.7034530746
+监事 9.0884932966
+西引荆 13.2075304714
+管铁笛 12.8020653633
+硅橡胶 10.8096351986
+广而告之 11.9547675029
+固位 12.5143832909
+万利达 13.2075304714
+轮作制 10.9562386728
+劳林 12.2912397395
+计较 8.01735526349
+一氯甲烷 13.900677652
+丁税 10.8096351986
+现代版 11.598092559
+存取数据 12.5143832909
+闻知 9.03314320152
+逆天者亡 13.900677652
+取息 11.598092559
+上缴国库 11.7034530746
+皆曰 10.8561552143
+榆林港 11.8212361103
+十一个月 11.8212361103
+齐扬 13.900677652
+拜恩州 13.900677652
+鱼肝 13.2075304714
+鱼肚 10.9562386728
+诱使 9.85762638414
+变来 11.7034530746
+头灯 11.1280889297
+番杏 13.900677652
+联合国安理会 10.1394775363
+备而不用 12.1089181827
+中山站 11.3357282945
+宋江恰 13.2075304714
+急救包 11.4157710022
+鱼肉 9.25628675283
+逼上梁山 10.7226238216
+鱼腰 13.900677652
+外销量 12.2912397395
+严于律己 11.9547675029
+鱼腹 11.2616203224
+王总 11.1926274509
+皱胃 12.1089181827
+交换机 10.765183436
+翻两番 10.7226238216
+师范 9.13850371718
+黑胶 13.2075304714
+知书识礼 12.2912397395
+变暖 8.47572763449
+变暗 11.1280889297
+鱼腩 12.5143832909
+遍历 10.9562386728
+文石 11.7034530746
+财产性 10.5684731418
+纠风 12.2912397395
+屈折语 13.900677652
+黄河三角洲 7.70219893548
+第戎 11.7034530746
+装船 9.94943393339
+生产业 12.2912397395
+监理部 13.900677652
+中印关系 12.2912397395
+一张一弛 12.5143832909
+财源茂盛 12.2912397395
+突突突 11.9547675029
+谨愿 13.900677652
+助残 12.2912397395
+壮威 13.900677652
+时尚性 13.2075304714
+科尔特 12.5143832909
+选矿 9.85762638414
+常备军 9.6811699468
+生死考验 12.2912397395
+南沟村 13.2075304714
+无缝钢管厂 12.8020653633
+售卖 10.3453295905
+祥光 9.85762638414
+落地雷 12.8020653633
+十八盘 11.7034530746
+性冷淡 11.598092559
+小山羊 13.2075304714
+图像匹配 13.900677652
+凉棚 11.2616203224
+奥蒂 13.2075304714
+清晰化 12.8020653633
+炎黄子孙 11.4157710022
+心理声学 12.8020653633
+阴极射线管 11.1280889297
+翁虹 10.3743171274
+脚架 10.8561552143
+固体 7.30080715276
+变更 6.75627047165
+一年生 8.91707103027
+光合作用 8.78268383956
+五十多万 13.900677652
+丁等 13.900677652
+澄清 8.09554268306
+诸葛子瑜 12.8020653633
+改换法 13.2075304714
+金银财富 12.8020653633
+大间 12.2912397395
+古德里奇 12.5143832909
+变星 9.61021821083
+真行 10.9049453784
+斯卡帕湾 12.5143832909
+变易 10.3453295905
+织田家 13.900677652
+野战部队 10.9049453784
+住宅小区 11.1280889297
+六七十步 13.2075304714
+沙燕儿 12.2912397395
+施佩 12.8020653633
+西魏相 13.2075304714
+玻璃丝 12.5143832909
+包头钢铁公司 11.598092559
+服装出口 11.5027823792
+敷衍了事 11.5027823792
+森彼得 13.2075304714
+生产井 11.8212361103
+中重度 12.1089181827
+刘光国 11.4157710022
+硬要 9.58318953844
+节拍 9.58318953844
+格尔木 10.0720362555
+浦西 11.1280889297
+一批批 10.2630914922
+多一半 12.1089181827
+几部戏 13.2075304714
+人员配备 11.1926274509
+热得快 12.8020653633
+诱之 11.5027823792
+八百二十部 13.2075304714
+破除 9.58318953844
+金银财宝 9.65218240993
+监修 11.2616203224
+脚本 7.00905175492
+明后 9.65218240993
+常以东 13.2075304714
+印经院 13.2075304714
+五则 12.2912397395
+竹签子 13.2075304714
+省港 11.4157710022
+领导人 6.6614626782
+归属于 8.26946587015
+集中控制 11.3357282945
+易破碎 13.2075304714
+变晴 13.900677652
+大力发展 7.85567233794
+大行其道 10.1630080337
+曾惠敏 12.8020653633
+眼影粉 12.5143832909
+售后 9.66657114738
+鱼虾 9.12155415886
+乘兴而来 12.8020653633
+东长安街 11.598092559
+万灵药 12.8020653633
+除渣 13.2075304714
+像样儿 13.2075304714
+平昔 12.1089181827
+相濡以沫 11.2616203224
+史天天 13.2075304714
+今年过年 12.2912397395
+目录 7.30489713801
+奥菲 11.9547675029
+庞特 11.8212361103
+从今 9.91169360541
+十二员 12.2912397395
+学术活动 10.533381822
+最南端 9.91169360541
+一千一百万 13.2075304714
+大南 13.900677652
+步达生 12.5143832909
+头皮 8.81308131674
+名教授 12.1089181827
+多彩的 11.0674643079
+不动点 11.2616203224
+抽风 11.0103058941
+缉查 11.9547675029
+物伤其类 11.4157710022
+内查外调 13.2075304714
+竹园 10.9049453784
+财产权 9.7898037878
+牌照税 13.900677652
+奥莫 12.5143832909
+莲花山 10.3171587135
+头盖 11.2616203224
+母马 10.8096351986
+头盔 8.40350942668
+别针 11.7034530746
+于羽郊 13.900677652
+周亚夫 10.2371160058
+除湿 10.3743171274
+东流贯 11.9547675029
+朱友麟 13.900677652
+塘坝 11.0103058941
+安装包 12.8020653633
+王聪儿 12.8020653633
+百十粒 13.900677652
+芦沟桥 12.5143832909
+受赠者 13.2075304714
+文炳 11.8212361103
+己内酰胺 10.9049453784
+钢球 11.4157710022
+裹好 11.5027823792
+丁粮 11.2616203224
+头目 7.45337178943
+节数 11.8212361103
+五刀 13.900677652
+从云 12.5143832909
+坨子 11.1926274509
+四百艘 13.2075304714
+尤氏 9.08039608637
+中条山 9.84023464143
+鑫茂 11.9547675029
+国社党 11.7034530746
+发电设备 9.61021821083
+单门独户 12.8020653633
+宗天复 13.2075304714
+霍普 11.9547675029
+度假村 10.4994802703
+从书 12.5143832909
+福如 13.900677652
+阿律奴 13.2075304714
+武纪 12.5143832909
+僧格林沁 11.3357282945
+建设路 9.84023464143
+咽喉炎 11.0674643079
+战斗意志 11.0674643079
+四百三十三公里 13.2075304714
+壮工 13.900677652
+私淑弟子 12.8020653633
+园林工程 12.8020653633
+数员 11.4157710022
+大体说来 11.7034530746
+公式化 10.9562386728
+南斯拉夫联盟共和国 11.2616203224
+财政资金 9.31571017331
+马齿苋 10.765183436
+宋理宗 10.5684731418
+文火 10.4666904475
+宝紫 12.8020653633
+龙港 12.5143832909
+利升 13.2075304714
+从中 6.95948759691
+莲花峰 10.604840786
+腿酸 12.1089181827
+吸牢 13.900677652
+结起 12.1089181827
+环氧树脂 10.9049453784
+索秀丽 13.2075304714
+从严 9.00283785202
+自然法 10.3171587135
+累退 13.2075304714
+贴饼子 12.8020653633
+小姓 13.900677652
+从丽 13.900677652
+马蔚华 10.2630914922
+濒于绝境 13.2075304714
+皆惊 10.7226238216
+岭上 9.91169360541
+刑律 10.6818018271
+节日 7.59257921047
+从上 11.5027823792
+从下 10.604840786
+从不 7.60356833204
+变慢 10.533381822
+抵制 7.95003509939
+抵到 13.2075304714
+行政法学 12.2912397395
+柯兹洛 13.2075304714
+唐会昌 11.598092559
+节时 11.5027823792
+分洪闸 12.5143832909
+李大公子 12.8020653633
+链终止 12.2912397395
+黄宗宪 13.900677652
+氢氧化锌 13.900677652
+零零落落 11.3357282945
+头癣 12.8020653633
+大特写 13.2075304714
+自个儿 8.4980002701
+产业界 10.9049453784
+姜维之 12.2912397395
+雷布查 12.5143832909
+二十一座 13.2075304714
+攻击型 9.84023464143
+太平洋战争 9.25628675283
+不顺服 13.900677652
+挺到 13.900677652
+楚祖 13.2075304714
+和宜兰 12.5143832909
+西寨 11.3357282945
+别问 11.0674643079
+蛇纹岩 11.2616203224
+比薇薇 13.2075304714
+强强联合 10.9562386728
+别闹 10.765183436
+结婚网 13.900677652
+玛依力 12.1089181827
+赵林 11.9547675029
+从俗 12.8020653633
+东南亚国 13.900677652
+助教 9.37888907493
+格林格 13.2075304714
+劳思 13.2075304714
+勤苦 11.598092559
+同谋者 11.7034530746
+岳维山 9.98865464655
+生而知之 12.1089181827
+受骗 10.4041700905
+豪情满怀 13.2075304714
+委曲求全 10.6818018271
+马鹿 10.0505300503
+许多遍 11.9547675029
+天宝末 11.4157710022
+自由行动 11.3357282945
+海中跃 13.900677652
+同步机 13.900677652
+全国人大法律委员会 12.8020653633
+军队干部 12.2912397395
+李岗村 13.2075304714
+雷布林 13.2075304714
+浑如 10.7226238216
+养草 12.8020653633
+小国 8.74162235276
+猪毛菜 11.5027823792
+大锤 10.9562386728
+中国同盟会 10.2630914922
+弗莱迪 12.5143832909
+亿多美元 10.8561552143
+扬声器 9.94943393339
+伤害性 12.2912397395
+见神见鬼 12.2912397395
+西部片 11.8212361103
+减债 12.8020653633
+浆染 11.4157710022
+卡曼卡雷 13.900677652
+变态 8.55834340001
+国有制 12.1089181827
+蜂蜜 8.4284069783
+各式各样 9.01032852375
+机要员 11.0103058941
+氮源 13.2075304714
+余宽休 13.900677652
+氰氨化钙 12.8020653633
+激动不已 10.533381822
+肺纤维化 13.900677652
+囹圄 11.1280889297
+耶律乙辛 11.598092559
+红蓝宝石 12.8020653633
+点击率 10.4349417492
+华北油田 12.1089181827
+商业贸易 9.29550746599
+组件 9.37888907493
+国天惠 11.2616203224
+成柔田 13.2075304714
+从何 10.2897597393
+孔蒂奇 13.900677652
+兰德拉 13.900677652
+神僧孙 12.2912397395
+文焕 12.8020653633
+赠物 13.900677652
+节操 11.0674643079
+浆果 8.89673134603
+德吾弟 13.900677652
+科尔瓦 13.900677652
+报告稿 13.900677652
+卡里亚 12.1089181827
+礼品盒 11.9547675029
+英语课程 13.2075304714
+火龙果 13.2075304714
+宝籍 12.8020653633
+塔吉雅 13.900677652
+编译程序 10.642581114
+私有权 10.9562386728
+蜂蜡 10.642581114
+操兵 10.8561552143
+油当量 11.5027823792
+骤风急雨 13.900677652
+六十六家 13.2075304714
+飕飕 10.8561552143
+未敢苟同 13.2075304714
+清崇德 11.598092559
+从优 10.8096351986
+软性 10.6818018271
+布拉灰 12.5143832909
+组人 12.5143832909
+名扬中外 12.1089181827
+张广勇 12.8020653633
+苗语支 12.2912397395
+许多部 12.2912397395
+半封建社会 10.1630080337
+从众 10.9562386728
+关津制 13.900677652
+爆炒 7.32699748502
+劳损 10.3743171274
+别集 10.2117981979
+符召 13.2075304714
+高考状元 11.9547675029
+刘光华 11.7034530746
+房炼成 13.2075304714
+文革时期 12.5143832909
+三四十处 13.900677652
+舒舒诺 13.2075304714
+关帝庙 9.46986085313
+荣成县 12.2912397395
+康乾 11.5027823792
+迪伦 12.2912397395
+节期 11.9547675029
+心怀疑忌 13.900677652
+烟花巷 13.900677652
+伏水 13.900677652
+雷介公 12.5143832909
+首席代表 10.4666904475
+节本 11.9547675029
+雅驯 13.900677652
+退税率 10.7226238216
+概不负责 12.5143832909
+御窑 11.9547675029
+人事室 12.5143832909
+别雷 13.2075304714
+玉女煎 13.2075304714
+康乐 10.8561552143
+小四 13.900677652
+痛哭失声 10.8561552143
+撬着 13.900677652
+适应能力 9.36807815882
+少之又少 10.8096351986
+亚胺 11.2616203224
+吸热 10.3743171274
+不在此限 12.2912397395
+游移湖 12.2912397395
+十八班 12.8020653633
+动身前往 11.8212361103
+拥抱着 10.9562386728
+调资 13.900677652
+五百位 13.900677652
+遣送出境 13.900677652
+纳款 12.8020653633
+低效率 11.1926274509
+康丁 13.2075304714
+交换所 11.8212361103
+马儿罕 13.900677652
+宇治 12.8020653633
+普通群众 11.5027823792
+丁纳 13.2075304714
+朱文公 12.8020653633
+孙耀祖 12.5143832909
+吸烟 8.28390655431
+低速 8.78268383956
+丁纹 12.2912397395
+抽验 13.2075304714
+韦斯普 12.8020653633
+检查教学 13.900677652
+八元 11.5027823792
+文牒 10.4666904475
+阿富汗 7.68008748188
+壮心 13.2075304714
+斋饭 10.2371160058
+咬紧牙根 13.900677652
+莲花座 11.9547675029
+鹿苑 11.8212361103
+尽忠报国 10.642581114
+文牍 10.3743171274
+仙人掌 9.91169360541
+只管 7.13448593732
+壮志 10.3743171274
+阿莱奇 13.900677652
+别院 11.5027823792
+抵偿 10.4666904475
+青岛队 11.9547675029
+陌生化 13.2075304714
+汝才哥 12.2912397395
+翁莫 13.900677652
+政治思潮 11.1926274509
+文特 12.2912397395
+八克 13.2075304714
+病灾 12.2912397395
+田有露 13.2075304714
+寿大典 13.900677652
+瑞士联邦 11.1926274509
+受饿 12.8020653633
+于孟津 12.8020653633
+快活林 11.3357282945
+怆然涕下 13.900677652
+母题 12.2912397395
+文物 7.42216800977
+治家格言 13.2075304714
+宝网 13.900677652
+破门 10.3171587135
+过府冲州 13.900677652
+河西走廊 8.56313957227
+分崩离析 10.1164880181
+阿莱夫 13.900677652
+移向 9.66657114738
+报关员 12.1089181827
+增添光彩 13.900677652
+五六步 12.1089181827
+挺出 12.5143832909
+德意志民主共和国 11.0103058941
+地质学家 8.89004235788
+天朝 9.74179456862
+挺凶 12.1089181827
+戴着 8.20023407859
+智深见 11.7034530746
+落到实处 9.5186510173
+于全邦 12.8020653633
+祁剧 12.2912397395
+抵债 10.2630914922
+变换 7.64492761022
+道德哲学 11.7034530746
+樟木箱 11.3357282945
+座谈会 8.48457724977
+鲍尔森 12.5143832909
+除法 10.5684731418
+蛊惑人心 10.4994802703
+副热带 9.71102290995
+铁电性 12.8020653633
+世召 13.2075304714
+稀盐酸 10.765183436
+唐五代 10.4349417492
+大众交通 9.31571017331
+班图人 10.4666904475
+康佳 10.0720362555
+半导体器件 10.2630914922
+外界影响 10.8096351986
+文珍 10.1394775363
+废电池 12.8020653633
+氮气 9.84023464143
+行为规范 10.3171587135
+青年报 10.3743171274
+头疼 8.5488195185
+挥师 9.93038573842
+头孢类 13.900677652
+乐呵 13.900677652
+王敬驻 13.2075304714
+拍下 9.94943393339
+鹤顶红 12.5143832909
+硬起 11.9547675029
+康体 12.2912397395
+运动定律 10.5684731418
+文班 13.2075304714
+壮年 10.1164880181
+祁县 10.604840786
+中盘股 10.8096351986
+脚掌 10.1164880181
+受领 11.0674643079
+奥肯 13.2075304714
+头痛 7.88696249593
+视觉记忆 13.2075304714
+霍斯 11.7034530746
+漂泊者 12.2912397395
+苍颉篇 13.2075304714
+产业省 11.9547675029
+琳琅 11.8212361103
+金钟奖 13.900677652
+十国集团 9.14708746087
+爆燃 11.9547675029
+中外比 13.900677652
+国民素质 12.8020653633
+纳比 11.8212361103
+文王 9.58318953844
+抗张强度 12.8020653633
+文玉 13.2075304714
+浦路 11.598092559
+热应力 11.7034530746
+虚掷 12.2912397395
+仲长统 12.2912397395
+典卖 11.4157710022
+瞌睡虫 11.598092559
+猴皮筋儿 13.2075304714
+革命队伍 10.2117981979
+迪乌 12.2912397395
+十八般武艺 10.8561552143
+土耳其共和国 11.0674643079
+稍感不适 13.900677652
+赭黄色 13.2075304714
+身无寸铁 13.900677652
+首师大 13.900677652
+惊慌失措 9.01032852375
+文玩 12.1089181827
+润燥 10.0940151622
+头生 11.4157710022
+坦普尔 12.2912397395
+四驱车 11.3357282945
+恩斯特 10.1871055853
+隆中对 12.2912397395
+浦贺 12.5143832909
+姜伯驹 12.5143832909
+衍生物 8.70218062071
+关帝开 13.2075304714
+抵免 13.2075304714
+劳拉 11.598092559
+遍地 8.49350588052
+限幅器 13.900677652
+抵充 11.9547675029
+变成 5.72428605534
+树洞 9.06439574502
+山丹县 12.5143832909
+追涨杀跌 10.2630914922
+封建社会 7.94484028251
+捆起来 10.0940151622
+薄纱罗 13.2075304714
+神州 7.59440236503
+易维护性 12.5143832909
+社长 9.07236391467
+安仁县 13.900677652
+便携性 13.900677652
+吃力不讨好 11.8212361103
+御笔 9.61021821083
+加迪夫 13.900677652
+五号 10.9049453784
+周铎 12.2912397395
+康保 11.9547675029
+重提 9.91169360541
+孟离己 11.1280889297
+加禄语 11.8212361103
+康侯 12.5143832909
+浆料 11.5027823792
+索状伸 13.2075304714
+心坐标 12.2912397395
+小别墅 13.2075304714
+华伦 11.1280889297
+三十多封 13.2075304714
+方许换 13.2075304714
+干扰 7.31865251308
+奥西里斯 11.2616203224
+戴白 11.8212361103
+田间管理 11.3357282945
+识途老马 13.2075304714
+挑走 13.2075304714
+酷极了 13.900677652
+增光添彩 12.1089181827
+石似玉 13.2075304714
+不战 8.84443184663
+和赛虎 11.8212361103
+别露 13.2075304714
+卢维伦 13.900677652
+文献 7.23117956212
+布拉特 12.2912397395
+苦行者 11.7034530746
+编者注 10.604840786
+于玄德 12.8020653633
+租去 13.900677652
+康健 10.8561552143
+语序 11.7034530746
+右下方 11.7034530746
+自坏长城 12.8020653633
+光通量 11.5027823792
+端木蕻良 13.2075304714
+龙胆二糖 13.900677652
+瞎眼 10.533381822
+邦达 13.2075304714
+罂粟科 11.8212361103
+监听 10.0940151622
+西迂洞 12.5143832909
+城镇化率 11.4157710022
+麦吊杉 12.2912397395
+五句 11.7034530746
+老鼠屎 11.598092559
+文泰 11.0674643079
+叠压 10.3743171274
+赠与税 11.8212361103
+三十二路 13.2075304714
+隐潭 12.8020653633
+青年干部 11.598092559
+套住 10.2371160058
+千金方 11.5027823792
+到达场 13.900677652
+文波 13.900677652
+吸溜 11.5027823792
+节礼 12.2912397395
+更长 8.45394028031
+倒屣相迎 13.2075304714
+呵欠 10.4349417492
+水夫 11.598092559
+从动 11.598092559
+违法行为 8.44109213783
+叠叠 12.5143832909
+冠状病毒 12.2912397395
+兴奋剂 9.96885201925
+雷演祚 9.65218240993
+叠句 13.2075304714
+剩余物 11.8212361103
+迪兰 13.2075304714
+人机系统 12.8020653633
+外汇宝 11.9547675029
+考期 13.900677652
+情深意重 12.5143832909
+敲金戛玉 13.900677652
+追人 13.2075304714
+只敢 10.642581114
+白色体 13.900677652
+马拉梅 11.598092559
+神秘性 11.5027823792
+挺住 10.4666904475
+邱宝昌 12.1089181827
+心平气和 10.1630080337
+孤儿 8.68574189437
+诸皇亲 13.2075304714
+侍役 11.7034530746
+生产商 8.32472854883
+文治 10.6818018271
+洗发剂 13.900677652
+抵京 10.9562386728
+八路军第一一五师 13.900677652
+劳累 8.5488195185
+操军 10.8096351986
+迪克 11.0674643079
+共产主义 7.89432449237
+赖世雄 13.900677652
+装饰 7.13910488317
+康僧 13.2075304714
+父执辈 12.8020653633
+廖内 12.8020653633
+做牛做马 11.8212361103
+调货 13.900677652
+降贵纡尊 12.2912397395
+夙缘 13.2075304714
+省界 11.598092559
+开灯 10.0294766411
+文汇 11.8212361103
+希奇 10.4041700905
+双桅船 12.8020653633
+五发 12.2912397395
+摄像 10.3743171274
+邵力子 12.5143832909
+特别之处 10.604840786
+套作 11.1926274509
+省略 9.85762638414
+从前 6.90674467675
+雷内克 12.8020653633
+巴斯蒂安 12.5143832909
+吠声 12.1089181827
+变紧 11.9547675029
+倘若 6.54057367899
+五反 11.9547675029
+十二下 13.900677652
+吴几康 13.2075304714
+文气 10.9562386728
+神差 13.900677652
+长幼慈 13.900677652
+张寄谦 12.5143832909
+步军统领 11.0103058941
+大个子 8.77077893705
+扩大会 11.598092559
+叠印 12.5143832909
+商务谈判 12.2912397395
+师风 12.5143832909
+吸湿 11.0103058941
+回城 9.05649056552
+抵上 11.9547675029
+从到 11.8212361103
+巴陵郡 12.1089181827
+任克拉克 13.2075304714
+拍击 10.1871055853
+拍出 10.0088573539
+向慧剑 13.2075304714
+文水 11.7034530746
+热火朝天 9.91169360541
+薯莨 12.8020653633
+省用 13.900677652
+轰鸣声 10.2117981979
+唐伯英 12.5143832909
+雷声大作 12.8020653633
+报告期 9.96885201925
+住进 8.97342396682
+讲文明 13.2075304714
+布鲁斯南 13.900677652
+许多路 11.7034530746
+银木荷 12.1089181827
+黎亭 13.2075304714
+布拉沃 11.2616203224
+叠加 8.64318227995
+吴兴县 12.1089181827
+刘骜 11.3357282945
+至亲好友 11.7034530746
+大闹天宫 9.94943393339
+银黑狐 13.900677652
+康公 12.5143832909
+从句 13.900677652
+财产税 11.1926274509
+推理方法 12.2912397395
+挺举 11.8212361103
+阎书勤 12.8020653633
+凯美瑞 9.87532596124
+骐骥 12.5143832909
+衍传 13.900677652
+仙子 9.93038573842
+变粗 10.9049453784
+宛服 13.2075304714
+巴克夏猪 13.2075304714
+康兄 13.2075304714
+招进去 13.900677652
+高怡生 12.8020653633
+雨前茶 13.2075304714
+刺猬皮 12.8020653633
+回嘴 11.2616203224
+呼天唤地 13.900677652
+瓜葛 9.69598503258
+手机带 13.900677652
+临着 11.7034530746
+从属性 11.9547675029
+毅然 8.81308131674
+那尔迈 13.900677652
+康党 11.9547675029
+究竟 5.97119112866
+敬而远之 10.2117981979
+组分 8.31718134319
+御旨 11.4157710022
+特克尔 13.900677652
+文涛 12.2912397395
+贝加莫 13.2075304714
+雄威 11.5027823792
+一下顿 13.900677652
+早知今日 11.7034530746
+接济 9.24671730182
+旱生植物 11.9547675029
+错到 13.900677652
+李文和 13.900677652
+发展部 10.604840786
+神秘感 10.6818018271
+连敖 13.900677652
+盖浇饭 13.2075304714
+组别 12.2912397395
+退一步 10.1394775363
+只说不做 12.8020653633
+热尼亚 13.900677652
+二十四斤 12.8020653633
+世俗化 10.765183436
+光顾 9.07236391467
+子亚科 13.2075304714
+闻汝 13.2075304714
+刘斯奋 13.900677652
+歌舞厅 11.4157710022
+多解 12.8020653633
+均衡 7.28060444545
+博极群书 13.2075304714
+不整洁 13.2075304714
+铁木儿 12.2912397395
+望岳 12.8020653633
+孟州城 11.9547675029
+手机店 13.2075304714
+毫不介意 11.8212361103
+康凯 13.900677652
+小馒头 13.2075304714
+天峰岭 13.2075304714
+贪财好色 13.900677652
+南川河 11.5027823792
+抵住 10.1164880181
+香火不断 13.900677652
+履带式 8.96620371885
+海志强 10.2117981979
+临床实验 11.7034530746
+世博 8.65893063692
+低迷 7.33682212544
+文海 11.0103058941
+垮下来 11.7034530746
+齐天圣 12.2912397395
+张引生 11.9547675029
+修老尼 13.2075304714
+弯子 10.1871055853
+白附子 12.1089181827
+吸潮 12.2912397395
+回回 9.0884932966
+文铭文 13.2075304714
+遮天盖地 11.5027823792
+吉人天相 13.900677652
+淫棍 11.9547675029
+语录 9.15574552361
+正直无私 13.900677652
+从医 11.2616203224
+均裂 12.2912397395
+女骗子 13.900677652
+福临笑 10.2630914922
+中介机构 8.68574189437
+办事不牢 13.900677652
+替身演员 13.900677652
+施乐 13.2075304714
+仙宫 11.0674643079
+回国 6.73905564904
+与众不同 8.64318227995
+语形 13.900677652
+安置工作 11.4157710022
+马龙派 12.1089181827
+仙客 13.2075304714
+镜子 8.07173203437
+御敌 9.87532596124
+常绿林 11.1926274509
+塞入 10.642581114
+洪池岭 13.900677652
+坐山观虎斗 11.1280889297
+威宁县 11.8212361103
+文洪 10.642581114
+从化 11.0103058941
+仙家 10.642581114
+柳家媳妇 12.5143832909
+卡里克 13.900677652
+斋藤 12.5143832909
+银行债券 11.5027823792
+沟帮子 12.2912397395
+中欧地区 12.8020653633
+昭著 12.2912397395
+浦那 11.3357282945
+组党 12.8020653633
+廖化 10.0505300503
+缉私 10.7226238216
+杭保尔 12.8020653633
+含水分 11.1926274509
+煤末 13.900677652
+雷列耶 12.5143832909
+加泰罗尼亚地区 13.2075304714
+黄蒙蒙 13.900677652
+任护法 11.9547675029
+迪化 11.1280889297
+仔细检查 10.6818018271
+家庭影院 13.900677652
+中近东 12.1089181827
+格鲁森 13.2075304714
+伤害罪 12.2912397395
+只有 4.36731219528
+惧高 12.5143832909
+贫农 9.34680076038
+浆硬 13.2075304714
+方均根 12.5143832909
+攻无不克 11.9547675029
+成长 6.10092433369
+高级中学 11.4157710022
+周海滨 12.8020653633
+花粉囊 13.2075304714
+单型科 12.8020653633
+昔阳 12.2912397395
+科尔武 13.900677652
+浦郡 13.900677652
+变翘 13.900677652
+庞氏 10.8561552143
+叠出 12.2912397395
+五十八年 11.0674643079
+任平生 13.2075304714
+同温 13.900677652
+低谷 8.21709788464
+正电荷 9.91169360541
+吴元济 10.8096351986
+开点 12.2912397395
+进完 13.900677652
+雄大 13.900677652
+何承天 12.2912397395
+低调 8.4980002701
+郭富城 11.5027823792
+宋瑞 12.2912397395
+自然物 10.4666904475
+拍卖 7.61281909181
+硬逼 10.8561552143
+应持 11.4157710022
+盛国庆 12.1089181827
+浓抹 13.900677652
+塔哈维 13.2075304714
+任科伦 13.2075304714
+香积厨 11.9547675029
+吸氧 10.4666904475
+桑乾水 13.2075304714
+众所瞩目 12.5143832909
+东营市 11.598092559
+纳尔德 13.2075304714
+杜尔玛 13.2075304714
+头标 13.900677652
+祁东 12.8020653633
+广播电视局 11.9547675029
+楼墨师 11.0674643079
+零售商 8.92394390956
+省督 11.8212361103
+郑晓京 8.50251495046
+生产型 9.54396882529
+安然无恙 10.2117981979
+均设 11.9547675029
+程控电话 10.9562386728
+惠率军 13.2075304714
+雄姿 10.5684731418
+一字不差 10.8096351986
+二百余里 12.1089181827
+倘能 9.71102290995
+迪厄 13.2075304714
+迪厅 12.8020653633
+明太子 12.5143832909
+语尾 13.2075304714
+披发入山 12.8020653633
+吸气 9.31571017331
+省省 12.2912397395
+落草为寇 12.2912397395
+百十户 12.8020653633
+仙境 9.5186510173
+监国 9.63799777493
+色衰 13.900677652
+腿软 10.4041700905
+辩护书 13.2075304714
+从债 12.8020653633
+青年网 13.2075304714
+必然结果 9.80633308975
+迪古 11.9547675029
+沙僧辞 13.2075304714
+亲电取代 10.8096351986
+机绣 13.900677652
+惠顾 11.8212361103
+文渊 11.2616203224
+汪校长 11.9547675029
+齐克尔 12.8020653633
+马湖江 13.2075304714
+普利司通 11.8212361103
+二是二 12.5143832909
+拍发 12.2912397395
+保卫局 11.598092559
+王朝夏 13.2075304714
+中药厂 12.5143832909
+吸汗 12.5143832909
+钻心虫 13.900677652
+肇事车 11.0103058941
+曲意奉 13.900677652
+鱼饵 11.0674643079
+女人帮 13.900677652
+地仙城 12.8020653633
+陌生人 8.77077893705
+回向 11.598092559
+飙升 7.68606955355
+索元礼 12.5143832909
+别译 12.8020653633
+只是 4.3715926821
+累进 10.4666904475
+拍到 10.6818018271
+山大玉 13.900677652
+勃然变色 11.1280889297
+誉满全国 13.900677652
+辛德赫 13.2075304714
+基本资料 11.0103058941
+番红 13.900677652
+正言厉色 11.8212361103
+益气固 12.1089181827
+变红 10.533381822
+宝押 12.5143832909
+占陆军 12.8020653633
+遮住 8.41588071849
+康南 13.2075304714
+闲书 10.9562386728
+左顺门 10.4994802703
+省直 9.66657114738
+别说 7.41451686303
+郑国鸿 12.8020653633
+仙女 9.06439574502
+惠香 9.12155415886
+康博 13.900677652
+低质 12.8020653633
+青年组 13.2075304714
+裕固族 11.0103058941
+久旱不雨 12.5143832909
+文澜 11.0103058941
+变细 10.3743171274
+走为上策 11.5027823792
+谢克尔 13.2075304714
+回告 11.8212361103
+透露消息 11.598092559
+眉高眼低 13.900677652
+刘光世 9.87532596124
+下颌体 13.900677652
+低贱 10.2897597393
+勉勉强强 11.0674643079
+光复会 10.3743171274
+旅游区 9.12999302751
+红色高棉 12.8020653633
+平白 10.3743171274
+毕飞宇 12.5143832909
+生宣 13.900677652
+别让 12.8020653633
+回味 9.36807815882
+奥鲁 11.5027823792
+德洁 11.598092559
+诱因 9.00283785202
+从军 8.85725253506
+变绿 11.1280889297
+交换网 12.5143832909
+别论 11.5027823792
+移出来 13.900677652
+浦里 12.1089181827
+补养品 13.900677652
+冲犯 11.7034530746
+闸北区 13.2075304714
+宝成 10.8096351986
+多万人次 11.2616203224
+大厦将倾 11.8212361103
+专制政治 11.1280889297
+乙酸酐 11.1926274509
+计耶 12.8020653633
+拍动 12.5143832909
+引导员 13.900677652
+云淡风轻 12.1089181827
+仙姑 10.8561552143
+多一分 11.0674643079
+气室 11.3357282945
+关窗户 12.8020653633
+雄壮 9.28555713513
+遮体 11.9547675029
+口腔科 11.5027823792
+亚运 9.91169360541
+蒙众兄弟 13.2075304714
+从兄 11.5027823792
+秋老虎 12.5143832909
+巡航速度 9.74179456862
+阳婆 13.2075304714
+头脑清醒 10.4041700905
+劳绩 11.4157710022
+康叔 11.598092559
+乙酸酯 11.7034530746
+母树林 12.2912397395
+希勒 12.5143832909
+失魂丧魄 12.8020653633
+温国公 12.8020653633
+笑面虎 11.2616203224
+笔头儿 13.900677652
+招商局 9.44633035572
+错动 10.9049453784
+燕国复 12.8020653633
+过山车 9.23723855786
+载波通信 11.598092559
+吸收光谱 10.7226238216
+五六百 10.3743171274
+羽衣曲 13.900677652
+生产国 9.12999302751
+中峰 11.7034530746
+多复变 11.4157710022
+一九三六年 11.4157710022
+回响 9.32596667347
+北高加索军区 12.5143832909
+洋浦港 12.1089181827
+康县 11.8212361103
+迁移扩散 12.5143832909
+癌胚抗原 12.2912397395
+母弱弟 13.900677652
+闲事 10.0505300503
+五卅 12.1089181827
+邳州市 12.5143832909
+包河 13.2075304714
+迪勒 13.900677652
+金嗓子 11.8212361103
+六神无主 10.2117981979
+眼线笔 12.5143832909
+满载而归 11.1280889297
+受落 12.5143832909
+要不得 10.3743171274
+好嗓子 11.8212361103
+代碎叶 12.2912397395
+律师协会 11.9547675029
+只愿 10.1164880181
+劳神 10.3743171274
+番禺 8.92394390956
+节奏感 10.2371160058
+捐出 10.2630914922
+海康县 12.8020653633
+王衍荐 12.8020653633
+点对点 11.0674643079
+归属其 13.900677652
+反守为攻 12.2912397395
+母航 13.2075304714
+监外执行 11.598092559
+海菲棕 13.2075304714
+母舰 10.6818018271
+组块 13.900677652
+房子 6.31590457436
+喊下来 13.2075304714
+亚达 13.2075304714
+代谢性 10.3453295905
+母舅 10.8561552143
+闻立鹏 12.5143832909
+会议议程 12.2912397395
+龙火炼 13.2075304714
+挖过来 13.900677652
+厄尔巴岛 11.7034530746
+临界压力 12.1089181827
+瞎猜 10.7226238216
+胰蛋白酶 11.2616203224
+康呐 13.2075304714
+感人肺腑 11.9547675029
+文森 11.598092559
+委内瑞拉人 12.8020653633
+纳尔多 13.2075304714
+斋菜 13.2075304714
+仙师 11.9547675029
+替换法 13.900677652
+侯关云 13.2075304714
+一心向上 13.900677652
+变种 9.01032852375
+叔父 8.73589167805
+哈塔夫 13.2075304714
+回单 11.0103058941
+向钱看 12.8020653633
+粉化 12.8020653633
+唐伯虎 10.642581114
+鱼鸥 11.7034530746
+霍纳 11.0674643079
+马拉河 13.2075304714
+岂非 9.15574552361
+布里克 12.5143832909
+回升 5.76328182192
+高能物理 10.4666904475
+遂平县 11.2616203224
+汉刘歆 13.900677652
+农业气候 11.9547675029
+操之过急 10.1630080337
+蒙蒙细雨 13.2075304714
+诱出 12.8020653633
+世界屋脊 10.604840786
+康吉 12.2912397395
+宝日 13.900677652
+汉诸军 13.2075304714
+二回熟 12.2912397395
+游心影 13.2075304714
+足以 7.25169310195
+吸好 13.900677652
+水电局 11.8212361103
+追上 8.85082164473
+于孝公 13.2075304714
+钦差大臣 9.26594866375
+康哥 13.2075304714
+游过来 11.4157710022
+快上车 12.2912397395
+沙僧见 11.0674643079
+昭苏 11.1280889297
+利改税 12.1089181827
+卡里埃 12.8020653633
+袁同礼 12.8020653633
+水声 9.06439574502
+娑罗双树 13.2075304714
+回历 10.765183436
+文案 10.1871055853
+回去 5.94420085394
+海金沙 12.2912397395
+铁木哥 11.8212361103
+牟定县 13.900677652
+亭亭玉立 11.0674643079
+祖孝孙 13.2075304714
+小福王 13.2075304714
+贯穿性 12.5143832909
+败法乱纪 13.900677652
+文档 9.98865464655
+拉东坡 13.900677652
+吕之悦 9.61021821083
+阿蒂加斯 12.5143832909
+中兴新村 12.8020653633
+涿县 10.3743171274
+对换 11.9547675029
+易复 13.900677652
+子承钧 12.8020653633
+别谈 12.5143832909
+肖上唇 10.2117981979
+仙庄 12.2912397395
+袁祖亮 13.900677652
+口罩 8.9519177616
+现代汉 13.2075304714
+仙府 11.8212361103
+股骨头 11.9547675029
+对称张量 13.900677652
+雏燕 13.900677652
+朱绍文 12.5143832909
+浆纱 11.1926274509
+田之 13.2075304714
+防腐液 12.2912397395
+绘制地图 12.2912397395
+值得一提的是 7.89186446653
+氰戊菊酯 12.5143832909
+浆纸 13.900677652
+零陵路 13.2075304714
+乙酸乙酯 10.9049453784
+夜行衣 12.5143832909
+千余张 13.900677652
+诱入 12.2912397395
+帅标营 12.8020653633
+提名权 12.1089181827
+技术含量 9.27570483869
+鲜虞郡 13.900677652
+美国佬 10.8561552143
+马中箭 12.8020653633
+接受器 12.1089181827
+挂肚牵肠 13.900677652
+集气站 13.900677652
+万户侯 11.3357282945
+真寒假热 12.8020653633
+劳动阶级 11.7034530746
+季历之 12.1089181827
+不落人后 13.900677652
+精神病学 10.765183436
+粉剂 11.2616203224
+维护费用 11.3357282945
+受苦 8.59737274392
+那宝船 11.9547675029
+回到 5.38308454054
+只怕 6.97018288602
+三十八岁 11.7034530746
+萃取液 13.2075304714
+敲掉 10.8096351986
+红安县 11.9547675029
+抒怀 11.2616203224
+赵惠文 11.5027823792
+一千零七 13.2075304714
+节奏性 11.4157710022
+孟恩远 12.2912397395
+丁文 13.2075304714
+博太后 13.900677652
+倒也不是 10.8096351986
+乌伦古湖 11.2616203224
+杨德和 11.0674643079
+十八棵 12.2912397395
+驳回上诉 11.4157710022
+肾功能 8.4284069783
+百十斤 11.7034530746
+自然界 7.42678695562
+水滴形 12.2912397395
+官检校 13.2075304714
+留胡须 13.900677652
+别趣 13.2075304714
+吉隆坡 10.642581114
+粉刺 10.533381822
+空谷 11.0674643079
+遇到困难 10.4666904475
+第五十七回 12.2912397395
+只恐 9.12999302751
+粉刷 10.765183436
+钢箍 12.5143832909
+吸毒 9.7898037878
+吝啬 9.69598503258
+位极人臣 11.598092559
+三百匹 11.8212361103
+一个六十 13.900677652
+奥马 11.9547675029
+回力 12.5143832909
+百家衣 13.2075304714
+低语 10.3171587135
+电讯稿 13.2075304714
+虎背 13.2075304714
+隗瀛涛 13.2075304714
+戴氏 11.8212361103
+死於非命 13.2075304714
+马拉海 10.642581114
+接受国 11.9547675029
+阴司见 13.900677652
+咄咄怪事 11.598092559
+保万全 12.1089181827
+告密 9.93038573842
+现代派 9.77354326693
+自成一格 11.1280889297
+套近乎 10.765183436
+王承 12.1089181827
+监军 8.67493097826
+文楼 12.2912397395
+组团 9.43476953332
+丁敬 11.8212361103
+回动 13.900677652
+丁数 11.9547675029
+别走 10.9562386728
+别起 13.2075304714
+上灯 11.598092559
+科尔沁 10.3743171274
+益气健 11.5027823792
+样板间 11.9547675029
+布拉格 8.89004235788
+一百五十八支 13.2075304714
+习天台 13.900677652
+慢摇吧 13.900677652
+侯之孙 13.2075304714
+蓝镇培 13.900677652
+挠钩 11.598092559
+只想 8.46259834305
+于虎丘 12.5143832909
+翁法勒 13.2075304714
+劳碌 10.3171587135
+水电工 13.900677652
+朝鲜半岛 9.16447920358
+翁飞 12.5143832909
+山西大同 9.5186510173
+牙龈上皮 13.900677652
+拍品 11.8212361103
+变硬 9.96885201925
+手工艺品 9.14708746087
+早知如此 10.604840786
+质子号 13.900677652
+斋舍 12.1089181827
+鱼龙 9.80633308975
+抒情 8.30596627237
+营造业 13.900677652
+相蓝 11.7034530746
+月光族 11.5027823792
+滩头阵地 11.2616203224
+活该 9.35738286971
+丧家之犬 11.0674643079
+后项 13.900677652
+宝林 11.598092559
+博尔赫斯 12.1089181827
+虎势 13.900677652
+售与 12.8020653633
+监制 10.604840786
+一路货色 11.8212361103
+大洋河 12.2912397395
+仙居 11.9547675029
+安达曼 10.0294766411
+日趋严重 10.4349417492
+古训 10.2371160058
+水堰 13.900677652
+侦察员 9.94943393339
+生产区 10.604840786
+监利 10.9049453784
+惜福 12.5143832909
+从哲 13.900677652
+花纳锦 13.900677652
+杨雄 8.71889410168
+隐隐绰绰 13.900677652
+左旋多巴 12.8020653633
+纷繁复杂 10.4349417492
+头油 11.598092559
+遍于 11.1280889297
+马杜古 13.900677652
+巴列霍 12.8020653633
+引导出 12.5143832909
+心动图 10.8561552143
+枪兵 12.5143832909
+仙山 9.80633308975
+党纪处分 12.2912397395
+何处寻 12.2912397395
+诱发 8.15447446144
+条件收敛 13.900677652
+手机套 13.2075304714
+大兴安岭地区 11.0674643079
+抽芽 12.2912397395
+诱变 10.8096351986
+爆棚 11.1926274509
+脚窝 12.1089181827
+文檄 13.2075304714
+滔天 10.4041700905
+等量级 13.900677652
+决不待时 13.2075304714
+行医者 13.2075304714
+结连 10.4041700905
+惊魂落魄 13.2075304714
+宝柱 9.28555713513
+执笔者 12.8020653633
+皆空 10.765183436
+售书 12.8020653633
+慧生 13.2075304714
+杜铁环 13.900677652
+语声 9.87532596124
+商兼松 13.2075304714
+病情严重 10.6818018271
+乙酸钠 11.9547675029
+理工农 12.8020653633
+售予 11.8212361103
+旅游团 11.8212361103
+须尽欢 12.5143832909
+少田 12.8020653633
+冷若冰霜 10.765183436
+空军医院 13.2075304714
+季家庄 13.2075304714
+闻殿 13.2075304714
+莫要 9.23723855786
+希克 12.8020653633
+雄州 9.84023464143
+那竹梯 12.2912397395
+从命 10.0505300503
+母育 13.2075304714
+古运河 11.1926274509
+十八次 12.8020653633
+硬铝 12.8020653633
+女人家 10.4994802703
+宝月 13.2075304714
+鱼鳖 11.598092559
+响应速度 11.8212361103
+鱼鳔 12.5143832909
+唯有 8.06294720481
+鱼鳞 9.75754292558
+均达 10.2897597393
+回冲 13.2075304714
+康囊 11.5027823792
+生产厂 10.2630914922
+旨意 8.13548654919
+仙峰 12.1089181827
+鱼鳍 12.2912397395
+卢胜奎 12.1089181827
+见证者 12.5143832909
+德惠县 13.900677652
+求实效 13.900677652
+浆粕 11.2616203224
+脚程 13.900677652
+仙岛 12.8020653633
+八路军总司令部 12.2912397395
+民享 12.5143832909
+吕本元 13.900677652
+阳寿 10.8096351986
+语塞 10.2897597393
+人世间 9.54396882529
+仙岩 12.8020653633
+御所 13.900677652
+图像格式 13.900677652
+回击 9.85762638414
+回函 11.3357282945
+阿拉木图 10.604840786
+宋万先 13.2075304714
+茶叶店 12.5143832909
+乌兰湖 13.2075304714
+御手 11.7034530746
+鼻青额肿 13.900677652
+外高加索 10.642581114
+联邦院 12.2912397395
+疤脸 12.2912397395
+托克逊县 13.2075304714
+燕然山 11.9547675029
+仙岳 13.2075304714
+重建术 12.8020653633
+逛灯 12.2912397395
+售价 7.77162744192
+优秀成果 11.7034530746
+上弹 11.7034530746
+气候灾害 12.5143832909
+顽梗 13.900677652
+西征花 13.900677652
+系统管理员 11.598092559
+受胎 12.1089181827
+叙利亚人 11.1926274509
+雄居 12.1089181827
+卤虾 13.900677652
+变窄 10.1630080337
+卫斯理 11.5027823792
+丁某 13.900677652
+尸山血海 12.2912397395
+按键式 13.2075304714
+占优势 8.18364995057
+重洋 13.2075304714
+组员 11.4157710022
+降钙素 11.7034530746
+支奴干 13.900677652
+别远 13.2075304714
+五常县 13.900677652
+激光照排 12.2912397395
+象极了 12.2912397395
+瑞雪兆丰年 12.5143832909
+补阙拾遗 13.900677652
+只成 12.5143832909
+头涨 13.900677652
+更为重要 8.48457724977
+三十九分 13.900677652
+如狼似虎 10.6818018271
+矩尺 13.2075304714
+弗罗斯特 12.1089181827
+组合 6.52855962364
+钝角 11.7034530746
+暴横 13.2075304714
+都统海 12.8020653633
+九九歌 11.8212361103
+丁林 13.900677652
+支哈尔 13.2075304714
+纳林河 11.3357282945
+捐助 9.87532596124
+母腹 13.2075304714
+文殊 10.2630914922
+九十斤 13.2075304714
+靠天吃饭 10.533381822
+文段 13.900677652
+国马钧 13.900677652
+监卖 12.8020653633
+些须 11.2616203224
+累计 6.06075829196
+大树枝 12.2912397395
+秀发 10.2371160058
+大树林 13.2075304714
+洪安涧 12.8020653633
+三十八席 13.900677652
+白驴 12.2912397395
+回顾历史 11.598092559
+宝星 13.900677652
+大洋洲 8.4980002701
+外汇局 8.43261751084
+道路设施 13.2075304714
+土地储备 8.31718134319
+王戎 11.598092559
+丁村 10.533381822
+百十条 13.2075304714
+四千万元 12.5143832909
+宝昌 11.7034530746
+速记员 12.8020653633
+节水型 12.2912397395
+受聘 9.17328983326
+王刘安 12.5143832909
+节约 7.89926277401
+少有 8.12923652885
+鼓乐齐鸣 11.7034530746
+童袜 13.2075304714
+说瞎话 10.9049453784
+康城 12.8020653633
+大错特错 10.4994802703
+核优势 12.5143832909
+从商 10.3453295905
+别转 12.1089181827
+想念起 12.5143832909
+文武 7.08723305246
+拉蒙德 13.900677652
+保卫处 10.642581114
+文正 11.4157710022
+雄峻 11.8212361103
+生产力 7.13103567512
+库尔斯克 10.4666904475
+男男女女 10.0088573539
+纠葛 9.84023464143
+冲下 10.604840786
+内阁大臣 10.533381822
+受者 11.9547675029
+七星针 13.2075304714
+雒越征 13.2075304714
+异形字 13.900677652
+领导力 11.3357282945
+美帝国主义 10.3171587135
+内秦淮 12.8020653633
+卢瓦尔 11.3357282945
+神秘果 12.1089181827
+置于脑后 12.8020653633
+加压釜 13.900677652
+三十八年 9.85762638414
+格鲁派 9.77354326693
+镁铝合金 13.2075304714
+历为川 12.5143832909
+政策法规 10.0720362555
+燕公子 12.8020653633
+业余选手 13.900677652
+商左右 13.900677652
+变空 13.900677652
+哗然 10.0088573539
+七机部 13.900677652
+两百二十余处 13.2075304714
+遍体 9.61021821083
+裸露出 12.1089181827
+糊涂账 10.765183436
+古诺 12.1089181827
+丸子 10.0294766411
+黔东南州 12.8020653633
+受过 7.93967231235
+曾孝谷 12.8020653633
+民用工业 11.1280889297
+米尼特 13.900677652
+钧启 13.900677652
+食既 13.2075304714
+演讲稿 12.2912397395
+锅铲 11.7034530746
+尖端放电 12.1089181827
+少白头 13.900677652
+孕激素 10.4666904475
+王旦 11.9547675029
+回弹 11.7034530746
+落地生根 11.4157710022
+迪多 12.2912397395
+光漂白 13.900677652
+廖夫 12.1089181827
+布拉斯 11.8212361103
+赋税 7.88941047757
+粉彩 11.0674643079
+临走时 9.12155415886
+代王侑 12.8020653633
+不治 10.1164880181
+姜维令 12.1089181827
+话务员 11.4157710022
+宛温 12.8020653633
+投上 10.765183436
+十八文 13.2075304714
+那一城 13.900677652
+瞎编 11.3357282945
+装配 8.52078029844
+张家坡 13.900677652
+王旨 12.8020653633
+调兵遣将 10.4041700905
+孟州市 12.2912397395
+师道 12.2912397395
+回归 6.58479414747
+保卫团 11.7034530746
+自由动作 13.900677652
+拍好 11.9547675029
+迪奥 10.8096351986
+脉冲调制 12.8020653633
+姚范 13.2075304714
+十八日 9.77354326693
+装酒 11.598092559
+节煤 13.2075304714
+协会会员 10.4666904475
+乱砍滥伐 13.2075304714
+凑集 12.1089181827
+西魏改 11.598092559
+中联部 13.900677652
+旧历年 11.8212361103
+滑冰场 13.900677652
+晾衣架 12.1089181827
+受辱 9.63799777493
+嫌小 12.2912397395
+少量下 12.8020653633
+两千五百多年 13.900677652
+芳香剂 13.900677652
+捆住手脚 12.1089181827
+闵兄 13.900677652
+井沿 13.2075304714
+文摘 10.3453295905
+抽象 7.88696249593
+承销团 10.2371160058
+挡泥 13.900677652
+掌握情况 11.598092559
+霍特 10.9562386728
+不改其乐 13.900677652
+丁桥 13.900677652
+方寸不乱 12.8020653633
+头戴 8.43261751084
+响晴 11.9547675029
+帕克斯 12.8020653633
+基性岩 9.84023464143
+创业垂统 13.900677652
+白羊山 11.8212361103
+修庙 10.642581114
+皮斯河 13.2075304714
+现代性 11.5027823792
+连带保证 11.8212361103
+变电 10.4666904475
+工商总局 9.91169360541
+叶梦熊 13.2075304714
+脚气病 11.0103058941
+爱迪生 9.96885201925
+大流氓 12.2912397395
+仙力 13.2075304714
+地斗韵 12.8020653633
+雄厚 8.60737282725
+指键 13.2075304714
+回心 10.8561552143
+回忆 7.35964765279
+牡丹园 12.5143832909
+战不胜 11.9547675029
+迦勒 12.2912397395
+透气 10.0505300503
+浆状 12.5143832909
+流过泪 13.900677652
+硬骨 11.5027823792
+倒戈卸甲 12.5143832909
+雄县 10.7226238216
+师部 9.36807815882
+赔上 10.604840786
+叠字 12.5143832909
+抽调 8.63798746307
+水德 11.9547675029
+丁根 12.1089181827
+吴作人 11.9547675029
+七大洲 11.8212361103
+木薯 9.59661255877
+余波 10.533381822
+高桂英 9.15574552361
+领导层 9.74179456862
+头排 12.5143832909
+红小兵 12.2912397395
+回帖 10.2897597393
+人心大快 12.5143832909
+回师 9.01787572939
+加倍努力 11.7034530746
+前敌 9.69598503258
+上和下睦 13.900677652
+庞杂 9.65218240993
+一面之缘 11.0103058941
+于江宁 13.2075304714
+寿春城 12.2912397395
+欧提德 13.2075304714
+玉檀扶 12.8020653633
+承兑汇票 10.1394775363
+甥舅 12.5143832909
+光孝寺 12.2912397395
+忽大忽小 12.8020653633
+西格班 12.8020653633
+拉面馆 11.7034530746
+康奈 12.1089181827
+鲜为人知 10.3743171274
+孙廷铨 12.2912397395
+回席 12.5143832909
+别致 9.14708746087
+同时性 11.5027823792
+王旗 13.2075304714
+克伦语 12.8020653633
+文斗 11.5027823792
+目睹耳闻 12.5143832909
+友好相处 11.7034530746
+用其所长 12.2912397395
+络腮胡 12.1089181827
+九谷 13.2075304714
+畅言 13.900677652
+朝鲜中央通讯社 13.900677652
+从容 7.81390292506
+兴趣班 13.900677652
+伍兹霍 11.9547675029
+从宽 10.4994802703
+微型汽车 12.1089181827
+女人味 11.7034530746
+低级语言 12.2912397395
+文斌 11.2616203224
+铁路信号 11.1926274509
+番瓜 13.2075304714
+趴下来 12.2912397395
+招商团 12.8020653633
+蔬菜园 13.900677652
+迦南 11.9547675029
+马顺 11.3357282945
+康复 8.7245279194
+积雨 12.1089181827
+受身 13.900677652
+霍王 12.8020653633
+李政道 10.5684731418
+零售店 10.8561552143
+强奸民意 13.2075304714
+花色齐全 12.5143832909
+从实 11.1280889297
+物质待遇 12.8020653633
+令人叹服 12.1089181827
+磕磕撞撞 13.2075304714
+脸色铁青 9.93038573842
+只求 8.89673134603
+或有或无 12.1089181827
+抽起 11.4157710022
+宝树 10.8561552143
+抽走 10.5684731418
+喷雾干燥 12.5143832909
+不治而死 13.900677652
+好客 10.604840786
+回应 7.45020722983
+文教 8.86372504956
+玉镯子 12.8020653633
+张耘培 12.8020653633
+摸爬滚打 10.604840786
+文敏 11.7034530746
+开班 11.2616203224
+垂到 10.4994802703
+康姆 12.1089181827
+避让 10.4349417492
+玉檀拿 13.2075304714
+抽资 13.900677652
+旅游委 13.900677652
+天差地远 13.900677652
+岔流 12.5143832909
+从子 11.5027823792
+呵护 8.78868986362
+节点 9.14708746087
+蔚丹 12.8020653633
+基督徒 10.1630080337
+五六米 10.8096351986
+蔚为 11.3357282945
+由衷敬佩 12.2912397395
+康妮 12.8020653633
+自然科 12.2912397395
+粉底 10.5684731418
+吸来 12.5143832909
+自导引 13.2075304714
+回廊 9.18217878068
+八张 12.1089181827
+监工 10.1630080337
+师里 10.4349417492
+守备区 12.5143832909
+巨梁水 13.2075304714
+伊布拉 13.2075304714
+关心民瘼 13.900677652
+金云龙 13.900677652
+价格昂贵 10.1164880181
+不求 9.69598503258
+收割 8.55834340001
+外汇券 12.5143832909
+好得多 9.20019728618
+雨层云 11.7034530746
+闻操 11.7034530746
+溧水县 12.5143832909
+那宝贝 11.3357282945
+教育课 11.598092559
+彭其跳 12.8020653633
+脚盆 11.3357282945
+翁霍 13.2075304714
+十八架 13.2075304714
+捕鱼业 11.1926274509
+纽约证交所 10.0720362555
+溜秋 13.900677652
+樱草 13.900677652
+畚箕 12.8020653633
+中药学 11.4157710022
+莱菔 12.8020653633
+堆着 12.8020653633
+鱼道 11.8212361103
+对战 11.598092559
+方儿 12.2912397395
+宝殿 9.77354326693
+利义政 13.2075304714
+硬顶 10.604840786
+花拳绣腿 12.2912397395
+那神兵 13.900677652
+徐义生 12.5143832909
+出个价 12.2912397395
+公元前 6.18689303538
+雄兵 10.7226238216
+雄关 10.4349417492
+始终不变 12.2912397395
+京包线 12.8020653633
+滚珠轴承 12.1089181827
+大不里士 10.5684731418
+圆盘耙 12.5143832909
+抱憾终生 13.900677652
+秽气 11.3357282945
+供认 10.8096351986
+王季之 13.2075304714
+张学颜 11.7034530746
+停机坪 10.4349417492
+低落 9.4233408375
+加美兰 11.9547675029
+通讯费 12.5143832909
+环渤海 10.0294766411
+房中术 11.1280889297
+抽身 8.79473217808
+修筑公路 13.900677652
+埋起来 11.3357282945
+去年此时 11.5027823792
+康威 13.900677652
+变短 11.1280889297
+潘灵飞 12.2912397395
+不失毫厘 13.900677652
+韦斯特 11.3357282945
+聚氨脂 13.900677652
+拍子 10.6818018271
+彪炳史册 12.8020653633
+关中人 11.598092559
+邢贞 12.8020653633
+康娜 12.5143832909
+林冲谢 13.2075304714
+柳大郎 12.2912397395
+诱引 11.2616203224
+赖传珠 12.2912397395
+伦斯勒 13.2075304714
+卡里姆 12.2912397395
+山西大学 11.9547675029
+圣恩 10.4349417492
+十八朵 13.900677652
+履带吊 13.2075304714
+缴款通知 13.2075304714
+优化组合 10.9049453784
+筹到 11.7034530746
+眼离 13.2075304714
+组委 13.2075304714
+痛悼 11.9547675029
+比翼鸟 13.2075304714
+宗天会 12.8020653633
+涿州 9.56994431169
+鹤嘴镐 13.900677652
+村容村貌 13.900677652
+受赠 12.1089181827
+彭吴至 13.2075304714
+同位角 13.900677652
+脚癣 11.8212361103
+自命为 11.4157710022
+美女蛇 13.900677652
+迪安 11.1926274509
+叔孙通 12.2912397395
+文景 11.0103058941
+捏一把汗 11.5027823792
+发卡量 11.8212361103
+有创造力 12.5143832909
+信用卡 8.2985588311
+营业毛利 13.900677652
+文星 11.9547675029
+浦项 11.3357282945
+变着 11.7034530746
+官官相卫 12.8020653633
+吲哚 10.604840786
+老伴儿 11.0103058941
+经销店 11.5027823792
+香积寺 11.9547675029
+民族事务 11.2616203224
+文明 6.66074506066
+十八条 12.8020653633
+文昌 10.0294766411
+三十八卷 12.5143832909
+煎作 12.8020653633
+叠好 10.765183436
+七窝八代 13.900677652
+白恩杰 10.8561552143
+宋教仁 9.26594866375
+四百余年 12.1089181827
+仓库 7.73106691948
+布拉杰 13.2075304714
+乘势而上 12.5143832909
+宝正 12.8020653633
+疑窦丛生 13.2075304714
+受贿 9.04086524761
+口腔炎 12.5143832909
+羊二蛋 9.87532596124
+晏子赋 13.2075304714
+原电池 12.1089181827
+旅游业 7.82763311788
+张格尔 10.8096351986
+丁毅 12.5143832909
+鱼酱 13.2075304714
+粉屑 11.9547675029
+爆料 9.59661255877
+亦犹 12.8020653633
+柳克明 12.5143832909
+淫戏 13.2075304714
+母质 10.4349417492
+超级玛丽 13.900677652
+淫戒 13.2075304714
+雅库 12.8020653633
+虚拟性 12.2912397395
+办起 9.6811699468
+黉宫 13.900677652
+球面镜 12.8020653633
+满清水 12.8020653633
+邬思道 12.1089181827
+抽运 13.2075304714
+肖像画家 12.1089181827
+省市级 11.598092559
+兰德瑞 13.2075304714
+雄健 9.89334446674
+奥铃 13.2075304714
+承销商 8.12923652885
+供词 10.9562386728
+母贝 12.2912397395
+东逃西散 13.900677652
+八阵 11.8212361103
+噤口 12.8020653633
+行动不便 10.765183436
+粉尘 9.25628675283
+人心隔肚皮 11.8212361103
+节片 12.5143832909
+打情骂趣 13.900677652
+射人先射马 13.900677652
+绝对误差 13.2075304714
+至理明言 13.900677652
+耳鸣 9.16447920358
+卡扎尔 11.7034530746
+退还给 10.604840786
+回屋 9.89334446674
+银瑞信 8.37124856446
+版口 13.2075304714
+劳瘁 12.1089181827
+曾呈奎 12.8020653633
+乌羊石 11.3357282945
+马嘶鸣 11.7034530746
+株式会社 10.0505300503
+五内 11.3357282945
+省级 7.88696249593
+闪耀 9.65218240993
+供说 13.2075304714
+科尔托 12.1089181827
+四千五百二十七匹 13.2075304714
+黄体酮 12.1089181827
+平之子 13.2075304714
+变相 8.56313957227
+商务印书馆 9.01032852375
+粗短 10.1630080337
+那宝象 13.2075304714
+戴戟 13.2075304714
+彩灯 10.2897597393
+赫氏堡 11.5027823792
+买绢帛 13.2075304714
+季风性 11.5027823792
+不疲倦 13.900677652
+核桃仁 10.9049453784
+本队 10.533381822
+文杏 12.5143832909
+熊开元 13.900677652
+吸收 6.23351939666
+拉托尔 13.2075304714
+稍高于 11.4157710022
+卫子夫 12.2912397395
+北元兵 13.900677652
+几道菜 12.5143832909
+文杰 11.5027823792
+兵刃相接 13.900677652
+面部潮红 12.8020653633
+服务供应商 11.7034530746
+钢窗 12.8020653633
+良民 9.24671730182
+百结 12.5143832909
+欠债人 13.900677652
+水电厂 11.8212361103
+天庭饱满 12.1089181827
+岁时伏腊 13.900677652
+低薪 11.7034530746
+名利客 13.900677652
+大峡谷 9.61021821083
+农业院校 13.900677652
+叨扰 11.4157710022
+拦水坝 13.2075304714
+壶关县 12.8020653633
+繁昌县 13.2075304714
+霍然 10.4041700905
+仲华阅 13.900677652
+如痴似醉 12.8020653633
+从头 8.73019365694
+庞文 13.900677652
+樱花 9.91169360541
+徐孚远 13.900677652
+比高 9.54396882529
+康宁 10.4349417492
+团体操 12.2912397395
+姚思孝 13.900677652
+明基 12.5143832909
+康安 13.900677652
+新罕布什尔州 11.8212361103
+胸外科 11.9547675029
+大发雷霆 10.2630914922
+皆知 9.87532596124
+变白 10.2117981979
+文札 11.9547675029
+文本 8.94485059437
+建材行业 10.8561552143
+康定 10.2897597393
+氮磷 12.1089181827
+居安邑 12.8020653633
+刘德盈 13.900677652
+蜀道难 11.598092559
+养殖池 12.8020653633
+这样的话 8.49350588052
+虚拟机 12.8020653633
+豆青 12.2912397395
+受诉 11.8212361103
+顺道来 12.8020653633
+装错 13.900677652
+康山 12.8020653633
+戴文 12.5143832909
+王守志 13.900677652
+誓图 13.900677652
+格鲁曼 11.1280889297
+仙器 13.900677652
+康居 10.3171587135
+老挝人民革命党 13.2075304714
+那纳克 12.8020653633
+旅游局 10.1394775363
+戴方 12.5143832909
+结构复杂 9.61021821083
+节用 11.1926274509
+全金诗 13.2075304714
+节电 10.8096351986
+鱼际 11.8212361103
+楚共王 12.8020653633
+角位移 11.598092559
+口腔癌 12.2912397395
+毅然决然 11.0103058941
+机米 12.8020653633
+绝命 12.1089181827
+循环论 11.598092559
+姚莹 12.8020653633
+莱德杯 13.900677652
+无路可逃 11.0103058941
+鱼阵 10.7226238216
+脚炉 12.1089181827
+重温 10.0940151622
+翻译程序 12.5143832909
+哄闹 12.8020653633
+庞戈 12.8020653633
+戴族 13.900677652
+铁木尔 13.2075304714
+子杰叔 12.8020653633
+玉净瓶 12.8020653633
+别蒙 12.1089181827
+康尼 12.5143832909
+秦军略 13.2075304714
+含水层 10.2371160058
+浓汤 11.9547675029
+光天化日 9.75754292558
+凤眼朝 12.8020653633
+拦挡 10.8096351986
+爱旭 11.7034530746
+受训 10.3171587135
+哧溜 13.2075304714
+博彩业 11.8212361103
+通德论 11.9547675029
+受让 8.29487558568
+拔尖 10.5684731418
+手机卡 11.7034530746
+强徒 10.8096351986
+批着 12.5143832909
+受访 9.03314320152
+福临皱 13.2075304714
+浓汁 12.1089181827
+连接起来 9.45802639549
+鱼雷 8.03989142851
+汤普逊 12.2912397395
+的花海 13.900677652
+查明真相 12.1089181827
+扔起 13.2075304714
+亚赛 13.2075304714
+购房置业 12.8020653633
+劳燕 13.900677652
+直角坐标 10.1871055853
+头昏 10.1630080337
+产品推介 13.900677652
+宝洁 11.2616203224
+寡廉鲜耻 11.598092559
+从平 12.2912397395
+联合作战 9.85762638414
+失业率 7.32699748502
+节疤 12.8020653633
+脚灯 12.5143832909
+腿脚 9.20019728618
+归顺于 12.1089181827
+台湾大学历史系 12.5143832909
+变焦 11.9547675029
+有产者 11.5027823792
+回家 6.19226698472
+颇感 10.0088573539
+回宫 9.04864738806
+中证报 11.7034530746
+抽血 10.1630080337
+鱼雁 12.2912397395
+文恭 12.5143832909
+湖南师范大学 13.2075304714
+成功人士 10.7226238216
+总结性 11.2616203224
+街坊邻居 10.604840786
+惯技 13.900677652
+肺动脉瓣 11.9547675029
+瞌睡 9.12999302751
+文思 10.604840786
+头晕 8.3555002075
+丁氏 9.94943393339
+翁金 12.8020653633
+奥立弗 12.5143832909
+粉壁 11.8212361103
+一乾二净 13.900677652
+福井县 12.5143832909
+向左看齐 13.900677652
+惠陵 13.900677652
+运输部队 11.8212361103
+乱世佳人 11.8212361103
+从师 9.58318953844
+十字路 13.2075304714
+手机号 10.4349417492
+诱奸 13.2075304714
+比丘国 11.7034530746
+公车上 12.5143832909
+生旦净 12.5143832909
+巴恩斯 13.900677652
+郑卫国 10.642581114
+监督控制 13.2075304714
+陈思兵 12.2912397395
+阴茎头 11.0103058941
+节理 9.56994431169
+从快 13.2075304714
+五儿 10.4349417492
+头枕 10.2630914922
+斯瓦尔德 12.2912397395
+缉盗 13.900677652
+分遣队 10.9562386728
+曹官魏 12.2912397395
+德梅齐埃 13.900677652
+刘麻子 12.2912397395
+楦头 13.2075304714
+吐司面包 13.900677652
+现代文 13.900677652
+吸掉 11.8212361103
+腿肚 12.8020653633
+皆然 11.3357282945
+监外 12.2912397395
+迪尔 10.5684731418
+心包炎 11.4157710022
+纵横天下 11.3357282945
+本频道 9.89334446674
+起子 11.4157710022
+陈半丁 11.8212361103
+大赦令 13.2075304714
+腿肉 12.8020653633
+蝎子 9.74179456862
+二株 13.2075304714
+一百三十多名 13.2075304714
+经销处 13.900677652
+小妞儿 11.8212361103
+李艳秋 13.900677652
+鱼露 13.2075304714
+伙房 10.2630914922
+从微 13.900677652
+学有所成 12.8020653633
+大南门 13.2075304714
+名存实亡 9.77354326693
+教养所 12.8020653633
+阻断剂 12.1089181827
+伤元气 12.1089181827
+专业翻译 13.900677652
+宝泉 12.2912397395
+维尼亚 12.5143832909
+黄莺儿 12.2912397395
+语句 9.45802639549
+田旋花 13.2075304714
+师长 7.75434839431
+变热 11.7034530746
+浓浓 11.4157710022
+从征 10.2630914922
+五福临门 13.2075304714
+牡丹卡 13.2075304714
+波成东 13.2075304714
+意大利王国 10.9049453784
+极化处理 13.2075304714
+说笑话 10.0940151622
+中南财经政法大学 11.7034530746
+一迭连声 13.2075304714
+抗衡作用 13.2075304714
+宝气 11.9547675029
+目今 9.18217878068
+多万英镑 13.2075304714
+久别重逢 10.4994802703
+母训 13.2075304714
+互相支持 11.7034530746
+狗子 11.1280889297
+十八怪 13.2075304714
+康巴 12.1089181827
+班图尼 13.900677652
+群众性 9.30555780184
+芊芊 12.8020653633
+土腥味 11.9547675029
+空气质量 9.96885201925
+水影 11.8212361103
+肇事者 10.4994802703
+神异 11.1280889297
+费萨尔 11.8212361103
+编内 12.8020653633
+任平章 12.1089181827
+那太公 12.2912397395
+绯红 9.96885201925
+相等于 11.3357282945
+粉嫩 11.3357282945
+襄垣县 10.2117981979
+组建 7.17324592712
+瞎琢磨 13.900677652
+指数化 9.0884932966
+十月份 9.24671730182
+剑影 12.2912397395
+劳烦 11.2616203224
+克什克腾旗 11.0674643079
+训政时期 11.1280889297
+心脏地带 11.4157710022
+母语 10.9562386728
+水彩 11.7034530746
+接受度 12.5143832909
+报告起草 13.2075304714
+同盟条约 9.66657114738
+册页 10.9049453784
+一千五百余家 13.2075304714
+文意 12.5143832909
+纳谷 12.2912397395
+浓淡 10.2371160058
+陈龙川 12.2912397395
+封邱门 11.3357282945
+造形艺术 13.900677652
+第九十七回 12.5143832909
+都督府 8.86372504956
+监委 13.2075304714
+孤卿 13.2075304714
+推三阻四 11.598092559
+小点儿 13.2075304714
+许高丽 13.2075304714
+姚菱 13.900677652
+温化水 12.8020653633
+师门 11.2616203224
+柔情似水 12.1089181827
+低价商品 13.900677652
+冀西 11.598092559
+十匹 10.765183436
+头条 10.9049453784
+田闻言 12.8020653633
+节省 7.94225295895
+狱具 13.2075304714
+第七十六条 13.900677652
+变率 9.61021821083
+毕勒尔 13.2075304714
+断路器 10.533381822
+康平 11.598092559
+回复 7.35245854921
+聪加 12.5143832909
+旅行支票 12.8020653633
+叠嶂 11.1280889297
+奥里 11.3357282945
+顺道儿 13.900677652
+互通情况 13.2075304714
+扔进 8.94485059437
+农村信用 12.2912397395
+时尚界 11.9547675029
+氮素 10.5684731418
+没人管 9.91169360541
+薄荷香 13.900677652
+回头 6.35106848682
+黎曼可 13.2075304714
+调音台 13.2075304714
+回天 11.0674643079
+双向交流 12.5143832909
+土壤肥力 10.1164880181
+变现 9.12155415886
+荆钗记 11.5027823792
+世兵 13.2075304714
+威远 9.56994431169
+但其与 12.5143832909
+周大儒 13.2075304714
+糖醋排骨 13.900677652
+擎天之柱 12.8020653633
+劣等 10.9049453784
+水库 7.47905538417
+刮刮杂杂 12.1089181827
+投进去 11.2616203224
+壮伟 12.5143832909
+只此 9.98865464655
+啼饥号寒 11.598092559
+激活物 13.2075304714
+满腔悲愤 12.2912397395
+鹿蹄草 12.8020653633
+周转不灵 11.5027823792
+夏翔 13.2075304714
+设言托意 13.900677652
+技工 9.84023464143
+读秒阶段 13.900677652
+诱导 8.70772080109
+奖勤罚懒 13.2075304714
+拍录 12.8020653633
+未经检验 13.2075304714
+黄金时间 11.7034530746
+无可奈何 7.95525704337
+师院 11.8212361103
+脚状 13.900677652
+铁盆 12.8020653633
+低耗 11.2616203224
+补领 13.2075304714
+何足介意 12.8020653633
+攫住 10.5684731418
+指数值 13.2075304714
+三百八十万户 13.2075304714
+转发器 11.4157710022
+职守 10.765183436
+戴有 12.2912397395
+文才 10.1871055853
+服务器之间 12.8020653633
+拉托夫 13.900677652
+卫拉特 11.0103058941
+日本民主党 11.5027823792
+中华人民共和国中央军事委员会 11.1280889297
+神经 7.06013112269
+组工 12.8020653633
+十二幅 13.2075304714
+拍得 9.96885201925
+可恼 11.4157710022
+田汝成 13.2075304714
+从属 9.24671730182
+人去楼空 11.1280889297
+呵斥 9.14708746087
+卡里巴 13.900677652
+悬浮固体 12.8020653633
+角放大率 12.8020653633
+死有余罪 13.900677652
+幸万幸 13.2075304714
+文成 10.0294766411
+文部 13.2075304714
+母戊鼎 11.0674643079
+地闻风 13.2075304714
+下不来 10.533381822
+戴村 13.2075304714
+康康 12.8020653633
+走为上计 11.4157710022
+尼波罗 12.5143832909
+大风 8.20023407859
+文戏 11.1280889297
+汉沽 11.598092559
+环蚀 13.900677652
+万人之上 11.2616203224
+坐守 10.8561552143
+鱼钩 10.8096351986
+挥霍者 13.900677652
+康庄 11.598092559
+脚爪 11.2616203224
+从小 7.33964698608
+丸剂 10.9049453784
+传递细胞 11.2616203224
+陈霸先 11.0674643079
+五六 9.33632946051
+魏姐 12.1089181827
+坑坑洼洼 10.2117981979
+大哥大 12.1089181827
+康府 12.8020653633
+努着 12.8020653633
+甜饼 13.900677652
+二版 13.2075304714
+刁协 11.5027823792
+唐天子 13.2075304714
+九宫山 10.9562386728
+好得快 12.1089181827
+全国青年联合会 12.8020653633
+省立 11.1926274509
+测力计 13.900677652
+窜进 12.1089181827
+悬钩子 11.5027823792
+以私废公 12.8020653633
+低腰 13.900677652
+装阔 13.900677652
+卓克基 13.2075304714
+理所当然 8.57766767284
+鱼镖 11.8212361103
+劳特 13.2075304714
+和平过渡 12.2912397395
+生物质能 9.58318953844
+税务机关 10.0940151622
+仲麦巴 13.2075304714
+叔祖 11.7034530746
+壮乡 13.900677652
+住者 12.8020653633
+小寨 10.5684731418
+弗里茨 12.8020653633
+据闻 12.2912397395
+联海 12.8020653633
+分析模型 12.1089181827
+孔三传 12.5143832909
+变化不测 13.900677652
+龙潭山 12.8020653633
+拖鞋 9.87532596124
+壮丁 9.82314020807
+布拉拉 13.2075304714
+文帝太子 13.2075304714
+念成 11.9547675029
+广渠门 10.8561552143
+走为上着 13.900677652
+阴一阳 11.5027823792
+卡里尔 13.2075304714
+康强 12.1089181827
+一千五百余处 13.2075304714
+马孟起 12.5143832909
+仗义疏财 10.765183436
+李伟民 13.900677652
+好得很 10.4666904475
+格鲁斯 13.2075304714
+塑造形象 11.8212361103
+壮丽 8.66956903512
+壮举 9.7898037878
+配不上 10.765183436
+语出 11.1926274509
+黑河市 11.4157710022
+德阳市 11.0103058941
+小表弟 10.1871055853
+当雄县 11.8212361103
+昭觉 13.2075304714
+宝清 11.5027823792
+雷音寺 10.4349417492
+自然美 11.1926274509
+闻报 10.2630914922
+法治化 12.2912397395
+物理光学 12.2912397395
+马拉松 10.0505300503
+人文主义者 11.0674643079
+独立宫 13.2075304714
+方大林 10.6818018271
+蒙闯王 12.1089181827
+东营区 13.2075304714
+伦斯基 11.9547675029
+人缘儿 12.8020653633
+三十五元 12.2912397395
+楚攻秦 12.8020653633
+丰威汉 13.2075304714
+迪庆 11.9547675029
+周馥 11.9547675029
+徐氏乃 13.2075304714
+立太宗 12.8020653633
+粉墙 10.5684731418
+伯罗奔尼撒 9.6811699468
+行星风系 12.8020653633
+排球队 12.2912397395
+能歌善舞 10.3743171274
+批判性 10.7226238216
+科尔曼 12.5143832909
+五十首 12.8020653633
+群山环绕 11.2616203224
+佯狂 12.8020653633
+康德 9.12999302751
+白首 11.598092559
+朱友贞 11.9547675029
+廖廖 12.5143832909
+同盟罢工 11.4157710022
+勿忘草 12.5143832909
+叠层 11.4157710022
+重重困难 11.4157710022
+徐氏东 11.9547675029
+成绩斐然 10.9049453784
+汉以东 13.2075304714
+究理 12.8020653633
+沙盘 10.765183436
+回声 9.00283785202
+香港艺人 12.8020653633
+节目 7.54456999128
+越俎代庖 11.0103058941
+中药店 11.8212361103
+监察 8.05135287203
+五元 9.85762638414
+披荆斩棘 11.4157710022
+水廊 13.900677652
+进项 10.9562386728
+高级人民法院 10.0294766411
+回望 10.2897597393
+心服口服 10.4994802703
+绿闪 13.900677652
+沦陷 8.99540287354
+退选 12.2912397395
+王刘永 13.2075304714
+语源 11.2616203224
+特伦特 12.8020653633
+机要科 12.2912397395
+燕青纳 13.2075304714
+马龙峰 12.8020653633
+门枢 12.8020653633
+文峰 11.0103058941
+雄武 12.5143832909
+进行拍卖 11.5027823792
+靖寇大 13.2075304714
+于葭芦 12.8020653633
+惯贼 13.900677652
+回本 10.3743171274
+魏兵弃 13.2075304714
+哎哟 9.02548032877
+粉条 10.3453295905
+普实克 12.5143832909
+遮掩起来 12.8020653633
+高利贷者 9.94943393339
+往东部 12.8020653633
+均方收敛 13.2075304714
+生活用品 9.53122979951
+维护程序 13.900677652
+应纳 11.2616203224
+斗兽场 12.1089181827
+慈禧转 13.2075304714
+虚拟环境 13.2075304714
+洽购 11.4157710022
+礼部 7.73736284794
+极窄 12.8020653633
+戈梅斯 13.900677652
+文岳 13.900677652
+面见 9.82314020807
+创业者 9.12999302751
+李信叹 13.2075304714
+可悲 9.28555713513
+于政 13.900677652
+杨伯起 13.2075304714
+粉末 8.58255765813
+曲曲弯弯的 11.9547675029
+调车场 12.5143832909
+卢西尼 13.2075304714
+不豫 11.7034530746
+高玉倩 13.900677652
+伊勒呼里山 11.598092559
+代码证 13.2075304714
+退避 10.3453295905
+黎曼流 13.2075304714
+夹大衣 12.5143832909
+裘氏 12.5143832909
+大顶 10.8561552143
+闷到 13.2075304714
+热水器 9.44633035572
+外交机构 12.1089181827
+服装市场 12.5143832909
+说教式 12.5143832909
+铁盘 13.900677652
+渡赤水 11.0674643079
+奔驰公司 11.8212361103
+文山 9.85762638414
+哎呀 8.20358416547
+大老爷们 11.7034530746
+宝儿 11.9547675029
+白鳍豚 11.4157710022
+不谋其政 12.1089181827
+麦科德 13.2075304714
+马拉塔 11.4157710022
+戴夫 13.900677652
+中餐 11.3357282945
+毛大狗 13.900677652
+齐心戮力 13.2075304714
+语云 12.8020653633
+小室 12.1089181827
+输卵管炎 12.8020653633
+盖乌斯 13.2075304714
+静嘉堂 12.5143832909
+吝惜 10.2630914922
+单晶体 11.598092559
+雷二 12.5143832909
+大顺 7.98447558937
+操作界面 12.2912397395
+劳务费 10.9562386728
+教统 13.900677652
+禄官自 12.8020653633
+宝元 11.1926274509
+吸干 10.9049453784
+到达某 13.2075304714
+面西 12.5143832909
+宝光 11.1280889297
+诱敌 10.1164880181
+才艺 10.4994802703
+开斋节 11.0674643079
+宝兴 11.7034530746
+戴好 11.5027823792
+空跑 13.2075304714
+从戎 11.8212361103
+恍然大悟 8.83177344976
+寒冻风化 10.3743171274
+组接 11.8212361103
+纳希莫 12.8020653633
+宝典 10.9049453784
+礼遇 9.25628675283
+放开价格 13.2075304714
+送货员 12.5143832909
+忍耐力 10.8561552143
+磷钇矿 12.1089181827
+洗碗池 13.2075304714
+达赫莱 13.900677652
+经训 13.900677652
+普遍深入 13.900677652
+国内革命战争 10.7226238216
+心理素质 10.1394775363
+御膳房 9.96885201925
+粒细胞 9.58318953844
+报告团 11.2616203224
+双垂尾 12.1089181827
+绒裤 12.5143832909
+经论 10.533381822
+四岳 11.4157710022
+蒸汽锤 11.8212361103
+蓝琉璃 13.2075304714
+辽宁省政府 13.2075304714
+罗米尼 13.900677652
+古术 10.9562386728
+珠芽 12.2912397395
+阳泉市 11.3357282945
+头家 12.8020653633
+转马 11.4157710022
+三船 12.2912397395
+更迭 9.30555780184
+讨人嫌 11.9547675029
+回映 13.900677652
+十八岁 9.00283785202
+廖总 10.0505300503
+吸得 11.0674643079
+女人气 11.7034530746
+闻山 13.2075304714
+皮沙发 12.5143832909
+芳香植物 11.7034530746
+江亦曼 13.900677652
+处罚法 11.7034530746
+迪恩 11.9547675029
+号角声 11.1280889297
+风言风语 10.8561552143
+岳氏 13.900677652
+丁军 13.900677652
+汝才笑 11.2616203224
+组成 4.98229514731
+售票 9.98865464655
+头寸 8.64318227995
+礼金 10.9562386728
+宁河县 11.9547675029
+丁冬 11.7034530746
+三井 10.3453295905
+灵魂深处 11.0674643079
+老鼠洞 11.9547675029
+和艾灸 13.2075304714
+朱拉隆功大学 12.5143832909
+刻薄 9.65218240993
+理发店 9.93038573842
+尤善 11.0103058941
+壮烈 9.49395840471
+壤中流 13.900677652
+齐衰 11.7034530746
+抵押物 10.8096351986
+邵伯湖 12.2912397395
+骁勇 9.75754292558
+宾鸿 12.8020653633
+丁克 12.5143832909
+冒顶 11.7034530746
+回暖 6.86540905269
+根本矛盾 12.1089181827
+翻身 7.72481038187
+轮台县 11.9547675029
+叛逆者 11.2616203224
+乌兰夫 13.2075304714
+绒衣 11.4157710022
+肩负起 11.0674643079
+赡养 10.0505300503
+新加坡政府 10.4994802703
+少量多餐 11.8212361103
+长出 8.46695564842
+赫伯特 11.2616203224
+弹无虚发 11.1280889297
+中国科学院上海植物生理研究所 13.2075304714
+滔滔 9.20932976975
+一千零二十四锭 13.2075304714
+专制政府 11.8212361103
+阿努拉达普拉 12.8020653633
+百十元 12.8020653633
+叠成 10.6818018271
+扬武 12.8020653633
+丁兵 13.2075304714
+营利性 12.2912397395
+高仓健 11.7034530746
+穆宗耶 12.8020653633
+望丞相 11.8212361103
+吸引 6.22791975533
+赣南盆地 13.2075304714
+班图恩 13.2075304714
+场地面积 13.2075304714
+配体 11.8212361103
+面表 13.900677652
+放虎自卫 13.2075304714
+头子 9.18217878068
+伊利诺斯州 11.7034530746
+中华工商 13.2075304714
+挤破 10.8096351986
+达尔杜 12.1089181827
+二十四条 13.2075304714
+抗荷服 13.2075304714
+王摇 13.2075304714
+游走 9.28555713513
+黑三棱 12.2912397395
+宛城 10.4666904475
+哎唷 12.8020653633
+生产操 13.900677652
+北新 9.30555780184
+技战术 11.8212361103
+游赏 11.4157710022
+千疮百孔 10.2630914922
+心存魏阙 11.9547675029
+颤微微 11.4157710022
+灌个 13.900677652
+武备学堂 10.533381822
+游资 7.48721869481
+庞德 9.80633308975
+俺也来 13.900677652
+十八层 10.7226238216
+头孢 10.9049453784
+丁儿 12.2912397395
+集体性 10.8096351986
+变例 10.1871055853
+戴宝 13.2075304714
+丁勇 13.2075304714
+劳作 9.23723855786
+曹本 12.8020653633
+仙桃 10.6818018271
+浓到 13.900677652
+十万零一千 13.2075304714
+美女如云 11.598092559
+热咖啡 12.5143832909
+计口发 13.2075304714
+宝历 12.8020653633
+八封 12.5143832909
+塔重修 13.900677652
+守备军 13.900677652
+同声附和 12.5143832909
+兴奋性 10.1630080337
+王刘渊 13.900677652
+祁红 11.7034530746
+曾祖母 12.5143832909
+拉托斯 13.2075304714
+回放 10.1630080337
+钟鼎之 13.2075304714
+音序器 13.900677652
+进一步提高 8.00078029839
+航空摄影 10.8561552143
+回收 7.78038023302
+隆寺 12.8020653633
+布拉德 10.2630914922
+归属权 12.5143832909
+分级分类 12.5143832909
+闲置 8.3555002075
+繁体版 13.900677652
+大果榆 12.5143832909
+首战告捷 11.1926274509
+回教 10.9562386728
+第二则 13.900677652
+雀形目 10.4994802703
+文库 10.2897597393
+止步不前 11.2616203224
+赵复至 12.8020653633
+急救箱 11.8212361103
+娱乐节目 11.2616203224
+御园 12.2912397395
+逐鹿 11.4157710022
+文庙 9.93038573842
+语法 8.63798746307
+牡丹江 9.59661255877
+考虑周到 12.2912397395
+青化砭 12.2912397395
+图释 13.2075304714
+才能 5.35567475992
+世交 10.1394775363
+丁力 11.8212361103
+世俗性 12.1089181827
+倏地 10.2117981979
+文康 11.598092559
+透湿 11.4157710022
+宝号 11.9547675029
+变修 12.2912397395
+备尝艰辛 13.2075304714
+好伴侣 13.900677652
+白沙瓦 10.8561552143
+面试 8.71889410168
+刻蚀 11.2616203224
+回敬 10.0940151622
+使用权 8.14810501315
+劳伦 10.9562386728
+劳伤 11.8212361103
+早点 8.3555002075
+劳保 11.0103058941
+语气 7.88452049228
+挨门 12.1089181827
+避其锐气 12.8020653633
+示范场 13.900677652
+慢慢儿 10.9562386728
+吸尽 11.7034530746
+鸡冠子 11.9547675029
+青年会 10.4041700905
+奥廖克 12.5143832909
+克孜勒河 13.2075304714
+童身 13.900677652
+文广 10.8096351986
+拍掌 11.0103058941
+二千五百五十四公里 13.2075304714
+报送 9.77354326693
+吸尘 11.598092559
+会员制 11.1280889297
+学术腐败 13.900677652
+战之兵 12.5143832909
+斯拉姆 12.8020653633
+慌里慌张 10.2630914922
+国家旅游局 10.533381822
+宣劳 13.2075304714
+粉料 12.5143832909
+语汇 10.642581114
+迪德洛 12.8020653633
+变低 11.5027823792
+朱唇皓齿 13.900677652
+脚上 8.69119149913
+脚下 7.36253782821
+咨询者 12.2912397395
+文帝 9.09665660724
+耳听是虚 12.2912397395
+如愿以偿 9.61021821083
+文帅 11.8212361103
+回旋 8.86372504956
+库尔黑 13.900677652
+变作 8.7245279194
+回族 8.35160156708
+诸夷皆 13.2075304714
+宝华 12.5143832909
+圈占 10.604840786
+宝卷 11.2616203224
+经行 10.533381822
+宝印 11.598092559
+脚丫 11.2616203224
+八尊 13.900677652
+拆船 12.5143832909
+汉江全 12.5143832909
+高老头 12.1089181827
+阿贾克斯 13.900677652
+孪生兄弟 10.765183436
+经血 10.2630914922
+西红门 13.900677652
+比少平 13.2075304714
+报道 5.88040717916
+周国平 12.8020653633
+淫威 11.0674643079
+另打主意 12.5143832909
+格力电器 9.75754292558
+百十号 11.8212361103
+经销权 13.2075304714
+文挚 13.900677652
+肛瘘 11.7034530746
+效死疆场 13.2075304714
+达尔文 9.0884932966
+对照表 11.8212361103
+操戈入室 13.900677652
+劳乏 11.0674643079
+孕产 11.9547675029
+遮天盖日 13.900677652
+护园人 12.8020653633
+急救站 12.8020653633
+特赦令 11.7034530746
+至宝 10.8561552143
+达尔斯 13.2075304714
+好处 6.87602862152
+拍戏 10.3453295905
+闻帝 12.5143832909
+痛痛 12.8020653633
+迪戈 13.2075304714
+拍成 10.5684731418
+文忠 11.1280889297
+杜罗河 12.8020653633
+改一改 10.9562386728
+青年人 8.89004235788
+费萨拉 12.2912397395
+中药房 13.2075304714
+杨班侯 13.900677652
+文思泉涌 13.900677652
+十一载 12.1089181827
+经解 11.9547675029
+组态 13.2075304714
+青出于蓝而胜于蓝 13.2075304714
+航速 8.20694551317
+欢笑声 11.9547675029
+冷热箱 13.900677652
+东土远 12.8020653633
+丁原 11.7034530746
+舅父母 13.900677652
+文德 11.4157710022
+祛痰剂 13.900677652
+皆佳 12.1089181827
+治国安邦 11.598092559
+公任官 13.900677652
+钟嗣成 12.5143832909
+珠胎 13.900677652
+得了吧 11.1280889297
+拍手 8.98802276624
+尚容徐 13.2075304714
+纳河 11.1280889297
+拍打 9.08039608637
+便利化 10.0294766411
+柳叶渚 12.8020653633
+一双夜 13.2075304714
+变价 11.3357282945
+刘贵立 13.900677652
+变上 13.900677652
+脚位 13.900677652
+文录 11.598092559
+肯出来 12.5143832909
+习惯用法 12.2912397395
+疾风知劲草 12.1089181827
+玉女峰 10.642581114
+酒铺 13.2075304714
+系统可靠性 12.8020653633
+重伤员 10.765183436
+坏得多 13.900677652
+宝刀 9.10488710638
+贪狼星 13.2075304714
+党员队伍 12.8020653633
+变个 10.642581114
+维修策略 13.900677652
+丁卢 13.2075304714
+市易 11.7034530746
+头头 9.15574552361
+黄色书刊 13.900677652
+宝刹 11.5027823792
+丁卯 11.3357282945
+出让方 10.7226238216
+变为 7.00297270885
+绑架勒索 13.2075304714
+二十三条 12.1089181827
+延髓 10.1164880181
+报告员 13.900677652
+华中电网 10.9562386728
+花灌木 13.900677652
+头天 10.0294766411
+冯司令 13.2075304714
+头大 9.59661255877
+文彭 11.7034530746
+萧某 12.5143832909
+回撤 10.642581114
+文彩 11.9547675029
+李佳白 12.8020653633
+劳亚 12.2912397395
+游轮 10.533381822
+酒钱 10.2897597393
+游转 12.1089181827
+头奖 10.9562386728
+获得成功 8.73019365694
+余派 12.2912397395
+鉴频器 12.2912397395
+施南 13.2075304714
+乡规民约 13.2075304714
+十八年 8.0985592766
+监查 12.5143832909
+酒钢 10.9049453784
+承灵 13.2075304714
+有说有笑 10.1871055853
+泊松核 13.900677652
+只因 8.30225569298
+更轻 11.5027823792
+值得尊重 11.9547675029
+一级预防 13.900677652
+文弱 10.4349417492
+脚伤 13.2075304714
+拍卖成交 10.7226238216
+绳墨 12.5143832909
+悲喜交集 11.3357282945
+多虑平 13.900677652
+扬中 13.2075304714
+漂白剂 11.1280889297
+布拉干 12.1089181827
+拍拖 11.9547675029
+刘金国 13.2075304714
+安德正 13.900677652
+驾驭能力 11.9547675029
+任贤使能 12.8020653633
+变乱 10.1164880181
+总比分 12.8020653633
+平行线 10.7226238216
+比顿 13.900677652
+四十七员 12.8020653633
+北方领土 12.8020653633
+网络平台 10.9562386728
+种元素 10.4666904475
+履历表 11.598092559
+环境影响 9.77354326693
+闻东虏 13.2075304714
+刘光祖 12.2912397395
+闻夫 13.900677652
+绿色蔬菜 10.6818018271
+庞婆 13.900677652
+光鲜 9.82314020807
+元子陪 13.2075304714
+高待遇 13.2075304714
+鲞鱼 13.2075304714
+前半段 11.0103058941
+暂住地 13.900677652
+长歌当哭 12.1089181827
+电荷 8.39128931535
+败事有余 11.2616203224
+横栏 13.2075304714
+基准利率 7.64492761022
+目睹 8.79473217808
+物价补贴 13.900677652
+强硬态度 11.3357282945
+定压比热 12.8020653633
+视频点播 12.8020653633
+公共利益 9.41204128224
+文士 9.34680076038
+重伤号 11.9547675029
+虚拟式 12.8020653633
+五丈 9.85762638414
+黄博文 13.900677652
+吴雅氏 12.8020653633
+浓味 12.1089181827
+三十五分 13.900677652
+逐项 10.3453295905
+霍亨 12.8020653633
+转鼓 12.1089181827
+太师爷 12.5143832909
+惠远城 12.1089181827
+苍岩山 11.9547675029
+适于航行 12.8020653633
+谨严 10.1630080337
+总的说来 9.5062284973
+目眩 10.7226238216
+归属感 10.8561552143
+叫车 12.2912397395
+两弹一星 11.598092559
+报告厅 12.8020653633
+菲律宾 7.83922073305
+威声 12.5143832909
+五七 10.4349417492
+谨上 13.900677652
+仙游 10.765183436
+随风飘荡 11.9547675029
+理论素养 12.1089181827
+齐越 12.8020653633
+多玲正 12.5143832909
+璞鼎查 11.9547675029
+软泥 10.3743171274
+目眶 12.5143832909
+文墨 10.3743171274
+汪云风 12.8020653633
+山形县 13.2075304714
+文塔 13.900677652
+半衰期 10.0720362555
+齐赵 13.900677652
+无言对泣 13.2075304714
+抹额 10.9049453784
+头帕 12.8020653633
+十八头 13.900677652
+回掉 13.900677652
+十八天 12.2912397395
+荒冷 13.900677652
+霍乱 10.1164880181
+万多倍 13.2075304714
+好几刀 13.2075304714
+谨以 12.2912397395
+头帽 12.8020653633
+宝唱 12.8020653633
+游击队 7.71446902808
+售粮 13.900677652
+翟銮 13.900677652
+中北路 11.9547675029
+今晋南 11.9547675029
+齐赞 13.900677652
+抒写 10.0720362555
+天命难违 13.2075304714
+退钱 12.1089181827
+三百二十三 13.2075304714
+报告单 12.2912397395
+理想实验 13.900677652
+蔡入淮 13.2075304714
+中药方 13.900677652
+叫过 11.1926274509
+乌骨鸡 11.0103058941
+跑街 13.900677652
+组构 11.598092559
+王季烈 13.2075304714
+抱住不放 12.5143832909
+轰隆 9.7898037878
+施医 13.2075304714
+差失 12.5143832909
+马拉尼 13.2075304714
+仙源 12.1089181827
+哲学家 7.47580862807
+一口袋 10.5684731418
+淫巧 12.5143832909
+从明 11.598092559
+头年 12.1089181827
+要职 9.26594866375
+回援 11.9547675029
+淀粉酶 10.8096351986
+黎阳仓 13.2075304714
+凤庆 13.2075304714
+退化雌蕊 12.1089181827
+没有话说 10.765183436
+点烟器 12.8020653633
+只准 10.1164880181
+白蝴蝶 11.9547675029
+游街 9.7898037878
+梅曾亮 12.8020653633
+百十名 12.5143832909
+文委 12.1089181827
+粉扑 12.2912397395
+国际航空公司 12.2912397395
+生产性 9.98865464655
+诸司符 13.2075304714
+兴奋期 13.900677652
+忙东忙西 13.900677652
+农业银行 9.23723855786
+牙弓 12.5143832909
+数码相机 10.8096351986
+胎盘 8.97342396682
+蒲昌海 11.8212361103
+吸完 11.2616203224
+面貌 7.83456956187
+莲花生 11.1926274509
+珠蚌 12.1089181827
+杂食性 9.72629038208
+第二刀 13.900677652
+眺望塔 13.2075304714
+王某 9.37888907493
+由表及里 11.598092559
+文姬 13.2075304714
+诱惑 8.11685246965
+细缝 11.598092559
+周太史 13.2075304714
+本钱 8.6803218269
+不仅如此 8.46695564842
+混混噩噩 13.900677652
+阳武侯 12.2912397395
+马伯乐 12.8020653633
+降落伞 9.85762638414
+成为必要 10.6818018271
+海淀区 10.4994802703
+褙子 12.8020653633
+高老庄 11.5027823792
+昌南镇 13.900677652
+礼门 11.9547675029
+灰心丧意 13.900677652
+拍摄 7.75220935606
+游览 8.19356738723
+电船 13.900677652
+氙灯 11.598092559
+豆雁 12.5143832909
+安身立命 10.533381822
+帕夫雷 13.2075304714
+山兴庆 13.2075304714
+排放物 12.8020653633
+科尔居 13.900677652
+糖酸钙 13.2075304714
+计划分配 13.900677652
+工资总额 9.37888907493
+赔率 11.2616203224
+晁补之 11.9547675029
+回扣 10.2630914922
+玉檀帮 13.2075304714
+回执 11.7034530746
+蝼蚁贪生 13.900677652
+文契 11.8212361103
+递归性 13.900677652
+上升流 10.604840786
+戴尔 10.604840786
+霍佩 13.900677652
+从来 6.41799582382
+缜密 9.61021821083
+头式 13.2075304714
+年深岁久 13.900677652
+上无片瓦 13.2075304714
+赶得上 10.9562386728
+中国共产党第一次全国代表大会 10.604840786
+顽固派 9.91169360541
+如临大敌 10.642581114
+亲笔写 10.6818018271
+爬上爬下 12.1089181827
+官学化 13.900677652
+集体土地 10.1164880181
+十番乐 13.900677652
+范全 10.9562386728
+粉拳 13.900677652
+从权 11.598092559
+面谈 10.0720362555
+桓鲋 10.9562386728
+面谕 9.96885201925
+卡萨诺瓦 12.2912397395
+王重阳 11.5027823792
+面谒 11.5027823792
+格拉西莫夫 11.7034530746
+左卫将军 12.1089181827
+桓鲂 10.9049453784
+技术难度 10.9562386728
+惘然 11.1280889297
+回报 6.75943252963
+执法思想 13.900677652
+从未 7.22233553732
+闻声 9.11318590919
+回拜 11.8212361103
+初萧何 13.2075304714
+情报工作 11.4157710022
+淀粉 8.50251495046
+目的 5.48153840103
+庞安 13.2075304714
+冰花 11.8212361103
+痞满 11.7034530746
+双凤麒麟 13.2075304714
+经轴 12.8020653633
+屈菜科 12.5143832909
+帕皮提 12.5143832909
+程日兴 12.5143832909
+宛叶 13.2075304714
+挺立 9.91169360541
+广州军区 11.7034530746
+怡保 12.5143832909
+动质 13.900677652
+普天同庆 11.1926274509
+跳行 13.900677652
+贩黄 13.2075304714
+回拨 10.0505300503
+头彩 12.8020653633
+招进来 12.8020653633
+查过 10.765183436
+电话会议 10.604840786
+土腥气 12.2912397395
+封燕铁 13.2075304714
+吸墨 13.900677652
+内蒙古军区 13.2075304714
+庞塞 12.8020653633
+壮着 10.3171587135
+戴得 11.8212361103
+酒酿 11.9547675029
+十八家 12.5143832909
+监房 11.8212361103
+哧哧 10.4041700905
+刻苦 9.4233408375
+朱之瑜 13.2075304714
+面达 13.900677652
+奇门遁甲 11.4157710022
+台湾民主自治同盟 12.2912397395
+节会 13.900677652
+雄浑 9.36807815882
+国内战争 9.87532596124
+从何说起 10.0088573539
+戴德 10.9049453784
+祖师爷 9.72629038208
+中药材 8.85725253506
+自成一家 10.4666904475
+维多利亚 9.22784881751
+圣战 10.2630914922
+周海媚 13.900677652
+宾馆 8.31718134319
+飞上了 12.5143832909
+闲笔 13.900677652
+慈禧西 13.900677652
+杀人犯 10.4041700905
+当地 5.862165631
+悬赏 10.1630080337
+劳动保护 10.765183436
+隆兴寺 11.7034530746
+电脑 7.42216800977
+台海两岸 13.900677652
+种子休眠 12.8020653633
+识时达务 13.900677652
+领海宽度 11.3357282945
+中国人民解放军总部 11.598092559
+吸声 11.2616203224
+宝城 11.5027823792
+节余 10.765183436
+五棓子 11.598092559
+容貌 8.63798746307
+昌被明 12.8020653633
+移转到 13.2075304714
+蓝莹莹 12.1089181827
+方程组 9.28555713513
+产业带 10.4994802703
+雍和宫 11.1926274509
+刘光第 11.2616203224
+挥着 10.2897597393
+经营之道 12.8020653633
+监所 11.7034530746
+美容师 11.2616203224
+机房 9.37888907493
+蛇纹石 10.1394775363
+水巷 13.2075304714
+模型简化 13.2075304714
+齐辉 13.2075304714
+译码器 12.2912397395
+科尔德 13.2075304714
+房中寻 12.8020653633
+不矜不伐 13.2075304714
+电视节 13.2075304714
+世俗 8.15128466607
+监押 10.4041700905
+夏之西 13.900677652
+买定离手 13.900677652
+闻宣 13.900677652
+账面 8.23771717184
+北京中医学院 13.2075304714
+监护 9.19114745066
+马拉干 12.8020653633
+御制 10.1164880181
+康曼 11.8212361103
+叠放 11.4157710022
+头尾 10.4041700905
+店老板 10.1871055853
+宝地 10.4666904475
+臌胀 13.2075304714
+黄晓玲 13.900677652
+凉嗖嗖 12.1089181827
+系统集成 9.87532596124
+传来传去 11.3357282945
+西方极乐 12.8020653633
+福地洞天 13.900677652
+闻宋 13.900677652
+康艳典 13.2075304714
+酒量 9.65218240993
+乌兰布 11.3357282945
+还款期 11.7034530746
+淫心 11.3357282945
+陈诗启 12.5143832909
+下下签 11.7034530746
+诱捕 10.765183436
+商高盛 13.900677652
+叶尼塞 11.8212361103
+格鲁尔 12.8020653633
+博局 12.8020653633
+国际主义 10.0940151622
+文娜 13.900677652
+老弱妇孺 12.2912397395
+头屑 11.8212361103
+售给 11.0674643079
+空间感 11.1280889297
+仪生 12.2912397395
+李德裕 10.9049453784
+叶藻科 13.900677652
+敲榨勒索 13.2075304714
+无理要求 10.4349417492
+拍柄 12.5143832909
+文道 12.5143832909
+水工 9.65218240993
+抒发 8.9519177616
+文娱 11.2616203224
+节俭 9.28555713513
+扎法尔 13.2075304714
+冲决 11.598092559
+挺秀 11.0674643079
+美容店 12.1089181827
+宝坻 11.2616203224
+截流 10.4994802703
+从小到大 9.77354326693
+组方 10.7226238216
+天涯共此时 12.5143832909
+酒醉 10.0088573539
+打个包 13.900677652
+从早 11.5027823792
+输水管 11.2616203224
+银链 13.2075304714
+电联 11.598092559
+察隅河 13.2075304714
+山地区 10.2117981979
+布雷西亚 12.8020653633
+爆玉米花 12.8020653633
+丁奉合 13.2075304714
+企业会计 13.900677652
+法比亚 13.900677652
+游记 9.20019728618
+较正 13.900677652
+宋兵直 13.2075304714
+少劳少得 13.2075304714
+价值规律 9.48183704418
+压花玻璃 13.2075304714
+环顾 9.09665660724
+用水量 11.1280889297
+露出破绽 11.7034530746
+闲空 12.5143832909
+大变身 13.900677652
+科马罗夫 13.900677652
+关子岭 12.8020653633
+一点四十五分 12.2912397395
+空下来 12.2912397395
+扶风县 11.5027823792
+科尔希 13.2075304714
+丁基 11.598092559
+文宗 9.56994431169
+诱拐 11.7034530746
+任里昂 12.8020653633
+无人之境 12.2912397395
+加快进度 11.0674643079
+电耗 10.9562386728
+唐初至 11.9547675029
+售罄 9.93038573842
+节义 11.4157710022
+文官 8.25523075433
+景颇族 10.642581114
+马拉德 12.8020653633
+廖晖 13.900677652
+仙洞 10.3171587135
+胆总管 11.9547675029
+游说 9.21854642485
+头巾 8.85725253506
+文家 11.1926274509
+酒递 12.1089181827
+超远 13.900677652
+松花蛋 11.3357282945
+威武雄壮 11.2616203224
+共变微分 13.900677652
+贾名化 13.2075304714
+五国部 12.8020653633
+蛙人 10.8096351986
+裘艿 13.2075304714
+文宣 12.8020653633
+急功 13.2075304714
+市井小民 11.8212361103
+亚宾斯 13.900677652
+关键问题 9.30555780184
+庞大 6.85839148004
+文字 6.34896543662
+抚今追昔 12.1089181827
+郝建秀 12.8020653633
+铁显色 13.900677652
+酒都 10.6818018271
+有损无益 12.8020653633
+衣冠禽兽 12.5143832909
+顾翼东 13.2075304714
+文存 11.2616203224
+壮盛 12.8020653633
+心战 11.7034530746
+李狗儿 9.49395840471
+监控 7.43764819506
+经贸 8.99540287354
+联合纤维 13.900677652
+御医 10.604840786
+戚家庄 13.2075304714
+丁坝 11.9547675029
+电能 8.48457724977
+炮舰政策 12.5143832909
+后代人 12.5143832909
+戴帽 10.2897597393
+郭林宗 13.2075304714
+百十块 13.2075304714
+钟子仪 12.8020653633
+康柏 13.900677652
+抗力 11.4157710022
+陈希滔 13.900677652
+报销 8.52078029844
+于金朝 12.5143832909
+桑切斯 12.2912397395
+从教 11.8212361103
+海东盛 13.2075304714
+报错 12.5143832909
+康某 11.5027823792
+百里香 11.9547675029
+良港 8.98802276624
+不曾有过 10.3171587135
+丧胆 10.2630914922
+拖雷 10.642581114
+应二州 12.5143832909
+摸门不着 13.900677652
+倾斜度 11.1926274509
+经起 13.900677652
+黄宗炎 13.2075304714
+对台戏 13.2075304714
+喀喇沁左翼蒙古族自治县 11.9547675029
+澳门特别行政区政府 12.8020653633
+线极化 13.900677652
+一个八九岁 12.5143832909
+燕损兵 13.2075304714
+争分夺秒 10.7226238216
+空间性 13.900677652
+回想 8.71329184614
+引导性 12.2912397395
+飞灾横祸 13.900677652
+举止大方 12.8020653633
+虞翻 11.598092559
+车盛 13.2075304714
+雪白色 13.2075304714
+始终不渝 12.1089181827
+天峻县 12.5143832909
+宝器 11.2616203224
+全国纪录 11.9547675029
+雾中 13.900677652
+任护国 13.900677652
+康桥 12.1089181827
+台儿庄 9.96885201925
+米夫 12.1089181827
+普洱县 13.2075304714
+一以贯之 10.9562386728
+小象 12.5143832909
+拆装 10.9049453784
+文品 13.900677652
+马相伯 11.7034530746
+图面 12.8020653633
+普三世 13.2075304714
+立达 13.900677652
+姬于织 13.2075304714
+播种面积 9.37888907493
+报验 13.900677652
+中山堂 13.900677652
+虚拟化 11.8212361103
+电轴 13.900677652
+友好用户 13.900677652
+始终不懈 13.900677652
+丁壮 9.91169360541
+文哥 13.900677652
+擂起 11.4157710022
+咸兴 12.1089181827
+面膜 9.6811699468
+电车 9.66657114738
+戴冠 11.9547675029
+选拔赛 11.4157710022
+敬德保 12.8020653633
+二十多元 13.900677652
+洋华堂 13.2075304714
+两千六百五十三 13.2075304714
+五保 11.0103058941
+从翰香 11.4157710022
+卷烟纸 11.9547675029
+同类题材 11.9547675029
+宛平 10.5684731418
+维斯特 12.8020653633
+塔剌海 12.1089181827
+宋梅 13.2075304714
+重新整理 11.9547675029
+服装模特 11.5027823792
+军事设施 10.2371160058
+宝姿 12.2912397395
+机手 13.900677652
+安敦尼 13.900677652
+辛迪加 11.3357282945
+对数函数 12.1089181827
+低声细语 13.2075304714
+吸回 12.8020653633
+报高 12.8020653633
+回潮 11.1926274509
+伊奥尼亚 12.1089181827
+戴凤 13.2075304714
+齐腰 10.6818018271
+弗雷德里克 11.7034530746
+电荷平衡 13.900677652
+攀扯 11.8212361103
+尚有云 13.900677652
+季风区 9.80633308975
+江布尔 11.2616203224
+文员 10.9562386728
+上官灵凤 13.900677652
+薛公 12.5143832909
+冲出 8.32094782599
+冲击 6.19541517711
+文告 9.6811699468
+费因曼 11.598092559
+冲进去 10.642581114
+贾庆林 10.9562386728
+阿嚏 13.900677652
+一面之交 11.598092559
+署长 10.3743171274
+录像 8.75318317516
+闻喜 10.8561552143
+科尔内 12.8020653633
+成思危 10.1164880181
+阎良区 12.8020653633
+发错 12.2912397395
+闫妻 11.598092559
+大变脸 12.5143832909
+本分人 11.9547675029
+纯洁性 10.9049453784
+可是 4.81908015589
+文君 11.7034530746
+顺道去 13.900677652
+冷吟 12.8020653633
+只差 9.96885201925
+头前 10.2371160058
+戴克 11.9547675029
+立轴 10.8096351986
+大理市 10.4666904475
+文名 10.9562386728
+谢七爷 13.900677652
+杨汝岱 13.2075304714
+大塘 13.900677652
+丁堡 10.4349417492
+邮电业 11.9547675029
+呵叻 12.2912397395
+旨归 12.8020653633
+万延元 13.2075304714
+杰奎琳 13.2075304714
+认认 11.0674643079
+呵叱 12.8020653633
+总校 11.598092559
+中性词 12.8020653633
+艾梅 13.900677652
+酒龄 13.900677652
+戴公 12.8020653633
+叨光 13.2075304714
+华北 7.11509000697
+宫见驾 13.900677652
+倾盆大雨 11.1280889297
+台湾光复 10.3171587135
+火控系统 8.80081122415
+雄才 10.9562386728
+跑得快 10.2630914922
+精神境界 10.9562386728
+立身 10.1630080337
+齐胸 12.2912397395
+戏院 10.6818018271
+奥尔洪岛 13.900677652
+小福临 10.9049453784
+说一不二 10.533381822
+五通桥 11.8212361103
+六十二万 13.2075304714
+情非得已 13.900677652
+懦夫 10.4349417492
+壮硕 11.4157710022
+陆秀夫 11.2616203224
+闻听 9.96885201925
+回游 11.2616203224
+姨妈家 12.1089181827
+乙苯 11.5027823792
+松阳县 13.2075304714
+闻君 12.2912397395
+丁姨 9.61021821083
+辨认出来 11.2616203224
+工人日报 11.4157710022
+拔出来 10.533381822
+拆解 10.0088573539
+回港 12.8020653633
+只射 12.8020653633
+改正过来 12.5143832909
+只封 12.8020653633
+闻名 7.79143006921
+小升初 12.1089181827
+脉脉含情 11.9547675029
+尚有何 11.5027823792
+有志者事竟成 13.2075304714
+拍档 11.598092559
+果然如此 10.2630914922
+头发 6.53676415057
+跟随 6.97410061875
+叔伯 9.48183704418
+柳下惠 11.7034530746
+学富才高 13.900677652
+瞎乱 13.2075304714
+马迦举 13.2075304714
+作伴儿 11.4157710022
+以南 6.6493326686
+晕乎乎 11.9547675029
+华冠丽服 12.8020653633
+才识 10.6818018271
+都统卞 13.2075304714
+刘光琦 13.2075304714
+五伯 12.2912397395
+头号 9.29550746599
+马骡 13.900677652
+拍案 10.2117981979
+金钟罩 13.2075304714
+三间房 11.2616203224
+一试身手 12.8020653633
+谢兄弟 13.900677652
+倏尔 12.2912397395
+朝阳路 12.8020653633
+专题会议 12.8020653633
+十七八万 12.8020653633
+运输成本 10.2630914922
+刻起 13.2075304714
+账页 13.900677652
+丁奉 10.2371160058
+生平 8.36728816325
+宾阳 12.5143832909
+从此 6.11371064936
+图雷 12.8020653633
+星象学 12.2912397395
+赔罪 10.7226238216
+要强 9.77354326693
+抵着 10.8561552143
+庞培 10.7226238216
+葡萄园 8.85725253506
+齐聚 10.0088573539
+手足异处 13.900677652
+大力支持 8.80081122415
+桡动脉 13.2075304714
+吃白饭 12.2912397395
+开沟 10.6818018271
+触摸 9.22784881751
+丁女 11.598092559
+葡萄酒厂 11.9547675029
+十八名 12.5143832909
+回溯 10.765183436
+三十万元 13.2075304714
+益气汤 11.1280889297
+讥嘲 12.5143832909
+浓妆 11.598092559
+图集 10.8096351986
+宝塔 9.45802639549
+世界语 11.4157710022
+底泥 12.1089181827
+都统叶 13.2075304714
+哈宁昆 13.2075304714
+新视野 13.900677652
+哗众 13.900677652
+华友 11.598092559
+前一阵子 9.80633308975
+斗批改 12.1089181827
+叶面施肥 13.900677652
+挺直 9.02548032877
+生命危险 9.14708746087
+审处 13.2075304714
+消毒药水 13.900677652
+单株选择 13.900677652
+叫苦 9.29550746599
+咬字 11.4157710022
+郎当 11.8212361103
+丁夫 12.1089181827
+裂殖 11.9547675029
+聪敏 9.89334446674
+第一一八回 13.2075304714
+功亏一篑 10.4666904475
+玉檀努 13.2075304714
+叔侄 9.77354326693
+六十二代 13.900677652
+领先于 9.38981814546
+御座 9.16447920358
+宝宝 7.83456956187
+宝官 12.8020653633
+立足 8.15447446144
+公正性 9.94943393339
+西魏均 13.900677652
+闲着 9.14708746087
+砖雕 10.5684731418
+温化寒 12.2912397395
+雷鸣 9.4233408375
+宝安 9.69598503258
+王曦 11.2616203224
+充分调动 10.4041700905
+戴去 13.2075304714
+十五亿美元 13.2075304714
+协办 9.89334446674
+郑俊怀 12.8020653633
+石头缝 11.1926274509
+发生炉煤 13.2075304714
+南陵县 12.8020653633
+逐队 13.2075304714
+苏常柴 11.4157710022
+御库 13.2075304714
+大众网 13.2075304714
+挥笔 11.0103058941
+达尔河 13.900677652
+塔奇拉 13.900677652
+只开 10.533381822
+御府 12.1089181827
+宝宫 13.2075304714
+互为补充 10.8096351986
+飞机票 10.8561552143
+马拉加 12.5143832909
+血府逐瘀汤 11.7034530746
+要不是 7.63537643924
+夏邑县 10.765183436
+结金兰 13.900677652
+只影 13.900677652
+冲天炮 13.900677652
+头像 9.53122979951
+叨叨 10.6818018271
+悬腕 11.9547675029
+大雨倾盆 11.0674643079
+回流 8.07173203437
+隋代皇帝 13.2075304714
+爆响 10.765183436
+白恩培 13.2075304714
+古典舞 10.7226238216
+电费 9.72629038208
+放任主义 12.8020653633
+电贺 13.900677652
+律例 10.2630914922
+只录 13.900677652
+何授丁 13.2075304714
+拉米罗 13.2075304714
+只当 8.56795885871
+编码标准 13.900677652
+大理岩 9.89334446674
+榆林人 13.2075304714
+冲天炉 12.2912397395
+达尔泰 13.900677652
+许靖 12.2912397395
+天祚帝 9.74179456862
+马什哈德 11.4157710022
+乙腈 12.2912397395
+晋献公 11.1280889297
+吸吮 9.84023464143
+手少阴心经 11.7034530746
+投进来 12.1089181827
+大肆铺张 13.900677652
+法华省 13.2075304714
+倏忽 9.96885201925
+乌姆盖万 13.900677652
+草泥马 13.2075304714
+惟我独尊 12.2912397395
+田土顷 13.2075304714
+列祖列宗 10.4349417492
+姚薇元 13.2075304714
+轮演 12.2912397395
+开了花 10.8561552143
+只得 6.33955606245
+朱标 13.2075304714
+四胎 13.2075304714
+回涨 12.8020653633
+黄沙滚滚 13.900677652
+聪明 7.31588625959
+汤飞凡 12.5143832909
+闫家 13.900677652
+巴龙霉素 13.900677652
+公子王孙 11.7034530746
+只待 9.16447920358
+纽约港 11.9547675029
+国家集训队 11.9547675029
+只征 12.2912397395
+代天父 12.2912397395
+达尔汉 13.900677652
+冷嘲热讽 10.7226238216
+处罚权 12.8020653633
+兰香 8.56795885871
+悬臂 10.2117981979
+宝子 13.2075304714
+杀进来 12.2912397395
+宗设格 13.2075304714
+黄得功 10.6818018271
+细纱机 12.2912397395
+立起 9.91169360541
+埃尔埃斯 13.2075304714
+乙脑 12.1089181827
+秦商鞅 11.7034530746
+治疗仪 12.5143832909
+宁德市 11.598092559
+达尔汗 12.5143832909
+马嘶声 12.1089181827
+玉树县 11.1280889297
+水岸 11.1926274509
+旁门 11.3357282945
+十八块 11.9547675029
+木骨 11.598092559
+大大提高 8.37921673411
+玛瑙石 12.8020653633
+节奏快 11.9547675029
+滴管 13.2075304714
+不到长城非好汉 13.2075304714
+滑脱效应 13.900677652
+乌兰县 12.1089181827
+语文 9.33632946051
+大理州 11.5027823792
+偏东北 12.8020653633
+律令 9.63799777493
+锯过 13.2075304714
+回民 9.48183704418
+谄谀 12.1089181827
+只帮 13.2075304714
+防腐剂 9.54396882529
+转道 10.6818018271
+往后仰 12.1089181827
+文城 13.2075304714
+只带 9.26594866375
+语料 13.900677652
+紧急处分 13.900677652
+富豪统治 13.2075304714
+急惊风 12.8020653633
+银本位 11.4157710022
+烟管 11.2616203224
+牙周病学 13.2075304714
+一十二员 12.2912397395
+二弟 9.91169360541
+报馆 10.4994802703
+回水 10.6818018271
+肯尼亚共和国 13.2075304714
+相互连接 10.642581114
+乙胺 11.9547675029
+子梁 12.5143832909
+杨梅汁 13.2075304714
+机械零件 10.3453295905
+巴托夫 13.900677652
+沈丘县 13.2075304714
+滴答 10.9049453784
+头冠 12.5143832909
+抗癌性 13.900677652
+丁宁 11.1926274509
+齐克新 12.8020653633
+绒花 10.9562386728
+转送 10.9049453784
+公孙弘 11.598092559
+省事 9.10488710638
+水岩 11.9547675029
+进进退退 13.2075304714
+五六份 13.900677652
+出一头地 13.900677652
+高研文 11.9547675029
+回汉 11.9547675029
+信息资源管理 13.2075304714
+转递 11.7034530746
+文垂 11.4157710022
+黄琼 12.8020653633
+产业化 8.02014466558
+转速 8.51618258919
+省些 11.0674643079
+黄大仙姑 12.8020653633
+性药物 12.5143832909
+省产 13.2075304714
+现代史 10.8561552143
+雄性 8.60236028543
+拜来拜去 13.900677652
+省亲 10.3453295905
+产业区 11.7034530746
+货柜船 13.2075304714
+丁家 11.9547675029
+辛元植 13.2075304714
+刘金平 13.900677652
+商量余地 12.2912397395
+王老汉 11.8212361103
+各有所得 13.2075304714
+攻陷 8.27666014579
+科尔劳 13.2075304714
+管理工作 8.9519177616
+杀人罪 11.8212361103
+兄弟阋墙 12.8020653633
+现代化 6.74216365465
+缓解 6.70774343076
+奥罗宾 12.8020653633
+丁字 10.4666904475
+格鲁克 11.5027823792
+远望号 13.900677652
+五六个 9.11318590919
+科尔努 13.2075304714
+马鬃 10.8561552143
+都统军 11.1926274509
+砖面 13.900677652
+防城港 11.1926274509
+乡级 11.598092559
+经脉 9.25628675283
+只应 11.3357282945
+语支 9.82314020807
+方弱冠 13.900677652
+奠祭 12.8020653633
+以右 11.0103058941
+五六万 11.0674643079
+紧巴巴 13.900677652
+巨额存款 13.2075304714
+马拉博 12.5143832909
+粉沙 11.7034530746
+攻防 10.0940151622
+省下 10.1871055853
+华原 12.1089181827
+初进宫 12.8020653633
+民主政体 10.4666904475
+下级机关 13.900677652
+方拱乾 12.8020653633
+畸胎 11.2616203224
+十五六门 13.2075304714
+清江浦 10.9562386728
+面色 7.95003509939
+兰馨 13.2075304714
+蛮劲 12.2912397395
+范爱伦 13.2075304714
+家有家规 12.1089181827
+正心诚意 12.1089181827
+灌流 12.2912397395
+省中 13.2075304714
+头关 13.900677652
+图钉 11.7034530746
+粉沫 13.900677652
+生忌 13.2075304714
+文圣 13.900677652
+如梭 11.5027823792
+邙山 9.91169360541
+机器语言 10.9049453784
+回波 10.3453295905
+赵阎王 12.5143832909
+浓密 9.15574552361
+收兵 8.98069672615
+技巧运动 11.9547675029
+尚衣局 12.5143832909
+玉兰片 11.598092559
+铜合金 10.533381822
+致命性 11.3357282945
+除丧 13.900677652
+宛娘 10.3743171274
+劳累过度 11.0674643079
+李公麟 10.7226238216
+黄大仙庙 10.7226238216
+韩朋赋 13.2075304714
+立论 10.2117981979
+哈姆拉 13.2075304714
+上玉帝 12.5143832909
+延长 7.02029356979
+面薄 13.2075304714
+丽雅 12.5143832909
+司可巴 13.900677652
+只够 10.1630080337
+信德府 12.5143832909
+主观唯心 12.8020653633
+回款 10.9049453784
+现代科技 10.8096351986
+夜归人 12.5143832909
+三十八文 13.900677652
+对望 9.7898037878
+慎之 11.598092559
+吸力 10.5684731418
+刘博文 12.1089181827
+大流士 10.5684731418
+寻求知识 13.900677652
+科学论证 11.8212361103
+雄杰 13.2075304714
+问东问西 11.9547675029
+只好 5.68431931959
+明军望 13.2075304714
+酒鬼 10.1630080337
+厅局级 11.0103058941
+当一天和尚撞一天钟 13.900677652
+三维光栅 13.900677652
+施蒂里 13.2075304714
+罗廖夫 12.1089181827
+立说 11.5027823792
+别傻 12.5143832909
+丁岚 13.900677652
+射不出 13.900677652
+闻公 12.1089181827
+搬运法 12.5143832909
+沉降 8.76487921493
+许配 10.765183436
+台北医学 13.900677652
+介弟 12.8020653633
+山延历 13.2075304714
+蠲除 13.2075304714
+轰鸣 9.21854642485
+大幅度 6.88317150903
+平假名 13.2075304714
+闻兄 13.2075304714
+宇亮 13.900677652
+王刘恒 13.900677652
+吃馆子 12.5143832909
+高空作业 13.2075304714
+不动情 12.8020653633
+小伙伴 11.1280889297
+印盖 13.2075304714
+贪污受贿 10.8096351986
+演讲人 13.900677652
+雨来 10.4666904475
+康泰 10.6818018271
+吸到 11.4157710022
+书箱 12.2912397395
+抵牾 11.8212361103
+无牙颌 13.900677652
+撒泼放刁 13.900677652
+四肢 7.61467955747
+除了 5.15332557435
+不谓 13.2075304714
+电请 12.2912397395
+赋予 7.62028181302
+赋于 12.5143832909
+保卫战 9.36807815882
+刘金妹 13.900677652
+转韵 12.8020653633
+转音 11.1280889297
+四亿五千万 13.900677652
+美容品 12.5143832909
+都统国 13.2075304714
+布拉克 11.1926274509
+李势兵 13.2075304714
+除以 8.70772080109
+十八具 13.900677652
+西魏军 11.598092559
+贝伦迦尔 13.900677652
+韩王山 13.2075304714
+傅承义 13.2075304714
+王朝末 11.9547675029
+宽进严出 13.900677652
+神秘岛 12.8020653633
+国际背景 12.5143832909
+国防工业 9.28555713513
+特价机票 10.9049453784
+哈克贝 11.9547675029
+无则加勉 12.2912397395
+管鲍分金 13.900677652
+电讯 9.4233408375
+可能性 6.02441876967
+十八元 13.2075304714
+接棒 10.533381822
+语笑喧阗 13.900677652
+丁尼 12.2912397395
+精妙绝伦 13.2075304714
+抢银行 12.8020653633
+奢靡浪费 13.900677652
+柏克莱 11.7034530746
+无敌于天下 11.3357282945
+行将灭亡 11.7034530746
+终不然 11.7034530746
+矢石 10.2117981979
+图鉴 12.5143832909
+女人性 13.2075304714
+宝岛 9.77354326693
+廖氏 12.1089181827
+康海 11.5027823792
+吸去 12.2912397395
+博士学位 7.07630398193
+头型 11.1280889297
+单身生活 13.2075304714
+赵友钦 13.900677652
+卅日 13.2075304714
+调三窝四 13.900677652
+恣意妄为 12.5143832909
+许逵 13.2075304714
+大理寺 9.5062284973
+铃子 12.2912397395
+转院 10.604840786
+贵客临门 13.2075304714
+拽起来 11.5027823792
+井灌 11.1926274509
+战雷 13.2075304714
+叨咕 11.7034530746
+立誓 10.5684731418
+丁巳 12.8020653633
+缓冲溶液 12.1089181827
+盾牌 9.85762638414
+文凭 9.89334446674
+不近 10.8096351986
+宝岩 12.2912397395
+上升时 10.765183436
+盾片 10.8561552143
+爆发 5.92202392289
+蓝飞 8.56795885871
+加紧脚步 13.900677652
+每格 13.900677652
+头城 12.1089181827
+慈至恕 12.8020653633
+昌道端 13.2075304714
+都凉 10.5684731418
+法庭 7.72897705456
+潘独鳌 9.93038573842
+仙术 11.8212361103
+龙潭湖 12.2912397395
+亲属制度 12.8020653633
+至大 9.75754292558
+理入 13.900677652
+馥郁 10.4994802703
+保安团 9.87532596124
+从根本上 7.82993992397
+转阴 10.604840786
+滨湖区 12.8020653633
+还款法 12.1089181827
+恶毒攻击 12.5143832909
+引气 12.5143832909
+许道 12.1089181827
+吸取 7.96843246453
+王晶 10.0294766411
+闻玄德 11.9547675029
+宛宛 13.900677652
+御夫 13.2075304714
+体格检查 10.1164880181
+生物陶瓷 12.1089181827
+自动关机 13.2075304714
+于厂卫 13.2075304714
+陈思思 12.1089181827
+于斯 11.0103058941
+濒于绝种 12.8020653633
+文光 13.900677652
+文具 8.56795885871
+焦脆 13.2075304714
+立言 11.0103058941
+操作程序 11.8212361103
+灌洗 11.9547675029
+南北部 11.9547675029
+塞蚊亚 13.900677652
+纳希切万 13.2075304714
+文典 13.2075304714
+新窗口 12.8020653633
+蝎毒 12.8020653633
+文公 10.8096351986
+趴下去 11.7034530746
+违禁品 12.1089181827
+零售价格 9.19114745066
+环境标准 11.9547675029
+延钧 13.900677652
+首要条件 11.1926274509
+盾状 11.1926274509
+绿肥作物 11.2616203224
+仙果 11.598092559
+美国商会 11.8212361103
+克孜勒苏 12.1089181827
+看病贵 11.0103058941
+聪慧 9.40086798165
+短纤维 10.3743171274
+麦克林斯 13.2075304714
+宝山 9.61021821083
+柳芽 13.2075304714
+刑名 10.0940151622
+曾谏阻 12.5143832909
+机灵鬼 12.1089181827
+赔笑 9.53122979951
+拍法 12.8020653633
+柳芳 12.8020653633
+八面威风 12.5143832909
+社委会 13.2075304714
+袁正林 13.900677652
+赛博数码 13.2075304714
+左躲右闪 11.8212361103
+挨骂 10.2630914922
+磁带驱动器 13.2075304714
+吸储 12.5143832909
+挨饿 10.0720362555
+五百件 13.2075304714
+第四十四章 11.2616203224
+叶防己 12.8020653633
+法华玄 12.2912397395
+酗酒 9.36807815882
+桓霭 12.1089181827
+酒饭 9.85762638414
+挺然 13.2075304714
+中山市 10.0505300503
+才貌 11.4157710022
+雾化器 12.1089181827
+戗脊 13.2075304714
+干涉内政 12.1089181827
+毁损 11.1280889297
+吸收截面 12.1089181827
+安贞 13.2075304714
+波兰共和国 11.8212361103
+左军来 13.2075304714
+北京大学第三医院 12.8020653633
+乌兰图 12.8020653633
+转销 11.8212361103
+圈养 10.5684731418
+海外侨胞 10.9049453784
+木螺钉 13.2075304714
+七十二座 12.8020653633
+有心人士 13.900677652
+牺牲生命 12.2912397395
+只学 12.8020653633
+好强 11.3357282945
+下颌牙 11.8212361103
+态度改变 13.900677652
+格伦瓦尔 13.900677652
+白鸥 11.7034530746
+立见 12.8020653633
+干杯 9.94943393339
+席卷天下 13.2075304714
+丁度 12.2912397395
+贼性 11.8212361103
+弹性系数 11.9547675029
+只字 11.7034530746
+玉凤瞅 13.900677652
+徐氏美 13.900677652
+氟化氢 10.533381822
+白鸡 12.2912397395
+西面 8.60236028543
+语态 11.9547675029
+主导产品 9.66657114738
+百十年 11.8212361103
+经营 5.32408411728
+晋升为 9.59661255877
+有光纸 13.2075304714
+夏恂 13.900677652
+炉头 10.8096351986
+不知廉耻 12.5143832909
+头名 10.533381822
+洛浦县 13.2075304714
+电视 7.02441304008
+刘注 13.900677652
+浓度 7.60356833204
+自然人 7.94484028251
+产业园 9.61021821083
+人大常委会法工委 13.900677652
+只定 13.900677652
+龙介虫 12.8020653633
+权制 13.900677652
+转门 13.900677652
+七匹狼 11.3357282945
+弗朗西斯 10.9562386728
+肛管 11.8212361103
+如愿以尝 13.900677652
+图里 11.4157710022
+络离子 12.1089181827
+高成好 13.2075304714
+从江 11.0103058941
+何兹全 12.1089181827
+非报不可 13.900677652
+戴圣 12.1089181827
+电解 8.90346537821
+珠贝 11.7034530746
+甲状软骨 12.8020653633
+赫歇尔 10.8561552143
+壮美 11.0103058941
+雄文 12.2912397395
+千千万万个 11.9547675029
+捐款 8.75318317516
+文则 12.2912397395
+今民 13.900677652
+游艺 10.8561552143
+锥形瓶 13.900677652
+公孙康 12.1089181827
+古文学 11.8212361103
+挥翰 13.900677652
+流亡者 10.9562386728
+大地春回 13.900677652
+约计 11.3357282945
+五秒 13.2075304714
+敞车 12.8020653633
+酒香 10.0940151622
+安达市 11.9547675029
+酒馆 10.1394775363
+拉开档次 13.2075304714
+额伦特 12.8020653633
+西非 8.85082164473
+维斯瓦 12.8020653633
+拱手相让 10.9562386728
+大中企业 11.9547675029
+懦弱 9.25628675283
+闻到 8.55834340001
+病痛 10.0294766411
+宝库 8.91707103027
+宋王弼 13.2075304714
+特攻队 13.900677652
+索溪峪 12.1089181827
+拆迁 7.75864024639
+宝庆 10.8561552143
+大溪地 13.900677652
+拆过 12.8020653633
+备尝艰苦 13.2075304714
+旁通 12.5143832909
+文友 12.8020653633
+苏苏人 12.8020653633
+文号 12.1089181827
+珠江口盆地 12.2912397395
+宝康 10.7226238216
+布拉加 12.8020653633
+文史 9.18217878068
+丁忧 11.0103058941
+爆冷 13.2075304714
+拂袖 10.4349417492
+教坏 12.2912397395
+寡情薄义 12.8020653633
+秀俊 13.900677652
+宝座 8.38322475551
+庞公 13.900677652
+电表 10.2371160058
+赞比亚共和国 13.900677652
+石化总公司 13.2075304714
+布税议 13.2075304714
+回校 11.0103058941
+八音迭奏 13.900677652
+新纳粹 13.900677652
+丁征 12.1089181827
+统计分析 9.96885201925
+乌尔都文 13.2075304714
+骁将 10.604840786
+做礼拜 11.5027823792
+铁画银钩 13.2075304714
+利而利 13.2075304714
+自有妙计 13.2075304714
+和阗玉 13.2075304714
+茶叶末 12.1089181827
+经济周期 8.65365357982
+廖湛 12.8020653633
+有别于 9.36807815882
+显要位置 12.5143832909
+贾蓉方 12.8020653633
+宝廷 12.8020653633
+奉若神明 13.2075304714
+御寇 12.2912397395
+新华书店 10.8561552143
+呵呵 8.76487921493
+干支流 9.37888907493
+爆出 8.99540287354
+营销中心 11.2616203224
+车损险 12.1089181827
+监利县 11.598092559
+御寒 9.58318953844
+学校食堂 13.2075304714
+巍山县 13.900677652
+红得发紫 11.0674643079
+土地革命战争 9.82314020807
+回档 10.642581114
+沟床 12.2912397395
+桓隹 11.7034530746
+黝黑 9.48183704418
+危亡之际 13.2075304714
+桓隽 12.5143832909
+乌桕树 12.5143832909
+语意 10.7226238216
+叠氮 12.5143832909
+文博 10.4666904475
+怒吼声 11.8212361103
+文升 13.900677652
+宛如 9.12999302751
+打空 13.900677652
+千百万个 12.8020653633
+文协 12.1089181827
+文华 8.33999602096
+语感 12.1089181827
+手提袋 12.1089181827
+陈思成 12.8020653633
+蒙政制 13.2075304714
+文卷 11.2616203224
+两张牌 12.8020653633
+恶人先告状 12.8020653633
+漂白布 12.8020653633
+凸出去 13.900677652
+福厦 12.5143832909
+丁役 11.7034530746
+水泊梁山 11.7034530746
+非常丰富 9.61021821083
+爬虫类 11.8212361103
+磴口县 11.7034530746
+赔礼 11.3357282945
+陶瓮口 13.900677652
+推车人 13.900677652
+倪焕之 13.2075304714
+游荡 8.45825994145
+口说无凭 11.3357282945
+有家有口 13.2075304714
+吸入 8.63281949291
+急性肾炎 10.1394775363
+叶尼克 13.900677652
+马拉地 11.7034530746
+某种程度 8.24119543622
+上升期 10.2630914922
+满延津 13.900677652
+区分度 13.2075304714
+生活必需 12.5143832909
+恒瑞医药 10.1630080337
+吸光 11.5027823792
+极限法 13.2075304714
+两用机 13.900677652
+简图 11.4157710022
+普天之下 10.4994802703
+吸允 13.900677652
+十五六里 12.8020653633
+周国卿 12.1089181827
+桓雎 12.1089181827
+奥廖尔 12.8020653633
+鲜橙多 13.2075304714
+灌河 11.4157710022
+跟进 8.23425096386
+宾达 13.900677652
+奥多尔 11.8212361103
+许贡 12.5143832909
+跟近 13.900677652
+军士长 12.1089181827
+指数线 13.900677652
+爱理不理 11.1280889297
+退耕 11.3357282945
+甄应嘉 12.5143832909
+揭疮疤 13.900677652
+氮化 11.598092559
+回眸 11.1926274509
+面馆 11.8212361103
+经验 5.72260018813
+六十二场 13.2075304714
+后宰门 11.598092559
+雕画 13.900677652
+蓝青 13.900677652
+吸了 9.41204128224
+戊二醛 13.900677652
+面首 12.5143832909
+油光满面 12.8020653633
+无人迹 10.8096351986
+监理 9.30555780184
+基本常识 11.9547675029
+集中力量 9.71102290995
+开口子 11.2616203224
+准决赛 13.900677652
+整经机 13.2075304714
+叫魂 12.1089181827
+拍照 9.23723855786
+手机网 11.8212361103
+从犯 10.8561552143
+杜尔克 12.1089181827
+独立团 10.604840786
+洪峰流量 10.4666904475
+节奏 6.82317959841
+朽木不可雕 13.2075304714
+退职 10.4666904475
+工作手册 12.2912397395
+醲郁 13.900677652
+回着 12.2912397395
+互斥性 13.2075304714
+专制政体 11.7034530746
+二十六两卷 13.2075304714
+通海 10.2630914922
+变差 9.80633308975
+庞丽 13.2075304714
+三十八种 13.900677652
+深谋远虑 10.4041700905
+酒过三巡 10.4994802703
+马元义 12.8020653633
+庄稼院 13.900677652
+保卫组 13.900677652
+放空枪 13.900677652
+动枪 12.2912397395
+池州市 12.1089181827
+官西蒙 13.2075304714
+一百零三 11.598092559
+节妇 11.3357282945
+尊重群众 12.5143832909
+台糖公司 13.900677652
+阿尔费 12.8020653633
+转诊 11.0674643079
+祁氏 13.2075304714
+潜水镜 11.4157710022
+模式分析 12.1089181827
+二栋 13.900677652
+转译 10.8561552143
+戏迷 11.3357282945
+休闲活动 13.900677652
+宣谕本 13.900677652
+信用社 9.69598503258
+四会县 12.2912397395
+强制措施 9.75754292558
+科兰太 13.900677652
+司城子 12.8020653633
+退股 12.5143832909
+绵羊毛 13.2075304714
+誉称 11.598092559
+转语 12.5143832909
+白条鸭 12.5143832909
+古远 13.2075304714
+玉砌 12.1089181827
+转请 13.900677652
+那枝箭 11.5027823792
+润丝 13.900677652
+旁边 6.17138197767
+大半天里 13.2075304714
+那针儿 13.900677652
+劳工 9.00283785202
+立面 10.9049453784
+益气生 13.2075304714
+载舟 12.2912397395
+许路 13.2075304714
+兴亡史 12.8020653633
+本网页 13.2075304714
+分身无术 13.2075304714
+怎能不 9.40086798165
+杰明街 11.8212361103
+马上笑 11.9547675029
+经济交往 11.5027823792
+顺利实现 10.7226238216
+游鱼 10.4041700905
+困扰 7.84155445639
+面饼 10.4666904475
+脚尖 9.61021821083
+八对 12.8020653633
+从父 10.8561552143
+旅游点 9.54396882529
+王重荣 13.2075304714
+颇深 10.0088573539
+气站 11.2616203224
+转议 13.900677652
+三三 12.2912397395
+古拉蒂 13.2075304714
+孰是孰非 11.5027823792
+引进设备 13.900677652
+效忠国家 13.900677652
+录取率 12.5143832909
+制冰机 13.900677652
+金牛区 9.7898037878
+宇叔 10.8096351986
+敌舰 10.8561552143
+黑回绒 12.8020653633
+许谦 12.1089181827
+货郎儿 13.900677652
+苣荬菜 13.900677652
+坐山 13.900677652
+止血带 11.8212361103
+羞羞答答 11.1926274509
+库尔贝 11.5027823792
+阿莱曼 11.598092559
+一棍子打死 11.7034530746
+闲汉 11.0103058941
+语群 10.8561552143
+法定继承 11.1280889297
+粉白 11.7034530746
+改善服务 13.2075304714
+洱海 9.98865464655
+楚材 11.8212361103
+惴惴 10.7226238216
+原则立场 12.8020653633
+齐飞 11.4157710022
+面颊 8.80081122415
+拍马溜须 13.900677652
+萆薢 12.8020653633
+添兵减灶 13.900677652
+嗑瓜子 11.9547675029
+面颜 12.1089181827
+面额 10.0720362555
+林先生 11.0103058941
+大有文章 11.3357282945
+茎部 11.1280889297
+无神论者 10.604840786
+老松 11.7034530746
+热交换 10.6818018271
+立雪 13.900677652
+花粉症 11.1926274509
+胡吃海喝 13.900677652
+招做 12.2912397395
+劳尔 11.9547675029
+缺乏教养 13.2075304714
+自然光 11.2616203224
+霍家 12.8020653633
+打穿 12.5143832909
+各庄 11.4157710022
+除却 10.533381822
+闫京生 8.9519177616
+强化 6.67011449857
+宗图联 13.2075304714
+正弦曲线 13.900677652
+唐命云 13.2075304714
+一阵一阵 10.4994802703
+四十多门 13.2075304714
+童荐 13.2075304714
+第五十九章 12.8020653633
+喜信 12.5143832909
+丁有粮 13.2075304714
+售楼 9.58318953844
+叫驴 10.3743171274
+启东县 11.9547675029
+面食 10.2117981979
+粉瘤 13.900677652
+诺伊斯 11.8212361103
+叫骂 9.66657114738
+干坏事 10.4994802703
+变小 9.09665660724
+康涅狄格河 13.2075304714
+朝阳门 10.0505300503
+养伤 10.0720362555
+实体肿瘤 13.900677652
+泽克特 13.2075304714
+气度 9.55687223012
+聂庄村 13.900677652
+除去 7.8093677699
+龙驭上宾 12.1089181827
+变少 11.3357282945
+西南联大 10.1630080337
+经济成就 12.8020653633
+国家地震局 13.900677652
+速射 11.0103058941
+陪罪 12.2912397395
+叶剑英 9.7898037878
+孙殿英 12.8020653633
+刻镂 12.8020653633
+主义理论 12.8020653633
+受欢迎 8.59737274392
+迎春花 11.1926274509
+罐头食品 10.2371160058
+五六名 12.5143832909
+餐风宿水 12.1089181827
+立院 13.900677652
+青脸儿 12.1089181827
+光路图 13.900677652
+变局 10.9562386728
+文笔简洁 12.5143832909
+维斯比 11.7034530746
+游下来 13.900677652
+赔本 10.604840786
+身体健壮 11.8212361103
+三四遍 13.2075304714
+锯错 13.900677652
+只争朝夕 11.8212361103
+查觉 13.2075304714
+瘿瘤 12.5143832909
+金亭馆 12.1089181827
+吹毛求疵 11.7034530746
+吸住 10.1630080337
+康马县 13.900677652
+曹兵围 12.8020653633
+节士 13.900677652
+谨守 10.533381822
+吴晗译 13.2075304714
+跟踪 6.86540905269
+律吕 11.0103058941
+粉皮 11.9547675029
+姜白石 13.2075304714
+脍不厌细 13.900677652
+蒙文名 12.8020653633
+康熙 7.15661846566
+应名点卯 13.900677652
+电镜 11.7034530746
+礼花 11.5027823792
+食肉寝皮 13.2075304714
+电镐 13.900677652
+省城 7.94484028251
+哗哗 8.82550383674
+有害生物 11.5027823792
+烈日当空 12.8020653633
+文仁 13.900677652
+朱家寨 10.5684731418
+电镀 9.84023464143
+康特 12.8020653633
+赋值 9.74179456862
+文件 6.16175389454
+劳役 9.17328983326
+咨询部 11.2616203224
+攻进 10.1164880181
+宋兵果 13.2075304714
+遮风挡雨 11.5027823792
+回电 11.5027823792
+毕其功于一役 11.5027823792
+回用 12.5143832909
+高祖父 13.2075304714
+深获好评 13.900677652
+攻过 11.9547675029
+白明川 9.75754292558
+救生舱 12.8020653633
+劳形 13.900677652
+六街三市 11.1280889297
+一个几岁 13.2075304714
+景美 12.8020653633
+文仪 12.8020653633
+篝火 9.28555713513
+救生艇 9.77354326693
+成分表 13.2075304714
+虎伏 12.5143832909
+沦落 9.55687223012
+机票代理 12.5143832909
+节子 12.8020653633
+鲜灵灵 13.2075304714
+大鼎 11.0103058941
+脚底 9.27570483869
+原则同意 10.8096351986
+已有近 10.2630914922
+文事 11.7034530746
+科学院 7.52395070408
+路肩 12.8020653633
+变快 12.1089181827
+杜尔卡 13.2075304714
+敖汉旗 11.7034530746
+暗藏杀机 12.5143832909
+高房价 8.62767809341
+吃得饱 10.3743171274
+列方程 13.2075304714
+比雪夫 11.9547675029
+山荆子 13.2075304714
+文人 7.91422564669
+开口处 11.1280889297
+退色 10.8561552143
+电锯 12.2912397395
+电键 11.9547675029
+陪你走 12.5143832909
+杂草丛生 10.765183436
+生活型谱 13.900677652
+一会家 12.8020653633
+语系 8.05713323494
+那曲镇 13.2075304714
+自然力 9.65218240993
+中电联 12.8020653633
+与狼共舞 13.2075304714
+中国京剧院 12.1089181827
+服装集团 13.900677652
+变异 8.23771717184
+谢万谢 12.8020653633
+变弄 13.900677652
+延误 9.31571017331
+悬首 12.2912397395
+华兰 8.73589167805
+残稿 13.900677652
+转角 10.3743171274
+抑制作用 9.23723855786
+毅力 9.22784881751
+延请 10.6818018271
+劳心 10.533381822
+法力无边 11.9547675029
+文义 11.7034530746
+埃尔帕索 13.2075304714
+倔强地 10.604840786
+初级小学 12.2912397395
+小岩 12.5143832909
+力回馈 13.900677652
+许茂 12.2912397395
+小二哥 11.0674643079
+报考 8.95903522937
+变强 11.2616203224
+文书 7.26210986281
+甘聚糖 13.900677652
+电门 12.8020653633
+电闪 11.0103058941
+直觉性 13.2075304714
+变弱 11.4157710022
+齐魏 13.2075304714
+兴奋点 9.96885201925
+不仅仅 7.17324592712
+黄堡镇 13.2075304714
+温经通 12.1089181827
+文丑 10.533381822
+乱乱的 12.2912397395
+自成一体 10.9562386728
+毅勇 12.5143832909
+可锻铸铁 12.5143832909
+文丛 11.9547675029
+酒肉和尚 13.900677652
+劳律 13.2075304714
+闻信 12.8020653633
+诺伊曼 10.2117981979
+关岭布依族苗族自治县 13.2075304714
+文丁 12.1089181827
+文一 13.900677652
+沈沈叫 13.2075304714
+杨梅疮 13.2075304714
+赤诚相待 13.2075304714
+财务报告 10.0720362555
+皇甫惟明 12.8020653633
+联动机制 9.63799777493
+水电站 7.87723005901
+王世襄 12.5143832909
+总编辑 8.97342396682
+变形 7.68207753228
+文举 11.5027823792
+文丽 13.2075304714
+跟贴 12.8020653633
+劳德 12.2912397395
+灌水 9.98865464655
+旁路 11.598092559
+服装品牌 12.1089181827
+省地 11.2616203224
+琥珀酸 11.7034530746
+文中 8.93783302172
+玉兰油 12.1089181827
+仔鱼 11.0103058941
+宋江合 13.2075304714
+乐平 10.533381822
+特派记者 11.3357282945
+转行 10.8561552143
+千千万万只 13.2075304714
+自然化 12.8020653633
+整合系统 12.8020653633
+脚心 10.6818018271
+黄晓明 9.12155415886
+瞎吹 11.4157710022
+十八亩 13.2075304714
+王楠 11.2616203224
+不言而喻 8.67493097826
+威斯敏斯特 10.4349417492
+图象 11.1280889297
+冲去 9.45802639549
+塘栖 11.8212361103
+瞎吵 13.900677652
+西魏之 13.2075304714
+钦赐 10.3453295905
+霍姆 11.2616203224
+中华文化 10.0940151622
+交换式 13.900677652
+小岳 12.2912397395
+忙这忙那 12.5143832909
+马铁 12.8020653633
+叶琳娜 13.900677652
+维亚康姆 12.1089181827
+耶律履 13.2075304714
+水化 11.0103058941
+游龙 11.2616203224
+社保局 10.4666904475
+王大哥 11.598092559
+周礼难 13.2075304714
+刘郁 12.8020653633
+堂堂一表 12.5143832909
+明禅师 13.900677652
+壮戏 13.2075304714
+图谱 9.84023464143
+斯托克 10.604840786
+回味无穷 11.1926274509
+图谶 10.1871055853
+监督 6.61106713052
+挪威语 12.2912397395
+抵消 8.11378027061
+审官 12.8020653633
+十八代 12.8020653633
+拍片 9.7898037878
+闻乐 13.900677652
+乙硫醇 13.900677652
+迪牙 13.900677652
+挥手 7.73736284794
+戏谈 13.2075304714
+假名托姓 12.5143832909
+闲游 11.8212361103
+五六回 13.2075304714
+塘桥 13.2075304714
+图谋 8.81927328699
+沈阳飞机制造公司 13.2075304714
+文侯 11.9547675029
+可耕地 9.56994431169
+戏谑 10.0088573539
+隋五朝 12.8020653633
+奥马哈 11.4157710022
+悬颅 13.900677652
+文体 8.9102450652
+闻人 11.0103058941
+白腿子 13.2075304714
+十八个 10.2630914922
+卡廷 13.2075304714
+仙人庄 12.8020653633
+作坊式 11.7034530746
+南兴镇 13.900677652
+含水率 11.7034530746
+自然历 12.2912397395
+除冰 11.4157710022
+十八两 12.1089181827
+哗啦 10.0505300503
+霍奇 12.8020653633
+杜尔加 13.900677652
+电铸 12.8020653633
+引领而望 13.900677652
+玛特拉 13.2075304714
+脚形 12.1089181827
+大名鼎鼎 9.54396882529
+十二级 12.5143832909
+窄窄的 10.5684731418
+十八万 12.5143832909
+小康之家 11.3357282945
+退行性 10.533381822
+电钟 12.8020653633
+鼓吹者 11.9547675029
+同文 13.2075304714
+文伟 12.8020653633
+当啷 10.8096351986
+碗里 12.5143832909
+霍夫 10.2117981979
+变幅 9.6811699468
+纳尔维 12.2912397395
+言颂诗 13.2075304714
+公之才 13.2075304714
+电针 11.9547675029
+荣成湾 13.2075304714
+联合共和国 11.598092559
+挥拳 11.1280889297
+收税员 13.2075304714
+辽宁省 8.24468584116
+完结篇 13.900677652
+连崇祯 13.900677652
+展开部 13.2075304714
+电钻 13.2075304714
+能预卜 13.900677652
+自然史 10.765183436
+强压 10.2897597393
+康王 9.69598503258
+库尔迪 13.900677652
+阿李朵 13.2075304714
+变幻 9.5062284973
+罗布淖尔 11.9547675029
+电钮 11.9547675029
+点着头 9.25628675283
+文传 13.2075304714
+文伯 12.8020653633
+滚存 11.7034530746
+士力架 13.900677652
+总结会 13.900677652
+韦斯尔 13.900677652
+天下归心 11.8212361103
+一两句话 11.1926274509
+内容摘要 11.5027823792
+农技 11.8212361103
+市中心 8.26232298264
+康明逊 10.2117981979
+打吊瓶 13.900677652
+亢阳 13.900677652
+阿伊努 10.765183436
+省减 12.8020653633
+据为己有 10.1394775363
+演艺圈 10.642581114
+王季思 13.2075304714
+酒药 13.900677652
+戴月披星 13.900677652
+湖内 10.4349417492
+转车 13.2075304714
+先调 13.900677652
+陈式来 13.2075304714
+头人 9.69598503258
+化学纤维 9.71102290995
+天祥 10.9562386728
+陈嘉庚 10.9562386728
+葡萄酒业 11.598092559
+转轨 9.82314020807
+心猿意马 11.3357282945
+从盘 11.9547675029
+转轴 10.0720362555
+黑松林 11.598092559
+四十两 11.598092559
+马凤仪 13.2075304714
+龙口市 11.9547675029
+孕妇 7.84155445639
+转载 7.89432449237
+赊卖 12.2912397395
+山灵 12.8020653633
+省内 7.60910851242
+婴儿 7.52565283215
+线路板 11.7034530746
+三五里 11.7034530746
+澄净 11.8212361103
+团弄 11.9547675029
+叠石 11.7034530746
+宾语 10.533381822
+劳复 11.1926274509
+列克星顿 13.900677652
+主导产业 10.604840786
+花粉热 13.900677652
+曹明济 11.9547675029
+乔二爷 10.3743171274
+扬甘杰 13.900677652
+醛类 11.4157710022
+英模事迹 13.900677652
+胆红素 10.5684731418
+平等权利 10.8096351986
+系统故障 10.4666904475
+吉安市 11.4157710022
+太康伯 13.2075304714
+逐行 12.8020653633
+普伊格 12.8020653633
+转过 7.20364340431
+迦纳 11.9547675029
+中共中央党史研究室 11.9547675029
+壮族 9.21854642485
+挥斥 13.2075304714
+米尔福德 13.2075304714
+图说 10.2897597393
+赶进来 13.2075304714
+变多 11.9547675029
+帕勒 12.8020653633
+浪子宰相 12.2912397395
+头上 6.35528790236
+柳林县 12.8020653633
+于诸公 13.900677652
+戏说 12.1089181827
+外汇网 12.5143832909
+测绘员 13.2075304714
+戏词 13.2075304714
+变天 10.5684731418
+朱家宝 13.900677652
+酒菜 9.53122979951
+抵押权 11.1926274509
+北京广播学院 13.2075304714
+变大 9.46986085313
+驾回 11.3357282945
+泗水县 13.900677652
+头中 13.900677652
+老和尚 8.7245279194
+小影 13.900677652
+转述 10.1871055853
+回环 10.604840786
+过得硬 11.3357282945
+郑皇后 11.0674643079
+格尔塞 12.2912397395
+地矿 11.598092559
+旁证 11.5027823792
+沈云龙 12.8020653633
+图论 10.7226238216
+民为 11.9547675029
+变奏 11.598092559
+图记 12.1089181827
+输气量 12.8020653633
+卫星电视 12.8020653633
+转辗 12.2912397395
+科学部 11.598092559
+戏论 13.2075304714
+强行进入 12.5143832909
+农神节 13.900677652
+礼葬 11.598092559
+鸦胆子 12.5143832909
+于淳化 12.8020653633
+氨酰基 13.900677652
+情伪 13.900677652
+妄作 11.8212361103
+碰坏 11.8212361103
+五六元 12.1089181827
+变好 10.2117981979
+转达 9.27570483869
+兹事体大 12.1089181827
+十月初 10.1164880181
+经销点 13.900677652
+台木尔 13.2075304714
+青岛大学 11.8212361103
+酒色 9.89334446674
+有话要说 10.1871055853
+菲利克斯 10.642581114
+预示 7.60725837313
+切开术 11.1926274509
+粉牌 12.5143832909
+桓谭 11.0674643079
+金红利 10.1394775363
+管理科学 10.2117981979
+碾米厂 12.2912397395
+诸侯王 9.23723855786
+马放南山 12.5143832909
+哗变 9.36807815882
+毫无用处 10.4666904475
+叫鸡 13.900677652
+施雅风 12.2912397395
+三中 10.0940151622
+拍球 13.2075304714
+逛去 11.0674643079
+并茂 11.598092559
+无证无照 13.900677652
+官纳言 13.2075304714
+封闭性 10.3453295905
+男队员 12.8020653633
+非定常 11.598092559
+秦军射 13.2075304714
+婚托儿 13.2075304714
+大众性 12.8020653633
+录制 9.12155415886
+有增无减 9.71102290995
+玛曲 11.8212361103
+宏微观 12.8020653633
+挨个儿 10.6818018271
+许衡 10.7226238216
+麦角固醇 13.900677652
+几百海里 13.900677652
+南匈奴 10.0940151622
+洲际 9.33632946051
+学识上 13.900677652
+鲁特兵 13.2075304714
+马钢 10.4994802703
+带向 12.5143832909
+塘湖 12.5143832909
+军工厂 11.2616203224
+攻袭 11.598092559
+冯玉 13.900677652
+蒯大富 13.900677652
+碗面 11.4157710022
+许行 12.2912397395
+金手指 11.7034530746
+戏言 10.2117981979
+雷量 12.8020653633
+齐鲁 8.83177344976
+雷孝思 12.8020653633
+赔掉 12.1089181827
+康生 11.1280889297
+变声 12.1089181827
+九十万 12.2912397395
+慈悲心 13.2075304714
+深感不便 13.2075304714
+土穴 11.598092559
+塞舌尔共和国 13.2075304714
+退下来 9.93038573842
+仙翁 11.0674643079
+控制工程 11.1926274509
+除垢 12.1089181827
+同轴电缆 11.9547675029
+通过审查 12.8020653633
+头伏 11.4157710022
+童儿睡 13.2075304714
+收入者 12.8020653633
+残奥会 12.2912397395
+万人之敌 12.5143832909
+孕育出 11.5027823792
+祝宗卜 12.8020653633
+抵死 10.9562386728
+小写字母 12.2912397395
+叔叔 7.71036224612
+管理工具 11.8212361103
+拼写错误 12.8020653633
+陈嘉异 13.2075304714
+葡萄沟 12.8020653633
+温度计 9.77354326693
+百衲本 11.4157710022
+室管膜 12.5143832909
+是我太 12.2912397395
+张肃 13.900677652
+中文数字 12.8020653633
+酒花 10.9049453784
+熟视 11.9547675029
+景阳冈 10.604840786
+政治局面 11.1926274509
+堵胤锡 12.5143832909
+不顺心 10.2371160058
+木鳖子 13.2075304714
+迪瓦 12.5143832909
+宣至金 13.2075304714
+可食用 9.59661255877
+冯去疾 12.8020653633
+韦斯巴 12.8020653633
+杜尔哥 11.7034530746
+脚夫 10.5684731418
+持仓量 8.38322475551
+霍式 12.5143832909
+蒋光鼐 11.4157710022
+找出路 11.5027823792
+转身 6.58412947479
+粉状 10.0940151622
+长列 13.2075304714
+各指 13.2075304714
+敢收 12.5143832909
+旧石器 10.1394775363
+魏吴起 13.2075304714
+肝儿 12.8020653633
+现代资本 12.8020653633
+何可汗 13.2075304714
+桂元清 11.8212361103
+攻读 8.44535653662
+县政协 12.8020653633
+秦军弩 13.2075304714
+澄清天下 12.5143832909
+氢氧化物 10.2371160058
+霍峻 12.8020653633
+现代人 8.78868986362
+除名 10.5684731418
+专业书籍 13.900677652
+转发给 12.1089181827
+转赠 11.7034530746
+改革开放 7.83225206373
+程国祥 11.7034530746
+青年宫 12.8020653633
+转起 12.5143832909
+转赴 10.4349417492
+变容 11.8212361103
+转走 12.2912397395
+变宽 10.8096351986
+东非地区 12.2912397395
+奇形怪状 9.87532596124
+粉煤 12.5143832909
+过节费 12.5143832909
+省厅 11.3357282945
+收效甚微 10.5684731418
+对旋 12.8020653633
+节录 11.2616203224
+致富思源 13.2075304714
+攻讦 10.0720362555
+近三年 9.19114745066
+五六只 11.9547675029
+优胜者 10.642581114
+挤下 13.2075304714
+美容业 12.8020653633
+同等学历 13.2075304714
+拍着 8.75901409547
+苏云金 12.2912397395
+俄文版 11.9547675029
+挥杆 12.5143832909
+狂风怒号 13.900677652
+转贷 13.900677652
+转贴 11.7034530746
+治疗剂 13.2075304714
+组画 10.4666904475
+论坛精华 13.900677652
+主婚人 11.7034530746
+省去 9.48183704418
+章沁生 13.900677652
+温度表 11.0103058941
+才气纵横 13.900677652
+马拉亚 12.5143832909
+缬氨酸 12.1089181827
+粉未 13.2075304714
+吐谷浑 9.69598503258
+五六匹 13.2075304714
+剧里 13.2075304714
+林国祥 13.900677652
+节律 9.30555780184
+讲完 9.27570483869
+电量 9.36807815882
+迷魂阵 11.1926274509
+霍山 10.2117981979
+毅然决定 10.8561552143
+郁伟华 13.900677652
+图解 10.604840786
+塑料制品 10.2630914922
+藏胞 13.900677652
+天兴州 12.2912397395
+齐齐 9.49395840471
+相安无事 10.2630914922
+北京师范大学历史系 12.1089181827
+目无 11.1280889297
+强到 12.1089181827
+生产率 8.23425096386
+马拉之 12.5143832909
+懒鬼 13.900677652
+拆除 8.38322475551
+省却 11.0103058941
+伯爵夫人 11.3357282945
+王世贞 10.604840786
+省市区 11.4157710022
+初会盟 13.2075304714
+一夫一妻 10.9562386728
+观音院 11.7034530746
+延迟 8.81927328699
+监狱 7.79811905736
+泰姬陵 11.7034530746
+旁观 10.0720362555
+挨打受骂 12.2912397395
+动词变化 12.8020653633
+许询 13.2075304714
+台北市立 12.8020653633
+骨质疏松症 11.1280889297
+可延长 10.5684731418
+许诺 8.84443184663
+连一星 13.2075304714
+朱启钤 11.7034530746
+卫星电话 11.9547675029
+拆阅 13.2075304714
+翻盖式 13.900677652
+叶梦得 12.2912397395
+霍尼 13.2075304714
+捐献 9.4233408375
+观音阁 11.1280889297
+好色的人 13.900677652
+人穷志短 13.2075304714
+民俗 9.08039608637
+操作符 10.1164880181
+濯缨 13.2075304714
+女人篇 13.900677652
+劳宫 12.2912397395
+霍尔 9.29550746599
+五六千 10.9049453784
+耳挖子 13.900677652
+消防设施 11.9547675029
+扇骨 11.7034530746
+省区 8.0484751722
+泰勒斯 11.1926274509
+劳命伤财 13.2075304714
+立邦 13.900677652
+甩脱 10.765183436
+克佩勒 13.2075304714
+戏衣 12.1089181827
+金斯基 13.900677652
+图表 9.05649056552
+叔公 12.2912397395
+关平告 13.2075304714
+薄壁堰 13.900677652
+祖母 9.41204128224
+耳鼻喉科 11.4157710022
+罗佐夫 12.2912397395
+臻臻至至 13.900677652
+大是大非 10.9562386728
+齐黑 12.8020653633
+妖里妖气 12.2912397395
+骄傲感 12.8020653633
+花卉苗木 13.2075304714
+郝昭病 13.2075304714
+游击队员 9.7898037878
+茶叶罐 12.8020653633
+祈雨 10.604840786
+收弓 13.2075304714
+阶级分化 10.4349417492
+谱表 11.4157710022
+霍州 11.598092559
+亚视 13.900677652
+导游员 11.8212361103
+敦煌石窟 10.2371160058
+遗传信息 10.3453295905
+转调 10.5684731418
+电通 11.5027823792
+语种 10.2630914922
+全盘否定 11.3357282945
+余杭区 13.2075304714
+明夷待访 11.9547675029
+淫乐 10.8096351986
+回灌 12.8020653633
+利用自身 11.0103058941
+吕兴贵 11.2616203224
+开滦 9.82314020807
+南梆子 13.900677652
+拉塔基亚 11.9547675029
+珠链 12.8020653633
+铁木真 10.604840786
+零售点 13.2075304714
+寇边 12.2912397395
+合作愉快 12.2912397395
+保卫科 11.5027823792
+多四成 13.900677652
+赫尔墨斯 11.5027823792
+皮革厂 11.5027823792
+淫乱 9.89334446674
+省劲 12.2912397395
+蹄声 10.533381822
+鲫鱼 9.72629038208
+同等学力 12.8020653633
+郑周永 13.900677652
+初学者 11.4157710022
+凤城镇 11.9547675029
+节庆 9.96885201925
+舌状花 11.598092559
+柴米油盐 10.9049453784
+身体健康 8.99540287354
+节序 12.8020653633
+不能不要 12.5143832909
+从略 13.2075304714
+王光亚 11.3357282945
+回炉 11.2616203224
+安内攘外 12.2912397395
+磁路 11.0103058941
+王世谱 12.8020653633
+捐物 12.8020653633
+旋光性 10.4666904475
+节度 9.58318953844
+刘贯道 13.2075304714
+戏装 10.4994802703
+段飞离 13.900677652
+戴个 10.604840786
+福利金 12.5143832909
+淫亵 12.5143832909
+塘沽 9.87532596124
+谅山省 13.2075304714
+吱呀呀 12.5143832909
+打挺儿 13.900677652
+酒肴 10.4041700905
+牛黄丸 11.4157710022
+白色棉 13.900677652
+省分 12.2912397395
+财务会计 10.0940151622
+苏完 10.1164880181
+余杭县 11.8212361103
+马提尼克 11.1926274509
+齐鸣 9.80633308975
+挨肩 12.5143832909
+神后赫 11.9547675029
+无能之辈 11.598092559
+麻林迪 12.8020653633
+电邀 11.5027823792
+天真烂漫 10.7226238216
+戏袍 13.900677652
+旧体诗 10.9049453784
+道义责任 13.2075304714
+饵敌 13.2075304714
+游魂 11.3357282945
+伯申 12.8020653633
+二丁 13.2075304714
+皮肤过敏 11.1926274509
+塘泥 11.8212361103
+钱端升 12.5143832909
+酒肆 9.82314020807
+电邮 12.2912397395
+金融公司 9.89334446674
+即兴曲 11.598092559
+代王恒 13.2075304714
+走下坡路 10.1394775363
+叭儿狗 12.5143832909
+酒肉 9.17328983326
+挺棒 13.900677652
+逐词 12.5143832909
+楚君 12.5143832909
+盾板 12.8020653633
+小心 6.71680693691
+评议委员 11.8212361103
+宛丘 11.598092559
+叔平 12.2912397395
+哈喇子 11.9547675029
+稳定性 6.9431802811
+律己 11.8212361103
+清净寺 12.1089181827
+情侣 9.41204128224
+水勇 12.5143832909
+古交市 12.2912397395
+库乔 13.900677652
+思想丰富 13.900677652
+来回来去 12.8020653633
+花粉粒 11.5027823792
+三七二十一 12.5143832909
+挺有 10.8561552143
+看眼色 13.900677652
+杭州路 11.7034530746
+企业债券 9.19114745066
+书画艺术 12.1089181827
+毛子牌 13.2075304714
+滟滪 13.900677652
+闲散 9.56994431169
+拥戴者 13.2075304714
+魏延分 13.2075304714
+以柔制刚 13.900677652
+霍加 13.2075304714
+贝克韦尔 12.2912397395
+杜杲任 13.2075304714
+外汇率 11.9547675029
+退行 11.2616203224
+眉眼高低 12.5143832909
+长庚 11.598092559
+赶得及 13.2075304714
+筛选 8.59737274392
+梯思梯 13.900677652
+血雨腥风 11.598092559
+独立型 12.8020653633
+体细胞 9.6811699468
+网上支付 11.1926274509
+抱由镇 12.8020653633
+百感交集 9.93038573842
+救生衣 11.8212361103
+雄猫 11.8212361103
+退补 13.2075304714
+目次 13.900677652
+王朝玛 13.2075304714
+圈圈 11.0674643079
+延脑 12.8020653633
+时尚化 12.1089181827
+分公司 7.79143006921
+库尔蒂 12.8020653633
+梳过 12.8020653633
+始发站 12.1089181827
+新闻标题 13.2075304714
+易化 12.2912397395
+延至 9.38981814546
+讲寺 13.900677652
+起步晚 11.5027823792
+广温性 13.2075304714
+赤城县 12.8020653633
+安全局 10.765183436
+名师出高徒 13.2075304714
+闲时 10.2117981979
+志远 12.1089181827
+肚子饿 10.1871055853
+邱宝仁 13.900677652
+毛线衣 11.8212361103
+卢荣 13.900677652
+陌路相逢 13.2075304714
+优秀青年 11.7034530746
+淀粉质 12.8020653633
+理查森 11.3357282945
+迪福 12.2912397395
+零售网 13.900677652
+赫蒂布 12.2912397395
+艺术人体 13.900677652
+挨过 9.82314020807
+流鼻涕 10.7226238216
+百分之二 11.3357282945
+杨分任 12.8020653633
+挨边 12.2912397395
+吕宋岛 10.2371160058
+宝中之宝 13.900677652
+蒸压 12.8020653633
+调整法 12.8020653633
+东南欧 11.0103058941
+传谕 8.6803218269
+回翔 12.8020653633
+速归 12.8020653633
+那静如 13.900677652
+福临刚 12.5143832909
+九零 13.900677652
+面酱 12.5143832909
+攻击手 13.2075304714
+乐律 10.4994802703
+拟任 8.82550383674
+那王庆 11.8212361103
+忘神 13.2075304714
+度假区 11.4157710022
+瞎心 13.2075304714
+迪科 11.9547675029
+孝文帝 10.2897597393
+一岁一枯 13.900677652
+瞎忙 12.2912397395
+一会儿 6.1766729953
+尉迟胜 12.8020653633
+水性漆 13.2075304714
+一口钟 12.2912397395
+报告会 9.77354326693
+理路 13.2075304714
+盾构 9.66657114738
+圈地 8.9308643524
+爬起来 8.18694484647
+筛酒 10.642581114
+逛得 12.2912397395
+兰氏 11.9547675029
+专制主义 9.36807815882
+枝枝叶叶 12.8020653633
+齐郡 11.9547675029
+福晋陪 12.8020653633
+车辆厂 11.9547675029
+割剥元元 13.900677652
+初级产品 10.4666904475
+福临召 13.2075304714
+营山县 13.2075304714
+设陷井 13.2075304714
+三四品 12.5143832909
+引渡 10.4041700905
+反坦克雷 11.0103058941
+飞机库 13.2075304714
+宛似 12.8020653633
+实验舱 13.900677652
+核心内容 9.96885201925
+变咸 12.5143832909
+拍砖 12.8020653633
+延聘 11.5027823792
+钻眼 13.2075304714
+颖悟 11.4157710022
+全国政治协商会议 12.8020653633
+十亿分 12.2912397395
+帕萨特 10.533381822
+阳武县 13.2075304714
+节假 11.9547675029
+跑堂儿的 13.2075304714
+面部 8.06879517469
+宇宙 7.36834335975
+卡尔迈勒 11.598092559
+劳合 11.1926274509
+第五十七章 12.8020653633
+报请 10.0940151622
+辩才无碍 13.900677652
+熟稔起来 13.900677652
+凤儿 12.1089181827
+从简 10.7226238216
+六十二年 13.900677652
+库东 12.8020653633
+观堂 12.1089181827
+萨满来 12.2912397395
+指挥中心 9.75754292558
+以内 7.24138373229
+转舵 11.598092559
+倾斜政策 12.2912397395
+语石 12.5143832909
+劳特尔 13.900677652
+有增无已 12.8020653633
+究办 12.8020653633
+怪物 8.20358416547
+省局 11.7034530746
+沙坪坝区 11.7034530746
+脸上抹黑 11.4157710022
+库尔诺 12.2912397395
+报告书 9.20019728618
+私有化 9.65218240993
+随想录 13.2075304714
+张松涛 13.900677652
+语言文学 10.2630914922
+账表 13.900677652
+变向 12.2912397395
+除害 10.7226238216
+省属 10.642581114
+雄狮 10.3743171274
+裘甫 13.900677652
+和谐一致 12.1089181827
+语言文字 9.74179456862
+无法可想 12.2912397395
+天老爷 11.598092559
+父母之命 11.1280889297
+中国革命博物馆 12.1089181827
+孕吐 13.900677652
+硕鼠 10.9562386728
+茅沅 13.900677652
+前进方向 10.6818018271
+里佐夫 13.2075304714
+半壁江山 9.48183704418
+除官 13.900677652
+陈希烈 12.8020653633
+封资修 11.7034530746
+鄱阳湖自然保护区 13.2075304714
+回纥 9.82314020807
+瓦努阿图共和国 12.8020653633
+霍博 12.1089181827
+观赏园艺 12.8020653633
+纳尔瓦 11.7034530746
+钓鱼式 11.8212361103
+密集区 9.75754292558
+回绝 9.61021821083
+寝床 13.2075304714
+土木工程 9.45802639549
+三三行 12.8020653633
+吉安县 12.8020653633
+报警 8.36728816325
+回绕 11.9547675029
+加快脚步 9.98865464655
+小得 9.66657114738
+九十个 13.2075304714
+摆不下 11.8212361103
+撤标 13.900677652
+上百万 9.85762638414
+达尔罕 11.9547675029
+急转弯 11.5027823792
+封书子 9.61021821083
+宾虚 13.2075304714
+乃至于 10.642581114
+传播学院 13.2075304714
+粉线 13.900677652
+巴达维 13.900677652
+著作 6.28340983835
+挑刺儿 12.8020653633
+苑川郡 12.8020653633
+五六层 13.900677652
+俳句 11.598092559
+多国联军 12.8020653633
+变味 11.3357282945
+粉红 9.0884932966
+易发 11.0674643079
+挥棒 12.2912397395
+博览群书 10.1394775363
+省心 10.0940151622
+壮歌 13.2075304714
+物侯 13.2075304714
+刹那之间 10.765183436
+投运 10.9562386728
+无痛性 11.8212361103
+显而易见 8.50705010562
+噻嗪 11.4157710022
+融水苗族自治县 11.7034530746
+私刻 12.2912397395
+纵然能 11.5027823792
+大厂镇 11.9547675029
+半支莲 13.2075304714
+裘皮 10.533381822
+小房子 10.2117981979
+只会 7.57990935773
+闻明教 12.5143832909
+十字街 10.533381822
+御事 13.2075304714
+收徒 11.0103058941
+敲竹杠 11.7034530746
+回归系数 12.8020653633
+红菱 13.2075304714
+闲来 11.598092559
+游隙 13.900677652
+闻名全球 12.2912397395
+根本变化 10.1871055853
+售房 10.6818018271
+桓范 12.1089181827
+治疗师 13.2075304714
+沈士充 13.2075304714
+高颖 12.8020653633
+韦斯利 13.2075304714
+芮浚 12.8020653633
+交换器 13.900677652
+赋闲 10.5684731418
+持续上升 8.87023973058
+经部 12.1089181827
+青年城 13.2075304714
+西番莲 11.7034530746
+乙醇 8.25877058104
+萨满摇 13.2075304714
+乙醛 10.4666904475
+乙醚 8.7245279194
+省得 8.64840422393
+钓鱼岛 10.4994802703
+深念 12.5143832909
+酒质 12.8020653633
+只作 10.2897597393
+阿隆悉 13.900677652
+赶得出 13.2075304714
+报装 13.2075304714
+输入输出 10.2371160058
+班勇发 13.2075304714
+令旗 10.2630914922
+霭霭 11.7034530746
+余杭市 12.8020653633
+西非地区 12.2912397395
+石相击 13.2075304714
+木鼓 13.2075304714
+拉蒙特 12.5143832909
+麦凯恩 12.2912397395
+转脸 9.26594866375
+成分股 9.19114745066
+翡翠 8.66956903512
+求函数 12.8020653633
+颜陈和尚 11.8212361103
+无处藏身 12.5143832909
+肺不张 11.4157710022
+变圆 12.5143832909
+叫醒 8.9308643524
+一步到位 10.0940151622
+究其 10.3743171274
+银鸽投资 11.7034530746
+浒山 12.2912397395
+变在 12.5143832909
+科林巴 12.8020653633
+乙酯 11.1280889297
+幻觉症 13.900677652
+两万二千九百三十七卷 13.2075304714
+乙酸 9.59661255877
+大少帅 12.8020653633
+转至 9.58318953844
+转账支票 12.8020653633
+惜售 9.17328983326
+乙酰 10.6818018271
+攻击性 10.4666904475
+伏枥 12.2912397395
+邮电局 11.2616203224
+变坏 10.0294766411
+挥毫 10.9049453784
+御书 10.8561552143
+本溪满族自治县 12.8020653633
+大西北 10.5684731418
+悬重 13.900677652
+榆林市 11.8212361103
+宰相之才 13.900677652
+驾车者 12.8020653633
+精心施工 13.2075304714
+教学中心 12.8020653633
+切合实际 10.5684731418
+中性平衡 13.900677652
+只信 12.1089181827
+同胞兄弟 11.598092559
+阶级意识 11.9547675029
+荣列 13.900677652
+颖慧 12.8020653633
+赫达尔 13.900677652
+帕洛斯 13.2075304714
+枪支弹药 10.642581114
+磨房 11.1280889297
+文海宝 13.2075304714
+生克 11.5027823792
+实验者 12.2912397395
+生光 10.8096351986
+只为 8.57766767284
+领过去 13.900677652
+一处处 10.9049453784
+沃利斯 12.2912397395
+衣室 13.900677652
+御侮 10.9562386728
+指令流 12.5143832909
+经销网 11.8212361103
+五六座 13.2075304714
+黄宗汉 12.5143832909
+王根 12.5143832909
+礼让 10.4041700905
+电鱼 11.8212361103
+生兄 10.3743171274
+天线 8.37124856446
+性疾病 10.0940151622
+早粥 13.900677652
+捐给 10.533381822
+北京卫戍区 12.1089181827
+节制 8.06879517469
+巨大进步 11.4157710022
+密云县 10.642581114
+除外 8.18694484647
+宾蒂 13.900677652
+唾弃 10.604840786
+旁落 11.1280889297
+司马徽 12.8020653633
+吻合器 13.900677652
+番国 11.9547675029
+脚型 13.2075304714
+节前 7.70423352418
+转而 7.71241352889
+目标 5.30356483738
+萨满教 10.0294766411
+省库 13.900677652
+变回 11.4157710022
+商汇利 13.2075304714
+除奸 12.5143832909
+省府 10.2630914922
+奥马尔 11.1926274509
+张一元 12.8020653633
+安能成 13.2075304714
+康笃 12.8020653633
+脚垫 11.9547675029
+碗饭 9.87532596124
+准时出席 13.900677652
+长庆油田 12.8020653633
+卡通片 13.900677652
+姜糖水 12.8020653633
+阳工 13.2075304714
+千真万真 12.8020653633
+担责任 11.3357282945
+华国 12.8020653633
+月话费 13.900677652
+日历 9.84023464143
+电鳗 11.2616203224
+粉糕 13.2075304714
+处理事件 13.2075304714
+当班人员 13.900677652
+孙子思 13.2075304714
+抵敌 9.66657114738
+民事案件 9.89334446674
+浦北县 13.2075304714
+霍兰 11.9547675029
+拉稀 11.9547675029
+不战不和 12.2912397395
+选收 12.8020653633
+霍兹 10.4666904475
+机架 11.3357282945
+非手术治疗 13.2075304714
+退订 13.2075304714
+汉恩 12.2912397395
+撤出来 11.8212361103
+倒果为因 13.900677652
+夜泊 12.2912397395
+退让 9.48183704418
+霍光 10.3743171274
+语用 12.1089181827
+霍克 10.1871055853
+退训 13.900677652
+锯齿 9.07236391467
+大象无形 13.2075304714
+瓦杰帕伊 12.2912397395
+蕴涵着 10.765183436
+不利因素 8.6966709649
+白沙洲 12.8020653633
+摘录自 13.900677652
+有口难分 13.900677652
+省市 8.06294720481
+五六年 9.89334446674
+雷藤 13.900677652
+人民公社 10.0505300503
+粉粒 12.1089181827
+发送信息 12.5143832909
+撑下去 12.8020653633
+闲暇 9.29550746599
+百分之一 10.1630080337
+梁化凤 12.8020653633
+县政府 8.71889410168
+钒铁 13.2075304714
+伏枕 12.1089181827
+御使 12.2912397395
+司仙吏 13.2075304714
+亲笔信 10.8561552143
+生产组 13.900677652
+律师 7.14490872999
+瞧不上眼 11.9547675029
+膨涨 13.900677652
+德二世 12.5143832909
+机构 4.65227107919
+高能量 10.765183436
+此情此景 10.4041700905
+贝德尔 13.2075304714
+图蒂 13.2075304714
+监督权 9.87532596124
+艾浒 13.2075304714
+阉割 10.3453295905
+彩绸 11.5027823792
+叔婶 13.2075304714
+剪成 10.6818018271
+明公之 12.1089181827
+卡通画 12.8020653633
+意境地图 13.900677652
+省委 7.33259974056
+挺挺 11.1280889297
+社保卡 11.7034530746
+周灵王 12.2912397395
+组网 11.8212361103
+回笼 8.1902506346
+含铅 11.1280889297
+日中 10.0940151622
+铁矾土 12.8020653633
+厨房用品 12.8020653633
+十七八家 13.900677652
+傅钟繇 13.2075304714
+礼貌 8.70218062071
+明于体 12.2912397395
+变冷 9.85762638414
+挥洒 10.9049453784
+叠翠 10.765183436
+翻脸 9.96885201925
+戴震尤 13.2075304714
+孕出 13.2075304714
+抵抗 7.14142238131
+师回浦 13.2075304714
+回答 5.52597010886
+粉笔 10.2630914922
+交通指挥 12.8020653633
+这两首 11.8212361103
+闲愁 11.7034530746
+莲花池 11.1280889297
+度假型 13.900677652
+汪古惕 13.2075304714
+贮水池 13.2075304714
+塘村 11.7034530746
+王大卫 12.8020653633
+亚锦赛 12.5143832909
+重点学科 12.2912397395
+三百二十四 13.900677652
+搬得 11.9547675029
+变出 10.4666904475
+点不着 11.9547675029
+花心血 13.900677652
+没生 11.0103058941
+美国联合航空公司 13.2075304714
+瞎子 8.12923652885
+不灵敏 11.7034530746
+事事如意 12.5143832909
+倒也不会 13.900677652
+白银市 12.1089181827
+六十多万两 12.2912397395
+规定熵 13.900677652
+光绪年间 9.59661255877
+用户注册 12.5143832909
+米纳尔 13.900677652
+看透 8.93783302172
+景阳岗 12.8020653633
+干辣椒 10.1630080337
+民心工程 11.1280889297
+便携包 13.900677652
+拥政爱民 11.8212361103
+五六天 10.642581114
+灌溉 7.19994654243
+金牛座 10.3171587135
+彩绣 11.4157710022
+射不到 11.8212361103
+瑞典公司 13.900677652
+宇平 11.4157710022
+杀人案 10.604840786
+整齐清洁 13.2075304714
+仪态万千 13.900677652
+宇宙空间 9.58318953844
+长啸 11.1280889297
+陌生感 11.598092559
+经阁 13.900677652
+亚喀巴 11.8212361103
+阴沟里翻 11.8212361103
+游逛 11.8212361103
+争强 10.604840786
+五六处 12.2912397395
+转矩 11.0674643079
+汉鼎之 13.900677652
+挥涕 12.5143832909
+以候 11.8212361103
+叔嫂 12.1089181827
+板障 13.900677652
+八行 11.598092559
+代郡武 12.8020653633
+惯量 13.900677652
+褡裢 10.0940151622
+多数决定 12.8020653633
+劳农 12.8020653633
+保险代理 11.7034530746
+叠置 11.0103058941
+经院 10.0940151622
+期刊奖 11.5027823792
+二三百元 12.2912397395
+省外 9.69598503258
+马院 13.2075304714
+杨听 11.1926274509
+遥感技术 10.5684731418
+青年党 11.1926274509
+探明储量 9.11318590919
+九十多个 13.2075304714
+游遍 11.3357282945
+气层 11.3357282945
+组群 11.5027823792
+度假地 12.2912397395
+姚际恒 11.9547675029
+可列举 12.8020653633
+才薄智浅 13.900677652
+农村卫生 12.2912397395
+小帐 12.8020653633
+爱死 13.2075304714
+走资派 9.84023464143
+何鲁丽 13.2075304714
+北三环 11.0103058941
+节后 6.95948759691
+回程 10.604840786
+空间站 10.9562386728
+韶山路 13.900677652
+唐建立 13.2075304714
+撵出去 11.2616203224
+轻钢 13.900677652
+恶病质 12.8020653633
+三信 13.900677652
+王刘焉 12.8020653633
+轰轰 10.3171587135
+晓翠 13.2075304714
+除弊 12.5143832909
+退货 10.6818018271
+嚎啕大哭 9.94943393339
+电驴 11.9547675029
+白炽电灯 13.900677652
+回稳 9.20019728618
+姚贾 13.2075304714
+除开 10.7226238216
+叫阵 11.8212361103
+退费 11.1926274509
+病理学 9.75754292558
+耗气量 12.5143832909
+退赃 12.5143832909
+不急之务 11.9547675029
+任卷舒 13.2075304714
+颇为重要 11.5027823792
+维斯杜 13.900677652
+毛泽东思想 9.04864738806
+生动 7.33964698608
+许学强 13.2075304714
+抵掉 13.900677652
+宁池广 13.2075304714
+退赔 11.8212361103
+除役 13.2075304714
+三百余种 12.8020653633
+赋役 8.60737282725
+查询 8.0746775446
+门当户对 10.5684731418
+回空 13.2075304714
+类质同晶 13.900677652
+珠黄 13.900677652
+前不久 8.29120585679
+城陵矶 10.5684731418
+四路 9.23723855786
+共和元年 12.8020653633
+插图卷 13.900677652
+弹不虚发 12.8020653633
+玛依拉 12.8020653633
+洛特 11.4157710022
+退走 9.04864738806
+止血剂 11.5027823792
+农政 10.8561552143
+挥汗 13.900677652
+率部 8.24818847171
+劳倦 10.3171587135
+震天雷 12.2912397395
+逃下 13.2075304714
+霍巴特 11.8212361103
+伸出头 10.533381822
+组织 4.87018190692
+组组 12.5143832909
+死伤 8.1608847398
+训练制度 13.2075304714
+不能溶解 13.2075304714
+闲情 10.8561552143
+鄂尔多斯高原 9.74179456862
+一棵树上吊死 12.2912397395
+薄技在身 13.900677652
+盲人 8.52539924429
+武直 12.1089181827
+科莫湖 12.8020653633
+单片微 13.2075304714
+宋军降 13.2075304714
+普罗罗 13.2075304714
+攻击机 9.20932976975
+欧式建筑 11.598092559
+马阁 11.3357282945
+小奇子 11.5027823792
+伊斯特拉 13.2075304714
+刘民声 12.8020653633
+烘篮 13.900677652
+仙石 12.1089181827
+八夜 12.8020653633
+惜别 10.7226238216
+保养费 11.4157710022
+抵换 12.2912397395
+赔款 8.62767809341
+节哀 11.7034530746
+虚空 9.80633308975
+鲍利斯 13.2075304714
+挥泪 10.4041700905
+福建高速 10.2117981979
+立马 7.96314144689
+变做 9.48183704418
+一千五百余箱 13.2075304714
+从缺 13.900677652
+死工夫 13.900677652
+遍数 12.5143832909
+皆准 12.5143832909
+宋军阵 11.7034530746
+福克 11.3357282945
+逐臭 12.5143832909
+黑糯米 13.2075304714
+古布利 13.900677652
+礼赞 11.7034530746
+退路 8.99540287354
+蒙名臣 13.2075304714
+脚儿 10.9049453784
+载驳船 11.8212361103
+二伏 13.2075304714
+挺拔 9.36807815882
+开了门 9.19114745066
+平阴县 13.2075304714
+抵挡 8.70218062071
+房展 12.1089181827
+丁仁 12.8020653633
+变压 11.8212361103
+汤普森 11.1280889297
+烟青虫 13.900677652
+五六家 11.9547675029
+陈思王 12.5143832909
+巴丁 10.765183436
+惜军 13.2075304714
+申奏魏 12.5143832909
+变厚 11.2616203224
+蓬巴蒂 12.8020653633
+官僚习气 13.900677652
+除尽 11.3357282945
+杭州话 12.1089181827
+郝建恒 12.5143832909
+耿耿保 12.8020653633
+叫错 12.8020653633
+省察 11.5027823792
+开标 11.598092559
+井四郎 13.2075304714
+回礼 10.5684731418
+柏柏尔 9.7898037878
+假动作 11.5027823792
+纳指 9.38981814546
+宝玉石 13.2075304714
+清风明月 12.2912397395
+新郑市 9.98865464655
+罡风 13.900677652
+贺胜桥 11.1280889297
+真真正正 12.5143832909
+一不怕苦 12.5143832909
+除尘 10.4349417492
+不良资产 9.48183704418
+史考异 12.8020653633
+刘玉翠 9.05649056552
+八千五百二十四万元 13.2075304714
+回神 13.2075304714
+吴作栋 12.2912397395
+十四万 11.9547675029
+金牛山 11.1926274509
+番号 9.5186510173
+丁二 11.2616203224
+程知节 12.5143832909
+老老少少 10.765183436
+周鲂 12.1089181827
+变变 12.2912397395
+爱欲 11.2616203224
+鬼斧神工 10.8096351986
+天汉桥 12.8020653633
+脚力 10.7226238216
+刻骨 11.4157710022
+喀布尔 9.93038573842
+小笼子 12.8020653633
+斗门县 13.2075304714
+丁亥 13.2075304714
+丁产 11.7034530746
+海军陆战 11.1926274509
+中国民航总局 13.2075304714
+谨向 12.8020653633
+激活剂 12.2912397395
+律宗 11.1926274509
+汗迹 12.2912397395
+保持平衡 9.93038573842
+沉雷 11.598092559
+主要用途 10.1871055853
+音乐才能 12.1089181827
+鸟类 7.5411037833
+脚劲 13.900677652
+拱手行礼 13.900677652
+磊磊 13.2075304714
+三百卷 13.2075304714
+神志昏迷 11.7034530746
+人事代谢 13.2075304714
+刘祥 12.8020653633
+绒面 11.4157710022
+回禀 9.48183704418
+王小兰 8.89004235788
+变化 4.73617181634
+还乡团 11.4157710022
+敬德夺 13.2075304714
+偷工减料 10.4349417492
+灌渠 10.9562386728
+干部队伍 9.94943393339
+嫉恨 9.87532596124
+张子房 13.2075304714
+养料 9.49395840471
+十七八天 13.900677652
+衬托出 11.598092559
+跟腱 11.7034530746
+潍坊 10.0720362555
+奥罗亚 12.5143832909
+浓于 13.900677652
+面霜 11.1926274509
+诸司悉 13.2075304714
+刘茂林 11.4157710022
+丁丁 11.4157710022
+丁一 12.8020653633
+刑场 9.6811699468
+面面 11.5027823792
+国际舞台 11.2616203224
+齐霸 12.8020653633
+海王星辰 13.2075304714
+相承之 13.2075304714
+丁丑 12.2912397395
+实话实说 9.69598503258
+程朱传 12.8020653633
+康纳 12.2912397395
+编后 12.5143832909
+百十两 12.8020653633
+丁丙 12.2912397395
+旅游线 11.7034530746
+变卖 9.40086798165
+可执行程序 12.8020653633
+劳厄 11.0674643079
+交易过程 10.8561552143
+弗曼 13.900677652
+大树下 10.4994802703
+七十四部 13.2075304714
+沱茶 11.3357282945
+叫门 9.71102290995
+变卦 9.62401153296
+好巧 12.8020653633
+工业化生产 10.9562386728
+好出风头 13.900677652
+全线崩溃 10.6818018271
+脚刹 13.900677652
+录取人数 13.900677652
+八套 11.8212361103
+百十丈 12.5143832909
+红二方面军 11.7034530746
+递增率 13.2075304714
+霍君 13.900677652
+黑粗 13.900677652
+金环三结 12.5143832909
+马集 12.8020653633
+伊吾郡 11.9547675029
+仙界 11.3357282945
+曼卿 12.5143832909
+喜马偕尔邦 12.2912397395
+二十四所 13.2075304714
+魏信陵 13.900677652
+一百二十二个 13.2075304714
+阿哈加尔 13.2075304714
+开口呼 13.900677652
+膙子 13.2075304714
+帕西法尔 12.5143832909
+方司 11.1280889297
+电磁质量 13.900677652
+托夫斯 10.765183436
+变动 6.5000570746
+轰赶 12.5143832909
+立领 12.1089181827
+胡也频 11.8212361103
+平溪 11.7034530746
+香桌儿 11.598092559
+花含露 13.2075304714
+鼓翼 11.8212361103
+花粉管 11.1280889297
+群起攻之 13.900677652
+鲜血淋漓 10.533381822
+朱建锋 13.900677652
+齐集 9.77354326693
+旅游网 13.900677652
+弭乱 13.2075304714
+闲扯 10.8561552143
+萨摩亚独立国 13.2075304714
+妇女界 12.8020653633
+王祝三 13.900677652
+鸽翼 13.900677652
+经闭 10.9049453784
+两千担 13.900677652
+旱烟管 13.2075304714
+祖德 11.598092559
+反反复复 9.87532596124
+里亚夫 13.900677652
+灭蝗 12.5143832909
+贾乌德 13.900677652
+治疗学 11.7034530746
+粉砂 10.0294766411
+北非地区 11.0103058941
+私名号 12.8020653633
+戏耍 10.8561552143
+眼红红 12.8020653633
+太师椅 9.36807815882
+曾奉旨 13.2075304714
+魏特林 11.9547675029
+群马县 12.2912397395
+助细胞 12.1089181827
+闲房 12.5143832909
+英皇道 13.900677652
+丁侯 13.900677652
+群众演员 11.598092559
+绝热过程 11.1926274509
+松毛狗 13.2075304714
+灿若星河 13.900677652
+吴启华 12.8020653633
+跌打滚爬 12.2912397395
+协进会 10.9049453784
+朝天门码头 13.2075304714
+康缘 10.3171587135
+小庄 11.8212361103
+报贩 13.2075304714
+德帝姬 12.8020653633
+天无绝人之路 10.8096351986
+报账 11.7034530746
+耿耿之 13.900677652
+迪纳 11.598092559
+监管 6.00078232884
+巴柏恩 10.5684731418
+报费 12.8020653633
+治疗室 13.2075304714
+悬钟 12.2912397395
+网络延时 13.900677652
+许花 13.2075304714
+丁作 12.1089181827
+赫师慎 13.900677652
+生物力能学 13.2075304714
+均据 13.900677652
+闪光光解 13.900677652
+宝丰 10.2897597393
+迎新春 11.9547675029
+立状 13.900677652
+百十余 11.598092559
+宝丹 13.900677652
+经销 8.98069672615
+未找到 11.1280889297
+妇女病 12.8020653633
+伏特计 13.900677652
+福星高照 12.2912397395
+程朱之 13.2075304714
+变到 11.1926274509
+拒人于千里之外 11.9547675029
+脚印 9.43476953332
+丁显华 13.900677652
+百十位 12.8020653633
+劳力 8.71889410168
+一命归天 13.2075304714
+退过 11.3357282945
+水儿 11.9547675029
+社会主义者 9.61021821083
+阿劳 12.5143832909
+贫嘴 12.2912397395
+莫胡 12.2912397395
+从紧 9.94943393339
+礼车 12.8020653633
+粉碎 7.62403416263
+反戈一击 10.7226238216
+交换台 12.8020653633
+脐部 11.598092559
+郑商所 10.0505300503
+林宝修 12.8020653633
+丁伟 12.5143832909
+宫皇后 10.8561552143
+夏政 12.8020653633
+气溶胶 10.4666904475
+面陈 10.765183436
+玉碎 12.5143832909
+孕前 10.9049453784
+劳动 5.64044336037
+砖茶 11.2616203224
+刘俊哲 12.8020653633
+万事大吉 10.6818018271
+帝自立 11.8212361103
+捐税 9.74179456862
+陵水县 13.2075304714
+南方建材 10.9562386728
+玉米价格 10.3453295905
+关岛 9.71102290995
+分库 12.8020653633
+孟坚 13.2075304714
+两票 12.8020653633
+分店 10.0294766411
+阿鲁西 13.900677652
+双灯 13.2075304714
+运筹 10.4041700905
+二当家 12.2912397395
+哀乐 10.4994802703
+捶胸 11.0103058941
+理货员 13.900677652
+分床 12.5143832909
+先泡 13.900677652
+心梗 12.2912397395
+循循善诱 11.8212361103
+蜀锦 10.5684731418
+约克城 12.2912397395
+蹲下来 9.7898037878
+此处 7.48068272383
+可攻可守 12.8020653633
+捶背 11.1926274509
+吴莱 13.2075304714
+文章主题 13.900677652
+扑倒在 9.69598503258
+千斤顶 10.8096351986
+涟漪 10.533381822
+分度 11.598092559
+此外 4.86922474006
+孟坦 13.900677652
+市容 8.39534611604
+耳部 11.0674643079
+马泊六 12.5143832909
+叶虞候 13.2075304714
+救济户 13.900677652
+拥挤 7.85804481829
+乒乓球桌 13.900677652
+变态反应 9.65218240993
+心理场 13.2075304714
+分家析产 13.900677652
+廉颇老矣 12.5143832909
+屁话 10.533381822
+豆腐房 13.2075304714
+满心欢喜 9.75754292558
+肌肤之亲 11.9547675029
+寒窗 11.8212361103
+仿佛 6.36912527057
+大望路 13.2075304714
+运笔 10.8096351986
+王兴媳妇 13.2075304714
+韩桑林 13.900677652
+显像管 10.2630914922
+支吾其辞 13.900677652
+天网 10.9049453784
+那叶 12.5143832909
+胡公庙 10.8561552143
+沅水 11.598092559
+王欣 12.1089181827
+泪眼愁眉 13.900677652
+斯普京 12.8020653633
+一多半 9.66657114738
+金边 9.87532596124
+双烯 11.598092559
+秦攻魏 12.8020653633
+女儿国 12.5143832909
+金达 12.2912397395
+好学不倦 13.2075304714
+践踏 8.86372504956
+分布 5.12512821749
+稍好 10.9562386728
+有头有脑 13.900677652
+足球明星 12.8020653633
+王武俊 13.2075304714
+远嫁他乡 13.900677652
+某班 13.2075304714
+绉纹 13.2075304714
+罢工抗议 12.8020653633
+两种 5.69300322762
+高行 13.900677652
+丧生 9.5186510173
+灌出 13.900677652
+吴茵 12.1089181827
+曼卡 13.2075304714
+魏京生 13.900677652
+湿透 9.35738286971
+武城县 13.900677652
+陆海空三 11.7034530746
+东亚各国 11.1926274509
+分带 9.36807815882
+金辉 11.7034530746
+杨名 13.2075304714
+垮得 12.8020653633
+八百多名 13.2075304714
+两科 10.8096351986
+哈奈菲 13.900677652
+资源法 13.900677652
+商业活动 9.7898037878
+若干粒 13.2075304714
+淮河路 10.1871055853
+正蓝旗 10.0940151622
+咧着 10.533381822
+纪念亭 11.7034530746
+俄勒冈 11.9547675029
+运管 12.8020653633
+创汇 11.0103058941
+拿点 10.8096351986
+辩证统一 11.0103058941
+甄拔 13.900677652
+金迪 13.2075304714
+渡槽 11.1926274509
+三贤祠 13.900677652
+便携式电脑 13.2075304714
+金近 11.8212361103
+签到簿 13.900677652
+运算 8.21370229564
+切实有效 10.1394775363
+马如箭 13.900677652
+并案办理 13.900677652
+罗蒙诺索 10.8096351986
+朔风 10.2371160058
+陶逊 13.2075304714
+五黄六月 13.900677652
+吴荣 9.93038573842
+稍多 10.765183436
+分得 8.85082164473
+诗经 8.78868986362
+稳定度 11.0103058941
+好战 9.80633308975
+固定汇率 10.6818018271
+色彩艳丽 10.4994802703
+干酪素 12.2912397395
+制导武器 10.1871055853
+苏克萨 10.1164880181
+税务司 10.765183436
+某物 11.8212361103
+万点大关 10.3171587135
+于会芳 13.2075304714
+数数 11.1926274509
+装饰业 11.9547675029
+献美 13.2075304714
+沃罗西 13.2075304714
+西乡县 13.2075304714
+读写能力 13.900677652
+吴芳 11.1280889297
+绉缩 13.900677652
+应拨 13.900677652
+拥有率 13.900677652
+建国初期 10.5684731418
+提及 7.84858848305
+火上加油 11.3357282945
+普降甘霖 13.900677652
+酥皮 12.8020653633
+物业管理 9.33632946051
+证人席 13.900677652
+一个六尺 13.2075304714
+瑙鲁 10.8096351986
+高血脂症 12.1089181827
+居新丰 13.2075304714
+言归 13.900677652
+分心 10.0088573539
+王武丁 12.1089181827
+拥戴 8.3555002075
+水泥石 12.8020653633
+变回去 13.2075304714
+赛璐珞 11.7034530746
+莒南 12.1089181827
+隔离液 13.900677652
+哀伤 9.38981814546
+克勤郡 12.5143832909
+额骨 11.598092559
+达拉 10.2371160058
+复活日 13.900677652
+首末 13.2075304714
+花同株 12.1089181827
+埃斯奎 13.900677652
+牛文海 12.2912397395
+分忧 9.87532596124
+纪念会 12.2912397395
+运程 13.900677652
+步频 13.2075304714
+数支 11.5027823792
+一九六八年 12.1089181827
+或硬件 13.2075304714
+闹哄哄 9.91169360541
+春香传 11.9547675029
+制造纠纷 13.900677652
+试音 13.900677652
+言律 11.598092559
+莒县 10.5684731418
+涟源 11.1926274509
+分开 7.22991133113
+法国文化部 12.8020653633
+作业区 10.8096351986
+劫盗 13.900677652
+俄克拉何马州 13.900677652
+剩饭剩菜 11.5027823792
+想要 6.911342386
+交送 13.2075304714
+扁舟 11.1926274509
+司线员 12.5143832909
+捶腿 11.1280889297
+二三十户 12.1089181827
+处理费 13.900677652
+国家博物馆 10.2630914922
+羟赖氨酸 13.900677652
+达成 6.71302048786
+冷僻 11.5027823792
+印尼语 12.5143832909
+滤光片 11.1280889297
+诉前保全 13.900677652
+诗词歌赋 11.0103058941
+愚见 9.44633035572
+亚稳态 11.7034530746
+十四五 11.7034530746
+言心 13.900677652
+分当 13.2075304714
+分录 13.900677652
+言必 11.5027823792
+拥护 7.88941047757
+电视信号 10.5684731418
+特海默 12.1089181827
+红莲 11.8212361103
+氨基糖 12.2912397395
+达扬 12.8020653633
+言志 12.8020653633
+二三十所 13.2075304714
+合作制 13.2075304714
+利口酒 13.2075304714
+想见 8.77671367257
+拥抱 8.76487921493
+紊流 11.9547675029
+于叶 13.2075304714
+护航舰 13.2075304714
+关键处 12.8020653633
+都得利 10.9562386728
+自以为得计 12.1089181827
+王公贵戚 11.8212361103
+成风 9.74179456862
+玩得转 13.2075304714
+辑要 11.0674643079
+吴良 12.1089181827
+分形 11.2616203224
+卫戍司令 11.2616203224
+罗盘仪 12.2912397395
+数斤 13.900677652
+言念 12.8020653633
+两碗 9.09665660724
+审判庭 11.3357282945
+一个六岁 12.5143832909
+刻录成 13.900677652
+分岐 13.900677652
+金贵 10.4994802703
+高速移动 13.900677652
+碌碡 10.642581114
+齐立国 13.2075304714
+文山郡 13.2075304714
+金贾 12.8020653633
+海陆空 10.642581114
+水蒸汽 11.2616203224
+后英 12.8020653633
+郝寿臣 11.5027823792
+金质 10.8561552143
+不轻不重 11.598092559
+贡山独龙族怒族自治县 11.2616203224
+分配权 12.2912397395
+冲动性 12.1089181827
+状元秀 13.900677652
+青罗 11.8212361103
+那青砖 13.900677652
+发善心 11.8212361103
+黑白屏 13.900677652
+两等 11.9547675029
+运祚 13.2075304714
+星月交辉 12.8020653633
+碌碌 10.0294766411
+米苏斯 13.900677652
+阿克美 12.8020653633
+妙人 12.5143832909
+现世报 12.8020653633
+获益非浅 13.900677652
+两筒 11.8212361103
+丧门神 11.4157710022
+两筐 11.7034530746
+盗去 13.900677652
+法制 7.98447558937
+金家湾 9.37888907493
+张晓东 11.7034530746
+九面 13.2075304714
+第二十七 11.0674643079
+固形物 12.8020653633
+第二十一 11.598092559
+市委 7.54804825566
+加利福尼亚大学洛杉矶分校 12.1089181827
+林山脉 13.900677652
+稍宽 11.1926274509
+泄殖腔 11.0674643079
+辩论会 13.2075304714
+哈特曼 11.9547675029
+显示方式 13.2075304714
+南通县 13.2075304714
+混血 10.0088573539
+寒碜 10.0940151622
+祖弼 13.900677652
+金赛 13.900677652
+稍安 10.5684731418
+联系电话 9.6811699468
+两笔 10.1871055853
+水蒸气 9.36807815882
+爱默生 12.5143832909
+汪先生 13.2075304714
+涟涟 10.9562386728
+镇守使 11.2616203224
+内酰胺 11.7034530746
+农业学大 10.3453295905
+生前友好 13.2075304714
+运移 9.93038573842
+白虎殿 12.5143832909
+神帛堂 13.2075304714
+民事诉状 13.900677652
+市外 11.1280889297
+众多名 13.900677652
+青翠 10.533381822
+总有一天 8.95903522937
+康斯坦茨 13.900677652
+日兴 11.9547675029
+耿武 13.2075304714
+宏仁 13.900677652
+石嘴山区 13.2075304714
+耕佣 12.5143832909
+阿贾苏 13.2075304714
+浊辅音 13.2075304714
+伊吾 10.5684731418
+曼佐 11.9547675029
+于元嘉 13.900677652
+分尸 10.9049453784
+两篇 9.58318953844
+妙丹 13.2075304714
+斗殴 10.1630080337
+妙丽 13.900677652
+于多伦 12.5143832909
+远超过 9.7898037878
+健硕 11.3357282945
+寻找失物 13.900677652
+二千里 11.7034530746
+那厮 8.56795885871
+第二十二 11.5027823792
+抢掠 10.1394775363
+上下场 13.2075304714
+大型软件 12.1089181827
+分属 8.42003872863
+分局 8.76487921493
+眼花心乱 13.900677652
+分层 9.03314320152
+哥达 11.5027823792
+分居 9.87532596124
+说合 10.4666904475
+顽敌 12.8020653633
+美洲杯 13.900677652
+戴村坝 12.1089181827
+第二十五 10.8096351986
+肉馅 11.0674643079
+聂豹 13.900677652
+两箱 10.8096351986
+混装 11.7034530746
+上行下效 11.9547675029
+捞鱼 11.598092559
+九霄 10.1871055853
+已过期 12.8020653633
+开幕词 11.7034530746
+禾秆 12.5143832909
+阿克罗 13.2075304714
+集电极 13.900677652
+器识 13.2075304714
+青羊 10.4041700905
+第二十位 12.8020653633
+动平衡 11.3357282945
+定量化 10.642581114
+突遇 12.8020653633
+五粮液 7.80260336981
+沸腾床 13.900677652
+数束 13.2075304714
+桑托斯 10.9049453784
+机关文书 13.900677652
+汝识 13.2075304714
+伤着 11.1926274509
+丁丁冬冬 12.8020653633
+返照 12.5143832909
+溜过 12.2912397395
+杨显之 13.2075304714
+巴尔托洛 12.5143832909
+若泽一世 13.2075304714
+流媒体 11.8212361103
+长江文艺出版社 12.8020653633
+稍嫌 11.7034530746
+涟水 10.8096351986
+抚松县 11.598092559
+挪不动 11.4157710022
+历为郡 12.1089181827
+抢手 10.7226238216
+食篮 13.900677652
+数条 9.66657114738
+寒秀 11.1280889297
+革命行动 10.8096351986
+号炮 10.4349417492
+王叔铭 13.2075304714
+磁铁矿 9.4233408375
+盒子炮 12.2912397395
+索伦伯爵 13.2075304714
+数杯 10.4349417492
+寒秋 12.8020653633
+产科医院 13.900677652
+于公 12.1089181827
+张晓伟 12.1089181827
+利洛夫 13.900677652
+步骤 8.05135287203
+担保方 12.8020653633
+看情形 10.4666904475
+金象 11.9547675029
+侯生才 11.3357282945
+左面 10.8561552143
+打弹子 13.900677652
+科普知识 12.1089181827
+孟合 12.5143832909
+激素类 10.9562386728
+心毒 12.5143832909
+数月 8.03420959504
+红珊瑚 11.598092559
+猛不防 11.598092559
+两税 10.1630080337
+软土 12.5143832909
+模范人物 13.2075304714
+八百零七万 13.2075304714
+两程 12.2912397395
+数朵 11.7034530746
+志愿者 8.83177344976
+石岭关 11.4157710022
+千余条 12.1089181827
+诉讼时效 11.1926274509
+市声 10.9049453784
+秦始皇陵 10.0720362555
+东城区 10.533381822
+新桃换旧符 13.900677652
+毋庸置疑 9.23723855786
+朱衣太监 13.2075304714
+李老板 12.2912397395
+食管 9.58318953844
+两端 7.98447558937
+林山胜 13.2075304714
+加吉鱼 12.5143832909
+马前泼水 13.2075304714
+肉食 9.34680076038
+创演 13.2075304714
+深幽 12.2912397395
+感恩不尽 11.8212361103
+青绿 9.94943393339
+诳骗 12.2912397395
+两章 11.5027823792
+游戏性 13.900677652
+深广 10.3743171274
+接待方 13.900677652
+张显清 11.7034530746
+掘起 13.900677652
+吴老 11.8212361103
+沃罗诺 13.2075304714
+两立 11.9547675029
+陈列馆 10.0294766411
+妙传 11.9547675029
+应声而倒 13.900677652
+关键字 9.71102290995
+于军 11.2616203224
+步步小心 13.900677652
+蒂巴因 12.8020653633
+谈丹崖 13.2075304714
+两站 11.1926274509
+变通方法 13.2075304714
+日坐愁城 13.2075304714
+刘世锦 11.1280889297
+抢护 12.8020653633
+千公里 12.5143832909
+临夏县 12.5143832909
+宋辽金 11.1926274509
+数枚 11.0103058941
+客家人 10.8561552143
+曼丽 12.2912397395
+曹老大 11.598092559
+掐算 11.0674643079
+数枝 13.2075304714
+路在何方 11.9547675029
+青红 11.8212361103
+示威游行 9.91169360541
+侦骑 13.2075304714
+数架 11.1280889297
+八百多块 13.900677652
+岭南大学 10.9562386728
+于净 12.5143832909
+一子一女 12.1089181827
+伤眼 12.2912397395
+说唱 9.03314320152
+心死 12.5143832909
+神话剧 11.9547675029
+胡椒面 12.2912397395
+后备箱 10.765183436
+抢抓 11.5027823792
+数枪 11.5027823792
+鞋业 10.4994802703
+江文书 11.2616203224
+涟波 13.900677652
+诗篇 8.98069672615
+显示 4.51924520516
+食糜 11.4157710022
+独臂 10.0940151622
+临终 9.43476953332
+清华大学土木工程系 13.2075304714
+食糖 8.98069672615
+稍差 10.9049453784
+白木 11.1926274509
+罗平县 13.2075304714
+杜拉特 13.2075304714
+孟华 12.2912397395
+癸酸 13.2075304714
+彭城王 12.2912397395
+奇才队 13.900677652
+反装甲 10.765183436
+和积财 13.900677652
+二三十架 13.2075304714
+癸酉 12.8020653633
+德皇威 11.3357282945
+明亮 7.58351296523
+青神 12.1089181827
+独自 7.37858485381
+达林 10.5684731418
+酸菜鱼 13.900677652
+挽着 9.29550746599
+市徽 13.2075304714
+周一良 10.0505300503
+集散中心 9.12155415886
+心泉 12.8020653633
+阶级本质 11.2616203224
+横眉冷对 13.900677652
+城南区 13.900677652
+明装 12.8020653633
+小寺 12.2912397395
+抢收 11.598092559
+王晓军 13.900677652
+渡海 9.19114745066
+醇溶液 12.8020653633
+太不像话 10.765183436
+百里挑一 10.765183436
+心法 11.1926274509
+抢攻 11.598092559
+魏文帝 10.1164880181
+编码器 11.9547675029
+左道 11.8212361103
+拥有 5.42743634809
+麻六甲 13.900677652
+宁都 10.1630080337
+货站 11.4157710022
+上下册 13.2075304714
+食粮 11.0103058941
+某省 10.8096351986
+说动 10.4349417492
+生叶 11.3357282945
+想象 6.70249407487
+令人感动 11.5027823792
+言来语 13.900677652
+肌瘤 9.93038573842
+过素诚 13.2075304714
+左邻 11.8212361103
+游戏机 11.5027823792
+达木 12.5143832909
+抽冷子 13.2075304714
+婚礼服 11.1926274509
+周梅森 13.2075304714
+任长史 12.5143832909
+吴蜀 11.9547675029
+心气 9.87532596124
+茫然无措 12.2912397395
+香椿芽 12.5143832909
+专权恣肆 12.8020653633
+九洲 10.2117981979
+垂直平分 12.1089181827
+返盐 13.2075304714
+十五胎 13.900677652
+正高 13.2075304714
+藐视 9.49395840471
+伊利 8.3555002075
+同档次 12.1089181827
+分娩 8.83808261895
+兴林 13.2075304714
+大有好转 12.5143832909
+梳篦 11.3357282945
+准平原 9.87532596124
+崔谅 11.9547675029
+正骨 10.8561552143
+肖祖建 13.900677652
+明争 12.8020653633
+好孩子 9.5062284973
+皮靴子 12.2912397395
+端居 13.900677652
+审判官 11.1926274509
+原线圈 12.8020653633
+担保 7.0806612873
+左郡 13.900677652
+黄岗梁 12.1089181827
+内外交困 10.2630914922
+闷葫芦 11.0103058941
+独脚 11.8212361103
+保不齐 11.8212361103
+孟县 10.1871055853
+张世开 11.9547675029
+赚黑心钱 13.2075304714
+抖颤 11.0103058941
+米袋子 12.2912397395
+金诗 12.8020653633
+幽远 11.3357282945
+金诚 13.900677652
+防空网 13.2075304714
+永平县 11.9547675029
+愚蠢 8.68574189437
+痴呆呆 11.4157710022
+万年青 11.3357282945
+客户经理 9.29550746599
+二三十条 13.2075304714
+历世更 13.900677652
+诗笺 10.3453295905
+维内德 13.900677652
+辨出 10.9562386728
+有致敏 13.900677652
+美国黑人 10.7226238216
+联欢会 12.2912397395
+电子部 13.2075304714
+心理剧 12.8020653633
+突降 11.1280889297
+含镁 11.598092559
+积羽沉舟 13.900677652
+斗气 11.3357282945
+说及 11.7034530746
+两类 7.06549306583
+哈塞尔 12.5143832909
+市府 10.0294766411
+帮别人 11.8212361103
+两米 9.75754292558
+处方权 13.900677652
+哐当 11.4157710022
+北碚区 13.2075304714
+大套 11.5027823792
+登月舱 11.5027823792
+诗章 11.5027823792
+店大欺客 13.2075304714
+邪行 13.2075304714
+大表哥 12.1089181827
+冷于冰 13.900677652
+阎涛 13.900677652
+说古 12.8020653633
+说句 9.38981814546
+坐而论道 11.598092559
+状元红 12.8020653633
+达曼 11.3357282945
+瑞安县 13.2075304714
+西梁湖 12.2912397395
+沙晶兰 13.900677652
+蜀道 11.2616203224
+双甲 12.8020653633
+矿坑 10.9562386728
+王柳貌 12.5143832909
+特征性 10.4666904475
+牧守治 13.2075304714
+市廛 11.598092559
+棱柱 11.9547675029
+能立世 13.900677652
+青砖 9.43476953332
+健美 10.0505300503
+肉鸽 13.2075304714
+践诺 11.9547675029
+分寸 9.85762638414
+河西乡 13.900677652
+心淡 13.2075304714
+想起 6.02555837094
+满目荒凉 12.5143832909
+曾命方 13.2075304714
+莜麦 10.533381822
+突防 10.2117981979
+桓灵 12.1089181827
+干臣循 13.900677652
+肉鸡 9.74179456862
+双生 11.0103058941
+镇党委 11.8212361103
+渡江 8.39534611604
+两万二千八百七十七卷 13.2075304714
+吃下 13.2075304714
+炮衣 13.2075304714
+赵文华 12.8020653633
+人人为我 12.5143832909
+偃旗息鼓 9.91169360541
+靡不 13.2075304714
+伊化 13.900677652
+倔劲 13.2075304714
+湛蓝 10.2117981979
+囤积者 12.5143832909
+拖回来 12.5143832909
+渡河 8.30596627237
+韦克菲尔德 13.2075304714
+两系 10.1871055853
+幕后新闻 13.900677652
+节骨眼儿 10.8096351986
+赵文卓 13.900677652
+刺儿头 12.2912397395
+言官 8.89004235788
+出芽法 13.2075304714
+自行设计 9.59661255877
+涡轮机 10.4041700905
+截弯取直 11.0674643079
+铅含量 12.1089181827
+言宣 13.2075304714
+心内膜炎 11.0103058941
+中央经线 13.900677652
+产粮区 10.4349417492
+洪制台 12.8020653633
+游泳衣 11.9547675029
+劫狱 10.8561552143
+临高 12.2912397395
+青磁 13.900677652
+一会儿张 13.900677652
+说卦 11.4157710022
+武陟县 11.4157710022
+廖汉生 13.2075304714
+分子 6.37073428137
+二十四万一千七百余两 13.2075304714
+收藏品 10.5684731418
+从事贸易 11.0674643079
+不见森林 12.5143832909
+两粤 12.2912397395
+汝贞 13.900677652
+清算组 10.642581114
+斗法 11.0103058941
+青碧 13.2075304714
+游蜂浪蝶 13.2075304714
+俞秀 13.2075304714
+鲜明个性 12.2912397395
+危重病 10.7226238216
+卑陋 13.900677652
+齐仁明 13.2075304714
+混过 11.1280889297
+湛蒲 12.8020653633
+肉麻 10.6818018271
+抗御 10.0720362555
+折褶 13.900677652
+壶把 13.900677652
+东征西讨 11.9547675029
+活血化淤 13.2075304714
+改变传统 12.2912397395
+汝贤 13.2075304714
+分季 13.900677652
+蠹政病民 13.900677652
+担任 6.05330581582
+诗稿 10.642581114
+莒城 13.900677652
+芳菲尽 13.900677652
+混进 9.89334446674
+伊卡 13.2075304714
+久治不愈 11.0103058941
+抢来 10.0294766411
+黄龙县 13.900677652
+言苏秦 13.2075304714
+江湖术士 10.9049453784
+百分之八十 10.765183436
+无敌天下 13.2075304714
+担起来 12.5143832909
+正项 11.8212361103
+孟克 12.1089181827
+敬体 13.900677652
+孟光 12.2912397395
+达斯 11.0674643079
+双百 11.8212361103
+右上图 12.8020653633
+蒲福 12.8020653633
+瑟缩着 13.2075304714
+定向钻井 13.900677652
+孟养 12.1089181827
+小恩 13.900677652
+迪尔凯姆 10.9562386728
+蝴蝶 8.5488195185
+缩成 10.765183436
+数批 12.2912397395
+挽留 9.11318590919
+四象 10.642581114
+敬佩 9.12999302751
+氧化亚 12.5143832909
+绢本 11.2616203224
+二三十斤 12.8020653633
+于君 12.5143832909
+气户 13.2075304714
+联播节目 13.2075304714
+守约 12.8020653633
+王公贵族 9.62401153296
+两罐 12.2912397395
+达文 12.8020653633
+某甲 11.8212361103
+汝定兄 11.9547675029
+教育引导 11.8212361103
+当做 8.03138073884
+三百步 11.8212361103
+数战 13.900677652
+稍微 7.62591563073
+毗卢寺 13.2075304714
+蓑衣 10.1871055853
+铅球 11.1926274509
+两缸 12.5143832909
+玉液琼浆 11.9547675029
+不管怎么 8.52539924429
+阿军 12.2912397395
+达日 13.2075304714
+达旦 11.5027823792
+大中祥符 10.9562386728
+张之卒 13.2075304714
+数户 13.2075304714
+超英 13.2075304714
+夺胎换骨 13.2075304714
+电影院 9.26594866375
+俞穴 11.8212361103
+半途中 12.5143832909
+缩手 10.9562386728
+香格里拉 10.642581114
+明仁 13.900677652
+母女情 13.900677652
+两缕 13.2075304714
+民和县 12.2912397395
+传热学 12.1089181827
+搓成 11.1280889297
+招生人数 13.2075304714
+一生一世 10.2371160058
+达官贵人 9.94943393339
+双目 8.82550383674
+碎嘴子 13.900677652
+上下卷 12.2912397395
+聚敛钱财 11.598092559
+心清 10.4041700905
+两翼 8.89004235788
+双盲 13.900677652
+罗伯茨 10.9049453784
+幽趣 13.2075304714
+商瑞记 13.2075304714
+诗神 13.900677652
+移作 13.900677652
+双相 13.2075304714
+肌理 10.604840786
+开幕辞 12.5143832909
+郭汝霖 13.2075304714
+父母双亡 10.604840786
+信托法 13.2075304714
+敬修 10.4666904475
+头条新闻 11.8212361103
+增辟 10.8096351986
+手足无措 9.62401153296
+密探 10.533381822
+孟凯 11.4157710022
+总攻 10.0294766411
+宋有烈 13.900677652
+遮盖 9.35738286971
+税务员 12.8020653633
+徭役 8.62256299275
+双盘 12.5143832909
+合口味 12.8020653633
+多特蒙德 11.8212361103
+总政 11.9547675029
+两群 11.8212361103
+失责 13.900677652
+抢枪 13.900677652
+生卒 8.44109213783
+辨别 8.65893063692
+执法人员 9.00283785202
+调和剂 12.5143832909
+孟冉 13.2075304714
+深巨 13.900677652
+东高西 10.1394775363
+贴上去 11.5027823792
+技压群雄 13.900677652
+鳞形 11.8212361103
+五千四百岁 13.900677652
+不知高低 10.765183436
+金角 12.5143832909
+坎伯兰 12.5143832909
+吴蕴 12.2912397395
+唐高祖 10.1871055853
+言声 12.5143832909
+正题 9.66657114738
+移位 9.59661255877
+八枪 13.900677652
+基本特征 8.96620371885
+诗社 10.0720362555
+吐火罗语 11.5027823792
+言难荆 13.900677652
+混账 9.29550746599
+幽谷 10.8096351986
+复杂多变 10.1164880181
+伊军 11.1926274509
+大功告成 9.98865464655
+五六十艘 13.2075304714
+米纳斯吉拉斯州 11.8212361103
+敬之 13.900677652
+青空 13.900677652
+独苗 11.5027823792
+外毒素 11.3357282945
+言外 12.8020653633
+哄骗 10.5684731418
+起起落落 11.598092559
+宫里能 13.2075304714
+官方网站 9.22784881751
+不合情理 10.642581114
+维权行动 12.8020653633
+桓冲卒 12.8020653633
+萨格尔 12.8020653633
+说出 6.65645013637
+斗渠 12.8020653633
+天气学 11.1280889297
+九连山 10.9562386728
+农村 6.08870422235
+猫哭耗子 12.2912397395
+锋快 13.900677652
+抗议声 12.5143832909
+斑点状 11.7034530746
+徵调 12.1089181827
+阿其 12.2912397395
+此帖 11.7034530746
+好几顿 12.8020653633
+数据 4.78135667839
+御宅族 13.900677652
+卖关子 10.1630080337
+伊伯尔 12.8020653633
+粗估 12.8020653633
+立遗嘱 12.5143832909
+南京图书馆 11.8212361103
+轮换制 12.2912397395
+诗碑 12.2912397395
+烘笼 13.900677652
+金表 10.9049453784
+双眼 7.82993992397
+水达达 11.7034530746
+敬业 10.3453295905
+汝辈 12.1089181827
+双眸 10.4666904475
+驰名 8.77671367257
+卿惟 13.900677652
+如昭 13.900677652
+仁安羌 11.9547675029
+青稞 9.01032852375
+双眉 10.2117981979
+穆阿维 11.5027823792
+日内 8.43261751084
+错误引导 12.5143832909
+望卿 13.2075304714
+巴纳特 13.2075304714
+货种 11.5027823792
+正餐 10.7226238216
+伊凡 10.1164880181
+丧父 9.77354326693
+主观主义 10.604840786
+冉保 12.5143832909
+分外 8.71889410168
+忽逢 12.5143832909
+青竹 10.9049453784
+瓦朗谢 13.2075304714
+鼎盛期 10.642581114
+牛角杯 13.2075304714
+分处 10.765183436
+运输枢纽 10.5684731418
+唐宋八 10.8096351986
+两维 13.2075304714
+生存空间 9.71102290995
+评剧团 13.2075304714
+吴庭艳 12.2912397395
+分头 8.44109213783
+追本穷源 13.2075304714
+帮狗吃食 13.2075304714
+长风破浪 13.900677652
+两组 8.93783302172
+缩排 13.900677652
+宝莲 11.5027823792
+利义满 12.8020653633
+唐宋元 11.5027823792
+敬仰 9.66657114738
+吴营 12.8020653633
+金袍 13.900677652
+三万二千余 13.2075304714
+市尺 12.8020653633
+性情浮躁 13.2075304714
+想进 10.533381822
+稍带 10.7226238216
+市局 11.1280889297
+换土 12.8020653633
+赵师秀 13.900677652
+两级 8.6803218269
+敬事 11.9547675029
+清徐县 13.900677652
+证监 10.0088573539
+达摩 9.54396882529
+诸葛武侯 11.1280889297
+鉴湖女侠 13.900677652
+寒素 11.7034530746
+双瞳 13.900677652
+第二十六次 13.900677652
+许可证 8.37124856446
+独舞 10.4994802703
+市属 9.20019728618
+运粮 9.63799777493
+奇热 13.900677652
+砸饭碗 13.900677652
+美人归 12.5143832909
+米特 9.82314020807
+宋辽间 13.900677652
+伊兹 11.598092559
+钻井 9.59661255877
+透明化 10.533381822
+敬亭 13.900677652
+伊兰 11.5027823792
+分好 12.8020653633
+于祖庙 12.8020653633
+光补偿点 13.2075304714
+养珠 13.900677652
+数控 9.59661255877
+王家田 13.900677652
+神经学家 13.900677652
+状态字 13.900677652
+妖精 7.86759143018
+养实兄 12.8020653633
+信有德 13.2075304714
+西北航空公司 12.1089181827
+离堆山 13.2075304714
+缩水 7.96578345636
+哈特河 13.900677652
+梳着 10.0088573539
+懒虫 12.8020653633
+谨防假冒 13.900677652
+去就之分 13.900677652
+铺陈 10.4666904475
+夺宝 13.900677652
+邪恶势力 11.5027823792
+伊康 12.2912397395
+吴记 11.7034530746
+解放南路 11.1926274509
+从开普 13.2075304714
+心悸 9.05649056552
+主管机构 11.7034530746
+等品 13.900677652
+心悲 13.900677652
+丁一卯二 13.2075304714
+市县 9.65218240993
+收藏夹 13.900677652
+祭主 12.8020653633
+心惊 9.20019728618
+此公 10.9562386728
+之乎者也 11.598092559
+青田 10.642581114
+金蝶 11.598092559
+李老汉 11.1926274509
+心情 6.34896543662
+钟泄媛 12.8020653633
+愚蒙 12.2912397395
+一个十七级 13.2075304714
+书面言语 13.900677652
+正阳 10.4994802703
+怪石 9.5186510173
+孟异 12.8020653633
+栾城县 13.900677652
+悠闲 9.62401153296
+谢米亚 13.2075304714
+数百艘 11.8212361103
+市口 11.0103058941
+达比 12.5143832909
+分国 11.1280889297
+货盘 11.9547675029
+吵吵闹闹 10.6818018271
+吴语 11.9547675029
+妖猴 10.642581114
+返程 10.9049453784
+湖滩 11.2616203224
+心想 6.98198243296
+测验法 13.900677652
+祥林 13.900677652
+幽草 12.8020653633
+对外贸易法 13.2075304714
+自助餐厅 12.2912397395
+斯里兰卡民主社会主义共和国 13.2075304714
+合面 12.2912397395
+华师大 13.900677652
+那兴儿 13.900677652
+羟醛 12.8020653633
+较低 13.900677652
+卡拉格 12.8020653633
+三百斤 11.8212361103
+心态 7.32003851469
+心怀 9.04864738806
+煤矸石 11.4157710022
+隐饰 13.900677652
+施诺巴 13.900677652
+市北 9.98865464655
+心思 6.95178042966
+两手支 13.2075304714
+头号敌人 11.9547675029
+活受罪 10.9049453784
+听者藐藐 13.900677652
+张世卿 12.5143832909
+伊布 11.598092559
+心怡 13.2075304714
+三百文 12.2912397395
+心性 9.33632946051
+八柱 11.4157710022
+心急 9.77354326693
+玛尔浑 13.2075304714
+外劳 13.900677652
+二三十次 12.5143832909
+较佳 9.5062284973
+陵替 12.8020653633
+海上巡逻 11.0103058941
+金融 5.25070334933
+市区 6.62897394509
+董宜胜 12.8020653633
+黄海之滨 11.1280889297
+热工学 12.2912397395
+文宣皇帝 12.8020653633
+操弄 12.5143832909
+半边人 13.900677652
+呈示部 12.2912397395
+浮雕像 13.900677652
+较优 10.765183436
+思念家乡 12.8020653633
+叶蜡石 10.0940151622
+几十枚 12.1089181827
+汝耶 12.5143832909
+环磷酰胺 11.598092559
+西阁 11.598092559
+华为技术有限公司 12.8020653633
+点火器 12.5143832909
+莫斯科市 12.2912397395
+正隆 11.0674643079
+祭仪 11.0674643079
+向触 13.900677652
+舒斯特 12.8020653633
+二三十步 13.900677652
+各接 13.900677652
+瑞安市 11.2616203224
+陈晓钟 13.900677652
+超极化 13.900677652
+明霞洞 12.8020653633
+伊斯坦布尔 9.26594866375
+几十条 10.4994802703
+正面 7.04949272448
+实践家政 13.900677652
+住房难 12.5143832909
+铺面 10.0940151622
+陆自和 13.2075304714
+王胆 9.75754292558
+米粉 10.604840786
+真神安 13.900677652
+尼日利亚 8.89673134603
+文斯基 11.3357282945
+分型 10.1630080337
+向天笑 13.900677652
+兆位 13.900677652
+罗家庄 12.1089181827
+创新 5.7407309964
+坦然 8.70218062071
+大士殿 13.2075304714
+引出来 11.3357282945
+张世勋 13.900677652
+伊德 11.8212361103
+打光棍儿 13.2075304714
+军政委 11.4157710022
+杀伤性 11.1280889297
+梅诺蒂 12.8020653633
+伊循 12.5143832909
+区域性 8.44109213783
+抛丸 13.900677652
+监护人 10.1394775363
+米粥 10.1871055853
+六百万贯左右 13.2075304714
+汉佩尔 13.900677652
+头皮屑 12.2912397395
+秦律中 11.3357282945
+麦收 10.7226238216
+说得 9.91169360541
+静脉炎 11.9547675029
+米糕 12.5143832909
+山西太原 9.56994431169
+和平友好 12.1089181827
+八服 13.900677652
+上元节 12.1089181827
+科技图书 12.5143832909
+挑战书 12.2912397395
+和钦察 12.8020653633
+乐大娘 13.2075304714
+娇小玲珑 11.7034530746
+呼啸 8.74162235276
+丰太郎 13.900677652
+性命不保 11.8212361103
+多种语言 10.4666904475
+正需 12.5143832909
+监护仪 12.2912397395
+增补 8.98069672615
+云美兄 12.8020653633
+克里姆林 13.2075304714
+预先确定 11.7034530746
+国情咨文 11.9547675029
+税务官 11.8212361103
+米糠 11.9547675029
+寒玉 12.5143832909
+较之 8.77671367257
+青瓷 9.09665660724
+心意 8.1641053545
+排行表 13.900677652
+外阴部 11.2616203224
+二十四小 13.2075304714
+美人儿 10.0294766411
+各总部 13.2075304714
+轻轻地 7.29267702668
+妖狐 11.7034530746
+马背上 9.19114745066
+青瓦 11.5027823792
+蒲凌尘 13.900677652
+文右武 13.900677652
+正音 11.0674643079
+阿炳递 13.2075304714
+分地 10.4349417492
+古玛雅 12.8020653633
+回老家 8.95903522937
+创收 10.765183436
+青瓜 11.8212361103
+有理有节 12.1089181827
+分场 11.7034530746
+禁忌证 12.2912397395
+填埋 10.6818018271
+市制 11.3357282945
+心愿 8.62767809341
+谈玄 11.598092559
+分在 10.0720362555
+赎金 10.0505300503
+与人无争 13.2075304714
+一个六品 11.3357282945
+步道 13.2075304714
+美人关 12.1089181827
+刚硬 10.8096351986
+胆脂瘤 13.2075304714
+上当受骗 10.2371160058
+孟庙 11.8212361103
+分块 11.5027823792
+王涯 12.2912397395
+滔滔地 13.2075304714
+黄龙山 10.765183436
+鞠躬尽瘁 10.642581114
+晚景凄凉 13.2075304714
+防守型 11.5027823792
+把盏 9.61021821083
+两点 7.84155445639
+创效 13.900677652
+说开 10.9562386728
+明确要求 9.4233408375
+吞进去 12.5143832909
+幼儿教师 13.2075304714
+富士通公司 11.8212361103
+孟康 10.4994802703
+氰酸 11.7034530746
+涌上来 9.84023464143
+命不该绝 11.5027823792
+较严 10.9049453784
+向晓霞 13.2075304714
+城南庄 13.2075304714
+较为 5.76738379075
+四十多分钟 12.8020653633
+公共服务 8.76487921493
+金蛇 11.3357282945
+贾政知 12.1089181827
+轮上去 13.900677652
+水泥网 12.8020653633
+金蛋 11.8212361103
+张世刚 13.900677652
+稍候 10.2897597393
+子蔚 9.89334446674
+代县长 13.2075304714
+若司马懿 12.1089181827
+市内 7.43920947562
+集体生活 11.1926274509
+显眼 9.12999302751
+飞飞扬扬 13.900677652
+巴高望上 13.900677652
+石棉板 13.900677652
+防护林 9.53122979951
+占卜术 12.1089181827
+心折 11.8212361103
+运煤 10.533381822
+救到 12.5143832909
+寒热 9.80633308975
+田仁琬 13.2075304714
+担保法 11.4157710022
+切下去 13.2075304714
+中国社会科学院哲学研究所 13.2075304714
+青睐 7.33119623156
+宋等国 11.9547675029
+肉酱 10.8096351986
+禹门口 11.4157710022
+涔涔 11.598092559
+讲卫生 11.1280889297
+焊接设备 12.2912397395
+汝若 11.1280889297
+市况 9.04086524761
+没谱儿 12.8020653633
+边令诚 13.2075304714
+北马里亚纳群岛 11.7034530746
+普罗克 11.8212361103
+言吾 13.2075304714
+进校园 11.3357282945
+龚旺 10.642581114
+川流不息 10.1394775363
+城中村 9.56994431169
+于潭州 13.2075304714
+滚开 9.89334446674
+面向未来 10.765183436
+捱到 10.533381822
+泼去 12.1089181827
+此卡 12.8020653633
+四记 13.900677652
+容忍度 11.8212361103
+柳西 12.8020653633
+此即 9.69598503258
+博尔术 11.598092559
+丽江纳西族自治县 11.1280889297
+罗郡王 11.1926274509
+徒手体操 12.5143832909
+至尊 9.74179456862
+两害相权 12.2912397395
+风雨不透 12.8020653633
+屁臭 12.8020653633
+上岁数 12.2912397395
+范大人 11.3357282945
+目挑心招 13.900677652
+显着 6.79653355899
+原典 13.2075304714
+热干面 12.8020653633
+千金一刻 13.900677652
+孟州 10.6818018271
+麻栗坡县 13.2075304714
+华北地区 8.76487921493
+青石 8.76487921493
+深入生活 11.7034530746
+双端 13.2075304714
+垂发 13.2075304714
+钟敬文 12.8020653633
+蒲甘 10.9049453784
+玻璃碗 13.900677652
+英雄汉 11.9547675029
+把兄弟 10.6818018271
+分吃 11.5027823792
+特异功能 11.5027823792
+十二款 12.1089181827
+利害攸关 13.2075304714
+分合 10.2897597393
+三百架 13.900677652
+红了脸 9.01032852375
+表里如一 12.1089181827
+香港政府 10.4666904475
+百年之好 13.900677652
+良性肿瘤 10.765183436
+伊尹 10.1630080337
+动作 6.30780736413
+大庸 11.598092559
+薄壁组织 10.1871055853
+好几门 13.900677652
+天气图 10.7226238216
+不吭 10.5684731418
+收藏家 10.0505300503
+心房 9.71102290995
+食物 6.3235557211
+生四子 12.5143832909
+驱除 9.85762638414
+蒲缓昌 10.2630914922
+平治 12.8020653633
+心扉 10.4349417492
+送葬者 12.8020653633
+八百多年 12.5143832909
+潘鼎新 12.2912397395
+万万不能 10.2630914922
+山中峰 12.5143832909
+金藻 11.4157710022
+心所 12.8020653633
+米罗 12.2912397395
+乒乓球拍 13.2075304714
+百分之六十六 13.2075304714
+有枝有叶 13.900677652
+电子鼻 12.2912397395
+吴襄 10.0505300503
+卯兔 12.8020653633
+顶上来 12.5143832909
+衡派 13.2075304714
+不吵 13.2075304714
+脚不沾地 11.0103058941
+双虹楼 11.9547675029
+创智 13.2075304714
+甜甜地 10.6818018271
+连猫儿 13.2075304714
+东道主人 13.2075304714
+剖腹生产 13.900677652
+呕血 10.642581114
+柳云龙 13.2075304714
+黄甫川 11.7034530746
+新疆伊犁地区 13.2075304714
+云纹法 12.2912397395
+青白 10.3171587135
+战兵 11.3357282945
+建议案 12.8020653633
+联邦德国 8.64318227995
+金营 10.765183436
+此刻 6.72060777767
+皖南 9.11318590919
+刘克济 13.2075304714
+若斯潘 13.900677652
+材料科学 10.0294766411
+八窗玲珑 13.900677652
+屁股 7.39638947844
+藏骨楼 11.0674643079
+米线 10.8561552143
+噙住 11.8212361103
+两版 12.8020653633
+米纳 11.9547675029
+引起共鸣 12.1089181827
+共鸣 9.29550746599
+污染空气 12.2912397395
+双等 13.900677652
+平矫令 12.8020653633
+邪虎 13.900677652
+双筒 11.0674643079
+不吻 13.900677652
+麦杆 12.2912397395
+照章办理 13.2075304714
+此列 12.2912397395
+优惠证 12.8020653633
+基层工作 10.9562386728
+卡朱拉 12.8020653633
+威胁论 11.5027823792
+动人 8.28754954559
+楚雄彝族自治州 11.1926274509
+伊州 10.4666904475
+稍加 9.37888907493
+多锭 13.2075304714
+此剧 9.94943393339
+实况转播 13.2075304714
+封侯之 11.598092559
+皖北 9.65218240993
+卡斯帕 13.2075304714
+公祖 13.2075304714
+动产 9.96885201925
+唬吓 12.5143832909
+盘活 10.2117981979
+此前 5.72738421301
+伊巴 13.900677652
+出租房 11.8212361103
+人民大学 11.2616203224
+独身 10.3453295905
+擅断 12.5143832909
+布尔日 12.8020653633
+抖露 12.8020653633
+三件套 13.2075304714
+运输队 11.3357282945
+吹进来 11.0103058941
+李彦赐 13.2075304714
+碧欧泉 12.8020653633
+子息嗣 13.2075304714
+隋改绵 12.8020653633
+极其可怕 12.5143832909
+义和团运动 9.34680076038
+正门 9.19114745066
+达格 12.1089181827
+正问 12.5143832909
+斗技 13.2075304714
+私人交情 13.900677652
+动乱 8.75901409547
+法莫替丁 12.8020653633
+网球网 13.900677652
+明封伯 13.2075304714
+港台剧 13.2075304714
+第二十六条 12.5143832909
+麦保罗 12.1089181827
+青目 12.5143832909
+动真格的 11.598092559
+庞丽琴 11.3357282945
+雷克雅 13.900677652
+分唱 13.900677652
+唧唧嘎嘎 13.900677652
+金融业 8.0484751722
+青盐 11.598092559
+衡汇 13.2075304714
+海陆珍 13.900677652
+金蒙 12.8020653633
+生吃 10.5684731418
+敲敲打打 12.2912397395
+十七万七千八百顷 13.2075304714
+二三十根 13.2075304714
+博尔曼 13.2075304714
+三下五除二 10.8096351986
+商承祚 13.2075304714
+市值 6.24481363436
+言喻 10.8096351986
+创术 13.900677652
+扪心自问 11.1926274509
+追着 9.69598503258
+传观 12.8020653633
+双管 9.66657114738
+无忧无虑 9.72629038208
+飞驰而来 11.3357282945
+蜀黍 13.2075304714
+衡水 10.4041700905
+沟通交流 11.7034530746
+青皮 10.4349417492
+于建安 11.1926274509
+证章 12.5143832909
+乐毅攻 12.2912397395
+柳城郡 12.8020653633
+嫪毐 11.2616203224
+塔尔湖 12.5143832909
+动上 13.2075304714
+诗琴 13.900677652
+斗拱 11.3357282945
+赤壁鏖兵 11.8212361103
+交际 9.6811699468
+两番 10.2897597393
+孟孙 12.1089181827
+心理学 7.75649201785
+久经锻炼 12.2912397395
+荷塘月色 13.2075304714
+关庙 12.8020653633
+显然 5.76094537226
+孟子 8.62767809341
+十盒 12.8020653633
+独角 11.0103058941
+斯梯尼 12.8020653633
+全部遭 13.900677652
+选择地 10.0088573539
+一路打 11.2616203224
+银行行长 10.1164880181
+言利 13.2075304714
+教授级 12.2912397395
+寒盛 13.900677652
+资源性 9.94943393339
+金茂 12.5143832909
+出双入对 12.8020653633
+视网膜炎 13.2075304714
+多集 12.2912397395
+侧方 11.0103058941
+技校生 13.900677652
+双簧 10.9049453784
+两用 9.24671730182
+城管 8.62767809341
+左顺 13.900677652
+说媒 10.3743171274
+谈兴正浓 11.9547675029
+先上去 11.4157710022
+十六烷值 13.900677652
+金荣 11.3357282945
+长征路 12.8020653633
+两男 13.2075304714
+于平 12.5143832909
+插科打诨 11.1926274509
+心肺机 13.900677652
+中国移动通信集团公司 11.9547675029
+煤黑子 12.2912397395
+阎步克 12.8020653633
+低头丧气 13.900677652
+数根 11.4157710022
+服务指南 13.2075304714
+神经外科 11.9547675029
+密切合作 10.1164880181
+疱疹 10.3171587135
+属意于 12.5143832909
+赵成子 12.8020653633
+林郭勒 13.2075304714
+数株 12.8020653633
+一汽大众 10.8561552143
+移动靶 13.2075304714
+伊娜 13.900677652
+干气 13.2075304714
+分划 10.0088573539
+几毛钱 11.1926274509
+心搏 11.0103058941
+保加利亚人 10.4349417492
+分列 8.89673134603
+分则 10.765183436
+丧礼 10.8561552143
+斗斗 12.2912397395
+水分平衡 11.9547675029
+发不出 10.1630080337
+刘氏诸 13.900677652
+分分 11.8212361103
+情感淡漠 11.9547675029
+于康 13.2075304714
+分到 9.20932976975
+穿金戴银 12.5143832909
+体育训练 12.1089181827
+运输量 9.6811699468
+白灵头 13.2075304714
+俞炳 12.8020653633
+人与自然 10.3453295905
+国际事务 9.85762638414
+双糖 11.7034530746
+男女声 13.900677652
+圆圆满满 13.2075304714
+堆积 7.39938798144
+市地 11.5027823792
+把玩 9.80633308975
+王洪 12.1089181827
+分利 12.5143832909
+分别 4.71822248349
+市场 3.32223234808
+密报 10.0088573539
+文心阁 11.5027823792
+愚者 11.598092559
+徐俊鸣 9.4233408375
+博斯 10.1630080337
+分配情况 11.9547675029
+穷追猛打 11.4157710022
+水坑 10.765183436
+先进典型 10.9049453784
+和守寨 12.8020653633
+货物 7.14840727583
+任长安 12.5143832909
+能来 10.5684731418
+分割 7.65457088649
+玉伦徒 13.2075304714
+迪克斯 12.5143832909
+混蛋 8.99540287354
+伊克昭盟 9.82314020807
+日常用语 12.5143832909
+渐近 9.19114745066
+米票 13.900677652
+小捆 13.2075304714
+恁般 9.96885201925
+系统调查 12.8020653633
+金菊 13.2075304714
+青灵 13.900677652
+青灰 11.8212361103
+独裁 8.69119149913
+水泥管 12.8020653633
+追下 13.900677652
+迪伦马特 11.9547675029
+分厂 9.75754292558
+蕲蛇 11.8212361103
+蒲犁 12.5143832909
+大打出手 10.2630914922
+孟婆 13.2075304714
+青灯 11.8212361103
+含冤负屈 13.900677652
+伊宁 10.2117981979
+此后 5.95583094097
+手机信号 12.2912397395
+高高挂起 12.5143832909
+阿其克 12.8020653633
+俎上肉 13.2075304714
+分去 11.0103058941
+琐言 13.900677652
+牧溪 12.5143832909
+三优 13.900677652
+子管家 13.2075304714
+此君 11.9547675029
+林惠祥 12.8020653633
+三元催化 12.2912397395
+分发 9.21854642485
+革命先烈 11.1280889297
+金色 8.61747392324
+说定 10.4994802703
+食疗 9.6811699468
+王洁 11.7034530746
+自由主义 8.89004235788
+于役 13.2075304714
+说完 6.42647284548
+革命实践 11.2616203224
+李善兰 11.5027823792
+分叉 9.33632946051
+哥耶 12.8020653633
+盛锡福 12.5143832909
+居武川 12.5143832909
+酚酞 12.8020653633
+农林业 10.765183436
+热开水 11.2616203224
+分号 10.5684731418
+武帝授 12.8020653633
+符合中国 9.82314020807
+王洋 13.2075304714
+轻松自如 11.3357282945
+分句 12.2912397395
+中国科协 10.2897597393
+蓑草 13.900677652
+法布里 11.4157710022
+说客 10.533381822
+偶发性 11.4157710022
+金花 9.35738286971
+海外关系 11.7034530746
+运输部 11.3357282945
+斐然 11.1280889297
+守生 12.2912397395
+分化 6.70324229788
+腱子 13.2075304714
+三四千两 13.2075304714
+独行 10.4666904475
+抢注 9.85762638414
+两瓣 11.0674643079
+心情开朗 12.8020653633
+回头一看 8.9308643524
+克莱 9.77354326693
+分包 11.4157710022
+两瓶 9.89334446674
+中国画院 11.0103058941
+履行地 12.1089181827
+赵文子 12.8020653633
+创意 8.4801426527
+惨败 8.85082164473
+仰韶村 11.4157710022
+运盐 10.9049453784
+滚得 11.9547675029
+左首 11.3357282945
+黄花梨 12.8020653633
+分区 8.70218062071
+青烟 9.96885201925
+莫入 12.5143832909
+亚洲一号 12.8020653633
+金节 11.2616203224
+纳斯 10.7226238216
+想做到 11.9547675029
+现状及 11.9547675029
+第七十四 11.9547675029
+朴素 8.25523075433
+金英 12.5143832909
+无可否认 11.1280889297
+海参崴 10.6818018271
+避震器 13.900677652
+环境保护局 12.5143832909
+言及 10.4349417492
+精品小说 13.2075304714
+尹二人 13.900677652
+佛坪县 12.8020653633
+童猛 9.94943393339
+宣忠扈 13.2075304714
+圣文森特 10.8096351986
+恩特雷里奥斯省 13.900677652
+分升 11.5027823792
+四季歌 12.8020653633
+日人 11.5027823792
+宋敏忙 13.2075304714
+四兄弟 13.2075304714
+张家口市 11.7034530746
+金苗 12.8020653633
+分卷 11.1926274509
+受传者 13.2075304714
+敛容 12.5143832909
+稍后 8.71889410168
+以少胜多 10.4041700905
+化纤面料 13.2075304714
+一次函数 13.900677652
+初版本 13.2075304714
+伊司马仪 13.2075304714
+蒲牢 12.5143832909
+食用 7.17324592712
+重庆电视台 13.2075304714
+比肩接踵 12.8020653633
+警务处 11.9547675029
+水獭皮 12.8020653633
+横刀跃马 12.5143832909
+气慨 12.8020653633
+创投 8.18694484647
+盘王 13.900677652
+虚构情节 13.2075304714
+食盒 10.3453295905
+食盐 8.2985588311
+刘璋归 13.2075304714
+簸箩 12.1089181827
+吴越 9.0884932966
+孔子 7.89679058487
+但慧梅 12.2912397395
+孟奇 12.5143832909
+节选自 12.8020653633
+此地 7.54283538547
+巍然矗立 13.2075304714
+辽原 13.900677652
+独语 12.8020653633
+样本容量 13.2075304714
+戊等 13.900677652
+即用 9.37888907493
+千纸鹤 13.900677652
+十五艘 13.2075304714
+正道 9.62401153296
+打瞌睡 10.1394775363
+寻检 12.5143832909
+滑稽剧团 13.900677652
+谈笑风声 12.8020653633
+黄龙寺 11.7034530746
+津渡 11.3357282945
+卫冕冠军 11.8212361103
+美人图 11.598092559
+孟夏 13.2075304714
+为的是 8.44963919841
+二桃杀三士 12.2912397395
+达式常 13.900677652
+运用 6.18600017817
+吴跃 12.1089181827
+寂然无声 11.0103058941
+冲在 13.2075304714
+经砥柱 12.8020653633
+奏疏 8.81308131674
+形象大使 11.9547675029
+从外向内 13.2075304714
+两省 8.24818847171
+龙江 9.6811699468
+小指 10.2897597393
+数模 13.900677652
+辆车 9.91169360541
+临夏市 11.8212361103
+心曲 11.5027823792
+波恩大学 10.3171587135
+日则沟 11.8212361103
+正途 10.9049453784
+官品高 11.8212361103
+没日没夜 11.1926274509
+孟姜 13.2075304714
+显现 7.22485443034
+好几里 12.8020653633
+科夫斯基 10.8096351986
+秦阿姨 11.1926274509
+林妹妹 9.69598503258
+天然胶 12.8020653633
+通栏 13.900677652
+四十八里 12.5143832909
+维多利亚州 11.3357282945
+薛居正 12.1089181827
+柯尔克孜族 10.1630080337
+税务局 11.1280889297
+红头发 12.5143832909
+打字纸 13.900677652
+宿州市 11.5027823792
+公共秩序 10.7226238216
+吴贵 13.2075304714
+分值 10.533381822
+针灸科 12.2912397395
+六合拳 12.8020653633
+脊中 13.900677652
+了无痕迹 11.9547675029
+奠礼 13.900677652
+模型表示 12.8020653633
+一贯作风 12.1089181827
+明晃晃 9.26594866375
+水泥砖 13.2075304714
+正邪 11.3357282945
+斗柄 10.8096351986
+于延兴 13.2075304714
+伊塔 11.2616203224
+分做 11.1280889297
+咫尺天颜 13.900677652
+金臣 13.2075304714
+双线 9.55687223012
+按件计酬 13.900677652
+青环 10.4349417492
+佛拉明戈 13.900677652
+洁白无瑕 11.7034530746
+黄镇球 13.2075304714
+制作业 13.900677652
+小宗之 12.5143832909
+约克夏 12.8020653633
+冯治安 12.2912397395
+吴起 9.56994431169
+痛定思痛 10.9562386728
+各提 11.9547675029
+心智 9.80633308975
+小仪法 13.2075304714
+当夜幕 13.900677652
+吴用知 13.2075304714
+青玉 10.9049453784
+哐啷 11.0103058941
+正酣 10.3453295905
+某类 10.642581114
+好几遍 10.4349417492
+寒痹 12.8020653633
+非洲之角 11.7034530746
+两百 10.3171587135
+尼安海 12.1089181827
+分内 10.4349417492
+马宗素 13.2075304714
+三百户 12.8020653633
+分册 10.6818018271
+罗桑意 13.2075304714
+张秉贞 12.2912397395
+周生生 13.2075304714
+扩散系数 12.2912397395
+青牛 10.8096351986
+平高电气 9.37888907493
+寒症 11.7034530746
+春景 11.1926274509
+数步 10.5684731418
+宽洪大量 12.2912397395
+小宝 9.41204128224
+达沃 11.9547675029
+连塔尔 13.900677652
+察察为明 13.900677652
+孙金铸 10.7226238216
+日久天长 11.7034530746
+肝胆照人 11.8212361103
+抢渡 10.1630080337
+于桂陵 11.598092559
+加拉拉 13.2075304714
+百株 13.900677652
+群魔乱舞 12.5143832909
+权衡再三 12.1089181827
+香闺绣阁 13.900677652
+伊始 9.12999302751
+撞出去 12.2912397395
+英雄榜 12.2912397395
+马廉访 10.4994802703
+木头人 10.8096351986
+警务室 11.1280889297
+鸡鸣狗吠 13.900677652
+汇隆 13.2075304714
+分出 8.33233314821
+大豆胶 13.900677652
+飞蛾投火 13.2075304714
+运球 11.5027823792
+数次 8.24119543622
+爱国活动 12.2912397395
+言兵 11.9547675029
+畏威怀德 12.1089181827
+阎柔 13.900677652
+斗智 11.2616203224
+两目 11.2616203224
+心有 9.80633308975
+刘绍先 13.900677652
+就合 13.2075304714
+心服 10.4041700905
+中小型机 13.900677652
+市名 12.2912397395
+痛心疾首 9.91169360541
+男儿身 13.900677652
+禹步 13.900677652
+抢滩 10.642581114
+急切需要 12.5143832909
+过关斩将 12.1089181827
+大中城市 8.91707103027
+两相 9.45802639549
+阳上亢 11.5027823792
+科佩尔 13.900677652
+双翼 10.2897597393
+兵来将挡 11.598092559
+余斌 10.765183436
+两盏 9.89334446674
+肉铺 11.8212361103
+心术 10.533381822
+立庐陵 13.2075304714
+两盆 11.2616203224
+规划者 13.900677652
+两盅 10.8561552143
+小盒子 12.2912397395
+心机 9.77354326693
+羁勒 13.900677652
+穆王好 12.8020653633
+两盘 10.0720362555
+伊夫 11.4157710022
+吴谦 13.2075304714
+一九七八年 11.7034530746
+二爹 11.0674643079
+两盒 10.642581114
+白鹭洲 11.8212361103
+易地 11.2616203224
+狄德罗 10.1394775363
+分党 13.900677652
+不均 8.4980002701
+打不住 11.2616203224
+期末数 11.7034530746
+通灵宝玉 12.1089181827
+熬粥 11.5027823792
+避雷针 11.2616203224
+胼手胝足 12.8020653633
+分光 9.77354326693
+守着 8.70218062071
+心材 11.1280889297
+南通市 10.7226238216
+维多利亚岛 12.2912397395
+静脉瘤 13.900677652
+分兵 8.1417758781
+数段 11.9547675029
+说头 12.8020653633
+大黄鱼 10.1394775363
+焊条 12.1089181827
+步队 12.5143832909
+张果老 11.9547675029
+受阻于 11.1926274509
+曾一夕 13.2075304714
+总控 13.900677652
+一团糟 10.8561552143
+清光绪 8.39534611604
+闻宋江 12.2912397395
+教育部高校学生司 13.900677652
+服从组织 11.5027823792
+双金属片 11.9547675029
+六言诗 12.8020653633
+哑巴吃黄 13.900677652
+青海 7.5871296057
+第二十届 10.642581114
+幸遇先 12.8020653633
+精雕细琢 11.3357282945
+查话费 13.2075304714
+麦类 10.1164880181
+天云山 12.1089181827
+敬奉 10.6818018271
+张太守 12.1089181827
+青浦 10.3171587135
+左营 9.62401153296
+聊聊天 11.3357282945
+乐宫 12.2912397395
+分争 11.598092559
+集中供热 10.765183436
+中国音协 13.2075304714
+妙岩 12.5143832909
+金鼓 10.0088573539
+第八十四回 12.2912397395
+货源 8.87023973058
+好几轮 12.5143832909
+曲逆侯 13.2075304714
+越遂成 12.8020653633
+能参详 13.900677652
+独门 9.49395840471
+言中 10.6818018271
+郑氏集团 13.900677652
+逃不过 10.3743171274
+独间 13.900677652
+米斯 10.8096351986
+耿秉 12.5143832909
+林冲误 13.2075304714
+分享 7.53592689512
+时势造英雄 12.5143832909
+千头万绪 10.4041700905
+金鼎 10.4994802703
+隆元年 12.5143832909
+一万七千 11.8212361103
+青洲 12.8020653633
+俞江 13.900677652
+分付 8.36728816325
+苟且偷安 11.9547675029
+康巴人 12.8020653633
+言义 12.8020653633
+高止山 13.2075304714
+愚鲁 12.8020653633
+特拉赫 12.2912397395
+环境分析 12.5143832909
+丁二世 12.5143832909
+运输费 11.7034530746
+数理 9.43476953332
+茌平 12.8020653633
+本专科 12.8020653633
+额定值 12.1089181827
+梨枣 12.8020653633
+尾形 12.1089181827
+德国电视一台 13.900677652
+担子 8.36728816325
+发言者 12.5143832909
+灯泡厂 13.900677652
+纪念币 12.1089181827
+深井泵 13.900677652
+梨果 12.2912397395
+塘沽港 13.900677652
+幽魂 11.2616203224
+水暖工 12.2912397395
+劫机 12.2912397395
+纸篓 11.7034530746
+小提 12.1089181827
+危险率 13.2075304714
+智多星 10.8096351986
+誓师大会 12.2912397395
+店主人 9.71102290995
+较坏 10.3743171274
+能源动力 11.4157710022
+刘锦 12.8020653633
+分业 11.2616203224
+恣心纵欲 13.900677652
+打不倒 12.1089181827
+余斤 12.8020653633
+民族性 11.0674643079
+腻在一起 13.900677652
+酥松 13.900677652
+十九万四千两 13.2075304714
+抗溶剂 13.900677652
+亚氯酸盐 13.2075304714
+卿真 13.900677652
+余方 13.2075304714
+在技术上 9.35738286971
+来料加工 11.3357282945
+金龙 8.88339781516
+分为 5.12112019609
+龙池 11.0674643079
+不许百姓点灯 12.8020653633
+金龟 10.4666904475
+和俊武 11.7034530746
+高级顾问 10.8561552143
+扑棱棱 11.1280889297
+格致余论 12.8020653633
+纺织机械 9.75754292558
+天线阵 11.7034530746
+动能定理 13.2075304714
+声名大噪 11.4157710022
+保利大厦 12.8020653633
+正身 11.0674643079
+瑞穗乡 12.8020653633
+叶公超 13.900677652
+返抵 11.7034530746
+十行 12.1089181827
+时髦女孩 13.900677652
+梨木 11.1280889297
+九左右 13.2075304714
+张定边 13.2075304714
+麦粥 11.9547675029
+惨遭 9.19114745066
+特里斯 13.2075304714
+分之 12.8020653633
+青涩 11.5027823792
+招灾惹祸 12.1089181827
+不知有汉 13.2075304714
+麦粒 10.7226238216
+牛绳 13.900677652
+一下子多出 13.2075304714
+幕后策划 12.1089181827
+汇集 7.89432449237
+通俗小说 11.1926274509
+孙媳妇 11.7034530746
+茫然无知 12.2912397395
+严重威胁 9.40086798165
+较场 13.900677652
+麦粉 11.7034530746
+刀斧手 10.0505300503
+山核桃 10.765183436
+正轨 10.6818018271
+铺轨 11.9547675029
+处世哲学 11.5027823792
+两桩 11.598092559
+总预算 11.3357282945
+显水 11.5027823792
+两档 11.9547675029
+金鸡 10.1164880181
+两桶 10.604840786
+死物 11.598092559
+正轴 13.900677652
+两桌 10.9049453784
+食用植物 12.2912397395
+广大青年 11.4157710022
+肓俞 12.8020653633
+两案 11.2616203224
+准妈咪 13.900677652
+栖霞县 13.900677652
+祥细 13.900677652
+二千艘 13.2075304714
+寒毛 10.9049453784
+伥鬼 13.2075304714
+祭地 12.1089181827
+抖起 12.8020653633
+数番 12.2912397395
+口头语 11.7034530746
+尾市 9.20019728618
+跌破眼镜 13.2075304714
+寇松线 12.2912397395
+挽手 12.1089181827
+师归周 12.8020653633
+金融服务 8.0229418702
+金鹰 8.93783302172
+竞拍者 11.3357282945
+两株 9.96885201925
+奶名 12.5143832909
+卿相 11.9547675029
+武氏家族 12.5143832909
+米南加 13.2075304714
+云龙山 12.1089181827
+分保 12.2912397395
+金鹿 11.3357282945
+清洁度 10.5684731418
+言体 12.5143832909
+两格 11.9547675029
+示范店 11.7034530746
+国共合作 8.81927328699
+两根 8.28390655431
+肯回 13.2075304714
+水泥柱 13.2075304714
+生唐 13.900677652
+祭坛 8.95903522937
+三百米 11.9547675029
+青气 11.2616203224
+柬埔寨语 13.2075304714
+逻辑 7.03687426052
+浴帽 13.900677652
+两栋 10.9562386728
+机遇期 11.1280889297
+佃户 9.12999302751
+训练部 11.0674643079
+白白地 9.49395840471
+长耳朵 11.7034530746
+辍耕 11.4157710022
+疏不间亲 11.9547675029
+合同规定 10.0294766411
+惨重 8.71889410168
+两栖 8.68574189437
+死火山 10.3743171274
+活龙活现 12.8020653633
+金鹏 10.604840786
+干流 8.00078029839
+撒酒疯 13.900677652
+同行同业 13.900677652
+文才武略 12.8020653633
+大佛像 11.598092559
+钢材价格 8.83177344976
+健步 12.1089181827
+楼窗口 13.900677652
+分会 8.64840422393
+玉带海雕 13.2075304714
+寒武 9.46986085313
+诛杀 9.32596667347
+绢绸 13.2075304714
+新风貌 11.8212361103
+教材 8.61747392324
+何曾 9.04864738806
+两棵 9.91169360541
+饾饤 13.2075304714
+证悟 11.8212361103
+中学英语 13.2075304714
+步行 8.230796729
+动员 7.68008748188
+感慨万端 10.9049453784
+抗议书 12.1089181827
+楼面地价 10.3743171274
+知行合一 11.1926274509
+斐洛 12.5143832909
+勾方加 13.900677652
+卡斯克 13.2075304714
+铅矿 11.4157710022
+金麟 12.1089181827
+金凤凰 11.9547675029
+主控制 13.2075304714
+克龙 13.2075304714
+昨日 5.01109366018
+圈子 8.39534611604
+耕层 11.0103058941
+两梯 13.2075304714
+藤甲军 12.1089181827
+甄珍 12.5143832909
+仿建 12.8020653633
+青河 11.9547675029
+曼尼 11.9547675029
+分作 8.95903522937
+惨酷 11.9547675029
+往来款项 13.2075304714
+重病号 13.2075304714
+摇摇手 9.91169360541
+心神 8.82550383674
+动听 9.69598503258
+水泥板 11.0674643079
+快捷方式 13.2075304714
+抢点 12.1089181827
+缫丝 9.48183704418
+鬼晓得 12.1089181827
+曼尔 12.5143832909
+福气 9.34680076038
+颂古非今 13.900677652
+杂树林 13.900677652
+动向 8.04560572977
+好几身 13.900677652
+圆心 10.3171587135
+金黄 9.02548032877
+干性油 11.3357282945
+斐济 9.80633308975
+水嘴 13.2075304714
+半月板 12.1089181827
+海费茨 13.2075304714
+不良习惯 10.9562386728
+心窍 10.5684731418
+米果 12.5143832909
+举手礼 13.2075304714
+正象 9.29550746599
+两步 8.1902506346
+清洁工 10.8561552143
+金融证券 11.7034530746
+城旦 11.2616203224
+又会在 11.2616203224
+心窝 9.5186510173
+卫市易 13.2075304714
+脑胀 11.5027823792
+对外开放 8.11378027061
+双扇 11.9547675029
+石棉网 13.2075304714
+六枝特区 13.900677652
+诏安 11.9547675029
+斗笠 10.0720362555
+孔明引 11.598092559
+数百 8.73019365694
+双手 6.50434235817
+手机袋 13.900677652
+好几起 12.8020653633
+长途旅行 11.1280889297
+裁断机 13.900677652
+双打 10.9562386728
+尾崎 13.2075304714
+纪念展 13.900677652
+兆周 13.900677652
+王汗 11.3357282945
+浩气长存 12.8020653633
+陈景润 11.8212361103
+曼德 10.4994802703
+尘灰 12.5143832909
+出资人 9.24671730182
+酣卧 12.8020653633
+韩浠芥 12.2912397395
+梳洗 9.04864738806
+祭告 10.533381822
+南京临时政府 9.72629038208
+弹簧锁 13.900677652
+神不知 12.2912397395
+议定书 7.94225295895
+田纳西州 11.0103058941
+布罗沃 13.2075304714
+龙驹凤雏 13.900677652
+灞陵 12.5143832909
+虹口区 12.1089181827
+纪念封 13.900677652
+房产信息 12.8020653633
+创维 9.48183704418
+隔离线 13.900677652
+绝色佳人 13.900677652
+瞧得起 11.0103058941
+证据 7.14490872999
+寒梅 11.9547675029
+旮旯儿 12.8020653633
+符合事实 11.0103058941
+子全 13.900677652
+金融城 10.765183436
+双戟 11.9547675029
+吴用正 13.2075304714
+望陇西 12.8020653633
+可多 9.72629038208
+万余千米 12.1089181827
+双拥 12.8020653633
+摸鱼 11.5027823792
+权威人士 9.23723855786
+电影节 8.77671367257
+钛铁矿 10.533381822
+姜味 13.900677652
+核大国 11.0674643079
+数盆 12.8020653633
+双拳 10.2630914922
+西北边 11.8212361103
+双拼 13.900677652
+寿限 11.4157710022
+数盏 12.8020653633
+浴巾 11.7034530746
+同列 10.9562386728
+克鲁 10.9049453784
+气急 10.0294766411
+喝倒彩 12.8020653633
+机票价 13.900677652
+徵收 13.900677652
+好几路 13.900677652
+幽香 10.1394775363
+食橱 13.900677652
+妙常 12.5143832909
+全延津 13.900677652
+两毛 11.7034530746
+双拐 11.5027823792
+福莱斯 11.9547675029
+落下风 13.900677652
+丧服 10.2371160058
+纵观 8.83808261895
+数目 7.16727576014
+小婿 12.1089181827
+幸恢旨 13.2075304714
+祭品 9.65218240993
+立夷男 13.2075304714
+铁哥们儿 12.8020653633
+钱玄同 11.7034530746
+乱蹦 11.8212361103
+尾巴 7.87481167815
+贝尔法斯特 11.598092559
+大不相同 8.71889410168
+大吉大利 10.9562386728
+尾差 13.900677652
+可夫 11.0103058941
+两段 8.87679713113
+小冲突 13.900677652
+城镇群 11.9547675029
+王龙安 13.2075304714
+寒栗 13.2075304714
+敬客 12.5143832909
+动土 11.4157710022
+声东击西 10.8096351986
+克洛伊 13.2075304714
+青山翠谷 12.5143832909
+顾虑重重 10.533381822
+旧调重弹 13.900677652
+心空 12.8020653633
+诳语 11.1280889297
+民族所 10.4994802703
+名医药 13.900677652
+徇私情 12.5143832909
+独霸 10.0088573539
+好久好久 9.94943393339
+空白一片 13.2075304714
+娇娇女 13.900677652
+空上 13.900677652
+引发 6.18600017817
+全部载 13.900677652
+本国产 13.900677652
+数着 10.0505300503
+三亿三千余万两 13.2075304714
+特里普 13.2075304714
+动因 9.66657114738
+铺起 13.2075304714
+心算 11.598092559
+全部轮 13.2075304714
+鸦片剂 12.8020653633
+蒲河 12.8020653633
+查兹贝 13.900677652
+斩草除根 10.4349417492
+公进京 13.2075304714
+王英布 11.7034530746
+治所 8.78268383956
+晓玲 13.900677652
+基因修饰 13.900677652
+周瑜恐 13.2075304714
+仿射 11.8212361103
+妮维雅 11.8212361103
+乔国老 12.2912397395
+擦碰 13.900677652
+白老健 12.8020653633
+资源网 13.2075304714
+糟得 12.1089181827
+尾山 12.8020653633
+混饭 12.8020653633
+万丈光芒 13.2075304714
+金鱼 9.77354326693
+仿真枪 12.1089181827
+吴郎 13.2075304714
+夯实 8.9519177616
+瞠目而视 13.900677652
+马到功成 13.2075304714
+瑷珲 10.0720362555
+尚子明 12.1089181827
+收寄 11.7034530746
+好意 8.57766767284
+书袋 12.8020653633
+八字桥 13.2075304714
+接手 8.64840422393
+饭盆 13.2075304714
+赵国则 12.8020653633
+杨氏姊妹 12.8020653633
+大围山 13.2075304714
+一牙 13.2075304714
+正负 10.3743171274
+鞋底 9.37888907493
+由镇升 12.2912397395
+二十四座 11.7034530746
+吴郡 10.4349417492
+泰坦尼克号 11.1926274509
+棒子 9.82314020807
+正路 10.2371160058
+创编 12.5143832909
+鄂粤赣 12.8020653633
+米易 12.8020653633
+乳房 8.15767446417
+莫应丰 12.8020653633
+肉芽肿 10.2117981979
+舒伊斯 13.900677652
+凤凰于飞 13.900677652
+退来 13.900677652
+吴逆 12.8020653633
+几十斤 10.9562386728
+笑容满面 10.604840786
+老眼光 12.5143832909
+青滩 13.900677652
+大仁秀 13.2075304714
+独院 11.2616203224
+司堂官 12.5143832909
+蓬岛瑶 13.2075304714
+证据不足 10.1394775363
+赵博 13.2075304714
+勿枉勿纵 13.900677652
+王民 13.900677652
+今是 13.2075304714
+两三千户 12.2912397395
+许幸之 12.5143832909
+神仙姐姐 12.8020653633
+食品质量 11.0674643079
+鞋带 10.4666904475
+苏克雷 11.4157710022
+广阳郡 11.3357282945
+总主笔 11.8212361103
+蒲江 12.1089181827
+杀虫药剂 12.8020653633
+鞋帮 10.7226238216
+动嘴 11.8212361103
+晚会节目 13.900677652
+泪千行 13.2075304714
+缩短 7.22864470651
+今春 10.2371160058
+食虫虻 12.2912397395
+创造型 13.2075304714
+鞋帽 10.8096351986
+仿真机 12.2912397395
+薄骨律 12.5143832909
+间接税 12.8020653633
+阿尔达布拉 13.2075304714
+宗教信仰 8.51160592216
+食欲 8.77077893705
+捞起 10.0720362555
+双排 11.8212361103
+寻秦记 13.2075304714
+通来 13.2075304714
+发短信 10.4041700905
+交上来 11.8212361103
+积肥 12.8020653633
+总想 9.30555780184
+左耳 10.9049453784
+兽孔目 12.5143832909
+青楼 9.93038573842
+卡尔逊 13.900677652
+妙境 11.9547675029
+哀婉 10.8561552143
+乐声 9.5062284973
+干酪根 12.2912397395
+粗制滥造 11.7034530746
+视听室 13.2075304714
+根艺 13.2075304714
+当应 13.900677652
+波斯猫 11.7034530746
+某村 11.2616203224
+成都电视台 13.900677652
+法场 10.3453295905
+后勤人员 11.1280889297
+市侩 11.2616203224
+博乔尼 12.5143832909
+伊丽沙 13.900677652
+两浙 9.41204128224
+天与人归 12.5143832909
+耳不旁听 13.2075304714
+环境参数 13.900677652
+狼藉 10.4666904475
+库式贡 13.2075304714
+保鲜剂 12.8020653633
+劫持 9.48183704418
+卡管理 12.8020653633
+争短论长 13.900677652
+认贼作父 12.1089181827
+氖管 12.1089181827
+叶至善 13.2075304714
+大肆宣传 11.7034530746
+氯酸 12.8020653633
+服兵役 9.65218240993
+守法 9.98865464655
+两派 8.89004235788
+较厚 9.16447920358
+人生旅途 12.2912397395
+市俗 12.2912397395
+游泳馆 11.0674643079
+报告文学集 13.2075304714
+特拉西 11.9547675029
+担当 8.37124856446
+宋灵州 12.8020653633
+长处 9.06439574502
+左联 10.5684731418
+食油 10.9049453784
+派利 12.2912397395
+辨别出来 11.7034530746
+正言 11.5027823792
+吴音 12.8020653633
+酒逢知己千杯少 12.8020653633
+感谢 7.49214886092
+八卦新闻 12.5143832909
+派别 8.33999602096
+普陀县 12.8020653633
+丛树林 13.2075304714
+长春碱 12.1089181827
+罗先生 11.9547675029
+十成把握 13.2075304714
+保和丸 11.4157710022
+屯昌县 13.2075304714
+两淮 9.46986085313
+长天老日 13.900677652
+尖岬 13.2075304714
+姨姐 13.900677652
+生长因子 11.1280889297
+担待 10.1630080337
+独酌 13.2075304714
+诗歌 7.37125881371
+大头儿 12.8020653633
+四千多名 13.2075304714
+张车伟 11.3357282945
+动兵 10.0720362555
+大黄蜂 10.8561552143
+糟塌 12.5143832909
+磁带机 11.7034530746
+开小灶 13.2075304714
+喘吁吁 10.4994802703
+万亿度 12.5143832909
+担保物 12.8020653633
+五六十里 11.0674643079
+某某 9.20019728618
+正离子 10.0720362555
+凤凰股份 12.5143832909
+友谊桥 11.8212361103
+汪钱唐 12.8020653633
+内脂 13.900677652
+出家为尼 12.8020653633
+疙疙瘩瘩 11.2616203224
+侄儿 8.1417758781
+足用 12.8020653633
+仿宋 10.642581114
+气象万千 11.3357282945
+左肋 12.8020653633
+涩味 11.9547675029
+受人之托 11.7034530746
+浴宝 13.900677652
+红色光 13.2075304714
+吴静 10.765183436
+祥符 11.0674643079
+担心 5.6505798994
+麻皮阿 9.61021821083
+燕悉起 12.8020653633
+鞋头 11.7034530746
+共产国际执委会 11.4157710022
+王敬继 13.2075304714
+老店新开 13.900677652
+三百种 13.2075304714
+陈氏 9.98865464655
+劫掠 9.17328983326
+李玉和 12.8020653633
+担忧 6.50372904935
+数点 11.4157710022
+完成学业 10.8561552143
+奥武甫 12.2912397395
+吴革 9.74179456862
+浴室 9.75754292558
+菌丝体 10.5684731418
+诛戮 9.77354326693
+法学家 9.20019728618
+朊病毒 13.900677652
+集齐 13.900677652
+白马庙 13.900677652
+圣路易斯市 13.900677652
+两汪 12.8020653633
+蠢物 11.0103058941
+曼声 11.7034530746
+程步高 12.5143832909
+宁荣二 11.5027823792
+妙妙 12.8020653633
+市井 9.37888907493
+哥顿 13.900677652
+那九曜 12.8020653633
+物理符号系统 13.900677652
+双数 10.9049453784
+战备值班 11.7034530746
+汉路权 12.8020653633
+罪魁祸首 9.65218240993
+伏波山 12.8020653633
+利小便 12.1089181827
+货殖 10.8561552143
+和维金 13.900677652
+马日事变 13.2075304714
+滑坡体 12.5143832909
+两汉 8.69119149913
+左脚 9.69598503258
+市亩 13.2075304714
+赶早儿 11.4157710022
+两江 9.18217878068
+盘点 9.41204128224
+瞿大人 13.2075304714
+刘鸿儒 10.765183436
+婚姻法 10.0088573539
+双支 13.2075304714
+塔尔博特 13.2075304714
+痴男怨女 12.8020653633
+两万四千一百 13.2075304714
+左腿 9.72629038208
+较力 13.2075304714
+运渠 11.7034530746
+胆略过人 12.8020653633
+商太古 12.8020653633
+金马 10.0940151622
+闲杂人等 10.604840786
+宦海中 12.8020653633
+真逗 12.1089181827
+钻尖 13.900677652
+巴纳恩 13.900677652
+吴雷 12.2912397395
+城市道路 10.0940151622
+市价 8.71329184614
+几十分钟 11.1280889297
+较劲 10.3453295905
+磨洋工 13.2075304714
+出生证明 12.8020653633
+楚浦 13.2075304714
+中日关系 11.3357282945
+金融债 8.64318227995
+正误 11.5027823792
+印地安人 12.5143832909
+较前 7.82533162089
+米怜 13.900677652
+麦秸 9.69598503258
+货款 9.29550746599
+痴呆症 12.8020653633
+曹洪字 13.2075304714
+妙处 10.642581114
+市上 10.1871055853
+封庆郡 12.8020653633
+丁石孙 13.900677652
+正课 12.1089181827
+寒潭 13.2075304714
+青森 12.1089181827
+石上书 13.900677652
+事在人为 11.2616203224
+种城邦 13.2075304714
+正说 7.73106691948
+曼塔 13.900677652
+心累 12.8020653633
+马仰人翻 13.2075304714
+尼义钞 13.2075304714
+张敬帅 12.5143832909
+左膝 11.9547675029
+以诚待人 13.2075304714
+姚襄 11.8212361103
+杨万里 10.9562386728
+利用光 10.9049453784
+唐永銮 11.598092559
+麦秆 10.642581114
+罗伯逊 11.2616203224
+加劲梁 12.1089181827
+两法 11.2616203224
+夹注号 13.2075304714
+鲁班爷 12.8020653633
+甾醇 10.4041700905
+吡哌酸 12.8020653633
+纪念室 12.8020653633
+沙努丁 13.900677652
+纵情声色 12.2912397395
+阿达婆 12.8020653633
+赵县 10.4994802703
+正论 11.7034530746
+复合树脂 13.2075304714
+铅皮 12.8020653633
+余暇 11.5027823792
+壶状 11.9547675029
+恨兵 11.9547675029
+两河 8.76487921493
+双方 5.75977919137
+双文 12.8020653633
+阿尔金 12.8020653633
+无用武之地 11.9547675029
+资金投入 9.12155415886
+拙计 13.2075304714
+舒筋活络 12.1089181827
+彭莹玉 12.5143832909
+幽默 8.41588071849
+步调 10.2897597393
+青梅 10.2630914922
+拥有权 12.8020653633
+祭台 10.4666904475
+无烟 10.7226238216
+巴厘岛 10.1871055853
+全国人大 8.61747392324
+祭司 9.17328983326
+拙讷 13.900677652
+双料 11.2616203224
+铺衬 12.5143832909
+用药者 13.2075304714
+固体声 13.2075304714
+中心法则 13.2075304714
+含辛茹苦 10.7226238216
+螺髻 12.8020653633
+一饮一啄 13.2075304714
+双晶 10.7226238216
+汲古阁 11.4157710022
+数片 11.7034530746
+二次收费 13.900677652
+新鲜出炉 11.0674643079
+屏息 9.35738286971
+动口 11.1280889297
+归山 10.642581114
+铺行 12.8020653633
+厉禁 13.2075304714
+违法活动 12.2912397395
+挽救 8.18036587537
+俞樾 11.4157710022
+红树林 9.56994431169
+邪魔 10.4349417492
+甄五臣 11.1280889297
+延长县 13.900677652
+量级 9.72629038208
+演习 8.59737274392
+只字不提 10.533381822
+祖厉 13.900677652
+叩响 11.598092559
+找上门 10.9049453784
+正街 12.2912397395
+寒泉 12.2912397395
+司利达 13.900677652
+邪鬼 13.2075304714
+金融司 11.1280889297
+大事去矣 12.1089181827
+五千五百余万元 13.2075304714
+心经 10.4041700905
+饥饿线 13.2075304714
+理性化 12.8020653633
+一走了之 10.2117981979
+焉得 11.2616203224
+阿娜斯 13.900677652
+冉希 13.900677652
+后脑 10.3171587135
+心结 10.9049453784
+一千五百辆 13.900677652
+皖东 11.0103058941
+左良 13.900677652
+纪念堂 10.9049453784
+心绪 9.03314320152
+关张 11.0103058941
+牧民 8.91707103027
+歉意 9.5062284973
+阜康市 12.8020653633
+梁红玉 11.0103058941
+步辇 11.0674643079
+煽火 13.2075304714
+肉质 8.44963919841
+正月初二 11.598092559
+钻开 12.5143832909
+吴门 11.5027823792
+双星 8.99540287354
+芒草 11.9547675029
+扣下来 11.8212361103
+金融区 12.8020653633
+某时 11.7034530746
+鄂温克 9.71102290995
+刘春明 12.5143832909
+传统观念 9.82314020807
+王述曾 11.8212361103
+嫁走 13.2075304714
+小蜜蜂 12.8020653633
+忍受着 9.93038573842
+双曲 10.604840786
+某日 10.2897597393
+斯普拉格 13.2075304714
+林风眠 11.5027823792
+肤色 9.11318590919
+於嘉轩 12.8020653633
+瓦胡岛 11.4157710022
+莫斯著 13.900677652
+此例 11.1280889297
+封之礼 12.8020653633
+稍低 10.0505300503
+网开一面 10.8561552143
+营地 8.16733637508
+钻心 10.3743171274
+鞋子 8.59737274392
+阿萨布 13.2075304714
+稍作 9.20932976975
+房日兔 12.5143832909
+货栈 10.2630914922
+赎身 10.604840786
+董忠 13.2075304714
+夺名 13.900677652
+天文单位 10.8096351986
+创造力 9.10488710638
+交通状况 10.2117981979
+此信 10.2371160058
+若合符 13.900677652
+共轭复数 12.8020653633
+毕竟空 12.8020653633
+冉庄 12.8020653633
+血液循环 8.57280148319
+寒气 9.53122979951
+钻得 11.8212361103
+刀伤 10.9049453784
+乐毅破 13.2075304714
+通信卫星 9.71102290995
+兴业县 13.2075304714
+敬德 10.1630080337
+该段 10.6818018271
+阿贝湖 13.900677652
+试验设备 11.4157710022
+正月初三 11.7034530746
+屈大均 11.598092559
+上海市委 10.6818018271
+健民 11.1926274509
+正月初七 12.1089181827
+正月初一 10.642581114
+十美元 13.900677652
+丰乐镇 13.900677652
+民族风格 9.74179456862
+双杠 11.0674643079
+双条 12.1089181827
+残兵败将 11.7034530746
+好几行 13.900677652
+小穗基 13.2075304714
+羸瘦 11.8212361103
+重修旧好 12.1089181827
+证明 5.97732944005
+此举 7.49876045525
+后腰 10.4041700905
+纳柘 11.8212361103
+此为 9.13850371718
+工业集聚 12.2912397395
+双杰 13.900677652
+不登大雅之堂 12.2912397395
+双板 12.2912397395
+双杆 13.900677652
+杨侗召 12.8020653633
+方正县 13.900677652
+深加 12.8020653633
+此一 10.8096351986
+二十四幅 13.2075304714
+锰钢 11.9547675029
+打不垮 12.5143832909
+惠来县 13.2075304714
+纪念奖 11.4157710022
+中资银行 9.21854642485
+吴钩 12.1089181827
+两湖 9.37888907493
+马贵斯 13.2075304714
+尖山区 13.2075304714
+西林县 12.8020653633
+敬帅 10.1871055853
+安王爷 11.9547675029
+金顶 9.7898037878
+此书 8.26588804881
+美食街 12.5143832909
+亚稳相 12.8020653633
+余万株 13.2075304714
+以逸击劳 13.2075304714
+吴铎 12.8020653633
+海赛木 12.8020653633
+动动 10.5684731418
+锰铁 11.7034530746
+妖气 10.8561552143
+耿纪 12.2912397395
+荣归 11.9547675029
+而今而后 13.2075304714
+果核 10.8561552143
+妖氛 10.765183436
+双机 12.5143832909
+动力 5.68810925374
+禹王 12.5143832909
+自然主义 9.45802639549
+犯罪预防 11.4157710022
+运气 8.35941410682
+乐毅离 12.8020653633
+腹膜炎 10.765183436
+日夜奋战 13.2075304714
+两清 11.598092559
+糟害 13.900677652
+稍事 9.59661255877
+价格上涨 7.16015829237
+吴铭 12.8020653633
+英雄美人 13.2075304714
+汉服 11.9547675029
+过河卒子 11.9547675029
+祭典 11.1280889297
+泰国人 11.8212361103
+超群拔类 13.2075304714
+欧阳建 12.5143832909
+集气 13.2075304714
+正解 12.1089181827
+移民部 13.900677652
+评头品足 12.8020653633
+莫塞尔贝 13.900677652
+栏目组 11.598092559
+害忠隐贤 13.900677652
+十克拉 13.900677652
+张鼐成 13.900677652
+此人 7.36398605438
+妖法 10.5684731418
+双柱 12.8020653633
+举例来说 10.6818018271
+两滴 10.642581114
+志节 12.1089181827
+私人企业 10.533381822
+穿住 12.8020653633
+正觉 11.0674643079
+法学士 13.900677652
+此事 6.41014824992
+双柏 12.2912397395
+正见 10.765183436
+金额 6.22698952271
+正视 9.00283785202
+正规 7.95787827685
+常年性 10.9049453784
+军需品 10.9562386728
+数珠 11.3357282945
+魏兵势 12.2912397395
+寒流 9.24671730182
+金领 11.8212361103
+和和睦睦 12.2912397395
+余晖 11.0103058941
+情逾骨肉 12.5143832909
+苏李诗 12.8020653633
+生而自由 12.2912397395
+数班 13.900677652
+运河 7.46613113319
+胶合板 9.96885201925
+全部记 12.5143832909
+尾声 8.42421410004
+动到 12.8020653633
+双枪 10.1630080337
+刘雨 11.7034530746
+中国林学会 13.2075304714
+外螺纹 13.2075304714
+夔门 11.3357282945
+铅直 10.2117981979
+大饱眼福 11.3357282945
+胎毛笔 11.8212361103
+稍为 10.3171587135
+达瑞 13.900677652
+夺命 11.5027823792
+正要 6.95466366088
+降雪量 11.1926274509
+双林 11.5027823792
+两溜 11.8212361103
+普安特 13.2075304714
+青檀 11.0103058941
+败鳞残甲 13.900677652
+米扬 13.900677652
+钻床 11.2616203224
+动刀 11.3357282945
+双枝 11.7034530746
+海外基金 10.6818018271
+上海社科院 11.0674643079
+金风 9.77354326693
+想通 10.0940151622
+布伦希 13.900677652
+双桥 11.598092559
+钻具 11.1280889297
+双档 12.8020653633
+口齿不清 11.3357282945
+一方面 6.03472223804
+奥尔忠尼 13.900677652
+祭师 11.5027823792
+双桨 11.1280889297
+格雷米奥 13.2075304714
+易势迁 13.900677652
+想透 11.8212361103
+轻音乐 11.3357282945
+腰椎间盘 11.7034530746
+不凡 9.00283785202
+叶长于 12.8020653633
+斩将搴旗 13.2075304714
+携带者 9.75754292558
+动工 8.50251495046
+较快 6.77378684308
+数米 9.80633308975
+越秀区 11.7034530746
+磁偏转 13.2075304714
+伊人 10.9049453784
+萨诺夫 13.900677652
+软件维护 12.1089181827
+北宗禅 12.5143832909
+不凭 13.900677652
+栖栖皇皇 12.8020653633
+终端产品 10.765183436
+一百八十斤 13.2075304714
+挽歌 10.8561552143
+两便 12.5143832909
+儿媳妇儿 13.2075304714
+动物传布 13.900677652
+妙哉 11.2616203224
+刘季篪 13.2075304714
+说些 7.96843246453
+骄傲起来 13.2075304714
+孟优 11.4157710022
+妙品 12.5143832909
+鉴戒 11.7034530746
+愚钝 10.6818018271
+某次 10.765183436
+说事 10.7226238216
+杀死 7.09384829158
+金革 13.900677652
+麦琪 13.900677652
+蒲柏 12.1089181827
+双根 13.900677652
+呆气 12.2912397395
+迎宾路 11.7034530746
+化工设备 11.1280889297
+牵引带 13.900677652
+浴场 10.642581114
+周期性 7.55504129115
+普林尼 11.598092559
+说亲 11.8212361103
+心烦 8.88339781516
+啪嗒 11.8212361103
+双栖 12.2912397395
+数百条 11.5027823792
+郦食其 12.2912397395
+呆账 11.5027823792
+双树 13.2075304714
+马基雅 11.1926274509
+抖落 10.2897597393
+米洛 11.8212361103
+何原因 11.0103058941
+棉籽油 11.8212361103
+花木场 13.900677652
+钻出 8.86372504956
+每星期 10.4349417492
+赏脸 10.7226238216
+钻凿 11.7034530746
+朴树 12.5143832909
+妈阁庙 13.2075304714
+颗粒归仓 12.8020653633
+数据管理 11.4157710022
+邪门 10.4041700905
+国难方殷 13.900677652
+束手缚脚 13.900677652
+啪唧 13.2075304714
+金鞭 11.8212361103
+克难 11.8212361103
+世界大国 10.9562386728
+盗抢险 11.5027823792
+肺循环 11.1280889297
+伊丽 11.9547675029
+联句 10.8561552143
+代工厂 11.8212361103
+南投市 13.900677652
+绳圈 12.8020653633
+抢种 13.900677652
+防疫站 12.2912397395
+辅助存储器 11.8212361103
+中日甲午 13.900677652
+一唱一和 11.0103058941
+卡斯塔 12.1089181827
+空气清新 10.2117981979
+选成 12.8020653633
+说书 9.36807815882
+唐宋之 11.8212361103
+日照计 12.8020653633
+不出 6.84622799384
+罗家伦 13.2075304714
+南明隆 12.2912397395
+数粒 12.5143832909
+玛纳斯县 13.2075304714
+金音 13.2075304714
+清凉世界 13.2075304714
+阿克敦 13.2075304714
+守恒 9.24671730182
+刘隆 13.2075304714
+十七种 13.2075304714
+二百一十块 13.2075304714
+逼死 9.85762638414
+吃现成饭 13.900677652
+黄公望 10.4041700905
+地理杂志 11.598092559
+克雷 10.533381822
+说下 11.0674643079
+啪啪 9.72629038208
+把柄 9.11318590919
+煤焦油 9.72629038208
+啪啦 10.9049453784
+米浆 12.5143832909
+心火 10.1394775363
+新闻简报 13.900677652
+廉洁自律 10.6818018271
+捞虾 12.5143832909
+双梁 11.8212361103
+军需官 11.4157710022
+几品 11.7034530746
+寒战 9.66657114738
+传记 8.89673134603
+一说到 10.533381822
+装饰城 11.7034530746
+较强 6.93182727363
+青文 13.900677652
+器量 11.3357282945
+得伟 13.900677652
+器重 9.01032852375
+食性 9.26594866375
+报雠雪恨 12.2912397395
+较弱 7.93709830836
+克罗地亚人 10.8561552143
+治教 13.900677652
+外文出版社 11.7034530746
+货架 10.1394775363
+北京市工商局 12.1089181827
+金阶 11.8212361103
+顶风冒雪 11.598092559
+绝径 12.8020653633
+妙善 12.8020653633
+戴面具 11.5027823792
+贮备 10.765183436
+左贡 13.2075304714
+立委 13.900677652
+姨夫 11.1926274509
+卖文为生 13.2075304714
+孤洁 13.2075304714
+缩紧 10.765183436
+江诗丹 12.2912397395
+凑手 11.8212361103
+示范园 12.2912397395
+肉色 11.1926274509
+孟买 9.44633035572
+含义丰富 12.8020653633
+运木船 13.2075304714
+小崽子 11.9547675029
+科学发明 11.5027823792
+金陵 8.51160592216
+比得过 12.8020653633
+谋发展 9.72629038208
+创痛 11.7034530746
+两性 8.30596627237
+自治领 9.72629038208
+米泉 12.1089181827
+大呼小叫 9.84023464143
+通假字 13.2075304714
+行年 13.900677652
+奥尔甫斯 12.1089181827
+魏兵屯 12.5143832909
+卖妻鬻子 12.1089181827
+灵丘县 12.2912397395
+货柜 11.598092559
+栖霞寺 11.8212361103
+减排 6.69950676869
+米波 11.598092559
+赵献可 12.8020653633
+专门术语 12.2912397395
+显摆 10.7226238216
+小支 12.8020653633
+保持者 12.5143832909
+创生 12.2912397395
+货机 11.4157710022
+金难 13.2075304714
+米氏 12.5143832909
+石棉瓦 13.900677652
+铜锣湾 13.2075304714
+六方晶系 11.598092559
+朱敬则 13.2075304714
+河直进 13.2075304714
+丧气 9.98865464655
+拥立 8.78268383956
+三万二千元 13.2075304714
+司道属 13.900677652
+心焦 9.65218240993
+蓬头垢面 10.4994802703
+空空荡荡 10.0088573539
+寻巧玲 13.2075304714
+较广 8.40350942668
+伊伦 13.900677652
+卡丁车赛 12.8020653633
+青春永驻 12.8020653633
+反响强烈 11.4157710022
+基建队 11.8212361103
+古埃及 8.87023973058
+金雷 13.900677652
+运抵 10.2371160058
+滞后效应 12.5143832909
+孟云 13.2075304714
+冉冉 9.54396882529
+苦里 13.900677652
+覆盆 12.1089181827
+四千多套 13.2075304714
+平房 9.22784881751
+不谦虚 12.2912397395
+左路 11.7034530746
+奥里萨邦 11.2616203224
+金雕 10.9562386728
+男孩子爱 13.2075304714
+心照 13.2075304714
+渠沟 12.2912397395
+多菌灵 12.8020653633
+征召入伍 13.2075304714
+宏业 11.598092559
+解赴军 12.8020653633
+八幅 11.9547675029
+居延塞 12.8020653633
+南兰陵 12.2912397395
+幅员辽阔 10.6818018271
+东张西觑 13.900677652
+深刻 6.75864107727
+米汤 10.2117981979
+圣卢西亚 11.0674643079
+游刃有余 10.1630080337
+子希声 13.2075304714
+畅销车 13.2075304714
+青松 9.80633308975
+青来 13.900677652
+金锣 13.900677652
+喷码机 13.900677652
+金锦 11.9547675029
+印出来 11.1926274509
+青杨 10.8561552143
+拙著 12.5143832909
+较差 7.80485308954
+王立太子 12.8020653633
+并网发电 11.1280889297
+等温线 10.5684731418
+鞋城 11.3357282945
+金锁 9.26594866375
+庚戌年 12.8020653633
+淘米 11.0103058941
+中美史克 13.900677652
+北京四中 12.8020653633
+门头沟 11.1926274509
+动心 9.14708746087
+八拜 11.598092559
+守护 8.70218062071
+诗文 8.00903344015
+三百公里 12.2912397395
+守拙 12.8020653633
+双模 11.598092559
+鞋垫 12.1089181827
+托斯基 12.8020653633
+正营 12.5143832909
+反动派 9.43476953332
+奥利韦拉 12.2912397395
+几响 13.2075304714
+正经货 13.2075304714
+功能属性 12.8020653633
+青木 12.8020653633
+省委书记 8.26946587015
+忠厚老实 13.900677652
+返校 11.1926274509
+金镑 13.900677652
+远征队 10.1871055853
+三清山 11.7034530746
+达科 12.5143832909
+干干的 11.9547675029
+动得 11.5027823792
+你哥 10.4041700905
+世界大同 11.7034530746
+代码生成 13.2075304714
+刘静 12.2912397395
+军需处 13.2075304714
+肉脯 13.2075304714
+全冠 13.900677652
+短期培训 13.2075304714
+数百架 12.1089181827
+温润 9.66657114738
+客服热线 10.1394775363
+突见 11.8212361103
+哀哀 10.5684731418
+钻台 13.2075304714
+成纳 12.8020653633
+克钦 12.8020653633
+愚陋 11.9547675029
+守戒 13.2075304714
+守成 10.8096351986
+哀哉 12.1089181827
+热风炉 12.8020653633
+花园酒店 13.2075304714
+平托 12.5143832909
+第二十四 11.2616203224
+数组 8.35941410682
+同房 10.5684731418
+洛修斯 13.2075304714
+八百多个 13.2075304714
+加强排 13.2075304714
+纪念品 9.75754292558
+王家桢 13.900677652
+突触 10.2371160058
+淡紫色 10.533381822
+哀哭 11.3357282945
+辨义 12.8020653633
+执法监督 12.5143832909
+剖腹藏珠 13.900677652
+不能抑制 12.1089181827
+心爱 8.63281949291
+金人战 13.900677652
+谢百三 10.9562386728
+动弹 8.80692745117
+侦获 13.2075304714
+卡吉米 13.900677652
+十二经筋 12.8020653633
+周家口 11.3357282945
+耕地 7.29537973103
+魏兵必 12.8020653633
+五十八万四千八百一十六公里 13.2075304714
+青枣 12.2912397395
+金门 9.56994431169
+王仁便 13.2075304714
+麦皮 13.2075304714
+阴丹士林 11.4157710022
+心物 12.2912397395
+皮光毛 12.8020653633
+青果 11.4157710022
+缩绒 12.8020653633
+数线 13.900677652
+坤宁宫 8.46695564842
+合运动 13.900677652
+银杏茶 13.900677652
+贾口洼 12.5143832909
+数级 11.1926274509
+两排 9.34680076038
+化合价 11.5027823792
+同质性 12.5143832909
+金锁记 12.8020653633
+日伪 10.1871055853
+西经 9.5186510173
+曼图 12.1089181827
+薛大妹妹 13.2075304714
+星级宾馆 12.8020653633
+心率 9.71102290995
+倡议书 11.1926274509
+向英王 12.1089181827
+缩缩 11.7034530746
+隐身飞机 11.8212361103
+切斯特 11.5027823792
+两批 9.55687223012
+吴领 13.2075304714
+镇咳药 11.8212361103
+亚麻布 11.0674643079
+阎王 9.38981814546
+两手 7.8184587416
+张思卿 13.2075304714
+两扇 9.31571017331
+溴水 12.2912397395
+炕洞 11.598092559
+琼华 11.4157710022
+两所 9.96885201925
+缩编 10.642581114
+洛贝林 13.2075304714
+介末 13.900677652
+希腊共和国 13.900677652
+比配 13.900677652
+显明 11.1280889297
+行同陌路 13.900677652
+蒯彻 12.8020653633
+董一元 12.8020653633
+中顾委 12.2912397395
+喊叫声 10.8561552143
+那径山 13.2075304714
+马斌 13.900677652
+钻到 9.14708746087
+两截 10.5684731418
+某样 13.900677652
+曹文诏 12.5143832909
+身在曹营心在汉 12.8020653633
+平均年龄 10.4041700905
+斗牌 11.598092559
+曹义勇 13.2075304714
+显晶 12.2912397395
+贮存 8.15767446417
+两房 10.604840786
+万分之一 9.98865464655
+某校 13.2075304714
+酥油 10.604840786
+大大超越 12.2912397395
+两户 10.5684731418
+金鑫 10.604840786
+万分之三 12.8020653633
+左转 10.604840786
+阿克曼 12.8020653633
+蒙莫朗西 12.5143832909
+两大洲 11.9547675029
+上海古籍出版社 10.0294766411
+长吟阁 11.598092559
+哀唤 13.900677652
+博古斯瓦 13.2075304714
+妖怪 8.41588071849
+不具 9.14708746087
+运思 12.5143832909
+即使如此 10.3453295905
+草标儿 13.2075304714
+八成 7.92179188707
+先进县 11.1280889297
+傅立叶 10.9049453784
+子相承 13.900677652
+万亿元 7.10050758367
+多少次 8.9102450652
+金钱 7.89432449237
+金钰 10.9562386728
+金钲 12.2912397395
+横征暴敛 10.0940151622
+阻击战 11.5027823792
+两拨 10.8561552143
+城池 7.88696249593
+左边 7.79143006921
+摩尔定律 13.900677652
+第五十四届 13.2075304714
+月全食 12.1089181827
+早稻 11.5027823792
+量子论 10.4994802703
+嘴笨 11.4157710022
+心猛 13.900677652
+慢性感染 12.2912397395
+金钩 11.4157710022
+七百八十多名 13.2075304714
+博尔盖 13.2075304714
+两拳 11.5027823792
+罗汝明 10.8561552143
+路副将 13.900677652
+金钗 10.7226238216
+任步赖 13.2075304714
+两担 11.1926274509
+金钟 11.0674643079
+文以明 11.9547675029
+镁光灯 11.4157710022
+祥瑞 10.0294766411
+两招 12.1089181827
+幽邃 11.1926274509
+第五架 13.2075304714
+金针 11.598092559
+七辑 13.2075304714
+科局级 13.2075304714
+金钏 11.4157710022
+钻劲 13.2075304714
+尽职尽责 10.7226238216
+金银 7.33119623156
+金铸 12.5143832909
+封到 12.1089181827
+金铺 11.8212361103
+卞氏 12.1089181827
+游泳队 11.1280889297
+金链 12.1089181827
+辨伪 10.8561552143
+当心 9.30555780184
+阜康县 12.5143832909
+两抹 12.8020653633
+食指 8.78268383956
+较少 7.09163834593
+劳动人民文化宫 12.1089181827
+金铭 13.900677652
+万分之二 13.900677652
+两把 8.65365357982
+斗狠 13.2075304714
+杜子春 13.2075304714
+突袭 9.46986085313
+金铜 11.598092559
+水泥浆 12.8020653633
+蛮荒之地 11.8212361103
+金铁 11.9547675029
+左迁 11.8212361103
+金铃 10.9562386728
+两折 11.7034530746
+肉肠 12.8020653633
+经济布局 10.533381822
+寒意 9.19114745066
+自相残害 11.9547675029
+朴正 13.900677652
+装饰品 9.04864738806
+真君笑 13.2075304714
+准妈妈 9.33632946051
+吴龙 13.2075304714
+侄妇 13.900677652
+黄病毒 13.900677652
+自鸣得意 11.4157710022
+洁白无暇 13.900677652
+交拜 12.5143832909
+于丹 10.3743171274
+贡单念 13.900677652
+席为业 12.5143832909
+正色 9.28555713513
+把持 8.76487921493
+奴隶社会 9.29550746599
+张仁愿 12.8020653633
+双汇 11.3357282945
+监护室 10.8561552143
+遂心满意 12.5143832909
+戎狄蛮 12.8020653633
+刘恒继 13.2075304714
+尉巩永 13.2075304714
+棱线 11.5027823792
+锻造厂 13.2075304714
+于东 11.1926274509
+达美 13.2075304714
+各抒所见 12.2912397395
+双江 11.8212361103
+人民日报社 12.1089181827
+东京国际 11.8212361103
+本行业 11.0103058941
+蒙迪欧 12.8020653633
+勇力 11.1926274509
+昆虫学 11.7034530746
+鉴明 13.900677652
+数码 9.00283785202
+碌曲 12.2912397395
+空前绝后 10.9562386728
+印尼队 13.2075304714
+孙立人 11.598092559
+姥爷 10.604840786
+发扬民主 11.4157710022
+米南德 12.2912397395
+耕农 13.2075304714
+义齿边缘 13.900677652
+寒暑 9.93038573842
+王修龄 11.9547675029
+民意代表 12.2912397395
+留学人员 11.8212361103
+幽静 9.32596667347
+耳聪目明 11.9547675029
+寒暄 8.83177344976
+施仁义 11.9547675029
+集邮者 12.5143832909
+宁信其 11.9547675029
+宗之弟 12.5143832909
+示范县 12.8020653633
+左行 13.2075304714
+顾盼神飞 13.2075304714
+何难之有 12.2912397395
+青山湖 13.900677652
+新面孔 10.9049453784
+耕具 13.2075304714
+两日 7.91171623509
+双泪 12.5143832909
+心理 6.27362023496
+两无 13.2075304714
+混编 11.4157710022
+八所 10.8096351986
+栖霞市 13.900677652
+杯酒释兵权 12.2912397395
+阳星 11.8212361103
+突进 10.1164880181
+举报者 11.9547675029
+中篇小说 9.08039608637
+向汉阳 13.900677652
+关塞 12.2912397395
+阿登纳 11.9547675029
+段会宗 13.2075304714
+结交到 13.900677652
+要害之地 12.5143832909
+于于 13.900677652
+布拉托夫 12.5143832909
+独饮 13.2075304714
+毁尸灭迹 11.5027823792
+正经话 11.1926274509
+四十元 11.9547675029
+全师官兵 12.8020653633
+两旁 7.81390292506
+螺旋杆菌 13.900677652
+白白嫩 13.2075304714
+邮政编码 11.1926274509
+曼允 12.8020653633
+计算机犯罪 12.2912397395
+于云 13.900677652
+归纳到 13.900677652
+曼克 13.900677652
+理该 12.5143832909
+请等一下 13.2075304714
+几百元 10.2897597393
+数碗 13.900677652
+不厌其烦 10.1871055853
+杭盼养 13.2075304714
+两斤 10.2630914922
+黄门官 11.1280889297
+尾号 10.4666904475
+寒春 12.1089181827
+一日游 10.8096351986
+双河 12.1089181827
+两方 9.62401153296
+玉海级 13.2075304714
+仿古 10.0088573539
+仕女画 13.2075304714
+抹粉施脂 13.900677652
+引吭 11.9547675029
+于今 9.01787572939
+俊雅 12.1089181827
+专业知识 9.84023464143
+游戏网 13.900677652
+两文 11.7034530746
+寒星 11.1926274509
+达罕 10.4994802703
+于仆 12.5143832909
+达罗 10.0720362555
+二千辆 13.2075304714
+卡斯尔 13.900677652
+备灾 13.900677652
+双沟 10.7226238216
+无声电影 11.9547675029
+侄女 9.27570483869
+示范区 9.61021821083
+付笑谈 13.2075304714
+基本成分 10.9049453784
+想错 11.598092559
+温伯格 12.1089181827
+小方 10.9562386728
+仿制 8.96620371885
+速效 10.7226238216
+敬告 12.2912397395
+塞尚 11.0674643079
+拙荆 12.5143832909
+返潮 13.900677652
+把戏 9.35738286971
+开本 11.1280889297
+聊聊吧 13.900677652
+独食 12.5143832909
+碘盐 13.900677652
+按时 8.18694484647
+好几艘 12.8020653633
+显性 9.5186510173
+第二十六 11.4157710022
+守方 11.3357282945
+第二十八 11.4157710022
+具体实施 10.2630914922
+双流 10.9562386728
+黄脉弦 13.2075304714
+持异议 11.1280889297
+哈特福 12.2912397395
+两摞 12.8020653633
+霍小玉 11.598092559
+上等兵 11.3357282945
+心疾 13.900677652
+于伟 13.900677652
+大佛山 13.900677652
+谚曰 12.8020653633
+走南闯北 10.6818018271
+摊手摊脚 13.2075304714
+诗抄 10.4349417492
+夏橙 12.2912397395
+食料 9.89334446674
+塞尔 10.1394775363
+特里格 13.900677652
+梳成 11.3357282945
+达维 11.9547675029
+心病 9.21854642485
+心痛 9.01032852375
+祭孔 11.4157710022
+处理量 12.8020653633
+柠檬黄 11.9547675029
+从河东 12.8020653633
+把手 7.68807155622
+地老天荒 11.7034530746
+心痒 10.9562386728
+爱吃鱼 11.9547675029
+轻量级 12.1089181827
+妖星 10.9049453784
+人民战争 9.93038573842
+寒林 11.598092559
+王文素 13.900677652
+二亿二千二百三十三万余两 13.2075304714
+高黎贡山 10.2371160058
+运星 13.900677652
+成何体统 10.642581114
+套环 12.5143832909
+放手一搏 11.7034530746
+寒极 11.7034530746
+斥资 8.82550383674
+千手观音 12.5143832909
+守旧 9.87532596124
+牲畜头数 11.1926274509
+数秒 11.0103058941
+中央档案馆 11.2616203224
+电子表 11.0103058941
+祭完 13.2075304714
+诗才 12.1089181827
+棱缝 13.900677652
+查尔迪 13.900677652
+地地道道 9.94943393339
+俄国防部 12.1089181827
+肉蛋 11.0103058941
+心甘 11.5027823792
+心生 9.38981814546
+根舍 13.2075304714
+阎甲 12.8020653633
+美食节 12.8020653633
+数种 9.75754292558
+谦退 12.5143832909
+瓦德森 13.2075304714
+伯雨师 13.2075304714
+夔龙 11.1926274509
+诛死 13.2075304714
+中共江苏省委 11.4157710022
+清洁剂 10.9562386728
+乐浪郡 11.2616203224
+貌不惊人 12.5143832909
+过不来 11.5027823792
+哀史 13.2075304714
+不连续性 11.5027823792
+决胜千里之外 13.2075304714
+哀号 10.604840786
+梳拢 12.1089181827
+哀叹 10.2117981979
+克主杰 13.2075304714
+心电 11.598092559
+通任督 13.900677652
+夏雪 9.29550746599
+大炮仗 12.5143832909
+牵线搭桥 11.7034530746
+步营 11.598092559
+塞尺 13.900677652
+圈套 9.02548032877
+吴鹏 11.8212361103
+诏命 10.4349417492
+蒲扇 10.3743171274
+证法 12.1089181827
+扁柏 11.4157710022
+守敌 11.5027823792
+先进个人 10.9562386728
+谦逊 9.13850371718
+曼倩 13.2075304714
+显影剂 12.2912397395
+德意志联邦共和国 10.8096351986
+固体化 13.900677652
+县委书记 8.91707103027
+经德萨 13.900677652
+上林县 13.900677652
+货损 12.2912397395
+全或无 12.5143832909
+韩邦庆 13.2075304714
+吴鹰 13.900677652
+不白之冤 11.4157710022
+宜在 10.6818018271
+梁太监 13.2075304714
+妙兰 11.0674643079
+健朗 12.5143832909
+寒月 12.8020653633
+鉴定结论 12.1089181827
+死求白赖 13.900677652
+两杯 9.54396882529
+运数 12.2912397395
+林冲来 11.9547675029
+天灯 11.5027823792
+吴天祚 12.2912397395
+祭堂 11.9547675029
+政体 8.00352378434
+活血化瘀 9.96885201925
+两杠 12.8020653633
+金融家 10.4994802703
+两板 12.8020653633
+待会儿 9.41204128224
+鞋号 13.900677652
+万亿吨 11.3357282945
+原汁原味 10.8561552143
+煤海 11.3357282945
+对庭 13.2075304714
+缝合处 13.900677652
+贫富悬殊 10.2630914922
+那口玉 12.2912397395
+心皮 9.41204128224
+舌敝唇焦 13.2075304714
+正职 10.8096351986
+两杆 11.5027823792
+括约肌 10.2371160058
+十辆 11.8212361103
+妈咪 11.7034530746
+挡土墙 12.5143832909
+双湖 12.2912397395
+两束 10.3743171274
+被困 9.15574552361
+询问者 13.900677652
+突起 8.3285236198
+麦片 11.3357282945
+西安地区 12.2912397395
+卿禄 13.2075304714
+借个 11.7034530746
+路景 13.2075304714
+两本 9.85762638414
+动容 10.2371160058
+动宾 13.2075304714
+玉石俱焚 10.1394775363
+斗着 12.8020653633
+检错码 13.2075304714
+幽长 13.2075304714
+亚麻子 13.2075304714
+肌注 10.4349417492
+桑相会 12.8020653633
+电子论 10.8561552143
+水吧 12.2912397395
+外语学校 12.2912397395
+两朵 10.3743171274
+霍尔姆 12.8020653633
+局级 12.1089181827
+鞋厂 12.1089181827
+关系恶化 11.5027823792
+难以言表 11.9547675029
+心目 8.05423887692
+直翅目 11.0674643079
+以情动人 13.2075304714
+东察合 12.5143832909
+李家兄弟 12.8020653633
+燕颔虎须 13.2075304714
+两期 9.35738286971
+旗袍装 13.900677652
+马宗汉 12.5143832909
+王家河 11.598092559
+丧母 11.1280889297
+高贵 8.61747392324
+心腹之交 12.2912397395
+二房东 13.2075304714
+想除 13.900677652
+派司 13.2075304714
+云龙县 12.5143832909
+挑不出 11.4157710022
+建言 9.69598503258
+开房间 13.900677652
+自动调谐 13.900677652
+瓶瓶罐罐 11.0103058941
+鞋印 13.900677652
+城楼 8.73019365694
+妇救会 12.8020653633
+祭墓 13.2075304714
+缺乏活力 12.8020653633
+达索 11.8212361103
+核燃料 9.44633035572
+两柱 12.1089181827
+所属单位 11.3357282945
+牛脖子 13.900677652
+背山面水 11.8212361103
+故剑情深 13.900677652
+返法 12.8020653633
+弗利胥 13.900677652
+仿冒 11.3357282945
+多金 12.5143832909
+赵玉英 13.900677652
+数章 13.900677652
+种俊德 12.5143832909
+北京大学 7.64492761022
+吴汝义 7.79588441956
+寻无常 11.9547675029
+萧合达 12.8020653633
+布拉格角 13.2075304714
+曹军远 13.2075304714
+花木兰 9.85762638414
+鞋匠 10.1871055853
+两枪 10.4349417492
+凉药 12.5143832909
+幽闲 12.2912397395
+诗意 9.18217878068
+混混儿 13.900677652
+双溪 11.598092559
+较多 11.7034530746
+经人介绍 11.2616203224
+侄孙 10.1871055853
+幽闭 10.765183436
+百科全书 9.05649056552
+发信机 13.900677652
+幽门 10.0940151622
+侄子 9.13850371718
+内丹派 12.8020653633
+金金 12.2912397395
+汝阴 11.7034530746
+任湘军 12.2912397395
+汝阳 10.8561552143
+盐税 10.0294766411
+较大 5.03029558591
+克郎 13.2075304714
+两极 8.70772080109
+质地 7.64301006409
+两枚 9.18217878068
+不良习气 12.8020653633
+诊断系统 13.2075304714
+金量 10.4666904475
+抗寒 10.8096351986
+十分复杂 9.40086798165
+诗情 10.4994802703
+翻过来 9.98865464655
+井户川 13.2075304714
+西林寺 13.2075304714
+回顾性 13.2075304714
+垂危之际 13.2075304714
+耿直 10.0088573539
+张贵庄 12.2912397395
+健旺 10.9562386728
+政协委员 9.45802639549
+数等 10.5684731418
+人民大众 9.89334446674
+皮日休 11.1280889297
+陆海空军 10.3743171274
+往外面 11.1926274509
+斯切尔 13.2075304714
+两晋 9.65218240993
+金通 10.1630080337
+祭天 9.89334446674
+揩手 12.8020653633
+淘汰制 12.8020653633
+头角峥嵘 12.2912397395
+铀酰 13.2075304714
+两晚 13.900677652
+老骨头 10.3743171274
+第二十卷 12.8020653633
+寒族 12.1089181827
+侄媳 11.598092559
+北京市总工会 13.2075304714
+吓死人 10.8096351986
+酥梨 11.5027823792
+数笔 11.9547675029
+阿鲁阿 13.2075304714
+布伦奇 13.900677652
+人民团体 10.3743171274
+哈特福德 12.5143832909
+滋养层 12.5143832909
+加榴炮 11.5027823792
+情理难容 12.1089181827
+国际广播电台 12.2912397395
+显扬 11.8212361103
+曼加 13.900677652
+斑头雁 10.8561552143
+诙谐 9.58318953844
+运输舰 10.9049453784
+曼努 12.8020653633
+运搬 13.2075304714
+半边天 11.0674643079
+正脊 13.900677652
+兆头 9.62401153296
+祭奠 9.15574552361
+科文特 12.2912397395
+阿克拉 10.9562386728
+来成龙 13.900677652
+拥簇 11.9547675029
+妙句 12.5143832909
+鹬蚌相争 11.3357282945
+心知 10.4041700905
+赔本赚吆喝 12.8020653633
+三十万匹 12.8020653633
+派发 9.44633035572
+易培基 13.2075304714
+想靠 11.8212361103
+覆灭 9.06439574502
+多人次 12.2912397395
+比利时队 13.900677652
+守望 10.6818018271
+学问好 12.8020653633
+数英里 13.900677652
+汝非 12.8020653633
+李秀英 13.900677652
+心真 11.9547675029
+数篇 11.7034530746
+金邦 11.598092559
+谢东闵 13.2075304714
+杜勒克 12.5143832909
+两曲 13.2075304714
+打不开 10.3171587135
+教改 12.8020653633
+马朝旭 12.1089181827
+挂帘 12.8020653633
+五胡十六 13.2075304714
+三津 13.2075304714
+横条 12.2912397395
+一唱三叹 13.2075304714
+艾穆趁 12.5143832909
+心眼 9.19114745066
+铁打江山 13.2075304714
+意谓着 13.900677652
+霍尔堡 12.2912397395
+单演函数 13.900677652
+斯之子 12.2912397395
+长足进展 11.598092559
+汝霖 12.1089181827
+贾政才 12.8020653633
+数算 13.900677652
+大年 10.0294766411
+罗经仪 13.900677652
+金都 11.7034530746
+游戏类 13.2075304714
+霍尔塔 12.8020653633
+湿软 13.900677652
+城根 10.4666904475
+田润生 10.3171587135
+布罗意 11.0103058941
+借书 11.5027823792
+劳动改造 10.2371160058
+黎明晨光 12.5143832909
+临猗县 12.5143832909
+曼利 12.1089181827
+诗性 12.1089181827
+好来 11.5027823792
+荒寒 12.1089181827
+横竖横 12.8020653633
+明白事理 11.598092559
+阶级性 10.533381822
+余定远 12.8020653633
+曹文轩 13.900677652
+克里 9.77354326693
+乌耆 12.8020653633
+亚洲地区 9.69598503258
+人造橡胶 12.1089181827
+二十一卷 12.5143832909
+踵接 13.2075304714
+第二十四届 11.0674643079
+愚不可及 11.7034530746
+电影迷 13.900677652
+右脚 9.80633308975
+描成 12.8020653633
+辛评 12.1089181827
+鸡犬之声相闻 13.2075304714
+猫儿山 11.5027823792
+涪陵 9.85762638414
+贝塔斯曼 13.900677652
+瓜仁 12.2912397395
+丙种球蛋白 11.8212361103
+全党全国 10.6818018271
+猜测出 12.8020653633
+景宗进 13.2075304714
+孔明收 12.8020653633
+学前教育 11.2616203224
+那回 10.3743171274
+资不抵债 10.4666904475
+两女 11.7034530746
+货店 12.5143832909
+货底 13.900677652
+乱冲 11.598092559
+不管怎样 8.93783302172
+姚兴病 13.2075304714
+哭成一团 13.2075304714
+一个九岁 12.8020653633
+分线 12.8020653633
+佩斯维尔 13.900677652
+友谊峰 10.8096351986
+赵贞女 13.2075304714
+分级 8.44109213783
+熟炭 13.900677652
+两套 8.9102450652
+十连 13.900677652
+南水北调 9.54396882529
+妖孽 10.6818018271
+冗费 13.900677652
+一一列举 12.1089181827
+踏踏 12.8020653633
+伊盟 12.2912397395
+荒寂 11.5027823792
+两天 6.55531281156
+某区 12.8020653633
+两大 6.48670736179
+排忧解难 10.8096351986
+城垣 9.34680076038
+诗律 11.8212361103
+右腕 12.1089181827
+控制关系 11.4157710022
+多少倍 10.4666904475
+分组 9.44633035572
+阿克巴 10.4349417492
+返利 13.900677652
+众多盆 12.5143832909
+自警 12.5143832909
+妙法 10.3743171274
+剑光 13.2075304714
+冗赘 12.8020653633
+十好几个 12.5143832909
+解除警报 11.9547675029
+完全小学 13.900677652
+分维 13.2075304714
+糟油 13.2075304714
+摘除术 11.8212361103
+装模作样 10.4041700905
+两处 8.30969067146
+双倍 9.82314020807
+妙用无穷 12.8020653633
+两夜 9.46986085313
+城垛 10.3453295905
+唐宋皆 13.2075304714
+没心 11.1926274509
+躺进 11.0674643079
+蝉联冠军 12.8020653633
+不愧为 10.0088573539
+吴中路 13.900677652
+五色缤纷 11.9547675029
+有感而发 11.0103058941
+砂锅 10.3171587135
+自设 10.642581114
+自许 10.9562386728
+右膝 12.1089181827
+蝶恋花 10.604840786
+青巾 11.8212361103
+徒有其表 12.5143832909
+换个儿 13.900677652
+青工 11.8212361103
+公司股票 7.55328844232
+自讨 12.8020653633
+自认 10.6818018271
+基层医院 12.8020653633
+自订 11.9547675029
+拉科西 11.8212361103
+说白 12.8020653633
+斐尔 13.2075304714
+断面 9.26594866375
+城址 9.21854642485
+青川 10.765183436
+青州 8.95903522937
+找对象 10.642581114
+病成 10.5684731418
+魏兵方 12.5143832909
+姚兴留 12.8020653633
+较松 12.5143832909
+常温奶 13.2075304714
+冉森 13.2075304714
+血盆大口 11.1280889297
+高举高打 10.765183436
+两委 9.5186510173
+兵痞子 12.8020653633
+激烈性 13.900677652
+雷鸣般 10.8096351986
+早教 11.4157710022
+勾魂摄魄 12.2912397395
+两三千元 12.1089181827
+储集层 11.5027823792
+监护权 12.1089181827
+锤骨 12.2912397395
+丰德寺 13.2075304714
+某县 11.8212361103
+自语 9.38981814546
+自诩 10.0720362555
+南安县 11.1926274509
+自该 11.7034530746
+尉迟乙僧 12.1089181827
+食堂 8.53470163695
+三亿五千零九十一万余两 13.2075304714
+此种 8.44963919841
+擅自作主 13.2075304714
+伊登 11.1280889297
+当不起 11.7034530746
+讨没趣 13.900677652
+支气管炎 9.75754292558
+铜仁地区 11.7034530746
+周人深 12.8020653633
+蕹菜 12.5143832909
+家长式 12.1089181827
+沉滓泛起 13.900677652
+宁阳侯 13.900677652
+自证 11.3357282945
+遨游 10.3743171274
+青山 9.06439574502
+曼泰 11.7034530746
+鹦鹉螺 10.4666904475
+牧牛 9.96885201925
+曼泽 13.900677652
+百顺 11.1926274509
+双全 10.8096351986
+开诚布公 11.0674643079
+城固 11.598092559
+促性腺激 10.4349417492
+躺躺 12.1089181827
+梨园 9.93038573842
+沸反盈天 11.9547675029
+石崖磷 13.2075304714
+送养人 13.900677652
+万亿次 12.2912397395
+宽裕 8.53470163695
+床第 11.9547675029
+曼法 13.2075304714
+双元 13.2075304714
+右耳 10.9562386728
+克利夫兰 10.765183436
+吴用堰 13.2075304714
+分群 12.2912397395
+边远 9.77354326693
+半导体 7.76727960898
+拉夫罗夫 12.2912397395
+言白语 13.2075304714
+明斯特 12.1089181827
+桂六省 13.2075304714
+妖娆 10.5684731418
+寒害 11.8212361103
+显山 11.598092559
+区域保护 13.900677652
+周家桥 12.8020653633
+冷待 12.2912397395
+岗位责任 13.900677652
+市立 11.0674643079
+边边 12.5143832909
+米哈 13.2075304714
+运上去 13.2075304714
+接待组 13.900677652
+半真半假 10.765183436
+司马懿 8.79473217808
+鞋油 12.5143832909
+男女生 12.5143832909
+丛里 11.2616203224
+亿亿吨 13.2075304714
+彭加勒 11.9547675029
+青少 11.9547675029
+显属 12.8020653633
+大宴宾客 12.2912397395
+两堆 11.8212361103
+彭世洛 13.900677652
+两堂 12.1089181827
+大回转 13.2075304714
+万众瞩目 10.0940151622
+大显神威 12.1089181827
+枯肠 13.2075304714
+揩拭 11.0674643079
+趿着 11.8212361103
+皮炎平 13.900677652
+斋戒日 12.8020653633
+成色 9.32596667347
+双凤 11.0103058941
+右肘 13.2075304714
+青峰 11.8212361103
+守夜 10.1871055853
+返台 11.8212361103
+库西宁 12.8020653633
+较晚 8.61747392324
+凝固剂 12.8020653633
+新词汇 13.900677652
+自我欣赏 12.2912397395
+臭虫 10.533381822
+宽衣 11.0103058941
+寒季 13.2075304714
+水泥地 11.2616203224
+固体潮 11.5027823792
+双出 11.8212361103
+元首 8.91707103027
+两声 8.4980002701
+七百余年 12.8020653633
+断除 13.2075304714
+丘门 11.8212361103
+右肾 12.8020653633
+新陈代谢 8.57766767284
+虚应故事 13.2075304714
+汉鲁恭 13.2075304714
+曲儿忒 13.2075304714
+能长生 13.900677652
+王家卫 11.4157710022
+两壁 10.7226238216
+覆亡 10.1164880181
+右肩 10.3171587135
+积累资金 12.1089181827
+右倾分子 13.900677652
+芝罘岛 11.8212361103
+深入 6.39904319409
+人力车 10.6818018271
+动摇 7.69007757495
+第七部 13.900677652
+拉希姆 12.8020653633
+寇松乃 13.2075304714
+鉴定 7.53764954844
+面粉袋 13.2075304714
+投资总额 8.83177344976
+鲁监国 11.0674643079
+丧命 9.75754292558
+库利科 13.2075304714
+毛乎乎 13.900677652
+欧麦尔 10.9562386728
+主观臆测 12.5143832909
+颇有同感 13.2075304714
+历史瞬间 13.900677652
+刘正宗 13.2075304714
+仲吕 12.8020653633
+较易 9.6811699468
+妖媚 12.8020653633
+架海金梁 13.900677652
+青岩 12.1089181827
+分署 12.5143832909
+青岗 12.8020653633
+望子成龙 12.1089181827
+守好 11.7034530746
+青山区 12.5143832909
+民族党 11.1280889297
+挽力 13.900677652
+青岛 7.31865251308
+格洛克 13.2075304714
+洗颈就戮 13.900677652
+黑檀木 12.5143832909
+科佩特 13.2075304714
+齐救燕 13.2075304714
+松土机 13.900677652
+曼氏 11.7034530746
+普林斯 12.5143832909
+不偏 11.0674643079
+分置 8.37522471284
+水泥块 11.5027823792
+哀求 8.9519177616
+挽具 12.1089181827
+犀利 9.20019728618
+友邦 9.03314320152
+木城涧 12.5143832909
+常宁县 13.900677652
+买房者 11.2616203224
+两季 8.99540287354
+分布式计算 13.2075304714
+作业点 12.8020653633
+三位一体 9.40086798165
+水合肼 13.900677652
+三棵树 11.598092559
+好色之徒 11.7034530746
+寒士 11.3357282945
+心痛病 13.900677652
+较早 8.48457724977
+北京电子管厂 13.900677652
+首饰 8.03989142851
+妖女 13.2075304714
+霍尔斯 12.8020653633
+北大荒 9.80633308975
+演算出 13.900677652
+此笔 10.2630914922
+献血车 13.900677652
+训练科目 13.900677652
+丘陵 6.84882202902
+文德斯 12.8020653633
+显影 10.765183436
+蒲州 10.4041700905
+马岭河 12.8020653633
+城市规划 9.28555713513
+兵马俑博物馆 12.2912397395
+醣类 13.2075304714
+二三万 11.2616203224
+乐在其中 11.5027823792
+小溪流 12.2912397395
+山後 11.3357282945
+归纳法 10.7226238216
+显形 11.7034530746
+清洁液 13.2075304714
+西沽武 13.2075304714
+埃朗根 12.2912397395
+郑光祖 11.3357282945
+入住率 11.2616203224
+双刃 12.5143832909
+双刀 10.0720362555
+此等 9.08039608637
+田平娃 11.9547675029
+诸密档 13.900677652
+暴利行业 12.2912397395
+气派非凡 12.8020653633
+双列 11.8212361103
+迷而不返 13.900677652
+锦官城 12.1089181827
+好多钱 12.1089181827
+尾流 11.1926274509
+克丘亚语 11.2616203224
+揩抹 11.9547675029
+胃扩张 11.7034530746
+纪实性 11.9547675029
+创世 9.4233408375
+思想束缚 11.8212361103
+创业 6.98495420334
+仿真器 12.5143832909
+和俊奇 11.5027823792
+显德 10.6818018271
+大显身手 10.4666904475
+煤气费 13.2075304714
+背靠背 11.7034530746
+妇女干部 13.2075304714
+显微 10.0720362555
+两对 9.29550746599
+创下 6.90766252904
+檀香树 13.900677652
+西祁王 13.2075304714
+先进武器 11.1280889297
+祖军 12.8020653633
+沈德鸿 13.2075304714
+高尔顿 11.2616203224
+百般挑剔 13.2075304714
+科技时代 13.900677652
+新西兰队 13.900677652
+创举 10.1871055853
+管理家务 11.9547675029
+显得 5.91213466924
+洪学智 12.5143832909
+扩音器 10.0940151622
+修辞手法 12.2912397395
+血清蛋白 11.9547675029
+伊丽娜 13.900677652
+名酒 9.80633308975
+乌尔根奇 11.598092559
+有事没事 10.3743171274
+花芽 11.1926274509
+政务院 9.89334446674
+动机 7.83225206373
+及格者 13.900677652
+十多里 11.1280889297
+一贯主张 10.8096351986
+妖妇 13.900677652
+往复运动 11.2616203224
+双动 12.5143832909
+两审 13.900677652
+说理 10.0940151622
+马景涛 12.8020653633
+宗咸亨 13.900677652
+伤气 11.7034530746
+自解 11.0103058941
+分米 13.2075304714
+青徐 12.8020653633
+未标明 11.598092559
+某军 12.8020653633
+分类 6.56113995657
+浴液 13.900677652
+贫民 8.6966709649
+奔逐 12.8020653633
+友道 13.2075304714
+流光溢彩 11.3357282945
+自觉 7.4023955025
+证号 13.2075304714
+间断分布 11.9547675029
+两宗 10.8561552143
+自视 11.1926274509
+吴越设 13.2075304714
+糟渣 13.900677652
+自见 11.2616203224
+笨伯 13.2075304714
+保健用品 13.2075304714
+青年 6.34896543662
+侯虎 12.8020653633
+朴厚 12.8020653633
+三百个 11.7034530746
+三百两 10.533381822
+青幽 13.2075304714
+贫气 13.900677652
+汽船 10.0720362555
+景德传 12.8020653633
+秦楼楚馆 12.5143832909
+守完 13.900677652
+创例 13.900677652
+百亿美元 10.2897597393
+边跳 11.7034530746
+完颜襄 11.7034530746
+双升 13.2075304714
+三百丈 12.2912397395
+做股票 9.98865464655
+双十 10.0088573539
+玻璃粉 13.900677652
+三百万 10.604840786
+右舷 11.9547675029
+蓝宝石 9.71102290995
+核心成员 10.9562386728
+贾蓉一一 13.2075304714
+解铃还需系铃人 12.1089181827
+阿克库 11.8212361103
+首页 9.89334446674
+结扎术 12.2912397395
+证券 4.68187320159
+段北坡 11.598092559
+八一电影制片厂 11.4157710022
+田中先 13.2075304714
+郑庄公 12.1089181827
+浴池 10.1630080337
+祝由科 13.900677652
+一百几十个 12.8020653633
+元魏 12.8020653633
+民族史 10.9562386728
+体检标准 11.9547675029
+公共租界 10.4666904475
+子维兄 12.5143832909
+博尔丁 12.8020653633
+劫后 11.0674643079
+广交朋友 12.8020653633
+联合利华 9.54396882529
+南阳盆地 10.2630914922
+葛逊 13.900677652
+青帮 11.4157710022
+十多道 12.8020653633
+食宿 9.69598503258
+土戏 13.900677652
+雷瑟福 13.2075304714
+常见问题 12.2912397395
+篆隶 12.8020653633
+杰纳布 13.900677652
+熊召政 12.2912397395
+花紫薇 13.900677652
+储备金 11.3357282945
+自行 6.92432958153
+储备量 10.2897597393
+汽艇 10.2371160058
+严重损失 10.3453295905
+青布 9.87532596124
+概率论 9.58318953844
+守寡 10.3171587135
+食客 9.84023464143
+祭文 9.38981814546
+夯歌 13.900677652
+三百亩 12.1089181827
+红头绳 11.5027823792
+女弟子 13.2075304714
+宣诏官 11.598092559
+创优 12.1089181827
+双叶 11.4157710022
+双号 11.5027823792
+九首 13.900677652
+双台 12.5143832909
+乐业安居 13.900677652
+八字墙 13.2075304714
+奋进号 11.9547675029
+说明会 10.0294766411
+葛郎 13.2075304714
+戏剧学院表演系 12.1089181827
+布伦斯 12.8020653633
+三十二万两 13.2075304714
+肠痉挛 13.2075304714
+腰酸背疼 12.5143832909
+韦德尼 13.2075304714
+双双 7.45495783259
+博尔代 12.2912397395
+意气洋洋 13.900677652
+养着 10.0720362555
+双发 10.9049453784
+第二十六位 13.900677652
+秦桧制造 12.2912397395
+显庆 10.2117981979
+万贵妃 12.8020653633
+寒夷 13.900677652
+首领 6.93559730637
+宠物鸟 13.900677652
+一锤子买卖 11.5027823792
+刘春华 13.900677652
+创作 6.26537376572
+边贸 11.3357282945
+优惠价格 11.3357282945
+首颗 12.1089181827
+杨正在 11.7034530746
+怀乡病 13.900677652
+十多部 13.2075304714
+猫步 12.8020653633
+东乡族自治县 12.1089181827
+十小时 10.3171587135
+寒夜 11.2616203224
+趺坐 13.900677652
+赵大夫 11.9547675029
+西文 11.7034530746
+卡拉斯 12.8020653633
+尤精通 13.2075304714
+第一零四回 13.2075304714
+色球层 13.900677652
+辣菜 13.900677652
+检阅台 11.9547675029
+自裁 11.2616203224
+九连城 12.1089181827
+武关往 12.2912397395
+下级组织 13.2075304714
+集结待命 13.900677652
+尾款 13.900677652
+青女 13.2075304714
+城口 12.8020653633
+丛钞 10.8561552143
+双周 12.8020653633
+七艘 12.8020653633
+蒲宁 12.1089181827
+抓小偷 12.8020653633
+尾欠 13.900677652
+丘道 13.900677652
+守岁 10.8096351986
+赵娟娟 13.900677652
+伊犁 8.62767809341
+沸水 9.46986085313
+乌烟瘴气 10.4666904475
+扫描时间 13.900677652
+岗陵 12.5143832909
+魏遂沿 12.8020653633
+天净沙 13.2075304714
+唐高宗 9.5062284973
+决不宽贷 12.2912397395
+长宁县 12.8020653633
+谗害 12.1089181827
+皇姑区 13.2075304714
+三角网 11.8212361103
+七色 11.8212361103
+字面上 10.3453295905
+叩关 12.8020653633
+木通 11.9547675029
+妙棋 11.7034530746
+感召力 11.1926274509
+福塞特 12.5143832909
+铅山县 11.9547675029
+收藏界 12.1089181827
+分站 12.1089181827
+城厢 11.598092559
+方口齐 13.2075304714
+把子 9.48183704418
+沸汤 12.1089181827
+人不知 9.5186510173
+自转 8.65365357982
+砂金 10.4349417492
+冉氏 13.2075304714
+无效力 13.900677652
+冷布 13.900677652
+健康 5.96652241844
+分立 9.11318590919
+张家树 12.8020653633
+乙硼烷 12.2912397395
+信托业 10.9562386728
+劫匪 10.9562386728
+敬洪 13.2075304714
+钻洞 11.598092559
+双合 11.9547675029
+伪誓 12.8020653633
+分章 12.8020653633
+缠上 11.0674643079
+局确定 13.900677652
+旰食 13.900677652
+傅璇琮 12.8020653633
+双向 8.51160592216
+布局调整 11.9547675029
+花前月下 11.0674643079
+本船 12.8020653633
+许生 13.900677652
+通于权 12.5143832909
+中国科学院动物研究所 13.900677652
+返国 9.75754292558
+氧化氮 12.8020653633
+鞋楦 12.2912397395
+孟珙 11.9547675029
+单人独马 12.8020653633
+友好城市 11.598092559
+马銮湾 13.900677652
+京韵大鼓 10.9049453784
+结构化编程 12.8020653633
+尾段 11.0674643079
+神号鬼哭 12.8020653633
+沸沸 13.2075304714
+宽赦 13.900677652
+把守 8.84443184663
+吹出来 11.598092559
+特里凡 12.2912397395
+魏尔兰 12.1089181827
+显妣 12.8020653633
+见下文 11.8212361103
+耶斯特 12.8020653633
+分工合作 11.0674643079
+返回 6.64508637772
+诗学 10.4994802703
+求真务实 11.598092559
+申请专利 11.7034530746
+憨头憨脑 13.2075304714
+珀迪 13.2075304714
+双响 13.2075304714
+表示悲痛 13.900677652
+犹豫起来 11.1926274509
+附着点 13.2075304714
+俄罗斯国际文传电讯社 13.2075304714
+一抹黑 12.1089181827
+城南 8.31342899358
+被保证人 13.2075304714
+完全缓解 12.8020653633
+递交国书 13.2075304714
+蒲子 12.2912397395
+七节 12.8020653633
+自述 10.2630914922
+米克 9.45802639549
+寒带 9.22784881751
+敌强我弱 11.1926274509
+祭拜 10.1871055853
+直布罗陀 10.3743171274
+药理作用 10.8561552143
+国无君 13.2075304714
+怨天怨地 12.2912397395
+难得糊涂 12.8020653633
+尾毛 10.533381822
+抓获归案 11.7034530746
+动感 9.01032852375
+石油输出 11.7034530746
+逍遥自在 11.2616203224
+米兰 8.77671367257
+查亚峰 12.8020653633
+不反 11.4157710022
+运往 8.62256299275
+滚动摩擦 11.7034530746
+氧化汞 11.2616203224
+羊场 11.7034530746
+劫去 11.0674643079
+纳福 11.7034530746
+封申伯 13.2075304714
+城北 8.39534611604
+神烈山 13.2075304714
+海西蒙古族藏族自治州 10.533381822
+随国 12.2912397395
+广发行 11.8212361103
+哀歌 10.765183436
+英宗弟 12.5143832909
+言笑 11.8212361103
+伊王 13.2075304714
+曼森 12.2912397395
+分辨是非 13.2075304714
+武士道 11.1280889297
+各投 13.900677652
+渗进来 13.900677652
+林南汪 12.8020653633
+做做 9.65218240993
+一年计划 13.900677652
+市级 9.25628675283
+两届 9.62401153296
+孟特 11.3357282945
+白岩松 10.4994802703
+卡斯族 12.8020653633
+水泥厂 9.62401153296
+两层 8.4284069783
+三大作风 12.5143832909
+恶风 10.642581114
+分管 8.65893063692
+电脉冲 11.1926274509
+健忘 9.94943393339
+航空母舰 8.52539924429
+宁陵 11.1280889297
+伪证 10.8561552143
+别办 13.900677652
+动情 9.15574552361
+制作方 11.9547675029
+秃鹫 11.1926274509
+枫丹白露 10.9049453784
+大型商场 11.1280889297
+蓝星 10.2371160058
+言筌 13.2075304714
+北固山 11.1926274509
+两尾 11.9547675029
+耍手腕 12.8020653633
+两尺 10.8561552143
+此类 7.36688881404
+大气候 10.3453295905
+云龙桥 12.8020653633
+无端指责 13.2075304714
+寒微 10.604840786
+哈尔麻 12.8020653633
+贾母喜 12.2912397395
+有事相求 12.5143832909
+落在后面 10.8096351986
+洛亚蒂 13.2075304714
+优秀学生 10.9562386728
+京广铁路 8.94485059437
+两尊 10.6818018271
+闹事者 11.598092559
+保证价格 12.5143832909
+锁骨 10.1164880181
+冯家爱 13.2075304714
+晚饭时间 12.2912397395
+两封 10.5684731418
+韦查耶 13.2075304714
+厦华 11.598092559
+尚方剑 10.0505300503
+辐射交联 13.900677652
+装机容量 8.22392384971
+闻其臭 13.2075304714
+姚兴灭 13.2075304714
+夏婆子 13.2075304714
+印地安纳 13.900677652
+齐烟九点 13.2075304714
+百无一失 13.900677652
+寒彻 13.900677652
+不上不下 11.9547675029
+迅猛地 11.4157710022
+小本 10.9562386728
+学校成绩 12.8020653633
+自身 5.87385407576
+坦直 12.2912397395
+青壮 11.7034530746
+王家坝 13.2075304714
+球化剂 12.8020653633
+金融性 12.1089181827
+十户 11.0103058941
+两三张 12.8020653633
+倔犟 10.2630914922
+浮尘子 13.2075304714
+司职 11.9547675029
+两三千吨 13.900677652
+翘首企盼 13.2075304714
+挽回 8.61241062128
+影视作品 10.8096351986
+渔获量 11.7034530746
+人口学家 13.2075304714
+好事不出门 11.7034530746
+水产 8.170577869
+同聚 12.2912397395
+赵松寿 10.0505300503
+大堡礁 10.7226238216
+丧偶 11.1926274509
+酒精肝 13.2075304714
+七零八碎 13.2075304714
+曼格 12.8020653633
+大河网 9.63799777493
+标准单位 12.8020653633
+一波三折 9.80633308975
+鞋样 13.900677652
+气数 10.0088573539
+两岸 6.94508504358
+汉灏辨 11.8212361103
+分等 11.3357282945
+黑洞洞 9.59661255877
+于石 13.2075304714
+见招 13.2075304714
+申辅时 12.2912397395
+秃鹰 11.8212361103
+解囊 12.5143832909
+丙烯腈 10.7226238216
+动怒 10.0940151622
+两岁 9.04086524761
+巴利阿里 12.1089181827
+双喜 7.5273578624
+声名大振 11.8212361103
+层林尽染 12.8020653633
+百分之八点 11.7034530746
+亲眼所见 10.5684731418
+心事 7.8184587416
+自费 10.3453295905
+养牛场 13.900677652
+机床附件 13.900677652
+名门 10.0088573539
+侍皇后 12.8020653633
+自贬 12.2912397395
+自购 10.4349417492
+哀悼日 12.1089181827
+哈拉韦 12.2912397395
+历少保 12.8020653633
+诸兄弟 12.2912397395
+寒峭 12.8020653633
+盛鱼 12.8020653633
+安徽大学 11.9547675029
+名闻 10.1394775363
+自责 9.44633035572
+人满为患 10.7226238216
+青子 13.900677652
+把头 7.80485308954
+工资表 11.7034530746
+上升段 13.900677652
+檀香油 12.5143832909
+不去 7.48068272383
+尾椎 10.4994802703
+伪装 8.47572763449
+两当 12.1089181827
+陆逊之 11.0674643079
+食府 13.900677652
+蒲姑 12.8020653633
+木结构 9.25628675283
+宽边 11.598092559
+刑事诉讼法 9.84023464143
+两张 8.50251495046
+故态复萌 11.9547675029
+卢象升 8.60737282725
+折辩 12.1089181827
+两强 10.8096351986
+丛集 11.4157710022
+两弹 12.2912397395
+源自 8.58255765813
+一千六百四十三所 13.2075304714
+显学 10.8561552143
+吉凶未卜 12.2912397395
+显存 13.900677652
+两式 11.9547675029
+棵儿 13.900677652
+麻将桌 11.598092559
+城内 7.29267702668
+两开 12.5143832909
+梳头 9.22784881751
+自赎 12.1089181827
+自赏 11.9547675029
+于瑜 13.900677652
+马耳他人 12.2912397395
+酒后失言 12.5143832909
+平襄侯 13.2075304714
+西游记 9.80633308975
+万贯文 13.900677652
+白转青 13.900677652
+心上 7.90422556336
+二次能源 12.2912397395
+李英民 11.8212361103
+李归伯 13.900677652
+寒山 11.8212361103
+显宿 13.2075304714
+宾努亲王 12.8020653633
+双园 12.8020653633
+自足 10.8096351986
+混合策略 13.900677652
+思忖 8.96620371885
+惊慌失色 13.2075304714
+党的建设 9.62401153296
+罗绍威 13.2075304714
+城关 9.5062284973
+显宦 11.4157710022
+瞑目 10.1394775363
+显官 11.1926274509
+赵君卿 13.900677652
+心中 5.23799979382
+不可言喻 13.900677652
+较慢 8.97342396682
+元麦 12.8020653633
+显宗 11.598092559
+兆惠 11.7034530746
+保险经纪 13.2075304714
+心丹 13.900677652
+恶魔 9.46986085313
+两忘 13.900677652
+双回 13.2075304714
+二盒 13.900677652
+周平王 11.4157710022
+青家 12.5143832909
+黄丝藻 12.5143832909
+观日 12.8020653633
+工资袋 13.900677652
+棵子 11.4157710022
+山引江 12.5143832909
+伯比奇 13.2075304714
+依门傍户 13.900677652
+细节性 12.8020653633
+非你莫属 12.2912397395
+叶公好龙 13.2075304714
+万多顷 12.8020653633
+化纤工业 11.8212361103
+恶鬼 9.5186510173
+梳妆 9.94943393339
+鄂拉山 12.2912397395
+安康地区 13.2075304714
+折辱 11.8212361103
+皮坚厚 13.900677652
+七股 12.5143832909
+健将 10.2897597393
+株蔓 13.900677652
+喉骨 13.900677652
+火居道士 12.8020653633
+思忆 12.5143832909
+显富 13.900677652
+稍缓 10.9049453784
+阎乐 12.5143832909
+米卢 13.900677652
+米卡 12.8020653633
+转业军人 11.9547675029
+澎湖群岛 13.900677652
+成倍增长 10.4666904475
+虎耳草 11.7034530746
+精梳机 13.900677652
+整座 9.31571017331
+忘我精神 13.2075304714
+哈拉雷 11.8212361103
+周家渡 11.9547675029
+两幢 11.4157710022
+守得 10.8096351986
+自相残杀 10.3171587135
+两广 8.99540287354
+于宪宗 13.900677652
+于田 10.8561552143
+自谦 10.9049453784
+夏坚白 12.8020653633
+搓澡 11.5027823792
+吴良辅 10.1164880181
+没空 10.4349417492
+蒲与路 12.2912397395
+花岗闪 13.900677652
+马尔伯 12.2912397395
+孟灵 11.5027823792
+两幅 9.54396882529
+今川北 12.8020653633
+北京市统计局 13.2075304714
+江州蔡 13.2075304714
+耿介 10.9049453784
+没穿 11.1926274509
+北回铁路 11.4157710022
+自谋 11.1280889297
+显威 12.1089181827
+米加 11.4157710022
+蒲墨 12.8020653633
+蒲墩 13.900677652
+自调 12.8020653633
+两帮 13.2075304714
+分科 10.3453295905
+分秒 13.2075304714
+两席 10.4666904475
+米子 13.2075304714
+普里高 12.2912397395
+永恒性 12.1089181827
+泾阳 11.5027823792
+时令蔬菜 13.2075304714
+自知理亏 11.5027823792
+尾桨 13.2075304714
+穆斯塔法 12.1089181827
+耿京 12.8020653633
+宁公主 13.2075304714
+心俞 13.2075304714
+自豪 8.62767809341
+泽及枯骨 13.900677652
+第几页 13.2075304714
+综合大学 10.9562386728
+并蒂莲花 13.2075304714
+分种 11.8212361103
+外语教学 11.9547675029
+工间操 12.5143832909
+小明王 11.3357282945
+炙热 10.8561552143
+两师 12.8020653633
+某君 13.2075304714
+两市 6.12372324865
+脊柱 9.32596667347
+双圈 12.2912397395
+阿法尔 11.9547675029
+耿二 12.5143832909
+全党全军 12.2912397395
+各项 6.66002795772
+两帖 12.8020653633
+官赞礼 13.2075304714
+沙拉 11.0103058941
+阿尔 9.34680076038
+性早熟 11.9547675029
+王桢著 13.2075304714
+子嗣数 13.900677652
+斗争 6.0404925945
+第七集 13.900677652
+武淳 13.2075304714
+各题 12.5143832909
+那妙玉 12.8020653633
+双基 11.9547675029
+青嫩 12.2912397395
+施凤来 13.900677652
+终其身 13.900677652
+邹衍 11.0103058941
+霍利菲尔德 13.2075304714
+中间色 11.9547675029
+由豫鄂 13.2075304714
+伊然 12.5143832909
+心传 12.8020653633
+米制 11.9547675029
+分社 9.69598503258
+牵来 10.4994802703
+动手 7.102737239
+米利 11.0103058941
+太阳热 13.900677652
+新潮流 11.1926274509
+尾梁 13.2075304714
+室颤 12.1089181827
+仁人君子 11.3357282945
+从上到下 10.1871055853
+基钦 12.8020653633
+煤气表 13.900677652
+断送 9.61021821083
+平地一声雷 12.1089181827
+两度 8.69119149913
+两座 8.0746775446
+四脚 11.1280889297
+栽苗 13.2075304714
+分神 11.5027823792
+评委会 10.4041700905
+收容所 12.1089181827
+毕业设计 12.8020653633
+葛针 12.5143832909
+王炳 12.1089181827
+两床 11.9547675029
+真能干 12.8020653633
+树根头 12.2912397395
+零敲碎打 11.598092559
+加紧训练 12.1089181827
+青苹果 10.0294766411
+游魂野 13.2075304714
+开曼 12.1089181827
+罗长礼 10.1871055853
+发聋振聩 13.900677652
+塔普苏 13.2075304714
+脑脊髓 11.7034530746
+急性症状 13.2075304714
+大都市圈 11.8212361103
+雄伟壮观 10.2897597393
+四隅 11.5027823792
+两全 10.2371160058
+卧下 12.1089181827
+敬慎 12.2912397395
+帕鲁 13.900677652
+急起直追 12.1089181827
+古纳河 13.2075304714
+元通 11.0674643079
+命运多舛 11.3357282945
+敬慕 11.7034530746
+侯赛 13.900677652
+仿木 12.5143832909
+两具 9.87532596124
+抿着嘴笑 11.8212361103
+脊梁 9.21854642485
+澈悟 13.900677652
+梅梅似 13.2075304714
+某字 12.8020653633
+运单 12.2912397395
+勇于创新 11.0103058941
+汰去 13.900677652
+两元 10.765183436
+发踪指示 13.2075304714
+成药 10.8561552143
+出漏子 13.2075304714
+同质化 9.77354326693
+双塔 10.1394775363
+运十 13.900677652
+两党 10.1394775363
+蔡松坡 13.2075304714
+马家庄 11.0103058941
+伊红 13.2075304714
+装饰板 11.9547675029
+地狱火 13.900677652
+掉队 10.1630080337
+领土问题 11.598092559
+敬意 9.09665660724
+卡内基 10.8096351986
+担保人 10.6818018271
+后兀良 12.8020653633
+远交 12.8020653633
+克留格 12.8020653633
+曼斯 12.5143832909
+蒲城 11.8212361103
+胖头鱼 12.8020653633
+振奋精神 11.598092559
+关键点 9.69598503258
+双堆 12.2912397395
+一百零八个 13.900677652
+相际传 13.2075304714
+声名在外 13.900677652
+衣衫不整 11.1926274509
+分相 13.2075304714
+侯贤 13.2075304714
+自荐 10.4994802703
+厦新 13.900677652
+想像成 13.2075304714
+鉴别 8.24119543622
+浴血战斗 13.2075304714
+预防为主 11.1926274509
+转让技术 11.4157710022
+如此这般 9.82314020807
+吴天保 12.5143832909
+守候 9.01787572939
+穿着入时 12.5143832909
+博斯腾湖 10.8096351986
+那家伙 9.69598503258
+健健康康 11.9547675029
+救国团 13.2075304714
+奔驰 8.17382990439
+黑钨矿 11.5027823792
+灵活运用 10.1394775363
+奔马 10.604840786
+担保书 11.7034530746
+英宗力 13.2075304714
+示范村 12.5143832909
+双声 11.598092559
+梨形 9.93038573842
+南涧县 13.900677652
+巨帆 13.2075304714
+诗坛 10.0294766411
+曹元锦 12.8020653633
+小枪 12.8020653633
+荼毒 11.1926274509
+水刘洪 13.2075304714
+春玉 12.5143832909
+双壁 12.1089181827
+麦丹月 13.2075304714
+卡塔尔人 12.8020653633
+蒲圻 10.2897597393
+模糊地 10.4041700905
+构造类型 11.7034530746
+迪梅泽格 13.2075304714
+航空工程 11.2616203224
+断齿 13.900677652
+水吉镇 12.8020653633
+通雨阻 13.2075304714
+夏丐尊 11.8212361103
+刘瑾因 13.2075304714
+水中捞月 12.5143832909
+某家 10.533381822
+早搏 12.8020653633
+笺谱 13.2075304714
+右角 12.1089181827
+婴幼 13.900677652
+檀香扇 11.1926274509
+殷馗善 13.2075304714
+破记录 12.2912397395
+三百余堵 13.2075304714
+泛神论 11.0674643079
+肩关节 11.1926274509
+忆苦思甜 11.0103058941
+大有益处 11.3357282945
+操土功 13.2075304714
+两册 11.3357282945
+诗圣 11.7034530746
+先进性 10.6818018271
+卡里亚斯 12.8020653633
+长足进步 11.2616203224
+伯颜帖 13.900677652
+两军 8.13235665618
+九连环 12.1089181827
+吕先生 10.8096351986
+突起来 13.900677652
+俩分 13.2075304714
+各音 11.5027823792
+航天中心 12.1089181827
+守军 8.69119149913
+伤寒论 10.4041700905
+修色斯 13.900677652
+喉镜 11.9547675029
+纵目四望 13.2075304714
+稍热 12.2912397395
+存储技术 11.8212361103
+妙文 12.2912397395
+各队 10.4666904475
+城建 9.4233408375
+埃罗菲斯 13.900677652
+措置失当 13.900677652
+蒙先帝 12.5143832909
+麻将机 12.8020653633
+除钙剂 13.900677652
+绥滨 12.8020653633
+双奇 13.900677652
+吴敦义 12.1089181827
+七轮 12.1089181827
+治安状况 11.7034530746
+第七项 13.900677652
+胡搅蛮缠 10.8561552143
+双套 12.8020653633
+北大街 11.0103058941
+归化城 11.7034530746
+主观臆断 11.9547675029
+胜败乃兵家常事 11.598092559
+七载 11.598092559
+各阶 11.598092559
+肺大泡 11.8212361103
+矫治器 12.5143832909
+闻名于世 9.17328983326
+小处着手 13.900677652
+周家恩 13.2075304714
+运到 8.53470163695
+嵊泗 11.598092559
+元配 11.8212361103
+英宗升 13.2075304714
+钱凤览 9.77354326693
+白令海 10.4349417492
+双头 9.69598503258
+不破不立 13.900677652
+体检中心 11.2616203224
+右行 13.900677652
+空军基地 8.77671367257
+稍点 13.900677652
+吕特维 13.900677652
+特里尔 11.8212361103
+两倍 8.37921673411
+右衽 11.8212361103
+痛入骨髓 13.900677652
+赵固 11.8212361103
+沈先生 11.598092559
+官厅水库 11.0674643079
+过不去 8.71889410168
+党的政策 10.7226238216
+担承 12.5143832909
+城府 10.2117981979
+大珠小珠落玉盘 13.2075304714
+蒲团 10.0088573539
+双夜 13.2075304714
+琴瑟之好 13.2075304714
+尊老爱幼 12.2912397395
+奥巴马 6.65288507021
+炒楼 10.1871055853
+名马 10.8096351986
+兴中会 9.98865464655
+货场 11.2616203224
+米尔 9.6811699468
+分省 10.4994802703
+脊椎 9.58318953844
+纪念柱 11.7034530746
+土壤酸度 12.1089181827
+米尺 12.2912397395
+烟草业 12.5143832909
+米尼 10.1630080337
+食具 11.598092559
+中国共产党第九次全国代表大会 11.9547675029
+姚贤镐 12.1089181827
+两亲性 13.900677652
+用人之道 12.5143832909
+庄仆 12.8020653633
+闻其贤 13.2075304714
+孟轲提 13.2075304714
+唤取 12.5143832909
+宣怀愧 13.900677652
+斯普林 12.8020653633
+塞利姆 13.2075304714
+分包商 12.8020653633
+代谢物 11.0674643079
+误诊 10.3453295905
+返家 11.5027823792
+面面相觑 9.04864738806
+日侨 13.2075304714
+假设检验 11.4157710022
+运势 12.2912397395
+寒区 13.900677652
+芦青河 10.533381822
+续书谱 13.2075304714
+得力助手 11.0674643079
+自若 10.8096351986
+自苦 11.5027823792
+拉尼语 13.900677652
+误译 13.900677652
+后备军 10.3171587135
+半月形 10.7226238216
+不约而同 8.77077893705
+英雄传 10.9049453784
+惘然若失 12.5143832909
+运力 9.37888907493
+城市 4.98564837962
+日久年深 11.9547675029
+反手可得 13.900677652
+动气 10.6818018271
+马斯顿 13.2075304714
+海陆军 10.9562386728
+愤而辞职 12.2912397395
+阿尔莫 13.2075304714
+误读 10.2371160058
+贮槽 13.900677652
+前功尽弃 10.3743171274
+断鸿 12.8020653633
+衡东 12.2912397395
+放手不管 13.2075304714
+某女 13.2075304714
+反科学 11.9547675029
+沃拉斯 13.900677652
+艾斯 12.5143832909
+杂烩 11.7034530746
+而粗糙 11.9547675029
+本茨 11.5027823792
+艾德格 13.2075304714
+运入 10.2371160058
+运八 13.900677652
+显圣 10.2117981979
+麦粒肿 12.1089181827
+莲肉 12.5143832909
+巴拉特 13.900677652
+性玩具 13.900677652
+两半 9.21854642485
+守势 10.3743171274
+雉尾 10.8096351986
+百年老 11.598092559
+锁门 10.9562386728
+七十五座 12.8020653633
+米德 10.8096351986
+两千 9.09665660724
+宇文述之 12.8020653633
+缩下 13.900677652
+基础科学 10.2897597393
+授权书 11.0674643079
+曼柏 12.8020653633
+较深 8.77671367257
+别构部位 13.900677652
+主动免疫 13.900677652
+鞋柜 12.2912397395
+环锯 13.900677652
+瘀血 9.59661255877
+仿真度 12.8020653633
+南粮北调 11.9547675029
+拐卖儿童 11.0674643079
+尾数 10.642581114
+各镇 10.3743171274
+班卓琴 13.2075304714
+土壤复区 13.900677652
+长川 12.5143832909
+数一 13.2075304714
+鲍耶 11.8212361103
+鞋架 13.900677652
+两匹 10.0505300503
+数上 11.598092559
+数下 12.8020653633
+数丈 10.3453295905
+某天 10.765183436
+相如功 13.900677652
+抛媚眼 13.2075304714
+魏尔德 12.8020653633
+丧志 12.5143832909
+徐同祖 13.2075304714
+补偿金 11.0103058941
+纤尘不染 11.5027823792
+疑难病症 12.5143832909
+暴力手段 10.8561552143
+多万立方米 11.9547675029
+姿容秀美 13.900677652
+蛮缠 13.2075304714
+书皮 13.900677652
+宁青 13.2075304714
+丧心 12.5143832909
+妙曼 12.2912397395
+数两 13.2075304714
+仿效 8.44535653662
+数个 8.9308643524
+砂光机 13.900677652
+萨拉特 13.900677652
+奸杀 13.2075304714
+誓海盟山 13.900677652
+粘膜炎 13.2075304714
+环秀山庄 12.8020653633
+两可 11.9547675029
+守则 10.8096351986
+两只 6.33903590639
+妙明 12.5143832909
+运出 10.2630914922
+两句 8.00352378434
+两口 8.33615724465
+较浅 9.34680076038
+两百多万元 13.2075304714
+首金 12.8020653633
+马超 9.59661255877
+分理 11.2616203224
+张义民 8.08356649201
+两叶 11.4157710022
+解愚怀 13.2075304714
+非金属材料 10.8561552143
+守分 12.2912397395
+关宁 9.49395840471
+两台 9.04864738806
+证实 6.61722942322
+慈宁门 11.7034530746
+两双 10.2630914922
+小晴 10.9562386728
+数件 11.9547675029
+斯特拉斯伯格 12.5143832909
+守制 10.0720362555
+秋雨绵绵 12.1089181827
+中间轴 12.2912397395
+数份 12.1089181827
+数代 10.765183436
+治安员 11.1926274509
+地膜覆盖 12.5143832909
+本寺僧 11.8212361103
+数以 10.1394775363
+张士诚 9.71102290995
+彻底澄清 12.2912397395
+青城 10.6818018271
+则声明 12.8020653633
+两发 11.2616203224
+短中线 11.0103058941
+西葫芦 12.1089181827
+波塞冬 10.9049453784
+马越 12.1089181827
+叶革质 12.2912397395
+两厢 9.20019728618
+克罗地亚议会 13.2075304714
+默默无闻 9.80633308975
+陶瓷材料 11.598092559
+钻探 9.30555780184
+恶露 11.1926274509
+用之于 13.2075304714
+中华民国政府 10.765183436
+爵士音乐 12.2912397395
+八万四千 12.5143832909
+风云月露 13.900677652
+数二 12.8020653633
+吃亏上当 12.8020653633
+有壳 12.8020653633
+用意何在 12.2912397395
+李彝超 13.2075304714
+马迪斯 12.8020653633
+各门 9.14708746087
+数人 9.43476953332
+两厅 11.8212361103
+招惹不起 13.2075304714
+数亿 10.642581114
+延陵生 13.2075304714
+尾旋 13.900677652
+卓尔不群 11.5027823792
+大佛殿 12.2912397395
+第二第三 13.2075304714
+倾塌 13.2075304714
+各间 12.8020653633
+数亩 13.2075304714
+朴实 8.78868986362
+两副 10.5684731418
+福莱尔 13.900677652
+双季 11.9547675029
+诗品 10.642581114
+米库 13.2075304714
+姚兴继 12.5143832909
+安拉派 13.2075304714
+米店 12.2912397395
+防弹衣 11.1926274509
+追踪者 13.2075304714
+聚米为山 13.2075304714
+首道 12.8020653633
+好羡慕 11.9547675029
+递条子 12.5143832909
+吴用分 13.2075304714
+下有小 12.2912397395
+数位 10.3171587135
+努瓦克肖特 11.9547675029
+木瓜溪 13.2075304714
+自耕 10.9049453784
+出钱出力 11.9547675029
+两剂 11.0103058941
+复兴社会党 13.2075304714
+第二十条 12.2912397395
+崇拜者 10.533381822
+双字 13.2075304714
+双孔 11.7034530746
+法源寺 12.5143832909
+双子 10.604840786
+室内花园 13.900677652
+过眼烟云 11.598092559
+名食 13.2075304714
+鄞县 10.2897597393
+七起 12.5143832909
+寒凉 10.4041700905
+自考 11.598092559
+寒冷 7.39788760606
+寒冰 10.4349417492
+那仙童 12.5143832909
+姚校尉 13.2075304714
+锁钉 13.900677652
+首选 7.83456956187
+全羽领 13.2075304714
+硫氧嘧啶 13.2075304714
+余万吨 10.7226238216
+和捷轩 11.8212361103
+首途 11.7034530746
+寒冬 9.26594866375
+万多间 12.8020653633
+普雷斯 12.5143832909
+甜甜的 10.7226238216
+皇姑屯 11.0674643079
+海浪般 12.8020653633
+钻成 11.8212361103
+锁钥 11.0674643079
+优秀论文 13.900677652
+此版 13.2075304714
+两分 10.533381822
+此片 12.1089181827
+余万名 13.2075304714
+围追堵截 10.604840786
+两刀 11.1280889297
+七贤 11.8212361103
+更进一竿 13.900677652
+数传 12.5143832909
+羊泉村 12.1089181827
+甘心情愿 11.4157710022
+两则 10.8561552143
+名额 8.76487921493
+两列 9.71102290995
+十多页 12.8020653633
+杜勒斯 11.598092559
+地瓜干 12.5143832909
+惊天大 10.6818018271
+吴用劝 11.4157710022
+胡鞍钢 12.1089181827
+取暖 8.58747167293
+纪念日 9.84023464143
+失地农民 12.5143832909
+梨山 11.9547675029
+等压线 11.7034530746
+自育 13.2075304714
+分生 10.9049453784
+王又天 11.1926274509
+两勺 12.1089181827
+东北师范大学 11.8212361103
+莫扎特 9.80633308975
+心腹爪牙 12.2912397395
+自肥 11.4157710022
+敬拜 11.1926274509
+二十四块 12.8020653633
+不加 8.60236028543
+分由 11.3357282945
+安郡王 10.4994802703
+七路 11.1926274509
+妙术 12.8020653633
+付丙丁 13.2075304714
+首部 10.1394775363
+于禁 9.84023464143
+喉音 11.7034530746
+分画 13.900677652
+花盆里 12.2912397395
+分用 11.8212361103
+控制面板 11.598092559
+水利化 11.598092559
+伊索 11.1280889297
+自能 11.1926274509
+宾夕法尼亚 10.4994802703
+记载下来 12.2912397395
+担惊 11.8212361103
+永志不忘 13.2075304714
+诗名 10.9562386728
+难以根除 12.8020653633
+民族学 9.74179456862
+健儿 11.1280889297
+逐行扫描 13.900677652
+斯特拉特福 12.1089181827
+数例 12.1089181827
+翻过去 11.0103058941
+分界 8.93783302172
+深明大义 10.533381822
+团工委 12.2912397395
+卡列尼 10.8561552143
+反复无常 10.642581114
+宽舒 12.1089181827
+杜氏藻 13.2075304714
+赵寄容 11.8212361103
+误解 8.35941410682
+挤眼 10.9049453784
+赵寄客 7.67414098269
+守卫 8.52539924429
+各铺 12.2912397395
+八岁时 11.9547675029
+尹商阳 13.2075304714
+朴学 13.900677652
+费宫人 9.94943393339
+良好习惯 11.1926274509
+高性价比 10.5684731418
+和保罗 11.0674643079
+城寨 11.1926274509
+金龙鱼 9.75754292558
+甜爽 12.8020653633
+青兰 11.9547675029
+效验 11.2616203224
+放债者 12.2912397395
+摸摸头 13.900677652
+宋敏 9.20932976975
+喉道 13.2075304714
+诗友 11.8212361103
+汽贸 11.1926274509
+余万卷 13.2075304714
+明仑 10.533381822
+贝思福 11.4157710022
+特里奥 11.7034530746
+农运会 12.5143832909
+作业线 12.8020653633
+双屿 12.5143832909
+赞叹声 12.5143832909
+莫维奇 12.8020653633
+碧玉簪 11.9547675029
+食品 5.87157059736
+株连 9.5062284973
+美国梦工厂 13.2075304714
+双层 8.97342396682
+赵金风 11.9547675029
+双屏 13.900677652
+蒲县 13.2075304714
+黑白片 12.1089181827
+此生 9.71102290995
+劳辛 9.91169360541
+塔哈 11.9547675029
+诗史 11.2616203224
+来劲 10.0088573539
+丘顶 12.8020653633
+青光 10.8561552143
+甄丰 13.2075304714
+蔡桓公 13.900677652
+全体师生 12.1089181827
+王家庄 10.9562386728
+此番 8.29120585679
+凉薯 13.2075304714
+诏旨 10.2371160058
+病态 9.28555713513
+李铉 13.2075304714
+七言 9.82314020807
+光卤石 11.598092559
+王忙哥 12.2912397395
+设宴欢迎 13.900677652
+范朋克 13.2075304714
+牙印 12.1089181827
+双尾 11.0674643079
+达信 11.598092559
+乐者聆 13.900677652
+卡翁达 12.1089181827
+米姆 12.8020653633
+官干政 13.2075304714
+停业整顿 10.8096351986
+隧道 7.63347710343
+神格化 13.900677652
+运土 11.1926274509
+何黑奴 13.2075304714
+水心亭 13.900677652
+吃豆腐 11.7034530746
+小昆 13.2075304714
+布罗加 12.2912397395
+妙想 13.900677652
+世界大战 9.04086524761
+马泽帕 13.2075304714
+平尾 10.9049453784
+元钊 12.8020653633
+元钉 13.2075304714
+阿贝拉尔 13.900677652
+余万口 11.7034530746
+初度 12.5143832909
+丧失 7.07196558033
+侯览 12.5143832909
+辽西 8.9102450652
+今秋 10.9562386728
+余万只 13.900677652
+感应电 13.2075304714
+寒噤 10.6818018271
+江山如画 12.8020653633
+路麻贵 13.2075304714
+钛白 10.9562386728
+双峰 10.642581114
+没有磨损 13.900677652
+技术参数 11.0674643079
+丧夫 13.2075304714
+攒盒 12.1089181827
+达伦 11.9547675029
+米处 8.9308643524
+小星 11.9547675029
+建议信 13.2075304714
+云爆弹 13.2075304714
+政教合一 9.94943393339
+梨子 11.4157710022
+劫寨 9.84023464143
+元钧 13.2075304714
+诗卷 12.2912397395
+喉部 9.93038573842
+达伊 12.2912397395
+卯眼 13.900677652
+言状 13.900677652
+余万发 13.900677652
+城子 9.66657114738
+有鱼有肉 13.900677652
+元钱 8.85725253506
+盐城市 11.1280889297
+激素原 12.8020653633
+货币资本 7.69208762588
+显出 7.84858848305
+胆色素 11.8212361103
+九十年代 9.89334446674
+大祖庭 13.2075304714
+合作方 10.7226238216
+二巯基丙 11.9547675029
+宫一词 13.2075304714
+诗化 13.2075304714
+水银灯 12.2912397395
+阿克兴 13.900677652
+青冢 12.2912397395
+分片 11.598092559
+电视会议 13.2075304714
+蒲华 13.900677652
+二三十位 13.900677652
+米奇 12.1089181827
+黄脉滑 13.2075304714
+波拉尼 13.2075304714
+居延海 11.5027823792
+林姑娘房 13.2075304714
+西安美术学院 13.900677652
+大脖子病 13.900677652
+顾谓众 11.8212361103
+监生 10.9562386728
+右路 11.0103058941
+刘春山 13.2075304714
+边舞 10.533381822
+兴趣浓厚 11.9547675029
+青冈 10.1630080337
+王珉 11.598092559
+统一发票 12.2912397395
+达人 10.4994802703
+两周 7.72689154807
+法学所 12.2912397395
+王珏 12.5143832909
+天目 9.41204128224
+表率作用 11.9547675029
+出栏数 13.2075304714
+渠灌 13.900677652
+分率 12.8020653633
+提兜 12.5143832909
+两味 11.8212361103
+达产 9.30555780184
+民品 12.8020653633
+达亚 13.2075304714
+维尼亚夫 12.8020653633
+过氧化钠 12.2912397395
+过氧化钡 13.900677652
+侯表 13.2075304714
+此理 10.3171587135
+宋政 11.7034530746
+返归 10.765183436
+挽幛 11.598092559
+色泽鲜明 12.1089181827
+高尔韦 13.900677652
+言祥瑞 12.8020653633
+不相称地 13.900677652
+于隶臣 13.2075304714
+两员 9.5062284973
+软件教程 13.900677652
+一波又起 10.765183436
+布莱尔港 12.2912397395
+标示出 13.900677652
+二三十亩 12.8020653633
+流落风尘 13.2075304714
+穿戴整齐 10.7226238216
+阿达拉 12.2912397395
+诸军众 12.5143832909
+多人多 12.8020653633
+两吨 12.5143832909
+王公贵人 13.2075304714
+一日之计 13.900677652
+产生共鸣 12.8020653633
+个人经历 11.1280889297
+中共中央政治局 9.11318590919
+宏观态 13.900677652
+初值问题 11.8212361103
+鞠躬尽力 12.8020653633
+献血者 11.5027823792
+达令 12.5143832909
+虚物 12.5143832909
+铜器时代 11.7034530746
+两名 7.39638947844
+有色金属 6.87780956589
+克里特岛 9.72629038208
+塘沽区 11.1280889297
+米壳 13.2075304714
+良窳 12.8020653633
+自虐 11.7034530746
+断骨 11.3357282945
+市直 10.4666904475
+元长 13.2075304714
+奸生子 13.900677652
+达什 11.7034530746
+防守反击 13.2075304714
+分班 10.765183436
+货叉 13.900677652
+双工 13.900677652
+司衡 13.2075304714
+蒸发 7.90422556336
+风云变色 11.9547675029
+师一旅 12.1089181827
+奉行故事 13.900677652
+二三十万 10.4349417492
+穆勒先生 12.8020653633
+鸡鸣狗盗 11.3357282945
+右归丸 11.4157710022
+琅琅上口 11.5027823792
+滥用权力 11.0103058941
+二三十丈 12.5143832909
+曼恩 12.2912397395
+檀香木 11.0103058941
+灭蚊 12.5143832909
+把势 12.2912397395
+爱庇丹 12.5143832909
+三清殿 10.765183436
+伊合瓦 13.2075304714
+一千九百个 13.2075304714
+三叉戟 9.26594866375
+野茫茫 12.2912397395
+运回 9.61021821083
+友鼎 12.8020653633
+两品 12.8020653633
+无党派人士 10.8096351986
+友谊关 10.7226238216
+二三十两 12.5143832909
+布罗卡 13.2075304714
+刘言 13.2075304714
+导师制 12.5143832909
+决不反悔 13.900677652
+健在 10.1164880181
+行色 12.8020653633
+有嘉乔 13.900677652
+宋琴 13.900677652
+普密蓬 12.2912397395
+诗刊 11.0674643079
+米塔 11.9547675029
+胡笳鸣 13.900677652
+张海燕 12.8020653633
+一千二百名 11.9547675029
+鲍螺 12.2912397395
+货单 11.3357282945
+藏污纳垢 11.2616203224
+井水不犯河水 10.4994802703
+四家子 13.900677652
+葛麻 12.8020653633
+唐仪凤 13.2075304714
+棉毛裤 11.9547675029
+比比看 12.2912397395
+不前 10.1164880181
+蒲剧 11.598092559
+显像 10.0088573539
+死伤者 11.3357282945
+名鸟 13.2075304714
+娄帕 13.900677652
+稍知 12.8020653633
+蔡锡 13.900677652
+建筑间距 13.900677652
+正确对待 10.1164880181
+七行 13.900677652
+稍短 11.598092559
+向搜索 13.900677652
+牙签筒 13.2075304714
+罗工柳 12.5143832909
+双年 12.5143832909
+氨基化 12.8020653633
+斜对角 13.900677652
+纳罗达 13.900677652
+米宁 13.2075304714
+无裂纹 12.5143832909
+王治岐 13.2075304714
+扎什伦布寺 11.1280889297
+天眼 11.0103058941
+无所谓 8.58255765813
+青南 10.1871055853
+余万元 9.54396882529
+柯尼卡 13.900677652
+绘画史 10.765183436
+分点 11.5027823792
+高低不平 11.0674643079
+朴庵 13.2075304714
+显化 11.0674643079
+韩将军 12.5143832909
+哀恳 12.2912397395
+卡斯滕 13.900677652
+凉气 9.34680076038
+政务 7.91171623509
+中间语 13.2075304714
+慕士塔格山 11.1926274509
+两块 8.12923652885
+哀恸 11.1280889297
+螺蛳 11.1926274509
+首长 7.51548325298
+特道夫 13.900677652
+世界奇观 13.2075304714
+尤尼莱 12.8020653633
+纪念性 10.765183436
+想走到 12.8020653633
+钻机 9.98865464655
+高自旋 11.8212361103
+敬服 10.765183436
+妙招 12.8020653633
+汽车 5.17891229483
+两场 9.7898037878
+峡谷 7.41757030052
+遗风余韵 13.900677652
+汽轮 10.2371160058
+半具 13.2075304714
+王家岛 12.2912397395
+两地 7.96843246453
+哀思 10.8561552143
+俑坑 12.2912397395
+凯里尼亚 13.2075304714
+早期 6.04474545226
+两圈 9.96885201925
+赵云回 12.5143832909
+两圆 13.2075304714
+哀怨 9.87532596124
+近郊区 12.2912397395
+把关 9.43476953332
+懞懂 13.2075304714
+文之士 13.2075304714
+右转 10.604840786
+莲蓬 10.7226238216
+劫夺 10.7226238216
+釉面 11.1280889297
+马泽尔 13.2075304714
+偷取 12.1089181827
+一千二百块 13.2075304714
+青叶 13.900677652
+赵师傅 11.7034530746
+稍睡 12.1089181827
+青史 10.4666904475
+等相面 12.8020653633
+王家屏 12.8020653633
+抢修 9.65218240993
+货值 12.1089181827
+脱衣舞 13.900677652
+锤链 13.900677652
+三百余年 11.8212361103
+两基 13.900677652
+钻孔机 13.900677652
+青口 12.8020653633
+动武 10.4349417492
+不删 13.2075304714
+两城 10.1394775363
+右边 7.91674137129
+油嘴油舌 13.900677652
+首门 13.2075304714
+十八点 13.900677652
+定义语言 12.5143832909
+侯询 11.4157710022
+首问 13.900677652
+市电 12.8020653633
+诗兴 11.3357282945
+首间 13.2075304714
+总参谋 13.900677652
+食器 11.8212361103
+莫大焉 12.5143832909
+慕士塔格峰 12.1089181827
+那句话 8.86372504956
+竖起 8.34384959028
+冷饮店 13.2075304714
+七袋 13.900677652
+双座 10.1164880181
+妙手 11.8212361103
+天下无难事 12.5143832909
+剖面法 13.900677652
+价格下降 9.35738286971
+青县 11.2616203224
+三灾八难 12.8020653633
+息灯 12.5143832909
+阉寺 13.900677652
+排犹主义 12.5143832909
+城头 8.28390655431
+诽谤性 13.900677652
+棉铃虫 11.5027823792
+一百八十卷 13.2075304714
+分灶 13.900677652
+阵挛性 13.900677652
+克罗依 13.900677652
+说破 9.94943393339
+青原 12.2912397395
+帅步骑 13.2075304714
+哀悯 12.2912397395
+民和 10.1871055853
+陈府 13.900677652
+卡列夫 13.900677652
+物质量 12.1089181827
+多少度 13.2075304714
+一连 7.85330547293
+觳觫 12.2912397395
+城外 7.17444424962
+双庙 13.900677652
+二点五 12.8020653633
+斯蒂贝林 12.1089181827
+临期 11.5027823792
+王查理 13.2075304714
+边臣 12.5143832909
+担搁 12.5143832909
+运命 12.5143832909
+敬晖 11.5027823792
+沙耶武 13.2075304714
+比萨饼 10.4666904475
+平地而起 12.1089181827
+双影 12.5143832909
+装饰性 9.62401153296
+南齐书 10.9049453784
+不到黄河心不死 12.5143832909
+背着手 9.24671730182
+青剑 13.900677652
+温别尔 12.8020653633
+商人资本 9.03314320152
+盖耳曼 12.2912397395
+园艺业 11.0103058941
+大佛湾 13.900677652
+静下 13.900677652
+禹余粮 13.900677652
+爱国侨胞 12.5143832909
+城壕 9.46986085313
+双弦 12.1089181827
+莲藕 10.0940151622
+一番苦心 11.1926274509
+哀愁 10.3171587135
+三氧化二砷 11.9547675029
+伊科 12.8020653633
+哀愍 13.900677652
+寒喧 11.5027823792
+守城 7.78478552649
+二十一万 13.900677652
+边界谈判 12.1089181827
+杜绝后患 13.900677652
+哀感 12.8020653633
+诏曰 11.2616203224
+民族志 12.2912397395
+黄脉浮 12.8020653633
+真遗憾 11.9547675029
+双开 12.2912397395
+扎起 10.3171587135
+帕果帕果 12.2912397395
+郭雄 13.2075304714
+釉陶 11.1926274509
+闻其详 13.2075304714
+城墙 7.65457088649
+座便器 13.2075304714
+锅灶 10.1164880181
+五九年 12.2912397395
+广元市 11.3357282945
+朴忠 13.2075304714
+高速 6.58945926756
+尤善画 12.8020653633
+信托投资公司 10.5684731418
+保密室 13.2075304714
+躯干部 10.3171587135
+耒阳 11.2616203224
+范公堤 11.7034530746
+两团 10.604840786
+各邀 13.900677652
+真命天子 11.1280889297
+布罗克 12.5143832909
+两国 6.84450236788
+德资华 13.2075304714
+轮滑鞋 13.900677652
+竹下登 12.5143832909
+七角 12.2912397395
+返工 11.9547675029
+明科皮 13.900677652
+介士 12.8020653633
+布罗兹 13.2075304714
+物产丰富 10.3171587135
+围起来 10.533381822
+痢特灵 13.900677652
+曼托 13.2075304714
+扶下来 12.5143832909
+两回 9.94943393339
+佃权 10.9049453784
+十分关心 10.1394775363
+南蛮 10.5684731418
+夏津 13.900677652
+珀蒂 11.598092559
+十七处 13.2075304714
+十起 13.2075304714
+碍难照准 13.900677652
+瘪嘴 13.2075304714
+城堡 8.12302532875
+角质蛋白 13.900677652
+和亮祖 13.2075304714
+城堤 13.2075304714
+直落到 12.8020653633
+化学平衡 10.8561552143
+良民证 11.0674643079
+呶嘴 12.2912397395
+抢亲 12.5143832909
+由儿臣 13.900677652
+悬浊液 12.5143832909
+苏昆生 13.2075304714
+抢人 11.7034530746
+首钢 9.85762638414
+示范性 10.5684731418
+千道 13.900677652
+战斗序列 11.4157710022
+各部 8.0600359946
+捡了芝麻 11.9547675029
+逛一逛 11.7034530746
+意想不到 8.98069672615
+救国军 11.7034530746
+整装待命 12.8020653633
+两三千年 12.8020653633
+二氧化氯 12.8020653633
+二氧化氮 11.7034530746
+大钦茂 12.8020653633
+拔个 12.8020653633
+贵邦 13.900677652
+曼戈 13.900677652
+类似之处 11.1926274509
+达县 10.8096351986
+心境 8.82550383674
+喷下来 13.900677652
+哈尔语 12.5143832909
+宋兵寨 12.8020653633
+逆耳忠言 12.5143832909
+孟村 12.2912397395
+胡公满 12.2912397395
+敬祖 12.8020653633
+心墙 11.5027823792
+渡头 11.8212361103
+嬉皮笑脸 10.4994802703
+敬神 10.2897597393
+李老君 12.2912397395
+敬祝 11.9547675029
+斗大 10.4349417492
+黄岗山 11.1926274509
+甄别 9.82314020807
+存取款 11.4157710022
+抢先 8.58747167293
+抢光 10.604840786
+葛荣 11.7034530746
+缩合 9.38981814546
+重新配置 11.0103058941
+阴欲夺 12.8020653633
+名菜 10.4666904475
+数周 9.80633308975
+隘巷 13.900677652
+临末 13.900677652
+货价 11.2616203224
+法尔考 12.8020653633
+于扬 11.4157710022
+百间 13.2075304714
+糟粕 10.4041700905
+普乐寺 12.5143832909
+纳吉宾 13.2075304714
+把位 13.2075304714
+孤立无助 12.1089181827
+把住 9.63799777493
+货代 13.2075304714
+魏统 12.5143832909
+一个十六七岁 11.598092559
+数名 10.3743171274
+伊曼 12.8020653633
+资料齐全 12.2912397395
+望门 11.7034530746
+麦尔 11.598092559
+浴缸 12.1089181827
+汽酒 12.5143832909
+各车 13.2075304714
+刘瑾之 13.2075304714
+黄龙旗 12.5143832909
+从夔 11.5027823792
+涂抹 8.69119149913
+臭臭 12.2912397395
+文尚葛 13.900677652
+一门心思 9.77354326693
+汽配 10.4666904475
+敬礼 9.26594866375
+上下文 10.2897597393
+二三十只 12.5143832909
+保持良好 9.13850371718
+一千万镑 13.2075304714
+专业技能 11.598092559
+导尿管 12.1089181827
+俯首称臣 12.2912397395
+尾羽 9.58318953844
+全宁路 13.2075304714
+二三里 10.2371160058
+名药 11.9547675029
+货主 10.2371160058
+七集 13.900677652
+七雄 10.642581114
+民权思想 12.5143832909
+数品 13.2075304714
+诗体 9.5186510173
+分清 9.74179456862
+马失前蹄 11.7034530746
+诗作 8.89673134603
+范宝臣 12.2912397395
+诗余 12.2912397395
+碎石块 12.2912397395
+咽侧体 13.2075304714
+葛菲 13.900677652
+税务所 11.0674643079
+驰援 9.35738286971
+不管不顾 10.3453295905
+诗书礼乐 12.1089181827
+支斗渠 12.5143832909
+二三十匹 13.2075304714
+七七八八 11.5027823792
+维持秩序 9.7898037878
+鸠占鹊巢 12.8020653633
+敬称 12.2912397395
+伊春 10.9562386728
+慈胜寺 12.8020653633
+第二十六届 11.598092559
+拔下 10.1871055853
+氧化硫 12.1089181827
+尾翼 8.9519177616
+全出 13.900677652
+发自肺腑 11.3357282945
+孟林 11.9547675029
+投钱 11.9547675029
+以心传心 13.900677652
+雕刻品 12.2912397395
+说明 5.38288464049
+动用 7.83225206373
+名茶 9.45802639549
+较真 10.8561552143
+各进 12.2912397395
+没骨头 12.2912397395
+史傅汉 13.2075304714
+穷年累月 13.2075304714
+白白的 10.2630914922
+恶贼 13.2075304714
+诗会 13.2075304714
+尾翘 13.2075304714
+伊智 12.5143832909
+卡塔尔国 13.900677652
+法尔肯 12.8020653633
+氧化硅 11.9547675029
+锶盐 12.8020653633
+父系亲属 13.900677652
+金融界 8.91707103027
+赵顼朝 13.2075304714
+二点六 13.900677652
+黎民百姓 10.8561552143
+阉宦 11.7034530746
+设岗 13.900677652
+辛香料 13.2075304714
+货币联盟 10.8561552143
+大青叶蝉 13.2075304714
+长尾 9.27570483869
+英雄城 12.2912397395
+左胳膊 11.1280889297
+伊林 12.2912397395
+山秘术 12.2912397395
+帕巴拉 12.8020653633
+三百尺 13.900677652
+许大相公 13.2075304714
+达加 13.900677652
+招牌式 13.2075304714
+诗仙 12.5143832909
+横眉竖眼 12.5143832909
+司铎 12.8020653633
+捆起 12.1089181827
+万多辆 11.5027823792
+七面 12.8020653633
+政治形势 10.0294766411
+布珠尔 13.2075304714
+向红玉 13.900677652
+雷诺 9.32596667347
+贤后 12.8020653633
+监事会 9.02548032877
+甄府 12.2912397395
+掉转 9.85762638414
+厉行节约 12.8020653633
+阿达纳 12.5143832909
+战略部署 9.84023464143
+此树 12.2912397395
+自驾 10.8561552143
+余万两 12.1089181827
+水泥墙 11.2616203224
+恶言恶语 12.8020653633
+陈世骧 12.5143832909
+十多艘 13.2075304714
+美国广播公司 11.8212361103
+求神拜佛 12.2912397395
+名花 10.5684731418
+诗云 10.3743171274
+声如洪钟 11.3357282945
+拥到 10.2897597393
+运动后效 13.900677652
+棱台 13.900677652
+出淤泥而不染 12.8020653633
+宽频 11.8212361103
+心木 12.2912397395
+此案 8.37124856446
+钻研 9.20932976975
+唐义净 13.2075304714
+孟昶 11.3357282945
+达勒 13.900677652
+思想意识 9.96885201925
+救国会 10.4994802703
+尽如人意 9.54396882529
+郭夫人 12.5143832909
+孟春 13.2075304714
+诗人 6.86452915823
+买贱卖贵 13.900677652
+梁建国 12.2912397395
+隋魏 13.2075304714
+克罗伊 11.7034530746
+宫香 13.900677652
+仿纸 11.9547675029
+达到 4.55983547194
+衡器 11.8212361103
+生长激素 10.4041700905
+伊朗 7.58894284282
+丛脞 12.5143832909
+减员增效 13.900677652
+达利 11.5027823792
+名色 10.4666904475
+鞋类 10.0720362555
+报料人 12.2912397395
+通讯联系 11.8212361103
+好说歹说 11.1926274509
+诗书 9.80633308975
+阎复 12.5143832909
+类肝素 13.900677652
+娱情 13.900677652
+成兆才 12.5143832909
+博茨瓦纳共和国 12.8020653633
+叽叽咕咕 10.9049453784
+普布利 12.8020653633
+易俗社 11.7034530746
+七音 11.9547675029
+大修理基 13.2075304714
+新罗西斯克 13.900677652
+心头 7.03791973892
+调停人 11.9547675029
+托特纳姆热刺 13.2075304714
+对句 12.2912397395
+余万亩 13.900677652
+数场 13.2075304714
+说服 7.81163277653
+性启蒙 12.8020653633
+业委会 10.4994802703
+玄元混 13.900677652
+多半截 11.7034530746
+霍尔登 13.2075304714
+葛花 13.2075304714
+习法相 13.2075304714
+于邦齐 13.2075304714
+氙弧灯 13.2075304714
+诗中 9.37888907493
+斗士 10.533381822
+较瘦 13.2075304714
+蝌蚪文 13.2075304714
+杰贝勒 13.2075304714
+灌溉工程 9.69598503258
+货位 12.8020653633
+指天为誓 12.8020653633
+宁王之 13.900677652
+别说起 13.900677652
+抢占 8.45394028031
+耕翻 11.0103058941
+拥入 10.642581114
+秦界至 13.2075304714
+杨麻胡 13.900677652
+此次 5.48485295495
+此款 10.7226238216
+犯界 13.2075304714
+批文 9.00283785202
+明确化 12.5143832909
+拥兵 9.91169360541
+恶迹 12.8020653633
+尾索 11.5027823792
+辐射对称 9.7898037878
+章门 13.2075304714
+没事找事 11.7034530746
+卷筒纸 12.5143832909
+对酒当歌 11.9547675029
+丛花 13.900677652
+口含天宪 12.8020653633
+卯榫 13.2075304714
+望建河 12.2912397395
+分油 13.900677652
+分治 9.25628675283
+恶运 13.2075304714
+大志 10.1630080337
+于思 13.900677652
+德国科隆 12.2912397395
+梅红 12.1089181827
+慢慢悠悠 12.2912397395
+暗夜里 11.2616203224
+分法 11.7034530746
+惨然不乐 13.900677652
+黄金搭档 11.7034530746
+户外运动 10.9049453784
+反干扰 11.9547675029
+有件事 9.93038573842
+罗绢缎 13.2075304714
+妙绝 11.9547675029
+一二十日 12.8020653633
+四方辐辏 13.2075304714
+铁证如山 11.0103058941
+三五百步 13.2075304714
+冉稀 12.5143832909
+小衣裳 13.900677652
+分泌 7.24266660611
+按扣 13.2075304714
+薛小妹 13.2075304714
+雕刻器 11.5027823792
+样分布 13.2075304714
+显体 13.900677652
+贵贱 9.38981814546
+热销货 13.900677652
+横蛮无理 13.2075304714
+麦布 12.5143832909
+麦帅 13.2075304714
+淬炼 11.9547675029
+以艳丽 12.8020653633
+各走 11.0103058941
+存储容量 10.9562386728
+首见 11.0103058941
+资源库 12.2912397395
+检索系统 11.2616203224
+多喝水 9.98865464655
+孟族 11.5027823792
+全国劳模 11.9547675029
+明宪宗 11.9547675029
+边鱼 13.900677652
+生子儿 13.2075304714
+叶下珠 13.2075304714
+此段 10.9049453784
+杜兰朵 13.900677652
+卡斯特 10.765183436
+新兴里 13.900677652
+寒风凛冽 12.5143832909
+斗室 10.765183436
+分水 9.44633035572
+远东 8.25523075433
+捂着脸 10.3453295905
+自首 9.53122979951
+叶尔姆斯 12.5143832909
+二里岗 13.2075304714
+淬火 9.94943393339
+魏紫 12.8020653633
+数国 11.0674643079
+博尔忽 11.9547675029
+幽灵船 11.5027823792
+督战 9.08039608637
+抢发 12.5143832909
+兆瓦 9.63799777493
+文茨皮尔斯 13.900677652
+刘陈邓 12.8020653633
+首要 8.1417758781
+无明文 13.900677652
+一方平安 12.5143832909
+四千多片 13.2075304714
+达兰 12.5143832909
+长春市 9.77354326693
+装配工 13.900677652
+卡尔维诺 12.5143832909
+连海子 13.2075304714
+二三十元 11.598092559
+孟文 12.5143832909
+编制者 13.2075304714
+大帐篷 11.8212361103
+抢去 10.1630080337
+各路 7.93967231235
+看得惯 13.900677652
+焙干 11.9547675029
+鹬蚌相持 13.2075304714
+孟方 12.5143832909
+缩回 9.75754292558
+低低的 10.1630080337
+民意基础 13.2075304714
+莲须 13.2075304714
+隔离带 11.9547675029
+超音速 9.21854642485
+覆巢 13.900677652
+践踏着 11.9547675029
+辨明 9.85762638414
+拥军 11.8212361103
+友联 13.900677652
+博尔德 12.2912397395
+集中学习 11.7034530746
+心安 10.2371160058
+唐宋时 10.5684731418
+数块 11.8212361103
+钻穴 12.8020653633
+立钦察 13.2075304714
+三心两意 13.900677652
+各调 12.5143832909
+缩在 10.765183436
+广泛支持 11.0103058941
+魏大铭 13.900677652
+伊文 13.900677652
+鄂多立 13.2075304714
+夕阳西下 10.6818018271
+近义词 13.2075304714
+九鼎 8.81927328699
+贺鲁自 13.2075304714
+伊方 13.2075304714
+禹城 12.2912397395
+玉米棒子 11.8212361103
+莫干山 11.2616203224
+遥见 11.0674643079
+低油耗 10.7226238216
+广采博收 13.900677652
+心室 9.98865464655
+伊斯 10.765183436
+分配器 12.8020653633
+引虎自卫 13.900677652
+青乌 10.4994802703
+名胜 8.23425096386
+耕织 11.2616203224
+华德 12.1089181827
+穆王时 12.8020653633
+资本循环 10.8561552143
+电子标签 11.7034530746
+塔尔图 12.5143832909
+宋丞相 12.5143832909
+阿古柏 10.2117981979
+忍受力 13.2075304714
+于慧 13.900677652
+亚硫酸氢钠 12.8020653633
+覆层 12.2912397395
+饼粕 13.2075304714
+仲夏夜 11.598092559
+三百年 9.44633035572
+心寒 10.3743171274
+数圈 12.5143832909
+宁风 13.900677652
+司隶 11.598092559
+吐着 13.2075304714
+毛利辉 13.900677652
+法律效力 9.36807815882
+放牧地 11.598092559
+邹鲁 11.2616203224
+青丝 10.4041700905
+辨析 10.4666904475
+阿娘 11.3357282945
+动态平衡 9.66657114738
+时宪书 12.8020653633
+石棉布 13.2075304714
+主持会议 9.87532596124
+唐宋文 12.8020653633
+固定价格 12.2912397395
+总体战 11.4157710022
+选片 13.900677652
+奔腾 8.70218062071
+华侨大学 11.9547675029
+关名 13.2075304714
+说教 9.37888907493
+向量场 11.9547675029
+补偿贸易 11.5027823792
+一百八十七 12.8020653633
+上捷轩 13.2075304714
+傥来之物 13.900677652
+市树 11.7034530746
+赣西南 12.2912397395
+在改革中 11.0103058941
+脱氨酶 13.2075304714
+二三十倍 13.900677652
+凌云宫 11.9547675029
+金钱龟 12.2912397395
+夯筑 10.642581114
+七门 10.9049453784
+乒乓球室 13.900677652
+离域键 12.8020653633
+各盟邦 13.900677652
+满脸稚气 12.8020653633
+伟大工程 11.5027823792
+过段时间 11.8212361103
+特别注意 8.9519177616
+武功山 10.642581114
+范紫东 12.8020653633
+分洪 10.0940151622
+公易登 13.2075304714
+排球比赛 11.5027823792
+名誉教授 10.533381822
+你争我夺 12.1089181827
+雄浑有力 13.900677652
+辽阳 9.03314320152
+报国无门 12.5143832909
+延迟线 12.2912397395
+烟草味 12.5143832909
+邹可仁 9.75754292558
+抢劫 8.20023407859
+分流 7.6468488404
+纳吉堡 12.8020653633
+伊敏 11.1926274509
+第七节 10.7226238216
+隔离开 12.8020653633
+李玉玲 11.2616203224
+心律失常 9.66657114738
+丛草 12.1089181827
+心子 10.9562386728
+猜拳 11.1926274509
+辽阔 8.14493543839
+自食 11.1280889297
+青云 10.5684731418
+对撞机 10.8096351986
+战力集 13.2075304714
+朵花 10.7226238216
+心学 10.5684731418
+开关网络 13.900677652
+株选 13.900677652
+断落 11.5027823792
+胶水 10.604840786
+华微电子 11.3357282945
+元谋 11.7034530746
+抑制效应 12.5143832909
+六十一年 11.1280889297
+于是 5.14651690265
+奸细 9.5186510173
+萨摩斯岛 12.2912397395
+傅公悌 13.2075304714
+汽锤 11.8212361103
+二百零八艘 13.2075304714
+电话号码 9.32596667347
+皖江 12.2912397395
+朴茨茅斯 11.4157710022
+辽金 9.98865464655
+五香粉 12.8020653633
+于明 10.2897597393
+曼科 12.1089181827
+阿丁枫 11.598092559
+大中华区 9.5186510173
+运作 7.01721506556
+沿海工业 11.2616203224
+耕种 8.02574692112
+釉质 11.598092559
+夺眶而出 9.87532596124
+鲁珀特 13.900677652
+右键 13.900677652
+三百多 10.2630914922
+郭奉孝 12.2912397395
+奇案 12.2912397395
+首载 12.5143832909
+朱家骅 12.2912397395
+共同开发 10.9049453784
+拥在 11.1280889297
+中国青年艺术剧院 11.7034530746
+于景 13.2075304714
+郑屠家 12.5143832909
+一十五里 13.2075304714
+隔离墙 12.8020653633
+卿可 10.533381822
+十船 12.2912397395
+农业工人 9.5186510173
+伊拉 11.2616203224
+青剑兮 13.2075304714
+英勇献身 12.2912397395
+刘若愚 12.5143832909
+数倍 9.30555780184
+问寒问暖 11.9547675029
+分离出来 9.17328983326
+于晋 11.3357282945
+男女性 11.3357282945
+久盛不衰 12.2912397395
+法尔萨 12.5143832909
+祭物 11.3357282945
+数值 7.74581955796
+帕莱奥洛 13.2075304714
+姥娘 13.2075304714
+布伦特 9.24671730182
+田玉峰 11.3357282945
+珊瑚岛 9.94943393339
+可待因 11.4157710022
+隔离墩 12.8020653633
+第八十六回 12.5143832909
+纪念章 11.7034530746
+壶口 11.4157710022
+满怀深情 11.8212361103
+游戏场 12.5143832909
+矿山设备 10.9049453784
+记分员 13.900677652
+肯作 13.2075304714
+满大街 11.4157710022
+眷顾 10.0720362555
+达吉亚娜 9.93038573842
+仫佬 10.8096351986
+心尖 11.1926274509
+溜之大吉 11.1926274509
+嫌疑人 8.17709255002
+坍方 13.900677652
+郭任远 12.8020653633
+成不了 9.94943393339
+摆排场 13.900677652
+各设 9.77354326693
+澳大利亚队 13.900677652
+颇有微辞 13.2075304714
+鸣叫声 11.598092559
+衡南 12.8020653633
+板上钉钉 10.9562386728
+野兽派 13.900677652
+顺序量表 13.2075304714
+各讲 12.5143832909
+祥子 11.0103058941
+地理底图 11.9547675029
+卿卿 11.3357282945
+二三十块 12.5143832909
+管柱状 13.2075304714
+首辅 7.06227245113
+明基电 13.2075304714
+一二倍 13.2075304714
+势利小人 12.8020653633
+鉴于 7.12988822807
+说戏 13.900677652
+第四十二回 12.5143832909
+于曼 13.900677652
+略大于 10.533381822
+容忍性 13.2075304714
+四十倍 13.2075304714
+默默无语 10.2117981979
+芭蕉 9.25628675283
+心肌缺血 11.1926274509
+王太祖 13.900677652
+脱误 12.1089181827
+哈达铺 11.9547675029
+实用功能 12.1089181827
+文字广告 11.9547675029
+蠢蠢 12.5143832909
+蔡家崖 12.8020653633
+腱鞘炎 12.1089181827
+黄苔主 13.2075304714
+长得 7.44705265308
+齐仁圣 12.8020653633
+四处奔走 11.4157710022
+六二五 11.7034530746
+各说 11.3357282945
+商洛地区 11.1926274509
+转嗔为喜 13.900677652
+丛葬 11.9547675029
+出风口 10.8561552143
+中国舞蹈家协会 12.2912397395
+楞楞 12.5143832909
+缔交 12.8020653633
+同级 8.60236028543
+产煤区 11.0103058941
+孵化 8.67493097826
+血与火 11.8212361103
+复流形 12.5143832909
+元贞 10.765183436
+原料林 11.9547675029
+口语化 11.598092559
+阿普利 13.2075304714
+剃发 9.34680076038
+胶泥 11.0674643079
+分段 9.31571017331
+学习组 13.2075304714
+剥削阶级 9.84023464143
+祭献 11.4157710022
+历久不衰 11.7034530746
+奥格朗 13.900677652
+遥远 7.57095674645
+唤作 10.2371160058
+丙烯醛 12.8020653633
+顾全大局 10.4666904475
+三国鼎立 11.3357282945
+黄河颂 13.900677652
+李老儿 13.2075304714
+香港理工大学 12.5143832909
+红茶菌 13.2075304714
+水银槽 13.900677652
+特征值 10.604840786
+达普鬼 11.598092559
+爆冷门 13.2075304714
+叶永烈 12.8020653633
+侯选 12.5143832909
+冷子 12.1089181827
+曲阜县 11.7034530746
+五禽戏 11.4157710022
+福昌 11.5027823792
+侯通 13.900677652
+水跃消 12.8020653633
+汽车模型 12.8020653633
+于杰 13.2075304714
+丘脑 10.2897597393
+互联网服务 11.5027823792
+分母 10.4994802703
+戚本禹 12.1089181827
+孵卵 9.61021821083
+辛亥年 12.8020653633
+罗先吉 13.2075304714
+修眉凤 13.2075304714
+运七 12.2912397395
+斗山 11.5027823792
+方今汉 13.2075304714
+运上 11.5027823792
+分毫 9.58318953844
+刘忠文 11.1926274509
+桐君阁 10.9049453784
+运价 8.81927328699
+神仙 7.43764819506
+秦督郑 13.900677652
+洛宁县 11.7034530746
+动火 11.3357282945
+作业机 13.900677652
+军事同盟 10.4666904475
+缩写 8.9102450652
+福星 9.28555713513
+小贴士 11.1926274509
+岿然不动 11.9547675029
+战云密布 13.2075304714
+扶贫帮困 13.2075304714
+恶行 10.642581114
+孟拱 12.5143832909
+清算人 13.2075304714
+潮起潮落 11.4157710022
+于果 13.2075304714
+环境污染 8.49350588052
+夜星 13.900677652
+系统调度 13.2075304714
+不可避免 7.59805867623
+呜呜 8.70218062071
+教育软件 12.8020653633
+于林 12.2912397395
+泣别 12.5143832909
+苏州人 10.2117981979
+汉江月 12.5143832909
+资源委 13.2075304714
+座无虚席 10.9049453784
+刘姥姥 9.56994431169
+山摇地动 11.4157710022
+内骨骼 11.598092559
+坐椅 10.2117981979
+订货量 11.1280889297
+刘梦龙 11.598092559
+普罗霍洛 11.9547675029
+寒伧 11.598092559
+绝对零度 10.9562386728
+丙烯酸 11.598092559
+发展社会学 13.900677652
+忽忽不乐 13.900677652
+摩泽尔河 12.8020653633
+霍尔特 11.8212361103
+招宝七 13.2075304714
+直白 10.1871055853
+断航 12.1089181827
+喜从何来 12.2912397395
+兰阁 12.5143832909
+分步 10.3453295905
+缩减 8.0600359946
+附庸风雅 11.1280889297
+天玄 13.2075304714
+系列产品 9.21854642485
+乌兹别克 9.69598503258
+于柔 13.900677652
+斗弄 13.900677652
+辛楣 13.2075304714
+七遍 13.2075304714
+断臂 11.0674643079
+斗式 11.2616203224
+缩到 11.3357282945
+每天晚上 9.5062284973
+恶语 11.9547675029
+抗压性 12.1089181827
+雕刻刀 13.900677652
+三热爱 13.900677652
+印花纸 13.900677652
+得于 12.8020653633
+壶关 10.5684731418
+寿山石 11.7034530746
+陈洪 12.2912397395
+七道 11.3357282945
+鲍鱼 9.91169360541
+说情 9.48183704418
+心底 7.89432449237
+耿忠 12.2912397395
+熊尚厚 10.9562386728
+另有隐情 11.2616203224
+分梳 13.2075304714
+勒韦尔 13.2075304714
+直登 13.900677652
+考克斯 13.900677652
+刘绍棠 12.5143832909
+一荣俱荣 11.4157710022
+专诚 10.9562386728
+信托局 11.7034530746
+武诚明 13.2075304714
+首起 11.4157710022
+创造物 11.1280889297
+田家词 13.2075304714
+精神损耗 13.900677652
+数据安全 12.1089181827
+剃刀 11.0674643079
+和玉檀 10.765183436
+数列 9.93038573842
+窗插销 13.900677652
+面色如土 11.2616203224
+和微溶 13.2075304714
+数则 11.7034530746
+集电区 13.900677652
+司棋 10.8561552143
+万亿米 13.2075304714
+分检 13.2075304714
+数刀 12.5143832909
+麦克迪尔 12.8020653633
+数分 12.1089181827
+雷射炮 13.2075304714
+娄勤俭 13.2075304714
+心术不正 11.1280889297
+守仁 12.8020653633
+刘二奶奶 12.1089181827
+赵复 12.8020653633
+数到 10.9049453784
+两伊 10.642581114
+食人 10.2897597393
+拾物 13.2075304714
+胡得 13.2075304714
+祭灵 12.8020653633
+哈特勒 12.2912397395
+祭灶 11.1280889297
+两会 9.49395840471
+错综复杂 8.9308643524
+两伙 13.900677652
+片刀 13.900677652
+右面 11.0103058941
+木姜子 11.7034530746
+夏清 13.900677652
+守业 12.8020653633
+醇化 13.900677652
+哈特利 13.2075304714
+补偿费 10.604840786
+少提 12.8020653633
+樊篱 11.8212361103
+断腕 12.8020653633
+神州陆沉 12.5143832909
+横排 11.4157710022
+技术骨干 11.7034530746
+贫民院 13.900677652
+姚铉 12.8020653633
+桓宗天 13.2075304714
+成套设备 9.98865464655
+色谱法 10.3171587135
+徐图 11.1926274509
+戴斯 13.2075304714
+分格 13.2075304714
+第二十章 10.0088573539
+分校 9.20019728618
+别力弹 13.2075304714
+葛藤 10.8561552143
+分株 10.5684731418
+守丧 12.5143832909
+小雷音 12.8020653633
+零税率 12.5143832909
+垫钱 12.5143832909
+改造思想 13.900677652
+戴面纱 12.1089181827
+两侧 6.51544672891
+省会市 11.3357282945
+荒弃 12.8020653633
+藏青色 11.1926274509
+海陆交 10.9562386728
+斗志 9.35738286971
+仓促 9.0884932966
+守义 11.9547675029
+奔萨 11.598092559
+德成善 13.900677652
+顽民 12.2912397395
+塔尔卡 12.2912397395
+人才培养 9.89334446674
+贵要 11.0674643079
+首趟 12.8020653633
+万多行 13.2075304714
+尼泊尔王国 11.5027823792
+壶内 12.8020653633
+草甘膦 10.9562386728
+迸裂 11.0103058941
+伊恩 12.1089181827
+杨柳镇 12.5143832909
+王美人 13.2075304714
+王父 12.5143832909
+心律 10.6818018271
+纪念祠 13.2075304714
+宋门关 12.5143832909
+经济日报 10.2897597393
+毛利语 12.5143832909
+咆哮声 11.7034530746
+二里头 10.1164880181
+贵行 12.5143832909
+土豚 12.1089181827
+数十 8.21031819765
+表示同意 9.53122979951
+良策 9.0884932966
+鞠谳 12.8020653633
+心得 9.24671730182
+漏磁通 13.900677652
+妙算 11.1280889297
+河床变形 13.900677652
+麦子 8.20358416547
+各个部门 10.3171587135
+卫生工作者 12.8020653633
+数卷 12.8020653633
+食俸 12.5143832909
+幸恢挚 13.2075304714
+哀祭 13.900677652
+两九 13.900677652
+中郎将 9.33632946051
+梓里 12.8020653633
+打鬼 11.1926274509
+武关寨 13.2075304714
+蔊菜 13.2075304714
+各行 9.35738286971
+两个 4.13881126911
+军机处 9.43476953332
+心心 11.8212361103
+缩印 12.2912397395
+两两 10.642581114
+首谋 12.8020653633
+合流处 11.9547675029
+灰化土 11.1926274509
+编织品 11.2616203224
+仅限于 8.63798746307
+生物科技 11.3357282945
+禹县 10.1630080337
+各街 13.900677652
+两串 10.642581114
+玻璃灯 12.5143832909
+土地规划 11.598092559
+铺设成 13.900677652
+两下 8.2273543848
+两丈 10.7226238216
+两三 9.96885201925
+分配制 13.2075304714
+两万 8.91707103027
+数匹 13.2075304714
+两一 12.8020653633
+创导 12.2912397395
+衡阳市 11.1926274509
+隔离室 13.900677652
+元载 11.9547675029
+陈肖霞 13.2075304714
+韩希孟 12.5143832909
+守信 10.4666904475
+拥向 11.0674643079
+利用率 8.40350942668
+心念 10.2117981979
+一千二百亩 12.1089181827
+数发 12.8020653633
+两仪 11.5027823792
+释读天 12.5143832909
+七重 11.9547675029
+韩美军 12.8020653633
+姥姥 9.41204128224
+香山寺 12.5143832909
+两亲 13.2075304714
+两代 8.5488195185
+元辅 9.20019728618
+游戏吧 13.2075304714
+两份 8.9308643524
+市民 6.23868009307
+好处多多 12.1089181827
+两件 8.37522471284
+数据格式 12.2912397395
+考茨基 11.1926274509
+二三十名 11.8212361103
+内燃机 9.08039608637
+漆雕 12.1089181827
+亚的斯亚贝巴 10.642581114
+闲气 11.2616203224
+数台 12.2912397395
+数叶 12.8020653633
+淮滨 13.2075304714
+心弦 10.3453295905
+于文 12.5143832909
+数口 11.2616203224
+名著 8.85725253506
+张群任 13.2075304714
+数句 11.5027823792
+通海运 12.2912397395
+风枪 13.900677652
+耕稼 11.9547675029
+马辰 12.5143832909
+两亩 11.3357282945
+赞比西河 10.4349417492
+圣僧 9.31571017331
+常温下 9.55687223012
+两亿 11.2616203224
+麦客 12.8020653633
+两人 5.97805407776
+守住 8.64840422393
+张金生 13.2075304714
+祖宗成法 11.9547675029
+妙答 13.900677652
+荥阳 8.92394390956
+妙策 10.8561552143
+恶言 11.0103058941
+杨士聪 12.2912397395
+莫桑比克 9.35738286971
+孵出 9.54396882529
+心形 10.5684731418
+举办者 12.5143832909
+二十几丈 13.2075304714
+帕鲁帕 13.900677652
+几千颗 12.2912397395
+举手敬礼 12.1089181827
+一千二百两 12.5143832909
+瘪三 12.2912397395
+亿澳元 9.94943393339
+韩琼 13.900677652
+张庆黎 13.900677652
+断过 11.3357282945
+缩尺 13.2075304714
+金玉如意 13.2075304714
+油砂 11.598092559
+格罗姆 13.900677652
+元老 8.97342396682
+权威人物 12.8020653633
+预备会议 12.8020653633
+秦始皇 8.25877058104
+感慨万千 10.8096351986
+槽罐车 13.900677652
+关系妄想 12.1089181827
+不敢掠美 13.900677652
+审判权 10.8096351986
+更始帝 12.2912397395
+仿真 9.34680076038
+此意 9.54396882529
+名词 8.37522471284
+火炬松 13.2075304714
+宋村 12.2912397395
+达安 9.75754292558
+名诗 12.1089181827
+四季度 6.03204075779
+道骨仙风 13.900677652
+配系 10.9562386728
+缩小 7.03166320131
+周人甲 12.5143832909
+覆在 13.2075304714
+北京住总集团 13.900677652
+打凤捞龙 13.900677652
+通过表演 12.5143832909
+西郭 13.2075304714
+全心投入 13.2075304714
+数封 13.900677652
+赛姆勒 13.900677652
+名讳 10.8096351986
+崇高目标 13.2075304714
+什锦 11.4157710022
+抢夺 9.03314320152
+雷诺阿 11.2616203224
+刘仁达 10.765183436
+科学合理 9.82314020807
+数尺 10.8561552143
+高屋建瓴 11.598092559
+斗六 12.1089181827
+数尾 12.5143832909
+马衔 13.900677652
+达富 12.5143832909
+二次方 11.0674643079
+龙夺锦 13.2075304714
+平时成绩 13.900677652
+司法人员 11.4157710022
+二种 10.5684731418
+稍慢 11.0674643079
+中日韩 9.71102290995
+右首 10.8561552143
+卡列佐 13.900677652
+待时而动 12.5143832909
+沸点 8.06294720481
+大水法 12.1089181827
+须执盾 13.900677652
+禹山 12.8020653633
+边陲 9.72629038208
+社会主义 6.37288366425
+分明 6.96142370593
+耕畜 11.4157710022
+黄龙洞 12.1089181827
+小女生 12.5143832909
+四十四年 9.82314020807
+涵蕴 13.900677652
+丰登 13.2075304714
+党执政 11.2616203224
+砂质 9.85762638414
+刘仁轨 12.5143832909
+项梁自立 12.5143832909
+哈特尔 13.2075304714
+活页夹 13.900677652
+亵玩 12.5143832909
+大板车 13.2075304714
+布伦纳 12.1089181827
+邹靖 12.5143832909
+卡特彼勒 11.598092559
+关键性 9.23723855786
+分晓 10.0505300503
+隔世之感 12.8020653633
+巴巴多斯岛 13.2075304714
+咆哮地 12.8020653633
+莱布尼茨 11.0674643079
+输血管 13.900677652
+二科 11.7034530746
+章锡 13.2075304714
+传记小说 13.2075304714
+哈尔茨 12.5143832909
+哈特山 13.2075304714
+数岁 12.1089181827
+接待站 12.1089181827
+说清 10.4041700905
+碘化 11.9547675029
+外部命令 11.7034530746
+鸡心领 13.900677652
+达孜 12.1089181827
+须眉男儿 13.900677652
+小洪山 11.8212361103
+曼生 9.63799777493
+北碚 10.9049453784
+史之秩 12.8020653633
+日久 8.9102450652
+通感 12.5143832909
+审计长 12.2912397395
+阿太 13.900677652
+丘赋 12.2912397395
+博亚尔 13.2075304714
+石林中 12.8020653633
+大肆宣扬 12.1089181827
+根部 8.98802276624
+处子秀 13.2075304714
+夏守忠 12.8020653633
+分枝 8.44535653662
+心内 9.19114745066
+采住 13.900677652
+浮岚暖翠 13.900677652
+斗倒 11.7034530746
+首艘 11.598092559
+要死要活 11.598092559
+边音 13.2075304714
+顽石点头 13.900677652
+公共设施 9.6811699468
+边韶 12.8020653633
+三百名 10.2371160058
+华岳 12.1089181827
+布基纳法索 10.2371160058
+扰乱性 13.2075304714
+剖视图 12.5143832909
+更深 8.66423568915
+阎军 12.8020653633
+加害于 10.604840786
+名声鹊起 13.2075304714
+禹州 10.0294766411
+横扫天下 12.8020653633
+鄂君启 11.8212361103
+饶勒斯 11.598092559
+时有时无 11.3357282945
+金融系 10.9562386728
+酸溜溜 10.4349417492
+沸煮 12.8020653633
+此恨 12.1089181827
+王座战 13.900677652
+感慨万分 12.8020653633
+嘟囔 9.5186510173
+于此 7.50541605386
+皖赣铁路 11.0103058941
+于武 12.8020653633
+邓之诚 11.8212361103
+伙伴关系 9.49395840471
+王延政 12.2912397395
+民族纠纷 13.2075304714
+舡鱼 13.900677652
+三零七年 13.900677652
+消毒室 12.8020653633
+渡假 12.1089181827
+哈伯德 11.598092559
+首航 11.7034530746
+名誉 8.07763175649
+动粗 12.1089181827
+陆逊入 13.900677652
+滑了一跤 11.7034530746
+三百员 12.8020653633
+双线性 13.900677652
+度过难关 11.3357282945
+公交站 10.7226238216
+胡车儿 13.900677652
+荣茂 13.900677652
+嘟嘟 10.1630080337
+尔松 11.8212361103
+苯甲酸钠 12.2912397395
+博尔哈 13.900677652
+碘剂 12.1089181827
+城乡 7.43297892587
+较繁 12.8020653633
+子载振 12.5143832909
+分期 8.77077893705
+仿皮 13.900677652
+衡平 11.7034530746
+跟踪调查 11.3357282945
+精明能干 11.3357282945
+掘金队 13.900677652
+浴盆 11.3357282945
+敬烟 13.2075304714
+氧化焰 13.2075304714
+尤老娘 12.1089181827
+唐国强 11.8212361103
+缝合线 11.1280889297
+行家话 13.900677652
+磨刀霍霍 12.2912397395
+耒耜 11.5027823792
+氨基丁酸 12.1089181827
+分机 12.1089181827
+儒家文化 11.598092559
+享享福 13.900677652
+心儿 10.5684731418
+甄家 10.6818018271
+达娃 11.7034530746
+中央广播电台 12.2912397395
+反腐倡廉 10.9562386728
+首节 12.2912397395
+嘟噜 10.765183436
+一门忠烈 13.900677652
+城中 6.95562658825
+草地上 9.11318590919
+陆长守 13.900677652
+弥漫 8.25523075433
+引力常量 13.900677652
+王越迎 13.2075304714
+充满希望 10.5684731418
+车站里 12.5143832909
+流落异乡 13.900677652
+唐开元 9.85762638414
+罗津斯 12.5143832909
+风吹草低见牛羊 12.5143832909
+于根 13.900677652
+那件事 9.25628675283
+柔软性 12.2912397395
+亚洲杯 12.1089181827
+尾盘 7.45813748551
+蒋筑英 13.900677652
+城下 8.00903344015
+天缘凑合 13.900677652
+名言 9.29550746599
+贮积 12.2912397395
+元臣 13.2075304714
+冒失鬼 11.7034530746
+此情 10.0940151622
+唐属营 12.1089181827
+杨皇后 13.2075304714
+坎特伯雷 10.7226238216
+不思悔改 12.2912397395
+城东 8.58747167293
+壶底 12.2912397395
+释奠于 13.2075304714
+封锁消息 11.0674643079
+法学界 11.0674643079
+伊沙 12.1089181827
+区域化 10.3743171274
+雕刻师 13.900677652
+李老师 11.8212361103
+说法 6.42477168261
+塔尔德 12.8020653633
+更胜 11.2616203224
+哆里哆嗦 13.900677652
+心力 10.0720362555
+伊莱博 13.2075304714
+数幅 12.1089181827
+公吏人 12.2912397395
+邹闰 10.765183436
+达姆达姆 13.2075304714
+齐天 11.3357282945
+伊沃 11.8212361103
+仿生 10.9562386728
+心动 9.14708746087
+数年 7.92179188707
+两肋插刀 11.9547675029
+居延简 13.900677652
+第二十六回 11.7034530746
+断路 12.1089181827
+红栀果 12.8020653633
+伊河 10.2371160058
+醉倒在 11.3357282945
+盂兰盆会 12.2912397395
+孟浪 10.5684731418
+攘灾 13.2075304714
+名角 10.6818018271
+不屑 8.83177344976
+电机学 13.900677652
+衡州 10.533381822
+了此残生 12.5143832909
+薄甲藻 12.5143832909
+自酿 11.8212361103
+罗洪先 13.2075304714
+妙闻 12.8020653633
+清微天 13.2075304714
+冉冉上升 11.8212361103
+哈里逊 13.900677652
+于桥 11.4157710022
+闲杂人员 11.7034530746
+布置任务 11.598092559
+斗南 13.900677652
+首脑 8.36334338496
+园艺学 11.2616203224
+奔袭 10.0940151622
+侯服 12.5143832909
+季节洄游 13.900677652
+许敬宗 11.1926274509
+官太太 11.5027823792
+能攻能守 12.2912397395
+印度航空公司 13.2075304714
+伪钞 11.9547675029
+吊丧 11.1280889297
+掉落 9.49395840471
+承宋军师 13.900677652
+敬献 10.4041700905
+纵荡 13.900677652
+七十三 11.9547675029
+利刀 11.3357282945
+敬猷 13.2075304714
+史进引 13.2075304714
+宋诸军 13.2075304714
+釉药 13.900677652
+唏嘘 9.98865464655
+于桐 11.8212361103
+元色 13.2075304714
+孟津 10.0505300503
+三百块 12.1089181827
+痛点 12.8020653633
+达姆 11.0674643079
+二十四员 12.8020653633
+园艺家 12.2912397395
+子王济 13.2075304714
+英气勃勃 11.2616203224
+无载体 13.900677652
+心切 9.35738286971
+珀金 11.2616203224
+两房两厅 13.900677652
+含羞草 11.5027823792
+哈尔腾 12.5143832909
+设备陈旧 12.2912397395
+神侃 12.8020653633
+逃债 12.2912397395
+吴中行 9.25628675283
+宝柱刚 13.2075304714
+那霸市 13.2075304714
+杨成武 12.5143832909
+车全宽 13.2075304714
+麻麻 11.598092559
+辛香温 13.2075304714
+舒马赫 11.5027823792
+螺杆式 12.2912397395
+瘦高挑儿 13.900677652
+动弹不得 9.72629038208
+心到 12.1089181827
+隔离器 12.5143832909
+床罩 10.8561552143
+渡口 8.52539924429
+氧化物 8.37921673411
+纪育沣 13.2075304714
+惬意 9.36807815882
+蔡钊珍 11.4157710022
+达奴 13.2075304714
+甫定 12.1089181827
+工工整整 11.4157710022
+误食 10.5684731418
+方行 12.2912397395
+分配律 12.5143832909
+城中城 12.8020653633
+互答 13.900677652
+分摊 9.65218240993
+编戏 12.8020653633
+连拱坝 11.9547675029
+队长 7.65845438652
+风棱石 13.900677652
+斗口 11.9547675029
+天生 7.83689244329
+汉建兴 12.1089181827
+原子能发电站 12.1089181827
+金融网 12.8020653633
+通海节 13.2075304714
+较紧 11.4157710022
+外事部 12.8020653633
+自重 9.20932976975
+自量 12.8020653633
+数度 9.96885201925
+数座 10.4666904475
+杜光庭 11.7034530746
+凸起来 13.2075304714
+赤地 13.900677652
+七言句 13.2075304714
+虚弱不堪 13.900677652
+辨清 11.8212361103
+米亚 11.5027823792
+茶花女 10.533381822
+静脉注射 10.2897597393
+有伤风化 11.598092559
+现世宝 12.5143832909
+低潮期 13.2075304714
+可受 10.765183436
+贺从龙 13.2075304714
+铁扇公主 11.7034530746
+司徒逸民 13.2075304714
+自造 11.0103058941
+边间 13.900677652
+尹湛纳 12.1089181827
+盘龙城 11.5027823792
+自通 12.5143832909
+横拍 13.900677652
+鄂托克前旗 12.8020653633
+明日之星 13.2075304714
+大逆不道 10.2117981979
+鬼蜮伎俩 12.5143832909
+鞋盒 12.2912397395
+选择性 8.61747392324
+民族主义党 13.2075304714
+自选 10.0940151622
+此战 10.3743171274
+泰国拳 11.1926274509
+泸西县 13.900677652
+感情生活 11.598092559
+丧事 9.22784881751
+抢婚 11.598092559
+开户 8.50251495046
+麦地 10.4041700905
+市情 11.9547675029
+嘟哝 9.89334446674
+喜马拉雅山脉 9.48183704418
+三角点 12.2912397395
+米仓 11.4157710022
+水银柱 11.1280889297
+首乌藤 13.900677652
+医学观察 12.8020653633
+孟氏 12.1089181827
+仙桃草 13.900677652
+达士 13.2075304714
+黄龙滩 12.1089181827
+圆墩 13.2075304714
+拥堵 9.37888907493
+劲头儿 11.5027823792
+言教 11.9547675029
+自遣 11.598092559
+冰乙酸 13.900677652
+祥和 10.3743171274
+改过来 11.4157710022
+咯吱咯吱 10.8096351986
+分时 9.6811699468
+心口 9.32596667347
+二氧化碳 7.45495783259
+釉色 10.4994802703
+米价 11.3357282945
+覆命 13.900677652
+出头之日 9.84023464143
+进行谈判 9.38981814546
+数张 12.1089181827
+美国通用汽车公司 10.8096351986
+林立果 12.5143832909
+地质勘探 9.84023464143
+敬爱 9.87532596124
+土地费 12.8020653633
+三体问题 11.0674643079
+米业 10.4041700905
+顶不起 12.8020653633
+言文 13.2075304714
+撞出来 13.2075304714
+伊洛 10.9562386728
+桓鑫锾 12.8020653633
+麦基 13.2075304714
+文斯敦 11.4157710022
+名表 10.9562386728
+心包 9.91169360541
+状态机 13.900677652
+城镇居民 8.98802276624
+丁哥 11.9547675029
+丘迟 12.2912397395
+边长 9.7898037878
+缩微 10.4666904475
+扁担 9.54396882529
+融汇贯通 13.2075304714
+二氧化硅 9.91169360541
+刘忠武 11.0674643079
+元昊建国 11.9547675029
+燕麦 9.34680076038
+抢嫌 13.900677652
+调解纠纷 12.2912397395
+兴灭 13.900677652
+边镇 11.1280889297
+弋阳县 12.5143832909
+隋改为 11.1926274509
+二氧化硫 9.37888907493
+不得劲 12.5143832909
+索诺拉 13.900677652
+开关设备 11.5027823792
+边镐 13.2075304714
+麦城 11.3357282945
+分支 6.98594675926
+斗勇 11.8212361103
+云山城 12.8020653633
+上下游 9.12999302751
+数得 11.1926274509
+丧乱 11.4157710022
+妙着 13.2075304714
+唐宋派 11.7034530746
+斯理女子 13.2075304714
+谢尼埃 13.2075304714
+讲价钱 11.598092559
+克子 13.900677652
+房产公司 11.1280889297
+分数 8.55357012126
+边锋 13.900677652
+下账 13.900677652
+出栏率 11.598092559
+贴面 11.8212361103
+清洁球 13.2075304714
+凤城市 12.8020653633
+特里亚 10.2117981979
+首肯 10.1164880181
+乒乓球台 12.1089181827
+分散 6.84106002368
+小键盘 13.900677652
+反病毒 13.900677652
+向朝臣 12.8020653633
+看守内阁 11.598092559
+盐城人 12.5143832909
+营养 6.81896906587
+古泗水 11.9547675029
+浮点运算 11.7034530746
+敬畏 9.03314320152
+檀香皂 13.900677652
+纪念物 10.9049453784
+恶臭 9.45802639549
+达德 11.8212361103
+小袋鼠 12.8020653633
+放鱼入海 13.900677652
+心咒 13.900677652
+南回铁路 12.1089181827
+糟烂 12.2912397395
+不忠 9.72629038208
+死耗子 11.9547675029
+同情心 9.87532596124
+断语 12.1089181827
+大异 11.5027823792
+纪念版 13.900677652
+东光县 12.5143832909
+于清 12.1089181827
+纪念牌 13.900677652
+大同乡 13.2075304714
+刘元进 13.2075304714
+挽住 10.1630080337
+正当防卫 11.2616203224
+田中义 11.598092559
+某位 10.0720362555
+防守战 12.8020653633
+田中丰 12.8020653633
+被杀者 11.3357282945
+联营公司 11.598092559
+心品 13.2075304714
+南盘江 9.85762638414
+名辩 12.8020653633
+担着 9.87532596124
+打夯机 13.2075304714
+分担 8.89004235788
+分拆 9.26594866375
+万亿美元 8.35160156708
+缘浅 13.2075304714
+嗜杀成性 13.900677652
+乙肝疫苗 9.63799777493
+宫庄田 13.2075304714
+莲雾 13.900677652
+本草经 12.2912397395
+红螺寺 13.900677652
+三百元 10.765183436
+分拣 10.9049453784
+分拨 9.29550746599
+吹胡子瞪眼 11.1926274509
+乡城县 13.900677652
+衡宝 13.2075304714
+分成 6.96142370593
+浓缩液 13.2075304714
+名车 10.604840786
+返任 13.900677652
+卯月 13.2075304714
+花绢 12.8020653633
+后嗣 10.9562386728
+李商隐 10.0720362555
+十多辆 12.8020653633
+透气性 10.642581114
+保定军校 12.8020653633
+孟母 12.5143832909
+温元帅 12.8020653633
+机务人员 12.5143832909
+碎石子 12.5143832909
+三五百斤 13.2075304714
+心向 11.1926274509
+可变性 12.5143832909
+不忿 10.4666904475
+毛纺织 9.72629038208
+高山反应 12.8020653633
+对冲 7.70423352418
+各方对 10.0505300503
+糖尿病人 9.91169360541
+此文 8.88339781516
+朴东木 11.9547675029
+卫生事业 11.4157710022
+分房 10.1630080337
+兴妖作乱 13.900677652
+脑脊膜 11.8212361103
+达式 13.900677652
+操作思维 13.900677652
+分截 13.900677652
+肌丝 12.8020653633
+中国海关 10.5684731418
+新雅阁 13.900677652
+长廊 9.43476953332
+不必 6.24908207812
+百战不殆 11.2616203224
+河右岸 11.4157710022
+直接推理 12.5143832909
+那家子 11.598092559
+分所 10.533381822
+返京 10.6818018271
+错怪 10.1630080337
+半日路 13.900677652
+踏脚石 12.2912397395
+发生源 12.8020653633
+此时 5.73702147581
+好树 13.2075304714
+分手 8.04560572977
+甲状旁腺 10.2630914922
+三自爱国 12.8020653633
+阮黑死 12.8020653633
+鲍隆 13.2075304714
+分批 9.03314320152
+宁阳县 13.900677652
+卿子 13.900677652
+老大不小 10.765183436
+臧贤 13.2075304714
+万多艘 12.5143832909
+切除术 10.2371160058
+分排 12.5143832909
+数套 13.2075304714
+陈乔年 13.900677652
+易京 13.2075304714
+天塌地陷 11.1280889297
+缩头 11.5027823792
+达康 13.900677652
+扇子舞 13.900677652
+程子巾 12.5143832909
+公交线 13.2075304714
+友达 12.8020653633
+康统 13.2075304714
+郭络罗 11.9547675029
+翻脸不认 11.7034530746
+理当如此 12.8020653633
+王时雍 10.2117981979
+轮上来 13.900677652
+敬瑭 12.1089181827
+麦兜 11.0674643079
+门之东 13.2075304714
+结症 12.5143832909
+涌上去 13.900677652
+麦克 9.63799777493
+小圈子 11.1280889297
+拔腿就跑 11.2616203224
+扶好 13.2075304714
+外姓 11.0103058941
+分插 12.5143832909
+到期日 9.15574552361
+行酒令 12.8020653633
+数多 10.765183436
+动力学 7.92179188707
+青肿 12.1089181827
+时隔不久 11.8212361103
+食蚁兽 10.9049453784
+数夜 13.2075304714
+东京大学 10.1164880181
+一团乱 12.5143832909
+直角三角形 11.0103058941
+装饰物 11.3357282945
+某个 7.3859649611
+热衷于 8.94485059437
+修补术 12.1089181827
+默求 13.900677652
+数头 12.8020653633
+三串 12.2912397395
+创出 6.93654203956
+娱乐中心 11.1280889297
+十字军东 10.2371160058
+锐意 10.2897597393
+半音阶 11.8212361103
+优柔寡断 10.3743171274
+贵航 10.6818018271
+冲开 9.84023464143
+大功率 9.17328983326
+数天 9.91169360541
+各色 8.48903160012
+异戊橡胶 12.1089181827
+应永深 11.3357282945
+伞降 10.765183436
+颅顶骨 12.8020653633
+柳以东 12.8020653633
+某件 11.1926274509
+强烈抗议 11.3357282945
+民初 9.84023464143
+横扫 9.33632946051
+各节 10.604840786
+乐毅卒 12.8020653633
+返修 11.9547675029
+没爹没娘 12.8020653633
+占地约 9.6811699468
+分指 12.2912397395
+嚣张气焰 10.8561552143
+麦凯 12.2912397395
+聂斯托 11.7034530746
+发展社会化 13.900677652
+预拨 12.5143832909
+走私物品 13.900677652
+王庆便 13.2075304714
+一人得道 12.5143832909
+脊索 10.4041700905
+恩爱夫妻 11.1280889297
+传热性 13.2075304714
+莫皮拉 12.8020653633
+断言 8.5440913773
+龙陵县 13.900677652
+某人 9.04864738806
+达平 13.900677652
+寸有所长 12.5143832909
+副本 10.0294766411
+佩尔蒂尼 12.8020653633
+快中子 11.3357282945
+一溜烟儿 13.2075304714
+慰安妇 13.2075304714
+麦冬 10.4994802703
+姐们儿 13.900677652
+新密码 12.8020653633
+爱国华侨 11.7034530746
+二三十年 10.2897597393
+蛀虫 10.4666904475
+向外看 11.2616203224
+某些 5.69055324681
+机警地 11.0103058941
+麦农 13.900677652
+倒悬之急 12.2912397395
+塔尔塔 12.1089181827
+插入 8.40350942668
+棱形 10.3171587135
+肌体 9.91169360541
+奥尔洛夫 11.7034530746
+引出去 13.900677652
+某事 11.4157710022
+敝舍 12.8020653633
+秃驴 11.0103058941
+五一国际劳动节 12.5143832909
+物价管制 13.2075304714
+顶上去 12.1089181827
+酗酒者 12.8020653633
+踢踢腿 13.900677652
+踪迹 8.47133202302
+十指 10.2897597393
+边郡 9.69598503258
+创办 6.83421068184
+阉奴 13.900677652
+宫杀齐 13.2075304714
+身心状态 13.900677652
+正事儿 11.3357282945
+羸弱 10.9049453784
+爱奥尼 13.900677652
+添枝加叶 11.7034530746
+蓬勃 9.54396882529
+市斤 11.9547675029
+脊线 11.0103058941
+热爱祖国 11.0103058941
+隘口 9.45802639549
+怕难为情 13.900677652
+证伪 12.2912397395
+庸者 12.5143832909
+基本方针 10.3453295905
+七项 11.1926274509
+原料油 13.900677652
+俞济时 12.8020653633
+陈后主 11.0103058941
+焉知 10.9049453784
+华川 12.2912397395
+塔尔寺 10.9049453784
+直罗镇战役 11.7034530746
+焦阎王 13.900677652
+滔滔不断 13.900677652
+第四十二届 12.5143832909
+非洲人国民大会 12.8020653633
+达巴 12.1089181827
+此条 11.4157710022
+城镇化 7.83689244329
+队里 8.87679713113
+喉舌 10.8561552143
+仿照 9.01032852375
+麦利 13.2075304714
+苏维汇 12.5143832909
+基本纲领 11.7034530746
+套索 10.9562386728
+于汉 10.642581114
+长城公司 11.4157710022
+几匹马 11.2616203224
+达州 11.4157710022
+信口胡言 13.900677652
+玄宗朝 12.8020653633
+沸腾钢 12.8020653633
+口出大言 12.8020653633
+能级 9.02548032877
+脱下来 9.82314020807
+李从镒 13.900677652
+准周期性 13.900677652
+分销商 10.4349417492
+气体燃料 11.1280889297
+刘赞 12.8020653633
+小若若 12.2912397395
+十多起 13.900677652
+钻石 8.29487558568
+敢为人先 12.5143832909
+欧广联 13.900677652
+来往 7.43453292774
+一席之地 9.85762638414
+单轴晶体 12.5143832909
+长幼 10.3743171274
+祖宗法度 12.2912397395
+间杂着 13.2075304714
+祥兴 11.2616203224
+达利亚 13.2075304714
+双份 11.3357282945
+阮之流 12.8020653633
+蔡家坡 13.900677652
+鸟苷酸 13.900677652
+伊格 12.8020653633
+奔豚 13.2075304714
+创制 8.26588804881
+友谊 7.91926344072
+于沛 13.2075304714
+大好时机 10.3453295905
+燕子 8.21031819765
+普里茨 13.2075304714
+创利 10.2371160058
+市政 7.96314144689
+踏脚 12.5143832909
+防信息泄漏 12.5143832909
+子伯萨 13.900677652
+三百只 12.1089181827
+言情 11.1926274509
+王习三 13.900677652
+名贯 12.2912397395
+西安电子科技大学 13.2075304714
+石棉县 11.9547675029
+伊桑 11.3357282945
+麦加 8.74738605748
+自闭 12.8020653633
+陆刃波 12.8020653633
+双亲 9.53122979951
+民族乡 10.5684731418
+红柱红 13.900677652
+集资额 10.4349417492
+苟且偷生 11.0103058941
+三百余万 12.5143832909
+套进去 12.5143832909
+加考 13.900677652
+各自 6.12121068452
+开拓 7.49214886092
+差错控制 11.9547675029
+拉肯斯 11.3357282945
+稍有 8.15128466607
+动笔 10.4994802703
+翁波意 9.6811699468
+纳米 9.37888907493
+抢得 10.642581114
+科技化 12.5143832909
+民变 9.93038573842
+力持 11.0103058941
+二站 13.900677652
+切下来 12.1089181827
+妙玉 10.0505300503
+资源化 12.1089181827
+矮了一截 12.2912397395
+万事通 12.8020653633
+数字 6.47531976495
+恭送 10.8096351986
+断裂 7.49710345404
+索尔克 12.5143832909
+利德尔 12.5143832909
+奔跳 12.8020653633
+免疫血清 11.7034530746
+王三 12.8020653633
+小工 9.80633308975
+二三十岁 11.7034530746
+查莫罗 11.8212361103
+周华健 13.900677652
+于洲 13.900677652
+和远海 13.900677652
+赵与齐 12.8020653633
+水亮 12.8020653633
+于洋 10.9562386728
+养牛业 10.9562386728
+回乡务农 12.8020653633
+周法高 12.8020653633
+不会错 10.0294766411
+奔跑 8.17382990439
+斗嘴 11.2616203224
+数学 6.6083404758
+双体 12.2912397395
+云雷纹 12.1089181827
+一剪梅 12.5143832909
+祭礼 10.4666904475
+园艺师 13.2075304714
+张骞至 12.5143832909
+此景 10.9562386728
+祭祀 7.71859274526
+基因图谱 12.8020653633
+被劫走 13.900677652
+洞庭湖畔 13.900677652
+主观因素 10.7226238216
+装饰灯 13.2075304714
+祭祖 9.63799777493
+卿士 11.1926274509
+尾灯 10.0294766411
+贮罐 13.2075304714
+祭神 10.0720362555
+于海 11.8212361103
+二次开发 12.8020653633
+大巴车 11.9547675029
+证书 8.41173992582
+兆示 13.900677652
+子母钟 13.900677652
+弱智儿童 13.2075304714
+光明日报 10.2630914922
+创口 10.6818018271
+涵芬 11.4157710022
+好梦 11.8212361103
+逃兵 10.1394775363
+双休 13.900677652
+电子广告 13.2075304714
+耕犁 12.1089181827
+示范点 11.1926274509
+调整期 9.75754292558
+达尼 12.2912397395
+司马 8.25523075433
+双修 11.7034530746
+断行 12.1089181827
+奔赴 9.20932976975
+茅子元 12.1089181827
+小明武 13.2075304714
+奔走 7.96843246453
+景宗遂 13.2075304714
+阳桃 12.1089181827
+性保健品 13.900677652
+信口胡说 11.8212361103
+心土 12.2912397395
+贵胄 10.1630080337
+耕牧 12.5143832909
+宋昌 13.2075304714
+抢建 13.2075304714
+个别性 12.2912397395
+宽限 11.0103058941
+得天独厚 9.46986085313
+较硬 10.4349417492
+龙纹玉 13.2075304714
+数寸 12.2912397395
+数对 12.8020653633
+达尔 9.22784881751
+马圈城 12.8020653633
+不良反应 8.83177344976
+慎臣属 13.2075304714
+孟森 11.4157710022
+于涛 12.5143832909
+投射模 13.900677652
+水仗 13.900677652
+主会场 11.2616203224
+雕刻家 10.3453295905
+心地 9.21854642485
+友贞 13.900677652
+洛克纳 13.2075304714
+稍晚 9.71102290995
+掉膘 12.8020653633
+听神经 11.8212361103
+心坎 10.5684731418
+双侠 13.900677652
+证今 12.5143832909
+心坚 12.1089181827
+各胜 12.2912397395
+核心思想 11.5027823792
+虚心接受 12.8020653633
+出风头 10.3743171274
+万寿无疆 10.765183436
+沸石 10.3171587135
+此曲 10.6818018271
+七首 12.5143832909
+放高利贷 10.765183436
+惠统军 13.2075304714
+目部 12.8020653633
+宽阔 7.70219893548
+数家 9.93038573842
+隔离区 12.5143832909
+沃尔科特 13.900677652
+错误计算 13.900677652
+证件 8.73589167805
+创卫 13.2075304714
+关键期 11.1926274509
+丙烯酸甲酯 13.2075304714
+尺书 12.8020653633
+自欺 12.5143832909
+康师傅 10.4349417492
+透心 11.7034530746
+罗绣锦 13.2075304714
+赵玉屏 10.4666904475
+眷注 12.8020653633
+杜蕾斯 13.900677652
+保不定 11.7034530746
+正平 11.4157710022
+仁者 11.4157710022
+于哈儿 13.2075304714
+九百里 13.2075304714
+作案嫌疑 12.2912397395
+艾塞克斯 13.2075304714
+铺平 9.94943393339
+左向 12.8020653633
+惹是生非 10.604840786
+万年历 11.8212361103
+猜惧 13.900677652
+口号声 10.4666904475
+弟媳 10.1871055853
+坐标系 9.35738286971
+全相平 12.5143832909
+王朱桂 13.900677652
+数据处理 9.37888907493
+鞋跟 10.6818018271
+丛炮 13.2075304714
+舰载机 10.0294766411
+克东 12.1089181827
+周泰听 13.2075304714
+嗓子疼 12.1089181827
+正帮 12.5143832909
+正席 13.2075304714
+解铃还是系铃人 12.8020653633
+南澎 13.2075304714
+芦苇 8.170577869
+局域网 10.8096351986
+脊背 8.59737274392
+亲威 13.900677652
+正常 5.50927446662
+七星 9.30555780184
+能食禄 13.2075304714
+自此 7.87723005901
+理顺 8.93783302172
+全身性 9.56994431169
+尾车 13.2075304714
+爱琴 10.642581114
+中间方 13.900677652
+好几张 12.5143832909
+宗之孙 13.2075304714
+金佛 11.0674643079
+伊雷 12.8020653633
+司文 13.900677652
+联系点 11.9547675029
+全部封 11.9547675029
+很沉 11.1280889297
+理事国 10.9562386728
+举世罕见 13.2075304714
+老年斑 12.5143832909
+天然丝 13.900677652
+空道 13.2075304714
+玛玛依 12.5143832909
+橙红色 10.5684731418
+瓦伦 12.5143832909
+首陀罗 10.4994802703
+首篇 11.9547675029
+简正波 13.900677652
+占有欲 11.7034530746
+提来 10.765183436
+运输工 12.2912397395
+突发 8.96620371885
+翠螺 12.8020653633
+相衔接 10.3171587135
+代朕督 12.5143832909
+通易论 13.2075304714
+七曜 13.2075304714
+抗原刺激 11.0674643079
+突变 8.48457724977
+昌瑞山 13.900677652
+对公 9.69598503258
+法布尔 13.900677652
+日照县 13.900677652
+鼠群 12.8020653633
+误报 11.8212361103
+赵玉峰 12.8020653633
+涂敷 10.604840786
+砂田 12.5143832909
+紧追不舍 11.2616203224
+自残 11.1280889297
+幼年人 13.2075304714
+奇卡洛夫 12.8020653633
+基音 12.8020653633
+伏侍 8.6966709649
+尾追 11.3357282945
+何可议 13.900677652
+正座 12.2912397395
+日本防卫厅 12.1089181827
+特罗姆瑟 13.900677652
+别别扭扭 11.5027823792
+应变硬化 13.900677652
+很油 13.2075304714
+葛玄 12.2912397395
+左哨 12.2912397395
+炮艇 11.598092559
+龙生九子 11.4157710022
+罚球区 11.8212361103
+金修 11.9547675029
+修水利 12.2912397395
+担误 13.2075304714
+克什 11.9547675029
+突厥 8.00078029839
+自毙 12.2912397395
+铺床 10.9049453784
+热力循环 12.5143832909
+尖嘴猴腮 11.9547675029
+拉法耶特 11.5027823792
+科孚岛 12.1089181827
+专打 11.598092559
+坐次 11.2616203224
+谷城 8.7245279194
+白求恩国际和平医院 13.2075304714
+水旱灾 13.2075304714
+自毁 11.1280889297
+项目选择 12.2912397395
+金丰 12.5143832909
+新风尚 12.5143832909
+克伦 11.0674643079
+但湘军 12.8020653633
+金丹 9.75754292558
+金丸 13.2075304714
+金主 11.2616203224
+演出者 13.900677652
+碎琼乱玉 13.2075304714
+略过 12.8020653633
+分龄 13.900677652
+呆呆 9.66657114738
+开花结实 11.4157710022
+劈杀 13.2075304714
+双重性 11.9547675029
+慈焕的 12.1089181827
+四十八年 10.6818018271
+铐子 11.9547675029
+张平的 11.8212361103
+七杯 13.2075304714
+七条 10.4041700905
+金业 12.8020653633
+金丝 8.39534611604
+金东 12.2912397395
+杨若有 13.2075304714
+特拉尔 12.8020653633
+恭贺新禧 12.8020653633
+正当 7.5515386606
+洛克耶 13.900677652
+新源县 13.900677652
+弯弯曲曲 9.85762638414
+主情造意 13.900677652
+七月 7.51379833261
+籀文 11.598092559
+七服 13.2075304714
+名犬 12.8020653633
+铺张 10.533381822
+正弦 9.7898037878
+金乡 9.58318953844
+三百多口 13.2075304714
+名状 11.4157710022
+七期 12.1089181827
+此项 8.19356738723
+船级社 12.5143832909
+亲疏贵贱 13.900677652
+大渡口 12.2912397395
+元祖 13.900677652
+林虎贲 13.2075304714
+艾穆单 12.8020653633
+正式 5.26321562817
+百年歌 13.900677652
+七本 13.900677652
+正开 10.8561552143
+铺开 9.62401153296
+环境保护部 10.4994802703
+岳夫人 13.900677652
+起身 6.24813195928
+官小辅 13.2075304714
+陈胜另 13.2075304714
+丘甲 13.2075304714
+水上 7.91422564669
+突刺 13.900677652
+金乌 11.8212361103
+可控因素 10.642581114
+王瑶 11.5027823792
+千刀万剐 10.3453295905
+碧滢 13.2075304714
+腐败现象 10.6818018271
+预防措施 9.5186510173
+陈列室 10.2897597393
+金人 8.61747392324
+名物 10.9562386728
+冷冷淡淡 11.7034530746
+血流成河 10.2897597393
+初生之犊不畏虎 13.900677652
+曲酒 10.2371160058
+嫁出去 10.1394775363
+磁能积 13.900677652
+卡斯腾 12.1089181827
+袁中道 12.1089181827
+孟雄 11.598092559
+金亭 11.9547675029
+正念 12.2912397395
+金亮 12.8020653633
+互助社 12.2912397395
+名片 9.36807815882
+摩天轮 13.900677652
+金井 10.7226238216
+正心 11.8212361103
+名牌 9.14708746087
+职业规划 12.1089181827
+依赖思想 13.2075304714
+国家广电总局 11.3357282945
+首端 13.2075304714
+各线 12.1089181827
+正忙 11.4157710022
+苏占区 11.8212361103
+刘光佐 12.5143832909
+岳乐笑 11.9547675029
+嬖幸 13.2075304714
+罗仙 13.2075304714
+概莫能外 12.1089181827
+永不言弃 13.2075304714
+堕落 8.6803218269
+曼谷 9.12999302751
+回想起来 9.74179456862
+金价 6.789981529
+白璧无瑕 13.2075304714
+死得其所 10.9562386728
+专户 7.95003509939
+比利时 7.59805867623
+龙眉凤目 13.2075304714
+克俭 12.2912397395
+弟子 7.44547908864
+践位 12.5143832909
+七枚 13.2075304714
+金代 9.0884932966
+欺君罔上 11.7034530746
+歹话 13.2075304714
+七枝 12.5143832909
+各给 12.8020653633
+流离失所 10.0940151622
+正德 9.09665660724
+正律 12.1089181827
+好几座 12.5143832909
+邹渊 9.98865464655
+水丸 12.2912397395
+浓云 10.6818018271
+睡觉时间 13.2075304714
+万年前 8.85082164473
+正待 9.06439574502
+以斐 13.900677652
+莲步 11.8212361103
+丘疹 9.89334446674
+绸伞 11.2616203224
+万箭攒心 13.2075304714
+再生胶 12.8020653633
+阿雅克肖 13.900677652
+正得 12.5143832909
+加莱亚 13.2075304714
+头晕眼花 10.4994802703
+突兀 8.92394390956
+打马虎眼 11.5027823792
+朱巴河 11.8212361103
+狼叼 13.900677652
+软件资源 13.2075304714
+董店 12.8020653633
+雕虫篆刻 12.8020653633
+第十二回 11.7034530746
+文人化 13.2075304714
+风油精 11.9547675029
+曼迪 12.8020653633
+没心没肝 13.900677652
+陈玉成 11.0103058941
+宽比 13.900677652
+邪佞 13.900677652
+吃螃蟹 10.9562386728
+丛状 12.2912397395
+第六十二 13.2075304714
+李元吉 11.7034530746
+献给 8.63281949291
+气根 13.2075304714
+西北师范大学 12.5143832909
+革职留任 13.2075304714
+向京 12.8020653633
+州政府 10.0720362555
+八角莲 13.2075304714
+元稹 10.0720362555
+水中 6.75390547252
+长不大 10.8096351986
+拉片 13.900677652
+哈尔科 13.2075304714
+铺展 11.1280889297
+第六十五 13.900677652
+拉特 10.1394775363
+光学镜片 13.900677652
+芦荻 11.9547675029
+人情世故 11.1926274509
+曼达 12.2912397395
+张海鹏 12.8020653633
+强些 11.4157710022
+开开停停 12.8020653633
+邹润 10.8561552143
+等压面 11.1280889297
+边沿 9.69598503258
+王守仁 9.84023464143
+熊克武 12.5143832909
+大营门 13.2075304714
+铺就 11.0674643079
+男女队 13.900677652
+辣手 11.7034530746
+电子型 13.2075304714
+边沁 10.6818018271
+三氧化二锑 13.2075304714
+鲜花 8.43261751084
+正将 9.84023464143
+正射 11.8212361103
+德庆堂 11.9547675029
+乌干达共和国 12.5143832909
+赏善罚恶 12.8020653633
+侯机 12.5143832909
+边沟 13.900677652
+砂石 9.72629038208
+关系融洽 11.8212361103
+砂矿 10.1630080337
+果汁厂 13.900677652
+捆绑 8.80692745117
+不做声 8.90346537821
+慢慢腾腾 12.1089181827
+喉结 10.8561552143
+首种 12.8020653633
+突减 13.900677652
+于邺 10.9049453784
+戴德金 11.2616203224
+糟蹋 9.05649056552
+张锦鸿 13.2075304714
+右掌 12.8020653633
+雄心壮志 10.765183436
+李玉英 13.2075304714
+侯某 12.5143832909
+旱育稀植 13.2075304714
+大学预科 10.9562386728
+第六十三 12.8020653633
+化分 13.900677652
+杭州大学 11.8212361103
+话音 9.08039608637
+错愕 9.71102290995
+第六十一 12.8020653633
+敬语 13.2075304714
+雅娜 13.900677652
+侦察 7.33541268194
+敬请 8.60236028543
+接受批评 12.5143832909
+边江 12.8020653633
+前几次 10.642581114
+砂眼 12.5143832909
+突击 7.50876053858
+突出 5.99302605726
+步子 8.57766767284
+救法 13.900677652
+嗓子眼 9.98865464655
+双稳态 12.5143832909
+民族委员会 11.3357282945
+那小道士 12.2912397395
+王化澄 13.2075304714
+左图 11.8212361103
+司机 6.80727302611
+农学家 10.5684731418
+英俊小生 13.900677652
+娥眉 12.8020653633
+产卵期 10.9562386728
+万多米 12.1089181827
+受贿案 11.4157710022
+敛钱 13.2075304714
+龙首山 10.765183436
+锁紧 11.7034530746
+填街塞巷 13.2075304714
+带出 9.35738286971
+朱仝心 13.900677652
+元章 10.604840786
+薄荷醇 12.2912397395
+断电 10.533381822
+限次 12.1089181827
+第六十九 12.2912397395
+边民 10.4666904475
+于郑 11.7034530746
+乞巧 12.2912397395
+动蛹 13.900677652
+好几层 11.3357282945
+唐宋间 12.1089181827
+辨音 12.5143832909
+右手定则 12.2912397395
+传染科 13.900677652
+系花 13.2075304714
+追求进步 13.2075304714
+失业问题 10.2630914922
+董司令 11.9547675029
+打掩护 11.7034530746
+霍尔蒂 11.598092559
+侯晖 13.900677652
+民族风情 11.5027823792
+血流成渠 12.5143832909
+第七版 12.1089181827
+侯景 10.604840786
+量子化 10.0940151622
+普遍裁军 13.900677652
+代宗广 13.2075304714
+弟妹 10.1630080337
+水彩画 10.4041700905
+砂皮 13.900677652
+李定国 11.0103058941
+邪乎 10.8561552143
+左圆 13.900677652
+世界大赛 11.9547675029
+圣功 13.900677652
+名烟 12.8020653633
+贩卖军火 13.900677652
+稍高 10.0294766411
+水凌凌 12.8020653633
+抖开 10.1871055853
+填沟壑 13.2075304714
+蠢汉 11.8212361103
+高桥镇 11.2616203224
+广义力 12.2912397395
+须三思 13.900677652
+随笔 9.48183704418
+何惧 11.0103058941
+捆缚 11.1280889297
+高碘酸 13.2075304714
+达德利 12.1089181827
+魔鬼城 12.8020653633
+右手 7.34247984916
+垄断权 10.1871055853
+二三成 12.8020653633
+一二里 11.1280889297
+台东区 13.900677652
+纳罗拉 13.900677652
+张闲 12.5143832909
+细条纹 12.8020653633
+七支 12.5143832909
+克鲁伦河 10.4041700905
+作业量 11.9547675029
+西博会 10.3743171274
+叔母 13.2075304714
+翅翼 13.2075304714
+侯显 12.8020653633
+全部开 13.2075304714
+英勇善战 10.6818018271
+各类 6.37288366425
+珐琅 10.1394775363
+假丑恶 13.2075304714
+天理昭彰 13.2075304714
+于柏林 9.93038573842
+洛克色 13.900677652
+汉考克 12.5143832909
+蓟马科 13.2075304714
+田刚 12.5143832909
+止遏 12.8020653633
+任吏部 11.1926274509
+电影厂 12.1089181827
+正巧 9.98865464655
+赵孟 10.533381822
+耐受力 12.2912397395
+两相情愿 12.2912397395
+无计奈何 12.1089181827
+宣布无效 13.900677652
+三氧化二铬 13.2075304714
+羽纱 12.8020653633
+安顺场 11.8212361103
+较著 12.2912397395
+和芳官 12.2912397395
+箝制 12.8020653633
+京都大学 10.9562386728
+三氧化二铝 12.8020653633
+七旬 10.9049453784
+二目 11.1280889297
+七日 9.41204128224
+遥祝 13.2075304714
+折节 12.2912397395
+四肢骨 12.2912397395
+那观山 13.2075304714
+面奏 9.48183704418
+奥扬泰 13.900677652
+台位 13.2075304714
+铜臭气 13.2075304714
+七时 12.8020653633
+乡气 12.1089181827
+烟雨楼 12.1089181827
+太吉祥 12.8020653633
+柳平桥 13.900677652
+富国强民 13.900677652
+好几岁 11.8212361103
+温里药 12.1089181827
+喊叫 8.1902506346
+七文 12.8020653633
+断面图 12.8020653633
+张晓辉 13.900677652
+四十八岁 11.8212361103
+平均偏差 13.2075304714
+录像厅 12.8020653633
+台东县 10.9049453784
+七斗 12.8020653633
+穿衣吃饭 11.9547675029
+低收入 8.51618258919
+内维尔 11.5027823792
+牟欢 12.2912397395
+右拳 11.7034530746
+赫山区 12.5143832909
+称兵 11.5027823792
+土地公 11.4157710022
+念珠菌 10.642581114
+一下场 13.900677652
+各系 10.6818018271
+泡酒吧 12.8020653633
+牛尾巴 13.900677652
+电影史 10.0088573539
+自检 10.8096351986
+一枝一节 13.2075304714
+蜀国 9.77354326693
+自寻烦恼 11.4157710022
+在政治上 8.24468584116
+移动式 10.8096351986
+台当局 13.900677652
+七所 12.1089181827
+左倾 11.1926274509
+西乡隆 11.7034530746
+狼嗥 11.0103058941
+彭家煌 12.8020653633
+混为 12.8020653633
+玉轩藏 13.2075304714
+知情不举 12.8020653633
+资金雄厚 10.9562386728
+自演 11.7034530746
+辩证逻辑 10.8561552143
+蚝油 12.2912397395
+赫伦岛 13.900677652
+幽会 10.2630914922
+混世 12.1089181827
+人死留名 13.2075304714
+极权主义 11.9547675029
+李玉著 12.8020653633
+于阗 9.33632946051
+供需双方 10.9562386728
+硝酸铅 13.900677652
+推背图 11.9547675029
+衣薄裳 12.5143832909
+百页窗 13.900677652
+鲍温 11.9547675029
+魏武侯 11.8212361103
+循环往复 10.4994802703
+声泪俱下 10.6818018271
+鲍桑葵 12.2912397395
+创造者 9.48183704418
+混乱 6.92900904725
+广大客户 10.3453295905
+后恕儿 13.2075304714
+百分之八九十 13.2075304714
+七成 8.46695564842
+一十七员 12.5143832909
+出资额 9.96885201925
+电影周 13.900677652
+敬贤 12.5143832909
+卡斯蒂 12.8020653633
+肺腑之言 10.533381822
+弧度 10.1394775363
+贺老大 11.3357282945
+帕竹泽 13.2075304714
+运输处 12.8020653633
+隆达人 12.2912397395
+澄迈县 13.900677652
+土地爷 11.5027823792
+全部堆 13.2075304714
+真君子 12.5143832909
+并不矛盾 11.0674643079
+七户 11.4157710022
+饲料作物 11.4157710022
+左偏 12.1089181827
+混交 10.533381822
+急追 11.8212361103
+七招 13.900677652
+鼓捣 10.4349417492
+铰接式 11.9547675029
+一曝十寒 13.900677652
+吸声材料 11.7034530746
+紧急状态 9.32596667347
+吉杰博 12.5143832909
+承保人 13.900677652
+月工资 10.4349417492
+右方 10.9562386728
+伍德罗 11.8212361103
+名着 11.5027823792
+说坏话 12.5143832909
+美食家 12.5143832909
+混事 13.900677652
+四野 10.0505300503
+千篇一律 10.6818018271
+霍尔茨 11.7034530746
+检验科 13.900677652
+政法学院 11.3357282945
+恶神 11.8212361103
+三四厘米 13.900677652
+莲湖 13.2075304714
+卷舌音 13.900677652
+重归 9.65218240993
+右旗 11.0674643079
+美人鱼 10.765183436
+右旋 10.0720362555
+七折 9.31571017331
+弹棉花 11.7034530746
+小泽一郎 12.8020653633
+刘玉宝 13.900677652
+减法 10.7226238216
+动脚 11.8212361103
+摩天 10.7226238216
+具有活力 11.8212361103
+特拉姆 13.2075304714
+胡正详 13.2075304714
+陆氏茶 13.2075304714
+才貌俱全 13.2075304714
+田分 11.8212361103
+修身养性 11.1926274509
+好几家 11.1926274509
+动脉 8.45394028031
+闽侯县 11.3357282945
+奇声 13.900677652
+吴香香 9.40086798165
+上座部 11.2616203224
+误服 11.0103058941
+好古 12.2912397395
+动能 7.73947033028
+幽丽 12.8020653633
+屁事 10.2897597393
+名目 8.74162235276
+正学 11.9547675029
+误期 13.2075304714
+丹忱 13.900677652
+困难群众 10.9049453784
+传递数据 13.900677652
+四十四岁 13.900677652
+名相 10.9562386728
+霖雨 12.5143832909
+肉干 10.8096351986
+宽泛 10.3743171274
+谷场 13.900677652
+晴日 12.8020653633
+本月底 9.75754292558
+堕胎 11.1280889297
+断狱 10.765183436
+供血者 12.8020653633
+华道胜 13.2075304714
+买断式 12.2912397395
+花岗石 9.89334446674
+名盘 13.900677652
+韦雷河 12.2912397395
+妙觉 12.8020653633
+地面砖 13.2075304714
+左兵 11.0103058941
+双目失明 9.89334446674
+物理反映 13.900677652
+大力士 10.604840786
+误杀 10.8096351986
+第二信使 11.9547675029
+流寇 9.34680076038
+化出 11.598092559
+今胜 13.900677652
+七八千年 11.598092559
+敬谢 11.8212361103
+混住 13.900677652
+妙解 13.2075304714
+武祖 13.900677652
+职业院校 13.900677652
+敬谨 11.598092559
+于静 12.2912397395
+于贝尔 13.2075304714
+揩泪 10.9049453784
+一个十四岁 12.8020653633
+全部处 13.900677652
+掩藏不住 12.5143832909
+涵碧 12.1089181827
+混作 11.3357282945
+酒精性 11.5027823792
+碎裂 9.5186510173
+旅顺口 10.4666904475
+弟弟 7.22107846613
+喊停 12.1089181827
+断片 12.2912397395
+不平 8.48903160012
+空中客车工业公司 11.9547675029
+喉科 12.2912397395
+王良 11.9547675029
+不干 8.28027678626
+丛生 8.83177344976
+商惠洛 13.2075304714
+幽人 12.2912397395
+几时休 12.8020653633
+正对 9.58318953844
+戈兰高地 11.7034530746
+淹到 12.1089181827
+侵略成性 13.900677652
+飘飘忽忽 11.3357282945
+臭氧层 10.1164880181
+纳格拉 13.900677652
+婚姻自由 10.6818018271
+左军 9.62401153296
+多台计算机 13.2075304714
+木已成舟 11.1926274509
+维利奇 13.2075304714
+层析分离 13.900677652
+传不到 12.8020653633
+突围 8.03989142851
+置之死地而后生 11.9547675029
+诏谕 10.8096351986
+仲秋 12.2912397395
+总司令 7.73947033028
+百富榜 10.533381822
+角色冲突 12.2912397395
+梯恩梯 10.3453295905
+老年性 10.642581114
+遣返回国 13.2075304714
+生仔 13.2075304714
+斯宾塞 9.77354326693
+详细 6.43616781734
+贮藏 8.11071748108
+作业面 13.2075304714
+汉翔 13.2075304714
+自找麻烦 11.2616203224
+边款 11.8212361103
+霍斯特曼 13.2075304714
+换鞋 12.5143832909
+自满 10.9562386728
+一系列 5.80568889267
+朔州 10.533381822
+划归 8.2985588311
+正安 11.9547675029
+易压碎 13.900677652
+首级 8.61747392324
+狼吞 12.8020653633
+正宁 13.900677652
+呆傻 12.1089181827
+宗主爷 10.765183436
+拎包 11.7034530746
+各章 11.4157710022
+泌尿量 13.2075304714
+正定 9.7898037878
+浓缩铀 11.5027823792
+罹难者 13.900677652
+者也之乎 13.900677652
+正宗 8.90346537821
+中间性 13.900677652
+分频 12.2912397395
+自派 13.900677652
+情窦 13.2075304714
+中国证券监督管理委员会 9.29550746599
+耕读 11.0674643079
+王不操 13.900677652
+雷轰 10.7226238216
+三十九级 13.2075304714
+就诊者 12.8020653633
+软件体系结构 13.900677652
+汽机 11.9547675029
+南郑侯 13.2075304714
+想上 11.7034530746
+担负 8.01457362053
+汉北河 11.8212361103
+分领 10.5684731418
+刨土 11.8212361103
+边棱 13.2075304714
+左利 13.900677652
+身材矮小 10.642581114
+爱看 10.1871055853
+误打误撞 11.1926274509
+想为 10.604840786
+冷兵器 10.1630080337
+上颚 10.4666904475
+边检 11.2616203224
+乌鬼 12.5143832909
+高怀德 12.2912397395
+南回归线 10.8561552143
+敬轩 8.63798746307
+各社 13.2075304714
+想个 10.2630914922
+连嘉草 13.2075304714
+张鑫 13.2075304714
+三九天 12.1089181827
+新词语 11.598092559
+调上来 12.8020653633
+门丹墀 12.8020653633
+好几处 10.604840786
+原始农业 10.3453295905
+器使 13.2075304714
+声名远播 11.598092559
+二三月 11.598092559
+绣缎 13.2075304714
+分两路 9.43476953332
+分食 10.8561552143
+折色 11.2616203224
+人代 12.8020653633
+桓仁县 12.8020653633
+侯挚 13.2075304714
+牵出去 13.2075304714
+互助组 11.9547675029
+二三期 11.598092559
+欺人太甚 10.533381822
+牛头不对马嘴 11.9547675029
+排气阀 11.9547675029
+计算机软件 10.1164880181
+维也纳国家歌剧院 11.5027823792
+正堂 10.5684731418
+鲍氏 11.9547675029
+日暖风和 13.900677652
+电子厂 12.8020653633
+根本任务 11.0103058941
+那拉提 12.1089181827
+众多部 13.900677652
+自测 12.8020653633
+真如慧 12.8020653633
+担起 10.2897597393
+涵管 13.900677652
+阖家欢 12.8020653633
+油干灯尽 13.900677652
+想些 10.1164880181
+处惊不变 12.8020653633
+跳水池 13.900677652
+相连接 9.62401153296
+伊通 12.2912397395
+欣然命笔 13.900677652
+株数 11.9547675029
+说道 5.16242307545
+七情 10.2630914922
+电子卡 13.900677652
+指指点点 10.1630080337
+文斯顿 13.2075304714
+绿色生态 13.2075304714
+玛蒂尔 13.900677652
+汝乃 10.8096351986
+别有用心 10.0505300503
+正声 11.7034530746
+惶恐不安 10.4349417492
+汽枪 12.8020653633
+强征公 13.2075304714
+郭淮 10.1871055853
+庸碌 10.765183436
+钻进 7.86519621945
+躺椅 10.0940151622
+姥姥家 11.598092559
+减免税 11.0674643079
+客家话 13.2075304714
+边框 10.8561552143
+情同手足 11.4157710022
+脱水剂 11.598092559
+梁宝亮 13.2075304714
+一一对应 10.3453295905
+瓦良格 11.8212361103
+各种 4.62801997393
+连王爷 12.2912397395
+五七十亩 13.2075304714
+体尝 13.900677652
+比比皆是 9.31571017331
+流线形 11.7034530746
+元结 11.1280889297
+日内瓦 8.59737274392
+名画 9.96885201925
+各科 9.63799777493
+接口处 12.5143832909
+分页 8.49350588052
+分项 9.40086798165
+金属表面 10.1630080337
+汝主 11.5027823792
+姆万扎 13.2075304714
+断然 8.57280148319
+莲池 10.9049453784
+小脸蛋 11.8212361103
+电子化 9.65218240993
+丘状 11.5027823792
+追欢作乐 13.900677652
+步弓 12.5143832909
+人情世态 11.2616203224
+电影圈 13.2075304714
+李侃任 12.5143832909
+天机不可 11.7034530746
+约克郡 10.4994802703
+赛唐猊 13.900677652
+曾述及 13.900677652
+芒刺 11.8212361103
+十一层 12.1089181827
+含血 13.900677652
+携带式 12.8020653633
+分馆 11.3357282945
+赵寄 13.2075304714
+浴血 11.1926274509
+分馏 10.642581114
+刺激器 13.2075304714
+行政院长 10.4666904475
+比利时人 10.9562386728
+步廊 13.2075304714
+妙计 9.25628675283
+新不伦瑞克 12.8020653633
+犹他州 10.3453295905
+辑佚 10.8096351986
+初级社 12.2912397395
+不常 9.71102290995
+相连成 11.598092559
+妙论 12.2912397395
+较能 12.2912397395
+误收 12.8020653633
+第十二号 13.900677652
+赎当 13.900677652
+浴衣 12.8020653633
+磁盘阵列 13.2075304714
+正太 10.642581114
+结大群 13.2075304714
+财政金融 11.1280889297
+妙诀 11.7034530746
+先天性 8.78868986362
+断炊 11.598092559
+群体思维 13.900677652
+想住 12.5143832909
+天葵子 13.900677652
+跣足 11.3357282945
+左卫 11.3357282945
+二千吨 13.2075304714
+侯成 11.5027823792
+财务决算 13.2075304714
+拙夫 12.2912397395
+万多种 10.5684731418
+妙语 11.0103058941
+争夺者 12.5143832909
+一个七十岁 13.2075304714
+六千七百三十九 13.2075304714
+器乐 9.20019728618
+自汗 10.3743171274
+坦坦然然 13.900677652
+熨斗 10.8561552143
+这炷香 13.900677652
+正处 10.4994802703
+第七十六回 12.2912397395
+评测室 11.5027823792
+仿行 11.3357282945
+天火 11.7034530746
+狼嚎 11.4157710022
+纲目 10.604840786
+梅光迪 11.9547675029
+断点 12.8020653633
+九九归原 13.2075304714
+汝何 10.4994802703
+扩张战果 12.5143832909
+卡尔维纳 13.900677652
+柏元里 13.2075304714
+自治 7.55504129115
+波里德 12.1089181827
+普雷西 13.900677652
+地面站 10.4349417492
+湿地 9.33632946051
+少恩 12.8020653633
+瘀斑 10.642581114
+孟郊 11.3357282945
+拉尼斯 13.900677652
+向外走 9.49395840471
+吴新刚 8.75318317516
+残梦 13.900677652
+正始 10.5684731418
+封信中 12.8020653633
+一中院 10.2897597393
+堪称一绝 11.598092559
+断灭 12.5143832909
+杜勒西 12.1089181827
+韦昌辉 10.8561552143
+陈烟桥 12.5143832909
+被动模式 13.900677652
+杜德伟 13.900677652
+好几声 11.598092559
+旱桥 12.8020653633
+第十二卷 10.642581114
+检验站 12.1089181827
+将来 6.17932903936
+呈现出 7.37564799413
+左右 4.74743687204
+汝休 12.5143832909
+左叶 13.900677652
+电影城 12.5143832909
+左司 11.598092559
+穿不出 13.900677652
+奥杰塔 13.2075304714
+桓公友 13.2075304714
+器件 8.39534611604
+全卷 13.2075304714
+慕之意 12.2912397395
+名琴 12.8020653633
+首粒 13.900677652
+格鲁贝尔 12.8020653633
+土库曼斯坦 9.36807815882
+透底 12.8020653633
+生为 10.5684731418
+分饰 13.2075304714
+不懊悔 12.1089181827
+大写意 11.9547675029
+名理 11.7034530746
+十封信 13.900677652
+步师 10.2371160058
+阿蒂博尼特 13.900677652
+正如 7.07196558033
+扎辫子 13.900677652
+方以类聚 12.5143832909
+看人眼色 12.5143832909
+克隆技术 13.900677652
+山中野 11.9547675029
+喉管 11.0674643079
+科比福 13.2075304714
+分隔 8.65893063692
+钢管舞 13.900677652
+左尹 12.2912397395
+燕西凉 12.1089181827
+谢福畴 11.4157710022
+各省 7.21606592431
+管理权限 11.1926274509
+好几块 11.598092559
+后身 11.4157710022
+药物中毒 10.9049453784
+较远 9.17328983326
+邹老爹 13.2075304714
+丝织物 10.533381822
+百折不回 11.8212361103
+李彦主 13.2075304714
+老年痴呆症 12.2912397395
+夸过 12.5143832909
+名篇 9.63799777493
+打场 11.7034530746
+北源楚 13.2075304714
+吴绍周 12.5143832909
+运输商 13.2075304714
+礼乐射御 13.900677652
+快速道路 13.900677652
+剃齿刀 13.900677652
+万米长跑 13.900677652
+济世之才 11.8212361103
+曹家岭 12.8020653633
+自持 9.26594866375
+生个 9.7898037878
+憨厚 9.87532596124
+伊默 13.900677652
+圣多明各 10.9049453784
+捞回 11.4157710022
+衍变 10.2371160058
+栓皮栎 10.1394775363
+议政 8.83808261895
+好几圈 11.5027823792
+控制措施 10.1394775363
+半途而 12.2912397395
+会成 10.5684731418
+分集 13.900677652
+手拿着 10.0294766411
+采莲船 12.8020653633
+贵省 12.5143832909
+恶疾 11.598092559
+掌录奏 13.2075304714
+万籁无声 12.1089181827
+液压件 13.2075304714
+榨汁 11.5027823792
+不利于 7.62780064543
+党项族 10.533381822
+风雨如晦 11.5027823792
+各睡 13.900677652
+测角仪 12.5143832909
+张拴狗 13.2075304714
+步军 9.36807815882
+旧货摊 11.598092559
+好几场 12.8020653633
+总装备部 11.9547675029
+白旺 10.4349417492
+辽海 10.3743171274
+很深 8.44535653662
+有准备地 12.5143832909
+宽慰 9.06439574502
+认真做事 12.8020653633
+第十二届 9.74179456862
+步入 7.53420720424
+过沅江 13.2075304714
+正因 10.4041700905
+动起 10.604840786
+分队 8.76487921493
+小海 11.1926274509
+队服 13.2075304714
+修夏国 13.2075304714
+村夫野老 12.2912397395
+步兵 6.94508504358
+癸巳 12.5143832909
+联欢节 10.604840786
+消毒片 13.900677652
+乡镇政府 12.8020653633
+深夜里 10.604840786
+内疚感 13.2075304714
+羊角风 11.9547675029
+三老四少 13.2075304714
+莲房 13.900677652
+首班 13.900677652
+自排 13.900677652
+较轻 8.69119149913
+集邮品 13.2075304714
+有口无心 12.8020653633
+侯淳 12.5143832909
+狼头 11.8212361103
+宫里传 13.900677652
+丛硕 12.5143832909
+第二具 13.900677652
+卢瓦尔河 11.8212361103
+通过参观 13.900677652
+麟经 13.2075304714
+美食城 10.8561552143
+丛础 12.2912397395
+说二是二 13.2075304714
+子司马炎 12.8020653633
+西道堂 12.8020653633
+碱金属 9.87532596124
+蜀州 11.598092559
+技术指标 8.46695564842
+最佳雇主 12.8020653633
+突审 13.2075304714
+第一纺织 13.900677652
+麦西尼亚 12.2912397395
+中间派 10.533381822
+心里有数 10.0940151622
+东晋时 10.3453295905
+耿守忠 13.2075304714
+童贯令 13.2075304714
+自提 11.5027823792
+牧师住宅 13.900677652
+重重障碍 12.5143832909
+各矿 11.598092559
+分院 9.36807815882
+困难职工 12.5143832909
+掉皮 12.5143832909
+小箱子 11.7034530746
+大众传播 11.1280889297
+锁眼 13.2075304714
+双保险 12.1089181827
+杨元琰 13.2075304714
+翘企 13.900677652
+伊龙 13.900677652
+史郭维 13.2075304714
+华盛顿市 12.8020653633
+石浦港 13.2075304714
+风吹云散 13.900677652
+王子服 11.598092559
+平方毫米 11.5027823792
+物业费 10.4666904475
+择优录用 12.1089181827
+罗波斯 13.900677652
+告了 12.5143832909
+花烛之夜 13.2075304714
+源源 9.94943393339
+工资条 11.9547675029
+焉能 9.94943393339
+官治政 13.2075304714
+驯良 11.8212361103
+断续 9.32596667347
+自戕 11.8212361103
+自成 6.94794900735
+自我 7.34247984916
+自戒 13.2075304714
+称做 8.9102450652
+同意权 12.2912397395
+贴壁 12.8020653633
+浅灰 10.7226238216
+辣椒 8.1641053545
+宗三朝 12.5143832909
+正坐 10.2117981979
+驰马 10.7226238216
+司法 7.42216800977
+侯氏 11.8212361103
+稀世之宝 11.5027823792
+私人物品 12.8020653633
+辽河 8.9519177616
+敬老 11.3357282945
+肉刑 10.2630914922
+更酷 12.5143832909
+讨论式 13.900677652
+自扰 13.900677652
+集体经济 9.69598503258
+集部 13.900677652
+砂糖 10.2117981979
+沸腾 8.52539924429
+别廖佐 12.8020653633
+分化中心 13.2075304714
+和巧姐 12.8020653633
+天才论 13.900677652
+铺地 10.9049453784
+蓝田猿人 11.3357282945
+金将军 13.900677652
+木鲁克 11.8212361103
+选稿 13.900677652
+于魏 11.8212361103
+尼木县 13.900677652
+约一亿 13.900677652
+正圆 11.8212361103
+舒乐安定 13.2075304714
+照看 8.89004235788
+蜀山 11.3357282945
+变声期 12.5143832909
+法属圭亚那 10.642581114
+断线 10.8096351986
+执法犯法 13.2075304714
+辽沈 10.0294766411
+调频电台 12.5143832909
+邓孚槐 12.8020653633
+梓潼 11.1280889297
+谢希德 12.5143832909
+尾蚴 11.2616203224
+塔尔可 13.2075304714
+能乘舟 13.900677652
+元熙 12.2912397395
+子母扣 13.900677652
+探雷器 11.8212361103
+自报 11.1280889297
+肉柱 13.900677652
+方外纪 12.8020653633
+宽恕 9.33632946051
+界面设计 13.900677652
+寿数 11.7034530746
+每一刻 13.900677652
+自投 10.3171587135
+那拉氏 11.0674643079
+自抑 12.2912397395
+终篇 12.8020653633
+待人以诚 13.2075304714
+二万八千九百五十五 13.2075304714
+正域 13.2075304714
+会话层 12.1089181827
+边材 11.598092559
+电子展 13.2075304714
+吴楚军 12.1089181827
+中不溜 12.5143832909
+祭过 11.9547675029
+起名儿 13.2075304714
+侍传旨 13.900677652
+温榆河 10.9562386728
+拉上去 11.0674643079
+沈丹铁路 11.7034530746
+诀窍 10.2630914922
+妙蕙 10.9049453784
+各盟 12.8020653633
+保加利亚语 11.7034530746
+张铁 11.7034530746
+繁体中文 13.900677652
+恕不接待 13.900677652
+驰骋 9.40086798165
+阿尔贝特 13.2075304714
+维登堡 11.9547675029
+焉耆 9.15574552361
+如鬼似魅 12.8020653633
+高尔夫球赛 13.900677652
+稍退 11.7034530746
+痒斯斯 13.900677652
+自拔 11.598092559
+石钟寺 12.8020653633
+王瑞芬 8.65893063692
+稍逊 11.0674643079
+自拍 12.8020653633
+梦笔生花 12.5143832909
+广阔无垠 11.7034530746
+驰骤 11.8212361103
+骨灰瓮 13.2075304714
+幸福美满 11.8212361103
+嫁鸡逐鸡 13.900677652
+添麻烦 10.642581114
+陈兰 11.8212361103
+瓦萨里 12.2912397395
+辍学 9.58318953844
+人山人海 9.80633308975
+经营管理者 11.5027823792
+合家 10.2117981979
+串起 11.7034530746
+鲍恩 11.0674643079
+一摊子 10.9562386728
+分钟 6.67446864188
+各生 12.2912397395
+糟蛋 11.4157710022
+喉癌 11.2616203224
+金毛犬 11.9547675029
+分针 12.2912397395
+陈兵 10.5684731418
+磁偏角 11.0103058941
+小摊贩 11.3357282945
+正告 12.1089181827
+奥斯卡金像奖 12.1089181827
+兼善天下 13.900677652
+各用 10.642581114
+审判长 11.4157710022
+书生本色 13.900677652
+银杏叶 11.9547675029
+进货单 13.900677652
+左帅 10.533381822
+禀性难移 13.900677652
+动迁 10.604840786
+小寒 11.9547675029
+动过 10.604840786
+膂力过人 11.9547675029
+产品开发 9.56994431169
+各界 8.36334338496
+源深 12.5143832909
+简易房 12.2912397395
+正听 12.8020653633
+队旗 12.1089181827
+全班同学 11.7034530746
+转湾抹角 12.2912397395
+绩优股 9.94943393339
+自慰 10.4041700905
+做功 10.0294766411
+双语学校 13.2075304714
+陈英士 12.2912397395
+李镇中 11.8212361103
+民族团结 9.23723855786
+十五世纪 10.9049453784
+咋搞 12.8020653633
+田径赛 11.9547675029
+香袋 10.9562386728
+正合 9.87532596124
+正后 13.900677652
+正名 9.74179456862
+宪章派 11.5027823792
+七八千元 12.5143832909
+丛竹 13.2075304714
+东王公 12.1089181827
+金毛狗 13.2075304714
+机床厂 11.3357282945
+邹文 13.2075304714
+柯勒律治 13.900677652
+两税法 10.642581114
+永定门外 13.2075304714
+功率放大 12.1089181827
+非讲不可 13.900677652
+中国史 10.1630080337
+文三路 13.2075304714
+正向 8.51160592216
+漯河 9.32596667347
+景宗新 13.2075304714
+动辄 8.83177344976
+曾开铸 13.2075304714
+四分音符 13.900677652
+静脉 8.50251495046
+真假莫辨 13.900677652
+元天德 13.900677652
+墓场 10.765183436
+试电笔 13.900677652
+王直 13.2075304714
+妖妄 11.9547675029
+第七篇 12.1089181827
+再植术 12.8020653633
+动轮 11.9547675029
+独体 12.2912397395
+历象考 13.900677652
+雪山山脉 10.8561552143
+动车 10.9049453784
+狼孩 11.7034530746
+维修车间 13.2075304714
+七千七百七十七名 12.8020653633
+安顺市 11.598092559
+远洋轮船 11.598092559
+化学防治 11.598092559
+小洞 10.4666904475
+宰和卿 13.2075304714
+亦不得 11.9547675029
+正品 11.1280889297
+燎原之势 11.3357282945
+财富网 11.0674643079
+孙公刘 12.8020653633
+于桃里 12.1089181827
+纵剖面 10.9562386728
+孙理生 12.8020653633
+扣起来 12.1089181827
+网络媒体 10.3171587135
+于颖 11.0674643079
+空隙 8.81927328699
+小乔木 9.74179456862
+冶炼业 11.8212361103
+十多种 11.2616203224
+石台 9.82314020807
+冻原地带 13.900677652
+基因文库 13.900677652
+垮台 9.04864738806
+锤炼 10.2117981979
+互为因果 11.1926274509
+情意重 13.900677652
+一千六百 11.5027823792
+月光光 13.900677652
+突出成绩 12.5143832909
+言菊朋 11.598092559
+数千个 11.598092559
+肉冻 13.900677652
+扎扎 12.1089181827
+黄伟 10.8561552143
+法定程序 9.48183704418
+斯诺伊 12.8020653633
+情意绵绵 11.1926274509
+源流 9.07236391467
+会话式 12.8020653633
+于飞 13.2075304714
+马上治 11.8212361103
+湿婆 9.94943393339
+鸭绒被 12.8020653633
+脸蛋儿 11.2616203224
+必有一失 12.2912397395
+国无二君 13.900677652
+第五日 11.8212361103
+各理 13.900677652
+言锋 13.900677652
+补偿点 13.2075304714
+涵盖 8.21370229564
+湿害 12.8020653633
+四十八员 13.2075304714
+奥廷托 13.2075304714
+自怨 11.8212361103
+短片奖 13.900677652
+刘隐卒 13.2075304714
+恶相 12.1089181827
+以屈求伸 13.900677652
+克莱克斯 13.900677652
+自性 10.8561552143
+秦始皇帝 11.7034530746
+自怜 11.4157710022
+据预测 10.2630914922
+念君 13.2075304714
+打印稿 13.900677652
+地貌成因 11.9547675029
+雷诺数 10.8561552143
+社会昆虫 13.900677652
+好些户 13.2075304714
+芒市 11.5027823792
+兆赫 10.1871055853
+离子通道 12.5143832909
+克沙赫 13.900677652
+戈西河 13.900677652
+赵岑 13.2075304714
+好几名 13.2075304714
+丁蜀镇 11.8212361103
+市郊 8.38322475551
+赵岐 13.2075304714
+动身 7.73525979774
+小早川 13.2075304714
+五六十万 12.1089181827
+动物学 9.7898037878
+新面貌 10.9049453784
+快又准 12.8020653633
+珀思 13.900677652
+鱼弘志 13.2075304714
+世界形势 11.8212361103
+辽源 11.5027823792
+曼波 13.900677652
+史秉直 13.2075304714
+断粮 10.9049453784
+湿寒 12.8020653633
+熬过来 11.3357282945
+边料 13.900677652
+人情味 10.2371160058
+八千零九十三处 13.2075304714
+人生目标 11.9547675029
+咬住不放 12.5143832909
+宫保 13.900677652
+自恋 11.598092559
+分门 11.7034530746
+源泉 8.230796729
+独人 12.5143832909
+专家组 9.62401153296
+自恃 9.37888907493
+朔县 10.604840786
+艾尔诺 13.900677652
+芒康 11.7034530746
+氰化 11.8212361103
+免税 8.87023973058
+自悲 13.2075304714
+真实性 8.66956903512
+分销 8.82550383674
+引人瞩目 10.5684731418
+刘掌柜 12.1089181827
+修院修 13.2075304714
+对地 9.43476953332
+别无他物 13.2075304714
+哀鸿遍野 10.8561552143
+吉剌思 12.2912397395
+晴隆 12.8020653633
+友社 11.9547675029
+脱衣服 10.4349417492
+几世纪 12.5143832909
+少少的 13.900677652
+左徒 12.8020653633
+敬若 13.900677652
+重新部署 11.1280889297
+穷骨头 13.2075304714
+失之毫厘 13.2075304714
+八音 10.8096351986
+中拇指 13.900677652
+加以解决 10.9562386728
+第七章 9.33632946051
+宽扎 12.2912397395
+小叔叔 12.8020653633
+源氏 11.4157710022
+武皇帝 10.9049453784
+芒廷 12.8020653633
+常胜军 9.04864738806
+独一 10.765183436
+饰品网 13.900677652
+自惭 11.9547675029
+阴河 11.0103058941
+加速器 8.98802276624
+市道 10.2630914922
+金钢石 13.2075304714
+弟兄 7.0850376619
+湿季 11.9547675029
+突增 11.2616203224
+花衣裳 12.2912397395
+舀酒 12.5143832909
+诸元素 12.8020653633
+光辐射 10.3743171274
+新昌县 12.5143832909
+独个 12.5143832909
+过氧化物 10.1630080337
+侦办 11.5027823792
+分长 12.8020653633
+水煎包 11.2616203224
+左心 11.4157710022
+个人感觉 11.1926274509
+罗夏墨 12.8020653633
+成千上万 8.42421410004
+女一号 12.8020653633
+掉牙 12.8020653633
+宽旷 13.2075304714
+吴依 12.5143832909
+葛罗 11.9547675029
+生理特点 10.8561552143
+布告 9.59661255877
+鱼鳞图册 10.765183436
+国语文 12.8020653633
+正剧 10.604840786
+乱倒 13.900677652
+四方面军 9.94943393339
+从右到左 12.2912397395
+雇佣兵 10.3453295905
+遥相 10.8096351986
+诸福棠 13.2075304714
+居委 13.900677652
+正割 13.2075304714
+怀疑论者 12.8020653633
+荏弱 12.5143832909
+峡湾 10.3743171274
+司陶特 13.2075304714
+四十八卷 12.5143832909
+法书 10.6818018271
+穿来穿去 11.3357282945
+右派 8.77077893705
+文学评论 10.3743171274
+剑阁县 13.900677652
+嗅探器 13.900677652
+交足 11.1926274509
+吴侯 9.98865464655
+吴侬 12.1089181827
+动觉 12.1089181827
+自有 7.13218444033
+同打 13.2075304714
+亚克兴 12.5143832909
+拍手叫好 11.598092559
+蒋唐石 13.900677652
+玄言解 13.2075304714
+解释程序 13.2075304714
+御法度 13.900677652
+电影局 11.4157710022
+土地税 10.9049453784
+建福宫 13.900677652
+优质服务 10.604840786
+可听声 13.2075304714
+代乐毅 13.2075304714
+易巴德 12.8020653633
+里里外外 9.62401153296
+自来 8.52539924429
+椰子壳 12.5143832909
+铺到 11.9547675029
+摘记 13.900677652
+施展抱负 12.2912397395
+肉圆 12.5143832909
+一揽子 8.00903344015
+饿肚子 10.4666904475
+肺活量 11.0674643079
+万盎司 10.8096351986
+正切 11.2616203224
+刮水器 12.1089181827
+特拉克 12.5143832909
+软流圈 11.2616203224
+正则 10.3453295905
+前几日 9.58318953844
+地主家 11.1926274509
+元瑾 13.900677652
+选择面 13.2075304714
+王玉振 13.2075304714
+自杀 7.55679721785
+丘磊 12.2912397395
+吴伟 11.8212361103
+优惠关税 12.8020653633
+将信将疑 9.74179456862
+上林苑 11.0674643079
+指导方针 10.0720362555
+矿产品 9.84023464143
+不大 5.89999286746
+汤国梨 13.2075304714
+辣油 13.2075304714
+拜候 11.8212361103
+噪声控制 13.2075304714
+陈世松 13.2075304714
+昆虫记 13.900677652
+鲍曼 12.2912397395
+甲类 9.6811699468
+邹捷 13.2075304714
+伪托 11.5027823792
+新文学运动 11.598092559
+宽敝 13.900677652
+宽敞 8.61747392324
+好几只 11.1280889297
+刹那间 8.21370229564
+黑木山 13.900677652
+张庆文 13.900677652
+西竺寺 11.1926274509
+逃匿 10.7226238216
+罗士琳 13.2075304714
+吃罪不起 11.1926274509
+张定发 13.2075304714
+未婚先孕 13.2075304714
+代沃布 13.900677652
+中规中矩 10.6818018271
+第九十六回 12.2912397395
+罚球弧 13.900677652
+公交车 8.39941944143
+公安厅 10.2897597393
+亚力山大 12.5143832909
+魏兵见 12.8020653633
+李彝殷 12.5143832909
+陈舍娃 12.5143832909
+喉炎 11.4157710022
+自查 9.69598503258
+此间 7.78038023302
+柳眉 11.5027823792
+吃饭防噎 13.900677652
+占地近 12.1089181827
+各班 11.598092559
+市面 10.604840786
+眷怀 12.8020653633
+万多片 13.2075304714
+拙劣 10.1871055853
+左壁 12.8020653633
+许文强 13.900677652
+不中用 9.27570483869
+吴佩 13.900677652
+功利主义 10.4666904475
+少女时期 12.1089181827
+内阁会议 10.1630080337
+占有权 11.4157710022
+工业制品 11.598092559
+鹪鹩 13.2075304714
+汽水 10.4349417492
+二千年 11.4157710022
+称叹 11.9547675029
+鲁国为 13.2075304714
+步哨 13.900677652
+东方出版社 12.8020653633
+老生常谈 10.642581114
+戴出去 13.900677652
+志愿书 13.2075304714
+尾舵 13.900677652
+数控机床 10.4349417492
+模式 6.03051170551
+日照市 11.3357282945
+丘祖 11.2616203224
+空阶 13.2075304714
+哀荣 13.2075304714
+正午 9.28555713513
+逃反 12.1089181827
+李振春 13.900677652
+不谐和 12.8020653633
+普林西 13.2075304714
+七步 12.2912397395
+吴亮 11.9547675029
+王光恩 10.533381822
+吴京 13.900677652
+西林觉 13.900677652
+空防 10.9049453784
+一招一式 11.0674643079
+进货员 13.2075304714
+瓦萨雷 12.8020653633
+正南 9.56994431169
+艾文莉 11.9547675029
+湿巾 11.9547675029
+市集 10.7226238216
+右江 10.1871055853
+各版 12.1089181827
+常流河 11.8212361103
+不备 9.82314020807
+捞取 11.0674643079
+潇湘电影制片厂 13.2075304714
+掘开 10.1871055853
+心胆俱寒 13.2075304714
+仨俩 12.8020653633
+百米赛跑 13.900677652
+钻营 10.0088573539
+侦听 9.82314020807
+车持谦 13.2075304714
+雀巢公司 12.2912397395
+张静 11.4157710022
+吴任 11.8212361103
+北京饭店 10.9562386728
+七次 9.98865464655
+砂磨 13.900677652
+于明嘉靖 11.9547675029
+扬沙 11.9547675029
+不复 9.46986085313
+吴仪 13.2075304714
+来处 12.5143832909
+詹建俊 12.8020653633
+各牵 13.900677652
+正北 10.0294766411
+高含水 13.900677652
+集资款 11.4157710022
+总局局长 10.5684731418
+库存量 9.34680076038
+正可 10.3453295905
+气哼哼 10.0720362555
+锁片 12.8020653633
+狼山 10.2371160058
+吴世 12.8020653633
+八十七处 13.2075304714
+大多数对 12.2912397395
+汽油 7.78258045393
+网上聊天 11.8212361103
+由红转 12.8020653633
+吴三 13.900677652
+首盘 13.900677652
+正史 9.35738286971
+松柏植物 11.598092559
+正号 11.9547675029
+化做 11.1926274509
+哈夫迪 13.900677652
+曼联 11.4157710022
+破者 13.2075304714
+吴为 6.20174145216
+吴主 11.0103058941
+正反 10.6818018271
+吴丹 11.9547675029
+黄志强 13.900677652
+唐蔡州 13.2075304714
+尽我所能 12.5143832909
+薪水 9.59661255877
+不外 9.93038573842
+铺叙 11.3357282945
+首相 7.51717101709
+吠檀多 11.8212361103
+砂砾 9.18217878068
+庄浪 11.1926274509
+汽泵 13.900677652
+背得 10.3453295905
+孔明归 13.2075304714
+闹喧 13.900677652
+开罗会议 11.0103058941
+常流水 13.2075304714
+恶势力 11.1926274509
+第十二夜 12.2912397395
+汽泡 13.2075304714
+耕耨 12.5143832909
+与鬼为邻 13.900677652
+政坛 9.72629038208
+仿若 12.8020653633
+闯出去 13.2075304714
+大侠客 13.900677652
+正压 10.7226238216
+投下去 12.2912397395
+耕耘 10.1630080337
+斯特劳斯 10.9562386728
+航委会 13.900677652
+班玛县 13.2075304714
+说千道万 13.2075304714
+亲上加亲 13.2075304714
+正厅 9.85762638414
+鲍林 10.765183436
+那朵红 12.5143832909
+耕者 11.2616203224
+隔音设备 12.8020653633
+不多 7.0590621755
+万佛塔 12.8020653633
+初级班 13.900677652
+严志达 13.2075304714
+呆子 8.15128466607
+分米波 12.1089181827
+曹文庄 13.900677652
+又有何难 12.5143832909
+占地费 13.2075304714
+蹉跎 11.0674643079
+优惠价 11.8212361103
+知名当世 12.5143832909
+国内航线 9.6811699468
+冷杉林 11.2616203224
+一朝 8.92394390956
+电子对 10.533381822
+湿度 8.20694551317
+钻井进尺 13.900677652
+挥之不去 10.0940151622
+试比高 13.900677652
+喉片 12.8020653633
+涌溪 13.900677652
+同窗 10.4041700905
+沃德金 13.2075304714
+李立三 10.6818018271
+四位一体 11.598092559
+不知就里 10.9562386728
+搜狐网 11.8212361103
+惨事 11.7034530746
+有机体 9.33632946051
+拯救 8.04274449749
+动词 9.56994431169
+大伙房 11.8212361103
+山谷地 13.2075304714
+流线型 9.87532596124
+阿米尔 13.2075304714
+峡江 11.2616203224
+村村通 11.2616203224
+第七缕 13.2075304714
+特拉卡 12.8020653633
+格言 9.6811699468
+七百一十多万两 13.2075304714
+边患 10.533381822
+稀溜溜 13.900677652
+金人成 13.2075304714
+祝希娟 12.5143832909
+大会决议 10.4666904475
+言道 8.18036587537
+维拉尔 12.2912397395
+谷善 13.2075304714
+动议 10.3171587135
+正值 7.91171623509
+炒起来 11.3357282945
+石钟山 11.1280889297
+七株 13.900677652
+第五十八章 12.8020653633
+中国剧院 13.900677652
+全部列 13.900677652
+台东市 11.9547675029
+夏洛泰 12.2912397395
+蒋景祁 13.900677652
+特拉华 11.8212361103
+自救 9.09665660724
+互相推诿 11.4157710022
+玄言诗 11.8212361103
+七根 12.2912397395
+录像带 10.604840786
+彻里彻外 13.2075304714
+七格 13.900677652
+分部 8.83808261895
+师相 11.2616203224
+哑语 11.8212361103
+断离 12.2912397395
+男儿有泪不轻弹 12.1089181827
+分途 12.5143832909
+电子学 9.44633035572
+政治责任 11.7034530746
+宽松 6.11537246944
+自新 11.3357282945
+忠贞不二 11.8212361103
+分送 10.9562386728
+闻明公 13.2075304714
+服务小组 13.2075304714
+层出不穷 8.87023973058
+分选 10.3453295905
+自治体 12.8020653633
+安魂 12.5143832909
+正像 9.04086524761
+自料 11.598092559
+红外摄像机 13.900677652
+初心 13.2075304714
+于鲁 11.9547675029
+昌化县 12.8020653633
+等偏角 13.900677652
+客家菜 13.900677652
+私人机构 12.2912397395
+困倦起来 12.8020653633
+赎回 7.16134102462
+藏藏 13.2075304714
+湿布 11.598092559
+七棵 12.8020653633
+流线圈 12.1089181827
+玉阳镇 12.5143832909
+葛笃德 13.2075304714
+分道 9.69598503258
+轧钢厂 12.1089181827
+批斗会 11.1280889297
+货流地理 13.2075304714
+区域气候 11.9547675029
+瞧出 12.5143832909
+株洲 9.43476953332
+戌时 11.4157710022
+一百多张 13.2075304714
+异裂反应 13.900677652
+内分泌 8.27666014579
+押阵 12.8020653633
+徐六娃 13.2075304714
+密执安州 12.5143832909
+尽管如此 8.08059472162
+鸣沙山 11.2616203224
+伊顿 12.8020653633
+羟基 8.95903522937
+抖动 8.87679713113
+梓树 12.5143832909
+坐法 12.5143832909
+主题公园 9.65218240993
+珀斯 11.5027823792
+陈列品 11.4157710022
+淋巴细胞 9.24671730182
+京东方 9.77354326693
+自旋 9.20019728618
+市长 6.05369666984
+焚烧处理 13.2075304714
+邂逅 10.1630080337
+摄取量 11.0103058941
+博览群籍 12.5143832909
+沈长卿 12.8020653633
+频度 10.4994802703
+宠物狗 13.2075304714
+清算斗争 13.900677652
+正典 11.5027823792
+反革命 8.11993413618
+鄂齐尔 12.8020653633
+品性不好 13.900677652
+恶狼 10.533381822
+邓朴方 12.5143832909
+名系 13.2075304714
+传染病 8.34384959028
+布尔加宁 12.2912397395
+正光 11.0674643079
+正元 11.7034530746
+地图信息 13.900677652
+卢创坚 13.2075304714
+篆章 13.900677652
+任中书 10.5684731418
+世界地图 11.0103058941
+付之丙丁 13.2075304714
+恶狗 10.9049453784
+人情债 12.1089181827
+种族隔离 10.2117981979
+管委会 9.46986085313
+纲纪 10.3743171274
+医学中心 11.1280889297
+分金 13.2075304714
+井底之蛙 11.598092559
+明其主 13.2075304714
+自摸 13.2075304714
+突射 13.2075304714
+早去早回 11.598092559
+广学会 12.1089181827
+北大港 11.9547675029
+好几倍 10.3453295905
+恶犬 11.9547675029
+大东海 11.8212361103
+要功 13.900677652
+刘辩 13.2075304714
+舍己为人 13.2075304714
+肥厚型 13.2075304714
+吴宗国 11.2616203224
+死死的 10.0505300503
+分野 10.6818018271
+分量 8.02014466558
+印堂发黑 13.900677652
+玉泉 9.87532596124
+捞出 10.2117981979
+老举子 12.8020653633
+新米 12.2912397395
+塑造成 11.5027823792
+此际 11.2616203224
+毛利率 7.75864024639
+存储介质 12.2912397395
+戈梅利 13.900677652
+怪气 13.2075304714
+十多类 13.900677652
+宠物犬 13.900677652
+全部包 11.8212361103
+葛兹 12.8020653633
+高筒靴 13.900677652
+十多米 11.8212361103
+矿产地 10.3171587135
+汪直领 13.2075304714
+左宰 13.2075304714
+吴与晋 12.8020653633
+左家 12.5143832909
+鲍旭 9.98865464655
+常备不懈 13.2075304714
+于元康 13.2075304714
+当不成 10.642581114
+垢面蓬头 13.900677652
+正出 12.1089181827
+流动沙丘 10.0088573539
+铺出 13.900677652
+肉品 11.8212361103
+仿真技术 11.7034530746
+正凶 12.8020653633
+四国银行 11.598092559
+打印纸 13.900677652
+提早 8.90346537821
+大气学 13.900677652
+程思远 13.2075304714
+不知不觉 7.93197009199
+湿式 13.900677652
+耍手段 13.900677652
+污水泵 13.2075304714
+凑份子 11.598092559
+铸鼎象物 13.2075304714
+卫东 10.7226238216
+那门儿 12.5143832909
+魏良辅 11.9547675029
+示范者 13.2075304714
+五十一个 12.8020653633
+人多势众 10.5684731418
+钽铁矿 11.9547675029
+鲍斯 11.7034530746
+第三十八届 12.5143832909
+石脑油 10.8561552143
+砚堂 13.2075304714
+言重 10.533381822
+巴解执委会 13.2075304714
+布哨 13.900677652
+圣哥 12.1089181827
+赶路的人 12.8020653633
+贮运 10.9049453784
+污水沟 12.8020653633
+葛粉 12.5143832909
+泰国队 13.900677652
+分配 6.2942902622
+隗翦 12.8020653633
+鲍文 13.2075304714
+西陆网 13.900677652
+贵点 11.8212361103
+妙药 11.4157710022
+正册 12.5143832909
+普里特 11.0103058941
+半途而废 9.93038573842
+元知 13.2075304714
+鞋舌 13.900677652
+第七级 13.900677652
+民众党 13.2075304714
+格奈森诺 13.2075304714
+同站 13.2075304714
+胆固醇 8.64318227995
+十余座 12.2912397395
+洗过去 13.900677652
+多香 12.8020653633
+天气状况 10.8096351986
+斫轮老手 12.2912397395
+潞城 11.1926274509
+金弹 12.5143832909
+纪君祥 12.8020653633
+学科前沿 12.8020653633
+好几位 10.9049453784
+首歌 10.7226238216
+正书 11.7034530746
+洒下来 12.1089181827
+擅自改变 11.1280889297
+动问 10.0940151622
+伊蚊 11.8212361103
+吴历 11.8212361103
+各演 13.900677652
+警告声 13.900677652
+陆府 12.5143832909
+吴县 9.61021821083
+正义 8.03704647638
+老年病 11.9547675029
+稍见 13.900677652
+恐是 11.7034530746
+李少君 13.2075304714
+稍觉 10.642581114
+第六十四篇 13.2075304714
+分枝进化 13.900677652
+伪经 12.8020653633
+七百 10.0505300503
+输电网 12.2912397395
+明日香 13.900677652
+爱德华多 13.900677652
+日进斗金 12.5143832909
+王挥兵 13.900677652
+分身 10.6818018271
+来宝寨 13.2075304714
+轮南 13.2075304714
+刘谋儿 11.1926274509
+独善 12.2912397395
+自筹 10.4349417492
+正中 7.93453091285
+慎终追远 13.2075304714
+西博尼 13.900677652
+北京国安队 13.900677652
+推土机 10.1871055853
+欧广源 13.2075304714
+边纹 13.900677652
+正为 9.58318953844
+华林学 13.2075304714
+高韫玉 13.2075304714
+边线 10.533381822
+篆文 11.3357282945
+金彩 11.9547675029
+市话 11.8212361103
+金彪 12.1089181827
+小企业 8.56795885871
+耐火材料 9.77354326693
+法尔思 12.5143832909
+正下 11.7034530746
+正上 11.8212361103
+一房一厅 13.900677652
+对外经贸大学 12.5143832909
+铺上 9.4233408375
+正方形 9.44633035572
+找上去 13.900677652
+三视图 13.900677652
+顾恩思 13.2075304714
+机械迁移 13.900677652
+抬过来 11.5027823792
+还原反本 13.900677652
+正业 11.9547675029
+第纳尔 11.3357282945
+三叉神经 11.9547675029
+亚拉巴马州 11.598092559
+正东 10.3743171274
+王雪涛 11.9547675029
+掉渣 12.2912397395
+有机化学 9.30555780184
+首款 9.93038573842
+机数 10.3743171274
+评法批儒 13.900677652
+七盏 12.1089181827
+画龙点晴 13.900677652
+金德 11.0674643079
+科涅夫 13.2075304714
+少说多做 13.2075304714
+补偿款 10.642581114
+七盘 11.5027823792
+重讲 13.900677652
+于芽 13.900677652
+脑脊液 10.2117981979
+房源 8.85082164473
+正价 13.2075304714
+自管 11.5027823792
+那沙 13.900677652
+田园之乐 13.2075304714
+井蛙 13.900677652
+糟鱼 12.8020653633
+人下 10.4994802703
+别有天地 13.2075304714
+天高皇帝远 12.5143832909
+恶浊 12.8020653633
+不先来 12.5143832909
+举办权 12.2912397395
+精力过人 13.2075304714
+婶子 8.34771806705
+重奖 11.0103058941
+弗卢埃 12.5143832909
+酥油茶 11.1280889297
+劳动手段 12.2912397395
+金律 12.5143832909
+吴匡 13.900677652
+洛克里 12.8020653633
+涵洞 10.8096351986
+拙于 11.9547675029
+王桥镇 12.8020653633
+绸带 11.598092559
+镜铁山 12.5143832909
+华林寺 12.5143832909
+编制成 12.5143832909
+金忠 13.2075304714
+千秋功过 13.900677652
+磨勘 13.2075304714
+最须 13.900677652
+余热 9.72629038208
+李维诺夫 13.2075304714
+和永嘉 13.2075304714
+敬香 10.765183436
+平准基金 11.4157710022
+吴卿 12.8020653633
+整风 10.2630914922
+奸笑 12.2912397395
+正于 12.1089181827
+金志 10.3453295905
+精神鼓舞 11.7034530746
+绸布 10.8561552143
+儿女情 12.5143832909
+联系性 13.2075304714
+摩拳擦掌 9.91169360541
+空手而回 10.9562386728
+首段 12.2912397395
+独唱 9.85762638414
+煤气罐 11.9547675029
+季莫费 13.2075304714
+宫含元 13.2075304714
+断机 13.2075304714
+年初一 12.5143832909
+收藏者 10.9049453784
+学业有成 13.2075304714
+流域面积 7.63158136827
+新发型 13.2075304714
+协作办 12.8020653633
+惨况 11.9547675029
+正使 11.1926274509
+拙作 13.900677652
+放能反应 13.900677652
+克强 13.2075304714
+外听道 13.900677652
+捶击 12.1089181827
+免疫刺激 13.900677652
+铺位 10.7226238216
+聪明伶俐 10.3453295905
+隧洞 10.0294766411
+金帛 9.40086798165
+小注 12.8020653633
+金帝 12.2912397395
+移风易俗 11.4157710022
+想头 10.4666904475
+金币 9.08039608637
+吴努 11.9547675029
+金帆 13.900677652
+正体 11.3357282945
+分辩 9.38981814546
+通渭县 13.2075304714
+沈充 12.2912397395
+被劫持 11.8212361103
+皖西 10.2371160058
+分运 13.900677652
+名护 12.2912397395
+金平 11.0674643079
+葛成 12.8020653633
+郭小川 12.5143832909
+十多所 13.900677652
+正传 10.6818018271
+挤下去 13.2075304714
+好几丈 13.2075304714
+小波 12.1089181827
+黄岩县 13.2075304714
+决策问题 10.9049453784
+分过 11.8212361103
+各湖 13.900677652
+人丁 9.59661255877
+汽灯 10.5684731418
+尊师重道 12.5143832909
+皮洛斯 12.2912397395
+无地可容 13.2075304714
+地面水 11.7034530746
+此行 8.68574189437
+小平房 11.1280889297
+想好 10.3453295905
+平整度 11.9547675029
+研究院 7.35532799164
+矮矮的 11.0103058941
+好几个 7.95525704337
+燕雀处堂 13.2075304714
+贵港 11.2616203224
+较难 9.45802639549
+子额哲 13.2075304714
+所含 8.95903522937
+幽婉 13.2075304714
+几十丈 11.5027823792
+吴印咸 12.1089181827
+涵江 12.8020653633
+翌日 10.3171587135
+吴刚 11.8212361103
+金庸 11.1926274509
+汽点 13.2075304714
+切腹自杀 11.9547675029
+屠夷 13.900677652
+丙烯画 12.2912397395
+婶婶 9.72629038208
+照常营业 12.2912397395
+于莲 8.38724890581
+言辞 9.55687223012
+开发计划 10.9562386728
+金库 10.0505300503
+一路发 13.900677652
+好几代 11.598092559
+金店 10.8561552143
+全三卷 13.900677652
+拗不过 10.4349417492
+额定量 13.2075304714
+顽强不屈 12.5143832909
+名手 10.8561552143
+好几件 12.8020653633
+铺保 12.1089181827
+检验法 11.598092559
+回忆往事 11.9547675029
+打道回府 10.765183436
+於水边 13.2075304714
+好几份 12.2912397395
+元月份 12.5143832909
+全像 12.1089181827
+碳纤维 10.3453295905
+污血 10.642581114
+合在一起 9.16447920358
+艾伯特 10.642581114
+金廷 11.598092559
+贮量 11.3357282945
+黄马 11.5027823792
+苦得 11.2616203224
+老底子 12.1089181827
+九龙城区 13.2075304714
+梁六州 12.5143832909
+独吞 11.0103058941
+石峰堡 12.8020653633
+伊柳塞 13.2075304714
+分水岭 8.0746775446
+白吊谎 13.2075304714
+蒙舍诏 12.8020653633
+原料药 9.89334446674
+误班 13.900677652
+公共电视 13.900677652
+尤拉 13.900677652
+司理 11.598092559
+三足鼎立 10.2371160058
+广昌县 12.8020653633
+边缘 6.47710920772
+恶气 10.1871055853
+贵溪 10.2897597393
+婶娘 10.0294766411
+好几亿 13.2075304714
+汝夫 12.8020653633
+哇喇 13.900677652
+百道 12.8020653633
+吴军 10.3743171274
+工艺美术家 11.598092559
+言谈 9.61021821083
+权闻言 12.5143832909
+熨烫 11.2616203224
+六月份 11.4157710022
+气源 9.38981814546
+正当年 12.8020653633
+志愿兵 11.1280889297
+任中华 11.1280889297
+螽斯 11.5027823792
+克尽 11.9547675029
+言谢 12.5143832909
+稳定区 11.9547675029
+举报人 11.1280889297
+卑南 11.1280889297
+侯督 13.2075304714
+各派 8.70772080109
+湛卢 12.8020653633
+南惟畿 13.2075304714
+玻璃瓦 13.900677652
+克尔 10.1394775363
+百遍 12.2912397395
+山三岭 12.5143832909
+罗波维 12.8020653633
+雅雅 12.2912397395
+吱唔 11.598092559
+幽女 13.900677652
+抖上 13.900677652
+抖下 13.2075304714
+圣诞礼品 13.2075304714
+主课 12.1089181827
+侯真 13.2075304714
+田华 12.5143832909
+克山 10.4666904475
+长官司 10.642581114
+举办方 13.900677652
+纪泰山 12.8020653633
+里菲思 12.2912397395
+稍许 10.7226238216
+任为长老 12.8020653633
+五万两 11.1926274509
+杨越 13.2075304714
+应供 12.5143832909
+友情 9.63799777493
+宁上尉 12.8020653633
+上梁不正下梁歪 11.3357282945
+梦工场 13.900677652
+表达能力 10.9562386728
+海军航空工程学院 13.900677652
+自治县 8.64840422393
+关文捧 13.2075304714
+心情坏 12.5143832909
+佳人才子 13.2075304714
+连续飞行 12.1089181827
+吴凤 12.8020653633
+掌握权力 13.2075304714
+白令陆 12.5143832909
+金嵌 12.8020653633
+陈晓东 12.5143832909
+不透明性 13.2075304714
+龌龊事 13.2075304714
+人丛 9.91169360541
+抬起 7.14957618304
+邪念 10.8561552143
+气候带 9.66657114738
+零花钱 10.9049453784
+生津润 12.1089181827
+吵到 11.8212361103
+右玉 11.1926274509
+全家人 8.98069672615
+独坐 10.604840786
+后转 10.5684731418
+牛脾气 11.9547675029
+元朔 10.4041700905
+玄德留 12.2912397395
+器官 7.13910488317
+动静 7.07413242842
+一般无二 11.2616203224
+优惠活动 8.44963919841
+屁大 11.1926274509
+明敏之 13.900677652
+二百三十四万八千六百九十七亩 13.2075304714
+伯垂真 13.2075304714
+掉泪 10.0940151622
+较长 7.31312763715
+误点 13.900677652
+玉浆 13.900677652
+自禁 11.8212361103
+庄一战 13.900677652
+纳赛尔湖 13.900677652
+优惠券 11.5027823792
+谭大怒 12.8020653633
+猜枚 11.1280889297
+家祭 12.5143832909
+自称 7.24138373229
+一千三百余名 12.5143832909
+推想到 12.8020653633
+金工 11.5027823792
+后车 10.6818018271
+延延 12.8020653633
+混声 11.9547675029
+哥德 12.1089181827
+宽松环境 11.1280889297
+哈里斯堡 12.8020653633
+惨剧 9.94943393339
+持卡人 9.55687223012
+联系户 13.2075304714
+吱喳 13.2075304714
+姓袁 11.7034530746
+凉开水 10.765183436
+榾柮 13.2075304714
+洗髓伐毛 13.900677652
+吴兴 9.6811699468
+吴兵 9.91169360541
+金川 10.0294766411
+吴兰 11.7034530746
+金州 10.9049453784
+自种 12.5143832909
+吴公 11.9547675029
+此话 8.67493097826
+公使馆 10.2897597393
+各添 13.2075304714
+志愿军 8.53470163695
+审计署 10.765183436
+践履 12.5143832909
+此诗 11.1926274509
+布拉班特 12.5143832909
+吴兢 12.2912397395
+自私 8.9102450652
+形影相吊 12.8020653633
+俩对 13.2075304714
+向量分析 12.5143832909
+夜不成寐 12.2912397395
+容纳性 13.900677652
+妙龄 11.0674643079
+吱呀 10.7226238216
+美人计 10.9049453784
+绸巾 11.3357282945
+冉魏 11.4157710022
+德吕克 12.2912397395
+普通照会 13.900677652
+商占有 12.5143832909
+司直 11.5027823792
+大气环境 11.1280889297
+言败 13.2075304714
+元欣 12.1089181827
+多餐 11.9547675029
+系统生成 13.2075304714
+愚忠 11.0103058941
+伤别离 13.2075304714
+此言 8.04274449749
+第七批 11.8212361103
+钢制品 12.1089181827
+惨厉 12.2912397395
+杂种 8.95903522937
+司监 13.2075304714
+贵池 11.1280889297
+金山 8.40761620864
+欧阳修成 13.900677652
+三十六卷 11.9547675029
+冗繁 12.8020653633
+呕出 11.5027823792
+明正朔 12.5143832909
+魏权龄 13.900677652
+汝定 11.4157710022
+惨叫 9.24671730182
+汝宁 10.2630914922
+陈阿伯 11.5027823792
+尤登尼 13.2075304714
+人民政府 7.80710788193
+吱吱 9.61021821083
+络绎不绝 9.18217878068
+豁人耳目 13.900677652
+方相氏 12.5143832909
+贪多 13.2075304714
+金霸王 13.900677652
+亚纲枝 13.2075304714
+司皆 12.8020653633
+金属 6.05879172299
+运输业 9.03314320152
+宽窄 9.69598503258
+美术教育 10.7226238216
+姚蓬子 12.5143832909
+哌唑嗪 13.900677652
+十五路 13.900677652
+格斗游戏 12.8020653633
+金屋 11.7034530746
+罢了 6.87425084328
+奥凯西 12.8020653633
+治沙 11.3357282945
+分路 9.7898037878
+养貂业 13.2075304714
+俯仰随人 13.900677652
+淀山湖 10.8096351986
+汝孝 13.2075304714
+滥用职权 10.3743171274
+分贝 9.96885201925
+俄罗斯卢布 12.8020653633
+颓废派 11.598092559
+化隆回族自治县 13.2075304714
+绝顶聪明 11.2616203224
+造次 10.0940151622
+军需部 11.9547675029
+五年期 10.5684731418
+优惠卡 13.2075304714
+关兴 9.93038573842
+金岭 11.0674643079
+锐意进取 11.2616203224
+马虎眼 12.5143832909
+吴值 12.1089181827
+集会自由 11.598092559
+马阿林 12.8020653633
+闻过则喜 12.2912397395
+莲社 13.900677652
+结冰期 11.0674643079
+硬骨头六连 12.8020653633
+想家 10.3453295905
+水暖鸭 11.0103058941
+分账 12.2912397395
+神话般 12.2912397395
+戈齐 12.2912397395
+战全胜 12.5143832909
+服务程序 12.5143832909
+奥尼亚 10.9049453784
+日常用品 10.8561552143
+抄过来 13.900677652
+愚弄 9.7898037878
+饶漱石 11.9547675029
+于臣 12.8020653633
+特此 8.81308131674
+克己 11.7034530746
+分赃 10.1871055853
+招招手 10.4041700905
+物质波 12.8020653633
+子广德 13.2075304714
+蚁鼻钱 11.7034530746
+第七把 13.900677652
+丘林 12.2912397395
+哭天抹泪 12.1089181827
+封下去 13.2075304714
+植丛 12.5143832909
+分赴 10.0940151622
+收了 10.642581114
+分起 11.7034530746
+爱猷识 11.8212361103
+中正厅 13.2075304714
+张海迪 13.900677652
+言路 10.8096351986
+尾鳍 8.70218062071
+一万一千 13.2075304714
+转业干部 12.2912397395
+自治制 12.1089181827
+高位厚禄 13.900677652
+乌鲳 12.5143832909
+气派 8.65893063692
+元氏 11.5027823792
+吴正治 13.900677652
+被杀案 13.2075304714
+肉体 8.62767809341
+宫里可 13.900677652
+七片 13.900677652
+蜜桔 13.900677652
+驻波 11.0674643079
+德才兼备 11.0103058941
+丰肌秀骨 13.2075304714
+五六十元 12.8020653633
+腰酸 10.0940151622
+无纪律 11.5027823792
+基阵 11.4157710022
+诗歌创作 9.43476953332
+员工素质 11.9547675029
+安知 10.4041700905
+铆劲儿 13.2075304714
+自缢 9.05649056552
+元气 9.16447920358
+梁惠王 12.2912397395
+边立 11.8212361103
+十多本 13.2075304714
+徐承栋 13.2075304714
+想尽 10.0940151622
+张鼐兄弟 12.5143832909
+长袖衫 13.2075304714
+自编 9.93038573842
+树正沟 12.5143832909
+各次 10.2630914922
+各款 11.1926274509
+消费行为 10.4349417492
+动量 9.04086524761
+柬埔寨人 13.2075304714
+混帐 9.63799777493
+唯象理论 11.8212361103
+独出 12.5143832909
+应天星 12.8020653633
+倒胃 13.2075304714
+斯普马 13.2075304714
+蛋制品 12.8020653633
+飞天奖 12.2912397395
+传染源 10.533381822
+杜伊斯 13.900677652
+断掉 10.642581114
+罗常培 11.7034530746
+赤壁赋 11.7034530746
+吴城 11.0103058941
+美猴王 10.1871055853
+元江 9.96885201925
+金学 13.900677652
+移民区 11.1926274509
+洗澡水 11.598092559
+全面进步 11.0674643079
+踊跃 8.53470163695
+金子 8.84443184663
+亚麻酸 11.8212361103
+金字 9.82314020807
+陈世美 11.0674643079
+十多条 13.2075304714
+加拿大籍 12.8020653633
+可修理 13.900677652
+拉马克 10.8561552143
+廊庙 12.2912397395
+胡杨林 10.8096351986
+百年不遇 10.1394775363
+铐上 12.8020653633
+七爷 10.7226238216
+脑萎缩 12.1089181827
+蜜桃 10.3453295905
+盲目行动 13.2075304714
+化开 11.3357282945
+世界秩序 12.1089181827
+阿鲁巴 11.8212361103
+金家 9.66657114738
+尕海 12.5143832909
+正当要求 12.5143832909
+名人效应 11.3357282945
+戏剧学院 10.533381822
+岸防 10.9562386728
+十多枚 13.2075304714
+金客 11.7034530746
+壮怀激烈 11.598092559
+幽微 11.5027823792
+邓忠引 13.2075304714
+安插亲信 12.5143832909
+内部事务 10.8561552143
+都译成 13.900677652
+西来 9.48183704418
+程大位 11.8212361103
+金定 9.74179456862
+金宝 10.4349417492
+斯诺克 11.0103058941
+刘大姐 10.7226238216
+唐圣僧 11.5027823792
+独具 9.37888907493
+第七日 12.5143832909
+野丫头 13.900677652
+二纸 13.900677652
+金宇 10.9049453784
+金安 12.5143832909
+水荡子 12.2912397395
+锁死 11.5027823792
+各段 10.2117981979
+压群芳 12.5143832909
+以小见大 13.900677652
+住宅区 9.05649056552
+断指 10.533381822
+天竺葵 12.8020653633
+亚西尔 13.2075304714
+空中走廊 12.2912397395
+锦绣大地 13.900677652
+美人豹 13.900677652
+史班超 12.8020653633
+桨叶 10.9562386728
+名木 12.2912397395
+田承嗣 13.2075304714
+汝尚 12.5143832909
+诏安县 12.2912397395
+王贺锦 13.2075304714
+清水池 13.2075304714
+可听 11.1280889297
+李二哥 11.9547675029
+风色 10.9562386728
+金寨 11.8212361103
+日内瓦湖 11.3357282945
+涂棋 13.900677652
+外事组 12.8020653633
+口头上 9.94943393339
+各就各位 10.9049453784
+管理程序 11.0674643079
+孟获 9.72629038208
+宝成线 13.2075304714
+裴斯泰 11.4157710022
+立柱式 12.5143832909
+工艺性能 12.1089181827
+女儿节 13.2075304714
+金寇 10.533381822
+熊老爷 13.2075304714
+邪妄 13.900677652
+吴坤 8.13548654919
+天极网 13.900677652
+金富 9.54396882529
+名望 9.35738286971
+弓子 11.4157710022
+楚图南 12.1089181827
+贾秀全 13.900677652
+汝川 12.8020653633
+许予明 10.0088573539
+汝州 9.87532596124
+七八千两 13.2075304714
+必有勇夫 11.9547675029
+武威市 11.7034530746
+普里梅 13.900677652
+名曰 9.16447920358
+名曲 11.3357282945
+柯伊城 13.2075304714
+白热化 9.44633035572
+三叉骨 13.900677652
+鱼子酱 11.5027823792
+和沁河 12.5143832909
+皖赣 11.2616203224
+金娘 10.642581114
+霍纳法 13.900677652
+七八千万 12.8020653633
+冈德 13.900677652
+分设 9.04864738806
+金威 13.900677652
+是是非非 11.598092559
+酒精灯 10.7226238216
+汽球 12.8020653633
+鸡骨 12.2912397395
+空气污染 10.2897597393
+王礼 11.8212361103
+登船 10.765183436
+不寐 10.6818018271
+撼天动地 12.8020653633
+肉丝 10.4994802703
+元济 12.2912397395
+恶梦 10.1630080337
+说不上 9.02548032877
+幽幽 9.4233408375
+达拉斯小牛队 13.900677652
+哈尔克岛 12.8020653633
+酸枣仁 10.765183436
+虎入羊群 12.8020653633
+肉丁 11.9547675029
+必备条件 11.7034530746
+断折 12.8020653633
+上下肢 12.1089181827
+李彦升 13.2075304714
+肉丸 11.7034530746
+吴国 8.76487921493
+四处奔波 11.4157710022
+光学材料 12.1089181827
+金婚 12.1089181827
+兜抄 13.900677652
+混录 13.2075304714
+读写器 13.2075304714
+欣然接受 11.5027823792
+两边讨好 13.900677652
+杨福同 13.2075304714
+伊肯斯 13.2075304714
+无一不备 13.2075304714
+平新乔 13.2075304714
+异亮氨酸 12.5143832909
+连明彻夜 13.900677652
+断手 11.8212361103
+邯钢 13.900677652
+尾骨 11.4157710022
+梅林变换 13.900677652
+暴珍天 12.2912397395
+自约 13.2075304714
+刘肥 13.900677652
+自纠 13.2075304714
+全权代表 9.69598503258
+鲍翅 13.2075304714
+从北向南 10.4041700905
+说了又说 12.2912397395
+即期支票 13.900677652
+过氧化氢 9.96885201925
+上下联 13.2075304714
+敏捷性 12.8020653633
+窗户纸 10.4349417492
+肉价 11.0103058941
+混得 9.94943393339
+库纳 11.598092559
+向太空 12.2912397395
+伊茨 13.900677652
+和爱光 11.598092559
+言论 7.74581955796
+绸子 10.5684731418
+保温车 13.900677652
+下拉框 13.900677652
+贵州省黔南布依族苗族自治州 12.5143832909
+总括起来 13.2075304714
+蒜辫 13.900677652
+小林多喜 12.5143832909
+归一化 13.900677652
+加少保 11.7034530746
+能言善辩 11.1926274509
+言词 9.75754292558
+指导意义 9.96885201925
+金嫣 8.78868986362
+张雁 12.8020653633
+扩军计划 13.900677652
+文体部 13.900677652
+扁桃腺炎 12.2912397395
+马达加斯加共和国 13.2075304714
+望本营 13.2075304714
+自绝 10.8096351986
+折节向学 13.900677652
+自给 8.75901409547
+阿达马 11.7034530746
+孟芳 12.5143832909
+法尔斯 11.5027823792
+言语 7.15897695732
+矿山企业 11.4157710022
+周士朴 11.9547675029
+不适感 10.8096351986
+圣达菲 12.2912397395
+言说 9.72629038208
+高蛋白 9.77354326693
+自组 11.9547675029
+气浪 10.8096351986
+名星 12.5143832909
+教父 9.66657114738
+攘土 13.900677652
+恒生指数 8.5488195185
+整齐 7.58170953823
+朱大娘 10.4994802703
+名旦 10.8096351986
+较量 8.39534611604
+较重 8.47572763449
+敛聚 13.2075304714
+冉鹗 12.5143832909
+犍为县 12.5143832909
+右眉 13.900677652
+普罗维登斯 12.1089181827
+泽镇开 13.2075304714
+赎买 10.9562386728
+定期集市 11.7034530746
+达斯坦 13.900677652
+碰掉 11.8212361103
+打印机 9.98865464655
+小叔之 13.2075304714
+右眼 10.0088573539
+黎将军 12.5143832909
+金多 13.2075304714
+寻改吏 12.8020653633
+张清回 13.2075304714
+恶毒 9.36807815882
+开幕式 9.31571017331
+此呼彼应 13.900677652
+第七条 10.5684731418
+工艺美术 9.15574552361
+稍远 10.0720362555
+武梁祠 12.2912397395
+金复 12.2912397395
+通行费 11.4157710022
+天然堤 11.598092559
+识记 11.598092559
+爬楼梯 11.8212361103
+本国语 12.5143832909
+搞点 10.642581114
+第七期 13.900677652
+总长 7.78921031247
+言行 8.97342396682
+脖颈子 13.900677652
+居士林 12.8020653633
+分裂 6.9431802811
+雪松林 12.5143832909
+分装 10.4994802703
+辽宁省委 12.2912397395
+维琴察 12.8020653633
+名方 11.8212361103
+鹦鹉热 12.5143832909
+李麦指 13.2075304714
+山梨酸钾 11.9547675029
+混居 11.5027823792
+司玉 13.900677652
+金奖 10.0294766411
+朵朵 10.5684731418
+言表 11.8212361103
+尸横遍野 10.8561552143
+烈性酒 11.3357282945
+司玄 13.900677652
+大顺兵 11.8212361103
+轰动效应 11.7034530746
+尽心竭力 11.1280889297
+进纸 13.900677652
+飘落在 11.7034530746
+总工程师 8.60236028543
+金奉 13.2075304714
+冈峦 13.900677652
+转动角 13.900677652
+驿使 13.2075304714
+主站 13.900677652
+万多株 12.8020653633
+紧迫感 10.2371160058
+冯自由 13.2075304714
+辨色 11.5027823792
+阿鲁忽 11.9547675029
+美利纸业 10.2897597393
+进线 12.8020653633
+名数 13.2075304714
+连闯王 12.8020653633
+射进来 11.7034530746
+宫里养 13.2075304714
+王冬梅 12.5143832909
+风疹病毒 12.2912397395
+队礼 13.900677652
+孔广森 12.2912397395
+独占 9.11318590919
+服装鞋帽 11.5027823792
+和芳亮 12.5143832909
+纳锦 12.2912397395
+弹钢琴 11.2616203224
+呕吐 7.82533162089
+动感情 10.8561552143
+春宫画 11.2616203224
+谢金 12.5143832909
+北新桥 13.2075304714
+市贾 13.900677652
+纯文学 11.9547675029
+名教 9.84023464143
+齐声高唱 13.900677652
+法尔曼 12.2912397395
+同理 10.0940151622
+亲合力 13.2075304714
+侯王 12.8020653633
+利帕里 13.2075304714
+侯玉 13.900677652
+晋官加 13.2075304714
+书用 13.900677652
+送还给 11.4157710022
+清水湾 12.5143832909
+老臣议 13.900677652
+赎人 11.3357282945
+缴出来 13.900677652
+风雨如磐 12.2912397395
+金姨 11.598092559
+阿米巴病 12.2912397395
+分行 7.79811905736
+汝师 13.2075304714
+二氧化锆 12.5143832909
+遏止住 13.2075304714
+电子计算机 8.13235665618
+宽缓 11.4157710022
+二氧化锰 10.7226238216
+冈山 11.4157710022
+青春年华 11.2616203224
+一个几百万 12.2912397395
+锐敏 11.598092559
+七点 10.1871055853
+通信地址 12.2912397395
+混凝土 7.99804431857
+金融机关 12.5143832909
+分表 11.8212361103
+金始 11.5027823792
+淮阴市 10.604840786
+步伐 6.92432958153
+有机化工 10.5684731418
+但玉亭 12.8020653633
+将成 9.91169360541
+项俊波 12.5143832909
+丛林 8.35941410682
+宽绰 11.1926274509
+市貌 13.2075304714
+重庆晚报 10.4349417492
+源点 12.8020653633
+伪称 11.9547675029
+敬上 11.7034530746
+丛枝 13.900677652
+脱氧肌苷 13.900677652
+金堤 11.9547675029
+卡斯蒂斯 13.2075304714
+想开 10.0294766411
+二氧化铅 13.2075304714
+记不住 10.3743171274
+辑录 9.34680076038
+李茂贞 11.1926274509
+误用 11.1926274509
+黑典型 13.900677652
+李麦才 12.8020653633
+煞星 11.4157710022
+克复 10.4041700905
+各校 10.765183436
+燕派栗 12.5143832909
+金堂 10.9049453784
+性障碍 12.5143832909
+断想 13.2075304714
+范德华 12.2912397395
+摇摇曳曳 12.8020653633
+各样 10.0088573539
+二三百 10.1394775363
+首汽 13.900677652
+宽纵 11.7034530746
+二氧化钛 11.1926274509
+探秘 11.7034530746
+公关活动 13.2075304714
+羟乙 12.5143832909
+想当 10.0940151622
+嫣红 11.0103058941
+图书馆长 13.900677652
+腰腹部 11.9547675029
+宽约 8.34771806705
+西开渠 12.5143832909
+祭酒 9.75754292558
+侍子如 13.2075304714
+独力 10.8561552143
+幼儿教育 11.0674643079
+毛巾被 12.1089181827
+赛春社 13.900677652
+坠儿 10.9562386728
+金塔 11.1926274509
+本论 11.1280889297
+遵化县 11.4157710022
+伍德沃 11.1926274509
+分解 7.16015829237
+商博良 12.1089181827
+分解代谢 11.3357282945
+加布里 13.900677652
+歧口 12.5143832909
+侯爵 9.89334446674
+吴哥 10.4041700905
+伤寒病 11.2616203224
+间皮细胞 13.900677652
+顶账 12.5143832909
+上驷 13.900677652
+吴君 12.2912397395
+汝当 10.9562386728
+三局两胜 12.5143832909
+股票走势 9.69598503258
+哈拉智 12.8020653633
+瓦窑堡 11.598092559
+想得 8.71889410168
+司牧 12.1089181827
+愚孝 12.1089181827
+居城 13.900677652
+冈崎 13.900677652
+进货价 12.2912397395
+追昔抚今 13.900677652
+牙周萎缩 13.900677652
+缓冲作用 11.0674643079
+器度 13.900677652
+滑动式 12.8020653633
+娄烦县 13.900677652
+麻将馆 13.900677652
+上马 7.2872934336
+逸闻轶事 13.900677652
+赵庆 10.4041700905
+通俗文学 11.0674643079
+遥测 9.85762638414
+天兴洲 13.2075304714
+教学方法 10.2897597393
+拖进来 12.5143832909
+哥嫂 10.765183436
+赛德鲁 13.2075304714
+金境 12.1089181827
+刘仁恭 11.8212361103
+金墉 13.2075304714
+七十二行 11.0103058941
+战略防御 9.87532596124
+迷悟 13.900677652
+须运铜 13.2075304714
+幅照片 12.1089181827
+紧迫性 9.66657114738
+屁屁 13.900677652
+金声 10.5684731418
+易燃物 12.2912397395
+金壶 12.5143832909
+气候学 10.2897597393
+唐装 11.8212361103
+居首功 13.900677652
+吉伟征 13.2075304714
+亚盖洛 12.2912397395
+传播方式 10.765183436
+凤翔县 12.1089181827
+四十六起 13.2075304714
+有时候 7.35389224122
+想必 7.69007757495
+职业培训 10.2371160058
+纪念馆 8.71329184614
+韩三平 11.8212361103
+行政监督 11.5027823792
+令人兴奋 11.2616203224
+想念 8.9102450652
+想快 12.8020653633
+甲片 10.8561552143
+多见广识 13.900677652
+独到 9.26594866375
+武陟至 12.5143832909
+金地 8.47572763449
+死要面子 11.8212361103
+各服 12.1089181827
+各月 9.89334446674
+各有 6.98893035172
+吴宗 11.598092559
+官俸料 13.2075304714
+吴宓 12.1089181827
+伏案疾书 13.2075304714
+金圣 12.1089181827
+棒子面 13.2075304714
+敬酒 9.24671730182
+吕温侯 13.2075304714
+混到 10.0940151622
+司汤达 11.9547675029
+鲍特 12.2912397395
+北京舞蹈学院 12.8020653633
+吴宁 13.900677652
+神头岭 13.2075304714
+陈普文 13.2075304714
+麟游 11.9547675029
+吴家 10.1394775363
+十多次 11.7034530746
+史体 13.2075304714
+孟轲 11.2616203224
+顺利开展 11.7034530746
+低消耗 11.5027823792
+吴宪 13.2075304714
+吴宫 13.2075304714
+光风霁月 13.2075304714
+先发制人 9.94943393339
+吴客 13.2075304714
+锤打 12.1089181827
+普里斯 12.8020653633
+占有率 9.87532596124
+盛文郁 12.5143832909
+重大项目 9.71102290995
+还珠 13.2075304714
+哈卡斯 12.8020653633
+超小型 12.1089181827
+煞是 13.900677652
+器具 8.48903160012
+第几条 13.900677652
+反侵略 10.0940151622
+林忆莲 12.8020653633
+黄经差 13.900677652
+妇科疾病 10.6818018271
+爱德华兹 11.0674643079
+处理品 13.900677652
+熬炼 11.598092559
+各村 9.5186510173
+出厂价格 8.42421410004
+周原甲 12.8020653633
+阳池 13.900677652
+金块 10.9049453784
+赵崇祚 12.2912397395
+各来 12.8020653633
+一贯作业 13.2075304714
+宗教地理 13.2075304714
+各条 9.71102290995
+玩火者 13.2075304714
+恶斗 10.4666904475
+布里斯托尔 10.9562386728
+慷慨淋漓 13.900677652
+八格 12.5143832909
+边缘型 13.2075304714
+茹尔 12.5143832909
+颇久 13.900677652
+孟连 12.5143832909
+乱哄哄 9.37888907493
+甘井子区 12.5143832909
+分蘖 10.533381822
+交白卷 12.8020653633
+比得上 9.66657114738
+敬重 9.00283785202
+非商业 10.8561552143
+七绝 10.0505300503
+岸站 13.900677652
+收住 9.53122979951
+彭茜卢 13.900677652
+唐永徽 11.8212361103
+螺距 11.8212361103
+钻采 11.2616203224
+山堂集 12.8020653633
+短短几天 10.642581114
+各架 13.900677652
+富裕中农 11.8212361103
+超逸 11.7034530746
+神秘电话 13.900677652
+普赖尔 13.2075304714
+名次 9.72629038208
+巧言令色 12.1089181827
+爱迪 13.2075304714
+马佐维 13.900677652
+磅重 12.2912397395
+女院长 13.2075304714
+功率较 11.8212361103
+泡沫经济 10.5684731418
+阿卡斯 13.2075304714
+不中意 11.598092559
+想像 8.46695564842
+女儿身 11.7034530746
+名款 13.900677652
+班塞尔 13.2075304714
+斯普雷 13.900677652
+恶政 13.2075304714
+右移 11.9547675029
+红斑狼疮 10.4041700905
+容姿绝 13.2075304714
+和维尔 12.5143832909
+首推 9.72629038208
+爱眼日 13.2075304714
+七级 11.4157710022
+战大胜 12.8020653633
+入室弟子 12.8020653633
+姚从吾 11.1926274509
+自珍 13.2075304714
+冰峰雪岭 13.900677652
+功率达 12.1089181827
+七线 13.900677652
+实弹射击 11.598092559
+挂牌价 9.63799777493
+典藏版 13.900677652
+金城 9.07236391467
+习水县 13.900677652
+平躺在 10.9562386728
+连中三元 12.5143832909
+密锣紧鼓 13.900677652
+贫僧 8.87679713113
+排子车 13.2075304714
+自爱 10.4666904475
+崔令钦 13.2075304714
+丘浚 12.2912397395
+吴侯之 12.5143832909
+商品价格 7.28998160726
+尤尼瓦 13.2075304714
+几十根 12.2912397395
+万多架 13.2075304714
+李牟 13.900677652
+斯须之报 13.900677652
+抄来 11.2616203224
+酒精类 11.9547675029
+伊达 12.5143832909
+上祥云 13.900677652
+毛利族 13.900677652
+混匀 11.1280889297
+法学院 9.40086798165
+踏上去 11.598092559
+拉马尔 13.900677652
+冰架 12.5143832909
+鹳雀楼 12.5143832909
+市花 10.642581114
+子子孙孙 10.9049453784
+首批 6.6614626782
+自爆 11.598092559
+仍去 11.9547675029
+心情阴郁 13.2075304714
+说辞 10.3171587135
+喊得 10.8096351986
+敬送 13.2075304714
+仁寿县 13.2075304714
+相之臣 13.2075304714
+遥控 8.84443184663
+波隆纳 13.900677652
+想光 13.2075304714
+会议展览 13.900677652
+拉扎列夫 12.2912397395
+首战 11.2616203224
+金器 11.3357282945
+观测 7.11735245137
+独岛 12.1089181827
+讨论会 9.84023464143
+行宪国民 12.8020653633
+朱宸濠 11.8212361103
+贵显 13.900677652
+程蝶衣 13.900677652
+通通风 13.2075304714
+哀哀父母 12.8020653633
+欢送会 12.5143832909
+猫扑 11.5027823792
+辙迹 12.5143832909
+黄侃 12.5143832909
+唐登科 13.2075304714
+之而后快 12.1089181827
+斯库台 11.7034530746
+郝大勇 13.2075304714
+依据事实 13.900677652
+七零八落 10.3171587135
+想入 13.900677652
+空手而归 11.1926274509
+香港回归 12.5143832909
+独居 10.0940151622
+两三场 13.2075304714
+奔死 13.900677652
+哥哥 6.35846418878
+石破 13.2075304714
+生身父亲 11.4157710022
+蓄洪区 12.5143832909
+圣埃蒂安队 13.900677652
+汝兄 11.9547675029
+理事会 8.1641053545
+心花放 13.900677652
+接头处 12.1089181827
+万语千言 12.8020653633
+得闲儿 11.4157710022
+液压式 11.0103058941
+吴娃 13.900677652
+丛植 11.9547675029
+二次葬 12.8020653633
+楼林立 13.900677652
+温中散 11.2616203224
+敛迹 11.598092559
+青春年少 11.1926274509
+不置褒贬 13.900677652
+香火不绝 12.2912397395
+尾随 9.35738286971
+朱拜勒 13.2075304714
+庄来 12.8020653633
+多核糖体 13.900677652
+名模 11.3357282945
+七美 11.9547675029
+布切斯 11.9547675029
+怎有 12.1089181827
+掠入射 13.900677652
+船旗国 11.8212361103
+戴敦邦 13.900677652
+独尊 10.1871055853
+开小差 10.1630080337
+万多条 11.4157710022
+缝缝补补 11.4157710022
+占有物 13.2075304714
+测系统 12.8020653633
+海内存知己 12.1089181827
+天下太平 9.85762638414
+万万不可 9.89334446674
+驰誉 11.7034530746
+氧化酶 10.9562386728
+想出 8.85725253506
+边看 12.8020653633
+赵可铭 13.900677652
+臣服 9.74179456862
+未为不可 11.8212361103
+吴婷 13.2075304714
+遥指 10.604840786
+混双 12.1089181827
+特写镜头 11.9547675029
+戌狗 12.8020653633
+二十员 12.2912397395
+宝洁公司 13.900677652
+正经事 10.0294766411
+脚高步低 13.2075304714
+物流网 13.2075304714
+恶搞 10.9562386728
+稷山县 12.8020653633
+刑柱 13.2075304714
+荣誉称号 9.55687223012
+称善 11.4157710022
+交际费 13.2075304714
+自然 5.05749555395
+误码 12.8020653633
+白蒙蒙 11.8212361103
+免疫吸附 12.8020653633
+结婚年龄 11.8212361103
+利卡 11.9547675029
+元成 12.5143832909
+遥想 11.1926274509
+呆住 9.14708746087
+陈式引 13.2075304714
+涪江 10.2371160058
+自焚 9.15574552361
+红儿你 13.2075304714
+卜京师 12.8020653633
+沙维尔 12.8020653633
+想到 5.608129138
+诓骗 10.8561552143
+汽笛 10.0720362555
+七类 12.8020653633
+存取时间 12.8020653633
+七米 13.2075304714
+黄老学派 12.8020653633
+左上 11.5027823792
+踽踽而行 12.8020653633
+费希纳 11.8212361103
+黄沙铺 11.8212361103
+新井白石 13.2075304714
+官藕官 13.2075304714
+吴姓 11.8212361103
+吴姐 11.7034530746
+脊髓 9.01787572939
+批出去 13.900677652
+独得 11.2616203224
+气候图 12.8020653633
+李十娘 9.31571017331
+真武大帝 11.7034530746
+各救 13.900677652
+鸦片鬼 12.5143832909
+恶极 13.900677652
+自认是 11.1926274509
+处处长 9.07236391467
+小湾 11.9547675029
+第七款 12.2912397395
+程序接口 13.900677652
+第六十四 13.2075304714
+由宝钛 12.8020653633
+第六十回 12.2912397395
+大计小用 13.900677652
+储备棉 11.7034530746
+贸发 11.1280889297
+恶果 9.65218240993
+各数 13.900677652
+订机票 13.900677652
+鞋面 10.9562386728
+孔型 13.2075304714
+断流 9.82314020807
+国民所得 13.900677652
+阿鲁台 12.8020653633
+初记 13.900677652
+暂领 13.900677652
+弓弦乐器 11.598092559
+眼耳鼻 12.5143832909
+鲁僖公 12.2912397395
+土地法 10.8561552143
+贵族 6.30579326476
+梁为仆 13.2075304714
+司署 13.2075304714
+林竹 13.2075304714
+上下车 11.0103058941
+矢口否认 10.4994802703
+酸酸甜甜 12.5143832909
+系统误差 12.2912397395
+智社 13.2075304714
+左云 11.9547675029
+限量供应 13.2075304714
+为官者 10.8561552143
+山道人 8.85725253506
+千山风景区 13.2075304714
+含恨而终 13.900677652
+五十五万两 13.2075304714
+刘豫军 13.900677652
+走捷径 11.9547675029
+各施 13.2075304714
+分营 12.2912397395
+各方 7.166085992
+叶阔 12.2912397395
+各族 8.25170341381
+尾闾 9.72629038208
+服务半径 12.5143832909
+事隔 10.2897597393
+全液压 13.900677652
+说谎 9.62401153296
+教学内容 10.765183436
+必先予之 13.2075304714
+七粒 12.8020653633
+游泳圈 13.2075304714
+穷则思变 12.8020653633
+忽冷忽热 11.0674643079
+调解员 11.598092559
+九九归一 13.2075304714
+分葱 13.900677652
+紧紧张张 12.5143832909
+第十二个 11.3357282945
+游泳场 11.8212361103
+尤瑟纳 13.2075304714
+传导性 11.598092559
+李二嫂 11.9547675029
+处理器 9.69598503258
+不嫌 10.2117981979
+传染性 9.33632946051
+不知轻重 12.2912397395
+自燃 10.2897597393
+辑印 12.8020653633
+市肆 10.9049453784
+玻璃封装 13.900677652
+赫斯希 13.900677652
+每句话 11.7034530746
+隆重庆祝 12.8020653633
+泌乳素 13.900677652
+神木北 12.8020653633
+金吾 10.4994802703
+左传 8.71889410168
+群情激愤 11.0674643079
+宽狭 11.598092559
+分水器 13.900677652
+服务周到 12.2912397395
+吴境 12.1089181827
+移民局 11.8212361103
+合府 11.9547675029
+五六十年 12.5143832909
+腌肉 11.3357282945
+六十四公里 13.2075304714
+况贾母 13.2075304714
+五四时代 12.8020653633
+脑电图 10.0720362555
+罗申科 12.5143832909
+十多根 13.900677652
+各携 12.8020653633
+首恶 11.9547675029
+北梦琐 13.2075304714
+哥本哈根大学 10.642581114
+混入 9.41204128224
+淮阴县 11.2616203224
+迈尔斯 11.9547675029
+汝原 12.8020653633
+王码 12.5143832909
+怀仁堂 11.2616203224
+子校注 13.2075304714
+左佩 13.2075304714
+混养 11.598092559
+水利学 12.5143832909
+混充 12.8020653633
+王南庚 13.2075304714
+中间线 12.8020653633
+水尽鹅飞 13.900677652
+葛根 11.598092559
+边疆 8.51160592216
+打扑克 10.9049453784
+敛财 10.0088573539
+梨园弟子 13.2075304714
+若迟 11.7034530746
+晋悼公 12.5143832909
+鉴定中心 12.2912397395
+癸丑 12.5143832909
+电子云 11.3357282945
+第十二位 12.8020653633
+东北郊 10.642581114
+汝南 9.28555713513
+自点 13.2075304714
+电子书 7.30489713801
+陌上 11.8212361103
+常微分 12.8020653633
+祖乙胜 13.2075304714
+百斤 10.8561552143
+大劫案 13.900677652
+市政道路 11.9547675029
+补偿性 12.5143832909
+奔泉 12.8020653633
+汝千 13.2075304714
+左侧 8.0600359946
+一口同音 13.900677652
+五辆车 11.9547675029
+涎液 13.2075304714
+歌华有线 11.0103058941
+想去 9.34680076038
+河清海晏 12.8020653633
+桑榆晚景 12.5143832909
+边界 7.32142643997
+处理场 13.900677652
+说起 7.23626863163
+司繁 12.2912397395
+此节 11.0103058941
+贺家湾 13.2075304714
+吴堡 11.9547675029
+提插 11.9547675029
+主战场 10.0720362555
+淮阴区 12.5143832909
+名校 10.2117981979
+本台记者 12.8020653633
+祖至孙 12.8020653633
+李二寺 13.2075304714
+卢太监 13.2075304714
+幽僻 11.7034530746
+癸亥 12.8020653633
+妙静 12.5143832909
+断气 9.96885201925
+华表奖 13.900677652
+金哥 13.2075304714
+张辽威 13.2075304714
+五十五万余 12.8020653633
+布卢瓦 12.8020653633
+生命保险 13.900677652
+天资过人 13.900677652
+混出 11.2616203224
+麻又辣 12.5143832909
+甲缩醛 13.900677652
+国立功 12.2912397395
+凄风冷雨 13.900677652
+生米煮成熟饭 12.8020653633
+瘀积 12.2912397395
+宪兵队 10.604840786
+胡玉珍 13.2075304714
+断水 11.598092559
+遥感 9.23723855786
+胡杨树 13.2075304714
+右端 11.4157710022
+临池 12.8020653633
+和薇薇 11.8212361103
+养家糊口 10.9562386728
+十多棵 12.5143832909
+歇后语 11.1926274509
+氧化钨 13.2075304714
+二十七八 11.9547675029
+快讯 9.82314020807
+二化螟 11.4157710022
+氧化钡 12.8020653633
+开会讨论 11.3357282945
+金匾 11.598092559
+一点两点 13.2075304714
+金匠 11.8212361103
+自治州 8.51160592216
+光棍节 13.2075304714
+氧化钾 11.9547675029
+克制 8.48457724977
+想同 10.642581114
+草长莺飞 13.2075304714
+黄疸病 12.5143832909
+柔滑 11.0103058941
+鲍登 12.8020653633
+吴征 12.8020653633
+首条 11.3357282945
+想吸 12.8020653633
+帅哥美女 13.900677652
+金匙 13.2075304714
+吴德 12.8020653633
+黄怀信 13.2075304714
+二千余 10.533381822
+望子成才 13.900677652
+氧化钛 13.2075304714
+氧化钙 11.1280889297
+秀屿 12.5143832909
+船舶工业 11.3357282945
+北镇抚 10.2897597393
+化学作用 10.0720362555
+自省 10.9049453784
+品牌战略 10.642581114
+中国民歌 11.1926274509
+金印 9.85762638414
+冻干粉 13.900677652
+氧化铬 11.7034530746
+麦基诺 12.5143832909
+首月 11.8212361103
+少泽 13.2075304714
+首服 12.5143832909
+宫里宫 11.9547675029
+金卡 10.9049453784
+脊鳍 13.900677652
+哥儿 9.33632946051
+洋洋万言 13.2075304714
+十万火急 9.66657114738
+弃之如敝 12.5143832909
+陆法言 12.8020653633
+玄而又玄 11.9547675029
+金卫 11.5027823792
+去一趟 9.10488710638
+氧化银 11.2616203224
+首期 9.27570483869
+石钟乳 11.1926274509
+兰哥儿 11.5027823792
+须力 13.900677652
+衡平法 11.598092559
+庸才 10.6818018271
+绘制 8.24818847171
+氧化铀 13.2075304714
+氧化铁 10.9049453784
+从楚卿 12.8020653633
+氧化铅 12.1089181827
+新闻照片 12.8020653633
+宗永庆 13.2075304714
+氧化铜 11.598092559
+氧化铝 9.28555713513
+粗脂肪 12.2912397395
+吴忠 10.6818018271
+金华 8.62256299275
+釉料 11.1280889297
+充满生机 10.8561552143
+商务代表 12.2912397395
+司祭 11.9547675029
+孟诗 12.8020653633
+独奏 9.48183704418
+生毛毛 13.2075304714
+鹿骨 11.598092559
+金县 11.3357282945
+机械加工 10.1394775363
+克劳 11.8212361103
+七站 12.8020653633
+妙通 13.900677652
+地应力 11.5027823792
+昨天中午 10.8096351986
+无功而退 12.8020653633
+华山医院 12.2912397395
+万多户 11.8212361103
+宋辽二 13.2075304714
+各排 13.2075304714
+高世千 13.900677652
+天寒地冻 10.4349417492
+隆裕 13.900677652
+睢县 11.2616203224
+吴强 12.5143832909
+骈体文 11.3357282945
+七章 11.5027823792
+宽畅 11.9547675029
+硫含量 12.2912397395
+金龙泉 13.2075304714
+独女 11.8212361103
+伊力诺 12.8020653633
+响遏行云 12.5143832909
+下不为例 10.9562386728
+金台 10.4994802703
+独处 10.0940151622
+金史 10.3743171274
+差派 13.2075304714
+七窍 10.604840786
+克勤 12.5143832909
+吴录 12.8020653633
+补偿板 13.900677652
+宽甸 11.5027823792
+金口 10.8561552143
+陕西省委 13.2075304714
+司礼 11.4157710022
+黑白花 11.9547675029
+自知 9.04086524761
+首枚 12.1089181827
+贺鲁渐 13.2075304714
+化工 6.37990123691
+自矜 11.3357282945
+独大 10.4041700905
+分色 11.7034530746
+赵彦 12.5143832909
+磁倾角 11.8212361103
+黄粉虫 13.900677652
+元擢 13.900677652
+蓝布尔 12.5143832909
+独夫 12.8020653633
+黄岩市 12.1089181827
+恶意 8.50705010562
+故障诊断 11.4157710022
+克勒 10.604840786
+吴彬 13.2075304714
+七拐八拐 12.2912397395
+首架 10.2117981979
+出资者 12.8020653633
+四合院 9.04864738806
+卸妆液 13.900677652
+大屠杀 9.6811699468
+国际货物 10.8561552143
+恶感 11.5027823792
+闻得宝玉 12.8020653633
+吴府 12.1089181827
+说话 5.26534593254
+名满 11.8212361103
+有孔虫 10.604840786
+胡夫人 13.900677652
+航运 7.30080715276
+吴应 8.62767809341
+亲妈 10.604840786
+混在 9.29550746599
+审判程序 11.0103058941
+较高 6.51420680315
+长江后浪 13.900677652
+金利 10.4666904475
+重审 11.8212361103
+连猫蛋 13.2075304714
+贵所 13.900677652
+加氢裂化 11.9547675029
+湛山 11.9547675029
+铝土矿 9.71102290995
+正东方 12.5143832909
+分获 11.1926274509
+金创 11.1926274509
+金刚 8.20694551317
+金刃 12.5143832909
+锦绣前程 12.1089181827
+二三米 12.5143832909
+算不清 11.9547675029
+各户 10.642581114
+各戴 13.2075304714
+掉换 13.2075304714
+万多千米 10.7226238216
+唐宋词 12.5143832909
+边玩 13.900677652
+自白 10.9562386728
+贵戚 9.82314020807
+宗永徽 12.8020653633
+泾水 11.3357282945
+各所 12.8020653633
+二千两 10.8561552143
+高呼口号 11.9547675029
+和永宁 12.1089181827
+语惊四座 12.8020653633
+提掖 13.900677652
+被雷击 12.5143832909
+各打 11.0103058941
+首映 10.9049453784
+吴廷 13.900677652
+二元关系 13.2075304714
+工艺美术品 10.0720362555
+二千万 12.2912397395
+宜居 10.5684731418
+克南 13.2075304714
+非贸易 10.5684731418
+各批 11.9547675029
+李昌言 12.8020653633
+忍者龟 13.900677652
+李贤注 12.5143832909
+吴帝 12.1089181827
+两百个 12.5143832909
+魂飞魄丧 12.5143832909
+愚兄 10.7226238216
+英纳格玛 12.2912397395
+七篇 11.4157710022
+女流氓 13.900677652
+心花怒放 10.3171587135
+行仪礼 13.900677652
+吴师 12.2912397395
+栽诬 12.2912397395
+洗澡时 10.6818018271
+氧化锰 12.5143832909
+吴帅 12.8020653633
+各抒 12.2912397395
+保量 13.900677652
+莫逆 11.3357282945
+愚公 11.8212361103
+于辉 13.900677652
+锁扣 11.5027823792
+占位性 11.598092559
+有进无退 11.1280889297
+两千两 10.604840786
+氧化锌 10.8561552143
+李彦宏 12.2912397395
+各报 11.8212361103
+氧化锆 11.8212361103
+大回环 11.9547675029
+上下行 12.5143832909
+首曲 13.2075304714
+宋阵里 11.8212361103
+中兴路 12.5143832909
+有头有尾 11.9547675029
+小意思 11.0103058941
+氧化锗 13.2075304714
+肝胆胰 13.900677652
+结售汇 11.1926274509
+废话少说 12.5143832909
+自相 10.0720362555
+传染期 13.900677652
+恶性 8.64840422393
+茅盈 13.2075304714
+泾河 9.89334446674
+二千人 11.9547675029
+乔科尔 13.2075304714
+非国大 11.5027823792
+坦缓 13.2075304714
+金军侵 13.2075304714
+朱高煦 12.2912397395
+多愁多病 13.2075304714
+网络警察 13.900677652
+天井关 12.2912397395
+中阳县 12.8020653633
+吴广 9.71102290995
+氧化镉 12.8020653633
+黄埔港 11.3357282945
+寸心 11.5027823792
+各拨 12.2912397395
+远征军 9.17328983326
+桂永清 12.5143832909
+氧化镁 10.4994802703
+知子莫若父 13.900677652
+吴平 12.5143832909
+元日 12.5143832909
+幽囚 12.1089181827
+卸妆油 9.53122979951
+老妈子 10.2630914922
+摩登女郎 13.900677652
+投靠 8.76487921493
+军事手段 11.4157710022
+遥望 8.89004235788
+贵报 12.8020653633
+美人蕉 11.1280889297
+审议官 13.900677652
+走马换将 12.2912397395
+元昊 11.2616203224
+元明 9.93038573842
+宁都县 12.2912397395
+言者 11.598092559
+西雅图 10.3171587135
+编制法 13.2075304714
+马母 10.4666904475
+自由 5.90032815665
+于谦 10.2630914922
+电影业 11.4157710022
+自用 9.69598503258
+贵慈 13.900677652
+奔波 8.47572763449
+官小职 13.900677652
+捆扎 10.2371160058
+杨遇 11.1280889297
+廿三日 13.900677652
+物资供应 10.765183436
+自生 9.89334446674
+自甘 11.2616203224
+迈过去 12.2912397395
+伏地挺身 13.900677652
+混名 12.5143832909
+混同 9.91169360541
+元春 11.1280889297
+混合 6.53423250365
+浮选机 13.900677652
+李二帅 13.2075304714
+分肥 11.598092559
+这方面 7.09717239437
+口子酒 11.7034530746
+邹燕 9.06439574502
+慢性肾炎 9.37888907493
+捆成 11.3357282945
+金兰 11.0103058941
+吴川 12.1089181827
+金兵 9.08039608637
+金具 13.900677652
+哈尔斯 12.2912397395
+独守 11.1280889297
+枪柄 13.2075304714
+世袭领地 11.598092559
+天理良心 12.8020653633
+洛克齐 13.900677652
+边炉 13.900677652
+嘴碎 12.5143832909
+自留 12.2912397395
+根雕 11.7034530746
+管足 12.1089181827
+稗子 11.9547675029
+首支 11.598092559
+独家 8.170577869
+金元 8.93783302172
+所发 10.1630080337
+共振荧光 13.900677652
+黄岩岛 11.0674643079
+金光 9.00283785202
+葛洪 10.4041700905
+算命先生 10.7226238216
+所受 8.4980002701
+约阿希姆 12.5143832909
+首旅 11.0674643079
+雷克萨斯 9.25628675283
+加以分析 11.1926274509
+金冠 10.2117981979
+赫斯定 12.2912397395
+人格尊严 11.5027823792
+独子 11.1926274509
+不锈钢材 13.900677652
+撞死人 12.8020653633
+教点 12.2912397395
+独孤 10.4994802703
+所叙 12.2912397395
+名流 9.04864738806
+首日 6.19316545738
+自疚 13.900677652
+认识水平 11.3357282945
+金军 8.16733637508
+普卡普 13.2075304714
+金农 11.4157710022
+淳于云 11.1280889297
+游船 9.80633308975
+小幺儿 11.0103058941
+医学史 11.3357282945
+卢布尔雅那 11.7034530746
+心辣手狠 13.900677652
+汝器 13.900677652
+闲静 12.2912397395
+张遂 11.8212361103
+王汝翼 13.2075304714
+想回 11.5027823792
+染得 10.604840786
+美国纽约州立大学 12.1089181827
+聂斯脱 11.9547675029
+九十多年 13.900677652
+金凤 10.0940151622
+眷爱 11.7034530746
+箝位 12.8020653633
+细致 7.91674137129
+七碗 12.8020653633
+处理剂 12.2912397395
+发言人 7.83922073305
+宣传机构 13.2075304714
+五六十家 12.8020653633
+右翼 8.81927328699
+混响 11.1280889297
+化痰止咳 11.1280889297
+万顿 12.8020653633
+瓷娃娃 12.5143832909
+开罪 10.7226238216
+布卢 11.7034530746
+真知灼见 11.0674643079
+抵足而眠 13.900677652
+防患于未 13.900677652
+密谋策划 12.5143832909
+冒出来 8.73589167805
+元月 10.4994802703
+饮酒量 13.2075304714
+物力维艰 13.2075304714
+敬陈 13.900677652
+帕尔斯 13.900677652
+莺歌燕舞 12.2912397395
+末速度 13.900677652
+元朝 7.58894284282
+千余株 13.2075304714
+汝城 11.8212361103
+元朗 11.5027823792
+物质性 10.604840786
+仿造 9.96885201925
+温成形 13.900677652
+司立 12.1089181827
+煤气炉 12.8020653633
+七票 13.900677652
+功率表 12.5143832909
+元本 12.5143832909
+未收割 13.2075304714
+煤矿工人 10.0940151622
+名泉 12.1089181827
+联邦最高法院 11.4157710022
+后赵 9.84023464143
+涵括 13.900677652
+姚恒斌 13.900677652
+克山病 11.5027823792
+小括号 13.900677652
+自理 10.1630080337
+辨证 8.83808261895
+辨识 9.82314020807
+摊出来 12.8020653633
+阿德莱德 11.7034530746
+非国家 11.4157710022
+闹钟 10.8561552143
+冉霞 12.8020653633
+忘不了 9.18217878068
+记忆合金 11.5027823792
+狼人 12.8020653633
+地面战 13.2075304714
+汪寿华 12.8020653633
+专权 8.73589167805
+尔来 12.5143832909
+克兰 11.1926274509
+过场 11.0103058941
+泾渭 12.8020653633
+量角器 12.5143832909
+提手 11.1926274509
+王龙阳 11.598092559
+腔肠动物 10.4666904475
+短尾病毒 13.900677652
+普拍枋 13.900677652
+辨认 8.60737282725
+陈廉伯 11.598092559
+分至 11.0103058941
+草率地 12.2912397395
+标记符号 12.1089181827
+别无其他 12.8020653633
+奔涌 9.96885201925
+谢押司 13.2075304714
+高尔斯 11.4157710022
+唠唠叨叨 10.765183436
+武陟西 12.8020653633
+情报中心 11.7034530746
+赚钱快 13.900677652
+亲姐姐 10.9562386728
+系统抽样 13.900677652
+七种 10.2897597393
+幽咽 13.2075304714
+天经地义 9.6811699468
+行进路线 12.2912397395
+司空 9.01787572939
+堕马 12.5143832909
+汝均 12.8020653633
+黄埔江 13.900677652
+气候区 10.604840786
+吴将 11.1280889297
+过敏反应 9.75754292558
+银鸥 12.2912397395
+断桥 10.533381822
+吱声 9.29550746599
+瓦朗吉 13.900677652
+断档 10.4994802703
+塔里木河流域 11.4157710022
+官商勾结 11.3357282945
+金腰带 11.1280889297
+于超 13.2075304714
+即时通讯 11.5027823792
+内置式 12.2912397395
+宋制略 13.2075304714
+源码 12.1089181827
+污迹 11.4157710022
+李建英 12.8020653633
+曾士华 13.2075304714
+奔流 9.10488710638
+狡赖 12.2912397395
+煤气灯 11.1280889297
+抗议者 11.9547675029
+桨声 11.5027823792
+羊角辫 12.8020653633
+选登 13.900677652
+自治市 11.2616203224
+邹沅帆 13.2075304714
+尾部 8.1608847398
+睥睨群雄 13.900677652
+柏条河 12.5143832909
+管路 10.3453295905
+盒子 8.53938548627
+反常规 12.1089181827
+鼻烟盒 13.900677652
+煤气灶 11.3357282945
+于山海 13.900677652
+撰写论文 13.900677652
+言臣 13.2075304714
+郁李仁 13.2075304714
+欧洲法院 12.5143832909
+确凿无疑 11.5027823792
+名氏 12.2912397395
+破费 10.2117981979
+收线 12.8020653633
+首播 11.9547675029
+吴山 10.3743171274
+名气 9.05649056552
+栋梁材 13.2075304714
+果子酱 13.900677652
+十八万九千余 13.2075304714
+恶战 9.49395840471
+断根 11.5027823792
+各想 12.1089181827
+金像 11.8212361103
+金融机构 6.81980975528
+各式 9.0884932966
+算旧账 12.8020653633
+劣迹昭著 13.900677652
+双遣 13.900677652
+万多座 11.1280889297
+各异 8.14810501315
+名叫 7.35820569147
+临漳 10.4994802703
+欧风美雨 13.2075304714
+罗伯斯 13.900677652
+新政治国民会议 13.900677652
+妖魔 8.66423568915
+首字 11.598092559
+搴旗斩将 13.900677652
+大伯父 13.2075304714
+天崩地塌 11.8212361103
+亡国之音 13.2075304714
+水利电力 10.765183436
+首季 11.4157710022
+梳齿 12.8020653633
+隘路 12.5143832909
+独无 13.2075304714
+婶母 11.4157710022
+哭丧棒 11.9547675029
+方外圆 13.900677652
+无起色 11.8212361103
+双道 12.8020653633
+任幽州 13.2075304714
+湖羊 10.9562386728
+砚石 11.4157710022
+断垄 13.900677652
+达菲 9.40086798165
+天然港 13.900677652
+名厨 11.1280889297
+蓝皮书 9.07236391467
+正断层 11.5027823792
+游走不定 12.8020653633
+湿热 8.69119149913
+无党派 11.1280889297
+各族群众 12.8020653633
+山东梆子 12.8020653633
+铁笛 12.5143832909
+陶菲格 12.8020653633
+各当 12.1089181827
+自花授粉 11.3357282945
+沃罗格 12.5143832909
+磨过 12.2912397395
+破财 11.8212361103
+独断 10.3171587135
+冯光荣 13.900677652
+覆载 12.2912397395
+数落 9.22784881751
+尤精历 13.2075304714
+骆雨会 13.2075304714
+总指挥部 10.2897597393
+哄诱 13.2075304714
+妖鬼 12.8020653633
+两餐 10.9562386728
+钱肃乐 12.5143832909
+燕都 11.1280889297
+创建活动 12.2912397395
+晒被子 13.900677652
+队会 13.900677652
+术后 9.16447920358
+覆辙 9.48183704418
+刘捷轩 12.1089181827
+首富 9.00283785202
+新发明 10.604840786
+劳伦斯 9.98865464655
+队伍 6.58745726489
+邪淫 11.8212361103
+各得 10.642581114
+伪书 11.2616203224
+张顺魂 13.2075304714
+约翰霍普金斯 13.900677652
+王符 11.9547675029
+反应速度 10.7226238216
+威胁性 11.0103058941
+正经 8.31718134319
+中星微 13.900677652
+政治腐败 10.533381822
+内部联系 11.1926274509
+快又稳 12.2912397395
+布匹 9.43476953332
+名单 7.06227245113
+浮言 11.8212361103
+擀面杖 10.9049453784
+正统 8.35160156708
+诛除 10.7226238216
+英日 11.8212361103
+不免有些 9.54396882529
+票房毒药 12.8020653633
+曲曲折折 10.4041700905
+许可法 13.900677652
+名匠 11.8212361103
+虚荣心 10.4994802703
+贵得 11.2616203224
+心血 8.49350588052
+康西草原 13.900677652
+牟牧希 12.1089181827
+正线 10.8561552143
+孵蛋 11.7034530746
+首宗 11.0674643079
+和永昌 12.5143832909
+传统节日 9.77354326693
+愚民 10.4041700905
+名医 9.36807815882
+成倍增加 10.765183436
+角分布 12.5143832909
+十多只 11.8212361103
+边上 7.96050639926
+郭茂倩 11.9547675029
+木制家具 12.5143832909
+清水塘 13.2075304714
+抗生素 8.37522471284
+铁血政策 12.5143832909
+黄埔区 12.8020653633
+饶风关 12.8020653633
+首家 8.37522471284
+气数已尽 10.5684731418
+十多台 13.900677652
+逃废 12.1089181827
+心衰 10.7226238216
+青岛海洋大学 12.2912397395
+谄媚拍马 13.900677652
+舆论压力 10.765183436
+边修 13.900677652
+青鱼 10.1394775363
+法尔克 13.900677652
+心要 11.1926274509
+鱼美人 11.7034530746
+各市 10.0294766411
+蓟北 13.2075304714
+两顿 10.0940151622
+举办国 12.1089181827
+臻于完善 11.9547675029
+郭贵妃 13.900677652
+两项 8.03420959504
+两顶 11.3357282945
+麦赫 13.900677652
+金港 12.2912397395
+一窍不通 10.3453295905
+吴押 13.900677652
+噗通一声 11.9547675029
+炙手可热 9.89334446674
+检验局 12.2912397395
+丧钟 11.1926274509
+狼烟 11.3357282945
+三百余里 10.533381822
+麦赛 13.900677652
+脉冲响应 13.2075304714
+贵干 12.5143832909
+海港 8.27666014579
+适生区 13.900677652
+脑电波 11.8212361103
+长嫂如母 13.900677652
+吴二人 11.5027823792
+夏尽秋 13.900677652
+塔尔蒂 12.5143832909
+但行好事 13.2075304714
+康素爱 13.2075304714
+锤子 9.7898037878
+蓄养 10.8561552143
+生物群 10.8096351986
+侦破 9.59661255877
+奔去 8.85725253506
+过早地 9.84023464143
+空手而来 12.8020653633
+达英 13.900677652
+核分裂 11.5027823792
+提拿 13.900677652
+蒲黄 12.1089181827
+证道 12.2912397395
+步其后尘 11.5027823792
+复辅音 12.5143832909
+词形变化 11.7034530746
+小寨子 11.9547675029
+米铺 12.1089181827
+抖索 11.3357282945
+城隍 9.80633308975
+得胜回朝 13.2075304714
+金湖 12.1089181827
+邪气 9.36807815882
+经过培训 11.9547675029
+不稳定性 9.74179456862
+戒掉 11.5027823792
+豪华设施 13.900677652
+五百五十万平方米 12.8020653633
+邹云 13.900677652
+隋和唐 12.5143832909
+各年 11.2616203224
+七百余里 11.9547675029
+正编 11.8212361103
+敛声屏气 11.7034530746
+虞城县 11.0674643079
+名剧 10.4349417492
+毛家湾 13.900677652
+山前山后 11.1280889297
+吴成 11.8212361103
+责己 13.900677652
+细枝末节 11.1280889297
+队上 11.9547675029
+饿肚皮 13.2075304714
+冯潇霆 12.8020653633
+伪作 10.9049453784
+金源 11.4157710022
+柳如眉 13.2075304714
+忒楞楞 13.900677652
+缆柱 13.900677652
+邪法 11.0103058941
+食饵 11.1926274509
+双重 7.50708689803
+城际 8.40350942668
+液压机 11.2616203224
+游泳池 10.0720362555
+景宗乾 12.8020653633
+名剑 12.2912397395
+无厘头 11.0674643079
+元始 10.1871055853
+阳关三叠 11.598092559
+百足 11.2616203224
+儒门事亲 13.900677652
+主战派 10.1394775363
+贵庚 11.9547675029
+聚磷酸铵 13.2075304714
+立敬瑭 13.2075304714
+陆逊见 12.8020653633
+通令嘉奖 13.900677652
+名利 9.94943393339
+诉衷情 12.8020653633
+逆运算 12.2912397395
+阿尔卑斯 9.87532596124
+咚咚 8.9308643524
+胶料 11.8212361103
+城防 9.96885201925
+名刹 10.765183436
+厨刀 12.8020653633
+喀嚓一声 11.5027823792
+好几级 13.2075304714
+名分 9.41204128224
+两颊 9.53122979951
+莫谈国 13.2075304714
+边伏 13.2075304714
+奔北 13.900677652
+友协 13.2075304714
+持续一年 11.1280889297
+核生化 10.8096351986
+恶少 11.7034530746
+名列 8.5488195185
+怀卵量 11.8212361103
+各建 12.1089181827
+两题 13.2075304714
+两颗 8.4980002701
+催人泪下 10.8096351986
+劫难 9.69598503258
+崔玄 11.598092559
+城门 7.36543638096
+溧阳 10.8561552143
+代扣代缴 12.5143832909
+张郎 13.2075304714
+堵上 11.0674643079
+纳牙 13.2075304714
+两百三十万镑 13.2075304714
+砂型 13.2075304714
+一口口 10.7226238216
+域名服务 12.5143832909
+王章 11.7034530746
+金津 12.8020653633
+恶念 11.8212361103
+首奖 12.2912397395
+首套 9.44633035572
+多早晚 10.4666904475
+书籍 7.67414098269
+第七卷 10.9562386728
+恶心 7.85094419674
+搞破坏 11.5027823792
+最佳值 13.900677652
+前景色 11.5027823792
+维生素 7.21982297319
+香港特别行政区基本法起草委员会 11.8212361103
+金洞 13.900677652
+华夏民族 11.4157710022
+下降段 13.900677652
+覆败 12.8020653633
+卫木匠 13.2075304714
+寒风 8.73589167805
+运输网 9.37888907493
+肖开特 13.2075304714
+礼炮声 12.1089181827
+旱灾区 13.900677652
+电影版 12.8020653633
+金海 11.0103058941
+沈鸿英 12.1089181827
+反循环 13.900677652
+达致 13.2075304714
+电影片 12.5143832909
+金圣皇后 13.900677652
+天然水 11.0103058941
+阎肃 13.900677652
+电器设备 10.8096351986
+威尔士语 12.5143832909
+劳合社 13.2075304714
+金浦 13.2075304714
+断喝 10.4994802703
+达基亚 11.8212361103
+首夜 13.900677652
+冗余 11.9547675029
+吴懿 10.9562386728
+父执 11.9547675029
+阴阳怪气 10.4994802703
+名册 10.0088573539
+利之品 13.2075304714
+一九六四年 11.7034530746
+歇歇脚 11.8212361103
+天然气 6.70624080088
+恶徒 13.2075304714
+袁本初 11.7034530746
+突然 4.99713421631
+主辱臣死 12.8020653633
+首夺 13.900677652
+两鬓 10.0720362555
+元婴 13.900677652
+马林诺 12.2912397395
+糊糊 10.2117981979
+贵州 6.83591862418
+古大秦 13.2075304714
+散放 11.7034530746
+狼獾 12.1089181827
+羽毛缎 13.900677652
+集贸市场 11.598092559
+何玉芬 11.1926274509
+张孔目 13.2075304714
+银辉洒 13.2075304714
+李玲蔚 12.8020653633
+转败为胜 10.4349417492
+举无遗策 13.900677652
+丛刊 9.91169360541
+砂土 10.2897597393
+名典 12.5143832909
+中北部 9.20019728618
+万多尊 13.2075304714
+丘园 12.2912397395
+丛刻 11.9547675029
+钢化 13.900677652
+城镇 6.86893639321
+岸田国士 13.2075304714
+捶打 10.3171587135
+公狗母 13.2075304714
+解放军报 12.8020653633
+蚜虫 9.7898037878
+顾祖禹 12.1089181827
+王竹斋 12.2912397395
+丛剑 13.2075304714
+泾县 10.4041700905
+宫廷政变 10.8096351986
+练兵场 11.8212361103
+面貌一新 12.5143832909
+七言诗 11.0103058941
+各州 8.57766767284
+饮鸩止渴 11.1280889297
+电子眼 11.2616203224
+提押 13.900677652
+深闭固拒 13.900677652
+好牌 13.2075304714
+教育体制 10.4349417492
+恨意难消 13.900677652
+万分危急 11.0103058941
+批零兼营 13.900677652
+海藻类 12.1089181827
+肉禽 13.2075304714
+容量 7.43297892587
+震惊全国 11.598092559
+凌京尧 12.8020653633
+武林 8.85725253506
+青龙 9.24671730182
+独木 11.4157710022
+笨家伙 12.8020653633
+线性代数 11.0103058941
+郎气 13.2075304714
+名儒 10.7226238216
+米面 9.98865464655
+廖若 9.87532596124
+砚田 13.2075304714
+追击战 12.2912397395
+鲁之君 13.2075304714
+轻歌曼舞 13.2075304714
+奔出 9.63799777493
+金水 9.96885201925
+各射 13.900677652
+生儿育女 9.96885201925
+闻过则改 12.8020653633
+亚纲基 13.2075304714
+两驾 12.1089181827
+稽延 13.900677652
+照这么说 12.8020653633
+李婶娘 11.8212361103
+里夏尔 12.8020653633
+恳求 8.33999602096
+当不了 10.8561552143
+铁制品 12.5143832909
+刺激物 10.8096351986
+肌醇 11.9547675029
+大豆油 10.0940151622
+贱骨头 11.3357282945
+城铁 11.9547675029
+心计 9.49395840471
+贵山 12.8020653633
+逃役 13.2075304714
+就戮 13.900677652
+兴趣不大 11.2616203224
+好几米 13.2075304714
+电子盘 10.0088573539
+友军 10.3171587135
+狼狈 8.65365357982
+宫垣 13.900677652
+谢卡尔 13.2075304714
+提高警惕 10.0294766411
+较量法 13.900677652
+贝蕾帽 13.900677652
+建议者 12.8020653633
+泉源 12.2912397395
+青鸾 11.3357282945
+城商行 8.90346537821
+正紧 11.598092559
+各局 11.4157710022
+宠物店 13.900677652
+各属 11.3357282945
+心诚 11.598092559
+铁狮子 11.598092559
+总揽大权 13.2075304714
+锤头 12.5143832909
+尤有 11.3357282945
+罚球点 13.2075304714
+秘密行动 11.8212361103
+思温 13.900677652
+想死 11.8212361103
+权力 6.2228141513
+接地装置 11.8212361103
+丛台 12.8020653633
+安车蒲轮 13.900677652
+青鸟 10.6818018271
+金江 12.5143832909
+米雪 13.900677652
+中国农科院 12.8020653633
+拖进去 12.8020653633
+田家庄 13.900677652
+金汇 10.9049453784
+死性 12.5143832909
+群情激奋 11.598092559
+钾长石 10.0505300503
+阿甘正传 13.900677652
+金河 11.0103058941
+元宏 10.533381822
+火锅城 12.8020653633
+静海县 11.4157710022
+券商 5.94700787333
+伍世文 12.8020653633
+霍亨索 11.1280889297
+达耶 12.8020653633
+老于世故 12.8020653633
+幽梦 12.1089181827
+沈阿姨 12.8020653633
+当不上 11.598092559
+元宝 9.37888907493
+伸腿 11.5027823792
+本观 12.5143832909
+某部 11.0103058941
+赤道几内亚 10.765183436
+幼师 13.900677652
+病理学家 11.4157710022
+以色列空军 11.8212361103
+吴总 12.5143832909
+七百五十四 12.8020653633
+官俸常 12.8020653633
+青黛 12.1089181827
+一动不动 8.13548654919
+杨元庆 11.8212361103
+罗马大学 11.3357282945
+联系卡 12.8020653633
+性能参数 10.4666904475
+阿琼主 12.8020653633
+陆地卫星 12.5143832909
+旦尼尔 13.2075304714
+元宵 9.37888907493
+托马森 13.900677652
+金泳 13.900677652
+一扫光 12.8020653633
+禁赌 12.8020653633
+三分像人 12.8020653633
+晚些时候 9.77354326693
+捆得 11.598092559
+断后 9.63799777493
+金泽 12.1089181827
+姘居 12.8020653633
+茫茫大海 10.765183436
+财务结构 11.1280889297
+金波 8.44535653662
+安琛 13.900677652
+运输线 10.2117981979
+首当其冲 8.94485059437
+个人承包 13.900677652
+强化食品 12.2912397395
+汉明帝 10.1164880181
+甘休 12.2912397395
+抢手货 11.5027823792
+展销会 11.7034530746
+同情者 11.7034530746
+汝欲 11.4157710022
+肉碱 13.2075304714
+成虚衔 12.5143832909
+砂器 13.900677652
+土尔扈特部 11.0674643079
+安插在 11.1926274509
+验收组 13.900677652
+元寿 11.8212361103
+谷则 12.1089181827
+佛罗里达海峡 11.7034530746
+金泉 12.1089181827
+友党 12.8020653633
+高尔夫 8.99540287354
+非国有 10.3171587135
+俞大维 13.2075304714
+自谋生路 12.1089181827
+那就是说 10.8096351986
+香港城市大学 13.900677652
+贵子 11.2616203224
+钢叉 10.1164880181
+米醋 11.598092559
+首当 12.8020653633
+回良玉 12.5143832909
+自伤 10.604840786
+自治旗 11.2616203224
+自传 9.15574552361
+百孔千疮 12.5143832909
+奔回 9.22784881751
+山东省人民政府 13.2075304714
+马鲛鱼 10.8096351986
+卡斯尔雷 13.900677652
+奔四 12.2912397395
+断口 10.3743171274
+摸进 11.1280889297
+名城 8.89673134603
+能读 11.8212361103
+南航河南分公司 13.2075304714
+哈卡姆 13.900677652
+一个甲子 12.5143832909
+郑廷奇 11.598092559
+文人画 10.3453295905
+天门市 11.5027823792
+唐文粹 12.5143832909
+黄辣丁 12.2912397395
+一霎那 11.598092559
+谢家婆 11.7034530746
+首开 9.43476953332
+雁荡 11.9547675029
+要害部门 11.9547675029
+不分昼夜 11.5027823792
+两边倒 12.8020653633
+同居一室 12.5143832909
+西博格 11.9547675029
+返防 13.900677652
+大嫂子 10.1871055853
+吴某 10.1394775363
+诏告 11.3357282945
+哈尔德 12.2912397395
+金正 12.1089181827
+米里 12.5143832909
+狼疮 12.5143832909
+移动网 13.900677652
+锁定 7.62780064543
+楚彦威 12.8020653633
+柴秀吉 13.900677652
+首张 11.598092559
+地图判读 13.900677652
+缩聚 10.533381822
+正税 10.8096351986
+汝河 10.4666904475
+恶妇 12.8020653633
+各学 12.8020653633
+一千五百 10.2897597393
+植物园 9.07236391467
+各季 11.7034530746
+自体 11.2616203224
+斗起 11.8212361103
+教学方式 12.5143832909
+自住 9.40086798165
+两军人马 13.900677652
+互传 13.2075304714
+郑注合 12.1089181827
+鲍丘 13.2075304714
+亲合性 13.2075304714
+好几篇 12.5143832909
+自便 9.94943393339
+二千石 9.80633308975
+听候通知 13.900677652
+周则天 11.7034530746
+巴布科夫 12.8020653633
+金殿 9.85762638414
+常自裕 12.5143832909
+四十八篇 12.2912397395
+蠢货 11.3357282945
+皮赖娃 12.8020653633
+锁孔 11.7034530746
+乌龙岭 11.1280889297
+双链 11.0103058941
+钟鸣鼓 12.8020653633
+郎官 10.6818018271
+宫员 13.900677652
+历朝皇帝 11.9547675029
+各室 12.1089181827
+愉悦感 12.5143832909
+壶菌 13.900677652
+茶碟 13.900677652
+和翼尖 13.900677652
+卢森堡法郎 13.900677652
+白格生 12.8020653633
+显象管 13.900677652
+找上来 12.5143832909
+各家 7.24138373229
+笔走龙蛇 12.5143832909
+揭幕典礼 13.900677652
+谗鬼 13.900677652
+叔本华 10.4994802703
+中国人民解放军海军 11.1926274509
+机枪手 10.7226238216
+牧礁 11.1280889297
+贵定 12.5143832909
+米酒 11.4157710022
+各寄 13.900677652
+市场前景 9.35738286971
+除此外 11.2616203224
+想法 6.63664750908
+吴村 11.8212361103
+探入 12.5143832909
+寒鸦 11.5027823792
+肉羊 12.5143832909
+化公为私 11.5027823792
+桑拿房 12.1089181827
+自信 7.78478552649
+自保 9.43476953332
+金毓 13.2075304714
+贵宾 9.43476953332
+奥雷斯 12.8020653633
+金比 13.900677652
+欲购从速 13.2075304714
+表面活性 11.5027823792
+金毛 11.0103058941
+鲨肝醇 13.900677652
+多少钱 8.01457362053
+黄水来 12.8020653633
+田中隆 13.900677652
+心烦意乱 9.84023464143
+铁狮峰 12.5143832909
+各对 12.8020653633
+砚友 13.900677652
+釉工 13.900677652
+军事医学 13.2075304714
+贵客 9.66657114738
+颜欣悦 13.2075304714
+丘克 12.5143832909
+自举 11.9547675029
+海涌 10.9049453784
+郡县 8.7245279194
+少女时代 10.9562386728
+自为 9.27570483869
+三明治 11.598092559
+名园 9.96885201925
+耳聋眼 12.2912397395
+偷工 13.2075304714
+赵金凤 10.9562386728
+禹臧 12.8020653633
+拉琴 12.5143832909
+光脚 10.3743171274
+历久弥新 12.2912397395
+自个 8.60737282725
+万多家 11.7034530746
+德卡尔 13.2075304714
+湿疣 12.2912397395
+窗户上 9.82314020807
+夏涨冬 12.5143832909
+优秀作家 12.1089181827
+禀承 13.900677652
+感恩怀德 13.900677652
+随手关灯 13.2075304714
+返青 11.0674643079
+捆好 11.4157710022
+颠儿 11.7034530746
+首年 11.8212361103
+李尚书 13.900677652
+双阳台 13.2075304714
+唉声叹气 9.66657114738
+拉帮结伙 13.2075304714
+张勋朝 13.900677652
+贾弹 12.5143832909
+铺筑 11.598092559
+双锤 13.2075304714
+双锥 11.2616203224
+变动性 12.2912397395
+电影界 10.0294766411
+双键 9.66657114738
+阮老爷 11.8212361103
+诗朗诵 13.2075304714
+绿色植物 9.87532596124
+创见 10.0294766411
+克死 13.900677652
+自书 11.598092559
+第七名 11.4157710022
+自习 11.2616203224
+小熊 11.3357282945
+高尔德 13.2075304714
+拙笨 13.900677652
+心路 12.5143832909
+钢厂 8.0600359946
+狭路相逢 10.9049453784
+厨卫 12.8020653633
+金橘 10.765183436
+自乐 11.7034530746
+喉头 9.54396882529
+姜切片 13.2075304714
+桨手 12.8020653633
+三千八百户 12.8020653633
+单子叶 9.6811699468
+双阳县 13.900677652
+湿病 12.5143832909
+会聚透镜 12.5143832909
+癸烯 13.900677652
+武林大会 12.8020653633
+巧家 12.1089181827
+卸妆品 13.900677652
+溜滑 10.604840786
+底朝天 10.4666904475
+名器 11.9547675029
+双门 10.8096351986
+名噪 11.7034530746
+吴明 12.8020653633
+李尚仁 13.900677652
+挤下来 13.2075304714
+吴昊 13.900677652
+小道 9.58318953844
+自交 11.3357282945
+自产 10.3453295905
+于会昌 12.5143832909
+电工仪表 12.2912397395
+麦角 10.8561552143
+大刀会 12.2912397395
+全家福 11.9547675029
+滑车神经 13.900677652
+届时 7.45654639528
+微量 8.94485059437
+稻苗 13.2075304714
+剧中人 10.9049453784
+仨月 12.1089181827
+金砂 11.7034530746
+自了 12.1089181827
+臣子 9.19114745066
+示警 11.4157710022
+全部种 12.5143832909
+蛋氨酸 11.5027823792
+自任 9.16447920358
+吴晗 10.2630914922
+近视 9.02548032877
+吴晓 10.604840786
+名嘴 11.1926274509
+日托米尔 13.2075304714
+孙乐祁 13.2075304714
+首应 12.8020653633
+自仪 11.2616203224
+郭泰 12.8020653633
+自以 11.3357282945
+定心丸 9.30555780184
+阿克顿 12.8020653633
+自代 11.2616203224
+友坂 12.8020653633
+避雷线 12.2912397395
+钢制成 12.5143832909
+自付 10.9049453784
+首度 8.74162235276
+首座 9.89334446674
+赳赳 12.5143832909
+全周 9.38981814546
+青田县 11.8212361103
+吴普 13.900677652
+吴景 11.9547675029
+自从 6.38315680137
+保身 11.7034530746
+肉红 13.2075304714
+一笑而过 12.5143832909
+爱重邦 13.900677652
+忘恩背义 12.8020653633
+衡臣 12.8020653633
+正确 6.48189676922
+第几天 12.1089181827
+元隆武 12.5143832909
+天生桥 10.3171587135
+姘妇 12.5143832909
+元帅 7.72481038187
+祖慧能 12.5143832909
+吴斌 10.0088573539
+多藏 12.2912397395
+复活节 10.4666904475
+元帝 9.98865464655
+仙桃市 10.9049453784
+恫喝 13.900677652
+原东德 13.900677652
+心身 11.0674643079
+孔甲立 13.2075304714
+城里 6.85839148004
+唐穆宗 11.8212361103
+锅饼 13.2075304714
+高躅 13.900677652
+各大 7.20117731181
+联系国 11.9547675029
+架桥机 12.5143832909
+无理方程 13.2075304714
+恶寒 9.94943393339
+臃肿 9.7898037878
+后来居上 10.1871055853
+梅西亚 13.2075304714
+独揽 9.82314020807
+伊利亚特 11.8212361103
+各奏 13.2075304714
+恶客 13.900677652
+一百三十四万余两 13.2075304714
+刘继安 12.2912397395
+吴旗 12.8020653633
+独掌 11.598092559
+天门山 11.598092559
+全员 10.4349417492
+渡轮 11.1280889297
+子司马师 12.2912397395
+几两重 13.900677652
+双阳 12.1089181827
+贵处 10.8561552143
+各奔 12.8020653633
+朴雅 13.900677652
+铺砌 11.7034530746
+戒护 10.1871055853
+输油管 10.1630080337
+丘利 13.900677652
+溴酸 12.8020653633
+玛法木 12.5143832909
+哈纳迪 13.900677652
+中专学校 13.2075304714
+第七场 13.2075304714
+釉彩 11.8212361103
+张金铭 12.2912397395
+玻璃框 12.8020653633
+图尔卡纳 12.5143832909
+螺杆菌 12.2912397395
+元平 13.2075304714
+侦缉 13.900677652
+元年 6.19316545738
+冒犯之处 13.2075304714
+特瓦族 13.900677652
+元逻辑 13.900677652
+严令禁止 12.2912397395
+蜀王 10.2630914922
+好几种 10.9049453784
+各如 13.900677652
+庞以女 12.8020653633
+贵姓 10.5684731418
+自治权 9.84023464143
+于小景 13.900677652
+闽南人 12.2912397395
+开司米 11.598092559
+李麦叹 12.2912397395
+白花钱 12.8020653633
+考试成绩 10.7226238216
+双雄 9.28555713513
+隗嚣 11.7034530746
+霍震霆 13.900677652
+宽体 11.7034530746
+梨酒 12.5143832909
+练起来 13.2075304714
+混沌 8.78268383956
+宽余 11.9547675029
+金榜 11.2616203224
+孵育 11.7034530746
+滤光镜 13.2075304714
+在业人口 12.1089181827
+百万份 13.2075304714
+锁好 10.9562386728
+姘头 11.8212361103
+三十余年 11.0103058941
+名唤 9.29550746599
+检验室 12.8020653633
+幽深 9.17328983326
+不知好歹 10.1164880181
+高低音 13.900677652
+获隽公车 13.900677652
+数节 11.598092559
+万国邮联 12.1089181827
+惨景 11.7034530746
+独挑 13.900677652
+司一正 13.900677652
+贵妇 9.94943393339
+正碰 12.2912397395
+大巴回 13.900677652
+鹿鸣馆 13.2075304714
+聂思脱 10.9562386728
+渡过 7.97108850859
+不听使唤 10.642581114
+陈永龄 12.8020653633
+那青鳞 12.5143832909
+山间盆地 8.74162235276
+奔向 9.43476953332
+渡运 13.900677652
+吴敬 12.8020653633
+谷壳分离 13.900677652
+锁头 11.4157710022
+童贯只 12.2912397395
+乌拉尔山 10.533381822
+元廷 9.75754292558
+情性 10.604840786
+中国画系 12.8020653633
+庸夫 12.5143832909
+赎罪 9.5062284973
+连史纸 12.8020653633
+双面 10.1630080337
+城郭 9.28555713513
+金根 12.2912397395
+诗风 9.5062284973
+首届 8.35941410682
+金格 13.2075304714
+劫道 13.2075304714
+哈特莱 12.5143832909
+渔舟唱晚 12.5143832909
+凭虚御风 13.900677652
+青马 12.1089181827
+母权制 11.3357282945
+万全县 13.900677652
+城郊 8.53470163695
+封建统治 8.90346537821
+名品 10.4666904475
+友善 9.63799777493
+哈佛大学 8.64840422393
+逃得 9.53122979951
+胼胝 10.7226238216
+创设 9.0884932966
+宽仁 11.1280889297
+联欢晚会 10.7226238216
+于光远 11.9547675029
+生有羽 12.5143832909
+美国波士顿大学 12.8020653633
+丘印 11.0674643079
+亏到 13.900677652
+爱丽舍 12.8020653633
+创议 11.7034530746
+届期 11.9547675029
+魏分立 13.2075304714
+首尊 13.900677652
+五谷丰登 10.8096351986
+城邦 7.74581955796
+土楼 12.5143832909
+金桥 9.32596667347
+臣妾 8.97342396682
+王又问 13.900677652
+六一伙 12.8020653633
+狼皮 11.598092559
+奇想 11.1926274509
+蒲风 12.2912397395
+丘北 11.7034530746
+元彪 13.2075304714
+金桔 12.1089181827
+混流 12.5143832909
+刑种 13.900677652
+文教局 13.900677652
+民间舞蹈 10.1630080337
+马特拉 12.2912397395
+心迹 10.5684731418
+金桂 10.2897597393
+室家 13.900677652
+那明明 13.900677652
+跟不上 9.22784881751
+宽于 11.7034530746
+心迷 11.9547675029
+摄象机 13.2075304714
+所作所为 8.9308643524
+发表议论 10.9562386728
+肉糜 12.1089181827
+瓦官寺 12.5143832909
+第七回 11.7034530746
+恫吓 10.1630080337
+军事 5.51907511487
+哀艳 12.8020653633
+吴祖光 12.2912397395
+双音 11.5027823792
+小心眼儿 11.9547675029
+猪肝色 13.2075304714
+天契 13.900677652
+加贝斯 13.900677652
+于光轴 13.900677652
+便成仁 12.5143832909
+魔眼 13.2075304714
+阿庆嫂 11.9547675029
+电子版 12.1089181827
+万多处 13.2075304714
+皮纳斯 12.8020653633
+这部分 7.45020722983
+工程规划 11.0103058941
+金梁 12.1089181827
+广寒殿 12.1089181827
+一碗水 10.4994802703
+劬劳 12.1089181827
+扬升鱼 13.900677652
+优惠权 11.7034530746
+残喘 11.9547675029
+正科 12.8020653633
+元德 12.2912397395
+杨以增 12.8020653633
+两千余种 13.2075304714
+黄三 13.900677652
+喉宝 13.900677652
+侍丛 13.900677652
+剪彩仪式 11.598092559
+不厌其详 13.2075304714
+蓬荜生辉 13.2075304714
+封信递 12.1089181827
+混混 11.2616203224
+把风 11.4157710022
+玉棺 10.1164880181
+黑香墨 13.2075304714
+戴月轩 13.900677652
+不绝于耳 9.55687223012
+梅克伦堡 12.8020653633
+节节胜利 10.5684731418
+里坡 13.900677652
+阳王 12.5143832909
+萧山区 12.8020653633
+心软 9.65218240993
+罗伯托 13.2075304714
+名吃 13.900677652
+吵吵嚷嚷 10.3453295905
+篆刻 9.91169360541
+胡笳吟 13.2075304714
+隆夫人 12.8020653633
+拉马拉 13.900677652
+不可抗力 10.4994802703
+盘整 7.16846694551
+大部份 10.4666904475
+惨杀 11.2616203224
+岢岚 12.8020653633
+心轴 13.900677652
+顾谓诸 12.5143832909
+心肌 9.18217878068
+羊毫笔 13.900677652
+肌骨 11.5027823792
+双顶 10.8561552143
+依率 13.2075304714
+教益 10.9049453784
+心肝 9.07236391467
+金末 10.4349417492
+郭祥电 13.2075304714
+名寺 11.1926274509
+深圳证券交易所 7.86519621945
+邪教 11.0674643079
+各在 11.5027823792
+抚摩她 12.5143832909
+心肠 8.98069672615
+打印头 12.8020653633
+克明 11.9547675029
+制定者 9.56994431169
+断念 13.900677652
+转氨酶 10.4041700905
+诗韵 12.5143832909
+心力交瘁 10.4994802703
+各场 12.5143832909
+万士和 12.1089181827
+混成 10.0720362555
+情况异常 13.2075304714
+丘山 11.2616203224
+克星 10.2371160058
+补阴药 12.1089181827
+各地 5.74330721079
+混战 8.01457362053
+七下 10.8561552143
+七三 12.8020653633
+七丈 12.8020653633
+金杵 13.900677652
+日本帝国 10.765183436
+吴秉彝 12.5143832909
+七七 10.3453295905
+依语 13.2075304714
+七一 10.8561552143
+七万 10.4041700905
+心胆 11.1280889297
+食邑 10.3743171274
+金松 11.9547675029
+金条 8.97342396682
+谐谑曲 11.5027823792
+名家 8.51618258919
+箭袋 11.7034530746
+七丝 12.8020653633
+四五亿元 12.8020653633
+名宿 12.5143832909
+观棋 12.5143832909
+运十二 13.900677652
+七世 10.1394775363
+金杯 9.59661255877
+金村 12.8020653633
+七个 8.11071748108
+达诚 13.2075304714
+七中 13.2075304714
+金杖 11.7034530746
+苗民弗 13.2075304714
+兴宁县 13.2075304714
+荣登榜首 12.8020653633
+贵地 11.598092559
+七两 11.5027823792
+排行榜 8.53470163695
+心胸 9.5062284973
+混打 12.8020653633
+贵在 10.2117981979
+朵夫 11.9547675029
+宣南 12.5143832909
+好几眼 12.8020653633
+名实 10.2630914922
+第七天 11.5027823792
+夏敬观 12.8020653633
+名学 11.5027823792
+格罗宁根 11.7034530746
+杏花村 10.642581114
+独流 9.98865464655
+叵耐 10.0088573539
+百善孝为 13.2075304714
+食道 9.85762638414
+瞧瞧 7.58170953823
+首发 7.38448457593
+七仙 12.8020653633
+金枪 11.3357282945
+群情激动 13.2075304714
+正直 8.89004235788
+西点军校 10.4994802703
+两里 11.0103058941
+两重 9.96885201925
+首句 12.1089181827
+金林 11.5027823792
+苏澳湾 12.5143832909
+七代 12.5143832909
+首只 8.86372504956
+金枝 11.2616203224
+金果 9.55687223012
+异质性 12.5143832909
+疰夏 12.8020653633
+好多年 9.6811699468
+扣着 11.7034530746
+名字 6.17888587516
+名子 11.9547675029
+班第兵 13.2075304714
+双飞 10.9049453784
+款款深情 13.900677652
+铺盖 9.33632946051
+正盐 12.8020653633
+桑普森 13.2075304714
+七件 11.8212361103
+十多家 10.9049453784
+山小寨 13.2075304714
+喉咙 7.9817837977
+西加湖 12.5143832909
+樵夫 10.3453295905
+足本 12.2912397395
+警告性 13.900677652
+吴歌 13.2075304714
+真太阳 12.8020653633
+毫不掩饰 10.4041700905
+每辆车 11.1926274509
+哈拉夫 12.5143832909
+丘岗 11.3357282945
+七五 11.0674643079
+博纳尔 12.8020653633
+金某 11.1926274509
+七亩 12.5143832909
+断弦 12.8020653633
+丘岭 12.5143832909
+想想 6.99693039439
+麦蒙 11.2616203224
+双颊 10.2630914922
+镐素 13.2075304714
+管理费用 9.84023464143
+七人 9.77354326693
+麦蒂 10.2371160058
+陈嘉 13.900677652
+七亿 12.1089181827
+金柄 13.900677652
+苏澳港 11.7034530746
+双频 11.9547675029
+伊丽道 13.2075304714
+湖绿 12.8020653633
+独活 10.9562386728
+花重锦 13.900677652
+诗集 8.08654712015
+肉牛 10.642581114
+线速度 11.8212361103
+定常流动 13.2075304714
+七位 10.9562386728
+汪克尔 12.5143832909
+安拉之 12.8020653633
+食量 9.93038573842
+顿悟说 12.5143832909
+垮下 13.2075304714
+电子系 12.8020653633
+干系 9.09665660724
+幼年期 11.0674643079
+肉片 10.5684731418
+安纳波利斯 12.8020653633
+体育事业 10.6818018271
+雷打不动 11.8212361103
+日久生情 12.8020653633
+广州市政府 10.2371160058
+数起 11.9547675029
+收入水平 9.44633035572
+黄丝 11.2616203224
+正着 13.2075304714
+砂岩 8.4801426527
+克服 7.46292600224
+农商部 11.7034530746
+重力梯度 12.8020653633
+克朗 10.3743171274
+好几百 11.0674643079
+陡然升高 12.8020653633
+源于 7.26604429411
+金昌 11.1280889297
+检验员 12.8020653633
+首刀 12.5143832909
+元光 10.3743171274
+步炮 13.2075304714
+精密仪器 9.84023464143
+阙门 11.5027823792
+元元 12.2912397395
+阿森纳 11.5027823792
+逆反应 12.2912397395
+窃国者侯 13.900677652
+两造 13.2075304714
+奇术 11.598092559
+公启 11.7034530746
+线袜 12.2912397395
+食醋 10.4349417492
+酥麻 11.9547675029
+正眼 10.6818018271
+杨祖云 13.900677652
+首则 12.2912397395
+首创 8.11071748108
+电影票 10.642581114
+斯诺沃 12.8020653633
+乌德勒 13.900677652
+躺柜 12.8020653633
+吸过来 12.8020653633
+沉溺于 11.0103058941
+第五招 12.8020653633
+封双喜 12.5143832909
+萨朗宝 13.2075304714
+两通 13.900677652
+哄走 13.900677652
+名媛 10.4994802703
+元兴 11.4157710022
+心脉 11.1280889297
+心脏 7.3741827924
+天门县 12.1089181827
+两部 8.0484751722
+听太后 11.7034530746
+三四百公里 13.2075304714
+挽髻 12.5143832909
+元军 9.31571017331
+心脑 11.4157710022
+贵国 9.84023464143
+微酸 11.5027823792
+王忠嗣 13.2075304714
+日者君 13.2075304714
+麟德 11.3357282945
+玻璃棉 13.900677652
+马老 11.7034530746
+多星期 12.1089181827
+不法行为 10.3453295905
+克林 11.1926274509
+心脾 10.3453295905
+磁盘分区 13.900677652
+蒋远华 13.900677652
+嘉士伯 11.8212361103
+本质论 13.2075304714
+性解放 13.900677652
+突突 9.85762638414
+斗胆 10.0294766411
+金曲 12.5143832909
+砂层 11.4157710022
+追朔 13.900677652
+禹贡 9.71102290995
+军令 8.7245279194
+恳辞 13.2075304714
+金曼 13.900677652
+各回 9.96885201925
+藏头露尾 11.5027823792
+香味儿 11.1926274509
+捞着 11.3357282945
+行庭参 13.2075304714
+破译 7.92941581219
+斯特瓦尔德 13.2075304714
+痛打落水狗 13.2075304714
+首功 11.4157710022
+一墙之隔 10.7226238216
+特别快车 13.2075304714
+圣德尼 12.8020653633
+吴祖强 11.9547675029
+各团 12.2912397395
+恶名 10.2630914922
+各因 12.8020653633
+外阴炎 12.2912397395
+双首 13.2075304714
+第几回 13.900677652
+心腹 7.86999239171
+天然林 10.2897597393
+历世诸 13.2075304714
+万多块 12.1089181827
+舒特金 13.2075304714
+国企改革 10.642581114
+元凶 9.7898037878
+稳准狠 13.2075304714
+班第参 13.2075304714
+布克 11.7034530746
+土地局 12.5143832909
+首先 5.28219220908
+显露 8.73019365694
+想成 12.1089181827
+十多处 12.1089181827
+鸡鸣 9.4233408375
+悠悠忽忽 11.4157710022
+护卫艇 11.5027823792
+令人担心 10.4349417492
+庄户人家 11.8212361103
+度量衡 9.58318953844
+元初 9.91169360541
+龙超峰 13.2075304714
+擦破 11.4157710022
+当行本色 13.900677652
+汝拉 13.2075304714
+夙昔 12.8020653633
+十多天 9.98865464655
+元利 11.598092559
+数学老师 11.9547675029
+青青 9.84023464143
+碎石路 13.2075304714
+路不拾遗 12.5143832909
+于越尊 12.5143832909
+高贵典雅 11.9547675029
+辆次 13.2075304714
+百颗 13.2075304714
+令人担忧 9.89334446674
+心花 11.9547675029
+宗琪 13.900677652
+套曲 9.82314020807
+邵员外 10.3743171274
+金非铁 13.900677652
+斗草 11.7034530746
+彭定康 13.2075304714
+侯伟 12.8020653633
+塔尔迪 12.8020653633
+邪术 9.98865464655
+刮须 13.900677652
+抱打不平 12.8020653633
+饶阳县 13.900677652
+寒邪 10.604840786
+侯伯 12.5143832909
+液压泵 11.2616203224
+旁敲侧击 10.9049453784
+全国侨联 13.900677652
+护卫舰 8.39534611604
+张陵创 12.5143832909
+青霜 13.900677652
+刘肇基 13.2075304714
+民族主义者 9.80633308975
+正理 9.94943393339
+青霄 11.3357282945
+辍笔 12.2912397395
+零八个 12.8020653633
+郭淮复 13.2075304714
+名妓 9.66657114738
+司依 12.8020653633
+达见 13.2075304714
+阿西 12.5143832909
+青霉 11.7034530746
+犬儒 13.2075304714
+人民政权 10.4666904475
+匣子枪 11.2616203224
+斯梯芬 13.900677652
+万多吨 10.5684731418
+金方 10.7226238216
+中间体 9.46986085313
+个旧市 11.9547675029
+细节决定 11.7034530746
+偶数号 13.900677652
+麦蛾 11.7034530746
+司佥 11.8212361103
+长期借款 11.598092559
+各喝 13.900677652
+元功 12.1089181827
+民国初年 9.85762638414
+饱经风霜 10.8561552143
+汝才 8.9519177616
+低热量 10.9562386728
+巫山云雨 13.2075304714
+貔虎 13.900677652
+归档文件 10.5684731418
+金斯 11.1926274509
+万多名 10.3453295905
+比利亚 11.4157710022
+北辛 12.2912397395
+起泡沫 12.8020653633
+杯中之物 13.900677652
+乐和舅 13.2075304714
+犯嘀咕 11.0103058941
+不可估量 10.6818018271
+海油 10.3171587135
+金文 9.30555780184
+文山壮族苗族自治州 11.7034530746
+订货人 13.900677652
+低压配电 12.2912397395
+潮阳县 13.2075304714
+运量 9.38981814546
+双高 10.9562386728
+电子网 13.900677652
+元勋 10.4349417492
+五六分钟 11.1280889297
+达西 9.01787572939
+朱买臣 12.5143832909
+五甲 13.2075304714
+相严嵩 12.1089181827
+三十几条 13.900677652
+名头 9.71102290995
+于柏举 12.5143832909
+断崖 9.38981814546
+金日 11.3357282945
+双骰 13.900677652
+分配任务 12.5143832909
+金旨 12.2912397395
+差率 11.2616203224
+驱虫 10.2630914922
+第七家 13.2075304714
+一九六一年 12.5143832909
+昌化石 13.2075304714
+莫阿 13.2075304714
+愚昧 9.36807815882
+麦蚜 12.8020653633
+表里山河 13.2075304714
+几百丈 13.900677652
+把门 8.3285236198
+贫瘠化 12.8020653633
+非他莫属 11.8212361103
+凤四州 12.8020653633
+哥林 13.900677652
+气势雄伟 10.4041700905
+散射系数 13.2075304714
+阿物儿 12.5143832909
+各吊 13.900677652
+小点 10.4994802703
+晓风残月 11.8212361103
+一千万两 12.5143832909
+某项 9.80633308975
+格老子 13.900677652
+一村 10.0505300503
+名士 8.6803218269
+正畸 12.2912397395
+名声 8.05135287203
+法尔孔 12.8020653633
+渡船 10.0294766411
+订货会 11.0674643079
+吴梅 11.7034530746
+普勒著 13.2075304714
+幽怨 10.4349417492
+各向 11.4157710022
+运道 10.5684731418
+各听 12.5143832909
+数轴 13.900677652
+幽思 12.5143832909
+徐霞客 10.0088573539
+中间件 12.2912397395
+中间价 9.66657114738
+状元郎 11.598092559
+数载 10.6818018271
+夫斯基 10.0294766411
+悬挂国旗 13.900677652
+各吸 13.900677652
+法考福 12.8020653633
+默默无名 13.2075304714
+平版印刷 12.2912397395
+数轮 12.8020653633
+光明顶 12.2912397395
+棱角 9.7898037878
+连猪狗 12.8020653633
+元华 12.5143832909
+青阳 10.9562386728
+濡湿 12.2912397395
+普华永道 11.0674643079
+最佳奖 13.900677652
+纳太罗 12.1089181827
+食盐水 12.5143832909
+所出 9.45802639549
+克数 11.9547675029
+监事长 11.4157710022
+许可权 12.8020653633
+正田 13.900677652
+老年人 8.03704647638
+伏玛格 12.5143832909
+正电 10.0720362555
+普瓦雷 13.2075304714
+中间人 9.7898037878
+首倡 10.533381822
+饱经风雨 13.900677652
+万马 10.0088573539
+板起面孔 11.7034530746
+光影 9.61021821083
+现货价 10.3743171274
+运通 10.3171587135
+狼窝 11.1280889297
+快赢了 13.2075304714
+大获全胜 9.93038573842
+克敌 11.2616203224
+自卑心理 13.2075304714
+运送 7.86519621945
+斗艳 12.8020653633
+票房记录 13.900677652
+走亲戚 10.642581114
+加多少 13.2075304714
+土城子 11.4157710022
+梭子蟹 10.642581114
+清产核资 12.2912397395
+百分之四十九 13.900677652
+蔡家艺 13.2075304714
+断层 8.18036587537
+书讯 13.2075304714
+寒酸 10.0505300503
+左羽 12.8020653633
+随身行李 12.8020653633
+艺术表演 11.1280889297
+集于一身 11.4157710022
+卫生标准 10.7226238216
+天门冬 11.1280889297
+巴尔赫姆 12.5143832909
+白炭黑 12.8020653633
+发展缓慢 9.49395840471
+马易茶 13.2075304714
+砂带 12.8020653633
+紧紧包裹 13.2075304714
+处理机 10.0088573539
+外高桥 10.3171587135
+山茂召 13.2075304714
+老之将至 13.2075304714
+早晚都是 12.8020653633
+青雀 13.900677652
+童音 12.1089181827
+移民法 12.8020653633
+史家兄弟 13.2075304714
+稽征 12.8020653633
+阿萍问 13.900677652
+想接 12.2912397395
+惨死 9.89334446674
+英宗释 13.2075304714
+克日 10.2630914922
+一知半解 10.9049453784
+奔头 11.1926274509
+吴与楚 12.8020653633
+左翼 8.3285236198
+红利 7.65070240972
+绥靖区 12.2912397395
+雷薄 11.9547675029
+数辆 11.598092559
+定点数 13.900677652
+阿克陶 12.8020653633
+紧密联系 9.45802639549
+风动工具 12.5143832909
+友好 7.94225295895
+董桂枝 13.2075304714
+蜀绣 11.7034530746
+缩进 10.9562386728
+名堂 8.47572763449
+辽东 7.69007757495
+妖邪 9.46986085313
+唐永泰 12.5143832909
+克族 12.1089181827
+幽情 11.2616203224
+民族魂 13.900677652
+司东 12.2912397395
+沙漠 7.04421566738
+元史 9.30555780184
+断尾 12.2912397395
+唤醒 9.12155415886
+斜体字 12.8020653633
+元吉 11.598092559
+误下 13.2075304714
+达达 11.1926274509
+电子秤 12.5143832909
+北运 10.2117981979
+台伯河 11.7034530746
+元君 11.5027823792
+交通费 10.6818018271
+抢走 9.59661255877
+筮书 12.5143832909
+澳大利亚人 9.45802639549
+吴澄 10.765183436
+皮洛士 13.2075304714
+犯罪预测 12.1089181827
+哈尔基 12.8020653633
+电子称 13.900677652
+泣诉 12.2912397395
+所写 9.21854642485
+蚂蜂 12.8020653633
+正牌 11.5027823792
+十多张 12.8020653633
+谢娘子 13.2075304714
+幽期 13.900677652
+摇滚歌手 13.2075304714
+储备库 11.598092559
+陆逊营 13.2075304714
+黄志红 12.8020653633
+错码 13.2075304714
+立克式 13.900677652
+荣典权 12.8020653633
+各区 9.69598503258
+模拟实验 11.7034530746
+六七十个 12.1089181827
+数表 11.8212361103
+电子科 13.900677652
+克扣 9.6811699468
+先考 13.2075304714
+两锭 11.8212361103
+各半 10.1630080337
+范德格 12.2912397395
+铁冶业 12.2912397395
+赞叹 8.43261751084
+抢购 9.23723855786
+惨叫声 10.765183436
+晋冀豫 11.1280889297
+暗机关 13.900677652
+钢圈 13.2075304714
+开放搞活 12.8020653633
+雪顶 13.2075304714
+一家一户 10.8096351986
+瞩目 8.74738605748
+砂姜 11.8212361103
+共荣圈 10.8561552143
+向全城 12.1089181827
+杨嗣昌 7.71036224612
+断定 7.95003509939
+良品率 13.900677652
+余一元 12.2912397395
+辗米厂 13.2075304714
+肉眼 8.77077893705
+不分胜负 9.85762638414
+刺激素 11.9547675029
+两锅 12.5143832909
+硬气功 12.2912397395
+郭淮引 12.8020653633
+各占 9.28555713513
+离心作用 13.2075304714
+合黎山 11.598092559
+下降时 10.0940151622
+关予 13.2075304714
+白发苍苍 10.6818018271
+讲个 10.2371160058
+各卷 10.9049453784
+讨论稿 12.1089181827
+盗版碟 13.2075304714
+氨基酸 8.14810501315
+武兄弟 13.900677652
+关于 4.97948709573
+那长老 9.27570483869
+误事 9.89334446674
+两门 9.84023464143
+陷入重围 11.2616203224
+各厂 11.2616203224
+刘继元 12.2912397395
+亲手做 10.9049453784
+总长度 9.93038573842
+各门派 13.2075304714
+预收款 11.0674643079
+贵友 12.8020653633
+麦台依 13.900677652
+两间 8.9519177616
+丘壑 10.9049453784
+排外主义 12.8020653633
+组合法 12.8020653633
+绘出 10.4349417492
+汽车部件 11.9547675029
+温中健 12.5143832909
+泾川 10.9049453784
+涵养 9.7898037878
+杨朝栋 12.2912397395
+麻类作物 12.2912397395
+拉尼亚 12.8020653633
+碳素纤维 13.2075304714
+名录 10.3171587135
+各县 8.36334338496
+副县级 12.2912397395
+买房人 10.8096351986
+抢跑 11.1926274509
+拥进 10.5684731418
+李国英 13.2075304714
+毫当量 12.8020653633
+青釉 11.4157710022
+蒙罗维亚 11.3357282945
+掌事太监 10.3453295905
+正犯 11.5027823792
+石崖 9.75754292558
+额敏县 11.9547675029
+朝报 13.2075304714
+土方工程 12.8020653633
+丘墟 11.9547675029
+机关算尽 12.8020653633
+各取 10.765183436
+叠氮化物 13.900677652
+生隐宫 12.8020653633
+销货 11.8212361103
+锁匠 12.1089181827
+丛山 12.5143832909
+汇率变动 10.765183436
+梅雪争 13.900677652
+克拉 8.92394390956
+时代精神 10.1164880181
+上上网 12.2912397395
+泪流 11.2616203224
+枝枝蔓蔓 12.5143832909
+句词 12.8020653633
+米饭 9.12999302751
+潜意识 9.94943393339
+范德梅 13.2075304714
+好几片 12.8020653633
+民权初步 11.2616203224
+激光打印机 11.598092559
+各分 10.1871055853
+邪恶 9.08039608637
+湛江 9.09665660724
+丘奇 12.5143832909
+优良单株 13.900677652
+空荡荡 9.00283785202
+庸医 12.2912397395
+落下来 9.02548032877
+友德 13.2075304714
+各创 13.900677652
+自治法 12.8020653633
+第七届 9.03314320152
+龙华镇 12.5143832909
+金成 10.2897597393
+刘孔和 10.1164880181
+各别 10.2630914922
+瘀伤 13.900677652
+奔忙 10.2117981979
+伤悲 10.8096351986
+误伤 10.0294766411
+蒙古人种 8.93783302172
+高尔基 9.21854642485
+混有 9.84023464143
+误传 11.598092559
+孟先汉 13.2075304714
+金戈 12.2912397395
+幽明 11.7034530746
+持正不阿 13.900677652
+各到 12.8020653633
+安葬 8.91707103027
+混来 13.900677652
+桨橹 13.900677652
+万多只 12.1089181827
+泉州人 11.8212361103
+盘古开天 13.900677652
+年度性 12.2912397395
+套数 9.71102290995
+万多口 12.5143832909
+丛川 13.900677652
+膀大腰圆 11.5027823792
+指标体系 10.0294766411
+见机 11.0674643079
+喧腾声 12.2912397395
+马肥 12.8020653633
+领事馆 10.2117981979
+大吃大喝 10.6818018271
+生辰八字 11.5027823792
+惨淡 9.01787572939
+掉包 12.2912397395
+万多台 12.2912397395
+高耗能 9.44633035572
+混杂 8.62767809341
+芒硝 9.34680076038
+庠序 11.8212361103
+捆儿 12.5143832909
+砂壶 12.2912397395
+海水 7.02029356979
+他山石 13.900677652
+董其武 13.2075304714
+十多年 8.4284069783
+肉瘤 9.98865464655
+奔往 9.06439574502
+一跳 8.93783302172
+原始要终 12.5143832909
+正班 13.2075304714
+销赃 12.5143832909
+阅读障碍 13.900677652
+医不好 12.1089181827
+朴达摩 12.2912397395
+各办 11.8212361103
+金报 11.0103058941
+金护 12.2912397395
+小猫 10.4994802703
+塔克拉玛干沙漠 9.96885201925
+九寨沟县 12.8020653633
+幽暗 9.32596667347
+工时 10.642581114
+一片痴心 12.1089181827
+关仝 11.5027823792
+肉盾 13.900677652
+牛启东 10.4994802703
+葛家庄 13.2075304714
+各加 12.2912397395
+十多座 12.5143832909
+吴港 11.9547675029
+汝敢 11.7034530746
+讲习 11.5027823792
+狼籍 11.598092559
+友弟 13.900677652
+一班人 10.2117981979
+波洛克 11.9547675029
+起草者 11.7034530746
+愚意 10.3171587135
+葛店 12.2912397395
+寒露 11.3357282945
+招牌菜 12.8020653633
+核实验 13.900677652
+左移 11.598092559
+独栋 10.9562386728
+马斯克林 12.5143832909
+准入制 11.8212361103
+云霄飞车 12.1089181827
+塔尔衮 13.2075304714
+白种人 9.98865464655
+万多卷 13.2075304714
+补偿器 11.9547675029
+诸仁桥 11.9547675029
+哈拉尔 11.9547675029
+寒霜 11.7034530746
+斗蓬 12.5143832909
+名师 9.93038573842
+误信 12.1089181827
+观根 13.2075304714
+蕲春 10.6818018271
+名帖 10.765183436
+百顷 12.1089181827
+肉皮 11.3357282945
+分散学习 13.2075304714
+明嘉靖 9.24671730182
+正火 11.7034530746
+模样儿 9.7898037878
+双鹤 10.9049453784
+宗永泰 12.2912397395
+吴涛 12.2912397395
+聂伯湾 13.900677652
+杜布切 11.7034530746
+杨真先生 10.4349417492
+两面 8.29120585679
+关联度 10.0294766411
+香椿树 11.9547675029
+行政部长 13.900677652
+怕得要命 12.1089181827
+英国工党 10.9049453784
+愚拙 12.1089181827
+双鹰 12.8020653633
+货邮 11.8212361103
+未成 9.48183704418
+萨林斯 13.2075304714
+交叉调制 13.900677652
+韦国清 12.8020653633
+汝曹 13.900677652
+第十二章 9.69598503258
+好想你 9.94943393339
+臣僚 9.75754292558
+牧马人 10.2630914922
+海气 9.40086798165
+寒铁 13.900677652
+比荷 12.1089181827
+恶变 11.3357282945
+吸油烟机 13.900677652
+克思 11.8212361103
+吴淞 9.85762638414
+塔尔诺 13.900677652
+孙起礼 11.8212361103
+多喜爱 12.2912397395
+土地堂 12.8020653633
+值得称颂 13.2075304714
+把酒 9.23723855786
+电子管 9.74179456862
+邱壑 13.2075304714
+关西地区 13.900677652
+狼群 9.33632946051
+舒赫德 12.5143832909
+各党 10.8561552143
+潮水般 10.0505300503
+两霸 12.5143832909
+烛剪 13.2075304714
+高顺式 12.8020653633
+示范园区 11.9547675029
+指挥官 8.68574189437
+遮断 11.1280889297
+捆到 11.2616203224
+衣食不周 13.2075304714
+元器 12.8020653633
+小部 11.7034530746
+狂客 13.2075304714
+花岗岩 7.6761192227
+张弘范 11.9547675029
+虎仔 13.900677652
+器材 8.10766404359
+互争 12.8020653633
+肉用 10.604840786
+海军基地 9.19114745066
+恩怨分明 11.8212361103
+呆笨 12.5143832909
+各具 9.36807815882
+长春花 12.5143832909
+相对无言 10.765183436
+托马斯 8.65365357982
+肉痛 12.5143832909
+张士信 12.8020653633
+并不认为 9.75754292558
+正热 11.7034530746
+住宅楼 10.7226238216
+铅条 13.2075304714
+太伶俐 13.900677652
+覆膜 13.2075304714
+踪影 8.5440913773
+闽南地区 13.900677652
+酥饼 12.1089181827
+准入关 12.2912397395
+沙源 12.1089181827
+吴洁 13.900677652
+吴派 11.3357282945
+双黄 11.5027823792
+独步 11.2616203224
+马普托 11.4157710022
+麦苗 10.3743171274
+呕气 12.5143832909
+刘继卣 13.2075304714
+左突 13.2075304714
+丝织品 9.26594866375
+断奶 10.9049453784
+抢运 11.1280889297
+水门事件 11.4157710022
+竞买者 13.2075304714
+英雄豪杰 10.3453295905
+富甲一方 12.1089181827
+右侧 8.170577869
+届满 9.89334446674
+那汉 9.04086524761
+各减 13.2075304714
+中国民主同盟 9.94943393339
+首善 12.5143832909
+鼓舞士气 10.0505300503
+麦芽 10.5684731418
+借腹怀胎 13.900677652
+和登云 12.5143832909
+心虚 9.77354326693
+正点 11.0674643079
+达赫 13.900677652
+砂子 11.598092559
+拥趸 10.533381822
+韩咬儿 12.5143832909
+泰莱达 13.2075304714
+汝昌 11.598092559
+汽修 11.598092559
+浑蛋 12.2912397395
+左端 12.5143832909
+布军 12.1089181827
+麦芒 11.9547675029
+缘由 8.9102450652
+隔离舱 13.900677652
+家无常礼 13.900677652
+五千万元 11.598092559
+抱子甘蓝 13.900677652
+可分解 11.5027823792
+死死地 9.26594866375
+达赖 9.35738286971
+二招 13.900677652
+断头 9.96885201925
+四百五十余万元 13.2075304714
+凌烟阁 11.2616203224
+各出 10.642581114
+吴兵皆 12.8020653633
+恶化 7.38005652442
+感应性 13.2075304714
+小禁区 13.900677652
+跌足 10.765183436
+想望 11.8212361103
+当之无愧 9.80633308975
+断壁 12.5143832909
+饿虎扑羊 12.5143832909
+老相 12.8020653633
+水落管 13.900677652
+湛湛 11.8212361103
+首告 10.4349417492
+布农 12.8020653633
+两院 8.99540287354
+右下 12.5143832909
+右上 12.2912397395
+想有 12.5143832909
+左符 12.5143832909
+烂纸 13.900677652
+侵略战争 9.08039608637
+寒门 10.9562386728
+乳汁 9.15574552361
+魔幻 11.1280889297
+环节税 11.598092559
+万多册 13.900677652
+居民收入 8.76487921493
+买卖双方 9.21854642485
+元圣 11.9547675029
+目光短浅 10.9562386728
+哈尔哈 13.2075304714
+林湖越 13.2075304714
+羽毛状 11.5027823792
+审阅 10.765183436
+氧酸盐 13.900677652
+游上去 13.2075304714
+严正声明 12.5143832909
+麦草 10.1871055853
+投保人 9.5062284973
+掉入 10.8561552143
+火卫一 13.900677652
+近视镜 11.5027823792
+恶劣 7.69410172525
+基本空间 11.598092559
+心怀叵测 11.8212361103
+奋笔 13.2075304714
+二三丈 13.2075304714
+首名 11.8212361103
+马腾 10.5684731418
+一部分一部分 10.3453295905
+西伯利亚地区 11.3357282945
+各做 12.2912397395
+楚襄王 13.2075304714
+马腿 11.2616203224
+被查获 11.9547675029
+查戈斯 12.8020653633
+青春少女 12.2912397395
+特拉特 12.5143832909
+正然 10.533381822
+大箱子 10.9562386728
+吴泾 11.4157710022
+满天星斗 11.1280889297
+功德无量 11.1926274509
+鲍狄埃 12.8020653633
+天经地纬 13.900677652
+二三个 11.9547675029
+葛尼 11.2616203224
+两队 9.5186510173
+行藏用舍 13.900677652
+两百万两 13.2075304714
+扬手敬 13.2075304714
+代微积 13.2075304714
+凤阁鸾 11.3357282945
+罗武谕 12.8020653633
+想来 7.77380846786
+台东缘 12.5143832909
+淮水 9.93038573842
+十多岁 11.5027823792
+蒲速 13.2075304714
+吴民 12.5143832909
+几行字 10.9562386728
+吴氏 11.1280889297
+好不容易 7.82533162089
+第二季度 7.8093677699
+名山 8.47133202302
+坐视不理 12.2912397395
+沙蒙 8.98802276624
+数词 11.8212361103
+数说 12.2912397395
+红儿端 12.8020653633
+两集 11.9547675029
+泣血 10.9049453784
+纲常 9.41204128224
+八面受敌 13.900677652
+日内瓦大学 11.7034530746
+吊唁 10.3453295905
+一百三十余万 13.2075304714
+北大仓 11.8212361103
+花开节 13.2075304714
+贸易 5.58437740294
+樊晓霞 13.2075304714
+大多数种 11.5027823792
+数语 11.0674643079
+吴江 9.63799777493
+卖头卖脚 13.900677652
+守静 12.8020653633
+战斗舰艇 10.1394775363
+杭埠河 11.598092559
+后藤象二郎 13.2075304714
+金乡县 10.604840786
+封华歆 13.2075304714
+诗选 10.0720362555
+两难 8.86372504956
+达豪 12.5143832909
+加拿大航空公司 12.8020653633
+吴汉 12.2912397395
+断堤 13.900677652
+数记 12.8020653633
+名将 8.1902506346
+哈拉帕 11.2616203224
+择优录取 11.4157710022
+数论 9.17328983326
+天名精 13.900677652
+万多元 9.4233408375
+进风口 13.2075304714
+实名制 10.8561552143
+数计 11.2616203224
+后送 13.900677652
+砣子 13.2075304714
+葛岭 11.4157710022
+双龙 10.0088573539
+开幕礼 13.2075304714
+阿萍奶奶 10.9049453784
+万多亩 12.2912397395
+心领 11.2616203224
+卡斯蒂利亚 10.9562386728
+齐抗秦 13.2075304714
+万多亿 11.598092559
+纸业公司 11.5027823792
+吴王 9.06439574502
+吴玉 12.8020653633
+杭布朗 10.604840786
+吴率 12.1089181827
+易理 11.4157710022
+谚语 9.32596667347
+金缕 9.98865464655
+邹忌 11.8212361103
+误判 11.1926274509
+臣仆 11.8212361103
+双联 9.41204128224
+二三具 13.2075304714
+法学硕士 11.9547675029
+年轻一代 10.8561552143
+北京大学历史系 10.642581114
+践约 11.5027823792
+摆样子 13.2075304714
+臣仕 13.2075304714
+奥萨哥 13.900677652
+物流园 11.4157710022
+沙滩 8.64840422393
+各位 7.64301006409
+边庭 11.2616203224
+韬光养晦 11.0103058941
+爱玛 10.8561552143
+肌苷 12.5143832909
+各作 12.8020653633
+万多份 11.8212361103
+返航 10.4041700905
+双耳 10.0940151622
+万多件 11.7034530746
+自学 9.06439574502
+四十公里 13.900677652
+草地螟 13.2075304714
+商品种类 11.3357282945
+自存 11.3357282945
+督察组 13.2075304714
+新和县 13.2075304714
+肉欲 11.4157710022
+克鲁格曼 11.0103058941
+没齿无怨 13.2075304714
+各使 12.1089181827
+惨烈 9.20019728618
+实施者 12.2912397395
+关严 11.1926274509
+象征意义 10.0505300503
+巴祖卡 12.5143832909
+吴珠 11.9547675029
+右军 9.80633308975
+小环 11.7034530746
+光山县 11.598092559
+耿饼 12.8020653633
+万多个 9.82314020807
+吴猛 13.900677652
+八宿县 13.2075304714
+莲娜 10.1164880181
+自家 7.3859649611
+孤鸿影 13.900677652
+刘世昕 12.8020653633
+铺满 10.4994802703
+锁住 9.7898037878
+返英 12.2912397395
+庸人 10.8561552143
+各依 11.3357282945
+各供 13.900677652
+明索恩 13.900677652
+自宫 11.3357282945
+宫前殿 13.2075304714
+三竿日上 13.900677652
+马兰巴 13.2075304714
+中间商 10.2117981979
+自审 13.2075304714
+范德瓦 11.3357282945
+白花花 9.10488710638
+罗波尔 13.900677652
+那罗刹 11.5027823792
+自定 11.0103058941
+双胎 11.598092559
+七团 13.900677652
+涂尔干 13.900677652
+边幅 12.5143832909
+中文网站 13.2075304714
+伊西德罗 13.2075304714
+满盘皆输 11.7034530746
+龙首渠 11.4157710022
+全身像 12.1089181827
+七国 9.77354326693
+脑袋瓜 11.8212361103
+双胞 13.2075304714
+眷属 8.97342396682
+食补 11.5027823792
+上肢骨 13.2075304714
+两角 10.3171587135
+至真至诚 13.2075304714
+自导 9.85762638414
+数据完整性 13.900677652
+察觉出 11.9547675029
+双股 11.4157710022
+沉溺在 11.7034530746
+古士也 13.2075304714
+双肩 9.89334446674
+金翠 11.7034530746
+宽大 7.96578345636
+堪察 13.900677652
+中国基督教协会 12.5143832909
+嫁祸 12.5143832909
+独生 10.3743171274
+三审制 13.900677652
+吴用见 11.9547675029
+旋耕机 12.5143832909
+臣下 10.0940151622
+海宁县 11.7034530746
+数钱 10.8096351986
+袖珍版 12.8020653633
+曲小管 11.0674643079
+阿拉伯复兴社会党 11.1926274509
+边帅 12.8020653633
+独用 13.2075304714
+绝好 9.7898037878
+讨说法 11.4157710022
+幽篁 12.8020653633
+向济度 13.2075304714
+难分难解 11.1280889297
+阿克赛 12.8020653633
+正源 10.0940151622
+队形 9.36807815882
+禹门 12.1089181827
+大东区 12.2912397395
+诸子言 13.2075304714
+证者 12.1089181827
+第几个 12.2912397395
+九曲溪 12.5143832909
+山西省政府 11.1926274509
+一线天 11.8212361103
+新风气 12.1089181827
+心香 13.2075304714
+贵乎 11.5027823792
+各业 10.9049453784
+双腿 8.4980002701
+中间品 10.9049453784
+七块 11.1280889297
+本专题 13.2075304714
+武阳郡 12.8020653633
+两行 8.4284069783
+各个 6.29230317759
+万多例 13.2075304714
+耿飙 13.2075304714
+测地流 13.900677652
+友谊路 13.2075304714
+一并处理 13.900677652
+青豆 10.4666904475
+布罗迪 12.5143832909
+各为 9.40086798165
+误区 8.52078029844
+后室 10.1394775363
+抢道 10.8096351986
+分子磁矩 12.2912397395
+孙春兰 11.8212361103
+云峰山 13.2075304714
+妖言 11.1280889297
+二千户 12.8020653633
+舜尧 13.2075304714
+边微 13.2075304714
+清凉凉 13.900677652
+二三倍 13.2075304714
+昌化江 11.598092559
+数错 13.900677652
+尼连禅 12.8020653633
+蒸馏塔 12.8020653633
+服务平台 10.0720362555
+显象 12.8020653633
+生娃娃 11.8212361103
+枫林晚 13.900677652
+纳库鲁 13.2075304714
+特里萨 13.900677652
+黄壁庄 11.5027823792
+耿额 13.2075304714
+英雄好汉 10.3171587135
+蕴含着 9.7898037878
+贵为 10.5684731418
+李连捷 13.2075304714
+刺激性 8.65893063692
+各乡 11.1280889297
+订婚戒指 12.5143832909
+祥麟 13.900677652
+沙渚 13.900677652
+克罗 11.3357282945
+德兰吉 13.2075304714
+显豁 13.2075304714
+心想事成 12.2912397395
+双脚 8.41588071849
+灯盏 9.75754292558
+峡口 10.4994802703
+风云变幻 10.8096351986
+静脉血 11.0674643079
+希腊政府 10.8561552143
+上下跳动 12.8020653633
+金纸 11.2616203224
+计月数 13.2075304714
+惨然 10.4349417492
+金线 10.1394775363
+抗逆性 11.7034530746
+人多地少 10.533381822
+金红 12.5143832909
+人在何处 13.2075304714
+金约 12.8020653633
+鉴识 12.1089181827
+友谊赛 12.5143832909
+邹平 11.8212361103
+宁寿宫 12.2912397395
+大好时光 12.1089181827
+鉴证 11.1926274509
+任知州 12.1089181827
+贾蓉送 12.5143832909
+双臂 8.70218062071
+各享 13.2075304714
+数间 11.7034530746
+尽忠竭力 12.5143832909
+吴爷 13.900677652
+六弦琴 13.900677652
+侦检 13.900677652
+司员 11.8212361103
+从丹炉 13.2075304714
+各人 7.97108850859
+鉴诫 13.2075304714
+一个六十多 13.2075304714
+数门 12.5143832909
+中低产田 11.8212361103
+维斯杜拉 13.900677652
+莲子 9.36807815882
+审计局 11.0674643079
+四季青 12.5143832909
+货载 12.5143832909
+锁上 9.77354326693
+第几代 12.8020653633
+金绿 12.2912397395
+中非地区 13.2075304714
+货车 8.21031819765
+衡阳 9.48183704418
+银杏树 9.93038573842
+叵测 11.598092559
+列支敦士登 10.8096351986
+承载力 10.9562386728
+货轮 10.0720362555
+举起 7.47418919452
+峡县 13.900677652
+躺平 13.900677652
+不一致性 12.8020653633
+中星仪 11.9547675029
+密切相关 7.72273353793
+赵小姐 13.900677652
+绸缎 9.14708746087
+两袋 10.9562386728
+贵人 8.65365357982
+正盛 10.4041700905
+十五分钟 11.0674643079
+掌柜的 9.40086798165
+斯美塔那 13.900677652
+左旁 12.8020653633
+严衍著 13.2075304714
+两袖 11.3357282945
+郭元振 13.2075304714
+左旋 9.98865464655
+庸俗 8.0229418702
+鼻烟壶 10.8096351986
+肌肤 7.93453091285
+自夸 10.4666904475
+二三十 9.46986085313
+二三千 11.2616203224
+签订合同 9.87532596124
+双良 10.0720362555
+缩阳 13.900677652
+范仲淹 10.0505300503
+惨状 9.91169360541
+管中窥豹 12.2912397395
+合剂 10.2630914922
+七员 12.1089181827
+双色 10.765183436
+睡懒觉 11.1926274509
+自大 10.0088573539
+弹性 7.05799436974
+阿克达 13.2075304714
+汽化 10.3453295905
+司城 12.2912397395
+皮拉斯 13.900677652
+自多 12.5143832909
+自外 11.1280889297
+梳起 11.598092559
+肌肉 7.20983537456
+汽包 13.900677652
+小牧 11.8212361103
+角膜炎 11.0103058941
+独石 11.7034530746
+恶俗 11.9547675029
+自处 11.0674643079
+自备 10.0940151622
+主仆关系 13.2075304714
+卢梅尔 13.900677652
+滥增 12.8020653633
+癸未 12.8020653633
+自好 12.2912397395
+汝窑 11.3357282945
+忘不掉 10.8096351986
+七名 11.5027823792
+各层次 11.1926274509
+二十四五 12.2912397395
+宽容 8.58747167293
+古长安 12.8020653633
+日尔曼语 12.8020653633
+那太监 12.1089181827
+宽宥 10.642581114
+毛利人 10.3743171274
+心高 11.5027823792
+心髓 13.2075304714
+喝叱 13.2075304714
+殷承宗 12.8020653633
+野火烧不尽 11.8212361103
+邓寅达 13.900677652
+孙洛泉 13.2075304714
+突感 13.2075304714
+诗趣 13.900677652
+叛逆行为 12.5143832909
+数阵 12.2912397395
+休眠状态 11.0674643079
+频响 13.900677652
+牛尾汤 13.900677652
+老年型 13.2075304714
+右卫 10.533381822
+西藏大学 12.8020653633
+达里 11.2616203224
+满大人 11.9547675029
+普梯洛 12.8020653633
+骨结核 12.5143832909
+良田 9.71102290995
+白婆 10.9049453784
+正气 8.87679713113
+抱佛脚 11.0674643079
+武术协会 13.900677652
+显达 11.9547675029
+步步 8.94485059437
+牵出来 11.9547675029
+七品 9.5062284973
+诗赋 10.1871055853
+训练方法 11.0674643079
+任川陕 11.9547675029
+数集 11.4157710022
+阿莫尔 13.2075304714
+寒衣 11.5027823792
+诗赞 9.66657114738
+针形叶 13.2075304714
+禹陵 11.8212361103
+鉴裁 13.2075304714
+健行 12.1089181827
+侦毒 13.2075304714
+金戒指 10.8561552143
+芒果 9.75754292558
+民族舞 13.2075304714
+无如之何 12.8020653633
+红崖 13.900677652
+吴焰 10.4994802703
+确凿证据 11.0674643079
+电子束 9.71102290995
+幽禁 10.0294766411
+特鲁希略 11.4157710022
+私人秘书 11.8212361103
+正法 10.0940151622
+园林艺术 11.0674643079
+满朝公 13.2075304714
+皮鞋厂 13.900677652
+贵人多忘 13.2075304714
+布帽 13.2075304714
+王家耀 13.2075304714
+醉乡 11.1280889297
+麦麸 11.4157710022
+三多等 12.8020653633
+沙漠之狐 12.1089181827
+姻兄 13.2075304714
+金光大道 12.5143832909
+癣疥 13.900677652
+正治 13.900677652
+正沿 12.2912397395
+能登 13.900677652
+两千三百多年 13.900677652
+夕阳红 12.8020653633
+脸盆架 12.8020653633
+两记 12.1089181827
+食言 10.4666904475
+双节 9.77354326693
+敢动 10.5684731418
+前大灯 10.2897597393
+杨起隆 12.8020653633
+扑簌簌 10.3743171274
+挥金如土 11.4157710022
+自始 11.4157710022
+吴煦 12.5143832909
+产卵场 11.598092559
+中国电影家协会 12.5143832909
+克亚吉 13.900677652
+挂长 13.900677652
+煤矿主 11.7034530746
+心里有底 11.8212361103
+百分之四十四 13.2075304714
+尔滨 11.598092559
+合力 8.1641053545
+蒙员外 12.8020653633
+想笑 10.6818018271
+第一百五 13.2075304714
+利弗莫 13.2075304714
+肉案 11.8212361103
+眷念 11.8212361103
+通江口 12.8020653633
+电影海报 12.5143832909
+肉桂 9.98865464655
+酊剂 12.2912397395
+捆住 10.0294766411
+彭佳屿 12.5143832909
+挽联 10.604840786
+冷暴力 11.9547675029
+吴炳 12.2912397395
+烹调法 11.7034530746
+数面 13.2075304714
+保赦 13.900677652
+哈蒙德 12.8020653633
+正浓 11.0103058941
+定身法 11.1926274509
+运行 5.69600582302
+贝宁湾 12.1089181827
+县知事 12.1089181827
+传颂 11.1280889297
+烹调油 13.2075304714
+举足 12.8020653633
+习学记 12.5143832909
+潘孟二 13.900677652
+天开眼 12.5143832909
+通江县 12.8020653633
+心得安 11.598092559
+返本还原 12.5143832909
+正派 9.59661255877
+右前 12.8020653633
+自填 13.2075304714
+恶人 9.69598503258
+狄翁 13.900677652
+孙不二 11.9547675029
+残余分子 12.2912397395
+荒漠土壤 12.8020653633
+劫营 10.642581114
+阳燧 11.7034530746
+误入 10.0940151622
+恶事 11.2616203224
+马伏里 13.2075304714
+被管理者 13.2075304714
+借坡下驴 13.900677652
+一碧如洗 12.2912397395
+白手起家 11.0674643079
+甲盾 12.5143832909
+恶习 9.93038573842
+美国宾夕法尼亚大学 11.1926274509
+成千上百 13.2075304714
+肝脑涂地 9.77354326693
+冯恺章 12.2912397395
+肉棒 13.900677652
+审计师 11.4157710022
+代入 10.765183436
+耿马 12.5143832909
+涵义 9.30555780184
+斯的明 12.2912397395
+种庄田 12.5143832909
+朴茂 11.9547675029
+环节动物 10.4666904475
+鲍姆 11.7034530746
+赵天麟 13.2075304714
+盖泽尔 13.900677652
+产卵器 11.0103058941
+第十二条 11.5027823792
+一十三万 13.2075304714
+塞浦路斯共和国 13.2075304714
+侯国 10.0505300503
+分不开 9.14708746087
+夏生荣 13.900677652
+金粉 10.9562386728
+独白 10.8561552143
+矫正视力 11.9547675029
+条播 10.9562386728
+中央人民政府 8.94485059437
+心魂 11.8212361103
+束缚水 13.900677652
+分水线 12.1089181827
+心魄 12.2912397395
+授与 9.91169360541
+双莲 12.8020653633
+旱烟 9.20932976975
+肌腱 9.87532596124
+战争状态 10.4994802703
+诗谜 13.900677652
+脉细数 9.87532596124
+达道 13.900677652
+一百顷 12.5143832909
+澳大利亚元 11.9547675029
+米虫 11.9547675029
+若夫吾 13.900677652
+戒惧 11.9547675029
+姑娘家 10.4349417492
+误出 13.900677652
+恶业 12.5143832909
+茄克衫 13.900677652
+数道 10.8096351986
+自弹 13.2075304714
+自强 9.43476953332
+诗词 8.61241062128
+侯兄 12.5143832909
+画地为牢 12.2912397395
+捐献者 11.4157710022
+运载 8.70772080109
+小爷 11.0103058941
+如此一来 9.25628675283
+金符 9.71102290995
+两起 9.6811699468
+诗话 9.80633308975
+称好 11.7034530746
+何所不有 13.900677652
+运转 8.0484751722
+数遍 10.9562386728
+中央苏区 9.7898037878
+邪祟 10.8561552143
+金笔 12.2912397395
+冈纳 12.1089181827
+朔气 13.2075304714
+干结 10.8561552143
+一个六十岁 13.900677652
+左思 10.9562386728
+斯坎德 12.1089181827
+莲座 10.5684731418
+强干弱枝 12.1089181827
+双双对 13.900677652
+侦测 10.6818018271
+可察觉 12.8020653633
+王文治 13.2075304714
+苦其心志 12.8020653633
+数遭 12.1089181827
+赫尔姆斯 12.8020653633
+健身 8.86372504956
+七刀 13.900677652
+实测值 12.1089181827
+七分 9.19114745066
+邹容 10.765183436
+无污染 10.0720362555
+信任危机 10.7226238216
+管玉箫 13.900677652
+化学活化 13.900677652
+辣味 10.5684731418
+能进能退 12.8020653633
+邹家 11.2616203224
+孟先生 9.91169360541
+欧洲共同 13.2075304714
+下月初 11.0674643079
+金策 13.900677652
+丝织业 9.77354326693
+锰矿 9.71102290995
+汽轮机 9.48183704418
+一日之功 11.4157710022
+拼图游戏 12.8020653633
+诗论 10.3743171274
+震荡不安 13.900677652
+两路 8.12612610643
+谋略思想 13.900677652
+走街串巷 11.2616203224
+定位精度 11.3357282945
+隋越王 12.5143832909
+古传本 12.8020653633
+勇而无谋 12.8020653633
+水泥船 12.1089181827
+悼念 9.75754292558
+从岩 13.900677652
+米脂 9.56994431169
+被打者 13.900677652
+混纺 10.4666904475
+客家方言 11.5027823792
+独照 13.900677652
+角叉菜 13.900677652
+黑油油 11.0674643079
+金箔 10.4666904475
+运进 10.4994802703
+春光明媚 12.2912397395
+自得 9.85762638414
+滋养品 13.900677652
+陈名夏 8.90346537821
+百分之四十八 12.8020653633
+朱延清 11.1280889297
+六十七岁 13.2075304714
+自律 8.53003962385
+安安稳稳 10.604840786
+显要 10.7226238216
+数部 12.5143832909
+幽美 11.2616203224
+金箍 10.2371160058
+过小宝 13.900677652
+吴楚交 12.8020653633
+前郭尔罗斯蒙古族自治县 11.8212361103
+貂皮帽 13.900677652
+国际都市 13.2075304714
+玉成其事 13.900677652
+首例 9.66657114738
+运达 12.8020653633
+子母弹 10.2897597393
+举步维艰 10.0505300503
+人见人爱 11.7034530746
+侯军 12.5143832909
+白花蛇 10.7226238216
+几厘米 10.533381822
+戎狄渐 13.2075304714
+这辆 8.85082164473
+耐盐性 13.900677652
+运输 6.42250795782
+斯坦科 13.900677652
+好片 13.2075304714
+圣诞礼物 12.5143832909
+冯爷 12.5143832909
+克立 12.5143832909
+好几十年 12.1089181827
+自忖 10.8096351986
+女超人 13.900677652
+食谱 10.2117981979
+黄钟毁弃 13.900677652
+两趟 10.4041700905
+误国 9.91169360541
+曹书佐 13.2075304714
+罚下场 12.8020653633
+王翊 13.2075304714
+显见 9.85762638414
+绝对真理 11.4157710022
+亟欲 13.900677652
+郭外峰 13.2075304714
+边寨 13.2075304714
+晋中地区 12.5143832909
+搁得住 12.8020653633
+全国联网 11.7034530746
+债权者 12.5143832909
+七千 9.89334446674
+首义 11.3357282945
+七十 9.25628675283
+二点钟 13.2075304714
+首乌 11.8212361103
+正步 12.1089181827
+拓殖 11.2616203224
+吴用谏 11.7034530746
+直认不讳 12.8020653633
+花落谁家 12.2912397395
+右后 12.8020653633
+阿利萨 13.900677652
+青衣 9.15574552361
+自带 9.65218240993
+首九 12.8020653633
+蒙迪艾 13.900677652
+青衫 11.8212361103
+紧急状况 12.5143832909
+白敦尔 12.1089181827
+气炸 11.9547675029
+侯健 10.5684731418
+司和考 13.900677652
+恶劣行径 13.2075304714
+边寇 13.2075304714
+锦绣山河 13.900677652
+博尔顿 13.2075304714
+吴雄寺 12.1089181827
+迎难而上 11.0674643079
+步法 10.4041700905
+秦又南 12.8020653633
+七卷 11.1280889297
+宜城镇 12.5143832909
+自幼 7.52906580474
+首七 13.2075304714
+量子数 10.3171587135
+正欢 12.1089181827
+梨花 9.62401153296
+嫁出来 13.900677652
+自干 12.5143832909
+百脉泉 12.8020653633
+三百项 13.2075304714
+缩酮 12.1089181827
+正欲 8.63281949291
+三百顷 12.8020653633
+嘎巴 12.1089181827
+威震天下 11.8212361103
+惨痛 9.82314020807
+候潮 12.2912397395
+茬口 10.9562386728
+金穗 11.4157710022
+德累斯顿 9.87532596124
+隆林各族自治县 11.7034530746
+首个 7.69410172525
+哈特里 12.8020653633
+副总司令 9.82314020807
+李连杰 11.0674643079
+春宫图 11.4157710022
+七匹 13.900677652
+强迫观念 13.900677652
+左慈 11.598092559
+向辽军 12.8020653633
+劫船 13.900677652
+斗鱼 11.5027823792
+田弘正 13.2075304714
+突显 10.4041700905
+震悼 13.2075304714
+守贞 12.2912397395
+二三品 13.900677652
+谗言 9.98865464655
+卡莱斯基 11.2616203224
+贵州籍 12.8020653633
+痛哭流涕 10.3171587135
+沃塞列 13.2075304714
+国民会议 10.6818018271
+首付 8.42421410004
+七发 12.2912397395
+克洛德 11.2616203224
+数里 9.22784881751
+数重 11.9547675029
+宽展 11.0103058941
+七只 10.642581114
+缩醛 10.765183436
+自废 12.1089181827
+钟楼怪人 13.2075304714
+鱼宴馆 12.8020653633
+七口 11.5027823792
+心田 10.8096351986
+吴桂芳 13.900677652
+阿呀 11.9547675029
+天齐庙 13.2075304714
+七古 11.1926274509
+性成熟 9.46986085313
+南丰县 12.1089181827
+八宝山革命公墓 12.2912397395
+守财 13.900677652
+首任 8.95903522937
+七号 9.59661255877
+首份 7.77380846786
+正比 10.3743171274
+互相学习 12.2912397395
+系统总线 12.2912397395
+自建 9.62401153296
+二指 11.598092559
+统筹兼顾 9.94943393339
+韩国三星电子 13.900677652
+双薪 13.2075304714
+信号流图 12.1089181827
+空勤人员 12.2912397395
+正殿 8.5440913773
+抢钱 11.1280889297
+吴军北 12.1089181827
+发喘 12.8020653633
+秋意浓 13.900677652
+千里路 12.2912397395
+哽住 12.1089181827
+凸度 12.5143832909
+发明创造 10.2630914922
+吴白 13.2075304714
+童贯入 13.900677652
+诤臣 12.1089181827
+麦香 12.8020653633
+不怎么样 10.3453295905
+秦帅 13.900677652
+溴苯 12.5143832909
+八千一百一十二尺 13.2075304714
+羡慕 8.01735526349
+太假 12.8020653633
+缩量 8.37522471284
+食货 11.1926274509
+教研室 9.75754292558
+生动性 11.8212361103
+泞泥 13.900677652
+招租 11.7034530746
+两轮 9.14708746087
+运走 9.91169360541
+福威扬 13.2075304714
+石碳酸 13.2075304714
+两车 10.2897597393
+托马索 13.2075304714
+正桥 11.7034530746
+两载 11.8212361103
+第一零三回 13.2075304714
+个人所得税法 11.4157710022
+宜兴 9.33632946051
+以信为本 13.900677652
+竹鞭 13.2075304714
+李宝嘉 12.8020653633
+司号 13.900677652
+断裂力学 11.1280889297
+投鼠忌器 10.4994802703
+侯卫 13.2075304714
+跟党走 11.9547675029
+边壁 12.8020653633
+尼阿克 12.5143832909
+米莱 11.5027823792
+跌荡 13.2075304714
+二十四个 10.5684731418
+衡量 7.36109169636
+条件者 12.1089181827
+黄二 13.900677652
+守身 12.5143832909
+纵饮 13.900677652
+伦特罗 12.5143832909
+宽心 9.08039608637
+便桶 12.8020653633
+弗兰格尔 12.5143832909
+国家计生委 12.8020653633
+元丰 9.31571017331
+责无旁贷 10.4666904475
+遗传操作 12.5143832909
+二十四中 13.900677652
+芬利 13.900677652
+惨相 13.900677652
+七倍 11.4157710022
+祈祷文 12.5143832909
+杨金莲 13.900677652
+运费 9.14708746087
+凭空捏造 12.2912397395
+米苏里 13.900677652
+气旋雨 13.2075304714
+正根 13.2075304714
+政府 4.56927075202
+走漏消息 10.3743171274
+运货 10.4666904475
+拉科律 13.900677652
+正格 13.2075304714
+外事局 12.2912397395
+心黑 11.8212361103
+鉴谅 11.9547675029
+金祯 12.8020653633
+宽得 12.2912397395
+异辛烷 12.8020653633
+平郡王 12.2912397395
+挂不上 12.2912397395
+挂不下 13.2075304714
+边境 7.26080181815
+汝何敢 11.9547675029
+西塔尔琴 13.900677652
+边墙 10.2897597393
+赤藓糖 12.1089181827
+不落窠臼 12.5143832909
+梨膏 12.5143832909
+牧马图 13.2075304714
+抽咽 10.2117981979
+聂毓禅 13.2075304714
+左手 7.61096208107
+两千五百万英镑 12.8020653633
+刻意经营 13.900677652
+那还用说 10.9562386728
+文理不通 13.900677652
+整体素质 10.6818018271
+诗书画 11.9547675029
+那伙子 13.2075304714
+花名册 10.2371160058
+瑞士法郎 10.4349417492
+湘西自治州 13.2075304714
+亲上做亲 12.8020653633
+冗官 10.9049453784
+辽南 10.4994802703
+元亨 12.1089181827
+婆罗门 9.31571017331
+竭尽忠诚 13.2075304714
+于律文 12.8020653633
+壶里 10.8096351986
+功成名遂 13.900677652
+运距 11.9547675029
+两连 11.8212361103
+元人 10.1630080337
+米茨 12.8020653633
+曹传信 13.2075304714
+吴用 7.90671622467
+边塞 9.59661255877
+专此 12.8020653633
+气谊相投 13.900677652
+想约 13.2075304714
+金福 11.9547675029
+总干事 9.69598503258
+愁怀 12.5143832909
+左拳 13.2075304714
+愁颜 13.2075304714
+惨白 9.17328983326
+边堡 11.8212361103
+李二相 12.8020653633
+力挽狂澜 10.2897597393
+自己 3.52303883354
+自已 9.37888907493
+高学历 11.2616203224
+费兹哥 13.900677652
+文艺家 12.8020653633
+二千斤 12.2912397395
+天然碱 10.2371160058
+两边 7.07630398193
+酒精厂 13.2075304714
+环境友好 9.93038573842
+金科 11.3357282945
+辽北 11.2616203224
+变动率 11.9547675029
+红层 9.71102290995
+呱呱坠地 12.1089181827
+冯宝妻 13.2075304714
+两辆 9.08039608637
+预决算 11.8212361103
+正梁 13.900677652
+酥脆 10.8561552143
+产品名 13.900677652
+金秀 9.56994431169
+左拉 10.604840786
+宽式 13.2075304714
+防疫针 12.8020653633
+元件 8.33233314821
+七克 13.2075304714
+自尽 8.16733637508
+公司章程 9.25628675283
+弘景 13.900677652
+渡鸦 12.8020653633
+七元 11.8212361103
+杨金英 13.2075304714
+抢险 10.1164880181
+深海鱼 12.2912397395
+特姆尔 13.2075304714
+鉴赏 9.54396882529
+周生贤 12.5143832909
+酥胸 11.598092559
+肉汁 12.2912397395
+唤起 8.9519177616
+人身自由 9.61021821083
+正楷 11.4157710022
+朔漠 11.4157710022
+七八 9.12155415886
+司勋 13.2075304714
+忘记掉 11.9547675029
+高级将领 9.84023464143
+蜃景 13.2075304714
+米芾 10.2630914922
+斗鸡 10.9562386728
+金砖 9.4233408375
+独独 10.3743171274
+挂不住 10.533381822
+厚道人 11.8212361103
+绉褶 13.2075304714
+和爱珍 12.5143832909
+自小 9.18217878068
+维捷布斯克 13.2075304714
+东张西望 9.82314020807
+哄过 11.9547675029
+王疯子 12.8020653633
+七具 13.2075304714
+肉汤 10.7226238216
+红儿扶 13.2075304714
+罗波安 13.2075304714
+人力不足 13.2075304714
+那萨沙 13.2075304714
+越学越 12.8020653633
+司务 10.5684731418
+中华全国体育总会 11.5027823792
+暂时中止 12.8020653633
+宽度 7.96578345636
+米苏 13.2075304714
+订货单 12.8020653633
+珀尔 12.1089181827
+侯刘 12.1089181827
+上下同心 12.5143832909
+小恩子 13.2075304714
+奇文 12.1089181827
+那阵儿 10.642581114
+录像机 10.2117981979
+唯唯诺诺 10.2897597393
+好几株 12.8020653633
+第六十篇 13.2075304714
+不改其 12.5143832909
+赫斯特 10.4666904475
+好几样 13.2075304714
+龙华寺 12.1089181827
+自居 8.93783302172
+周行逢 12.2912397395
+气象专家 11.7034530746
+好几根 12.5143832909
+施剑翘 13.900677652
+独具慧眼 11.1926274509
+互助会 11.3357282945
+侯勇 12.8020653633
+宽广 8.42421410004
+诗行 11.4157710022
+郑下寨 13.2075304714
+十大类 12.1089181827
+金碧 10.9562386728
+卡尔瓦尔 13.2075304714
+消毒液 11.598092559
+于东邻 13.2075304714
+凤山溪 13.2075304714
+吴琼 11.8212361103
+中转站 9.98865464655
+金碗 11.7034530746
+司前 11.4157710022
+人民军队 9.27570483869
+吴琳 12.2912397395
+宽幅 8.37522471284
+七出 11.5027823792
+海蚀洞 11.8212361103
+好几棵 12.8020653633
+企业职工 10.1394775363
+黑索今 13.900677652
+左掌 12.1089181827
+周行郡 12.8020653633
+独特 6.56439199195
+古典名著 11.598092559
+罗伯特 8.88339781516
+两身 12.2912397395
+七册 13.900677652
+编校 11.7034530746
+松松垮垮 10.9049453784
+公谏录 12.2912397395
+棱镜 10.1630080337
+若神 13.900677652
+宽带 9.61021821083
+束兵秣马 13.900677652
+潘凤霞 12.8020653633
+心齐 11.7034530746
+一公顷 12.2912397395
+通过率 10.3743171274
+愚笨 10.9049453784
+右图 11.2616203224
+抱成 12.8020653633
+协查通报 13.2075304714
+徘徊不前 11.0674643079
+米色 10.6818018271
+纽西兰 13.2075304714
+正字法 12.8020653633
+陈妈 13.900677652
+名不见经传 10.533381822
+任引军 13.2075304714
+电子战 9.07236391467
+小开 13.2075304714
+哥窑 11.2616203224
+拉法尔 12.5143832909
+边外 11.1926274509
+两腮 10.3171587135
+运动鞋 10.7226238216
+登山涉水 12.5143832909
+初生牛犊 11.8212361103
+谢皇恩 11.4157710022
+煎蛋卷 13.900677652
+多胎 11.9547675029
+体己 9.69598503258
+两腿 8.74738605748
+下行列车 13.900677652
+长篇小说 7.79588441956
+养新录 13.2075304714
+首都博物馆 13.900677652
+混合材料 13.2075304714
+听者有心 13.2075304714
+西行漫记 12.2912397395
+边围 13.2075304714
+拉法叶 13.2075304714
+共同市场 10.6818018271
+结为夫妇 11.3357282945
+邹城 12.2912397395
+丙烷 10.0940151622
+双行 10.642581114
+世界史 10.3453295905
+金真 13.900677652
+并行度 13.2075304714
+总结经验 10.4666904475
+四十八条 12.5143832909
+混同于 11.8212361103
+英雄主义 10.5684731418
+全部摊 12.5143832909
+两腔 12.5143832909
+势不并立 13.900677652
+七年 7.20240959786
+拉斯韦加斯 11.5027823792
+抖搂 11.5027823792
+甾类 13.900677652
+正是 5.26605704368
+寒芳 13.2075304714
+石英玻璃 11.2616203224
+食肉 9.44633035572
+自卫 8.26232298264
+关彝 13.900677652
+食肆 12.2912397395
+愁城 13.900677652
+毕公高 12.5143832909
+心部 12.5143832909
+正明 11.9547675029
+七席 13.900677652
+自卖 10.4666904475
+二三天 11.5027823792
+新气象 10.533381822
+左江 10.9562386728
+海珠屿 13.900677652
+两脚 9.25628675283
+实力派 9.85762638414
+心都 10.2897597393
+原六镇 13.2075304714
+瓦纳人 13.900677652
+拜把兄弟 12.1089181827
+城轨 11.3357282945
+酥软 11.0674643079
+万卷书 11.5027823792
+宁著 13.900677652
+外事办 13.900677652
+中国大学 10.8096351986
+特拉斯 10.4041700905
+宜黄县 13.2075304714
+青藤 11.8212361103
+心通 13.900677652
+直属机关 11.7034530746
+滑动轴承 11.0674643079
+上床睡觉 10.765183436
+请先 11.5027823792
+贸然 8.23771717184
+抖擞 10.2630914922
+胡秉宸 6.32202080138
+挽诗 11.9547675029
+鲍勃 11.598092559
+急赤白脸 13.900677652
+美国股市 8.11071748108
+两臂 9.4233408375
+连金子 13.900677652
+电子流 11.7034530746
+藏风聚 11.2616203224
+米质 12.2912397395
+山李忠 13.900677652
+石达开 10.604840786
+万佛洞 11.4157710022
+挽词 11.9547675029
+上部 7.81163277653
+生活态度 10.9562386728
+证见 8.94485059437
+金石 8.9308643524
+草率行事 13.900677652
+斗量 11.8212361103
+侯选者 13.900677652
+金矿 8.31342899358
+非法占有 11.3357282945
+庇护所 12.2912397395
+五百多位 13.2075304714
+七庙 12.2912397395
+别来 10.7226238216
+无所事事 10.0720362555
+江岸区 13.900677652
+自古 7.35676580641
+酱紫色 12.1089181827
+食者 10.9562386728
+逻辑学家 10.1164880181
+费希尔 11.0674643079
+遗传变异 11.1926274509
+自叙 11.5027823792
+心地善良 10.642581114
+休眠 9.91169360541
+饿过 13.2075304714
+自取 10.2117981979
+奴役 8.65893063692
+七座 10.9562386728
+自发 8.18036587537
+好多个 12.2912397395
+很旧 11.2616203224
+好几架 13.2075304714
+自反 13.2075304714
+双边条约 11.598092559
+凼仔岛 12.1089181827
+寒舍 10.4994802703
+纺锤形 9.44633035572
+喜怒无常 10.4666904475
+心醉 11.598092559
+无仁无义 13.2075304714
+青葱 8.84443184663
+朱庇特 12.2912397395
+全部整 13.900677652
+自制 8.87679713113
+自到 10.4041700905
+正来 11.1926274509
+自刭 12.8020653633
+双流县 13.2075304714
+路北口 13.900677652
+早餐会 11.8212361103
+聚氧乙烯醚 13.900677652
+边境线 10.8096351986
+邓小平理论 9.71102290995
+五六十米 12.2912397395
+七彩 10.765183436
+断代 10.0294766411
+自创 10.6818018271
+最低温度 10.0940151622
+古儿汗 12.8020653633
+自刎 9.49395840471
+妖艳 10.9562386728
+愚痴 12.2912397395
+两联 12.5143832909
+时仁宗 12.8020653633
+寒菊 13.900677652
+赵小兰 13.900677652
+鼻青眼肿 12.8020653633
+心野 12.8020653633
+心重 11.2616203224
+心里 5.04174043001
+茹素 13.2075304714
+惯性作用 11.9547675029
+蜀汉 9.72629038208
+克山县 13.2075304714
+侯封 12.8020653633
+副区长 10.6818018271
+国务委员会 10.1630080337
+特里谢 9.84023464143
+误字 13.2075304714
+郎希 13.2075304714
+晒衣绳 13.2075304714
+两耳 10.3171587135
+买房子 9.62401153296
+临死 9.44633035572
+断交 10.1630080337
+莲叶 10.9562386728
+正月 7.68207753228
+莲台 10.5684731418
+平躺着 12.8020653633
+两者 6.86540905269
+刑薄赋 13.2075304714
+显著 6.8122688733
+伯斯特 12.8020653633
+青萍 11.2616203224
+护色剂 13.900677652
+君子国 13.900677652
+正朔 11.1280889297
+四十余年 11.3357282945
+双解 12.1089181827
+于河阳 12.8020653633
+边坡 10.5684731418
+阿克萨 13.900677652
+断乎 10.6818018271
+沉吟不决 13.2075304714
+自励 11.9547675029
+陈晓旭 13.900677652
+辣妹 13.900677652
+自动 6.48129706906
+自助 9.74179456862
+含冤而死 12.2912397395
+中间层 10.9049453784
+正柱 13.2075304714
+天然矿 12.8020653633
+宫一府 13.2075304714
+两胎 12.2912397395
+温觉 11.8212361103
+自办 9.91169360541
+用户意见 13.2075304714
+攀枝花 10.0294766411
+埃特里 13.900677652
+自力 11.5027823792
+青蓝 11.5027823792
+司局 11.1926274509
+肤浅 9.93038573842
+液压缸 11.598092559
+凭栏远眺 12.2912397395
+库尔德人 11.1280889297
+银箔纸 13.900677652
+两胜 12.8020653633
+侯峻 13.900677652
+金色池塘 12.5143832909
+断乳 12.8020653633
+利拉琴 12.2912397395
+胡秉安 10.642581114
+铀矿 9.4233408375
+七律 9.87532596124
+大栗树 11.9547675029
+惨祸 10.4666904475
+杨祖希 12.2912397395
+断七 12.8020653633
+两肩 11.0103058941
+金相 11.5027823792
+青蒿 11.1926274509
+朝日新闻 11.2616203224
+两股 9.19114745066
+忘我境界 13.900677652
+知音者 12.8020653633
+讲礼貌 13.2075304714
+幽独 13.900677652
+安安定定 13.900677652
+审计员 13.2075304714
+焚膏继晷 13.900677652
+外事司 13.900677652
+盒式 11.4157710022
+两肋 11.0674643079
+天线罩 11.8212361103
+青蒜 13.900677652
+正极 10.3453295905
+步态 10.4666904475
+沙浴 13.900677652
+草船借箭 12.1089181827
+误导 8.99540287354
+自勉 11.9547675029
+正果 9.32596667347
+疾病相关 13.900677652
+不忍卒读 13.2075304714
+自觉遵守 10.8561552143
+建言献策 11.0674643079
+平顶山 8.74162235276
+金田 11.7034530746
+金甲 10.0294766411
+教研员 13.2075304714
+落下灰 12.5143832909
+七层 10.9049453784
+甘溪港 12.8020653633
+译制片 13.2075304714
+费工夫 11.1280889297
+超二倍体 13.900677652
+魏皆取 13.2075304714
+宽口 13.2075304714
+守节 10.765183436
+王继 10.6818018271
+吴禄 10.9562386728
+吴禅 13.2075304714
+吉科宁 12.5143832909
+反浪费 12.2912397395
+残积层 13.2075304714
+送还到 13.900677652
+狼毒 12.5143832909
+铺摊 13.900677652
+酰亚胺 11.8212361103
+陈玉娘 13.2075304714
+想爱 12.8020653633
+二合一 12.1089181827
+健胃 10.533381822
+盖嘉运 13.2075304714
+劫走 10.9562386728
+穆阿莱 13.2075304714
+王绪 12.2912397395
+沅陵 10.604840786
+小田 11.0103058941
+伪品 12.1089181827
+热载体 13.2075304714
+七尊 13.2075304714
+两茬 12.2912397395
+王合丹 12.5143832909
+试开 13.900677652
+肉感 12.1089181827
+自养 10.2371160058
+巴监藏 12.2912397395
+七封 13.900677652
+数次回 13.900677652
+高深莫测 11.1926274509
+运输机 8.1902506346
+熟睡中 12.1089181827
+数百万平方米 13.2075304714
+向斯万 13.900677652
+好几支 11.5027823792
+由其弟 12.2912397395
+挂回来 13.900677652
+宽厚 9.16447920358
+八国集团 12.5143832909
+七尺 10.1164880181
+乡曲 12.8020653633
+银饰品 13.2075304714
+七尾 13.2075304714
+名列榜首 11.1926274509
+司徒 8.85082164473
+倜傥不群 13.900677652
+轧钢机 12.8020653633
+碘酊 13.2075304714
+运至 9.6811699468
+篆体 11.598092559
+沙沟 12.5143832909
+相对湿度 9.55687223012
+香蕈 11.598092559
+半月谈 12.2912397395
+托忒文 13.2075304714
+周宣帝 13.2075304714
+范德维 12.5143832909
+自决 10.533381822
+为数不少 10.1164880181
+黄绿光 13.900677652
+碘酒 11.1926274509
+混炼 11.5027823792
+茹维 12.5143832909
+金疮 11.0103058941
+一买一卖 12.8020653633
+好几日 12.1089181827
+证认 11.7034530746
+代州雁 12.2912397395
+害农 12.8020653633
+薄树人 13.2075304714
+四十八日 13.2075304714
+得意非凡 12.2912397395
+碘酸 13.2075304714
+中原逐鹿 12.5143832909
+宗咸雍 12.5143832909
+七峰 13.900677652
+二三寸 12.8020653633
+右室 12.5143832909
+咏雪 13.2075304714
+萨列里 12.5143832909
+子王嫱 13.2075304714
+玉枕 12.5143832909
+七岁 9.65218240993
+白鼻子 13.900677652
+证词 9.38981814546
+戚家军 11.3357282945
+青螺 11.5027823792
+猜猜看 11.9547675029
+脸皮嫩 13.900677652
+侦探 10.3743171274
+说闲话 9.55687223012
+饱食 10.4041700905
+侦控 12.8020653633
+队商 13.900677652
+陈夕 13.900677652
+左光先 10.3171587135
+马荣 12.8020653633
+幽燕 10.0088573539
+败酱草 12.8020653633
+好几斤 13.900677652
+汝父 11.1926274509
+专用设备 10.0720362555
+番红花 12.1089181827
+付之流水 12.1089181827
+相色谱 11.4157710022
+拜偶像 12.8020653633
+入境签证 13.2075304714
+垣曲县 12.5143832909
+白烟喷 13.900677652
+人烟凑集 12.8020653633
+四十八斤 13.900677652
+望闻问切 11.5027823792
+蒋廷锴 13.2075304714
+吴祥 9.61021821083
+独缺 13.2075304714
+碱式碳酸铜 13.2075304714
+证言 10.642581114
+金琴 13.900677652
+老通城 13.900677652
+治安机关 13.900677652
+区域开发 11.8212361103
+稳定情绪 11.5027823792
+梁必业 13.900677652
+凡士林 11.1926274509
+洋快餐 12.5143832909
+罚没 11.5027823792
+力拔山兮 13.900677652
+霍亨施 11.9547675029
+跋履山川 13.900677652
+廿六日 11.4157710022
+难分难舍 11.5027823792
+伊斯灵 13.2075304714
+正数 10.3743171274
+丧身 11.7034530746
+格兰德 11.9547675029
+溧水 11.3357282945
+转变职能 13.900677652
+数控机械 13.900677652
+碱式碳酸锌 13.2075304714
+请出 10.4666904475
+内部矛盾 9.13850371718
+金球 12.8020653633
+三千八百米 13.900677652
+马亚圭 13.900677652
+瑙曼 12.5143832909
+两艘 9.07236391467
+舍死忘生 11.598092559
+幽灵 8.43684584695
+牛力尽 13.2075304714
+陈奎一一 12.8020653633
+安装工人 13.900677652
+砂仁 10.4041700905
+水泥路 12.5143832909
+遮盖起来 11.3357282945
+特拉普 12.8020653633
+这身 9.30555780184
+散点图 13.2075304714
+铺放 12.1089181827
+器物 8.29120585679
+感性运动 12.8020653633
+两船 10.4666904475
+项目表 13.900677652
+民族语 12.5143832909
+行政监察 12.5143832909
+储油区 13.900677652
+乞命 11.8212361103
+独钟 12.8020653633
+链球菌 9.91169360541
+皮拉波 13.2075304714
+底定 11.5027823792
+丘伦 13.2075304714
+金瑞 10.4666904475
+财产清查 13.900677652
+七百五十万 12.8020653633
+伪善 10.3171587135
+司库 11.1280889297
+辣子 10.0088573539
+魏侍郎 13.2075304714
+常平仓 10.765183436
+行踪不定 12.8020653633
+延河水 12.8020653633
+粒选 13.900677652
+中共中央顾问委员会 10.8561552143
+大事记 10.5684731418
+双语 11.5027823792
+正旦 10.0294766411
+呆滞 9.69598503258
+运能 11.5027823792
+青蛤 13.2075304714
+值得称赞 12.2912397395
+世界华人 13.2075304714
+复合词 11.3357282945
+提溜 11.1926274509
+食草 11.0103058941
+请坐下 11.598092559
+降回到 13.2075304714
+活过来 10.1394775363
+柯策布 13.2075304714
+民事诉讼 9.30555780184
+正时 10.3743171274
+润身 13.900677652
+通江子 12.5143832909
+天衣无缝 10.3171587135
+陈谷子烂芝麻 12.2912397395
+齐首 13.900677652
+丘俭 13.2075304714
+仆从国 11.5027823792
+惨笑 11.8212361103
+砚池 12.8020653633
+连心桥 12.5143832909
+照抄 10.8561552143
+篆书 9.75754292558
+尊贵型 11.9547675029
+凝灰岩 10.4041700905
+民妻 13.900677652
+可喜局面 13.2075304714
+宿卫者 12.8020653633
+向太后 10.2371160058
+队员 7.82763311788
+下学期 11.5027823792
+隔离霜 13.2075304714
+正方 11.3357282945
+健脾 9.0884932966
+井冈山 9.43476953332
+好人主义 12.8020653633
+铜臭味 13.900677652
+七十步 13.2075304714
+金瓯 11.0103058941
+一百五十万英镑 13.900677652
+八字胡 11.598092559
+蒲葵 12.5143832909
+咫尺天涯 11.5027823792
+四万两 11.9547675029
+禹鼎 13.2075304714
+艾伯塔 13.2075304714
+格罗莫夫 13.2075304714
+两节 10.4041700905
+金瓜 10.6818018271
+幼年土壤 13.900677652
+创面 10.4994802703
+无名小辈 13.2075304714
+热噪声 12.5143832909
+王韩信 13.2075304714
+磁谱仪 13.900677652
+健脑 11.1926274509
+酒精度 12.5143832909
+庞培兵 13.2075304714
+泰穆尔 13.900677652
+卢梅利 13.2075304714
+幸长安 13.2075304714
+金猴 12.5143832909
+独秀 11.1926274509
+从旁协助 12.5143832909
+颜如玉 12.8020653633
+房出租 11.7034530746
+天然物 12.8020653633
+左校 12.5143832909
+器用 10.8561552143
+拉法基 13.2075304714
+自在 8.55834340001
+势均力敌 10.2630914922
+友人 9.21854642485
+金猫 10.604840786
+霍丘县 13.2075304714
+教养员 13.900677652
+债利 13.900677652
+正手 12.2912397395
+麦道 9.44633035572
+剃头发 13.2075304714
+肉松 11.598092559
+煤气厂 11.9547675029
+数项 11.1926274509
+卡斯蒂亚 12.8020653633
+熔解热 12.8020653633
+女道士 11.0674643079
+氨基脲 12.8020653633
+肉条 12.2912397395
+二百四十五 13.2075304714
+可人 9.82314020807
+次极大 12.8020653633
+一百多万平方公里 13.2075304714
+工资分 13.900677652
+十多位 13.2075304714
+万千重 12.8020653633
+葛优 12.2912397395
+慢化剂 12.2912397395
+沙家店 12.5143832909
+队友 9.94943393339
+邹县 10.9562386728
+克特 11.0103058941
+两辆车 10.3171587135
+伪劣 12.1089181827
+肉机 13.2075304714
+闻其声 12.8020653633
+双轨制 10.4666904475
+湿法 10.4666904475
+鲍嘉 12.5143832909
+宗咸通 12.2912397395
+穿堂 10.7226238216
+肉末 11.5027823792
+工资制 11.7034530746
+迸流 10.642581114
+精神疾病 10.9562386728
+土木建筑 10.9562386728
+铺成 10.4994802703
+红影 13.900677652
+塑造出 10.7226238216
+多功能厅 13.900677652
+贺鲁之 12.8020653633
+古丽巴哈尔 13.900677652
+柯蒂斯 11.5027823792
+创通 11.3357282945
+金玺 11.9547675029
+窘色 13.2075304714
+货船 10.1394775363
+罗契斯 13.2075304714
+鹿黑娃 11.9547675029
+伦敦希思罗机场 13.900677652
+西丽玛沃 13.900677652
+外籍华人 12.5143832909
+信访部门 11.9547675029
+嘎吱 10.533381822
+子王岩 13.2075304714
+步数 11.9547675029
+金环 10.8561552143
+红了眼 10.2371160058
+集结地 11.9547675029
+队医 13.900677652
+名位 10.2117981979
+如风过耳 13.2075304714
+湿气 10.2630914922
+平大怒 12.2912397395
+缩颈 11.3357282945
+越王勾践 10.1871055853
+创造 5.83541244308
+金玄 13.2075304714
+产品化 13.2075304714
+试飞员 12.1089181827
+名作 9.37888907493
+煤气化 10.1871055853
+从头至尾 10.2371160058
+司天 11.3357282945
+货色 9.87532596124
+两重意义 12.5143832909
+躺卧 11.5027823792
+数额 7.73316116109
+鼎分三足 13.2075304714
+金珠 9.46986085313
+名伶 12.2912397395
+剃头匠 10.9562386728
+奔丧 10.0940151622
+幡然悔悟 13.2075304714
+国际劳工局 12.8020653633
+蒲草 10.3453295905
+三百里 10.4349417492
+区域间 11.1280889297
+徒有其名 11.0674643079
+一九八四年 11.8212361103
+挽辞 13.900677652
+熨帖 11.7034530746
+斗门 11.4157710022
+时儿 12.8020653633
+计算出来 10.533381822
+生身父母 11.7034530746
+万尊 12.2912397395
+江瑶 13.2075304714
+单翼飞机 13.2075304714
+超数排卵 13.2075304714
+名优 10.5684731418
+凝香 13.900677652
+十多丈 11.9547675029
+今瑜 13.2075304714
+猫儿腻 12.1089181827
+双赢 9.65218240993
+正据 13.900677652
+二三层 12.1089181827
+那阵子 9.72629038208
+赫伦施 13.2075304714
+民女 10.0940151622
+自嘲 9.46986085313
+十多万 10.5684731418
+米袋 11.7034530746
+千山万壑 12.2912397395
+冲积平原 7.99804431857
+布努艾尔 11.7034530746
+工资单 11.598092559
+开花结果 10.4041700905
+湿润 7.23244940356
+瓦伊莱 12.5143832909
+金爪 11.7034530746
+商有量 13.900677652
+七孔 11.9547675029
+青联 11.9547675029
+十多个 9.53122979951
+工资卡 11.9547675029
+房贷利率 8.95903522937
+结草衔环 11.7034530746
+地自雄 12.5143832909
+共下 13.900677652
+在线提交 13.2075304714
+学生守则 12.5143832909
+固定收入 11.0674643079
+专案 10.1871055853
+日照港 10.765183436
+名仓 13.900677652
+大伙儿 8.87679713113
+当事者 10.8561552143
+显考 12.5143832909
+显者 13.900677652
+好几批 12.8020653633
+名产 9.66657114738
+纳盐 13.2075304714
+诗节 13.2075304714
+冲击疗法 12.8020653633
+金特 12.1089181827
+边厢 11.1926274509
+润泽 9.74179456862
+协方差 12.8020653633
+王莽篡汉 12.1089181827
+吴绍 13.2075304714
+预警系统 11.5027823792
+人权思想 12.8020653633
+借帐 13.2075304714
+现用 9.63799777493
+名人 8.22050504296
+十死九活 13.900677652
+反面人物 11.8212361103
+庞巴迪 11.598092559
+宇航员 9.26594866375
+全民投票 12.2912397395
+混着 10.9049453784
+金牙 7.56917580208
+行使权力 10.765183436
+金牛 9.43476953332
+万寿路 13.900677652
+三十五公里 13.900677652
+好几户 12.2912397395
+纳杰夫 12.2912397395
+显职 11.9547675029
+脑下垂体 11.0674643079
+仍会 8.08059472162
+秦官 12.8020653633
+不懈努力 10.2371160058
+二三尺 11.598092559
+心间 10.9049453784
+朴贞 9.41204128224
+欢喜岭 10.4994802703
+取齐 10.604840786
+名书 12.2912397395
+马宗达 13.900677652
+朔方 9.43476953332
+队列 9.55687223012
+双路 13.900677652
+住房问题 10.0940151622
+李家坪 12.5143832909
+加速性 11.598092559
+刺激法 12.5143832909
+青翠欲滴 13.2075304714
+十多亩 12.5143832909
+瞩望 11.8212361103
+右岸 8.74162235276
+返还 8.74738605748
+苹果公司 11.5027823792
+房克尔 13.900677652
+临去 11.3357282945
+名义 6.73905564904
+踵至 13.2075304714
+窝工 13.2075304714
+七对 13.2075304714
+七寸 10.6818018271
+队别 13.900677652
+犯科 13.900677652
+朴质 12.1089181827
+十多亿 13.900677652
+剪灭 12.8020653633
+叶嘉莹 13.2075304714
+紧密度 13.900677652
+诗艺 11.1926274509
+固沙 10.5684731418
+相位差 10.6818018271
+数首 13.2075304714
+显能 11.9547675029
+练过 11.1280889297
+南浦大桥 11.2616203224
+好几把 12.5143832909
+嘎啦 12.2912397395
+响彻云霄 12.1089181827
+高丽沈 13.2075304714
+边区 8.87023973058
+七宝 10.2630914922
+米行 13.2075304714
+资源量 9.66657114738
+爹妈 9.98865464655
+七宗 12.8020653633
+名主 12.5143832909
+金狮 11.598092559
+卡彭特 13.900677652
+树上 7.58894284282
+百折不挠 11.598092559
+羞恶之心 12.8020653633
+桂圆汤 12.5143832909
+盛名之下 12.2912397395
+名下 8.92394390956
+福陵山 11.8212361103
+陈列柜 11.598092559
+相机而动 13.2075304714
+高辛氏 12.1089181827
+演得 10.5684731418
+抢鲜 13.900677652
+正排 11.7034530746
+空钟 12.2912397395
+七家 10.1394775363
+铺排 10.1394775363
+金焰 11.598092559
+失之交臂 10.7226238216
+误将 12.5143832909
+误射 13.900677652
+大渡河 9.12999302751
+鱼雷艇 10.0505300503
+罗沛霖 13.900677652
+亚磷酸 12.8020653633
+一口咬定 9.85762638414
+秦宙 13.2075304714
+明察秋毫 11.1926274509
+把脉 10.1394775363
+育种 8.87023973058
+伍伦贡 13.2075304714
+队内 12.2912397395
+第七位 10.4666904475
+市侩气 13.2075304714
+乒乓球队 12.2912397395
+全部打 11.8212361103
+覆去翻来 13.900677652
+株州 13.2075304714
+完城旦 11.7034530746
+九连 12.5143832909
+哩噜 13.900677652
+广发卡 13.900677652
+举足轻重 8.89004235788
+房玄龄 10.2117981979
+司寇 10.4041700905
+抄斩 12.8020653633
+司察 12.8020653633
+吉凶难料 11.4157710022
+保持架 13.900677652
+泄水道 11.9547675029
+宽城 12.2912397395
+青草 8.74738605748
+每首歌 12.8020653633
+司宪 12.8020653633
+类风湿 11.3357282945
+青茶 11.7034530746
+宋幼帝 12.8020653633
+古运河畔 13.900677652
+波波卡特佩特 13.900677652
+步枪 7.80710788193
+玉米花 13.900677652
+正急 10.9049453784
+鲍吴 12.8020653633
+田中谦 13.2075304714
+黄疸型 12.1089181827
+全塞 12.5143832909
+显荣 13.900677652
+黄河口 10.9049453784
+全盘皆输 12.5143832909
+栩栩 12.1089181827
+奥柔拉 12.8020653633
+源委 13.2075304714
+速度空间 12.2912397395
+两男两女 12.5143832909
+何面目 12.1089181827
+联系人 9.7898037878
+万事兴 13.900677652
+作死 11.5027823792
+朝朝夕夕 13.900677652
+辍演 12.2912397395
+司官 11.5027823792
+彼得大帝 10.0720362555
+辽宁 7.41451686303
+布罗肯 12.8020653633
+侯嬴 13.900677652
+七堵 12.5143832909
+可会 10.9562386728
+老年学 12.2912397395
+家居生活 12.1089181827
+土壤退化 13.2075304714
+源头 8.06586691491
+自喻 13.900677652
+丛丛 11.1926274509
+自喷 12.5143832909
+李若凡 13.2075304714
+杭铁头 13.900677652
+侦查 8.98069672615
+城西 8.63798746307
+正想 8.33233314821
+财政赤字 8.83177344976
+婚姻自主 11.1280889297
+鼻出血 10.8096351986
+嘎嘎 9.84023464143
+老房子 10.3743171274
+青菜 9.36807815882
+屁用 10.2897597393
+法国巴黎大学 10.9049453784
+揪住 8.47572763449
+心阳 11.8212361103
+刘朴 10.8561552143
+七声 10.9049453784
+丛中 8.61241062128
+宗三僧 12.8020653633
+贵州省 8.48903160012
+百富勤 12.2912397395
+二话不说 9.72629038208
+猜猜猜 13.900677652
+双身 13.2075304714
+杨用 10.642581114
+张士德 12.5143832909
+抖抖 9.6811699468
+侯官 10.7226238216
+制糖 8.03138073884
+自由心证 12.1089181827
+帕竹噶 13.2075304714
+俄国人 8.74738605748
+马格里布 10.9049453784
+君子兰 11.5027823792
+联合政府 8.77077893705
+边倚 13.2075304714
+运动器材 13.2075304714
+丛书 8.56795885871
+诱导性 13.900677652
+绝妙好辞 13.2075304714
+侯家 11.0103058941
+双车 13.2075304714
+龚照 12.8020653633
+氰化氢 12.2912397395
+青色 8.84443184663
+潜心笃志 13.900677652
+双轮 9.74179456862
+政治觉悟 11.0674643079
+独立 5.48131782091
+双轨 10.3171587135
+混用 10.2897597393
+双轴 10.4994802703
+肉摊 13.900677652
+马佐夫 11.7034530746
+七套 11.7034530746
+外方内圆 13.900677652
+芦荟汁 12.8020653633
+冉冉升起 11.1280889297
+母至孝 13.2075304714
+临邑县 13.2075304714
+朔望 11.598092559
+雷诺兹 11.598092559
+银河倒泻 13.2075304714
+金瀚 12.8020653633
+科拉水 13.900677652
+二三年 10.604840786
+硬纸板 12.2912397395
+平边策 12.2912397395
+汝矣 12.8020653633
+姑舅 10.9049453784
+地狱之火 13.2075304714
+自命 10.3171587135
+提高觉悟 12.8020653633
+显色 11.598092559
+债务 6.41294389054
+返贫 13.2075304714
+肉搏 10.4666904475
+运营 6.90308166899
+紧密层 12.5143832909
+想着 6.19631648407
+运输户 13.2075304714
+七夕 10.642581114
+六十七块 13.2075304714
+尼韦尔 13.900677652
+七天 9.16447920358
+栾布 13.2075304714
+先下手 11.5027823792
+发表文章 9.5186510173
+伪军 8.34384959028
+拉曼特 13.2075304714
+那亚河 12.8020653633
+正愁 10.4994802703
+非生产 9.54396882529
+张家界市 11.598092559
+李秀成 10.604840786
+阿克苏 9.36807815882
+边写 13.2075304714
+边军 12.2912397395
+制氧机 11.7034530746
+心音 10.6818018271
+调停者 12.1089181827
+第七个 9.87532596124
+七头 13.900677652
+几十万颗 12.5143832909
+器皿 8.73019365694
+显花 13.2075304714
+无法形容 11.7034530746
+编纂 8.01457362053
+肌质 13.900677652
+来来去去 10.3743171274
+闽中 11.0103058941
+曹子正 11.2616203224
+高怀昌 12.8020653633
+边关 10.7226238216
+为数不多 9.02548032877
+边兵 10.9562386728
+双翅 10.604840786
+青苔 10.642581114
+糖尿病足 11.8212361103
+青苗 10.4349417492
+库施 11.3357282945
+天理难容 12.1089181827
+旮旯 10.765183436
+唱山歌 11.8212361103
+狭长地带 10.4041700905
+第七任 12.2912397395
+并联式 13.900677652
+熬过去 12.2912397395
+第七代 12.1089181827
+保罗三世 12.5143832909
+双连 13.900677652
+全身心 10.3743171274
+苏尼特左旗 13.900677652
+辣得 11.1280889297
+躺倒 9.72629038208
+德克萨斯州 11.598092559
+青花 9.80633308975
+余万股 11.8212361103
+资金平衡 13.900677652
+徒步走 12.8020653633
+甘肃河西走廊 11.3357282945
+红点颏 13.2075304714
+心静 11.2616203224
+吉林市 10.0940151622
+画虎不成 13.2075304714
+心非 13.900677652
+边儿 10.3453295905
+塔尔马 13.2075304714
+双辽 11.8212361103
+共欣赏 13.900677652
+双边 8.65893063692
+角化层 13.2075304714
+尝试性 11.3357282945
+八股文 10.1164880181
+石斑鱼 11.0103058941
+红枣汤 13.900677652
+美军方 12.1089181827
+误工 11.8212361103
+庭院 8.34771806705
+第十二次 9.80633308975
+三千面 13.2075304714
+简易型 13.900677652
+全接触 13.2075304714
+高顺亦 13.2075304714
+闽东 10.1164880181
+仪表仪器 13.2075304714
+大飞翼 13.900677652
+簰洲镇 11.9547675029
+扔出 10.6818018271
+调合漆 13.900677652
+弗里尔 12.8020653633
+转筋 11.5027823792
+代码段 12.8020653633
+瓦尔代 12.1089181827
+礼炮 10.5684731418
+开发智力 12.5143832909
+北京大学图书馆 11.598092559
+低年 13.900677652
+和瑟斯 13.900677652
+利尔 10.8561552143
+鲁文佐 13.900677652
+电板 12.2912397395
+王刘谌 13.2075304714
+蝎虎 11.598092559
+安瑟伦 12.1089181827
+北京房产 13.900677652
+马奎斯 13.2075304714
+空对地 10.4994802703
+原研药 13.900677652
+切口 10.0940151622
+挨着 8.43261751084
+赫菲斯 12.1089181827
+李清华 12.8020653633
+勤俭 10.4349417492
+别墅 7.87239913175
+上流社会 9.71102290995
+宾翰 13.900677652
+累岁 13.2075304714
+吭气 11.7034530746
+立柱 10.0088573539
+实际晶体 13.900677652
+游泳 7.92686804011
+等边三角 13.900677652
+只言片语 10.4041700905
+公吏 11.5027823792
+恐慌性 9.54396882529
+在家千日好 12.5143832909
+惟利是图 12.2912397395
+电机 8.0985592766
+退火 11.1926274509
+隆儿 12.8020653633
+多态现象 11.9547675029
+电木 13.2075304714
+维斯马 12.8020653633
+通灵玉 12.1089181827
+苏家屯 12.8020653633
+一口气 6.76101731601
+立柜 10.9562386728
+慈安太后 12.8020653633
+奥佩 13.900677652
+宵夜 11.9547675029
+古文献 10.4666904475
+立木 11.7034530746
+悬殊 8.4284069783
+立本 12.8020653633
+硝烟滚滚 12.5143832909
+从艺 12.1089181827
+指令集 11.1926274509
+无风起浪 13.2075304714
+陈伐吴 12.8020653633
+段景住 10.4349417492
+杨伯涛 13.900677652
+游水 11.1280889297
+低廉 8.77077893705
+一口泉 13.2075304714
+暗藏 9.11318590919
+贫困家庭 12.1089181827
+文阁 12.5143832909
+禅林寺 12.2912397395
+齐楚 11.8212361103
+宪法 6.95178042966
+立有 10.4041700905
+分析方法 8.9308643524
+朱楹青 13.900677652
+敌占区 10.4994802703
+斋坛 12.8020653633
+笑盈盈 10.5684731418
+游民 11.0674643079
+左右十丈 13.2075304714
+世界气象组织 11.2616203224
+拆息 11.2616203224
+造林学 12.5143832909
+谌颂謇 13.2075304714
+清镇 11.4157710022
+奥伦 11.7034530746
+玩过去 13.900677652
+抽吸 11.1926274509
+低度 11.598092559
+刘耀 13.900677652
+毛乌素沙漠 12.5143832909
+野菊花 11.5027823792
+美第奇 11.0674643079
+母国 10.3743171274
+授人以渔 13.2075304714
+电极 8.66423568915
+企业化 11.2616203224
+退烧 10.533381822
+一百六十六元 13.900677652
+奥伊 11.598092559
+司御史 13.900677652
+于造山 12.2912397395
+退热 10.4994802703
+魂飞天外 11.8212361103
+京九线 12.2912397395
+肛门 8.81927328699
+呈几何 12.2912397395
+电枢 11.2616203224
+埃里希 13.2075304714
+空转 10.765183436
+滦水 13.2075304714
+超限战 13.900677652
+电晕 11.0674643079
+副参谋长 9.69598503258
+迪耶 11.8212361103
+露酥胸 13.900677652
+罗念生 12.5143832909
+杀鸡焉用牛刀 12.8020653633
+经纬网 12.5143832909
+王刘贺 12.8020653633
+自画像 10.765183436
+玛丽 9.45802639549
+淋巴瘤 10.7226238216
+水箱 10.2630914922
+张廷范 13.900677652
+勤于 9.98865464655
+陈威 12.1089181827
+任日坚 13.2075304714
+喝光 10.6818018271
+闷住 11.7034530746
+窜出 10.3743171274
+乌尔都语 10.4994802703
+受困 10.533381822
+小于号 13.900677652
+吸引住 9.58318953844
+阻尼力 12.2912397395
+太金氏 13.900677652
+科尔萨科 13.900677652
+三十二岁 11.4157710022
+名作家 10.642581114
+难为情 9.72629038208
+撼地摇天 13.2075304714
+酒瘾 12.2912397395
+偏微分 11.9547675029
+西塞山 12.8020653633
+清华大学经济管理学院 11.0103058941
+游兴 12.2912397395
+这两块 10.2630914922
+孙立孙 13.2075304714
+全国政协 8.55357012126
+纠劾 11.9547675029
+擦痕 11.1926274509
+堂哥 10.8561552143
+锯断 12.1089181827
+塘马 10.8561552143
+喷水管 13.2075304714
+这样一来 8.10158499752
+接触器 12.5143832909
+石存山 8.99540287354
+封镇国 13.900677652
+齐梁 11.2616203224
+回魂 13.900677652
+加官晋级 13.900677652
+可供 7.28461246684
+石锤 12.1089181827
+焊接式 13.2075304714
+多哈 9.20019728618
+买方 8.69119149913
+量纲分析 10.6818018271
+立春 9.49395840471
+斯皮里 13.900677652
+张清往 13.2075304714
+合作商店 13.2075304714
+顺祝 13.900677652
+挨次 10.604840786
+王耀平 13.900677652
+王济仁 13.900677652
+粗实 13.2075304714
+毫升 8.62256299275
+恨人家 12.8020653633
+小白菜 11.2616203224
+转站 13.900677652
+齐桓 12.2912397395
+塞斯顿 13.2075304714
+奥义 13.900677652
+洪波曲 12.8020653633
+康明斯 11.3357282945
+清洗机 13.900677652
+噪音控制 12.1089181827
+费奥多 13.900677652
+游洞 11.8212361103
+时伯颜 13.2075304714
+日本自民党 11.9547675029
+住店 10.4349417492
+酒盏 11.3357282945
+屁股蛋子 11.5027823792
+地理过程 12.1089181827
+图纹 11.9547675029
+信香 11.9547675029
+鸡尾酒 10.765183436
+图线 11.9547675029
+调戏妇女 12.5143832909
+电暖 12.8020653633
+齐格 13.900677652
+钦羡 11.7034530746
+清清楚楚 8.01457362053
+水质标准 11.9547675029
+隋军攻 13.2075304714
+实验站 11.7034530746
+受不了 8.25170341381
+编造出 11.8212361103
+相声小品 13.900677652
+低徊 12.2912397395
+肥差 12.8020653633
+别太 11.1280889297
+行政法院 11.8212361103
+奥丁 13.900677652
+梁太太 12.5143832909
+戈培尔 11.1280889297
+热氧化 13.2075304714
+贮水量 12.8020653633
+限度 7.4407731976
+物质条件 9.65218240993
+买断 11.2616203224
+柴桑郡 12.1089181827
+低得 9.77354326693
+慈庆官 13.2075304714
+亲眼看到 9.23723855786
+电教 12.5143832909
+崂山县 13.2075304714
+不足道 11.3357282945
+甲级战犯 12.8020653633
+钟表店 13.900677652
+江南区 13.2075304714
+世界性 8.28027678626
+昭告 11.1926274509
+耶律大 13.900677652
+洋洋洒洒 10.9562386728
+立新 10.4666904475
+弗里希 11.8212361103
+绒毡 12.5143832909
+双环科技 11.9547675029
+大连市委 13.900677652
+立方 9.32596667347
+绒毯 12.2912397395
+韩择木 13.2075304714
+桦甸市 13.2075304714
+挑起来 11.0103058941
+潘诚 12.8020653633
+低层 9.94943393339
+递过去 10.2117981979
+互为表里 11.5027823792
+欧阳永叔 13.2075304714
+绒毛 8.90346537821
+推上来 13.2075304714
+雪窦寺 12.8020653633
+慈庆宫 9.45802639549
+敏感部位 11.7034530746
+大嘴巴 11.598092559
+发展壮大 9.01032852375
+暹罗人 12.2912397395
+浮动工资 13.900677652
+抵押金 13.2075304714
+交通线路 11.4157710022
+拉皮条 11.598092559
+泄泻 10.5684731418
+推荐人 10.0720362555
+孔代亲王 12.5143832909
+江畔 10.7226238216
+翻脸不认人 10.765183436
+赔钱 9.62401153296
+岩手 13.2075304714
+上青霄 13.2075304714
+三万五千八百 13.2075304714
+立时 8.37522471284
+拐上去 13.2075304714
+贝朗瑞 12.8020653633
+昭君 9.93038573842
+旅游船 12.2912397395
+才情 10.0720362555
+信用证 10.4994802703
+干椒含 13.900677652
+王中堂 12.8020653633
+杨山松 10.9049453784
+阿比让 11.4157710022
+低射 13.900677652
+毛白杨 11.4157710022
+灰濛濛 12.5143832909
+内服药 12.1089181827
+天赋人权 11.2616203224
+核武库 12.1089181827
+兴味盎然 12.5143832909
+冀图 12.1089181827
+沙口 10.4666904475
+闹出来 11.2616203224
+嫦娥 9.01787572939
+利普施 13.2075304714
+法祖 12.5143832909
+宏观政策 7.96314144689
+语调 9.12999302751
+雄视 11.8212361103
+鲜见 9.98865464655
+迪莱 13.900677652
+着作人 13.900677652
+死亡无日 13.900677652
+利普斯 12.5143832909
+逐级 9.14708746087
+苏家庄 13.900677652
+齐步 12.8020653633
+低峰 13.900677652
+落地式 12.5143832909
+娶妻 10.1630080337
+推荐书 11.3357282945
+均安 13.900677652
+铁五局 13.900677652
+媚态 11.0674643079
+沙司 13.900677652
+外籍人士 11.9547675029
+数两千零七十一万六千零三十七户 13.2075304714
+历下区 13.900677652
+但求无过 12.5143832909
+才思 11.598092559
+累年 11.4157710022
+转移 6.25480182679
+唐司令 12.5143832909
+拆成 11.9547675029
+细述 10.8561552143
+三十二开 13.900677652
+安监站 13.900677652
+测力器 13.900677652
+八千七百户 12.8020653633
+昭和 11.4157710022
+电缆厂 12.1089181827
+犒赏三军 11.8212361103
+三宝颜 12.2912397395
+齐次 11.0103058941
+犯法者 12.1089181827
+蚂蚁河 12.8020653633
+电文 9.36807815882
+均富 11.8212361103
+礼物 7.66626692626
+惟利是命 13.900677652
+叶良辅 12.8020653633
+三十二张 13.900677652
+旅游节 12.5143832909
+康节 12.5143832909
+轰炸 8.10158499752
+唐耕 12.5143832909
+顷之 13.900677652
+齐美尔 11.9547675029
+万多亿美元 11.1280889297
+拆房 11.2616203224
+跨上来 13.900677652
+传统戏 12.1089181827
+泄下来 12.8020653633
+横下心来 10.9049453784
+尉黎王 13.2075304714
+跟紧 11.8212361103
+小提琴曲 12.1089181827
+游湖 11.8212361103
+平武县 12.1089181827
+粉葛 13.900677652
+金手镯 12.8020653633
+侏罗纪 9.00283785202
+疙里疙瘩 11.9547675029
+左脸生 13.2075304714
+河南省委 9.20932976975
+英殿 13.900677652
+怆悼 13.900677652
+推荐信 11.8212361103
+恒久不变 13.900677652
+嘴皮 11.0103058941
+耸入云霄 12.8020653633
+呀呀学语 13.2075304714
+回落 6.10215459835
+蒋维乔 12.8020653633
+初中文化 11.9547675029
+精神风貌 11.0674643079
+施蒂纳 12.1089181827
+电视机 8.39941944143
+官传序 13.2075304714
+图籍 10.8561552143
+殷然 13.2075304714
+屠宰场 11.2616203224
+通讯员 7.61841090508
+烈烈轰轰 12.5143832909
+别对 11.9547675029
+首脑机关 11.5027823792
+淋巴球 13.900677652
+温故而知新 12.1089181827
+结婚仪式 11.8212361103
+冈山县 12.5143832909
+目送 9.04086524761
+别安 13.900677652
+风湿病学 13.2075304714
+悬案 11.0103058941
+中国花卉 13.900677652
+边防军 9.71102290995
+网络时代 11.4157710022
+扫瞄器 13.2075304714
+累得 8.79473217808
+拆掉 9.65218240993
+无中生有 10.0088573539
+许多年 8.87023973058
+六棵 13.900677652
+魏格尔 12.8020653633
+别室 12.5143832909
+住居 10.8096351986
+成大器 11.8212361103
+巴菲特 8.05713323494
+别家 9.98865464655
+湿热型 11.9547675029
+杀螨剂 12.1089181827
+陈东阳 10.9562386728
+录取者 12.8020653633
+翁乾 12.8020653633
+酒瓶 9.55687223012
+粉蓝 13.2075304714
+悬梁 10.9049453784
+小虾米 12.8020653633
+最甜 12.1089181827
+刻板 10.0294766411
+库尔羊 12.8020653633
+集水管 13.900677652
+窜升 13.2075304714
+别子 12.2912397395
+别字 11.2616203224
+滴到 12.1089181827
+焊接工 12.5143832909
+于二净 13.2075304714
+别存 12.8020653633
+锯材 12.2912397395
+农奴制度 10.5684731418
+黑黑的 10.8561552143
+唯一一 13.900677652
+提水 10.3171587135
+圣何塞 11.4157710022
+谱系 10.3171587135
+陈宝 10.2897597393
+纠偏 11.1926274509
+锯条 12.5143832909
+弗里德 11.9547675029
+反倾销法 12.2912397395
+许多座 13.2075304714
+组胺 10.1630080337
+三十二年 9.29550746599
+挤过去 11.7034530746
+冠礼 11.1280889297
+金士顿 13.900677652
+受命 8.21031819765
+黄凌霜 13.2075304714
+张清带 13.2075304714
+竟未 11.1926274509
+无名之火 13.2075304714
+许继 10.4041700905
+白沙镇 11.8212361103
+三九医药 10.4041700905
+璞玉 12.5143832909
+电视柜 13.900677652
+火棍 13.2075304714
+屠龙记 13.2075304714
+许维 13.2075304714
+刻本 8.40350942668
+粉蒸 13.2075304714
+毫不相干 10.0940151622
+秦府 12.1089181827
+锯末 11.8212361103
+方从义 13.2075304714
+法国农业部 13.2075304714
+十出戏 13.900677652
+巴米扬 11.5027823792
+饶让 12.8020653633
+企业债 8.35160156708
+翁仲 12.2912397395
+锯机 12.2912397395
+刻有 8.68574189437
+布衣之交 13.2075304714
+旌阳区 12.2912397395
+迢远 13.900677652
+白枕鹤 12.2912397395
+黑山共和国 12.1089181827
+北斐特 12.8020653633
+师兄弟 11.1926274509
+陈旧观念 12.5143832909
+宗朱翊 13.900677652
+受受 12.8020653633
+任德耀 13.2075304714
+崇洋媚外 11.7034530746
+娜斯 12.2912397395
+消炎药 11.2616203224
+纸黄金 10.4041700905
+转网 13.900677652
+比凤姐 13.900677652
+科学性 9.20932976975
+檐部 12.2912397395
+九九八十一 10.9049453784
+接触区 13.900677652
+转置 13.2075304714
+滑步推 13.2075304714
+边防团 13.900677652
+邵伯诸 12.5143832909
+西征军 11.4157710022
+据以 10.1630080337
+那古尸 11.1926274509
+监考 11.2616203224
+别峰 13.2075304714
+百家姓 11.3357282945
+珠林 11.7034530746
+慈幼 13.2075304714
+掉价儿 13.900677652
+弗里堡 12.8020653633
+物华天宝 12.8020653633
+许多天 10.4994802703
+红小豆 11.3357282945
+经销者 13.2075304714
+天差地别 12.8020653633
+企业型 13.2075304714
+太凉 12.8020653633
+乡镇企业局 12.2912397395
+受压 8.9308643524
+王经引 13.900677652
+鱼丸 12.1089181827
+丰川卫 12.8020653633
+南津关 11.0674643079
+重新聚合 12.5143832909
+立方公尺 13.900677652
+气田 9.85762638414
+忍者 12.5143832909
+据云 12.2912397395
+慈禧正 13.2075304714
+图符 13.900677652
+屈辱性 11.9547675029
+筏头 13.2075304714
+三侠五义 11.7034530746
+仙踪 12.1089181827
+演不下 13.900677652
+诱致 12.2912397395
+康华 13.900677652
+切到 13.2075304714
+无人管 12.1089181827
+壮锦 11.9547675029
+孙立平 13.2075304714
+备用轮胎 13.900677652
+王朝辅 12.8020653633
+艾耶尔 12.5143832909
+报盘 11.0674643079
+宫太 13.900677652
+回荡 9.29550746599
+戏笑 13.2075304714
+朝东面 13.2075304714
+布水谷 12.8020653633
+老夫少妻 12.5143832909
+语言 6.16349757414
+筛法 11.598092559
+抱布贸丝 13.2075304714
+住客 11.9547675029
+挑拨离间 10.9049453784
+惠中 13.2075304714
+住宿 8.6803218269
+邢台 9.61021821083
+孔凤春 13.2075304714
+第三十章 10.765183436
+哦哦哦 12.8020653633
+下世纪 12.8020653633
+百伶百俐 12.2912397395
+付诸东流 11.5027823792
+往右边 12.8020653633
+里格斯 13.2075304714
+许福 13.2075304714
+永定河 9.32596667347
+陈宫 10.3743171274
+新婚夫妇 10.642581114
+住宅 7.02854955064
+堆积作用 10.5684731418
+傅贵九 12.8020653633
+齐流 11.8212361103
+张灏 12.8020653633
+卡扎菲 12.1089181827
+喜剧之王 12.5143832909
+代尔夫 12.2912397395
+坦克团 10.0088573539
+惠东 11.7034530746
+堂兄 10.3743171274
+狂灌 12.2912397395
+无言对答 12.2912397395
+追悔 10.9562386728
+斧凿 11.7034530746
+小弟弟 10.533381822
+股票价值 10.9049453784
+清暑益 13.900677652
+立据 12.8020653633
+瓜纳华托 13.900677652
+鱼产 11.0674643079
+面海 10.3743171274
+张自烈 8.94485059437
+别尔 11.598092559
+濒临绝种 13.900677652
+罗星塔 12.5143832909
+戏箱 12.2912397395
+才智 9.87532596124
+德宏州 12.8020653633
+配音演员 12.2912397395
+添足 12.5143832909
+雄辩 10.4041700905
+裘衣 13.900677652
+印度报业托拉斯 12.8020653633
+三十二天 12.8020653633
+毫发 11.2616203224
+缘缘堂 12.8020653633
+邓有米 8.0229418702
+退瓶 13.900677652
+己烯 13.2075304714
+唯才是举 11.9547675029
+均差 11.598092559
+电控 9.93038573842
+完好无缺 11.8212361103
+都柏林 10.0940151622
+金融股 7.77599426108
+斑块 10.0940151622
+超级稻 12.5143832909
+齐泰 12.5143832909
+得的心 13.900677652
+压缩工具 12.5143832909
+公安部长 13.900677652
+变天账 12.5143832909
+塔尔巴 13.2075304714
+填答 13.2075304714
+崇光 13.900677652
+惠侯 13.2075304714
+乌纳拉 13.900677652
+陈孙 12.5143832909
+通信软件 12.5143832909
+刑统 12.8020653633
+孙立引 13.2075304714
+电扇 10.2630914922
+溜上来 13.2075304714
+散钱 13.2075304714
+鱼体 10.2630914922
+长兴县 11.8212361103
+生产者 7.70016847793
+粉色 10.0720362555
+白居寺 12.5143832909
+坡度 8.1608847398
+张恭祖 13.2075304714
+贿赂款 11.9547675029
+沙南 13.2075304714
+多顶 13.2075304714
+统筹法 12.2912397395
+锦衣玉食 10.7226238216
+卡达尔 11.7034530746
+古典派 12.2912397395
+生命周期 9.72629038208
+世界杯 8.82550383674
+图稿 13.900677652
+报知 8.41173992582
+报酬权 12.8020653633
+领导者 8.58255765813
+捧毂推轮 13.2075304714
+三斗坪 12.1089181827
+诱胁 12.8020653633
+均居 8.52539924429
+眉棱骨 12.5143832909
+闲来无事 10.765183436
+告状信 10.765183436
+受力 9.41204128224
+弗里奇 13.2075304714
+万集 13.900677652
+语语 13.2075304714
+丧妻之痛 13.900677652
+脐橙 11.598092559
+受助 11.7034530746
+受动 13.900677652
+自会 9.80633308975
+很有 7.02029356979
+公和祥 13.2075304714
+简单商品 11.9547675029
+随风飘扬 12.2912397395
+龙一脉 13.2075304714
+收益 5.36820183703
+初始化 10.1164880181
+泄漏 8.94485059437
+堂倌 10.7226238216
+法科 11.7034530746
+立户 11.1926274509
+转结 13.900677652
+图章 11.1280889297
+独龙族 11.0103058941
+转给 9.25628675283
+曲径通幽 11.1926274509
+绝对量 9.62401153296
+孤男寡女 12.8020653633
+康藏 12.1089181827
+癸巳类 13.2075304714
+五十周年 11.1926274509
+建成投产 9.06439574502
+银都 11.598092559
+团支部 11.8212361103
+拆散 9.5186510173
+绿褐色 11.8212361103
+雪窦山 12.5143832909
+吴为问 11.7034530746
+杭二州 12.2912397395
+皮冷杉 12.1089181827
+理论体系 8.77077893705
+面汤 10.1871055853
+中共北京市委 11.598092559
+催化活性 11.3357282945
+捕鱼量 11.5027823792
+母口 13.900677652
+攻破 7.72897705456
+电抗 12.8020653633
+花园城 11.7034530746
+阻尼器 12.2912397395
+捕获量 12.5143832909
+海军航空 11.0103058941
+受刑 9.6811699468
+着色剂 11.0674643079
+旁站 11.2616203224
+不负所托 13.900677652
+康夫纳 12.8020653633
+碗柜 13.900677652
+第七十届 12.8020653633
+移植物 12.5143832909
+仵德厚 13.2075304714
+由寒武 11.598092559
+攻研 13.2075304714
+据传 9.01032852375
+银行存折 12.8020653633
+受制 11.1280889297
+庆云县 13.900677652
+受到 4.94522952963
+电报 7.82763311788
+司章奏 13.2075304714
+刻意 8.60236028543
+连皇太后 13.2075304714
+这两台 12.5143832909
+安克雷奇 11.9547675029
+盘亚纲 13.900677652
+师专 10.0088573539
+水警区 11.7034530746
+受凉 10.1871055853
+跳皮筋 12.5143832909
+安老 11.1926274509
+姜虎真 13.2075304714
+目镜 10.6818018271
+古拉特 12.8020653633
+燕山山脉 10.0720362555
+朱之鑫 13.2075304714
+梧栖 13.2075304714
+师丹 12.8020653633
+阿拉伯马格里布联盟 12.8020653633
+相辅相成 9.66657114738
+住处 8.33999602096
+硝化甘油 11.1926274509
+热连轧 12.1089181827
+淌汗 11.598092559
+接交 13.2075304714
+雄起 11.2616203224
+海东青 11.0103058941
+监舍 11.1926274509
+折叠为 13.900677652
+电感 10.5684731418
+牙齿拥挤 13.2075304714
+周先生 10.3171587135
+食不厌精 11.9547675029
+堂叔 11.5027823792
+装作 8.5440913773
+淌水 11.8212361103
+指标化 13.900677652
+砖窖 13.2075304714
+安耽 12.1089181827
+姚雪垠 11.598092559
+抽动 9.94943393339
+别府 12.2912397395
+粉脸 11.598092559
+货色齐全 13.2075304714
+礼盒 9.84023464143
+梧桐 9.77354326693
+悬浮 9.21854642485
+著作等身 12.5143832909
+回溯到 11.9547675029
+安田 12.5143832909
+浓厚兴趣 10.1394775363
+延缓 8.57280148319
+置若罔闻 10.0940151622
+周叔莲 12.8020653633
+辛宪英 13.2075304714
+索图巴 13.900677652
+受冻 10.6818018271
+茹风 9.4233408375
+挥鞭 11.3357282945
+无力解决 12.2912397395
+助纣为虐 11.4157710022
+宾礼 10.9049453784
+电池容量 13.2075304714
+史不绝书 11.8212361103
+蒸汽状 13.900677652
+竞速赛 13.2075304714
+发明人 10.1630080337
+斋公 12.8020653633
+萨丕尔 12.2912397395
+吃得消 11.8212361103
+财货 11.0674643079
+胡轸 13.2075304714
+低声 7.27927200021
+科学报 13.2075304714
+吠舍 11.1280889297
+陈桥门 11.8212361103
+戏称 9.56994431169
+初始值 12.5143832909
+下颌骨 10.2371160058
+电视报 13.900677652
+杜文秀 11.598092559
+痛下决心 10.6818018271
+拨灯 13.900677652
+摇头晃脑 9.84023464143
+筛滤 12.8020653633
+淮南 8.18036587537
+沙僧寻 13.2075304714
+祈望 12.1089181827
+赢政 12.8020653633
+犯不上 10.7226238216
+算无遗策 12.8020653633
+政治路线 10.1630080337
+傣味 13.2075304714
+排放量 8.5440913773
+大都市 9.35738286971
+公丘福 13.2075304714
+社交活动 10.765183436
+座前 12.1089181827
+事关全局 12.5143832909
+纯净水 11.0674643079
+刻成 10.3743171274
+身负重伤 10.4349417492
+经营性质 13.900677652
+百慕大 10.4041700905
+普济桥 13.2075304714
+实足年龄 13.900677652
+茎杆 12.5143832909
+腿子 11.0103058941
+家族制度 11.7034530746
+持戒 11.7034530746
+抽刀 11.598092559
+高济译 12.2912397395
+澳门日报 12.8020653633
+斋僧 10.1871055853
+装下 11.0674643079
+装上 9.11318590919
+塔吉尔 12.1089181827
+核心部件 11.0103058941
+幼稚病 11.8212361103
+试得 13.2075304714
+毛主席 7.65263477747
+彭德怀 9.36807815882
+粟末水 13.2075304714
+姜伯勤 13.2075304714
+母儿 11.8212361103
+创业板 4.76011617461
+账目 9.61021821083
+申报表 12.8020653633
+传热系数 13.2075304714
+抽取 9.15574552361
+雄豪 12.5143832909
+邓将军 12.8020653633
+逐笔 12.5143832909
+阚泽 11.4157710022
+寿张县 12.5143832909
+克拉夫丘克 12.1089181827
+雅塔 11.4157710022
+宋文公 13.2075304714
+同江市 13.2075304714
+血刃 12.8020653633
+袋泡茶 12.2912397395
+清辉照 13.2075304714
+装为 12.8020653633
+选举法 9.98865464655
+身负重任 12.2912397395
+冀县 10.765183436
+朱丽叶 10.3171587135
+合出 13.2075304714
+退着 12.2912397395
+五十六个 11.8212361103
+韦银豹 11.0103058941
+锯掉 11.5027823792
+摸触 13.2075304714
+三十余口 10.9562386728
+抽去 10.1871055853
+光屏 13.2075304714
+居停主人 13.900677652
+冤家路窄 11.5027823792
+别得 13.2075304714
+母兽 11.0103058941
+肯到 12.8020653633
+壮阔 10.4994802703
+找点事干 13.900677652
+竣事 13.900677652
+母兄 11.9547675029
+十中 13.2075304714
+斯特赖克 13.2075304714
+短暂性 11.9547675029
+低处 10.1164880181
+戏码 13.2075304714
+裘诺 13.2075304714
+于魁智 13.900677652
+塘鱼 10.7226238216
+言必有据 13.900677652
+多艘 9.87532596124
+电性 10.765183436
+壮阳 9.84023464143
+斧削 11.7034530746
+软型 13.900677652
+小葱拌豆腐 12.8020653633
+互联互通 10.7226238216
+延绥 11.598092559
+自立 8.05423887692
+文贵武 13.900677652
+根目录 12.8020653633
+声威大振 12.1089181827
+延续 6.07184312439
+这么晚 9.36807815882
+厅局长 13.2075304714
+花溪区 13.900677652
+冀北 10.4994802703
+别录 11.3357282945
+和粤军 12.8020653633
+酒泉地区 12.1089181827
+伊希斯 12.8020653633
+百年战争 10.4994802703
+绑赴 12.1089181827
+景德进士 13.2075304714
+二十三道 13.2075304714
+巨鼎 10.9049453784
+重返家园 13.2075304714
+兰虎沟 13.2075304714
+汝候刘 13.2075304714
+喏喏连声 11.0103058941
+四川长虹 9.19114745066
+传动件 13.2075304714
+钱粮 8.61747392324
+比较稳定 8.70218062071
+悬河 11.7034530746
+经洗 13.2075304714
+方西传 12.2912397395
+成为一团 13.900677652
+斧劈 10.5684731418
+别开 11.1280889297
+法传进 13.2075304714
+自我标榜 11.598092559
+傅先生 13.2075304714
+潘菽 12.5143832909
+抬上来 13.2075304714
+引导者 12.5143832909
+十五章 12.5143832909
+延纳 12.8020653633
+孝明帝 10.9049453784
+叫法 10.4041700905
+云板声 12.8020653633
+陈古秋 13.900677652
+文艺批评 10.9562386728
+冤气 13.2075304714
+经济 3.57417981212
+不足之处 10.0940151622
+拍卖品 13.900677652
+拆机 12.5143832909
+区域分析 13.900677652
+购买力 8.75901409547
+许竞 12.8020653633
+交互式 10.2897597393
+沈尹默 13.900677652
+阴虚内 11.598092559
+钟表学 13.900677652
+宋军民 13.900677652
+萨拉戈萨 11.9547675029
+讯通 13.900677652
+罗克汉普 13.2075304714
+悬挂 7.45654639528
+康衢 12.1089181827
+尺寸之功 12.5143832909
+别像 12.2912397395
+弗里吉 11.8212361103
+公司概况 12.1089181827
+生产费 13.900677652
+美国加州大学伯克利分校 11.0674643079
+接触式 11.9547675029
+目标侦察 13.2075304714
+骑车来 13.900677652
+许田 11.8212361103
+许由 12.5143832909
+慈眉善眼 13.900677652
+威武之师 13.900677652
+祖国统一 10.4666904475
+慈禧朝 13.900677652
+酒罐 13.900677652
+砖瓦 9.24671730182
+先住 10.9049453784
+通讯录 12.8020653633
+昭平 12.8020653633
+卷板机 13.900677652
+河东源 13.2075304714
+卡尔帕克 13.2075304714
+第五根 13.900677652
+收着 10.1164880181
+报端 11.7034530746
+迪西 12.5143832909
+高手如云 13.900677652
+报童 11.1926274509
+报名者 10.9049453784
+动真格 12.5143832909
+苏汉臣 12.8020653633
+报章 11.7034530746
+熟肉制品 13.900677652
+轰隆轰隆 11.0103058941
+昭帝 9.87532596124
+快上去 12.5143832909
+没造化 12.1089181827
+美专家 13.2075304714
+非同凡响 11.0674643079
+长乐县 11.9547675029
+告示 8.82550383674
+土司 6.87159008783
+从中渔利 12.1089181827
+珠母 9.87532596124
+影视城 13.2075304714
+报站 11.4157710022
+碗橱 12.2912397395
+抗癌药 12.5143832909
+五爷 13.2075304714
+电缆头 13.900677652
+翻身解放 13.2075304714
+企业家 7.73316116109
+呼扇 13.2075304714
+组词 13.900677652
+北京展览馆 12.8020653633
+普陀山 9.96885201925
+加奥 12.8020653633
+俊男靓女 13.2075304714
+捐赠 8.29120585679
+武州 12.8020653633
+攻略 10.4994802703
+自然对数 13.2075304714
+换口味 13.2075304714
+组诗 10.765183436
+文学创作 8.59737274392
+跟着 5.84679056836
+身轻言微 12.5143832909
+林传鼎 13.2075304714
+报税 13.2075304714
+招祸 11.9547675029
+听命于 10.1394775363
+史国公 13.2075304714
+康裕 13.900677652
+买买提 11.4157710022
+影视圈 11.5027823792
+拆桥 12.5143832909
+低回 10.9049453784
+观音桥 11.5027823792
+李小平 13.2075304714
+抽屉 8.87023973058
+高背椅 13.2075304714
+按辔徐行 13.2075304714
+赵二人 12.5143832909
+退磁 12.1089181827
+碎了心 11.5027823792
+商务人士 11.5027823792
+储君之 13.900677652
+抽尽 12.5143832909
+自怨自艾 11.9547675029
+摩天大楼 10.4994802703
+回返 10.642581114
+别倒 13.2075304714
+离奇失踪 12.5143832909
+回迁 12.5143832909
+单双杠 13.900677652
+郑尚书 13.900677652
+回过 7.48394536946
+佤族 10.4666904475
+组训 12.5143832909
+经手 9.80633308975
+害命 11.598092559
+尿失禁 11.1926274509
+互不侵犯 11.4157710022
+于水田 12.5143832909
+不多见 9.03314320152
+丹霞山 11.598092559
+善心 10.4041700905
+抽射 11.9547675029
+异香扑鼻 10.9562386728
+海顿 10.642581114
+新开业 11.8212361103
+仙花 11.5027823792
+延熙 11.9547675029
+伍崇曜 13.900677652
+经打 12.8020653633
+钝器 11.8212361103
+仙草 9.49395840471
+会说会写 13.900677652
+库兹涅 11.8212361103
+筵会 11.3357282945
+金化攻势 13.900677652
+授人以柄 11.5027823792
+陈桥驿 10.9049453784
+许琦 13.2075304714
+延陵 11.7034530746
+游方 10.5684731418
+削尖脑袋 12.1089181827
+公里 6.07104726283
+许涤新 12.5143832909
+不计其数 8.9308643524
+陈年老酒 12.2912397395
+住嘴 10.4666904475
+母弹 12.1089181827
+毕生精力 11.598092559
+摘金 13.2075304714
+铁东区 13.2075304714
+仙药 11.1280889297
+均值 8.84443184663
+别凯 13.900677652
+全师 9.63799777493
+过半数 11.0674643079
+鄂伦春人 12.5143832909
+冯文修 10.0940151622
+反动透顶 13.2075304714
+工作人员 6.64367494488
+别出 11.0674643079
+母弟 10.642581114
+十余处 11.8212361103
+游斗 12.1089181827
+一天到晚 8.61747392324
+不全是 9.77354326693
+宪政 9.32596667347
+如花似玉 10.6818018271
+同态滤波 13.900677652
+电渗 13.2075304714
+仙茅 12.1089181827
+淀粉糖 13.2075304714
+戏瘾 12.2912397395
+闽江路 13.900677652
+盘弄 13.900677652
+睚眦 12.2912397395
+低地 8.75318317516
+张天翼 11.2616203224
+经援 11.4157710022
+冀州 9.10488710638
+妇女组织 12.1089181827
+耍流氓 11.7034530746
+许多味 13.2075304714
+八九十个 12.8020653633
+祁门 11.3357282945
+退票 11.8212361103
+起电盘 12.5143832909
+七十四条 12.5143832909
+病原 9.40086798165
+环流量 13.900677652
+珠宫贝阙 13.900677652
+特别报道 11.9547675029
+重话 12.8020653633
+相结合 6.95755522916
+若成丁 13.900677652
+旁白 12.1089181827
+密切联系 8.78268383956
+风水学 11.0674643079
+戏目 12.1089181827
+延烧 12.1089181827
+别克 9.54396882529
+童贯启 13.900677652
+别光 11.3357282945
+从警 13.2075304714
+天上麒麟 13.900677652
+客观事物 9.69598503258
+焦急万分 11.1280889297
+三十二员 13.2075304714
+沈阳部队 13.900677652
+权永兴 12.8020653633
+官时隐 13.2075304714
+夏青 13.2075304714
+别关 12.8020653633
+声如银铃 13.900677652
+回身 7.97909923233
+别具 10.4349417492
+广大观众 10.7226238216
+做文章 9.5062284973
+退离 11.9547675029
+国家科学技术委员会 13.2075304714
+思潮起伏 12.5143832909
+享有 6.97901946782
+李相王 12.8020653633
+拂面而来 13.2075304714
+大事儿 10.765183436
+基隆屿 13.2075304714
+宾白 11.598092559
+桂河大桥 12.1089181827
+莫文蔚 12.2912397395
+辅佐 8.31718134319
+电源 7.61281909181
+飞来峰 10.604840786
+堂屋 8.28027678626
+明宗南 12.8020653633
+齐性 13.900677652
+北洋水师 9.94943393339
+冗长 10.0294766411
+以色列外交部 13.900677652
+立方毫米 11.8212361103
+飞来峡 12.1089181827
+一左一右 10.2371160058
+贴补 10.4349417492
+闲钱 10.1871055853
+金属矿床 10.604840786
+津南区 11.9547675029
+古格银 11.598092559
+低垂 9.49395840471
+接上 8.71889410168
+耶律奚 13.2075304714
+淋巴结 9.14708746087
+领先地位 8.55357012126
+宋军战 13.2075304714
+报答 8.77077893705
+攻丝机 13.900677652
+雄花 9.65218240993
+均化 13.900677652
+长兴岛 11.3357282945
+模具 9.72629038208
+惯有 13.2075304714
+自学成才 10.9562386728
+不在此列 12.5143832909
+寻衅滋事 10.7226238216
+嚣张 9.65218240993
+退税 9.43476953332
+李舜臣 11.9547675029
+林儒耕 9.54396882529
+均匀 7.25688791883
+特伦顿 12.5143832909
+电流 7.53420720424
+链引发 12.5143832909
+丁尼亚 12.2912397395
+并行处理 10.7226238216
+面授 11.1280889297
+乐着 13.900677652
+一般说来 8.53470163695
+脱胎换骨 10.2117981979
+回购 7.84623830571
+竭诚拥护 13.2075304714
+涓埃 13.2075304714
+读的书 11.4157710022
+小孩子 8.04560572977
+重病缠身 12.8020653633
+许多块 12.5143832909
+图画 8.50705010562
+水杨醛 13.2075304714
+正电子 10.1630080337
+二枪 12.5143832909
+机关党委 13.900677652
+溢美之词 13.2075304714
+丁公佶 13.2075304714
+花异木 12.1089181827
+呼儿唤 12.2912397395
+回赎 13.900677652
+信息产业 9.44633035572
+庄稼汉 10.0294766411
+梃击案 12.8020653633
+磷化处理 13.900677652
+锯末子 13.2075304714
+睡得 8.67493097826
+监测站 11.598092559
+回走 11.9547675029
+目不识丁 11.3357282945
+别动 9.84023464143
+子文鸯 13.2075304714
+五苓散 12.2912397395
+胡远 12.1089181827
+冲下来 10.7226238216
+加浓炮 13.900677652
+低吟 10.9562386728
+回赠 11.2616203224
+诱迫 11.8212361103
+柳条编 12.8020653633
+李岩速 13.2075304714
+核武器 8.21031819765
+一百多万两 13.2075304714
+王桐龄 13.900677652
+沈二人 12.1089181827
+黄袍加身 11.7034530746
+抽干 11.1926274509
+母岭 13.2075304714
+振华港机 12.8020653633
+同江县 11.9547675029
+驻扎地 11.9547675029
+游春 12.5143832909
+才思敏捷 11.4157710022
+子攀山 12.2912397395
+堂弟 10.1164880181
+莫理逊 13.900677652
+立派 12.2912397395
+社会福利 9.17328983326
+戴平巾 13.2075304714
+东方日报 13.2075304714
+雪妍 9.11318590919
+水杨酸 10.533381822
+货币贬值 9.87532596124
+略去不提 13.900677652
+西固区 12.8020653633
+碧绿色 11.8212361103
+米塔尔 11.1926274509
+彭其叫 13.2075304714
+祁阳 11.9547675029
+卫灵公 13.900677652
+游星 13.900677652
+一年一度 8.81308131674
+混合选择 13.2075304714
+游易 13.2075304714
+邢州 11.2616203224
+知识产业 13.900677652
+桓玄 10.9562386728
+势利眼 11.8212361103
+迪诺 13.900677652
+变革性 11.7034530746
+申谕 13.2075304714
+夫差 10.642581114
+迪语 13.2075304714
+坐监 11.7034530746
+回跌 11.5027823792
+潢川 10.642581114
+枯水年 11.598092559
+赤胆忠心 11.2616203224
+驱逐出境 10.3453295905
+脚踏两只船 11.9547675029
+相交处 13.2075304714
+血口喷人 10.8561552143
+兄弟 5.74560276416
+段世杰 13.900677652
+麦角钙化 13.900677652
+二极 12.8020653633
+非经营性 10.6818018271
+肖劲光 12.8020653633
+电液 10.9049453784
+别到 12.2912397395
+浮球 13.900677652
+回路 9.32596667347
+静慧 13.900677652
+那尔吉 13.2075304714
+均列 11.8212361103
+声声慢 12.8020653633
+呛着 11.3357282945
+叠被 11.8212361103
+柔曼 11.7034530746
+酒类 8.9308643524
+均分 10.3743171274
+陈燮阳 12.5143832909
+慈禧搭 12.5143832909
+别受 13.2075304714
+有戏 10.5684731418
+子塔赫 13.2075304714
+电汇 12.2912397395
+回调 6.9780337605
+开步走 12.8020653633
+默坐 11.0103058941
+高帽子 10.604840786
+实话 8.15447446144
+卡嗒声 13.900677652
+目不识书 13.900677652
+别叫 10.1394775363
+转灯 11.8212361103
+腌猪肉 13.900677652
+报禁 13.900677652
+别史 11.8212361103
+厚望 9.82314020807
+砖石 9.4233408375
+别号 9.34680076038
+锦绣河山 12.5143832909
+清洗液 11.3357282945
+高迁 11.9547675029
+齐拉 13.2075304714
+电池 7.51886163457
+司马邺 12.8020653633
+闻焕章 11.7034530746
+救生筏 13.900677652
+电气 7.48068272383
+管理机制 9.98865464655
+祖母绿 9.94943393339
+黄梅季 13.900677652
+低唱 11.9547675029
+报称 10.3453295905
+好东东 12.8020653633
+故纸堆 12.2912397395
+累垮 12.1089181827
+抽得 10.3171587135
+二枝 12.1089181827
+顾尔纯 13.2075304714
+客死他乡 12.8020653633
+姝丽 13.900677652
+爻辞 10.8096351986
+气球 8.91707103027
+弗林德斯 13.2075304714
+摩洛哥王国 12.8020653633
+乌纳河 13.900677652
+立法 7.13910488317
+总会 7.78921031247
+别去 10.642581114
+公亮兄 12.5143832909
+游某 12.1089181827
+不得有误 10.7226238216
+冤死 10.8096351986
+累坏 10.533381822
+普遍化 10.7226238216
+博尔基亚 12.8020653633
+领导责任 10.642581114
+全都会 12.2912397395
+组装 8.98802276624
+平民化 11.0103058941
+受屈 11.9547675029
+闲雅 12.1089181827
+涉及面 10.0088573539
+报社 9.13850371718
+达尔贝 11.3357282945
+六合一 13.2075304714
+提洛岛 12.8020653633
+孙立军 13.900677652
+农村干部 11.8212361103
+抽彩 13.900677652
+图瓦 10.4994802703
+盐碱土 10.7226238216
+经意 12.2912397395
+远洋轮 11.8212361103
+任斯基 12.1089181827
+小膜 13.900677652
+全金属 10.9049453784
+合作社 8.65365357982
+均势 9.84023464143
+米洛斯 13.900677652
+酒糟 11.3357282945
+探听者 13.900677652
+电泳 10.2630914922
+盐碱地 9.55687223012
+村支书 9.91169360541
+蒋光慈 12.8020653633
+行销全国 11.2616203224
+热带风暴 10.9049453784
+残春 12.1089181827
+基隆市 11.3357282945
+联接件 11.7034530746
+电波 9.07236391467
+变应原 10.765183436
+关门闭户 11.1926274509
+酒精 8.26588804881
+松毛虫 11.1280889297
+数亿元 11.0103058941
+转炉 10.2371160058
+中山东路 13.2075304714
+靠进 13.900677652
+齐截 13.900677652
+烟类 13.900677652
+抵销 9.33632946051
+中国纺织工业协会 13.2075304714
+壮骨 11.9547675029
+族人们 12.1089181827
+旁瓣 13.900677652
+种宣抚 11.9547675029
+康托尔 10.2630914922
+穷凶 13.900677652
+瑞鹤 13.900677652
+中央公园 11.7034530746
+大同区 13.2075304714
+肝细胞 9.72629038208
+亲兄弟明 13.900677652
+病笃 11.3357282945
+该软件 12.1089181827
+盛行一时 11.5027823792
+春秋笔法 12.1089181827
+受尽 9.80633308975
+病史 8.9519177616
+王中军 10.0720362555
+中国奥委会 11.5027823792
+面斥 12.5143832909
+斧头 9.44633035572
+转着 9.72629038208
+毫不费力 10.4349417492
+不定积分 12.2912397395
+独龙江 12.1089181827
+较长时间 8.75318317516
+风水师 12.8020653633
+报纸 7.14026296089
+阿丽亚娜 12.2912397395
+人口稠密 9.19114745066
+奇效 10.2117981979
+残敌 11.4157710022
+转睛 11.7034530746
+长逝 12.8020653633
+谢安累 12.5143832909
+棉皮鞋 13.900677652
+龙基纳 12.8020653633
+复习功课 12.1089181827
+刮下来 11.9547675029
+彩图 8.47133202302
+汪波 9.63799777493
+别哭 9.5062284973
+过世 9.49395840471
+跟班 11.1926274509
+空无所有 12.8020653633
+赠别 12.2912397395
+傅友德 11.598092559
+红姐 12.2912397395
+连宝钗 12.8020653633
+面料 9.37888907493
+革职 9.12999302751
+低利 13.900677652
+岂但 11.5027823792
+面无 12.1089181827
+棺材板 11.2616203224
+斋宫 11.4157710022
+王充亦 13.2075304714
+银行存款 9.09665660724
+转看 13.2075304714
+移动机器人 12.8020653633
+母婴 10.3453295905
+拍起 11.1280889297
+翻弄 11.4157710022
+堂姐 11.9547675029
+樱唇 11.5027823792
+低到 11.2616203224
+毋乃太 13.2075304714
+斋宿 13.2075304714
+经曲 13.900677652
+数字证书 11.9547675029
+外三层 13.2075304714
+报经 11.0674643079
+汪古部 10.8561552143
+受审 9.65218240993
+受宠 9.75754292558
+彼得一世 10.9562386728
+六盘水 11.1926274509
+旱烟袋 11.2616203224
+低分 12.2912397395
+美女视频 13.2075304714
+刑天舞 12.8020653633
+受害 9.33632946051
+乐曲声 12.2912397395
+不能证实 13.2075304714
+跑垒员 12.5143832909
+转眼 9.07236391467
+叫板 10.642581114
+女人腔 13.900677652
+戏班 9.94943393339
+高远 10.2371160058
+齐整 9.41204128224
+陶洛斯 13.2075304714
+锡矿 9.94943393339
+逐点 11.5027823792
+分类管理 7.69814213479
+王刘肥 13.900677652
+学贯中西 11.5027823792
+厦门人 13.2075304714
+电母 11.8212361103
+硬仗 11.1280889297
+受孕 9.28555713513
+百乐门 11.5027823792
+在历史上 8.41173992582
+十字绣 13.2075304714
+淋巴管 10.3453295905
+模糊 7.43920947562
+峥嵘岁月 12.5143832909
+工作岗位 9.40086798165
+悬枢 13.900677652
+回访 10.3743171274
+想入非非 10.533381822
+郭子仪 10.4041700905
+选举权 9.44633035572
+悬架 9.7898037878
+巧儿 13.900677652
+电毯 13.900677652
+绝色美女 13.900677652
+史朔闰 13.2075304714
+天作之合 12.1089181827
+主麻日 13.2075304714
+恩格斯 8.41173992582
+风炉子 13.2075304714
+色胆如天 13.2075304714
+牡丹花 10.2117981979
+色情片 13.2075304714
+牟糠 11.8212361103
+立正 9.66657114738
+丝毫不差 12.5143832909
+回话 8.55834340001
+杨立孝 11.598092559
+向前走 8.87023973058
+低劣 10.3743171274
+住口 9.62401153296
+选任 9.58318953844
+别名 9.23723855786
+别吓 11.598092559
+别向 13.2075304714
+澹泊 11.598092559
+卡里辛 13.2075304714
+聪聪 11.9547675029
+纠弹 11.4157710022
+累倒 11.7034530746
+宜辛温 12.8020653633
+甩站 12.5143832909
+堂奥 12.5143832909
+千娇百媚 11.5027823792
+乙未 12.1089181827
+住友 10.765183436
+冰蚀湖 10.8561552143
+转瞬 10.9562386728
+育婴堂 12.2912397395
+下颌部 13.2075304714
+回请 13.2075304714
+田见秀 8.14810501315
+策动 9.15574552361
+内政外交 10.9049453784
+寻根问底 12.8020653633
+王刘胜 12.1089181827
+南通人 12.1089181827
+别吵 11.2616203224
+输水道 13.2075304714
+艺术格调 12.5143832909
+郁气结 13.900677652
+起早摸黑 12.8020653633
+游憩 11.0103058941
+来聊天 13.2075304714
+向心力 10.6818018271
+帅恩典 13.900677652
+慈禧戴 13.900677652
+杨献珍 12.8020653633
+洲渚 11.8212361103
+脑门儿 11.3357282945
+任斯克 12.8020653633
+徒劳无益 10.765183436
+硬体 11.9547675029
+杨浦大桥 11.3357282945
+许多倍 10.604840786
+卡拉曼利斯 13.900677652
+拘限 13.900677652
+叫春 13.900677652
+策励 13.900677652
+惯性 7.94225295895
+孙立在 13.2075304714
+图版 11.598092559
+松宽红 13.2075304714
+始发车 13.900677652
+料敌如神 12.8020653633
+康赛 12.1089181827
+薯干 12.2912397395
+图片 6.37449873863
+匀速直线 11.3357282945
+兴达 12.5143832909
+耍把戏 11.9547675029
+船费 13.900677652
+社会变革 9.84023464143
+经查 9.96885201925
+曼虫 12.8020653633
+精得很 13.900677652
+上万只 13.2075304714
+闲逛 10.0505300503
+官品 10.1394775363
+弗里克 12.5143832909
+闲适 10.0294766411
+著名景点 13.900677652
+辐射源 10.3453295905
+均告 10.9562386728
+硬伤 10.5684731418
+委办局 11.1280889297
+高岩 12.8020653633
+千恩万谢 10.4041700905
+闲逸 12.1089181827
+服起 13.900677652
+消防人员 10.7226238216
+珲春 10.604840786
+何宝林 13.900677652
+尤特凯 12.5143832909
+母子 8.33999602096
+小柴胡 12.2912397395
+酒税 11.8212361103
+同伙 9.49395840471
+杨伯恺 13.2075304714
+温莎堡 12.2912397395
+蒙特克里斯蒂 13.2075304714
+进退无据 13.900677652
+经术 11.1926274509
+小康家庭 13.2075304714
+钝化 10.9049453784
+零零 9.40086798165
+堂堂 8.53938548627
+康路 13.900677652
+米利亚 13.2075304714
+福祸 11.8212361103
+捐衣 13.900677652
+从轻 9.87532596124
+摩天大厦 13.900677652
+合围 9.34680076038
+祈求 9.22784881751
+马上正 13.2075304714
+近身 10.2897597393
+转盘 10.3171587135
+保州升 13.2075304714
+抽奖 9.85762638414
+嗣业 13.2075304714
+四川大学 10.1630080337
+学术争论 13.2075304714
+经期 9.82314020807
+捐血 13.2075304714
+久安长治 13.2075304714
+病假 11.3357282945
+追查责任 12.1089181827
+医道 10.9049453784
+观音洞 11.8212361103
+昭宁 10.4349417492
+拆洗 10.6818018271
+新官上任 11.4157710022
+方外之人 12.2912397395
+字顺索引 13.900677652
+二十三两三 13.2075304714
+账簿 10.0940151622
+子汤浇 13.900677652
+昭宗 11.0103058941
+航空工业总公司 13.2075304714
+不露声色 10.4666904475
+遮阳篷 13.900677652
+莫此为甚 12.2912397395
+酒窖 12.1089181827
+低压 8.94485059437
+酒窝 10.3171587135
+历史组 12.2912397395
+尔公 11.5027823792
+赞不绝口 10.2117981979
+小题大作 11.598092559
+花园别墅 11.1926274509
+贾米森 12.8020653633
+监视 7.84155445639
+高士达 12.5143832909
+现实斗争 11.7034530746
+偶感 10.9562386728
+松花江 8.71329184614
+攻击面 13.2075304714
+花色素 12.5143832909
+前程万里 12.1089181827
+溢美之辞 13.2075304714
+雄蕊 8.39534611604
+文件尺寸 13.2075304714
+起伏跌宕 11.0674643079
+长明灯 10.8561552143
+黔首 11.598092559
+频密 12.2912397395
+文明礼貌 13.2075304714
+少将军官 13.900677652
+和桐城 13.900677652
+全弹 10.8561552143
+递归论 11.7034530746
+相互促进 10.1394775363
+诚实信用 9.66657114738
+光通信 11.0103058941
+经营场所 11.0674643079
+佯嗔 13.2075304714
+贡扎加 12.5143832909
+拼音文字 9.94943393339
+堂客 11.5027823792
+周期率 13.2075304714
+酒神 10.6818018271
+倒三角形 11.9547675029
+许多匹 13.2075304714
+康斯坦丁 11.598092559
+中华人民共和国澳门特别行政区 12.8020653633
+宋军旗 12.2912397395
+柳条筐 12.2912397395
+别国 9.35738286971
+桑柔 13.2075304714
+噩梦般 11.8212361103
+涑水 11.8212361103
+埃里克 11.598092559
+老宁 10.7226238216
+遁世隐居 13.900677652
+金鸡消息 13.2075304714
+选人 10.5684731418
+一张一驰 13.900677652
+投一票 13.900677652
+鸡冠石 12.8020653633
+电椅 12.5143832909
+转生 10.604840786
+麻酥酥 12.8020653633
+钩出来 13.2075304714
+赔额 13.900677652
+通讯处 12.1089181827
+异氰酸酯 11.8212361103
+斧子 10.0720362555
+引滦入津 10.9562386728
+转用 11.598092559
+累加 10.5684731418
+乙方 10.9049453784
+二十几岁 10.8096351986
+基顿 11.7034530746
+转由 10.5684731418
+库尔特 11.7034530746
+任封疆 13.2075304714
+迪达 12.5143832909
+同位 11.4157710022
+桓瞿 11.9547675029
+十二周 13.900677652
+砖片 13.900677652
+受奖 11.598092559
+纪念照 13.900677652
+总面积 7.28461246684
+赶起来 12.5143832909
+分数线 10.6818018271
+山远水 13.900677652
+回覆 11.0103058941
+游戏 7.18893725692
+忍无可忍 9.87532596124
+飞沙走石 10.9049453784
+面有 10.4349417492
+非可小觑 13.900677652
+矛盾转化 13.2075304714
+保卫者 11.598092559
+阿联酋 8.55357012126
+茶叶蛋 10.8561552143
+三十二卷 11.2616203224
+慎审 12.8020653633
+面朝 10.0505300503
+明艳照人 13.2075304714
+温经汤 12.8020653633
+太甲训 12.8020653633
+尔克 12.5143832909
+面条 8.57766767284
+倨傲 10.9049453784
+钦点 11.1926274509
+习于久 13.900677652
+圣书 11.2616203224
+托木河 13.2075304714
+乱喊乱叫 12.5143832909
+堂子 10.9562386728
+叠起 11.1280889297
+宋军攻 12.8020653633
+受够 12.8020653633
+京汉铁路 10.0294766411
+柳条箱 11.9547675029
+面板 9.32596667347
+南方共同市场 12.2912397395
+大麻哈鱼 11.0674643079
+苏伊士湾 12.1089181827
+鲁剌氏 12.5143832909
+奋勇前进 13.2075304714
+许多叶 12.8020653633
+减灾 10.8096351986
+克伦尼 13.900677652
+兔起鹘落 13.900677652
+黄安正 12.5143832909
+贝加尔 10.4349417492
+集训班 13.900677652
+一纸空文 10.1871055853
+但润叶 12.1089181827
+扔弃 13.900677652
+扔开 12.1089181827
+假如 7.56739802384
+旅游车 12.2912397395
+不足挂齿 12.1089181827
+冀宁 11.8212361103
+累及 9.63799777493
+三对六面 12.8020653633
+千人所指 13.2075304714
+山推股份 11.5027823792
+白天明 12.8020653633
+显贵 9.37888907493
+图灵 11.1280889297
+大都城 10.765183436
+二板 12.5143832909
+企业破产 10.2630914922
+库朗特 13.2075304714
+腿力 12.8020653633
+经文 8.98069672615
+退缩 9.08039608637
+筛板 12.5143832909
+飙车 11.8212361103
+目鱼 11.5027823792
+电桥 11.8212361103
+鄂温克族自治旗 12.2912397395
+巴列东 13.2075304714
+商伯维 13.2075304714
+据实相告 13.2075304714
+乔治王岛 12.2912397395
+堂嫂 12.8020653633
+珠泪 11.7034530746
+同侪 11.8212361103
+投光灯 12.5143832909
+母奶 12.5143832909
+母女 8.7245279194
+腿勤 13.900677652
+惯打 13.900677652
+快船 9.91169360541
+于李乎 13.900677652
+于李之 13.900677652
+公率军 13.2075304714
+申报者 12.8020653633
+过上 9.59661255877
+言传身教 11.8212361103
+屠毒笔墨 13.900677652
+博蒙特 12.8020653633
+果洛藏族自治州 11.4157710022
+陈云裳 13.900677652
+爪儿 13.2075304714
+企业局 13.2075304714
+腺苷酸环化酶 12.8020653633
+九里香 13.2075304714
+康迪 13.2075304714
+电棒 10.4041700905
+伦多夫 12.1089181827
+低凹 12.1089181827
+容错过 11.7034530746
+盐碱化 11.1926274509
+全川 12.5143832909
+绝少 10.8096351986
+沱牌 10.3743171274
+建军节 12.8020653633
+从起 13.2075304714
+桦甸县 13.2075304714
+河务局 12.8020653633
+外交途径 11.2616203224
+铁木迭 11.5027823792
+拾音器 13.2075304714
+宣至殿 12.5143832909
+日月入怀 13.900677652
+筛查 9.56994431169
+走江湖 11.8212361103
+砍树 11.0674643079
+累卵 12.2912397395
+丢在脑后 13.2075304714
+钟表匠 12.5143832909
+万亿千瓦时 12.1089181827
+万化之 13.2075304714
+五七十拳 13.900677652
+丸药 10.3453295905
+无官一身轻 12.2912397395
+高时明 13.2075304714
+陈高华 10.9562386728
+一再强调 9.91169360541
+妥善解决 10.2897597393
+农奴主 10.8096351986
+康达 11.598092559
+七九六十三 12.5143832909
+李飞黄 9.08039608637
+张无邪 13.2075304714
+天冬酰胺 13.900677652
+监试 13.2075304714
+腐臭味 12.8020653633
+张问仁 13.2075304714
+库尔班 11.8212361103
+小鸟儿 13.2075304714
+立案 8.21709788464
+康辉 12.5143832909
+动画短片 13.2075304714
+电梯 8.85725253506
+松花湖 11.0103058941
+齐明 11.1926274509
+珠江 8.42421410004
+加权指数 10.6818018271
+凝聚力 9.34680076038
+各政党 11.0103058941
+湖南人民出版社 12.1089181827
+于建炎 12.1089181827
+朱今明 12.1089181827
+报报 13.900677652
+装备 5.96903363052
+旃檀 11.598092559
+制袋机 13.900677652
+实言 12.8020653633
+间隙连接 13.900677652
+陈百祥 12.8020653633
+朝右边 13.2075304714
+低买 12.8020653633
+酒杯 8.07763175649
+骈文 9.91169360541
+游业 13.2075304714
+面禀 11.2616203224
+转正 7.52225146832
+星光奖 13.2075304714
+抗凝血酶 13.900677652
+降水强度 12.1089181827
+左忠毅 12.5143832909
+珠玑 11.1926274509
+装夹 12.5143832909
+南汇县 12.5143832909
+粉面 10.6818018271
+兴致索然 13.2075304714
+无私有意 13.900677652
+中电投 10.9049453784
+珠珠 12.8020653633
+吊得 11.9547675029
+勤快 9.87532596124
+养其子 13.2075304714
+三十六行 12.8020653633
+面积 5.18005394056
+喜筵 12.8020653633
+老屋里 12.2912397395
+奥德 11.2616203224
+导磁率 13.900677652
+魏孝文帝 9.72629038208
+豆类蔬菜 13.900677652
+金鱼草 13.2075304714
+电眼 12.2912397395
+低下 7.74369866639
+受到谴责 12.1089181827
+量子力学 9.04086524761
+省吃俭用 10.7226238216
+矿业城市 12.1089181827
+装好 10.2630914922
+全归 10.765183436
+伊诺特 13.2075304714
+截击机 10.765183436
+上山下乡 10.3171587135
+转款 13.2075304714
+奥得 13.2075304714
+乙等 13.900677652
+次氯酸盐 13.2075304714
+刑部议 12.1089181827
+焊接件 12.2912397395
+赫尔穆特 13.900677652
+康郡 12.1089181827
+中法战争 9.43476953332
+买一送一 13.900677652
+沙克 10.9562386728
+旅游部 13.900677652
+钱龙锡 13.900677652
+武平 10.9562386728
+商务考察 13.900677652
+万里长城 9.98865464655
+移植术 11.598092559
+达坂山 11.1280889297
+西大街 10.5684731418
+箱体 8.60236028543
+低价 7.99259471381
+游击战 9.54396882529
+小儿科 11.1926274509
+酒柜 11.9547675029
+郭庆藩 12.8020653633
+密封地 13.900677652
+电石 9.07236391467
+香茅草 12.1089181827
+罗世文 13.2075304714
+库尔河 12.8020653633
+缪文远 12.5143832909
+联信 13.900677652
+些微 10.8096351986
+南汇区 10.604840786
+挟藏 13.900677652
+康邦 13.2075304714
+材料力学 10.8561552143
+云林坪 12.8020653633
+自告奋勇 9.77354326693
+史梅国 12.8020653633
+受不得 10.9049453784
+人给家足 13.2075304714
+低产 11.0674643079
+低人 13.900677652
+浏览量 11.9547675029
+报批 9.89334446674
+良种化 13.900677652
+阿肯色州 11.5027823792
+恨之入骨 10.1871055853
+硬功 12.1089181827
+武广 10.1394775363
+西红柿 9.40086798165
+荀蔼谏 12.5143832909
+立着 9.32596667347
+低于 5.87320112112
+回音 9.55687223012
+锡金人 13.900677652
+游击手 13.900677652
+一抢而光 13.2075304714
+挺进 8.78868986362
+低云 11.2616203224
+高远球 12.8020653633
+照出去 13.2075304714
+竹园村 13.900677652
+盛乐迁 11.598092559
+绝情谷 13.900677652
+亚大 12.2912397395
+住个 12.8020653633
+压进 11.9547675029
+经管 9.71102290995
+联邦军 11.8212361103
+抵过 12.8020653633
+解囊相助 12.1089181827
+亚麦杜 13.900677652
+电白 12.5143832909
+硬卧 12.1089181827
+拦截器 12.5143832909
+住下 9.62401153296
+许氏 11.9547675029
+鱼子 11.5027823792
+小神 10.765183436
+雷科雷 13.900677652
+回防 11.9547675029
+惠安 10.8561552143
+行政职务 11.598092559
+吹瓶机 13.900677652
+师太 13.2075304714
+创立者 9.59661255877
+梅津美 12.2912397395
+惠宗 11.5027823792
+砖混 12.1089181827
+鲜菜 11.598092559
+约略为 13.900677652
+师大 10.9562386728
+据守 9.28555713513
+推已及人 13.900677652
+电视界 13.2075304714
+瓦尔德 10.4349417492
+运动神经元 10.9562386728
+街坊邻里 11.9547675029
+装岩机 13.2075304714
+和冶铸 11.8212361103
+两百余篇 13.2075304714
+硬化 9.02548032877
+浦口 10.0505300503
+名人堂 13.2075304714
+遮阳板 13.2075304714
+开天辟地 10.1871055853
+过为 12.2912397395
+戊二烯 13.2075304714
+闲谈 9.36807815882
+董解元 11.9547675029
+浦发 9.98865464655
+抵达 7.64877376881
+装填 8.9308643524
+巨大工程 12.5143832909
+介入性 12.5143832909
+阿尔喀 13.900677652
+姐弟俩 10.642581114
+师奶 12.8020653633
+遍览 11.7034530746
+科学界 9.72629038208
+密闭式 11.8212361103
+浦参 12.5143832909
+和冶铁 11.598092559
+许汜 12.5143832909
+悬空 9.63799777493
+扩建工程 10.642581114
+气喘如牛 12.5143832909
+虚无缥缈 10.4041700905
+酒曲 11.2616203224
+挺身 9.15574552361
+十七世纪 10.3743171274
+乘火车 10.8561552143
+报酬率 11.3357282945
+沱江 9.96885201925
+二百三十 11.5027823792
+席相陪 12.2912397395
+六十七万九千多亿元 13.2075304714
+硬变 11.9547675029
+师妹 10.1630080337
+淡绿色 10.533381822
+影视业 12.2912397395
+浦北 12.1089181827
+特格斯 12.2912397395
+康里 11.5027823792
+不时之需 11.1280889297
+偏蓝 13.900677652
+封杀令 12.2912397395
+腮腺炎 11.4157710022
+于元丰 13.2075304714
+面砖 13.900677652
+低保 10.3743171274
+滴得 13.900677652
+仔细 6.57684708577
+乐理 11.598092559
+矫枉过正 11.598092559
+法门寺 11.0103058941
+低俗 9.04086524761
+突变体 12.1089181827
+春梦一场 13.900677652
+十二万四千担 13.2075304714
+刻画 7.89186446653
+师姐 11.8212361103
+冯元桢 13.900677652
+电视病 13.900677652
+讲武堂 10.4666904475
+灌来灌去 13.900677652
+含水量 9.62401153296
+袁珂 13.2075304714
+陌生 7.75864024639
+现状 7.26473109629
+报捷 9.77354326693
+张啸林 11.7034530746
+布塞进 12.1089181827
+部委级 12.8020653633
+经筋 12.1089181827
+拳头产品 11.0674643079
+强制处分 13.2075304714
+浦南 13.2075304714
+程昱谏 13.2075304714
+奥布 11.8212361103
+惠子 13.2075304714
+幼蝉 13.900677652
+陶朗加市 13.900677652
+石屑 12.5143832909
+火温 13.900677652
+潘素梅 13.2075304714
+师娘 10.0294766411
+组配 11.7034530746
+乙种 11.598092559
+黄赤白 13.900677652
+骈枝 13.900677652
+打祭 13.2075304714
+今镇江 11.3357282945
+挨整 11.2616203224
+系辞 10.7226238216
+巴罗 10.0505300503
+社区化 13.900677652
+纳米材料 11.7034530746
+五十公里 12.1089181827
+三百多年 11.2616203224
+回锅 12.5143832909
+逐渐 5.14872859392
+阵风 9.96885201925
+逃逸速度 13.900677652
+全律 12.5143832909
+傅孟真 13.900677652
+鱼塘 9.75754292558
+串连 9.93038573842
+僵蚕 12.8020653633
+提供援助 10.4041700905
+巨无霸 9.66657114738
+拓宽道路 13.900677652
+淋洗 11.1926274509
+曹洪引 12.5143832909
+封建主义 9.30555780184
+革新运动 10.6818018271
+光复旧物 13.900677652
+发展史 8.23771717184
+新教材 13.2075304714
+龙飞凤舞 10.9049453784
+当学徒 10.1630080337
+公正廉明 13.900677652
+曲歌辞 12.5143832909
+低下头 8.81927328699
+凡尔赛宫 10.533381822
+目脑 12.5143832909
+挺起 9.49395840471
+师婆 13.2075304714
+胡静 12.8020653633
+安装费 13.900677652
+富口俭 12.8020653633
+布智儿 13.2075304714
+叛乱分子 13.2075304714
+塔木德 11.7034530746
+轰下去 12.8020653633
+沉寂已久 12.8020653633
+爵床科 12.8020653633
+渗碳体 12.5143832909
+咨询点 13.2075304714
+累人 11.1280889297
+原平县 12.8020653633
+顶尖级 12.2912397395
+卷轴式 12.5143832909
+实验楼 13.900677652
+穆河 12.8020653633
+洗头发 12.1089181827
+组里 11.1280889297
+副耳机 13.900677652
+报怨 10.5684731418
+化学肥料 11.1926274509
+劳动保险 11.9547675029
+老骥伏枥 12.2912397395
+气筒 11.2616203224
+共存共荣 12.8020653633
+任法军 13.2075304714
+徐元吉 13.2075304714
+和诺雷 13.900677652
+孝弟 13.900677652
+三二百里 13.2075304714
+赵二哥 13.900677652
+豆科植物 10.1871055853
+酒旗 11.598092559
+李宝和 12.8020653633
+哨楼 13.900677652
+礼成 13.900677652
+太阴星 11.598092559
+概率模型 12.5143832909
+偶性 13.2075304714
+妇科医生 11.1926274509
+宋改为 11.9547675029
+田豫 12.8020653633
+联邦制 9.80633308975
+航业公司 13.900677652
+花花草草 12.1089181827
+报恩 10.1394775363
+去极化 12.2912397395
+双丰收 11.1926274509
+电疗 11.0103058941
+焙乾 13.900677652
+宪纲 13.2075304714
+玄大怒 13.900677652
+死棋 11.5027823792
+长安道上 12.8020653633
+商品目录 12.8020653633
+乳晕 10.7226238216
+锓缂 13.900677652
+累世 11.1926274509
+沙僧依 13.2075304714
+展弦比 11.1280889297
+大到暴雨 12.8020653633
+奇技淫巧 11.9547675029
+水顺 13.900677652
+有过之无不及 11.9547675029
+外来词 11.598092559
+新兴势力 13.900677652
+陆栖性 12.8020653633
+纯音乐 12.5143832909
+那口凤 13.2075304714
+药捻 12.8020653633
+挨斗 10.5684731418
+胡光墉 12.8020653633
+面筋 10.642581114
+回门 10.765183436
+错位原子 13.900677652
+小题大做 11.2616203224
+从速 9.96885201925
+辽宁队 12.1089181827
+刻石 9.98865464655
+硬充 12.2912397395
+长途费 11.1280889297
+蒸汽机 8.81308131674
+乐于助人 11.5027823792
+许多丝 13.900677652
+望着慧 11.8212361103
+石阶 8.9102450652
+叙及 13.2075304714
+纨裤子弟 13.900677652
+遍访 10.765183436
+惠妹 13.900677652
+些小 9.98865464655
+张树新 13.2075304714
+肇事人 13.2075304714
+从重 10.4994802703
+巡回展览 11.2616203224
+公司出品 12.2912397395
+宗建炎 13.2075304714
+饿极了 11.7034530746
+郭子兴 11.1926274509
+挥舞 8.85725253506
+中等教育 10.2897597393
+鸟瞰图 12.8020653633
+莒南县 13.2075304714
+伤风感冒 11.7034530746
+瘰疬 11.1280889297
+大赦天下 10.765183436
+鱼头 10.0720362555
+两百余种 12.5143832909
+帆影 11.9547675029
+议事规则 11.598092559
+戴维南 12.8020653633
+师子 11.9547675029
+选修 11.0103058941
+酌处 12.5143832909
+干事会 12.1089181827
+张易之 11.1926274509
+国有资本 9.61021821083
+莪术 13.2075304714
+大排档 12.1089181827
+哲学学派 12.1089181827
+戏水 11.1280889297
+贾府中 11.5027823792
+祁连 10.5684731418
+退换 11.598092559
+穆赞穆 13.2075304714
+转校 12.5143832909
+香腮 11.7034530746
+抵足 13.900677652
+花轿 9.80633308975
+从金境 12.8020653633
+天狼星 10.3171587135
+朋友圈 12.5143832909
+封特进 12.8020653633
+低钾血症 11.2616203224
+铁素体 12.1089181827
+阿萨姆 10.3171587135
+收生 13.900677652
+宣传材料 11.0674643079
+滇缅公路 11.0674643079
+雄风 10.4041700905
+杜瓦利 11.9547675029
+师实 13.900677652
+沱湖 12.5143832909
+基本规律 9.59661255877
+退掉 11.2616203224
+英雄本色 10.6818018271
+公款消费 12.1089181827
+雄飞 10.642581114
+经社 11.8212361103
+不痴不聋 13.2075304714
+后墙 11.0674643079
+中性点 11.598092559
+一时半会儿 10.1164880181
+商之引 13.2075304714
+壮苗 11.3357282945
+售让 13.2075304714
+田见暖 12.8020653633
+齐头并进 10.4994802703
+静虚 13.900677652
+电瓷 11.0674643079
+电瓶 11.1280889297
+骨伤科 13.2075304714
+图法 12.8020653633
+少量多次 11.9547675029
+心理现象 10.0505300503
+刻着 9.75754292558
+归科布 12.8020653633
+湿润指数 13.900677652
+百家乐 12.8020653633
+王移兵 12.8020653633
+戏法 10.3743171274
+强烈要求 9.77354326693
+蘸水笔 12.8020653633
+账户 6.6373480345
+本利和 12.8020653633
+仰面朝天 10.8561552143
+三十二三 13.2075304714
+郭皇后 13.2075304714
+咬群 13.900677652
+索纳塔 13.900677652
+账房 10.2117981979
+言直谏 13.2075304714
+公正处理 12.1089181827
+并行计算 12.1089181827
+农奴制 9.12999302751
+深吸气 12.2912397395
+绥远省 11.8212361103
+诱降 9.85762638414
+万万千千 12.8020653633
+小农经济 10.4666904475
+沙僧亦 12.8020653633
+换汤不换药 12.1089181827
+玫瑰红色 11.4157710022
+一千一百里 13.900677652
+成都平原 9.66657114738
+三十二个 12.8020653633
+旁注 13.2075304714
+计丁授 12.8020653633
+璀灿 12.5143832909
+筛管 11.3357282945
+寻梦园 13.900677652
+硬冲 12.1089181827
+许多代 12.5143832909
+磷酸激酶 13.900677652
+奥尔 9.84023464143
+萨满跳 11.8212361103
+蝤蛑 12.5143832909
+张三李四 11.7034530746
+王中书 13.2075304714
+嘀嘀 11.1926274509
+经纬 9.53122979951
+鱼干 11.8212361103
+经纪 7.92686804011
+奥尔纳 13.2075304714
+不讲情面 12.8020653633
+莲花落 11.1280889297
+丙寅日 12.1089181827
+香芋 12.1089181827
+竣工 7.99259471381
+记事儿 12.1089181827
+师尊 12.2912397395
+监造 10.4994802703
+立现 12.5143832909
+内摩擦 11.5027823792
+经纶 11.8212361103
+孙子辈 11.598092559
+朱祁钰 11.5027823792
+经纱 10.5684731418
+师尹 13.2075304714
+奥河 13.900677652
+喷出去 11.8212361103
+贵族学校 11.8212361103
+癌细胞 9.98865464655
+聪颖 10.3453295905
+照数 11.7034530746
+仙鹤 10.0720362555
+花心思 11.4157710022
+慈禧笑 12.2912397395
+步唯艰 13.900677652
+罗马教会 11.0674643079
+何得相 12.8020653633
+化验单 12.5143832909
+阿卡德 10.4666904475
+噬脐莫及 13.2075304714
+薄荷叶 12.5143832909
+延津 8.92394390956
+许楣 12.8020653633
+蔡廷锴 11.0674643079
+翁奎 13.2075304714
+叠音 13.2075304714
+飘飘悠悠 13.900677652
+叠韵 11.598092559
+中古史 11.4157710022
+据库 13.900677652
+海克尔 11.598092559
+挨挤 11.9547675029
+十字星 10.1630080337
+指令舱 12.2912397395
+奸滑 11.7034530746
+奔头儿 13.900677652
+肚子疼 10.2371160058
+鳏寡孤独 12.5143832909
+宣杭线 12.5143832909
+复制技术 12.2912397395
+经络 8.87679713113
+鱼市 10.9049453784
+太元 10.5684731418
+征兵站 13.900677652
+暴饮暴食 10.7226238216
+媒体广告 13.2075304714
+福宁州 13.900677652
+蔡节级 12.8020653633
+佩雷斯 10.8561552143
+宋廷削 13.2075304714
+刚愎 10.765183436
+光州 10.765183436
+凭肉眼 12.8020653633
+加压力 12.8020653633
+软绵绵 10.0088573539
+巴斯克语 12.2912397395
+生子谅 13.2075304714
+数亿个 13.2075304714
+杭州市区 11.9547675029
+多谋 10.6818018271
+经销部 13.900677652
+二百一十卷 12.5143832909
+吕阁老 9.91169360541
+塘边 11.7034530746
+敝友 13.2075304714
+碧蓝色 12.8020653633
+钒酸盐 12.8020653633
+康铜 13.2075304714
+吃药前 13.900677652
+电珠 13.900677652
+惠帝 9.82314020807
+陈建 11.5027823792
+廉一科 12.8020653633
+大致说来 11.4157710022
+勤学 11.7034530746
+韩彦直 13.2075304714
+特尔纳 13.2075304714
+处理事务 11.8212361103
+惠平 12.8020653633
+历来如此 12.5143832909
+纺纱机 10.7226238216
+植茶公 13.2075304714
+通灵术 13.2075304714
+碗盘 12.1089181827
+生产量 9.45802639549
+馏程 12.8020653633
+庆阳地区 12.5143832909
+杀人者 10.9562386728
+司马康 12.8020653633
+巴林塘海峡 13.2075304714
+电玩 12.5143832909
+袒露出 12.8020653633
+发展商 10.5684731418
+机械系统 11.9547675029
+赵向齐 13.2075304714
+深情款款 13.900677652
+恐吓威胁 13.900677652
+报晓 10.533381822
+官无禄 12.5143832909
+挨批 11.1926274509
+掴耳光 13.900677652
+硃砂 12.2912397395
+娶个 10.765183436
+阿萨德 11.7034530746
+乙组 13.900677652
+一枚 8.0285598625
+水管系 13.900677652
+游离 8.1386262692
+鱼形 11.2616203224
+游禽 12.1089181827
+凌云之志 13.900677652
+组限 12.8020653633
+国家开发银行 9.40086798165
+二百九十四卷 12.2912397395
+挨打 9.03314320152
+巴雾河 12.5143832909
+面粉 8.13235665618
+八成新 13.900677652
+售货 11.1926274509
+雄鹿 11.5027823792
+年逾花甲 12.1089181827
+单组分 12.8020653633
+敬轩会 13.2075304714
+天轴 13.900677652
+瓦尔密 13.2075304714
+秩边 13.900677652
+锄地 10.9049453784
+三门四户 12.2912397395
+识字率 11.4157710022
+挨户 11.8212361103
+退敌 10.9562386728
+柴达木 9.58318953844
+鱼弦 13.2075304714
+雄鸟 9.45802639549
+和瓦霞 11.9547675029
+无定形碳 12.2912397395
+汝三人 12.5143832909
+第三十次 13.900677652
+三句话 10.8096351986
+葛仙翁 12.2912397395
+概不赊欠 13.2075304714
+环戊二烯 11.598092559
+博士后 10.8096351986
+云天雾地 13.900677652
+亲口说 11.0674643079
+股骨颈 13.2075304714
+反倾销税 8.93783302172
+面糊 11.7034530746
+雄鸡 9.58318953844
+惠良马 13.2075304714
+孙自法 13.900677652
+硬地 11.5027823792
+唐三省 12.8020653633
+底层 8.45825994145
+郭图谓 13.2075304714
+玄武巨 12.8020653633
+浦城 11.3357282945
+路总管 12.2912397395
+肤觉 12.1089181827
+针鼻 13.2075304714
+酒拳 13.900677652
+侨居国 13.900677652
+雄黄 10.533381822
+逆流而行 13.2075304714
+众矢之地 13.900677652
+康门 11.8212361103
+娶亲 9.75754292558
+千秋大业 12.1089181827
+相碰撞 12.8020653633
+宫见朕 13.900677652
+战强敌 13.900677652
+蒂托 12.5143832909
+相合 9.19114745066
+退料 13.900677652
+对照组 12.8020653633
+劝募 12.2912397395
+李公朴 11.3357282945
+密山市 12.5143832909
+同人 9.80633308975
+诱逼 11.7034530746
+甩掉 9.22784881751
+德州人 13.2075304714
+肛肠 12.8020653633
+回銮 11.0674643079
+经编 10.604840786
+交通标志 10.9049453784
+窗前 8.56795885871
+斯山脉 12.5143832909
+亚美尼亚人 10.533381822
+美宇航局 13.2075304714
+贪小失大 13.900677652
+礼数 9.74179456862
+大晟府 12.2912397395
+不论什么 10.642581114
+未消化 13.900677652
+录影带 12.8020653633
+延河 10.9049453784
+周泰引 12.2912397395
+妹儿 8.61747392324
+智深勇 12.5143832909
+礼敬 10.533381822
+瘦弱不堪 13.2075304714
+叫绝 11.3357282945
+武引 13.900677652
+命蹇时乖 13.900677652
+构件技术 13.900677652
+煎起来 13.900677652
+扳回 11.5027823792
+揭露出 11.598092559
+侯生 12.2912397395
+金界壕 12.8020653633
+丁基橡胶 12.1089181827
+社会变迁 10.1871055853
+礼教 10.2117981979
+燃烧弹 9.94943393339
+中性盐 13.900677652
+游神 11.7034530746
+唐古征 13.2075304714
+中国少年儿童出版社 13.900677652
+九龙半岛 10.9049453784
+磅湛省 13.2075304714
+名人录 12.5143832909
+职业资格 12.1089181827
+保有量 9.36807815882
+航天局 11.1926274509
+鱼山 12.8020653633
+睡觉时 9.80633308975
+均会 10.4041700905
+遍身 11.5027823792
+同事 7.80035869996
+实用阶段 10.8561552143
+康陵 11.9547675029
+戏楼 9.46986085313
+支持性 11.0674643079
+孟州道 12.2912397395
+惠岸 11.1926274509
+硃笔 12.8020653633
+哈迪 11.7034530746
+形势逼人 13.2075304714
+悬索 11.8212361103
+散兵坑 12.5143832909
+武弁 11.4157710022
+零售量 12.2912397395
+查耶卡 13.2075304714
+奥姆 12.5143832909
+小队人马 10.8096351986
+雁飞 12.5143832909
+港台明星 13.2075304714
+组长 8.34771806705
+扩厂 13.2075304714
+别价 12.8020653633
+港交所 9.49395840471
+浦和 13.2075304714
+鱼尾 10.2897597393
+遮架 12.1089181827
+电视片 11.8212361103
+册叶 13.900677652
+集中精力 9.54396882529
+电焊 10.642581114
+洲界 13.900677652
+火成岩 9.49395840471
+超固态 13.900677652
+林冲正 13.2075304714
+加够 13.900677652
+手推 10.9562386728
+来劲儿 11.9547675029
+张东健 13.900677652
+三千五百 11.8212361103
+两万五千余 13.2075304714
+奥妙 9.23723855786
+广西南宁 10.4666904475
+别人 5.58486652009
+酒意 10.1871055853
+清新县 13.900677652
+地质所 11.598092559
+日德意 12.8020653633
+拉贝尔 13.900677652
+鱼峰 13.2075304714
+锯片 13.900677652
+闲话 8.089536659
+这么着 9.08039608637
+电疗法 13.2075304714
+伟大成就 11.1926274509
+增创 13.2075304714
+谢赫山 13.900677652
+嘀咕 9.01787572939
+装得 9.30555780184
+宪章 8.91707103027
+急救车 10.9049453784
+游程 11.598092559
+哈哈笑 9.91169360541
+古拉拉 13.2075304714
+王刘骏 12.8020653633
+康雍 13.2075304714
+詹姆斯 9.00283785202
+老熊岭 10.0294766411
+嘴馋 11.4157710022
+翁家 12.5143832909
+抵补 11.5027823792
+刻版 10.8561552143
+汉昭帝 10.642581114
+句容县 12.2912397395
+二十七家 12.8020653633
+预付费 12.8020653633
+于金陵 11.1280889297
+电熔 13.2075304714
+滑冰馆 12.5143832909
+面罩 10.0505300503
+遮蔽物 11.5027823792
+瓦尔堡 12.8020653633
+乌孤筑 13.2075304714
+惠山 10.765183436
+表兄妹 12.2912397395
+非惯性系 11.9547675029
+断枝 12.2912397395
+别业 10.9562386728
+叶孔目 12.1089181827
+账本 10.1871055853
+全局 8.27666014579
+回采 11.0674643079
+康隆 11.0674643079
+经籍 9.26594866375
+勤奋 9.20932976975
+报摊 12.8020653633
+葛仙米 13.2075304714
+务川 12.8020653633
+远程结构 13.900677652
+核酸 9.02548032877
+阿曼苏丹国 13.2075304714
+折叠床 13.900677652
+投影仪 11.8212361103
+面网 12.8020653633
+二千万两 13.900677652
+奥多 12.5143832909
+别为 11.0674643079
+万事万物 10.604840786
+沙剌班 13.2075304714
+挖下来 11.8212361103
+鸡蛋里挑 13.2075304714
+筛网 13.2075304714
+师弟 9.58318953844
+面红 12.1089181827
+绒绳 12.2912397395
+领导作风 12.2912397395
+七尺之躯 12.8020653633
+秦震派 13.2075304714
+电灌 13.2075304714
+桓温 10.4666904475
+逐次 9.77354326693
+啃骨头 11.7034530746
+面纱 9.27570483869
+先从 13.2075304714
+绒绣 11.598092559
+回退 10.642581114
+跪拜礼 11.0103058941
+萨拉西 13.2075304714
+面纸 12.1089181827
+退朝 10.3453295905
+额外开支 13.2075304714
+张千英 10.765183436
+弗之笑 11.8212361103
+祈盼 13.2075304714
+报文 11.598092559
+电灶 11.9547675029
+图案 7.52906580474
+电灯 8.88339781516
+报料 10.604840786
+秋纹笑 12.1089181827
+退机 12.1089181827
+阳尊怀 13.2075304714
+抵触 8.9102450652
+铺张浪费 11.7034530746
+荣誉榜 13.900677652
+横行不法 12.1089181827
+值得尊敬 12.2912397395
+任藩镇 12.8020653633
+闵慧芬 13.2075304714
+回道 8.0600359946
+戏校 12.5143832909
+图样 10.533381822
+辐射性 13.900677652
+官六卿 12.8020653633
+郁怒伤 12.5143832909
+王世泰 13.2075304714
+逐步 5.53314523511
+达尔金 13.2075304714
+报时 10.0505300503
+扭怩 13.900677652
+附加条件 10.7226238216
+伊斯梅利亚 11.8212361103
+封建割据 10.1164880181
+佐贺县 12.5143832909
+回避 7.29402746578
+周文矩 12.8020653633
+核配 12.8020653633
+售车 12.1089181827
+注文 11.0103058941
+专注 7.94743431769
+折叠式 10.0505300503
+惠州 9.38981814546
+传动带 12.8020653633
+翁婿 11.8212361103
+图标 11.7034530746
+宾根 10.8096351986
+句话 11.1280889297
+宾格 11.8212361103
+旺旺 10.2630914922
+组团式 12.8020653633
+师徒 8.27305653829
+言言殊 13.900677652
+顺便去 12.8020653633
+惯窃 13.900677652
+背景灯 13.2075304714
+别体 12.2912397395
+财务危机 10.5684731418
+转法 12.1089181827
+泡温泉 11.0103058941
+图森 12.8020653633
+报收 7.1542655234
+里外不是人 12.1089181827
+沙德尔 13.2075304714
+一时性 10.9562386728
+翁媪 13.900677652
+不可分割 9.28555713513
+师德 11.0103058941
+转注 12.2912397395
+电热 10.2371160058
+抽象概念 11.3357282945
+乙类 10.0940151622
+奥塞 12.5143832909
+电烫 12.8020653633
+新安县 10.0088573539
+礼服 9.31571017331
+均享 12.5143832909
+猜猜 10.0720362555
+延滞 12.2912397395
+才略 10.604840786
+大都会 9.74179456862
+黝暗 13.2075304714
+出让金 9.72629038208
+单元房 11.1280889297
+产品库 13.900677652
+嘀嗒 11.4157710022
+溜回来 12.5143832909
+窗幔 11.7034530746
+老家儿 12.1089181827
+实验法 11.8212361103
+最小限度 11.8212361103
+权势煊赫 12.5143832909
+钢结构 10.2117981979
+唐宪宗 10.1630080337
+戎战 12.8020653633
+报数 11.598092559
+津德尔 12.8020653633
+均价 7.47580862807
+别传 11.5027823792
+一盆 8.81308131674
+报效 9.56994431169
+学术史 10.8561552143
+别伤 12.8020653633
+地道口 12.1089181827
+有福气 10.7226238216
+旅游鞋 11.7034530746
+新攻势 11.598092559
+回部 11.1280889297
+关津识 12.8020653633
+多趟 12.2912397395
+洋地黄 11.4157710022
+庞兴雷 13.900677652
+璎珞 11.1280889297
+球团 12.1089181827
+抬过 10.604840786
+今古文 11.5027823792
+宋军班 12.2912397395
+秆子 11.1926274509
+慈禧眼 13.2075304714
+楼头 11.1926274509
+国家经贸委 12.5143832909
+立群 12.1089181827
+巴列夫 12.5143832909
+戏来 11.598092559
+电网 7.35676580641
+事不关己 11.7034530746
+许攸 11.1926274509
+密山县 13.900677652
+精神病院 10.3171587135
+偏航 11.8212361103
+黄崇简 12.8020653633
+转换 6.50987913024
+新教派 11.8212361103
+惯用 9.46986085313
+大气质量 12.1089181827
+利巴利 12.8020653633
+筵席 8.70218062071
+踏踏实实 10.4666904475
+母丑 13.2075304714
+珠算 11.0103058941
+衔儿 13.2075304714
+投桃报李 11.598092559
+面熟 9.93038573842
+国权臣 12.8020653633
+母丛 12.2912397395
+难以辨认 11.5027823792
+巴列奥 11.2616203224
+兄嫂 10.9049453784
+惜字 12.8020653633
+秋大梦 12.8020653633
+鱼刺 10.9562386728
+细胞学 9.82314020807
+扎入 11.4157710022
+任日中 12.8020653633
+海口市 8.11071748108
+祈福 9.45802639549
+母乳 10.3743171274
+爱勒特 13.2075304714
+中国天主教爱国会 12.5143832909
+电缆 8.31342899358
+巴洛克 9.69598503258
+愣怔怔 12.2912397395
+于一园 13.2075304714
+戏服 12.8020653633
+许敏 12.5143832909
+装入 9.06439574502
+拖地板 13.2075304714
+茎秆 10.3743171274
+惠勒 12.1089181827
+自慰队 12.8020653633
+斋供 10.8096351986
+节流过程 13.2075304714
+装具 10.533381822
+唐庄乡 12.2912397395
+见证人 10.5684731418
+联通新 13.900677652
+庙前街 12.8020653633
+祈祝 12.8020653633
+起电机 11.4157710022
+壮观 8.30225569298
+唿哨 10.2371160058
+比如说 7.43920947562
+路德维希 11.4157710022
+受体 9.14708746087
+母亲 5.8250950153
+马勃菌 12.5143832909
+旁枝 12.2912397395
+无需多说 13.900677652
+利他行为 12.1089181827
+水生植物 9.48183704418
+毁言 13.2075304714
+暗香疏影 12.8020653633
+目语 13.2075304714
+赤道气候 12.8020653633
+眼高手低 12.5143832909
+生子而 13.900677652
+加性效应 13.900677652
+石岘 11.0103058941
+祈祷 8.28027678626
+大连市人民政府 12.8020653633
+持有 5.53803522041
+宾朋 11.7034530746
+宾服 11.2616203224
+别再 12.2912397395
+道德品质 10.4349417492
+跟来 11.0103058941
+慈禧瞅 13.2075304714
+岂容 10.4666904475
+滑冰鞋 13.2075304714
+三三制 11.598092559
+践踏在 12.8020653633
+狂傲 11.9547675029
+科学系 12.2912397395
+转授 12.8020653633
+母仪 12.5143832909
+水电部 12.1089181827
+小东门 10.8561552143
+责任重大 10.3171587135
+教仪 12.8020653633
+无痛苦 11.7034530746
+万里长征 11.1926274509
+执笔人 13.2075304714
+师出无名 12.5143832909
+陈龙飞 9.94943393339
+迢迢千里 13.2075304714
+拗折 13.900677652
+转接 10.4041700905
+科广布 12.8020653633
+久拖不决 12.1089181827
+活不成 9.96885201925
+无良 11.0674643079
+赫尔索格 12.8020653633
+玉柄马 12.8020653633
+平面调车 13.900677652
+山保林 13.900677652
+牛顿流体 10.8096351986
+无人机 9.65218240993
+福宁殿 11.9547675029
+师僧 12.8020653633
+特曼 10.8561552143
+涿鹿 10.8561552143
+鱼卵 11.0103058941
+壮行 11.598092559
+立约 11.1926274509
+乐乎 12.1089181827
+赖世德 12.8020653633
+充血性 10.9049453784
+射程远 10.3171587135
+瓦尔基 12.1089181827
+翁同 8.04274449749
+免疫治疗 11.2616203224
+育婴师 12.8020653633
+奥国 11.598092559
+图普 13.900677652
+图景 9.71102290995
+明叔按 13.2075304714
+面点 11.7034530746
+转托 11.8212361103
+广电局 11.4157710022
+风行一时 11.2616203224
+赔还 13.900677652
+小型化 10.0505300503
+打情骂俏 10.8561552143
+哥斯达黎加队 13.2075304714
+希利 13.2075304714
+攻擂 13.900677652
+阿尔戈斯 12.2912397395
+科技战线 12.8020653633
+龙门阵 13.2075304714
+还款额 10.765183436
+乜斜 10.8096351986
+打上来 11.8212361103
+回鹘 8.76487921493
+实验所 10.4666904475
+歪戴 11.8212361103
+协会会长 9.36807815882
+延性 12.8020653633
+蒸汽浴 12.8020653633
+患难之交 10.7226238216
+毛骨悚然 9.38981814546
+受事 12.2912397395
+叫牌 11.1926274509
+花灯戏 13.2075304714
+铜山县 11.598092559
+志同道合 10.2897597393
+转成 9.75754292558
+工作进展 9.91169360541
+重上 10.1871055853
+桓鑫 12.1089181827
+方从哲 12.8020653633
+沃库勒 13.900677652
+一个十九岁 12.8020653633
+惠及 9.77354326693
+幽径 12.8020653633
+基岩 8.94485059437
+醛酸 11.5027823792
+逞一时之 12.8020653633
+阿坝州 12.8020653633
+碗筷 9.34680076038
+转户 13.2075304714
+人材出众 13.900677652
+闹场 13.900677652
+师公 10.8561552143
+从文华 11.9547675029
+好久不见 11.7034530746
+受人 9.05649056552
+鱼叶 12.8020653633
+韦斯皮 12.5143832909
+鱼贯而行 12.8020653633
+副总经理 7.55328844232
+鱼台 11.9547675029
+日趋激烈 10.3171587135
+垂注 12.5143832909
+懒懒散散 12.2912397395
+鹰拿燕雀 13.900677652
+不思进取 11.2616203224
+慈禧皱 13.2075304714
+海鲜类 12.8020653633
+照料 8.25877058104
+花岗岩石 12.5143832909
+孟达引 13.2075304714
+戏曲 7.67216664838
+洛桑 10.2630914922
+谱曲 11.0674643079
+册封 9.16447920358
+实情 8.50251495046
+远大理想 12.8020653633
+转拨 13.900677652
+拍频 13.900677652
+印书馆 11.9547675029
+装傻 10.5684731418
+钱嘉徵 12.8020653633
+火海 9.62401153296
+布西亚 13.900677652
+鱼叉 9.75754292558
+转抄 12.8020653633
+北三面 10.604840786
+作茧自缚 11.8212361103
+十亿四千万余美元 13.2075304714
+软塌塌 11.8212361103
+祖逖数 13.2075304714
+中华人民共和国全国人民代表大会 11.7034530746
+郭子宓 13.2075304714
+逐日 9.58318953844
+斋主 11.2616203224
+望远 11.598092559
+受业 9.62401153296
+转折 8.43684584695
+荣誉权 13.2075304714
+电线 9.33632946051
+转报 11.2616203224
+珠穆 12.8020653633
+怨不得人 13.2075304714
+床位 10.1394775363
+自然肥力 11.1280889297
+催命 10.642581114
+彭述之 12.2912397395
+电纳 13.900677652
+博福斯 10.9049453784
+几倍 9.5186510173
+宜林地 10.604840786
+核反应 9.07236391467
+李登辉 10.9562386728
+决死队 12.1089181827
+离散系统 11.9547675029
+堂侄 12.1089181827
+马向北 13.900677652
+施蒂林 13.900677652
+见世面 10.7226238216
+米尔科 13.2075304714
+没脑子 11.9547675029
+宾斯 13.2075304714
+盖好锦 13.2075304714
+提桶 13.2075304714
+冯保干 13.900677652
+脓毒症 13.2075304714
+王立降 13.2075304714
+捉弄人 10.9049453784
+从风 12.8020653633
+沙埕 11.5027823792
+郭尔罗 11.9547675029
+旁支 10.7226238216
+偏色 13.2075304714
+地下开采 11.2616203224
+酒浆 12.5143832909
+梁园区 11.5027823792
+古列耶 11.4157710022
+许朝 13.2075304714
+孙慧丽 13.900677652
+不费周折 13.900677652
+汪汪 9.96885201925
+红香绿 12.5143832909
+跟斗 11.2616203224
+转意 12.2912397395
+刻纸 13.900677652
+刻线 11.9547675029
+水翼 11.1926274509
+赫尔伯特 13.2075304714
+尚有可为 11.3357282945
+喂母乳 12.8020653633
+表达意见 11.8212361103
+松风里 11.7034530746
+仙逝 11.3357282945
+海洞 10.2630914922
+吴楚帆 13.2075304714
+莫文隆 10.0940151622
+湘鄂川黔 10.9049453784
+许杰 13.900677652
+硅树脂 12.1089181827
+马迹山 11.8212361103
+操着 10.2897597393
+违章率 13.2075304714
+平面几何 13.2075304714
+严颜引 13.2075304714
+畸形儿 10.765183436
+小宝爹 13.900677652
+报检 13.2075304714
+搞来 10.4994802703
+冻到 13.900677652
+装卸 8.80692745117
+一盘 8.41588071849
+实行 5.36231022533
+十六万余 12.8020653633
+两万平方米 12.2912397395
+生关死劫 13.2075304714
+熬起来 13.2075304714
+卡韦 13.2075304714
+无人敌 13.2075304714
+济州岛 10.4994802703
+仙郎 13.2075304714
+目见 13.2075304714
+石飞 12.5143832909
+教体局 11.598092559
+阿莱赫 13.2075304714
+目视 9.20019728618
+轻言轻语 13.2075304714
+急救药 12.1089181827
+上海出版公司 13.2075304714
+攻击者 12.2912397395
+东北虎 10.3453295905
+胳肢窝 11.3357282945
+延揽 11.1280889297
+冀东 9.85762638414
+闻朝廷 11.5027823792
+报栏 11.598092559
+盆汤 13.900677652
+壮语 11.0674643079
+放声高唱 13.900677652
+福基斯 13.900677652
+置身事外 10.8561552143
+黄骠马 11.5027823792
+静功 11.9547675029
+拆穿 11.5027823792
+攻杀 9.84023464143
+仙都 12.1089181827
+硬壳 9.94943393339
+原创性 12.8020653633
+展书官 12.8020653633
+弗莱堡 12.8020653633
+端整 12.8020653633
+敢情是 11.3357282945
+瘊子 12.5143832909
+账款 9.21854642485
+阿迪盖 12.8020653633
+沦没 12.8020653633
+即兴诗 13.2075304714
+摆齐 13.2075304714
+图斯 9.89334446674
+抽中 11.7034530746
+万用表 12.2912397395
+免费成人 13.900677652
+米克尔 13.900677652
+不良导体 12.8020653633
+报案 9.34680076038
+白云机场 10.7226238216
+抽丝 11.7034530746
+旧金山湾 13.900677652
+思路不清 13.2075304714
+十亿斤 13.2075304714
+抽丁 12.8020653633
+燃烧值 12.2912397395
+库尔曼 12.5143832909
+许某 11.5027823792
+哈姆莱特 13.900677652
+抽上 10.765183436
+基隆人 13.900677652
+藏藏掖掖 12.8020653633
+任志刚 11.5027823792
+许是 10.604840786
+凑凑合合 12.2912397395
+刘贵芳 11.1280889297
+彩门 11.598092559
+硬套 13.2075304714
+侍汤奉 13.2075304714
+花卉装饰 13.2075304714
+吃空额 11.1926274509
+政务委员 11.1280889297
+未始不可 13.2075304714
+上海财经大学 11.1280889297
+诱导法 13.900677652
+达坂城 11.7034530746
+乙烯 8.32094782599
+嫁过来 11.0103058941
+逐期 12.5143832909
+圈马 13.900677652
+粘合衬 13.900677652
+吨粮田 13.900677652
+天边 9.23723855786
+王好古 13.2075304714
+源远流长 9.61021821083
+黑面包 12.2912397395
+十余匹 13.900677652
+锄头 9.56994431169
+退款 10.0940151622
+装到 10.0720362555
+惠农 10.4349417492
+酒水 10.8096351986
+埃尔维 13.900677652
+李信忙 13.2075304714
+公孙先生 11.7034530746
+穆宗立 13.2075304714
+鱼儿 9.5186510173
+贾南风 12.1089181827
+苏德隆 13.2075304714
+迪马 11.4157710022
+逐条 10.4041700905
+联合报系 13.2075304714
+好望角 9.61021821083
+人格分裂 12.2912397395
+电视网 11.7034530746
+纺织系统 11.4157710022
+乙炔 9.58318953844
+许晴 12.1089181827
+酒气 9.77354326693
+桑叶 10.2117981979
+曲女城 11.5027823792
+礼毕 9.0884932966
+尹恩惠 13.900677652
+悦达起亚 10.4994802703
+叶绍钧 12.5143832909
+安达 10.3453295905
+金璧辉煌 13.2075304714
+精美画册 13.900677652
+损耗 8.3285236198
+孟邦 13.2075304714
+麦德森 12.8020653633
+王刘非 13.900677652
+周小舟 13.2075304714
+中科院计算所 12.8020653633
+帕兴承 12.8020653633
+李呈祥 11.9547675029
+停靠站 12.8020653633
+魂飘魄散 13.900677652
+知情达理 13.900677652
+堂上 9.04864738806
+分数段 13.2075304714
+景升之 12.8020653633
+地面监视 12.8020653633
+晃悠悠 13.2075304714
+齐物 11.7034530746
+雷亨顺 13.900677652
+终生 8.44963919841
+每秒钟 10.4666904475
+自动识别 11.3357282945
+工作进度 10.9562386728
+铁门关 11.8212361103
+凌公绩 13.900677652
+肩负着 10.3743171274
+延拓 13.900677652
+动画人物 12.8020653633
+引渡回国 12.8020653633
+杭州湾 9.27570483869
+精神力 13.2075304714
+叫点 12.5143832909
+酒泉 9.12999302751
+堂主 11.8212361103
+传动力 13.900677652
+揭家丑 12.8020653633
+磨磨蹭蹭 10.4994802703
+借放 13.2075304714
+王庆封 13.2075304714
+飞阁流丹 13.900677652
+惠公 12.8020653633
+竭尽全力 9.61021821083
+师友 11.1280889297
+惠兰 12.5143832909
+针鼹 11.7034530746
+格劳秀斯 11.3357282945
+香菇 9.04086524761
+外汇通 13.900677652
+惯盗 13.2075304714
+孤注一掷 9.55687223012
+宫泽 13.900677652
+文学期刊 11.5027823792
+重婚罪 12.8020653633
+戴明 13.2075304714
+面片 11.2616203224
+奥吉 13.2075304714
+枯水位 11.598092559
+转悠 9.20932976975
+安特 11.598092559
+砖木 11.3357282945
+詹姆森 12.8020653633
+手机链 12.8020653633
+斯巴达克 10.1164880181
+康斯坦察 12.2912397395
+价值连城 9.96885201925
+言而无信 11.7034530746
+海奎特 13.2075304714
+徐二公子 11.9547675029
+师古 11.1926274509
+香菜 10.4666904475
+师君 12.5143832909
+先令 8.31718134319
+咨询组 11.2616203224
+可苏醒 13.900677652
+礼治 11.3357282945
+电筒 10.4994802703
+含含糊糊 10.1871055853
+五环路 13.2075304714
+萨满舞 12.1089181827
+致力于 7.20735398371
+如一 11.0103058941
+科学技术部 12.2912397395
+金娃 12.1089181827
+谄笑 11.5027823792
+向来如此 12.1089181827
+借支 13.2075304714
+转来 9.31571017331
+忠心赤胆 12.2912397395
+绿草如茵 11.3357282945
+压轴 11.2616203224
+航天器 8.9308643524
+历史课 11.8212361103
+硬干 11.9547675029
+退水 11.9547675029
+酒歌 11.7034530746
+易经 8.98069672615
+开洋 12.2912397395
+实验机 13.2075304714
+厂房设备 13.900677652
+玉钏儿 11.0674643079
+圣路易 11.1280889297
+不修 10.533381822
+脊梁骨 10.1871055853
+悬着 9.5186510173
+硬币 9.25628675283
+电笔 13.2075304714
+处罚金 10.3743171274
+本能寺 13.900677652
+汉普顿 12.2912397395
+仔猪 11.7034530746
+筛理 13.900677652
+挥起 11.0674643079
+经直 13.900677652
+五十好几 13.900677652
+卡耐基 12.8020653633
+许慈 13.2075304714
+礼法 9.72629038208
+许慎 10.5684731418
+师命 11.5027823792
+硬席 12.8020653633
+克伦人 12.2912397395
+库尔恰 12.5143832909
+动植物 7.80710788193
+雄霸 12.1089181827
+无名火 11.1926274509
+转机 8.78868986362
+细论 11.7034530746
+云南省西双版纳傣族自治州 11.9547675029
+税务系统 13.900677652
+奇志 13.2075304714
+潘迅 13.2075304714
+单元楼 12.5143832909
+奥卡 11.3357282945
+计出无奈 13.2075304714
+世界级 9.18217878068
+玉貌花 13.2075304714
+继承者 9.35738286971
+转染 13.2075304714
+延时 10.3743171274
+西方化 11.1280889297
+定量供应 12.2912397395
+座席 11.5027823792
+平开窗 13.900677652
+宫则宫 13.900677652
+手提箱 12.2912397395
+旁门左道 12.1089181827
+绞丝 12.8020653633
+河自东 12.1089181827
+太康县 11.0674643079
+革命胜利 9.87532596124
+残暑 13.2075304714
+小试牛刀 13.900677652
+跟据 12.8020653633
+自动伞 12.8020653633
+陆伯言 12.2912397395
+奥博 11.8212361103
+赵二嫂 12.1089181827
+酒母 13.900677652
+天生丽质 11.1280889297
+少刻 10.4349417492
+原位癌 12.1089181827
+啮合 10.9562386728
+后颈 11.8212361103
+特卡蒙 11.7034530746
+推荐值 11.8212361103
+电算 12.5143832909
+化验室 11.7034530746
+气宇轩昂 10.9562386728
+香菱 9.44633035572
+大排查 11.598092559
+民房 9.72629038208
+王世杰 11.4157710022
+色艺双绝 11.9547675029
+齐用 13.900677652
+那军汉 12.2912397395
+硬度 8.092535162
+硬座 12.2912397395
+房屋信息 13.900677652
+一千五百多处 12.5143832909
+诱饵 9.6811699468
+李芹 12.8020653633
+工业园区 9.84023464143
+百花盛开 11.8212361103
+日线 8.40350942668
+吸引力 7.28060444545
+额尔古纳 11.5027823792
+玉兰花 10.7226238216
+近几个月 8.71889410168
+邵燕祥 12.8020653633
+宰揆 10.765183436
+克奴姆 12.5143832909
+拼争 13.2075304714
+师哥 11.598092559
+兴家立业 12.5143832909
+花好月圆 12.5143832909
+蒙梭号 12.8020653633
+石里 13.900677652
+麻麻黑 13.900677652
+勤务 8.7245279194
+熊雄 13.900677652
+吉之兆 12.5143832909
+闲职 11.3357282945
+孙无宇 13.2075304714
+刁蛮 11.5027823792
+勤劳 8.9102450652
+闲聊 9.58318953844
+通滤波 13.2075304714
+鱼块 12.8020653633
+倘佯 13.2075304714
+淌着 10.4349417492
+弗莱德 13.2075304714
+门采尔 12.8020653633
+开都河 11.1280889297
+变换处理 13.900677652
+纳尔逊 11.0674643079
+袁保龄 13.900677652
+转晴 11.4157710022
+卢瓦雷 12.2912397395
+勤力 13.900677652
+北四环 12.1089181827
+偈语 11.0674643079
+正词法 12.2912397395
+垂涎 10.2630914922
+奥勒 13.900677652
+谱成 11.7034530746
+熠熠 10.0720362555
+退浆 13.2075304714
+文化教育 8.08059472162
+阿耳戈 13.2075304714
+硬式 11.4157710022
+矩阵 9.28555713513
+吸引区 12.2912397395
+妹妹 7.02647915652
+硬弓 10.4994802703
+仙霞 12.1089181827
+立竿 12.2912397395
+依法惩治 13.900677652
+镇民大会 13.900677652
+延搁 13.900677652
+但纯子 13.900677652
+勤勉 9.16447920358
+永葆青春 12.8020653633
+流鼻血 11.598092559
+鱼圆 13.900677652
+少则 9.41204128224
+墨斗鱼 12.8020653633
+完善化 12.5143832909
+赶场子 12.8020653633
+卵翼之下 13.900677652
+电站 8.0746775446
+性快感 12.5143832909
+航天城 12.8020653633
+战地记者 11.7034530746
+远不如 9.09665660724
+冷露 12.8020653633
+瓦尔卡 13.900677652
+乌浒水 13.2075304714
+回骂 11.598092559
+入射光瞳 12.8020653633
+中性线 12.8020653633
+罐头盒 12.2912397395
+首第一个 13.900677652
+峰峰矿区 12.2912397395
+筵宴 9.25628675283
+白条猪 13.2075304714
+话务量 13.2075304714
+生产额 13.900677652
+图拉 10.1871055853
+面巾纸 13.2075304714
+古关峪 12.2912397395
+宫川 13.900677652
+西利万 13.2075304714
+膏腴之地 12.1089181827
+沈阳市政府 13.900677652
+华龙区 13.2075304714
+妹夫 10.2117981979
+奥利 10.2897597393
+朋友妻 13.2075304714
+信息技术 8.26588804881
+基础课 11.5027823792
+爱生 13.900677652
+肛裂 11.4157710022
+歇到 12.8020653633
+莲花路 13.900677652
+世道人心 11.9547675029
+兴趣爱好 11.9547675029
+会心一笑 11.7034530746
+克罗诺斯 13.2075304714
+弗莱彻 11.8212361103
+从鼎 13.900677652
+六尘不染 13.900677652
+百无一能 12.8020653633
+磨粉机 13.900677652
+找女婿 12.8020653633
+发展局 11.0674643079
+小笼 11.8212361103
+绒球 11.5027823792
+酉阳土家族苗族自治县 13.2075304714
+肾炎 8.9519177616
+传说人物 11.9547675029
+边境区 12.8020653633
+奥凯 13.2075304714
+浦岳 13.900677652
+逐户 11.4157710022
+酒楼 8.6966709649
+秃光光 13.900677652
+赵洪璋 13.2075304714
+库尔戈 13.2075304714
+武义县 13.2075304714
+茫然失措 11.4157710022
+百数十里 12.8020653633
+航天员 9.94943393339
+布依族 10.5684731418
+发出通知 9.63799777493
+入口处 9.44633035572
+面神经 11.5027823792
+装在 8.37522471284
+应真君 12.8020653633
+粉饰 10.0505300503
+康鹊 12.5143832909
+明叔大 13.2075304714
+逆变器 11.9547675029
+转数 12.2912397395
+硬山 13.2075304714
+指令表 13.900677652
+哈迪斯 13.900677652
+好几十块 13.2075304714
+国共两党 9.41204128224
+酒椰 13.900677652
+陈彬 12.5143832909
+流了血 13.2075304714
+依傍在 13.2075304714
+多着呢 9.82314020807
+热处理 9.30555780184
+热启动 12.1089181827
+风清月朗 12.8020653633
+上涨幅度 8.53938548627
+慈禧煦 13.900677652
+名花有主 12.5143832909
+保卫部 10.2897597393
+做完作业 12.5143832909
+抗毒素 10.8561552143
+吃饱喝足 10.6818018271
+阿房宫 10.533381822
+拆线 12.1089181827
+将相 10.5684731418
+奥军 11.1280889297
+延朗 13.2075304714
+搂草机 13.2075304714
+香茶 9.85762638414
+延期 8.46259834305
+第四第五 12.8020653633
+荣誉性 11.8212361103
+那贤臣 13.900677652
+管香积 13.900677652
+回首 9.46986085313
+回馈 9.27570483869
+美如天仙 13.900677652
+妹婿 11.8212361103
+悬疑 10.2371160058
+先于 8.53938548627
+语速 11.1280889297
+赔补 11.8212361103
+顷刻 9.08039608637
+奥兰 10.9049453784
+商之利 12.8020653633
+所处 7.68606955355
+奥克 11.2616203224
+熟练掌握 10.8561552143
+圣雄甘地 12.1089181827
+偏不凑巧 13.900677652
+甲上 12.2912397395
+鱼品 12.8020653633
+胡春华 11.5027823792
+少发 12.2912397395
+任宾努 13.900677652
+国母 11.0674643079
+上限 7.35532799164
+游牧 8.25877058104
+九十八篇 13.2075304714
+冒上来 11.7034530746
+戏班子 9.94943393339
+专车 10.2371160058
+痛苦万状 13.900677652
+染发剂 11.4157710022
+谢承你 13.2075304714
+盖雷姆 13.2075304714
+配给制 12.2912397395
+酒榨 13.900677652
+敌得过 11.8212361103
+分税制 11.598092559
+电离 8.85082164473
+非歧视 12.2912397395
+防盗链 13.900677652
+册子 10.642581114
+许信良 13.900677652
+师团 8.9519177616
+一丁点 10.9049453784
+忘餐废寝 13.900677652
+齐眉 11.4157710022
+仪征市 12.1089181827
+砖房 12.1089181827
+酒桶 11.7034530746
+游玩 9.20019728618
+诱骗 10.1871055853
+不知痛痒 13.2075304714
+面皮 9.16447920358
+慧眼识人 12.5143832909
+图恩 12.8020653633
+国有股 9.53122979951
+坏天气 11.9547675029
+火药厂 12.8020653633
+历下亭 13.900677652
+面皂 13.900677652
+贺金龙 10.1630080337
+立碑 10.9049453784
+于一城 13.900677652
+酒桌 12.1089181827
+情殇 13.900677652
+四百多年 13.900677652
+一省 9.46986085313
+待见 10.4994802703
+面目 8.11685246965
+博士帽 12.1089181827
+晒得 12.5143832909
+见之于 11.8212361103
+节能型 11.1926274509
+多处理器 11.8212361103
+电码 10.3743171274
+蠕形动物 13.900677652
+面盆 11.3357282945
+回顾 7.60910851242
+敬亭绿 12.8020653633
+烟缸 10.6818018271
+延昌 11.9547675029
+走娘家 12.1089181827
+筛眼 13.900677652
+不变式 11.9547675029
+反坦克炮 10.0940151622
+养荣丸 12.8020653633
+经痛 11.8212361103
+鹿特丹 10.0294766411
+陈玄景 12.8020653633
+国际局势 10.7226238216
+零售额 9.38981814546
+合补 13.900677652
+白粉病 11.0674643079
+焚起 11.3357282945
+如云 9.75754292558
+瓦尔兰 12.1089181827
+低合金钢 11.9547675029
+居民身份证 11.4157710022
+水果篮 13.900677652
+褒赏 13.2075304714
+圆球形 10.4349417492
+更新改造 11.1926274509
+太过分 9.7898037878
+电磁 8.14810501315
+电视屏幕 10.8096351986
+经由 8.78268383956
+惯犯 12.1089181827
+竖立起来 11.598092559
+二十只 10.765183436
+科学共产主义 11.4157710022
+游猎 10.0505300503
+满仓哥 13.900677652
+潮汕 9.89334446674
+泪水汪汪 13.2075304714
+封循王 12.8020653633
+数十二倍 13.2075304714
+维黎曼 13.2075304714
+悲欢离合 10.2630914922
+荣誉感 11.0674643079
+计小人 13.900677652
+决议书 13.900677652
+潞河 12.1089181827
+挠度 12.2912397395
+刚果河 9.82314020807
+利息支出 11.1926274509
+经略 8.69119149913
+朋友家 10.8096351986
+甲乙 10.6818018271
+治国安民 12.8020653633
+挺胸 10.3171587135
+草本植物 8.9308643524
+回风 11.7034530746
+张管营 12.1089181827
+禄官统 12.8020653633
+固定装置 12.2912397395
+郑康公 12.8020653633
+郑背楚 13.2075304714
+翻译者 13.900677652
+宋廷大 13.2075304714
+水经 10.533381822
+张骞 9.89334446674
+两百七十五辆 13.900677652
+转播 10.5684731418
+米迦勒 12.8020653633
+一干人犯 11.598092559
+折叠型 13.2075304714
+干儿子 10.2630914922
+扔下 8.62256299275
+无房户 12.1089181827
+一百多斤 11.1926274509
+重于 9.80633308975
+漆盘托 13.900677652
+普林斯顿大学 9.63799777493
+徂徕 12.2912397395
+报务 13.2075304714
+普通教育 11.0674643079
+高娃 13.900677652
+林灌丛 12.1089181827
+连杭汉 13.2075304714
+硬打 12.1089181827
+转子 9.54396882529
+临时文件 11.0674643079
+图形 7.9817837977
+转存 11.8212361103
+劳资 10.765183436
+转学 10.0940151622
+册文 11.4157710022
+商业保险 10.2630914922
+丁郢 13.900677652
+马孔多 12.8020653633
+图录 10.9049453784
+宾得 13.900677652
+评选活动 9.77354326693
+报功 11.0674643079
+头骨 8.90346537821
+江湖 7.74794495727
+轻微伤 11.5027823792
+波斯文 10.642581114
+平战结合 12.1089181827
+酒坊 11.7034530746
+巨獒 11.4157710022
+图强 10.1630080337
+冬小麦 9.40086798165
+十五六年 12.1089181827
+谢安兄 13.2075304714
+花鼓戏 11.5027823792
+爱错 13.900677652
+酒场 13.900677652
+陈玄奘 11.598092559
+针黹 11.2616203224
+安徽省政府 13.900677652
+张鲸听 13.2075304714
+杨深秀 11.5027823792
+不变性 10.765183436
+物态方程 12.1089181827
+捎信儿 12.8020653633
+航空工业 9.43476953332
+虾群 13.900677652
+劳费 11.4157710022
+不佞 13.2075304714
+事实婚 12.2912397395
+宛陵 11.9547675029
+懂法 11.7034530746
+戏弄 9.72629038208
+逢时 12.2912397395
+客观事实 10.533381822
+逐层 10.4666904475
+表兄弟 10.4349417492
+别碰 10.9562386728
+账内 13.900677652
+日行千里 11.4157710022
+图式 10.2371160058
+账册 11.4157710022
+五九四十五 13.2075304714
+良师益友 11.7034530746
+转寄 12.8020653633
+单机版 13.900677652
+黑幕小说 12.8020653633
+武姜 12.5143832909
+左小腿 12.1089181827
+蝈蝈儿 12.8020653633
+狗尾巴 11.8212361103
+杂技演员 12.1089181827
+硬拖 11.7034530746
+季平 13.2075304714
+古时候 9.77354326693
+葛巾香 13.2075304714
+形式系统 11.8212361103
+报到 9.06439574502
+百十道 13.2075304714
+变质 8.12612610643
+大吼大叫 12.2912397395
+实验室 7.5393751744
+报刊 8.15447446144
+多窗口 13.2075304714
+五六块 12.5143832909
+见成效 10.3453295905
+转寰 12.8020653633
+大理院 12.8020653633
+科伊桑 11.0674643079
+转导 12.5143832909
+老鼻子 11.9547675029
+外邪 10.3171587135
+百十遍 13.900677652
+万起 11.9547675029
+单个儿 13.2075304714
+十遍 11.3357282945
+转完 12.8020653633
+受看 13.2075304714
+一品红 13.2075304714
+低级 8.57280148319
+酒盅 10.1871055853
+马拉开波湖 11.5027823792
+财产继承 11.3357282945
+夫子自道 13.900677652
+经新义 12.8020653633
+青年赛 12.2912397395
+叙写 11.9547675029
+硬抢 13.2075304714
+经纬度 10.8561552143
+许巍 12.2912397395
+檄书 13.2075304714
+从健妇 12.1089181827
+拼凑 9.61021821083
+影视网 13.900677652
+永字八法 12.5143832909
+许州 11.1926274509
+王世子 12.1089181827
+湖畔 9.23723855786
+浓郁 8.28754954559
+喷出来 10.533381822
+一较高下 11.9547675029
+宇航 9.45802639549
+化为乌有 9.94943393339
+玉珠峰 13.900677652
+搞清楚 9.19114745066
+后顾 13.2075304714
+薯片 12.5143832909
+洗衣机 8.73589167805
+受益 6.48369803059
+别种 10.8096351986
+别科 12.8020653633
+脚跟 9.16447920358
+礼冠 13.900677652
+灰苍苍 13.2075304714
+冒牌货 12.8020653633
+酒器 10.4994802703
+多亿加元 13.2075304714
+武卫前 11.8212361103
+整形医院 11.2616203224
+闻锣 13.2075304714
+纯属虚构 12.5143832909
+重大案件 10.604840786
+许封 13.900677652
+颤抖地 10.9562386728
+宇之表 13.2075304714
+凑合着 10.3743171274
+别称 8.92394390956
+后顶 13.900677652
+洗衣服 9.32596667347
+福晋乌 13.2075304714
+百十里 10.9049453784
+乳饮料 11.3357282945
+汪被举 12.2912397395
+挠性 11.1926274509
+丁醇 10.9049453784
+叽叽 10.8096351986
+米利托 13.900677652
+三二两 12.5143832909
+洗衣板 13.2075304714
+曹刚川 13.2075304714
+甲醇钠 12.8020653633
+生存主义 13.900677652
+拼来拼去 13.900677652
+于晋阳 11.598092559
+夏之交 10.4666904475
+退党 11.8212361103
+生力兵 13.900677652
+丁醛 12.5143832909
+跟庄 13.900677652
+福晋中 13.2075304714
+神其妙 13.2075304714
+值当 12.8020653633
+漪澜 13.2075304714
+巴兰格 12.8020653633
+退入 9.4233408375
+雷公山 11.4157710022
+端门 10.3743171274
+五缕 13.900677652
+软科学 11.4157710022
+脚趾 9.85762638414
+结对子 13.900677652
+安大略省 10.4349417492
+退兵 8.61241062128
+别离 10.533381822
+聪明反被聪明误 11.598092559
+低缓 10.1164880181
+硬挺 11.0103058941
+绯色 11.1926274509
+折叠椅 13.2075304714
+今义 13.2075304714
+游击区 10.8096351986
+先予执行 12.2912397395
+老泪纵横 10.1394775363
+转嫁 9.93038573842
+丁酉 11.3357282945
+变调 11.1280889297
+首第一位 13.900677652
+奋发向上 12.2912397395
+宝通 10.2117981979
+范布里 13.900677652
+各有所长 11.0103058941
+交易平台 8.99540287354
+慈祥 9.5062284973
+执行庭 13.2075304714
+天打雷劈 12.8020653633
+开立方 13.2075304714
+花媳妇 13.2075304714
+羊齿植物 11.9547675029
+深受鼓舞 13.2075304714
+据此 7.29673382738
+氮芥 11.7034530746
+丁酯 11.9547675029
+丁酮 12.5143832909
+宾师 13.2075304714
+翁河 12.2912397395
+水果摊 12.5143832909
+丁酸 11.8212361103
+阿肯色河 12.5143832909
+粮囤 13.2075304714
+无底洞 10.0088573539
+魏格纳 10.8096351986
+金顶寺 11.9547675029
+骑车人 11.0103058941
+跟帖 10.0294766411
+谨记 11.0674643079
+夏洛蒂 12.5143832909
+张靓颖 13.900677652
+墙角落 12.2912397395
+帮主 12.5143832909
+伊东俊 13.900677652
+丢盔抛甲 13.2075304714
+顺乎民心 12.1089181827
+讨着 12.8020653633
+累累 9.61021821083
+硬接 12.8020653633
+鼬鼠 11.0103058941
+氮苯 12.8020653633
+戴顶 11.598092559
+芊绵 12.8020653633
+老泪横流 12.8020653633
+仁道 13.900677652
+罗宗洛 13.2075304714
+近十年 9.62401153296
+浓重 8.42003872863
+退出 5.77238748037
+人口素质 11.5027823792
+当惹雍错 11.598092559
+花溪畔 12.8020653633
+尤索林 13.2075304714
+不以 8.1641053545
+受病 12.2912397395
+头额 11.7034530746
+敬皇后 13.2075304714
+陈秀华 12.8020653633
+账号 9.29550746599
+策马前进 12.2912397395
+向度 12.2912397395
+瓦尔泽 13.2075304714
+蹈海 12.8020653633
+游人 8.56313957227
+实需 13.2075304714
+公交路线 11.8212361103
+飘洋过海 12.1089181827
+头领 7.63918596765
+山高水长 12.1089181827
+头颅 8.58255765813
+东欧国家 9.82314020807
+闻鼓 9.93038573842
+挖下去 11.7034530746
+常务董事 11.4157710022
+演讲者 12.8020653633
+攻心 10.4994802703
+退到 8.46695564842
+紫云苗族布依族自治县 12.5143832909
+未归 10.3743171274
+武承嗣 12.2912397395
+游云 11.9547675029
+第三十届 13.2075304714
+和波普 13.2075304714
+游仪 11.9547675029
+样板戏 10.9049453784
+牡丹峰 12.2912397395
+鄂伦春族 11.0103058941
+蓝瓦瓦 13.2075304714
+逐年 7.97642185456
+息事宁人 10.642581114
+变迁 8.0600359946
+洗下来 13.900677652
+变过 12.1089181827
+社保费 13.2075304714
+多采多姿 13.2075304714
+三瓦两舍 12.5143832909
+司马鲁 13.2075304714
+小儿麻痹症 11.598092559
+均等 10.0294766411
+藏红花 11.7034530746
+硬性 9.58318953844
+济公活佛 12.8020653633
+宾川 11.2616203224
+宾州 11.4157710022
+自然色 12.8020653633
+桓子 12.8020653633
+威仪凛然 13.900677652
+孝庄 12.5143832909
+转天 10.3171587135
+继而 7.97909923233
+转头 8.6803218269
+游仙 12.1089181827
+程咬金 10.765183436
+跺脚 8.64840422393
+全蚀 13.900677652
+并不一定 9.04086524761
+顾玉书 12.8020653633
+陈逸飞 12.8020653633
+西方净土 12.2912397395
+礼制 9.55687223012
+张青松 13.900677652
+惯例 7.93197009199
+桓宽 11.4157710022
+劳远 13.900677652
+前沿性 13.2075304714
+图巴 12.5143832909
+礼券 11.3357282945
+传动比 11.598092559
+徐元瑞 13.2075304714
+拼写 9.5186510173
+一口价 12.2912397395
+图左 13.2075304714
+延寿 9.75754292558
+球面波 12.2912397395
+惜贷 11.1280889297
+向楚军 13.2075304714
+费舍尔 11.7034530746
+冬油菜 12.1089181827
+惠栋 11.8212361103
+桓宗 11.9547675029
+汽车底盘 11.1926274509
+脚蹼 12.1089181827
+张大哥 10.2371160058
+游丝 9.91169360541
+奉陪到底 11.9547675029
+十五六岁 10.4349417492
+低糖 11.9547675029
+联营企业 11.8212361103
+蟹粉 12.1089181827
+围看 11.9547675029
+官占田 12.8020653633
+油腻腻 11.4157710022
+判官笔 13.900677652
+专往 12.5143832909
+飞来石 13.2075304714
+侄孙女 12.5143832909
+脚踝 10.4994802703
+报偿 10.8096351986
+节译 12.5143832909
+不仁 9.96885201925
+世道人情 13.2075304714
+偏高 8.0600359946
+秘密会晤 13.2075304714
+头顿 13.900677652
+变轨 11.4157710022
+班图 9.66657114738
+夹壁墙 13.900677652
+变软 10.8096351986
+南炳文 13.2075304714
+头项 11.3357282945
+头顶 7.17925195119
+延安 7.45337178943
+张真 13.900677652
+聚少离多 12.8020653633
+一二十匹 12.8020653633
+脚踢 9.93038573842
+受用 8.60236028543
+杜尔菲 13.2075304714
+受电 13.2075304714
+肇事罪 10.9562386728
+高浓度 9.80633308975
+延宕 10.9049453784
+鱼梁 11.1926274509
+文鸯 12.2912397395
+脚踵 13.2075304714
+游乐 9.62401153296
+胖胖的 9.72629038208
+徐炳昶 13.2075304714
+东星 11.0674643079
+江孜县 12.2912397395
+堂皇 10.0720362555
+惯下 13.2075304714
+酒味 10.6818018271
+鱼饲料 13.900677652
+礼县 12.8020653633
+游侠 11.0674643079
+索尔蒂 13.900677652
+向平 13.900677652
+疏忽大意 10.7226238216
+咩咩 12.8020653633
+转塔 13.900677652
+令人咋舌 10.7226238216
+退化 7.9526426628
+武王伐纣 10.8561552143
+贾环便 11.9547675029
+徐元文 10.0505300503
+结电容 13.900677652
+水车前 13.900677652
+变身 9.61021821083
+施工进度 10.642581114
+少夫人 12.5143832909
+整节 13.900677652
+脚迹 12.5143832909
+主项 11.8212361103
+招请 12.2912397395
+一百多支 13.900677652
+于水府 13.2075304714
+母子情 13.2075304714
+意出望外 13.900677652
+后赫拉 13.900677652
+大头鞋 13.2075304714
+文龙 10.0088573539
+财险 10.0720362555
+账务 11.5027823792
+酒吧 9.30555780184
+顺便来 11.7034530746
+无人岛 13.2075304714
+报出 9.80633308975
+许平 11.598092559
+笑纳 10.4349417492
+裤带 9.85762638414
+官名 9.22784881751
+银鹤翎 13.2075304714
+别管 9.08039608637
+漪涟 13.2075304714
+妥善处置 10.533381822
+擦澡 13.900677652
+如今已是 10.2371160058
+果子酒 13.900677652
+只限 10.3453295905
+双向交通 13.2075304714
+退却 9.10488710638
+个人财产 10.9049453784
+母畜 11.5027823792
+酒后 8.80692745117
+倘然 13.2075304714
+布莱泽顿 13.900677652
+痴迷不悟 13.900677652
+新闻事业 11.1926274509
+惯于 9.93038573842
+周沿 12.8020653633
+技术难题 10.9049453784
+通道容量 13.2075304714
+陆水根 13.2075304714
+唐玄奘 12.1089181827
+高山流水 11.2616203224
+万万出 13.900677652
+翁源 12.1089181827
+六百万元 12.5143832909
+例假日 13.900677652
+银行业务 8.87679713113
+移出去 13.900677652
+王翠翘 13.900677652
+购货人 13.2075304714
+霍西 11.9547675029
+黑海舰队 10.8561552143
+巨鼠 11.7034530746
+钦差 8.94485059437
+脚轮 13.900677652
+别本 13.2075304714
+轰出 12.1089181827
+轰击 8.98069672615
+懵然 12.5143832909
+氮肥 9.48183704418
+钦州 10.5684731418
+结构特征 10.1394775363
+库尔德 10.8561552143
+抽着 9.91169360541
+退去 8.57280148319
+形成期 11.5027823792
+王中秘 12.2912397395
+受理 7.71652876104
+有病乱投医 12.1089181827
+除臭 11.5027823792
+文鼓 13.900677652
+有口难言 12.2912397395
+瓦尔派 13.900677652
+别笑 11.5027823792
+洗衣日 13.900677652
+师母 9.26594866375
+转增 9.35738286971
+视轴 13.900677652
+深入人心 9.69598503258
+报关 10.7226238216
+民事裁定 11.1280889297
+宝鉴 11.598092559
+礼单 10.642581114
+十字军 9.18217878068
+头饰 10.604840786
+承压水头 13.900677652
+温度差 11.1926274509
+李公公 11.1926274509
+谱子 12.5143832909
+乱了手脚 12.8020653633
+下脚料 11.3357282945
+陆军大学 11.0103058941
+文飞 12.1089181827
+鲣鱼 11.5027823792
+退后 9.30555780184
+岂有 8.86372504956
+洗衣房 12.2912397395
+罗钦顺 11.9547675029
+低空 8.53003962385
+转录 10.1871055853
+母爱 10.0294766411
+文风 9.75754292558
+拜金 12.1089181827
+贺人龙 8.80692745117
+冷龙岭 10.9049453784
+垃圾焚烧 9.53122979951
+图存 11.5027823792
+孤牵 13.2075304714
+转形 13.900677652
+马立克 11.0103058941
+抽烟 8.33999602096
+宋老儿 13.2075304714
+吼叫声 11.4157710022
+许多 4.43414587464
+学术性 10.9562386728
+治疗者 11.598092559
+观前街 12.5143832909
+磁效应 10.6818018271
+丁银 11.7034530746
+好好坏坏 13.900677652
+奥比 11.5027823792
+多输 13.2075304714
+正当性 10.9562386728
+戏子 10.1394775363
+休闲 8.51160592216
+守如处女 13.900677652
+除虫 11.8212361103
+保养品 11.0674643079
+叫住 9.04086524761
+报国 9.29550746599
+张骞通 10.8561552143
+宋廷抗 13.2075304714
+凤兰 13.2075304714
+砖墙 9.48183704418
+安监局 11.2616203224
+叫作 8.39128931535
+母片 13.900677652
+太康死 12.8020653633
+来事 13.900677652
+港中旅 11.5027823792
+玄洋社 13.2075304714
+硬是 8.53003962385
+温切斯特 12.1089181827
+只配 10.9562386728
+礼品 8.71889410168
+母牛 10.1871055853
+脚行 11.8212361103
+步战车 11.0674643079
+惠渠 11.1280889297
+人大会堂 13.900677652
+低端 8.96620371885
+领先者 10.8561552143
+赫赫有名 9.94943393339
+宋廷才 13.2075304714
+两百余万 13.2075304714
+弗莱明 10.765183436
+无翼而飞 13.900677652
+砖塔 11.0674643079
+潮润 11.4157710022
+那宝玉 10.1630080337
+分配不公 10.642581114
+窝家 13.900677652
+多数百姓 13.2075304714
+三十六门 12.8020653633
+自动门 13.900677652
+两百余个 12.8020653633
+暗细菌 13.2075304714
+麦德福特 13.900677652
+文顿 13.2075304714
+闻香 11.7034530746
+图书资料 10.8096351986
+先天性免疫 12.8020653633
+武王素 12.8020653633
+中华书局 8.32472854883
+马丁内斯 11.8212361103
+勿言 11.7034530746
+经世 10.2371160058
+交通信号 11.5027823792
+延川 13.2075304714
+延州 11.1280889297
+酒友 11.8212361103
+曾学得 13.900677652
+动画电影 12.2912397395
+转往 9.96885201925
+黄初民 11.3357282945
+汇率制 13.900677652
+攻夺 11.8212361103
+母狮 12.2912397395
+师法 8.98069672615
+转得 10.3743171274
+班禅额尔德尼 11.1926274509
+加聚反应 13.900677652
+许多种 9.28555713513
+母狼 11.0674643079
+晋兴郡 12.5143832909
+好行小惠 13.900677652
+转徙 11.1280889297
+拉拉 9.4233408375
+高级官员 9.18217878068
+桓州 13.2075304714
+经义 10.3743171274
+卫驾 13.2075304714
+宾子 11.7034530746
+园林城市 12.8020653633
+经久 10.3171587135
+瓦索尔 11.8212361103
+新出路 13.900677652
+邢王 13.900677652
+哈尔科夫 10.2117981979
+母狗 10.8096351986
+弘农郡 12.8020653633
+母狐 13.900677652
+酒厂 9.89334446674
+举报 7.48721869481
+一九六零年 13.900677652
+东昌 11.1926274509
+千余米 11.3357282945
+宝钗 8.00352378434
+李聃 13.2075304714
+百十间 13.2075304714
+防盗锁 13.900677652
+经侦 12.2912397395
+宝钞 10.6818018271
+京房 11.7034530746
+咽鼓管 11.0674643079
+母猪 10.3171587135
+母猴 12.5143832909
+吃得下 10.8561552143
+尔唐 12.2912397395
+洛可可 11.0674643079
+千万光年 13.2075304714
+历史背景 9.91169360541
+十字坡 11.598092559
+累积 8.1417758781
+低等 9.27570483869
+硬来 11.2616203224
+脚印儿 13.2075304714
+丁门 11.3357282945
+十八颗 13.900677652
+海源阁 11.9547675029
+新东安市场 13.900677652
+转年 11.8212361103
+转干 13.900677652
+延展 10.0720362555
+做作业时 13.2075304714
+生机勃发 12.5143832909
+硬板 11.4157710022
+田坛 13.900677652
+管顾 12.2912397395
+水稻种子 12.2912397395
+较真儿 11.9547675029
+良人 10.3743171274
+文首 13.900677652
+唾腺 12.5143832909
+库尔奇 13.2075304714
+六十二艘 12.8020653633
+悬乎 12.2912397395
+挨到 10.3171587135
+山南海北 12.1089181827
+色谱分析 11.3357282945
+硬朗 9.4233408375
+斯加登 12.5143832909
+悔过书 11.2616203224
+选举人 10.604840786
+实寄封 12.2912397395
+英灵 10.7226238216
+霍达 12.1089181827
+敲上 13.2075304714
+宝银 11.9547675029
+布赖特 11.7034530746
+武林高手 11.8212361103
+萨顿 13.900677652
+硬木 9.75754292558
+甩卖 10.4666904475
+地塞米松 11.0674643079
+奔泻 12.1089181827
+剖析入微 13.900677652
+措词严厉 13.900677652
+挨刀 11.7034530746
+吟风弄月 12.2912397395
+空腹 9.21854642485
+黄蕉风 10.0940151622
+激辩 11.5027823792
+请批示 12.8020653633
+聚丙稀 13.2075304714
+心地光明 12.8020653633
+京师大学堂师范馆 12.8020653633
+向承欢 12.5143832909
+经传 10.2371160058
+全面完成 10.0505300503
+起风云 12.8020653633
+颜珠定 13.2075304714
+濒临绝境 11.7034530746
+五华里 12.1089181827
+叫些 12.8020653633
+马可福音 12.1089181827
+余二 13.900677652
+赶出去 10.4994802703
+问天买卦 13.2075304714
+文饰 11.8212361103
+无效分蘖 13.900677652
+那老僧 11.598092559
+辽河油田 12.5143832909
+卢绾 13.900677652
+杨花水性 12.8020653633
+后进先出 13.2075304714
+大幅面 13.900677652
+王仁忠 12.5143832909
+叫人 11.3357282945
+时风时雨 13.900677652
+十字花 13.900677652
+六十四个 13.2075304714
+插回去 13.900677652
+电子客票 11.8212361103
+侧重点 10.4349417492
+虎妞 13.2075304714
+无知 8.33999602096
+地方主义 12.2912397395
+昭王 10.4041700905
+乙丙 12.5143832909
+转库 12.8020653633
+中共山东省委 12.8020653633
+荆紫关 11.1926274509
+律考 13.900677652
+转座 12.2912397395
+拉拢 9.29550746599
+钦宗 11.7034530746
+锡伯族 10.4994802703
+钦定 9.61021821083
+均系 9.93038573842
+酒力 11.2616203224
+逛荡 11.8212361103
+经作 13.2075304714
+叫价 11.0674643079
+前俯后仰 12.5143832909
+边防哨 13.900677652
+幼稚地 13.2075304714
+布拉顿 13.2075304714
+鲁宾斯坦 11.4157710022
+酒兴 10.3453295905
+低硫 10.1394775363
+三十二篇 13.2075304714
+宛通 13.900677652
+埃尔齐亚 13.900677652
+闻鬼 12.5143832909
+饮用水 9.77354326693
+地道战 10.7226238216
+中路梆子 12.5143832909
+鱼池 10.7226238216
+装演 13.900677652
+别给 11.0674643079
+叽咕 11.9547675029
+拉贝河 13.2075304714
+江湖人称 13.900677652
+炫耀性 13.900677652
+别绪 13.900677652
+政治谋略 12.8020653633
+小脸儿 11.9547675029
+鱼汛 11.598092559
+界面缩聚 12.5143832909
+丁零 10.3171587135
+开了个 9.61021821083
+应天顺时 13.900677652
+鱼水 12.5143832909
+罗肯湾 12.8020653633
+请不起 13.2075304714
+帐号 10.9049453784
+田连连 11.2616203224
+番语 13.900677652
+武装警察 11.7034530746
+一佛出世 12.5143832909
+中山陵 11.0674643079
+骨肉情 12.5143832909
+沙僧笑 10.8561552143
+八分音符 13.900677652
+大脑神经 11.8212361103
+惠泽 12.5143832909
+番话 10.4041700905
+吸风 13.2075304714
+扫过来 11.2616203224
+岂敢 9.40086798165
+普施善 13.2075304714
+张存仁 10.8561552143
+惠泉 12.8020653633
+柳条包 13.2075304714
+装潢 9.89334446674
+吸食 9.72629038208
+系统脱敏 12.8020653633
+攻守 9.46986085313
+许字 12.8020653633
+信标台 12.5143832909
+许宪 12.5143832909
+寸土寸金 11.1280889297
+叔胺 12.8020653633
+天下汹汹 12.8020653633
+蓬巴尔 12.2912397395
+更当 13.2075304714
+钱老爷 11.1280889297
+权力巅峰 13.900677652
+宾天 11.0674643079
+节省开支 10.8096351986
+齐泯王 13.2075304714
+惠水 11.598092559
+鱼泡 11.0103058941
+程控 11.8212361103
+大武溪 12.8020653633
+气冲冲 10.5684731418
+许家 9.89334446674
+岂料 11.0674643079
+公而忘私 11.8212361103
+报名 7.65845438652
+转工 13.900677652
+福临象 12.2912397395
+惠氏 11.7034530746
+发展期 9.85762638414
+皆大欢喜 10.2897597393
+许定 11.4157710022
+不中 9.48183704418
+惠民 9.12155415886
+卖狗皮膏药 12.8020653633
+许宝 12.2912397395
+抽牌 13.900677652
+小表妹 13.2075304714
+许宗 13.900677652
+面会 12.8020653633
+蓁蓁 12.8020653633
+挨冻 11.8212361103
+随群 13.900677652
+冯元彪 11.8212361103
+浓雾 9.36807815882
+龟纹 13.900677652
+束之高阁 11.7034530746
+绝对运动 11.9547675029
+鱼油 11.3357282945
+报命 12.2912397395
+许多篇 13.900677652
+硬撑 10.1394775363
+退回 7.85567233794
+礼器 9.63799777493
+退团 13.900677652
+秦军进 13.2075304714
+报呈 12.5143832909
+陶文钊 12.2912397395
+报告 5.21054006558
+跟头 9.20019728618
+法例 11.9547675029
+发展权 10.7226238216
+碰硬 12.8020653633
+根芽 13.2075304714
+日德兰 11.5027823792
+名特产 11.3357282945
+面交 12.2912397395
+裸体照片 13.900677652
+列普宁 12.8020653633
+洗面乳 10.3453295905
+叽喳 13.2075304714
+上万两 12.5143832909
+救生圈 11.3357282945
+前池 12.8020653633
+宝隆 13.2075304714
+延年 11.0674643079
+沦入 12.1089181827
+醺醺 12.8020653633
+白庙子 12.5143832909
+西征犬 13.2075304714
+面人 13.900677652
+被诉人 12.8020653633
+三十二章 13.2075304714
+记述文 13.900677652
+小雨雪 11.4157710022
+江潮 11.7034530746
+受热 9.46986085313
+图塔 10.642581114
+报喜 8.87679713113
+离尘 12.8020653633
+恋尸癖 13.900677652
+沙井 11.1280889297
+退场 9.93038573842
+不为 7.66822963543
+剩余时间 11.0674643079
+名特优 12.8020653633
+福临越 13.2075304714
+四两卷 13.2075304714
+制礼作乐 11.5027823792
+库鲁伊 13.900677652
+齐人 10.8561552143
+倒入 9.65218240993
+面价 13.900677652
+小香袋 13.900677652
+卢格尔 13.2075304714
+编者的话 12.2912397395
+桧木 13.900677652
+鱼洗 13.900677652
+瞎聊 13.2075304714
+延布 12.8020653633
+白浪滔天 11.8212361103
+逐字 11.598092559
+齐亚 10.765183436
+山与泽 12.8020653633
+校雠学 12.1089181827
+未被证明 13.2075304714
+油毛毡 12.1089181827
+昭然 11.7034530746
+细问 9.66657114738
+夜不能寐 11.4157710022
+两条道路 11.3357282945
+舒意缓 13.900677652
+受点 10.765183436
+制衣厂 13.900677652
+还跟着 10.0294766411
+特默思 13.2075304714
+悲喜交加 11.5027823792
+骈列 12.5143832909
+霍赫 12.8020653633
+声压级 12.2912397395
+面临 5.59940416678
+霰弹枪 11.3357282945
+丁青 12.5143832909
+宣引圣 13.2075304714
+文魁 13.900677652
+无虑无忧 13.2075304714
+打光棍 11.2616203224
+接触点 12.1089181827
+二十余次 13.900677652
+均线 6.79489152249
+单脚站立 13.900677652
+面上 7.18045749684
+优秀人才 10.4349417492
+天山南北 9.5186510173
+面世 9.91169360541
+汽柴油 10.2117981979
+程朱陆 12.5143832909
+蒸汽压 13.900677652
+桧柏 12.1089181827
+受灾 10.1871055853
+公因数 13.900677652
+西乌斯 12.2912397395
+毕恭毕敬 9.48183704418
+甩出 10.4994802703
+莉斯 13.2075304714
+杨先生 10.2897597393
+公至昭 13.2075304714
+碰碰 10.3171587135
+袁铁蛋 13.2075304714
+奥格 11.598092559
+润嗓 13.900677652
+延康 11.2616203224
+吸饱 11.9547675029
+节省下 12.5143832909
+新加坡航空公司 11.9547675029
+来世 9.84023464143
+顶头上司 10.5684731418
+延庆 10.4666904475
+惠济 9.84023464143
+隔行如隔山 11.7034530746
+齐东 11.7034530746
+齐一 12.5143832909
+荣誉奖 10.2117981979
+迪吉尔卡 13.900677652
+玉琢礁 12.5143832909
+丁霸 9.71102290995
+陈焕镛 13.2075304714
+退堂 12.1089181827
+腿疼 11.2616203224
+字母 8.05423887692
+方塘 12.8020653633
+妥善处理 9.6811699468
+变薄 10.0720362555
+电位 9.40086798165
+边防站 13.900677652
+鲜虞氏 13.2075304714
+番薯 10.765183436
+延兴 12.5143832909
+遮阳帽 12.8020653633
+斯坦尼斯 12.1089181827
+图坦 12.2912397395
+斯泰诺 13.2075304714
+贫病 11.0103058941
+挑上来 13.2075304714
+延光 11.1280889297
+受贿罪 10.0088573539
+两千三百余万 13.2075304714
+富得流油 11.4157710022
+春天里 11.0674643079
+通讯网 12.2912397395
+转印 11.7034530746
+实验区 10.604840786
+许先生 11.4157710022
+阳光雨露 12.8020653633
+权有权 12.8020653633
+供大于求 8.93783302172
+转包 11.0674643079
+瞎转 12.1089181827
+宗改定 13.2075304714
+旧城区 10.2117981979
+文钞 11.598092559
+桑曲 11.5027823792
+甩干 13.900677652
+华兹华斯 11.1926274509
+戴金 11.9547675029
+转化 6.3286892026
+旁坐 12.2912397395
+苎麻 9.32596667347
+实物税 11.7034530746
+戏场 11.1280889297
+武孝义 11.5027823792
+桓公 10.642581114
+第聂伯罗 12.8020653633
+礼士 12.8020653633
+铁线蕨 12.2912397395
+玉爪 12.1089181827
+祸不单行 11.1926274509
+汗马之劳 13.2075304714
+打光机 13.900677652
+马向西 13.2075304714
+据报 12.2912397395
+缉获 13.900677652
+事事 9.12999302751
+文钦 11.3357282945
+延儒 12.2912397395
+股票网 13.2075304714
+三十厘米 13.2075304714
+奥林 10.7226238216
+爱不释手 10.7226238216
+电传 10.4349417492
+滹沱河 9.48183704418
+立传 11.0674643079
+演替 10.8096351986
+三寸不烂之舌 10.8561552143
+越战越勇 12.2912397395
+田旺营 13.2075304714
+早去 11.0674643079
+步步高升 11.4157710022
+白嘉措 13.900677652
+母纳 13.2075304714
+转发 9.5062284973
+母线 11.4157710022
+古拉峰 11.4157710022
+受罚 9.91169360541
+转变 6.11828731639
+睡前用 12.2912397395
+宝祥号 12.5143832909
+饱和压力 13.900677652
+路道 12.2912397395
+转口 11.0674643079
+导游证 12.8020653633
+播弄是非 12.8020653633
+庄稼人 8.61747392324
+刘玉升 9.62401153296
+爆粒玉米 13.900677652
+小口径 9.33632946051
+二百七十三年 12.5143832909
+徐绍清 12.8020653633
+礼堂 10.0940151622
+叹为观止 9.82314020807
+转台 11.598092559
+丁项 13.900677652
+库巴唐 13.900677652
+谈清 13.900677652
+大头鱼 11.9547675029
+丁顿 13.2075304714
+万谢 13.900677652
+拓印 11.9547675029
+音响设备 11.9547675029
+平分线 12.5143832909
+闻闻 10.4994802703
+米林县 13.900677652
+矿业集团 10.1630080337
+议商 12.5143832909
+国务院学位委员会 10.4041700905
+圆盘犁 13.2075304714
+马里共和国 12.5143832909
+比德曼 13.2075304714
+步天地 11.598092559
+无诚意 11.5027823792
+停下来 8.089536659
+林海音 12.5143832909
+账外 12.2912397395
+成文宪法 11.8212361103
+立住 9.98865464655
+闻乌孙 13.2075304714
+立位 12.2912397395
+立体 8.31342899358
+实验台 13.900677652
+或然性 12.8020653633
+华中理工大学 12.8020653633
+奥朗 11.4157710022
+延军 12.8020653633
+转去 10.4994802703
+转轮 10.5684731418
+立交 10.4041700905
+治疗费 11.7034530746
+非商业性 12.1089181827
+累病 12.2912397395
+分数指数 13.900677652
+报审 13.900677652
+构象分析 12.1089181827
+气象部门 10.7226238216
+方田均 13.2075304714
+官佃 13.2075304714
+阿伊达 12.2912397395
+立人 11.5027823792
+贴花 12.1089181827
+凯尔森 12.1089181827
+物外 13.900677652
+报安 13.900677652
+粗制 11.2616203224
+低着 11.5027823792
+远在天边 11.1926274509
+立于 8.53003962385
+温度场 11.8212361103
+许君 13.900677652
+立井 12.2912397395
+中卫县 11.1926274509
+甩开 9.71102290995
+朝不虑夕 13.2075304714
+马鬃岭 12.1089181827
+电业 10.765183436
+皱折 12.1089181827
+流利地 11.8212361103
+无套裤汉 11.2616203224
+过渡阶段 9.98865464655
+报导 9.46986085313
+余个 8.87023973058
+逛过 11.3357282945
+薛蟠实 13.2075304714
+丁香 9.45802639549
+酒席 8.6803218269
+死沉 12.2912397395
+低眉 10.9049453784
+一百四十三天 13.2075304714
+脉管炎 11.9547675029
+出题者 13.900677652
+一下子全部 12.8020653633
+编导者 11.7034530746
+可任意 10.8561552143
+转制 10.4994802703
+教养院 12.8020653633
+受纳 11.1926274509
+转到 7.59622884955
+忧戚 11.3357282945
+几文钱 12.5143832909
+戏园 13.2075304714
+奥普 11.0674643079
+库尔喀 12.2912397395
+生产定额 13.900677652
+低矮 8.62767809341
+高爵厚禄 12.8020653633
+吹气如兰 13.900677652
+团长 7.51717101709
+照章 11.3357282945
+塔里寒 13.2075304714
+姚老板 13.900677652
+汉光武 11.598092559
+爆震 12.8020653633
+立为 9.27570483869
+李肇 13.2075304714
+一面之辞 11.598092559
+母杨氏 13.2075304714
+浓香 10.5684731418
+各擅胜场 13.900677652
+蝎子王 13.2075304714
+立下 8.73019365694
+九岭山 11.0674643079
+电价 7.92686804011
+戴逵 12.5143832909
+四五位 12.8020653633
+母羊 11.9547675029
+李炎 10.7226238216
+尼亚诺 12.8020653633
+臧亦嘉 11.4157710022
+节育 11.9547675029
+电仪 13.900677652
+电令 11.1280889297
+利古尔 13.2075304714
+萧山人 11.9547675029
+李公子 8.89004235788
+题海战术 13.900677652
+门宣赞 11.9547675029
+好好学习 10.7226238216
+沈钦裴 13.900677652
+粮食安全 9.87532596124
+骁骑 10.3743171274
+抽紧 11.3357282945
+窈窕淑女 11.598092559
+偏胖 12.5143832909
+转办 11.8212361103
+署名 9.17328983326
+大幅提高 8.51618258919
+赋课 12.8020653633
+陈遇乾 13.2075304714
+北山酒经 13.900677652
+酒店 7.19748953873
+演讲词 13.900677652
+行善 10.4994802703
+马鬃山 10.9562386728
+远道而来 10.9562386728
+张相公 11.7034530746
+王中王 13.2075304714
+转动 7.44862869754
+宝顺 11.4157710022
+土生土长 10.2897597393
+文锦 10.9049453784
+赋诗 9.91169360541
+冯骥才 13.2075304714
+节能 6.75785025081
+尤斯 11.3357282945
+神宫监 12.8020653633
+司判官 12.2912397395
+解除武装 11.4157710022
+热情服务 12.8020653633
+干卿底事 13.900677652
+省过 12.8020653633
+甩尾 11.9547675029
+师成 13.900677652
+钦命 10.2371160058
+四百五十 11.4157710022
+文集 7.91171623509
+文雅 9.54396882529
+金锁锁 12.8020653633
+纳银占 13.2075304714
+绝不放弃 12.5143832909
+输配水 13.900677652
+郭汾阳 13.2075304714
+干棉球 13.2075304714
+转入 7.32979468964
+水镁石 12.1089181827
+学有所长 13.2075304714
+病包儿 13.2075304714
+右丞相 9.15574552361
+兴安县 10.9562386728
+转关 12.2912397395
+褚坚 11.4157710022
+不敢苟同 11.3357282945
+过节儿 13.2075304714
+言必有中 13.2075304714
+惜薪 11.598092559
+攻城 7.78699547214
+据悉 6.66722223335
+奥斯 10.4994802703
+抽纱 10.9562386728
+澄迈 12.2912397395
+陈兴才 13.2075304714
+烧坏 10.642581114
+腿短 11.1926274509
+八章 11.3357282945
+彩号 10.604840786
+省辖 11.598092559
+退婚 11.0674643079
+延医 11.9547675029
+资源管理 10.4041700905
+无毒不丈夫 11.1926274509
+芥酸 13.2075304714
+师承 9.32596667347
+吸铁 11.7034530746
+认可度 10.642581114
+唐骏 9.63799777493
+武宣 12.2912397395
+头部 7.29537973103
+转儿 13.900677652
+张贵妃 12.5143832909
+刻于 11.0674643079
+硬核 13.2075304714
+赶庙会 11.3357282945
+抠掉 12.8020653633
+公至正 13.900677652
+新教徒 10.2630914922
+一睡 10.8561552143
+别尔金 13.2075304714
+勤政 10.604840786
+硬棒 13.2075304714
+必不可少 8.47572763449
+雌鹿 11.5027823792
+所以然 10.3743171274
+奥数 11.7034530746
+成大群 11.5027823792
+大巧若拙 13.900677652
+攻坚 9.93038573842
+当今社会 10.9049453784
+丁家河 12.1089181827
+关不上 13.2075304714
+社主任 12.1089181827
+转出 9.12999302751
+歌本 12.8020653633
+红衣裳 13.900677652
+浦圃斓 12.8020653633
+推算出来 11.8212361103
+下台阶 10.3171587135
+安妈 10.9562386728
+桓台 12.2912397395
+桓叶 13.900677652
+翁某 12.8020653633
+桌球室 13.900677652
+阿萨息 13.900677652
+风波不断 12.8020653633
+父女俩 11.0674643079
+库尔回 12.5143832909
+罗伊岛 13.900677652
+母系 9.28555713513
+转写 11.0674643079
+王世充 10.4349417492
+霍老 9.7898037878
+饱胀 11.7034530746
+受累 9.38981814546
+连山湾 12.5143832909
+燃烧性 11.598092559
+王世光 13.900677652
+影视界 12.5143832909
+购物中心 9.72629038208
+甲方乙方 13.900677652
+惠恕 13.2075304714
+刻下 10.3743171274
+刻上 11.0674643079
+茹尔宾 13.900677652
+两万五千里长征 12.2912397395
+礼宾 11.4157710022
+薄荷油 11.8212361103
+田易居 12.5143832909
+催化作用 10.0720362555
+宇观 12.5143832909
+杨陆凯 11.5027823792
+育才 9.33632946051
+杨山一 12.8020653633
+淳于髡 11.9547675029
+装成 10.9562386728
+熊明遇 10.2630914922
+文韵 13.2075304714
+而能 10.0088573539
+德微理 13.2075304714
+簪缨世族 13.900677652
+旁听 9.41204128224
+劳力士 12.5143832909
+裸男 13.2075304714
+军工路 13.2075304714
+养其性 13.2075304714
+闻阁 13.900677652
+内伶仃岛 12.5143832909
+簌簌泪下 13.2075304714
+伸缩自如 11.9547675029
+噘嘴 11.7034530746
+逆变换 13.2075304714
+断层线崖 13.900677652
+婺源县 11.598092559
+针灸术 13.900677652
+库尔坎 13.900677652
+十字头 13.900677652
+名人战 12.2912397395
+受粉 12.8020653633
+延到 12.1089181827
+事已如此 11.5027823792
+头里 9.19114745066
+杭州府 11.1926274509
+武安 10.3453295905
+轻悄悄 13.900677652
+转借 11.1926274509
+三角旗 13.2075304714
+瓦尔斯 12.1089181827
+秦牧散 13.900677652
+装扮 9.28555713513
+莱克斯 12.1089181827
+马立师 13.2075304714
+弗赖堡大学 11.0674643079
+谘议局 13.2075304714
+日中为市 12.5143832909
+图名 13.2075304714
+沙雷氏 13.900677652
+受精 8.77671367257
+文过 13.900677652
+文青 13.900677652
+节节 8.85725253506
+印纹 11.8212361103
+军姿 13.900677652
+退守 9.17328983326
+文静 10.0294766411
+累着 12.1089181827
+掌牧官 11.1280889297
+李渊立 12.8020653633
+盹儿 11.1926274509
+砖块 10.0294766411
+范阳郡 11.9547675029
+安迪尔 11.9547675029
+暖风机 11.9547675029
+胡子生 13.2075304714
+报复 7.92941581219
+威廉姆斯 11.0674643079
+不过如此 10.1630080337
+正当关系 12.2912397395
+报备 10.2371160058
+珠光体 12.2912397395
+陪小心 13.2075304714
+小彪 12.8020653633
+砖坯 11.1926274509
+社区服务 11.5027823792
+十队 12.2912397395
+人身依附 10.1871055853
+总得分 12.8020653633
+丁一粮 13.2075304714
+都依允 12.8020653633
+文革 8.95903522937
+冷月均 10.8096351986
+闻雷 12.8020653633
+文会宴 13.2075304714
+邮电费 13.900677652
+杭州市 9.26594866375
+浆膜 11.0103058941
+吃穿住行 12.1089181827
+特科 10.8561552143
+叠层石 11.1280889297
+许国 11.0103058941
+粗劣 11.598092559
+抽缩 13.2075304714
+忠义堂 9.98865464655
+包换 13.2075304714
+遮蔽住 13.900677652
+郎洲 13.900677652
+转储 12.8020653633
+詹姆士 11.2616203224
+关不住 11.5027823792
+雁门关 10.3743171274
+宝马 8.21709788464
+砖场 9.11318590919
+段家庄 12.5143832909
+步行街 10.4666904475
+万万年 12.2912397395
+降尊纡贵 13.900677652
+夏雨娘 13.900677652
+省视 11.598092559
+攻击 6.40402521381
+玉檀静 13.900677652
+大排场 12.2912397395
+强整欢 13.2075304714
+江营入 12.2912397395
+图卷 11.9547675029
+服装面料 12.1089181827
+取道 9.38981814546
+恢复元气 10.6818018271
+奥援 11.9547675029
+夏朗德 13.900677652
+三十八九岁 13.2075304714
+蒲江县 13.900677652
+一时一事 13.2075304714
+老君 9.59661255877
+胃切除术 12.8020653633
+报废 9.18217878068
+书本子 13.900677652
+瓦尔拉 11.7034530746
+报应 9.23723855786
+西洋乐器 12.5143832909
+实验场 9.84023464143
+占其邑 13.2075304714
+自动装置 11.4157710022
+凤翎 12.5143832909
+瘠瘦 13.900677652
+退居 9.35738286971
+澄观 12.8020653633
+转圈 10.3171587135
+激赏 11.598092559
+惠更 13.2075304714
+转圜 10.6818018271
+劳动对象 9.7898037878
+止血药 10.8561552143
+头雁 12.5143832909
+许克 13.2075304714
+许光 13.2075304714
+埃吕司 13.900677652
+珠海航展 11.598092559
+空调设备 11.1280889297
+苗祖洞 13.2075304714
+荣辱与共 11.5027823792
+咝咝声 12.1089181827
+任为典 13.2075304714
+段太公 11.8212361103
+沾染上 11.7034530746
+九头鸟 12.5143832909
+穷棒子 13.2075304714
+十八里 10.3453295905
+昌平县 10.4666904475
+调虎离山 12.1089181827
+转场 11.2616203224
+智深正 12.8020653633
+宛马 13.900677652
+攻关 9.91169360541
+交通网络 11.0674643079
+延嗣 12.2912397395
+税务代理 12.2912397395
+变脏 13.900677652
+吊孝 10.765183436
+住留 13.900677652
+社会科学家 11.0103058941
+图右 13.900677652
+空白试验 13.900677652
+纳赛尔 10.5684731418
+装料 11.1280889297
+攻入 8.28390655431
+意料之外 9.38981814546
+年代学 10.1871055853
+木乎乎 13.2075304714
+伊沙克 12.5143832909
+宫见帝 13.900677652
+戏台 9.15574552361
+谱号 12.8020653633
+周细姐 13.2075304714
+九千户 13.2075304714
+头阵 12.8020653633
+惠明 12.1089181827
+西瓜籽 12.8020653633
+产业链 7.28193866846
+古灵精怪 12.8020653633
+变脸 9.69598503258
+任教于 9.04864738806
+攻克 7.89679058487
+比晓维 13.900677652
+仲呈祥 13.900677652
+报帐 13.2075304714
+违者罚款 13.900677652
+酒宴 9.15574552361
+酒家 8.9102450652
+别理 11.0103058941
+大聚义 13.2075304714
+情深意浓 13.900677652
+吊子 11.8212361103
+挨宰 13.2075304714
+旁及 10.765183436
+惠普 10.2371160058
+侦探小说 11.1926274509
+叶甫盖 11.4157710022
+吮疽舐痔 13.900677652
+许出 13.900677652
+离型纸 13.900677652
+酒客 12.1089181827
+多两句 13.900677652
+女大衣 13.2075304714
+无人化 13.900677652
+瞎说 9.33632946051
+凤翔 8.79473217808
+文选 9.37888907493
+耽乐 12.8020653633
+刹时间 12.1089181827
+十架 12.2912397395
+十余个 10.642581114
+妄想 9.12999302751
+和吏民 13.2075304714
+永新县 11.9547675029
+瞎话 10.533381822
+口干舌燥 10.3171587135
+无人区 10.0088573539
+报幕 12.8020653633
+边郡汉 11.8212361103
+一手交钱 11.5027823792
+劳臣 12.5143832909
+昌平区 12.8020653633
+玉米 6.63245463082
+黄体期 13.2075304714
+杜继祖 13.2075304714
+讲出去 12.1089181827
+戏剧 7.14142238131
+小型机 11.9547675029
+劳联 13.2075304714
+文采 10.0505300503
+彩凤随鸦 13.900677652
+突变率 12.1089181827
+文野 13.2075304714
+文德殿 11.0103058941
+绕梁 13.2075304714
+打富济贫 10.9049453784
+十字形 10.0940151622
+脚臭 12.1089181827
+吸引外资 10.3171587135
+奥拉 10.8561552143
+软磨硬泡 11.598092559
+据查 12.1089181827
+急煎煎 11.9547675029
+鱼杆 13.900677652
+纠结 9.98865464655
+百分之七八十 13.900677652
+里克斯 12.5143832909
+少典 11.8212361103
+冲积 8.61747392324
+奥拓 12.5143832909
+很纯 12.8020653633
+天不作美 13.900677652
+只顾 7.45178825783
+李臣 11.4157710022
+牙周组织 12.1089181827
+杨凌 11.0103058941
+迎头赶上 10.7226238216
+航天服 11.4157710022
+图利 11.9547675029
+轰开 12.8020653633
+十八部 11.9547675029
+纠纷 7.75220935606
+伤害者 13.2075304714
+季风雨 11.8212361103
+少年儿童 10.0720362555
+闻道 11.8212361103
+延吉 10.604840786
+房太太 12.2912397395
+延后 9.69598503258
+才俊 11.5027823792
+山大路 13.900677652
+打谷场 11.0103058941
+库尔兰 12.5143832909
+空对空 10.2630914922
+洗衣歌 13.900677652
+钢铁价格 10.3743171274
+唯一性 10.642581114
+离去基团 11.8212361103
+法纪 10.642581114
+冲蚀 11.1926274509
+宾利 10.642581114
+跟前 6.96920584638
+痴公子 12.5143832909
+大聚会 11.5027823792
+转回 9.12155415886
+脚腕 11.7034530746
+意见沟通 13.900677652
+毒蝎 11.7034530746
+兴业银行 7.65845438652
+罗马教皇 9.59661255877
+图勒 12.8020653633
+呼哧呼哧 10.604840786
+惠英嫂 10.0088573539
+小舅妈 13.900677652
+奥托 9.66657114738
+基础代谢率 12.2912397395
+关外 8.51160592216
+通讯站 13.2075304714
+老清叔 11.5027823792
+任北魏 13.2075304714
+局促不安 10.604840786
+攻子之盾 13.900677652
+试生产 10.3743171274
+一面之识 12.8020653633
+惠来 11.7034530746
+惊鸿一瞥 11.8212361103
+周先庚 13.2075304714
+一面之词 10.9049453784
+财神 10.4349417492
+陆军上校 12.2912397395
+咨询会 12.2912397395
+福宁府 12.5143832909
+西朝房 13.900677652
+师旅 11.9547675029
+打上去 13.2075304714
+十八道 12.8020653633
+除过 8.79473217808
+别用 11.5027823792
+涉外企业 13.2075304714
+师旷 11.8212361103
+李庆逵 13.2075304714
+宇航局 13.900677652
+吃老本 12.5143832909
+落地灯 13.2075304714
+朝夕相处 9.96885201925
+影视片 13.2075304714
+头面 9.55687223012
+现浇 12.5143832909
+退市 8.1902506346
+触手可及 11.1926274509
+装有 7.22864470651
+图兰 11.4157710022
+硬汉 10.3171587135
+倾斜面 12.2912397395
+组织纪律 11.0674643079
+美容院 10.6818018271
+逐利 10.1394775363
+好几十倍 13.2075304714
+马拉雅 12.5143832909
+貌若天仙 12.5143832909
+攻取 8.65365357982
+戴镜 13.900677652
+汤色 10.8096351986
+邪说 11.4157710022
+羰基化 12.5143832909
+弗莱河 13.900677652
+刘适兰 13.900677652
+松焦油 13.900677652
+退席 11.0674643079
+沮洳 12.2912397395
+图克 10.1871055853
+律诗 10.2371160058
+沉积环境 11.0674643079
+吃人不吐骨头 13.900677652
+装机 8.95903522937
+影视动画 13.900677652
+图元 13.2075304714
+语笑喧哗 13.2075304714
+百口泉 13.900677652
+布帆 12.2912397395
+脸皮厚 11.9547675029
+贼去关门 13.2075304714
+别的 5.94630537944
+攻去 13.900677652
+厦门港 11.0674643079
+马斯塔 12.8020653633
+装束 8.90346537821
+寇白门 13.2075304714
+组合而成 9.71102290995
+虚左以待 13.2075304714
+同位素 8.47572763449
+黑亮亮 12.8020653633
+通讯社 8.35941410682
+累犯 11.1926274509
+弗里特 13.2075304714
+淫靡 11.598092559
+观卿 13.2075304714
+争执不下 11.2616203224
+转售 11.1280889297
+电信公司 11.2616203224
+酱豆腐 12.5143832909
+飞也似地 11.5027823792
+谱儿 11.0674643079
+硬水 11.2616203224
+千万根 13.2075304714
+鹊巢 12.2912397395
+水陆空 12.2912397395
+促黄体素 13.900677652
+泸沽湖 11.8212361103
+好缠 12.8020653633
+杭天醉 7.2872934336
+泌尿道 11.1926274509
+松江镇 13.2075304714
+低热 9.96885201925
+霞浦县 12.5143832909
+礼帽 9.54396882529
+一截儿 12.5143832909
+王熙凤 10.642581114
+滂沱大雨 12.8020653633
+退库 13.900677652
+攻占 7.40995411747
+不可或缺 9.29550746599
+戴震 10.4666904475
+永不背叛 13.900677652
+宝鼎 10.533381822
+追索 9.96885201925
+抽穗 11.5027823792
+防非典 13.900677652
+祈使 13.2075304714
+潇洒走 13.900677652
+汤武革命 11.7034530746
+便宜货 11.3357282945
+退庭 13.2075304714
+医道高明 13.900677652
+孙尚清 13.2075304714
+低烟 13.900677652
+番茄 9.56994431169
+帕尔纳斯 11.8212361103
+脚色 10.0294766411
+文德桥 13.2075304714
+逛街 10.1630080337
+许可 7.99804431857
+谱写 10.3743171274
+乡城 13.900677652
+集合起来 10.4041700905
+戴青 12.1089181827
+年近古稀 13.900677652
+一百一十六家 13.2075304714
+低点 7.43297892587
+少儿 10.1871055853
+库尔勒 9.77354326693
+方堂 13.2075304714
+杜纳马 13.900677652
+拆下 10.9049453784
+鹰厦线 12.1089181827
+御驾 9.93038573842
+悠悠闲闲 13.900677652
+议员 7.6761192227
+满山遍野 10.9562386728
+鱼撒 12.5143832909
+中国民主促进会 10.7226238216
+木尼河 12.8020653633
+劳莱 12.5143832909
+障碍灯 13.2075304714
+欺君之罪 11.598092559
+浦江 10.765183436
+房均九 12.5143832909
+鼓动 8.61241062128
+万万岁 9.98865464655
+韶山市 12.8020653633
+抽税 11.598092559
+财务报表 9.18217878068
+转喻 13.900677652
+姚培谦 13.2075304714
+退开 10.4666904475
+梁梁 13.900677652
+重伤风 13.2075304714
+青年节 12.1089181827
+变节 10.4994802703
+李元景 13.900677652
+转告 9.11318590919
+甩头 11.3357282945
+转呈 10.6818018271
+郑京和 13.2075304714
+依成法 13.900677652
+编目 10.2897597393
+惠方 11.9547675029
+第三十八 12.1089181827
+云南迪庆藏族自治州 13.900677652
+惠施 11.1926274509
+无底价 12.8020653633
+亮锃锃 13.2075304714
+惠文 13.900677652
+扔给 9.35738286971
+遥遥相望 11.3357282945
+整肃 9.44633035572
+多两倍 12.1089181827
+拆信 11.9547675029
+预装 13.900677652
+大喜事 10.4666904475
+薯类 8.91707103027
+来来往往 9.56994431169
+格迪斯 12.5143832909
+食人族 13.2075304714
+正态分布 10.533381822
+秦明得 12.8020653633
+怎奈 9.6811699468
+砖厂 10.4041700905
+班后 12.8020653633
+苏联红军 9.66657114738
+远亲近戚 13.2075304714
+攻势 8.08059472162
+完整如新 12.8020653633
+施蒂勒 11.9547675029
+这么些 9.91169360541
+转向 6.13341365522
+除起 13.2075304714
+递回来 13.900677652
+六七十年代 11.5027823792
+李群玉 13.2075304714
+倍频程 13.900677652
+拉菲亚 13.900677652
+泼辣辣 12.8020653633
+大庸市 13.900677652
+聚丙烯 9.89334446674
+远不止 10.4041700905
+一十八 12.1089181827
+一十六 11.8212361103
+野兔子 12.8020653633
+固定座位 13.2075304714
+礼忏 13.2075304714
+退役 8.48457724977
+昭示 9.62401153296
+酒壶 9.22784881751
+别着 11.2616203224
+奥恩 12.8020653633
+三三数 13.2075304714
+许劭 13.900677652
+抽签 9.04086524761
+惠支 11.7034530746
+麦肯 13.2075304714
+通宵达旦 10.8561552143
+使用手册 13.2075304714
+一命归西 12.1089181827
+退得 10.604840786
+八篇 11.9547675029
+锥齿轮 11.9547675029
+史王瑾 13.2075304714
+皱摺 13.900677652
+油盘 13.900677652
+浦洞 13.900677652
+除不尽 13.900677652
+摧眉折腰 13.900677652
+晶体蛋白 12.5143832909
+宝鸡 8.89673134603
+图像 7.75649201785
+得克萨斯大学 11.8212361103
+非机动车 9.14708746087
+踢门 12.8020653633
+劳苦 9.77354326693
+抽筋 10.1871055853
+实验品 12.2912397395
+别省 13.2075304714
+攻到 11.5027823792
+当炮灰 12.5143832909
+牵上去 13.900677652
+别看 8.1902506346
+有容乃大 12.8020653633
+张大嘴 11.3357282945
+电唱机 12.5143832909
+海力士 13.2075304714
+清辉如 13.2075304714
+逐句 11.8212361103
+忠言逆耳利于行 12.8020653633
+行凶杀人 13.900677652
+勤恳 11.3357282945
+库图佐夫 11.5027823792
+童颜鹤发 12.8020653633
+碧浪 13.2075304714
+总经理部 13.900677652
+不可靠性 13.2075304714
+擦亮眼睛 11.2616203224
+古德诺 11.9547675029
+计算能力 10.8561552143
+鳜鱼 11.1926274509
+淫雨 11.598092559
+许勇 11.5027823792
+平原沼泽 12.8020653633
+生死离别 12.8020653633
+电缆线 11.5027823792
+变色 8.73019365694
+一去不复返 10.604840786
+郎朗 11.2616203224
+大头鬼 12.8020653633
+洗面奶 10.2117981979
+桩基础 12.8020653633
+山泽之 11.0103058941
+业务部门 9.93038573842
+电传机 13.900677652
+宋军寨 13.2075304714
+一十三 11.598092559
+长江三角洲地区 12.2912397395
+政治局势 11.8212361103
+劳务工 11.9547675029
+论功行赏 10.8561552143
+宗会昌 12.5143832909
+观音像 10.9049453784
+孝养 13.2075304714
+十五六个 12.5143832909
+低湿 10.9562386728
+纯理论 11.8212361103
+齐姬 13.900677652
+涨红了脸 10.8561552143
+面如 10.1871055853
+跨洋 13.2075304714
+素处理 13.900677652
+告老还乡 11.1926274509
+第三十九 12.5143832909
+硬物 10.9562386728
+火焰 7.83225206373
+供电系统 11.8212361103
+宋改河 12.8020653633
+吴巨姓 12.8020653633
+丁胺 12.2912397395
+丁能 13.2075304714
+才力 11.5027823792
+低温 7.62591563073
+脑门子 10.0088573539
+五六间 13.900677652
+疑云重重 12.2912397395
+开采业 11.2616203224
+昭明 11.1280889297
+人才流失 11.3357282945
+缚起来 12.8020653633
+奥羽 13.900677652
+望而生畏 10.4666904475
+一九二九年 13.2075304714
+委蛇 12.5143832909
+庞迪克 13.2075304714
+垂帘听政 10.4666904475
+倘或 8.62256299275
+一十九 13.2075304714
+高煦 11.9547675029
+无权过问 11.9547675029
+何叔衡 11.8212361103
+电场 8.41588071849
+涓涓 11.2616203224
+韦斯顿 12.8020653633
+议定 9.05649056552
+徐元直 12.1089181827
+萤火虫 9.87532596124
+吕布令 13.2075304714
+转铁蛋白 13.2075304714
+第三十一 11.1926274509
+有机溶剂 9.15574552361
+昭显 13.2075304714
+武后光 13.2075304714
+第三十三 11.5027823792
+钦仰 12.5143832909
+受权 11.598092559
+忽隐忽现 11.0103058941
+高调 8.49350588052
+宜人 9.19114745066
+叫安 11.8212361103
+大半辈子 10.3453295905
+一十二 12.5143832909
+立地 10.533381822
+一十五 11.7034530746
+齐奥 11.5027823792
+一时一刻 11.7034530746
+鬼见愁 12.8020653633
+航天站 10.7226238216
+三氯甲苯 13.2075304714
+倾斜角 11.9547675029
+刘义隆 11.8212361103
+旁侧 11.4157710022
+思绪万千 11.8212361103
+九十九 10.3171587135
+经纬仪 10.4041700905
+丁聪 12.2912397395
+西格马 13.900677652
+文豹 13.2075304714
+降低干扰 13.2075304714
+新泽西州 10.0940151622
+拉菲克 13.900677652
+骨肉瘤 12.5143832909
+右翼前旗 12.1089181827
+文象 13.2075304714
+苏拉威西 10.765183436
+齐奏 11.0674643079
+省长 7.97108850859
+才刚 9.55687223012
+远别 12.5143832909
+拆倒 13.900677652
+不僧不俗 13.900677652
+齐头 11.8212361103
+碴儿 12.1089181827
+符一镜 12.5143832909
+受有 12.5143832909
+拆借 9.25628675283
+正统观念 11.4157710022
+风景秀丽 9.46986085313
+游山 11.1280889297
+脉门 13.900677652
+中国共产党第七次全国代表大会 11.5027823792
+第三十五 11.5027823792
+黄飞虎 13.900677652
+抽搐 8.6966709649
+布拉赫 13.900677652
+斋月 11.4157710022
+晋顷公 12.8020653633
+滦州 11.0674643079
+八九百 12.1089181827
+受保人 13.2075304714
+李曾伯 12.5143832909
+图例 12.5143832909
+别样 10.2897597393
+齐备 9.09665660724
+组成部分 6.68250081357
+洗衣盆 11.8212361103
+第三十二 11.7034530746
+举轻若重 13.900677652
+斋期 13.2075304714
+温饱工程 12.8020653633
+持笔 13.900677652
+齐声 8.5440913773
+共存亡 10.6818018271
+大为吃惊 11.0674643079
+缺乏幽默 13.900677652
+迁入地 13.900677652
+和羽林 13.900677652
+母本 11.0674643079
+和枫丹 12.1089181827
+挫敌锐气 12.8020653633
+童贯再 12.8020653633
+樱桃 8.89004235788
+都桃里 12.8020653633
+脐带 10.604840786
+钦佩 9.13850371718
+钟琪久 12.8020653633
+政和县 12.8020653633
+图书 7.98988100794
+母机 13.2075304714
+奥绍 13.900677652
+庄稼地 9.93038573842
+黎丘丈人 13.900677652
+埃里温 11.8212361103
+师礼 12.2912397395
+脍炙人口 9.75754292558
+良莠不分 12.2912397395
+拆出 12.8020653633
+热像仪 11.2616203224
+邢晗 13.2075304714
+深绿色 10.2371160058
+文艺作品 10.642581114
+赊给 13.2075304714
+欺世盗名 11.4157710022
+羿恃 12.5143832909
+咨询台 12.8020653633
+雌性激素 11.1926274509
+炫耀着 12.8020653633
+抬回来 11.4157710022
+戏中 10.9049453784
+福无双至 13.2075304714
+广通声 12.2912397395
+城市核心 12.2912397395
+吴学谦 12.8020653633
+师祖 12.8020653633
+加味水 13.900677652
+淫行 13.900677652
+鱼符 11.7034530746
+整车 7.40390266179
+图个 9.41204128224
+图中 8.32094782599
+开场锣鼓 12.8020653633
+学术界 8.55357012126
+沙害 12.8020653633
+奥纳 10.6818018271
+汝勿多 12.2912397395
+抽斗 13.900677652
+吴树平 11.598092559
+面壁 10.9562386728
+母权 12.5143832909
+瓜拉尼 11.2616203224
+经密 12.1089181827
+腿法 11.3357282945
+骨缝 11.3357282945
+勤练 12.5143832909
+省钱 9.31571017331
+吸进 10.0720362555
+图上 9.80633308975
+图下 13.2075304714
+滂沱 11.5027823792
+两万两 12.8020653633
+图一 11.8212361103
+九华山 10.0720362555
+软盘片 13.900677652
+永不磨灭 12.8020653633
+金鞋奖 13.2075304714
+何国舅 13.2075304714
+百年孤独 12.2912397395
+宾主 9.40086798165
+新思路 10.4349417492
+图件 11.598092559
+欢呼雀跃 10.9049453784
+宝者 12.2912397395
+戏份 11.7034530746
+谢苗诺夫 11.9547675029
+鱼篮 12.1089181827
+其实不然 10.2117981979
+载重汽车 10.5684731418
+文赋 11.598092559
+拉菲尔 13.900677652
+洪制府 13.2075304714
+电图 12.5143832909
+鱼篓 11.9547675029
+试运营 11.8212361103
+吕良伟 13.2075304714
+折射出 9.22784881751
+庞迪 13.2075304714
+支持系统 11.8212361103
+砸过去 11.5027823792
+伦纳德 13.2075304714
+马相随 13.900677652
+旁人 8.59240995457
+郭王庙 12.8020653633
+嘿嘿 8.49350588052
+分类单位 11.1280889297
+塔塔儿 11.0103058941
+曹娥江 10.642581114
+榆木疙瘩 12.5143832909
+文贞 12.8020653633
+京师大学堂 10.2897597393
+北驰 12.8020653633
+住满 10.765183436
+硬玉 11.1926274509
+城市雕塑 12.1089181827
+跟上 8.24119543622
+顾上尉 13.900677652
+紧张不安 10.8561552143
+图亚 13.900677652
+老红军 9.72629038208
+碗口 10.2371160058
+七弯八拐 12.8020653633
+才华 8.80692745117
+歧出 13.2075304714
+劳亚古 11.7034530746
+累活 11.7034530746
+面塑 11.598092559
+戴表 12.8020653633
+节制资本 11.1926274509
+学术刊物 10.9049453784
+打假者 13.900677652
+杨伯峻 12.2912397395
+斯塔夫罗波尔 12.8020653633
+文质 12.2912397395
+秋月春花 13.900677652
+斋日 13.2075304714
+姬归汉 12.1089181827
+齐寿 13.2075304714
+中山舰 10.9562386728
+记不得 10.2897597393
+逐个 9.61021821083
+面宽 11.1926274509
+课间休息 12.1089181827
+电商 12.2912397395
+花月夜 13.2075304714
+面容 8.37124856446
+诸湖开 13.2075304714
+浩淼 11.4157710022
+白粉墙 12.5143832909
+张二哥 13.2075304714
+缣帛 11.9547675029
+宝莱 13.2075304714
+人民代表大会常务委员会 10.9049453784
+海鲜城 13.900677652
+崔敦礼 13.2075304714
+想当年 9.91169360541
+宇都 13.900677652
+人民出版社 9.61021821083
+丁苯 11.9547675029
+四十余次 13.2075304714
+转经筒 12.8020653633
+逐一 8.71329184614
+十八辈 13.2075304714
+韦驮 10.9562386728
+受旱 12.2912397395
+立身扬名 12.8020653633
+十八辆 12.8020653633
+受约束 10.4994802703
+立嗣 11.9547675029
+许佩 12.8020653633
+齐家 10.3171587135
+亲笔签名 12.5143832909
+浓艳 10.7226238216
+浓色 12.5143832909
+滑上 13.900677652
+朱官屯 13.2075304714
+低氧 10.9562386728
+自发过程 12.8020653633
+股票数 11.5027823792
+邢政 12.8020653633
+电唁 13.900677652
+面对 5.95938208107
+游廊 10.0940151622
+依然如故 10.2630914922
+后鼓 11.4157710022
+引下去 13.900677652
+金牛道 12.8020653633
+盐碱滩 11.7034530746
+人物传记 11.0674643079
+柳林镇 11.5027823792
+宋军如 13.2075304714
+公尺见方 13.900677652
+抽暇 13.900677652
+互不相让 10.8561552143
+扔掉 8.78868986362
+马赞德 12.8020653633
+文身 10.0940151622
+实物性 13.900677652
+叫好 9.03314320152
+瓦尔米 13.2075304714
+化妆室 12.1089181827
+除邪 11.4157710022
+巴德尔 13.900677652
+统筹学 13.2075304714
+受敌 10.4666904475
+奇迹般地 10.1164880181
+闻达 10.8561552143
+杨则 11.7034530746
+购房者 8.089536659
+何竹淇 12.5143832909
+幸免于难 10.3743171274
+惯得 12.5143832909
+武术竞赛 13.2075304714
+霍顿 11.3357282945
+英王 9.45802639549
+受教 11.8212361103
+态度恶劣 12.8020653633
+纹丝不动 9.62401153296
+神兵天降 13.2075304714
+窜扰 12.5143832909
+包圆儿 13.900677652
+堂本 12.1089181827
+九曲十八弯 12.5143832909
+草木皆兵 10.4041700905
+经堂 9.89334446674
+三四层 11.9547675029
+布赖斯 13.2075304714
+返修率 12.2912397395
+植木枝 13.2075304714
+循声 10.604840786
+违警罪 12.8020653633
+装箱 11.1926274509
+价格优势 10.2897597393
+予以重创 13.900677652
+瞎闯 13.2075304714
+冀晋 11.7034530746
+头衔 9.0884932966
+宇通 9.44633035572
+夜视器材 11.8212361103
+瞎闹 11.8212361103
+游幸 11.598092559
+拆分 9.63799777493
+穆彰阿 12.8020653633
+啪哒啪哒 13.900677652
+丁舜 12.8020653633
+脱氧核苷 12.2912397395
+拆到 13.2075304714
+金蒂莱 13.2075304714
+纸尿裤 13.2075304714
+攻伐 10.1630080337
+罗力才 13.2075304714
+法国电信 11.9547675029
+电喷 11.4157710022
+珠光 10.604840786
+存取速度 11.7034530746
+临机应变 11.7034530746
+乡农 13.900677652
+面孔 7.76727960898
+斧柄 12.8020653633
+面子 7.63918596765
+斯特郡 13.900677652
+斯塔索夫 13.2075304714
+通工易事 12.5143832909
+谨领 11.9547675029
+许个 13.900677652
+煞费心机 13.900677652
+筛子 9.84023464143
+闹闹攘攘 13.900677652
+部委局 12.1089181827
+银行 4.67043661829
+芍药 9.65218240993
+文远 11.5027823792
+生或死 12.2912397395
+浓茶 10.0088573539
+许两 13.2075304714
+涓滴 11.0674643079
+后起之秀 10.2897597393
+抬上去 11.598092559
+计算机信息 10.6818018271
+谨饬 12.8020653633
+电告 11.5027823792
+表达 6.79982574303
+生龙活虎 10.8561552143
+黄美真 12.5143832909
+轮状病毒 11.9547675029
+拆台 11.0103058941
+许下 9.77354326693
+硬煤 12.5143832909
+卢森堡大公国 13.2075304714
+地图编辑 13.900677652
+任拱卫 13.2075304714
+低浅 13.2075304714
+登台演唱 12.5143832909
+惯常 9.84023464143
+据称 8.84443184663
+宋星主 12.2912397395
+秋尽冬 12.8020653633
+善有善报 12.2912397395
+银元宝 12.2912397395
+住民 12.1089181827
+电话公司 12.1089181827
+滦平 11.4157710022
+庞贝 10.9562386728
+右前方 10.8096351986
+文辞 9.98865464655
+头角 12.2912397395
+现代诗 11.9547675029
+钢铁工人 10.2897597393
+浓荫 10.5684731418
+汗如雨下 11.598092559
+气绝 11.1280889297
+低洼 8.66956903512
+二甲酸 13.2075304714
+粗口 12.1089181827
+变黑 9.85762638414
+懵懂 10.3171587135
+味如嚼蜡 13.900677652
+尔文宗 13.900677652
+朝思暮想 11.4157710022
+抽枝 13.900677652
+文达 12.1089181827
+坐北朝南 10.8096351986
+疯话 10.4666904475
+许久 8.21031819765
+民主德国 9.75754292558
+七千四百 12.2912397395
+鱼礁 13.2075304714
+烤羊肉 12.5143832909
+装穷 12.1089181827
+经委 10.3453295905
+霍香 12.1089181827
+漆艺 12.8020653633
+明星效应 10.2897597393
+判决书 9.69598503258
+根蒂 13.2075304714
+许亮 12.8020653633
+电阻 8.76487921493
+拆卖 13.900677652
+伊吾屯 12.8020653633
+沪闵路 13.2075304714
+创业史 11.7034530746
+抽条 13.2075304714
+冀望 11.2616203224
+姜女庙 10.8561552143
+无可置疑 11.3357282945
+飞腾 9.66657114738
+战索索 13.2075304714
+游弋 10.4994802703
+省院 10.2117981979
+萨博尼斯 12.8020653633
+鱼科 9.91169360541
+拆卸 9.87532596124
+百越族 11.598092559
+游开 12.2912397395
+宝船 9.61021821083
+立名 12.1089181827
+极目远眺 12.5143832909
+提名者 13.900677652
+大指 12.8020653633
+老祖 11.0674643079
+风向标 8.80081122415
+女权运动 11.7034530746
+枯水期 9.44633035572
+望出去 11.4157710022
+侏罗世 10.4994802703
+坡积物 11.8212361103
+红香圃 12.1089181827
+许五 12.1089181827
+许仪 12.8020653633
+火烈 13.900677652
+杉谷义 11.7034530746
+悬壁 11.598092559
+许鹿希 13.900677652
+抽机 13.900677652
+河南梆子 11.3357282945
+林家花园 13.900677652
+叭嗒 12.5143832909
+微波网络 12.5143832909
+在位者 12.5143832909
+吸走 11.0674643079
+吸起 11.8212361103
+立命 11.7034530746
+家无二主 13.900677652
+巴尔卡尔 12.1089181827
+仔岛 12.8020653633
+扛下来 13.900677652
+梧州 9.75754292558
+魂消胆丧 13.900677652
+棒打鸳鸯 13.900677652
+韩向齐 13.2075304714
+钢铁工业 7.88941047757
+一言不和 13.900677652
+悬壶 12.5143832909
+绷直 12.5143832909
+科学城 10.8561552143
+叫声 7.56739802384
+张存孟 13.900677652
+攻下 8.61241062128
+攻上 10.9049453784
+五封 12.2912397395
+狂吻 11.9547675029
+奋争 13.2075304714
+物质欲望 12.2912397395
+山阴夜雪 13.900677652
+师范学校 8.66956903512
+泾渭分明 11.3357282945
+尉职如 13.2075304714
+显证 12.8020653633
+一百一十八万三千四百七十七亩 13.2075304714
+悬式 13.2075304714
+转位 11.9547675029
+省里 8.56795885871
+火烛 10.8096351986
+玩过来 13.900677652
+手提包 10.9049453784
+亦师亦友 13.2075304714
+吃得开 11.2616203224
+转作 11.3357282945
+吕布乘 13.900677652
+小阿雅 11.9547675029
+擅作主张 12.5143832909
+架回 13.900677652
+萨尔杜 12.8020653633
+科尔贝 12.8020653633
+齐州 11.7034530746
+电印 13.900677652
+薯条 12.8020653633
+咨询团 13.900677652
+受援 12.2912397395
+宜昌县 11.9547675029
+倒淌河 11.9547675029
+众矢之的 10.533381822
+中共四川省委 12.5143832909
+二三百万年 12.2912397395
+游士 11.1926274509
+霍麦 12.8020653633
+彩屏 11.0674643079
+除险 11.2616203224
+新兵营 12.8020653633
+电化 10.9562386728
+微程序 13.2075304714
+良好效果 10.533381822
+财政支出 9.18217878068
+立号 13.900677652
+万幢 13.2075304714
+东方广场 13.900677652
+三个臭皮匠 13.2075304714
+宝藏 8.87023973058
+转会 10.8561552143
+万户千家 13.2075304714
+约束力 9.01032852375
+受控 9.59661255877
+张皇失措 11.5027823792
+血液制品 12.1089181827
+松中昭 13.2075304714
+驾车人 12.8020653633
+改换门庭 11.598092559
+缇萦 13.2075304714
+博士生 9.59661255877
+叶脉 10.0505300503
+分辨时间 13.2075304714
+第八十回 12.1089181827
+五六里 10.2371160058
+自觉性 10.1394775363
+虎娃 13.900677652
+正多边形 11.8212361103
+定远县 13.900677652
+外交信使 12.8020653633
+江洲 13.900677652
+老朋友 8.47572763449
+引以 11.598092559
+哈哈地笑 10.4349417492
+经常 5.82665143585
+受损 8.1608847398
+马克吐温 13.900677652
+硬盘 10.2371160058
+平面广告 12.8020653633
+克汀病 13.900677652
+经师 11.5027823792
+女子监狱 12.2912397395
+电台 7.76511276089
+王曰俞 13.900677652
+挠痒 12.1089181827
+广告创意 13.900677652
+一言不发 8.74162235276
+七十余年 13.900677652
+吭声 8.70772080109
+蜉蝣 10.7226238216
+张一麟 12.8020653633
+赵丽 12.2912397395
+鱼纲 12.8020653633
+悬心 11.4157710022
+受持 12.2912397395
+自然铜 11.5027823792
+鱼线 12.8020653633
+刻个 13.900677652
+司马氏家族 13.2075304714
+经幢 10.5684731418
+经幡 12.5143832909
+鱼纹 11.8212361103
+立即 5.81119517762
+立卷 12.2912397395
+电压 7.72689154807
+别气 12.8020653633
+笑吟吟 9.09665660724
+李贺诗 13.2075304714
+霍鸿 12.8020653633
+经年 11.1280889297
+马婉容 12.8020653633
+电厂 8.11378027061
+鹿特斯 13.900677652
+转侧 11.4157710022
+慈禧寝 13.900677652
+立升 13.2075304714
+硬皮 11.5027823792
+戴起 11.598092559
+受挫 8.71889410168
+立华 12.2912397395
+绝世佳人 13.900677652
+演讲集 12.1089181827
+高画质 13.900677652
+悬念 8.04560572977
+宛若 10.4349417492
+皱缩 11.4157710022
+立博 11.1280889297
+开发量 11.4157710022
+布拉西 13.2075304714
+两百余年 12.1089181827
+杨复光 12.8020653633
+恩格尔 12.2912397395
+承担义务 10.3453295905
+重大斗争 11.7034530746
+刻出 11.3357282945
+传为美谈 11.2616203224
+哈迪亚 13.900677652
+整辆 13.900677652
+御膳 10.9562386728
+雅安市 11.7034530746
+奉公守法 12.1089181827
+西魏行 13.2075304714
+先进经验 10.6818018271
+变频 9.84023464143
+反对称性 13.2075304714
+转乘 12.5143832909
+鱼网 10.533381822
+有凭有据 13.900677652
+溶酶体 11.1280889297
+胞质环流 13.900677652
+套丝机 13.900677652
+怎能说 12.1089181827
+文解 13.2075304714
+椭圆形 7.85567233794
+采下来 13.2075304714
+靖江 10.765183436
+立功 8.64318227995
+七百三十卷 13.2075304714
+倘有 9.01787572939
+气压计 11.1926274509
+宝蓝 12.1089181827
+转上 10.8561552143
+转下 12.5143832909
+鱼缸 11.8212361103
+免疫耐受 11.4157710022
+转世 9.45802639549
+卫天侯 13.2075304714
+吹冷风 12.1089181827
+转业 9.96885201925
+非主业 10.8096351986
+婆娑起舞 13.900677652
+浩浩 10.7226238216
+协会理事 10.765183436
+皱纹 8.30596627237
+身长 9.12999302751
+刻写 11.3357282945
+钱银之 13.2075304714
+一手交货 11.3357282945
+随时随地 9.72629038208
+除非 7.32142643997
+九十亩 12.8020653633
+梭镖 10.9049453784
+普济寺 12.5143832909
+转为 7.40692381212
+诸御史 13.2075304714
+家庭主妇 10.533381822
+诸宫调 10.1871055853
+省道 10.1394775363
+只肯 10.9049453784
+颇为费解 13.900677652
+立刻 5.57876968375
+秦氏恭 13.2075304714
+转付 13.900677652
+受托 9.74179456862
+卫弘 12.8020653633
+吸收外资 11.5027823792
+八磅 12.8020653633
+音乐演奏 11.7034530746
+均沾 12.5143832909
+洪都拉斯 9.37888907493
+棺材店 13.900677652
+鱼翅 10.2630914922
+插言 9.74179456862
+低毒 10.642581114
+转任 10.533381822
+体育报 12.8020653633
+犯人 8.48903160012
+只能 5.29327819267
+大变局 12.2912397395
+电力 6.30629640942
+夏曦 12.8020653633
+更名改姓 12.5143832909
+算下来 9.98865464655
+白条子 11.598092559
+鱼群 9.58318953844
+八达岭 10.3171587135
+受戒 10.2897597393
+曾学于 12.8020653633
+除权除息日 11.0103058941
+转些 13.900677652
+伊赫万 13.2075304714
+银装 11.4157710022
+转产 11.598092559
+转交 10.3171587135
+五六道 13.900677652
+刘逢君 13.2075304714
+面层 11.9547675029
+转亮 13.900677652
+赵家沟 12.2912397395
+窜改 12.2912397395
+天安门广场 9.7898037878
+斋戒 9.82314020807
+电动 7.49214886092
+齐射 10.1164880181
+李过见 12.2912397395
+隆兴行 13.2075304714
+沙僧歇 12.2912397395
+母性 10.604840786
+分行业 9.23723855786
+挪威人 10.8096351986
+黑豹党 13.900677652
+低档 10.4041700905
+鱼类 7.09495509856
+拆回 13.900677652
+立冬 11.1926274509
+悬崖 8.48903160012
+氧化钠 12.2912397395
+尤亲倚 13.2075304714
+电光 9.80633308975
+尤世威 12.8020653633
+邮电部 11.9547675029
+大嗓门 11.0103058941
+可编程 11.598092559
+中层干部 11.7034530746
+沙僧正 12.2912397395
+随从人员 11.0103058941
+安西州 13.2075304714
+大盂鼎 11.7034530746
+五言律诗 12.5143832909
+混球 13.2075304714
+齐心 8.48903160012
+许多次 10.0720362555
+奥秘 8.69119149913
+不动产 8.38322475551
+乙巳 12.5143832909
+太阳报 11.2616203224
+长生药 12.8020653633
+呵责 13.900677652
+发挥优势 11.5027823792
+自上到下 13.900677652
+两颗心 11.3357282945
+戴进 11.9547675029
+抽抽 11.9547675029
+爆裂 10.1394775363
+延伸 6.81645122988
+戴过 10.9562386728
+装罐 13.900677652
+桓佥 13.900677652
+装置 6.44249149464
+腾冲县 11.9547675029
+比较价格 13.2075304714
+低栏 13.2075304714
+王答 13.900677652
+慈禧奔 13.900677652
+周文龙 10.3453295905
+算术操作符 12.8020653633
+神出鬼没 10.1394775363
+电视剧 8.34384959028
+御苑 11.4157710022
+停靠在 11.2616203224
+国民政府军事委员会 10.2630914922
+和布克赛尔蒙古自治县 11.8212361103
+饮料水 13.900677652
+庞裘 12.8020653633
+肛肠科 13.900677652
+浦琳 13.900677652
+这针 13.900677652
+逛逛 9.5186510173
+白发人 12.2912397395
+假设敌 13.900677652
+创业园 11.3357282945
+萧知院 13.2075304714
+何宝山 12.8020653633
+咨询员 11.8212361103
+正电极 13.2075304714
+师纂 11.7034530746
+北京出版社 13.2075304714
+来信者 13.900677652
+闻讯 8.98802276624
+班达海 12.2912397395
+国盛 10.8096351986
+抽打 9.48183704418
+明思宗 11.4157710022
+诺特环 13.900677652
+丁虫 12.8020653633
+一万二千五百余吨 13.2075304714
+小玩意儿 11.598092559
+奥神 12.5143832909
+惯家 12.5143832909
+犀甲 13.2075304714
+师级 10.8561552143
+空蒙 12.5143832909
+不良信息 9.5062284973
+瘟神 10.2630914922
+不好不坏 13.900677652
+刻到 12.8020653633
+刻制 10.765183436
+黑玛丽 13.2075304714
+贡多拉 13.900677652
+鱼精 11.2616203224
+北京高校 12.5143832909
+瓦西里耶夫 12.1089181827
+黄泥巴 12.5143832909
+宋江行 12.8020653633
+文言 10.0088573539
+合则两利 12.8020653633
+大天白日 12.1089181827
+一车子 13.2075304714
+刚架 12.1089181827
+州立大学 10.1871055853
+邻家女孩 12.2912397395
+立元 12.8020653633
+刻划 9.71102290995
+说唱文学 11.598092559
+抽成 12.1089181827
+立克 10.3171587135
+吸血 9.72629038208
+隋军分 13.2075304714
+推上去 11.3357282945
+除铁 11.8212361103
+克里夫兰 11.9547675029
+刻刀 12.2912397395
+绯闻 10.1164880181
+递过来 9.61021821083
+公开市场 7.62028181302
+财政投入 9.87532596124
+巅峰 9.49395840471
+鱼粉 10.9049453784
+苏黎士 11.7034530746
+供需矛盾 10.0940151622
+警车 9.58318953844
+文译 12.1089181827
+游客 7.38448457593
+榨取 9.09665660724
+屯溪区 12.5143832909
+受惊 9.19114745066
+马拉迪 13.900677652
+扇区 13.2075304714
+南方大港 13.2075304714
+阳关道 11.9547675029
+文词 10.9562386728
+大头菜 11.4157710022
+翩翩公子 13.900677652
+游宴 11.4157710022
+穿刺 9.40086798165
+钞票 8.6966709649
+文说 9.94943393339
+秋冬之交 13.2075304714
+劳驾 11.3357282945
+除锈 12.5143832909
+受惠 8.9519177616
+尼普科 12.2912397395
+科学化 9.89334446674
+锯口 13.900677652
+李焱 12.2912397395
+闻言 7.75007488353
+徐会沣 13.2075304714
+玻璃柜 13.2075304714
+军事优势 10.9049453784
+面庞 9.85762638414
+人语马嘶 12.8020653633
+黄体素 12.2912397395
+接触性 11.9547675029
+捻转补泻 13.900677652
+输沙能力 13.900677652
+追根 12.2912397395
+三万五千 11.4157710022
+叫屈 10.8096351986
+延中 13.900677652
+甚高频 10.8561552143
+抗电磁 13.900677652
+军事战略 9.72629038208
+朝阳区 10.3743171274
+金钥匙 11.4157710022
+挤满 9.22784881751
+文记 12.5143832909
+职能作用 11.2616203224
+修庙塑 12.5143832909
+立像 11.0674643079
+文论 10.1164880181
+默德 12.5143832909
+头路 13.900677652
+传统型 11.9547675029
+大庭广众 10.1871055853
+布赖恩 11.5027823792
+抽掉 10.4994802703
+齐平 11.7034530746
+面带 9.82314020807
+刻印 9.58318953844
+两亿一千五百五十四万元 13.2075304714
+那姓梁 13.900677652
+堂戏 13.900677652
+儿童座椅 13.2075304714
+横额 11.7034530746
+三相点 12.8020653633
+抽换 13.900677652
+拆船业 13.2075304714
+使节团 11.2616203224
+卓大喜 11.9547675029
+几千斤 11.8212361103
+戈迪 13.2075304714
+游嬉 13.900677652
+面市 10.533381822
+浦甘 13.2075304714
+管显示器 13.2075304714
+悬岩 12.5143832909
+仓颉造 13.2075304714
+累死 9.89334446674
+袁行霈 13.900677652
+立候 12.5143832909
+堂房 13.900677652
+真是太 9.36807815882
+蒙江县 13.2075304714
+查特吉 12.8020653633
+绒帽 13.900677652
+游学 9.87532596124
+科学史 9.98865464655
+朝阳县 12.5143832909
+兴邦 11.8212361103
+代皇帝 10.765183436
+马提尼酒 13.900677652
+面广 10.533381822
+埃里森 13.900677652
+养气 11.0103058941
+三只手 12.8020653633
+累次 10.642581114
+火灾 8.5488195185
+斯特里 11.7034530746
+绒布 10.4349417492
+电视台 7.65457088649
+科察举 12.8020653633
+游子 10.4994802703
+亲哥哥 10.8561552143
+私家园林 12.5143832909
+别情 12.2912397395
+砍伤 10.533381822
+齐出 10.2630914922
+母港 13.2075304714
+调皮捣蛋 11.4157710022
+脚铃 12.8020653633
+二节 13.900677652
+立德 11.0103058941
+佑护 12.1089181827
+抽泣 9.11318590919
+康庄大道 10.9562386728
+手提式 11.2616203224
+安大略湖 10.6818018271
+永明体 11.8212361103
+旅游景点 10.0940151622
+总攻击 11.2616203224
+割下来 10.3453295905
+模拟城市 13.2075304714
+电影 6.65787972918
+康之治 11.8212361103
+头花 12.8020653633
+别想 8.6803218269
+经办 9.80633308975
+洽商 11.1926274509
+立得 11.2616203224
+三起三落 11.9547675029
+许多支 11.8212361103
+刘金贵 11.598092559
+誓死保卫 12.2912397395
+珠宝 8.21709788464
+老弱病残者 12.8020653633
+大合唱 10.4666904475
+分子晶体 12.5143832909
+电视局 12.5143832909
+拆墙 11.7034530746
+沦为 7.78699547214
+反复研究 11.1926274509
+行为表现 11.7034530746
+下位法 13.2075304714
+官传旨 12.5143832909
+汤山一 13.900677652
+叫卖 9.71102290995
+沦丧 10.7226238216
+比表面 11.9547675029
+多处理机系统 11.9547675029
+文武之道 12.5143832909
+信用风险 9.48183704418
+胚芽油 13.2075304714
+以丰补歉 11.9547675029
+汉昭烈 11.9547675029
+氧化钴 13.2075304714
+范宣子 12.5143832909
+酒会 10.6818018271
+学术类 13.900677652
+变应性 11.1926274509
+立志 9.06439574502
+平阴防 13.2075304714
+可开发量 11.5027823792
+师徒关系 12.8020653633
+怀鬼胎 12.8020653633
+电弧 10.2371160058
+脚钱 11.1280889297
+伯父母 13.2075304714
+纠正 7.59622884955
+尔吓 13.900677652
+普洱茶 10.3453295905
+齐兵 12.2912397395
+抽汽 12.5143832909
+瓦尔登 11.9547675029
+连遭挫败 13.2075304714
+肥瘦 11.5027823792
+一息奄奄 13.900677652
+惠爱 13.900677652
+黄墨谷 13.900677652
+齐全 7.76727960898
+自然现象 9.18217878068
+悬厘 13.2075304714
+战兢兢 9.75754292558
+燃烧物 11.9547675029
+鱼狗 12.2912397395
+马负超 13.2075304714
+游吉 13.2075304714
+萍水相逢 11.598092559
+乙卯 12.5143832909
+受潮 10.3171587135
+引为 10.2117981979
+立式 10.0940151622
+周姨娘 11.7034530746
+神话传说 8.96620371885
+游吟 12.2912397395
+游向 10.7226238216
+冀求 12.5143832909
+抽水 9.6811699468
+鲍尔默 12.8020653633
+白居易 9.09665660724
+申请表 11.3357282945
+罐头厂 11.0103058941
+沦亡 11.598092559
+面具 8.77077893705
+文萃 13.2075304714
+自然风 11.598092559
+别怕 9.96885201925
+暂住证 11.7034530746
+惠特 12.5143832909
+观音堂 11.598092559
+抽气 11.0674643079
+桑柘满 13.900677652
+中山装 10.4994802703
+别急 9.49395840471
+别怪 9.87532596124
+洮南县 13.900677652
+面光 13.900677652
+企业会员 12.8020653633
+珠子 9.12999302751
+整数关 9.93038573842
+变长 10.5684731418
+珠孔 11.9547675029
+先我着鞭 13.900677652
+开动机器 12.8020653633
+慈孝 13.900677652
+浓装 13.2075304714
+大而全 12.8020653633
+杀掉 8.81308131674
+违禁者 12.8020653633
+基隆河 12.1089181827
+子面儿 12.8020653633
+节选 12.1089181827
+易威登 12.1089181827
+数去 13.2075304714
+外交事务 9.89334446674
+刻工 11.7034530746
+研修班 12.1089181827
+紧跟形势 13.2075304714
+植桃柳 13.2075304714
+八木 13.900677652
+茜草 10.6818018271
+景山公园 13.2075304714
+电广 10.4994802703
+惠王 10.2371160058
+惠玉 11.1280889297
+文藻 13.2075304714
+来神 13.2075304714
+电平 11.5027823792
+间奏曲 11.7034530746
+招惹是非 11.4157710022
+巴兰水 13.2075304714
+如我所愿 12.8020653633
+遮阳伞 12.1089181827
+额手相庆 13.900677652
+阿美利加 13.900677652
+打定主意 9.93038573842
+帑藏 12.8020653633
+矿上 10.533381822
+戴胜 12.5143832909
+多切斯特 13.2075304714
+焊接机 12.8020653633
+轮生叶 13.900677652
+本能行为 11.7034530746
+肚带 11.0103058941
+挨个 10.1164880181
+硬笔 13.2075304714
+心理化学 13.900677652
+八千七百五十万元 13.2075304714
+悬剑 13.900677652
+经史 9.77354326693
+小羊 10.8561552143
+天然橡胶 9.41204128224
+咨询室 13.2075304714
+奥皇 11.7034530746
+灿烂微笑 13.900677652
+瞄准到 12.8020653633
+酒业 8.88339781516
+民族运动 10.765183436
+朱建华 12.2912397395
+经变 11.598092559
+经受 8.33615724465
+除魔 12.5143832909
+哈哈哈 9.85762638414
+弗里敦 11.7034530746
+宛转 10.3743171274
+思想单纯 12.5143832909
+零点调查公司 13.900677652
+宜昌市 10.642581114
+整数倍 9.18217878068
+心不甘 12.2912397395
+摘帽子 12.5143832909
+宋家庄 13.2075304714
+同化力 13.2075304714
+就餐者 12.8020653633
+酒令 10.9049453784
+怎地 8.20358416547
+奥登 12.5143832909
+面值 7.79365476423
+金盏 12.1089181827
+特尔古 13.900677652
+那集 13.900677652
+老三届 13.900677652
+国统军 13.2075304714
+惜阴 13.2075304714
+脚镯 12.1089181827
+弗里施 11.7034530746
+电建 12.8020653633
+肆口谩骂 13.2075304714
+储蓄机构 13.2075304714
+结婚证 10.0940151622
+酒仙 12.1089181827
+脚镣 10.5684731418
+叫劲 12.5143832909
+头茬 11.5027823792
+柳城县 12.8020653633
+装点 10.4666904475
+广大听众 13.900677652
+花溪洞 13.2075304714
+弗里斯 11.0103058941
+边角废料 13.2075304714
+河洛图 13.900677652
+赵美 13.900677652
+庙堂之上 11.2616203224
+平民愤 11.598092559
+一千多亿颗 13.2075304714
+才学 9.58318953844
+都腾腾 13.2075304714
+王秉诚 12.8020653633
+引上 10.765183436
+药型罩 12.8020653633
+蒙山县 12.8020653633
+十磅 12.5143832909
+一尘不染 10.0505300503
+选举制 11.5027823792
+全象骨 12.8020653633
+酒井 12.1089181827
+胜任愉快 12.2912397395
+宋军分 13.2075304714
+游商 13.900677652
+决议案 10.3453295905
+泥猪癞狗 13.900677652
+寝室 9.71102290995
+才子 9.12155415886
+宝衣 12.2912397395
+电度 13.900677652
+找得着 12.2912397395
+寝宫 8.62767809341
+锲而不舍 10.9049453784
+点金术 13.900677652
+仰卧位 11.7034530746
+楚倾襄 13.2075304714
+赵伟 10.2897597393
+发展前途 10.533381822
+别拗 12.5143832909
+簸弄 13.2075304714
+学习心得 11.7034530746
+瓦尔瓦 13.900677652
+闻名天下 11.598092559
+旨趣 11.0674643079
+满野 13.2075304714
+特米 13.900677652
+佼佼者 9.63799777493
+齐发 9.53122979951
+燃烧热 12.5143832909
+齐叔 12.1089181827
+硬硬 10.8561552143
+师父 6.85839148004
+师爷 9.40086798165
+廉引领 13.900677652
+几百岁 13.900677652
+文蛤 10.642581114
+瘟疫 8.76487921493
+那么点儿 12.8020653633
+江汉平原 9.09665660724
+高风险 7.98447558937
+跨国企业 9.98865464655
+挪作他用 11.7034530746
+受淹 13.2075304714
+马奔西 13.900677652
+惯坏 11.598092559
+锯床 12.2912397395
+游园 10.8096351986
+繁荣景象 11.0103058941
+外乡口音 12.8020653633
+头胎 11.4157710022
+李运 12.2912397395
+刻度 10.1394775363
+不顺遂 13.900677652
+今年春节 10.4994802703
+石屋中 13.2075304714
+瘟病 11.7034530746
+劝化 12.1089181827
+头胀 11.3357282945
+淫荡 10.9562386728
+斯特拉瑟 12.8020653633
+要脸 11.1926274509
+朝阳市 10.9562386728
+骈俪 11.9547675029
+据点 8.29120585679
+和睦家 13.900677652
+许多条 11.3357282945
+多一重 13.2075304714
+绝对额 11.5027823792
+弥撒 10.9562386728
+面叙 13.2075304714
+忡忡 12.8020653633
+胰岛素 8.70772080109
+陈百史 11.5027823792
+现代舞 10.2117981979
+旋毛虫 11.8212361103
+淮安 8.96620371885
+宋军入 12.5143832909
+除颤 11.7034530746
+智仁亲王 13.900677652
+爆炸事件 11.2616203224
+长远利益 10.2371160058
+言非虚 13.2075304714
+肛肠病 13.900677652
+司马颖 12.5143832909
+宋军兵 12.8020653633
+文虎 12.5143832909
+一九四一 13.900677652
+面包 8.20023407859
+平科特 12.8020653633
+三十二条 12.8020653633
+单元体 13.2075304714
+宋军先 13.2075304714
+现正 10.1394775363
+一九四三 13.900677652
+洗来 13.2075304714
+地舒卷 12.8020653633
+别扭 8.82550383674
+化发展 11.0674643079
+变送器 12.8020653633
+面北 12.8020653633
+齐升 9.33632946051
+好孤单 13.900677652
+电工 8.58747167293
+别帅石 13.2075304714
+仙人鞭 13.900677652
+厨房设备 12.8020653633
+狄青夜 13.2075304714
+障碍物 9.20019728618
+练洋操 13.2075304714
+骈体 11.8212361103
+经济波动 9.91169360541
+浅斟低唱 13.900677652
+受洗 10.604840786
+贼风 13.2075304714
+别成 12.5143832909
+航空邮件 13.900677652
+变青 12.2912397395
+国有资产 7.8184587416
+庞蒂 11.8212361103
+诸王兼 12.2912397395
+试运转 12.5143832909
+变革 7.34959731693
+齐化 13.900677652
+齐北 11.9547675029
+开学典礼 12.1089181827
+周晓鸥 13.900677652
+学部委员 10.2117981979
+王介儒 10.765183436
+母法 13.900677652
+伊吾唐 13.2075304714
+秦九韶 11.3357282945
+叫出 10.765183436
+视讯 10.533381822
+跑旱船 12.2912397395
+霍通 13.900677652
+利普尼 13.2075304714
+国统区 10.9562386728
+濑户 11.9547675029
+彭德尔 12.8020653633
+伊吾庐 13.2075304714
+薄荷精 13.900677652
+贫雇农 11.8212361103
+城北区 13.900677652
+翁归 13.2075304714
+慈禧听 13.2075304714
+大词典 10.6818018271
+三大纪律 11.0103058941
+肮脏交易 13.900677652
+李达任 13.900677652
+面饺 13.900677652
+任北路 12.5143832909
+镍合金 11.3357282945
+低效 10.5684731418
+氨基蝶呤 13.900677652
+民粹主义 11.4157710022
+那怕 10.4666904475
+肯綮 13.2075304714
+观音寺 11.1280889297
+霍里 13.900677652
+嫉妒妄想 12.2912397395
+服牛乘马 13.900677652
+赵伯 12.8020653633
+高压政策 11.1926274509
+霍金 12.1089181827
+楼名宝 13.900677652
+脚韵 13.2075304714
+西倾山 11.0674643079
+河漫滩 9.93038573842
+王占军 13.2075304714
+着色法 12.8020653633
+多诺 12.8020653633
+数十盆 13.2075304714
+大司马 9.24671730182
+鲁莽地 13.2075304714
+山地车 12.8020653633
+打算盘 11.2616203224
+法西斯党 11.3357282945
+利布曼 12.5143832909
+水洗机 13.900677652
+叫做 6.5092624173
+悬停 11.2616203224
+二次污染 11.7034530746
+双体船 11.7034530746
+堂堂皇皇 13.2075304714
+大显神通 12.2912397395
+刻得 12.8020653633
+钓大鱼 12.8020653633
+齐力 11.8212361103
+宜昌峡 13.900677652
+邢氏 12.8020653633
+赵传 12.8020653633
+却之不恭 11.598092559
+杭州人 9.24671730182
+睡衣 10.3453295905
+地理知识 10.9049453784
+嗤嗤 10.6818018271
+有嘴无心 13.2075304714
+额林沁 13.2075304714
+拆字 11.8212361103
+说服教育 12.2912397395
+多层次性 13.2075304714
+盐池县 11.598092559
+环以外 13.2075304714
+基隆港 11.0103058941
+民间工艺 11.9547675029
+母液 11.7034530746
+同命运 11.7034530746
+青年队 12.8020653633
+淌出 10.8561552143
+左崇楼 13.2075304714
+性休克 11.4157710022
+骈丽 13.2075304714
+淌凌 13.900677652
+意料之中 9.15574552361
+脚面 10.5684731418
+玉檀能 13.2075304714
+药用价值 10.7226238216
+张留孙 11.4157710022
+变阵 11.0674643079
+一抢而空 11.4157710022
+劬劳之恩 13.900677652
+恩格勒 11.598092559
+毫无忌惮 13.900677652
+累月 12.8020653633
+四两分 13.2075304714
+想像得到 13.900677652
+接触法 12.8020653633
+锯开 11.8212361103
+早岁 12.5143832909
+受气 10.0294766411
+创业家 11.598092559
+才女 10.8561552143
+经典 7.06120121375
+吕二嫂 10.8561552143
+泛起 9.03314320152
+齐列 13.900677652
+三十几年 11.9547675029
+别挤 13.2075304714
+庞薰 12.5143832909
+面前 5.50520021924
+不相容 9.71102290995
+智能家居 13.2075304714
+河柳 13.2075304714
+拉诺尔 13.2075304714
+查耶纳 13.2075304714
+张员外 11.1926274509
+守望相助 13.900677652
+报亭 12.1089181827
+双轴晶体 13.2075304714
+二十四分 13.2075304714
+蓝五叔 11.5027823792
+立宪 9.23723855786
+敬陈管见 13.900677652
+元子乃 13.2075304714
+衣百结 13.900677652
+电子 5.81982123233
+智深笑 13.2075304714
+略高一筹 13.900677652
+李豫 12.8020653633
+姑表 11.7034530746
+欧盟委员会 9.30555780184
+复雠 13.900677652
+面善 10.765183436
+斯多噶 12.5143832909
+力克斯 13.2075304714
+低手 12.2912397395
+脚部 10.8096351986
+勤王 8.78268383956
+重甸甸 13.2075304714
+却静 13.2075304714
+悬在 9.56994431169
+文胸 13.900677652
+乙基 11.0674643079
+抽检 9.07236391467
+西格雷 13.900677652
+立定 9.82314020807
+电学 9.35738286971
+装甲 7.09828288865
+细嚼慢咽 11.2616203224
+乙型 10.4994802703
+华侨城 9.69598503258
+变量 7.25169310195
+变重 13.2075304714
+谨防 9.21854642485
+庞舒 13.2075304714
+潜伏期 9.5062284973
+柔细 11.8212361103
+经国 11.7034530746
+文肃 13.2075304714
+永城县 13.900677652
+报价 7.41147272065
+电视塔 11.0103058941
+电话线 10.5684731418
+南山寺 11.4157710022
+珠心 12.1089181827
+擒拿格斗 13.2075304714
+右下角 11.0103058941
+报仇 8.11378027061
+昂首 9.84023464143
+道学家 11.9547675029
+观音岩 12.8020653633
+一贯性 11.8212361103
+八十二斤 13.2075304714
+担担面 12.8020653633
+尔夫 12.8020653633
+伊吾卢 12.2912397395
+文联 9.96885201925
+悬垂 10.5684731418
+残年 12.1089181827
+瓦尔特 10.765183436
+报丧 10.3743171274
+秦襄公 12.5143832909
+文聘 11.0103058941
+风险意识 9.44633035572
+皱着 10.0088573539
+碗底 11.1280889297
+硬结 10.9562386728
+肆虐横行 13.900677652
+劳里 11.8212361103
+鱼目 10.2371160058
+李巧奴 12.8020653633
+文职 9.36807815882
+花姑娘 11.598092559
+宝贵 7.82533162089
+电导 10.3453295905
+装疯 11.7034530746
+受此 7.81163277653
+鱼盐 11.3357282945
+报上 8.87679713113
+艺术欣赏 11.598092559
+观音山 11.7034530746
+颜希尹 10.765183436
+总代理 11.8212361103
+报业 9.37888907493
+跑过来 8.74738605748
+只要 5.06256105433
+纳拉姆 12.5143832909
+抽样 9.63799777493
+齐唱 11.1280889297
+咨询师 11.598092559
+联合国秘书处 12.5143832909
+装病 10.8561552143
+卑视 13.900677652
+拆封 10.4666904475
+丁谓 12.8020653633
+孕酮 11.1926274509
+任魏博 13.2075304714
+才干 9.19114745066
+鱼皮 11.2616203224
+软硬兼施 11.1926274509
+乐都县 13.2075304714
+瞧不起 8.9308643524
+别搞 12.5143832909
+湖口县 12.5143832909
+奥勒尔 13.2075304714
+多晶体 12.8020653633
+面商 11.9547675029
+资产重组 7.30353195009
+电容 9.36807815882
+丁谧 11.9547675029
+馏分 10.4994802703
+塔塔尔 11.0103058941
+节间 10.0720362555
+变酸 12.2912397395
+元境侵 13.2075304714
+御街 11.0103058941
+魏武王 13.900677652
+谭入朝 13.2075304714
+受款 12.1089181827
+沙门氏菌 11.4157710022
+乡友 13.2075304714
+硬纸 11.598092559
+性功能 9.07236391467
+师生 9.22784881751
+宪兵 9.4233408375
+织毛衣 11.5027823792
+腰背痛 12.1089181827
+码元 13.2075304714
+臭名昭彰 13.900677652
+住房 6.59347533721
+齐哥 12.5143832909
+住户 8.93783302172
+番邦 11.7034530746
+特提斯 10.4349417492
+垃圾处理 10.4666904475
+初始段 13.2075304714
+别无 10.3453295905
+慈禧刚 13.900677652
+托尔金 13.2075304714
+入口税 13.2075304714
+原西来 12.5143832909
+游军 13.2075304714
+纵情歌唱 13.900677652
+文臣 8.57766767284
+瞄准器 11.8212361103
+闻者 11.2616203224
+从下到上 12.5143832909
+范剑平 10.5684731418
+然后背 13.2075304714
+坯子 10.7226238216
+后西征 12.8020653633
+寿烛影 13.2075304714
+劳通 13.900677652
+凝聚性 13.2075304714
+退职金 13.900677652
+阴荐西 13.2075304714
+效果器 13.900677652
+鱼眼 11.2616203224
+报信 9.13850371718
+付悠然 13.900677652
+乌云压顶 12.2912397395
+游出 11.4157710022
+游击 8.59737274392
+史大夫 13.900677652
+首都钢铁公司 12.1089181827
+刘鸿生 12.8020653633
+任汉阳 12.5143832909
+利益集团 9.5186510173
+农学会 12.8020653633
+均摊 11.0103058941
+大年初一 9.77354326693
+安于现状 12.8020653633
+技术职称 13.900677652
+劳逸 11.598092559
+关云长 10.1164880181
+凝聚态 10.9049453784
+支楞楞 13.2075304714
+御览 9.87532596124
+科学奖 10.604840786
+陋规 13.2075304714
+朴利茅 11.9547675029
+住所 8.98802276624
+父母之邦 12.5143832909
+沉沉的 9.89334446674
+轰传 13.2075304714
+忠肝义胆 11.8212361103
+七十四卷 13.2075304714
+提头 11.9547675029
+罗诺沃 12.1089181827
+师略 13.900677652
+王麟 10.8561552143
+齐呼 11.2616203224
+变通 9.74179456862
+装璜 12.8020653633
+奥特 10.4666904475
+变速 9.98865464655
+内体壁 13.2075304714
+裙裾 11.0103058941
+保密工作 12.1089181827
+悔之已晚 12.5143832909
+计划经济 9.34680076038
+十番锣鼓 13.900677652
+叫嚣 9.93038573842
+基膜 12.2912397395
+攻坚克难 13.2075304714
+数层 10.7226238216
+经济渗透 12.2912397395
+变造 11.1926274509
+绵软 10.1871055853
+封周公 12.1089181827
+宁远 8.82550383674
+锯好 12.5143832909
+北京大学经济系 13.2075304714
+组合音响 12.2912397395
+面向 7.51548325298
+克里奥尔 10.604840786
+二十一万八千两 13.900677652
+通灵之 12.5143832909
+珠帘 9.85762638414
+吨粮县 13.2075304714
+举重 10.3453295905
+李公佐 12.2912397395
+试运行 9.5186510173
+引作 13.900677652
+吊膀子 12.8020653633
+吴宝康 13.2075304714
+中山路 11.1926274509
+刚果人 11.4157710022
+大年初二 11.9547675029
+数千口 12.8020653633
+李谦 12.5143832909
+漫天开价 13.900677652
+文脉 13.900677652
+游兵 11.7034530746
+阳湖派 12.5143832909
+报低 13.900677652
+交换量 12.1089181827
+霍霍 11.4157710022
+齐君 11.598092559
+贵族气 13.2075304714
+面呈 11.0103058941
+装货单 13.900677652
+民国 7.78038023302
+侯公子 13.2075304714
+民族区域 10.533381822
+倜傥 11.3357282945
+宝象 12.5143832909
+别收 13.2075304714
+熊岳河 12.5143832909
+崔维 13.2075304714
+装瓶 11.1926274509
+疲塌 12.8020653633
+魏律序 13.2075304714
+齐名 8.89004235788
+退一 12.5143832909
+母校 10.7226238216
+文苑 10.533381822
+低息 10.0294766411
+退上 13.2075304714
+退下 8.9519177616
+爆肚 13.900677652
+辛烷值 12.2912397395
+究问 11.7034530746
+母株 11.8212361103
+贡布山 13.900677652
+绰约多姿 12.2912397395
+定量分析 9.54396882529
+母核 11.9547675029
+承担费用 12.8020653633
+漫记 12.5143832909
+牧老可 12.5143832909
+无以复加 11.3357282945
+超外差式 13.2075304714
+惯匪 12.1089181827
+丰鸿门 13.2075304714
+叫唤 9.00283785202
+布拉莫 13.900677652
+马瑶草 9.17328983326
+拆建 13.900677652
+赵侯 13.900677652
+绿水青山 13.2075304714
+面型 11.7034530746
+马里亚纳 10.642581114
+纪可观 12.5143832909
+母树 11.4157710022
+想想看 9.69598503258
+退为 12.8020653633
+马步军 9.80633308975
+齐城 11.5027823792
+燃烧瓶 11.0103058941
+想当初 10.2897597393
+骨骼肌 10.2897597393
+观音庙 12.2912397395
+上了贼船 13.900677652
+宪制 13.2075304714
+装着 8.36728816325
+空字符 12.8020653633
+合众 9.94943393339
+电复 12.5143832909
+均权 13.900677652
+道孚县 13.900677652
+可扩充性 12.5143832909
+礼仪 7.8604229407
+米海尔 13.2075304714
+结扎手术 13.2075304714
+克伦河 13.900677652
+滦南 12.5143832909
+文富 11.7034530746
+榜眼 11.1926274509
+毫无保留 10.4666904475
+排水系统 10.7226238216
+游勇 12.5143832909
+阴潜阳 12.1089181827
+武不善作 13.2075304714
+托木尔 12.2912397395
+伊吾军 12.5143832909
+电大 11.7034530746
+叫啸 12.5143832909
+中国科学院心理研究所 12.2912397395
+元祺祥 12.8020653633
+只许 9.48183704418
+叫喊 8.57766767284
+慈禧冲 13.900677652
+变着法 11.0103058941
+滦县 10.765183436
+远古时代 10.2897597393
+危地马拉城 13.900677652
+游到 10.1630080337
+初莲花 11.4157710022
+惠理 12.1089181827
+经合 11.8212361103
+反对者 9.94943393339
+欢欣 10.2371160058
+立夏 10.1164880181
+文艺 7.86280673205
+冲下去 11.7034530746
+退亲 12.1089181827
+一百二十年 12.5143832909
+突变性 12.8020653633
+大声吼叫 11.5027823792
+脱颖而出 8.9308643524
+克瓦希涅夫斯基 13.900677652
+唾骂 10.2117981979
+细量 13.900677652
+门源回族自治县 12.1089181827
+信息处理系统 11.2616203224
+只读 10.3171587135
+部队长 12.2912397395
+劈头盖脸 9.96885201925
+鲜花丛 13.900677652
+据理 11.5027823792
+太叔 13.900677652
+癸亥年 13.900677652
+真是假 9.32596667347
+俾路支 10.8096351986
+巴特尔斯 13.2075304714
+阿扎尔 13.2075304714
+克罗泽 13.900677652
+见得着 11.9547675029
+退付 13.2075304714
+立好 12.8020653633
+距今已有 10.3743171274
+劈头盖脑 11.7034530746
+姑表兄弟 12.1089181827
+由此证明 12.8020653633
+冉兴让 11.2616203224
+东观西望 12.8020653633
+高挑儿 13.900677652
+百尺竿头更进一步 12.8020653633
+别是 10.4666904475
+师直 12.8020653633
+买空 12.5143832909
+立契 11.4157710022
+国家人事部 13.2075304714
+中央音乐学院附中 12.8020653633
+奸恶 11.598092559
+礼义 10.4041700905
+北卡罗莱纳州 12.8020653633
+受检 12.2912397395
+子孙满堂 13.2075304714
+陈新甲 8.85082164473
+张政委 13.900677652
+城市居民 9.02548032877
+悬吊 10.1871055853
+俄语 9.29550746599
+叫名 13.900677652
+退伍 10.2371160058
+游去 11.0103058941
+退休 7.67414098269
+孙夫人 10.8096351986
+三十五万六千余两 13.2075304714
+退伙 12.2912397395
+企业法 11.0674643079
+洗面器 13.900677652
+福临门 10.1394775363
+货郎鼓 12.1089181827
+猪八戒照镜子 12.5143832909
+观望台 13.2075304714
+景阳钟 13.2075304714
+腿折 13.900677652
+游历 8.71889410168
+季孙 11.9547675029
+怕吃苦 11.598092559
+桑书手 13.2075304714
+只言 11.9547675029
+退佃 11.8212361103
+便宜行事 10.9049453784
+谢安之 13.2075304714
+面团 10.4349417492
+向荣禄 12.8020653633
+退位 9.19114745066
+珠峰 11.0674643079
+三公九卿 11.8212361103
+别林 12.8020653633
+扎西德勒 13.900677652
+科学学 12.2912397395
+小点声 12.8020653633
+弹尽粮绝 10.765183436
+别枝 13.2075304714
+子赵煦 13.2075304714
+礼俗 10.4994802703
+慈禧停 13.2075304714
+必然 5.96366016246
+文莱 10.0720362555
+螨虫 12.8020653633
+鱼生 12.8020653633
+宛西 13.900677652
+册立 10.2371160058
+挨上去 13.900677652
+百十辆 13.2075304714
+区域分异 11.5027823792
+史可夫 13.900677652
+赵祖康 12.8020653633
+公款吃喝 11.7034530746
+六百册 13.2075304714
+手术台上 11.5027823792
+科研院所 10.4666904475
+犯不着 10.2630914922
+张二奎 12.2912397395
+科学家 6.72902082921
+罗米芬 12.8020653633
+受案 11.5027823792
+一奶同胞 13.900677652
+游医 11.9547675029
+科学宫 12.8020653633
+孙舍之 13.2075304714
+二百八十二节 13.2075304714
+哈利法 12.8020653633
+麻糖 11.8212361103
+帷幄 11.1926274509
+刻字 10.3453295905
+合作 5.50972818713
+硬底化 13.900677652
+往来账户 12.5143832909
+电壶 13.2075304714
+先进村 12.5143832909
+电声 10.765183436
+祈年 12.5143832909
+玉笑 13.900677652
+帷幕 8.87679713113
+帷幔 11.7034530746
+乐山乐水 13.900677652
+总危机 12.5143832909
+震天响 11.4157710022
+惠生 12.1089181827
+自上而下 8.92394390956
+住惯 11.3357282945
+大孤山 11.8212361103
+宗九族 13.2075304714
+夏后启 13.2075304714
+借款 7.99804431857
+烧去 12.2912397395
+别有 9.40086798165
+指压法 12.2912397395
+饰面 12.2912397395
+叫响 11.2616203224
+东流纳 13.2075304714
+拆开 8.76487921493
+落地扇 13.900677652
+王家彦 10.8096351986
+珠山 12.2912397395
+装盘 12.1089181827
+巴列维 10.642581114
+首一座 13.2075304714
+茎干 11.0674643079
+退保 10.4666904475
+送下去 12.8020653633
+同谋犯 13.2075304714
+方各庄 13.2075304714
+发音器官 12.2912397395
+接触传染 11.8212361103
+经商 8.1902506346
+研修生 12.5143832909
+批判者 12.1089181827
+礼佛 9.75754292558
+贝纳尔 13.900677652
+传统式 11.5027823792
+阴差阳错 10.5684731418
+古典型 13.2075304714
+谢安任 12.5143832909
+引起反响 12.2912397395
+帷帐 12.1089181827
+云山白 13.2075304714
+背光源 10.9049453784
+账上 10.2897597393
+按道理说 12.1089181827
+国为君 13.900677652
+巴纳贝 13.900677652
+塞尔蒂 13.900677652
+起计 13.900677652
+王药木 13.2075304714
+脚指头 12.1089181827
+第二 5.54224575294
+纸带 11.5027823792
+独善其身 10.1394775363
+机匣 10.533381822
+冷敷 11.7034530746
+第五 7.35964765279
+煤场 10.6818018271
+马尔瓦 11.7034530746
+归敬 13.900677652
+数百帐 13.2075304714
+应交 11.5027823792
+靖港 12.1089181827
+脾性 9.71102290995
+酸乳 13.900677652
+玉关金 13.2075304714
+战衣 12.5143832909
+鸡骨草 12.5143832909
+胡经甫 13.2075304714
+猪苓 11.598092559
+应于 10.2117981979
+乍暖 13.900677652
+应予 9.7898037878
+广大无边 13.2075304714
+机化 12.2912397395
+分中心 11.598092559
+过丹根 13.2075304714
+天生尤物 12.2912397395
+福建厦门 10.9562386728
+应价 11.4157710022
+张克俭 12.2912397395
+和平主义 11.1926274509
+农军 11.0674643079
+服务队 10.765183436
+慎子 12.5143832909
+剑法 11.2616203224
+应以 8.37124856446
+急驰 10.5684731418
+行馆 10.1394775363
+当晚 8.01735526349
+拓开 12.5143832909
+诘问 10.9049453784
+后备 8.68574189437
+应付 7.32839510928
+自愿性 11.1926274509
+阿林 12.1089181827
+十七路 13.2075304714
+起诉 8.00903344015
+沙头 11.598092559
+应从 9.15574552361
+恒言 11.1926274509
+二十年代 11.5027823792
+高云峰 13.900677652
+煤块 11.1926274509
+数百年 9.00283785202
+公费 10.533381822
+可燃物 12.2912397395
+世界冠军 9.82314020807
+百业兴旺 13.2075304714
+二百七十年 11.8212361103
+应为 8.4801426527
+第七 8.26232298264
+第一 5.17273742958
+周幽王 10.7226238216
+急骤 9.84023464143
+成都军区 10.9049453784
+朱利诺 13.2075304714
+聚碳酸 13.900677652
+审批同意 11.4157710022
+格罗查 12.8020653633
+蔽日 10.4994802703
+茅塞 11.9547675029
+晶轴 12.8020653633
+要言不烦 13.2075304714
+密商 9.69598503258
+脚法 12.5143832909
+压迫者 10.8096351986
+菊豆 12.8020653633
+稿源 13.900677652
+兽骨 10.2897597393
+抱住 7.52565283215
+槐角 13.900677652
+农具 8.61747392324
+喝令 9.29550746599
+家属宿舍 13.2075304714
+公路 6.00226655916
+苏双碧 13.2075304714
+数百座 11.3357282945
+国脚 11.0103058941
+卫生部 8.32094782599
+冻胀 11.5027823792
+园田 10.8096351986
+协同动作 10.8096351986
+编者按 9.18217878068
+国脉 11.5027823792
+衣帽鞋袜 13.900677652
+福音书 11.3357282945
+者阴山 13.900677652
+白云庵 11.5027823792
+弓和弩 13.2075304714
+吉尔吉斯 10.2897597393
+阿朵 13.900677652
+第三 5.98350566313
+奇偶性 13.2075304714
+阿术 11.8212361103
+舱内 9.29550746599
+阿木 12.2912397395
+说来话长 11.0674643079
+第九 8.52078029844
+郭永怀 11.9547675029
+卫若兰 13.2075304714
+事无大小 12.2912397395
+煤城 11.5027823792
+不知去向 9.32596667347
+刘焉令 13.2075304714
+天祝藏族自治县 12.1089181827
+土壤冻结 13.2075304714
+挑错 12.5143832909
+内贾德 11.1926274509
+神灵 8.33999602096
+董渡江 10.1871055853
+数以千计 9.91169360541
+黑龙江日报 13.2075304714
+神火 10.0940151622
+北京中国国际展览中心 12.8020653633
+安全梯 13.900677652
+锯木业 13.2075304714
+神灯 11.7034530746
+天捷星 13.2075304714
+冻肉 11.9547675029
+萨里郡 11.598092559
+当机 13.900677652
+口门 10.765183436
+两国间 10.4666904475
+兼顾 8.42003872863
+纸张 8.77077893705
+兼项 13.900677652
+咸阳市 10.3171587135
+应侯 12.8020653633
+秘府 12.2912397395
+菌痢 11.598092559
+机制 6.018362733
+兰时齐 13.2075304714
+李元正 13.900677652
+批复 8.0484751722
+游乐城 13.2075304714
+当朝 9.38981814546
+遭逢 10.2630914922
+行风 11.5027823792
+数百张 12.2912397395
+气喘病 12.2912397395
+采炼 11.1280889297
+阻燃 10.8096351986
+繁峙县 11.8212361103
+当月 7.87239913175
+起誓 10.4349417492
+自下而上 8.70772080109
+鹿科鹿 13.2075304714
+另有 6.72978917346
+扎德 10.9562386728
+粘结性 11.5027823792
+伯恩斯 13.900677652
+巴尔多 12.5143832909
+遭遇 6.48309724956
+拼命 7.54630761118
+陪读 13.2075304714
+国能 11.4157710022
+夜夜 9.69598503258
+刘贵妃 12.2912397395
+公谊 12.5143832909
+荒怠 13.900677652
+沙罗铁 13.2075304714
+取字 12.8020653633
+信纸信封 13.2075304714
+摇起 11.8212361103
+陪话 10.2897597393
+六车 12.8020653633
+垦殖 9.14708746087
+黑粉病 12.1089181827
+国胜 13.2075304714
+六轮 13.2075304714
+快骑 13.900677652
+重峦叠嶂 11.9547675029
+大连旅游 13.2075304714
+夜大 12.8020653633
+柳潭里 13.900677652
+冰上运动 12.2912397395
+六载 11.0674643079
+起步区 11.3357282945
+交出去 10.8561552143
+参商之虞 13.900677652
+街亭 10.8096351986
+怡红 11.8212361103
+机动 7.60910851242
+虚伪 8.80081122415
+副处 12.2912397395
+机务 10.0940151622
+国耻 11.4157710022
+阿普 11.8212361103
+思文 12.8020653633
+害眼 12.8020653633
+六辑 13.2075304714
+伊里安查亚 12.8020653633
+密告 10.8096351986
+王晓明 12.8020653633
+烧成灰 11.1926274509
+加利福尼亚 9.12155415886
+取宠 11.8212361103
+摩托罗拉公司 12.8020653633
+治国者 13.2075304714
+应会 10.8561552143
+血管病 11.4157710022
+佃客 10.0294766411
+侍郎 7.88208443748
+口镇 12.2912397395
+施托 12.8020653633
+适用性 10.1630080337
+国者 11.3357282945
+精母细胞 12.2912397395
+猪草 12.1089181827
+出版商 10.2117981979
+嫌好道歉 13.900677652
+八十余口 13.900677652
+核物理学家 13.900677652
+喝上 10.2630914922
+六边 13.2075304714
+擦下去 13.900677652
+巴托克 11.3357282945
+救起 10.1394775363
+熟苗 11.7034530746
+谏官 11.2616203224
+郑佳明 13.900677652
+羊角 9.93038573842
+囊谦县 13.900677652
+柏拉图 9.07236391467
+北校区 13.900677652
+密合 11.0674643079
+金玉奴 13.900677652
+抱下 13.2075304714
+六连 10.2630914922
+相互之间 9.32596667347
+国联 9.45802639549
+应作 10.4041700905
+相提并论 9.09665660724
+盐田港 12.2912397395
+阿明 10.9049453784
+思旧 12.1089181827
+阿昌 10.8096351986
+河曲 9.77354326693
+多半年 11.4157710022
+卫王子 13.2075304714
+救赎 10.4349417492
+白云山 8.68574189437
+伯服均 12.8020653633
+阿旺 12.5143832909
+数百封 13.900677652
+戴秉 13.900677652
+处于下风 11.7034530746
+阿拉善左旗 11.2616203224
+扈从 9.66657114738
+黑笔 13.2075304714
+峻急 12.8020653633
+前半夜 11.4157710022
+牧博罗 13.2075304714
+思明 11.598092559
+科技委 12.8020653633
+万立方米 8.2273543848
+公车 9.72629038208
+冲抵 10.8096351986
+刺透 12.8020653633
+典籍 8.59737274392
+明闪闪 13.900677652
+公转 9.29550746599
+收紧 6.7468438504
+前半天 13.900677652
+冷杉 9.08039608637
+思春 13.2075304714
+六谷 12.8020653633
+某某某 11.5027823792
+操令卜 13.2075304714
+封面女郎 12.8020653633
+强国富民 12.5143832909
+吵过 10.8096351986
+沟渠 9.36807815882
+文武官 10.6818018271
+血管瘤 10.8096351986
+摩洛哥 8.52078029844
+数年如一 13.900677652
+师范生 13.900677652
+阿斯 10.0505300503
+忌嘴 12.8020653633
+毕达库 12.8020653633
+急须 11.7034530746
+黄家强 13.900677652
+十杯 13.2075304714
+青城山 10.533381822
+机具 10.4349417492
+猪肠 12.8020653633
+冷机 11.3357282945
+拉下马 11.0103058941
+艾官 12.8020653633
+猪肝 10.4994802703
+伊尔库茨克 10.9562386728
+机先 13.900677652
+猪肚 11.598092559
+涩滞 12.8020653633
+团伙化 13.900677652
+狗皮 11.598092559
+破家荡产 13.2075304714
+手足情深 13.900677652
+定时装置 12.5143832909
+无能者 12.8020653633
+冷月 9.55687223012
+性气体 11.5027823792
+猪肉 8.18364995057
+二百七十岁 12.8020653633
+采珠 10.0505300503
+阿文 12.2912397395
+全体干警 13.900677652
+长阳土家族自治县 11.4157710022
+鸳梦 11.598092559
+陈宫来 13.2075304714
+文化名城 9.04086524761
+白云峰 11.4157710022
+凑足 10.765183436
+王领兵 12.2912397395
+冯跋 11.5027823792
+律师所 13.900677652
+数百岁 13.2075304714
+地下害虫 11.4157710022
+立窝尼 11.9547675029
+外经部 13.900677652
+塔波乔 13.2075304714
+毡毯 11.7034530746
+庞柔亦 13.2075304714
+圣约翰市 13.900677652
+翻译人员 11.7034530746
+姜维恐 13.2075304714
+干扰器 11.8212361103
+农协 10.0088573539
+黄淮海平原 10.0294766411
+经济趋势 11.7034530746
+姑妄言之 13.900677652
+蚕食 9.59661255877
+拉克齐 13.2075304714
+仓猝 9.98865464655
+一百三十个 13.900677652
+艾子 13.900677652
+机内 9.93038573842
+温侯吕 12.5143832909
+神父 8.88339781516
+阿敏 12.8020653633
+舱口 10.4041700905
+卖苦力 12.5143832909
+几百万两 11.7034530746
+盖尔特 13.2075304714
+几百万个 12.8020653633
+建材厂 13.900677652
+摇身 10.8096351986
+招僧榜 13.2075304714
+农化 12.5143832909
+郭台铭 11.3357282945
+格罗斯 9.71102290995
+十分困难 9.37888907493
+床位数 13.900677652
+秀美 9.71102290995
+冷枪 11.1926274509
+萨镇冰 12.2912397395
+哈夫曼 13.2075304714
+陪衬 10.7226238216
+林泉兄 11.7034530746
+古董铺 13.900677652
+公输 12.1089181827
+白云岩 9.54396882529
+国药 9.63799777493
+蔚成 12.8020653633
+犯规者 13.900677652
+贾琏贾 13.900677652
+扁形 11.5027823792
+病夫 11.7034530746
+道菜 10.6818018271
+卡拉尔 12.2912397395
+取士 9.93038573842
+农区 9.49395840471
+罗玲 12.8020653633
+困难性 12.1089181827
+神物 10.642581114
+汴京 9.5186510173
+急飞 13.2075304714
+拿不起来 12.8020653633
+需氧量 11.0674643079
+十七载 12.2912397395
+郑郎 13.2075304714
+舍入 12.2912397395
+当政 9.18217878068
+巨马 13.900677652
+另收 13.900677652
+万钧之力 12.8020653633
+成年组 13.2075304714
+田黄石 11.7034530746
+政协会议 10.8096351986
+一百五十年 11.7034530746
+笛手 13.900677652
+兰狄尼 13.2075304714
+施惠 12.8020653633
+副官 8.11378027061
+汉中盆地 10.3743171274
+乐调 11.5027823792
+冲掉 10.642581114
+潜水艇 10.4349417492
+尚能 9.36807815882
+万袋 12.5143832909
+克承家 12.5143832909
+金玉宝 12.8020653633
+暗无天日 10.8096351986
+诘难 11.3357282945
+史蒂芬 10.6818018271
+宇文宪 12.1089181827
+鸟粪 10.4994802703
+本强基 13.900677652
+国英 12.8020653633
+征象 9.93038573842
+农办 11.8212361103
+屏边苗族自治县 12.8020653633
+李春香 13.2075304714
+生态旅游 10.8096351986
+太仆寺 10.1871055853
+勇毅 11.1926274509
+于松山 12.1089181827
+国家化 12.1089181827
+诗言志 11.9547675029
+五行八作 12.8020653633
+南京大学中文系 12.8020653633
+织造布 11.9547675029
+刺配 10.9049453784
+陆将军 12.8020653633
+和亲政策 11.8212361103
+斯德哥尔摩市 13.900677652
+石湾窑 13.2075304714
+斡旋 9.77354326693
+于沣河 12.8020653633
+达列夫 12.5143832909
+思来 13.900677652
+行骗 11.1926274509
+六起 13.900677652
+明君圣 13.900677652
+脆亮 12.8020653633
+阿尔塔米拉 11.8212361103
+农务 12.2912397395
+七十三万两 13.2075304714
+开门机 13.900677652
+孙辈 11.0103058941
+猪腰 12.5143832909
+战评 12.8020653633
+行驶 7.13794814504
+一院制 9.62401153296
+劳动课 13.900677652
+熟肉 11.4157710022
+一路则 13.2075304714
+系统分类 11.1926274509
+施恩 9.30555780184
+石如意 13.900677652
+国航 7.37125881371
+锐意改革 10.6818018271
+纽子 13.900677652
+四川人 11.1926274509
+第五篇 11.598092559
+鲁齐齐 13.2075304714
+王老师 11.4157710022
+录成 13.900677652
+锡箔 11.598092559
+适用房 8.78868986362
+吨重 10.533381822
+农副 11.3357282945
+高皇 13.2075304714
+扁帽 13.900677652
+阎家寨 13.2075304714
+善莫大焉 13.900677652
+威震 9.96885201925
+国色 11.8212361103
+当牛马 12.5143832909
+丝瓜 10.4994802703
+典型群 12.8020653633
+纸工 13.900677652
+纸巾 10.2371160058
+吕维棋 10.6818018271
+艾娣 12.8020653633
+清刷 11.8212361103
+当日 6.37503767693
+排斥力 11.5027823792
+夜宴 10.3743171274
+夜宵 10.7226238216
+楚器 12.8020653633
+战讯 13.2075304714
+生活空间 11.5027823792
+夜宿 10.4666904475
+六路 10.8561552143
+打硬仗 11.5027823792
+文宝 13.900677652
+猪脑 12.5143832909
+巴托卡 13.2075304714
+清到 12.5143832909
+中法关系 13.2075304714
+冷暖 9.46986085313
+扁平 8.25170341381
+战记 12.2912397395
+狗眼 11.8212361103
+郑重 8.33999602096
+剿杀 10.3743171274
+德特著 13.900677652
+天主 10.3743171274
+口部 10.765183436
+相对运动 9.53122979951
+惊喜万分 11.7034530746
+思思 11.8212361103
+中西区 13.2075304714
+又快又好 11.7034530746
+不好战 13.900677652
+一气呵成 10.2630914922
+凡德性 13.900677652
+白胡椒 12.2912397395
+煤区 11.9547675029
+机场 7.04949272448
+楚军 9.7898037878
+商量对策 11.4157710022
+阳胆经 11.4157710022
+暴跳如雷 10.1871055853
+另成 12.2912397395
+天业 10.8561552143
+剪力 12.2912397395
+缩微胶卷 11.8212361103
+照相纸 13.2075304714
+战象 12.2912397395
+米仓山 11.2616203224
+密函 13.900677652
+秘室 12.2912397395
+阿提 11.1280889297
+横加指责 13.2075304714
+天上 7.12645376562
+湾里 11.4157710022
+适用於 12.1089181827
+煤化 10.4666904475
+天一 9.5186510173
+加以改进 10.3743171274
+十三载 11.598092559
+信札 10.8096351986
+文定 12.5143832909
+宣宗曾 12.8020653633
+敲骨剥髓 13.900677652
+荒政 12.8020653633
+秘密 6.40070111102
+两千多间 13.900677652
+尺蠖蛾 13.900677652
+子菜科 12.8020653633
+无业游民 11.598092559
+怀帝 12.1089181827
+备下 10.3171587135
+始能 11.1280889297
+天书 9.13850371718
+雾笛 13.900677652
+天九 13.900677652
+垂着头 9.80633308975
+那不勒斯 9.35738286971
+冷意 11.5027823792
+天乐 11.9547675029
+苦乐观 13.900677652
+藓苔 12.8020653633
+纸婚 13.900677652
+地产税 13.900677652
+小白鼠 11.5027823792
+起运 10.8096351986
+冷感 12.5143832909
+上辈 12.5143832909
+空落 11.9547675029
+思恩 12.5143832909
+熏蒸剂 11.9547675029
+沈玉英 9.75754292558
+天人 9.32596667347
+荒旱 11.8212361103
+茅屋 8.59240995457
+柳侯祠 12.5143832909
+附属小学 11.9547675029
+典章 10.0088573539
+王尊三 12.8020653633
+剪到 13.2075304714
+伊万年科 13.2075304714
+科特勒 12.5143832909
+农商 11.2616203224
+拉瓦尔品第 11.2616203224
+天京 9.91169360541
+面向对象编程 13.2075304714
+天亮 7.50374799676
+绝招儿 12.2912397395
+酒囊饭袋 12.1089181827
+吃糖 11.0103058941
+评定职称 13.900677652
+揭阳县 12.1089181827
+备件 10.6818018271
+悍勇 11.0674643079
+王振华 13.900677652
+训饬 11.7034530746
+备份 10.0088573539
+天井 8.75901409547
+始而 11.4157710022
+量计算 12.5143832909
+嫩嫩的 11.0674643079
+仙山楼阁 13.2075304714
+滚沸 11.7034530746
+很窄 10.0088573539
+奥康纳 12.2912397395
+咸阳宫 11.8212361103
+剪切 9.69598503258
+茅山 10.0505300503
+艾德蒙 13.2075304714
+采用 5.15380233241
+阎家岗 12.8020653633
+伊福玻 13.900677652
+那伊修 13.2075304714
+通用电气 10.9049453784
+楚克 12.1089181827
+语义 9.65218240993
+思惟 11.9547675029
+论道经邦 13.2075304714
+自动档 11.4157710022
+天价 8.84443184663
+药方子 13.2075304714
+惠特尼山 12.8020653633
+杀人 7.51211624643
+汤姆森 10.9049453784
+煮开 11.4157710022
+剪剪 12.5143832909
+曹景宗 12.8020653633
+邓锡侯 12.2912397395
+施术 11.7034530746
+向豫湘 13.900677652
+王老好 11.3357282945
+天仙 9.87532596124
+施朔 13.2075304714
+早市 9.54396882529
+闷闷不乐 9.96885201925
+拨浪鼓 11.0674643079
+血管炎 10.9049453784
+美国芝加哥大学 10.8561552143
+硬骨头 10.533381822
+卫媪 12.8020653633
+脸可 13.2075304714
+楚兵 11.8212361103
+忠实观众 13.2075304714
+威逼 9.74179456862
+取开 13.900677652
+郁茂 13.2075304714
+虚胖 12.1089181827
+造山运动 9.80633308975
+剪去 11.1926274509
+公行 10.765183436
+一万余顷 13.2075304714
+响当当 10.604840786
+护唇膏 13.900677652
+钩状 10.604840786
+录播 13.2075304714
+抹胸 11.7034530746
+西越兴 13.900677652
+矢量积 13.900677652
+热镀锌 10.604840786
+宗绍兴 13.900677652
+荧火 12.5143832909
+天伦 9.93038573842
+鼓励类 12.1089181827
+天会 10.4349417492
+低硫煤 13.900677652
+赵岐注 13.2075304714
+口里 7.82074445688
+船艄 12.8020653633
+船艇 11.7034530746
+刘如仲 12.5143832909
+雨纷飞 13.900677652
+陶瓷封装 13.900677652
+解厄 12.8020653633
+简短扼要 13.900677652
+烟灰色 12.8020653633
+保守思想 11.7034530746
+冲断 10.9562386728
+辐辏 11.4157710022
+思慕 11.3357282945
+施暴 11.4157710022
+伺服器 12.1089181827
+一路响 12.2912397395
+机器 6.64156152388
+天使 8.50251495046
+金镯子 11.9547675029
+始自 9.46986085313
+孤对电子 11.598092559
+狗熊 10.4041700905
+石龙子 12.1089181827
+悦己者 11.2616203224
+天气现象 10.642581114
+二百四十个 12.8020653633
+下回分解 8.18036587537
+阿里地区 10.2897597393
+船舱 8.62256299275
+船舰 10.4994802703
+自尊心 9.20019728618
+南华县 13.900677652
+另据 8.4801426527
+赞助者 12.5143832909
+支独秀 13.900677652
+择优 10.5684731418
+山海士 13.900677652
+匆匆一看 12.8020653633
+屡试不第 11.598092559
+尽善尽美 11.0674643079
+畏难 11.9547675029
+天佑 10.2371160058
+择伐 13.2075304714
+天体 7.76727960898
+吃素 9.84023464143
+吃紧 8.83177344976
+驮运 10.0294766411
+六十四岁 12.1089181827
+艾里坎 13.2075304714
+前半年 11.0674643079
+思慧 12.1089181827
+战费 12.2912397395
+杨铁崖 13.2075304714
+擒王 13.900677652
+扁壶 13.900677652
+白背飞虱 13.2075304714
+綦江县 12.5143832909
+南布格河 13.2075304714
+纸孔 13.2075304714
+幸福生活 9.93038573842
+那巨虫 12.1089181827
+亚斯坦 12.8020653633
+捧茶 11.9547675029
+石器时代 10.1394775363
+司马炎谋 12.8020653633
+白云寺 11.8212361103
+斯麦式 13.900677652
+国营 8.6803218269
+拍卖师 12.2912397395
+钩爪 11.5027823792
+拉塞龙 13.2075304714
+取得 5.30763514828
+圈闭容积 13.900677652
+埃塞俄比亚 8.57280148319
+巴利文 11.1280889297
+番木瓜 11.8212361103
+巅峰期 11.9547675029
+阿托 12.1089181827
+神田 13.900677652
+已能 9.04864738806
+潇潇雨 13.2075304714
+上进 11.0103058941
+卫生间 9.15574552361
+巴尔巴 13.2075304714
+阿扎 11.8212361103
+神甫 10.2897597393
+超预算 11.1926274509
+共振态 11.2616203224
+道蒂 12.5143832909
+数百家 10.6818018271
+阿房 11.7034530746
+塑性形变 13.2075304714
+生婴儿 11.5027823792
+斯布鲁克 12.8020653633
+囊斑 13.900677652
+游乐区 13.900677652
+神界 12.2912397395
+任华新 12.8020653633
+白云宫 13.900677652
+农合 13.900677652
+重要批示 11.2616203224
+沟槽 10.3453295905
+坠毁 9.91169360541
+天保 9.98865464655
+闯关东 11.7034530746
+挑逗 10.2117981979
+满腹心事 11.1280889297
+兰开夏 12.2912397395
+斯托林 13.900677652
+艾尔 10.8096351986
+双翅飞 13.2075304714
+星形 10.5684731418
+数百对 13.2075304714
+沙堡 13.2075304714
+肖玲 9.37888907493
+奥妙无穷 11.8212361103
+冲散 10.1630080337
+挑选 7.57274086825
+磁化率 11.0103058941
+掌门 10.4041700905
+弹出式 13.900677652
+中国福利会 12.2912397395
+夜幕 9.49395840471
+熏烧 13.2075304714
+熏烤 11.8212361103
+众口一辞 13.900677652
+巴东县 12.1089181827
+广纳善言 13.900677652
+耶布斯 13.2075304714
+狗狗 10.9049453784
+毕了业 13.2075304714
+漫漫长夜 11.0103058941
+王基 11.7034530746
+上过 9.56994431169
+荒村 10.642581114
+巴尔干 9.18217878068
+检出率 12.2912397395
+红苕 11.2616203224
+纸堆 12.2912397395
+有骨头 12.1089181827
+熏烟 11.8212361103
+别忘记 11.598092559
+汤加王国 13.900677652
+卫生院 9.33632946051
+密召 11.7034530746
+取尽 12.5143832909
+观影 10.8561552143
+好胜心 11.3357282945
+轻悠悠 13.900677652
+文安 10.642581114
+雾社 11.3357282945
+施施 13.2075304714
+六行 11.4157710022
+宁晋泊 12.1089181827
+毁坏 8.67493097826
+艾德 11.0674643079
+易燃 10.1164880181
+六街 12.1089181827
+狮心王 12.2912397395
+起跳 10.3453295905
+侧空翻 12.8020653633
+羊蹄 11.2616203224
+茅店 13.900677652
+贫病交加 11.9547675029
+忌刻 12.1089181827
+仰天一望 13.900677652
+培养对象 13.900677652
+和小红 11.3357282945
+采石 9.77354326693
+采矿 8.16733637508
+波波维奇 13.2075304714
+密县 10.4994802703
+农垦 9.5062284973
+头箍 13.900677652
+起跑 10.7226238216
+茅庵 11.7034530746
+施斋 13.900677652
+怡神 12.8020653633
+起货 13.900677652
+公证 9.74179456862
+欣欣 10.9049453784
+上述 5.34119154837
+马尔特 13.2075304714
+狗牌 13.900677652
+六袋 13.900677652
+公诉 9.72629038208
+王海燕 13.900677652
+王李存 12.5143832909
+邗沟 9.87532596124
+锡纸 12.1089181827
+爱尔兰共 13.2075304714
+公话 13.2075304714
+狗牙 12.1089181827
+有君臣 11.1926274509
+后无来者 12.1089181827
+薛蟠见 12.1089181827
+眉头 8.06294720481
+施救 10.4041700905
+多半天 11.9547675029
+淹没区 12.1089181827
+独角龙 12.2912397395
+施教 11.4157710022
+心理压力 9.22784881751
+力不胜任 13.2075304714
+道融 12.8020653633
+美兰区 13.900677652
+另悉 10.9049453784
+文件名扩展 11.8212361103
+线规 13.900677652
+受禄 12.8020653633
+一夫当关 11.4157710022
+历叙古 13.2075304714
+赣榆 11.7034530746
+施政 9.58318953844
+施放 9.33632946051
+忌动 13.900677652
+有利有弊 12.8020653633
+坚船利炮 13.2075304714
+滚滚 8.25523075433
+笋芽 13.2075304714
+楚南 13.2075304714
+六百四十九万斤 13.2075304714
+郑铮 13.2075304714
+毛樱桃 13.2075304714
+公认 7.62403416263
+已获 8.86372504956
+农地 10.4994802703
+吴之计 12.5143832909
+公议 10.2630914922
+至深 11.9547675029
+狗爬 12.2912397395
+农场 8.1417758781
+玻璃机械 13.900677652
+萨夫拉 13.2075304714
+张茜 12.2912397395
+建材城 12.2912397395
+公设 11.1280889297
+跨国性 13.900677652
+公论 10.7226238216
+受让人 11.2616203224
+忿然作色 13.2075304714
+密勒 12.1089181827
+夜归 13.900677652
+一念之间 11.2616203224
+威斯康星 11.598092559
+壮健 10.8561552143
+刘弘代 13.2075304714
+普兰县 11.1280889297
+纸夹 12.5143832909
+王大惊 11.8212361103
+置之死地 11.2616203224
+纸头 11.9547675029
+孪生儿 12.8020653633
+吃罪 13.900677652
+子武庚 12.2912397395
+孙仲秀 13.2075304714
+共睹 13.2075304714
+战车 8.03989142851
+雅科夫 13.900677652
+隆厚 13.2075304714
+沙塔 13.900677652
+刘伯钦 12.5143832909
+千推万阻 13.900677652
+产品型号 11.8212361103
+引以为鉴 12.8020653633
+卡拉姆 12.1089181827
+仓皇 8.99540287354
+数百头 12.5143832909
+过得去 10.2117981979
+遭际 10.0940151622
+文武庙 12.8020653633
+剪出 11.8212361103
+博学之士 13.2075304714
+卜法间 13.2075304714
+马尿酸 12.2912397395
+滕代远 12.1089181827
+下议院 11.0674643079
+化氢 11.7034530746
+宣宗时 11.3357282945
+求婚者 11.4157710022
+分泌腺 12.5143832909
+典礼 8.80081122415
+井上毅 13.2075304714
+成形术 11.5027823792
+所得额 11.7034530746
+坠楼 11.8212361103
+熏熏 12.8020653633
+国立中央 12.8020653633
+伊采夫 11.8212361103
+临幸 11.1280889297
+董卓之 11.0674643079
+幸福感 10.3453295905
+申诉权 12.2912397395
+硝化作用 13.2075304714
+机员 12.5143832909
+市场调研 10.9562386728
+藐小 13.2075304714
+致死量 11.4157710022
+钙泵 13.2075304714
+严灵峰 13.2075304714
+筋络 12.1089181827
+可印刷 12.8020653633
+忌口 11.598092559
+母改子 12.8020653633
+商用车 9.71102290995
+举直 13.2075304714
+数平方公里 13.900677652
+女神庙 11.8212361103
+被雪困住 13.900677652
+一丝不苟 9.7898037878
+归拢 11.2616203224
+冲服 10.6818018271
+海神庙 11.7034530746
+便知 9.03314320152
+二程 10.8561552143
+斯洛文尼亚语 12.1089181827
+贵人多忘事 12.1089181827
+张锡钧 12.8020653633
+锄草 11.1280889297
+武元衡 12.1089181827
+古玺印 13.2075304714
+皮草 11.9547675029
+冷拔 12.5143832909
+加力燃烧 11.9547675029
+刘弘之 13.900677652
+狗獾 12.2912397395
+卡拉奇 10.3171587135
+遭难 11.2616203224
+蒙特利尔市 13.900677652
+抵得 10.4666904475
+农器 11.1926274509
+硅酸 11.0674643079
+雇户 13.900677652
+晒坪 13.900677652
+王大怒 12.1089181827
+平凉县 12.8020653633
+托斯卡纳 11.0103058941
+泥瓦匠 11.0103058941
+空心化 12.5143832909
+斯托斯 11.1280889297
+冲杀 8.71889410168
+维斯孔 13.900677652
+六角 10.4041700905
+苯甲酸 10.1630080337
+彩券 12.8020653633
+彩陶 9.35738286971
+第一把手 12.1089181827
+代书记 12.8020653633
+上星期 11.7034530746
+剑桥郡 12.5143832909
+红双喜 13.2075304714
+阿思 12.8020653633
+成宗卒 12.8020653633
+亲情 9.5062284973
+碾子 11.3357282945
+剿捕 10.8096351986
+楚剧 13.2075304714
+巴尔德 13.900677652
+宁静下来 12.5143832909
+黄炳炎 13.2075304714
+小批量 10.9562386728
+冲来 10.533381822
+鲛绡 12.5143832909
+小冰月 11.4157710022
+喧嚷声 13.2075304714
+忠恕 11.8212361103
+艾布 11.598092559
+玄英洞 11.598092559
+冻融 10.533381822
+赔垫 13.900677652
+巴勒斯坦解放组织 11.2616203224
+农委 11.5027823792
+归海 11.9547675029
+家禽业 13.900677652
+剑胆琴心 13.900677652
+岂不知 9.61021821083
+伯仁 12.5143832909
+起获 13.900677652
+他项权证 13.2075304714
+烤瓷 11.9547675029
+勇悍 11.8212361103
+伯仑 13.900677652
+冷浸 12.8020653633
+单花粉 13.900677652
+因循守旧 10.9049453784
+张中 13.900677652
+索韦托 12.5143832909
+毕达哥 13.900677652
+冷流 12.1089181827
+施毒 12.2912397395
+苗兵攻 13.2075304714
+摇落 11.9547675029
+天然饵料 11.1280889297
+托带 10.7226238216
+撑杆跳 12.5143832909
+取到 10.8561552143
+土政策 11.598092559
+解脱法 11.8212361103
+祁州 11.598092559
+陈小艺 12.2912397395
+伯仲 12.5143832909
+挖上来 13.900677652
+蒙洼 12.8020653633
+以假乱真 11.0103058941
+一连几天 10.1630080337
+萨南诸 13.900677652
+达格兰 12.2912397395
+穆塞韦尼 13.900677652
+军政权 12.2912397395
+登霄 11.7034530746
+卡脖子 13.2075304714
+航运公司 10.642581114
+震荡性 13.2075304714
+博大胸襟 13.2075304714
+吕大防 12.8020653633
+心窄 12.5143832909
+采种 11.0103058941
+法甲 13.2075304714
+编织成 10.9562386728
+鲁成 12.5143832909
+傅钟 12.1089181827
+爱厂如家 12.8020653633
+萨卢斯 13.2075304714
+赞助费 12.5143832909
+大尖山 12.2912397395
+自习课 13.2075304714
+神秘兮兮 11.4157710022
+批假 13.900677652
+川周明 13.900677652
+地址码 13.900677652
+三四十米 11.9547675029
+机子 11.8212361103
+世界名牌 11.9547675029
+阻碍 7.51379833261
+无凭无据 13.2075304714
+羊肝 12.5143832909
+刺骨 9.77354326693
+华夷译 13.2075304714
+冷淡 8.45394028031
+裴绕 13.900677652
+一二百辆 12.8020653633
+今日报价 13.2075304714
+小玉儿 13.900677652
+施武 13.900677652
+羊肉 8.47572763449
+战胜 7.39938798144
+宦门 11.7034530746
+老战友 8.97342396682
+顾荣 12.1089181827
+巴尼亚 13.2075304714
+抹起 11.9547675029
+伯乐 10.7226238216
+追问到底 13.900677652
+阿奇博尔德 13.2075304714
+农奴 8.93783302172
+熟记 11.598092559
+机宜 10.0088573539
+出版局 12.8020653633
+艾克 11.5027823792
+行酒 12.5143832909
+苏花 12.1089181827
+心电图 9.62401153296
+船运 9.71102290995
+成都地区 11.2616203224
+羊肠 10.7226238216
+普金斯 12.5143832909
+陈明仁 12.5143832909
+引人遐思 13.900677652
+冷涡 11.598092559
+筋缩 13.900677652
+三水县 13.2075304714
+暴露无遗 10.8096351986
+有心力 12.1089181827
+斯福尔 13.900677652
+毛德皇后 13.900677652
+稳中有 10.9049453784
+福莫萨 13.2075304714
+一一道来 12.2912397395
+熟识 9.72629038208
+中共晋察冀中央局 13.2075304714
+骑下 13.900677652
+塞法杰 13.900677652
+积累区 12.1089181827
+中专生 11.1926274509
+淳风 12.8020653633
+熟读 10.2897597393
+牛肉面 10.9562386728
+机密 7.99804431857
+菲律宾参议院 13.900677652
+闲散地 12.8020653633
+姚苌北 12.8020653633
+起草 7.91422564669
+农大 10.642581114
+吃点 9.32596667347
+搬弄是非 12.1089181827
+待业青年 11.7034530746
+道观 9.5062284973
+中央日报 11.5027823792
+侍香 12.8020653633
+大小兴安岭 11.2616203224
+道规 13.900677652
+馒头 8.1608847398
+九月九 11.8212361103
+唉哟 11.9547675029
+煤带 12.8020653633
+楚明玉 11.7034530746
+油菜花 11.1280889297
+行部 11.598092559
+玄德书 12.8020653633
+起花 11.9547675029
+残缺 9.36807815882
+坠机 11.7034530746
+行都 11.1926274509
+保康县 12.8020653633
+揭阳市 12.5143832909
+羊脂 10.765183436
+夜光 10.7226238216
+前后左右 9.63799777493
+唯一标准 10.8096351986
+机事不密 12.5143832909
+按图 12.1089181827
+三角方程 13.2075304714
+玄德乘 13.2075304714
+剪得 11.1280889297
+孢粉 11.1280889297
+冷汗 8.28754954559
+玄德乃 10.9562386728
+五六千克 12.8020653633
+信口开河 10.2371160058
+剪径 11.0103058941
+玄德之 11.8212361103
+睥睨一切 13.2075304714
+抽长 13.2075304714
+思洪 13.900677652
+神秘 6.88496523149
+蒙巴顿 10.8561552143
+第四十五 13.2075304714
+量仪 12.1089181827
+平遥县 12.5143832909
+弹出去 12.5143832909
+玄德举 13.2075304714
+打火机 9.66657114738
+出不去 10.0720362555
+冷水 8.53470163695
+原子时代 11.9547675029
+神秀 11.5027823792
+马渡江 12.5143832909
+第四十二 12.2912397395
+心如死灰 11.5027823792
+纸坊 12.5143832909
+公营 11.3357282945
+租费 11.8212361103
+一百五十名 11.4157710022
+莱夫斯基 13.900677652
+兼通 11.0103058941
+猴头猴脑 13.900677652
+冷气 8.9102450652
+道衍 12.5143832909
+道行 9.87532596124
+索佩朗 13.2075304714
+羊膜 10.8096351986
+纸垫 13.2075304714
+文韬武略 13.2075304714
+国际射箭联合会 13.2075304714
+二妙散 12.8020653633
+第四十九 12.5143832909
+执法必严 11.8212361103
+舱壁 11.2616203224
+中青班 12.8020653633
+汤姆斯 13.2075304714
+埂子 13.2075304714
+云雾山 10.642581114
+玄德令 11.9547675029
+唉呀 10.2897597393
+二百五十米 13.900677652
+熊心虎 13.2075304714
+夜凉 12.1089181827
+震级 9.89334446674
+沟施 13.900677652
+九月份 9.69598503258
+含银 11.8212361103
+神社 11.1280889297
+忠清 11.8212361103
+朱胖子 13.900677652
+王老吉 10.9049453784
+冷泉 11.1926274509
+模特儿 10.2897597393
+思润 13.2075304714
+行道 11.1926274509
+道袍 9.72629038208
+李亚彪 12.5143832909
+营林 11.4157710022
+取去 10.604840786
+剪开 11.2616203224
+玄德仍 13.2075304714
+卫生香 13.2075304714
+船身 9.33632946051
+梁晓峰 12.1089181827
+德星君 11.2616203224
+太仆公 12.5143832909
+高层云 12.1089181827
+急巴巴 12.2912397395
+北仰南 12.8020653633
+食物残渣 11.1280889297
+神祗 10.1394775363
+第四十一 12.8020653633
+密封 8.53470163695
+批出 10.3743171274
+始起 13.900677652
+起色 9.08039608637
+正规部队 11.0674643079
+女神像 11.2616203224
+联系方式 9.82314020807
+上车 8.48903160012
+神祇 10.9049453784
+伯伯 8.39534611604
+观测者 9.96885201925
+油管线 13.900677652
+格里菲斯 11.0103058941
+奋斗目标 10.1164880181
+绣球 10.1630080337
+伯伦 12.5143832909
+批准 6.23726998708
+默默耕耘 13.900677652
+个体发育 9.85762638414
+神祠 11.5027823792
+行速 12.8020653633
+西达汝 12.8020653633
+太岁头上 13.900677652
+路桥费 13.2075304714
+数百名 9.89334446674
+马尔维 13.2075304714
+宋欧阳修 13.900677652
+温哥华 10.4349417492
+急造 13.2075304714
+艾叶 10.8096351986
+羊舌 12.5143832909
+麻姑献寿 12.5143832909
+国计 11.7034530746
+不可不 8.93783302172
+机头 9.48183704418
+五迷三道 13.900677652
+滚成 13.2075304714
+陈关保 12.2912397395
+六营 11.9547675029
+数百吨 12.8020653633
+卢尔德 13.900677652
+失血过多 10.3453295905
+卓亦离 13.2075304714
+骑士团 10.8096351986
+里约热内卢 9.74179456862
+急送 12.8020653633
+急退 10.2371160058
+父子相传 12.2912397395
+政府网 12.5143832909
+急速 7.82763311788
+一百五十块 13.2075304714
+机多 13.2075304714
+肖楚女 13.2075304714
+萨斯 11.7034530746
+插身 12.8020653633
+取值 10.0088573539
+荒歉 12.8020653633
+别饶 12.2912397395
+中庶子 12.1089181827
+钻天入地 12.8020653633
+冷漠 8.71329184614
+比热容 10.4041700905
+自行安排 12.8020653633
+婚恋观 13.2075304714
+烧出 11.4157710022
+急遽 10.3171587135
+数百员 12.8020653633
+大雨如注 11.9547675029
+旅游事业 10.4666904475
+国语 8.89673134603
+三楼住户 13.900677652
+滚打 12.1089181827
+农家 8.96620371885
+浆细胞 11.1926274509
+悍将 11.0674643079
+月饼 9.06439574502
+攀枝花树 13.900677652
+水产业 10.2897597393
+知命不忧 13.900677652
+伦楹希 13.2075304714
+战船 8.73019365694
+鼓舞斗志 12.1089181827
+美利坚合众国 10.4994802703
+战舰 8.77671367257
+后庭 13.2075304714
+神童 10.642581114
+人才济济 11.5027823792
+孙昆弥 13.2075304714
+蚊香 11.7034530746
+扁圆 10.8096351986
+已远 11.3357282945
+巴尔勒 12.1089181827
+艾卷 11.9547675029
+古列维奇 13.2075304714
+已过 8.62767809341
+横恣 12.8020653633
+柔性制造系统 11.5027823792
+秦仲文 13.2075304714
+于岩壑 13.2075304714
+新华日报 10.3453295905
+摇蚊 11.8212361103
+两道菜 12.5143832909
+艾卜 10.5684731418
+王如一 10.0294766411
+日晴明 12.5143832909
+护手霜 12.5143832909
+农学 9.21854642485
+百十万 12.1089181827
+李比希 10.9562386728
+跑跑颠颠 13.900677652
+批办 13.2075304714
+毁容 11.4157710022
+猪血 10.9562386728
+起脚 10.3453295905
+思溪 12.8020653633
+石龙镇 11.9547675029
+宣抚移 13.2075304714
+类毒素 11.598092559
+秘商 12.8020653633
+立幼君 13.900677652
+满朝臣 12.8020653633
+江楼 12.2912397395
+阿洪 13.900677652
+国家工商局 12.8020653633
+赫德森 12.1089181827
+外标法 13.900677652
+四百多场 13.900677652
+阿洛 12.2912397395
+马西亚 12.8020653633
+一下下 10.4041700905
+已达 7.37564799413
+纸品 12.8020653633
+盲点 10.604840786
+贾珍酒 13.900677652
+舱室 10.2897597393
+背阴处 11.598092559
+率先垂范 12.5143832909
+似水如鱼 13.900677652
+郑风 11.7034530746
+食品街 13.900677652
+局促 9.66657114738
+中产阶层 11.2616203224
+竞速 12.1089181827
+竞逐 11.1926274509
+烟柳 11.8212361103
+喜封 13.900677652
+微山县 11.4157710022
+打卦 10.8561552143
+神算 11.598092559
+都保正 13.2075304714
+竞选 8.51618258919
+萨拉 9.71102290995
+月季花 10.9562386728
+牢记 9.30555780184
+紧紧围绕 10.2897597393
+冷湿 10.6818018271
+羊茅 11.1280889297
+普兰德 13.900677652
+民殷国富 12.8020653633
+夜半 9.91169360541
+阿波 11.4157710022
+空军节 13.2075304714
+楚库 13.2075304714
+四十九个 12.5143832909
+艾勒 13.2075304714
+亿千米 11.3357282945
+王登基 13.2075304714
+黑虎玄 11.8212361103
+冷湖 10.8561552143
+搜购 12.8020653633
+身单力薄 12.2912397395
+煤尘 11.7034530746
+首当其冲者 13.900677652
+巴尔卡 12.8020653633
+至性 13.2075304714
+茅台 7.42216800977
+五十张 12.8020653633
+射出来 10.9049453784
+顿开茅塞 12.5143832909
+抬爱 13.900677652
+汽车饰品 13.2075304714
+借出去 13.2075304714
+跋语 11.8212361103
+朗县 13.2075304714
+申请入党 13.900677652
+哈塔米 13.2075304714
+冲毁 10.2117981979
+三伏天 11.1280889297
+威龙 11.598092559
+司马歆派 13.2075304714
+辛地亚 13.900677652
+毡房 12.1089181827
+煤山 10.0505300503
+冷清 8.78868986362
+阿沛 13.2075304714
+马切洛 13.900677652
+癞虾蟆 13.2075304714
+录音电话 12.1089181827
+煤层 9.40086798165
+新乡化纤 11.1926274509
+爱尔兰岛 11.1280889297
+卖票 10.765183436
+洛维夫人 13.900677652
+小邦励 13.2075304714
+秋风落叶 13.900677652
+取其 10.0088573539
+郭祥背 13.2075304714
+云南日报 13.900677652
+思潮 8.20023407859
+营救 8.63798746307
+煤屑 11.9547675029
+换衣服 9.96885201925
+天底下 8.98802276624
+长征三号 13.900677652
+遭骂 13.2075304714
+寒光 9.36807815882
+满银 10.6818018271
+神笔 10.5684731418
+詹和主 13.2075304714
+楚帝 13.2075304714
+赶马 11.8212361103
+溢价 7.22991133113
+口齿 10.7226238216
+佃农 9.45802639549
+地层下陷 13.900677652
+君士坦丁 10.0088573539
+夜叉 10.1871055853
+九声 12.5143832909
+马尔罗 11.9547675029
+植花木 12.8020653633
+半文不白 13.2075304714
+格子布 12.1089181827
+史蒋式 12.8020653633
+取决 11.1926274509
+扁嘴 12.8020653633
+坍倒 13.900677652
+当涂 10.5684731418
+一下余 13.2075304714
+龚育之 13.900677652
+命丧九泉 13.2075304714
+便民服务 11.1280889297
+巴尔古 13.2075304714
+整课 13.900677652
+师大附中 12.1089181827
+乍浦 11.0674643079
+月食 10.3743171274
+沿边 9.66657114738
+无所容心 13.2075304714
+眼不见为净 11.5027823792
+营养液 11.598092559
+艾利 12.2912397395
+密布 8.3285236198
+太仆卿 12.5143832909
+钙芒硝 12.5143832909
+铸排机 13.2075304714
+真格的 11.7034530746
+食品袋 12.1089181827
+批号 11.1926274509
+机壳 12.5143832909
+贾珍遂 13.2075304714
+祝贺信 13.900677652
+装裱 10.4349417492
+衍生品 8.31718134319
+扉页 10.642581114
+一国三公 12.8020653633
+大声哭喊 13.2075304714
+罗亦农 12.2912397395
+冷源 11.9547675029
+批发 8.05423887692
+取出 6.78185140291
+王司马越 10.8096351986
+斯特鲁普 12.8020653633
+楚平 13.2075304714
+国家局 11.9547675029
+道贺 11.2616203224
+俞振飞 12.1089181827
+不莱梅 11.598092559
+国足 10.1871055853
+目光 6.33799640525
+冲沟 10.8561552143
+波罗的海地区 12.1089181827
+威风 8.38724890581
+即事 11.1280889297
+密苏里 10.3453295905
+行间 9.85762638414
+加内特 12.8020653633
+一击必杀 12.8020653633
+宝玑 12.2912397395
+梁晓天 13.2075304714
+纸制 11.598092559
+艾里布 13.2075304714
+改进版 13.900677652
+阿毛 11.1926274509
+口风 9.5186510173
+整篇文章 12.8020653633
+一百五十元 11.8212361103
+沿街 9.55687223012
+武氏非 13.2075304714
+阿比 11.9547675029
+脾气 7.32142643997
+中国公学 10.765183436
+体膨胀 12.5143832909
+阿母 12.8020653633
+农工 9.72629038208
+小白鹭 13.900677652
+山沟沟 12.8020653633
+前半场 13.2075304714
+归心似箭 11.5027823792
+鄂北岗 12.1089181827
+人地关系 10.7226238216
+日盛 9.7898037878
+翩翩风度 13.900677652
+即今 8.85725253506
+斯再传 13.900677652
+晶莹 8.62256299275
+睿知 13.900677652
+六艘 11.8212361103
+急降 11.7034530746
+那具男 12.5143832909
+晋跃升 13.2075304714
+黑客程序 13.900677652
+高钾血症 11.5027823792
+发指眦裂 13.900677652
+掎角之势 11.4157710022
+王振宇 12.8020653633
+数万亩 12.5143832909
+军事冲突 10.4041700905
+三五匹 13.2075304714
+屡试不爽 11.2616203224
+冲泡 9.40086798165
+井下 9.10488710638
+井上 10.8096351986
+秘史 9.80633308975
+杨可弼 13.2075304714
+数万人 9.48183704418
+六艺 10.533381822
+颅相学 12.5143832909
+找找看 11.8212361103
+福尔斯 11.3357282945
+国贼 10.533381822
+肖立 13.900677652
+大英帝国 10.9049453784
+国贸 9.58318953844
+菲利皮 13.900677652
+机徽 12.8020653633
+国货 11.1280889297
+急难 10.533381822
+释义 10.6818018271
+井仪 13.2075304714
+学究式 12.5143832909
+行长 7.98717464634
+至极 9.65218240993
+巴托尔 12.5143832909
+王老儿 12.8020653633
+曾赢 13.900677652
+后继人 12.1089181827
+荒淫 10.0088573539
+尖端科学 11.4157710022
+即为 7.65651075131
+五十四万 13.900677652
+楚天 10.6818018271
+微言大义 11.1926274509
+武川西 11.3357282945
+李鱼川 13.2075304714
+厮杀 8.0985592766
+一晃眼 13.2075304714
+猪蹄 10.8561552143
+保守势力 10.9049453784
+盲目 7.56739802384
+那头 8.68574189437
+明王朝 9.46986085313
+大笔一挥 12.1089181827
+业务培训 11.4157710022
+许企平 13.2075304714
+见势不妙 11.5027823792
+虞神 12.8020653633
+锡瓦 11.9547675029
+八公里 12.8020653633
+良夜 12.8020653633
+牧人 10.1394775363
+井亭 12.5143832909
+留下烙印 13.2075304714
+沿袭 8.24818847171
+道路 6.01384465302
+茅君 12.8020653633
+林道静 13.2075304714
+欣慰 8.47572763449
+拿不住 11.8212361103
+耘田 13.2075304714
+取回 9.55687223012
+数万两 12.1089181827
+行销 9.58318953844
+井井 13.2075304714
+商千料 13.2075304714
+罗联军 12.1089181827
+被疑 11.4157710022
+感叹号 11.3357282945
+始行 10.9562386728
+柯尔特 11.7034530746
+曹军入 13.2075304714
+欣慕 12.2912397395
+勇斗 12.8020653633
+文综 13.900677652
+死心眼儿 12.1089181827
+公职 9.55687223012
+可动性 12.8020653633
+一千三百多个 13.2075304714
+欣悦 11.3357282945
+半饱 11.3357282945
+圣劳伦斯 10.0294766411
+香河县 11.7034530746
+山房 10.8561552143
+刺鼻 9.66657114738
+道谢 9.7898037878
+当次 13.2075304714
+冲消 13.2075304714
+海棠树 11.598092559
+采粉 12.8020653633
+楚墓 10.604840786
+马尔科 12.2912397395
+即便 6.4174332359
+望唐僧 12.5143832909
+列宁主义 10.9562386728
+山本安英 13.2075304714
+养殖业 9.11318590919
+急需 8.45825994145
+挑食 11.1280889297
+纸包 9.55687223012
+井位 12.8020653633
+已补 12.8020653633
+拉斐 11.7034530746
+存钱罐 13.900677652
+多科性 11.0674643079
+供销社 9.74179456862
+难以实现 9.98865464655
+海将士 13.900677652
+卜世仁 12.5143832909
+第四十四回 12.2912397395
+打印函数 13.900677652
+打扫卫生 10.4666904475
+数百千 13.2075304714
+白云区 11.8212361103
+归根 11.8212361103
+阀体 12.2912397395
+胡节 13.2075304714
+芳香化 12.8020653633
+兽面 10.0720362555
+深国投 10.4666904475
+纸卷 11.4157710022
+当此 9.58318953844
+广孝 12.8020653633
+膜蛋白 11.9547675029
+宦途 11.598092559
+阿香先 12.8020653633
+宝玩 13.900677652
+零四十二点 13.2075304714
+郎氏 12.5143832909
+挡位 10.3171587135
+人生观 9.93038573842
+行针 11.7034530746
+孪生子 12.1089181827
+任荆南 12.8020653633
+鄱阳湖 8.86372504956
+编织机 12.8020653633
+田径馆 13.900677652
+堆芯 11.4157710022
+楚声 11.9547675029
+大槐树 10.8561552143
+数百卷 12.8020653633
+二百七十卷 13.2075304714
+长吨 13.2075304714
+冲洗 8.88339781516
+无计所奈 13.900677652
+施大宇 12.2912397395
+火山作用 11.2616203224
+机座 12.5143832909
+巧立名目 11.1280889297
+西川河 12.8020653633
+请便 11.0103058941
+掌舵 9.87532596124
+产生误解 13.2075304714
+古钱币 12.2912397395
+纺织工业 8.74162235276
+盘剥 9.20932976975
+数万余 13.2075304714
+建筑施工 9.75754292558
+兵戎相见 10.8096351986
+机床 8.27666014579
+纸厂 10.8096351986
+顾虑 8.33999602096
+香港地区 10.2630914922
+崔莺莺 11.8212361103
+穿红着绿 12.8020653633
+穆贾迪 13.2075304714
+沟通思想 12.8020653633
+一见倾心 12.2912397395
+冲上来 10.0505300503
+西峰市 12.2912397395
+转赠给 12.8020653633
+道貌 12.1089181827
+平西王 9.82314020807
+机库 10.533381822
+郁证 12.5143832909
+亚排联 13.2075304714
+公肃 12.8020653633
+勇救 13.900677652
+相别 9.55687223012
+需加 11.3357282945
+雾状 11.7034530746
+摇臂 12.1089181827
+即位 7.04737855879
+拉施 13.2075304714
+骨肉相连 12.5143832909
+青木香 11.8212361103
+合成作用 12.8020653633
+数百只 10.9562386728
+即使 5.57198506843
+南路军 12.5143832909
+公股 13.900677652
+汪文言 12.8020653633
+糜鹿 12.2912397395
+数百口 12.1089181827
+荒沟 11.8212361103
+剪子 9.89334446674
+荒沙 12.1089181827
+李骧之 13.2075304714
+第四产业 12.1089181827
+谍报人员 13.2075304714
+结转 9.43476953332
+强汉者 12.8020653633
+忌妒 11.0674643079
+勇敢 7.66822963543
+数百台 13.900677652
+复通 13.2075304714
+冲浪 10.4666904475
+将次 11.0103058941
+毁弃 11.2616203224
+一大二公 13.900677652
+数百倍 12.1089181827
+鲁肃引 12.5143832909
+养阴益 13.2075304714
+另样 13.900677652
+藏不住 10.9562386728
+池心 13.900677652
+取名 8.81927328699
+农忙 11.0674643079
+取向 8.26588804881
+一百五十卷 12.5143832909
+一千部 13.900677652
+密密 9.6811699468
+归正 11.3357282945
+交杯酒 11.5027823792
+矸石 10.6818018271
+基本区域 13.900677652
+唉叹 12.5143832909
+采取行动 9.08039608637
+深爱着 11.9547675029
+醉杏 10.7226238216
+肝油 13.900677652
+阻绝 11.598092559
+贾琏自 12.5143832909
+拉断 11.5027823792
+锐利地 11.598092559
+搞了个 11.0674643079
+崔先生 11.5027823792
+郁血 12.8020653633
+孙观 12.8020653633
+公茂 12.8020653633
+拉斯 9.87532596124
+密宗 9.65218240993
+密实 11.1926274509
+六联 12.2912397395
+道轨 13.900677652
+荒漠 7.93197009199
+宋德福 13.900677652
+犬子 11.598092559
+菊芋 11.8212361103
+陈望道 11.7034530746
+狗窝 11.598092559
+少调 13.900677652
+招俊杰 13.2075304714
+毁形 13.900677652
+国运 9.38981814546
+武汉三镇 11.0103058941
+菊花 8.62767809341
+血盆 11.1280889297
+罗科铎 12.8020653633
+克丘亚 11.598092559
+埃格伯 13.2075304714
+密室 8.92394390956
+廉大怒 13.900677652
+燎原 10.3743171274
+另案 13.900677652
+评议员 11.5027823792
+塔里木盆地 8.85725253506
+肝气 10.1630080337
+泄露机密 11.2616203224
+玛申卡 13.2075304714
+编写程序 11.8212361103
+局外之人 13.900677652
+碾到 12.1089181827
+囤货 9.91169360541
+云左山 13.900677652
+墨斗 11.598092559
+曹总兵 13.2075304714
+吃盐 11.598092559
+调整器 12.8020653633
+新余市 11.9547675029
+六股 11.2616203224
+至於 11.9547675029
+按兵 11.598092559
+榴花 11.5027823792
+钻井队 13.2075304714
+特洛甫 11.598092559
+吵杂 13.900677652
+冯至 11.9547675029
+国立艺专 13.900677652
+宝珠 9.82314020807
+二百里 10.604840786
+苦心孤诣 11.4157710022
+马格斯 13.900677652
+欧仁 13.2075304714
+艾地 12.1089181827
+机工 12.1089181827
+机巧 10.9049453784
+腆颜 13.2075304714
+极间电容 13.900677652
+陪葬 9.02548032877
+单循环 13.2075304714
+提炼 8.71889410168
+天宝栈 13.2075304714
+不识大体 11.8212361103
+织造厂 13.2075304714
+蒋奇 13.2075304714
+文武场 12.5143832909
+施洗 11.598092559
+峻法 13.900677652
+那套 8.96620371885
+施洞 13.2075304714
+测度论 11.8212361103
+鲜酵母 13.900677652
+熟路 13.2075304714
+经理制 12.2912397395
+批回 12.5143832909
+繁殖率 11.598092559
+齐发喊 12.5143832909
+施洋 11.8212361103
+天皇制 11.4157710022
+碾去 13.2075304714
+施泰 12.5143832909
+熟谙 10.9049453784
+小而全 13.2075304714
+交通警察 9.96885201925
+律条 11.598092559
+能挽弓 13.2075304714
+盆盆罐罐 12.1089181827
+阿森 13.2075304714
+机尾 10.604840786
+塑钢 13.900677652
+八十四岁 13.2075304714
+动系统 13.900677652
+雾灯 10.604840786
+艾因 12.2912397395
+佟大雷 8.98802276624
+施法 10.9562386728
+檀那 12.8020653633
+航班信息 13.900677652
+采纳 7.87481167815
+溶剂型 12.8020653633
+吃睡 13.2075304714
+曹军势 13.2075304714
+道班 13.900677652
+挣饭吃 12.2912397395
+五星红旗 10.604840786
+碾压 10.5684731418
+冲澡 13.900677652
+纽埃 11.3357282945
+民法典 10.2117981979
+真空技术 12.1089181827
+晶胞 11.7034530746
+宝贵时间 11.8212361103
+久久不绝 12.8020653633
+化铁炉 12.2912397395
+安全期 12.5143832909
+出版家 10.7226238216
+与民除害 12.8020653633
+于乘丘 13.2075304714
+数百元 11.1280889297
+帅领 11.7034530746
+施治 10.6818018271
+武冈 11.0103058941
+农庄 11.0103058941
+皮尔逊 11.4157710022
+六腑 10.4994802703
+方差分析 11.9547675029
+碳酸氢钙 12.1089181827
+明元帝 11.5027823792
+语源学 13.900677652
+格力空调 9.72629038208
+大家庭 9.43476953332
+滚来 11.2616203224
+多方位 10.9562386728
+夜场 12.5143832909
+郑联军 13.2075304714
+宁波大学 12.5143832909
+云南队 13.900677652
+绕口令 11.5027823792
+石象生 13.2075304714
+摇荡 11.2616203224
+钱大钧 13.2075304714
+阿梅 12.2912397395
+希夏邦马峰 10.6818018271
+新宝来 12.5143832909
+行院 11.1926274509
+文繁 13.2075304714
+军阀作风 13.900677652
+郑魔君 12.5143832909
+打工者 10.5684731418
+冯胜 11.9547675029
+情色 13.900677652
+出版学 12.2912397395
+起落 9.37888907493
+茅坑 10.5684731418
+荒滩 10.4666904475
+下肢骨 11.9547675029
+公若 11.9547675029
+吴相争 13.2075304714
+茅坪 11.9547675029
+施汝 13.2075304714
+杨慎之 13.900677652
+榴莲 11.3357282945
+近战 9.82314020807
+覃艺 13.2075304714
+抚养权 11.9547675029
+斯里兰卡 8.75318317516
+阿桂 11.598092559
+面包皮 13.900677652
+累代 12.2912397395
+望长安 11.4157710022
+头戴式 13.900677652
+阿格 12.2912397395
+舱底 11.1280889297
+斯图谟 13.2075304714
+阿根 12.8020653633
+符契 13.2075304714
+经侦大队 13.900677652
+按倒 10.3171587135
+印地语 10.2630914922
+韧性 8.9102450652
+锡石 11.2616203224
+福尔曼 12.5143832909
+不辱使命 10.9562386728
+十七艘 13.2075304714
+悍妻 12.1089181827
+技术能手 12.5143832909
+唾液腺 10.8561552143
+悍妇 11.9547675029
+熊瞎子 12.8020653633
+睽违 12.8020653633
+金玉均 12.2912397395
+现已证实 13.2075304714
+桔梗 9.58318953844
+博洽多闻 13.2075304714
+不留后路 13.2075304714
+施氏 12.2912397395
+滚柱 13.2075304714
+鉴貌辨色 12.5143832909
+郭二人 12.5143832909
+数百丈 13.2075304714
+旁征博引 11.7034530746
+择婿 11.8212361103
+薛大 12.8020653633
+温塘峡 12.5143832909
+养殖区 12.5143832909
+邵华泽 13.2075304714
+国家标准 8.60236028543
+挡到 13.900677652
+思理 13.900677652
+上膘 12.5143832909
+纸上 9.44633035572
+阿迪斯 13.2075304714
+行规 9.74179456862
+数百个 10.0720362555
+思琳 10.604840786
+贬褒 13.2075304714
+三寸丁 12.8020653633
+数百两 12.5143832909
+纸业 8.43684584695
+装设 10.533381822
+鬼点子 11.598092559
+屡受 10.533381822
+天威 9.62401153296
+肖智 11.7034530746
+号手 13.2075304714
+吴相公 12.5143832909
+归田 11.2616203224
+杨隆寿 13.2075304714
+挨饿受冻 12.5143832909
+马戏班 13.2075304714
+按例 11.0103058941
+万蕙 9.7898037878
+明刊 11.8212361103
+不尽一致 10.604840786
+欧元区 8.26588804881
+神情 6.99894044532
+凑齐 10.765183436
+机系统 12.1089181827
+左卫中 13.2075304714
+开水壶 13.2075304714
+心如金石 13.900677652
+恢宏大度 12.8020653633
+星联珠 11.9547675029
+国野 12.8020653633
+去角质 10.9562386728
+神思 9.94943393339
+侍臣 10.4349417492
+相谈甚欢 11.8212361103
+小女子 10.6818018271
+绝对优势 8.89673134603
+大事化小 11.1926274509
+纸人 10.2371160058
+张近仁 11.9547675029
+梁封季 13.2075304714
+多半会 10.8096351986
+按住 8.47133202302
+应带 12.8020653633
+神态 7.98717464634
+数字信号 10.765183436
+刺花 12.8020653633
+牺牲 7.00297270885
+数百亩 11.7034530746
+现有 6.30077569277
+樱花节 13.900677652
+秘传 11.5027823792
+楚楚可人 12.8020653633
+燃油锅炉 13.2075304714
+小女孩 9.23723855786
+神怪 10.2630914922
+水产品 8.99540287354
+耳环孔 13.900677652
+数百亿 11.3357282945
+抽屉锁 12.8020653633
+过失杀人 12.5143832909
+毛肉兼 11.7034530746
+应市 12.1089181827
+莫先乎情 13.900677652
+神性 10.2371160058
+哈立麻 12.8020653633
+仇人见面 13.2075304714
+综合国力 10.3743171274
+二百五十支 13.2075304714
+余厘米 12.8020653633
+塔波尔 13.2075304714
+王大真 12.1089181827
+齐相淖 13.2075304714
+记忆法 13.900677652
+工作难度 12.8020653633
+成唯识 11.598092559
+二百七十个 13.2075304714
+纸介 13.900677652
+秀润 10.8561552143
+邢道荣 13.2075304714
+训责 13.2075304714
+五六条 12.5143832909
+选择对象 12.5143832909
+候藏兵 12.5143832909
+几分钟 8.4980002701
+梁二州 13.2075304714
+神恩 12.1089181827
+一百张 11.8212361103
+数百份 13.900677652
+电视广播 10.8561552143
+老头子 8.28754954559
+道里 10.9562386728
+无止尽 13.2075304714
+同型配子 13.2075304714
+牵强 10.0294766411
+各有所爱 13.2075304714
+数百件 11.8212361103
+秘事 11.3357282945
+乌加里 12.5143832909
+滥造 13.2075304714
+收管 10.9049453784
+娃哈哈 9.58318953844
+思甜 11.1926274509
+新鲜空气 10.0088573539
+第四十四 12.5143832909
+另眼 13.2075304714
+贯彻实施 11.0674643079
+第四十回 12.2912397395
+火箭 7.22233553732
+霍格 13.2075304714
+轶闻 11.1280889297
+斯托特 13.2075304714
+演艺界 10.3453295905
+剪过 12.8020653633
+阿盟 12.1089181827
+绿茵场 13.2075304714
+狗日 8.98802276624
+行装 9.74179456862
+当真 7.86999239171
+数万口 11.8212361103
+应得 9.26594866375
+数万只 12.2912397395
+计量经济学 11.3357282945
+纵步 11.9547675029
+宇文护迁 12.8020653633
+纸伞 12.1089181827
+温菲尔德 12.8020653633
+灰鸽 13.2075304714
+千层底 11.7034530746
+冬青油 12.5143832909
+银荔 13.900677652
+兼行 10.7226238216
+五六杯 13.2075304714
+熏染 10.8561552143
+珍珠首饰 12.8020653633
+应征 9.56994431169
+鼓声 8.52539924429
+沈兼士 12.2912397395
+椭球 10.3743171274
+势所必至 13.900677652
+国都 8.81308131674
+软乎乎 12.8020653633
+仓惶 10.765183436
+詹姆斯河 13.900677652
+二异氰酸酯 12.8020653633
+瓦圈 13.900677652
+本世纪内 11.9547675029
+大中小城市 10.9049453784
+刘锦云 13.900677652
+参差错落 11.8212361103
+虎尾兰 13.900677652
+马尔斯 11.7034530746
+培育法 13.2075304714
+法印 11.9547675029
+第三十四条 12.2912397395
+侍者 9.75754292558
+鸡脚 13.2075304714
+凤台 11.1926274509
+稳定下来 9.93038573842
+月色 8.64840422393
+天子 7.4023955025
+年节律 13.900677652
+天字 11.1926274509
+即可 6.76897914151
+热情周到 12.5143832909
+船队 8.42003872863
+粹白 13.900677652
+当着 7.73736284794
+小星星 13.2075304714
+石化作用 13.900677652
+汴州 9.98865464655
+纵横驰骋 11.1280889297
+凶事 12.8020653633
+阿登 10.6818018271
+毋丘俭 11.0674643079
+呈子 12.8020653633
+纳克索 13.2075304714
+雾滴 11.4157710022
+即化 12.2912397395
+肖某 11.7034530746
+女权主义 12.2912397395
+克拉斯诺夫 13.2075304714
+绣金匾 13.900677652
+神意 11.5027823792
+肇东市 12.5143832909
+农牧渔业部 12.2912397395
+井口 9.65218240993
+吴建民 12.1089181827
+天官 10.1164880181
+三四十斤 13.900677652
+天宝 8.65365357982
+鄂尔多斯市 12.8020653633
+打喷嚏 9.82314020807
+同类项 11.7034530746
+井叔 13.900677652
+行行 10.9049453784
+负电子 13.2075304714
+玄德回 12.1089181827
+小姑妈 10.4349417492
+乍看 11.8212361103
+熏杀 13.2075304714
+天安 11.598092559
+食品药品 9.84023464143
+天完 10.9562386728
+环状软骨 13.2075304714
+天宁 12.2912397395
+家具商 13.900677652
+布丁 11.9547675029
+天宇 9.5186510173
+张仃 12.5143832909
+格罗皮 11.598092559
+生存斗争 11.4157710022
+量器 12.1089181827
+莫不是 8.9102450652
+赛斯纳 13.2075304714
+挑落 12.5143832909
+霍诺留 13.2075304714
+百夫长 12.2912397395
+训谕 12.1089181827
+肥西 12.1089181827
+姑妄听之 12.5143832909
+肖林 11.9547675029
+起驾 10.4349417492
+马也拉 12.5143832909
+飞矢 12.5143832909
+产品图片 13.900677652
+临江门 12.8020653633
+由学政 13.900677652
+指点江山 11.4157710022
+岘港 11.598092559
+国道 8.75901409547
+急诊 10.2630914922
+包揽词讼 12.5143832909
+摹状 13.900677652
+天寒 11.0103058941
+练子锤 13.900677652
+应当 6.08184520817
+敦煌研究院 12.5143832909
+天富 11.598092559
+介电常数 11.3357282945
+蔚然 12.8020653633
+数万匹 13.2075304714
+计生户 12.8020653633
+训过 13.900677652
+任质斌 12.8020653633
+做满月 12.5143832909
+那堪 11.9547675029
+檀越 11.0103058941
+已非 10.3453295905
+子理兄 11.8212361103
+采掘 8.82550383674
+园林 8.14493543839
+阻拦 8.53003962385
+船长 8.80692745117
+住院医生 13.900677652
+神技 12.5143832909
+布琼布拉 11.9547675029
+肝炎 9.02548032877
+阿桂代 13.2075304714
+不清不楚 11.4157710022
+精彩表演 11.3357282945
+罗德西亚 13.900677652
+战马 7.79811905736
+天堑 11.2616203224
+桀纣 12.2912397395
+都遵旨 12.5143832909
+清徐 12.5143832909
+兰村泉 12.1089181827
+起首 11.7034530746
+裘媸保 13.900677652
+上臂 10.9562386728
+天堂 8.50705010562
+一百五十余 12.1089181827
+阀值 10.533381822
+布衣卿相 12.8020653633
+净化环境 11.598092559
+毡笠 10.4666904475
+子伏 13.2075304714
+河北大学 11.9547675029
+丢下来 12.2912397395
+吃官司 10.604840786
+偏心圆 13.900677652
+拿不准 10.1871055853
+玄德唤 12.5143832909
+附议 11.9547675029
+冷眼 9.89334446674
+急行 11.1280889297
+阻抑 12.8020653633
+阻抗 10.2371160058
+所交 11.4157710022
+阿尔博 13.2075304714
+塞尔维亚语 12.1089181827
+拿不出 9.23723855786
+归真 10.9562386728
+雨点般 11.0674643079
+直接贸易 11.9547675029
+羊马 11.7034530746
+装甲车辆 9.48183704418
+闻使君 13.2075304714
+归省 11.9547675029
+同年龄 12.8020653633
+经理人 8.37124856446
+兽行 11.9547675029
+海珍 13.900677652
+急袭 12.1089181827
+采挖 13.2075304714
+即候 13.900677652
+阻扰 13.900677652
+王坚入 13.2075304714
+水芙蓉 12.5143832909
+兼课 11.3357282945
+刺股 13.900677652
+看笑话 10.9562386728
+来宾县 13.900677652
+船闸 9.36807815882
+父代 13.900677652
+轮作法 13.900677652
+瑞叔 13.2075304714
+兼语 13.900677652
+盲棋 12.8020653633
+专程 9.38981814546
+沟纹 12.1089181827
+流通股 7.32420808293
+马拉维湖 11.1926274509
+安居工程 11.0674643079
+神户 10.4994802703
+氢化钠 12.5143832909
+爱着 10.0720362555
+员工福利 12.2912397395
+应将 9.72629038208
+硅谷动力 13.900677652
+内省法 11.9547675029
+无土栽培 11.8212361103
+热平衡 10.9562386728
+执政府 11.1926274509
+采捕 11.598092559
+丁征正 13.2075304714
+思监 12.2912397395
+科技知识 11.8212361103
+美国康奈尔大学 10.604840786
+成型机 12.1089181827
+天声 13.900677652
+罐内 10.604840786
+本世纪初 10.533381822
+可燃性 11.5027823792
+大戏院 11.598092559
+地下仓库 11.9547675029
+冲片 13.900677652
+黄桥战役 11.8212361103
+阻截 10.604840786
+北京地区 9.24671730182
+天壤 12.1089181827
+帕森斯 10.642581114
+现实生活 8.30596627237
+马台国 11.598092559
+那司棋 13.2075304714
+广州市卫生局 12.5143832909
+几百万年 11.1926274509
+玄德喜 12.8020653633
+玄德喝 12.8020653633
+官议允 12.8020653633
+应届 10.2897597393
+唱独脚戏 13.900677652
+韶乐班 13.900677652
+王册命 12.5143832909
+口蘑 11.0103058941
+女法官 13.900677652
+肝火 9.84023464143
+茫茫人海 11.598092559
+发生变化 7.3741827924
+班大太监 13.2075304714
+天头 12.2912397395
+美国版 13.2075304714
+玄德命 12.8020653633
+熟透 10.1394775363
+当用 10.0720362555
+零售物价 13.900677652
+沿革 8.73589167805
+另用 11.9547675029
+阿瓦 10.765183436
+嫌贫爱富 12.1089181827
+局域 11.8212361103
+天大 8.26588804881
+蹼泳 11.9547675029
+触电时 13.2075304714
+华池县 13.900677652
+塌落 10.8096351986
+埃菲尔 13.2075304714
+武公 11.7034530746
+备好 9.96885201925
+天外 10.5684731418
+是非分明 12.8020653633
+玄德告 13.2075304714
+公鹿 11.8212361103
+神探 13.2075304714
+新斯科舍省 12.2912397395
+太元圣母 13.900677652
+一百五十两 11.0674643079
+井儿 12.8020653633
+天女 10.8096351986
+雾水 11.5027823792
+一百五十个 13.2075304714
+海猪 13.2075304714
+已阅 12.2912397395
+推卸责任 10.1394775363
+倪元璐 12.5143832909
+滚筒 10.4994802703
+马图里 12.1089181827
+一百五十万 11.9547675029
+防暑降温 12.2912397395
+公鸡 9.16447920358
+挡光 13.2075304714
+起风 10.3171587135
+观察团 11.4157710022
+二百二十卷 12.2912397395
+雾气 8.96620371885
+一百五十三 12.2912397395
+七十多种 13.2075304714
+外景地 13.900677652
+沉积物 8.31342899358
+起飞 7.85567233794
+玄德合 13.2075304714
+荔枝蜜 13.2075304714
+采择 11.1926274509
+詹姆斯湾 13.2075304714
+秦庭之哭 12.5143832909
+仓房 10.6818018271
+数万元 11.3357282945
+顾顾 13.900677652
+可扩展性 12.8020653633
+家居环境 13.900677652
+倾国倾城 11.5027823792
+由云杉 12.8020653633
+书画展 12.8020653633
+海猿 12.8020653633
+北德文 11.7034530746
+几百万开 13.2075304714
+抱屈 11.1926274509
+风满楼 13.2075304714
+阿瑟 10.765183436
+独木桥 10.1871055853
+专章 11.7034530746
+释典 12.8020653633
+释兵 13.900677652
+急要 11.1280889297
+防爆膜 11.7034530746
+马西埃 13.900677652
+一室生春 13.900677652
+左右幕 13.900677652
+慎抗疏 13.2075304714
+丁王 13.2075304714
+冷盘 11.9547675029
+波涛滚滚 12.8020653633
+阿琼 12.1089181827
+天姿 12.8020653633
+搁架 13.2075304714
+阿琳 13.2075304714
+一百五十亩 13.2075304714
+释儒 12.8020653633
+李仁福 13.2075304714
+阻挡 7.95525704337
+阻挠 8.40761620864
+阿琪 12.8020653633
+船钱 11.598092559
+拉姆伯爵 12.5143832909
+百二十卷 12.8020653633
+强盗 8.65893063692
+凯尔特人 11.4157710022
+立宪之 13.2075304714
+郁闭 11.0103058941
+新路子 10.9562386728
+即兴 9.19114745066
+一百五十五 12.8020653633
+局地 10.4041700905
+正点率 13.900677652
+均贫富 11.598092559
+郁闷 9.05649056552
+人事制度 11.8212361103
+胆大心雄 13.900677652
+侯亲晋 13.2075304714
+扎根串连 13.2075304714
+王老九 11.8212361103
+直直的 10.6818018271
+威胁 6.53044701017
+四面山 12.2912397395
+机械唯物主义 11.0103058941
+行路 10.3453295905
+商量一下 9.45802639549
+取下 8.81927328699
+养殖场 10.0940151622
+高谈阔论 9.93038573842
+十七首 13.900677652
+寿阳县 12.8020653633
+项饰 13.2075304714
+森林公园 9.63799777493
+罗江科 13.2075304714
+伯勒 12.2912397395
+月白风清 11.9547675029
+安全类 11.3357282945
+封召公 12.5143832909
+天帝 10.4041700905
+李衮 9.63799777493
+代诗文 13.2075304714
+无头告示 13.2075304714
+宗教法庭 11.598092559
+用人观 12.5143832909
+国际商会 11.1280889297
+贵妇人 10.4666904475
+牺盟 13.900677652
+乐观其成 12.8020653633
+闻玉帝 12.5143832909
+寸口 11.8212361103
+王大珩 12.5143832909
+毛燮均 12.8020653633
+荒漠气候 10.9049453784
+马格罗 12.5143832909
+宫灯 9.43476953332
+没说的 11.3357282945
+润湿性 12.5143832909
+道长 10.2371160058
+秦川发展 10.3453295905
+无止境 10.9049453784
+血管性 10.7226238216
+取义 11.7034530746
+天平 9.04864738806
+抱定 10.1871055853
+天年 11.7034530746
+国闻 13.2075304714
+卿卿我我 11.7034530746
+冷然 11.3357282945
+伯力 11.2616203224
+王俭 12.8020653633
+事过境迁 11.598092559
+绿黄色 11.9547675029
+蚊蝇 11.598092559
+普遍真理 11.598092559
+国门 9.65218240993
+服务舱 11.4157710022
+阿玛 9.30555780184
+伯努 13.900677652
+伯助 13.2075304714
+文山会海 12.2912397395
+沿途 8.0484751722
+天幕 10.0088573539
+冷焊 13.2075304714
+书画家 10.4349417492
+卫吾 12.5143832909
+华西医科大学 12.2912397395
+揪人心肺 13.2075304714
+阿玉 12.1089181827
+量变 9.82314020807
+伯劳 12.8020653633
+平均水平 7.64492761022
+吃水 8.71329184614
+辛勤耕耘 12.2912397395
+食用动物 12.5143832909
+抱存 13.900677652
+钱租 13.2075304714
+玄德叹 12.1089181827
+西方哲学 10.2630914922
+超上 13.900677652
+美国国会参议院 13.2075304714
+天庭 10.765183436
+录用 9.08039608637
+行走 7.69007757495
+段浩然 13.2075304714
+吉田耕造 13.2075304714
+一模一样 8.60737282725
+合欢花 12.2912397395
+吃法 10.0088573539
+在野派 12.2912397395
+采收 9.93038573842
+瞒骗 12.1089181827
+程国平 13.2075304714
+天府 8.82550383674
+行赏 11.7034530746
+急躁 9.27570483869
+正确处理 9.20019728618
+释器 13.2075304714
+迫切性 10.3171587135
+玉昔帖 11.1926274509
+量化 7.88941047757
+钩挂 12.2912397395
+希法亭 12.5143832909
+天庆 11.0674643079
+公馆 8.84443184663
+行货 10.2630914922
+帅高俅 12.8020653633
+立地条件 11.2616203224
+那陵提 13.2075304714
+费戈伦 13.900677652
+山海工 13.2075304714
+一胎化 13.2075304714
+剿灭 8.83808261895
+道门 11.5027823792
+烟树 13.900677652
+碳氢 12.2912397395
+口耳 12.2912397395
+行贿 9.22784881751
+计算公式 10.0294766411
+袁谭引 13.2075304714
+仆佣 13.900677652
+路由器 11.5027823792
+敞篷车 12.1089181827
+取代 6.55919379961
+判处刑罚 11.9547675029
+伯利 11.7034530746
+沃里克郡 13.2075304714
+言笑自若 13.900677652
+有心人 10.2630914922
+吃油 12.5143832909
+期初数 13.900677652
+参政议政 11.598092559
+移宫换羽 13.900677652
+七百三十万两 12.2912397395
+荒疏 11.7034530746
+挡回 13.2075304714
+捅穿 11.1280889297
+第宅 11.3357282945
+桦树皮 11.0103058941
+彦涵 12.2912397395
+口臭 10.1164880181
+恒齿 13.900677652
+毛生 13.2075304714
+掌骨 11.3357282945
+贺循至 13.2075304714
+沃斯佩 13.2075304714
+乍现 12.8020653633
+历克塞 12.2912397395
+饱览 10.9049453784
+颠倒乾坤 13.2075304714
+狱长 11.598092559
+塑身 11.4157710022
+伯叔 11.1280889297
+受难日 12.8020653633
+采撷 11.4157710022
+已遵 13.900677652
+军事基地 9.56994431169
+天弓 11.5027823792
+幽默滑稽 13.2075304714
+公顷 7.94743431769
+量力 13.2075304714
+高于一切 10.4994802703
+过错责任 12.2912397395
+天开 10.9562386728
+米哈伊 12.1089181827
+公顺 12.5143832909
+评议会 10.4349417492
+公平性 10.6818018271
+九月初 10.1394775363
+处处设防 12.8020653633
+历史档案 11.7034530746
+局内 12.8020653633
+已逝 11.4157710022
+完全符合 9.40086798165
+信仰自由 11.3357282945
+汉言彰 13.2075304714
+丝光棉 13.2075304714
+贤内助 11.598092559
+捐款人 12.8020653633
+已退 11.9547675029
+留守处 11.1926274509
+神族 13.900677652
+贼心 11.0674643079
+农林牧渔 9.35738286971
+阻断 9.17328983326
+少气无力 13.900677652
+金桂便 12.8020653633
+百科知识 13.2075304714
+顾麟 13.900677652
+养阴润 12.5143832909
+张超 10.2117981979
+安道全 10.1394775363
+国铁 13.2075304714
+蚊虫 9.72629038208
+于钦察 11.9547675029
+元谋人 10.9049453784
+涌水量 10.3743171274
+吆喝声 10.533381822
+柯瓦列 12.5143832909
+虞兮虞 13.2075304714
+被告方 11.8212361103
+脑科学 13.2075304714
+虞思 13.2075304714
+恶之花 11.8212361103
+冷热 9.58318953844
+袁尚引 12.8020653633
+天德 10.533381822
+备忘 11.9547675029
+冬青树 12.1089181827
+纯数学 12.2912397395
+尉迟敬德 12.2912397395
+蚊蚋 12.8020653633
+间接地 9.10488710638
+月蚀 11.4157710022
+冠名 10.5684731418
+犯了难 11.7034530746
+加强指导 12.2912397395
+阿牛 13.900677652
+主旋律 9.54396882529
+余氏勤 12.5143832909
+指令和数据 12.2912397395
+主送 13.2075304714
+道钉 12.8020653633
+局内人 13.900677652
+栈道 9.29550746599
+阿片 12.2912397395
+量刑 9.53122979951
+口腔 8.52078029844
+商品输出 11.9547675029
+神教 13.2075304714
+急迫 9.40086798165
+出操 11.8212361103
+阿爷 12.1089181827
+硅铁 12.1089181827
+诸遂良 13.2075304714
+黄县 12.2912397395
+古语词 13.900677652
+采摘 9.34680076038
+神效 11.4157710022
+横山县 12.1089181827
+诸阿哥 13.900677652
+工人贵族 12.8020653633
+当班 11.0103058941
+鬼使神差 10.7226238216
+施佩曼 12.2912397395
+干些 10.2117981979
+围观者 10.5684731418
+应季 13.2075304714
+冷点 13.2075304714
+热管 11.1280889297
+米高梅 10.765183436
+取信 12.2912397395
+氯酸钾 11.8212361103
+王大爷 11.1926274509
+伐木业 12.1089181827
+玄德力 13.900677652
+滞销货 13.900677652
+特权阶层 11.5027823792
+野炊 11.9547675029
+屈文中 12.8020653633
+真人秀 12.2912397395
+莫不成 12.8020653633
+天心 9.85762638414
+氯酸钠 12.8020653633
+中山王 11.1280889297
+一壶水 11.598092559
+潜水面 12.1089181827
+又静 12.5143832909
+玄德具 12.8020653633
+训诂 9.77354326693
+训词 13.900677652
+口苦 10.1871055853
+荚膜 10.8561552143
+茅仙 11.9547675029
+行述 12.2912397395
+玄德入 11.598092559
+训话 10.0088573539
+需将 11.0103058941
+副井 13.900677652
+分众传媒 11.8212361103
+肠梗阻 10.8096351986
+玄德公 12.2912397395
+行迹 10.765183436
+批下 11.5027823792
+批上 12.8020653633
+良久良久 13.2075304714
+尹默 13.2075304714
+家庭不和 12.2912397395
+肖恩 11.1926274509
+阿燕 13.900677652
+完全气体 12.8020653633
+帅臣 12.8020653633
+肖息 13.2075304714
+三四十户 13.900677652
+天尊 9.82314020807
+竞购 9.17328983326
+行运 12.8020653633
+训诲 11.5027823792
+战鹰 13.900677652
+犯了错 11.9547675029
+行进 8.32094782599
+天将 9.82314020807
+建业队 10.0088573539
+竞赛 8.1902506346
+国音 12.2912397395
+鬼主意 11.1926274509
+天山 7.99804431857
+应声 8.07173203437
+骨瓷 11.8212361103
+服务者 11.8212361103
+量出 12.2912397395
+乐滋滋 12.5143832909
+列鼎而食 13.900677652
+茅亭 13.900677652
+布热津斯基 12.5143832909
+干亲 11.7034530746
+驾驶证 9.06439574502
+竞走 11.2616203224
+神曲 10.2630914922
+生相 13.2075304714
+思特 13.2075304714
+鲍里斯 11.0674643079
+行辈 13.900677652
+六顷 13.2075304714
+行辕 8.25877058104
+风池穴 13.900677652
+副价 12.8020653633
+川西平原 11.3357282945
+夜中 10.4994802703
+六项 10.1394775363
+局势 7.4023955025
+碧云寺 11.8212361103
+行车 8.39128931535
+喜帖 13.900677652
+宠辱皆忘 13.2075304714
+沙石路 13.2075304714
+宋长志 12.8020653633
+数千团 13.2075304714
+六颗 12.1089181827
+左步青 11.2616203224
+副业 9.37888907493
+神明 9.05649056552
+神昏 10.4994802703
+百分之十七点三 13.900677652
+冻雨 11.0103058941
+好言好语 12.1089181827
+方寸之地 12.8020653633
+优裕 10.7226238216
+和弗兰 13.900677652
+马尔托 12.5143832909
+月薪 10.1871055853
+庆祝会 13.2075304714
+界限 7.59989185731
+亮闪闪 11.1280889297
+行为矫正 13.2075304714
+第四十八 12.8020653633
+别无二致 12.1089181827
+分泌乳汁 11.9547675029
+采木 12.8020653633
+平静下来 9.05649056552
+维舍特 12.8020653633
+谌蓟 11.9547675029
+巫之别 13.2075304714
+一二百里 12.2912397395
+乌得勒 11.3357282945
+养阴清 11.1280889297
+数万名 10.9049453784
+亲眼目睹 9.59661255877
+救驾 10.8561552143
+小茴香 11.8212361103
+艾利森 11.9547675029
+一千二百九十七所 13.2075304714
+艾伯 12.8020653633
+量具 10.8561552143
+泰山路 13.2075304714
+菲利波 12.1089181827
+施用 9.35738286971
+批价 13.900677652
+批件 11.598092559
+红三连 11.3357282945
+神智 9.87532596124
+武勋 12.1089181827
+安全线 13.900677652
+国青 12.8020653633
+玄德军 13.2075304714
+玄德写 13.2075304714
+数万吨 11.9547675029
+钟鼎文 13.2075304714
+郑为元 12.5143832909
+马尔戈 12.8020653633
+海带丝 13.900677652
+施拉姆 11.8212361103
+采暖 10.2117981979
+总寨 12.5143832909
+横穿过 13.2075304714
+桑普多利亚队 13.900677652
+夜作 12.1089181827
+国难 10.3743171274
+重重地 9.00283785202
+郭雍 13.900677652
+施瓦 12.2912397395
+六餐 13.900677652
+座山雕 12.8020653633
+双燃料 12.1089181827
+并不为过 13.2075304714
+假信号 13.900677652
+公马 11.7034530746
+封常洵 13.2075304714
+班德 10.765183436
+格鲁申 13.2075304714
+天崖 12.2912397395
+神枪 11.8212361103
+可心如意 13.900677652
+成真丹 13.2075304714
+革命性 9.41204128224
+愚弄百姓 11.9547675029
+艾什 11.598092559
+刘伯温 10.2897597393
+秦山 10.533381822
+救回去 13.900677652
+挑花 11.7034530746
+弹掉 13.2075304714
+鳃裂 10.9049453784
+阿炳 6.80395627348
+南美地区 12.8020653633
+肝病 9.41204128224
+荒瘠 12.8020653633
+牛肉店 13.900677652
+实际性 11.9547675029
+菲利浦 10.604840786
+战鼓 9.56994431169
+假模假式 12.1089181827
+急赶 11.598092559
+半夜三更 9.96885201925
+羊齿 11.1926274509
+好几间 13.900677652
+吕伯望 13.900677652
+忠烈 10.6818018271
+记出 13.900677652
+现是 11.7034530746
+国雄 11.2616203224
+水泄银 13.2075304714
+上肢 9.98865464655
+船速 11.3357282945
+借题发挥 10.5684731418
+隋炀帝 9.08039608637
+求觅 13.900677652
+合法权利 10.8561552143
+伯克 9.15574552361
+国防 7.45654639528
+饴糖 11.4157710022
+减削 12.5143832909
+纺织设备 11.3357282945
+看不清 8.46695564842
+于钦天 12.8020653633
+友谊比赛 13.900677652
+六首 11.9547675029
+应天 9.58318953844
+衰萎 12.8020653633
+应大 13.2075304714
+晶须 12.2912397395
+里雅宾 13.900677652
+国土资源 9.45802639549
+神机 10.3453295905
+宋淳化 13.2075304714
+督导员 13.2075304714
+固定设备 13.900677652
+改变方法 13.900677652
+一下半 12.8020653633
+阳历年 12.1089181827
+神木 9.27570483869
+靶细胞 11.0674643079
+花卉盆景 13.900677652
+神术 11.8212361103
+进水塔 13.2075304714
+名闻中外 12.1089181827
+谌容 13.2075304714
+情侣装 13.2075304714
+惠灵顿 10.9049453784
+神乎其神 10.4041700905
+艾丽 12.8020653633
+建筑工程 9.24671730182
+上海市第一中级人民法院 12.5143832909
+井喷 8.70772080109
+行踪 8.97342396682
+临时代办 13.2075304714
+巨雷 11.8212361103
+郁金 11.598092559
+冲着 8.13235665618
+宗教观 11.8212361103
+莫日根 13.900677652
+闲庭 12.1089181827
+标榜着 13.900677652
+安蒂奥基亚省 13.900677652
+前车可鉴 13.900677652
+性暴力 13.900677652
+锋线 12.1089181827
+熟铁 10.642581114
+伍跃 11.2616203224
+伯克利大学 12.1089181827
+小胡桃 13.2075304714
+宝中铁路 13.2075304714
+沉积相 11.598092559
+耶戈尔 13.2075304714
+脚底流脓 12.5143832909
+营私 11.0674643079
+国际 4.47321180101
+李振邺 9.72629038208
+滚翻 11.598092559
+离家出走 10.4666904475
+民生涂炭 13.900677652
+神来 8.50705010562
+血红蛋白 9.11318590919
+拉歌 12.8020653633
+隋代 8.73589167805
+马尔泰 11.8212361103
+冻顶 13.2075304714
+盲打 13.900677652
+肥肥 11.7034530746
+拿不定 9.27570483869
+李亚仙 12.8020653633
+掌鞭 13.900677652
+天坛公园 12.8020653633
+安道尔 9.61021821083
+行至 8.39941944143
+小豆豆 13.2075304714
+六队 12.2912397395
+肥育 10.9562386728
+玄德归 12.8020653633
+玄德当 13.2075304714
+肥肉 9.62401153296
+编织物 12.2912397395
+水产局 11.8212361103
+安全灯 13.2075304714
+六阳 12.5143832909
+海狸 11.0103058941
+阿翁 12.5143832909
+天分 10.8096351986
+装上去 13.2075304714
+复盘 11.8212361103
+填补空缺 13.2075304714
+董卓入 12.5143832909
+乌陇古 13.2075304714
+康才堪 13.2075304714
+二十厘米 12.2912397395
+伯府 10.8096351986
+何宝贝 13.2075304714
+选择定则 11.5027823792
+督导室 12.5143832909
+名人赛 13.900677652
+山海关 7.73316116109
+第四 6.84277971456
+独门独院 11.9547675029
+元青花 13.2075304714
+阻梗 13.900677652
+长揖 10.5684731418
+层积材 12.8020653633
+武力威胁 10.9049453784
+先君 11.4157710022
+系统分析 9.93038573842
+阿美 10.765183436
+丧亡 12.1089181827
+南天竹 13.2075304714
+几内亚共和国 13.2075304714
+糜诮 11.9547675029
+肥胖 8.30969067146
+地址栏 13.900677652
+普通干部 12.8020653633
+通衢大道 12.8020653633
+振臂一呼 11.4157710022
+不知其所以然 12.8020653633
+吃惊 7.08613475472
+晶面 10.9049453784
+另纳 13.900677652
+掺杂剂 13.900677652
+挑起 8.48457724977
+华胜天 12.8020653633
+楼上住户 13.900677652
+碎影 12.8020653633
+布伦 11.0674643079
+准确度 9.91169360541
+丁晋存 10.8096351986
+障眼法 10.604840786
+电子文本 13.2075304714
+电机系 11.0103058941
+当红 10.2897597393
+詹姆斯敦 12.2912397395
+局属 13.2075304714
+布罗克豪 11.598092559
+机械装备 11.7034530746
+王伦 9.45802639549
+冲破 8.41588071849
+身中数弹 13.2075304714
+神格 13.900677652
+各谋出路 13.2075304714
+马纪壮 12.2912397395
+阿罗 10.4041700905
+诘责 12.2912397395
+玄德忙 12.8020653633
+公门 11.3357282945
+于赫梯 12.5143832909
+行腔 10.6818018271
+备勤 13.900677652
+甘宁领 12.8020653633
+剪下 10.8561552143
+不辨真伪 12.2912397395
+月计 13.900677652
+把舵 11.5027823792
+苯丙酸诺龙 12.8020653633
+海螵蛸 12.5143832909
+周巍峙 13.2075304714
+汉官士 12.8020653633
+徐规林 13.2075304714
+备办 10.0720362555
+终明之 13.2075304714
+多如牛毛 10.8096351986
+郁黑 13.900677652
+一艇 13.2075304714
+第七十五回 12.2912397395
+摇铃 11.3357282945
+林格伦 12.8020653633
+翠黛 13.900677652
+金融资产 8.81927328699
+胡闰 13.900677652
+滚热 10.9049453784
+超出范围 13.900677652
+川西高原 10.8096351986
+问问看 13.2075304714
+深圳发展银行 10.9562386728
+滚烫 9.41204128224
+船龄 12.2912397395
+李园妹 13.900677652
+游乐业 13.900677652
+亡命天涯 12.2912397395
+六零 11.598092559
+平鲁县 13.2075304714
+屋面板 13.900677652
+拉武 13.900677652
+倒杯水 12.2912397395
+口谕 9.22784881751
+军事援助 10.4994802703
+有长有短 11.3357282945
+冯陈 13.900677652
+农民战争 9.37888907493
+量度 9.6811699468
+以点带面 13.900677652
+阿维 12.8020653633
+冻饿 12.8020653633
+忠纯 13.900677652
+归类 9.98865464655
+缜密性 13.2075304714
+经济收益 11.5027823792
+多日未见 13.900677652
+中心地带 10.3743171274
+一念之误 13.900677652
+汤姆生 12.8020653633
+浪漫性 13.2075304714
+西奥斯 12.2912397395
+成型法 12.8020653633
+至爱 10.6818018271
+文采风流 13.2075304714
+疟原虫属 13.900677652
+抱团 9.96885201925
+煤业 9.26594866375
+思索 8.00078029839
+阿细 11.9547675029
+兼职 9.27570483869
+横刀立马 12.1089181827
+李王拜 13.2075304714
+固相聚合 13.900677652
+绿羽 12.5143832909
+人防办 11.8212361103
+阿纳 10.4666904475
+增感剂 13.2075304714
+精通法律 13.900677652
+爱尔兰人 10.4349417492
+天卫 12.2912397395
+供应船 12.5143832909
+退休年龄 11.598092559
+阿约 13.900677652
+蚕茧 9.19114745066
+关定 13.900677652
+另置 10.6818018271
+前仆后继 10.2897597393
+六面 11.8212361103
+后七子 10.765183436
+释家 12.1089181827
+朱增泉 13.2075304714
+天南 11.2616203224
+应城 10.1164880181
+通政院 12.8020653633
+天半 12.2912397395
+试教 13.900677652
+闻铃 11.9547675029
+天华 11.598092559
+伯德 11.2616203224
+格劳斯 13.900677652
+国风 10.1630080337
+鼓励性 11.5027823792
+普遍推行 11.3357282945
+备受 7.50374799676
+馆子 10.1871055853
+四十九岁 12.8020653633
+凿岩机 11.9547675029
+打火石 12.5143832909
+公铁 11.9547675029
+石康 13.900677652
+释子 13.900677652
+周慧敏 11.7034530746
+纳爱斯 11.9547675029
+明正其 12.8020653633
+应在 7.96843246453
+虞氏 11.5027823792
+亚历山大 8.12302532875
+其言也善 12.1089181827
+北大法学院 11.7034530746
+魏德金 12.5143832909
+全息照相 11.8212361103
+夏目漱石 11.598092559
+采样 10.1630080337
+尤晓畅 13.2075304714
+天原 12.1089181827
+遭袭 12.5143832909
+集体婚礼 11.4157710022
+恢复器 13.900677652
+一百一十七个 13.900677652
+肥胖者 10.3171587135
+择取 12.2912397395
+网上游戏 13.2075304714
+化生寺 12.5143832909
+不良嗜好 11.7034530746
+李义府 11.8212361103
+左右逢源 10.604840786
+化学发光 11.2616203224
+煤井 12.5143832909
+水笼头 13.2075304714
+航空港 8.81308131674
+井宿 12.5143832909
+采桑 12.2912397395
+天台 9.71102290995
+九月底 10.765183436
+岂不是 8.11071748108
+钙片 11.8212361103
+妻离子散 10.8561552143
+哀牢夷 11.4157710022
+衰落 7.38893232233
+兹曼 10.0294766411
+肥腻 11.5027823792
+煤价 8.79473217808
+冰冻期 11.0674643079
+郑语 11.9547675029
+尉兼 13.2075304714
+郑译 12.2912397395
+天变 11.8212361103
+杨谱生 13.2075304714
+行者 6.45001685576
+继发龋 12.8020653633
+免调 12.8020653633
+姬鼠 12.1089181827
+六韬 10.7226238216
+罗布麻 11.5027823792
+福尔摩斯 12.1089181827
+农艺学 11.598092559
+郑证 13.900677652
+革故鼎新 12.1089181827
+冻馁 12.2912397395
+挡寒 12.2912397395
+左拐进 13.2075304714
+沙恭达罗 11.3357282945
+差异性 9.80633308975
+代市长 11.1926274509
+能源价格 9.40086798165
+乌干达 9.58318953844
+菌种 10.5684731418
+武帝太 11.2616203224
+喘嘘嘘 12.1089181827
+溢彩 12.5143832909
+附会 10.2117981979
+冲突 7.13218444033
+打寒噤 13.2075304714
+徐梦莘 13.2075304714
+开门红 8.21709788464
+归置 12.2912397395
+那杭 13.900677652
+归罪 11.7034530746
+天候 11.2616203224
+猪食 11.3357282945
+马尔滕 12.5143832909
+先行官 13.2075304714
+顾金 13.900677652
+塑膜 13.2075304714
+革命派 9.49395840471
+密信 10.7226238216
+即墨 10.4994802703
+顾野 12.8020653633
+冰河时代 12.8020653633
+撞钟 11.4157710022
+牢骚 9.54396882529
+孙中山 7.36253782821
+陪都 10.1871055853
+郭祥直 13.2075304714
+山海卫 8.98802276624
+富拉尔基区 12.8020653633
+党的性质 12.8020653633
+磁化水 13.900677652
+静如处子 12.5143832909
+另类 9.23723855786
+痛不痛 12.1089181827
+伯署府 12.8020653633
+冷缩 12.5143832909
+秀朗 13.2075304714
+声能通量 13.900677652
+吃成 11.8212361103
+艾贝尔 13.2075304714
+乡村人口 11.9547675029
+伯岩 12.2912397395
+官公宇 13.2075304714
+起重 9.93038573842
+恒速 12.5143832909
+真假难分 12.2912397395
+水仙花 10.9049453784
+熟饭 11.4157710022
+急聘 13.900677652
+楚俱 13.2075304714
+汤母 13.2075304714
+物极必反 10.533381822
+脱离生活 12.2912397395
+八周年 13.900677652
+乳牙 11.8212361103
+正片 12.2912397395
+插上来 12.5143832909
+訾议 13.900677652
+应否 11.1926274509
+老头儿 8.33233314821
+小斗篷 13.900677652
+玄德差 12.8020653633
+侍读 10.4666904475
+冲程 10.6818018271
+郝旦 13.2075304714
+认真对待 10.3453295905
+汪洋大海 10.2630914922
+亲日 11.0674643079
+制造术 13.2075304714
+眼高于顶 13.900677652
+行草 11.2616203224
+六钱 12.2912397395
+私人关系 11.4157710022
+加工出口 11.0103058941
+井壁 10.3743171274
+陪送 11.3357282945
+制造机 12.8020653633
+歪主意 11.9547675029
+安培计 13.2075304714
+福尔班 13.2075304714
+施礼 8.64318227995
+密会 13.900677652
+肥西县 13.900677652
+拉比 11.3357282945
+成年期 11.7034530746
+目地 13.2075304714
+中文名称 10.2371160058
+秀林 12.5143832909
+纽约卡内基音乐厅 13.2075304714
+救险 12.5143832909
+伯尔 10.8096351986
+左夫人 11.5027823792
+装起 11.5027823792
+空想社会 13.900677652
+推理题 12.8020653633
+主渠道 10.9049453784
+二进制码 13.900677652
+小女儿 9.63799777493
+秃宝盖 13.900677652
+出版业 10.0940151622
+万天 13.2075304714
+第周 12.5143832909
+欲海难填 13.900677652
+竞自 13.2075304714
+伯尼 12.8020653633
+国魂 12.2912397395
+中国人民外交学会 11.598092559
+提级 13.2075304714
+云青 12.5143832909
+宣宗离 12.8020653633
+耄耋 12.8020653633
+天儿 11.0674643079
+那龙 11.5027823792
+骑进来 12.8020653633
+三亿五千万元 13.2075304714
+怪不得 8.60236028543
+正直者 13.2075304714
+薛世雄 13.2075304714
+楚亚 12.2912397395
+唐安西 11.4157710022
+口述 9.85762638414
+当紧 11.3357282945
+营田 10.8561552143
+精诚合作 12.2912397395
+摸营 13.900677652
+已然 8.50251495046
+密件 10.765183436
+神殿 9.20019728618
+掌三公 13.2075304714
+皓发 12.2912397395
+薛所创 13.2075304714
+多通道 11.9547675029
+典故 9.12155415886
+钩沉 11.1280889297
+营生 9.16447920358
+密令 10.3453295905
+楚人 10.4349417492
+国骂 12.8020653633
+抹黑 10.6818018271
+合久必分 12.1089181827
+玄德屏 13.2075304714
+竞聘 12.2912397395
+密云 9.45802639549
+六镇 10.4994802703
+一笑千金 13.2075304714
+四五里 10.9049453784
+塑胶 9.74179456862
+盛怒之下 11.3357282945
+功用 9.12999302751
+天兵 9.69598503258
+天兴 9.75754292558
+天全 11.0674643079
+口边 10.2630914922
+延年益寿 10.4666904475
+辽宁大连 11.4157710022
+夏威夷大学 12.1089181827
+肖洛 12.2912397395
+色情广告 13.900677652
+酸酐 10.4349417492
+广大党员 11.0674643079
+服务费 10.0294766411
+久战沙场 12.8020653633
+革命圣地 11.4157710022
+天兔 12.2912397395
+天光 9.32596667347
+虎咽狼吞 13.900677652
+连声称好 12.5143832909
+反潜艇 13.2075304714
+四十九年 11.598092559
+唧唧喳喳 12.2912397395
+天元 10.0088573539
+哪些 7.17925195119
+匾文 13.900677652
+威达 10.7226238216
+凑钱 11.0103058941
+花艺 13.900677652
+祖德赞 13.900677652
+董卓劫 13.2075304714
+惩罚性 9.61021821083
+天冲 12.2912397395
+阿米 11.2616203224
+日本电气株式会社 12.8020653633
+天冷 10.1164880181
+楚东 12.8020653633
+井姬 13.900677652
+传着 11.7034530746
+楚丘 12.8020653633
+天冬 12.8020653633
+狗贩子 13.2075304714
+第四十届 13.2075304714
+环境署 13.900677652
+绿肥红瘦 11.3357282945
+依命 11.5027823792
+至点 13.900677652
+归结 9.7898037878
+插足 11.1926274509
+予以安排 12.5143832909
+归给 13.900677652
+绿毛龟 12.8020653633
+冯铿 13.2075304714
+玛赫杜 13.2075304714
+云烟 10.1394775363
+肆口 12.1089181827
+密书 9.61021821083
+楚主 13.2075304714
+恒量 11.9547675029
+天内 8.68574189437
+留心看着 13.2075304714
+蠡沟 13.2075304714
+香港脚 12.8020653633
+熟食 9.69598503258
+吃掉 8.42421410004
+三十一枚 13.900677652
+几百万块 13.2075304714
+归纳 8.28027678626
+闻蜀兵 13.2075304714
+烧开 10.533381822
+丙戌年 13.900677652
+牛仔布 12.2912397395
+诺瓦克 13.2075304714
+勇于批评 13.900677652
+归约 12.8020653633
+王晓籁 12.8020653633
+王亭 12.2912397395
+半拉子 12.1089181827
+朝云暮雨 13.2075304714
+树欲静而风不止 11.4157710022
+蔬菜种子 12.8020653633
+多面 10.8561552143
+非洲开发银行 12.5143832909
+行船 9.89334446674
+班珠尔 11.7034530746
+迪庆藏族自治州 11.598092559
+宝甲 13.900677652
+滚珠 11.7034530746
+六门 11.0674643079
+陪酒 10.642581114
+临床经验 11.7034530746
+天凉 11.8212361103
+六间 11.8212361103
+武口 13.900677652
+王尊其 12.8020653633
+海牙 9.28555713513
+无话可说 9.20932976975
+行舟 11.3357282945
+大西海 12.5143832909
+神武 10.2117981979
+亲政 9.04864738806
+数据库机 13.900677652
+上不起 11.9547675029
+滚球 12.2912397395
+应劭 12.2912397395
+玄德学 13.2075304714
+番椒 12.8020653633
+高歌猛进 9.59661255877
+应加 11.3357282945
+应办 12.5143832909
+量完 13.900677652
+上官义驱 13.2075304714
+应力 8.48903160012
+记忆性 13.2075304714
+编选者 12.2912397395
+行藏 11.9547675029
+断壁残垣 11.5027823792
+雄州镇 13.2075304714
+赴考 11.8212361103
+集成式 12.5143832909
+最大者 9.91169360541
+机会 5.0174534217
+驯熟 13.2075304714
+十两八两 12.8020653633
+散失到 13.2075304714
+即度 13.900677652
+身担 13.900677652
+二十万套 11.9547675029
+当空 10.4349417492
+威风八面 11.8212361103
+烟雾弥漫 11.598092559
+革命意志 11.9547675029
+金属线材 13.2075304714
+尉李膺 12.5143832909
+横帆 13.2075304714
+生瑜 12.2912397395
+沿海各省 10.8561552143
+典型性 11.0103058941
+投过来 11.8212361103
+十七里 13.2075304714
+侍贵 13.2075304714
+眉头一皱 10.8561552143
+沟灌 13.900677652
+鸿蒙 11.3357282945
+青阳腔 12.8020653633
+易生 11.3357282945
+迥然不同 9.43476953332
+法律法规 8.1386262692
+恢复原 10.7226238216
+冯小刚 8.68574189437
+口袋 7.42063309005
+应募 10.4041700905
+繁殖行为 13.900677652
+甘露醇 10.8561552143
+石宝寨 12.8020653633
+鸣金击鼓 13.900677652
+国花 10.1630080337
+维基百科 13.900677652
+索子结 13.2075304714
+军刀 10.7226238216
+罗城仫佬族自治县 11.9547675029
+抱厦 11.2616203224
+南越国 12.8020653633
+田一郎 13.2075304714
+满朝文 11.1280889297
+机体 7.42524493527
+克尔诺夫 13.900677652
+农艺师 12.8020653633
+翟源 13.2075304714
+蚕蛾 11.0103058941
+蚕蛹 11.598092559
+莘莘学子 11.9547675029
+奥林匹克运动 11.8212361103
+刺身 12.8020653633
+应制 10.8561552143
+伯婆 13.900677652
+各执一词 10.533381822
+奥帕瓦 13.900677652
+神气 8.06294720481
+威行 13.2075304714
+应到 10.4994802703
+涂彩 12.8020653633
+基轴 13.900677652
+公正不阿 13.900677652
+哀牢山 10.4666904475
+项背相望 12.5143832909
+神氏 13.2075304714
+玄德寨 12.5143832909
+欣然 9.04086524761
+蔡温球 12.8020653633
+计划成本 12.8020653633
+和超镁 13.2075304714
+阀座 12.8020653633
+鸟叫 11.4157710022
+应列 12.5143832909
+国务院台办 13.2075304714
+神水 11.598092559
+哈茨 13.2075304714
+谢兴国 10.4994802703
+数万年 12.1089181827
+自由市场 10.2117981979
+起步价 10.3743171274
+苦心经营 10.4994802703
+即席 11.1926274509
+股票 4.76323060552
+应分 11.9547675029
+粤港澳 12.8020653633
+理好 12.5143832909
+讥笑 9.46986085313
+温喜按 12.2912397395
+政论家 10.3171587135
+资金来源 8.63281949291
+记叙 10.1394775363
+天国 9.80633308975
+天图 12.5143832909
+协议工 11.3357282945
+拔地而起 9.96885201925
+神汉 11.0103058941
+天园 11.1926274509
+赔到 13.2075304714
+典押 11.8212361103
+王亚 11.1280889297
+八十四位 13.900677652
+军制 9.80633308975
+备不住 11.9547675029
+三秒钟 12.5143832909
+井底 9.96885201925
+髯口 11.4157710022
+恒隆 12.2912397395
+能看懂 11.1280889297
+神池 11.8212361103
+遍山 11.9547675029
+焦土政策 12.1089181827
+另立 9.30555780184
+量子 8.61747392324
+应县 10.8096351986
+执政党 9.12999302751
+消心痛 12.8020653633
+宾夕法尼亚州 10.4349417492
+龙烟铁矿 12.8020653633
+公道 9.17328983326
+局委 13.900677652
+宇明 11.8212361103
+成祖优 13.2075304714
+天圣 10.3743171274
+安刘氏 12.8020653633
+投保单 12.2912397395
+大喝一声 9.25628675283
+宋有官 13.2075304714
+苏南地区 13.900677652
+机上 8.92394390956
+精加工 11.3357282945
+踢天弄井 12.1089181827
+施给 13.900677652
+龙血树 12.1089181827
+输油管道 9.80633308975
+顾雍 11.1926274509
+舞台灯光 13.900677652
+口角 9.45802639549
+姚氏幽 13.2075304714
+天圆 12.5143832909
+地边 10.9562386728
+偃师市 10.8096351986
+伯安 12.2912397395
+第叁 13.900677652
+地仙村 8.11685246965
+奎屯市 11.598092559
+公选 13.900677652
+杨可世 8.71329184614
+应可 11.1926274509
+应召 9.98865464655
+兼营 8.95903522937
+二百艘 13.2075304714
+恢复力 11.1926274509
+餐饮企业 10.6818018271
+街垒战 12.1089181827
+卫生费 13.900677652
+天坛 10.3171587135
+统战工作 11.7034530746
+应变 8.62256299275
+应取 11.4157710022
+应受 10.3453295905
+十七部 12.8020653633
+锯木厂 11.9547675029
+薄地 11.5027823792
+诸道肃 13.2075304714
+井式 12.8020653633
+秦皇汉 11.8212361103
+宦者 11.1280889297
+训育 12.5143832909
+被盗 8.97342396682
+小肠俞 13.900677652
+边看边说 12.2912397395
+深度计 13.900677652
+詹事府 10.3453295905
+年终总结 13.900677652
+姚绶 13.2075304714
+经验主义 10.3171587135
+睢宁县 12.5143832909
+功能键 11.7034530746
+该战 13.900677652
+双抢 13.2075304714
+统舱 12.1089181827
+预告片 11.8212361103
+人亡政息 11.8212361103
+赫穆德 13.900677652
+驾驶者 9.71102290995
+裂纹舌 13.900677652
+子京 11.5027823792
+乾安县 13.2075304714
+另算 13.2075304714
+毕功之 13.2075304714
+神洲 11.5027823792
+镇痛剂 11.7034530746
+阿修罗 11.7034530746
+亲家母 11.3357282945
+水球 11.0103058941
+物质文明 10.0720362555
+仙人 9.25628675283
+挑衅 9.20932976975
+郑辉 13.900677652
+机井 10.642581114
+内书堂 11.4157710022
+纪律检查 10.4041700905
+电机科 13.900677652
+吃斋 10.4041700905
+行营 9.5062284973
+思科 10.4666904475
+睿智 9.6811699468
+心神恍惚 10.765183436
+猪鼻 13.2075304714
+边红杏 13.2075304714
+宝钞库 11.4157710022
+应即 11.0674643079
+一百三十元 13.2075304714
+导赤散 12.8020653633
+应卯 12.5143832909
+已领 12.8020653633
+局外 11.7034530746
+那铁头 13.900677652
+一下头 10.0940151622
+公邑 13.2075304714
+四十五里 11.9547675029
+机件 10.533381822
+阐发 9.36807815882
+一百三十八 12.2912397395
+种子公司 13.2075304714
+泡得 12.5143832909
+起降 9.09665660724
+毫发无损 11.3357282945
+圣马利亚 13.900677652
+割腕自杀 13.2075304714
+丰功伟业 12.5143832909
+净资产 7.40089061132
+卧佛寺 10.8561552143
+广域网 11.4157710022
+衰减器 13.900677652
+天城 9.11318590919
+井径 13.2075304714
+贼头鼠脑 12.8020653633
+乘务组 13.900677652
+热核武器 12.5143832909
+石漠化 13.2075304714
+屡建奇功 11.1926274509
+舱体 11.8212361103
+顾闳 11.2616203224
+天启 8.3285236198
+舱位 11.9547675029
+偏食 10.533381822
+听听课 13.900677652
+供不起 11.9547675029
+天君 11.8212361103
+月费 12.8020653633
+毁伤 9.55687223012
+孟夫子 12.5143832909
+抱出 11.0674643079
+观察室 11.5027823792
+阻滞 9.20019728618
+阿科 13.2075304714
+时尚资讯 13.900677652
+髯儿 12.8020653633
+天合 10.9562386728
+于友道 13.900677652
+卫生保健 10.604840786
+天同 12.1089181827
+天后 8.73589167805
+和爱爱 11.4157710022
+纪律性 10.604840786
+苏美尔 9.75754292558
+阿秀 13.900677652
+肝糖 11.598092559
+天命 8.57766767284
+古董表 13.900677652
+墙门 11.5027823792
+六遍 12.8020653633
+西南大风 13.2075304714
+婉言拒绝 11.8212361103
+天周 13.900677652
+冻鸡 12.8020653633
+黑匣子 11.1926274509
+战队 12.5143832909
+电广传媒 10.2630914922
+割肚牵肠 13.900677652
+打下手 11.0103058941
+哺乳动物 8.25877058104
+冲绳 10.3171587135
+萨文比 13.900677652
+王菊珍 13.900677652
+秦少游 11.7034530746
+黄牛票 13.900677652
+阿福 12.8020653633
+玄德备 13.2075304714
+冷笑 7.23244940356
+秀挺 12.2912397395
+天呀 9.87532596124
+肖格 13.900677652
+战阵 9.69598503258
+少言寡语 11.2616203224
+数易其稿 13.900677652
+明摆着 8.92394390956
+节衣缩食 11.5027823792
+农作 10.0505300503
+迫击炮 8.50705010562
+酌予 13.900677652
+备品 13.900677652
+阿祥 13.2075304714
+一二百首 13.900677652
+即将 5.90705765715
+财务管理 9.41204128224
+鸡内金 12.1089181827
+起锅 10.9562386728
+五万头 13.900677652
+恋栈 12.8020653633
+抱养 11.9547675029
+黑虎星 8.98802276624
+英竣 12.8020653633
+相去 10.7226238216
+糜费 11.5027823792
+席卷而来 10.9562386728
+祁门县 11.598092559
+宋寨中 12.8020653633
+王回王 13.2075304714
+即属 11.0674643079
+王杨秀 13.2075304714
+攻击行为 12.2912397395
+冷箭 11.3357282945
+农会 10.765183436
+募兵制 10.765183436
+大家伙 10.0505300503
+释尊 13.900677652
+龙抄手 12.8020653633
+飞多高 12.8020653633
+第五十三回 12.5143832909
+山海城 9.61021821083
+爷儿俩 10.3171587135
+金石之言 12.8020653633
+王司马颖 12.8020653633
+烤炉 11.2616203224
+六部 8.34771806705
+耿炳文 13.900677652
+忧国忘身 13.900677652
+计算误差 13.2075304714
+免进 13.900677652
+重要著作 9.84023464143
+大仲马 11.3357282945
+证管办 13.900677652
+明白人 9.82314020807
+努力完成 12.5143832909
+船首 11.1926274509
+口误 12.1089181827
+农仓 12.5143832909
+口语 9.19114745066
+亚历山德 12.5143832909
+等值线 10.5684731418
+唐徕渠 12.5143832909
+秀才 8.13548654919
+二甲基二氯硅烷 13.900677652
+共聚一堂 12.2912397395
+歪歪扭扭 10.4666904475
+冯道 12.5143832909
+至理 11.0674643079
+口诵 11.4157710022
+耀武扬威 9.94943393339
+肖楠 12.2912397395
+侍蹇 13.2075304714
+建材业 11.8212361103
+口词 11.4157710022
+帽峰山 13.900677652
+网球场 11.1280889297
+口诀 10.1630080337
+采收率 12.1089181827
+吃来 13.900677652
+张迪 9.84023464143
+来宾市 12.8020653633
+应再 13.2075304714
+太空行走 11.7034530746
+魏王假 12.8020653633
+交通部 10.0720362555
+口译 12.8020653633
+光明大道 12.8020653633
+陆龟蒙 11.0674643079
+战靴 11.8212361103
+常绿阔叶 9.24671730182
+八卦阵 11.1280889297
+算不得 9.11318590919
+两国论 12.5143832909
+误犯 11.2616203224
+滚着 11.3357282945
+红学界 13.900677652
+当票 12.2912397395
+鲁西费 13.2075304714
+合唱团 11.2616203224
+咚咚声 13.900677652
+外经贸 11.7034530746
+农事 9.87532596124
+几十万斤 12.8020653633
+安葬费 13.900677652
+郑赐 13.2075304714
+三四十步 13.900677652
+第几 11.7034530746
+双引号 11.1280889297
+李圣杰 13.900677652
+怵头 12.5143832909
+农人 10.0088573539
+近两天 10.5684731418
+二姨妈 12.2912397395
+农产 8.79473217808
+二百四十名 12.8020653633
+鲜明对比 9.24671730182
+锡杖 10.642581114
+千瓦时 9.66657114738
+施粉 13.900677652
+欲擒故纵 11.1926274509
+归程 11.7034530746
+屡屡 8.66956903512
+吏目 10.8096351986
+宣怀当 13.900677652
+一路上 7.62028181302
+卡米耶 13.900677652
+北天极 11.1926274509
+承办权 12.5143832909
+井巷 11.8212361103
+马格瓦 13.900677652
+毁于 9.54396882529
+菲利斯 13.2075304714
+局子 10.642581114
+秀拔 12.8020653633
+八竿子打不着 11.8212361103
+倒包 13.900677652
+大家乐 13.900677652
+向背 10.765183436
+糜谷 11.1280889297
+非常简单 10.1394775363
+新嫁娘 11.5027823792
+而论 8.85082164473
+国鸟 11.9547675029
+但俊武 13.2075304714
+一下子 6.34424968254
+郑超 13.900677652
+肝素 11.0674643079
+锡林 11.9547675029
+占廷式 12.2912397395
+中青旅 11.5027823792
+必敬 13.900677652
+马路天使 11.4157710022
+任人宰割 11.0674643079
+郑芳 13.900677652
+戊申日 13.900677652
+六重 12.5143832909
+六里 11.9547675029
+农业 5.34811731672
+沙山 10.604840786
+电子字典 12.2912397395
+盲文 11.598092559
+绣房 11.4157710022
+九朝古都 12.1089181827
+刘江俞 12.5143832909
+纳斯达克 7.84155445639
+反接 13.900677652
+爷儿们 11.1926274509
+语义上 13.900677652
+怡情 11.9547675029
+孝女 11.5027823792
+第六 8.00078029839
+第八 8.29120585679
+卖好 11.9547675029
+简便易学 13.900677652
+自杀式 11.2616203224
+废然而返 13.900677652
+伯夷 11.3357282945
+一百三十卷 12.1089181827
+收租 10.1871055853
+无可限量 13.2075304714
+择善 13.900677652
+排除万难 11.598092559
+滚石 11.0103058941
+二千个 13.2075304714
+史维华 12.5143832909
+强的松 11.7034530746
+阿布西 13.900677652
+峰高 10.765183436
+存储保护 12.5143832909
+鼓励奖 13.900677652
+采写 11.1926274509
+一箭之地 10.7226238216
+软腐病 11.8212361103
+电视广告 11.0103058941
+跳进来 11.8212361103
+流胶病 13.900677652
+贯例 13.2075304714
+弄翻 12.8020653633
+金翅鱼 12.8020653633
+限价 9.24671730182
+人在曹营心在汉 13.900677652
+采冶 11.0103058941
+孟什维克 10.3743171274
+睿宗 10.533381822
+坠下 10.5684731418
+立体电视 12.8020653633
+龙睛 12.5143832909
+表露 9.44633035572
+左平 13.2075304714
+省悟 9.96885201925
+中醒 11.1926274509
+营业 6.54248389924
+毛楂楂 13.900677652
+贻误军机 11.1280889297
+许多页 13.2075304714
+萨塔瓦 13.2075304714
+分得清 11.8212361103
+隐迹 12.8020653633
+军事检察院 12.2912397395
+寻短见 11.0103058941
+神像 8.81308131674
+捐款箱 12.2912397395
+彦士 13.900677652
+貌相 11.598092559
+噗噗 10.533381822
+飞灾 13.2075304714
+见笑 10.1164880181
+富克锦 12.8020653633
+讲求实效 11.8212361103
+束光明 13.2075304714
+勿如 13.900677652
+取穴 10.9562386728
+九月末 12.5143832909
+呼伦贝尔市 12.2912397395
+废除 7.12988822807
+插板 13.2075304714
+迫击炮弹 10.6818018271
+托诺夫 13.2075304714
+张志学 12.2912397395
+潜在力量 13.2075304714
+营产 12.5143832909
+大红袍 10.4666904475
+释手 12.8020653633
+梁画柱 12.1089181827
+化繁为简 12.8020653633
+关夫子 13.900677652
+飘移 11.5027823792
+氍毹 10.8096351986
+机率 10.1630080337
+屏声敛息 13.900677652
+双年展 12.8020653633
+机电式 11.9547675029
+胡不归 12.2912397395
+第四十条 13.900677652
+显示终端 12.2912397395
+劳动人事 12.2912397395
+传家之宝 11.8212361103
+红马奔 13.900677652
+经济部长 11.2616203224
+大米粥 13.900677652
+狗命 10.5684731418
+掷远 13.900677652
+钱禧 12.8020653633
+骗取钱财 13.900677652
+仙人桥 11.7034530746
+量杯 13.2075304714
+鲁吉亚 13.2075304714
+操兵方 13.2075304714
+碾米 9.93038573842
+木讷 10.533381822
+替换成 12.1089181827
+阻值 11.9547675029
+庞斯富 12.8020653633
+煤矿 7.07088391446
+扈氏 12.2912397395
+罗弗特 13.2075304714
+锡壶 11.598092559
+纸绳 13.900677652
+无嗣子 13.2075304714
+守身如玉 11.8212361103
+采光 10.2117981979
+喀布尔河 11.8212361103
+密电 10.0940151622
+四十九日 11.9547675029
+颇有价值 13.2075304714
+西鸡儿 12.2912397395
+镜头感 13.2075304714
+湖光塔影 13.900677652
+韩里奇 10.9049453784
+汴河 9.85762638414
+中南海西花厅 12.1089181827
+神偷 13.900677652
+数万户 12.2912397395
+那江州 13.2075304714
+马尔吉 13.900677652
+易方达 7.32420808293
+养殖户 10.7226238216
+不灭定律 13.2075304714
+神农 9.91169360541
+五连冠 13.900677652
+阻击 9.07236391467
+生还者 13.2075304714
+攻其不备 11.7034530746
+接往 11.9547675029
+总开销 13.900677652
+取笑 9.02548032877
+忠孝节义 11.5027823792
+仓储 8.86372504956
+卡拉布里亚 12.2912397395
+隐身 9.23723855786
+神内 13.2075304714
+营伍 12.1089181827
+吃零食 11.5027823792
+勘订 13.2075304714
+兰西 11.8212361103
+江苏教育出版社 13.900677652
+李圣天 12.5143832909
+弹起来 11.2616203224
+秀山 10.8561552143
+纸缝 13.900677652
+王上膺 12.8020653633
+典当 9.6811699468
+诡笑 12.8020653633
+吃奶 9.61021821083
+不可教 12.2912397395
+结合上皮 13.900677652
+宓纳 12.2912397395
+司同知 11.9547675029
+海洋环境 10.0940151622
+剪短 11.9547675029
+机要局 13.900677652
+能天威 13.900677652
+天正 11.1926274509
+无名之辈 13.900677652
+无福消受 12.1089181827
+杨连 12.8020653633
+在天有灵 11.598092559
+拉朗德 13.2075304714
+受调查者 13.900677652
+正太路 13.2075304714
+崔靖 12.8020653633
+不可数 12.5143832909
+毁灭 8.03138073884
+牛肉饼 12.8020653633
+废革 13.900677652
+气喘喘 12.2912397395
+局方 11.9547675029
+应激 10.3743171274
+小品文 11.0103058941
+老妖精 11.7034530746
+张辉 13.900677652
+寿辰 10.5684731418
+芬尼根 12.8020653633
+打狗棒 13.2075304714
+即指 9.65218240993
+燥音 13.900677652
+宗李适 13.900677652
+载重量 9.43476953332
+狗猛酒酸 13.900677652
+那秦安 12.8020653633
+挡掉 12.5143832909
+共和党人 10.2897597393
+广惠司 12.5143832909
+乒乓球 10.0294766411
+秀峰 11.9547675029
+吉坚赞 11.4157710022
+大致相同 9.34680076038
+伞衣 12.8020653633
+出版界 11.8212361103
+不置可否 9.65218240993
+伯杰 13.900677652
+超出预算 13.900677652
+制造局 10.7226238216
+太仓市 13.2075304714
+种下祸根 13.2075304714
+拉森 12.2912397395
+蠡园 11.9547675029
+神光 10.3171587135
+江雪琴 13.2075304714
+场内外 10.8561552143
+七十九期 13.2075304714
+凉风 9.84023464143
+怕臊 11.8212361103
+那黛玉 11.3357282945
+马西斯 12.5143832909
+善良 8.1608847398
+神兽 11.0103058941
+杜布罗 13.900677652
+神兵 9.98865464655
+欠发达 10.4041700905
+云仙 13.2075304714
+王冰 11.8212361103
+天母 13.2075304714
+决议 7.14957618304
+批租 12.2912397395
+云帆济 13.2075304714
+决计 9.20019728618
+向后 10.0720362555
+剪着 12.5143832909
+孙仲引 13.2075304714
+张启藻 11.7034530746
+沟堑 13.900677652
+王仲闻 13.2075304714
+神力 9.89334446674
+赎价 13.900677652
+神功 10.533381822
+青史传名 13.900677652
+天上飞 10.642581114
+又成画饼 13.900677652
+明媒正娶 10.8561552143
+国民党中央 8.83808261895
+镶银 12.1089181827
+丘陵地带 9.53122979951
+烽烟四起 13.2075304714
+煤电 8.41173992582
+煤田 8.68574189437
+备案 8.4284069783
+詹大同 12.1089181827
+日见增多 13.900677652
+李阳 12.5143832909
+斯堪的纳 13.900677652
+空间信息 13.2075304714
+俾使 12.8020653633
+夜空 8.75318317516
+架下来 13.900677652
+神助 10.8096351986
+白帝城 10.2117981979
+奖惩制 13.900677652
+第四十日 13.2075304714
+海炮 11.7034530746
+易子而食 11.8212361103
+据载 10.7226238216
+采取 5.34908303384
+出招 10.6818018271
+海豚音 12.8020653633
+超人一等 13.900677652
+马君武 12.1089181827
+六十三岁 11.9547675029
+特洛姆 12.5143832909
+虞城 11.7034530746
+择校 12.1089181827
+良士 13.900677652
+时机已到 11.8212361103
+天桥 9.38981814546
+尿流屁滚 13.900677652
+神勇 10.4666904475
+忧急 11.8212361103
+满朝官 12.8020653633
+汝南郡 12.8020653633
+曹公兵 13.2075304714
+云霓 11.3357282945
+张仪死 12.8020653633
+阻力 7.42370528909
+变样 11.7034530746
+马西昂 12.5143832909
+姜师度 12.2912397395
+小家鼠 12.1089181827
+居住地 9.22784881751
+水化物 13.900677652
+神瑛侍者 12.8020653633
+趴着睡 12.8020653633
+今宵 10.7226238216
+数百米 10.0505300503
+沉醉于 11.4157710022
+诸暨县 12.8020653633
+异己分子 11.9547675029
+金翅鸟 12.5143832909
+砍下来 11.1926274509
+蹑着脚 13.2075304714
+提高产量 10.765183436
+园圃 10.8561552143
+间接性 11.4157710022
+玄德既 12.2912397395
+玄德无 13.2075304714
+容妞 13.900677652
+剪切模量 13.900677652
+连德勒 12.8020653633
+观察期 11.4157710022
+紧追权 12.1089181827
+决裂 9.5062284973
+约略是 13.900677652
+烤火 9.82314020807
+高速缓存 11.7034530746
+不置 10.642581114
+华中师范大学 11.9547675029
+计生办 12.8020653633
+三脚猫 13.900677652
+采区 12.5143832909
+共设 10.1630080337
+共计 7.00398332035
+头把交椅 10.604840786
+园地 10.2897597393
+炖锅 13.2075304714
+出报 13.900677652
+特洛夫 13.900677652
+坡底 11.8212361103
+废钢 10.3171587135
+皮阿齐 13.2075304714
+共议 10.0505300503
+牛仔服 13.2075304714
+一将难求 11.9547675029
+废铜 13.2075304714
+尉司 12.2912397395
+许茹芸 13.2075304714
+神剑 11.3357282945
+玄德方 12.8020653633
+共话 11.4157710022
+隔音板 12.2912397395
+邓氏 12.2912397395
+共识 7.50876053858
+释怀 10.9049453784
+立陶宛 9.23723855786
+废铁 10.8561552143
+服装秀 13.900677652
+天棚 11.5027823792
+共请 13.900677652
+仓卒 10.4666904475
+红与黑 10.9562386728
+仓单 9.5186510173
+明宣德 11.0674643079
+唐通 8.81308131674
+斯巴亚 12.8020653633
+新人王 13.900677652
+军区 7.92686804011
+时光倒流 11.9547675029
+秘而不言 13.900677652
+经风雨 13.2075304714
+十二枝 12.5143832909
+马尔基 12.8020653633
+文艺界 9.69598503258
+讲成 13.2075304714
+吃子 12.1089181827
+村公所 11.7034530746
+基因工程 9.84023464143
+许褚之 12.8020653633
+整齐划一 11.0103058941
+盲女 12.5143832909
+煤球 10.4349417492
+兹将 13.900677652
+获得胜利 10.642581114
+神果 13.900677652
+西奥德 13.900677652
+电容式 13.2075304714
+詹他叔 13.2075304714
+奥康奈 12.8020653633
+塞维鲁 12.5143832909
+毁版 12.8020653633
+漕宝路 12.8020653633
+本笃会 12.1089181827
+初赛 12.5143832909
+拉动型 10.8096351986
+楚盟 12.2912397395
+和小宗 13.2075304714
+北京路 10.4666904475
+机灵 9.19114745066
+王公 8.32472854883
+查罕杰 12.8020653633
+伯斯 11.9547675029
+虞国 13.900677652
+远度 12.2912397395
+神台 12.8020653633
+孢囊 10.8096351986
+伏国仁 11.598092559
+外国语 9.44633035572
+肌浆网 13.900677652
+建筑工人 10.765183436
+爱古斯河 13.2075304714
+崔镇 13.900677652
+园囿 11.9547675029
+批答 11.9547675029
+魏王泰 12.8020653633
+造园学 13.2075304714
+明和尚 13.2075304714
+数的几何 13.2075304714
+俄政府 10.8561552143
+狄氏 12.8020653633
+善者 11.0674643079
+神化 9.56994431169
+冒认 12.5143832909
+弹下去 13.2075304714
+孔门儒 13.2075304714
+帝赐 12.8020653633
+竦动 12.8020653633
+湿润型 11.8212361103
+蒋丽莉 9.55687223012
+雍布拉康 13.2075304714
+采制 11.0674643079
+神医 10.0088573539
+国际服饰 12.2912397395
+采到 10.642581114
+锡安 12.5143832909
+饭店业 11.5027823792
+齐景公 12.2912397395
+农牧 8.83808261895
+北极圈 9.62401153296
+送气音 11.9547675029
+前人种树 13.900677652
+第派 13.900677652
+首要分子 11.7034530746
+水火不相容 11.4157710022
+曼苏里 13.900677652
+毫米汞柱 9.84023464143
+何妙策 12.8020653633
+马哈茂德 11.7034530746
+未达标 11.7034530746
+秘籍 9.96885201925
+忽悠忽悠 11.7034530746
+肺脓肿 10.9562386728
+伊堪 13.900677652
+吃定 11.9547675029
+陈灿荣 11.598092559
+佃租 13.2075304714
+誉满全球 13.2075304714
+神华 8.9308643524
+盖尔化 13.900677652
+小阴唇 11.8212361103
+甘宁见 13.2075304714
+直通式 13.2075304714
+掉头发 11.9547675029
+特别喜爱 11.7034530746
+临文不讳 13.900677652
+吃客 12.5143832909
+牙买加 9.61021821083
+银开复 12.8020653633
+亚毫米波 11.5027823792
+团结协调 12.1089181827
+警钟长鸣 13.2075304714
+数据库安全 13.2075304714
+绣帕 13.2075304714
+末路 11.5027823792
+园内 9.00283785202
+隐讳 10.642581114
+背反 10.8561552143
+吃屎 10.533381822
+革命化 10.1871055853
+中青年 9.77354326693
+必罚 11.4157710022
+实用信息 13.2075304714
+陪陵 11.5027823792
+夕惕朝乾 13.900677652
+木轮 11.0103058941
+纪僧真 12.8020653633
+加利福尼亚大学 10.0088573539
+吸烟区 13.900677652
+穴处 12.2912397395
+展露出 11.9547675029
+血仇 11.7034530746
+可和解 13.900677652
+热力过程 12.2912397395
+盲干 13.2075304714
+东南大学 10.0294766411
+丛密 11.9547675029
+共贺 12.5143832909
+阿布赉 12.5143832909
+秀女 11.8212361103
+天渊 13.2075304714
+无车日 11.7034530746
+膨胀水泥 13.2075304714
+花炮厂 12.8020653633
+亚肩叠背 12.8020653633
+女大当嫁 11.3357282945
+拾级而上 11.2616203224
+荧光 8.61241062128
+踌躇满志 10.2371160058
+阿布贾 12.8020653633
+弗路尔 13.2075304714
+余万号 13.2075304714
+共赚 7.68207753228
+地仙幕 12.2912397395
+锡山 12.1089181827
+接引 10.2117981979
+白日梦 11.7034530746
+刀山剑林 13.900677652
+淡忘 9.91169360541
+伊尼格 12.8020653633
+谢爱光 9.41204128224
+一餐饭 12.1089181827
+隐语 11.1926274509
+陌生客 13.900677652
+杨露蝉 12.8020653633
+十二册 12.8020653633
+打打闹闹 11.0103058941
+大西海子水库 13.900677652
+不计成本 11.598092559
+天湖 11.3357282945
+烟屁股 12.1089181827
+玉努斯 13.2075304714
+阮朝 13.2075304714
+豹骨 13.900677652
+秘笈 10.533381822
+神君 12.5143832909
+农畜 12.1089181827
+坍缩 11.0674643079
+隔舱 11.8212361103
+友非 13.2075304714
+传为笑柄 13.900677652
+南蛮子 10.4666904475
+二十几个 9.82314020807
+贪脏枉法 13.900677652
+贴膏药 11.8212361103
+大家畜 12.2912397395
+抱歉 8.93783302172
+碾砣 13.900677652
+酪素 13.2075304714
+谢切诺 12.5143832909
+蠡县 11.8212361103
+六七十斤 13.900677652
+筋骨草 13.900677652
+天源 10.604840786
+抱死 13.900677652
+二百五十元 13.900677652
+杨隆演 12.5143832909
+怪不怪 11.1280889297
+司洛夫 12.8020653633
+神启 13.2075304714
+一十八岁 12.2912397395
+向善 10.6818018271
+纸盒包装 12.5143832909
+滔滔不绝 9.4233408375
+伯戈 13.2075304714
+红专 12.2912397395
+增强党性 12.2912397395
+取经 8.29120585679
+是非之心 12.8020653633
+古森林 12.2912397395
+麻藤属 13.900677652
+放射治疗 10.0088573539
+熏制 11.8212361103
+铁面人 13.900677652
+致送 12.2912397395
+阻吓 11.0674643079
+评议组 10.9049453784
+革命史 10.6818018271
+局性 11.9547675029
+农田 7.74794495727
+屡有 9.7898037878
+左右侧 11.5027823792
+感情用事 10.6818018271
+即景 11.0674643079
+晋东阁 13.2075304714
+一点钟 12.1089181827
+几万几十万 12.5143832909
+政府军 10.2117981979
+约等于 10.7226238216
+农用 9.74179456862
+杨叫 11.7034530746
+窃国 12.1089181827
+头顶生疮 12.8020653633
+肖华 11.7034530746
+阉鸡 12.5143832909
+至上 9.16447920358
+取缔 8.97342396682
+带来带去 12.8020653633
+孟宪承 13.2075304714
+缩微胶片 12.1089181827
+共谋 10.1164880181
+马尔凯 12.5143832909
+螺丝刀 11.4157710022
+后继机 11.9547675029
+六出花 13.2075304714
+脸颊 8.25170341381
+至为 10.0720362555
+神喻 13.2075304714
+中央党校 9.6811699468
+求治者 13.900677652
+天河镇 13.2075304714
+马央宗 12.2912397395
+群山起伏 11.7034530746
+井村 13.2075304714
+天演 12.2912397395
+都广陵 12.1089181827
+至中 10.9562386728
+氧化锶 13.2075304714
+花之子 13.2075304714
+纸笔 9.59661255877
+田五田 13.2075304714
+贝加尔湖 9.6811699468
+黄卷青灯 12.8020653633
+日莲宗 12.5143832909
+鸟松 13.2075304714
+朗诵会 13.2075304714
+释林 13.2075304714
+没救 10.8561552143
+路之远 13.2075304714
+移居 7.80710788193
+致醉 13.2075304714
+丝光处理 13.900677652
+一技之长 11.598092559
+中国船舶重工集团公司 11.5027823792
+教学资源 13.900677652
+音高 9.74179456862
+北山区 13.2075304714
+储集岩 13.2075304714
+罪罚 12.2912397395
+薄音湖 13.2075304714
+聋哑人 11.4157710022
+孤芳自赏 13.2075304714
+瑞蚨祥 12.5143832909
+从文件 11.1926274509
+哑巴吃 12.5143832909
+著名演员 13.2075304714
+纸筒 11.8212361103
+茶陵县 11.9547675029
+零两个 12.1089181827
+即期 10.0505300503
+隔音性 12.5143832909
+公信度 11.5027823792
+艾米 11.0103058941
+太阳光 9.26594866375
+水货手机 12.2912397395
+西奥多 10.8561552143
+即有 8.75318317516
+惊险万状 13.2075304714
+至于 6.05408767668
+进修部 13.2075304714
+格伦斯 13.900677652
+纸箱 10.533381822
+三都水族自治县 11.8212361103
+小海子 13.2075304714
+至人 11.8212361103
+舌面音 13.900677652
+暮霭 10.642581114
+数万条 12.8020653633
+至亲 10.1630080337
+秒数 12.1089181827
+刘炫 10.6818018271
+第八十一回 12.2912397395
+莱西 11.1280889297
+互助 9.06439574502
+印刷技术 11.5027823792
+马尔克 11.5027823792
+非那西丁 13.2075304714
+日本广播协会 11.2616203224
+火树银花不夜天 12.8020653633
+至交 10.9562386728
+初试 11.8212361103
+不多时 8.71329184614
+牙髓炎 12.8020653633
+明末农民 12.2912397395
+新路海 13.2075304714
+声韵学 13.2075304714
+井架 12.1089181827
+数百篇 12.8020653633
+塑胶跑道 13.900677652
+初评 12.1089181827
+潘基文 10.4349417492
+初识 11.8212361103
+冒险性 11.9547675029
+一个箭步 10.2117981979
+残片 9.74179456862
+醉翁亭记 12.1089181827
+初诊 13.900677652
+寿诞 12.5143832909
+格框架 13.900677652
+地矿部 13.900677652
+还治其人之身 10.9562386728
+主事者 12.1089181827
+余堵 13.2075304714
+周秦至 12.8020653633
+十数对 13.2075304714
+教学系统 13.900677652
+释本 11.9547675029
+现金支票 13.2075304714
+乐昌 10.8561552143
+氏族谱 11.9547675029
+赫罗图 11.0674643079
+硬邦邦的 10.8096351986
+滚上 12.1089181827
+楚王 8.26232298264
+骶骨 11.9547675029
+武汉市委 13.900677652
+枯叶蛾 11.8212361103
+右派分子 10.2371160058
+准确性 9.16447920358
+英国皇家海军 9.84023464143
+交通量 11.3357282945
+于汴梁 12.8020653633
+机电 8.48457724977
+删减 12.5143832909
+机甲 13.900677652
+功标青史 13.900677652
+崔通 13.900677652
+纽结 11.4157710022
+长见识 12.2912397395
+俄克拉何马 11.9547675029
+天气 6.45994394459
+外壳 8.82550383674
+全线出击 11.3357282945
+制造家 11.3357282945
+杨志提 12.5143832909
+天氏 10.0720362555
+顾氏 11.1280889297
+和小建 12.8020653633
+乌隆府 13.2075304714
+问长问短 10.765183436
+唬人 10.765183436
+美国红十字会 13.2075304714
+拉动力 11.0103058941
+钩出 13.2075304714
+金盏花 11.7034530746
+兰伯特 11.7034530746
+柳摇金 13.2075304714
+革命党 9.20019728618
+武都郡 11.3357282945
+雾天 11.3357282945
+木质 8.51618258919
+纽约 6.73055810853
+喇嘛寺院 12.5143832909
+天池 9.62401153296
+问候信 13.900677652
+寿衣 10.4349417492
+热爱人民 11.9547675029
+苏弗里 13.2075304714
+初衷 8.67493097826
+共轴 11.8212361103
+冯保已 11.2616203224
+定向天线 13.2075304714
+共载 12.2912397395
+崔道 13.900677652
+天汉 11.4157710022
+日本公司 11.9547675029
+笤帚 10.2117981979
+艾美 13.900677652
+居住区 8.83177344976
+得失相当 12.2912397395
+共轭 9.72629038208
+滚乱 13.900677652
+赛龙泉 12.5143832909
+冷知暖 13.2075304714
+共输 13.900677652
+苏家驹 13.2075304714
+化学原料 11.3357282945
+舒肝理气 13.2075304714
+大量文件 12.8020653633
+革命军 9.30555780184
+勤杂人员 12.8020653633
+包道乙 12.8020653633
+肖像 9.23723855786
+科技股份 8.86372504956
+栖栖遑遑 13.900677652
+商对策 12.5143832909
+出版物 9.01787572939
+迷魂药 11.4157710022
+鹭鸟 12.5143832909
+套出来 12.8020653633
+二百五十卷 12.5143832909
+植胶 12.5143832909
+祆教徒 12.5143832909
+伯恭 13.2075304714
+氧化锂 13.900677652
+伯恩 11.2616203224
+采地 11.2616203224
+石雕像 11.5027823792
+一下手 9.4233408375
+打光 10.765183436
+共达 10.2630914922
+由此来看 11.4157710022
+卡迪西亚 12.8020653633
+小有名气 10.765183436
+应标 13.2075304714
+马西拉 13.900677652
+双护玉 13.2075304714
+园区 8.91707103027
+崔郾 12.8020653633
+共运 12.2912397395
+野台戏 13.900677652
+头昏脑闷 13.900677652
+金莺微 13.2075304714
+摧花 13.2075304714
+鸭肫肝 13.900677652
+共进 10.8561552143
+埃格林 12.8020653633
+数百磅 13.900677652
+明宣宗 11.3357282945
+石秀自 11.598092559
+血人 11.2616203224
+陈掌柜 11.7034530746
+七横八竖 13.900677652
+张逸云 13.2075304714
+天波 11.7034530746
+引以为自豪 12.1089181827
+阿布辛 11.8212361103
+鉴别手段 13.900677652
+举行会谈 10.4349417492
+颇觉 10.8096351986
+数千吨 12.1089181827
+狗刨 13.900677652
+神器 9.84023464143
+马尔切 12.2912397395
+遇险 10.5684731418
+文本文件 10.7226238216
+土拉河 11.5027823792
+降糖药 11.2616203224
+决赛 9.33632946051
+林耀华 12.8020653633
+吴孟明 10.0294766411
+黑云压城城欲摧 12.8020653633
+艾里甫 13.2075304714
+奥陶统 12.8020653633
+步程计 13.2075304714
+晶体点阵 12.2912397395
+罗多族 13.2075304714
+第三桌 13.2075304714
+鲢鱼 10.9049453784
+格子状 12.2912397395
+马尔可 13.900677652
+隔膜 9.34680076038
+四十五分钟 13.900677652
+李静 11.0103058941
+国际金融 8.37522471284
+机理 7.97108850859
+莱诺 13.900677652
+庋藏 12.2912397395
+观察报 10.4666904475
+金仙 13.2075304714
+镶金 10.0720362555
+鲍彻 13.2075304714
+自作主张 10.0720362555
+红人 9.84023464143
+铁针 13.2075304714
+木豆 13.2075304714
+得意扬扬 12.5143832909
+教导 8.56795885871
+纸票 11.4157710022
+四十九扇 13.900677652
+煤火 11.9547675029
+争持不下 13.2075304714
+教科文卫体 13.900677652
+采回 11.8212361103
+痛风 10.4349417492
+天浴 13.2075304714
+天海 10.1871055853
+慰解 11.7034530746
+悍然 10.0505300503
+容身之地 12.5143832909
+泰然 9.04086524761
+释文 10.604840786
+纽约联邦储备银行 10.6818018271
+煤灰 10.765183436
+犬牙 11.5027823792
+玄德怒 13.2075304714
+数万斤 13.2075304714
+水准仪 11.598092559
+精河县 12.8020653633
+即时 8.29487558568
+输尿管 9.77354326693
+秦庆童 13.2075304714
+副翼 10.533381822
+利嘴 12.2912397395
+全国科学大会奖 12.1089181827
+活菩萨 11.4157710022
+即日 8.84443184663
+凯恩斯 9.5186510173
+登山队员 12.8020653633
+夏侯蔼部 13.2075304714
+煤炭 6.04707283888
+西里尔 13.2075304714
+释教 10.533381822
+舱盖 9.24671730182
+明军乘 13.900677652
+浦洛河 12.8020653633
+轻量化 11.4157710022
+林中寻 13.900677652
+浙大 11.8212361103
+天涯 9.4233408375
+捆绑式 11.8212361103
+全罗斯 13.2075304714
+抓紧抓好 11.9547675029
+国际裁判 13.900677652
+煤炉 10.9049453784
+附了 12.8020653633
+面朝着 11.7034530746
+满口脏话 13.2075304714
+阴假凤 13.2075304714
+兰迪 13.900677652
+八百七十名 13.900677652
+地面温度 11.9547675029
+金盏草 13.900677652
+怀柔县 11.9547675029
+神坛 10.604840786
+数百种 10.4666904475
+隐衷 12.2912397395
+北京西 12.5143832909
+观察所 10.4666904475
+警钟 9.5186510173
+粲然 12.1089181827
+杭汉边 13.2075304714
+原索动物 13.900677652
+初见 10.0088573539
+秀媚 12.1089181827
+由维恩 13.900677652
+睡莲科 12.2912397395
+释放 6.58213810341
+三四十口 13.2075304714
+皱起 8.9519177616
+田径比赛 11.4157710022
+三角淀 12.5143832909
+八方 10.1394775363
+三四十只 13.2075304714
+冒进 10.4349417492
+崔野 11.4157710022
+煤烟 11.5027823792
+隐血 12.5143832909
+那林 13.2075304714
+圣彼德 13.2075304714
+列维坦 12.1089181827
+冯友兰 12.1089181827
+本世纪末 10.5684731418
+副署 11.1926274509
+政府办 11.8212361103
+全为 9.24671730182
+哈默尔恩 12.8020653633
+剪线 13.2075304714
+剪纸 9.85762638414
+天房 9.84023464143
+农科 10.9049453784
+右玉县 12.2912397395
+木荷 10.533381822
+当个 8.87023973058
+民进中央 12.1089181827
+当中 6.57289711355
+纸版画 13.900677652
+无一不通 12.8020653633
+十八笔 13.900677652
+阿信 12.8020653633
+抱柱 11.4157710022
+段成式 12.5143832909
+松潘镇 13.2075304714
+张永荐 12.8020653633
+沈重 13.2075304714
+溢流 10.7226238216
+天成 8.71329184614
+小腿肚 11.4157710022
+当下 6.92900904725
+当上 8.37124856446
+层压材料 12.8020653633
+侮辱 8.55357012126
+许地山 11.8212361103
+阐明 7.65651075131
+数千台 13.900677652
+忠信 11.5027823792
+于琢玉 13.2075304714
+严东生 13.2075304714
+莱蒙 11.8212361103
+翱翔天空 13.2075304714
+新东方学校 12.5143832909
+溢洪 12.5143832909
+慧聪网 13.2075304714
+伴郎 12.5143832909
+兰考 9.80633308975
+诺瓦拉 13.2075304714
+莱蒂 11.7034530746
+哈雷彗星 10.9049453784
+张老爷 11.3357282945
+总得 8.42421410004
+狗岛 13.900677652
+几百户 12.2912397395
+农民协会 10.765183436
+园工 12.5143832909
+数千只 13.2075304714
+积累率 11.7034530746
+黄盖献 13.2075304714
+叹词 13.2075304714
+行动迟缓 10.604840786
+紧密团结 12.2912397395
+玉版 12.5143832909
+白日撞 13.2075304714
+剪绒 12.1089181827
+产品规格 12.1089181827
+国产化率 10.8561552143
+天才 8.4284069783
+大克鼎 12.5143832909
+波希米亚 10.1164880181
+于莲抱 13.2075304714
+久攻不下 11.4157710022
+催吐剂 13.2075304714
+呈报 9.66657114738
+马尔山 13.900677652
+放暑假 10.9049453784
+狗屁 9.94943393339
+人物志 11.8212361103
+铁丝网 10.2371160058
+狗屎 10.6818018271
+秤砣 11.5027823792
+梨树 10.3743171274
+批点 12.5143832909
+应是 8.170577869
+港星 13.2075304714
+宰具官 13.2075304714
+广为传颂 12.8020653633
+目无国法 13.2075304714
+按着 8.87679713113
+神堂 11.9547675029
+阿佤 12.5143832909
+不是故意 9.98865464655
+机箱 12.5143832909
+伴送 12.5143832909
+大学老师 13.2075304714
+大快人心 10.6818018271
+传记文学 11.3357282945
+阻塞 8.68574189437
+浅析 12.8020653633
+当事 9.55687223012
+应昌 11.0103058941
+由云山 13.2075304714
+当于 10.8561552143
+胡妇 12.5143832909
+泛泛之交 11.598092559
+采夫 11.1926274509
+一部分 5.50768806402
+另于 12.2912397395
+屡次 8.52078029844
+绿球藻 13.900677652
+废黜 9.08039608637
+传奇一生 13.900677652
+伯渊 13.2075304714
+木莲 11.1926274509
+国民身分 13.2075304714
+立法委员 11.3357282945
+河北农业大学 13.2075304714
+积郁 10.8561552143
+数百盆 13.2075304714
+阿伯 11.4157710022
+应景 10.2897597393
+舒城县 12.5143832909
+享受性 13.2075304714
+余万千瓦 12.1089181827
+割地求和 11.3357282945
+阿伦 10.9562386728
+落汤鸡 10.8561552143
+恢复期 10.0294766411
+艾焦 13.2075304714
+当令 11.3357282945
+备抵 13.900677652
+采女 11.9547675029
+抱朴 12.2912397395
+伯温 12.2912397395
+历克斯 13.900677652
+另付 12.5143832909
+马尔尚 13.2075304714
+水米无交 13.2075304714
+那小舟 13.900677652
+互补原理 12.8020653633
+当今 7.56208357377
+纸盘 13.2075304714
+独木不成林 13.2075304714
+阿伊 12.5143832909
+巴米累克 12.5143832909
+纸盒 10.1394775363
+在野党 10.3743171274
+盲动 11.3357282945
+悬空寺 11.8212361103
+神妙 10.765183436
+吃光 9.6811699468
+奥尔沙 12.5143832909
+木色 13.900677652
+亲权 11.8212361103
+笨嘴拙舌 12.5143832909
+徐宁飞 13.2075304714
+不求利 13.2075304714
+胡妈 13.900677652
+卡文迪什 10.4666904475
+颜惠庆 12.2912397395
+余亿元 12.1089181827
+农林牧副 13.900677652
+貌美 10.8561552143
+一百三十斤 13.900677652
+绣品 11.3357282945
+百分之百 9.59661255877
+当众 9.04864738806
+望明公 12.8020653633
+阿仑 12.8020653633
+拍案而起 10.9049453784
+香奈儿 12.8020653633
+荧屏 10.3453295905
+法不阿贵 13.900677652
+阿什 10.642581114
+木船 9.30555780184
+制造品 11.5027823792
+共聚 10.0294766411
+艾炷 11.9547675029
+荣西禅师 13.900677652
+锡兰 9.71102290995
+极个别 10.8561552143
+阿亨 13.2075304714
+宠物用品 11.0674643079
+观察法 11.5027823792
+田字草 13.900677652
+监管场所 13.2075304714
+容身之处 13.2075304714
+忠仆 13.2075304714
+系统安全 10.8561552143
+当作 7.01006853183
+视觉适应 13.900677652
+浩特 12.8020653633
+王大人 9.56994431169
+另作 10.2371160058
+盲区 11.2616203224
+糖醛酸 12.5143832909
+文稿 9.94943393339
+挑不动 12.8020653633
+王甘麻 12.1089181827
+三求四告 13.900677652
+人造石油 11.8212361103
+熏得 10.0720362555
+隔过 11.7034530746
+进京城 13.2075304714
+有名有实 13.2075304714
+洪泽境 12.8020653633
+阳光城 10.3743171274
+汽轮发电 11.1926274509
+艾灸 11.1280889297
+白云石 9.35738286971
+万隆会议 11.2616203224
+割地赔款 10.9562386728
+王晓东 11.7034530746
+适龄儿童 11.0103058941
+古文观止 12.1089181827
+善言 10.7226238216
+延大喜 12.5143832909
+唧咕 12.8020653633
+氧化聚合 12.8020653633
+讥为 11.1926274509
+山珍海错 12.5143832909
+铁铮 13.900677652
+精神紧张 9.71102290995
+共育 13.2075304714
+挂号费 11.7034530746
+芍药花 12.1089181827
+师蓟辽 12.5143832909
+神头 11.3357282945
+广惠寺 13.900677652
+取现 11.5027823792
+吃出 11.1280889297
+李韶 13.2075304714
+公信力 9.12155415886
+金秀才 10.0720362555
+东岳泰山 11.598092559
+现场转播 13.2075304714
+总医院 10.604840786
+噶玛噶举派 12.5143832909
+居会稽 12.8020653633
+阿丽 11.598092559
+照眼 12.5143832909
+拳脚相向 12.8020653633
+九五之尊 11.5027823792
+镇平 11.0103058941
+木花 13.900677652
+非比寻常 10.3171587135
+鹅黄色 11.1280889297
+含糊地 10.2371160058
+空口说白话 13.900677652
+汽车修理 11.4157710022
+升清降浊 13.2075304714
+几万斤 11.9547675029
+左仆射 10.0720362555
+溢油 13.2075304714
+积金 11.7034530746
+神奇 8.00078029839
+即死 11.7034530746
+典型 6.2804628814
+阿东 9.91169360541
+阿丘 13.900677652
+虞山 11.0103058941
+欧洲原子能共同体 12.8020653633
+生着气 12.8020653633
+巴伦西亚 11.1926274509
+杨三姐 12.8020653633
+冠状动脉 9.94943393339
+社里 10.642581114
+向东驰 12.5143832909
+恐怖症 12.1089181827
+呕心沥血 10.604840786
+木节 13.2075304714
+海石 12.2912397395
+狗崽 13.2075304714
+遇雨 12.5143832909
+张志刚 12.5143832909
+神奥 13.900677652
+泰皇 12.8020653633
+拉票会 13.900677652
+新燕莎 13.900677652
+矢量图 13.900677652
+董袭 11.3357282945
+瞻顾 11.9547675029
+御花园 9.07236391467
+岳麓书社 11.8212361103
+布雷 8.81927328699
+伞菌 11.3357282945
+周大新 13.900677652
+程序验证 13.900677652
+卡拉瓦 11.2616203224
+须知 9.22784881751
+天性 8.90346537821
+二十六 9.48183704418
+吃剩 10.4994802703
+全乡 10.2117981979
+一二节 13.900677652
+蔽体 12.5143832909
+倍倍尔 11.3357282945
+兰艾 13.900677652
+如隔三秋 13.2075304714
+魏高允 13.2075304714
+操作者 10.2117981979
+纷纷洋洋 13.900677652
+归位 10.642581114
+冷作 12.2912397395
+弓上弦 12.5143832909
+卫绍王 12.1089181827
+机票 9.17328983326
+繁殖场 12.8020653633
+季刊 9.87532596124
+厂子 9.5186510173
+一千九百六十余万日元 13.2075304714
+繁殖地 11.1280889297
+差一点儿 11.2616203224
+天恩 10.0088573539
+惊天动地 9.20932976975
+肖尔 12.1089181827
+衣帽钩 13.900677652
+归谬法 12.8020653633
+电容器 9.71102290995
+碾盘 9.80633308975
+艾玛 13.900677652
+冰冻三尺 12.2912397395
+取火 10.9049453784
+善解 11.3357282945
+渔光曲 11.2616203224
+快下班 11.7034530746
+乌莎 13.2075304714
+井栏 12.2912397395
+三四十年 11.9547675029
+思乡 10.6818018271
+大苏打 13.900677652
+银白杨 13.900677652
+汽车产量 11.1280889297
+释梦 12.8020653633
+伯河 13.2075304714
+隐藏 7.70016847793
+米廖夫 13.900677652
+决胜 10.0294766411
+生刺 13.900677652
+二级缓存 11.3357282945
+梢门 11.8212361103
+杏园 13.2075304714
+隐蔽 7.74794495727
+模仿者 11.7034530746
+饕餮 10.3171587135
+竹苇 13.900677652
+法则 8.11993413618
+神威 9.93038573842
+罗蜜欧 13.2075304714
+罗耀拉 12.8020653633
+开水房 12.8020653633
+金翅雀 12.2912397395
+找得 11.8212361103
+体育道德 13.2075304714
+共获 9.62401153296
+思亲 11.8212361103
+爱斯基摩 10.1630080337
+冷俊 13.2075304714
+临了 11.3357282945
+炼金术士 12.1089181827
+标准设计 11.0674643079
+执行力 10.604840786
+一推了之 12.5143832909
+到此结束 10.642581114
+兰若 12.1089181827
+香都 13.900677652
+诗翁 12.5143832909
+少小离家 13.900677652
+王倩 11.598092559
+亢进 9.55687223012
+兰芒 12.2912397395
+花异色 13.900677652
+副牌 11.1926274509
+季初 12.5143832909
+奥格登 13.900677652
+一字千金 12.5143832909
+脸面 8.78268383956
+恒升 11.1926274509
+朗声 9.7898037878
+丹佛掘金 13.2075304714
+摇把子 13.2075304714
+余处 9.63799777493
+吃力 8.86372504956
+公费生 13.900677652
+二十八 9.36807815882
+马来酸 13.2075304714
+王庆听 11.5027823792
+归侨 10.2371160058
+网球拍 12.8020653633
+六七个 10.1394775363
+机种 10.2117981979
+兰花 8.44109213783
+吉首市 11.598092559
+小镐 12.8020653633
+归依 11.0103058941
+量浅 12.5143832909
+演艺人 12.5143832909
+网络协议 11.7034530746
+数百瓦 13.2075304714
+大红色 12.2912397395
+举止行为 13.2075304714
+应摊 13.900677652
+铁锨 10.0720362555
+八旗 8.33233314821
+一块儿 7.68008748188
+连贯性 11.1280889297
+领进来 13.900677652
+赵承绶 13.2075304714
+神官 12.2912397395
+扩胸 12.2912397395
+美容网 12.1089181827
+察哈尔省 10.8561552143
+葛剑雄 13.900677652
+贝莱特 13.900677652
+王屋山 10.5684731418
+神宗 9.33632946051
+小挫 13.900677652
+纸画 12.8020653633
+归乡 10.1164880181
+密织 12.5143832909
+兰草 11.7034530746
+张大复 12.5143832909
+执政权 13.2075304714
+荧幕 12.8020653633
+天威英 11.9547675029
+年过半百 11.2616203224
+五六遍 13.2075304714
+季别尔 13.2075304714
+王海山 12.2912397395
+山峦起伏 10.8561552143
+立潞王 11.4157710022
+有名有姓 11.1926274509
+放怀 11.5027823792
+售楼盘 11.7034530746
+歌乐山烈士陵园 13.900677652
+伯淳 13.2075304714
+亲热戏 13.900677652
+杨元珍 9.5062284973
+无人问津 10.2117981979
+小枣树 13.2075304714
+备感 11.3357282945
+唐道宣 12.2912397395
+阻容 12.8020653633
+于岩礁 12.8020653633
+团组织 10.5684731418
+水口山 11.5027823792
+陈宫之 12.8020653633
+符合卫生 12.5143832909
+述作 13.900677652
+多伦诺尔 12.8020653633
+河阴仓 12.5143832909
+扩股 8.98069672615
+某某人 11.7034530746
+武九姓 10.3453295905
+神密 13.2075304714
+林冲领 13.2075304714
+第日 13.2075304714
+冷丁 12.5143832909
+卖身投靠 11.4157710022
+男歌手 13.900677652
+赵恒多 13.900677652
+密约 10.0940151622
+密级 12.1089181827
+那柱 13.2075304714
+腊八粥 11.8212361103
+头疼脑热 11.0674643079
+德奋然 13.2075304714
+因果关系 9.54396882529
+明光锃亮 12.2912397395
+山村 9.62401153296
+霍勒瑞 13.900677652
+出版署 13.900677652
+溢满 11.1926274509
+希特勒 7.90422556336
+戴圣线 13.900677652
+应收 9.24671730182
+多址 11.8212361103
+煤精 12.1089181827
+歌坛 11.7034530746
+良宵美景 13.2075304714
+只不过 6.99693039439
+快快乐乐 12.5143832909
+狗彘 12.1089181827
+一封信 8.28390655431
+煤粉 11.7034530746
+输运 10.2117981979
+前些时候 11.8212361103
+宝盒 11.7034530746
+怡和 9.7898037878
+愠色 11.2616203224
+索尔邦 12.8020653633
+木胎 11.7034530746
+图书超市 13.900677652
+阎家班 13.2075304714
+夜班 9.44633035572
+循证 12.8020653633
+榴霰弹 12.2912397395
+巴尔玛 13.900677652
+眯盹儿 13.900677652
+善行 10.533381822
+武麦拉 13.900677652
+警笛声 12.8020653633
+抓获 8.87679713113
+侧后方 11.0674643079
+归人 12.2912397395
+耐低温 11.4157710022
+毫不理会 11.7034530746
+不费力气 12.1089181827
+煤系 11.2616203224
+必然王国 12.2912397395
+大生产 9.91169360541
+孝敬父母 11.4157710022
+按理 10.1871055853
+吕梁地区 12.8020653633
+食疗方 11.1926274509
+怠惰 11.2616203224
+杀人盈野 13.2075304714
+鸣冤叫屈 12.8020653633
+下不去 11.1280889297
+买受人 11.3357282945
+菊酯 12.5143832909
+寿藏 12.8020653633
+雅虎公司 13.900677652
+应敌 11.2616203224
+宝盆 13.900677652
+大化革新 13.900677652
+冷云 12.5143832909
+共苦 13.2075304714
+规范变换 12.8020653633
+归于 8.27666014579
+山海拔 9.25628675283
+神学 8.2985588311
+顺心如意 12.8020653633
+天显 11.8212361103
+刷油漆 13.2075304714
+夜总会 10.0940151622
+井隆 13.900677652
+言者谆谆 13.900677652
+博通群 12.8020653633
+是非之地 10.6818018271
+天星 7.82074445688
+善辩 11.0674643079
+朴朴实实 12.8020653633
+新风暴 13.900677652
+永住 13.2075304714
+台卡 13.2075304714
+机缘 9.6811699468
+油瓜 12.8020653633
+政府奖 12.8020653633
+天明 7.81390292506
+香港黄金 13.2075304714
+新闻通讯 12.8020653633
+回龙山 12.2912397395
+解放军理工大学 12.5143832909
+荷尔德林 12.2912397395
+玄德欲 12.8020653633
+漳浦县 11.7034530746
+天智 11.0674643079
+树新风 13.900677652
+明旨而 13.900677652
+外汇收入 9.93038573842
+禁治产 13.2075304714
+天晴 10.1394775363
+叹声 13.900677652
+誉为 8.85082164473
+杰士邦 13.2075304714
+典型值 12.8020653633
+色迷迷 11.1926274509
+电白县 13.900677652
+江珧柱 13.900677652
+阐扬 11.2616203224
+纸版 13.2075304714
+专用道 11.9547675029
+小毛病 11.2616203224
+应招 12.2912397395
+斯拉夫主义 12.1089181827
+托博尔河 12.8020653633
+擦掌 13.900677652
+天晓 9.93038573842
+副瓣 13.900677652
+纸片 9.46986085313
+雾化 11.0103058941
+废驰 13.2075304714
+培育出 10.0505300503
+虞姬 11.1280889297
+屋里人 10.4994802703
+财源滚滚 11.7034530746
+余亿吨 12.8020653633
+孙王离 12.8020653633
+天晃 13.900677652
+太仓县 12.2912397395
+发情期 11.1280889297
+吸烟室 12.8020653633
+卫运河 11.4157710022
+中心地段 12.5143832909
+赭黄 11.1926274509
+胎生动物 12.8020653633
+副理 13.900677652
+一错再错 12.2912397395
+一块块 9.5062284973
+叫喊声 10.642581114
+园外 11.5027823792
+衣梅 10.4041700905
+虞夏 12.5143832909
+神封 13.900677652
+不嫉妒 11.9547675029
+纸状 12.2912397395
+神将 10.642581114
+分赛区 12.2912397395
+漠视 9.87532596124
+几内亚湾 10.2117981979
+应战 9.31571017331
+革命家 8.84443184663
+全份 13.900677652
+花瓣儿 11.8212361103
+在职员工 12.8020653633
+暮鸦 12.1089181827
+瑞超 12.8020653633
+七损八伤 12.2912397395
+马鞭草 11.4157710022
+势如水火 12.8020653633
+汉宇 13.900677652
+山左山 13.900677652
+柴薪 11.4157710022
+张志坚 13.900677652
+寿节 12.1089181827
+天干 10.4041700905
+应承 9.32596667347
+检查部 13.900677652
+蒲师伯 13.900677652
+文化战线 11.8212361103
+美好理想 12.5143832909
+青云直上 11.5027823792
+岭下 10.604840786
+阻尼 9.80633308975
+机翼 8.48457724977
+铁打铜铸 12.8020653633
+马尔堡 11.1926274509
+奥尔梅克 11.9547675029
+碧澄澄 12.5143832909
+犬科 11.2616203224
+岭东 11.598092559
+礼仪之邦 11.7034530746
+高下在心 13.900677652
+应扣 13.900677652
+自满情绪 13.2075304714
+钩子 10.2630914922
+掌铨选 13.2075304714
+低胸装 13.2075304714
+永和镇 12.5143832909
+稿本 11.3357282945
+应手 11.4157710022
+石及茂 13.2075304714
+反射角 13.2075304714
+帮闲 11.0103058941
+晋赵鞅 12.5143832909
+任忠 13.900677652
+伯母 9.77354326693
+天机 9.38981814546
+老丫挺 13.2075304714
+丁烯二 12.5143832909
+施以 9.46986085313
+施令 13.2075304714
+苏鲁 12.1089181827
+西水股份 12.8020653633
+第九十七 13.2075304714
+汉家 9.94943393339
+躯体 8.29487558568
+体弱者 11.5027823792
+空气滤清 12.1089181827
+征求意见 8.36728816325
+抱拳 9.6811699468
+绣像 11.5027823792
+鲨鱼 8.6803218269
+企业名称 12.1089181827
+包治百病 12.8020653633
+三十余万户 13.2075304714
+乌桓攻 13.2075304714
+天朗 12.8020653633
+侍一夫 12.8020653633
+羊腿子 13.900677652
+凤哥 13.2075304714
+地窝子 12.5143832909
+闹起 11.4157710022
+别无良策 12.1089181827
+歪歪斜斜 10.0294766411
+四十九根 12.8020653633
+皮金语 12.2912397395
+快手快脚 12.8020653633
+脸部 8.96620371885
+择机 8.97342396682
+燎炬 13.900677652
+穷追不舍 10.3743171274
+第九十九 13.2075304714
+昏鸦 12.2912397395
+应援 10.533381822
+肝俞 13.2075304714
+松雪斋 12.8020653633
+夏景诗 13.2075304714
+痒酥酥 13.900677652
+天条 10.6818018271
+备有 9.10488710638
+断篇残简 13.900677652
+抱抱 10.1630080337
+夏侯渊领 13.2075304714
+择期 11.9547675029
+上学 7.69611988941
+关系紧张 10.9562386728
+巫云 13.2075304714
+应提 13.900677652
+唐宗宋 12.1089181827
+刘凤起 13.2075304714
+神巫 11.7034530746
+算盘 8.94485059437
+贪赃坏法 13.900677652
+负电极 12.5143832909
+淡扫蛾眉 13.900677652
+隐头花序 13.2075304714
+施予 11.7034530746
+施事 13.900677652
+违反规定 10.3743171274
+采尔 12.8020653633
+家得宝 13.900677652
+但俊奇 13.2075304714
+黄一彪 8.1608847398
+孙红雷 10.2117981979
+欧安组织 13.2075304714
+土褐色 13.2075304714
+天枢 11.1926274509
+任高卢 12.5143832909
+六十三卷 12.8020653633
+降龙伏虎 11.4157710022
+阳光化 11.598092559
+艾瑞 10.9049453784
+副处长 8.77671367257
+二进制位 13.900677652
+高仪 9.56994431169
+昏黄 9.36807815882
+三文治 13.900677652
+撷取 11.5027823792
+备查 11.0103058941
+石家庄战役 12.2912397395
+天极 11.0103058941
+凡夫俗子 10.604840786
+马尔奈 12.8020653633
+昏黑 10.533381822
+煤窑 10.3453295905
+施临 13.2075304714
+六七千两 13.2075304714
+支撑架 12.8020653633
+天柱 10.2371160058
+仓山 11.9547675029
+艾琳 11.9547675029
+施主 9.18217878068
+出版社 8.43261751084
+密码 7.78258045393
+吃喝 8.70772080109
+澡塘 12.2912397395
+汪优 12.8020653633
+断断续续 8.64840422393
+又高又大 11.1280889297
+机组 8.42421410004
+化学元素 8.69119149913
+机织 11.4157710022
+施业 13.900677652
+瞽者 12.8020653633
+施万 11.9547675029
+狗头 10.1394775363
+施丁 12.5143832909
+桔子皮 13.900677652
+狮泉河 11.4157710022
+庆尚南道 13.2075304714
+施与 12.2912397395
+受让方 9.21854642485
+百万条 12.8020653633
+采得 10.9562386728
+神庙 8.55834340001
+基层组织 9.4233408375
+神府 11.4157710022
+晾衣服 11.598092559
+扁率 11.7034530746
+制造厂 9.06439574502
+伊尼扬 13.2075304714
+化疗 10.0088573539
+楚简 12.8020653633
+导致 5.09875674793
+伴随 6.80395627348
+刘僧绍 13.900677652
+成祖初 13.2075304714
+海运公司 12.2912397395
+前半生 11.7034530746
+缝成 12.1089181827
+巴尔登 13.900677652
+淘金 9.29550746599
+社队 11.598092559
+血债累累 13.2075304714
+庙主 12.8020653633
+茅盾 9.65218240993
+追星族 12.1089181827
+神庭 13.2075304714
+船期表 13.2075304714
+石油设备 11.9547675029
+寿者 12.8020653633
+寿考 12.2912397395
+张表 11.4157710022
+水铝石 12.5143832909
+明确任务 11.7034530746
+五十六岁 11.7034530746
+纸灯 11.598092559
+吴建号 13.2075304714
+钱思亮 13.2075304714
+井水 9.6811699468
+插上去 12.5143832909
+莱芜 10.0294766411
+晾衣杆 13.900677652
+清东陵 11.2616203224
+二百千米 13.2075304714
+总趋势 10.1164880181
+违逆 12.1089181827
+教学资料 13.900677652
+申诉书 13.900677652
+园寝 12.5143832909
+蝶呤 13.900677652
+纸灰 10.533381822
+二氯乙烷 11.598092559
+美国会 11.1280889297
+滑过来 13.2075304714
+同恶相济 13.2075304714
+嶙嶙 13.2075304714
+汉寿 10.8561552143
+三和银行 13.2075304714
+摇羽毛扇 13.2075304714
+冲任 11.1280889297
+皮革业 12.5143832909
+事业兴旺 13.900677652
+教会法规 12.8020653633
+虚度一生 13.2075304714
+恐怖片 13.900677652
+女同事 11.9547675029
+中国家电 12.1089181827
+凉面 13.900677652
+一百八十四公里 13.2075304714
+睦邻政策 11.9547675029
+芳香烃 11.9547675029
+盲哑 13.900677652
+认定书 11.9547675029
+申诉人 12.5143832909
+自卫还击 11.1280889297
+钩头 13.2075304714
+和慧梅 9.82314020807
+筑造 12.1089181827
+凉鞋 11.0674643079
+防洪堤 11.9547675029
+尚福林 8.04560572977
+忆昔 11.7034530746
+记忆力 9.26594866375
+应急 7.92432674268
+崔颢 11.9547675029
+冲上 8.85725253506
+主谓结构 13.2075304714
+交回来 13.2075304714
+夜盲 12.1089181827
+武仁 12.8020653633
+井法 13.2075304714
+蒙戈湖 12.8020653633
+马直抢 11.9547675029
+体检工作 12.2912397395
+井泉 11.8212361103
+今江陵 12.5143832909
+武经七 11.0674643079
+龙袍加身 13.900677652
+魏文长 12.8020653633
+受尽折磨 11.9547675029
+按照 5.02343521598
+雾凇 11.9547675029
+十万美元 12.8020653633
+采录 11.1280889297
+豆沙月饼 13.900677652
+稠度 12.8020653633
+旱鸭子 12.2912397395
+和惠 12.5143832909
+武皇 13.900677652
+扈成 11.598092559
+狄之君 12.5143832909
+叛逃 10.4994802703
+释氏 12.1089181827
+叛逆 9.23723855786
+抡起 9.93038573842
+志锐 13.2075304714
+眯着眼 10.0720362555
+谢天谢地 9.7898037878
+那鹰 12.1089181827
+一差二错 13.900677652
+父党 12.8020653633
+苦涩味 13.900677652
+积雪 7.76945116249
+叹赏 11.598092559
+国家级 8.19356738723
+礼崩乐坏 12.2912397395
+枥木县 12.8020653633
+生殖崇拜 11.598092559
+红桥区 12.2912397395
+隔行 12.8020653633
+伯格 9.43476953332
+孢子 8.57280148319
+纸烟 8.65365357982
+伯根 11.7034530746
+独立厅 12.8020653633
+剖肝沥胆 13.900677652
+全休 13.900677652
+荒乱 11.5027823792
+百思买 10.8561552143
+躁狂症 12.5143832909
+专用汽车 13.2075304714
+顺序存储 13.2075304714
+肖奎 10.8561552143
+琴纳 11.3357282945
+股东大会 7.15191810448
+朦胧 7.1241706596
+神往 10.0294766411
+农经 13.2075304714
+冷藏车 12.2912397395
+养生送死 13.900677652
+中医中药 10.9562386728
+母后 8.47572763449
+轻便型 13.900677652
+远大抱负 12.1089181827
+安装文件 13.900677652
+归仁军 13.2075304714
+取用 10.6818018271
+存放程序 13.2075304714
+航天桥 13.2075304714
+立太子 10.2630914922
+录事 10.604840786
+贝勒者 13.2075304714
+格子窗 13.900677652
+陆树德 10.3453295905
+荀子皆 13.2075304714
+四亿五千万两 12.2912397395
+天数 9.24671730182
+合唱曲 11.0674643079
+纸煤 12.5143832909
+神志 9.34680076038
+仓廪 10.4666904475
+轻声道 11.1926274509
+鹦哥 10.3453295905
+安达卢西亚 11.598092559
+扮鬼脸 12.8020653633
+狗宝 12.5143832909
+布勒伊拉 13.900677652
+呈文 10.2630914922
+狗官 11.1280889297
+缰绳 8.66956903512
+普里东 13.900677652
+洋葱头 12.2912397395
+西川之 12.2912397395
+肖天 13.2075304714
+肖夫 12.2912397395
+荒丘 12.5143832909
+伴音 11.1280889297
+开曼群岛 11.5027823792
+刑徒伐 13.2075304714
+浇薄 12.5143832909
+男士服装 13.2075304714
+天敌 9.04086524761
+盖尔德 11.9547675029
+拳脚相加 13.2075304714
+大余县 12.2912397395
+无法比拟 10.1871055853
+典型化 12.1089181827
+天方 10.4994802703
+热量资源 11.2616203224
+艾登 11.0674643079
+循迹 12.1089181827
+蚰蜒 10.2630914922
+孑然 12.8020653633
+简单劳动 11.0674643079
+黑货 12.1089181827
+井深 11.5027823792
+冰淇淋 10.8561552143
+王老爷 10.642581114
+师必缺 12.5143832909
+格杀勿论 11.0674643079
+电火锅 13.900677652
+择日 9.93038573842
+煤碳 12.8020653633
+独走 13.900677652
+抬不动 11.9547675029
+盐井县 11.7034530746
+非常热心 12.5143832909
+毁约 10.604840786
+低剂量 12.8020653633
+录下 9.49395840471
+隐者 11.7034530746
+抱恨 11.8212361103
+公务在身 12.2912397395
+运城市 11.7034530746
+天文 7.45973111134
+诸暨市 12.2912397395
+银母 13.900677652
+社会阶层 10.0294766411
+单刀赴会 11.598092559
+熏天 11.0674643079
+武丑 12.5143832909
+天旱 10.7226238216
+备料 11.5027823792
+天时 9.45802639549
+脑体倒挂 13.900677652
+申诉信 13.900677652
+绿树成荫 11.598092559
+天授礼法延祚 10.9562386728
+不此之图 12.8020653633
+巴托罗 11.8212361103
+谢维扬 13.2075304714
+天日 10.4041700905
+绣制 11.598092559
+马六甲海峡 9.7898037878
+牧斋 11.0674643079
+莱茵 8.56795885871
+恢复性 9.59661255877
+脾俞 12.8020653633
+繁殖力 9.59661255877
+奋斗到底 13.900677652
+夏侯蔼领 12.2912397395
+袁术引 13.2075304714
+副睾 13.900677652
+皓月 10.604840786
+语言文字工作委员会 12.1089181827
+李铁 11.1926274509
+抱怨 7.76511276089
+米谷 11.2616203224
+自我陶醉 11.3357282945
+整间 12.8020653633
+奎屯河 13.2075304714
+共餐 13.2075304714
+阿基 11.3357282945
+勘验 10.765183436
+太仓促 11.4157710022
+肝功 11.1926274509
+阿达马瓦 12.8020653633
+思君 12.2912397395
+存心养性 13.2075304714
+批核 13.900677652
+勾一勾 13.2075304714
+茅棚 11.598092559
+应约 11.8212361103
+志诚 11.0674643079
+詹霸 13.2075304714
+跳伞 10.1394775363
+多日不见 11.3357282945
+桃儿七 12.2912397395
+符号 7.28461246684
+密切接触 10.604840786
+兰顿 13.900677652
+许兀慎 13.2075304714
+阿城 11.1926274509
+吹起来 11.2616203224
+显生宙 11.598092559
+密旨 10.3743171274
+那秦钟 12.5143832909
+营帐 9.82314020807
+天穹 10.7226238216
+战胜国 10.4349417492
+天空 6.90491149567
+英国文学 10.7226238216
+至孝 11.7034530746
+送交给 13.2075304714
+伯皇 13.2075304714
+没亲没故 13.2075304714
+马来语 10.604840786
+十两左右 13.2075304714
+积血 11.0674643079
+响堂铺 13.900677652
+密文 11.2616203224
+马雅可夫斯基 10.765183436
+普天同 13.2075304714
+应给 11.1280889297
+戈林 10.5684731418
+占田数 12.8020653633
+弄碎 12.5143832909
+那铜鼎 12.5143832909
+地球化学 8.98069672615
+反射镜 10.0294766411
+夜校 10.4994802703
+宣布独立 9.01787572939
+德尔诺夫舍克 13.900677652
+勇士 8.77671367257
+施压 9.37888907493
+密斯 11.7034530746
+红酥手 13.2075304714
+摩诃萨 13.900677652
+喀琅施塔 12.2912397395
+八百万两 13.2075304714
+北京鸭 11.3357282945
+沈万三 12.8020653633
+沈从文 11.1926274509
+大动脉 9.61021821083
+莫过于 8.90346537821
+科特曼 12.5143832909
+阿坝 10.1630080337
+安全壳 12.5143832909
+伍人相 13.2075304714
+天窗 9.04864738806
+江西腊 13.900677652
+阿坎 13.2075304714
+冒领 11.4157710022
+茅丛里 13.2075304714
+洪承畴 7.09495509856
+天突 13.2075304714
+河港 9.14708746087
+竦然 13.2075304714
+低陷 12.2912397395
+隔阂 9.59661255877
+荒凉 8.73589167805
+楚德湖 13.900677652
+天竹 12.8020653633
+天竺 9.00283785202
+当国 10.8096351986
+海盐 9.25628675283
+帮规 12.8020653633
+明日黄花 12.1089181827
+裘世安 13.2075304714
+六十三万 12.5143832909
+荒冢 12.2912397395
+营建 8.70218062071
+录入 10.604840786
+川木通 13.2075304714
+卢昭容 13.900677652
+佑助 13.2075304714
+偶联剂 12.5143832909
+符取 13.2075304714
+中央人民广播电台 10.765183436
+陶尔斐 12.1089181827
+反叛者 11.5027823792
+黄骨鱼 13.2075304714
+刘銮雄 13.2075304714
+没说到 11.9547675029
+那真仙 12.8020653633
+暮色 8.60236028543
+唐降 13.2075304714
+一相情愿 12.5143832909
+吴带当风 12.1089181827
+迪斯尼公司 10.4666904475
+六十三个 12.8020653633
+当场 7.57990935773
+阿国 12.5143832909
+第三盏 13.2075304714
+燎泡 11.8212361103
+蔡子民 13.2075304714
+黑岗口 11.7034530746
+安全套 10.765183436
+木驴 12.2912397395
+于铁坚 13.2075304714
+交梨火枣 13.900677652
+当在 10.2117981979
+老鼠药 10.0294766411
+检查费 11.9547675029
+木马 11.1926274509
+平西伯 9.5062284973
+葬送掉 13.900677652
+剪枝 12.1089181827
+第群 13.2075304714
+冲冲 10.533381822
+铝矾土 9.72629038208
+本来面目 10.0088573539
+攻上去 12.8020653633
+第一季度 8.13235665618
+髀关 13.900677652
+鲍尔温 13.2075304714
+铁面孔 11.0674643079
+苹果 7.53420720424
+格调高雅 12.5143832909
+箱门 12.2912397395
+保卫祖国 10.4349417492
+未遂政变 12.5143832909
+取款 10.3171587135
+颖脱 13.2075304714
+万胜 11.2616203224
+尹志平 13.2075304714
+逸夫楼 13.900677652
+哈麻 11.8212361103
+天柱剑 13.900677652
+待业保险 12.8020653633
+隔音 10.2371160058
+屡犯 10.9049453784
+到期 6.8367736905
+高叉胖 13.2075304714
+韧度 12.2912397395
+罗玛克 13.900677652
+玛峰 13.900677652
+施加 8.80081122415
+摩羯座 12.2912397395
+打拍子 12.1089181827
+冲凉 12.5143832909
+同心 8.75901409547
+竹茹 12.2912397395
+搬迁户 12.1089181827
+帮衬 10.4349417492
+归向 13.900677652
+超氧化物 11.9547675029
+泪涔涔 13.900677652
+施力 12.8020653633
+外生殖器 10.533381822
+天等 12.2912397395
+怡乐 13.2075304714
+听取汇报 11.9547675029
+王李治 13.2075304714
+双喜临门 11.598092559
+德州仪器 13.2075304714
+布法罗 10.8561552143
+忌日 10.9562386728
+汝等远 13.2075304714
+谷守边 12.8020653633
+表演艺术家 9.94943393339
+荒僻 10.0720362555
+岭南 8.37124856446
+军政府 9.09665660724
+肾脏病 9.80633308975
+怡人 11.4157710022
+武装革命 12.5143832909
+同科 11.4157710022
+国土规划 11.9547675029
+樊粹庭 12.8020653633
+对薄公堂 12.5143832909
+曹军水 12.5143832909
+层积云 12.1089181827
+纵横家 10.642581114
+学生娃 11.8212361103
+勇夺 11.598092559
+燕破齐 12.8020653633
+崔融 12.5143832909
+红学家 13.900677652
+粥少僧多 13.900677652
+缩头乌龟 12.2912397395
+惹祸上身 11.9547675029
+峻厉 13.2075304714
+勇夫 12.1089181827
+侍皇帝 13.2075304714
+艾根 12.8020653633
+谢弗勒 13.2075304714
+长流水 12.1089181827
+画中有诗 12.2912397395
+躲过一劫 11.9547675029
+贫病交攻 13.900677652
+无应答 12.5143832909
+中华全国新闻工作者协会 11.598092559
+天篷 13.2075304714
+鲁宣公 12.8020653633
+韧带 9.48183704418
+岭北 10.3743171274
+沈丹 11.8212361103
+家乐福 9.06439574502
+沃森特 13.900677652
+普拉德霍湾 13.2075304714
+游三辅 13.2075304714
+冲关 11.0103058941
+储存期 12.1089181827
+银河证券 7.68807155622
+克钦人 11.9547675029
+山桃 11.8212361103
+宣宗南 11.3357282945
+能奈 12.8020653633
+冲入 9.41204128224
+燕归魏 12.8020653633
+施米登 13.900677652
+酚类 10.4994802703
+归咎 11.3357282945
+经常出现 9.5186510173
+苏堤春 12.5143832909
+宝秀 12.5143832909
+至多 9.18217878068
+消毒剂 10.642581114
+宗发兵 13.2075304714
+黄光升 12.8020653633
+冲力 10.765183436
+秋毫无犯 9.82314020807
+簌地 13.900677652
+旧俗 10.2371160058
+阿契贝 13.2075304714
+欣德 13.900677652
+深水炸弹 10.1164880181
+小站稻 12.1089181827
+冲劲 11.1926274509
+郭逸 12.8020653633
+艘次 13.2075304714
+艾比 11.7034530746
+黄劭 12.8020653633
+吃吃饭 12.8020653633
+毡子 11.3357282945
+信守诺言 12.1089181827
+取样 9.98865464655
+缙云山 11.0674643079
+哈齐 11.8212361103
+一百六十八种 13.2075304714
+欣快 11.598092559
+椭圆 8.82550383674
+张裔 12.5143832909
+密林 8.76487921493
+反射面 11.8212361103
+天空光 13.2075304714
+直直地 9.58318953844
+唐知州 13.2075304714
+黄艳艳 13.2075304714
+美国化 13.2075304714
+渭滨 11.9547675029
+当周 8.60737282725
+沧溟 12.5143832909
+营山 13.900677652
+冷场 10.4994802703
+桀骜 11.4157710022
+武侠 11.0103058941
+田园诗 10.6818018271
+翼手龙 13.2075304714
+玄德甚 12.5143832909
+参事官 12.5143832909
+打手势 11.3357282945
+录取 8.89004235788
+三四千万元 12.8020653633
+陆修静 11.4157710022
+冷圈 13.900677652
+蓝四旗 12.8020653633
+克菲尔德 10.9049453784
+偏心眼 13.2075304714
+第九十六 12.5143832909
+小毛毛 13.900677652
+江珧科 13.2075304714
+四海为家 11.1926274509
+要同 9.38981814546
+引车卖浆 12.2912397395
+梧州市 11.3357282945
+河以东 11.1280889297
+面试题 12.8020653633
+芝加哥 8.17709255002
+收收 11.9547675029
+毁掉 9.10488710638
+乍听 11.8212361103
+沟底 10.7226238216
+罗马帝国 7.92432674268
+气愤填膺 12.2912397395
+马千乘 13.2075304714
+邻苯二甲酸氢钾 13.2075304714
+伯瑞 13.900677652
+秘洞 11.2616203224
+翕动 10.4349417492
+一十三名 13.900677652
+送别 9.82314020807
+武侠小说 10.8096351986
+素有人望 13.900677652
+贪黑 13.900677652
+成绩突出 11.3357282945
+马郎加 13.2075304714
+魏国大 12.8020653633
+冲刷 8.87023973058
+冲到 8.4801426527
+流传后世 11.5027823792
+吸盘 9.65218240993
+冲刺 9.14708746087
+二亿三千多万 13.900677652
+施兄 13.900677652
+番族 12.8020653633
+卡拉汉 12.5143832909
+万世师表 12.8020653633
+尤瑞那 13.2075304714
+霍普金斯大学 10.4041700905
+柔肤水 13.900677652
+智者见智 12.1089181827
+王勃 10.8096351986
+胜利在望 11.8212361103
+摊位费 12.5143832909
+文华奖 13.900677652
+彼特拉克 11.2616203224
+伯理 12.5143832909
+藏骨沟 10.4666904475
+冲剂 10.5684731418
+八佰伴 13.900677652
+程氏易 12.8020653633
+冰岛语 12.2912397395
+有机肥 10.765183436
+成祖皇帝 11.4157710022
+超声速 10.2897597393
+木香 10.4349417492
+杜青海 10.3453295905
+蒙博托 11.8212361103
+若干部 11.7034530746
+荒原 8.80081122415
+读卖新闻 11.8212361103
+团体票 12.8020653633
+兴义市 12.1089181827
+抱紧 10.5684731418
+吏官 13.2075304714
+思园 13.2075304714
+芳香油 10.2371160058
+东三环 11.2616203224
+桑吉卓 9.7898037878
+安鹤宫 12.5143832909
+立司马昱 12.8020653633
+另唱 13.2075304714
+冷噤 12.5143832909
+舍近取远 13.900677652
+昏聩 11.0103058941
+批次 8.85725253506
+冷器 12.1089181827
+剪断 11.1280889297
+建漆 13.900677652
+楚汉之争 13.900677652
+阿哥 6.94508504358
+李镇 11.5027823792
+蒸点 13.900677652
+排水阀 13.2075304714
+南溪温泉 13.2075304714
+全信 11.2616203224
+宏恩 13.900677652
+胰腺癌 11.2616203224
+投机取巧 11.5027823792
+三百多万 12.5143832909
+开宗明义 11.5027823792
+经史子集 11.3357282945
+话不投机 11.0674643079
+怨曲 13.900677652
+阿哈 11.3357282945
+观星台 11.1280889297
+恢复系 13.2075304714
+输液瓶 12.8020653633
+黄家湖 13.900677652
+没说出 10.7226238216
+人流量 11.2616203224
+个别谈话 12.2912397395
+水利科学 11.9547675029
+鲁拜诗 12.8020653633
+隔间 12.8020653633
+井然 12.5143832909
+黄家渡 13.2075304714
+耍太极 13.900677652
+天童寺 11.9547675029
+值不值 11.598092559
+冷嘲 12.1089181827
+专用车 10.9049453784
+蛋花汤 11.9547675029
+华制华 13.2075304714
+牙痒痒 11.598092559
+滚子 11.9547675029
+八九十岁 13.2075304714
+筑路 10.0940151622
+铁骑 9.21854642485
+合法权益 7.98447558937
+天祝 12.8020653633
+伴读 11.598092559
+天神 9.00283785202
+扩频 13.2075304714
+纸浆 9.62401153296
+舱房 13.2075304714
+白云洞 11.7034530746
+质量评比 13.900677652
+双泉堡 13.2075304714
+成年人 8.63281949291
+冲口 11.4157710022
+登堂入室 12.1089181827
+搁起来 13.2075304714
+力尽神危 13.900677652
+卡尔戈阿 13.900677652
+孙中界 10.765183436
+秀丽 8.56313957227
+共骑 13.2075304714
+社论 9.69598503258
+玉玲 12.2912397395
+康雍乾 13.2075304714
+印度象 13.900677652
+天禾 12.8020653633
+归国 8.78868986362
+溢目 13.900677652
+志行 13.2075304714
+录到 13.900677652
+铠甲 9.19114745066
+贪污腐化 11.2616203224
+信息格式 13.2075304714
+归因 11.2616203224
+横亘在 10.9562386728
+综核 13.900677652
+国家教育部 12.5143832909
+乳突 10.642581114
+天禧 11.5027823792
+制造业 6.52354393914
+祁门红 11.5027823792
+孔成象 13.900677652
+三百多个 11.9547675029
+何莉莉 13.900677652
+死硬派 13.900677652
+归回 13.2075304714
+主动出击 10.0720362555
+百列 13.2075304714
+出版权 13.2075304714
+二姓之好 13.900677652
+十万大山 11.1926274509
+天福 9.93038573842
+德姆贝 13.900677652
+要求者 12.8020653633
+忠君 10.533381822
+施肥量 12.1089181827
+天禄 11.2616203224
+呈祥 12.5143832909
+离合器 9.55687223012
+阿吾 13.2075304714
+牙骨质 13.2075304714
+择业 11.1926274509
+万股 5.7926564306
+筑起 9.43476953332
+亲兄妹 12.1089181827
+思域 11.9547675029
+四十九盏 12.5143832909
+天悬地隔 13.2075304714
+女诗人 11.1280889297
+阿含 11.2616203224
+病原学 11.1280889297
+大批大批 12.1089181827
+公安交通 12.5143832909
+钙塑 13.2075304714
+纳玛象 12.2912397395
+铃木大拙 13.2075304714
+讪讪地 10.4666904475
+正合我意 11.5027823792
+一下眼 11.8212361103
+共振器 13.900677652
+呈示 13.2075304714
+农户 8.25170341381
+纸包儿 12.1089181827
+阿君 12.8020653633
+忠告 9.89334446674
+喝一杯 9.58318953844
+释然 10.4041700905
+同年 6.23445572631
+淡盐水 11.8212361103
+叛贼 10.7226238216
+电视记者 13.2075304714
+墒情 12.2912397395
+营州 10.8096351986
+江夏王 12.1089181827
+军事地理 11.2616203224
+叹道 8.28754954559
+社评 12.1089181827
+卢沟桥事变 10.6818018271
+资源分配 11.0674643079
+王大发 10.2371160058
+专类 11.9547675029
+致胜 10.8096351986
+逛游 13.900677652
+大家族 9.84023464143
+当到 10.9049453784
+阿史 10.4994802703
+忌恨 10.1164880181
+黄体芳 12.5143832909
+归入 8.77077893705
+实战演习 12.8020653633
+赌命 13.2075304714
+孟母三迁 13.900677652
+归公 10.4666904475
+剪报 11.9547675029
+溶剂油 11.8212361103
+阿古 11.5027823792
+忠县 11.1926274509
+文才出众 13.2075304714
+农时 10.533381822
+至强 12.2912397395
+拖曳阵 12.5143832909
+当初 6.7152906364
+阿叔 10.3743171274
+上一年 9.94943393339
+冷光 10.533381822
+汤沐 12.2912397395
+安徽省 8.10766404359
+细高 11.598092559
+王命询 13.2075304714
+宓母 12.1089181827
+归元 12.8020653633
+忠厚 9.80633308975
+绮艳 13.2075304714
+蔽光 12.5143832909
+晒乾 13.900677652
+检查表 13.2075304714
+站长站 12.8020653633
+至当 12.2912397395
+两连胜 13.900677652
+鹿马勺 12.1089181827
+同盟者 9.98865464655
+进水管 13.900677652
+首都图书馆 13.2075304714
+机杼 12.5143832909
+镶花 12.1089181827
+金蛇游 13.900677652
+蒙文 10.604840786
+全面推行 10.1630080337
+出言不慎 13.2075304714
+小三儿 13.2075304714
+荒唐 8.44109213783
+楼堂馆所 12.8020653633
+科研单位 9.96885201925
+编织带 13.900677652
+邹太太 11.0674643079
+大竹林 13.2075304714
+同步器 11.8212361103
+刘焕 12.1089181827
+乌巢禅师 12.2912397395
+当前 5.56428717138
+四眼鱼 11.598092559
+志达 12.8020653633
+以情感人 13.900677652
+佘山 12.2912397395
+态势 6.13045444782
+人格特质 13.2075304714
+冲向 9.19114745066
+机枪 7.34106241448
+忌惮 10.0940151622
+资金占用 10.0940151622
+天纵 10.3453295905
+郭世广 12.5143832909
+另加 10.4349417492
+勇将 11.8212361103
+生命垂危 11.1280889297
+斯德哥尔摩大学 11.598092559
+伯牙 11.1280889297
+马戏场 13.900677652
+特洛伊 10.0505300503
+盲从 10.9562386728
+王仲荦 10.8561552143
+持矛 11.8212361103
+阿卡 11.2616203224
+穴居 9.74179456862
+阿南 12.8020653633
+艾浑 13.2075304714
+井盖 12.1089181827
+至德 10.1164880181
+井盐 10.533381822
+莱顿 10.604840786
+应税 10.6818018271
+喷饭 12.2912397395
+伯特 11.0674643079
+个体经营 10.9562386728
+冷凝 9.80633308975
+斯塔林 12.1089181827
+摆进来 13.2075304714
+西里伯 13.2075304714
+安全岛 13.900677652
+保险业务 9.80633308975
+庄基 11.9547675029
+沟壕 11.7034530746
+天一亮 10.3171587135
+沟壑 9.61021821083
+冷冷 10.0940151622
+至心 12.8020653633
+步险棋 11.5027823792
+极度地 11.598092559
+复辟 8.4980002701
+木龙 11.9547675029
+饶州窑 13.900677652
+越陷越深 10.9562386728
+卦象 9.43476953332
+巴尔河 12.8020653633
+东方宾馆 11.3357282945
+火麻仁 13.2075304714
+最低水平 9.04086524761
+挖土机 12.2912397395
+机柜 13.2075304714
+存续期 9.66657114738
+按次 12.5143832909
+伯父 8.93783302172
+伯爵 8.40350942668
+余家 8.66956903512
+土荆皮 13.900677652
+狄之俗 13.2075304714
+木鹿 11.598092559
+同座 13.2075304714
+冲喜 11.598092559
+马良之 13.2075304714
+又复归于 12.1089181827
+王大勇 13.2075304714
+救世主 9.96885201925
+飞出去 10.8096351986
+剪接 11.3357282945
+大小通吃 13.900677652
+书声朗朗 13.900677652
+天缘 11.5027823792
+无牵无挂 10.765183436
+坎伯利 12.8020653633
+泰拉斯 13.2075304714
+数百次 11.9547675029
+龙抱柱 12.8020653633
+李闯 11.9547675029
+皮革商 13.900677652
+阿勒 10.765183436
+岑格鲁 13.2075304714
+观察点 11.7034530746
+违警 13.2075304714
+剪掉 10.2371160058
+买办阶级 11.7034530746
+备置 11.9547675029
+阿勃 12.8020653633
+马戏团 11.4157710022
+井眼 13.2075304714
+嫉妒 8.61747392324
+絮凝剂 12.5143832909
+伯玉 12.8020653633
+貂蝉满座 13.900677652
+当即 7.57095674645
+抱窝 13.2075304714
+复轨 13.900677652
+言之成理 12.2912397395
+李王亲 13.2075304714
+钻过 11.0103058941
+农林牧业 11.5027823792
+阿列克谢耶芙娜 13.900677652
+机智 9.0884932966
+亚洲开发银行 9.84023464143
+天罡 10.642581114
+煽风点火 11.0674643079
+木鸡 12.1089181827
+五颗星 12.5143832909
+几百万种 13.2075304714
+阿加 11.4157710022
+天罚 11.9547675029
+忠勇 10.2897597393
+石之弓 13.2075304714
+相丁谓 13.2075304714
+出租汽车 10.0088573539
+劝降书 11.3357282945
+数百步 11.4157710022
+想尽方法 13.900677652
+脑外科 12.1089181827
+思想路线 10.8561552143
+坠子 11.0103058941
+当午 12.8020653633
+交相辉映 10.3171587135
+营子 10.8561552143
+抱进来 12.8020653633
+二粒 12.8020653633
+排班 10.6818018271
+奖品 9.69598503258
+言论自由 10.7226238216
+扫帚星 11.598092559
+旅行者 9.74179456862
+不尽合理 11.2616203224
+捅马蜂窝 12.8020653633
+应邀出席 11.9547675029
+鲁子敬 11.5027823792
+讥刺 10.2371160058
+防老剂 13.900677652
+汉士族 12.2912397395
+格格不入 10.0294766411
+环境光 12.8020653633
+交出来 10.1871055853
+天柱军 13.2075304714
+僧尼 9.93038573842
+夜深 9.34680076038
+左廊 12.8020653633
+钱宝琮 12.5143832909
+准确率 10.642581114
+宣礼词 13.900677652
+望风而逃 11.9547675029
+违误 11.7034530746
+郑德成 12.2912397395
+白云母 10.4349417492
+微观 8.03138073884
+菜园坝 13.2075304714
+伊万诺维奇 13.2075304714
+扁桃 11.1926274509
+第九十回 12.2912397395
+营寨 8.74162235276
+细石器 10.8096351986
+法制宣传 10.7226238216
+剿共 10.1394775363
+劳师无 12.1089181827
+当可 11.9547675029
+冷傲 11.7034530746
+阿利 10.8561552143
+回信 9.26594866375
+当口 9.41204128224
+康前临 13.2075304714
+罗慕路 12.8020653633
+伦敦证券交易所 13.2075304714
+向元廷 12.2912397395
+跨度长 13.900677652
+另取 13.2075304714
+阿列 12.1089181827
+应答 9.13850371718
+呈缴 12.8020653633
+阿尔利 13.900677652
+厚角组织 11.8212361103
+思凡 11.1280889297
+岭地 13.900677652
+施米特 10.9049453784
+阿布鲁 12.5143832909
+大批出没 13.900677652
+一百五十步 12.2912397395
+读入 11.9547675029
+当值 9.13850371718
+埃菲社 12.5143832909
+工程师学 13.2075304714
+强梁 11.598092559
+冷却 8.18364995057
+荒坡 10.9562386728
+老古板 12.5143832909
+机收 11.8212361103
+纸样 13.900677652
+阿凡 13.900677652
+回丝 11.7034530746
+挡球 12.8020653633
+免课 13.900677652
+键盘 9.5186510173
+张老汉 13.2075304714
+俄罗斯联邦委员会 13.2075304714
+荒坟 10.7226238216
+表针 12.5143832909
+于天凤 13.2075304714
+另借 13.900677652
+数百根 13.2075304714
+王行瑶 13.2075304714
+取水 9.69598503258
+三脚架 11.1280889297
+男篮 11.3357282945
+教好 11.9547675029
+锡业 11.2616203224
+杨慎矜 11.9547675029
+卧槽马 13.2075304714
+团体活动 12.8020653633
+农林 8.92394390956
+吴阿姨 12.8020653633
+荒地 8.80081122415
+普利谢 12.8020653633
+闲员 13.900677652
+王大军 12.2912397395
+家破人亡 9.75754292558
+白胡子 9.59661255877
+行李物品 11.5027823792
+东三省 9.30555780184
+黄牛党 11.1280889297
+吃个 10.0720362555
+归化 10.765183436
+机敏 9.53122979951
+志趣 10.4349417492
+被服厂 11.3357282945
+安全帽 12.2912397395
+阿布鼐 12.8020653633
+彭博社 10.4994802703
+牟其中 13.2075304714
+神来之笔 11.7034530746
+荀文若 12.5143832909
+密接 12.1089181827
+社会贤达 11.598092559
+天籁 9.94943393339
+元昊皇后 13.2075304714
+阿内 12.8020653633
+安全带 10.2897597393
+王保保 13.900677652
+及格赛 13.900677652
+奥吉尔 13.2075304714
+阿兹 11.8212361103
+叫好声 11.0674643079
+汤泼 13.2075304714
+蒙日 11.3357282945
+阿兵 10.5684731418
+决胜局 12.1089181827
+俯首甘为孺子牛 13.2075304714
+思力 12.8020653633
+阿兰 10.2117981979
+阿公 10.7226238216
+不乏其人 11.1926274509
+录在 13.2075304714
+毁林 11.1926274509
+归口 10.5684731418
+重新储存 13.900677652
+台山县 11.8212361103
+折箭为誓 11.8212361103
+磁放大器 12.8020653633
+偏门 12.1089181827
+武宫正树 12.8020653633
+秤星 13.2075304714
+杨桃汁 13.900677652
+阿克 10.0940151622
+阿巴公 13.2075304714
+重重的 9.44633035572
+阿兄 13.900677652
+巨量 9.0884932966
+金属腐蚀 11.8212361103
+冷厥 13.900677652
+普里莫 12.2912397395
+吃亏 8.41173992582
+光敏感性 13.900677652
+黄梅天 12.8020653633
+偏心率 11.1926274509
+归去 10.1164880181
+区法院 12.2912397395
+以勤补拙 13.900677652
+亿公斤 10.9562386728
+取法 10.1871055853
+国弘化 12.8020653633
+机时 12.8020653633
+电位器 12.5143832909
+花青素 11.0103058941
+杜定友 12.5143832909
+必究 13.2075304714
+微山湖 10.8096351986
+峰谷 11.8212361103
+书画社 12.8020653633
+农机 7.18650712207
+冷厉 12.1089181827
+吃人 13.900677652
+费功夫 11.0674643079
+小字体 13.900677652
+被炸飞 11.9547675029
+土力学 10.9049453784
+设计标高 13.900677652
+岗峦 11.7034530746
+志贺 11.598092559
+王制 10.604840786
+无伤大雅 11.4157710022
+顾不到 12.8020653633
+当儿 8.01735526349
+木鱼 9.63799777493
+犬戎 10.642581114
+特权阶级 11.2616203224
+至少 5.82167939329
+一五日元 13.900677652
+锡伯 9.56994431169
+恩里克 13.2075304714
+唬得 8.73019365694
+乍冷 12.8020653633
+陈乞 13.900677652
+唐尧东 11.4157710022
+叶密立 11.5027823792
+悭贪 13.900677652
+刘锦棠 12.5143832909
+服务器资源 13.900677652
+建国大纲 11.598092559
+遗留问题 10.0940151622
+沃特福德 13.2075304714
+郑望之 11.2616203224
+环境变 12.5143832909
+不良影响 9.48183704418
+艾滋 11.3357282945
+恪守 9.33632946051
+顾翊群 13.2075304714
+马先生 11.1926274509
+冲垮 10.8096351986
+泊头市 12.2912397395
+八万四千里 12.8020653633
+思南 11.4157710022
+归到 10.2371160058
+另具 12.1089181827
+听觉疲劳 13.900677652
+释疑 10.642581114
+当兵 8.37921673411
+沟子 12.8020653633
+班婕妤 12.5143832909
+红色中华 12.1089181827
+宣宗嗣 12.8020653633
+沙僧牵 12.1089181827
+毡帽 10.2897597393
+裴行俭 12.5143832909
+彭义斌 13.900677652
+乘务员 10.9562386728
+汤姆孙 10.2371160058
+潘师正 12.2912397395
+性虐待 13.900677652
+密押 12.8020653633
+裁定书 10.4666904475
+自愿地 12.1089181827
+毡帐 10.765183436
+当先 8.40761620864
+维尔茨堡 11.0103058941
+咸阳桥 12.8020653633
+巴黎国民银行 12.2912397395
+睹景伤情 13.900677652
+质点系 10.8096351986
+舛误 12.5143832909
+倒马关 12.5143832909
+东方女性 12.5143832909
+机播 12.8020653633
+取消 6.539302223
+糟糠之妻 11.7034530746
+马谡极 12.8020653633
+违规 7.43920947562
+于谢安 12.8020653633
+直升飞机 9.7898037878
+剿匪 9.49395840471
+城乡结合 13.900677652
+入地无门 11.2616203224
+第五十八回 12.2912397395
+桑吉嘉 13.900677652
+不乏其例 11.9547675029
+余连发 13.900677652
+行笔流畅 13.900677652
+浓情蜜意 12.5143832909
+服装类 12.2912397395
+另册 11.1926274509
+朗读课文 12.8020653633
+营妓 11.9547675029
+沉思默虑 13.900677652
+杯蛇鬼车 13.900677652
+管制系统 13.2075304714
+封钜鹿 12.8020653633
+贝里沙 13.900677652
+来意不明 13.2075304714
+冲坏 12.1089181827
+山海经 9.7898037878
+突破难关 13.900677652
+密户 13.900677652
+秤杆 11.9547675029
+归功 12.8020653633
+章有法 13.900677652
+电机厂 10.9049453784
+全年雨量 13.2075304714
+思古 12.2912397395
+思召 13.900677652
+一一对 11.8212361103
+晾衣绳 12.5143832909
+鲜鱼 10.1630080337
+娑罗树 12.8020653633
+凉城县 12.8020653633
+倒背如流 11.5027823792
+胡齐斯坦省 12.8020653633
+井穴 11.598092559
+寿阳 11.0674643079
+胁裹 12.5143832909
+天父 10.9049453784
+配额制 12.1089181827
+电力行业 9.29550746599
+高碑店 12.1089181827
+抱石 13.2075304714
+初阶 12.8020653633
+出版法 12.8020653633
+生沙 13.900677652
+初阳 13.2075304714
+王李旦 12.2912397395
+电火花 10.4041700905
+施密 13.900677652
+色度学 12.5143832909
+欣喜 8.73019365694
+苏真斯 13.900677652
+阿术拉 12.8020653633
+一封封 12.1089181827
+心虔志诚 13.900677652
+星图 10.4041700905
+阿德 11.2616203224
+寿陵 12.8020653633
+分隔符 11.1926274509
+复制出 12.5143832909
+当年 5.89231208166
+天物 13.2075304714
+绿帽子 11.1280889297
+积聚 8.26232298264
+寿险 8.65893063692
+舒适度 11.3357282945
+联绵字 12.8020653633
+帮腔 9.91169360541
+市容整洁 11.8212361103
+忠心 8.1608847398
+天牛 10.2897597393
+福尔克 13.900677652
+伯纪 13.2075304714
+安全值 13.2075304714
+态度 5.89397680654
+阿香摇 13.2075304714
+侵蚀面 13.2075304714
+社联 11.8212361103
+人海战术 11.8212361103
+一拜天地 12.5143832909
+天牖 13.900677652
+莱钢 9.93038573842
+开水烫 11.1280889297
+及时处理 10.2897597393
+降大任 11.4157710022
+交辉相映 13.900677652
+玛格达 12.8020653633
+执法官 11.9547675029
+伯纳 12.2912397395
+格罗弗 12.8020653633
+发现错误 11.9547675029
+心里美 12.5143832909
+赛仁贵 11.9547675029
+嘴损 13.900677652
+百平方公里 11.598092559
+海原县 11.8212361103
+当庭 10.0294766411
+一百零八位 13.900677652
+老阿公 12.8020653633
+吃错药 12.8020653633
+阿贝尔 10.8561552143
+钙化 9.82314020807
+志荣 12.5143832909
+秘本 12.8020653633
+北京队 13.900677652
+西川见 13.2075304714
+归州 11.4157710022
+小业主 10.5684731418
+昏话 12.5143832909
+兰郡 13.2075304714
+副总 8.82550383674
+阿布里 13.2075304714
+情事 10.4349417492
+压倒性 10.4666904475
+一百五十斤 11.9547675029
+纱罩灯 13.2075304714
+汽车模具 13.900677652
+按期 9.33632946051
+拉法 11.1926274509
+另建 10.8561552143
+库鲁克 11.9547675029
+昂然直入 13.900677652
+至友 12.5143832909
+部门规章 10.533381822
+羊街 12.5143832909
+超国家 11.4157710022
+西越河 13.2075304714
+天狮 13.2075304714
+冲塌 11.8212361103
+宁绍台 12.5143832909
+阿弥 11.9547675029
+张训 13.900677652
+均遭 10.0294766411
+曹将军 11.7034530746
+方向不同 11.0674643079
+预先选择 12.8020653633
+斯郡团 13.2075304714
+薪炭 12.2912397395
+万洋山 11.1280889297
+革吉县 13.2075304714
+天狗 11.3357282945
+阿式 13.2075304714
+勇健 11.4157710022
+扑面 10.2630914922
+西非各国 13.900677652
+钩住 11.0103058941
+居宿卫 13.900677652
+马鞍形 11.9547675029
+赔偿金 10.0940151622
+致谢 10.0720362555
+无一不能 13.900677652
+初雪 11.5027823792
+密法 11.7034530746
+纸本 12.2912397395
+汤钵式 13.900677652
+阿廷 12.1089181827
+胃泌素 11.7034530746
+共通 11.0103058941
+煤渣 11.4157710022
+阿香放 13.2075304714
+坠地 10.765183436
+碾断 13.900677652
+半公里 11.598092559
+量纲 9.85762638414
+宋学义 13.2075304714
+个人独资 13.900677652
+隐隐 8.17382990439
+经济负担 11.5027823792
+勇决 12.2912397395
+数百本 13.900677652
+初露 11.1926274509
+此对应 12.8020653633
+归属 8.00078029839
+井筒 11.7034530746
+另开 11.3357282945
+乍得 9.75754292558
+飞弹 10.3453295905
+志英 11.7034530746
+气候变化 7.03062424018
+曲喇 12.8020653633
+楚河 10.8561552143
+光诱导 13.900677652
+马格利 13.900677652
+纸杯 13.900677652
+环氧丙烷 11.8212361103
+邮箱地址 12.8020653633
+纸条 8.59240995457
+关将军 11.2616203224
+宰猪 11.3357282945
+尿胆素 13.2075304714
+纸板 10.4041700905
+杨明德 10.5684731418
+镶边 10.4666904475
+宝砚 13.2075304714
+寿面 12.1089181827
+肖伟 9.5062284973
+满脸春风 13.900677652
+鱼水相 12.5143832909
+技高一筹 11.8212361103
+当当 10.642581114
+当归 9.06439574502
+呈现 6.20446501263
+明尼阿波利斯 10.642581114
+冲上去 9.84023464143
+肽聚糖 13.2075304714
+亿吨公里 11.7034530746
+地下隧道 10.7226238216
+巴利奥 13.900677652
+肖似 13.2075304714
+薛广德 12.8020653633
+李道宗 12.1089181827
+兰金 12.1089181827
+维摩诘 12.2912397395
+农桑 9.38981814546
+取掉 11.0674643079
+冷峭 12.1089181827
+西利西亚 12.8020653633
+阿平 11.3357282945
+和源氏 13.2075304714
+数百枚 12.2912397395
+禁酒令 10.9049453784
+岭子 12.1089181827
+丘赫莱 13.2075304714
+冷峻 9.46986085313
+朴刀 8.86372504956
+铁钦纳 12.5143832909
+冲头 11.5027823792
+德州市 11.1280889297
+壕沟 9.38981814546
+低音 9.74179456862
+王大年 13.2075304714
+贼心不死 11.5027823792
+天玑 12.1089181827
+狂人日记 11.9547675029
+当得 9.77354326693
+两连败 13.2075304714
+维达尔 11.7034530746
+天王 8.0985592766
+王命虢 12.1089181827
+马格勒 13.900677652
+亭长 10.9562386728
+李德明子 12.8020653633
+冲天 8.97342396682
+营垒 9.38981814546
+木帆船 10.765183436
+工程图 13.2075304714
+楚汉 9.53122979951
+严母 13.2075304714
+钙剂 11.7034530746
+二十八个 11.7034530746
+崔述 13.2075304714
+于令尹 12.5143832909
+阿术辅 13.2075304714
+楚江 11.9547675029
+推门而入 11.5027823792
+水明楼 13.2075304714
+指导作用 9.93038573842
+思巴 12.1089181827
+古城镇 13.900677652
+拉波 13.2075304714
+更年期 9.85762638414
+艾思 10.4994802703
+一箭之仇 11.598092559
+茶席 13.2075304714
+阿帕 12.5143832909
+田吉 12.2912397395
+征足 13.900677652
+假冒者 13.900677652
+呈献 11.598092559
+致贫 13.2075304714
+滚出 9.54396882529
+杰出贡献 10.1164880181
+努力创造 10.642581114
+夹心饼干 12.2912397395
+阿布 10.0088573539
+成绩优秀 10.8561552143
+应着 10.2897597393
+三四十万 12.2912397395
+快逃 11.8212361103
+汝南袁 13.2075304714
+巴尔托 12.8020653633
+贸易壁垒 9.63799777493
+举止文雅 12.8020653633
+阿巴 10.2897597393
+滚刀 11.7034530746
+三元组 13.900677652
+在线播放 13.900677652
+就教于 13.900677652
+抱病 10.4666904475
+人来人往 10.1871055853
+系统配 12.5143832909
+有眼无珠 11.0103058941
+朝克图 12.5143832909
+马尔他 12.5143832909
+输进 12.5143832909
+艾提 13.900677652
+聪明才智 10.642581114
+李翼 13.900677652
+珍宝馆 12.2912397395
+三四十个 11.3357282945
+青年运动 11.7034530746
+凉茶 10.765183436
+文庙大成殿 13.900677652
+秘方 9.72629038208
+虞侯 11.8212361103
+批成 13.900677652
+蒲式耳 9.22784881751
+滚到 9.98865464655
+吏卒 11.8212361103
+数字家庭 13.2075304714
+颇冷 13.900677652
+耿秀莲 12.8020653633
+天灾 9.17328983326
+巡察使 12.2912397395
+游进来 12.8020653633
+熊井启 13.2075304714
+夜战 10.0294766411
+广雅书 11.9547675029
+决选 12.2912397395
+针迹 13.2075304714
+美国陆军 8.83808261895
+至元 8.29120585679
+纤维工业 12.8020653633
+铁了心 10.2371160058
+蒲子再 13.2075304714
+师丹曾 12.5143832909
+屡禁 13.900677652
+值班员 10.2630914922
+秘旨 12.5143832909
+毡包 12.1089181827
+当属 9.28555713513
+眼药水 10.604840786
+至关 11.2616203224
+井研 12.2912397395
+袭用 10.4994802703
+河汉 11.598092559
+择菜 12.1089181827
+外台秘要 11.8212361103
+下笔千言 13.2075304714
+一手包办 11.8212361103
+至公 12.1089181827
+压倒优势 10.9562386728
+当局 7.26210986281
+伴舞 11.9547675029
+抹上来 13.900677652
+胃下垂 11.7034530746
+向元军 12.5143832909
+社花 13.900677652
+深国商 11.0674643079
+陆军师 10.5684731418
+书画界 13.900677652
+牵着手 11.9547675029
+纽扣 9.59661255877
+屁滚尿流 10.8561552143
+人强马壮 11.8212361103
+侯周勃 13.2075304714
+不打不相识 12.5143832909
+子宇文 12.8020653633
+相范蠡 13.2075304714
+滚动 8.45394028031
+取悦 10.3743171274
+阳光充足 10.604840786
+十二万四千 12.8020653633
+睡上去 13.2075304714
+三四十亩 13.2075304714
+木里 11.7034530746
+归心 10.2371160058
+青草坡 13.900677652
+躯壳 10.2371160058
+图片社 12.2912397395
+大括号 11.0674643079
+沟回 12.8020653633
+甘比尔 13.2075304714
+副手 9.4233408375
+凉菜 11.1926274509
+当头棒喝 12.1089181827
+明军北 13.2075304714
+谢添 12.8020653633
+脸红脖子粗 11.5027823792
+剿平 11.7034530746
+阔野 13.900677652
+艾里森 13.900677652
+劳民伤财 11.0674643079
+覆盖文件 13.2075304714
+张友渔 11.9547675029
+先心病 11.8212361103
+刘全妻 13.2075304714
+急不可待 10.3171587135
+仁人志士 11.1926274509
+王老板 13.900677652
+落成典礼 11.8212361103
+两位数 9.16447920358
+莱阳 10.9562386728
+梦特娇 13.900677652
+澄江 11.0103058941
+溢美 12.2912397395
+旅行车 11.598092559
+冷得 9.77354326693
+奥勃斯 13.900677652
+茅房 10.7226238216
+坐船来 13.900677652
+王吉元 8.95903522937
+跑供销 12.8020653633
+建筑工地 10.2630914922
+管理混乱 11.2616203224
+整装待发 10.8561552143
+瘦猪肉 11.7034530746
+嚼蜡 13.2075304714
+耶梯目 12.2912397395
+天然 6.45409255282
+哈飞 9.71102290995
+楚源 12.5143832909
+山遥水远 13.2075304714
+疯丫头 12.8020653633
+周威烈 12.1089181827
+阿克苏河 10.765183436
+台山市 12.5143832909
+数百支 12.5143832909
+园亭 12.2912397395
+异极矿 13.2075304714
+艾拉 12.5143832909
+电监会 11.598092559
+工人失业 11.4157710022
+化学合成 10.533381822
+良将 10.1871055853
+科泽科 11.8212361103
+永动机 10.765183436
+煤气 8.80692745117
+那小释 12.1089181827
+侦破案件 12.1089181827
+致辞 9.82314020807
+潜下来 13.2075304714
+杀光 10.1164880181
+思归 11.4157710022
+划等号 12.1089181827
+锋利 8.62256299275
+产品成本 10.4666904475
+沟坎 12.2912397395
+阿岭 12.8020653633
+从即日起 10.4994802703
+平西王爷 13.900677652
+充分条件 11.1280889297
+锋刃 10.9049453784
+脸蛋 9.30555780184
+河池 10.533381822
+楚滨 11.598092559
+天煞 11.8212361103
+欺君误国 13.2075304714
+机框 11.2616203224
+营商 11.3357282945
+斯瓦希里 10.642581114
+呼口号 10.9562386728
+归帆 13.2075304714
+经营报 11.598092559
+癌症病人 11.8212361103
+野利仁荣 11.5027823792
+批捕 10.5684731418
+痴痴地 10.2897597393
+园丁 10.6818018271
+滚压 11.9547675029
+芳香族 10.765183436
+死不足惜 12.1089181827
+阿山 13.2075304714
+应由 9.04086524761
+宽甸县 12.8020653633
+木部 12.8020653633
+第十一个 11.5027823792
+应用 5.70121345436
+煤油 8.82550383674
+女同学 9.69598503258
+青埂峰 11.5027823792
+机械 5.9579601114
+黔西南 11.4157710022
+玉礼器 12.8020653633
+颦眉 13.900677652
+施塔 12.5143832909
+思德 13.2075304714
+牙骨质瘤 13.900677652
+泰国菜 12.8020653633
+园中 8.7245279194
+收押 13.900677652
+能量代谢 11.2616203224
+数百斤 12.1089181827
+按摩 8.19689517732
+慕德斯 13.900677652
+滚去 12.5143832909
+行政区 8.87679713113
+哈谟第 13.900677652
+园主 12.8020653633
+不男不女 11.9547675029
+积累性 12.5143832909
+阿尼 11.7034530746
+冲子 12.8020653633
+克耶族 13.900677652
+煤泥 13.900677652
+二百五十两 13.2075304714
+母子俩 9.63799777493
+人员选拔 12.8020653633
+关元俞 13.900677652
+边笑边 11.8212361103
+当差 9.5186510173
+明军分 12.2912397395
+两国之间 10.4349417492
+木邦 12.1089181827
+沉醉在 10.533381822
+安全厅 13.2075304714
+思念 8.25170341381
+八重 12.2912397395
+应留 13.2075304714
+马鞍山 9.75754292558
+吃宵夜 12.5143832909
+冷床 12.5143832909
+二百五十万 12.8020653633
+王李显 12.8020653633
+岭头 11.5027823792
+冷库 9.89334446674
+维多利 12.8020653633
+好长时间 9.26594866375
+农桓范 12.8020653633
+安全员 12.8020653633
+营利 10.9049453784
+奥普拉 12.8020653633
+扩音 11.8212361103
+下意识 8.41588071849
+话里有话 10.1630080337
+刺激阈限 13.900677652
+五花海 12.2912397395
+劳动态度 12.8020653633
+耍滑头 11.9547675029
+由维管 12.5143832909
+超自然 9.98865464655
+前半期 10.8096351986
+紫杉醇 13.900677652
+滚向 12.8020653633
+晕晕忽忽 13.900677652
+何错之有 13.900677652
+楚德拉 13.2075304714
+改过去 11.2616203224
+澄澈 10.6818018271
+玄德答 12.8020653633
+关锦鹏 13.900677652
+即纳 13.900677652
+检查者 11.3357282945
+一百一十 10.4666904475
+阿寒 13.900677652
+闻天鹤 10.7226238216
+资本周转 10.4349417492
+脸膛 9.71102290995
+尉黄琬 12.8020653633
+阿富 12.8020653633
+卡拉拉 12.5143832909
+至圣 11.1280889297
+阿密 13.900677652
+蒋兆和 12.2912397395
+忠实 8.43261751084
+躯干 8.9308643524
+数百户 12.8020653633
+水漫 11.9547675029
+中国军力 13.2075304714
+天癸 11.5027823792
+保护计算机 13.900677652
+癞皮狗 12.2912397395
+按排 12.2912397395
+冷天 10.4666904475
+唾面自干 12.8020653633
+零配件 9.87532596124
+静安寺 12.2912397395
+年过花甲 11.598092559
+于天宝 11.7034530746
+蔽天 11.1280889297
+归天 10.2371160058
+冯元 10.8096351986
+营前 10.9049453784
+水彩渲染 13.900677652
+腹腔镜 10.8561552143
+玄德笑 13.2075304714
+冷夏 11.5027823792
+高中课程 12.8020653633
+王大宽 10.4994802703
+纸扇 11.3357282945
+德臣西 13.900677652
+取景 11.598092559
+埋骨 10.5684731418
+叶状茎 12.8020653633
+宝妹妹 12.2912397395
+攀枝花市 10.6818018271
+奇峰怪石 11.2616203224
+一中一台 12.5143832909
+界首县 13.2075304714
+阿宁 13.2075304714
+活契 13.900677652
+鲁迅故居 12.1089181827
+广惠仓 13.2075304714
+常随楚 12.8020653633
+井绳 11.598092559
+卡拉扬 11.3357282945
+李如松 11.2616203224
+白垩纪 8.75901409547
+专用肥 13.900677652
+对模型 10.8096351986
+蜡炬成灰泪始干 13.900677652
+昏迷 8.06879517469
+塔什干 9.94943393339
+按捺 10.604840786
+当堂 11.8212361103
+荒川 12.8020653633
+敌伪军 12.1089181827
+攻掠 10.1164880181
+营办 12.8020653633
+烟袋嘴 12.5143832909
+营力 10.4994802703
+白事 12.8020653633
+盒饭 11.7034530746
+格尔曼 13.900677652
+谢祯祥 13.2075304714
+天皇 8.64318227995
+电视教育 13.2075304714
+醉生梦死 10.9562386728
+重点项目 9.20932976975
+官内臣 13.2075304714
+马鞍子 12.5143832909
+分斤拨两 13.900677652
+积蓄 8.28027678626
+易溶 9.02548032877
+贼忒忒 13.2075304714
+晓得 6.99392287333
+小屯村 11.1280889297
+楚楚 11.0103058941
+应物 12.2912397395
+白沙岭 12.5143832909
+杏眼圆睁 12.1089181827
+密植 10.9049453784
+桥栏 11.8212361103
+基民盟 12.2912397395
+天盛 10.8561552143
+失而复得 10.533381822
+杂货商 13.2075304714
+祝福语 12.8020653633
+侯世爵 13.900677652
+天监 9.4233408375
+使用方便 9.91169360541
+埃尔塞维 12.2912397395
+农活 10.0505300503
+好死不如 11.5027823792
+丹顶鹤 9.80633308975
+木鞋 12.5143832909
+熹微 11.1926274509
+天益 12.8020653633
+那李怀 13.2075304714
+盐田区 13.2075304714
+量筒 12.5143832909
+忠孝 9.94943393339
+旅行袋 11.4157710022
+交警队 11.1926274509
+毡呢 13.900677652
+从彰义 11.9547675029
+荒山 9.01787572939
+亭里 12.8020653633
+陆王心 11.9547675029
+有朋自远方来 12.2912397395
+批改 11.8212361103
+五一路 12.1089181827
+蔚州 10.8096351986
+陈余 11.598092559
+脸肿 12.1089181827
+营区 10.642581114
+西汉时代 11.1280889297
+莱里 12.2912397395
+适婚年龄 13.2075304714
+斯巴克 12.8020653633
+比热法 13.900677652
+天真 8.38322475551
+至嘱 13.2075304714
+量窄 11.9547675029
+盗尸 13.2075304714
+恐怖感 12.8020653633
+第四十章 11.0674643079
+务虚会 12.5143832909
+吏员 10.533381822
+督导组 11.8212361103
+摔成 10.9049453784
+衣食税租 13.900677652
+阿嫂 11.4157710022
+韧劲 12.1089181827
+营卫 11.3357282945
+更新版 12.2912397395
+季康子 13.900677652
+卿兄弟 12.5143832909
+烧刀子 13.2075304714
+乐成 11.9547675029
+取材 9.4233408375
+纸捻 12.8020653633
+手下败将 11.2616203224
+偏巧 11.1926274509
+补选 11.0103058941
+牛丞相 9.7898037878
+奋勇 9.16447920358
+电位差 10.8561552143
+沉积层 9.96885201925
+竞技体操 11.3357282945
+直溜溜 13.2075304714
+承光殿 12.5143832909
+陈寿著 13.2075304714
+海门镇 12.2912397395
+取来 8.95903522937
+剪毛 11.598092559
+另存 12.5143832909
+乍富 13.2075304714
+斯托弗 13.900677652
+匐伏 13.2075304714
+叶布舒 13.2075304714
+颂词 11.7034530746
+半酣 10.3743171274
+响水 11.0674643079
+云散高 13.2075304714
+峻德 13.2075304714
+格特鲁德 13.900677652
+当家 9.48183704418
+出不来 9.93038573842
+上纲上线 13.2075304714
+思妇 11.5027823792
+消防设备 12.5143832909
+南雁荡 12.8020653633
+冷声 11.2616203224
+来复线 11.9547675029
+天威保变 9.93038573842
+叶状苞 12.2912397395
+当官 8.69119149913
+量程 11.5027823792
+代谢率 11.598092559
+拉涅 13.900677652
+另定 12.5143832909
+感人事迹 12.1089181827
+总价值 8.93783302172
+贝里曼 13.2075304714
+木雕 8.80692745117
+擘画 12.2912397395
+废物利用 11.598092559
+酒石酸 10.604840786
+沉积岩 9.04864738806
+铁官营 10.604840786
+爱国志士 11.1280889297
+阿婆 10.0088573539
+卫生城市 12.5143832909
+投递 10.2371160058
+批斗 9.89334446674
+十三部 11.8212361103
+废话 9.31571017331
+监视居住 11.4157710022
+农民 5.76415939986
+机滤 11.1280889297
+斯莫尔尼 12.8020653633
+另寻 11.0103058941
+元仁宗 10.4994802703
+营口 9.63799777493
+幼主 9.74179456862
+于斯为盛 13.900677652
+禹敷布 13.2075304714
+乘胜前进 11.8212361103
+荒岭 12.2912397395
+税额 9.72629038208
+难休 12.8020653633
+互动论 12.2912397395
+西冷 10.2897597393
+透透 12.1089181827
+密封罐 13.900677652
+向上倾斜 11.8212361103
+巴利巴 12.5143832909
+伯符 11.8212361103
+猜出来 11.1926274509
+辩士 12.5143832909
+大红门 11.4157710022
+荒岛 10.9562386728
+缙云县 13.900677652
+仪态万方 11.0674643079
+巴尔斯 12.5143832909
+孔北海 12.5143832909
+年亨利 11.9547675029
+阿娇 11.598092559
+宓仁 12.8020653633
+朱皇后 12.8020653633
+张贴标语 13.900677652
+冷季 11.8212361103
+一一分 12.5143832909
+应点 13.2075304714
+纽曼 10.5684731418
+初速 9.12155415886
+艾柳 12.8020653633
+夜晚 7.14840727583
+男女授受 13.900677652
+几千口 13.2075304714
+施工 7.19748953873
+共需 10.3453295905
+郭庄泉 12.5143832909
+思威 13.900677652
+手制动 12.2912397395
+猢狲 9.58318953844
+阿姨 9.35738286971
+初选 10.8096351986
+冲床 12.5143832909
+国境线 10.2371160058
+神人 9.71102290995
+兰陵 11.2616203224
+阿尔凯 13.900677652
+录得 8.70218062071
+施州 12.8020653633
+阿姐 10.4349417492
+冷字 13.900677652
+积极主动 9.87532596124
+安全器 13.900677652
+半封闭 10.3743171274
+神京 10.5684731418
+阿姊 11.9547675029
+消极隔振 13.900677652
+初逢 13.2075304714
+天球 9.46986085313
+一下站 10.765183436
+神交 11.5027823792
+总对 12.1089181827
+天理 9.53122979951
+格罗夫 12.2912397395
+平等互利 10.4041700905
+骨牌 10.6818018271
+阿妹 11.598092559
+美国式 11.7034530746
+丁之发 13.2075304714
+良家 10.8096351986
+违者 9.55687223012
+一二零 13.2075304714
+木锨 11.1926274509
+亚斯河 12.5143832909
+黄承彦 12.8020653633
+王大妈 12.2912397395
+全堂影 13.900677652
+冒险 7.83225206373
+木锤 12.8020653633
+生意通 13.900677652
+功成身退 11.0674643079
+兰阳 10.642581114
+向剑州 13.2075304714
+芳香性 11.7034530746
+斯托尔 13.2075304714
+本宁堡 12.1089181827
+宁绍商 12.5143832909
+农艺系 13.2075304714
+共面 11.5027823792
+采信 12.1089181827
+阿妈 11.1280889297
+顾实汗 11.9547675029
+猩红色 12.5143832909
+盖尔人 11.5027823792
+采众 12.2912397395
+皓白 12.5143832909
+采伐 9.5062284973
+十五络 12.5143832909
+阿奶 11.0674643079
+苯胺紫 12.8020653633
+废置不用 13.2075304714
+冯赛 12.8020653633
+木门 9.96885201925
+凤景泉 13.900677652
+虎骨酒 12.5143832909
+绿旗 11.9547675029
+违背 7.9526426628
+克林格 13.2075304714
+峻岭 10.5684731418
+至善 10.8096351986
+朱总司令 12.1089181827
+神丹 12.8020653633
+延巴克 13.2075304714
+神主 10.1871055853
+夜曲 11.3357282945
+冷寂 10.533381822
+舞台艺术 10.3171587135
+碾成 11.0674643079
+阿契 12.8020653633
+燥裂 12.1089181827
+卫生勤务 12.8020653633
+阿奎 11.7034530746
+大祭司 11.0103058941
+五千顷 13.2075304714
+阿奇 11.9547675029
+伞面 11.8212361103
+正正当当 13.900677652
+天璇 12.1089181827
+楚歌 11.3357282945
+夜暗 11.7034530746
+归家 9.85762638414
+可假定 13.2075304714
+玄德离 13.2075304714
+毡垫 12.2912397395
+归宿 9.02548032877
+冷宫 11.0103058941
+实干家 11.1926274509
+滚回 11.8212361103
+得与失 12.2912397395
+冷害 11.3357282945
+仇由氏 13.900677652
+神乎 12.8020653633
+阿大 12.8020653633
+忠奸 11.9547675029
+李翔 13.900677652
+冒雨 10.0720362555
+峻峭 10.533381822
+红克伦 13.2075304714
+归宗 13.2075304714
+阿多 12.5143832909
+冷宁 13.2075304714
+楚武 13.2075304714
+荒径 13.2075304714
+水溶 10.3453295905
+归宁 12.8020653633
+仓位 6.55919379961
+硼酸盐 11.3357282945
+烯丙基氯 13.2075304714
+王大夫 8.58747167293
+奇丽 10.3453295905
+兰青 10.8561552143
+新开工 8.57766767284
+巴尔杜 12.5143832909
+美满婚姻 13.2075304714
+滚圆 10.9049453784
+载重车 11.9547675029
+天电 12.8020653633
+蒙知遇 13.2075304714
+当头 8.83808261895
+显亲王 12.5143832909
+采了 10.642581114
+当天 6.31336714595
+致词 10.4349417492
+蛤蜊汤 13.900677652
+煤核 13.900677652
+宋祖英 13.900677652
+垂着手 11.2616203224
+温室效应 10.1630080337
+翕张 11.9547675029
+观察窗 11.1926274509
+生涯 7.93453091285
+另外 5.03480136655
+当夜 8.52539924429
+巴尔杰 13.900677652
+叛臣 12.1089181827
+刑徒归 12.8020653633
+夜来 9.34680076038
+奥立佛 9.32596667347
+威灵顿 11.0103058941
+投弹器 13.2075304714
+滚地 13.2075304714
+竭诚服务 13.900677652
+投送 10.5684731418
+互不干涉 10.765183436
+九十卷 12.2912397395
+当好 10.4666904475
+坠入 9.5062284973
+批条 13.900677652
+霍恩 11.598092559
+咽峡炎 12.1089181827
+卧龙岗 11.1280889297
+观察站 12.2912397395
+唯物论 10.6818018271
+野猫 9.58318953844
+煤桶 13.900677652
+具象化 13.900677652
+营具 13.900677652
+胡政之 13.2075304714
+火中取栗 11.598092559
+终於 11.9547675029
+嫁入 10.9562386728
+再试一下 13.2075304714
+寿酒 12.2912397395
+伯禽 12.2912397395
+天界 10.4349417492
+伯禹 12.5143832909
+巴尔本 12.1089181827
+病态心理 12.2912397395
+不识高低 12.1089181827
+投放市场 10.4994802703
+备用 8.82550383674
+登机口 12.2912397395
+夜柔 12.8020653633
+移液管 13.2075304714
+空中加油 9.82314020807
+李守孔 12.8020653633
+应然 13.900677652
+刀削面 12.2912397395
+隐逸 10.642581114
+堂鼓 12.1089181827
+德拉瓦河 12.5143832909
+借出来 13.2075304714
+民用建筑 11.0674643079
+机油 9.63799777493
+艾普 12.8020653633
+伯祖 13.2075304714
+民族尊严 11.7034530746
+采下 11.3357282945
+检疫 8.71889410168
+施展 8.70218062071
+执法局 9.36807815882
+神似 10.765183436
+怪人 10.1871055853
+采丽 13.2075304714
+阿塔 10.9562386728
+隔餐 13.900677652
+马拉特 11.1280889297
+隐退 10.533381822
+木铎 13.900677652
+卧龙山 12.8020653633
+窦公 13.2075304714
+弹劾案 11.7034530746
+神伤 11.7034530746
+收看者 13.900677652
+苗秀 12.5143832909
+农渔 12.5143832909
+住宅产业 11.8212361103
+刊号 13.2075304714
+渑池县 10.7226238216
+操作间 12.8020653633
+言尽于此 12.2912397395
+隐避 12.5143832909
+一项项 11.8212361103
+到此一游 12.2912397395
+神位 10.4666904475
+福尔图 12.8020653633
+分化时 12.8020653633
+脸色 6.59548943658
+塞上江南 11.8212361103
+哭泣声 11.1280889297
+水准器 12.1089181827
+采买 10.3453295905
+时有所闻 11.8212361103
+荒废 9.43476953332
+那小锁 13.900677652
+施射 13.2075304714
+隐遁 11.2616203224
+印江土家族苗族自治县 13.900677652
+农渠 13.900677652
+太仆杜 12.2912397395
+沟口 10.0505300503
+莫雷利亚 13.2075304714
+门捷列夫 10.4349417492
+现场图 13.2075304714
+息事 13.2075304714
+九龙杯 13.2075304714
+造桥 11.0103058941
+缝缝 11.598092559
+全到 11.5027823792
+崔巍 11.8212361103
+支持物 12.2912397395
+王进财 12.5143832909
+巧巧 11.8212361103
+照此 9.5186510173
+慕容超 12.5143832909
+缝缀 11.598092559
+卓阿哈 13.2075304714
+述及 11.0674643079
+芙蓉出水 13.900677652
+若星汉 13.900677652
+向仪 13.900677652
+实蝇 11.598092559
+藕丝 12.5143832909
+教徒 8.28390655431
+团丁 10.2897597393
+布隆吉 12.5143832909
+一个数万 12.5143832909
+盛情款待 13.900677652
+森格藏 11.598092559
+元洪业 13.900677652
+贻患无穷 13.900677652
+主裁 12.2912397395
+述古 11.7034530746
+办公大楼 9.82314020807
+兵营 9.18217878068
+余田予 13.2075304714
+枕着 10.533381822
+公安军 12.5143832909
+合婚 12.5143832909
+捆做 12.1089181827
+河南 5.21780054492
+静肃 11.8212361103
+看不看 11.5027823792
+罕至 13.900677652
+垂手 9.21854642485
+工房 11.8212361103
+东布罗夫斯基 12.8020653633
+全副 9.85762638414
+乳母 9.84023464143
+艾森豪威尔 9.91169360541
+塞曼 11.9547675029
+可拆卸 11.1280889297
+全剧 9.93038573842
+逆风 10.3453295905
+功勋卓著 11.1280889297
+擦网 13.900677652
+言善语 12.8020653633
+麻省理工 13.2075304714
+巴赫蒂 11.9547675029
+快车 10.4666904475
+冤枉 8.57766767284
+爱达 13.2075304714
+啊唷 13.2075304714
+魏公公 13.900677652
+读作 11.3357282945
+纪律处分 10.4666904475
+绘图 9.91169360541
+铧犁 12.1089181827
+小亚细亚 8.44535653662
+邀击 11.9547675029
+填补空白 13.2075304714
+谷垛 13.2075304714
+没心没肺 10.9562386728
+乌龙 10.3453295905
+生不逢辰 13.2075304714
+油腔滑调 11.4157710022
+谷坡 10.4994802703
+重情义 12.8020653633
+木蛟 11.9547675029
+死亡线 11.1926274509
+虔敬 10.2897597393
+高粘度 12.2912397395
+拉犁 11.5027823792
+上流人士 13.900677652
+主表 12.5143832909
+华蟾素 13.900677652
+全力 7.44233936863
+主街 12.5143832909
+鲜艳 8.32094782599
+奇书 11.0103058941
+外国游客 11.598092559
+谷坊 13.900677652
+二甲苯 10.8096351986
+孔特佩 13.900677652
+叱责 13.2075304714
+数千位 13.900677652
+浩繁 10.1630080337
+极少量 10.5684731418
+谷坛 13.900677652
+庚二酸 13.900677652
+充分发挥 7.30900391997
+武隆县 13.900677652
+新法案 11.7034530746
+洋鬼子 10.4349417492
+孔函谷 13.900677652
+例行公事 10.2371160058
+聚乙炔 12.2912397395
+牵涉面 11.5027823792
+朝三暮二 13.900677652
+真实感 10.7226238216
+谷地 7.55855623325
+快进 9.77354326693
+天人之际 12.2912397395
+符儿 12.5143832909
+布格校正 13.900677652
+全勤 12.8020653633
+捏把汗 12.8020653633
+毛细波 13.900677652
+唐诗 9.21854642485
+小震 13.2075304714
+佩特森 13.2075304714
+照章办事 12.5143832909
+向东 7.54979193526
+清查 8.73019365694
+维尔斯 12.2912397395
+数千伏 13.900677652
+拉到 8.35160156708
+丁公 13.2075304714
+向下 7.09274270828
+向上 6.07583196095
+江红 12.8020653633
+快追 12.5143832909
+全区 8.44535653662
+沈力 12.8020653633
+牛庄设 13.2075304714
+壮实 9.93038573842
+垂挂 10.8096351986
+交通警 12.5143832909
+分配程序 13.900677652
+论说文 12.5143832909
+线轴 12.2912397395
+数千件 11.5027823792
+跨得 13.900677652
+鲜菇 12.8020653633
+往前面 11.4157710022
+主宾席 11.9547675029
+大众情人 12.2912397395
+蓝旗亚 12.8020653633
+钱牧 12.2912397395
+啊呀 8.9519177616
+太岳区 12.2912397395
+杂品 12.8020653633
+主角 8.02014466558
+亭台楼榭 12.8020653633
+东澳岭 12.5143832909
+何妙法 13.2075304714
+法治 8.78268383956
+火烧店 10.4994802703
+苏辛 12.8020653633
+宣帝元 12.8020653633
+陶瓷工艺 12.5143832909
+主观 7.63918596765
+主见 9.34680076038
+乌黑 8.9102450652
+团伙 9.23723855786
+柳传志 10.1164880181
+事件处理 13.2075304714
+暗适应 12.2912397395
+数千亿 10.604840786
+绝倒 12.8020653633
+童吴升 12.8020653633
+头昏目晕 13.900677652
+合子 9.82314020807
+马湘君 13.2075304714
+那凉 13.2075304714
+三倍体 11.9547675029
+数千亩 12.2912397395
+读书 7.0254455647
+金宅雷 12.1089181827
+全校同学 13.900677652
+陈冀 13.900677652
+风景林 12.8020653633
+先斩后奏 11.4157710022
+肆横 13.900677652
+害处 10.765183436
+绩溪县 12.1089181827
+四库全书 9.38981814546
+滚出去 10.8561552143
+忙碌不堪 13.900677652
+陈冲 11.9547675029
+靠后面 13.900677652
+粘度 9.65218240993
+准性生殖 13.2075304714
+持械 11.2616203224
+主要 3.45856450082
+能带 9.80633308975
+粤军 10.5684731418
+弘光皇帝 9.84023464143
+团体 7.16252515738
+向例 12.5143832909
+很淡 10.8561552143
+那长汉 12.5143832909
+逸诗 13.900677652
+中括号 11.7034530746
+沈刚 13.2075304714
+全去 12.2912397395
+拉玛 11.7034530746
+啊哟 10.0294766411
+全县 8.20023407859
+合宜 10.8096351986
+财神老爷 13.2075304714
+扫雷器 10.4041700905
+家属楼 10.7226238216
+陈克 12.8020653633
+陈光 11.4157710022
+啊哈 10.0940151622
+慈利县 12.5143832909
+陈元 11.2616203224
+闷着头 10.5684731418
+陈兄 12.2912397395
+鲜草 11.1280889297
+李小双 13.2075304714
+琴房 12.2912397395
+河狸 10.533381822
+四下 8.79473217808
+制砖机 10.6818018271
+思考题 13.900677652
+凤洲 13.2075304714
+缝线 10.9562386728
+测试计划 13.2075304714
+浩罕 10.3171587135
+陈兴 11.7034530746
+北理工 13.2075304714
+大富大贵 11.1926274509
+商品展览 13.900677652
+王信 12.1089181827
+刘婉芳 11.1926274509
+武器库 11.1926274509
+拉环 12.8020653633
+萨比 12.2912397395
+全厂 10.4994802703
+变松 13.2075304714
+度提高 12.1089181827
+缝纫 10.0294766411
+金麒麟 11.598092559
+乌鸦 8.79473217808
+赶鸭子上架 12.5143832909
+乌鸡 9.85762638414
+很浓 9.84023464143
+全台 11.4157710022
+尹韩仲 13.2075304714
+二十七名 12.8020653633
+台东 10.2630914922
+外国商人 10.9562386728
+海运界 13.900677652
+起义领袖 10.8096351986
+乌兹别克斯坦 9.63799777493
+台上 7.83225206373
+台下 8.68574189437
+残根 13.900677652
+冯保闯 13.900677652
+现经 11.5027823792
+数千两 13.2075304714
+上海市政府 8.99540287354
+支持率 10.7226238216
+仁臣 13.2075304714
+格堡 12.5143832909
+浇花 11.1280889297
+四十左右 13.2075304714
+娘老子 11.7034530746
+瀑布区 13.900677652
+所在 6.54759573146
+基本矛盾 10.533381822
+骨气 10.1871055853
+鲜茧 12.1089181827
+孕晚期 13.2075304714
+拉班 11.598092559
+贼赃 12.1089181827
+充分发扬 11.4157710022
+艾森施塔特 12.8020653633
+出版单位 11.8212361103
+数千万 10.0940151622
+台中 10.2630914922
+城镇职工 10.9562386728
+谷嗣 11.7034530746
+冠以 9.41204128224
+任志强 10.4994802703
+基面 11.3357282945
+兰士瓦 10.7226238216
+遗产地 13.900677652
+垂怜 11.598092559
+恨怨 11.7034530746
+公安县 12.2912397395
+陈勇 10.2897597393
+第十一卷 9.94943393339
+西瓜汁 13.900677652
+惫懒 10.533381822
+双曲拱桥 12.8020653633
+发送窗口 13.900677652
+干啥 8.01735526349
+全倒 11.598092559
+枕畔 12.5143832909
+宏伟目标 11.0674643079
+江米 11.7034530746
+同敬轩 10.9562386728
+基金科 10.642581114
+残毒 12.5143832909
+政界 9.17328983326
+结构严密 11.9547675029
+悼唁 13.2075304714
+好几页 12.8020653633
+消防艇 13.2075304714
+市场预测 10.0088573539
+宝窟 13.900677652
+陈力 13.2075304714
+兜捕 12.2912397395
+消防船 12.2912397395
+达令港 13.2075304714
+宋三史 11.8212361103
+本地化 11.4157710022
+水温 8.18694484647
+卫从 13.900677652
+线谱 13.900677652
+若干意见 9.21854642485
+狐臊 13.900677652
+绝然 12.1089181827
+蹉跌 13.900677652
+冉先菀 13.2075304714
+两万多平方公里 13.2075304714
+凌力 12.5143832909
+海槽 9.94943393339
+毕露 11.1926274509
+华盛顿州 11.0674643079
+鲜肉 11.0674643079
+美艳绝伦 13.900677652
+快赢 11.4157710022
+叶适 11.1926274509
+所称 8.98802276624
+雍屠 13.2075304714
+受俘 12.5143832909
+振颤 12.5143832909
+史瓦西 12.5143832909
+数学界 10.765183436
+高华柱 13.900677652
+鱼腥 11.2616203224
+李学道 13.2075304714
+快赶 12.5143832909
+承父业 13.2075304714
+十余年 8.81927328699
+很满 13.900677652
+火鸡肉 13.2075304714
+第聂伯河 10.0088573539
+谭雄 12.8020653633
+耽延 13.2075304714
+邳苍 12.1089181827
+粤剧 11.0674643079
+外寄生物 13.900677652
+三百多元 12.8020653633
+陈剀 9.84023464143
+令人窒息 10.4994802703
+荒烟 11.9547675029
+石珍珠 12.8020653633
+驿丞 10.0294766411
+持正 11.8212361103
+装甲运兵车 11.4157710022
+长江口 9.53122979951
+唐僖宗 11.3357282945
+特拉布宗 13.900677652
+科技部长 13.2075304714
+兴致 8.37124856446
+能干 8.40761620864
+很渴 12.2912397395
+稀奇事 11.8212361103
+绝句 9.87532596124
+重点班 12.5143832909
+海椒 13.900677652
+巨噬细胞 10.4994802703
+二甲胺 11.9547675029
+陈刚 11.1926274509
+马家窑 11.0103058941
+宋希濂 12.8020653633
+根本就是 9.85762638414
+经编机 13.2075304714
+亲眼见到 10.642581114
+水杯子 13.2075304714
+陈列 8.45394028031
+所向 10.9049453784
+张义潮 11.598092559
+士气受挫 12.8020653633
+语言美 13.900677652
+繁体字 12.2912397395
+合壁 13.900677652
+英才 10.3453295905
+沈兄 13.900677652
+幼体 9.55687223012
+穆棱 11.4157710022
+王之辞 13.2075304714
+很湿 13.2075304714
+盖洛普 11.8212361103
+十三里 11.5027823792
+轻油裂解 12.5143832909
+合声 13.2075304714
+兜揽 11.5027823792
+满足 5.91213466924
+强烈建议 12.5143832909
+萨迪克 13.2075304714
+文件柜 12.2912397395
+心肌梗死 9.93038573842
+凄凄凉凉 13.2075304714
+陈寅恪 10.2897597393
+国际公法 11.0674643079
+诱人 8.6966709649
+乌鳢 11.7034530746
+有贤妻 12.5143832909
+忐忐忑忑 13.2075304714
+名不虚传 9.85762638414
+面条机 13.900677652
+分布式应用 13.2075304714
+打尖 9.71102290995
+舍妹 12.5143832909
+陈友 13.2075304714
+卦辞 10.765183436
+机票价格 10.533381822
+叶酸 9.89334446674
+移动梦网 13.900677652
+低效益 13.900677652
+邀功 11.2616203224
+主语 10.533381822
+摔死 9.89334446674
+少男少女 10.8561552143
+非正式 8.85082164473
+海梅 13.2075304714
+执业资格 11.4157710022
+籍征 13.2075304714
+主试 12.1089181827
+陈史 12.2912397395
+火烧岛 11.9547675029
+措意 13.2075304714
+第五期 9.85762638414
+十余张 13.900677652
+大礼包 10.9049453784
+昌新制 13.2075304714
+科克托 12.5143832909
+河灯 11.9547675029
+陈可 12.2912397395
+越南民主共和国 11.1280889297
+谨慎 6.25911321071
+主诉 11.8212361103
+打狗看主 13.900677652
+案庭审 11.8212361103
+主词 12.1089181827
+合夥 13.2075304714
+照样 7.90422556336
+主讲 10.3171587135
+擦米 13.900677652
+陈原 11.9547675029
+买气 12.2912397395
+海棠 9.27570483869
+藏书票 13.900677652
+江夏派 13.2075304714
+全兴 12.2912397395
+第五条 10.7226238216
+合奏 9.75754292558
+吴奈温 12.2912397395
+绝不比 11.7034530746
+伏惟尚 13.2075304714
+一霎间 11.4157710022
+中信证券 7.58531965045
+全党 8.96620371885
+袁贵妃 11.598092559
+蒙彼利埃 11.9547675029
+亚太经合 12.5143832909
+乌鲁 11.3357282945
+马赫带 12.2912397395
+新闻部 11.4157710022
+门票价格 10.8096351986
+团结奋斗 11.4157710022
+得出结论 8.9519177616
+一定不移 13.900677652
+全免 11.3357282945
+老年医学 12.1089181827
+几万里 12.1089181827
+王吉 11.7034530746
+翠蓝 12.8020653633
+陈博 13.2075304714
+晒台 11.1280889297
+请客 9.26594866375
+曾昭璇 12.5143832909
+陈卓 12.1089181827
+主和派 10.4994802703
+迎神赛会 11.8212361103
+线路 7.4855806928
+陈午 13.2075304714
+陈华 13.900677652
+色彩学 11.8212361103
+乌鱼 12.5143832909
+海格 12.5143832909
+陈升 13.2075304714
+操场上 9.34680076038
+驿传 9.69598503258
+习惯于 8.90346537821
+全军 7.61096208107
+乳根 13.900677652
+多万眼 12.5143832909
+权利要求 11.8212361103
+第五枚 12.5143832909
+郭守敬纪念馆 12.5143832909
+英挺 12.1089181827
+叶里 13.900677652
+叉烧包 12.8020653633
+请安 7.83689244329
+半途 10.6818018271
+田单举 12.8020653633
+胰腺炎 10.533381822
+俄罗斯远东地区 11.8212361103
+毒理学 11.1926274509
+耽心 11.598092559
+连金军 13.2075304714
+除个别 10.1871055853
+沈祥福 13.900677652
+咋咋呼呼 11.8212361103
+火烧山 11.7034530746
+免除 8.42003872863
+停止不前 11.9547675029
+零起点 13.2075304714
+百分之四五十左右 13.2075304714
+全邦诸 13.900677652
+陈化 12.2912397395
+芙蓉王 11.4157710022
+德米雷尔 13.900677652
+卫体 13.2075304714
+军械 9.20932976975
+班辈 12.5143832909
+全凭 9.28555713513
+愚昧落后 12.8020653633
+晕车 11.9547675029
+艾辛庄 12.2912397395
+李小冉 13.900677652
+瓮中捉鳖 12.2912397395
+叶醇 12.2912397395
+基隆 9.43476953332
+所售 11.4157710022
+担水 10.2897597393
+名优特产 13.2075304714
+潘诺 13.900677652
+汉安帝 13.2075304714
+巧布 12.5143832909
+桑海人 12.2912397395
+海桐 12.2912397395
+粤北 10.2897597393
+言禄山 13.2075304714
+后座力 11.1280889297
+谷口 9.65218240993
+敝姓 12.8020653633
+黔西 10.4994802703
+新仇旧恨 12.8020653633
+细胞 6.41070675314
+翠莲 12.1089181827
+绵薄之力 12.2912397395
+袁遇昌 13.900677652
+尉所领 12.5143832909
+王宗系 13.2075304714
+鲜蛋 12.2912397395
+乌程侯 12.2912397395
+海澄 11.9547675029
+扎兰屯市 11.598092559
+巧姐 10.533381822
+琴架 12.5143832909
+杨百顺 8.65365357982
+居里点 11.9547675029
+入城式 12.2912397395
+襄城县 11.0103058941
+买主儿 11.4157710022
+陈哥 12.8020653633
+陆战队 9.61021821083
+传送带 10.5684731418
+赛车车把 13.900677652
+很棒 11.1280889297
+玉狮子 11.9547675029
+史伟 13.2075304714
+虹桥 9.65218240993
+无线网 12.5143832909
+老黄历 12.2912397395
+徐特立 11.7034530746
+应用力学 11.4157710022
+冯宗异 13.2075304714
+所办 10.4349417492
+所加 10.4041700905
+深孚众望 12.5143832909
+绝唱 11.2616203224
+兵不血刃 10.7226238216
+谢应芳 13.2075304714
+翠菊 13.2075304714
+快步前进 13.2075304714
+所动 10.9049453784
+合并 6.6076599722
+汉律 11.3357282945
+巧妙 7.90921310487
+琴柱 13.2075304714
+巧妇 12.5143832909
+伦理思想 10.3171587135
+海洛夫 13.900677652
+史伯 12.1089181827
+扑跌 12.8020653633
+卡普亚 12.8020653633
+耶帕凤 13.2075304714
+巧奴 12.8020653633
+草甸沼泽 11.4157710022
+鲜虞 11.5027823792
+海漫 13.900677652
+自我实现 10.6818018271
+谭郊 13.2075304714
+财色 13.2075304714
+两面派 11.4157710022
+遍及 7.84389363875
+和秀莲 10.2371160058
+基里 11.3357282945
+叶集 12.8020653633
+鲜虾 12.8020653633
+垂暮 12.1089181827
+所剩 10.1394775363
+搅拌车 10.9049453784
+硬取 13.2075304714
+杨廷麟 9.89334446674
+一心无二 13.2075304714
+震波 13.2075304714
+绝嗣 11.598092559
+拉皮 11.5027823792
+合度 11.7034530746
+基金 4.02605264412
+陈君 11.5027823792
+科克斯 13.2075304714
+扑起 13.900677652
+全国 4.74532158833
+泪滴 11.5027823792
+海潮 9.23723855786
+蚁王 12.5143832909
+拉盖 13.900677652
+向东韶 13.2075304714
+格吕菲 13.2075304714
+一中全会 9.84023464143
+金维映 13.2075304714
+所列 9.89334446674
+全园 11.0674643079
+全团 10.0720362555
+所创 10.0720362555
+全因 11.8212361103
+雇员 9.13850371718
+主谓 11.5027823792
+清朝 7.1877214513
+换肾手术 12.5143832909
+鱼脍 13.900677652
+增加率 13.2075304714
+拉直 11.5027823792
+快语 13.2075304714
+排水闸 12.8020653633
+主调 11.598092559
+所到 11.4157710022
+快请 13.900677652
+伍麦叶 11.9547675029
+主谋 10.4041700905
+史侯 12.8020653633
+全场 8.80692745117
+叶面 10.1871055853
+明星阵容 12.5143832909
+杀无赦 11.2616203224
+静藏 12.8020653633
+交通车 12.8020653633
+所及 9.08039608637
+史学工作者 12.2912397395
+乳源 11.5027823792
+史乘 12.2912397395
+陈将军 10.765183436
+苏颂 11.5027823792
+呼伦贝尔 10.2630914922
+翠花 11.7034530746
+忽略不计 9.80633308975
+合式 11.598092559
+英文 7.62028181302
+当耳旁风 12.1089181827
+分香卖履 13.900677652
+所变 12.1089181827
+主跨 10.765183436
+主路 12.8020653633
+族亲 13.2075304714
+黑灯瞎火 10.1394775363
+良家子 12.5143832909
+十余天 12.1089181827
+陈吾德 11.598092559
+英方 10.7226238216
+酌减 12.2912397395
+纳彩 13.2075304714
+思维混乱 12.8020653633
+史书 7.96843246453
+钱惟演 12.8020653633
+又创新高 11.0674643079
+叶静 13.900677652
+魏主闻 12.8020653633
+时事性 12.8020653633
+伊万诺夫 11.4157710022
+英斯 13.2075304714
+翠芝 13.900677652
+工本 12.2912397395
+留党察看 12.1089181827
+难以确定 10.2630914922
+目露凶光 11.9547675029
+光溜溜 10.2897597393
+海滩 8.47572763449
+古吉拉特 10.642581114
+史丁 13.900677652
+可小可大 13.900677652
+拉着 7.49710345404
+残油 13.900677652
+绝后 11.1926274509
+史上 7.49710345404
+牡丹虽好 12.5143832909
+第十一名 13.2075304714
+这般 7.36398605438
+载弹量 10.642581114
+甬路 10.9049453784
+纳努契 12.8020653633
+合影 9.22784881751
+琴曲 10.4994802703
+风月无边 13.900677652
+工期 9.30555780184
+打着灯笼 10.2897597393
+沈园 13.2075304714
+捐书 12.8020653633
+小桥流水 11.7034530746
+渊远 13.2075304714
+基部 8.06294720481
+马哈拉施特拉邦 11.7034530746
+乌马 11.9547675029
+合得 12.1089181827
+海温 12.5143832909
+由召公 12.1089181827
+叶音 12.8020653633
+绝品 11.0674643079
+叶韵 12.1089181827
+绝响 12.2912397395
+朝圣者 11.0674643079
+蒙学 10.8561552143
+乳清 12.2912397395
+细腰 10.5684731418
+贵南县 13.2075304714
+球差 11.9547675029
+车载斗量 12.8020653633
+严格控制 8.35941410682
+细腻 7.89432449237
+大风大浪 10.2117981979
+索战 10.9049453784
+史令 11.8212361103
+百幕 13.2075304714
+竭尽所能 11.0674643079
+黑麦草 11.9547675029
+樯橹 13.2075304714
+酒话 12.1089181827
+跌进 10.2630914922
+满堂红 11.0674643079
+滨松 11.8212361103
+免遭 9.19114745066
+饥餐渴饮 11.598092559
+归中 13.900677652
+基那 13.900677652
+翠色 11.3357282945
+梁炳 11.8212361103
+奥波莱 13.900677652
+管惟炎 13.2075304714
+傻帽儿 12.8020653633
+海湾 8.0484751722
+工架 12.2912397395
+公安干警 12.8020653633
+和秀英 13.900677652
+史事 9.0884932966
+黏住 12.5143832909
+发展趋势 7.88941047757
+黑眼圈 10.4666904475
+矽线石 11.8212361103
+赵败秦 11.9547675029
+值班人 13.900677652
+全城 8.32472854883
+长长地 9.17328983326
+高子白 13.900677652
+垂柳 9.93038573842
+叶鞘 10.2117981979
+王载漪 12.1089181827
+提出异议 9.72629038208
+照海 12.2912397395
+肉食动物 11.5027823792
+大雕 12.5143832909
+甚重 10.2371160058
+泪水 7.24266660611
+官渡之战 10.7226238216
+海刚峰 12.1089181827
+河畔 8.50705010562
+沈起炜 11.598092559
+倾刻 12.5143832909
+线衫 13.900677652
+自动更新 13.900677652
+河界 12.5143832909
+石洞里 13.2075304714
+线衣 12.2912397395
+干昭侯 12.8020653633
+海涅 10.6818018271
+兵船 10.0505300503
+海涂 10.4041700905
+陈国 9.94943393339
+乳液 9.94943393339
+破坏活动 10.8561552143
+全向 11.8212361103
+兵舰 11.9547675029
+小孩儿 10.1630080337
+请帖 10.9562386728
+脚板 10.5684731418
+王起兵 13.900677652
+全名 10.3453295905
+三青团 11.5027823792
+海涛 10.3743171274
+王庄村 11.8212361103
+军中 7.33541268194
+造渣 12.2912397395
+军乐 10.765183436
+周天爵 13.2075304714
+拉瑟 13.2075304714
+贡献者 11.5027823792
+球市 13.900677652
+第五批 12.5143832909
+矿山 7.93453091285
+开拓市场 10.642581114
+细节 7.20611559345
+天津人 10.9562386728
+李兰香 13.900677652
+海深 12.2912397395
+七十二路 13.900677652
+透辉石 11.1926274509
+三万七千公里 13.2075304714
+谷内 11.3357282945
+常备兵 12.1089181827
+分不出 10.4041700905
+绝地 8.9308643524
+安全感 9.5186510173
+海淀 10.5684731418
+举荐 9.01787572939
+扑进 10.3171587135
+合山 11.4157710022
+骨殖 10.8561552143
+死中求活 11.4157710022
+西亚地区 11.9547675029
+废票 12.5143832909
+军书 12.1089181827
+戈马 12.8020653633
+和培根 13.2075304714
+酌办 13.900677652
+九万里 12.5143832909
+矿层 10.9049453784
+倍大提琴 13.2075304714
+平潭 10.642581114
+快要 8.00627481771
+全盘性 13.900677652
+凯克 12.8020653633
+城门失火 13.2075304714
+杜阿拉 11.7034530746
+考核制度 11.0103058941
+王之语 13.2075304714
+武王死 11.3357282945
+谷关 13.2075304714
+海洲 11.0674643079
+静虑 12.8020653633
+海派 11.4157710022
+水深 7.39788760606
+杯底 11.598092559
+看景生情 13.900677652
+英明 8.79473217808
+罐体 10.8561552143
+大部件 12.1089181827
+一双半 12.8020653633
+听得出来 10.0294766411
+军人 7.33119623156
+海洋 6.55531281156
+宋徽 12.5143832909
+种德堂 13.900677652
+多重选择 13.900677652
+含糖量 9.91169360541
+候风相 13.900677652
+线装 11.598092559
+小钩子 13.900677652
+贵妃醉酒 11.7034530746
+柱体 10.8096351986
+苏塞 13.900677652
+解兵 12.8020653633
+震源 10.2630914922
+加入者 11.4157710022
+海浪 9.03314320152
+学院院长 9.37888907493
+海海 12.1089181827
+乳浊 13.900677652
+韩鹏前 13.900677652
+海浴 13.900677652
+印象分 12.1089181827
+考虑一下 10.0505300503
+谷儿 11.8212361103
+地藏寺 12.5143832909
+朱荣先 13.2075304714
+总流量 11.8212361103
+乳浆 12.2912397395
+仿古砖 13.900677652
+招架之力 13.900677652
+商务洽谈 13.900677652
+尉为 13.900677652
+海流 9.07236391467
+叶针 12.8020653633
+孙老爷 11.4157710022
+口眼歪斜 12.2912397395
+景州塔 12.1089181827
+朗斯 11.5027823792
+化学修饰 12.2912397395
+泪泉 11.9547675029
+歪理邪说 12.8020653633
+久闻其名 12.5143832909
+城八区 13.900677652
+分配利润 9.19114745066
+拉瓦 11.9547675029
+海沧 12.8020653633
+维尔托 12.8020653633
+恶性循环 9.4233408375
+逸趣 13.900677652
+说定了 10.4994802703
+细菜 12.1089181827
+指明方向 11.8212361103
+狸藻 12.5143832909
+萧博宜 11.3357282945
+实职 10.765183436
+泔水桶 12.2912397395
+熔岩 8.75901409547
+拥兵自卫 13.900677652
+工整 9.34680076038
+欧阳文忠 13.2075304714
+细菌 7.35389224122
+这联 13.2075304714
+军伍 11.4157710022
+五千股 13.2075304714
+圣物 10.4666904475
+时装店 11.8212361103
+乳油 12.1089181827
+李三郎 13.900677652
+工效 9.7898037878
+交过来 13.900677652
+塔尔巴哈 9.98865464655
+球形 8.21031819765
+冤情 11.1280889297
+二夹弦 13.2075304714
+神圣同盟 11.1926274509
+巴尔的摩市 13.2075304714
+三一下子 13.2075304714
+黔南布依族苗族自治州 11.2616203224
+海沟 9.32596667347
+科研部门 12.2912397395
+成清波 11.1926274509
+普罗佩 13.2075304714
+视频 8.05713323494
+脓痰 11.7034530746
+泪浸 13.900677652
+海波 11.0103058941
+很毒 12.5143832909
+老油条 11.7034530746
+延边队 12.8020653633
+晒场 12.2912397395
+快行 12.2912397395
+从小到老 13.900677652
+无可名状 11.8212361103
+书本上 10.4041700905
+生动活泼 9.94943393339
+夜猫 13.900677652
+嘻皮笑脸 11.7034530746
+荀子注 13.2075304714
+桔黄 12.8020653633
+晋至唐 11.598092559
+情深义重 12.8020653633
+兴落 13.900677652
+艨艟 11.598092559
+图拉河 11.8212361103
+顶门壮户 13.900677652
+而降 10.765183436
+六尊 11.598092559
+常艳丽 13.2075304714
+虎丘 9.4233408375
+海法 11.1926274509
+爽脆 11.7034530746
+福圣宝 13.2075304714
+旺气 11.7034530746
+修复过程 11.598092559
+陈垦 13.2075304714
+克里特 9.94943393339
+伊斯肯 13.900677652
+吴郡吴 11.8212361103
+披麻带孝 12.8020653633
+跌跤 11.8212361103
+莫罗反射 13.900677652
+沈吟 11.8212361103
+冤恨 13.900677652
+主轴 9.5186510173
+球心 11.3357282945
+不精确性 13.900677652
+汝昌统 13.900677652
+电子音乐 11.598092559
+含冤受屈 13.900677652
+沈吉 10.9562386728
+构筑工事 12.1089181827
+鹅銮鼻 10.9049453784
+增长幅度 8.58255765813
+那梅香 13.2075304714
+海氏 13.2075304714
+跌跌 10.2117981979
+皮里阳秋 13.2075304714
+结结巴巴 9.01787572939
+外墙面 12.8020653633
+大龄青年 12.8020653633
+殷周金 12.8020653633
+海民 9.77354326693
+十余家 10.8096351986
+谈着 10.533381822
+陈坤 11.0103058941
+缟素 10.9562386728
+残渣 10.0505300503
+皱巴巴 11.0103058941
+失脚 11.7034530746
+二十七分 13.2075304714
+合川 10.1164880181
+第五十七届 13.2075304714
+害得 9.58318953844
+球径 13.900677652
+亲历其境 12.8020653633
+三百多名 11.4157710022
+矿工 8.95903522937
+勿扰 10.6818018271
+何德何能 11.9547675029
+罐中 11.4157710022
+英杰 10.4666904475
+凄酸 13.2075304714
+这股 8.68574189437
+卓识远见 13.900677652
+翠如意 12.1089181827
+总支部 11.1926274509
+沈周 10.8096351986
+解元 12.1089181827
+反复推敲 11.2616203224
+挺身而出 9.72629038208
+周天王 12.8020653633
+汉普郡 12.5143832909
+祖湛然 13.2075304714
+粘堵 13.2075304714
+十余名 11.7034530746
+清丰县 13.900677652
+吴兴人 11.9547675029
+小白脸 11.2616203224
+瞠目 11.3357282945
+国产手机 11.8212361103
+合刊 12.1089181827
+沈宋 12.2912397395
+兵谏 10.9562386728
+明知故犯 11.598092559
+线虫 9.89334446674
+裸泳 11.5027823792
+举贤 11.3357282945
+武王时 11.598092559
+机车组 13.900677652
+孱弱 10.642581114
+韵头 13.2075304714
+罗瑟林 13.2075304714
+十余吨 13.2075304714
+交通艇 12.5143832909
+国际形势 9.43476953332
+哈马德 12.2912397395
+合到 11.4157710022
+艾绒 11.8212361103
+沈家 11.7034530746
+现眼 12.5143832909
+这车 10.0940151622
+陈士 11.7034530746
+买来 8.53003962385
+所建 8.29487558568
+毫无知觉 11.3357282945
+第十一天 12.8020653633
+消防官兵 11.0674643079
+震怒 9.31571017331
+郑国公子 13.2075304714
+活罪难逃 13.900677652
+领头人 11.3357282945
+有机染料 12.5143832909
+谷德 13.900677652
+绝处 11.598092559
+美国长老会 12.5143832909
+李鸿恩 11.8212361103
+所应 10.0940151622
+抽象化 11.1280889297
+交通船 11.9547675029
+练跑 13.900677652
+苏厄德 12.8020653633
+请假 9.30555780184
+幸之臣 12.8020653633
+骨料 12.8020653633
+沈寿 12.5143832909
+班代 13.900677652
+班文臣 12.2912397395
+绝大 10.9562386728
+警铃 12.5143832909
+吴郡富 11.7034530746
+罕见 7.20735398371
+班柯 13.900677652
+米泽斯 12.8020653633
+挹注 13.900677652
+过氧化 11.3357282945
+合办 9.45802639549
+交易系统 7.20983537456
+饲养量 11.0103058941
+小洋房 13.2075304714
+班上 9.20019728618
+俄罗斯科学院 12.8020653633
+贼营 11.5027823792
+覆军杀将 13.2075304714
+这连 11.8212361103
+闪点 11.5027823792
+一个十八九岁 12.5143832909
+震惊 7.77162744192
+矿务 10.3743171274
+公安处 11.2616203224
+实迹 12.8020653633
+关吏 12.1089181827
+情况不明 10.7226238216
+横扫千军 13.2075304714
+变卖家产 11.8212361103
+熔化 9.21854642485
+李风念 13.2075304714
+良田万顷 13.900677652
+鱼虫 11.5027823792
+所干 11.1280889297
+乌青 10.642581114
+直盯盯 11.7034530746
+随后就去 13.900677652
+所幸 9.20932976975
+跨省 10.4666904475
+镀板 12.8020653633
+班主 10.4666904475
+颜三卫 12.8020653633
+秒左右 11.1280889297
+周边环境 10.5684731418
+头重脚轻 10.642581114
+阅看 13.900677652
+马六河 10.2117981979
+水浒 9.33632946051
+沈子 12.2912397395
+绝妙 9.84023464143
+扑腾 10.3171587135
+名目繁多 9.74179456862
+拉卡 12.2912397395
+二十几只 12.2912397395
+粘土 8.05713323494
+细谈 10.5684731418
+鞋底儿 13.2075304714
+屠苏酒 13.2075304714
+瑞士籍 12.5143832909
+爽身 13.900677652
+蔽日遮天 13.2075304714
+粘在 12.8020653633
+照排 12.2912397395
+实达 12.8020653633
+多万米 13.2075304714
+李邺 11.1926274509
+潘胤 13.2075304714
+主考 11.1926274509
+海捕 11.9547675029
+溶解能力 13.2075304714
+海损 11.9547675029
+讷谟尔 11.9547675029
+跨着 12.1089181827
+练起 12.8020653633
+有胖有瘦 13.2075304714
+三星电子 11.4157710022
+海报 9.94943393339
+优游卒岁 13.900677652
+废品库 13.900677652
+矿区 8.12923652885
+震慑 9.28555713513
+一下床 12.2912397395
+静观 10.765183436
+曹丕献 13.2075304714
+鲑鱼 10.3453295905
+杉树林 13.2075304714
+瘙痒症 12.8020653633
+王圻 13.2075304714
+神经网络 10.4994802703
+财迷 11.8212361103
+饺子皮 12.5143832909
+韦应物 11.4157710022
+一网打尽 9.82314020807
+散花 12.5143832909
+手松 12.5143832909
+哈尔滨军事工程学院 13.900677652
+劳动教养 11.0674643079
+卷末 11.4157710022
+害兽 11.5027823792
+人民公仆 12.5143832909
+矿化 10.0720362555
+桂生高 13.900677652
+档案袋 11.8212361103
+粘固 12.2912397395
+嘴尖 11.7034530746
+轨道舱 12.5143832909
+财运 11.8212361103
+南风 8.53938548627
+班达 11.3357282945
+功率密度 11.5027823792
+水流 7.25688791883
+随后就到 11.3357282945
+九龙湖 13.900677652
+芙蓉 8.35160156708
+二十七岁 11.2616203224
+请入 9.82314020807
+所征 10.642581114
+戴望舒 11.7034530746
+震感 12.5143832909
+马蒂亚 11.9547675029
+约旦空军 13.900677652
+蝴蝶兰 12.8020653633
+叩马而谏 13.900677652
+所得 7.31588625959
+碍于情面 12.1089181827
+毛毛细雨 12.2912397395
+合十 9.74179456862
+合卺 11.1926274509
+供需平衡 10.533381822
+朱骏声 12.2912397395
+热心肠 11.0674643079
+江东门 13.900677652
+谷底 8.70218062071
+海拔 6.15870975216
+球儿 11.8212361103
+译意 13.2075304714
+男扮女装 13.2075304714
+付朱谕 13.900677652
+于崇政 13.2075304714
+垂死 9.98865464655
+唐花 12.8020653633
+原石重 13.2075304714
+教成 12.2912397395
+全家 7.69208762588
+陈套 13.900677652
+两面性 11.0103058941
+较熟 12.8020653633
+张宏伟 12.8020653633
+陈奉 13.2075304714
+绝壁 9.08039608637
+营养学 10.3743171274
+陈奂 13.2075304714
+秦破燕 12.8020653633
+边检站 13.2075304714
+白云片片 13.900677652
+班会 11.9547675029
+不堪重负 10.4349417492
+陈好 10.0294766411
+粟特文 11.7034530746
+切磋 10.0720362555
+全宗 11.8212361103
+悉听 11.9547675029
+云雀 10.604840786
+照拂 11.1926274509
+年纪轻轻 10.0294766411
+蒂萨河 12.5143832909
+矿厂 13.900677652
+阿拉贡 10.8096351986
+海战 8.74738605748
+全寺 11.7034530746
+全对 11.5027823792
+时装表演 11.9547675029
+合发 13.900677652
+合取 11.8212361103
+荣中堂 10.5684731418
+警长 11.5027823792
+主创人员 12.2912397395
+污乱 13.900677652
+照护 12.2912397395
+绝境 9.45802639549
+工段 11.9547675029
+人造石 13.900677652
+三姑六婆 13.900677652
+珍珠港事件 10.9562386728
+刹车油 12.1089181827
+苏维埃共和国 10.9562386728
+清晨 8.20358416547
+海扇 13.2075304714
+主脑 13.2075304714
+一反其道 13.900677652
+数学组 13.900677652
+母驴 13.900677652
+震憾 11.8212361103
+天珠 10.1164880181
+合叶 11.9547675029
+子房壁 13.900677652
+陈太 13.2075304714
+党卫队 10.765183436
+阜阳市 11.0674643079
+细账 12.1089181827
+细质 12.8020653633
+主脉 10.0940151622
+熔剂 10.3453295905
+陈大 12.8020653633
+系词 12.8020653633
+巧合 8.57766767284
+破产倒闭 10.8561552143
+河神 10.642581114
+非加太 12.8020653633
+马靴 10.642581114
+请别 11.5027823792
+很暗 10.4994802703
+公司债务 10.642581114
+申辩权 12.2912397395
+丹参滴丸 11.8212361103
+一无所获 9.80633308975
+块体 10.4349417492
+富鲁诺 12.8020653633
+请到 9.01787572939
+鲜牛奶 11.1280889297
+编码法 13.900677652
+日语学校 12.5143832909
+邀客 13.900677652
+能连铁 13.900677652
+邀宠 11.8212361103
+民俗旅游 13.2075304714
+巴黎和会 9.75754292558
+绝学 11.1280889297
+练达 10.3171587135
+美国国会 9.05649056552
+盛气凌人 10.2897597393
+谷川 12.2912397395
+外环线 12.2912397395
+泵管 11.9547675029
+夏启死 12.8020653633
+化装舞会 13.2075304714
+合做 12.5143832909
+飞祸 13.900677652
+佛教文化 11.4157710022
+聚乙稀 12.8020653633
+孰知 12.8020653633
+骨架 8.59240995457
+蛇根草 13.900677652
+魏公子 13.2075304714
+绝热 10.6818018271
+琴槌 12.2912397395
+从事 5.58878809375
+所向克捷 11.9547675029
+日月同辉 13.900677652
+留个心眼 12.8020653633
+吸盘式 13.900677652
+慎可推 13.2075304714
+域论 12.5143832909
+南金东箭 13.900677652
+古登堡 12.2912397395
+一箩筐 11.8212361103
+邱县 12.8020653633
+广发基金 9.10488710638
+实质 7.14258314755
+操作实务 13.900677652
+造成 5.10721729092
+上皮珠 13.900677652
+抛下去 12.1089181827
+文明礼仪 13.900677652
+兴利除弊 11.9547675029
+恳挚 12.8020653633
+从崇祯 10.8096351986
+代宗命 12.8020653633
+骨板 10.4041700905
+古籍整理 11.0674643079
+手术过程 12.5143832909
+初具规模 8.87679713113
+水沉 13.900677652
+戎装 9.30555780184
+绝密 10.0940151622
+公司债券 8.08059472162
+沈复 12.8020653633
+嬉游曲 12.8020653633
+所属 7.19994654243
+去离子水 12.5143832909
+马明心 13.2075304714
+时装化 12.2912397395
+乌镇 9.62401153296
+一哄而散 10.604840786
+格登 10.9562386728
+经典影片 12.5143832909
+绝对 6.00004103896
+实践 6.65787972918
+陈婴 13.2075304714
+警队 12.1089181827
+英模 11.598092559
+术科 13.900677652
+工棚 10.1630080337
+音乐大师 12.5143832909
+全境 7.96843246453
+公文箱 13.2075304714
+残损 12.2912397395
+经济总量 9.35738286971
+叶飞 12.8020653633
+很晚 10.0088573539
+唐至 11.9547675029
+陈娟 13.900677652
+三十余种 13.900677652
+文字量 13.900677652
+打零工 11.1926274509
+佩特拉 11.8212361103
+水沼 13.900677652
+骨朵 11.4157710022
+六十四名 13.2075304714
+周泰守 12.8020653633
+共同语言 10.2897597393
+一哄而上 10.604840786
+这趟 9.54396882529
+请勿 9.98865464655
+邀请函 11.4157710022
+陈娇 13.900677652
+戈雅 11.3357282945
+流着泪 9.80633308975
+九重天 11.7034530746
+王审琦 11.9547675029
+编程语言 11.4157710022
+华来儿 12.2912397395
+谷崎 13.900677652
+恺切 13.2075304714
+新龙头 11.9547675029
+戈雷 12.8020653633
+赤县神州 12.1089181827
+要面子 11.8212361103
+拉磨 12.2912397395
+右倾机会 13.900677652
+视锥 11.9547675029
+一千二三百 13.2075304714
+耐溶剂 12.5143832909
+九十八 12.5143832909
+举过 10.8561552143
+总持仓 10.3453295905
+陈子龙 10.7226238216
+由不得你 11.4157710022
+贾亚瓦 13.2075304714
+百十米 12.8020653633
+教工 12.2912397395
+财路 10.6818018271
+牵得 12.1089181827
+退伍兵 12.8020653633
+看风转舵 13.900677652
+全天 7.43608934829
+陈富 13.900677652
+谷峰 13.900677652
+第四十八章 11.3357282945
+陈修边 12.8020653633
+工楷 12.8020653633
+可折叠 10.9562386728
+建筑安装 11.4157710022
+或大或小 10.2897597393
+阿拉达 12.8020653633
+服装研究 13.900677652
+陈寿 10.642581114
+预防针 11.8212361103
+敝国 13.2075304714
+指日而待 13.900677652
+兴衰 9.12155415886
+主菜 11.8212361103
+九龙江 10.1630080337
+梁老板 11.2616203224
+全备 10.642581114
+除法器 13.2075304714
+任京湖 12.8020653633
+生子启 12.8020653633
+泵站 11.4157710022
+拉祜 10.8096351986
+陈宜 12.5143832909
+全好 11.1280889297
+形质 11.598092559
+谷岭 12.8020653633
+细辛 10.4349417492
+丝毫无损 12.1089181827
+陈宗 12.2912397395
+春熙路 13.900677652
+呲牙 10.765183436
+陈宋 12.8020653633
+陈安 12.8020653633
+韦格曼 13.900677652
+立碑纪 13.2075304714
+河砂 12.2912397395
+十余块 12.2912397395
+陈宁 13.900677652
+逸致 13.2075304714
+己烷 12.5143832909
+合共 10.4666904475
+陈家 9.80633308975
+全套 9.20932976975
+合兴 11.0103058941
+印芬皇 13.2075304714
+拉票 12.1089181827
+洪校本 13.2075304714
+杨春指 13.2075304714
+陈嘉庚奖 12.8020653633
+陈宣 12.8020653633
+兵车 10.7226238216
+宝哥儿 12.5143832909
+犯罪案 13.900677652
+常继发 11.9547675029
+球友 13.900677652
+小白花 11.7034530746
+合写 10.2630914922
+封嵩 13.900677652
+竖心旁 13.900677652
+矿冶 9.71102290995
+陈子 13.2075304714
+海怪 10.765183436
+新学伪经 11.7034530746
+翠谷 12.8020653633
+世态炎凉 11.0674643079
+卫生队 11.7034530746
+流行起来 11.0103058941
+马尔代夫共和国 13.900677652
+龙之臣 11.5027823792
+英国政府 8.44535653662
+营销部 11.8212361103
+蹒跚行走 13.900677652
+教育部长 10.9562386728
+财赋 9.59661255877
+告人 11.8212361103
+二十七年 8.75901409547
+接壤 8.38322475551
+王原祁 11.5027823792
+驯养 9.74179456862
+沽名钓誉 10.7226238216
+球台 11.7034530746
+李小姐 11.598092559
+有难同当 12.2912397395
+细软 9.49395840471
+仍以 8.39128931535
+麻疹病毒 13.2075304714
+粘合 9.62401153296
+俞大猷 10.533381822
+鲍国安 13.900677652
+拉科 12.1089181827
+寇凉州 13.2075304714
+理工科 10.765183436
+顷者 13.900677652
+海恩 12.2912397395
+张德辉 11.8212361103
+鲍国宝 12.8020653633
+靠墙边 13.900677652
+飞离 10.765183436
+狄俄尼 13.900677652
+唐胥 12.1089181827
+很杂 11.4157710022
+疑问词 13.900677652
+数学系 10.1164880181
+睡不醒 11.9547675029
+财贸 10.9562386728
+秋蕙 13.900677652
+持戟 11.9547675029
+星区 13.2075304714
+莺歌 10.7226238216
+合击 11.3357282945
+疑问请 13.900677652
+很松 12.8020653633
+三百七十六 12.8020653633
+台南人 12.8020653633
+二十七席 13.900677652
+全委 12.5143832909
+戈韵 12.8020653633
+斯塔特 11.2616203224
+粉底霜 12.8020653633
+英武 9.77354326693
+悲观者 11.598092559
+主茎 11.7034530746
+女英雄 11.5027823792
+监察组 12.1089181827
+海枣 13.2075304714
+射器 12.5143832909
+传送器 13.900677652
+河网 9.26594866375
+年薪制 13.900677652
+花瑞草 13.2075304714
+宫崎县 12.5143832909
+照来 13.900677652
+球员 8.59240995457
+全席 12.5143832909
+参观指导 13.900677652
+国有化 9.23723855786
+陆上运输 11.5027823792
+枕垫 12.8020653633
+请吃 11.0674643079
+墨西哥合众国 12.8020653633
+政治经济学 8.30596627237
+杨广乘 12.8020653633
+巴勒斯坦 8.66423568915
+今岁 11.4157710022
+海林 11.0674643079
+明孝宗 12.1089181827
+笛管 12.5143832909
+斯派利 12.8020653633
+于步军 13.900677652
+全市 7.03791973892
+范家庄 12.8020653633
+堆金积玉 13.900677652
+陈岛 11.9547675029
+英法 8.9308643524
+球后 11.8212361103
+采蘑菇 11.3357282945
+持斋 11.9547675029
+全年 6.18288144096
+达尔维 13.900677652
+毫无警觉 13.900677652
+水泽 11.8212361103
+海柳 11.0103058941
+风媒传粉 13.900677652
+季雨林 9.48183704418
+请命 11.3357282945
+仍未 7.99531580392
+斯多亚 13.900677652
+构成犯罪 9.72629038208
+基因治疗 12.2912397395
+就寝时间 13.900677652
+共青团中央书记处 12.8020653633
+波尔查诺 12.1089181827
+很想 8.81927328699
+贾政进 12.2912397395
+海狗肾 13.2075304714
+贼胆 11.9547675029
+抽象地 10.9562386728
+很惨 10.2897597393
+优秀品格 13.900677652
+动态存储分配 13.2075304714
+鼓楼区 13.2075304714
+谷实 11.9547675029
+仙女湖 13.900677652
+提货人 13.900677652
+其貌不扬 10.6818018271
+梅江河 13.2075304714
+实诚 11.7034530746
+水泵 9.82314020807
+周公规 13.2075304714
+理论课 12.5143832909
+欧亚大陆桥 11.8212361103
+持效 11.9547675029
+张向东 12.8020653633
+很怕 11.0103058941
+四五百万 12.8020653633
+这话 6.42137801419
+实词 11.9547675029
+小荣椿 13.2075304714
+测试工具 12.5143832909
+实证 8.89004235788
+细行 13.2075304714
+王之臣 13.900677652
+戴高乐 9.53122979951
+邬翊光 13.2075304714
+心理负荷 12.1089181827
+拉线 11.9547675029
+乞儿 11.598092559
+拉纳 12.1089181827
+实说 10.0720362555
+喜气洋洋 9.85762638414
+海月 11.7034530746
+南北对话 10.4994802703
+全序 13.900677652
+谷子 8.33999602096
+举要 11.598092559
+电子设备 8.4284069783
+拉纤 11.0674643079
+全庄 12.8020653633
+很急 10.1630080337
+满意率 11.598092559
+适航性 11.3357282945
+戎衣 12.1089181827
+阿哈尔 13.2075304714
+陈少 11.3357282945
+失色 9.34680076038
+陈小 10.1164880181
+主营 8.32094782599
+英汉 11.8212361103
+红着 11.0103058941
+拉练 11.4157710022
+全国人大常委会法工委 11.1926274509
+药用菌 13.900677652
+未婚同居 12.5143832909
+陈尸 11.9547675029
+数公里 11.1926274509
+海权 11.2616203224
+骨感 11.1926274509
+身体衰弱 11.8212361103
+二十七天 12.5143832909
+拉绳 11.9547675029
+黑蓝红 13.2075304714
+滨湖 9.94943393339
+拉维 12.8020653633
+静谧 9.94943393339
+街区 9.77354326693
+画蚓涂鸦 13.900677652
+迳自 12.5143832909
+很恨 13.2075304714
+兵马未动 13.900677652
+番泻叶 11.7034530746
+凯兴 12.8020653633
+甄家荐 13.2075304714
+耐冲击 11.3357282945
+乡乡 13.900677652
+工潮 12.2912397395
+陈州 9.77354326693
+矿场 10.6818018271
+沈府 12.8020653633
+陈川 13.2075304714
+利益一致 11.3357282945
+抑菌作用 11.8212361103
+阮小五 9.72629038208
+细观 10.4349417492
+穴位 9.06439574502
+老八路 12.2912397395
+茅草房 11.2616203224
+老太爷 8.76487921493
+满场子 12.5143832909
+买手 13.900677652
+沈庆 11.7034530746
+没舍得 10.6818018271
+小动脉 10.5684731418
+贲临 13.900677652
+警醒 9.72629038208
+第十一届 9.30555780184
+东歌 13.900677652
+行行好 10.9049453784
+微型车 10.4994802703
+元永昌 11.5027823792
+正一道 10.8561552143
+合在 10.6818018271
+仁贵 12.1089181827
+蚁穴 11.5027823792
+古斯曼 12.2912397395
+全异 13.2075304714
+很亮 10.4666904475
+全开 11.598092559
+沈度 11.5027823792
+买成 11.3357282945
+快艇 9.63799777493
+拉网 10.5684731418
+隆卒悉 13.900677652
+东方花园 13.900677652
+拉罕 13.900677652
+绝尘 11.2616203224
+拉罗 11.8212361103
+六只手 12.5143832909
+全彩 12.5143832909
+多万种 11.8212361103
+照映 12.8020653633
+全形 11.598092559
+海曼 11.9547675029
+冷不丁 9.53122979951
+历史观 9.80633308975
+孝亲 12.5143832909
+淋淋 11.4157710022
+全当 10.604840786
+唐虞 11.8212361103
+买房 7.91674137129
+帽状结构 13.900677652
+举行 5.50904768353
+江猪 12.1089181827
+谈不上 8.63281949291
+主薄 11.8212361103
+照明 7.40692381212
+余万人次 13.2075304714
+贝坦森 13.900677652
+陈沿其 13.2075304714
+议论风生 13.2075304714
+海春 13.900677652
+轻裘肥马 13.2075304714
+粘剂 13.900677652
+带兵人 13.900677652
+扑落 11.8212361103
+全德 11.1280889297
+副业生产 11.4157710022
+孙蒙哥 12.8020653633
+甚嚣尘上 10.4349417492
+江珊 13.900677652
+拉美 8.58255765813
+马毓真 12.5143832909
+所存 10.1394775363
+切中时病 13.900677652
+孝义 9.84023464143
+淮河水利委员会 13.2075304714
+日臻成熟 11.9547675029
+所学 9.54396882529
+新新人类 13.2075304714
+六十四卷 12.5143832909
+海明 12.1089181827
+海昌 13.2075304714
+龙门镇 13.2075304714
+绵阳 9.65218240993
+卫生设备 12.2912397395
+巴特瓦 13.900677652
+震旦 10.1871055853
+死亡率 8.9102450652
+海星 9.55687223012
+烽火连天 13.900677652
+收罗人才 12.2912397395
+新去处 13.2075304714
+害喜 13.900677652
+海景 10.8096351986
+体制性 11.1280889297
+乌溜溜 11.5027823792
+利用业务 13.900677652
+西克斯 12.1089181827
+于御河 12.5143832909
+镀成 12.8020653633
+菜篮子工程 13.2075304714
+戈里 12.5143832909
+淋浴 10.2630914922
+隔水层 11.5027823792
+全忠 12.1089181827
+全灵 12.8020653633
+坎帕尼亚 12.8020653633
+射击训练 12.2912397395
+委任状 11.8212361103
+团体冠军 10.604840786
+公安局 7.85330547293
+那庄客 12.1089181827
+海晏 12.5143832909
+沈平 12.1089181827
+禄东赞 12.2912397395
+莫罗尼 11.9547675029
+四海升平 11.9547675029
+相于秦 12.8020653633
+驼着背 12.8020653633
+推荐者 13.900677652
+令人鼓舞 10.4349417492
+很慢 9.14708746087
+全心 10.8096351986
+合谷 11.2616203224
+唯命是听 13.900677652
+霍查 12.1089181827
+系谱 11.9547675029
+事无巨细 10.533381822
+晒干 9.5186510173
+高电平 13.900677652
+海斯 10.8561552143
+滨河 10.7226238216
+低功耗 12.8020653633
+振铃 13.2075304714
+造景 11.9547675029
+纳延 13.2075304714
+致远 9.7898037878
+合合 12.5143832909
+合同 6.47591589015
+铆钉 11.0674643079
+合吃 13.900677652
+挂下 13.2075304714
+视野 7.90671622467
+力偶矩 12.8020653633
+海文 11.8212361103
+巧取 12.5143832909
+孱头 12.1089181827
+兴起 6.92060171141
+乌里 11.7034530746
+无线电 7.80260336981
+陈延 13.2075304714
+陈廷 13.900677652
+蝴蝶结 11.4157710022
+造物者 12.2912397395
+内阁总理 9.66657114738
+乌金 11.5027823792
+批评家 9.7898037878
+惟以 11.2616203224
+拉簧 13.900677652
+游过去 11.5027823792
+纹波 13.2075304714
+沈州 12.5143832909
+居碎叶 12.5143832909
+天际线 13.2075304714
+淋滤 12.5143832909
+五七干校 11.3357282945
+未降 11.1280889297
+德圣君 13.900677652
+全山 11.2616203224
+瞬息万变 9.96885201925
+个别教学 12.8020653633
+四环素牙 13.2075304714
+乌鲁卡基 12.8020653633
+太岳山 11.2616203224
+迫于形势 11.5027823792
+哈马姆 13.900677652
+山虎 8.82550383674
+跌落 8.71329184614
+昭示中外 13.900677652
+陈庄 9.21854642485
+惠而浦 12.5143832909
+番泻 12.8020653633
+于含章 13.2075304714
+全属 9.93038573842
+国际禁毒日 13.900677652
+悉由 11.598092559
+人道主义 8.93783302172
+拉米 10.2630914922
+持枪 9.59661255877
+潘虹 13.900677652
+海洋学家 10.8096351986
+绘声 13.2075304714
+线膨胀 13.2075304714
+残枝 11.8212361103
+恳望 13.2075304714
+球囊 11.598092559
+惊吓过度 12.2912397395
+木工板 13.900677652
+晕船 11.5027823792
+宠爱有加 13.2075304714
+矛柄 13.2075304714
+三十六计 10.5684731418
+贼船 11.8212361103
+照旧 8.78268383956
+国际刑警组织 12.1089181827
+李小峰 13.900677652
+成人节 13.900677652
+一百四十六万 12.2912397395
+全岛 8.93783302172
+残杀 9.96885201925
+振华路 12.2912397395
+所填 12.5143832909
+练摊儿 12.8020653633
+陈年 9.63799777493
+鲁襄公 12.8020653633
+食品市场 12.5143832909
+嘴快 11.598092559
+太阴君 13.2075304714
+战无不胜 10.9562386728
+这要 8.83177344976
+剖视 13.900677652
+哈兰德 12.5143832909
+空洞洞 13.2075304714
+残本 10.642581114
+歇会儿 10.765183436
+陈师 12.5143832909
+谷头 12.2912397395
+抚育费 13.2075304714
+巧匠 10.8561552143
+涨红 9.96885201925
+良莠不一 13.900677652
+很扁 13.900677652
+淋湿 10.4349417492
+风景树 12.2912397395
+惟一 7.73736284794
+领事部 13.900677652
+绵长 10.2371160058
+浩瀚 9.93038573842
+滨江 9.37888907493
+垂泣 13.2075304714
+残月 10.6818018271
+垂泪 9.41204128224
+喻明发 13.900677652
+数学科 13.2075304714
+形貌 9.77354326693
+酱油膏 13.900677652
+哈米德 10.642581114
+宴飨 11.9547675029
+举证 10.3453295905
+巨济岛 13.2075304714
+兴趣 6.87247621992
+火棒 13.2075304714
+四百里 11.0674643079
+这行 9.40086798165
+毛栗子 12.2912397395
+俯冲角 13.900677652
+徐茂功 12.5143832909
+脑磷脂 12.5143832909
+秦太虚 13.2075304714
+第五次 8.45394028031
+谷壳 12.5143832909
+科克湾 13.900677652
+逛公园 11.7034530746
+热情关心 13.900677652
+我心依旧 13.2075304714
+消防车 10.533381822
+有步骤 9.75754292558
+以人择官 13.900677652
+细说 8.99540287354
+谷壁 12.5143832909
+免验 13.900677652
+合唱 9.4233408375
+蓬瀛 11.8212361103
+第一二二 13.900677652
+金童玉女 11.3357282945
+翠袖 11.4157710022
+脚蹬子 13.900677652
+沈岭 13.900677652
+试制成功 10.604840786
+拉索 11.4157710022
+细语 10.533381822
+拉紧 10.8561552143
+兴象 13.2075304714
+总评榜 11.2616203224
+绿绿的 12.8020653633
+搪瓷制品 12.5143832909
+巧劲 12.1089181827
+逃灾避难 13.2075304714
+武里河 12.8020653633
+遵行 10.1630080337
+瓦尔达 12.1089181827
+杨巨源 13.900677652
+那土兵 13.2075304714
+一枝春 12.8020653633
+第五步 12.5143832909
+残暴 8.76487921493
+照搬 9.74179456862
+怒江傈僳族自治州 11.3357282945
+巴鲁克 13.2075304714
+晕菜 13.900677652
+骨折 8.63798746307
+漂白粉 11.0103058941
+线脚 13.2075304714
+一枝梅 13.900677652
+同来同往 13.900677652
+能卫国 13.2075304714
+十几趟 13.900677652
+陈德 11.8212361103
+痒觉 13.900677652
+宴饮 9.77354326693
+球场 9.72629038208
+万澳元 11.8212361103
+实现目标 10.7226238216
+低声悄语 13.900677652
+铁睦尔 13.2075304714
+从滋水 12.2912397395
+稍等片刻 11.598092559
+酌定 11.4157710022
+石英 8.35160156708
+精精致致 13.2075304714
+粟特人 11.5027823792
+玻璃器皿 11.0103058941
+韦斯明 12.8020653633
+一百零三天 13.2075304714
+一百一十里 13.900677652
+楚得复 12.8020653633
+第五段 13.900677652
+境界 7.96050639926
+滨洲 10.4666904475
+功德碑 11.8212361103
+重建家园 11.2616203224
+圩堤 11.4157710022
+五十六万 13.2075304714
+斯蒂 10.8561552143
+亚硫酸盐 11.9547675029
+和庆玉 11.4157710022
+实装 13.900677652
+河系 10.533381822
+沈尹 13.2075304714
+邪教徒 12.8020653633
+冤案 9.98865464655
+属区 12.1089181827
+唐蒙 11.8212361103
+相信群众 12.5143832909
+迈过 10.0294766411
+淋漓 9.19114745066
+杰安特 13.900677652
+古登巴 13.2075304714
+熔合 13.2075304714
+陈彭 12.2912397395
+馈赠礼品 13.900677652
+房门口 10.0720362555
+凄凄惨惨 11.5027823792
+很挤 12.1089181827
+所好 10.642581114
+球型 11.598092559
+陈弘 13.2075304714
+化香树 12.1089181827
+营养成分 9.31571017331
+乔吉 11.9547675029
+常用量 13.2075304714
+滨海 7.93967231235
+浩然 11.3357282945
+宵小 11.3357282945
+美狄亚 11.9547675029
+陈式 11.5027823792
+于深宫 12.1089181827
+避人耳目 11.8212361103
+宋发兵 12.8020653633
+中国大使馆 13.900677652
+擦热 13.900677652
+肽能纤维 13.900677652
+陈强 10.9049453784
+谷堆 11.3357282945
+劈到 13.2075304714
+全州 9.59661255877
+重点线 12.5143832909
+十余只 10.9562386728
+沈山 11.1926274509
+尖沙咀 13.2075304714
+十余口 13.900677652
+鲜货 11.7034530746
+汉朝 8.61241062128
+造林 8.74738605748
+首席 6.75943252963
+陈张 12.8020653633
+张保皋 12.8020653633
+国泰民安 10.4349417492
+擒贼擒王 11.5027823792
+拉成 11.1926274509
+腿部 9.36807815882
+很粗 10.8561552143
+叶色 11.2616203224
+传教士 8.57280148319
+卫岗 13.2075304714
+球童 12.1089181827
+理家 12.2912397395
+镜边 13.900677652
+茅盾文学奖 10.1164880181
+丁善德 11.9547675029
+三湘四水 12.1089181827
+诡奇 13.2075304714
+一十四遍 12.8020653633
+这面 9.04086524761
+主食 9.04086524761
+但愿如此 11.7034530746
+赵扩 12.5143832909
+史学 8.13235665618
+荀子简 13.2075304714
+陪葬品 9.72629038208
+垂爱 11.4157710022
+曙色 10.9049453784
+六十四代 12.5143832909
+封师歧 12.5143832909
+椎间盘 10.8096351986
+垂片 13.900677652
+很糟 11.7034530746
+嗡嗡作响 11.0103058941
+插秧机 11.7034530746
+板结构 12.8020653633
+何绍庚 13.2075304714
+汉言崇 13.2075304714
+林碧川 13.2075304714
+拉手 11.0674643079
+桦南县 13.900677652
+枕木 10.1871055853
+团干 12.2912397395
+拉扎 11.7034530746
+乌达 11.2616203224
+英烈 10.0294766411
+虎头 9.48183704418
+白日见鬼 13.900677652
+中山医学院 12.8020653633
+主频 11.598092559
+震破 12.1089181827
+分析 4.8436050164
+涧西区 11.1926274509
+为民父母 13.900677652
+簠簋 13.900677652
+薪炭材 11.8212361103
+主题 6.20038244856
+华山松 10.3453295905
+宏文 12.8020653633
+首付款 10.533381822
+拉扯 8.74738605748
+遣返 10.2897597393
+能丰长 13.2075304714
+班固 9.77354326693
+维亚科 13.2075304714
+远见 8.85082164473
+宁徽寺 12.8020653633
+姚侍郎 13.2075304714
+粘住 10.8561552143
+主页 10.6818018271
+冠履 12.8020653633
+卫尉 10.4666904475
+几块钱 10.9562386728
+国际公约 10.1630080337
+主顾 9.89334446674
+奈克 13.2075304714
+史密 12.2912397395
+茨威格 11.9547675029
+私有财产 9.37888907493
+流动资金 8.26588804881
+赵尚志 12.5143832909
+宋登科 13.2075304714
+出错率 13.900677652
+挖进 12.5143832909
+读得 10.6818018271
+柱头 9.71102290995
+克里斯 10.604840786
+海笋 12.1089181827
+薪炭林 10.9049453784
+鄂伦春 10.3743171274
+犯罪率 11.3357282945
+麻麻亮 10.6818018271
+奇耻大辱 10.533381822
+戴相龙 12.1089181827
+江滨 12.8020653633
+富贵荣华 11.1926274509
+八大处 13.2075304714
+毙掉 13.900677652
+浩渺 11.1926274509
+线麻 12.8020653633
+叶芥 13.2075304714
+罐头 8.44109213783
+袅袅 9.69598503258
+史实 8.92394390956
+史官 9.58318953844
+拉拔 13.2075304714
+人财物 10.9562386728
+江源 12.8020653633
+地质系 11.7034530746
+大藤峡 10.765183436
+照管 9.5186510173
+神树 12.2912397395
+逆行 10.0505300503
+台式 10.8561552143
+团建 13.900677652
+照算 13.900677652
+史家 9.45802639549
+财阀 10.604840786
+轮不到 10.1164880181
+不留情 11.4157710022
+沙迦 11.5027823792
+值班室 10.1871055853
+解宝守 12.5143832909
+地壳均衡 11.4157710022
+翠青 12.1089181827
+静逸 12.1089181827
+梅鲁洛 13.900677652
+耗子药 13.900677652
+铁矿砂 10.9049453784
+史楚金 12.2912397395
+公之勇 13.900677652
+军士 7.53764954844
+实验报告 11.5027823792
+叶芝 11.8212361103
+弹劾权 12.8020653633
+贝勒贝 13.2075304714
+枭首 11.0674643079
+叶荣 10.2117981979
+变错 13.900677652
+呼肠 12.8020653633
+擢用 10.5684731418
+飞奔而去 10.6818018271
+地躺拳 13.900677652
+阳春面 13.900677652
+军备 9.27570483869
+于荫霖 13.900677652
+林行省 12.8020653633
+费尔干纳 10.1164880181
+实际 5.30374949254
+两回事 10.0088573539
+火烧云 11.8212361103
+叶草 11.3357282945
+义不容辞 10.1164880181
+侍立在 9.94943393339
+玉屏风散 12.8020653633
+向心 10.2117981979
+石质 9.31571017331
+河内 8.87023973058
+吁叹 13.2075304714
+任直隶 11.0103058941
+军训部 12.2912397395
+多万斤 13.2075304714
+鼓掌欢迎 13.900677652
+阿斯匹林 11.2616203224
+峥嵘 9.89334446674
+反目为仇 13.2075304714
+扭起来 13.2075304714
+普卢塔克 11.7034530746
+谈不到 9.96885201925
+记分册 13.900677652
+识大体 11.2616203224
+电影协会 13.2075304714
+活化素 13.900677652
+防暑药 13.900677652
+坦荡荡 12.5143832909
+苏氏改 13.2075304714
+卫州 10.9049453784
+唐马 13.900677652
+生产工艺 9.16447920358
+大部头 11.5027823792
+叶茂 11.4157710022
+除皱术 13.900677652
+项目部 10.9049453784
+装蒜 11.2616203224
+感光鼓 13.900677652
+叶茎 12.8020653633
+霓红灯 12.5143832909
+梅克内斯 13.900677652
+向往 8.4980002701
+康帕内拉 11.9547675029
+骨粉 11.598092559
+打官腔 11.9547675029
+台座 12.1089181827
+甜橙 10.7226238216
+杨先用 13.2075304714
+这阵 9.72629038208
+洛杉矶 8.83177344976
+部门经理 11.9547675029
+很乱 9.65218240993
+傲慢少礼 13.900677652
+两二个 13.2075304714
+别嘌呤醇 13.900677652
+坯布 12.2912397395
+李顺达 12.8020653633
+数千年 9.12155415886
+拉掉 12.8020653633
+提货单 12.8020653633
+连昌宫 12.2912397395
+首映礼 11.8212361103
+团徽 13.900677652
+泪管 12.8020653633
+库里蒂巴 12.8020653633
+惟其 10.3453295905
+叶菊 11.4157710022
+高州县 12.1089181827
+海程 12.1089181827
+波特兰 10.8561552143
+细长 7.82763311788
+水金鉴 12.8020653633
+很累 10.2897597393
+佛罗伦 12.8020653633
+历山卓 12.5143832909
+很紧 10.0940151622
+击节叹赏 12.8020653633
+数千幅 12.8020653633
+粘上 11.1926274509
+爱多 12.5143832909
+军委 9.46986085313
+筑成 9.23723855786
+南开大学历史系 13.900677652
+柱塞 12.5143832909
+台布 10.8096351986
+叶莲 11.9547675029
+台币 11.1926274509
+指挥艺术 11.0103058941
+残破 8.64840422393
+齐如山 12.5143832909
+叶莺 12.2912397395
+导购 11.3357282945
+海空 10.3171587135
+鳞片状 10.0940151622
+国家环境保护总局 13.900677652
+实难 10.4041700905
+叶莉 13.900677652
+自讨苦吃 11.2616203224
+保境息民 12.5143832909
+造福 9.53122979951
+基蒂 13.900677652
+案外人 11.8212361103
+北伐战争 9.04086524761
+草本 8.11071748108
+平均温度 9.87532596124
+息影 11.8212361103
+任尚书郎 13.2075304714
+极乐寺 11.598092559
+明角灯 12.2912397395
+十余丈 11.1280889297
+听其自然 11.598092559
+拉脊山 11.2616203224
+十余万 9.34680076038
+台州 9.31571017331
+视距 10.4349417492
+变性 9.06439574502
+块块 11.9547675029
+何公敢 13.2075304714
+冬凌草 13.2075304714
+利比亚 9.16447920358
+江汉 9.17328983326
+说不定 6.87159008783
+息息相通 11.3357282945
+尤里乌 12.8020653633
+增加数 13.900677652
+朝天宫 12.2912397395
+残篇 11.9547675029
+单峰 12.5143832909
+海禁 10.2117981979
+擦洗 9.84023464143
+兵阵 11.598092559
+十余两 13.2075304714
+克里木 9.72629038208
+窗口期 10.604840786
+沙恩霍 11.9547675029
+新高 6.21130654445
+齿白唇红 11.9547675029
+日戳 11.4157710022
+细雨 9.87532596124
+丢下不管 12.2912397395
+奥林匹克村 11.9547675029
+曾元裕 12.8020653633
+维克多 11.5027823792
+宜置戍 13.2075304714
+涂敷法 13.2075304714
+军婚 12.2912397395
+燕军乘 12.8020653633
+昆明制药 10.604840786
+心情沉重 9.96885201925
+三十六面 12.5143832909
+江氏 12.8020653633
+广州市委 11.598092559
+叶耳 12.1089181827
+悲观论调 12.1089181827
+并要 9.98865464655
+胸有成竹 9.18217878068
+很细 9.94943393339
+冬雾 13.900677652
+兽力车 13.2075304714
+炊事班长 12.2912397395
+江永 11.2616203224
+萋萋 13.900677652
+江水 8.48457724977
+割过 12.5143832909
+人模人样 12.8020653633
+年老体衰 11.598092559
+族姓 10.642581114
+恻隐之心 9.91169360541
+向山 11.4157710022
+狄族 12.1089181827
+王妈 11.9547675029
+谈不出 12.1089181827
+跨洲 13.2075304714
+门殚户尽 13.900677652
+生财有道 12.8020653633
+班吉 11.2616203224
+兜率 11.0103058941
+江泉 13.2075304714
+上香 10.4666904475
+夜游 11.2616203224
+若干镑 13.2075304714
+英爱 12.2912397395
+这门 8.65893063692
+江泽 13.900677652
+山西省人民政府 11.598092559
+八英寸 12.8020653633
+英爽 12.8020653633
+静电印刷 13.900677652
+游击战争 9.10488710638
+谷麦总 13.2075304714
+罗雪又 13.2075304714
+哀嚎 10.7226238216
+吞刀吐火 13.900677652
+粘糕 13.900677652
+江波 12.5143832909
+产品销售 8.77077893705
+殖民者 8.05713323494
+柱子 8.06879517469
+阿糖胞苷 12.8020653633
+跨海 10.604840786
+块垒 11.5027823792
+诸子都 13.900677652
+应城市 12.5143832909
+乌贼 9.6811699468
+李鸿章 6.79982574303
+冠帽 12.2912397395
+刘子羽 10.8561552143
+江油 10.3171587135
+代表性 7.51379833261
+英特 11.0674643079
+叶肉 10.9562386728
+道德观 11.2616203224
+江河 8.31342899358
+浩气 11.9547675029
+马让迪 13.2075304714
+卫平 12.2912397395
+波特利 13.2075304714
+海神 10.3453295905
+喜字 11.5027823792
+十余件 13.2075304714
+端下去 12.5143832909
+高福利 11.3357282945
+邵远平 12.8020653633
+多万枚 12.2912397395
+冲击韧性 11.9547675029
+崇宁 10.2371160058
+白寿彝 11.3357282945
+不人道 11.9547675029
+跨河 11.598092559
+英语课堂 12.5143832909
+塑制品 11.9547675029
+宫都太监 13.900677652
+很美 10.2371160058
+周师傅 11.9547675029
+休兵 10.7226238216
+韦格纳 11.9547675029
+鲜重 13.2075304714
+江流 9.80633308975
+接在 10.3171587135
+买米 12.1089181827
+智和禅师 12.2912397395
+乌塌菜 13.900677652
+江海 8.10461990121
+叶腋 9.71102290995
+二甲酯 12.5143832909
+海碗 10.3743171274
+任英印 12.8020653633
+江浪 13.2075304714
+江浩 13.2075304714
+江浦 11.5027823792
+恐怖集团 12.8020653633
+丰都县 12.2912397395
+十余位 12.8020653633
+尉官 10.6818018271
+毫无顾虑 12.2912397395
+康定斯基 11.7034530746
+台岛 11.7034530746
+轻歌剧 12.1089181827
+卫志 11.598092559
+现汇 11.598092559
+今卓 13.2075304714
+藏书楼 10.3743171274
+记念 12.2912397395
+忍气吞声 9.91169360541
+哈米特 11.9547675029
+降低库存 13.2075304714
+法捷耶夫 11.9547675029
+擦汗 10.1630080337
+虎威 10.3453295905
+克里普 12.8020653633
+堆起 10.3453295905
+饭店 7.81390292506
+戴高冠 12.5143832909
+谋杀案 11.1926274509
+肯塔基 11.3357282945
+兵革 11.0674643079
+江洪 11.7034530746
+寄人篱下 10.4994802703
+穆西河 12.5143832909
+胡登洲 12.5143832909
+江津 10.3453295905
+发达国家 6.66650047223
+湖南路 13.900677652
+叶臣 11.3357282945
+投资选择 10.1871055853
+乞丐 8.82550383674
+裸睡 12.1089181827
+台属 13.900677652
+张大圆 13.2075304714
+伊斯梅尔 11.3357282945
+锈迹斑斑 11.1280889297
+维蒂希 11.8212361103
+导轮 12.5143832909
+自出机杼 12.8020653633
+财长 9.03314320152
+颂辞 12.2912397395
+导轨 10.0720362555
+记分卡 13.900677652
+严刑拷打 11.1280889297
+泵房 12.2912397395
+台山 9.55687223012
+陪葬坑 12.1089181827
+改性剂 13.900677652
+江淹 12.5143832909
+德拉科 13.900677652
+要求进步 12.5143832909
+军容 9.87532596124
+购销两旺 12.5143832909
+江淮 7.80485308954
+南明唐 13.900677652
+王好 12.8020653633
+两万四千 11.3357282945
+深入虎穴 12.2912397395
+赊旗镇 12.2912397395
+刹车盘 12.8020653633
+多架次 13.2075304714
+完全正确 9.91169360541
+缝法 13.900677652
+录音带 9.58318953844
+渠东侵 13.2075304714
+一读再读 13.900677652
+江涛 11.1926274509
+艾大怒 12.8020653633
+现法 13.2075304714
+上海东方 11.8212361103
+巧丽 13.2075304714
+三百余顷 13.900677652
+王忍之 13.900677652
+闲言碎语 11.1280889297
+小三峡 11.1280889297
+卷杀 11.1926274509
+清宣宗 12.8020653633
+物归原主 11.2616203224
+四五百元 12.8020653633
+内行星 11.2616203224
+裸眼 12.2912397395
+卡格薄 12.5143832909
+二甲醚 10.2371160058
+皮筏子 11.8212361103
+压缩系数 13.2075304714
+杳如黄鹤 12.8020653633
+泰来县 13.900677652
+古印谱 13.900677652
+唐飞 13.900677652
+敦化市 11.9547675029
+录音师 12.8020653633
+子女玉帛 11.7034530746
+魏相魏 13.900677652
+甘河镇 13.2075304714
+风景画 9.7898037878
+这钱 9.59661255877
+多万条 12.5143832909
+无定形 10.604840786
+唐风 11.4157710022
+白虎堂 11.0103058941
+系里 10.4349417492
+矿主 10.2897597393
+捞本 12.5143832909
+黏度 11.598092559
+河村 11.598092559
+捧腹 12.2912397395
+黄色图片 12.8020653633
+合上 9.41204128224
+王庆喝 13.900677652
+拉明 13.2075304714
+合一 8.46259834305
+拉昂 11.3357282945
+盛大宴会 12.5143832909
+故事情节 9.80633308975
+袁贵仁 12.8020653633
+灾患 13.900677652
+班务 13.900677652
+矿业 7.26210986281
+空球藻 13.2075304714
+合丰 12.8020653633
+骨科 10.0505300503
+现款 9.43476953332
+阴茎癌 11.4157710022
+紫罗兰 11.0674643079
+需谨慎 9.87532596124
+兴革 11.5027823792
+细部 10.604840786
+顺我者生 13.900677652
+绵远 11.8212361103
+班勇 10.8561552143
+谭老 13.900677652
+罕闻 11.9547675029
+寄宿生 13.900677652
+斗鹌鹑 13.900677652
+王奔 13.900677652
+数千家 11.0103058941
+军属 11.1926274509
+河朔 10.9562386728
+定期存单 11.5027823792
+逐步提高 9.20019728618
+合乎 8.63798746307
+赵李桥 12.8020653633
+哈加纳 12.8020653633
+诸葛绪分 12.2912397395
+陆诗 13.2075304714
+军山 12.2912397395
+普罗斯 11.9547675029
+卫士 8.80081122415
+洞里萨湖 11.598092559
+咪唑 10.8096351986
+缝死 13.2075304714
+进气口 10.642581114
+金质奖章 9.71102290995
+王弘祚 13.2075304714
+哈里里 13.900677652
+基脚 12.5143832909
+拉普 10.9049453784
+块儿 11.1280889297
+打夯 12.2912397395
+军屯 9.94943393339
+小三子 12.2912397395
+台子 9.93038573842
+史志 11.5027823792
+巴塞罗纳 11.8212361103
+特林堡 13.900677652
+德国国会 13.2075304714
+捉迷藏 10.5684731418
+盘锦市 12.2912397395
+义务服务 13.900677652
+看板 13.900677652
+被乘数 13.900677652
+班列 11.9547675029
+窒闷 13.2075304714
+合于 10.5684731418
+卓喜 13.2075304714
+催生 8.57766767284
+矿产 7.07521761572
+王大 10.765183436
+一亿四千五百万日元 13.2075304714
+长效机制 8.98069672615
+李盛铎 11.4157710022
+海缆 12.5143832909
+金爷 10.4994802703
+巴儿吉 12.8020653633
+仁钦 12.1089181827
+成名作 9.98865464655
+垒窝 12.1089181827
+矿井 8.59737274392
+温加礼 13.900677652
+族弟 10.6818018271
+日报 7.61841090508
+金棕榈 11.3357282945
+柳如是 7.5871296057
+读完 9.10488710638
+好几颗 12.5143832909
+乌篷船 11.1280889297
+班前 13.900677652
+英瑞 13.900677652
+洗衣匠 13.2075304714
+英吉沙 11.3357282945
+徐德言 13.900677652
+没奈何 9.31571017331
+鄂温克族 11.1926274509
+一二十两 12.8020653633
+苏麻喇 9.87532596124
+朝南边 13.900677652
+齐国人 11.2616203224
+跨步 10.7226238216
+陋见 11.9547675029
+史德 12.5143832909
+警衔 11.598092559
+拉曼 10.765183436
+秦郡 12.8020653633
+拉入 11.598092559
+自圆其说 11.1280889297
+熔体 10.8561552143
+微电脑 11.2616203224
+造粒 13.2075304714
+爆炸 7.15544130249
+乳罩 10.8561552143
+庄运口 13.2075304714
+兵部 7.57274086825
+块冰 12.1089181827
+早点儿 10.533381822
+借古喻今 12.1089181827
+合会 12.5143832909
+海约 11.598092559
+合伙 7.41757030052
+海红 12.5143832909
+特殊性 8.88339781516
+林深竹 13.900677652
+催眠疗法 12.8020653633
+刹车灯 11.3357282945
+向导 8.40350942668
+拉有 13.2075304714
+珠子参 13.900677652
+海纳 11.1926274509
+有名气 10.0088573539
+轧轧 11.4157710022
+海线 11.9547675029
+虎山 10.8096351986
+冤狱 10.1871055853
+贼首 10.2630914922
+鱼雷快艇 11.5027823792
+叶蝇 12.5143832909
+克威克 13.2075304714
+叶蝉 11.4157710022
+黑风洞 11.7034530746
+闽东地区 12.5143832909
+秘鲁共和国 13.900677652
+熔于 13.2075304714
+拉木 12.2912397395
+静闻 13.900677652
+巴赫金 13.2075304714
+羔羊 9.94943393339
+两万五千名 13.2075304714
+邀请书 12.8020653633
+凿孔机 13.900677652
+垂着 9.96885201925
+一甲子 13.2075304714
+吴佩孚 9.16447920358
+合体 9.80633308975
+星叶草 12.2912397395
+屏条 12.8020653633
+乾陵 11.1926274509
+海绵 9.16447920358
+合住 10.9049453784
+虎尾 11.8212361103
+长台关 11.8212361103
+基耶 11.9547675029
+拉杂 13.2075304714
+通许县 12.8020653633
+拉杆 10.9562386728
+蛋彩画 12.2912397395
+叶蜂 11.0103058941
+依存关系 11.8212361103
+淋病 11.4157710022
+拉杰 10.4994802703
+蝴蝶斑 11.9547675029
+垦利县 11.598092559
+虎将 9.94943393339
+快马 10.4041700905
+子无礼 13.900677652
+于开普 13.900677652
+团子 10.9049453784
+所在位置 10.8096351986
+骨碌 11.4157710022
+向安 13.2075304714
+警觉 8.99540287354
+随记 13.900677652
+拉来 10.1394775363
+陶艺家 13.900677652
+露天矿 10.6818018271
+青少年 8.12612610643
+代表权 12.1089181827
+监察权 11.5027823792
+达赖喇嘛 9.84023464143
+二叔叔 12.8020653633
+法国电影 10.8096351986
+古冰川 9.96885201925
+卵巢囊肿 11.9547675029
+裸照 11.5027823792
+呛鼻子 13.2075304714
+如鱼似水 13.2075304714
+工矿 9.23723855786
+范文虎 12.8020653633
+野生型 11.0674643079
+南明区 13.900677652
+抽筋剥皮 13.900677652
+光镜 13.900677652
+凶宅 10.8561552143
+施家礼 13.900677652
+武灵王 12.1089181827
+托克马克 11.598092559
+腰肢 10.3743171274
+宣传攻势 11.7034530746
+王玉璞 13.2075304714
+免考 13.900677652
+包围起来 9.98865464655
+华亭县 11.1280889297
+逆贼 8.90346537821
+新平镇 13.900677652
+扁圆形 10.604840786
+拉架 12.2912397395
+免耕 11.0103058941
+角加速度 11.3357282945
+嚼子 12.2912397395
+塔科特 13.900677652
+金本位制 10.2897597393
+李三娃 11.9547675029
+照纳 13.900677652
+口难开 13.900677652
+基肥 10.4041700905
+陆军航空兵 10.4349417492
+代理服务器 13.900677652
+哈哈镜 13.900677652
+比一比 11.1926274509
+咪咪 12.2912397395
+兴隆 9.46986085313
+老山界 11.8212361103
+养猪户 11.9547675029
+全国高校 11.9547675029
+怨怪 11.5027823792
+六十顷 12.5143832909
+特定条件 10.8561552143
+夹藏 13.2075304714
+免职 9.24671730182
+江段 11.9547675029
+慕容顺 13.2075304714
+分娩期 11.9547675029
+无外乎 10.765183436
+人造毛 13.2075304714
+军工 8.48457724977
+入炉 11.2616203224
+天理循环 13.2075304714
+结节性 10.8561552143
+仁阁 11.598092559
+茶鸡蛋 12.5143832909
+视角 9.11318590919
+军帐 9.41204128224
+军帖 11.9547675029
+寄过来 12.8020653633
+静雅 13.900677652
+请个 9.96885201925
+气死我了 11.598092559
+二硝基苯 12.5143832909
+快餐 9.96885201925
+英皇 11.598092559
+视觉 8.04274449749
+旧交 11.2616203224
+军师 6.94890548758
+健脾开胃 12.8020653633
+人民检察院 9.21854642485
+灌云县 12.2912397395
+侏罗系 10.5684731418
+怠情 13.2075304714
+外力作用 10.0505300503
+请下 12.1089181827
+军帽 9.49395840471
+形迹 10.3453295905
+干姜 10.4041700905
+拜城县 12.5143832909
+姚苌破 12.8020653633
+耍笔杆子 13.900677652
+垒砌 10.765183436
+买票 9.72629038208
+建议权 12.8020653633
+花蝴蝶 11.8212361103
+布朗库 12.5143832909
+哭笑不得 9.41204128224
+十二句 13.900677652
+如出一辙 9.98865464655
+录音室 13.2075304714
+陈凯 13.900677652
+秦皇岛市 10.6818018271
+泰勒柱 13.2075304714
+中亚国家 11.8212361103
+敢守 13.900677652
+钱清南 13.2075304714
+江左 10.4349417492
+跌脚捶胸 11.7034530746
+鸣鼓而攻 12.8020653633
+残羹 12.8020653633
+平板玻璃 9.7898037878
+叶落 11.5027823792
+消防队 11.598092559
+诡异 8.55357012126
+于洪武 11.1926274509
+禁受 12.8020653633
+红盘 9.21854642485
+叶萌 11.1926274509
+白山派 11.7034530746
+拉摩 12.2912397395
+五千里 12.2912397395
+自管自 13.2075304714
+风景点 10.2117981979
+济南军区 11.4157710022
+第五版 12.1089181827
+实现需求 13.900677652
+开关时间 13.900677652
+从汉法 13.2075304714
+布疋 12.5143832909
+冒风险 10.604840786
+看不懂 9.26594866375
+家具行业 10.9562386728
+扑鼻 9.61021821083
+拉撒 12.1089181827
+叶蓬 13.900677652
+有的放矢 10.604840786
+安东市 12.8020653633
+鼠穴 13.900677652
+受降典礼 13.2075304714
+四五百名 12.8020653633
+心有灵犀 11.1280889297
+请人 10.3171587135
+邵康节 12.2912397395
+资源优势 9.40086798165
+考察团 10.2897597393
+内螺纹 13.2075304714
+桑普拉斯 12.8020653633
+仲尼 11.8212361103
+柴米油盐酱醋茶 11.9547675029
+多万户 11.4157710022
+警言 13.2075304714
+江森 13.2075304714
+一百九十八 11.9547675029
+全体一致 12.8020653633
+一百九十六 12.8020653633
+罗维迦 13.900677652
+汉白玉 9.5186510173
+饰带 13.2075304714
+吁吁 12.8020653633
+请代 11.9547675029
+铁箱子 11.7034530746
+探亲访友 12.5143832909
+关龙逢 12.2912397395
+打桩机 13.900677652
+这两项 9.5062284973
+数千头 13.2075304714
+布干维尔岛 11.9547675029
+预应力 10.1164880181
+疯马 13.2075304714
+形声字 11.1280889297
+惧怯 11.0103058941
+斗争形式 11.8212361103
+造纸 7.06334483729
+人造棉 10.9049453784
+害人 9.11318590919
+惧怕 8.56313957227
+不虞之誉 13.900677652
+难以容忍 12.1089181827
+鼎鼎有名 11.7034530746
+斯托克顿 11.8212361103
+微处理器 10.2630914922
+台南县 11.2616203224
+监察机关 11.2616203224
+很穷 10.642581114
+卡普尔 12.5143832909
+柱形 10.3743171274
+第一套 10.0505300503
+台大 8.79473217808
+导言 11.1926274509
+台安县 12.8020653633
+很低 8.04560572977
+行痴和尚 13.2075304714
+罐式 13.2075304714
+柴鸡蛋 13.2075304714
+卫宁 12.2912397395
+未成形 12.5143832909
+尚非 11.1280889297
+瑕疵 9.80633308975
+歌唱 8.39128931535
+卫宏 12.8020653633
+导读 9.04086524761
+乳粉 12.5143832909
+叱骂 11.2616203224
+仍到 11.7034530746
+球体 10.0505300503
+这道 7.98447558937
+导语 10.0940151622
+虎年 9.71102290995
+不良现象 12.1089181827
+基色 11.5027823792
+警讯 11.9547675029
+蔡和森 10.642581114
+折不断 13.900677652
+维尔特 13.2075304714
+刹车片 12.8020653633
+昂然挺立 12.8020653633
+卫宫 13.900677652
+国债券 10.533381822
+阑尾炎 11.1280889297
+基金法 9.80633308975
+持续 4.94162313726
+生怖畏 12.2912397395
+所生 8.96620371885
+骨立 13.2075304714
+敲一敲 12.2912397395
+财金 10.765183436
+勿吉 10.765183436
+蚕豆象 12.8020653633
+二百帖 13.900677652
+静音 10.604840786
+黄金珠宝 11.7034530746
+积雪草 13.900677652
+残红 11.5027823792
+工用 12.1089181827
+哥老会 11.0674643079
+乳糜 11.4157710022
+调皮鬼 13.2075304714
+导论 9.66657114738
+乳糖 10.642581114
+陈祖武 10.7226238216
+球会 12.8020653633
+拉出 8.92394390956
+五千部 13.2075304714
+靡然从风 13.900677652
+刘华秋 13.900677652
+柱廊 11.0674643079
+警语 13.900677652
+软包装 12.8020653633
+模组 11.2616203224
+增减额 13.900677652
+英石 11.0103058941
+闻尤氏 13.2075304714
+静鞭 11.1926274509
+五六次 11.9547675029
+代签人 13.900677652
+中学老师 12.5143832909
+驿吏 13.2075304714
+英格兰队 12.8020653633
+高原气候 10.533381822
+中南半岛 9.28555713513
+段祺瑞 8.79473217808
+蛇口 11.2616203224
+团契 13.900677652
+赛马节 13.900677652
+虎帐 11.4157710022
+唐律疏 10.9562386728
+师学艺 11.8212361103
+大角鹿 11.4157710022
+计算成本 13.900677652
+吕城坝 13.2075304714
+果断性 13.2075304714
+静静 8.59737274392
+新邵县 13.900677652
+魏五国 12.5143832909
+谓语 11.1280889297
+中心化 12.8020653633
+兰亭集序 12.5143832909
+叶藻 12.2912397395
+向侧面 11.2616203224
+拉文 12.1089181827
+昨儿 8.66423568915
+这部 7.5515386606
+振笔疾书 13.900677652
+宽严 12.8020653633
+毛细管 10.4041700905
+看不惯 9.94943393339
+张美人 13.2075304714
+时装业 12.2912397395
+普朗特 11.1926274509
+军徽 11.7034530746
+头球 11.1280889297
+史峤 9.32596667347
+三百三十年 13.2075304714
+冠子 11.1926274509
+灯笼裤 12.2912397395
+跨栏 10.642581114
+谓词 10.8096351986
+振起 13.2075304714
+本港 9.91169360541
+班儿 11.8212361103
+文版 13.2075304714
+友好条约 10.7226238216
+不顾大局 12.8020653633
+琴瑟 11.2616203224
+良导体 12.1089181827
+小组讨论 12.2912397395
+歔欷 13.900677652
+买碟 13.900677652
+海南岛 8.27305653829
+军心 8.40761620864
+王定六 10.765183436
+海米 12.8020653633
+张大千 11.598092559
+加里宁格勒州 12.2912397395
+闭上眼 10.4666904475
+曹洞禅 13.2075304714
+乳类 11.3357282945
+卢崩和 13.2075304714
+中国图书馆学会 12.2912397395
+撒尿 9.61021821083
+灰质炎 13.900677652
+线香 10.8561552143
+向外 7.99804431857
+团委 10.1871055853
+传媒大学 12.1089181827
+川汉铁路 11.1926274509
+逆转 7.91674137129
+日程安排 11.2616203224
+捧起 9.74179456862
+内吸性 13.2075304714
+承载量 12.8020653633
+曾绥抚 13.2075304714
+尼泊尔政府 12.5143832909
+静风 12.2912397395
+平准法 12.1089181827
+蛇岛 10.7226238216
+现期 11.9547675029
+薛安 13.900677652
+班底 11.1926274509
+骨痨 13.900677652
+上帝教 12.2912397395
+飘过去 12.8020653633
+招进 12.2912397395
+笼中鸟 13.2075304714
+痛饮 9.82314020807
+所付 11.3357282945
+主部 12.2912397395
+台城 11.8212361103
+待产室 13.900677652
+拉纳克 12.5143832909
+虎克 11.8212361103
+苏秦皆 12.8020653633
+档案馆 9.85762638414
+所以 4.23202674934
+台基 9.87532596124
+震灾 12.8020653633
+全能型 12.2912397395
+海王 8.37522471284
+五六平方米 13.900677652
+江景 11.9547675029
+陈瓒 12.5143832909
+戈萨 13.900677652
+汪昭义 12.2912397395
+晕针 11.7034530746
+针锋相对 9.5186510173
+于长安 10.0294766411
+孝宗 10.6818018271
+基质 9.29550746599
+凌景埏 13.2075304714
+别傻了 12.8020653633
+海珠 11.8212361103
+第五类 12.8020653633
+成员数 13.900677652
+不过尔尔 12.2912397395
+五十六文 13.2075304714
+所云 10.9562386728
+英磅 12.2912397395
+麻木感 12.5143832909
+化纤 7.96578345636
+蝴蝶梦 11.8212361103
+孰与 12.8020653633
+有财有势 11.9547675029
+工稳 11.0674643079
+吕梁山区 13.2075304714
+闭合式 12.8020653633
+孝家 13.900677652
+才气过人 12.5143832909
+施药亭 13.900677652
+工程 5.70313891225
+泪中 13.900677652
+库门 12.8020653633
+三更半夜 11.1926274509
+窟穴 13.2075304714
+精神领袖 11.4157710022
+氢化钾 13.2075304714
+图儿 13.2075304714
+卫哲 13.2075304714
+班廷 12.1089181827
+风景线 10.2897597393
+全部一次 11.9547675029
+矢志不渝 12.2912397395
+杭锦旗 11.2616203224
+斯兰 12.1089181827
+郭崇礼 13.2075304714
+研究课题 9.40086798165
+叱问 13.2075304714
+新疆建设兵团 11.598092559
+朝三暮四 11.7034530746
+残照 12.5143832909
+孝子 9.24671730182
+免责 10.3453295905
+麦其领 12.8020653633
+汉言弘 13.2075304714
+两千三千 13.2075304714
+并用 7.76079309975
+班师 9.54396882529
+小黑麦 12.2912397395
+正人 11.4157710022
+卫君 12.8020653633
+浓绿 10.8096351986
+擦枪 11.8212361103
+宏伟蓝图 11.5027823792
+免费 7.17204903889
+百二八十 12.5143832909
+黏到 13.900677652
+窟窿 8.32472854883
+逆耳 13.2075304714
+跨期 11.0103058941
+不前不后 13.2075304714
+而要 8.58747167293
+蛇尾 11.3357282945
+海得拉巴 11.3357282945
+马二拴 11.1280889297
+沈阳军区 11.1280889297
+乳猪 12.5143832909
+跨月 12.8020653633
+程序调试 13.900677652
+广州市区 12.1089181827
+斯世少 13.900677652
+阅月 13.2075304714
+团团 8.58747167293
+戈蓝 11.7034530746
+海獭 10.9562386728
+琴筒 11.7034530746
+罐儿 11.2616203224
+西瓜皮 11.3357282945
+密尔沃基 12.1089181827
+甬道 9.37888907493
+变幻无穷 11.7034530746
+呵痒 13.900677652
+平关陇 12.8020653633
+照玩 13.2075304714
+台地 8.0484751722
+钱振鹏 11.9547675029
+嘴甜心苦 13.2075304714
+蝴蝶树 12.2912397395
+河段 8.42421410004
+龙井茶 9.33632946051
+谈不完 13.2075304714
+君主立宪 9.41204128224
+仿宋体 13.900677652
+小亨特 12.2912397395
+奋武扬威 13.900677652
+国家林业局 10.6818018271
+所为 8.89673134603
+二十一时 13.2075304714
+临潼斗宝 13.900677652
+张建新 12.8020653633
+中途辍学 12.5143832909
+服从安排 13.900677652
+渗坑 12.8020653633
+乌蛮 11.4157710022
+袁仁明 13.900677652
+资治通鉴 9.19114745066
+江村 11.598092559
+基础教育 10.4349417492
+犯忌 11.4157710022
+终年 8.00352378434
+呼达雅 13.2075304714
+史前 9.15574552361
+颓垣断壁 13.900677652
+团场 11.2616203224
+团圆 9.20019728618
+徐福温泉 12.5143832909
+饶丝竹 12.8020653633
+乳状 12.1089181827
+何绍基 12.8020653633
+照片 7.24781462262
+眼不见 10.9049453784
+希伯来人 11.3357282945
+谷仓 10.1630080337
+芙蓉楼 13.900677652
+思考者 13.2075304714
+肚兜儿 13.2075304714
+饲养者 12.8020653633
+教条主义 10.0720362555
+山子野 13.2075304714
+安安全全 13.900677652
+唐鉴 13.2075304714
+海狮 10.5684731418
+纺锤体 11.3357282945
+英秀 13.900677652
+王祝翔 13.900677652
+埃波罗 13.2075304714
+人造板 10.3453295905
+江月 13.2075304714
+张贵入 12.8020653633
+海狼 10.2371160058
+所依 12.2912397395
+李云监 13.2075304714
+汉言延 12.5143832909
+许隽 11.4157710022
+起米 12.2912397395
+抱有幻想 12.1089181827
+而行 7.90921310487
+道路交通 8.96620371885
+混合气体 10.4994802703
+基调 7.61096208107
+海狗 11.598092559
+文工团 8.52078029844
+走来走去 8.58747167293
+团块 10.8096351986
+利林费 12.8020653633
+工笔 10.1630080337
+琴童 12.2912397395
+第一百六十四 13.900677652
+惋惜 8.75901409547
+掌旗官 11.7034530746
+国务部长 11.2616203224
+很甜 12.1089181827
+旋覆花 12.8020653633
+军军 11.4157710022
+买盘 8.17709255002
+筹谋 10.9049453784
+残灯 11.8212361103
+文物古迹 9.31571017331
+和勋臣 12.5143832909
+联席会议 8.99540287354
+国议会 12.8020653633
+昆虫学家 12.5143832909
+军内 10.642581114
+悼亡 11.4157710022
+清掉 13.900677652
+范阳起 12.2912397395
+所作 7.62403416263
+物理变化 11.2616203224
+烈日炎炎 11.8212361103
+结构紧凑 10.2630914922
+哈马丹 11.9547675029
+塔院 11.3357282945
+扑通 8.87023973058
+免谈 11.9547675029
+振荡 7.74158226348
+龚滩 12.2912397395
+古斯特 12.8020653633
+南明弘 11.4157710022
+翠鸟 11.1280889297
+张明弼 9.61021821083
+乳牛 11.1280889297
+仇锷 13.2075304714
+拉毛 12.2912397395
+令人齿冷 13.900677652
+穆斯林联盟 11.0103058941
+垒石 12.2912397395
+谷中 9.32596667347
+读图 13.2075304714
+让子棋 13.2075304714
+于岳州 12.8020653633
+朱荣之 12.8020653633
+泪珠 8.88339781516
+亲潮 12.5143832909
+海特 10.533381822
+所传 9.7898037878
+所伤 10.642581114
+现场会 10.9049453784
+团城 10.9049453784
+班彪 11.0103058941
+奥陶系 10.0940151622
+屠宰业 13.900677652
+五六十 10.2117981979
+海牛 10.7226238216
+谷丙 12.2912397395
+名刺 11.7034530746
+虎卫 13.2075304714
+军列 11.598092559
+虫蛭 12.5143832909
+鲜食 9.85762638414
+造物 11.4157710022
+晨祷 13.900677652
+程门立雪 13.900677652
+五公祠 11.9547675029
+无稽之谈 10.2897597393
+腾格里山 12.1089181827
+史克 11.8212361103
+拉根 12.1089181827
+获学士 13.900677652
+拉格 10.7226238216
+海熊 13.900677652
+蛇座 11.598092559
+张建松 13.900677652
+藕合 13.2075304714
+举鼎 13.2075304714
+垒球 11.5027823792
+史公 9.55687223012
+杂声 13.900677652
+盘丝岭 13.2075304714
+令人深思 11.7034530746
+休假 9.58318953844
+史儒 13.2075304714
+接吻时 13.900677652
+苜蓿草 13.900677652
+李府中 12.8020653633
+乳燕 12.8020653633
+琴科 12.5143832909
+孝妇 12.1089181827
+造爱 13.2075304714
+裸线 12.5143832909
+遵循原则 13.900677652
+跨日 11.7034530746
+鹿柏 12.8020653633
+哪有什么 9.85762638414
+电饭煲 11.2616203224
+诠释 8.97342396682
+主试者 13.900677652
+浓缩 8.73019365694
+很直 12.5143832909
+弧焊 12.5143832909
+海燕 10.8096351986
+李启胜 13.900677652
+团员 10.2897597393
+卫国 9.61021821083
+参展者 12.1089181827
+猿啼鹤唳 13.900677652
+两千公里 13.900677652
+于朝臣 12.2912397395
+后顾之忧 9.11318590919
+军力 10.0940151622
+来福枪 12.8020653633
+摩苏尔 11.0103058941
+军功 9.89334446674
+邓禹位 13.2075304714
+所犯 10.1871055853
+张大帅 12.8020653633
+台商 9.46986085313
+新台阶 9.98865464655
+而设 9.75754292558
+五七遍 13.2075304714
+拉梅 11.598092559
+革除 9.66657114738
+作恶者 13.2075304714
+刘尚志 13.900677652
+椰肉 13.2075304714
+河槽 9.96885201925
+膈俞 13.2075304714
+三十余米 13.2075304714
+长夜难明 13.900677652
+故弄玄虚 10.533381822
+军务 8.38724890581
+庄帝元 12.8020653633
+反控制 12.5143832909
+尊敬老师 13.2075304714
+梭鱼 12.8020653633
+通栏广告 13.2075304714
+很瘦 11.2616203224
+细心人 11.1280889297
+环球时报 10.3453295905
+素志 11.4157710022
+挪窝儿 12.8020653633
+译成 8.63798746307
+爱非斯 13.2075304714
+环氧氯丙烷 13.2075304714
+那吉 12.8020653633
+共青城 11.8212361103
+基达 13.2075304714
+南明山 12.5143832909
+台唇 13.900677652
+魁星阁 11.598092559
+史册 9.85762638414
+郑法士 13.2075304714
+回执单 13.900677652
+唐金 12.8020653633
+现时 9.14708746087
+赵亦华 13.900677652
+经世之才 12.2912397395
+基辅 9.20932976975
+族兄 11.8212361103
+鼎力相助 11.4157710022
+金口难开 13.2075304714
+斗技场 13.900677652
+第五组 12.8020653633
+沽名 11.598092559
+颜面何存 13.900677652
+彷佛 11.4157710022
+学以致用 11.3357282945
+线长 12.5143832909
+骨相 11.9547675029
+旺火 11.598092559
+沓至 13.900677652
+阿库 12.8020653633
+振臂 11.9547675029
+生化危机 12.8020653633
+情投意合 11.5027823792
+讲究文明 13.900677652
+华扁穗 12.5143832909
+美食天地 13.900677652
+支努干 11.3357282945
+拍上 12.8020653633
+至大无外 13.900677652
+面向全国 10.765183436
+和蒂森 13.2075304714
+令人信服 9.84023464143
+加蓬共和国 12.2912397395
+骨盘 13.2075304714
+坩埚 10.2630914922
+陈瑜 13.900677652
+而言 5.94035402283
+军医 9.62401153296
+英特尔 9.45802639549
+丰邑坪 13.900677652
+有旗昌 12.1089181827
+分隔线 13.900677652
+碱木质素 13.900677652
+孔明书 13.2075304714
+乌蓝 12.5143832909
+骨盆 10.0088573539
+读后 11.5027823792
+河桥 10.9049453784
+丰川悦司 13.2075304714
+斯塔拉 13.900677652
+死亡数 11.8212361103
+针对性 7.84389363875
+看走眼 11.3357282945
+卫城 10.6818018271
+解度 13.2075304714
+鲜香 11.8212361103
+虎刺 13.2075304714
+骂不绝口 10.642581114
+台南市 10.642581114
+脆点 13.900677652
+王掌柜 13.2075304714
+沙特阿拉伯王国 11.9547675029
+羊马河 12.2912397395
+重活儿 13.900677652
+斋食 11.9547675029
+穴头 13.900677652
+秦之机 12.8020653633
+不期修古 13.900677652
+很矮 11.8212361103
+首发式 13.2075304714
+白旄黄钺 12.5143832909
+慕容雪 13.900677652
+昏天黑地 10.8096351986
+乌蒙 10.9562386728
+太康时 13.2075304714
+活化石 9.75754292558
+歪点子 12.1089181827
+线闸 13.900677652
+莫瓦格 11.3357282945
+线间 11.9547675029
+下影线 10.1630080337
+于开平 12.2912397395
+科威特政府 12.8020653633
+瞧见 8.9102450652
+重大事件 9.27570483869
+卡普兰 13.2075304714
+贝克汉姆 11.0674643079
+广告效应 12.8020653633
+偿还债务 9.74179456862
+对抗性矛盾 13.2075304714
+谭进 13.900677652
+标准配备 12.2912397395
+工种 10.4666904475
+唐邓 12.8020653633
+奥陶纪 9.75754292558
+言若何 12.2912397395
+开阔视野 11.3357282945
+马札儿 11.598092559
+宝钗亦 12.5143832909
+侯景之 10.642581114
+夹着烟 12.2912397395
+仍应 10.1630080337
+戈拉尔 13.900677652
+骨癌 13.900677652
+青年时代 9.16447920358
+骑缝印 13.900677652
+工科 9.85762638414
+惜惜 12.2912397395
+腊尽春回 12.8020653633
+恺撒大帝 13.900677652
+碧云天 12.8020653633
+斯蒙德 12.8020653633
+陈再良 11.3357282945
+氮化钛 12.8020653633
+中国外交学院 13.900677652
+唐都 12.1089181827
+外延公理 13.2075304714
+任人摆布 11.9547675029
+另述 13.2075304714
+无水氯化铝 12.5143832909
+擦擦 9.54396882529
+孝堂 11.5027823792
+江文 12.1089181827
+虎劲 13.900677652
+台吉 10.604840786
+台后 11.0674643079
+回台 13.900677652
+骨瘤 12.1089181827
+最上层 10.9049453784
+军史 12.2912397395
+共青团 9.74179456862
+军号 10.4666904475
+变招 12.5143832909
+维尔纳 10.9562386728
+二十七个 11.9547675029
+斯多夫 11.2616203224
+封李渊 13.2075304714
+练鹤 13.900677652
+奋起拼搏 13.2075304714
+蛇形 10.4041700905
+数千名 9.96885201925
+鞭子一样 11.8212361103
+吃长斋 13.2075304714
+暴力犯罪 12.2912397395
+泛泛之人 13.2075304714
+郭绍虞 11.9547675029
+米珠薪桂 12.5143832909
+笑脸相迎 11.0674643079
+无翼鸟 13.900677652
+德涅斯特河 11.5027823792
+堆过 13.900677652
+爱惜人才 13.900677652
+史坚 13.2075304714
+史坛 11.9547675029
+虎啸 10.642581114
+阿喀琉斯 13.2075304714
+鲜黄 12.2912397395
+基西 12.8020653633
+孝心 9.6811699468
+甬钟 12.5143832909
+田税银 12.5143832909
+絮状物 12.5143832909
+跨接 13.2075304714
+中兴通讯 8.74162235276
+子弘范 13.2075304714
+进出口商 11.0103058941
+黄灿灿 11.7034530746
+斯塔斯 12.1089181827
+滨海新区 9.41204128224
+重重围困 12.1089181827
+默祷 11.1926274509
+实在话 10.0088573539
+蝴蝶泉 11.2616203224
+全不 9.56994431169
+人大附中 13.2075304714
+周泰领 13.2075304714
+丹江口市 11.4157710022
+嶙峋 10.3743171274
+京津地区 11.3357282945
+再三再四 11.3357282945
+安第斯山 9.80633308975
+北宁铁路 13.900677652
+易门 13.2075304714
+而起 8.51618258919
+读卡 13.900677652
+出栏 10.4349417492
+台历 11.598092559
+仇隙 11.3357282945
+电子表格 13.900677652
+细颈 12.2912397395
+茅草屋 12.8020653633
+写实性 12.8020653633
+全书 7.67414098269
+残疾 9.23723855786
+参与者 8.22392384971
+一无所闻 13.900677652
+史地 9.96885201925
+读卖 13.900677652
+拉湾 13.2075304714
+江户 9.54396882529
+维滕贝格 13.2075304714
+殊死 10.3453295905
+多万棵 13.900677652
+嘀嘀咕咕 11.0674643079
+块头 11.598092559
+全乎 13.900677652
+急匆匆 8.81308131674
+很热 11.1926274509
+很烦 11.0674643079
+外治法 11.1280889297
+全人 13.2075304714
+王诸樊 12.8020653633
+台南 9.69598503258
+秣马 13.900677652
+乌药 11.598092559
+数千卷 13.900677652
+法理学 11.1926274509
+反气旋 10.642581114
+南斯拉夫共产主义者联盟 12.2912397395
+庞然 12.8020653633
+不敢恭维 11.8212361103
+左一掌 13.900677652
+切莫 9.43476953332
+罗伯斯比尔 10.533381822
+石人沟 12.8020653633
+工细 10.765183436
+多万株 12.5143832909
+尼雅 10.8096351986
+安定团结 11.4157710022
+郑穆公 12.5143832909
+擦掉 11.3357282945
+残留 8.17709255002
+垂线 11.1280889297
+向前 6.54184675363
+强调指出 10.604840786
+唐音 11.1926274509
+数千匹 12.2912397395
+祸兮福所倚 12.5143832909
+台北 8.34771806705
+唐韵 11.1280889297
+东海大学 12.2912397395
+露一下 12.5143832909
+叶护可汗 12.5143832909
+金银牌 11.8212361103
+全价 11.1280889297
+军品 11.0103058941
+历史学者 12.1089181827
+唐韦 13.900677652
+舍下 10.3743171274
+七十二面 12.8020653633
+一无所长 12.2912397395
+英籍 10.8561552143
+撤出去 11.5027823792
+李小二 10.765183436
+积压品 13.2075304714
+软弱涣散 13.2075304714
+四五百年 13.2075304714
+特化 9.59661255877
+读取 9.87532596124
+著作权人 12.2912397395
+勿忘 11.0103058941
+台区 12.1089181827
+估计值 10.9562386728
+蒋介 12.5143832909
+戴高帽 11.3357282945
+南来 9.32596667347
+阴狠 11.9547675029
+读友 13.900677652
+选举资格 12.1089181827
+抆泪 13.900677652
+残生 10.765183436
+年增长率 10.0720362555
+坐收渔利 11.8212361103
+泪眼 9.41204128224
+正巧在 13.900677652
+向右 7.61467955747
+读到 9.49395840471
+很熟 10.1394775363
+黑头发 11.0103058941
+羊八井 10.765183436
+沈云 12.2912397395
+照登 12.5143832909
+河湖 9.29550746599
+叶轮 10.8096351986
+犯错误 9.98865464655
+果决 10.0940151622
+撞进 11.3357282945
+相生相 13.2075304714
+卫冕 11.1926274509
+球粒 11.598092559
+王进逵 13.2075304714
+全传 11.8212361103
+祖丞相 12.2912397395
+孝廉 10.0294766411
+张大妈 12.8020653633
+全会 9.40086798165
+王一品 12.8020653633
+全优 12.5143832909
+南方话 13.2075304714
+泵油 13.900677652
+河湾 9.69598503258
+乌苏 10.4666904475
+云锦 10.8561552143
+天宝时 11.3357282945
+现房 10.1871055853
+王之道 12.2912397395
+息县 11.2616203224
+预测性 13.2075304714
+射影直线 13.900677652
+徐大椿 13.2075304714
+相册 10.8096351986
+刘伯承 8.66956903512
+军售 11.598092559
+悉昙 13.900677652
+贾法里 13.2075304714
+周星驰 11.1926274509
+唐陵 12.5143832909
+包玉刚 12.5143832909
+台办 12.2912397395
+文征 13.900677652
+卫凌 13.900677652
+殖民 7.94484028251
+造田 10.9049453784
+海直 11.4157710022
+郭祥身 13.900677652
+骨炭 12.8020653633
+芙蓉洞 13.2075304714
+历山德 13.2075304714
+河清 11.8212361103
+海相 9.6811699468
+毫无逊色 13.900677652
+海盆 9.4233408375
+全体 7.09384829158
+兵饷 10.642581114
+一百多元 12.1089181827
+鱼藤 12.1089181827
+承筋 13.900677652
+海盗 8.44109213783
+语言性 13.900677652
+骨炎 11.8212361103
+唐附 12.5143832909
+冠冕 10.6818018271
+冠军 7.63537643924
+河渠 9.61021821083
+海盛 9.53122979951
+转捩点 12.8020653633
+花鸟虫鱼 12.5143832909
+孝幔 13.2075304714
+沈丘 11.0103058941
+东辽 12.5143832909
+武王灭 10.9562386728
+黏在 11.7034530746
+擦抹 11.7034530746
+骨灰 9.5186510173
+冷恐子 13.900677652
+照相 8.62767809341
+明显提高 9.32596667347
+承受不住 10.2897597393
+王宠 12.8020653633
+浑身发抖 10.2630914922
+泰丽 11.8212361103
+台前 9.37888907493
+平安南道 13.2075304714
+蛇头 10.765183436
+锂离子 9.98865464655
+不义之财 10.604840786
+向南 7.99804431857
+省直机关 11.3357282945
+王室 8.10766404359
+黏土 11.1926274509
+民粹 12.5143832909
+河滩 8.85082164473
+河滨 12.2912397395
+阅批 13.900677652
+旺盛 7.45337178943
+花色繁多 13.900677652
+玉花骢 10.604840786
+持球 10.9562386728
+二分之一 10.0088573539
+宾阳洞 12.5143832909
+河源 8.79473217808
+拼死拼活 11.8212361103
+奈尔 12.2912397395
+巴比妥钠 13.900677652
+实验 6.32560595247
+班子 8.25523075433
+乳癌 10.9562386728
+四十二笔 13.2075304714
+斯尼克 12.8020653633
+海登 13.2075304714
+擦拭 9.22784881751
+图片网 13.900677652
+决一雌雄 11.9547675029
+台制 13.900677652
+乳白 10.604840786
+向化 12.1089181827
+走风 12.1089181827
+宴请 9.36807815882
+华亭寺 13.2075304714
+妾侍 13.2075304714
+林苑内 13.2075304714
+主销 12.5143832909
+卫兵 9.82314020807
+城隍阁 12.8020653633
+建材超市 13.900677652
+第五种 11.9547675029
+一百四十六座 13.2075304714
+弗拉曼克 12.5143832909
+杨贤江 13.2075304714
+陈仓 10.7226238216
+纹枯病 13.900677652
+董鄂氏 11.1280889297
+周培源 12.1089181827
+静默 8.82550383674
+多吃多占 12.8020653633
+唐锦 12.5143832909
+三寸之舌 13.900677652
+拉氏 12.5143832909
+迎上去 9.4233408375
+绵薄 11.8212361103
+河流 6.35581658332
+地中海地区 10.0294766411
+京调 13.900677652
+海疆 10.4041700905
+第十一位 12.1089181827
+绝佳 9.63799777493
+王善保 11.4157710022
+己方 9.37888907493
+悉数 8.73019365694
+求神问卜 12.5143832909
+合缝 12.2912397395
+河海 10.642581114
+怒气冲天 11.1280889297
+优美环境 13.900677652
+除涝 11.2616203224
+傲霜斗雪 12.5143832909
+习惯化 12.8020653633
+一层楼 10.765183436
+核溶解 13.900677652
+屏气 10.4666904475
+辽河流域 10.4994802703
+感到疲倦 12.2912397395
+踢足球 11.3357282945
+河洛 9.7898037878
+奥尔塔 13.2075304714
+催化反应器 13.2075304714
+不但如此 11.4157710022
+反照率 12.1089181827
+戴于右 13.2075304714
+荷兰话 13.900677652
+合编 9.45802639549
+鲜鲜 12.2912397395
+陈云 10.2371160058
+领袖人物 10.1394775363
+楼阁亭台 13.900677652
+早会 13.2075304714
+两年生 12.5143832909
+迷迷糊糊 9.25628675283
+陈二 10.9049453784
+第五盘 13.900677652
+宋春舫 13.900677652
+卫至嘉靖 13.2075304714
+照用 13.2075304714
+一万多平方公里 13.2075304714
+操作手册 13.2075304714
+卫勤 11.7034530746
+福利主义 12.2912397395
+河洲 13.900677652
+玻利维亚 9.35738286971
+收汇 12.2912397395
+奈德 13.2075304714
+能言善道 13.2075304714
+免试 11.4157710022
+兵马 7.68207753228
+绝伦 10.1871055853
+陈亮 9.53122979951
+唐镇 12.8020653633
+刁滑 11.9547675029
+体文风 12.5143832909
+超越自我 12.2912397395
+军器 8.92394390956
+高闯王 9.77354326693
+河津 11.0103058941
+绝俗 11.9547675029
+王守 13.900677652
+乙丑 11.9547675029
+拉沟 13.2075304714
+功利化 13.2075304714
+索摩查 11.7034530746
+捧读 11.9547675029
+何永盛 12.8020653633
+担挑 12.5143832909
+陈之 11.9547675029
+不满者 12.8020653633
+基诺 10.7226238216
+海田 13.2075304714
+低俗小说 13.2075304714
+红格尔 12.8020653633
+拉沃 12.8020653633
+蒋二 13.2075304714
+过早搏动 12.5143832909
+戴帽子 10.8561552143
+俄罗斯国家图书馆 13.2075304714
+读写 10.4666904475
+生灌丛 11.1926274509
+呜禽 13.900677652
+发球员 12.5143832909
+多潘立酮 13.900677652
+表面淬火 12.2912397395
+海生 9.4233408375
+数千元 11.4157710022
+精神支柱 10.9562386728
+扶手箱 13.2075304714
+变扁 13.900677652
+再保险 10.4994802703
+陈东 9.35738286971
+深深感动 11.1926274509
+读出 9.75754292558
+闻一多 10.533381822
+陈世 12.8020653633
+密切 6.61791647237
+陈三 9.49395840471
+骑车到 13.2075304714
+陈七 12.2912397395
+连站 10.9049453784
+早日康复 11.9547675029
+导航 7.89186446653
+左下方 12.2912397395
+这首 8.73589167805
+而过 8.89004235788
+寂寂 10.642581114
+陈丹 11.3357282945
+换向阀 13.900677652
+陈丽 11.3357282945
+凡家录 12.8020653633
+主队 11.5027823792
+岳凯平 11.4157710022
+军国 9.74179456862
+见得多了 10.5684731418
+军团 8.15447446144
+粤东 9.93038573842
+相平衡 10.5684731418
+终身教育 11.8212361103
+陈中 10.0720362555
+尼柯夫 12.5143832909
+王宜 12.8020653633
+主音 11.1926274509
+七样 13.900677652
+铁矿石 7.21356904411
+声色俱厉 10.2117981979
+吃一堑 11.9547675029
+叶赫 11.8212361103
+原分生 12.1089181827
+黄豆粒 13.2075304714
+要死不活 13.2075304714
+快递 10.0294766411
+路易斯安 13.900677652
+产权酒店 13.2075304714
+黄豆粉 13.2075304714
+语言所 11.2616203224
+领过来 13.2075304714
+团儿 12.2912397395
+快速 5.7568696752
+四十七万 12.5143832909
+英美 8.66423568915
+军地 10.9049453784
+五小时 13.900677652
+这项 7.18408287845
+镇压器 13.2075304714
+戈茨 12.1089181827
+历山川 12.5143832909
+不求甚解 11.4157710022
+高电位 12.8020653633
+由父祖 13.900677652
+喜忧参半 10.3743171274
+天真活泼 12.2912397395
+红乎乎 13.2075304714
+绝世 10.9562386728
+颤悠悠 11.3357282945
+公权力 10.2371160058
+青草地 11.8212361103
+逸闻 12.5143832909
+蒙地卡罗 13.900677652
+自营商 12.1089181827
+逆流萃取 13.900677652
+硬骨鱼类 11.7034530746
+绝不 7.17804785712
+陈侃 11.9547675029
+观之 9.87532596124
+冠县 12.8020653633
+卫河之 13.2075304714
+发传真 13.2075304714
+信报箱 13.2075304714
+探花 10.642581114
+竹篓子 13.2075304714
+大柱 11.5027823792
+祭日 12.2912397395
+煤变油 13.900677652
+司务长 10.9049453784
+乾隆帝 9.72629038208
+孔明亲 13.2075304714
+河水 7.47257237929
+照理 10.8096351986
+尼巴莱 13.900677652
+鞭策 10.765183436
+陈侯 12.1089181827
+向左看 13.900677652
+八场 13.2075304714
+须疮 13.900677652
+社会活动 9.27570483869
+赫卢太 12.5143832909
+元末明 10.2117981979
+唐钺 12.5143832909
+金旗 12.8020653633
+主面 13.900677652
+自奉甚俭 13.2075304714
+半瓶子晃荡 13.900677652
+草苁蓉 13.2075304714
+巴什基尔 11.0674643079
+海琼 13.900677652
+艾提卡 12.1089181827
+诈语 13.900677652
+说文解字 9.91169360541
+吹喇叭 12.8020653633
+陈佳 13.900677652
+班夫 12.5143832909
+伊斯顿 12.2912397395
+班头 10.2117981979
+尼亚加拉 10.533381822
+高产出 12.1089181827
+军垦 12.1089181827
+绝代 11.2616203224
+向光 12.8020653633
+不名一文 12.8020653633
+荣智健 11.8212361103
+沙里夫 13.900677652
+河泥 12.5143832909
+费马恩 12.2912397395
+差多 11.7034530746
+河沙 11.9547675029
+各为其主 10.9562386728
+河沟 10.4041700905
+陈伟 11.4157710022
+朱莲芬 13.900677652
+陈伐 12.5143832909
+耍心眼儿 13.900677652
+卫华 11.0103058941
+玉立之 13.2075304714
+脸红红 11.1280889297
+隔海相望 10.604840786
+议会党团 10.4041700905
+光致发光 13.2075304714
+贸易规模 11.1280889297
+外族人 11.9547675029
+品种繁多 9.6811699468
+举高 12.1089181827
+动脉血 10.3743171274
+认不清 11.9547675029
+练马 13.2075304714
+泪痕 9.11318590919
+买点 9.20019728618
+恰克图 10.8096351986
+驿卒 10.4994802703
+绝人 11.9547675029
+绝交 10.604840786
+邀买 12.5143832909
+负薪救火 13.900677652
+主震 12.2912397395
+陈伯 11.8212361103
+数千倍 13.2075304714
+怪怪 12.1089181827
+海瑞 9.62401153296
+息兵 11.8212361103
+唐铉 10.2897597393
+伯利恒 11.1926274509
+五十六年 10.6818018271
+直连 13.900677652
+卵巢功能 10.765183436
+转化酶 13.2075304714
+由洛州 13.2075304714
+鹤壁市 10.4994802703
+南依骊 12.8020653633
+萨莫耶 12.2912397395
+文法 10.2630914922
+直运 13.900677652
+三十度 13.2075304714
+沈王 13.2075304714
+沈玉 13.2075304714
+疼痛不堪 13.2075304714
+机车厂 11.8212361103
+拉刀 11.9547675029
+认不出 9.71102290995
+陆学善 12.8020653633
+失职 9.22784881751
+沈玄 12.8020653633
+科斯雷 12.8020653633
+直追 10.642581114
+江幸 13.2075304714
+牢头狱霸 12.8020653633
+于大鹏 13.900677652
+江平 13.2075304714
+江干 12.5143832909
+中国民俗 12.2912397395
+拉制 12.1089181827
+卫河 10.2371160058
+军校 8.9308643524
+韦瓦克 13.2075304714
+沈环 11.5027823792
+胡维新 12.8020653633
+婚丧喜庆 13.2075304714
+假面舞 12.8020653633
+河卡 13.2075304714
+失聪 11.1280889297
+跨径 11.4157710022
+省农办 13.2075304714
+直辖 8.59240995457
+拿班作势 12.8020653633
+挖起 12.1089181827
+河北 6.34424968254
+斯塔姆 12.5143832909
+任课教师 12.8020653633
+全部一包 13.2075304714
+田菁 12.2912397395
+江帆 12.2912397395
+虻虫 13.2075304714
+台澎 12.5143832909
+王孙 10.4666904475
+直达 8.11071748108
+河区 11.8212361103
+顾顺章 12.8020653633
+沽源 11.4157710022
+陈炽 13.2075304714
+陈炳 12.2912397395
+现役 8.1608847398
+尼维斯 11.1280889297
+狄圣 13.2075304714
+现形 10.8561552143
+尉梨 13.2075304714
+炎帝陵 12.1089181827
+歇下 10.0720362555
+哥们儿 9.85762638414
+时装秀 13.900677652
+基金安 11.0674643079
+能汇纳 12.5143832909
+末代皇帝 10.3743171274
+全片 11.598092559
+十余米 10.9562386728
+拉力 9.55687223012
+外壕 12.5143832909
+郎侯多 12.5143832909
+镖师 13.2075304714
+卫氏 11.9547675029
+焦心劳思 13.900677652
+惟恐 8.73019365694
+特列斯 12.8020653633
+卫民 11.3357282945
+多万名 11.5027823792
+藠头 12.5143832909
+卫气 11.1926274509
+攒三聚五 13.900677652
+四五百户 13.2075304714
+上海复旦大学 11.8212361103
+斯塔夫 9.56994431169
+内蒙古高原 9.21854642485
+夏风能 12.5143832909
+申银万国 7.69208762588
+班昭 11.598092559
+晒烟 11.1280889297
+直轰 13.900677652
+稿子 8.75901409547
+多万吨 9.46986085313
+拉动 6.64720726929
+直转 12.1089181827
+婚前婚后 12.8020653633
+一百遍 12.8020653633
+刘备新 13.2075304714
+河口 7.30626419223
+拉加 10.9562386728
+少奶奶 10.4666904475
+懦怯 12.5143832909
+绯红色 12.8020653633
+浑水摸鱼 11.0674643079
+己子 10.8561552143
+仍旧 6.84450236788
+一万五千家 13.2075304714
+君子之交淡如水 13.900677652
+干娘 11.0103058941
+江底 11.5027823792
+鼓起来 10.9562386728
+耶路 12.8020653633
+欢欣若狂 13.900677652
+阴阳官 13.900677652
+秋葵 12.5143832909
+军棋 12.1089181827
+田草 13.2075304714
+于洪州 13.2075304714
+官勋戚 13.2075304714
+尹赏 12.2912397395
+韶华易 13.900677652
+拉勾 12.8020653633
+虎气 11.9547675029
+作家出版社 11.9547675029
+田荣 11.8212361103
+画堂 12.5143832909
+营门口 12.2912397395
+代表制 11.2616203224
+泵入 13.2075304714
+反馈系统 12.2912397395
+军交运输 12.2912397395
+支持力 12.8020653633
+于灵州 12.5143832909
+照价 13.900677652
+过些日子 11.0674643079
+暮色四合 12.5143832909
+切糕 11.9547675029
+黑眼珠 10.9562386728
+李慕良 13.2075304714
+粘结 10.604840786
+下层社会 10.6818018271
+跨度 9.21854642485
+请示 8.14493543839
+李云亭 13.900677652
+孔明入 10.9562386728
+买买 11.9547675029
+球票 12.1089181827
+自内而外 12.8020653633
+共和政体 9.84023464143
+熔窑 11.9547675029
+建立健全 8.53003962385
+齐眉举案 12.8020653633
+买书 11.4157710022
+一百里 11.0674643079
+乞粮 13.900677652
+绝灭 8.6966709649
+腐败体系 12.2912397395
+比隶臣 13.2075304714
+旋进角 13.2075304714
+监察厅 11.5027823792
+拉博 13.900677652
+多十天 13.900677652
+枝城市 11.598092559
+等角 13.900677652
+开国大典 10.8096351986
+老黄牛 11.9547675029
+莹莹 11.7034530746
+铁船 12.2912397395
+不知其二 11.0103058941
+买下 8.50251495046
+韬光 13.2075304714
+拉升 7.43142733518
+图表法 13.900677652
+疤痕 9.56994431169
+百鸟之王 13.2075304714
+打把势 13.900677652
+现年 9.35738286971
+为民请命 11.1280889297
+买主 9.19114745066
+干洗 12.2912397395
+两手发 13.900677652
+谈不成 12.5143832909
+买个 9.28555713513
+新郑县 10.8096351986
+易制毒 13.900677652
+马拉多纳 11.5027823792
+飘泊 10.4666904475
+所着 13.2075304714
+藏书室 12.8020653633
+松软 9.12999302751
+合算 9.82314020807
+一百五十 10.604840786
+写错 11.2616203224
+鼓鼓囊囊 10.7226238216
+路径分析 13.900677652
+藏书家 11.1926274509
+血浓于水 13.2075304714
+县一中 12.5143832909
+梅鲁山 13.900677652
+租佃关系 10.2371160058
+班期 12.8020653633
+江心 9.94943393339
+谈不拢 11.8212361103
+田舍 11.4157710022
+拉去 11.4157710022
+割起 12.5143832909
+割走 12.8020653633
+买价 11.2616203224
+接待客人 10.533381822
+中期贷款 13.2075304714
+台湾 6.2467084715
+催化氢化 10.9049453784
+弗兰肯 11.5027823792
+搬东西 10.765183436
+链孢霉属 13.900677652
+落花流水 10.1164880181
+跨市 12.2912397395
+凡高 11.4157710022
+董国舅 12.8020653633
+终必 12.2912397395
+专家库 11.598092559
+班机 9.16447920358
+蝴蝶儿 12.5143832909
+频率 7.11735245137
+布卢嗣 13.900677652
+镀上 11.7034530746
+买些 9.23723855786
+复进簧 11.3357282945
+两头蛇 11.1280889297
+天然更新 12.1089181827
+跨年 10.9562386728
+能免 11.598092559
+西班牙语 9.17328983326
+捎去 11.1280889297
+全班 10.0720362555
+和锡尔 13.900677652
+惟愿 11.2616203224
+满意度 9.74179456862
+显微镜 8.58747167293
+河势 11.8212361103
+清扫 9.44633035572
+水良兽 13.2075304714
+农副业 11.7034530746
+伯蒂奇 13.900677652
+弄清事实 13.900677652
+陈然 13.900677652
+眉飞色舞 9.87532596124
+和锡尼 12.8020653633
+老照片 10.7226238216
+解衣卸甲 13.2075304714
+西氏 13.900677652
+卫海 12.2912397395
+第八项 13.900677652
+一木难支 13.900677652
+河务 12.8020653633
+习惯法 10.2897597393
+拉古 10.3743171274
+桐梓县 13.900677652
+选贤任能 11.4157710022
+同工同酬 10.6818018271
+楞楞地 12.8020653633
+真七子 12.5143832909
+拉倒 9.71102290995
+虎步 13.2075304714
+公文包 10.6818018271
+公彭春 13.2075304714
+风之谷 13.900677652
+驼马 11.598092559
+信摩诃 13.2075304714
+诿过于人 13.2075304714
+党风好转 13.900677652
+庆阳 10.2897597393
+清煌煌 13.900677652
+斯多惠 12.8020653633
+实际操作 9.62401153296
+固化剂 11.3357282945
+边缘性 11.8212361103
+散转 13.900677652
+仍有 6.67301515325
+直跳 10.3453295905
+江山 7.53077666915
+冯保问 11.0103058941
+直路 12.1089181827
+弗兰茨 11.0674643079
+杜太后 12.8020653633
+块板 13.900677652
+总理府 11.1926274509
+晒版 13.900677652
+矿砂 10.9049453784
+陆虞候 10.4349417492
+五金行业 13.900677652
+仍来 12.5143832909
+令人震惊 10.4666904475
+阴曹地府 10.2371160058
+奥赛罗 10.7226238216
+郑科扬 13.900677652
+睾丸炎 12.8020653633
+骑弓 12.8020653633
+新疆人民出版社 12.2912397395
+阴测测 13.900677652
+真幸福 11.8212361103
+时隐时现 9.91169360541
+直趋 9.87532596124
+全灭 12.2912397395
+探险家 9.24671730182
+荠菜 10.8096351986
+明文庙 12.8020653633
+受欺侮 12.2912397395
+巽他 10.604840786
+晚间新闻 12.5143832909
+漫游费 10.9562386728
+圈起来 11.7034530746
+王嫱 12.5143832909
+蔡德金 13.2075304714
+惠政 12.2912397395
+田臧 13.2075304714
+氰化物 10.765183436
+人尖子 12.2912397395
+马蒂斯 11.3357282945
+水球队 13.900677652
+诸侯国 8.91707103027
+津轻海峡 11.9547675029
+扫描电镜 13.2075304714
+露马脚 12.8020653633
+很丑 12.1089181827
+灯语 13.900677652
+种麦子 11.7034530746
+记不清 9.35738286971
+铁良 11.9547675029
+养军千日 13.2075304714
+团河 12.2912397395
+碱草 11.5027823792
+丰年虫 12.5143832909
+打短工 11.1926274509
+巴枯宁 11.0103058941
+白花青 12.8020653633
+很为 10.533381822
+台海 11.0103058941
+爆满 10.3743171274
+三百七十余 13.900677652
+直起 9.80633308975
+卫温 12.8020653633
+易良田 13.2075304714
+直走 10.8096351986
+显示字符 13.2075304714
+势孤力薄 13.900677652
+陈锋 12.5143832909
+猎户座 10.2630914922
+罗曼蒂克 11.3357282945
+温凉之 13.2075304714
+水陆并进 10.1630080337
+轻脚轻手 11.5027823792
+呼伦贝尔草原 10.5684731418
+陈牧 11.9547675029
+内容丰富 9.34680076038
+很严 9.58318953844
+镖局 13.900677652
+靖康朝 13.2075304714
+亲生女儿 10.3171587135
+镐头 12.1089181827
+逃罪 12.8020653633
+秋虫 11.7034530746
+子歌 13.900677652
+孝感 9.82314020807
+窦师伦 12.5143832909
+大洲岛 12.5143832909
+归因于 9.56994431169
+失节 10.1630080337
+谷田 13.2075304714
+寄过去 13.2075304714
+美术学院 9.41204128224
+骨伤 11.5027823792
+汉城地方法院 12.8020653633
+现已 7.53420720424
+晓谕 9.5062284973
+飞散 10.5684731418
+重点县 10.3171587135
+江岸 9.27570483869
+陈爰 12.5143832909
+咬紧牙关 9.94943393339
+气咻咻 10.8561552143
+谢义炳 13.2075304714
+缝工 13.2075304714
+常见于 8.91707103027
+武王伐 12.8020653633
+熊式辉 13.2075304714
+虚弱者 11.8212361103
+忠贞不渝 11.8212361103
+中共湘区委员会 12.8020653633
+赤金 10.8561552143
+粘糊 12.8020653633
+油气井 12.5143832909
+智残人 13.2075304714
+邛崃县 13.900677652
+全然 8.9308643524
+尤里卡 11.5027823792
+捏造 9.80633308975
+延接 11.598092559
+奈拉 13.2075304714
+现将 9.15574552361
+令叔 13.2075304714
+姚夫人 12.2912397395
+照亮 8.71329184614
+陈珂 12.8020653633
+松解 11.1926274509
+念完 9.75754292558
+绝版 11.2616203224
+现就 10.3171587135
+制茶业 13.900677652
+流回来 11.4157710022
+民生路 11.8212361103
+伍里 12.8020653633
+夺宝奇兵 12.5143832909
+偷渡客 13.900677652
+跑速 12.2912397395
+旅社 10.3453295905
+个别差异 11.7034530746
+三句话不离本行 12.2912397395
+库依尔 12.8020653633
+张建平 12.1089181827
+帕雷托 11.7034530746
+课程表 13.900677652
+埃斯梅拉达斯 12.8020653633
+锥处囊中 13.900677652
+参照物 10.533381822
+蚁后 11.598092559
+陈王 12.2912397395
+拉克 9.96885201925
+陈玉 11.4157710022
+现居 10.9562386728
+孝悌 10.9049453784
+平竖直 13.2075304714
+马鞭子 10.5684731418
+积极合作 11.8212361103
+陈玄 12.8020653633
+军歌 11.3357282945
+拉兹 12.2912397395
+无天无日 13.900677652
+跑道 8.93783302172
+真有仙 12.8020653633
+宾阳县 12.8020653633
+陈玲 13.2075304714
+祖列宗 11.1280889297
+专家局 12.2912397395
+怦怦直跳 11.7034530746
+空家窘 13.900677652
+陈玮 13.2075304714
+郁郁不乐 11.1926274509
+小牢子 11.1280889297
+争鸣 11.3357282945
+跑遍 10.1394775363
+赤道 7.99259471381
+乾隆 7.63537643924
+芙蓉区 13.2075304714
+很会 9.80633308975
+江州 8.6966709649
+江川 11.8212361103
+仲裁者 12.2912397395
+向海 9.77354326693
+田耕 12.5143832909
+一代代 10.0940151622
+袖标 11.7034530746
+台江 12.2912397395
+机构名称 10.9562386728
+保证金 8.34771806705
+监测技术 11.3357282945
+那越儿 13.2075304714
+不如说 9.48183704418
+祖孙三代 11.3357282945
+徐曼玉 12.8020653633
+陈祖德 12.8020653633
+庐山会议 11.0674643079
+少年郎 12.8020653633
+翁听雨 11.0103058941
+轴承厂 13.2075304714
+穷乏 13.900677652
+掩面而泣 11.9547675029
+催泪瓦斯 12.8020653633
+绘画 7.06764591919
+正中己怀 13.900677652
+刻骨铭心 9.93038573842
+版本学 11.7034530746
+迷迷瞪瞪 11.598092559
+武建武 12.8020653633
+釉面砖 12.1089181827
+周志华 13.2075304714
+合租 11.4157710022
+田联 12.8020653633
+贝多芬 9.54396882529
+磷火 10.9562386728
+华龙网 12.8020653633
+啃过 13.900677652
+操桨 13.2075304714
+一代人 9.37888907493
+直谏 10.765183436
+黄挺东 13.900677652
+南京政府 10.4349417492
+重大责任 12.2912397395
+于玉茎 12.2912397395
+对偶原理 12.1089181827
+向洪 13.900677652
+境外 6.80395627348
+刀切斧砍 13.900677652
+内哄 13.900677652
+郑守成 12.8020653633
+胆大包天 10.2371160058
+沈灿 13.2075304714
+读法 11.598092559
+虫虫 13.900677652
+所用 7.40843781696
+狷介 13.2075304714
+泰伯 11.2616203224
+庄先生 10.8561552143
+斯佩伯爵 12.8020653633
+矿种 10.2897597393
+所由 13.900677652
+拉凯 13.2075304714
+所画 9.5186510173
+骚人墨客 12.8020653633
+军毯 11.9547675029
+周承恩 13.900677652
+封底 12.5143832909
+军民 7.37858485381
+直话 13.2075304714
+河坝 12.2912397395
+法定代表 9.65218240993
+满堂彩 11.9547675029
+饺子宴 13.2075304714
+注射费 13.900677652
+直译 11.2616203224
+废品率 12.2912397395
+政论文 11.8212361103
+铁芯 10.8096351986
+割裂 9.84023464143
+验钞机 11.7034530746
+谈不来 13.900677652
+三十八处 13.2075304714
+赤露 13.900677652
+实际收入 10.3743171274
+杜伊诺 13.2075304714
+代表团 8.11071748108
+专业学位 12.1089181827
+直读 11.8212361103
+伯利安 12.1089181827
+田螺 10.5684731418
+牧夫 13.900677652
+直说 9.09665660724
+郝将爷 12.8020653633
+朱希孝 10.9049453784
+十箱 13.900677652
+球类 10.9562386728
+电感线圈 12.5143832909
+南明抗 12.5143832909
+刻上去 11.8212361103
+照住 12.1089181827
+陈其 12.5143832909
+台毯 11.7034530746
+诸色人等 13.2075304714
+长长的 7.80260336981
+秋胡 12.1089181827
+祸殃 12.5143832909
+缝子 11.9547675029
+产业工人 10.604840786
+赵继红 13.900677652
+现存 7.11962002604
+赤面 11.9547675029
+克里克 10.2371160058
+共出动 10.9562386728
+王宗岳 13.2075304714
+鼓丘 11.9547675029
+剪刀差 10.2117981979
+露华浓 13.2075304714
+莫雷诺 12.5143832909
+耶西 13.2075304714
+陈益 11.598092559
+身心交瘁 12.8020653633
+潮上带 12.8020653633
+土著人 10.9562386728
+蒸湘区 13.900677652
+祷词 11.9547675029
+瓷器店 13.2075304714
+失落 8.89004235788
+照会 9.7898037878
+奋力抢救 13.900677652
+功高盖主 13.900677652
+趋附权贵 13.900677652
+直让 11.8212361103
+金施子 13.2075304714
+戈蒂耶 11.9547675029
+阳性者 11.7034530746
+普吕克 13.2075304714
+海伦 10.4349417492
+亏心事 10.3743171274
+陈瑞 9.19114745066
+泪人 10.8096351986
+睾丸癌 12.8020653633
+枕叶 12.1089181827
+现实 6.13383711489
+班戈 11.0674643079
+苍白球 12.8020653633
+绝症 10.604840786
+那太尉 13.2075304714
+教育疏导 13.900677652
+悉心 9.58318953844
+终局 11.1926274509
+融智 12.5143832909
+卫校 11.9547675029
+男主人 11.0103058941
+待产期 13.900677652
+王濂 12.5143832909
+自发性 10.2117981979
+西班牙 6.6493326686
+海伊 12.8020653633
+合纵 10.6818018271
+仔细听讲 13.900677652
+藏书库 13.900677652
+早上 7.23882291143
+篙子 13.900677652
+现场版 13.900677652
+秋耕 13.2075304714
+台步 12.8020653633
+跑鞋 13.2075304714
+合约 6.76897914151
+海会 11.4157710022
+合纤 11.9547675029
+卡那霉素 11.9547675029
+皎然 12.5143832909
+十年浩劫 11.4157710022
+军法 9.33632946051
+拉回 10.5684731418
+狄历 13.2075304714
+板桥镇 11.9547675029
+华山参 13.900677652
+数学史 9.69598503258
+深奥莫测 13.900677652
+尉氏 10.4349417492
+孝服 10.7226238216
+合练 12.8020653633
+写道 7.77162744192
+陈理 12.8020653633
+合组 10.3453295905
+全盛 10.2630914922
+全盘 9.44633035572
+云门山 11.9547675029
+广雅疏 12.8020653633
+全盟 12.5143832909
+读毕 11.598092559
+拉图 13.900677652
+陈琳 10.3743171274
+特与 12.8020653633
+吴郭鱼 13.900677652
+叛国罪 10.642581114
+青草湖 12.2912397395
+陈琨 12.8020653633
+所爱 10.533381822
+崭新 8.31342899358
+常绿灌木 10.5684731418
+巫陵王 10.4666904475
+草甸子 11.7034530746
+照例 7.92179188707
+云室 11.0674643079
+海产 9.05649056552
+大美女 11.7034530746
+江孜 10.6818018271
+兴利除害 11.7034530746
+田蚕 12.5143832909
+眼圈儿 9.94943393339
+海亭 12.8020653633
+于天明 12.8020653633
+杰斐逊 10.2897597393
+袁天纲 12.8020653633
+心脏地区 11.9547675029
+乔戈里 12.5143832909
+多万册 11.5027823792
+土温 11.5027823792
+周天全 12.8020653633
+草菅人命 11.1280889297
+裹足 11.598092559
+等闲之辈 10.8096351986
+语言学 8.95903522937
+活塞杆 13.900677652
+解剖学家 11.1926274509
+石英钟 12.1089181827
+全真 10.604840786
+海事 9.80633308975
+准分子 11.598092559
+全看 10.8096351986
+弗兰萨 13.2075304714
+鱼骨 10.533381822
+全省 6.36698394213
+录音棚 13.2075304714
+高福早 13.2075304714
+花键轴 13.2075304714
+照临 11.3357282945
+等距 11.2616203224
+松辽 10.1394775363
+松达 12.8020653633
+凶岁 12.5143832909
+工程车 10.3453295905
+特务间谍 13.900677652
+张相文 13.2075304714
+诱发电位 12.1089181827
+白山市 12.2912397395
+半吐半露 13.2075304714
+工具集 12.2912397395
+非讼事件 13.2075304714
+照个 11.4157710022
+商河县 13.900677652
+袖珍式 12.5143832909
+近期走势 9.87532596124
+合署 11.9547675029
+彭珮云 13.900677652
+背下来 10.7226238216
+史游 12.8020653633
+海南游 13.900677652
+虫胶 11.598092559
+看不到 7.6701962044
+照下 13.900677652
+照上 11.5027823792
+谷牧 12.5143832909
+乳业 8.92394390956
+陈留 9.5186510173
+楔形文字 10.2371160058
+接吻 10.2630914922
+争食 11.2616203224
+海中 8.37921673411
+东风汽车公司 12.2912397395
+谷物 7.73947033028
+旺代 12.8020653633
+马科马 13.2075304714
+松轩 13.2075304714
+搬来搬去 12.5143832909
+西园记 11.9547675029
+海丰 10.3453295905
+斯塔尔 11.9547675029
+获得 4.87090038378
+河图 11.1926274509
+翻眼 12.8020653633
+唐封行 12.8020653633
+乾道 10.765183436
+海上 6.59818122825
+照付 12.1089181827
+斯塔尼 12.2912397395
+黑眼睛 10.9562386728
+势不可遏 13.2075304714
+省电 11.5027823792
+海东 11.4157710022
+合群 10.4994802703
+海丘 12.5143832909
+十余种 10.1164880181
+史源 12.8020653633
+全矿 12.8020653633
+秦华卿 11.7034530746
+来福士 12.5143832909
+没影儿 11.8212361103
+照人 11.0103058941
+飞奔而来 10.8561552143
+江安 11.598092559
+由众缘 13.2075304714
+孝昌 11.3357282945
+民办非 11.598092559
+多万元 8.53470163695
+锁麟囊 12.1089181827
+直言 8.230796729
+二十一本 13.2075304714
+拉基 13.2075304714
+粘稠 9.37888907493
+息止 13.2075304714
+小竹林 12.2912397395
+水量交换 12.5143832909
+一百多号 12.8020653633
+阳太守袁 13.900677652
+适度从紧 11.5027823792
+尼科娃 13.900677652
+统一体 9.84023464143
+求偶 10.0720362555
+狄克 12.8020653633
+拉向 11.598092559
+驼鹿 10.6818018271
+主计室 13.900677652
+直角 9.61021821083
+经销商 7.62028181302
+草镰 12.2912397395
+拉吉 11.4157710022
+拉吊 13.900677652
+全琮 12.5143832909
+减震器 10.6818018271
+维沙卡帕 13.2075304714
+直觉 8.75318317516
+直视 10.0720362555
+夏长冬 12.5143832909
+侯府中 12.5143832909
+直观 8.5488195185
+英伦三岛 11.3357282945
+于大顺 13.900677652
+王元顺 13.900677652
+秋节 13.900677652
+波特曼 13.900677652
+史海 11.0103058941
+初等矩阵 13.2075304714
+铝冶炼 12.5143832909
+绝命诗 10.765183436
+狄入 13.2075304714
+赫脱 13.900677652
+锋头 13.900677652
+皮安基 13.900677652
+碌碌无能 12.2912397395
+等身 12.8020653633
+同呼吸 12.5143832909
+签在 13.900677652
+特殊化 11.0674643079
+分布式系统 13.2075304714
+西伊州 12.8020653633
+全球 4.90204645369
+军港 9.62401153296
+史浩 12.8020653633
+斯塔德 11.2616203224
+初级阶段 9.34680076038
+酥麻麻 13.900677652
+推拉窗 12.5143832909
+古关道 12.5143832909
+脱皮机 13.900677652
+发动战争 9.91169360541
+一九一九年 13.2075304714
+四层楼 11.7034530746
+其实质 10.0720362555
+用户量 13.900677652
+己巳 12.5143832909
+陈再教 13.900677652
+秦皇岛港 9.82314020807
+缝好 11.0103058941
+驼鸟 12.8020653633
+天干地支 12.1089181827
+标语牌 12.2912397395
+窃据要津 13.900677652
+预测学 13.900677652
+拉呱 11.4157710022
+陈皮 10.4041700905
+余卷 11.598092559
+小老儿 11.5027823792
+震中 10.1630080337
+江堤 10.604840786
+上级领导 9.55687223012
+王石谷 13.900677652
+除少数 9.12155415886
+颖慧过人 13.900677652
+搭便车 12.8020653633
+木本油料 11.0103058941
+儿马 12.2912397395
+造价 8.80692745117
+监察员 12.1089181827
+陈登 10.7226238216
+台中港 11.2616203224
+晒盐 10.8561552143
+瑞士制 13.900677652
+佩金字 13.2075304714
+何太医 10.8561552143
+颌间挛缩 13.900677652
+江声 9.74179456862
+钱串子 11.9547675029
+周天勇 9.96885201925
+芙蓉国 13.900677652
+孝敬 9.03314320152
+残余 8.01457362053
+由近及远 10.8096351986
+看不出 8.0285598625
+汉良乡 12.8020653633
+经贸公司 13.900677652
+电影频道 12.1089181827
+虫草 9.77354326693
+造谣生事 13.900677652
+秋色 10.3453295905
+啃书本 12.8020653633
+五支箭 13.900677652
+造人 11.3357282945
+噜苏 13.2075304714
+箫笙 12.8020653633
+八角茴香 12.2912397395
+充饥 9.5186510173
+五十六条 13.2075304714
+沉默无语 11.7034530746
+穴播 11.9547675029
+相争斗 13.2075304714
+驱逐舰 8.39941944143
+台榭 11.4157710022
+李小璐 12.5143832909
+马赫穆 11.598092559
+周定公 12.1089181827
+全由 9.74179456862
+走漏风声 11.1926274509
+请缨 11.0674643079
+等辈 11.3357282945
+持仓 7.25819085061
+史汀 12.8020653633
+周天卦 10.642581114
+赛克尔 13.2075304714
+江奇 12.8020653633
+村里人 8.51160592216
+球网 11.3357282945
+赤胆 13.2075304714
+黏液 10.4666904475
+卡特里娜 13.2075304714
+等边 11.598092559
+槽子 11.7034530746
+没吃过 9.7898037878
+谷烁 12.8020653633
+仓雅之 13.900677652
+新田县 13.900677652
+可多可少 12.2912397395
+准能 10.1871055853
+直裰 9.22784881751
+美韶华 13.2075304714
+海绵铁 13.2075304714
+陈矩 12.2912397395
+毙命 9.98865464655
+小尔依 9.84023464143
+拼板 13.2075304714
+跨境 8.10461990121
+万元以上 9.16447920358
+知耻 11.598092559
+造作 10.0088573539
+借穿 13.2075304714
+海之渊 13.2075304714
+杨明轩 12.8020653633
+闭合性 12.1089181827
+武修文 13.900677652
+请罪 9.29550746599
+翼根 11.1280889297
+江夏 9.58318953844
+增加值 8.05135287203
+请用茶 11.9547675029
+河合 12.5143832909
+切中时弊 11.3357282945
+特产 7.63158136827
+早衰现象 13.900677652
+民选总统 12.1089181827
+史氏 11.5027823792
+考察期 12.5143832909
+陈瞻 13.2075304714
+悉尼 9.29550746599
+要活 10.4041700905
+多万台 13.900677652
+秋菊 10.765183436
+江头 12.5143832909
+迁回去 13.2075304714
+老成凋谢 13.900677652
+积极因素 9.77354326693
+裹进 11.7034530746
+本督帅 11.8212361103
+傅岩 13.900677652
+蝴蝶型 13.2075304714
+汽车站 9.93038573842
+浩如 13.2075304714
+割让 8.9519177616
+秋菜 13.900677652
+持久 7.85330547293
+未试过 13.900677652
+一百公里 12.8020653633
+子牙河 10.2371160058
+江姐 11.1280889297
+直行 9.87532596124
+羟化酶 11.598092559
+秋茶 11.9547675029
+吸收量 11.9547675029
+绝不会 7.87723005901
+杜父鱼 12.2912397395
+伍长 12.1089181827
+下个星期 11.0674643079
+小环藻 12.8020653633
+竭尽力量 13.900677652
+文献工作 12.1089181827
+聂鲁达 11.7034530746
+从林 13.900677652
+软盘驱动器 13.2075304714
+省纪委 10.2630914922
+安提瓜岛 12.1089181827
+阳性菌 11.5027823792
+立晋王 12.8020653633
+音讯 10.0505300503
+莱西县 13.2075304714
+瞎逛 12.8020653633
+微处理机 11.0674643079
+蒙台梭 12.5143832909
+夏斯特 13.2075304714
+记分板 13.900677652
+中国新民主主义革命 10.604840786
+数千根 13.900677652
+害羞 9.29550746599
+养士之 11.9547675029
+正式照会 12.5143832909
+十余篇 13.900677652
+北京大学哲学系 11.1926274509
+数千株 13.900677652
+陈眉 8.74738605748
+惟有 8.04274449749
+本厅 13.2075304714
+新安镇 13.2075304714
+浩大 9.28555713513
+余立金 13.900677652
+穴施 13.2075304714
+史河 11.8212361103
+秋草 11.5027823792
+雇到 11.598092559
+如诗如画 12.1089181827
+严光 11.598092559
+粤省 13.900677652
+收票 12.5143832909
+赤铜 11.9547675029
+伊莱 12.2912397395
+冯保心 11.9547675029
+休假日 13.2075304714
+残丘 9.48183704418
+等车 11.0674643079
+文冠果 11.598092559
+热辐射 10.1394775363
+全稿 12.1089181827
+数一数二 10.3453295905
+易二世 13.900677652
+河子 11.9547675029
+所经 9.18217878068
+陈磊 13.2075304714
+失血 9.5186510173
+工程船 12.5143832909
+伸展出去 12.8020653633
+八面山 11.1926274509
+各项改革 10.2371160058
+刘表遂 13.2075304714
+现地 12.1089181827
+台柱 11.4157710022
+一两分钟 11.0103058941
+争长 12.5143832909
+枉驾 11.9547675029
+现场 6.31235397464
+江苏队 13.900677652
+卡普拉 12.8020653633
+失衡 7.91926344072
+全程 8.3285236198
+螃蟹 9.53122979951
+裹肚 12.1089181827
+基本操作 12.1089181827
+现在 3.9537475416
+阴森森 10.1630080337
+这三项 10.8096351986
+琼浆玉液 12.1089181827
+民用机场 11.598092559
+宏福 13.900677652
+个别生产 10.4666904475
+马军随 13.2075304714
+相差不远 11.5027823792
+曲予 9.56994431169
+裘丽丽 9.14708746087
+松花 10.604840786
+乌尔扎尔 12.5143832909
+索道 9.84023464143
+数千架 13.900677652
+争锋 10.9049453784
+矿物 7.28461246684
+东路 8.49350588052
+小老弟 12.8020653633
+以肉喂虎 12.8020653633
+地滚球 13.2075304714
+肆扰 13.900677652
+刘表适 12.8020653633
+多十倍 12.1089181827
+台架 12.5143832909
+近代化 10.765183436
+管足孔 13.2075304714
+裹胁 11.3357282945
+拜物教 10.533381822
+一百颗 13.2075304714
+女业主 13.900677652
+阿耶桑 13.2075304714
+欧州 12.1089181827
+松节 13.900677652
+关法玛 13.2075304714
+敬请光临 13.900677652
+近代史 9.26594866375
+母蝎 12.2912397395
+接去 11.0674643079
+马戏 11.2616203224
+粘着 9.89334446674
+秋谨 11.5027823792
+购买群 13.900677652
+黑骑士 12.8020653633
+滇东南 11.1926274509
+第一印象 10.9562386728
+秋谷 12.5143832909
+近亲通婚 12.2912397395
+混合接头 13.900677652
+绝种 11.8212361103
+焚琴煮鹤 13.900677652
+数千条 12.1089181827
+狄忒 11.598092559
+上万种 13.900677652
+争闹 12.1089181827
+岳乐叹 13.2075304714
+光光亮亮 13.2075304714
+艾瑞克 13.900677652
+专家型 13.2075304714
+奥斯特洛夫斯基 10.7226238216
+胖乎乎 10.3743171274
+耸立着 10.2371160058
+向晚 11.1280889297
+台板 11.598092559
+无党无偏 13.900677652
+良渚遗址 13.2075304714
+辛安驿 13.2075304714
+高敖曹 13.2075304714
+唱着歌 11.0103058941
+准轨 12.8020653633
+以血还血 13.900677652
+枕心 13.900677652
+男排 12.8020653633
+斯塔克 10.8561552143
+年级组 13.900677652
+脑外伤 11.7034530746
+朴智星 13.900677652
+齐自威 13.2075304714
+特令 10.9049453784
+看不得 11.1280889297
+不甚了了 11.1926274509
+按甲寝兵 13.900677652
+地质测量 12.2912397395
+军情 8.22392384971
+亲热 8.26588804881
+山西省运城地区 11.8212361103
+海运局 13.900677652
+灵气儿 13.2075304714
+台服 13.900677652
+麦克纳马拉 13.2075304714
+还人情 13.900677652
+动辄得咎 11.7034530746
+巅峰状态 12.8020653633
+拉哈 11.8212361103
+沙里湾 12.8020653633
+伊普斯 13.900677652
+再认 11.598092559
+何见谕 13.2075304714
+聚酯切片 13.2075304714
+闭壳肌 11.598092559
+名优特新 13.900677652
+发人深省 11.1280889297
+台本 12.5143832909
+谷缘 12.8020653633
+燃眉之急 9.94943393339
+向柳 12.2912397395
+大开杀戒 11.7034530746
+克里尔 13.900677652
+双眉直 13.900677652
+扑倒 10.533381822
+震于 11.8212361103
+数控技术 13.2075304714
+陈秀 12.1089181827
+撒马尔罕 9.69598503258
+终岁 11.9547675029
+葬送在 12.8020653633
+争先恐后 9.55687223012
+性如烈火 12.1089181827
+冤仇 10.2630914922
+扩大出口 10.533381822
+太清境 13.2075304714
+一伙人 9.43476953332
+木雕泥塑 11.4157710022
+点滴归公 13.900677652
+南龙 10.4349417492
+诸港 11.5027823792
+宗大怒 12.5143832909
+晋魏王 13.2075304714
+实施规划 12.2912397395
+跨国 8.56795885871
+骤不及防 13.900677652
+畛域 11.7034530746
+位督帅 13.2075304714
+诡怪 13.900677652
+狄布 13.2075304714
+枕席 11.5027823792
+土产 9.80633308975
+草拟文件 12.8020653633
+太阴玄 13.900677652
+跑马 9.77354326693
+谷纹 12.8020653633
+监察官 10.533381822
+蒙古马 10.7226238216
+监察室 12.8020653633
+阿斯洛克 10.9049453784
+第八部 13.2075304714
+袁绍自 13.2075304714
+推销产品 13.900677652
+二女一男 13.2075304714
+观测器 12.5143832909
+邦阿西楠 13.900677652
+一百首 12.5143832909
+言情小说 11.9547675029
+全等 11.7034530746
+克里山 12.5143832909
+望恩相 12.1089181827
+赛过 10.1164880181
+日晒 10.0505300503
+季梁 13.2075304714
+万余人次 13.2075304714
+印度支那 9.30555780184
+马屁拍 12.2912397395
+侯张良 13.2075304714
+推陈出新 10.3743171274
+吹糠见米 13.900677652
+马衔山 11.3357282945
+红玉 10.533381822
+拉安 13.2075304714
+江城 10.8096351986
+松荫 12.8020653633
+向来 7.70219893548
+籍田 12.8020653633
+向杨 11.5027823792
+方圆十里 11.9547675029
+估计数 11.8212361103
+应对如流 12.2912397395
+等级制度 9.84023464143
+拉宾 10.1871055853
+顺天应人 12.8020653633
+鹿门隐 13.2075304714
+向束 13.900677652
+有尖锋 12.8020653633
+裹脚 12.2912397395
+收官战 13.2075304714
+是非观 11.8212361103
+晒种 13.2075304714
+高情远意 13.900677652
+拉客 11.7034530746
+恢弘 11.0674643079
+松茸 11.5027823792
+林秀才 12.2912397395
+悉力 12.8020653633
+聚酰亚胺 11.9547675029
+脉速 13.2075304714
+梁曙光刚 12.8020653633
+家福妈 11.9547675029
+孔雀鱼 13.900677652
+专家团 11.9547675029
+被吸入 11.598092559
+马家军 12.2912397395
+沙俄 8.55357012126
+违忤 13.2075304714
+则安之 11.7034530746
+裹腿 11.0674643079
+缩窄性 12.5143832909
+第八道 13.900677652
+默默不语 10.765183436
+杀草丹 12.8020653633
+虚度光阴 13.2075304714
+派恩 13.2075304714
+等腰 12.2912397395
+咕哝 8.82550383674
+总务 10.9049453784
+松山机场 12.2912397395
+不着陆 12.8020653633
+现因 11.4157710022
+五百步 11.4157710022
+合班 13.2075304714
+所缺 11.7034530746
+师伐魏 11.8212361103
+虫豸 12.1089181827
+深受 7.63727938938
+全篇 10.604840786
+为政之道 12.2912397395
+改法 13.2075304714
+董海川 12.2912397395
+莱西市 12.2912397395
+军战 10.9049453784
+河套 8.76487921493
+站稳脚跟 9.96885201925
+丛小草 13.900677652
+华彩 10.8561552143
+生律法 13.900677652
+股天下 12.5143832909
+古右文 13.2075304714
+太清宫 11.1280889297
+擢为 10.642581114
+虔信 11.9547675029
+陈竺 10.642581114
+子陵鱼 13.2075304714
+军户 10.4041700905
+沙里河 12.5143832909
+枉顾 12.1089181827
+碧澄 12.5143832909
+讣闻 13.2075304714
+会计年度 9.66657114738
+陈章 12.5143832909
+孙颖 13.2075304714
+昏聩无能 12.8020653633
+绝笔 11.4157710022
+马化腾 11.9547675029
+国产汽车 11.7034530746
+经上述 11.598092559
+拉塞 13.900677652
+管吃管住 13.900677652
+虎门销烟 11.9547675029
+烟云缭绕 13.900677652
+拉塔 11.598092559
+矿灯 10.6818018271
+失言 9.91169360541
+沈秉 12.8020653633
+憨痴 13.900677652
+好几百里 13.2075304714
+遮护 11.2616203224
+惋叹 12.5143832909
+宵禁 11.3357282945
+数千斤 13.900677652
+背弃 10.4041700905
+卡尔斯基 13.900677652
+争霸 9.4233408375
+英吉利 11.0103058941
+单刃剑 13.2075304714
+机电产品 10.0940151622
+白食 12.8020653633
+双重性格 12.8020653633
+说到做到 10.4041700905
+河头 11.9547675029
+俊俏 9.61021821083
+后成仙 12.8020653633
+长吟 11.9547675029
+原子间 10.8096351986
+碧澈 13.900677652
+河大 12.2912397395
+安守本分 13.900677652
+招以东 13.2075304714
+铃铛声 12.8020653633
+矿点 11.4157710022
+黏性 11.3357282945
+白胜雪 13.900677652
+总办 9.7898037878
+标识器 13.900677652
+郁罗迦 13.2075304714
+眩目 10.9049453784
+南明永 11.2616203224
+卫星 7.19994654243
+不恤人言 13.900677652
+麦格雷 13.900677652
+去买烟 12.5143832909
+郡县制 10.1871055853
+台数 11.4157710022
+蚁巢 10.8561552143
+三氯化硼 12.8020653633
+侃侃而言 13.900677652
+第十一篇 13.2075304714
+热气腾腾 9.71102290995
+熔焊 13.900677652
+逐步回归 11.5027823792
+军报 11.5027823792
+中国社会主义青年团 10.4666904475
+任南洋 12.2912397395
+坚不可摧 10.9562386728
+佳儿佳妇 13.900677652
+风口浪尖 9.91169360541
+输到 11.9547675029
+订合同 12.8020653633
+迎上来 9.69598503258
+第五任 11.4157710022
+热交换器 11.1926274509
+左回焉 13.900677652
+第五代 10.0294766411
+石棚山 12.8020653633
+周天度 13.2075304714
+刚进宫 12.5143832909
+白云矿区 13.900677652
+两头跑 12.2912397395
+录音机 9.20932976975
+言正合 12.1089181827
+牧希 11.0103058941
+虎掌 13.900677652
+第四十八回 12.2912397395
+同党 10.1630080337
+等色 10.1630080337
+多万年 12.2912397395
+卫普 12.8020653633
+秦同 12.5143832909
+红牌 11.3357282945
+至尊至贵 12.5143832909
+迟延 10.3453295905
+苦菜花 13.2075304714
+稳中有升 9.65218240993
+球状 9.15574552361
+熔炼 10.0720362555
+河塘 13.2075304714
+全社 11.5027823792
+结肠炎 10.9049453784
+一层层 9.29550746599
+克里希 12.2912397395
+西向北 11.4157710022
+乐安县 13.900677652
+同篇 13.2075304714
+冶炼 7.95787827685
+缝合 9.89334446674
+奥陶世 11.3357282945
+肆意 9.43476953332
+斯塔努 13.900677652
+墨脱县 11.2616203224
+版本号 12.5143832909
+土丘 9.80633308975
+库莫奚 11.8212361103
+步军先 12.2912397395
+一股脑 10.7226238216
+拉夫 10.2897597393
+四五百斤 13.900677652
+熔炉 11.0103058941
+子术赤 11.9547675029
+金迪至 13.900677652
+实用新型 10.604840786
+拉大 9.06439574502
+戈特岛 13.900677652
+情场失意 13.900677652
+哈贝马斯 12.8020653633
+生小枝 12.2912397395
+唐贞元 11.0103058941
+葡糖 13.900677652
+单交 13.900677652
+困兽之斗 12.8020653633
+境内 5.85348808981
+议论风发 12.5143832909
+西向南 13.2075304714
+全票 11.0103058941
+王临藩 13.2075304714
+谷粱 13.2075304714
+冠毛 11.9547675029
+里尔逊 12.5143832909
+狄尔 12.8020653633
+爱鸟周 12.8020653633
+拉奇 12.2912397395
+陈雁 13.900677652
+维尔为 13.2075304714
+马蒂河 13.2075304714
+书信往返 13.900677652
+全神 12.2912397395
+无关大局 12.2912397395
+二十七级 13.2075304714
+克伦威尔 10.1871055853
+向斜 9.71102290995
+鲠直 12.8020653633
+重庆百货 9.65218240993
+谷粒 11.3357282945
+填堵 13.2075304714
+网页内容 13.2075304714
+布拉什 13.900677652
+谢罗夫 12.2912397395
+拉奥 11.3357282945
+合照 11.9547675029
+第五位 9.54396882529
+河堤 8.9519177616
+董鄂妃 9.26594866375
+软弱无能 11.0103058941
+黄褐斑 11.1280889297
+挪用资金 11.5027823792
+第十一章 9.6811699468
+乐观主义 10.4994802703
+史惟 13.2075304714
+陈策 13.900677652
+应接不暇 10.2897597393
+固始县 11.4157710022
+庆龄 13.2075304714
+医学生 12.8020653633
+能源需求 10.533381822
+谷类 9.85762638414
+争雄 10.4041700905
+隆达斯 12.2912397395
+跑题 12.5143832909
+失读 13.900677652
+那么样 11.0103058941
+张建国 13.2075304714
+修改草案 11.9547675029
+军控 11.9547675029
+全福 12.2912397395
+多万张 11.9547675029
+裸体 9.5062284973
+谢郎 13.2075304714
+失语 10.9049453784
+失误 8.02014466558
+一百六十 11.1926274509
+传输技术 11.7034530746
+投巨资 12.2912397395
+达累斯萨拉姆 11.2616203224
+代表处 9.93038573842
+成员国 7.74581955796
+松脱 11.1280889297
+全称 8.20023407859
+丧天害理 13.900677652
+要式合同 13.900677652
+郎赵彦 13.2075304714
+尚铭 13.900677652
+大奴湖 12.2912397395
+黑风口 10.765183436
+卫束 12.8020653633
+拉姆 9.75754292558
+准谱 12.8020653633
+直落 11.598092559
+糖蛋白 11.1280889297
+邱爷 12.8020653633
+军援 11.1280889297
+上帝保佑 11.4157710022
+全科 11.8212361103
+所累 10.8561552143
+澳大利亚联邦政府 12.5143832909
+时装片 13.2075304714
+农村金融 10.4666904475
+林宗先生 12.8020653633
+陈第 12.2912397395
+复职 9.87532596124
+松脂 9.65218240993
+直营 10.7226238216
+杂差 12.1089181827
+松脆 11.3357282945
+正巧是 12.8020653633
+输出 6.95178042966
+所立 10.2117981979
+直下 10.8096351986
+拉帕 12.5143832909
+垂下 8.9519177616
+天聪 10.5684731418
+记分法 13.900677652
+拉希 12.5143832909
+接骨木 12.5143832909
+拉布 11.598092559
+拉帆 13.900677652
+亲身经验 13.2075304714
+李高 9.17328983326
+割胶 12.1089181827
+谐谑 11.7034530746
+开戏 11.9547675029
+乃堆拉 13.900677652
+县公安局 10.8096351986
+田边 10.4349417492
+克里夫 11.8212361103
+谐调 11.0674643079
+托尔希 11.4157710022
+和济嘎 12.8020653633
+盘马弯弓 12.5143832909
+呼廷灼 13.2075304714
+雄奇 10.4666904475
+头顶部 11.7034530746
+定期存款 9.45802639549
+隋树森 12.5143832909
+失谐 13.2075304714
+现卖 12.2912397395
+陈粟 13.2075304714
+任西伯 12.8020653633
+晦迹 13.2075304714
+阅历 9.0884932966
+捎带 9.72629038208
+阿拉巴马 13.900677652
+屦贱踊贵 13.900677652
+失调 8.31342899358
+吃拿卡要 12.5143832909
+寿圣节 13.900677652
+拉幅 12.8020653633
+割肉 9.46986085313
+克里奥 13.900677652
+团扇 10.2897597393
+准许 8.62767809341
+历年试题 13.2075304714
+拉平 11.0103058941
+慨叹 9.5062284973
+北京北海公园 12.5143832909
+工业 5.0677981917
+廉能之 13.2075304714
+士官兵 13.900677652
+工专 13.2075304714
+百草霜 13.900677652
+陈军 11.4157710022
+阿拉伯埃及共和国 12.2912397395
+全线 7.00297270885
+偏听偏信 11.1926274509
+食不下咽 12.1089181827
+地域性 10.0940151622
+拉底 13.900677652
+滨临 10.8096351986
+商住 10.765183436
+达克宁 11.9547675029
+陷阵 11.9547675029
+拉床 11.9547675029
+精萃 12.1089181827
+边尖红 12.2912397395
+数学家 7.59989185731
+河心 10.765183436
+工价 10.604840786
+工件 9.25628675283
+工商行政 9.59661255877
+映带 13.900677652
+粤籍 13.2075304714
+多媒体扩展 13.2075304714
+臧式毅 13.2075304714
+陈米 12.2912397395
+分配机制 10.765183436
+多万只 11.8212361103
+拉康 12.1089181827
+牵连到 11.1280889297
+中原区 9.48183704418
+芙蓉峰 12.5143832909
+金缕衣 13.900677652
+光致变色 11.9547675029
+赃官污吏 13.2075304714
+阅卷 10.3743171274
+和锡兰 11.598092559
+尖端技术 10.604840786
+不能分解 13.2075304714
+阿耶波 12.2912397395
+汉官仪 13.2075304714
+克里姆 11.2616203224
+笛子 9.04864738806
+邛崃山 10.4994802703
+江天 11.1280889297
+负担重 11.7034530746
+工交 12.2912397395
+享受型 13.900677652
+看不完 11.9547675029
+合盖 13.2075304714
+允行 11.1926274509
+习艺所 10.9562386728
+康奈尔 13.2075304714
+下关 9.61021821083
+罗盘针 13.900677652
+张建军 13.900677652
+工人 5.71839791272
+专家号 11.2616203224
+李占奇 11.5027823792
+变化率 9.6811699468
+史有明 13.2075304714
+人才交流 10.9562386728
+工于 11.8212361103
+退管 13.900677652
+工事 8.60737282725
+瑞草 11.9547675029
+守护神 9.98865464655
+戴宗遵 12.5143832909
+益寿之 13.2075304714
+族权 11.7034530746
+矿盐 11.7034530746
+缝口 12.1089181827
+团拜 12.1089181827
+时装界 13.900677652
+王石虎 13.900677652
+向戌 12.5143832909
+全组 12.1089181827
+浩叹 11.7034530746
+小老婆 9.96885201925
+厉色严 13.2075304714
+高温多雨 9.77354326693
+江南 6.41238413682
+习惯性 9.46986085313
+拉弓 11.0103058941
+拉引 13.900677652
+混世魔王 10.604840786
+拉弗 12.2912397395
+鲻鱼 11.9547675029
+江华 10.604840786
+斗争意志 12.5143832909
+贬谪 10.533381822
+境域 11.4157710022
+汇款单 12.1089181827
+拉开 7.41604241634
+明修栈道 11.5027823792
+科勒曼 13.2075304714
+淡去 11.9547675029
+乐一词 13.2075304714
+王尔调 13.900677652
+工位 11.7034530746
+抱愧 11.598092559
+读成 11.9547675029
+缝到 12.2912397395
+合眼 9.25628675283
+淫欲 12.1089181827
+现券 9.59661255877
+女战士 10.2897597393
+军政 7.86759143018
+外贸局 12.8020653633
+水权 13.2075304714
+友好访问 11.7034530746
+工作 4.20273934235
+氟里昂 11.9547675029
+中山北路 13.2075304714
+虚拟内存 13.900677652
+艰险 9.22784881751
+沈约 10.9562386728
+江卢 11.9547675029
+工体 11.598092559
+拉弦 11.4157710022
+王宪章 13.2075304714
+芙蓉城 12.8020653633
+互动关系 11.5027823792
+非金属矿 9.4233408375
+江北 8.2985588311
+工伤 9.91169360541
+七十多里 13.900677652
+李大壮 13.900677652
+查全率 13.900677652
+蚂蝗 12.1089181827
+内杜斯 13.900677652
+垂体 9.15574552361
+合着 10.3743171274
+委任制 12.8020653633
+府右街 12.8020653633
+经得住 10.604840786
+所管 10.4994802703
+国公爷 11.5027823792
+扶正祛邪 11.598092559
+奥尔圣 13.2075304714
+全网 9.77354326693
+全罗 12.8020653633
+熔盐 11.598092559
+五年计划 9.37888907493
+史春 12.8020653633
+擦剂 13.900677652
+失败 6.23820983678
+瀑布群 10.4994802703
+周天古 11.5027823792
+三百万元 13.2075304714
+工休 12.8020653633
+澄江镇 13.2075304714
+块根 10.0940151622
+大肚汉 12.8020653633
+阿克苏市 11.4157710022
+乾顺 13.2075304714
+费奈斯 13.2075304714
+全羽 11.5027823792
+李师道 11.9547675029
+跨到 10.604840786
+犯罪人 10.3743171274
+许慧欣 13.900677652
+拉得 9.71102290995
+湘夫人 11.7034530746
+谐趣 12.1089181827
+叫花子 10.1871055853
+台扇 13.900677652
+收视费 12.8020653633
+程普引 12.5143832909
+刘表闻 12.8020653633
+拉往 12.2912397395
+豹子头 10.1630080337
+害病 9.91169360541
+墙裙 13.900677652
+封忠王 13.2075304714
+浩博 12.8020653633
+朱天光 12.2912397395
+海相沉积 10.3743171274
+粘牢 12.2912397395
+军方 8.53938548627
+江右 12.5143832909
+现势 13.900677652
+拉德 10.9562386728
+谷穗 11.8212361103
+吴宝柱 10.642581114
+喜结良缘 11.5027823792
+全美 8.48903160012
+浩华 11.3357282945
+功利性 11.3357282945
+完备化 13.900677652
+所签 11.598092559
+从君亭 13.2075304714
+做得好 9.89334446674
+江原 11.9547675029
+一个三面 13.2075304714
+结肠癌 10.5684731418
+杀头 9.66657114738
+海之滨 10.604840786
+素酒 11.5027823792
+广电网 13.900677652
+劳动生产率 8.58747167293
+矿石 8.15128466607
+河底 10.2371160058
+旌旗蔽日 11.9547675029
+浇铸法 13.2075304714
+丁道衡 13.2075304714
+韩蕲王 13.2075304714
+军旅 9.69598503258
+测云仪 13.900677652
+参照系 11.3357282945
+除灾 13.2075304714
+失足 10.3171587135
+日暖 11.2616203224
+袖珍型 12.8020653633
+套下去 13.900677652
+清道夫 11.5027823792
+艰难 7.05799436974
+乞灵 12.1089181827
+平儿来 11.5027823792
+陈紫 12.8020653633
+直航 10.642581114
+韦伊塞 12.5143832909
+琴书 10.7226238216
+江厦 11.5027823792
+四街 12.1089181827
+境地 7.84155445639
+格雷 9.80633308975
+福如东海 12.8020653633
+张建华 13.2075304714
+挟天子以 13.2075304714
+半壁店 13.2075304714
+鸟类学 12.2912397395
+粤绣 12.1089181827
+伏惟力 13.900677652
+颜谋衍 13.2075304714
+为时不远 11.5027823792
+大陆法系 10.2630914922
+刘先生 9.28555713513
+变音器 13.900677652
+吴伯雄 13.900677652
+探究行为 13.900677652
+拉尼 10.604840786
+卫报 10.765183436
+卫护 11.4157710022
+枕套 11.3357282945
+狄奥 12.8020653633
+秸秆 10.1630080337
+直至 6.75469318426
+子伍尚 13.2075304714
+伏卧 11.7034530746
+国庆日 11.8212361103
+英亩 8.85082164473
+于洪区 13.900677652
+吉田精 13.2075304714
+邦板牙 13.900677652
+虎杖 13.900677652
+奇姆肯特 13.2075304714
+跨出 9.5062284973
+石南 12.1089181827
+礼泉县 12.5143832909
+巧玲 9.30555780184
+残花败柳 12.8020653633
+枕头 8.28027678626
+承奉太监 13.2075304714
+威尔逊 9.20019728618
+都昌县 12.2912397395
+急转 10.7226238216
+破衣烂衫 11.1280889297
+猜谜语 12.5143832909
+磷化锌 13.2075304714
+拉屎 9.63799777493
+兜住 11.0103058941
+黼黻文章 13.900677652
+隶农制 12.5143832909
+环湖公路 13.900677652
+屏山 11.4157710022
+丘鹤俦 13.2075304714
+古里古怪 12.2912397395
+于景德 12.5143832909
+二百二十余万 13.2075304714
+进球数 12.5143832909
+全疆 10.604840786
+史政 12.8020653633
+执意不从 12.1089181827
+因斯布鲁克 12.2912397395
+陈纪 11.8212361103
+拘留证 13.2075304714
+小老头 11.4157710022
+格坚皇帝 13.2075304714
+认不得 9.89334446674
+陈红 12.8020653633
+抽象画 13.2075304714
+失踪 8.18036587537
+巨葛庄 12.5143832909
+迪南 10.1630080337
+桌面 9.32596667347
+河州 10.2897597393
+河川 8.99540287354
+监察局 11.1280889297
+后弘期 11.9547675029
+政协全国委员会 11.1926274509
+英东 12.8020653633
+卫戍 10.9562386728
+田贝 13.2075304714
+卫成 13.900677652
+凡间 10.533381822
+自欺欺人 10.2371160058
+息怒 9.20019728618
+陈真 13.900677652
+眼皮子浅 13.900677652
+现况 11.2616203224
+擦写 12.5143832909
+英主 10.3743171274
+梅江区 13.2075304714
+贾政正 12.5143832909
+锌钡白 13.2075304714
+英两 12.5143832909
+乌龙球 13.900677652
+阅兵 8.75901409547
+谷神 12.8020653633
+于大龙 9.89334446674
+锁匙 12.2912397395
+合璧 12.1089181827
+河工 10.4349417492
+跨年度 8.05713323494
+卫所 9.71102290995
+精神创伤 10.9049453784
+田赛 12.1089181827
+擦出 13.2075304714
+法洛斯 11.7034530746
+史料 7.70423352418
+三万余 10.8096351986
+古古怪怪 13.900677652
+阴君 12.8020653633
+吁气 12.8020653633
+伯利兹 10.5684731418
+史斌 12.8020653633
+割舍 9.87532596124
+机器人学 13.900677652
+绝美 11.7034530746
+刘猛 12.8020653633
+跨入 9.62401153296
+南明桂 12.5143832909
+伯利克 13.900677652
+松萝 11.8212361103
+拜师学艺 12.2912397395
+百兽率舞 13.2075304714
+请益 13.2075304714
+宣湖 12.5143832909
+擦净 11.0674643079
+读懂 10.4349417492
+转投资 13.900677652
+东南汽车 10.7226238216
+麻痹大意 10.3171587135
+煸炒 12.2912397395
+合瓣 11.2616203224
+一柱擎天 13.900677652
+幼嘉 12.8020653633
+过荣府 12.5143832909
+布伦坦诺 11.9547675029
+狠辣 11.3357282945
+松藻 13.2075304714
+光阴如箭 13.900677652
+参考模型 12.1089181827
+居国相 13.2075304714
+柯棣华 11.8212361103
+尊姓大名 11.3357282945
+造舆论 11.1926274509
+陈翔 12.2912397395
+北苏门答腊 13.900677652
+爱克哈 13.2075304714
+歌儿 10.3743171274
+江充 13.900677652
+怕苦 12.2912397395
+陈德娃 12.8020653633
+鬼子兵 13.900677652
+军服 9.56994431169
+周天子 10.1164880181
+花花太岁 11.8212361103
+庸常 12.5143832909
+万木林 12.8020653633
+邀约 10.5684731418
+鸟人 11.1280889297
+总参 11.3357282945
+军机 9.13850371718
+河山 10.6818018271
+遗产税 10.5684731418
+三万人 10.4041700905
+回传球 13.900677652
+宁顺 13.900677652
+帕塔 11.9547675029
+合用 9.77354326693
+孙良诚 13.900677652
+胡尔奇 13.900677652
+小旦 10.4041700905
+允许 6.41350395776
+陈翠 13.2075304714
+三万亩 12.5143832909
+陈翥 12.5143832909
+蛇毒 10.765183436
+现做 11.9547675029
+卡普斯 12.8020653633
+曹爷 12.8020653633
+缝做 13.2075304714
+军权 9.94943393339
+近几天来 10.765183436
+失着 13.2075304714
+与日俱增 9.72629038208
+胡萝卜素 9.20932976975
+丰饶 10.604840786
+英俊 8.73019365694
+蒙戈尔 13.900677652
+三万件 13.900677652
+笛声 9.54396882529
+谢氏功 13.2075304714
+龙君 11.9547675029
+空军一号 11.5027823792
+一拍即合 10.6818018271
+许多辆 13.900677652
+海内外 8.81308131674
+秋试 12.8020653633
+桂林地区 11.7034530746
+文物部门 11.0674643079
+允诺 9.75754292558
+索金帛 13.2075304714
+直肠 9.58318953844
+药械 13.900677652
+屈一膝 12.8020653633
+磷化铟 12.2912397395
+经费支出 13.2075304714
+人造冠 13.2075304714
+别耶夫 13.2075304714
+英伟 11.8212361103
+奥巴桑乔 13.900677652
+路南彝族自治县 12.8020653633
+胡吣 12.5143832909
+杨齐宣 13.2075304714
+悠悠万事 13.2075304714
+史治 13.900677652
+贫困人口 10.2897597393
+割草 10.4666904475
+爱尔 8.18364995057
+梅伊曼 13.900677652
+向慕 12.2912397395
+田谷 13.900677652
+失迷 12.2912397395
+镜花 13.2075304714
+三百多米 12.8020653633
+恢复 5.34330267093
+菲奥雷 13.2075304714
+黑又静 13.900677652
+商务签证 10.2897597393
+皇太极 8.42421410004
+对讲机 11.1926274509
+三万两 10.3453295905
+拍去 13.2075304714
+广告宣传 10.3453295905
+英伦 10.4666904475
+绝续 13.2075304714
+病假条 12.8020653633
+加特纳 13.2075304714
+苏迪曼杯 13.900677652
+长有仪 13.2075304714
+匪贼 12.8020653633
+如期完成 11.0674643079
+非赢利 13.900677652
+北京市教委 13.900677652
+单放 13.2075304714
+反角 11.9547675029
+酵母 9.36807815882
+叶祖奎 13.900677652
+正法眼藏 13.900677652
+官居礼 13.2075304714
+史大妹妹 12.5143832909
+玫瑰露 11.4157710022
+河岸 8.46695564842
+现金管理 10.2371160058
+天安门城楼 10.4994802703
+雷达哨艇 13.900677652
+田豹 11.598092559
+拉巴 12.2912397395
+液晶体 13.900677652
+同仁县 12.1089181827
+起航出海 12.2912397395
+联合战线 12.2912397395
+所示 9.28555713513
+余率军 13.2075304714
+刘累 13.2075304714
+等额 10.3171587135
+有声片 11.5027823792
+九龙坡 12.8020653633
+景县东 13.2075304714
+黑丝布 13.2075304714
+仍用 9.58318953844
+旺季 8.092535162
+照学 13.900677652
+海宴 12.8020653633
+擦伤 10.4666904475
+没教养 12.8020653633
+库锦 13.900677652
+泰镇抚 12.8020653633
+传声 11.9547675029
+陈情 12.5143832909
+海宇 11.8212361103
+二十七日 10.2117981979
+冬暖夏凉 10.3171587135
+过渡政府 11.3357282945
+尚隐 13.900677652
+纳素斯 13.2075304714
+输光 10.8096351986
+海安 10.642581114
+比思敏 13.2075304714
+薛姨娘 12.8020653633
+中层阶级 12.5143832909
+人造丝 10.642581114
+梅家坞 11.1926274509
+这般光景 10.9049453784
+蛋花 12.8020653633
+第五名 10.2897597393
+龙吼 13.900677652
+小玩意 11.8212361103
+扬长避短 11.1926274509
+悬崖勒马 10.765183436
+跑跑跳跳 12.8020653633
+兜兜 11.1926274509
+锥体细胞 12.2912397395
+失速 11.4157710022
+天随子 13.900677652
+锅碗瓢盆 11.5027823792
+伊斯兰教历 11.4157710022
+江上 9.87532596124
+相互理解 11.598092559
+海寇 12.1089181827
+江丽 13.900677652
+兜兰 13.2075304714
+托雷斯 11.4157710022
+潘诺尼 12.5143832909
+朱栏白 13.900677652
+海富 12.1089181827
+琴台 12.5143832909
+江丰 11.9547675029
+由礼亲王 13.900677652
+崭然 13.900677652
+争购 12.2912397395
+全才 11.7034530746
+全所 13.2075304714
+明晓得 12.2912397395
+吐露出 12.5143832909
+山良价 13.2075304714
+莱斯特郡 13.2075304714
+台网 12.2912397395
+球棍 13.900677652
+阳子则 13.2075304714
+松驰 11.0103058941
+逆臣 12.1089181827
+露一手 11.1280889297
+很少 6.21497459074
+验布机 13.900677652
+黏稠 10.6818018271
+诡称 11.2616203224
+很小 6.92432958153
+石安 12.8020653633
+锺离 11.9547675029
+水渍险 12.2912397395
+拱手而降 13.900677652
+指纹学 12.2912397395
+九龙城 12.2912397395
+沙大环 11.5027823792
+渡到 12.5143832909
+秸杆 12.8020653633
+尚难 9.7898037878
+街头 7.87723005901
+谷村 12.2912397395
+扭角羚 10.533381822
+采集者 10.7226238216
+买得 10.6818018271
+全拼 13.900677652
+陈思 12.2912397395
+戴季陶 12.1089181827
+承郡王 11.598092559
+工务 12.1089181827
+称称 13.2075304714
+江云 13.900677652
+大放悲声 11.4157710022
+乳浊剂 13.900677652
+三万元 11.2616203224
+生旦 12.2912397395
+陈怀 13.2075304714
+热情关怀 13.2075304714
+政治面目 13.2075304714
+熊心豹子 11.8212361103
+团组 12.5143832909
+陈总 10.9049453784
+扯进来 12.1089181827
+团练 9.61021821083
+照实 10.2117981979
+明如镜 11.9547675029
+宜守宜 12.8020653633
+拍号 13.2075304714
+哈马杰 13.900677652
+博物馆 6.99092437033
+第五品 12.5143832909
+草酸钙 11.4157710022
+近体诗 10.604840786
+海子 10.2630914922
+汇款人 12.8020653633
+金属加工 9.5186510173
+照完 12.2912397395
+职工收入 12.2912397395
+问心有愧 12.8020653633
+英文名字 11.8212361103
+现丑 12.2912397395
+现世 9.98865464655
+滨县 12.1089181827
+英军 8.11685246965
+殚力 12.8020653633
+羞愧难当 11.4157710022
+第一一七回 13.2075304714
+董家村 12.8020653633
+陈懋 13.900677652
+作古正经 13.900677652
+旅美 11.3357282945
+赝品 10.8096351986
+卫生设施 11.8212361103
+马利翁 12.5143832909
+五六分 12.8020653633
+现下 10.533381822
+石鼓文 11.5027823792
+木工活 12.5143832909
+冥钱 12.8020653633
+绝恋 13.900677652
+缝上 11.1280889297
+三陪女 13.2075304714
+宫崎滔天 13.900677652
+文件名 9.48183704418
+现为 8.40350942668
+林伟民 13.900677652
+嫁妆 9.82314020807
+史狗 13.900677652
+白云苍狗 12.2912397395
+吉木萨尔县 12.8020653633
+沙丁 12.8020653633
+合欢 9.96885201925
+咸宁市 11.9547675029
+缝个 13.900677652
+换零钱 13.2075304714
+艾约瑟 12.8020653633
+工匠 7.87965430263
+爱家乡 13.900677652
+顶好 11.0103058941
+结尾处 11.598092559
+高气压区 13.2075304714
+泌阳 11.598092559
+工区 11.8212361103
+赤色 10.765183436
+正九品 11.7034530746
+现买 12.5143832909
+随乡入乡 13.2075304714
+家丑不可外扬 11.5027823792
+孙乾见 13.2075304714
+孔雀蓝 12.8020653633
+史稿 11.5027823792
+王山 11.8212361103
+尤溪县 12.2912397395
+屏东县 11.2616203224
+很差 9.36807815882
+垂危 10.4666904475
+沈括 9.96885201925
+奉为至宝 13.2075304714
+幽灵公主 13.900677652
+初露锋芒 12.2912397395
+震天 9.33632946051
+组织系统 10.3171587135
+迪戈加 13.2075304714
+民办大学 13.900677652
+陕西梆子 13.2075304714
+柿园 13.2075304714
+袁护国 11.9547675029
+绝情 10.4349417492
+全推 11.4157710022
+于心何忍 12.2912397395
+老两口 9.14708746087
+现予 12.2912397395
+金钱美女 13.900677652
+失重 10.3453295905
+擦亮 11.598092559
+跨业 12.8020653633
+耶鲁 11.2616203224
+探测车 13.2075304714
+赤芍 11.1280889297
+工友 10.0940151622
+好几辈子 13.2075304714
+南京政治学院 13.900677652
+跨上 9.48183704418
+鲜明立场 13.900677652
+太阳伞 12.8020653633
+血凝素 13.2075304714
+询问笔录 11.1926274509
+抒情歌曲 12.1089181827
+徇情枉法 12.5143832909
+适逢其时 13.2075304714
+陈慧 11.1926274509
+二百三十万户 13.2075304714
+乙酉两次 13.900677652
+煽诱 13.2075304714
+溶斗 12.1089181827
+缝隙连接 12.8020653633
+白居谢 13.2075304714
+刘别谦 12.2912397395
+所服 11.7034530746
+酌收 13.2075304714
+柱础 11.9547675029
+党委委员 10.3743171274
+埃及共和国 12.8020653633
+外弛内张 13.900677652
+维尔和 13.2075304714
+现今 7.8604229407
+乞求 9.21854642485
+阅世 13.900677652
+冯素弗 12.5143832909
+军种 8.73589167805
+反馈作用 12.2912397395
+姗姗来迟 10.3743171274
+现价 9.62401153296
+水漫金山 11.5027823792
+读给 12.1089181827
+谷昌 12.8020653633
+现址 10.8561552143
+纪中 13.900677652
+工厂 6.30428534791
+汗腺炎 12.8020653633
+现代 5.48441037915
+冲冲喜 12.8020653633
+陈留郡 12.5143832909
+沈扬 12.8020653633
+莱比锡 8.9102450652
+春花秋月 11.7034530746
+读经 10.3453295905
+散见 11.1926274509
+慧黠 12.8020653633
+全总 12.2912397395
+私密性 12.2912397395
+读来 10.9049453784
+冰凉凉 13.900677652
+矿样 13.2075304714
+北京军区政治部 13.2075304714
+周孔之 13.2075304714
+希伯来文 11.4157710022
+专属性 12.8020653633
+随机振动 11.8212361103
+向天飞 13.900677652
+默克尔 11.0674643079
+南行镇 13.2075304714
+卫红 10.604840786
+贲然 13.900677652
+地质师 13.900677652
+合格 7.19871728597
+省委常委 9.08039608637
+回吐 8.55357012126
+惟独 8.9519177616
+赤脚 9.58318953844
+邦达连科 13.900677652
+松风 12.5143832909
+牛仙客 12.8020653633
+蛇皮 11.1926274509
+玉体 11.2616203224
+合校 13.2075304714
+偏室 12.2912397395
+充足 6.97213983381
+冠绝 11.598092559
+监场 13.2075304714
+陈抟 11.4157710022
+旺夫 12.8020653633
+大吵大闹 10.9562386728
+静平衡 11.9547675029
+秋雨 9.84023464143
+奥体中心 11.9547675029
+虎符 10.604840786
+雀儿山 11.3357282945
+残害 9.17328983326
+中曾根 12.8020653633
+黑白影片 13.2075304714
+解放运动 9.32596667347
+全息 10.2897597393
+英勇 8.1608847398
+世纪之交 10.3453295905
+厚朴花 13.2075304714
+田里 9.37888907493
+日月如流 13.900677652
+回合 8.42421410004
+秦沛 13.900677652
+脑满肠肥 11.9547675029
+晒成 11.598092559
+伍肃 12.8020653633
+唐汴州 12.1089181827
+侨居海外 12.5143832909
+一清二白 12.1089181827
+割麦 11.2616203224
+克特西 12.8020653633
+持家 11.4157710022
+粘液 8.87023973058
+山大王 11.7034530746
+台中师范 13.900677652
+卫绾 12.8020653633
+龙喜 12.5143832909
+海大 11.1280889297
+教材内容 12.8020653633
+车盖亭 13.2075304714
+粮食作物 8.28390655431
+别试 13.900677652
+悬赏缉拿 12.8020653633
+余志回 12.8020653633
+说破嘴 13.900677652
+记分牌 13.2075304714
+海天 10.4994802703
+抖下来 13.2075304714
+秋阳 12.2912397395
+维尔城 13.2075304714
+核动力 8.9519177616
+傅二 13.900677652
+农户家 12.1089181827
+争过 12.5143832909
+琴儿 12.5143832909
+特遣舰队 13.900677652
+史称 7.69208762588
+陈承 13.900677652
+英制 11.0674643079
+浏阳 9.59661255877
+好彩头 12.5143832909
+三万匹 12.8020653633
+乳头 8.84443184663
+海外 5.85733548153
+普朗坦 13.2075304714
+蒙得维的亚 10.8561552143
+块石 11.7034530746
+加勒比海 8.92394390956
+细针密缕 13.2075304714
+战略目标 8.83177344976
+残存 8.43261751084
+计算机用户 12.2912397395
+服务公司 9.62401153296
+糖蜜 11.0674643079
+摔掉 11.8212361103
+股市行情 10.1164880181
+罐笼 11.4157710022
+争辉 11.598092559
+陈戈 10.9562386728
+毕政委 12.1089181827
+医药行业 8.99540287354
+伏侍宝玉 12.2912397395
+淮河 7.90422556336
+危之士 12.8020653633
+白瓷缸 13.2075304714
+一些场次 13.900677652
+很广 8.42003872863
+张大白 13.2075304714
+厦门经济特区 12.2912397395
+一股风 10.6818018271
+争辩 8.68574189437
+争辨 12.1089181827
+廉见连 13.900677652
+矿棉 13.900677652
+武王弟 13.2075304714
+游上来 13.900677652
+班清 12.2912397395
+田邑 12.8020653633
+那参领 12.2912397395
+第五场 12.8020653633
+李孝聪 12.5143832909
+很得 11.1926274509
+马恩列斯 12.5143832909
+胡猜乱想 12.5143832909
+郑重声明 11.5027823792
+粉蝶儿 13.2075304714
+工兵 8.00903344015
+丰台区 11.0674643079
+工具 6.11745363564
+伊宁市 11.0103058941
+王尹 12.8020653633
+造孽 10.1630080337
+害死 9.30555780184
+济世安民 13.900677652
+热分解 10.604840786
+边境地区 9.54396882529
+万烟谷 12.8020653633
+怕黑 11.2616203224
+火烧沟 12.8020653633
+全愈 12.8020653633
+人手一册 11.7034530746
+造字 10.6818018271
+工党 9.33632946051
+扈太公 12.8020653633
+唯恐天下 11.9547675029
+变线 11.8212361103
+虹彩 11.7034530746
+很忙 9.65218240993
+维尔纽斯 11.5027823792
+金天辅 13.2075304714
+殒身 12.2912397395
+王封 11.8212361103
+住院医师 12.5143832909
+绝秘 13.900677652
+一仍其旧 12.5143832909
+国际联运 12.5143832909
+陈豫安 11.8212361103
+伊戈尔 10.9562386728
+虹影 13.900677652
+彭司令 12.2912397395
+所料 9.31571017331
+骨度 13.2075304714
+山猫 10.0294766411
+垂入 12.8020653633
+绝户 11.2616203224
+第五块 11.7034530746
+壶嘴 11.1926274509
+旺堆 12.1089181827
+商归周 12.8020653633
+裘德 13.900677652
+很快 5.67597809001
+篮球比赛 11.598092559
+斯培西亚 12.5143832909
+搏击 10.1630080337
+于开皇 12.2912397395
+勃朗宁 11.4157710022
+王庄划 13.2075304714
+画虎不成反类犬 13.900677652
+镀层 11.1926274509
+关学曾 13.900677652
+海堤 10.642581114
+松饼 13.900677652
+越多越 11.1280889297
+从无到有 9.87532596124
+小字报 11.1280889297
+数千米 10.642581114
+联络部 10.9562386728
+于四府 12.8020653633
+绝招 10.0294766411
+岐江 13.900677652
+习惯线 13.2075304714
+绿野仙踪 12.1089181827
+蠕虫 9.75754292558
+布绒 13.2075304714
+目无三尺 13.900677652
+冠心病 9.02548032877
+枢密使 9.16447920358
+古斯塔 13.2075304714
+很强 7.5411037833
+中国史纲 11.598092559
+药引子 11.598092559
+皮泽蒂 12.8020653633
+牵牛 10.1630080337
+鲁山县 10.8096351986
+很弱 9.5186510173
+底土 10.6818018271
+后怕虎 13.2075304714
+联合公报 10.7226238216
+军管 10.6818018271
+枉自 10.1164880181
+照壁 10.0505300503
+安谋克 11.0674643079
+分析天平 12.5143832909
+秋霜 10.8561552143
+广西北海 11.5027823792
+戴原礼 13.2075304714
+孰料 11.1926274509
+盲从者 13.900677652
+述怀 12.2912397395
+绝技 9.82314020807
+工况 11.3357282945
+拉玛坚 13.900677652
+穷凶极恶 10.4994802703
+英华 9.69598503258
+赤背 13.900677652
+登山包 12.5143832909
+震害 12.5143832909
+马蒂琴 13.2075304714
+城郊区 13.900677652
+马桥镇 12.8020653633
+五英里 11.9547675029
+责成 9.72629038208
+照墙 13.900677652
+紧缩性 10.1630080337
+工农 8.57766767284
+方山县 12.8020653633
+蓝净法 13.2075304714
+陈振 10.642581114
+海塞 12.1089181827
+海塘 10.3171587135
+腹诽 11.3357282945
+平淡 8.44109213783
+袖珍书 13.900677652
+麦克莱伦 13.900677652
+族群 10.4994802703
+陷身 12.1089181827
+沈林 13.900677652
+扯皮拉筋 13.2075304714
+海德 11.1926274509
+仍然 5.03508365307
+淖尔 11.0103058941
+全是 6.84709192478
+叫苦叫累 13.900677652
+四百多米 13.2075304714
+矿渣 10.9562386728
+照录 11.9547675029
+酌情 9.69598503258
+木希典 13.2075304714
+霍禹 13.2075304714
+赞皇县 12.2912397395
+春花秋实 13.900677652
+保圣寺 12.5143832909
+连成五 13.900677652
+兜售 9.87532596124
+争荣夸耀 13.900677652
+数千篇 13.2075304714
+从汉仪 12.8020653633
+单于争立 12.8020653633
+仍照 11.8212361103
+海石花 11.0103058941
+蜂鸣器 13.2075304714
+斯威士 12.1089181827
+沈某 12.5143832909
+马二世 12.2912397395
+任京兆 13.2075304714
+造就 8.18036587537
+全景 8.51160592216
+擒纵机构 12.2912397395
+里出外进 13.2075304714
+军籍 10.3171587135
+绝收 11.9547675029
+请求 7.11509000697
+新游戏 12.8020653633
+秋郊 12.2912397395
+形容憔悴 12.1089181827
+着丝点 12.5143832909
+一切办法 10.2117981979
+全晋 11.4157710022
+氯硝柳胺 12.5143832909
+酗酒闹事 13.900677652
+黏结 13.900677652
+别讨 12.8020653633
+王念 12.8020653633
+澡池 13.2075304714
+狗牯脑 12.8020653633
+南京路 10.5684731418
+广发 7.5515386606
+水文 8.11071748108
+舆论导向 11.5027823792
+绘成 10.642581114
+松鹤 11.8212361103
+普朗克 9.46986085313
+田露 13.900677652
+别讲 13.2075304714
+一百二十万两 13.2075304714
+生逢其 12.8020653633
+矿源 11.7034530746
+东莞 8.20358416547
+别记 13.2075304714
+词曲创作 13.900677652
+绝无 9.04864738806
+软心肠 12.5143832909
+英吨 13.2075304714
+绝早 11.8212361103
+军粮 8.84443184663
+骑射 9.06439574502
+田青 13.900677652
+团章 13.900677652
+差远了 10.8561552143
+艰辛 8.96620371885
+骨头 7.71859274526
+三锅 12.5143832909
+马南蒂 13.900677652
+贵溪冶炼厂 12.8020653633
+啃食 12.1089181827
+叶原基 12.1089181827
+九龙县 13.900677652
+青藏线 13.900677652
+松鸡 11.1280889297
+喉风 13.2075304714
+十几匹 11.7034530746
+照得 8.79473217808
+戈亚斯州 12.5143832909
+空洞地 13.900677652
+买家 8.04560572977
+房产交易 11.7034530746
+国奥队 11.8212361103
+塞莱斯 12.2912397395
+了若指掌 10.8561552143
+田面 12.1089181827
+七楼 11.3357282945
+沈杨 13.900677652
+海归 11.1926274509
+照征 12.8020653633
+走台 13.900677652
+张金称 12.8020653633
+法朗 12.1089181827
+乾脆 13.900677652
+全机 12.5143832909
+剩余劳动力 10.6818018271
+熊谷 13.900677652
+高中低档 12.5143832909
+格泰姆 11.9547675029
+东涂西抹 13.900677652
+台站 10.3743171274
+读稿 13.900677652
+合演 11.1280889297
+六日电 13.900677652
+所提 10.3743171274
+浦起龙 12.8020653633
+全本 10.9562386728
+包办婚姻 10.533381822
+戴罗格 13.2075304714
+奸污 11.3357282945
+法服 13.2075304714
+涂梢苑 12.2912397395
+格氏试剂 10.9562386728
+军事学 10.6818018271
+赫茨尔 12.8020653633
+海床 10.9562386728
+乌垒城 11.2616203224
+西瓜子 12.8020653633
+海底 7.17564400981
+密匝匝 11.598092559
+己亥 13.900677652
+陈旭 12.2912397395
+争衡 11.4157710022
+巧用 10.4349417492
+台端 12.1089181827
+曹建明 13.900677652
+循环小数 11.9547675029
+三岔路 13.2075304714
+段长度 13.2075304714
+刘小姐 11.598092559
+二千匹 13.900677652
+嫁娶 10.765183436
+照常 9.41204128224
+全站 12.1089181827
+陈斌 13.2075304714
+工场 7.93453091285
+公检法 10.9562386728
+工地 8.12923652885
+镐京 10.4994802703
+获奖者 9.80633308975
+鉴定考试 13.900677652
+陈方 13.900677652
+须德海 13.2075304714
+老病号 12.5143832909
+国太平 12.8020653633
+班班 12.5143832909
+阿拉伯数字 10.5684731418
+陈新 11.5027823792
+经济合同 10.6818018271
+旺市 12.5143832909
+秋里 11.7034530746
+第五元 13.2075304714
+半透明 9.15574552361
+全权 9.02548032877
+巡逻骑兵 12.2912397395
+陷进 10.1871055853
+跨坐 13.900677652
+百里 9.00283785202
+很多 4.85828267085
+海带 9.00283785202
+很够 12.8020653633
+臼齿 9.63799777493
+求教于 12.1089181827
+敞开 8.5488195185
+陈敏 11.9547675029
+函馆 11.4157710022
+解救出来 10.7226238216
+就行了 7.93197009199
+赠书 11.9547675029
+三万名 12.8020653633
+熔渣 12.5143832909
+朱栏玉 13.2075304714
+史董元 12.8020653633
+田阳 12.1089181827
+金田村 11.3357282945
+海市 11.1280889297
+批评性 12.8020653633
+骨塔 12.2912397395
+低音长号 12.8020653633
+思乡曲 13.900677652
+残屑 12.5143832909
+卡普罗 13.900677652
+霍维华 13.900677652
+陈敬 12.1089181827
+脉象 9.93038573842
+布线 11.4157710022
+滚出来 10.642581114
+失闪 12.5143832909
+南森采 12.5143832909
+很大 5.09996102326
+裁为 13.2075304714
+从先 13.900677652
+所持 7.48885938427
+所指 8.52539924429
+桃溪 12.2912397395
+望着她 9.10488710638
+曹洞宗 12.2912397395
+喝进 11.8212361103
+老队员 13.900677652
+莺啼 11.4157710022
+照度 11.1926274509
+史纂 12.5143832909
+英商 9.75754292558
+松鼠 9.43476953332
+乌马儿 13.2075304714
+希拉克 10.6818018271
+科研部 12.2912397395
+亲爱 8.24818847171
+沈智 13.2075304714
+照应 8.75901409547
+基金业 7.73736284794
+晒斑 12.8020653633
+史纲 11.1926274509
+八旗子弟 10.9562386728
+一九五七年 11.1280889297
+小牛肉 12.8020653633
+沈晨 13.900677652
+己卯 12.2912397395
+风景区 7.93709830836
+田陪 12.8020653633
+王和定 13.2075304714
+向明 12.1089181827
+暗探 11.7034530746
+缩略语 12.8020653633
+德尔河 13.900677652
+第十一条 10.9562386728
+孙怡云 13.2075304714
+拍手歌 13.900677652
+水文过程 13.900677652
+长年累月 10.8096351986
+震幅 11.2616203224
+绝杀 12.8020653633
+主桥墩 13.2075304714
+田宏遇 11.8212361103
+西向东 9.18217878068
+粤曲 11.9547675029
+罪上加罪 11.7034530746
+喹诺酮 12.2912397395
+林兄弟 13.900677652
+二万多 11.4157710022
+失陷 8.64840422393
+原油价格 8.092535162
+努得 12.8020653633
+宵旰 13.2075304714
+残忍 8.63798746307
+买好 9.96885201925
+所想 10.0940151622
+埃斯特拉达 13.900677652
+台秤 12.8020653633
+数千种 11.8212361103
+失陪 10.8561552143
+陈曦 13.2075304714
+银输纳 13.2075304714
+黄巾张 12.8020653633
+强敌 9.23723855786
+干之子 13.2075304714
+合江 10.9562386728
+一两支 13.2075304714
+绝望 7.44705265308
+终南 12.2912397395
+直馏 12.8020653633
+狄德金 13.900677652
+喜德县 13.900677652
+故作不知 12.8020653633
+原贤二 12.1089181827
+陈暄 13.2075304714
+保税仓库 12.8020653633
+预售证 11.2616203224
+三百多方 13.2075304714
+造币 10.8096351986
+黏糊 12.2912397395
+田间 8.89673134603
+英国 5.02636961339
+乐之境 13.900677652
+形状知觉 13.900677652
+海州 10.3171587135
+抽象派 12.5143832909
+文学艺术 9.30555780184
+马蹄表 11.8212361103
+松鱼 13.900677652
+南海县人 12.8020653633
+矿油 13.2075304714
+陈晓 9.96885201925
+无坚不摧 11.598092559
+暗褐 11.3357282945
+陈晖 13.900677652
+小灌丛 12.2912397395
+陷谷 12.8020653633
+各取所需 10.9562386728
+波浪理论 11.0674643079
+真名实姓 13.2075304714
+蹲下去 10.533381822
+岩性 9.29550746599
+加特林 11.598092559
+陈智 11.5027823792
+骨子 11.5027823792
+羊皮纸 11.3357282945
+垒墙 12.2912397395
+玉佩 10.2117981979
+直饮 12.5143832909
+东鱼河 13.2075304714
+陈晨 12.1089181827
+契约式 12.5143832909
+所恶 11.9547675029
+陈景 11.1280889297
+一伙儿 11.7034530746
+军纪 8.47133202302
+落魄不偶 13.900677652
+三万块 13.900677652
+塔克尔 12.8020653633
+陈星 9.44633035572
+微操作 13.2075304714
+军统 10.2897597393
+田镜 12.8020653633
+合法 7.25819085061
+陈昊 12.2912397395
+残弱 13.900677652
+陈明 10.604840786
+田镇 12.8020653633
+壮观霉素 13.900677652
+马五子 11.8212361103
+矿泥 13.2075304714
+泛美航空 11.8212361103
+黏米 13.900677652
+受降仪式 12.2912397395
+狺狺狂吠 13.2075304714
+所思 11.0103058941
+读秒 12.5143832909
+背景音乐 12.1089181827
+争论 7.33259974056
+争讼 11.2616203224
+四十二条 13.2075304714
+合营企业 10.604840786
+脸红耳赤 11.9547675029
+尖晶石 10.9562386728
+不相称 9.91169360541
+很尖 13.2075304714
+家庭成员 9.55687223012
+妄称 11.9547675029
+矿泉 10.3171587135
+争议 7.35389224122
+奉此 12.5143832909
+造府 12.5143832909
+哈加尔 13.900677652
+造形 11.1926274509
+全攻 13.900677652
+读破 12.8020653633
+陈某 9.89334446674
+海岬 11.598092559
+海岩 13.900677652
+烘青 11.8212361103
+造影 9.24671730182
+胡载里 12.8020653633
+海岱 12.5143832909
+史籍 8.59737274392
+闻邓艾 12.8020653633
+蛇王 12.2912397395
+只许成功 11.8212361103
+海岸 7.13333452671
+矿洞 11.4157710022
+汉土 12.8020653633
+读研 12.5143832909
+小肚鸡肠 12.2912397395
+长斋绣佛 13.900677652
+工商 8.06879517469
+十余次 11.3357282945
+下不了台 10.604840786
+免费发 13.900677652
+差分法 11.598092559
+四十余里 11.9547675029
+地相异 13.2075304714
+中华轿车 10.533381822
+统销 12.5143832909
+海岛 8.85725253506
+玉厚哥 12.2912397395
+圆环状 12.8020653633
+秦叔宝 11.5027823792
+第五卷 9.45802639549
+海峡 7.46934657004
+凯旋归来 11.7034530746
+全数 9.46986085313
+陈林 11.598092559
+贾元春 12.1089181827
+毛细孔 13.2075304714
+房地契 13.900677652
+很富 13.900677652
+布署 11.9547675029
+充裕 7.30900391997
+全散 11.8212361103
+合流 9.44633035572
+毕乐 12.8020653633
+调三惑四 13.900677652
+颁发 7.73106691948
+擢升 9.85762638414
+教员 8.69119149913
+十余步 12.5143832909
+就此打住 12.1089181827
+乳峰 11.7034530746
+红通通 11.3357282945
+第五十 11.7034530746
+照射 7.91674137129
+黔驴之技 13.900677652
+国家计划生育委员会 12.8020653633
+当爱已 13.900677652
+张辰 13.900677652
+矿浆 13.900677652
+残废 9.4233408375
+二十七所 13.2075304714
+季末 8.56795885871
+车前 9.56994431169
+禄丰县 11.5027823792
+全新 7.33119623156
+陈村 11.1926274509
+日月如梭 13.2075304714
+五笔字型 11.7034530746
+达尔罕茂明安联合旗 12.1089181827
+白齿 12.8020653633
+闲人 9.24671730182
+小绍兴 13.900677652
+分别独立 11.1926274509
+证券部 10.2371160058
+拉孜 11.8212361103
+买壳 12.5143832909
+失音 12.2912397395
+变异系数 11.3357282945
+火炬计划 11.7034530746
+直须 12.2912397395
+盛元宝 12.5143832909
+孔雀舞 12.1089181827
+陈杰 12.5143832909
+持平 7.38893232233
+海尔 8.80081122415
+设计方案 9.77354326693
+泰米尔语 11.1926274509
+明城墙 12.8020653633
+俞良甫 13.2075304714
+全文 8.22392384971
+蹦出来 10.8561552143
+茫然若失 11.1280889297
+谐音 9.80633308975
+第五号 13.2075304714
+朝鲜民主主义人民共和国 10.0505300503
+冕宁县 10.8561552143
+陈朝 10.4349417492
+硬盘分区 13.900677652
+全时 10.3453295905
+充血 9.11318590919
+残席 12.2912397395
+虎纹 11.7034530746
+族类 11.4157710022
+第五句 13.2075304714
+马略特 12.8020653633
+全无 8.48457724977
+技术成果 10.8096351986
+所感 10.8096351986
+熔池 13.2075304714
+全日 8.45825994145
+现场感 13.900677652
+可的松 12.1089181827
+息票 11.9547675029
+火焰喷射器 11.2616203224
+乳山 11.3357282945
+陈朱 13.900677652
+坦率地 9.77354326693
+古齿 13.900677652
+块状 8.63281949291
+马屁精 12.1089181827
+尉缭 10.3453295905
+全族 11.4157710022
+太平洋区 11.2616203224
+维尔加 12.1089181827
+所愿 9.7898037878
+矿房 13.900677652
+云影 12.1089181827
+资本运作 9.10488710638
+合成 6.89943202991
+直射光 13.2075304714
+拖延时间 11.0103058941
+在水一方 12.2912397395
+中国国际航空公司 11.9547675029
+毕宿五 11.598092559
+歪过来 13.900677652
+总务部 10.8561552143
+宝斐 11.598092559
+硝铵 12.8020653633
+班级 9.59661255877
+保健茶 13.2075304714
+历代帝王 9.89334446674
+琴家 11.598092559
+向盛 13.2075304714
+中后期 9.02548032877
+思南路 13.900677652
+直音 12.5143832909
+皮试 10.8096351986
+敝旧 12.2912397395
+陈森 13.900677652
+绒头绳 13.2075304714
+海原 10.533381822
+班线 11.7034530746
+特佩特 13.2075304714
+马赫数 10.4041700905
+班组 10.5684731418
+金辽 12.5143832909
+裸岩 11.2616203224
+海口 8.21370229564
+电信业务 11.598092559
+着丝粒 12.2912397395
+一个五六岁 13.2075304714
+怒容满面 13.900677652
+害怕 6.43502234184
+残冬 11.7034530746
+犯罪学 11.0674643079
+翻来覆去 9.46986085313
+成果展 12.1089181827
+草桥 10.9562386728
+广平县 13.2075304714
+华胥氏 12.5143832909
+别洛韦日 12.8020653633
+碳酸氢铵 11.9547675029
+大兴区 12.2912397395
+电瓶车 11.7034530746
+陈梅 12.5143832909
+恺悌 13.900677652
+预加工 12.1089181827
+齐宣 13.900677652
+荀子受 13.2075304714
+海参 8.98802276624
+券种 10.4666904475
+功能强大 11.2616203224
+赵充国 11.3357282945
+第五层 11.4157710022
+读着 10.9562386728
+耽搁 8.0229418702
+军火 8.87023973058
+第五届 8.53470163695
+英士 11.9547675029
+如坐针毡 10.4349417492
+陈梦 11.5027823792
+由朕主 13.2075304714
+窳败 12.2912397395
+尼柯罗 13.900677652
+等速 11.0674643079
+三万多 10.765183436
+吴山越 12.5143832909
+胜之不武 13.2075304714
+开国元勋 10.9049453784
+酵粉 13.900677652
+水利建设 9.6811699468
+残兵 10.1871055853
+直来直往 13.2075304714
+陈桂 11.4157710022
+桌腿 11.8212361103
+李云在 13.900677652
+没头苍蝇 11.0103058941
+遣闷 13.900677652
+海区 8.42003872863
+山谷深 11.9547675029
+秘密活动 10.765183436
+历史沿革 10.533381822
+矩形 9.43476953332
+科斯明斯 12.8020653633
+照发 11.0674643079
+合抱 10.2117981979
+粤桂 11.5027823792
+造像 8.89004235788
+海北 10.3743171274
+海化 11.598092559
+市场竞争 8.37522471284
+正试图 10.7226238216
+陈桢 12.8020653633
+残党 13.900677652
+驼背 9.59661255877
+寿圣院 13.2075304714
+直面 9.91169360541
+旺发 13.900677652
+陈桥 10.642581114
+爱护你 12.5143832909
+发送给 11.4157710022
+宗治平 12.8020653633
+斯拿波 12.2912397395
+海卫 11.7034530746
+蚌埠市 10.9049453784
+脉脉 11.2616203224
+陈栋 13.900677652
+台省 11.0103058941
+父子之情 11.4157710022
+矿物质 8.50705010562
+厚茸茸 13.900677652
+干涉主义 13.2075304714
+鹿回头 11.7034530746
+两面光 12.2912397395
+捏词 13.2075304714
+蒙古语 8.63798746307
+共同理想 12.5143832909
+海协 13.900677652
+北洛河 10.9562386728
+蛇类 10.4349417492
+鲁典吏 13.2075304714
+海南 7.39638947844
+拉玛山 13.2075304714
+叶基常 13.2075304714
+泗阳 11.598092559
+光明之路 13.900677652
+合拢 9.62401153296
+无公害 10.765183436
+桌脚 11.9547675029
+红八军 12.1089181827
+耍花腔 13.900677652
+释教录 13.2075304714
+全款 11.8212361103
+讲求 9.26594866375
+卧铺车 13.900677652
+工学 10.4666904475
+王丹 10.9049453784
+震元 12.8020653633
+闻潮声 13.900677652
+冷冻干燥 12.8020653633
+请愿 9.06439574502
+田骈 13.2075304714
+全欧 11.1926274509
+曹仁领 12.5143832909
+穆郎玛 13.2075304714
+非洲统一 12.5143832909
+荷包蛋 10.3171587135
+庆贺 8.64318227995
+垒土 12.2912397395
+农田灌溉 10.4666904475
+教务主任 11.2616203224
+顺丁橡胶 11.7034530746
+工字 12.5143832909
+酵素 12.1089181827
+普吕东 13.2075304714
+共发射极 13.2075304714
+主桥基 13.900677652
+解放军总后勤部 11.9547675029
+照到 10.2630914922
+隆起带 10.0940151622
+全功能 11.5027823792
+看不上 9.77354326693
+秦高平 12.8020653633
+耳坠子 11.9547675029
+等重 11.9547675029
+等量 9.20932976975
+解像度 13.900677652
+文为诗 12.8020653633
+反攻大陆 11.4157710022
+技术规范 10.604840786
+石巢园 11.3357282945
+奥姆真理教 13.2075304714
+郑家纯 13.2075304714
+禅家 13.900677652
+直隶 8.0746775446
+垒坝 13.900677652
+城市形象 11.4157710022
+英姿 11.0674643079
+女像柱 13.900677652
+气焰嚣张 11.1926274509
+海勒 11.4157710022
+枕上 9.46986085313
+日月合璧 13.2075304714
+才纳 12.8020653633
+领头羊 9.31571017331
+两年制 12.5143832909
+缺氧性 12.5143832909
+杀虫剂 9.66657114738
+蒸饼 11.2616203224
+稷山 11.5027823792
+手机软件 11.598092559
+王式 11.9547675029
+懵懵然 13.2075304714
+洪堡大学 13.2075304714
+海利 11.1280889297
+全段 12.8020653633
+社会党人 10.1394775363
+武王命 12.8020653633
+直陈 10.5684731418
+造出 9.87532596124
+李再雯 12.5143832909
+窟宅 12.2912397395
+分不清 9.27570483869
+卫生 7.38005652442
+三百颗 13.900677652
+神头鬼脸 13.900677652
+弗希特 13.2075304714
+拧上 12.8020653633
+十余斤 13.2075304714
+南柯梦 12.5143832909
+向着 7.97108850859
+装配起来 13.2075304714
+艰苦 8.0229418702
+张大素 13.2075304714
+语气词 12.8020653633
+杜松 11.5027823792
+陈楠 12.5143832909
+两面倒 13.900677652
+伏司繁 12.5143832909
+闭壳龟 12.2912397395
+鳞叶 11.8212361103
+断块山 9.4233408375
+经验教训 8.85082164473
+普济院 13.2075304714
+双辽市 13.900677652
+一辈子 6.81812908262
+子刘聪 13.2075304714
+石英表 12.8020653633
+狄亚 12.8020653633
+英奇 13.900677652
+陈植 12.2912397395
+乳剂 11.0103058941
+致癌物 11.1280889297
+残值 12.1089181827
+色彩感 12.8020653633
+划起来 13.2075304714
+十余日 11.0103058941
+照办 9.72629038208
+蔡益所 10.765183436
+马化龙 13.2075304714
+小平头 12.2912397395
+造册 10.4349417492
+黄伟虎 12.5143832909
+炼铁炉 11.4157710022
+延臣父 13.2075304714
+潇洒风流 13.2075304714
+金棕榈奖 11.9547675029
+木马病毒 12.5143832909
+写起 11.1280889297
+球手 11.9547675029
+全根 13.900677652
+驼色 10.9049453784
+北京商场 13.900677652
+公安段 13.900677652
+海况 11.1280889297
+请戴 12.2912397395
+谷深 10.604840786
+海冰 10.8096351986
+接受投资者 10.9049453784
+南部 5.90301452496
+疏肝解郁 11.598092559
+利润总额 8.58255765813
+天山网 12.8020653633
+王一 11.598092559
+三万家 12.8020653633
+海内 9.24671730182
+资金回笼 10.2630914922
+任征夷 13.2075304714
+保皇兵 12.8020653633
+瑞士人 11.2616203224
+红糖 9.91169360541
+蛇纹 13.2075304714
+工程技术 8.74738605748
+直闯 13.2075304714
+和澳洲 11.5027823792
+齐世武 12.1089181827
+灰铸铁 12.5143832909
+周天之 12.8020653633
+海军 6.26007382558
+合性 13.2075304714
+请战 10.7226238216
+老子山 12.8020653633
+兜子 11.1926274509
+第五年 11.9547675029
+第十一次 10.5684731418
+郑武公 12.5143832909
+内政部长 10.1871055853
+旬邑 11.4157710022
+尉犁 11.3357282945
+张大经 9.96885201925
+金海陵 10.642581114
+企业财务 10.5684731418
+德国联邦政府 13.900677652
+寿椿殿 12.2912397395
+多万份 12.1089181827
+高监军 12.5143832909
+计时赛 13.2075304714
+乌桓军 13.2075304714
+很困 13.900677652
+尤内斯库 11.9547675029
+多万件 11.9547675029
+铜子儿 12.8020653633
+全案 12.8020653633
+镜面 9.61021821083
+第五幅 13.2075304714
+马褂木 13.900677652
+寻回 13.900677652
+金晓湘 13.900677652
+啤酒 7.75649201785
+请托 10.4994802703
+所求 10.1394775363
+鸟兽散 11.9547675029
+凡臣 13.2075304714
+同到 10.0088573539
+海运业 11.5027823792
+接力比赛 12.8020653633
+五泉 11.9547675029
+照出 10.2630914922
+共渡难关 11.8212361103
+幽默感 10.3453295905
+残卷 10.4666904475
+王建 8.85725253506
+考察站 10.9049453784
+直镇 13.2075304714
+秋鸿 13.900677652
+三十多下 13.2075304714
+非金属性 12.8020653633
+解黑水 13.2075304714
+持卡 11.2616203224
+玫瑰色 10.765183436
+乳儿 11.8212361103
+必要劳动 8.89004235788
+割除 11.3357282945
+照准 10.765183436
+多万个 11.0674643079
+高岭土 9.04864738806
+暮气沉沉 12.8020653633
+雄强 11.1280889297
+黄豆大 11.7034530746
+超级女 13.2075304714
+军犬 13.2075304714
+韦特卢 13.900677652
+上承圣 13.900677652
+徐有贞 12.2912397395
+琼楼金阙 13.2075304714
+工程部 11.1280889297
+残匪 12.1089181827
+球技 12.1089181827
+难色 11.8212361103
+请拨 11.9547675029
+乳光 13.2075304714
+海兴 13.900677652
+海关 8.089536659
+地质图 10.6818018271
+海兽 9.94943393339
+司马昭闻 13.2075304714
+造势 10.1630080337
+直销 9.23723855786
+合情 13.2075304714
+现值 10.5684731418
+叹惜 11.8212361103
+几亩 10.0940151622
+亏盈 13.900677652
+海克 12.2912397395
+海光 13.900677652
+智能武器 12.8020653633
+廷试 12.2912397395
+海兔 11.3357282945
+耳报神 11.1926274509
+台甫 11.598092559
+悲喜剧 10.8561552143
+毫无动静 11.1280889297
+赖文武 12.5143832909
+震动 7.53764954844
+整页 12.5143832909
+罗盘 9.37888907493
+欺负人 10.3743171274
+英宗 9.49395840471
+法相宗 10.7226238216
+游击战术 11.3357282945
+评功 12.1089181827
+第八节 11.2616203224
+部落社会 11.2616203224
+墨杜萨 12.8020653633
+田额 12.1089181827
+水面蒸发 13.2075304714
+血源性 12.1089181827
+合意 10.0720362555
+上个月 8.1608847398
+九龙山 10.0088573539
+传承者 13.2075304714
+陈毅 9.21854642485
+台希德 12.2912397395
+图卜鲁格 12.2912397395
+号码牌 13.2075304714
+直铺 13.900677652
+柱状 8.98802276624
+全椒 11.7034530746
+照做 13.2075304714
+背暗投明 13.900677652
+麻铁黎 13.2075304714
+垂头 10.1394775363
+虎牙 11.598092559
+张二弟 12.5143832909
+走向世界 9.75754292558
+八面体 10.765183436
+母芯 11.598092559
+盖洛德 13.900677652
+育婴 11.7034530746
+搬出去 10.642581114
+亲生 8.9102450652
+工夫 7.35102690974
+儿科学 12.5143832909
+配股缴款 10.3171587135
+工大 11.1280889297
+所涉 10.4041700905
+当地人 8.44109213783
+写过 9.22784881751
+雄心 9.59661255877
+心中无数 11.1926274509
+写进 10.604840786
+工程菌 13.2075304714
+趁人之危 12.2912397395
+周天伦 12.5143832909
+凤林 11.3357282945
+卫矛 11.9547675029
+工头 10.2897597393
+卡车司机 11.2616203224
+国仇家恨 13.2075304714
+方法学 10.533381822
+皱着眉头 9.08039608637
+石画 10.9049453784
+抽象性 11.5027823792
+英寸 8.85725253506
+匪首 10.6818018271
+十余条 11.598092559
+震区 11.0674643079
+琴声 9.48183704418
+手机操作系统 12.8020653633
+如东县 13.900677652
+造化 8.42003872863
+风景园林 11.9547675029
+池中之物 13.900677652
+连带责任 9.54396882529
+高产田 13.900677652
+水影山 13.2075304714
+憨笑 11.3357282945
+悠哉游哉 13.2075304714
+造句 11.598092559
+哪一方面 10.9562386728
+冶艳 13.900677652
+无保留 13.900677652
+骨器 9.91169360541
+表项 13.900677652
+虎狼 9.61021821083
+行为不端 11.2616203224
+十余枚 13.2075304714
+光光荣荣 13.900677652
+越积越 11.1280889297
+文明城市 11.7034530746
+恳切 9.69598503258
+醌氢醌 13.2075304714
+克里亚 11.9547675029
+虫鸣 11.598092559
+鲁邱 13.2075304714
+粤歌 13.900677652
+冤屈 9.89334446674
+兹罗提 13.900677652
+白蜡虫 11.598092559
+国民收入 8.46259834305
+渡上 13.900677652
+造反 7.66430806177
+向业界 13.2075304714
+襟怀坦荡 11.9547675029
+照像 11.2616203224
+工委 10.8096351986
+除皱 10.9562386728
+满黑毛 13.900677652
+天监监 11.598092559
+医疗系统 12.5143832909
+持刀 9.77354326693
+阴极射线 10.5684731418
+克里什 13.900677652
+职业指导 13.900677652
+伍斯特郡 12.8020653633
+争做 11.9547675029
+恨恶 13.2075304714
+执行期 12.1089181827
+弗林特 13.900677652
+显现出来 9.80633308975
+谷氨 13.2075304714
+野生种 10.9562386728
+请援 12.5143832909
+很坏 10.2630914922
+为所欲为 9.53122979951
+向用 13.900677652
+工程量 10.1164880181
+意思明白 13.2075304714
+骨嘟 13.900677652
+翠梅 13.2075304714
+节省能源 11.7034530746
+郑大官人 12.2912397395
+平淡无味 13.2075304714
+石烈居 13.2075304714
+沙沙作响 11.0674643079
+高雄县 11.4157710022
+弄到手 10.1164880181
+逸兴遄飞 13.900677652
+米林湖 12.5143832909
+买卖 6.51730950498
+从轮 13.900677652
+买单 8.87679713113
+崔毅庄 13.900677652
+锑矿 10.5684731418
+棉袍子 13.2075304714
+拉下 10.3453295905
+文件夹 10.533381822
+耐震 13.2075304714
+调剂余缺 12.5143832909
+拉丁 9.30555780184
+僧伽罗语 12.1089181827
+自住型 11.1926274509
+归德府 11.7034530746
+开面冠 13.900677652
+拉丹 11.9547675029
+很傻 11.598092559
+抗疟药 11.9547675029
+日收 11.5027823792
+中国扶贫基金会 11.9547675029
+事实胜于雄辩 12.8020653633
+断层扫描 12.5143832909
+师罗真人 12.5143832909
+每家每户 11.5027823792
+陈泰 10.6818018271
+动力工程 12.1089181827
+诸诚 12.2912397395
+铁栏杆 11.9547675029
+工程队 10.765183436
+热情关注 11.9547675029
+陈波 11.0674643079
+那绢子 13.2075304714
+构造函数 13.900677652
+大酒楼 12.1089181827
+应变计 12.5143832909
+台班 11.9547675029
+陈沛 13.900677652
+疾言厉色 11.7034530746
+全湿 12.1089181827
+吴稚晖 11.9547675029
+堪称 8.18036587537
+工程院 12.2912397395
+严禁烟火 12.8020653633
+蒸汽 8.26588804881
+海南省 8.42421410004
+拉乌 13.900677652
+邱文 13.2075304714
+跑车 9.43476953332
+冤家 9.44633035572
+震后 11.3357282945
+旺地 12.8020653633
+海基 11.1926274509
+纳曼干 13.2075304714
+照在 9.59661255877
+西瓜刀 13.2075304714
+争脸 13.2075304714
+观察学习 12.5143832909
+海埂 11.3357282945
+南明河 13.2075304714
+民主制度 9.87532596124
+海城 9.91169360541
+王庄 9.04864738806
+秋风 8.9308643524
+绝活 10.642581114
+粘接 11.1926274509
+候场 12.2912397395
+别墅设计 13.900677652
+河伯 12.1089181827
+海域 7.3741827924
+黄金交叉 11.2616203224
+悼歌 12.2912397395
+抽象机 13.2075304714
+恺撒 10.6818018271
+鲁普 11.8212361103
+坯料 11.0674643079
+一团漆黑 11.8212361103
+王序 13.2075304714
+投降主义 11.1280889297
+跟唱 13.900677652
+琴弓 12.5143832909
+手术费 11.7034530746
+团状 13.900677652
+冤孽 11.4157710022
+王元英 13.2075304714
+于大英 13.900677652
+第五个 9.69598503258
+公安派 11.2616203224
+改头换面 10.3743171274
+受灾地区 12.2912397395
+拉人 10.9049453784
+玄鹤洞 12.8020653633
+污秽 10.0088573539
+获宠 12.8020653633
+粤江 13.2075304714
+田鼠 10.642581114
+东征苏 13.2075304714
+宋十策 13.2075304714
+金土地 13.900677652
+琴弦 9.93038573842
+能谱 10.2117981979
+社旗县 12.5143832909
+陈汤 11.9547675029
+微粒说 11.0103058941
+身高体重 13.2075304714
+田齐 12.8020653633
+氰化法 13.2075304714
+西厢房 9.10488710638
+张义兰 9.15574552361
+松阳 12.2912397395
+松阴 11.2616203224
+殡葬 9.96885201925
+英属 9.15574552361
+热豆腐 12.2912397395
+战争时代 13.2075304714
+屏东市 12.1089181827
+仍称 9.75754292558
+脆嫩 11.4157710022
+西流贯 13.2075304714
+牵一发而动全身 10.642581114
+家居装饰 13.2075304714
+满汉文 12.1089181827
+英山 11.7034530746
+工序 8.9308643524
+步诗行 13.2075304714
+买去 10.9049453784
+液晶屏 10.9049453784
+特富龙 13.900677652
+双斗 13.900677652
+旬阳 13.900677652
+王府 7.90921310487
+探测船 13.2075304714
+教导队 11.4157710022
+灭绝种族 12.5143832909
+息率 11.2616203224
+伍迪 13.2075304714
+钴蓝色 13.900677652
+拉伊 11.1926274509
+工役 11.598092559
+木运 13.900677652
+孝经 10.4994802703
+周郎顾 12.2912397395
+拉伸 10.0294766411
+总兵 7.73736284794
+陈淳 11.1280889297
+水深火热 9.98865464655
+马塔贝 12.2912397395
+全水栖 13.2075304714
+拉伯 12.5143832909
+宿太尉 9.93038573842
+指纹图 13.900677652
+秋香 12.1089181827
+军用 7.86280673205
+拉伤 11.9547675029
+台独 11.0103058941
+陈涛 11.1280889297
+夏正 13.900677652
+海因 11.2616203224
+拉佐 13.900677652
+中共安徽省委 12.8020653633
+江夏区 12.8020653633
+河下 12.8020653633
+河上 9.16447920358
+很凉 11.598092559
+拉住 7.95787827685
+淋巴 8.98802276624
+海图 10.0720362555
+传送机 12.8020653633
+军事化 10.7226238216
+很准 10.765183436
+军界 10.6818018271
+屏住 9.61021821083
+王平 9.62401153296
+买到 8.71329184614
+黎民安 13.2075304714
+第五套 13.2075304714
+武里府 13.2075304714
+植物检疫 11.1280889297
+遣送 10.3171587135
+等闲 9.49395840471
+革兰氏 9.62401153296
+河中 8.9308643524
+鱼麟 13.2075304714
+折回去 12.8020653633
+暗紫色 11.4157710022
+基作用 12.8020653633
+请教 8.35941410682
+乞怜 11.9547675029
+争胜 11.1280889297
+明艳 12.5143832909
+捎信 11.3357282945
+文图拉 13.2075304714
+冷不冷 11.2616203224
+内部资料 11.9547675029
+北方局 13.2075304714
+新兴县 12.8020653633
+耳中 9.59661255877
+读数 10.1164880181
+陈济 11.0103058941
+琴师 11.0103058941
+粤海 12.8020653633
+雷声大 11.1280889297
+代表作 7.14258314755
+厄难 13.2075304714
+两厢版 11.9547675029
+变压器厂 13.2075304714
+快好了 12.2912397395
+间杂 11.2616203224
+保健酒 13.900677652
+硝酸 8.78268383956
+蠕行 13.900677652
+田鸡 12.1089181827
+诠释者 13.900677652
+数千片 13.2075304714
+裸奔 10.3453295905
+注射针 13.2075304714
+沈湘 13.2075304714
+自找没趣 12.8020653633
+进货价格 12.8020653633
+伊卜拉欣 12.8020653633
+王玉峰 13.900677652
+买办 9.35738286971
+乞恕 12.8020653633
+矿柱 11.8212361103
+请旨 9.75754292558
+汇纂 12.8020653633
+吴佩珍 10.765183436
+坝顶 10.1630080337
+陈胖子 13.2075304714
+生机 8.94485059437
+峨眉山市 12.1089181827
+所欠 10.3171587135
+刘小兵 13.900677652
+连系 12.5143832909
+律师法 12.5143832909
+等长 11.0674643079
+蠕蠕 12.2912397395
+占廷人 10.9049453784
+巧思 11.598092559
+黏着 12.5143832909
+所欲 10.8096351986
+屏保 13.900677652
+默林 13.900677652
+标准配置 9.84023464143
+真有假 12.5143832909
+田鹨 13.900677652
+晋太康 10.8561552143
+星形线 12.2912397395
+初高中 12.8020653633
+赤贫 10.5684731418
+屯粮积草 12.8020653633
+淫词艳曲 13.2075304714
+熔断 11.7034530746
+景岳全书 13.900677652
+封面人物 9.17328983326
+武火 12.8020653633
+哄起来 12.8020653633
+残基 11.0674643079
+买光 12.5143832909
+杭汉先 12.8020653633
+全氟 11.3357282945
+泸水县 12.1089181827
+高频电波 12.5143832909
+全民 8.45825994145
+中药味 12.2912397395
+重化工 11.3357282945
+灯芯绒 11.3357282945
+垂尾 10.765183436
+红外光谱仪 12.1089181827
+席棚子 12.8020653633
+翻出来 10.533381822
+吝色 13.900677652
+十余所 12.5143832909
+樱唇微 13.900677652
+齐世荣 13.2075304714
+球星 10.765183436
+工尺 11.2616203224
+捏起 11.1926274509
+辘辘 11.5027823792
+珠江口 9.56994431169
+尉皆 13.900677652
+演职人员 13.900677652
+工商职业 13.900677652
+老花眼镜 11.1280889297
+教师职业 13.2075304714
+江西师大 13.2075304714
+沙枣树 13.2075304714
+乞援 11.2616203224
+挹娄 11.2616203224
+松针 10.9049453784
+残垒 13.2075304714
+息烽 11.7034530746
+凿出来 12.8020653633
+奖惩 9.84023464143
+陈溢 13.900677652
+好心肠 10.8561552143
+本土化 10.1630080337
+考察组 11.0674643079
+著作权法 11.8212361103
+穆拉梅 13.2075304714
+造园 10.7226238216
+英币 13.2075304714
+月月红 13.2075304714
+英布 10.1630080337
+大成殿 10.4666904475
+福圣承 12.8020653633
+背运 12.1089181827
+陷落 8.30969067146
+赤足 11.4157710022
+黄时雨 13.900677652
+伊宁县 11.9547675029
+抛下来 13.2075304714
+大屿山 11.2616203224
+余亿美元 13.2075304714
+黄巢军 13.2075304714
+多处理机 11.9547675029
+经济指标 8.80081122415
+经书 9.35738286971
+无出其右 11.7034530746
+伏虎罗汉 13.2075304714
+查准率 13.900677652
+买卖网 12.1089181827
+粤港 12.2912397395
+跑跳 12.2912397395
+一千八百多年 13.2075304714
+贾思勰 11.1926274509
+几于 13.900677652
+娘儿们 9.80633308975
+赤道几内亚共和国 13.2075304714
+吸浆虫 13.2075304714
+泵体 13.2075304714
+环烷酸 12.5143832909
+庙岭 13.900677652
+生材 13.900677652
+跑路 11.0674643079
+陈清 11.8212361103
+跑跑 10.9562386728
+海商 12.5143832909
+回旋加速 13.2075304714
+率控制 12.5143832909
+息火 12.8020653633
+英年 12.5143832909
+多项式 9.96885201925
+照喝 12.2912397395
+高梁河 11.8212361103
+骨化 10.3453295905
+豆腐块 12.8020653633
+警司 12.1089181827
+突变论 11.1280889297
+沈浩 13.2075304714
+沈浮 12.2912397395
+一两日 11.1280889297
+量价背离 11.7034530746
+公寓楼 11.8212361103
+分布模式 13.900677652
+很厚 10.2117981979
+那一 9.4233408375
+傲然自得 13.2075304714
+二流角色 13.900677652
+全洲 10.0505300503
+安体舒 11.8212361103
+松闲 13.2075304714
+球杆 11.7034530746
+莫塔马 12.8020653633
+蹲过 11.9547675029
+博物院 9.96885201925
+半蹲 11.1280889297
+塞擦音 11.7034530746
+寄予厚望 9.80633308975
+页数 11.8212361103
+充分就业 10.3171587135
+那丛 11.5027823792
+散记 12.2912397395
+罐盖 12.5143832909
+英德 9.80633308975
+欧马可 12.5143832909
+全洒 12.8020653633
+技术相结合 10.9562386728
+浮小麦 13.900677652
+兜帽 13.900677652
+籍授 13.900677652
+抗洪救灾 12.8020653633
+九龙塘 13.900677652
+淋得 11.0674643079
+信国公 11.5027823792
+喀吧 12.2912397395
+个把月 11.9547675029
+纳巴岛 12.8020653633
+当场抓获 11.598092559
+虹化 13.900677652
+请来 8.08654712015
+杜鲁人 13.2075304714
+造在 11.5027823792
+很受 9.49395840471
+那放光 12.2912397395
+燕铁木 10.7226238216
+抽油机 13.900677652
+计时表 13.900677652
+测压管 13.2075304714
+乳品 9.45802639549
+权奸 9.87532596124
+复活节岛 11.2616203224
+写诗 9.20019728618
+枉费 10.9562386728
+骨力 11.3357282945
+镜鉴 11.3357282945
+张开血 13.900677652
+滨州 10.4041700905
+谷梁 11.8212361103
+赤豆 10.5684731418
+四百九十多条 13.900677652
+合数 11.9547675029
+真实度 13.2075304714
+公陈午 13.2075304714
+战天斗地 12.2912397395
+心病还须心药医 13.900677652
+奥赫里德湖 12.8020653633
+普罗泰戈 12.5143832909
+村支部 12.1089181827
+陈澧 11.9547675029
+一百辆 12.8020653633
+找不自在 12.8020653633
+兜底 11.2616203224
+刚试 13.2075304714
+第五家 13.2075304714
+工巧 10.9562386728
+闻风丧胆 10.7226238216
+直道 10.9049453784
+纯利润 10.7226238216
+沈氏 12.1089181827
+乳名 10.2117981979
+肺动脉 10.2371160058
+水南岸 13.2075304714
+英式 11.1926274509
+称王称霸 11.598092559
+抹灰 11.5027823792
+沈永 11.8212361103
+雄师 11.0674643079
+九龙壁 11.8212361103
+互推 12.8020653633
+艾卜耶 13.2075304714
+迄今已有 10.8561552143
+语法结构 11.3357282945
+特瓦尔 13.900677652
+枸杞子 10.0505300503
+全消 11.0674643079
+陈潮 13.2075304714
+鱼米乡 11.9547675029
+虔婆 11.2616203224
+汝可回 13.2075304714
+巧手 10.765183436
+台灯 9.6811699468
+慢腾腾 10.2117981979
+骨刺 11.2616203224
+一字排开 10.4666904475
+质子转移 11.8212361103
+直通 9.25628675283
+锱铢必较 11.7034530746
+李鸿基 12.5143832909
+儿茶 11.9547675029
+虹口 11.2616203224
+请柬 10.5684731418
+陈演 12.8020653633
+刚察县 13.2075304714
+图拉吉 13.2075304714
+海味 10.8561552143
+富富有余 13.900677652
+球果 10.0940151622
+马塔迪 12.8020653633
+富锦县 12.5143832909
+直退 12.2912397395
+直送 10.642581114
+熄灯 10.6818018271
+直逼 8.9308643524
+熄灭 8.38724890581
+熄火 9.54396882529
+左一闪 13.900677652
+殖产 12.2912397395
+报号 13.900677652
+造型 7.26473109629
+合时 11.1280889297
+粘性 9.09665660724
+公共政策 10.1630080337
+评职称 13.2075304714
+震垮 12.5143832909
+胡治兵 12.5143832909
+窦性心 12.1089181827
+加纳人 13.2075304714
+割法 13.900677652
+广西电影制片厂 12.8020653633
+过日子 8.26232298264
+海峡两岸 10.1871055853
+两三尺 12.2912397395
+科技领域 11.598092559
+换句话说 8.27666014579
+个人账户 9.7898037878
+秋播 10.9562386728
+失恃 13.2075304714
+逆境 10.4994802703
+谷音 13.900677652
+罗维奇 10.642581114
+绝配 11.8212361103
+五十七岁 12.2912397395
+失恋 9.63799777493
+陈郁 13.2075304714
+平招聚 13.2075304714
+快传 11.9547675029
+黑黢黢 11.1926274509
+防冻剂 12.8020653633
+戈尼 13.2075304714
+营销学 12.2912397395
+博识 11.7034530746
+禅让制 12.5143832909
+滚成一团 13.900677652
+高级教师 13.2075304714
+神州数码 11.0103058941
+价值论 10.604840786
+暴救民 13.2075304714
+奥林匹克公园 12.5143832909
+打天下 9.63799777493
+陈郡 12.1089181827
+深入实际 13.2075304714
+沧海 10.5684731418
+任德共 13.2075304714
+而入 8.65893063692
+考察者 12.5143832909
+军衔 8.53470163695
+新起点 10.3453295905
+失态 9.72629038208
+乌德 10.8096351986
+始发地 12.8020653633
+技术规程 12.2912397395
+破天荒 10.0294766411
+绵密 10.765183436
+鱼鼓 13.900677652
+明赐名 13.900677652
+文字学 10.4994802703
+诈骗案 12.1089181827
+四百度 12.5143832909
+排位赛 13.900677652
+蹲点 11.8212361103
+巴渝舞 12.2912397395
+而光 12.8020653633
+军衣 9.58318953844
+欧罗塔 13.900677652
+新闻台 13.2075304714
+线下 9.91169360541
+线上 8.9102450652
+新闻司 11.4157710022
+掰断 12.8020653633
+数千辆 11.8212361103
+一颠一跛 12.8020653633
+比宝柱 13.2075304714
+曾聘吴 13.2075304714
+卖淫 10.0720362555
+房市场 11.8212361103
+球风 12.8020653633
+所附 11.1926274509
+史话 11.4157710022
+实体法 11.0674643079
+两厢车 10.5684731418
+史评 11.8212361103
+所限 9.87532596124
+必从 11.4157710022
+运送者 13.2075304714
+羊皮袄 11.4157710022
+宗长兴 11.9547675029
+吴铁城 12.8020653633
+防御机制 11.8212361103
+筹备会 11.0674643079
+道德家 11.7034530746
+请领 12.5143832909
+齐之子 13.2075304714
+傀儡 9.33632946051
+坎布里奇 12.1089181827
+中国时报 10.7226238216
+文震孟 13.2075304714
+骨子里头 12.5143832909
+史陈婴 12.8020653633
+虎视 11.2616203224
+陈遵 13.900677652
+打水仗 13.900677652
+台车 11.1280889297
+棍徒 12.8020653633
+何良俊 12.8020653633
+四百年 11.1280889297
+李学勤 10.765183436
+线人 13.900677652
+返回值 10.6818018271
+新南威尔士州 10.9049453784
+低着头 7.79365476423
+户外活动 10.1394775363
+巴西议会 12.8020653633
+乌龙驹 9.04864738806
+振威 12.5143832909
+脉络丛 12.2912397395
+省点 11.8212361103
+流体管 13.900677652
+开倒车 13.2075304714
+陋巷 11.4157710022
+军装 8.81308131674
+戎金 13.2075304714
+三一律 11.1280889297
+而出 8.13548654919
+李学勇 13.900677652
+说不过去 9.7898037878
+显效 11.3357282945
+普莱尔 13.900677652
+进气道 10.6818018271
+等臂天平 13.2075304714
+定死无疑 13.2075304714
+坏脾气 11.598092559
+警局 13.900677652
+骈四骊六 13.900677652
+读过 8.85725253506
+荣夷公 12.5143832909
+田组合 13.2075304714
+许东辞 13.2075304714
+秭归县 11.3357282945
+地骨皮 11.8212361103
+国际日期变更线 11.1926274509
+第三步 10.1630080337
+快下 12.1089181827
+快上 10.5684731418
+陈金 11.1280889297
+谷雨 10.604840786
+李维汉 11.8212361103
+工程款 10.2117981979
+表列出 13.900677652
+聂宝璋 12.5143832909
+接上头 11.598092559
+相干 9.26594866375
+新闻办 10.604840786
+阿鲁巴岛 12.8020653633
+松毛 11.2616203224
+杞县 8.70218062071
+低工资 11.3357282945
+远安县 12.1089181827
+核工程 12.2912397395
+庾开府 13.900677652
+中共广东省委 11.1926274509
+罐装 10.9562386728
+王惟一 12.1089181827
+直溜 13.900677652
+海绵状 10.765183436
+秋日 10.6818018271
+杠铃 12.1089181827
+公安部 8.79473217808
+流行音乐 11.0103058941
+驿路 10.4041700905
+陈醋 11.2616203224
+从锡兰 12.5143832909
+快乐 7.42524493527
+二十八分 13.900677652
+索末菲 11.0674643079
+槲栎 11.2616203224
+几万只 13.900677652
+玄镇广 13.2075304714
+失意 9.56994431169
+硬任务 12.2912397395
+安顿下来 10.4349417492
+特罗尔 12.8020653633
+链式反应 10.3453295905
+椅垫 11.7034530746
+十八株 12.8020653633
+甄家仆 13.2075304714
+转转看 13.900677652
+整合型 11.9547675029
+宋三郎 12.1089181827
+卫生陶瓷 12.1089181827
+参考价 10.8561552143
+工作队 10.1871055853
+陈留县 11.8212361103
+田成 11.8212361103
+快事 11.3357282945
+行宽仁 12.8020653633
+李舒章 12.5143832909
+快于 9.40086798165
+叶可 10.4994802703
+靠近海岸 12.2912397395
+模拟化 13.2075304714
+减速慢行 11.4157710022
+秋收 9.5062284973
+公爵夫人 11.3357282945
+快些 9.32596667347
+六十九卷 13.2075304714
+振子 11.7034530746
+卫贡 13.2075304714
+中华全国工商业联合会 11.8212361103
+采访录 13.900677652
+陈酿 11.2616203224
+哈利卡 12.2912397395
+殖民化 11.9547675029
+立楚怀 13.2075304714
+杨廷宝 12.8020653633
+东山高卧 13.900677652
+捧哏 12.5143832909
+快人 12.8020653633
+羊和鹿 13.2075304714
+市用制 13.900677652
+台维斯 13.2075304714
+邴元真 13.2075304714
+所需 7.16489763773
+弗朗西 13.900677652
+手术灯 12.5143832909
+怕水 11.4157710022
+亚广联 13.900677652
+保健站 13.900677652
+球馆 11.8212361103
+准星 10.6818018271
+明孝陵 11.3357282945
+军规 11.0674643079
+大事纪 13.900677652
+镜泊 13.900677652
+叶县 9.69598503258
+乌市 11.598092559
+乌布 13.900677652
+鳄梨 11.2616203224
+戴宗纳 13.900677652
+参考书 10.642581114
+八百五十文 13.2075304714
+外接圆 13.900677652
+含垢忍耻 13.900677652
+快件 12.1089181827
+碱性 8.0484751722
+三论宗 11.8212361103
+一个九曲 13.2075304714
+沈拂影 12.2912397395
+赤狐 12.1089181827
+准是 9.5186510173
+当代世界 10.9562386728
+刀棍齐加 13.900677652
+乌巢 11.0674643079
+调查过程 10.5684731418
+过激 9.82314020807
+贼人 8.86372504956
+秋暮 12.8020653633
+捻捻转儿 13.900677652
+失所 11.7034530746
+刻图章 13.900677652
+拉多 12.2912397395
+卡纳塔克邦 12.1089181827
+三百多里 12.5143832909
+贼亮 11.5027823792
+清泉 9.53122979951
+失手 9.54396882529
+裴寂 13.900677652
+赤焰 12.8020653633
+与虎谋皮 11.7034530746
+横行一时 13.900677652
+文物保护 7.86759143018
+全速 10.6818018271
+准时 9.22784881751
+石球 10.9562386728
+谷糠 11.7034530746
+基址 9.71102290995
+怜新弃旧 13.900677652
+憨厚老实 13.2075304714
+狠抓 10.1164880181
+端上来 9.58318953844
+纲纪废弛 13.900677652
+匪情 13.2075304714
+机关刊物 10.2371160058
+基坑 11.3357282945
+视差 10.2897597393
+贝肯鲍尔 12.8020653633
+孔雀石 10.533381822
+大街小巷 9.20932976975
+第八篇 13.900677652
+价值观 8.80692745117
+捧场 9.66657114738
+林建岳 13.900677652
+袅娜 11.1280889297
+再次发生 10.0088573539
+苗诺夫 13.900677652
+十世纪 13.2075304714
+论坛报 10.4666904475
+漏下 11.598092559
+人工模拟 12.8020653633
+基地 5.97371410711
+匪患 11.5027823792
+正厅级 11.1280889297
+庙祝 11.2616203224
+爵爷 12.5143832909
+族规 11.2616203224
+合页 12.5143832909
+国世子 12.2912397395
+泗河 11.0674643079
+陈于廷 12.8020653633
+去垢剂 12.8020653633
+狠招 12.1089181827
+松梅 12.5143832909
+天通股份 11.7034530746
+短大衣 12.2912397395
+孟师 13.900677652
+扑通一声 9.84023464143
+挨门逐户 13.900677652
+冒里冒失 13.2075304714
+产生分歧 11.4157710022
+民族败类 12.2912397395
+效应器 10.765183436
+史观 11.0674643079
+土地改革 9.11318590919
+埃勒克 13.2075304714
+牵涉痛 13.900677652
+王馥荔 13.900677652
+合领 12.8020653633
+直流 8.81308131674
+铮铮有声 13.900677652
+心荡神摇 13.2075304714
+诡诈 10.6818018271
+秋明 11.7034530746
+蒙混过关 10.642581114
+拖架 13.900677652
+采购员 11.3357282945
+科技人员 10.2630914922
+裴学 13.2075304714
+朱邦造 11.598092559
+现名 8.79473217808
+沃罗涅日 11.2616203224
+长尾巴 10.9049453784
+诡计 9.24671730182
+雪青 11.598092559
+一发千钧 12.8020653633
+全都 6.76897914151
+北卡罗来纳 11.2616203224
+秋晨 12.5143832909
+秋景 11.3357282945
+赛马场 11.3357282945
+一会儿门 12.5143832909
+导带 11.7034530746
+全部 4.92796015258
+惠骑射 13.2075304714
+秋晴 12.8020653633
+补气药 11.9547675029
+一分一秒 10.4041700905
+必定会 9.0884932966
+基型 10.642581114
+松树 8.37921673411
+清泪 11.5027823792
+五十七年 11.0674643079
+方于鲁 12.8020653633
+专家建议 9.01032852375
+转化率 11.0103058941
+泗水 9.66657114738
+台账 12.8020653633
+松栎 12.2912397395
+武丁至 13.900677652
+颠倒反转 13.2075304714
+朱果 12.8020653633
+参与度 10.1164880181
+导师 8.90346537821
+曙光 8.23425096386
+兑现 7.76511276089
+王宪钧 13.2075304714
+生死有命 12.2912397395
+喝点 9.77354326693
+卫辉 10.9049453784
+叶公 12.8020653633
+而别 10.3171587135
+分茅胙土 13.900677652
+叶兰 13.900677652
+莫雷河 13.2075304714
+圈外人 13.2075304714
+虎鲸 11.8212361103
+轻而易举 9.17328983326
+清波 10.533381822
+谐振 10.4994802703
+表扬信 12.8020653633
+斯顿 11.5027823792
+金天翮 12.1089181827
+排序功能 12.8020653633
+夹金山 11.5027823792
+数十毫瓦 13.2075304714
+王之乐 13.900677652
+卫辰 13.900677652
+秋林 10.5684731418
+彭叔夏 12.8020653633
+贺岁片 11.5027823792
+四十余篇 13.2075304714
+所闻 10.4666904475
+冥暗 13.900677652
+失据 12.8020653633
+镜湖 11.598092559
+骨软筋酥 13.2075304714
+奚人 11.2616203224
+生拉硬扯 13.900677652
+栗钙土 9.74179456862
+安托法加斯塔 12.5143832909
+一问之下 13.2075304714
+同喜同乐 13.2075304714
+技术革新 10.4666904475
+真叫人 10.2897597393
+监测员 13.900677652
+叶儿 11.5027823792
+芒果园 13.900677652
+尔王庄 12.8020653633
+黑水河 10.2630914922
+否决票 13.900677652
+吡哆醇 12.8020653633
+第八章 9.54396882529
+枉然 10.7226238216
+朦朦胧胧 9.93038573842
+一版再版 13.2075304714
+向超 12.8020653633
+军警 9.4233408375
+吡哆醛 12.8020653633
+录下来 12.1089181827
+族裔 11.598092559
+阿维莱斯 13.900677652
+沈通 11.9547675029
+蛇蜕 11.8212361103
+穷途末路 10.9049453784
+振奋 8.44963919841
+与会同志 12.8020653633
+灾害源 13.900677652
+公相助 13.900677652
+基因 7.69007757495
+有用吗 12.2912397395
+基团 8.98069672615
+写真 10.2371160058
+乌山 11.9547675029
+自感 10.6818018271
+濮涧 12.5143832909
+王爷府 13.2075304714
+海洋学院 12.2912397395
+概念模型 12.8020653633
+新霉素 12.2912397395
+秋月 10.6818018271
+翠绿色 11.0674643079
+戈德 11.598092559
+胡猜乱道 13.900677652
+奈良 10.1394775363
+等次 11.7034530746
+攒着 11.0674643079
+猜谜儿 13.900677652
+王之仁 10.1630080337
+所长 7.11058041646
+军训 10.642581114
+逆子 11.1926274509
+秦德公 13.2075304714
+赤热 11.8212361103
+肠溶片 13.2075304714
+体育总局 11.9547675029
+谭良德 13.2075304714
+导弹 6.42647284548
+珞珈 13.900677652
+割漆 13.2075304714
+公封侯 13.2075304714
+世界粮食计划署 12.2912397395
+荧光灯 10.4041700905
+驿车 12.5143832909
+突厥语 9.85762638414
+七八十摄氏度 13.900677652
+导引 9.09665660724
+王燮先 13.2075304714
+四五十日 11.8212361103
+图书交换 13.2075304714
+桥儿沟 13.2075304714
+泗洪 11.2616203224
+陈老大 12.5143832909
+驱逐机 12.8020653633
+乌尔 10.0720362555
+静地 12.8020653633
+王之争 12.5143832909
+几万元 10.4994802703
+失控 9.04086524761
+全重 8.74738605748
+平沙 11.9547675029
+叶军 13.900677652
+退休工人 11.7034530746
+率性 11.8212361103
+陶瓷厂 12.8020653633
+凡入辑 12.8020653633
+纸包装 12.5143832909
+田林 12.1089181827
+沿河路 13.900677652
+潘东周 13.2075304714
+行动诡秘 12.2912397395
+视察 8.39534611604
+西班牙港 12.1089181827
+考古学家 9.05649056552
+唐传 11.9547675029
+司马昭欲 12.8020653633
+基兴 12.8020653633
+变化球 13.900677652
+蛇肉 11.5027823792
+台词 9.24671730182
+星条旗 11.9547675029
+逸事 10.765183436
+语境 10.7226238216
+赤眉 9.82314020807
+踩下去 12.8020653633
+史载 10.4041700905
+阿凯亚 12.8020653633
+写点 11.4157710022
+陈铨 13.900677652
+松滋 10.604840786
+石洞口 11.8212361103
+陈铭 11.1926274509
+调相器 12.2912397395
+不好惹 12.5143832909
+资中县 13.900677652
+铁氧体 10.9049453784
+台语 12.5143832909
+田某 11.9547675029
+汪康 11.9547675029
+诸臣误 11.598092559
+乌审 12.8020653633
+骑好 13.900677652
+布渣叶 13.2075304714
+提不出 11.598092559
+铁盖 11.598092559
+蛇胆 11.598092559
+松溪 12.1089181827
+全险 11.1926274509
+一个三维 12.5143832909
+全院 10.3453295905
+拉好 13.2075304714
+虎贲 10.4041700905
+经贸关系 9.98865464655
+磷酸氢二钠 13.2075304714
+游人如织 11.9547675029
+书本费 13.2075304714
+中坜市 13.2075304714
+二进位制 13.2075304714
+杞国 13.2075304714
+库雅泰 13.2075304714
+筚篥 12.8020653633
+一百一十五座 13.2075304714
+毛仲义 11.9547675029
+跌下 10.7226238216
+逸仙 12.5143832909
+十余项 11.8212361103
+棍子 8.62767809341
+不畏强暴 10.9049453784
+陈钢 11.9547675029
+十余顷 13.2075304714
+交通业 11.9547675029
+天津市政府 10.4349417492
+乌孤 11.598092559
+注射液 9.43476953332
+体工队 11.8212361103
+象山县 11.8212361103
+羟化物 13.900677652
+史进 8.58255765813
+转运港 11.5027823792
+一等一 11.0674643079
+允怒 12.8020653633
+左右列 12.2912397395
+文献性 13.2075304714
+逸丽 13.900677652
+天人之分 12.8020653633
+龙门山 9.85762638414
+卖出价 11.7034530746
+唐侯 13.2075304714
+鲁西北 11.0674643079
+花开花落 11.8212361103
+砰砰 10.2117981979
+晦朔 12.8020653633
+财经类 12.5143832909
+负作用 13.2075304714
+基准 7.67414098269
+里赫利 13.900677652
+史迹 10.4349417492
+科斯特 12.1089181827
+氰化钾 11.598092559
+氰化钠 12.1089181827
+视学 13.900677652
+第二十五章 10.4994802703
+虎跑 10.4994802703
+班船 12.2912397395
+绝门 12.8020653633
+秋思 12.1089181827
+乌孙 9.66657114738
+陈老师 11.3357282945
+田村 11.5027823792
+读读 11.3357282945
+海蜇皮 12.2912397395
+逸书 13.900677652
+王葆真 13.2075304714
+印海军 11.7034530746
+王一贴 13.900677652
+戈壁 8.92394390956
+唐修 12.5143832909
+赤石 12.1089181827
+海洋大学 13.900677652
+鲁西南 10.0505300503
+普通家庭 11.0674643079
+黑猩猩 10.9562386728
+史达 13.2075304714
+烟客 12.1089181827
+清河 8.99540287354
+逸乐 11.8212361103
+全集 8.48457724977
+全球卫星 13.900677652
+戈多 11.7034530746
+无政府 10.0720362555
+惠康昭 12.8020653633
+有用功 13.900677652
+茴香 10.533381822
+唐为 9.74179456862
+叶坪 13.900677652
+步进 10.9562386728
+单叶或 11.0674643079
+虎豹 9.96885201925
+激活蛋白 13.900677652
+衣钵 10.642581114
+失效 8.62256299275
+没意思 9.26594866375
+开放政策 10.3171587135
+唐中 12.2912397395
+宫崎骏 13.2075304714
+左营港 12.5143832909
+晦暗 10.2371160058
+而后 7.61467955747
+陈闳 12.8020653633
+军费 8.99540287354
+收支相抵 12.5143832909
+儿科 10.3453295905
+特古西加尔巴 11.3357282945
+戈夫 11.4157710022
+失散 9.48183704418
+北极区 12.1089181827
+溢流坝段 13.2075304714
+唐上 13.2075304714
+年老体弱 10.4994802703
+千古绝唱 12.2912397395
+园林式 13.900677652
+失敬 10.9049453784
+任凉州 11.9547675029
+白剑峰 13.900677652
+跌伤 11.7034530746
+罗维尔 13.2075304714
+卫视 10.4994802703
+息诉 12.8020653633
+乞食 11.0103058941
+天理何在 12.8020653633
+半日方 11.8212361103
+热轧 9.38981814546
+裴岑 13.2075304714
+镜框 10.1871055853
+诡谲 9.84023464143
+唐书 9.94943393339
+渗出物 11.598092559
+全面 5.62402852655
+全靠 8.66956903512
+汝请吾 13.2075304714
+冥想 10.604840786
+藕断 13.900677652
+公害病 13.2075304714
+全非 11.4157710022
+一九九七年 12.8020653633
+艾尔斯沃 13.900677652
+心醉神迷 12.1089181827
+威尔第 11.598092559
+绵延 8.60236028543
+尽要 12.8020653633
+不可逾越 10.2117981979
+沈雯 12.5143832909
+致癌性 12.1089181827
+韩湘子 12.8020653633
+逆差 9.17328983326
+毕业文凭 11.4157710022
+不畏强权 12.8020653633
+一九七六年 10.9562386728
+合龙 12.2912397395
+不作兴 12.5143832909
+钠硝石 12.5143832909
+唐人 9.25628675283
+殖民地 7.17204903889
+财务经理 12.5143832909
+鲁莽行事 12.2912397395
+七十二个 12.1089181827
+唐亦 13.2075304714
+萨莫斯 13.2075304714
+梯山航海 13.900677652
+叶基 11.598092559
+十余首 12.8020653633
+复制本 13.900677652
+唐京 13.900677652
+果不其然 10.0940151622
+松潘 10.642581114
+帝王陵 12.8020653633
+唐云 13.900677652
+研讨会 8.21709788464
+失时 13.2075304714
+沈阳 7.43920947562
+廖均 10.4349417492
+秋意 13.2075304714
+叶城 11.1926274509
+冥思 11.7034530746
+理想流体 11.9547675029
+酌酒 11.598092559
+警备 9.49395840471
+汪延 11.8212361103
+晦明 12.5143832909
+七十二万 13.900677652
+全音 11.7034530746
+陈锐 13.900677652
+哈医大 13.900677652
+总教头 12.5143832909
+机会主义 9.5186510173
+边路 11.7034530746
+黑帮片 13.900677652
+镜检 10.9562386728
+萧华 12.8020653633
+仍能 8.77077893705
+聚乙烯 9.45802639549
+龙井市 12.8020653633
+猛洞河 11.598092559
+吸收率 11.5027823792
+几万块 11.5027823792
+注射法 12.8020653633
+申张 12.2912397395
+山里人 9.94943393339
+假慈悲 12.2912397395
+民隐 12.8020653633
+尽悉 13.900677652
+叶型 12.5143832909
+重要文件 10.533381822
+写照 9.75754292558
+联名信 12.5143832909
+闭门思过 11.8212361103
+黔江土家族苗族自治县 12.8020653633
+数千毫克 13.2075304714
+宽大政策 12.8020653633
+军路 12.1089181827
+过头话 12.5143832909
+亚历山大港 11.0674643079
+跨向 12.8020653633
+三氯化铝 11.598092559
+主任 5.59173939938
+清污 13.900677652
+绝非 8.60737282725
+张家川回族自治县 12.8020653633
+那社尔 12.1089181827
+史济湘 13.2075304714
+陶瓷器 10.2117981979
+侍诸王 12.8020653633
+儿童 6.80395627348
+武汉热线 12.8020653633
+免去 8.76487921493
+消费主义 12.2912397395
+乌姆 11.1280889297
+拉丝模 13.2075304714
+大半日 11.7034530746
+场效应 10.8561552143
+所部 8.55357012126
+田方 13.2075304714
+扬言 9.26594866375
+一个二十七八岁 13.900677652
+调查核实 10.9562386728
+一寸光阴一寸金 13.2075304714
+主仆 9.33632946051
+金属制品 9.13850371718
+基南 13.2075304714
+孔雀王 13.2075304714
+主从 10.6818018271
+公开密钥 13.900677652
+卑谬 11.9547675029
+松油 11.7034530746
+中文版 10.642581114
+罗汉拳 12.8020653633
+石英石 9.96885201925
+主人 6.6042643832
+东胡 9.80633308975
+多粘菌素 12.2912397395
+陈隋 12.1089181827
+乐颠颠 12.2912397395
+主产 8.68574189437
+接生婆 11.3357282945
+秋交会 10.4349417492
+子从荣 13.2075304714
+邮政信箱 12.5143832909
+潘乔 12.5143832909
+失明 9.40086798165
+创作组 11.7034530746
+电弧焊 12.8020653633
+弘传教 13.2075304714
+比率智商 13.2075304714
+田旷 13.2075304714
+栾为夫 13.2075304714
+锐利武器 12.5143832909
+绞上 13.2075304714
+协调一致 9.7898037878
+罕言寡语 13.900677652
+玫瑰红 11.4157710022
+司法鉴定 11.8212361103
+百分之三 11.4157710022
+搞活流通 12.2912397395
+基化 13.2075304714
+球王 12.2912397395
+全钾 13.900677652
+前卫团 12.8020653633
+怕死 9.38981814546
+不分青红皂白 11.0674643079
+家长礼短 13.900677652
+斯温群 13.900677652
+宫禁 10.1394775363
+历封宗 13.2075304714
+所道 12.5143832909
+监察处 13.900677652
+罐车 10.1871055853
+英诺森 11.1926274509
+全钢 11.4157710022
+似真似假 13.2075304714
+冰川作用 9.85762638414
+乐宁 12.8020653633
+桑海语 12.8020653633
+天荒地老 12.2912397395
+松江 8.61747392324
+起承转合 12.5143832909
+长枪 9.04864738806
+台西 12.5143832909
+伊奥斯 13.900677652
+等温 10.5684731418
+十六进制 12.2912397395
+秋成 12.5143832909
+积极探索 9.46986085313
+主义 7.23117956212
+几万名 12.5143832909
+松永 12.8020653633
+有车有房 12.8020653633
+羞于启齿 12.2912397395
+都晋阳 13.2075304714
+彩市 12.2912397395
+诡辩 10.5684731418
+所选 10.0088573539
+赤痢 13.2075304714
+趋于平稳 10.8561552143
+特罗容 13.2075304714
+乌夷 12.8020653633
+乌头 9.71102290995
+摊前 10.9562386728
+昆士兰 10.8096351986
+陈阁 13.900677652
+锁簧 12.2912397395
+另搞一套 13.2075304714
+必保 12.8020653633
+圆锥形 9.19114745066
+总支出 10.4666904475
+秋扇 13.900677652
+东宫太子 11.8212361103
+主业 8.089536659
+松气 13.2075304714
+新亚述 11.598092559
+二维码 10.2897597393
+吴道子 10.0720362555
+我们仨 11.9547675029
+主上 9.6811699468
+郑吉发 13.2075304714
+墙头马上 11.9547675029
+允承 12.5143832909
+丰镇 11.9547675029
+桁梁 11.7034530746
+诬枉 13.900677652
+脉络 9.18217878068
+尉迟 10.5684731418
+冥报 13.900677652
+所里 10.3171587135
+片儿汤 12.8020653633
+迸发出 11.0103058941
+群居动物 13.2075304714
+推委 11.7034530746
+脉经 11.5027823792
+藓类沼泽 13.900677652
+主修 10.1630080337
+全错 12.5143832909
+主减速 13.2075304714
+警官 9.77354326693
+红纸 9.82314020807
+于燕京 11.9547675029
+王霞斐 9.35738286971
+冠词 11.8212361103
+跨世纪 10.9562386728
+做手势 11.3357282945
+柱身 11.9547675029
+豢养 10.2897597393
+食人鱼 11.7034530746
+椅凳 12.8020653633
+邀集 10.9049453784
+基利 12.1089181827
+北极光 12.2912397395
+失望 7.28193866846
+防风固沙 11.0103058941
+充磁 13.900677652
+夏占领 13.2075304714
+髽髻 13.2075304714
+佐野 13.900677652
+国世平 12.5143832909
+叫化子 10.1164880181
+王芸生 12.8020653633
+向巧慧 12.2912397395
+裴庄 12.8020653633
+徐乾学 11.7034530746
+席泽宗 13.900677652
+历史学家 8.31342899358
+松涛 10.2371160058
+主供 13.2075304714
+塔克拉玛干 11.3357282945
+基切 11.7034530746
+卡诺瓦 12.8020653633
+警察 7.53420720424
+沈铨 12.5143832909
+热心人 11.4157710022
+科研所 10.5684731418
+裴度 11.1280889297
+卫生部门 10.0720362555
+朱荣部 12.5143832909
+全镇 10.1630080337
+范老四 11.3357282945
+军转 12.8020653633
+戈定 13.2075304714
+陈静 11.5027823792
+提不到 13.2075304714
+争竞 10.8096351986
+智深醉 13.2075304714
+主使 11.1926274509
+张飞闻 13.900677652
+向西 8.1902506346
+为时不晚 12.2912397395
+洞若观火 11.9547675029
+威尔科 12.8020653633
+奇异果 12.2912397395
+点线面 13.900677652
+族谱 10.765183436
+主体 6.36431371357
+失计 11.7034530746
+青洪帮 12.2912397395
+下边带 13.900677652
+追本溯源 12.5143832909
+公房 10.9562386728
+黑眼镜 12.2912397395
+路面宽 13.900677652
+交会法 13.2075304714
+一两百万 13.2075304714
+争端 8.27666014579
+扑下 12.2912397395
+扑上 11.2616203224
+基勒 13.2075304714
+北极冰 12.5143832909
+周围神经 10.8096351986
+漆棺石 12.8020653633
+维尔京 12.8020653633
+总成本 10.4994802703
+人满 12.5143832909
+驼群 13.2075304714
+女大十八变 11.9547675029
+四百多 10.604840786
+艾赫萨 13.900677652
+元皇泰 13.2075304714
+蒸酥 12.1089181827
+陈震 11.7034530746
+鼠目獐头 13.900677652
+电弧炉 10.9562386728
+主伐 13.900677652
+将材 13.2075304714
+西沃图 13.2075304714
+直根 13.2075304714
+章丘县 11.8212361103
+山卓港 12.2912397395
+卫生部长 11.598092559
+以泪洗面 11.9547675029
+广福寺 12.5143832909
+拘留所 10.642581114
+二部合唱 13.900677652
+赤瓜 12.8020653633
+秉公办理 13.900677652
+饶巧莲 13.2075304714
+蛇药 12.8020653633
+分子结构 9.23723855786
+全知全能 11.8212361103
+清蒸鸡 13.2075304714
+遣散 10.1164880181
+杜卡特 12.8020653633
+用户群 12.1089181827
+实体 6.75706004927
+连通 9.10488710638
+授奖典礼 13.2075304714
+视域 11.9547675029
+西藏阿里地区 11.3357282945
+陈风 13.2075304714
+朱元津 12.5143832909
+球道 11.7034530746
+新闻官 11.598092559
+吴旗县 12.2912397395
+读取器 13.2075304714
+灵宝县 12.1089181827
+努里 12.5143832909
+主治医生 11.4157710022
+侯午敦 12.8020653633
+永磁体 12.5143832909
+暂用 11.9547675029
+而外 10.1394775363
+亚威农 12.8020653633
+宴席 9.22784881751
+内思 13.900677652
+这使 7.59440236503
+桁架 10.1871055853
+确实可靠 12.2912397395
+秋沙 11.598092559
+善始令终 13.2075304714
+胃溃疡 10.3171587135
+经验不足 11.0674643079
+鱼鳃 11.8212361103
+楚呼楚 13.2075304714
+秋波 10.4041700905
+箍紧 12.8020653633
+财产 6.81980975528
+转折关头 11.2616203224
+上中农 12.8020653633
+田毕 13.2075304714
+接生员 12.8020653633
+这伙 8.70772080109
+这会 8.15447446144
+社会议论 13.2075304714
+警哨 12.8020653633
+耶稣会 9.32596667347
+乏味 10.533381822
+军职 10.2897597393
+华严经 10.4666904475
+旬报 11.3357282945
+振动 7.80260336981
+二十七秒 13.900677652
+坚贞不渝 13.900677652
+麦格理 10.765183436
+雷默奇 13.900677652
+证券时报 7.41757030052
+精金 12.5143832909
+避孕环 12.5143832909
+彻夜不眠 11.0674643079
+澎湃 9.5186510173
+文为程 13.2075304714
+同场竞技 11.8212361103
+柱脚 12.8020653633
+戴宗往 12.8020653633
+多米诺 12.5143832909
+失检 12.8020653633
+签名 8.14493543839
+小珠山 13.2075304714
+秋水 9.66657114738
+直杆 12.5143832909
+松扣 13.900677652
+斯博岛 13.900677652
+这俩 10.2117981979
+立场问题 11.8212361103
+球部 13.2075304714
+陈顾 13.900677652
+一枝花 10.2371160058
+陈顼 12.2912397395
+胆管 10.533381822
+顾盼自雄 12.5143832909
+加入书 12.2912397395
+工具软件 12.8020653633
+流里流气 11.9547675029
+窥察 12.2912397395
+松手 9.37888907493
+秋气 12.1089181827
+重阳节 10.3171587135
+量子化学 10.3171587135
+蛇豕 13.900677652
+秋池 13.900677652
+直望 11.9547675029
+影印本 10.4666904475
+五十九年 10.9562386728
+红粉知己 13.2075304714
+萧皇后 9.11318590919
+装腔 13.900677652
+实例 9.09665660724
+站柜台 13.2075304714
+田歌 12.2912397395
+财主 9.27570483869
+新闻学 10.8561552143
+起居厅 13.900677652
+导向 7.86999239171
+警员 11.1926274509
+王长顺 8.29120585679
+视场 10.642581114
+详列 11.2616203224
+二次方程 11.3357282945
+小红道 13.900677652
+田正 13.900677652
+第三样 13.900677652
+李维斯 13.900677652
+奥尔岛 13.2075304714
+秋汛 10.9562386728
+警告 7.36253782821
+精采 10.9562386728
+血栓症 13.900677652
+几万家 13.900677652
+这么 4.71176522741
+实训室 13.900677652
+蒙垢 13.900677652
+绵力 12.8020653633
+任命书 12.8020653633
+大明寺 11.598092559
+翠亨 12.8020653633
+摆摆头 11.4157710022
+克劳德 11.8212361103
+翠亭 13.900677652
+用户线 13.900677652
+库勒湖 12.8020653633
+谷维素 13.900677652
+五千亩 12.1089181827
+退烧药 12.1089181827
+实乃 9.38981814546
+冥河 12.2912397395
+出超额 13.2075304714
+绝顶 10.1164880181
+严分宜 13.2075304714
+园林化 13.2075304714
+儿郎 11.598092559
+剥削制度 10.765183436
+首都体育馆 13.900677652
+储物柜 13.900677652
+基层 7.61281909181
+叶子 7.2673592187
+翠云 10.2630914922
+江苏省 7.74794495727
+吁请 10.9049453784
+实习 8.80692745117
+跑程 13.2075304714
+史良 11.598092559
+沈骥 11.7034530746
+这下 8.46695564842
+一千一百八十 13.2075304714
+充盈 10.0294766411
+持球者 13.2075304714
+毕勒哥 13.2075304714
+海内无双 13.900677652
+这一 5.01426848513
+倒垂 11.9547675029
+卫藏 11.8212361103
+基尼 11.9547675029
+国庆节 8.30225569298
+遵义 9.38981814546
+充盛 11.9547675029
+籍闲 12.8020653633
+大明宫 10.642581114
+虎耳 13.900677652
+镇压者 13.900677652
+实为 8.33233314821
+这个 3.56732510451
+那楚卿 12.2912397395
+用户组 13.2075304714
+电信法 13.900677652
+手压式 13.900677652
+十面埋伏 10.5684731418
+哈金斯 12.8020653633
+基尔 10.0294766411
+割断 9.23723855786
+左旋体 12.1089181827
+鱼鲜 11.9547675029
+实付 11.9547675029
+振华 9.49395840471
+简便易行 11.0674643079
+干槽症 13.900677652
+算在内 11.4157710022
+桌灯 13.2075304714
+绝食 9.62401153296
+三一回 12.8020653633
+粘附 9.72629038208
+西诸郡 13.2075304714
+高头大马 10.765183436
+痴丫头 12.2912397395
+五千个 13.2075304714
+耐化学 11.0674643079
+振南 13.900677652
+四百块 12.8020653633
+五千两 10.1164880181
+叶寻 13.2075304714
+钮经义 13.2075304714
+黑水晶 12.8020653633
+火山地震 11.4157710022
+蜂窝状 10.604840786
+放唱片 13.2075304714
+花颜月貌 13.900677652
+狂热者 12.5143832909
+内栖凤 13.2075304714
+虎胆 13.2075304714
+实价 11.4157710022
+另起 11.598092559
+这份 7.18408287845
+北邻温 13.2075304714
+田横 11.1280889297
+石英砂 9.36807815882
+镇宁 11.5027823792
+这件 6.10750330479
+这事 6.67156377418
+大姐大 12.1089181827
+糜棱岩 11.8212361103
+并行不悖 11.4157710022
+拉赫玛 12.5143832909
+逆党 11.3357282945
+那社友 13.900677652
+麦穗鱼 13.2075304714
+这些 3.84434026535
+实事 8.91707103027
+扼流圈 13.900677652
+叶家 9.75754292558
+急躁不安 12.8020653633
+逆光 11.598092559
+韩魏 12.2912397395
+逼上来 12.8020653633
+叶宽 11.7034530746
+观察入微 13.2075304714
+班车 9.41204128224
+马库斯 13.2075304714
+班轮 9.82314020807
+浩劫 9.82314020807
+交换代数 12.8020653633
+陆小曼 13.900677652
+补气血 11.9547675029
+这人 7.50876053858
+经济侵略 11.0674643079
+不锈钢丝 13.2075304714
+希特勒法西斯 12.2912397395
+实交 12.8020653633
+财会 11.7034530746
+净心 13.2075304714
+朱元漳 13.2075304714
+云山 9.28555713513
+沈香 13.900677652
+布卢尔 13.2075304714
+虎坊桥 11.5027823792
+明治天皇 11.1926274509
+经典力学 10.2117981979
+祖界内 13.2075304714
+合适 6.74840879594
+信用度 11.3357282945
+石英管 13.2075304714
+兵丁 8.83808261895
+异口同声 9.87532596124
+李顺听 13.2075304714
+祷文 12.8020653633
+军舰 8.05135287203
+跳海自杀 12.5143832909
+兵临 9.66657114738
+军船 12.8020653633
+陆元九 12.8020653633
+逆势 8.56795885871
+免得 7.6604018068
+刮治 13.900677652
+呵气 11.3357282945
+抗结核 10.9049453784
+书符咒水 13.900677652
+五十九岁 11.9547675029
+波仑亚 13.900677652
+全顺 12.1089181827
+汪德 13.2075304714
+陈骞 12.1089181827
+台湾大学 10.0505300503
+写经 10.6818018271
+凡需 13.2075304714
+熊式机 13.900677652
+大展宏图 12.5143832909
+然谷 13.900677652
+写给 8.89673134603
+曹冲称象 13.900677652
+平心静气 10.533381822
+谋略家 12.8020653633
+代表作品 10.0088573539
+黏胶 13.900677652
+清蒸鱼 13.2075304714
+细事 12.1089181827
+国际联盟 9.40086798165
+诺成合同 13.2075304714
+英纳格 12.1089181827
+叶堂 12.8020653633
+蓝一白 13.2075304714
+秋装 13.900677652
+汤斯维尔 13.900677652
+福堂哥 12.1089181827
+兵乱 11.3357282945
+河口县 12.2912397395
+知青点 11.8212361103
+冶金 7.36398605438
+管长径 13.2075304714
+蜂窝煤 12.5143832909
+增加收入 10.604840786
+基弗 12.8020653633
+五体投地 10.4994802703
+冷子管 13.900677652
+一二四 13.900677652
+新闻处 10.9562386728
+高卢人 11.3357282945
+万千克 11.3357282945
+煤成气 12.5143832909
+哈哈大笑 7.81163277653
+高档轿车 12.1089181827
+建成区 10.9049453784
+过出 13.900677652
+兵事 11.1926274509
+产业协会 12.1089181827
+紫堇 12.5143832909
+秋游 12.2912397395
+阿拉丁 11.9547675029
+镜架 12.1089181827
+曲鸣丽 13.2075304714
+弃之不顾 12.8020653633
+郎瑛 12.8020653633
+全额 8.88339781516
+造影剂 11.2616203224
+地方法院 10.9049453784
+极漂亮 13.900677652
+从如皋 12.2912397395
+谭延 10.9049453784
+捧心 12.8020653633
+定期维护 13.900677652
+扎瓦 12.8020653633
+史臣 11.8212361103
+充电 9.21854642485
+陈粮 12.8020653633
+而定 8.10461990121
+中兴 8.05135287203
+勿要 11.8212361103
+民族色彩 11.7034530746
+捏积 13.900677652
+龙门刨 12.1089181827
+四百名 11.5027823792
+成国公 11.2616203224
+红绿锦 12.2912397395
+付之密 12.8020653633
+细丝 10.8096351986
+新闻奖 12.2912397395
+酯交换 13.2075304714
+基德 12.1089181827
+免役 10.2117981979
+屏幕 8.83177344976
+毫无顾忌 10.3171587135
+捧得 11.3357282945
+视唱 13.2075304714
+片甲无存 13.900677652
+全食 12.1089181827
+几米 10.0940151622
+奥赫洛普 12.8020653633
+重见天日 10.2630914922
+新品 9.29550746599
+任勇 11.0674643079
+石蕊试纸 12.8020653633
+班超 9.98865464655
+跨区 11.1926274509
+举为 10.5684731418
+米勒指数 13.2075304714
+三十六个 10.1394775363
+龙门口 12.8020653633
+外来人口 10.7226238216
+主动防御 12.5143832909
+比彻姆 13.2075304714
+一座座 9.75754292558
+举个 9.96885201925
+几类 9.5062284973
+贸促会 11.1926274509
+逆压 12.8020653633
+基干 11.3357282945
+概念模式 13.900677652
+阿亚 12.8020653633
+三十六万 12.5143832909
+辛伯达 12.8020653633
+求田问舍 12.2912397395
+三十六七 13.900677652
+珠江三角洲 9.01787572939
+西法洋 13.900677652
+制冷量 12.8020653633
+气体云 12.2912397395
+复调音乐 11.598092559
+任伏威 13.2075304714
+辞不达意 13.2075304714
+一九六六年 11.7034530746
+一百篇 12.8020653633
+直撞 11.598092559
+悲观厌世 13.900677652
+沈飞 12.2912397395
+利玛窦 10.1630080337
+逆变 11.2616203224
+基带 11.1926274509
+张德伍 12.5143832909
+前呼后应 12.8020653633
+一百多天 12.2912397395
+顺意 13.900677652
+龙门县 11.9547675029
+大英百科全书 13.2075304714
+忆儿 11.598092559
+逆反 11.4157710022
+悟出 9.84023464143
+坟山 11.5027823792
+微不足道 8.85082164473
+宁道何 12.8020653633
+形势教育 13.900677652
+基布 13.900677652
+狠毒 9.74179456862
+入门级 10.2897597393
+嫖妓 11.3357282945
+吴玉桂 13.2075304714
+除异味 12.5143832909
+孙少平 7.83456956187
+商业信息 11.8212361103
+举人 8.11378027061
+候潮路 12.2912397395
+阿克莫拉 13.900677652
+息战 12.8020653633
+细作 8.35941410682
+英国公司 12.1089181827
+瞎火 12.5143832909
+基建 8.20023407859
+接上去 11.5027823792
+直摆 13.2075304714
+孝行 12.1089181827
+基廷 12.8020653633
+查尔斯 9.71102290995
+徐图灭 12.8020653633
+捏碎 11.9547675029
+鲁西尔 13.900677652
+思考力 12.5143832909
+拉赞助 13.2075304714
+导坑 11.9547675029
+米开朗琪罗 10.1164880181
+总督府 10.0940151622
+离婚者 13.900677652
+火伞 12.8020653633
+阿拉伯 7.21232293803
+割来 13.2075304714
+举事 10.0088573539
+裹挟 10.2371160058
+马赫雷 13.900677652
+振兴 7.45178825783
+全馆 12.2912397395
+微胶囊 13.2075304714
+任何借口 11.3357282945
+垦丁 13.2075304714
+火毒 11.0674643079
+不求闻达 12.2912397395
+基座 9.77354326693
+葛巾布 12.8020653633
+三十六代 12.8020653633
+体会出 13.900677652
+西溪 11.0103058941
+乞降 10.2117981979
+山麓堆积 12.2912397395
+增压器 11.1280889297
+赤磷 13.900677652
+视同 10.4994802703
+团藻 11.4157710022
+王之学 12.5143832909
+平民百姓 9.74179456862
+活期储蓄 11.8212361103
+叶妈 13.900677652
+练习 8.05713323494
+殷一璀 12.8020653633
+马屁股 11.2616203224
+乌合 12.5143832909
+封太尉 13.2075304714
+熟皮 13.900677652
+收益权 10.8561552143
+基底 8.87023973058
+赵叔翘 13.900677652
+明成祖 9.49395840471
+视听 9.25628675283
+月亮神 12.5143832909
+拳击场 12.5143832909
+不作声 10.1871055853
+高济宇 13.2075304714
+占全邦 13.900677652
+机关团体 13.900677652
+系为 10.9562386728
+石设羽 13.2075304714
+在线点播 13.900677652
+朝觐者 12.2912397395
+右翼中旗 13.2075304714
+公交站点 12.5143832909
+厄瓜多尔政府 12.1089181827
+反作用 9.43476953332
+南门 8.50251495046
+起房子 13.900677652
+十五秒 13.900677652
+忠君报国 13.900677652
+实景图 12.5143832909
+人格化 10.1630080337
+死不休 12.8020653633
+克清州 13.2075304714
+合阳 11.8212361103
+肯出去 13.2075304714
+邹伯奇 12.5143832909
+振国 12.5143832909
+戈科夫 13.900677652
+土鸡瓦犬 13.900677652
+军营 8.62256299275
+乌发 11.1926274509
+艾赫迈 13.2075304714
+系上 10.3743171274
+相交多年 13.900677652
+这三类 11.8212361103
+威尔特 12.2912397395
+肆虐 9.23723855786
+广域 13.900677652
+兴会 12.5143832909
+小型企业 10.604840786
+电视监控系统 13.2075304714
+明文禁止 11.5027823792
+刘理 13.2075304714
+岩心 11.1926274509
+南闾 13.2075304714
+叶常 11.2616203224
+向芬 13.900677652
+十余道 13.2075304714
+云尔 13.900677652
+诸子之 11.7034530746
+签注 13.2075304714
+民生报 13.900677652
+底细 8.80081122415
+黄褐色 9.03314320152
+情报服务 12.5143832909
+未妥 13.2075304714
+蒲类海 11.5027823792
+股东权益 9.66657114738
+基多 10.7226238216
+劝导 9.85762638414
+鲜亮 9.96885201925
+直接 4.8390693338
+实体性 11.7034530746
+逆向 9.69598503258
+重赏之下 11.9547675029
+参展国 13.2075304714
+宣讲会 12.8020653633
+一百米 11.4157710022
+延边州 12.8020653633
+诸子亦 12.8020653633
+淅淅沥沥 11.8212361103
+史林 13.900677652
+聪明起来 11.7034530746
+团花 10.533381822
+不可多得 10.1871055853
+燕青辞 12.8020653633
+诸子争 11.5027823792
+仍要 9.55687223012
+主题乐园 9.89334446674
+直捷 12.2912397395
+基姆 13.2075304714
+大袋蛾 12.8020653633
+兴修 9.72629038208
+外来人员 12.1089181827
+业内外 11.3357282945
+乌丸校 13.900677652
+站稳脚步 11.3357282945
+催人老 12.2912397395
+遇难呈祥 12.8020653633
+慢一拍 12.8020653633
+系于 10.1630080337
+花开花谢 12.5143832909
+藕节 12.2912397395
+几万年 11.598092559
+飘过来 11.7034530746
+电信楼 13.900677652
+产额 11.7034530746
+许自昌 13.2075304714
+阿二 11.0103058941
+世上无难事 12.2912397395
+谐波 10.3171587135
+而已 6.72289523578
+乌龙院 13.2075304714
+直指 8.86372504956
+蛇行 11.598092559
+直挂 12.8020653633
+龙门吊 13.900677652
+直挺 11.7034530746
+十余部 12.2912397395
+卫恒 12.1089181827
+多分 10.8561552143
+全黑 10.4666904475
+逆命 12.5143832909
+诸子仅 13.2075304714
+减弱到 12.8020653633
+秋桐 11.3357282945
+梁封钱 12.8020653633
+松明 12.5143832909
+掀被 13.2075304714
+刘二军 11.9547675029
+教学服务 13.900677652
+金沙江流域 12.1089181827
+镏金 11.7034530746
+门襄仲 13.2075304714
+窥破 12.1089181827
+诸子传 13.2075304714
+硅氧烷 12.2912397395
+施存统 11.9547675029
+团茶 12.5143832909
+直拍 11.9547675029
+变通处理 13.900677652
+直拉 12.2912397395
+人事主管 13.900677652
+饲养员 10.1164880181
+伍鸿 13.900677652
+凡百 11.7034530746
+回家吧 10.4994802703
+涉险 10.9049453784
+达云贵 13.2075304714
+鲁曼 13.2075304714
+总体布局 10.3743171274
+松柔 13.2075304714
+直拳 13.2075304714
+军风纪 12.8020653633
+平卢节 13.2075304714
+求医者 13.2075304714
+石英粉 13.900677652
+乌勒 11.9547675029
+军操 13.900677652
+俯拾皆是 12.2912397395
+松柏 9.32596667347
+灾害性 10.1871055853
+用户端 11.7034530746
+孔明回 11.7034530746
+兴业 7.30626419223
+先验论 11.3357282945
+明诗综 12.5143832909
+视力 8.14493543839
+直抒 11.9547675029
+庆祝 8.24119543622
+跑得慢 11.8212361103
+陶瓷工业 10.9562386728
+关贸总协定 11.9547675029
+突然行动 13.2075304714
+南明诸 12.8020653633
+察知 11.9547675029
+兴举 12.8020653633
+继续发扬 12.5143832909
+松果 11.1926274509
+松枝 10.4349417492
+司一职 12.5143832909
+不世奇勋 13.900677652
+戈兰 13.2075304714
+遣怀 12.5143832909
+玉堂春 11.2616203224
+生津止渴 11.4157710022
+松林 8.86372504956
+马路消息 13.2075304714
+敝邦 12.5143832909
+自由空间 11.5027823792
+问鼎中原 13.2075304714
+戴渊 11.3357282945
+用工夫 12.2912397395
+乌力 9.35738286971
+罗马尼亚议会 13.900677652
+麻子 9.75754292558
+公然反抗 13.900677652
+都洛邑 11.7034530746
+松松 10.8561552143
+克烈 11.3357282945
+莫利纳 12.1089181827
+预测出 13.900677652
+谷马 13.900677652
+赤红 10.4041700905
+林护士 13.2075304714
+直扑 9.85762638414
+脱燃素 12.2912397395
+子刘琮 11.8212361103
+垮下去 12.8020653633
+泥人张 11.7034530746
+椅子 7.07088391446
+兴仁 12.8020653633
+邓辛张 12.8020653633
+教书育人 11.7034530746
+球门 10.4349417492
+砰然 11.7034530746
+沈鸿 12.5143832909
+蒲结努 13.2075304714
+松材 13.900677652
+吴芮 11.598092559
+巧遇 10.2117981979
+武川县 13.2075304714
+扭来扭去 12.5143832909
+叶志 10.7226238216
+抖起来 11.1926274509
+没劲儿 11.8212361103
+煤老板 9.12155415886
+宴客 11.2616203224
+莫雷洛斯 11.8212361103
+十余里 10.2117981979
+请问 7.57095674645
+乌利 12.5143832909
+松木 10.3453295905
+等效 10.1871055853
+冷眼旁观 11.5027823792
+沈鹏 13.2075304714
+读若 12.1089181827
+吴少阳 12.1089181827
+一百六十四里 13.2075304714
+脉理 11.8212361103
+争点 13.2075304714
+写票 12.8020653633
+倾心 9.49395840471
+碱水 11.1926274509
+洪秀全 9.89334446674
+怕怕 13.2075304714
+之见 8.6966709649
+郡王 8.70218062071
+冠脉 10.9562386728
+新址 11.598092559
+人质危机 13.900677652
+旅游城 11.598092559
+李三娘 13.2075304714
+直截 11.9547675029
+李小龙 11.1926274509
+硬闯 11.8212361103
+台航 13.900677652
+耳目股肱 13.2075304714
+金碧辉映 13.900677652
+堆积如山 9.58318953844
+酵解 13.900677652
+精华素 12.5143832909
+息肉 10.0088573539
+捏紧 10.765183436
+薯蓣 10.9562386728
+忿恨 11.3357282945
+镊子 11.1280889297
+注射机 12.2912397395
+警务 11.9547675029
+汉普夏 12.5143832909
+中毒事件 11.8212361103
+亚圣府 12.8020653633
+阿拔斯 9.53122979951
+晦涩 9.98865464655
+棍儿 10.533381822
+依附性 11.1280889297
+而异 8.22050504296
+息肩 13.2075304714
+萧亚轩 13.900677652
+传令兵 12.5143832909
+脉石 12.5143832909
+警力 9.94943393339
+村党委 13.900677652
+极右派 11.8212361103
+闭关锁国 11.5027823792
+尽到责任 11.7034530746
+疑点重重 12.8020653633
+吕大人 13.2075304714
+看菜吃饭 13.900677652
+仁丹 12.1089181827
+三一八 11.8212361103
+海外华人 11.8212361103
+方时亨 13.900677652
+免官 10.6818018271
+六号楼 13.900677652
+慰留 10.9562386728
+治疗率 13.900677652
+仁义 8.73589167805
+老仙翁 12.5143832909
+球阀 13.900677652
+刚进山 12.2912397395
+球队 8.63281949291
+重要性 7.54804825566
+替补队员 13.900677652
+离心分离 11.0103058941
+松赞干布 10.0294766411
+宁海城 11.9547675029
+伪足 11.3357282945
+节线 13.2075304714
+合为 9.29550746599
+团职 12.2912397395
+龙王潭公园 13.2075304714
+请降 10.2117981979
+奥美拉唑 13.900677652
+封司马懿 12.8020653633
+参与制 11.9547675029
+独步天下 12.8020653633
+干脆利落 11.2616203224
+叶尔 12.2912397395
+烤成 12.8020653633
+叶尖 11.7034530746
+党卫军 10.1871055853
+杨百利 9.91169360541
+团聚 9.36807815882
+大明山 11.0674643079
+孙少安 7.94484028251
+婆婆 8.00352378434
+杯中物 13.900677652
+田洙 13.900677652
+南萨哈林斯克 13.900677652
+家家酒 13.2075304714
+陈鹏 11.5027823792
+乌兰 11.7034530746
+田洋 12.1089181827
+英国圣公会 11.1280889297
+冶锻 12.8020653633
+冯氏兄弟 12.1089181827
+乌兹 12.8020653633
+日益壮大 11.3357282945
+杨廷和 12.2912397395
+晒黑 11.5027823792
+视其 10.4666904475
+向北飞 12.1089181827
+上荣木 13.2075304714
+襟怀坦白 12.5143832909
+微电子 9.5062284973
+乌光 13.2075304714
+驿舍 12.2912397395
+乏力 8.10158499752
+六十二万册 13.2075304714
+写稿 11.9547675029
+殖民地化 11.598092559
+司府厅 13.900677652
+仁人 11.1926274509
+些许端 13.2075304714
+吕大临 11.8212361103
+正巧有 12.8020653633
+空间电荷 11.5027823792
+焦干 11.3357282945
+割成 11.5027823792
+中共一大 12.5143832909
+牛魔王 10.4666904475
+差之千里 12.5143832909
+陈留尉 12.2912397395
+西药房 13.900677652
+卡普萨 13.2075304714
+余怀一 11.598092559
+莫德斯 13.900677652
+死契 13.2075304714
+缝制 9.61021821083
+结肠镜 11.598092559
+栗原 13.2075304714
+合同商 12.8020653633
+慢速度 13.900677652
+毒如蛇蝎 13.900677652
+神创论 12.1089181827
+鹫峰山 11.9547675029
+合铸 13.900677652
+而必 12.5143832909
+销售市场 9.66657114738
+几毫米 11.0674643079
+匪气 11.9547675029
+棉外套 13.900677652
+刘厚生 13.2075304714
+一甲胺 12.8020653633
+夸特 8.59240995457
+耽误到 12.2912397395
+预测值 9.6811699468
+王潮卒 13.2075304714
+而带 11.3357282945
+贫下中农 9.44633035572
+恢宏 10.6818018271
+卧铺票 11.9547675029
+言积庆 13.2075304714
+屏弃 12.2912397395
+节结 13.900677652
+台胞 11.598092559
+鞘翅 11.0674643079
+雷格蒙 12.5143832909
+向臣 10.9562386728
+营销员 11.4157710022
+可攻 11.9547675029
+归德侯 12.8020653633
+不一而足 10.4994802703
+气象火箭 12.1089181827
+提过去 12.2912397395
+视像 11.8212361103
+无情无义 10.533381822
+转弯半径 11.7034530746
+演兵场 12.8020653633
+旬日 10.0088573539
+虎虎 11.8212361103
+静修 10.9049453784
+秋残 13.2075304714
+球面 9.5062284973
+孟府 11.7034530746
+单晶硅 10.9049453784
+卷子本 13.900677652
+各直属 13.2075304714
+勤俭持家 12.8020653633
+吡喃糖 11.9547675029
+读者 7.42370528909
+佩吉特 12.5143832909
+碱滩 13.2075304714
+工余 11.9547675029
+小秘书 12.5143832909
+参展商 10.2117981979
+轴比 13.900677652
+荧光粉 11.1280889297
+矿长 11.1280889297
+松方 12.8020653633
+陈龙 13.900677652
+熔铸 10.4666904475
+警号 11.9547675029
+秋毫 12.1089181827
+发慌 9.89334446674
+写篇 13.2075304714
+莹润 11.3357282945
+段志贤 12.8020653633
+仲裁法 11.5027823792
+警句 11.0103058941
+高度负责 11.0674643079
+除虫菊 10.9562386728
+割掉 10.2630914922
+王圆箓 12.8020653633
+冶铁 9.12999302751
+籽实 12.2912397395
+遣戍 11.2616203224
+跨文化 12.2912397395
+普洛耶什蒂 12.2912397395
+警风 13.900677652
+光滑性 12.8020653633
+田泽 11.7034530746
+房改房 11.9547675029
+将机就计 13.900677652
+原代码 13.900677652
+眼神儿 12.1089181827
+二棱大麦 12.8020653633
+土地交易 10.533381822
+逗笑儿 13.900677652
+啃掉 11.8212361103
+莫斯科大剧院 11.3357282945
+台联 13.900677652
+抱出去 13.900677652
+催泪 11.9547675029
+书信往来 11.8212361103
+阿根廷海军 12.8020653633
+四百元 12.1089181827
+太圆 13.2075304714
+浦江两岸 12.5143832909
+卫生部医政司 11.2616203224
+新型 6.86805339095
+升回去 13.900677652
+警匪 13.900677652
+松散 8.52539924429
+冷静下来 9.34680076038
+田氏 11.0674643079
+亚喀巴湾 11.4157710022
+跳蚤市场 12.1089181827
+晦气 8.96620371885
+叶面肥 13.2075304714
+事出有因 10.1630080337
+戒严法 13.900677652
+而应 9.53122979951
+镜报 11.8212361103
+王越 11.9547675029
+异步电动 11.9547675029
+割据 8.092535162
+波诺夫 13.2075304714
+东冲西撞 13.2075304714
+阿会喃 11.7034530746
+球鞋 11.4157710022
+新闻局 11.1926274509
+静伏 12.5143832909
+个人专辑 12.8020653633
+大片大片 10.3171587135
+狄仁杰 11.3357282945
+废品站 13.2075304714
+史蒂 13.2075304714
+谷山寨 13.2075304714
+田汉 10.1394775363
+完全相同 8.75318317516
+宝景 13.900677652
+仁信 13.900677652
+陈鼻 8.69119149913
+合闸 12.5143832909
+杲杲 13.900677652
+自营权 12.5143832909
+莹洁 11.9547675029
+龙兵 12.2912397395
+流动资产 9.87532596124
+何九叔 10.3453295905
+谭家 12.2912397395
+八路军总部 11.0674643079
+二杯 11.9547675029
+副会长 7.69814213479
+卡通人物 13.2075304714
+松竹 11.1926274509
+系到 12.1089181827
+凡此 11.9547675029
+财团 8.83177344976
+兴南 13.2075304714
+全舰 11.0103058941
+一清二楚 9.13850371718
+民权主义 11.1280889297
+七十二家 12.8020653633
+兴华 9.87532596124
+粘连 9.58318953844
+半公开 12.5143832909
+全般 12.5143832909
+滚边 10.9562386728
+克拉玛依油田 11.8212361103
+伍拾 13.2075304714
+史明 13.900677652
+这块 7.22233553732
+疑人不用 12.8020653633
+朱文 11.3357282945
+桌椅板凳 11.0674643079
+系列 6.55531281156
+泪珠儿 11.4157710022
+球衣 11.9547675029
+木板床 11.598092559
+赌坊 13.900677652
+帕拉马里博 12.8020653633
+侍立阶 12.1089181827
+诸子则 13.2075304714
+松立 12.8020653633
+天威集团 13.900677652
+块长 12.8020653633
+失火 10.4041700905
+现行标准 13.2075304714
+誊清 11.9547675029
+吴少诚 13.2075304714
+控温器 13.900677652
+黏稠度 11.8212361103
+祸福与共 13.2075304714
+兵员 9.5186510173
+全色 12.8020653633
+险韵 12.8020653633
+快当 11.5027823792
+唐季 12.2912397395
+宫廷舞 11.1926274509
+气乎乎 13.900677652
+不慌不忙 8.73589167805
+平潭厅 12.8020653633
+渗出来 10.7226238216
+潘塔 12.8020653633
+尉领 13.2075304714
+平潭县 12.5143832909
+晕高 13.900677652
+公务人员 9.98865464655
+电喇叭 12.2912397395
+转运站 10.604840786
+瞭望台 12.8020653633
+实地 8.37522471284
+主墙 13.900677652
+举世皆知 13.900677652
+罗小梅 8.89673134603
+实在 5.88502003742
+太监急 12.2912397395
+四百人 10.8561552143
+八大山人 12.5143832909
+黄元林 12.5143832909
+全艇 12.5143832909
+唐家 11.7034530746
+逆命题 13.900677652
+齐一儒 12.8020653633
+莫管闲事 12.5143832909
+视作 9.04086524761
+兴发 11.0674643079
+由雅科 13.2075304714
+眼泡皮 13.2075304714
+快得 11.0103058941
+青饲料 11.8212361103
+麦角胺 12.5143832909
+萧关 12.2912397395
+贾法尔 12.5143832909
+一九二四年 13.900677652
+田猎 10.533381822
+孔明奏 12.5143832909
+伊斯坎 13.900677652
+荒田 11.1926274509
+声气 10.533381822
+兴叹 10.3743171274
+唐定 11.9547675029
+脑血管病 11.1926274509
+小组活动 13.2075304714
+到埠 13.2075304714
+准时到达 12.5143832909
+球裤 13.900677652
+唐宁 12.5143832909
+唐宅 11.7034530746
+跑掉 9.71102290995
+坝王岭 11.3357282945
+锺馗 13.900677652
+津巴布韦非洲民族联盟 13.2075304714
+黯然无光 13.2075304714
+乌伦 12.8020653633
+金天氏 12.5143832909
+一百一十二 12.8020653633
+理论指导 10.6818018271
+高级专员 11.5027823792
+曾静 12.5143832909
+四百万 10.8096351986
+全英 11.2616203224
+百六 13.2075304714
+静候 9.98865464655
+加索尔 12.8020653633
+非标准 11.1926274509
+百分之几十 13.900677652
+缓激肽 11.9547675029
+感光度 12.2912397395
+陈耀 13.2075304714
+哀而不伤 13.2075304714
+秋瑾 10.8561552143
+墨翟 12.1089181827
+兴县 10.2897597393
+桌椅 9.19114745066
+四百个 12.5143832909
+赔付 9.23723855786
+陈耽 13.900677652
+快快 8.6966709649
+内外夹攻 10.9049453784
+四百两 10.765183436
+和平乡 13.2075304714
+流水不腐 13.2075304714
+全苗 12.8020653633
+权益日 13.900677652
+戚继光 8.9308643524
+岑文本 11.598092559
+全苏 10.4994802703
+唐寅 10.7226238216
+察看 8.33999602096
+两万五千里 13.2075304714
+凤眼莲 12.2912397395
+念青唐古拉山脉 10.6818018271
+割腕 12.1089181827
+索公田 13.2075304714
+潘多 12.2912397395
+直经 12.8020653633
+向德川 12.8020653633
+虎须 10.9562386728
+交会穴 11.598092559
+冷光源 12.2912397395
+阿拉善 9.96885201925
+齐二公子 12.8020653633
+卡里莫夫 12.8020653633
+三十六名 13.2075304714
+若有若无 9.80633308975
+总务科 12.2912397395
+准直 11.0674643079
+第四十五章 11.1926274509
+乌什 10.4349417492
+主委 10.9562386728
+陈至 13.2075304714
+遵嘱 13.2075304714
+唐娜 13.900677652
+充溢 10.4041700905
+维甲酸 12.2912397395
+温飞卿 12.5143832909
+分级淬火 13.900677652
+松篁 11.598092559
+红外灯 13.2075304714
+仁儿 11.598092559
+捏成 11.0103058941
+静冈 11.7034530746
+仁兄 9.32596667347
+豪夺 13.2075304714
+乌亮 11.0103058941
+彼得堡 9.38981814546
+争气 9.98865464655
+握手言欢 12.5143832909
+记工 12.2912397395
+伊达尔戈 11.5027823792
+紧张感 12.1089181827
+贼巢 11.0103058941
+潮白河 10.2371160058
+微型化 11.2616203224
+千古罪人 11.0103058941
+工程装饰 12.2912397395
+潸然 11.7034530746
+明幼主 13.2075304714
+周泰者 13.2075304714
+直线 7.75649201785
+五十六部 13.2075304714
+军饷 8.9102450652
+赤手 12.1089181827
+点回去 13.2075304714
+向宣抚 12.2912397395
+千姿万态 13.900677652
+接收端 12.5143832909
+充满 6.35899455209
+裴少俊 12.8020653633
+快干 11.1280889297
+全草 10.3171587135
+主妇 10.2897597393
+三十六员 11.7034530746
+乌云 8.05713323494
+着眼于 8.77077893705
+唐婉 13.900677652
+田独 12.1089181827
+吉田茂 12.2912397395
+退居幕后 12.1089181827
+读报 11.0674643079
+乌孜别克 10.5684731418
+鲜卑 8.03138073884
+不擅辞令 13.900677652
+面部皮肤 11.5027823792
+籍贯 9.44633035572
+人流 8.63798746307
+脉案 13.2075304714
+煦煦孑孑 13.900677652
+秋田 10.7226238216
+这回 7.38300637906
+视之 9.35738286971
+视乎 11.4157710022
+莫塔瓜 13.900677652
+东冲西突 12.8020653633
+田父 13.900677652
+田爷 11.7034530746
+礼多必诈 13.900677652
+炷头香 13.900677652
+田爹 11.3357282945
+本民 12.8020653633
+桌案 10.3171587135
+奖惩条例 12.8020653633
+黄宗会 9.30555780184
+静养 10.4041700905
+合议 11.4157710022
+对台贸易 13.2075304714
+加饭酒 12.2912397395
+合训 13.900677652
+合订 11.9547675029
+合计 6.34372707996
+施政纲领 10.533381822
+煤炭市场 10.0940151622
+红外热 12.8020653633
+兴办 8.62256299275
+汶川县 11.9547675029
+屡败屡战 11.5027823792
+老拙 11.0674643079
+尚无先例 12.2912397395
+阵雨般 13.2075304714
+攒竹 13.2075304714
+两手空空 10.0720362555
+班次 11.2616203224
+李狗皮 12.5143832909
+白鸟 12.8020653633
+王太子晋 13.2075304714
+陈邦贤 12.8020653633
+乌丸 12.8020653633
+八阵图 11.4157710022
+十余路 13.2075304714
+请见 11.5027823792
+绝育 11.5027823792
+舍本逐末 12.1089181827
+视为 6.80065048535
+马尔扎 13.900677652
+普及教育 10.9049453784
+贺客盈门 13.2075304714
+跌宕 10.1871055853
+块钱 9.05649056552
+惧于 13.2075304714
+举哀 10.533381822
+印第安纳 11.3357282945
+乌丝 13.900677652
+诸子受 13.2075304714
+左善世 13.2075304714
+进出口额 11.1926274509
+大把大把 10.4666904475
+拉尔森 13.900677652
+外感内伤 13.900677652
+割绒 13.900677652
+自聚焦 13.900677652
+一百拳 13.900677652
+执法水平 12.2912397395
+乾柴 12.8020653633
+穴道 11.9547675029
+系统漏洞 13.900677652
+吡哆胺 12.8020653633
+锥体外系 12.1089181827
+入会者 12.1089181827
+唐天 11.5027823792
+兴元 10.5684731418
+阴错阳差 11.9547675029
+几级 11.1280889297
+全羊 12.5143832909
+戈丹 12.8020653633
+仍需 8.22050504296
+慕容德 11.9547675029
+杯中酒 11.3357282945
+钨铁 13.2075304714
+兴兵 8.9308643524
+虎魄 13.900677652
+第四十八届 13.900677652
+谓之 8.65893063692
+庆春 12.8020653633
+失物 13.2075304714
+相威胁 10.765183436
+第八段 13.900677652
+颜色立体 12.2912397395
+第二十七章 10.4994802703
+唐复 10.9049453784
+逸士 12.1089181827
+狠狠 7.57274086825
+萨莫特 13.900677652
+莺声燕语 13.2075304714
+解除疑虑 13.2075304714
+六七六 12.2912397395
+静力 10.4041700905
+内廷太监 12.5143832909
+储备粮 11.1926274509
+团鱼 12.1089181827
+熔解 11.5027823792
+巧辩 12.5143832909
+闲篇 11.9547675029
+王之弟 11.1280889297
+怕羞 11.1926274509
+十二三年 13.900677652
+非洲地区 11.3357282945
+海上花列 12.5143832909
+子刘毓 13.2075304714
+干热风 10.4666904475
+割线 12.8020653633
+细嚼 11.598092559
+扁平疣 12.5143832909
+病病歪歪 12.2912397395
+就求 12.1089181827
+销售策略 11.5027823792
+乱摊派 12.5143832909
+耶罗 13.900677652
+三十六块 13.2075304714
+特罗伊 12.5143832909
+军马 7.27395990273
+劣质品 13.900677652
+受难记 13.2075304714
+写明 9.74179456862
+人治 11.0674643079
+扔在脑后 12.8020653633
+测量体温 12.2912397395
+明初建 12.1089181827
+啊呀呀 11.5027823792
+总教习 11.3357282945
+自然硫 11.8212361103
+新台币 9.98865464655
+临证指南 13.900677652
+马赫迪 10.604840786
+遵照执行 11.5027823792
+警世 10.4349417492
+文二路 12.8020653633
+主婚 11.2616203224
+绝粒 12.2912397395
+血清素 11.8212361103
+退学生 13.2075304714
+第八次 9.7898037878
+如簧之舌 12.8020653633
+兴凯 12.2912397395
+五十七个 13.2075304714
+交通壕 10.642581114
+项目区 12.1089181827
+资金运用 10.2897597393
+草酸盐 12.1089181827
+雁翎队 12.2912397395
+七十二处 13.2075304714
+王之心 12.8020653633
+帝国时代 11.8212361103
+兴农 13.900677652
+千差万错 13.2075304714
+警务区 13.2075304714
+仁勇 12.8020653633
+全能 9.54396882529
+单曲体 12.1089181827
+一百户 11.9547675029
+金属制 11.598092559
+史馆 10.4349417492
+金朝都 12.8020653633
+七五左右 13.900677652
+戈什 10.8096351986
+乡亲们 8.97342396682
+用户数 10.7226238216
+教育部考试中心 13.900677652
+七百万元 13.900677652
+粘质 11.5027823792
+佛头着粪 13.2075304714
+伯吉父 12.2912397395
+写景 9.71102290995
+河床 8.03989142851
+卡沃里 13.900677652
+八九点钟 11.7034530746
+长夜难眠 13.900677652
+陋俗 12.5143832909
+唐始 12.1089181827
+千岩竞秀 12.5143832909
+苍白色 11.7034530746
+美术电影 11.7034530746
+兰州大学 11.598092559
+空落落 9.93038573842
+李孝恭 11.9547675029
+顶回去 11.7034530746
+主导 7.0806612873
+成人式 12.5143832909
+于大海 12.2912397395
+纽约时报 9.87532596124
+杜波依斯 11.4157710022
+征兵制 10.8561552143
+这周 11.0674643079
+贼徒 11.0674643079
+代理服务 12.8020653633
+绝色 10.9049453784
+信教者 11.4157710022
+松科 10.8096351986
+四人帮 9.35738286971
+平平整整 11.0103058941
+绝艺 11.7034530746
+容州 12.1089181827
+粤菜 10.8561552143
+树獭 13.900677652
+全脂 11.9547675029
+无人认领 11.8212361103
+兵圣 12.8020653633
+静压 11.1926274509
+主宰 8.6966709649
+这名 8.70772080109
+主家 9.80633308975
+主宾 11.0103058941
+议会选举 9.6811699468
+主审 10.9049453784
+异闻 12.2912397395
+新平县 13.2075304714
+南漪湖 13.2075304714
+回得 11.1926274509
+任意球 11.0103058941
+产经新闻 11.9547675029
+遵命 9.55687223012
+弹丸之地 10.604840786
+荔枝 8.65365357982
+琉璃灯 11.9547675029
+弗兰特 13.900677652
+阿拉培 13.900677652
+宗政 13.900677652
+送过来 10.0505300503
+主官 11.7034530746
+两百六十余 13.2075304714
+强烈呼吁 11.598092559
+十余载 12.2912397395
+更是如此 9.40086798165
+五千响 12.8020653633
+王之师 10.9562386728
+玉川学 13.900677652
+战时 7.90671622467
+跌多 12.8020653633
+航拍 13.2075304714
+写有 9.59661255877
+逸夫 13.900677652
+潘安 11.598092559
+候潮门 11.0674643079
+绿葱葱 12.8020653633
+孝道 10.1394775363
+卫鼎 12.5143832909
+大辩论 11.5027823792
+充气 9.66657114738
+仁厚 10.7226238216
+述职 10.2117981979
+辛苦费 12.1089181827
+纯酒精 13.900677652
+财商 12.2912397395
+主子 8.14810501315
+写本 9.56994431169
+赚了钱 10.3743171274
+主存 10.8561552143
+驼毛 12.5143832909
+静卧 11.3357282945
+唐境 12.5143832909
+五千名 12.2912397395
+交通委 13.2075304714
+曲形木 13.2075304714
+陈荣 12.2912397395
+虫瘿 10.7226238216
+梅圃溪 13.2075304714
+张德培 13.2075304714
+虎骨 11.7034530746
+性与爱 13.900677652
+刑事犯 13.2075304714
+举国 9.62401153296
+杰塞普 13.900677652
+聊表寸心 12.1089181827
+仁友 12.5143832909
+公判大会 13.900677652
+等等 5.84140142867
+强派 13.900677652
+兑换 8.25170341381
+东捻军 13.2075304714
+陈茂 12.5143832909
+陈范 13.900677652
+联络点 10.9562386728
+普通发票 11.8212361103
+磁共振 10.2117981979
+合规 8.74738605748
+胡得福 11.4157710022
+官本位 11.8212361103
+首都国际机场 11.8212361103
+布尔乔亚 12.2912397395
+病因学 12.1089181827
+鲜儿 13.900677652
+写来 10.4666904475
+运输系统 11.1926274509
+仁可 13.900677652
+侍立门 13.2075304714
+疑问句 12.5143832909
+招聘启事 13.900677652
+姜佐禹 13.2075304714
+杨宇霆 12.8020653633
+班长 8.29120585679
+除旧更新 12.8020653633
+主峰 7.66430806177
+几维 11.4157710022
+赤木 11.8212361103
+刻下来 13.2075304714
+深思熟虑 9.74179456862
+遵化 10.1164880181
+逸度 12.2912397395
+王之女 12.8020653633
+练军 11.8212361103
+诺尔曼 11.9547675029
+唐张 11.4157710022
+布列亚 12.2912397395
+松江区 11.9547675029
+蔡茂德 11.2616203224
+仁君 11.8212361103
+伊达戈 13.2075304714
+三岔河 10.642581114
+南京农业大学 13.2075304714
+建交国 13.2075304714
+跌幅 6.21727397092
+妙高台 12.1089181827
+消防员 11.1926274509
+王婆卖瓜 13.900677652
+松绑 9.61021821083
+匪盗 12.5143832909
+刷下来 13.2075304714
+尚之信 11.7034530746
+冒名顶替 11.1926274509
+拉喜特 12.8020653633
+请谒 13.2075304714
+磷化镓 11.9547675029
+闻文 13.900677652
+递解 12.1089181827
+夹衣 11.8212361103
+多样化 8.07173203437
+勿需 12.8020653633
+仅为 6.99292237299
+陈蒙 12.8020653633
+财务 7.11058041646
+赤杨 9.29550746599
+唐杜氏 12.8020653633
+弄坏了 10.8096351986
+鉴赏家 12.1089181827
+卫风 11.5027823792
+脑卒中 12.1089181827
+赤松 10.4349417492
+失球 13.2075304714
+仰靠着 13.2075304714
+翠叶 12.1089181827
+舞弄着 13.2075304714
+割碎 12.5143832909
+财势 11.5027823792
+爽利 9.98865464655
+帝慰 13.2075304714
+黏黏 12.8020653633
+硝碱 12.2912397395
+六千万元 12.1089181827
+玫瑰油 11.9547675029
+理论化 11.1280889297
+疟原虫 11.1280889297
+遥测技术 12.2912397395
+这匹 9.4233408375
+练出 10.604840786
+所花 11.1280889297
+赵向北 12.8020653633
+赵的郡 13.2075304714
+财办 13.2075304714
+古巴共产党 11.9547675029
+直管 11.1926274509
+史陈九 12.8020653633
+这双 9.85762638414
+贪污腐败 11.1280889297
+实发 13.900677652
+陈绍 13.2075304714
+晋城市 11.7034530746
+仁和 10.4349417492
+宁缬正 12.8020653633
+兴城 10.1871055853
+松江县 11.2616203224
+莹白 12.2912397395
+张骞复 12.8020653633
+月桂树 12.2912397395
+弄熄 13.2075304714
+后缀名 13.2075304714
+这叫 8.73589167805
+好日子 8.81927328699
+这可 11.7034530746
+吱吱作响 12.8020653633
+合理 5.94035402283
+这口 8.86372504956
+很早以前 9.77354326693
+这句 6.91874297482
+脸红耳热 13.2075304714
+合身 10.4994802703
+孰若 13.900677652
+惨痛教训 11.9547675029
+诸泉多 13.2075304714
+任思强 13.2075304714
+这号 9.89334446674
+鸡肋 9.94943393339
+举出 9.36807815882
+怀化市 11.9547675029
+源目录 13.2075304714
+直笔 13.2075304714
+豆天蛾 13.2075304714
+万千伏 13.2075304714
+伏惟照 13.2075304714
+振东 11.598092559
+举凡 10.4349417492
+横面 13.900677652
+南面 8.1608847398
+割破 10.765183436
+总理大臣 10.4994802703
+三五米 12.8020653633
+主客场制 13.900677652
+拉尿 11.9547675029
+这厮 8.94485059437
+潜科学 12.5143832909
+供水系统 12.2912397395
+翠华 11.8212361103
+背得起 13.900677652
+主将 8.62767809341
+金长城 11.9547675029
+傲睨得志 13.900677652
+潘峰 12.5143832909
+缝儿 10.0720362555
+练兵 8.44535653662
+举债 9.82314020807
+高梁米 12.2912397395
+绵亘 9.96885201925
+直竖 10.765183436
+倍觉 12.8020653633
+城市形态 12.8020653633
+化物所 13.2075304714
+球赛 10.9562386728
+请贴 13.2075304714
+陈维 11.9547675029
+不拿薪水 13.2075304714
+齐之以 12.8020653633
+莹石 13.900677652
+胡思 12.2912397395
+一百日 11.9547675029
+装疯卖傻 11.598092559
+良好印象 12.5143832909
+砍削 13.2075304714
+脉泽 13.900677652
+举借 10.4349417492
+大成者 13.900677652
+大同小异 9.28555713513
+聋哑学校 11.8212361103
+害起 12.8020653633
+唐帜 13.2075304714
+唐帝 12.5143832909
+庆熙大学 13.900677652
+罗经 11.1280889297
+二手轿车 12.2912397395
+齐之仇 12.8020653633
+磁偶极矩 13.2075304714
+驿馆 10.9562386728
+秋熟 12.8020653633
+费解 9.6811699468
+唐平 11.9547675029
+崆峒 11.4157710022
+液膜电极 13.900677652
+秋燥 11.1926274509
+飞箭 11.1926274509
+制空权 9.85762638414
+显位 12.8020653633
+请起 10.3743171274
+康叔封 12.8020653633
+徒骇河 11.7034530746
+兴嘉 13.2075304714
+矿车 12.5143832909
+谷芽 13.2075304714
+痴痴 10.765183436
+花鸟画 10.2630914922
+陈薇 11.0674643079
+保证期 11.4157710022
+定风波 13.2075304714
+毛骨惊 11.9547675029
+全景网络 12.8020653633
+两万余里 13.2075304714
+尹来风 13.900677652
+兵兵 11.9547675029
+城隍庙 9.96885201925
+实利 11.0103058941
+全蝎 11.598092559
+铆接 11.0674643079
+曲线美 12.8020653633
+现钟不打 13.900677652
+第二十五次 13.900677652
+睛天 13.900677652
+居利希 13.2075304714
+一百文 11.9547675029
+哈密地区 11.598092559
+打短儿 13.2075304714
+合辙 12.5143832909
+仁善 12.5143832909
+写意 9.63799777493
+大角山 12.5143832909
+晕头 13.900677652
+批评者 11.8212361103
+裹紧 11.1280889297
+廪膳 11.4157710022
+毁损率 13.900677652
+猎到 11.8212361103
+振作 9.94943393339
+性别角色 12.5143832909
+爽口 10.4349417492
+陈蕃 11.0103058941
+世事多变 13.2075304714
+霍林郭勒 12.2912397395
+兴国 8.9102450652
+球路 12.2912397395
+扫雷艇 10.4041700905
+镇赉县 13.2075304714
+于科洛 13.2075304714
+台驾 12.5143832909
+蹒跚 9.75754292558
+王城 9.5062284973
+守护者 11.8212361103
+爬行纲 11.1280889297
+烹茶 10.4349417492
+虎鲨 11.1926274509
+线宽 11.9547675029
+实力 6.45877092392
+唐廷 10.5684731418
+唐建 10.0294766411
+妥为 12.1089181827
+盘庚遂 13.2075304714
+绝缘 9.04086524761
+宋金元 11.9547675029
+扫雷舰 10.4666904475
+域名 9.80633308975
+过水 10.765183436
+阿拉克 12.2912397395
+一百支 13.900677652
+中国西藏自治区 10.1871055853
+五重奏 11.3357282945
+路易斯酸 11.7034530746
+割礼 10.4041700905
+松缓 13.900677652
+职数 13.900677652
+跌得 9.89334446674
+毕波罗 13.2075304714
+隋初 10.2630914922
+开基立业 13.900677652
+实务 10.4994802703
+陈蔡 12.5143832909
+寝不安席 13.2075304714
+虫灾 11.8212361103
+厨房门 12.5143832909
+耐油性 13.2075304714
+伸上来 12.8020653633
+陷没 12.1089181827
+一九四二年 10.8561552143
+再贴现 11.2616203224
+浮动价格 13.900677652
+慕容宝 11.5027823792
+接管 8.30225569298
+合谋 9.5062284973
+海王星 10.0720362555
+鲜品 11.7034530746
+杨侯 13.900677652
+快多 12.8020653633
+兵分 10.2897597393
+猜起 13.2075304714
+兵刃 10.5684731418
+潘帕 12.2912397395
+交通局 10.4349417492
+静园 13.900677652
+冥王 12.2912397395
+旧家具 12.8020653633
+对日抗战 13.2075304714
+实兵 11.9547675029
+军鸽 13.900677652
+乞讨 9.94943393339
+一无所得 11.8212361103
+天才儿童 12.1089181827
+路富德 13.2075304714
+鲁儿虎 11.598092559
+默默无声 11.7034530746
+汉诺坝 12.2912397395
+环境监测 10.2117981979
+所能 7.54630761118
+蜡像馆 12.5143832909
+镜筒 11.7034530746
+翠凤 13.2075304714
+熔化为 13.2075304714
+巧设 13.900677652
+开发周期 10.8096351986
+司法权 10.2897597393
+且末 10.1394775363
+阿斯特拉公司 13.900677652
+怨声载道 10.4349417492
+外用药 11.1926274509
+巧计 11.598092559
+国仇 13.900677652
+浦肯野 12.8020653633
+手电 9.46986085313
+张德刚 13.2075304714
+考察队 10.1164880181
+和秀兰 13.2075304714
+陆口之 13.2075304714
+架桥铺路 13.900677652
+劝善 10.6818018271
+周韶宁 12.8020653633
+北大西洋公约组织 9.96885201925
+哈里发 8.96620371885
+开会地点 13.2075304714
+于茜草 13.2075304714
+仙人球 13.2075304714
+魏碑 11.5027823792
+这儿 6.12666257473
+崭露 12.8020653633
+一卡通 11.5027823792
+邀请赛 10.765183436
+吸收性 11.9547675029
+举升 12.8020653633
+折衷方案 11.7034530746
+主干 9.20019728618
+松类 13.900677652
+松籽 12.1089181827
+兵力 6.90216800973
+蒙古文 10.533381822
+年龄段 9.93038573842
+潘庆 13.2075304714
+人来疯 11.598092559
+草台班子 12.8020653633
+张德勒 11.9547675029
+胃肠功能 11.1280889297
+中新社 9.20019728618
+写成 7.60356833204
+逆上 13.2075304714
+某一方面 10.4666904475
+孤高自许 13.900677652
+伊斯兰 8.19689517732
+田田 13.900677652
+艰深 11.2616203224
+鲜味 10.9049453784
+使用性能 10.8561552143
+威尔森 13.900677652
+这几 11.8212361103
+等离子体 8.85082164473
+欺男霸女 13.900677652
+十年九旱 12.5143832909
+过江 9.41204128224
+糟老头子 11.1926274509
+收益税 13.900677652
+荷尔蒙 10.4349417492
+运输船 10.2897597393
+喻恩泰 12.8020653633
+帕塔亚 12.2912397395
+蒙古族 8.25170341381
+写手 11.7034530746
+历史剧 9.44633035572
+三十六只 13.900677652
+细则 7.25428713713
+赤日 11.5027823792
+钙钛矿 12.2912397395
+压锭 13.900677652
+翠兰 11.5027823792
+驿马 10.5684731418
+工程系 10.6818018271
+所耗 12.2912397395
+细分 7.96050639926
+高见远识 13.900677652
+势不可挡 10.4994802703
+兵勇 10.1394775363
+道道儿 12.5143832909
+霍珀 12.2912397395
+巴赫切 12.1089181827
+苏台德 10.4994802703
+田畴 10.642581114
+应聘 9.21854642485
+团风 12.8020653633
+唐州 11.9547675029
+实况 10.4041700905
+亿载 13.900677652
+割稻 12.8020653633
+左下角 12.1089181827
+主币 12.5143832909
+按钮式 13.2075304714
+主帆 13.900677652
+主帅 8.65365357982
+国际形象 11.2616203224
+交通岛 13.900677652
+艰涩 10.642581114
+贲门 11.1926274509
+未被发现 12.1089181827
+西军监 13.2075304714
+军鼓 12.2912397395
+中型车 11.1926274509
+耶稣 9.05649056552
+形式语言 11.1280889297
+琉璃球 13.2075304714
+磁电机 12.8020653633
+优良性 13.2075304714
+吁求 13.2075304714
+练功 10.1394775363
+才华横溢 10.9562386728
+矿质 10.0940151622
+渗出性 11.1280889297
+台风 8.30596627237
+郭江 13.900677652
+图尔盖 13.900677652
+唐王驾 12.1089181827
+一百六十万四千二百多镑 13.2075304714
+花荣抢 13.2075304714
+这三条 10.765183436
+呜呼哀哉 11.4157710022
+细叶 11.3357282945
+文旦 12.8020653633
+不能平静 10.8561552143
+兴味 10.765183436
+四马攒蹄 11.9547675029
+反恐怖 10.765183436
+所至 10.2117981979
+唐封 10.642581114
+所致 7.16015829237
+七十二岁 13.2075304714
+奥尔布赖特 13.2075304714
+烟幕 10.0088573539
+经过训练 10.9562386728
+跳帮 13.900677652
+熄风 10.604840786
+萝卜青菜 13.2075304714
+唐山 9.04864738806
+理论值 11.2616203224
+七十二峰 11.7034530746
+班里 9.5186510173
+线头 10.9562386728
+练勇 10.533381822
+谷肩 13.2075304714
+轴承座 13.900677652
+脚凳 12.8020653633
+总方针 10.4994802703
+田儋 12.5143832909
+一差二误 12.8020653633
+培养目标 11.3357282945
+战斗 6.18912867235
+这倒 8.06586691491
+饲养业 9.98865464655
+林果业 10.9562386728
+一百枚 13.2075304714
+望果节 12.8020653633
+学有专长 12.2912397395
+高积云 11.9547675029
+占全河 12.5143832909
+线外 11.8212361103
+二十二尊 13.900677652
+合起 11.1926274509
+伤病者 12.8020653633
+凡民 11.9547675029
+失眠 8.30596627237
+吉水县 13.900677652
+本阵 10.1871055853
+磷化氢 11.7034530746
+瞭望哨 13.900677652
+停火线 12.5143832909
+和蔼可亲 10.7226238216
+那老君 12.5143832909
+姜先生 11.8212361103
+数千顷 12.2912397395
+举动 7.35532799164
+土地改良 12.2912397395
+维尔哈伦 12.2912397395
+四百一十名 13.2075304714
+迪西莫 13.2075304714
+长命富贵 13.2075304714
+九重葛 13.900677652
+军龄 12.8020653633
+一百条 12.1089181827
+衡水市 11.9547675029
+耽误 7.84155445639
+唐岩 13.2075304714
+害过 12.2912397395
+宋慧乔 12.1089181827
+銮铃 11.598092559
+薛仁贵 11.2616203224
+举办 6.9003431917
+数一点五四倍 13.2075304714
+汉朝人 12.2912397395
+瑞气 10.2897597393
+批处理 11.8212361103
+儿歌 10.3171587135
+坼裂 12.8020653633
+逆伦 12.8020653633
+请辞 11.1280889297
+练到 11.7034530746
+列国志 11.8212361103
+潘德 12.5143832909
+沈营 11.598092559
+兵变 9.11318590919
+一两百年 11.9547675029
+全局性 9.7898037878
+手慌脚忙 13.2075304714
+嗅出 10.2897597393
+跟踪器 11.9547675029
+上中下 10.6818018271
+打破砂锅问到底 13.900677652
+主张 5.78306690551
+流年不利 11.9547675029
+耐药性 10.4666904475
+金属型铸 13.900677652
+那雪亮 13.2075304714
+虫牙 13.900677652
+张德厚 13.2075304714
+松紧 10.2117981979
+请过 11.2616203224
+散货船 10.2371160058
+掳掠 9.31571017331
+招仙图 12.8020653633
+贼子 11.9547675029
+孙云鹤 12.2912397395
+飞机骨架 13.900677652
+琉璃瓦 9.48183704418
+三十几米 13.2075304714
+坂田荣男 12.8020653633
+塔斯之 12.8020653633
+静场 11.9547675029
+卫理公会 11.598092559
+布吕歇尔 11.8212361103
+绉纱 12.5143832909
+有来无回 11.7034530746
+由此观之 12.8020653633
+请进 9.98865464655
+邪神 10.0720362555
+阳性率 10.8096351986
+平安无事 9.30555780184
+传经送宝 13.2075304714
+闪击战 11.5027823792
+土槿皮 12.2912397395
+翠微 10.9049453784
+实录 8.59240995457
+免费参观 12.2912397395
+蝮蛇 10.4041700905
+和田福堂 11.4157710022
+述评 11.3357282945
+感光器 13.900677652
+荔波 11.3357282945
+抗癌剂 13.900677652
+广播体操 11.598092559
+一九七二年 12.2912397395
+构造阶地 13.900677652
+封太保 13.2075304714
+述说 9.56994431169
+韦拉克鲁斯 11.4157710022
+烟视媚行 13.900677652
+两重性 11.0674643079
+怕痒 13.900677652
+探马 9.4233408375
+快地 10.765183436
+桓温灭 12.5143832909
+相德 13.2075304714
+南二环 13.2075304714
+兴学 11.1280889297
+团队 7.06656891316
+慕德 12.8020653633
+鲜嫩 9.75754292558
+乾涸 13.900677652
+怕疼 12.8020653633
+黄巢入 12.8020653633
+冯雪峰 11.598092559
+险隘 11.7034530746
+扑击 11.4157710022
+扑出 11.7034530746
+宴乐 10.533381822
+陈福林 13.2075304714
+持斋把素 12.2912397395
+一切都在 9.56994431169
+跌到 9.37888907493
+蝎子草 13.2075304714
+写法 9.54396882529
+西门庆 9.43476953332
+郝昭守 12.8020653633
+七十二变 11.8212361103
+实弹 11.0103058941
+述记 12.5143832909
+二乙烯苯 13.2075304714
+康公弼 12.5143832909
+法定代理 10.642581114
+小白兔 11.0103058941
+这张 8.1641053545
+西约克郡 12.8020653633
+华亭鹤 13.2075304714
+几何变换 12.8020653633
+向隅 13.900677652
+哈马迪 13.900677652
+打冲锋 12.8020653633
+唐华 12.1089181827
+阿礼国 12.8020653633
+永济县 11.9547675029
+线图 9.15574552361
+幂函数 12.5143832909
+革命 5.5350052682
+黄埔海关 13.900677652
+阿拉尔 11.2616203224
+完全彻底 12.5143832909
+唐县 10.8561552143
+文汇报 9.61021821083
+运行机制 9.75754292558
+百分之三四十 13.2075304714
+壮起来 12.5143832909
+摆尾 11.3357282945
+陈行 13.2075304714
+陈衍 11.598092559
+富丽堂皇 9.80633308975
+档案夹 13.900677652
+狠砸 12.8020653633
+实心 9.61021821083
+线团 11.8212361103
+直着 10.3743171274
+揿住 13.900677652
+隐含地 13.900677652
+目的港 11.9547675029
+红封子 13.2075304714
+狗拉雪橇 12.2912397395
+北迎明 13.2075304714
+台面 9.91169360541
+王进喜 12.1089181827
+和讯网 8.49350588052
+司法机关 8.99540287354
+遵循 7.41299363349
+咳嗽声 10.3743171274
+好上加好 12.1089181827
+滋味儿 10.5684731418
+象牙之塔 12.8020653633
+读音 9.89334446674
+向阳 9.25628675283
+椅上 9.71102290995
+由利津 12.5143832909
+王星记 13.2075304714
+相当程度 9.96885201925
+弗兰科 12.1089181827
+争斗 8.71329184614
+西洋文学 12.5143832909
+国际羽联 13.900677652
+翠影 11.8212361103
+扑入 11.1926274509
+人机对话 11.9547675029
+兴安 9.30555780184
+隆子县 13.900677652
+跌势 8.57280148319
+生子钱 13.900677652
+这得 9.94943393339
+兴宁 10.6818018271
+配套工程 10.2371160058
+怕生 11.9547675029
+特化成 11.4157710022
+矿苗 12.5143832909
+中国通史 9.80633308975
+破击战 12.1089181827
+实德 13.2075304714
+革吉 12.5143832909
+一两百元 13.900677652
+礼轻情意 13.2075304714
+新圩 12.8020653633
+斟茶 11.8212361103
+江和义 12.8020653633
+扑克 11.0674643079
+军部 9.01787572939
+作鬼 11.8212361103
+领事裁判 13.900677652
+财帛 10.1630080337
+交通卡 13.2075304714
+新兵训练 12.2912397395
+孔雀河 10.1630080337
+向性 11.0674643079
+海口机场 11.9547675029
+炸油条 12.5143832909
+儿时 10.2897597393
+高耸入云 11.0103058941
+这幅 8.9102450652
+细川 12.5143832909
+失神 9.96885201925
+所运 11.5027823792
+三十余载 13.900677652
+田赋 9.22784881751
+陈观 11.9547675029
+单亲家庭 11.7034530746
+小三阳 11.7034530746
+倾巢 11.7034530746
+通大秦 12.8020653633
+现代感 11.9547675029
+史鉴 11.7034530746
+枉死 11.4157710022
+准绳 10.9049453784
+类固醇 9.80633308975
+爱上你 11.3357282945
+所迫 9.91169360541
+实干 11.4157710022
+这幢 9.94943393339
+平顶木 12.5143832909
+乡公所 12.5143832909
+唐初 8.66423568915
+直盯 10.8096351986
+所述 8.88339781516
+水上居民 13.2075304714
+叱咤 10.7226238216
+细巧 11.5027823792
+第二十五条 13.2075304714
+自毁前程 13.2075304714
+枉此 13.2075304714
+瓦雷里 12.8020653633
+血光 11.0674643079
+沙锅浅儿 13.900677652
+矿物油 11.9547675029
+贸易总额 9.63799777493
+省籍 12.5143832909
+林金水 13.2075304714
+种田人家 13.900677652
+沙夫纳 13.900677652
+麻大年 12.1089181827
+所辖 9.14708746087
+保健所 12.5143832909
+原封未动 11.9547675029
+逸史 11.8212361103
+赈款 13.2075304714
+前后矛盾 11.0674643079
+陶张辛 13.2075304714
+兴威 13.900677652
+富马酸 12.5143832909
+潘公 10.1871055853
+这帮 9.00283785202
+春夏秋冬 10.5684731418
+失礼 10.2630914922
+这帧 13.900677652
+准线 12.2912397395
+联名卡 12.8020653633
+线圈 9.4233408375
+以色列国 10.8096351986
+潘兴 11.2616203224
+正确路线 11.2616203224
+乌龙茶 9.98865464655
+上灵霄 11.5027823792
+祝建华 12.2912397395
+花朝月夕 13.2075304714
+史方 11.0103058941
+粤西 10.0088573539
+交通史 10.3171587135
+萨满 8.9308643524
+荔浦 12.8020653633
+司务厅 12.1089181827
+爽快 8.83808261895
+主公 8.46259834305
+白口 12.2912397395
+粘虫 11.3357282945
+奥陶 12.5143832909
+莳萝 13.2075304714
+融雪剂 11.0103058941
+匪谍 13.900677652
+泰和县 13.900677652
+三十六岁 11.7034530746
+阿治曼 13.900677652
+张小文 12.1089181827
+左心室 11.0103058941
+脉息 11.1280889297
+联络站 11.3357282945
+所载 8.65365357982
+帕恰斯 11.9547675029
+克特拉 11.9547675029
+宝莲灯 11.1926274509
+朱成虎 13.900677652
+伊斯帕 13.2075304714
+憋足劲 12.5143832909
+师全军 12.8020653633
+五千年 9.93038573842
+主儿 9.18217878068
+黄宗仰 13.2075304714
+风姿绰约 11.0674643079
+失禁 10.3453295905
+台阁 10.8096351986
+日理万机 10.8096351986
+平顺县 12.8020653633
+解放军总参谋部 13.2075304714
+失身 11.2616203224
+权益法 12.2912397395
+唐勒 13.2075304714
+竞争力 6.82995354472
+交通厅 11.5027823792
+共点力 13.900677652
+订制 10.604840786
+这座 6.93559730637
+神军列 13.900677652
+兵差 13.2075304714
+线型 10.2371160058
+森格尔 12.5143832909
+虫类 10.604840786
+订到 11.8212361103
+反驳者 13.2075304714
+虎林 11.2616203224
+坩锅 13.900677652
+小驹儿 11.598092559
+徐以显 8.61241062128
+档案室 11.8212361103
+呼起 13.900677652
+扑去 13.900677652
+小格格 10.9562386728
+潘刚 12.1089181827
+磁场强度 9.94943393339
+慕容垂 10.1630080337
+钭郑 13.2075304714
+兴奋 6.59213485444
+白馒头 12.1089181827
+争权 10.0088573539
+国有土地 9.69598503258
+练得 11.3357282945
+线呢 12.5143832909
+奥尔德 11.4157710022
+南明鲁 12.1089181827
+整束 11.3357282945
+白血球 11.3357282945
+分裂法 12.2912397395
+群星璀璨 13.2075304714
+充斥 8.87023973058
+植入术 12.8020653633
+蛇麻 13.900677652
+球艺 13.900677652
+革囊 13.2075304714
+顾前不顾后 12.5143832909
+各线路 13.2075304714
+捧住 10.8561552143
+张德广 13.2075304714
+玫琳凯 11.3357282945
+基佐 10.7226238216
+基体 9.96885201925
+孰谓 13.900677652
+唐兰 12.5143832909
+基伯 12.2912397395
+小黑山 12.1089181827
+价值量 8.62256299275
+里科尔 13.2075304714
+泪珠子 10.8096351986
+免修 13.900677652
+田租 10.0088573539
+灌注桩 12.8020653633
+活灵活现 10.6818018271
+马科斯 11.4157710022
+贫家女 13.2075304714
+仙台 11.5027823792
+臼炮 12.5143832909
+不可一世 9.5062284973
+主动 6.33643917681
+基伍 13.900677652
+失稳 11.1926274509
+急流勇退 11.598092559
+田之水 13.2075304714
+主力 5.73077500462
+兴头 9.71102290995
+达瓦兰 13.900677652
+主办 7.86759143018
+林藕初 8.52078029844
+褊狭 11.4157710022
+免俗 11.9547675029
+跌倒 8.75901409547
+邀请 7.13448593732
+细度 12.1089181827
+兴大 11.0103058941
+同等对待 12.8020653633
+迎头痛击 10.8096351986
+庆源 11.7034530746
+判明是非 13.900677652
+无穷无尽 9.5186510173
+雅士利 12.5143832909
+大了些 11.5027823792
+矿用 10.4041700905
+写清 13.900677652
+黄权督 13.2075304714
+兵库 12.1089181827
+唐冠 13.2075304714
+十八摸 13.900677652
+进口产品 9.87532596124
+金碧辉煌 9.59661255877
+史量 12.2912397395
+阿拉布 10.7226238216
+系综理论 12.5143832909
+下甲板 13.900677652
+未央 11.1280889297
+宰牛刀 13.2075304714
+害着 12.5143832909
+杭廷登 12.8020653633
+阿佩尔 13.2075304714
+台长 10.0720362555
+宁缺勿滥 13.900677652
+卫阳 13.2075304714
+几科 13.900677652
+精制品 12.8020653633
+合股 10.2897597393
+萝北县 12.8020653633
+害苦 11.5027823792
+合肥 8.22392384971
+张德庆 13.2075304714
+二十七章 12.5143832909
+全裸 11.9547675029
+重晶石 9.0884932966
+合胞 11.1926274509
+胞饮 13.900677652
+档案学 10.642581114
+四代同堂 13.2075304714
+节烈 11.598092559
+丹霞 10.9049453784
+唐复改 13.2075304714
+辱门败户 13.900677652
+所谓 5.791753496
+失窃 11.0103058941
+谷贱 12.5143832909
+一个五十左右 13.900677652
+陈言 11.3357282945
+阿的平 13.900677652
+吐苦水 12.2912397395
+团省委 11.4157710022
+王进城 13.2075304714
+煽惑 9.87532596124
+癃闭 11.598092559
+狠下心来 12.1089181827
+主创 10.9562386728
+检举 9.38981814546
+赛马会 13.900677652
+宋江军 11.7034530746
+煽情 11.1280889297
+英语学校 13.2075304714
+主刀 10.7226238216
+髑髅 12.8020653633
+平卢镇 13.2075304714
+海瑞之 12.8020653633
+球花 10.765183436
+年富力强 10.9049453784
+充数 11.598092559
+陈诚 10.4666904475
+免交 10.9562386728
+粤语 11.598092559
+金灯 11.4157710022
+遇见 7.81390292506
+实属 9.02548032877
+失策 10.1871055853
+阿帕河 13.900677652
+救醒 11.1280889297
+鲜姜 12.1089181827
+翠岩 12.5143832909
+住宿费 11.2616203224
+陈诗 13.900677652
+快向 12.2912397395
+陈诉 11.7034530746
+王右军 11.4157710022
+主句 13.900677652
+陈词 10.8096351986
+主叫 12.2912397395
+张德彝 13.900677652
+贺若弼 11.9547675029
+来头不小 11.8212361103
+选贤与能 12.8020653633
+牛贺洲 11.4157710022
+邀请者 13.900677652
+鸡子儿 12.8020653633
+硝石 10.3743171274
+周仆笑 10.1164880181
+胡适之 12.5143832909
+陈说 10.2897597393
+临海市 11.8212361103
+动脉瘤 10.604840786
+半节 12.5143832909
+矿脉 10.0088573539
+假钞 11.4157710022
+特定物 12.5143832909
+乡村音乐 11.9547675029
+静安 11.2616203224
+通电 8.62767809341
+红领章 12.8020653633
+球茎 10.4994802703
+无言以答 12.5143832909
+这封 9.30555780184
+沽源县 13.2075304714
+啃着 10.3171587135
+软硬不吃 11.9547675029
+史通 10.9049453784
+人次 9.33632946051
+翠峰 12.2912397395
+静定 11.1926274509
+窖洞 12.5143832909
+静宜 11.2616203224
+护城河 9.54396882529
+偷回来 12.1089181827
+稚气未脱 12.2912397395
+谭伟 13.900677652
+主厨 12.5143832909
+仁孝 11.4157710022
+石珊瑚 11.9547675029
+汉诺威 9.89334446674
+泥腿子 11.9547675029
+兵役 9.43476953332
+荧光棒 12.8020653633
+仁学 12.8020653633
+三十六幅 13.2075304714
+苍梧县 12.8020653633
+未老先衰 11.3357282945
+滦河 9.45802639549
+基丁 13.900677652
+澡堂子 11.0674643079
+统一作战 13.2075304714
+本小利微 13.900677652
+连战皆捷 12.1089181827
+夏侯渊引 12.5143832909
+基业 9.25628675283
+朱清时 13.900677652
+吴姐姐 13.2075304714
+平长毛 13.900677652
+细微 9.04864738806
+扑到 9.23723855786
+匪祸 13.900677652
+剑气 12.5143832909
+谷象 13.2075304714
+球菌 10.4349417492
+仁安 13.900677652
+国际合作部 13.2075304714
+中文电脑 13.900677652
+一平方米 11.3357282945
+王朝刚 13.900677652
+表观功率 13.900677652
+接缝处 11.598092559
+别作良图 12.2912397395
+割着 12.2912397395
+黔江县 13.900677652
+一再嘱咐 10.604840786
+麦其官 11.9547675029
+基价 12.8020653633
+仁宝 12.5143832909
+使领馆 11.1926274509
+迪瓦尔 13.900677652
+一个多月 8.10158499752
+投票系统 11.9547675029
+仁宣 12.8020653633
+访贫问苦 12.2912397395
+郭洋 12.1089181827
+毛织物 10.533381822
+民主革命 8.58747167293
+基什 10.8561552143
+椭球面 10.9562386728
+铁卡笋 13.2075304714
+孝顺 9.13850371718
+第八集 13.900677652
+史索班 12.5143832909
+述补 13.2075304714
+麦其家 8.6803218269
+全要 10.9049453784
+史部 11.1926274509
+绝对湿度 12.2912397395
+六百五十米 13.2075304714
+重叠法 13.2075304714
+布隆迪 10.1871055853
+文弱书生 12.8020653633
+失算 11.0674643079
+双掌平 13.900677652
+麦圭尔 12.5143832909
+放心使用 12.1089181827
+卫青 10.0088573539
+翠山 12.8020653633
+唐僧 7.53764954844
+举报中心 10.9049453784
+交会点 10.4349417492
+世界银行 8.51618258919
+细弱 9.69598503258
+基于 6.62689133413
+中国清政府 10.4994802703
+迂执 13.900677652
+鼾声如雷 11.4157710022
+全角 12.8020653633
+雄劲 11.9547675029
+翠屏 11.3357282945
+所购 11.0674643079
+扈三娘 10.1871055853
+基亚 12.2912397395
+所费 10.9562386728
+熊包 11.7034530746
+仁寿 9.80633308975
+实存 11.8212361103
+哈菲兹 11.598092559
+粘菌 11.9547675029
+撬窃 13.900677652
+硝烟 8.79473217808
+斗争大会 11.7034530746
+几万人 10.533381822
+一步之遥 9.77354326693
+俯首听命 11.9547675029
+实字 13.900677652
+庄青翟 12.8020653633
+婚姻家庭 10.604840786
+烛影摇红 13.900677652
+不当不正 13.2075304714
+系带 11.0103058941
+洗心革面 11.7034530746
+精神障碍 10.5684731418
+间谍卫星 13.2075304714
+注射用 12.5143832909
+细声 11.7034530746
+慕容冲 11.9547675029
+虞集 11.0674643079
+桌旁 9.69598503258
+三十六处 13.2075304714
+这季 13.900677652
+学习气氛 13.900677652
+功能主治 12.8020653633
+尚仪局 11.8212361103
+半腔 13.2075304714
+非武装 11.1280889297
+英属维尔京群岛 11.7034530746
+医师资格 12.1089181827
+诨号 11.2616203224
+大惊小怪 8.98069672615
+磁导率 10.2371160058
+北越法 12.8020653633
+消防局 11.9547675029
+实学 10.4349417492
+赤潮 11.1926274509
+麻城县 13.2075304714
+泽望兄 13.2075304714
+爽心悦目 13.900677652
+狂笑声 13.2075304714
+凡未 12.1089181827
+诬良为盗 13.900677652
+水解作用 12.8020653633
+萧寺图 12.8020653633
+配合力 12.5143832909
+松皮 11.7034530746
+俞平伯 11.7034530746
+三魂七魄 12.5143832909
+直率 9.69598503258
+帅小伙 13.900677652
+叶举 12.8020653633
+沈迅 13.2075304714
+希伯来语 10.9562386728
+事实根据 10.9049453784
+线列 13.900677652
+啃来啃去 13.900677652
+哼哼哈哈 11.7034530746
+别老是 11.8212361103
+陈汤方 13.900677652
+鲜度 12.8020653633
+桌斗 13.2075304714
+隔热材料 12.2912397395
+景州苏 13.2075304714
+模版 11.7034530746
+叶丛 11.3357282945
+龙贝格 13.900677652
+锁闭 11.5027823792
+虎门 9.77354326693
+宁夷州 13.2075304714
+闻风逃窜 13.900677652
+不可言传 11.0674643079
+昆士兰州 10.8561552143
+成败得失 11.598092559
+好消息 8.41173992582
+几万两 11.4157710022
+五百二十卷 12.5143832909
+遵守 7.71859274526
+平均寿命 9.94943393339
+吕维祺 9.91169360541
+卫通 12.8020653633
+几万个 12.2912397395
+熔蜡 13.900677652
+海西侯 13.900677652
+钱能训 12.2912397395
+阳溪 11.2616203224
+鲁阳 10.8561552143
+拉赫曼 11.0674643079
+这对 7.13448593732
+斑纹 9.01032852375
+白斑病 13.900677652
+赐官 13.900677652
+奥诺马克 13.900677652
+快去 8.25170341381
+绝路 9.72629038208
+可行方向 13.900677652
+几票 13.900677652
+反腐 9.84023464143
+初级线圈 13.900677652
+所言 7.91422564669
+北仑区 12.2912397395
+实实 10.2630914922
+秦艽汤 13.2075304714
+理论家 8.51618258919
+快反 12.1089181827
+卫道 12.8020653633
+国民报 11.598092559
+陈谏 11.8212361103
+小条 13.2075304714
+卡普阿 13.900677652
+阿七 11.9547675029
+卖报 11.7034530746
+李学仁 13.2075304714
+兴德 12.8020653633
+宋江起义 12.8020653633
+黏附 13.2075304714
+驿道 9.93038573842
+六十九万 13.2075304714
+极右翼 12.2912397395
+腾腾腾 13.2075304714
+叶互 9.62401153296
+拍手称快 10.7226238216
+瑚琏之器 13.900677652
+陈群 11.1926274509
+兵士 8.58255765813
+悼词 10.8096351986
+唐城 11.5027823792
+主名 12.5143832909
+这家 7.25039860339
+旗袍裙 13.900677652
+革出 11.8212361103
+阴魂 10.3171587135
+万善 12.8020653633
+后脑勺 9.84023464143
+常寺卿 11.1280889297
+松石 11.4157710022
+钱实甫 12.5143832909
+怕热 10.7226238216
+平扁亚 12.8020653633
+所译 10.3743171274
+静州 12.2912397395
+由阳爻 12.8020653633
+揭老底 12.2912397395
+江心屿 12.8020653633
+孙承恩 13.2075304714
+血栓性 11.4157710022
+线卡 13.900677652
+估计量 11.598092559
+郑人铸 13.2075304714
+温补治 13.2075304714
+迟效性 13.2075304714
+财富 6.36751884452
+相父 12.1089181827
+平均气温 7.96578345636
+兴平 10.3453295905
+民族之林 11.5027823792
+奋勇当先 12.8020653633
+快到 8.57766767284
+评分表 12.5143832909
+所说 6.65573610564
+田纪 13.900677652
+读者群 12.1089181827
+完璧 13.2075304714
+一千两百 13.900677652
+脚踝部 13.2075304714
+否决权 10.1394775363
+金代初 12.8020653633
+尊敬师长 12.8020653633
+影视明星 10.4994802703
+这娃 11.7034530746
+宁夏自治区 13.2075304714
+凡是 7.07739152962
+贾菲尔 13.900677652
+陈越 13.2075304714
+菏泽 10.0505300503
+向德军 11.7034530746
+兴师 9.84023464143
+阿拉姆 12.5143832909
+郎才女貌 12.1089181827
+全车 10.0940151622
+生物导弹 12.1089181827
+仍须 9.84023464143
+陈超 13.900677652
+布里奇曼 11.8212361103
+鉴赏力 12.2912397395
+低能耗 10.533381822
+军长 8.10461990121
+精华液 13.900677652
+秋种 12.2912397395
+衣夹 13.2075304714
+着迷于 12.5143832909
+宇文护引 13.2075304714
+几百台 12.8020653633
+冠醚 11.8212361103
+财宝 9.63799777493
+所设 9.58318953844
+田续 12.8020653633
+中国物理学会 10.765183436
+墓祭 13.900677652
+防原子 12.2912397395
+陈赓 10.765183436
+斯甲河 13.900677652
+无的放矢 11.9547675029
+还都不 11.9547675029
+梭子 9.84023464143
+新闻业 11.9547675029
+母象 13.900677652
+绝经 10.1630080337
+动脉炎 11.8212361103
+广泛传播 9.41204128224
+巴赫奇 12.2912397395
+搅拌器 12.2912397395
+兴建 7.28998160726
+台鉴 13.2075304714
+联络组 12.8020653633
+全输 12.8020653633
+碱类 12.8020653633
+推本溯源 13.900677652
+千株 12.1089181827
+球藻 11.598092559
+拉西亚 12.8020653633
+唐御妹 13.2075304714
+外汇牌价 12.8020653633
+失迎 10.765183436
+深情厚意 12.2912397395
+人口构成 12.1089181827
+略有结余 13.900677652
+苏天爵 13.2075304714
+兴废 10.4994802703
+主唱 11.1280889297
+非平衡态 10.765183436
+陈贞 13.2075304714
+系念 12.5143832909
+高雄 9.36807815882
+唐国 11.8212361103
+刘表新 13.2075304714
+云儿 11.1926274509
+脉搏 9.15574552361
+兴庆 10.0088573539
+上诉期 13.900677652
+虎钳 11.9547675029
+联络线 10.3171587135
+顾盼生姿 13.2075304714
+唐园 12.8020653633
+档案局 11.9547675029
+盗骗 12.5143832909
+甘河子 12.5143832909
+直爽 10.3171587135
+劳动纪律 12.2912397395
+箩卜 12.8020653633
+露出马脚 10.642581114
+快书 13.2075304714
+罗清启 13.2075304714
+抒情散文 11.9547675029
+常识性 11.598092559
+可湿性 13.900677652
+郭死 12.8020653633
+仁巷 13.2075304714
+详写 13.2075304714
+军门 10.6818018271
+全过 13.2075304714
+洛汀新 13.2075304714
+崇仁县 13.900677652
+仁布 13.2075304714
+卓波罗 12.5143832909
+总成绩 10.4994802703
+土卫六 12.2912397395
+王之印 13.2075304714
+工资待遇 11.3357282945
+吉水府 13.2075304714
+军阀 7.78699547214
+鸡西市 11.598092559
+赶热闹 13.900677652
+不结盟运动 10.3743171274
+电子设计 13.900677652
+这套 8.34384959028
+球虫 11.9547675029
+军阶 11.9547675029
+军阵 10.1394775363
+母豹 12.5143832909
+诸子封 12.5143832909
+王之卓 12.5143832909
+害虫 8.18694484647
+填起来 13.2075304714
+布里奇斯 13.2075304714
+浮一大白 11.8212361103
+数千里 10.2117981979
+细嫩 9.49395840471
+巫卜 11.5027823792
+而会 10.765183436
+奠基仪式 10.7226238216
+桃花潭水 13.900677652
+月亮泡 11.9547675029
+伊柳申 12.2912397395
+马托 12.1089181827
+全豹 13.2075304714
+巧莲 10.0294766411
+开阔眼界 12.5143832909
+苏振华 13.2075304714
+干练地 13.2075304714
+合著 9.03314320152
+扮装 12.8020653633
+桌架 13.900677652
+遵奉 10.533381822
+耐腐蚀 10.0505300503
+粘膜 8.38322475551
+争持 10.533381822
+钭钟 12.2912397395
+实处 10.765183436
+不可偏废 11.4157710022
+这天 7.34816976494
+平天冠 12.1089181827
+夹角 9.32596667347
+索美塞 12.8020653633
+陶瓷业 11.3357282945
+举子 9.01787572939
+逸品 13.900677652
+崔天成 10.765183436
+这大 9.12155415886
+恐龙 9.14708746087
+梅翰林 12.5143832909
+齐纵亲 13.2075304714
+合葬 10.1630080337
+鼓乐喧天 11.7034530746
+恰遇 10.4994802703
+扑地 10.642581114
+假锁 13.900677652
+匪类 12.2912397395
+氟化 10.8561552143
+枉法 11.4157710022
+换向器 11.9547675029
+第八期 11.598092559
+梅内斯 12.8020653633
+西舒玛 12.5143832909
+左司郎中 13.900677652
+快写 12.2912397395
+三十六家 13.2075304714
+小媳妇 10.0294766411
+单核细胞 10.4994802703
+氏族公社 10.0505300503
+小字辈 12.2912397395
+蒋明谦 13.2075304714
+绝迹 8.86372504956
+技术创新 8.71889410168
+魏太武 10.8561552143
+快冲 12.5143832909
+王东升 13.900677652
+全貌 9.75754292558
+于辉州 13.2075304714
+大南沟 13.2075304714
+兴工 11.9547675029
+结构设计 10.3743171274
+度蜜月 12.8020653633
+混进去 12.2912397395
+单倍体 10.5684731418
+鲜少 13.900677652
+地委书记 9.26594866375
+慕容博 13.900677652
+团部 9.93038573842
+族长 9.33632946051
+静帝 12.5143832909
+龙峰 13.900677652
+长蛇阵 11.4157710022
+标题 7.53592689512
+练字 10.6818018271
+怀圣寺 12.1089181827
+争论者 13.900677652
+今华 13.2075304714
+同生作用 13.900677652
+偏大 9.61021821083
+第八条 10.9049453784
+儿戏 9.58318953844
+柱面 10.5684731418
+世代相传 10.1630080337
+失约 10.8561552143
+快出 9.82314020807
+布里奇敦 11.9547675029
+松球 12.2912397395
+陈进 11.1926274509
+所见 8.31718134319
+陈远 13.900677652
+吸进去 11.5027823792
+静心 10.3743171274
+游龙飞 12.8020653633
+细察 11.2616203224
+杜伏威 11.3357282945
+五彩池 13.2075304714
+基督山 13.2075304714
+细密 8.98069672615
+晕厥 10.3453295905
+全责 10.5684731418
+依靠职工 13.900677652
+香巢 13.900677652
+而为 10.765183436
+仁弟 13.2075304714
+陈迹 11.0674643079
+入会费 13.2075304714
+订单 7.27661242418
+静忠 13.900677652
+陈述 8.29120585679
+等温退火 13.900677652
+塑料模具 12.8020653633
+兴山 10.3171587135
+财委 11.7034530746
+受赏 11.5027823792
+档案库 11.7034530746
+四人制 13.900677652
+私语 10.7226238216
+孔加键 13.900677652
+收益率 6.25623689042
+主城 10.9049453784
+向量 9.25628675283
+几碗 10.4666904475
+雷山县 13.900677652
+汇聚一堂 12.5143832909
+所要 8.6966709649
+平潭岛 11.7034530746
+曼斯菲尔德 11.9547675029
+没完没了 9.01787572939
+北京密云水库 13.2075304714
+酌议 13.2075304714
+撑肠拄腹 13.900677652
+王之制 13.2075304714
+入学年龄 10.4666904475
+这堆 11.4157710022
+镜片 9.72629038208
+黑溜溜 12.2912397395
+陈辉 13.2075304714
+董亚巍 13.2075304714
+曼德勒 10.8561552143
+宝钗因 11.0674643079
+东周时期 10.7226238216
+铁纹石 13.2075304714
+睾丸素 12.8020653633
+荧光法 13.900677652
+工程界 12.2912397395
+陈达 9.66657114738
+子刘曜 13.2075304714
+环烷烃 12.1089181827
+杨利伟 13.2075304714
+命题作文 12.5143832909
+细审 13.2075304714
+储济仓 10.1630080337
+价值链 10.1394775363
+里科夫 13.900677652
+人寿年丰 13.900677652
+宝莲盖 12.5143832909
+兵学 11.9547675029
+全资 8.0746775446
+现代戏 10.7226238216
+向德华 13.900677652
+细孔 11.4157710022
+逞英雄 11.5027823792
+细字 13.900677652
+木梆声 12.5143832909
+良莠不齐 10.2897597393
+十八本 13.2075304714
+花被 9.37888907493
+不言自明 10.3743171274
+军鞋 12.8020653633
+贼匪 13.2075304714
+平方厘米 9.62401153296
+陈轸 12.8020653633
+信佛 10.4994802703
+沽酒 11.5027823792
+而于 10.2117981979
+白铅矿 13.2075304714
+不良少年 13.900677652
+主坝 11.4157710022
+参考值 10.8096351986
+晒过 12.5143832909
+依阿华 12.5143832909
+仁德 9.85762638414
+赤沙 12.5143832909
+日空 13.900677652
+打歼灭战 12.8020653633
+同余式 11.8212361103
+谐美 13.900677652
+准确 6.65502258438
+仁心 11.9547675029
+而以 7.93197009199
+历史学 9.15574552361
+实增 13.900677652
+大个儿 10.533381822
+向紫鹃 12.1089181827
+主场 9.28555713513
+赤泥 12.8020653633
+耶律雄奴 12.8020653633
+支付现金 11.1280889297
+朱元章 13.2075304714
+王之助 13.2075304714
+全路 11.1280889297
+养老院 9.85762638414
+保健操 11.9547675029
+黑热病 11.7034530746
+太禧宗 13.2075304714
+七十二员 12.8020653633
+全距 12.5143832909
+团里 10.1394775363
+矛盾百出 12.5143832909
+堂伯叔 13.2075304714
+通云阳 13.2075304714
+三亚旅游 12.5143832909
+矿藏 7.76727960898
+折冲樽俎 13.2075304714
+失群 12.5143832909
+分一杯羹 10.7226238216
+巴尔的摩 10.5684731418
+争抢 9.4233408375
+夏汛 10.8561552143
+仁怀 11.3357282945
+西湾 13.2075304714
+兰考县 10.4666904475
+造表 13.900677652
+北盘江 10.0940151622
+文制武 12.8020653633
+雾障 12.8020653633
+大喇嘛 12.5143832909
+哈里斯 11.0103058941
+王元年 13.2075304714
+杜暹 13.2075304714
+工艺 6.83934328507
+籍没 10.0505300503
+庆吊 12.5143832909
+实权 8.82550383674
+贸易组织 13.2075304714
+裴秀 11.1926274509
+海客 9.77354326693
+造血 9.40086798165
+这杯 10.8096351986
+叶片 8.03704647638
+这条 6.7152906364
+赤石脂 12.8020653633
+案开审 12.8020653633
+吸收器 11.9547675029
+慕容贵妃 13.2075304714
+买车 9.28555713513
+翠林 13.900677652
+田野工作 13.2075304714
+梭曼 13.2075304714
+精奥 13.2075304714
+雌二醇 11.8212361103
+思想认识 10.7226238216
+尽人皆知 11.0103058941
+直供 10.642581114
+玩花招 12.8020653633
+实有 9.26594866375
+仁恒 11.598092559
+网状结构 10.3453295905
+这期 10.533381822
+具文 11.8212361103
+作战方案 10.5684731418
+牧首制 13.2075304714
+笛音 12.1089181827
+这本 8.34771806705
+杨营 11.9547675029
+邮路 11.5027823792
+比照 9.5062284973
+翠柏 10.9562386728
+平利 11.0674643079
+实木 10.604840786
+主梁 10.9562386728
+罗杰斯 8.75901409547
+不予承认 11.7034530746
+百十亩 13.2075304714
+两面角 13.900677652
+紫岩 13.900677652
+清分 12.1089181827
+视网 13.2075304714
+照说 11.2616203224
+塔斯社 11.4157710022
+江义 13.900677652
+写后 13.2075304714
+买进 8.30225569298
+照读 13.2075304714
+直体 12.2912397395
+相率 10.9049453784
+赤县 13.900677652
+五千本 13.2075304714
+凤麟龙 13.2075304714
+行宪国 12.8020653633
+买过 10.3743171274
+主桥 11.2616203224
+陶瓷烫 13.900677652
+圣艾蒂安 13.2075304714
+蔚蓝色 11.0674643079
+参透机关 13.900677652
+财智 11.2616203224
+白萝卜 10.4666904475
+脏兮兮 11.1926274509
+劝起来 13.2075304714
+静息 10.1630080337
+第八天 11.598092559
+冷子兴 11.8212361103
+违章罚款 13.900677652
+技术谈判 13.900677652
+保健室 13.2075304714
+宦门公子 11.1280889297
+钟公 13.900677652
+依附于 9.26594866375
+垂花 13.900677652
+主桅 11.8212361103
+喉塞音 13.2075304714
+重大事故 10.7226238216
+留情面 13.2075304714
+表演家 13.2075304714
+技术主管 13.900677652
+静态 8.33999602096
+崔胤 13.900677652
+顶点 8.82550383674
+全职太太 13.900677652
+主栽 13.900677652
+主格 11.9547675029
+兵操 13.900677652
+数十丈 11.9547675029
+骨质 9.21854642485
+这枝 11.4157710022
+叶状 10.0720362555
+布景 9.58318953844
+阴凄凄 13.900677652
+算了算 9.94943393339
+王之涣 12.2912397395
+铸钢厂 13.900677652
+徐起祚 12.5143832909
+仁惠 13.900677652
+表白 9.12999302751
+海宁 8.83808261895
+雪道 13.900677652
+儿少 13.900677652
+举旗 11.9547675029
+王德山 13.900677652
+和恒隐 13.2075304714
+实枪 12.5143832909
+一百倍 11.1280889297
+花街 11.8212361103
+兜儿 11.9547675029
+柳嫂子 12.5143832909
+好了吧 11.598092559
+高高兴兴 9.58318953844
+直传 12.8020653633
+蘸湿 13.2075304714
+奸淫 9.0884932966
+深圳指数 11.8212361103
+很僵 13.2075304714
+黄朝猛 11.4157710022
+李章洙 13.900677652
+垂范 11.8212361103
+伍可 10.4349417492
+德涅斯 13.2075304714
+利贝曼 12.8020653633
+主槽 13.2075304714
+丁谓正 13.2075304714
+阿尼玛卿山 10.6818018271
+航天工业部 12.5143832909
+陷害 8.93783302172
+争起 12.5143832909
+张开嘴 10.4666904475
+商业地产 8.78268383956
+影印件 12.5143832909
+跌死 11.7034530746
+遵守规则 12.1089181827
+黄豆芽 11.2616203224
+自立自强 13.900677652
+同窗好友 11.8212361103
+鸟粪层 11.5027823792
+偏头 11.7034530746
+一千多里 11.4157710022
+创新性 9.82314020807
+伊斯曼 12.5143832909
+蔡宝林 12.5143832909
+阿拉斯 12.2912397395
+任京营 12.5143832909
+系指 10.0088573539
+梯云 13.900677652
+实景 10.9049453784
+争强斗狠 13.2075304714
+扑棱 12.2912397395
+干姐姐 12.8020653633
+慕容泓 11.8212361103
+子项 13.2075304714
+加前缀 13.900677652
+练操 13.2075304714
+小黑板 11.3357282945
+仁慈 9.29550746599
+陈留王 11.3357282945
+秦霸西 13.2075304714
+杨廷筠 12.8020653633
+指挥连 12.8020653633
+牧首区 12.8020653633
+计时器 11.2616203224
+乌纳 12.2912397395
+乌纱 10.5684731418
+基琴 13.2075304714
+魏太和 13.900677652
+笑咪咪 13.2075304714
+六七只 13.2075304714
+爽朗 9.29550746599
+绵竹 10.0088573539
+这是 4.29162827639
+甘油酸 13.900677652
+司马昭之 13.2075304714
+兵数 12.8020653633
+蒙汉诸 12.8020653633
+爱达荷 13.2075304714
+实是 8.93783302172
+丹戈 13.900677652
+划成 10.765183436
+直交 11.4157710022
+闲话少说 13.2075304714
+博杜安 12.2912397395
+甘油酯 11.1926274509
+苏安凯 13.900677652
+特殊钢 11.9547675029
+彼得森 11.8212361103
+外贸部 13.900677652
+兑换率 11.4157710022
+甘油醚 12.8020653633
+甘油醛 11.598092559
+兜肚 11.9547675029
+玉帛 10.9562386728
+列队欢迎 12.8020653633
+主楼 10.5684731418
+高玄殿 11.598092559
+一百八 10.8096351986
+江东 8.37921673411
+帕卡德 13.900677652
+燕尾旗 13.900677652
+跑动 10.3171587135
+权强莫 13.2075304714
+井有顺 13.900677652
+泵送 12.2912397395
+慕容氏 11.0674643079
+明诗别 12.8020653633
+一荤一素 13.900677652
+连枝 12.5143832909
+捋起 11.598092559
+财权 11.1280889297
+弄醒 11.2616203224
+介休县 11.9547675029
+雄姿英发 12.5143832909
+客货运输 10.4666904475
+很贵 10.533381822
+中新世 9.40086798165
+从容自如 12.8020653633
+直书 11.5027823792
+一百元 9.93038573842
+明成化 10.5684731418
+知名品牌 9.35738286971
+众街坊 13.2075304714
+顺反异构 12.1089181827
+但明叔 11.8212361103
+新闻片 12.1089181827
+江龙 11.1926274509
+多万镑 13.2075304714
+偎红倚翠 13.900677652
+专制 7.91422564669
+北仑港 11.7034530746
+龙山 8.63798746307
+直上 10.5684731418
+标点符号 10.6818018271
+西沙尔麻 13.2075304714
+快滚 11.7034530746
+乱腾腾 13.900677652
+擦黑 10.9562386728
+琴艺 11.5027823792
+低迷不振 12.8020653633
+魏相楚 13.2075304714
+平壤城 13.2075304714
+黄先生 9.19114745066
+创作奖 11.9547675029
+直中 11.8212361103
+没权没势 12.8020653633
+不良贷款 8.82550383674
+域性 11.8212361103
+惴惴的 12.5143832909
+濮阳市 10.3171587135
+历之初 13.2075304714
+持证 10.4041700905
+啃上 12.2912397395
+吴山圆 10.2117981979
+垂老 11.8212361103
+争当 10.9562386728
+基督 9.00283785202
+实效 9.66657114738
+第二十五届 10.4994802703
+瑞典政府 11.598092559
+而出名 11.1280889297
+圆周运动 11.0103058941
+耶稣教 11.5027823792
+五千斤 12.8020653633
+蔡伯喈 12.8020653633
+莺花 12.8020653633
+英花 12.2912397395
+志高气扬 13.900677652
+名称权 13.900677652
+邮费 11.8212361103
+实数 9.22784881751
+深有同感 11.598092559
+蒸蒸日上 10.4041700905
+三十六期 13.2075304714
+败家破业 13.900677652
+好吃懒做 11.7034530746
+季节冻土 11.5027823792
+纹章 12.5143832909
+快活 8.30969067146
+五千文 12.1089181827
+潸然泪下 10.7226238216
+底特律河 12.2912397395
+实体书 13.2075304714
+奖章 8.46259834305
+伊比利亚人 10.9049453784
+忘言 13.2075304714
+导纳 11.598092559
+导线 8.9519177616
+中影集团 11.8212361103
+高寒区 11.0103058941
+三十六条 12.5143832909
+淌口水 13.900677652
+自愧弗如 12.8020653633
+举杯 9.40086798165
+手术台 11.2616203224
+新闻追踪 13.900677652
+抵不住 11.1926274509
+英苏 12.8020653633
+陈大毛 9.48183704418
+阿拉曼 11.9547675029
+各兵种 11.4157710022
+这支 7.8161782389
+赤光 12.8020653633
+郡尉 11.8212361103
+恳请 9.93038573842
+实收 10.1871055853
+百千万 12.8020653633
+嘭嘭 11.3357282945
+靠岸边 13.900677652
+唯心论 11.0103058941
+买账 11.7034530746
+买货 11.598092559
+实支 13.2075304714
+跑光 11.3357282945
+叶瀚 13.2075304714
+持论 11.0103058941
+公格尔 11.9547675029
+执政之基 13.900677652
+地质局 11.5027823792
+由北向南 9.87532596124
+惟利是趋 13.900677652
+指天划地 12.1089181827
+衰颓 11.598092559
+五六级 13.2075304714
+举架 12.5143832909
+举枪 10.1630080337
+哨站 12.8020653633
+理曲 13.900677652
+河里 8.44535653662
+乾坤 9.06439574502
+伯爵爵位 13.900677652
+基石 8.96620371885
+英舰 10.8561552143
+主设备 11.8212361103
+草黄色 12.2912397395
+球根 11.2616203224
+实时 8.1641053545
+逐利性 11.598092559
+一哄而起 12.2912397395
+赤军 12.2912397395
+桌子 7.05799436974
+实无 10.4994802703
+文质彬彬 10.533381822
+英航 12.5143832909
+四百米 12.8020653633
+旺角 12.1089181827
+拉邦 13.900677652
+阳湾 12.5143832909
+聚珍版 12.2912397395
+血口 11.9547675029
+握别 12.1089181827
+乌紫 11.4157710022
+争得 9.48183704418
+冷炮 11.8212361103
+三门峡市 10.4666904475
+谢首辅 12.8020653633
+买超 12.5143832909
+教务长 9.87532596124
+书架子 13.2075304714
+割上 13.900677652
+割下 10.1394775363
+武侯织 13.2075304714
+兵曹 12.2912397395
+龙之梦 12.8020653633
+五二年 12.5143832909
+如其人 11.8212361103
+宇称 10.3743171274
+踩油门 10.533381822
+这方 10.3743171274
+花言巧语 10.533381822
+遵旨 8.89673134603
+七十多年 12.2912397395
+活性 7.94484028251
+隋贡方 13.2075304714
+一百分 13.2075304714
+创作室 11.8212361103
+阿拉果 12.2912397395
+洗耳恭听 10.6818018271
+平等竞争 11.3357282945
+河道 7.24652513179
+铁架子 11.9547675029
+便函 12.8020653633
+唐格 11.4157710022
+一瓶子不满 13.900677652
+团级 11.0103058941
+抽进 12.2912397395
+哪知 10.2117981979
+叮当 10.8096351986
+一百句 12.8020653633
+参考答案 12.8020653633
+长春花碱 13.900677652
+细胞分裂 9.44633035572
+起数 11.8212361103
+细柳 11.0674643079
+具体来说 10.1630080337
+驼子 13.2075304714
+负极板 12.5143832909
+赫赖亚 13.900677652
+鼎力扶持 13.2075304714
+抽过 11.3357282945
+孔明取 13.2075304714
+茂德 12.2912397395
+细查 10.1394775363
+江宁 9.59661255877
+弹筝 12.2912397395
+新闻点 13.900677652
+秋点兵 13.2075304714
+虚与委蛇 10.9562386728
+青岛海尔 9.23723855786
+纳米线 13.900677652
+李维业 12.8020653633
+很迟 11.9547675029
+主段 13.900677652
+怕人 9.20932976975
+纳曼加 13.900677652
+很近 8.79473217808
+主殿 10.7226238216
+戈罗 11.8212361103
+中央党部 11.598092559
+专业银行 10.8561552143
+碰钉子 12.1089181827
+纳米级 11.7034530746
+平章萧 13.2075304714
+释道 10.9562386728
+兵权 8.63281949291
+明国皇帝 12.5143832909
+具体来讲 11.3357282945
+计时员 12.8020653633
+新人新事 11.9547675029
+兑取 11.1926274509
+大富翁 10.7226238216
+未竟之志 12.2912397395
+标型元素 13.900677652
+说黑道白 13.900677652
+怕事 10.9049453784
+依稀可见 11.1926274509
+拉姆赛 10.765183436
+蔡戈尼 12.8020653633
+库契普 12.8020653633
+造诣 8.83177344976
+肉苁蓉 10.604840786
+割作 13.900677652
+市南区 12.5143832909
+大提琴家 12.5143832909
+常任制 12.8020653633
+叶燮 11.9547675029
+盖莱克 12.8020653633
+共聚反应 13.900677652
+英茂 13.2075304714
+和林生 11.3357282945
+球棒 12.5143832909
+米达斯 12.8020653633
+绝命书 12.2912397395
+伍兹 9.91169360541
+诺尔兰 12.8020653633
+杨廷福 10.3743171274
+膨松剂 12.8020653633
+用户名 10.9049453784
+遣散费 13.2075304714
+抗日战争 6.90216800973
+伍元 13.2075304714
+手术刀 11.598092559
+爵号 11.5027823792
+量热器 13.900677652
+一千四百万零二千七百六十户 13.2075304714
+造词 12.8020653633
+细条 11.1926274509
+一个五十岁 12.8020653633
+梅纽因 11.7034530746
+血压 8.11071748108
+首卷 12.8020653633
+抗倒伏性 13.900677652
+捡取 13.900677652
+乜机 12.8020653633
+新兴路 12.8020653633
+穆素尔 12.8020653633
+警署 12.8020653633
+一闪即逝 12.1089181827
+半日道 13.2075304714
+男主角 10.3171587135
+黑下来 10.4041700905
+唐棣 13.2075304714
+主次 10.0505300503
+拉里 12.1089181827
+兑卦 13.900677652
+惹人讨厌 13.900677652
+财政 6.34320475036
+唐森 12.5143832909
+造访 9.94943393339
+敬鬼 12.8020653633
+很轻 9.74179456862
+快泡 13.2075304714
+嘻笑怒骂 13.900677652
+英荷 11.2616203224
+二千一百名 13.900677652
+割伤 11.7034530746
+乾嘉 10.2371160058
+敬候 13.2075304714
+北京故宫博物院 11.2616203224
+以防万一 10.9049453784
+操必胜 13.900677652
+一九七零年 12.8020653633
+老来福 12.8020653633
+绢纺厂 12.5143832909
+玄奘西 13.2075304714
+南下列车 12.5143832909
+履行义务 10.3743171274
+假以辞色 13.900677652
+木钉 12.1089181827
+摺叠起来 13.900677652
+而用 9.38981814546
+旋转翼 13.2075304714
+裸胸 12.1089181827
+充实 7.96578345636
+杜鲁门 9.71102290995
+打击犯罪 11.8212361103
+绵羊 8.55357012126
+乱摊子 13.900677652
+海达 12.2912397395
+吸收剂 11.0103058941
+蜂窝式 13.2075304714
+海边 8.31718134319
+营销网 13.2075304714
+细想 9.29550746599
+王鸿生 13.900677652
+内外夹击 11.1280889297
+抗癌基因 13.2075304714
+蔬菜水果 10.7226238216
+委以重任 11.4157710022
+够朋友 11.5027823792
+赤土 12.8020653633
+王庆因 12.5143832909
+偏多 9.53122979951
+实据 11.5027823792
+乾净 11.5027823792
+而生 8.91707103027
+稳住阵脚 12.1089181827
+厂用电 13.900677652
+朱德润 13.2075304714
+持证人 12.8020653633
+造谣 9.69598503258
+巴莱密 13.900677652
+叶瘤 13.900677652
+塌方 9.89334446674
+这三名 11.9547675029
+嘉庆帝 11.5027823792
+屏除 13.2075304714
+林业大学 12.2912397395
+千姿百态 9.75754292558
+整百家 13.2075304714
+靳云鹏 11.7034530746
+松亭 13.900677652
+诡秘 9.77354326693
+海绵垫 12.5143832909
+脂蛋白 9.82314020807
+史贵知 13.2075304714
+赤坎 12.8020653633
+做贼心虚 11.2616203224
+争夺 6.86452915823
+三头六臂 10.2630914922
+快步 8.30225569298
+燕兵 12.2912397395
+享寿 13.900677652
+谨防扒手 13.900677652
+赤坂 13.900677652
+放不下 9.66657114738
+海运 7.9817837977
+快死 11.8212361103
+两三分 13.900677652
+四十余岁 13.2075304714
+单通道 12.8020653633
+贼样 13.900677652
+水中毒 12.8020653633
+历史性 8.61747392324
+西班牙人 8.62767809341
+驼峰 10.0294766411
+轴承钢 12.5143832909
+军人家庭 11.9547675029
+鲁道夫 10.9049453784
+孝思 13.900677652
+神不守舍 11.4157710022
+年租金 11.5027823792
+空洞化 13.900677652
+代表院 12.1089181827
+跑垒 12.1089181827
+监察院 10.5684731418
+于科尔 12.8020653633
+围观 8.84443184663
+照进 10.765183436
+物质力量 10.9049453784
+君子爱财 11.8212361103
+征南将军 11.2616203224
+屏障 8.34771806705
+女老板 11.1280889297
+茶瘾 13.900677652
+赵玄坛 13.2075304714
+海柳船 10.0720362555
+乾元 9.87532596124
+陈飞 11.7034530746
+鲍德里 13.2075304714
+商末周 12.5143832909
+西南军政委员会 11.3357282945
+吸收力 13.900677652
+谁谁谁 11.7034530746
+皮实草 13.2075304714
+残败 11.5027823792
+海轮 9.22784881751
+难以逆料 12.5143832909
+争妍 12.8020653633
+很行 12.5143832909
+甬江 10.9049453784
+云居寺 11.5027823792
+秦国富强 12.5143832909
+代表队 10.6818018271
+赤城 11.0674643079
+外防 13.900677652
+习管弦 13.900677652
+伤痕累累 10.4994802703
+工蚁 11.598092559
+薄铁叶 12.5143832909
+拉雷 12.1089181827
+加键笙 13.900677652
+松下 10.765183436
+一百名 9.96885201925
+江湖气 12.5143832909
+氢原子 8.99540287354
+马忠引 13.2075304714
+泪水直流 13.900677652
+项目数 12.1089181827
+芙蓉镇 8.94485059437
+生活必需品 9.58318953844
+这才 6.33333197596
+格玛先 13.2075304714
+冤苦 11.2616203224
+振翅 10.9049453784
+向左走 11.9547675029
+写写 10.9049453784
+伦诺克斯 13.900677652
+一百数十年 13.900677652
+伊斯拉 13.900677652
+专务 11.3357282945
+梗概 11.1280889297
+潘洪 12.8020653633
+可变电阻 12.8020653633
+彭越封 13.2075304714
+绵纸 11.5027823792
+案开庭 12.2912397395
+欠当 13.2075304714
+亲身经历 9.93038573842
+沟通感情 13.900677652
+广晋府 13.2075304714
+新媳妇儿 13.900677652
+平章军 11.9547675029
+降低标准 11.7034530746
+同功一体 13.900677652
+一时三刻 10.2630914922
+实战 8.28390655431
+讨出来 13.900677652
+龟缩 11.7034530746
+里尔帕 12.5143832909
+于御营 12.8020653633
+韩发贵 12.8020653633
+脉络膜 11.4157710022
+彭托 12.8020653633
+免烫 12.5143832909
+好莱坞 8.95903522937
+潘浚 13.2075304714
+路明军 13.2075304714
+庆元 9.63799777493
+阳奉阴违 11.598092559
+卫尉卿 13.2075304714
+苏海南 11.9547675029
+管乐器 11.1926274509
+教育战线 13.2075304714
+秘而不宣 11.0674643079
+背城一战 13.2075304714
+八九分 10.5684731418
+绵绵 9.80633308975
+河防 10.533381822
+唐僧见 11.598092559
+方有德 13.2075304714
+单枝型 12.2912397395
+工蜂 10.7226238216
+脉岩 12.8020653633
+牵涉到 9.45802639549
+国天益 10.533381822
+全球股市 8.35941410682
+追欢买笑 13.900677652
+护花使者 13.900677652
+微型机 11.3357282945
+拉面 10.642581114
+警种 12.8020653633
+这户 10.6818018271
+早晚自习 13.900677652
+地窨子 10.6818018271
+实招 12.1089181827
+自我剖析 12.8020653633
+糖烟酒 13.2075304714
+五千户 11.8212361103
+警示 8.1608847398
+别胡说 11.7034530746
+儿女 7.85330547293
+所是 13.2075304714
+线毯 12.8020653633
+辨别是非 13.2075304714
+这招 10.5684731418
+恳谈 13.2075304714
+省农业厅 10.6818018271
+向松山 12.5143832909
+欢乐谷 10.4994802703
+鲜杏 13.2075304714
+一个多头 12.5143832909
+鸭蛋脸 11.7034530746
+兴替 11.9547675029
+丁国宝 9.27570483869
+锡诺普 12.8020653633
+魁星楼 11.1926274509
+主流 6.95948759691
+工办 12.5143832909
+苏浙皖 11.7034530746
+骨血 10.4349417492
+历史感 11.598092559
+哽着 13.2075304714
+阿洛菲 13.2075304714
+第八届 7.42524493527
+有理方程 13.900677652
+拉米亚 13.900677652
+奶牙 13.900677652
+此起彼伏 9.07236391467
+线段 10.3171587135
+两两成 12.5143832909
+第八层 11.5027823792
+喀里多尼亚 12.5143832909
+第八局 13.900677652
+柏油路 10.1164880181
+基点 7.62591563073
+跨马 11.9547675029
+凡庸 12.8020653633
+由师师 12.8020653633
+明显改善 8.94485059437
+李三爷 13.900677652
+鲜有 9.36807815882
+蓬皮杜 11.4157710022
+道德经 9.91169360541
+食草动物 11.598092559
+欲火焚身 13.2075304714
+郡守 9.65218240993
+苏珊娜 12.8020653633
+写入 9.75754292558
+乌程 10.6818018271
+王玉蓉 13.2075304714
+蒙古国 9.04864738806
+巍山彝族回族自治县 12.1089181827
+凡应 12.5143832909
+燕国公 12.8020653633
+商业广告 11.1926274509
+周游列国 11.8212361103
+实报 13.900677652
+新升 13.900677652
+随葬品 9.29550746599
+难以描述 11.9547675029
+马复初 12.2912397395
+七百万斤 13.2075304714
+唐派 11.7034530746
+手脚干净 13.2075304714
+坚定信心 9.93038573842
+兵戎 11.3357282945
+兵戈 11.1280889297
+灵武县 10.9562386728
+三道沟 13.900677652
+线桥 12.2912397395
+尽是 8.47572763449
+通信机房 13.2075304714
+雪里红 13.2075304714
+一个三岁 12.8020653633
+梅嫩德斯 13.2075304714
+高卢战 12.8020653633
+坚定信念 11.9547675029
+一百回 12.5143832909
+推度 13.900677652
+卫星侦察 12.1089181827
+全般支援 12.8020653633
+唐洋 13.900677652
+侯铁榜 12.8020653633
+饺子馅 10.765183436
+基督教 6.93559730637
+饺子馆 12.5143832909
+慕川 13.2075304714
+检举人 11.598092559
+镀覆 13.900677652
+唐海 11.8212361103
+利益均沾 13.900677652
+乾县 10.8561552143
+海路 9.33632946051
+吴晶晶 13.900677652
+儿媳 8.65365357982
+生死相许 12.2912397395
+跌水 10.642581114
+张德成 12.1089181827
+跑啦 11.9547675029
+四十余座 13.2075304714
+没把握 11.1280889297
+联贯 13.2075304714
+刍狗 12.8020653633
+叶球 11.3357282945
+等份 13.2075304714
+流动资本 8.44963919841
+尼布楚 10.1630080337
+震天撼地 11.5027823792
+等价 8.55357012126
+洮儿河 11.0674643079
+并驱争先 13.900677652
+维萨里 11.9547675029
+柱面透镜 13.900677652
+双眉深 12.8020653633
+高速路 10.1630080337
+粘滞 10.4994802703
+仁智 9.77354326693
+思南县 11.598092559
+湍急 8.91707103027
+一次次 8.71329184614
+六十二岁 13.2075304714
+惠东县 13.2075304714
+裴罗 13.2075304714
+商业广场 11.4157710022
+庆功 10.4349417492
+江风 10.642581114
+举措 7.28461246684
+免疫测定 13.2075304714
+黑丝袜 12.1089181827
+阿拉戈 11.4157710022
+袅绕 13.900677652
+追女仔 12.5143832909
+禹死启 13.2075304714
+乌丹城 13.2075304714
+乾卦 11.4157710022
+朱太尉 12.1089181827
+增加量 11.0103058941
+赛迪网 13.900677652
+兴旺 8.65365357982
+日就月将 13.2075304714
+威尔士 9.36807815882
+中原大学 12.1089181827
+拉钩 12.5143832909
+第五节 10.604840786
+乳质 10.6818018271
+罕有 9.82314020807
+缝下 12.5143832909
+前哨战 12.8020653633
+写到 9.38981814546
+海贝 11.2616203224
+逸民 11.8212361103
+伍员 11.9547675029
+逸气 13.2075304714
+锭子油 13.900677652
+悲观派 12.2912397395
+而知 11.4157710022
+伸头缩颈 13.900677652
+捏死 11.4157710022
+伯叔兄 13.900677652
+阿里安 11.8212361103
+吴山友 12.8020653633
+采集器 12.8020653633
+无缝管 10.765183436
+光波长 12.5143832909
+裹乱 12.8020653633
+兴文 11.1926274509
+箭垛 12.5143832909
+凑热闹 9.84023464143
+气步枪 11.9547675029
+金字塔 8.68574189437
+以己度人 12.8020653633
+极乐鸟 11.4157710022
+拉链 10.2897597393
+欧吐密 13.2075304714
+伍吉 12.8020653633
+甘石星 13.2075304714
+阿帕克 12.1089181827
+清减 12.5143832909
+绵絮 13.900677652
+傅东华 13.900677652
+民办高校 12.8020653633
+争宠 10.5684731418
+漱口水 11.9547675029
+护车 11.9547675029
+狄遇 12.8020653633
+有悔 11.8212361103
+开支 7.65651075131
+观音菩萨 9.5062284973
+多样性 8.92394390956
+大转盘 13.2075304714
+基特 11.8212361103
+拉锁 12.2912397395
+一号线 10.8096351986
+军礼 9.91169360541
+王德宝 12.5143832909
+狄道 11.1926274509
+迟早会 9.4233408375
+交通流 12.1089181827
+艾威林 13.2075304714
+捏合 11.5027823792
+生产规划 13.2075304714
+大梵天 12.2912397395
+基片 10.765183436
+长治县 11.7034530746
+酒缸 12.2912397395
+苏东坡 10.0088573539
+写去 13.2075304714
+裴绪 12.5143832909
+基牙 12.5143832909
+拉锯 9.91169360541
+红瓦店 10.0294766411
+方毅 10.4349417492
+唐氏 10.5684731418
+范长生 11.598092559
+凡属 10.2371160058
+兽中之王 12.8020653633
+系数 7.97909923233
+张青道 11.8212361103
+看不透 10.7226238216
+格吕恩 13.900677652
+茶淀 13.900677652
+残躯 13.900677652
+语言表达 10.4349417492
+第一尊 13.2075304714
+庶几无愧 13.2075304714
+叶甲 11.1926274509
+蠕动 8.5488195185
+导管 9.02548032877
+碧落黄泉 12.8020653633
+理论性 10.7226238216
+凡尼 13.900677652
+永磁性 13.900677652
+式打印机 12.2912397395
+台湾地区 9.69598503258
+笔下生辉 13.900677652
+啃书虫 13.900677652
+拉长 9.23723855786
+萨汉德 13.2075304714
+帮助后进 13.900677652
+十载寒窗 13.900677652
+防了 12.8020653633
+仁杰 12.5143832909
+拉伯语 13.900677652
+举手 9.05649056552
+凡尔 11.7034530746
+线手套 12.8020653633
+练拳 11.1280889297
+侯迁州 13.2075304714
+珍稀动物 9.38981814546
+女篮赛 13.900677652
+临安市 13.900677652
+唐河 10.0294766411
+副委员长 9.05649056552
+等会 11.1280889297
+蹲坐 13.2075304714
+北极熊 10.5684731418
+粼粼 11.3357282945
+买帐 12.2912397395
+内部刊物 12.8020653633
+刘诗昆 12.5143832909
+庆历 9.84023464143
+革正 13.900677652
+练成 10.2630914922
+仁果 13.900677652
+高压硅堆 13.900677652
+三十六把 13.900677652
+警笛 12.5143832909
+一百块 10.2897597393
+竞争法 13.900677652
+绩效考核 10.2630914922
+完事大吉 12.8020653633
+叶痕 11.9547675029
+实惠 8.46259834305
+捏咕 12.8020653633
+马快 11.4157710022
+练手 11.9547675029
+手术器 13.900677652
+国民革命军第八路军 10.765183436
+死不瞑目 10.1394775363
+晕死 11.7034530746
+工薪 11.0674643079
+快棋 12.8020653633
+京客隆 13.900677652
+发现矛盾 13.900677652
+军神 13.900677652
+融雪水 11.2616203224
+彭湖 13.900677652
+充塞 10.7226238216
+等位 11.598092559
+韦伯斯特 12.1089181827
+枸杞茶 13.2075304714
+解放战争 8.05423887692
+毛织业 12.5143832909
+任北洋 11.5027823792
+海豹 9.54396882529
+麦哲伦 9.82314020807
+权大喜 11.1926274509
+插入损耗 13.2075304714
+桌布 10.4666904475
+警策 11.7034530746
+主演 8.36728816325
+文末 12.8020653633
+秋闱 11.9547675029
+转手倒卖 12.8020653633
+拉门 11.0103058941
+维尔芬 13.900677652
+应付自如 12.2912397395
+第八年 12.2912397395
+兑坊 13.2075304714
+系族 13.900677652
+海豚 10.1164880181
+里尔岭 13.900677652
+漂白液 13.900677652
+第八册 13.900677652
+日全食 10.8096351986
+庆尚 12.1089181827
+准保 11.9547675029
+任一飞 12.8020653633
+三农问题 12.1089181827
+遮目鱼 11.9547675029
+防人 12.2912397395
+俯察 11.8212361103
+张德江 12.5143832909
+练一练 12.2912397395
+一概而论 10.1394775363
+湄南河 10.9049453784
+拔去 11.3357282945
+两点钟 10.7226238216
+布朗 7.62968922012
+江陵 8.26946587015
+相生律 13.900677652
+保健医 13.2075304714
+准信 11.2616203224
+泰雅族 12.1089181827
+跌打 11.598092559
+抗力形 13.900677652
+卡劳河 13.900677652
+毫不退缩 12.1089181827
+戈瑞 13.900677652
+英裔 11.5027823792
+骡马车 13.900677652
+细沙 10.2371160058
+阿拉法 13.900677652
+江阔 11.8212361103
+精心制作 10.9049453784
+抗灾救灾 11.8212361103
+间冰期 10.0940151622
+线春 12.2912397395
+货物运输 10.0720362555
+潘恩 11.2616203224
+震耳 10.4041700905
+小半罐 13.2075304714
+快来 8.89004235788
+小老鼠 11.1280889297
+陶瓷砖 13.900677652
+江阴 8.97342396682
+江阳 11.5027823792
+江防 11.1280889297
+消防栓 12.8020653633
+庾太后 12.8020653633
+绝不能 8.5440913773
+财源 9.89334446674
+拉马 12.1089181827
+士官长 12.2912397395
+赤字 8.57766767284
+海菜 13.900677652
+快板 10.2630914922
+赤子 10.642581114
+乐一乐 11.8212361103
+第二十五回 11.598092559
+马尔科夫 11.8212361103
+泪花 8.78868986362
+鲜橙 12.2912397395
+粪便 8.77077893705
+掠人之美 13.2075304714
+洪泛区 11.9547675029
+那成精 13.2075304714
+连起 12.5143832909
+郡国 9.49395840471
+煽动 8.78268383956
+洋娃娃 11.0103058941
+钙通道 13.900677652
+爽滑 12.8020653633
+市川 13.900677652
+赵家义 13.900677652
+周其仁 12.2912397395
+跑官 12.1089181827
+探测器 8.70218062071
+杀虫药 13.900677652
+灭门之祸 11.3357282945
+蹈汤赴火 13.900677652
+班启奏 12.1089181827
+爵士 9.05649056552
+唐授 12.2912397395
+擦鞋 11.5027823792
+减数分裂 9.93038573842
+暑往寒来 13.900677652
+细民 11.0674643079
+擦音 11.8212361103
+盛情难却 11.4157710022
+阳伞效应 13.900677652
+海药 10.3171587135
+风光一时 11.8212361103
+准会 10.0940151622
+花儿匠 12.2912397395
+悲惨生活 11.0674643079
+叮咚 10.3171587135
+用兵之道 11.9547675029
+狄龙 12.8020653633
+广岛 9.80633308975
+双音词 12.5143832909
+斯贝格 12.8020653633
+连赢 11.8212361103
+七百二十五名 13.2075304714
+西门町 13.900677652
+一万多一点 13.900677652
+细水 12.8020653633
+云块 11.5027823792
+各尽 13.2075304714
+逸才 13.2075304714
+海草 10.8561552143
+地纪胜 11.4157710022
+碌碌无为 11.7034530746
+逆火 11.598092559
+李梦龙 13.2075304714
+陈老爷 11.8212361103
+勾魂引 12.5143832909
+强壮剂 11.9547675029
+玩起来 11.1926274509
+视盘 11.9547675029
+江青 9.21854642485
+西哈诺 13.900677652
+矛盾 6.18778669049
+瓦纳 12.5143832909
+泌乳 11.1280889297
+马塔夫 13.900677652
+滚装船 11.2616203224
+安博塞 13.900677652
+线束 12.8020653633
+盛极一时 9.93038573842
+独揽大权 11.7034530746
+省称 12.8020653633
+韦格蒂 12.1089181827
+海芋 13.2075304714
+线材 9.41204128224
+黑客技术 13.900677652
+加拿大队 13.2075304714
+褐马鸡 10.7226238216
+辽宁沈阳 10.6818018271
+乌盟 12.2912397395
+承业二 12.8020653633
+江面 8.77077893705
+人造革 10.3453295905
+残肢 11.9547675029
+骨蒸 11.8212361103
+阿舒拉 12.1089181827
+革新 8.13548654919
+心如槁木 13.900677652
+唐承 12.8020653633
+裴炎 12.1089181827
+专门人才 10.4666904475
+伍家 12.1089181827
+擦除 11.9547675029
+固体废物 10.9562386728
+啜泣声 11.7034530746
+残肴 13.2075304714
+准予 9.80633308975
+深根性 11.7034530746
+练法 11.8212361103
+联合国粮农组织 10.9562386728
+小格子 11.2616203224
+加拿大人 10.7226238216
+不屈不挠 9.96885201925
+优秀品质 11.8212361103
+居金文 13.2075304714
+支气管 9.06439574502
+争吵 8.64318227995
+名垂后世 12.8020653633
+数来数去 12.2912397395
+航天航空 11.8212361103
+细润 11.8212361103
+二十二处 13.2075304714
+记录在案 11.0674643079
+修道院 9.29550746599
+唐才 13.2075304714
+师技匠 13.900677652
+嘉勉 12.8020653633
+冲进来 10.533381822
+缝隙 8.02574692112
+海航 10.0940151622
+生活来源 10.642581114
+听后感 13.900677652
+工课 11.3357282945
+工读 11.5027823792
+警用 11.2616203224
+荟集 12.1089181827
+工号 13.900677652
+海船 9.6811699468
+练气 12.8020653633
+旺苍 11.9547675029
+双月 12.2912397395
+汉魏至 12.8020653633
+人造奶油 11.598092559
+尤以楚 12.8020653633
+直径约 9.5062284973
+一百套 12.8020653633
+核辐射 10.5684731418
+伍子 13.2075304714
+残联 10.9049453784
+海舟 13.2075304714
+用非所学 13.900677652
+细浪 12.1089181827
+威尔基 13.900677652
+新闻稿 10.8561552143
+台次 12.8020653633
+伍孚 13.2075304714
+火字旁 13.2075304714
+坐公车 13.2075304714
+导电 8.92394390956
+慌成 12.8020653633
+扶危济 13.900677652
+新句 13.900677652
+梦想破灭 12.5143832909
+清癯 11.2616203224
+庆州 11.1280889297
+一百天 11.2616203224
+郭伯雄 13.2075304714
+十传百 10.7226238216
+和笛木 12.8020653633
+标的物 10.533381822
+口出不逊 13.2075304714
+第五路 12.1089181827
+唐括 13.2075304714
+一个三十 12.2912397395
+山中宰相 11.9547675029
+一百多 9.45802639549
+垂询 10.4349417492
+兑奖 10.7226238216
+赵烈侯 11.9547675029
+细活 11.8212361103
+携巨款 13.2075304714
+外贸额 13.900677652
+翠湖 10.8561552143
+百分之一里 13.900677652
+七十二所 13.2075304714
+下三烂 11.598092559
+主意 6.52855962364
+专发 13.900677652
+基粒 11.7034530746
+七十二扇 13.900677652
+冉斯登 13.900677652
+美好事物 12.1089181827
+提回 11.9547675029
+张国伍 12.5143832909
+手术室 9.59661255877
+缆线 13.900677652
+胎生学 13.900677652
+实测 9.43476953332
+万里无云 10.9562386728
+循序渐进 9.65218240993
+汪哥 13.2075304714
+里尔克 12.2912397395
+沉陷在 13.2075304714
+混进来 12.1089181827
+面光源 12.8020653633
+工行 6.94222925868
+没齿难忘 11.8212361103
+跨下 11.7034530746
+叮噹 12.5143832909
+实证主义 9.58318953844
+快收 12.8020653633
+苎麻根 13.900677652
+快攻 11.0103058941
+逼良为娼 12.1089181827
+盖上 9.19114745066
+苍山县 11.9547675029
+创作力 12.5143832909
+两半儿 12.8020653633
+裸身 12.1089181827
+秋令 13.900677652
+出其不备 13.900677652
+科斯岛 13.2075304714
+允从 12.8020653633
+脉压 12.2912397395
+谢仪 13.900677652
+主报 13.900677652
+桓帝永 12.2912397395
+莫诺莫 11.9547675029
+桄榔 12.8020653633
+造船 7.71446902808
+付之策 12.8020653633
+掌叶木 13.2075304714
+主抓 11.9547675029
+警监 11.598092559
+后方城市 13.900677652
+测量员 11.9547675029
+庆幸 8.51160592216
+湖南省委 11.0103058941
+第八句 13.900677652
+立枯病 11.5027823792
+郡吏 12.8020653633
+燕尾港 12.2912397395
+龙形玉 13.900677652
+理性认识 10.3171587135
+石油学院 11.4157710022
+遂意 12.2912397395
+保障部门 12.5143832909
+预见到 10.0940151622
+休戚与共 11.9547675029
+个人全能 11.5027823792
+金山毒霸 13.900677652
+枢密院 8.45394028031
+刑警支队 11.5027823792
+庆应 11.598092559
+盖世 10.6818018271
+环氧乙烷 11.1926274509
+但塔娜 12.5143832909
+练漂 12.8020653633
+马忠入 13.2075304714
+境遇 9.35738286971
+兵源 10.0088573539
+免缴 11.9547675029
+长治市 11.2616203224
+鲜桃 12.5143832909
+乳脂 13.900677652
+时间常数 13.2075304714
+工业体系 9.29550746599
+视界 11.0674643079
+主打 9.62401153296
+曲红楼 13.2075304714
+一千一百万元 13.2075304714
+工装 11.3357282945
+势不可当 10.9562386728
+善卷洞 11.5027823792
+海脊 11.8212361103
+半公斤 13.2075304714
+晕昏 13.900677652
+戴旭 12.8020653633
+东木公 13.2075304714
+麻江县 13.900677652
+连跑 13.2075304714
+全国工商联 10.4994802703
+新闻社 10.0940151622
+患得患失 10.9049453784
+所有 4.8011571151
+生不逢时 11.0103058941
+软件设计 11.7034530746
+当头炮 13.2075304714
+乳腐 13.900677652
+民为邦本 13.900677652
+免罪 11.1926274509
+虫体 9.54396882529
+拉风 12.2912397395
+程裕淇 12.2912397395
+填上去 12.5143832909
+屏风 8.42421410004
+子正蒙 12.1089181827
+八十四篇 13.2075304714
+莆田市 11.7034530746
+卫喇特 12.8020653633
+己酸 12.2912397395
+考古学界 11.7034530746
+心肌梗塞 10.4994802703
+财气 12.5143832909
+诉求点 12.8020653633
+谭纶 10.3171587135
+玉真观 12.2912397395
+第八卷 9.98865464655
+凡军 12.1089181827
+己酮 13.900677652
+一百对 13.2075304714
+成人期 12.8020653633
+仪器厂 11.9547675029
+伊斯法 13.2075304714
+北京师范大学中文系 13.900677652
+岗位培训 12.5143832909
+乃武乃文 12.8020653633
+必赏 12.1089181827
+周荣曜 11.3357282945
+生父母 12.1089181827
+有雪雁 13.900677652
+张进忠 13.2075304714
+相砥励 12.8020653633
+基金部 11.4157710022
+越走越远 10.533381822
+四十余口 13.900677652
+散步区 13.900677652
+写得 8.52539924429
+大独裁者 11.8212361103
+斜拉 11.4157710022
+潘振 11.9547675029
+后果堪虑 13.900677652
+武川甩 13.900677652
+室内乐 10.2897597393
+科尔沁左翼中旗 13.2075304714
+快搬 12.5143832909
+山自西 13.2075304714
+跑堂 10.1164880181
+伊川县 11.4157710022
+震荡 5.23575434854
+斯托克斯 10.4041700905
+英译 11.8212361103
+吃火锅 10.9049453784
+阿什顿 12.5143832909
+互相联系 10.2897597393
+泪腺 10.9562386728
+过干瘾 12.8020653633
+三岔口 11.598092559
+一百家 11.8212361103
+激活状态 13.900677652
+残花 12.1089181827
+主控 12.1089181827
+达里诺尔 11.9547675029
+主推 11.0674643079
+蹲守 11.8212361103
+第五轮 13.2075304714
+任征行 13.2075304714
+海胆 10.0940151622
+淋证 12.8020653633
+伊斯河 13.900677652
+社会安定 10.604840786
+大中学生 12.5143832909
+顶死你 13.900677652
+身驱 13.900677652
+乳胶 10.3743171274
+晕染 11.598092559
+老庄思想 12.5143832909
+华阳国志 11.2616203224
+王之明 11.7034530746
+燕雀安知鸿鹄之志 13.900677652
+现任 7.89432449237
+赤塔 11.5027823792
+几万种 13.2075304714
+英语 7.42063309005
+鲜榨 12.2912397395
+一九七六 12.8020653633
+方法论 8.87023973058
+澄江县 13.2075304714
+伍奢 12.8020653633
+琪琪 13.900677652
+现钞 10.9562386728
+快撑 13.2075304714
+海耳 11.8212361103
+快撕 13.900677652
+基维 13.2075304714
+缝针 11.9547675029
+泪膜 12.5143832909
+工人运动 8.9308643524
+第五辑 13.900677652
+现钱 10.0940151622
+符五世 13.2075304714
+九千余卷 13.2075304714
+桌前 9.15574552361
+一无所成 12.5143832909
+第五辆 13.2075304714
+江门 9.7898037878
+徐夷 12.2912397395
+由协修 13.2075304714
+官监甲 13.2075304714
+语刚 12.8020653633
+刘胡兰纪念馆 12.8020653633
+仁殿 11.7034530746
+戈矛 11.598092559
+陷入 6.72825307485
+鱼藻宫 13.2075304714
+石邑县 13.2075304714
+现以 10.9562386728
+余绳武 12.8020653633
+琴行 12.8020653633
+基线 9.66657114738
+七十多块 13.2075304714
+电子城 12.1089181827
+克里默 12.2912397395
+基纳 12.5143832909
+扑打 10.4041700905
+说短道长 13.2075304714
+湍流 9.25628675283
+南直隶 10.0505300503
+伏羲氏 11.4157710022
+藏书量 12.8020653633
+赤壁 9.58318953844
+卡内基音乐厅 12.8020653633
+疏疏落落 12.8020653633
+主持 6.40291595135
+这三家 9.84023464143
+涂布纸 13.900677652
+走道儿 13.2075304714
+扑扇 11.4157710022
+寇蒂斯 13.2075304714
+有钱能使鬼推磨 11.8212361103
+条山 12.2912397395
+程序清单 13.900677652
+走门串户 13.900677652
+勾蛋子 12.8020653633
+丰富化 12.8020653633
+蜜蜡 13.900677652
+五十五六岁 12.8020653633
+这歌 11.8212361103
+乌珠 11.9547675029
+政由己出 13.900677652
+喷淋 12.1089181827
+四则运算 11.0103058941
+法语系 13.900677652
+多万颗 12.8020653633
+争光 11.4157710022
+介休市 13.2075304714
+控制能力 9.75754292558
+占全城 13.2075304714
+梁陈间 13.2075304714
+齐白石 10.604840786
+唐末 8.56313957227
+导热 10.7226238216
+海螺 9.17328983326
+静注 11.0103058941
+藏书阁 13.900677652
+床第之间 13.900677652
+奚仲 13.2075304714
+快挤 13.900677652
+捏弄 11.7034530746
+唐朝 7.58351296523
+带回家 10.2630914922
+这死 11.3357282945
+明廷罢 12.2912397395
+许崇智 11.8212361103
+误导性 10.4041700905
+年事已高 10.4041700905
+买药 10.5684731418
+粟拜爵 12.8020653633
+霍启刚 12.5143832909
+复制件 12.2912397395
+赵忻城 13.2075304714
+河鼓 11.7034530746
+惠风节 12.8020653633
+很胖 11.598092559
+箍头 13.900677652
+那小巧 13.2075304714
+两立方米 13.2075304714
+细君 12.8020653633
+老来瘦 13.900677652
+高效性 13.2075304714
+唐杨 12.8020653633
+吸成 13.900677652
+海蟹 12.1089181827
+造物主 10.8561552143
+马萨诸塞州 9.59661255877
+骨膜 10.9049453784
+很能 10.4041700905
+这次 5.48043598664
+再说下去 9.61021821083
+刚果民主共和国 12.2912397395
+唐杜 13.2075304714
+赵峡黄 11.4157710022
+阿部 12.5143832909
+快捷 9.15574552361
+长尾猿 13.900677652
+弘传位 12.8020653633
+这款 8.0285598625
+索莱达 13.2075304714
+意中人 10.9562386728
+免租 11.7034530746
+唐李 11.9547675029
+乌玛 12.5143832909
+罗友礼 13.2075304714
+蝴蝶鱼 11.8212361103
+短篇小说 8.37124856446
+李孝忠 9.93038573842
+团员青年 12.8020653633
+窦靖童 13.900677652
+活化能 11.0103058941
+不徐不疾 13.900677652
+买菜 9.36807815882
+仁沐 13.2075304714
+变形金刚 11.9547675029
+静江 11.7034530746
+免礼 11.3357282945
+三九集团 12.8020653633
+莺谷 13.900677652
+触变性 13.2075304714
+保健型 13.900677652
+海蜇 10.4349417492
+言治道 13.2075304714
+唐析 12.5143832909
+古城区 12.8020653633
+快接 11.598092559
+消防法 13.900677652
+赤径 13.2075304714
+宋用兵 12.8020653633
+欠帐 12.2912397395
+千余千米 13.2075304714
+王家坪 12.1089181827
+由城邦 12.5143832909
+朴园 13.2075304714
+考核办法 12.1089181827
+三万贯 12.8020653633
+骨肉离散 13.2075304714
+骑去 11.9547675029
+卢瑟 12.5143832909
+姚之富 12.8020653633
+裴生 13.900677652
+彼得斯 13.2075304714
+彝海结盟 13.900677652
+深入浅出 10.7226238216
+免票 11.3357282945
+田作 13.900677652
+故作姿态 11.9547675029
+干部作风 10.9562386728
+新闻网 8.62256299275
+毛细胞 11.7034530746
+七十二条 12.5143832909
+一卒 11.2616203224
+五千步 12.5143832909
+衣冠楚楚 11.1280889297
+警灯 12.5143832909
+扑救 11.1926274509
+违规行为 8.59240995457
+唐某 12.1089181827
+仁波 13.2075304714
+小白旗 13.2075304714
+赤心 11.1280889297
+史弘肇 12.2912397395
+搅拌机 11.5027823792
+玉山 9.12155415886
+四十余名 13.900677652
+独具一格 10.4994802703
+死而复生 12.1089181827
+成一家言 13.900677652
+争冠 13.900677652
+英豪 10.4666904475
+这段 7.69611988941
+静水 10.5684731418
+赵寡妇 13.2075304714
+主时 12.2912397395
+田五 10.0088573539
+睡不着 8.21709788464
+中共中央对外联络部 12.2912397395
+骨胶 12.2912397395
+刘凤云 9.85762638414
+红杉 9.6811699468
+拆散开来 13.2075304714
+石英岩 9.59661255877
+快成 10.1164880181
+英超 11.0674643079
+唐昧 13.2075304714
+主旨 9.34680076038
+田二 10.1630080337
+唐昭 13.2075304714
+堆积起来 10.642581114
+海蚀 10.1871055853
+参考报 8.74738605748
+基础 4.76323060552
+月桂冠 13.900677652
+廷尉 10.3743171274
+白茸茸 13.2075304714
+天元赛 13.900677652
+墨守盛 13.900677652
+赤帝 12.5143832909
+田产 9.65218240993
+占全园 13.900677652
+新力 11.5027823792
+华严宗 10.6818018271
+新闻纸 10.533381822
+田亩 9.37888907493
+田亮 13.900677652
+实脾饮 12.8020653633
+付诸流水 12.2912397395
+万世不易 13.900677652
+新闻组 11.9547675029
+锡林郭勒草原 11.598092559
+唐智 13.900677652
+拉齐 12.2912397395
+平儿扶 13.2075304714
+仁济 12.8020653633
+哈里森 11.0674643079
+伍德 10.0294766411
+田仁 13.900677652
+华严寺 11.4157710022
+军马场 11.2616203224
+酒泉钢铁公司 12.5143832909
+海蛰 13.900677652
+幼稚师范 13.2075304714
+诺尔德 12.5143832909
+巯基嘌呤 13.2075304714
+唐景 12.8020653633
+海蛇 9.94943393339
+海蛆 13.900677652
+平安北道 12.8020653633
+徐肖冰 13.2075304714
+田价 12.5143832909
+门生故吏 11.9547675029
+主料 10.9049453784
+木子美 13.900677652
+木贼 10.8096351986
+骨肉 9.04086524761
+主文 12.2912397395
+档案法 12.2912397395
+田令 10.3453295905
+衍射角 12.2912397395
+待制 10.8561552143
+五十九篇 13.2075304714
+八卦山 12.5143832909
+凡因 11.8212361103
+小柳 12.5143832909
+第八名 11.3357282945
+及物 12.2912397395
+一次性 7.92179188707
+田业 12.8020653633
+戴粹伦 13.2075304714
+充分 6.11620441624
+的确如此 10.9049453784
+潘文 13.2075304714
+田东 11.7034530746
+陷在 9.6811699468
+王祥弟 13.2075304714
+田七 11.1926274509
+崔天凯 12.2912397395
+很脏 11.1280889297
+快投 13.900677652
+古彝文 12.8020653633
+空前未有 11.9547675029
+唐御弟 11.8212361103
+戒严令 11.5027823792
+乌特 11.3357282945
+想装 13.900677652
+田丰 11.0674643079
+人样 11.7034530746
+核酪 13.900677652
+黄土高原 8.24119543622
+快报 9.37888907493
+分系统 10.6818018271
+自出心裁 13.900677652
+田主 10.765183436
+主教 8.81927328699
+联系地址 12.1089181827
+波形蛋白 13.900677652
+纪大论 13.2075304714
+线描 10.9049453784
+使眼色 9.22784881751
+忿忿然 13.900677652
+虹膜 10.5684731418
+英货 11.1280889297
+齐人之福 13.900677652
+蓖麻 10.4666904475
+工运 12.5143832909
+静海 10.9049453784
+田中 9.85762638414
+田乐 13.2075304714
+修复一新 13.2075304714
+叶群 12.5143832909
+儿童教育 11.3357282945
+李鸿藻 11.9547675029
+主攻 8.82550383674
+全恶 13.2075304714
+此消彼长 10.2897597393
+主政 10.1394775363
+子承父业 12.5143832909
+琉璃仙 13.900677652
+中国民航 10.0294766411
+人生态度 11.598092559
+枕骨 11.1926274509
+巴尔米 13.2075304714
+灰姑娘 11.5027823792
+海虾 11.9547675029
+自轻自贱 11.9547675029
+衮州 13.900677652
+定海县 12.1089181827
+白帆太 13.2075304714
+海虹 9.66657114738
+一家眷属 13.900677652
+亚硫酸钠 12.8020653633
+旗幡 10.6818018271
+工值 13.2075304714
+置之脑后 12.1089181827
+消泡剂 12.1089181827
+狄骥 12.5143832909
+珞巴 11.2616203224
+张建伟 13.2075304714
+易容 13.2075304714
+写好 10.2897597393
+陷坑 10.4041700905
+几程 13.2075304714
+华严孔 13.2075304714
+邓承修 12.8020653633
+文中意 12.2912397395
+科斯蒂 11.9547675029
+文山县 13.900677652
+仁清 13.2075304714
+死后多年 13.2075304714
+和平谈判 10.1164880181
+本亚科 12.5143832909
+路易莎 13.900677652
+江道 11.8212361103
+吸收塔 13.900677652
+耍大牌 13.900677652
+总司令部 9.40086798165
+老唱片 13.900677652
+墨竹 10.765183436
+彼得松 12.8020653633
+唐顺之 11.9547675029
+九天揽月 13.2075304714
+变态狂 13.2075304714
+叶类 11.7034530746
+警犬 9.16447920358
+异音 13.900677652
+系民 13.900677652
+虔诚 8.61747392324
+马塔帕 12.2912397395
+田野 8.45394028031
+改轮 13.2075304714
+郭样 8.53470163695
+甲基丙烯酸甲酯 11.1280889297
+男低音 11.8212361103
+山堡东 13.900677652
+可加可减 13.900677652
+裴矩 11.8212361103
+中共八大 13.900677652
+假性痴呆 13.2075304714
+住房价格 10.1394775363
+中量级 13.2075304714
+琴趣 13.900677652
+别出机杼 13.900677652
+总成交 8.86372504956
+周小燕 12.8020653633
+海姆 10.3171587135
+别藏 13.2075304714
+参访团 12.8020653633
+失业 7.63347710343
+唐肃宗 10.604840786
+大南山 12.2912397395
+填平 9.85762638414
+线性 8.40350942668
+举止 8.51160592216
+三周岁 13.900677652
+海藻 9.27570483869
+铜车马 11.1280889297
+石维坚 12.8020653633
+一个三品 13.2075304714
+快慢 9.02548032877
+戈特 11.8212361103
+唐敖 13.900677652
+漫画式 12.2912397395
+香帅奏 13.900677652
+叶簇 11.8212361103
+梭梭 10.4349417492
+失主 10.5684731418
+路线图 9.26594866375
+俯冲 9.07236391467
+快慰 10.642581114
+艾小红 10.6818018271
+於梨华 12.8020653633
+郡候 13.900677652
+很苦 10.2117981979
+买卖人 11.0674643079
+科斯塔 11.4157710022
+性文化节 12.5143832909
+愤不欲生 12.1089181827
+一百年 9.6811699468
+争取 6.70324229788
+北洋武备 13.900677652
+长相依 13.900677652
+蒲辅周 12.8020653633
+王理查 12.8020653633
+伍山 13.900677652
+一路风尘 12.8020653633
+厄尔布鲁士山 12.8020653633
+帕萨尔加 13.2075304714
+矿物学 10.4666904475
+主景 12.2912397395
+怆然泪下 13.900677652
+维尔诺 12.1089181827
+江都 9.24671730182
+量热学 12.1089181827
+悲痛欲绝 10.642581114
+狠下 13.900677652
+仁溪 12.8020653633
+聘任制 12.2912397395
+所撰 9.41204128224
+千金市骨 13.900677652
+鲜汤 11.5027823792
+铁壁铜墙 13.900677652
+峰驼 13.2075304714
+唐文 11.9547675029
+蒙卡达 13.2075304714
+多体问题 11.9547675029
+失仪 11.2616203224
+唐斌 10.7226238216
+乌焦 12.8020653633
+殊礼 12.8020653633
+梭标 12.1089181827
+现金 6.76419444339
+几万米 11.3357282945
+东闪西 13.900677652
+黄芽菜 13.900677652
+副台长 12.5143832909
+别逃 13.2075304714
+月亮山 12.8020653633
+扑来 9.7898037878
+慧眼独具 13.900677652
+爵床 13.2075304714
+缝里 9.25628675283
+失事 9.61021821083
+免签 13.2075304714
+滴汞电极 12.1089181827
+现量 13.2075304714
+失于 9.7898037878
+握手言和 11.7034530746
+充公 10.9049453784
+管弦乐团 10.9562386728
+写作水平 13.900677652
+靠边站 10.765183436
+孜孜追求 12.5143832909
+阿帕契 13.2075304714
+五六碗 12.5143832909
+主星 10.8561552143
+练武 10.1630080337
+传为佳话 11.5027823792
+民生主义 10.5684731418
+伍尔 12.8020653633
+免疫学家 11.8212361103
+西翥灵 13.900677652
+至亲骨肉 12.5143832909
+澄碧 11.1280889297
+系泊 11.8212361103
+阿帕奇 11.0103058941
+日益频繁 10.7226238216
+失体 12.8020653633
+锦带 11.9547675029
+同胞们 10.7226238216
+南昌起义 9.37888907493
+细毛 10.9049453784
+设立登记 11.598092559
+半自动化 12.2912397395
+窈窕 10.533381822
+无言可对 11.9547675029
+富达 10.2117981979
+凭空出现 13.2075304714
+木材干馏 13.900677652
+写实 8.79473217808
+煤矿安全 10.4666904475
+张恨水 11.7034530746
+这桩 9.31571017331
+注意障碍 12.8020653633
+手术床 13.900677652
+廷布 11.9547675029
+其他人 7.82533162089
+河鱼 11.9547675029
+工资 6.38696840414
+这档 12.5143832909
+国民党 6.49154120806
+莫埃利 13.900677652
+逸文 12.5143832909
+硼镁石 12.8020653633
+抽抽搭搭 11.7034530746
+桔子水 13.2075304714
+毕绍普 13.900677652
+惜乎 13.2075304714
+斗私批修 11.5027823792
+叶素 12.1089181827
+热补 13.900677652
+这栋 10.0720362555
+曼德拉 10.8561552143
+工质 10.4349417492
+巴拿马 9.03314320152
+绘制图 13.900677652
+阿拉比 12.1089181827
+保健员 12.8020653633
+着眼点 10.1630080337
+美国电话电报公司 10.8561552143
+第八回 11.598092559
+西魏恭 11.8212361103
+四极管 12.2912397395
+珍视 10.533381822
+伊斯梅 13.900677652
+白吕纳 12.2912397395
+买者 8.59240995457
+英迈 12.5143832909
+经得起 9.6811699468
+胡敬德 12.2912397395
+赤山 11.1926274509
+实根 12.1089181827
+潘杨 12.5143832909
+这株 10.0940151622
+邮轮 11.1280889297
+视点 9.94943393339
+乡巴佬 10.642581114
+主枝 11.8212361103
+惜命 11.8212361103
+这根 9.40086798165
+失传 8.63281949291
+温夏热 12.2912397395
+于嘉瑞 13.900677652
+洪朝生 13.2075304714
+骨节 10.4994802703
+新闻系 11.0674643079
+海蓝 12.2912397395
+农友 13.900677652
+这样 3.83180278769
+乐升平 12.5143832909
+赤岭 11.9547675029
+丹成 12.2912397395
+园林建筑 10.765183436
+主板 6.54312145107
+吃快餐 13.2075304714
+目下 9.43476953332
+顾杲 8.48903160012
+庆安 12.2912397395
+琴调 13.900677652
+辛可尼 13.900677652
+叮叮 10.4666904475
+海萍 11.5027823792
+参考性 13.2075304714
+谢世 10.604840786
+琴谱 11.0674643079
+主权 7.45973111134
+充值 10.4666904475
+残虐 12.8020653633
+不甚了解 11.4157710022
+基站 11.3357282945
+垂足 13.2075304714
+数学题 11.0103058941
+这棵 9.30555780184
+失修 10.765183436
+争功 10.6818018271
+争办 12.5143832909
+逸散 12.2912397395
+海葬 12.1089181827
+被监管人 13.2075304714
+晓以利害 12.8020653633
+蒙巴萨 11.1926274509
+面如桃花 12.1089181827
+海葵 10.8096351986
+保健品 9.38981814546
+芳香化湿 11.7034530746
+赤膊 10.8096351986
+孔明尚 12.5143832909
+参与率 11.5027823792
+写字 8.62767809341
+乾娘 10.533381822
+光明磊落 9.91169360541
+儿化 12.8020653633
+国民军 9.66657114738
+显要人物 12.2912397395
+鲜活 9.49395840471
+庆寿 11.7034530746
+增加额 10.1630080337
+也就是说 6.7054903318
+有妇之夫 11.3357282945
+查无实据 11.7034530746
+周桂笙 13.2075304714
+老街坊 13.900677652
+稳中有降 11.8212361103
+泻肚 13.900677652
+荧光屏 9.80633308975
+未加工 13.2075304714
+姜妙香 13.2075304714
+撒痴撒娇 13.900677652
+椎间隙 12.8020653633
+那玉凤 13.2075304714
+鲁语 12.8020653633
+欧几 12.5143832909
+一发不可收 12.8020653633
+田原 12.8020653633
+无主儿 13.2075304714
+北极星 9.58318953844
+松嫩 11.598092559
+导波 13.2075304714
+戈氏 13.900677652
+跌穿 9.58318953844
+红外光 10.6818018271
+基数 7.6701962044
+直心 13.2075304714
+那玉函 13.2075304714
+醛甾酮 13.2075304714
+解邺郡 13.2075304714
+克利特 13.2075304714
+徐相国 12.5143832909
+细瓷 10.7226238216
+朱信泉 11.1926274509
+李云龙 11.5027823792
+榆钱儿 12.5143832909
+田县 13.900677652
+舱面 13.900677652
+博湖县 13.900677652
+直快 13.900677652
+上廉 13.2075304714
+侯爵夫人 13.2075304714
+陈妙常 13.2075304714
+藕粉 10.765183436
+中国进出口银行 9.87532596124
+回顾过去 11.4157710022
+离石区 12.8020653633
+养不起 11.2616203224
+田叔 12.8020653633
+广州 5.95618548804
+货币流通 9.09665660724
+探险 8.85082164473
+英利 11.0674643079
+乏汽 13.900677652
+弗兰克 9.82314020807
+南柯一梦 10.9562386728
+郡主 10.2117981979
+化粪池 12.2912397395
+逆戟鲸 13.900677652
+直往 9.46986085313
+目中 10.4041700905
+鲜状 12.8020653633
+跨进 9.01032852375
+迁延日月 12.8020653633
+冰雪消融 11.7034530746
+好心人 10.2897597393
+端端正正 10.3171587135
+高屏溪 11.2616203224
+爬满 12.5143832909
+老愚公 12.8020653633
+两千四百 12.1089181827
+孔明尽 13.2075304714
+阿拉瓦 10.8561552143
+宝光国 11.9547675029
+跨过 8.79473217808
+凝血 9.96885201925
+复制到 11.9547675029
+爽直 11.4157710022
+大放异彩 10.4994802703
+十七章 12.8020653633
+琉璃厂 10.1164880181
+线绳 11.1280889297
+尊重人权 12.8020653633
+送给 7.26210986281
+单叶型 12.8020653633
+扬府队 13.2075304714
+环氧化物 12.2912397395
+县法院 11.1280889297
+海鬼 11.7034530746
+过家家 11.5027823792
+骨密度 11.1926274509
+警民 12.8020653633
+诸妙欲 13.900677652
+鳟鱼 11.8212361103
+莫法特 13.900677652
+戈河 13.900677652
+淋透 12.8020653633
+秋后 9.75754292558
+陈希同 12.5143832909
+满嘴胡话 13.2075304714
+弗兰兹 12.5143832909
+交通站 11.8212361103
+离石县 11.2616203224
+狗崽子 11.598092559
+贾廷安 13.900677652
+细琐 13.900677652
+政出多门 13.900677652
+基斯 11.598092559
+叶护 11.8212361103
+斯巴达克斯 13.2075304714
+田单 11.3357282945
+宇文粹 13.2075304714
+异邦 11.7034530746
+充作 10.0505300503
+僭越 10.5684731418
+兜里 9.53122979951
+从军行 12.1089181827
+直开 12.5143832909
+史禄 13.2075304714
+导气 10.0940151622
+海魂 12.5143832909
+清甜 11.598092559
+于灵谷 13.2075304714
+鲜爽 11.9547675029
+眉宇之间 11.4157710022
+乔尔贝亚 13.900677652
+震颤 9.13850371718
+基料 12.2912397395
+虹鳟 11.7034530746
+斯塔西 13.900677652
+旅游局长 13.900677652
+煎迫 13.2075304714
+想说出 11.598092559
+如律令 13.2075304714
+低头哈腰 13.2075304714
+金属外壳 11.5027823792
+松寿 13.2075304714
+小老虎 11.9547675029
+一夜风流 12.1089181827
+陈福今 13.900677652
+历史教训 10.4994802703
+冤雠 11.598092559
+人极 11.598092559
+搅拌站 10.8561552143
+唯物史观 10.0294766411
+海瑞斯 13.900677652
+第一二零回 13.2075304714
+主科 13.900677652
+欢乐颂 12.5143832909
+蒙新湖 12.5143832909
+霍曼斯 12.2912397395
+经典影视 13.900677652
+轴对称 11.1926274509
+那本书 10.3171587135
+甲申岁 13.900677652
+线网 11.1926274509
+兵甲 10.8561552143
+电杆 11.1280889297
+拉茨 12.2912397395
+西军诸 13.2075304714
+杜卡斯 12.5143832909
+耶尔 11.1280889297
+目录卡片 12.8020653633
+寄存处 13.2075304714
+平复起来 13.900677652
+凡要 13.2075304714
+人间仙境 12.2912397395
+筹备组 12.1089181827
+松宽 11.1926274509
+显山露水 11.0103058941
+大花脸 11.8212361103
+乌溪 11.2616203224
+苏萨宁 11.9547675029
+削除 13.2075304714
+陷于绝境 11.9547675029
+潘神 12.5143832909
+袁晁擒 13.2075304714
+叶挺 9.54396882529
+故意伤害 11.1280889297
+快活地 9.6811699468
+英里 9.4233408375
+北极村 13.900677652
+花键孔 12.8020653633
+河船 12.2912397395
+石非石 13.900677652
+张舜民 12.8020653633
+母牛生 12.8020653633
+线缕 12.8020653633
+手提电脑 12.8020653633
+理论物理 10.4994802703
+家有恩 13.900677652
+折叠门 13.900677652
+沙场老将 13.2075304714
+充任 8.95903522937
+兵略 10.9562386728
+线缆 11.9547675029
+谭政 12.2912397395
+昌教贡 13.2075304714
+罗埃岑 13.2075304714
+不作数 12.8020653633
+姚公渡 12.8020653633
+爱情诗 11.2616203224
+练球 11.5027823792
+科克郡 13.2075304714
+裴桐 13.2075304714
+第五回 11.7034530746
+罗贯中 11.3357282945
+实益 12.1089181827
+维萨克 12.8020653633
+残页 11.5027823792
+从影 10.765183436
+擦身 11.598092559
+克里蒙 12.2912397395
+主祭 10.765183436
+戈涅 11.9547675029
+实相 10.8561552143
+移植性 13.900677652
+北京地铁 11.598092559
+银箔 13.2075304714
+连日连夜 13.2075304714
+松子 10.3171587135
+振武 11.0103058941
+取回来 11.3357282945
+定向吸附 13.900677652
+文忠公 11.8212361103
+拉莫 12.1089181827
+唐突 10.3743171274
+小霸王 11.0674643079
+现身 8.33233314821
+两三样 12.8020653633
+委以 10.1630080337
+鹭序 13.900677652
+练琴 12.5143832909
+布偶戏 13.900677652
+狸猫 11.8212361103
+谭文 13.900677652
+兵痞 11.0103058941
+凹面镜 11.1926274509
+赞普 10.3453295905
+鼠窃狗偷 12.8020653633
+海马 8.73589167805
+等奖 13.2075304714
+海驴 13.900677652
+蚁蚕 12.2912397395
+怀柔政策 11.8212361103
+花颜 13.900677652
+江达 12.8020653633
+憨态 13.2075304714
+江边 8.81308131674
+拉菲 12.5143832909
+大浪淘沙 11.5027823792
+波兰政府 11.598092559
+噜嗦 13.2075304714
+缘分已尽 13.900677652
+室如悬罄 13.2075304714
+成鸟羽 13.2075304714
+几门 11.0674643079
+老井 11.8212361103
+原石榴 13.900677652
+郭某 11.0674643079
+细盐 12.8020653633
+执刑 12.2912397395
+动脉弓 13.900677652
+江豚 11.3357282945
+孙为民 11.5027823792
+云英岩 11.8212361103
+情绪稳定 10.9562386728
+左撇子 10.765183436
+时和年丰 13.900677652
+狠劲 10.2371160058
+基板 10.9049453784
+喷泉 9.62401153296
+联络兵 13.900677652
+一个多亿 11.9547675029
+捧杯 12.2912397395
+刘晔谏 13.2075304714
+雄图 12.2912397395
+含着泪 9.66657114738
+崇山峻岭 9.74179456862
+仁爱 10.2117981979
+三四十名 12.1089181827
+现货 7.07521761572
+捧杀 13.900677652
+遣归 11.8212361103
+基材 11.8212361103
+邓天君 13.2075304714
+细目 11.5027823792
+飞梭 11.7034530746
+基本 4.8011571151
+指导思想 8.66956903512
+酸辣汤 11.8212361103
+叶性 13.2075304714
+跨跳 13.900677652
+蝴蝶花 11.7034530746
+洗洗涮涮 12.8020653633
+己见 11.2616203224
+跌破 7.19871728597
+碱厂 10.9049453784
+植入体 13.900677652
+失分 12.2912397395
+电动力学 9.80633308975
+牡牛 11.8212361103
+纵横开阖 13.900677652
+闻悉 13.900677652
+支持者 9.04864738806
+巫咸 12.5143832909
+乌涂 13.900677652
+交会处 9.85762638414
+导源 13.900677652
+跨距 10.9049453784
+俏江南 13.900677652
+三十六着 13.900677652
+实用 7.6165434909
+鲁老爷 13.2075304714
+基期 10.3453295905
+摆摆手 8.88339781516
+涂布机 13.900677652
+孙玉亭 8.30596627237
+失利 8.32472854883
+跨跃 13.2075304714
+兜鍪 10.9049453784
+弗兰卡 13.900677652
+细皮 11.8212361103
+微电极 11.4157710022
+中国石油化工集团公司 10.0505300503
+香豆素 11.4157710022
+七十多万 12.2912397395
+周宗建 12.5143832909
+一身是胆 12.8020653633
+双特生 11.3357282945
+这病 9.55687223012
+兜着走 11.8212361103
+乌海 11.5027823792
+狠到 13.900677652
+展拓 11.2616203224
+稳坐钓鱼台 12.1089181827
+均输法 12.2912397395
+狠刹 12.1089181827
+实症 12.8020653633
+静物 10.8561552143
+检查人员 10.8096351986
+未竟之业 12.8020653633
+七十多个 12.8020653633
+王渡江 13.2075304714
+耶律 10.6818018271
+德国议会 12.5143832909
+细白 11.598092559
+易守难 10.604840786
+老亲 11.3357282945
+乌浒 11.9547675029
+杜阿雷 12.8020653633
+丁川 13.900677652
+干部子女 13.2075304714
+不致于 10.4666904475
+红毛城 12.2912397395
+抑制型 13.2075304714
+科研型 13.2075304714
+五公里 12.5143832909
+人物图片 13.900677652
+微电机 12.1089181827
+代表者 11.1926274509
+碱化 11.1280889297
+馔具 13.900677652
+价值体系 10.4041700905
+主稿 13.900677652
+跨起 13.900677652
+导游 9.94943393339
+实体店 10.7226238216
+震骇 11.598092559
+新巴尔虎右旗 12.8020653633
+汽摩配 13.900677652
+亦复如是 13.2075304714
+出货量 10.4994802703
+西岳华山 11.4157710022
+基架 13.900677652
+经名儿 12.8020653633
+陈三立 11.8212361103
+乳饼 12.8020653633
+私仇 11.0103058941
+基极 13.900677652
+失势 10.4994802703
+电三轮 13.900677652
+叮人 11.8212361103
+半日分 13.900677652
+几号楼 13.900677652
+细瘦 11.1926274509
+医药保健 13.900677652
+割席 13.900677652
+基林 13.2075304714
+缟衣 13.2075304714
+消去法 12.8020653633
+鸡犬相闻 12.8020653633
+基普 11.9547675029
+失单 12.1089181827
+哗笑 12.5143832909
+剑齿象 11.0103058941
+如梦令 12.8020653633
+照顾 7.13333452671
+普朗雄 12.5143832909
+人心丧尽 13.2075304714
+纸制品 11.0674643079
+泗州 10.7226238216
+从军记 13.2075304714
+阿太卢 13.900677652
+失却 10.2117981979
+红晕 9.40086798165
+芟夷 13.900677652
+工程处 11.4157710022
+乌法 11.7034530746
+武川活 13.900677652
+而成 6.36165059615
+一语成谶 13.900677652
+田邦 13.2075304714
+黑水峪 12.8020653633
+多万平方米 10.765183436
+割得 12.2912397395
+线材厂 13.2075304714
+慕蠡洞 11.9547675029
+通话记录 13.2075304714
+有教无类 12.2912397395
+大转折 11.5027823792
+假面具 11.598092559
+主管 7.19015454252
+拉腊 13.900677652
+弄虚作假者 13.900677652
+如梦初觉 12.8020653633
+李王德 13.2075304714
+残骸 9.11318590919
+拜仁慕尼黑队 13.2075304714
+线索 7.52395070408
+一霎时 10.2897597393
+三十多万两 13.2075304714
+学科知识 11.8212361103
+匪军 13.2075304714
+衣工 13.900677652
+海风 9.66657114738
+华清池 10.5684731418
+现象 5.3048581401
+参考系 10.2630914922
+葛洛家族 13.900677652
+马纽 13.2075304714
+若迁延 13.900677652
+直属 8.51618258919
+吴象婴 13.2075304714
+享堂 11.8212361103
+匪兵 13.900677652
+人部 12.8020653633
+乌汶 13.900677652
+瓦米 12.5143832909
+谭某 13.2075304714
+决明子 11.8212361103
+松糕 11.9547675029
+巨额财产 11.598092559
+直进 11.1280889297
+游骑兵 13.2075304714
+皮重 13.900677652
+丁西林 12.2912397395
+改辙 13.900677652
+江铃 9.94943393339
+新闻性 11.9547675029
+财界 11.9547675029
+老九 10.7226238216
+凤姐姐 10.765183436
+充气式 12.5143832909
+纸上作业 13.2075304714
+失口 10.7226238216
+知易 13.900677652
+夏河 12.5143832909
+欧元 7.39638947844
+风险管理 8.55834340001
+向慧英 11.3357282945
+冥器 11.2616203224
+等子 10.8561552143
+打桩船 13.2075304714
+唐贞观 9.49395840471
+职代会 12.1089181827
+移苗 13.2075304714
+宜州华 12.8020653633
+割开 10.533381822
+摇滚音乐 13.900677652
+举目 9.72629038208
+金天会 11.9547675029
+裸露 8.25523075433
+紧凑型 9.87532596124
+直射 9.30555780184
+细看 8.42003872863
+海顺 11.3357282945
+现时代 13.2075304714
+腐朽不堪 11.9547675029
+导演 7.20611559345
+绿窗 12.1089181827
+直尺 11.3357282945
+魏玉 12.1089181827
+谈判桌上 10.7226238216
+主笔 10.1394775363
+乌氏 11.3357282945
+失去 6.09642626845
+一千五百余 12.5143832909
+李维康 13.900677652
+家贼 11.9547675029
+推动 5.25456368049
+邢姑娘 11.7034530746
+粉红噪声 13.900677652
+争产 13.900677652
+两面讨好 13.2075304714
+警械 12.1089181827
+荣誉证书 11.5027823792
+老狐狸 10.3453295905
+极少数 8.80081122415
+山地沼泽 13.900677652
+毕桂芳 13.900677652
+冥冥 11.1280889297
+三陵 12.5143832909
+耶夫 10.0720362555
+翠环 12.2912397395
+翠玲 12.5143832909
+海西期 13.2075304714
+田垄 12.2912397395
+田垅 13.900677652
+骑兵 6.70849559326
+广弘明 12.5143832909
+消极因素 11.0103058941
+直对 11.8212361103
+陷于 8.01735526349
+铁弓缘 12.8020653633
+人物性格 9.4233408375
+国际公制 13.900677652
+三陪 11.4157710022
+田垦 13.2075304714
+阅读 5.87157059736
+出现分歧 10.4666904475
+海龟 9.63799777493
+桑曲丹 12.8020653633
+杭夫人 10.4349417492
+海龙 9.41204128224
+中国红十字总会 13.900677652
+翠珠 13.900677652
+煽乱 13.2075304714
+托尔斯泰 9.74179456862
+松香 9.89334446674
+爽爽 11.9547675029
+伊斯玛 11.5027823792
+田埂 10.4994802703
+五胡乱华 11.9547675029
+快答 13.900677652
+主粮 12.2912397395
+不周到 11.9547675029
+振源 11.5027823792
+第五道 12.8020653633
+兵灾 12.5143832909
+椅披 12.8020653633
+布尔代数 12.1089181827
+细点 12.8020653633
+琴韵 12.5143832909
+琴音 11.5027823792
+叶明 13.2075304714
+宣传日 12.5143832909
+兵火 10.9049453784
+访华之旅 10.8096351986
+杨白劳 13.900677652
+被访者 11.8212361103
+警棍 11.8212361103
+联合早报 11.598092559
+叶星 13.2075304714
+中庸思想 13.900677652
+惧色 10.8096351986
+直孔 13.2075304714
+阿尔金山 9.59661255877
+方位控制 13.900677652
+海角天涯 12.2912397395
+赤脚医生 11.8212361103
+警校 12.5143832909
+前轮驱动 11.9547675029
+违法不究 13.900677652
+出洋相 11.7034530746
+避孕法 13.2075304714
+第二十七届 12.5143832909
+小莲庄 13.2075304714
+资本主义化 13.2075304714
+科技人才 10.2630914922
+河蟹 11.0674643079
+大顺钦 12.5143832909
+这班 9.33632946051
+老万 10.8561552143
+杉村俊 12.8020653633
+盖新房 11.9547675029
+特殊人群 11.9547675029
+诸子皆 13.2075304714
+呼起来 12.8020653633
+活活 8.39128931535
+司务纪 12.8020653633
+凡俗 11.4157710022
+哭叫声 11.3357282945
+库斯科省 13.900677652
+公室 11.7034530746
+谐和 11.1926274509
+言下之意 10.642581114
+脱离危险 11.598092559
+郝一标 8.97342396682
+田块 11.7034530746
+甜蜜蜜 12.1089181827
+中龄林 13.900677652
+新州 10.765183436
+牧师 8.68574189437
+爱国主义者 12.1089181827
+黄花闺女 11.5027823792
+死而复活 11.9547675029
+祖父母 10.4994802703
+邱岳峰 12.8020653633
+田均 12.8020653633
+复制器 13.2075304714
+剥夺权利 13.900677652
+第五部 10.642581114
+田坎 13.2075304714
+失和 10.604840786
+交通线 9.18217878068
+狠命 10.3171587135
+很顺 12.8020653633
+生活观念 13.2075304714
+变来变去 11.5027823792
+东施效颦 12.8020653633
+乳齿 11.3357282945
+静琬 13.2075304714
+天方夜谭 10.0294766411
+实现 4.67673027659
+血清学 10.3171587135
+朱熔基 13.2075304714
+零零乱乱 12.2912397395
+贸易部长 11.8212361103
+导标 13.900677652
+首要任务 9.25628675283
+戈森 13.900677652
+乌鞘岭 10.9049453784
+资政院 11.9547675029
+肉蒲团 12.8020653633
+提名 8.39128931535
+平衡起来 13.900677652
+很香 10.9562386728
+基恩 11.8212361103
+花样百出 11.8212361103
+商报讯 8.25523075433
+残羹剩饭 11.9547675029
+功名利禄 11.1926274509
+笼头 10.4666904475
+这片 7.67216664838
+高频率 10.4666904475
+秋决 11.598092559
+楚幽王 13.2075304714
+松快 11.4157710022
+佐尔格 13.2075304714
+银悉熔 13.900677652
+李福全 12.2912397395
+哥伦布 8.88339781516
+小黑猫 12.8020653633
+叶松 13.2075304714
+王敬武 13.2075304714
+成人礼 11.8212361103
+苏赫巴 11.598092559
+系统发育 10.7226238216
+声明 6.78185140291
+仁甫 12.8020653633
+沈思 12.5143832909
+氟碳 11.2616203224
+交通网 9.59661255877
+骨干 7.97375162601
+全口义齿 13.900677652
+锡林浩特市 12.1089181827
+骨胶原 13.900677652
+扑粉 13.2075304714
+癌基因 11.7034530746
+己身 12.2912397395
+周官礼 13.2075304714
+买马 10.6818018271
+太空科学 13.900677652
+血馒头 13.2075304714
+犯罪案件 10.533381822
+更新过程 13.900677652
+允准 11.3357282945
+基性 9.7898037878
+屈打成招 12.5143832909
+六十余万 12.1089181827
+松德 13.2075304714
+双管齐下 10.642581114
+举火 9.94943393339
+苯三酚 12.8020653633
+垂青 10.765183436
+百褶裙 11.8212361103
+烧山火 13.2075304714
+凡为 11.5027823792
+论起 11.2616203224
+乳黄 12.1089181827
+齐明帝 11.9547675029
+转个弯 12.5143832909
+放不开 11.5027823792
+形影不离 9.82314020807
+海黎 11.9547675029
+秋凉 11.0103058941
+安哥拉政府 13.900677652
+基态 10.0088573539
+牵缠 13.900677652
+基思 13.2075304714
+系着 9.72629038208
+已登记 11.8212361103
+贼秃 9.6811699468
+凡世 11.598092559
+海黛 12.8020653633
+九霄云外 10.533381822
+鲁火者 13.2075304714
+海默 12.1089181827
+尊重人才 12.5143832909
+唐纳 12.1089181827
+海鸥 9.18217878068
+庞然大物 9.74179456862
+兴盛 8.22392384971
+墨离 12.8020653633
+三阵 12.5143832909
+徐永昌 12.8020653633
+西永福 13.2075304714
+莫霸自立 13.2075304714
+工程署 13.2075304714
+称手 12.5143832909
+唐纪 12.2912397395
+由雄鸟 11.598092559
+曲线形 12.8020653633
+猎奇 11.1280889297
+秋儿 10.2630914922
+湖口 9.74179456862
+取平 13.900677652
+叶柄 9.35738286971
+文明古国 10.1630080337
+李三才 12.2912397395
+伊斯特 11.2616203224
+清香味 12.5143832909
+元皇庆 12.8020653633
+叶某 11.2616203224
+子锁 12.8020653633
+四肢无力 11.1280889297
+海鸟 10.0940151622
+青基会 12.5143832909
+能阿弥 12.8020653633
+蒸食 13.2075304714
+英镑 8.39941944143
+薛姨妈 8.66956903512
+种籽之 13.900677652
+准则 7.96578345636
+免息 10.9562386728
+靖边县 12.1089181827
+裴氏 12.8020653633
+枕芯 12.8020653633
+奈特 11.9547675029
+宣誓就职 10.7226238216
+河蚌 10.9049453784
+凡人 9.08039608637
+线管 13.2075304714
+甲硫氨酸 12.5143832909
+松弛 8.27666014579
+兵燹 10.4349417492
+斜水清 12.8020653633
+多语种 13.2075304714
+海鹏 11.9547675029
+箩筐 10.3453295905
+唐绘 12.2912397395
+很饱 12.2912397395
+别去了 11.0103058941
+凡于 12.8020653633
+温光春 13.900677652
+叶枕 13.2075304714
+副教授 8.56795885871
+有损压缩 13.2075304714
+海鹞 10.8561552143
+盐肤木 12.2912397395
+山里红 11.8212361103
+叶枝 12.8020653633
+第五重 13.900677652
+专利产品 12.5143832909
+就用到 12.8020653633
+蛇眼 12.5143832909
+第五款 12.8020653633
+波罗尼 12.1089181827
+双扩散 13.2075304714
+松峰 13.2075304714
+西园寺 12.5143832909
+创作方法 10.1630080337
+科研区 12.2912397395
+山观 13.2075304714
+大伤脑筋 13.2075304714
+芳草地 12.5143832909
+高阶微 13.2075304714
+十来天 10.2117981979
+季里特 13.900677652
+进身之阶 12.5143832909
+女王宫 13.900677652
+良有以也 13.900677652
+景海鹏 13.900677652
+叶基部 12.8020653633
+渗漏水 13.900677652
+碱基 10.604840786
+免掉 10.9562386728
+有偿转让 11.7034530746
+荆冠类 13.2075304714
+拉萨 8.60737282725
+嘴中 9.89334446674
+魏主曹 10.4349417492
+应急行动 13.2075304714
+描述 6.66289946005
+王进笑 13.2075304714
+彼得罗 11.1280889297
+买饭 10.8096351986
+老冤家 12.1089181827
+灯笼椒 12.1089181827
+而来 6.72136968247
+法炼锌 12.5143832909
+秘密武器 10.8096351986
+嚷叫 10.4994802703
+殡仪 10.8561552143
+主线 7.57811241205
+电信号 9.44633035572
+除籍 13.2075304714
+英雄 6.79735558945
+日全蚀 13.900677652
+堪布 12.2912397395
+二十二团 12.8020653633
+英雌 13.900677652
+田伯涛 11.1280889297
+松岛 11.598092559
+虫叮 13.2075304714
+上海罗氏制药有限公司 12.2912397395
+工程局 10.1871055853
+黑龙江垦区 13.900677652
+复制品 10.3743171274
+油料作物 9.49395840471
+免提 11.9547675029
+遵照 8.230796729
+安多县 12.5143832909
+广电集团 13.900677652
+拉西斯 12.2912397395
+裘马轻狂 13.900677652
+阿契劳斯 13.2075304714
+细牙 11.4157710022
+直奔 8.33615724465
+小黑点 11.3357282945
+宣抚诚 13.2075304714
+连进 12.5143832909
+贤圣 13.900677652
+品貌出众 13.900677652
+垂钓 10.604840786
+监察部 10.7226238216
+泌出 13.2075304714
+袁瑛 13.2075304714
+陈酒 13.2075304714
+非死不可 12.2912397395
+双眉紧 11.8212361103
+秋分 10.6818018271
+准其 10.604840786
+姑息养奸 11.598092559
+金利来 12.1089181827
+海德格尔 11.4157710022
+释教都 13.2075304714
+琴键 11.2616203224
+伊克巴尔 11.7034530746
+君主专制 9.27570483869
+初侵染 13.900677652
+逆温 11.8212361103
+赖斯顿 13.2075304714
+习举业 12.8020653633
+摔破 11.598092559
+义愤填胸 13.900677652
+敬慕者 12.8020653633
+含铅量 13.900677652
+总比 9.05649056552
+第八位 10.3453295905
+稿费 10.3743171274
+川楝子 12.8020653633
+碱土 11.0103058941
+四十余个 12.8020653633
+整合性 12.5143832909
+弗罗茨瓦夫 11.9547675029
+笼中之鸟 12.8020653633
+工钱 8.98069672615
+触物伤情 13.2075304714
+碱地 12.8020653633
+留下来 7.96843246453
+弗兰基 13.900677652
+过失犯罪 12.8020653633
+碱场 11.4157710022
+语言论 12.8020653633
+飞步 11.7034530746
+活泛 10.4994802703
+香料商 13.900677652
+虫卵 9.84023464143
+四十余万 11.3357282945
+怀德府 12.8020653633
+陈久仁 12.1089181827
+系由 9.48183704418
+于不忠 12.8020653633
+而是 5.15523397188
+和佩斯 13.2075304714
+松巴 11.0674643079
+情状 10.4994802703
+丁俊晖 10.604840786
+允静 12.8020653633
+氮化硅 12.8020653633
+阿霍姆 13.900677652
+而显 11.9547675029
+爱莲说 13.900677652
+等待 6.14491048187
+向紫 13.2075304714
+室内剧 13.2075304714
+江西 6.74138574718
+孙家庄 13.2075304714
+松川 13.2075304714
+火浣布 13.900677652
+骨髓 8.82550383674
+一九五一年 13.2075304714
+氮化硼 11.7034530746
+侠白 13.900677652
+海鲈 13.900677652
+基托 12.5143832909
+掀天揭地 13.900677652
+众口一词 11.1926274509
+海鲜 9.69598503258
+前呼后拥 10.0294766411
+经济基础 8.66423568915
+裹得 11.1280889297
+于平阳 12.2912397395
+骨骸 10.1871055853
+骑出 11.1926274509
+骨骼 8.05423887692
+布拉索夫 12.8020653633
+柯堂 12.5143832909
+西法兰 13.900677652
+诸子略 12.8020653633
+血小板 9.29550746599
+秋叶 11.3357282945
+割完 11.8212361103
+现行 7.5515386606
+失地 8.65893063692
+英音 13.900677652
+乌梅 10.5684731418
+人口预测 13.900677652
+捧成 13.2075304714
+王石川 12.8020653633
+系留 11.9547675029
+李云飞 13.2075304714
+第八代 11.1280889297
+允可 13.2075304714
+海鳗 11.9547675029
+小排量 9.41204128224
+亚特尔 12.5143832909
+第八份 13.900677652
+木通科 12.1089181827
+莫德尔 12.8020653633
+琼脂糖 13.2075304714
+鸟嘌呤 12.2912397395
+毕大爷 11.1280889297
+一弘清泉 13.900677652
+低能 10.4041700905
+田吓 13.900677652
+徐三哥 13.900677652
+潘美 11.598092559
+阿丰索 12.2912397395
+柳东寅 13.2075304714
+双尖牙 13.2075304714
+城市公园 11.7034530746
+等式 9.89334446674
+新来者 13.2075304714
+工间 12.8020653633
+照度计 13.2075304714
+夏佐全 13.900677652
+望虞河 11.9547675029
+吴梦玲 10.2897597393
+第八个 10.3453295905
+基拉 11.7034530746
+聚珍本 12.5143832909
+主罚 13.2075304714
+白贝罗 12.2912397395
+蒸饭 12.8020653633
+外墙板 13.900677652
+曾祖父 10.604840786
+作品简介 12.8020653633
+乌桕 9.40086798165
+乌桓 9.29550746599
+曹安民 12.8020653633
+小平面 13.900677652
+平煤集团 12.5143832909
+十亿九千二百四十六万两 13.2075304714
+屏藩 10.9562386728
+贾沃斯 13.900677652
+鲜甜 13.900677652
+戈比 12.8020653633
+吱吱嘎嘎 11.598092559
+茶色素 13.2075304714
+水浸泡 11.4157710022
+交过去 13.2075304714
+而替 13.900677652
+于嘉泰 12.8020653633
+海鱼 10.2630914922
+仲裁员 10.9049453784
+新石器 7.73106691948
+共襄盛举 13.900677652
+万余顷 12.1089181827
+上中游 10.4349417492
+所困 11.1926274509
+陆学艺 13.900677652
+说唱团 13.2075304714
+一筹莫展 9.56994431169
+垂问 11.5027823792
+二万名 12.2912397395
+输沙量 9.48183704418
+平均速度 10.604840786
+这点 7.44233936863
+叶斑 13.900677652
+抽丝剥茧 12.2912397395
+泰利必 13.2075304714
+跨行 10.6818018271
+棍棒 9.26594866375
+义愤填膺 10.0940151622
+一千两千 12.8020653633
+腔上囊 11.8212361103
+骁勇善战 10.8561552143
+乌饭树 13.2075304714
+血清型 13.2075304714
+始业 13.900677652
+棍术 12.5143832909
+持重 9.65218240993
+宜宾县 12.5143832909
+兴筑 11.5027823792
+田宁 13.900677652
+利益者 13.2075304714
+田宅 10.765183436
+黑水城 9.85762638414
+孙光宪 12.5143832909
+田宏 13.900677652
+翠羽 11.8212361103
+可歌可泣 10.8096351986
+微微克 13.2075304714
+毕沙罗 12.2912397395
+乌柏 12.2912397395
+财经 5.5516664538
+独立核算 11.4157710022
+基流 12.8020653633
+唐显庆 11.9547675029
+简谱 11.2616203224
+围场满族蒙古族自治县 13.900677652
+重要文献 10.2371160058
+奥林匹克赛 12.8020653633
+魏明帝 11.0674643079
+蝴蝶装 12.5143832909
+王章死 12.8020653633
+封淇阳 13.2075304714
+莫诺里 13.900677652
+巴拿赫 11.3357282945
+细粒 9.98865464655
+牛羊畜 13.900677652
+乌枣 13.900677652
+主点 11.8212361103
+钛酸锶 13.2075304714
+残差 11.2616203224
+兵籍 11.9547675029
+阒无一人 12.8020653633
+闻得 8.68574189437
+溘然长逝 13.900677652
+历史系 9.48183704418
+细粉 10.9562386728
+弗兰奇 13.2075304714
+主炮 9.5186510173
+文文静静 13.2075304714
+实缺 13.900677652
+民粹派 11.0103058941
+作揖 9.30555780184
+太清观 12.5143832909
+乌林 11.8212361103
+任约翰 13.2075304714
+基洛 11.1926274509
+逃光 11.1280889297
+拿来主义 13.2075304714
+倾巢出动 11.9547675029
+细粮 10.9049453784
+等候 6.76897914151
+复杂事物 12.2912397395
+弹力袜 13.2075304714
+乌来 13.2075304714
+阴损 11.0674643079
+配位作用 13.2075304714
+视束 13.2075304714
+青年歌手 13.900677652
+一股劲 11.2616203224
+残酷 7.38300637906
+老侯 9.72629038208
+不周延 13.900677652
+科曼德 13.900677652
+雍州兵 12.8020653633
+孙连仲 12.2912397395
+失声 9.28555713513
+左归丸 11.4157710022
+等值 10.0505300503
+马蒂尼 12.8020653633
+高压 7.69611988941
+七八碗 13.900677652
+稿荐 13.2075304714
+残酒 11.8212361103
+免洗 11.1280889297
+无芳草 12.1089181827
+谭泰 10.4041700905
+秋尔 11.598092559
+斑疹伤寒 11.2616203224
+唐王 9.41204128224
+终久 10.3453295905
+非甾体 11.3357282945
+接触角 13.900677652
+叙说着 12.5143832909
+卡南加 13.2075304714
+明水香 12.2912397395
+谐声 11.9547675029
+登临意 13.2075304714
+枕边 10.4994802703
+旬刊 11.4157710022
+乌木 10.1630080337
+秋山 11.7034530746
+块煤 11.9547675029
+万事开头难 11.9547675029
+孟无忧 10.9049453784
+特罗斯 11.5027823792
+买鞋 11.7034530746
+新唱片 13.900677652
+八百一十万元 13.2075304714
+十余株 13.2075304714
+阿拉米 11.4157710022
+乌有 12.2912397395
+数据报表 13.900677652
+拍卖公告 12.2912397395
+宿夜 12.8020653633
+联络官 12.1089181827
+疆场 10.1394775363
+提意见 10.3453295905
+两三棵 13.2075304714
+代表证 12.2912397395
+张聪沛 13.900677652
+警方 7.29537973103
+吸收体 13.2075304714
+残部 9.37888907493
+验光师 13.2075304714
+松叶 12.5143832909
+风入松 13.2075304714
+虎生生 13.2075304714
+叶名琛 12.8020653633
+象山港 11.8212361103
+松口 10.0720362555
+浸溢 13.900677652
+心明如镜 13.900677652
+升级成 12.5143832909
+每公斤 9.43476953332
+胡辣汤 11.1280889297
+剑齿虎 11.8212361103
+张雄 12.1089181827
+戴权 13.2075304714
+造酒 11.1926274509
+直线传播 10.9049453784
+新岛 13.2075304714
+工程化 12.5143832909
+粉妆 12.5143832909
+多知卿 13.2075304714
+聘用制 13.2075304714
+何元朗 13.2075304714
+狗胆包天 11.9547675029
+红毛尸 11.3357282945
+洞穴堆积 11.5027823792
+天不怕地 10.9049453784
+黄土地貌 11.1926274509
+求诊 11.8212361103
+流动人口 10.604840786
+翠绿 9.65218240993
+汝昌而 12.8020653633
+啃啮 13.900677652
+廖夫州 13.900677652
+外环路 12.8020653633
+王帝辛 13.2075304714
+褪黑素 13.2075304714
+文房 11.3357282945
+骨针 10.3743171274
+凝视 9.37888907493
+准度 13.900677652
+谭派 12.2912397395
+西瓜霜 12.2912397395
+基民 8.77671367257
+帮不上忙 10.9562386728
+公文袋 12.5143832909
+伏连筹 13.900677652
+导数 9.89334446674
+玉娘 7.81390292506
+临场发挥 12.1089181827
+越裔南 13.2075304714
+这组 10.3743171274
+基波 12.2912397395
+警政 12.5143832909
+免水 13.2075304714
+梭罗 11.598092559
+鉴真纪念堂 11.8212361103
+摺叠扇 13.900677652
+厥阴 10.5684731418
+惠宗图 13.2075304714
+地心引力 11.7034530746
+基泰 12.1089181827
+手劲儿 13.2075304714
+白玉琢 13.2075304714
+海运费 10.0505300503
+丧失殆尽 10.7226238216
+振捣 13.900677652
+实绩 10.8096351986
+于风陵 13.2075304714
+戈斯 11.5027823792
+晋朝封 12.8020653633
+裴恩 13.900677652
+浇注 10.8561552143
+排箫 11.598092559
+抗腐蚀 10.642581114
+国务卿 9.05649056552
+视景 13.900677652
+招聘会 9.74179456862
+包摄 13.900677652
+要快 13.900677652
+半日头 12.5143832909
+蹼趾 13.2075304714
+跪地 10.5684731418
+裹入 12.8020653633
+和洛河 12.5143832909
+寇阳羡 12.8020653633
+预购 11.1280889297
+田婆 10.9049453784
+科依桑 13.900677652
+钛酸钡 12.5143832909
+扑火 12.1089181827
+扑灭 9.12155415886
+鲜笋 12.8020653633
+辛家 11.9547675029
+振振 12.8020653633
+野战医院 11.2616203224
+参与方 11.4157710022
+拉诺 11.4157710022
+很长 7.48885938427
+田婴 13.900677652
+货币基金 9.05649056552
+戒备状态 11.8212361103
+探险者 10.0088573539
+电信展 13.900677652
+做作业 11.0103058941
+诚恳待人 13.900677652
+细索 13.2075304714
+电信局 11.5027823792
+快相 13.900677652
+晋哀帝 12.5143832909
+黄帝城 12.8020653633
+苏铁类 13.2075304714
+许崇灏 13.2075304714
+静立 10.8096351986
+乌日 12.5143832909
+邵肇复 12.5143832909
+马摇铃 13.2075304714
+失婚 12.8020653633
+交通灯 12.2912397395
+写些 10.9562386728
+一往直前 13.2075304714
+细细 8.05713323494
+二百一十 12.1089181827
+夜夜心 13.900677652
+小白猪 13.900677652
+三百 8.27305653829
+委屈求全 12.8020653633
+庆丰 10.8561552143
+叶桂 12.8020653633
+细绳 11.2616203224
+很难 6.60494257923
+一百五十二万 12.5143832909
+特号 11.8212361103
+异步电机 11.8212361103
+看不起 9.04864738806
+广德 10.1871055853
+地质队 12.2912397395
+道德感 13.900677652
+坚贞不屈 10.8561552143
+重化工业 10.3453295905
+荒草 9.15574552361
+行密子 12.8020653633
+披沥肝胆 13.900677652
+请于 10.8561552143
+马陵道 12.2912397395
+高度表 11.3357282945
+称孤道寡 12.5143832909
+乌斯 8.85082164473
+普沃斯 12.8020653633
+裸麦 12.2912397395
+等腰三角 12.1089181827
+仲裁委 12.1089181827
+无例外 11.2616203224
+坂本龙 12.8020653633
+清玩 13.900677652
+主犯 9.82314020807
+乌方 12.2912397395
+细纱 11.0674643079
+愚人节 12.2912397395
+联络处 11.1926274509
+拉伯雷 11.5027823792
+细纹 10.2117981979
+细纺 13.2075304714
+海里 7.88208443748
+氟石 11.8212361103
+熔化成 13.2075304714
+股份合作 12.1089181827
+细线 10.642581114
+拍胸脯 11.0674643079
+预防注射 13.2075304714
+异途同归 13.2075304714
+庄头子 12.1089181827
+隐患 8.14810501315
+茅瀚 11.8212361103
+庆云 11.1926274509
+写下 8.23771717184
+写上 9.96885201925
+可纺性 13.2075304714
+哑音 13.900677652
+静穆 10.9049453784
+称身 13.900677652
+巴塞罗那 9.69598503258
+一见钟情 10.1871055853
+哈依尔 12.8020653633
+云南省公安厅 13.900677652
+等分 11.1926274509
+跟随者 12.1089181827
+李学梅 13.2075304714
+写个 9.72629038208
+消防站 13.2075304714
+田头 11.598092559
+阿布拉莫维奇 12.5143832909
+等到 6.62966911369
+清慧妹 13.2075304714
+鲁西洛 13.2075304714
+修筑道路 11.5027823792
+特莱杰 12.5143832909
+裹创 12.8020653633
+静空 13.900677652
+头痛医头 11.4157710022
+西岱岛 13.2075304714
+白芒芒 13.2075304714
+江蓠 12.1089181827
+端电压 12.1089181827
+田契 11.2616203224
+主父 10.765183436
+重金礼聘 12.5143832909
+行政官员 10.0720362555
+乳酒 12.8020653633
+仁立 11.7034530746
+耐火性 12.8020653633
+镀锌 11.4157710022
+秋干 12.2912397395
+殷太白 11.5027823792
+愁肠寸断 13.900677652
+拉裂 13.900677652
+说亲道热 13.900677652
+乳酸 9.56994431169
+法兰绒 12.1089181827
+乳酶 13.2075304714
+耶城 12.1089181827
+写书 10.2371160058
+乳酪 10.3171587135
+吉林人民出版社 12.8020653633
+二百二十余 13.900677652
+迎面而来 10.2371160058
+屈原祠 12.1089181827
+计算机硬件 10.642581114
+梅开二度 12.1089181827
+华山路 10.8096351986
+简王爷 13.2075304714
+叶楠 13.2075304714
+上席 10.9049453784
+无上光荣 12.8020653633
+饲养所 13.900677652
+塞塞严 13.900677652
+导柱 13.900677652
+越念越 13.2075304714
+总务司 12.5143832909
+河街 12.8020653633
+维奥尔琴 12.5143832909
+道德性 12.8020653633
+轮起来 13.2075304714
+等压 11.7034530746
+泛滥平原 11.4157710022
+参与权 10.765183436
+寄托 8.16733637508
+年龄 6.5000570746
+多万辆 11.0674643079
+镀铝 13.2075304714
+热锅上的蚂蚁 10.4994802703
+洒药 13.900677652
+放活 11.598092559
+镀铬 9.84023464143
+骨雕 11.8212361103
+冥府 10.8561552143
+这类 6.69207731402
+直哭 10.8561552143
+镀银 11.7034530746
+戈本 13.2075304714
+失学 10.4349417492
+艾尔斯勒 12.8020653633
+虹霓 11.598092559
+乘法 9.53122979951
+坚强有力 11.598092559
+齐后主 12.2912397395
+弗兰西斯 11.4157710022
+那三春 12.8020653633
+唐僧笑 13.2075304714
+海郡 11.7034530746
+漆吴茶 13.2075304714
+练练 10.8561552143
+四百文 13.2075304714
+慕容盛 13.2075304714
+如火如荼 9.08039608637
+人面兽心 12.1089181827
+雄才大略 10.533381822
+楚庄 12.8020653633
+海部 13.900677652
+宫娘娘 10.533381822
+冷藏室 12.2912397395
+依从关系 13.2075304714
+泌尿 10.4041700905
+工程兵 9.96885201925
+荟萃 9.44633035572
+性贿赂 13.900677652
+达日县 13.2075304714
+拉西 12.5143832909
+写信 8.29487558568
+一帆风顺 9.41204128224
+一九八一年 12.1089181827
+麻工厂 12.2912397395
+松冈 12.5143832909
+注射剂 10.7226238216
+总务厅 13.900677652
+憨憨的 12.8020653633
+北极海 11.9547675029
+一百二十四年 13.2075304714
+田震 12.2912397395
+细网 12.5143832909
+黑斯廷斯 12.8020653633
+王之相 13.2075304714
+松兰 13.900677652
+导板 12.8020653633
+贼眼 12.2912397395
+频分多址 12.8020653633
+茂密 8.11378027061
+失察 11.0103058941
+鲁西永 13.2075304714
+垂首 10.8561552143
+烟袋杆儿 13.2075304714
+晕眩 10.533381822
+失密 12.8020653633
+文轻武 13.900677652
+所托 10.8561552143
+文绉绉 10.5684731418
+海逸 13.900677652
+安得鲁 13.2075304714
+直呼 11.0103058941
+江藻 13.900677652
+湖南籍 12.8020653633
+抽油泵 13.900677652
+习习 11.0674643079
+海选 11.4157710022
+活腻了 11.9547675029
+达维亚 10.604840786
+民生凋敝 12.5143832909
+子刘贤 13.2075304714
+海通 7.65263477747
+老伴 8.43261751084
+相空间 11.7034530746
+仁化县 12.2912397395
+高级会谈 13.900677652
+唐顺宗 12.1089181827
+五千米 13.900677652
+失实 10.7226238216
+本季度 10.642581114
+允当 11.3357282945
+英魂 11.5027823792
+写作 7.66626692626
+准将 10.642581114
+失守 7.99531580392
+这粒 12.1089181827
+文汇出版社 13.900677652
+夸夸其谈 10.604840786
+田塍 12.2912397395
+哪篇 13.2075304714
+割地 9.75754292558
+叶榆 12.8020653633
+抚慰金 12.2912397395
+达保土 13.900677652
+放宽政策 13.2075304714
+祷告 9.30555780184
+埃勒格 13.2075304714
+迳直 13.900677652
+和解书 13.900677652
+失宠 10.4994802703
+大器晚成 13.2075304714
+海道 10.604840786
+数据总线 11.5027823792
+曲线图 11.4157710022
+直取 9.02548032877
+原路潜 13.2075304714
+舍亲 12.1089181827
+地网 12.8020653633
+直发 10.765183436
+细磁 13.900677652
+混合面儿 13.2075304714
+照面 9.66657114738
+田径 9.91169360541
+伍仲 13.2075304714
+秦观诗 13.900677652
+波密县 11.7034530746
+乌兰查 12.8020653633
+亚历山大城 10.642581114
+盛世才 11.8212361103
+裴旺 12.1089181827
+保证书 11.598092559
+鲜绿 11.7034530746
+警悟 12.5143832909
+先知先觉 10.3453295905
+就教 12.8020653633
+阵天线 13.900677652
+上中旬 11.5027823792
+感光片 12.5143832909
+舍人 8.98802276624
+棠梨 13.900677652
+海鞘 10.9049453784
+封营平 13.2075304714
+桑坦德 11.8212361103
+贫困学生 13.900677652
+田志 12.8020653633
+叶温 13.2075304714
+第五项 11.7034530746
+急转直下 9.7898037878
+海韵 13.2075304714
+秋声 12.5143832909
+照着 8.45394028031
+斯居勒季 13.900677652
+紧急行动 11.598092559
+这笔 7.55328844232
+细碎 9.59661255877
+擦药 13.900677652
+捏住 9.80633308975
+课程设计 13.900677652
+高帽儿 13.900677652
+两全其美 10.642581114
+警惕 7.60356833204
+食口 13.2075304714
+十八斤 12.5143832909
+黑水县 13.900677652
+除此之外 7.85094419674
+刘黑闼 11.7034530746
+室内外 11.0103058941
+高级会议 11.9547675029
+僭号 11.598092559
+捏作 12.8020653633
+鲜红 8.64840422393
+枝角类 11.9547675029
+纶巾羽扇 11.7034530746
+参与性 11.2616203224
+对外友协 12.8020653633
+潘璋 10.9049453784
+发科打诨 13.900677652
+房法寿 13.900677652
+伍习 13.900677652
+收益值 11.4157710022
+龙井村 12.1089181827
+田弘 13.900677652
+河运 10.3743171274
+葫芦岛市 11.9547675029
+这篇 8.89673134603
+刘公公 13.2075304714
+江苏 6.24150628431
+张锁柱 13.2075304714
+蒙起来 11.5027823792
+镜内 12.2912397395
+克麦罗沃州 13.2075304714
+等同 8.84443184663
+人造花 12.8020653633
+直升 11.3357282945
+神经末梢 10.5684731418
+核选择 13.900677652
+海震 11.5027823792
+大明湖 11.4157710022
+这篮 13.900677652
+王之燕 13.2075304714
+岑彭 13.2075304714
+允堪 13.900677652
+冤魂 9.94943393339
+不露锋芒 13.900677652
+买定 12.8020653633
+施华洛 12.1089181827
+王事者 12.2912397395
+海霞 11.3357282945
+孙小红 12.5143832909
+赵凤昌 9.87532596124
+飓风 9.4233408375
+系绳 13.2075304714
+唐石 13.2075304714
+地质部 11.598092559
+海面 7.59622884955
+求补 13.900677652
+线状 9.65218240993
+蝴蝶谷 13.900677652
+缠绕式 13.900677652
+系综 11.3357282945
+警惕性 10.4041700905
+细砂 10.6818018271
+泪雨 12.1089181827
+江芊 13.2075304714
+史陈明 13.2075304714
+东龙 13.2075304714
+子囊壳 12.8020653633
+办公处 10.9049453784
+河边 7.92941581219
+财税 9.15574552361
+关志华 12.1089181827
+系统 4.96017943432
+豁达大度 11.3357282945
+快班 12.5143832909
+海靖 13.900677652
+香蜡 11.7034530746
+海青 11.2616203224
+光喝 13.2075304714
+田彪 11.5027823792
+四百户 13.900677652
+毛织品 10.604840786
+苏萨城 13.2075304714
+人文 8.30225569298
+官监掌 12.8020653633
+汗津津 11.2616203224
+委托书 11.1280889297
+伍修 12.2912397395
+田府 11.7034530746
+手腕子 11.4157710022
+预测者 12.8020653633
+田庄 10.0088573539
+土改运动 12.2912397395
+海难 10.0940151622
+第四十五回 12.2912397395
+一大家子 11.0674643079
+汽车玻璃 12.8020653633
+两面针 12.2912397395
+海隅 13.900677652
+百千克 13.2075304714
+亲日派 10.4994802703
+友爱 10.0940151622
+水煮鱼 12.2912397395
+并肩作战 10.6818018271
+口吐白沫 10.533381822
+割出 12.1089181827
+乌拉 9.89334446674
+可辨认 11.5027823792
+好吃懒作 13.900677652
+笔底下 13.2075304714
+主症 13.900677652
+系缆 13.2075304714
+松城 13.2075304714
+查尔包 13.900677652
+猃狁 13.900677652
+氮化物 11.2616203224
+由浅入深 11.3357282945
+抵押 7.86999239171
+郭嘉入 13.2075304714
+长江天堑 12.5143832909
+阿拉科 11.1280889297
+朝阳门外 11.1280889297
+侧卧位 11.7034530746
+织物组织 11.7034530746
+基根 13.900677652
+蠢蠢欲动 9.5186510173
+很重 8.53470163695
+鲜美 8.94485059437
+海雾 10.2371160058
+翠竹 10.1871055853
+张九郎 10.4666904475
+数学公式 11.2616203224
+免检 12.2912397395
+海雀 12.1089181827
+氟烷 13.2075304714
+世代相沿 13.2075304714
+车库里 12.8020653633
+沉水植物 11.9547675029
+匪徒 9.84023464143
+凝析油 13.2075304714
+海雕 12.5143832909
+数以十万计 13.2075304714
+虾蟆 12.2912397395
+一锅粥 10.3453295905
+泗县 11.0674643079
+翼面 10.9562386728
+松垂 12.5143832909
+秉公办事 11.7034530746
+拉车 9.69598503258
+琴鸟 11.1926274509
+拉辛 10.4666904475
+热烈奔放 12.1089181827
+扯不上 11.9547675029
+秋天 7.82763311788
+违法乱纪 10.2630914922
+朱端钧 13.900677652
+田布 12.5143832909
+甩包袱 12.2912397395
+董杜原 12.8020653633
+海阳 12.1089181827
+伍佰 13.900677652
+屏边 11.8212361103
+浩荡 10.0940151622
+铅玻璃 11.8212361103
+监宫 13.2075304714
+床上戏 13.900677652
+死寂 9.91169360541
+买客 13.2075304714
+榴散弹 13.2075304714
+雷特河 13.900677652
+这端 13.900677652
+拉达 10.604840786
+塔科马 13.2075304714
+芙蓉路 12.8020653633
+诺福克 11.0674643079
+春牛 11.9547675029
+此物 8.87679713113
+海阔 12.2912397395
+相差悬殊 10.0720362555
+唐皇 13.2075304714
+人日 12.5143832909
+正步走 11.9547675029
+沓杂 13.900677652
+苏黎世市 13.2075304714
+秋夜 10.1394775363
+拉进 10.3743171274
+欧化 10.4666904475
+拉近 10.0720362555
+拉运 11.9547675029
+兵科 10.4994802703
+兵种 8.36334338496
+海陵 10.604840786
+风味菜 12.5143832909
+委托人 10.8561552143
+起征点 11.7034530746
+环境卫生 10.604840786
+镜像 9.7898037878
+傻眼 10.5684731418
+拉过 9.94943393339
+海陆 8.78868986362
+国际田联 12.1089181827
+直刺 10.7226238216
+松土 10.7226238216
+抬出 9.59661255877
+很酷 13.2075304714
+乌戈 12.2912397395
+河身 11.3357282945
+拉迪 12.2912397395
+有两下子 11.5027823792
+贝迪埃 13.900677652
+温体仁 11.7034530746
+嵌入式应用 12.8020653633
+半日闲 13.2075304714
+刺痛感 12.5143832909
+取得胜利 9.00283785202
+戈戟 11.2616203224
+大有作为 10.9562386728
+马哈拉施特拉 12.1089181827
+蒙事 12.8020653633
+切切在心 13.2075304714
+一百件 12.5143832909
+电饭锅 11.9547675029
+张僧繇 11.5027823792
+镀金 9.59661255877
+警报 8.81308131674
+凝集反应 12.1089181827
+希伯莱语 13.2075304714
+避重就轻 11.598092559
+人生哲理 11.3357282945
+主监 12.8020653633
+窗沿 12.1089181827
+空房子 11.1280889297
+洞房 9.43476953332
+溏心 12.8020653633
+叶清拜 13.2075304714
+王梦云 13.2075304714
+两三回 12.2912397395
+斯园 13.900677652
+虫害 10.1630080337
+差强人意 10.3171587135
+死亡者 11.4157710022
+稿件 9.14708746087
+付应祯 12.8020653633
+规模宏大 9.0884932966
+买上嘱下 13.2075304714
+强则扬 13.900677652
+成武县 13.900677652
+一无所知 8.98802276624
+蛮有意思 13.900677652
+二百八十万两 12.2912397395
+一百亿 12.8020653633
+换心手术 13.900677652
+硬着陆 11.0103058941
+淫暴 13.900677652
+融解热 13.2075304714
+余裕 11.8212361103
+海门 10.1630080337
+冥寿 13.2075304714
+导报 9.77354326693
+寄存器 10.5684731418
+慢镜头 12.1089181827
+成人片 13.900677652
+上台子 12.5143832909
+海康 11.2616203224
+快照 12.8020653633
+马回营 11.9547675029
+兑付 8.99540287354
+直冲 9.23723855786
+小尔雅 12.8020653633
+短歌行 12.8020653633
+庙嘴 13.900677652
+一百二 12.8020653633
+费耀 12.5143832909
+一十五岁 13.900677652
+和喀尔 13.2075304714
+范长江 11.8212361103
+马塔乌 12.8020653633
+举箸 11.9547675029
+林业机械 11.5027823792
+相差不多 11.1280889297
+这种 3.97045080225
+模样 7.0850376619
+看不见 7.18893725692
+白蛋白 9.89334446674
+积极态度 10.9049453784
+亭台楼阁 10.2630914922
+助推器 9.98865464655
+江夏郡 11.7034530746
+家属院 9.40086798165
+大袋鼠 12.1089181827
+宜州市 12.8020653633
+人造肉 12.2912397395
+警戒 8.36334338496
+军事部 10.8096351986
+细究 11.3357282945
+讨扰 13.900677652
+值得反思 12.8020653633
+王尔德 11.1280889297
+罗诗力 12.8020653633
+顿起 11.4157710022
+宫音弦 13.900677652
+轻财好施 13.900677652
+斜成 13.900677652
+氢化物 11.1926274509
+秋娘 13.2075304714
+秋娟 12.5143832909
+捐款捐物 13.2075304714
+兵站 10.0294766411
+指纹锁 13.900677652
+功名富贵 11.0103058941
+两辈 12.5143832909
+医学教育 11.7034530746
+临颍县 11.7034530746
+诸子系 12.8020653633
+虫子 9.01032852375
+割刀 13.900677652
+乡下佬 12.2912397395
+买醉 13.2075304714
+功能主义 10.642581114
+一百两 9.98865464655
+碱式 12.1089181827
+皮鞭 9.84023464143
+遇过 12.5143832909
+意志坚强 11.7034530746
+准头 11.3357282945
+镜台 11.5027823792
+婆罗门教 10.1630080337
+西南师范大学 12.5143832909
+轻脆 13.900677652
+卡迪斯 13.2075304714
+一百丈 13.900677652
+一百下 13.900677652
+下诺夫哥罗德 12.1089181827
+脱氧胞苷 13.900677652
+王之王 11.7034530746
+失度 12.2912397395
+一百七 12.2912397395
+泵车 13.2075304714
+海涅曼 12.5143832909
+鲁豫 13.900677652
+一百万 9.69598503258
+河豚 10.3743171274
+割取 10.9049453784
+佚事 12.8020653633
+拉贝 12.1089181827
+绒面革 13.2075304714
+威斯康辛 13.2075304714
+贝尔实验室 11.4157710022
+残雪 10.7226238216
+公用设施 10.4666904475
+超能力 12.5143832909
+柴宗训 12.2912397395
+爵位 9.04086524761
+服务网络 10.0294766411
+警探 13.2075304714
+量大增 10.4666904475
+系紧 12.2912397395
+王双 11.3357282945
+主矩 13.2075304714
+造谣惑众 11.9547675029
+伫候 12.5143832909
+唐琬 13.2075304714
+排碱 13.900677652
+尼韦勒 13.900677652
+谭正 12.5143832909
+拉贾 12.5143832909
+盟员 11.1926274509
+全月 10.1871055853
+乳钵 12.8020653633
+全有 11.1926274509
+海钓 13.900677652
+参考点 11.9547675029
+拉贡 13.900677652
+张伯歧 12.8020653633
+目睁口呆 12.8020653633
+柯庆施 13.2075304714
+黑发人 12.5143832909
+秋实 12.8020653633
+负薪 13.2075304714
+车号牌 13.900677652
+巴拉诺夫 12.5143832909
+瓦脊 11.9547675029
+塔斯曼 11.3357282945
+细算 11.8212361103
+买通 10.0720362555
+接上来 10.9049453784
+吴次尾 10.9049453784
+实体化 12.5143832909
+内容空洞 12.2912397395
+例言 12.8020653633
+余平方公里 10.9049453784
+图尔库 12.1089181827
+龙门架 13.900677652
+金利源 13.2075304714
+现职 11.3357282945
+注射器 10.533381822
+狠心 8.97342396682
+瘠薄 10.2897597393
+相类 10.9049453784
+加丹加 11.598092559
+拉走 9.41204128224
+河谷 7.1083332245
+拉起 8.92394390956
+陈旧 8.90346537821
+黄善夫 12.8020653633
+这一阵子 10.2897597393
+拉赫 10.6818018271
+芦卫国 12.5143832909
+克原子 13.2075304714
+山子石 11.8212361103
+提前 6.33799640525
+残障 11.8212361103
+无情无绪 12.2912397395
+有影儿 13.900677652
+仁美 11.4157710022
+李云造 12.8020653633
+悬索桥 10.7226238216
+头数 10.0294766411
+乌恰 12.8020653633
+失忆 13.900677652
+理直气壮 9.11318590919
+蹲位 13.2075304714
+大经堂 11.8212361103
+维亚尔 12.8020653633
+一百余 10.9562386728
+闷得很 13.900677652
+孤苦无依 13.2075304714
+震音 13.2075304714
+猫跳河 11.9547675029
+粉墨 12.8020653633
+不合时宜 9.55687223012
+共患难 10.765183436
+唐璜 11.3357282945
+啃去 13.900677652
+免疫调节 11.3357282945
+昂然屹立 13.2075304714
+史陈敬 13.2075304714
+快点 8.63798746307
+贝林格 12.5143832909
+秋季 7.6604018068
+硝化 10.3743171274
+摩擦性 12.2912397395
+枞阳县 12.1089181827
+清史稿 11.4157710022
+海鑫 12.8020653633
+阿南德 12.8020653633
+房改办 12.2912397395
+萧夔 11.0103058941
+文献学 10.6818018271
+施中诚 13.900677652
+财礼 10.533381822
+近九成 11.0674643079
+责令 8.80081122415
+裴昂 13.2075304714
+刑厥夤 13.2075304714
+玻化砖 13.900677652
+田山 12.5143832909
+发病率 8.87023973058
+代天子 11.598092559
+公海自由 13.900677652
+别找我 13.2075304714
+客货运量 11.598092559
+尔夫人 11.9547675029
+冥婚 12.8020653633
+追光 13.900677652
+乌思 11.5027823792
+擦背 13.2075304714
+田屯 13.2075304714
+那玉帝 12.2912397395
+卫星城镇 10.1630080337
+即日起 9.6811699468
+六万 10.1164880181
+口哨 10.2117981979
+甲寅派 13.900677652
+六一 11.3357282945
+六七 9.94943393339
+纸鸢 12.5143832909
+淋巴因子 11.9547675029
+证婚 12.8020653633
+六三 12.1089181827
+血检 12.5143832909
+经渠 13.900677652
+缓冲地 13.900677652
+六世 9.49395840471
+后继舰 13.900677652
+应身 12.8020653633
+灯影峡 12.2912397395
+副题 12.2912397395
+总理衙门 9.69598503258
+刺到 11.598092559
+国家教委 10.9562386728
+六两 11.8212361103
+六中 12.8020653633
+点石为金 13.900677652
+叠接 13.2075304714
+刺刀 8.99540287354
+肾上 13.900677652
+六个 7.8093677699
+流通券 12.5143832909
+朱求桂 12.2912397395
+无话不说 12.2912397395
+的黎波里 10.3743171274
+六串 13.900677652
+服务器 9.41204128224
+兰桨 13.900677652
+密闭 9.48183704418
+农化系 12.8020653633
+粉白黛绿 13.2075304714
+肥壮 10.6818018271
+皮帽子 10.9049453784
+黑乌乌 11.1280889297
+一醉方休 11.9547675029
+淋巴结炎 11.8212361103
+副食 10.2897597393
+董卓西 12.8020653633
+月华 10.2371160058
+汉置汉 11.8212361103
+六九 13.2075304714
+侍儿 11.3357282945
+十字架形 13.2075304714
+阿姆赫斯 13.900677652
+进修生 13.2075304714
+六书 10.8561552143
+六乡 11.7034530746
+振奋起 13.900677652
+丈二金刚 13.900677652
+兰根 13.2075304714
+帕金森病 13.2075304714
+兰格 10.9562386728
+通政使 10.8096351986
+催泪弹 11.3357282945
+兼备 8.97342396682
+纸鹞 13.2075304714
+东游西荡 12.2912397395
+真乖 13.2075304714
+己任 9.69598503258
+卷住 10.7226238216
+桀桀 13.900677652
+全村 9.27570483869
+偷钱 12.2912397395
+核物理 9.84023464143
+阎婆告 13.2075304714
+六二 12.5143832909
+新生 7.88941047757
+惺惺惜惺惺 11.598092559
+豹纹 11.8212361103
+六五 11.4157710022
+冯保 6.66002795772
+培罗蒙 12.8020653633
+口呼 11.7034530746
+夜风 10.0720362555
+三五户 12.8020653633
+宫本 12.1089181827
+队伍素质 12.5143832909
+二甲基 10.9049453784
+贺耀宗 11.7034530746
+于西军 12.8020653633
+送命 10.1630080337
+名企 11.8212361103
+国际象棋 10.642581114
+六亩 13.2075304714
+弹性模量 10.604840786
+塔迪兰 13.2075304714
+服务团 11.598092559
+不治之症 10.1630080337
+儿童节 12.8020653633
+六亿 12.2912397395
+学术研究 9.44633035572
+纷纭杂沓 13.900677652
+六人 9.53122979951
+辱国丧师 13.900677652
+富阳市 13.900677652
+化药厂 13.900677652
+连平县 12.1089181827
+威名 9.61021821083
+独轮车 11.4157710022
+孝子贤孙 11.4157710022
+行天 13.2075304714
+口吻 8.36728816325
+下加利福尼亚 12.2912397395
+威吓 10.533381822
+孟康注 13.2075304714
+剪除 10.3743171274
+正门口 13.900677652
+苏美英 11.9547675029
+帮补 11.8212361103
+惊弓之鸟 10.3171587135
+武氏宗 12.8020653633
+吉之言 12.8020653633
+六代 11.1926274509
+下有对策 11.9547675029
+口吃 9.74179456862
+月台 10.2897597393
+六方会谈 10.604840786
+费留利 12.8020653633
+蚊叮 13.2075304714
+六件 11.5027823792
+郑勇 12.2912397395
+土荆芥 12.8020653633
+六份 12.5143832909
+卢展工 8.98802276624
+自杀者 12.1089181827
+六任 13.900677652
+违纪 9.89334446674
+蔡叔度 12.2912397395
+己丑 13.2075304714
+巴尔舍夫斯基 13.900677652
+阎王爷 10.5684731418
+木橼 12.5143832909
+上岸时 11.598092559
+汝南王 12.1089181827
+七十五岁 12.5143832909
+月刊 8.81927328699
+过敏 9.01787572939
+蒙上 8.83177344976
+相煎何急 13.900677652
+一语破的 13.2075304714
+大衣柜 12.2912397395
+致病 8.61241062128
+月分 12.8020653633
+奈瑟 11.8212361103
+决死 10.9049453784
+遽尔 11.4157710022
+拼下来 13.900677652
+扁鲨 12.8020653633
+善报 12.8020653633
+男女关系 10.2630914922
+冯习 11.598092559
+亿张 11.9547675029
+月利 13.2075304714
+伏方腊 13.2075304714
+胥持国 12.8020653633
+凑上 12.5143832909
+普利策 10.3171587135
+急诊科 11.9547675029
+算算看 12.8020653633
+打工仔 10.604840786
+夜餐 12.1089181827
+六位 10.3743171274
+课间 11.598092559
+缓冲器 11.7034530746
+泊松比 12.2912397395
+几着 13.2075304714
+晶亮 10.8561552143
+含沙射影 12.2912397395
+木樨 11.9547675029
+典型人物 10.6818018271
+子霖 10.3743171274
+郑卫 13.900677652
+木模 11.3357282945
+慈父 11.3357282945
+秤量 12.1089181827
+蒋夫人 12.8020653633
+历克谢 13.900677652
+条理 10.3743171274
+顽固不化 11.0674643079
+异性相吸 12.2912397395
+应运 11.3357282945
+文峪 13.2075304714
+特莱尼 13.900677652
+化石群 11.8212361103
+密钥 10.2117981979
+二百年 10.0940151622
+初潮 10.6818018271
+侍候 8.09554268306
+阿空加瓜山 12.5143832909
+明查暗访 11.7034530746
+朵云轩 12.5143832909
+堤内 10.533381822
+宗教徒 11.7034530746
+凉碟 13.900677652
+果林 10.9049453784
+万事达卡 11.9547675029
+加以控制 10.3453295905
+掌中 10.9049453784
+多臭 12.8020653633
+冶游 13.900677652
+善战 10.7226238216
+核发电 13.2075304714
+冯仑 12.2912397395
+镶着 9.96885201925
+黄巨星 13.2075304714
+橡树叶 11.9547675029
+致畸 10.4041700905
+备课 11.7034530746
+掌上 10.0505300503
+身价百倍 11.8212361103
+十间 13.2075304714
+黎桂桂 10.4994802703
+先行者 9.71102290995
+硬骨鱼 9.6811699468
+地貌组合 12.1089181827
+隔板 10.3171587135
+阐述 7.41299363349
+播映 11.9547675029
+哗众取宠 10.6818018271
+非晶态 10.3171587135
+天课 12.1089181827
+明实录 11.7034530746
+总鳍鱼 11.2616203224
+平桥区 12.1089181827
+应转 13.900677652
+残局 10.8561552143
+刘阮入 13.2075304714
+郭炎炎 13.900677652
+三长制 11.2616203224
+服务型 10.1630080337
+陈劭先 13.2075304714
+刺史 7.61467955747
+缓冲国 12.5143832909
+经典著作 10.0720362555
+天诛 11.8212361103
+六信 13.900677652
+拉克尔 12.5143832909
+惠阳 10.642581114
+勘正 13.900677652
+救援船只 13.900677652
+致电 8.24818847171
+口唇 10.0294766411
+汪森 13.2075304714
+刺参 11.9547675029
+一字不漏 10.9562386728
+爱尔兰队 12.8020653633
+致用 11.598092559
+牛肉干 11.8212361103
+宇宙尘 12.1089181827
+扁鱼 13.900677652
+内存容量 12.8020653633
+初民 12.8020653633
+木楼 11.8212361103
+鸡舍 13.900677652
+服务员 8.9102450652
+救人 8.84443184663
+侍卫 8.13548654919
+社稷 7.93453091285
+兼学 11.598092559
+伯蓝 12.8020653633
+公何 11.3357282945
+决策分析 11.2616203224
+人格障碍 11.7034530746
+崔琦 13.900677652
+钱明经 9.74179456862
+摇下 13.2075304714
+公余 13.900677652
+后继者 9.96885201925
+唐兴元 13.2075304714
+月儿 10.2897597393
+阿剌海 12.5143832909
+艾里逊 13.2075304714
+致盲 11.3357282945
+干死你 13.900677652
+木楔 12.1089181827
+李回 12.2912397395
+公使 8.52539924429
+同床异梦 10.642581114
+玉儿妹妹 13.2075304714
+焗油 13.900677652
+泠泠 12.1089181827
+肥嫩 11.3357282945
+木椿 13.2075304714
+儿孙满堂 12.2912397395
+卡尔洛维 13.2075304714
+槟榔 9.48183704418
+行宪 12.5143832909
+行宫 8.75318317516
+行家 9.29550746599
+哪门子 10.3743171274
+费周折 11.1280889297
+月光 7.75864024639
+越流越 12.8020653633
+反射板 13.900677652
+公伐 13.2075304714
+宗教局 13.2075304714
+天衡 13.2075304714
+杨锡金 11.2616203224
+批驳 9.62401153296
+国产品牌 11.4157710022
+公会 9.02548032877
+假扣押 12.8020653633
+萨莱诺 13.2075304714
+勇敢的人 11.2616203224
+施泰纳 11.7034530746
+即能 9.96885201925
+皓首 12.5143832909
+天街 11.598092559
+原子武器 10.8096351986
+薛禅皇帝 13.2075304714
+绚丽多姿 11.1280889297
+新币 10.7226238216
+海狸鼠 12.5143832909
+公估 12.8020653633
+木植 11.4157710022
+走好运 13.900677652
+木椁 10.0505300503
+陈锡联 12.1089181827
+黄家鼐 13.900677652
+木椅 10.4666904475
+善意 9.36807815882
+口器 9.46986085313
+木槿 11.3357282945
+人格魅力 12.2912397395
+木槽 12.2912397395
+林荫 11.0674643079
+救主 10.4994802703
+迪朗斯河 13.900677652
+答礼 9.66657114738
+专用线 10.1630080337
+费尼著 13.2075304714
+致癌 9.59661255877
+高档化 12.8020653633
+摆放 9.5186510173
+栽种 9.43476953332
+圣殿教 13.2075304714
+爱泼斯坦 12.1089181827
+仇人相见 13.900677652
+尼米兹 10.4994802703
+宣州区 12.5143832909
+班本杜 12.5143832909
+今井 12.5143832909
+矽肺病 13.2075304714
+没什么 6.83934328507
+批验 11.5027823792
+抱起 9.48183704418
+救世 10.2897597393
+勘校 13.900677652
+逃避现实 11.3357282945
+铁电体 12.1089181827
+横截面 10.604840786
+泸定桥 11.3357282945
+第谷 11.1280889297
+晶间腐蚀 13.900677652
+哈哈哈哈 9.69598503258
+自即日起 10.8561552143
+木槌 11.1926274509
+刘一儒 10.7226238216
+尿崩症 11.1280889297
+扁鼻 13.2075304714
+救上 12.5143832909
+别藻蓝素 13.900677652
+一五 11.5027823792
+上不去 10.0294766411
+脸罩 13.900677652
+石油制品 10.7226238216
+单一制 11.0674643079
+早走一步 12.8020653633
+公例 12.5143832909
+抱负 9.13850371718
+兼容 9.77354326693
+那小校 12.1089181827
+玉带桥 12.1089181827
+遭受 6.95274058336
+艾瑟尔湖 12.5143832909
+博斯特 13.900677652
+丢三落四 12.8020653633
+独家代理 12.5143832909
+取食 8.77671367257
+小美人 12.5143832909
+赵大姐 13.2075304714
+帝王宫苑 13.2075304714
+检查组 10.8561552143
+公侯 10.4349417492
+性高潮 10.533381822
+天裕 12.8020653633
+曲线运动 11.0674643079
+挑土 11.8212361103
+回来 5.08204742288
+斯洛文尼亚人 11.3357282945
+梁小民 11.7034530746
+硫代硫酸钠 11.9547675029
+天义伯 11.598092559
+奥尔登堡 12.8020653633
+木榇 12.8020653633
+木榄 12.2912397395
+乌雅束 13.2075304714
+驾驶座 10.9562386728
+茶博士 10.8096351986
+公乃 11.1280889297
+凤凰树 13.2075304714
+曲印 13.900677652
+脸红 8.30225569298
+石三鸟 11.7034530746
+杭汉正 12.8020653633
+秘鲁 8.23425096386
+木桶 10.1630080337
+箱柜 10.9562386728
+别忘了 8.63798746307
+公义 12.2912397395
+木桨 11.5027823792
+刺儿 11.4157710022
+萧墙 12.5143832909
+密集 6.76977882168
+服务商 9.62401153296
+檀岛 13.900677652
+奖罚 12.5143832909
+木桥 10.533381822
+吴之书 13.2075304714
+完整权 12.8020653633
+孙李彝 13.2075304714
+薛蟠酒 13.2075304714
+任郎官 13.2075304714
+三门 9.27570483869
+帅哥 10.9562386728
+现洋 11.7034530746
+慈禧边 13.900677652
+皇甫郦 13.2075304714
+烧猪 13.900677652
+鬼胎 12.5143832909
+抓着不放 13.900677652
+单于 9.00283785202
+亚基含 13.2075304714
+遭到 6.22096401201
+木桌 11.3357282945
+愣乎乎 12.5143832909
+条痕 10.8561552143
+致知 11.1926274509
+木框 11.598092559
+醋酸纤维 11.7034530746
+传习所 11.0674643079
+郑兴 12.5143832909
+布宜诺 10.9049453784
+受益不浅 12.2912397395
+楚雄 10.533381822
+刺入 10.1871055853
+冒死 9.61021821083
+思想觉悟 11.598092559
+陈放 12.2912397395
+隔日 10.3743171274
+集体农庄 11.1926274509
+检查署 13.900677652
+走极端 11.5027823792
+口型 13.2075304714
+专用网 13.2075304714
+急奏 11.1926274509
+陪夜 13.2075304714
+振聋发聩 11.5027823792
+古董商 12.8020653633
+木栓 11.2616203224
+机遇 7.30900391997
+开鲁 12.5143832909
+旨在 7.32281629425
+身体素质 10.4041700905
+绝口 11.4157710022
+凤凰桥 10.4349417492
+向北走 11.4157710022
+暗问 11.8212361103
+公举 11.8212361103
+急奔 10.9562386728
+郑克 13.2075304714
+公主 7.50708689803
+木栅 10.604840786
+木棺 10.8561552143
+井臼 13.2075304714
+隔音棉 12.1089181827
+十七万 11.0103058941
+一二次 12.1089181827
+初刊 12.1089181827
+黑梅萨 12.8020653633
+驾驶席 10.9562386728
+茶多酚 10.642581114
+缎带 11.1280889297
+极化电荷 11.8212361103
+吸虫 10.604840786
+公仔 13.900677652
+罗科夫 12.2912397395
+遮蔽着 12.8020653633
+生活节奏 10.604840786
+初涉 11.7034530746
+师老北 13.2075304714
+自理能力 12.1089181827
+卫生司 13.900677652
+辉锑矿 11.598092559
+军转民 13.2075304714
+卡米尔 13.900677652
+木棒 10.3171587135
+十七个 10.9562386728
+郑军 10.765183436
+萧声 12.5143832909
+遭劫 11.5027823792
+肉豆蔻 11.0103058941
+钟镇涛 13.900677652
+木棉 10.0505300503
+对硫磷 12.5143832909
+孟楼 13.2075304714
+木棍 9.30555780184
+施光耀 13.2075304714
+大姐夫 12.5143832909
+贾天祥 13.2075304714
+于盛京 12.8020653633
+乌申斯基 12.5143832909
+切断术 12.2912397395
+基平面 13.900677652
+叹息 7.43297892587
+直言无隐 11.8212361103
+木梳 10.7226238216
+扁鹊 10.642581114
+公事 8.44963919841
+暗反应 12.8020653633
+病毒基因 11.9547675029
+常太监 13.2075304714
+木梯 11.8212361103
+刺出 12.8020653633
+各庄镇 12.8020653633
+试镜头 12.5143832909
+保罗胜 12.5143832909
+公亦 12.5143832909
+公产 11.1280889297
+公交 8.36334338496
+军事家 8.86372504956
+单复数 12.5143832909
+国情教育 13.900677652
+单一化 11.3357282945
+爱美丽 13.900677652
+野生大豆 13.900677652
+短时记忆 12.8020653633
+谢事表 13.900677652
+门隙 12.5143832909
+煤铁 10.642581114
+江国成 11.4157710022
+悉尼市 11.9547675029
+择要 12.8020653633
+木梁 9.94943393339
+公人 8.63798746307
+安培力 11.8212361103
+拉克希 13.900677652
+皮尔孙 13.2075304714
+卫生员 10.2630914922
+珀尔曼 13.2075304714
+施塔斯 13.2075304714
+秤钩 11.598092559
+挑出 9.74179456862
+忽灭 13.900677652
+昏睡 9.6811699468
+不可考 11.0103058941
+出版部 11.1926274509
+伯苓 13.2075304714
+冒气 12.5143832909
+各下 13.2075304714
+夷平面 9.91169360541
+农闲 10.4349417492
+计算机行业 12.5143832909
+洛加尼斯 13.2075304714
+外语学院 11.2616203224
+真要命 12.2912397395
+田川氏 13.2075304714
+南薇滩 12.5143832909
+兄弟般 13.900677652
+恒久 10.1164880181
+顾俊 13.2075304714
+宗圣观 13.2075304714
+龙川江 10.9049453784
+杨晴川 12.5143832909
+刘蓉 12.8020653633
+莱森 12.8020653633
+月坛 12.2912397395
+松山堡 10.9049453784
+恒丰 11.2616203224
+齐襄 13.900677652
+尼洋河 12.5143832909
+水杨酸钠 13.2075304714
+甘拜下风 11.3357282945
+大事不糊涂 13.900677652
+吹上 12.5143832909
+伙同他人 11.7034530746
+音信全无 12.1089181827
+一夥人 11.4157710022
+读万卷书 12.8020653633
+江门市 10.7226238216
+共济 11.1280889297
+伯芬 13.900677652
+共浴 12.5143832909
+引人入胜 9.98865464655
+国仁王 13.2075304714
+主义哲学 11.7034530746
+汨罗 11.9547675029
+恒业 11.598092559
+怨仇 12.2912397395
+莱佛士 11.1926274509
+庞万春 12.5143832909
+防治效果 11.598092559
+废物 8.70772080109
+单性花 11.2616203224
+贾珍忙 11.8212361103
+加价率 13.900677652
+无昼无夜 13.2075304714
+扬扬得意 11.9547675029
+批亢捣虚 13.900677652
+陈仪 13.900677652
+竞得 9.59661255877
+一命之荣 13.2075304714
+小农意识 13.900677652
+兼差 12.5143832909
+搬运车 13.2075304714
+鲁麻子 12.8020653633
+沙伊卜 13.900677652
+气质类型 13.900677652
+亭桥 12.5143832909
+积粮 11.2616203224
+善本 10.3453295905
+叹服 10.2897597393
+老同事 11.2616203224
+西从 12.2912397395
+起伏 7.17564400981
+隔成 10.533381822
+常卿韩 13.2075304714
+兰波 12.5143832909
+抿子 13.900677652
+无从谈起 10.5684731418
+勤于思考 12.2912397395
+舱门 9.6811699468
+掌邦政 13.2075304714
+二百家 13.2075304714
+利津入 11.598092559
+起会 13.900677652
+积玉堆金 13.900677652
+房屋贷款 11.5027823792
+陈小二 12.5143832909
+小冰期 11.8212361103
+郑国 9.84023464143
+盛于唐 11.4157710022
+不怕没柴烧 11.4157710022
+塑形 11.3357282945
+罗三耳 11.5027823792
+冒泡 11.9547675029
+果如其言 12.2912397395
+蚕座 13.900677652
+二分点 12.8020653633
+兰河 12.2912397395
+晒晒 11.9547675029
+敢试 12.8020653633
+郑四 11.8212361103
+损害 6.89398242514
+莱格 12.8020653633
+土地出让 9.48183704418
+抡材 13.900677652
+杨五郎 13.900677652
+二百对 13.2075304714
+今云 12.8020653633
+隔扇 10.604840786
+公之于众 10.4349417492
+和慧英 10.2630914922
+中州韵 13.900677652
+安尼戈 13.2075304714
+电突触 12.8020653633
+应设 11.8212361103
+反情报 13.900677652
+焚化炉 11.8212361103
+从宽发落 13.2075304714
+应许 11.1280889297
+第十八天 13.900677652
+历史关头 12.8020653633
+反射性 10.4994802703
+应记 12.1089181827
+生态县 12.2912397395
+听清 9.46986085313
+合水 12.2912397395
+金正日 11.0103058941
+三十六斤 13.2075304714
+情理之中 8.91707103027
+结晶水 10.642581114
+出言不逊 11.4157710022
+求见 8.61241062128
+积累 6.54375940962
+空高开 8.88339781516
+天雄军 13.900677652
+行政责任 10.604840786
+子陵 12.8020653633
+起事 8.82550383674
+绿茵茵 11.9547675029
+服务卡 13.2075304714
+备车 11.3357282945
+机队 10.3743171274
+忌酒 13.2075304714
+有误 9.28555713513
+那家铁 13.900677652
+蔑儿乞 12.8020653633
+沙米索 13.900677652
+詹在延 12.5143832909
+起亚 10.3171587135
+出版量 13.2075304714
+务实精神 12.1089181827
+汉尼巴 12.8020653633
+研钵 12.8020653633
+应诺 10.1630080337
+网球赛 11.7034530746
+桥式起重 13.2075304714
+涉农 10.6818018271
+常识课 13.900677652
+高度集中 9.48183704418
+施肥机 13.2075304714
+起价 10.4666904475
+阿图岛 12.2912397395
+六十八条 13.2075304714
+宝成铁路 10.7226238216
+江忠源 13.2075304714
+应该 4.68405704204
+扁食 13.2075304714
+争论不休 9.96885201925
+缓冲剂 12.5143832909
+机降 11.7034530746
+李超士 13.900677652
+亭榭 11.5027823792
+镶玉 11.9547675029
+服务区 10.533381822
+宦官 8.03704647638
+楚郢 12.2912397395
+应译 13.900677652
+初步 6.31946782578
+宗教学 10.3743171274
+融冻泥 11.9547675029
+青森县 12.8020653633
+应诉 10.0088573539
+侍君 12.8020653633
+寿殿 13.900677652
+扬州八怪 10.9049453784
+密道 11.1280889297
+奥其尔巴特 12.5143832909
+陪伴 8.84443184663
+第三师 11.8212361103
+威克 10.533381822
+观察者 9.6811699468
+凉粉 10.1164880181
+隔振 11.9547675029
+话里带刺 13.2075304714
+混杂物 13.900677652
+恒信 12.1089181827
+牵牛织女 13.900677652
+玄德若 13.2075304714
+润滑油 8.98069672615
+切个 13.900677652
+及格线 13.900677652
+西市区 12.8020653633
+参赞 9.12999302751
+实物地租 10.7226238216
+服务台 11.0103058941
+博兴县 13.900677652
+涡轮发动 13.900677652
+江西省委 13.2075304714
+备述 10.9049453784
+急待 9.94943393339
+台北县 10.7226238216
+丰裕 11.598092559
+白广恩 11.2616203224
+进退无措 13.900677652
+三镇 10.1630080337
+大逆转 10.3171587135
+教学情况 13.900677652
+上周四 8.73019365694
+任粤督 13.900677652
+单士元 12.5143832909
+从这时起 10.6818018271
+胃窦炎 13.2075304714
+三五杯 13.2075304714
+丕显 13.900677652
+布置图 12.1089181827
+交叉步 12.8020653633
+婉约派 11.8212361103
+阿尤布 11.4157710022
+凉糕 12.8020653633
+缺斤少两 13.2075304714
+刘汉宏 12.5143832909
+高一层 12.5143832909
+西东 11.8212361103
+取名为 9.63799777493
+侥幸 8.45825994145
+国仁父 12.5143832909
+行尾 11.9547675029
+退兵之计 12.8020653633
+一下脸 11.9547675029
+全义降 12.8020653633
+高凝油 13.2075304714
+行将 9.38981814546
+郑士琦 13.2075304714
+古法之 12.5143832909
+任朝散 13.2075304714
+二百零三 12.8020653633
+第七十回 12.5143832909
+领来 10.4349417492
+天运 11.9547675029
+起义 6.33281504651
+急忙 7.06013112269
+一第四部 13.2075304714
+兽心 13.900677652
+公之于世 12.8020653633
+敢怒敢言 13.900677652
+齐对燕 13.900677652
+羊东 11.8212361103
+挑台 13.2075304714
+驾驶室 9.53122979951
+善文 11.2616203224
+和岩钉 13.2075304714
+天谴 11.8212361103
+陈留阮 13.900677652
+二百多 10.2897597393
+拉塞尔 11.598092559
+孙半仙 11.8212361103
+木浦 12.1089181827
+主题索引 12.1089181827
+宋太公 10.2630914922
+初样 13.2075304714
+反顾 12.5143832909
+二百天 13.900677652
+夜鹰 11.1926274509
+机锋 10.9049453784
+田园风光 10.9562386728
+郑君 12.8020653633
+监收 11.4157710022
+战书 10.7226238216
+地下 6.15914406269
+金眼彪 11.5027823792
+宝贝女儿 11.4157710022
+可真要 11.5027823792
+约瑟夫效应 13.900677652
+主要症状 9.89334446674
+硬盘驱动器 11.9547675029
+训导 10.1164880181
+冒渎 11.0674643079
+桌边 9.27570483869
+木浆 10.5684731418
+叙利亚 8.07173203437
+母弟爱 13.2075304714
+怕丢面子 12.8020653633
+夜鸟 11.8212361103
+东久区 13.2075304714
+晏叔原 13.2075304714
+心脏起搏器 11.2616203224
+王降汉 11.4157710022
+蔻丹 13.2075304714
+一霎眼 13.900677652
+机长 9.71102290995
+病历卡 12.5143832909
+天象 9.02548032877
+威力 7.61281909181
+究其根源 12.2912397395
+鹤立鸡群 10.6818018271
+不高不矮 13.900677652
+纸页 11.0674643079
+战个 12.8020653633
+行径 9.19114745066
+干衣机 12.2912397395
+利津县 12.8020653633
+才高八斗 11.9547675029
+叶赛宁 11.8212361103
+英国钢铁公司 12.8020653633
+损失 6.2843940904
+羊乳 12.5143832909
+行得 10.765183436
+萨彦岭 11.4157710022
+夜鸣 13.2075304714
+连为一体 10.604840786
+金石之功 13.900677652
+寿桃 11.598092559
+数百顷 12.5143832909
+黑绿色 11.3357282945
+燥热 9.72629038208
+都灵 9.93038573842
+帅先 12.8020653633
+帅克 12.1089181827
+陶范 11.9547675029
+段廉义 13.2075304714
+宦寺 12.8020653633
+信郡王 11.598092559
+冬不拉 11.7034530746
+进修班 11.3357282945
+服饰文化 11.7034530746
+亚斯纳亚 12.8020653633
+马先蒿 12.8020653633
+郑振铎 10.8096351986
+日用陶瓷 10.9562386728
+数百颗 13.900677652
+科尔多瓦省 13.900677652
+口前 10.642581114
+液体 7.17925195119
+拉奥孔 11.7034530746
+白云飞 13.2075304714
+庆生 13.2075304714
+行当 8.99540287354
+量时度力 13.2075304714
+奴斯 13.900677652
+郑和 8.6966709649
+至圣先师 11.7034530746
+战事 8.089536659
+湾区 11.9547675029
+战争 5.37929325594
+机门 13.900677652
+丰臣秀吉 10.7226238216
+团体赛 10.9562386728
+战了 11.598092559
+席卷一空 13.900677652
+丰宁县 12.2912397395
+专用章 13.2075304714
+龙枪 13.2075304714
+初检 9.5186510173
+违碍 12.5143832909
+应补 12.8020653633
+蹑手蹑足 12.8020653633
+联邦贸易委员会 13.2075304714
+狼心狗行 12.2912397395
+江西省 8.3285236198
+追亡逐北 13.2075304714
+操作法 12.5143832909
+威利 11.3357282945
+从启祥 13.2075304714
+侮慢 11.7034530746
+巴拿马运河 9.94943393339
+摧折 11.0674643079
+相片儿 12.8020653633
+检查站 11.9547675029
+后坐力 10.0294766411
+兰溪 9.84023464143
+比较丰富 10.3453295905
+歹毒 10.0294766411
+罗斯托克 11.4157710022
+穆克联邦 13.2075304714
+兼并 7.22233553732
+遨游太空 13.900677652
+马嵬驿 11.8212361103
+莱比 11.7034530746
+跑来跑去 9.98865464655
+口口 12.8020653633
+宿处 13.2075304714
+观测仪 11.9547675029
+古勒寨 13.900677652
+黄家驹 13.2075304714
+玛克辛 10.6818018271
+西书 12.8020653633
+口号 7.60356833204
+艺术风格 8.94485059437
+投映 13.900677652
+扁骨 12.2912397395
+主跑道 13.2075304714
+提出 4.71986908261
+粮棉油 12.1089181827
+和哲孟 12.8020653633
+搬回去 11.1280889297
+可延续性 13.900677652
+三五斗 12.8020653633
+肥得 11.2616203224
+挑出来 10.9562386728
+扶智 13.900677652
+兰潭 13.900677652
+行度 13.2075304714
+控制规模 13.2075304714
+威压 12.5143832909
+三五日 10.533381822
+八卦丹 13.900677652
+解毒机 13.2075304714
+星级 9.65218240993
+从西向东 10.604840786
+万三蹄 12.8020653633
+惊喜不已 12.5143832909
+狂热行为 13.2075304714
+齐武帝 12.1089181827
+钻研业务 12.8020653633
+司马炎代 12.8020653633
+之误 11.1926274509
+陈健民 13.900677652
+田心 13.2075304714
+叛离 11.4157710022
+天赐 10.1394775363
+谀词 12.8020653633
+景泰 9.85762638414
+艾斯尤特 13.900677652
+战伤 11.1926274509
+回春 11.2616203224
+备货 10.2630914922
+喳喳 11.1280889297
+天赋 8.99540287354
+单一型 12.5143832909
+歙县 9.89334446674
+凤凰池 13.2075304714
+血槽 13.2075304714
+科学时代 13.900677652
+天资 10.4666904475
+威县 11.9547675029
+谄谀取容 13.900677652
+斯特莱克 13.900677652
+天足 12.5143832909
+新兵入伍 13.900677652
+威协 13.2075304714
+清宣统 10.6818018271
+战俘 9.12999302751
+一两枚 12.8020653633
+卫生城 13.900677652
+从庆连 13.2075304714
+天趣 13.2075304714
+杨秀各 13.2075304714
+社群 11.0674643079
+羊侃 13.900677652
+冷藏柜 13.900677652
+机针 12.8020653633
+挑剔 9.40086798165
+磁选机 13.2075304714
+秦明带 13.2075304714
+整颗 13.900677652
+皮尔士 12.1089181827
+西乌 13.2075304714
+经费紧张 13.2075304714
+弧形 8.48457724977
+胡言乱道 12.5143832909
+罗得斯 11.1280889297
+玄德背 13.900677652
+舒眉展眼 13.900677652
+挑到 11.0674643079
+满石湖 12.8020653633
+易水寒 12.2912397395
+砖红壤 9.96885201925
+行帮 12.5143832909
+木河 11.9547675029
+殷丞相 12.5143832909
+挑刺 11.8212361103
+里雅语 13.2075304714
+四十万贯 12.2912397395
+宗夏位 13.2075304714
+口区 13.2075304714
+煤都 11.5027823792
+违禁 10.0940151622
+唐臣 12.2912397395
+天路 12.1089181827
+威化 11.9547675029
+成小群 12.8020653633
+精魂 12.2912397395
+香培玉琢 13.900677652
+备足 10.8561552143
+痛斥 9.77354326693
+施肥料 12.8020653633
+挖进来 13.900677652
+云南府 12.8020653633
+鬼压床 13.900677652
+北卡罗来纳州 10.6818018271
+五段 12.2912397395
+白先勇 12.5143832909
+呈贡 13.2075304714
+口北 13.2075304714
+两三根 12.5143832909
+蓦地 8.39534611604
+兼具 9.10488710638
+下载方式 13.2075304714
+共感 13.900677652
+损坏 8.30969067146
+伍丹戈 12.5143832909
+宗派主义 10.765183436
+台北市 9.6811699468
+罗科努 12.5143832909
+侍女 8.55357012126
+邱吉尔 11.5027823792
+寿春 9.59661255877
+红马甲 13.900677652
+玄德转 13.2075304714
+寿星 10.0294766411
+逼一逼 12.2912397395
+船位 11.5027823792
+周璇 12.2912397395
+艾金 12.8020653633
+急切 7.62591563073
+初显 11.2616203224
+侍奉 9.10488710638
+那管家 12.2912397395
+郑威 13.2075304714
+寿昌 11.1926274509
+内毒素 11.7034530746
+画脸 13.900677652
+船体 8.93783302172
+孔明果 13.2075304714
+埃尔朗根 12.2912397395
+产科病房 12.8020653633
+巴尔通 12.5143832909
+扶阿炳 12.8020653633
+决战 7.92686804011
+拼着 10.0720362555
+邈远 12.2912397395
+区划图 12.1089181827
+月子 9.85762638414
+天色 7.57811241205
+蚊子 8.97342396682
+西克 13.2075304714
+社火 9.69598503258
+天良 11.0103058941
+二百块 11.3357282945
+厉兑 13.2075304714
+初晴 10.9049453784
+行内 10.3743171274
+半元音 12.1089181827
+量过 13.900677652
+蠢头蠢脑 13.900677652
+低碳钢 11.4157710022
+约鲁巴 12.2912397395
+抬去 12.2912397395
+月季 9.36807815882
+人格担保 12.1089181827
+行军 7.75007488353
+训喻 13.900677652
+积灰 12.8020653633
+凝血酶原 11.598092559
+麸皮 11.2616203224
+急动 13.2075304714
+豹皮 11.2616203224
+天花 9.66657114738
+数字视频 12.5143832909
+网球肘 13.2075304714
+急务 10.4349417492
+跨进来 12.5143832909
+司始设 13.2075304714
+敬老院 11.3357282945
+夜郎 10.0940151622
+通军报 12.8020653633
+李亚鹏 11.9547675029
+斯蒂尔杰 11.9547675029
+积炭 12.1089181827
+月容 11.0103058941
+拥进去 13.2075304714
+品类繁多 11.9547675029
+巴尔都 12.5143832909
+废纸 9.66657114738
+艾酒 13.900677652
+燕国殷 12.8020653633
+兽力 13.2075304714
+卓如可 13.900677652
+善款 10.7226238216
+月宫 10.8096351986
+决择 12.5143832909
+卓有成就 11.1926274509
+古董店 12.5143832909
+洛仑兹 12.2912397395
+立曼科 13.2075304714
+宣化县 12.5143832909
+光导纤维 10.4994802703
+酪酸 12.1089181827
+糜子 10.1394775363
+十全十美 10.4666904475
+龙泉驿区 12.8020653633
+朦朦 11.5027823792
+分至点 11.3357282945
+侍妾 9.25628675283
+释言 13.2075304714
+桃山 11.1280889297
+石龙坝 13.2075304714
+王司马亮 12.8020653633
+闭上嘴 10.765183436
+木排 11.9547675029
+亿万人民 11.9547675029
+凡尔丁 13.900677652
+玄德辞 12.5143832909
+洽谈 9.29550746599
+和林北 11.8212361103
+林冲笑 13.2075304714
+王士珍 11.1926274509
+梯田 9.49395840471
+姬为 12.8020653633
+威尼 13.2075304714
+扁长 11.0103058941
+纳沙泰尔 12.2912397395
+剑桥市 13.2075304714
+量身 10.0720362555
+备荒 11.0674643079
+罗掘俱穷 13.2075304714
+蚕卵 11.9547675029
+结晶性 11.7034530746
+初期 6.39849116537
+一二百万 12.5143832909
+兽医 9.85762638414
+龟甲 9.49395840471
+排气装置 13.900677652
+寿木 12.1089181827
+卡拉韦 13.900677652
+小名儿 11.1926274509
+初月 12.8020653633
+一二百个 12.5143832909
+扩招 12.1089181827
+扁钢 12.8020653633
+隐暗 13.900677652
+释读 10.8096351986
+勘探 8.25877058104
+伊洛瓦底 13.900677652
+广东画院 13.2075304714
+樗蒲 12.8020653633
+共性 9.36807815882
+七千万两 12.8020653633
+交叉射击 13.900677652
+孢子同型 13.900677652
+纸面 10.5684731418
+一竿子 12.1089181827
+福斯式 13.900677652
+木户 13.2075304714
+慈幼院 12.2912397395
+迟则生 12.2912397395
+帅府 10.1394775363
+船主 10.8561552143
+莱文 12.8020653633
+王司马伦 12.1089181827
+任索邦 12.5143832909
+卫生处 13.900677652
+船上 7.28863661714
+华楼宫 12.8020653633
+数百面 13.900677652
+寿材 11.598092559
+天草 13.900677652
+废置 10.9562386728
+张凤翼 12.5143832909
+船东 11.4157710022
+雪绒花 13.900677652
+加锁 13.900677652
+超越前人 12.1089181827
+刺字 11.4157710022
+满体壮 13.2075304714
+莱斯 9.75754292558
+行健 13.2075304714
+疏懒 11.9547675029
+塑制 13.2075304714
+叶面积 11.598092559
+木拱 13.900677652
+负电荷 9.89334446674
+平儿恐 13.2075304714
+刺客 9.72629038208
+三五次 12.1089181827
+石牌岭 13.900677652
+郑宣 13.900677652
+科技情报 12.2912397395
+罗力正 13.2075304714
+疑神疑鬼 10.1630080337
+第七路 13.900677652
+夜里 6.96725462625
+司志 11.9547675029
+闲不住 11.0103058941
+刘阿姨 12.2912397395
+馒首 13.900677652
+一攻 12.2912397395
+王振鹏 13.2075304714
+上冲 9.19114745066
+温尼克 12.8020653633
+德宗朝 13.900677652
+达尔朗 13.2075304714
+宗纳土 13.2075304714
+防水工程 13.900677652
+代役银 12.8020653633
+朕兆 11.5027823792
+萧让 9.48183704418
+庾澄庆 13.900677652
+传种接代 11.9547675029
+疤瘌眼 12.8020653633
+冬春季 11.598092559
+结绳记事 11.5027823792
+徐公子 12.1089181827
+陈昭 10.0294766411
+帖服 12.8020653633
+俗缘 12.1089181827
+徐中玉 10.4041700905
+漠河 10.2630914922
+对天发誓 11.1926274509
+隐晦 10.2630914922
+水合物 10.4994802703
+核威胁 12.2912397395
+丁入 12.5143832909
+陈明远 13.900677652
+费一矢 12.1089181827
+磊落 10.9049453784
+批量 8.81308131674
+浇冷水 13.900677652
+齐哀公 12.8020653633
+翁独健 11.7034530746
+剪齐 13.900677652
+科达伊 12.2912397395
+初查 12.2912397395
+班集体 12.5143832909
+挑射 13.900677652
+小天地 11.1926274509
+纯洁高尚 13.2075304714
+海洋权益 12.5143832909
+直飞 10.4994802703
+无间 10.4041700905
+月夜 9.91169360541
+隔油 12.8020653633
+已作 10.2630914922
+比邻星 11.7034530746
+隔河 10.5684731418
+秦雪梅 12.5143832909
+共持 11.1280889297
+服务局 12.1089181827
+刘封引 13.2075304714
+操作性 9.89334446674
+每时 11.8212361103
+信得过 9.96885201925
+尼哈番 12.8020653633
+沿习 12.5143832909
+隔沟 13.900677652
+霍然而愈 12.8020653633
+天王老子 11.1280889297
+刘辰翁 12.5143832909
+已使 9.53122979951
+不大不小 10.1394775363
+始于 7.17444424962
+月头 12.8020653633
+红红白 12.2912397395
+一跌再跌 13.2075304714
+侍子 12.5143832909
+肥力 9.29550746599
+杭汉打 13.2075304714
+邵大箴 13.2075304714
+海岭 10.2371160058
+共振 8.60236028543
+比黛玉 13.2075304714
+修真之 12.8020653633
+马氏珠 12.5143832909
+深感不安 11.2616203224
+抵罪 11.7034530746
+中国国民党革命委员会 10.0505300503
+勘探成本 13.900677652
+信号系统 11.4157710022
+仗义执言 11.2616203224
+香园绣 13.2075304714
+内乱罪 13.2075304714
+备考 10.6818018271
+盛于宋 11.4157710022
+小邦裁 13.2075304714
+兰戈 12.5143832909
+合欢山 12.8020653633
+代管人 13.900677652
+通用公司 11.5027823792
+政改 13.2075304714
+轶事 10.4041700905
+兰房 12.5143832909
+五样 13.2075304714
+东交民巷 11.4157710022
+秘闻 10.8096351986
+蹑手蹑脚 9.61021821083
+天后宫 11.1280889297
+犬齿 9.84023464143
+黑金属 13.900677652
+一二招 13.2075304714
+朱古力 12.2912397395
+楚鼎 12.8020653633
+三五株 13.2075304714
+梦玲 11.3357282945
+兵败如山倒 11.2616203224
+隔水 10.7226238216
+眨眼睛 9.11318590919
+汝昌之 13.900677652
+口干 9.71102290995
+纸钱 9.93038573842
+封英王 12.8020653633
+兼取 10.9562386728
+东来顺 11.1280889297
+肥分 12.5143832909
+模仿性 12.5143832909
+玄德跃 13.900677652
+手拉式 13.900677652
+遭害 11.7034530746
+一二成 12.8020653633
+共推 10.6818018271
+机首 12.1089181827
+没规矩 11.0103058941
+兼及 9.69598503258
+倪文焕 12.2912397395
+争战 9.94943393339
+吓人 8.85082164473
+紫褐色 11.8212361103
+硝化细菌 13.900677652
+云消雾散 12.5143832909
+红红的 9.59661255877
+杨翰林 13.2075304714
+侍宴 11.7034530746
+莱昂 10.765183436
+牯牛 11.1280889297
+即行 9.54396882529
+唯美主义 10.6818018271
+行医 9.4233408375
+路由表 13.2075304714
+行包 13.900677652
+王命申 13.2075304714
+王乔治 11.4157710022
+市舶司 10.0940151622
+扣过来 13.2075304714
+贾珍先 12.8020653633
+挑开 10.533381822
+按键 9.35738286971
+血压过低 13.2075304714
+玉女 10.2897597393
+逢凶化吉 10.3453295905
+二百名 10.2897597393
+每支 11.0674643079
+钟叔河 13.2075304714
+脸皮 9.40086798165
+诸葛祭风 13.2075304714
+亿公顷 9.93038573842
+五花马 12.8020653633
+弹塑性 10.8561552143
+四子王旗 12.5143832909
+朱先生 8.4284069783
+超微结构 11.8212361103
+西藏农牧学院 13.2075304714
+难以使用 12.5143832909
+余怀同 12.8020653633
+郑大 10.6818018271
+极限运动 13.900677652
+刺头 12.8020653633
+即要 10.4349417492
+锂辉石 11.3357282945
+薛蟠素 13.2075304714
+凉爽 8.58255765813
+向秀 10.8561552143
+拉夫峰 13.900677652
+未知量 11.5027823792
+全长约 9.30555780184
+精心制造 13.2075304714
+吓住 9.63799777493
+霍普金斯 11.4157710022
+肥厚 9.25628675283
+卫生学 10.8561552143
+王乔洞 12.5143832909
+暮秋 12.8020653633
+鞭状天线 13.900677652
+良心发现 11.598092559
+胆小怕事 10.8096351986
+韩康子 11.8212361103
+伞投 13.900677652
+行动 5.75774164154
+瞻礼 12.8020653633
+再生稻 12.8020653633
+金素 13.900677652
+脸相 11.4157710022
+决意 8.98069672615
+铃铃 12.2912397395
+国奉贡 13.2075304714
+博德莱 13.900677652
+现从 12.2912397395
+绝景 13.900677652
+侍省发 13.2075304714
+玄德谓 12.5143832909
+邱吉彩 13.2075304714
+胀大 11.0103058941
+脸盆 9.45802639549
+产生误会 12.5143832909
+已为 8.5488195185
+口径 7.46934657004
+脸盘 10.9049453784
+帝雉 13.2075304714
+威德 10.4666904475
+按钮 9.58318953844
+新妆 12.1089181827
+新保安 13.2075304714
+塑像 8.9519177616
+奥林巴斯 12.8020653633
+英商亦 13.2075304714
+张君励 12.1089181827
+朱门酒肉臭 12.5143832909
+堆起来 11.7034530746
+海造陆 11.7034530746
+已付 11.9547675029
+煽起 11.5027823792
+省人大 10.8096351986
+张君劢 12.1089181827
+吕仙祠 13.900677652
+黑奴吁 12.1089181827
+福斯塔夫 12.2912397395
+男婚女嫁 11.7034530746
+食宿费 11.598092559
+萨里宁 12.8020653633
+急冲 13.2075304714
+左卫门 11.9547675029
+二陈汤 11.9547675029
+备至 10.9562386728
+井之制 13.900677652
+行前 10.765183436
+那站 12.5143832909
+蜩螗 11.9547675029
+已任 12.1089181827
+阿布拉 13.900677652
+埔里 11.9547675029
+关山月 11.8212361103
+善根 12.5143832909
+宦囊 12.8020653633
+网络综合 12.8020653633
+专唱 12.1089181827
+兰叶描 12.8020653633
+肉跳心惊 13.900677652
+登市 13.900677652
+置于死地 10.5684731418
+尚君长 12.5143832909
+合成纤维 9.43476953332
+不可违 11.1926274509
+隔海 10.7226238216
+龙松 12.5143832909
+口弦 12.2912397395
+地质学 8.44109213783
+三千八百 12.8020653633
+两朵花 12.8020653633
+成金丹 13.2075304714
+已于 7.34247984916
+行刺 10.3171587135
+横行霸道 11.0103058941
+恶意中伤 13.900677652
+非洲联盟 13.2075304714
+赞助人 12.5143832909
+蚕农 12.2912397395
+丁卯日 13.2075304714
+初时 9.23723855786
+明洪武 8.59737274392
+兼办 11.0674643079
+琥珀色 11.5027823792
+乔本龙 13.900677652
+前半部 10.5684731418
+群氓 11.7034530746
+初日 13.900677652
+行列 7.74581955796
+夏景海 13.2075304714
+废时 12.5143832909
+古城村 13.900677652
+行刑 8.6803218269
+初旬 11.598092559
+百强县 11.7034530746
+数百间 12.5143832909
+后花园 10.0088573539
+向辅臣 13.2075304714
+红叶题诗 13.900677652
+主宰者 11.598092559
+田晓萌 11.0674643079
+艾吉耶 13.900677652
+最大值 10.1871055853
+海峰 11.1926274509
+来启奏 11.9547675029
+初战 10.5684731418
+量计 13.900677652
+木杵 12.8020653633
+黄家酿 13.900677652
+救过来 11.9547675029
+西凉之 11.9547675029
+铁血宰相 13.2075304714
+家成业就 13.900677652
+卫生局 9.11318590919
+易之意 12.8020653633
+木条 10.4994802703
+清炖 11.8212361103
+歹意 11.3357282945
+共收 9.93038573842
+猪仔 12.2912397395
+木材 6.91688768672
+木村 12.1089181827
+维杰夫 13.900677652
+转折点 8.66423568915
+行情看跌 13.2075304714
+西语系 11.1280889297
+弗迪格 13.900677652
+热茶 9.36807815882
+远近驰名 12.1089181827
+麻四嫂 11.1280889297
+戴宗 8.2985588311
+塑型 12.8020653633
+清炒 13.2075304714
+木杆 10.1871055853
+领导权 9.34680076038
+凤凰木 12.8020653633
+木机 11.8212361103
+李福基 13.2075304714
+渠自浚 13.2075304714
+雨点小 11.1280889297
+箱梁 11.9547675029
+红军大学 11.8212361103
+放牛娃 12.2912397395
+隋性 13.900677652
+决明 12.5143832909
+木本 9.72629038208
+天宁寺 10.765183436
+兼售 12.8020653633
+共效 13.900677652
+密切配合 9.66657114738
+二十八文 13.2075304714
+淡得 12.2912397395
+阿巴丹 11.1280889297
+量词 10.8561552143
+新津县 12.5143832909
+尹维峻 12.5143832909
+环境演化 13.900677652
+丁真吾 10.765183436
+月影 10.604840786
+措美县 13.900677652
+萨里山 13.2075304714
+宗教剧 12.1089181827
+茅真君 12.5143832909
+中共湖南省委 12.5143832909
+张黎曾 13.900677652
+月形 13.2075304714
+斯坎纳 13.900677652
+二百卷 11.8212361103
+数据结构 10.642581114
+俏皮 10.2371160058
+成小球 12.5143832909
+玄德请 12.1089181827
+发贴子 13.2075304714
+诸道兵 12.8020653633
+木柱 10.2897597393
+挑好 11.9547675029
+木柴 10.0294766411
+干脆利索 11.8212361103
+损友 13.900677652
+检查点 12.8020653633
+僖宗 11.4157710022
+来来回回 10.0088573539
+国庆大典 12.1089181827
+车流 9.80633308975
+云帆 13.900677652
+木柜 12.2912397395
+一百五十里 12.2912397395
+一带而过 12.1089181827
+天蚕 12.2912397395
+讲故事 9.94943393339
+旅行社 9.17328983326
+莱恩 11.0674643079
+石龙区 13.900677652
+木柄 10.8096351986
+沙罗奔 12.1089181827
+挑头 11.1926274509
+天蛾 11.4157710022
+英文字母 10.7226238216
+单层细胞 12.2912397395
+临城县 13.900677652
+木架 10.0505300503
+攫为己有 13.900677652
+伯言 10.9049453784
+心里话 9.40086798165
+废立 10.2371160058
+苦辣酸甜 12.8020653633
+乔治敦大学 12.8020653633
+挑夫 11.4157710022
+山腰上 11.598092559
+于西州 12.2912397395
+艾锛 12.1089181827
+猩红热 11.1926274509
+共时 11.7034530746
+箱根 12.1089181827
+合浦 10.2371160058
+不能容忍 9.69598503258
+木林 11.5027823792
+初露端倪 11.8212361103
+木枕 13.900677652
+飞地 10.8096351986
+兼善 11.1280889297
+崔立 11.598092559
+新英格兰 10.2371160058
+华东理工大学 13.2075304714
+违犯 10.1164880181
+群众满意 11.0674643079
+后备军人 11.1926274509
+木构 10.0088573539
+雨花台区 13.900677652
+熟丝 12.8020653633
+一二斤 12.8020653633
+堤垸 12.1089181827
+操作机 13.900677652
+磕破 11.3357282945
+催泪剂 12.8020653633
+蚊帐 10.2371160058
+有碍于 11.8212361103
+顺水 10.0940151622
+牛仔裙 12.8020653633
+松山兵 12.1089181827
+搞的定 13.900677652
+同步电机 11.3357282945
+急地 13.2075304714
+雷德里克 13.900677652
+溢血 13.900677652
+即达 9.65218240993
+牛仔裤 9.84023464143
+夜长 11.3357282945
+蒙巴尔 13.2075304714
+刺开 13.2075304714
+聪明智慧 11.7034530746
+服从命令 10.533381822
+驳倒 10.9049453784
+释迦 10.2897597393
+恩赖特 13.900677652
+掌邦治 13.2075304714
+丁入地 10.8561552143
+东方电子 10.642581114
+饱和状态 11.0674643079
+果无 12.1089181827
+择址 12.5143832909
+挡车 11.4157710022
+安全控制 11.3357282945
+三角状 11.4157710022
+胡兆龙 13.900677652
+食品业 11.2616203224
+未获奖 13.900677652
+障目 11.5027823792
+无水芒硝 12.8020653633
+共摆 13.900677652
+郑彪 12.2912397395
+秀才造反 13.2075304714
+庄铭耀 13.2075304714
+卡米勒 12.2912397395
+急坏 10.8561552143
+明兵入 12.8020653633
+木星 9.21854642485
+同省 12.2912397395
+朱镕基 10.604840786
+刘凤浩 12.8020653633
+勘查 9.06439574502
+曲里拐弯 12.2912397395
+第二松花江 11.2616203224
+心房颤动 13.2075304714
+天蝎 11.7034530746
+木昂 12.8020653633
+富阳县 11.5027823792
+康托 12.2912397395
+中风病 13.900677652
+矿物学家 11.1280889297
+熟习 11.2616203224
+徐调孚 13.2075304714
+伴生 9.10488710638
+威奇 13.900677652
+宝叔 11.7034530746
+通货收缩 13.2075304714
+东亚区 13.2075304714
+磕碰 11.0674643079
+月底 6.37665623677
+螓首蛾眉 13.2075304714
+费时费力 11.9547675029
+外袍 12.2912397395
+初掌 11.9547675029
+分流管 13.900677652
+抱委屈 13.900677652
+夜间 7.06656891316
+海尼 13.900677652
+熟人 8.21370229564
+行呀 11.598092559
+卫生巾 11.598092559
+江西籍 11.8212361103
+应廷吉 12.8020653633
+名闻于世 13.2075304714
+发射卫星 12.5143832909
+特德 13.2075304714
+埃迪尔内 12.5143832909
+初探 10.765183436
+月度 7.98988100794
+徐达北 13.2075304714
+事隔多年 11.7034530746
+心理准备 9.77354326693
+符离 11.598092559
+井边 10.3453295905
+凉瓜 13.2075304714
+工作过度 13.900677652
+肖鸿林 8.32094782599
+聚众赌博 11.3357282945
+赤地千里 11.5027823792
+红帅贤 13.2075304714
+扶优 12.8020653633
+坍陷 12.5143832909
+雅库布 12.8020653633
+立脚 9.55687223012
+编选出 13.900677652
+模糊不清 9.71102290995
+那寺僧 12.5143832909
+大局观 12.2912397395
+口头 8.41588071849
+兰新 10.7226238216
+第二产业 10.0505300503
+宗教史 10.604840786
+整体而言 9.5186510173
+锐不可当 11.8212361103
+浅内饰 13.900677652
+夜天光 12.5143832909
+西凉侯 12.8020653633
+苏州旅游 13.900677652
+侍岑 13.2075304714
+行吟 12.5143832909
+口外 9.66657114738
+欧阳夫人 13.2075304714
+茶素 13.900677652
+容光照 13.2075304714
+山相宅 11.5027823792
+按金 12.2912397395
+败者为寇 13.900677652
+福斯塔 13.900677652
+博斯纳 13.900677652
+光谱干扰 13.900677652
+按量 13.2075304714
+莱拉 13.900677652
+夏家人 11.7034530746
+水迁移 12.2912397395
+伞柄 11.9547675029
+居伦 13.900677652
+恩德培 12.8020653633
+肥胖型 13.2075304714
+阿布杜 11.4157710022
+狼心狗肺 11.1280889297
+道众 11.598092559
+看一遍 10.3171587135
+漆园吏 13.2075304714
+旅行箱 13.900677652
+张嫂子 11.4157710022
+郑小 11.7034530746
+于应昌 11.5027823792
+刨出来 11.1280889297
+特蕾西 13.2075304714
+于宣府 12.5143832909
+自交系 12.5143832909
+二百克 13.900677652
+夜阑 12.8020653633
+帮着 8.84443184663
+报上来 12.8020653633
+荆楚网 11.5027823792
+天葵 12.1089181827
+二百元 10.8561552143
+郑屠 10.5684731418
+煤饼 12.1089181827
+国信 7.64301006409
+天葬 10.9049453784
+驾驶台 12.1089181827
+金融街 9.65218240993
+数百道 13.2075304714
+初恋 9.77354326693
+格丁尼 12.5143832909
+侍弄 11.0103058941
+铠装 13.2075304714
+界于 11.0674643079
+量规 12.5143832909
+急呀 11.5027823792
+伞架 13.2075304714
+另计 12.8020653633
+再生缘 12.5143832909
+共来 13.900677652
+司马青衫 13.900677652
+刚赶 13.2075304714
+专用版 13.900677652
+贺家兄弟 12.5143832909
+量角 13.900677652
+辛酉年 12.5143832909
+保险机构 8.96620371885
+别拉亚 13.900677652
+走单骑 12.2912397395
+居启祥 12.1089181827
+籍此 13.900677652
+牢中 10.9562386728
+交叉性 11.8212361103
+霍金斯 11.8212361103
+二十八日 10.2117981979
+又俊 13.900677652
+泡透 13.900677652
+胳膊肘 10.765183436
+扩散 7.61096208107
+安化县 10.9562386728
+捏一捏 12.2912397395
+讲话稿 11.8212361103
+克耶邦 13.2075304714
+溅落 11.9547675029
+几点 8.50705010562
+鹤岗矿务局 13.2075304714
+赔偿义务 12.5143832909
+湾子 11.598092559
+最大功 13.2075304714
+艾青 10.9562386728
+国优 12.8020653633
+施泰特 11.1280889297
+取钱 10.642581114
+青阳县 12.5143832909
+国企 7.62591563073
+左卫都 13.900677652
+回复力矩 13.900677652
+劳伯 13.2075304714
+吉羊 13.900677652
+应者 12.5143832909
+应考 10.765183436
+夜雨 10.1630080337
+精力不济 12.5143832909
+侍御 11.5027823792
+直愣愣 10.9562386728
+一点红 11.1926274509
+马埃岛 11.9547675029
+行在 9.75754292558
+乔家大院 12.8020653633
+偏振度 12.5143832909
+天蓬 11.0674643079
+取悦于 11.4157710022
+自动控制 9.13850371718
+克林顿 9.72629038208
+批零 11.5027823792
+数百部 12.5143832909
+吸尘器 10.604840786
+天蓝 10.765183436
+洗澡 8.39534611604
+孑遗 9.65218240993
+大家鼠 12.8020653633
+原被告 12.2912397395
+牧刘表 12.5143832909
+木斗 11.9547675029
+燧人氏 12.8020653633
+直抒胸臆 10.9049453784
+鸡鸣寺 12.1089181827
+连锁性 12.1089181827
+佳木斯 9.84023464143
+畜牧业 7.46452728361
+游踪 12.5143832909
+兰村 12.5143832909
+海山 10.3171587135
+服务奖 13.900677652
+抗倒伏 11.8212361103
+国人 8.08059472162
+竞合 12.5143832909
+国交 12.2912397395
+国产 7.68207753228
+国亡 10.0505300503
+韶华 11.0674643079
+一念之差 11.7034530746
+精神负担 11.2616203224
+喷口 10.9562386728
+兰杉 13.900677652
+收录机 10.642581114
+偏听则暗 13.900677652
+最大化 8.81308131674
+兰杰 13.2075304714
+魏广微 12.1089181827
+奥多亚 11.9547675029
+帅士 12.5143832909
+女患者 12.2912397395
+行囊 9.65218240993
+选举委员 13.900677652
+活检 9.77354326693
+中国长城资产管理公司 12.1089181827
+腰间盘 13.2075304714
+国二 13.2075304714
+大成拳 13.900677652
+冻住 10.604840786
+一二枚 13.2075304714
+国事 7.95003509939
+糜岩 13.2075304714
+威宁 10.765183436
+操作数 11.2616203224
+刘尔卓 13.900677652
+天后庙 13.900677652
+执法为民 12.2912397395
+可真能 11.2616203224
+颜杲攻 12.8020653633
+普遍推广 11.4157710022
+必可 10.7226238216
+蛇床子 11.1926274509
+积着 12.1089181827
+抄家 9.49395840471
+通淮右 13.2075304714
+服务处 11.598092559
+国代 13.900677652
+冻伤 10.3743171274
+松山区 13.2075304714
+新闻晨报 10.5684731418
+一双眼 10.9049453784
+靓照 13.2075304714
+民权路 13.900677652
+肥城 10.9049453784
+共晶 13.900677652
+近墨者黑 12.1089181827
+犬马 11.4157710022
+月山 13.2075304714
+银白色 9.21854642485
+制丝 11.9547675029
+堰口 13.2075304714
+三联书店 10.8096351986
+慷慨赴义 13.2075304714
+口实 10.0088573539
+扁额 13.900677652
+隐情 10.1164880181
+东门城 13.2075304714
+六盘水市 11.1280889297
+波洛奈兹 12.5143832909
+道人 8.43261751084
+生态化 11.9547675029
+赧颜 12.5143832909
+童托 13.2075304714
+崔禹 13.2075304714
+言笑自如 13.900677652
+国主 10.0294766411
+蔺仁 13.900677652
+宝古斋 12.8020653633
+国丧 11.2616203224
+隐性 8.75901409547
+宋东京 12.8020653633
+不认帐 12.5143832909
+威孚 10.9562386728
+人身自由权 13.2075304714
+肥地 12.8020653633
+武宗藩 13.2075304714
+宣州市 11.8212361103
+半壁山河 13.900677652
+喝汤 10.1394775363
+刘备乃 13.2075304714
+怡悦 11.8212361103
+福寿绵长 13.2075304714
+肥土 12.8020653633
+月岩 11.1280889297
+国一 12.8020653633
+摧毁 7.82993992397
+凉皮 13.2075304714
+索尔威 13.900677652
+等雨量线 12.5143832909
+决无 9.74179456862
+国三 12.5143832909
+叹气 8.60236028543
+口孔 11.8212361103
+方渐平 13.2075304714
+宜山路 13.2075304714
+数百里 9.84023464143
+初战告捷 11.4157710022
+量表 10.0505300503
+决斗 9.91169360541
+挡路 10.9562386728
+闹鬼 10.1394775363
+李伯江 12.8020653633
+国书 10.3743171274
+芳香醛 13.2075304714
+贾珍命 12.8020653633
+示范表演 13.2075304714
+被动性 12.1089181827
+国乐 11.4157710022
+无一不知 13.900677652
+月峰 12.8020653633
+幕后操纵 10.642581114
+刁斗森严 13.2075304714
+辽宁大学 12.5143832909
+郑州 5.54788751685
+丰水期 11.4157710022
+侍应 11.598092559
+决断 8.5440913773
+温跃层 11.9547675029
+取闹 13.900677652
+布列坦 12.5143832909
+积石 10.7226238216
+朱校长 11.598092559
+假眉三道 13.2075304714
+李琼梅 13.900677652
+阿剌罕 13.900677652
+季财报 11.598092559
+叫门声 12.8020653633
+熟化 10.765183436
+伯雅 13.900677652
+木筷 13.2075304714
+二十四万枚 13.2075304714
+起家 9.19114745066
+容受 13.2075304714
+那小童 12.8020653633
+竭尽心力 12.2912397395
+绿茵阁 13.900677652
+阮成发 12.2912397395
+汽车品牌 9.93038573842
+复仇雪耻 13.900677652
+小个 13.900677652
+措大 13.2075304714
+火宅 13.900677652
+六席 12.8020653633
+摇尾 11.8212361103
+左性子 13.900677652
+加赛一场 13.900677652
+国军 9.63799777493
+国内 4.64756518816
+西园闻 11.9547675029
+木筏 9.43476953332
+船坞 9.29550746599
+伯雷 13.2075304714
+虚情假意 11.2616203224
+正己烷 13.2075304714
+吓呆 12.5143832909
+六幅 11.7034530746
+搂搂抱抱 12.2912397395
+美太平洋舰队 13.900677652
+有天没日 13.2075304714
+宝匣 13.900677652
+木笼 11.1926274509
+积案 11.3357282945
+违章建筑 11.8212361103
+农膜 11.598092559
+消除矛盾 13.2075304714
+道具 9.30555780184
+过年节 12.1089181827
+顾家 11.0674643079
+伏着 11.7034530746
+东直 12.8020653633
+二百余 10.4994802703
+天马 9.7898037878
+呈验 12.8020653633
+冯弘 12.5143832909
+顾客 7.75220935606
+富康车 13.900677652
+一二百块 13.2075304714
+遥遥无期 10.4994802703
+周太后 13.900677652
+掌心 9.61021821083
+六幢 12.8020653633
+无铅 11.7034530746
+魏德堡 13.2075304714
+英德市 11.9547675029
+木笔 12.8020653633
+六年 6.94508504358
+道光 8.35941410682
+南腔 13.2075304714
+已售 11.7034530746
+损伤 7.43297892587
+陪嫁 9.66657114738
+道兄 12.8020653633
+晶形 10.4994802703
+目无下尘 13.2075304714
+冻僵 10.7226238216
+三叠系 10.7226238216
+先意承旨 12.2912397395
+古语云 11.9547675029
+戴孝 11.5027823792
+荡气回肠 11.1926274509
+吓哭 10.9562386728
+公州 12.8020653633
+撕破脸 11.8212361103
+全国十佳 10.7226238216
+道冥 13.2075304714
+战壕 9.75754292558
+洋水果 13.900677652
+黄心柏 13.2075304714
+六座 11.598092559
+六度 11.5027823792
+凑得 11.598092559
+入主中原 10.7226238216
+耗散力 12.2912397395
+变位 11.1926274509
+宋押司 10.7226238216
+瞻拜 11.9547675029
+初级 8.50705010562
+南至北 10.8561552143
+取名字 13.2075304714
+人文环境 11.598092559
+天骄 11.4157710022
+道出 10.765183436
+国家补贴 11.0674643079
+国共 9.20019728618
+网上交谈 13.900677652
+李续宜 12.8020653633
+卡兹文 12.8020653633
+木箱 9.55687223012
+古特兰 13.2075304714
+国典 12.5143832909
+久未联系 13.900677652
+王李贞 12.5143832909
+乌戈尔 11.0674643079
+食品厂 11.1280889297
+木箭 13.900677652
+国公 9.55687223012
+木管 11.598092559
+醴陵市 11.9547675029
+斯克利夫 13.900677652
+共称 11.9547675029
+船型 10.5684731418
+见智 10.8561552143
+诱杀 10.7226238216
+初绽 12.5143832909
+埃士顿 12.8020653633
+寿经 11.1926274509
+司马炎女 12.8020653633
+温巴尔格 13.900677652
+保健饮料 12.5143832909
+行道树 10.0720362555
+检查法 11.1280889297
+木简 10.8096351986
+夜袭 10.2371160058
+国光 10.0088573539
+美国西点军校 12.8020653633
+一九四二 13.900677652
+十七岁 9.27570483869
+共研 12.5143832909
+坚守岗位 12.2912397395
+尼努尔 13.900677652
+顾诸紫 13.2075304714
+决策 6.82317959841
+自求多福 13.900677652
+清翠 13.900677652
+隐约 8.50251495046
+猪只 13.900677652
+变体 9.85762638414
+林亭口 13.2075304714
+六弟 12.1089181827
+蔡任护 13.2075304714
+陪审 10.8561552143
+陪客 10.4666904475
+经济繁荣 9.30555780184
+丁刚 12.1089181827
+伯韫 13.2075304714
+六张 12.1089181827
+应龙 12.5143832909
+羊头 11.2616203224
+二百两 10.0294766411
+总册 12.8020653633
+混上来 13.2075304714
+陶侃卒 12.8020653633
+熟到 13.2075304714
+死生有命 12.1089181827
+公山 11.0103058941
+音讯全无 12.5143832909
+冯平 13.2075304714
+坚强不屈 12.2912397395
+上虞市 11.0674643079
+崔杼 12.8020653633
+已向 8.67493097826
+老同学 9.48183704418
+生机蓬勃 13.900677652
+冯帅 13.900677652
+再生性 11.5027823792
+战备 8.95903522937
+吓唬 8.95903522937
+男左女右 13.2075304714
+公孙渊果 12.8020653633
+齐心协力 9.98865464655
+恢复健康 10.6818018271
+界内 10.3453295905
+那种 5.97011179774
+修丁立 13.900677652
+羊奶 11.4157710022
+结晶硅 13.900677652
+天魔 12.1089181827
+小祝 13.900677652
+农肥 12.2912397395
+格什温 12.1089181827
+科尔察 12.8020653633
+公尺 10.2630914922
+十诫 11.8212361103
+已含 13.900677652
+里特尔 13.900677652
+二百二 12.8020653633
+兰科 10.3743171274
+玻利维亚政府 13.900677652
+安分守己 10.1871055853
+数百辆 11.5027823792
+夜视 9.5062284973
+不干不净 10.4994802703
+郁垒 12.2912397395
+马廷宝 12.5143832909
+网球馆 13.900677652
+二百五 11.1280889297
+矿藏量 11.5027823792
+丰城市 12.8020653633
+黄帝陵 11.2616203224
+赫特福德郡 13.2075304714
+二百亩 12.2912397395
+王志文 12.8020653633
+滞洪区 11.0103058941
+滴虫性 11.7034530746
+批覆 13.900677652
+云南省政府 12.2912397395
+杰勒德 12.5143832909
+牛肉丸 13.900677652
+疯疯颠颠 11.598092559
+冯建 11.3357282945
+三推六问 13.2075304714
+二百人 10.7226238216
+饥色 12.2912397395
+诚心诚意 10.5684731418
+局长 7.17684521115
+汉晋唐 13.900677652
+顾品珍 13.2075304714
+取证 9.59661255877
+策划人员 13.900677652
+冻冰 11.8212361103
+冒称 12.2912397395
+教学质量 10.8096351986
+扁豆 10.4994802703
+十七届 9.22784881751
+决算 10.642581114
+哈立德 12.5143832909
+相等 7.28193866846
+神采奕奕 10.5684731418
+开放日 10.5684731418
+王侧福 12.5143832909
+发布公告 7.44705265308
+损人 11.7034530746
+五花肉 11.3357282945
+崔某 11.1926274509
+辅以 8.97342396682
+有趣儿 11.9547675029
+恒安 11.1926274509
+隔着 8.230796729
+量限 11.5027823792
+打入冷宫 11.9547675029
+任育才 12.8020653633
+宫之碑 12.8020653633
+阴府 12.5143832909
+狂犬病毒 12.1089181827
+救度 12.8020653633
+集权国家 13.900677652
+纯天然 11.1926274509
+唯一无二 13.900677652
+我为人人 12.5143832909
+孔明辞 12.1089181827
+羊娃 13.2075304714
+陈梁 11.7034530746
+莱维 10.6818018271
+辨别真假 12.8020653633
+马宣赞 10.0294766411
+松山之 11.7034530746
+温柔体贴 10.9562386728
+顾委 13.2075304714
+口渴难忍 13.900677652
+井道 13.2075304714
+弘农华 11.598092559
+操作码 12.5143832909
+沈毅 13.2075304714
+犍牛 11.7034530746
+公役 13.900677652
+布加勒斯特 10.1164880181
+国号 8.08059472162
+埃斯基 13.2075304714
+六局 11.7034530746
+风干 10.4994802703
+六层 11.2616203224
+向春义 13.2075304714
+予以考虑 11.7034530746
+大协作 13.900677652
+六届 9.17328983326
+筑波 11.9547675029
+机腹 11.0103058941
+一伙 8.30969067146
+硬性规定 10.4666904475
+生云 12.2912397395
+攀登高峰 13.2075304714
+勒勒车 12.5143832909
+全罗道 12.8020653633
+道博 11.8212361103
+莱纳 11.598092559
+国发 11.0103058941
+垫江县 12.5143832909
+百十口 12.5143832909
+伯钦 11.1926274509
+人逢喜事精神爽 11.9547675029
+起始 8.39534611604
+国变 11.7034530746
+交通规则 11.4157710022
+迪利厄斯 12.8020653633
+挡道 11.9547675029
+圆锥曲线 11.5027823792
+翰林学士 9.45802639549
+国色天香 11.3357282945
+文心 12.8020653633
+养老险 11.0674643079
+跑不了 10.0294766411
+公强 13.2075304714
+复比 13.900677652
+周殊士 13.2075304714
+违法 7.11058041646
+六岁 9.63799777493
+马西雷 13.2075304714
+即逝 11.0674643079
+乾嘉学派 11.5027823792
+醍醐灌顶 11.5027823792
+国医 12.8020653633
+羔羊皮 12.2912397395
+喋血记 11.8212361103
+局限 8.35941410682
+起头 9.61021821083
+斜杠 13.2075304714
+于显宦 13.2075304714
+埃柯夫 13.2075304714
+萧干 9.44633035572
+风雨雷电 11.5027823792
+狗腿子 11.598092559
+冯巩 11.8212361103
+高三 9.56994431169
+十八座 13.900677652
+起复 10.4349417492
+校正器 12.5143832909
+参谋总长 10.2371160058
+共管 10.9049453784
+救市 8.75318317516
+图瓦卢 10.8096351986
+声色犬马 11.5027823792
+农药 8.21709788464
+木秀 12.1089181827
+起夜 11.8212361103
+抵押权人 12.5143832909
+本田技研 12.5143832909
+令狐冲 12.8020653633
+爱国精神 11.2616203224
+重臂 13.2075304714
+戚其章 12.8020653633
+界别 13.900677652
+发酒疯 12.1089181827
+中医学院 10.1871055853
+彩色显示器 11.9547675029
+事不宜迟 9.45802639549
+凑巧 9.74179456862
+三叠纪 9.46986085313
+变亮 13.2075304714
+保健药 13.2075304714
+大立柜 11.7034530746
+瞎指挥 11.9547675029
+张帅 10.2897597393
+生物工程 10.4349417492
+西魏平 13.2075304714
+测震 13.900677652
+观察面 13.900677652
+王体乾 12.2912397395
+阮福映 13.2075304714
+猪倌 12.5143832909
+公德 11.0674643079
+专精 11.1926274509
+北京籍 13.2075304714
+国华 10.1394775363
+环境压力 11.5027823792
+摇钱树 10.4041700905
+助人为乐 11.5027823792
+纸质 9.58318953844
+反义词 12.1089181827
+贫血病 11.8212361103
+贫血症 12.8020653633
+国势 8.89004235788
+一路节 12.8020653633
+一万一千零九十五册 12.8020653633
+道别 10.642581114
+释重 13.2075304714
+国务 9.75754292558
+蒲鲁东 10.4994802703
+卫理 13.900677652
+人情冷暖 12.5143832909
+拉克仑 13.2075304714
+救得 9.38981814546
+漫不经心 9.29550746599
+锥体束 12.5143832909
+新月形 10.0720362555
+西凉兵 11.2616203224
+国办 11.5027823792
+国力 8.51618258919
+积欠 10.3171587135
+船员 9.21854642485
+吓坏 8.96620371885
+进口商品 9.69598503258
+机耕 11.1280889297
+遽下 13.900677652
+申刻 12.8020653633
+副词 12.5143832909
+公布 5.06198083963
+驾驶仪 10.604840786
+乳化 9.89334446674
+创造学 13.900677652
+公帑 12.8020653633
+灵长类 9.7898037878
+始基 11.598092559
+兵行诡道 13.900677652
+单位制 9.46986085313
+船名 11.9547675029
+皮柿花 12.1089181827
+捷足先得 13.900677652
+阳沟 10.3743171274
+崔敏 13.2075304714
+国勇 12.5143832909
+杨子华 12.8020653633
+饼干 9.48183704418
+来去无踪 13.2075304714
+雷中庆 13.2075304714
+内宫监 12.5143832909
+碾过 11.3357282945
+摇得 10.2897597393
+痰迷心窍 12.5143832909
+得道者 12.1089181827
+废料 10.0940151622
+夜话 11.598092559
+屡遭 9.25628675283
+余太山 11.8212361103
+霍叔监 13.2075304714
+十七帖 12.8020653633
+陈小姐 11.8212361103
+莫知其 12.2912397395
+门单枝 12.5143832909
+霍次克 10.4666904475
+黎凡特 12.2912397395
+国利 12.2912397395
+架住 10.765183436
+局面 5.96652241844
+马房 12.2912397395
+生了 8.33615724465
+西辽史 13.2075304714
+北京市劳动人民文化宫 12.8020653633
+国强民富 13.900677652
+代母 13.900677652
+农艺 10.9049453784
+夜读 11.9547675029
+国分 12.2912397395
+已因 11.1280889297
+崔文 12.1089181827
+混口饭 13.900677652
+亢盛 11.1926274509
+防潮垫 13.900677652
+堰体 13.900677652
+垒球队 13.2075304714
+批语 11.7034530746
+创作者 10.8561552143
+机能 8.24119543622
+国剧 12.8020653633
+循环 6.68470264932
+公库 12.5143832909
+双偶 13.900677652
+站得住 12.1089181827
+公府 10.8096351986
+农舍 10.3453295905
+费德里科 12.1089181827
+碾轧 12.8020653633
+真空成型 13.900677652
+常州市 10.0505300503
+数百路 13.2075304714
+夜访 11.7034530746
+瞒神弄鬼 13.900677652
+封豫王 12.2912397395
+冻原 10.9049453784
+批评 7.17444424962
+章回小说 11.0674643079
+神秘化 10.642581114
+补锅 12.2912397395
+哲学体系 9.69598503258
+十七年 8.2273543848
+废旧 10.642581114
+文件类型 11.8212361103
+顾堂 12.8020653633
+宣明 12.5143832909
+失序 12.2912397395
+径向线 13.900677652
+张元伯 12.8020653633
+马槟榔 13.2075304714
+阀阅 12.8020653633
+一九三三年 12.8020653633
+寻阿舅 13.2075304714
+战局 8.74738605748
+阴廉 13.900677652
+弄嘴弄舌 13.900677652
+剪花 12.8020653633
+无亮点 11.9547675029
+远亲近邻 13.2075304714
+方术之 12.2912397395
+天鸣 11.5027823792
+开放性 9.72629038208
+英勇无畏 11.8212361103
+羊尾 12.5143832909
+密致 12.5143832909
+刘和光 11.598092559
+结构力学 10.7226238216
+初稿 9.63799777493
+塞缪尔 11.3357282945
+按说 8.83808261895
+熟地 10.533381822
+全班人马 12.5143832909
+应验 9.61021821083
+苍溪南 13.2075304714
+顾忌 9.07236391467
+摆明 11.7034530746
+陪床 13.900677652
+火花室 12.1089181827
+积水 8.51160592216
+刷拉拉 13.2075304714
+洛伊卡 13.900677652
+貌若 12.5143832909
+宗李旦 12.8020653633
+无小事 11.598092559
+凤凰网 11.4157710022
+批准权 12.8020653633
+弗劳恩 12.8020653633
+一马当先 9.98865464655
+秘诀 9.30555780184
+接受程度 11.0674643079
+战将 9.27570483869
+米奇湖 13.900677652
+大丽菊 13.2075304714
+探看 11.1280889297
+漠然 9.91169360541
+唐廷优 13.2075304714
+多巧 12.5143832909
+夜谈 12.1089181827
+蚕丝 9.4233408375
+北京站 11.9547675029
+一千一万个 13.900677652
+方寸之间 12.5143832909
+吓倒 10.3453295905
+羊山 11.4157710022
+一万八千余 12.5143832909
+缺吃少穿 11.9547675029
+循理 13.900677652
+帆樯 12.1089181827
+天鹅 8.98802276624
+身家性命 9.89334446674
+天麻 9.05649056552
+船只 7.34532076017
+决绝 9.93038573842
+止乎礼 13.2075304714
+顾影 12.8020653633
+七七四十 12.5143832909
+声情 12.2912397395
+城固县 12.8020653633
+务正 12.2912397395
+游过 10.9562386728
+转来转去 10.0294766411
+港务监督 12.2912397395
+显通寺 12.2912397395
+水产部 13.2075304714
+鬼脸 9.6811699468
+急于 7.50374799676
+急事 8.99540287354
+道喜 10.3453295905
+依法查处 10.9562386728
+暮春 10.6818018271
+邱四毛 10.4041700905
+要从严 12.1089181827
+郁勃 12.5143832909
+恒康 13.2075304714
+荒诞派 10.8096351986
+猪嘴 12.5143832909
+挡雨 12.8020653633
+科幻片 12.8020653633
+添附 13.2075304714
+西格 11.4157710022
+任华东 11.5027823792
+杜牧诗 12.5143832909
+约法三章 10.642581114
+冯定 13.2075304714
+推回 12.2912397395
+急件 11.2616203224
+胆瓶 13.900677652
+已决 9.98865464655
+天黑 8.12302532875
+施泰格 12.5143832909
+船厂 9.30555780184
+扩编 9.87532596124
+镶成 12.1089181827
+国商 12.5143832909
+出版者 11.4157710022
+同构化 13.2075304714
+文工团员 10.3171587135
+冯家 10.642581114
+唇亡齿寒 11.5027823792
+公妻 12.8020653633
+巴尔赛 13.900677652
+洛口仓 12.5143832909
+大青山 9.94943393339
+海印 10.2630914922
+自动开关 12.8020653633
+批货 12.2912397395
+帝永 10.4666904475
+灰扑扑 12.2912397395
+阿巴坎 12.2912397395
+郁化 13.900677652
+修文县 13.900677652
+道君 9.91169360541
+松鹤轩 13.900677652
+后山 9.43476953332
+摇头 7.03687426052
+罗慕洛 11.8212361103
+大丽花 10.9049453784
+攻坚能力 13.900677652
+瓜子皮 12.2912397395
+凉水 9.00283785202
+名扬四海 11.8212361103
+巴尔赫 12.1089181827
+僚机 12.2912397395
+天鼎 10.8561552143
+临海人 13.2075304714
+固于 13.900677652
+昏晕 11.2616203224
+潜水员 10.4994802703
+午时茶 12.2912397395
+沿儿 11.7034530746
+摇奖 11.7034530746
+床榻 11.4157710022
+公堂 9.96885201925
+昏昧 11.8212361103
+寿筵 13.2075304714
+步步为营 10.3743171274
+初筛 13.900677652
+庚申日 13.2075304714
+刑事判决 11.7034530746
+车辆驾驶 11.4157710022
+郁南 13.2075304714
+又名 7.25428713713
+调在 13.2075304714
+初等 9.44633035572
+腊八节 12.8020653633
+膀胱经 11.2616203224
+昏昏 10.4994802703
+普什图 11.0674643079
+合为一体 10.7226238216
+原鹿 13.2075304714
+陈肇敏 13.900677652
+瞻望 11.598092559
+珠穆朗玛峰 9.32596667347
+高姓大名 11.0103058941
+麻逸 11.9547675029
+昏星 13.2075304714
+中国男女队 13.900677652
+锦城 11.9547675029
+不设防 10.8096351986
+选煤厂 12.8020653633
+镀在 13.900677652
+吓出 11.4157710022
+防卫厅 10.8096351986
+采取任何 10.3743171274
+直露 13.900677652
+似然比 12.5143832909
+笑一笑 8.73589167805
+六安 9.91169360541
+多花钱 13.2075304714
+竞争 6.13808160344
+六宗 13.900677652
+子宜叔 12.5143832909
+废掉 9.84023464143
+铁嘴钢牙 13.2075304714
+齐放箭 12.1089181827
+新字 11.1280889297
+天龙 10.1394775363
+怒目相向 13.2075304714
+反射炉 11.5027823792
+虞洪 13.900677652
+舍特 12.5143832909
+惠登相 11.2616203224
+截长补短 13.900677652
+饼铛 13.2075304714
+国君 9.20019728618
+何振东 10.4041700905
+激光医疗 13.900677652
+王公子 13.900677652
+恒心 11.2616203224
+国名 8.83808261895
+赤诚 10.2897597393
+积液 9.7898037878
+简截了当 13.900677652
+丁卡 11.9547675029
+养老金 8.94485059437
+木纹 11.5027823792
+猪场 11.2616203224
+浓厚 7.75864024639
+虚伪性 12.8020653633
+木纳 12.5143832909
+积淀 10.0294766411
+致意 9.71102290995
+弊政 9.65218240993
+冯媛 13.900677652
+公墓 10.1164880181
+始兴 11.4157710022
+敏感数据 13.900677652
+清热解暑 11.8212361103
+八卦岭 13.2075304714
+阿根廷共和国 12.8020653633
+指路牌 13.900677652
+冯媪 13.2075304714
+哦哟 12.2912397395
+亢炎 13.2075304714
+贾珍之 11.9547675029
+急促 8.35941410682
+竞价 8.52078029844
+质检站 13.900677652
+猪圈 10.1394775363
+剪草 13.900677652
+昏暗 8.62767809341
+老同志 8.94485059437
+六对 12.2912397395
+六寸 11.1926274509
+浓痰 11.9547675029
+羊踯躅 13.900677652
+道场 9.18217878068
+微观经济 10.642581114
+恒山 9.93038573842
+六堂 11.8212361103
+通力协作 13.2075304714
+茼蒿 11.7034530746
+帕佩克 13.900677652
+秘要 12.2912397395
+国际商贸 11.5027823792
+郊区县 12.1089181827
+艾迪 11.9547675029
+十七宗 13.900677652
+赫勒斯 12.2912397395
+公子 7.59989185731
+甘露寺 11.5027823792
+晋宣帝 13.900677652
+实体镜 12.2912397395
+陆辉 12.5143832909
+基频 12.5143832909
+私见 12.5143832909
+冯契 13.2075304714
+公孙 10.0505300503
+公学 9.84023464143
+地向波 13.900677652
+杜十娘 11.598092559
+公季 12.5143832909
+积温 8.55834340001
+虫媒植物 13.900677652
+多方过程 12.8020653633
+董小宛 7.61841090508
+打工妹 13.900677652
+老板娘 9.02548032877
+六堵 13.2075304714
+船的宽度 13.900677652
+毛乌素 10.7226238216
+六堰 12.8020653633
+应领 13.900677652
+战平 11.5027823792
+通灵遇 13.2075304714
+滕县大石 13.2075304714
+决策函数 13.2075304714
+拱石桥 11.8212361103
+一二百元 12.8020653633
+毛驴车 11.3357282945
+康提 11.3357282945
+军令如山 11.3357282945
+国基 11.0103058941
+隔热 10.0088573539
+玉块 11.4157710022
+船儿 10.7226238216
+道高一尺 11.8212361103
+延边朝鲜族自治州 11.0674643079
+逊尼派 9.02548032877
+姓名权 12.2912397395
+六塘 12.8020653633
+牢固 8.22392384971
+量量 12.8020653633
+官应震 13.900677652
+高中低 13.900677652
+巡逻兵 12.2912397395
+纸行 13.900677652
+第二股 13.900677652
+羊年 13.900677652
+丛翠竹 13.2075304714
+隐秘 8.63798746307
+间接测量 13.2075304714
+百张 12.8020653633
+隐私 9.09665660724
+道坎 11.3357282945
+轴矢量 13.2075304714
+未审核 13.900677652
+绿泥石 10.4994802703
+占全苏 13.900677652
+国城 12.8020653633
+互动性 11.3357282945
+人参酒 13.900677652
+通产相 13.2075304714
+定冠词 12.8020653633
+报酬 7.84155445639
+于显德 12.8020653633
+博格达峰 11.598092559
+格鲍尔 13.900677652
+发愤图强 12.5143832909
+酚妥拉明 12.8020653633
+一双滴 13.900677652
+公寓 8.48903160012
+兼修 10.8561552143
+行使 7.37858485381
+网络结构 11.598092559
+侧柏叶 13.900677652
+外扩散 11.598092559
+郧西县 13.900677652
+蒸汽锅炉 11.9547675029
+子弟学校 11.1926274509
+飞机制造 9.91169360541
+犁田 11.7034530746
+纳喇氏 12.5143832909
+国土 7.76945116249
+李克杰 11.9547675029
+反射率 10.9562386728
+志海 13.2075304714
+肥东 11.2616203224
+骗子手 13.2075304714
+辐射 7.14258314755
+头套 11.0103058941
+爱沙尼亚 9.69598503258
+郊区化 11.9547675029
+惠文王 11.1926274509
+大红纸 11.598092559
+凯尔特语 11.7034530746
+百十匹 12.8020653633
+应须 12.5143832909
+舞起来 12.5143832909
+冯妇 13.900677652
+卢江郡 13.900677652
+圆锥花序 9.21854642485
+肥乡 12.5143832909
+拐棍 10.604840786
+浸润性 11.8212361103
+公安 8.29120585679
+甘之如饴 12.1089181827
+云雾茶 10.8561552143
+筑桥 13.2075304714
+普利河 13.2075304714
+缺陷率 13.900677652
+公定 12.8020653633
+千层饼 12.5143832909
+兰纳 13.900677652
+姑爷 9.69598503258
+搜一搜 11.8212361103
+公审 10.533381822
+行伍 10.604840786
+积满 11.0674643079
+已去 10.4041700905
+公家 8.99540287354
+游戏光盘 13.900677652
+暂行条例 10.2897597393
+公害 9.96885201925
+申冤 11.0103058941
+行会 9.48183704418
+公婆 9.74179456862
+六处 12.1089181827
+行令 11.2616203224
+寿礼 10.533381822
+低值 11.4157710022
+超绝 12.2912397395
+阿图什 11.598092559
+潜水器 10.7226238216
+服装协会 13.900677652
+熟后 13.2075304714
+金六福 12.8020653633
+满堂喝彩 12.2912397395
+空心菜 11.598092559
+六夜 12.8020653633
+冯梦龙 10.5684731418
+格子花 13.900677652
+起岸 13.2075304714
+全序集 13.900677652
+六大 8.21709788464
+取货 11.9547675029
+六天 9.91169360541
+何所云 13.2075304714
+夜车 12.5143832909
+赵王如意 12.8020653633
+战役 6.62550533252
+洒落 10.5684731418
+参谋总部 13.900677652
+煤耗 11.9547675029
+刘稻村 10.7226238216
+冻坏 10.9562386728
+三道 8.87679713113
+吃哑巴亏 13.2075304714
+迪拜 6.61106713052
+初祖 12.1089181827
+多方面 7.75434839431
+批转 10.6818018271
+公威 12.8020653633
+伯醇 12.8020653633
+国图 12.5143832909
+汨汨 13.900677652
+萨克拉门托 11.9547675029
+掌声 8.68574189437
+国园 12.8020653633
+禅和子 11.4157710022
+行人 7.68606955355
+加勒比地区 10.533381822
+针叶林 8.42003872863
+行了 10.9562386728
+战斗编组 13.900677652
+信安江 12.2912397395
+已到 8.08356649201
+制导技术 11.5027823792
+赵乘齐 12.8020653633
+顾岑 13.2075304714
+冻土 9.38981814546
+行事 7.47905538417
+国四 13.900677652
+导盲犬 13.900677652
+取走 9.85762638414
+拍拍 8.12923652885
+始发 11.2616203224
+行云 11.7034530746
+胶状沉淀 13.900677652
+通产省 13.900677652
+公娼 13.900677652
+闵椒沟 13.2075304714
+金昌市 11.7034530746
+药补 12.5143832909
+矿尘 12.8020653633
+行书 10.1164880181
+张华草 13.2075304714
+历练老成 13.900677652
+打倒 8.1608847398
+皓齿 12.1089181827
+二百六十年 13.900677652
+邢大姐 11.2616203224
+阿布维 12.5143832909
+过意 13.900677652
+热觉 12.8020653633
+九流十家 13.900677652
+明器青 13.2075304714
+佯言 13.900677652
+宗李显 11.598092559
+出不起 11.5027823792
+饱中枢 13.900677652
+全歼 9.4233408375
+界址 11.4157710022
+官家传 12.2912397395
+木糖 11.598092559
+共线 11.0103058941
+行义 12.5143832909
+巴尔迪 11.9547675029
+白云观 9.75754292558
+利斧 11.9547675029
+行乐 11.0103058941
+共约 8.99540287354
+行乞 10.9562386728
+于显庆 12.5143832909
+国嘉 13.900677652
+海商法 11.3357282945
+木精 12.5143832909
+偷猎者 11.0674643079
+洛迪诺 13.2075304714
+已办 12.5143832909
+客观规律 9.21854642485
+领导品牌 11.4157710022
+撇清 10.2630914922
+志气 9.7898037878
+水彩颜料 13.900677652
+王贝勒 10.4041700905
+志民 10.7226238216
+分浅缘薄 13.900677652
+行为 5.38648896958
+眼药膏 13.2075304714
+初秋 10.1394775363
+专上 13.900677652
+起居 8.85082164473
+任人唯贤 11.9547675029
+巴尔达 13.900677652
+特典 13.900677652
+阀门 9.59661255877
+余音绕梁 12.5143832909
+木粉 12.8020653633
+夺回去 13.2075304714
+喊道 7.70423352418
+行业 4.64050004515
+于盛唐 11.4157710022
+镶满 11.7034530746
+饼饵 13.900677652
+掌邦禁 13.2075304714
+出口产品 9.03314320152
+杨摇 13.2075304714
+察言观色 10.2117981979
+船形 10.642581114
+取舍 9.32596667347
+道夫 12.2912397395
+燥湿 10.4041700905
+雷风云 13.900677652
+昏死 11.598092559
+凉意 9.98865464655
+蚁丘 13.900677652
+梅克尔 12.8020653633
+一二点 13.2075304714
+左文襄公 12.2912397395
+隐瞒 8.20358416547
+商音弦 13.900677652
+积怨 10.4041700905
+许绍雄 13.900677652
+道外 12.1089181827
+报刊发行 12.2912397395
+办理手续 11.0674643079
+杜之秩 13.900677652
+失当 9.7898037878
+子刘胤 13.2075304714
+废渣 10.2371160058
+自习室 12.8020653633
+倒楣 13.2075304714
+新年快乐 12.8020653633
+丹霞地貌 10.6818018271
+煤车 12.2912397395
+机警 9.46986085313
+服务业 7.47418919452
+清纯 10.1394775363
+斯皮尔曼 12.5143832909
+魂不附体 10.1871055853
+买嘱 11.7034530746
+打翻身仗 12.2912397395
+月牙湖 13.900677652
+施恩惠 13.2075304714
+大江东去 11.1280889297
+建筑材料 8.2985588311
+恒利 11.9547675029
+冒火 9.91169360541
+唱高调 11.9547675029
+隔绝 8.75318317516
+种族灭绝 11.8212361103
+土砖 11.3357282945
+广丰 11.7034530746
+冯远征 13.2075304714
+取色 13.900677652
+无霜 11.0674643079
+差别化 10.5684731418
+感测器 13.900677652
+杂色蛤 13.2075304714
+道奇 10.9049453784
+帅位 12.5143832909
+人物属性 13.2075304714
+典型过程 13.900677652
+全盛时期 9.54396882529
+城市绿化 11.2616203224
+零五个 12.2912397395
+通永道 12.5143832909
+陪到 13.2075304714
+空气压缩 13.2075304714
+泰县 11.1280889297
+余丁才 12.8020653633
+音节文字 11.1926274509
+国大 11.1926274509
+扎伊德 13.900677652
+金灿灿 10.4666904475
+清热解毒 9.18217878068
+四间房 13.900677652
+螃蟹肉 12.8020653633
+长驱深入 13.900677652
+田一听 11.9547675029
+戴罪立功 11.2616203224
+恰帕斯 13.2075304714
+墨绿色 10.1164880181
+田福高 10.4349417492
+志愿团 13.2075304714
+弘图 10.3171587135
+台北人 13.2075304714
+八百零八年 13.900677652
+二分法 13.900677652
+疯婆子 13.2075304714
+蓄谋已久 10.9562386728
+阿剌知 12.8020653633
+包税制 12.2912397395
+寻出 10.8096351986
+掌邦礼 13.2075304714
+悬疑片 13.900677652
+包牌价 13.2075304714
+赤练蛇 13.2075304714
+苗条身材 12.5143832909
+待人接物 10.8561552143
+沿岸 6.86717116769
+八歌 13.900677652
+救命 9.00283785202
+国奥 12.5143832909
+简单明了 10.533381822
+血泡 11.1280889297
+针叶树 9.84023464143
+三原县 12.8020653633
+帅休 13.2075304714
+六四 12.5143832909
+起卸 12.8020653633
+活蹦蹦 13.900677652
+叶状枝 12.8020653633
+英国女王 10.0505300503
+六团 13.2075304714
+道姑 10.1871055853
+冒烟 9.29550746599
+史料选编 12.2912397395
+恒力 11.598092559
+凶案 13.2075304714
+行李袋 12.5143832909
+法律规避 12.1089181827
+子陈理 12.5143832909
+石狮子 10.1871055853
+六国 8.89673134603
+玉观音 12.2912397395
+机译 12.5143832909
+煤运 10.1871055853
+猪娃 11.9547675029
+娟娟 8.92394390956
+冒然 10.604840786
+嘉祥县 13.2075304714
+第九十九回 12.2912397395
+分工负责 11.2616203224
+已属 10.2371160058
+公告 5.49867087037
+六圈 13.2075304714
+起动 9.29550746599
+暖洋洋 10.3453295905
+永历帝 11.0103058941
+起劲 9.53122979951
+兵库县 12.8020653633
+热水锅炉 12.8020653633
+燕国皇帝 13.900677652
+布吕 12.8020653633
+乌叶海亚 13.900677652
+书画集 12.8020653633
+海长松 11.0103058941
+董字三 13.2075304714
+羊儿 12.8020653633
+房式仓 13.2075304714
+积愤 11.7034530746
+六圩 11.598092559
+剪辑 10.4994802703
+承贷 12.2912397395
+地理因子 13.900677652
+极其重要 9.18217878068
+抑郁症 10.3453295905
+木牌 9.59661255877
+卜从善 10.533381822
+石梁石 13.900677652
+普通用户 11.5027823792
+木片 10.9049453784
+喻南强 13.900677652
+六场 13.900677652
+扁蓄 13.900677652
+船帮 11.2616203224
+买回 9.75754292558
+范祥雍 12.8020653633
+茅元仪 12.1089181827
+巴瑟斯特 13.2075304714
+六块 12.1089181827
+白净 9.48183704418
+艾肯 11.9547675029
+天上掉 9.71102290995
+国士 11.1926274509
+阿卓糖 13.900677652
+从东向西 10.4666904475
+膝关 13.900677652
+埃伦菲尔 13.900677652
+沿崖 13.900677652
+攀藤揽葛 13.2075304714
+公吨 11.0103058941
+船帆 10.765183436
+上善若水 13.2075304714
+大彩凤 13.2075304714
+康必得 13.900677652
+楔状缺损 13.900677652
+中国致公党 11.4157710022
+阳义烈 13.2075304714
+一二百年 11.0103058941
+航空业 9.20932976975
+非晶硅 10.8096351986
+董昌部 12.8020653633
+合掌 9.12999302751
+木狼 11.8212361103
+鸽子花 13.2075304714
+五角形 12.1089181827
+平行投影 12.8020653633
+于前明 13.2075304714
+牢头 11.8212361103
+帕尔多 12.8020653633
+掌嘴 11.7034530746
+起到 6.68396816527
+外汇市场 8.58747167293
+农行 8.60236028543
+地守护 12.2912397395
+迅雷不及掩耳之势 11.1926274509
+联立方程 12.1089181827
+传杯换盏 13.900677652
+帕金森氏 11.4157710022
+掷盏 12.8020653633
+逐页 13.900677652
+安蒂奥 12.8020653633
+干利休 12.2912397395
+扩版 13.900677652
+冯国 11.7034530746
+阿玛求 13.900677652
+得罪人 10.3171587135
+筑有 9.74179456862
+书画院 13.2075304714
+络合物 10.0940151622
+数码照片 13.900677652
+一路行 11.2616203224
+董卓部 13.2075304714
+顾到 12.1089181827
+重提旧事 13.2075304714
+白凌 12.8020653633
+九运会 13.2075304714
+灵长目 10.2897597393
+武贲郎 12.8020653633
+道士 8.00352378434
+战军 12.8020653633
+礼智信 13.2075304714
+志成 10.604840786
+密谈 9.6811699468
+陈布雷 11.9547675029
+国家认可委员会 13.2075304714
+钉扣子 13.2075304714
+生活待遇 11.7034530746
+交叉着 11.7034530746
+干利体 12.8020653633
+界外 11.598092559
+三占从二 13.2075304714
+亲见亲闻 13.2075304714
+木犀 12.2912397395
+木犁 11.598092559
+船底 10.3171587135
+荀子则 13.2075304714
+简正振动 12.8020653633
+恒压 12.2912397395
+国宴 10.3171587135
+三百六十 11.1926274509
+煤质 10.1164880181
+战前 9.28555713513
+六名 10.5684731418
+农话 13.2075304714
+隐疾 12.8020653633
+六合 9.89334446674
+仇申 12.5143832909
+口令 9.5186510173
+任同知 12.8020653633
+楚辞 9.49395840471
+观测台 11.9547675029
+圣帝明王 12.5143832909
+斯图姆 12.2912397395
+调门儿 13.900677652
+马本斋 12.2912397395
+夜色 8.46259834305
+参观 7.89186446653
+黑暗世界 12.5143832909
+国宝 9.27570483869
+费周章 13.900677652
+威仪 9.72629038208
+小心谨慎 9.24671730182
+六吨 13.900677652
+萦回 11.8212361103
+国定 11.1280889297
+崔氏 11.3357282945
+艾菊 12.5143832909
+核不扩散 10.7226238216
+社戏 12.2912397395
+乌戈国 12.1089181827
+国安 8.9102450652
+通力合作 10.0505300503
+顾准 11.598092559
+戈尔巴乔夫 10.4349417492
+即食 11.9547675029
+秘藏 11.2616203224
+张阁老 9.84023464143
+亚瓦纳 12.2912397395
+战刀 11.5027823792
+救国 8.9102450652
+顾况 12.1089181827
+阳台门 13.900677652
+凝固化 13.2075304714
+实弹演习 12.1089181827
+鸡骨头 11.598092559
+始建 7.63158136827
+道学 10.2371160058
+备选 9.82314020807
+冯唐 13.900677652
+道孚 13.900677652
+战利 13.900677652
+塞维斯 13.2075304714
+隐痛 10.533381822
+天道 9.15574552361
+道子 11.598092559
+熟女 11.598092559
+六周 10.2630914922
+腰肌劳损 11.9547675029
+索贿受贿 11.9547675029
+择选 13.900677652
+刘子政 9.16447920358
+六味 12.8020653633
+不敏 13.2075304714
+冒牌 11.2616203224
+国富 9.14708746087
+战到 10.4349417492
+林三官 12.8020653633
+畜牧学 12.1089181827
+跳跳蹦蹦 12.1089181827
+流沙河 10.5684731418
+卡拉蒂 11.8212361103
+大青叶 11.8212361103
+淡淡的 8.81308131674
+槐叶 11.598092559
+陶元信 13.2075304714
+不毛之地 10.5684731418
+贾荇贾 13.900677652
+三野 11.4157710022
+船工 10.7226238216
+享誉中外 13.2075304714
+飞兵 13.900677652
+顾全 11.5027823792
+清明上河图 10.533381822
+情急智生 12.8020653633
+道宣 11.8212361103
+冒犯 9.37888907493
+快马加鞭 10.8096351986
+法测定 10.765183436
+百美图 12.1089181827
+则为 13.900677652
+主理 12.8020653633
+废油 13.2075304714
+白垩质 13.900677652
+中微子 10.0720362555
+留有余地 10.642581114
+莱登 11.9547675029
+道宗 12.8020653633
+机要 9.80633308975
+战勤 12.1089181827
+清文鉴 12.1089181827
+道教徒 11.3357282945
+二百四十里 12.8020653633
+不等价 12.5143832909
+抽屉式 12.5143832909
+顾允 12.1089181827
+无产阶级 7.39339993959
+大河上下 13.900677652
+茅舍 11.1280889297
+金玉良 13.2075304714
+已得 10.2897597393
+天都 10.604840786
+口中 7.35389224122
+呈递 10.604840786
+内应力 11.1926274509
+手工制造 12.1089181827
+仰华寺 13.2075304714
+赶不上趟 12.5143832909
+一片片 9.26594866375
+起兵 7.68207753228
+国学 9.59661255877
+灵敏性 11.9547675029
+已征 12.5143832909
+守财奴 12.1089181827
+呈送 11.0674643079
+取胜 8.03704647638
+三十几岁 11.1926274509
+口上 10.4994802703
+国字 11.5027823792
+威严 8.24119543622
+国子 10.6818018271
+建章立制 13.900677652
+胞内酶 12.5143832909
+大比 11.7034530746
+挡风 11.0103058941
+瞒哄 11.3357282945
+算定 11.0103058941
+特出 12.1089181827
+赫尔佐格 13.900677652
+志愿 9.04864738806
+神秘主义 9.5062284973
+霍亚 12.8020653633
+小克鼎 13.2075304714
+甘露园 13.900677652
+新兴国家 10.0720362555
+绅士风度 10.9562386728
+郑州市 6.37881839977
+军靴 12.5143832909
+周官经 12.5143832909
+口信 9.89334446674
+中国人民银行研究局 11.8212361103
+万善殿 11.1280889297
+翼手目 11.598092559
+宇道 13.900677652
+论证会 11.7034530746
+活命钱 12.2912397395
+贫病交迫 12.8020653633
+船山 11.2616203224
+石茎天 12.8020653633
+斯皮尔斯 13.900677652
+膀胱炎 11.5027823792
+聚类分析 12.2912397395
+威信 8.75901409547
+李珊珊 11.8212361103
+蒙老爷 12.1089181827
+湾仔 12.2912397395
+公器 13.2075304714
+干少津 13.2075304714
+择配 12.1089181827
+搂抱 9.62401153296
+扎伊尔 9.24671730182
+于希拉 13.900677652
+凑合 9.55687223012
+道威 13.2075304714
+嘎叭 13.900677652
+氡气 13.2075304714
+陈元龙 12.2912397395
+不紧不慢 9.63799777493
+郭法曾 13.900677652
+罗布尔 12.8020653633
+全毛 13.2075304714
+宝顺行 12.5143832909
+博物学家 10.9049453784
+于康居 13.2075304714
+兜率天 11.9547675029
+欧根 12.2912397395
+应门 12.1089181827
+崔浩 11.2616203224
+不光滑 12.5143832909
+塞门 11.9547675029
+蓝丝绒 13.2075304714
+秋山行旅 13.2075304714
+山东黄河河务局 13.900677652
+辐凑 12.2912397395
+艾芜 11.598092559
+永镇 11.7034530746
+决然 9.87532596124
+伞状 10.5684731418
+口供 10.0088573539
+偶合 11.4157710022
+元则 12.8020653633
+标准接口 12.1089181827
+罗特 11.0674643079
+亲姊妹 11.7034530746
+土里土气 12.8020653633
+彩头 10.765183436
+黑油红 13.2075304714
+界定 8.63798746307
+四五事件 12.2912397395
+战友 8.0285598625
+茅草 9.36807815882
+少数几家 11.0674643079
+钟茶 11.9547675029
+毁誉 11.5027823792
+救场 11.8212361103
+左顾 13.2075304714
+前倒 12.5143832909
+传统产业 9.4233408375
+仁慈地 12.5143832909
+反射线 12.8020653633
+结晶状 12.5143832909
+功能区 9.82314020807
+寻偶 12.2912397395
+巷议 13.900677652
+遍体鳞伤 10.2117981979
+绑起来 11.1280889297
+公园 7.0590621755
+废液 11.2616203224
+新婚 9.16447920358
+专守 11.8212361103
+国威 11.0674643079
+功能化 11.0103058941
+弥足珍贵 10.7226238216
+战史 10.642581114
+高家岭 13.900677652
+公国 8.98802276624
+凑和 11.4157710022
+共犯 12.8020653633
+冻害 10.4041700905
+猪头 10.1630080337
+口传 10.3743171274
+冷藏箱 13.900677652
+四千六百二十六万余两 13.2075304714
+舛杂 12.2912397395
+陈洪绶 11.3357282945
+凉拌 10.642581114
+忌辰 11.9547675029
+木炭 9.22784881751
+野生植物 9.53122979951
+挑中 11.0103058941
+郁州 12.8020653633
+腓尼基人 10.0294766411
+徐爵来 12.8020653633
+宫殿 7.53764954844
+取自 9.20932976975
+金秀山 13.2075304714
+吓得 10.0088573539
+山腰处 11.9547675029
+塞闭 13.2075304714
+桥高 11.9547675029
+挑一 11.0103058941
+黑棘皮病 13.2075304714
+羊叫 13.900677652
+爱尔兰共和国 11.598092559
+挑下 13.2075304714
+挑上 10.9049453784
+骨软筋麻 11.4157710022
+刺中 10.2897597393
+隐现 10.2630914922
+六分 10.4041700905
+公元 6.12918889186
+爱尔兰语 12.5143832909
+叹羡 12.5143832909
+公克 13.2075304714
+共生 8.70218062071
+流通业 11.4157710022
+纸船 12.8020653633
+酚醛 11.9547675029
+马奉操 13.2075304714
+过神儿 11.598092559
+正局级 11.9547675029
+天阙 12.1089181827
+茅蓬 12.2912397395
+触摸板 13.900677652
+叶密里 13.2075304714
+一百二十八两 12.8020653633
+刺上 12.8020653633
+刺下 12.5143832909
+舞阳钢铁公司 12.8020653633
+公公 8.55834340001
+郑东 11.8212361103
+项目法人 12.2912397395
+刺丝 12.8020653633
+公关 9.5062284973
+顾城 13.900677652
+公共 7.00095454469
+共用 8.96620371885
+陡坡 9.33632946051
+马瑙斯 11.7034530746
+莱热 12.5143832909
+巴比伦 8.98069672615
+求贤 10.8096351986
+机轮 10.9049453784
+月余 10.4349417492
+聚精会神 9.84023464143
+祝福歌 12.8020653633
+陆红军 11.9547675029
+机车 8.94485059437
+界岭 7.9817837977
+科学论文 11.0103058941
+北京邮电 13.900677652
+天险 9.49395840471
+帮教 12.5143832909
+源语言 13.2075304714
+热腾腾 9.91169360541
+机轴 12.5143832909
+许叔微 13.900677652
+情痴 12.5143832909
+初版 10.4041700905
+渔业生产 9.89334446674
+医学论文 13.900677652
+二叠纪 9.27570483869
+科学论断 12.2912397395
+可移植 13.2075304714
+佩鲁齐 13.2075304714
+巴尔萨 13.900677652
+天降 10.0940151622
+左右派 13.900677652
+免费电影 13.2075304714
+中国社会科学院美国研究所 13.900677652
+十八处 13.900677652
+天际 9.75754292558
+涎腺炎 13.900677652
+埃雷特 12.8020653633
+违拗 9.87532596124
+检查您 13.900677652
+练练手 12.5143832909
+猪年 13.2075304714
+木石 10.3743171274
+那小白 13.900677652
+温富州 12.8020653633
+农资 10.3743171274
+一下顶 12.8020653633
+刺人 11.1280889297
+界山 9.82314020807
+杨维垣 12.1089181827
+纸花 11.5027823792
+抗衰老 10.9562386728
+华若翰 13.2075304714
+爱尔兰共和军 11.3357282945
+城市绿地 12.5143832909
+全校 10.3743171274
+个体所有制 12.5143832909
+威武不屈 13.900677652
+约斯特 12.5143832909
+工艺学校 11.8212361103
+骆马湖 10.9049453784
+转折性 11.598092559
+伤残者 13.2075304714
+迈尔 10.0720362555
+中国歌剧舞剧院 11.8212361103
+按捺不住 9.36807815882
+西秦亦 13.2075304714
+炮声隆隆 11.2616203224
+特制 8.78868986362
+公出 12.2912397395
+预读 13.900677652
+令狐德 11.7034530746
+违抗 9.24671730182
+西凉府 11.598092559
+捐纳 12.1089181827
+战和 11.598092559
+船客 13.900677652
+船室 13.900677652
+天雷 11.2616203224
+丁同 13.2075304714
+过惯 10.8561552143
+马修斯 12.5143832909
+亚太经济 12.8020653633
+掌印 9.06439574502
+最低气温 9.38981814546
+左向右 11.1926274509
+脱离群众 11.0103058941
+界尺 13.900677652
+船家 9.5186510173
+农贷 12.8020653633
+月俸 10.8561552143
+授信 8.89673134603
+秘药 10.6818018271
+潜在用户 12.8020653633
+通政司 9.75754292558
+熟念 13.900677652
+农贸 11.4157710022
+白鲟 11.3357282945
+一千三百三十五卷 13.2075304714
+酚酸 13.2075304714
+公决 12.5143832909
+露天集市 13.900677652
+第五十七条 13.900677652
+产茶地 12.5143832909
+上虞县 12.1089181827
+天雄 9.91169360541
+波戈廷 12.8020653633
+莲花瓣 12.5143832909
+官川 12.8020653633
+凑到 9.65218240993
+宁波府 12.8020653633
+星等 10.1630080337
+病态人格 13.900677652
+沈葆桢 11.7034530746
+由得 13.2075304714
+华中地区 10.9049453784
+新不伦瑞克省 13.900677652
+舞文弄墨 11.9547675029
+庄人家 12.2912397395
+郑伦 12.8020653633
+宗李治 12.2912397395
+赵炅授 13.2075304714
+冒用 11.5027823792
+积攒 9.37888907493
+郑伯 12.8020653633
+只想去 12.2912397395
+十一分 13.900677652
+毁谤 11.7034530746
+郑众 11.4157710022
+刘子扬 12.5143832909
+章士钊 11.8212361103
+隗福临 13.900677652
+骂咧咧 13.2075304714
+郑伟 11.4157710022
+道尔 11.3357282945
+第七十三 12.5143832909
+吨位 9.35738286971
+第七十一 13.900677652
+冠盖 12.2912397395
+第七十七 12.8020653633
+六匹 11.4157710022
+钱塘江 8.47133202302
+猪心 11.3357282945
+烫金 12.2912397395
+一百三十里 12.8020653633
+通用寄存器 13.2075304714
+六十 8.78268383956
+峰林 9.6811699468
+善终 10.4666904475
+起因 9.04864738806
+阳转运 13.900677652
+救出 8.56313957227
+兰生 11.5027823792
+胸怀大志 11.3357282945
+鲁斯卡 11.9547675029
+全会精神 12.8020653633
+眼脸 12.8020653633
+畜牧局 11.2616203224
+掌勺 12.2912397395
+托瓦尔 13.2075304714
+进退维谷 11.1926274509
+洗洗 9.69598503258
+第七十九 13.2075304714
+话中带刺 13.2075304714
+那离群 13.900677652
+上周三 9.53122979951
+杨石先 12.8020653633
+天青 12.5143832909
+有家可归 13.2075304714
+虔心 10.6818018271
+船娘 12.2912397395
+六卷 11.1926274509
+叹绝 13.900677652
+托瓦尼 12.8020653633
+官道傍 12.5143832909
+水泊中 13.2075304714
+公债 9.19114745066
+古特尼 13.2075304714
+大椎穴 12.5143832909
+六厂 11.598092559
+道岳 13.900677652
+调整结构 9.46986085313
+友好合作 9.53122979951
+恒基 10.6818018271
+和仉欣 13.2075304714
+东洋界 10.4349417492
+头孢霉属 13.900677652
+自顶向下 13.2075304714
+丁启 9.03314320152
+四十多间 13.2075304714
+无阻 10.8561552143
+等价关系 11.8212361103
+木盘 10.765183436
+盟兄 13.2075304714
+石狮市 12.5143832909
+初现 10.3453295905
+木盒 10.4349417492
+激发起来 11.3357282945
+道岔 11.3357282945
+富屯溪 11.7034530746
+月亮 7.5871296057
+六成新 13.2075304714
+比哈尔邦 10.6818018271
+送神 11.9547675029
+木盆 10.642581114
+月产 12.5143832909
+龙海市 13.2075304714
+食品店 11.7034530746
+洁身自爱 13.900677652
+排斥异己 11.1280889297
+乌斯帕 13.900677652
+吡啶基 13.900677652
+天音 11.3357282945
+农谚 11.7034530746
+班达尔 13.2075304714
+声讯台 12.5143832909
+英德县 12.5143832909
+个体经济 10.765183436
+小轿车 9.77354326693
+六发 12.8020653633
+含氟量 12.8020653633
+白介素 13.2075304714
+水淹七军 11.598092559
+膀胱癌 10.8096351986
+舍生 11.5027823792
+六句 12.1089181827
+方先之 13.2075304714
+冯劫 12.5143832909
+六口 11.3357282945
+月份 4.88416477698
+呈露 13.2075304714
+飞凤 11.598092559
+蜿蜒 8.35160156708
+社旗 12.5143832909
+六号 11.4157710022
+旺儿 10.765183436
+六台 12.8020653633
+苦难深重 12.5143832909
+王宁嫔 13.900677652
+姆特瓦拉 13.900677652
+本性难移 11.5027823792
+田德重 13.900677652
+侏儒 10.4666904475
+月令 10.9562386728
+硬道理 10.9049453784
+设计标准 11.598092559
+牢度 12.1089181827
+利撒 13.2075304714
+六倍 11.1280889297
+卡拉胶 11.7034530746
+钱塘潮 12.5143832909
+公卖 13.900677652
+凉月 12.5143832909
+於扶罗 13.2075304714
+闻堰 12.5143832909
+交叉点 10.1394775363
+孔夫子 10.533381822
+救助 7.83922073305
+帅字旗 11.1926274509
+密诏 9.91169360541
+和长平 12.8020653633
+航空安全 12.2912397395
+昏浊 13.2075304714
+摇到 11.4157710022
+兰登 11.5027823792
+白云聚 13.900677652
+无一不是 10.2117981979
+左军北 13.900677652
+牢底 12.8020653633
+高含沙 12.2912397395
+二叠系 10.2371160058
+模板 10.4994802703
+做贼 10.765183436
+公卿 9.30555780184
+受得住 11.2616203224
+查不出 10.4666904475
+密语 11.3357282945
+应邀 8.97342396682
+船夫 10.2371160058
+凑兴 11.5027823792
+玫瑰花 9.66657114738
+乱杂 12.8020653633
+临西 13.900677652
+出言无状 13.2075304714
+太阳光球 12.5143832909
+绿孔雀 11.1280889297
+家具公司 13.900677652
+伯颜 9.87532596124
+情节恶劣 11.7034530746
+国忠 11.1926274509
+墨角藻 11.9547675029
+船头 8.41173992582
+三寸金莲 11.8212361103
+稻蓟马 12.8020653633
+十七口 13.2075304714
+楚语 12.2912397395
+液相色谱仪 13.2075304714
+自谋职业 11.9547675029
+农达 12.1089181827
+警报灯 13.2075304714
+教了 11.0674643079
+宗忠简 12.5143832909
+第部 10.642581114
+密访 11.9547675029
+戈康达 13.2075304714
+密订 12.8020653633
+十七号 13.900677652
+二十一天 11.9547675029
+信贷风险 9.61021821083
+剪裁 9.82314020807
+密议 9.84023464143
+伴星 10.604840786
+隐然 10.8561552143
+凉果 12.2912397395
+培尔 12.5143832909
+道德 7.13218444033
+王经宇 9.45802639549
+国强 13.2075304714
+天钩 13.900677652
+公叔 12.2912397395
+兰盆 12.5143832909
+农村基层 9.5062284973
+暮气 11.1926274509
+国务委员 10.1164880181
+忙碌 8.05423887692
+打弯 11.4157710022
+巴丹吉林 12.5143832909
+规格型号 11.8212361103
+杨刚刚 12.8020653633
+莱特 9.87532596124
+洋山港 13.2075304714
+彩云易散 13.900677652
+伯顿 11.8212361103
+暴力团 12.8020653633
+战国 6.99492437566
+齐和秦 12.8020653633
+秦云飞 9.27570483869
+辐合 10.0505300503
+基本概念 9.20019728618
+贝格曼 12.8020653633
+大西洋城 12.1089181827
+公历 9.84023464143
+猪尾 11.7034530746
+循线 13.900677652
+采金地 12.8020653633
+侍侯 11.5027823792
+凑出 13.2075304714
+已定 7.98447558937
+难近母 12.1089181827
+按脉 13.2075304714
+公厕 10.1871055853
+冯军 11.3357282945
+一二百 10.3171587135
+布劳德 12.8020653633
+标购 13.900677652
+汝南汝 11.9547675029
+凑凑 12.5143832909
+纸背 13.2075304714
+挡车工 11.9547675029
+布达拉宫 10.2117981979
+杨家枪 12.2912397395
+刘秀奉 13.2075304714
+十七卷 11.5027823792
+道心 11.8212361103
+巴伊 11.7034530746
+第十三卷 10.1871055853
+拳击台 12.8020653633
+侍书 11.9547675029
+隔离 8.17382990439
+分进合击 11.598092559
+救去 12.5143832909
+乳牙早失 13.900677652
+畜牧师 12.8020653633
+国度 9.82314020807
+劣根性 10.9049453784
+昌迪曼 13.900677652
+摇匀 12.8020653633
+颊车穴 13.900677652
+番鬼 12.8020653633
+凤凰琴 10.3453295905
+球拍 10.8561552143
+二百六十四 13.900677652
+积木 10.8096351986
+功能型 13.2075304714
+国府 11.4157710022
+战秦明 12.5143832909
+国庆 6.91503583434
+图示 10.765183436
+道希 13.2075304714
+始定 11.1926274509
+公分 10.3171587135
+羊坝 9.35738286971
+花异石 12.5143832909
+田园曲 13.2075304714
+侍中 9.05649056552
+木琴 12.1089181827
+国建 11.598092559
+致残 10.2897597393
+庄宗李 12.8020653633
+公刘 11.3357282945
+推土 10.0940151622
+公判 13.900677652
+起哄 9.46986085313
+侍丁 13.2075304714
+是非曲直 11.1926274509
+六六 11.2616203224
+神俊最 13.2075304714
+共登 13.900677652
+六八 11.8212361103
+蒙文通 12.2912397395
+箱管 13.900677652
+六具 13.2075304714
+四五趟 13.2075304714
+抢劫犯罪 13.900677652
+姬妾 10.3171587135
+成宗诏 13.2075304714
+战地 9.65218240993
+温邪 11.7034530746
+天镇 13.2075304714
+西凉州 11.598092559
+顾命 9.5186510173
+八卦图 11.8212361103
+六册 12.8020653633
+赫佐格 13.2075304714
+积极 5.19933124894
+台湾当局 10.0088573539
+东野 12.8020653633
+何门何 13.900677652
+泠然 12.8020653633
+谭平山 10.9049453784
+伴有 7.74794495727
+木瓢 12.5143832909
+船壳 12.5143832909
+巴伊亚 12.1089181827
+六军 10.4994802703
+侍仆 12.8020653633
+国帑 12.5143832909
+致死 8.81927328699
+木瓜 9.65218240993
+合唱队 10.8096351986
+印地安 12.2912397395
+侍从 8.85082164473
+单一体 13.900677652
+志摩 13.900677652
+斯角 11.7034530746
+道床 11.9547675029
+国币 11.8212361103
+艾虎 11.4157710022
+尹司马防 13.2075304714
+公勺 13.900677652
+国师 9.34680076038
+顾呆 10.2117981979
+遭人 10.1630080337
+伊兹梅尔 13.900677652
+猪崽 11.7034530746
+普利斯 12.8020653633
+勘界 11.7034530746
+圆弧底 12.8020653633
+泰安县 13.900677652
+斯图尔 12.5143832909
+口舌 9.31571017331
+天门 8.80081122415
+应酬 8.66423568915
+忌讳 8.73589167805
+天问 9.33632946051
+公办 9.44633035572
+公力 12.1089181827
+侍人 12.8020653633
+您老 9.45802639549
+冻得 8.90346537821
+昏沉 10.642581114
+公务 8.80081122415
+共相 11.0103058941
+四十余艘 13.2075304714
+劳师远 12.8020653633
+不择手段 10.4349417492
+电暖器 10.8561552143
+火夫 13.2075304714
+稳健作风 13.2075304714
+回手 10.1394775363
+玄德领 11.8212361103
+善类 11.2616203224
+仪式性 12.8020653633
+阐释 9.33632946051
+积沙成塔 13.900677652
+风和日丽 10.604840786
+扫描模式 13.900677652
+六出 11.598092559
+青天白日 10.3171587135
+低纬度 9.38981814546
+贾蓉笑 12.8020653633
+张元第 12.1089181827
+有昭武 12.5143832909
+上万斤 13.2075304714
+救治 8.35160156708
+郑爽 13.900677652
+公测 12.2912397395
+西辽德 11.0674643079
+已故 9.34680076038
+羊栏 13.2075304714
+初一 8.36334338496
+初七 9.96885201925
+只欠东风 11.4157710022
+掉转身 12.8020653633
+军训教官 12.5143832909
+初三 9.06439574502
+致哀 11.7034530746
+初上 11.8212361103
+女同胞 12.8020653633
+沟谷 9.12155415886
+没有碰过 12.8020653633
+顾毓 12.8020653633
+中山陵园 12.1089181827
+王亨利 12.5143832909
+初平初 13.2075304714
+刚果共和国 12.5143832909
+海安县 11.598092559
+终点站 10.2630914922
+下地干活 11.2616203224
+大中小学校 13.2075304714
+批改作业 13.900677652
+夏州定 12.8020653633
+怏怏 9.89334446674
+无法说明 11.598092559
+施莱 13.900677652
+自愿者 13.900677652
+采金 11.1280889297
+奖得主 10.2630914922
+志宏 12.8020653633
+分生孢子 11.4157710022
+爆炸声 9.7898037878
+采采 13.900677652
+分流器 13.2075304714
+科学认识 10.7226238216
+失魄 12.8020653633
+匆忙间 11.8212361103
+战栗 9.16447920358
+改编自 12.5143832909
+羊桃 12.8020653633
+处理部件 12.1089181827
+已收 12.2912397395
+志室 13.2075304714
+马图拉 12.5143832909
+刘表军 13.2075304714
+初乳 12.2912397395
+欧后亚 12.8020653633
+多万两 12.2912397395
+六神丸 11.9547675029
+经过 4.85191547566
+叶猴 10.604840786
+船期 10.9049453784
+公派 11.598092559
+哥特人 11.598092559
+起毛 11.7034530746
+生殖洄游 11.5027823792
+阿剌伯 12.5143832909
+智灌顶 13.2075304714
+初五 9.74179456862
+神通 8.75901409547
+合欢皮 13.2075304714
+神速 9.98865464655
+次氯酸 12.8020653633
+涩谷 12.5143832909
+乔掌柜 11.8212361103
+心理治疗 9.98865464655
+隔三差五 10.4666904475
+吃食 9.28555713513
+益三州 13.2075304714
+熏陶 9.31571017331
+初亏 13.2075304714
+金角湾 11.9547675029
+救民 10.5684731418
+至论 13.900677652
+致命 8.1608847398
+首恶必办 13.2075304714
+冷藏 9.91169360541
+湾畔 11.8212361103
+违建 11.8212361103
+峻节 13.900677652
+回扫 13.900677652
+猪手 12.8020653633
+归藏 11.8212361103
+菊池 12.5143832909
+隐伏 9.7898037878
+至诚 10.5684731418
+施泰尔 12.2912397395
+海公 12.1089181827
+王劭 13.2075304714
+起止 11.3357282945
+禹治水 10.9049453784
+滚装 12.5143832909
+昏厥 9.69598503258
+神道 9.55687223012
+斯托芬 11.3357282945
+寿仪 13.900677652
+月珍 10.0940151622
+抄写员 12.2912397395
+行礼 7.83456956187
+北双雄 13.900677652
+工料 12.2912397395
+口琴 10.1164880181
+诺木洪 12.8020653633
+欣赏 7.53420720424
+胡君荣 13.900677652
+蒙师父 12.1089181827
+瞎折腾 10.9562386728
+萧思温 11.9547675029
+记账 10.1164880181
+正则方程 11.9547675029
+颜面扫地 13.900677652
+金兰契 13.2075304714
+全球电信 12.8020653633
+肥硕 11.1280889297
+园长 11.8212361103
+脾胃 8.65365357982
+不由分说 9.44633035572
+航天工业 11.1926274509
+反应截面 12.1089181827
+利大于弊 10.8561552143
+毡衣 13.900677652
+斯巴赫 13.900677652
+布劳恩 10.6818018271
+护国运动 12.8020653633
+采邑 9.96885201925
+张三影 13.2075304714
+鲁河 13.2075304714
+社头 13.900677652
+初会 12.2912397395
+腆着 10.4666904475
+狗屎堆 13.2075304714
+手工业者 8.78268383956
+怅惘 9.91169360541
+保慧梅 13.2075304714
+归葬 11.2616203224
+初伏 12.5143832909
+马戏节 13.2075304714
+韶乐 11.7034530746
+京油子 12.8020653633
+猜想到 10.9562386728
+吃饭 6.4442230968
+精肉 11.7034530746
+杨畏 13.2075304714
+扇炉子 13.2075304714
+四千八百 12.5143832909
+冠瘿 13.900677652
+木展声 13.2075304714
+丁啉 13.900677652
+玛托夫 13.2075304714
+林冲勒 13.900677652
+初传 12.8020653633
+脾脏 10.1871055853
+信赖 8.50705010562
+吃饱 8.57280148319
+汝南县 10.533381822
+青唐羌 11.598092559
+倾心尽力 13.900677652
+叛徒 8.62767809341
+月牙 10.4666904475
+坠车 13.900677652
+口疮 11.7034530746
+谱线增宽 12.1089181827
+某大 12.1089181827
+数十万元 11.0103058941
+思想界 10.7226238216
+熟手 12.8020653633
+一点儿 7.32839510928
+车一族 11.4157710022
+补偏救弊 12.5143832909
+神采 9.75754292558
+背景色 11.598092559
+巴比特 12.1089181827
+槐树 9.44633035572
+葛天氏 12.5143832909
+通肯河 12.8020653633
+尼哥罗 11.8212361103
+照猫画虎 12.2912397395
+邵武市 12.5143832909
+其他软件 12.8020653633
+猪排 11.8212361103
+秫米 13.900677652
+遭灾 10.9049453784
+偷去 11.9547675029
+一双多 13.900677652
+压迫感 11.5027823792
+朗诵诗 12.2912397395
+濮州 12.5143832909
+刺玫 13.2075304714
+一点几 13.900677652
+维尔德 12.1089181827
+救活 9.33632946051
+未决犯 13.2075304714
+适用者 12.2912397395
+含情脉脉 11.2616203224
+成老鸽 13.2075304714
+公法 11.0674643079
+吕米亚 13.900677652
+安全观 13.2075304714
+旁骛 12.8020653633
+采选 10.2897597393
+梅克斯 13.900677652
+晋东南 10.0940151622
+印地文 12.8020653633
+雅库特 11.1280889297
+恒毅 13.900677652
+奚胜见 13.2075304714
+郑玄 10.1871055853
+断成 12.1089181827
+皮带传动 12.8020653633
+覃氏 12.5143832909
+三天三夜 9.65218240993
+僚友 11.8212361103
+怅怅 12.8020653633
+魏正 13.900677652
+革旧图新 13.900677652
+从古以来 13.900677652
+马良骏 13.2075304714
+发得 11.1280889297
+父子关系 11.2616203224
+伴奏 8.41173992582
+母子间 12.2912397395
+冷蒿 11.598092559
+甘露水 13.2075304714
+国恩 9.77354326693
+郑安平 13.900677652
+公沙 13.900677652
+朝西南 12.1089181827
+势穷力竭 12.1089181827
+适之 13.900677652
+被迫辞职 9.74179456862
+卡巴诺 13.2075304714
+冯溥 12.1089181827
+刷牙漱口 13.2075304714
+沙佩勒 12.8020653633
+施舍 9.32596667347
+摊商 13.900677652
+营运 8.18036587537
+道情 10.9049453784
+救济 7.82303540863
+李源潮 8.93783302172
+光导管 13.900677652
+麦蜂属 13.2075304714
+积威 13.900677652
+本质属性 11.3357282945
+绿宝石 10.3743171274
+莱什 12.8020653633
+卡特尔 10.6818018271
+掀了开来 13.900677652
+威盛 12.8020653633
+黑死病 11.5027823792
+互爱 11.9547675029
+宋庄 13.900677652
+西晋时代 12.5143832909
+罗洛 13.2075304714
+肝肾 9.19114745066
+桓鲈 11.1926274509
+肝肠 11.1926274509
+泌尿学 13.900677652
+口盖 11.5027823792
+金乔觉 13.2075304714
+行箧 12.5143832909
+集训地 13.900677652
+乌鲁伯 12.8020653633
+思虑 8.66423568915
+玩游戏 10.7226238216
+船支 11.1280889297
+行管 13.2075304714
+汪洋 8.34384959028
+跳舞会 13.900677652
+申在孝 13.2075304714
+一百多亩 13.2075304714
+公演 10.4041700905
+肝胆 9.58318953844
+船政 10.765183436
+问候语 12.5143832909
+帮子 9.40086798165
+潘岳 11.5027823792
+防爆灯 13.900677652
+已有 5.90436042018
+贺耀祖 11.5027823792
+征婚启事 12.8020653633
+汪文斌 13.900677652
+紧绑 13.2075304714
+窦丛生 13.900677652
+亭亭 10.8561552143
+回护 11.1926274509
+业余比赛 13.2075304714
+丘林氏 12.5143832909
+一分为二 9.55687223012
+吓昏 11.0103058941
+陆龟科 13.2075304714
+启蒙教育 11.5027823792
+水口镇 12.8020653633
+圆明园遗址公园 12.2912397395
+服下去 12.5143832909
+新品种 9.01787572939
+尖酸刻薄 12.5143832909
+惊喜交加 11.8212361103
+伴娘 11.8212361103
+明哲诸 13.900677652
+翁同书 13.900677652
+马基拉 13.900677652
+大清水溪 13.900677652
+国家专利局 13.900677652
+沟沟坎坎 11.598092559
+猛勇 12.8020653633
+牢房 9.5062284973
+严嵩之 12.2912397395
+就是指 9.24671730182
+不负众望 11.5027823792
+斯约堡 13.2075304714
+抹杀 10.2630914922
+一二百斤 13.900677652
+浓咖啡 13.2075304714
+挑着 8.96620371885
+榨甘蔗 12.8020653633
+宣宗而 13.2075304714
+六河 13.900677652
+热反应 13.2075304714
+虾兵蟹将 11.9547675029
+声级 13.2075304714
+柏林洪堡大学 13.2075304714
+直链 10.6818018271
+编织袋 10.7226238216
+脸形 11.598092559
+耽误时间 10.4666904475
+子超 13.2075304714
+困难者 11.9547675029
+摇滚 11.5027823792
+楚赣 13.2075304714
+六法 11.7034530746
+许福来 11.0674643079
+已极 9.65218240993
+兼管 9.11318590919
+竞秀 11.5027823792
+沙市市 12.8020653633
+王志国 13.900677652
+废品 9.77354326693
+城市化村 13.900677652
+林丹汗 12.2912397395
+转折年 12.5143832909
+高颧骨 11.0674643079
+韦君宜 13.900677652
+跋扈 9.5186510173
+彰化县 10.8096351986
+每秒 8.98802276624
+英容 13.2075304714
+行笔 11.9547675029
+里闾 13.900677652
+薛大叔 13.2075304714
+姻戚 13.2075304714
+筑屋 13.2075304714
+熟思 11.8212361103
+施胶 12.5143832909
+念下去 12.1089181827
+战歌 11.0674643079
+满口胡扯 13.900677652
+同光体 11.5027823792
+已晚 11.1926274509
+钩钩 12.2912397395
+缎纹 11.7034530746
+不怀好意 10.4041700905
+思蜀 13.900677652
+急运 13.900677652
+六洞 12.2912397395
+键盘乐器 10.9562386728
+开方子 12.2912397395
+国投 7.90671622467
+伴宿 12.1089181827
+一点半 13.900677652
+西道行 12.5143832909
+石花菜 11.598092559
+摇漾 13.900677652
+刺刀见红 11.2616203224
+志士 10.4666904475
+战死 8.39534611604
+脸庞 8.96620371885
+数十对 13.900677652
+六派 13.900677652
+冯氏 11.5027823792
+藤缠树 13.2075304714
+急诊室 10.3171587135
+服务生 11.5027823792
+施肥 9.31571017331
+姜片虫 11.598092559
+筑巢 9.63799777493
+糜烂 9.12155415886
+男女有别 11.3357282945
+积存 9.77354326693
+第十四卷 11.1280889297
+易之义 13.2075304714
+社学 11.3357282945
+行窃 11.4157710022
+阿蒙 11.2616203224
+杂波 11.4157710022
+旅行团 12.1089181827
+轧着 12.5143832909
+发电能力 10.4041700905
+轻慢 10.4994802703
+掌法 12.5143832909
+井陉矿区 13.900677652
+精确定位 11.7034530746
+昏倒 9.66657114738
+二百米 12.5143832909
+化工集团 10.4041700905
+联系群众 12.2912397395
+败兴而归 12.5143832909
+立建子 13.2075304714
+郎卡郡 10.6818018271
+贸易顺差 8.92394390956
+始末 9.77354326693
+国房 11.8212361103
+虎爪 11.5027823792
+纠纷案 11.7034530746
+十常八九 12.5143832909
+含漱剂 13.900677652
+歹人 9.93038573842
+熟悉 6.52229393898
+肝脏 8.17709255002
+红四军 10.9049453784
+行空 12.8020653633
+垓下 10.7226238216
+冲茶 10.8096351986
+紫袍玉带 13.900677652
+沟边 11.5027823792
+中国文化部 13.2075304714
+探测仪器 11.0103058941
+心灰 12.1089181827
+国戚 11.0674643079
+蚕种 11.2616203224
+身体状况 10.0294766411
+开放型 10.8096351986
+第一阵 12.1089181827
+民勤县 13.2075304714
+有丝分裂 9.96885201925
+北道达 12.8020653633
+物理化学 8.76487921493
+化学诱变 13.900677652
+高成长性 8.91707103027
+羊毛 8.27666014579
+芗城 13.2075304714
+退净 12.5143832909
+一双家 12.5143832909
+王纬宇 7.54630761118
+斯巴达 9.09665660724
+阿萨 12.2912397395
+莱伊 12.1089181827
+郑燮 12.2912397395
+围而不打 13.2075304714
+渔人得利 12.2912397395
+执法者 10.765183436
+钻门路 12.8020653633
+荒芜 9.04864738806
+史朝义 12.2912397395
+行程 7.96050639926
+冻土带 10.9562386728
+园陵 13.2075304714
+阿萍 10.2897597393
+冲荡 12.8020653633
+羊毫 11.5027823792
+塔尔斯基 11.9547675029
+检出限 12.2912397395
+国手 11.4157710022
+小家庭 10.0940151622
+专兼职 13.900677652
+王茂荫 13.2075304714
+维亚切 13.2075304714
+地下排水 13.2075304714
+还大 9.93038573842
+神针 12.1089181827
+蔚蓝 10.3171587135
+羊氏 13.900677652
+思考 7.2673592187
+死无对证 12.2912397395
+服务牌 12.8020653633
+牯岭 12.1089181827
+二百五十里 12.2912397395
+吃斋念佛 11.7034530746
+木作 11.598092559
+人缝 12.2912397395
+羊水 10.3171587135
+冯武 13.900677652
+张理涛 13.900677652
+辛四烯 12.8020653633
+锱铢 13.2075304714
+梢子 11.5027823792
+必当 9.82314020807
+非正义战争 11.598092559
+吃鱼 11.2616203224
+国际能源机构 12.2912397395
+福斯特 10.9049453784
+吴又见 13.2075304714
+假肢 11.1280889297
+泰定帝 10.765183436
+地安门 11.9547675029
+夏凉冬 11.9547675029
+留些 11.2616203224
+劳改队 11.9547675029
+园里 9.07236391467
+论过 12.8020653633
+赵国良 13.2075304714
+北道行 12.5143832909
+阿莱 10.8096351986
+惠更斯 9.96885201925
+懒汉 11.598092559
+触摸式 12.1089181827
+艾特利 13.2075304714
+阿莫 13.2075304714
+灵敏度 8.9102450652
+贝格尔 11.3357282945
+火红色 12.8020653633
+收拾残局 11.3357282945
+卫生球 11.5027823792
+于姚宏 13.2075304714
+恒温 10.2630914922
+终点线 12.5143832909
+厚积薄发 11.3357282945
+道教 7.77162744192
+鞍山人 13.2075304714
+爱国同胞 13.900677652
+口炎 12.5143832909
+全国假日旅游部际协调会议办公室 13.2075304714
+开机 10.1871055853
+和剂局方 12.8020653633
+吓怕 11.598092559
+辗转不安 13.900677652
+国旅 9.28555713513
+福尔赛 13.2075304714
+峰度 13.900677652
+羊汤 12.2912397395
+闾阎 13.900677652
+英寻 13.900677652
+摇桨 12.5143832909
+以农为本 13.2075304714
+楼九楹 13.900677652
+大决战 10.9049453784
+国政 9.07236391467
+脸大 10.8561552143
+小松林 11.8212361103
+吴为者 13.2075304714
+压岁钱 10.9562386728
+密麻麻 12.8020653633
+赤血 12.5143832909
+闲步 10.9562386728
+承运 10.3743171274
+汽车信息 12.8020653633
+战法 9.69598503258
+中文信息处理 13.900677652
+内行人 11.7034530746
+玉恭肃 13.2075304714
+大凌河 10.0294766411
+古玉图 12.5143832909
+羊油 12.5143832909
+旁系 11.2616203224
+艾中信 12.5143832909
+木俑 11.8212361103
+奄奄 11.8212361103
+试装 11.8212361103
+宫之中 11.8212361103
+十几美元 13.2075304714
+获得性免疫 11.9547675029
+郑皇 13.900677652
+新丰江 11.9547675029
+重新包扎 12.8020653633
+地老虎 10.765183436
+泪光 10.0294766411
+哀叫 11.4157710022
+刺目 11.3357282945
+漆员外 12.1089181827
+至迟 9.98865464655
+志异 13.900677652
+凉州 9.0884932966
+不死鸟 11.8212361103
+武选主 12.8020653633
+胆落 13.2075304714
+房祖名 12.2912397395
+流通盘 9.13850371718
+桓温伐 13.2075304714
+电视总局 12.8020653633
+马格达 12.2912397395
+白山黑水 11.5027823792
+谢夫 12.5143832909
+福士贞 13.2075304714
+体现者 11.8212361103
+蓝绿藻 12.1089181827
+占廷皇帝 11.0103058941
+恒源 10.0088573539
+月石 13.900677652
+大革命 8.39534611604
+国教 9.20932976975
+帮工 10.2117981979
+叛逃者 12.5143832909
+诸葛瑾乃 13.2075304714
+子贡 11.7034530746
+格思里 12.2912397395
+第三等级 10.8096351986
+崔勇 13.2075304714
+道旁 9.87532596124
+秫秸 10.8096351986
+志强 10.2117981979
+训示 10.533381822
+煮沸法 13.2075304714
+胜境 10.765183436
+国际收支 9.16447920358
+耶稣基督 10.9049453784
+阿英 10.9562386728
+筑宾 12.5143832909
+刺眼 9.63799777493
+武都县 11.8212361103
+摇椅 12.5143832909
+卫生界 12.5143832909
+沃纳 11.8212361103
+保险资金 8.14493543839
+莫敢谁何 13.900677652
+考评组 13.2075304714
+后不着店 11.5027823792
+致函 10.533381822
+六次 10.3453295905
+睡帽 13.900677652
+后负荷 13.900677652
+玉蝉 12.2912397395
+心口不一 13.2075304714
+阿苏 9.75754292558
+致死率 12.2912397395
+坚韧不拔 11.1280889297
+武陵春 12.8020653633
+单分子层 13.900677652
+马图林 13.2075304714
+六款 11.3357282945
+爱荷华州 13.2075304714
+阴宫 11.3357282945
+木主 13.2075304714
+和艳萍 13.2075304714
+推理机 12.2912397395
+鬼把戏 11.9547675029
+燕昭 13.900677652
+选派代表 13.2075304714
+荒落 13.2075304714
+采铜 11.2616203224
+阿芳 13.2075304714
+阿花 13.900677652
+急不可耐 10.3453295905
+湄公河 9.98865464655
+全校师生 11.7034530746
+阿芬 12.5143832909
+当药 13.2075304714
+一百多个 10.533381822
+采铁 12.2912397395
+髀肉复生 12.5143832909
+泼下 13.900677652
+扩产 9.48183704418
+木业 10.8096351986
+木丛 13.2075304714
+总开关 13.2075304714
+老兵不死 13.900677652
+升华 9.18217878068
+月白 10.4349417492
+凉山 10.4041700905
+致冷 10.8096351986
+刺着 11.598092559
+阿芒 12.8020653633
+神门 11.4157710022
+木下 11.3357282945
+秦庄公 12.1089181827
+突出贡献 9.37888907493
+归老 13.900677652
+路传中 13.2075304714
+后跃开 12.8020653633
+豹子 9.66657114738
+麸子 11.8212361103
+木丁 12.8020653633
+滚走 12.5143832909
+变换位置 11.9547675029
+毛索洛 12.2912397395
+邓萃雯 13.2075304714
+如雷贯耳 10.9049453784
+周瑜调 13.2075304714
+金变沙 12.8020653633
+榜示 12.8020653633
+后继无力 13.900677652
+贡戈拉 12.8020653633
+电暖气 12.1089181827
+刻花 11.4157710022
+兽群 13.900677652
+谭富英 11.7034530746
+无定河 10.4041700905
+掘出来 12.1089181827
+房委会 13.900677652
+施虐 12.1089181827
+完全必要 13.2075304714
+登陆作战 9.84023464143
+亚洲各国 9.82314020807
+回旋半径 13.2075304714
+六段 12.2912397395
+致公 13.900677652
+青旗军 12.1089181827
+阿巴查 13.2075304714
+猪杂 13.2075304714
+木人 11.0103058941
+莲花白 13.2075304714
+二传手 11.7034530746
+新泰市 11.598092559
+许乃济 13.2075304714
+三四十里 12.2912397395
+忠良 10.0505300503
+月盈 13.900677652
+一十二年 13.900677652
+木亭 13.2075304714
+再贴现率 13.2075304714
+房地产股 9.96885201925
+叨念 11.1280889297
+施正荣 11.8212361103
+社工 13.900677652
+胶南市 11.9547675029
+北庭伊 13.2075304714
+气候变迁 10.4041700905
+月相 10.4666904475
+永州市 12.1089181827
+冷肃 12.2912397395
+蒲吾 13.900677652
+饮食无味 13.2075304714
+玛格利 12.2912397395
+鹦鹉 9.38981814546
+帅爷 12.2912397395
+今来古往 13.900677652
+课外阅读 12.8020653633
+刻苦钻研 11.0674643079
+诛尽杀绝 12.8020653633
+违宪 10.533381822
+铁官徒 13.2075304714
+小家子 11.5027823792
+冷荤 13.900677652
+言启奏 12.8020653633
+张元素 12.5143832909
+一二亩 13.2075304714
+铁板一块 10.8096351986
+郁怒 12.2912397395
+道术 11.0674643079
+两面分 13.2075304714
+自贡市 11.1926274509
+拍板 10.0088573539
+公武 12.5143832909
+盛倡 12.8020653633
+峰峰 10.765183436
+国家发明奖 11.7034530746
+公正 7.62780064543
+夏培肃 13.2075304714
+宣礼塔 12.5143832909
+积带 13.2075304714
+三连 10.0505300503
+於天子 11.598092559
+迟浩田 12.2912397395
+慢悠悠 9.74179456862
+六样 13.900677652
+峰峦 9.75754292558
+可挡 13.2075304714
+卡夫卡 11.1926274509
+潘天寿 11.0103058941
+六根 11.1926274509
+丘赫尔 13.900677652
+忠臣 8.77077893705
+国柱 12.5143832909
+致力 9.56994431169
+梁梦龙 11.3357282945
+继发性 9.34680076038
+琼结县 11.9547675029
+阻难 12.5143832909
+兽类 9.00283785202
+梢头 11.4157710022
+一二件 12.2912397395
+兰丁 13.2075304714
+二十二代 13.2075304714
+普利尼 13.2075304714
+陈正 11.8212361103
+涌进来 11.1280889297
+坐轮椅 11.7034530746
+决不可 10.533381822
+道来 10.533381822
+抹掉 10.0294766411
+排挤 8.34771806705
+脾虚 10.3171587135
+东郭 11.0103058941
+东洋人 11.5027823792
+六档 12.5143832909
+阻隔 9.48183704418
+陈武 10.7226238216
+吓成 10.604840786
+摇橹 10.4666904475
+阻障 12.5143832909
+典章文物 12.8020653633
+低值易耗品 13.900677652
+风尘仆仆 10.1394775363
+万盛区 12.2912397395
+康姆州 13.900677652
+相同之处 11.1926274509
+公款 9.55687223012
+积年 11.1926274509
+结晶体 10.4994802703
+峰岭 11.5027823792
+六便士 13.2075304714
+枪炮声 10.642581114
+新南威尔士 11.3357282945
+膨润土 10.0940151622
+英子 9.0884932966
+公母 11.7034530746
+一二个 11.0103058941
+旅行包 11.4157710022
+筑堡 10.765183436
+四眼井 12.8020653633
+公比 13.900677652
+郁悒 11.8212361103
+行署 8.29120585679
+筑堤 9.91169360541
+仲华忒 13.900677652
+国术 11.9547675029
+阿图罗 12.5143832909
+鸭蛋形 13.2075304714
+一二万 11.2616203224
+铝制品 11.8212361103
+十七次 12.5143832909
+峰山 9.61021821083
+兰竹 11.9547675029
+一二一 13.2075304714
+收录于 13.2075304714
+三十件 12.8020653633
+常遇春 10.6818018271
+道林 13.2075304714
+五千九百零一匹 13.2075304714
+一二三 11.0674643079
+摘下来 9.74179456862
+六七百斤 13.900677652
+兴犹未尽 12.2912397395
+生产指标 13.2075304714
+硼砂 10.4666904475
+战胜者 11.9547675029
+冷菜 11.4157710022
+大红人 11.5027823792
+峰尖 12.8020653633
+矛盾尖锐 10.8096351986
+恒河 9.08039608637
+共保 11.7034530746
+冲虚 11.598092559
+家属区 10.6818018271
+帮忙 7.49050277001
+共促 13.900677652
+间协议 12.1089181827
+红溪 12.8020653633
+怅望 12.5143832909
+撇开 8.03989142851
+胜负难测 13.2075304714
+揣摩 8.91707103027
+拍马屁 10.8096351986
+肖邦 10.2371160058
+台球 10.5684731418
+赳赳武夫 11.7034530746
+装药量 11.598092559
+海纳百川 13.900677652
+仙水 12.2912397395
+泛黄 11.3357282945
+已接 12.1089181827
+凉快 9.94943393339
+国权 11.4157710022
+三氟氯乙烯 11.3357282945
+脸孔 8.53003962385
+兰亭 10.6818018271
+开放区 10.0088573539
+积弊 9.4233408375
+剿获 13.900677652
+阿胶 9.38981814546
+明叔你 11.2616203224
+思茅 11.1280889297
+掌上明珠 10.604840786
+冷艳 11.9547675029
+冷色 11.8212361103
+道昭 12.8020653633
+峰巅 11.2616203224
+假传圣旨 11.8212361103
+月球 8.34771806705
+地址总线 12.5143832909
+姜居之 11.3357282945
+和亚欧 13.2075304714
+坑木 11.598092559
+示性类 12.1089181827
+凉帽 11.5027823792
+郁愤 11.9547675029
+帮帮 10.3453295905
+肥羊 11.3357282945
+行经 9.46986085313
+共主 11.7034530746
+共为 9.89334446674
+和长松 11.5027823792
+郑生 10.2371160058
+中国医学科学院肿瘤医院 13.2075304714
+凉席 10.4666904475
+赶上来 9.80633308975
+志峰 11.4157710022
+油料植物 11.1280889297
+松木板 12.8020653633
+积弱 10.9049453784
+月牙儿 11.3357282945
+行约 13.900677652
+共乐 11.9547675029
+已成 7.9817837977
+起泡 10.765183436
+眼花撩乱 12.8020653633
+靓女 12.2912397395
+当腰 12.8020653633
+行纪 12.2912397395
+阿育 12.8020653633
+记熟 12.2912397395
+阿肯 11.598092559
+采集 7.74369866639
+机数量 13.2075304714
+子非子 13.2075304714
+归航 13.2075304714
+滚转 11.8212361103
+共买 13.2075304714
+滚轮 10.3171587135
+愁眉不展 10.4666904475
+单项工程 13.900677652
+归舟 12.2912397395
+退隐 10.5684731418
+健与美 13.900677652
+那广目 13.2075304714
+范逸臣 13.900677652
+昏君 10.2371160058
+铜仁市 12.2912397395
+滚轴 12.2912397395
+六楼 11.2616203224
+郑畋 11.4157710022
+靓妹 11.7034530746
+镶入 13.900677652
+枸橼酸 11.9547675029
+大可不必 9.96885201925
+棕黑 12.2912397395
+高中级 12.5143832909
+东邻 9.27570483869
+刺疼 10.765183436
+官房长官 11.9547675029
+利空 7.53420720424
+肥缺 10.533381822
+胀痛 9.62401153296
+共事 9.12999302751
+英伦海峡 13.900677652
+晋唐诸 13.2075304714
+于天聪 12.1089181827
+东邦 13.900677652
+长长短短 10.8561552143
+阿联 11.4157710022
+林冲告 12.8020653633
+架为 12.5143832909
+逼供信 13.900677652
+新动力 9.91169360541
+罗氏 10.533381822
+艾德林 12.2912397395
+检查官 11.9547675029
+淮安县 11.598092559
+共产 9.89334446674
+克息州 13.2075304714
+积德 10.4666904475
+共享 8.29487558568
+陆核 12.5143832909
+王海都 11.5027823792
+海棠花 11.2616203224
+谢树仁 11.4157710022
+精神损失费 11.8212361103
+苇荡 13.900677652
+停不住 12.8020653633
+精致 7.8604229407
+吴阿衡 13.900677652
+阿耳 10.9049453784
+决胜负 11.3357282945
+挤上来 11.9547675029
+接触网 12.8020653633
+滚进 11.1926274509
+晶核 13.900677652
+威猛 10.533381822
+晶格 9.74179456862
+危旧房 12.5143832909
+花斑癣 13.900677652
+求胜心切 11.3357282945
+共价 11.4157710022
+一二位 12.5143832909
+人生道路 10.9049453784
+吴老将军 11.8212361103
+警官学校 13.2075304714
+汽车业 9.19114745066
+王志发 13.900677652
+已报 10.6818018271
+通话录音 13.900677652
+刺痛 9.12999302751
+塞伦格 12.8020653633
+抹成 13.2075304714
+从那之后 11.5027823792
+义乌人 12.5143832909
+刺痒 13.2075304714
+那怎么行 10.533381822
+费长房 12.8020653633
+宋加封 12.2912397395
+废帝 10.604840786
+竞猜 11.0674643079
+布尼亚 13.2075304714
+数完 11.9547675029
+挺好玩 12.8020653633
+公敌 11.1280889297
+动荡不定 11.0674643079
+妨功害能 13.900677652
+聚居地 9.75754292558
+阿迪 10.8561552143
+暴成性 13.2075304714
+陪护 11.2616203224
+阿迦 13.900677652
+多第一只 13.900677652
+十数万元 13.2075304714
+冯村 12.1089181827
+公教 11.5027823792
+沿江 8.1641053545
+二级标准 13.2075304714
+皮明庥 13.2075304714
+危机重重 11.9547675029
+波哥大 11.3357282945
+叛国 10.2371160058
+男尊女卑 11.7034530746
+残贼 13.2075304714
+东非 8.61241062128
+阿迈 13.2075304714
+三辆 10.0505300503
+河州卫 12.5143832909
+熏黑 11.5027823792
+由此及彼 12.2912397395
+冷货 13.900677652
+阿达 10.8096351986
+吃透 11.0674643079
+口粮 9.43476953332
+近几年来 8.99540287354
+长胡子 11.0103058941
+半缩酮 13.900677652
+四十多天 13.900677652
+施设 12.1089181827
+崔平 13.900677652
+软席 13.2075304714
+摇摇 10.1871055853
+摇摆 9.24671730182
+卢西亚 13.900677652
+刺穿 10.765183436
+雾霭 11.3357282945
+神风 11.1926274509
+归责 12.5143832909
+施训 12.8020653633
+管辂 11.8212361103
+隔代 11.1926274509
+幸恢 10.3743171274
+林木参天 13.2075304714
+胶南县 13.900677652
+阿辛 13.900677652
+国槐 12.1089181827
+十七日 10.0505300503
+语根 13.2075304714
+卜弥格 13.2075304714
+暴力性 13.900677652
+高家湾 13.2075304714
+拉上 9.59661255877
+检查员 11.7034530746
+中国教育电视台 13.900677652
+掌柜 8.4801426527
+杨红樱 13.2075304714
+全港 10.6818018271
+钩鼻 13.900677652
+陪房 11.3357282945
+卢西乌 13.900677652
+公族 10.4994802703
+许栋 12.2912397395
+界桩 13.2075304714
+海洋生物 9.56994431169
+加减法 11.598092559
+理性 6.90950076485
+疤印 13.900677652
+冯某 11.1926274509
+检查和 9.49395840471
+晚来一步 12.8020653633
+积储 11.7034530746
+隔世 11.9547675029
+味醇 11.3357282945
+摇撼 10.533381822
+石花街 11.3357282945
+典雅 8.66956903512
+鸿门宴 10.2371160058
+靛蓝色 11.7034530746
+承祖制 12.8020653633
+康暮 12.1089181827
+狗鱼 10.9562386728
+给些 13.900677652
+龚魏 13.2075304714
+公文 8.45825994145
+检查哨 13.900677652
+中短程 11.7034530746
+磕巴 13.2075304714
+党委政府 11.2616203224
+沿河 8.61241062128
+垂带 13.900677652
+熏鸡 13.2075304714
+凉凉 12.2912397395
+吹向 10.9049453784
+三三两两 10.0505300503
+于西秦 12.1089181827
+大使级 10.533381822
+应运龙 12.1089181827
+郁滞 11.598092559
+沿沟 12.8020653633
+界标 12.2912397395
+公斤 7.5515386606
+掌权 9.37888907493
+农四师 13.2075304714
+张元珍 13.900677652
+公断 12.1089181827
+接受方 13.900677652
+山珍海味 9.94943393339
+夜行人 11.9547675029
+金符授 13.2075304714
+蒙德拉 11.9547675029
+贾琏未 13.2075304714
+昏官 11.9547675029
+坐失良机 11.1280889297
+兔死狗烹 12.8020653633
+疯疯 12.2912397395
+帮凶 10.4666904475
+马三立 12.8020653633
+服务网 13.900677652
+抹泪 10.9049453784
+废弛 9.96885201925
+结成联盟 10.4041700905
+奥胡斯 13.900677652
+道格 13.900677652
+沿海 6.38207043516
+郑笺 13.2075304714
+六月 7.68407155089
+左伯桃 12.8020653633
+进气管 12.2912397395
+冲要 10.6818018271
+六朝 8.76487921493
+吃酒 8.41588071849
+六期 11.5027823792
+章京吼 13.900677652
+废弃 8.45825994145
+极端重要 13.2075304714
+开国功臣 9.80633308975
+籍记充 13.2075304714
+睁开眼睛 8.36728816325
+禁吸 13.900677652
+六本 13.900677652
+护罩 12.8020653633
+狮泉河镇 11.7034530746
+塑胶制品 12.2912397395
+王海鹰 13.900677652
+仓颉 11.2616203224
+屏东 10.3171587135
+视觉性 13.900677652
+高效益 13.2075304714
+签署 6.65931136865
+六杆 12.8020653633
+银行借款 10.4349417492
+几十厘米 11.2616203224
+采食 10.7226238216
+毫不退让 13.2075304714
+地矿局 11.4157710022
+船游 13.900677652
+中央研究院 8.97342396682
+勋努达美 13.900677652
+崔彦 12.8020653633
+采风 11.1926274509
+玉素普 13.2075304714
+道桥 12.1089181827
+行点 13.900677652
+月牙形 11.0103058941
+凝固性 12.1089181827
+六条 9.63799777493
+军用车辆 11.2616203224
+落拓不羁 12.5143832909
+扬旗 13.2075304714
+素鸡 13.2075304714
+两面手法 13.900677652
+单位根 12.2912397395
+西川行 13.2075304714
+斯约史 12.8020653633
+一点多 12.2912397395
+跳跳虎 12.8020653633
+归谁 11.2616203224
+宣宗诏 13.2075304714
+蔡叔监 13.2075304714
+气冲霄汉 13.900677652
+国棉 11.5027823792
+天线宝宝 12.1089181827
+筑城 9.02548032877
+玉壁城 13.2075304714
+那焙茗 13.2075304714
+苏州地区 11.4157710022
+吃重 12.8020653633
+媛媛 11.2616203224
+御前 8.42003872863
+骨肉相残 13.900677652
+收方 12.5143832909
+损益 8.36728816325
+晶晶 11.0674643079
+六枝 11.598092559
+黄光裕 9.08039608637
+兽环 13.900677652
+红衣主教 10.9562386728
+六枚 12.1089181827
+伴儿 10.1630080337
+国树 13.900677652
+龙源口 13.2075304714
+科莱 12.1089181827
+归去来兮 12.2912397395
+架下 11.8212361103
+打车 9.0884932966
+另辟 10.0720362555
+国标 8.61747392324
+六架 12.2912397395
+帝王 7.80485308954
+真刀真枪 10.8096351986
+宣孔明 13.900677652
+错构瘤 13.2075304714
+兽王 13.900677652
+积冰 12.8020653633
+摇旗 8.66423568915
+只想来 13.900677652
+告成镇 11.7034530746
+苏多欢 13.2075304714
+黄粱一梦 12.8020653633
+肥煤 11.0674643079
+民族矛盾 9.61021821083
+敞篷版 11.7034530746
+杜宗文 10.9049453784
+白尼马 13.900677652
+箱形梁 12.5143832909
+探过 11.9547675029
+道森 13.2075304714
+第七十章 13.2075304714
+送来 7.23372085955
+汝南孟 13.2075304714
+志刚 11.0674643079
+氮氧化物 10.7226238216
+罗波 11.9547675029
+救救 9.74179456862
+热点新闻 12.5143832909
+隔作 13.900677652
+彼德森 13.900677652
+一十三载 13.2075304714
+南昌县 12.1089181827
+筑坝 10.4041700905
+国家邮政局 12.8020653633
+锡金 9.69598503258
+其他词汇 13.900677652
+核区 12.5143832909
+六柱 12.2912397395
+心潮澎湃 10.7226238216
+学生装 11.3357282945
+泪器 12.1089181827
+思路 7.0080360108
+余海里 12.5143832909
+当过 8.1417758781
+袁先生 12.5143832909
+很像 12.5143832909
+冷轧 9.6811699468
+诵经声 12.5143832909
+公权 10.2897597393
+营营 11.0103058941
+积分 8.28754954559
+数字编码 13.2075304714
+词牌名 13.900677652
+上窜下跳 12.1089181827
+香港三联书店 13.900677652
+西向 9.93038573842
+神骏 11.8212361103
+石油市场 10.7226238216
+商彝周鼎 13.2075304714
+胆怯怯 12.8020653633
+暴食暴饮 13.900677652
+坠落 9.11318590919
+脸型 10.3453295905
+忙忙碌碌 10.1164880181
+东闪西躲 13.900677652
+普教 13.2075304714
+沿湖 10.4349417492
+马尔默 12.2912397395
+令狐楚 11.8212361103
+布克萨尔 13.2075304714
+肥胖率 13.900677652
+国殇 11.1280889297
+报章杂志 13.2075304714
+施泰因 9.98865464655
+御厨 11.4157710022
+社寮 12.8020653633
+蒙哥命 12.1089181827
+另谋 12.1089181827
+赵怀业 13.2075304714
+积到 13.2075304714
+唐实叉 13.2075304714
+凑数 12.1089181827
+林曾泰 13.900677652
+急火 13.2075304714
+嘉善县 13.900677652
+口红 10.2897597393
+不材 13.2075304714
+神髓 12.8020653633
+口约 12.8020653633
+公有 9.19114745066
+司法界 11.8212361103
+特告 12.8020653633
+摇晃 8.11993413618
+寸土不让 12.8020653633
+朗诵者 13.900677652
+奇峰 9.35738286971
+打工族 13.900677652
+战成 12.1089181827
+昏头 12.1089181827
+志军 10.765183436
+公望 12.8020653633
+郁江 10.1164880181
+藏在岩 13.900677652
+绣鞋 10.7226238216
+留后路 12.5143832909
+必填 12.1089181827
+跟风 8.50705010562
+塌台 13.2075304714
+四乙基铅 12.2912397395
+撇去 13.2075304714
+屈出律 12.2912397395
+狄之邦 12.1089181827
+掌旗 12.8020653633
+月票 12.2912397395
+益鸟益虫 13.900677652
+流水作业 12.2912397395
+法医学 11.0674643079
+刀枪不入 10.765183436
+拉卡列 13.900677652
+那圣僧 13.2075304714
+平起平坐 10.1394775363
+卫生站 13.2075304714
+费兰特 13.900677652
+软硬件 10.0294766411
+鸾飞凤舞 13.900677652
+人口众多 9.63799777493
+毙伤 9.74179456862
+熏鱼 12.8020653633
+阿赫 11.4157710022
+工布 11.9547675029
+陈尔寿 12.5143832909
+掌政 12.1089181827
+奥德威 12.5143832909
+月牙岛 12.8020653633
+上官氏 12.8020653633
+开放度 11.8212361103
+帮厨 13.900677652
+凶死 12.5143832909
+仲华可 13.900677652
+社办 13.2075304714
+起意 11.598092559
+阿赖 13.2075304714
+荒诞 9.62401153296
+二十二个 11.1280889297
+归还 8.36334338496
+开发软件 13.900677652
+救星 9.61021821083
+管辖 7.20487873492
+林冲奔 13.2075304714
+海埔 12.1089181827
+汉祖唐 13.2075304714
+食品安全 9.02548032877
+忠贞 9.77354326693
+世界大学生运动会 11.5027823792
+阿贾 13.2075304714
+战斗英雄 10.2630914922
+月租 10.9562386728
+冯文 13.2075304714
+姬氏 12.5143832909
+战技 11.1926274509
+夹着尾巴 11.1280889297
+一个四十岁 12.2912397395
+睡眠症 13.900677652
+国步 13.900677652
+斯元科 11.7034530746
+大接访 13.900677652
+沿溪 11.4157710022
+骷髅头 10.9049453784
+违和 12.8020653633
+啥样子 11.3357282945
+战抖 10.4349417492
+代表人 9.94943393339
+阿贡 11.5027823792
+阿贝 11.1280889297
+掌故 9.91169360541
+萨蒂亚格 13.2075304714
+迎风 8.81308131674
+行猎 10.9562386728
+喜眉笑眼 13.900677652
+森林资源 8.60236028543
+峰值 8.45394028031
+战报 11.0103058941
+广林 13.900677652
+姬水 11.9547675029
+猪栏 11.9547675029
+神马 9.43476953332
+虎子 10.1871055853
+肥牛 11.598092559
+从旁 10.0940151622
+国歌 10.1871055853
+八卦掌 11.598092559
+能谱仪 12.1089181827
+五万匹 13.2075304714
+掌教 11.2616203224
+社区 7.65457088649
+澳门中华总商会 13.2075304714
+张令将军 13.2075304714
+冻死 9.24671730182
+薄钢 12.8020653633
+电机车 13.2075304714
+塑炼 12.2912397395
+多氯联苯 11.598092559
+可预言 13.900677652
+火光冲天 10.2371160058
+动干戈 11.1280889297
+东风公司 13.2075304714
+十字镐 12.8020653633
+凑搭 13.900677652
+另购 13.2075304714
+老而不死 13.2075304714
+克劳修 13.900677652
+顾惜 11.1280889297
+贾环重 13.2075304714
+埃里克森 11.598092559
+期中考试 10.9049453784
+结束语 11.598092559
+六支 11.4157710022
+钙肥 12.8020653633
+持久和平 11.9547675029
+万夫长 13.900677652
+上得起 12.8020653633
+郁洲 12.2912397395
+相朴 13.900677652
+开放式 7.23754495598
+毫无意义 9.55687223012
+帮到 12.2912397395
+争吵声 11.7034530746
+家务管理 11.1280889297
+花花公子 10.6818018271
+掘去 13.900677652
+有船 11.3357282945
+差别性 11.3357282945
+公明 10.765183436
+气吞河山 13.2075304714
+当起 10.533381822
+松陵 12.5143832909
+行状 10.765183436
+罗慕卢 12.5143832909
+崔嵬 11.9547675029
+郑祥 12.8020653633
+公易 12.1089181827
+无话可答 12.2912397395
+坏蛋 10.3171587135
+宗教界 10.8096351986
+伏尸遍野 13.2075304714
+巧慧 8.7245279194
+公映 10.5684731418
+红绿灯 10.1630080337
+步田地 13.900677652
+陕北 8.28390655431
+挂号信 11.9547675029
+急煞 12.5143832909
+天蚕蛾 13.900677652
+船民 12.1089181827
+智圆 13.900677652
+病原菌 9.96885201925
+卡巴斯基 13.900677652
+顾恺 12.5143832909
+积压 9.29550746599
+死记硬背 11.1926274509
+宁山麓 13.900677652
+秀雅 10.8561552143
+市教委 13.900677652
+变幻无常 11.9547675029
+积贮 11.7034530746
+羊排 12.8020653633
+驱马前进 13.900677652
+施用量 11.9547675029
+网讯 11.0103058941
+帮办 9.80633308975
+罗布泊 9.66657114738
+荒诞剧 13.900677652
+震响 10.4349417492
+待人处事 13.900677652
+帮助 5.80905024037
+折起来 12.5143832909
+观测所 11.9547675029
+锁不住 13.2075304714
+横冲直撞 10.1164880181
+聚芳酰胺 11.9547675029
+镶嵌 8.27305653829
+性情柔顺 13.900677652
+侍立 8.86372504956
+顾恋 13.2075304714
+摧促 13.900677652
+已满 10.1630080337
+北二路 13.900677652
+专用型 11.5027823792
+六方 10.3743171274
+思辨 9.89334446674
+黄盖船 13.2075304714
+承乾宫 9.20932976975
+刺秦 13.900677652
+洛川县 11.9547675029
+神魔 11.8212361103
+生产指数 10.5684731418
+思过 11.8212361103
+国务院 6.48069772831
+当路 11.0674643079
+美国商务部 8.33999602096
+文叔 12.5143832909
+神魂 10.6818018271
+组成员 10.1394775363
+欧佩克 9.55687223012
+蔽身 13.900677652
+增液汤 13.2075304714
+六日 10.3171587135
+打火 10.2897597393
+辣妹子 12.8020653633
+顾怜 13.900677652
+署名文章 11.598092559
+六旬 10.3743171274
+绣阁 12.5143832909
+吕好问 12.2912397395
+野外工作 12.5143832909
+王以土 13.2075304714
+重估价 11.598092559
+口缘 12.5143832909
+咸鸭蛋 12.5143832909
+久病入络 13.900677652
+建设性 9.85762638414
+涌出来 9.85762638414
+北府兵 10.642581114
+阿谀 10.8096351986
+利沃夫 11.8212361103
+掌控 8.65893063692
+黄森森 13.2075304714
+英尺 9.58318953844
+文宁 13.2075304714
+一百四十两 13.2075304714
+讥讪 12.5143832909
+磕头 7.89186446653
+归西 11.1926274509
+峰回 13.900677652
+讥讽 9.19114745066
+民盟中央 11.9547675029
+剿袭 13.2075304714
+串列 13.2075304714
+夏州城 12.1089181827
+六成 8.66423568915
+顾柯 12.8020653633
+聚居区 9.36807815882
+徐文长 13.900677652
+高纯砷 13.900677652
+西四环 11.9547675029
+山口县 11.7034530746
+芬兰湾 11.0103058941
+小家具 13.900677652
+请救兵 11.9547675029
+八卦教 12.1089181827
+滚落 9.0884932966
+六户 13.2075304714
+高中生 10.1394775363
+帐房先生 13.2075304714
+政治权利 9.19114745066
+多核细胞 13.900677652
+长夜漫漫 12.8020653633
+六房 13.2075304714
+睛明 12.5143832909
+韭黄 11.2616203224
+六扇 11.9547675029
+讥诮 11.1926274509
+掌握 6.15957856194
+公意 11.4157710022
+人民警察 10.6818018271
+拉亮 12.5143832909
+六手 13.900677652
+救济费 12.8020653633
+恒春 11.0103058941
+讲话声 11.9547675029
+仁和区 13.2075304714
+界河 9.12999302751
+阿让 13.2075304714
+鸡飞狗跳 11.0674643079
+方诗铭 11.7034530746
+望门投止 12.5143832909
+兼用 9.23723855786
+苏悉地 12.8020653633
+社员 9.07236391467
+公愤 10.3743171274
+总供给 10.4349417492
+讥诋 13.900677652
+汤子外 12.8020653633
+讥评 11.5027823792
+恒星 7.81163277653
+三萜类 12.8020653633
+卡文迪许 11.5027823792
+肥胖症 10.604840786
+成道节 12.8020653633
+政简刑清 13.900677652
+道济 11.598092559
+以上者 9.65218240993
+忠诚 8.2985588311
+界沟 13.2075304714
+口碑 8.96620371885
+陈尚智 13.900677652
+六批 12.2912397395
+闻得贤 13.2075304714
+猪湾 13.2075304714
+三五个 9.93038573842
+念奴娇 11.4157710022
+电工器材 12.1089181827
+武氏石 12.8020653633
+服务站 10.9049453784
+三五两 12.1089181827
+扑打在 12.5143832909
+关令尹 12.2912397395
+游戏笔墨 12.8020653633
+瞒报 11.3357282945
+伴同 11.2616203224
+管军政 13.2075304714
+脸儿 9.7898037878
+染红 9.61021821083
+中兴大学 13.2075304714
+兽皮 9.82314020807
+六折 11.9547675029
+卫生系 13.900677652
+三五下 12.1089181827
+三五丈 13.2075304714
+掌持 13.2075304714
+三五万 12.1089181827
+娱乐性 10.4041700905
+三五七 13.2075304714
+冷觉 11.9547675029
+有点咸 13.900677652
+石湾镇 12.2912397395
+育儿袋 11.8212361103
+兴致勃勃 8.89673134603
+刘全进 13.2075304714
+界江 13.2075304714
+王命卫 12.8020653633
+格罗诗 13.900677652
+朱葆三 12.1089181827
+起来 3.96134044655
+戴震著 13.2075304714
+仪式化 13.2075304714
+顾恺之 10.533381822
+救民于水火 12.5143832909
+直通通 11.8212361103
+刺绣 8.81927328699
+颜色视觉 13.2075304714
+威信扫地 12.5143832909
+鸡飞狗走 12.8020653633
+试营业 11.5027823792
+美国电影艺术与科学学院 11.2616203224
+国浩 12.8020653633
+吨级 8.67493097826
+集贤县 12.5143832909
+于永乐 10.604840786
+辩证关系 10.4041700905
+双叉岭 12.8020653633
+作贱 11.5027823792
+志在 9.94943393339
+萦怀 13.2075304714
+红疹 11.4157710022
+林冲引 13.2075304714
+哪怕 7.30353195009
+迫在眉睫 9.25628675283
+暮年 10.6818018271
+郑经 11.8212361103
+打转儿 12.5143832909
+善于 7.16015829237
+主力球员 12.2912397395
+帮同 12.1089181827
+善事 10.4349417492
+家鸡 11.0103058941
+袁潭 12.2912397395
+顾曲 12.5143832909
+叛变 8.84443184663
+家庭装饰 13.900677652
+哑谜 10.8561552143
+急眼 12.8020653633
+倒买倒卖 10.9562386728
+古在希 13.900677652
+碳酸氢盐 11.3357282945
+百合科 10.5684731418
+林冲别 13.2075304714
+修文殿 12.5143832909
+凑成 10.4041700905
+王封鲁 13.2075304714
+跳跳舞 11.3357282945
+冷血 11.8212361103
+几内亚比绍 10.3743171274
+跋涉 9.10488710638
+一百八十种 13.2075304714
+别拉洪 12.5143832909
+善人 10.1630080337
+姚振宗 12.8020653633
+蒙红 13.2075304714
+丁云鹏 12.8020653633
+八十五岁 12.1089181827
+颅腔 11.2616203224
+爱乐维 13.900677652
+盘住 12.5143832909
+海枯石烂 11.8212361103
+国泰 7.99531580392
+洗心涤虑 12.8020653633
+陈永 10.9049453784
+威福 10.533381822
+新旧体制 12.8020653633
+决雌雄 11.8212361103
+吃错 12.5143832909
+施仕纶 13.900677652
+公怒 13.2075304714
+细高挑儿 13.900677652
+荒谬 8.74162235276
+冰冻三尺非一日之寒 12.2912397395
+白孝文 9.49395840471
+西藏自治区旅游局 13.900677652
+埃斯卡 13.900677652
+密西西 13.900677652
+口福 11.1280889297
+海防 8.75318317516
+生旦净末 12.5143832909
+木绵树 13.2075304714
+张君瑞 12.8020653633
+急着 8.83808261895
+福州市人 13.900677652
+兼理 10.1394775363
+一看之下 10.4666904475
+秀逸 10.6818018271
+刺网 12.2912397395
+另记 13.900677652
+叛卖 11.5027823792
+另许 13.900677652
+身材苗条 11.3357282945
+积善 11.5027823792
+旋转磁场 11.4157710022
+另设 9.48183704418
+博宁顿 13.2075304714
+另订 11.8212361103
+渺渺 10.9562386728
+潜水泵 13.2075304714
+违反 7.40390266179
+竞聚率 13.900677652
+木华黎 10.604840786
+战旗 11.9547675029
+另议 11.7034530746
+补骨脂素 13.900677652
+忠言 10.2897597393
+国民 7.11848559597
+訾粟 13.2075304714
+各执一端 12.2912397395
+宝嘉 13.900677652
+整斗 13.2075304714
+氧原子 10.2371160058
+伴唱 10.8561552143
+善举 10.5684731418
+崔宏 13.2075304714
+冲账 12.2912397395
+善为 10.9049453784
+肥甘 11.0674643079
+忠言逆耳 13.2075304714
+明建文 12.1089181827
+红外扫描 13.2075304714
+塞布河 13.900677652
+美国能源 10.604840786
+八百零八步 13.900677652
+肺出血 12.8020653633
+顾显 11.3357282945
+另请 13.900677652
+吱吱喳喳 11.7034530746
+不可名状 11.8212361103
+三环股份 11.7034530746
+无误 9.46986085313
+红榜 12.8020653633
+月终 12.8020653633
+月经 8.2985588311
+昏庸 9.62401153296
+无千无万 13.900677652
+乌雅氏 13.2075304714
+切断 8.15447446144
+第九十三回 12.2912397395
+科尔库 13.2075304714
+竞相 8.90346537821
+金线巷 13.900677652
+冲起 11.8212361103
+冲走 9.94943393339
+微微一笑 8.36728816325
+善书 11.7034530746
+战斧 10.1394775363
+道法 10.5684731418
+耽惊受怕 13.900677652
+背回家去 12.8020653633
+阿訇 10.0720362555
+叛匪 11.1926274509
+电容量 11.8212361103
+交响音乐会 11.9547675029
+行知 13.2075304714
+蓦然 9.33632946051
+梢公 10.765183436
+暮岁 13.900677652
+一眨巴眼 13.2075304714
+气相色谱仪 12.8020653633
+红桧 11.2616203224
+足协杯 13.2075304714
+散弹枪 11.9547675029
+桑格 11.9547675029
+斩头沥血 13.900677652
+巴黎市政府 12.8020653633
+黑迭儿 12.8020653633
+文学 6.3343666372
+冯慧 10.8096351986
+称法 11.7034530746
+上官云珠 11.9547675029
+同声相应 12.5143832909
+肥皂 8.91707103027
+竞用 13.900677652
+成吉思汗 8.29120585679
+无定期 12.5143832909
+会长 7.78921031247
+慰安 13.900677652
+闲章 12.2912397395
+长嘘短叹 13.900677652
+旅行家 9.75754292558
+深仇大恨 11.598092559
+特征参数 12.5143832909
+地理单元 12.2912397395
+格雷伯爵 13.900677652
+韦森堡 13.2075304714
+一品夫人 11.1926274509
+西凉民 13.2075304714
+摇扇 12.8020653633
+誉满 11.5027823792
+僚属 9.48183704418
+睡着觉 11.8212361103
+误差值 12.5143832909
+槐木 13.2075304714
+志喜 13.2075304714
+摇手 9.29550746599
+玛多县 11.2616203224
+犍为 10.4041700905
+零用费 13.2075304714
+曼苏尔 11.5027823792
+不吝赐教 11.5027823792
+吕元事 12.5143832909
+花树丛 12.2912397395
+弘一法师 12.5143832909
+当街 9.63799777493
+防守战术 11.8212361103
+云南省 8.00903344015
+遭罪 11.0674643079
+赵姨娘 9.84023464143
+作用域 12.8020653633
+安非他命 13.900677652
+录过 13.900677652
+吹大牛 12.8020653633
+另行 8.65365357982
+已比 10.765183436
+劳心焦思 13.2075304714
+神鸟 11.8212361103
+郁新卒 12.8020653633
+玛尔斯 13.2075304714
+冷语 13.2075304714
+垃圾箱 10.9562386728
+肥瘠 11.2616203224
+肖风 10.4994802703
+广延量 13.900677652
+非晶体 12.2912397395
+七零八 12.8020653633
+无伤大体 13.2075304714
+仓鼠 11.1926274509
+第五天 10.3743171274
+马尔马 13.2075304714
+崔增 13.2075304714
+掉枪花 13.900677652
+薄薄地 11.598092559
+桑格拉 13.900677652
+阿巴泰 11.9547675029
+皮诺 12.1089181827
+界湖 11.5027823792
+喜剧电影 12.5143832909
+信王选 13.2075304714
+雾里 10.765183436
+集宁市 11.8212361103
+相撞 9.71102290995
+冷话 13.900677652
+合金材料 11.4157710022
+庚申年 13.900677652
+模态 10.9562386728
+坠胡 12.2912397395
+滚蛋 10.0720362555
+欣荣 12.8020653633
+第一第二 13.900677652
+起敬 13.2075304714
+小叔子 10.9049453784
+红框 13.900677652
+此言差矣 10.9049453784
+吨粮 13.2075304714
+凉城 12.5143832909
+病原虫 12.5143832909
+社团 8.98069672615
+军国主义者 11.9547675029
+卫生纸 10.8561552143
+朱成矩 9.69598503258
+电负性 10.8561552143
+槐林 12.8020653633
+行省 8.17382990439
+神鹰 11.9547675029
+严先生 11.5027823792
+移情别恋 12.5143832909
+公推 10.8561552143
+起效 11.0103058941
+筹备会议 12.8020653633
+楚春申 11.7034530746
+金言 13.900677652
+老挝语 12.2912397395
+另装 12.8020653633
+巴政府 13.900677652
+远客 11.7034530746
+鲜虞亭 12.8020653633
+撇在 12.2912397395
+海上运输 9.96885201925
+神龙 9.46986085313
+神龛 10.604840786
+急用 10.8096351986
+公所 10.0088573539
+神龟 11.1280889297
+从政 9.93038573842
+很冷 10.6818018271
+六万九千 13.2075304714
+致富 8.91707103027
+育人 12.1089181827
+安汉公 12.2912397395
+致密 8.77671367257
+公孙一清 11.9547675029
+平安夜 11.0103058941
+赫德任 12.8020653633
+行相 13.900677652
+侣伴 13.2075304714
+社会契约论 10.765183436
+专用化 13.900677652
+积在 11.9547675029
+放在首位 9.85762638414
+卫生署 11.1926274509
+船桅 11.4157710022
+青海柴达木盆地 11.598092559
+沙佩尔 12.2912397395
+特莱特 13.900677652
+喝彩声 10.9049453784
+冷美人 13.2075304714
+花季少女 12.2912397395
+贾昌朝 13.2075304714
+饮食无度 13.900677652
+节令 9.77354326693
+元元贞 11.8212361103
+重丘区 13.900677652
+救援 7.88452049228
+战服 13.900677652
+叛军 9.48183704418
+亢龙有悔 11.1280889297
+含混不清 10.9049453784
+纳莫埃 13.2075304714
+冲进 8.92394390956
+伊洛瓦底江 10.533381822
+冲过 9.63799777493
+大梦 11.1926274509
+丽水地区 11.7034530746
+打过架 12.5143832909
+红五军 13.2075304714
+拖男带女 12.1089181827
+处变不惊 11.7034530746
+羊杂 12.8020653633
+必死之心 12.8020653633
+乍见 11.4157710022
+战术 7.0883325578
+肉弹 13.900677652
+致害 13.2075304714
+服务社 11.8212361103
+战机 8.26232298264
+借书证 13.900677652
+熏香 12.2912397395
+一块钱 9.93038573842
+寻常百姓 11.0103058941
+检查单 12.2912397395
+口算 13.900677652
+李侃 12.8020653633
+宫笺 12.1089181827
+石湾陶 13.2075304714
+便尿 13.900677652
+中泉 13.2075304714
+公担 13.900677652
+雾都 11.2616203224
+叛党 12.8020653633
+拉克特 13.900677652
+冯惟 13.2075304714
+习孔教 12.5143832909
+杰士卡 12.5143832909
+岩山 11.4157710022
+司天太监 12.8020653633
+浏河 10.8096351986
+断代史 10.2897597393
+阿衡 12.5143832909
+军民一致 12.1089181827
+扶养 10.765183436
+叛兵 12.8020653633
+男中音 12.5143832909
+河东 8.13235665618
+积垢 11.7034530746
+化学电池 11.2616203224
+摇控 13.900677652
+修持禅 13.2075304714
+汉白玉石 12.8020653633
+幸福观 13.900677652
+瓦特 9.56994431169
+思议 12.8020653633
+毛猴子 13.900677652
+臻于 10.0505300503
+罗布森 13.900677652
+亚特兰 13.2075304714
+粪卟啉 13.900677652
+太康兄弟 12.8020653633
+剧展 13.900677652
+马扎罗 12.5143832909
+庙湾 12.8020653633
+杰罗姆 12.5143832909
+答应下来 11.0103058941
+江泉实业 12.1089181827
+加合物 12.2912397395
+公投 12.5143832909
+志向 9.94943393339
+商用机 13.900677652
+魏德林 13.2075304714
+玉化 12.2912397395
+公折 11.1280889297
+春节快乐 13.900677652
+沙市区 12.1089181827
+公报 8.9308643524
+煽起来 12.5143832909
+成果奖 11.598092559
+急病 10.9562386728
+急症 11.0674643079
+固阳县 12.5143832909
+亲子鉴定 11.3357282945
+鲜血 7.6701962044
+救捞 12.5143832909
+克钦邦 12.8020653633
+冲车 12.1089181827
+陈涉 11.5027823792
+指桑骂槐 10.9562386728
+循例 11.0103058941
+帮困 12.8020653633
+祝福声 12.8020653633
+土种 12.8020653633
+冷镦 12.2912397395
+田黄 11.4157710022
+靓丽 9.4233408375
+多毛类 11.9547675029
+当阳 9.62401153296
+低哑 12.2912397395
+组歌 12.8020653633
+荚果 10.2630914922
+文台 12.1089181827
+共处 9.96885201925
+掩口而笑 13.900677652
+海国 11.0674643079
+陈白露 13.900677652
+刺戳 13.900677652
+韩岩 13.2075304714
+丕变 13.900677652
+莫护跋 13.2075304714
+木子 12.2912397395
+猪狗 10.3743171274
+叶状体 11.2616203224
+投票表决 11.0103058941
+健全 7.56562340048
+雷分兵 12.8020653633
+张三之 13.2075304714
+宗藩封 12.8020653633
+吴彦祖 13.2075304714
+张志诚 13.900677652
+缓冲期 11.9547675029
+一山一水 12.2912397395
+奏国歌 13.900677652
+扩容 6.93748766611
+牢骚满腹 11.8212361103
+接踵 10.4349417492
+扩宽 11.8212361103
+利福 11.9547675029
+张三丰 11.8212361103
+雨田 13.900677652
+张志让 12.5143832909
+搀前落后 13.900677652
+隐忧 8.79473217808
+续齐谐 12.8020653633
+一二声 13.900677652
+故名思义 13.900677652
+掷弹 12.2912397395
+合板 12.2912397395
+初年 7.63347710343
+马里兰州 11.4157710022
+瀚海 10.9049453784
+初平 10.4349417492
+老命 9.75754292558
+代收费 11.4157710022
+冷锋 10.8561552143
+雌性 8.78268383956
+良心谴责 12.2912397395
+马尔蒂 13.2075304714
+丁卯年 13.900677652
+另附 11.5027823792
+卫生性 13.900677652
+隐忍 10.1394775363
+冯翊 11.3357282945
+形销骨立 12.5143832909
+冷门 10.0720362555
+特穆尔 11.9547675029
+行楷 12.8020653633
+冲退 13.2075304714
+善化 11.8212361103
+七老八十 11.9547675029
+莱山 11.9547675029
+阿非 11.7034530746
+叛乱 7.53592689512
+明尉氏 13.2075304714
+三五分 12.8020653633
+抑恶扬善 13.900677652
+共妻 12.1089181827
+注册资本 8.0484751722
+扩孔 11.8212361103
+商务调查 13.900677652
+寿序 13.900677652
+违令 10.604840786
+起笔 10.2630914922
+皮诺切特 12.8020653633
+寿庆 13.2075304714
+荒野 9.41204128224
+兰亭序 11.0674643079
+光污染 11.4157710022
+兼弱攻昧 13.900677652
+六组 13.2075304714
+莱尔 11.1926274509
+寿延 13.900677652
+六经 9.80633308975
+英德红 12.2912397395
+给料机 13.900677652
+隐形 8.98802276624
+全局变量 11.8212361103
+神聊 12.5143832909
+松仁 11.0674643079
+神职 11.1926274509
+名扬天下 11.4157710022
+单一性 11.7034530746
+邓少剡 13.900677652
+陇南地区 12.8020653633
+局量 13.900677652
+圣塞瓦斯蒂安 12.1089181827
+阿霞 13.900677652
+郑拓 12.5143832909
+哈巴德 11.4157710022
+掩耳 11.7034530746
+斯巴鲁 11.2616203224
+莱尼 11.5027823792
+初建 10.0294766411
+官田地 13.2075304714
+丧葬费 11.4157710022
+巉岩 11.8212361103
+导出单位 11.7034530746
+被动式 9.85762638414
+排列组合 11.7034530746
+怅然 10.765183436
+当雄 11.1280889297
+冒头 11.4157710022
+身受其害 12.8020653633
+冒失 9.87532596124
+圣米格尔 12.2912397395
+兽欲 12.5143832909
+阿雷 12.1089181827
+精良 9.33632946051
+王经理 10.9562386728
+孢蒴 10.8096351986
+锄禾日当午 12.8020653633
+战神 10.1871055853
+初开 11.5027823792
+孔家庄 13.2075304714
+顾章 12.8020653633
+陶宏开 12.5143832909
+郑王爷 13.900677652
+口服液 10.765183436
+掌纹 11.9547675029
+采育 11.7034530746
+市升 13.900677652
+东方电机 13.900677652
+别住 12.2912397395
+皇城根 13.2075304714
+惠文君 12.5143832909
+善加 12.8020653633
+云母粉 12.8020653633
+战祸 10.2630914922
+阿雅 8.62767809341
+不多不少 10.642581114
+恒等 11.9547675029
+羊祜 10.642581114
+阿难 10.2630914922
+郑捷 12.8020653633
+急步 10.642581114
+总务长 12.5143832909
+三五句 12.5143832909
+服务期 12.8020653633
+高中档 12.2912397395
+刘子业 13.900677652
+勘察 8.83808261895
+急死 11.598092559
+沿用 7.89432449237
+韭菜 9.11318590919
+冲量 10.2371160058
+相搏 10.6818018271
+雒邑 12.5143832909
+那小官 12.2912397395
+拉克沙 13.900677652
+柜橱 13.2075304714
+起立 9.05649056552
+出现意外 10.2371160058
+威斯 10.7226238216
+阿隐 11.4157710022
+枪杀案 11.0674643079
+净化器 11.0103058941
+阿隆 11.9547675029
+全盛时代 11.9547675029
+起站 13.2075304714
+猪獾 13.900677652
+干扰信号 12.5143832909
+中信实业银行 12.8020653633
+关进来 12.1089181827
+塑模 12.8020653633
+兰姆 10.765183436
+仲达之 12.8020653633
+统一战线 8.81308131674
+裸女 11.5027823792
+起稿 11.4157710022
+食文化 13.900677652
+那小子 9.6811699468
+汇编器 13.2075304714
+木地板 9.93038573842
+地域类型 13.900677652
+起程 9.0884932966
+假若 9.10488710638
+卢西坦 12.5143832909
+动车组 9.74179456862
+阮瞻 13.2075304714
+赫雷罗 12.1089181827
+漆过 12.5143832909
+阿附 10.7226238216
+生物化学 9.04086524761
+跨音速 12.1089181827
+荒郊 11.4157710022
+得奖者 12.5143832909
+决定 4.74701345719
+至高 11.1280889297
+一片空白 9.69598503258
+展云族 13.2075304714
+松静 12.5143832909
+狼崽子 12.1089181827
+王命东 12.8020653633
+卓有成效 9.65218240993
+哥特式 9.84023464143
+莫拉桑 13.2075304714
+钩虫 11.4157710022
+公司简介 11.7034530746
+鸟类学家 12.8020653633
+猪猪 13.900677652
+猪猫 13.2075304714
+生物入侵 11.8212361103
+违例 11.8212361103
+俄军方 12.2912397395
+豆奶粉 13.900677652
+科技推广 13.900677652
+家累 13.900677652
+青海省人民政府 12.8020653633
+三五千 11.598092559
+行栈 12.8020653633
+三五十 10.604840786
+衔环结草 13.2075304714
+新闻周刊 9.74179456862
+洛邑曾 12.8020653633
+一千零六十三卷 13.2075304714
+法国参议院 13.2075304714
+青黑色 11.8212361103
+紧绷着 10.9049453784
+狗蛋 9.7898037878
+百足之虫 11.8212361103
+国玺 10.8096351986
+心痒难挝 13.900677652
+阿门 11.1926274509
+大庆路 13.2075304714
+卫生所 10.765183436
+帅旗 11.0103058941
+红棋 12.5143832909
+顾秘 12.2912397395
+张刘陈 13.900677652
+始皇 9.16447920358
+萦绕 10.4041700905
+心痒难挠 12.2912397395
+蚕桑 9.25628675283
+白木耳 11.4157710022
+大连实德 13.2075304714
+流通性 10.5684731418
+领奖台 11.8212361103
+公署 9.55687223012
+陆谷孙 13.900677652
+苏秉琦 12.1089181827
+胡校长 10.604840786
+安全工程 11.7034530746
+施釉 11.4157710022
+国王 6.48369803059
+笑而不答 10.4041700905
+船用 9.93038573842
+于宣抚 13.900677652
+弓长岭区 13.900677652
+籍为民 11.9547675029
+抗拒性 13.900677652
+结晶学 11.5027823792
+小家伙 9.62401153296
+边界问题 10.642581114
+寿山 9.96885201925
+各项规定 10.765183436
+吓瘫 12.8020653633
+各路人马 11.9547675029
+东拉西扯 10.8096351986
+消得人 13.2075304714
+牢狱 10.1394775363
+熏蒸 10.9562386728
+郑恩 13.900677652
+戴出 13.900677652
+基建工 11.7034530746
+行侠仗义 12.2912397395
+钩藤 11.1280889297
+当是 9.31571017331
+畏葸不前 12.8020653633
+扬帆远航 13.900677652
+内宫城 13.900677652
+采菱 13.900677652
+罗湖 11.5027823792
+汉置平 12.5143832909
+秋收冬藏 13.2075304714
+莫胡疑 13.2075304714
+六米 12.2912397395
+共学 12.8020653633
+起租 11.598092559
+年月日时 12.8020653633
+网前球 13.2075304714
+冷霜 13.900677652
+肝部 12.5143832909
+六类 11.0103058941
+决堤 10.3453295905
+小剂量 11.0103058941
+行步 11.598092559
+行止 9.84023464143
+神舟 11.5027823792
+沔阳 10.0720362555
+唐宋八大 13.900677652
+主要演员 9.40086798165
+白匀环 12.8020653633
+七龙珠 13.2075304714
+未可知 9.28555713513
+六粒 13.900677652
+延日久 11.5027823792
+共守 11.8212361103
+兼毫 12.8020653633
+修鞋匠 12.8020653633
+采茶 8.45394028031
+霍金如 13.900677652
+战端 11.598092559
+科层制 12.1089181827
+错误代码 13.2075304714
+木姐 13.900677652
+亚基斯 12.5143832909
+已知 7.25298927841
+维塔利 13.2075304714
+无解 11.0103058941
+公翰 12.8020653633
+萨拉森人 11.7034530746
+房产纠纷 12.5143832909
+歹徒 9.54396882529
+戎举兵 12.8020653633
+采砂船 13.900677652
+当铺 9.71102290995
+宗教法 13.2075304714
+钓鱼人 11.4157710022
+检查仪 12.8020653633
+木槿花 12.1089181827
+公羊 10.4041700905
+张一光 10.2630914922
+郑惠 11.4157710022
+莱布 13.900677652
+家舍业 12.2912397395
+隔周 13.2075304714
+卡罗尼河 12.8020653633
+行款 10.9049453784
+剿除 10.2371160058
+歹念 12.2912397395
+莱希 12.8020653633
+扩大 5.33660087466
+会计工作 11.9547675029
+冥顽 12.2912397395
+出众 8.75901409547
+共对 11.4157710022
+神色 7.05799436974
+先验概率 13.900677652
+自然衰减 12.8020653633
+弘农王 12.8020653633
+采药 9.94943393339
+宣宗遂 12.8020653633
+脂肪组织 10.642581114
+中共中央 7.54804825566
+喜地欢天 13.900677652
+章京中 13.900677652
+思霞 12.5143832909
+道爷 13.900677652
+任北平 10.4994802703
+坑农 12.2912397395
+顽固性 11.0674643079
+面目可憎 12.5143832909
+塞尔维亚 9.17328983326
+晶系 9.40086798165
+战策 12.5143832909
+郁生 13.2075304714
+竞标 9.19114745066
+起碇 13.900677652
+品脱 12.8020653633
+罗田县 13.900677652
+木塞 12.8020653633
+乳黄色 11.3357282945
+曹兵势 12.2912397395
+躁动不安 11.1926274509
+木塑 13.900677652
+木塔 10.4349417492
+归附 8.69119149913
+何振梁 12.8020653633
+闾破楚 12.8020653633
+狐狸皮 12.1089181827
+肝醣 13.900677652
+师事 9.89334446674
+归降 9.04864738806
+差错率 12.5143832909
+沿着 6.98000614773
+采苗 12.5143832909
+必将会 11.0674643079
+画十字 13.900677652
+服役期 10.7226238216
+亚尔公 13.900677652
+宦游 12.2912397395
+森林经理 13.900677652
+富而好礼 13.900677652
+助力车 10.533381822
+季玉 12.8020653633
+甲寅年 12.8020653633
+打呼噜 11.2616203224
+身陷囹圄 10.8096351986
+楼宇烈 13.2075304714
+杨俊转 13.2075304714
+天然树脂 11.5027823792
+徐爵朝 13.2075304714
+利法尔 12.8020653633
+一二寸 13.900677652
+生死予夺 13.900677652
+莱德 12.1089181827
+扩增 11.1280889297
+诸家词 12.8020653633
+逆耳之言 12.8020653633
+循化 11.0103058941
+归队 10.4349417492
+持刀动杖 13.900677652
+晶粒 10.2897597393
+浓墨 10.604840786
+候机室 11.7034530746
+月息 11.1926274509
+武艺超群 12.2912397395
+依那普利 13.900677652
+崎岖难走 13.900677652
+陪礼 11.4157710022
+威权 9.77354326693
+国父 11.4157710022
+口杯 13.900677652
+扩大开放 10.8096351986
+悉尼湾 13.900677652
+盛有生 13.900677652
+放暗箭 13.2075304714
+冷雨 11.8212361103
+闽东南 11.4157710022
+好几下 11.8212361103
+共同任务 12.8020653633
+脸上 5.71477017049
+卢文佐 13.2075304714
+不幸者 12.8020653633
+孙策卒 13.2075304714
+甘卫二 13.2075304714
+间皮瘤 12.2912397395
+纳鞋 13.900677652
+二万户 12.5143832909
+归集 11.1926274509
+露阴癖 13.900677652
+比兰德拉 12.8020653633
+彭丽媛 13.900677652
+直通车 11.1280889297
+侏罗 10.9562386728
+食不果腹 12.5143832909
+和解少阳 11.598092559
+吃请 11.598092559
+两省区 11.9547675029
+非技术性 13.2075304714
+晏海中 13.900677652
+盖尔范 12.5143832909
+股价指数 10.4666904475
+历官馆 13.2075304714
+兰宝 13.2075304714
+陪祭 11.1926274509
+木墩 11.1280889297
+等米下锅 12.2912397395
+悉尼港 11.8212361103
+威望 8.70218062071
+相斥 11.7034530746
+熟烂 11.8212361103
+鄂木斯克 11.4157710022
+寿州 11.2616203224
+木墙 13.2075304714
+归隐 10.0940151622
+彼尔姆 10.642581114
+口服 8.50251495046
+搬回来 11.7034530746
+生死攸关 10.4994802703
+圆弧状 12.5143832909
+死难者 11.1926274509
+凤阙 12.5143832909
+牛肉汤 12.8020653633
+精神抖擞 9.85762638414
+蒙大拿州 11.9547675029
+隐居 8.36334338496
+自得其乐 11.0674643079
+景臣 12.8020653633
+挑明 9.72629038208
+环境部 12.1089181827
+麻醉性 12.5143832909
+拉下水 13.2075304714
+向汝宁 12.8020653633
+太空时代 13.900677652
+大三和弦 12.8020653633
+思通 13.2075304714
+冷酷 9.20019728618
+崆峒岛 11.9547675029
+宝蕴楼 13.900677652
+始点 11.8212361103
+商船队 10.765183436
+易建联 11.9547675029
+贝托莱 12.8020653633
+冒尖 11.3357282945
+兰山 11.8212361103
+公祭 10.9562386728
+二百次 13.900677652
+兰屿 10.604840786
+肥沃 7.72481038187
+月末 7.19503855712
+肖艳 12.2912397395
+冷酒 11.7034530746
+沙生针 11.1280889297
+兼济 11.5027823792
+古城墙 10.8096351986
+学龄期 12.5143832909
+郑明 12.5143832909
+汉密尔 12.5143832909
+失去平衡 10.1630080337
+阿森纳队 13.900677652
+西德马克 13.2075304714
+上周末 8.12923652885
+郑智 12.1089181827
+电子陶瓷 13.2075304714
+昌迪加尔 12.2912397395
+摩尼教 9.96885201925
+猪皮 11.8212361103
+兰封 11.8212361103
+赵孝成 12.2912397395
+抹脖子 11.7034530746
+钻井泵 13.900677652
+交通部长 12.2912397395
+急湍 11.598092559
+倪文俊 11.9547675029
+反射光 10.4666904475
+巴比松 11.1280889297
+二百步 12.2912397395
+草珊瑚 11.9547675029
+应答如流 13.2075304714
+陪绑 12.8020653633
+兰尼 11.598092559
+司奇计 13.2075304714
+陆军部 10.4041700905
+循吏 10.642581114
+隐密 11.7034530746
+公社 7.49050277001
+候朝 13.2075304714
+公礼 12.2912397395
+公示 8.71889410168
+小富即安 13.2075304714
+郑卫之音 12.5143832909
+陪练 11.9547675029
+不来梅 11.0103058941
+古城堡 10.5684731418
+二百二十余年 13.2075304714
+公私 9.56994431169
+封平西 13.900677652
+斯托雷 12.1089181827
+国画 10.5684731418
+莱塞 12.2912397395
+科举 8.6966709649
+神州大陆 13.900677652
+尼山砚 13.2075304714
+二户 12.2912397395
+肥水 10.2371160058
+思邈 12.8020653633
+损毁 9.59661255877
+内心独白 11.2616203224
+兰峰 12.1089181827
+药草 10.9562386728
+肝阳 12.1089181827
+吹嘘 9.4233408375
+中国建材 10.6818018271
+荀慧生 11.5027823792
+中美洲 8.73019365694
+光四射 12.1089181827
+登账 13.2075304714
+银首饰 12.5143832909
+肖英 13.2075304714
+消极思想 12.1089181827
+公称 11.9547675029
+抹煞 11.2616203224
+木心 13.2075304714
+蔽野 11.7034530746
+于永嘉 12.5143832909
+反射亢进 12.8020653633
+谤议 12.2912397395
+稳定局势 11.3357282945
+急滩 11.8212361103
+马卡罗夫 12.1089181827
+露背装 13.900677652
+行洪 11.5027823792
+终点港 13.900677652
+混过来 13.900677652
+问柳评花 13.900677652
+平野阔 13.2075304714
+扩张 6.21681367172
+购买权 12.5143832909
+船王 12.8020653633
+猪瘟 11.8212361103
+一二层 13.2075304714
+心浮气躁 12.2912397395
+蔫蔫 11.1280889297
+超跌股 11.9547675029
+鼓掌声 12.2912397395
+演绎出 10.4666904475
+新纪元 9.82314020807
+过渡形式 11.3357282945
+查理四世 11.8212361103
+共工 10.4666904475
+起网 12.8020653633
+堰桥 13.2075304714
+国界 9.38981814546
+这么一来 9.74179456862
+木征 12.8020653633
+张汉微微 13.900677652
+官掌诏 12.5143832909
+槐米 13.2075304714
+扩建 7.54630761118
+行波 11.9547675029
+北票市 12.8020653633
+钩花 13.900677652
+去粗取精 13.900677652
+波峰焊 12.2912397395
+菊科 9.75754292558
+扩延 13.900677652
+欧修克拉 13.900677652
+月明 10.604840786
+隆武 10.642581114
+莱姆 11.2616203224
+郑屠那 13.900677652
+马来人 9.93038573842
+顾绣 11.9547675029
+钻井液 11.8212361103
+保险合同 10.533381822
+冷遇 9.6811699468
+喝斥 10.4666904475
+文同 12.2912397395
+半封建 9.93038573842
+刺有 13.900677652
+史略 10.765183436
+非同以往 13.900677652
+赶进去 13.2075304714
+候机 11.7034530746
+深思远虑 12.8020653633
+竞渡 10.3743171274
+比上不足 12.8020653633
+家酿 12.5143832909
+郑服 13.2075304714
+道理 6.45059808217
+动物交往 12.5143832909
+宋人林 13.2075304714
+居住者 11.2616203224
+海军工程大学 13.2075304714
+志于 13.2075304714
+井之法 13.2075304714
+胡萝卜汁 12.2912397395
+六等 11.1280889297
+单复变 11.9547675029
+浮世绘 11.4157710022
+念颂 12.5143832909
+共居 11.598092559
+被告席 11.9547675029
+嚎天动地 13.900677652
+男娃 11.0103058941
+毛淡棉 11.8212361103
+从盘庚 13.2075304714
+归途 9.96885201925
+康梁 10.9562386728
+乾女儿 13.900677652
+刺杀 8.81927328699
+滑辣 13.2075304714
+起绉 12.8020653633
+拜尔公司 11.1926274509
+初学 9.89334446674
+起绒 12.2912397395
+石梁宽 13.900677652
+国债资金 12.8020653633
+打圈子 12.8020653633
+云水怒 12.8020653633
+索超箭 13.2075304714
+绣衣 11.2616203224
+语辞 13.2075304714
+寿宴 11.1280889297
+兰州 8.0746775446
+初定 10.1394775363
+帖子 8.28390655431
+假警察 13.900677652
+冲销 10.533381822
+频繁 6.76181065203
+色情图片 12.2912397395
+轻重失宜 13.900677652
+决心 6.84450236788
+临界阻尼 13.2075304714
+冲锋 9.09665660724
+志书 11.4157710022
+汽车产业 9.24671730182
+有效值 11.2616203224
+郑林 13.2075304714
+防守 7.81163277653
+一亿五千万 13.2075304714
+诸宫典 13.2075304714
+三资 11.9547675029
+结实率 11.9547675029
+莱奥 12.5143832909
+柔韧性 11.3357282945
+国球 13.900677652
+狗腿 11.598092559
+墩布 13.2075304714
+徐志摩 11.5027823792
+看个够 11.9547675029
+寿宁 12.2912397395
+典试 12.8020653633
+安亭镇 12.8020653633
+扑朔 13.900677652
+六篇 10.8096351986
+寿寺 11.5027823792
+夏州东 13.2075304714
+峰会 7.54630761118
+肖莉 11.7034530746
+捕虏体 13.2075304714
+狗脊 12.1089181827
+窗扉 13.2075304714
+嘉陵江 9.0884932966
+思量 8.70218062071
+冻疮 10.9562386728
+正确理解 10.4349417492
+未留 12.5143832909
+郑某 11.1280889297
+刺柏 12.8020653633
+柔肠寸断 13.900677652
+辛酉日 13.900677652
+木床 11.9547675029
+瞥一眼 11.0674643079
+口感 9.5186510173
+不知疼痒 13.900677652
+冠状 11.1926274509
+莱夫 12.5143832909
+智商 9.62401153296
+志丹 11.1926274509
+水煮开 13.2075304714
+那枝戟 12.8020653633
+文教部 13.900677652
+凉伞 13.900677652
+毛宗岗 12.5143832909
+东成西就 13.900677652
+酒中仙 13.2075304714
+阳水吉 13.900677652
+严颜军 13.2075304714
+文不对题 12.5143832909
+荧荧 11.0674643079
+共开 13.900677652
+帮会 11.1280889297
+桓逸 13.2075304714
+社中 12.1089181827
+柳林中 13.2075304714
+洪洞县 11.0103058941
+吴学周 13.2075304714
+问及此事 12.5143832909
+弯腰驼背 13.2075304714
+仲华你 12.8020653633
+采螺 11.3357282945
+阿金 11.0103058941
+萧让照 13.2075304714
+公筷 12.8020653633
+当选 6.75943252963
+阿里 8.10158499752
+积为 13.2075304714
+叹喟 12.8020653633
+验明正身 12.2912397395
+另选 10.9049453784
+康恩贝 10.5684731418
+戴花翎 12.5143832909
+十七篇 12.8020653633
+牙菌斑 13.900677652
+积久 13.900677652
+肥满 12.5143832909
+柱石 10.9049453784
+录音 8.80692745117
+老学究 12.1089181827
+木栅门 12.1089181827
+宫道士 12.5143832909
+三四十艘 13.900677652
+盲谷 11.5027823792
+张元济 11.7034530746
+火工 12.2912397395
+熏肉 11.9547675029
+当道 9.85762638414
+长须鲸 12.2912397395
+月数 12.2912397395
+帮佣 12.5143832909
+好坏不分 13.900677652
+积习 10.7226238216
+翁牛特 12.8020653633
+阿莱维 12.8020653633
+漠北 8.71329184614
+服务性 9.94943393339
+铁氰化钾 12.8020653633
+新会市 12.5143832909
+成小丁 13.2075304714
+屠城之 13.2075304714
+驾驭者 12.5143832909
+上周日 10.642581114
+共得 10.6818018271
+慈悲为怀 11.8212361103
+王母灵芝 13.2075304714
+采蜜 11.598092559
+洁身自好 10.7226238216
+六碗 12.5143832909
+佟麟阁 11.598092559
+干休 10.9562386728
+丰水年 11.3357282945
+社交 9.35738286971
+万象市 13.900677652
+积云 11.7034530746
+木工 9.61021821083
+战绩 8.87679713113
+自贡人 13.900677652
+防寒 10.4041700905
+口才 9.80633308975
+冲阳 12.8020653633
+法律依据 9.96885201925
+臭皮匠 13.900677652
+避祸 10.2371160058
+登封县 10.8561552143
+经济之才 13.900677652
+柳湘莲 11.1926274509
+望梅 13.900677652
+和润叶 10.0294766411
+观测网 11.598092559
+周大娘 12.8020653633
+阜财 13.900677652
+情感世界 12.1089181827
+基建处 13.2075304714
+咬定牙关 12.2912397395
+挥砍 13.900677652
+救穷 13.2075304714
+撞到 10.0940151622
+克莉斯蒂 13.2075304714
+搂住 8.6966709649
+期货经纪 10.1394775363
+文艺活动 11.0103058941
+采蝇 12.8020653633
+一二年 10.4349417492
+十一点多 11.7034530746
+存贮 9.93038573842
+西萨摩亚 10.9049453784
+大白兔 11.7034530746
+从母 12.8020653633
+挑挑 12.8020653633
+数千海里 13.2075304714
+商妥 13.900677652
+蚕沙 12.1089181827
+气候宜人 9.94943393339
+催生出 11.2616203224
+开进去 13.900677652
+郁热 12.1089181827
+马氏体 11.4157710022
+许世友 11.8212361103
+韭葱 13.2075304714
+战线 8.39941944143
+警报声 11.0103058941
+慈仁者 13.2075304714
+未用 10.7226238216
+月饼盒 11.5027823792
+伺机 9.12999302751
+马尔菲 12.8020653633
+帮上 10.7226238216
+屯田客 12.2912397395
+女贞子 11.0103058941
+初夜 13.900677652
+吨数 12.2912397395
+木山 12.2912397395
+天义站 12.5143832909
+妒火中烧 13.2075304714
+乔舒亚 13.900677652
+海岸边 11.4157710022
+里斯基 13.900677652
+寿夭 11.598092559
+革命者 8.99540287354
+界石 11.9547675029
+风景迷人 13.2075304714
+测出 9.23723855786
+挑拨 9.96885201925
+初夏 9.37888907493
+战网 12.8020653633
+废水 9.63799777493
+接着就是 10.642581114
+社会 4.48952114057
+吸烟者 10.4349417492
+贾布里 13.900677652
+挑拔 13.900677652
+电子书籍 13.900677652
+陆子静 13.2075304714
+木屐 11.0674643079
+木屑 10.2897597393
+格斗者 13.2075304714
+木屋 10.2897597393
+长葛市 11.8212361103
+挑担 9.71102290995
+全河 10.604840786
+六礼 12.2912397395
+伴侣 9.4233408375
+生物化工 12.8020653633
+义乌市 11.598092559
+敬业精神 13.2075304714
+道白 11.3357282945
+善哉 10.5684731418
+先导性 12.1089181827
+算不算 9.87532596124
+唯美派 12.8020653633
+国相 10.8096351986
+乌隆迪 13.2075304714
+道路网 11.3357282945
+六祖 11.9547675029
+梅岭山 13.2075304714
+风和日暖 12.5143832909
+加韦拉 12.8020653633
+隐士 10.1394775363
+六神 12.8020653633
+夫妇关系 12.2912397395
+芍药居 13.2075304714
+黑粉菌 12.1089181827
+永不变心 12.8020653633
+口授 9.98865464655
+阴河横 11.9547675029
+里姆斯基 11.3357282945
+凤凰山 9.72629038208
+欢乐地 11.9547675029
+狗血淋头 11.7034530746
+装子弹 12.1089181827
+急流 8.80692745117
+木尔 11.9547675029
+收税人 12.2912397395
+钢之家 11.9547675029
+美国防 13.2075304714
+坚劲 12.5143832909
+剑川县 12.8020653633
+午餐时间 12.2912397395
+顾果字 13.2075304714
+另配 12.5143832909
+善后 9.37888907493
+于阗侯 13.2075304714
+伊萨科夫 13.2075304714
+虞舜 10.9049453784
+结晶度 11.2616203224
+卫葑和 11.4157710022
+愁容满面 12.2912397395
+吃过 8.32472854883
+公立 9.74179456862
+冲霄 12.2912397395
+兰心 12.2912397395
+关上门 10.1394775363
+亭子 8.74162235276
+共庆 12.2912397395
+门中跃 13.900677652
+根深蒂固 9.45802639549
+向火 11.4157710022
+或早或晚 12.5143832909
+柽柳 10.1871055853
+摩挲 9.91169360541
+饿虎 11.1926274509
+交叉处 11.3357282945
+双塔区 13.2075304714
+阿道 13.2075304714
+海浮石 13.900677652
+帮人 10.533381822
+凉亭 10.1871055853
+郑文 11.8212361103
+皮尔森 12.1089181827
+羊群 9.75754292558
+凤凰岭 12.2912397395
+安尼克 13.900677652
+七八成 11.3357282945
+蓝天白云 11.0103058941
+四星期 13.900677652
+六种 9.85762638414
+轻便车 12.5143832909
+盛于明 12.8020653633
+通过鉴定 12.2912397395
+六科 10.3453295905
+操作工 12.5143832909
+尚有余 11.9547675029
+撇下 9.36807815882
+初始 8.30969067146
+仰躺着 12.1089181827
+胡塞尔 11.4157710022
+社保 7.42216800977
+西禅寺 12.8020653633
+塞康第 13.900677652
+挑战 6.59280487121
+共建 9.35738286971
+零用钱 10.7226238216
+海蛎子 13.900677652
+手拉手 10.7226238216
+赫格隆 11.0674643079
+王定庆 13.900677652
+当量 9.31571017331
+古城子 12.5143832909
+摇篮 9.05649056552
+十八两个 13.900677652
+美妇人 12.5143832909
+园艺 9.43476953332
+没得说的 12.8020653633
+斗斗嘴 12.8020653633
+废丝 12.8020653633
+历其境 13.900677652
+韩木 13.900677652
+王晓龙 13.900677652
+木卫 11.7034530746
+操纵自如 11.7034530746
+晶石 11.8212361103
+男宾 12.8020653633
+丰骨劲 13.2075304714
+公畜 13.900677652
+米耶勒 13.2075304714
+景才瑞 12.5143832909
+有志于此 13.900677652
+冻硬 12.8020653633
+化为灰烬 10.3171587135
+战火 8.88339781516
+齐肩 13.2075304714
+繁文 12.5143832909
+节约粮食 13.900677652
+营养性 11.4157710022
+恒牙 12.1089181827
+橐驼 11.9547675029
+客气话 10.8096351986
+营队 11.7034530746
+扩及 10.4349417492
+木华 12.2912397395
+八仙过海 11.0674643079
+尾大难掉 13.900677652
+外果皮 11.2616203224
+福斯湾 12.8020653633
+小桶 11.5027823792
+分子量 9.02548032877
+口沫 13.2075304714
+氯化钙 10.9049453784
+后丹根 13.2075304714
+受虐 13.900677652
+墩台 10.5684731418
+铜兵 13.900677652
+共党 10.3743171274
+营院 13.900677652
+透进来 11.1926274509
+拉奥斯 12.8020653633
+战吕布 12.1089181827
+蔡公时 13.900677652
+木匣 10.1630080337
+木匠 9.05649056552
+拉克斯 11.4157710022
+司盐监 12.5143832909
+滚道 13.2075304714
+训斥 8.93783302172
+高开高 8.63281949291
+阿龙 12.1089181827
+精诚团结 12.5143832909
+小水滴 11.1280889297
+星相 10.642581114
+施塔姆 12.5143832909
+道祖 11.3357282945
+警报器 11.0674643079
+千方百计 8.67493097826
+决别 13.900677652
+被动型 10.2630914922
+皮尔本 13.900677652
+公田 10.0088573539
+界碑 11.4157710022
+六百 9.26594866375
+烟灰缸 10.642581114
+操作前 13.2075304714
+一个肚子 12.2912397395
+拉米雷斯 12.5143832909
+云水洞 12.5143832909
+国礼 11.7034530746
+共军 10.4349417492
+现在押 13.900677652
+木叶 11.9547675029
+心口相应 13.900677652
+卫生棉 13.2075304714
+石声汉 12.8020653633
+劳申伯 13.2075304714
+勇退 13.900677652
+悬疑剧 13.900677652
+胜券在握 11.7034530746
+西奥萨 13.900677652
+废人 10.4666904475
+里弗 13.2075304714
+凤凰县 11.7034530746
+檀木 10.0505300503
+另一方面 5.89731459335
+伞兵 8.82550383674
+伞具 11.7034530746
+臊气 11.8212361103
+武都东 11.9547675029
+领收 13.900677652
+道福 13.2075304714
+新绛 11.5027823792
+湾流 10.9562386728
+二百架 13.2075304714
+四方之志 13.2075304714
+吃肉 9.61021821083
+查继佐 10.4349417492
+阿鼻 13.2075304714
+调查小组 11.0674643079
+黄不拉 13.2075304714
+兰亭图 12.2912397395
+乌沉沉 12.8020653633
+初四 10.0505300503
+郁结 10.1394775363
+出席会议 8.84443184663
+剃须刀 11.5027823792
+天赐良缘 12.2912397395
+中央红军 10.0940151622
+出世 9.00283785202
+贾母灵 13.2075304714
+口水 9.07236391467
+当上去 12.8020653633
+冲顶 11.598092559
+急拉 11.0674643079
+人民音乐出版社 12.8020653633
+凤凰台 11.598092559
+体察民情 12.1089181827
+镶上 11.8212361103
+共出 10.7226238216
+空白支票 13.2075304714
+二成 10.1164880181
+罗道耳 13.900677652
+禹治理 12.8020653633
+训政 10.5684731418
+檀板 10.5684731418
+口气 6.37990123691
+增长势头 9.01032852375
+国仁代 12.8020653633
+由孝武 13.2075304714
+公明党 13.2075304714
+通州区 11.7034530746
+武选司 13.900677652
+熟稔 10.9562386728
+师淮扬 13.2075304714
+颜杲卿 11.8212361103
+道破 11.1280889297
+普渡大学 11.7034530746
+郑欣 13.900677652
+巧立名色 13.900677652
+艾德礼 11.3357282945
+兰克 12.5143832909
+兰光 11.3357282945
+史坦福 13.2075304714
+耸壑昂霄 13.2075304714
+崔伟 13.2075304714
+兰兰 11.7034530746
+行情 5.21847862598
+颠三倒四 10.7226238216
+狐狸精 10.765183436
+张开巨 13.2075304714
+阿默 12.2912397395
+蓟密区 12.8020653633
+隔得 11.4157710022
+兰兹 12.1089181827
+金融资本 9.41204128224
+汉道陵 13.2075304714
+梁溪 12.2912397395
+吃腻 11.2616203224
+后备干部 12.8020653633
+账项 13.2075304714
+公瑾 10.3743171274
+北至燕 12.1089181827
+海啸 8.35941410682
+白地 10.4994802703
+二十四万亩 13.2075304714
+公理 8.98069672615
+木刻 9.44633035572
+颇负盛名 10.8096351986
+西冈 13.900677652
+木制 8.85725253506
+哈加吉 13.2075304714
+十三艘 13.2075304714
+面向社会 10.0720362555
+策略性 11.0674643079
+农协会 12.8020653633
+刺死 10.3171587135
+观测点 11.1280889297
+有产阶级 11.0674643079
+魏皇帝 12.5143832909
+湾沟 13.2075304714
+反射层 12.1089181827
+泸定县 12.8020653633
+段干木 12.1089181827
+兰儿 11.0674643079
+冒充 9.12999302751
+邹平县 13.900677652
+公琰 12.8020653633
+拉尔夫 11.1926274509
+豁达 9.87532596124
+隔心 13.2075304714
+木勺 12.1089181827
+化成灰 12.2912397395
+吏部 7.82074445688
+牲畜 7.77599426108
+细读 10.8096351986
+无为县 13.2075304714
+出任 7.24781462262
+竞投 11.0674643079
+楞次定律 11.2616203224
+亡国奴 11.1280889297
+竞技 9.37888907493
+斯伯格 12.8020653633
+严命 11.9547675029
+拒敌 9.82314020807
+材料价格 12.5143832909
+保送生 11.3357282945
+西出 11.598092559
+塑成 11.4157710022
+恶毒地 12.1089181827
+冒冒 13.900677652
+木剌夷 12.2912397395
+后继无人 11.8212361103
+沙里淘金 13.2075304714
+救生 9.87532596124
+保安警察 13.900677652
+易荒闲 13.2075304714
+甜柿 13.2075304714
+威海 9.12155415886
+变凤凰 11.2616203224
+决口 9.19114745066
+三江侗族自治县 12.8020653633
+隔开 8.64318227995
+操作台 13.2075304714
+测器 13.2075304714
+杨稷横 12.8020653633
+挑水 9.26594866375
+曲江县 12.1089181827
+扩到 12.8020653633
+高等学校 8.44963919841
+一二八 11.0103058941
+冒出 7.99804431857
+芬克 11.9547675029
+老克腊 10.2371160058
+舍得 8.73589167805
+采血 11.0103058941
+独木舟 10.3453295905
+威洛 12.1089181827
+采行 11.8212361103
+令人神往 11.1926274509
+菲政府 13.900677652
+毒刑拷打 13.900677652
+永暑礁 12.5143832909
+初基 13.900677652
+越章王 13.2075304714
+美好前景 11.7034530746
+崔俊 10.642581114
+周琏 13.900677652
+刺毛 11.0103058941
+粗言 13.2075304714
+王仲丁 13.2075304714
+凝固点 10.6818018271
+独木船 13.2075304714
+恒王 12.1089181827
+班禅 10.0294766411
+南师大 13.900677652
+隔岸 10.7226238216
+急急 8.0985592766
+隐喻 10.1394775363
+急性 7.45495783259
+致仕 8.96620371885
+反射弧 11.4157710022
+镇平县 11.5027823792
+总该是 12.8020653633
+融洽 9.13850371718
+兽性 10.9562386728
+布鲁塞尔市 12.8020653633
+木公 12.8020653633
+十件事 12.2912397395
+玉素甫 13.2075304714
+模山范水 13.900677652
+提议者 13.900677652
+道符 13.2075304714
+凯地 13.900677652
+西凤 12.5143832909
+归齐 12.5143832909
+反射式 11.9547675029
+电流表 11.1926274509
+采访 6.12456217488
+济水 11.1280889297
+喔喔 12.2912397395
+索解 13.900677652
+初吻 12.8020653633
+卫王 12.1089181827
+女孩子家 13.2075304714
+墨义 12.8020653633
+纯小数 13.900677652
+字形码 13.2075304714
+工作勤奋 13.900677652
+秦巴 12.1089181827
+致以 10.7226238216
+王志东 12.5143832909
+摇篮曲 11.7034530746
+囤积 8.88339781516
+寿命 7.62403416263
+箱底 10.3743171274
+木儿 9.22784881751
+云母石 13.2075304714
+大补丸 13.2075304714
+吉列夫 11.7034530746
+瞿塘峡 11.0103058941
+致于 12.2912397395
+凡加恩 13.900677652
+公真 13.2075304714
+肝风 11.2616203224
+三五声 13.2075304714
+共印 12.2912397395
+扩军 11.0103058941
+致人 10.8561552143
+格丁根 9.75754292558
+孚日 10.0505300503
+三百四十三家 13.2075304714
+纳托夫 12.5143832909
+数学模拟 11.8212361103
+王志乐 13.2075304714
+贪多务得 13.900677652
+自造词 13.900677652
+兰利 12.5143832909
+刺桐 11.8212361103
+杨业随 13.2075304714
+名古屋 10.533381822
+见罪 11.0674643079
+刺梨 12.5143832909
+贝凯普 13.2075304714
+种甲胺 13.2075304714
+齐耳 11.598092559
+木凳 11.5027823792
+二百文 12.2912397395
+知更鸟 12.8020653633
+原络配穴 13.2075304714
+缓冲液 13.2075304714
+站岗放哨 11.598092559
+不光会 12.2912397395
+圣公会 11.1280889297
+特地 8.2985588311
+人际沟通 13.900677652
+夏末秋 11.1926274509
+养父母 11.598092559
+抱有 8.87023973058
+第九十五回 12.2912397395
+一二分 11.598092559
+承认 6.17755755971
+马格里 11.7034530746
+读书无用 13.900677652
+二百斤 10.765183436
+冒功 10.4349417492
+晶界 11.9547675029
+吃苦 9.25628675283
+解毒药 11.2616203224
+十年寒窗 12.2912397395
+结绳而治 13.2075304714
+致书 9.72629038208
+蒙古人民革命党 11.3357282945
+扩充 8.00352378434
+口湖 13.900677652
+藓类 11.3357282945
+渗灌 13.2075304714
+穆木天 12.8020653633
+芬兰 8.35160156708
+共取 12.1089181827
+褚遂良 10.2897597393
+缎条 13.2075304714
+张张合 13.2075304714
+士饱马腾 13.900677652
+出亡 11.8212361103
+南斯拉夫联盟 13.2075304714
+陈规陋习 13.2075304714
+雍正年间 10.1164880181
+军眷 12.2912397395
+伞包 12.8020653633
+口渴 8.9519177616
+穷困户 13.900677652
+千亿元 9.30555780184
+多万家 12.8020653633
+战犯 9.91169360541
+脱氢酶 10.9049453784
+陈小炮 8.88339781516
+口儿 10.9049453784
+时尚科技 13.900677652
+格努姆 13.900677652
+平顶山市 10.2371160058
+六瓶 13.2075304714
+夏景山 13.2075304714
+皮尔斯 11.4157710022
+早期教育 11.4157710022
+新纪录 10.4994802703
+义乌县 11.7034530746
+相投 8.4284069783
+隔层 11.7034530746
+争艳 13.900677652
+冷龙 13.900677652
+前期工作 10.1630080337
+西凉神 13.2075304714
+吃草 10.8096351986
+大红包 11.4157710022
+爱生恨 13.900677652
+初唐 10.0294766411
+掌声如雷 13.900677652
+共创 10.7226238216
+木偶 9.7898037878
+张君房 12.5143832909
+主持者 11.4157710022
+反比例 11.9547675029
+热讯 13.900677652
+一元二次方程 13.900677652
+马尔迪 12.1089181827
+移动用户 8.29120585679
+起点 7.49214886092
+莱城 13.2075304714
+神论 11.0674643079
+转变立场 12.8020653633
+船籍 13.2075304714
+软件产品 11.3357282945
+盖尔语 12.2912397395
+营销 7.20983537456
+菊石 10.5684731418
+兰卡 12.5143832909
+粒雪 11.9547675029
+总该有 11.2616203224
+六甲 9.84023464143
+易聚易 13.900677652
+目窗 13.2075304714
+分手时 9.91169360541
+致信 11.1280889297
+一二句 11.9547675029
+二居室 12.8020653633
+自说自话 11.1926274509
+至道 10.604840786
+隔巷 13.900677652
+一二只 13.900677652
+营长 8.27305653829
+候机厅 12.8020653633
+摇着 9.17328983326
+月桂 10.8096351986
+香甜可口 11.8212361103
+王禅兵 13.2075304714
+邓恩铭 11.9547675029
+国文人 13.2075304714
+中央广播事业局 13.900677652
+伯刘孔 13.900677652
+圣巴巴拉 13.2075304714
+文天详 13.2075304714
+十九首集 13.2075304714
+自食其果 11.1926274509
+司真定 11.7034530746
+六番 13.2075304714
+比萨斜塔 11.7034530746
+恩将仇报 11.1926274509
+质检员 12.1089181827
+李从军 12.2912397395
+锡山市 13.900677652
+事实清楚 10.9562386728
+谢天笑 13.900677652
+阿鲁 10.4994802703
+归理藩 13.2075304714
+天方教 12.8020653633
+往访国 13.900677652
+善本书 11.2616203224
+三五天 10.4666904475
+于艾陵 13.2075304714
+善堂 12.2912397395
+便帽 11.598092559
+共办 12.8020653633
+杭汉叹 13.2075304714
+徐达攻 13.2075304714
+塑性 9.02548032877
+吃菜 11.0103058941
+牢笼 10.8096351986
+隐含 8.93783302172
+已经 3.42054864564
+相扰 10.604840786
+白白净净 11.2616203224
+掌理 11.1280889297
+决出 11.0674643079
+典藉 13.900677652
+郑榕 12.8020653633
+典藏 11.5027823792
+加班加点 10.3743171274
+相扶 12.5143832909
+图片展览 13.2075304714
+亚基河 13.900677652
+黄河三门峡水库 12.8020653633
+圣殿山 13.900677652
+紧绷绷 11.3357282945
+结群性 12.8020653633
+带来不利 10.533381822
+国税 10.0294766411
+公相 9.87532596124
+行政处罚法 12.2912397395
+冒号 11.7034530746
+遗臭万载 13.900677652
+营门 10.533381822
+孔明止 12.5143832909
+井上靖 12.8020653633
+云岩寺 12.2912397395
+起火 8.69119149913
+他乡遇故知 11.598092559
+梅葆玖 13.2075304714
+陕西省考古研究所 13.900677652
+事故隐患 13.2075304714
+辐照 9.74179456862
+冒口 13.2075304714
+共勉 12.2912397395
+帅气 10.2897597393
+箱式 11.3357282945
+差一点 9.03314320152
+除此以外 9.48183704418
+一二十 10.9049453784
+感知机 12.5143832909
+求爱信 12.1089181827
+出云 12.1089181827
+法克斯 12.8020653633
+馊臭 13.900677652
+瑞恰兹 13.900677652
+人口增殖 12.1089181827
+致伤 10.9562386728
+刺槐 10.7226238216
+晶珠 12.8020653633
+麦康奈尔 13.900677652
+隐去 10.3743171274
+半波电位 13.2075304714
+善待 9.96885201925
+初创 9.71102290995
+路易斯维尔 12.5143832909
+槟城 11.1280889297
+神貌 12.1089181827
+风火轮 12.1089181827
+家庭副业 10.765183436
+多斯特 13.2075304714
+膝行而前 12.2912397395
+梁实秋 11.9547675029
+师仇 13.900677652
+行旅 11.0674643079
+迈开 9.71102290995
+三角函数 10.4349417492
+乌鲁克 10.8096351986
+高则诚 12.5143832909
+丹比 13.900677652
+巧得很 12.2912397395
+亢奋 9.24671730182
+六爷 12.1089181827
+乙醇胺 11.3357282945
+陈澄 11.8212361103
+汤姆逊 10.4994802703
+冒名 11.3357282945
+锋镝 12.1089181827
+沟造 12.8020653633
+兼收 11.0103058941
+六片 11.9547675029
+杭汉听 12.1089181827
+犯了罪 11.1926274509
+塞尔维亚族 13.900677652
+掌班 11.8212361103
+沟道 9.98865464655
+六版 12.5143832909
+吓破 10.5684731418
+跨进去 13.2075304714
+鱼鳞片 13.900677652
+善忘 13.2075304714
+共商 9.87532596124
+荔枝核 13.900677652
+生话 11.5027823792
+钱取利 13.900677652
+余大钧 13.2075304714
+行文 9.75754292558
+拉朋齐 12.5143832909
+朱安 13.900677652
+木土 12.5143832909
+一二品 12.5143832909
+伟大祖国 11.598092559
+笑不笑 11.598092559
+公然 8.4980002701
+罗马数字 11.4157710022
+锋锐 11.1280889297
+榴火 13.2075304714
+冷餐 11.9547675029
+粗心大意 10.4349417492
+拥进来 12.2912397395
+帆布鞋 13.900677652
+气海俞 13.2075304714
+国孙吴 11.9547675029
+白半黑 13.900677652
+瞻仰 10.0940151622
+母曹氏 13.2075304714
+狗血 11.8212361103
+增压风机 13.900677652
+公文书 12.5143832909
+塑机 13.900677652
+卫生法 12.2912397395
+神谕 11.7034530746
+斯蒂文森 12.1089181827
+行数 11.0103058941
+华北电力 13.900677652
+共为唇齿 13.900677652
+起眼 10.2630914922
+税收管理 11.4157710022
+西洛可 13.900677652
+智利 8.48903160012
+潜江市 12.5143832909
+设计院 10.2117981979
+冯班 10.0940151622
+胀满 10.533381822
+斯托默 12.8020653633
+沙州建 13.2075304714
+冻糕 13.900677652
+贝奈斯 11.598092559
+化铝锂 11.598092559
+一二名 13.2075304714
+上古时代 11.4157710022
+阿魏 12.1089181827
+潜望镜 9.35738286971
+北京王府井 11.7034530746
+顾着 11.9547675029
+羼杂 13.900677652
+采购 6.65217357961
+粉浆 12.2912397395
+西兵 11.8212361103
+吴泽霖 12.8020653633
+于永平 13.2075304714
+豆瓣酱 11.8212361103
+恪遵 11.2616203224
+扶灵 13.2075304714
+兼施 10.8561552143
+救灾 9.7898037878
+初登宝 12.2912397395
+徐家汇 8.90346537821
+里层 12.8020653633
+三五年 10.0505300503
+忠魂 11.598092559
+得志 10.3453295905
+红的铁 12.2912397395
+四通五达 13.900677652
+起着 8.06879517469
+木垒 11.0103058941
+洪椿坪 12.8020653633
+王成国 13.2075304714
+自收自支 12.5143832909
+龙栖凤 13.2075304714
+美国匹兹堡大学 12.1089181827
+坚决执行 11.4157710022
+亚瑟王 12.5143832909
+冷香 12.2912397395
+有所突破 9.7898037878
+隔宿 11.8212361103
+顾盼 10.1394775363
+卡诺循环 11.598092559
+起皮 12.2912397395
+雾色 13.900677652
+国家民航总局 12.5143832909
+国粹 10.604840786
+归顺 8.66956903512
+祈请 11.9547675029
+掌状 10.2371160058
+木器 9.82314020807
+满江红 10.8096351986
+起皱 12.5143832909
+赫位克 13.900677652
+隔室 13.900677652
+共同 5.51838822302
+昏乱 11.0674643079
+柯尔莫 11.4157710022
+吴设司 13.2075304714
+色偏振 13.900677652
+冯牧 12.1089181827
+军转办 13.2075304714
+陈鼎常 13.2075304714
+考古工作者 10.4666904475
+战略 5.75223198573
+肥料 8.60737282725
+扯后腿 13.2075304714
+冯特 10.8561552143
+隆礼洽 13.2075304714
+二百户 12.5143832909
+由恩格 13.2075304714
+利令智昏 11.5027823792
+任惕隐 13.2075304714
+乱摊 13.900677652
+孙二哥 13.2075304714
+翟朔 13.900677652
+月湖 11.8212361103
+交叉口 7.92179188707
+急板 12.8020653633
+冠生园 11.9547675029
+初十 10.2117981979
+晶状 12.5143832909
+阿骨 9.34680076038
+梨汁 12.5143832909
+进取精神 11.0103058941
+僚佐 12.1089181827
+文园 13.2075304714
+批准书 11.2616203224
+不着边际 10.4349417492
+奇才异能 13.900677652
+于河州 12.2912397395
+药膳 10.4041700905
+歌功颂德 10.1394775363
+郭中姚 8.39941944143
+环孢素 11.8212361103
+挑梁 13.2075304714
+磷酸化酶 11.9547675029
+中国铁道部 11.9547675029
+战甲 12.5143832909
+卡米拉 13.2075304714
+熊罴之士 13.900677652
+缔约 10.2117981979
+寿县 9.72629038208
+悍然不顾 13.900677652
+沙罗树 13.2075304714
+勇锐 12.2912397395
+西太后 11.4157710022
+欣逢 12.8020653633
+数据类型 12.2912397395
+莫生气 13.2075304714
+曹满仓 11.1926274509
+颜从彝 12.8020653633
+铁干里克 12.2912397395
+阿马 11.5027823792
+挂号处 13.2075304714
+莱克 11.0103058941
+蒲公英 10.4041700905
+共和 7.93453091285
+杜丽娘 11.8212361103
+康模 12.1089181827
+晶片 11.2616203224
+冷风 9.17328983326
+苦心人 12.8020653633
+曾护育 13.2075304714
+苦过 13.900677652
+树德务滋 13.900677652
+卜国可 13.2075304714
+有阳明 13.2075304714
+冷食 11.5027823792
+太孙 11.598092559
+耸了耸肩 11.598092559
+赫勒万 12.5143832909
+凤辣子 13.2075304714
+工伤事故 12.2912397395
+注塑机 13.900677652
+冷颤 10.765183436
+普埃布拉 12.5143832909
+寿司 11.8212361103
+怕得罪人 12.1089181827
+钱大昕 10.9562386728
+容光焕发 10.0505300503
+服务收入 11.4157710022
+地老鼠 12.8020653633
+分级管理 11.1926274509
+沟里 9.12155415886
+元鼎 10.2371160058
+颤栗 9.7898037878
+烦躁 8.47133202302
+和事老 13.900677652
+熟练 8.64840422393
+西充 11.8212361103
+初叶 9.71102290995
+肥效 11.598092559
+辛辣味 11.598092559
+六班 12.8020653633
+刺激 5.37313816851
+涂得红 12.8020653633
+展寿席 13.2075304714
+食品级 13.900677652
+食变星 12.1089181827
+始祖 8.89673134603
+北京华 12.2912397395
+认真仔细 13.2075304714
+国籍 8.75318317516
+托尼奥 13.900677652
+二扇 13.900677652
+离谱儿 12.1089181827
+单雄信 11.8212361103
+锋面 10.3453295905
+莱勒 12.8020653633
+采辑 11.598092559
+滚瓜烂熟 11.0674643079
+反潜机 10.8096351986
+营造 7.64109618791
+丁口转 13.2075304714
+阿剌兀 12.5143832909
+云南松 10.3743171274
+万丈红尘 13.900677652
+少年中国学会 11.598092559
+新龙县 13.900677652
+丁苯橡胶 11.3357282945
+班规 13.900677652
+上海邮通 13.900677652
+吸收谱带 13.900677652
+隔墙 10.4349417492
+毗连区 10.9562386728
+初值 9.7898037878
+恒瑞 13.900677652
+刘存厚 12.2912397395
+从今往后 9.61021821083
+宗教性 10.9562386728
+平展展 11.9547675029
+起疑 11.2616203224
+慈石之 13.900677652
+赖斯兰 12.8020653633
+国美 9.04864738806
+合欢树 12.2912397395
+生日卡 13.2075304714
+郑氏 10.7226238216
+界约 10.3453295905
+前些时 10.1630080337
+循常 13.2075304714
+美智子 13.900677652
+七八斤 12.8020653633
+甚轻 12.1089181827
+三维 8.79473217808
+隔声 10.7226238216
+采过 11.7034530746
+伞型 13.900677652
+胀气 11.8212361103
+栏外 13.2075304714
+界线 8.57766767284
+安全阀 11.9547675029
+非耕地 13.2075304714
+起病 9.12999302751
+王莽代 12.2912397395
+阿香 8.28027678626
+稍等一下 11.9547675029
+嚓嚓 10.6818018271
+操作员 10.1394775363
+孔明欲 13.2075304714
+公猪 11.9547675029
+月海 12.1089181827
+虞诩 12.8020653633
+魏景元 12.5143832909
+藏起 11.8212361103
+自然风景 10.8096351986
+海阔凭鱼跃 12.8020653633
+月浦 12.8020653633
+陈旧不堪 13.2075304714
+隔壁 8.21709788464
+泄私愤 12.1089181827
+居住证 12.1089181827
+文字处理 13.2075304714
+伯拦塔 13.2075304714
+阿姆斯特丹 9.53122979951
+莱特岛 13.900677652
+三官堂 12.8020653633
+检录 13.900677652
+耶律思轸 12.2912397395
+起用 8.31342899358
+起电 11.3357282945
+全淹 12.5143832909
+无力进攻 12.8020653633
+生杀大权 11.3357282945
+行板 12.5143832909
+冯燕 13.900677652
+韦维尔 12.8020653633
+冻结 7.99531580392
+珠翠 10.6818018271
+虎皮 9.49395840471
+野外求生 13.900677652
+卡诺定理 11.598092559
+被车撞 12.1089181827
+出死入生 13.2075304714
+视频压缩 13.900677652
+试题答案 12.2912397395
+泾川县 13.900677652
+第十九章 10.1394775363
+六点 9.96885201925
+发放贷款 9.4233408375
+郑泰 13.2075304714
+营部 9.96885201925
+力常数 13.2075304714
+玉冕 13.900677652
+刘郎浦 13.900677652
+三读 12.2912397395
+装盒 13.900677652
+电流计 11.9547675029
+莱切 13.900677652
+得力于 11.2616203224
+郑注 11.7034530746
+娘儿俩 9.44633035572
+雪仗 13.900677652
+黄寺 13.900677652
+第十四回 11.8212361103
+滚雪 12.8020653633
+三五层 13.2075304714
+冷藏库 12.5143832909
+水准面 10.765183436
+循序 11.1280889297
+种子仓库 13.900677652
+莱利 12.2912397395
+行期 11.2616203224
+滚雷 11.2616203224
+豁上 11.9547675029
+左顾右盼 10.3171587135
+充分行使 12.2912397395
+囤粮 12.5143832909
+利群岛 13.900677652
+毫不讳言 11.7034530746
+马尔诺 12.8020653633
+提克里特 13.2075304714
+公牍 11.7034530746
+孟达登 13.2075304714
+月氏 10.1164880181
+入幕之宾 13.2075304714
+左领军 12.2912397395
+录放像机 13.2075304714
+公牛 10.0088573539
+羊眼 11.7034530746
+阿飞 12.2912397395
+殷代甲 13.2075304714
+宋九儒 13.2075304714
+棋赛 13.900677652
+郑洛 12.5143832909
+食品类 10.642581114
+国无宁日 11.9547675029
+于静水 12.8020653633
+探照灯 8.95903522937
+秀色 11.1280889297
+一点余 13.900677652
+亭台 11.0103058941
+珍宝岛 11.0103058941
+兰坪 11.1280889297
+拉克拉 13.900677652
+郭祥越 12.8020653633
+背负式 13.900677652
+急流险滩 11.7034530746
+于静江 12.8020653633
+岗位补贴 12.8020653633
+别谋算 12.8020653633
+面向市场 10.6818018271
+心胆俱碎 13.900677652
+水鸟 9.96885201925
+兰圃 12.8020653633
+紫乌乌 12.8020653633
+纳托尔 13.900677652
+荒鸡 13.2075304714
+初元 12.1089181827
+卓异 12.1089181827
+唐尧虞 12.8020653633
+绣花 9.06439574502
+航空公司 7.76079309975
+江西人 11.8212361103
+神迹 11.0103058941
+初具 10.2117981979
+思想观念 10.4349417492
+抗美援朝 9.33632946051
+面折 13.900677652
+木吒 11.598092559
+双塔寺 12.5143832909
+国统 10.7226238216
+发人深思 12.2912397395
+吸吸 11.8212361103
+木合 13.900677652
+公爵 8.6803218269
+寿光 10.0505300503
+初六 9.61021821083
+燕破军 12.8020653633
+月池 12.8020653633
+漏子 11.0103058941
+急救 8.6803218269
+初八 9.6811699468
+公爹 11.3357282945
+阿顿 12.1089181827
+箱子 7.92432674268
+指示精神 11.1280889297
+珞珈山 12.5143832909
+绪论 12.1089181827
+沉甸甸地 12.5143832909
+化成白 13.900677652
+千亿吨 12.8020653633
+数字图像 12.2912397395
+拐卖妇女 13.2075304714
+光膀子 11.2616203224
+太光彩 12.5143832909
+公狗 12.1089181827
+钻井机 13.2075304714
+瓯海区 13.900677652
+隔天 11.5027823792
+波阵面 11.8212361103
+就事论事 10.8561552143
+左二营 13.900677652
+的歌者 13.900677652
+解开 8.0600359946
+加考释 13.2075304714
+扶出去 13.900677652
+隔夜 8.19356738723
+起球 12.2912397395
+威武 9.12999302751
+零零碎碎 11.1926274509
+卢西奥 13.900677652
+冲鼻 12.2912397395
+皮袋 11.0674643079
+赵合德 11.5027823792
+秀英 11.0103058941
+西宁市 10.3171587135
+苏丹共和国 11.598092559
+公狼 13.900677652
+夏邑南 13.2075304714
+水利 7.89432449237
+雷纹 12.8020653633
+王舍村 12.5143832909
+道绰 12.8020653633
+再生产 7.25819085061
+心明眼亮 13.2075304714
+糊口度日 13.900677652
+方以智 8.26232298264
+华安县 13.2075304714
+牢记在心 12.5143832909
+忠顺 11.7034530746
+宗李乾 11.3357282945
+每道菜 12.5143832909
+营里 9.65218240993
+寒苦 13.2075304714
+道统 10.5684731418
+后计 13.2075304714
+融水 9.00283785202
+彰化人 12.5143832909
+机器翻译 12.2912397395
+共图 11.0674643079
+志同道合者 12.1089181827
+学名 9.72629038208
+焦点网 12.5143832909
+道经 10.7226238216
+除夕之夜 11.5027823792
+行星 7.9817837977
+海员 10.1871055853
+云母片 11.9547675029
+满打满算 11.1280889297
+新锐 10.4994802703
+从桃 13.900677652
+假借 9.59661255877
+无妨 9.17328983326
+还要 5.30411890518
+天高云淡 11.9547675029
+二十份 12.8020653633
+精装本 13.900677652
+铁法市 12.2912397395
+少数几个 9.58318953844
+横振动 12.5143832909
+探幽 13.2075304714
+新干线 10.2371160058
+忍俊不禁 11.0674643079
+无如 11.1280889297
+有司 9.74179456862
+定性分析 10.4041700905
+休学在家 13.900677652
+励志 11.1926274509
+万具 13.2075304714
+安康路 13.2075304714
+度汛 11.7034530746
+电路 8.09554268306
+大学化学 11.0674643079
+苦不可言 12.8020653633
+笋子 11.9547675029
+倒要 9.28555713513
+可回复 13.2075304714
+串联 9.13850371718
+溜过去 12.5143832909
+列巴 11.9547675029
+同生死 11.0674643079
+二十亩 11.0103058941
+三废 11.4157710022
+斯提卜 13.2075304714
+远胜 10.4349417492
+分封制 10.2630914922
+制药 7.85804481829
+万余具 12.8020653633
+二十亿 12.1089181827
+戈尔 10.4041700905
+洛里昂 12.8020653633
+粟裕 10.604840786
+紫香 11.5027823792
+把薪助火 13.900677652
+送风机 13.900677652
+离乡背井 10.9049453784
+二十二 9.6811699468
+固执已见 13.900677652
+细水长流 11.0674643079
+环山公路 12.1089181827
+万余元 9.33632946051
+梁大将 12.5143832909
+倒角 12.8020653633
+李书华 13.2075304714
+小释 10.604840786
+右后卫 12.8020653633
+异士 11.9547675029
+依依不舍 10.1394775363
+赵王城 12.2912397395
+弓弦响 11.2616203224
+塞勒斯 13.2075304714
+二十五 9.0884932966
+消化道 8.85082164473
+波导波长 13.900677652
+斯莫尔 12.5143832909
+绞车 10.3171587135
+三度 9.77354326693
+业界 7.76511276089
+口腔医院 12.1089181827
+报社记者 13.900677652
+无夫 12.1089181827
+三幕 13.2075304714
+碗装 12.8020653633
+涅槃 9.41204128224
+老虎 7.96050639926
+举世公认 11.8212361103
+一字不易 13.2075304714
+远者 11.0674643079
+武邑县 13.900677652
+无头 9.09665660724
+鸭绒 11.9547675029
+砻谷 12.5143832909
+秦晋滇 13.2075304714
+程序法 11.1280889297
+张啸 13.900677652
+赵望云 12.1089181827
+检讨会 12.8020653633
+伏虎拳 13.2075304714
+丝状 9.11318590919
+蒙面人 11.7034530746
+无处 8.38322475551
+塑料 7.37564799413
+任景丰 12.2912397395
+储罐 12.5143832909
+万余册 12.1089181827
+三年 5.83384233756
+杀猪匠 12.8020653633
+工商企业 10.1394775363
+二十九 9.61021821083
+双重身分 11.598092559
+预备金 11.9547675029
+规范化 8.89673134603
+传下去 10.765183436
+德罗斯 11.9547675029
+三幢 12.8020653633
+气孔率 13.2075304714
+户口本 10.604840786
+柳树丛 12.5143832909
+宁海县 12.8020653633
+意下如何 10.1394775363
+达拉特旗 12.8020653633
+卡乌伊 13.2075304714
+丁当 11.1280889297
+二十个 9.04864738806
+居车儿 13.900677652
+二十两 9.77354326693
+少数几件 13.2075304714
+词目 12.2912397395
+入眠 10.765183436
+唐为敌 12.8020653633
+食用量 11.9547675029
+找到 5.66161232021
+邻人们 13.2075304714
+授职 10.765183436
+马尾区 13.2075304714
+太多年 13.2075304714
+帐目 9.75754292558
+二十九万二 13.900677652
+子李存 13.2075304714
+吹倒 10.9049453784
+二十丈 10.9049453784
+无奇 11.598092559
+枯涩 11.9547675029
+新闻 5.94595431748
+无奈 7.08723305246
+二十万 8.73589167805
+停建 11.8212361103
+海洋学 9.87532596124
+防臭剂 13.2075304714
+探底 7.62591563073
+钟铭 13.900677652
+三席 11.0103058941
+上思县 12.8020653633
+三帮 13.900677652
+洛赫 12.8020653633
+武周时 11.598092559
+庸医杀人 13.900677652
+听而不闻 11.8212361103
+听进 11.5027823792
+纯属巧合 11.8212361103
+勒索钱财 12.8020653633
+哑弹 13.900677652
+命根 11.9547675029
+老千 13.2075304714
+塌鼻子 13.2075304714
+蛇绿岩 11.4157710022
+停开 11.598092559
+赶下 10.8096351986
+抽奖券 13.900677652
+入直 11.4157710022
+木儿亦 13.2075304714
+省会 7.68207753228
+记得住 11.5027823792
+睡过 9.96885201925
+唐山大 11.5027823792
+港澳台侨 13.2075304714
+喜看 12.8020653633
+陈宫引 13.2075304714
+马政考 13.2075304714
+入盟 12.2912397395
+官蛇节 12.2912397395
+大沙河 11.0674643079
+老所长 12.5143832909
+费拉杜 13.2075304714
+入监 12.1089181827
+西蒂 12.2912397395
+茁壮成长 11.0674643079
+诸法 10.2630914922
+大力加强 10.1630080337
+有力 6.68176794436
+停当 8.70772080109
+有功 7.97642185456
+重新考虑 10.3171587135
+河泽亦 13.2075304714
+主宰世界 12.1089181827
+巴尔喀什 13.900677652
+提名奖 12.5143832909
+一歌 13.2075304714
+铝业 8.34771806705
+去年初 11.3357282945
+无声 8.06294720481
+焉耆回族自治县 11.9547675029
+印度人民党 11.5027823792
+异姓 9.24671730182
+诸河 10.8096351986
+制艺 11.8212361103
+百思不解 11.7034530746
+一百四十七万余顷 13.2075304714
+弘化公主 13.2075304714
+沃思堡 12.2912397395
+消化酶 10.9562386728
+一正 10.6818018271
+西蓝 13.2075304714
+美孚 10.0940151622
+北京石油 12.8020653633
+一步 6.0397212871
+腰骶部 11.0674643079
+有劲 10.0940151622
+削弱 7.26210986281
+三德 13.900677652
+层状介质 13.900677652
+有助 9.35738286971
+倒装 12.2912397395
+少数几位 12.2912397395
+思路清晰 10.4994802703
+诸葛亮 8.22392384971
+精减 11.9547675029
+有加 9.34680076038
+生死恋 12.8020653633
+花溪 11.9547675029
+远自 13.2075304714
+命案 9.84023464143
+精准 9.20932976975
+腐干 13.2075304714
+停得 12.2912397395
+西落 10.9049453784
+灭蟑螂 13.900677652
+汉胜楚 13.900677652
+假冒 9.18217878068
+忐忑不安 9.32596667347
+预备部 12.5143832909
+窥伺 10.0720362555
+新钞 11.9547675029
+格罗夫斯 12.8020653633
+巴拉那河 10.765183436
+朝东边 12.8020653633
+第八种 13.900677652
+贿赂罪 12.5143832909
+羔子 11.598092559
+停征 11.7034530746
+热丝 13.2075304714
+西营 9.58318953844
+康亲王 12.2912397395
+钱校本 13.2075304714
+山青水秀 11.8212361103
+还少 10.2117981979
+咯吱吱 12.8020653633
+无所不知 10.9049453784
+惠蒂尔 13.2075304714
+热中 11.4157710022
+雷音宝 12.1089181827
+万贯家产 13.2075304714
+归水泊 12.8020653633
+薄饼 12.8020653633
+南北关系 12.5143832909
+吴小莉 13.900677652
+轻柴油 12.8020653633
+颜宗弼 10.2117981979
+一段 6.31692135127
+年迈体弱 13.900677652
+王善 12.5143832909
+张翠鸾 13.900677652
+地理课 13.2075304714
+精典 13.2075304714
+还行 9.66657114738
+疑讶 13.900677652
+下三滥 12.1089181827
+迟疑不决 11.4157710022
+探微 12.2912397395
+热乎 9.85762638414
+精兵 7.85804481829
+吊绳 12.8020653633
+围上 11.1280889297
+总起来说 12.1089181827
+一比 10.0720362555
+大排量 11.5027823792
+玄奘亦 12.8020653633
+门头沟区 11.7034530746
+三弄 12.5143832909
+鸭群 12.8020653633
+三强 10.533381822
+新铺 13.2075304714
+一毫 10.0720362555
+五六位 12.8020653633
+有利 6.61243325096
+精光 8.93783302172
+有别 9.5062284973
+盛水期 12.5143832909
+那石崖 12.1089181827
+顺畅 8.89673134603
+那么回事 10.3743171274
+利弊得失 12.2912397395
+阴坡 9.74179456862
+花港 12.2912397395
+三弦 9.6811699468
+西螺 11.9547675029
+殷大士 10.4994802703
+殚心竭力 13.900677652
+老实巴交 10.8096351986
+容闳 11.1280889297
+一见如故 11.0103058941
+那梢公 10.604840786
+无害 9.44633035572
+哗哗啦啦 12.1089181827
+一树 10.4666904475
+阿奇太 13.900677652
+孙刘累 13.2075304714
+承包地 13.2075304714
+蒸制 13.2075304714
+嫉世愤俗 13.900677652
+万余匹 12.2912397395
+支腿 12.5143832909
+营墙 13.900677652
+精力 7.77818484246
+数百首 13.900677652
+无谓 9.59661255877
+一株 8.4284069783
+三峰 10.765183436
+停尸 11.0674643079
+三百六十五个 13.2075304714
+金钏儿 10.8561552143
+南京金陵大学 11.7034530746
+还设 10.8561552143
+一样 4.42758847409
+律仪 13.2075304714
+三峡 8.90346537821
+三十万两 11.9547675029
+一格 10.0505300503
+节骨眼 9.94943393339
+新青 12.8020653633
+三岛 10.4666904475
+宗微觉 12.8020653633
+一框 13.2075304714
+一案 8.99540287354
+寻老尤 13.2075304714
+高宗卒 13.900677652
+三岔 12.1089181827
+一桌 8.89673134603
+万余卷 11.8212361103
+极大地提高 10.3743171274
+西洋参 10.604840786
+三岁 9.01032852375
+花消 13.2075304714
+细微末节 12.5143832909
+衍生 7.62028181302
+无声手枪 12.5143832909
+一档 10.3453295905
+钟陵 11.9547675029
+一桩 8.5488195185
+阿伯拉尔 12.2912397395
+绞起 13.2075304714
+因数分解 13.900677652
+一桶 9.20932976975
+贝督 13.900677652
+检察人员 11.7034530746
+洛迪 12.2912397395
+性生理 11.9547675029
+盛得 12.5143832909
+科纳布 13.900677652
+贫苦出身 13.900677652
+阿凡提 11.9547675029
+精到 11.1926274509
+补救措施 10.7226238216
+三十九卷 13.2075304714
+精制 9.17328983326
+凤藻宫 12.2912397395
+香茅油 12.1089181827
+娄巴特 13.2075304714
+三届 9.63799777493
+各有所短 13.2075304714
+五六亩 13.2075304714
+蒙玉帝 12.1089181827
+三局 11.598092559
+曹仁大 12.8020653633
+三层 8.53938548627
+袁丁 13.900677652
+柳树下 10.3743171274
+疟疾 9.54396882529
+那榆木 13.900677652
+一梦 10.1630080337
+花海 11.8212361103
+三山 9.20932976975
+有关 4.69374307313
+巴贝夫 11.8212361103
+一梯 13.2075304714
+跨媒体 13.2075304714
+一梭 12.2912397395
+不值一文 12.5143832909
+甭说 9.71102290995
+假劣 11.7034530746
+红着眼睛 11.9547675029
+狠抓落实 11.598092559
+防川 12.5143832909
+气满志骄 13.900677652
+族诛 10.9049453784
+爬墙 11.9547675029
+远航 9.5186510173
+西蜀 10.0088573539
+选择响应 13.900677652
+回文诗 13.2075304714
+万余口 11.5027823792
+耶律国 13.2075304714
+官库 11.7034530746
+巴贝奇 11.7034530746
+刘注相 13.900677652
+精蕴 12.8020653633
+无孩 13.900677652
+万余只 13.900677652
+木偶剧 12.5143832909
+一棍 10.0088573539
+一棒 9.27570483869
+通幽 12.8020653633
+三尊 10.6818018271
+果子吃 10.8096351986
+三小 12.8020653633
+布防 10.0940151622
+三封 11.1926274509
+障翳 13.900677652
+授艺 13.2075304714
+肾虚 9.74179456862
+三尺 8.62767809341
+亡故 9.87532596124
+老萧 11.9547675029
+新韵 12.8020653633
+弱点 8.35941410682
+番茄汁 12.2912397395
+石勒苏 11.5027823792
+油页岩 9.30555780184
+一棵 7.64492761022
+次列车 11.2616203224
+无存 10.4666904475
+非来不可 13.2075304714
+三百面 12.8020653633
+上夜 10.4349417492
+尖端科技 11.7034530746
+三川 11.1280889297
+余夫亦 12.5143832909
+广东省公安厅 11.9547675029
+工程进度 10.2897597393
+人高马大 12.1089181827
+老化 8.80692745117
+养兵千日 11.7034530746
+封吴王 12.5143832909
+秦属南 13.2075304714
+萧邦 12.5143832909
+摆列 10.0940151622
+史诗 8.40761620864
+魅力 7.89926277401
+栏干 12.1089181827
+每碗 13.900677652
+孙安入 13.900677652
+新阳 12.2912397395
+燕青亦 13.2075304714
+土豆粉 11.5027823792
+微扰理论 12.8020653633
+天之骄子 11.598092559
+日益完善 11.4157710022
+地球物理 9.29550746599
+缮修 12.5143832909
+虾仁 10.9049453784
+三轮车 9.16447920358
+民间语 13.900677652
+数十行 13.900677652
+谷米 11.9547675029
+欧耶伊 13.900677652
+弄坏 11.598092559
+假单 12.8020653633
+偷开 12.1089181827
+进步党 9.82314020807
+三十万余 13.2075304714
+侯君集 11.9547675029
+万余副 13.900677652
+通信处 12.2912397395
+石墨电极 12.8020653633
+海流图 12.1089181827
+睡足 11.5027823792
+储粮 10.3743171274
+德洛斯 12.2912397395
+一万六千余户 13.2075304714
+风火墙 12.5143832909
+团身 12.5143832909
+乱撞 10.8096351986
+贾比尔 11.7034530746
+太阳黑子 10.604840786
+省份 8.05135287203
+药效持久 13.2075304714
+打草稿 13.2075304714
+史识 12.1089181827
+新院 13.900677652
+而况 12.5143832909
+罗科索夫 12.1089181827
+同步控制 13.900677652
+价目单 12.8020653633
+龚普洛 12.8020653633
+萧郎 13.900677652
+鼻息如雷 12.8020653633
+吴茱萸 11.5027823792
+钟面 12.5143832909
+一楼 9.31571017331
+史证 12.8020653633
+一概 8.09554268306
+牦牛 8.71889410168
+卡特迈 13.2075304714
+剥花生 13.900677652
+冯大爷 12.2912397395
+章帝建 11.1280889297
+笋壳 12.1089181827
+蒸去 11.9547675029
+汪伯彦 11.598092559
+大方县 12.8020653633
+掉落在 10.642581114
+河源市 11.5027823792
+罩面 11.8212361103
+有假 9.69598503258
+鸭舌帽 11.1280889297
+弄垮 11.8212361103
+品冠 12.5143832909
+失惊 10.4994802703
+有偿 9.77354326693
+中央乐团 10.8561552143
+管理控制 12.2912397395
+乘风扬帆 13.2075304714
+灼痛 10.7226238216
+精化 11.1280889297
+原乡勇 12.8020653633
+花池 12.8020653633
+情报界 13.900677652
+两张皮 11.8212361103
+慕义 12.5143832909
+一法郎 13.2075304714
+诸湖 11.2616203224
+语族 7.6761192227
+纱灯 11.0674643079
+虾丸 13.2075304714
+蜗杆 11.8212361103
+九宫格 13.900677652
+哑巴 8.60737282725
+假发 10.2630914922
+腐尸 10.1394775363
+坎佩切 13.900677652
+精卫 12.2912397395
+新集 10.3171587135
+新雅 11.9547675029
+墨水瓶 11.7034530746
+地下工厂 12.8020653633
+凭栏处 13.900677652
+老蔡 11.5027823792
+萧道 13.2075304714
+广东菜 13.900677652
+老蔫 13.2075304714
+嗅觉区 13.900677652
+文明线 13.900677652
+入球 11.5027823792
+第三十九章 11.0103058941
+停工 8.96620371885
+调谑 13.900677652
+精华 8.21709788464
+乙肝 9.40086798165
+新雨 12.8020653633
+品出 11.2616203224
+制胜 9.71102290995
+竹布 11.5027823792
+捷安特 12.5143832909
+名团 13.900677652
+谈禅 12.1089181827
+一清 11.0103058941
+老苍 13.900677652
+数十载 11.8212361103
+子李德 13.900677652
+穆尔吉 13.2075304714
+年前 6.71680693691
+防谍 13.2075304714
+假名 10.4041700905
+引起纠纷 13.2075304714
+弄倒 12.1089181827
+华雄引 13.2075304714
+同道者 13.900677652
+债额 13.2075304714
+边角 10.6818018271
+子诵 12.8020653633
+各向同性 10.1871055853
+说说唱唱 13.900677652
+液肥 13.900677652
+耶律倍 12.5143832909
+大方向 9.22784881751
+住宅建设 11.1280889297
+克雷格 13.2075304714
+花毯 13.2075304714
+瓦德一世 12.8020653633
+盯住 8.26588804881
+包兰线 12.8020653633
+一个亿 10.5684731418
+年初 6.37827742059
+受精卵 9.33632946051
+踽踽 11.7034530746
+匆忙 8.28754954559
+李伯升 12.2912397395
+西至 8.45394028031
+酰氟 13.2075304714
+无已 11.0103058941
+四五分 12.2912397395
+无己 11.8212361103
+年刊 11.4157710022
+旌阳 11.598092559
+皮特里 12.5143832909
+年分 10.765183436
+运煤车 12.1089181827
+血腥味 10.9562386728
+宅第 10.533381822
+年制 10.4994802703
+词牌 11.598092559
+奥涅金 11.3357282945
+洛宁 9.74179456862
+简要地 11.0103058941
+安归迦 13.900677652
+年利 12.1089181827
+模块性 12.8020653633
+精品 8.36728816325
+深固 12.2912397395
+柬埔寨政府 12.1089181827
+酰氯 10.642581114
+第三军医大学 13.900677652
+倒贴 11.4157710022
+豁开 11.0674643079
+皇村 13.2075304714
+扶黛玉 13.2075304714
+堇菜 12.2912397395
+结实粗壮 13.900677652
+枯槁 11.7034530746
+谢赫 10.604840786
+倒账 13.900677652
+皇权 9.20932976975
+诗歌朗诵 13.2075304714
+坑蒙拐骗 12.1089181827
+埃拉托 11.9547675029
+一溜 8.90346537821
+王鸣谦 13.900677652
+无边 8.22392384971
+浪里白条 10.642581114
+曹仁引 11.598092559
+费拉拉 12.1089181827
+拍出来 12.5143832909
+逢甲大学 12.5143832909
+母后明 13.900677652
+导尿 12.8020653633
+脊索动物 11.0674643079
+整存整取 13.900677652
+凉椅 12.2912397395
+贝专纳 11.7034530746
+还贷 9.43476953332
+还贵 10.9562386728
+老舅 11.7034530746
+因式分解 12.1089181827
+非常高兴 9.37888907493
+国教派 13.2075304714
+老舍 10.2117981979
+布隆 10.8096351986
+谢贵 12.5143832909
+一滑 10.4994802703
+一个个 6.73363977506
+张智霖 12.8020653633
+新野 9.41204128224
+三公主 11.9547675029
+倒赔 13.900677652
+费事 9.94943393339
+泥像 10.5684731418
+不值一提 10.4666904475
+倒梯形 12.8020653633
+一滩 11.1926274509
+极端分子 11.7034530746
+克雷森 13.2075304714
+掀乱 13.900677652
+比昂松 11.8212361103
+市场观 13.900677652
+睁不开 9.58318953844
+中央实验话剧院 13.2075304714
+假哭 11.598092559
+弄僵 12.1089181827
+溘然 13.2075304714
+疼怜 12.1089181827
+行之有效 9.49395840471
+仲间 13.900677652
+盯上 9.69598503258
+上升时间 12.8020653633
+横尸 11.4157710022
+耶塞特 12.5143832909
+万余吨 10.8096351986
+年华 10.2371160058
+笋干 9.94943393339
+光明日报出版社 13.2075304714
+谢苗诺 12.8020653633
+年半 10.4349417492
+擦眼抹泪 13.900677652
+不分场合 13.900677652
+入狱 8.53470163695
+瓦迪 13.2075304714
+赫克托 12.5143832909
+三对 11.9547675029
+三寸 9.89334446674
+假唱 13.2075304714
+防贼 11.4157710022
+万余名 11.0674643079
+往往是 13.900677652
+以备不时 13.2075304714
+锦鳞 10.2117981979
+非金融 9.91169360541
+缢痕 12.2912397395
+新造 10.8096351986
+拴结 13.2075304714
+期货市场 7.43453292774
+碌曲县 13.2075304714
+新道 11.1280889297
+舟山市 11.2616203224
+三定 10.8096351986
+三宝 9.40086798165
+直线运动 10.2371160058
+贝尔蒂 12.2912397395
+文坛 8.84443184663
+政权 6.32971906881
+三匹 10.1871055853
+三宗 11.1280889297
+稳压 11.5027823792
+生旺 13.2075304714
+贝尔蒙 12.5143832909
+锦鲤 13.900677652
+小生境 12.5143832909
+西历 12.2912397395
+愣住 8.65893063692
+三宅 12.8020653633
+马之劳 12.8020653633
+枯树 10.0940151622
+哑子 11.7034530746
+费伊 12.5143832909
+珍珠米 12.8020653633
+帕里尼 13.900677652
+丁子 11.9547675029
+三害 12.1089181827
+三百左右 12.8020653633
+所罗门 10.5684731418
+一潭 11.2616203224
+停学 12.2912397395
+远藤 12.2912397395
+靡靡之乐 13.900677652
+异己 9.93038573842
+异已 12.2912397395
+热带气候 10.3743171274
+篇目 10.604840786
+暹粒 12.5143832909
+顾秉谦 11.9547675029
+三室 11.9547675029
+桓銮 11.8212361103
+数码广场 13.2075304714
+还谈 11.0103058941
+三孝 13.2075304714
+田福军 8.05423887692
+费信 12.8020653633
+三子 9.5186510173
+果汁 8.96620371885
+北美地区 10.8561552143
+三字 9.43476953332
+延水谣 13.2075304714
+活现 13.900677652
+垡头 12.2912397395
+六爻 11.9547675029
+骂杀 13.2075304714
+停完 13.900677652
+广饶县 13.900677652
+什叶派 9.5186510173
+淆乱 11.9547675029
+掠杀 13.900677652
+下腹部 10.4666904475
+少数几项 12.1089181827
+无射 12.5143832909
+新邵 13.2075304714
+年号 8.53938548627
+赵少昂 12.2912397395
+涅波 13.2075304714
+无理根 13.900677652
+费保 11.9547675029
+盯人 11.8212361103
+肾脏 7.92432674268
+无尘 11.5027823792
+旗鱼 10.533381822
+新邮 13.900677652
+室主任 9.61021821083
+三学 12.1089181827
+天伦之乐 10.765183436
+邓辅纶 13.900677652
+老范 10.1394775363
+新郑 8.4980002701
+含酒精 11.9547675029
+谢谢 7.37271973435
+头儿 7.86280673205
+相悦 13.2075304714
+军裤 11.8212361103
+掀住 13.900677652
+老茎 12.2912397395
+探家 11.8212361103
+和惠良 11.7034530746
+燕惠王 12.2912397395
+北京林业大学 12.8020653633
+年历 10.6818018271
+个人化 11.598092559
+优越感 9.94943393339
+新郎 9.04086524761
+土默特左旗 12.5143832909
+肖像画 9.69598503258
+疏漏 10.4349417492
+老茧 10.642581114
+滇西 9.34680076038
+舒舒服服 10.3171587135
+郑小瑛 13.900677652
+三袋 12.2912397395
+接二连三 9.11318590919
+弄出 10.0294766411
+成菊刚 13.2075304714
+灰肥 13.2075304714
+古道热肠 12.1089181827
+暗叫一声 11.8212361103
+康母 11.4157710022
+飘然而至 12.8020653633
+直销店 13.2075304714
+唐山市 10.5684731418
+运动健将 10.9562386728
+睡裤 12.5143832909
+数十起 12.5143832909
+灼灼 9.96885201925
+早晨时 12.8020653633
+换流站 12.1089181827
+通信局 12.8020653633
+三十左右 13.2075304714
+琅玕 13.900677652
+花萼相辉 13.900677652
+十全大补 11.9547675029
+西莫 13.900677652
+储积 13.2075304714
+一气 8.98802276624
+商业软件 13.900677652
+皇族 8.89673134603
+年假 13.900677652
+粪车 11.9547675029
+漠不关心 10.4994802703
+马思答 13.2075304714
+追究责任 10.6818018271
+老胡 7.9526426628
+谢过 10.3453295905
+谢迁 11.9547675029
+哈得孙湾 11.3357282945
+无待 13.900677652
+五氧化二钒 11.2616203224
+采煤机 13.900677652
+疏泄 11.0103058941
+抽水机 10.604840786
+侯陈承 13.2075304714
+枯死 9.84023464143
+单口 12.5143832909
+一水 10.9049453784
+睡裙 12.8020653633
+揭竿而起 10.4041700905
+国民经济 7.04843508292
+连灌 13.2075304714
+一丘之貉 11.5027823792
+有喜 10.7226238216
+从东山 12.5143832909
+流浪记 11.3357282945
+刘连昆 13.2075304714
+还过 11.1280889297
+李伯元 13.2075304714
+谪居 11.8212361103
+紫龙 13.900677652
+间接调控 11.7034530746
+一江 12.1089181827
+滕尼斯 11.598092559
+老股 10.642581114
+无心 8.25877058104
+一池 11.0103058941
+西菜 13.900677652
+倒运 11.8212361103
+摊主 10.3743171274
+一汪 10.642581114
+睡袋 10.4666904475
+睡袍 11.598092559
+倒进 10.4994802703
+万余块 13.900677652
+刑事警察 11.4157710022
+精囊 10.765183436
+倒过 11.3357282945
+仄声 12.8020653633
+元良勇 12.5143832909
+谢辞 11.8212361103
+热水管 12.8020653633
+一汽 8.48903160012
+老聃 12.1089181827
+老聂 13.900677652
+摊付 13.900677652
+安络血 12.8020653633
+布努语 12.8020653633
+肖特基 11.7034530746
+单发 9.41204128224
+一沉 8.97342396682
+三塔 10.8561552143
+抄送 11.7034530746
+一沓 9.55687223012
+扛下去 13.900677652
+人体工学 12.8020653633
+灼热 9.12155415886
+大家闺秀 11.0674643079
+山青水绿 13.900677652
+魂兮归来 12.8020653633
+无异 8.89004235788
+鸡飞蛋打 11.4157710022
+李永金 13.2075304714
+松解术 13.2075304714
+花楸 11.9547675029
+寻香 13.2075304714
+花楼 11.4157710022
+柔色 13.900677652
+制动液 12.8020653633
+唐为振 12.8020653633
+拼装车 11.7034530746
+申饬 12.1089181827
+资金分配 11.1280889297
+异常 5.9959737381
+喷墨式 12.5143832909
+暹罗 9.61021821083
+无形 8.33999602096
+湿两用 13.900677652
+除邪惩恶 13.2075304714
+老者 8.32094782599
+老耄 13.900677652
+第四颗 12.8020653633
+远虑 10.6818018271
+故事集 10.3453295905
+唐晓 12.2912397395
+西药 9.63799777493
+醉鸡 13.900677652
+倒车 9.5186510173
+无影 10.533381822
+旗鼓 10.533381822
+温饱型 13.2075304714
+几毛 13.900677652
+倒转 9.72629038208
+偏振镜 13.2075304714
+石苞 12.5143832909
+疏水 11.7034530746
+乳化液 13.2075304714
+抄道 13.900677652
+三堆 12.5143832909
+一波 7.65651075131
+码头镇 12.5143832909
+醉人 9.98865464655
+相悖 10.0940151622
+不加分析 12.8020653633
+征用土地 11.8212361103
+无归 12.8020653633
+稞麦 13.900677652
+流畅性 13.900677652
+还载 13.2075304714
+三堡 11.9547675029
+真可笑 11.8212361103
+电荷分布 12.5143832909
+一泼 12.2912397395
+拘审 12.8020653633
+无度 10.0940151622
+头先 11.5027823792
+西芹 12.8020653633
+柔软度 12.8020653633
+三姓 10.8561552143
+趾骨 12.5143832909
+波利耶 11.9547675029
+紫黑 11.3357282945
+灰发 13.900677652
+一洗 10.1164880181
+年光 13.2075304714
+老奸巨猾 10.8561552143
+七八条 12.2912397395
+年兄 11.5027823792
+包尔汉 12.1089181827
+一洞 11.0103058941
+承包制 12.5143832909
+西区 9.04086524761
+灰色 7.76945116249
+老臣 9.10488710638
+探奇 12.8020653633
+苒苒 13.900677652
+睡觉 7.03270324301
+会餐 10.2897597393
+见性成佛 13.900677652
+紫黯 12.5143832909
+年关 9.26594866375
+兵役制度 10.8561552143
+言善辨 13.900677652
+开闸放水 11.8212361103
+无底 9.58318953844
+公职人员 9.80633308975
+控制字符 12.1089181827
+一派 7.77818484246
+永胜县 13.2075304714
+哑女 13.2075304714
+一流 7.92941581219
+花梗 11.1926274509
+异心 10.5684731418
+一测 12.8020653633
+采取措施 8.21370229564
+死会 13.900677652
+谢惠连 13.2075304714
+探头 9.34680076038
+异志 11.4157710022
+萧铣 12.8020653633
+屎盆子 12.8020653633
+白颐路 13.900677652
+答辩书 12.5143832909
+涂眼影 13.900677652
+申领 10.2117981979
+吉思曾 13.2075304714
+滴滴嗒嗒 12.5143832909
+弱电 11.9547675029
+未灭 11.3357282945
+一浪 10.2371160058
+乱砍 10.2117981979
+停好 12.2912397395
+贝特 10.533381822
+言之有据 12.8020653633
+西苑 9.66657114738
+近两年 8.70772080109
+立雾溪 11.1926274509
+笋尖 13.900677652
+吕蒙乘 13.2075304714
+花梨 10.9562386728
+编筐捏篓 13.900677652
+预备队 9.25628675283
+一涂 13.900677652
+元治平 12.8020653633
+世界观 8.89004235788
+静电效应 13.900677652
+攻队 12.2912397395
+微囊 12.1089181827
+三套 10.2630914922
+文场 11.9547675029
+压面机 13.900677652
+石勒喀河 11.9547675029
+韦拔群 12.8020653633
+吹台 12.5143832909
+无常 8.96620371885
+一百三十四两 13.2075304714
+宝常齐 13.2075304714
+物阜民康 13.900677652
+居宫城 13.2075304714
+尸王 9.36807815882
+蒙哥卒 13.2075304714
+有命 10.4041700905
+饥饱 11.0674643079
+有味 10.765183436
+班定姓 13.2075304714
+杀人灭口 10.5684731418
+景春之 13.2075304714
+风火山 13.900677652
+停妥 12.1089181827
+花桥 12.5143832909
+芬芳 9.53122979951
+纬纱 10.4349417492
+纬线 10.2897597393
+幕僚 7.89432449237
+沉睡不醒 13.2075304714
+花树 10.4041700905
+王实实 13.2075304714
+贺知章 11.3357282945
+三多 11.9547675029
+三夜 10.9562386728
+各个方面 8.44535653662
+海洋局 13.900677652
+德耀开 13.2075304714
+荷花淀派 13.2075304714
+无干 9.87532596124
+锦鸡 10.1871055853
+续殷祀 13.2075304714
+克雷毕 13.2075304714
+锌矿 10.9049453784
+余丈 13.2075304714
+年内 6.37827742059
+东土驾 12.8020653633
+三处 9.34680076038
+倒毙 11.0103058941
+尿脬 13.900677652
+花样 8.77671367257
+临床用 12.5143832909
+寻食 10.604840786
+三头 10.0088573539
+布洛涅 12.5143832909
+失不再来 12.5143832909
+米格机 13.2075304714
+几万句 13.900677652
+龙海 11.7034530746
+嗅闻 13.900677652
+上甲微 12.8020653633
+老脸 10.4349417492
+美容厅 13.900677652
+程序段 13.900677652
+紫鸾 13.2075304714
+綦母怀 12.8020653633
+有否 10.6818018271
+三四 9.40086798165
+双峰骆驼 13.900677652
+夹道相迎 13.900677652
+三回 10.3171587135
+相陪 9.55687223012
+磐石之安 13.2075304714
+条桌 11.5027823792
+不无道理 10.3453295905
+紫金 8.0484751722
+马丁路德 13.2075304714
+东沙河 12.8020653633
+光芒万丈 12.1089181827
+一战 7.83225206373
+打小报告 11.7034530746
+花柱 10.2117981979
+廷德尔 12.1089181827
+年幼 8.83177344976
+万余处 12.8020653633
+三国 7.13333452671
+诸族 10.642581114
+避孕药物 13.2075304714
+闹僵 11.7034530746
+三围 12.2912397395
+强取勒索 13.900677652
+一户 8.92394390956
+命意 11.0674643079
+三团 11.9547675029
+十二万分 12.1089181827
+一房 10.2897597393
+纤维制品 12.1089181827
+白芙蓉 13.2075304714
+金苹果 13.2075304714
+无几 10.7226238216
+串街 13.2075304714
+一扇 8.95903522937
+达沃斯 10.765183436
+侃侃 10.8096351986
+一手 7.20117731181
+粮草先行 12.8020653633
+花枝 10.1630080337
+花果 9.80633308975
+篇篇 12.5143832909
+一打 9.61021821083
+八路军 7.8604229407
+诸方 13.2075304714
+精壮 9.63799777493
+人造毛皮 13.2075304714
+串行 11.0103058941
+年市 11.0674643079
+从弱到强 12.1089181827
+香车美人 13.2075304714
+九百多篇 13.2075304714
+一扣 11.3357282945
+豁口 10.2371160058
+社会青年 12.2912397395
+花架 11.1926274509
+奥委会 11.9547675029
+一扫 9.08039608637
+有害 7.86999239171
+舅舅家 11.4157710022
+一扯 9.75754292558
+一扭 9.62401153296
+纱管 13.900677652
+拚命 9.27570483869
+射电源 10.604840786
+灰质 10.4994802703
+花枪 11.1280889297
+郑小秋 12.8020653633
+上海联和投资有限公司 13.2075304714
+制订 7.29808975979
+申非 13.900677652
+耕者有其 11.1926274509
+一把 5.84361697001
+百事通 12.5143832909
+有孕 11.1926274509
+花束 10.8561552143
+生日礼物 10.642581114
+净化剂 13.2075304714
+一抖 8.81927328699
+匆匆 6.94794900735
+党委会 10.3453295905
+欧洲联盟 11.0103058941
+一折 10.2897597393
+曾宝仪 11.4157710022
+西贡 10.533381822
+赵王张 12.8020653633
+珍妮特 13.900677652
+西贝 12.5143832909
+沙海魔 10.8561552143
+杜鸣心 11.9547675029
+长林丰草 13.2075304714
+一披 12.2912397395
+老父亲 10.4041700905
+一抱 11.0103058941
+西巴斯 13.900677652
+大明历 11.5027823792
+凝结水 13.2075304714
+入网 10.642581114
+腐坏 11.598092559
+撕裂 9.26594866375
+外村人 12.1089181827
+虔诚地 9.80633308975
+一拆 12.8020653633
+松开 8.61241062128
+一担 9.41204128224
+砷化镓 10.3743171274
+倒腾 9.62401153296
+年底 5.67276781438
+王宠幸 13.900677652
+斯波尔丁 13.2075304714
+一拍 8.43684584695
+无关 7.29402746578
+一拐 9.84023464143
+一拖 10.1871055853
+诸政 12.2912397395
+绝大多数站 13.900677652
+反潜 8.17709255002
+一招 8.90346537821
+远行 9.45802639549
+摆在前面 13.900677652
+一拜 9.72629038208
+除下 11.7034530746
+平面坐标 13.2075304714
+安纳布尔 13.2075304714
+春播作物 13.2075304714
+花朵 8.29487558568
+仙景 12.2912397395
+应龙之 12.8020653633
+鬼精灵 12.1089181827
+一拨 9.31571017331
+无光 9.5186510173
+丝竹 10.1630080337
+第三道 10.3453295905
+闹别扭 10.4041700905
+莉娅 10.765183436
+推选 9.03314320152
+鲁巴族 12.8020653633
+年度 6.34007648921
+规范字 13.900677652
+推送 11.1280889297
+艺匠 13.900677652
+无人居住 10.533381822
+枫香树 12.8020653633
+勃兴 10.6818018271
+度数 10.3743171274
+穆宗皇帝 11.8212361103
+记录片 12.5143832909
+快过 11.4157710022
+一指 8.25170341381
+运煤船 13.900677652
+获得理想 12.5143832909
+老迈 10.1394775363
+哑场 13.900677652
+规矩准绳 13.900677652
+戛然而止 9.71102290995
+粟收息 13.2075304714
+跷起来 13.900677652
+洛蒂 12.2912397395
+不可限量 11.1280889297
+三城 10.9049453784
+令人厌恶 10.765183436
+氟骨症 12.1089181827
+噼啪 10.6818018271
+老远 8.9102450652
+纨裤 12.5143832909
+宇文述 13.2075304714
+岩隙 10.4994802703
+精妙 10.1164880181
+一挡 10.533381822
+亚历山德里亚 12.5143832909
+词缀 11.598092559
+一挥 8.44535653662
+复旦 10.2897597393
+储盐 11.7034530746
+热水瓶 10.3743171274
+一振 11.0674643079
+倒彩 13.900677652
+申雪 12.1089181827
+鼠药 12.8020653633
+尚长荣 13.900677652
+生命现象 10.6818018271
+推重 10.1871055853
+一挺 9.37888907493
+侃价 13.900677652
+停在 8.56313957227
+名胜地 12.8020653633
+防腐 9.35738286971
+纱窗 10.533381822
+一捅 11.3357282945
+老辈 10.9562386728
+严神 13.900677652
+稳得 12.8020653633
+阵势 8.53003962385
+公言极 12.8020653633
+麦克级 13.2075304714
+远视 10.8561552143
+红苔黄 10.0720362555
+山榄科 12.2912397395
+几万匹 13.2075304714
+邓军叹 13.2075304714
+带发修行 12.2912397395
+战斗历程 12.8020653633
+米文平 13.2075304714
+村主任 10.0720362555
+放下架子 11.9547675029
+老辣 10.9562386728
+谢肇 12.2912397395
+超级大国 10.0088573539
+血清病 11.8212361103
+品学 13.900677652
+内外有别 12.2912397395
+施尼 12.1089181827
+新官上任三把火 12.2912397395
+贝类 8.81927328699
+单单 9.12999302751
+阅读辅导 13.900677652
+黑宋江 12.5143832909
+猎食 10.604840786
+老边 12.1089181827
+数码产品 11.3357282945
+疼惜 11.1926274509
+一掀 10.1164880181
+热饮 11.598092559
+流纹岩 10.4666904475
+写生 9.63799777493
+西谷 11.8212361103
+权召入 12.5143832909
+一掉 12.1089181827
+模拟信号 11.3357282945
+新鲜 7.20611559345
+一排 8.17709255002
+因时因地 11.7034530746
+津巴布韦 9.34680076038
+度日 9.44633035572
+全面解决 12.5143832909
+赵煦 13.900677652
+田信长 13.900677652
+斯塔万格 13.900677652
+心浮气燥 13.2075304714
+一探 9.82314020807
+推上 9.28555713513
+罗兰特 12.1089181827
+德罗河 13.900677652
+推下 11.2616203224
+寻隙 11.7034530746
+八方支援 12.1089181827
+滚雪球 11.5027823792
+发祥之地 12.8020653633
+大屋里 12.8020653633
+致公党 11.8212361103
+生化武器 13.2075304714
+仁布县 13.900677652
+寒芒 12.8020653633
+西半 13.900677652
+东四环 12.5143832909
+寿太郎 10.765183436
+士珍 11.1926274509
+一插 11.598092559
+三圈 10.642581114
+一提 8.86372504956
+粪肥 11.2616203224
+无偿 8.46259834305
+田户 12.8020653633
+学生宿舍 11.9547675029
+三场 10.4349417492
+均衡点 12.5143832909
+招呼客人 11.4157710022
+旱莲草 12.5143832909
+卫贤 13.2075304714
+印字机 12.5143832909
+无偏 11.9547675029
+冯宝宝 13.900677652
+行俭德 11.7034530746
+贺绿汀 11.3357282945
+誓死不降 12.8020653633
+宁平城 12.1089181827
+束骨 13.2075304714
+背心儿 12.8020653633
+异兽 11.0674643079
+力壮身强 13.900677652
+精奇 11.1280889297
+火漆 10.9562386728
+预亏 10.642581114
+西辽 10.0505300503
+秀水明山 13.900677652
+庄前庄 12.5143832909
+伯南克 8.1417758781
+荒淫无度 12.2912397395
+亚运村 11.5027823792
+加工余量 13.2075304714
+频率特性 12.1089181827
+帐簿 10.6818018271
+一怒 10.7226238216
+盖布 12.5143832909
+三响 10.8096351986
+哑吧 12.2912397395
+三品 8.70772080109
+游春图 11.598092559
+游憩地理 13.2075304714
+张飞庙 13.2075304714
+照不到 11.0674643079
+曹仁军 13.2075304714
+盖茨 9.71102290995
+骨病 11.598092559
+预交 12.1089181827
+色诺芬 11.1926274509
+异动 7.08394177138
+作息 10.8096351986
+错误判断 12.2912397395
+涎皮赖脸 13.900677652
+投影 9.14708746087
+花旦 10.3171587135
+威胁利诱 11.4157710022
+一总 11.7034530746
+探员 13.900677652
+桂馥著 13.2075304714
+叽哩咕噜 13.900677652
+花斑 10.0088573539
+参量 9.20932976975
+古代汉语 11.7034530746
+交还给 10.4666904475
+楚楚可怜 11.4157710022
+探听 8.78868986362
+炸子鸡 13.2075304714
+皇榜 11.8212361103
+鹿于霖 11.3357282945
+无可 8.13548654919
+一事不明 12.5143832909
+年少 9.93038573842
+红铜 10.7226238216
+理事单位 13.2075304714
+西迪 11.8212361103
+预付 7.5871296057
+伯夷叔 13.2075304714
+孟速思 13.2075304714
+勃发 11.4157710022
+有如 8.41173992582
+早出晚归 10.8096351986
+词类 11.4157710022
+年尾 10.9562386728
+西进 9.16447920358
+方用良 13.2075304714
+枯木 10.765183436
+无及 11.3357282945
+甲骨文公司 13.900677652
+一息 11.0674643079
+芭蕉扇 10.0720362555
+枯朽 12.8020653633
+针对实际 12.8020653633
+绷子 13.900677652
+抗战时期 10.4666904475
+小拇指 11.1280889297
+豁出 9.96885201925
+弄平 13.2075304714
+西迁 9.14708746087
+敬修堂 13.2075304714
+钟麟 10.4994802703
+三员 10.642581114
+成昆铁路 10.6818018271
+聆取 13.2075304714
+几万卷 13.2075304714
+新龙 12.2912397395
+带你去 10.1164880181
+有奖 10.4041700905
+精神财富 10.2371160058
+从头越 12.5143832909
+倒茬 12.5143832909
+个人展 13.900677652
+养正轩 13.2075304714
+挡风沙 13.900677652
+稳居 9.41204128224
+方用芩 13.2075304714
+庄帝 11.5027823792
+保证率 11.9547675029
+三味 11.3357282945
+沮丧 8.34384959028
+大规模 6.05174392561
+呆坏账 11.3357282945
+还应 8.40761620864
+法属波利尼西亚 11.7034530746
+芬达 13.900677652
+香串 13.900677652
+液压 8.14493543839
+正丁醇 12.5143832909
+韶钢 10.3743171274
+安心乐意 13.900677652
+系统升级 11.598092559
+快运 12.2912397395
+国际妇女节 12.5143832909
+三向 11.9547675029
+巴贝克 12.8020653633
+豁免 9.20932976975
+声称 7.96314144689
+亲生父母 11.0103058941
+三合 9.43476953332
+枯枝 9.71102290995
+三同 12.8020653633
+西轩 13.2075304714
+唐廷诏 13.2075304714
+切题 12.1089181827
+寻问 10.8561552143
+有备 11.4157710022
+年岁 9.35738286971
+哑哑 10.765183436
+神态自若 11.9547675029
+不值钱 9.66657114738
+有失 8.41588071849
+高超绝伦 13.900677652
+无华 10.6818018271
+搅缠 12.5143832909
+预习 11.5027823792
+子李光 13.2075304714
+一想 7.54456999128
+杨钟健 11.9547675029
+曹仁先 13.2075304714
+诸朝 12.8020653633
+金带梅 12.2912397395
+仁爱路 13.900677652
+无所不精 12.8020653633
+电话 5.85316814099
+大气磅礴 11.5027823792
+业经 11.1280889297
+玉帝敕 12.8020653633
+词素 11.7034530746
+捷克政府 12.8020653633
+毫无结果 10.765183436
+弄弄 12.1089181827
+北京体育大学 11.8212361103
+钟鼓 9.89334446674
+一意 10.604840786
+定货单 13.2075304714
+钟鼎 11.3357282945
+生肌散 12.2912397395
+中流击楫 12.5143832909
+茵陈 10.8561552143
+防范 7.1049718768
+八荣八耻 13.900677652
+精审 10.765183436
+投亲靠友 11.7034530746
+计划数 13.2075304714
+文艺复兴 8.28754954559
+七窍流血 11.0674643079
+业绩 5.06517619457
+木舟 12.8020653633
+事事物物 12.5143832909
+有声 9.29550746599
+授记 13.900677652
+工读学校 11.7034530746
+玉禅师 13.2075304714
+申银 13.900677652
+老路 9.75754292558
+汉伏波 12.8020653633
+翻脸无情 12.8020653633
+最高法院 9.29550746599
+三嗪 12.2912397395
+停售 10.9562386728
+无力 7.17564400981
+通信兵 10.533381822
+无功 9.49395840471
+熙德 11.9547675029
+有薇薇 12.8020653633
+制衡 9.89334446674
+诸暨 10.4994802703
+制衣 10.8561552143
+制表 9.96885201925
+进步奖 11.0103058941
+远识 13.2075304714
+过从甚密 10.765183436
+谢芳 12.8020653633
+异变 11.4157710022
+连太郎 13.2075304714
+另一手 10.9049453784
+施皮茨 12.5143832909
+授课 9.72629038208
+萧飒 13.900677652
+辛克莱 12.5143832909
+城市改建 12.8020653633
+波浪式 10.7226238216
+庞勋 12.8020653633
+马忽思 13.900677652
+芭蕾舞 10.4666904475
+学年度 13.900677652
+知趣 9.53122979951
+斯坦豪斯 13.900677652
+一语中的 11.3357282945
+真凭实据 11.3357282945
+埋伏圈 13.2075304714
+振作起 11.9547675029
+捕虫叶 13.2075304714
+无利 11.3357282945
+假定 7.14840727583
+耶律德 10.7226238216
+鲁伯鲁 12.8020653633
+西飞公司 12.8020653633
+异化 9.4233408375
+寄生蟹 13.2075304714
+老赖 10.8561552143
+布律内尔 12.5143832909
+醋酸乙烯 12.1089181827
+寥寥无几 9.45802639549
+盟长 12.2912397395
+李顺心 12.5143832909
+勃利 12.1089181827
+无分 11.3357282945
+贝纳 11.5027823792
+张飞引 11.4157710022
+耶律得 11.3357282945
+封师岐 11.4157710022
+付之一炬 10.8096351986
+老赵 9.7898037878
+伪劣商品 13.900677652
+凝霜 12.2912397395
+强制手段 10.8561552143
+男工 10.2897597393
+风兵草甲 13.900677652
+做假账 13.2075304714
+护得 12.8020653633
+朱子道 13.2075304714
+窦开远 9.82314020807
+廓尔喀 10.4349417492
+北游燕 12.8020653633
+圆跳动 13.900677652
+串话 13.900677652
+媚颜 13.900677652
+数十股 13.900677652
+帕提农 12.1089181827
+爱丽丝 10.642581114
+马苏德 13.2075304714
+情绪化 11.598092559
+各县区 11.1280889297
+制裁 8.71329184614
+哑嗓 13.900677652
+老财 11.0674643079
+公约 7.64109618791
+老账 11.3357282945
+飞行物 12.2912397395
+吴淑珍 12.8020653633
+胡桃醌 13.2075304714
+慈航 12.5143832909
+卤化物灯 12.8020653633
+云阳水 13.2075304714
+期刊杂志 13.900677652
+一决胜负 12.1089181827
+扫来扫去 11.5027823792
+遐想 9.91169360541
+花插 10.9562386728
+透天凉 13.2075304714
+尼格里 11.9547675029
+弄堂 9.26594866375
+有志 10.533381822
+滴里嘟噜 13.2075304714
+削削 12.2912397395
+罕物 12.2912397395
+有心 8.1417758781
+游者 12.8020653633
+停刊 9.63799777493
+一星 10.8096351986
+串谋 10.4994802703
+疑虑 7.94743431769
+每刻 12.8020653633
+三勺 12.5143832909
+工农兵学商 12.1089181827
+停到 11.4157710022
+一春 11.0103058941
+舒口气 11.8212361103
+胡子太医 12.2912397395
+一是 5.93409095434
+主机名 13.2075304714
+深圳机场 11.0103058941
+多云到阴 11.7034530746
+外科主任 12.2912397395
+赵归真 12.2912397395
+一昼 13.900677652
+一晃 8.82550383674
+灰褐 9.98865464655
+命数 11.598092559
+海牙国际法庭 12.5143832909
+冲淡 9.58318953844
+见效快 10.9049453784
+通淮利 13.2075304714
+有得 11.1280889297
+一晒 11.1926274509
+词穷 12.1089181827
+尽力去做 13.2075304714
+哑剧 11.1280889297
+脏乱差 12.5143832909
+花掉 9.56994431169
+定居点 11.3357282945
+有待 8.08654712015
+王荷生 12.5143832909
+阳光计划 12.1089181827
+官田律 13.2075304714
+悬雍垂 13.2075304714
+清闲自在 12.8020653633
+国务院外事办公室 13.900677652
+假山 9.22784881751
+金钱至上 12.2912397395
+陈公陶 13.2075304714
+公言报 13.2075304714
+整天价 12.8020653633
+亡母 13.2075304714
+西角 13.2075304714
+有德 10.3453295905
+四万七千年 12.8020653633
+沈醉 13.2075304714
+科尼亚 12.1089181827
+林边 10.9562386728
+一智 13.2075304714
+羊毛出在羊身上 11.7034530746
+入场费 10.642581114
+纱罗 11.9547675029
+停办 9.71102290995
+异名 11.0674643079
+有当 11.7034530746
+一九五九年 11.9547675029
+蔓生植物 13.900677652
+乌巾 13.900677652
+新馆 10.6818018271
+一暗 10.765183436
+羊肠小径 13.900677652
+同母异父 11.8212361103
+条形码 11.2616203224
+求仙 10.533381822
+限制住 12.8020653633
+间接经验 13.2075304714
+卖呆 13.2075304714
+吴昌文 13.900677652
+善于辞令 11.9547675029
+丝线 9.41204128224
+另一方 8.85725253506
+丝纺 11.4157710022
+正人君子 9.91169360541
+身材魁梧 10.4041700905
+三副 11.7034530746
+凝结核 12.2912397395
+纱罩 12.2912397395
+有形 9.17328983326
+探勘 12.5143832909
+皮影戏 10.6818018271
+三则 10.0088573539
+死定了 10.9562386728
+词章 11.3357282945
+丝结 13.2075304714
+丝绒 10.6818018271
+肾衰 11.0674643079
+频道 8.52539924429
+做不了 9.56994431169
+三列 11.0674643079
+苏禄海 11.9547675029
+丝织 9.31571017331
+风险投资 8.98802276624
+萧观音 12.5143832909
+东雍州 13.2075304714
+行政案件 10.3743171274
+三刀 11.3357282945
+有异 9.71102290995
+媳妇 7.07630398193
+二十首 12.2912397395
+农业户 13.2075304714
+三分 7.83225206373
+丝绵 10.6818018271
+腐化 9.62401153296
+紫锦 12.8020653633
+丝绳 10.9049453784
+萧齐 12.5143832909
+战略空军 10.9049453784
+栏内 11.9547675029
+湟中县 11.8212361103
+丝绸 8.2273543848
+遐思 12.2912397395
+一曲 8.87679713113
+求亲 10.4994802703
+丝绢 10.765183436
+贯耳 12.1089181827
+东楼 12.8020653633
+求人 10.0294766411
+丝缕 11.3357282945
+医卫界 13.2075304714
+柳若菲 10.2371160058
+笃行 12.8020653633
+三发 11.0674643079
+一月 8.13548654919
+一有 8.71889410168
+液化 8.81927328699
+一辈子打 13.2075304714
+三叉 10.6818018271
+燕青微微 13.2075304714
+推门 8.82550383674
+远超 8.71329184614
+推问 11.7034530746
+三双 11.9547675029
+八位数 13.2075304714
+三房两厅 13.900677652
+研判 8.85082164473
+纳博科 12.8020653633
+老话 9.5186510173
+斯卡亚 12.5143832909
+芯子 11.3357282945
+束鹿 11.5027823792
+步幅 12.5143832909
+花拳 13.2075304714
+瓦迪斯 12.8020653633
+远足 11.598092559
+等差级数 12.5143832909
+一木 11.7034530746
+纱绽 13.2075304714
+万余尊 12.2912397395
+一本 7.57095674645
+三叶 10.2630914922
+老光 13.900677652
+各领 10.533381822
+三只 7.83689244329
+中国人民解放军国防大学 12.8020653633
+老说 11.3357282945
+一朵 8.27305653829
+莫尔兹比港 11.8212361103
+三叠 9.80633308975
+三口 8.9519177616
+室间隔 11.9547675029
+三句 10.765183436
+稳定 5.16934129144
+搅碎 12.5143832909
+丝网 11.2616203224
+稳实 13.900677652
+三原 10.7226238216
+名胜区 8.94485059437
+郭敬明 11.8212361103
+远距 10.642581114
+有底 10.6818018271
+第三分 13.900677652
+传导 8.12612610643
+足球联赛 12.2912397395
+睡莲 10.604840786
+春田 11.0103058941
+诸军畏 12.8020653633
+有序 7.66235302694
+黄家富贵 12.1089181827
+没准头 13.900677652
+易如拾芥 13.900677652
+精巢 11.7034530746
+西裤 11.7034530746
+垦殖地 13.900677652
+一束 8.85082164473
+精巧 8.52078029844
+食用鱼 11.3357282945
+一杠 12.2912397395
+一条 5.27966513192
+交管局 11.9547675029
+一来 7.82533162089
+田径运动 10.3743171274
+许重 13.900677652
+费列洛 13.2075304714
+花押 11.2616203224
+纱线 10.533381822
+肯干 10.642581114
+老记 12.8020653633
+疏果 12.5143832909
+看上眼 12.5143832909
+形而下 11.8212361103
+形而上 10.7226238216
+远路 10.604840786
+西装 9.21854642485
+入窖 13.900677652
+聆听 9.46986085313
+一板 10.8096351986
+此起彼落 11.1280889297
+有度 10.765183436
+五十三线 13.2075304714
+盖蒂 13.2075304714
+阴兵 10.9049453784
+新颖 8.53470163695
+应天顺 13.2075304714
+钟馗 10.4666904475
+花托 10.4666904475
+响亮 8.20694551317
+削发 11.0674643079
+肠系膜 11.1280889297
+视在功率 12.2912397395
+疏松 8.4801426527
+破浪前进 12.2912397395
+科西嘉岛 11.1926274509
+读起 11.9547675029
+三千 7.80260336981
+三星公司 12.8020653633
+单功能 13.2075304714
+一枝 8.44963919841
+年寿 11.598092559
+秦及汉 11.598092559
+绝圣弃智 12.2912397395
+一枪 8.19356738723
+无后 10.2117981979
+有年 11.3357282945
+三卷 9.63799777493
+无名 8.74162235276
+三卫 11.1280889297
+一架 7.7083151625
+豁嘴 11.9547675029
+品德 9.11318590919
+静脉曲张 10.3743171274
+水冰 12.8020653633
+分门别户 13.2075304714
+中国音乐学院 11.8212361103
+吕志伊 13.2075304714
+包夜 13.900677652
+榕树下 13.900677652
+一个五百 13.2075304714
+帐篷 8.089536659
+非常灵活 11.2616203224
+停发 10.4666904475
+太好了 8.9102450652
+三北 10.3743171274
+三化 11.0674643079
+无味 9.5062284973
+哑口 13.2075304714
+美国参议院 10.604840786
+去年底 8.45394028031
+忠实可靠 11.9547675029
+新风 10.6818018271
+一柜 12.8020653633
+蟊贼 11.8212361103
+劳动局 12.2912397395
+三区 9.89334446674
+远地 10.9562386728
+远走 10.4041700905
+一查 9.33632946051
+无告 11.2616203224
+极致 9.46986085313
+褚卫 13.900677652
+伯格曼 11.0674643079
+生产工具 9.20932976975
+花房 12.1089181827
+哺乳类 9.17328983326
+弄姿 13.2075304714
+一柱 10.533381822
+郝老板 12.1089181827
+军医大学 13.2075304714
+疏朗 10.4666904475
+推销 8.93783302172
+流浪者 9.96885201925
+同启东 13.2075304714
+年审 11.9547675029
+牛录意 13.2075304714
+无垠 10.8561552143
+身残志坚 13.900677652
+国外贸易 11.9547675029
+第三句 11.7034530746
+顺着 7.28595205177
+颈肩痛 12.8020653633
+一搏 10.4041700905
+老公 8.33233314821
+性行为 9.5062284973
+假币 10.2371160058
+尼西亚语 12.8020653633
+品尝 8.97342396682
+精度 7.79143006921
+绞脸 13.2075304714
+凝乳 12.8020653633
+绷开 13.900677652
+肆行 10.642581114
+世权 12.1089181827
+马丁尼 13.900677652
+陶澍改 13.2075304714
+本赛季 10.3171587135
+老袁 10.642581114
+间苯二胺 12.1089181827
+收入额 12.8020653633
+一摆 9.29550746599
+一摇 9.96885201925
+一摊 9.18217878068
+尼洋曲 11.2616203224
+停停 10.1394775363
+比丘王 12.8020653633
+血族 11.4157710022
+天然免疫 13.900677652
+西语 12.8020653633
+帕特里克 11.1926274509
+起死回生 9.54396882529
+蒸干 13.900677652
+吴承明 13.2075304714
+一摞 9.75754292558
+蜡笔画 12.8020653633
+元龙 11.8212361103
+尼安德 11.3357282945
+白塔村 12.5143832909
+新唐书 9.66657114738
+丝米 13.900677652
+壕堑战 13.900677652
+媒体 6.00486927489
+黯然消魂 12.8020653633
+凝为 13.2075304714
+吱吱响 12.2912397395
+心直口快 11.0674643079
+单刃 12.1089181827
+落价 13.900677652
+计划性 10.8561552143
+盟邦 11.5027823792
+一摸 8.88339781516
+保监局 10.3453295905
+防虫 10.6818018271
+眼中钉 10.6818018271
+应召女郎 12.5143832909
+一撇 9.93038573842
+暴食 11.9547675029
+在外 7.4191005227
+铁路沿线 9.77354326693
+孔明求 13.2075304714
+第一百零一个 13.900677652
+人确 13.900677652
+紫青 11.9547675029
+拿在手上 10.642581114
+糊住 11.4157710022
+阿尔穆瓦 11.9547675029
+迪亚兹 13.2075304714
+脉动阵列 13.2075304714
+蒙使君 13.2075304714
+佩香囊 13.2075304714
+诸军皆 13.2075304714
+百分表 12.1089181827
+互通性 13.900677652
+偶像剧 13.2075304714
+海外投资 9.27570483869
+撩逗 12.5143832909
+社会民主党 9.03314320152
+老表 10.8561552143
+梁妈妈 10.2897597393
+一撮 10.9562386728
+马门溪 13.900677652
+一播 13.900677652
+假座 13.900677652
+老衲 9.96885201925
+醋酸钠 13.900677652
+不鸣则已 12.1089181827
+洛茨 12.2912397395
+无土 12.8020653633
+伯格斯 11.9547675029
+丝糕 13.900677652
+许逊 12.2912397395
+学工处 13.900677652
+掂量 9.94943393339
+紫霄 12.2912397395
+交警支队 9.55687223012
+精干 9.59661255877
+上眼皮 11.1926274509
+英汉辞典 13.900677652
+金闪闪 12.2912397395
+远源 12.8020653633
+宋西安 12.2912397395
+考察船 11.1280889297
+入社 11.4157710022
+防蛀 11.598092559
+以旧换新 8.66956903512
+紫霞 11.5027823792
+腐儒 11.5027823792
+犰狳 11.598092559
+痢疾杆菌 11.7034530746
+士瓦 12.5143832909
+海风藤 13.900677652
+别克巴 13.900677652
+贵州省铜仁地区 13.2075304714
+王齐翰 13.2075304714
+裴宣 9.93038573842
+五六千两 13.900677652
+金发女郎 13.900677652
+个人崇拜 10.533381822
+魅影 11.9547675029
+绷带 9.54396882529
+宿三州 13.2075304714
+熙宁 9.20932976975
+守恒定律 9.40086798165
+播洒 13.2075304714
+合题 13.900677652
+异型 10.3743171274
+于昔木 12.5143832909
+简贤能 12.8020653633
+精微 10.0294766411
+凝住 11.0674643079
+害群之马 11.1926274509
+诺里奇 12.1089181827
+三出 11.3357282945
+哺乳纲 10.1871055853
+远达 10.2371160058
+紫雪 12.2912397395
+无怪乎 11.1280889297
+韦皇后 12.5143832909
+一支 6.09683434844
+两匹马 10.2630914922
+一收 10.8561552143
+丝素 13.2075304714
+祢衡 11.2616203224
+一改 8.87679713113
+一放 8.83808261895
+孙过庭 12.2912397395
+洛芬 13.900677652
+老要 10.6818018271
+永康方岩 13.2075304714
+年夜 13.2075304714
+互访 10.2117981979
+三农 8.55834340001
+远近 8.14810501315
+移下来 13.900677652
+远远 6.45117964659
+公寓式 13.2075304714
+演绎则 13.2075304714
+绝热指数 13.900677652
+瓦釜雷鸣 13.900677652
+三册 11.7034530746
+精忠 11.1280889297
+稳如 12.5143832909
+经济衰退 8.10766404359
+打杈 13.2075304714
+骑手 10.4994802703
+测数据 12.8020653633
+寻道 12.5143832909
+粉装玉琢 13.900677652
+科学种田 12.5143832909
+最终用户 12.2912397395
+渐黑 12.8020653633
+顺水推舟 10.604840786
+年头 8.28754954559
+汤庭芬 13.2075304714
+勃固 11.9547675029
+一数 11.598092559
+咬紧牙 11.0103058941
+除伐 13.2075304714
+一整 13.900677652
+夹注 12.8020653633
+乐天安命 13.2075304714
+咂摸 11.0674643079
+寻遍 11.598092559
+底部 6.83848601969
+假得 13.2075304714
+弄完 11.598092559
+三党 11.8212361103
+台资 10.4041700905
+多产作家 11.9547675029
+三十九年 9.98865464655
+申遗 12.2912397395
+蹬蹬 11.9547675029
+三光 11.7034530746
+规模化 9.38981814546
+一斑 11.3357282945
+一斗 9.84023464143
+康布伦 11.7034530746
+俯首 10.2117981979
+三元 8.98069672615
+分期分批 11.1280889297
+金白银 10.2371160058
+吴觉农 9.94943393339
+健身房 10.5684731418
+芦蒿 13.2075304714
+贝利亚 12.5143832909
+蛙式 13.2075304714
+一斤 8.55357012126
+光轮 12.8020653633
+狠戾 13.2075304714
+三关 9.96885201925
+一斩 13.900677652
+谢帖 13.900677652
+三具 10.7226238216
+一断 11.1280889297
+一新 8.74738605748
+外生性 10.8561552143
+三六 13.2075304714
+三公 9.08039608637
+忠君爱国 10.4666904475
+巴音郭楞 12.2912397395
+一方 7.06120121375
+里下河 10.0940151622
+含盐量 10.0294766411
+与此同时 6.31134182881
+一旁 7.14840727583
+佛手瓜 13.900677652
+一旅 11.5027823792
+长治久安 10.0088573539
+作曲系 11.5027823792
+整顿秩序 12.2912397395
+缢缩 11.5027823792
+精彩 7.9526426628
+失惊打怪 12.2912397395
+由红情 12.8020653633
+另一回事 10.4349417492
+猎鹰 10.4994802703
+布洛斯 13.900677652
+品川 13.2075304714
+尝味 13.2075304714
+水上公园 12.5143832909
+醉翁亭 11.9547675029
+张庭 12.8020653633
+一无 10.2897597393
+过硬 9.66657114738
+一旦 5.55522222381
+沉香亭 12.8020653633
+一日 6.78266144751
+牛栏山 12.5143832909
+旗主 10.7226238216
+穷极无聊 12.2912397395
+一早 7.73106691948
+一旬 12.2912397395
+紫阳 11.0103058941
+季兴入 13.2075304714
+一时 5.84203393976
+程砚秋 10.9562386728
+严禁 7.73106691948
+外务部 10.4666904475
+学习态度 12.8020653633
+教育培养 12.2912397395
+好几夜 12.8020653633
+停业 10.0294766411
+高翔引 13.2075304714
+串通 9.45802639549
+热得 10.1164880181
+云林县 11.0674643079
+獐头鼠目 12.1089181827
+束草 11.9547675029
+三从 13.2075304714
+三仁 13.900677652
+白文选 10.4666904475
+停上 13.900677652
+停下 7.78699547214
+花翎 11.1926274509
+灯心草 11.1926274509
+傅教惠 13.2075304714
+三任 10.8096351986
+李国文 11.9547675029
+阿公阿婆 11.8212361103
+香丸 13.2075304714
+休会期间 11.7034530746
+坐落于 9.93038573842
+申述 10.604840786
+远邻 13.900677652
+三价 11.3357282945
+三件 9.14708746087
+王天杰 13.900677652
+便酌 13.900677652
+新蔡 10.4666904475
+老雷 12.1089181827
+三代 8.35941410682
+一稿 11.9547675029
+父女关系 12.5143832909
+三亚 8.97342396682
+热心 8.25877058104
+围得 10.1630080337
+二十度 12.2912397395
+贝兰加 13.2075304714
+三五 9.74179456862
+强人所难 11.598092559
+潜望 10.765183436
+稳定物价 11.5027823792
+不谋而合 9.46986085313
+三二 12.5143832909
+西门 8.33615724465
+讪谤 12.2912397395
+银妆素裹 13.2075304714
+飞檐走壁 10.9562386728
+远郊 10.1164880181
+珀金斯 11.598092559
+余瑞璜 12.8020653633
+衅端 11.8212361103
+三人 6.65573610564
+申达 11.0674643079
+三亿 13.2075304714
+翩翩飞舞 12.2912397395
+左半球 11.7034530746
+攻防战 11.598092559
+陆卖婆 10.3453295905
+三亩 11.0103058941
+申辩 9.63799777493
+热忱 10.1164880181
+花群 13.900677652
+涧流 12.8020653633
+始终保持 8.86372504956
+一空 9.21854642485
+二女儿 11.4157710022
+三产 12.1089181827
+预后 8.79473217808
+赵欣婷 11.0674643079
+远途 11.0103058941
+一千顷 13.2075304714
+康格里 12.5143832909
+五一劳动奖章 12.1089181827
+老陆 10.0088573539
+三乐 12.1089181827
+热式 12.8020653633
+远逝 13.2075304714
+锦西 11.4157710022
+三义 12.1089181827
+谆谆 11.4157710022
+二十年 7.69208762588
+万树梨花 12.8020653633
+成功网 13.900677652
+律师公会 12.2912397395
+矮胖 10.7226238216
+黑神散 13.2075304714
+辉长岩 11.0674643079
+三乱 13.900677652
+产出率 11.9547675029
+削价 12.2912397395
+高通公司 13.900677652
+停产 8.22392384971
+仇萌芽 13.900677652
+推行 6.82317959841
+推衍 11.5027823792
+三乡 12.1089181827
+洒扫应对 13.900677652
+贝斯 12.5143832909
+像框 12.1089181827
+入村 13.2075304714
+批判力 13.2075304714
+老阁 13.900677652
+小梅 9.5186510173
+螫针 12.8020653633
+预告 7.93967231235
+远道 10.2897597393
+昌吉市 12.2912397395
+戈壁滩 10.4349417492
+寻迹 12.5143832909
+停付 12.2912397395
+三世 8.26588804881
+研修 11.2616203224
+三丈 10.0088573539
+三下 9.55687223012
+三上 11.3357282945
+一竖 10.8561552143
+词曰 11.8212361103
+探亲 9.35738286971
+词曲 9.80633308975
+三一 9.6811699468
+三七 9.66657114738
+一站 8.89673134603
+三万 8.6803218269
+花缎 11.8212361103
+一章 8.56795885871
+旌节 11.1926274509
+环境危害 13.900677652
+远避 11.0674643079
+掺假 10.8096351986
+求助 9.41204128224
+垂头塞耳 13.900677652
+探井 11.8212361103
+三个 5.19617536225
+一字一顿 10.1164880181
+唇红 11.7034530746
+杨小纲 11.1926274509
+三两 10.1164880181
+同宝钗 13.900677652
+花结 13.2075304714
+花绒 12.5143832909
+三保 10.7226238216
+巴夏礼 12.5143832909
+皮萨至 13.2075304714
+语出惊人 10.9562386728
+堂子里 12.8020653633
+停会 13.900677652
+赤卫军 12.8020653633
+遮瑕膏 12.5143832909
+削低 13.900677652
+三俊 13.2075304714
+患难与共 10.6818018271
+一笔 7.13333452671
+党群关系 12.8020653633
+食用者 12.5143832909
+生态效益 10.4994802703
+计划署 11.7034530746
+热度 8.80692745117
+岑著 13.2075304714
+茶树 8.60737282725
+老韩 9.62401153296
+孙洙 13.2075304714
+一第 12.1089181827
+黑水洋 12.5143832909
+电视节目 9.65218240993
+花绣 10.9562386728
+未经 7.6761192227
+休士顿 13.900677652
+轻工业部 12.2912397395
+四大块 13.2075304714
+新营 12.5143832909
+茭白 10.5684731418
+推见 13.900677652
+巴士 10.8096351986
+探伤 10.9562386728
+饲养室 11.0674643079
+冬雨 11.4157710022
+入暮 12.8020653633
+词条 10.9049453784
+新著 12.5143832909
+慈颜 12.5143832909
+无所不有 11.5027823792
+一等 8.47133202302
+唇缘 12.8020653633
+一筒 11.4157710022
+矮脚 11.1280889297
+尖锐化 10.3171587135
+不无裨益 13.900677652
+停住 7.70423352418
+海岸公路 12.5143832909
+锦被 11.1926274509
+研习 9.69598503258
+二集 12.2912397395
+冷冷冰冰 13.900677652
+花纹 8.05423887692
+花纸 11.9547675029
+齐和帝 12.8020653633
+花线 13.2075304714
+谢公公 13.900677652
+第三卷 8.11071748108
+盖顶 11.1926274509
+一辆车 9.40086798165
+三侠 12.8020653633
+普法教育 13.900677652
+战洪州 13.2075304714
+一签 10.9562386728
+锦袍 10.0720362555
+拳击赛 13.2075304714
+求医 10.4349417492
+燕青射 13.2075304714
+氧化亚铜 12.8020653633
+小河沟 11.7034530746
+响动 8.74738605748
+连绵 8.93783302172
+酯类化合物 13.2075304714
+求取 10.3743171274
+方用香 12.5143832909
+三位 7.72897705456
+一算 9.98865464655
+尤文图斯 12.2912397395
+五六千元 12.2912397395
+妊娠纹 11.598092559
+求变 11.4157710022
+涅磐 12.5143832909
+深发展 8.21031819765
+预售 8.7245279194
+老靠 13.900677652
+一管 10.4349417492
+无声无色 12.8020653633
+电泳技术 12.5143832909
+涧沟 12.2912397395
+胡里奥 13.900677652
+贸易赤字 9.66657114738
+猎者 13.2075304714
+费密 12.2912397395
+萨莫拉 12.8020653633
+誊录 11.9547675029
+后房 12.1089181827
+价目表 12.5143832909
+崂山 10.4666904475
+睡鼠 11.5027823792
+三会 11.1280889297
+暗红色 9.34680076038
+一篇 7.57990935773
+等价交换 10.4994802703
+入春 11.8212361103
+掺入 9.94943393339
+二十张 13.2075304714
+莫过如此 13.900677652
+一篓 11.4157710022
+九十余万 12.5143832909
+订个 11.9547675029
+三伏 10.9049453784
+繁荣昌盛 10.765183436
+戛然 11.9547675029
+皇爷 8.12923652885
+一业为主 13.2075304714
+乃蛮 10.3743171274
+一篮 11.0103058941
+菊花瓣 12.8020653633
+凝冻 12.1089181827
+勒努瓦 12.8020653633
+托合齐 12.1089181827
+三伯 10.604840786
+顾其子 13.2075304714
+老底 11.2616203224
+中广网 9.69598503258
+修缮一新 13.2075304714
+慕容云 12.8020653633
+一码 11.0103058941
+明细帐 13.900677652
+叙家常 11.3357282945
+工技 13.900677652
+六五年 12.8020653633
+直系亲属 10.7226238216
+红苔薄 12.5143832909
+反给 12.5143832909
+凝剂 13.900677652
+入时 11.1926274509
+漫过 10.2371160058
+寻购 13.2075304714
+猎获 11.1280889297
+围巾 9.58318953844
+命笔 12.5143832909
+北京市建委 13.900677652
+泄露秘密 12.8020653633
+鸭池 12.8020653633
+束腹 13.900677652
+不可判定 12.1089181827
+撒腿就跑 11.0103058941
+束腰 10.8096351986
+苏禄王 12.8020653633
+遍历性 13.900677652
+眉宇 10.0940151622
+外行星 11.2616203224
+团购 9.87532596124
+化整为零 10.8561552143
+求偿 13.900677652
+殷富者 12.8020653633
+糊口 9.82314020807
+跑跑步 13.900677652
+穷举法 13.900677652
+麦克斯 11.5027823792
+弹体 9.4233408375
+噪声 8.4284069783
+尚鬼 12.8020653633
+警徽 13.900677652
+一个十三四岁 11.8212361103
+兴观群怨 12.5143832909
+预算案 10.8561552143
+灰霉 13.900677652
+经海道 12.8020653633
+热工 11.8212361103
+加幸欢 12.8020653633
+粟戎生 13.900677652
+小仙 11.4157710022
+阵阵 8.36728816325
+许大龄 12.2912397395
+贝松 13.2075304714
+红陶 11.8212361103
+陈垣 10.7226238216
+默祝 12.1089181827
+束脩 13.2075304714
+和平相处 11.4157710022
+求值 12.8020653633
+另眼相看 10.4349417492
+热水澡 11.3357282945
+摘葡萄 12.1089181827
+重要一环 10.2630914922
+保险公司 7.11396070137
+犯罪集团 11.1280889297
+赖和木 13.2075304714
+贝林 11.8212361103
+套起来 13.900677652
+肾阴 10.4666904475
+哈普斯堡 11.3357282945
+少儿部 12.2912397395
+合法收入 13.2075304714
+架得住 12.8020653633
+一碗 7.46773755924
+高聚物 10.642581114
+一碟 9.93038573842
+柏卫华 10.3743171274
+吴数德 12.8020653633
+反派 13.2075304714
+东拉河 9.04086524761
+雷克塔 12.8020653633
+一碰 9.85762638414
+南疆铁路 11.7034530746
+入教 11.7034530746
+阵雨 10.4349417492
+阵雪 11.9547675029
+分光仪 12.8020653633
+翦伯赞 10.8096351986
+花絮 10.9562386728
+允文 13.2075304714
+半自耕农 13.2075304714
+牙齿痛 13.900677652
+申贝 11.5027823792
+殖民军 9.87532596124
+还魂 10.6818018271
+褐藻 10.8561552143
+糊化 12.2912397395
+地雷场 11.7034530746
+食用菌 10.1630080337
+层级制 13.2075304714
+缤纷 10.0294766411
+珍珠母 12.2912397395
+寻路 10.1164880181
+乳腺病 12.2912397395
+贝柴 12.5143832909
+坑道 8.45825994145
+数十首 13.900677652
+国内形势 10.533381822
+娄迦 12.2912397395
+操作失误 11.1280889297
+佐丹奴 13.2075304714
+装备部 10.5684731418
+无限大 10.6818018271
+五色土 13.2075304714
+未推动 13.900677652
+仔仔细细 10.6818018271
+孜孜不息 13.2075304714
+谢军 11.9547675029
+鸱枭 12.5143832909
+菊花石 12.1089181827
+制造 5.52620076276
+檐墙 13.2075304714
+熟食品 13.2075304714
+严词拒绝 11.9547675029
+打气筒 13.2075304714
+花糖 13.900677652
+手机电池 11.7034530746
+数十项 11.9547675029
+许都 9.41204128224
+摊子 8.71889410168
+六十余门 13.900677652
+推说 9.6811699468
+费好 13.2075304714
+几万千米 12.8020653633
+储波 12.5143832909
+铸铁管 11.8212361103
+凝华 10.8561552143
+热岛 11.5027823792
+推诚 11.598092559
+波拉斯 12.8020653633
+灰陶 13.2075304714
+四八三十二数 13.900677652
+万箭穿身 13.2075304714
+求全 12.2912397395
+莫洛托夫 10.533381822
+三十公里 12.8020653633
+第三匹 13.2075304714
+谢公 13.2075304714
+求其 11.0103058941
+划过去 12.2912397395
+西隆 11.9547675029
+锥栗 11.9547675029
+裤装 11.7034530746
+陈陈相因 12.2912397395
+肴馔 10.7226238216
+奥兰加 13.2075304714
+郭子章 13.2075304714
+推论 9.33632946051
+推许 11.598092559
+储油 11.0103058941
+赞同者 12.8020653633
+预埋 11.598092559
+胡里安 13.900677652
+铁杵 11.7034530746
+诚心实意 11.9547675029
+宋彦通 11.5027823792
+国家安全部 12.2912397395
+发好 12.8020653633
+多得多 9.24671730182
+梅迪西 13.2075304714
+疏离 11.4157710022
+配套措施 10.5684731418
+花粉 8.95903522937
+精灵鬼怪 13.900677652
+落日余晖 11.9547675029
+灰阶 13.900677652
+惹事生非 11.3357282945
+一票 9.40086798165
+窥视 9.62401153296
+窥见 10.2371160058
+略加修饰 13.900677652
+阿普尔 13.2075304714
+南空 13.900677652
+田积粟 13.2075304714
+费多 11.0674643079
+构建 7.56208357377
+刺毛虫 13.900677652
+塞瓦斯托波尔 11.2616203224
+幻日 13.900677652
+坑里 9.72629038208
+观世音 9.77354326693
+袖扣 13.900677652
+死乞白赖 11.9547675029
+一禁 13.900677652
+生死状 11.5027823792
+班智达 12.8020653633
+发觉出 13.2075304714
+西阳 11.598092559
+及时发现 9.4233408375
+围屏 10.9562386728
+灰雀 13.900677652
+杨雪正 12.8020653633
+柏纳李 13.900677652
+里安 11.1280889297
+涧溪 12.8020653633
+糊剂 12.8020653633
+英语书 13.900677652
+以寡击众 13.900677652
+转隶 12.5143832909
+透不过 11.1926274509
+待处理 13.900677652
+激射 11.1280889297
+穆尔加 12.2912397395
+招聘员工 12.2912397395
+一个套 11.5027823792
+邓二人 11.9547675029
+贝塔朗菲 12.1089181827
+民为贵 12.1089181827
+松岭 11.1926274509
+背叛 8.29487558568
+葛雍 12.8020653633
+连网 11.9547675029
+减反射膜 12.1089181827
+费信著 12.8020653633
+求出 9.35738286971
+诸葛尚 12.5143832909
+内部监督 12.5143832909
+职业生涯 9.93038573842
+一个头 9.24671730182
+西陵 10.9562386728
+皴法 11.598092559
+西陲 10.9049453784
+图形图表 13.900677652
+一种 4.13163619599
+一秒 10.4994802703
+和平力量 12.5143832909
+承恩袭 13.2075304714
+一科 8.04560572977
+群众心理 12.5143832909
+花簇 11.7034530746
+储氢 11.8212361103
+扬波 11.9547675029
+金线鱼 11.7034530746
+西院 10.9562386728
+搜掠 13.900677652
+客随主便 12.2912397395
+正义战争 11.2616203224
+一个多 8.59737274392
+曹梦炎 13.2075304714
+分门别类 9.7898037878
+本该如此 11.9547675029
+液面 10.4349417492
+陈揖怀 9.56994431169
+缺衣少食 12.2912397395
+另一端 9.01787572939
+醉客 13.900677652
+新学期 12.1089181827
+触发器 11.4157710022
+减阻剂 12.1089181827
+阳光集团 13.2075304714
+帐户 9.31571017331
+乙酰胺 11.4157710022
+红阳 11.4157710022
+行走路线 13.2075304714
+难以形容 10.4666904475
+申诉 9.21854642485
+那用 11.4157710022
+牛金牛 11.8212361103
+报道失实 13.2075304714
+仪陇县 12.1089181827
+张卓元 11.9547675029
+十二万两 13.2075304714
+花篱 12.8020653633
+圣文森特岛 12.8020653633
+光学玻璃 10.8096351986
+诸种 10.642581114
+私运 12.1089181827
+弱智 10.765183436
+申请 6.01949544975
+都静静 12.8020653633
+弘光朝 11.9547675029
+客观存在 9.62401153296
+鄙人 10.0294766411
+热害 12.8020653633
+反应热 12.5143832909
+诸科 12.5143832909
+热容 11.1926274509
+花篮 10.0294766411
+铜匠 12.1089181827
+制革 8.77671367257
+精神文明 9.25628675283
+不断扩大 8.24119543622
+宗王皇后 12.8020653633
+邱创焕 13.2075304714
+山东 5.86281141727
+肾部 13.900677652
+反应炉 13.900677652
+通信业 11.8212361103
+限期完成 12.5143832909
+紧固件 11.2616203224
+限制型 12.8020653633
+北京市卫生局 12.8020653633
+合成洗涤剂 11.1926274509
+凝合 12.5143832909
+相信组织 12.5143832909
+留连忘返 12.1089181827
+申论 10.3453295905
+老幺 13.900677652
+闭门器 13.900677652
+制宜 12.1089181827
+鸡婆 12.2912397395
+浪卡子县 12.5143832909
+山明水秀 11.0674643079
+来朝贺 11.598092559
+西里 10.4349417492
+老广 12.5143832909
+不耻下问 12.8020653633
+自民党 10.3453295905
+石燕贝 12.2912397395
+罗文 10.3171587135
+花筒 13.900677652
+玄奘寺 12.8020653633
+任课老师 13.2075304714
+骆玉笙 12.1089181827
+寻访 9.5062284973
+围子 11.4157710022
+凌虚子 12.5143832909
+朱光潜 11.4157710022
+直方图 12.8020653633
+猖獗 8.83808261895
+分清是非 11.598092559
+神鬼 9.84023464143
+林贝 12.5143832909
+诅咒 8.66956903512
+一红 9.25628675283
+掺合 11.9547675029
+一级 6.61860399388
+制鞋 9.5062284973
+糜竺来 13.2075304714
+广六州 12.2912397395
+农桑辑 11.598092559
+尼格利 10.9562386728
+诸神 9.29550746599
+恒温器 12.8020653633
+重型汽车 11.7034530746
+埃拉特 12.8020653633
+固执己见 11.598092559
+一线 6.7047404255
+慕容令 12.2912397395
+国家发展计划委员会 13.900677652
+戴静华 13.2075304714
+安全电压 12.5143832909
+业务经理 10.642581114
+摊摊 12.1089181827
+可倾斜 13.900677652
+融冰化 13.2075304714
+蛇蟠 12.8020653633
+一经 8.08654712015
+吸虫病 12.2912397395
+帕提亚 10.2117981979
+东滨波 13.900677652
+串铃 11.8212361103
+推谢 13.900677652
+一统 9.18217878068
+一绝 10.1164880181
+罗泰和 13.2075304714
+联络人 11.9547675029
+热学 10.1164880181
+忘情负义 13.900677652
+热季 12.5143832909
+农业税 11.1280889297
+毗湿奴 10.0720362555
+决策者 8.82550383674
+违犯者 13.900677652
+一维 9.66657114738
+一绺 9.98865464655
+安其妻 13.900677652
+吴三挂 11.4157710022
+猖狂 9.53122979951
+凶手 9.24671730182
+西邻 9.77354326693
+西邸 12.5143832909
+贝思 12.8020653633
+毛藻科 12.5143832909
+金江街 12.1089181827
+新老 9.58318953844
+几阵 11.5027823792
+一缕 8.61747392324
+西邦 12.2912397395
+塑料盒 12.8020653633
+高速度 9.82314020807
+赵应元 11.5027823792
+颜渊 13.2075304714
+一缩 10.1630080337
+三百六十五天 11.9547675029
+豁亮 11.3357282945
+秋末 10.7226238216
+本质特征 11.1926274509
+花童 13.2075304714
+粉丝汤 13.2075304714
+勐腊 11.9547675029
+预冷 12.1089181827
+一缸 11.4157710022
+高贵不贵 13.900677652
+褐色 8.15767446417
+紫貂 10.2630914922
+西都 11.9547675029
+金章紫绶 13.900677652
+新联 12.8020653633
+丝束 13.900677652
+万亿法郎 13.2075304714
+普莱西 13.2075304714
+乱改 11.7034530746
+知足常乐 12.2912397395
+一罐 10.3453295905
+一网 11.1926274509
+制陶 9.12999302751
+培英 13.900677652
+曹仁令 13.2075304714
+二十家 11.8212361103
+张园 11.9547675029
+西郡 12.5143832909
+肾小球 9.20019728618
+侗乡 12.8020653633
+塔格利 13.900677652
+一罩 12.8020653633
+都市计划 13.900677652
+传呼机 12.5143832909
+另一类 8.52078029844
+法兰克福市 12.8020653633
+罗斯 8.91707103027
+衣食父母 11.4157710022
+施行细则 12.5143832909
+贝恩 10.4994802703
+笋丝 11.9547675029
+投入使用 8.99540287354
+峰峦叠嶂 12.5143832909
+掀开 8.6803218269
+银壶 11.9547675029
+花穗 12.5143832909
+倾斜地 12.8020653633
+推走 12.1089181827
+虎林县 11.9547675029
+推起 11.1280889297
+王爷庙 12.8020653633
+城市组团 13.2075304714
+许褚领 13.2075304714
+丝极 13.900677652
+有机合成 9.54396882529
+远销 8.4980002701
+亡父 11.598092559
+申脉 12.8020653633
+开心起来 13.900677652
+吕第亚 12.8020653633
+事典 11.9547675029
+西通 9.75754292558
+入手 8.37124856446
+还养 10.9562386728
+费心 9.48183704418
+花空 12.5143832909
+西递 13.900677652
+郭春涛 13.2075304714
+既定政策 12.1089181827
+入托 12.2912397395
+从没 8.30969067146
+限制器 11.8212361103
+叶春 11.5027823792
+喜盈门 13.900677652
+多得很 10.1871055853
+另见 13.900677652
+槽牙 12.1089181827
+杆织机 13.2075304714
+预兆 9.35738286971
+闻卿 13.900677652
+许褚飞 13.2075304714
+业态 9.44633035572
+新胜 13.2075304714
+芷馨 13.2075304714
+羞于 10.5684731418
+入户 9.96885201925
+申言 13.2075304714
+王御弟 12.2912397395
+费德 11.9547675029
+珍珠泉 11.1280889297
+五十余节 13.2075304714
+弹丸 9.20019728618
+润滑剂 10.0720362555
+碧健 13.2075304714
+牛录章 11.7034530746
+金平阳 13.2075304714
+漳平 11.5027823792
+打票 13.2075304714
+刘秀荣 13.2075304714
+经营机制 11.1926274509
+峨边县 13.900677652
+串门 9.66657114738
+花科 10.9049453784
+远隔 10.765183436
+事先 7.30353195009
+管辖权 9.31571017331
+一簇 9.56994431169
+异于 9.87532596124
+士氏 13.900677652
+地对空 10.533381822
+求告 10.3171587135
+异事 10.4666904475
+老郑 10.2630914922
+士民 8.64318227995
+士气 8.06294720481
+诗三百 12.8020653633
+装进来 12.8020653633
+花种 12.8020653633
+牙克石市 11.9547675029
+武汉大学 9.55687223012
+制锁 12.8020653633
+促膝谈心 11.7034530746
+新茶 9.96885201925
+八月份 10.3171587135
+汤原 12.2912397395
+慢慢来 10.9049453784
+老郭 11.2616203224
+放养密度 13.900677652
+阿尔凯奥 13.900677652
+热稳定性 10.533381822
+和福军 11.9547675029
+瓦尼亚 11.2616203224
+吴淞西 13.2075304714
+异人 10.604840786
+八八六十四队 13.2075304714
+受俸 13.900677652
+多闻阙疑 13.900677652
+求同 12.2912397395
+泥污 10.7226238216
+萨尔达渠 13.900677652
+陶瓷产品 12.1089181827
+百废待兴 10.9562386728
+东森 11.3357282945
+老邓 9.74179456862
+十八变 13.900677652
+费尽 10.4994802703
+费尼 12.1089181827
+仇者快 12.1089181827
+申覆 11.8212361103
+阴司 10.2897597393
+摊配 12.2912397395
+坐井观天 11.598092559
+老祖宗 9.28555713513
+商献洛 12.8020653633
+陆夫人 13.900677652
+老邱 13.900677652
+一米 8.83177344976
+致死温度 13.900677652
+三级网络 13.900677652
+一类 6.5540224888
+新药 9.89334446674
+涉赌 11.1280889297
+萧蔷 12.8020653633
+尿潴留 11.5027823792
+淳熙 9.96885201925
+酒筵 11.1280889297
+无伤 11.0103058941
+成元宝 12.5143832909
+哺乳期 10.3453295905
+花神 11.598092559
+一粒 8.49350588052
+深层次 8.57766767284
+老道 9.32596667347
+万民涂炭 12.8020653633
+六七条 13.900677652
+云栖寺 13.900677652
+热障 13.2075304714
+潘忠 12.2912397395
+腊月初 12.1089181827
+健身法 13.900677652
+马塞道 13.2075304714
+崇高品质 13.2075304714
+噗哧 9.84023464143
+蛐蛐 10.9049453784
+玉不琢 12.8020653633
+虾子 11.5027823792
+残砖断瓦 13.900677652
+怡然自乐 13.2075304714
+热天 10.9049453784
+音乐声 10.604840786
+凝固 8.34771806705
+反应物 9.58318953844
+贿赂案 12.1089181827
+预制 10.0088573539
+唐山人 13.2075304714
+松岗 13.2075304714
+花祭 13.900677652
+北京市西城区人民法院 13.900677652
+卡西基亚雷河 13.900677652
+临别赠言 12.8020653633
+绿化率 11.1926274509
+预算法 11.7034530746
+求和 8.70772080109
+命令主义 12.5143832909
+异义 12.2912397395
+古洛夫 13.2075304714
+敢唱 13.900677652
+温暾 13.900677652
+保亭县 12.8020653633
+势力范围 8.70772080109
+夹道欢迎 11.1280889297
+猎蝽 13.900677652
+张柏芝 11.9547675029
+法语区 12.5143832909
+蜗牛 9.63799777493
+噗咚 12.5143832909
+麦门冬 13.900677652
+臭氧浓度 12.5143832909
+文学思潮 11.5027823792
+篇数 12.8020653633
+鸭梨 10.2630914922
+钟英 11.7034530746
+寻见 10.7226238216
+许妈妈 10.4666904475
+欧拉 9.33632946051
+寻觅 8.87679713113
+无何 12.5143832909
+乃至 6.97018288602
+一系 10.4349417492
+人口普查 10.1871055853
+厚厚的 8.28027678626
+皇甫 10.8561552143
+科特迪瓦 9.66657114738
+搅拌 9.12999302751
+求商 13.900677652
+无产 10.9562386728
+输卵管 9.55687223012
+舒克申 13.2075304714
+白克明 13.900677652
+穿梭机 13.900677652
+交直流 12.1089181827
+郦琼 12.8020653633
+新舟 12.8020653633
+迪里拜尔 13.2075304714
+老金 10.1164880181
+打官司 9.33632946051
+萨布素 11.598092559
+奇丑无比 13.2075304714
+编制工作 9.77354326693
+蛇蝎 11.0674643079
+无人 6.91967191125
+查缉 12.2912397395
+培育 7.18287295695
+剑侠传 12.5143832909
+师叙功 13.2075304714
+推进 5.73730633552
+任淞沪 12.1089181827
+祁连山 8.58747167293
+和春英 13.2075304714
+七上八下 9.40086798165
+词意 11.1280889297
+顿首 9.71102290995
+尽人事 11.2616203224
+片面化 12.5143832909
+防鼠 12.2912397395
+程序控制 10.5684731418
+矢志不屈 13.900677652
+机车车辆 10.2897597393
+珍珠港 9.85762638414
+关键部位 11.2616203224
+推过 11.4157710022
+法西斯蒂 13.900677652
+围墙 8.41173992582
+子宗训 12.8020653633
+抛光剂 12.1089181827
+老醋 11.9547675029
+猴头菌 12.5143832909
+套印本 13.900677652
+鱼龙变化 13.2075304714
+异俗 13.900677652
+无价 10.8096351986
+美国作家 10.0720362555
+锌板 13.2075304714
+贝扎 11.8212361103
+摊开 9.16447920358
+覆盖范围 10.1394775363
+预发 13.900677652
+周汝昌 13.900677652
+草袋子 13.2075304714
+吸着烟 10.2371160058
+业报 13.2075304714
+求售 12.1089181827
+无从 8.45825994145
+玉帝礼 13.2075304714
+通都大邑 11.9547675029
+测长仪 12.8020653633
+西澳大利亚 10.3453295905
+寻衅 10.2630914922
+航政司 13.900677652
+醉鱼草 13.2075304714
+可判定性 13.2075304714
+五六千块 13.2075304714
+畅想曲 13.2075304714
+教师节 11.5027823792
+评分标准 11.3357282945
+几十包 12.8020653633
+费工 11.3357282945
+睡饱 13.900677652
+制钱 10.1164880181
+老酒 10.2630914922
+弱旅 13.900677652
+无主 9.54396882529
+醉心 10.9049453784
+平凉市 11.8212361103
+推车 9.87532596124
+反劫机 12.5143832909
+搅打 13.2075304714
+防龋 12.8020653633
+肥皂水 10.4994802703
+无一 8.85082164473
+噗嗤 11.9547675029
+业扩 13.2075304714
+锌极 13.900677652
+无上 10.0720362555
+小题目 12.1089181827
+里亚宾 12.8020653633
+无不 7.40541209604
+万夫莫开 11.7034530746
+吕不韦 10.8561552143
+哈利斯科州 13.2075304714
+官吴革 13.2075304714
+无业 10.9049453784
+搅扰 10.1394775363
+泗洲 12.8020653633
+帕里亚 12.2912397395
+二十天 9.85762638414
+花砖 11.7034530746
+普莱诺 13.2075304714
+异位 10.2897597393
+二十大 10.8096351986
+醉得 11.2616203224
+苏醒过来 10.2371160058
+另一组 10.3743171274
+预卜 11.2616203224
+慈禧膝 13.900677652
+热塑 11.8212361103
+质量检查 12.8020653633
+讪讪 10.4349417492
+农业社 11.9547675029
+二十头 11.9547675029
+薛肇明 13.2075304714
+无限小 11.5027823792
+卡蒂亚 13.2075304714
+西兴镇 12.5143832909
+拟人化 11.2616203224
+制铁 10.604840786
+失措 11.0674643079
+诸税 12.5143832909
+普莱诗 12.5143832909
+有效期限 11.5027823792
+串音 13.900677652
+第二十七次 12.2912397395
+围堵 10.4666904475
+阙左门 12.5143832909
+入怀 10.9562386728
+围堰 11.5027823792
+几万克 12.8020653633
+士淳 13.2075304714
+千愁万绪 13.900677652
+纳米布 12.5143832909
+乃能 12.1089181827
+鹧鸪天 12.5143832909
+离团 13.900677652
+围堤 11.4157710022
+业户 12.5143832909
+王干 13.2075304714
+摸得着 10.604840786
+民族化 10.4349417492
+衬布 13.900677652
+周家为 13.2075304714
+贝洛 11.2616203224
+围城 8.79473217808
+吕保维 12.8020653633
+强而有力 11.9547675029
+锣鼓点 11.3357282945
+泥水 9.59661255877
+复旧如初 13.900677652
+年久 10.642581114
+蒙兀儿 11.8212361103
+求婚 9.58318953844
+免冠 11.5027823792
+侃快 12.8020653633
+万品 12.8020653633
+花石 12.2912397395
+坑骗 12.8020653633
+新贵 9.84023464143
+肝肿大 11.7034530746
+掀动 10.7226238216
+亡羊 13.900677652
+疏狂 12.5143832909
+湖北省总工会 13.2075304714
+侯俊山 12.5143832909
+一爱 13.2075304714
+新账 12.1089181827
+新货 12.5143832909
+二十四 8.51160592216
+只守 11.8212361103
+搅混 11.3357282945
+大客机 13.900677652
+一爿 10.9049453784
+屁股痛 13.900677652
+新购 11.7034530746
+费利 13.2075304714
+默不做声 10.604840786
+一片 5.59742053112
+枯木死灰 13.900677652
+铝土 9.61021821083
+醉倒 10.7226238216
+一个劲 11.1280889297
+祖福临 13.2075304714
+年下 12.1089181827
+入学考试 13.2075304714
+算来算去 12.1089181827
+象山区 13.900677652
+铝圈 13.2075304714
+柑桔 10.604840786
+取信于民 11.5027823792
+桓之族 13.2075304714
+飘洒在 13.900677652
+老麦 13.900677652
+一物 9.54396882529
+长清镇 13.900677652
+王敦攻 12.8020653633
+年丰 13.900677652
+王迎儿 13.2075304714
+郭正域 12.2912397395
+李显斌 13.900677652
+黄鹄兮 13.2075304714
+祖孙二人 13.900677652
+围垦 9.7898037878
+稳产 11.0103058941
+佟小雷 10.6818018271
+姬重耳 13.900677652
+奥兰多 11.0674643079
+渝中区 11.5027823792
+学说话 13.2075304714
+围坐 10.642581114
+没精打采 10.604840786
+高速化 12.5143832909
+花着 13.2075304714
+汪汪叫 12.8020653633
+狼牙棒 10.3171587135
+拉普捷夫 11.4157710022
+赵王伦 11.5027823792
+热土 11.1280889297
+年仅 9.11318590919
+搅浑 11.8212361103
+诸葛均 12.2912397395
+工于心计 11.2616203224
+年份 8.06294720481
+俯身 8.80692745117
+转守为攻 11.7034530746
+电器城 11.7034530746
+互质 13.900677652
+狗颠屁股 12.5143832909
+甜叶菊 13.2075304714
+老鹰 9.96885201925
+掀到 12.1089181827
+夏尔洛 12.5143832909
+一状 11.1280889297
+词源 9.65218240993
+篇次 12.2912397395
+承前启后 10.9049453784
+费勒 11.9547675029
+年代 5.04330481915
+增值税 8.87023973058
+乌密 10.7226238216
+从晓霞 12.5143832909
+张元 12.2912397395
+拉美一体化协会 13.2075304714
+决不允许 11.2616203224
+盖里 13.900677652
+顿涅茨克 12.8020653633
+骅骝 12.8020653633
+赶回来 9.59661255877
+京津 9.62401153296
+年事 12.5143832909
+孙权既 12.2912397395
+夏无冬 11.8212361103
+诸申 13.2075304714
+费劲 9.56994431169
+长叶松 12.8020653633
+鼻中膈 13.900677652
+老鸟 12.2912397395
+色情网站 10.4349417492
+最低点 8.38322475551
+医学知识 10.765183436
+倒像 8.9519177616
+围场 10.2117981979
+老鸦 10.0294766411
+老鸨 11.0674643079
+祁连县 12.8020653633
+老鸭 12.5143832909
+花眼 11.2616203224
+个人成长 13.900677652
+太山 11.3357282945
+唐会 11.0103058941
+费力 8.80692745117
+压轴戏 11.8212361103
+诸生 9.96885201925
+围在 9.06439574502
+老鸹 10.642581114
+年产 7.58351296523
+快让开 13.2075304714
+防部 13.900677652
+新路 9.93038573842
+洋奴哲学 13.900677652
+娄萌 9.91169360541
+花盒 13.900677652
+哈佛大学商学院 13.900677652
+花盘 10.2371160058
+子邓忠 11.9547675029
+授首 11.7034530746
+优柔 11.9547675029
+伊加尔 13.900677652
+求子 11.0103058941
+严云京 9.96885201925
+花盆 9.85762638414
+制胜之道 11.9547675029
+贝氏 12.2912397395
+基元 11.2616203224
+掌夏州 13.2075304714
+站不住 10.2117981979
+榜前列 9.89334446674
+潘文华 12.8020653633
+求学 8.93783302172
+千金子 13.900677652
+黎锦晖 11.8212361103
+蘼芜 12.1089181827
+张邦基 13.900677652
+围困 8.2273543848
+一个双 11.7034530746
+公用事业 8.70772080109
+紫胶 9.80633308975
+段德昌 12.8020653633
+摊入 11.5027823792
+左右束 13.900677652
+紫鹃 9.0884932966
+过门儿 13.900677652
+年会 8.89673134603
+老龄 10.3743171274
+枭首示众 11.5027823792
+抄过 12.1089181827
+亿美金 10.765183436
+樱桃小嘴 12.8020653633
+播出去 12.8020653633
+李侍尧 13.900677652
+熟食店 13.900677652
+二十面 13.900677652
+权益保护法 13.2075304714
+由嘉轩 13.2075304714
+铜街子 12.8020653633
+只在乎 11.9547675029
+贝汉 12.5143832909
+老龟 11.3357282945
+抄近 12.2912397395
+摊儿 10.9562386728
+稳便 10.7226238216
+松油烯 12.5143832909
+甘宁 10.0940151622
+闻一知十 13.900677652
+红白喜事 11.3357282945
+这二 11.7034530746
+防酸 13.900677652
+猎装 12.1089181827
+沈端先 12.8020653633
+麦考密克 12.1089181827
+精神赔偿 12.5143832909
+均衡性 10.6818018271
+顾此失彼 10.8561552143
+恒温室 13.2075304714
+保持警惕 10.3743171274
+随顺 10.9049453784
+汉堡港 12.2912397395
+杨志戴 13.2075304714
+金镶玉 12.2912397395
+倒逼 9.62401153296
+爱尔维修 11.8212361103
+受够了 10.765183436
+游艇 9.43476953332
+还通 12.5143832909
+兰心蕙性 13.900677652
+稳住 9.04864738806
+娄邵 11.8212361103
+洛赛克 13.2075304714
+晋愍帝 12.1089181827
+林冲心 13.900677652
+新貌 12.1089181827
+纱橱 13.900677652
+年俸 12.8020653633
+重重围住 13.900677652
+常澍田 13.2075304714
+流过来 13.2075304714
+非常复杂 9.35738286971
+豫港 13.900677652
+一环 9.40086798165
+花柳科 13.2075304714
+倒退 8.47133202302
+一个半 9.54396882529
+求导 11.8212361103
+一个十 11.5027823792
+荫蔽 10.9562386728
+五龙潭 12.5143832909
+入港 10.8561552143
+公立学校 11.0103058941
+乳突炎 11.9547675029
+很妙 13.900677652
+松山 8.56795885871
+推脱 10.4994802703
+表面起泡 13.900677652
+万多 8.32472854883
+平引兵 13.900677652
+梁政委 12.5143832909
+费县 11.598092559
+求实 11.2616203224
+济困扶危 12.5143832909
+老鼠 7.47095817394
+栋宇 12.8020653633
+血气之勇 11.9547675029
+形格势禁 12.2912397395
+灰鲸 12.1089181827
+金镶珠 13.900677652
+金容淳 13.2075304714
+一班 8.4284069783
+万处 11.9547675029
+命题逻辑 11.8212361103
+一个包 11.0674643079
+互赠 11.2616203224
+丝毯 11.598092559
+眼霜 9.84023464143
+丝毫 7.30080715276
+第一次世 13.900677652
+紫菀 12.5143832909
+撤防 12.2912397395
+构型 9.45802639549
+玉美人 13.900677652
+宝应 9.89334446674
+夏口厅 12.8020653633
+扶师父 12.5143832909
+墨迹未干 12.2912397395
+旌表 12.2912397395
+响头 10.3171587135
+防蚀剂 13.900677652
+护着 9.71102290995
+三十多万 11.9547675029
+西阿尔 13.2075304714
+紫菜 9.59661255877
+还债 9.48183704418
+弄个 10.0940151622
+西龙 12.5143832909
+远大 9.84023464143
+驻足不前 13.2075304714
+法定条件 10.9562386728
+弄丢 11.1280889297
+二十品 11.7034530746
+紫菱 11.8212361103
+浚县 9.93038573842
+连胖子 11.7034530746
+编译语言 12.2912397395
+后继有人 11.3357282945
+老鲁 10.7226238216
+一两万元 12.1089181827
+谢鸪档 12.5143832909
+清华大学电机系 13.2075304714
+秋毫之末 13.2075304714
+签着 13.2075304714
+讨厌鬼 12.5143832909
+测定 7.11735245137
+肉店 11.7034530746
+廷杖 9.98865464655
+经东昌 13.2075304714
+触目惊心 9.17328983326
+哈杜尔舒 13.2075304714
+美登素 12.1089181827
+词汇 8.52539924429
+品论 13.2075304714
+速记法 13.2075304714
+一火 12.5143832909
+种肥 12.2912397395
+李永贞 13.2075304714
+卡亚俄 12.2912397395
+一灯 11.1926274509
+大黑汀 12.1089181827
+谷五郡 13.2075304714
+灰鼠 10.0088573539
+输注 11.1926274509
+新车 8.02574692112
+袒护着 13.900677652
+梦想家 12.5143832909
+环形阵 13.900677652
+弄乱 11.3357282945
+耶律亿 11.4157710022
+磕头虫 13.2075304714
+紫草 10.9562386728
+卫星转播 13.900677652
+天笑笑 13.2075304714
+掀倒 11.7034530746
+桐柏路 10.1164880181
+一炖 13.2075304714
+弄些 10.4994802703
+巴多 12.5143832909
+入海 8.05713323494
+大黑河 11.0103058941
+洛霍 13.900677652
+庞元 12.2912397395
+荒废多年 12.8020653633
+四万斤 13.2075304714
+度盘 11.8212361103
+卜鲁罕 12.1089181827
+入流 11.8212361103
+百日咳 10.8096351986
+逞恶 13.900677652
+陈仲才 12.5143832909
+唇瓣 11.598092559
+陶世恩 12.8020653633
+课本费 13.900677652
+清莹 13.900677652
+华南虎 9.7898037878
+一点 4.86350089901
+数十里 10.2117981979
+骇怕 12.5143832909
+宝庵 13.900677652
+肌苷酸 13.900677652
+新近 8.45825994145
+储放 12.2912397395
+幢幡 10.9562386728
+幢幢 11.2616203224
+慎思之 13.2075304714
+授奖 11.0103058941
+紫茎 11.598092559
+花生 7.48721869481
+家种 12.2912397395
+甲基化 11.9547675029
+西山 7.91926344072
+五朔节 12.5143832909
+一烘 12.8020653633
+丝棉 11.0674643079
+花田 12.8020653633
+花甲 10.8096351986
+星点 12.2912397395
+一烤 11.7034530746
+皮衣 10.533381822
+万夫 12.2912397395
+胡桃肉 12.5143832909
+阵容庞大 13.2075304714
+家庭网络 13.900677652
+人定胜天 11.4157710022
+尼索斯 12.5143832909
+上班时间 9.94943393339
+词法 11.8212361103
+供销员 11.598092559
+有则改之 12.2912397395
+麦克洛 13.900677652
+环卫处 12.5143832909
+花用 12.5143832909
+畦灌 13.900677652
+肾小管 9.41204128224
+无气泡 13.900677652
+逞性 13.900677652
+和硕公主 12.5143832909
+汪林 9.46986085313
+爽气 11.5027823792
+沙蚕科 12.2912397395
+唐王闻 12.8020653633
+极天罔地 13.900677652
+子营 11.598092559
+紫苏 10.7226238216
+花瓜 13.2075304714
+建筑构造 11.9547675029
+合金粉 12.8020653633
+紫苑 12.2912397395
+普遍提高 10.7226238216
+可移植性 11.4157710022
+关口 7.34674424795
+李行首 12.5143832909
+万姓 11.598092559
+反潜舰 11.598092559
+数十遭 13.2075304714
+博穆博果 10.765183436
+王元章 9.18217878068
+再世 10.3743171274
+斯潘塞 12.5143832909
+数十道 12.1089181827
+张凤 13.2075304714
+花瓶 9.53122979951
+军阀割据 11.4157710022
+弄伤 11.7034530746
+开饭 9.77354326693
+西麓 9.49395840471
+文句 10.765183436
+蒙哥尔 12.2912397395
+龙之介 12.1089181827
+较窄 9.5186510173
+泥河 11.598092559
+灰鹤 11.0674643079
+入法 11.9547675029
+甬剧 13.900677652
+杨雪揉 13.2075304714
+振幅 8.43261751084
+性知识 11.2616203224
+数来宝 11.9547675029
+性生活 8.69119149913
+宣赞 8.83177344976
+跟部 12.5143832909
+办不完 13.2075304714
+豁然贯通 13.2075304714
+次印刷 13.900677652
+李仕尧 12.8020653633
+农业银行总行 13.900677652
+李润田 9.44633035572
+资格证书 10.9562386728
+年年月月 12.5143832909
+另一版 13.900677652
+紫芝 11.7034530746
+耶律余 12.5143832909
+弗瓦迪斯 13.900677652
+恍如隔世 12.5143832909
+一石二鸟 11.7034530746
+一照 8.97342396682
+跌价 9.93038573842
+枯瘦 10.7226238216
+艾略特 10.8561552143
+一煮 13.900677652
+麦罗埃 11.3357282945
+构图 8.71889410168
+无聊 8.58255765813
+紫花 11.0103058941
+朱家班 12.5143832909
+陆健 10.2630914922
+山伯 13.2075304714
+成气候 11.1280889297
+暴雷 11.5027823792
+矗起 13.900677652
+批发市场 8.79473217808
+电讯器材 12.8020653633
+过白 13.2075304714
+无线通讯 12.8020653633
+几万千瓦 12.8020653633
+报刊亭 13.2075304714
+灰黑 10.604840786
+钟辛 12.5143832909
+凝寒 13.900677652
+反应罐 13.900677652
+谢承 12.5143832909
+五十多岁 10.0294766411
+承包人 10.5684731418
+柯伊伯 13.900677652
+灰黄 11.2616203224
+凝寂 12.8020653633
+数十部 11.4157710022
+博平岭 11.0674643079
+束装 12.1089181827
+打过工 12.5143832909
+一熟 9.46986085313
+缢死 11.1280889297
+唐卡画 13.900677652
+跌份 13.900677652
+民主主义 8.98802276624
+天落水 13.900677652
+遭报应 11.598092559
+科尼奇 13.2075304714
+推荐 5.54600339006
+朝鲜劳动党中央 12.8020653633
+紫色 8.40761620864
+配件厂 11.5027823792
+易卜生 10.1164880181
+四肢百骸 12.2912397395
+西屋 10.2897597393
+奶制品 10.2630914922
+亚布力 12.8020653633
+嗅觉 8.62767809341
+暴雨 8.06586691491
+景之世 12.5143832909
+欧洲经济共同体 10.9049453784
+紧着 11.5027823792
+商云集 11.1926274509
+吹皱一池 13.2075304714
+历史纪录 9.04086524761
+梅尔夫人 13.2075304714
+内勤 12.5143832909
+花球 12.5143832909
+抽水站 10.9049453784
+响声 8.15447446144
+飞短流长 13.2075304714
+互换性 11.5027823792
+乱得 10.2630914922
+额尔齐斯河 9.5062284973
+西鹤 11.9547675029
+六四手 12.8020653633
+史前史 12.5143832909
+吸出 11.1280889297
+措辞 8.70218062071
+痴情女 13.2075304714
+绞链 13.2075304714
+上有政策 12.2912397395
+财税字 12.5143832909
+铿铿锵锵 12.2912397395
+高人一头 13.2075304714
+梅勒章 12.1089181827
+巯基 11.9547675029
+对苯二甲 11.0674643079
+旗舰 8.95903522937
+工作实绩 12.5143832909
+抄起 9.34680076038
+萧衍 10.642581114
+供应线 13.900677652
+多事之秋 11.0103058941
+培训 7.28998160726
+梅童鱼 12.5143832909
+黄绢连 13.2075304714
+热压 11.598092559
+乔布斯 12.5143832909
+吉尔吉斯斯坦 9.87532596124
+金壁辉煌 13.2075304714
+三藩市 13.900677652
+镀锌板 11.9547675029
+老高 9.40086798165
+两磅 12.5143832909
+一个团 10.1871055853
+当权 9.5186510173
+一瘦 12.1089181827
+彩色纸 13.900677652
+售电量 11.7034530746
+章丘市 13.2075304714
+兼而有之 10.4041700905
+几枪 10.8096351986
+鼻旁窦 12.8020653633
+迂曲 11.9547675029
+合金管 12.8020653633
+干燥气候 10.9562386728
+稳健 6.8787012289
+安基卢 13.900677652
+哪样 10.0294766411
+醉吟 12.5143832909
+诺丁汉 12.8020653633
+双重身份 11.1280889297
+罗哈斯 11.9547675029
+一两万块 12.8020653633
+钟行 12.8020653633
+一两条 12.5143832909
+变配电 13.2075304714
+审美活动 12.1089181827
+倒闭 7.78921031247
+花王 12.1089181827
+发现自己 8.28390655431
+肄业生 13.2075304714
+洛里 12.8020653633
+陈翰笙 12.2912397395
+揍扁 12.8020653633
+审判活动 11.8212361103
+耐燃 12.1089181827
+枯焦 11.7034530746
+大三巴牌坊 13.2075304714
+捏造罪名 12.5143832909
+电器化 13.2075304714
+文县 10.3743171274
+工业部 10.0505300503
+钟表 9.14708746087
+萨米亚 13.900677652
+拉家常 11.2616203224
+入殓 10.4994802703
+另一番 10.4666904475
+有余 8.29120585679
+蔡三州 12.8020653633
+莫吉廖夫 12.8020653633
+决策表 12.8020653633
+罢免权 13.900677652
+入画 10.6818018271
+罩衫 11.7034530746
+热化 11.9547675029
+粪门 12.8020653633
+弓发矢 13.900677652
+种马场 13.2075304714
+整流子 12.8020653633
+罩衣 11.7034530746
+日祖界 13.2075304714
+枯燥 10.1394775363
+出出气 11.5027823792
+马里亚纳群岛 11.0674643079
+倒错 12.5143832909
+西餐 10.3743171274
+缺席判决 12.8020653633
+老祖先 13.900677652
+怡然自若 13.900677652
+王福山 11.3357282945
+除恶务尽 11.8212361103
+密不透风 10.4994802703
+热区 11.0674643079
+周氏昆 13.900677652
+巡逻员 13.900677652
+麦德龙 11.3357282945
+公董局 13.2075304714
+一盅 9.82314020807
+赋形剂 12.2912397395
+下大工夫 13.900677652
+小青龙汤 13.2075304714
+一盏 8.30969067146
+疑难 9.62401153296
+一盒 9.27570483869
+普鲁士王 13.2075304714
+热卖 10.4666904475
+一盖 11.8212361103
+贯通 8.79473217808
+民商事 11.4157710022
+金名臣 12.1089181827
+互易定理 13.2075304714
+忠于职守 11.0103058941
+特战超 12.8020653633
+炯炯 9.85762638414
+燕青入 12.5143832909
+百里酚 13.900677652
+热卡 11.9547675029
+帮带 12.2912397395
+二十分 11.7034530746
+一目 8.62767809341
+张冰 13.2075304714
+文大人 11.2616203224
+新解 12.8020653633
+花中之王 12.8020653633
+工商登记 11.7034530746
+还长 9.96885201925
+一直 4.55650593237
+马丁任 13.900677652
+士曹 12.5143832909
+行符玺 12.8020653633
+文化娱乐 10.5684731418
+有伤 10.0294766411
+高登岛 12.8020653633
+行刑队 12.2912397395
+奥兰岛 13.2075304714
+花狗 13.900677652
+皇统 10.642581114
+一看 6.18778669049
+浓妆淡抹 12.5143832909
+防错 13.900677652
+生死簿 11.1926274509
+赌棍 11.5027823792
+雅相 12.8020653633
+柳子戏 13.2075304714
+车马盈门 13.900677652
+防锈 10.9049453784
+倒钩 10.8096351986
+有仇 11.2616203224
+外汇管理局 10.8561552143
+有份 10.7226238216
+范长国 13.900677652
+一眨 10.1630080337
+英国议会 9.63799777493
+大武口区 13.2075304714
+旋涡星云 13.900677652
+命理 11.9547675029
+普丰德系 13.900677652
+四万户 12.1089181827
+热劲 12.8020653633
+王刘建 12.8020653633
+炮战 10.642581114
+八千九百万两 13.900677652
+临走前 10.2630914922
+一眼 5.74216140717
+蓟辽督 12.5143832909
+有些 4.66632782754
+沙沙声 11.4157710022
+求异 12.5143832909
+说者无意 13.2075304714
+品位 8.52539924429
+几枚 10.5684731418
+有事 7.33823355828
+桑木虱 13.900677652
+赵飞燕 11.9547675029
+专函 13.900677652
+哑然无声 13.2075304714
+读诗 11.3357282945
+数据分析系统 13.900677652
+黠戛斯 10.3171587135
+新行 10.8096351986
+出谋划策 10.0088573539
+西飞 9.04864738806
+有人 5.01870246773
+聊以自慰 12.2912397395
+海底捞针 12.8020653633
+花状 12.8020653633
+申花 12.1089181827
+刘劭著 13.2075304714
+勾爪 12.1089181827
+阿普列 12.2912397395
+新衣 10.533381822
+孰能无情 13.2075304714
+杜鹃花 9.56994431169
+炯然 11.9547675029
+公大史 13.2075304714
+一睹 10.3171587135
+骄奢淫佚 13.2075304714
+笑语 9.82314020807
+拜金女 12.5143832909
+寻芳 13.2075304714
+热切 9.62401153296
+响度 11.4157710022
+出游者 13.900677652
+锦葵 11.2616203224
+一瞄 11.8212361103
+招宝山 12.2912397395
+预备 7.87723005901
+手到擒来 11.9547675029
+老魏 10.4349417492
+食少便溏 12.1089181827
+士林 9.58318953844
+花片 13.2075304714
+十分重视 8.84443184663
+二十卷 10.9562386728
+一老一少 10.4666904475
+东方龙 12.8020653633
+沙滩椅 12.2912397395
+渠罗仇 12.8020653633
+东沙礁 12.2912397395
+一瞥 9.17328983326
+涅瓦 13.2075304714
+顾子方 11.5027823792
+一瞬 9.36807815882
+求快 12.5143832909
+紫葳 13.2075304714
+响应 7.50541605386
+殊死搏斗 12.1089181827
+速成班 13.900677652
+亚玛逊 13.2075304714
+深入分析 10.1164880181
+缓一缓 10.9562386728
+西顿 11.8212361103
+里姆 11.7034530746
+钟水饺 13.2075304714
+心身疾病 11.7034530746
+储户 10.4041700905
+紫萍 13.2075304714
+品行 9.74179456862
+古建筑 9.02548032877
+猎豹 9.7898037878
+求得 8.18036587537
+二十匹 11.1926274509
+新装 11.4157710022
+心灵性巧 13.900677652
+冬瓜子 13.900677652
+离别 9.12155415886
+阿尔巴尼亚语 11.598092559
+有主 11.0103058941
+有为 9.91169360541
+岁岁年年 12.2912397395
+胯部 12.1089181827
+磁量子数 12.1089181827
+一矮 13.900677652
+一短 11.8212361103
+一石 9.80633308975
+商南县 12.2912397395
+束身 12.1089181827
+一个圈 11.2616203224
+自此以后 10.642581114
+电偶层 13.900677652
+老鬼 11.7034530746
+颜沃 13.2075304714
+热内 11.0674643079
+一球 10.8561552143
+谢韦 13.900677652
+酒食 8.85082164473
+袁朗 12.1089181827
+退可守 10.604840786
+远嫁 11.0103058941
+木偶人 12.2912397395
+环卫工 11.9547675029
+孟加锡 13.2075304714
+工副业 12.8020653633
+道尔顿制 12.8020653633
+马国平 13.900677652
+词根 10.7226238216
+八月节 11.598092559
+列宁选集 13.900677652
+选贤举能 12.8020653633
+度牒 9.82314020807
+抄袭 10.4349417492
+矿业经济 13.900677652
+围击 13.900677652
+赣粤高速 11.0674643079
+张健 11.9547675029
+一个响 11.0674643079
+庐江县 11.9547675029
+摩尔维亚 13.900677652
+精于 8.90346537821
+授权点 13.900677652
+周公吐哺 12.8020653633
+拿手菜 11.9547675029
+储备基金 12.8020653633
+聚焦点 11.9547675029
+安坊李 12.8020653633
+质朴无华 12.5143832909
+王亲国 12.8020653633
+烈火轰雷 13.2075304714
+帽盔 12.1089181827
+杨雪暾 12.8020653633
+人口过密 13.900677652
+小院门 12.1089181827
+但崇祯 11.2616203224
+鞍勒 12.8020653633
+陶宗旺 11.0103058941
+抵押借款 12.8020653633
+卫成侯 13.2075304714
+诸王 8.15447446144
+弱水 10.642581114
+茵茵 11.598092559
+盖革 11.3357282945
+构句 13.900677652
+十八分 13.2075304714
+防除 11.0103058941
+居敬堂 13.2075304714
+毛毛可 13.900677652
+杨崇伊 11.598092559
+还口 12.1089181827
+防险 13.900677652
+甲午战 11.7034530746
+围兜 13.2075304714
+数十间 13.2075304714
+文化 5.08902540383
+迈凯轮 13.900677652
+归纳起来 10.604840786
+反躬自问 12.5143832909
+飞行服 12.5143832909
+手到病除 11.9547675029
+热门 8.51160592216
+仰仗着 13.900677652
+罗彩霞 12.5143832909
+暴风骤雨 10.0940151622
+引者 12.5143832909
+殡仪馆 10.4666904475
+劝捐 12.8020653633
+五六千年 11.0103058941
+上官贵 12.8020653633
+波利萨 13.900677652
+产羔率 13.2075304714
+新论 11.1926274509
+儿童团 12.5143832909
+宋楚 13.2075304714
+精专 12.8020653633
+新设 9.58318953844
+假人 11.8212361103
+戴玉衡 12.8020653633
+全流通 7.93197009199
+太安静 13.2075304714
+注意事项 9.27570483869
+精一 13.900677652
+苏利耶 12.8020653633
+谢非 13.2075304714
+底面 10.0940151622
+倒霉 8.24119543622
+新训 13.2075304714
+荆沙市 11.7034530746
+新诗 9.84023464143
+双人滑 12.5143832909
+电压钳 13.900677652
+乃见 13.2075304714
+教师证 13.900677652
+骨肉团聚 13.2075304714
+缥渺 12.8020653633
+调赴 12.8020653633
+马莫杜 13.2075304714
+惹麻烦 10.9562386728
+德卢斯 12.8020653633
+贝母 9.21854642485
+唇炎 12.8020653633
+燕青博 13.2075304714
+一半左右 10.1394775363
+一瓢 9.85762638414
+一瓣 11.9547675029
+防雷 11.3357282945
+新说 11.9547675029
+帐棚 12.2912397395
+疏理 12.5143832909
+防雹 12.1089181827
+西魏 8.87023973058
+精义 12.1089181827
+假令 13.900677652
+一瓶 8.39941944143
+酌量 11.3357282945
+废轮胎 13.900677652
+防雨 11.4157710022
+新语 11.8212361103
+瑜伽 9.30555780184
+防范措施 10.2630914922
+精神不振 11.598092559
+汇报会 10.2371160058
+花烛 11.9547675029
+仔肩 13.2075304714
+二十几 11.2616203224
+万余个 11.9547675029
+波江座 11.8212361103
+谢雷 13.900677652
+预定 7.93709830836
+口腔粘膜 11.1280889297
+左舜生 12.8020653633
+入棺 11.598092559
+玄奘闻 13.2075304714
+日渐壮大 12.2912397395
+工兵团 10.4666904475
+斯卡岛 12.8020653633
+防霉 11.4157710022
+戏剧节 12.1089181827
+谭兵 12.5143832909
+宇宙观 10.3743171274
+申能 9.63799777493
+一用 10.6818018271
+招风耳 11.9547675029
+预审 10.9049453784
+一甲 11.1926274509
+马叙伦 11.1926274509
+冲锋在前 11.598092559
+一男 12.2912397395
+假传 11.9547675029
+一画 10.7226238216
+缴械投降 11.1280889297
+狼烟四起 11.598092559
+申胥 13.2075304714
+上岩 13.900677652
+包兆龙 13.900677652
+金球奖 11.2616203224
+假体 11.5027823792
+薄一波 12.1089181827
+税务总局 10.765183436
+假作 10.9049453784
+填到 11.598092559
+擂鼓筛锣 12.8020653633
+高宗之 13.2075304714
+精修 13.2075304714
+多数据流 12.8020653633
+一个十三岁 13.2075304714
+社会底层 10.2897597393
+费马原理 11.5027823792
+文明戏 11.0674643079
+桑夏恩 13.2075304714
+居正官 12.8020653633
+膈关 13.900677652
+乌兰乌德 13.900677652
+文明户 13.2075304714
+摊场 11.598092559
+定音鼓 11.8212361103
+假使 9.7898037878
+喜爱 7.57990935773
+柳随风 13.900677652
+半世纪 9.96885201925
+睡醒 10.0088573539
+如花似锦 13.2075304714
+皇粮 11.3357282945
+葬礼 8.87679713113
+比色法 11.4157710022
+杨盼盼 13.900677652
+花炮 10.7226238216
+咳嗽药 12.5143832909
+开首 13.2075304714
+萧子良 12.1089181827
+李兆麟 13.900677652
+凸面镜 11.9547675029
+福泽喻 11.2616203224
+任怡亲王 13.2075304714
+刑法学 12.1089181827
+前一刻 10.533381822
+生死线 12.2912397395
+再创新高 8.94485059437
+德堪尼 13.900677652
+人民解放战争 10.9562386728
+计算中心 11.4157710022
+获悉 7.01824018098
+自拉自唱 12.8020653633
+京求 13.900677652
+毛泽东 7.17804785712
+尽端 13.2075304714
+疑问 7.49379766591
+福禄贝尔 12.1089181827
+花灵 10.3743171274
+反正 6.81477618761
+格律诗 11.1280889297
+求差 13.900677652
+话篓子 13.900677652
+二十元 10.3453295905
+措词 9.89334446674
+倒阁 11.9547675029
+热值 10.4349417492
+能育叶 12.8020653633
+西张 11.8212361103
+式电流 12.5143832909
+吴三桂 6.95370165984
+桥梁厂 12.1089181827
+等比数列 11.8212361103
+毛奇龄 11.8212361103
+办公费 12.2912397395
+一病 10.3743171274
+型别 11.0103058941
+俯视 9.54396882529
+士族 9.02548032877
+命相 11.8212361103
+雪地车 13.900677652
+社鼠 13.900677652
+万余件 10.5684731418
+西马 11.7034530746
+麦克格 12.2912397395
+吱吱叫 11.5027823792
+预存 11.0674643079
+三十九个 13.900677652
+猛犸象 10.7226238216
+万余份 11.598092559
+中华全国台湾同胞联谊会 12.5143832909
+诸父 13.2075304714
+俯角 11.8212361103
+间苯二酚 11.8212361103
+作曲法 13.2075304714
+管辖区 11.9547675029
+中枢系统 13.900677652
+不期 8.83808261895
+辨正 12.8020653633
+第三封 11.9547675029
+多中心键 13.2075304714
+人财两空 11.7034530746
+照相制版 12.8020653633
+瓜达尔基维尔河 12.8020653633
+老夫妻 11.0103058941
+韩鹏 11.7034530746
+精炼 9.45802639549
+三统 11.8212361103
+宏壮 13.2075304714
+求才 13.2075304714
+爱财如命 12.8020653633
+军资 9.93038573842
+郭辉 13.900677652
+杀人越货 10.6818018271
+测景 12.8020653633
+体制改革 8.1417758781
+对外经贸 11.3357282945
+十五两三 13.2075304714
+纯属偶然 12.2912397395
+三组 10.6818018271
+燕文贵 12.8020653633
+绝对空间 11.9547675029
+老山 10.4666904475
+响指 12.1089181827
+入城 8.43684584695
+呼噜噜 11.8212361103
+无福 11.9547675029
+花信 11.4157710022
+毕石湖 10.8096351986
+滴鼻剂 12.2912397395
+计划书 13.900677652
+磨嘴皮 13.900677652
+尽职 9.6811699468
+郭达 12.8020653633
+出门在外 10.4994802703
+五色旗 11.1280889297
+摊档 13.2075304714
+征兆 8.83808261895
+护身 10.1630080337
+清芬 12.1089181827
+凝思 11.0674643079
+五十三卷 13.2075304714
+伊格纳季耶夫 13.2075304714
+叠加定理 13.900677652
+品牌 6.03548969779
+阳羡春 13.2075304714
+政企分开 10.4666904475
+纱厂 9.74179456862
+退而 11.8212361103
+江山股份 11.8212361103
+姚玉洁 12.8020653633
+和围岩 12.1089181827
+求战 10.7226238216
+美好记忆 12.5143832909
+北大方正集团 13.2075304714
+无私 9.49395840471
+相随 9.0884932966
+三线 8.18364995057
+三纲 11.5027823792
+耐盐碱 11.1280889297
+每见 11.0674643079
+无种 12.8020653633
+开元寺 10.4349417492
+资本金 7.6781013839
+茹费理 12.1089181827
+盯死 11.4157710022
+还得起 13.900677652
+品特 12.1089181827
+任镇军 13.2075304714
+防劫 13.900677652
+邓军站 12.8020653633
+锥子 10.0720362555
+相隔 8.71329184614
+刮起 9.25628675283
+就近 8.61241062128
+伸过去 10.9562386728
+新春佳节 11.3357282945
+红透 11.7034530746
+尽能 13.2075304714
+上峰 10.9049453784
+叶楚伧 13.2075304714
+叶楚伦 13.2075304714
+相除 12.5143832909
+伍修权 13.2075304714
+波伊尔 13.900677652
+有缘千里 12.2912397395
+通信站 12.5143832909
+谭咏麟 12.5143832909
+士为知己者死 11.598092559
+无礼 8.44963919841
+凝想 13.2075304714
+华北联合大学 11.1926274509
+纱卡 13.900677652
+入坞 12.8020653633
+蒸炒 13.2075304714
+取长补短 10.642581114
+恶意软件 12.2912397395
+刘可心 11.9547675029
+见证 8.57280148319
+利诺 13.2075304714
+受刑人 11.2616203224
+蒸热 12.8020653633
+违规操作 10.7226238216
+单影 13.2075304714
+圣克鲁斯省 13.900677652
+花会 11.598092559
+精灵 9.08039608637
+排座次 12.2912397395
+一千八声 13.2075304714
+云煌岩 13.900677652
+逞威 11.598092559
+任何时刻 11.9547675029
+产品数量 10.2630914922
+由衷之言 13.2075304714
+顺耳 11.5027823792
+声学环境 13.2075304714
+罗林 12.5143832909
+银帛 12.8020653633
+第十四天 13.900677652
+弄瓦 13.900677652
+热潮 8.15767446417
+一下十三 13.2075304714
+弱势 7.48068272383
+拉伸粘度 13.900677652
+入土 9.48183704418
+郭载 12.8020653633
+见诸 10.2371160058
+湖南镇 11.9547675029
+无神 10.3453295905
+西米尔 12.8020653633
+马卡鲁峰 11.9547675029
+铜元 10.6818018271
+吴三国 12.5143832909
+动量表象 13.900677652
+弱卒 13.2075304714
+异禀 12.5143832909
+校本部 12.5143832909
+报时钟 13.900677652
+封其子 11.8212361103
+见鞍思马 13.900677652
+入团 12.2912397395
+琼中黎族苗族自治县 13.900677652
+热源 9.30555780184
+扬镐 12.5143832909
+预料 8.1417758781
+临朐县 12.8020653633
+入围 8.44963919841
+从冰斗 13.2075304714
+爱恨交加 11.9547675029
+共生生物 13.2075304714
+听觉区 13.900677652
+老尚 10.642581114
+万壑 11.5027823792
+精熟 9.91169360541
+周振甫 13.2075304714
+无碍 9.85762638414
+能克承 13.900677652
+响成 10.9049453784
+扬长 11.5027823792
+山导河 13.2075304714
+护运 12.2912397395
+搅和 9.96885201925
+学科建设 11.598092559
+多边形 10.3743171274
+展读 13.900677652
+弱化 8.91707103027
+异种 10.2897597393
+副队长 10.1630080337
+适足 11.7034530746
+国防委员 13.900677652
+斯卡拉 12.5143832909
+雍州牧 12.8020653633
+坡耕地 11.5027823792
+冰虫 11.2616203224
+士子 9.19114745066
+无磷 13.2075304714
+扬锐 13.2075304714
+钱昌照 12.5143832909
+道学先生 12.5143832909
+花事 12.8020653633
+迪亚纳 13.900677652
+用饭 11.0674643079
+耶律留 13.2075304714
+春华秋实 11.598092559
+个体性 12.2912397395
+鸱吻 11.3357282945
+无所不在 10.3453295905
+操作过程 10.9562386728
+紧急任务 11.1280889297
+玉帝传 12.1089181827
+微创 10.6818018271
+便于工作 12.8020653633
+停置 13.2075304714
+和海权 13.900677652
+颜宗翰 11.4157710022
+花亭 12.2912397395
+词坛 10.9049453784
+梳棉机 12.5143832909
+尽致 12.5143832909
+通国 13.900677652
+品玉 13.900677652
+自发势力 13.900677652
+士安 12.8020653633
+镇流器 13.900677652
+人工神经网络 11.7034530746
+地区差价 13.900677652
+胆魄 11.5027823792
+丝厂 10.6818018271
+虾池 13.900677652
+系列丛书 12.8020653633
+历史书籍 12.8020653633
+序列号 12.5143832909
+有片 10.8096351986
+尽自 10.9049453784
+压力梯度 12.2912397395
+开展调查 11.2616203224
+万法唯 12.8020653633
+不遑宁处 12.8020653633
+爱子心切 13.2075304714
+求援 9.04086524761
+环卫所 12.5143832909
+揍得 12.8020653633
+深黄色 11.8212361103
+陆家嘴金融贸易区 11.4157710022
+预收 10.4349417492
+无遮大会 13.2075304714
+母夜叉 10.765183436
+国民政府 7.66235302694
+汤克宽 13.2075304714
+矛盾律 11.9547675029
+天旋地转 10.1871055853
+核准 7.79588441956
+花丛 10.0088573539
+德莱娜 12.8020653633
+布什尔 12.1089181827
+花东 12.2912397395
+那武 13.900677652
+老尹 12.2912397395
+伏下来 13.2075304714
+管制经济 13.2075304714
+花上 10.3171587135
+精煤 12.5143832909
+靠里面 13.2075304714
+普鲁士人 11.9547675029
+三缸 12.8020653633
+每行 10.2630914922
+第一百八 11.2616203224
+争论点 13.2075304714
+天才少年 13.900677652
+花丽 13.2075304714
+役所 12.5143832909
+暴露出 9.41204128224
+鄙言 13.900677652
+顺脚 11.2616203224
+火树琪花 13.900677652
+花个 11.9547675029
+花中 11.0674643079
+负电 9.80633308975
+袁晁 11.5027823792
+建都 8.37522471284
+贸易谈判 10.8561552143
+法斯宾 12.5143832909
+大豆蛋白 12.5143832909
+太平天国运动 11.9547675029
+长筒袜 13.2075304714
+张大脸 12.2912397395
+锥头 13.900677652
+克拉玛依市 11.598092559
+李显忠 12.2912397395
+多罗夫 12.8020653633
+具备条件 10.3171587135
+诗歌史 11.598092559
+线性插值 12.8020653633
+携手同心 13.900677652
+一九三 11.7034530746
+抛光机 13.900677652
+米亚特 13.2075304714
+露两手 13.2075304714
+飞行家 12.5143832909
+迈森 13.900677652
+卖不出去 9.48183704418
+宣传车 12.1089181827
+王氏家族 13.2075304714
+亚运会 9.19114745066
+诸侯 7.66822963543
+郭跃 12.1089181827
+过堂风 12.5143832909
+三粒 11.9547675029
+假牙 11.4157710022
+费根 12.2912397395
+方钠石 12.8020653633
+有熊 12.8020653633
+新东 12.8020653633
+假日经济 12.1089181827
+出圈 13.2075304714
+水井街 13.2075304714
+奥杜贝尔 13.900677652
+韭菜花 12.2912397395
+三精 10.9562386728
+浜松 13.2075304714
+昨儿个 10.765183436
+异端 9.20932976975
+无气味 13.900677652
+大顺礼 11.9547675029
+面如死灰 11.1280889297
+贝坦 12.5143832909
+实践论 11.1926274509
+民意测验 10.4041700905
+爱利亚 11.7034530746
+度上 11.598092559
+清色 13.900677652
+更胜一筹 10.1630080337
+求情 8.89673134603
+钨酸 12.2912397395
+一抔黄土 12.8020653633
+马丁炉 12.5143832909
+潘红胺 13.900677652
+骑缝 12.8020653633
+象传 12.2912397395
+一个桶 12.2912397395
+春节前夕 11.9547675029
+灯伞 13.900677652
+家居用品 11.9547675029
+张利胜 11.8212361103
+骨干教师 12.8020653633
+疗养院 10.0720362555
+老三篇 11.4157710022
+郭贤 13.2075304714
+三类 8.37921673411
+吹干 11.2616203224
+东源 9.53122979951
+诸位 8.43684584695
+楚汉便 13.2075304714
+三米 10.6818018271
+银座 10.9562386728
+莱芜市 11.9547675029
+相混 10.9562386728
+诸佛 10.7226238216
+通邛 13.2075304714
+西艺来 13.900677652
+头孢氨苄 12.8020653633
+诸体 11.7034530746
+诸王子 11.7034530746
+远安 11.0674643079
+内助 12.8020653633
+弄皱 12.2912397395
+纬密 12.1089181827
+调谐器 13.900677652
+热流 9.66657114738
+一个样 10.0505300503
+刮过 10.8561552143
+王哈丹 12.8020653633
+忠实听众 13.900677652
+第一次鸦片战争 10.8096351986
+老巢 10.4666904475
+鉴定者 12.2912397395
+玄武门 9.55687223012
+云笈 11.598092559
+啸傲 13.2075304714
+石镇鬼 13.2075304714
+贝城 13.2075304714
+多米尼加岛 12.2912397395
+修理费 12.2912397395
+伯言兄 11.9547675029
+见解 7.68207753228
+打杀 10.4994802703
+望眼欲穿 10.533381822
+欧罗巴 11.0103058941
+御驾亲征 10.0720362555
+甲午年 12.1089181827
+木偶片 11.9547675029
+统一规划 10.2371160058
+两性生殖 11.3357282945
+热海 11.598092559
+无策 11.4157710022
+扶住嘉 13.2075304714
+新主 10.7226238216
+麦克唐 13.900677652
+折戟沉沙 11.9547675029
+鲁飞尼 13.900677652
+连种 13.2075304714
+护路 11.5027823792
+预算外 11.4157710022
+钉是钉 13.900677652
+涉水而行 12.8020653633
+偷营 12.1089181827
+中华街 13.900677652
+相闻 11.9547675029
+回头是岸 11.598092559
+醉歌 12.5143832909
+弱光 11.5027823792
+士多 11.598092559
+察雅 13.2075304714
+活络 10.1871055853
+贝嘉 12.8020653633
+小珠儿 13.900677652
+严加惩处 11.4157710022
+士夫 12.1089181827
+诸仁 13.900677652
+云消雨散 13.900677652
+新型农村 10.1871055853
+克雷伯 11.8212361103
+就象 7.83225206373
+归并到 12.5143832909
+孝静帝 11.7034530746
+热河 9.29550746599
+雷哈尼 13.2075304714
+诸仓 12.5143832909
+妇代会 12.8020653633
+热油 10.9562386728
+年生 9.7898037878
+塑料桶 12.2912397395
+士奇 11.3357282945
+探索 6.91411119257
+四君子汤 12.8020653633
+热泉 10.2371160058
+无端 9.31571017331
+犹然 11.8212361103
+民族和解 11.4157710022
+乘虚 9.62401153296
+就调 12.8020653633
+蒙学字 13.900677652
+平安大街 12.5143832909
+不顾前后 13.2075304714
+陶法阿 13.2075304714
+察隅 10.604840786
+丝光 11.4157710022
+有点 5.5984118571
+诸事 8.79473217808
+国务院学位委员会学科评议组 11.8212361103
+丝兰 13.2075304714
+见表 8.74738605748
+对称点 13.900677652
+海誓 13.2075304714
+热泪 8.17382990439
+热泵 11.7034530746
+个体户 9.91169360541
+陈仲安 10.8096351986
+展览 8.44109213783
+趣味盎然 13.900677652
+展视 12.8020653633
+源程序 11.1280889297
+言少述 12.5143832909
+看图识字 12.8020653633
+申朝廷 13.2075304714
+广延性 12.5143832909
+龙华烈士陵园 12.1089181827
+开封市 9.16447920358
+乡镇长 13.900677652
+预期 4.70230865178
+函数调用 12.2912397395
+便携式 9.6811699468
+高粱饴 13.2075304714
+光视效率 13.900677652
+火急火燎 11.7034530746
+金月兰 10.3743171274
+铺平道路 10.6818018271
+淡色 10.6818018271
+成都市政府 13.2075304714
+独家经营 12.1089181827
+有灵 9.21854642485
+盯梢 11.2616203224
+热水 8.25877058104
+银库 11.2616203224
+吴三呈 11.9547675029
+首场 9.94943393339
+柞水县 13.900677652
+空廓 12.5143832909
+储层 12.1089181827
+魏颖 13.900677652
+梁若英 13.900677652
+学习测量 12.8020653633
+察院 11.1280889297
+白条鸡 12.5143832909
+设圈套 13.900677652
+单延 12.8020653633
+嫁个老公 13.900677652
+吸下 13.2075304714
+睦邻友好 10.4349417492
+张溥死 13.2075304714
+糊成 12.5143832909
+出城 7.57811241205
+徐援朝 9.46986085313
+无穷 8.38724890581
+奥布宁斯 13.2075304714
+枯井 10.4041700905
+帝祚 13.900677652
+魏风 11.8212361103
+玫瑰紫 12.8020653633
+郭象 10.6818018271
+村务 12.1089181827
+灰布 11.2616203224
+田普 12.2912397395
+扬鞭 9.84023464143
+掳获 11.4157710022
+张洪河 13.900677652
+李安宅 12.5143832909
+哪里 5.71979670998
+弱冠 10.765183436
+白糊糊 13.900677652
+限制性 9.77354326693
+热汽 12.8020653633
+包心菜 12.8020653633
+贺承珍 13.2075304714
+三站 13.900677652
+片面性 10.8096351986
+一一 7.2439511278
+一丁 11.5027823792
+玄奘死 13.2075304714
+一万 8.31718134319
+澳门特别行政区基本法 11.8212361103
+芯片 9.00283785202
+一下 4.88927614262
+一丈 8.60236028543
+石油部 11.4157710022
+通行无阻 11.4157710022
+入口 8.1417758781
+鞠一躬 11.8212361103
+醉汉 10.4666904475
+探究 9.11318590919
+张卡 12.5143832909
+一世 7.49050277001
+年版 9.5062284973
+槽钢 12.8020653633
+一业 12.2912397395
+宅子 8.64318227995
+探空 11.5027823792
+一丝 7.1072115194
+存放处 13.2075304714
+一两 8.61241062128
+诸军尽 12.8020653633
+一个 2.81755097213
+几曾 11.4157710022
+双龙洞 12.8020653633
+排队 8.06879517469
+八九月份 11.3357282945
+旧石器时代 8.59240995457
+一中 9.43476953332
+一串 8.15767446417
+英双语 13.2075304714
+几首 10.2117981979
+柳麻子 11.0674643079
+三端 11.8212361103
+激奋 11.4157710022
+三章 11.1926274509
+一丸 10.8561552143
+一举 7.30353195009
+阿普歇 13.2075304714
+中国共产党中央委员会 10.9049453784
+糊料 12.2912397395
+一久 10.8561552143
+业内 6.90125518447
+一义 12.5143832909
+同轴线 13.2075304714
+新买 10.8096351986
+锥形 9.4233408375
+排除 6.58412947479
+储宫 13.2075304714
+一乐 11.0103058941
+紫菊花 12.2912397395
+响板 12.2912397395
+排险 11.9547675029
+挥发性 9.84023464143
+一九 11.8212361103
+疏于 9.98865464655
+一乡 11.598092559
+听臣 12.2912397395
+建筑商 11.7034530746
+全透明 13.2075304714
+围殴 11.8212361103
+求是 10.9562386728
+郭诩 13.2075304714
+绝对观念 11.7034530746
+华南理工大学 12.1089181827
+装运港 12.5143832909
+洪都拉斯人 12.5143832909
+文科类 13.900677652
+柑橘 7.9817837977
+入厕 13.900677652
+台视 13.900677652
+见轻 12.8020653633
+中央民族学院 11.2616203224
+预想 9.33632946051
+魏齐 13.900677652
+涉水而过 12.8020653633
+轴距 8.78868986362
+文明委 12.2912397395
+预付款 10.0294766411
+一事 7.30489713801
+家祠 13.900677652
+万人敌 10.4349417492
+一二 8.52078029844
+帐务 13.2075304714
+豫北 9.61021821083
+就评 13.900677652
+贝利斯 12.1089181827
+有着 6.13893266732
+北静王妃 12.8020653633
+就诊 8.78268383956
+正正 11.1926274509
+落实到人 12.1089181827
+泥里 10.4349417492
+储存 8.0746775446
+一产 12.5143832909
+一交 10.1630080337
+防水层 11.9547675029
+汉堡包 11.9547675029
+就读 8.93783302172
+一亩 9.25628675283
+一亮 8.81927328699
+人贩 13.900677652
+受精率 11.9547675029
+费森登 12.5143832909
+一人 6.40347042877
+汉堡大学 11.598092559
+玉亭哩 13.2075304714
+泥金 10.8096351986
+阆中 10.5684731418
+毛毛雨 11.2616203224
+有瓦霞 13.2075304714
+活脱 11.0674643079
+排雷 11.598092559
+薄情无义 13.900677652
+见过 7.15661846566
+一介 10.0505300503
+许曾重 12.8020653633
+停站 12.8020653633
+促进作用 8.83177344976
+闯下大祸 12.8020653633
+豫南 10.0294766411
+一仗 8.49350588052
+绵绵地 13.900677652
+西安事变 9.27570483869
+一付 10.4666904475
+魏塘镇 13.900677652
+古罗马 8.48903160012
+一代 7.24781462262
+踏出来 12.2912397395
+泥醉 13.2075304714
+有眼 10.3453295905
+和庆堂 12.5143832909
+闪烁其词 11.598092559
+锥心 11.1280889297
+品目 13.2075304714
+建设工程 9.41204128224
+通信线 13.2075304714
+乱扣帽子 12.8020653633
+一件 5.82167939329
+知之甚少 11.1280889297
+就让 6.99592688201
+一任 9.32596667347
+严肃认真 11.1926274509
+听腻 11.5027823792
+寡妇村 13.900677652
+一份 6.24765723817
+停笔 11.9547675029
+谷里 11.598092559
+豌豆象 12.2912397395
+松桃苗族自治县 12.8020653633
+催眠曲 12.2912397395
+腐竹 10.8561552143
+后汉书 9.61021821083
+绿地系统 12.8020653633
+富强粉 13.2075304714
+辕马 12.8020653633
+一休 12.2912397395
+鸭子 9.55687223012
+子李纯 13.2075304714
+一会 7.02647915652
+倒到 11.8212361103
+法兰克福机场 13.900677652
+三篇 10.2630914922
+楚伐陆 13.2075304714
+杨崇瑞 12.8020653633
+一传 11.1926274509
+三分天下有其二 12.1089181827
+新井 12.5143832909
+假画 12.8020653633
+陆小艺 9.77354326693
+尺寸之地 13.900677652
+几颗 9.05649056552
+松浦郡 13.2075304714
+一伸 10.0088573539
+动过手脚 12.5143832909
+二十五团 13.2075304714
+阳物 11.9547675029
+多角化 13.2075304714
+况钟 11.7034530746
+封其弟 11.598092559
+鱼体色 12.5143832909
+旧城 8.80081122415
+无所不包 10.5684731418
+很多很多年 13.2075304714
+研究 4.32375160995
+还分 11.1280889297
+一住 10.2897597393
+一位 5.2381727294
+一体 7.37711534583
+随才器使 13.900677652
+谭廷襄 13.900677652
+麦克劳 11.5027823792
+史大郎 11.5027823792
+刮好 13.900677652
+朱光庭 13.2075304714
+摊派 9.74179456862
+欧阳予倩 10.6818018271
+爱好和平 11.4157710022
+帐单 11.9547675029
+三箱 12.8020653633
+法比奥 13.900677652
+都默 12.8020653633
+北人 10.1630080337
+单帮 13.900677652
+八首 11.9547675029
+索波特 13.2075304714
+石油醚 11.7034530746
+自幼儿 11.8212361103
+干散货 9.91169360541
+电热板 13.900677652
+彭总端 13.2075304714
+慨然允诺 12.8020653633
+热水塘 11.9547675029
+听者 10.4349417492
+时空观 11.5027823792
+侯门似海 13.900677652
+锥度 12.5143832909
+三等 8.89004235788
+预感 8.26588804881
+西地兰 13.2075304714
+礼聘 11.1926274509
+甲基汞 11.8212361103
+转让 6.52042186355
+熟荒地 12.8020653633
+构树 12.5143832909
+素色 10.6818018271
+收买人心 11.7034530746
+丽大街 13.900677652
+一侧 7.94484028251
+钟侃 13.2075304714
+活化因子 13.2075304714
+无所不可 13.900677652
+厉声厉色 12.5143832909
+腮腺 12.1089181827
+国际货币基金 11.5027823792
+士德 12.1089181827
+块茎 10.0088573539
+风鬟雾鬓 13.900677652
+持久美 13.900677652
+豪放派 11.5027823792
+珍珠岩 10.3743171274
+词句 9.66657114738
+麦克利 13.900677652
+好客之道 13.900677652
+没主意 10.8096351986
+数据量 12.5143832909
+说上几句 10.4041700905
+张奚若 13.2075304714
+二十次 11.8212361103
+切实落实 11.598092559
+展转 11.598092559
+二十款 13.2075304714
+几顶 12.5143832909
+几顷 13.2075304714
+乘胜 9.21854642485
+几页 10.2117981979
+年率 8.48903160012
+几项 9.58318953844
+一俟 9.94943393339
+橡胶制品 10.2371160058
+无籽 11.7034530746
+逞强 9.53122979951
+一信 11.1280889297
+豫剧 10.604840786
+刮皮 13.2075304714
+有瘾 13.900677652
+剧评人 13.900677652
+研究院所 12.8020653633
+新人 8.5488195185
+坦坦荡荡 12.1089181827
+操于卫 13.900677652
+肌动蛋白 12.2912397395
+提辖官 12.8020653633
+羞红 10.9562386728
+实验课 12.5143832909
+摩斯 10.9562386728
+飘摇不定 12.5143832909
+黄管藻 13.2075304714
+凝晖 13.2075304714
+呼叫者 13.2075304714
+基区 13.900677652
+烟头烫 12.8020653633
+宝莲寺 13.2075304714
+管件 11.5027823792
+进退中绳 13.900677652
+拍电报 12.1089181827
+陈波儿 12.2912397395
+三结合 10.9049453784
+总是 5.66425712471
+魂亡胆落 13.900677652
+每边 10.604840786
+果盒 11.4157710022
+四万多 12.1089181827
+有病 8.73019365694
+嫉妒者 13.2075304714
+公生右 12.8020653633
+赵救卫 12.8020653633
+张汉臣 11.7034530746
+足少阴肾经 11.9547675029
+利贞 13.2075304714
+每辆 10.3743171274
+预报 8.46695564842
+东洋 9.12155415886
+老祖母 10.9049453784
+同窗学友 13.900677652
+道德修养 10.4349417492
+芹菜 9.49395840471
+南缘 8.83177344976
+魏雪漫 13.900677652
+入冬 9.56994431169
+诸色伎 12.5143832909
+思想进步 11.8212361103
+新交 12.5143832909
+急腹症 11.1926274509
+史贵 13.2075304714
+大手大脚 10.8096351986
+德宗贞 12.2912397395
+相邦 10.765183436
+铸铁件 12.2912397395
+鲍德主 13.2075304714
+相邻 7.93967231235
+裴徽 13.2075304714
+大规模集 12.5143832909
+捅进 11.4157710022
+唱反调 10.9562386728
+全义忧 12.8020653633
+圣彼得堡 8.4980002701
+入册 13.2075304714
+洗煤厂 12.2912397395
+洗礼 8.89673134603
+费氏 11.0103058941
+绷着 11.3357282945
+每过 10.533381822
+子虎 12.5143832909
+相邀 10.4994802703
+油价格 11.8212361103
+几星 13.900677652
+那双久 13.900677652
+精益 11.7034530746
+贝卡 12.1089181827
+一枝独秀 9.12155415886
+投资者 4.43275365537
+直筒子 13.900677652
+群系 10.9049453784
+亚非会议 12.2912397395
+尿激酶 11.7034530746
+才尽其用 13.2075304714
+连锁店 9.55687223012
+小混蛋 13.900677652
+吉瑞之 13.2075304714
+惠栋之 13.2075304714
+居正才 13.900677652
+梁栋材 13.900677652
+沙布尔 13.900677652
+演绎数学 13.2075304714
+有界 11.1280889297
+村雨 13.900677652
+牛得草 12.2912397395
+铜活字 12.2912397395
+嫩白 11.7034530746
+漫山遍野 10.0505300503
+入关 8.56313957227
+李长吉 12.5143832909
+索十世 12.8020653633
+出于公心 13.2075304714
+封氏观 13.2075304714
+秋后算账 11.8212361103
+免受 9.27570483869
+小鬼子 11.1280889297
+另一侧 9.93038573842
+园林局 11.5027823792
+宣传语 12.2912397395
+中华路 13.2075304714
+假皮 13.900677652
+无缝 9.43476953332
+龟鳖 10.4041700905
+燕青歇 13.2075304714
+廉政公署 12.1089181827
+有生 9.84023464143
+相逢 9.03314320152
+每车 11.5027823792
+搅匀 11.5027823792
+扭转局面 12.1089181827
+就要 5.60139174508
+主事 8.65893063692
+二十根 13.900677652
+二郎庙 11.598092559
+浪平 12.1089181827
+烟油 13.2075304714
+活茬 13.900677652
+斩立决 12.2912397395
+贝叶 11.7034530746
+决不会 7.89432449237
+防水布 13.900677652
+相适 13.900677652
+诚敬 11.9547675029
+相送 9.15574552361
+富池口 11.7034530746
+预扣 11.598092559
+欠阻尼 13.900677652
+假相 11.3357282945
+国家图书馆 10.2897597393
+有用 7.29267702668
+士峰 13.900677652
+相速 11.8212361103
+无头案 12.1089181827
+罗竹风 12.8020653633
+劳山 11.9547675029
+天理不容 11.7034530746
+高速缓冲存储器 12.2912397395
+山麓平原 10.9562386728
+无约 12.5143832909
+无级 10.4041700905
+孤立语 13.900677652
+三科 11.598092559
+乘舆 10.6818018271
+鞑靼 9.26594866375
+命为 10.765183436
+不过关 10.9562386728
+三秋 11.0103058941
+香殿 11.7034530746
+三种 7.42524493527
+围棋 9.4233408375
+无声无臭 13.900677652
+命中 8.77077893705
+籍教习 12.8020653633
+词儿 9.10488710638
+年利率 9.63799777493
+无线 9.29550746599
+代办费 12.8020653633
+相量 11.4157710022
+黎巴嫩共和国 13.2075304714
+陋室 11.598092559
+排错 13.2075304714
+前段时间 9.19114745066
+花点 10.9049453784
+五十三名 13.900677652
+求数 12.5143832909
+倒剪 13.900677652
+茫无涯际 13.2075304714
+狻猊 10.533381822
+一个五岁 11.5027823792
+起早贪黑 10.9049453784
+科尼斯 12.5143832909
+块菌 12.2912397395
+钨钼 13.2075304714
+精矿 10.2117981979
+排长 8.53938548627
+双涡轮 11.9547675029
+凝望 9.41204128224
+由皇史 13.2075304714
+无绳 13.900677652
+命书 12.2912397395
+言绿营 13.2075304714
+业力 13.2075304714
+钨钢 12.8020653633
+贴画 11.598092559
+健美先生 13.2075304714
+罗里罗 13.2075304714
+雷观 10.4041700905
+词典 9.27570483869
+疾苦 9.01787572939
+除妖 12.8020653633
+方洪波 12.5143832909
+罂粟壳 12.1089181827
+搅动 10.1630080337
+安条克 11.1280889297
+无终 11.1926274509
+业务 5.11912219343
+鸭头 11.2616203224
+最大公约数 11.5027823792
+南翔 11.3357282945
+假睡 13.2075304714
+尼布甲尼 11.3357282945
+无绝 12.8020653633
+明惠帝 13.2075304714
+锯木 10.4994802703
+夏秋间 11.3357282945
+弄玉 13.900677652
+炎炎夏日 11.7034530746
+逐走 10.9049453784
+围桌 11.9547675029
+巫础 11.7034530746
+杭锦后旗 12.5143832909
+一朝天子 13.900677652
+美国哈佛大学 9.74179456862
+篇名 10.765183436
+东方航空公司 13.900677652
+永川市 13.2075304714
+纬度 8.19356738723
+交头接耳 9.93038573842
+大书特书 11.9547675029
+织金 10.6818018271
+贝劳 12.1089181827
+相配 10.0505300503
+冯兄弟 13.2075304714
+炫目 10.5684731418
+权力斗争 10.8096351986
+另一人 10.6818018271
+研碎 11.9547675029
+三票 12.1089181827
+混下去 11.2616203224
+晋武帝 9.91169360541
+官授鲁 13.900677652
+承天之 12.5143832909
+飞行帽 13.900677652
+热核 11.9547675029
+帐册 12.2912397395
+有所区别 10.2630914922
+阿拉伯地区 11.4157710022
+凝析 13.2075304714
+贝勒 8.75901409547
+坐冷板凳 11.1926274509
+耒阳市 12.2912397395
+素士 13.900677652
+命令 6.01723129784
+体系化 12.2912397395
+高宗益 13.2075304714
+馆之宝 12.1089181827
+研磨 9.62401153296
+美容外科 13.2075304714
+驼绒 10.604840786
+围栅 13.900677652
+有理 8.5440913773
+副食店 11.7034530746
+六四年 12.5143832909
+三礼 11.3357282945
+业别 13.900677652
+野牦牛 10.0940151622
+阎晓宏 12.8020653633
+掺杂 9.45802639549
+挥发掉 12.5143832909
+万寿 10.2630914922
+应不应该 11.2616203224
+谢刚 12.1089181827
+数十厘米 11.1280889297
+历十才 11.8212361103
+星朗 12.8020653633
+希彩 12.8020653633
+管下 11.1280889297
+三盘 11.2616203224
+万亿立方米 10.7226238216
+铝材 10.7226238216
+静止地 13.2075304714
+陈陶 11.8212361103
+春暖花开 10.9049453784
+三盒 11.9547675029
+转上来 12.8020653633
+向雪梅 13.2075304714
+海关税 11.0674643079
+念旧情 12.8020653633
+三盏 10.8561552143
+倒因为果 13.900677652
+传输服务 13.900677652
+四英里 13.2075304714
+活路 9.20019728618
+郦寄攻 13.2075304714
+有篇 12.8020653633
+潇洒 8.81927328699
+三相 9.87532596124
+土疙瘩 11.3357282945
+陆荣廷 11.0103058941
+铝板 11.4157710022
+中横 12.8020653633
+虫儿 10.533381822
+无话好说 13.900677652
+苏联地区 13.2075304714
+活跃 6.10791593116
+三目 12.1089181827
+业已 8.56313957227
+热狂 13.900677652
+入微 10.4994802703
+工会工作 12.2912397395
+神华集团 12.1089181827
+冈瓦纳 10.604840786
+精磨 12.2912397395
+单侧性 12.8020653633
+振荡整理 11.1280889297
+斯卡比 13.900677652
+子李班 13.2075304714
+几间 9.66657114738
+词干 11.7034530746
+醉态 11.1926274509
+望公子 12.8020653633
+初等数学 11.7034530746
+上弦 10.7226238216
+三皇 10.3171587135
+暖帽 11.5027823792
+南乔治亚岛 11.9547675029
+南翼 10.7226238216
+帐幔 11.1280889297
+帐幕 10.5684731418
+疾跑 12.1089181827
+儿童性 13.2075304714
+洛夫斯基 11.5027823792
+孙延龄 13.900677652
+鸭嘴 11.5027823792
+天天见 12.2912397395
+忿詈 13.900677652
+炫示 13.900677652
+削瘦 10.533381822
+冰球馆 13.900677652
+宅地 10.9049453784
+别墅式 12.8020653633
+惨不忍言 13.2075304714
+柞栎 13.2075304714
+诸王公 12.1089181827
+卡尔加里 11.9547675029
+五十三家 13.2075304714
+诸葛村 13.2075304714
+几锭 13.2075304714
+版面费 13.900677652
+私人访问 12.8020653633
+士力 13.2075304714
+排骨 10.4994802703
+周秀英 13.2075304714
+热望 10.642581114
+费拉 11.9547675029
+蒙特雷 12.2912397395
+巩访 13.2075304714
+云集响应 13.900677652
+国会议员 9.41204128224
+词序 10.8561552143
+精研 10.765183436
+入彀 12.2912397395
+一个打 11.3357282945
+笳鼓 13.900677652
+朱光卿 13.2075304714
+高飞远举 13.900677652
+探监 11.1280889297
+词库 13.2075304714
+宅基 12.1089181827
+建邦 13.2075304714
+勃然 11.7034530746
+热机 11.1280889297
+挥发油 10.3743171274
+窝囊废 10.9049453784
+无照 12.8020653633
+篇子 13.900677652
+疾走 11.1280889297
+竹木简 12.2912397395
+贝州 11.7034530746
+平帝元 11.1926274509
+有笔 13.900677652
+洛里亚 10.6818018271
+精装修 11.2616203224
+弄糟 11.7034530746
+纡尊降贵 13.900677652
+精确 7.35820569147
+削发披缁 13.900677652
+从觉华 13.2075304714
+鲁美 13.900677652
+跃居第一 13.2075304714
+张邦昌 10.6818018271
+工艺制品 11.8212361103
+岗哨 9.98865464655
+惟恐天下 11.598092559
+免却 12.2912397395
+万余种 11.0103058941
+美好未来 11.5027823792
+说谎者 12.5143832909
+多角度 10.3743171274
+削皮 12.2912397395
+起重量 12.5143832909
+丢份儿 13.900677652
+伏魔真 13.2075304714
+年级 9.74179456862
+热板 13.900677652
+亡佚 9.58318953844
+贝尔 8.38322475551
+苗向导 13.2075304714
+梅索沃 13.2075304714
+答记者问 10.7226238216
+掀掉 11.4157710022
+每股 6.40125436138
+大宗维 13.2075304714
+保罗一世 12.1089181827
+机械扫描 11.8212361103
+异熟 13.2075304714
+削着 13.2075304714
+庞保 13.900677652
+探着 10.604840786
+岁数 9.20019728618
+乡间 9.31571017331
+贝尼 12.1089181827
+几针 11.1280889297
+宣康有为 13.2075304714
+沙沙沙 12.2912397395
+品第 11.9547675029
+牛羊鱼 13.2075304714
+多角形 10.8561552143
+续航力 9.33632946051
+资本额 10.5684731418
+钩上来 13.900677652
+古亭 12.1089181827
+粉盒 12.2912397395
+词形 12.1089181827
+舍恩 11.598092559
+入座 10.1164880181
+嘉义市 11.1280889297
+咬文嚼字 10.765183436
+绿皮 11.9547675029
+士卒 8.70218062071
+每能 13.900677652
+过宁远 13.2075304714
+醉意 9.74179456862
+顾炎武 9.82314020807
+精装书 12.5143832909
+怨念 11.0103058941
+服丧期 13.900677652
+少数几条 13.2075304714
+处理速度 11.2616203224
+人性论 10.2371160058
+求欢 11.5027823792
+左右夹攻 13.2075304714
+停航 11.3357282945
+年缴 12.8020653633
+那恭谨 13.2075304714
+陆地棉 12.5143832909
+三盛公 11.7034530746
+承载能力 9.84023464143
+音乐疗法 13.2075304714
+二十枚 12.5143832909
+大名县 12.8020653633
+入店 12.5143832909
+麦克库 13.2075304714
+入库 9.89334446674
+融通 8.44109213783
+探知 9.25628675283
+合金丝 13.2075304714
+细菌学家 11.3357282945
+芬奇 9.87532596124
+天覆地载 12.5143832909
+蹠骨 11.9547675029
+搅局 11.598092559
+上影 11.1926274509
+活象 11.7034530746
+电子显微 11.9547675029
+调整计划 12.1089181827
+淳于 10.4994802703
+计价器 11.4157710022
+太巧 10.9562386728
+舌面 11.3357282945
+探矿 10.2630914922
+日用百货 11.2616203224
+通信班 13.900677652
+李伯纪 11.9547675029
+临床学 13.900677652
+泥鳅 9.91169360541
+品箫 12.8020653633
+金元外交 13.2075304714
+有穷 11.7034530746
+马太宁 12.5143832909
+滔滔汩汩 13.900677652
+忙里忙外 12.1089181827
+枕边书 13.900677652
+麦克劳德 12.2912397395
+突起物 12.8020653633
+数十场 12.8020653633
+入席 9.84023464143
+第十八代 13.2075304714
+预测 5.95193919716
+崇礼县 13.900677652
+中丹田 13.900677652
+实践者 11.3357282945
+改建工程 11.598092559
+群籍 13.2075304714
+豁牙 12.2912397395
+符号计算 13.2075304714
+假种 10.765183436
+服务大局 12.2912397395
+无灾 11.4157710022
+索恩河 12.5143832909
+三眼 10.7226238216
+精神 5.61971325142
+米老鼠 10.4994802703
+士可 12.5143832909
+小三角 12.5143832909
+马府尹 13.900677652
+黄忠寨 12.8020653633
+答言 9.96885201925
+三氟化硼 12.5143832909
+陈奇猷 13.2075304714
+福建师范大学 11.7034530746
+入帐 9.61021821083
+杨宪益 11.0103058941
+费恩 10.6818018271
+二象性 11.8212361103
+龙王堂 11.4157710022
+有种 8.33615724465
+外伤性 10.9049453784
+润滑液 13.2075304714
+储嗣 12.8020653633
+词尾 11.0674643079
+薛家岗 11.7034530746
+手忙脚乱 9.10488710638
+谷郡 11.4157710022
+倪嗣冲 11.8212361103
+暴力行动 11.8212361103
+于体节 13.900677652
+和海民 12.1089181827
+听辨 13.900677652
+三瓶 12.1089181827
+入川 9.28555713513
+国相邦 13.2075304714
+异状 10.4349417492
+活过 11.3357282945
+精细结构 10.1394775363
+快人快事 13.900677652
+连笑 12.8020653633
+构架 9.82314020807
+三瓣 11.598092559
+诸王取 13.2075304714
+半明半暗 11.7034530746
+切纸机 13.2075304714
+豌豆荚 13.2075304714
+听过 9.18217878068
+温岭市 13.900677652
+哪项 12.2912397395
+贝当 11.0674643079
+归宗岩 12.8020653633
+岗地 9.85762638414
+常侍郎 12.5143832909
+烽燧 10.4666904475
+地下工程 10.8561552143
+有福 9.74179456862
+十几头 11.8212361103
+赤红色 11.4157710022
+豫州 9.63799777493
+削球 12.2912397395
+代役金 13.2075304714
+疾进 11.8212361103
+感慨系之 11.8212361103
+晕晕沉沉 13.900677652
+售货亭 12.5143832909
+工程预算 13.2075304714
+乘车 8.96620371885
+惊师动众 13.900677652
+假面舞会 11.8212361103
+万维网 12.2912397395
+答语 13.900677652
+乘轿 10.1630080337
+热爆炸 11.4157710022
+肩舆 10.533381822
+求根 12.1089181827
+卑躬屈节 12.5143832909
+扬黄 13.2075304714
+胆道 10.4994802703
+称雄 9.77354326693
+有神 9.53122979951
+年糕 10.9049453784
+生产方式 7.65070240972
+辕门 8.96620371885
+和济慈 13.2075304714
+啸声 10.8561552143
+邓大海 9.84023464143
+各去 11.598092559
+相应措施 12.8020653633
+防水剂 12.2912397395
+醉拳 12.1089181827
+粤音 13.900677652
+免冠照 13.900677652
+异父 12.5143832909
+型材 10.4994802703
+凝结为 11.598092559
+豁然 10.4041700905
+飞行区 12.1089181827
+无猜 13.900677652
+几面 10.604840786
+省名 10.533381822
+泥足巨人 13.2075304714
+阿普斯 13.2075304714
+缄默 10.1630080337
+萨布 12.8020653633
+哥萨克 9.98865464655
+燕青来 12.8020653633
+鸦片贸易 9.94943393339
+围攻 7.66235302694
+迫切 8.35941410682
+吴邦雅 13.2075304714
+许戈辉 13.900677652
+皮斯 12.1089181827
+煤炭工业 9.34680076038
+经韦兰 13.900677652
+冬瓜汤 12.8020653633
+泥龟 13.2075304714
+新视角 13.900677652
+班组长 12.1089181827
+排风 11.9547675029
+伟大胜利 10.6818018271
+任莱顿 13.2075304714
+金帛粮 13.2075304714
+诉讼请求 10.0088573539
+清漪园 10.9049453784
+连锁化 11.9547675029
+榴辉岩 11.9547675029
+假笑 12.5143832909
+二十日 9.80633308975
+卷烟机 13.900677652
+四万名 12.8020653633
+第十八个 13.2075304714
+利耶 11.598092559
+萨加玛 13.2075304714
+丹迪 12.8020653633
+贝币 11.8212361103
+蒸笼 10.6818018271
+除号 13.900677652
+贝希 12.8020653633
+苏舜卿 13.2075304714
+网路上 13.900677652
+胆量 8.85082164473
+三军团 12.2912397395
+侧压力 12.8020653633
+停电 10.0505300503
+都邑 10.4994802703
+热播 10.3743171274
+老婆 6.71150991356
+温阳利 12.2912397395
+逞凶 11.3357282945
+精算 11.7034530746
+法国法郎 11.2616203224
+凝止 13.900677652
+精简 9.7898037878
+膨化食品 12.5143832909
+停用 10.1871055853
+锯锯 12.8020653633
+博陵 11.9547675029
+鬣蜥 11.7034530746
+二十斤 10.765183436
+田虎族 12.8020653633
+士光 13.900677652
+旁听者 13.2075304714
+父母心 13.900677652
+张石头 13.2075304714
+停留 7.27528528397
+顺访 13.900677652
+有碍 10.3743171274
+毕业会考 13.2075304714
+壳聚糖 13.2075304714
+叠片 13.2075304714
+波兰人 10.4666904475
+湛蓝湛蓝 13.2075304714
+首一张 13.900677652
+萧伦 13.2075304714
+勃郎宁 11.9547675029
+烽烟 11.3357282945
+二十文 12.5143832909
+妙趣横生 11.7034530746
+葛振林 13.2075304714
+党内斗争 11.8212361103
+闩上 11.598092559
+士兵 6.61517110345
+又经 13.900677652
+固镇 12.2912397395
+垫出去 13.900677652
+平服 11.2616203224
+张英杰 12.5143832909
+栏目 8.38724890581
+骂骂 11.598092559
+不偏不党 13.900677652
+游必有方 13.900677652
+裸出 10.8561552143
+双龙护 12.8020653633
+部从 11.8212361103
+形体美 12.1089181827
+无父 11.4157710022
+三界 10.1164880181
+每船 11.4157710022
+预算内 10.9049453784
+预演 10.604840786
+全长 7.11622058934
+探病 11.5027823792
+吊角楼 13.2075304714
+饯别 11.0103058941
+青春期 9.15574552361
+魏邈 13.2075304714
+胆酸 11.1926274509
+无影脚 13.900677652
+法轮功 12.8020653633
+之需 9.87532596124
+豌豆苗 12.1089181827
+三番 10.604840786
+不尴不尬 12.5143832909
+负增长 8.09554268306
+高粱酒 12.8020653633
+斯卡格 11.9547675029
+三略 11.7034530746
+几队 12.8020653633
+二十支 12.8020653633
+笺注 11.0103058941
+回目 11.9547675029
+三生 11.0674643079
+赶时间 11.3357282945
+品种 5.58780625763
+有研 10.9049453784
+魏郡 11.4157710022
+三十二块 13.900677652
+夫妻感情 11.1280889297
+签名者 13.900677652
+高宗立 12.2912397395
+迂儒 13.2075304714
+必要 6.01234315124
+尽让 12.8020653633
+印第安语 10.4994802703
+穿山而过 12.5143832909
+任镇威 13.2075304714
+储君 11.1280889297
+文科班 13.900677652
+很漂亮 9.75754292558
+对称轴 11.2616203224
+入射 9.63799777493
+三甲 9.91169360541
+前一晚 11.8212361103
+丰秀 13.900677652
+那蕾蕾 13.2075304714
+界首 10.9049453784
+无限性 11.7034530746
+百分之四五十 12.8020653633
+戴爱莲 12.8020653633
+小个儿 13.2075304714
+轮带 12.8020653633
+麦克尔 13.2075304714
+雷德通 13.2075304714
+魏郑 12.1089181827
+利胆 11.9547675029
+绷紧 9.45802639549
+精粹 11.0674643079
+阿肯色 12.5143832909
+测序 13.900677652
+赶回去 10.5684731418
+郑玄注 11.8212361103
+贝多 12.8020653633
+挥洒自如 11.1926274509
+报刊社 13.900677652
+不以为奇 11.9547675029
+丝布 12.5143832909
+无疵 12.8020653633
+补给船 10.604840786
+迂回 8.67493097826
+大观楼 10.6818018271
+挖出来 9.13850371718
+视如敝屣 13.900677652
+沈铁 13.2075304714
+无疆 11.4157710022
+由衷 9.09665660724
+入寇 10.0940151622
+回生 11.0103058941
+银行账 13.900677652
+刮脸 11.2616203224
+无疑 6.30831152346
+狼牙山 11.1280889297
+俄罗斯电视台 13.2075304714
+由表 11.4157710022
+争芳斗艳 13.900677652
+争议性 11.2616203224
+森纳尔 13.900677652
+正相反 10.1630080337
+怕不怕 11.7034530746
+凝气 13.900677652
+龟镜 13.900677652
+情景剧 12.2912397395
+不好谈 12.8020653633
+听见 5.92339566522
+成交价 9.17328983326
+入室 10.8096351986
+非法交易 11.598092559
+听觉 8.4980002701
+就范 9.82314020807
+总教官 12.1089181827
+西铁城 13.900677652
+曹仁知 13.2075304714
+屋后 9.6811699468
+停牌 6.7445010145
+糊涂 7.46613113319
+宫锦 13.900677652
+呱呱 9.94943393339
+符号语言 12.2912397395
+修治兵 12.8020653633
+无病 10.4349417492
+相骂 12.5143832909
+娘娘庙 10.8561552143
+大团结 11.2616203224
+亲历 10.2117981979
+几里 9.71102290995
+几重 10.8096351986
+妈祖庙 11.5027823792
+王遂 12.8020653633
+斯威 13.900677652
+入官 10.4041700905
+入定 11.1280889297
+涅盘 11.8212361103
+无痛 10.3743171274
+扮酷 12.8020653633
+鸣琴 13.2075304714
+无目的地 11.9547675029
+马彦祥 12.8020653633
+郭跃华 13.2075304714
+柳子厚 12.8020653633
+大客厅 12.1089181827
+相马 11.7034530746
+无用 8.64840422393
+围捕 11.598092559
+女房东 13.2075304714
+三版 13.900677652
+淆杂 13.900677652
+无由 11.4157710022
+费曼 13.900677652
+掺水 11.1926274509
+皇位 8.61241062128
+毫无疑义 11.8212361103
+三片 10.9049453784
+光存储 13.900677652
+品红 12.2912397395
+迢迢 10.9562386728
+品级 9.17328983326
+没气 10.9562386728
+几封信 11.5027823792
+三牲 10.9562386728
+油公司 12.5143832909
+变得 5.78247060257
+嗜眠症 13.900677652
+有罪 8.56795885871
+绾毂 12.5143832909
+金太阳 10.8096351986
+凝注 11.598092559
+军车 10.8096351986
+有缘 9.36807815882
+呱哒 12.2912397395
+护航 8.9519177616
+虎踞 10.9562386728
+预案 7.75864024639
+济钢 12.8020653633
+精米 12.2912397395
+无限期 9.91169360541
+海滩装 13.900677652
+过境税 12.8020653633
+喀拉拉 13.900677652
+贝姆 12.8020653633
+殷渐归 13.2075304714
+四氯化钛 11.9547675029
+四方八面 12.1089181827
+焚香顶礼 12.8020653633
+有缺 12.5143832909
+自有公论 12.5143832909
+睡到 9.75754292558
+稳稳 10.533381822
+梅妻鹤子 13.900677652
+业大 12.2912397395
+都静 11.8212361103
+无畏 9.96885201925
+无界 12.8020653633
+张温入 13.2075304714
+二具 13.900677652
+骨干成员 11.4157710022
+吴霍安 13.2075304714
+职工宿舍 13.900677652
+鼓角齐鸣 10.8561552143
+徐怀丹 12.5143832909
+围挡 11.3357282945
+宋朝廷 11.9547675029
+顺路 9.63799777493
+束手无术 13.900677652
+束发冠 12.8020653633
+合式公式 12.8020653633
+评论家 9.14708746087
+智神星 13.2075304714
+鹅行鸭步 13.900677652
+得荣县 13.900677652
+文科生 12.1089181827
+何无忌 12.1089181827
+库姆塔格 12.2912397395
+扩张型 11.0674643079
+眯眯眼 12.8020653633
+新干县 13.900677652
+加龙河 12.5143832909
+鬼头鬼脑 11.598092559
+两城镇 11.7034530746
+奥兰治 10.3453295905
+排鼓 12.8020653633
+安全部长 13.2075304714
+掳走 11.0103058941
+文化传媒 11.3357282945
+风光 7.39788760606
+丝弦 10.3453295905
+三班 11.8212361103
+善恶 9.46986085313
+魏阙 13.2075304714
+寸功 11.1280889297
+和威尔 10.9049453784
+礼节 8.81927328699
+护爱 13.900677652
+围拢 9.85762638414
+贝塔 10.8561552143
+听装 12.8020653633
+垄断组织 10.2371160058
+麦门冬汤 12.8020653633
+小客车 11.9547675029
+几部 9.65218240993
+贝塞 13.2075304714
+亚洲杯赛 13.900677652
+法雷尔 13.2075304714
+三王 10.2371160058
+万余米 12.1089181827
+整一个 12.1089181827
+尽责 9.31571017331
+来日无多 12.5143832909
+掺混 12.1089181827
+三玄 12.1089181827
+乘积 9.4233408375
+银峰 13.900677652
+帐子 10.0505300503
+库缎 13.900677652
+排齐 13.2075304714
+皇亲 8.83808261895
+有过之而无不及 10.2117981979
+成保良 13.900677652
+仔细分析 10.3743171274
+黄浦江畔 12.5143832909
+郭英 13.2075304714
+救生船 11.8212361103
+三环 9.6811699468
+吉尤姆 13.2075304714
+爱情喜剧 13.2075304714
+围护 10.8561552143
+于世祖 12.1089181827
+邢州南 13.2075304714
+构想 8.89673134603
+有约 10.1164880181
+纽扣儿 12.8020653633
+澄城 11.7034530746
+纱幕 12.5143832909
+三十九类 13.2075304714
+赶回到 11.7034530746
+高粱面 10.8096351986
+围打 13.2075304714
+离场 8.74162235276
+则甚 11.7034530746
+播出来 13.2075304714
+构思 8.55357012126
+布衣蔬食 13.900677652
+最能体现 11.1926274509
+郭舜 13.2075304714
+精索 11.4157710022
+热战 11.8212361103
+四万七千群 12.8020653633
+无理 9.62401153296
+张景星 13.2075304714
+二十捆 13.2075304714
+未税 13.2075304714
+鸭叫 13.900677652
+民工潮 13.900677652
+词宗 13.900677652
+阿普拉 12.1089181827
+副食品 9.74179456862
+恶贯满盈 10.765183436
+蛹期 11.1280889297
+变心 10.2630914922
+几通 13.900677652
+安全部门 11.8212361103
+纱帐 10.9562386728
+呱嗒 13.2075304714
+破裂声 12.8020653633
+纱帘 11.8212361103
+王辅臣 13.900677652
+围成 9.56994431169
+几遭 11.1280889297
+武清 10.8561552143
+纱布 9.35738286971
+九百多年 13.900677652
+我见犹怜 13.900677652
+飞行员 8.18694484647
+七台河 12.1089181827
+皇上 5.42368165031
+型态 11.8212361103
+浪奇 11.5027823792
+金圆券 10.8096351986
+贝壳 8.61241062128
+正确率 13.2075304714
+秋窗秋 13.2075304714
+纱帽 9.96885201925
+大巴山区 11.8212361103
+科丽蝇 13.2075304714
+几遍 9.12999302751
+几道 8.92394390956
+疾行 11.598092559
+一个月 6.55919379961
+胡里改 11.9547675029
+乱烘烘 12.5143832909
+冷风吹 11.2616203224
+费林 12.1089181827
+巴州 11.2616203224
+精纺 10.4666904475
+原书久 11.9547675029
+向楹柱 13.900677652
+求求 9.43476953332
+徐弘基 12.5143832909
+潘家铮 13.2075304714
+士吏 12.8020653633
+摊晒 12.2912397395
+书信来往 12.8020653633
+清新自然 11.4157710022
+英语班 13.2075304714
+直话直说 13.900677652
+护胸 12.2912397395
+精纯 12.5143832909
+淳化史 13.2075304714
+邓氏鱼 13.2075304714
+科学内涵 12.8020653633
+球速 13.900677652
+木梁柱 13.900677652
+小河区 13.900677652
+狗肉汤 13.2075304714
+根治术 12.5143832909
+扬马 13.900677652
+泄露天机 11.8212361103
+雷显明 12.1089181827
+纱巾 10.9049453784
+充足率 7.47095817394
+听讲 9.94943393339
+门窗 8.46259834305
+规律 6.04435808057
+大发横财 10.4349417492
+听讼 11.598092559
+亲友 8.7245279194
+鲁维 13.900677652
+四万元 12.2912397395
+生当做人杰 13.2075304714
+文明化 12.8020653633
+贝子 9.46986085313
+听证 9.56994431169
+安全部队 10.4041700905
+护肤 9.87532596124
+庄客入 12.8020653633
+听诊 11.2616203224
+须纳 12.1089181827
+玉凤花 13.2075304714
+活计 9.62401153296
+张景钺 13.2075304714
+渔翁之利 12.1089181827
+哑火 12.2912397395
+听话 8.87679713113
+弱小 9.37888907493
+外交代表 10.8096351986
+三点 8.47572763449
+关塔那摩 11.0103058941
+审查起诉 11.0103058941
+停灵 11.3357282945
+精绝 8.69119149913
+文明区 11.598092559
+乘警 12.8020653633
+腐熟 11.3357282945
+蚁力神 13.900677652
+主位 10.0940151622
+护肘 12.5143832909
+花叶病 12.1089181827
+听课 10.4994802703
+品类 9.40086798165
+利害冲突 11.2616203224
+异相 11.3357282945
+停火 10.2630914922
+精细 7.89926277401
+天下独步 13.900677652
+半数以下 12.2912397395
+半数以上 9.21854642485
+施陶芬贝格 12.8020653633
+战祝彪 13.2075304714
+舍掉 11.8212361103
+收集整理 10.9562386728
+凝滞 10.4041700905
+鬼哭神号 13.2075304714
+勒克莱尔 11.4157710022
+馆陶县 12.1089181827
+求法 10.642581114
+年利税 13.900677652
+双人床 11.1280889297
+贝宁 10.0505300503
+热感 11.4157710022
+狭长的 9.53122979951
+栗园 13.2075304714
+无眼 10.4041700905
+漫射光 13.900677652
+文明史 10.1164880181
+挡泥板 11.598092559
+油料勤务 13.2075304714
+天丁 11.3357282945
+遥感信息 12.8020653633
+入套 12.8020653633
+小野秀雄 13.2075304714
+张英才 7.49050277001
+楚平王 13.2075304714
+圣庙 12.2912397395
+阿尔及尔 10.2630914922
+魏明 13.2075304714
+入夥 9.84023464143
+基加 13.900677652
+埋伏牙 13.900677652
+绝对高度 12.8020653633
+终产物 12.8020653633
+东门路 13.2075304714
+行房事 12.1089181827
+奖赏 9.49395840471
+护耳 11.9547675029
+和春生 12.1089181827
+李月久 12.8020653633
+入夏 11.2616203224
+西墙 11.2616203224
+嘉业堂 11.0103058941
+滑环 13.900677652
+若即若离 11.0674643079
+黯淡 9.36807815882
+入夜 9.93038573842
+秦蜀郡 12.8020653633
+老寨 13.900677652
+有素 10.9562386728
+小河口 13.2075304714
+痨病 10.604840786
+三缕 13.2075304714
+借宿一夜 12.2912397395
+求治 10.9562386728
+三中全会 9.33632946051
+探照 12.8020653633
+利落 9.65218240993
+飘下 11.7034530746
+支解 12.2912397395
+蟒袍玉带 12.8020653633
+华北平原 8.75901409547
+贝娅 12.8020653633
+词头 11.8212361103
+万僧 12.5143832909
+子胜 13.900677652
+父母官 10.533381822
+数十万只 12.5143832909
+儿童村 11.9547675029
+入声 11.3357282945
+正投影 13.2075304714
+香火因缘 13.900677652
+护臂 13.900677652
+补充规定 11.3357282945
+狙击步枪 10.3171587135
+黑旗军 10.9562386728
+中东国家 11.1280889297
+均衡器 13.900677652
+堂吉诃德 11.1280889297
+月经不调 9.91169360541
+无所不备 13.2075304714
+汉族人 10.2630914922
+三熟 9.33632946051
+于骊 13.900677652
+马苏第 12.8020653633
+宰太牢 13.2075304714
+滑脉 12.1089181827
+交织成 11.0103058941
+儿童期 11.0674643079
+燕青拜 13.2075304714
+郭胜 10.2630914922
+常若松 13.900677652
+何涞凼 13.2075304714
+扩张器 13.2075304714
+总管家 13.2075304714
+南红 13.900677652
+年礼 12.5143832909
+飞行团 12.5143832909
+通信用 12.5143832909
+无益 9.11318590919
+煅烧 10.9049453784
+入境 9.08039608637
+说大话 10.8096351986
+张莹莹 13.900677652
+护膝 10.8096351986
+无盖 11.598092559
+相比 5.60288502559
+奥德塞 13.900677652
+昆嵛山 11.5027823792
+都铎 10.9049453784
+林肯中心 12.8020653633
+乃东 10.7226238216
+年租 13.2075304714
+郭老 12.8020653633
+打断 7.46452728361
+居诸卫 13.2075304714
+一个整 11.598092559
+不好过 9.66657114738
+无辐射 13.900677652
+各发 12.8020653633
+融雪 10.4349417492
+护腿 12.5143832909
+管住 9.98865464655
+王胆咬 13.900677652
+罗森塔尔 11.8212361103
+相饶 12.5143832909
+构成 5.39636708639
+费时 9.91169360541
+利蒙 13.900677652
+热性 10.9049453784
+戈多伊 12.5143832909
+犁铧 10.9049453784
+张石川 11.8212361103
+寻师求 13.2075304714
+戴宗接 13.2075304714
+鲁纳 12.8020653633
+精编 12.8020653633
+英语版 13.900677652
+道德观念 10.2117981979
+中华人民共和国宪法 10.0505300503
+直言不讳 9.77354326693
+笋瓜 11.8212361103
+地灵人杰 13.900677652
+防暴队 12.5143832909
+拉尔萨 12.8020653633
+秦皇岛 8.80692745117
+顶过来 13.2075304714
+结伴同行 12.1089181827
+文明办 11.3357282945
+撤下去 12.2912397395
+热恋 9.82314020807
+单声 13.2075304714
+昌居官 12.8020653633
+一个支 13.2075304714
+抛起来 13.2075304714
+交通枢纽 8.00627481771
+逼回来 13.900677652
+六边形 11.0103058941
+孟塞尔 12.1089181827
+电闸 13.900677652
+白土精制 13.900677652
+温饱线 13.900677652
+鉴定费 13.2075304714
+飞行器 8.71329184614
+章乃器 11.5027823792
+丝巾 11.9547675029
+巫山县 11.0674643079
+关山重重 13.900677652
+焦香 12.5143832909
+公共关系 10.8096351986
+练习者 12.8020653633
+三焦 10.1630080337
+上农 12.1089181827
+李万庆 12.2912397395
+皇叔 9.84023464143
+单士 12.5143832909
+楼高阁 13.2075304714
+一二百米 11.8212361103
+轻率地 10.9049453784
+命大 9.98865464655
+克雷尔 12.5143832909
+每瓶 11.0674643079
+这位 5.88172296882
+中华魂 13.2075304714
+活门 11.5027823792
+分一杯 13.900677652
+清迈 11.2616203224
+柱层析 13.900677652
+另一头 10.3453295905
+羞死 11.9547675029
+冬瓜皮 12.5143832909
+一九四八年 10.9562386728
+凡能 10.604840786
+三滴 13.900677652
+老人馆 13.900677652
+随随便便 9.6811699468
+年景 9.87532596124
+诸州 8.78268383956
+精悍 11.0103058941
+鼻子尖 11.4157710022
+电器网 13.2075304714
+每首 11.8212361103
+蒯祥 12.8020653633
+见鬼 9.93038573842
+况臣 12.5143832909
+落俗 13.900677652
+糕饼 11.5027823792
+生死关 12.5143832909
+笸篮 11.9547675029
+升天节 12.2912397395
+花得 10.9049453784
+几路 9.93038573842
+辩护律师 9.98865464655
+皇历 11.598092559
+花径 12.1089181827
+四万余 11.1926274509
+承泽亲王 12.5143832909
+锣鼓声 10.4994802703
+上册 11.2616203224
+次一等 12.1089181827
+柿椒 13.900677652
+流氓燕 13.900677652
+清远 10.2630914922
+垂顾 13.2075304714
+尽速 11.0674643079
+万般无奈 10.2630914922
+雅皮士 13.2075304714
+拍出去 12.2912397395
+三溪 12.2912397395
+求爱 10.642581114
+制假者 13.900677652
+强度量 13.900677652
+梁晴忙 12.5143832909
+听闻 9.72629038208
+三湘 11.3357282945
+提琴手 12.5143832909
+每笔 10.3743171274
+融解 12.2912397395
+洱源 11.8212361103
+诸夏国 13.2075304714
+哈布卜 13.900677652
+围网 11.3357282945
+印第安那 12.5143832909
+通话器 11.5027823792
+中波段 13.2075304714
+核战争 10.2630914922
+售货员 10.2117981979
+直柄 12.5143832909
+听错 9.63799777493
+花影 11.1280889297
+老支书 10.8096351986
+陈政委 8.11071748108
+金匮要略 10.8096351986
+曙暮光 12.8020653633
+三湾 11.598092559
+温故知新 12.8020653633
+热缩 11.9547675029
+顺遂 11.3357282945
+隆格尔 13.2075304714
+知错不改 12.8020653633
+命妇 10.2630914922
+异样 8.73589167805
+查塔姆 12.1089181827
+储位 11.598092559
+花彩 12.5143832909
+新绿洲 12.8020653633
+金蝉子 12.2912397395
+每餐 11.4157710022
+粗话 9.80633308975
+汝若早 13.2075304714
+虎穴龙潭 12.8020653633
+停滞 8.1902506346
+犹豫未决 11.598092559
+卢佩章 13.2075304714
+杨恩寿 12.8020653633
+花开 9.98865464655
+沉甸甸 9.56994431169
+热网 13.900677652
+滕斯坦 13.2075304714
+中国女子垒球队 13.900677652
+三清 10.1164880181
+子祠泉 12.5143832909
+花式 11.7034530746
+那灵官 13.2075304714
+瞧一瞧 10.4349417492
+假想 9.98865464655
+凝炼 10.9562386728
+顺逆 11.2616203224
+桑巴特 11.9547675029
+扯进去 11.3357282945
+探源 11.4157710022
+跳进去 12.1089181827
+莫西族 13.900677652
+北极带 13.900677652
+班门弄斧 12.1089181827
+普查人员 12.8020653633
+发出回声 11.9547675029
+死马 12.8020653633
+乘间 10.9562386728
+子李歆 12.8020653633
+于尊荣 13.900677652
+歌唱祖国 12.2912397395
+而复 10.1871055853
+围腰布 13.900677652
+四万万 11.598092559
+母田氏 13.2075304714
+围绕 6.73673096763
+西巴尔 13.900677652
+上网费 13.900677652
+陈东林 12.5143832909
+巴格莱 13.2075304714
+疏导 9.15574552361
+胆识 9.96885201925
+全反射 11.0103058941
+诸峰 11.1926274509
+消失下去 13.2075304714
+矛盾体 12.8020653633
+仔细认真 12.8020653633
+接地线 12.5143832909
+儿童票 13.900677652
+隆然 13.900677652
+不合身 11.1280889297
+索绕 13.900677652
+疏密 10.0088573539
+耄耋之年 12.2912397395
+惊叫声 11.2616203224
+围绳 13.900677652
+时代气息 11.0103058941
+诸葛绪 12.2912397395
+打冷战 13.2075304714
+掠取 10.642581114
+唇形 10.533381822
+每题 13.900677652
+每颗 11.3357282945
+课桌 9.87532596124
+热线 8.23771717184
+年来 7.31865251308
+唇彩 10.1630080337
+侃直 13.900677652
+年期 7.29267702668
+活钱 12.1089181827
+胞肓 13.900677652
+唇弓 13.900677652
+花店 12.1089181827
+拾金不昧 11.4157710022
+秘密组织 11.1926274509
+畴昔 12.5143832909
+五百五十二家 12.5143832909
+文艺事业 12.5143832909
+一子 10.0088573539
+一字 8.34384959028
+夏秋茧 12.8020653633
+镍都 12.8020653633
+掠去 11.0674643079
+一存 13.900677652
+宋室南 11.8212361103
+魅惑 10.9049453784
+河之滨 11.1280889297
+花序 8.80692745117
+一孝 13.2075304714
+一季 9.36807815882
+凝然 11.0674643079
+金口御言 13.900677652
+观光胜地 12.5143832909
+摩纳哥公国 13.2075304714
+文丰 12.8020653633
+伪装网 12.5143832909
+齐抓共管 11.5027823792
+机匠 13.900677652
+星海 10.3453295905
+杨两营 13.2075304714
+年末 7.14957618304
+道德化 13.900677652
+翠屏峰 12.2912397395
+五千多两 13.2075304714
+开科取士 11.1280889297
+梁寒冰 12.5143832909
+虾类 10.1394775363
+眠思梦想 13.900677652
+互通式 11.9547675029
+一守 12.8020653633
+虾米 11.2616203224
+葬埋 13.2075304714
+长乐未央 13.900677652
+失魂 13.2075304714
+熙攘 11.0674643079
+炫惑 13.900677652
+一宗 9.43476953332
+青旗红 13.2075304714
+洛里埃 12.2912397395
+一定 4.2025551294
+有所 5.39353479641
+无核 10.8561552143
+诸山 10.9562386728
+摩尔热容 13.900677652
+一宝 12.1089181827
+一客 12.1089181827
+若性空 13.2075304714
+弄断 11.3357282945
+一室 10.4994802703
+坪上 11.4157710022
+陈额 11.9547675029
+一个筐 12.2912397395
+一家 5.59346502535
+混过去 11.2616203224
+橡胶轮胎 11.1926274509
+尽量 6.93938160607
+四万人 11.1926274509
+凡以田 13.2075304714
+远遁 10.765183436
+花帐 13.2075304714
+许远 11.1926274509
+邓军正 12.8020653633
+烹煮 10.8096351986
+有成 10.604840786
+心系 10.9049453784
+鸡公 11.4157710022
+每顿 11.2616203224
+花布 10.0505300503
+花市 11.1280889297
+家境贫寒 10.1164880181
+轴颈 11.7034530746
+预留 9.32596667347
+每顷 13.2075304714
+流贼 7.60725837313
+每页 11.5027823792
+龟裂 10.3743171274
+寻师父 11.7034530746
+亓康 12.1089181827
+流畅地 11.598092559
+筛骨 13.2075304714
+有房 10.0294766411
+东指 12.5143832909
+一寨 11.598092559
+西南亚 10.604840786
+花帽 10.765183436
+法蒂玛 10.642581114
+坦然自若 11.598092559
+豆芽菜 11.3357282945
+花带 12.5143832909
+小五金 11.7034530746
+广播系统 13.2075304714
+一对 6.39463547346
+金瓶掣签 11.2616203224
+翠屏山 11.1280889297
+一堂 9.87532596124
+克雷布 13.900677652
+孔亚纲 11.8212361103
+一堆 7.6165434909
+九流百家 13.2075304714
+索纳 13.900677652
+三法 11.598092559
+谬之千里 13.2075304714
+计划局 11.1926274509
+于献帝 12.8020653633
+佛要金装 13.900677652
+数十回 13.2075304714
+普善广 12.8020653633
+奢费 12.8020653633
+展颜 13.900677652
+停水 11.1926274509
+几辆 9.91169360541
+品性 10.3453295905
+三泰 9.91169360541
+几辈 10.8561552143
+敛声屏息 12.8020653633
+不减当年 10.8096351986
+续诗品 13.900677652
+承包期 13.2075304714
+花巧 13.900677652
+一堵 9.35738286971
+进步性 11.0103058941
+黯然 9.33632946051
+三波 13.2075304714
+诸志 11.4157710022
+徐青君 9.43476953332
+仲派驹 12.8020653633
+功劳簿 13.2075304714
+那小兽 13.900677652
+皇军 10.0720362555
+假托 10.3453295905
+人弃我取 11.9547675029
+轴瓦 12.1089181827
+开放系统 10.642581114
+乌弗埃 11.9547675029
+阴云 9.36807815882
+假手 11.2616203224
+罗泽 12.8020653633
+怎么办 6.60630035269
+不实之词 12.2912397395
+一个碗 11.1926274509
+旷职 13.900677652
+无毒 9.29550746599
+避风 9.6811699468
+几近 9.26594866375
+听音 11.8212361103
+无比 7.52055511508
+皇冠 8.81927328699
+假扮 10.765183436
+还吵 12.5143832909
+母之仇 13.2075304714
+南京军区空军 12.5143832909
+第一百五十 13.2075304714
+小社儿 13.2075304714
+性道德 12.8020653633
+河之洲 13.900677652
+电压表 11.7034530746
+南海龙 12.1089181827
+白光恩 12.5143832909
+李总管 11.8212361103
+克雷库 13.900677652
+孟加拉语 10.9049453784
+高度赞扬 11.8212361103
+司法院 11.1926274509
+无欺 12.2912397395
+甲午一 13.900677652
+各号 13.900677652
+无款 11.7034530746
+续补成 13.2075304714
+命宫 12.2912397395
+二十米 10.9562386728
+普通党员 11.7034530746
+好汉做事好汉当 12.2912397395
+木偶戏 10.9562386728
+生产关系 8.60236028543
+农业局 11.1926274509
+荒谬性 12.2912397395
+一墩 11.8212361103
+熙春 12.2912397395
+命官 9.62401153296
+命定 11.1926274509
+金川有色金属公司 12.8020653633
+永吉 11.5027823792
+萧乾 12.5143832909
+健康检查 10.4349417492
+冯琢庵 11.8212361103
+望子敬 12.5143832909
+鸡兔 13.900677652
+见效慢 12.8020653633
+哪能 8.4980002701
+一壁 10.7226238216
+几车 11.9547675029
+微光电视 12.1089181827
+有感 10.765183436
+萧道成 11.1926274509
+执政官 9.69598503258
+艾伦伯格 13.900677652
+前门拒虎 13.900677652
+几轮 10.7226238216
+大悲大喜 11.7034530746
+诸强 12.1089181827
+吕季调 13.900677652
+有意 7.04316358943
+泥螺 11.4157710022
+疏堵 11.9547675029
+顾笑 13.900677652
+停泊 8.64318227995
+孔丘 11.598092559
+挥戈 11.4157710022
+格尔必 12.5143832909
+刘彦修 13.2075304714
+三水 9.89334446674
+四元组 12.8020653633
+一声 5.15269025031
+探获 13.2075304714
+一壶 9.16447920358
+诸弟 11.1926274509
+三氯 11.3357282945
+挤奶机 13.2075304714
+南亚次大陆 10.0088573539
+泽纳维 12.8020653633
+明朗朗 13.2075304714
+有愧 10.7226238216
+边安慰 13.900677652
+木拖鞋 13.900677652
+山区 6.65859529272
+一处 6.74762601704
+哄过来 13.900677652
+几身 11.9547675029
+狎昵 13.2075304714
+成群结伙 12.1089181827
+上官义 12.2912397395
+一阵风 9.01787572939
+执牛耳 12.2912397395
+孢子囊 9.84023464143
+立方英尺 12.5143832909
+一多 10.2630914922
+声光效应 13.2075304714
+有情 9.63799777493
+沙海中 11.8212361103
+一夜 6.94603878709
+第一阶段 8.4284069783
+情人眼里 13.900677652
+老眼昏花 11.5027823792
+一大 6.59213485444
+禁不住 8.14493543839
+蓄积量 8.6966709649
+布伦特兰 12.8020653633
+一夫 10.1164880181
+科夫卡 11.9547675029
+一天 5.38088783471
+年数 11.1926274509
+探测 7.66822963543
+幼儿学校 12.5143832909
+于庭州 12.8020653633
+目不知书 13.900677652
+美国财政部 8.96620371885
+白祁政 12.1089181827
+一头 6.90216800973
+费神 11.0674643079
+从头说起 12.1089181827
+向慧梅 10.8561552143
+展馆 10.3743171274
+便利商店 12.5143832909
+赵志皋 11.3357282945
+严千帆 13.2075304714
+工艺制作 11.7034530746
+不智 11.598092559
+铜期货 10.6818018271
+花岗 9.74179456862
+陈汉章 12.8020653633
+异母 12.8020653633
+花岛 13.900677652
+保定路 12.8020653633
+弄权 10.1871055853
+有悖 10.604840786
+山不转 12.8020653633
+一套 6.5160672688
+威尔金森 11.2616203224
+译师 11.8212361103
+南恩州 13.2075304714
+里静静 12.8020653633
+铜头铁额 13.2075304714
+密不通风 12.1089181827
+报价表 12.2912397395
+简阳县 13.900677652
+万余所 12.8020653633
+浓香型 12.1089181827
+糊状 10.0294766411
+预知 10.0294766411
+杭家茶 13.2075304714
+人和事 10.4994802703
+一女 9.75754292558
+三生有幸 11.1280889297
+白汪汪 12.8020653633
+诸府 11.9547675029
+一骨碌 10.2630914922
+花岩 12.5143832909
+森田疗法 13.900677652
+研求 12.5143832909
+皇储 11.1926274509
+一如 8.39534611604
+哗喇 12.8020653633
+西塔 11.0674643079
+企鹅 9.91169360541
+一妇 11.1926274509
+规范性 9.13850371718
+银号 11.3357282945
+宣佩 12.8020653633
+听阈 11.7034530746
+金邦平 12.8020653633
+乌丸氏 12.5143832909
+乘隙 10.642581114
+食物嵌塞 13.900677652
+三流 11.5027823792
+夕照 10.533381822
+花屏 13.2075304714
+花山 11.1280889297
+瞬时间 13.2075304714
+爱我所爱 13.2075304714
+年时 8.170577869
+巴勒斯坦民族解放运动 13.2075304714
+小虫儿 13.900677652
+飘着雪 12.5143832909
+整所 13.900677652
+布洛姆 13.900677652
+鱿鱼 10.1164880181
+太优隆 13.900677652
+一妻 11.8212361103
+无法解释 9.69598503258
+几百万千瓦 12.8020653633
+弹匣 9.12155415886
+印制电路 13.2075304714
+三浦 13.2075304714
+更上一层 13.900677652
+陈顺 11.4157710022
+心肌炎 10.2897597393
+炫技 11.8212361103
+媚人 12.8020653633
+四千五 12.5143832909
+诺里斯 13.2075304714
+叶君健 12.8020653633
+宋少帝 12.8020653633
+十八件 13.2075304714
+假嗓子 13.900677652
+情为民 13.2075304714
+荧光笔 13.900677652
+道光帝 10.8096351986
+宋子文 10.533381822
+亡命 9.66657114738
+疏失 10.4994802703
+异步 11.5027823792
+杨凝式 12.8020653633
+多亿年 12.5143832909
+腐气 12.1089181827
+年方 10.2897597393
+皮肉生涯 13.900677652
+贾政闻 13.2075304714
+花尽 12.8020653633
+宇内 11.1926274509
+诸帅 11.9547675029
+谭峭 12.5143832909
+劳师 11.9547675029
+诸帝 11.3357282945
+都行 9.19114745066
+送款 13.900677652
+量值 10.6818018271
+豁免权 10.4994802703
+有性 9.74179456862
+卫牛员 12.8020653633
+一市 10.3171587135
+于贵霜 12.8020653633
+掐花 13.2075304714
+任从 10.765183436
+诸姬 12.8020653633
+西宾 13.2075304714
+万余支 13.2075304714
+有染 11.4157710022
+凝瑞 12.8020653633
+淳化 10.1164880181
+鄂伦春自治旗 11.5027823792
+林枫 12.5143832909
+一帐 13.2075304714
+茶渣 11.9547675029
+一帖 11.3357282945
+皇城 8.75318317516
+吴为回 12.5143832909
+司法部 10.0940151622
+融资 5.83698501771
+小组会 12.8020653633
+一带 5.73275828902
+一帧 11.0674643079
+四大片 13.2075304714
+第五十九篇 13.2075304714
+派员参加 13.900677652
+花寺 12.1089181827
+一帮 8.69119149913
+狂想曲 10.604840786
+一席 9.26594866375
+踢起来 13.2075304714
+过熟 13.2075304714
+格廷根 12.2912397395
+塞勒凯 13.2075304714
+叫卖声 11.0103058941
+耶律怀 12.8020653633
+一个组 11.4157710022
+士丹 12.8020653633
+新闻报道 9.77354326693
+燕青离 13.2075304714
+山羊草 13.2075304714
+假摔 12.2912397395
+一个纸 11.4157710022
+利齿 11.0674643079
+加盟费 13.900677652
+融贯 12.8020653633
+长途贩运 12.1089181827
+年成 10.8561552143
+一万一千八百八十斤 13.2075304714
+胡自皋 8.53938548627
+陶朱公 13.2075304714
+微弱 7.80710788193
+有极 10.2630914922
+和继发 12.8020653633
+花完 11.1280889297
+纪述其 13.2075304714
+一幢 9.12999302751
+夏公子 13.900677652
+预热 9.72629038208
+腐殖 11.1926274509
+响着 9.87532596124
+传下来 9.14708746087
+花容 11.5027823792
+亡友 12.2912397395
+子幽王 12.8020653633
+一干 8.6966709649
+有枪 10.7226238216
+一并 8.11378027061
+阿鲁威 13.2075304714
+一年 5.29620645245
+贝鲁特 10.2897597393
+魏攻 12.2912397395
+克西 11.7034530746
+驰骋疆场 13.900677652
+云阳县 13.2075304714
+锥体 10.5684731418
+二十三四岁 12.5143832909
+淳厚 11.1926274509
+万余斤 13.2075304714
+相良 13.2075304714
+一床 9.59661255877
+合金化 11.9547675029
+禾本科 9.05649056552
+董伟 13.900677652
+马尾松 9.18217878068
+一店 12.5143832909
+一应 8.12612610643
+平行四边形 11.4157710022
+有权 7.29132840881
+张飞性 13.2075304714
+广罗人才 13.900677652
+吃不了兜着走 10.2897597393
+上党 9.46986085313
+电感器 11.9547675029
+龟足 12.5143832909
+谦恭地 10.8096351986
+全四卷 13.900677652
+乐甫波 12.5143832909
+花季 11.9547675029
+运动障碍 10.9562386728
+有条 9.49395840471
+士人 9.13850371718
+益阳县 11.9547675029
+紧急制动 11.7034530746
+闲渡 13.900677652
+重量轻 9.37888907493
+铝箔 10.9049453784
+有望 5.68919473553
+诸天 10.4041700905
+签名档 13.900677652
+有期 11.8212361103
+市场化 7.2439511278
+周水子 12.5143832909
+费约 13.900677652
+朱姨 10.6818018271
+诸夷 11.7034530746
+小蜂科 12.8020653633
+有机 6.92246390935
+夏秋蚕 12.8020653633
+诸夏 11.2616203224
+高宗时 11.1926274509
+朱右选 13.2075304714
+拦腰截断 12.2912397395
+阴陵 12.1089181827
+碎银 10.1630080337
+娃娃兵 13.2075304714
+柯拉果 12.8020653633
+铝管 12.8020653633
+占旺相 13.2075304714
+矿藏分布 13.900677652
+一建 11.9547675029
+低聚物 12.2912397395
+年报 7.48068272383
+银行间 7.84623830571
+张嶷 10.3171587135
+一开 9.35738286971
+双模式 12.8020653633
+求着 11.2616203224
+镍钢 12.5143832909
+品月 13.900677652
+一式 10.604840786
+士伍 12.8020653633
+多种产品 10.2630914922
+求生存 11.0674643079
+疏忽 8.66423568915
+士众 12.2912397395
+不拘形式 12.2912397395
+敢爱敢恨 13.2075304714
+笑逐颜开 10.642581114
+维乌斯 11.9547675029
+晕车药 13.900677652
+越来越快 10.4666904475
+精料 11.7034530746
+一张 6.00004103896
+四百六十七 12.8020653633
+内共生 13.900677652
+几袋 11.7034530746
+皇国 13.900677652
+阿拉伯胶 12.2912397395
+一弯 9.82314020807
+武当派 12.8020653633
+重振旗鼓 10.3171587135
+一弹 10.0505300503
+费罗 11.598092559
+于领陆 13.900677652
+济贫 10.1871055853
+年表 9.6811699468
+利鹿 11.8212361103
+吕克托 13.900677652
+蒸散 12.8020653633
+皮内达 13.900677652
+停歇 9.56994431169
+国家税务局 11.7034530746
+王伟民 11.9547675029
+求真 11.4157710022
+佛冈 13.2075304714
+观其行 11.598092559
+镍铁 13.2075304714
+度外 11.9547675029
+刻面 12.8020653633
+人大常委会 8.67493097826
+栏栅 13.2075304714
+五千余 10.4041700905
+三段 10.3171587135
+丁新炉 13.900677652
+停止 6.19857331192
+著名作家 11.5027823792
+无法 5.37511954423
+蒙受损失 11.2616203224
+提名道姓 12.8020653633
+阿帕网 12.5143832909
+日心说 10.9562386728
+熟悉起来 11.9547675029
+无须 7.35820569147
+珍妮佛 13.900677652
+无氧 11.2616203224
+一径 9.63799777493
+一律 7.32699748502
+发动者 11.2616203224
+不告而别 13.2075304714
+顺风转舵 13.900677652
+猜来猜去 13.2075304714
+弘历 11.2616203224
+一得 11.0674643079
+无水 9.33632946051
+儿童不宜 12.8020653633
+打秋风 11.9547675029
+不停息 12.8020653633
+疏影 12.2912397395
+求知 10.7226238216
+德国总理 10.6818018271
+萨尼 12.5143832909
+疾速 11.1280889297
+汉口 8.29487558568
+子传孙 13.2075304714
+一夫多妻制 9.98865464655
+贝斯特 11.5027823792
+呈上升 10.2117981979
+心裁 12.8020653633
+电铃 11.5027823792
+疾退 12.5143832909
+生石灰 10.604840786
+三正 12.8020653633
+三步 9.63799777493
+琢磨不透 11.2616203224
+一心 7.92432674268
+路相州 12.8020653633
+瓦岗寨 13.2075304714
+一了百了 10.765183436
+泥肥 13.900677652
+花娘 13.2075304714
+鹿野苑 11.598092559
+弄懂 10.5684731418
+交换律 12.5143832909
+巴库 10.4666904475
+蜂巢状 13.2075304714
+财东 10.4041700905
+掠地 11.8212361103
+高素质 9.6811699468
+八十一日 13.900677652
+听道 12.8020653633
+李林塔尔 12.5143832909
+踢皮球 11.9547675029
+牛羊肉 10.6818018271
+叶清同 12.8020653633
+语素 11.598092559
+型砂 11.9547675029
+士信 12.1089181827
+子霖叔 11.1926274509
+三款 9.29550746599
+相茂 13.2075304714
+几行 9.91169360541
+疏开 12.8020653633
+当面锣 12.8020653633
+假日 8.77077893705
+计划室 12.8020653633
+蒲桃 13.2075304714
+一念 10.3171587135
+三次 7.26473109629
+吸着剂 13.2075304714
+干的事 10.2897597393
+一忽 13.2075304714
+猢狲儿 13.2075304714
+阳率军 13.2075304714
+一封 7.62028181302
+一将 9.74179456862
+杨雪仰 12.8020653633
+一尊 8.83177344976
+居本洲 13.900677652
+生死场 13.2075304714
+一小 7.77818484246
+斯卡娅 11.4157710022
+挥发物 12.1089181827
+几记 12.8020653633
+一少 11.4157710022
+凝结力 13.900677652
+天下事 9.56994431169
+费米 9.87532596124
+弄成 10.3453295905
+一尝 11.9547675029
+毒蛇猛兽 13.2075304714
+相背 11.0674643079
+三棱 10.3743171274
+天下人 9.62401153296
+闹着玩 10.1871055853
+探案 13.900677652
+府学胡同 12.2912397395
+花姿 12.1089181827
+有时 5.72007670438
+年息 10.6818018271
+国外同类 11.3357282945
+十八丈 13.2075304714
+眼部 8.93783302172
+反本 12.8020653633
+一尺 8.89004235788
+有无 7.78921031247
+私家车 9.36807815882
+吸起来 12.2912397395
+一尾 10.3453295905
+精神恍惚 10.8561552143
+鞑虏 10.765183436
+牵动 8.98802276624
+有料 12.8020653633
+就餐 9.80633308975
+一局 10.0940151622
+五万卷 12.5143832909
+万余条 11.9547675029
+李闯王 7.9817837977
+一届 9.33632946051
+运行图 13.2075304714
+相股 13.900677652
+读者文摘 11.598092559
+姹紫嫣红 10.9049453784
+排汗 11.3357282945
+农工民主党中央 12.8020653633
+秦蜀行 13.2075304714
+大使馆 9.96885201925
+有方 9.82314020807
+幸得胜 13.2075304714
+顺随 13.900677652
+穿针引线 11.7034530746
+绝域 12.8020653633
+一辈子头 12.5143832909
+皮带轮 13.2075304714
+活活泼泼 12.8020653633
+听取意见 11.1926274509
+股东 5.3818857392
+诸官 10.7226238216
+一山 10.0294766411
+李安东 13.900677652
+绿化区 12.2912397395
+苏尔诗 12.1089181827
+李安世 13.2075304714
+诸宗 12.2912397395
+孙占元 13.2075304714
+净水厂 13.900677652
+一岁 9.37888907493
+侍贾母 13.2075304714
+秦雍西 9.54396882529
+有救 10.0088573539
+心肌病 10.7226238216
+冷挤压 12.8020653633
+枯寂 12.1089181827
+三案 10.765183436
+牛初乳 13.2075304714
+三桌 12.2912397395
+僻巷 12.8020653633
+投资部 9.58318953844
+糊着 10.4349417492
+费手脚 13.2075304714
+惠阳县 11.8212361103
+有数 9.02548032877
+融雪径流 12.8020653633
+无漏 12.5143832909
+傻话 10.4994802703
+相聚 9.37888907493
+伍尔夫 12.8020653633
+别克斯 13.2075304714
+爱尔福特 13.2075304714
+暴力行为 10.9562386728
+精明 8.26588804881
+秋子梨 13.2075304714
+诸子 9.12999302751
+凝目 12.2912397395
+三桥 11.1280889297
+羊毛商 13.2075304714
+柯太守 11.8212361103
+右后方 12.1089181827
+置信区间 13.2075304714
+王通 11.9547675029
+虾笼 13.2075304714
+奇谈怪论 11.1280889297
+四纷五落 13.2075304714
+凝结剂 13.2075304714
+童言无忌 13.2075304714
+颤抖 7.66626692626
+三栋 11.9547675029
+刑事案 13.900677652
+忍俊不住 11.2616203224
+如获至宝 11.1280889297
+蛇足 12.8020653633
+稳态 10.3743171274
+雷山摩 13.2075304714
+构筑 8.10461990121
+三根 9.77354326693
+越来越少 8.66423568915
+花头 11.4157710022
+局部地区 8.90346537821
+个人性 13.900677652
+多多保重 11.7034530746
+张居 13.900677652
+弹去 12.5143832909
+三样 10.604840786
+女性阴道 11.9547675029
+航空展 11.9547675029
+羞涩 8.99540287354
+一峰 11.9547675029
+三株 12.5143832909
+屈阿栈 13.2075304714
+花大 10.2630914922
+扬花 11.5027823792
+甲壳动物 9.56994431169
+亡党 13.2075304714
+卫前军 13.2075304714
+日本央行 8.80081122415
+随机样本 13.2075304714
+大汉族主义 13.2075304714
+假期 8.13235665618
+大专文化 13.900677652
+凝睇 13.2075304714
+视图 12.8020653633
+桌面上 9.31571017331
+落霞与孤鹜齐飞 12.8020653633
+和气生财 12.5143832909
+二十种 13.2075304714
+速食面 12.8020653633
+众议 10.8096351986
+渊默 13.900677652
+一百种 12.5143832909
+菌柄 11.3357282945
+平开门 13.900677652
+计划外 11.2616203224
+花墙 11.8212361103
+模块化 9.87532596124
+郭风 13.2075304714
+抛光片 13.900677652
+山右 13.900677652
+品貌 11.7034530746
+诸校尉 13.2075304714
+推拉门 12.1089181827
+计划处 11.7034530746
+魏豹 13.2075304714
+黄皆令 12.5143832909
+求生 9.53122979951
+海洋法 10.1394775363
+纬书 12.1089181827
+寻医问药 13.2075304714
+十八九 11.9547675029
+公孙胜一 13.2075304714
+远高于 8.38322475551
+数十年如一日 12.8020653633
+凝眸 11.7034530746
+半挂车 13.2075304714
+顾养民 9.22784881751
+李剑阁 10.2371160058
+律师袍 13.900677652
+助残日 13.900677652
+拚死 10.8096351986
+咸鱼翻身 10.9049453784
+东扩 10.604840786
+国家外汇 12.1089181827
+反来 10.2371160058
+慕容夫人 11.3357282945
+气不打 11.0674643079
+白鳞鱼 13.900677652
+弄掉 11.598092559
+假果 12.8020653633
+实业 6.99192287266
+就食 11.598092559
+蒋唐 12.8020653633
+鸡栅 13.900677652
+补给点 13.2075304714
+精本 12.8020653633
+萨师俊 12.8020653633
+醉翁 13.900677652
+骨科医生 13.900677652
+赢得荣誉 13.900677652
+双职工 12.5143832909
+刮骨 11.1280889297
+豌豆黄 12.5143832909
+马丁斯 13.900677652
+三楼 9.15574552361
+迅雷不及掩耳 10.5684731418
+好事之徒 11.5027823792
+五万五千 12.5143832909
+失欢 12.5143832909
+犹太教徒 11.1926274509
+西魏亦 13.2075304714
+来情去意 13.2075304714
+租赁者 13.900677652
+南京长江大桥 10.9562386728
+脱粒机 11.5027823792
+麦尊致 12.8020653633
+马丁新 13.900677652
+升船机 10.4666904475
+无畏地 13.900677652
+灸法 10.6818018271
+日出而作 11.8212361103
+关圣大帝 13.2075304714
+格萨尔 10.533381822
+哪吒闹海 13.900677652
+海拉尔市 11.0674643079
+中华鲟 10.4666904475
+通灵者 13.900677652
+宽紧 13.2075304714
+冰点价 13.2075304714
+直讲 11.9547675029
+围砌 12.8020653633
+厚意 10.4666904475
+记帐法 12.8020653633
+变平 12.2912397395
+皇后 6.78672154241
+一川 11.5027823792
+桔皮 12.1089181827
+屈膝下跪 13.2075304714
+线性变换 11.4157710022
+大容量 9.46986085313
+连话都 10.4349417492
+富察氏 11.9547675029
+少数几种 11.2616203224
+皮毛 8.42421410004
+一巷 13.2075304714
+完完整整 11.9547675029
+周官解 13.2075304714
+高速率 13.900677652
+一刀 8.07763175649
+拚搏 13.2075304714
+一分 8.22050504296
+一切 4.99645491461
+魏茨 10.8561552143
+跟得上 10.9562386728
+度命 13.2075304714
+宽宏大度 13.900677652
+一划 10.8096351986
+程序员 10.765183436
+平流霜冻 13.900677652
+农业国 10.0505300503
+一列 9.16447920358
+闹声 12.5143832909
+思想负担 12.8020653633
+邹平南 13.2075304714
+一则 7.38744754106
+无憾 11.5027823792
+花城 11.1926274509
+调下来 13.900677652
+埃塞俄比亚人 11.7034530746
+马嘉理 12.5143832909
+携手并肩 12.8020653633
+恽寿平 11.5027823792
+一别 9.65218240993
+阴市 13.900677652
+三曲 13.2075304714
+救药 13.900677652
+假根 10.2897597393
+石头路 12.8020653633
+一到 7.44705265308
+黑超特警 13.900677652
+诺贝尔奖 8.6803218269
+耶律氏 12.2912397395
+帐下 9.65218240993
+弄水 11.9547675029
+一刹 10.8561552143
+疏勒 9.5186510173
+东沙岛 11.2616203224
+一剂 9.80633308975
+探春 8.65893063692
+一削 12.2912397395
+膀胱俞 13.900677652
+一前 12.2912397395
+一剑 9.7898037878
+太尉钧 12.2912397395
+入侵 6.93748766611
+阿特金 12.5143832909
+假案 11.5027823792
+皇家 6.98694030132
+干着急 10.765183436
+一剥 13.900677652
+探明 8.30596627237
+词义 9.96885201925
+一副 6.68617323782
+诸善 12.5143832909
+弄污 12.8020653633
+一割 12.1089181827
+燕青换 13.2075304714
+花垣 12.1089181827
+皇室 8.27666014579
+郎世宁 12.1089181827
+求稳 11.1280889297
+无所不为 11.0103058941
+皇宫 8.28027678626
+泥路 12.5143832909
+就是说 7.90422556336
+异态 12.1089181827
+车位费 13.2075304714
+响箭 10.642581114
+流起 12.2912397395
+花坛 9.58318953844
+护院 11.2616203224
+杠子 10.1871055853
+蓝小梅 8.30225569298
+花坞 13.2075304714
+三晋 9.74179456862
+轴重 12.2912397395
+顺顺 11.7034530746
+一力 10.0294766411
+开业典礼 11.598092559
+一办 11.0674643079
+围着 7.82993992397
+词人 9.54396882529
+耶律沙 12.8020653633
+入住 9.04086524761
+韩元 11.1926274509
+秀气 10.0940151622
+论交 13.2075304714
+一劫 10.4666904475
+铝矿 10.7226238216
+寨外 9.19114745066
+连番 11.0103058941
+曲坛 12.5143832909
+四五根 13.900677652
+软件工程 10.8561552143
+韦编三绝 13.900677652
+州际公路 13.900677652
+花坪 11.7034530746
+无感 12.8020653633
+可减轻 10.1394775363
+年满 9.5062284973
+征战史 13.900677652
+蜗居 9.11318590919
+三星 8.2273543848
+两百多里 12.5143832909
+圣尼古拉斯 13.2075304714
+杂志社 9.40086798165
+腐朽 8.52078029844
+威灵仙 12.1089181827
+花圃 10.5684731418
+郭靖 12.5143832909
+二万五千里 12.8020653633
+三明 11.2616203224
+花圈 10.4349417492
+弄法 11.4157710022
+入伍 9.20019728618
+德罗巴 13.900677652
+入伏 12.1089181827
+划过来 11.7034530746
+摊点 11.5027823792
+课椅 13.900677652
+凝碧 12.5143832909
+不亢不卑 11.1926274509
+入伙 9.20019728618
+三是 6.78185140291
+入会 10.6818018271
+一勺 10.1871055853
+听筒 10.765183436
+事宜 7.1877214513
+三春 11.598092559
+转转 9.53122979951
+三昧 10.1164880181
+五百所 13.2075304714
+粟裕将军 13.900677652
+益阳市 11.0674643079
+一包 8.41588071849
+老谋子 12.5143832909
+万余株 12.5143832909
+郑道昭 12.8020653633
+一百余万 13.2075304714
+一个班 9.65218240993
+费钱 11.4157710022
+郭隗 13.2075304714
+迪亚曼 13.900677652
+皇嫂 12.1089181827
+医学影像 12.8020653633
+假植 13.900677652
+一匙 11.598092559
+欧玛尔 12.5143832909
+国旗班 13.900677652
+停有 12.8020653633
+许褚 9.74179456862
+探杆 12.8020653633
+相迎 8.75901409547
+具体地说 10.765183436
+三柱 12.1089181827
+升水 9.82314020807
+戴软纱 13.2075304714
+停机 10.1394775363
+宋辽夏 13.2075304714
+扬起 8.6803218269
+相连 7.05586217277
+播映权 12.8020653633
+无悔 11.1280889297
+相违 11.5027823792
+入仕 9.91169360541
+獾油 12.5143832909
+求签 11.1280889297
+相近 7.71652876104
+花园 7.30489713801
+入仓 12.5143832909
+魏良 12.2912397395
+一千 8.26946587015
+白匀唤 13.2075304714
+一十 11.8212361103
+三枝 11.7034530746
+无惧 10.7226238216
+每部 10.1871055853
+令人厌倦 12.2912397395
+葬式 11.3357282945
+下雪天 12.2912397395
+安格尔 11.9547675029
+扣杀 11.8212361103
+易家湾 13.2075304714
+无想 13.900677652
+灼伤 10.1630080337
+骂街 11.3357282945
+一卖 11.1926274509
+三极 11.598092559
+傻傻的 13.2075304714
+一不留神 10.8096351986
+蜕膜 12.5143832909
+青春痘 11.4157710022
+一卡 11.7034530746
+作训服 12.5143832909
+无情 8.17382990439
+相较 8.85725253506
+魏军惊 12.8020653633
+刘完素 12.2912397395
+豁拳 13.900677652
+三枪 9.69598503258
+相辞 10.642581114
+轮胎橡胶 11.5027823792
+热盼 12.8020653633
+加盟者 13.900677652
+武周山 12.8020653633
+粗放式 10.8096351986
+探望 8.95903522937
+宋徽宗 9.23723855786
+探查 9.85762638414
+抛光粉 13.900677652
+啃得 11.5027823792
+集团化 11.5027823792
+格达 12.1089181827
+一厅 10.765183436
+三村 12.5143832909
+一压 10.3743171274
+不甘落后 10.5684731418
+区党委 11.5027823792
+护面 11.598092559
+土家族 9.66657114738
+高人一等 11.5027823792
+中国驻南使馆 13.2075304714
+宇文氏 12.1089181827
+铝盆 13.900677652
+笺纸 10.0088573539
+弗洛里 11.598092559
+龟肉 12.8020653633
+来昭宁 12.5143832909
+奥卡河 12.2912397395
+为渊驱鱼 12.1089181827
+豫东 8.9102450652
+一厢 12.8020653633
+滇剧 12.5143832909
+耀亮 13.900677652
+费珍 8.33615724465
+三板 10.1871055853
+都舒 13.900677652
+预紧 12.1089181827
+射过来 11.5027823792
+逆势下跌 10.5684731418
+三杯 9.33632946051
+隋纪 12.2912397395
+三条 7.98447558937
+一去 8.66423568915
+找寻出 12.8020653633
+准新娘 13.900677652
+高人一筹 11.598092559
+祝氏 12.1089181827
+小虫子 11.7034530746
+青年电影制片厂 13.2075304714
+产销量 9.75754292558
+三朝 9.44633035572
+乍得湖 10.5684731418
+三期 9.04086524761
+郅治 12.8020653633
+海洋所 11.8212361103
+耶律淳 10.2117981979
+扬越 11.2616203224
+无息 11.1280889297
+一双 6.79653355899
+三月 7.49050277001
+遗忘症 12.5143832909
+三服 12.1089181827
+入主 9.08039608637
+萨旺那 12.5143832909
+译文集 12.8020653633
+一变 9.10488710638
+耶尔尼斯 10.8561552143
+一口 6.27264652505
+一叠 9.33632946051
+专科生 12.2912397395
+通盘筹划 11.9547675029
+一只 5.52045031563
+一叫 10.604840786
+句型分析 13.900677652
+三朵 10.7226238216
+费率 7.83922073305
+诸君 9.56994431169
+一台 7.82533162089
+阴柔之美 13.900677652
+一叶 9.56994431169
+一号 8.42421410004
+摄入量 9.23723855786
+戎兵亦 13.2075304714
+弄混 13.2075304714
+虾球 12.8020653633
+每道 10.5684731418
+兄弟两人 12.1089181827
+三千六百 11.9547675029
+交织着 11.1280889297
+明年初 7.39788760606
+皇姑 11.8212361103
+无措 10.7226238216
+弄清 8.52078029844
+儿童片 13.900677652
+一倍 7.60541165054
+栏板 11.1280889297
+子英 11.7034530746
+戴宗引 12.2912397395
+避邪 10.4666904475
+后台老板 12.2912397395
+资本论 9.17328983326
+贝伊 12.1089181827
+深圳市中级人民法院 11.1280889297
+诸城 10.0088573539
+农业品 12.8020653633
+栏杆 8.70772080109
+门帘 9.12155415886
+高宗欲 12.5143832909
+有限目标 13.2075304714
+银蝶笑 13.2075304714
+倒嚼 13.2075304714
+贝伦 12.1089181827
+一叶蔽目 13.900677652
+父母亲 9.30555780184
+品格 9.30555780184
+客户关系 10.7226238216
+迪亚斯 10.4666904475
+推心置腹 10.0505300503
+热症 12.8020653633
+一个点 10.1394775363
+低聚糖 12.5143832909
+黄杨木 11.4157710022
+节下 11.9547675029
+一偏 11.1926274509
+停摆 11.5027823792
+司马德操 12.8020653633
+操筹益 13.900677652
+皇妃 11.598092559
+应立即 9.22784881751
+无援 11.7034530746
+要你命 12.8020653633
+一做 12.1089181827
+无声无息 9.35738286971
+于神宗 13.900677652
+一停 8.86372504956
+另一半 9.37888907493
+邮政储蓄 10.3743171274
+相貌 8.61747392324
+中到大雪 11.5027823792
+丰泽园 12.5143832909
+中到大雨 12.8020653633
+唇吻 12.2912397395
+郭门 13.900677652
+找寻到 13.2075304714
+弄湿 11.1926274509
+黑鳞 11.598092559
+这价 13.900677652
+同心县 11.0674643079
+排行 8.76487921493
+日美军 11.1926274509
+羞愤 11.7034530746
+故障率 10.9049453784
+羞愧 9.04864738806
+大于号 13.900677652
+双氧 13.900677652
+科阿韦 13.2075304714
+相象 10.6818018271
+埃尔维斯 13.900677652
+郭锋 12.5143832909
+山呼 9.87532596124
+异或 11.9547675029
+外行人 11.2616203224
+张爽 13.900677652
+业余 8.53003962385
+王庆差 12.8020653633
+封氏闻 12.2912397395
+扛得住 12.8020653633
+秋浦 12.5143832909
+斯多葛 12.8020653633
+几抹 12.8020653633
+哥萨克人 11.9547675029
+聚在一起 9.66657114738
+引脚 13.900677652
+进水口 11.1280889297
+深入细致 10.642581114
+风力机 11.4157710022
+万余公顷 9.63799777493
+普契尼 11.4157710022
+老姜 10.4041700905
+热电 9.33632946051
+帕特里斯 13.2075304714
+有暇 12.1089181827
+热田 10.533381822
+旋复花 13.900677652
+胡里特 12.8020653633
+神智清醒 12.5143832909
+停播 11.7034530746
+避避 11.8212361103
+柜架 13.2075304714
+郭镇 12.1089181827
+技术档案 13.900677652
+异才 12.5143832909
+取信于人 12.5143832909
+同比增加 8.56795885871
+费点 11.7034530746
+维妙维肖 11.7034530746
+侨兴 11.7034530746
+栏架 12.2912397395
+忽如一 12.1089181827
+刑为先 13.2075304714
+相谈 11.5027823792
+侯景立 13.2075304714
+二向色性 13.900677652
+另一台 12.1089181827
+利金 13.900677652
+师勤王 12.5143832909
+寨子 9.48183704418
+漂浮物 12.1089181827
+围田 11.598092559
+瘦骨伶仃 12.2912397395
+数十员 11.7034530746
+遵从 9.01787572939
+鸡毛蒜皮 10.7226238216
+老姨 11.2616203224
+无损 10.1394775363
+皇天 9.80633308975
+另一只 8.30596627237
+病患者 10.1630080337
+任欢忻 13.2075304714
+羊肠线 12.8020653633
+集团军 7.94743431769
+改善生活 10.2117981979
+另一则 11.0674643079
+贝丘 12.5143832909
+冻干 12.8020653633
+巡逻舰 11.3357282945
+三族 10.533381822
+爵禄 10.7226238216
+表示决心 12.2912397395
+求神 10.8561552143
+修理铺 13.900677652
+同类相残 12.8020653633
+羞恼 11.4157710022
+信息系统 9.16447920358
+停放 9.23723855786
+哄堂大笑 10.1630080337
+羞恶 13.900677652
+三时 11.8212361103
+无法挽救 11.9547675029
+磬声 12.8020653633
+相距 8.19689517732
+三无 10.9562386728
+马之法 13.900677652
+三日 7.97909923233
+布洛克 12.2912397395
+蓝采和 13.2075304714
+一元 8.95903522937
+青年工人 11.5027823792
+家贫 9.55687223012
+酰化 11.598092559
+高超音速 12.5143832909
+宣传队 9.61021821083
+都能 13.900677652
+一克 11.4157710022
+自体受精 12.1089181827
+拚杀 13.900677652
+三斗 10.6818018271
+丁零诸 13.2075304714
+都发青 12.5143832909
+犁耕 11.2616203224
+大鸣大放 13.2075304714
+上海市工商联 12.8020653633
+一党 9.91169360541
+羞态 13.900677652
+诞辰日 13.2075304714
+大于利 13.2075304714
+婚纱影楼 11.598092559
+一兜 11.9547675029
+三方 8.66423568915
+连朝宴 13.900677652
+绿化带 10.642581114
+嵊泗县 12.8020653633
+中短途 12.8020653633
+假死 12.2912397395
+一六 11.598092559
+文献汇编 12.5143832909
+标线 10.3453295905
+层次结构 10.9049453784
+一共 7.65263477747
+一具 8.1902506346
+一兵 10.9562386728
+英语会话 13.2075304714
+无拘 12.8020653633
+桑塔尔 12.2912397395
+凝汽器 11.9547675029
+守约方 13.900677652
+十月十日 11.9547675029
+波尔金诺 13.900677652
+转运 7.9526426628
+曲线救国 11.9547675029
+相赠 10.4666904475
+那口子 11.5027823792
+科技局 12.1089181827
+一再 7.34389929582
+夏尔丹 11.8212361103
+未说明 13.2075304714
+艾叶花 12.8020653633
+预编 11.9547675029
+一军 8.42421410004
+稳流 13.900677652
+一写 11.4157710022
+利邦 11.7034530746
+关二爷 12.1089181827
+诸葛瑾 10.642581114
+单纯形法 11.9547675029
+出台 6.10832872786
+求积 12.1089181827
+三整 12.8020653633
+海洋性 9.26594866375
+转进 10.9049453784
+一冲 9.89334446674
+无计可奈 13.2075304714
+无成 11.8212361103
+花呢 10.9562386728
+一冷 10.9562386728
+傻蛋 11.8212361103
+一冻 12.2912397395
+预缴 11.598092559
+搅乱 9.77354326693
+麦绥莱勒 12.8020653633
+别无出路 13.2075304714
+风吹日晒 11.0103058941
+一准 10.4666904475
+护肤霜 13.2075304714
+社会交往 10.533381822
+相责 12.5143832909
+一凉 10.1394775363
+鞠躬屏气 13.900677652
+活鸡 11.1280889297
+一半一半 13.900677652
+反应式 11.1280889297
+排解 10.1871055853
+掠夺 7.8184587416
+放电管 11.3357282945
+花名 11.5027823792
+精武 11.9547675029
+芭蕉叶 11.8212361103
+预置 12.1089181827
+坐科 12.5143832909
+无所 9.20932976975
+挂图 11.4157710022
+石碾子 12.5143832909
+绝热材料 11.7034530746
+放寒假 11.1280889297
+对称核 13.900677652
+耳鬓厮磨 11.4157710022
+翠微居 13.900677652
+有样 12.8020653633
+削断 13.2075304714
+阿朗佐 13.900677652
+勾肩搭背 13.2075304714
+京九铁路 10.9562386728
+三支 9.35738286971
+业主 7.88208443748
+一出 8.0285598625
+一击 9.07236391467
+邪不压正 13.2075304714
+遗念 13.900677652
+文法学家 12.8020653633
+精油 9.93038573842
+三招 11.1926274509
+一十三年 11.8212361103
+丝丝 9.91169360541
+聆教 11.9547675029
+电解池 11.4157710022
+出神入化 11.7034530746
+停战 8.97342396682
+任其自然 12.1089181827
+菽麦 12.5143832909
+三拍 12.8020653633
+察觉 8.41588071849
+以终天年 11.598092559
+张彦 12.5143832909
+新民党 12.8020653633
+无方 10.3453295905
+三担 13.900677652
+塞勒姆 13.900677652
+三十二团 13.2075304714
+格鲁吉亚语 12.8020653633
+花台 12.2912397395
+诸凉 13.2075304714
+昭苏县 12.5143832909
+花叶 11.1280889297
+三拳 11.4157710022
+私货 11.4157710022
+向秀注 13.2075304714
+小妹子 11.7034530746
+五分钟 9.93038573842
+热量表 13.900677652
+犯颜苦谏 13.900677652
+度假 8.98069672615
+制导系统 9.94943393339
+江南地区 9.59661255877
+徐将军 12.8020653633
+一个盆 12.2912397395
+大拍卖 13.2075304714
+蒸气 8.5488195185
+嫦娥奔月 11.3357282945
+三折 11.2616203224
+腮颊 13.900677652
+灸术 13.2075304714
+巴赫兰 13.2075304714
+无日 10.9562386728
+避雷 12.2912397395
+展示馆 12.5143832909
+削成 11.7034530746
+封府库 12.8020653633
+几至 10.8561552143
+半殖民地化 11.0103058941
+花厂 13.2075304714
+花厅 8.89004235788
+河修寨 12.8020653633
+避雨 10.4349417492
+史三馆 13.2075304714
+终审判决 10.8561552143
+每间 11.2616203224
+停手 11.7034530746
+诸葛玄 12.8020653633
+签售会 12.1089181827
+三抹 13.2075304714
+见面 6.82995354472
+鬼门关 10.1871055853
+联合国经济及社会理事会 12.5143832909
+退敌之计 12.8020653633
+文学革命 10.3171587135
+花去 9.89334446674
+几担 12.5143832909
+探戈 10.9562386728
+花县 11.3357282945
+抢拍 13.900677652
+诸军 9.09665660724
+黄瑞采 13.2075304714
+文文书 12.8020653633
+高粱蚜 13.2075304714
+万钧 12.5143832909
+当家花旦 13.2075304714
+欢度春节 12.5143832909
+少数几片 13.2075304714
+无可辩驳 11.0674643079
+唯我主义 13.900677652
+清扫马路 13.900677652
+过君亭 12.8020653633
+诸公 9.55687223012
+型煤 12.8020653633
+耿寿昌 12.2912397395
+灰心丧气 10.6818018271
+谷贱伤农 12.2912397395
+苏赫拉 12.8020653633
+淳安 11.1926274509
+姜正贵 13.2075304714
+三才 10.9049453784
+勇猛善战 11.9547675029
+争着 9.58318953844
+花卉 8.24818847171
+三所 12.2912397395
+预研 12.1089181827
+尤氏命 13.2075304714
+三扇 12.1089181827
+龙牌 13.2075304714
+三批 9.71102290995
+冰球赛 13.900677652
+规模性 11.8212361103
+夜景 9.94943393339
+花卷 11.5027823792
+五六千米 12.8020653633
+菌血症 12.5143832909
+劈锥曲面 13.900677652
+每锅 13.900677652
+发放量 12.5143832909
+精气 9.58318953844
+诸兄 12.8020653633
+无尽无休 12.2912397395
+腮须 13.2075304714
+不胜酒力 12.1089181827
+几脚 11.0103058941
+牙买加政府 12.8020653633
+三战 13.900677652
+明其道 13.2075304714
+托尔多 13.2075304714
+皇弟 11.1926274509
+三成 7.90174109003
+丘陵区 8.85725253506
+围猎 10.0940151622
+小土岭 12.2912397395
+无数 6.82571445401
+保险业 8.30596627237
+编码链 13.900677652
+避险 7.90921310487
+免征 9.32596667347
+小生意 10.8096351986
+反应堆 9.16447920358
+眼里 6.94890548758
+一团 7.50042020667
+强中自有强中手 13.2075304714
+三房 10.6818018271
+无故 9.45802639549
+每镇 11.7034530746
+无效 7.79365476423
+展限 13.2075304714
+无敌 9.55687223012
+撕开 9.4233408375
+花匠 11.8212361103
+三截 12.2912397395
+帕里斯 11.2616203224
+毛汉礼 13.2075304714
+诸儒 12.1089181827
+精汁 13.900677652
+公社化 12.2912397395
+黄钟骏 13.900677652
+停拨 12.1089181827
+一国 7.97375162601
+封建制 9.35738286971
+轰的一声 11.1926274509
+几股 10.2897597393
+一圆 11.7034530746
+林登曼 13.2075304714
+精液 9.41204128224
+诸僧 12.5143832909
+阿迈勒 13.900677652
+冯长舅 13.2075304714
+铝片 13.2075304714
+政令不一 12.5143832909
+浮士德 10.4041700905
+另一名 9.40086798165
+胡里痕 13.2075304714
+巴格达 8.78268383956
+迪亚拉 13.2075304714
+书面发言 13.900677652
+吕文德 12.8020653633
+一在 10.642581114
+相识 8.3285236198
+和潇湘 13.900677652
+研成 10.9562386728
+咂嘴 11.0674643079
+几截 12.1089181827
+一地 8.43684584695
+非公有制 10.0720362555
+一阵雨 12.1089181827
+护照 9.74179456862
+命名 6.93088698207
+雅典娜 10.5684731418
+大分子 9.35738286971
+好福气 11.5027823792
+神宗命 12.8020653633
+夹江 11.4157710022
+市场趋势 9.59661255877
+伏卢氏 13.900677652
+多国部队 10.765183436
+精深 10.0505300503
+异族 9.65218240993
+相认 10.604840786
+千金一笑 12.8020653633
+热狗 11.7034530746
+皇庄 10.7226238216
+糊粉 13.2075304714
+羞明 11.598092559
+篇什 12.2912397395
+欧克拉蒂 12.5143832909
+任贤 12.5143832909
+异日 10.2117981979
+糊精 11.9547675029
+儿童用 12.1089181827
+革制品 13.2075304714
+几胎 13.900677652
+孔特管 13.900677652
+儿童画 13.2075304714
+广播操 13.900677652
+桨架 13.2075304714
+制动器 9.26594866375
+疾风 10.6818018271
+保禄位 12.5143832909
+石首市 13.900677652
+陵川县 13.2075304714
+连踢带打 13.900677652
+年次 11.9547675029
+花剑 11.598092559
+离垢 13.2075304714
+九点半 11.598092559
+哪边 10.7226238216
+活页 12.2912397395
+展露 11.1926274509
+易懂 10.9562386728
+掠影 13.2075304714
+花柳巷 12.5143832909
+毛泽民 12.2912397395
+五十三亩 13.2075304714
+上变 12.8020653633
+店集 12.8020653633
+情孚意合 13.900677652
+停掉 11.5027823792
+苏非派 11.0103058941
+四通利方 13.900677652
+北京天文台 11.9547675029
+罗亚斯 10.642581114
+计划司 12.2912397395
+贪便宜 12.5143832909
+血粘度 13.900677652
+急功近利 10.2371160058
+宣传部 8.7245279194
+赡养父母 13.900677652
+热爱 8.33233314821
+高等数学 11.2616203224
+避震 12.5143832909
+戴汝为 13.2075304714
+稳步 7.12645376562
+小舅 13.900677652
+乘风 10.3743171274
+探探 9.94943393339
+止跌企稳 9.93038573842
+圣莫尼卡 11.7034530746
+电感式 12.8020653633
+预祝 10.7226238216
+削掉 11.5027823792
+骗吃骗喝 12.5143832909
+广藿香 12.5143832909
+异教 10.5684731418
+花到 11.598092559
+夜半钟声 12.8020653633
+播散 10.4666904475
+闪电河 11.2616203224
+浩歌 12.5143832909
+花刺 13.900677652
+纱丽 11.598092559
+喝采 9.44633035572
+含磷量 12.5143832909
+雨花台 11.4157710022
+接连不断 9.80633308975
+异数 11.8212361103
+威宁彝族回族苗族自治县 11.4157710022
+长筒靴 12.2912397395
+旷远 12.1089181827
+孙道临 12.1089181827
+一吃 10.4994802703
+意到笔随 13.900677652
+难挨 11.1280889297
+一合 9.84023464143
+毛茛科 10.642581114
+记成 12.5143832909
+一同 7.21481670491
+一名 6.23211654396
+裁示 13.900677652
+张强 11.4157710022
+一吐 11.5027823792
+一向 6.83250565159
+七八层 13.2075304714
+诸史 11.1280889297
+至正 8.74162235276
+亡妻 11.7034530746
+畲族 10.1871055853
+柴皇城 12.8020653633
+脸谱化 12.8020653633
+一个瓢 12.8020653633
+连朝廷 12.1089181827
+有助于 6.87691869724
+南室韦 13.900677652
+原型车 11.0103058941
+包吃包住 13.2075304714
+一吨 10.0940151622
+作出贡献 9.38981814546
+胆敢 9.45802639549
+一听 7.40390266179
+由红儿 13.900677652
+阿拉伯语 8.68574189437
+明三沙 13.2075304714
+人与狗 13.900677652
+兑端 13.900677652
+一吸 11.4157710022
+一吹 9.80633308975
+轴面 12.1089181827
+见机而行 12.8020653633
+无果 9.15574552361
+生产大队 12.1089181827
+夏秋谷 13.2075304714
+相袭 10.9562386728
+一告 12.2912397395
+花军 12.2912397395
+周官辨 13.2075304714
+花农 12.8020653633
+傅临政 12.8020653633
+单桅船 13.900677652
+二十点 12.8020653633
+历史博物馆 9.48183704418
+卵磷脂 11.0674643079
+北辽朝 13.2075304714
+一员 7.96843246453
+唐王先 13.900677652
+察访 11.4157710022
+湖南话 13.900677652
+平江起义 11.3357282945
+密苏里河 11.3357282945
+年根 13.900677652
+一周 6.6090214428
+巴铎 11.5027823792
+晶体化学 11.0103058941
+爬不动 11.9547675029
+一味 7.91926344072
+雷击火 13.2075304714
+环境恶劣 11.2616203224
+停息 9.69598503258
+不切实际 9.58318953844
+本院认为 13.900677652
+见长 8.98069672615
+一命 9.66657114738
+诸卫 11.7034530746
+启发式程序 13.2075304714
+相衬 11.9547675029
+从总体上 10.2117981979
+民商法 11.5027823792
+亡夫 11.9547675029
+相衡 12.8020653633
+破琴绝弦 13.900677652
+几茬 12.1089181827
+绝无仅有 10.1630080337
+亡失 12.1089181827
+美登木 11.8212361103
+开眉展眼 13.900677652
+硬性摊派 13.900677652
+诸卿 11.3357282945
+凝练 10.5684731418
+花光 10.2117981979
+洪达 13.2075304714
+招呼站 13.900677652
+年检 10.8561552143
+渗水量 13.2075304714
+误动作 12.8020653633
+齐和燕 13.900677652
+张弓 9.65218240993
+市场行情 8.55357012126
+第十九回 11.7034530746
+桃花心木 12.1089181827
+一咬 13.900677652
+普照寺 12.5143832909
+中华门 11.1926274509
+东王 12.2912397395
+既保证 10.8096351986
+翠屏区 13.900677652
+男女搭配 13.2075304714
+枯叶 10.6818018271
+两三米 11.7034530746
+无期 11.1280889297
+高伯年 8.33615724465
+一品 9.00283785202
+三思 9.65218240993
+小妹妹 10.0720362555
+侗族 10.0940151622
+残疾人运动会 13.900677652
+饱学 11.4157710022
+三怕 13.2075304714
+每面 10.5684731418
+中国农业科学院 10.8096351986
+一响 9.00283785202
+渠以东 13.2075304714
+东西南北 9.91169360541
+免疫原性 11.5027823792
+若干头 12.8020653633
+全译本 11.0103058941
+张弛 10.765183436
+三态 11.7034530746
+流氓罪 13.900677652
+集体舞 11.3357282945
+无权 8.73019365694
+兵书 9.13850371718
+融融 10.8096351986
+鳇鱼 11.8212361103
+黄鹄矶 13.2075304714
+花儿 8.94485059437
+一哭 9.89334446674
+水突 13.2075304714
+见闻 9.02548032877
+披发左衽 13.900677652
+旅游界 13.900677652
+三性 11.4157710022
+新民县 12.8020653633
+异构 10.0940151622
+地下资源 11.0103058941
+欧加登 12.8020653633
+正本清源 11.5027823792
+温得和克 11.8212361103
+有法 10.2371160058
+张忠 11.1280889297
+十辑 13.2075304714
+修理部 13.2075304714
+球场上 11.2616203224
+热炒 9.33632946051
+井台 9.91169360541
+预算 7.20735398371
+奥斯威辛 12.8020653633
+国防大学 11.4157710022
+许多名 13.2075304714
+几节 11.8212361103
+唐寓之 13.900677652
+驯兽师 13.900677652
+无暇 9.20019728618
+大马路 11.4157710022
+相见 7.39638947844
+相视 9.74179456862
+听骨 11.7034530746
+匈牙利大 13.900677652
+孟加拉虎 11.9547675029
+唱白脸 12.1089181827
+豪客来 13.900677652
+有泪 11.7034530746
+赛纳河 13.900677652
+相角 12.8020653633
+每隔 8.34771806705
+热点 6.56113995657
+秋温 12.2912397395
+皇岗 12.1089181827
+费用 6.2824265541
+控制变量 12.5143832909
+不入流 11.2616203224
+新芽 11.3357282945
+智勇双全 11.5027823792
+程序包 12.5143832909
+斑斓 9.7898037878
+能流密度 11.9547675029
+雪利酒 13.900677652
+吴家馨 10.8561552143
+围炉 11.8212361103
+忧郁症 11.2616203224
+北屯牧 13.2075304714
+谘诹 13.900677652
+费电 12.8020653633
+主机板 13.900677652
+程序化 10.0088573539
+直布罗陀海峡 10.1871055853
+栉风沐雨 13.2075304714
+有治 13.2075304714
+醉眼 10.3171587135
+求索 10.9049453784
+松恩 13.2075304714
+热热 11.0103058941
+用户电报 13.900677652
+热烫 12.5143832909
+有情人终成眷属 11.598092559
+遍布全国 9.6811699468
+又黄又瘦 12.5143832909
+课外辅导 12.5143832909
+凝缩 11.7034530746
+撕得 10.2117981979
+就逮 12.2912397395
+某一时间 11.5027823792
+腐恶 13.900677652
+北势溪 13.2075304714
+一喊 10.1871055853
+消火栓 11.598092559
+张念 12.8020653633
+主力舰 11.5027823792
+第一零零回 13.2075304714
+不定形 13.900677652
+马国翰 11.7034530746
+乘骑 11.4157710022
+一喝 10.8096351986
+文班吏 13.2075304714
+鼻准 13.900677652
+酰基 11.2616203224
+异术 10.2897597393
+无明 11.9547675029
+千人一面 12.5143832909
+每队 10.3453295905
+利针 12.5143832909
+热罗姆 12.8020653633
+瓦岗军 10.9049453784
+展销 11.598092559
+新闻动态 13.2075304714
+老头 7.47418919452
+祖博夫 13.2075304714
+黄入济 13.2075304714
+哈布尔 13.900677652
+疾驰 9.28555713513
+疾驱 13.2075304714
+另一回 13.900677652
+有气 9.72629038208
+疾驶 11.1280889297
+一个心眼 12.1089181827
+青溪镇 10.7226238216
+德洛夫 12.5143832909
+槽车 11.0674643079
+拉萨贡嘎机场 13.900677652
+槽轮 13.2075304714
+双林镇 12.1089181827
+利尊氏 12.8020653633
+米凯莱 13.900677652
+蓝白星 13.900677652
+每窑 13.900677652
+三愿 11.9547675029
+过火 9.69598503258
+发生冲突 8.9519177616
+有水 9.48183704418
+热火 10.642581114
+腰杆儿 12.2912397395
+预筹 11.7034530746
+健身运动 12.5143832909
+柴可夫斯基 12.2912397395
+几艘 10.8096351986
+曾外祖父 13.2075304714
+有氧 10.0294766411
+偏是 10.1630080337
+睡满 13.2075304714
+石生 11.9547675029
+李景 11.9547675029
+母宋氏 13.2075304714
+版画集 12.2912397395
+冲锋舟 12.1089181827
+广州药业 9.96885201925
+西施 9.66657114738
+普查局 13.2075304714
+戴荆冠 13.2075304714
+李智 10.4349417492
+数字地图 13.2075304714
+铅室法 13.2075304714
+遗闻轶事 12.8020653633
+排到 9.84023464143
+类推 10.533381822
+桥拱 13.900677652
+李晶 9.59661255877
+楚材晋用 13.900677652
+九门提督 13.900677652
+苦水河 12.1089181827
+李晋 13.2075304714
+李芳园 13.2075304714
+捕食者 11.598092559
+本务 12.5143832909
+石申 11.7034530746
+京都市 13.2075304714
+石田 11.598092559
+什么样 7.0806612873
+意态 11.1280889297
+颜回 11.8212361103
+举例 9.04086524761
+成分 6.35740430527
+常驻机构 13.900677652
+李晟 11.9547675029
+李晓 10.3743171274
+张志 10.5684731418
+生食 10.2897597393
+一半则 11.8212361103
+李昭 11.9547675029
+普外科 13.2075304714
+熊牛 13.2075304714
+准格尔旗 11.8212361103
+利斯基 12.1089181827
+耶林 11.9547675029
+李春 11.2616203224
+就作 11.0674643079
+交媾 10.9049453784
+生风 10.4041700905
+增进感情 13.900677652
+裹成 13.900677652
+有生以来 10.0294766411
+一半分 13.900677652
+王历纪 13.2075304714
+愧怍 12.1089181827
+高卷珠 13.2075304714
+李昌 12.8020653633
+语言艺术 11.1926274509
+收缩压 11.1280889297
+李昆 10.2897597393
+抑郁质 13.2075304714
+广州体育学院 12.2912397395
+靠湖 12.8020653633
+借自 11.7034530746
+李星 12.2912397395
+太白阴经 13.900677652
+徐邦达 13.900677652
+种颜色 11.1280889297
+王永光 13.2075304714
+神色仓皇 12.8020653633
+不服水土 11.3357282945
+弥撒曲 11.0674643079
+次氯酸钙 13.2075304714
+本刊 9.20019728618
+增强活力 12.8020653633
+封土堆 11.1926274509
+藏学家 12.2912397395
+覆盖全国 10.533381822
+钟理 12.2912397395
+仇氏 12.5143832909
+倍道而行 12.8020653633
+症结所在 10.8096351986
+本初 10.765183436
+性皮炎 10.2371160058
+傣家 11.598092559
+捣蛋 10.533381822
+仇水 13.900677652
+阴月阴 13.2075304714
+塔潘 12.8020653633
+够劲儿 11.9547675029
+国家开发投资公司 11.9547675029
+核爆 12.2912397395
+成功 5.30411890518
+稳压电源 11.7034530746
+次氯酸钠 13.2075304714
+人文学院 13.2075304714
+温型 13.900677652
+京都府 12.5143832909
+翻老账 12.8020653633
+化蝶 12.2912397395
+久游网 13.900677652
+偏暗 12.8020653633
+布鲁 10.4349417492
+插手 8.93783302172
+斯隆 12.8020653633
+保护神 10.3453295905
+下下棋 12.8020653633
+单斜 9.98865464655
+针筒 13.900677652
+呆头呆脑 11.7034530746
+平衡觉 12.2912397395
+傧相 12.2912397395
+利用效率 9.71102290995
+中耳炎 10.2117981979
+斯图加特芭蕾舞团 12.8020653633
+冈岛 13.900677652
+宁州彭 12.8020653633
+邓夫人 10.533381822
+危害不大 11.9547675029
+四十几年 13.900677652
+雌禽 12.8020653633
+如梦方醒 11.7034530746
+缘木求鱼 12.5143832909
+声价 11.9547675029
+神学院 9.98865464655
+本剧 13.2075304714
+借腹 13.900677652
+好几部 12.8020653633
+贯注 11.7034530746
+四五十岁 11.4157710022
+雁声 12.2912397395
+三四声 13.2075304714
+唐书兵 13.2075304714
+仇池 11.8212361103
+李杨 10.642581114
+等一等 8.88339781516
+龟头 10.0294766411
+光宝 13.900677652
+凤翥龙翔 13.900677652
+生香 12.1089181827
+饱经沧桑 11.0103058941
+光宗 11.2616203224
+埃军 11.8212361103
+光守 13.2075304714
+温泉镇 13.900677652
+洛提尔 13.2075304714
+李松 12.2912397395
+李杰 11.598092559
+本原 9.14708746087
+李杲 12.2912397395
+夹河 11.1926274509
+詹森 11.4157710022
+塔斯卡 13.2075304714
+中文翻译 12.2912397395
+抓辫子 12.5143832909
+偏有 10.8096351986
+熊猴 12.8020653633
+三四天 9.77354326693
+拓荒者 11.598092559
+最低工资 10.4666904475
+封贾诩 13.2075304714
+打哈欠 11.1280889297
+如饥如渴 13.900677652
+浮出 8.31342899358
+李杜 11.9547675029
+熊猫 9.12999302751
+凤首 12.2912397395
+本县 9.02548032877
+对数表 12.2912397395
+上千 9.7898037878
+数万家 12.5143832909
+黄衣黄 13.900677652
+寻呼业 13.900677652
+多亿千克 12.8020653633
+依赖症 12.2912397395
+桥接 13.2075304714
+心潮起伏 11.598092559
+没分开 13.2075304714
+温器 12.2912397395
+褒忠 12.8020653633
+北首岭 11.8212361103
+武术界 10.9049453784
+师么 13.2075304714
+博施法 13.2075304714
+罗宾森 13.2075304714
+公生门 13.2075304714
+协洽 13.2075304714
+鸟雀 10.0720362555
+李月 13.2075304714
+本奥鲁 12.8020653633
+交完 11.5027823792
+寻欢作乐 10.2371160058
+光导 10.9562386728
+亚硝酸钠 11.598092559
+本可 11.9547675029
+裹扎 12.1089181827
+成千 11.2616203224
+李朝 10.3171587135
+本台 12.8020653633
+浮冰 10.3171587135
+全体官兵 11.2616203224
+枯燥无味 11.4157710022
+余兴未尽 12.5143832909
+女军官 13.2075304714
+浮光 12.8020653633
+清账 12.2912397395
+拣出 11.7034530746
+沙珠玉 12.5143832909
+成县 10.8561552143
+过氧酸 13.2075304714
+乱收费 10.642581114
+稻浪 12.8020653633
+仇洋 13.2075304714
+书面语 10.8096351986
+十三方 13.2075304714
+亲合 12.5143832909
+南天门 9.80633308975
+教育业 11.9547675029
+交存 11.9547675029
+李某 9.00283785202
+十三斤 12.8020653633
+于高端 11.2616203224
+塔里木 9.59661255877
+本区 8.71889410168
+维大惊 11.7034530746
+交子 11.2616203224
+别墅区 10.9562386728
+埃克 11.598092559
+就会 5.41621428518
+机器声 11.2616203224
+王坪 12.5143832909
+光子 9.03314320152
+别捷赫 12.8020653633
+渔阳鼙鼓 13.900677652
+备案制 11.7034530746
+曲面模型 12.8020653633
+收缩到 12.5143832909
+民主决策 10.4994802703
+长镜头 12.2912397395
+马尔代夫 10.0720362555
+阿尔斯特 12.5143832909
+决策机构 9.96885201925
+狐疑 8.84443184663
+何时能 10.2117981979
+私营化 13.2075304714
+十三时 13.2075304714
+柳若晨 8.80081122415
+层次分 12.5143832909
+师授 13.2075304714
+沙漠地 13.2075304714
+李果 13.900677652
+十三日 9.87532596124
+埃兰 10.604840786
+成双 10.8561552143
+光学 7.49710345404
+伏尔加格勒 11.4157710022
+康定县 11.9547675029
+警觉地 9.75754292558
+畏缩 10.1164880181
+抽出来 9.80633308975
+一时半刻 10.8096351986
+德基水库 13.2075304714
+空寂超 13.900677652
+化学试剂 10.4349417492
+酸类 11.8212361103
+弓在弦 13.2075304714
+龙晃晃 13.2075304714
+第七十七条 13.2075304714
+四五十年 12.2912397395
+电子对抗 9.41204128224
+雨顺风调 12.5143832909
+小小的 7.16965955149
+垦荒 9.56994431169
+石眼 12.5143832909
+维克斯 10.765183436
+回大陆 13.900677652
+古斯拉夫 12.8020653633
+于高祥 12.5143832909
+电车站 13.2075304714
+溶媒 12.1089181827
+少管所 13.900677652
+反间谍 11.8212361103
+徜徉 10.9562386728
+防洪工程 11.3357282945
+成倍 10.0720362555
+普通工人 11.1280889297
+推进器 9.46986085313
+茶毛虫 13.900677652
+演艺 9.75754292558
+畏罪 11.598092559
+神洲傲 11.9547675029
+盔甲 8.99540287354
+翩然 11.2616203224
+寇准 11.0674643079
+浮力 9.4233408375
+经打听 12.5143832909
+亡国 8.22392384971
+脑涨 13.2075304714
+浮动 8.19689517732
+亲启 11.4157710022
+配股价 9.96885201925
+皮皮虾 12.8020653633
+谢铁骊 12.8020653633
+共享软件 13.900677652
+五六倍 11.9547675029
+写上去 11.8212361103
+张伯苓 11.0674643079
+做一套 13.900677652
+江湖医生 13.2075304714
+投票率 12.8020653633
+脑海 8.77077893705
+李擢 12.8020653633
+红鹳 13.2075304714
+到岸价 12.2912397395
+褪色 9.84023464143
+如胶似漆 11.3357282945
+伊犁州 13.2075304714
+会计专业 13.900677652
+悄然无声 11.598092559
+薄薄的 8.93783302172
+埃利 12.1089181827
+另行规定 12.1089181827
+李擎 13.2075304714
+歌剧团 11.1926274509
+打拼 9.5186510173
+约什 13.2075304714
+克罗齐 11.7034530746
+生理性 9.93038573842
+手法主义 13.900677652
+换能器 10.4994802703
+肯坐 11.598092559
+有得赚 12.5143832909
+不绝如线 12.8020653633
+印第安纳波利斯 13.900677652
+吴汝孝 11.5027823792
+毛笋 13.900677652
+津市市 12.1089181827
+讲道 9.91169360541
+瘦骨嶙峋 10.4994802703
+执迷不醒 13.900677652
+光塔 13.2075304714
+光彩四射 13.900677652
+二氢叶酸 13.2075304714
+双休日 10.9049453784
+狐皮 11.0103058941
+失血性 11.1280889297
+地裂运动 13.900677652
+三十八类 12.8020653633
+石矿 13.900677652
+恭亲王 9.87532596124
+靠泊 11.1926274509
+从头来 12.1089181827
+引诱剂 12.5143832909
+石矶 12.8020653633
+西成纪 12.2912397395
+甜度 11.1280889297
+轮班工作 13.900677652
+填饱 10.5684731418
+阔少爷 13.2075304714
+签了 10.1871055853
+捣蒜 11.4157710022
+肿起来 12.5143832909
+成像 8.74162235276
+干砌石 12.8020653633
+抗震 10.3743171274
+林家翘 11.8212361103
+李敬 11.598092559
+边防战士 12.5143832909
+一半折 13.2075304714
+带状疱疹 11.1926274509
+何敢言 13.900677652
+经济特区 10.0088573539
+口蹄疫 11.598092559
+脑泡 11.9547675029
+波斯菊 12.8020653633
+脑波 12.8020653633
+举世 10.642581114
+没里没外 13.2075304714
+短期投资 9.85762638414
+自认倒霉 11.5027823792
+皮肌炎 12.1089181827
+松懈 9.35738286971
+溯源侵蚀 10.765183436
+山圆静 13.2075304714
+李敏 12.5143832909
+令人激动 11.9547675029
+熊焱 13.900677652
+适应力 11.3357282945
+植俊 13.2075304714
+大肠癌 12.8020653633
+黏膜 10.2630914922
+划框框 13.900677652
+植保 11.8212361103
+交通条件 10.765183436
+人伦 10.2117981979
+李敖 13.2075304714
+不外是 9.96885201925
+埃及 6.95466366088
+方广寺 12.2912397395
+刘静逸 10.2117981979
+瘦肉精 11.0103058941
+塔河 10.9562386728
+沉默者 12.5143832909
+分析法 9.20019728618
+沈颢 13.900677652
+低头耷脑 13.900677652
+水龙吟 12.1089181827
+靠海 11.8212361103
+李政 11.4157710022
+多用表 12.8020653633
+成全 9.45802639549
+约伯 12.8020653633
+掏掏 13.900677652
+窦娥冤 10.4666904475
+里亚原 13.900677652
+李攀 13.2075304714
+干海子 12.8020653633
+约会 8.98069672615
+鸟铳 10.5684731418
+袁绍大 12.2912397395
+一千三百名 13.2075304714
+福兮祸所伏 12.1089181827
+梁城 12.8020653633
+尼亚湾 11.7034530746
+蓬蒿 11.5027823792
+配子体 10.2371160058
+十三条 11.8212361103
+烟火食 12.8020653633
+成冰 11.0103058941
+打拐 11.9547675029
+唐韩愈 13.2075304714
+李旭 9.43476953332
+浮华 10.3171587135
+十三枚 13.900677652
+羽扇纶巾 12.5143832909
+石人石 12.2912397395
+光照 8.53938548627
+眉毛胡子一把抓 13.900677652
+基本建设 9.16447920358
+浮升 11.7034530746
+二百几十年 12.8020653633
+交好 10.2630914922
+光复 9.14708746087
+甜心 12.2912397395
+熊熊 9.85762638414
+一举手一 13.2075304714
+黄枝木 13.2075304714
+土耳其族 12.8020653633
+断层湖 11.7034530746
+郭先生 11.0103058941
+趋于稳定 9.37888907493
+脓胞 13.900677652
+满篇 13.900677652
+梁唐晋 13.900677652
+成军 10.9049453784
+术赤 10.1871055853
+晋源镇 11.8212361103
+光头 8.99540287354
+脑汁 12.5143832909
+孔雀绿 12.8020653633
+偏斜 10.642581114
+三四家 12.5143832909
+香烟盒纸 13.900677652
+针砭 10.9049453784
+藤编 11.598092559
+本儿 11.0674643079
+亚马孙河 9.58318953844
+成册 10.8561552143
+甜得 12.1089181827
+勇挑重担 12.8020653633
+石盘 11.7034530746
+脓肿 9.59661255877
+本元 12.5143832909
+李斯 9.82314020807
+交大 11.3357282945
+石盐 10.4666904475
+各族人民 8.3555002075
+模仿秀 11.7034530746
+贾蓉之 11.5027823792
+变化很大 9.45802639549
+成凤 13.900677652
+呵令 13.900677652
+李新 10.2371160058
+载频 13.2075304714
+巴西政府 11.598092559
+本党 11.0674643079
+布尔什维克 9.0884932966
+美国哥伦比亚广播公司 13.900677652
+慈四模 13.2075304714
+深圳市 7.82533162089
+强风 10.2897597393
+李斌 11.2616203224
+通达 8.98802276624
+史者 11.2616203224
+测量范围 11.9547675029
+八公山上 12.8020653633
+天壤之别 10.0088573539
+偏旁 10.765183436
+李文 10.0294766411
+瓦里安 12.8020653633
+定都在 13.900677652
+一败涂地 10.0720362555
+溶孔 12.8020653633
+泥塑像 13.900677652
+三四寸 12.2912397395
+尉召亚 13.2075304714
+抗逆 12.2912397395
+三四封 13.2075304714
+靠模 13.2075304714
+李扬 10.4994802703
+继续执行 9.37888907493
+插曲 9.72629038208
+溶岩 11.7034530746
+宇津保 13.2075304714
+保险金 9.94943393339
+偏房 10.765183436
+参赛者 11.3357282945
+语法学 11.598092559
+森林气候 11.4157710022
+老景 12.8020653633
+顶多能 12.8020653633
+体仁 12.8020653633
+蓬菜 13.2075304714
+新民路 13.900677652
+共同社 11.8212361103
+哈尔滨市 9.58318953844
+好极了 10.0940151622
+一德一心 13.900677652
+热门货 12.1089181827
+图西 11.9547675029
+储存量 11.5027823792
+干品含 13.900677652
+青铜剑 11.5027823792
+对外商 13.900677652
+罗巴 11.1926274509
+牵引钩 12.8020653633
+驰马试剑 13.900677652
+三四尺 12.1089181827
+勒布伦 13.2075304714
+水龙卷 11.2616203224
+上下齐心 11.598092559
+光度 9.49395840471
+和校验 13.2075304714
+材料费 12.1089181827
+远山近水 13.2075304714
+南郭先生 13.900677652
+免息期 11.0674643079
+偏执 10.4041700905
+次大陆 10.0505300503
+查冯保 13.2075304714
+韦登 12.5143832909
+莫不 8.81927328699
+太医 8.69119149913
+山西路 11.1280889297
+宋孝武 13.900677652
+顶少 12.5143832909
+马拉硫磷 12.8020653633
+成器 11.8212361103
+亚特兰大 10.5684731418
+横越 10.4041700905
+左昆山 11.2616203224
+偏才 10.604840786
+订盟 13.2075304714
+红塔山 11.4157710022
+谭处端 12.5143832909
+本因 13.2075304714
+休宁县 11.9547675029
+本园 12.5143832909
+燕乐 10.8561552143
+上海长征医院 13.2075304714
+戊戌维新 11.598092559
+燕义 12.2912397395
+久经沙场 11.8212361103
+燕之 12.8020653633
+蓬莱 9.34680076038
+李成 9.54396882529
+莫丹 13.2075304714
+交底 11.8212361103
+破口 10.7226238216
+温升 12.2912397395
+石煤 10.642581114
+李朝钦 12.8020653633
+杨文广 12.8020653633
+三四岁 11.0103058941
+拙嘴笨舌 12.8020653633
+温县 10.2117981979
+燕人 11.9547675029
+名誉权 11.598092559
+偏护 12.8020653633
+下关区 13.2075304714
+燕京 7.93709830836
+奥蒂化 13.900677652
+谙熟 10.4994802703
+敞开大门 11.7034530746
+交并 13.900677652
+蓬荜 12.1089181827
+儿科医院 13.900677652
+发几张 13.900677652
+另眼看待 10.765183436
+温厚 10.4666904475
+彼一时 11.1926274509
+条带 10.604840786
+燕云 9.96885201925
+考大学 10.7226238216
+留尼汪岛 11.598092559
+直播 9.10488710638
+登起来 13.900677652
+强龙 12.1089181827
+偏折 11.7034530746
+酉鸡 12.8020653633
+韦皋 12.2912397395
+切除率 13.2075304714
+光带 11.0674643079
+满达尔 12.1089181827
+浮吊 13.900677652
+德尔塔 11.8212361103
+浮名 12.1089181827
+唐为云 12.8020653633
+蒎烯 11.3357282945
+温台 13.2075304714
+思湍 11.1926274509
+中国女队 13.900677652
+石燕 12.8020653633
+成团 10.0720362555
+辽沈战役 10.1394775363
+子成王 12.5143832909
+稻株 13.2075304714
+狗彘不如 12.5143832909
+接电源 12.8020653633
+复查 9.37888907493
+蒎烷 13.900677652
+打击报复 10.4994802703
+一笔带过 11.1926274509
+拆零 13.900677652
+喟叹 11.5027823792
+纵坐标 11.3357282945
+强化剂 11.8212361103
+抢购一空 11.5027823792
+六道轮回 12.2912397395
+光年 9.62401153296
+东京国立博物馆 12.5143832909
+证婚人 11.5027823792
+嗡嗡声 10.8096351986
+扳住 11.0674643079
+御史 7.87481167815
+交帐 12.8020653633
+解放思想 9.63799777493
+偏振 9.77354326693
+宋裴松 13.2075304714
+捣药 11.8212361103
+类喀斯特 13.2075304714
+石瀑 12.1089181827
+私下里 9.18217878068
+几万头 13.2075304714
+温利 12.2912397395
+本垒 12.5143832909
+平英团 13.900677652
+郑州商品交易所 10.4041700905
+燕青拖 12.8020653633
+熊眼 13.2075304714
+术语 8.31342899358
+违反纪律 12.2912397395
+针线 9.20932976975
+以销定产 11.4157710022
+不得要领 10.5684731418
+至亲至爱 12.2912397395
+微小 8.18364995057
+交心 11.2616203224
+浩如烟海 12.2912397395
+库尔淖 13.2075304714
+夕晖 13.900677652
+中国东方航空 11.8212361103
+不亚于 8.81308131674
+尉氏乃 13.2075304714
+刘舜仁 11.2616203224
+无恙 10.2371160058
+几千个 10.3171587135
+刘长春 11.8212361103
+增韧剂 13.2075304714
+平畴沃野 13.900677652
+弥补 7.52225146832
+莫伊 11.5027823792
+梁军见 13.900677652
+几千两 11.8212361103
+无妄之灾 12.1089181827
+情话绵绵 13.2075304714
+疏于防范 12.1089181827
+种帅 11.0674643079
+光心 13.900677652
+桥架 12.2912397395
+针织 9.55687223012
+香蕉苹果 12.2912397395
+市议会 11.7034530746
+甜头 9.5062284973
+赔情 11.8212361103
+成块 11.598092559
+本埠 12.8020653633
+特鲁多 12.8020653633
+插枝 12.8020653633
+曲折前进 13.2075304714
+石灰 8.4801426527
+尼亚桥 12.8020653633
+几千万 9.66657114738
+交往 7.32839510928
+刮起来 11.8212361103
+第二十四集 12.1089181827
+沁水 10.3743171274
+袁枢 11.2616203224
+凤毛麟角 10.6818018271
+一百零五岁 13.900677652
+逃脱 8.19689517732
+战斗轰炸 13.2075304714
+多指令 13.900677652
+抗酸 11.2616203224
+橡皮图章 13.900677652
+陪臣 10.9049453784
+伊卡萨 13.2075304714
+财贸办 13.2075304714
+防氧化 13.2075304714
+时鲁国 12.8020653633
+辅助线 11.8212361103
+脚踏式 12.8020653633
+鸡虫得失 13.2075304714
+桥板 11.9547675029
+插条 11.5027823792
+每一秒 12.1089181827
+六英寸 13.900677652
+本土 7.5273578624
+尚湖 12.1089181827
+反间计 10.6818018271
+法制工作委员会 13.900677652
+莫信 11.7034530746
+光强 10.1394775363
+淋巴腺 11.9547675029
+释菜礼 12.8020653633
+童仆 12.5143832909
+李揆 13.900677652
+烂烂 12.5143832909
+从容不迫 9.7898037878
+石炮 13.2075304714
+本地 7.42678695562
+成型 8.53938548627
+德尔夫 12.5143832909
+本场 10.533381822
+沙真 11.598092559
+遮风避雨 12.8020653633
+桥本 11.9547675029
+几千亩 12.5143832909
+虹吸 11.3357282945
+争相 8.75901409547
+滇池 9.66657114738
+贵州省安顺地区 12.1089181827
+几千人 9.7898037878
+石烈 13.2075304714
+沙漠化 10.3743171274
+万兰特 13.900677652
+藏密 13.900677652
+王铸剑 12.8020653633
+布大怒 11.9547675029
+巫神 12.5143832909
+维克托 11.0674643079
+畸型 11.7034530746
+刚过去 10.9049453784
+一百六十六公里 13.2075304714
+看病难 10.9049453784
+坐视不管 11.0103058941
+唱工 12.2912397395
+钟会攻 12.5143832909
+犯上作乱 10.8561552143
+厚德载物 12.8020653633
+光彩 8.170577869
+沁河 10.533381822
+监牢 10.8561552143
+麻花钻 13.2075304714
+各院 11.9547675029
+罗宾汉 12.2912397395
+成城 11.1280889297
+英文稿 12.8020653633
+话单 13.900677652
+超低 9.49395840471
+茅家岭 12.8020653633
+溶度 13.2075304714
+电阻损耗 13.2075304714
+传习录 12.2912397395
+珀塞尔 12.8020653633
+六百九十匹 13.2075304714
+淫佚 13.900677652
+左安门 12.8020653633
+耶律辉 13.2075304714
+和塔娜 11.8212361103
+静电学 11.4157710022
+中共中央统战部 12.8020653633
+闻将军 11.3357282945
+泰国人妖 13.900677652
+小拉曼 13.900677652
+谷深崖 13.2075304714
+李恂 12.2912397395
+维尔帕夏 12.8020653633
+工作频率 10.6818018271
+破冰 10.0505300503
+敏感区 11.9547675029
+三权分立 9.74179456862
+浮图 11.4157710022
+郭二 13.2075304714
+李恒 11.5027823792
+严格训练 11.1280889297
+粪桶 12.2912397395
+成名 8.83808261895
+主观能动 12.2912397395
+转账 9.46986085313
+棉籽壳 12.1089181827
+清除率 11.9547675029
+如在 12.1089181827
+鼻青脸肿 11.1280889297
+纵横有序 13.2075304714
+亚得里亚 11.5027823792
+杨文岳 9.12999302751
+制造厂商 11.9547675029
+成命 12.8020653633
+相习成风 13.900677652
+李总 12.5143832909
+十三手 13.2075304714
+插播 12.1089181827
+十三所 12.5143832909
+皮尔巴 12.5143832909
+破击 11.598092559
+处理完毕 10.4349417492
+李怀 11.0103058941
+成员 6.15784169655
+善加利用 12.2912397395
+克罗地亚 9.65218240993
+温克 13.900677652
+多情善感 12.5143832909
+三四年 9.75754292558
+机修钳工 12.2912397395
+庄客李 13.900677652
+特鲁威 12.2912397395
+线性方程 12.2912397395
+预言性 13.900677652
+反日 10.604840786
+塔楼 10.3743171274
+结业证 13.900677652
+杨所修 13.900677652
+齐奥尔科夫斯基 11.3357282945
+尚浅 11.598092559
+狐狸 8.73019365694
+本名 9.03314320152
+凤鸣 10.8096351986
+雁序 13.900677652
+预先判断 13.900677652
+石玉 12.8020653633
+沈丁立 13.2075304714
+埃法特 13.900677652
+超俗 13.2075304714
+僵持 9.13850371718
+散文诗 10.642581114
+油画家 10.8096351986
+党务工作 12.1089181827
+哈基姆 12.5143832909
+第八版 12.8020653633
+富子壮 13.2075304714
+核球 13.2075304714
+五节课 13.900677652
+综合治理 8.88339781516
+网络地址 13.2075304714
+古乐 11.1926274509
+石环 11.2616203224
+农牧渔业 11.4157710022
+狂为乱道 13.900677652
+麦克雷 12.5143832909
+乘法表 12.8020653633
+欢乐气氛 11.3357282945
+松松地 11.0103058941
+合金 8.03420959504
+于答儿 12.8020653633
+检正 13.2075304714
+保护网 10.9562386728
+艺术界 10.604840786
+交尾 10.4041700905
+蒙古族人 12.5143832909
+债权债务 9.93038573842
+化脓 10.0088573539
+横起 12.5143832909
+时代化 12.8020653633
+两三缕 13.900677652
+硕健 13.2075304714
+国防部 8.2985588311
+磨不开 12.8020653633
+甚笃 11.0674643079
+喘气 8.91707103027
+集体工 12.8020653633
+周转期 12.1089181827
+何济 12.8020653633
+挫败 8.9102450652
+光山 11.0103058941
+三媒六证 12.1089181827
+破关 12.8020653633
+本周 5.83572676023
+温凉 9.7898037878
+转轮手枪 11.1926274509
+白道川 12.8020653633
+成品 8.71889410168
+李悝 10.2630914922
+肌质网 13.2075304714
+本命 11.8212361103
+张康 13.900677652
+交差 10.8096351986
+警觉到 13.900677652
+超乎 9.5062284973
+薛李 13.2075304714
+阿本德 12.8020653633
+交工 12.5143832909
+李慧 11.0103058941
+二时 11.4157710022
+永济渠 10.1630080337
+消费观念 10.6818018271
+金属电极 12.1089181827
+捣腾 11.5027823792
+气缸盖 12.8020653633
+勃然大怒 9.56994431169
+逃荒 8.84443184663
+排烟口 13.900677652
+如数家珍 10.5684731418
+槽内 11.0103058941
+四逆汤 12.2912397395
+内乱外患 12.8020653633
+靠椅 10.9049453784
+西汉时 8.90346537821
+四明山 10.4994802703
+陆封型 11.9547675029
+流水地貌 12.2912397395
+必要措施 10.8561552143
+持节 9.80633308975
+李大现 13.900677652
+敌不过 10.4666904475
+石牛 11.598092559
+罗山 9.4233408375
+狐猴 11.1926274509
+褐红色 11.5027823792
+访谈法 13.900677652
+择席 13.2075304714
+自动扶梯 11.4157710022
+螺口 13.2075304714
+石版 11.3357282945
+石牌 11.0674643079
+西汉文 13.900677652
+李之藻 11.598092559
+布吕克 12.2912397395
+满者伯 13.2075304714
+南欧国家 12.2912397395
+化肥 7.63158136827
+李意 12.8020653633
+黄色 7.32142643997
+鼻梁儿 12.5143832909
+水晶体 11.7034530746
+平装书 13.900677652
+化育 12.5143832909
+唐府改 13.2075304714
+亚历山德罗 13.900677652
+艺术瓷 12.2912397395
+石牢 12.2912397395
+根本原因 8.37124856446
+幕间休息 13.900677652
+尚河 12.8020653633
+亲力亲为 11.9547675029
+未卜先知 11.4157710022
+追记 12.1089181827
+出出 10.7226238216
+莱菔子 12.8020653633
+排卵 9.44633035572
+左转成 13.900677652
+和林格尔县 12.8020653633
+明因监 13.2075304714
+讲错 11.4157710022
+不如意事常八九 13.900677652
+十三排 13.2075304714
+武之人 13.900677652
+为国出力 13.2075304714
+大悲咒 13.2075304714
+塔桥 12.2912397395
+沈增植 13.900677652
+核电 8.20023407859
+斯米顿 13.2075304714
+石状 12.1089181827
+鞭虫 12.5143832909
+疳积 11.3357282945
+芦盐运 13.2075304714
+算求 13.2075304714
+男舞者 13.900677652
+凤毛鸡胆 13.900677652
+基层社 11.4157710022
+心内膜 11.7034530746
+魏巍正 12.8020653633
+塔格 10.533381822
+大家伙儿 12.5143832909
+粗眉大眼 13.2075304714
+无词歌 12.2912397395
+木里苔 12.5143832909
+由布政 13.2075304714
+沁源 9.65218240993
+元明清 10.3171587135
+勒穆瓦纳 13.2075304714
+浮土 11.3357282945
+尚气 12.8020653633
+不吭一声 10.8561552143
+方孝孺 11.7034530746
+各向异性 9.93038573842
+薛蟠自 12.1089181827
+酸中毒 9.6811699468
+浮在 9.96885201925
+鼻子走 12.1089181827
+褒奖 9.71102290995
+阿舍尔 13.2075304714
+华州司 12.8020653633
+超产 12.8020653633
+鲁颂 11.9547675029
+二两米 13.900677652
+石狮 10.3743171274
+超人 9.80633308975
+今幸 10.6818018271
+一两尺 13.900677652
+博韦区 12.8020653633
+郑铉 12.8020653633
+查票 13.2075304714
+鲁伍马 13.900677652
+鸟龙 12.2912397395
+破得 10.9562386728
+华融 10.5684731418
+三四倍 12.2912397395
+塔柱 11.598092559
+孙文便 13.900677652
+李湾 13.2075304714
+抹下去 13.900677652
+泌乳期 12.2912397395
+暹罗猫 13.900677652
+寇家 11.5027823792
+甜味 9.58318953844
+合作部 12.5143832909
+吕公著 12.2912397395
+晚近 11.1926274509
+李湘 13.2075304714
+李湛 13.2075304714
+基奥 11.4157710022
+加法器 11.5027823792
+耿通 13.900677652
+秋梨 13.2075304714
+白费心机 12.2912397395
+门庭冷落 11.9547675029
+塔架 10.9562386728
+李渡 12.8020653633
+挑幺挑六 13.900677652
+泥浆泵 12.8020653633
+交加 10.0294766411
+封琼英 13.2075304714
+主动脉弓 11.9547675029
+月历 12.8020653633
+缩回去 10.642581114
+掌令官 12.8020653633
+拱手让出 12.5143832909
+纪晓岚 12.2912397395
+胰胆管 12.5143832909
+籍为兵 13.2075304714
+李渊 9.93038573842
+全义 12.1089181827
+明永乐 9.37888907493
+类比 9.61021821083
+成婚 9.77354326693
+塔林 10.765183436
+不自量力 10.9562386728
+宾客盈门 13.2075304714
+李清 11.9547675029
+交办 10.604840786
+繁殖期 9.82314020807
+成婆 12.2912397395
+沃尔夫冈 11.0103058941
+提供数据 11.598092559
+李渔 11.1280889297
+电致发光 11.8212361103
+肯做 11.0103058941
+厚大 12.2912397395
+入海流 13.2075304714
+温德 12.5143832909
+斯罗 13.900677652
+解其索 13.2075304714
+籍定样 13.2075304714
+尼龙网 13.900677652
+宰辅 9.91169360541
+下部结构 12.5143832909
+腼颜事仇 13.900677652
+垫付 9.98865464655
+交割 8.22050504296
+破开 10.7226238216
+矛尖 11.7034530746
+光刻 11.8212361103
+不堪入耳 11.9547675029
+郄门 13.900677652
+叶林 12.8020653633
+永仁县 13.900677652
+傣历 11.5027823792
+顾客群 12.2912397395
+排列成 9.58318953844
+油溶性 13.2075304714
+卖炭翁 13.900677652
+居功自傲 11.9547675029
+紧促 13.2075304714
+酸盐 11.1280889297
+两性关系 10.9562386728
+彰武县 12.8020653633
+生造 12.2912397395
+嘧啶 10.5684731418
+史界喻 13.2075304714
+嗡嗡响 11.0674643079
+第四十七 11.9547675029
+严要求 12.8020653633
+狐精 13.2075304714
+寇孚 13.900677652
+花露水 11.598092559
+埃塞 13.2075304714
+埃利亚 12.5143832909
+泥浆池 13.900677652
+交到 9.12155415886
+埃塔 12.1089181827
+崩盘 9.98865464655
+张伯行 12.2912397395
+有种人 13.900677652
+嫣然而笑 12.8020653633
+铺地板 13.900677652
+于廷弼 13.2075304714
+胡汉民 10.3171587135
+许诸 12.8020653633
+佩鲁贾 12.2912397395
+荷兰东印度公司 11.8212361103
+西格尔 11.8212361103
+犀牛皮 13.900677652
+图片格式 13.2075304714
+覆盖住 11.3357282945
+诸豪 13.2075304714
+生产流程 10.7226238216
+刻赤 11.9547675029
+测探 13.2075304714
+围住 8.81308131674
+李潢 12.8020653633
+僻壤 12.5143832909
+姚一 13.900677652
+交口 11.2616203224
+交叠 10.4994802703
+和政县 13.900677652
+几年级 13.2075304714
+光压 11.9547675029
+条形 10.0940151622
+哈剌温 12.8020653633
+延边 10.3453295905
+牧羊座 12.8020653633
+魏收师 12.8020653633
+龙德宫 12.2912397395
+本官 9.32596667347
+温带 7.32839510928
+南京站 13.2075304714
+魏巍文 8.39941944143
+交叉 7.79811905736
+大别山 8.6803218269
+党专政 10.0294766411
+针状 9.61021821083
+赛金花 11.8212361103
+螯合滴定 13.900677652
+本家 9.5186510173
+交变 10.4349417492
+尼龙绳 11.7034530746
+温布 12.8020653633
+逃走 7.59989185731
+逃起 13.900677652
+弄不好 9.56994431169
+雁儿 12.5143832909
+反成 10.765183436
+杰弗里斯 11.8212361103
+本寂 13.2075304714
+现实感 11.8212361103
+诗癖 13.900677652
+桥段 11.1280889297
+纳维亚 13.900677652
+老李 8.57766767284
+蛀洞 13.2075304714
+万六 12.2912397395
+老村 12.5143832909
+库木吐拉 13.900677652
+龙灯 10.7226238216
+从今天起 9.65218240993
+解决目前 10.9049453784
+水龙带 12.5143832909
+化身 8.86372504956
+千龙 13.2075304714
+那陈九 13.2075304714
+蟠桃会 11.5027823792
+仇日 13.900677652
+百般刁难 13.2075304714
+中南海怀仁堂 12.8020653633
+十多人 11.598092559
+姚二 13.900677652
+十余遍 13.2075304714
+成家 9.36807815882
+法董源 11.4157710022
+水谷之 12.1089181827
+邯郸学步 11.9547675029
+陆伯 12.8020653633
+魏巍支 11.598092559
+从恭默 13.2075304714
+光化 10.642581114
+塔普 13.900677652
+怒目圆睁 11.7034530746
+石粉 12.2912397395
+交卸 11.9547675029
+追名逐利 11.4157710022
+成宪 12.2912397395
+交卷 11.3357282945
+逃跑 7.9526426628
+藤甲 12.2912397395
+破布 9.93038573842
+藤田 13.2075304714
+温度 6.29977519243
+小尉迟 12.1089181827
+破帽 13.2075304714
+平昌 12.8020653633
+成宗 10.604840786
+乍听之下 12.8020653633
+议而不决 12.8020653633
+结构调整 6.72671933222
+热门股 10.2117981979
+丛杂 11.5027823792
+新城疫 11.9547675029
+温床 10.4666904475
+下关市 11.8212361103
+仔细阅读 9.62401153296
+鸟鸣 10.642581114
+盖奥克 13.900677652
+光棍儿 12.8020653633
+忍一时 13.900677652
+经审查 10.765183436
+溶入 11.3357282945
+喊进 13.900677652
+汉冶萍 11.4157710022
+伊东 10.7226238216
+成对 9.75754292558
+埃奇 13.900677652
+本字 12.8020653633
+宜辛凉 12.2912397395
+刘整督 13.2075304714
+本子 9.04864738806
+光华 8.93783302172
+薛文龙 13.2075304714
+风扇皮带 13.900677652
+仇敌 10.1164880181
+大大小小 8.19689517732
+腌过 11.9547675029
+本季 10.2630914922
+尹子庚 13.2075304714
+山园 12.2912397395
+完肤 13.2075304714
+行方便 11.9547675029
+浮夸 11.1280889297
+宅心仁厚 12.8020653633
+横行天下 11.9547675029
+南寒带 13.2075304714
+女权主义者 12.8020653633
+老杨 9.12155415886
+亏耗 11.8212361103
+泥浆流 13.2075304714
+浮头 12.5143832909
+共同爱好 13.2075304714
+呼之即来 13.2075304714
+藤皮 13.900677652
+王岩叟 13.2075304714
+三四分 12.5143832909
+石缝 10.0505300503
+一议 11.5027823792
+踏雪寻梅 12.8020653633
+讲题 13.900677652
+总领事 10.9049453784
+鲜于 11.9547675029
+机智勇敢 11.7034530746
+保护率 11.598092559
+李汉 13.2075304714
+石缸 12.8020653633
+磷脂 10.2117981979
+八宝山 11.598092559
+首一间 13.900677652
+秉烛夜游 13.2075304714
+万寿塔 12.2912397395
+邢州龙 13.2075304714
+借记 13.900677652
+耐旱作物 12.1089181827
+方便面碗 13.900677652
+成堆 9.91169360541
+李汝 13.2075304714
+超敏反应 11.2616203224
+维季姆 13.2075304714
+汤山 11.7034530746
+波罗芬 13.900677652
+传传 13.900677652
+静电场 10.0294766411
+布莱斯 12.1089181827
+铜模 13.2075304714
+平泉县 12.5143832909
+傍人门户 13.900677652
+菁华 12.5143832909
+藤盾 13.900677652
+塔斯 12.1089181827
+借词 10.9562386728
+碱液 11.2616203224
+强酸 10.0294766411
+侵华日军南京大屠杀遇难同胞纪念馆 12.5143832909
+橘子 10.0940151622
+戴云 11.1280889297
+人世 8.64840422393
+张曼玉 11.9547675029
+失水 9.58318953844
+尽忠尽职 13.2075304714
+易通 13.900677652
+增为 9.93038573842
+随份子 13.900677652
+借读 13.2075304714
+西边雨 13.900677652
+核磁 11.8212361103
+桥梁 7.61096208107
+任重道远 10.5684731418
+德尔图 12.8020653633
+吴为则 12.5143832909
+郭主 13.2075304714
+冲锋衣 12.8020653633
+真味 12.2912397395
+诸宫 11.8212361103
+商曲辞 13.2075304714
+李注 13.900677652
+纺锭 12.1089181827
+传信 10.8561552143
+本堂 13.2075304714
+所取 10.533381822
+紫砂 10.2371160058
+纺锤 10.4666904475
+应以垣 13.900677652
+李波 11.2616203224
+扬善 12.2912397395
+寻宝 10.4994802703
+抓不住 10.0940151622
+螺帽 11.9547675029
+旷古 11.8212361103
+反手 9.48183704418
+表面张力 10.3171587135
+养儿育 12.1089181827
+冬雷震 13.900677652
+陈如 12.2912397395
+李泉 13.2075304714
+藏经阁 11.5027823792
+王洪文 11.2616203224
+电力部 11.4157710022
+性侵犯 12.8020653633
+斯兰教 11.8212361103
+越冬作物 11.3357282945
+项少龙 13.900677652
+四十分钟 11.9547675029
+投票箱 12.5143832909
+克列蒙 11.9547675029
+罗曼科 13.900677652
+默认值 12.8020653633
+石群 13.2075304714
+待考 12.8020653633
+雁勇 13.900677652
+木拉山 12.5143832909
+领奖者 13.2075304714
+乐翻天 13.2075304714
+西房凉 13.2075304714
+一唱百和 13.900677652
+哈梅内伊 12.1089181827
+李治 10.9049453784
+酆居镐 13.2075304714
+李沾 10.8096351986
+温差 8.55357012126
+一词 7.61841090508
+扑鼻而来 11.1280889297
+化贞 13.2075304714
+里程碑式 10.4994802703
+膜技术 12.5143832909
+增人 13.900677652
+南向东 12.8020653633
+插栓 13.2075304714
+三鲜汤 13.2075304714
+插标 13.900677652
+一第二部 12.8020653633
+诺贝尔物理学奖 9.49395840471
+相映红 12.2912397395
+石翠 13.900677652
+于锋镝 13.2075304714
+增产 8.6966709649
+埃宋 13.900677652
+传习 10.3453295905
+针炙 12.2912397395
+传书 12.2912397395
+埃克霍夫 13.2075304714
+瓦莱 11.8212361103
+药王庙 11.5027823792
+插槽 11.7034530746
+卡布斯 12.1089181827
+强逼 10.9562386728
+抽头 11.5027823792
+万吨级 8.65893063692
+交出 8.53938548627
+成大 9.98865464655
+雁北 10.533381822
+洪都航空 10.0505300503
+大麻碱 12.8020653633
+急管繁弦 13.900677652
+成天 9.37888907493
+李海 12.1089181827
+扯上来 12.5143832909
+有向图 12.2912397395
+借到 10.6818018271
+李济 11.2616203224
+应时当令 13.900677652
+波斯语 9.61021821083
+脓血 10.3171587135
+三四千 10.533381822
+几层 9.74179456862
+三四十 10.0505300503
+悉尼歌剧院 11.7034530746
+孔灵芝 13.900677652
+一半多 11.4157710022
+藕花 13.2075304714
+拉丁文 8.81308131674
+库埃卡 13.2075304714
+助威团 12.8020653633
+弹坑 10.3171587135
+税赋 10.4349417492
+本姓 10.1630080337
+传为 9.55687223012
+传主 11.0674643079
+李洵 12.8020653633
+海群生 12.1089181827
+黄瓦东 13.900677652
+模范带头 12.8020653633
+荀况诸 12.8020653633
+成套 9.35738286971
+联通公司 12.5143832909
+传上 11.7034530746
+李洁 13.900677652
+喊起 10.3453295905
+偏流 12.5143832909
+张永祺 11.3357282945
+虎眼石 13.900677652
+李洛 12.8020653633
+传世 7.73525979774
+巨木盆 13.2075304714
+酸甜 11.2616203224
+引水员 13.900677652
+弧菌 11.1926274509
+餐桌上 9.91169360541
+赖兴巴 11.8212361103
+传代 11.7034530746
+磷肥 9.77354326693
+尽全力 10.2117981979
+传令 8.01735526349
+绑架 8.64840422393
+雌狮 13.2075304714
+入阁 9.32596667347
+强邦 13.900677652
+交入 13.900677652
+逃过 9.80633308975
+杳无音信 11.1280889297
+逃进 10.0505300503
+逐臭之夫 13.900677652
+温岭 12.1089181827
+强邻 11.4157710022
+浮子 11.8212361103
+李淳 12.8020653633
+本多 13.900677652
+激变 11.0674643079
+代理律师 10.0505300503
+修习止 13.2075304714
+震天动地 10.4666904475
+真相大白 10.2897597393
+石纹 13.2075304714
+温岚 11.1280889297
+全麦 10.9049453784
+霍兰德 13.900677652
+踵趾相接 13.900677652
+酸痛 9.25628675283
+敏感度 9.93038573842
+甲子日 11.3357282945
+溶化 9.75754292558
+执勤点 13.2075304714
+李淑 11.8212361103
+食货志 10.8096351986
+竹制 10.8096351986
+石级 11.8212361103
+洒红节 12.8020653633
+王明明 13.2075304714
+律动 11.598092559
+中国保护消费者基金会 13.900677652
+谙练 12.1089181827
+崇福寺 12.5143832909
+熊科 12.5143832909
+李润 12.8020653633
+玉泉寺 11.2616203224
+光光 10.1164880181
+似有若无 11.0674643079
+石经 9.96885201925
+酸疼 10.642581114
+仇杀 11.0674643079
+里奥 10.0505300503
+马三卫 11.8212361103
+闻鸡起舞 11.8212361103
+温峤 10.9049453784
+投票站 11.7034530746
+三四口 13.2075304714
+平面波 12.5143832909
+针灸 9.07236391467
+石绿 11.9547675029
+三四句 13.2075304714
+报之以李 12.5143832909
+三四只 11.598092559
+二手房屋 13.2075304714
+人才队伍 10.2371160058
+和卓之 10.604840786
+石绵 13.900677652
+修理业 13.2075304714
+春回大地 11.7034530746
+虎王 11.9547675029
+李涛 11.3357282945
+疳疮 13.900677652
+店铺 8.34771806705
+脱得 9.94943393339
+己所不欲 12.1089181827
+人工授精 10.5684731418
+伏侍姐姐 13.900677652
+高于 6.03165827548
+高二 10.2371160058
+乱点鸳鸯 13.900677652
+米歇尔 10.7226238216
+艺术美 11.9547675029
+本店 12.2912397395
+本应 9.08039608637
+远投 13.2075304714
+西洋式 13.900677652
+鱼死网破 11.0674643079
+战速胜 12.5143832909
+高云 10.2371160058
+乌斯宾 13.2075304714
+省力 9.89334446674
+交困 12.8020653633
+高井 13.900677652
+元明时 11.4157710022
+本座 13.2075304714
+按劳取酬 13.2075304714
+团团转 10.0505300503
+高亮 11.2616203224
+扶贫办 13.2075304714
+张御座 13.900677652
+高亢 9.21854642485
+三六九日 12.8020653633
+埃斯特 12.2912397395
+强震 11.2616203224
+徐应元 13.900677652
+高产 8.78868986362
+成帝 10.2371160058
+高人 9.15574552361
+曾五典 12.8020653633
+人工授粉 11.9547675029
+周遇吉 12.2912397395
+丘雷姆 13.2075304714
+凤钗 12.8020653633
+可资利用 11.8212361103
+写真集 13.900677652
+面黄 11.5027823792
+马兜铃 11.5027823792
+海外学人 13.900677652
+玉泉山 10.604840786
+新的一页 10.9049453784
+英国皇家空军 10.8561552143
+既有今日 13.2075304714
+航站楼 10.6818018271
+石祗 12.2912397395
+石祖 13.2075304714
+宝贝心肝 13.2075304714
+向家坝 12.2912397395
+渗滤 13.900677652
+画图纸 13.900677652
+巴涅尔 12.5143832909
+坝段 11.8212361103
+浮岩 12.8020653633
+仲敦巴 13.900677652
+靠手 12.1089181827
+目录索引 13.900677652
+上银幕 10.765183436
+直捣 10.1630080337
+阿扎尼亚 12.2912397395
+黑瞎子 11.5027823792
+壬辰 11.5027823792
+光团 13.2075304714
+港澳 8.87023973058
+高价 7.54630761118
+抢眼 8.27666014579
+高下 9.18217878068
+本帅 11.2616203224
+成康 11.8212361103
+温宿 11.0103058941
+南疆 9.0884932966
+形相 12.5143832909
+高一 9.49395840471
+巴拉 9.91169360541
+称霸世界 11.1926274509
+本师 10.9049453784
+温家 11.3357282945
+本帖 12.8020653633
+完全叶 13.900677652
+高丘 10.6818018271
+不同流俗 11.9547675029
+垫出来 13.900677652
+高专 11.7034530746
+开发进度 12.1089181827
+靠左 11.598092559
+温室 7.77599426108
+埃尔 9.59661255877
+高个 10.2117981979
+精神衰弱 13.2075304714
+离校 10.642581114
+针眼 10.8561552143
+高中 8.1641053545
+借贷 8.25523075433
+辉铜矿 11.4157710022
+酉阳 11.5027823792
+叶座 12.8020653633
+一九三四年 12.8020653633
+桑给巴尔革命政府 13.900677652
+雄心万丈 12.8020653633
+回火 10.9049453784
+菲尼克斯 11.1280889297
+头足倒置 13.900677652
+精神分裂 12.1089181827
+浮山 11.1926274509
+孺子 10.9049453784
+新闻媒体 9.74179456862
+靠拢 8.55834340001
+乌斯季 11.7034530746
+五百零九万两 13.2075304714
+高义 11.9547675029
+尚有 7.1060910711
+有此一说 13.2075304714
+强韧 11.1280889297
+雅各布森 13.2075304714
+安托万 11.8212361103
+浮尘 11.9547675029
+科希斯 12.8020653633
+熊绎 11.9547675029
+国大代表 12.1089181827
+火山爆发 9.66657114738
+视觉暂留 13.900677652
+高乐 12.5143832909
+石秀 8.65893063692
+高乔 13.900677652
+强音 12.8020653633
+锅中 11.0103058941
+栗栗自危 12.2912397395
+人民民主党 11.4157710022
+手足失措 11.8212361103
+小青岛 12.2912397395
+尚未 5.95017521717
+温寒 12.5143832909
+车轮战 13.900677652
+美国伊利诺大学 12.5143832909
+借走 12.1089181827
+浮尸 10.4994802703
+光器 12.8020653633
+本年 10.2897597393
+伊万 9.01787572939
+过度生长 12.5143832909
+仇恨 8.18364995057
+破釜沉舟 10.0294766411
+石砚 10.8561552143
+青铜时代 9.46986085313
+大凉山 10.8561552143
+畸形 7.96578345636
+热浪滚滚 12.2912397395
+饶有风趣 13.900677652
+纪和志 12.2912397395
+在京举行 10.4041700905
+表面光洁 11.8212361103
+三百八十七万四千七百多顷 13.2075304714
+任若恩 11.9547675029
+石砌 9.98865464655
+填隙 12.2912397395
+罩盖 12.1089181827
+圆珠笔芯 12.5143832909
+交城 12.5143832909
+胡景翼 12.8020653633
+历史使命 9.59661255877
+合集 10.4666904475
+四五十元 13.2075304714
+李歆 11.8212361103
+月租费 13.2075304714
+本德 12.5143832909
+陆侃如 13.2075304714
+强队 11.4157710022
+卡蒂普南 12.2912397395
+特鲁克 12.5143832909
+塔拉 10.1630080337
+发表意见 9.69598503258
+吴越国 11.1926274509
+云系 12.8020653633
+温娇 12.8020653633
+丹根 9.33632946051
+烦乱 9.85762638414
+针盘 11.9547675029
+本心 10.1630080337
+季历终 13.2075304714
+皆宜 10.9049453784
+怀疑论 10.8561552143
+普遍存在 8.63798746307
+菌核 11.9547675029
+煤矿工 13.900677652
+成形 8.87023973058
+考核组 11.1926274509
+天露明 12.5143832909
+疑案 10.9049453784
+磷虾 10.765183436
+归去来 12.2912397395
+石础 12.8020653633
+十年教训 12.5143832909
+巩膜 10.8096351986
+韦罗 13.2075304714
+方兆本 12.2912397395
+梁天监 11.2616203224
+一字褒贬 13.900677652
+温婉 10.6818018271
+马福益 13.900677652
+雨散云收 13.900677652
+花路 13.900677652
+戴上 8.48903160012
+中共中央东北局 11.7034530746
+鲜丽 11.0103058941
+西电东 11.598092559
+压不住 10.5684731418
+李福守 13.2075304714
+烦人 10.604840786
+银生节 12.5143832909
+武胜军 12.5143832909
+网络盗版 12.8020653633
+肌酸激酶 13.2075304714
+纯红 12.8020653633
+高会 11.2616203224
+光圈 10.765183436
+布吕宁 12.8020653633
+生锈 9.98865464655
+叶序 12.5143832909
+皮亚斯 12.5143832909
+挟持 9.74179456862
+过秦论 11.5027823792
+倾斜仪 13.2075304714
+尝新 11.4157710022
+共同点 9.5186510173
+中共二大 12.2912397395
+沿用至今 9.12999302751
+格尔塔纳 13.900677652
+李毅 11.598092559
+石碴 13.900677652
+港湾 8.44109213783
+方孝儒 13.2075304714
+石碣 10.0088573539
+高估 8.77671367257
+烦事 13.2075304714
+若隐若现 10.2630914922
+商会会长 10.2897597393
+凉山彝族自治州 10.604840786
+党孙文 13.900677652
+石磙 10.765183436
+曾母暗沙 10.765183436
+高低 7.25688791883
+求告无门 12.8020653633
+脑户 13.2075304714
+高位 6.45292637193
+盐渍化 10.1871055853
+石磊 11.3357282945
+汶水 11.8212361103
+本当 10.9049453784
+社会学所 13.2075304714
+光电子 9.93038573842
+一两张 12.8020653633
+生长 6.19541517711
+凶煞 12.8020653633
+析义 13.900677652
+南安普顿 12.8020653633
+王如言 13.900677652
+卜里斯 12.5143832909
+万叠 12.8020653633
+人命官司 12.1089181827
+少数几处 13.2075304714
+掏洞 12.8020653633
+尚显 11.5027823792
+石磨 10.2117981979
+可往 11.0103058941
+尉萧 13.2075304714
+本影 11.598092559
+企业宗旨 12.5143832909
+自驾游 10.3453295905
+剖白 11.598092559
+一街 10.8561552143
+未来 4.69063732501
+成就 6.49275332942
+鹿人 13.2075304714
+二十六七 13.900677652
+捣衣 12.8020653633
+小青年 10.9049453784
+五一眼 12.5143832909
+万寿山 10.2897597393
+李桥 11.8212361103
+李桦 12.8020653633
+石笋 10.2371160058
+左拥右抱 12.5143832909
+天香楼 11.1280889297
+女性内衣 13.900677652
+本岛 9.32596667347
+王永志 13.2075304714
+佛罗里达 10.0088573539
+伊丹 12.8020653633
+化解 7.70016847793
+四逆散 12.8020653633
+拉进来 12.5143832909
+五冬六夏 12.8020653633
+陈太尉 11.2616203224
+车行道 10.6818018271
+惠宁王 13.2075304714
+名誉会员 10.4666904475
+德尔加 12.5143832909
+仇报 12.2912397395
+关琴 13.900677652
+光敏剂 13.900677652
+宁折不弯 11.8212361103
+冷凝物 13.900677652
+成山 9.75754292558
+说了半天 10.4349417492
+导出 8.83177344976
+石筑 11.9547675029
+尚文 12.1089181827
+情文并茂 13.2075304714
+小住 11.598092559
+表演艺术 9.5062284973
+硕壮 12.8020653633
+羽翼丰满 12.8020653633
+借过 10.9562386728
+安享天年 13.900677652
+谨言慎行 11.1280889297
+托拉查 12.5143832909
+迪拉姆 11.9547675029
+凤雏 10.8561552143
+搅海翻江 12.1089181827
+李栋 12.2912397395
+居浩罕 12.8020653633
+熊类 11.7034530746
+山垭 12.5143832909
+灵丹妙药 10.2371160058
+鹿仔 10.4041700905
+项庄舞剑 11.7034530746
+义正严词 12.8020653633
+李标 13.900677652
+袁宗第 8.30596627237
+英文版 10.2630914922
+水龙头 9.96885201925
+李树 11.8212361103
+核糖 11.4157710022
+绑扎 10.765183436
+五屉柜 13.2075304714
+法赫德 13.2075304714
+善后处理 12.1089181827
+甜味素 13.900677652
+天籁般 13.2075304714
+光向 12.8020653633
+越野性 11.7034530746
+兴义 10.765183436
+宫刊本 13.2075304714
+满目 10.1394775363
+鬃毛 10.3171587135
+光合 9.62401153296
+两亿八千八百二十二万两 13.2075304714
+丝绸业 11.598092559
+温妮 13.900677652
+逞妍斗色 13.900677652
+梅圣俞 12.5143832909
+破处 12.5143832909
+成岩 10.0720362555
+凤阳 9.17328983326
+粟裕任 12.5143832909
+王衍亦 13.2075304714
+余婆婆 13.900677652
+锅里煮 10.765183436
+工作记忆 13.900677652
+富拉语 13.900677652
+魏巍戈 12.5143832909
+凤阁 11.1926274509
+监测中心 10.604840786
+顶背离 11.5027823792
+清晰可见 10.0088573539
+江苏省委 11.9547675029
+光启 10.9049453784
+挟怨 13.900677652
+港海 13.2075304714
+满盘 11.1280889297
+本尼 12.8020653633
+断肠草 11.7034530746
+史记 8.11071748108
+本局 13.900677652
+早安排 12.8020653633
+浸润 9.32596667347
+术者 11.3357282945
+本届 7.4191005227
+牧羊女 13.2075304714
+刚背 13.900677652
+必争 11.0674643079
+吉洪诺夫 13.2075304714
+深赤湾 11.8212361103
+白髯老者 12.2912397395
+巴卢其 13.900677652
+惠特尔 13.2075304714
+三四回 12.1089181827
+心灰意冷 10.3453295905
+欲念 10.8096351986
+藤牌 10.8561552143
+僵死 10.8096351986
+疯涨 9.40086798165
+拆下来 10.642581114
+西汉水 11.8212361103
+东道主 9.98865464655
+龙光电 12.8020653633
+美国电报电话公司 13.2075304714
+惠特尼 10.9049453784
+本山 10.3453295905
+管治河 12.8020653633
+借车 11.598092559
+继往开来 11.2616203224
+何氏语 13.900677652
+耿长锁 11.8212361103
+化装 10.0088573539
+萧然 11.3357282945
+李楠 11.8212361103
+尖兵 11.8212361103
+趋利避害 10.8096351986
+切身利益 9.48183704418
+特纳雄 12.8020653633
+诸臣皆 13.900677652
+安全系数 10.5684731418
+适应度 12.1089181827
+宣告无效 13.2075304714
+集疏运 11.1280889297
+周显王 12.2912397395
+副庭长 11.7034530746
+损耗率 13.900677652
+押起来 12.8020653633
+满着 13.900677652
+十三款 12.5143832909
+埃微 13.900677652
+先进设备 11.5027823792
+塞文河 13.2075304714
+安圭拉 11.8212361103
+胸怀坦荡 12.5143832909
+好事者 10.6818018271
+基础性 8.59240995457
+贝恩哈 11.9547675029
+同名同姓 9.87532596124
+红袖章 11.598092559
+而无须 11.1926274509
+送呈 10.4349417492
+埃德 11.5027823792
+上访信 13.2075304714
+皮亚杰 11.4157710022
+直拨 12.2912397395
+攻克难关 13.900677652
+毛毛糙糙 12.8020653633
+车尔尼 12.2912397395
+失道寡助 13.2075304714
+蹑脚蹑手 12.8020653633
+李椿 13.900677652
+本州 9.02548032877
+预备班 11.7034530746
+满眼 9.41204128224
+破壁 11.7034530746
+温塘 12.1089181827
+女主持 12.8020653633
+李植 10.0940151622
+正多面体 13.2075304714
+阿巴拉契亚 10.2630914922
+希丁克 13.900677652
+萎缩性 11.3357282945
+亏蚀 11.7034530746
+向阿公 13.900677652
+阿鲁浑 11.7034530746
+本巴 13.900677652
+西本 10.8096351986
+合作无间 13.900677652
+十三步 13.2075304714
+混血美女 13.900677652
+莼菜 11.598092559
+稀有性 13.2075304714
+冷平流 12.1089181827
+布莱恩 11.8212361103
+石窟 8.16733637508
+港汊 10.4666904475
+核素 9.84023464143
+波罗蜜 10.3743171274
+四五十口 12.2912397395
+举国一致 12.5143832909
+罗曼系 13.900677652
+生霉 13.900677652
+彭桓武 13.2075304714
+振型 11.7034530746
+硕大 9.22784881751
+最前沿 10.7226238216
+帐钩 13.900677652
+鬼帅 12.2912397395
+总该能 13.900677652
+磨豆腐 11.8212361103
+港池 11.1280889297
+凤霞 13.900677652
+逃课 11.9547675029
+施为 10.7226238216
+波湾战争 13.2075304714
+交售 11.1926274509
+联邦调查局 12.2912397395
+康蒂妲 13.2075304714
+浮式 11.3357282945
+罗真人 11.0674643079
+西朝 13.900677652
+雁城 13.900677652
+涉笔成趣 13.2075304714
+大麻类 13.900677652
+西塘区 11.5027823792
+巡回演唱 12.5143832909
+静电力 10.2371160058
+花起 12.5143832909
+向后转走 13.2075304714
+老百姓 6.4747239949
+马牧集 11.1280889297
+嗡嗡叫 11.8212361103
+输理 13.900677652
+威海路 13.900677652
+史论 10.2371160058
+桥洞 10.4994802703
+巴罗克式 12.2912397395
+电脑网络 13.900677652
+演过 10.3171587135
+艺术类 10.0720362555
+遥控装置 12.2912397395
+金三角 11.5027823792
+满档 13.900677652
+偏瘫 10.7226238216
+鄱阳盆地 13.2075304714
+酸性岩 11.3357282945
+活性污泥 12.1089181827
+偏瘦 11.598092559
+谷梁传 11.0674643079
+泰米尔纳德邦 11.598092559
+肖形印 13.2075304714
+李白 9.07236391467
+左右两座 12.8020653633
+宋为国 13.2075304714
+北长山 13.900677652
+布劳威尔 12.1089181827
+马木留 11.8212361103
+冷凝水 12.5143832909
+杂拌儿 12.8020653633
+满桂 13.900677652
+东夷族 11.4157710022
+染上 9.23723855786
+上记明 12.8020653633
+满桌 10.9562386728
+混合油 13.900677652
+核战略 12.8020653633
+自作自受 10.4041700905
+米格尔 11.9547675029
+还款 8.68574189437
+木知木 12.8020653633
+童子 8.95903522937
+超女 11.7034530746
+老干部局 12.2912397395
+核拨 13.2075304714
+封为圣 13.2075304714
+传唤 9.98865464655
+上下一致 12.2912397395
+填词 10.3743171274
+东学党 11.7034530746
+借重 11.0674643079
+传唱 9.93038573842
+衮衮诸公 12.1089181827
+敕勒川 11.9547675029
+桀犬吠尧 13.900677652
+波斯邸 13.2075304714
+稻粒 12.8020653633
+维京群岛 13.900677652
+德维奇 13.900677652
+约尔 13.900677652
+那挺 12.2912397395
+解放军文艺 12.2912397395
+富家子弟 11.3357282945
+超大 9.41204128224
+多费唇舌 12.8020653633
+普雷斯顿 12.2912397395
+石敬 11.9547675029
+针毡 13.900677652
+从木梯 13.900677652
+特种部队 9.29550746599
+稻米 8.70772080109
+无座力炮 11.598092559
+石料 9.58318953844
+直抵 8.86372504956
+颈椎病 11.1280889297
+班布戈 13.2075304714
+石斑 11.8212361103
+屏声息气 13.900677652
+高分 10.4994802703
+目眦尽裂 13.900677652
+李相 10.765183436
+单身男女 12.1089181827
+断然处置 12.8020653633
+强记 12.1089181827
+俞作柏 13.900677652
+屡进屡退 13.900677652
+桥牌 10.6818018271
+石方 11.9547675029
+高利 10.3743171274
+秦自献 12.8020653633
+那颗星 12.1089181827
+标题音乐 11.7034530746
+塔罗 13.900677652
+南大洋 10.9562386728
+敲边鼓 12.2912397395
+花花 9.5186510173
+核战 12.8020653633
+轻装上阵 11.1280889297
+许寿裳 13.900677652
+一千刀 13.900677652
+屉子 12.1089181827
+可吸入 13.900677652
+崩溃 7.58170953823
+光学仪器 9.63799777493
+石斧 10.4349417492
+鼎镬 13.2075304714
+红筹股 10.5684731418
+弧顶 12.2912397395
+续湘军 13.2075304714
+马金保 13.2075304714
+纺车 9.96885201925
+借酒 11.598092559
+招结南 12.8020653633
+公孙胜扶 13.2075304714
+己未 13.900677652
+不良后果 10.4349417492
+冒险者 11.7034530746
+几千家 11.9547675029
+张园国会 12.8020653633
+辰溪县 13.900677652
+尚符 13.2075304714
+唐杨端 12.8020653633
+夜夜梦 12.2912397395
+蘑菇状 12.1089181827
+韦拉 12.2912397395
+褒义 12.8020653633
+六千多万 12.5143832909
+排出来 11.598092559
+漆好 13.900677652
+创新能力 8.69119149913
+张钰哲 11.9547675029
+韦挺 13.2075304714
+申耽 11.598092559
+凤亭 13.900677652
+太米叶 12.2912397395
+垫块 13.900677652
+高原 6.76101731601
+绑紧 12.8020653633
+季华路 13.900677652
+插班 13.900677652
+裴秀之 13.2075304714
+楼上楼下 10.3171587135
+传呼 9.5062284973
+讯息 10.2117981979
+山堡 11.598092559
+繁博 13.900677652
+候补委员 9.01787572939
+槽谷 10.1630080337
+传告 12.5143832909
+刘步尘 11.9547675029
+同文馆 10.533381822
+和少平 10.4041700905
+高县 12.5143832909
+崩漏 10.8561552143
+分析线 13.900677652
+芳龄 12.1089181827
+锅台 9.98865464655
+第一零五回 13.2075304714
+令人钦佩 12.1089181827
+张永祥 12.5143832909
+化隆 11.4157710022
+高参 11.4157710022
+勋绩 12.5143832909
+垫圈 11.4157710022
+塔纳 12.5143832909
+普沃克伦 13.900677652
+鸟蛋 10.2897597393
+衰减常数 13.900677652
+雌核 13.2075304714
+古佛 11.2616203224
+高叫 8.57766767284
+叶尔绍夫 13.2075304714
+作嫁衣裳 12.2912397395
+费斯 13.900677652
+磁盘控制器 12.8020653633
+每周日 13.2075304714
+注水方式 13.900677652
+小村子 11.5027823792
+向荣 12.2912397395
+高古 11.0674643079
+一切权利 10.8096351986
+花费 7.65263477747
+导入 9.69598503258
+高觉敷 12.8020653633
+单双面 13.900677652
+西原龟 12.5143832909
+额济纳 10.8096351986
+李重俊 12.2912397395
+醇醪 13.2075304714
+掉书袋 12.1089181827
+易读 11.598092559
+李矩 12.8020653633
+烦劳 11.5027823792
+国际电工委员会 11.9547675029
+港版 13.900677652
+港片 13.900677652
+祖离 13.2075304714
+锋芒不露 13.900677652
+正四面体 11.7034530746
+曼海姆 11.0674643079
+疯狂 6.70699183358
+家臣 10.4041700905
+愁眉苦脸 9.71102290995
+古诺尔 11.8212361103
+引水人 13.900677652
+卫生组织 12.8020653633
+吃饭问题 11.4157710022
+李石 11.5027823792
+攀折 12.8020653633
+公子纠 13.2075304714
+周惠久 13.2075304714
+坦桑尼亚 9.12155415886
+司问谳 13.2075304714
+隔舱板 13.2075304714
+雷维尔 13.2075304714
+大西军 11.8212361103
+龙鸣剑 13.2075304714
+寻死觅活 10.9049453784
+澄海市 13.2075304714
+哪像 10.642581114
+杨宗保 12.5143832909
+同玩 13.900677652
+超声 8.80081122415
+毛小妹 11.5027823792
+偏短 11.598092559
+武之士 13.2075304714
+高华 9.71102290995
+孩儿 7.97642185456
+月租金 10.6818018271
+易记 11.3357282945
+借道 10.0720362555
+高升 9.87532596124
+高博 13.2075304714
+一两半两 13.2075304714
+叶心 12.5143832909
+一上午 10.2897597393
+谢杏芳 12.8020653633
+股票交易 8.48903160012
+应采择 13.900677652
+高卖 12.1089181827
+外宽内深 13.900677652
+信陵公子 13.900677652
+闸口镇 11.1926274509
+始料不及 9.85762638414
+天柱峰 10.8096351986
+高卢 9.56994431169
+姓甚名谁 10.0940151622
+高卧 11.5027823792
+会面时 11.8212361103
+电子政务 9.7898037878
+鹿兆 12.1089181827
+高危 9.14708746087
+生物反馈 12.2912397395
+奇差 13.900677652
+偃月 10.604840786
+封张良 12.8020653633
+易耗品 12.8020653633
+参赛队 12.1089181827
+尚秀 13.900677652
+赵为御 12.8020653633
+哪儿 6.54951942555
+债务纠纷 10.765183436
+破颜一笑 12.5143832909
+凋败 13.900677652
+几度 9.23723855786
+超子 11.9547675029
+童女 11.3357282945
+布科维纳 12.2912397395
+鹿力 11.4157710022
+垭口 10.0940151622
+死不了 10.1871055853
+科希策 13.900677652
+辐射分解 12.5143832909
+蓬门 13.2075304714
+死老虎 11.7034530746
+李瑛 11.8212361103
+言强君 12.5143832909
+易行 11.7034530746
+高傲 9.74179456862
+七弦琴 11.598092559
+哈斯宝 12.5143832909
+郑成功 8.92394390956
+分组讨论 12.5143832909
+大理人 12.8020653633
+缝制成 12.8020653633
+四五十个 11.4157710022
+割须弃袍 12.8020653633
+石材 10.0294766411
+李琦 11.8212361103
+沈知方 13.900677652
+梁又封 12.8020653633
+李琼 13.2075304714
+济学 13.2075304714
+四百卷 13.2075304714
+韦恩 11.0103058941
+李琳 9.85762638414
+边学边 12.2912397395
+壸浆箪食 13.2075304714
+石板 8.67493097826
+石松 10.6818018271
+李琏 11.9547675029
+公诸于世 11.7034530746
+大气压力 10.9049453784
+老死不相往来 12.5143832909
+高僧 8.61241062128
+省图书馆 11.9547675029
+李琛 12.5143832909
+偃松 11.7034530746
+密电码 12.5143832909
+周转率 9.84023464143
+安息日 11.0674643079
+呈圆形 10.0088573539
+安于一隅 13.900677652
+彭修文 12.5143832909
+发慈悲 11.5027823792
+速凝剂 13.900677652
+公王岭 11.8212361103
+高倍 11.3357282945
+歪头 10.9562386728
+天宝初 11.5027823792
+铜梁 11.4157710022
+石林 9.29550746599
+秋江渔 12.8020653633
+讲者 13.2075304714
+生点 13.2075304714
+制度化 9.54396882529
+熹平 10.3453295905
+坛经 12.8020653633
+华东区 11.8212361103
+石构 11.9547675029
+各工种 13.2075304714
+活地狱 12.5143832909
+王象之 13.2075304714
+强要 11.1926274509
+超导 9.02548032877
+二人转 10.9562386728
+兔形目 12.2912397395
+非价格 12.8020653633
+凭靠 12.5143832909
+闽西 9.94943393339
+壬酸 13.900677652
+今日热点 12.5143832909
+绑绳 13.2075304714
+重踏 13.2075304714
+小争执 13.900677652
+石某 11.7034530746
+遨游四海 12.8020653633
+余庆 11.8212361103
+涂梢栽 11.9547675029
+找到啦 12.8020653633
+童妻 10.8096351986
+陈彦衡 12.2912397395
+塔索 11.8212361103
+角柱石 13.900677652
+硕士生 11.7034530746
+卫戌 13.900677652
+张野塘 13.2075304714
+石柱 8.63798746307
+紫荆山 8.85082164473
+反败为胜 11.1280889297
+高健 12.1089181827
+超宽 13.2075304714
+自斟自饮 11.5027823792
+李璜 13.2075304714
+逃难 8.56795885871
+麦克戴斯 13.900677652
+李璟 11.1280889297
+李璐 11.8212361103
+松本 11.9547675029
+秃山 12.8020653633
+南迁平 13.2075304714
+吞吞吐吐 8.95903522937
+化铁 12.8020653633
+高冈 11.7034530746
+呼呼地 9.98865464655
+姚合 11.3357282945
+化铅 13.2075304714
+莫奈 11.3357282945
+丝绸厂 12.8020653633
+轮番上阵 11.598092559
+高军 11.8212361103
+词锋 12.1089181827
+化铜 13.2075304714
+化铝 13.900677652
+系统日志 13.2075304714
+沙勒罗 13.900677652
+黔江 10.4666904475
+牵肠挂肚 10.765183436
+气动力 11.1926274509
+全民皆兵 12.8020653633
+信箱号码 13.900677652
+寻丹阳 13.900677652
+高冠 11.3357282945
+绑缚 9.93038573842
+酸浆 12.5143832909
+化铯 13.2075304714
+有志气 10.7226238216
+暑假 9.55687223012
+那顶蓝 13.2075304714
+生计 8.69119149913
+新金县 12.8020653633
+如意郎君 12.1089181827
+王国 6.92713463246
+高凉 11.7034530746
+士别三日 12.5143832909
+填装 12.5143832909
+石台县 12.8020653633
+石晋 13.2075304714
+有感于 10.8096351986
+海拉尔 10.604840786
+高凝 11.7034530746
+李申 12.5143832909
+韩城市 12.2912397395
+桌球 13.900677652
+强行 8.00352378434
+亲处 12.8020653633
+亿马克 11.0103058941
+莫大 9.12155415886
+俯仰角 11.5027823792
+一不注意 13.2075304714
+天象仪 12.1089181827
+莫夫 10.5684731418
+僵直 10.3171587135
+白浪伸 13.2075304714
+社会学系 9.96885201925
+高凤 12.1089181827
+高出 7.166085992
+滴油 13.900677652
+李生 13.2075304714
+十年一剑 12.5143832909
+刘亚辉 11.3357282945
+酸洗 10.9562386728
+太宗崇 13.2075304714
+刘宇亮 10.6818018271
+强袭 12.8020653633
+金玉之言 13.900677652
+按规定 8.20358416547
+积水潭 11.9547675029
+细高挑 12.5143832909
+修铁路 11.0674643079
+北四阁 13.2075304714
+金泰熙 12.5143832909
+水晶宫 10.2117981979
+萨尔州 12.8020653633
+童声 11.8212361103
+传国 11.598092559
+经年累月 11.598092559
+严大人 11.5027823792
+箭镞 10.6818018271
+割草机 11.8212361103
+艺术性 9.63799777493
+超巨星 10.765183436
+暑期班 13.900677652
+郑重其事 9.63799777493
+唐四杰 11.4157710022
+非政治化 12.8020653633
+工业原料 9.19114745066
+福烈帝 13.2075304714
+巴巴拉 12.1089181827
+乌姆赖 13.900677652
+外交政策 8.74162235276
+维特伯爵 12.8020653633
+易观 11.0674643079
+易见 12.5143832909
+和玛雅 12.5143832909
+传回 10.642581114
+莫如 10.765183436
+酸涩 10.6818018271
+苍翠欲滴 13.900677652
+医学杂志 11.9547675029
+两岸人民 12.2912397395
+面谢 13.900677652
+高元 12.1089181827
+原本会 12.5143832909
+奥斯威辛集中营 12.5143832909
+竺可桢 10.9049453784
+西曲 13.2075304714
+燕姬 13.900677652
+吴著 13.900677652
+牡丹皮 12.5143832909
+季诺维 11.4157710022
+酸液 12.1089181827
+林大椿 13.2075304714
+单曲 12.2912397395
+满殿 11.4157710022
+九千多 13.2075304714
+静态数据 13.900677652
+一万二千五百余 13.2075304714
+国际业余田径联合会 11.5027823792
+习惯用语 11.5027823792
+分子溶液 13.900677652
+曲垣 13.900677652
+教育局 8.95903522937
+唐册立 12.8020653633
+借鉴 7.70219893548
+宁武 10.9562386728
+放心不下 8.98802276624
+锅儿 12.2912397395
+随车携带 11.9547675029
+潘大人 12.8020653633
+树倒猢狲散 11.2616203224
+送秋波 13.2075304714
+兴亡 9.63799777493
+可达性 13.2075304714
+高兴 6.03779561733
+舆论哗然 10.9049453784
+视紫质 12.8020653633
+满池 12.2912397395
+私有制 8.6966709649
+抗老 12.1089181827
+传入 7.26080181815
+光云 12.1089181827
+逃遁 9.94943393339
+冲锋队 10.765183436
+交代 7.52565283215
+李牧 10.8561552143
+李特 11.5027823792
+硕士班 13.900677652
+原始动物 13.900677652
+闭关自守 10.5684731418
+黄铁矿 9.80633308975
+韦昭 12.1089181827
+尿囊酸 13.900677652
+燕帝 12.8020653633
+花都巴黎 13.900677652
+公私两便 13.900677652
+闲日 13.2075304714
+满汉 9.5186510173
+枪林弹雨 10.642581114
+通信协议 13.900677652
+阻燃性 13.900677652
+获益匪浅 11.0674643079
+想得起来 12.1089181827
+光亮 7.95787827685
+一票否决权 12.5143832909
+满江 11.8212361103
+约翰斯顿 11.7034530746
+爱恋着 12.8020653633
+填过 12.8020653633
+氮宾 13.2075304714
+四十一页 13.2075304714
+交交 12.1089181827
+龙须沟 11.5027823792
+击球员 12.1089181827
+万博 11.7034530746
+哲学观 12.8020653633
+老诚诚 13.2075304714
+抗联 11.2616203224
+交人 13.2075304714
+李爽 13.900677652
+庄客齐 13.2075304714
+鹿哨 12.5143832909
+明显降低 10.0720362555
+鹿哥 13.2075304714
+安邦治国 13.900677652
+李爷 13.2075304714
+交于 10.4994802703
+增值 7.60910851242
+有门儿 12.5143832909
+交予 12.2912397395
+叶山 12.8020653633
+交了 9.20932976975
+布代尔 13.2075304714
+大量美元 11.598092559
+科洛尔 13.900677652
+借问 11.2616203224
+逃逸 9.49395840471
+好美 13.900677652
+扶残助残 13.900677652
+科洛封 13.2075304714
+瞎得 12.8020653633
+交互 9.01787572939
+话儿 9.04864738806
+圪节 8.24468584116
+涂梢源 13.2075304714
+弦外之音 10.4666904475
+神岳琼 13.2075304714
+强辩 13.2075304714
+精力有限 11.9547675029
+斤头 13.2075304714
+光下 11.1926274509
+富林明 10.5684731418
+相善 11.8212361103
+自动闭塞 11.598092559
+传出 7.25949548224
+哈尔滨人 11.8212361103
+晁兄 12.2912397395
+鸡场 11.8212361103
+十三点 13.900677652
+膝盖骨 11.7034530746
+雷霆霹雳 13.900677652
+港督 13.900677652
+光临 9.45802639549
+童心 11.0103058941
+靠窗 10.604840786
+扩大招生 12.5143832909
+脑筋 9.38981814546
+李狗 13.900677652
+偏狭 11.5027823792
+节减 12.8020653633
+交个 11.2616203224
+元杂剧 9.71102290995
+强迫 7.72481038187
+霍利 11.8212361103
+教育学 9.84023464143
+卡乔夫 13.2075304714
+北京市人民政府 12.2912397395
+老方 11.1926274509
+粮食部 12.2912397395
+和少安 10.1871055853
+行行出状元 12.2912397395
+利用装置 13.2075304714
+月初 6.82571445401
+高原地区 10.0088573539
+十多斤 13.2075304714
+交上 10.0720362555
+交下 13.2075304714
+姚古 10.3453295905
+恢复名誉 10.604840786
+强过 11.2616203224
+监督机制 10.5684731418
+排头兵 10.5684731418
+尚缺 12.1089181827
+凌乱不堪 12.5143832909
+有旧 11.1926274509
+克莱斯勒公司 11.1280889297
+井井有条 10.1630080337
+范慧 12.8020653633
+瓦塔纳 13.900677652
+口水仗 13.2075304714
+杌陧 13.900677652
+曹仁自 12.8020653633
+乘兴而去 13.2075304714
+四人一组 13.900677652
+唠扯 13.900677652
+米泔水 13.900677652
+增光 11.0103058941
+明者 12.5143832909
+豪言壮语 10.642581114
+姚刚 8.34384959028
+高垒 12.2912397395
+童年 8.36334338496
+利蒙湾 13.2075304714
+可心 10.8561552143
+敢把皇帝拉下马 12.5143832909
+几千年 8.31342899358
+杜心武 13.2075304714
+私营部门 9.85762638414
+电灌站 11.598092559
+疯癫 10.5684731418
+好身材 11.4157710022
+腓力二世 10.4666904475
+增兵 9.26594866375
+孔波雷 13.2075304714
+电路设计 12.8020653633
+熊本 12.5143832909
+交保 13.900677652
+端砚 10.9049453784
+稻秆 12.5143832909
+核果 9.11318590919
+中国高科 12.5143832909
+一千二百万元 13.2075304714
+姚制 13.900677652
+生趣 11.9547675029
+四余度 12.5143832909
+稻种 11.8212361103
+解毒片 12.1089181827
+韦杰 10.4041700905
+勋章 8.40761620864
+高城 11.0103058941
+铅化物 13.900677652
+募得 10.765183436
+暹罗湾 12.5143832909
+傣乡 13.900677652
+台前幕后 13.2075304714
+核查 8.83808261895
+供热量 12.8020653633
+满洲 7.09495509856
+莫弗 11.8212361103
+绑票 11.3357282945
+约夫 11.4157710022
+马邑郡 12.8020653633
+元明粉 11.9547675029
+临界频率 12.1089181827
+保尔森 11.8212361103
+死马当活马医 13.900677652
+新闻频道 10.642581114
+鸟苷 11.7034530746
+布吕克纳 12.8020653633
+僧多粥少 10.8096351986
+锅垢 13.2075304714
+生路 9.55687223012
+破烂流丢 13.2075304714
+辛辣讽刺 12.8020653633
+光会 11.8212361103
+多万平方公里 11.3357282945
+梁晴喊 13.2075304714
+吴越之 11.7034530746
+私人占有制 13.2075304714
+出征 8.04560572977
+紫穗槐 11.7034530746
+笑里藏刀 11.4157710022
+烦嚣 13.900677652
+孔明离 12.8020653633
+光伏 8.4284069783
+增减 8.58255765813
+歪带 12.8020653633
+莫忘 11.5027823792
+管理信息系统 11.0103058941
+摺奏 13.2075304714
+商业机构 11.4157710022
+韦林 13.2075304714
+四部 9.69598503258
+藤椅 9.46986085313
+毋负朕 13.2075304714
+腐殖土 12.5143832909
+专利证书 12.1089181827
+插着 9.84023464143
+水兽 12.8020653633
+岸防兵 11.5027823792
+舀去 13.900677652
+高地 8.11685246965
+招行 8.11993413618
+生财 11.598092559
+性感女郎 13.900677652
+透明质 11.8212361103
+防化学兵 12.2912397395
+高坎 13.900677652
+水德代 13.2075304714
+终身大事 9.85762638414
+光体 12.8020653633
+非军事 11.598092559
+几千度 12.2912397395
+马克思主义 7.50876053858
+多尼亚 12.5143832909
+强存弱 13.900677652
+高坛 13.900677652
+祖大寿 9.89334446674
+舀取 12.8020653633
+高坝 10.642581114
+至死不渝 11.3357282945
+情报站 12.5143832909
+高坐 10.765183436
+秃子 11.1926274509
+公子章 13.2075304714
+呼罗珊 10.0088573539
+李玉 11.3357282945
+李王 9.5186510173
+杨文会 12.2912397395
+腐植质 13.900677652
+生起 10.1394775363
+雷公藤 12.1089181827
+高坡 10.1871055853
+万包 13.900677652
+政务司 12.8020653633
+花豹 13.2075304714
+莫德 12.2912397395
+唐僧擒 13.2075304714
+赵明诚 11.9547675029
+大通曼哈顿银行 11.9547675029
+王政君 11.9547675029
+燕尾 11.0674643079
+三四万 10.765183436
+快节奏 10.3743171274
+党的纲领 11.7034530746
+相商 10.7226238216
+化释 12.2912397395
+三四丈 12.1089181827
+病怏怏 13.900677652
+毒贩子 13.900677652
+精当 11.0103058941
+醇雅 12.5143832909
+跳回来 13.2075304714
+浇愁 12.5143832909
+忠于国家 12.5143832909
+爱钱如命 12.8020653633
+扛鼎之作 13.2075304714
+蛀牙 11.0103058941
+祝你好运 12.2912397395
+莫属 9.96885201925
+脑科 11.5027823792
+楚有兵 13.2075304714
+节哀顺变 13.900677652
+王诤 13.2075304714
+原则性 9.89334446674
+燕尔 12.1089181827
+东道国 10.3171587135
+溶于 7.84858848305
+占全疆 12.2912397395
+团团长 10.2371160058
+假票 10.6818018271
+生身 11.3357282945
+许其亮 12.8020653633
+怀卡托 12.8020653633
+湘南地区 13.2075304714
+刘秀唱 13.900677652
+高阳酒徒 13.900677652
+嫁祸于人 11.9547675029
+投票权 9.45802639549
+捡了个 11.2616203224
+社会学科 12.8020653633
+举目望去 12.2912397395
+燕山 7.88941047757
+相对性状 13.900677652
+增列 13.2075304714
+二三流 13.2075304714
+增刊 11.598092559
+酸根 11.598092559
+畏死 11.598092559
+莫尔 9.6811699468
+俞志忠 12.8020653633
+改铸 11.1280889297
+穷困潦倒 10.9562386728
+大丈夫 8.85082164473
+姚公 13.2075304714
+牟子理 13.2075304714
+锆石 10.8561552143
+居庸关 9.20932976975
+增到 10.765183436
+张伯雅 13.900677652
+深藏不露 10.642581114
+左右两壁 12.2912397395
+增利 8.78268383956
+样本空间 11.598092559
+莫农加 12.8020653633
+熟面孔 11.9547675029
+超强 9.38981814546
+增删 10.8096351986
+四邑 11.9547675029
+主观性 11.1926274509
+莫尼 10.9562386728
+满满 9.24671730182
+几幢 11.3357282945
+名噪一时 10.2897597393
+童工 9.80633308975
+疯病 11.598092559
+孤癖 12.8020653633
+动力系统 9.40086798165
+不幸遭遇 11.1926274509
+燕岩 12.5143832909
+传号 13.900677652
+溶为 12.5143832909
+徵兆 13.900677652
+壮志未酬 11.8212361103
+李烈 12.8020653633
+乱作一团 10.642581114
+相间 8.03704647638
+稻穗 12.5143832909
+高启 11.2616203224
+薄铝窗 13.900677652
+那户 11.5027823792
+教育处 11.9547675029
+一个愿挨 12.1089181827
+彭璜 12.8020653633
+六百三十万斤 13.2075304714
+降心相从 12.8020653633
+姚冶 13.2075304714
+姚冰 12.8020653633
+读上 13.2075304714
+机械制图 12.2912397395
+片仔癀 10.2117981979
+满溢 12.8020653633
+驽骀 13.900677652
+宽宽厚厚 13.900677652
+斤斗 13.900677652
+传去 11.0103058941
+排击 12.8020653633
+鸡公山 10.7226238216
+三四代 13.2075304714
+一角 8.36728816325
+超微 10.9562386728
+郊区 7.90422556336
+增势 10.7226238216
+掺合料 13.2075304714
+用品厂 12.8020653633
+呋喃妥因 12.5143832909
+酸梅 12.5143832909
+颠倒是非 12.2912397395
+卜祝巫 13.2075304714
+李炜 12.5143832909
+饲养场 11.3357282945
+高呼 9.24671730182
+航海梯山 13.900677652
+增加 4.57299878758
+黑山县 12.8020653633
+补考费 13.900677652
+越行越 12.8020653633
+高喊 9.30555780184
+高挑挑 13.900677652
+八十周年 13.900677652
+石成 13.900677652
+拙嘴笨腮 13.2075304714
+李煦 13.2075304714
+满潮 12.5143832909
+控件 13.900677652
+石戈 13.900677652
+主存储器 10.7226238216
+生辉 10.3453295905
+凌鸿勋 13.2075304714
+童山 11.8212361103
+拱手让人 11.598092559
+贾政回 12.8020653633
+霍叔 12.1089181827
+增印 12.8020653633
+凤辇 10.604840786
+生命不息 13.2075304714
+地学界 12.5143832909
+酸楚 9.61021821083
+万剑 13.900677652
+李煜 10.4994802703
+斗牛犬 13.900677652
+刘长瑜 13.900677652
+江之固 13.2075304714
+法庭调查 12.8020653633
+北京分行 11.598092559
+一百几十 12.1089181827
+清燥救肺汤 12.2912397395
+逻辑学 9.59661255877
+核子武器 12.5143832909
+生还 9.91169360541
+盛时西 12.2912397395
+金荣笑 13.900677652
+三四位 13.900677652
+超市 7.79365476423
+横贡缎 12.5143832909
+传到 7.62968922012
+给予同情 13.900677652
+生过 10.1871055853
+棘轮 11.8212361103
+易贡 11.4157710022
+易货 11.3357282945
+任原西 13.2075304714
+心疼 7.87723005901
+紧紧抓住 9.5062284973
+收缩自如 13.2075304714
+抗药 13.2075304714
+全天候 9.18217878068
+几千封 13.2075304714
+腈纶 10.8561552143
+李焘 12.1089181827
+鹿城 11.5027823792
+乍然 10.4994802703
+大提速 12.5143832909
+超常 10.0294766411
+阿卡普尔科 12.2912397395
+李焕 13.2075304714
+熹宗 10.6818018271
+乌关 12.8020653633
+数据项 11.7034530746
+一触即溃 11.0674643079
+江山市 12.5143832909
+小妇人 12.1089181827
+增发 6.89852169757
+笑死人 13.2075304714
+喊醒 11.4157710022
+四十八万七千五百七十二 13.2075304714
+副厂长 10.0294766411
+静乐 11.5027823792
+高唐 11.9547675029
+第四十七回 12.2912397395
+韦斯 11.4157710022
+乌兽 13.900677652
+苹果电脑公司 13.900677652
+高唯 9.5186510173
+目眩神摇 13.2075304714
+胰腺 10.0720362555
+苦胆 11.8212361103
+狼疮性 12.8020653633
+青莲居士 13.2075304714
+垫出 12.5143832909
+财政补贴 9.36807815882
+高唱 9.94943393339
+摺子 13.2075304714
+梁漱溟 11.1280889297
+秃头 10.3453295905
+八毛 13.900677652
+增厚 8.89673134603
+七十斤 13.2075304714
+情报部 12.2912397395
+会员单位 9.87532596124
+传动 8.71329184614
+印欧语 8.63798746307
+高商 11.7034530746
+插画 13.2075304714
+增压 8.79473217808
+一个愿打 11.9547675029
+越次 12.8020653633
+引线人 13.900677652
+检测仪表 11.598092559
+夹棍 12.2912397395
+疣鼻天鹅 12.2912397395
+不期然 11.598092559
+奥斯特罗 12.1089181827
+曾开名 12.8020653633
+燕州 12.1089181827
+滤出来 13.900677652
+上场 9.37888907493
+埃洛拉 12.5143832909
+约定 7.17324592712
+超度 9.89334446674
+溶体 13.900677652
+寿怡红 12.8020653633
+北京大学光华管理学院 11.7034530746
+舀出 11.9547675029
+捅出来 11.5027823792
+情报分析 13.2075304714
+消委会 13.2075304714
+报头 13.900677652
+石洞 10.1871055853
+生肖 10.604840786
+罗马字母 11.7034530746
+滞留到 13.900677652
+戴校本 13.900677652
+小津 13.900677652
+破例 9.36807815882
+生肉 10.9562386728
+反空降 11.598092559
+透明胶 12.1089181827
+霍县 10.8096351986
+感谢信 11.5027823792
+商业模式 9.16447920358
+一千三百余 12.8020653633
+宇文胄 12.8020653633
+石洲 12.8020653633
+长虹桥 12.8020653633
+生育 8.10766404359
+石洵 13.2075304714
+龙翔 10.604840786
+石洪 10.4041700905
+若隐若显 13.2075304714
+整体厨房 12.8020653633
+扶柩 11.4157710022
+万口 11.0674643079
+菲尔特 12.8020653633
+海光寺 11.8212361103
+敲诈勒索 10.0088573539
+芡实 10.2371160058
+莫切 13.2075304714
+针插 11.598092559
+班超欲 13.2075304714
+特勒根 12.5143832909
+一踏 11.9547675029
+明廷封 12.8020653633
+厚彼薄此 13.2075304714
+郑勉 12.2912397395
+石流 11.5027823792
+今大兵 12.5143832909
+满怀 8.80081122415
+娄侯终 12.8020653633
+阿尔杜伊 13.2075304714
+李芳亭 11.9547675029
+十三类 12.8020653633
+交流平台 11.0103058941
+生胶 11.2616203224
+莫利 12.2912397395
+和小宁 12.2912397395
+石海 11.1280889297
+十三米 13.2075304714
+周太保 12.8020653633
+瓦夫一世 12.8020653633
+鸭汤 12.2912397395
+现当代 11.4157710022
+约合 8.44535653662
+班师北 12.5143832909
+约同 12.5143832909
+空勤团 12.8020653633
+石涛 10.533381822
+钝化剂 13.900677652
+周德清 13.2075304714
+陆军医院 12.8020653633
+四五种 12.8020653633
+踢脚板 13.900677652
+人身保险 10.8561552143
+西安交大 12.8020653633
+花色 9.46986085313
+插空 12.8020653633
+几千句 13.2075304714
+莫勒 11.9547675029
+海外版 10.8561552143
+温侯 11.2616203224
+哀感顽艳 13.2075304714
+尼采蒂 12.5143832909
+生者 10.0088573539
+李维 11.1926274509
+石涅 13.2075304714
+服从性 12.8020653633
+鼠腹蜗肠 13.900677652
+洗冤录 12.8020653633
+预估 8.41588071849
+贝州王 12.1089181827
+水蜈蚣 13.2075304714
+超凡 10.1630080337
+李绅 11.4157710022
+豆芽儿 13.900677652
+李绛 13.2075304714
+超出 6.86805339095
+传统武术 11.3357282945
+爆炸波 12.5143832909
+屏幕显示 11.8212361103
+活跃度 8.85725253506
+珍贵文物 9.89334446674
+第三碗 13.900677652
+悬冰川 11.9547675029
+李纬 12.8020653633
+李纯 11.5027823792
+苁蓉 11.9547675029
+合作者 9.74179456862
+柏梁台 12.8020653633
+尤素夫 13.2075304714
+石淋 12.8020653633
+有约在先 11.598092559
+卜祝及 12.8020653633
+门槛儿 11.598092559
+垫底 9.89334446674
+李纲 8.81927328699
+姚志 13.2075304714
+和琼崖 13.2075304714
+金军败 12.8020653633
+高婕 8.83808261895
+几维鸟 11.9547675029
+赋存 9.98865464655
+垫座 13.900677652
+永冻土 11.5027823792
+余千米 10.0294766411
+偏细 13.900677652
+九品中正 10.533381822
+长江三峡工程 12.1089181827
+利休 12.2912397395
+水晶像 13.900677652
+请不动 11.5027823792
+札记 9.80633308975
+洞天福地 11.3357282945
+中国协和医科大学 11.7034530746
+转船 12.8020653633
+奥尔特加 13.2075304714
+三智五猜 13.900677652
+乔治街 12.5143832909
+高安 11.4157710022
+安岳县 13.900677652
+真武汤 12.1089181827
+借题 13.900677652
+托木斯克 11.598092559
+超假 13.900677652
+默沙东公司 12.1089181827
+肖其亲 13.900677652
+高官 8.95903522937
+温中 10.9049453784
+高宝 13.2075304714
+厨房用具 13.900677652
+全球战略 10.3453295905
+冰川变化 13.2075304714
+强舰 12.8020653633
+高宗 9.17328983326
+毛译东 13.2075304714
+圆筒形 9.37888907493
+一壁厢 10.3743171274
+区别对待 10.0294766411
+莫卧 9.29550746599
+瑕不掩瑜 12.8020653633
+讲讲 9.06439574502
+丁关根 12.5143832909
+特技表演 12.5143832909
+庙内 10.8561552143
+讲论 10.5684731418
+家庭收入 10.4666904475
+怪怪奇奇 12.8020653633
+西绣岭 13.900677652
+十轮 11.9547675029
+破产 6.54248389924
+讲议 13.900677652
+江茂哥 13.2075304714
+高家 10.1871055853
+五六尺 12.1089181827
+宰鸭 13.2075304714
+救济贫民 11.9547675029
+涅瓦河 11.7034530746
+体操比赛 11.5027823792
+讲话 7.14374526273
+高密 9.54396882529
+免疫病 11.0103058941
+达姆弹 12.1089181827
+蕴结 11.1926274509
+讲评 11.4157710022
+一两套 13.2075304714
+邪魔外祟 13.2075304714
+插管 10.4666904475
+孺人 12.8020653633
+如见其人 13.2075304714
+高寒 8.6966709649
+温习 10.6818018271
+帕尼齐 12.8020653633
+陈鸿 11.1280889297
+碗碗腔 13.2075304714
+高寨 13.2075304714
+稻瘿蚊 13.900677652
+棕毛 11.9547675029
+浇湿 11.9547675029
+燕南 11.2616203224
+大转弯 10.9049453784
+几千分 13.900677652
+满意 6.83848601969
+讲读 11.4157710022
+阿合马 10.6818018271
+超值 10.1630080337
+高寿 11.3357282945
+透明膜 12.8020653633
+捣鼓 11.1926274509
+麦卡锡主义 11.2616203224
+精明强干 10.1871055853
+维哥湾 13.2075304714
+庄重文 13.2075304714
+文印室 11.5027823792
+莫及 11.7034530746
+鹿头 11.9547675029
+歪到 11.7034530746
+动物化学 13.900677652
+张宏 9.94943393339
+剖成 12.8020653633
+广陈善 13.2075304714
+朱全忠 11.7034530746
+伪麻黄碱 13.900677652
+神思恍惚 11.8212361103
+冷却水 11.0103058941
+俄皇 11.8212361103
+锅子 10.604840786
+李翊 12.8020653633
+思想顾虑 12.5143832909
+黑山峡 12.5143832909
+同态复仇 12.5143832909
+石沼 11.598092559
+石河 9.34680076038
+监督员 10.8561552143
+莫可 12.2912397395
+四大美女 13.900677652
+魏收亦 13.2075304714
+蚕宝宝 13.2075304714
+挺好吃 13.900677652
+切身感受 13.2075304714
+保护性 9.87532596124
+嘉定县 11.5027823792
+稻田 8.91707103027
+农业机械 9.17328983326
+上坪 12.1089181827
+雨儿 13.900677652
+新华网 6.95178042966
+募化 11.598092559
+帝俄时代 13.900677652
+抗跌 9.43476953332
+李群 11.1926274509
+霍拉姆 13.900677652
+合众社 12.5143832909
+动拆迁 11.7034530746
+石泉 11.5027823792
+弱队 13.2075304714
+整容术 13.2075304714
+东斯 12.5143832909
+走马灯 9.98865464655
+熊毅 13.2075304714
+脑瘫 11.2616203224
+中东地区 9.40086798165
+挟着 10.2630914922
+深刻领会 11.0674643079
+罗冲围 12.8020653633
+尼亚瓦 13.2075304714
+奶山羊 11.4157710022
+填色 12.1089181827
+左右门 12.5143832909
+奴佛卡因 13.900677652
+尚父 11.9547675029
+离奇古怪 11.5027823792
+唐求法 11.7034530746
+垫层 12.2912397395
+霍华 11.8212361103
+浇洒 13.2075304714
+班荆馆 11.9547675029
+显而 13.900677652
+超升 12.2912397395
+警备车 13.900677652
+韦格 13.2075304714
+覆盖层 10.533381822
+商麦金 13.2075304714
+金盛世 12.8020653633
+高墙 9.28555713513
+高增 11.5027823792
+血青素 13.900677652
+死亡威胁 12.8020653633
+漠漠 10.3453295905
+作出指示 12.8020653633
+梅塞施 11.9547675029
+增幅 6.81812908262
+超卓 12.8020653633
+金军进 13.2075304714
+几千克 12.5143832909
+畏服 11.9547675029
+歪写 13.2075304714
+荒碱地 13.900677652
+增广 11.7034530746
+波黑共和国 13.2075304714
+几千元 10.3743171274
+满手 10.9562386728
+熊样 12.8020653633
+许海峰 13.2075304714
+戒坛 11.8212361103
+贪天之功 12.2912397395
+不经之谈 13.900677652
+死马当活 13.900677652
+脑病 10.4349417492
+玩世不恭 10.2897597393
+江山县 12.8020653633
+阿布维尔 12.8020653633
+拉多加湖 11.3357282945
+廖仲凯 12.5143832909
+中国大百科全书出版社 11.598092559
+生苗 12.8020653633
+涂梢悦 13.2075304714
+皮亚特 12.8020653633
+谨慎从事 11.3357282945
+明至清 12.5143832909
+伊西莱 12.8020653633
+童儿 11.1926274509
+管姊弟 13.2075304714
+定都于 10.1394775363
+建阳市 13.900677652
+磷酰 13.2075304714
+行路人 13.2075304714
+橘红色 10.533381822
+磷酸 8.73019365694
+高士 10.2897597393
+传开 9.12155415886
+内衣裤 11.5027823792
+调用者 12.2912397395
+盈江县 13.900677652
+易耗 12.5143832909
+潸潸 12.2912397395
+挡得住 11.3357282945
+金屏生 13.2075304714
+天顺 10.2897597393
+银术可 11.4157710022
+太宗同 13.2075304714
+科研经费 11.598092559
+唐双宁 11.3357282945
+装修论坛 13.900677652
+高声 7.70219893548
+森普尔 12.2912397395
+坐不改姓 12.2912397395
+商业资讯 13.900677652
+袍哥 13.2075304714
+史遗规 13.2075304714
+封率义 13.2075304714
+短期贷款 10.0088573539
+高堂 10.6818018271
+铁石坚 13.900677652
+四君子 11.9547675029
+古今中外 9.96885201925
+史天泽 11.1926274509
+掏空 9.85762638414
+放眼望去 10.533381822
+伶人 11.0103058941
+一蹭 11.3357282945
+基里巴斯 11.1280889297
+苏加诺 11.2616203224
+胡吃海塞 13.900677652
+二把刀 13.900677652
+媚眼 11.1280889297
+增建 9.82314020807
+田沉 13.2075304714
+毕德显 13.2075304714
+穿花纳锦 13.900677652
+色楞格 12.1089181827
+满拉 12.8020653633
+计算资源 13.2075304714
+云状 11.7034530746
+数学考试 13.900677652
+疏剪 13.900677652
+凤舞 13.2075304714
+螺丝 10.3171587135
+情报资料 11.5027823792
+藏进 11.1280889297
+话音刚落 9.16447920358
+人行路 13.900677652
+罗乐勃 13.2075304714
+明廷应 13.2075304714
+一九一一 13.900677652
+超压 11.0674643079
+吉米才 13.2075304714
+除夕 9.66657114738
+辅机 11.0103058941
+纳迪尔 11.8212361103
+姚州 11.8212361103
+新闻节目 11.5027823792
+张伯驹 12.8020653633
+社会学界 11.0103058941
+不对称性 11.5027823792
+高塔 10.8561552143
+伶仃 11.1280889297
+亚历山德拉 13.900677652
+核桃 8.30969067146
+子斗 13.900677652
+自由思想 11.3357282945
+海盗船 11.7034530746
+生色 11.1926274509
+传得 9.53122979951
+谷风 11.7034530746
+居常土 13.2075304714
+和引生 12.2912397395
+明叔那 11.5027823792
+制造业者 11.9547675029
+超前 9.20019728618
+播幅 13.2075304714
+燕儿 11.7034530746
+广东外语外贸大学 13.2075304714
+大三阳 11.0103058941
+装甲部队 9.89334446674
+莫克 11.7034530746
+袁保恒 12.8020653633
+掐到 12.5143832909
+稳健性 11.8212361103
+剩余劳动 8.28390655431
+仁伯 12.2912397395
+辅助性 10.642581114
+各键 13.900677652
+塔瓦 11.9547675029
+邬思 13.900677652
+国防教育 11.8212361103
+石清 13.900677652
+剩余劳力 12.5143832909
+火油炉 13.900677652
+浇水 9.96885201925
+多用途 8.71329184614
+稔知 13.900677652
+轻工学院 12.8020653633
+强者 9.14708746087
+定价权 9.13850371718
+脑瓜 10.1630080337
+美好生活 10.8096351986
+南加州 11.3357282945
+不徇私情 11.598092559
+智顺王 12.8020653633
+刘多权 13.900677652
+宗设朝 13.2075304714
+责任人员 10.8096351986
+团脐 13.900677652
+莫兹 13.900677652
+石渠 11.1926274509
+评判者 13.2075304714
+尚贤堂 13.900677652
+苏共中央 10.4666904475
+生菜 10.9562386728
+水雷艇 13.2075304714
+一百三十四万多亩 13.2075304714
+第三辑 13.2075304714
+李素 10.9049453784
+火油 10.6818018271
+石湖 7.77380846786
+荒蛮 12.8020653633
+尹家庄 12.2912397395
+至死不悔 13.2075304714
+萧孝嵘 12.1089181827
+周正庆 9.65218240993
+无限生长 12.1089181827
+鹿寨 11.9547675029
+增开 10.642581114
+至死不悟 13.900677652
+傻瓜蛋 12.8020653633
+武烈河 12.1089181827
+意见分歧 9.84023464143
+传布 9.48183704418
+增强 5.79718337359
+石湾 10.8096351986
+几千倍 13.2075304714
+瓦尔帕莱索 12.1089181827
+弥陀 10.9049453784
+每一朵 12.8020653633
+鲁公礼 12.8020653633
+迁出去 13.2075304714
+太常 10.1630080337
+沈鲤 12.8020653633
+讲解 8.74162235276
+十班 12.8020653633
+奖励性 13.900677652
+藤本 9.65218240993
+昔人 12.2912397395
+日光浴 11.2616203224
+坯胎 12.1089181827
+童僧 13.2075304714
+高处 7.95787827685
+散文集 9.77354326693
+生茎 12.2912397395
+念及 9.82314020807
+冥冥之中 10.3453295905
+铜漏 12.5143832909
+糖衣炮弹 11.4157710022
+战云 13.2075304714
+高夫 12.5143832909
+燕军 11.598092559
+十七八年 13.900677652
+清了清 11.0103058941
+孩子 5.18136027647
+副矿长 12.8020653633
+就业指导 10.9049453784
+高大 7.22233553732
+歪倒 11.1926274509
+欧洲议会 10.8561552143
+石溪 12.5143832909
+生茧 13.900677652
+劳动党 10.4349417492
+高头 10.9049453784
+走村串户 11.9547675029
+前南斯拉夫地区 13.2075304714
+明廷得 13.2075304714
+高奏 13.900677652
+莫内 12.8020653633
+状况良好 10.2117981979
+王政委 11.1926274509
+藤条 10.0294766411
+万则 12.8020653633
+富士银行 12.2912397395
+天顶 10.3743171274
+迂回战术 12.5143832909
+木棉花 13.2075304714
+太宗喜 13.2075304714
+几处 8.4284069783
+蒙上天 13.2075304714
+男护士 12.1089181827
+山彪镇 12.5143832909
+强胜 13.900677652
+石滩 11.598092559
+睁起 12.2912397395
+一身 6.69207731402
+太宗善 12.8020653633
+悔气 13.900677652
+烟酒不沾 13.900677652
+藤村 12.5143832909
+成串 10.2897597393
+引擎盖 11.8212361103
+变型 9.29550746599
+成为 3.86862099864
+新古典主义 10.4666904475
+成丹 11.9547675029
+高庆 13.900677652
+本事 7.47580862807
+留言本 13.900677652
+剖析 8.89004235788
+冶铸 10.2630914922
+高庙 11.9547675029
+支承梁 13.2075304714
+魏征 10.5684731418
+张伯鲸 12.5143832909
+类群 8.75318317516
+艺术境界 11.0103058941
+石椁 9.46986085313
+任太尉 11.9547675029
+国际排联 13.2075304714
+高店 13.2075304714
+雷瓦尔 12.5143832909
+山阳仓 13.2075304714
+鹿岛 11.1926274509
+传奇 7.83225206373
+斗蟋蟀 10.8096351986
+河上源 11.1926274509
+空跑一趟 13.2075304714
+教育厅 9.77354326693
+佛罗里 13.900677652
+珠穆朗玛 11.7034530746
+杨春喜 10.765183436
+成丁 10.765183436
+施瓦兹 13.900677652
+本人 6.57750693403
+几千块 11.4157710022
+髓内 13.2075304714
+科英布拉 12.8020653633
+郑小锁 13.2075304714
+深切哀悼 13.900677652
+锅庄 13.2075304714
+约值 12.2912397395
+交叉学科 10.5684731418
+教育司 12.2912397395
+几多 10.533381822
+姚孟 12.1089181827
+成书 8.05713323494
+百忙当中 13.2075304714
+锅底 9.71102290995
+教育史 10.9049453784
+招笑 13.900677652
+留言板 11.9547675029
+秤锤 11.598092559
+谷颂 13.2075304714
+本以 12.8020653633
+抗衡 8.51160592216
+石楼 11.9547675029
+监察部门 11.2616203224
+火把节 11.598092559
+心事重重 9.61021821083
+鸟语 10.765183436
+三师 11.2616203224
+稀世珍宝 11.2616203224
+本年度 8.70218062071
+霍拉山 12.5143832909
+齐索姆 13.2075304714
+诗情画意 10.4666904475
+石楠 12.2912397395
+夜大学 12.1089181827
+本任 12.2912397395
+吉川 13.2075304714
+成亲 8.70218062071
+子毕公 12.8020653633
+高师 12.2912397395
+姚宏 12.2912397395
+姚安 11.3357282945
+大幅度降低 10.4349417492
+李端 13.2075304714
+高市 12.5143832909
+蓝绿色 10.533381822
+基层干部 10.0940151622
+获胜者 10.7226238216
+三亿人 13.900677652
+成交 6.0572212476
+高帝 10.8096351986
+安份守己 12.8020653633
+本业 11.1280889297
+李立 9.80633308975
+高帮 12.5143832909
+烦得 12.1089181827
+性神经症 12.2912397395
+偏窄 12.5143832909
+石榴 8.89004235788
+导弹部队 10.2371160058
+高帽 11.1280889297
+绥芬河 10.642581114
+姚家 11.2616203224
+本主 11.5027823792
+白衣大士 13.900677652
+盘内盛 12.2912397395
+姚富 13.900677652
+木叉 10.4041700905
+本乎 13.2075304714
+杨两军 11.9547675029
+郊外 8.89673134603
+鹿山 11.8212361103
+成份 8.75901409547
+燕园 10.3743171274
+贾蓉先 13.2075304714
+姚察 12.2912397395
+寻呼台 13.900677652
+生日报 13.900677652
+云梦泽 11.1280889297
+烦忧 12.8020653633
+新墨西哥 11.5027823792
+润物细无声 12.5143832909
+针杆 13.900677652
+蒙上帝 13.2075304714
+本书 7.57811241205
+混淆视听 11.1280889297
+石槽 10.604840786
+本乡 10.4349417492
+烦忙 13.2075304714
+成仙 9.45802639549
+支承桥 13.2075304714
+成仁 9.18217878068
+鹿屋 12.8020653633
+成仇 11.4157710022
+天涯海角 10.0720362555
+高干 10.1630080337
+高平 9.4233408375
+札达 12.5143832909
+中果皮 12.1089181827
+高年 12.1089181827
+陈振孙 11.9547675029
+畏怯 10.0505300503
+寻一寻 12.5143832909
+张道士 11.7034530746
+李筠 13.2075304714
+第四十七届 13.900677652
+石栗 13.900677652
+本例 12.5143832909
+冷面寒铁 13.900677652
+丹青 10.5684731418
+京市 13.900677652
+穴距 13.900677652
+石栏 11.1926274509
+石栎 11.0674643079
+高徒 10.4666904475
+寇二 12.8020653633
+高得 8.81308131674
+玉哀册 13.900677652
+峨眉山 9.28555713513
+石核 11.598092559
+李筌 13.2075304714
+成众 13.900677652
+惟精惟一 13.900677652
+账证 13.900677652
+宋伯仁 13.900677652
+规则化 12.8020653633
+伊兰特 11.3357282945
+插翅 10.3171587135
+旧电影 13.900677652
+生死关头 10.0294766411
+苏鲁克 12.2912397395
+阒然 13.900677652
+共同性 10.8561552143
+约克 9.98865464655
+两栖作战 10.2117981979
+女人真 13.2075304714
+增多 6.80727302611
+李媛媛 12.2912397395
+共产党 6.8316542254
+察右前旗 12.2912397395
+化验 9.14708746087
+尚兴俣 12.5143832909
+民政部门 10.0294766411
+寇仇 13.900677652
+舀子 13.900677652
+讲过 8.73589167805
+示范动作 13.2075304714
+和川西 11.0674643079
+捣鬼 10.2371160058
+公忠谋 13.2075304714
+秃发 10.3453295905
+左右两只 12.8020653633
+颜真卿 10.0505300503
+弗利托 13.2075304714
+成体 9.31571017331
+兵败将亡 12.2912397395
+讲述 8.10158499752
+流出量 11.3357282945
+成佛 10.0505300503
+咕咚 10.3743171274
+家苗 12.1089181827
+夸得 11.9547675029
+咕咕 9.20019728618
+石桩 12.1089181827
+前沿技术 12.2912397395
+乔利蒂 13.2075304714
+年青 10.0088573539
+独创性 9.85762638414
+类经 12.8020653633
+萨尔区 12.5143832909
+石桥 9.19114745066
+增大 6.71756595023
+莫埃 13.2075304714
+匡衡 11.8212361103
+函授部 12.8020653633
+沙特尔 11.8212361103
+歪嘴 10.9049453784
+相分 12.1089181827
+于博州 13.2075304714
+相切 11.8212361103
+男儿本色 13.2075304714
+布莱特 12.2912397395
+望西川 13.2075304714
+勋爵 9.61021821083
+吃晚饭 9.00283785202
+麻速忽 12.8020653633
+石梁 9.77354326693
+本会 11.0674643079
+成侯 12.8020653633
+石梅 13.2075304714
+阳曲郡 13.2075304714
+许云龙 12.8020653633
+承包工程 10.8561552143
+半日潮 11.0103058941
+多妻制 11.5027823792
+格措夫 13.2075304714
+满族 8.18694484647
+崩掉 12.8020653633
+田氏灭 13.2075304714
+石梯 11.1926274509
+成例 11.0674643079
+喜果 12.2912397395
+第三轮 11.0674643079
+景顺 8.73589167805
+本异译 13.900677652
+石棚 11.7034530746
+铁窗风味 13.900677652
+畏惧 8.39941944143
+本位 9.71102290995
+凿空 12.1089181827
+储油量 12.2912397395
+十三种 12.2912397395
+石棉 8.67493097826
+本体 9.04086524761
+南京港 11.5027823792
+热炕 11.1280889297
+北京国安 11.9547675029
+高彪 12.1089181827
+石棺 9.71102290995
+满文 9.84023464143
+多佛尔 10.9562386728
+石棱 12.8020653633
+高彦 13.900677652
+亲密 8.29120585679
+僵硬 8.88339781516
+杭海岭 13.2075304714
+满斗 12.8020653633
+佩内明 12.5143832909
+扑尔敏 11.9547675029
+左右两半 11.5027823792
+浙赣 9.87532596124
+按计划 9.40086798165
+姚夏 13.900677652
+黄金时代 9.49395840471
+尔发明 12.1089181827
+奥田硕 13.900677652
+保护林 12.8020653633
+鳐鱼 11.8212361103
+臧克家 11.7034530746
+埃亚 12.8020653633
+熊氏 12.5143832909
+泰坦尼克 12.5143832909
+汽车装饰 12.5143832909
+扰流器 13.900677652
+无用功 12.1089181827
+梅辉立 13.2075304714
+高岑 12.8020653633
+高岗 10.0720362555
+翻车 10.5684731418
+消极怠工 12.5143832909
+投影变换 13.2075304714
+街道口 13.2075304714
+市议员 12.2912397395
+西昌卫星发射中心 11.9547675029
+高岭 11.0103058941
+阿勒坦 12.8020653633
+共产制 12.5143832909
+任太常 11.7034530746
+长江流域 8.24468584116
+传子 11.598092559
+瓦瓦乌 13.2075304714
+宋江谢 12.1089181827
+掏给 12.2912397395
+下围棋 11.3357282945
+小昭寺 11.7034530746
+顾问处 12.8020653633
+韦氏 10.3171587135
+色厉内荏 11.9547675029
+打篮球 11.7034530746
+浮于 10.4041700905
+片刻之间 10.2371160058
+莫吉 12.2912397395
+鱼小虾 13.900677652
+酸性 7.99804431857
+莫名 8.83808261895
+西班牙文 11.0674643079
+绑牢 12.8020653633
+生蛋 11.4157710022
+老龙头 11.5027823792
+浮云 9.56994431169
+怕鬼 11.1280889297
+练过武 13.2075304714
+公诉人 10.9562386728
+磺酸钠 11.598092559
+山轿 12.8020653633
+人话 10.2371160058
+第二十七条 11.9547675029
+封口处 13.900677652
+于树洞 12.5143832909
+人人乐 12.2912397395
+曲折离奇 13.2075304714
+高峻 9.01787572939
+笛子曲 13.900677652
+罗塔 12.8020653633
+君子好逑 12.8020653633
+约分 13.900677652
+髋关节 11.4157710022
+元建炎 13.2075304714
+高峰 6.82995354472
+虫蛀 10.765183436
+微血管 10.604840786
+石武 11.7034530746
+桥粒 12.8020653633
+满满的 9.0884932966
+凿穴 13.900677652
+肩角 13.900677652
+保护期 11.5027823792
+王永住 12.8020653633
+自负盈亏 10.4041700905
+高射 9.58318953844
+里亚尔 11.9547675029
+高尚 8.51618258919
+百万计 12.2912397395
+百叶箱 12.2912397395
+踩高跷 11.8212361103
+英文报 13.2075304714
+传对 13.900677652
+高尔 11.5027823792
+李磊 11.3357282945
+石殿 10.8561552143
+排在 8.34384959028
+化饮 13.900677652
+藏躲 11.598092559
+气动式 13.2075304714
+封成安 13.2075304714
+高尾 13.900677652
+众妙 12.1089181827
+段兴智 12.2912397395
+浮上 10.0294766411
+大羚羊 11.2616203224
+强藩 11.1926274509
+萝卜汤 12.2912397395
+众叛亲离 10.3743171274
+高层 7.4023955025
+高居 9.61021821083
+公务活动 13.2075304714
+细毛羊 10.0505300503
+传家 11.0674643079
+面和心不和 12.5143832909
+毫不容情 11.0674643079
+薛总 11.3357282945
+保护权 11.0674643079
+奥克拉荷 13.900677652
+浮世 12.5143832909
+李萍倩 13.2075304714
+而延 13.2075304714
+跑调 13.2075304714
+阿根廷队 12.5143832909
+神经递质 10.7226238216
+长英岩 12.8020653633
+仇牧 13.900677652
+段氏复 13.2075304714
+安托尼 12.8020653633
+助燃剂 12.8020653633
+陈犹龙 13.2075304714
+高山 7.00905175492
+于明帝 13.900677652
+万码 13.2075304714
+天禄阁 12.8020653633
+西周时期 9.29550746599
+乙酉 12.5143832909
+熊洞 11.5027823792
+田大哥 12.1089181827
+佛门弟子 12.5143832909
+摺叠 12.8020653633
+李祥 12.2912397395
+个人收入 10.1164880181
+易安居士 12.8020653633
+代码执行 13.900677652
+西伯利亚 7.89679058487
+狐步 11.9547675029
+核液 12.8020653633
+系统维护 12.8020653633
+化食 12.8020653633
+警卫 8.59240995457
+魏郡元 12.8020653633
+爱光闪 13.2075304714
+余光中 12.8020653633
+魏帝 11.5027823792
+萨长诸 13.900677652
+思源 9.5186510173
+出工 10.9049453784
+下不着地 12.2912397395
+锅巴 11.5027823792
+诸葛亮会 13.900677652
+大西南 10.9562386728
+陌上桑 11.9547675029
+吴信泉 12.1089181827
+啃起来 12.8020653633
+几千吨 12.5143832909
+下坠球 13.900677652
+门市部 10.4349417492
+醇酒妇人 12.8020653633
+高州 10.9049453784
+僵立 11.9547675029
+林林总总 11.4157710022
+水上人家 11.0674643079
+克伦斯基 11.2616203224
+街道办 11.3357282945
+雨林中 12.8020653633
+高差 8.6803218269
+几千名 10.6818018271
+维持费 13.2075304714
+满月 9.28555713513
+平坦坦 12.8020653633
+伊萨巴尔 13.900677652
+高工 12.5143832909
+急中生智 10.1630080337
+南皮 10.765183436
+式子 10.8096351986
+满朝 9.23723855786
+满期 11.2616203224
+脑炎 9.69598503258
+高崎 12.8020653633
+蒙阴县 12.5143832909
+王志坚 13.900677652
+一万多斤 13.2075304714
+满面怒容 12.8020653633
+卑尔根 11.0674643079
+徐邦道 12.8020653633
+偏离 7.65845438652
+酱香型 12.5143832909
+淘气包 13.900677652
+浮体 11.8212361103
+高崖 11.1280889297
+四十二个 13.2075304714
+反面角色 12.8020653633
+李秋 12.8020653633
+新华社 7.18529426564
+李秀 10.9562386728
+抗议 8.30225569298
+歪向 11.8212361103
+百叶窗 11.0674643079
+切尔尼戈夫 13.2075304714
+超图 11.0674643079
+河豚鱼 13.2075304714
+黄骅港 12.5143832909
+干过 9.17328983326
+肯去 10.765183436
+太宗准 13.2075304714
+负罪 11.7034530746
+中亚地区 9.59661255877
+监督制 12.8020653633
+附面层 12.2912397395
+男女比例 11.9547675029
+抗诉 11.2616203224
+检漏 13.900677652
+迸出来 11.9547675029
+塞西尔 11.8212361103
+磷铵 12.8020653633
+偏移 11.3357282945
+弧面 12.1089181827
+发展前景 8.1641053545
+凤蝶 11.7034530746
+德芙 12.2912397395
+十三篇 11.4157710022
+炖排骨 13.2075304714
+相互配合 10.0720362555
+增容 11.598092559
+屈指可数 9.75754292558
+讲起 9.63799777493
+增宽 10.9049453784
+李福 9.85762638414
+中国教育部 13.2075304714
+部门 5.15555239251
+偏私 11.598092559
+传媒 7.90174109003
+那君臣 13.2075304714
+连前儿 13.2075304714
+牵引车 9.38981814546
+偏科 11.8212361103
+伦科夫 12.2912397395
+财物罪 13.2075304714
+一刻起 10.2630914922
+王守义 10.3171587135
+防浪板 11.3357282945
+翻来复去 11.7034530746
+东风镇 13.2075304714
+乌拉特中旗 12.8020653633
+今译 11.4157710022
+同质 9.93038573842
+少雾 11.9547675029
+颁赐 10.2897597393
+姚期 12.2912397395
+即时通 13.900677652
+寄主植物 10.4994802703
+远族 13.900677652
+少雨 9.09665660724
+盐适量 13.2075304714
+分分秒秒 12.2912397395
+高抗 12.1089181827
+迪维希语 12.8020653633
+姚本 12.8020653633
+颁赠 12.5143832909
+功大于过 12.2912397395
+纳西 9.74179456862
+陈胜 9.84023464143
+浇地 11.7034530746
+交谈起来 11.5027823792
+核力 10.765183436
+美洲豹 10.8561552143
+箭靶 11.0674643079
+核办 13.900677652
+乾旱 13.2075304714
+广化寺 12.1089181827
+沙漠相 13.900677652
+传教 8.5488195185
+投票决定 11.2616203224
+新立屯 13.2075304714
+想不开 10.2897597393
+儋县 11.2616203224
+蒋钦 10.9562386728
+十室九空 11.9547675029
+陈廷焯 12.8020653633
+父荫 11.9547675029
+高招 10.3171587135
+同赴 11.5027823792
+同走 11.5027823792
+巴南区 13.2075304714
+仅剩 9.15574552361
+底色 10.4041700905
+訇然 13.900677652
+满堂 10.3743171274
+惊奇不已 12.2912397395
+收缩率 12.1089181827
+章启月 11.7034530746
+古济水 12.2912397395
+涉水过河 13.2075304714
+接过 6.88138099826
+仍停留 10.6818018271
+植被型 12.8020653633
+余相公 11.5027823792
+纹孔 12.2912397395
+浮点 11.5027823792
+艺术史 10.9049453784
+接连 7.65457088649
+纯手工 11.598092559
+成片 9.01787572939
+接进 11.2616203224
+拉丁人 11.2616203224
+如履平地 11.5027823792
+接近 5.71644287788
+接运 11.4157710022
+县市政府 13.900677652
+甜糕 13.2075304714
+少陵 11.598092559
+余行 11.598092559
+索郎泽 9.30555780184
+威迫利诱 13.2075304714
+一轮 7.1072115194
+巽他群岛 11.5027823792
+寇猛 12.8020653633
+瓦希德 13.900677652
+朝鲜语 11.1926274509
+罗曼司 13.900677652
+光程 10.7226238216
+提高效率 9.91169360541
+三四碗 13.900677652
+一转 8.71889410168
+艺术化 11.8212361103
+再接再厉 10.0940151622
+受益非浅 12.5143832909
+罗曼史 11.598092559
+少陪 13.900677652
+财务软件 13.2075304714
+攀缘 10.5684731418
+非政治性 12.2912397395
+满壁 11.4157710022
+桅樯 12.8020653633
+百千米 11.5027823792
+约法 9.30555780184
+临深履薄 13.2075304714
+思想战线 12.5143832909
+全能性 11.7034530746
+商业利润 10.1630080337
+浮灰 13.2075304714
+告一段落 8.70772080109
+油晃晃 12.8020653633
+变址 13.900677652
+林泉高 12.2912397395
+接转 11.9547675029
+少阳 10.2371160058
+在生活中 9.4233408375
+虎穴 11.0103058941
+少阴 10.765183436
+极限值 11.5027823792
+高才 11.1280889297
+同路 10.9562386728
+乱丢垃圾 13.900677652
+接车 11.9547675029
+髓海 12.2912397395
+保护套 13.900677652
+针孔 11.1926274509
+交稿 12.2912397395
+生发水 13.900677652
+好几千元 12.8020653633
+歪歪 10.4994802703
+一轻 11.7034530746
+失灵 9.12999302751
+主力阵容 12.8020653633
+同父 12.8020653633
+交税 10.4666904475
+韦勒 11.598092559
+在生活上 10.4041700905
+头状花序 10.0088573539
+高扬 11.1926274509
+祯祥 11.7034530746
+珠饰 12.5143832909
+公之言 12.1089181827
+香港特别行政区 10.7226238216
+登山协会 13.900677652
+过分拥挤 11.9547675029
+全国农业展览馆 13.2075304714
+扩军备战 10.8561552143
+倒大霉 12.5143832909
+大韩航空公司 13.2075304714
+岁尾 11.1280889297
+林大娘 12.1089181827
+本特 12.5143832909
+穆献皇帝 13.900677652
+姚明 10.8561552143
+酒趣 13.900677652
+段玉芬 9.62401153296
+增效 10.9562386728
+九十余处 12.5143832909
+盘龙 10.1630080337
+舞台剧 10.765183436
+吕中因 13.900677652
+人心果 13.2075304714
+服饰品牌 12.5143832909
+余角 13.2075304714
+永世难忘 13.2075304714
+搧动 13.900677652
+总工期 11.8212361103
+两讫 13.900677652
+同调 11.1926274509
+太尉闻 13.900677652
+科研人员 9.91169360541
+姚春 13.900677652
+梅城镇 11.8212361103
+观门 11.9547675029
+同谋 10.2630914922
+华东科技 11.3357282945
+破皮 11.8212361103
+普雷格尔 12.2912397395
+感觉得到 10.9562386728
+光管 11.7034530746
+垫板 13.2075304714
+吼吼 11.7034530746
+塔什 11.5027823792
+烦扰 10.9562386728
+美国司法部 13.2075304714
+核可 13.900677652
+四遍 12.1089181827
+满天 9.14708746087
+杂耍 10.1164880181
+超标 8.53003962385
+路府治 13.2075304714
+篆字 11.0103058941
+自喷井 13.2075304714
+加斯特 13.900677652
+交管 11.4157710022
+永昌县 11.3357282945
+丰溪 13.2075304714
+佻巧 13.900677652
+满头 9.01032852375
+长波 9.93038573842
+市民文学 12.1089181827
+见于 7.11962002604
+监督机构 11.7034530746
+涂梢宰 13.2075304714
+典狱官 12.8020653633
+塔亚 13.2075304714
+点火装置 13.900677652
+破相 12.8020653633
+人心不足蛇吞象 12.8020653633
+赵汝愚 12.5143832909
+本班 12.5143832909
+靠住 12.5143832909
+增收 7.87481167815
+东莨菪碱 11.9547675029
+大灰狼 12.2912397395
+燕歌 11.7034530746
+阿勒格 13.900677652
+漂洗 10.9562386728
+增支 11.9547675029
+内源性 11.1280889297
+核发 9.84023464143
+争奇斗艳 10.6818018271
+欲火 10.604840786
+高挂 10.642581114
+向光性 11.7034530746
+几堵 13.2075304714
+光笔 11.8212361103
+原形毕露 10.8561552143
+颜光禄 13.2075304714
+同路人 11.0103058941
+诗礼之家 13.900677652
+蒸腾速率 13.2075304714
+绞杀战 12.8020653633
+莫比 10.9049453784
+打苍蝇 11.9547675029
+盘鼓 13.2075304714
+高挑 10.4041700905
+至关重要 8.09554268306
+翻身仗 10.5684731418
+互道珍重 13.2075304714
+隋所开 13.2075304714
+跳加官 13.2075304714
+赵为氏 12.8020653633
+荆州市 13.2075304714
+考核制 13.2075304714
+卡拉卡尔帕克 12.5143832909
+制度性 9.75754292558
+电力电缆 10.9049453784
+连江 10.8096351986
+高挺 11.8212361103
+兴化 9.65218240993
+韦厄 13.2075304714
+热导率 10.6818018271
+价格控制 12.1089181827
+勋业 10.9049453784
+不如说是 9.27570483869
+核化 13.900677652
+代步车 12.5143832909
+罗曼努 12.5143832909
+利巴韦 13.900677652
+弱音 12.8020653633
+全记录 13.900677652
+传播 6.48429917278
+挟住 11.1926274509
+塔中 10.3453295905
+宏志 13.900677652
+脑中 9.12155415886
+阴火潜 12.1089181827
+破百 12.2912397395
+童尊礼 13.2075304714
+京剧界 13.2075304714
+舌尖音 13.900677652
+略高于 8.83177344976
+无韵诗 12.8020653633
+不齿于人 13.2075304714
+物业税 10.2117981979
+刘欣 11.8212361103
+控拆 13.900677652
+塔上 10.9049453784
+塔下 11.1280889297
+蒋锛 13.2075304714
+风压 11.9547675029
+基础件 13.2075304714
+说时迟那 13.900677652
+光碟 12.8020653633
+传来 6.67156377418
+病退 11.7034530746
+人人爱 12.2912397395
+柳世权 12.8020653633
+病逝 8.35941410682
+兰开夏郡 11.5027823792
+莫桑 13.900677652
+况味 12.5143832909
+赵将庞 13.2075304714
+河流袭夺 12.8020653633
+十七八岁 10.0940151622
+好话说尽 13.2075304714
+东征御 12.8020653633
+三五种 13.2075304714
+石场 12.2912397395
+神舟五号 13.900677652
+沃洛金 12.5143832909
+礼记 9.25628675283
+高悬 9.75754292558
+黄骅县 12.8020653633
+一个三十岁 13.2075304714
+仇人 9.01032852375
+东笋 13.2075304714
+殉葬 8.9308643524
+石圭 13.900677652
+绑下 13.900677652
+经济时报 12.8020653633
+超巨型 12.8020653633
+石坛 12.8020653633
+赵将廉 12.5143832909
+沙里 10.3453295905
+沙量 10.8561552143
+后菜园 12.8020653633
+石坑 11.9547675029
+利于 8.03138073884
+成灾 9.72629038208
+孔文卿 13.900677652
+传本 10.604840786
+会见 8.0600359946
+石坊 10.604840786
+同轴 10.9049453784
+圆领衫 13.2075304714
+石坎 12.5143832909
+沙金 11.3357282945
+竞争心 13.2075304714
+候孔明 13.2075304714
+中国卫生部 12.2912397395
+击球手 13.2075304714
+掘井 12.1089181827
+马克思列 13.900677652
+一边 5.68648323712
+德尔维 13.900677652
+识文断字 11.2616203224
+坛主 12.2912397395
+平行作业 13.900677652
+赌赛 11.1926274509
+何亮工 13.2075304714
+农场主 8.69119149913
+石头记 10.8096351986
+莫根 13.2075304714
+拉浪 12.5143832909
+移过去 12.8020653633
+崩岸 13.900677652
+乖僻邪谬 13.900677652
+比手画脚 13.900677652
+中国戏剧出版社 13.2075304714
+杂菌 13.2075304714
+鲽鱼 12.5143832909
+接货 11.0103058941
+姚文 11.4157710022
+大觉寺 12.1089181827
+良言 11.1926274509
+武鸣 11.5027823792
+蒋陵 13.2075304714
+上访户 13.2075304714
+同达 12.2912397395
+临震 12.5143832909
+改造费 13.900677652
+临阵逃脱 13.900677652
+漂流 9.38981814546
+纳诺 12.2912397395
+布可擒 12.8020653633
+副社长 11.1926274509
+大巴山 9.41204128224
+魏巍丈 11.1926274509
+发言权 9.25628675283
+莫森 13.2075304714
+同辈 10.1630080337
+同辉 13.2075304714
+介电强度 13.2075304714
+传染 8.86372504956
+圣但尼 12.2912397395
+唠嗑 11.8212361103
+浓度梯度 11.5027823792
+殊异 11.9547675029
+人如潮涌 12.2912397395
+讯号 9.77354326693
+魏巍业 13.2075304714
+不老少 13.2075304714
+鹰击长空 13.900677652
+糖酵解 11.9547675029
+农家饭 13.2075304714
+余言 12.8020653633
+增暖 12.2912397395
+蒋防 12.5143832909
+粗纤维 10.3743171274
+石城 10.6818018271
+李岚清 12.1089181827
+高恒 13.2075304714
+扇风 11.1926274509
+接起 11.598092559
+磨一剑 12.8020653633
+罚酒 10.533381822
+女主人 9.5062284973
+同过 11.1280889297
+爱莲 13.2075304714
+矿化度 9.19114745066
+高息 9.98865464655
+魏巍义 12.8020653633
+季历入 12.8020653633
+保统兵 13.900677652
+尔金 13.900677652
+酷毙了 13.900677652
+夏养阳 12.8020653633
+萨尔河 12.8020653633
+万柏林区 13.900677652
+人间蒸发 11.3357282945
+麦芽糖 10.7226238216
+十一月份 10.604840786
+厄斯金 13.900677652
+温病 10.2897597393
+同进 12.1089181827
+临靠 13.900677652
+罗盛教 12.2912397395
+无机界 12.2912397395
+两三片 13.900677652
+少间 11.5027823792
+飞临 11.5027823792
+依赖型 11.5027823792
+坡路 11.3357282945
+埃玛 11.1926274509
+中国田协 13.900677652
+萨尔浒 11.5027823792
+打补丁 12.8020653633
+魏延 9.06439574502
+光禄 10.0294766411
+庆阳县 12.2912397395
+毛尖茶 12.2912397395
+父老 9.09665660724
+勾心斗角 10.642581114
+摩西 10.2117981979
+周显德 11.1280889297
+仕途 8.98802276624
+趟水 13.2075304714
+除夜 12.5143832909
+良计 13.2075304714
+交租 11.0674643079
+尔逊 12.5143832909
+杂色 10.2630914922
+观音 8.48457724977
+益西多 12.8020653633
+弯腰哈背 13.900677652
+韦兰 13.900677652
+不拘形迹 12.5143832909
+破瓜 12.2912397395
+大海捞针 11.0674643079
+烦恶 13.900677652
+常山股份 11.2616203224
+违反者 13.2075304714
+汤玛斯 13.2075304714
+烦恼 7.73525979774
+金银币 11.8212361103
+六十六天 12.2912397395
+栀子 11.1926274509
+于东海 11.0103058941
+出展 13.900677652
+光秀 13.900677652
+光秃 11.1280889297
+纳言 11.1926274509
+柯里 13.2075304714
+牛心山 10.8096351986
+流落外乡 13.900677652
+家传武 13.900677652
+默问 13.2075304714
+核减 11.4157710022
+温瑞 12.8020653633
+超模 12.5143832909
+死不认账 12.5143832909
+扫过 9.91169360541
+袜子拿 13.2075304714
+石器 8.66956903512
+出现异常 10.0088573539
+晋察冀野战军 11.7034530746
+浮现 8.35941410682
+韦克 12.1089181827
+教育法 11.8212361103
+绑住 11.1280889297
+秦丞相 12.8020653633
+摆乌龙 11.9547675029
+打电报 12.1089181827
+全国人大民族委员会 13.2075304714
+阿拉吉 13.2075304714
+教育观 13.2075304714
+二千余名 13.2075304714
+猪油 10.4994802703
+双人间 13.900677652
+靠外边 13.2075304714
+同口径 12.1089181827
+讲信修睦 13.2075304714
+核儿 11.9547675029
+唐宫 13.900677652
+尔邦 12.8020653633
+迪功郎 11.9547675029
+利他 13.2075304714
+从善如流 11.3357282945
+相互依存 9.84023464143
+主动脉瓣 11.4157710022
+土地国有 13.2075304714
+接谈 12.2912397395
+那小女孩 11.9547675029
+杀虫 9.85762638414
+临阵 9.43476953332
+今衰 13.2075304714
+佩内塔 13.900677652
+稻作 10.7226238216
+本然 11.9547675029
+论文选 11.9547675029
+北门锁钥 12.5143832909
+三闾大夫 12.5143832909
+五金塑料 13.900677652
+职业装 12.1089181827
+突着 13.900677652
+病重 8.99540287354
+满宠 11.2616203224
+三四篇 13.900677652
+满室 10.7226238216
+唐陆希 13.2075304714
+黄金高 13.900677652
+光祖 13.900677652
+咯咯声 12.5143832909
+少卿 9.89334446674
+甜美 9.61021821083
+子继统 13.2075304714
+愈快愈好 11.2616203224
+上升率 13.2075304714
+无须再 10.8561552143
+夏风先 12.5143832909
+鼠窃 13.900677652
+由单兵 12.8020653633
+改名字 13.900677652
+彩霞 9.74179456862
+几英里 13.900677652
+定国安邦 13.2075304714
+偷狗戏鸡 13.900677652
+石围 13.900677652
+缪斯 11.3357282945
+上海人民美术出版社 12.8020653633
+满官 10.8561552143
+苦药 13.2075304714
+米哈伊尔 11.4157710022
+德拉诺 12.5143832909
+广泗遂 12.8020653633
+国步维 12.8020653633
+何思敬 12.8020653633
+艺术型 13.900677652
+肇始 11.4157710022
+满山 9.82314020807
+接访 10.5684731418
+上篮得分 13.900677652
+皮包 9.29550746599
+地下铁路 12.2912397395
+普宁县 13.2075304714
+军事体育 12.1089181827
+无机物 9.44633035572
+光线 7.64877376881
+交织 8.25523075433
+满屋 9.89334446674
+黄蕉 13.900677652
+植棉 9.69598503258
+文徵明 10.765183436
+满屏 13.900677652
+纳赫 11.7034530746
+战方能 13.900677652
+吉檀迦 12.8020653633
+左前锋 13.900677652
+南京城 9.54396882529
+交给 6.46701111181
+竹丝 12.5143832909
+交结 10.1164880181
+围产 11.3357282945
+奥长石 13.2075304714
+菲尔丁 11.8212361103
+沙逊 12.8020653633
+联合行动 9.65218240993
+成百 10.8096351986
+玉立亭 13.900677652
+躲得 10.4994802703
+词典学 13.900677652
+黄南藏族自治州 12.2912397395
+唐宋 8.35160156708
+藤壶 10.8096351986
+拉祜族 10.765183436
+枝节性 12.8020653633
+一万多年 12.8020653633
+勃兰登堡门 12.5143832909
+石兄 13.2075304714
+炮兵连 10.8096351986
+攘外必先安内 10.642581114
+保温层 12.2912397395
+纳贿 10.8561552143
+硫酸镍 12.8020653633
+石兽 10.2371160058
+接诊 10.3453295905
+石关 12.5143832909
+硫酸镁 10.5684731418
+青年团 9.96885201925
+疔毒 12.8020653633
+九三年 13.2075304714
+暑期 11.3357282945
+病院 13.2075304714
+接话 11.0103058941
+红毛 10.7226238216
+烦杂 12.5143832909
+光绪 6.94699344111
+卡迪拉克 10.642581114
+纳贡 9.77354326693
+传感 9.53122979951
+本相 9.56994431169
+纳贤 13.900677652
+剖开 10.0294766411
+东风里 13.2075304714
+香辣蟹 12.5143832909
+高明 8.30596627237
+高昌 9.15574552361
+高昂 8.74738605748
+唠叨 9.36807815882
+中元节 11.9547675029
+分清敌我 13.2075304714
+观风 12.8020653633
+压路机 11.8212361103
+换支 13.900677652
+针式 12.5143832909
+小青瓦 12.8020653633
+占用率 13.900677652
+四百下 12.1089181827
+枯萎 9.84023464143
+南京师范大学 11.9547675029
+甲辰 12.1089181827
+第一百张 13.900677652
+孔志约 13.2075304714
+排列三 12.8020653633
+石冰 11.7034530746
+宇妥 13.900677652
+二茂铁 11.1926274509
+植桑 12.8020653633
+袍笏登场 13.900677652
+成皋 10.4041700905
+可尊敬 13.900677652
+平日 6.78023327958
+尚佳 11.8212361103
+利安徒 13.900677652
+馈源 13.2075304714
+红薯 9.05649056552
+十道菜 13.900677652
+海淀法院 13.900677652
+武顺 12.8020653633
+接警 11.5027823792
+和亚眠 12.5143832909
+植株 8.78268383956
+格雷菲 13.900677652
+嘉尔曼 13.2075304714
+推给 9.82314020807
+尔韦 12.5143832909
+中国法学会 10.7226238216
+六十五名 13.900677652
+植根 11.4157710022
+货币资金 9.53122979951
+辜负 8.41588071849
+石凿 11.7034530746
+线性失真 13.900677652
+李小芽 9.89334446674
+石凳 9.91169360541
+沙面 11.7034530746
+下坡路 11.4157710022
+删节号 12.8020653633
+高智 13.900677652
+实型 13.2075304714
+植树 10.2371160058
+二月份 12.2912397395
+本白 13.900677652
+营养学家 10.5684731418
+太宗死 12.5143832909
+厥功甚伟 13.2075304714
+钻出来 8.88339781516
+康进之 12.2912397395
+弗朗丹 12.5143832909
+颁行 8.84443184663
+完工后 10.642581114
+临邑 11.4157710022
+牧羊犬 12.5143832909
+杂著 10.604840786
+一分一毫 11.7034530746
+何建民 11.4157710022
+高枕 12.1089181827
+核型 10.642581114
+陈老 11.1926274509
+薄薄儿 13.2075304714
+于高平 12.1089181827
+单掌 13.2075304714
+有祥云 12.8020653633
+尚以 12.5143832909
+百三家 10.4666904475
+成真 10.4041700905
+军风 12.8020653633
+彩釉 11.4157710022
+侵略扩张 10.2630914922
+调远 13.2075304714
+并行任务 13.2075304714
+钱其琛 11.598092559
+异形 9.82314020807
+高架 10.3743171274
+讨去 12.1089181827
+几宗 12.2912397395
+小提琴 8.74162235276
+碱基对 12.2912397395
+汪猷 13.2075304714
+万利 11.8212361103
+全面提高 10.4041700905
+王文韶 10.9562386728
+白杨林 13.2075304714
+余超 13.900677652
+郸城县 11.2616203224
+电鳐 11.4157710022
+秃毛 13.900677652
+萧疏 11.598092559
+纳谏 10.642581114
+毫不留情 9.91169360541
+人民之声 11.8212361103
+纱门 13.2075304714
+王政权 12.2912397395
+王元如 13.2075304714
+快回去 9.55687223012
+健康险 11.2616203224
+林颖 13.900677652
+同行 7.61467955747
+恶疮 12.5143832909
+生产线 7.76511276089
+不高兴地 10.0505300503
+反求诸己 13.2075304714
+学到老 12.8020653633
+战技术 11.598092559
+多嫌 11.9547675029
+五千块 11.8212361103
+高柱 12.5143832909
+夫琅和费 11.7034530746
+论文集 9.0884932966
+深纺织 10.3743171274
+遛狗 11.9547675029
+尚义 11.5027823792
+本省 8.96620371885
+硫酸钠 10.765183436
+硫酸钡 11.3357282945
+四百五十元 13.900677652
+经斯基 13.900677652
+硫酸钾 12.1089181827
+秦巴山区 12.5143832909
+本真 13.900677652
+那钟 12.2912397395
+先驱报 11.4157710022
+杏花 9.85762638414
+光缆 10.3743171274
+拌点 13.900677652
+水蛇腰 11.4157710022
+矜贵 12.5143832909
+纳溪县 12.8020653633
+传情 11.1280889297
+大学本科 11.2616203224
+敏感点 12.8020653633
+腐败问题 10.4666904475
+片尾曲 13.2075304714
+硫酸钙 11.0103058941
+异构酶 13.2075304714
+叽里咕噜 12.8020653633
+皮格尔 12.8020653633
+沙阿 12.1089181827
+得济 13.900677652
+数据组织 12.5143832909
+正义事业 11.7034530746
+足通谷 13.900677652
+阿勒泰 10.0505300503
+满州 12.8020653633
+隆美尔 10.5684731418
+沪宁铁路 10.4349417492
+鳄鱼湖 13.2075304714
+本着 8.70772080109
+光网 13.2075304714
+尔雷 13.2075304714
+中新网 8.20023407859
+高杆 11.7034530746
+格雷茨 13.2075304714
+交缠 11.8212361103
+泥匠 12.5143832909
+冯镜如 13.2075304714
+石像 9.48183704418
+活下去 8.60737282725
+浮生 11.8212361103
+尚且 8.57280148319
+破片 9.84023464143
+时效性 10.604840786
+乌斯特 13.900677652
+排出去 12.1089181827
+硫酸铵 11.1926274509
+提高效益 11.4157710022
+袁保庆 13.2075304714
+归国华侨 12.1089181827
+穿便衣 11.598092559
+子约翰 13.2075304714
+硫酸铁 12.5143832909
+议院 10.0505300503
+伤风 10.9049453784
+好你个 10.4994802703
+硫酸铅 12.1089181827
+青冈林 13.900677652
+李喜喜 12.8020653633
+硫酸铜 10.9562386728
+硫酸铝 12.8020653633
+禹作敏 12.8020653633
+高杰 9.84023464143
+尔雅 9.94943393339
+石僧 13.900677652
+阿勒河 13.2075304714
+门吏转 12.5143832909
+土洋结合 13.2075304714
+杏脯 12.8020653633
+套话连篇 13.2075304714
+每半年 10.1394775363
+蛇吞象 11.598092559
+大梦方醒 13.900677652
+淑女装 13.2075304714
+滚下 9.45802639549
+莫汉 11.9547675029
+异彩 10.4994802703
+石化 6.66939064765
+杀菌 9.15574552361
+果类 11.9547675029
+陶得二 13.2075304714
+欠缺 8.95903522937
+政治野心 11.2616203224
+梅河口 11.598092559
+殉职 11.2616203224
+边境贸易 10.765183436
+尔锦 10.4666904475
+台军方 13.2075304714
+合法斗争 11.5027823792
+千字文 10.533381822
+黄彪 13.900677652
+层层叠叠 10.2117981979
+第四十七条 13.900677652
+年楚河 10.8561552143
+石匾 13.2075304714
+细别 13.900677652
+喟然 11.1926274509
+正考父 13.2075304714
+打沉 12.5143832909
+挨家逐户 13.2075304714
+波美拉 11.5027823792
+粘性流体 11.1280889297
+石匣 9.74179456862
+石匠 10.1630080337
+韦后 11.1280889297
+尝个 11.8212361103
+交粮 12.2912397395
+广州港 11.3357282945
+高擎 10.9562386728
+利西 12.8020653633
+气象报告 12.8020653633
+接触 6.4045803068
+莫氏 9.15574552361
+高跟鞋 9.87532596124
+清清爽爽 11.4157710022
+杜门自守 13.2075304714
+阻燃剂 12.8020653633
+尉氏洧 13.2075304714
+皮云杉 11.3357282945
+说学逗唱 13.900677652
+温煦 10.6818018271
+沙门 9.49395840471
+余身 12.5143832909
+保洁工 13.2075304714
+子继筠 13.2075304714
+赵于林 13.2075304714
+覆盖性 12.1089181827
+满师 13.2075304714
+石印 10.3743171274
+接见 8.1608847398
+摇滚乐 11.1280889297
+严惩不贷 10.604840786
+限额 8.59737274392
+崩塌 8.98069672615
+定期检查 10.1871055853
+卓命扶 13.2075304714
+斯普利特 13.900677652
+小炉儿匠 13.900677652
+阿尔蒙德 12.2912397395
+颁证 12.5143832909
+石厚 13.2075304714
+石原 12.8020653633
+莫泊 13.900677652
+南桐 13.2075304714
+沙锅 10.9049453784
+吕斯百 12.5143832909
+控方 13.900677652
+鹈鹕 11.1280889297
+贱货 10.9562386728
+纳波卡 13.900677652
+河滨公园 12.5143832909
+六万平方米 13.900677652
+百转千回 11.9547675029
+多组分 11.8212361103
+绿树丛 11.9547675029
+地下街 12.5143832909
+阴生植物 12.8020653633
+桂平西 12.8020653633
+有生之年 10.5684731418
+玻璃纤维 9.93038573842
+秦祁昆 12.5143832909
+今起 7.68807155622
+十字花科 10.3743171274
+线形 9.72629038208
+增拨 12.2912397395
+纳迪 13.2075304714
+罚锾 13.900677652
+昌德拉 13.900677652
+浮白 13.900677652
+亲友们 11.0674643079
+郭东木 11.7034530746
+旋塞阀 13.2075304714
+花博会 9.48183704418
+廖立 12.2912397395
+连载小说 11.9547675029
+传接 12.5143832909
+敕勒歌 11.8212361103
+南桥 12.1089181827
+思想者 11.598092559
+石友 13.900677652
+购房人 9.89334446674
+路人甲 13.2075304714
+西屋电气 13.2075304714
+尔门 13.900677652
+国家羽毛球队 12.1089181827
+温燥 11.3357282945
+清宫 7.45495783259
+渺无人踪 13.900677652
+格林氏 13.2075304714
+阴虚阳 12.2912397395
+精美 7.92941581219
+列席代表 13.900677652
+传授 8.47572763449
+北京工业大学 12.5143832909
+气动弹性 12.2912397395
+石叶 11.5027823792
+破落户 10.604840786
+党性原则 11.598092559
+原函数 11.4157710022
+花园里 9.98865464655
+议长 8.9308643524
+少选 13.2075304714
+满庚 11.0674643079
+东夷化 13.2075304714
+畏寒 9.93038573842
+成田 11.8212361103
+耦合器 12.1089181827
+冀东水泥 10.2117981979
+成电 12.2912397395
+巴布亚新几内亚独立国 13.2075304714
+法国社会党 10.9049453784
+谏院 12.1089181827
+传扬 10.3453295905
+维利希 12.8020653633
+浮来暂去 13.900677652
+盘香 13.2075304714
+手脚利索 11.8212361103
+任安丰 13.2075304714
+大饭店 10.8096351986
+传承 8.97342396682
+抠门儿 13.2075304714
+任摩尔 13.2075304714
+石刻 8.15447446144
+偶合器 13.900677652
+盖达尔 12.5143832909
+高斯 9.37888907493
+鹿林 13.900677652
+沙钢 10.4349417492
+石制 10.3453295905
+王开金 12.8020653633
+中国社会科学院民族研究所 12.5143832909
+偷车贼 13.900677652
+清室 11.1926274509
+高新 8.71329184614
+杀身之祸 9.96885201925
+罚钱 13.900677652
+澳门大学 12.5143832909
+良辰 10.9562386728
+余辉 11.0674643079
+艺术品 8.76487921493
+本病 8.83177344976
+三味线 13.2075304714
+土老冒 12.8020653633
+默里 11.3357282945
+无尘衣 12.5143832909
+此伏彼起 10.8561552143
+天窗版 13.900677652
+谏阻 9.55687223012
+莫洛 11.9547675029
+挖补 13.2075304714
+破烂 8.77077893705
+言多语失 12.8020653633
+弹完 12.1089181827
+福雷斯 12.8020653633
+清零 12.1089181827
+共振效应 11.9547675029
+多吉次仁 11.4157710022
+高旭 13.2075304714
+英文字 12.1089181827
+同济大学 10.1630080337
+每平米 10.4994802703
+强心药 12.8020653633
+须白眉 13.900677652
+向社友 12.5143832909
+传戒 11.9547675029
+泽斯 13.900677652
+一针一线 11.1926274509
+和列侯 12.8020653633
+文房四宝 9.84023464143
+童气 13.2075304714
+开盘价 8.37522471284
+康有为 7.66822963543
+温点 13.2075304714
+山寺 10.7226238216
+武装泅渡 12.8020653633
+人生哲学 10.9562386728
+黑天鹅 11.7034530746
+高攀 10.5684731418
+毫针 11.1926274509
+针尖 10.4349417492
+至死不屈 12.2912397395
+庐江 9.93038573842
+回头草 11.8212361103
+大港油田 11.3357282945
+隔音符号 13.900677652
+主祷文 13.900677652
+本生 10.2630914922
+奋勇直前 12.2912397395
+青铜峡 10.3171587135
+鸨儿 12.1089181827
+满心 8.9308643524
+向光明 12.8020653633
+橘皮 11.3357282945
+雁群 11.7034530746
+从轻处理 11.4157710022
+超滤 12.2912397395
+增援 8.5440913773
+道义之交 13.2075304714
+高放 13.2075304714
+本田 9.22784881751
+人走茶凉 12.8020653633
+阿列克谢 11.5027823792
+方兴未艾 9.71102290995
+感谢上帝 11.598092559
+高效 7.73106691948
+宗龙朔 12.5143832909
+雁翅 11.8212361103
+高敏 12.5143832909
+阿帕拉契 13.2075304714
+传报 9.98865464655
+石勒 9.85762638414
+落井 11.598092559
+雁翎 11.8212361103
+高教 11.9547675029
+高敞 11.5027823792
+格贝克 13.900677652
+石勇 9.5186510173
+建宁县 12.8020653633
+密度估计 12.8020653633
+伤亡人数 11.5027823792
+传抄 10.0088573539
+凌加卫 13.2075304714
+楼底下 11.8212361103
+连续变量 13.2075304714
+经曼德 12.8020653633
+合成孔径雷达 10.8561552143
+破灭 8.28754954559
+赤日炎炎 12.2912397395
+满得 12.8020653633
+张耀翔 12.8020653633
+藤子 12.8020653633
+金山公司 12.8020653633
+尖削 11.3357282945
+约摸 9.14708746087
+塔里亚 12.8020653633
+初恋情人 11.9547675029
+杀跌 8.79473217808
+运动过度 12.8020653633
+武钢 9.26594866375
+四百四病 13.900677652
+遗赠人 11.8212361103
+标明 8.91707103027
+智力因素 12.5143832909
+接杀 13.900677652
+雌兽 11.1280889297
+石崇 11.1926274509
+至死不变 12.8020653633
+寻呼机 13.900677652
+李义 11.4157710022
+林大勇 13.900677652
+三一三 12.8020653633
+偏下 11.4157710022
+偏上 13.900677652
+张汇文 13.2075304714
+少安毋躁 11.8212361103
+艺术宫 11.598092559
+娇生惯养 11.1280889297
+乡里 8.56795885871
+一大批 7.96578345636
+英文名 11.598092559
+偏东 9.89334446674
+艺术家 7.97642185456
+李乐 12.2912397395
+需注意 9.91169360541
+绥靖 9.5186510173
+李乔 12.2912397395
+施特尔 13.2075304714
+一旁观 13.900677652
+收购员 13.900677652
+吴越王 11.0103058941
+烦死 11.4157710022
+李严 11.3357282945
+小提示 11.3357282945
+孟良 11.9547675029
+岩礁 10.4994802703
+默默 7.90921310487
+渐入佳境 11.1926274509
+李丽 11.2616203224
+霍拉桑 11.3357282945
+五一六 13.900677652
+抵拒 13.900677652
+三十几头 12.5143832909
+本站 9.98865464655
+献给党 13.900677652
+李三 12.2912397395
+举一反三 11.4157710022
+本章 7.22864470651
+温网 13.2075304714
+李丁 13.900677652
+蒙头蒙 13.2075304714
+针叶 9.58318953844
+走起路来 10.2371160058
+李业 13.2075304714
+争议地区 12.1089181827
+李东 11.2616203224
+德尔瓦 13.900677652
+红萍 12.5143832909
+师师之 12.2912397395
+政治常识 13.900677652
+老态 11.7034530746
+吴为会 12.2912397395
+一半站 12.8020653633
+分式方程 13.900677652
+坝体 10.604840786
+莫拉 11.7034530746
+快回到 12.8020653633
+特鲁瓦 13.2075304714
+远志 10.3453295905
+偏于 9.63799777493
+二三百万两 12.5143832909
+李仁 12.1089181827
+不自量 13.2075304714
+石嶷 12.8020653633
+五毒俱全 12.8020653633
+王永祺 13.2075304714
+库默尔 11.5027823792
+冰河期 12.2912397395
+纯牛奶 13.2075304714
+观鱼 11.1926274509
+朝章国典 13.900677652
+三四点 10.8096351986
+收税官 12.5143832909
+仲裁条款 12.2912397395
+常舒 13.2075304714
+李亨 11.5027823792
+李京 13.2075304714
+八九七十二 12.8020653633
+石川 12.1089181827
+男仆 10.9562386728
+常住人口 10.5684731418
+成竹 12.8020653633
+余者 9.77354326693
+破罐 13.2075304714
+茶园 8.62256299275
+无思无虑 12.5143832909
+独体字 12.1089181827
+成章 11.3357282945
+莫抖 13.900677652
+迷离恍惚 12.8020653633
+垂了下去 12.2912397395
+游云西 13.900677652
+钟兆琳 12.8020653633
+李二 11.598092559
+雷峰塔 10.9562386728
+教育权 11.9547675029
+祁漫塔 11.8212361103
+颇费 10.9049453784
+鲁格 12.2912397395
+人间喜剧 11.4157710022
+单据 9.85762638414
+八千一百三十七万七千二百三十六口 13.2075304714
+李邦华 10.3171587135
+成立 5.1114745575
+克维奇 11.9547675029
+石工 12.5143832909
+谷胱甘肽 12.8020653633
+约数 12.2912397395
+司务官 12.2912397395
+音乐舞蹈 10.4041700905
+姚渊 13.2075304714
+高宽比 12.5143832909
+马迹塘 12.8020653633
+天各一方 10.8096351986
+狠巴巴 12.8020653633
+信用可靠 13.900677652
+斑岩 10.1394775363
+生物降解 12.1089181827
+一两家 11.1280889297
+候捷音 13.2075304714
+李佳 13.900677652
+母难之日 12.8020653633
+花红柳绿 12.8020653633
+余臣 12.8020653633
+浮生若梦 12.8020653633
+信疑 13.2075304714
+琵琶湖 11.9547675029
+罗定 11.0103058941
+核定 9.20019728618
+核实 8.1641053545
+偏会 12.5143832909
+光环 9.19114745066
+今若 9.84023464143
+加工硬化 11.598092559
+郑子取 13.900677652
+陈腐 10.4349417492
+高段 13.2075304714
+本篇 11.2616203224
+盔帽 11.9547675029
+赵母 13.2075304714
+蓝均镶 13.2075304714
+李伯 12.8020653633
+甜甜 10.765183436
+油压表 13.900677652
+调过来 11.7034530746
+每位 9.15574552361
+乡邮 13.2075304714
+石屋 10.1630080337
+尔马 13.900677652
+核对 9.33632946051
+石屏 10.4349417492
+武门 12.5143832909
+乡邻 10.3743171274
+几千户 12.5143832909
+绥阳 12.8020653633
+偏低 7.87481167815
+破绽 8.94485059437
+太宗朝 12.2912397395
+增派 9.5062284973
+卿家 13.2075304714
+袍服 9.96885201925
+石山 9.53122979951
+花褶 13.2075304714
+康替龙 13.2075304714
+韦孟 13.2075304714
+根纳季 12.8020653633
+辅助剂 13.2075304714
+崩坍 11.8212361103
+崩坏 11.5027823792
+李伟 8.63281949291
+新华信 13.2075304714
+一千余名 13.2075304714
+终清未 12.8020653633
+石岛 10.3171587135
+张怡宁 13.900677652
+成箱 12.8020653633
+寓言故事 11.1926274509
+韦家 13.900677652
+派性 11.9547675029
+吴爱珍 9.80633308975
+四百余 11.9547675029
+石岗 12.8020653633
+贵古贱今 13.900677652
+募捐 10.1394775363
+比萨扬 12.1089181827
+金银珠宝 9.7898037878
+称兄道弟 11.1280889297
+金海湖 13.900677652
+存款人 11.0103058941
+伙食团 12.8020653633
+针刺 9.03314320152
+李俊 8.39941944143
+增添 7.70423352418
+王流摇 13.2075304714
+成算 11.4157710022
+招财 12.2912397395
+高欢 9.94943393339
+淋球菌 11.9547675029
+前松后紧 12.5143832909
+松紧带 11.9547675029
+石岩 10.9562386728
+曼德尔 12.8020653633
+石岭 11.7034530746
+美国劳工部 9.49395840471
+怀废立 13.2075304714
+余脉 9.28555713513
+抖搂精神 13.2075304714
+秃杉 11.7034530746
+直接存取 13.2075304714
+高歌 8.75901409547
+莫斯基托 13.900677652
+包身工 11.3357282945
+招贤 10.765183436
+罪恶昭著 13.900677652
+偏信 12.2912397395
+韦寿 13.2075304714
+索木碧 13.900677652
+罗宾 12.5143832909
+针剂 10.5684731418
+梅丽桑 11.8212361103
+二十八篇 13.2075304714
+坝上 10.2371160058
+万死犹轻 13.2075304714
+胡成精 12.8020653633
+沙马 11.4157710022
+管养马 13.2075304714
+盘面 7.05161136934
+命赴黄泉 12.8020653633
+石峰 10.8096351986
+高武 13.900677652
+小狗子 12.8020653633
+歪才 12.5143832909
+六十公里 12.8020653633
+二千余年 12.8020653633
+桑寄生 11.7034530746
+温经 12.1089181827
+南森 11.5027823792
+核子 10.0294766411
+甲苯 10.0720362555
+李侔 8.9519177616
+核孔 13.2075304714
+李侗 12.1089181827
+润饰 12.2912397395
+石弘 13.2075304714
+美洲虎 10.2117981979
+商业网站 11.8212361103
+扬升 9.93038573842
+石弓 13.2075304714
+玩弄女性 13.2075304714
+高梁 9.98865464655
+做错事 11.7034530746
+二两册 13.2075304714
+奥曼迪 12.8020653633
+设身处地 10.6818018271
+螺线 11.2616203224
+清脆悦耳 11.2616203224
+螺纹 9.38981814546
+通辽市 11.7034530746
+杀进 10.3743171274
+饼馅 13.2075304714
+秦二世 9.74179456862
+垫江 11.5027823792
+十三一 11.8212361103
+光点 10.533381822
+石弹 12.5143832909
+百问不厌 13.2075304714
+紫花地丁 12.5143832909
+依赖度 11.7034530746
+增湿 12.2912397395
+元敬兄 12.1089181827
+产品质量法 11.8212361103
+曾中生 13.2075304714
+罢罢罢 10.9049453784
+端水 11.0674643079
+长短不一 10.0720362555
+捎来 10.0940151622
+那玉山 13.2075304714
+武隆 13.900677652
+十三个 9.7898037878
+好几两 12.5143832909
+拖拉机厂 12.2912397395
+胎骨 12.1089181827
+冷凝器 11.1280889297
+朱全水 12.2912397395
+自会在 13.900677652
+高检 12.8020653633
+冯德伦 11.5027823792
+浪漫主义者 12.2912397395
+热身运动 12.1089181827
+朱元璋 8.33615724465
+东端 9.08039608637
+日光岩 12.5143832909
+挂匾 12.8020653633
+郑广文 13.2075304714
+可信度 10.4994802703
+第三十回 11.8212361103
+回签 13.900677652
+舀汤 13.900677652
+满分 10.2371160058
+青冈树 13.2075304714
+主奏 11.7034530746
+史可考 12.8020653633
+通声气 11.8212361103
+派出机构 9.96885201925
+徐锡麟 10.9562386728
+增温 10.3171587135
+四二六二 13.2075304714
+国家能源部 13.900677652
+光热 10.0720362555
+作业系统 13.2075304714
+红灯 9.36807815882
+余芳 13.2075304714
+说鬼话 11.7034530746
+神雕侠侣 12.8020653633
+武阳 10.604840786
+交火 11.1280889297
+高标 12.8020653633
+余艘 10.3171587135
+口信儿 11.9547675029
+书虫子 13.900677652
+杂话 12.8020653633
+高树 11.8212361103
+蔡启方 11.4157710022
+石径 11.7034530746
+保护区 8.47572763449
+十三亿 12.1089181827
+纽约日报 13.2075304714
+环化酶 13.900677652
+差点儿 9.30555780184
+手挽手 11.8212361103
+高校 8.06879517469
+石德 10.7226238216
+基斯马尤 12.8020653633
+杂说 11.0103058941
+浮空 13.900677652
+原西籍 12.8020653633
+黑苍苍 12.5143832909
+布洛赫 11.5027823792
+高格 13.2075304714
+田牛 12.2912397395
+社会科学院 9.63799777493
+舀油 13.900677652
+北池子 11.598092559
+关亦 13.2075304714
+指挥若定 11.598092559
+里三层外三层 11.7034530746
+武陵 9.77354326693
+每于 11.4157710022
+横挑鼻子竖挑眼 11.8212361103
+铵态氮 12.8020653633
+万山红 13.900677652
+两性之间 12.2912397395
+白杨树 10.533381822
+海军部 10.642581114
+日晒雨淋 11.8212361103
+麾军 11.598092559
+征聘 11.5027823792
+路径名 11.9547675029
+一触即发 7.68407155089
+余舒 12.5143832909
+安然无事 12.8020653633
+中非共和国 11.9547675029
+相减 11.8212361103
+蜂拥而上 11.1926274509
+光灿 13.900677652
+谢谢您 10.3171587135
+高档 7.9526426628
+策马 8.55834340001
+点头哈腰 10.6818018271
+增溶 13.2075304714
+高桥 9.89334446674
+尤为重要 9.20019728618
+光火 10.9562386728
+甚感 11.5027823792
+杂记 9.96885201925
+小肚子 10.9049453784
+一贫 12.5143832909
+闯来闯去 13.900677652
+佛号 11.5027823792
+丧魂失魄 10.9049453784
+杂论 11.598092559
+伤脑筋 11.0674643079
+光熙 11.9547675029
+母梁太后 12.8020653633
+姚氏 11.1926274509
+张均田 13.900677652
+藏之名山 12.8020653633
+苏里江 12.8020653633
+黄汉升 12.5143832909
+成礼 12.8020653633
+确保您 13.900677652
+专有权 11.4157710022
+不为过 9.61021821083
+植柳 12.1089181827
+韦大 13.2075304714
+韦夫 11.1926274509
+花莲人 13.900677652
+青云街 13.900677652
+小梅沙 12.2912397395
+莫通博 13.900677652
+丁公藤 13.900677652
+豫西南 11.3357282945
+良莠 12.1089181827
+陪审席 13.900677652
+粟子树 13.2075304714
+囟门 11.7034530746
+武装起义 8.39941944143
+燕誉堂 13.900677652
+一鼓作气 9.84023464143
+认购证 10.1871055853
+时高时低 11.8212361103
+杂言 11.7034530746
+贝尔曼 12.1089181827
+哈巴罗夫斯克 11.3357282945
+拒水 12.1089181827
+本种 11.1926274509
+北京安贞医院 12.8020653633
+十三位 13.2075304714
+姚江 11.0103058941
+合不来 12.1089181827
+民主权力 13.900677652
+比较复杂 8.80692745117
+本科 8.82550383674
+诸多名 13.900677652
+袁慧 12.8020653633
+武韬 13.2075304714
+不外乎 9.59661255877
+东真国 11.8212361103
+居心不良 11.9547675029
+隆儿寿 13.900677652
+盘问 9.32596667347
+杀身 10.8561552143
+一万多元 11.598092559
+纳舶 13.2075304714
+约期 11.1926274509
+鹿母 13.900677652
+韦奇 13.900677652
+安的列斯群岛 9.94943393339
+石幢 11.3357282945
+通南夷 12.8020653633
+职业者 11.7034530746
+额吉纳 13.2075304714
+满口 9.16447920358
+慈善事业 9.85762638414
+甲肝 11.5027823792
+把酒言欢 13.900677652
+太宗时 11.4157710022
+湖北佬 12.2912397395
+宝顶山 12.5143832909
+阿尔萨斯 10.1164880181
+明智地 11.7034530746
+滚来滚去 11.3357282945
+萝卜头 12.8020653633
+砗磲 10.4666904475
+超拔 12.1089181827
+浮筒 11.0103058941
+阳刚之美 13.900677652
+左右两支 12.8020653633
+公开批评 10.642581114
+余荫 11.598092559
+催干剂 13.900677652
+阿卡迪亚 11.0103058941
+锦纶 10.3171587135
+为人处事 11.5027823792
+廖仲恺 10.4041700905
+国富民安 13.900677652
+盘锦 10.9562386728
+季龙 13.2075304714
+涂梢允 12.2912397395
+那架 9.66657114738
+青铜像 12.1089181827
+王傅府 13.2075304714
+喷上去 13.900677652
+武震 13.2075304714
+本社 11.8212361103
+石座 11.598092559
+丝竹空 13.900677652
+口轻 13.2075304714
+头孢哌酮 13.900677652
+植木 13.2075304714
+在经济上 8.83808261895
+甲胄 9.98865464655
+颊囊 11.598092559
+保护剂 11.8212361103
+於路 10.4666904475
+乌东 12.8020653633
+姚泓 13.2075304714
+良药 10.0088573539
+万日元 11.1926274509
+成科 12.1089181827
+郊游 10.9562386728
+意气扬扬 13.900677652
+一篓篓 13.900677652
+贺年卡 12.5143832909
+爱之梦 13.900677652
+本票 11.0674643079
+宗法制度 10.1871055853
+报务员 10.0940151622
+综合 5.46166224162
+高楼 9.07236391467
+鳄鱼恤 13.900677652
+合该 10.642581114
+永无宁日 12.5143832909
+新片 11.5027823792
+超敏 13.900677652
+逻辑性 10.8561552143
+税课 10.8561552143
+上吊 8.79473217808
+几千条 12.8020653633
+供给燃料 13.2075304714
+扳闸 13.900677652
+四十厘米 13.900677652
+沙龙 8.9519177616
+相冲 12.2912397395
+年青人 10.765183436
+熊师 12.8020653633
+望春花 12.8020653633
+交相 10.533381822
+贪得无厌 10.4349417492
+接获 11.2616203224
+劳大哥 13.900677652
+熊市 8.42421410004
+康斯坦察县 13.900677652
+武邑 11.5027823792
+阴寒之 12.5143832909
+三合土 13.2075304714
+爱起 12.5143832909
+东征军 11.9547675029
+黔南 11.0674643079
+本纪 9.25628675283
+韩爱平 13.2075304714
+姚欣 13.900677652
+低资费 13.2075304714
+石太 11.0103058941
+楚宗人 13.2075304714
+韦布 12.8020653633
+圣洛伦索 12.8020653633
+本线 13.900677652
+东奔西逃 13.900677652
+桥亭 13.2075304714
+光盘 9.69598503258
+本组 11.7034530746
+钱信忠 13.900677652
+几千本 13.2075304714
+风月场所 12.8020653633
+满含 10.4994802703
+人工混响 13.2075304714
+莫明 12.5143832909
+尉氏朱 13.2075304714
+割给 11.598092559
+心眼儿 9.44633035572
+六十五岁 11.598092559
+普宁寺 12.8020653633
+色楞格河 11.2616203224
+离群索居 11.8212361103
+无偿献血 12.1089181827
+联接器 13.900677652
+出版发行 10.2117981979
+超支 11.7034530746
+杂货 9.58318953844
+空翻多 10.4349417492
+畏光 11.9547675029
+欧家碧 13.2075304714
+石女 11.3357282945
+黔北 10.8561552143
+杂质 8.38724890581
+书刊杂志 13.900677652
+熊平 13.900677652
+爱财 11.9547675029
+汉满蒙 13.2075304714
+抵扣 10.4666904475
+插于 11.5027823792
+超收 13.900677652
+杂费 12.1089181827
+武郎 12.5143832909
+陈苏 11.7034530746
+导入到 12.8020653633
+韦康 12.8020653633
+土崩瓦解 9.89334446674
+特遣部队 11.598092559
+录音磁带 11.2616203224
+雏鸡 12.1089181827
+类似 5.97479733524
+成红 13.2075304714
+雏鸽 13.2075304714
+虞以泽 13.2075304714
+成约 11.4157710022
+畏冷 12.5143832909
+熊庆 13.900677652
+高渗 10.765183436
+乡长 9.21854642485
+史久镛 12.8020653633
+呢大衣 11.0674643079
+乡镇 8.25877058104
+父辈 9.77354326693
+沙鼠 10.9049453784
+缱绻 11.5027823792
+雏鸟 9.6811699468
+韦庄 11.5027823792
+锣鼓 8.77077893705
+檀道济 11.7034530746
+超时 11.5027823792
+毕加索 10.3453295905
+西服裙 13.2075304714
+这四名 12.2912397395
+周瑞媳妇 12.5143832909
+西拉 9.75754292558
+江苏人民出版社 11.9547675029
+萝卜干 12.5143832909
+做习题 13.2075304714
+互证 12.5143832909
+十一点左右 13.2075304714
+达乌德 11.8212361103
+后伊尹 13.2075304714
+高湖 13.900677652
+防潮 10.0088573539
+雏鹰 13.2075304714
+场依存性 13.2075304714
+利八世 10.8561552143
+桥下 9.43476953332
+桥上 9.65218240993
+井井有序 12.5143832909
+甜点 11.0103058941
+几千枚 12.8020653633
+桥东 12.1089181827
+成组 10.4994802703
+埃米 12.5143832909
+正丙醇 13.900677652
+左右两手 13.900677652
+插上 9.5062284973
+插下 12.8020653633
+杂豆 12.2912397395
+闻一闻 10.765183436
+临颖 11.5027823792
+类人 10.1630080337
+策士 12.8020653633
+宗靖康 13.2075304714
+高澄 12.2912397395
+想不到 7.11283266967
+过五关斩六将 11.9547675029
+孚众望 12.5143832909
+青铜器 8.48903160012
+沉沉入睡 11.8212361103
+石堆 11.0103058941
+控温 11.8212361103
+每个 5.81395973167
+摆摊子 11.5027823792
+釜底游魂 13.900677652
+一日万机 13.900677652
+垫步 13.900677652
+光电管 10.9562386728
+男配角 12.1089181827
+沃尔格林 13.900677652
+福州话 13.900677652
+尊师重教 12.8020653633
+张永强 13.900677652
+拨千斤 13.900677652
+谶书 12.8020653633
+朴素无华 11.9547675029
+刘无忌 13.2075304714
+石堡 13.900677652
+八十锭 12.8020653633
+闻风节 13.900677652
+烦渎 13.2075304714
+石堤 11.7034530746
+石塘 10.765183436
+高濂 12.5143832909
+庞将军 13.900677652
+副司令员 9.24671730182
+杂谈 11.8212361103
+同感 10.2897597393
+歪曲 9.27570483869
+石塔 10.1394775363
+临风 11.4157710022
+鱼际部 13.900677652
+刁柔 13.2075304714
+网上交易 8.66423568915
+古杰拉尔 13.900677652
+鲁公伯 13.900677652
+蒲包 12.5143832909
+加辅国 13.900677652
+破竹 11.7034530746
+港产 12.8020653633
+同职 13.900677652
+双汇集团 12.1089181827
+九百余里 13.900677652
+童星 12.1089181827
+锗石 13.900677652
+扇面 9.80633308975
+大礼议 11.4157710022
+无法可施 13.2075304714
+索尔福德 13.2075304714
+清闲 9.94943393339
+酸化 11.1280889297
+垫款 11.598092559
+奇险 10.3743171274
+甲虫 9.85762638414
+桑虫 13.900677652
+石墙 9.22784881751
+军火商 11.4157710022
+韦德 11.598092559
+石墓 11.7034530746
+彩饰 11.8212361103
+加里逊 13.2075304714
+先容 12.8020653633
+二次曲面 11.8212361103
+港九 11.9547675029
+核弹 10.0505300503
+成群 8.1641053545
+生态建设 10.642581114
+索然寡味 13.2075304714
+马尼拉麻 11.8212361103
+肯上 13.2075304714
+无风险 9.91169360541
+那曼生 13.2075304714
+谌颂 11.8212361103
+宫者 11.5027823792
+文件共享 13.2075304714
+沙鸡 10.8561552143
+埃索 12.5143832909
+沙鸥 12.2912397395
+每串 13.900677652
+公孙胜引 12.8020653633
+石墩 11.0103058941
+石墨 8.59240995457
+人民代表 10.7226238216
+孙寒冰 12.8020653633
+插住 11.7034530746
+阳三城 12.5143832909
+肥马轻裘 13.900677652
+不闻不问 10.0940151622
+王静斋 13.2075304714
+杨百业 10.604840786
+农家院 12.8020653633
+红光光 13.900677652
+桅杆 9.7898037878
+小慧子 12.1089181827
+萍踪 12.1089181827
+一千八百多块 13.2075304714
+科洛斯 13.900677652
+类书 9.96885201925
+恨铁不成钢 11.9547675029
+光着 9.15574552361
+石壁 8.75901409547
+矮短 13.900677652
+奇零 12.8020653633
+洗衣女工 13.2075304714
+破空 12.2912397395
+五个一工程 12.5143832909
+尔默 13.2075304714
+六小时 12.8020653633
+郭建光 12.5143832909
+押出 11.5027823792
+疯人 12.2912397395
+沙鹿 13.2075304714
+思想包袱 12.2912397395
+同胞 8.73019365694
+资金不足 9.87532596124
+南京市 8.7245279194
+类乎 13.2075304714
+危险废物 12.2912397395
+血痂 12.2912397395
+蜕化变质 11.4157710022
+竹叶青 10.8561552143
+壮汉 10.4041700905
+韦尼 11.598092559
+超杀 13.900677652
+高沛 12.2912397395
+乡音 10.3743171274
+归零 10.9562386728
+李洪志 13.900677652
+岗区 12.8020653633
+出纰漏 11.4157710022
+那是 6.30679980737
+规则性 11.598092559
+易宜曲 10.2117981979
+破禁 13.900677652
+歪斜 10.0294766411
+浇头 13.2075304714
+一万多名 11.8212361103
+一足 11.5027823792
+微服私访 10.642581114
+核岛 10.765183436
+爱车 9.5186510173
+埃纳 12.8020653633
+圣彼德堡 13.2075304714
+大官庄 11.9547675029
+失真度 13.900677652
+每一分 11.3357282945
+能见度 9.22784881751
+光电磁 13.2075304714
+不少名 13.900677652
+智亭山 9.44633035572
+石子 8.80081122415
+信阳县 11.7034530746
+陈芸 13.2075304714
+石孔 12.8020653633
+于横峰 12.8020653633
+超期 12.1089181827
+奇台县 13.2075304714
+宇绿岩 13.2075304714
+满嘴 9.56994431169
+酸值 12.5143832909
+连善一 13.900677652
+尖刀 9.33632946051
+高法 12.8020653633
+约成 13.2075304714
+陈皮梅 12.2912397395
+推论性 13.900677652
+寇幽州 13.2075304714
+复数的模 13.900677652
+威尼斯 8.30225569298
+高波 12.1089181827
+远未 10.0940151622
+去不成 10.4994802703
+杨侍郎 13.900677652
+白杨河 11.8212361103
+陈芳 11.2616203224
+艾南英 11.9547675029
+本系 11.1926274509
+埃维 13.2075304714
+石定 13.2075304714
+温禺 13.2075304714
+高氏 10.4349417492
+石宝 10.8561552143
+熊岛 13.2075304714
+永不言败 13.2075304714
+满园 10.8096351986
+鹿港 11.2616203224
+帮倒忙 11.9547675029
+操劳过度 11.4157710022
+高氟 12.1089181827
+爱过 10.0940151622
+许司令 12.8020653633
+藤制 12.8020653633
+山向东 12.8020653633
+光球 11.0103058941
+一二十页 12.8020653633
+汉苏武 13.900677652
+庆阳市 13.900677652
+锅汤 11.3357282945
+保护地 10.0088573539
+摺扇 11.9547675029
+石家 11.8212361103
+熊岳 13.2075304714
+石宫 13.900677652
+高永 13.900677652
+幸运之神 13.2075304714
+枕巾 11.3357282945
+修习之 13.900677652
+涂梢员 12.8020653633
+石宣 13.900677652
+爱之深 13.900677652
+阿基拉 13.2075304714
+目不交睫 13.2075304714
+石室 9.85762638414
+画荻教子 13.900677652
+好帮手 10.9049453784
+全职 11.0674643079
+监护人员 13.2075304714
+滋润霜 13.2075304714
+陈与郊 12.8020653633
+一个六七岁 12.5143832909
+票据法 11.7034530746
+件物品 11.1280889297
+税警 13.900677652
+爱辉 11.2616203224
+盘道 11.8212361103
+新批评 11.9547675029
+乙型肝炎 10.0940151622
+于取利 13.900677652
+畏友 12.8020653633
+时君世 13.2075304714
+狐媚 11.2616203224
+面如冠玉 12.2912397395
+奇闻 10.0088573539
+限速 10.0940151622
+高汤 12.8020653633
+甲藻 10.9562386728
+施加压力 9.65218240993
+忍耐住 11.598092559
+接腔 10.9562386728
+言尽意 13.2075304714
+贪墨成风 12.8020653633
+政绩观 12.8020653633
+奇门 10.642581114
+语文学家 12.2912397395
+书面资料 11.1280889297
+霍城 11.5027823792
+依违两可 12.8020653633
+沙鲁 12.8020653633
+破碗 11.1926274509
+闾领兵 13.2075304714
+光疗 12.1089181827
+扰流板 11.5027823792
+破碎 8.18036587537
+藤县 11.598092559
+妙龄少女 12.2912397395
+叔子 11.9547675029
+三三四四 13.900677652
+同船 12.8020653633
+莫敢 10.4666904475
+高涨 7.85094419674
+新城区 10.3171587135
+北直隶 10.4666904475
+朝天椒 11.5027823792
+孙朱允 13.2075304714
+藤原 11.4157710022
+受理费 12.1089181827
+邬中和 12.5143832909
+财务指标 9.7898037878
+福寿双全 11.9547675029
+修武县 11.1926274509
+粗加工 11.8212361103
+步罡踏斗 13.900677652
+窗口 7.39041931145
+自我吹嘘 12.2912397395
+点点头 6.69504247557
+碧影 13.900677652
+今蒙 10.8096351986
+盘里 11.1280889297
+道貌岸然 10.4041700905
+郝爱国 9.91169360541
+钩玄 12.8020653633
+满地 8.62256299275
+超星 13.2075304714
+生理功能 8.89004235788
+沙德利 11.9547675029
+全面铺开 10.9562386728
+入选 8.37124856446
+满场 11.1926274509
+独霸一方 12.8020653633
+朱红色 10.4666904475
+暑气 11.0674643079
+保护国 9.82314020807
+香酥鸡 12.5143832909
+萨特累 12.8020653633
+契斯 12.5143832909
+朱门绣户 13.900677652
+高淳 9.09665660724
+情人眼里出西施 12.2912397395
+高深 9.84023464143
+一二十首 12.8020653633
+高洋 10.9049453784
+隆庆 7.76079309975
+赋形 13.2075304714
+高洁 10.4994802703
+山大川 12.8020653633
+佣工 10.3453295905
+尼泊尔 8.6803218269
+公车管理 12.8020653633
+黄骅市 13.2075304714
+被害人 9.66657114738
+头七 13.2075304714
+炀帝 9.80633308975
+武术家 12.8020653633
+四五斗 13.2075304714
+新城县 12.2912397395
+世族 10.4666904475
+橘红 11.5027823792
+光电 8.02014466558
+沙田柚 11.0103058941
+光用 11.9547675029
+区域环境 12.2912397395
+肠蠕动 10.8561552143
+微软公司 11.1926274509
+白环俞 13.900677652
+艺术局 13.2075304714
+卓越贡献 9.7898037878
+古莱子 12.8020653633
+智愚 12.2912397395
+样样精通 12.2912397395
+工程质量 10.2630914922
+欲绝 10.642581114
+耦合度 13.900677652
+增殖 7.92432674268
+二十多公里 12.8020653633
+顾左右而言他 12.1089181827
+太不自量 13.900677652
+牵累到 13.900677652
+莫斗 13.900677652
+艺术展 11.2616203224
+橘络 12.5143832909
+高浓 12.5143832909
+绝缘线 12.8020653633
+交电 13.2075304714
+埃罗 12.5143832909
+酸冷 13.2075304714
+交由 9.01032852375
+历皇帝 13.2075304714
+五一回 12.8020653633
+汶上 12.1089181827
+莫斯 11.0674643079
+花点子 13.900677652
+韦州 12.1089181827
+雁石 12.2912397395
+满垒 13.900677652
+中央文明办 13.900677652
+有恒山 13.2075304714
+破案率 13.2075304714
+坡脚 12.1089181827
+徒劳地 11.8212361103
+保守主义 10.533381822
+尚富 12.8020653633
+融入 8.39941944143
+从从容容 11.7034530746
+传略 12.2912397395
+樊玉明 13.900677652
+鼠肚鸡肠 13.2075304714
+眉毛 7.86280673205
+十三名 11.8212361103
+易心莹 13.2075304714
+尔茨 12.5143832909
+雁栖 13.2075304714
+一男一女 9.62401153296
+刘长卿 11.9547675029
+朝圣地 13.2075304714
+玄德驱 13.2075304714
+建筑安全 13.900677652
+本报 7.30216862336
+甲子年 11.8212361103
+宏量 13.2075304714
+港口 6.66433830922
+坝基 11.0103058941
+正阳县 11.3357282945
+温服 12.1089181827
+军管会 11.598092559
+会受 10.0505300503
+上天入地 11.5027823792
+江东区 13.900677652
+要不然 8.56313957227
+宣官 10.5684731418
+解除戒严 13.900677652
+港台 10.4994802703
+向力 13.2075304714
+斯兰德 11.5027823792
+定向力 12.2912397395
+指法 10.3453295905
+萧淑慎 13.900677652
+克瑞斯 12.8020653633
+塔德 13.900677652
+成批 9.94943393339
+带笔 13.900677652
+大庾岭 10.4994802703
+尚宝 13.2075304714
+怨气满腹 13.2075304714
+余额 7.4439079964
+布大喜 12.8020653633
+传电 13.900677652
+孔藏布 13.900677652
+以天下为己任 11.2616203224
+布莱德 12.1089181827
+余颗 12.8020653633
+李嘉 12.1089181827
+甜水 11.9547675029
+尚宫 13.900677652
+言周瑜 12.2912397395
+胜会 12.5143832909
+批准文号 11.598092559
+尚容 11.598092559
+哈斯科 12.2912397395
+透视画法 13.900677652
+布莱得 11.7034530746
+类网络 13.2075304714
+李园 12.8020653633
+陈王庭 13.900677652
+本戏 12.1089181827
+重孙女 13.2075304714
+喝醉酒 10.8561552143
+强心针 11.1926274509
+塔影 12.8020653633
+兆赫兹 13.2075304714
+李固 10.9049453784
+今魏 12.8020653633
+尚存 8.60737282725
+李国 11.5027823792
+嚷声 12.8020653633
+南丹路 12.8020653633
+气愤愤 13.2075304714
+爱重 11.8212361103
+自愿互利 12.2912397395
+金丹独 13.2075304714
+瓜纳华托州 13.2075304714
+产卵洄游 11.5027823792
+安力满 9.18217878068
+徐管家 13.2075304714
+赋归 13.900677652
+幸得瞻 12.8020653633
+募穴 11.8212361103
+消光系数 13.2075304714
+何鲁之 13.2075304714
+初次见面 11.0674643079
+余项 10.4041700905
+卵巢癌 10.765183436
+白虎通 11.1926274509
+溶栓 12.2912397395
+真理性 11.4157710022
+裕民县 12.2912397395
+高爽 11.8212361103
+挟带 9.98865464655
+谢先生 11.3357282945
+高爵 12.8020653633
+沙草 11.7034530746
+插到 10.0720362555
+家传人诵 13.900677652
+本所 8.33233314821
+昔时 11.0103058941
+降落场 13.900677652
+尔菲 13.2075304714
+费尔斯曼 12.8020653633
+太宗纪 13.2075304714
+阴虚者 11.5027823792
+荞麦面 12.8020653633
+熟悉业务 11.8212361103
+未付 12.5143832909
+断层崖 11.1280889297
+昔日 7.82303540863
+冤枉钱 10.9562386728
+翠生生 13.900677652
+魏献温 12.8020653633
+官方论坛 13.2075304714
+白浪河 12.2912397395
+温某 13.900677652
+病苦 12.5143832909
+温柔 7.84389363875
+塔式 11.3357282945
+最靠近 11.1280889297
+一再说明 12.8020653633
+插刀 12.8020653633
+港区 9.03314320152
+奇诡 10.8096351986
+教育网 12.5143832909
+赵氏 9.98865464655
+垫着 10.4041700905
+元圆 11.7034530746
+偏在 10.9049453784
+草头天子 12.1089181827
+臭名昭著 10.8561552143
+武和鹿 13.2075304714
+桥口 12.2912397395
+插句 13.900677652
+异像 13.2075304714
+怨叹 13.900677652
+掏出 7.02338158048
+插口 10.1871055853
+嫁错 12.8020653633
+李四光 10.642581114
+尼亚尔 12.8020653633
+硕果 11.2616203224
+克莱门茨 13.2075304714
+张燕筑 13.2075304714
+光殿 11.8212361103
+学识渊博 10.2371160058
+不断改进 9.48183704418
+星战 13.2075304714
+沙芥 12.5143832909
+插叙 12.1089181827
+尼亚尼 11.598092559
+张爷 12.1089181827
+明公详 13.2075304714
+神棍 11.2616203224
+幸蒙赐 13.2075304714
+奉养父母 13.2075304714
+露馅儿 13.900677652
+文艺节目 12.1089181827
+东奔西走 11.7034530746
+仇十洲 12.8020653633
+插去 13.900677652
+深圳河 11.598092559
+莫笑 12.5143832909
+判然不同 13.2075304714
+沙苑 12.1089181827
+塔座 12.8020653633
+糙米 10.533381822
+乌斯曼 13.2075304714
+余首 9.87532596124
+传球 10.2117981979
+不告而辞 12.8020653633
+响彻 9.66657114738
+全胜 9.5062284973
+螺旋 8.2273543848
+洛斯 10.8561552143
+燕策 12.1089181827
+悬隔 12.8020653633
+起讫 11.3357282945
+阳强易 13.900677652
+胎膜 11.4157710022
+找准 10.0294766411
+牛王闻 12.5143832909
+童稚 11.8212361103
+高珲 13.900677652
+培训部 11.9547675029
+迷朦 13.2075304714
+疯到 13.900677652
+时永昌 13.2075304714
+脑干 9.84023464143
+海水浴 13.2075304714
+适得其反 9.85762638414
+田再易 13.2075304714
+童童 12.1089181827
+苏达米 13.900677652
+分析师 5.76650337984
+李培 13.900677652
+尼亚岛 13.900677652
+插卡 13.900677652
+特定人物 13.900677652
+类别 8.2273543848
+工作预案 11.8212361103
+西门子公司 11.7034530746
+任何 5.08456575618
+成排 10.765183436
+童立 13.900677652
+用之于民 11.4157710022
+有志于 10.4041700905
+代善伯 13.900677652
+漆高柱 13.2075304714
+温暖 7.01824018098
+沙船 11.7034530746
+合作开发 9.80633308975
+文化名人 9.91169360541
+任陇西 13.2075304714
+一时之选 12.8020653633
+鲍参军 13.2075304714
+和晓霞 9.96885201925
+专项基金 10.9562386728
+甲骨 9.4233408375
+文官考试 12.5143832909
+玩艺儿 9.58318953844
+李雅普 12.5143832909
+痕迹 7.69208762588
+廉价地 13.2075304714
+抱持 11.4157710022
+破晓 10.8561552143
+交款 11.8212361103
+克洛诺斯 13.2075304714
+大后天 12.2912397395
+莫管 10.9562386728
+香干 12.8020653633
+概率密度函数 12.1089181827
+斜方形 11.7034530746
+德尔海 12.5143832909
+东奔西跑 11.7034530746
+彼得格勒 10.0294766411
+塔帕 11.4157710022
+夹下来 13.900677652
+芬兰国防军 12.8020653633
+甜润 11.7034530746
+尔苏 12.8020653633
+墨尔本大学 12.2912397395
+快餐馆 12.5143832909
+港制 13.900677652
+小沙弥 10.7226238216
+兵团 7.62968922012
+儋州市 11.9547675029
+塔布 10.9049453784
+光武 10.604840786
+高炉 9.4233408375
+超等 12.5143832909
+病者 10.765183436
+塔巴 11.9547675029
+走马观花 11.1280889297
+私有地 13.900677652
+明公裁 13.2075304714
+宇宙线 10.0088573539
+轩词甲 12.8020653633
+成性 9.66657114738
+绑带 12.5143832909
+一万三千五百斤 12.5143832909
+龙符 10.1630080337
+香饽饽 10.7226238216
+监禁 8.60236028543
+时甲科 13.2075304714
+纳绥尔 13.2075304714
+高炮 9.14708746087
+增白 11.1280889297
+派驻在 13.2075304714
+奥蒂斯 13.2075304714
+白变红 13.2075304714
+未亡 11.9547675029
+渠道 6.39628609281
+彩蛋 11.9547675029
+位高权重 11.1926274509
+乡试 8.9519177616
+真理报 10.6818018271
+田艺蘅 13.2075304714
+子程序 12.2912397395
+偏向 8.5440913773
+尔腾 12.1089181827
+生辰 9.65218240993
+异搏定 12.8020653633
+祝捷大会 13.2075304714
+锅炉 8.52539924429
+明郑晓 13.2075304714
+药丸子 12.8020653633
+港内 10.0505300503
+共同体 8.44109213783
+独行其是 11.9547675029
+靠山 8.94485059437
+光棍 9.59661255877
+语气助词 13.900677652
+罗唣 11.598092559
+万乘 11.9547675029
+科学馆 11.9547675029
+谢康乐 13.2075304714
+李吉 11.0103058941
+斯克至 13.900677652
+万箭齐 13.900677652
+虾片 13.2075304714
+章开沅 11.598092559
+高热 8.97342396682
+传看 11.9547675029
+望慈悯 13.2075304714
+专业分工 11.9547675029
+高烧 9.17328983326
+不分首从 12.5143832909
+封客氏 12.8020653633
+李君 11.2616203224
+本想 8.52078029844
+戒严时期 13.900677652
+马口铁 11.598092559
+破旧 8.80081122415
+秦相邦 13.2075304714
+温故 13.2075304714
+传真 9.10488710638
+马若瑟 13.900677652
+彩虹 9.23723855786
+挺括 11.3357282945
+沙脊 12.2912397395
+杨世光 10.0294766411
+痛苦不堪 10.533381822
+小英子 11.2616203224
+宫腔 10.8096351986
+港元 7.61467955747
+李哥 8.96620371885
+杀青 11.2616203224
+伊斯哈 12.8020653633
+增益 10.2897597393
+冯德培 13.2075304714
+暇时 12.8020653633
+共轭体系 11.8212361103
+李哲 13.2075304714
+光栅 10.2630914922
+光标 10.9049453784
+本性 8.30969067146
+同龄 10.0294766411
+斗牛场 12.1089181827
+垄断者 11.9547675029
+几千种 12.2912397395
+生产队长 10.9049453784
+重孙子 11.7034530746
+录取线 13.2075304714
+周教授 12.8020653633
+信号强度 12.2912397395
+定州市 11.598092559
+每一件 10.0505300503
+嘉尚 13.900677652
+山光水 13.900677652
+遛早 13.900677652
+红线女 12.8020653633
+落下去 9.93038573842
+盘谷 12.2912397395
+温文 12.1089181827
+魏博 11.1926274509
+德尔湖 13.900677652
+插值 11.0103058941
+田闻声 12.2912397395
+出版部门 12.1089181827
+乐陵市 13.900677652
+衬衫面料 12.8020653633
+温旨 13.900677652
+奇观 8.73589167805
+助动车 13.900677652
+电子光谱 13.2075304714
+历史主义 11.0103058941
+直系 8.70772080109
+报载 12.1089181827
+良马 10.8561552143
+李咏 11.598092559
+资格考试 12.5143832909
+本息 9.54396882529
+学杂费 10.9562386728
+兴文县 12.5143832909
+只忍 13.900677652
+收视率 10.6818018271
+重重难关 13.2075304714
+一千三百文 13.2075304714
+侄媳妇 11.4157710022
+山难容 13.2075304714
+霍地 9.48183704418
+八段锦 11.2616203224
+帕麦尔 12.8020653633
+指名道姓 11.598092559
+直觉主义 11.0674643079
+跑的快 12.5143832909
+推进机 12.8020653633
+阿囡 11.5027823792
+谓何 12.8020653633
+住院手续 12.5143832909
+家庭治疗 13.900677652
+冷火消 13.900677652
+三四次 10.765183436
+高士廉 12.2912397395
+十三场 13.900677652
+木芙蓉 11.9547675029
+乌尔纳姆 13.2075304714
+集成系统 13.2075304714
+殡殓 11.8212361103
+张小泉 12.1089181827
+杉晋作 12.1089181827
+泥工 13.900677652
+任首辅 9.7898037878
+纳马 13.2075304714
+千余种 11.598092559
+不差上下 13.900677652
+金小玉 13.2075304714
+小玩艺 11.8212361103
+胡道静 13.2075304714
+黄金市场 8.78268383956
+副经理 9.89334446674
+分久必合 11.9547675029
+桂圆肉 12.8020653633
+皮亚季 12.8020653633
+松秀 12.5143832909
+沙湾镇 12.8020653633
+教育系 11.8212361103
+贝祖著 13.900677652
+太宗素 12.8020653633
+资金量 8.42421410004
+美国华盛顿大学 12.5143832909
+驴儿 12.8020653633
+高燮 12.8020653633
+三四步 13.2075304714
+僵固 13.2075304714
+矫形外科 12.8020653633
+戈伦 12.8020653633
+武进 10.1871055853
+高燥 11.8212361103
+俯瞰 9.98865464655
+外语翻译 13.900677652
+李唐 10.642581114
+纸马 10.5684731418
+战场 6.62550533252
+约翰 8.11993413618
+可更新资源 12.5143832909
+苯甲基 11.9547675029
+本意 8.75318317516
+李嗣 13.2075304714
+悲惨世界 11.2616203224
+利国福民 13.900677652
+彩蝶 11.2616203224
+东征中 12.8020653633
+莫科 13.900677652
+陋习 10.4994802703
+泥巴 9.61021821083
+麻阳话 13.2075304714
+洛衫矶 13.900677652
+暑热 10.3743171274
+深圳湾 11.9547675029
+五壮士 11.8212361103
+充沛 7.98988100794
+三般两样 13.900677652
+第七十七回 12.2912397395
+实际效果 10.4994802703
+洋银 12.8020653633
+相并 12.1089181827
+盘账 12.8020653633
+盘货 13.900677652
+变生不测 12.8020653633
+过夜 9.06439574502
+市直机关 11.5027823792
+性支出 11.0674643079
+本愿 11.7034530746
+奇袭 9.5186510173
+费奥多罗夫 13.2075304714
+滁县 11.598092559
+塔尼 11.8212361103
+伯姆 11.7034530746
+牟平县 12.8020653633
+润肺 10.1164880181
+白色恐怖 10.6818018271
+润肠 10.2630914922
+层次性 12.1089181827
+奇装 13.900677652
+夏普公司 12.8020653633
+润肤 10.6818018271
+寇恂 12.8020653633
+缉私队 11.8212361103
+燕秦 13.2075304714
+烦热 11.2616203224
+限购 12.1089181827
+漫天讨价 13.2075304714
+军律 10.533381822
+从缓 11.598092559
+尚堪 11.8212361103
+军魂 13.900677652
+塔尖 11.1926274509
+阿布扎比酋长国 13.900677652
+螺杆 11.598092559
+交椅 9.20932976975
+李善 12.2912397395
+高照 10.8561552143
+被保护人 13.900677652
+永定门 11.2616203224
+酰胺 9.84023464143
+赵石头 13.900677652
+东征之 10.9049453784
+点秋香 11.7034530746
+盘起 12.5143832909
+实名 9.45802639549
+稻壳 10.8096351986
+港城 12.5143832909
+一万多个 12.2912397395
+垫片 13.2075304714
+光溜 13.2075304714
+瞄准镜 9.27570483869
+尝尝 8.75318317516
+光源 8.52539924429
+插图 8.67493097826
+弓纵马 13.2075304714
+一万多两 11.8212361103
+皮戈列 13.2075304714
+目测 10.642581114
+锅盔 10.8096351986
+颇重 11.5027823792
+尚志 11.2616203224
+管寻 13.2075304714
+网师园 11.9547675029
+三合会 11.5027823792
+四五百里 12.8020653633
+图腾 9.16447920358
+覆盖物 11.5027823792
+太老爷 12.8020653633
+木托 11.9547675029
+僵冷 11.8212361103
+港埠 10.9562386728
+九三学社中央 11.5027823792
+分析家 10.7226238216
+成昆 10.7226238216
+类型 5.71477017049
+软木板 13.900677652
+瞪起来 11.9547675029
+成昌 12.5143832909
+溶沟 12.2912397395
+因势利导 10.4349417492
+敲着 12.2912397395
+程长庚 11.3357282945
+成智 12.8020653633
+尚待 9.21854642485
+一时之间 10.0294766411
+填平补齐 12.8020653633
+高盛 7.9817837977
+挟嫌 12.1089181827
+正式工 11.3357282945
+脑室 10.4041700905
+侍卫长 12.2912397395
+掘墓 10.6818018271
+痴汉 11.8212361103
+笃深 12.8020653633
+左右两端 12.5143832909
+转化成 8.77671367257
+杜正贤 11.3357282945
+柔中带刚 12.5143832909
+杂锦 13.2075304714
+系主任 8.2985588311
+宏图 9.84023464143
+半圆形 9.63799777493
+延安路 11.2616203224
+言无忌 13.900677652
+合资经营 11.1280889297
+互济会 13.900677652
+止泻 10.4666904475
+存款单 11.7034530746
+武装 7.05373451239
+宣导 12.8020653633
+产品价格 8.20023407859
+尚德 10.4994802703
+朱纯臣 12.8020653633
+毛海峰 13.900677652
+旅游名县 13.900677652
+美韩 11.7034530746
+映照在 12.2912397395
+莫绍 13.2075304714
+行使职权 10.533381822
+杰克逊 9.96885201925
+通信团 11.8212361103
+溶水 13.2075304714
+过克捷 13.2075304714
+星孔明 12.1089181827
+歪曲事实 10.642581114
+老调子 12.2912397395
+格尔木机场 13.2075304714
+卢泰愚 12.1089181827
+偏劳 12.1089181827
+温控 11.598092559
+宋孝宗 9.94943393339
+李勉 11.1280889297
+白眉赤眼 13.900677652
+克勤克俭 12.8020653633
+第三十六 12.8020653633
+本是 7.71652876104
+高瘦 12.1089181827
+高士奇 13.900677652
+李勇 11.0674643079
+投资人 7.36253782821
+太宗立 13.2075304714
+夜盲症 10.8561552143
+蒋联 12.2912397395
+主极大 12.8020653633
+李勒 13.900677652
+国际足联 10.533381822
+插嘴 8.84443184663
+观者 10.3171587135
+侧翼 9.98865464655
+含钙量 12.5143832909
+乡贤 13.2075304714
+误称 12.8020653633
+线性关系 10.3743171274
+恼人 11.0103058941
+通进 12.5143832909
+好听话 11.8212361103
+武衡 12.8020653633
+活鲜 12.8020653633
+成家立业 11.0674643079
+交游 10.1630080337
+飘起来 11.1280889297
+班迪教 12.2912397395
+时代感 10.4666904475
+光电催化 13.900677652
+涛声 10.9049453784
+枪榴弹 10.4994802703
+佩思 12.8020653633
+寇松 12.1089181827
+小树枝 11.9547675029
+宰牲节 11.2616203224
+奇迹 7.75434839431
+坝区 10.9562386728
+莫纳 11.598092559
+高登 11.0674643079
+李力 11.0674643079
+神神道道 12.5143832909
+圆筒状 10.533381822
+武行 11.8212361103
+分类者 13.900677652
+甜梨 13.2075304714
+液汁 11.0674643079
+焊丝 13.2075304714
+李承乾 13.900677652
+李卫 11.5027823792
+一八二六年 13.900677652
+接骨 11.9547675029
+焖牛肉 13.2075304714
+埃文 12.2912397395
+传灯 12.5143832909
+不外借 12.8020653633
+情感故事 12.8020653633
+溶液 7.56739802384
+登到 13.2075304714
+莫罗 11.7034530746
+警觉性 12.2912397395
+桥基 12.2912397395
+动物化石 10.3171587135
+沙蚕 11.4157710022
+成本 5.78098139902
+赵宝刚 13.900677652
+滴虫病 13.2075304714
+埃斯 11.1280889297
+李华 10.4666904475
+李十 12.5143832909
+蛋白粉 11.3357282945
+邬中 8.55357012126
+谨呈 13.900677652
+李升 13.900677652
+李博 13.900677652
+机械振动 10.765183436
+都卫 12.2912397395
+淡蓝色 10.2371160058
+晕头晕脑 13.900677652
+偏北 9.33632946051
+三合一 10.8096351986
+稼轩 10.642581114
+寿辉传 13.2075304714
+三四流 13.2075304714
+十余辆 12.8020653633
+甜椒 12.8020653633
+记忆犹新 9.84023464143
+背包带 12.5143832909
+专用发票 12.8020653633
+筛除 13.2075304714
+杨秀眉 13.2075304714
+盲动主义 11.4157710022
+出奔 10.0088573539
+盘诘 11.0674643079
+奇蹄 11.4157710022
+尚应 12.5143832909
+小宝妈 13.2075304714
+公诉方 12.8020653633
+公民院 13.900677652
+兵临城下 10.2371160058
+高矮 10.6818018271
+诱敌深入 11.3357282945
+桥型 12.5143832909
+于高丽 11.598092559
+弹幕 12.5143832909
+沪军 12.2912397395
+索多玛 13.900677652
+五道口 13.900677652
+菡萏 12.1089181827
+高知 12.1089181827
+寿山公园 13.900677652
+武观 12.8020653633
+柯沙里 12.5143832909
+民族宗教 11.1926274509
+明爱芬 9.74179456862
+陀螺 9.59661255877
+日丹诺 12.1089181827
+万余公里 11.7034530746
+木渎镇 12.5143832909
+高看 11.2616203224
+滥伐 10.8096351986
+阿尔文号 13.2075304714
+胡小姐 13.2075304714
+破戒 11.9547675029
+痕记 13.900677652
+本月 6.89761219319
+传热 9.85762638414
+偏去 12.5143832909
+本期 7.77380846786
+李右 12.1089181827
+幸福之路 13.2075304714
+秃笔 11.9547675029
+仇夷 11.7034530746
+凯丽 13.900677652
+偏压 13.2075304714
+成林 10.4666904475
+民间性 12.8020653633
+偏历 13.2075304714
+本本 10.6818018271
+本末 10.0940151622
+成果 6.71302048786
+尚幼 11.598092559
+五六寸 13.2075304714
+少荃 11.1926274509
+生死观 13.900677652
+甜槠 11.1926274509
+夫妇俩 10.533381822
+屯里 11.9547675029
+本机 12.8020653633
+撕掉 10.4041700905
+同题 13.2075304714
+从谏如流 10.9049453784
+小窍门 12.1089181827
+尚师 13.2075304714
+覆盖率 7.82303540863
+高着 13.900677652
+银翘散 11.3357282945
+余千克 12.2912397395
+接驾 9.45802639549
+将功赎罪 11.598092559
+本村 9.12155415886
+技工学校 11.1280889297
+新年好 13.900677652
+偏右 12.8020653633
+接驳 12.8020653633
+临泽县 13.2075304714
+爱钱 11.8212361103
+万寿果 13.900677652
+本来 5.74302063678
+本条 12.2912397395
+乡谈 11.9547675029
+晋少詹 13.2075304714
+乡谊 11.4157710022
+掌修夏 12.8020653633
+控盘 10.3453295905
+小鸡鸡 11.7034530746
+菲尔德 9.85762638414
+超精 13.900677652
+鲁里亚 11.2616203224
+资金面 7.20240959786
+都兰县 11.8212361103
+海瓜子 13.900677652
+蒲老板 10.2371160058
+塞伊汉 13.900677652
+描述语言 12.5143832909
+乐大娘子 11.8212361103
+控申 13.900677652
+心心相印 10.642581114
+爱静 12.8020653633
+殉道 11.9547675029
+李健 10.8096351986
+李佳薇 13.900677652
+鹿皮 10.4994802703
+蒋英 12.2912397395
+合众国 10.533381822
+溶溶 11.3357282945
+一半摊 12.8020653633
+罗波夫 11.1280889297
+异交 11.9547675029
+十三分 13.900677652
+卫道士 13.2075304714
+迅雷风烈 13.2075304714
+吕后之 12.5143832909
+杂面 11.0103058941
+入海口 9.63799777493
+汉至唐 11.598092559
+安托瓦 13.900677652
+明廷特 13.2075304714
+一得之见 12.8020653633
+数据抽象 13.2075304714
+奋发图强 11.0674643079
+偏倚 13.2075304714
+新颖性 12.5143832909
+美洲驼 11.9547675029
+塔姆 11.7034530746
+严加管教 12.2912397395
+交法 13.900677652
+偏倒 12.5143832909
+八十万两 11.4157710022
+李倩 12.8020653633
+余音袅袅 12.1089181827
+彩花 13.900677652
+体育新闻 12.5143832909
+螺髻山 12.5143832909
+约稿 11.9547675029
+巴塔 11.5027823792
+充水 13.2075304714
+通用机 12.8020653633
+脚动 12.8020653633
+怫然不悦 13.2075304714
+新汴河 11.5027823792
+自然哲学 9.94943393339
+交河 10.4666904475
+偏偏 7.43297892587
+抽油烟机 12.5143832909
+光泽 7.87239913175
+倾向性 10.1871055853
+管理对象 12.2912397395
+中国书法家协会 11.5027823792
+满上 11.5027823792
+范钦臣 12.8020653633
+唐景福 12.8020653633
+副部长 7.84858848305
+球蛋白 9.33632946051
+政界人士 12.1089181827
+光波 9.03314320152
+心动不已 12.2912397395
+大老爷们儿 12.5143832909
+谷深流 12.5143832909
+恋父 12.5143832909
+普颜笃 13.2075304714
+保护伞 10.0505300503
+宁陕镇 12.8020653633
+第欧根尼 13.900677652
+港商 10.1164880181
+僵化 9.56994431169
+光气 11.0103058941
+克莱门蒂 12.2912397395
+后静静 13.2075304714
+云生 11.8212361103
+教育社 10.9562386728
+坡顶 11.5027823792
+太行山麓 11.5027823792
+九年制 11.598092559
+由监生 12.8020653633
+莱阳市 12.1089181827
+路为旭 13.2075304714
+孕穗期 12.8020653633
+交汇 8.89004235788
+适应期 12.8020653633
+首创股份 11.3357282945
+陶明器 13.2075304714
+满仓 9.44633035572
+奇趣 11.8212361103
+观色 13.2075304714
+杂音 10.4349417492
+尔薇 13.900677652
+文理学院 10.8561552143
+利涉 11.5027823792
+津门 11.5027823792
+水文情势 12.5143832909
+郑州市政府 9.58318953844
+小宝娘 13.2075304714
+人口迁移 10.8561552143
+马大中 11.2616203224
+松松束 13.900677652
+偏僻 8.90346537821
+塔夫 12.1089181827
+橘柑 13.900677652
+深度加工 11.9547675029
+王大牛 10.9049453784
+杨桦林 12.8020653633
+童心未泯 12.5143832909
+少耕 12.8020653633
+西沙 9.7898037878
+雁滩 13.900677652
+超群 9.84023464143
+居功自满 13.900677652
+一声春雷 12.8020653633
+玄宫 10.8096351986
+满于 12.5143832909
+蒋舒 10.0720362555
+立功喜报 13.2075304714
+明主 10.4041700905
+猎艳 13.900677652
+林散之 12.5143832909
+辛兴宗 10.3743171274
+本体论 10.0294766411
+四叶 11.8212361103
+第一百六十四条 12.1089181827
+喝血 11.598092559
+李全 11.4157710022
+本文 7.64492761022
+阳澄湖 11.2616203224
+黄宏嘉 13.2075304714
+李公 10.5684731418
+王伦笑 13.2075304714
+扇贝 10.1164880181
+靠天 11.5027823792
+杂陈 11.3357282945
+本斋 13.900677652
+交淡 13.900677652
+临别时 11.1280889297
+山西省军区 13.900677652
+一茬 10.0505300503
+公输子 13.2075304714
+几千米 10.1164880181
+观形察色 13.900677652
+奇谋 11.3357282945
+李兵 13.900677652
+温性 10.9562386728
+记叙文 12.5143832909
+烦琐 10.533381822
+电子科技 11.2616203224
+李克 9.34680076038
+奇谲 13.2075304714
+杂院 13.900677652
+天露山 12.8020653633
+监督站 10.8096351986
+鹊起 12.5143832909
+李兄 11.598092559
+百宝箱 12.2912397395
+控球 12.5143832909
+内心世界 9.7898037878
+霍利节 13.900677652
+八十顷 13.2075304714
+同时对比 13.900677652
+光润 10.4666904475
+成数 10.3171587135
+浪潮集团 13.2075304714
+萍钢 12.5143832909
+秃秃 12.1089181827
+本族 9.87532596124
+生活糜烂 13.900677652
+安努 12.8020653633
+小宝宝 10.8561552143
+那琼英 12.8020653633
+林州市 10.3743171274
+疑问号 13.2075304714
+感谢您 10.2630914922
+塔墩 12.5143832909
+驴唇 13.900677652
+仇富 12.2912397395
+偏关 11.5027823792
+曲突徙薪 12.8020653633
+万籁俱寂 10.3743171274
+本日 11.9547675029
+沙蓬 12.2912397395
+偏光 11.5027823792
+交涉 8.45394028031
+投其所好 10.765183436
+西沃 11.1926274509
+十三卷 11.9547675029
+成教 13.2075304714
+渤海湾 9.32596667347
+保护价 11.8212361103
+本旨 11.9547675029
+雁潮 12.5143832909
+由庆亲王 12.8020653633
+寿山福海 13.2075304714
+资本积累 9.45802639549
+少销 13.900677652
+李儒 10.8096351986
+山观操 13.2075304714
+开发成本 10.604840786
+一举一动 9.24671730182
+韦后临 12.8020653633
+金牛岭 12.8020653633
+寸进 12.5143832909
+岩相 10.604840786
+莱格尼察 13.2075304714
+尽收眼底 10.3743171274
+万乘之尊 11.3357282945
+超细 12.2912397395
+李凤 12.5143832909
+九十里 11.7034530746
+僮仆 10.765183436
+万人 6.44364556285
+谢甫琴 12.5143832909
+尚属 9.46986085313
+膝盖 8.24818847171
+因祸得福 11.7034530746
+弘明集 12.2912397395
+光洁 9.37888907493
+马其诺 11.7034530746
+孙建国 13.2075304714
+稻子 10.8561552143
+李凌 10.4041700905
+出阁 9.98865464655
+回禄 12.8020653633
+钢绞线 11.8212361103
+绑定 10.2630914922
+同进同出 13.2075304714
+李准 10.604840786
+交流 6.78185140291
+成文 10.0720362555
+十二月份 13.2075304714
+一孔之见 12.8020653633
+蔡福便 13.900677652
+高田 13.900677652
+尔蒂 13.2075304714
+判若云泥 12.5143832909
+王永昌 13.2075304714
+赵炅制造 13.2075304714
+十三发 13.2075304714
+性能优越 11.2616203224
+大力开展 10.4994802703
+十恶不赦 10.4994802703
+骨外膜 13.2075304714
+武警 9.72629038208
+成日 11.2616203224
+李冰 10.2630914922
+开采量 10.4994802703
+还情 12.8020653633
+闭幕式 10.9049453784
+李冶 12.1089181827
+超纯 11.9547675029
+频率响应 11.5027823792
+康佳集团 13.900677652
+免费赠品 13.2075304714
+玉屑 12.5143832909
+约简 13.900677652
+李军 10.533381822
+十三只 13.900677652
+温情 9.46986085313
+纳麦 13.2075304714
+同高 10.4994802703
+奔回来 12.1089181827
+洪九老 12.5143832909
+塔基 10.765183436
+原则上 8.25523075433
+王昆松 13.2075304714
+埃梅 12.8020653633
+加尔赫峰 12.8020653633
+性丑闻 12.5143832909
+马德普拉塔 12.2912397395
+祭奠仪式 12.1089181827
+李广 10.2371160058
+淠史杭 11.0103058941
+西戎州 13.2075304714
+万人次 8.66423568915
+马兄弟 12.8020653633
+葵扇 11.0103058941
+疯子 8.69119149913
+触毛 12.8020653633
+余部 8.63281949291
+劳动工资 11.3357282945
+尚可 8.85725253506
+沁入 11.4157710022
+人身险 11.8212361103
+英国上院 13.900677652
+可纠正 12.8020653633
+约瑟 11.0103058941
+塔城 9.84023464143
+议论 7.03687426052
+金万昌 12.5143832909
+脱氧核糖 11.5027823792
+莫特 12.2912397395
+奥杜瓦 13.2075304714
+老五 10.533381822
+高立 13.2075304714
+帕萨尔格 12.8020653633
+累赘 9.62401153296
+折光率 12.8020653633
+褒曼 12.5143832909
+浮梁 11.4157710022
+奥尼达 13.2075304714
+公共信息 11.8212361103
+水晶灯 13.900677652
+计取 12.1089181827
+史传 10.642581114
+同长 12.8020653633
+十三层 11.1926274509
+李师 12.8020653633
+李希 11.1926274509
+埃森 11.0674643079
+尤素福 12.5143832909
+之醒 13.900677652
+修治丹 12.5143832909
+华力西 9.55687223012
+自建房 11.3357282945
+技术开发 9.82314020807
+南浔 11.5027823792
+抢饭碗 13.900677652
+栗栗危惧 13.2075304714
+考索 13.2075304714
+农家菜 13.900677652
+交投 8.18036587537
+科尔沁右翼中旗 13.2075304714
+议请 12.8020653633
+那颗丹 13.900677652
+高程 8.64840422393
+独户住宅 13.900677652
+喧叫 13.900677652
+偏旁部首 13.900677652
+大慈大悲 10.5684731418
+溶性 9.98865464655
+谢巴尼 13.900677652
+胎衣 12.2912397395
+白肩雕 12.5143832909
+清华大学生物系 13.900677652
+董存瑞 11.4157710022
+分体式 12.2912397395
+李建 10.2630914922
+控管 12.1089181827
+操贱业 13.900677652
+鹿砦 12.1089181827
+水花四溅 12.8020653633
+相待 8.44535653662
+纳采 12.5143832909
+卢德铭 12.8020653633
+李延 8.21031819765
+偏序 13.900677652
+东风路 9.91169360541
+索拿 13.900677652
+凌雪妍 10.9562386728
+观象 12.8020653633
+奇莱 13.900677652
+取指令 12.5143832909
+样本均值 12.2912397395
+浮桥 9.24671730182
+陷溺 11.8212361103
+偏废 11.9547675029
+交托 11.9547675029
+格尔利 13.900677652
+于营子 13.2075304714
+日诗云 13.2075304714
+李庭 12.1089181827
+南浦 11.0103058941
+健康证 12.5143832909
+枯枝败叶 11.7034530746
+同门 10.3453295905
+浮标 9.85762638414
+交房 9.7898037878
+尔语 12.1089181827
+肩起 13.2075304714
+刀形天线 13.900677652
+吻合效应 13.900677652
+请调 13.2075304714
+凶犯 11.1926274509
+西五路 13.900677652
+李康 10.7226238216
+体育设施 11.0103058941
+中国京剧 9.85762638414
+毛冬青 13.900677652
+首尾相应 12.8020653633
+老营盘 12.8020653633
+碎小 13.2075304714
+冈峦起伏 12.8020653633
+临走 9.29550746599
+高空 7.95003509939
+消息人士 8.75901409547
+机器厂 10.765183436
+交战 7.88452049228
+阿巴德 12.5143832909
+猪舍 13.2075304714
+包产到户 11.1926274509
+花榈木 11.598092559
+垫纸 13.900677652
+李应 9.37888907493
+太宗皇 13.900677652
+德尔斐 11.8212361103
+信宜县 11.7034530746
+李彪 12.1089181827
+李彬 11.598092559
+余里 10.7226238216
+马鞍山钢铁公司 12.2912397395
+作怪 9.07236391467
+尚勇 12.5143832909
+驴子 9.12155415886
+偷鸡摸狗 10.765183436
+温温 12.2912397395
+宝位 12.8020653633
+约略 10.2117981979
+爱女人 12.2912397395
+橘树 12.5143832909
+浇下 12.1089181827
+破溃 10.4994802703
+水产学校 12.8020653633
+拘人 13.900677652
+西装革履 10.604840786
+渠魁 11.8212361103
+感人至深 11.1926274509
+政企不分 11.7034530746
+群发短信 13.2075304714
+丁东 12.5143832909
+马约尔 12.5143832909
+橘核 13.900677652
+本段 11.0674643079
+金兀术 11.3357282945
+公子嘉 13.2075304714
+血本无归 9.89334446674
+喜按 12.2912397395
+一天星斗 12.5143832909
+杂项 11.3357282945
+光控 12.5143832909
+汉献帝 10.1630080337
+乌斯满 13.900677652
+纳速 12.5143832909
+温湿 10.1630080337
+张邱建 13.2075304714
+交接 8.66423568915
+喷涂机 13.900677652
+李弥 13.900677652
+坦克车 11.2616203224
+批判主义 11.0674643079
+魏文侯 10.3171587135
+李强 8.95903522937
+尚功 12.1089181827
+武藤 12.2912397395
+饯送 13.900677652
+矜重 13.2075304714
+报名处 11.7034530746
+军训课 12.5143832909
+朝天罐 13.900677652
+李异 12.8020653633
+专用机 12.8020653633
+鹿科 10.9562386728
+阮忠 12.2912397395
+调色刀 13.2075304714
+教学效果 11.9547675029
+暴雨如注 12.1089181827
+冯德尔 13.2075304714
+同慧英 11.2616203224
+彩超 12.1089181827
+一个巴掌拍不响 11.5027823792
+武藏 12.5143832909
+董仲舒 9.69598503258
+没一搭 11.4157710022
+李忠 9.36807815882
+靠垫 10.9562386728
+观赏 8.11071748108
+交换 6.61654284578
+诺曼人 10.4666904475
+众望所归 10.642581114
+乔答摩 12.1089181827
+赞美诗集 13.900677652
+冯一俊 12.8020653633
+塔器 13.2075304714
+柳浪闻莺 12.2912397395
+车体广告 13.900677652
+杂食 11.1926274509
+李念 12.2912397395
+观赛 13.900677652
+插孔 13.2075304714
+虚提 13.2075304714
+僵尸 8.0746775446
+地下铁道 9.69598503258
+裘特 12.5143832909
+燕王 9.29550746599
+本款 13.2075304714
+桥孔 13.2075304714
+宋恭帝 11.8212361103
+白鹿矶 12.8020653633
+五官科 11.8212361103
+李志 10.5684731418
+去伪存真 11.7034530746
+未作 9.5186510173
+甘必大 12.2912397395
+不能取消 12.8020653633
+水稻所 12.8020653633
+带薪休假 12.5143832909
+承想 12.5143832909
+四五十斤 12.5143832909
+口水战 11.0103058941
+举兵 9.05649056552
+小动作 10.642581114
+特鲁斯 12.5143832909
+希门尼斯 12.1089181827
+可也没 11.5027823792
+肖家窑 13.2075304714
+地学家 12.5143832909
+高筒 12.1089181827
+尼龙丝 11.1280889297
+高筑 11.3357282945
+僵局 9.54396882529
+毗昙 11.7034530746
+李德 10.4349417492
+现实意义 9.62401153296
+尚利 13.900677652
+杏黄 10.0088573539
+独夫民贼 12.2912397395
+分析器 11.598092559
+方有生 13.900677652
+尝出 12.2912397395
+乔瓦尼 12.2912397395
+生理学 8.39128931535
+姚维 13.900677652
+酒店业 11.0674643079
+兵贵神速 10.9049453784
+关老爷 11.8212361103
+玩儿不转 12.5143832909
+无技可施 13.900677652
+趋肤效应 13.900677652
+资金额 9.93038573842
+成核 11.8212361103
+破涕 12.2912397395
+讲授法 13.900677652
+戴立狄 13.900677652
+依赖于 8.14810501315
+疔疮 10.9049453784
+十五间 13.900677652
+三四成 12.2912397395
+侍中淳 13.2075304714
+清水县 13.2075304714
+每周五 12.8020653633
+孩童 10.1871055853
+罗炳辉 12.8020653633
+港姐 12.5143832909
+偏小 9.59661255877
+期限内 9.03314320152
+湘籍 13.2075304714
+元明史 13.900677652
+尝到 9.69598503258
+笨蛋 10.6818018271
+迎接挑战 10.5684731418
+偏将 8.7245279194
+交情 8.84443184663
+靠后 9.91169360541
+三四户 12.5143832909
+向保罗 13.2075304714
+高碳 9.93038573842
+可信任 12.5143832909
+南桑威 12.8020653633
+石佛 10.4349417492
+尔西 13.2075304714
+飞鹰走犬 13.900677652
+桥墩 10.2371160058
+精气神儿 11.9547675029
+植皮 11.3357282945
+弗朗兹 13.900677652
+温浴 13.900677652
+甲酚 11.8212361103
+李尧 13.2075304714
+艺术设计 12.8020653633
+沙角 11.0674643079
+杨听罢 12.8020653633
+参附汤 11.5027823792
+远因 13.900677652
+利一世 12.5143832909
+扶汉室 11.5027823792
+李小 13.900677652
+十三年 7.71859274526
+鹿鼎记 12.8020653633
+茶泡饭 13.2075304714
+德尔曼 11.1280889297
+长绳系日 13.900677652
+烦神 13.2075304714
+行驶路线 12.2912397395
+萧宝寅 12.8020653633
+黄金荣 11.598092559
+甲酯 11.3357282945
+李尔 13.2075304714
+弗朗克 12.5143832909
+曾国荃 11.1280889297
+破洞 10.0088573539
+今天上午 8.86372504956
+左美奈 13.900677652
+文海平 13.2075304714
+贺太守 13.2075304714
+高砂 12.8020653633
+本栏 9.75754292558
+谏诤 10.9049453784
+李峤 12.1089181827
+李峥 13.900677652
+甲醚 12.1089181827
+甲醛 9.16447920358
+甲醇 8.73019365694
+嫂子 7.49544919394
+李峰 12.1089181827
+卡尔斯鲁厄 11.2616203224
+花拉子 11.8212361103
+孙小姐 12.8020653633
+萨尔瓦 13.900677652
+布朗温 13.2075304714
+阿勒班 13.2075304714
+达来诺尔 11.5027823792
+正式化 12.8020653633
+狐仙 11.9547675029
+壤土 9.59661255877
+武校尉 13.2075304714
+校验 11.5027823792
+米开朗 13.900677652
+拉丁名 12.2912397395
+谏议 10.5684731418
+巨富 10.6818018271
+尼亚城 12.8020653633
+思茅松 11.598092559
+工作调动 11.1926274509
+本案 9.22784881751
+黑山羊 12.2912397395
+岳圣 13.900677652
+同音 10.1871055853
+花园路 8.6966709649
+港外 11.3357282945
+李岳 13.900677652
+终端机 11.7034530746
+承情 12.5143832909
+偏峰 13.2075304714
+沱江镇 12.8020653633
+桅灯 11.3357282945
+一转眼 10.0294766411
+教育界 10.2371160058
+西北角 9.31571017331
+仪仗队 10.5684731418
+新加坡人民行动党 12.8020653633
+光电池 11.4157710022
+德尔智 13.900677652
+年休假 13.2075304714
+巨寇 12.5143832909
+有祥光 12.8020653633
+李岚 13.900677652
+破浪 11.2616203224
+挨家挨户 10.1394775363
+忙忙叨叨 13.900677652
+例外情况 11.3357282945
+八十颗 13.900677652
+无锡县 11.3357282945
+护士学校 12.5143832909
+沁县 12.8020653633
+累积到 12.5143832909
+农家肥 12.5143832909
+李嵩 12.2912397395
+沙袋 11.0674643079
+石丘 12.1089181827
+高福 9.29550746599
+嫂嫂 9.27570483869
+燕然 11.598092559
+温水 8.98802276624
+菲尔克 13.900677652
+四五十条 13.900677652
+阴虚证 10.8561552143
+乌斯河 13.2075304714
+高士图 13.2075304714
+格蒙迪 12.8020653633
+加枝添叶 13.900677652
+轻嘴薄舌 13.900677652
+莱阳县 12.5143832909
+唐德 12.8020653633
+桂阳县 12.5143832909
+秃疮 11.598092559
+古箭虫 13.900677652
+沼泽植物 12.2912397395
+请用 11.3357282945
+英海军 11.4157710022
+庞廷山 13.2075304714
+温氏 12.8020653633
+同队 11.598092559
+策论 11.7034530746
+二万一千七百六十五两 13.2075304714
+爱马 11.598092559
+棱角分明 10.5684731418
+净产值 13.2075304714
+人事管理 11.598092559
+增编 11.2616203224
+悔意 11.8212361103
+光懋 11.4157710022
+策试 11.5027823792
+尔表 10.604840786
+胎记 11.5027823792
+温汤 11.9547675029
+四舍五入 12.2912397395
+高秩 13.2075304714
+开怀畅饮 10.8561552143
+温江 11.3357282945
+坛场 11.2616203224
+驴头 11.1926274509
+曾任 7.02854955064
+相持不下 11.0674643079
+李崇 10.4666904475
+超爽 13.900677652
+尼日利亚政府 13.900677652
+一汽集团 11.1926274509
+驹子 12.8020653633
+具体操作 9.75754292558
+甜柔 13.900677652
+宋应星 10.8096351986
+豆荚螟 13.2075304714
+埃内斯 12.8020653633
+插好 11.5027823792
+如意棒 11.1280889297
+补血剂 13.2075304714
+石井 11.9547675029
+宋应昌 13.2075304714
+科举制度 10.1630080337
+辐射跃迁 11.598092559
+从汉川 12.8020653633
+关兴引 12.2912397395
+掘坑 12.2912397395
+谁会想到 11.3357282945
+彩车 10.4994802703
+第四十七章 11.2616203224
+石人 9.31571017331
+佯谬 11.4157710022
+泡货 13.900677652
+振臂高呼 11.3357282945
+慕容复 13.900677652
+少赚 11.3357282945
+传经 10.4041700905
+奇葩异卉 13.2075304714
+石亨 11.9547675029
+不知其可 13.900677652
+石亭 11.8212361103
+炒作者 11.598092559
+李嗣本 11.9547675029
+鲁蒙德 12.8020653633
+传给 8.56313957227
+魏巍土 12.8020653633
+传统 5.35353738419
+插头 11.1926274509
+偏差 8.60737282725
+稻地 12.5143832909
+西汉 7.11622058934
+拉扎诺 12.5143832909
+光电流 13.2075304714
+腕足动物 10.642581114
+马钱科 12.1089181827
+石介 11.8212361103
+简而言之 10.9562386728
+高神 13.900677652
+掘土 10.7226238216
+无助于 10.7226238216
+桥头 9.19114745066
+公子哥 11.8212361103
+高祖 9.23723855786
+商业利益 10.3453295905
+九龙坡区 13.2075304714
+高票 9.49395840471
+杀鸡 9.91169360541
+捶胸顿足 10.1871055853
+录取名单 13.900677652
+沙衮 11.7034530746
+燕燕 11.0674643079
+狼吞虎咽 9.96885201925
+如雷灌耳 12.5143832909
+十三点九 13.900677652
+十角形 13.900677652
+杀鸭 13.900677652
+温泉 7.85804481829
+交感 10.642581114
+渠首 10.8096351986
+甲状腺肿 10.6818018271
+塔吉 12.2912397395
+鲁登道 11.1926274509
+芭蕾舞剧 11.1926274509
+小伙计 10.4349417492
+脑后 8.83808261895
+千载难逢 10.3171587135
+传票 10.6818018271
+佣书 12.8020653633
+塔台 11.598092559
+李婧 12.5143832909
+交替 7.5411037833
+靠到 12.8020653633
+一老 10.9049453784
+华莱士线 13.2075304714
+沱沱河 10.8561552143
+新编 8.89004235788
+浮法 11.3357282945
+康马 12.1089181827
+韦丑 12.8020653633
+矣哉 12.5143832909
+规费 12.2912397395
+高纯 10.2897597393
+高纬 10.1871055853
+马尔文 13.900677652
+本溪 9.94943393339
+高级 6.53993774892
+成渝 9.04086524761
+送葬 9.74179456862
+李嬷嬷 11.1926274509
+平口钳 13.900677652
+冰斗冰川 11.598092559
+莫登 13.900677652
+熊严 13.900677652
+激发光源 12.8020653633
+传神 9.19114745066
+汶川 9.63799777493
+水晶球 11.3357282945
+腺嘌呤 11.7034530746
+张永义 13.900677652
+寻甸 12.5143832909
+教育班 13.900677652
+董庞儿 9.7898037878
+平铺直叙 12.2912397395
+罚过 13.2075304714
+太宗爷 12.8020653633
+浮沙 11.9547675029
+超生 10.1871055853
+插座 10.9562386728
+蠹政 13.2075304714
+罚进 13.2075304714
+退车 11.8212361103
+於马 11.3357282945
+田艺衡 12.8020653633
+控罪 11.9547675029
+棋逢对手 11.5027823792
+上下半场 12.5143832909
+欲海 12.2912397395
+千载难遇 13.900677652
+打印输出 13.900677652
+核仁 10.6818018271
+武胜 12.5143832909
+王慧卿 13.900677652
+靠前 8.56795885871
+郑复光 12.5143832909
+浮油 11.7034530746
+童真 12.2912397395
+现行政策 11.3357282945
+鲁智深 8.5488195185
+西右东 13.2075304714
+小股民 10.1394775363
+专题 8.2985588311
+乐坏了 11.598092559
+麻生太郎 13.900677652
+插床 11.8212361103
+尔达 13.900677652
+武耳 13.2075304714
+市委书记 7.87965430263
+坝子 10.0294766411
+刘长忠 13.2075304714
+缩回来 11.4157710022
+今青 13.2075304714
+袁守诚 12.8020653633
+压敏电阻 13.900677652
+谢谢合作 13.900677652
+梯次 11.598092559
+光明 7.60172840512
+彩衣 11.3357282945
+郊祀 12.5143832909
+塔卡 12.2912397395
+撕破脸皮 11.2616203224
+实有其事 11.7034530746
+寇滋扰 13.2075304714
+侍李舜 13.900677652
+尔辛 13.900677652
+谷深林 12.8020653633
+挟制 10.0720362555
+开除党籍 10.2897597393
+纳闷 8.10461990121
+佣仆 12.8020653633
+传种 13.900677652
+喜报 11.2616203224
+卡布列 13.900677652
+武者 11.5027823792
+光是 8.99540287354
+黔东南 10.765183436
+活力充沛 13.2075304714
+美国进口 10.8096351986
+一刻里 10.2897597393
+螺栓 10.7226238216
+港式 13.2075304714
+鹿类 11.1280889297
+持异议者 13.2075304714
+熊仔 13.900677652
+章伯钧 11.9547675029
+光晕 10.7226238216
+小青河 13.2075304714
+交映 12.8020653633
+入海处 10.604840786
+佣人 9.89334446674
+贝祖诒 13.2075304714
+尔迪 10.6818018271
+褒扬 10.9562386728
+侍生熊 13.2075304714
+弹弓 10.3743171274
+磕睡 12.8020653633
+鬼针草 12.8020653633
+凶猛 8.32094782599
+尚在 8.4801426527
+仕进 10.8096351986
+熊任 13.2075304714
+同量 9.58318953844
+同里 11.1926274509
+同重 13.900677652
+脆饼 13.900677652
+独唱曲 11.7034530746
+少言 12.5143832909
+门枕石 13.900677652
+光景 8.0985592766
+宋备战 13.2075304714
+拦挡住 12.8020653633
+浮水 10.765183436
+交易 4.9118571502
+劳务市场 11.5027823792
+乌纱帽 9.5186510173
+少说 8.89004235788
+患难夫妻 11.8212361103
+甲队 13.2075304714
+观览 11.9547675029
+勋劳 12.5143832909
+预言家 10.6818018271
+美好时光 11.7034530746
+故土难离 12.5143832909
+止水带 13.900677652
+十三处 13.2075304714
+金碧交 12.8020653633
+灵寿县 13.2075304714
+阿本斯 12.2912397395
+楚势益 13.2075304714
+余门 11.8212361103
+五十二天 12.8020653633
+塔勒 11.0103058941
+默认 8.85082164473
+掘出 10.1394775363
+默许 9.62401153296
+如履薄冰 10.4666904475
+十三天 12.1089181827
+靠北 11.598092559
+李孟 11.5027823792
+商业机会 11.1280889297
+运营者 13.2075304714
+十三大 10.604840786
+赤柱 13.2075304714
+孙小平 13.900677652
+鳄鱼皮 13.2075304714
+反自同构 13.900677652
+广众 12.8020653633
+盘菌 11.8212361103
+真空镀膜 13.900677652
+少许 8.88339781516
+十三套 12.8020653633
+橘汁 12.5143832909
+少计 13.900677652
+指指戳戳 12.8020653633
+高翘 13.2075304714
+武臣 10.1164880181
+塔努 13.2075304714
+欲求 9.82314020807
+奇虎 12.5143832909
+那曲地区 10.9562386728
+高翔 10.9562386728
+静听 9.77354326693
+自然律 13.2075304714
+单于西迁 13.2075304714
+光柱 9.75754292558
+脑力 11.0674643079
+储藏间 13.2075304714
+倒掉 9.98865464655
+默读 12.2912397395
+斗牛士 11.3357282945
+变则 13.900677652
+史百氏 13.2075304714
+同道 10.5684731418
+郭祥嫌 13.2075304714
+五凤楼 10.2897597393
+劳苦功高 11.8212361103
+情况危急 12.1089181827
+假想敌 11.2616203224
+量尺寸 12.8020653633
+默诵 10.8561552143
+交杯 13.2075304714
+这厢 11.0103058941
+阿尤恩 12.2912397395
+步云山 11.9547675029
+行为准则 10.2897597393
+藤本植物 10.1164880181
+浮浅 11.1280889297
+曾效力 13.2075304714
+桥形 13.2075304714
+防眩目 11.8212361103
+汶山 11.2616203224
+严守纪律 12.5143832909
+龟卜 11.0674643079
+还魂草 11.9547675029
+通脱木 12.8020653633
+李寿 12.8020653633
+步云履 12.2912397395
+新罗 9.82314020807
+战利品 9.59661255877
+光机 11.0674643079
+阎罗殿 11.9547675029
+莫知 12.1089181827
+营房管理 13.2075304714
+护宪 12.8020653633
+亲师 12.1089181827
+纳银 11.598092559
+李密 10.533381822
+凝神静听 12.8020653633
+塔前 12.5143832909
+光术 13.900677652
+缩写本 13.900677652
+天崩地解 13.900677652
+胎质 11.2616203224
+李宪 11.9547675029
+纳钞 12.1089181827
+光束 8.91707103027
+毛滴虫 12.2912397395
+临街 9.74179456862
+猛不丁 13.900677652
+投影面 13.2075304714
+港市 10.2630914922
+港币 9.11318590919
+凌姐姐 11.8212361103
+集体创作 10.6818018271
+靠右 11.9547675029
+临行 9.11318590919
+清乾隆 8.77077893705
+塔利 12.5143832909
+王永民 11.598092559
+拉丁化 11.7034530746
+李家 8.60236028543
+光杆 11.7034530746
+李安 12.8020653633
+桥式 11.4157710022
+光板 11.598092559
+李宏 12.8020653633
+李宁 10.3453295905
+教育片 11.7034530746
+山东队 12.5143832909
+李定 12.1089181827
+李宝 9.16447920358
+李实 12.5143832909
+拉丁区 12.8020653633
+细化 8.69119149913
+核体 13.900677652
+插式 13.2075304714
+光来 11.0103058941
+费边社 11.1926274509
+李宗 12.8020653633
+采猎 12.2912397395
+谷若 13.2075304714
+余集 12.2912397395
+一聚 11.7034530746
+架回来 13.2075304714
+绚丽夺目 13.2075304714
+斯里巴加湾市 12.5143832909
+浮滑 12.2912397395
+钻过去 11.9547675029
+少校军官 13.900677652
+莫瑟 13.900677652
+加氢精制 12.2912397395
+南庄 12.5143832909
+防身武器 11.9547675029
+四处活动 12.8020653633
+镀锡铁 13.2075304714
+检疫站 13.900677652
+高粮 13.900677652
+城市轨道 11.7034530746
+浮滥 13.2075304714
+斗牛宫 11.2616203224
+和玮玮 13.2075304714
+高精 13.900677652
+动轮轴 13.900677652
+奇计 10.9049453784
+苏易简 12.2912397395
+桀傲不驯 12.8020653633
+迎泽区 13.900677652
+香妃 12.2912397395
+武英 12.8020653633
+任军政 12.5143832909
+弄不清 9.71102290995
+磁偏计 13.900677652
+尚善 13.2075304714
+李堡 13.2075304714
+以文乱法 13.900677652
+阻抗角 12.8020653633
+戏路 10.604840786
+家维根 13.2075304714
+一万双 12.1089181827
+本法 9.74179456862
+增税 11.598092559
+老么 12.8020653633
+颜山赵 12.5143832909
+童男 10.642581114
+领导人员 11.8212361103
+烦絮 13.900677652
+悟空 8.33999602096
+不知老之将至 13.900677652
+一式两份 11.4157710022
+前哨阵地 13.2075304714
+罚跪 10.7226238216
+异常者 12.2912397395
+兽医局 12.8020653633
+病象 12.5143832909
+这边 7.22233553732
+一百七十 11.598092559
+童生 11.7034530746
+封领真 12.8020653633
+公子光 12.5143832909
+八九十里 13.900677652
+乳酸钙 13.2075304714
+塔内 11.0674643079
+贝齿 13.900677652
+大官人 9.34680076038
+直立 8.24468584116
+阴暗面 11.2616203224
+短消息 12.5143832909
+挤来挤去 11.598092559
+李士 12.5143832909
+谷英 9.44633035572
+沃尼亚 13.2075304714
+塔兹 13.2075304714
+功成名就 11.1280889297
+植物 5.81611523674
+级任老师 12.8020653633
+杨所知 13.2075304714
+穆拉特 13.900677652
+南江 12.8020653633
+布莱兹 12.2912397395
+刑警大队 11.9547675029
+枉杀 11.8212361103
+零六个 12.2912397395
+檀称凉 13.2075304714
+电动绞盘 13.900677652
+桥山 11.8212361103
+二百余处 13.900677652
+伤害力 13.900677652
+布莱克 10.1630080337
+沙质 9.62401153296
+夜的黑 12.8020653633
+市建委 11.4157710022
+议购 12.8020653633
+气眼 13.900677652
+成沙 11.5027823792
+疏肝 10.9049453784
+武舞 11.8212361103
+坡道 10.1871055853
+融化 8.39941944143
+塔克 10.604840786
+亲友团 13.2075304714
+主裁判 11.8212361103
+齐家治国平天下 12.5143832909
+心灰意懒 11.1926274509
+插屏 11.7034530746
+纳韦 13.900677652
+也行 9.26594866375
+抗凝血 11.5027823792
+齐伐燕 12.8020653633
+温庭筠 11.0674643079
+希拉里 10.2897597393
+武艺 8.1608847398
+脑儿 11.0674643079
+嚷嚷 8.95903522937
+永历 10.2897597393
+打哈哈 11.7034530746
+勃勃的 12.2912397395
+张耀曾 12.8020653633
+爱生气 11.4157710022
+坝头 12.2912397395
+沙赫 11.9547675029
+傣族 9.48183704418
+成法 9.98865464655
+港口税 13.900677652
+宣诏变 13.900677652
+姚秦 11.9547675029
+浮渣 13.900677652
+牙筷 13.900677652
+浮游 9.34680076038
+喃喃自语 9.69598503258
+当断不断 11.5027823792
+取材于 8.62256299275
+网络色情 11.3357282945
+温格 13.2075304714
+斩六将 12.5143832909
+光斑 10.9562386728
+三四分钟 11.5027823792
+孔文举 12.8020653633
+棉纺锭 12.5143832909
+光斗 13.2075304714
+尔谱 11.3357282945
+出卖方 13.2075304714
+照直 11.3357282945
+纳降 10.9049453784
+盘膝 11.2616203224
+那俊色 13.2075304714
+基层队 13.900677652
+绑匪 11.3357282945
+掘取 11.3357282945
+立项 9.43476953332
+偏失 12.5143832909
+有始有终 11.7034530746
+拉祜纳 13.900677652
+李奎 13.900677652
+宝义 12.8020653633
+丁零零 12.5143832909
+偏处 13.2075304714
+掏心 12.1089181827
+涓涓细流 11.0674643079
+李奇 11.2616203224
+少见 8.13235665618
+沧海桑田 10.4994802703
+无手 13.900677652
+满满地 10.533381822
+脆骨 12.2912397395
+偏外 13.900677652
+兰青线 12.2912397395
+余韵 11.5027823792
+了此一生 12.5143832909
+温标 11.3357282945
+完全性 10.9049453784
+大将军 7.57811241205
+五龙山 11.7034530746
+杨二牛 12.2912397395
+佯装 9.85762638414
+爱鸟 12.8020653633
+李大 10.3453295905
+姣妻 13.2075304714
+魏巍史 9.87532596124
+偏好 7.50876053858
+港岛 11.8212361103
+慌不择路 10.4666904475
+螺母 11.1280889297
+纤维植物 11.1280889297
+阴离子 9.7898037878
+会计学院 12.1089181827
+戴皇帝 13.900677652
+田皮 13.2075304714
+大闹一场 11.9547675029
+花园街 12.2912397395
+租庸调 10.0720362555
+多义性 13.2075304714
+二杆子 11.7034530746
+宝大祥 12.8020653633
+港岸 12.8020653633
+芭蕾舞团 10.0088573539
+成济 12.5143832909
+奇葩 10.8561552143
+蒙学馆 13.2075304714
+县辖市 11.7034530746
+实则 9.07236391467
+南桑德 13.900677652
+拜把子 11.8212361103
+居谦 12.5143832909
+慌乱 8.11378027061
+几千瓦 13.2075304714
+水灵灵 10.604840786
+园林设计 13.2075304714
+去恶从善 13.900677652
+冀南 9.96885201925
+军委会 11.1926274509
+坛友 13.900677652
+余靖 12.5143832909
+破格 9.91169360541
+坛台 13.900677652
+灾难 7.51211624643
+阳盛 11.2616203224
+功高震主 12.8020653633
+溶有 11.7034530746
+十三家 10.2630914922
+纳雷 12.8020653633
+光收 13.900677652
+杨文敏 12.5143832909
+好几千两 13.900677652
+孔明约 13.900677652
+本洲 13.2075304714
+老江 10.9562386728
+塞拉利昂 10.4349417492
+接通 8.95903522937
+李姐 11.1280889297
+人文学科 11.9547675029
+潟湖 9.43476953332
+外贸协会 13.900677652
+阿基米德 9.85762638414
+铁索桥 11.5027823792
+解民倒悬 11.5027823792
+张振武 13.900677652
+喊过 11.1926274509
+浮漂 11.7034530746
+横断山 9.80633308975
+余震 10.9049453784
+剂型 9.61021821083
+弗朗哥 13.900677652
+光效 12.8020653633
+武荣 12.8020653633
+鸨母 10.2897597393
+破案 10.3743171274
+尚君 13.900677652
+交收 9.0884932966
+仇华 13.900677652
+人心神 12.5143832909
+贤昆仲 11.9547675029
+劳务 9.00283785202
+重工业 8.19356738723
+李妈 11.4157710022
+阿基米得 12.8020653633
+温棚 13.2075304714
+出圈儿 13.900677652
+类属 12.1089181827
+厌战情绪 12.8020653633
+雁柱 12.8020653633
+盘腿 9.71102290995
+宗亲会 12.5143832909
+田福贤 9.22784881751
+巴士拉省 13.900677652
+与我无关 12.1089181827
+个子 8.59240995457
+煤气管道 12.2912397395
+颌骨 10.1394775363
+玻璃匠 13.2075304714
+肉体上 10.4666904475
+老君庙 11.3357282945
+博尔济 13.2075304714
+蒙藏委员 11.8212361103
+破鞋 9.77354326693
+顾太太 11.3357282945
+同派 13.900677652
+字元 10.6818018271
+探求真理 12.2912397395
+生境 9.65218240993
+吸尘系统 13.2075304714
+宁远之战 12.8020653633
+浴佛 13.2075304714
+防护 7.65457088649
+螺钉 10.9562386728
+高炮团 11.8212361103
+摸不着 9.80633308975
+梁太祖 13.2075304714
+一百斤 10.8561552143
+盘纸 13.900677652
+杀过来 11.1926274509
+鹿肉 10.604840786
+同源性 12.2912397395
+寒食节 13.2075304714
+沙路尔 13.2075304714
+绞断 12.8020653633
+有鉴于 11.598092559
+萨卡里亚 12.1089181827
+武系 13.900677652
+抗告 13.2075304714
+恩施市 11.7034530746
+病牙 12.5143832909
+党的方针 11.9547675029
+药检所 13.2075304714
+国际展览中心 13.900677652
+杨文骢 9.37888907493
+欠揍 12.5143832909
+爱意 11.0674643079
+盘绕 11.0674643079
+温静 12.8020653633
+杏李 13.900677652
+交验 12.8020653633
+攀缘运动 13.900677652
+同济 10.2897597393
+丰富多采 9.84023464143
+既定方针 11.598092559
+沅江 9.58318953844
+马特拉齐 13.900677652
+溜须拍马 11.7034530746
+慌成一团 13.2075304714
+有情有义 10.9562386728
+克莱门特 13.2075304714
+约谈 10.642581114
+抗命 10.765183436
+强子 9.93038573842
+温江区 13.900677652
+杨继业 12.8020653633
+华歆入 13.2075304714
+密克罗尼西亚联邦 11.9547675029
+螺柱 13.900677652
+人行天桥 10.2117981979
+通商口岸 9.17328983326
+杀敌 9.20932976975
+支柱性 12.8020653633
+瓦伊纳 12.8020653633
+强宾 13.2075304714
+髓质 10.3743171274
+学然后知不足 13.900677652
+割离 13.2075304714
+议事厅 11.1280889297
+病犬 13.900677652
+讲到 9.22784881751
+上访者 11.8212361103
+童话 9.04864738806
+指日可下 11.9547675029
+住房条件 10.9049453784
+杏林 11.5027823792
+行文流畅 13.2075304714
+病状 11.2616203224
+传闻中 10.8096351986
+浮选 11.2616203224
+第二十四卷 13.2075304714
+降维法 13.900677652
+霰弹 11.1926274509
+张得象 13.2075304714
+余光里 13.900677652
+黄钟大吕 12.8020653633
+尔珲 12.5143832909
+蒋琬 10.642581114
+临界 9.69598503258
+难舍难分 11.598092559
+填字 13.900677652
+术业 11.8212361103
+金贵升 13.900677652
+死门 12.5143832909
+活似 12.8020653633
+剥啄 13.2075304714
+爱憎 10.3171587135
+那芳官 13.2075304714
+余株 13.2075304714
+不自禁 10.7226238216
+敬诚殿 13.2075304714
+国际足球 11.8212361103
+三阳络 13.900677652
+银丝 10.1871055853
+文征明 11.9547675029
+扑朔迷离 9.55687223012
+月入 10.4994802703
+任建州 13.2075304714
+今次 9.87532596124
+老气 9.63799777493
+孟孙氏 12.2912397395
+渝北 12.5143832909
+全舰舰 13.2075304714
+北工大 13.2075304714
+展示会 11.1926274509
+温阳 12.2912397395
+星光灿烂 11.4157710022
+遵办 12.5143832909
+单凤 13.900677652
+纳桃 12.8020653633
+耕云播雨 13.2075304714
+爱恋 10.0720362555
+正鹄 13.900677652
+百万吨 10.2897597393
+机要秘书 12.1089181827
+掣电 11.0674643079
+病猫 11.8212361103
+亚铁磁性 11.9547675029
+圣玛丽 12.2912397395
+官铸 13.900677652
+糖皮质 12.2912397395
+同气 13.900677652
+姚思廉 12.5143832909
+慢吞吞 9.54396882529
+倪志福 12.8020653633
+武卫将军 11.9547675029
+百万名 12.8020653633
+扎鲁特旗 12.1089181827
+登门拜访 10.9049453784
+普桑 11.3357282945
+日本国会 11.8212361103
+生姜 9.28555713513
+愿闻 10.3453295905
+埃里 11.8212361103
+立克次体 12.5143832909
+年高望重 13.2075304714
+爱怜 10.0940151622
+郭嵩焘 10.604840786
+发图片 13.2075304714
+开采权 10.6818018271
+登进士 10.604840786
+义侠 13.2075304714
+析取范式 13.900677652
+沙狐 12.1089181827
+社区规划 13.2075304714
+随遇而安 11.7034530746
+一大宗派 13.2075304714
+技术协作 12.8020653633
+生姿 13.2075304714
+动物解剖 13.2075304714
+讲台 9.56994431169
+褚衣 12.1089181827
+讲史 10.8096351986
+纳格 11.4157710022
+杨将 11.5027823792
+分庭 12.2912397395
+讲古 12.5143832909
+鸟园 13.2075304714
+沙狼 12.5143832909
+同江 11.1926274509
+字典 9.65218240993
+程番府 12.8020653633
+由人 10.533381822
+棋高一着 13.2075304714
+凤天 13.2075304714
+逻辑系统 10.9562386728
+布菜 12.5143832909
+爱惜 9.35738286971
+少睡 12.8020653633
+爱情 6.84968820491
+毛毛躁躁 13.900677652
+凤头 10.9562386728
+对外部 10.2371160058
+同治 8.37522471284
+偏执狂 13.2075304714
+罗雷尔 13.2075304714
+热衷功名 12.8020653633
+黎塞留 11.598092559
+光行差 11.4157710022
+乐生励 13.900677652
+盘缠 9.03314320152
+破阵 10.9562386728
+莫说 9.43476953332
+莫诺 11.5027823792
+世贸大楼 13.2075304714
+脸谱 9.45802639549
+宋玉梅 11.7034530746
+危地马拉 9.58318953844
+老僧入定 13.900677652
+氨硫脲 13.2075304714
+某月某日 11.9547675029
+彩电 8.60236028543
+堪虞 12.1089181827
+燕语 13.900677652
+漫画作品 12.8020653633
+大礼服 12.5143832909
+从内廷 11.8212361103
+生奇 13.2075304714
+张犁 13.2075304714
+性格特征 10.4666904475
+国民待遇 10.642581114
+指向性 11.1926274509
+莫让 11.5027823792
+法学会 12.8020653633
+网络图 11.7034530746
+易安 11.598092559
+衰竭性 13.900677652
+补台 13.2075304714
+爱悦 13.900677652
+萨尔达 12.5143832909
+少看 12.1089181827
+死气沉沉 10.1164880181
+温雅 11.9547675029
+五周岁 12.8020653633
+乘上 10.9049453784
+恩斯 10.642581114
+牵引力 10.1630080337
+光频 11.598092559
+强大 6.30529037312
+元江哈尼族彝族傣族自治县 12.1089181827
+强夺 11.1280889297
+诸蛮 12.5143832909
+散文体 11.5027823792
+臭名昭着 11.9547675029
+贫困帽子 13.900677652
+开原县 12.8020653633
+老君岩 12.8020653633
+曾赐 12.1089181827
+钟缙 13.2075304714
+歌剧院 9.28555713513
+万寿道 13.900677652
+迈阿密 10.4041700905
+永久中立 11.3357282945
+排给 13.900677652
+邪财 13.900677652
+强多 10.8561552143
+六一路 12.5143832909
+金轮 11.8212361103
+里贾纳 13.900677652
+才兼文武 13.900677652
+逐步形成 8.50251495046
+食品城 13.2075304714
+高背 11.598092559
+韩滔领 13.2075304714
+林钟 13.2075304714
+价格政策 9.77354326693
+强奸 9.41204128224
+波动性 8.64840422393
+布朗族 11.0103058941
+暗疾 12.8020653633
+十世单传 13.900677652
+行路难 11.9547675029
+寒窑 12.8020653633
+白塔寺 11.7034530746
+强奏 13.2075304714
+多数遭 12.1089181827
+证照 10.3171587135
+寥寥可数 12.5143832909
+高胡 12.8020653633
+妈妈 6.55531281156
+本部 8.33233314821
+奇祸 11.2616203224
+海盗行为 11.9547675029
+加兹登 12.8020653633
+单细胞 9.18217878068
+高能 8.75901409547
+邓征西 13.2075304714
+病灶 9.55687223012
+怀恨 10.7226238216
+剖腹产 10.642581114
+资源共享 10.2630914922
+杀杀 12.8020653633
+电视观众 11.3357282945
+高考 8.48903160012
+引咎自责 13.2075304714
+别有风味 13.900677652
+空箱子 12.8020653633
+高者 9.58318953844
+接洽 10.0088573539
+教育费 11.1280889297
+金矿石 13.900677652
+初级中学 12.1089181827
+接活 12.8020653633
+灰茫茫 13.900677652
+二十几米 12.1089181827
+身披 9.00283785202
+生威 13.900677652
+土壤水分 10.604840786
+协同作战 9.89334446674
+淮海路 10.9049453784
+索菲亚 10.9562386728
+方冠三 13.2075304714
+盘簧 13.900677652
+魔法师 12.2912397395
+高耸 8.60236028543
+增值税率 12.2912397395
+不美观 12.8020653633
+啸咏 13.900677652
+破镜 12.5143832909
+北山愚 13.900677652
+高职 10.8096351986
+知情人 9.65218240993
+快译 13.2075304714
+敏感元件 11.7034530746
+成都 6.6679445158
+沈亚之 12.5143832909
+奇秀 11.1280889297
+史文恭 10.642581114
+蒸馏器 12.1089181827
+慌促 11.4157710022
+白蜡树 11.1280889297
+魏裔介 12.2912397395
+孙策欲 12.8020653633
+风湿性关节炎 10.533381822
+艾弗森 10.642581114
+潘裕昆 13.900677652
+烂仔 12.2912397395
+应接 13.900677652
+姓戴 12.2912397395
+杀机 9.96885201925
+奥伯林 12.8020653633
+老君山 10.4349417492
+朱淇兄 13.2075304714
+填好 11.1926274509
+临睡 11.9547675029
+殉教 12.2912397395
+遮不了 13.900677652
+许有王 13.2075304714
+顾杲才 13.2075304714
+易好 13.900677652
+沙炎 13.2075304714
+蔗农 12.2912397395
+彩石 11.5027823792
+五周年 13.900677652
+南极半岛 11.5027823792
+血流量 10.3743171274
+深不可测 9.71102290995
+南沟 11.4157710022
+帕瓦罗蒂 13.2075304714
+金融管理 12.1089181827
+定陶县 13.2075304714
+胡床 12.8020653633
+苏州市 9.89334446674
+阳玉 13.900677652
+余毒 12.5143832909
+爱才 12.1089181827
+同游 11.8212361103
+雷于蓝 13.900677652
+新禧 13.900677652
+一百零七 12.1089181827
+哈佛商学院 12.2912397395
+心理品质 13.2075304714
+学分制 11.4157710022
+中国女排 11.3357282945
+陈孟祥 13.2075304714
+老根据地 10.8096351986
+牡丹江市 11.1280889297
+智勇之 12.5143832909
+莫西 10.8096351986
+双锋 12.8020653633
+长真子 13.900677652
+良母 13.900677652
+办置 13.900677652
+本里 13.900677652
+武翼 12.5143832909
+旧电脑 13.900677652
+玻璃幕墙 11.3357282945
+截面图 13.900677652
+本金 8.31342899358
+临盆 11.4157710022
+太宗责 13.2075304714
+甲案 13.900677652
+左右两路 12.8020653633
+王文燮 13.2075304714
+不甘示弱 10.4349417492
+圆通寺 12.8020653633
+瓮中 11.7034530746
+萨尔贡 11.0674643079
+分币 12.8020653633
+弥久 13.900677652
+疵点 11.9547675029
+现大洋 12.2912397395
+讲出 9.62401153296
+无暇顾及 10.9049453784
+邪路 11.5027823792
+德都县 12.5143832909
+揆度 13.900677652
+前歌后舞 13.900677652
+接法 12.5143832909
+万夫不当之勇 10.642581114
+济南 7.85804481829
+余段 13.2075304714
+高致 13.900677652
+观瞻 11.1926274509
+鹿茸 9.25628675283
+杂拌 12.5143832909
+能御之 13.2075304714
+储存器 12.2912397395
+高脚 10.4994802703
+泻气 13.900677652
+任建康 12.8020653633
+控股 6.10379730919
+第四十一章 11.0674643079
+接水 11.8212361103
+扎伊尔共和国 12.5143832909
+桂平汇 12.5143832909
+不敢当 9.5062284973
+云金翅 11.8212361103
+银粒 13.900677652
+肥头胖耳 13.900677652
+畸重 13.900677652
+少留 12.2912397395
+像爬虫 13.900677652
+一百零二 11.8212361103
+剩下 6.23445572631
+国蜀汉 11.8212361103
+恋火 13.900677652
+一百零五 11.9547675029
+同源 9.28555713513
+活人 7.97909923233
+南河 10.2117981979
+乡党委 12.2912397395
+夸海口 13.900677652
+小行星 9.89334446674
+三山五岳 12.8020653633
+侍从官 11.9547675029
+强壮 8.88339781516
+杂技 9.53122979951
+冒天下之大不韪 10.642581114
+生存 6.89398242514
+生字 11.9547675029
+立杨勇 12.8020653633
+爱抚 10.0720362555
+黄草梁 12.8020653633
+观看 7.17925195119
+克里普斯 12.2912397395
+寰球 12.1089181827
+抽风机 13.900677652
+魏遂 13.900677652
+少用 10.2897597393
+地厅级 13.900677652
+鼓风机 11.598092559
+填塞 10.8096351986
+高腔 10.1871055853
+薄利 13.900677652
+盐水鸭 12.2912397395
+光饼 13.900677652
+余次 9.82314020807
+颇显 12.8020653633
+周王朱 13.2075304714
+赵家庙 13.2075304714
+门阵列 13.2075304714
+爱护 8.86372504956
+余款 10.0505300503
+小土梁 12.5143832909
+欠火候 12.5143832909
+凤子 13.2075304714
+增聘 10.8561552143
+成阳 11.1926274509
+拉穆湖 12.5143832909
+凤岭 12.8020653633
+大礼拜 13.2075304714
+爱教 12.5143832909
+宗盛唐 13.2075304714
+童车 12.1089181827
+父本 11.4157710022
+奇缘 11.9547675029
+教育论 12.5143832909
+填得 12.1089181827
+包衣 10.1164880181
+强强 10.4994802703
+几千载 12.8020653633
+网络化 10.2117981979
+中国工程院 9.66657114738
+强弱 8.20694551317
+废气 9.22784881751
+有头有脸 10.7226238216
+大热天 11.1280889297
+不太熟悉 11.5027823792
+创一流 13.900677652
+政治信念 13.900677652
+抗倭 10.8096351986
+强开 12.2912397395
+奇缺 10.4994802703
+正默 13.2075304714
+太平公主 11.0103058941
+佩珀 13.2075304714
+气味儿 12.5143832909
+马查多 12.8020653633
+黑势力 12.5143832909
+本集 11.3357282945
+聚合体 11.598092559
+揭阳 10.1871055853
+耶维奇 11.5027823792
+代康有为 13.900677652
+二次曲线 11.5027823792
+佳肴美酒 13.900677652
+植被 7.19015454252
+左针 13.2075304714
+于盐政 12.8020653633
+掌非正 13.2075304714
+羊草 10.5684731418
+塔帕斯 13.900677652
+日本京都大学 13.2075304714
+贾蓉见 13.2075304714
+文祥奏 12.8020653633
+禁制品 12.5143832909
+欣幸 12.2912397395
+金军军 12.8020653633
+父权 10.9049453784
+权威机构 9.6811699468
+易帜 10.6818018271
+两秒 12.5143832909
+那样一来 11.0674643079
+成陆 10.1394775363
+空谷传声 13.900677652
+百万元 9.55687223012
+书面上 13.2075304714
+沙石 10.4349417492
+歪过 12.2912397395
+观点 5.84108532309
+易帅 12.2912397395
+公民权 9.75754292558
+半晌家 13.2075304714
+超跌 9.26594866375
+三十周年 12.8020653633
+填开 13.2075304714
+老蔫儿 12.8020653633
+传自 11.598092559
+甜食 10.0940151622
+董承之 13.2075304714
+尉黎 12.5143832909
+稍大 9.58318953844
+合成酶 11.9547675029
+凤尾 10.533381822
+一套套 11.9547675029
+垄断行业 9.14708746087
+余江 11.598092559
+合调 12.5143832909
+无时无刻 10.4349417492
+畸零 11.9547675029
+邓宗南 13.2075304714
+唯恐 8.85082164473
+连傻子 13.2075304714
+尼泊尔语 11.9547675029
+骑过去 13.2075304714
+灰渣 11.9547675029
+强攻 10.0720362555
+呼和浩特市 10.2897597393
+那俊秀 13.2075304714
+排烟道 13.900677652
+强征 10.1871055853
+生就 10.0505300503
+观火 13.2075304714
+如兄 12.8020653633
+那书生 11.7034530746
+鄱阳湖畔 12.8020653633
+言之有序 13.900677652
+德拉河 12.2912397395
+沙眼 10.765183436
+设备利用 13.900677652
+有朝彦 13.900677652
+侠肝义胆 12.2912397395
+华北军区 10.9562386728
+全营 9.34680076038
+拉莫斯 11.3357282945
+陈鸿烈 12.2912397395
+扩张性 9.5062284973
+杂文 9.62401153296
+高虎 11.1280889297
+少爷 7.89186446653
+超越 7.102737239
+比利时王国 12.5143832909
+克罗夫 12.8020653633
+默片 12.5143832909
+安德逊 13.2075304714
+卢沉 12.5143832909
+王之孙 12.8020653633
+脱出 10.0720362555
+不负责任 8.87679713113
+凤山 10.0088573539
+强忍 9.20019728618
+楚争容 13.2075304714
+本院 11.0103058941
+儿童用品 13.2075304714
+余氯 13.900677652
+挫伤 9.85762638414
+以强凌弱 12.2912397395
+几千辆 13.2075304714
+强心 10.4994802703
+布克奖 13.900677652
+成雅 13.2075304714
+龇牙咧嘴 10.533381822
+山东地区 11.1926274509
+麦克唐奈 12.8020653633
+诸弟聘 13.2075304714
+头营 12.8020653633
+兵制 9.75754292558
+爽爽快快 12.5143832909
+同校 11.3357282945
+主使者 13.2075304714
+胎痣 13.900677652
+圪台 13.900677652
+商琦 13.2075304714
+沙皇 8.21370229564
+王之子 10.9049453784
+同样 5.3771048536
+直线导轨 13.2075304714
+蠹鱼 13.900677652
+五莲县 13.900677652
+茶室 10.642581114
+同格 12.5143832909
+河南师范大学 11.8212361103
+内出血 11.1280889297
+盘算 8.57766767284
+同根 10.9562386728
+可塑性 10.1394775363
+黄土坡 11.598092559
+合格证书 11.7034530746
+图形卡 13.900677652
+盘管 13.900677652
+连横 12.2912397395
+蔡国用 13.2075304714
+尊古卑今 13.900677652
+晚报 7.43453292774
+内燃机车 10.5684731418
+百万倍 12.8020653633
+双点 13.2075304714
+任总管 12.8020653633
+巴山夜雨 11.8212361103
+招聘 8.24818847171
+尔登 13.900677652
+下着雨 11.3357282945
+有线电视 10.0940151622
+下着雪 11.8212361103
+逆产 13.900677652
+病着 10.8096351986
+乌江 9.32596667347
+校对员 12.8020653633
+东宫门 12.5143832909
+宋都开 13.2075304714
+元进宝 13.2075304714
+图形化 12.5143832909
+成青 13.2075304714
+武科 12.5143832909
+象脚鼓 11.9547675029
+封乌程 12.8020653633
+灵效 12.8020653633
+同桌 10.1871055853
+第二十四回 11.7034530746
+校园内 10.9562386728
+同案 11.4157710022
+凤州 11.9547675029
+等级 7.34532076017
+急于求成 10.9049453784
+开滦煤矿 12.2912397395
+叶基生 11.598092559
+良深 12.5143832909
+排长龙 12.1089181827
+中山公园 10.642581114
+莫过 11.9547675029
+旋转法 13.900677652
+强度 6.90125518447
+萨乌尔 13.2075304714
+临床试验 10.4349417492
+录个 13.900677652
+鞭毛抗原 13.900677652
+太宗误 13.2075304714
+电子锁 12.2912397395
+彩照 13.2075304714
+笼屉 12.1089181827
+观照 11.8212361103
+莫迪 12.5143832909
+增至 7.4439079964
+捐助人 12.8020653633
+约见 10.0294766411
+聚丙烯腈 11.0674643079
+抗冲 11.9547675029
+趿拉 10.7226238216
+脆性 9.94943393339
+练内功 13.2075304714
+抗冻 11.1280889297
+交齐 11.7034530746
+姚苌 10.9049453784
+方焦面 11.9547675029
+鸡公车 13.2075304714
+快奏 13.900677652
+奇绝 10.9562386728
+实际水平 13.2075304714
+取时 13.900677652
+阴虚生 13.2075304714
+甜香 10.765183436
+本非 11.1926274509
+埃镑 13.900677652
+化学物质 8.98802276624
+策略 5.80843824525
+斯柳江 13.900677652
+尔盖 12.1089181827
+莫辨 11.3357282945
+易得 10.6818018271
+抗弯强度 12.2912397395
+纤维细胞 11.8212361103
+魑魅 12.5143832909
+鹿蕊 13.900677652
+中国人民抗日军政大学 12.5143832909
+胎生 10.0088573539
+抗击 7.91422564669
+初级成分 13.900677652
+同欢 12.2912397395
+不成方圆 12.8020653633
+接榫 13.2075304714
+四色问题 11.7034530746
+病理 8.170577869
+电力局 12.8020653633
+甚低频 11.8212361103
+盘碟 12.2912397395
+出生率 10.3171587135
+油压机 12.8020653633
+浮雕 8.48903160012
+淀粉类 11.2616203224
+比较满意 10.2897597393
+十四一眼 12.1089181827
+雁鸣 11.1926274509
+师全师 13.2075304714
+本钢 11.0674643079
+十路 10.2630914922
+尔甘 13.900677652
+感觉运动 13.2075304714
+施吕特 13.2075304714
+增色 10.6818018271
+超车 9.12999302751
+铰链 10.9049453784
+亘古 10.533381822
+超载 10.0720362555
+投子 13.900677652
+超轻 13.900677652
+东四南大街 13.2075304714
+余滴 12.8020653633
+拐过 11.0103058941
+微气候 13.900677652
+童贯 7.47418919452
+同步 7.36834335975
+郭树清 11.4157710022
+同正 11.1280889297
+少点 12.5143832909
+引进人才 11.4157710022
+透明度 8.46695564842
+四膜虫 12.5143832909
+歪路 13.2075304714
+孙金龙 13.2075304714
+生活奢靡 13.2075304714
+杜兰特 13.900677652
+贫困地区 10.0088573539
+飞蛾扑火 11.9547675029
+孤立无援 10.2630914922
+杀掠 10.3743171274
+满洲里市 11.1280889297
+中共中央文献研究室 12.5143832909
+松懈下来 12.8020653633
+撕毁 9.82314020807
+甲状腺素 10.642581114
+温酒 11.4157710022
+杂木 10.4349417492
+徐爵顿 13.2075304714
+约言 11.9547675029
+畹町市 11.8212361103
+童贞 11.3357282945
+脆响 10.7226238216
+较场口 11.9547675029
+光明节 13.2075304714
+高唐州 11.5027823792
+华彦钧 13.900677652
+生活作风 11.0103058941
+莫纳科 13.2075304714
+坦克炮 9.75754292558
+费全免 12.2912397395
+开除公职 11.598092559
+临猗 11.3357282945
+超过 4.53881863236
+汝观 10.4349417492
+艾格 11.5027823792
+来势凶猛 10.533381822
+培训期 13.900677652
+垫背 11.0103058941
+成钢 11.0674643079
+轨迹 8.30225569298
+良渚 10.604840786
+沙生 11.2616203224
+殉情 11.0103058941
+麦浪 12.1089181827
+鸟儿 8.83177344976
+螺旋弹簧 10.1164880181
+脱脱禾 12.8020653633
+长阳路 12.5143832909
+豆腐渣 10.8561552143
+车都尉 11.5027823792
+足临泣 13.900677652
+金军南 11.1280889297
+插翅难飞 11.8212361103
+王母娘娘 10.604840786
+权钱交易 10.7226238216
+前去 6.89398242514
+白虎星 12.5143832909
+沙田 11.2616203224
+蜈蚣草 13.2075304714
+史可法 8.40350942668
+武穴 11.0674643079
+新疆塔里木盆地 12.5143832909
+童趣 12.8020653633
+武之迹 13.2075304714
+蒋爷 12.1089181827
+美尼尔 13.2075304714
+百万只 12.8020653633
+杜阳 13.2075304714
+余温 11.8212361103
+车代舟 13.2075304714
+鸟兽 9.41204128224
+百万发 12.5143832909
+多变性 11.9547675029
+童超 12.2912397395
+垫肩 13.900677652
+生年 12.2912397395
+金军北 12.2912397395
+子道兄 11.7034530746
+卢筑盛 13.2075304714
+盘丝洞 11.8212361103
+同比 5.44408408269
+武穆 11.8212361103
+耸动视听 13.900677652
+左右两行 12.5143832909
+一个十七岁 12.1089181827
+浅棕色 11.1926274509
+东风牌 13.2075304714
+据道 12.8020653633
+快如 12.2912397395
+不止一次 8.63281949291
+尔琴 12.5143832909
+能安邦 13.2075304714
+生徒 11.2616203224
+筹备处 10.8096351986
+勿失良机 13.2075304714
+有山有水 11.8212361103
+阿莱尼亚 13.900677652
+流芳千古 12.5143832909
+传艺 11.9547675029
+杀招 13.900677652
+悍马车 10.4666904475
+成键 10.533381822
+王守履 12.1089181827
+升学考试 12.2912397395
+高薪 9.98865464655
+食积 11.0674643079
+温通 12.2912397395
+乡绅 9.58318953844
+上会 8.48903160012
+莫赫 13.900677652
+强将 11.598092559
+斯威特 13.2075304714
+陶云逵 12.8020653633
+二十八处 13.2075304714
+磁合金 11.9547675029
+无机酸 10.4041700905
+宋金刚 12.5143832909
+萨尔西 13.900677652
+成锋 13.900677652
+何思虞 10.533381822
+先驱者 9.71102290995
+听书 11.598092559
+嫣然一笑 10.2371160058
+数据通路 12.1089181827
+金军势 13.2075304714
+潘振平 13.2075304714
+中国海洋石油总公司 11.4157710022
+燕赵 10.9049453784
+维堡湾 13.900677652
+滤菌器 13.900677652
+蒋玮 13.900677652
+童谣 11.2616203224
+一脉相传 13.900677652
+有线电话 12.5143832909
+别出心裁 9.87532596124
+垫脚 11.9547675029
+井冈 11.9547675029
+刍言 13.2075304714
+爱昵 13.900677652
+刺绣品 13.900677652
+袍褂 12.8020653633
+亏了 8.9308643524
+吴中 9.94943393339
+盘秤 13.900677652
+沙瓦 13.2075304714
+光佛 11.8212361103
+大庄稼 13.2075304714
+西湖 8.08356649201
+莫利斯 11.9547675029
+南濒 10.0088573539
+今汝 12.5143832909
+王奉 13.2075304714
+互联网界 12.8020653633
+徵聘 13.900677652
+约请 10.765183436
+杀手 8.9308643524
+哈桑纳尔 13.900677652
+抗压 11.5027823792
+罚球 12.2912397395
+紫红色 9.05649056552
+朱总理 12.8020653633
+抗原 8.75901409547
+渡桥 12.8020653633
+乘以 9.61021821083
+厚着脸皮 10.604840786
+贿选 10.7226238216
+冥顽不化 11.2616203224
+嫁接 9.44633035572
+易州 10.3453295905
+病疫 13.900677652
+浮靡 11.9547675029
+一百六十八年 13.2075304714
+登革热病 13.900677652
+巨大 5.45026549425
+单用户 12.1089181827
+六九五十四 13.2075304714
+金小蜂 12.1089181827
+好意思 9.49395840471
+敌不住 10.0088573539
+烟花爆竹 11.4157710022
+默然 8.9308643524
+大扶康 13.900677652
+本镇 9.5062284973
+佝偻病 10.5684731418
+食品标签 13.2075304714
+放眼世界 11.8212361103
+数据业务 11.598092559
+渲染 8.83808261895
+四百多次 13.900677652
+病症 8.80081122415
+棉籽饼 13.900677652
+杀戒 11.9547675029
+纳努克 13.900677652
+陈虹 12.5143832909
+同心戮力 11.4157710022
+刘鸿声 12.8020653633
+尔瓦 11.598092559
+烦得很 13.2075304714
+陈眉之 13.2075304714
+黄澄澄 11.0103058941
+于东观 12.8020653633
+毫瓦 12.2912397395
+温泉县 13.900677652
+杀戮 8.83177344976
+纳溪 11.0674643079
+粤海铁 13.900677652
+硫酸盐 9.44633035572
+短发 9.77354326693
+专利申请 11.0103058941
+满城县 11.7034530746
+金军分 12.8020653633
+朱异来 13.2075304714
+正当中 11.1280889297
+满壁风 13.2075304714
+病程 8.88339781516
+玉麒麟 10.8096351986
+总括 11.2616203224
+三马同槽 13.900677652
+同收 13.900677652
+传起 12.5143832909
+喊上 12.8020653633
+毫笔 13.900677652
+五讲四美 12.8020653633
+捣乱 9.37888907493
+孰能 12.5143832909
+面对现实 10.765183436
+鉴别方法 13.2075304714
+不畏艰难 12.5143832909
+食禄 10.9049453784
+尸体解剖 11.3357282945
+夏禹治水 11.9547675029
+殉身 13.2075304714
+炸起 11.8212361103
+接枝 11.7034530746
+请留 11.7034530746
+南天山 11.9547675029
+围魏救赵 10.8561552143
+沙箱 12.5143832909
+北方工业大学 12.5143832909
+韧皮部 10.3171587135
+金三世 13.900677652
+传赞 13.900677652
+图林根 11.4157710022
+抖出 11.5027823792
+穿红戴绿 13.2075304714
+兵多将广 11.598092559
+少纳 12.1089181827
+于东虢 12.8020653633
+斯尔希 13.2075304714
+传质 10.8096351986
+多句 13.900677652
+强占 9.18217878068
+三四道 13.2075304714
+杜陵 11.0674643079
+作物布局 12.1089181827
+抗属 11.5027823792
+复员令 13.900677652
+增调 11.5027823792
+阖府 12.1089181827
+鼠标垫 13.2075304714
+生僻 11.2616203224
+积不相能 13.2075304714
+阿尔菲耶 12.8020653633
+一卫 13.2075304714
+公共信道 13.2075304714
+墙头 9.55687223012
+余悸 11.9547675029
+基督教民主联盟 11.1926274509
+事业部制 13.2075304714
+和异戊 13.900677652
+超脱 9.6811699468
+赵云擒 13.2075304714
+弱小民族 12.5143832909
+裴伟 12.8020653633
+矜怜 13.900677652
+诸弟谭 12.8020653633
+瓦伦斯 12.8020653633
+省出 12.8020653633
+知识产权 8.32094782599
+量体裁衣 12.1089181827
+接机 12.2912397395
+四轮车 11.3357282945
+出毛病 10.604840786
+高官显爵 12.5143832909
+化作 9.32596667347
+姚辑 13.2075304714
+同方 10.2630914922
+扇状 10.1871055853
+睡一觉 9.7898037878
+接有 12.8020653633
+苦哈哈 13.2075304714
+喊人 11.5027823792
+电子钟 13.900677652
+良性 8.65365357982
+闽方言 11.8212361103
+巨好 13.900677652
+妃子笑 12.5143832909
+八百里 9.65218240993
+偶极矩 11.0103058941
+承扶 13.900677652
+前发 13.2075304714
+三十几块 13.900677652
+淡竹叶 13.900677652
+维托斯 13.2075304714
+脓水 10.9562386728
+同日 8.2985588311
+弥赛亚 11.598092559
+烦请 11.3357282945
+接来 9.53122979951
+滚针轴承 12.8020653633
+左镇 11.598092559
+载畜量 11.3357282945
+同时 4.00804884277
+向凤姐 11.7034530746
+甄宝玉 11.598092559
+图形库 13.900677652
+奇珍 8.9308643524
+余怒 11.7034530746
+一英里 13.900677652
+唇色 11.9547675029
+万安镇 12.8020653633
+制漆 13.2075304714
+病童 13.900677652
+同族 9.94943393339
+喊价 11.7034530746
+后付费 13.900677652
+父母 6.3880601073
+文人学士 10.4041700905
+永世长存 12.5143832909
+不畏艰险 12.2912397395
+黄布 11.0103058941
+地运仪 13.2075304714
+硫叶立德 13.900677652
+强取 11.7034530746
+盐官镇 12.1089181827
+控诉 9.05649056552
+鹿血 12.1089181827
+埃塞克斯 11.8212361103
+明廷赐 13.2075304714
+委托方 11.3357282945
+鸟店 13.900677652
+倾家荡产 9.63799777493
+临门一脚 12.1089181827
+急驰而去 12.2912397395
+一浪高过一浪 11.0103058941
+凤冠 10.3453295905
+人身权 11.1926274509
+应付款 11.8212361103
+沙窝 11.598092559
+国家税收 10.8561552143
+通气会 10.5684731418
+甲戌 12.2912397395
+哥德式 13.900677652
+强制 7.56031834825
+增资 7.89186446653
+害躁 13.900677652
+唱对台戏 11.8212361103
+宰丰 13.2075304714
+帕韦利奇 13.2075304714
+不长一智 12.8020653633
+易卜 12.5143832909
+生冷 10.4041700905
+图书周转 13.2075304714
+寿命短 11.2616203224
+高论 10.2897597393
+王文简 13.2075304714
+几千艘 13.2075304714
+专职人员 11.0103058941
+孙本文 11.4157710022
+主席 5.77890023281
+打卤面 11.598092559
+火口 10.642581114
+正中书局 12.5143832909
+贮木场 12.5143832909
+张运镒 13.2075304714
+沙立 11.8212361103
+韩美林 13.900677652
+武痴 13.2075304714
+全世界 6.80147590842
+弗雷歇 12.2912397395
+杂七杂八 10.4041700905
+风急浪高 13.2075304714
+澹台姊弟 12.8020653633
+鱼河堡 13.2075304714
+遛鸟 13.2075304714
+喝起 10.8096351986
+拉萨尔 11.0103058941
+欺骗性 10.4666904475
+通扬水 13.2075304714
+接替 8.26232298264
+喊住 9.89334446674
+罚站 12.5143832909
+罗卡尔 13.2075304714
+凤凰 7.83225206373
+生出 7.50208271744
+今音 11.8212361103
+於潜 13.2075304714
+鹿角 9.43476953332
+奇特 7.64492761022
+沙竹 11.9547675029
+增购 11.1926274509
+占全洲 10.604840786
+官复原职 10.9562386728
+盘石 11.1926274509
+理屈词穷 12.2912397395
+仁者见仁 12.1089181827
+厌恶感 12.5143832909
+上海市人 11.9547675029
+睁开 8.52078029844
+灌输知识 13.900677652
+议程 9.84023464143
+饵料 9.36807815882
+皱皱巴巴 12.5143832909
+约旦河西岸 11.2616203224
+强加 9.72629038208
+自动滴定 13.900677652
+陕甘宁边区 9.27570483869
+明景帝 13.2075304714
+强势 6.20083524458
+示寂 13.900677652
+社会科学界 12.1089181827
+女歌唱家 13.2075304714
+黄埔军校 9.27570483869
+鸟市 12.5143832909
+鼠标器 12.8020653633
+或明或暗 10.9049453784
+生儿 10.9562386728
+污蔑 10.642581114
+易变 11.4157710022
+没良心 9.94943393339
+房儿 13.2075304714
+眼前亏 13.900677652
+宰人 11.7034530746
+外区 12.8020653633
+北斗星 9.74179456862
+陈士英 13.2075304714
+武生 10.6818018271
+超能 13.900677652
+莫菲 12.8020653633
+权利金 12.5143832909
+燕莎 12.8020653633
+填制 11.2616203224
+神气十足 12.1089181827
+强力 8.03704647638
+工业化学 11.9547675029
+分式 11.9547675029
+善始善终 11.9547675029
+易县 9.87532596124
+内嵌式 13.900677652
+克劳特 13.900677652
+宝瓶 11.0103058941
+三四里 10.604840786
+爱梅 13.2075304714
+武略 12.1089181827
+杀气 9.5062284973
+赤旗 12.8020653633
+形式各异 12.2912397395
+默罗 13.2075304714
+单项式 13.2075304714
+示范乡 13.900677652
+燕菜 13.2075304714
+烟火剂 13.2075304714
+生养 10.0720362555
+莫莫 12.8020653633
+义举 10.5684731418
+克罗同 13.2075304714
+生兰 13.900677652
+想象力 8.93783302172
+莫莱 13.2075304714
+一瞬间 8.0484751722
+识别系统 10.765183436
+杜鹃鸟 13.900677652
+流个 11.9547675029
+化为 7.98447558937
+武界 13.900677652
+仅存 8.50705010562
+本领 7.72273353793
+生力 12.5143832909
+后脑壳 13.2075304714
+咝咝 10.642581114
+新股申购 8.43261751084
+不情之请 13.2075304714
+贝恩斯 13.2075304714
+赖邓艾 12.8020653633
+水晶般 12.5143832909
+李普希 12.1089181827
+填写 8.91707103027
+同机 11.8212361103
+低压槽 11.4157710022
+本题 11.8212361103
+八九十斤 13.2075304714
+彩绘 8.88339781516
+清开灵 11.598092559
+轻重缓急 10.4041700905
+于普拉 13.2075304714
+李朝威 12.8020653633
+擦皮鞋 11.598092559
+斯大林 8.41588071849
+通明透亮 13.2075304714
+同月 9.56994431169
+同有 11.598092559
+秦经理 12.5143832909
+吉烈迷 13.2075304714
+锦江 9.22784881751
+李子 8.46259834305
+爱武 13.900677652
+同期 6.52855962364
+彩练 13.900677652
+鬼哭神惊 13.900677652
+交邮 13.900677652
+逃上 11.7034530746
+同来 9.45802639549
+海洋渔业 10.2630914922
+接旨 10.1164880181
+彩线 12.1089181827
+胰岛 10.3171587135
+雅人 13.900677652
+于夫椒 13.2075304714
+政法 10.0505300503
+第九十四回 12.5143832909
+舍利子 11.3357282945
+沙科 13.2075304714
+强兵 11.1280889297
+接时 12.5143832909
+弓拉奏 12.1089181827
+黄果树 10.3453295905
+溜圆 11.2616203224
+强光 9.19114745066
+金东木 13.2075304714
+中转港 11.7034530746
+莫耳 13.2075304714
+放毒 12.8020653633
+同村 10.1871055853
+牵羊担酒 12.2912397395
+李建章 13.2075304714
+拉祜语 12.8020653633
+扇火 12.5143832909
+鸟巢 9.75754292558
+募股 10.0088573539
+唐尧 11.1926274509
+光通 13.2075304714
+红色 6.59213485444
+光速 9.05649056552
+余所 9.96885201925
+上访事件 13.900677652
+证编号 12.2912397395
+不换 10.0720362555
+鲁公 12.8020653633
+传述 10.765183436
+一展歌喉 13.2075304714
+互联网协议 12.8020653633
+讲堂 10.4349417492
+一二十米 13.2075304714
+生分 10.1164880181
+接收 7.57990935773
+听不懂 8.75318317516
+数斗 12.2912397395
+同构 11.4157710022
+张汉那 13.2075304714
+传过 11.1280889297
+新篇章 10.7226238216
+识别力 13.2075304714
+国家环保总局 12.5143832909
+燃气管 11.598092559
+生利 11.7034530746
+强军 11.7034530746
+两手掌 13.2075304714
+交道 9.5186510173
+燕肃 12.2912397395
+良才 13.900677652
+穆赫塔 13.900677652
+大杨树 10.604840786
+填充 9.0884932966
+储水 11.0674643079
+爱语慰 13.2075304714
+光道 13.900677652
+仁圣 11.7034530746
+潜力股 9.82314020807
+勃勃 10.3743171274
+毫秒 10.642581114
+生前 7.65070240972
+苏州城 12.2912397395
+白雪公主 12.1089181827
+强击 10.9562386728
+五莲山 13.2075304714
+富绶笑 13.2075304714
+传达 7.83922073305
+杜集 13.2075304714
+填入 10.9049453784
+丙二醇 11.4157710022
+不夜城 11.2616203224
+逃亡 8.06294720481
+积极响应 10.0294766411
+成飞 11.1280889297
+尔科 12.2912397395
+传输 8.1902506346
+本页 12.5143832909
+交通 5.94525256306
+本顿 12.5143832909
+打电话 7.32281629425
+包打听 12.5143832909
+沉郁顿挫 12.2912397395
+田作定 13.2075304714
+余户 10.9049453784
+成人高考 13.2075304714
+本馆 12.1089181827
+鸟岛 10.2630914922
+三十四中 13.2075304714
+罗汝才 8.20023407859
+同是 9.41204128224
+高要 11.2616203224
+居住面积 11.3357282945
+凤县 11.0103058941
+识别区 13.900677652
+生厌 11.7034530746
+大清堂 10.4994802703
+熬不住 10.9049453784
+世态人情 12.1089181827
+布隆迪共和国 13.2075304714
+音品 12.2912397395
+误操作 11.7034530746
+海盗号 12.8020653633
+孪生姐妹 11.8212361103
+平泉桥 13.2075304714
+灌南县 12.8020653633
+抗弯 12.1089181827
+圣多美和普林西比 11.1926274509
+李根源 12.2912397395
+宋云西 12.8020653633
+引力定律 13.2075304714
+姜绍书 13.900677652
+强借 12.2912397395
+最叫人 11.7034530746
+夸大之词 13.2075304714
+倒放 11.9547675029
+百万年 11.9547675029
+高览 11.5027823792
+和玛丽 13.2075304714
+生变 10.1164880181
+强健 9.26594866375
+高见 9.05649056552
+网络层 11.0103058941
+子曹丕 12.8020653633
+生发 10.4041700905
+略知皮毛 13.2075304714
+林荫大道 11.8212361103
+关税法 12.1089181827
+东沙群岛 10.5684731418
+技术引进 10.8096351986
+拉萨市 10.0505300503
+叽叽喳喳 10.1871055853
+光采 11.598092559
+冒险家 10.0294766411
+圆面积 12.1089181827
+储存库 12.8020653633
+汗酸 13.900677652
+第九次 10.0720362555
+严惩不怠 13.900677652
+宋玉所 12.5143832909
+王多铎 10.5684731418
+陶粒 13.2075304714
+隆子 12.5143832909
+增进 8.43684584695
+完全免费 11.7034530746
+纪念邮票 11.5027823792
+盱眙 9.72629038208
+生化 8.50251495046
+卫老三 13.2075304714
+玻璃厂 10.2117981979
+感到高兴 10.0088573539
+全国一盘棋 11.8212361103
+海水面 12.1089181827
+砂锅菜 13.900677652
+矜持 9.29550746599
+孙四海 7.64492761022
+磁单极子 12.2912397395
+民不畏死 13.2075304714
+交配 8.50705010562
+两手抓 10.765183436
+易凝 12.8020653633
+范祖禹 11.598092559
+智能手机 10.2371160058
+津梁 11.9547675029
+奇点 11.1926274509
+杨林道 12.2912397395
+墙壁 7.70627226087
+沙砾 10.604840786
+褚桓 11.598092559
+两手把 13.900677652
+贾母笑 9.65218240993
+限界 13.2075304714
+病种 10.3743171274
+限田 11.4157710022
+虎鸣 12.1089181827
+甲状腺炎 11.8212361103
+第九款 13.2075304714
+明尊 13.900677652
+设计部门 11.9547675029
+特务组织 11.0103058941
+哗啦一声 10.642581114
+增辉 11.598092559
+梁斌 12.8020653633
+失真 10.1630080337
+南山矿区 13.900677652
+合作化 10.3171587135
+鸟居 13.2075304714
+兵卒 10.0940151622
+孙宇挺 12.2912397395
+自净作用 12.5143832909
+凤华 10.4041700905
+公之意 12.1089181827
+巴豆霜 13.900677652
+讲好 11.3357282945
+现货供应 11.7034530746
+福摩萨 13.900677652
+资助款 13.900677652
+顶多会 13.2075304714
+红枫湖 12.2912397395
+幸蒙知 13.900677652
+一千左右 12.5143832909
+深圳队 11.7034530746
+百万头 13.2075304714
+敢过来 12.5143832909
+韦娜 11.8212361103
+排长队 12.2912397395
+接接 12.8020653633
+埃鲁 11.9547675029
+不惑之年 11.2616203224
+妙事 12.8020653633
+细细地 9.82314020807
+内衣店 13.900677652
+孵小鸡 13.900677652
+丁零族 12.8020653633
+谕旨 8.80692745117
+分化瓦解 11.1280889297
+隆恩殿 12.5143832909
+分岔 10.8096351986
+盖斯 11.8212361103
+熬出来 11.1926274509
+梵宇 12.5143832909
+沙漠之舟 12.5143832909
+接掌 12.2912397395
+黄金甲 11.1280889297
+命薄 11.3357282945
+交集 10.2371160058
+同意 5.99967059998
+封魏王 11.7034530746
+注水肉 13.900677652
+褐家鼠 12.2912397395
+十万八千 12.1089181827
+讲座 8.83808261895
+合资 7.5273578624
+怀唐伊 12.2912397395
+崇山 11.598092559
+慷慨大方 11.9547675029
+吕梁市 11.7034530746
+今果 11.5027823792
+轻心 13.900677652
+宋江亲 12.5143832909
+扬声 11.1280889297
+梅龙镇 13.900677652
+喃喃 8.94485059437
+烈士墓 10.4666904475
+椭圆柱 13.900677652
+白道面 12.2912397395
+吴用笑 11.7034530746
+滤到 13.900677652
+北海市 10.8096351986
+健康网 10.6818018271
+腊斯克 13.2075304714
+那不就 11.7034530746
+自我感觉 10.4041700905
+光雾 13.900677652
+无法挽回 10.765183436
+尔罕 13.2075304714
+北环路 10.1394775363
+王文统 11.0103058941
+中央人民政府政务院 10.4994802703
+超载车 13.2075304714
+职业服 13.900677652
+准点 12.5143832909
+吕格达 13.900677652
+艺品 13.900677652
+零关税 11.9547675029
+杂活 11.598092559
+两亿人 13.2075304714
+生吞 11.7034530746
+吴天智 12.2912397395
+健康美 13.900677652
+干吗 8.11993413618
+光阑 11.5027823792
+保险单 11.0103058941
+根正苗红 13.900677652
+今村 13.2075304714
+哈里勒 12.8020653633
+晃晃荡荡 12.2912397395
+新科 10.6818018271
+高踞 10.5684731418
+先贤祠 12.8020653633
+讲师 8.63798746307
+控辩 11.598092559
+玄子 13.900677652
+和立宪 13.2075304714
+威海人 13.2075304714
+温温和和 13.2075304714
+贼寇 10.1394775363
+有明谕 13.900677652
+克罗克 11.598092559
+生活理想 11.9547675029
+光阴 9.61021821083
+光明行 13.2075304714
+讲席 11.598092559
+纳旦 12.2912397395
+王士 11.1280889297
+本质性 12.1089181827
+今期 13.2075304714
+武灵 13.2075304714
+鹿豹 13.2075304714
+生员 10.2630914922
+超薄 11.3357282945
+盘片 12.1089181827
+捍卫 8.5488195185
+渲泄 11.3357282945
+库姆斯 13.2075304714
+光降 11.3357282945
+手机用户 9.93038573842
+个体变元 13.2075304714
+想干什么 9.44633035572
+沙罗 12.8020653633
+肉饼 10.604840786
+迂阔 11.598092559
+生命 6.13510857088
+爱液 13.2075304714
+奇石 11.0674643079
+罚罪 13.900677652
+巴氏 11.3357282945
+噪音量 13.900677652
+适宜性 11.9547675029
+新秀 10.0720362555
+斯图亚特 9.94943393339
+待审 13.900677652
+伊普斯威奇 12.8020653633
+严蕊 13.2075304714
+酸乳酪 12.8020653633
+上代 11.1280889297
+双牌 12.5143832909
+第三第四 13.2075304714
+朱镜我 12.8020653633
+同性 10.5684731418
+津港 12.2912397395
+讲得 9.07236391467
+甜酒 10.8561552143
+甲状腺癌 13.900677652
+易王卒 12.8020653633
+接报 11.9547675029
+札幌 11.598092559
+精益求精 10.4666904475
+鸟媒 13.900677652
+现代出版社 13.2075304714
+富纳富提 13.2075304714
+韩国国防部 11.7034530746
+价格网 13.900677652
+强嘴 11.8212361103
+金贞 11.9547675029
+默算 12.8020653633
+抗大 10.604840786
+不通人情 12.1089181827
+甜酱 12.8020653633
+时宝钗 13.2075304714
+北开 11.8212361103
+余日 11.598092559
+图形学 13.900677652
+甜酸 11.7034530746
+江晔 12.1089181827
+电子屏 12.5143832909
+王国光 8.4284069783
+利他主义 12.1089181827
+高达 5.91010077023
+可驯养 13.900677652
+良方 10.1630080337
+孙恭之 13.2075304714
+新种 10.4041700905
+遛马 11.7034530746
+爱民 9.91169360541
+高迈 13.900677652
+杨希 13.2075304714
+王一亭 13.900677652
+几元 11.1926274509
+多谋善断 11.7034530746
+赤水市 12.5143832909
+金饰品 11.7034530746
+高过 10.0294766411
+千巧万 13.2075304714
+刘明远 11.2616203224
+少管 11.7034530746
+温马 13.2075304714
+温驯 10.9562386728
+诸孙 13.900677652
+有勇有谋 12.1089181827
+贾政听 10.1164880181
+德尔里 12.8020653633
+黑下 12.8020653633
+世界人权宣言 11.598092559
+接拍 12.5143832909
+黄佐临 12.1089181827
+战弥励 13.2075304714
+连绵起伏 11.4157710022
+少算 12.8020653633
+贾瑞如 13.2075304714
+无机化学 10.0720362555
+任弼时 10.533381822
+萨尔茨 13.2075304714
+停滞不前 9.54396882529
+罗霄山 12.8020653633
+记录纸 11.8212361103
+接招 11.1280889297
+振奋人心 10.6818018271
+嫌忌 13.900677652
+杨幺 12.2912397395
+胰子 11.8212361103
+负有 8.61241062128
+今晚 7.20240959786
+交租金 12.1089181827
+查询器 13.900677652
+尔纳 11.7034530746
+分水闸 12.2912397395
+王克殷 13.900677652
+彩票 8.48903160012
+投影机 13.900677652
+同悲 12.8020653633
+陀罗 9.66657114738
+今晋 12.5143832909
+代数方程 10.3453295905
+锦生 13.2075304714
+舅妈 10.9562386728
+四五十里 11.5027823792
+上万 9.53122979951
+第二十三 11.4157710022
+高本汉 12.8020653633
+德拉斯 12.2912397395
+契约法 13.2075304714
+成龙 10.533381822
+月满则亏 12.2912397395
+强效 12.8020653633
+钟磬 11.3357282945
+今晨 10.0088573539
+血色素 11.9547675029
+余数 11.3357282945
+相干条件 13.900677652
+陈士奇 13.2075304714
+颌面 11.598092559
+彩礼 10.2371160058
+今昔 11.598092559
+双爪 12.2912397395
+尔维 11.4157710022
+铜条 13.900677652
+苏达耶 13.900677652
+今昌 13.2075304714
+强国 8.0484751722
+今明 10.7226238216
+强固 11.0674643079
+杂沓 10.2897597393
+炭化物 13.900677652
+女真族 10.0294766411
+少笑 13.900677652
+爱河 10.4994802703
+同情 7.40390266179
+静思 9.96885201925
+余支 11.4157710022
+野鸳鸯 13.2075304714
+雁门 9.63799777493
+交通秩序 10.9049453784
+非全日制 13.900677652
+高车 10.642581114
+汤仙虎 13.2075304714
+第一一三回 13.2075304714
+巨大损失 9.77354326693
+监督者 11.8212361103
+观礼 11.0103058941
+光靠 9.82314020807
+中信集团 10.3453295905
+光面 11.3357282945
+玛尔河 13.2075304714
+美轮美奂 11.9547675029
+载入史册 10.8561552143
+吴刚伐 13.900677652
+津津 11.5027823792
+巴拿马政府 12.8020653633
+产品包装 11.5027823792
+西北工业大学 13.900677652
+襄渝线 11.7034530746
+杀毒 11.8212361103
+昨晨 11.0103058941
+栾布击 12.8020653633
+糖人儿 12.1089181827
+管式 10.5684731418
+铁合金厂 12.1089181827
+漂亮衣服 13.900677652
+八千一百八十户 13.2075304714
+曼侬 12.8020653633
+萧纲 12.2912397395
+昨晚 7.4439079964
+浅绿色 10.6818018271
+垫补 13.900677652
+二月 7.63537643924
+惨苦 11.7034530746
+多媒体 9.43476953332
+垫衬 12.8020653633
+植苗 10.9049453784
+画刊 12.5143832909
+雁阵 11.598092559
+今日 4.98914771024
+自行火炮 9.48183704418
+渠江 11.0674643079
+识别器 11.1926274509
+庞尽揽 13.2075304714
+交付使用 9.53122979951
+储存室 13.2075304714
+温饱 9.7898037878
+谢了恩 10.765183436
+津浦 9.66657114738
+吉登斯 12.5143832909
+成鱼 10.0505300503
+小神锋 11.7034530746
+渠水 11.4157710022
+温饮 12.8020653633
+今文 10.8096351986
+抗婚 12.8020653633
+单位向量 12.8020653633
+交钱 9.80633308975
+哲学史 9.20019728618
+帮你忙 12.8020653633
+白纸黑字 10.4041700905
+球迷 9.11318590919
+插翅难逃 11.5027823792
+易名 9.46986085313
+演义 10.0294766411
+复杂劳动 12.5143832909
+平转桥 13.2075304714
+上下一心 10.9562386728
+诸王各 12.5143832909
+佯称 11.5027823792
+高谊 12.8020653633
+高谈 11.8212361103
+拉子模 10.3171587135
+武爷 13.900677652
+过冬作物 13.900677652
+数显 12.8020653633
+时钟脉冲 13.900677652
+明视觉 13.2075304714
+温馨 8.71329184614
+费婆子 13.900677652
+传说 6.45935726226
+合乎情理 10.6818018271
+清选 12.1089181827
+柔声细语 12.1089181827
+津液 9.63799777493
+温香 12.8020653633
+塞拉里昂 12.5143832909
+两百五十 13.2075304714
+黑白相间 10.8561552143
+圪塔 10.533381822
+鸟头 12.2912397395
+甲方 10.604840786
+萧纪 12.8020653633
+传译 12.2912397395
+怪石嶙峋 11.7034530746
+演了 11.0103058941
+阿尔希波夫 12.8020653633
+呼兰河 11.3357282945
+传话 9.20019728618
+雁雁 8.83177344976
+垂拱 10.2897597393
+朱见深 12.8020653633
+奇痒 10.765183436
+坐吃山空 10.9049453784
+孙削籍 13.2075304714
+颁授 12.5143832909
+纳林 13.900677652
+斯密斯 11.0674643079
+借住 11.5027823792
+一篇篇 13.2075304714
+内衣展 13.900677652
+百分比 9.03314320152
+食窦 13.900677652
+传讹 13.900677652
+时宪历 12.8020653633
+朝鲜文 12.1089181827
+风俗人情 11.3357282945
+弹拨乐器 11.8212361103
+神妙莫测 13.2075304714
+黄金矿 12.8020653633
+北海岸 12.2912397395
+吴臣 13.2075304714
+周长达 13.900677652
+正骨科 13.900677652
+褪下 10.9562386728
+六十五 11.1926274509
+盘灶 13.900677652
+厚颜无耻 10.4994802703
+柳园渡 11.5027823792
+师事荀 13.2075304714
+一百四十四卷 13.2075304714
+破题 10.7226238216
+营销策划 12.5143832909
+火枪手 12.1089181827
+名誉会长 9.96885201925
+际会 12.5143832909
+百货公司 10.1164880181
+高超 8.92394390956
+苦害 11.0674643079
+点面结合 12.8020653633
+杏核 11.598092559
+识别模式 13.2075304714
+余某 12.5143832909
+沙粒 10.3743171274
+练剑 11.9547675029
+局机关 12.5143832909
+战斗队形 11.1926274509
+无怨尤 13.900677652
+虎口 9.03314320152
+借人 12.1089181827
+一二十种 12.8020653633
+近朱者赤 12.5143832909
+宋江举 13.900677652
+杨虎城 10.0294766411
+遵令 9.72629038208
+琵琶行 11.1926274509
+纳普 13.2075304714
+科研成果 10.1871055853
+高足 11.1280889297
+八宝饭 12.5143832909
+武王 9.55687223012
+杏树 10.4994802703
+毕达哥拉 13.900677652
+野鸡 9.63799777493
+温顺 9.6811699468
+空三军 10.604840786
+扣板机 13.900677652
+奇瑞 8.9308643524
+左贤王 11.4157710022
+赫布里底 11.0674643079
+余枚 11.1280889297
+带绦虫 11.7034530746
+帕夫利 13.2075304714
+彩管 13.2075304714
+钩过来 13.900677652
+不捕 13.900677652
+诸弟诸 13.2075304714
+沙糖 13.900677652
+凤城 10.5684731418
+传言 7.90174109003
+评判员 13.2075304714
+垫褥 12.5143832909
+分封 8.77671367257
+宋伯鲁 12.2912397395
+管河务 13.900677652
+鸟声 10.9049453784
+毫米 5.8176577328
+引水道 12.5143832909
+津江 13.900677652
+铿然 11.1926274509
+劄记 13.2075304714
+山西省政协 13.2075304714
+林上林 12.8020653633
+借以 8.14810501315
+江口 9.29550746599
+借代 12.5143832909
+高跷 11.0103058941
+余架 10.2897597393
+生土 11.0674643079
+广西大学 11.3357282945
+良朋 12.8020653633
+科技动态 13.900677652
+得奖人 11.4157710022
+单项奖 11.8212361103
+张伯伦 9.74179456862
+一万七千余 13.2075304714
+二十万两 9.4233408375
+牵引式 9.65218240993
+张清秀 12.5143832909
+鸡犬不惊 12.5143832909
+神思不定 13.900677652
+昂纳克 12.1089181827
+腐殖质 9.69598503258
+开原市 12.2912397395
+牌楼 9.04086524761
+晶体生长 11.9547675029
+彭明 13.2075304714
+碾得 12.8020653633
+高质 13.900677652
+锐角三角 13.900677652
+余杭 9.93038573842
+亦然 10.6818018271
+居民家庭 11.5027823792
+余条 9.62401153296
+恩来 12.5143832909
+植草 13.900677652
+教育者 11.0674643079
+高贤 11.0103058941
+生地 9.85762638414
+抵抗运动 9.65218240993
+良机 8.53938548627
+同慧琼 11.9547675029
+生在 8.98802276624
+哥德尔 11.2616203224
+光锥 12.8020653633
+清逸 11.7034530746
+乌里扬诺夫斯克 11.7034530746
+黑云 9.80633308975
+彩笺 12.8020653633
+鼢鼠 11.8212361103
+北影 12.8020653633
+稍安毋躁 13.2075304714
+耕作 7.92179188707
+克罗利 12.5143832909
+渝州 12.2912397395
+少礼 13.2075304714
+橘黄 11.2616203224
+凤坡 12.1089181827
+萍水 12.2912397395
+植茶 11.0674643079
+理想约束 12.5143832909
+资金流 10.2630914922
+莫扎 12.8020653633
+生均 13.2075304714
+鸢尾 11.5027823792
+约莫 9.62401153296
+良村 12.2912397395
+良材 11.4157710022
+赶先进 13.2075304714
+增设 8.32094782599
+跑操 13.900677652
+踏入社会 13.900677652
+彩笔 13.2075304714
+邵大官人 11.9547675029
+生坯 13.900677652
+细发 12.8020653633
+相容 10.2897597393
+童蒙 11.9547675029
+冯保一 10.2371160058
+交错 7.87965430263
+锅贴 12.5143832909
+增订 10.4994802703
+四维八德 13.900677652
+亚显微 11.9547675029
+裴文中 11.8212361103
+本节 11.0103058941
+同素 12.8020653633
+空张郡 12.8020653633
+观操 10.6818018271
+大礼盒 13.2075304714
+构造高原 13.2075304714
+元梁王 12.8020653633
+繁峙 12.1089181827
+杏眼 10.642581114
+黄金椁 11.3357282945
+毗连 9.44633035572
+时间延迟 13.2075304714
+基辛格 11.9547675029
+作饭 13.2075304714
+以身许国 11.5027823792
+磨齿机 11.9547675029
+鹿邑 11.0674643079
+病房 8.36334338496
+深山密林 11.1926274509
+逃命 8.39941944143
+目光如炬 11.9547675029
+甲第 12.1089181827
+接羔 12.1089181827
+朱怀冰 13.900677652
+纳祥 13.900677652
+寮国 11.9547675029
+武泰 11.598092559
+交通肇事 11.598092559
+巴塞河 13.2075304714
+银桦 13.900677652
+叱喝 11.598092559
+达意 11.0103058941
+雁行 10.8561552143
+秋粮 10.3453295905
+对华贸易 10.9049453784
+送客 9.71102290995
+沙提 12.2912397395
+甲等 11.1926274509
+机械制造 8.51160592216
+传销 10.4666904475
+史可程 13.900677652
+借出 10.8096351986
+纳礼 12.5143832909
+花园村 12.5143832909
+安切洛蒂 12.1089181827
+阿隆神 13.2075304714
+墙垛 12.2912397395
+两篓 12.8020653633
+美容美发 11.2616203224
+萧统 11.4157710022
+奇正 10.7226238216
+浮肿 9.04086524761
+传错 12.1089181827
+脓包 10.2897597393
+毛群安 13.900677652
+甘孜县 13.900677652
+武水 11.598092559
+榆中县 12.8020653633
+纳秒 11.3357282945
+领先水平 9.75754292558
+晒衣 13.900677652
+壬午 10.9562386728
+脆生 13.2075304714
+多方指数 13.900677652
+九十盒 13.900677652
+晋为皇 13.2075304714
+埃斯泰尔 13.900677652
+定边县 11.7034530746
+换过 10.3453295905
+传闻 7.24266660611
+莫高 12.2912397395
+吸下去 13.900677652
+口头禅 10.3743171274
+王文成 11.9547675029
+黑价 13.2075304714
+弗斯和 13.900677652
+父王 9.71102290995
+观摩 10.0088573539
+乌姆之 12.8020653633
+接缝 10.642581114
+少年得志 12.5143832909
+本舰 13.2075304714
+酒不醉 11.7034530746
+观摹 12.5143832909
+石文义 12.8020653633
+武氏 10.7226238216
+美满幸福 13.900677652
+麦迪逊 11.1280889297
+喊回 13.900677652
+西南航空公司 12.8020653633
+化圆 12.5143832909
+谕示 11.0674643079
+潼关 7.88941047757
+羧基 10.3743171274
+杨廷 12.5143832909
+哲理性 10.4349417492
+借光 11.4157710022
+思辨性 11.8212361103
+奇痛无比 13.900677652
+杀生 10.3171587135
+亏失 12.8020653633
+溶血 10.0720362555
+年轻貌美 10.8561552143
+原儿茶酸 12.8020653633
+激光测距 10.2897597393
+借兵 9.54396882529
+司宣慰 13.900677652
+令闻 13.900677652
+音乐种类 13.900677652
+本色 9.04864738806
+濛濛细雨 13.2075304714
+由宁远 13.2075304714
+北京师范大学物理系 13.2075304714
+武汉 6.77138010305
+借入 9.54396882529
+少昊 10.642581114
+万寿节 11.7034530746
+磷肥厂 12.5143832909
+余种 7.45337178943
+利益驱动 10.4349417492
+讲信用 11.8212361103
+父爱 10.9049453784
+接线 10.9562386728
+鞋袜 9.6811699468
+切腹 12.5143832909
+粪便污水 13.2075304714
+颇感兴趣 11.7034530746
+瞬时功率 12.1089181827
+韩江流域 12.2912397395
+强心甙 13.2075304714
+接纳 8.28027678626
+彩旦 12.2912397395
+变通途 12.5143832909
+于龟兹 11.5027823792
+增长 4.2435383084
+洋县 11.5027823792
+发生学 11.1280889297
+覆盖面 9.62401153296
+彩旗 9.94943393339
+小部份 13.2075304714
+傻人 13.900677652
+制式化 12.5143832909
+船舷 9.87532596124
+短距离 10.0940151622
+爱火 13.2075304714
+刘春牛 12.5143832909
+指日可待 9.66657114738
+接续 10.1630080337
+良种 9.13850371718
+溶解 8.10766404359
+豆类植物 12.8020653633
+倒上去 13.900677652
+单于府 13.2075304714
+公共事业 10.0720362555
+三万英尺 12.5143832909
+船舶 7.14374526273
+成善德 13.2075304714
+破蛋 13.900677652
+康巴尔 12.5143832909
+两手硬 13.2075304714
+同类 7.6604018068
+人心惶惶 9.85762638414
+舒安皇后 13.2075304714
+少林 9.24671730182
+彩斑 11.8212361103
+光说 10.9049453784
+蒋斌 12.5143832909
+威海卫 9.96885201925
+十万八万 11.9547675029
+黄金档 12.8020653633
+以工代赈 11.598092559
+户外广告 11.4157710022
+单于庭 12.2912397395
+借借 12.8020653633
+学问渊博 11.2616203224
+视觉污染 12.1089181827
+交警 7.93453091285
+曹帅来 12.8020653633
+哮鸣音 12.1089181827
+不可造次 11.0103058941
+土壤带 12.2912397395
+蒋敬 10.765183436
+南落基 13.2075304714
+文天祥 9.84023464143
+少来 11.9547675029
+董子将 10.533381822
+专有名词 11.8212361103
+乌格尔 13.2075304714
+借债 9.66657114738
+化器 13.900677652
+蒋敏 12.8020653633
+健康报 12.5143832909
+纺丝 10.604840786
+大为惊异 11.7034530746
+回转 8.74162235276
+穷寇莫追 12.8020653633
+万寿菊 13.900677652
+中国民主政团同盟 10.8096351986
+乡校 11.8212361103
+杀球 13.2075304714
+演出 6.7721817063
+阿勒颇 10.9562386728
+首钢总公司 12.8020653633
+何皇 13.900677652
+沙漠研究 13.2075304714
+本草 9.91169360541
+超额 7.38300637906
+基金指数 9.93038573842
+束综 13.2075304714
+阿巴岛 13.900677652
+波罗奈 13.2075304714
+卢永 13.900677652
+超频 12.5143832909
+同系 11.4157710022
+建筑风格 9.55687223012
+冲锋号 11.4157710022
+临摹 9.84023464143
+认真听讲 13.2075304714
+检查 6.04281009264
+不避艰险 12.5143832909
+灯具厂 13.900677652
+发低烧 13.2075304714
+潜势 13.2075304714
+松筠庵 12.5143832909
+一往情深 10.7226238216
+观政 10.604840786
+石头砸 10.0505300503
+稍倾 13.900677652
+滚倒 11.4157710022
+十九门 12.5143832909
+大秦线 11.4157710022
+襄阳县 11.5027823792
+一晃而过 11.8212361103
+今科 11.8212361103
+演到 11.2616203224
+三万五万 11.9547675029
+字字珠玑 12.8020653633
+火锅店 10.7226238216
+黄色素 13.2075304714
+辈份 11.7034530746
+高邑 11.9547675029
+许冠文 13.900677652
+不法侵害 12.5143832909
+建研会 13.900677652
+求医问药 12.2912397395
+挠曲 10.8561552143
+五万余级 13.2075304714
+高邮 9.5186510173
+金谷 11.5027823792
+英陆军 12.5143832909
+病急 13.2075304714
+誓不回头 13.900677652
+千千米 11.3357282945
+七十二句 12.5143832909
+颇知 10.765183436
+角斑病 12.8020653633
+鹊桥 11.1926274509
+莫顿 12.1089181827
+透出去 12.8020653633
+一窍 11.7034530746
+日本文部省 12.8020653633
+建材工业 10.0505300503
+二年制 13.900677652
+薄霜 12.8020653633
+燕顺 9.5186510173
+公司地址 11.7034530746
+借取 12.5143832909
+垦区 9.89334446674
+同罪 10.7226238216
+钱伯斯 13.900677652
+演剧 9.94943393339
+国宝级 11.8212361103
+加急电报 11.8212361103
+老死 10.2897597393
+躲猫猫 11.2616203224
+光裸 12.1089181827
+欺骗 8.03989142851
+营销师 13.900677652
+宝安县 11.4157710022
+乌斯藏 11.1280889297
+埃若 13.900677652
+辜鸿铭 9.29550746599
+于大昌 13.2075304714
+实业集团 10.533381822
+公才献 13.2075304714
+同网 13.2075304714
+富营养化 11.2616203224
+本能 8.00903344015
+借口 7.42678695562
+严父慈母 13.2075304714
+打预防针 13.2075304714
+垄断性 9.77354326693
+高适 11.9547675029
+临朐 10.8561552143
+高通 11.5027823792
+传音 11.3357282945
+车尔臣 12.1089181827
+储油库 12.8020653633
+许多许多 11.4157710022
+逃回 8.75318317516
+马太效应 11.2616203224
+四联单 13.900677652
+爱珍 11.8212361103
+王若飞 11.4157710022
+巴洛 11.8212361103
+交行 8.61241062128
+临机 11.9547675029
+观景 10.9562386728
+战必先 12.8020653633
+病患 10.6818018271
+增雨 12.2912397395
+高逸 11.9547675029
+青贮饲料 12.2912397395
+佯攻 10.9562386728
+草率 9.55687223012
+怀阿拉 13.900677652
+养呢 13.900677652
+浮艳 11.5027823792
+三十两 10.642581114
+李冶著 13.900677652
+余程 12.2912397395
+王贵 11.1926274509
+彩显 13.900677652
+病情 7.31037660378
+本职 11.8212361103
+日本国 10.0505300503
+二百七十 11.9547675029
+管道工程 11.3357282945
+英国牛津 11.8212361103
+犹太复国 11.5027823792
+盘江 11.0674643079
+浮舟 12.8020653633
+爱玉 12.1089181827
+甲种 11.0674643079
+观星 11.2616203224
+百科全书式 11.3357282945
+安圭拉岛 13.2075304714
+一百九十三 12.5143832909
+谈得上 10.6818018271
+宝安区 10.9049453784
+后晌 9.54396882529
+长统靴 12.5143832909
+参赛国 13.2075304714
+密密麻麻 8.76487921493
+杂环 10.0505300503
+少搞 13.900677652
+浮船 13.900677652
+史抚治 13.2075304714
+爱玩 11.1280889297
+桅顶 12.8020653633
+唐天标 13.900677652
+控释 13.900677652
+流入量 10.533381822
+单桨 13.900677652
+锅里 8.80081122415
+埃莉 13.2075304714
+宿水餐风 13.2075304714
+借力 9.94943393339
+病愈 10.533381822
+写过信 11.7034530746
+少时 9.06439574502
+杂牌 11.5027823792
+招纳侯 13.900677652
+热情好客 12.5143832909
+世界足球 12.1089181827
+四百四十八万余两 13.2075304714
+余篇 9.23723855786
+同慧梅 10.4666904475
+博宗龙 12.5143832909
+炔化物 11.9547675029
+今後 11.8212361103
+世界卫生 11.8212361103
+张腊谏 13.2075304714
+几千顷 13.2075304714
+仓库区 11.3357282945
+莱昂斯 11.8212361103
+借势 10.2897597393
+观查 13.2075304714
+博杜恩 12.1089181827
+兰色姆 13.900677652
+默斯 12.5143832909
+亲收 13.2075304714
+演化 7.74158226348
+郑孝胥 11.598092559
+杂物 9.53122979951
+德尔达 13.900677652
+埃吉纳 13.2075304714
+绥江 11.7034530746
+蒋某 11.9547675029
+莫饶 12.8020653633
+借助 7.1542655234
+爱物 12.1089181827
+帝俊 12.8020653633
+交角 10.2371160058
+传播速度 9.84023464143
+脆皮 12.5143832909
+不知今夕何夕 12.2912397395
+快心 13.900677652
+高野 13.900677652
+鸭舌 13.900677652
+高里 12.5143832909
+褪去 10.3171587135
+课堂秩序 13.900677652
+政治宣传 12.2912397395
+醇厚 10.2117981979
+直嚷嚷 13.2075304714
+燕饮 12.5143832909
+纳税 8.25170341381
+饥寒交迫 10.642581114
+垦利 12.2912397395
+明法峻 13.2075304714
+范先生 12.2912397395
+财年 8.6803218269
+不忍心 9.08039608637
+雷于钧 12.8020653633
+传阅 10.8096351986
+几百微米 12.8020653633
+业余生活 12.2912397395
+歪风 11.598092559
+下巴颏 10.8096351986
+橘色 12.8020653633
+人生路不熟 13.900677652
+光解 11.3357282945
+连续函数 10.6818018271
+恋人们 12.8020653633
+桓帝建 12.5143832909
+少数 6.16480733202
+瓦伦纽 12.8020653633
+瓦里诺 12.2912397395
+内含甜蜜 13.900677652
+兰坪县 13.2075304714
+超高 9.6811699468
+褒贬 10.0505300503
+同线 13.900677652
+完全恢复 9.98865464655
+居柏塞 13.2075304714
+光明面 13.2075304714
+五大连池市 12.1089181827
+精原细胞 12.5143832909
+破落 10.0088573539
+螳臂当车 12.8020653633
+天马行空 10.9049453784
+夜有所梦 12.8020653633
+少教 13.2075304714
+浮荡 10.604840786
+莫霍克 11.9547675029
+辛庄村 12.2912397395
+成膜 11.0674643079
+巨大作用 9.98865464655
+养护中心 13.900677652
+限流 13.900677652
+热寂论 12.5143832909
+泥墙 11.1280889297
+增韧 12.5143832909
+超验 12.1089181827
+泥腿 11.7034530746
+获取信息 10.6818018271
+何敢 10.2371160058
+令行禁止 11.2616203224
+王开阳 12.5143832909
+少收 11.7034530746
+化合 9.49395840471
+腐殖酸 11.9547675029
+窃贼 10.9562386728
+化名 8.74162235276
+宛洛 12.8020653633
+闻哀 13.900677652
+国有产权 10.642581114
+朝天门 13.900677652
+诏书 8.48903160012
+保留项目 13.2075304714
+鞭刑 11.8212361103
+斯夸啉 13.2075304714
+民选 10.3453295905
+祖冲之 9.7898037878
+两手端 13.900677652
+金字塔状 12.5143832909
+观望 6.98000614773
+手扳 12.1089181827
+同组 11.8212361103
+罚息 11.598092559
+义和团 8.81927328699
+演变 7.12874209614
+高宗武 12.5143832909
+土壤层 11.598092559
+碧流河 12.2912397395
+有何特长 13.2075304714
+童颜 12.8020653633
+长谈阔论 13.900677652
+乌斯著 13.2075304714
+生少子 13.900677652
+迷惑性 12.1089181827
+粮饷 9.13850371718
+爱犬 12.1089181827
+热机效率 12.2912397395
+关税率 12.5143832909
+说走就走 10.3743171274
+体胀系数 13.900677652
+中文台 13.900677652
+太宗驾 13.2075304714
+相士 11.598092559
+溜溜达达 13.900677652
+黄金洞 12.8020653633
+化友 13.900677652
+高隆 11.598092559
+博尔济吉 9.31571017331
+三朋四友 12.8020653633
+尔朱 11.0103058941
+阿隆索 12.8020653633
+栽培植物 10.533381822
+郊野 10.7226238216
+戴纶巾 12.1089181827
+沙果 11.0674643079
+尔木 12.1089181827
+蓬发 13.900677652
+燕鸥 11.1926274509
+炮兵群 12.5143832909
+夹里 12.8020653633
+六分之一 10.642581114
+沙林 11.2616203224
+宗朱厚 12.8020653633
+顺我者昌 12.2912397395
+羧化 12.8020653633
+借喻 12.1089181827
+演讲比赛 12.8020653633
+牟畋 12.5143832909
+奖金额 12.1089181827
+毫末 13.2075304714
+破获 10.3171587135
+沙枣 11.1280889297
+萨尔马 11.8212361103
+喊到 11.9547675029
+内丹炼 13.900677652
+武梁 13.2075304714
+自筹经费 13.900677652
+高难 10.8561552143
+圆溜溜 11.9547675029
+梁太济 11.1926274509
+盖有 10.765183436
+新藏公路 11.3357282945
+比例控制 13.2075304714
+植食 12.1089181827
+常念 12.1089181827
+壬基 13.900677652
+芦苇荡 11.1926274509
+易主 9.80633308975
+东珠 11.4157710022
+增速 6.15654102435
+健康权 13.900677652
+向陆 11.5027823792
+马其顿共和国 13.2075304714
+尔杰 13.900677652
+高雅 9.0884932966
+增选 10.2371160058
+下句话 13.900677652
+强使 11.8212361103
+少报 12.1089181827
+成虫 8.36728816325
+刀功 13.900677652
+醇和 10.6818018271
+护理液 11.2616203224
+杀熟 13.900677652
+易丛 12.8020653633
+罗南 13.900677652
+冲压件 12.1089181827
+回归线 13.2075304714
+演员 7.08723305246
+余粮 10.3743171274
+杂用 12.1089181827
+曲霉菌 12.8020653633
+鼓风炉 11.4157710022
+强作 10.4349417492
+差别待遇 12.5143832909
+可巧 9.29550746599
+爱用 10.533381822
+沙柳 12.2912397395
+李芳芳 12.2912397395
+鹿铃 12.5143832909
+唐学曾 9.40086798165
+谷深达 12.5143832909
+杂症 12.8020653633
+国际网联 13.2075304714
+左前方 11.0103058941
+龙抢珠 13.2075304714
+高阁 9.33632946051
+龙胆草 11.8212361103
+武校 11.1926274509
+朱常瀛 13.2075304714
+牧发兵 13.2075304714
+多义词 11.9547675029
+文教区 10.4994802703
+高阔 13.2075304714
+损害赔偿 10.2117981979
+能写会算 13.2075304714
+钟鼎彝 11.9547675029
+阿勒泰地区 11.8212361103
+美国使馆 12.8020653633
+蜻蜓点水 11.3357282945
+热烈响应 11.1926274509
+孟姜女 10.4994802703
+机设备 13.900677652
+域外 10.8561552143
+高阳 9.91169360541
+余米 8.9519177616
+高阶 10.3743171274
+官拜宁 12.8020653633
+分工 7.6761192227
+易人 11.4157710022
+慧根 12.2912397395
+浮萍 10.4994802703
+高陂 13.2075304714
+双宿双飞 13.2075304714
+土壤学 10.8561552143
+尔柱 13.2075304714
+共产风 12.5143832909
+退租 13.900677652
+腾空而起 10.642581114
+沙村 13.900677652
+乳脂状 13.900677652
+实得 12.5143832909
+一二十户 12.5143832909
+径直 8.15447446144
+不量力 13.900677652
+存亡安危 13.900677652
+索福瑞 13.900677652
+柳劳军 13.2075304714
+棉纺织 9.38981814546
+高院 10.1394775363
+耐受原 13.900677652
+同种 8.9308643524
+数术 10.3453295905
+易事 10.3743171274
+易于 7.89186446653
+沙松 11.9547675029
+同租 12.8020653633
+高陵 11.4157710022
+特鲁西 13.900677652
+名门世家 13.2075304714
+交迫 12.2912397395
+线装本 12.8020653633
+有门道 12.5143832909
+陈李济 12.5143832909
+哲学思想 8.86372504956
+今绍 13.2075304714
+林箭雨 12.8020653633
+借端生事 13.900677652
+增配 11.5027823792
+填些 12.8020653633
+必需品 9.89334446674
+化募 13.2075304714
+黄金水 13.900677652
+方程式赛车 13.900677652
+职务分类 12.8020653633
+数厘米 12.1089181827
+交过 10.642581114
+工程塑料 10.765183436
+政治信仰 12.5143832909
+逃入 10.0720362555
+传遍 8.88339781516
+尔明 13.900677652
+传道 10.0505300503
+交进 12.8020653633
+易位 11.8212361103
+何难哉 10.9049453784
+肥墩墩 13.2075304714
+昔者 11.9547675029
+沙暴 9.82314020807
+交运 9.32596667347
+于未然 12.5143832909
+曝气 13.900677652
+大舅子 11.2616203224
+成蝶 13.2075304714
+电子效应 12.8020653633
+钝钝 13.900677652
+本册 13.2075304714
+浑身是胆 12.5143832909
+浮薄 11.8212361103
+刘统勋 13.2075304714
+克罗索斯 12.8020653633
+尔普 13.900677652
+台安 12.8020653633
+肖洛姆 12.8020653633
+温良 11.0103058941
+铮铮誓言 13.900677652
+金银器 10.6818018271
+易传 10.3453295905
+法萨卢斯 13.2075304714
+宰割 10.6818018271
+王守业 11.8212361103
+传送 8.28754954559
+卑鄙无耻 11.0674643079
+交辉 12.8020653633
+加里森 13.900677652
+燕齐 12.8020653633
+上等货 13.900677652
+传递 6.91503583434
+化劲 13.900677652
+沧浪亭 11.4157710022
+接站 12.1089181827
+少掉 12.5143832909
+高音 10.1871055853
+造反派 8.97342396682
+自律性 11.5027823792
+焦点人物 11.598092559
+突出表现 9.74179456862
+高韵 13.900677652
+化剂 11.9547675029
+驷马高车 13.2075304714
+西爪哇 12.5143832909
+溶质 9.66657114738
+填上 10.4666904475
+别捷夫 13.2075304714
+八宝菜 13.900677652
+二十几步 13.900677652
+烦难 11.7034530746
+限止 12.2912397395
+重生父母 12.1089181827
+增重 10.6818018271
+强人 9.33632946051
+增量 7.68807155622
+冉永平 13.900677652
+三四趟 13.2075304714
+牵制性 13.2075304714
+封锡禄 13.900677652
+强于 7.95787827685
+防晒 10.4666904475
+破船 11.1926274509
+填个 12.8020653633
+巴郡江 13.2075304714
+机要文件 12.5143832909
+郭凡生 12.8020653633
+杀灭 9.7898037878
+逃出 8.07763175649
+甲级 10.1164880181
+扪住 13.2075304714
+聚合度 11.5027823792
+即墨市 12.5143832909
+中央广播说唱团 12.5143832909
+长一智 11.9547675029
+王文杰 13.900677652
+尔曼 11.0674643079
+纳粟 12.8020653633
+胡云宣 13.2075304714
+哞哞 12.8020653633
+尔曹 13.900677652
+强令 10.1164880181
+葛底斯堡 13.2075304714
+悲切切 12.2912397395
+霏霏细雨 13.900677652
+交下去 13.900677652
+甲组 13.900677652
+手技 13.900677652
+老成练达 12.2912397395
+王之善 13.900677652
+高青 12.5143832909
+摄食中枢 13.2075304714
+观感 10.5684731418
+喝药 12.1089181827
+唐绍仪 10.2897597393
+布朗特 11.7034530746
+纳粹 8.80692745117
+乌尼马克 13.2075304714
+越少 9.49395840471
+脚踏车 11.0103058941
+武则天 8.70772080109
+张长史 13.2075304714
+光轴 11.8212361103
+通气口 13.2075304714
+居永嘉 13.2075304714
+乡民 9.53122979951
+万佛阁 13.2075304714
+忖道 9.98865464655
+纳粮 10.0505300503
+嘲讽 8.9308643524
+水采珠 12.8020653633
+接穗 11.9547675029
+有献忠 12.8020653633
+牌桌 12.2912397395
+亏少 12.1089181827
+几号 12.1089181827
+化净 13.2075304714
+王之命 11.8212361103
+马邑县 12.5143832909
+温脾 12.2912397395
+少惹 12.8020653633
+土壤污染 11.0674643079
+射手榜 12.8020653633
+杨雪一 12.8020653633
+沙文 12.5143832909
+生于 5.4857386946
+生事 9.6811699468
+阵地战 10.2117981979
+唐制 10.4666904475
+推进舱 13.900677652
+津田 13.900677652
+主凶 12.2912397395
+黄澍笑 12.5143832909
+唯独 8.79473217808
+术士 10.8561552143
+生人 9.04864738806
+覆没 10.533381822
+亏心 11.5027823792
+教育馆 12.2912397395
+一年四季 9.28555713513
+铬铁矿 10.4994802703
+借垫 13.2075304714
+弄汤 13.900677652
+徐锴 12.5143832909
+生产 4.4016307325
+索菲娅 11.8212361103
+龙生龙 13.2075304714
+弓长箭 12.8020653633
+有色人种 11.2616203224
+德田球 12.8020653633
+垦地 11.8212361103
+马尼托巴 12.8020653633
+凤仪 11.7034530746
+西陵区 13.900677652
+贫民区 11.4157710022
+高铁 9.63799777493
+哭天抢地 12.5143832909
+修筑工事 13.2075304714
+年均收入 13.900677652
+草创 9.66657114738
+尔敦 13.900677652
+钛合金 10.3453295905
+沃洛斯 13.2075304714
+化军 13.2075304714
+平风静浪 13.900677652
+接种 7.73947033028
+国内汽车 10.0505300503
+雄视一世 13.900677652
+樊增祥 13.900677652
+茶籽油 13.900677652
+风魔 12.8020653633
+亏待 9.56994431169
+小老头儿 11.8212361103
+同等 8.12612610643
+尔敏 13.900677652
+珍珠项链 11.9547675029
+凤仙 11.9547675029
+亏得 9.23723855786
+默想 10.6818018271
+化冻 12.1089181827
+王文操 13.2075304714
+正南方 11.7034530746
+生丝 9.96885201925
+生业 12.2912397395
+窗明几净 11.3357282945
+重轰炸机 11.9547675029
+翠庵 10.5684731418
+国内新闻 12.5143832909
+尔斯 10.4666904475
+生下 8.6803218269
+丢起来 13.900677652
+微云 12.2912397395
+海盘车 12.2912397395
+东邪西毒 12.8020653633
+生丁 12.1089181827
+杭甬运河 11.598092559
+本营 10.8096351986
+皇族内阁 10.8096351986
+化入 11.7034530746
+唯物 11.3357282945
+光谱 8.14493543839
+熊襄 12.8020653633
+光谷 12.2912397395
+借地 11.9547675029
+仔细搜索 11.9547675029
+王司令 10.6818018271
+盘根 11.8212361103
+爱知 12.8020653633
+陈规 10.9562386728
+双环 10.8561552143
+尔文 13.2075304714
+硕老 13.900677652
+麦仁汤 13.2075304714
+斯塔福德 12.2912397395
+瓮安 12.5143832909
+顾建兵 13.2075304714
+烦闷 9.4233408375
+尔时 12.8020653633
+超龄 12.1089181827
+饰演者 13.900677652
+得数 11.1280889297
+鼻息肉 11.598092559
+玩月 12.8020653633
+连攻 12.1089181827
+静电计 12.5143832909
+盘桓 9.53122979951
+叶含 11.5027823792
+观战 9.55687223012
+融土 13.900677652
+高鑫 11.9547675029
+毫无 6.91688768672
+交谊 10.8096351986
+微亮 13.900677652
+交谈 8.06586691491
+杀猪 9.06439574502
+伊涅斯塔 13.900677652
+生乳 11.8212361103
+山雨欲来 12.1089181827
+接神 12.5143832909
+王铎 9.96885201925
+盖板 11.3357282945
+秃顶 10.4994802703
+散文家 9.87532596124
+考驾照 9.87532596124
+采矿方法 12.1089181827
+喜树 11.1926274509
+鞍马劳神 13.900677652
+至今已有 10.1871055853
+学兵 12.2912397395
+邓本殷 12.8020653633
+相肖 13.900677652
+互通 9.91169360541
+刘志刚 13.900677652
+苑菁华 12.8020653633
+杜松子酒 12.8020653633
+花腔 10.8561552143
+一心一腹 13.900677652
+洗起来 13.2075304714
+相吻合 9.6811699468
+沩仰宗 13.2075304714
+报复性地 13.900677652
+汉诺塔 12.5143832909
+思维 7.32839510928
+府城镇 12.8020653633
+细工 11.4157710022
+妻妹 12.2912397395
+借回 13.2075304714
+火车头 9.69598503258
+生俘 11.4157710022
+病故 9.01032852375
+受难者 11.3357282945
+休兵罢战 12.8020653633
+响应号召 12.1089181827
+衣食住行 10.0088573539
+交趾 10.0940151622
+休伊特 13.2075304714
+敦煌文物研究所 12.5143832909
+手写板 13.900677652
+蔡祖泉 12.8020653633
+破胆 11.9547675029
+丛台区 13.900677652
+央视春晚 10.4041700905
+趴着 10.0294766411
+高门 10.604840786
+首面 13.900677652
+片状 8.82550383674
+花椒树 12.8020653633
+文微明 12.5143832909
+彩排 11.1280889297
+互帮互学 13.900677652
+眠尔通 13.900677652
+暗示 7.3741827924
+侯藏兵 10.5684731418
+布朗热 12.5143832909
+轻元素 11.5027823792
+光路 11.8212361103
+金属制造 11.2616203224
+梁太清 13.2075304714
+野葫芦引 13.2075304714
+数十日 11.9547675029
+季蒂昂 12.8020653633
+建议您 11.2616203224
+三四辆 12.5143832909
+临战 10.4041700905
+高洪波 10.642581114
+杨志 8.12612610643
+西欧 7.42063309005
+逻辑电路 10.9562386728
+高锟 10.4994802703
+五金制品 11.7034530746
+良缘 11.1280889297
+博瓦尼 11.8212361103
+玛尔盖 11.8212361103
+蒲类 12.1089181827
+绥棱 13.900677652
+直捣黄龙 11.598092559
+孺子牛 13.900677652
+克莱门斯 13.2075304714
+丹心照 11.8212361103
+张耀辉 13.900677652
+百步穿杨 11.598092559
+脆爽 13.900677652
+纳维 10.9562386728
+如来佛 10.7226238216
+湖人队 11.8212361103
+养鱼场 12.2912397395
+和英王 12.5143832909
+喊冤 10.642581114
+透明体 13.2075304714
+法兰克 9.48183704418
+秦庄襄王 12.1089181827
+气动阀 13.2075304714
+里科弗 13.2075304714
+人来客去 13.900677652
+唐再加 10.1630080337
+交账 11.7034530746
+交货 8.80692745117
+亚东县 11.9547675029
+曼丁 12.5143832909
+渺茫无望 13.2075304714
+楚文王 11.5027823792
+辐射加工 11.8212361103
+策杖 12.1089181827
+交费 10.9049453784
+丑小鸭 10.9049453784
+新华字典 12.1089181827
+测验题 13.2075304714
+冯保打 12.8020653633
+顺义 10.0720362555
+奇女子 11.3357282945
+忽强忽弱 12.5143832909
+喊出 10.0294766411
+纳纳 12.8020653633
+航模 13.2075304714
+天地良心 11.598092559
+逃去 9.93038573842
+枸酱 12.5143832909
+余缺 13.2075304714
+建筑面积 8.21031819765
+红灿灿 12.8020653633
+笑微微 11.3357282945
+消除隔阂 12.8020653633
+门式刚 13.900677652
+光赤 12.5143832909
+心宽体胖 12.2912397395
+蒋波 12.5143832909
+壬寅 13.2075304714
+听任 9.66657114738
+赖尼莱 12.5143832909
+乱七八糟 8.99540287354
+光芒 8.00352378434
+心沉 12.2912397395
+同用 11.1280889297
+爱神 10.7226238216
+相互协作 11.598092559
+盟兄弟 12.5143832909
+休声美誉 13.900677652
+平绥铁路 13.2075304714
+姚鼐 11.1280889297
+全部顶 13.2075304714
+陂池 13.2075304714
+余烬 11.5027823792
+牛油果 12.5143832909
+魏定族 13.2075304714
+渺无人烟 12.8020653633
+分类法 9.34680076038
+忍下去 13.2075304714
+李瑞环 11.1280889297
+磷化 10.4349417492
+魏喜 13.2075304714
+同生 10.8561552143
+超酷 13.900677652
+一跃而起 9.54396882529
+同甘 12.5143832909
+黄夫人 12.2912397395
+金俊武 8.53003962385
+死于非命 10.0940151622
+高高 8.93783302172
+穆托姆博 12.8020653633
+七言八语 12.8020653633
+杠杆 7.40692381212
+临淄 9.35738286971
+长丰县 13.2075304714
+沙比 12.2912397395
+溶胀 11.9547675029
+重新认识 10.5684731418
+曾任红 13.2075304714
+贼骨头 12.1089181827
+田海民 9.69598503258
+王进告 13.2075304714
+浩瀚无垠 12.5143832909
+余点 10.4041700905
+化德 12.2912397395
+盘曲 11.1926274509
+充分利用 7.94484028251
+回填 10.8096351986
+粮食局 10.604840786
+磨工夫 13.900677652
+超重 10.0940151622
+超量 10.0505300503
+程演生 13.900677652
+温达 10.4994802703
+蒋汪 11.8212361103
+超采 12.1089181827
+美国中央情报局 11.2616203224
+坐立 11.1926274509
+厉兵秣马 11.5027823792
+测试数据 11.598092559
+壬子 11.8212361103
+啥时候 9.09665660724
+免疫荧光 11.598092559
+布丽雅 12.8020653633
+红岩革命纪念馆 12.8020653633
+土壤圈 13.900677652
+爱称 13.2075304714
+化形 13.2075304714
+反面典型 12.1089181827
+魇寐 13.2075304714
+左右两队 13.900677652
+临洮 9.80633308975
+罚款 7.89432449237
+萨河 11.8212361103
+德尔萨 13.2075304714
+实至名归 11.5027823792
+临津 12.1089181827
+乘法器 11.7034530746
+想不起来 9.20019728618
+通亮 11.598092559
+阖上 11.4157710022
+赤橙 12.2912397395
+封为恒 13.2075304714
+宽容度 13.900677652
+临济 10.9049453784
+印钞机 11.598092559
+修土菲 13.2075304714
+切削性能 13.2075304714
+毫毛 9.16447920358
+信口雌黄 11.1280889297
+续成汉 13.900677652
+乡愿 12.2912397395
+乡愁 12.1089181827
+股肱之臣 11.9547675029
+借好 12.8020653633
+模具设计 13.900677652
+倒来 11.0103058941
+彩民 9.44633035572
+临海 9.18217878068
+拉舍夫 13.2075304714
+光色 10.4349417492
+蒋氏 12.1089181827
+接着 5.60463000921
+源兴 13.900677652
+巩大哥 12.2912397395
+有伤和气 13.2075304714
+庄则栋 13.2075304714
+家长里短 10.8561552143
+紫外线 8.64318227995
+几卷 10.9049453784
+借增 13.900677652
+揉成一团 10.8561552143
+朱然引 13.2075304714
+肿瘤外科 13.2075304714
+硫酸根 11.7034530746
+磁电式 12.8020653633
+蒙斯特 12.2912397395
+纳貂蝉 13.2075304714
+临沂 9.55687223012
+武断 10.2630914922
+光莹 12.8020653633
+乐未央 13.900677652
+乡情 11.1926274509
+弥合 10.8096351986
+原子质量 11.8212361103
+武斗 10.4041700905
+凭空想象 13.2075304714
+训练保障 13.900677652
+赵承嘏 12.8020653633
+临河 10.1630080337
+大闺女 10.4994802703
+临沭 13.2075304714
+听丁 13.2075304714
+涉足于 12.5143832909
+氯氟烃 12.1089181827
+扬武耀威 13.2075304714
+临沧 11.598092559
+大辞典 10.604840786
+波拿巴 10.1164880181
+院务部 13.900677652
+抢救 7.72481038187
+托育园 13.2075304714
+闹水灾 13.900677652
+演好 12.2912397395
+操亚非 13.2075304714
+梦魂颠倒 13.900677652
+几千 8.9102450652
+真理观 13.2075304714
+超速 10.2630914922
+人民起义 9.6811699468
+香唇 13.900677652
+武旦 12.2912397395
+临泉 12.2912397395
+奇才 9.7898037878
+特等功 11.9547675029
+观涛 13.900677652
+本该 8.96620371885
+害臊 9.96885201925
+摸不清 10.533381822
+贺鲁氏 13.2075304714
+却柔声 13.2075304714
+黑下脸 13.2075304714
+盘查 9.4233408375
+演奏 7.97375162601
+马吉德 13.900677652
+接盘 8.73589167805
+病死 8.02014466558
+富拉尼 11.0103058941
+临泣 13.900677652
+经济企划厅 12.8020653633
+忘我劳动 13.900677652
+病残 11.7034530746
+肮脏 8.75901409547
+二十几条 12.8020653633
+两栖部队 11.9547675029
+消费观 12.2912397395
+病殁 12.2912397395
+杏红 13.900677652
+明宗死 12.2912397395
+尼科巴 10.6818018271
+奇技 12.2912397395
+凶猛地 11.4157710022
+成议 11.7034530746
+乱涂乱画 13.2075304714
+德雷克斯勒 13.2075304714
+高层领导 10.8096351986
+速率方程 13.900677652
+皆成文章 12.8020653633
+临水 10.1630080337
+奚统军 13.2075304714
+蒋济 11.9547675029
+后架 12.8020653633
+观海 11.2616203224
+陶渊明 9.87532596124
+古托夫 12.8020653633
+单质 10.1394775363
+临江 9.53122979951
+蓬帅 12.8020653633
+垄断价格 10.4666904475
+呼图克图 10.4666904475
+成说 11.5027823792
+成诵 12.8020653633
+姚黄 12.8020653633
+相邦春 13.2075304714
+杂碎 10.4994802703
+左右两面 12.8020653633
+人心齐 13.900677652
+机器运行 13.900677652
+欲裂 10.8096351986
+双尖山 12.2912397395
+线粒体 9.89334446674
+还付 13.900677652
+表示同情 11.2616203224
+成语 9.80633308975
+临汾 9.10488710638
+观津 13.900677652
+捐弃前嫌 11.9547675029
+唐书表 13.2075304714
+盘条 13.2075304714
+限期 9.04864738806
+过筛子 13.900677652
+爱碧 13.2075304714
+甜薯 12.5143832909
+光荣 8.11378027061
+乡思 11.9547675029
+弧光 11.4157710022
+周老汉 13.2075304714
+串演 12.1089181827
+宋明理学 10.2630914922
+思想境界 11.2616203224
+条几 11.598092559
+高领 11.5027823792
+制氢 12.1089181827
+莫道 11.7034530746
+足球博彩 13.900677652
+借完 13.900677652
+疑信参半 13.900677652
+高额 8.24468584116
+武公初 12.8020653633
+高频 8.9519177616
+黑又亮 11.1926274509
+化州 11.598092559
+借宿 10.1164880181
+占用费 11.9547675029
+髓鞘 11.8212361103
+暖温带 8.39534611604
+普雷斯利 12.8020653633
+病株 13.2075304714
+五队 12.1089181827
+焉得虎子 11.7034530746
+高门大屋 13.900677652
+别林斯 13.900677652
+操纵子 12.2912397395
+工业废水 10.8096351986
+温泉乡 13.900677652
+仁化 11.9547675029
+回归热 12.1089181827
+临澧 11.8212361103
+香税银 11.598092559
+二百两一张 13.900677652
+爱笑 11.2616203224
+香消玉 12.5143832909
+高风 11.4157710022
+病案 12.1089181827
+蒋溥 13.900677652
+南天一 13.900677652
+少油 12.2912397395
+少年时代 9.71102290995
+感官 9.29550746599
+成衣 9.93038573842
+指回到 13.900677652
+下笔 10.2897597393
+高飞 11.1926274509
+生理零度 13.900677652
+万圣 11.7034530746
+练就 10.4041700905
+来不得 11.5027823792
+国谯郡 12.5143832909
+光能 9.82314020807
+叶尔马克 11.3357282945
+逃席 11.9547675029
+南威尔士 12.5143832909
+地质编录 12.2912397395
+磷光 10.4349417492
+性敏感 13.2075304714
+弥坚 12.8020653633
+举止言谈 11.8212361103
+武曌 11.9547675029
+那微末 13.2075304714
+成行 9.08039608637
+运营权 11.8212361103
+钱伯海 13.2075304714
+抗了 12.8020653633
+趴窝 13.2075304714
+燕邸 13.900677652
+瓮城 9.74179456862
+迷恋 9.23723855786
+王文丁 12.5143832909
+一跃而过 12.1089181827
+哲学思潮 11.0674643079
+抗争 9.10488710638
+不起眼 9.6811699468
+余牙 13.900677652
+嚎叫 9.65218240993
+特拉华河 12.1089181827
+鞭子 8.25170341381
+光耀 10.1394775363
+斯法克斯 12.8020653633
+托木尔峰 10.9049453784
+工程顾问 13.2075304714
+武昭 13.2075304714
+寰海 12.5143832909
+几千里 10.8096351986
+勒内 11.7034530746
+皮筏 11.8212361103
+加历练 13.2075304714
+二万余 11.1926274509
+接生 9.62401153296
+核反应堆 9.53122979951
+约集 12.1089181827
+儿孙 9.56994431169
+阴历年 12.2912397395
+交联 9.84023464143
+破败 9.33632946051
+武昌 7.82763311788
+王令尹 12.8020653633
+菁菁 12.5143832909
+杰索尔 13.900677652
+同知 9.13850371718
+扇惑 13.900677652
+惠通桥 12.8020653633
+自取罪戾 13.900677652
+本行 9.71102290995
+度荒 12.8020653633
+封郑国 12.1089181827
+暂行规定 9.91169360541
+本街 13.2075304714
+英语语法 11.598092559
+教育长 10.7226238216
+嫁给 7.8184587416
+老鼠过街 11.598092559
+偶然事故 12.8020653633
+蒲篮 12.8020653633
+刘易斯堡 12.2912397395
+接界 10.2117981979
+临潼 9.87532596124
+贺牧 13.2075304714
+莫邪 11.1926274509
+本表 12.1089181827
+高顺 10.8096351986
+封海西 12.8020653633
+经济实体 10.4041700905
+临潭 11.1926274509
+魏金玉 13.2075304714
+燕郊 11.2616203224
+材料厂 11.9547675029
+静夜 10.6818018271
+证据确凿 10.9562386728
+尔格 10.7226238216
+限时 11.2616203224
+浮词 13.900677652
+化妆棉 11.598092559
+唐在今 12.5143832909
+沙梁 13.2075304714
+苏山岛 12.8020653633
+百万两 12.2912397395
+定期检验 12.5143832909
+高香 11.4157710022
+随缘乐助 13.900677652
+逃归 10.9049453784
+本职工作 11.0674643079
+清承明 12.8020653633
+杀绝 11.598092559
+沙梨 12.1089181827
+纳特 11.2616203224
+经验过程 13.900677652
+信仰危机 12.8020653633
+几千遍 13.2075304714
+官宦 9.7898037878
+交臂 12.2912397395
+汉建魏 11.8212361103
+纳物 13.2075304714
+胎毛 11.3357282945
+临溪 11.7034530746
+反覆无常 13.900677652
+刘锦藻 12.5143832909
+白狗子 13.900677652
+徐羡之 13.2075304714
+奥杜韦 11.7034530746
+奇怪 6.46053097131
+休养生息 9.98865464655
+丧家 12.2912397395
+唯美 10.533381822
+物候学 12.1089181827
+卤化物 10.4994802703
+甜蜜 8.66423568915
+权为民 12.8020653633
+成盐元素 13.900677652
+奥林帕斯 13.2075304714
+沙棘 10.3453295905
+后白蛋白 13.900677652
+抗体 8.41588071849
+陪起来 13.900677652
+观澜 11.9547675029
+台阶 7.43920947562
+同登 11.0103058941
+博亚卡 12.2912397395
+芦盐区 11.9547675029
+和慈禧 12.8020653633
+肯定性 11.598092559
+天不假年 13.900677652
+反动势力 10.3453295905
+答错 13.2075304714
+受用不尽 13.900677652
+愠怒 10.8096351986
+埃诺 12.1089181827
+斯伍德 13.2075304714
+泾浊渭清 13.900677652
+伊菲格 12.5143832909
+布吕赫 13.2075304714
+义和庄 13.900677652
+少海 13.900677652
+光脑 12.2912397395
+第五十回 12.2912397395
+天客隆 13.900677652
+莫里 11.598092559
+临渊 12.2912397395
+潘凤 13.900677652
+流出地 13.900677652
+轩辕夏禹 12.8020653633
+临清 9.46986085313
+百万亩 12.2912397395
+武术 8.80692745117
+晶格点 13.900677652
+皮肤感染 11.598092559
+观潮 11.598092559
+不阴不阳 11.7034530746
+接球 10.9049453784
+晋发荣 12.8020653633
+临港 10.4666904475
+麦森 13.900677652
+病榻 10.2630914922
+蓬山 13.2075304714
+汤府 11.0674643079
+尔梅 13.900677652
+万寿观 13.2075304714
+议案 7.35820569147
+百万件 13.2075304714
+倒替 11.4157710022
+法言 13.2075304714
+临湘 10.8096351986
+边角料 11.9547675029
+临湖 11.598092559
+沃洛格 13.2075304714
+逃往 8.1386262692
+武松 7.8093677699
+卜哈河 13.2075304714
+尔森 11.8212361103
+兵工 11.0103058941
+奇情 12.8020653633
+内圣外王 12.8020653633
+杨增 11.8212361103
+环境优美 10.4666904475
+乔巴姆 13.2075304714
+同相 11.9547675029
+靖国军 12.1089181827
+买不起 9.12999302751
+甲烷 9.0884932966
+反证法 12.1089181827
+少洗 13.900677652
+木板桥 13.900677652
+阎氏 13.2075304714
+菁英 13.2075304714
+歆羡 13.2075304714
+成见 9.74179456862
+应尽 10.5684731418
+成规 10.2897597393
+同盟 7.66626692626
+帕尼巴 12.8020653633
+环行线 13.2075304714
+大浦 11.9547675029
+刘恩溥 13.2075304714
+水密型 13.2075304714
+久负盛名 9.96885201925
+老天爷 8.47133202302
+往生咒 13.900677652
+天刚亮 11.3357282945
+凹处 11.0103058941
+卓大惊 13.2075304714
+募集 6.22188865378
+农产物 12.8020653633
+威海市 10.9562386728
+刘爱卿 13.2075304714
+诈败佯输 11.9547675029
+国务会议 11.1280889297
+彩棚 11.4157710022
+容于汉 13.2075304714
+血友病 11.0103058941
+尿道感染 12.8020653633
+杰尔查 13.2075304714
+克里斯滕森 11.3357282945
+本身 5.65136390572
+巨大胜利 11.5027823792
+乳酸盐 13.900677652
+像模像样 10.642581114
+玉峰山 13.900677652
+于忠肃 12.2912397395
+写下去 11.5027823792
+接班 10.1394775363
+具体意见 11.598092559
+枣强县 12.8020653633
+一百零八 11.0103058941
+笨死了 13.900677652
+一百零六 11.9547675029
+颈淋巴 13.900677652
+降频 13.2075304714
+武惠 11.9547675029
+康定路 13.900677652
+光蛋 13.900677652
+王伦遂 12.8020653633
+本体感 12.8020653633
+古家具 13.900677652
+好个秋 13.900677652
+巨型机 11.3357282945
+讲价 11.4157710022
+干部带头 13.2075304714
+放荡不羁 10.604840786
+阿勒锦 12.2912397395
+溷浊 12.8020653633
+阴虚治 13.900677652
+孙兰香 11.4157710022
+近亲结婚 11.1926274509
+邪见 12.8020653633
+提纲挈领 12.5143832909
+料理店 11.9547675029
+大三元 12.8020653633
+红柱石 11.0674643079
+一两分 12.8020653633
+王钿 11.1280889297
+心水 11.9547675029
+干重 10.9562386728
+文恬武嬉 12.2912397395
+肠病毒 12.8020653633
+术前 10.642581114
+玉镜展 13.2075304714
+田禄 13.2075304714
+沙漏 12.1089181827
+温记 12.1089181827
+弓激波 13.900677652
+指路明灯 13.900677652
+托事 13.2075304714
+控制算法 13.2075304714
+化子 12.5143832909
+长滩 11.2616203224
+一夫多妻 11.0103058941
+云泥之别 13.900677652
+温计 12.8020653633
+盘成 11.9547675029
+垫高 10.765183436
+分动箱 10.4994802703
+病源 10.4994802703
+仁者无敌 12.8020653633
+汝谐 13.900677652
+蒋桂 11.2616203224
+民主自由 10.5684731418
+富集铀 13.900677652
+化学 6.13172160744
+高鸣 11.9547675029
+库尔干 12.1089181827
+田福 12.8020653633
+宰客 12.5143832909
+莫雷 11.0674643079
+高鸿 10.4041700905
+抢断 11.7034530746
+多用型 13.900677652
+保险带 12.8020653633
+火绒 11.5027823792
+褪尽 11.598092559
+鬈发 11.598092559
+高鹏 13.900677652
+见闻广博 12.8020653633
+零打碎敲 13.900677652
+炼钢炉 11.5027823792
+插入鞘中 11.3357282945
+卓大怒 11.9547675029
+心情舒畅 10.604840786
+温语 12.2912397395
+薄面 11.7034530746
+上告信 13.900677652
+讲义 9.7898037878
+高级律师 13.2075304714
+公因式 13.900677652
+池里洗 13.900677652
+童鞋 12.2912397395
+林森桥 13.2075304714
+国大党 9.7898037878
+和素馨 13.2075304714
+洒洒潇潇 13.900677652
+山东省 7.92686804011
+宫衫 13.900677652
+讲书 10.5684731418
+明张燮 13.2075304714
+温词 11.9547675029
+罗刹 10.1871055853
+步桥 13.2075304714
+寥若晨星 11.8212361103
+胎气 11.1926274509
+燕雀 11.5027823792
+卢江 13.900677652
+硫酸氨 13.900677652
+主航道 10.8096351986
+金紫光 12.2912397395
+风光明媚 12.8020653633
+陈献章 12.8020653633
+田禾 11.9547675029
+自流水 11.7034530746
+外务大臣 10.8096351986
+高龄 9.44633035572
+润湿 10.7226238216
+洪大尉 11.7034530746
+贝拿勒斯 11.7034530746
+澹台 10.642581114
+爱慧梅 12.8020653633
+莫非 7.29267702668
+许汉卿 13.2075304714
+得克萨斯州 9.5062284973
+爱米 13.900677652
+沙溪 10.8096351986
+洪福齐天 11.598092559
+甜腻 12.1089181827
+赛里木湖 11.3357282945
+殷之常 13.2075304714
+李之徒 12.8020653633
+温言 12.1089181827
+隔代遗传 13.900677652
+小提琴家 10.4994802703
+杂类 10.6818018271
+多党合作 10.642581114
+画眼线 12.8020653633
+桡骨 11.5027823792
+性器官 9.77354326693
+莫霍 11.598092559
+杨坚辅 12.5143832909
+王脱欢 12.8020653633
+许昌 7.89926277401
+开学日 13.900677652
+游戏规则 9.80633308975
+本连 12.5143832909
+马尼拉湾 12.2912397395
+跌停 7.13103567512
+临检 13.900677652
+无权无势 11.8212361103
+珊珊来迟 13.900677652
+植醇 12.8020653633
+交融 9.77354326693
+索里亚 13.2075304714
+以守为攻 12.8020653633
+燕青 8.78868986362
+孽障种子 13.900677652
+应天顺人 11.0103058941
+元古宇 12.5143832909
+甲癣 12.2912397395
+奇景 9.54396882529
+奇普 12.5143832909
+莫霸 13.2075304714
+彭亨河 13.900677652
+一百三十一卷 13.2075304714
+朱红灯 12.5143832909
+所在之处 13.900677652
+杂糅 11.2616203224
+时开时停 13.2075304714
+静电能 13.900677652
+彩楼 11.598092559
+戽水 13.900677652
+胡诚善 11.4157710022
+成达 13.2075304714
+于川康 13.900677652
+李功英 13.900677652
+余留 13.900677652
+会时常 12.2912397395
+说到 10.4994802703
+二百四十五万余 13.2075304714
+日不落 11.0103058941
+孙海平 12.5143832909
+武愫 12.2912397395
+润滑 9.37888907493
+滕子京 12.8020653633
+混迹 10.4041700905
+唐僧抱 13.900677652
+杰弗逊 12.2912397395
+埃贡 13.900677652
+唐兵 11.4157710022
+都亚耶 12.8020653633
+高鼻 10.6818018271
+李重茂 12.1089181827
+乱世 9.15574552361
+爱憎分明 10.9049453784
+杜米埃 11.8212361103
+两粒 10.533381822
+浮起 10.2897597393
+尤氏方 12.5143832909
+转租给 12.2912397395
+接物 12.8020653633
+沭阳 11.5027823792
+顺位 12.5143832909
+片瓦无存 13.900677652
+国军之 12.2912397395
+流出入 12.5143832909
+百喙莫辩 13.900677652
+张伯 13.2075304714
+琵琶骨 11.9547675029
+救出去 12.5143832909
+蛇蝎心肠 13.2075304714
+人潮如涌 13.900677652
+余生 10.1394775363
+再造想象 13.900677652
+巴彦浩特 12.5143832909
+玉泉路 13.900677652
+铁人三项 12.5143832909
+临桂 11.8212361103
+苏发努 12.8020653633
+绝对把握 13.2075304714
+沙湖 10.8561552143
+埃赫 11.598092559
+盘据 11.5027823792
+本轮 7.83225206373
+西居昂 12.8020653633
+杂粮 9.12155415886
+晋无公 13.2075304714
+王永谦 13.2075304714
+杨博乘 13.2075304714
+兴复 11.1926274509
+曹之策 12.8020653633
+敌阵 9.98865464655
+沙湾 10.4994802703
+余田 12.8020653633
+鞭尸 11.8212361103
+一心一计 12.2912397395
+爱网 13.2075304714
+借得 10.765183436
+于无声处 11.8212361103
+高鲁 13.2075304714
+静电荷 12.8020653633
+冷凉 10.9562386728
+逃婚 12.1089181827
+工会组织 10.7226238216
+汉译华 13.2075304714
+云半雾 11.3357282945
+谕知 13.2075304714
+余盐 12.8020653633
+杀鸡抹脖 13.900677652
+谢晋 12.1089181827
+格沃兹 13.2075304714
+溶蚀 9.65218240993
+慢点儿 11.9547675029
+麦蚜虫 13.900677652
+直性 11.9547675029
+货箱 11.1280889297
+甲申 10.5684731418
+豆腐皮 11.7034530746
+嫩嫩 13.900677652
+救人者 13.900677652
+武技 11.9547675029
+和议 9.0884932966
+热切地 10.4349417492
+半深海相 13.900677652
+几十岁 12.1089181827
+宰夫 12.8020653633
+几列 11.5027823792
+七侠五义 11.9547675029
+丝绸服装 13.2075304714
+化妆 9.06439574502
+小太监 8.9519177616
+光照强度 12.5143832909
+混合牙列 13.900677652
+造陆运动 12.8020653633
+余皆 10.5684731418
+教区牧师 13.900677652
+铣削 11.9547675029
+半干法 12.8020653633
+日本首相 9.6811699468
+非暴力 10.2371160058
+渤海海峡 10.533381822
+纳省 13.900677652
+推着 8.63281949291
+散文化 11.7034530746
+相契 12.1089181827
+万钧巨 13.2075304714
+奇数 9.62401153296
+斯涅耳 11.8212361103
+不正当地 13.2075304714
+乔巴山 11.7034530746
+留兰香 12.1089181827
+沙淤 12.2912397395
+尔济 11.7034530746
+有益健康 11.0103058941
+超霸 13.900677652
+斯克里普斯 11.598092559
+良相 11.5027823792
+破解 8.63798746307
+增高 7.93197009199
+沙洋 12.5143832909
+仪止 13.2075304714
+唐宋古 13.900677652
+各持己见 12.2912397395
+几斗 12.5143832909
+胶东半岛 10.3453295905
+须卜氏 12.8020653633
+分守 10.7226238216
+斯特拉斯堡 9.94943393339
+连晶 13.2075304714
+同现 13.2075304714
+渠系 10.9049453784
+量过大 11.2616203224
+激发光谱 13.2075304714
+鹿鸣 11.1926274509
+掩盖住 11.2616203224
+武成 11.0103058941
+快餐盒 13.900677652
+互帮互助 13.900677652
+太赫 13.900677652
+美洲狮 12.5143832909
+鞭形 13.900677652
+千里 7.88452049228
+小朋友 9.7898037878
+杨大 10.8561552143
+乡村 7.56385192083
+今番 8.97342396682
+朱自清 11.1926274509
+如果说 7.28461246684
+去污粉 13.900677652
+沙洲 8.70772080109
+职业病 9.32596667347
+超音 13.900677652
+武戏 11.1280889297
+于东郡 12.5143832909
+今生 9.38981814546
+化处 13.2075304714
+全行 10.2630914922
+罗圈椅 12.2912397395
+庄里有 11.8212361103
+同班 10.8561552143
+开水瓶 13.900677652
+接连起来 12.5143832909
+糊涂一时 11.1926274509
+几副 10.533381822
+少校 9.72629038208
+高鹗 12.2912397395
+化外 11.1926274509
+红桧林 13.2075304714
+大涨大跌 11.2616203224
+草原法 13.2075304714
+防毒软件 13.900677652
+托格勒 12.8020653633
+爱美 9.63799777493
+甘孜州 12.5143832909
+武打 11.1926274509
+旷代 12.8020653633
+分家 9.27570483869
+城堡石 13.900677652
+全国人民代表大会 8.96620371885
+多行 9.65218240993
+喊声 8.15447446144
+细小 8.17382990439
+牧牛区 13.900677652
+蓬头 11.5027823792
+一得之愚 13.900677652
+爱群 13.900677652
+令人喷饭 13.2075304714
+临武 12.5143832909
+阳曲县 12.2912397395
+沙海 11.2616203224
+王崇古 10.2117981979
+荔湾 12.5143832909
+蠹虫 11.8212361103
+妇科医院 13.900677652
+和哲罗 13.900677652
+曝晒 10.4349417492
+断肠人 13.2075304714
+通信员 11.5027823792
+羊癫疯 13.900677652
+谢瓦尔德纳泽 12.5143832909
+沙沙 9.80633308975
+流出去 11.7034530746
+接点 10.9049453784
+言少叙 12.2912397395
+睑腺炎 13.2075304714
+成败 8.80692745117
+超限 9.82314020807
+过灵隐 13.2075304714
+药罐子 12.8020653633
+牛根生 13.900677652
+萨克森豪森 13.2075304714
+道林纸 13.2075304714
+辛汉臣 13.2075304714
+行动自如 12.8020653633
+逃学 10.9049453784
+蓬壶 12.5143832909
+尔氏 11.598092559
+百里之才 13.900677652
+破袭 11.7034530746
+由厘金 12.8020653633
+埃达 12.5143832909
+火箭专家 12.2912397395
+沙河 9.01032852375
+教育部 8.42003872863
+深度广度 13.2075304714
+化境 12.2912397395
+调重 13.900677652
+漂来 11.7034530746
+正琢磨 11.4157710022
+恩施土家族苗族自治州 12.8020653633
+温表 13.2075304714
+疏于防备 12.8020653633
+卡哈尔 12.5143832909
+莫错 12.8020653633
+新市区 10.0720362555
+温补 10.4041700905
+自缢身亡 12.1089181827
+埃迪 12.5143832909
+德尔菲 11.9547675029
+柳梦梅 12.5143832909
+管到 11.9547675029
+尔汗 11.3357282945
+良知 9.4233408375
+沙波 12.1089181827
+沙泥 10.9562386728
+专利制度 13.2075304714
+从那时起 9.38981814546
+亚拉伯 13.900677652
+低首下心 13.900677652
+长袖善舞 12.8020653633
+不动产业 12.8020653633
+贾祸 12.8020653633
+同犯 12.8020653633
+甜菜 8.52539924429
+管制 8.03704647638
+尔河 11.5027823792
+胡骚情 13.2075304714
+投影画 13.900677652
+难读 12.5143832909
+牧场主 12.1089181827
+全景网 8.0484751722
+蓬塞 13.900677652
+转口港 11.598092559
+骨头架子 10.765183436
+实时控制 13.2075304714
+观止 13.2075304714
+尔沙 12.2912397395
+卫队 9.20019728618
+本质 6.9431802811
+纳克会 13.2075304714
+荣孟源 13.2075304714
+一半路 12.5143832909
+转动轴 12.8020653633
+毒魔狠怪 12.2912397395
+字后 12.5143832909
+晨报讯 10.9562386728
+赶尽杀绝 10.9562386728
+尔沃 12.8020653633
+弧圈 12.8020653633
+沙汉 13.2075304714
+傅焕光 13.2075304714
+接火 12.1089181827
+难说 8.95903522937
+青纱 11.5027823792
+尔泰 12.5143832909
+红过 11.598092559
+鄙称 13.2075304714
+谷四郡 12.8020653633
+东半球 10.2630914922
+父系 9.01032852375
+尔波 12.8020653633
+高度计 11.8212361103
+不礼貌 10.7226238216
+地表水 9.36807815882
+网络安全 10.642581114
+新崭崭 12.8020653633
+骄兵 10.765183436
+呢料 12.8020653633
+感到恐惧 11.0103058941
+左道之 13.900677652
+于牧野 12.5143832909
+尔法 13.2075304714
+广玉兰 12.8020653633
+有此 8.91707103027
+尹黑牛 12.5143832909
+唐军 9.80633308975
+化妆水 11.2616203224
+黄碧签 13.900677652
+弥勒 9.10488710638
+过得 8.26946587015
+交响组曲 11.7034530746
+性情中人 11.3357282945
+局势不妙 12.8020653633
+盘庚 10.7226238216
+谋利益 12.5143832909
+红胡子 10.2371160058
+狗彘不食 13.2075304714
+打死老虎 12.8020653633
+赚法 13.900677652
+雨霁 12.8020653633
+盘库 13.900677652
+石锁 13.2075304714
+武岭 12.8020653633
+脑瓜子 10.642581114
+条令 9.94943393339
+造次行事 13.2075304714
+周俊杰 13.900677652
+朴正熙 11.8212361103
+识别码 11.8212361103
+掮客 11.3357282945
+一言未发 11.8212361103
+鸟瞰 8.6966709649
+冥思苦索 13.2075304714
+李虚 12.8020653633
+沙县 11.0674643079
+千言万语 10.765183436
+胡应麟 11.7034530746
+新世纪 8.49350588052
+病到 11.9547675029
+化妆台 13.900677652
+古尔本 13.900677652
+陈奎一 10.3453295905
+南海发展 13.900677652
+明英宗 10.3453295905
+粪堆 11.1280889297
+石镜 11.8212361103
+沙参 10.642581114
+黯淡下来 12.1089181827
+二十几座 12.8020653633
+二十几度 12.8020653633
+大大咧咧 9.94943393339
+宰杀 9.71102290995
+硫唑嘌呤 12.8020653633
+沙发 7.72273353793
+五蕴皆空 12.1089181827
+千千万 12.1089181827
+石镇 13.2075304714
+恭敬不如从命 12.2912397395
+沭阳县 11.7034530746
+燃气具 13.900677652
+君子之交 13.900677652
+强筋 11.9547675029
+转换机制 11.9547675029
+石镰 11.4157710022
+海登海 13.2075304714
+睁目 12.2912397395
+布莱辛 13.900677652
+杰尔宾 12.8020653633
+和庆亲王 13.900677652
+马首是瞻 10.8561552143
+凤髓龙肝 13.2075304714
+作战处 13.2075304714
+四十余所 12.8020653633
+半壁河山 13.2075304714
+喀尔巴阡山脉 10.8096351986
+嵊州 13.900677652
+弗留尔 13.900677652
+富益贫 12.2912397395
+诗论家 11.9547675029
+第四十二条 12.5143832909
+条件 4.89551813094
+沙包 10.9562386728
+浑浊度 13.900677652
+显硕 12.8020653633
+塔轮 12.5143832909
+跳上跳下 11.7034530746
+帝兵 13.900677652
+病恹恹 12.2912397395
+影武者 13.900677652
+毫厘 11.7034530746
+二十几年 10.7226238216
+沙化 10.5684731418
+学问家 11.8212361103
+阪神 11.8212361103
+深根固本 12.5143832909
+管理系统 9.18217878068
+南丹州 12.5143832909
+尼加拉瓜 9.96885201925
+盘带 12.8020653633
+几趟 10.4994802703
+潘季训 12.1089181827
+三十好几 12.8020653633
+病势 9.87532596124
+沙区 10.8561552143
+武将 8.40350942668
+限幅 12.2912397395
+蓬松 9.33632946051
+田耕棋 12.8020653633
+武山 11.4157710022
+起居生活 12.2912397395
+稻谷 8.5440913773
+奇寒 11.3357282945
+晚邮报 11.7034530746
+军工企业 11.5027823792
+观后 11.9547675029
+中枢性 11.2616203224
+二百余名 12.8020653633
+酸麻 10.765183436
+填筑 11.1280889297
+永久性 8.80692745117
+康继立 12.8020653633
+陡峭 8.41588071849
+等倾条纹 13.900677652
+罚单 10.2371160058
+绥德 10.765183436
+姚令言 12.8020653633
+深感忧虑 11.9547675029
+宰柏 13.2075304714
+人机交互 11.4157710022
+一九六五年 12.1089181827
+接住 8.64840422393
+近千家 12.2912397395
+自然辩证法 11.2616203224
+离您 13.900677652
+门墙桃李 13.900677652
+暴安民 12.5143832909
+风土人情 9.87532596124
+跟出 12.2912397395
+生硬 9.30555780184
+失用症 12.8020653633
+日里诺夫斯基 13.2075304714
+修习者 13.2075304714
+化机 13.900677652
+满额 10.4349417492
+小高炉 13.900677652
+动植物学 13.2075304714
+粤语片 12.5143832909
+壹百万两 13.900677652
+达活泉 12.2912397395
+烟台万华 10.1871055853
+喘证 13.900677652
+一分钟 8.83177344976
+满饮 10.4666904475
+沙力 13.2075304714
+纺线 10.533381822
+府兵制 10.1164880181
+接人 11.1926274509
+纺纱 8.73589167805
+左辅正 12.8020653633
+一分钱 8.93783302172
+上海贝尔 12.8020653633
+生离 11.8212361103
+身后事 11.9547675029
+逃散 9.58318953844
+沙加 13.2075304714
+二聚体 12.5143832909
+市布 13.2075304714
+夹七夹八 13.2075304714
+动感地带 12.2912397395
+第八十七回 12.5143832909
+生成式 12.5143832909
+射手座 13.2075304714
+中国茶叶研究所 12.8020653633
+草原区 9.7898037878
+病区 10.4666904475
+高可立 11.8212361103
+少城 13.2075304714
+鱼目帆 12.5143832909
+纺绩 11.4157710022
+扇子 8.42003872863
+司拉绪 12.1089181827
+皮亚西 13.900677652
+主刑 11.5027823792
+波拿文 12.5143832909
+纺绸 11.4157710022
+塔身 10.4994802703
+接任 8.77671367257
+鸭蹼 12.8020653633
+枝江市 13.2075304714
+找门路 11.8212361103
+娘病 13.2075304714
+病卒 9.7898037878
+小伙儿 11.1926274509
+修明史 13.2075304714
+杠杆作用 10.5684731418
+哲学系 10.3743171274
+钟欣桐 13.900677652
+纺织 6.3853330808
+吉格斯 13.900677652
+武川 10.533381822
+万平方公里 7.37858485381
+中选优 10.8096351986
+真人真事 11.2616203224
+蔡国公 12.8020653633
+喊来 10.2630914922
+人体生理 10.5684731418
+病危 9.49395840471
+做错 9.94943393339
+石钟 11.2616203224
+盘式 10.4666904475
+接个 11.2616203224
+瓶塞儿 13.900677652
+罚分 12.8020653633
+大邱庄 12.8020653633
+宦商民 13.900677652
+接电话 9.40086798165
+言定 13.2075304714
+克罗米 13.2075304714
+朱棣文 11.2616203224
+罚则 11.9547675029
+子子婴 12.8020653633
+抗疟 11.7034530746
+游七领 12.2912397395
+靠边 10.6818018271
+范德臣 13.2075304714
+尔加 13.2075304714
+乡塾 13.2075304714
+崩龙 12.8020653633
+王鑫 9.69598503258
+注册处 12.8020653633
+五万块 13.900677652
+接下 9.71102290995
+白扁豆 12.2912397395
+俞禄 12.5143832909
+悲诉 13.900677652
+荆门市 11.7034530746
+拙政园 11.1280889297
+清音阁 12.5143832909
+秦力山 11.598092559
+斯克利 12.8020653633
+罚到 12.2912397395
+睁眼 8.78868986362
+谢升 10.4349417492
+抗病 9.80633308975
+病友 10.4994802703
+干盐湖 12.2912397395
+仰其容 13.900677652
+言一语 12.8020653633
+壬戌 11.7034530746
+人员伤亡 9.98865464655
+小宝贝 12.1089181827
+管键琴 11.4157710022
+和立盟 12.5143832909
+亏格 12.2912397395
+病变 7.50042020667
+胎儿 7.87723005901
+石铁 12.2912397395
+指腹为婚 12.2912397395
+仇赵 13.2075304714
+港航 11.5027823792
+广州空军 13.900677652
+石铲 10.8561552143
+尔勒 12.8020653633
+萨斯喀彻温 12.2912397395
+道康宁 13.2075304714
+生祭 12.8020653633
+靠近 7.44233936863
+落掉 13.2075304714
+平淮仓 13.2075304714
+女扮男装 10.9562386728
+填空 12.2912397395
+病号 11.0674643079
+断层谷 12.1089181827
+地下掩体 12.5143832909
+合脚 11.7034530746
+幻想片 13.2075304714
+武崇训 12.1089181827
+鱼水情 13.900677652
+武康 11.7034530746
+武术队 13.2075304714
+小城邦 12.2912397395
+北京中南海 12.2912397395
+怀斯 12.2912397395
+刀光剑影 10.765183436
+同伴 8.3285236198
+跌入 9.6811699468
+斯克内 12.5143832909
+光量子 10.9562386728
+巴西利亚 10.5684731418
+病倒 9.01787572939
+不太可能 8.58255765813
+武库 10.7226238216
+无政府主义 9.38981814546
+遭雷击 11.9547675029
+武庙 12.8020653633
+武庚 10.765183436
+舟子 11.598092559
+讲点 10.6818018271
+演成 12.1089181827
+暗中帮助 13.900677652
+演戏 8.92394390956
+却引军 13.2075304714
+化时 13.2075304714
+这局 12.2912397395
+下半叶 8.71889410168
+议决 9.7898037878
+奇夫 13.900677652
+路路通 11.9547675029
+胎动 11.0103058941
+谢禄 13.2075304714
+逆势上涨 10.3453295905
+东街口 11.2616203224
+尔兹 11.2616203224
+毫克 8.55834340001
+石青 10.9562386728
+武建 10.5684731418
+化斋 10.1871055853
+刑事拘留 9.59661255877
+尔兰 13.2075304714
+瞋目 12.8020653633
+奇奇 12.2912397395
+老哈河 10.4349417492
+策勒 12.1089181827
+格里河 12.8020653633
+张八哥 12.2912397395
+炼钢业 13.900677652
+包起 11.7034530746
+一万多顷 13.2075304714
+编缉 13.2075304714
+黔江区 13.900677652
+奇女 13.900677652
+李萍 13.2075304714
+翻案风 11.8212361103
+消化系统 9.48183704418
+同住 10.0940151622
+藤黄 11.5027823792
+明会典 10.9049453784
+群侠 13.900677652
+萨科齐 10.0505300503
+奇奥 12.8020653633
+细心 8.55834340001
+同体 11.598092559
+罚出 13.900677652
+频次 11.1280889297
+乡官 11.4157710022
+陡峻 9.37888907493
+抱憾 11.7034530746
+热敏性 13.900677652
+宋献 13.900677652
+瞎到 13.900677652
+业障 12.2912397395
+中注协 10.9049453784
+黄金宝 11.9547675029
+汤姆斯杯赛 13.2075304714
+化敌 13.2075304714
+奇妙 8.81927328699
+分类器 13.900677652
+战功卓著 10.4994802703
+策划 7.84623830571
+亏死 13.2075304714
+老战士 10.9049453784
+颈动脉 10.8096351986
+人心 7.37564799413
+皮蒙 13.2075304714
+一毫升 13.900677652
+出生地 9.74179456862
+克列沃 12.5143832909
+临场 11.0674643079
+伊博 12.2912397395
+硫酸厂 12.2912397395
+二十几层 13.2075304714
+希尔斯 11.7034530746
+武帝 8.57766767284
+布赖 11.0674643079
+类脂 11.0103058941
+严峻考验 9.6811699468
+抗皱 11.598092559
+武师 11.1280889297
+不可磨灭 10.3453295905
+由裕盛 13.2075304714
+演技 10.0505300503
+胡大人 9.75754292558
+万宁县 12.2912397395
+二磷酸 11.5027823792
+孔玛朵 12.8020653633
+密歇根 9.58318953844
+百万石 12.2912397395
+少吸 13.2075304714
+强秦 11.7034530746
+燕尾形 13.2075304714
+亏欠 10.533381822
+尔凯 13.900677652
+物自体 11.4157710022
+花剌子 10.7226238216
+农家女 12.5143832909
+驴肉 10.7226238216
+鞭挞 9.93038573842
+鄱阳湖区 11.4157710022
+柯南道 12.1089181827
+尔凡 13.900677652
+作文题 12.8020653633
+将欲取之 13.2075304714
+薛公子 12.8020653633
+李续宾 11.8212361103
+吕奉先 12.5143832909
+褪成 13.900677652
+咄咄逼人 9.40086798165
+石韵 12.8020653633
+出苗率 12.5143832909
+借据 12.2912397395
+少吃 11.8212361103
+强租 11.2616203224
+群雄割据 11.7034530746
+易碎 10.9049453784
+音像 9.71102290995
+盘山 10.2371160058
+石韦 12.5143832909
+五万名 12.2912397395
+弧段 13.900677652
+免于 9.22784881751
+麦克唐纳 10.3743171274
+武德 9.40086798165
+弥渡 12.8020653633
+免予 10.2897597393
+掘进 9.74179456862
+锌肥 13.900677652
+生搬硬套 11.4157710022
+亚硝酸盐 10.765183436
+白素贞 13.900677652
+营养医师 13.900677652
+罗格 11.9547675029
+同为 8.23771717184
+二人组 12.1089181827
+锁定器 13.900677652
+哂纳 13.2075304714
+年销 13.900677652
+弱苗 13.2075304714
+同一 6.42647284548
+誓不两立 12.2912397395
+同上 9.12155415886
+同下 12.8020653633
+石阵 13.2075304714
+都锦生 11.0674643079
+病儿 11.0674643079
+危重症 10.4994802703
+脑勺 13.2075304714
+胎发 12.5143832909
+同业 8.18694484647
+瓦伦丁 12.5143832909
+强硬 8.69119149913
+拔下来 12.1089181827
+同乡 8.58255765813
+雏凤 12.8020653633
+前一天 8.52078029844
+策反 11.0103058941
+防水表 13.900677652
+埳井之蛙 13.900677652
+参赛权 13.2075304714
+袁将爷 10.7226238216
+西田 10.9562386728
+肖阿姨 12.8020653633
+显像剂 12.8020653633
+高康州 13.2075304714
+实用教程 13.900677652
+虞集驰 12.8020653633
+艺术部 12.5143832909
+宫西 13.900677652
+烧焊 13.2075304714
+港股 7.6468488404
+同义 9.84023464143
+嘉兴县 12.2912397395
+凝胶体 13.900677652
+冷冻 9.25628675283
+褪掉 11.5027823792
+同乐 10.6818018271
+杨姓 10.7226238216
+鲁接界 12.8020653633
+未遂案 13.2075304714
+同产 13.900677652
+关联性 10.1630080337
+插腰 13.900677652
+烈火真金 12.2912397395
+武强 11.598092559
+东昌府 11.4157710022
+雏儿 11.7034530746
+两亿九千余万两 13.2075304714
+边幕 13.2075304714
+奇境 12.2912397395
+鞭打 9.93038573842
+防碍 13.900677652
+土壤水 11.1926274509
+强碱 9.93038573842
+数方 13.2075304714
+耿氏 12.2912397395
+颁令 12.1089181827
+有轨电车 10.3743171274
+同于 10.0720362555
+马承宣 13.2075304714
+挠痒痒 12.2912397395
+利涅尔 13.2075304714
+尚衣 13.2075304714
+国际足坛 12.8020653633
+静宁 11.0103058941
+苗公 13.2075304714
+美国伊利诺伊大学 11.4157710022
+少商 13.2075304714
+病况 12.8020653633
+鸭跖草 11.4157710022
+佣金 8.38724890581
+蒋坝 12.8020653633
+花海子 12.5143832909
+尝试 7.2872934336
+穆桂英 10.765183436
+油茶树 12.5143832909
+屎壳郎 12.2912397395
+晋葛洪 12.8020653633
+皮亚诺 11.7034530746
+石雕 8.83808261895
+东瀛 12.1089181827
+背包袱 11.9547675029
+全国冠军 11.2616203224
+最新消息 9.96885201925
+金黄色 8.80692745117
+李薰 12.8020653633
+武彪 13.900677652
+杀菌器 13.900677652
+王文公 12.2912397395
+顶多有 11.7034530746
+武当 10.1871055853
+毫无区别 12.5143832909
+同仁 9.54396882529
+类聚 11.0674643079
+精神分析 10.0294766411
+强磁 12.2912397395
+插脚 12.1089181827
+李薇 10.9562386728
+谏劝 11.5027823792
+桥脚 13.2075304714
+过生日 9.59661255877
+蜀都 11.7034530746
+奇士 12.5143832909
+陈俊生 12.1089181827
+伤心地 9.46986085313
+果胶 10.3453295905
+盛极必衰 12.5143832909
+塔诺 12.5143832909
+歌乐山 12.5143832909
+李良 10.9562386728
+明宗图 13.2075304714
+沙垅 12.1089181827
+振奋起来 11.1926274509
+尚远 10.6818018271
+劳动工具 9.93038573842
+赣南 9.71102290995
+潘璋领 13.2075304714
+奇异 8.12923652885
+生粉 11.9547675029
+三十六年 9.63799777493
+毛纺业 12.8020653633
+李艳 12.5143832909
+轮不上 11.9547675029
+单于母 13.2075304714
+幼兽 11.0103058941
+爱荷华 12.8020653633
+张丹 12.5143832909
+滨江道 12.8020653633
+借方 11.8212361103
+商鲁麟 12.8020653633
+军事行动 8.71889410168
+奇强 13.2075304714
+一心为公 12.5143832909
+航行者 13.2075304714
+每夜 9.69598503258
+起跳点 13.2075304714
+别林斯基 10.7226238216
+棉纺业 10.8561552143
+武卫右 11.598092559
+御夫座 11.0674643079
+每一项 10.2371160058
+代收款 12.8020653633
+李舫 12.8020653633
+子随父 13.900677652
+沙城 11.598092559
+垄断集团 11.0103058941
+产销合同 13.900677652
+少加 12.5143832909
+西行求 11.8212361103
+银耳汤 11.1280889297
+段聚醚 13.2075304714
+陈设 8.62767809341
+武士 8.18364995057
+智慧之门 13.2075304714
+军调部 12.2912397395
+终身不忘 13.900677652
+化探 11.598092559
+残酷性 11.0674643079
+产品简介 12.8020653633
+玉皇信仰 13.900677652
+数所 11.5027823792
+豁出来 12.1089181827
+弄弄坪 13.2075304714
+沙基 12.2912397395
+西班牙共产党 11.2616203224
+培养能力 13.2075304714
+抗灾 11.1926274509
+郭强 13.900677652
+裘皮服装 12.8020653633
+拜跪 12.8020653633
+心地好 12.8020653633
+裁尺 13.900677652
+管及 12.8020653633
+电影队 12.2912397395
+邢二夫人 13.2075304714
+宽宽大大 13.900677652
+佩尼亚 13.900677652
+静室 10.9049453784
+演播 12.2912397395
+沙土 8.80081122415
+吴薇 13.900677652
+李英 12.2912397395
+枪枝弹药 13.900677652
+讯问 10.0505300503
+心源 11.7034530746
+超外差 12.1089181827
+寄卖店 13.2075304714
+电源开关 12.8020653633
+觉悟社 11.9547675029
+武堂 13.900677652
+沙场 9.40086798165
+设得兰 11.3357282945
+杨树浦 12.2912397395
+沙地 9.20932976975
+苏曼殊 11.1280889297
+彩票案 12.8020653633
+袁国平 12.2912397395
+冥顽不灵 11.7034530746
+江河日下 11.598092559
+尔基 12.1089181827
+主厅 12.2912397395
+小提琴手 11.598092559
+沙坎 11.8212361103
+陈掌爷 12.5143832909
+文泰来 13.900677652
+酒阑人散 12.5143832909
+北台 11.7034530746
+软件可靠性 12.8020653633
+左盘右 11.9547675029
+禹和尧 12.8020653633
+沙坝 10.9049453784
+易纬 13.2075304714
+沙坑 11.7034530746
+李花 12.2912397395
+花园口 9.87532596124
+李芳 9.94943393339
+几何学 8.81927328699
+沙坪 13.2075304714
+少列 13.900677652
+沙坡 11.8212361103
+椋鸟 11.9547675029
+抗热 11.3357282945
+盖顿 13.900677652
+绥宁 11.7034530746
+病因 7.70219893548
+普雷斯波 13.900677652
+沙坦 13.900677652
+电力线 11.2616203224
+少分 12.8020653633
+明快生动 13.900677652
+易纂 12.8020653633
+赵大人 10.1871055853
+西番 10.765183436
+熊霜 13.900677652
+一千余页 13.2075304714
+东柏林 12.8020653633
+李荣 10.6818018271
+了望塔 13.900677652
+靳羽西 13.900677652
+石逊 12.8020653633
+直呼其名 11.1280889297
+扇开 13.2075304714
+蜂拥而至 10.1871055853
+电力网 10.7226238216
+子贝洛 13.2075304714
+拉丁语 9.29550746599
+针麻 13.2075304714
+磨砂膏 12.8020653633
+杨树叶子 13.2075304714
+雏型 10.8096351986
+十三脸 13.2075304714
+佯动 11.7034530746
+满腔热血 13.900677652
+货品 9.96885201925
+无疗效 13.2075304714
+千辛万苦 9.85762638414
+李承鹏 13.900677652
+蒂罗尔 12.1089181827
+绝缘油 12.1089181827
+舍我其谁 11.8212361103
+石造 11.9547675029
+甲骨文 8.78268383956
+大柳树 11.1280889297
+铁虎车 12.8020653633
+红毛绿 13.900677652
+一个十五六岁 12.5143832909
+网络版 11.9547675029
+石道 11.3357282945
+十三腔 13.2075304714
+少去 10.9049453784
+蒋冯 11.5027823792
+桑椹子 13.900677652
+限宽 13.2075304714
+仇视 9.89334446674
+半新半旧 13.2075304714
+山东人 10.2117981979
+类蛋白质 13.900677652
+摸不到 11.1280889297
+侯门公 13.2075304714
+黄金屋 12.5143832909
+滑竿 11.3357282945
+春寒料峭 11.8212361103
+黄金山 12.5143832909
+今人 9.26594866375
+反式构象 13.900677652
+限定 8.4801426527
+司府制 13.2075304714
+李茂 11.9547675029
+奇幻 10.7226238216
+无韵体 12.8020653633
+天长县 13.2075304714
+李茜 12.8020653633
+宰执 10.2371160058
+榫头 13.900677652
+蒋军 11.2616203224
+埃米尔 10.4666904475
+青筋 9.59661255877
+农官 11.598092559
+忘战必危 12.5143832909
+久经考验 11.9547675029
+紫云山 12.5143832909
+两鬓如霜 13.2075304714
+仁宗 9.08039608637
+武夷 9.93038573842
+执行长 10.0940151622
+今乐 13.900677652
+观光 9.15574552361
+电子光学 11.7034530746
+黄金岛 13.2075304714
+句柄 13.900677652
+胜造七级浮屠 11.598092559
+恋母 13.2075304714
+武大 8.88339781516
+沃德姆 12.8020653633
+李菲 12.5143832909
+武夫 10.6818018271
+一二十卷 13.2075304714
+卓立 13.2075304714
+胡适任 13.2075304714
+乡居 11.7034530746
+少卖 11.7034530746
+一百步 12.8020653633
+叶水夫 13.2075304714
+军医学院 12.8020653633
+彩光 12.5143832909
+观兵 11.8212361103
+西界 9.93038573842
+紧密连接 12.8020653633
+鸟爪 13.2075304714
+甲亢 10.9049453784
+武备 9.24671730182
+网络状 13.2075304714
+棕红 11.5027823792
+沙嘴 10.2117981979
+冲锋枪 8.36334338496
+少华 10.8561552143
+鲜奶 11.0103058941
+彩儿 13.2075304714
+七十二候 12.1089181827
+怪诞不经 13.900677652
+今世 10.4994802703
+新日 10.8561552143
+康待宾 13.2075304714
+甲仙 13.2075304714
+化成 9.04086524761
+李莹 12.5143832909
+盘存 11.8212361103
+石郎 13.900677652
+圣玛尔塔 13.2075304714
+朝鲜人 9.93038573842
+盘子 8.23425096386
+萨米迪 13.900677652
+李莉 11.3357282945
+艺术院 11.0103058941
+今丹 13.900677652
+干城章嘉峰 11.9547675029
+机敏过人 12.8020653633
+无风带 11.9547675029
+濑户内海 11.5027823792
+黄金峡 12.5143832909
+非说 11.8212361103
+病名 11.8212361103
+抗爆 11.4157710022
+病后 9.93038573842
+加里宁 11.5027823792
+山区县 11.9547675029
+毒奶粉 11.3357282945
+此役 9.96885201925
+奇崛 11.0103058941
+沙善 13.2075304714
+强索 12.1089181827
+畹町 11.1926274509
+张氏世 13.2075304714
+凤纹 12.5143832909
+宇宙射线 10.8096351986
+一睹为快 12.2912397395
+关联方 9.72629038208
+王氏乃 13.2075304714
+喊成 13.900677652
+临县 12.1089181827
+企业倒闭 11.7034530746
+卫星通信 9.61021821083
+居建康 12.8020653633
+梁平县 13.2075304714
+晶粒大小 13.2075304714
+杨朝英 13.2075304714
+鱼台县 12.2912397395
+余份 12.8020653633
+国家教育委员会 12.5143832909
+久闻大名 11.4157710022
+莫过于此 12.2912397395
+潘帕斯 11.3357282945
+庸庸碌碌 11.7034530746
+余件 9.89334446674
+余事 11.9547675029
+椭圆状 11.1926274509
+雌鼠 13.2075304714
+碘钨灯 12.1089181827
+伊朗人 10.9562386728
+吴明彻 13.2075304714
+透明纸 13.2075304714
+武卫军 11.9547675029
+病员 11.7034530746
+文艺创作 10.6818018271
+李耳 12.1089181827
+程普分 13.2075304714
+余五 13.2075304714
+余亩 10.6818018271
+低血糖症 11.598092559
+挟裹 12.5143832909
+李老 11.1926274509
+快餐业 12.8020653633
+暗恋着 12.5143832909
+负载量 13.900677652
+闻孙策 13.2075304714
+丝丝缕缕 10.7226238216
+余人 8.0600359946
+少傅 10.2117981979
+一个十岁 11.8212361103
+正赶上 10.0505300503
+秋声赋 12.2912397395
+细胞信号 13.900677652
+纳伦 13.900677652
+借期 13.900677652
+塔西 11.9547675029
+鞭杆 12.5143832909
+花四宝 12.8020653633
+激发起 11.1280889297
+西崴子 13.2075304714
+明宗命 12.8020653633
+测试阶段 13.900677652
+吃吃喝喝 11.1280889297
+讲理 10.4041700905
+李能 8.83808261895
+男孩儿 13.2075304714
+黄金律 13.900677652
+返回舱 13.2075304714
+预言者 12.5143832909
+阿根廷湖 13.900677652
+运营官 11.0103058941
+借机 8.47133202302
+行政编制 12.1089181827
+咖哩 11.8212361103
+女真人 9.77354326693
+曹锟部 12.8020653633
+武威 9.16447920358
+王也尊 13.2075304714
+李胜 11.598092559
+那丰儿 13.2075304714
+贾夫人 13.2075304714
+尔喀 10.1164880181
+余三 11.8212361103
+多胚现象 13.2075304714
+余下 8.39941944143
+穆林 13.900677652
+炖牛肉 12.8020653633
+泻盐 13.900677652
+余丁 12.5143832909
+余一 13.900677652
+良久 8.4980002701
+新华联 10.4349417492
+余万 8.56795885871
+巴多利奥 11.4157710022
+余业 11.8212361103
+蟒袍 10.9562386728
+二十二三岁 12.1089181827
+阿根廷港 12.5143832909
+恻然 13.2075304714
+汤曜明 13.900677652
+闾为帝 13.2075304714
+涪陵市 11.9547675029
+北南 11.8212361103
+讨便宜 12.8020653633
+透出来 11.5027823792
+尼亚语 12.5143832909
+英国下院 11.8212361103
+尚贤 11.2616203224
+李肃 11.2616203224
+得克萨斯 10.3453295905
+良乡 11.3357282945
+临危 10.0088573539
+奇巧 10.642581114
+能量转移 11.7034530746
+拉斐尔 10.0720362555
+豆腐乳 11.5027823792
+润喉 11.5027823792
+借来 9.72629038208
+借条 11.2616203224
+蓝瑛 12.5143832909
+陈鹤琴 12.2912397395
+议和 8.26588804881
+武家 11.0674643079
+倒行逆施 10.604840786
+少出 11.5027823792
+羊绒衫 12.2912397395
+化妆品 8.38724890581
+分类号 12.5143832909
+叶榆县 12.8020653633
+大块头 10.8561552143
+画派 8.76487921493
+默写 11.7034530746
+弗朗谢 13.2075304714
+谕令 10.533381822
+天道酬勤 12.8020653633
+李登云 9.34680076038
+咖啡 7.78038023302
+二百余口 12.8020653633
+雌鹅 13.2075304714
+唐浩明 13.900677652
+武宗 9.59661255877
+武官 8.87023973058
+故作玄虚 13.900677652
+武定 11.4157710022
+奇尼 13.900677652
+武宜 12.8020653633
+修械所 12.8020653633
+尔后 8.9519177616
+武宁 10.8096351986
+观叶 12.2912397395
+观台 13.900677652
+王祥卧冰 13.900677652
+尔吉 12.5143832909
+别失八里 10.4041700905
+郄穴 12.1089181827
+吊祭 13.900677652
+再来一个 11.0103058941
+于才德 13.2075304714
+余例 11.7034530746
+少冲 13.2075304714
+蓝灰色 10.8561552143
+书法艺术 10.4041700905
+彻底性 11.1926274509
+梵天 10.642581114
+塔拉瓦岛 13.900677652
+阿香吓 13.2075304714
+耐受性 11.3357282945
+白血病 9.38981814546
+泅水 11.1280889297
+沙哑 9.49395840471
+转基因 9.00283785202
+纳丁 12.8020653633
+坦克兵 10.4349417492
+劳动工分 13.900677652
+纳丹 13.2075304714
+羁绊 9.7898037878
+克拉斯诺亚尔斯克 11.3357282945
+掘墓人 11.1280889297
+身材修长 12.5143832909
+石鉴 12.8020653633
+破破烂烂 10.1871055853
+威尔斯 10.9049453784
+雌鸟 9.41204128224
+脑袋 6.75627047165
+有案可稽 13.900677652
+布里斯托 12.8020653633
+汪国真 13.900677652
+极轴 12.2912397395
+余位 10.9049453784
+保护鸟 13.2075304714
+斗牛舞 13.2075304714
+彩印 12.2912397395
+数担 13.2075304714
+鲁斯之 13.2075304714
+临刑 10.604840786
+外科医生 10.533381822
+人心所归 13.900677652
+二进宫 11.598092559
+乌苏里斯克 13.2075304714
+任振华 13.900677652
+龙颜大悦 12.2912397395
+纳什 10.8561552143
+五湖四海 10.9049453784
+刘深 12.2912397395
+伽楠香 13.900677652
+潘西境 13.2075304714
+雌黄 11.3357282945
+空中小姐 13.900677652
+一二十元 13.2075304714
+核销 10.7226238216
+秦诸州 13.2075304714
+临到 9.56994431169
+类萜 11.7034530746
+五万元 11.4157710022
+怕死鬼 11.598092559
+颊骨 13.900677652
+临别 10.9049453784
+轮班看守 13.2075304714
+良伴 13.2075304714
+奇岩 12.1089181827
+二十几天 12.2912397395
+默克 13.2075304714
+逃掉 10.3171587135
+电磁干扰 11.2616203224
+泽库县 13.900677652
+李膺 11.0674643079
+二千锤 12.8020653633
+武学 11.2616203224
+士大夫 8.4801426527
+背囊 9.35738286971
+偏至 13.900677652
+二十几头 13.2075304714
+余众 9.71102290995
+几碗饭 13.900677652
+西瓯 11.0103058941
+递回去 13.900677652
+儿科医生 12.5143832909
+化性 11.4157710022
+谢老爷 12.8020653633
+一排排 9.58318953844
+小城镇 9.55687223012
+引航道 13.2075304714
+借景 11.1280889297
+咖喱 13.2075304714
+国富兵强 12.8020653633
+后遗症 9.12999302751
+水硬性 12.8020653633
+义和拳 11.1280889297
+勋衔 12.2912397395
+二百余匹 13.2075304714
+口下留情 13.2075304714
+余万种 12.2912397395
+甘巴拉 13.900677652
+利源 12.8020653633
+怎好意思 12.8020653633
+第四页 13.900677652
+洗发 10.9562386728
+杰里科 11.4157710022
+雌酮 12.8020653633
+外线投篮 13.900677652
+报名表 13.900677652
+深化改革 9.01032852375
+水德尚 13.2075304714
+易物 11.1280889297
+杜兰尼 11.598092559
+体裁形式 12.8020653633
+缺衣少穿 12.8020653633
+秉烛夜谈 12.1089181827
+赖茶清 13.2075304714
+苑流风 12.8020653633
+曝光 8.04560572977
+弗朗茨 12.5143832909
+坦克师 9.91169360541
+易牙 12.5143832909
+快包 13.2075304714
+核验 12.5143832909
+合不拢嘴 10.5684731418
+甜菜碱 13.900677652
+明公勿 13.2075304714
+第二十九 10.765183436
+一年多来 9.21854642485
+加兹尼 12.1089181827
+染工 13.900677652
+花园式 13.2075304714
+孙旭烈 12.8020653633
+泥沙运动 11.7034530746
+鸟群 11.2616203224
+冠部 12.8020653633
+硫黄硫化 12.8020653633
+九十一 12.5143832909
+九十七 11.8212361103
+临川 9.98865464655
+少庵 13.900677652
+臭水沟 11.2616203224
+少康 11.0674643079
+九十三 12.8020653633
+举头 10.765183436
+南大门 10.8561552143
+弥散 9.7898037878
+计堤备 13.900677652
+信心百倍 11.8212361103
+盘回 12.5143832909
+魏移治 12.8020653633
+倪正东 11.5027823792
+西莫维奇 13.900677652
+鸟翼 12.8020653633
+干酵母 13.2075304714
+智慧结晶 13.900677652
+风华正茂 11.5027823792
+满不在乎 9.27570483869
+少府 10.6818018271
+孝敬老人 12.8020653633
+生热 11.1926274509
+诛灭 10.765183436
+小阁儿 12.2912397395
+运营商 8.10158499752
+易爆 11.2616203224
+尔宾 12.5143832909
+碳原子 8.82550383674
+酸雨 10.5684731418
+少年 7.11735245137
+毫安 11.5027823792
+肩胛骨 10.765183436
+直上直下 10.9049453784
+都说会 13.900677652
+观展 12.5143832909
+乡关 12.8020653633
+酸雾 12.8020653633
+痴心妄想 10.6818018271
+马林科夫 12.1089181827
+仕宦 9.93038573842
+水旱灾害 10.7226238216
+战皆捷 12.2912397395
+一二十年 11.5027823792
+尼亚佐夫 13.900677652
+尔宜 13.2075304714
+徐元 12.2912397395
+仕官 13.900677652
+来积香 12.5143832909
+马木路 12.8020653633
+讲稿 10.4666904475
+漏缝 13.2075304714
+王文娟 12.8020653633
+先天之精 12.2912397395
+熊骨 12.2912397395
+观山 8.55834340001
+海登斯 13.2075304714
+天马山 12.5143832909
+良好基础 10.3453295905
+乡党 9.91169360541
+武后 10.1630080337
+扇动 10.533381822
+严阵以待 10.4666904475
+常小兵 12.1089181827
+办实事 10.7226238216
+作出反应 9.7898037878
+潘石屹 9.71102290995
+黄火木 11.7034530746
+红蜻蜓 10.6818018271
+易犯 13.2075304714
+海耶斯 13.900677652
+鬼迷心窍 10.765183436
+武周 10.5684731418
+沙子 8.81308131674
+土壤排水 13.2075304714
+讲究 7.31450599712
+沙特政府 12.2912397395
+尤风宁 13.900677652
+奇台 10.9562386728
+表现手法 9.31571017331
+生灵 8.83808261895
+少帝 10.5684731418
+天翻地覆 9.84023464143
+得空 10.3453295905
+生灭 10.9049453784
+生火 9.98865464655
+后来者居上 12.8020653633
+纳粹党 9.59661255877
+郭建 12.1089181827
+现出 8.3555002075
+生熟 11.4157710022
+夹板气 12.8020653633
+左懋第 11.2616203224
+擅自行动 11.7034530746
+多用户 11.5027823792
+加升汝 13.900677652
+白如霜 13.2075304714
+雕工 11.1280889297
+五百五十卷 13.2075304714
+九十余 12.5143832909
+恐惧感 10.533381822
+卓古城 13.2075304714
+杜里 12.8020653633
+吹大气 13.2075304714
+尼亚萨 12.8020653633
+仰头望 11.2616203224
+插话 8.83808261895
+局部变量 10.7226238216
+鸟纲 9.35738286971
+艾利逊 12.5143832909
+熔融 9.13850371718
+准迁证 12.8020653633
+平原君 11.7034530746
+奇利 12.5143832909
+史班勇 12.2912397395
+可执行文件 11.5027823792
+偏转 9.36807815882
+金融时报 9.33632946051
+南宁地区 11.4157710022
+黔阳 11.7034530746
+进度表 12.1089181827
+千辆 11.3357282945
+顾宪成 11.3357282945
+鱼石脂 13.900677652
+第二十四章 10.4994802703
+弹回来 13.2075304714
+索南嘉 13.2075304714
+封魏国 13.900677652
+挫折 8.28390655431
+分飞 12.2912397395
+新城镇 12.8020653633
+价格战 9.77354326693
+正合适 11.1280889297
+病孩 12.8020653633
+少得 9.30555780184
+石鱼 11.8212361103
+了不起 8.22050504296
+病学 13.2075304714
+蓬溪 12.5143832909
+路途遥远 11.0103058941
+感光剂 13.900677652
+少征 12.8020653633
+拉近乎 13.900677652
+少待 11.1926274509
+敬侯 13.900677652
+拴马桩 11.8212361103
+默念 10.1630080337
+免疫扩散 13.900677652
+李迪 13.2075304714
+孤胆 11.598092559
+奇功 10.3743171274
+儿童智力 11.9547675029
+蒋嵩 13.900677652
+贝蒂 11.1926274509
+孟冲 8.85725253506
+目眩神驰 13.900677652
+石鲈 12.8020653633
+鼎足三分 13.900677652
+石鲁 11.8212361103
+锦衣卫 8.6803218269
+明宗子 12.8020653633
+曾助金刚 13.2075304714
+病室 11.3357282945
+玄德终 13.2075304714
+台前县 13.2075304714
+譬如说 9.87532596124
+信息论 10.2897597393
+章正宸 12.5143832909
+李进 12.8020653633
+病容 10.8561552143
+领导岗位 10.2897597393
+李连 12.2912397395
+黑叶猴 12.5143832909
+盘地 13.2075304714
+病家 11.4157710022
+饱和电流 13.900677652
+病害 9.16447920358
+冰激凌 11.1926274509
+花样年华 11.5027823792
+花样游泳 11.8212361103
+墓中人 13.900677652
+风鸟 13.2075304714
+曲折性 11.8212361103
+乐羊 11.9547675029
+有把握 9.04864738806
+李达 10.3743171274
+李辰 13.2075304714
+盘坐 12.2912397395
+党政干部 11.7034530746
+奇勋 12.8020653633
+迥然相异 11.4157710022
+隐名埋姓 11.598092559
+李辉 11.9547675029
+诗礼 12.2912397395
+费眼 13.900677652
+李辅 12.1089181827
+杏仁 9.44633035572
+蒙蒂克拉 12.8020653633
+少开 12.2912397395
+十三路 12.2912397395
+偏远 9.66657114738
+辞旧岁 13.2075304714
+武商 10.3743171274
+每堆 13.900677652
+李生民 12.5143832909
+马里 8.86372504956
+汙水 12.8020653633
+李豪 12.5143832909
+各立门户 12.8020653633
+生物科学 10.604840786
+艺术馆 10.533381822
+石鼓 10.4041700905
+牛犊子 11.5027823792
+齐怀远 12.1089181827
+命题 8.13235665618
+探视病人 13.900677652
+自燃性 13.900677652
+蒋廷 12.1089181827
+石鼎 11.7034530746
+鞭毛 9.26594866375
+化淤 12.2912397395
+弥月 13.2075304714
+京津塘高速公路 11.7034530746
+万世一时 13.900677652
+雅俗共赏 11.0103058941
+嫁个 11.598092559
+郑先生 11.598092559
+武卫左 12.8020653633
+尔复 12.8020653633
+弥望 11.9547675029
+同型号 13.2075304714
+何庆彦 11.1280889297
+镔铁 11.3357282945
+何方神圣 11.4157710022
+党支书 11.3357282945
+三面红旗 11.4157710022
+破损 9.23723855786
+仰卧起坐 12.2912397395
+仕女 10.0940151622
+沙姆 11.598092559
+集结成 11.9547675029
+鞋后跟 12.2912397395
+重新铸造 13.2075304714
+燕引兵 12.8020653633
+阿坝县 12.5143832909
+彩度 13.2075304714
+败落 10.2630914922
+奇兵 9.61021821083
+罗金仙 12.1089181827
+亏掉 10.9562386728
+一二十岁 13.2075304714
+李谅 12.8020653633
+吉勒耶 13.2075304714
+凡有 9.01787572939
+作文选 13.900677652
+低合金 12.2912397395
+五千二百余亩 13.2075304714
+尔奈 12.5143832909
+梧桐子 12.5143832909
+尔奇 12.2912397395
+三摊 12.8020653633
+李谔 13.2075304714
+李谕 13.2075304714
+办学条件 11.0674643079
+插袋 13.2075304714
+石龙 10.642581114
+石龟 11.598092559
+探花郎 12.8020653633
+飞砂走石 11.1926274509
+明见澈 13.2075304714
+射击理论 13.2075304714
+议处 11.4157710022
+承天寺 10.9562386728
+登州 9.61021821083
+明尼苏达州 10.9562386728
+蒋干 10.6818018271
+阳三郡 11.9547675029
+饯行 9.49395840471
+捡破烂儿 13.900677652
+杨延昭 13.900677652
+五彩祥云 13.900677652
+无缝钢管 8.68574189437
+默尔 12.2912397395
+马吕斯 12.5143832909
+奇冷 13.2075304714
+补血药 11.9547675029
+抗纤 13.900677652
+颇佳 11.1280889297
+安陆 10.4666904475
+生父 10.3743171274
+鬼丫头 12.1089181827
+王丕平 12.2912397395
+音分 13.900677652
+亏损 6.48972577639
+奇冤 12.2912397395
+二百余年 12.5143832909
+十三身 13.900677652
+小行会 12.8020653633
+嫁人 9.5062284973
+促凝剂 13.2075304714
+上亮子 11.8212361103
+酸钠 10.4994802703
+颇会 13.900677652
+唯一 5.95158615215
+技不如人 12.5143832909
+杀伐 10.9562386728
+花鸟 8.91707103027
+武器 6.10092433369
+仇虎 13.900677652
+拉大旗作虎皮 12.2912397395
+沃洛夫 12.1089181827
+彩带 10.6818018271
+少少 13.2075304714
+黄金叶 12.5143832909
+皮绳 11.3357282945
+二十几名 11.5027823792
+杀伤 7.87481167815
+分类帐 13.900677652
+颇似 11.0103058941
+史赵评 13.2075304714
+广泗奏 13.2075304714
+恢复过来 10.0294766411
+生物 5.91587426224
+少将 7.46452728361
+尔姆 13.900677652
+骄佚 13.2075304714
+借此 8.26946587015
+斯泰福 12.2912397395
+现有企业 11.9547675029
+于华中 12.2912397395
+蒋忠 13.2075304714
+合成词 11.5027823792
+观心 13.2075304714
+衣片 11.8212361103
+黄杏秀 13.900677652
+匀速运动 11.9547675029
+电能表 12.5143832909
+小伙子 7.42987814819
+克德浑 11.3357282945
+剃头刀 11.9547675029
+分蜜机 12.8020653633
+临床 6.96142370593
+偏心眼儿 13.900677652
+魏定国 10.0505300503
+佛手柑 12.8020653633
+东张西 13.2075304714
+十四万余 13.2075304714
+乡勇 8.85082164473
+褪毛 13.900677652
+防御区 13.900677652
+尤文图斯队 12.8020653633
+起波纹 13.900677652
+观念 6.84020128598
+抗缴 13.900677652
+杀价 11.9547675029
+半路出家 10.9049453784
+非周期性 10.8096351986
+石鸡 11.3357282945
+人平 13.900677652
+雏妓 12.5143832909
+知情权 9.25628675283
+李质 10.4994802703
+负气 10.4349417492
+苗锦 13.2075304714
+谷超豪 13.2075304714
+李贤 11.598092559
+揍过 12.8020653633
+七十只 13.2075304714
+山之阳 11.8212361103
+李贺 11.1280889297
+李贽 10.6818018271
+演武 11.8212361103
+锣声 9.69598503258
+为丛驱雀 12.1089181827
+李贵 10.642581114
+海盗王 13.900677652
+联机系统 12.8020653633
+奇偶 12.2912397395
+沙士 13.900677652
+临建 11.9547675029
+全身 6.54823655173
+尔塔 12.5143832909
+简简单单 10.3453295905
+病好 10.2117981979
+闭卷考试 13.900677652
+凉冰冰 12.5143832909
+观德 11.7034530746
+新华路 11.9547675029
+亏折 13.2075304714
+水势汹涌 12.8020653633
+搧风 13.900677652
+取之于民 11.598092559
+武城 11.7034530746
+乡办 12.2912397395
+肽酶 13.2075304714
+生猛 10.3743171274
+伊诺努 12.2912397395
+侯高智 13.2075304714
+临帖 11.4157710022
+武场 12.5143832909
+窦房阻滞 13.900677652
+沙堆 11.0103058941
+装配车间 13.900677652
+桃李满天下 11.8212361103
+桥西 11.4157710022
+武圣 12.2912397395
+强点 13.2075304714
+尔墨 12.1089181827
+格克伦 13.2075304714
+蓬江 13.2075304714
+封建道德 11.2616203224
+化汞 13.900677652
+和解 8.43261751084
+天暗 12.8020653633
+文奇 13.2075304714
+欧拉角 12.1089181827
+不敢造次 10.4349417492
+李跃 11.4157710022
+沙堤 10.6818018271
+识别率 13.2075304714
+醇正 12.5143832909
+生猪 8.81308131674
+蒋录 13.2075304714
+校园网 12.5143832909
+沙堰 11.9547675029
+黄毛丫头 11.2616203224
+交通图 12.2912397395
+石麦 12.8020653633
+术数 11.0103058941
+约旦哈希姆王国 12.8020653633
+诏令 8.74162235276
+上不着天 12.1089181827
+陈佳荣 12.8020653633
+据传说 10.765183436
+石黑 13.900677652
+怀疑派 12.2912397395
+商务英语 13.900677652
+擐甲执兵 13.900677652
+佩列尔 13.2075304714
+化气 12.2912397395
+涪陵区 13.2075304714
+刀光血影 12.8020653633
+下颌前突 13.900677652
+新世界 9.15574552361
+登崖 12.8020653633
+茹茹 12.8020653633
+塞马沃 13.2075304714
+乃曰 10.8096351986
+强烈 5.930628347
+清晖园 12.5143832909
+连续介质 10.1394775363
+颇丰 9.41204128224
+一九四六年 11.1926274509
+辞职书 13.2075304714
+颇为 7.1877214513
+豆制品 9.65218240993
+易熔 12.8020653633
+王也先 12.8020653633
+肺水肿 10.1871055853
+数百亿美元 12.2912397395
+酒石 13.2075304714
+卡迪尔汗 13.2075304714
+美质 13.2075304714
+沙律 13.900677652
+大士族 13.2075304714
+白僵菌 12.8020653633
+狼外婆 13.2075304714
+张清见 12.1089181827
+彭亨州 13.900677652
+六千六百元 12.8020653633
+朋比为奸 11.7034530746
+陈昌浩 12.2912397395
+六等奖 13.900677652
+罚得 12.5143832909
+陂塘 11.4157710022
+一百五十多个 12.8020653633
+别胜新 12.5143832909
+水冰冷 13.900677652
+感天动地 11.7034530746
+草原带 10.4349417492
+双人舞 11.4157710022
+利安人 12.5143832909
+威海港 11.9547675029
+非因工 13.2075304714
+有溶解力 13.900677652
+广义地说 11.2616203224
+耳科 12.8020653633
+王二麻子 13.2075304714
+轨道控制 11.8212361103
+海丰县 11.4157710022
+桥身 10.8096351986
+纪念大会 13.900677652
+甜菜糖 10.6818018271
+鼎峙 11.1926274509
+薄雾 9.75754292558
+寰宇 10.3453295905
+武僧 10.8561552143
+讲经 9.85762638414
+秉烛夜行 11.0674643079
+职业经理 13.900677652
+洁肤 11.3357282945
+旧货店 12.2912397395
+七言律诗 11.2616203224
+狄厄尼 13.900677652
+勃兰登堡州 13.900677652
+花园子 11.9547675029
+修身齐家 13.900677652
+天福山 13.900677652
+内东裕 13.2075304714
+公冢孙 12.8020653633
+目不转睛 9.04086524761
+林家那 13.900677652
+绥北 12.8020653633
+绥化 10.9049453784
+副县长 9.75754292558
+冒险主义 9.98865464655
+病床 8.94485059437
+尔德 10.0505300503
+鬼聪明 12.8020653633
+少阳经 11.7034530746
+石首 10.8096351986
+开门办学 13.2075304714
+临夏 10.1630080337
+知足者 13.900677652
+西一世 12.1089181827
+每家 8.84443184663
+废话连篇 13.900677652
+满铁 12.8020653633
+鸟笼 10.3453295905
+竹床 11.9547675029
+自驾车 10.765183436
+焉知非福 12.2912397395
+彩塑 10.4349417492
+临头 9.54396882529
+沙弥 10.8561552143
+漆大柱 13.900677652
+微波炉 10.0088573539
+哒嗪 12.5143832909
+抗碱 12.5143832909
+越来越 5.63682952061
+埃涅阿斯 11.9547675029
+作文集 13.2075304714
+祁山兵 13.2075304714
+填着 12.8020653633
+限制 5.79145269889
+不疾不徐 11.7034530746
+多功能性 11.9547675029
+猪母 13.2075304714
+加里克 13.2075304714
+侯健制造 13.2075304714
+东兰县 13.2075304714
+拉丁舞 12.8020653633
+腾起 9.33632946051
+德理格 13.2075304714
+董将仕 12.1089181827
+门里出身 13.2075304714
+南斗 10.9049453784
+剖面 9.10488710638
+枝江县 12.1089181827
+百万秒 11.7034530746
+龙博斗 13.900677652
+抗磨 12.8020653633
+桑贾尔 13.2075304714
+新机 11.1926274509
+男孩子 9.01032852375
+百万种 12.5143832909
+口角炎 12.2912397395
+鸟窝 10.9049453784
+花样滑冰 11.2616203224
+平沙无垠 13.900677652
+里亚宁 13.900677652
+王文德 11.9547675029
+国界线 11.4157710022
+生疑 10.1394775363
+生疏 9.58318953844
+五戒 11.1926274509
+匡济之 13.2075304714
+师传徒 12.8020653633
+国家银行 9.89334446674
+涂梢韵 12.8020653633
+文献数据库 13.2075304714
+猪毛 11.598092559
+盛水铜 13.900677652
+生疼 10.2897597393
+马尼拉市 12.5143832909
+武军 11.1280889297
+南方南极 12.8020653633
+插进 9.27570483869
+滚木 10.7226238216
+生疮 11.4157710022
+尔希 13.2075304714
+盘县 11.9547675029
+驴车 11.7034530746
+父业 10.9049453784
+畏途 12.5143832909
+病弱 11.0103058941
+尔布 11.7034530746
+三七开 13.2075304714
+几百支 13.900677652
+尔干 11.5027823792
+美术院校 13.900677652
+绑腿 11.3357282945
+畏避 13.2075304714
+每宗 13.900677652
+桥边 10.0505300503
+虚张声势 9.55687223012
+长统袜 11.9547675029
+三合院 12.1089181827
+生病 8.33615724465
+盘发 12.5143832909
+报名费 11.9547675029
+绞索 11.8212361103
+蒋如 13.900677652
+山移文 13.2075304714
+浪费资源 11.1926274509
+石顶 12.2912397395
+盘古 9.69598503258
+众人 5.8185843738
+一搭一档 13.900677652
+谷蛋白 13.900677652
+梁太后 12.1089181827
+扇坠 11.5027823792
+肉鳍 11.9547675029
+黄金周 7.62215622781
+政治避难 12.1089181827
+彩妆 10.765183436
+生生 10.0088573539
+萍乡 10.2630914922
+筛下 11.7034530746
+光荣院 13.2075304714
+沙市 9.37888907493
+病征 11.5027823792
+金属锂 12.1089181827
+大逆无道 12.2912397395
+父亲 5.52897276731
+斯克市 11.8212361103
+任柏林 10.3453295905
+鼓动性 11.8212361103
+企待 13.900677652
+病得 9.55687223012
+李诵 12.5143832909
+劳埃德银行 10.533381822
+网状脉 12.2912397395
+少子 10.9049453784
+倾销幅度 12.8020653633
+杰里米 12.2912397395
+议席 10.1871055853
+梧桐镇 13.2075304714
+捣毁 9.65218240993
+第二课 13.900677652
+陈谨 13.900677652
+大请大受 13.900677652
+曼纳 11.1926274509
+埃莱娜 12.8020653633
+细细的 8.89673134603
+小点心 11.2616203224
+苏基 13.900677652
+李诗 12.8020653633
+偏误 12.8020653633
+武关 9.35738286971
+武兴 11.9547675029
+李训 11.9547675029
+化妆师 11.7034530746
+张能奇 12.2912397395
+给水泵 13.900677652
+成平陆 11.7034530746
+盘升 8.59240995457
+纪末至 11.9547675029
+生畏 11.9547675029
+顾杲正 12.5143832909
+默存 13.900677652
+和先帝 13.900677652
+管员 12.8020653633
+强直 10.3743171274
+高薪养廉 12.8020653633
+俄国政府 11.2616203224
+星岛 13.900677652
+民贵君轻 12.2912397395
+总状花序 9.35738286971
+乡名 13.900677652
+关龙蓬 13.900677652
+蜀地 10.0720362555
+生番 13.900677652
+强盛 8.21370229564
+微气管 13.900677652
+葛家澍 13.2075304714
+看不顺眼 11.3357282945
+满院 10.7226238216
+每对 11.3357282945
+安息香 10.6818018271
+川藏公路 10.0720362555
+二进制 9.93038573842
+抗税 10.8561552143
+肽链 10.5684731418
+盗亦有道 11.7034530746
+别误会 11.5027823792
+策应 9.15574552361
+趴下 9.98865464655
+临安 8.85082164473
+强电 12.8020653633
+电子自旋 11.0674643079
+梦然 12.5143832909
+巩昌总 13.2075304714
+少壮 11.4157710022
+库拉河 12.8020653633
+青铜镜 13.2075304714
+漆上 12.5143832909
+李行 11.9547675029
+武力 7.96314144689
+抚恤金 10.642581114
+爱使 12.2912397395
+珠江流域 9.98865464655
+主讲人 12.1089181827
+生皮 12.5143832909
+强生 10.6818018271
+唐敖庆 11.8212361103
+出国访问 11.5027823792
+巴郡城 13.2075304714
+临客 12.5143832909
+罗拜夷 13.2075304714
+发情周期 12.2912397395
+青锋 12.1089181827
+登岸 9.89334446674
+偏衫 13.900677652
+几十尊 13.2075304714
+涨回去 13.900677652
+不自在 8.87023973058
+胎座 10.6818018271
+杜邮 13.900677652
+嘉兴府 12.5143832909
+沙川 12.5143832909
+乳状液 11.2616203224
+沙州 10.0294766411
+庞贝城 12.5143832909
+波波夫 10.9049453784
+二百多户 13.2075304714
+企业形象 10.5684731418
+廉价出售 12.8020653633
+仇英 11.2616203224
+匍匐前进 11.8212361103
+颠来倒去 11.4157710022
+对映异构 11.1926274509
+更多更好 11.1926274509
+脑膜 10.4666904475
+牵引绳 13.900677652
+战罢 12.1089181827
+箍桶 12.5143832909
+大红大绿 11.9547675029
+强留 10.5684731418
+爱伦 11.598092559
+死灵 13.900677652
+电偶极子 12.2912397395
+没有勇气 9.77354326693
+沙巴 11.5027823792
+达格斯坦 11.5027823792
+数排 11.9547675029
+诡秘莫测 13.2075304714
+减肥法 11.598092559
+液相 9.65218240993
+港资 10.533381822
+向武关 12.8020653633
+中毒已深 13.900677652
+王孔甲 12.5143832909
+斯湖 12.8020653633
+制作人员 12.5143832909
+兵备 10.5684731418
+改地 13.2075304714
+不经之说 13.900677652
+波斯湾 8.77077893705
+了望台 13.2075304714
+填用 13.900677652
+润州 9.7898037878
+秋禾 13.2075304714
+爱信 12.5143832909
+王延德 12.5143832909
+内置在 13.900677652
+马御史 12.5143832909
+用药量 12.5143832909
+未被觉察 13.900677652
+故伎重演 11.9547675029
+偏袒 9.84023464143
+弗留利 13.2075304714
+鼠盗狗窃 13.900677652
+辞职信 13.900677652
+主观题 13.900677652
+亏本 9.82314020807
+孰能无过 11.598092559
+徒呼负负 13.900677652
+南丹县 12.2912397395
+脓液 10.4349417492
+尔巴 10.8561552143
+封魏公 11.598092559
+嘉兴市 10.2897597393
+限值 10.9562386728
+中国计算机学会 12.1089181827
+哭求 11.4157710022
+谢柬之 13.2075304714
+黄金城 12.5143832909
+性格特点 12.5143832909
+肾盂 10.6818018271
+嘎嘣脆 13.900677652
+月明风清 13.2075304714
+接走 11.0674643079
+十三行 11.598092559
+蔡尔德 12.8020653633
+狐骚 13.2075304714
+靠背 9.65218240993
+和镇安 12.8020653633
+卫道者 12.8020653633
+尤纳斯 13.2075304714
+爱侣 11.598092559
+软饮料 11.0674643079
+河道坡降 12.8020653633
+毫巴 12.1089181827
+韩信点兵 13.2075304714
+孙权令 12.2912397395
+邬桥 10.6818018271
+韩遂引 12.8020653633
+乡土 9.63799777493
+省油的灯 10.9049453784
+阴森恐怖 12.1089181827
+爱乐 11.0103058941
+尔尼 11.0103058941
+满面 8.5488195185
+高硬度 10.8096351986
+工程造价 11.598092559
+有缘分 11.7034530746
+盘内 11.4157710022
+趴伏 12.2912397395
+沙岛 10.4349417492
+契约书 13.2075304714
+观察 6.0615460037
+沙岗 9.75754292558
+沙岩 11.7034530746
+杂书 11.8212361103
+唐李鼎 12.8020653633
+沙岭 11.5027823792
+想不通 9.59661255877
+想过 8.30596627237
+演演 12.8020653633
+胎心 11.2616203224
+榫卯 11.598092559
+爱乡 12.8020653633
+沙岸 11.4157710022
+叶体 11.8212361103
+邓州市 10.1871055853
+杂乱 9.06439574502
+双龙纹 13.2075304714
+爱书 13.2075304714
+脓汁 12.8020653633
+生身母亲 11.9547675029
+扭出 13.900677652
+蒋宣 11.4157710022
+乌格拉 12.8020653633
+观宇 12.1089181827
+老态龙钟 10.4349417492
+复式簿记 12.2912397395
+九百余只 13.2075304714
+易田 12.5143832909
+尚蒂 12.2912397395
+尔山 11.3357282945
+偏西 9.20019728618
+易用 11.3357282945
+挨家 11.8212361103
+蒋家 10.6818018271
+金俊山 9.04086524761
+爱上 9.13850371718
+牵连运动 12.8020653633
+近千名 11.8212361103
+心潮 11.0674643079
+惠女神 13.2075304714
+阿拉法特 11.1280889297
+多半辈子 11.9547675029
+所课 13.900677652
+掩耳盗铃 11.2616203224
+搭客 11.5027823792
+勾解佥 12.8020653633
+机械化 7.60172840512
+会出 10.0940151622
+蒋南翔 13.2075304714
+少妇 9.35738286971
+石马 11.1926274509
+沙峰 13.900677652
+王栖曜 13.2075304714
+万宁市 12.8020653633
+恤老怜贫 13.900677652
+有效载荷 10.2371160058
+少女 7.75649201785
+插起 11.598092559
+忍饥受饿 13.2075304714
+陈鸿寿 11.7034530746
+张律师 13.2075304714
+六十余里 13.900677652
+沙尘 10.8096351986
+凤眼 10.8096351986
+登峰 12.8020653633
+自杀身亡 10.4349417492
+锁起 12.8020653633
+货物税 13.2075304714
+信息中心 9.61021821083
+沙尔 11.0103058941
+分类学 9.44633035572
+萨卡萨 13.900677652
+雌雄 8.41173992582
+程远志 13.2075304714
+四角形 13.900677652
+跌宕起伏 9.94943393339
+忆苦饭 13.900677652
+偏要 8.75901409547
+龙须面 12.2912397395
+杂件 13.900677652
+商荣华 13.2075304714
+少奇 13.900677652
+王赵俣 13.2075304714
+富商大贾 11.1280889297
+稻草 9.16447920358
+捞饭 12.5143832909
+一二十天 12.8020653633
+明后天 11.4157710022
+尽付东流 13.2075304714
+沙层 11.9547675029
+凤督 12.5143832909
+杂事 10.4041700905
+蒋锡 12.1089181827
+二十五里 11.2616203224
+费尔兹 11.9547675029
+默契 8.88339781516
+鱼石螈 12.5143832909
+生着 10.3453295905
+杂交 8.71889410168
+五万多 12.8020653633
+爱人 8.44963919841
+细如 11.1926274509
+偏见 8.87679713113
+后梁太祖 11.8212361103
+死不改悔 11.9547675029
+莫霍洛 13.2075304714
+偏角 11.9547675029
+勒巴 12.8020653633
+曾多次 8.06586691491
+偷下 13.2075304714
+刘师勇 13.2075304714
+扑哧 9.65218240993
+凤梨 10.4041700905
+鸟林 13.900677652
+节省下来 11.4157710022
+爱党 12.8020653633
+趴倒 11.7034530746
+情节严重 9.89334446674
+盘亘 11.7034530746
+萝卜花 11.1280889297
+真实世界 11.9547675029
+限令 10.6818018271
+法氏囊 12.2912397395
+倔强 9.29550746599
+窗上 9.71102290995
+李陵 11.3357282945
+王守武 12.8020653633
+满血 13.900677652
+人名册 12.1089181827
+接待 7.41299363349
+懵懵懂懂 10.4666904475
+周转金 13.900677652
+周转量 9.84023464143
+化石 7.19748953873
+鸟枪 10.6818018271
+满街 9.45802639549
+药物滥用 12.5143832909
+不如人意 11.1280889297
+接得 10.5684731418
+小脚女人 12.5143832909
+连挥 13.2075304714
+今宜 11.8212361103
+养蜂人 12.2912397395
+王儒信 13.2075304714
+甲子 9.82314020807
+苏区中央局 11.598092559
+陈与义 12.2912397395
+适龄青年 12.1089181827
+石蕊 11.9547675029
+鄂豫皖革命根据地 11.8212361103
+世界足坛 13.900677652
+限产 10.1164880181
+纳复 12.8020653633
+卡特维 13.900677652
+接进来 13.2075304714
+李防 13.2075304714
+感兴趣 8.26946587015
+核苷 10.9049453784
+石日馨 13.900677652
+布朗基 11.5027823792
+香叶油 13.900677652
+鲁米诺 13.900677652
+别动队 11.9547675029
+爱儿 13.900677652
+几百斤 11.598092559
+去污剂 13.2075304714
+崔忠 13.2075304714
+杏坛 12.5143832909
+成人型 13.2075304714
+上交利润 12.2912397395
+死人头 12.8020653633
+限于 7.61281909181
+宁陕县 13.900677652
+盘上 10.8096351986
+郭威灭 12.1089181827
+李雪 11.8212361103
+今存 8.80081122415
+吕香阁 10.7226238216
+李雯 11.598092559
+长汀县 11.598092559
+周显谟 10.2630914922
+百万斤 13.2075304714
+不恭不敬 13.900677652
+耐人玩味 13.2075304714
+盖碗儿 13.2075304714
+吕侯 13.900677652
+宝源局 11.7034530746
+二百二十万 13.900677652
+三人份 13.900677652
+纳姆 11.8212361103
+送货上门 12.1089181827
+李雷 12.8020653633
+白闪闪 13.2075304714
+互调 13.900677652
+殉国 8.88339781516
+生根 9.5186510173
+盘中 6.57684708577
+体操器械 12.8020653633
+限乘 13.900677652
+李雄 10.5684731418
+优素福 11.7034530746
+那庵 13.900677652
+凤栖 12.5143832909
+牵引性 13.2075304714
+历史文献 10.1394775363
+繁分数 13.900677652
+布袋戏 12.5143832909
+链路层 11.8212361103
+金军攻 12.1089181827
+晏氏 13.2075304714
+贾环贾 11.4157710022
+机内码 12.8020653633
+斯坦福大学 9.85762638414
+精美绝伦 11.2616203224
+限为 12.8020653633
+余堂 12.8020653633
+小肚腩 12.5143832909
+恐惧心理 10.7226238216
+甲寅 11.9547675029
+贾琛 13.900677652
+衔接起来 11.3357282945
+产权保护 13.900677652
+思想品德 11.9547675029
+石藻 12.2912397395
+染料厂 12.5143832909
+还魂丹 12.8020653633
+纳妾 11.0674643079
+阴暗处 11.7034530746
+滤掉 11.9547675029
+二十几万 12.1089181827
+直属单位 11.1280889297
+香巴拉 12.8020653633
+服刑人员 11.2616203224
+南安普敦 11.8212361103
+稍减 11.598092559
+发展趋向 10.765183436
+十三铢 13.2075304714
+小港 10.7226238216
+艺术节 11.1926274509
+投票者 12.1089181827
+酸软 9.80633308975
+强横 10.4349417492
+纨袴子弟 12.5143832909
+统分结合 12.1089181827
+爱滋病 12.8020653633
+纳塔 10.9049453784
+孙权乃 12.5143832909
+余姚 9.12155415886
+九十块 12.5143832909
+垂名青史 13.900677652
+讲授 8.53938548627
+数理学 12.8020653633
+梦想成真 11.9547675029
+用力吸气 13.2075304714
+克列缅 13.2075304714
+十二属相 11.9547675029
+借点 11.8212361103
+其他支出 12.5143832909
+科研工作 10.1871055853
+搭帐篷 12.8020653633
+背地里 9.29550746599
+帐蓬 12.8020653633
+刀手 10.642581114
+戒骄戒躁 13.2075304714
+接应 7.9526426628
+光物理 12.8020653633
+弓长岭 12.2912397395
+李靖 10.2897597393
+绥中 11.8212361103
+木棉树 12.8020653633
+鹰厦铁路 10.642581114
+瑙姆堡 12.2912397395
+生殖器官 9.22784881751
+西周时 10.0505300503
+抗敌 9.40086798165
+虚掷光阴 13.900677652
+金辽朝 13.2075304714
+昨天 5.92683327603
+逃生 8.57766767284
+一百八十四年 13.2075304714
+於坡 13.900677652
+惠风和畅 13.900677652
+阿札木 13.2075304714
+圣伯夫 13.900677652
+乍浦镇 12.5143832909
+同居 9.13850371718
+核菌 12.5143832909
+张怡荪 13.2075304714
+鞭炮 9.04086524761
+苏元春 12.5143832909
+同屋 10.8096351986
+核试 12.5143832909
+食少事烦 13.2075304714
+嗫嗫嚅嚅 12.2912397395
+绥东 11.598092559
+就业门路 12.8020653633
+渠化 10.9049453784
+李霞 11.0103058941
+同属 9.12155415886
+煤炉子 12.2912397395
+白兴儿 11.4157710022
+泄漏天机 12.5143832909
+渠口 12.2912397395
+芳辰 13.2075304714
+斯盖尔 13.900677652
+石蒜 11.9547675029
+拭净 12.2912397395
+油烟味 13.2075304714
+呼兰厅 12.8020653633
+吹来吹去 13.2075304714
+松辽盆地 11.8212361103
+未向 10.8561552143
+鲁斯塔 13.2075304714
+良多 10.9562386728
+吴诚 12.8020653633
+护封 13.2075304714
+余套 11.1280889297
+取材自 13.2075304714
+二十几位 12.8020653633
+手舞足蹈 9.6811699468
+同岁 10.9049453784
+苏州河 10.4041700905
+苔原气候 11.5027823792
+矜夸 12.8020653633
+快办 11.3357282945
+呼兰县 11.8212361103
+近年来 6.57684708577
+旅途劳顿 12.2912397395
+清天 13.900677652
+拉尔多 13.900677652
+藏经洞 11.0103058941
+公之子 11.9547675029
+限位 13.2075304714
+德拉姆 11.9547675029
+石头堆 12.5143832909
+曾一度 8.42003872863
+撒切尔 11.2616203224
+蒋海澄 13.2075304714
+刘亚洲 13.900677652
+酸辣 11.0674643079
+阿巴斯港 13.900677652
+连夜赶来 11.8212361103
+遛达 11.0103058941
+八九十年 13.900677652
+余多 12.2912397395
+齐姆良 13.900677652
+中承式 12.8020653633
+渠县 11.7034530746
+桂平市 11.8212361103
+余外 12.8020653633
+唯唯 10.4994802703
+土地批租 12.1089181827
+抗日 7.14957618304
+十三间 12.8020653633
+宰相 7.57631868959
+索拉 12.2912397395
+纳苏斯 12.8020653633
+和平演变 11.8212361103
+酸辛 12.8020653633
+良好 5.69409403766
+借火 13.900677652
+抗旱 9.91169360541
+於城 13.900677652
+穆吉木 13.2075304714
+岩浆 8.4980002701
+铜驼 11.2616203224
+同张 12.1089181827
+武人 10.3171587135
+寿王 12.8020653633
+十盏 12.5143832909
+话匣子 10.4349417492
+二苯基 11.9547675029
+太平天国 8.46259834305
+异养生物 11.9547675029
+同心同德 10.2371160058
+宝马香车 12.8020653633
+爱华 12.5143832909
+王志刚 12.8020653633
+面恶 13.2075304714
+流体静力 12.8020653633
+天人合一 10.533381822
+陈亮集 12.8020653633
+中国台北 11.0103058941
+石头寨 12.5143832909
+爱卿 11.5027823792
+熊耳 13.2075304714
+弥缝 11.4157710022
+经济命脉 10.0505300503
+格萨飞 12.8020653633
+宰甫 13.2075304714
+石蜡 10.2371160058
+赫莱斯 12.8020653633
+角甲基 13.2075304714
+布林莫尔 13.2075304714
+同形 10.4349417492
+养护费 13.900677652
+伙食费 11.5027823792
+严行 11.7034530746
+想不起 9.5062284973
+熬出头 12.5143832909
+呱呱叫 11.2616203224
+招飞 12.8020653633
+汹汹 10.4041700905
+讲情 10.533381822
+打蛇打七寸 13.900677652
+稻麦 10.0720362555
+杨副将 11.8212361103
+核能 8.33233314821
+南天星 12.1089181827
+坡岸 12.2912397395
+一股劲儿 11.598092559
+石蝇 13.2075304714
+东郡韦 12.8020653633
+扔回去 13.2075304714
+慕梭 13.900677652
+父兄 9.35738286971
+农药污染 12.2912397395
+十三陵 10.765183436
+武仙 11.5027823792
+资助 8.170577869
+肺气肿 10.1394775363
+大洋彼岸 10.642581114
+红裙 12.1089181827
+奋发努力 12.8020653633
+总收入 8.24468584116
+同归 10.3743171274
+同当 11.8212361103
+德国联邦 11.598092559
+颊车 13.900677652
+佣耕 12.1089181827
+几起 10.4349417492
+百分之三十几 13.900677652
+李铭 13.2075304714
+允祀 12.5143832909
+地学部 12.1089181827
+杨新民 13.900677652
+王崇伦 13.900677652
+岳庙 9.94943393339
+武举 10.4994802703
+铁将军把门 13.2075304714
+同德 11.0674643079
+女老师 11.4157710022
+老员外 12.5143832909
+胡思乱想 8.78868986362
+纵横自如 13.900677652
+黄巾 9.87532596124
+石菖蒲 12.5143832909
+五六百户 12.5143832909
+波斯特 13.2075304714
+缅甸语 12.2912397395
+同往 10.1164880181
+忧国忧民 10.765183436
+仇鸾 13.900677652
+破烂不堪 10.4349417492
+武东 13.900677652
+马桑科 13.2075304714
+黄道 9.21854642485
+武丁 10.3743171274
+抗暴 11.5027823792
+杂史 10.7226238216
+不静 12.2912397395
+电子式 10.6818018271
+贝汉津 12.5143832909
+北医三院 13.2075304714
+今夜 7.41604241634
+顶不住 9.91169360541
+付出劳动 12.8020653633
+何而生 13.2075304714
+透射率 12.2912397395
+余威 11.0674643079
+今夕 10.6818018271
+李钢 13.900677652
+李钤 12.5143832909
+令郎 10.4994802703
+李钦 13.900677652
+两手对 12.5143832909
+熊背 13.2075304714
+武乡 11.1280889297
+今夏 11.3357282945
+婴孩 10.533381822
+土头土脑 12.2912397395
+熊胆 10.642581114
+甲虫类 13.900677652
+公然侮辱 11.0103058941
+邹氏 12.5143832909
+化生 10.3743171274
+湖北队 13.2075304714
+奸掳烧杀 11.0674643079
+化用 13.2075304714
+武乙 12.5143832909
+罪恶昭彰 13.900677652
+费林溶液 13.900677652
+同志 6.13553274904
+金属锰 12.2912397395
+方鸣 13.900677652
+今天 4.99211827683
+李钟 13.2075304714
+杀场 11.4157710022
+武义 10.8096351986
+八十余里 13.2075304714
+美赞臣 11.9547675029
+鸟散 13.900677652
+银赏锺 13.2075304714
+中共南京市委 12.5143832909
+琼海市 11.9547675029
+同病相怜 10.4666904475
+独资 9.65218240993
+悉索敝赋 13.2075304714
+希拉尔 12.8020653633
+狐蝠 11.2616203224
+周王城 12.2912397395
+脱卤 11.8212361103
+中兽医 12.8020653633
+兰桂齐芳 13.900677652
+时光流逝 11.9547675029
+耸耸肩 10.9562386728
+刘备军 12.5143832909
+武侯 9.75754292558
+卫亨 13.900677652
+杂剧 8.74738605748
+偏锋 11.7034530746
+赖尚荣 12.2912397395
+运营业 13.2075304714
+环行器 12.8020653633
+仁川 10.2630914922
+拉锯战 10.6818018271
+打击乐器 10.2371160058
+区辉光 13.900677652
+核膜 10.3171587135
+投资商 10.9562386728
+良宵 10.765183436
+颁布 7.01006853183
+已决犯 13.2075304714
+新春 10.4041700905
+师师长 9.03314320152
+李锦 12.5143832909
+酸败 12.2912397395
+偏长 12.1089181827
+生母 9.20932976975
+石虎 10.5684731418
+余实 8.52539924429
+大提琴 10.1394775363
+允祥 11.0103058941
+和贤妹 12.5143832909
+骑骆驼 11.9547675029
+爱到 11.4157710022
+李锁 11.1280889297
+雄壮威武 13.900677652
+制住 11.8212361103
+较往年 10.765183436
+常吸 13.2075304714
+陆真腊 11.9547675029
+余容 12.8020653633
+新华门 11.8212361103
+中转地 11.5027823792
+二进位 13.2075304714
+凤毛 13.2075304714
+李锐 11.8212361103
+趴卧 13.900677652
+连变文 13.900677652
+稳定增长 8.33233314821
+周作人 10.8096351986
+同度 12.2912397395
+革命制度党 13.2075304714
+长春亚泰 11.9547675029
+艾伯塔省 11.9547675029
+总装配厂 13.2075304714
+古微堂 13.2075304714
+实干精神 12.8020653633
+贼党 11.8212361103
+鲁登堡 13.900677652
+天雨花 12.1089181827
+满语 9.44633035572
+年逾古稀 11.5027823792
+跳伞员 13.2075304714
+一夜之间 8.82550383674
+李闻 11.9547675029
+亏空 9.69598503258
+管理性 13.2075304714
+望文生义 11.9547675029
+加里东 10.0294766411
+王光兴 11.0674643079
+不结果实 12.8020653633
+一两个 8.33233314821
+同庆 8.43684584695
+利用计算机 10.4666904475
+曹丞相 10.9049453784
+汹涌 8.46259834305
+阿拉伯字 12.8020653633
+屠格涅夫 10.4349417492
+百城 12.5143832909
+同床 11.3357282945
+提成 9.84023464143
+有缘人 12.8020653633
+秦相公 12.1089181827
+少年时期 10.642581114
+帕吉勒 13.900677652
+余孽 10.533381822
+许广平 12.8020653633
+尚须 10.604840786
+同庚 12.5143832909
+必答 13.900677652
+禄享千 13.2075304714
+利之徒 11.5027823792
+洋泾浜 11.5027823792
+氧化 7.42678695562
+爱力 13.900677652
+满有 11.1926274509
+仙童公司 12.8020653633
+回事儿 9.85762638414
+磷磷 12.5143832909
+威奇托 12.8020653633
+电磁辐射 9.80633308975
+良子 13.900677652
+本小利大 13.900677652
+生死 7.67414098269
+杂务 10.7226238216
+甲壳 10.2371160058
+驻澳门部队 13.900677652
+杂种后代 11.7034530746
+以德报怨 13.2075304714
+农贸市场 9.23723855786
+陈货 13.2075304714
+单目 12.1089181827
+秦日纲 11.9547675029
+爱动 11.8212361103
+起跳板 13.900677652
+甲士 9.84023464143
+同大 11.1280889297
+同夥 13.2075304714
+入海量 13.900677652
+深圳股市 12.5143832909
+再好没有 12.5143832909
+哈里宾 13.2075304714
+奇伟 11.0674643079
+纪时制 12.2912397395
+咄咄 11.0674643079
+拉弗兰 12.5143832909
+双生儿 12.8020653633
+接客 10.7226238216
+起解 11.7034530746
+石脉 13.900677652
+无可无不可 11.8212361103
+进货量 12.8020653633
+颁奖 9.96885201925
+罗丝 12.8020653633
+热流量 11.0674643079
+抗性 10.3743171274
+接完 12.1089181827
+汽车行业 8.62767809341
+生油 10.9562386728
+布行 13.2075304714
+林泉之 12.1089181827
+斯洛伐克人 11.3357282945
+嫌疑犯 10.9049453784
+中运河 10.5684731418
+杀出 8.53003962385
+川兵远 13.2075304714
+金车 12.8020653633
+前置程序 12.1089181827
+贾环见 11.7034530746
+龙目岛 12.5143832909
+一部分回 13.900677652
+余岁 11.2616203224
+军队 5.70038939169
+桥隧 11.9547675029
+汤烧火热 13.900677652
+免费手机 13.900677652
+十三道 10.0505300503
+怨气冲天 11.7034530746
+康复中心 11.598092559
+熊虎 13.2075304714
+都市集聚 13.900677652
+纵虎归山 13.2075304714
+鹿贺氏 10.8561552143
+同好 11.9547675029
+今征 13.2075304714
+掏钱 9.20019728618
+鲁内莱 12.8020653633
+卫州城 13.2075304714
+风道 11.8212361103
+奇佳 12.5143832909
+众信 12.5143832909
+五百五十万 12.2912397395
+一刻多 12.5143832909
+三顾茅庐 11.598092559
+反躬自责 13.900677652
+黑马河 13.2075304714
+宋史者 13.2075304714
+男爵夫人 13.900677652
+主因 9.15574552361
+一个十二 10.9562386728
+白奴 12.8020653633
+银行账号 11.598092559
+洋姜 13.2075304714
+木粱 12.5143832909
+买方市场 10.8096351986
+划水 9.98865464655
+纳州 13.2075304714
+偌大 8.77077893705
+尝鲜 10.8561552143
+生气 6.74919218807
+怎样写 12.2912397395
+生民 10.2371160058
+李自成 5.67597809001
+石膏 8.14493543839
+梭梭林 12.1089181827
+穿帮 12.8020653633
+讲明 10.3171587135
+清道光 9.91169360541
+颇具 8.6966709649
+保护费 11.7034530746
+杀入 8.56795885871
+生水 10.604840786
+吸法 13.900677652
+天刚明 12.8020653633
+纳巴 12.2912397395
+桦川县 12.2912397395
+纳差 11.3357282945
+借用 8.4801426527
+余山 13.2075304714
+关税区 13.2075304714
+亏累 13.2075304714
+耳目闭塞 13.900677652
+东征西 11.598092559
+卫司马 13.2075304714
+手到拿来 12.5143832909
+今天下午 8.97342396682
+余封 13.2075304714
+猜灯谜 11.598092559
+爱喝 10.4041700905
+格雷夫斯 13.2075304714
+凤池 12.8020653633
+寡头政治 11.0674643079
+第二十四条 12.8020653633
+西为 9.7898037878
+横断面 10.1394775363
+鲜廉寡耻 12.8020653633
+放虎归山 11.8212361103
+未见有人 13.900677652
+津城 13.900677652
+石臼 10.2897597393
+琴瑟和鸣 13.900677652
+插队 9.71102290995
+西瑭区 13.2075304714
+特洛尔 13.900677652
+洗出 11.5027823792
+宁与歆 13.900677652
+市南 10.1871055853
+同姓 9.22784881751
+荼毒生灵 13.900677652
+阖户 13.900677652
+一个十一 12.8020653633
+疑难案件 12.2912397395
+王守澄 13.900677652
+神情毕肖 13.900677652
+安渡滩 12.5143832909
+卡德纳斯 12.5143832909
+王图帖 13.2075304714
+强渡 9.75754292558
+撤回抗诉 13.900677652
+关向应 11.5027823792
+网络战 13.900677652
+申江 12.8020653633
+纳克斯 13.2075304714
+单于立 13.900677652
+熊蜂 11.7034530746
+委内瑞拉共和国 11.9547675029
+乌伦古 11.0103058941
+脑髓 10.6818018271
+田自然 12.8020653633
+同堂 11.7034530746
+截发留宾 13.2075304714
+塔高 10.642581114
+石耳 11.598092559
+青紫 9.89334446674
+开采区 12.5143832909
+高潮迭起 11.1280889297
+付体 11.9547675029
+石片岩 11.9547675029
+钠溶液 13.900677652
+老君殿 13.2075304714
+生涩 11.1926274509
+担架员 12.2912397395
+遗弃物 13.900677652
+刘师培 11.5027823792
+斯库 13.900677652
+演译 13.900677652
+社务 11.4157710022
+宰牛 11.598092559
+腺毛 11.1926274509
+杂合 11.7034530746
+独家新闻 12.8020653633
+满贯 11.9547675029
+纳尔 10.604840786
+咄嗟 13.900677652
+常呈柱 13.2075304714
+龛着 13.2075304714
+支承臂 13.900677652
+数据系统 11.1926274509
+欲令智昏 13.900677652
+面包酵母 13.900677652
+填满 9.35738286971
+人文地理 10.604840786
+克罗梅 13.2075304714
+李过命 13.2075304714
+怎么回事 7.58531965045
+爱吸 13.900677652
+稻香 11.9547675029
+二年生 10.6818018271
+孟德 10.7226238216
+同塔 13.900677652
+吴镇营 13.2075304714
+合营 9.87532596124
+万余户 11.3357282945
+欲加之罪 11.3357282945
+见缝就钻 12.5143832909
+明公何 12.5143832909
+引航船 13.2075304714
+博帕尔 11.8212361103
+赧然 11.7034530746
+甲府 12.8020653633
+刘亚楼 12.1089181827
+肉冠 12.5143832909
+实多 13.900677652
+桥面 9.72629038208
+塔马 13.900677652
+自洽性 13.900677652
+示波管 11.7034530746
+守灵 10.4994802703
+奇事 9.98865464655
+尽可 10.0088573539
+狐臭 12.8020653633
+生活 4.63386243307
+衣食无忧 11.2616203224
+符一音 13.2075304714
+清异录 13.2075304714
+今年 4.33028803542
+纳峰 13.2075304714
+奇人 9.77354326693
+布朗利 13.2075304714
+石头山 11.7034530746
+炮兵师 10.7226238216
+无韵律 13.900677652
+官官相护 11.9547675029
+唯其 11.598092559
+生津 10.1630080337
+易激 13.2075304714
+爱哭 11.0103058941
+衣衫蓝缕 13.900677652
+罗交怡 13.900677652
+特纳氏 13.2075304714
+郦家驹 13.2075304714
+刚烈 10.7226238216
+入不敷出 10.2117981979
+似乎 5.22870540677
+七中全会 11.598092559
+四大发明 10.604840786
+加龙 13.2075304714
+同声 9.5186510173
+寺门前 13.2075304714
+藏经楼 12.5143832909
+宫外通 13.2075304714
+克罗格 12.5143832909
+希腊字母 11.5027823792
+辞旧迎新 11.3357282945
+苯甲醚 12.5143832909
+一万三千 11.3357282945
+不难设想 12.1089181827
+近千人 11.4157710022
+十目 13.900677652
+瓦尔莱 13.2075304714
+讲来 11.1926274509
+南大街 11.2616203224
+农家乐 11.8212361103
+钟架 13.900677652
+欣然同意 10.604840786
+嫁出 12.5143832909
+一不小心 9.71102290995
+颇受 8.98069672615
+吸取教训 10.4041700905
+克什米尔语 12.8020653633
+国民性 11.598092559
+弧线 9.66657114738
+事情 4.90514070704
+日光能 12.2912397395
+花粉外壁 13.900677652
+生源 10.0720362555
+杏儿 13.2075304714
+豆腐店 12.2912397395
+小小花 13.900677652
+避实就虚 11.5027823792
+王伐崇 13.2075304714
+旺盛起来 12.5143832909
+磁带盒 13.900677652
+吊销执照 12.5143832909
+大姆指 11.0674643079
+抗战 7.30489713801
+四胞胎 12.8020653633
+杜预注 12.2912397395
+太臣 13.900677652
+马锣 13.2075304714
+岳崇 13.900677652
+断线风筝 12.8020653633
+正儿八经 10.3743171274
+嫁到 12.5143832909
+糖元 11.9547675029
+衍化 10.6818018271
+乡俗 11.7034530746
+深黑色 12.2912397395
+全景图 12.8020653633
+几世 11.8212361103
+李道 13.2075304714
+中航油 12.2912397395
+赵主父 13.2075304714
+欺蒙 11.8212361103
+同学 7.20611559345
+水陆交通 8.44963919841
+一叠叠 12.5143832909
+马尔加 12.5143832909
+强心剂 10.4666904475
+核打击 11.598092559
+白虎团 12.8020653633
+萧山市 12.1089181827
+易水 10.5684731418
+李逸 13.900677652
+抗打 13.900677652
+竭诚欢迎 13.2075304714
+基博 13.2075304714
+无人不晓 10.8096351986
+李逵 7.69007757495
+酸梅汤 11.4157710022
+李选 12.5143832909
+终夕 13.900677652
+苏必利尔 12.1089181827
+福晋笑 11.7034530746
+正阳门 9.55687223012
+香烧鸡 13.900677652
+李适 12.5143832909
+圣湖 11.5027823792
+余座 9.19114745066
+寄至 12.8020653633
+李通 12.5143832909
+石药 13.2075304714
+插针 12.1089181827
+同室 11.5027823792
+换手率 7.79365476423
+李郭 13.2075304714
+瑞典议会 13.2075304714
+良师 11.598092559
+无拳无勇 12.8020653633
+汪达尔 10.5684731418
+余幅 11.3357282945
+良币 11.598092559
+耿云志 12.5143832909
+借看 13.900677652
+小静脉 11.598092559
+纵贯铁路 10.3453295905
+接头 9.45802639549
+电力法 13.2075304714
+有限公司 5.19369088893
+东鸡儿 12.2912397395
+张艺谋 9.5186510173
+李郎 13.900677652
+石莲 11.9547675029
+同安 11.598092559
+同宗 9.98865464655
+通经史 11.3357282945
+忆江南 11.3357282945
+幻想曲 10.6818018271
+早已有之 11.2616203224
+吕公祠 11.5027823792
+余干 13.2075304714
+同定 12.5143832909
+余年 8.19689517732
+脓病 13.2075304714
+易治 12.8020653633
+练功者 12.8020653633
+卡昂 12.8020653633
+布里斯班 10.765183436
+脓疱 11.1926274509
+中国国际广播电台 12.2912397395
+硼化物 12.1089181827
+人文主义 9.56994431169
+接好 12.5143832909
+布朗克 12.2912397395
+容许检验 13.900677652
+脓疮 11.9547675029
+测年技术 13.900677652
+纳征 12.5143832909
+水镜笑 13.2075304714
+借着 7.97375162601
+环境工程 11.598092559
+苏拉塔 13.900677652
+逃犯 10.765183436
+显示装置 11.4157710022
+快餐店 11.598092559
+卢托斯 12.8020653633
+康康舞 13.2075304714
+纳德 11.598092559
+愤愤然 11.2616203224
+蓬然 12.8020653633
+漆丹 12.5143832909
+共同语 11.9547675029
+填海 11.0103058941
+壬申 12.5143832909
+豆腐干 10.7226238216
+崩裂 10.1871055853
+商业资本 9.34680076038
+李邕 11.8212361103
+九十元 12.2912397395
+百万户 12.8020653633
+切尔诺夫 12.5143832909
+屈膝投降 11.598092559
+柯伊诺 12.5143832909
+紫外光 10.9562386728
+每毫升 12.5143832909
+藏经殿 12.1089181827
+总索引 13.900677652
+满载 8.35941410682
+分析题 12.2912397395
+余志 9.02548032877
+小学教师 10.0505300503
+维利 10.8561552143
+黑暗时代 11.0674643079
+傻大黑粗 12.5143832909
+一二十厘米 13.2075304714
+九十六 10.9562386728
+接境 12.1089181827
+石舫 11.9547675029
+词藻 10.4041700905
+趴在 7.85567233794
+易流 12.1089181827
+得空儿 11.3357282945
+续向西 13.900677652
+米粮 11.1926274509
+盖章 10.642581114
+豆腐心 12.1089181827
+文臣吕 12.5143832909
+棕箱 12.2912397395
+良心 8.21031819765
+使坏 11.9547675029
+楚文化 10.8561552143
+孔彦舟 12.1089181827
+乡亲 9.03314320152
+华岳仙 12.8020653633
+举家 9.55687223012
+抗捐 12.2912397395
+纳布 11.9547675029
+彧中 13.900677652
+乡人 10.765183436
+父命 10.9562386728
+易洛 11.1280889297
+没过多久 9.85762638414
+甲山 13.900677652
+卿爵 13.2075304714
+石色 11.9547675029
+控制中心 9.56994431169
+胆颤心惊 12.2912397395
+强求 10.1164880181
+李巡抚 12.8020653633
+乡井 13.900677652
+见钱眼开 11.1280889297
+演着 11.3357282945
+犀牛角 12.1089181827
+天然染料 12.8020653633
+新曹 12.8020653633
+十分迅速 10.5684731418
+信阳市 9.82314020807
+塔顶 9.84023464143
+洋白菜 11.9547675029
+白玉乔 12.5143832909
+东海舰队 10.1164880181
+桥长 10.3743171274
+布莱顿 12.8020653633
+施特莱 13.2075304714
+生漆 9.36807815882
+门诊患者 13.900677652
+透一口气 11.9547675029
+苏叔阳 13.900677652
+杜心解 12.8020653633
+石芽 11.1926274509
+牵引机 11.4157710022
+赔偿标准 11.5027823792
+油茶籽 11.5027823792
+石花 12.5143832909
+爱国 7.70627226087
+於军 13.2075304714
+曾任兰 13.2075304714
+草科 11.9547675029
+盘县特区 13.900677652
+超山 12.5143832909
+时断时续 10.6818018271
+人猿泰山 13.2075304714
+梁太仆 13.2075304714
+文垂特 13.2075304714
+英文课 12.5143832909
+周军全 12.8020653633
+地方色彩 10.4666904475
+矮壮素 13.2075304714
+复比例 13.900677652
+一万万两 13.2075304714
+五千多 11.9547675029
+崩解 10.6818018271
+有一无二 13.2075304714
+月经周期 10.1164880181
+埃尼 12.5143832909
+乡丁 13.2075304714
+偏重 9.02548032877
+一两五 12.5143832909
+党派 9.02548032877
+余张 13.2075304714
+乡下 8.15447446144
+透明漆 13.2075304714
+作生意 13.2075304714
+福田区 10.765183436
+余弦 10.7226238216
+百万担 12.2912397395
+趸批 13.2075304714
+因陀罗 11.598092559
+野心勃勃 10.1871055853
+作伪证 11.2616203224
+草种 13.2075304714
+整顿作风 13.2075304714
+震惊中外 10.4666904475
+罗汝先 13.900677652
+中航技 13.900677652
+保护膜 10.4349417492
+孔雀开屏 11.9547675029
+起见 9.07236391467
+远东国际军事法庭 11.598092559
+识别性 13.2075304714
+纳克 11.3357282945
+特殊作用 11.0674643079
+东牟侯 12.5143832909
+同唱 12.5143832909
+汽车票 11.8212361103
+有曼伯 13.900677652
+疯魔 11.2616203224
+北美自由贸易区 11.3357282945
+一二十件 13.2075304714
+爱女 11.0674643079
+王宙 11.9547675029
+滔天大罪 12.2912397395
+李鹏 10.2371160058
+少付 11.9547675029
+空军通信 13.900677652
+纳兰 12.5143832909
+爱好 8.40761620864
+生悲 11.7034530746
+焦炉煤气 11.5027823792
+易手 10.4041700905
+抗水 12.2912397395
+九十年 12.2912397395
+拉莫夫 13.900677652
+记言文 13.900677652
+艺术论 12.1089181827
+遗弃罪 12.5143832909
+抄抄 11.8212361103
+纳入 7.05373451239
+杂处 10.4349417492
+烟卷儿 13.900677652
+尿囊素 13.2075304714
+李鸣 13.900677652
+换上来 12.5143832909
+克罗斯 11.5027823792
+量体温 13.900677652
+荒山野岭 11.1280889297
+满耳 11.7034530746
+续晋阳 12.8020653633
+少交 11.2616203224
+少产 13.900677652
+李鸿 12.2912397395
+生情 11.9547675029
+五万亩 13.2075304714
+甲午 9.91169360541
+古物 8.89004235788
+熏衣草 12.8020653633
+温泉水 11.2616203224
+萨尔迪瓦 12.5143832909
+憨豆 13.900677652
+少些 10.4994802703
+易成 11.3357282945
+咔哒 12.5143832909
+职业化 10.1630080337
+父子 7.34389929582
+通道接口 13.900677652
+弥留 11.598092559
+上海市政协 11.1926274509
+生惧 11.9547675029
+夺魁 11.0674643079
+少买 11.9547675029
+蒸馏水 10.8561552143
+强推 13.900677652
+罗曼语 10.3743171274
+判死罪 13.2075304714
+生怕 8.22050504296
+黄静 13.900677652
+金属探伤 13.900677652
+罗曼诸 12.8020653633
+石越 13.2075304714
+纳凉 11.0674643079
+纺机 10.1630080337
+宰羊 10.8096351986
+刀把 10.8096351986
+接地 9.7898037878
+生态 7.40390266179
+嚎哭 10.7226238216
+过挤 13.900677652
+俯就 11.7034530746
+格奥尔 13.2075304714
+脚掌心 13.900677652
+年春夏 11.0103058941
+喷水 9.89334446674
+巨兽 10.9562386728
+控制 4.95638833233
+迪乌斯 13.900677652
+冷笑声 13.900677652
+李默 11.8212361103
+国家体育总局 10.1871055853
+于延津 13.2075304714
+藤萝 9.69598503258
+鲁斯兰 11.8212361103
+生性 8.88339781516
+同喜 12.1089181827
+爱姬 12.2912397395
+六百余万元 13.2075304714
+一二十个 12.2912397395
+余倍 10.9562386728
+师徒合同 13.900677652
+透明性 10.9562386728
+李麦 7.59805867623
+生恐 10.8561552143
+浇过 12.2912397395
+消食片 13.2075304714
+周纪 12.8020653633
+维科德 12.8020653633
+两手几 12.8020653633
+化缘 10.4666904475
+敢过去 13.2075304714
+短寿 12.5143832909
+做好做恶 13.900677652
+漠阳江 11.2616203224
+主序星 10.5684731418
+九十度 11.4157710022
+合作性 12.1089181827
+爱妻 11.0103058941
+偏黄 12.5143832909
+一二十万 11.8212361103
+乔森潘 12.2912397395
+爱妾 10.0505300503
+生息 8.86372504956
+小小不言 13.900677652
+余值 11.5027823792
+阮文绍 13.2075304714
+收没 13.2075304714
+马复 12.8020653633
+少上 13.2075304714
+蓝黑墨水 12.5143832909
+驴骡 11.598092559
+抄报 11.1926274509
+演示 9.38981814546
+针芒 13.900677652
+塔雷 12.2912397395
+惨遭杀害 10.7226238216
+核计 11.9547675029
+有风有雨 13.900677652
+青铜色 11.9547675029
+容城县 13.900677652
+满腹 9.6811699468
+凤翔路 13.900677652
+于恒山 13.900677652
+北京小吃 11.598092559
+糕饼店 13.900677652
+温泉浴 12.8020653633
+章锡琛 13.2075304714
+易损 12.2912397395
+同吃 11.4157710022
+填报 10.2897597393
+奥基乔 13.900677652
+洪亨九 10.4041700905
+同名 8.5488195185
+绿脓杆菌 10.9049453784
+抗洪 10.8096351986
+余出 11.7034530746
+体虱 12.2912397395
+满腔 9.35738286971
+徐显谟 11.9547675029
+同向 9.46986085313
+那尊藤 13.2075304714
+后卫线 13.900677652
+庄票 12.8020653633
+靠靠 12.8020653633
+余册 12.8020653633
+一盏盏 11.9547675029
+风声鹤唳 10.4666904475
+报之以 12.8020653633
+坚持原则 10.533381822
+孟知祥 11.5027823792
+传诵一时 12.8020653633
+少侠 11.598092559
+单于皆 13.2075304714
+畏葸 11.3357282945
+满脸 7.41299363349
+同命 10.2897597393
+许愿 9.89334446674
+杏干 12.1089181827
+于华山 13.2075304714
+胡旋舞 12.8020653633
+周转额 11.0674643079
+相对高度 9.62401153296
+登录 8.28390655431
+李鼎 13.2075304714
+强手 12.1089181827
+半粒 12.2912397395
+大式 13.2075304714
+咔嗒 12.5143832909
+耿恭 10.5684731418
+汉科港 13.2075304714
+坡垒 10.8096351986
+聚合物 8.78868986362
+石象 12.5143832909
+直接支援 10.6818018271
+强打 10.765183436
+毛纺厂 10.3743171274
+满臣 11.598092559
+分析课文 13.900677652
+二十五史 13.2075304714
+向润叶 13.2075304714
+张顺送 13.2075304714
+余元 11.2616203224
+剂量 8.5440913773
+格雷夫森 13.2075304714
+强抢 12.1089181827
+生意 7.03270324301
+可信赖 10.8561552143
+填成 13.2075304714
+未遂犯 12.8020653633
+滨江路 13.900677652
+抗涝 11.9547675029
+克须卢 13.900677652
+凶神恶煞 10.3171587135
+换届选举 10.642581114
+保护者 10.4994802703
+依法取缔 12.8020653633
+连拨 13.900677652
+棉纺厂 11.3357282945
+五万余 11.9547675029
+特立独行 10.2897597393
+伶牙利爪 13.900677652
+咔唑 12.8020653633
+地对地 10.9049453784
+脑际 10.2371160058
+查理二世 11.0674643079
+罗宾逊 11.4157710022
+填房 12.5143832909
+藤蔓 10.1871055853
+余具 13.900677652
+方貌 11.4157710022
+展延 13.900677652
+维贾亚纳 11.8212361103
+接器 13.900677652
+杜青林 12.8020653633
+河自北 13.900677652
+包埋剂 13.900677652
+坡地 9.48183704418
+大雾山 12.1089181827
+人格健全 12.2912397395
+奥文多 13.2075304714
+两地相思 13.900677652
+少伯 13.2075304714
+翔实 9.48183704418
+强拍 12.5143832909
+少掌柜 13.900677652
+演秘 13.900677652
+过密 11.598092559
+拉萨河 10.7226238216
+强拆 10.3743171274
+叫苦连天 11.4157710022
+卢嘉锡 11.9547675029
+李龙 11.5027823792
+讲武 11.1280889297
+手抱着 10.6818018271
+金朝皇帝 12.5143832909
+李龟 12.8020653633
+张伯祖 13.2075304714
+翔宇 12.2912397395
+琪花瑶草 12.2912397395
+一百八十八种 13.2075304714
+埃塞俄比亚政府 12.5143832909
+试表 12.8020653633
+爱子 10.4666904475
+抗清 9.18217878068
+崩落 10.765183436
+轩尼诗 13.900677652
+爱孙 12.5143832909
+库马拉通加 13.2075304714
+同在 9.20019728618
+抗渗 12.1089181827
+顾公子 13.900677652
+塔门 11.2616203224
+卢邦博 13.900677652
+国家卫生部 11.8212361103
+脑门 9.09665660724
+应授田 12.8020653633
+同场 12.8020653633
+梁元帝 10.7226238216
+冷谈 13.900677652
+喝咖啡 10.9049453784
+假睫毛 13.900677652
+九尾狐 12.8020653633
+未加 10.2897597393
+岌岌 12.2912397395
+留学签证 13.900677652
+咔嚓 9.74179456862
+赚钱网 13.900677652
+海外部 12.8020653633
+贵定县 12.8020653633
+纳卡 12.2912397395
+翠墨 11.2616203224
+五十二万余 13.2075304714
+张伯端 11.9547675029
+伤心事 11.3357282945
+别人找 13.900677652
+莘之君 12.8020653633
+余力 11.1926274509
+父女 9.46986085313
+满舵 13.900677652
+观云 12.8020653633
+稍停 10.2117981979
+满船 12.2912397395
+易性 12.5143832909
+苏威孚 12.1089181827
+甲兵 10.4349417492
+主治医师 10.604840786
+鞭箠 13.900677652
+彩云 8.86372504956
+易怒 10.1630080337
+点射 10.3743171274
+马路新闻 12.2912397395
+未开化 11.3357282945
+今冬 10.0088573539
+百年大业 13.900677652
+书香门第 10.604840786
+普雷斯特 13.900677652
+同坐 11.0674643079
+闻孙权 12.2912397395
+脆快 13.900677652
+石车 12.8020653633
+针脚 11.3357282945
+插页 8.47133202302
+党和国家 9.03314320152
+东汉时代 12.1089181827
+奥尼河 13.900677652
+生成 6.78509552579
+心慈 12.1089181827
+日用五金 13.2075304714
+詹氏 12.5143832909
+桥顶 12.5143832909
+接唱 13.2075304714
+赤水 10.9562386728
+给水管 12.5143832909
+余剩 11.598092559
+脆弱 7.93967231235
+辅助因子 13.2075304714
+有案可查 12.5143832909
+今典 11.9547675029
+构造方法 12.2912397395
+试行 8.36728816325
+今兴 13.2075304714
+快借 13.900677652
+心慌 8.73019365694
+平利县 12.8020653633
+同型 10.9049453784
+咸福宫 12.2912397395
+人家 5.64823156173
+迫切需要 8.98069672615
+其余不问 13.900677652
+涅夫斯基 12.1089181827
+林森为 11.7034530746
+西藏山南地区 12.8020653633
+余割 12.5143832909
+侍卫官 12.5143832909
+九十岁 11.5027823792
+明万历 9.01787572939
+越繇王 13.900677652
+二百余万 13.2075304714
+决出名次 13.2075304714
+梁君壁 12.1089181827
+余切 12.1089181827
+余则 11.598092559
+彭进士允 13.900677652
+逯钦立 12.8020653633
+寥寥数语 12.5143832909
+生手 11.9547675029
+瞿北杨 13.2075304714
+爱安 12.8020653633
+万吨轮 11.598092559
+鞭笞 10.4041700905
+余利 12.2912397395
+汉语言 12.5143832909
+今儿 7.77380846786
+爱家 10.2117981979
+同城 10.2897597393
+坡向 11.1280889297
+愿受 10.7226238216
+杂家 10.8096351986
+单方面 9.02548032877
+丝虫 11.8212361103
+剖腹 10.3743171274
+鲜花店 13.900677652
+岳山 11.9547675029
+手工业 6.96530720596
+贞静 12.2912397395
+错误百出 13.2075304714
+矿产资源 7.45020722983
+唯心 10.642581114
+急救中心 11.1280889297
+龙须菜 13.2075304714
+至上而下 13.900677652
+传统服装 11.9547675029
+硼氢化钠 12.5143832909
+泽列诺 12.8020653633
+四千多 11.1280889297
+丝板 13.2075304714
+曾任州 13.2075304714
+丰富性 11.1280889297
+小菜一碟 11.0674643079
+毛里塔尼亚伊斯兰共和国 12.8020653633
+所帖 13.900677652
+爱婴 13.900677652
+木金土 13.2075304714
+隆德县 12.2912397395
+而且 4.39647434847
+麻老四 9.85762638414
+满白雪 13.900677652
+知遇之恩 9.94943393339
+玩电脑 12.1089181827
+余台 11.8212361103
+俞作豫 12.8020653633
+幅员广大 11.8212361103
+六小龄童 13.900677652
+本籍 13.2075304714
+日珥 11.5027823792
+良友 11.0103058941
+鼠疮 11.9547675029
+想象性 13.2075304714
+阴阳易位 13.900677652
+爱娇 11.8212361103
+比阿炳 13.2075304714
+冰塔林 11.5027823792
+养公田 13.900677652
+杏山 10.4666904475
+赵王高 12.2912397395
+胰液 10.765183436
+塔钟 13.900677652
+最旧 13.900677652
+易感 10.0294766411
+田粮 11.8212361103
+不请 10.4994802703
+运输装置 13.900677652
+向里 10.2117981979
+借端 12.2912397395
+公奉成 12.5143832909
+争执 8.49350588052
+照明负荷 13.900677652
+明景泰 11.4157710022
+金矿业 10.8096351986
+检查团 10.4041700905
+接听 9.12155415886
+以貌取人 12.8020653633
+吴德仁 13.2075304714
+拍成电影 11.3357282945
+余华 12.5143832909
+心慧 13.2075304714
+鸟气 11.598092559
+专门班子 13.900677652
+金波玉液 13.900677652
+尔海峡 10.3453295905
+螺旋霉素 13.900677652
+陈辞 12.1089181827
+龙须草 11.2616203224
+股市市值 11.4157710022
+强悍 9.28555713513
+卖富差贫 13.900677652
+接合 10.3171587135
+演算 9.53122979951
+晶状体 10.4349417492
+步速 12.2912397395
+威慑力 10.8561552143
+头晕目眩 9.85762638414
+仇未复 13.900677652
+良医 11.3357282945
+五一节 12.8020653633
+北城 9.41204128224
+始祖鸟 10.9562386728
+稀里哗啦 10.9049453784
+机型 9.02548032877
+哈剌鲁 13.2075304714
+每逢佳节倍思亲 13.900677652
+爱媛 12.5143832909
+明内府 13.2075304714
+观众 7.35532799164
+擦肩而过 9.87532596124
+工夫茶 11.8212361103
+旧貌换新颜 13.900677652
+金军渡 12.1089181827
+同国 13.2075304714
+的里雅斯特 11.1280889297
+熊见 13.2075304714
+宾师之 12.8020653633
+杜布瓦 11.9547675029
+德拉古 12.2912397395
+给水站 13.2075304714
+保护色 10.4994802703
+灵蛇之珠 13.900677652
+余匹 12.8020653633
+陆家湾 13.2075304714
+入水管 13.2075304714
+快餐厅 13.900677652
+德真君 13.2075304714
+新喀里多尼亚 10.533381822
+赞词 11.7034530746
+余响 13.900677652
+白虎岭 12.8020653633
+双向收费 13.2075304714
+湄洲湾 11.4157710022
+余品 13.2075304714
+八方客 13.2075304714
+隆升 10.3743171274
+毫伏 11.3357282945
+德拉吉 13.900677652
+衣不解带 12.5143832909
+磺酸盐 12.1089181827
+来电显示 11.7034530746
+一大笔钱 10.604840786
+布朗宁 11.1280889297
+六月雪 12.8020653633
+愧无以报 13.900677652
+王文京 12.5143832909
+箴言 10.3743171274
+病中 9.77354326693
+甲地 13.2075304714
+易晓 12.8020653633
+雌蕊 9.61021821083
+务本 12.8020653633
+拦不住 10.2897597393
+早隔离 13.900677652
+熊飞豹 12.8020653633
+作伪者 13.900677652
+广示恩 13.2075304714
+化简 12.1089181827
+通许 11.0103058941
+美国苹果公司 13.900677652
+引起矛盾 13.2075304714
+惊愕失色 13.900677652
+纪日法 12.8020653633
+甲坝 13.2075304714
+纳唐 12.8020653633
+阳诸姬 12.2912397395
+线装书 11.3357282945
+接口 8.68574189437
+伊西斯 11.5027823792
+十万户 11.8212361103
+次级线圈 13.900677652
+港龙 12.8020653633
+投影图 12.5143832909
+茶缘 13.900677652
+轱轳 13.2075304714
+桂平县 10.9562386728
+王念孙 10.642581114
+丝杠 11.7034530746
+易易 12.5143832909
+十三顷 13.2075304714
+宁镇杨 12.5143832909
+强权 10.4041700905
+闹笑话 12.2912397395
+卷轴装 13.900677652
+散见于 10.0720362555
+华灯初上 11.598092559
+北海港 12.1089181827
+接取 12.1089181827
+接发 12.5143832909
+修车铺 13.2075304714
+杏子 10.5684731418
+良吏 12.1089181827
+阜南县 12.8020653633
+沙伊 12.8020653633
+由南向北 10.0940151622
+汁儿 11.5027823792
+轱辘 10.8561552143
+填有 13.2075304714
+酸苦 11.4157710022
+平阳县 10.8561552143
+王文举 13.900677652
+干部人事 11.7034530746
+讲清 11.2616203224
+议会 7.00499495423
+呼兰府 12.5143832909
+烧香 8.83177344976
+黑颈鹤 10.3453295905
+李赛普 13.900677652
+沙伐 13.900677652
+谈吐不凡 13.2075304714
+管城 10.2897597393
+蛀食 11.1926274509
+甲型 7.61096208107
+嚏喷 12.8020653633
+杂工 11.8212361103
+尔依 9.80633308975
+宜林宜 12.8020653633
+张墩儿 13.2075304714
+贵州菜 13.900677652
+狐裘 12.2912397395
+抗磨剂 11.7034530746
+剑拔弩张 10.1164880181
+爱巢 12.8020653633
+病人 6.77861777035
+玛尔巴 12.8020653633
+余味 11.7034530746
+有始有卒 13.900677652
+相溶性 13.2075304714
+巨像 9.71102290995
+扳子 13.900677652
+余名 9.23723855786
+阿塔瓦尔 11.598092559
+双位数 11.9547675029
+石角 12.2912397395
+方寸地 13.900677652
+校委会 12.8020653633
+尚需 8.81927328699
+不能同意 11.1280889297
+罚作 11.4157710022
+狠起来 13.900677652
+湿气流 12.1089181827
+磷矿 9.53122979951
+白虎山 11.9547675029
+石见 13.2075304714
+同出 11.0103058941
+范祖仁 11.0103058941
+余吨 10.4041700905
+热敏纸 13.2075304714
+亚拉河 12.2912397395
+高密县 13.2075304714
+魍魉 11.3357282945
+快给我 9.98865464655
+甲基 9.04864738806
+申时攻 13.2075304714
+学科分类 12.8020653633
+声威 9.61021821083
+人走灯灭 13.900677652
+捞钱 10.4994802703
+满蒙 10.533381822
+一十四员 12.8020653633
+输送机 11.1280889297
+碎块 10.2630914922
+水橇 12.2912397395
+郭子 13.2075304714
+罗又伦 13.900677652
+杂居 9.33632946051
+海盗旗 11.0674643079
+议事 8.11071748108
+刘秀才 11.8212361103
+生料 12.8020653633
+拉莫尔 13.900677652
+九四年 13.900677652
+良善 10.9562386728
+埃尔湖 12.2912397395
+毫不 7.75220935606
+庄稼活 11.598092559
+截然不同 8.4801426527
+许云峰 13.2075304714
+闹个 11.1280889297
+身高马大 12.5143832909
+伊斯塔 13.2075304714
+试乘试驾 11.0674643079
+掘金 7.98988100794
+环境规划 11.598092559
+望海埚 13.2075304714
+玩意儿 9.04086524761
+甩不开 13.2075304714
+王玺绶 13.900677652
+质量指标 11.7034530746
+陈登往 13.900677652
+五官端正 11.2616203224
+津市 11.8212361103
+东平路 12.5143832909
+接办 10.6818018271
+接力 9.53122979951
+尾椎骨 13.900677652
+亡国破家 12.5143832909
+百岁诞辰 13.900677652
+东瓜 12.5143832909
+尔丁 13.2075304714
+世界贸易组织 10.2897597393
+天高地厚 11.598092559
+燕皇帝 11.7034530746
+相溶合 13.2075304714
+拜耳公司 13.2075304714
+议付 13.900677652
+纳吉 10.9049453784
+李鬼 10.9049453784
+金达莱 12.5143832909
+爱将 9.87532596124
+炮兵团 9.87532596124
+病体 10.1394775363
+眉眼 9.55687223012
+下马威 10.6818018271
+爱尼 13.900677652
+二聚化 13.900677652
+嫁女 10.6818018271
+远门 11.1280889297
+易服 11.0674643079
+小奏鸣曲 13.2075304714
+生日 8.10158499752
+王文俊 13.900677652
+诺亚舟 13.900677652
+尔乃 12.5143832909
+下龙湾 12.8020653633
+讲演 9.44633035572
+未列 12.1089181827
+永垂青史 13.900677652
+病例 7.72897705456
+罚下 13.2075304714
+克罗恩 13.900677652
+荀林父 12.8020653633
+韦达 10.9562386728
+点接触 11.8212361103
+沙丘 8.41173992582
+如此而已 11.0674643079
+纳哈 11.9547675029
+噎噎 13.900677652
+沙东 13.900677652
+送人情 12.5143832909
+强暴 10.1164880181
+接到 6.72825307485
+嚷闹 11.8212361103
+两百余 11.598092559
+罚中 13.900677652
+缓兵之计 10.2897597393
+通气管 11.5027823792
+受到好评 11.1926274509
+冲压机 13.900677652
+丰意 12.8020653633
+健康人 10.0294766411
+扫走 12.2912397395
+酸菜 10.4041700905
+谕告 13.2075304714
+傻丫头 10.3743171274
+纺成 10.8096351986
+常因 9.84023464143
+韦述 12.8020653633
+恐惧症 11.2616203224
+放鹰逐犬 12.8020653633
+爱岗 13.2075304714
+铁棺峡 12.8020653633
+诸王贝 13.900677652
+逃禅 12.5143832909
+东方学家 11.4157710022
+级别管辖 11.8212361103
+希拉勒 13.2075304714
+生效 7.65651075131
+韦迪 12.1089181827
+史文彬 13.2075304714
+伊菲亚 13.900677652
+九五至尊 10.8096351986
+人字 11.0103058941
+塞巴斯蒂 12.8020653633
+四步曲 12.5143832909
+逃离 8.61747392324
+不懂道理 12.5143832909
+阿尔福斯 12.8020653633
+苦卤 13.2075304714
+同僚 8.76487921493
+兵家 9.26594866375
+大熊星座 11.8212361103
+太阳系外 11.9547675029
+逛庙会 11.9547675029
+冬令 10.8561552143
+石头城 10.533381822
+费伦茨 12.8020653633
+现金流量 9.62401153296
+余汉谋 12.8020653633
+芭蕾舞鞋 13.900677652
+杂录 10.7226238216
+李顺 8.70772080109
+仪表厂 13.2075304714
+向天 11.0103058941
+新闻联播 10.4666904475
+李顿 12.8020653633
+吹灭 9.96885201925
+填料 10.3453295905
+同区 13.2075304714
+筮法 12.5143832909
+渝水 12.2912397395
+百分之九十几 13.2075304714
+布莱里 12.8020653633
+枫桥镇 13.2075304714
+质检局 13.2075304714
+油压式 13.2075304714
+同化 8.89673134603
+塔里 10.8096351986
+滔天大祸 12.8020653633
+寄蝇 11.598092559
+填方 13.2075304714
+踡跼 13.900677652
+杂役 9.84023464143
+脑量 11.3357282945
+讲法 10.9562386728
+黄际 13.2075304714
+中国中央政府 11.7034530746
+逃税 10.0294766411
+索菲特 12.2912397395
+打交道 8.44535653662
+描划 13.900677652
+扫黄打非 10.533381822
+维科夫 12.1089181827
+常绿雨林 11.9547675029
+肖像权 12.5143832909
+王伐商 13.2075304714
+组氨酸 11.9547675029
+魏文候 12.8020653633
+那叶清 13.2075304714
+感情丰富 12.5143832909
+同升 12.1089181827
+双生子 11.598092559
+金字塔式 11.0674643079
+雌蜂 11.1280889297
+彭斐章 13.2075304714
+马马虎虎 10.4349417492
+北圻 11.8212361103
+波斯纳 12.5143832909
+磨坊主 12.5143832909
+连接 6.92900904725
+杀害 7.60356833204
+必胜信心 11.8212361103
+特种水泥 12.8020653633
+嘉兴人 11.0674643079
+唯识宗 11.0103058941
+环境遥感 13.900677652
+代曹魏 13.2075304714
+作物组合 13.900677652
+翩跹 12.8020653633
+爱伦堡 12.2912397395
+国家税务 13.900677652
+方格子 12.2912397395
+苗而不秀 13.900677652
+二亿四百九十七万余两 13.2075304714
+陈圆圆 9.72629038208
+鲁斯坎 11.5027823792
+行政诉讼法 10.7226238216
+显微结构 11.9547675029
+准备金 8.64318227995
+合好 12.1089181827
+爱心 8.52539924429
+杂志 6.93371051336
+乱滚 10.9049453784
+另谋出路 11.0674643079
+同县 11.9547675029
+问与答 13.900677652
+同去 8.96620371885
+未接 13.2075304714
+混合态 12.8020653633
+喑哑 10.9049453784
+鲁斯坦 12.8020653633
+凤昌 12.8020653633
+姜亚纲 12.5143832909
+整体优势 11.8212361103
+李风 10.0940151622
+偏颇 9.89334446674
+杂念 10.765183436
+关履权 12.2912397395
+琼海县 13.2075304714
+李飞 11.0674643079
+偏题 12.8020653633
+除旧布新 12.2912397395
+狍子 10.0505300503
+笼络人心 10.3743171274
+爱徒 13.2075304714
+环境自净 12.2912397395
+段儿书 13.2075304714
+爱得 9.80633308975
+点缺陷 13.900677652
+接入 8.4980002701
+阳三蒸 13.2075304714
+同号 12.5143832909
+正处级 11.9547675029
+二年级 10.1394775363
+孙男弟 12.8020653633
+同台 10.3743171274
+逃窜 9.13850371718
+常务理事 9.14708746087
+津巴 12.8020653633
+大礼堂 11.5027823792
+美陆军 10.0088573539
+未开垦 11.3357282945
+四万多户 13.2075304714
+捣碎 10.533381822
+爱德 13.2075304714
+傅增湘 12.8020653633
+毛盖儿 12.8020653633
+演绎 7.80485308954
+二甲胺基 12.8020653633
+满山满谷 12.2912397395
+同发 12.8020653633
+中学毕业 9.87532596124
+演练 9.48183704418
+李颖 11.8212361103
+人名录 13.900677652
+陈奎元 12.5143832909
+亦正亦邪 13.2075304714
+明镜高悬 12.5143832909
+青云山 13.900677652
+标准气压 13.900677652
+谏书 12.2912397395
+鹤势螂形 13.900677652
+一再声明 12.1089181827
+布拉瓦约 12.1089181827
+个体所有 13.900677652
+语言障碍 11.8212361103
+唐开成 12.5143832909
+罩不住 13.2075304714
+千千克 13.2075304714
+脑部 10.0294766411
+香型 11.5027823792
+同分 12.5143832909
+意志品质 12.1089181827
+有志者 12.8020653633
+假痴不癫 13.900677652
+各得其所 10.7226238216
+雌虎 12.8020653633
+韩国议会 13.900677652
+候船室 13.900677652
+爱幼 13.2075304714
+伊尔 9.22784881751
+西安交通大学 11.1926274509
+老的辣 11.1926274509
+鲁斯图 13.2075304714
+酸腐 12.1089181827
+同创 11.8212361103
+苏衣糖 12.8020653633
+柔道服 13.2075304714
+疗程短 12.8020653633
+未及 8.61747392324
+借给 9.01032852375
+甩开膀子 12.8020653633
+尼龙袋 13.2075304714
+唯实 13.2075304714
+昨在 12.1089181827
+刘义宣 13.900677652
+辛未 13.2075304714
+尼龙袜 13.2075304714
+醇美 11.3357282945
+九十多 13.2075304714
+一个八品 13.900677652
+荣幸之至 13.2075304714
+利市 11.7034530746
+信皮 12.8020653633
+九十天 13.2075304714
+同前 10.604840786
+和英子 11.0674643079
+曾毅公 13.2075304714
+酉时 10.4666904475
+背义忘恩 12.2912397395
+沁阳 10.0940151622
+化碳 13.900677652
+浇熄 13.900677652
+尚钺 12.8020653633
+爱带 13.2075304714
+手写体 11.7034530746
+残障儿童 13.2075304714
+无生气 11.598092559
+於奈 12.8020653633
+重命名 11.3357282945
+核质 11.8212361103
+陷敌 13.2075304714
+弃置不用 13.2075304714
+化硅 13.900677652
+酸臭 12.8020653633
+红外线 9.18217878068
+缩小成 13.2075304714
+靠门 12.2912397395
+寇谦之 10.9562386728
+东牟山 12.8020653633
+斥责地 13.900677652
+吕伯 13.900677652
+培训师 12.1089181827
+涂梢蕴 12.8020653633
+余块 11.8212361103
+藤茎 12.8020653633
+内务条令 11.7034530746
+买办资本 11.8212361103
+姚文元 10.9049453784
+贾雨村 10.7226238216
+胎位 10.6818018271
+林增平 12.5143832909
+自流井 11.2616203224
+库拉索 12.5143832909
+木儿入 13.2075304714
+今周 13.2075304714
+杀婴 13.900677652
+洗城 13.2075304714
+交通事故 8.57280148319
+胎体 10.4994802703
+存款额 10.8096351986
+杭子和 12.5143832909
+多此一举 10.8096351986
+炼钢厂 11.2616203224
+旷荡 12.8020653633
+路易港 12.2912397395
+抗毁 12.8020653633
+低密度 10.1164880181
+全景式 11.4157710022
+始祖马 12.2912397395
+汉景耀 13.900677652
+祝捷 11.4157710022
+豆腐坊 12.2912397395
+今名 9.56994431169
+今后 6.23164936339
+版刻 12.5143832909
+易斯 12.8020653633
+抗毒 13.2075304714
+探口气 12.8020653633
+函授教育 12.2912397395
+雕章琢句 13.900677652
+不在话下 8.34771806705
+吃完饭 9.18217878068
+黑糊糊 10.4349417492
+成不成 10.8096351986
+落拓 11.5027823792
+雌蚁 13.2075304714
+颈椎骨 12.2912397395
+前堂 12.2912397395
+贫民窟 10.4349417492
+桑贾伊 12.8020653633
+李香 12.2912397395
+老少咸宜 12.5143832909
+余场 12.1089181827
+饭来张口 12.2912397395
+心内科 12.1089181827
+适宜区 12.2912397395
+赤水河 10.4994802703
+余地 8.2273543848
+生来 8.95903522937
+惠州市 11.5027823792
+宝钢股份 9.00283785202
+四氯化硅 13.2075304714
+萧县 10.604840786
+张重华 13.900677652
+天有不测风云 11.0103058941
+年限 8.51618258919
+凝聚 8.2985588311
+七十多岁 10.642581114
+几百所 13.900677652
+广为流传 9.35738286971
+季文子 13.900677652
+同仁医院 11.1926274509
+平顶山煤业 13.2075304714
+三黄 12.8020653633
+紫姜 13.900677652
+夹江县 13.900677652
+战之士 12.2912397395
+玄武真 13.2075304714
+围追 13.2075304714
+宦海风波 13.900677652
+热辣 11.9547675029
+失之千里 12.1089181827
+亲如家人 12.5143832909
+褐土 10.1394775363
+列子 11.0103058941
+紫姬 12.2912397395
+第四阶段 11.1926274509
+王监军 13.2075304714
+排爆 13.2075304714
+假造 12.2912397395
+哀痛欲绝 13.900677652
+嗅到 9.31571017331
+韩国泡菜 12.8020653633
+热过 11.9547675029
+蒙古包 10.0940151622
+假道 10.4666904475
+交响协奏曲 13.900677652
+黄毛青 12.5143832909
+中文信息 13.900677652
+京沪铁路 9.91169360541
+书目工作 13.900677652
+签定 9.48183704418
+证据法 11.9547675029
+尽性 12.8020653633
+培基 12.2912397395
+加加林 11.4157710022
+免疫 7.68606955355
+武清县 11.1280889297
+貂婵 13.900677652
+龙寺 11.9547675029
+传授给 10.3171587135
+见此 9.84023464143
+掉线 13.900677652
+借助于 8.80081122415
+马真人 11.598092559
+挪威克朗 11.8212361103
+扬琴 10.3743171274
+品鉴 10.5684731418
+情报处 12.1089181827
+乘数 9.63799777493
+钱潮 11.5027823792
+排版 11.0674643079
+三麦 12.8020653633
+睡乡 11.598092559
+桑巴舞 13.2075304714
+郭超人 13.900677652
+银筷 12.8020653633
+束发 10.8561552143
+辛松 12.8020653633
+第十九路 11.7034530746
+则徐 13.2075304714
+小清河 10.8561552143
+颛顼 9.7898037878
+码头区 11.4157710022
+土霉素 12.5143832909
+剑门关 11.9547675029
+精通 8.2273543848
+凝胶 10.0088573539
+圆柱投影 13.2075304714
+三鹿 9.96885201925
+刘抗曹 13.900677652
+狄青 11.1280889297
+残疾儿童 12.8020653633
+无餍 12.8020653633
+尽情 8.89004235788
+精选 6.98495420334
+乘方 11.2616203224
+抽时间 12.2912397395
+飞行速度 9.15574552361
+培土 11.1280889297
+寻径 13.900677652
+仰体 12.1089181827
+听政 10.3171587135
+弄钱 10.7226238216
+上官卑 12.8020653633
+阿皮亚 13.2075304714
+家庭经营 12.8020653633
+勤奋努力 12.8020653633
+睡个 10.8561552143
+函数参数 13.2075304714
+玄武石 13.2075304714
+分析判断 10.4666904475
+提前准备 11.7034530746
+全文检索 13.900677652
+钟响 12.2912397395
+紫外 9.24671730182
+含盐度 11.0103058941
+红六军 12.8020653633
+哪些方面 10.642581114
+武清区 12.8020653633
+据统计 7.28998160726
+猎具 13.2075304714
+常任代表 12.5143832909
+皮带秤 13.900677652
+鳞集 13.900677652
+优良率 12.1089181827
+睡下 9.20932976975
+睡上 11.0674643079
+大吆小喝 13.900677652
+利比 12.8020653633
+拉弗拉 13.2075304714
+新息 12.1089181827
+上官占 13.2075304714
+四氯化碳 10.4666904475
+埃布尔 12.8020653633
+俱全 9.59661255877
+泥疗 13.900677652
+楚瓦什 11.598092559
+积弊已深 13.2075304714
+三番两次 11.9547675029
+蒙特罗 12.5143832909
+换新装 13.900677652
+寓情于景 12.8020653633
+扬长而去 9.59661255877
+寻常 8.0746775446
+康采恩 11.9547675029
+相知 9.75754292558
+江右军 12.5143832909
+龅牙 13.2075304714
+弄错 9.91169360541
+异香 10.2371160058
+新名 12.8020653633
+申建 12.2912397395
+星位 12.1089181827
+热身 10.0940151622
+几粒 9.94943393339
+岩床 12.2912397395
+驮骡 13.2075304714
+黄道带 13.900677652
+民主革命家 11.598092559
+无题 12.2912397395
+无颜 11.0103058941
+谓予不信 13.2075304714
+三龙 12.8020653633
+预藏 13.900677652
+入境者 12.2912397395
+假酒 11.598092559
+养蜜蜂 12.8020653633
+天主教爱国会 13.900677652
+马二马 13.2075304714
+陡壁悬崖 13.900677652
+寻幽 13.900677652
+陈公子 12.8020653633
+裴元绍 12.8020653633
+黄雀 11.5027823792
+王禹九 12.8020653633
+凝脂 11.3357282945
+每棵 11.8212361103
+高宗遂 13.2075304714
+批给 11.7034530746
+网联 13.2075304714
+人寿 7.81163277653
+丘祖殿 11.7034530746
+小说月报 10.8096351986
+广西军区 12.5143832909
+娱乐片 13.2075304714
+无风 9.96885201925
+泥球 12.2912397395
+打蜡机 12.5143832909
+奋飞 13.2075304714
+精量 13.900677652
+相瞒 11.8212361103
+尽意 11.5027823792
+澎湖 9.75754292558
+娄山 12.1089181827
+这有 8.32094782599
+企求 11.1280889297
+每株 11.7034530746
+夏凉 11.3357282945
+平型关大捷 12.8020653633
+烧出来 11.8212361103
+先纳 11.5027823792
+二十载 12.2912397395
+民工荒 10.533381822
+戎芦河 13.900677652
+杜家台 11.2616203224
+每样 11.5027823792
+碘化银 11.598092559
+唐制复 12.8020653633
+秋后算帐 12.2912397395
+古今笑 13.2075304714
+展位号 13.900677652
+每栋 11.4157710022
+油烟机 13.900677652
+山羊皮 11.598092559
+无故呻吟 13.900677652
+锦州港 11.8212361103
+济私 13.900677652
+囔囔 12.8020653633
+吹灯拔蜡 12.8020653633
+七窍玲珑 13.900677652
+刮油 12.5143832909
+人间天堂 11.2616203224
+孙铁木 11.9547675029
+即物穷理 12.1089181827
+济科 13.2075304714
+第二袋 13.2075304714
+矮凳 11.0103058941
+由旬 13.900677652
+盟弟 13.2075304714
+高度层 13.2075304714
+从头到尾 9.53122979951
+元帝建 12.8020653633
+并不等于 9.69598503258
+张团练 11.2616203224
+下苦功 13.2075304714
+洋洋大观 12.8020653633
+推头 13.2075304714
+无瑕 10.533381822
+整体化 11.7034530746
+型谱 13.900677652
+白羊座 11.9547675029
+三鼎 11.5027823792
+每桶 8.29487558568
+假释 10.9562386728
+第十八卷 11.9547675029
+中位沼泽 13.2075304714
+相看 10.1630080337
+下定义 11.4157710022
+魏立 12.8020653633
+密度涨落 12.8020653633
+珠江路 13.900677652
+构象 10.3743171274
+掐着 10.2897597393
+相张纯 12.8020653633
+消费信贷 9.53122979951
+唐武 12.8020653633
+卡洛尔 13.900677652
+荫庇 11.1926274509
+几群 12.5143832909
+耶律阿 13.900677652
+求职 9.98865464655
+揪辫子 13.2075304714
+携带 7.21982297319
+农村居民 9.82314020807
+组织协调 10.7226238216
+竹节状 13.2075304714
+海洋馆 12.8020653633
+思来想去 10.2371160058
+韶山 11.0103058941
+束光 12.8020653633
+生理学家 9.62401153296
+心掏 11.8212361103
+每段 10.9049453784
+情报学 11.7034530746
+朱右曾 11.598092559
+郭涛 10.642581114
+骄奢淫逸 10.604840786
+凤阳县 11.598092559
+新地 10.0294766411
+四五块 12.8020653633
+纪寿 13.2075304714
+新场 13.900677652
+标点 9.58318953844
+抛光蜡 13.900677652
+萧军 12.2912397395
+忿怒 10.0940151622
+万贯家财 11.7034530746
+乘机 7.62968922012
+文史资料 11.7034530746
+护法 8.83808261895
+俱发 11.8212361103
+别洛乌 13.900677652
+万箭穿心 12.5143832909
+排灰 13.900677652
+三鲜 11.598092559
+一言一行 10.533381822
+施奈德 11.9547675029
+高高的 8.73019365694
+新坟 10.2897597393
+新坝 12.8020653633
+携幼 13.2075304714
+林西县 12.8020653633
+审判员 10.765183436
+由昆 12.1089181827
+麦已盛 13.2075304714
+以讹传讹 11.598092559
+筹集资金 9.7898037878
+房屋建筑 10.4994802703
+每每 8.58255765813
+胆碱 10.5684731418
+古罗糖 13.2075304714
+弄险 12.5143832909
+紫宫 13.900677652
+口福不浅 13.900677652
+服装节 13.900677652
+士达 12.1089181827
+李纹李 12.2912397395
+测试方法 11.4157710022
+排灌 10.0940151622
+四顾无人 12.1089181827
+展示架 13.2075304714
+紫宸 13.900677652
+铝质 10.642581114
+猎取 9.93038573842
+敌对行动 11.598092559
+考试分数 13.900677652
+控制精度 13.2075304714
+魏禧 11.9547675029
+乌羊 10.5684731418
+常规武器 10.0940151622
+滇东 9.74179456862
+排点 13.900677652
+每次 6.62204870966
+南太 11.5027823792
+岩崩 12.8020653633
+顺承 12.1089181827
+黄衫客 12.8020653633
+南天 9.77354326693
+活来 10.8096351986
+旗子 10.1164880181
+求胜 11.5027823792
+洛伊 12.1089181827
+排炮 11.598092559
+熊军 13.2075304714
+泥石 11.598092559
+赛音诺 11.8212361103
+热货 13.900677652
+建筑学家 11.9547675029
+东校区 12.1089181827
+顺手 8.03704647638
+围起 10.9562386728
+魏禅 12.5143832909
+言歌行 11.1926274509
+岩崖 11.7034530746
+消化力 12.2912397395
+代夏政 12.8020653633
+洛伦 12.5143832909
+几缕 10.4666904475
+空旷地 12.8020653633
+王率师 12.8020653633
+出差费 13.900677652
+湖南省 7.90422556336
+耶律隆 12.5143832909
+文采斐然 12.5143832909
+黄龙府 11.598092559
+五文钱 13.900677652
+吴权 13.2075304714
+新埔 13.900677652
+苦刑 13.2075304714
+盯视 11.1280889297
+每步 11.9547675029
+普莱雅斯 11.8212361103
+偏振光 10.0940151622
+泥胎 11.0674643079
+磨起 11.8212361103
+柳堂集 13.2075304714
+稀稀落落 10.6818018271
+国忠少 13.2075304714
+互操作性 12.1089181827
+花卉市场 12.2912397395
+萧公 13.900677652
+新城 8.27666014579
+林凤池 13.900677652
+听来 9.03314320152
+情报官 12.8020653633
+燕青转 13.2075304714
+连笑带 12.8020653633
+排烟 12.1089181827
+活期 9.28555713513
+听杨 13.2075304714
+位势论 13.900677652
+塔布克 13.900677652
+两片 8.95903522937
+王国萨 13.900677652
+萧克 11.7034530746
+贯串 10.2897597393
+慢起来 13.2075304714
+利根 11.9547675029
+岩岸 10.9562386728
+胯下 10.2371160058
+北洋大学 11.1926274509
+推导 9.33632946051
+乙酰基 11.9547675029
+狂飙运动 13.2075304714
+培养教育 12.2912397395
+网膜 12.5143832909
+托哥尔 12.1089181827
+郭沔 12.1089181827
+饿虎扑食 11.8212361103
+承压水 10.765183436
+真皮层 11.8212361103
+灵聪 12.5143832909
+杨秀峰 12.5143832909
+数一下 13.2075304714
+地翻土 12.8020653633
+年长 8.91707103027
+医学论坛 13.900677652
+方格花布 13.2075304714
+失笑散 13.900677652
+长老会 10.8096351986
+一个角 11.8212361103
+海底隧道 11.598092559
+双铁戟 12.8020653633
+由来 10.9562386728
+望厦村 12.8020653633
+革命英雄主义 11.9547675029
+流浪人 12.5143832909
+种麻 12.8020653633
+心室颤动 12.8020653633
+岩峰 12.1089181827
+苏里南 10.604840786
+如切如磋 13.900677652
+扬眉 11.5027823792
+浅表性 11.9547675029
+品酒 11.598092559
+拢共 12.8020653633
+华表 10.533381822
+监刑官 13.2075304714
+印信 9.91169360541
+矮化 11.0674643079
+都乐 11.2616203224
+推定 10.2371160058
+酥糖 11.7034530746
+几组 11.4157710022
+难驾驭 12.8020653633
+几经 8.55834340001
+妥为安排 13.900677652
+巍子 13.2075304714
+三十六方 12.8020653633
+杨诚会 11.2616203224
+梅迪契 13.2075304714
+震裂 11.8212361103
+明前茶 11.8212361103
+零增长 10.533381822
+醉话 11.9547675029
+共享存储器 13.900677652
+李伯钊 13.900677652
+伊川 10.2897597393
+听明 11.9547675029
+郭氏 11.0103058941
+洛东 12.1089181827
+艾能奇 12.8020653633
+闻所未闻 9.91169360541
+凤阳花鼓 12.1089181827
+了此心愿 13.2075304714
+娄底 11.1926274509
+儿童诗 12.8020653633
+用户服务 12.5143832909
+浙江医科大学 13.900677652
+卢纳察 11.9547675029
+相畏 12.5143832909
+境内外 9.26594866375
+猎刀 11.598092559
+年间 6.12708318462
+双皮奶 13.2075304714
+下死劲 11.8212361103
+向信标 13.2075304714
+外焦里嫩 13.2075304714
+杜鹃山 12.8020653633
+涎皮涎脸 13.2075304714
+申屠 11.4157710022
+韶州 11.2616203224
+情报体制 13.2075304714
+市场价 9.4233408375
+荣禄便 13.900677652
+操笑 10.6818018271
+投资方 10.0505300503
+一九五零年 13.900677652
+含糊不明 13.900677652
+志趣相投 12.8020653633
+从开田 13.2075304714
+头颈部 11.4157710022
+贯众 11.9547675029
+郭汜 10.4666904475
+采血车 12.5143832909
+金太祖 10.5684731418
+穿透率 12.8020653633
+明刘寅 13.2075304714
+秋纹 9.98865464655
+日影儿 13.2075304714
+岩屑 10.2117981979
+鹤骨松姿 13.900677652
+新图 11.5027823792
+忿懑 13.900677652
+荫影 12.8020653633
+洛书 11.4157710022
+恰如 10.1630080337
+梁开平 10.8561552143
+岩层 8.11993413618
+翟理斯 12.2912397395
+新园 12.2912397395
+三高 10.4041700905
+贫嘴贱舌 13.2075304714
+孔颖达 10.8096351986
+钨矿 10.2630914922
+回旋曲式 11.8212361103
+泥煤 11.8212361103
+餐风饮露 12.8020653633
+窥度 12.8020653633
+看人脸色 12.8020653633
+弄通 13.900677652
+智勇兼备 11.598092559
+吴子兰 12.8020653633
+轴浆 13.900677652
+不合算 10.9049453784
+网络接口 13.2075304714
+石前盟 13.2075304714
+东风村 12.1089181827
+董志原 13.2075304714
+地理书 11.4157710022
+本草纲目 10.0505300503
+数十余 12.5143832909
+年鉴 9.69598503258
+展源 13.2075304714
+锦州 8.59240995457
+梳理 8.51160592216
+丝萝 13.2075304714
+漏尽 12.8020653633
+就此 7.18408287845
+持久性 10.533381822
+悲剧性 10.4041700905
+疑义 11.0674643079
+打胜仗 10.0294766411
+推子 13.900677652
+数十位 10.8561552143
+生活圈 11.7034530746
+精铸 13.900677652
+杨坚 10.1394775363
+有话直说 11.9547675029
+岩寺 12.2912397395
+听懂 8.86372504956
+生石膏 13.2075304714
+新党 11.0674643079
+王氏改 13.2075304714
+疑为 10.2117981979
+藤原基经 13.900677652
+新元 10.6818018271
+巍山 11.1280889297
+一个身 10.9049453784
+古兰经 9.05649056552
+新光 10.9562386728
+热诚 10.4041700905
+停驶 10.7226238216
+百家公司 12.8020653633
+新兴 6.20947755445
+新兵 9.04086524761
+停驻 12.8020653633
+几种 7.29537973103
+几秒 10.8561552143
+亲如兄弟 11.9547675029
+觱篥 11.598092559
+中国中医研究院 13.2075304714
+第十八回 11.7034530746
+普法尔茨 12.1089181827
+归墟青 12.1089181827
+泥火山 12.1089181827
+展开讨论 10.9562386728
+田娘娘 10.9049453784
+可供参考 11.0674643079
+新军 9.07236391467
+趾头 12.5143832909
+新农 9.28555713513
+布尔津县 12.8020653633
+道不明 12.5143832909
+戚墅堰 12.1089181827
+泸天化 12.8020653633
+社会风气 10.1871055853
+白羊寨 10.9562386728
+骄兵悍将 12.5143832909
+出租屋 11.3357282945
+假钱 13.900677652
+三驾 9.17328983326
+田茂忠 13.2075304714
+照记 13.900677652
+相片 9.98865464655
+玄奘译 10.9049453784
+推展 11.2616203224
+三马 13.900677652
+慌恐 12.2912397395
+蹇滞 12.8020653633
+穆弘 9.54396882529
+主根 10.1164880181
+卡洛夫 11.7034530746
+桐柏县 10.2371160058
+混合式 10.765183436
+上下床 13.900677652
+关之琳 13.900677652
+寻寻 11.9547675029
+可压 13.2075304714
+舒龚 13.2075304714
+芳香化浊 12.1089181827
+巍峨 9.04086524761
+万余门 12.8020653633
+小熊座 11.1926274509
+殷夫人 13.900677652
+免疫预防 13.2075304714
+不容分辩 13.2075304714
+相爱 8.87679713113
+水鞋 13.900677652
+相爷 11.7034530746
+疑云 10.4994802703
+新出 11.8212361103
+出尘脱俗 13.900677652
+有话好说 11.7034530746
+推尊 11.9547675029
+荒淫无道 12.5143832909
+病毒 7.41757030052
+买辆 11.2616203224
+推射 12.2912397395
+四六 10.642581114
+房地产 5.45005170483
+相干光 10.8096351986
+尽数 8.84443184663
+哈木孙 13.2075304714
+阳平关 10.7226238216
+悲剧感 13.900677652
+穷学生 13.900677652
+尽散 11.8212361103
+液门 13.900677652
+顺时 11.8212361103
+疾患 9.00283785202
+重量级 9.25628675283
+泥灰 12.8020653633
+新债 9.33632946051
+任正非 12.1089181827
+流水账 13.2075304714
+蒸锅 11.9547675029
+拉弗朗 13.2075304714
+有雨 10.7226238216
+充当 7.47743068844
+很烂 11.9547675029
+满觉陇 12.5143832909
+情报局 10.4994802703
+有隙 11.1926274509
+丰干 13.2075304714
+笋鸡 12.8020653633
+尽收 10.765183436
+相环 13.900677652
+利湿 10.0940151622
+措手 11.3357282945
+疑似 9.20932976975
+爹爹 9.37888907493
+丁亥日 13.900677652
+宣传栏 10.9562386728
+黄道婆 11.0103058941
+删了 12.5143832909
+数十个 9.20932976975
+弄酒 13.900677652
+阳羡茶 12.5143832909
+暮色朦胧 13.900677652
+兵连祸结 11.8212361103
+有难 10.4041700905
+俯卧 10.765183436
+听惯 10.533381822
+都统 8.83177344976
+主债务 13.2075304714
+霉雨 12.1089181827
+张九龄 10.4666904475
+方向错觉 13.2075304714
+排着 10.0505300503
+摊贩 10.2117981979
+数十万 8.44963919841
+虎掌草 13.900677652
+小流氓 11.8212361103
+部分合成 12.8020653633
+精锻 13.900677652
+修造船 12.1089181827
+白专道路 13.2075304714
+数十件 11.9547675029
+死水一潭 13.900677652
+有限 6.12330404932
+圣马洛 12.8020653633
+茅茨土阶 13.900677652
+香汤 11.8212361103
+数十代 13.2075304714
+特殊效果 11.9547675029
+一刻钟 10.2371160058
+尽早 8.43261751084
+和蔼 9.41204128224
+扣头 13.900677652
+尉领护 12.8020653633
+信息网络 9.58318953844
+啼声 11.0674643079
+各司其事 13.2075304714
+精锐 8.32472854883
+展演 12.1089181827
+慌慌 10.1871055853
+刷下去 13.900677652
+路程 8.24468584116
+黄大仙区 13.2075304714
+金吾卫 12.8020653633
+红铅笔画 13.2075304714
+树轮 13.2075304714
+马尔库塞 12.5143832909
+旗山 11.9547675029
+容老奴 13.2075304714
+新四军 8.55357012126
+秦属闽 13.2075304714
+操大喜 10.2630914922
+圣日耳曼 11.4157710022
+卡奥斯 13.2075304714
+锦屏 10.2117981979
+泥炭 9.32596667347
+魏续 11.3357282945
+办公自动化 11.0674643079
+为德不卒 13.900677652
+石油焦 12.1089181827
+罩儿 13.2075304714
+雪地冰天 13.900677652
+作案者 13.900677652
+怵目惊心 12.8020653633
+阿陶罗 13.900677652
+国史大纲 13.900677652
+数十亿 10.604840786
+费边 11.3357282945
+阳友鹤 12.8020653633
+泥点 12.5143832909
+炳焕 13.900677652
+多万公顷 9.93038573842
+雨潇潇 13.2075304714
+数十亩 12.2912397395
+邵大爷 13.2075304714
+很象 10.7226238216
+拘泥形式 13.900677652
+轴式 11.3357282945
+巍巍 9.93038573842
+跑反 12.8020653633
+马纳克 13.2075304714
+整流罩 10.2630914922
+影评家 11.9547675029
+虚位移 11.5027823792
+青苗法 12.1089181827
+乌苏里 12.1089181827
+这架 9.87532596124
+推崇 8.30225569298
+不管一二 13.900677652
+气艇 13.900677652
+冷钢化 13.900677652
+苦力 10.0940151622
+新化 11.0103058941
+李常杰 13.900677652
+利派 11.5027823792
+持久战 10.2371160058
+盖伊 11.1926274509
+司礼太监 11.0674643079
+推延 11.598092559
+领跑者 10.0940151622
+做做饭 12.8020653633
+几箱 11.598092559
+黄尘 10.1630080337
+三风 12.8020653633
+寻夫 10.9049453784
+文化景观 10.8561552143
+苦功 11.598092559
+利津 10.7226238216
+在线看 12.5143832909
+防上 13.900677652
+前夕 7.66822963543
+巴戟天 12.1089181827
+肖斯塔科维奇 11.4157710022
+盖伦 12.2912397395
+新区 8.37124856446
+戏剧家 9.55687223012
+有间 11.5027823792
+换景 13.2075304714
+构设 13.900677652
+有门 10.5684731418
+亚述王 12.1089181827
+福迪奥 12.5143832909
+纺织印染 11.8212361103
+排球 10.0294766411
+和秀春 12.5143832909
+防个 13.900677652
+扬特 13.900677652
+战争初期 9.96885201925
+构词 11.0103058941
+邓县北 13.2075304714
+腿抽筋 11.598092559
+王八羔子 11.1280889297
+尽显 9.87532596124
+沿街乞讨 12.8020653633
+三颗 9.94943393339
+盖住 9.28555713513
+盖佐 13.900677652
+柔软剂 12.8020653633
+接下去 8.75318317516
+投资性 9.71102290995
+前夜 9.59661255877
+泥猴 12.5143832909
+海法吉 13.2075304714
+新华 7.36398605438
+还俗 10.0720362555
+娄子 10.8561552143
+傻笑 10.1630080337
+还修 12.5143832909
+几篇 9.94943393339
+热解 11.1926274509
+乃公 13.900677652
+停顿 8.34384959028
+斯文扫地 11.9547675029
+紫微 10.4666904475
+头版头条 11.1926274509
+帝命 11.8212361103
+定向培养 12.8020653633
+构配件 13.900677652
+士豪 13.900677652
+牛羊猪 12.8020653633
+正月初十 12.8020653633
+壮年时期 13.900677652
+拉采尔 11.9547675029
+陈香梅 12.8020653633
+浸出液 12.1089181827
+时权臣 12.5143832909
+推平 13.900677652
+贝蒂数 12.8020653633
+还会 6.28193527431
+猎场 11.7034530746
+新历 12.1089181827
+态度生硬 13.2075304714
+革命干劲 12.8020653633
+网络连接 11.4157710022
+高粱米 12.1089181827
+几笼 13.900677652
+利润 5.66797164211
+三项 8.53470163695
+十来个 9.31571017331
+相夫教子 12.5143832909
+倒休 12.8020653633
+三顿 10.4994802703
+三顾 12.1089181827
+润滑脂 11.7034530746
+新去 13.900677652
+娄室 10.604840786
+三页 13.2075304714
+新县 10.0720362555
+倒会 10.5684731418
+三顶 12.8020653633
+离散数学 13.2075304714
+娄宿 13.900677652
+岑参 11.5027823792
+碳酸盐岩 9.71102290995
+几笔 10.2630914922
+周贻白 13.2075304714
+吹动 10.3453295905
+活捉 8.41588071849
+倒伏 10.3743171274
+过往船只 12.1089181827
+申奥 11.9547675029
+一万五千两 13.900677652
+有错 9.82314020807
+沂河 10.765183436
+新发 8.5440913773
+停飞 11.8212361103
+停食 12.1089181827
+广东政府 11.2616203224
+联络小组 13.2075304714
+精陶 11.7034530746
+护校 11.7034530746
+格利雅 11.598092559
+培养 6.63315222415
+有输有赢 13.900677652
+申复 13.900677652
+利淡 11.3357282945
+吸水 9.44633035572
+无齿 10.6818018271
+舒施尼 11.9547675029
+掐灭 11.7034530746
+顺昌 9.03314320152
+护栏 9.6811699468
+措办 12.5143832909
+藏卵器 12.1089181827
+新叶 10.8561552143
+培元 13.2075304714
+几等 11.5027823792
+衣纹 11.1280889297
+莫妮卡 13.900677652
+谢众 12.5143832909
+收购价格 9.32596667347
+年维勒 13.2075304714
+爱国卫生 12.5143832909
+分立元件 12.8020653633
+付款条件 13.900677652
+曼联队 13.2075304714
+新召 13.900677652
+三趾马 10.2630914922
+恒沙 12.5143832909
+还于 10.8096351986
+围裙 9.5186510173
+新创 10.1164880181
+盖下 11.8212361103
+二六五 13.900677652
+利水 10.4994802703
+肺心病 11.598092559
+后必生 12.8020653633
+白光闪 13.2075304714
+稳重 9.14708746087
+抄写 9.63799777493
+新刊 13.900677652
+奥涅加 12.2912397395
+数十把 13.900677652
+新到 10.3743171274
+新制 10.2117981979
+蒙泰尔 13.2075304714
+围裹 10.9562386728
+利民 10.7226238216
+电器行 13.2075304714
+蔡殿齐 13.2075304714
+好多代 12.8020653633
+剪力墙 12.8020653633
+楷体字 12.8020653633
+费赞 13.2075304714
+插一杠子 12.2912397395
+古生代 8.36334338496
+柴荣病 12.1089181827
+玩玩儿 11.8212361103
+防伪 9.38981814546
+几窝 12.2912397395
+死无葬身 13.900677652
+几章 11.0674643079
+恐吓信 10.8561552143
+倒仰 12.2912397395
+断绝来往 11.598092559
+艳情小说 13.2075304714
+中国工程物理研究院 13.900677652
+竹节石 11.8212361103
+俯允 11.2616203224
+三首 10.8096351986
+麦哲仑 13.2075304714
+谢亲 12.8020653633
+防住 12.1089181827
+几竿 12.8020653633
+钢材市场 8.95903522937
+紫府 11.8212361103
+欧舒丹 13.900677652
+热裤 13.2075304714
+谢了 9.53122979951
+香液 13.900677652
+黄绍站 12.5143832909
+倒仓 12.8020653633
+有钱 7.65457088649
+溢流坝 11.4157710022
+推得 10.0505300503
+还以 12.2912397395
+柴荣疏 13.2075304714
+天一阁 10.8561552143
+假面 10.4666904475
+花芽分化 13.900677652
+拉尔沙 13.2075304714
+岩壁 9.38981814546
+几站 12.2912397395
+还价 10.9049453784
+一级代理 12.1089181827
+还下 12.8020653633
+铰接 10.9562386728
+摊还 12.8020653633
+香港金融管理局 11.1926274509
+说长道短 11.5027823792
+骰子 10.1871055853
+听戏 10.0940151622
+利河 12.5143832909
+下大力气 10.5684731418
+新办 12.5143832909
+全方位 8.32094782599
+盖于 12.8020653633
+年金 9.01032852375
+活扣 13.900677652
+过夏 11.8212361103
+年里 9.10488710638
+送水工 11.7034530746
+听成 12.5143832909
+再作冯妇 12.5143832909
+盖亚 13.900677652
+盖些 13.900677652
+物理诊断 13.2075304714
+中短波 13.900677652
+利沙 12.2912397395
+延世泽 12.8020653633
+台门 13.2075304714
+长野县 12.5143832909
+柜上 10.0294766411
+第十颗 12.1089181827
+潮汐发电 12.1089181827
+思罗普 10.9049453784
+谢之 11.8212361103
+王崇简 11.0103058941
+尼莫萨恩 13.2075304714
+核磁共振 10.0088573539
+敢保 12.2912397395
+喜盈盈 13.2075304714
+武夷山 9.46986085313
+南征北讨 11.8212361103
+倒下 7.37711534583
+岳阳楼 10.9562386728
+寻声 11.3357282945
+邱会作 12.8020653633
+热血 9.30555780184
+欧贝德 11.9547675029
+冒泡排序 12.5143832909
+大摇大摆 10.2630914922
+表彰大会 11.0103058941
+科隆大教堂 13.900677652
+郭桓 12.1089181827
+方用保 12.8020653633
+谢丽 13.2075304714
+旗帜 7.96578345636
+成帝业 11.9547675029
+索隐派 13.2075304714
+浸出法 12.8020653633
+顺服 12.2912397395
+乙酰化 12.8020653633
+过失 9.04864738806
+红色风暴 12.5143832909
+母子公司 12.2912397395
+卡洛娃 13.2075304714
+严译 13.2075304714
+还乡 9.45802639549
+世界名著 13.2075304714
+无招胜 12.8020653633
+欲穷千里目 12.8020653633
+热衷 9.12155415886
+宗法观念 13.900677652
+掀起 7.38005652442
+拭干 11.8212361103
+谢东 12.8020653633
+上官周 12.2912397395
+推开 7.35964765279
+赵王遂 11.7034530746
+卡塔尼亚 12.2912397395
+心海 13.2075304714
+委用 11.3357282945
+佟佳氏 12.5143832909
+老仆 10.9049453784
+胡注表 12.5143832909
+五季 13.900677652
+相继 6.38860640614
+申城 12.2912397395
+清净无为 12.2912397395
+老仙 11.9547675029
+抄底 8.62767809341
+空气密度 11.2616203224
+三集 11.8212361103
+携同 13.2075304714
+贯穿 7.95003509939
+盟国 8.70772080109
+法制环境 13.2075304714
+建陵 12.8020653633
+若干座 12.8020653633
+蓄志 12.5143832909
+信誉 8.78268383956
+颜宗隽 12.2912397395
+萧宏 12.8020653633
+老任 13.900677652
+模式匹配 11.2616203224
+小花狗 11.8212361103
+分力 11.9547675029
+北至南 11.598092559
+乡镇级 12.8020653633
+蒙泰涅 13.900677652
+相约 9.59661255877
+老二 9.0884932966
+排空 10.1394775363
+前紧后松 13.900677652
+相纸 12.2912397395
+沈姑娘香 13.900677652
+相线 13.2075304714
+漏记 13.900677652
+马成群 13.2075304714
+地理系 11.3357282945
+费舍 12.8020653633
+着重描写 11.8212361103
+代办所 12.5143832909
+三难 13.900677652
+脚跟脚 13.2075304714
+无量 8.66423568915
+钟山 10.2897597393
+参政员 10.3453295905
+四十几天 13.2075304714
+寻址 11.598092559
+共产主义者 9.93038573842
+郓城 10.2371160058
+文思敏捷 12.5143832909
+分期偿付 13.2075304714
+不知利害 12.8020653633
+老人 6.36751884452
+物质交流 13.900677652
+甘性平 13.2075304714
+炎凉世态 13.900677652
+还愿 10.3743171274
+欺客 13.900677652
+当年度 11.7034530746
+预谋 9.75754292558
+一百零七余万两 13.2075304714
+格伯 12.8020653633
+阿宝 13.2075304714
+紫光 9.91169360541
+那神箭 13.900677652
+预调 13.2075304714
+白黎芦 13.900677652
+异途 13.2075304714
+假领 13.900677652
+探雷 12.8020653633
+老乔 13.900677652
+俱备 10.604840786
+岑巩 13.2075304714
+几画 13.900677652
+视线 7.96050639926
+猎头 10.8096351986
+丈八蛇矛 11.4157710022
+老乡 8.50705010562
+风流人物 10.8561552143
+魏王 9.63799777493
+岩土 10.2897597393
+大将风度 11.3357282945
+决策层 9.0884932966
+通俗性 13.2075304714
+维兰德 12.8020653633
+万余首 12.2912397395
+马纳尔 13.900677652
+紫兰 13.900677652
+魏玛 9.72629038208
+数桌 13.900677652
+绊马索 11.7034530746
+两万五千 11.8212361103
+项立刚 12.8020653633
+撼人心魄 11.8212361103
+百分之 10.3171587135
+不痛不痒 11.7034530746
+吴淞基 12.2912397395
+老丁 10.3743171274
+叶卡捷琳娜 10.3743171274
+三队 10.0505300503
+老三 9.58318953844
+老丈 11.0103058941
+老下 13.900677652
+老上 12.2912397395
+袜业 13.900677652
+矮墙 11.3357282945
+通过考察 12.8020653633
+练习本 12.8020653633
+未央宫 10.4349417492
+吐气扬眉 13.2075304714
+元善见 12.2912397395
+缩放 13.2075304714
+迪亚霍 13.900677652
+老严 12.8020653633
+有鬼 9.28555713513
+淝河 11.1280889297
+林凤娇 12.8020653633
+推倒 9.03314320152
+三阳 10.642581114
+老中 11.9547675029
+三阶 11.7034530746
+田地 8.23425096386
+新巧 11.7034530746
+旗儿 12.8020653633
+一二分钟 12.8020653633
+推出 5.68296924513
+大鱼河 13.900677652
+高架路 12.1089181827
+无邪 11.8212361103
+六万两 13.900677652
+练习曲 10.765183436
+阿拉伯糖 11.5027823792
+反侧 11.598092559
+分光镜 12.1089181827
+活泼 7.86759143018
+犁牛 13.900677652
+无弹性 12.2912397395
+捞油水 13.900677652
+排笔 13.2075304714
+年齿 12.5143832909
+某种意义 8.75901409547
+活法 10.9049453784
+庆城县 13.900677652
+显色指数 13.900677652
+达维久 12.8020653633
+更有甚者 10.1164880181
+宇宙志 13.2075304714
+褐布 13.900677652
+民族大义 11.9547675029
+精馏 11.3357282945
+活泉 13.900677652
+削面 12.8020653633
+氟气 13.900677652
+陈公博 10.8561552143
+原中法 13.2075304714
+钟嵘 11.0103058941
+龙勃罗 12.1089181827
+老例 12.8020653633
+信浓川 13.900677652
+听泉 12.8020653633
+蒸饺 13.2075304714
+几瓶 10.4666904475
+泥古不化 13.2075304714
+新居 9.94943393339
+广告业务 12.2912397395
+新屋 9.20932976975
+产销率 11.4157710022
+活化 9.26594866375
+孩提时代 12.8020653633
+新山 12.1089181827
+阿夫坦 13.900677652
+拜上帝会 11.0103058941
+无士族 13.900677652
+仇士良 11.5027823792
+折下来 12.5143832909
+泽当镇 12.5143832909
+停靠 9.46986085313
+付承发 13.2075304714
+护林 11.7034530746
+排筏 13.2075304714
+周静帝 12.1089181827
+就是 3.59817910774
+细故 11.598092559
+白彦花 12.5143832909
+首饰店 13.900677652
+萧娴 13.900677652
+求证 9.24671730182
+催化重整 11.7034530746
+三十九页 13.900677652
+郭昌 12.2912397395
+人心向背 11.2616203224
+费迪南 12.1089181827
+杜家寨 11.1280889297
+皮特尔 13.2075304714
+郭昕 13.900677652
+护板 11.0103058941
+准军事 10.4349417492
+老何 10.8561552143
+众生 9.08039608637
+推入 10.3743171274
+郭春 12.5143832909
+索取到 12.8020653633
+见报 10.0505300503
+蒸馏 8.96620371885
+蒸馍 10.0720362555
+塞尔帕 13.900677652
+椰岛 11.3357282945
+傻瓜 8.66956903512
+埃纳河 13.2075304714
+隆重开业 12.5143832909
+互惠协定 12.8020653633
+百分位 11.7034530746
+三面 8.11685246965
+小花猫 13.2075304714
+结伴同游 13.900677652
+乌桓降 12.5143832909
+持衡 13.900677652
+一投手 13.900677652
+活水 10.604840786
+批评界 13.900677652
+氧基 11.7034530746
+家家户户 9.37888907493
+预赛 11.598092559
+数学知识 10.9049453784
+山羊绒 13.2075304714
+抄录 9.98865464655
+间隔时间 10.4994802703
+翻跟斗 11.7034530746
+大埔县 12.2912397395
+高敞郡 13.2075304714
+新峰 13.2075304714
+曹参军 11.1280889297
+廖学秋 13.900677652
+少帅 11.8212361103
+活气 11.1280889297
+实践性 11.0103058941
+几千万两 13.2075304714
+蜂巢胃 13.900677652
+祝文 11.5027823792
+老伯 8.86372504956
+无道 9.66657114738
+耳针 11.9547675029
+无遗 10.2630914922
+慕容永 11.8212361103
+金井玉 13.2075304714
+俯念 13.900677652
+三灾六难 13.900677652
+梁先生 9.96885201925
+申时前 12.8020653633
+尚武精神 12.1089181827
+俯射 12.8020653633
+杀回马枪 11.9547675029
+钱仁康 13.2075304714
+城乡之间 10.7226238216
+新异 13.2075304714
+新开 9.38981814546
+磨边 13.2075304714
+尼西亚信 12.5143832909
+邮政代办 12.8020653633
+钟师 12.1089181827
+西侧 7.9526426628
+里斯丹 12.5143832909
+四国岛 11.9547675029
+新式 8.32472854883
+攀亲 11.598092559
+西凯罗 12.8020653633
+鄙意 12.2912397395
+奚落 9.69598503258
+石天 13.900677652
+旗号 8.52539924429
+雨云 11.3357282945
+林波波河 11.2616203224
+一个胎 13.2075304714
+获赦 12.1089181827
+郭新 13.900677652
+肾亏 10.8561552143
+张公洞 11.4157710022
+查收 12.5143832909
+三铢 12.8020653633
+每排 10.9562386728
+拭去 10.7226238216
+陆平原 13.2075304714
+女间谍 13.2075304714
+惊喜若狂 12.5143832909
+小双桥 13.900677652
+烯酮 12.8020653633
+赵灵时 13.2075304714
+潜台词 10.1630080337
+放冷枪 13.900677652
+锦县 11.8212361103
+甜面酱 12.2912397395
+三针 11.4157710022
+九嶷山 12.1089181827
+谢绪 13.900677652
+留职 13.900677652
+媚外 12.8020653633
+爱人如己 12.8020653633
+推力 8.5440913773
+吴家沟 12.5143832909
+密密的 9.85762638414
+有酒 10.8096351986
+抛光轮 13.900677652
+三钱 10.8561552143
+众目 11.8212361103
+精髓 9.30555780184
+亡国灭种 12.5143832909
+充氧 13.2075304714
+临漳县 11.8212361103
+决策空间 13.900677652
+刮板 11.7034530746
+过境 8.75318317516
+三钢 10.8561552143
+自然保护区 7.48721869481
+五十二万 12.5143832909
+领衔主演 13.900677652
+自我意识 10.3743171274
+新得 12.5143832909
+乌鲁木齐 8.23771717184
+法定人数 12.1089181827
+空军军官 11.598092559
+数来 11.1926274509
+西游记宫 13.900677652
+顾其耳 13.2075304714
+龙冠海 12.8020653633
+超前消费 12.2912397395
+品题 12.2912397395
+展性 12.8020653633
+前廊 11.8212361103
+庄户屯 13.900677652
+几眼 9.31571017331
+西传 10.8561552143
+马默里 12.8020653633
+对症下药 10.9049453784
+通信部 12.8020653633
+投资法 11.1280889297
+工矿业 9.91169360541
+笃信 9.84023464143
+不诉 13.900677652
+孙运璿 13.2075304714
+古典风格 11.8212361103
+领水 11.598092559
+潮汐能 10.4994802703
+不幸而言中 11.9547675029
+三鑫 10.642581114
+律师界 11.9547675029
+库施特 12.5143832909
+常抓不懈 11.7034530746
+田契根 13.2075304714
+杜伊斯堡 11.5027823792
+顾盼生情 13.2075304714
+特解 11.8212361103
+锦华 11.5027823792
+水渌渌 12.2912397395
+别具匠心 12.1089181827
+汉景帝 9.96885201925
+齐怀仲 11.4157710022
+双学位 13.900677652
+避恶 13.2075304714
+推到 8.18694484647
+作息制度 13.2075304714
+阵云 12.5143832909
+后旗 11.598092559
+配合起来 11.1926274509
+音体美 13.900677652
+大司农 10.533381822
+楚和晋 13.2075304714
+连随营 13.2075304714
+企望 11.1280889297
+徐诵 13.2075304714
+现成饭 13.900677652
+租税 9.30555780184
+西佗 11.8212361103
+郭敬 13.2075304714
+假髻 12.2912397395
+庞巴维 12.5143832909
+十二枚 13.900677652
+哑铃 10.4994802703
+拉封丹 11.7034530746
+黑白不分 13.2075304714
+太阴历 12.2912397395
+阵亡 8.58747167293
+昆仑奴 12.8020653633
+叶卡捷琳堡 11.2616203224
+易姓 12.5143832909
+国以民为本 13.900677652
+西人 11.0674643079
+较重者 11.8212361103
+桐柏山 10.2630914922
+新市 10.9049453784
+溥仪朝 13.900677652
+西京 9.12999302751
+宴会厅 11.0103058941
+炳灵 11.0103058941
+矮子 9.87532596124
+库财赋 13.2075304714
+线性电路 13.2075304714
+探长 13.2075304714
+小型货车 13.900677652
+乃尔 11.9547675029
+轴承 9.20019728618
+安重荣 12.5143832909
+仁意 13.900677652
+西亚 8.05135287203
+见性 12.1089181827
+西井 13.900677652
+见怪 9.5186510173
+三间 8.99540287354
+五方面 11.9547675029
+则否 11.9547675029
+推及 11.7034530746
+烯醇 11.4157710022
+现有人口 11.598092559
+不好死 13.900677652
+陆航团 11.8212361103
+护旗 13.2075304714
+华南城 11.3357282945
+洛水北 13.2075304714
+虾蛄 11.7034530746
+通话量 13.900677652
+寻味 13.2075304714
+刹车踏板 11.9547675029
+澄江如练 13.900677652
+阿特拉 12.5143832909
+竹帘画 13.2075304714
+两千八百门 13.900677652
+寻呼 11.9547675029
+利恩 11.7034530746
+每店 13.2075304714
+中介组织 12.2912397395
+曹仁部 13.2075304714
+利息 7.02958635737
+尽欢 11.2616203224
+新干 11.598092559
+新平 10.7226238216
+溢流孔 13.2075304714
+养娇 12.8020653633
+几盆 11.8212361103
+委靡不振 13.2075304714
+肾俞 11.9547675029
+矾土 13.900677652
+图形图像 12.5143832909
+每担 12.8020653633
+步长 12.5143832909
+蒙哥亦 12.8020653633
+几盒 11.1280889297
+推压 12.5143832909
+射程分布 13.900677652
+黄道周 9.55687223012
+夜郎王 11.598092559
+几盘 11.1926274509
+秦明 8.6803218269
+千利休 11.1280889297
+闲杂 10.8561552143
+通信量 12.8020653633
+推卸 9.66657114738
+就擒 11.5027823792
+双关 11.3357282945
+新店 10.1630080337
+血气胸 13.900677652
+不合理 7.72066099832
+探问 10.533381822
+世界日报 11.5027823792
+无微不至 10.604840786
+推却 10.2630914922
+西丰 11.5027823792
+申告 13.900677652
+鱼乐国 12.1089181827
+防卫性 13.900677652
+钟律 12.8020653633
+新庄 11.4157710022
+每户 9.35738286971
+不好比 13.2075304714
+山崩海啸 13.2075304714
+中华情 13.900677652
+教师应 12.2912397395
+沉寂 8.37522471284
+连汤带水 13.2075304714
+对来对去 13.900677652
+求解 8.41588071849
+性能比 11.2616203224
+指令性 10.9049453784
+灰份 13.900677652
+欲望都市 13.2075304714
+西下 11.3357282945
+西上 10.4994802703
+金积堡 12.2912397395
+护教 10.4666904475
+八字没一撇 12.2912397395
+优先方法 13.900677652
+伊娃 12.2912397395
+杨白冰 12.2912397395
+推升 8.85082164473
+西丁 13.2075304714
+申君 11.3357282945
+天福爷 10.8096351986
+含糊不清 10.4666904475
+弑父 13.2075304714
+钟志 13.2075304714
+妈祖 10.765183436
+顺次 11.1280889297
+辛敞 12.5143832909
+稳稳当当 11.1280889297
+奉为 9.69598503258
+一飞冲天 10.8096351986
+每批 11.4157710022
+扇风点火 12.8020653633
+哑门 12.8020653633
+糕干 13.900677652
+几百 8.64840422393
+康巴汉子 13.2075304714
+西乡 10.0720362555
+审判台 12.1089181827
+皮奈罗 12.8020653633
+吴有训 12.8020653633
+新建 7.05479777671
+斯劳 12.1089181827
+匆遽 11.2616203224
+见惯 11.0674643079
+西乐 13.2075304714
+哪种 8.84443184663
+明叔想 12.5143832909
+贸易中心 9.06439574502
+三锭 12.5143832909
+毛毛虫 11.598092559
+钨砂 13.900677652
+公定价格 13.900677652
+开封人 11.0674643079
+停闭 12.8020653633
+每打 11.598092559
+三锤 11.598092559
+全同粒子 12.1089181827
+杨坚谋 13.2075304714
+胆盐 11.8212361103
+啃下 12.1089181827
+撩起来 12.2912397395
+罗从彦 13.900677652
+图文并茂 11.9547675029
+云六州 12.8020653633
+寻医 12.5143832909
+伊庇鲁 11.9547675029
+罩壳 13.2075304714
+每斤 9.31571017331
+等位基因 10.6818018271
+中文网 9.80633308975
+闻窝阔 12.8020653633
+候通赤 13.900677652
+旧到 13.900677652
+荣亲王 13.900677652
+人中之龙 13.900677652
+帕里镇 12.2912397395
+病树 12.5143832909
+抽不出 10.7226238216
+活动 4.71207177215
+上杭县 11.2616203224
+热表 12.8020653633
+民都洛 11.8212361103
+避暑 9.27570483869
+制伏 10.8096351986
+派捐 13.900677652
+减量化 12.5143832909
+相竞 13.900677652
+新大 12.8020653633
+男女授受不亲 12.8020653633
+古塔波 12.8020653633
+新太 10.4349417492
+老人斑 12.8020653633
+新天 11.1926274509
+植入式 12.2912397395
+噎嗝 13.900677652
+文章内容 9.16447920358
+每旬 12.8020653633
+矮小 9.21854642485
+牙科诊所 12.8020653633
+每日 6.35001640887
+钟塔 11.9547675029
+醇类 11.0103058941
+女党员 13.2075304714
+矿体 9.49395840471
+完整性 9.40086798165
+载货车 11.3357282945
+蒸鱼 13.2075304714
+顺治 8.14810501315
+西阿卜 13.2075304714
+软件工具 11.8212361103
+顺河 11.1280889297
+槽糕 13.900677652
+和兵科 12.8020653633
+中短期 8.70772080109
+田福顺 13.2075304714
+文宣王 12.2912397395
+多万公里 11.9547675029
+一百二十五 11.9547675029
+倚音 13.900677652
+王霖 13.900677652
+萧心 13.2075304714
+斗方 11.9547675029
+一阵枪 12.8020653633
+重兵把守 11.3357282945
+有钱出钱 12.2912397395
+利权 10.642581114
+制作 6.5968344267
+省县 12.8020653633
+唐小岷 10.765183436
+吴淞区 12.2912397395
+中共七大 11.9547675029
+无锡 8.12612610643
+通用五菱 9.93038573842
+通信集 12.8020653633
+胡腾舞 13.2075304714
+阳平声 13.2075304714
+火膛 13.2075304714
+由人操纵 13.2075304714
+二氯甲烷 11.5027823792
+新妇 11.0674643079
+难以出口 12.5143832909
+展映 13.900677652
+变形杆菌 11.5027823792
+五指 9.93038573842
+伊玛目 10.2371160058
+于际训 12.2912397395
+中国社会科学院 8.25170341381
+护手 11.2616203224
+吴淞口 10.642581114
+丈量土地 11.5027823792
+烹调 8.84443184663
+印模石膏 13.900677652
+本地用户 13.900677652
+布道者 13.2075304714
+颍泉区 13.900677652
+型腔 12.5143832909
+洮河 10.2630914922
+陈墨香 13.2075304714
+东方人 10.604840786
+预行 12.5143832909
+终须 11.0674643079
+张着 8.99540287354
+山毛榉 10.642581114
+无边无沿 12.1089181827
+于宇 13.900677652
+都督 7.61467955747
+联动性 9.72629038208
+清净寂灭 13.900677652
+钟壁 13.900677652
+那五儿 12.5143832909
+响过 10.765183436
+抢白道 12.5143832909
+海德里希 12.8020653633
+热药 12.8020653633
+推向 8.41588071849
+袁绍亦 13.2075304714
+驰往 10.1630080337
+钟声 9.11318590919
+和歌山 12.5143832909
+审判厅 12.5143832909
+推后 11.2616203224
+摆子 11.9547675029
+排练 10.1394775363
+顺气 10.765183436
+王新俊 13.900677652
+与此相反 9.84023464143
+李永安 13.900677652
+顺民 10.1394775363
+兽医站 11.7034530746
+化敌为友 13.2075304714
+普希金 9.87532596124
+鹧鸪菜 12.8020653633
+不易控制 11.9547675029
+自然灾害 8.24468584116
+猪油果 13.2075304714
+展架 12.1089181827
+乔治亚 11.5027823792
+斯普林斯 12.8020653633
+无钱 10.0720362555
+盟友 9.35738286971
+二部曲 13.900677652
+利是 11.598092559
+电影明星 10.6818018271
+钮文忠 11.2616203224
+制为 11.2616203224
+拉斐特 11.1926274509
+薜萝 11.9547675029
+灰狗 13.2075304714
+声音笑貌 13.900677652
+元帝初 11.8212361103
+胆石 12.5143832909
+情报员 11.9547675029
+宁宗逾 12.8020653633
+举有 13.900677652
+扎赉诺尔 11.3357282945
+钟头 9.14708746087
+得意之笔 13.900677652
+胆矾 11.8212361103
+罗浮山 11.5027823792
+新堤 12.1089181827
+神机妙算 10.7226238216
+利昂 12.2912397395
+规定值 12.1089181827
+大大减少 9.53122979951
+四角号码 11.8212361103
+得人者昌 13.900677652
+利智 12.1089181827
+申办 9.66657114738
+预览 11.8212361103
+唐山镇 12.8020653633
+中外记者 11.5027823792
+荫凉 10.8561552143
+无偿献血者 13.900677652
+预见 8.48457724977
+价码儿 11.598092559
+总教练 11.3357282945
+徐大叔 10.2117981979
+阿拉伯国家联盟 11.5027823792
+工联 11.0674643079
+名誉博士 10.4666904475
+展柜 13.2075304714
+弄饭 12.8020653633
+聚酯纤维 12.1089181827
+欢天喜地 9.84023464143
+吕师囊 11.598092559
+黄铜 9.43476953332
+泥砂 11.4157710022
+虾肉 11.5027823792
+参政党 10.9049453784
+缉拿归案 13.2075304714
+大清建 13.900677652
+束带 10.9562386728
+泥砖 12.2912397395
+白彦虎 12.2912397395
+宣传性 12.5143832909
+宇宙学 10.0505300503
+民心者 12.8020653633
+口腔医学 11.9547675029
+镍氢 11.9547675029
+每常 11.5027823792
+新增 6.04668456475
+不停顿 11.7034530746
+打包带 12.2912397395
+内果皮 11.7034530746
+受赠人 11.9547675029
+济源市 10.9562386728
+热舞 13.2075304714
+苏亚雷斯 12.2912397395
+求进 11.8212361103
+卢思道 12.8020653633
+展期 10.4666904475
+剑门山 12.8020653633
+猫科动物 11.9547675029
+展望 7.75220935606
+修理所 13.900677652
+二十四五岁 12.1089181827
+顺流 10.3171587135
+外省人 11.8212361103
+郭户 11.598092559
+外部环境 8.99540287354
+法勒亚 11.8212361103
+老实巴脚 13.2075304714
+捉贼捉脏 13.900677652
+小混混 12.2912397395
+长远目标 11.0674643079
+俄通社 12.2912397395
+钓钓鱼 13.2075304714
+展板 12.2912397395
+正打 10.765183436
+王率兵 13.2075304714
+利曼 12.2912397395
+相符 8.48457724977
+阿道夫 10.9562386728
+沙哈鲁 12.2912397395
+旌德 12.8020653633
+制件 11.5027823792
+彩云飞 12.5143832909
+乔治乌 12.1089181827
+银行法 9.44633035572
+赶鸭子 13.2075304714
+五味斋 13.900677652
+活栓 12.5143832909
+活树 11.8212361103
+宜川县 13.2075304714
+门静脉 10.8096351986
+护持 10.0294766411
+岩前 12.8020653633
+太普通 12.5143832909
+运来了 11.4157710022
+高官厚禄 11.0103058941
+天燃气 12.1089181827
+玉凤拿 13.2075304714
+巴勒斯坦人 11.0674643079
+亲自参加 11.1280889297
+一长制 11.8212361103
+战果辉煌 12.8020653633
+眯着眼睛 10.2117981979
+展播 13.900677652
+授予 7.21731670621
+一会儿双行 13.900677652
+灰狼 12.5143832909
+远于 13.2075304714
+每架 11.2616203224
+预备役 8.91707103027
+十二条 11.3357282945
+串上 13.900677652
+十二平方米 12.2912397395
+上篇 11.9547675029
+远亲 10.4994802703
+几率 8.56313957227
+串串 10.6818018271
+木刻画 12.2912397395
+典章制度 9.32596667347
+四大行 8.60737282725
+过热器 13.2075304714
+三部 9.31571017331
+每枝 12.5143832909
+半斤八两 11.9547675029
+每枚 10.3171587135
+三碗不过冈 12.8020653633
+顺滑 11.0103058941
+不难看出 9.22784881751
+拉尔斯 11.7034530746
+码头工 13.900677652
+将功补过 11.598092559
+九峰山 11.5027823792
+匪夷所思 9.87532596124
+见效 9.48183704418
+曾宪九 13.2075304714
+雅江县 13.900677652
+扬程 11.598092559
+拉基斯 13.900677652
+抽气机 13.2075304714
+积极向上 10.7226238216
+响起 7.39938798144
+中波长 12.8020653633
+黄道光 11.7034530746
+见教 10.9049453784
+畦田 13.900677652
+相碰 11.0674643079
+三段论式 12.8020653633
+原统军 13.2075304714
+朱由检 11.5027823792
+活跃分子 11.7034530746
+顿足捶胸 13.2075304714
+保质保量 11.5027823792
+顺溜 11.0674643079
+新学 9.53122979951
+望志路 13.2075304714
+撕下 10.3743171274
+寻兄 12.2912397395
+诸祖耿 13.2075304714
+连干 12.5143832909
+太大意 11.4157710022
+授以 9.56994431169
+授业 11.4157710022
+刮掉 11.2616203224
+每本 12.8020653633
+冬令营 12.5143832909
+新定 11.598092559
+新官 11.0103058941
+戏剧化 10.4994802703
+野鸟 12.2912397395
+八行书 12.5143832909
+预言 7.89679058487
+新宁 8.51618258919
+三遍 10.0294766411
+玄奘自 12.8020653633
+利斯 10.2630914922
+吴家桥 13.2075304714
+贝尔茨 10.8096351986
+新安 9.34680076038
+拢岸 12.2912397395
+排粪 13.2075304714
+无需 8.06294720481
+德宗时 11.5027823792
+新家 10.3743171274
+每月 7.27395990273
+美国英特尔公司 13.900677652
+新宾 10.6818018271
+新宿 11.7034530746
+扩展性 12.8020653633
+干部政策 11.7034530746
+每期 9.74179456862
+新宠 10.6818018271
+岑寂 12.8020653633
+三遭 12.2912397395
+见方 9.53122979951
+败也萧何 11.598092559
+内卡河 13.2075304714
+源代码 13.2075304714
+利文 11.7034530746
+海角 9.7898037878
+近视眼 9.87532596124
+三通 9.98865464655
+叶杨 12.5143832909
+官尤持 12.8020653633
+围脖 12.5143832909
+非一日之寒 12.1089181827
+听歌 11.9547675029
+每条 9.15574552361
+此名 10.3453295905
+新密 10.3171587135
+氢氰酸 10.642581114
+郑伊健 12.2912397395
+恶习不改 13.2075304714
+疾步 10.5684731418
+新富 12.1089181827
+专家教授 11.8212361103
+第十八届 11.7034530746
+北京医院 10.9562386728
+授乳 13.2075304714
+第十八层 13.2075304714
+平地风雷 13.900677652
+赵高任 12.8020653633
+病根 10.1394775363
+宋荆襄 12.8020653633
+新寡 11.9547675029
+南投人 13.900677652
+悔罪 10.9562386728
+吴子宜 13.2075304714
+无非 7.45654639528
+物资流通 12.8020653633
+国成汉 13.2075304714
+掉过头去 12.5143832909
+王氏之 13.2075304714
+三金 9.96885201925
+新娘 8.65365357982
+李丽珍 11.9547675029
+救上来 11.598092559
+相移 12.2912397395
+台大学生 13.900677652
+韶关 9.82314020807
+半失业 11.7034530746
+三里 9.48183704418
+叶树 11.8212361103
+相称 9.26594866375
+分县 12.2912397395
+红黄色 12.8020653633
+热肠 12.1089181827
+村村落落 12.5143832909
+韶光 12.8020653633
+预订 8.68574189437
+六位数 12.5143832909
+预计 4.97216982766
+预设 9.69598503258
+弄鬼 11.3357282945
+年饭 11.9547675029
+由此 6.06707742831
+锦囊 10.1630080337
+俯头 12.2912397395
+排泄物 10.1394775363
+不体面 11.4157710022
+宣传战 13.900677652
+唐军征 13.2075304714
+盟军 8.5488195185
+热胀 12.5143832909
+游行示威 10.0294766411
+明儿个 10.9049453784
+无雨 10.4666904475
+手气 11.1926274509
+明天科技 11.5027823792
+证据学 13.900677652
+钟子 13.2075304714
+当一回事 10.2630914922
+相离 10.0294766411
+瞿府 12.8020653633
+刮打 13.900677652
+白凤鸣 12.2912397395
+冀中 9.72629038208
+锖色 12.8020653633
+陶庵梦 12.5143832909
+求败 12.8020653633
+白化病 13.900677652
+求购 11.598092559
+枯骨 11.0103058941
+求质 13.900677652
+岑威 13.2075304714
+钨粉 13.900677652
+朱迪丝 13.900677652
+流化床 10.8096351986
+掺进 11.3357282945
+热能 8.75318317516
+讲习会 12.2912397395
+勃雷 12.2912397395
+缪赛 13.2075304714
+诺贝尔文学奖 9.46986085313
+外务省 11.598092559
+围聚 11.598092559
+肯给 12.1089181827
+销毁 9.10488710638
+联合开发 10.6818018271
+决策学 12.5143832909
+咬一口 11.1926274509
+墙洞 11.3357282945
+串供 12.8020653633
+幸云曲 13.2075304714
+伊察 12.5143832909
+强扭的瓜不甜 11.8212361103
+矬子 12.1089181827
+多千米 8.78268383956
+耶律隆绪 11.1280889297
+放长线钓大鱼 11.8212361103
+书虫 13.900677652
+连太后 12.5143832909
+塔里木河 9.75754292558
+饧糖 13.900677652
+慈圣太后 12.5143832909
+罩子 11.1926274509
+龙泉市 11.7034530746
+金融工具 9.75754292558
+胆略 10.5684731418
+老人星 11.3357282945
+中文系 9.91169360541
+萧山 10.1394775363
+年首 11.5027823792
+四大洋 11.8212361103
+华南区 11.1926274509
+显灵 9.84023464143
+和谐社会 9.44633035572
+相关检查 13.2075304714
+董志塬 11.5027823792
+一饭之德 13.900677652
+含垢忍辱 13.900677652
+矮得 12.1089181827
+扼阻 13.900677652
+几片 9.44633035572
+系统启动 12.5143832909
+无际 10.642581114
+预警 7.92941581219
+几版 13.900677652
+后不见来者 13.900677652
+郭恩 13.2075304714
+筋腱 13.2075304714
+无限 7.0817535867
+趋向性 12.2912397395
+每晚 9.66657114738
+新人口论 13.2075304714
+昆仑山 8.19689517732
+若蒙恩 12.8020653633
+充分认识 9.20019728618
+一平二调 13.900677652
+杨公 12.5143832909
+胶着 10.1394775363
+回过头来 8.0484751722
+压制住 11.1926274509
+慈姑 11.7034530746
+那中堂 12.8020653633
+古猿 10.2371160058
+疾疫 11.4157710022
+老四 10.1630080337
+难解难分 10.9562386728
+云树之思 12.2912397395
+隧道窑 11.9547675029
+防堵 11.598092559
+冷却塔 11.9547675029
+国忠代 13.2075304714
+跃马扬鞭 13.2075304714
+青山羊 13.2075304714
+蒙哥嗣 12.8020653633
+黄鹤楼 10.1394775363
+闹猛 13.2075304714
+夏热冬 12.5143832909
+汤先生 11.4157710022
+灌排 11.0674643079
+梁廷芬 12.8020653633
+盖头 10.604840786
+空中客车公司 12.1089181827
+盲目投资 10.1630080337
+排戏 11.8212361103
+徐大人 12.1089181827
+斯鲁一世 12.8020653633
+环形山 10.533381822
+谋福利 11.1926274509
+照见 10.3171587135
+盖奇 11.4157710022
+魏武 11.9547675029
+矩阵的迹 13.900677652
+服务器进行 13.2075304714
+洛川 10.5684731418
+一阵发 11.4157710022
+侵略 7.21356904411
+各行各业 9.80633308975
+只手遮天 13.900677652
+狄交侵 13.2075304714
+侍许嘉 12.8020653633
+望花区 13.900677652
+阿拉伯文 9.74179456862
+发售量 13.2075304714
+穿上去 12.8020653633
+魏军见 13.2075304714
+每种 8.75901409547
+爱管闲事 11.3357282945
+无视 9.0884932966
+无规 10.8096351986
+寻佛 13.900677652
+巴格拉 13.2075304714
+睡床 12.5143832909
+无角 11.0674643079
+三身 11.9547675029
+申侯 11.7034530746
+下帖子 12.2912397395
+王忠悫 13.2075304714
+临睡前 10.642581114
+蒙特港 13.2075304714
+这时 5.21222385112
+鼓点儿 13.2075304714
+疾病 6.17534761406
+每科 12.5143832909
+马纳河 13.900677652
+倒头 9.69598503258
+则例 10.8096351986
+刑法典 11.7034530746
+目不暇接 10.8561552143
+刊授大学 13.900677652
+食肉动物 10.8561552143
+宋太宰 13.2075304714
+利箭 10.642581114
+还够 11.4157710022
+睡相 12.1089181827
+立于不败之地 10.2371160058
+有理数 10.533381822
+几派 13.2075304714
+入迷 10.4994802703
+补给线 11.1280889297
+杜富尔 13.900677652
+终成空 13.900677652
+蒸肉 13.900677652
+鼻酸 12.5143832909
+叮叮当当 10.7226238216
+四条线 13.2075304714
+精耕 13.2075304714
+多精入卵 13.900677652
+活畜 12.5143832909
+避税 9.71102290995
+冷却剂 11.0103058941
+宋太宗 9.34680076038
+行刑室 12.1089181827
+盟书 11.0103058941
+中短篇 11.598092559
+敬若神明 13.2075304714
+来养 12.1089181827
+正义凛然 12.8020653633
+惨跌 11.8212361103
+数十家 10.2630914922
+每票 12.2912397395
+异行 12.8020653633
+南宋 7.07413242842
+相映 10.4994802703
+两百多种 13.2075304714
+谢太 11.3357282945
+探身 10.4041700905
+墨子贵 12.8020653633
+鲁卜哈 12.1089181827
+座位数 12.5143832909
+活用 11.8212361103
+工业局 10.533381822
+图解法 11.9547675029
+中国烟草 11.9547675029
+挂羊头卖狗肉 11.4157710022
+南宗 11.0674643079
+干部素质 12.8020653633
+盟主 9.40086798165
+纠缠不清 11.0103058941
+大汶口 10.1164880181
+岩体 9.49395840471
+无花果 10.1164880181
+搞鬼 10.9049453784
+选择器 13.2075304714
+二零零八年 13.2075304714
+制发 11.5027823792
+申伯 11.598092559
+杨兄 12.8020653633
+制取 8.92394390956
+还好 7.78258045393
+西商 11.1280889297
+影评人 11.1280889297
+国尽忠 11.7034530746
+邓宝金 13.2075304714
+玉貌 12.2912397395
+波黑塞尔维亚共和国 13.900677652
+三进 10.5684731418
+掐架 12.8020653633
+布莱克本 11.3357282945
+威尼斯人 10.604840786
+邓军让 12.8020653633
+金芳 13.2075304714
+颜宗辅 12.1089181827
+活瓣 12.5143832909
+海西 9.29550746599
+护翼 12.5143832909
+防备 8.46259834305
+排挡 11.598092559
+品茗 10.8096351986
+总主教 11.5027823792
+冰川补给 12.5143832909
+淫邪 10.765183436
+地理学 8.10766404359
+基本演员 13.2075304714
+串儿 12.2912397395
+南定 11.598092559
+郭纵 13.2075304714
+申仪 11.598092559
+喜剧效果 12.2912397395
+无袖 10.8096351986
+利税 9.75754292558
+比较顺利 12.1089181827
+白布条 12.8020653633
+吉星高照 12.2912397395
+无名肿毒 13.2075304714
+申令 12.5143832909
+享清福 11.1280889297
+心跳 8.33233314821
+尽然 13.2075304714
+异见 12.1089181827
+卫侯 13.2075304714
+三辑 13.2075304714
+两瓢 13.2075304714
+咸干品 12.5143832909
+燕科 12.5143832909
+棉制 13.2075304714
+三辈 11.598092559
+坑口 10.1630080337
+唐王御 13.900677652
+蒸腾 9.71102290995
+地磁学 10.8096351986
+一部分瓦 13.2075304714
+芬兰共和国 13.900677652
+西哥 12.5143832909
+咨询机构 9.53122979951
+牌坊群 13.900677652
+实施 5.15698654143
+三边 9.74179456862
+制剂 8.71329184614
+黎莉莉 12.5143832909
+绅士派 13.2075304714
+三辰 12.5143832909
+每磅 10.4666904475
+一九九八年 12.5143832909
+停车 8.09554268306
+斯罗达 12.1089181827
+一身正气 12.2912397395
+扬斯基 12.1089181827
+停转 13.900677652
+敏锐 8.61747392324
+太空棉 13.900677652
+寻乌 12.8020653633
+寻亲 11.3357282945
+合肥工业大学 12.5143832909
+聚酰胺 9.91169360541
+资本性 12.2912397395
+画外音 13.2075304714
+完竣 13.900677652
+洛尔 10.642581114
+制动 8.61747392324
+寻人 10.4041700905
+西吴 13.900677652
+陪你到 12.8020653633
+便应 11.598092559
+跑不动 10.3453295905
+行走机构 13.2075304714
+天同寿 12.1089181827
+凝重 9.19114745066
+爆炸点 12.8020653633
+削过 13.900677652
+结合物 12.1089181827
+老坟 11.1926274509
+胥吏杜 13.2075304714
+三载 10.2117981979
+特殊任务 11.0103058941
+排排 10.4994802703
+陈尚书 13.2075304714
+相权 11.5027823792
+有色 6.98594675926
+离河 13.900677652
+洛尼 12.5143832909
+捉上来 13.2075304714
+听琴 11.3357282945
+岩上 11.3357282945
+西吉 12.1089181827
+三轮 9.72629038208
+干净利落 10.2897597393
+捅破 10.533381822
+就绪 9.13850371718
+三车 11.8212361103
+老圃 13.900677652
+自由泛滥 13.900677652
+相术 11.2616203224
+停运 10.8561552143
+无补 11.0674643079
+亲本 10.5684731418
+停进 12.8020653633
+相机 8.97342396682
+停过 11.0103058941
+钟铃 13.900677652
+西周 7.52395070408
+温颜 13.900677652
+大猫 11.7034530746
+申万 8.11993413618
+热梯度 12.8020653633
+老土 11.9547675029
+陈苑 13.2075304714
+申为 13.2075304714
+巨流 11.5027823792
+翻手为云 11.1280889297
+寻仙 11.8212361103
+无行 11.7034530746
+孔宇 13.900677652
+相望 8.53003962385
+吴觉迎 13.2075304714
+东方号 11.4157710022
+寻仇 11.9547675029
+小场地 13.900677652
+望江南 13.2075304714
+倒塌 8.43684584695
+排揎 12.2912397395
+鲁宾 10.7226238216
+唐老鸭 11.8212361103
+申严 13.2075304714
+许褚引 12.1089181827
+还守 12.2912397395
+灰坑 12.2912397395
+行车道 10.9049453784
+真诚相待 12.8020653633
+动员令 10.9562386728
+任国立 10.9049453784
+一长串 10.6818018271
+没好气 9.35738286971
+独辟蹊径 10.9049453784
+泥板 10.642581114
+硬环境 12.8020653633
+太漂亮 11.3357282945
+无论 6.33695798356
+无讹 13.900677652
+西垣 12.1089181827
+二万五千元 13.2075304714
+每箱 11.598092559
+庞统军 13.900677652
+赵匡赢 13.2075304714
+洛德 12.8020653633
+数十套 13.2075304714
+可叹 10.2897597393
+邓在军 13.900677652
+有致 10.1630080337
+注重质量 12.2912397395
+哑调 13.900677652
+周各庄 12.8020653633
+风镜 12.5143832909
+拉瑟福德 13.2075304714
+复种指数 10.1394775363
+弑母 13.2075304714
+西垂 13.2075304714
+光宗耀祖 11.0674643079
+吕歇尔 13.900677652
+拘禁 9.7898037878
+数十头 12.8020653633
+主动精神 12.5143832909
+谢客 11.7034530746
+精英 8.66423568915
+乘着 9.20932976975
+灰土 9.80633308975
+无语 9.14708746087
+盖子 8.69119149913
+授勋 12.8020653633
+谢家 9.84023464143
+尚健 12.1089181827
+安全级别 13.2075304714
+拼凑出 13.900677652
+数十天 12.8020653633
+噗通 10.765183436
+新海 10.604840786
+西域 7.43764819506
+无证 9.87532596124
+假色 13.900677652
+水力资源 7.97375162601
+每篇 11.5027823792
+谢安 10.2897597393
+骨鲠之臣 13.2075304714
+西城 8.73019365694
+肾囊 12.1089181827
+中国核学会 12.1089181827
+数十处 10.9562386728
+黎满庚 9.29550746599
+负压 10.604840786
+搭出 12.5143832909
+造谣诽谤 13.900677652
+天竺国 10.642581114
+谢定 13.900677652
+无话 8.84443184663
+从古到今 10.1630080337
+顷襄王 11.8212361103
+异言 13.2075304714
+傅司马孚 12.8020653633
+额布根 13.2075304714
+轻中度 12.2912397395
+凤英忙 12.5143832909
+一个顶 11.2616203224
+辅导教师 12.8020653633
+有腔 13.2075304714
+西地 12.5143832909
+制冰 12.8020653633
+葬身鱼腹 11.7034530746
+苏耽 13.2075304714
+制冷 9.34680076038
+勿念 13.900677652
+旰食宵衣 12.5143832909
+西土 11.5027823792
+阵图 11.7034530746
+议长论短 13.900677652
+远到 11.5027823792
+宗乾元 12.1089181827
+中西思想 13.2075304714
+老周 10.0940151622
+连乘积 12.5143832909
+霞光万道 12.5143832909
+胡志明市 10.8096351986
+活着 7.06980341733
+谢子 13.900677652
+精舍 10.7226238216
+一百个 9.22784881751
+客户资料 13.2075304714
+谢孝 13.900677652
+坑道战 12.2912397395
+预防 6.89398242514
+利禄 11.1280889297
+安全措施 10.6818018271
+有脚 11.9547675029
+电子地图 11.9547675029
+老吉 12.5143832909
+利华 11.7034530746
+逢集 11.598092559
+孙元良 12.2912397395
+突出重点 10.2630914922
+老向 10.3743171274
+新浪 7.68807155622
+英莲 11.9547675029
+老吕 10.0940151622
+西坪 12.2912397395
+腐败 7.48885938427
+够受的 12.8020653633
+制出 9.98865464655
+浓眉大眼 10.642581114
+西坡 9.45802639549
+老河口市 12.2912397395
+挂包 11.598092559
+有脸 12.1089181827
+西坝 11.9547675029
+数本 12.2912397395
+二十华里 12.2912397395
+老听 11.8212361103
+西坑 13.900677652
+款冬花 13.900677652
+见称 10.765183436
+迪亚贝 13.2075304714
+掌院学士 11.1280889297
+老吴 10.8096351986
+封韩信 13.900677652
+巷子口 11.5027823792
+载货量 12.8020653633
+咆哮 8.94485059437
+聆讯 10.2117981979
+笋衣 13.900677652
+得率 13.2075304714
+黄瑞纶 13.2075304714
+伯乐树 12.5143832909
+规模较 8.71329184614
+忿然 11.4157710022
+股关节 13.900677652
+金江义 12.5143832909
+一股脑儿 10.8561552143
+一百三十七卷 13.2075304714
+娄东 12.8020653633
+探起 12.8020653633
+边岸 12.8020653633
+开平市 13.900677652
+卜算子 12.8020653633
+掐断 11.0103058941
+塞卜泰 13.900677652
+亲自动手 10.1394775363
+绞尽 12.5143832909
+恩贾梅纳 11.9547675029
+异议 8.58747167293
+直道而行 13.900677652
+远去 8.69119149913
+瀛海威 12.8020653633
+参政会 9.89334446674
+犯罪者 11.1280889297
+常兴 12.5143832909
+三路 8.31718134319
+涣然冰释 13.900677652
+太沉重 11.4157710022
+评论员 9.07236391467
+佳木斯港 13.2075304714
+投资界 10.5684731418
+一百双 13.2075304714
+每端 13.2075304714
+动来动去 13.900677652
+墨守成 12.8020653633
+糊弄 10.0505300503
+三趟 11.8212361103
+疼人 13.2075304714
+授受 10.8096351986
+每章 11.598092559
+由省 9.69598503258
+薪资 10.9562386728
+西园 9.94943393339
+内旋转 11.3357282945
+电气系统 9.55687223012
+几滴 10.0505300503
+社区资源 12.8020653633
+避秦 13.2075304714
+避到 11.1926274509
+生活型 11.8212361103
+镜中 10.2897597393
+西四 10.9049453784
+醉鬼 11.1280889297
+制假 10.5684731418
+响遍 12.2912397395
+阵地 7.32699748502
+异说 11.2616203224
+组曲 10.2897597393
+远古 8.9102450652
+花梨雕 13.2075304714
+主母 11.8212361103
+每站 11.7034530746
+假药 10.4041700905
+制做 10.1164880181
+由威廉 12.8020653633
+相斗 10.5684731418
+异读 11.9547675029
+数十声 13.900677652
+凯平 9.34680076038
+于心 9.89334446674
+入场券 10.604840786
+仅供 9.28555713513
+相敬 11.8212361103
+展示 7.27395990273
+探路 9.63799777493
+萘磺酸 12.8020653633
+洛布 12.5143832909
+哈里曼 13.900677652
+千百万年 13.900677652
+自供状 13.900677652
+可知性 12.2912397395
+内布拉斯加 11.3357282945
+洛希 11.7034530746
+分占 12.2912397395
+无言 8.70218062071
+坑儒 13.2075304714
+很远 8.61241062128
+钩深致远 13.900677652
+防害 13.900677652
+方用宣 13.2075304714
+王氏勤 12.8020653633
+三起 11.4157710022
+赎命 12.8020653633
+前女友 11.598092559
+相救 9.14708746087
+系统配置 11.9547675029
+地雷阵 12.5143832909
+服务行业 9.63799777493
+安康市 11.8212361103
+撕去 11.1926274509
+近代文学 11.0674643079
+北仑河 12.8020653633
+找别扭 13.900677652
+普惠制 11.598092559
+自讨没趣 12.2912397395
+燕尾服 11.5027823792
+细羊毛 12.8020653633
+阵型 11.8212361103
+远华 13.900677652
+岂有此理 9.58318953844
+中共广东 11.8212361103
+张翼 9.54396882529
+轴突 10.4666904475
+七年之痒 13.900677652
+挨门挨户 12.2912397395
+不好玩 11.8212361103
+停跳 13.2075304714
+掉进来 13.900677652
+龙山文化 9.21854642485
+相攀 12.8020653633
+曹仁行 13.2075304714
+交通部门 10.4994802703
+射好 13.900677652
+年薪 9.7898037878
+危急存亡 12.5143832909
+串口 12.8020653633
+谢娜 13.900677652
+动员会 10.9049453784
+三贤 12.8020653633
+谛视 12.8020653633
+无趣 10.2897597393
+展线 13.2075304714
+走离 12.2912397395
+邵循正 12.2912397395
+远房亲戚 11.5027823792
+面授机宜 10.7226238216
+中华网 11.9547675029
+浪费者 13.900677652
+防尘 10.9049453784
+汉制汉 12.5143832909
+撕来 13.2075304714
+相拥 10.2117981979
+封晋王 11.598092559
+巨波 13.900677652
+建设成就 11.7034530746
+波月洞 11.5027823792
+尾管 11.9547675029
+俄罗斯博物馆 12.2912397395
+孔雀园 13.2075304714
+鲜卑语 12.5143832909
+西军 9.04086524761
+临汾市 11.5027823792
+几百几千 12.5143832909
+豪情万丈 11.598092559
+大事宣传 13.900677652
+马合答 12.8020653633
+仆仆风尘 13.2075304714
+十几年如一日 13.2075304714
+瑞贝卡 11.0674643079
+非智力 13.900677652
+抡棍 13.900677652
+溶胶 11.4157710022
+梅纳德 13.2075304714
+水族箱 12.2912397395
+无限忠诚 12.5143832909
+银行界 10.7226238216
+制造商 8.08059472162
+白丽娜 8.87023973058
+无路 9.35738286971
+相护 12.2912397395
+数十张 12.8020653633
+子囊菌类 13.900677652
+木古鲁 13.2075304714
+吸取经验 12.2912397395
+乔治城 13.2075304714
+马钦太 13.900677652
+舌灿莲花 12.8020653633
+相抵 10.0940151622
+伏尼契 12.8020653633
+官充馆 13.2075304714
+性伴侣 11.598092559
+还差 10.3453295905
+四重唱 13.900677652
+天竺僧 12.1089181827
+胡三省 11.7034530746
+马陆目 13.900677652
+占有优势 10.7226238216
+西凉 9.75754292558
+国难财 13.2075304714
+轴索 13.2075304714
+柔柔的 11.7034530746
+无责 11.7034530746
+虾饺 13.2075304714
+无货 11.5027823792
+预选 11.3357282945
+响鞭 12.2912397395
+相扣 12.5143832909
+流浪女 13.2075304714
+蒸蒸 12.8020653633
+相承 10.2371160058
+研讨 9.36807815882
+尼西亚公 12.2912397395
+新北界 13.2075304714
+淋菌 13.900677652
+纳瓦布 13.2075304714
+利群 11.9547675029
+体育项目 10.642581114
+于召陵 12.8020653633
+吴赤乌 12.5143832909
+全明星赛 12.1089181827
+恤民 12.2912397395
+求雨 10.642581114
+科布顿 12.8020653633
+吕克莱 13.2075304714
+遗憾终生 13.900677652
+喧嚣声 12.5143832909
+相托 10.8561552143
+哈布斯堡 9.7898037878
+洛夫 9.6811699468
+相打 11.7034530746
+相扑 10.3453295905
+蒙哥兴 12.8020653633
+拱让 12.8020653633
+百分制 12.2912397395
+两线 9.87532596124
+高效率 9.34680076038
+研读 9.94943393339
+就算 6.59750760074
+褐藻门 11.0674643079
+西兴 11.1926274509
+西关 9.84023464143
+夕阳 8.62767809341
+西兰 10.765183436
+撕咬 10.533381822
+圆鼓鼓 11.5027823792
+洛奇 11.7034530746
+体循环 11.5027823792
+响音 13.900677652
+兴师问罪 10.9562386728
+老刘 9.80633308975
+年节 9.94943393339
+盖州 10.4041700905
+一下肚子 13.900677652
+尿嘧啶 12.2912397395
+灰冷 12.8020653633
+授命 11.3357282945
+由点 13.900677652
+投机钻营者 12.8020653633
+叶附生 12.8020653633
+猫眼草 13.900677652
+老到 10.7226238216
+切勿 9.12999302751
+刮目相看 9.53122979951
+无赖 9.19114745066
+明三礼 13.2075304714
+补给站 11.8212361103
+低三下四 10.5684731418
+相成 11.8212361103
+勃起 9.25628675283
+东信 9.49395840471
+肯尼亚非洲民族联盟 12.8020653633
+月见草 12.1089181827
+弄脏 11.0103058941
+圣弗朗西斯 13.900677652
+数十年 8.55357012126
+寻查 13.900677652
+对顶角 13.900677652
+官至兵 12.2912397395
+老友 10.0505300503
+无人能敌 13.2075304714
+出手不凡 11.1926274509
+盖尔 10.5684731418
+老叔 10.765183436
+三证 13.900677652
+进攻方 13.900677652
+字斟句酌 10.2630914922
+苦土 13.2075304714
+刮研 13.900677652
+奇花异卉 12.1089181827
+老叟 11.8212361103
+融汇 9.89334446674
+液冷 11.7034530746
+求靠 13.900677652
+济济 11.5027823792
+异趣 11.8212361103
+魏清 13.2075304714
+承包者 12.8020653633
+莫斯特 11.3357282945
+职工工资 10.9562386728
+二期工程 9.89334446674
+吴叔 13.2075304714
+哪有 7.80260336981
+老叶 11.0103058941
+可压缩 11.1280889297
+鱼肚白 12.1089181827
+融江 11.7034530746
+掐掉 11.9547675029
+刮破 11.9547675029
+每粒 11.9547675029
+修理站 13.2075304714
+展翼 13.2075304714
+盖层 10.0294766411
+老厂 10.7226238216
+桂林市政府 13.900677652
+蝉蜕 11.3357282945
+相接 8.12923652885
+宋太平 10.9049453784
+郭坦 13.2075304714
+原明亮 10.0088573539
+一百卷 11.0674643079
+几棵 9.46986085313
+哪来 9.13850371718
+连得 10.0940151622
+松质骨 13.2075304714
+掌刑政 13.2075304714
+南召 10.9562386728
+子列成 13.900677652
+三记 12.5143832909
+三讲 12.2912397395
+稳获 11.8212361103
+惊心动魄 8.74162235276
+生利息 13.2075304714
+盖山 11.9547675029
+申包胥 11.2616203224
+齐献公 12.2912397395
+展翅 9.85762638414
+水力效率 13.900677652
+黄发紫 13.900677652
+踺子 12.8020653633
+缴公粮 13.2075304714
+战死沙场 10.533381822
+韶山冲 11.7034530746
+排架 11.8212361103
+人均 7.45495783259
+犬牙交错 11.1926274509
+探询 10.1630080337
+几株 9.80633308975
+利纳 13.2075304714
+还射 13.900677652
+收款人 11.2616203224
+通信连 12.1089181827
+腰杆子 11.4157710022
+几样 8.87679713113
+一百二十个 11.8212361103
+工致 11.1926274509
+活火 12.8020653633
+造纸工业 9.82314020807
+和敏敏 10.3743171274
+几根 8.75318317516
+排枪 12.8020653633
+连克灵 13.2075304714
+李伯芬 12.8020653633
+陈英 13.900677652
+倒想 13.2075304714
+轴系 11.598092559
+几栋 11.2616203224
+成批生产 10.642581114
+异质 11.4157710022
+展缓 13.2075304714
+马塞卢 12.2912397395
+硝基苯 10.765183436
+疑心 8.30596627237
+坐以待毙 10.7226238216
+掐指 11.4157710022
+拉金德拉 12.5143832909
+正逢 10.0940151622
+榛子 10.1630080337
+钙调素 12.8020653633
+疑忌 10.0088573539
+魏源 10.1871055853
+梳妆打扮 11.2616203224
+内部化 12.5143832909
+营业执照 9.49395840471
+老包 12.1089181827
+震主之威 13.2075304714
+洛塔 12.2912397395
+护符 12.2912397395
+雅柯 12.5143832909
+几桩 11.5027823792
+探讨 7.1060910711
+利维 11.9547675029
+主题词表 12.1089181827
+蜀魏 13.900677652
+排查 8.98802276624
+响雷 11.4157710022
+每类 10.7226238216
+巴尔干地区 11.7034530746
+数十座 10.9562386728
+脑死 13.900677652
+血统论 11.9547675029
+探访 9.98865464655
+每米 11.5027823792
+阿加德兹 13.2075304714
+制图 9.35738286971
+坑坑 12.1089181827
+党世英 12.5143832909
+防己 11.1280889297
+停课 10.604840786
+几案 10.1871055853
+请客吃饭 10.8096351986
+豌豆粉 13.2075304714
+弄臣 11.9547675029
+几桌 11.0103058941
+八三年 13.900677652
+西偏 10.9049453784
+万绿 12.8020653633
+叶城至 13.2075304714
+投资率 10.9562386728
+绥宁县 13.900677652
+老区 9.77354326693
+糖用甜菜 13.2075304714
+云里雾里 11.2616203224
+弄舌 13.900677652
+西去 9.36807815882
+秦民 11.7034530746
+英语课 11.1926274509
+还往 10.8096351986
+伯里克 10.9049453784
+扬手 9.80633308975
+制售 10.8561552143
+液力 10.604840786
+阵前 8.66423568915
+火候未到 12.8020653633
+作崇 13.900677652
+谢忱 12.5143832909
+马尾藻 10.8561552143
+几段 9.80633308975
+顺直 10.3171587135
+慈心 11.9547675029
+这三只 10.0088573539
+西厢 10.2117981979
+东方君 12.5143832909
+西原 11.2616203224
+没精打彩 12.2912397395
+大藏经 10.2371160058
+倒得 13.900677652
+老僧 9.93038573842
+可也没有 11.9547675029
+第六家 13.900677652
+扬扬 11.1280889297
+金属薄板 13.900677652
+置于死地而后生 13.2075304714
+推介 8.29487558568
+大笑话 11.7034530746
+很多很多 10.4666904475
+相惜 13.2075304714
+贤妻良母 11.598092559
+科普特人 12.2912397395
+西厂 10.8561552143
+无辜 8.52078029844
+难以自拔 11.7034530746
+推人 12.8020653633
+倒念 12.8020653633
+巴勒斯坦国 11.3357282945
+灰化 11.9547675029
+康布雷 12.8020653633
+内转换 12.5143832909
+放冷箭 11.1926274509
+阵列 10.2630914922
+或电子邮件 13.2075304714
+郭秉 13.2075304714
+丝都 13.900677652
+性兴奋 10.8561552143
+欠息 13.900677652
+市场学 13.2075304714
+圣胡安 11.0674643079
+谢德 12.5143832909
+田耕莘 13.2075304714
+怀有敌意 11.8212361103
+式样 8.44963919841
+西口 10.9049453784
+年老 8.62256299275
+企管 13.2075304714
+无过 10.8561552143
+不见得 8.70218062071
+洛水之 12.2912397395
+宝常亦 13.2075304714
+宾福德 13.2075304714
+极权 11.5027823792
+倒忙 12.1089181827
+倒地不起 13.2075304714
+推事 12.2912397395
+尽瘁 12.1089181827
+几比 13.2075304714
+科幻影片 13.900677652
+封开平 12.8020653633
+原型机 9.41204128224
+推了 8.9308643524
+活泼大方 13.900677652
+色即是空 12.2912397395
+一百匹 11.7034530746
+几次 6.51917575747
+西医 9.43476953332
+誊写 10.6818018271
+马真塔 13.900677652
+克里雅 11.8212361103
+赤卫队 10.9562386728
+几千万元 10.765183436
+三街 13.900677652
+上丹根 12.8020653633
+几欲 11.0674643079
+胆汁 9.59661255877
+凝集 11.4157710022
+三行 9.01787572939
+沃兹涅 12.8020653633
+盖得 10.4994802703
+二十页 12.8020653633
+裙带 11.0674643079
+几款 10.642581114
+南京五台山体育馆 13.2075304714
+拈花惹草 11.3357282945
+投资热 11.2616203224
+口说 11.2616203224
+相恋 10.6818018271
+老健 8.96620371885
+西北 5.90032815665
+西化 11.9547675029
+两情相悦 11.5027823792
+马国雄 10.5684731418
+骂架 13.900677652
+还弹 13.900677652
+许配给 10.7226238216
+盖德 11.8212361103
+东林派 10.2371160058
+疗养所 12.2912397395
+推为 9.31571017331
+老白干 10.4666904475
+胆气 9.87532596124
+倒影 10.0940151622
+几步 7.35245854921
+磁记录器 13.2075304714
+去不去 9.94943393339
+无轨 12.8020653633
+定影液 12.8020653633
+老倌 11.3357282945
+侨眷 10.3171587135
+笃厚 12.8020653633
+精虫 13.2075304714
+液剂 12.8020653633
+活猪 12.5143832909
+品蓝 13.900677652
+桃仁 10.533381822
+西卡 11.598092559
+郭祥 6.50987913024
+蒸蛋 12.8020653633
+菜粉蝶 13.900677652
+国务院扶贫办 13.900677652
+热饭 11.1926274509
+西单 10.8096351986
+相态 12.2912397395
+汤婆子 13.900677652
+用旧 11.5027823792
+西华 9.40086798165
+谢弗 13.900677652
+洛学 12.5143832909
+相怜 12.5143832909
+相思 9.33632946051
+济源 9.35738286971
+极力回避 13.2075304714
+庄园主 10.4666904475
+伊比比奥 12.8020653633
+阿炳拍 13.2075304714
+开封县 11.2616203224
+孟加拉湾 9.71102290995
+固体燃料 10.6818018271
+唐努乌梁 12.1089181827
+竹纸 12.8020653633
+阿普顿 13.900677652
+于岩 13.900677652
+圣淘沙 12.5143832909
+三角 8.00627481771
+凝静 13.2075304714
+仡佬 10.4041700905
+描绘出来 11.9547675029
+见机而作 11.8212361103
+核武器化 13.900677652
+如影随形 10.3743171274
+三观 11.9547675029
+睡姿 11.3357282945
+雇佣劳动 9.19114745066
+魏氏 11.7034530746
+倒底 11.1280889297
+波士顿 9.0884932966
+护秋 13.900677652
+音乐文件 13.900677652
+工业家 10.8561552143
+防弹 10.1871055853
+串场 12.5143832909
+鱼藤酮 11.9547675029
+行波管 12.1089181827
+撕坏 12.5143832909
+仅举 13.2075304714
+拱路 13.900677652
+倒序 13.900677652
+盖帽 11.4157710022
+倒床 13.900677652
+牛羊或 13.2075304714
+眉端 13.900677652
+万绿丛中 11.9547675029
+四围 10.3453295905
+数十尺 12.1089181827
+慷慨悲歌 11.3357282945
+法尔科内 12.8020653633
+象泉河 11.8212361103
+第四道 11.2616203224
+拖出去 11.5027823792
+紫云 10.9562386728
+巴彦图 12.8020653633
+灰分 10.0294766411
+声价十倍 12.5143832909
+令人费解 10.0720362555
+小发明 13.900677652
+热食 11.9547675029
+细帐 13.2075304714
+老农 10.4349417492
+哪敢 9.89334446674
+张皇 11.3357282945
+溜下来 10.8096351986
+托古讽今 12.5143832909
+惯性力 10.4041700905
+每组 10.2630914922
+束世 13.2075304714
+公共频道 13.2075304714
+法尧禅 13.2075304714
+伏龙芝军事学院 11.5027823792
+盖平 12.5143832909
+瑕瑜互见 13.2075304714
+通信费 12.5143832909
+短少 10.8561552143
+数十尊 12.1089181827
+何名目 12.8020653633
+旗人 9.54396882529
+香坛 13.900677652
+石油换 11.8212361103
+还师 11.1280889297
+防得 12.1089181827
+魏延来 13.2075304714
+老兄 8.27666014579
+马塞克 13.900677652
+东宽西 12.5143832909
+无踪 10.1630080337
+工矿区 9.85762638414
+阵发 13.2075304714
+装不下 10.9562386728
+西到 9.98865464655
+排斥 7.87965430263
+倒带 12.8020653633
+西利 12.1089181827
+来人支票 13.900677652
+周昌 12.5143832909
+活物 10.2371160058
+阿拉杰 13.900677652
+脚后跟 9.98865464655
+上下学 11.5027823792
+与民争利 11.2616203224
+探视 9.29550746599
+倒帐 13.900677652
+阴盛阳 13.2075304714
+三西 12.8020653633
+还席 11.9547675029
+当牛做马 12.2912397395
+老六 12.2912397395
+排料 13.900677652
+老共 12.5143832909
+谢幕 10.0505300503
+还常 9.7898037878
+老兵 9.02548032877
+防御 6.87513933734
+乱糟糟 9.58318953844
+从小孔 11.9547675029
+持股会 10.7226238216
+支配权 10.1394775363
+第四十三 11.8212361103
+心同此理 13.2075304714
+血脂高 12.8020653633
+台湾同胞 10.3743171274
+推估 13.2075304714
+活动舞台 13.2075304714
+旗下 6.14533883913
+音容 11.4157710022
+乔伊斯 11.7034530746
+新江 13.2075304714
+顺眼 9.59661255877
+中国道教协会 11.9547675029
+娇滴滴 10.4666904475
+余干县 12.5143832909
+无愧于 10.9562386728
+白马王子 11.7034530746
+老美 11.5027823792
+犁沟 10.9049453784
+制品 7.6604018068
+那香菱 12.8020653633
+房地局 13.900677652
+响铃 12.1089181827
+阳羡词 12.8020653633
+都江 13.900677652
+法绍达 12.5143832909
+总总 13.2075304714
+先遣队 10.6818018271
+爆炸式 10.9049453784
+分光计 12.5143832909
+施平礼 13.2075304714
+还平 13.900677652
+盖建 13.900677652
+银碟 12.1089181827
+脑栓塞 12.1089181827
+老儿 9.24671730182
+护目 13.900677652
+五千万 11.5027823792
+俯下 9.74179456862
+遭人算计 13.900677652
+几斤 10.0294766411
+数十卷 13.2075304714
+卢照邻 11.598092559
+四千户 12.1089181827
+耶律谷 13.2075304714
+政治舞台 10.2897597393
+有诈 9.98865464655
+承包费 11.2616203224
+经线 10.0088573539
+后子头 12.1089181827
+四重奏 10.1630080337
+滑头滑脑 13.900677652
+几方 11.598092559
+石家庄市 9.94943393339
+潘氏 13.2075304714
+晓之以理 11.1280889297
+李孝逸 12.2912397395
+几文 11.9547675029
+斗架 12.5143832909
+齐福霖 10.3171587135
+文格勒 12.2912397395
+泥浆 9.59661255877
+泥流 11.1280889297
+征收率 11.9547675029
+法里斯 13.900677652
+护盘 8.83808261895
+封堵器 12.8020653633
+还冲 13.900677652
+官皆乐 12.8020653633
+盖儿 11.5027823792
+鹬鸵 13.900677652
+铝加工 12.1089181827
+老庄 9.98865464655
+管理体制 8.94485059437
+几日 7.96050639926
+庄户人 12.2912397395
+牵索 13.900677652
+太古宇 12.2912397395
+盖克 12.5143832909
+小花招 12.5143832909
+倒出 10.9049453784
+熊成基 13.2075304714
+太古宙 11.1280889297
+老店 10.2630914922
+麦拉 13.900677652
+半死不活 10.2897597393
+西工 12.2912397395
+死猪不怕开水烫 12.5143832909
+相溶 11.7034530746
+工业品 8.26588804881
+西州 9.59661255877
+西川 9.24671730182
+宣传画 10.9562386728
+天花乱坠 10.3453295905
+吴梅村 13.900677652
+明里暗里 11.598092559
+叶雪安 13.2075304714
+刚回去 13.900677652
+前尘 13.900677652
+还出 11.0674643079
+还击 9.58318953844
+扬水 11.7034530746
+老康 11.4157710022
+抄件 11.2616203224
+异能 11.8212361103
+精装 10.7226238216
+赵王迁 11.598092559
+上档次 11.0674643079
+数十台 13.900677652
+未得 9.45802639549
+抄上 12.5143832909
+抄下 11.3357282945
+过乾清 11.9547675029
+鞭炮声 9.7898037878
+诸葛靓 12.5143832909
+制宪 10.0088573539
+几支 9.37888907493
+子络合 12.5143832909
+六十余年 12.5143832909
+数十口 12.8020653633
+数十句 13.900677652
+数十只 10.3453295905
+铺下 10.9562386728
+细木工板 12.5143832909
+提高素质 12.1089181827
+意气用事 10.6818018271
+地理制图 13.900677652
+阿拉伯海 9.82314020807
+黄原揽 12.5143832909
+中编办 12.2912397395
+谢克 13.2075304714
+培优 11.4157710022
+无脑 13.2075304714
+王祯农 12.2912397395
+贰仟 12.2912397395
+纳采问 13.900677652
+无脚 13.2075304714
+制定 5.92133875671
+泥淖 11.0674643079
+傅里叶 9.71102290995
+老幼 9.77354326693
+利率 5.80051620504
+鉴定室 13.900677652
+老布 10.8096351986
+老帅 11.5027823792
+老师 6.3734217326
+足总杯 13.900677652
+相依 9.94943393339
+老帐 12.8020653633
+假装 8.64840422393
+刘秀乃 13.2075304714
+六世纪 12.2912397395
+制导 8.20358416547
+免疫监视 12.5143832909
+倒八 13.2075304714
+宋为河 13.2075304714
+五百零三部 13.2075304714
+抄书 11.9547675029
+西建楼 13.2075304714
+刮痧 11.598092559
+袜带 13.900677652
+察布查尔 11.8212361103
+普代克 12.2912397395
+无腔 13.900677652
+石油气 10.3453295905
+精血 10.765183436
+还关 11.5027823792
+酶原 12.5143832909
+免费视听 13.900677652
+还具 12.8020653633
+俯仰 9.36807815882
+俯伏 9.53122979951
+宇宙服 13.2075304714
+坑害 10.5684731418
+护短 10.8561552143
+利爽 13.900677652
+数字模拟 12.5143832909
+西岸 7.59440236503
+赏罚严明 12.2912397395
+醉酒 9.62401153296
+西岳 11.9547675029
+展现 8.0600359946
+刘义恭 13.2075304714
+扩张剂 11.7034530746
+都护 9.37888907493
+西岭 11.7034530746
+利爪 10.3743171274
+无广告 13.900677652
+偷东西 10.3743171274
+石破天惊 10.4041700905
+滑稽可笑 11.598092559
+方便群众 12.2912397395
+风里来雨里去 12.1089181827
+哪次 11.1926274509
+济慈 11.7034530746
+精心策划 10.8561552143
+交战国 10.0505300503
+投资网 13.2075304714
+西岛 11.9547675029
+年轻 6.10338637843
+忠诚可靠 12.2912397395
+西岗 12.5143832909
+相激 11.9547675029
+展区 10.3743171274
+一九八八年 13.2075304714
+窄道 13.900677652
+年轮 10.4041700905
+科学研究部 13.2075304714
+锑化铟 12.2912397395
+同系物 11.0103058941
+精要 10.9049453784
+芬尼 11.2616203224
+击弦机 13.900677652
+德国政府 9.93038573842
+哈勒欣 12.5143832909
+利特 11.598092559
+型钢 12.5143832909
+窝洞 11.8212361103
+响马 9.72629038208
+灰尘 8.3555002075
+斯坦伯格 13.2075304714
+金吾秩 12.8020653633
+西峰 11.0103058941
+利物 11.4157710022
+老徐 9.46986085313
+挺胸凸肚 13.2075304714
+老得 10.7226238216
+河面 9.56994431169
+由密钥 13.2075304714
+护坡 11.598092559
+浸出物 11.4157710022
+西峡 11.2616203224
+无能 8.45825994145
+利牙 13.2075304714
+晚霜 12.1089181827
+东方学 10.8561552143
+公倍数 13.900677652
+带回去 9.41204128224
+玄武湖 11.4157710022
+别介意 12.8020653633
+阿拉伯河 11.9547675029
+数十刀 13.900677652
+腐蚀 8.29120585679
+韦为彭 13.2075304714
+诉称 12.5143832909
+脱氧鸟苷 13.900677652
+内心深处 9.13850371718
+载沉载浮 12.5143832909
+西尼 10.765183436
+糕点 9.44633035572
+六月天 13.900677652
+艺高人胆大 11.598092559
+无法访问 13.900677652
+课本上 11.9547675029
+阿普雷 13.900677652
+年运 13.900677652
+年近 10.0720362555
+远处 7.19994654243
+柯郡 11.5027823792
+年迈 9.62401153296
+无耻 8.75318317516
+协调会议 11.8212361103
+判处死刑 9.53122979951
+衬衣 9.40086798165
+和兵民 12.8020653633
+寄愁 13.900677652
+防冷 13.900677652
+蒙特柳 12.5143832909
+西尔 11.7034530746
+老彭 11.9547675029
+奥克洛 12.1089181827
+陈徐陵 12.8020653633
+防冻 11.0103058941
+通经活络 12.8020653633
+客户资源 9.89334446674
+开关厂 12.8020653633
+泥泞 9.24671730182
+周立三 13.2075304714
+还值 11.4157710022
+见状 8.90346537821
+阿奇木伯克 11.0103058941
+几千万年 11.598092559
+热阻 12.1089181827
+远天 12.1089181827
+烹饪 9.41204128224
+品评 9.6811699468
+新河 9.65218240993
+扩张力 13.2075304714
+华盛顿大学 10.8096351986
+异腈 13.2075304714
+老式 8.93783302172
+九十九年 11.3357282945
+醉醉 13.900677652
+泥沼 10.4349417492
+护眼 11.1280889297
+寄语 10.765183436
+年辈 13.2075304714
+多少级 13.2075304714
+防凌 11.2616203224
+亿美元 5.80782662444
+升级版 11.0674643079
+老弟 8.4980002701
+排比 10.4994802703
+老张 9.0884932966
+排毒 9.01787572939
+马小跳 13.900677652
+天命攸归 11.7034530746
+中华人民共和国文化部 13.2075304714
+与生俱来 9.75754292558
+无职 11.598092559
+母仪之 13.900677652
+老弱 9.20932976975
+壶口瀑布 11.4157710022
+泥沙 7.78699547214
+众数 11.9547675029
+国际私法 10.2117981979
+品读 13.900677652
+灰岩 8.86372504956
+几摞 12.8020653633
+泥潭 9.89334446674
+吕克贝 13.2075304714
+留得青山在 11.1280889297
+业务员 10.0940151622
+裂变化学 12.1089181827
+数十具 12.5143832909
+西德 9.61021821083
+烘干机 12.8020653633
+康广仁 12.1089181827
+美神 13.2075304714
+张景惠 12.1089181827
+鼓点子 13.900677652
+几架 10.3171587135
+还原 7.80485308954
+假言 11.5027823792
+何颜见 13.2075304714
+鸣鼓而攻之 13.900677652
+无限量 11.9547675029
+金身 10.3453295905
+防制 11.8212361103
+决非 9.66657114738
+制备 8.11993413618
+明智光秀 13.2075304714
+新传 11.598092559
+有解 11.3357282945
+博士论文 10.4041700905
+倒挂金钩 13.2075304714
+西征 8.71329184614
+帝宠 12.8020653633
+新体 10.9049453784
+每班 11.0674643079
+搁下来 13.900677652
+倒台 9.85762638414
+歌剧 8.31342899358
+新余 11.1926274509
+泥漠 13.900677652
+新作 9.91169360541
+显爵 13.900677652
+铝锅 11.9547675029
+游行示众 13.2075304714
+还变 11.598092559
+松些 13.900677652
+相沿 10.3171587135
+排档 12.2912397395
+盖博 12.5143832909
+还发 11.8212361103
+新低 8.25877058104
+还受 10.2630914922
+工业国 9.85762638414
+皇马 11.2616203224
+六十余岁 13.900677652
+爆炸力 11.5027823792
+修静 13.900677652
+洛基 13.2075304714
+腮红 12.8020653633
+钟乳 10.6818018271
+倒叙 11.7034530746
+无菌 10.0505300503
+年谱 9.87532596124
+盖印 11.7034530746
+工业园 9.7898037878
+卧不安枕 13.900677652
+广结善缘 13.900677652
+铝锭 10.9562386728
+熊耳山 10.533381822
+铁皮柜 13.2075304714
+热闹 7.1049718768
+田氏代 12.2912397395
+好几道 11.5027823792
+热锅 10.6818018271
+远祖 10.533381822
+薛兰守 13.2075304714
+热销 8.32094782599
+大户人家 9.4233408375
+闹病 11.8212361103
+老屋 11.0103058941
+说情者 12.8020653633
+几本 10.0720362555
+诅骂 12.8020653633
+灰心 9.65218240993
+羞臊 13.2075304714
+朱瑞巷 13.2075304714
+几朵 10.4349417492
+众星 11.598092559
+活罪 11.598092559
+出差错 10.9049453784
+笃志 12.8020653633
+白求恩医科大学 13.2075304714
+代办点 13.2075304714
+勐仑 12.8020653633
+高宗许 12.8020653633
+相求 11.0103058941
+几月 10.5684731418
+摩根士丹利 8.06294720481
+相汇 10.4041700905
+几服 12.8020653633
+一个遍 12.1089181827
+无担保 10.2117981979
+钟亭 12.2912397395
+防务 8.22392384971
+火烧火燎 10.8096351986
+杨柳依依 12.8020653633
+几期 10.9049453784
+热锻 13.900677652
+盖县 11.1280889297
+记不起来 10.604840786
+几条 7.82993992397
+百思不得其解 10.4349417492
+三萜 12.2912397395
+老将 9.5062284973
+几杯 9.18217878068
+老小 9.01787572939
+南岗区 12.5143832909
+老少 9.46986085313
+高宗诏 13.900677652
+年貌 12.5143832909
+倒卧 11.5027823792
+林宗棠 13.900677652
+眼亮 12.5143832909
+抬腿 10.1630080337
+马塞尔 11.9547675029
+学长 12.2912397395
+几板 13.900677652
+无影灯 12.1089181827
+耍奸 11.9547675029
+工业界 11.1280889297
+倒卖 9.66657114738
+听罢 8.21709788464
+深更半夜 9.98865464655
+练习生 12.5143832909
+护理 8.41173992582
+坑塘 12.2912397395
+那红玉 12.8020653633
+当空照 13.900677652
+耳音 11.598092559
+排检 13.900677652
+陶瓷球 13.900677652
+三营 10.533381822
+几束 12.2912397395
+胆怯 8.56795885871
+钟伟 12.8020653633
+无理数 10.4994802703
+防化 10.6818018271
+疑兵 10.3743171274
+钟会 9.84023464143
+西康 10.9049453784
+瓦屋 11.7034530746
+武器弹药 10.533381822
+加龙骧 13.2075304714
+塔腊纳 13.2075304714
+新丁 11.3357282945
+三藏 7.30900391997
+圈子里 9.71102290995
+无形损耗 11.7034530746
+年资 12.2912397395
+郭璞 11.598092559
+古罗斯 12.2912397395
+欢迎您 10.5684731418
+万秒 12.5143832909
+活结 11.8212361103
+新丰 11.2616203224
+西府 10.9049453784
+昏愦 11.2616203224
+中央酒店 13.900677652
+还加 11.2616203224
+心脑血管病 11.4157710022
+文件系统 10.0294766411
+防区 9.6811699468
+新蓝筹 11.0674643079
+求饶 9.6811699468
+卡尔德隆 11.8212361103
+艾千子 12.8020653633
+企盼 9.82314020807
+萨甫 12.8020653633
+阵形 10.8561552143
+新乐 10.533381822
+精读 12.5143832909
+串子 12.5143832909
+斑斑 9.7898037878
+西延 12.2912397395
+倒勾 12.1089181827
+钟体 11.7034530746
+声地 10.1394775363
+饷银 10.3743171274
+阵式 12.1089181827
+养痈遗患 12.8020653633
+就理 13.900677652
+第三国际 10.1630080337
+光荣任务 13.900677652
+玄武池 12.8020653633
+日月重光 13.900677652
+命运之神 11.8212361103
+精诚 10.6818018271
+羞耻 9.61021821083
+顶推船 11.5027823792
+年费 11.1926274509
+李岩兄弟 10.0294766411
+一字一句 10.2371160058
+仅以 9.48183704418
+二发 13.900677652
+新乡 8.50251495046
+新书 9.82314020807
+融成 11.7034530746
+双击 12.1089181827
+年货 10.6818018271
+秋白梨 13.2075304714
+数十倍 11.0103058941
+防卫 8.63281949291
+稳赚 12.8020653633
+胡有儿 11.7034530746
+泥滩 11.0103058941
+乱石 9.56994431169
+疑凶 11.7034530746
+新亚 11.0103058941
+重大贡献 9.04864738806
+柯洛克 13.900677652
+齐步走 11.598092559
+倒刺 10.604840786
+蓝白色 12.2912397395
+还刚 13.900677652
+装运量 13.900677652
+西席 13.2075304714
+个人赛 11.3357282945
+科头跣足 12.8020653633
+吊挂着 13.900677652
+新事 13.2075304714
+众望 11.3357282945
+万种 9.31571017331
+常可 9.85762638414
+西帝 12.1089181827
+阿拉伯湾 12.5143832909
+相济 11.598092559
+费里 11.7034530746
+软件结构 13.2075304714
+假设 7.32839510928
+马麟引 13.2075304714
+安科纳 13.2075304714
+普罗科菲耶夫 11.2616203224
+储油罐 12.8020653633
+封开县 12.5143832909
+罩住 10.1630080337
+电脑打字 13.900677652
+稳赢 13.900677652
+纳兰性 11.9547675029
+西市 10.4994802703
+艾博特 13.2075304714
+新亭 11.598092559
+新仓 12.5143832909
+跨学科 10.533381822
+假话 8.97342396682
+尽如 12.8020653633
+哈斯效应 13.900677652
+谢利 12.1089181827
+无色 8.04274449749
+盖勒 13.2075304714
+尽管 5.090665604
+侯惧耳 13.900677652
+削薄 13.2075304714
+防反 13.900677652
+开封府 8.85725253506
+采矿工程 11.9547675029
+湘鄂西 10.2630914922
+假说 8.67493097826
+节假日 8.87679713113
+刮目 12.5143832909
+每版 13.900677652
+新任 8.80081122415
+枞树 11.598092559
+才德胜 13.900677652
+嗳呀 11.3357282945
+背后 6.06945743737
+慈利 11.8212361103
+灰度 12.1089181827
+几晚 13.2075304714
+构陷 11.598092559
+山神爷 11.8212361103
+炷香 10.8561552143
+人心所向 11.9547675029
+有违 9.61021821083
+负团费 13.2075304714
+一个零 11.7034530746
+实际气体 11.4157710022
+郭王 13.900677652
+普宁市 12.2912397395
+鉴定组 13.900677652
+犁杖 11.1926274509
+南昌市 10.2630914922
+响鼻 11.598092559
+二号线 11.5027823792
+照过 11.4157710022
+塔布依 13.2075304714
+坑底 11.7034530746
+数十块 12.5143832909
+槽沟 12.8020653633
+木型 13.900677652
+远岸 12.5143832909
+制式 9.13850371718
+魏朝 11.9547675029
+登攀 13.900677652
+双缸 11.9547675029
+花椒粉 13.2075304714
+一个集 11.0103058941
+爆炸品 13.2075304714
+孙丹尼 12.8020653633
+杨博 9.12155415886
+马尾辫 13.2075304714
+立体地图 13.2075304714
+武清侯 10.2630914922
+排湾 12.8020653633
+扎耶德 13.2075304714
+颤悠 12.8020653633
+金丰投资 12.5143832909
+官田达 13.2075304714
+颤悸 11.2616203224
+四边形 11.0103058941
+粉红色 9.04864738806
+三节 10.765183436
+慈善 8.26232298264
+有辆 13.2075304714
+有边 12.2912397395
+叶盛 12.5143832909
+周夷王 13.2075304714
+倒嗓 13.2075304714
+有辱 11.4157710022
+老年夫妇 13.2075304714
+老媪 12.5143832909
+艇长 10.2897597393
+达尚峰 13.900677652
+周敬王 11.2616203224
+假象 8.73019365694
+西姆 12.1089181827
+扬格 12.5143832909
+质成 13.900677652
+三艘 10.2630914922
+玄武殿 13.2075304714
+费雪 11.2616203224
+勇士队 12.5143832909
+费雯 13.900677652
+香案 9.48183704418
+西夷 12.1089181827
+虾酱 12.5143832909
+西头 9.94943393339
+青山不老 13.900677652
+特卖场 13.900677652
+状词 12.8020653633
+季迪 12.8020653633
+远射 11.2616203224
+红褐色 9.82314020807
+众怒 10.765183436
+西天 8.42003872863
+酚醛塑料 12.2912397395
+龟文 13.900677652
+乔治式 13.2075304714
+吉米卡 13.900677652
+媚俗 11.598092559
+商税纳 12.8020653633
+费雷 12.5143832909
+良好条件 10.2371160058
+西群 11.8212361103
+西多 11.8212361103
+摊铺 11.8212361103
+芬妮 12.5143832909
+抱着书 13.900677652
+三色 10.533381822
+睡前 10.1394775363
+若干辆 13.2075304714
+西夏 7.89186446653
+有轨 11.5027823792
+阿戈斯 12.5143832909
+愧对 10.4349417492
+洱源县 13.2075304714
+巴黎市 11.9547675029
+高唐县 13.900677652
+碎波 13.900677652
+芦之湖 13.2075304714
+地理图 11.1280889297
+上官体 12.5143832909
+原始记录 12.1089181827
+武清伯 9.01787572939
+程玉兰 13.2075304714
+车王贤 12.2912397395
+广生榨 13.2075304714
+靡靡之音 12.8020653633
+全方向 12.2912397395
+北欧国家 11.0674643079
+三舍 12.8020653633
+北汉 9.75754292558
+费难 11.7034530746
+洛克 9.55687223012
+老娘 8.71889410168
+西奥 11.4157710022
+傻憨 13.900677652
+源源而来 11.9547675029
+舳舻 11.7034530746
+梁城破 13.2075304714
+萧何 9.96885201925
+洛兰 11.598092559
+理工大学 10.8561552143
+西奚 12.8020653633
+远山 9.63799777493
+西套 11.9547675029
+洛兹 13.900677652
+西奔 11.1280889297
+大案要案 11.2616203224
+玉龙雪山 10.9049453784
+高脚屋 12.5143832909
+西奈 11.9547675029
+西奇 13.900677652
+费隐 12.8020653633
+半生半熟 13.900677652
+谢尔顿 12.5143832909
+立宪政体 11.4157710022
+映照出来 13.2075304714
+深山穷谷 13.2075304714
+阿尔伯特 11.598092559
+龙抬头 12.2912397395
+大维娅 13.2075304714
+敌楼 9.85762638414
+外省市 11.598092559
+绞刑 10.604840786
+地磁场 9.85762638414
+东方式 12.2912397395
+骂不还口 13.2075304714
+胡公公 12.5143832909
+楚叔 12.8020653633
+科班出身 12.1089181827
+向前行驶 12.5143832909
+北江 9.56994431169
+坐地分赃 13.2075304714
+制帽 11.598092559
+自学辅导 13.900677652
+排演 10.1394775363
+制币 13.2075304714
+萧云 12.8020653633
+三菱 8.9102450652
+国家有关 8.46259834305
+玄真子 13.900677652
+镍粉 12.8020653633
+假货 9.54396882529
+假账 12.8020653633
+一声不响 9.01032852375
+推拉 11.4157710022
+阴凉处 12.2912397395
+行动指南 11.3357282945
+北极狐 11.4157710022
+西境 10.4994802703
+卡特兰 13.900677652
+重机枪 9.36807815882
+储藏 9.23723855786
+姨表 11.5027823792
+谈来谈去 13.2075304714
+老宅 10.1164880181
+地理圈 13.2075304714
+老宋 10.3743171274
+唐努乌拉 13.900677652
+杜布罗夫尼克 12.5143832909
+噪音 8.85082164473
+贝尔岛 12.8020653633
+慈和 11.2616203224
+老官 11.8212361103
+睡去 9.25628675283
+除数函数 13.900677652
+摊销 10.5684731418
+三十里铺 12.5143832909
+老实 7.66626692626
+相殊 13.900677652
+相残 11.8212361103
+朱皇帝 13.2075304714
+老客 13.900677652
+魏晋 7.57990935773
+张春桥 11.0674643079
+离散性 12.8020653633
+前重后轻 13.900677652
+有身 10.604840786
+刘库仁 12.1089181827
+数据处理系统 11.1926274509
+销售主管 12.1089181827
+老家 7.7083151625
+停药 9.98865464655
+封锁线 10.0505300503
+上官仪 12.5143832909
+西壁 11.4157710022
+孙去寻 13.2075304714
+北大西洋 9.29550746599
+两性生活 12.5143832909
+袜子 8.98069672615
+孀居 12.2912397395
+上升幅度 9.23723855786
+官御史 12.2912397395
+倒吸 9.75754292558
+萧为 13.2075304714
+联合声明 9.58318953844
+安汉将军 13.2075304714
+老子 7.11283266967
+乔治市 13.2075304714
+老孙 7.76727960898
+背不动 12.1089181827
+基本准则 11.0674643079
+济时 13.900677652
+在线视频 13.2075304714
+构造 6.65645013637
+绞动 12.5143832909
+方腊起义 11.5027823792
+还吸 13.2075304714
+后事之师 12.2912397395
+展眉 13.2075304714
+慌神 11.5027823792
+都昌 11.9547675029
+三荣 13.900677652
+正教 10.4994802703
+西堂 12.5143832909
+萧三 12.1089181827
+动量定理 11.8212361103
+寻藏 11.7034530746
+活塞式 10.2371160058
+无所不谈 11.7034530746
+品过 13.2075304714
+送友人 13.900677652
+掐死 10.0720362555
+灰墙 13.2075304714
+毛毛道 13.900677652
+说好 8.22050504296
+校勘学 11.2616203224
+郭淮入 13.2075304714
+酆美 11.1280889297
+土洞墓 11.7034530746
+偷梁换柱 10.4994802703
+三茂 11.8212361103
+精赤 12.1089181827
+呼吁书 12.1089181827
+旁遮普邦 11.7034530746
+社友 8.58255765813
+德育教育 13.900677652
+戛玉敲金 13.900677652
+西塘 12.1089181827
+导电性 9.69598503258
+数首次 13.2075304714
+定位导航 12.8020653633
+利益 5.82136945992
+徐惟诚 13.900677652
+三茬 12.5143832909
+石沉大海 11.1280889297
+进项税额 12.8020653633
+年计 12.1089181827
+排水 8.00903344015
+起重机 9.75754292558
+科技成果 10.1630080337
+二十部 11.9547675029
+大容山 12.1089181827
+严重事故 11.8212361103
+明度对比 12.8020653633
+千百万只 13.2075304714
+神道碑 11.598092559
+气若游丝 11.7034530746
+削职 10.5684731418
+利用 5.00395273448
+泻地 13.2075304714
+西宫 11.3357282945
+大藏相 13.900677652
+三胎 12.2912397395
+冷却器 11.8212361103
+魏收 10.9562386728
+郭熙 11.0103058941
+腐臭 10.5684731418
+排气 9.6811699468
+查尔斯顿 12.2912397395
+多多益善 11.2616203224
+三能 13.900677652
+租给 10.1164880181
+刑法志 11.8212361103
+军法审判 13.900677652
+三星电子公司 13.900677652
+菽粟 13.2075304714
+粪坑 11.5027823792
+几排 10.8096351986
+南屏 11.598092559
+贾王 13.2075304714
+西安 6.77619938948
+西宇 12.8020653633
+完整版 12.5143832909
+锥虫病 12.1089181827
+西宁 8.75318317516
+拧起来 13.900677652
+老境 12.8020653633
+阿尔维斯 11.8212361103
+乘筏 13.900677652
+绿林豪杰 13.2075304714
+价内 11.9547675029
+热量 7.40995411747
+路口处 11.9547675029
+迟到早退 12.8020653633
+郭燕 12.8020653633
+奥勒留 12.5143832909
+排污 9.61021821083
+无理性 11.7034530746
+朝奉郎 13.900677652
+赛福鼎 13.2075304714
+衣局 13.2075304714
+停职 10.6818018271
+利略 13.900677652
+照用不误 13.900677652
+龟板 11.2616203224
+二百四十二年 12.8020653633
+矮个 11.8212361103
+粪土 10.604840786
+呢子大衣 13.2075304714
+故事书 13.2075304714
+秀英区 13.2075304714
+走火入魔 11.5027823792
+瘦瘦小小 13.2075304714
+乌廷玉 11.5027823792
+三股 9.53122979951
+潮汕地区 11.7034530746
+有趣 7.58351296523
+贝尔德 11.7034530746
+北京市民 10.765183436
+魏斯 12.2912397395
+三聚 12.2912397395
+倒地 8.89004235788
+转售他人 13.900677652
+作业处理 13.900677652
+三联 10.1164880181
+有赖 11.2616203224
+蒙哥孙 13.2075304714
+落架 13.2075304714
+长清县 11.7034530746
+有赏 11.2616203224
+外交部办公厅 13.2075304714
+莫斯科 7.22864470651
+蒙哥子 12.8020653633
+一遭 8.71329184614
+点头会意 12.1089181827
+万余辆 11.9547675029
+石破茂 13.900677652
+贰臣 12.5143832909
+魏文 12.2912397395
+相框 11.3357282945
+排沙 11.5027823792
+苏纳海 13.2075304714
+入场式 13.900677652
+隐睾 11.2616203224
+弄巧反拙 11.4157710022
+探胜 12.8020653633
+官田赐 13.2075304714
+笃守 13.900677652
+洛南 11.4157710022
+齐纳曼 13.2075304714
+思想观点 12.5143832909
+艾买提 12.8020653633
+笃定 10.4994802703
+潜山县 11.5027823792
+莫西语 13.2075304714
+笃实 12.2912397395
+少数几部 13.900677652
+三老 10.7226238216
+西学 9.84023464143
+三者 8.11685246965
+军委办公厅 13.900677652
+辛格尔 13.2075304714
+俱佳 10.604840786
+几捆 11.7034530746
+南去 10.4666904475
+里约集团 12.2912397395
+欧阳山尊 13.2075304714
+新潮 9.17328983326
+禽兽 9.28555713513
+吴家砖 12.8020653633
+和细姐 13.2075304714
+卡特加 11.9547675029
+西子 10.7226238216
+排泄 8.47572763449
+矮人 12.8020653633
+杂草多 13.900677652
+黄包车 9.80633308975
+二十通 13.900677652
+集体户 13.900677652
+倒坍 12.1089181827
+有责 11.7034530746
+有财 13.2075304714
+非金属 8.45825994145
+有货 13.2075304714
+杨可 13.900677652
+成都市人民政府 13.2075304714
+打水漂 10.4041700905
+授徒 10.4349417492
+甲乙级 13.900677652
+知识青年 10.2371160058
+阵子 11.5027823792
+木糖醇 11.9547675029
+扎什伦布 13.2075304714
+老姐 12.8020653633
+猎人 8.74738605748
+大秦铁路 9.22784881751
+宣传牌 13.2075304714
+和雅虎 12.5143832909
+远征 8.0600359946
+得力 8.57280148319
+史太公 12.8020653633
+中国作协 11.598092559
+排洪 10.642581114
+宣传片 11.5027823792
+二十里 8.81927328699
+鲁山 9.6811699468
+伊奇 12.8020653633
+高速钢 11.3357282945
+六世祖 12.1089181827
+精辟 9.48183704418
+几把 9.54396882529
+品质 7.28998160726
+万事不求人 13.2075304714
+翻作 12.5143832909
+贫贱不能 13.2075304714
+无线通信 11.598092559
+三自 12.8020653633
+黄桂稠 12.8020653633
+多言多语 11.8212361103
+村风 13.900677652
+带答不理 13.900677652
+冰期后 11.8212361103
+司马迁祠 13.2075304714
+上粪 11.8212361103
+老妇 10.533381822
+侯王庙 12.8020653633
+老妈 10.3453295905
+报应不爽 12.8020653633
+品赏 12.2912397395
+刮片 11.598092559
+看门狗 11.9547675029
+几拳 11.2616203224
+蔚为奇观 11.2616203224
+数十吨 12.2912397395
+操舟 12.2912397395
+排浪 13.2075304714
+每盏 13.2075304714
+雨花区 13.900677652
+精进 11.1926274509
+反冲力 13.900677652
+承包合同 10.604840786
+杨升南 13.2075304714
+陆符 11.2616203224
+齐声叫好 13.900677652
+劳逊 13.2075304714
+米坦科 13.900677652
+乘空 11.9547675029
+仁政 9.96885201925
+几招 12.1089181827
+世界园艺博览会 13.900677652
+腐肉 10.6818018271
+数十名 10.3743171274
+滇北 11.4157710022
+袜套 12.2912397395
+访韩 13.900677652
+侧卧 10.8561552143
+冯师傅 13.2075304714
+工业化 7.77162744192
+三腔 13.2075304714
+史前时代 11.3357282945
+几户 10.0940151622
+老套 11.5027823792
+德奥军 12.8020653633
+闽粤赣 12.2912397395
+怒容 10.8096351986
+兰图尔 12.5143832909
+徐无鬼 13.900677652
+人尽其才 12.1089181827
+工业区 7.93709830836
+马塞奥 12.2912397395
+排涝 10.1394775363
+杨氏双 13.2075304714
+视窗 11.8212361103
+比旋光 9.72629038208
+几成 9.72629038208
+老奴 9.55687223012
+生态环境 8.27666014579
+西娅 12.5143832909
+硅整流器 13.900677652
+鲜果 10.3453295905
+滇南 9.98865464655
+颤振 11.598092559
+三脚 10.9049453784
+北野武 11.9547675029
+怨天尤人 10.5684731418
+养下来 12.5143832909
+血光之灾 12.5143832909
+大雪崩 13.900677652
+老夏 13.2075304714
+同好者 13.900677652
+排房 13.2075304714
+每百 13.2075304714
+阿片类 13.2075304714
+老外 10.4041700905
+捕捞业 11.1926274509
+防城 10.5684731418
+几批 10.3743171274
+净利润 5.98788843129
+激光雷达 11.598092559
+几所 10.4666904475
+酸奶机 13.900677652
+阵容 9.32596667347
+几扇 12.5143832909
+老大 7.87239913175
+乔治山 13.900677652
+老天 8.87023973058
+几手 11.8212361103
+老夫 7.83225206373
+老太 10.0294766411
+大藏省 12.2912397395
+亚欧大陆桥 12.5143832909
+无虑 11.3357282945
+毛头小子 11.8212361103
+城砖 12.8020653633
+种植制度 12.2912397395
+银川市 10.3453295905
+每包 11.598092559
+湘鄂赣 10.9049453784
+袁复礼 13.2075304714
+眼明手快 10.765183436
+一言 9.06439574502
+福康安 10.9049453784
+诸路 9.35738286971
+西方 5.80782662444
+客套话 10.9049453784
+蜕壳 11.8212361103
+西斯 10.7226238216
+三代人 11.0674643079
+推磨 10.4994802703
+劫杀 12.1089181827
+相图 11.1926274509
+数十步 11.8212361103
+相国 9.63799777493
+修行 8.80081122415
+多三倍 13.900677652
+就位 10.6818018271
+心碎 10.0088573539
+新田 10.6818018271
+排列 6.82740793452
+体能训练 12.1089181827
+闻萧 13.2075304714
+新民学会 11.7034530746
+讨人喜欢 10.6818018271
+层次化 13.900677652
+钟琴 12.2912397395
+普遍认为 7.8604229407
+托拉斯 10.0940151622
+锦秀 13.2075304714
+归纳定义 13.900677652
+岩羊 11.1280889297
+搅闹 13.900677652
+钟琪 12.2912397395
+言下 12.1089181827
+芷江 11.1926274509
+挖起来 11.4157710022
+新用 12.8020653633
+苏利纳 13.2075304714
+晴纶 13.900677652
+囔着 12.8020653633
+六面体 12.2912397395
+原装 10.1394775363
+奥伊斯 12.2912397395
+同乐会 12.5143832909
+赵高恐 12.8020653633
+文献分类 12.5143832909
+扬名 10.3171587135
+吼出 12.1089181827
+数十款 13.2075304714
+稳稳重重 13.900677652
+数十次 10.765183436
+大马力 11.4157710022
+护人 13.900677652
+志在必得 10.533381822
+长时间 7.00398332035
+居高不下 8.77671367257
+深紫色 11.2616203224
+尼西亚斯 13.2075304714
+宁城县 12.5143832909
+给我发 11.0674643079
+新界 10.4041700905
+妩媚动人 11.3357282945
+丧失理智 11.1926274509
+水陆两用车 13.2075304714
+罗凤遂 12.8020653633
+横眉冷对千夫指 13.2075304714
+郭信 11.7034530746
+就伴 13.900677652
+花边 9.26594866375
+李信连 13.2075304714
+中华人民共和国香港特别行政区 11.7034530746
+市厅级 13.900677652
+冗杂 11.9547675029
+士马 10.4666904475
+无可比拟 10.533381822
+河阳 10.3453295905
+一千三百六十二年 13.2075304714
+盟约 9.80633308975
+单位成本 11.7034530746
+盖楼 11.4157710022
+受刺激 10.4041700905
+诸首领 12.2912397395
+西政 13.900677652
+众将 7.88696249593
+相器 13.900677652
+未尽 9.40086798165
+东为 9.94943393339
+俞氏 12.8020653633
+元圣儿 13.2075304714
+西支 9.85762638414
+新疆 6.55273382883
+骨肉至亲 12.8020653633
+毛细管柱 13.900677652
+魏家 11.5027823792
+东丹 13.900677652
+玫瑰园 12.1089181827
+中央编译出版社 13.900677652
+一机部 12.1089181827
+不实之处 12.2912397395
+赫利博 12.5143832909
+劝回去 13.2075304714
+岩缝 9.61021821083
+花轴 11.598092559
+保定市 10.9049453784
+两门课 12.8020653633
+两居室 11.8212361103
+艾释华 13.2075304714
+嘴里塞 10.4994802703
+魏宁 13.900677652
+老普 13.900677652
+跑不掉 10.9049453784
+擒贼 12.5143832909
+文献标引 13.900677652
+入静 12.2912397395
+爆炸案 12.5143832909
+欢迎词 11.8212361103
+长玢岩 12.1089181827
+中华慈善总会 13.900677652
+一千三百一十九处 13.2075304714
+杀风景 12.2912397395
+选得 11.2616203224
+国家大剧院 12.8020653633
+寿南山 13.2075304714
+雪山飞狐 13.2075304714
+诸贤 13.2075304714
+张瀚 10.0294766411
+联想集团 10.1630080337
+特赐 11.2616203224
+官方版 12.5143832909
+杨仪入 12.5143832909
+玛莎拉蒂 11.9547675029
+韦森 12.5143832909
+明治维新 9.75754292558
+南尼 12.8020653633
+江中 9.30555780184
+丽江地区 12.1089181827
+学院 6.50679936187
+老是 8.50251495046
+鲁尼 8.89004235788
+花下死 13.2075304714
+贩到 11.8212361103
+军火库 11.5027823792
+外汇储备 7.87965430263
+推移 8.71329184614
+胆寒 10.3171587135
+卡姆斯 13.2075304714
+俯看 12.5143832909
+个人资料 11.598092559
+长老派 11.8212361103
+恋爱史 13.900677652
+刘呐鸥 13.900677652
+淡泊名利 11.8212361103
+马齿徒长 13.900677652
+郭云 13.2075304714
+静坐 9.4233408375
+就义 9.69598503258
+青春片 13.2075304714
+打猎 8.82550383674
+多云间阴 13.900677652
+相互竞争 10.7226238216
+金太宗 10.2897597393
+洛河 9.62401153296
+几岁 9.15574552361
+年少气盛 12.8020653633
+萨拉弗 13.2075304714
+高等级 10.642581114
+郭京 11.0674643079
+郭亮 13.2075304714
+西撒 11.8212361103
+巴塘县 13.900677652
+康乐县 12.8020653633
+老柴 13.2075304714
+竹笠 11.7034530746
+克萨卡 12.8020653633
+唐诗歌 13.2075304714
+草草了事 12.5143832909
+盖格 13.2075304714
+上官犯 13.900677652
+厄瓜多尔人 12.5143832909
+议事堂 12.5143832909
+排印 9.85762638414
+就业 6.35317596916
+脱色剂 12.8020653633
+帐面 10.765183436
+北京市区 11.598092559
+老林 10.533381822
+贾政喝 13.2075304714
+趋向于 9.75754292558
+洪灵菲 13.2075304714
+陈傅良 11.9547675029
+戏剧系 11.3357282945
+子马钰 13.900677652
+信托公司 9.08039608637
+乔恰拉 13.2075304714
+洛波 13.900677652
+无脊椎 12.1089181827
+衣羽流 13.2075304714
+批林批孔 11.7034530746
+专门从事 9.01032852375
+排华 12.5143832909
+排协 13.900677652
+说个事 12.1089181827
+无理式 12.2912397395
+胆子 7.86519621945
+郭万 12.8020653633
+国家劳动部 13.2075304714
+下酒菜 10.765183436
+尸首 8.31718134319
+锕系元素 11.0674643079
+萧爽 13.2075304714
+河入海 11.9547675029
+排去 12.8020653633
+风味餐厅 13.900677652
+授意 9.22784881751
+博洛尼亚 10.9049453784
+几尺 10.3453295905
+传承文明 13.900677652
+几尾 11.7034530746
+老杜 11.8212361103
+前委 10.1871055853
+一订 13.2075304714
+护住 9.89334446674
+几封 11.1280889297
+老来 10.4041700905
+石油商 13.2075304714
+洛水 9.91169360541
+几尊 11.5027823792
+股掌之上 11.7034530746
+就任 8.23425096386
+钻头 10.642581114
+话中有话 10.533381822
+一讲 10.7226238216
+流浪汉 9.40086798165
+一记 9.16447920358
+望门寡 13.900677652
+井冈山革命博物馆 12.8020653633
+赵云正 13.2075304714
+老板 6.97901946782
+护佑 10.1630080337
+式微 10.6818018271
+偏振片 11.8212361103
+排号 10.3743171274
+但庆玉 13.2075304714
+首饰盒 11.0103058941
+职务侵占 13.900677652
+花锦 11.9547675029
+竹笋 9.80633308975
+兰亭诗 12.8020653633
+词韵 13.900677652
+诗歌选 13.2075304714
+逢遇 13.900677652
+乡镇场 12.8020653633
+西摩 11.2616203224
+一试 9.56994431169
+哪句 11.0103058941
+动物群落 12.5143832909
+李越 11.3357282945
+几局 12.5143832909
+界龙 8.58255765813
+此之谓 11.8212361103
+几届 10.5684731418
+束状 11.7034530746
+堂堂正正 10.0294766411
+龟壳 10.4666904475
+老本 11.0103058941
+一准儿 13.900677652
+一语 9.12155415886
+老朱 10.9562386728
+入队 13.900677652
+一说 6.99693039439
+一读 11.0103058941
+度越 11.8212361103
+老朽 9.85762638414
+寻绎 13.900677652
+十六平方米 13.2075304714
+泥坯 12.8020653633
+这场 6.68323422028
+串成 11.2616203224
+入门 9.12999302751
+有心力场 12.1089181827
+魏大 13.900677652
+音乐指导 10.9562386728
+几微 13.2075304714
+遗传工程 10.765183436
+撕扯 10.0294766411
+槐树下 10.642581114
+韦甘德 13.900677652
+航空舰 13.900677652
+慈母 10.4041700905
+满百 13.2075304714
+抬肩 13.900677652
+入闱 12.5143832909
+诉权 11.2616203224
+讲习所 10.2630914922
+串户 13.900677652
+湖南人 10.765183436
+一百三十七所 13.2075304714
+西林 10.642581114
+临床部 13.2075304714
+相品 13.900677652
+刮伤 12.5143832909
+夏秋停 13.2075304714
+撕打 12.2912397395
+向丹墀 12.8020653633
+目录名 12.2912397395
+苏利文 13.900677652
+睡法 13.900677652
+五里桥 12.5143832909
+推动力 8.26946587015
+泥块 11.5027823792
+哀帝 10.642581114
+泥坑 11.1926274509
+胆壮 11.5027823792
+排偶 12.2912397395
+香椿 11.4157710022
+溥仪之 12.2912397395
+故事片 9.10488710638
+什科夫 12.1089181827
+一发而不可收 12.5143832909
+一行 6.98594675926
+衲袄 11.3357282945
+强势股 9.4233408375
+归御营 12.5143832909
+工商企业界 12.8020653633
+广大干部 9.5186510173
+建华区 13.2075304714
+吼叫 9.11318590919
+文明执法 11.8212361103
+王威 11.7034530746
+离了婚 10.0294766411
+李显龙 11.2616203224
+闻名遐尔 13.900677652
+一表 11.4157710022
+人才辈出 11.3357282945
+撕成 10.2897597393
+那神光 13.2075304714
+泥土 7.87481167815
+唐宝锷 13.2075304714
+犁头 11.1926274509
+东莱 10.6818018271
+老办法 10.604840786
+几张 8.64318227995
+授戒 12.2912397395
+一袋 9.22784881751
+上党梆子 11.598092559
+推究 11.9547675029
+祭器 10.0505300503
+死法 9.98865464655
+正黄旗 10.2371160058
+性健康 12.5143832909
+贾汗 12.2912397395
+相告 9.85762638414
+购物广场 11.2616203224
+几开 13.900677652
+泥城 11.598092559
+西望 11.2616203224
+猎猎 10.5684731418
+贾汉 12.5143832909
+定位问题 12.5143832909
+刍草 12.8020653633
+多千克 10.8096351986
+西服 9.61021821083
+工业港 11.9547675029
+撕拉 13.2075304714
+资本化 9.18217878068
+西有 9.58318953844
+衲衣 12.5143832909
+歇斯底里 9.69598503258
+刍荛 12.8020653633
+排成 8.63798746307
+盏灯 11.0103058941
+一装 11.9547675029
+银纬 12.2912397395
+锦笺 12.8020653633
+开发性 11.3357282945
+云梦县 12.2912397395
+萧照 12.5143832909
+相吻 12.2912397395
+相吸 12.1089181827
+三家村 10.3171587135
+张衡算 13.900677652
+圆乎乎 12.8020653633
+可消化 12.8020653633
+浏阳市 11.1926274509
+马真氏 11.9547675029
+西条 13.900677652
+纵贯公路 13.900677652
+路易吉 12.5143832909
+液晶 8.98069672615
+陈镜泉 9.5186510173
+相同 6.00524164503
+钟相 10.642581114
+入锅 11.1926274509
+簇团 13.900677652
+鸣锣喝道 13.900677652
+融安 12.5143832909
+西村 10.8096351986
+母蝎子 12.1089181827
+白蛇传 10.604840786
+配套性 13.2075304714
+新知 11.2616203224
+花贩 13.900677652
+各岛屿 11.2616203224
+远扬 10.8096351986
+相向 10.0505300503
+史大人 10.3743171274
+伍荣彰 13.2075304714
+玉帝赐 13.2075304714
+重机关枪 12.8020653633
+刮下 11.7034530746
+猎犬 9.77354326693
+几座 9.15574552361
+布洛西 11.9547675029
+疏解 11.0103058941
+骸骨 10.642581114
+里斯本 9.41204128224
+妇女地位 10.8561552143
+西安政治学院 13.900677652
+松下电器公司 12.1089181827
+遐迩 11.9547675029
+朝阳医院 13.900677652
+病毒程序 12.5143832909
+阿拉伯国 12.8020653633
+老旧 9.84023464143
+老旦 11.1926274509
+老早 10.8096351986
+弱酸 10.3453295905
+蜡光纸 12.5143832909
+石油城 11.7034530746
+高度民主 11.8212361103
+三英里 12.2912397395
+普兰诺 12.1089181827
+哆嗦 8.30596627237
+旗竿 12.5143832909
+洛溪 13.900677652
+紫竹 10.533381822
+年近半百 12.5143832909
+黄须 11.8212361103
+官原品 13.2075304714
+林可霉素 11.8212361103
+西曼 12.8020653633
+众心 10.4349417492
+猎狮 12.8020653633
+羁押于 12.8020653633
+数十根 12.8020653633
+辊子 12.8020653633
+傻帽 13.2075304714
+斯威夫特 12.1089181827
+排入 9.69598503258
+显著标志 11.7034530746
+协同通信 13.900677652
+槽口 13.2075304714
+于盟津 12.8020653633
+楷书体 13.900677652
+数十株 12.8020653633
+天潢贵胄 11.9547675029
+紫苏叶 12.8020653633
+中央办公厅 11.4157710022
+麦糠 12.1089181827
+伤心欲绝 11.8212361103
+竹筏 9.35738286971
+快攻手 13.900677652
+三十七部 12.2912397395
+消音器 12.2912397395
+淡旺季 13.2075304714
+推算 8.12612610643
+金线泉 13.900677652
+新港 9.75754292558
+荫翳 13.900677652
+氯乙酸钠 13.2075304714
+储蓄 7.5871296057
+防止 6.23633101988
+不看僧面看佛面 11.8212361103
+竹节参 13.900677652
+企图 6.80644280605
+扬场 12.2912397395
+猎狗 9.84023464143
+热切期望 13.900677652
+一要 9.27570483869
+因子分析 12.2912397395
+吼到 13.900677652
+百分数 10.3743171274
+扬城 13.2075304714
+酸奶子 13.2075304714
+三万四千三百余顷 13.2075304714
+老爷子 9.65218240993
+拖出来 10.6818018271
+埃尔南德斯 12.8020653633
+伊罗戈 13.900677652
+洁静 13.2075304714
+贝尔托 12.8020653633
+贝隆 13.900677652
+南岩 11.8212361103
+何奇 13.2075304714
+尾板 13.2075304714
+移相器 12.8020653633
+成人教育 10.765183436
+结义兄弟 12.8020653633
+波赛东 12.8020653633
+互连 10.2897597393
+奥林比亚 13.2075304714
+产品目录 12.2912397395
+大波浪 12.8020653633
+消化率 11.5027823792
+一箭双雕 10.5684731418
+串接 12.1089181827
+西昌 9.6811699468
+度过 7.47905538417
+河网密度 11.0674643079
+西昆 11.598092559
+粗麻布 12.5143832909
+扬基 12.1089181827
+无计可施 9.55687223012
+贝雕 10.2117981979
+猎物 8.9308643524
+一见 7.39638947844
+灰暗 9.5186510173
+防毒 10.642581114
+于丽景 13.2075304714
+疗养地 10.765183436
+一览 8.96620371885
+一觉 9.23723855786
+排出 7.53764954844
+吉伦特 10.5684731418
+贝雅 12.1089181827
+西普 11.8212361103
+柯俊雄 13.2075304714
+伊金霍 12.5143832909
+皇考 12.1089181827
+几年 6.05761363528
+企业 4.22177218495
+哪几 13.2075304714
+祛灾 13.900677652
+阿布杜尔 13.900677652
+竹筒 9.40086798165
+一触 10.2897597393
+几幅 10.3743171274
+济宁 9.61021821083
+荫罩 13.900677652
+西晒 13.900677652
+花谢 11.598092559
+西晋 8.0600359946
+胆大 8.89673134603
+西晃 12.1089181827
+明叔惊 12.8020653633
+泥丸 11.7034530746
+傻女 13.900677652
+穿云破雾 12.2912397395
+缘法 11.0674643079
+五里湖 12.5143832909
+玄武区 13.2075304714
+线性方程组 11.0103058941
+棉产区 11.5027823792
+不合宜 12.8020653633
+变频空调 11.3357282945
+利伯 12.8020653633
+真实可信 11.2616203224
+沟池 12.2912397395
+无数遍 11.8212361103
+颤声 9.7898037878
+傅科摆 13.2075304714
+防水 9.31571017331
+下达指示 13.900677652
+王兀堂 13.900677652
+认理 13.900677652
+王氏兄弟 12.1089181827
+地头蛇 11.1926274509
+洛维奇 12.2912397395
+卖友求荣 12.1089181827
+制服 8.3285236198
+速生丰产林 12.8020653633
+向隅而泣 13.900677652
+老拳 11.8212361103
+不信任案 11.0103058941
+三十几家 13.2075304714
+远播 11.0674643079
+花语 12.8020653633
+汉城市 13.900677652
+公交化 12.2912397395
+刻薄寡恩 12.5143832909
+迪克桑斯 12.1089181827
+相助 8.48457724977
+以色列国防军 12.2912397395
+哲宗 10.5684731418
+魏彦 12.8020653633
+相加 9.11318590919
+网络工程 13.2075304714
+霸王车 12.8020653633
+万法郎 11.598092559
+犁式 11.7034530746
+防汛 10.4349417492
+天津劝业场 12.5143832909
+三百三十二万余两 13.2075304714
+日月经天 13.900677652
+流血政变 12.2912397395
+楚囚相对 13.900677652
+都变青 13.2075304714
+分个 12.1089181827
+绞死 10.7226238216
+口服药物 11.598092559
+贝尔斯 10.9562386728
+蒂华纳 13.2075304714
+无影仙 10.9562386728
+钟灵 12.1089181827
+代代传 13.900677652
+制材 11.598092559
+官至怀 13.2075304714
+防污 12.5143832909
+相劝 9.7898037878
+老抽 13.900677652
+预备生 13.900677652
+传染给 10.5684731418
+好几辆 12.8020653633
+广阔天地 10.8561552143
+穿上来 13.900677652
+妥协性 12.1089181827
+几大 8.70772080109
+利便 12.8020653633
+老手 9.65218240993
+几天 5.91587426224
+兴凯湖 10.4041700905
+防沙 11.3357282945
+人品 9.12155415886
+侍立御 12.8020653633
+慈济 13.2075304714
+液态 8.82550383674
+几头 10.7226238216
+魏徵 10.0294766411
+残迹 10.1871055853
+梅迪纳 13.900677652
+安全玻璃 13.900677652
+戏剧社 13.2075304714
+魏律 13.2075304714
+士麦 11.598092559
+钟点 11.5027823792
+展业 12.2912397395
+避世 10.7226238216
+忧深思远 13.2075304714
+半隐居 13.2075304714
+年夜饭 11.2616203224
+单列 10.0505300503
+张骏派 13.2075304714
+牙周创伤 13.900677652
+嵇永仁 12.8020653633
+海亚姆 11.9547675029
+铁棍子 13.900677652
+孙越 12.8020653633
+几夜 11.7034530746
+虹桥机场 12.5143832909
+哪国 10.9562386728
+李烈钧 10.9562386728
+朱迪斯 13.2075304714
+诸多困难 11.4157710022
+非作战 13.900677652
+费利克斯 11.4157710022
+避乱 10.5684731418
+老成 10.0088573539
+信守合同 13.2075304714
+穆弘守 13.2075304714
+贝里 11.0103058941
+蠕变 10.6818018271
+见信 12.5143832909
+金光闪闪 10.2897597393
+恶虎扑食 13.900677652
+欢迎辞 12.8020653633
+德洛舞 12.8020653633
+驯马师 13.2075304714
+娇媚 10.4666904475
+鲁彦 12.1089181827
+王瑞祥 13.900677652
+无所顾忌 10.533381822
+北溯 13.2075304714
+单身 8.82550383674
+土地增值 11.1926274509
+倒流 10.1630080337
+奋翼 13.900677652
+葬花 10.8561552143
+魏志 12.1089181827
+矿热炉 13.900677652
+国恨家仇 13.900677652
+老房 12.5143832909
+摇头摆尾 11.0103058941
+何疑焉 13.2075304714
+私家轿车 13.2075304714
+梅花香 12.5143832909
+骂名 10.7226238216
+见下 11.598092559
+锌锭 13.2075304714
+支松烛 12.5143832909
+倒油 13.900677652
+排场 9.48183704418
+北溪 11.7034530746
+东方朔 10.8561552143
+倒爷 11.598092559
+派兵攻打 13.2075304714
+耶律宗霖 12.8020653633
+旷地 12.8020653633
+艳若桃李 13.2075304714
+粪池 12.5143832909
+粪污 13.900677652
+景宏岛 12.2912397395
+常流 12.5143832909
+苏鲁德 13.2075304714
+对华政策 11.1926274509
+北金堤 12.5143832909
+三块 9.35738286971
+太原火车站 13.2075304714
+相反 6.24528700715
+碟片 12.5143832909
+都府 13.2075304714
+魏帅 13.900677652
+见个 10.0294766411
+为首者 12.8020653633
+远方 8.47133202302
+孙晋芳 12.8020653633
+谢法 13.900677652
+相变 9.80633308975
+疏远 9.01787572939
+索二水 12.8020653633
+在线听 13.900677652
+乃父 11.9547675029
+防洪 8.66956903512
+疏运 12.5143832909
+扣压 11.598092559
+副团职 12.8020653633
+烟雨 10.1871055853
+授旗 13.900677652
+舟山渔场 11.5027823792
+一千五百米 13.2075304714
+倾销 9.16447920358
+几声 8.0600359946
+几壶 12.8020653633
+线框 12.8020653633
+秦裕伯 13.900677652
+安内乃 13.2075304714
+赞赏不已 13.900677652
+见习 9.30555780184
+中央纪委 11.0674643079
+一车 9.06439574502
+美国银行 8.62256299275
+不讲条件 13.2075304714
+留一手 12.1089181827
+心硬 11.4157710022
+授时 10.765183436
+一软 9.54396882529
+确保全 13.900677652
+排坛 12.2912397395
+利么 12.5143832909
+一轰 13.900677652
+成帝河 12.2912397395
+社会工作者 13.2075304714
+拉基亚 12.8020653633
+克雷西 13.900677652
+一载 11.2616203224
+倒水 10.1394775363
+索利斯 12.8020653633
+三胞胎 11.8212361103
+利人 12.8020653633
+一辆 6.95659044375
+刘海儿 13.2075304714
+制版机 13.900677652
+封神榜 12.1089181827
+防涝 11.8212361103
+一辈 9.5186510173
+弱视 12.1089181827
+江湾 10.3171587135
+常成群 11.5027823792
+速生林 13.900677652
+集体奖 13.900677652
+费拉菲 13.900677652
+誊抄 10.604840786
+相即 12.1089181827
+一辙 12.8020653633
+众多 5.90537103168
+一百零六岁 13.2075304714
+几堂 13.2075304714
+瞧过 12.8020653633
+度角 11.5027823792
+利亚 9.15574552361
+几堆 11.4157710022
+诸行 12.2912397395
+收款台 13.900677652
+波弗特 11.9547675029
+洛根 12.8020653633
+实感 11.2616203224
+精神损失 13.2075304714
+第一一零回 13.2075304714
+科技成就 12.1089181827
+北凉南 11.9547675029
+盖河 11.598092559
+济州 9.03314320152
+都市 8.35160156708
+站区 12.1089181827
+见人 9.03314320152
+华蘅芳 11.7034530746
+细口 13.900677652
+排除故障 11.9547675029
+冷却液 11.7034530746
+潘公央 13.2075304714
+一过 8.9308643524
+家学渊源 11.598092559
+壮阳药 10.8561552143
+一万次 11.8212361103
+空间概念 12.2912397395
+岩穴 10.7226238216
+唐哀帝 12.8020653633
+蔚为壮观 10.1164880181
+尺寸可取 13.900677652
+一近 11.8212361103
+西恩 12.5143832909
+溘逝 13.2075304714
+一进 8.39128931535
+老挝 8.91707103027
+双宾语 12.8020653633
+异化作用 12.8020653633
+利仓 13.900677652
+谢氏 11.8212361103
+爽性 13.900677652
+甜酒酿 13.900677652
+一迭 10.8561552143
+展位 10.4666904475
+坑杀 11.1280889297
+凭借 7.15661846566
+锦簇 12.5143832909
+轮盘赌 11.598092559
+十六家 12.2912397395
+自动电话 13.2075304714
+一调 11.598092559
+秦彦 12.1089181827
+防渗 10.6818018271
+诸语 12.2912397395
+蒙特塞 11.7034530746
+同素异 13.2075304714
+左右摇摆 11.2616203224
+方用清 10.9562386728
+花见 13.2075304714
+里卡尔 12.8020653633
+推拿法 13.2075304714
+几家 7.65070240972
+议事录 12.8020653633
+民主集中制 9.96885201925
+西接 9.34680076038
+周半城 13.2075304714
+开阳 10.4994802703
+国家图书奖 12.8020653633
+扬剧 13.2075304714
+傻子 8.0484751722
+过滤布 13.2075304714
+相像 9.38981814546
+携程 10.8096351986
+急风暴雨 11.0103058941
+水磨坊 13.900677652
+词选 11.5027823792
+钟爱 9.69598503258
+冠军联赛 12.1089181827
+老想 10.6818018271
+遥控器 11.2616203224
+萧规曹随 12.5143832909
+上丹墀 11.9547675029
+计划表 12.1089181827
+排名 6.53866710072
+油然 11.0103058941
+发挥作用 8.23771717184
+卖官贩爵 13.900677652
+睡梦 10.604840786
+两百多位 12.8020653633
+朱右 12.2912397395
+寄生蜂 11.5027823792
+褐煤 9.53122979951
+无所不通 11.1280889297
+几寸 11.7034530746
+几对 11.1280889297
+林苑习 13.2075304714
+张景岳 12.2912397395
+平装本 13.900677652
+赵太夫人 12.5143832909
+塞苍冥 13.900677652
+放开手 11.3357282945
+巧敏 12.8020653633
+永驻 11.8212361103
+防湿 13.900677652
+束甲 13.2075304714
+伊玛尼 12.2912397395
+舒胸顺 13.2075304714
+各里 12.8020653633
+云开见日 13.900677652
+戚戚 11.8212361103
+具体做法 10.2117981979
+中国作家协会 9.65218240993
+豫鄂 11.4157710022
+紧急事件 12.8020653633
+风调雨顺 10.1164880181
+察南 13.2075304714
+泥古 11.8212361103
+蜚声中外 12.1089181827
+黄鹤矶 12.8020653633
+灵应 11.8212361103
+盲字 13.900677652
+紫罗 12.1089181827
+唇裂 11.9547675029
+铁甲 9.07236391467
+演职员 13.900677652
+他妈的 8.12612610643
+王工 11.9547675029
+相偎 11.9547675029
+不凑巧 11.0103058941
+红姐姐 11.3357282945
+钟状 10.9049453784
+另一边 8.78268383956
+七十六个 12.8020653633
+说法儿 11.8212361103
+流浪歌 12.5143832909
+西指 11.9547675029
+彭公达 12.8020653633
+北地郡 10.9562386728
+冰球场 13.2075304714
+几季 13.2075304714
+竭智尽虑 13.2075304714
+防滑 10.533381822
+察北 12.1089181827
+言传 9.98865464655
+济度 9.31571017331
+哈勒哈 12.2912397395
+气象一新 13.2075304714
+血豆腐 12.5143832909
+戴良 13.2075304714
+妈呀 9.94943393339
+和兵卫 12.1089181827
+德容兼备 12.2912397395
+马纳特 13.2075304714
+五里河 12.5143832909
+魏巍 9.91169360541
+叶琛 13.900677652
+命运 6.60697993137
+张五常 13.2075304714
+钻塔 12.8020653633
+寻租 10.533381822
+未名湖畔 11.598092559
+乔治敦 11.4157710022
+魏州 10.7226238216
+湖南华 13.900677652
+西猛 13.900677652
+多媒体电脑 13.900677652
+几字 11.4157710022
+几孔 11.598092559
+拉普拉斯 9.6811699468
+文风不动 13.2075304714
+远景 8.94485059437
+老总 8.89004235788
+纱锭 9.59661255877
+攫取财富 12.8020653633
+锦缎 9.56994431169
+延吉市 11.7034530746
+推翻 7.34816976494
+胡绩伟 13.900677652
+紫绀 10.2371160058
+每亩 9.06439574502
+两百多万 12.5143832909
+秭归 10.1871055853
+怎么样 6.6083404758
+锦绣 9.21854642485
+每人 7.47095817394
+魏尹 13.2075304714
+高妙 11.8212361103
+操作电脑 11.9547675029
+现代五项 12.2912397395
+防漏 13.900677652
+苯巴比妥 11.8212361103
+外孙女儿 11.1280889297
+诗歌集 12.1089181827
+王二夫人 13.2075304714
+热挤压 13.2075304714
+新爱 13.900677652
+正定县 11.7034530746
+相凌 13.2075304714
+魏将 10.1164880181
+两百多个 13.2075304714
+一贯 7.84858848305
+终庵 12.8020653633
+丝锥 12.1089181827
+众家 10.0940151622
+跨越性 13.2075304714
+梅里特 12.2912397395
+葛尔丹 13.2075304714
+赖昌星 11.8212361103
+承制 11.5027823792
+掉进去 11.1280889297
+阻尼振动 12.8020653633
+北港镇 12.5143832909
+魏尔 12.8020653633
+教师爷 12.5143832909
+芒萁 12.5143832909
+察办 13.900677652
+轴丝 13.2075304714
+酷暑 9.55687223012
+评论性 13.900677652
+古木参天 10.8096351986
+汽修厂 11.9547675029
+中文名 11.1280889297
+主场优势 13.900677652
+每份 10.0940151622
+弗洛伊 13.2075304714
+那紫金 12.8020653633
+倒满 11.3357282945
+陛下 6.81980975528
+每件 10.0505300503
+新版 8.87023973058
+徐淮黄 12.1089181827
+新牌 13.2075304714
+清灰冷灶 13.900677652
+紫红 9.48183704418
+抬进来 11.0674643079
+万夫莫当 13.900677652
+众寡 11.8212361103
+抱不平 11.9547675029
+新特 13.900677652
+那堪梦 13.2075304714
+楚伐吴 13.2075304714
+慈溪 10.604840786
+一走 8.88339781516
+失掉 9.5186510173
+一起 4.87197906789
+转入地下 10.2897597393
+和孚威 13.2075304714
+以不变应万变 11.1280889297
+紫纹 12.5143832909
+青眼相看 12.1089181827
+西房 11.7034530746
+亿多千瓦 12.8020653633
+慈爱 9.80633308975
+唇角 11.5027823792
+相公 7.76079309975
+一超 12.5143832909
+远期 8.56313957227
+骑单车 13.2075304714
+慈湖 13.2075304714
+远望 9.04086524761
+还清 9.49395840471
+玉帝见 12.2912397395
+钟王 12.2912397395
+相关 4.83570993302
+一趟 7.38300637906
+相克 10.8096351986
+扬古 13.2075304714
+吉萨省 13.900677652
+亡者 11.1280889297
+益物权 11.5027823792
+唐将领 11.598092559
+同享 10.9049453784
+一挥而就 11.598092559
+重点中学 11.2616203224
+萧琛 13.2075304714
+随行就市 11.0103058941
+西戎 10.7226238216
+花衣 12.2912397395
+忘忧国 13.900677652
+不仁慈 13.900677652
+花衫 13.900677652
+白影闪 12.2912397395
+都尉 8.67493097826
+入道 12.1089181827
+萨福 11.1280889297
+一跃 8.71329184614
+临睡时 12.2912397395
+疗养区 12.1089181827
+食用盐 13.2075304714
+奥黛丽 12.8020653633
+一跌 10.0720362555
+昏头晕脑 13.900677652
+比小孔 12.8020653633
+帝姬 11.7034530746
+授权 7.36253782821
+第四辑 13.900677652
+相反数 12.5143832909
+盖满 11.598092559
+睡椅 11.3357282945
+一跤 9.80633308975
+林基路 12.8020653633
+萧瑟 10.3171587135
+加盟店 11.0674643079
+一跨 13.2075304714
+欢喜冤家 12.8020653633
+一路 6.41238413682
+山东快书 11.8212361103
+上缴 9.16447920358
+不快不慢 13.900677652
+那红云 13.2075304714
+更高 7.20735398371
+着名人物 13.900677652
+槽坊 12.8020653633
+埃姆斯 13.2075304714
+一舀 13.900677652
+诸藩 12.8020653633
+马来西亚林吉特 13.900677652
+缄封 13.900677652
+林泰曾 11.9547675029
+灰浆 11.7034530746
+紫燕 11.4157710022
+两样 8.4284069783
+河间 9.09665660724
+一片生机 13.900677652
+连战连 13.2075304714
+花蟹 13.2075304714
+高收入者 10.7226238216
+椽子 10.8561552143
+一般 4.31395775279
+居史馆 13.2075304714
+等个 11.7034530746
+疏苗 13.2075304714
+一船 10.0720362555
+命脉 9.77354326693
+阆苑 11.9547675029
+制止 7.56739802384
+伤害事故 12.2912397395
+静止图像 12.1089181827
+北极点 12.5143832909
+一个六十七岁 13.2075304714
+第十八章 10.0940151622
+岩石 6.94986288353
+胆力 13.900677652
+都司 9.49395840471
+有道 9.72629038208
+穿山甲 9.36807815882
+看上去 7.06013112269
+传递情报 12.8020653633
+一艘 8.10461990121
+艰巨 8.81927328699
+扬尘 10.4994802703
+裁军谈判 12.1089181827
+巨椁 12.2912397395
+主题标引 12.1089181827
+龟兹 9.14708746087
+毛管水 13.2075304714
+投资业 12.8020653633
+西至洪 13.2075304714
+真菌孢子 12.8020653633
+和为贵 12.5143832909
+一色 9.04864738806
+允执厥中 13.900677652
+液泡 10.5684731418
+相府 9.46986085313
+相应 5.89564430734
+一节 8.64840422393
+客车厂 12.8020653633
+反导弹 11.8212361103
+人之常情 10.3171587135
+浠水 11.7034530746
+正日 12.1089181827
+天公不作美 12.5143832909
+阵法 9.85762638414
+趾甲 11.4157710022
+真枪实弹 12.5143832909
+西洲 13.2075304714
+魏县 11.3357282945
+亡兄 12.8020653633
+收购价 9.14708746087
+克雷蒙 12.8020653633
+相平 11.5027823792
+西津 11.1280889297
+代谢作用 11.7034530746
+贮藏期 13.2075304714
+串游 13.2075304714
+客车厢 13.2075304714
+人和镇 13.900677652
+小亮亮 13.2075304714
+管家人 13.2075304714
+钟粹 13.900677652
+花蝶 13.2075304714
+音译 8.61241062128
+齐眉穗儿 13.900677652
+仙后座 10.9562386728
+肾气 9.84023464143
+绞架 11.7034530746
+帝师 10.533381822
+液氦 10.642581114
+液氧 10.765183436
+西洋 8.0285598625
+都匀 10.8096351986
+液氢 10.9049453784
+防患 13.2075304714
+天知地知你知我知 13.900677652
+液氮 11.1280889297
+液氯 12.5143832909
+液氨 10.8096351986
+勇敢善战 11.2616203224
+全勤奖 12.8020653633
+没毛大虫 13.2075304714
+宦刘瑾 13.2075304714
+相帮 9.93038573842
+那紫鹃 12.2912397395
+西海 10.2630914922
+乃翁 12.5143832909
+蜀葵 11.598092559
+花蜜 10.2371160058
+戏剧界 10.7226238216
+平阳侯 12.1089181827
+新闻界 9.75754292558
+布洛芬 11.5027823792
+爆炸性 9.63799777493
+解卫州 12.5143832909
+魏史 12.2912397395
+融冻 12.2912397395
+液碱 13.2075304714
+荆南府 13.900677652
+教你做 12.1089181827
+还慢 12.5143832909
+空磨子 13.900677652
+谢意 10.3453295905
+葬身 10.4994802703
+老港 10.5684731418
+制毒 12.5143832909
+地质年代 10.0088573539
+怯懦 9.62401153296
+柳若明 11.4157710022
+闻出 12.2912397395
+西流 10.3743171274
+真受不了 12.8020653633
+制模 13.2075304714
+决不能 8.35160156708
+济公 11.598092559
+纷乱如麻 12.2912397395
+武鼓 13.900677652
+南马河 11.8212361103
+西河 9.58318953844
+储雷 13.2075304714
+炕床 11.598092559
+夏秋季 10.7226238216
+巍然 10.533381822
+出岔子 12.1089181827
+大中小型 10.765183436
+倒悬 10.2117981979
+魏制 12.8020653633
+律师团 11.3357282945
+名列首位 13.2075304714
+紫烟 11.8212361103
+西沟 11.7034530746
+一防 12.8020653633
+蒋翊武 11.9547675029
+曲尺形 12.1089181827
+收受贿赂 11.0674643079
+旷世 11.9547675029
+咳嗽病 13.900677652
+曲文宝玉 13.2075304714
+大足县 11.8212361103
+宅院 9.61021821083
+麦克默 12.1089181827
+四百六十七目 13.2075304714
+相忘 11.5027823792
+疏菜 13.900677652
+魏刚 13.2075304714
+西沉 11.0103058941
+广施法 12.2912397395
+硬汉子 11.2616203224
+慈惠 12.8020653633
+储集 12.1089181827
+犁刀 11.0103058941
+西泽 13.900677652
+吼声 9.93038573842
+数十户 11.9547675029
+风华高科 11.9547675029
+一草 11.8212361103
+数息 13.2075304714
+科尔特斯 10.7226238216
+教条主义者 11.8212361103
+鸡翅 11.8212361103
+奔走相告 10.8096351986
+奉化 10.4041700905
+小熊猫 9.80633308975
+一二尺 12.2912397395
+西泠 12.1089181827
+魁元 12.5143832909
+相律 12.1089181827
+还惨 13.900677652
+排字 11.1280889297
+排子 13.900677652
+俞涉 13.900677652
+慈悲 9.24671730182
+岩盐 9.59661255877
+西法 11.1926274509
+叶璇 12.8020653633
+泥封 11.9547675029
+克里姆林宫 10.4041700905
+建管局 13.900677652
+岩盖 12.8020653633
+汤盆 13.2075304714
+氧化亚氮 13.900677652
+碰头会 11.5027823792
+南微 13.900677652
+侍读学士 10.4666904475
+排下 11.4157710022
+相得 11.9547675029
+槽头 11.9547675029
+特色菜 13.900677652
+睡来 13.900677652
+相形 11.1280889297
+几吨 11.8212361103
+西水 10.8096351986
+谢恩 8.20694551317
+矮秆 12.5143832909
+浪峰 12.8020653633
+后会有期 11.1280889297
+吕师爷 13.900677652
+河宽谷 11.9547675029
+空空儿 13.900677652
+扬州 7.31726842982
+长途飞行 13.900677652
+霸王花 13.900677652
+蒙哥汗 10.8096351986
+还怕 8.74162235276
+李付一 13.900677652
+狄塞尔 11.9547675029
+龟兹王 11.9547675029
+拾破烂 12.5143832909
+安可 11.2616203224
+排定 10.604840786
+几名 8.30225569298
+东法兰 13.900677652
+诸葛 9.12999302751
+紫灰 12.8020653633
+辅因子 12.1089181827
+甭想 10.3171587135
+灰泥 11.4157710022
+相当 5.61566875653
+达林顿 12.8020653633
+大百科全 13.900677652
+布洛阿 12.5143832909
+香橼 12.8020653633
+以防不测 10.5684731418
+光盘版 13.900677652
+唐王朱 11.9547675029
+泥岩 9.94943393339
+易生成 12.2912397395
+几周 8.9308643524
+灰沙 12.5143832909
+对松山 12.5143832909
+诸营 11.1280889297
+几味 11.5027823792
+液流 12.8020653633
+磨刀石 12.8020653633
+慈怀 13.2075304714
+三十一次 13.900677652
+宝日吉 12.5143832909
+高超无比 13.900677652
+抄网 12.8020653633
+西江 9.07236391467
+嵇中散集 12.8020653633
+周康王 12.8020653633
+相异 9.91169360541
+趁火打劫 10.3171587135
+梁掌柜 12.1089181827
+千艘 12.5143832909
+骂声 9.89334446674
+龙凤呈祥 12.1089181827
+贝尔格 12.1089181827
+布莱斯坦 12.2912397395
+消化科 12.8020653633
+欠收 12.5143832909
+几员 10.9562386728
+有限花序 12.8020653633
+孟加拉 9.16447920358
+篇首 12.2912397395
+芝加哥商品交易所 11.1926274509
+洛林 9.46986085313
+科萨尔 13.900677652
+一者 10.0505300503
+实验学校 11.7034530746
+国库券 10.4666904475
+西澳 11.0674643079
+水月观音 12.1089181827
+一亿零一百万两 13.900677652
+资本家 6.5540224888
+成群结队 9.22784881751
+食用笋 13.900677652
+还排 12.2912397395
+勤洗勤换 13.900677652
+中提琴手 13.900677652
+阿斯特拉 11.9547675029
+倒排 11.9547675029
+简明新闻 13.900677652
+弱项 12.8020653633
+堵起来 12.5143832909
+老泪 11.4157710022
+顾三麻子 12.8020653633
+相峙 10.8561552143
+谢提 13.2075304714
+百倍千倍 13.900677652
+一瞬即逝 12.8020653633
+错失良机 10.8561552143
+杨匆匆 13.2075304714
+扬帆 10.0294766411
+光彩起来 13.900677652
+魏公 11.0103058941
+壶盖 12.1089181827
+翠微路 12.8020653633
+三十块 11.0103058941
+王之治 13.900677652
+陈平 9.98865464655
+紫玉 12.5143832909
+刍议 11.5027823792
+土地管理法 11.0674643079
+千里目 13.900677652
+紫铜色 12.5143832909
+心眼小 12.8020653633
+一联 10.3743171274
+钟繇 10.533381822
+魏兵 8.89673134603
+魏兴 12.2912397395
+五六斤 11.3357282945
+以工代干 13.900677652
+液滴 10.0940151622
+向左转 10.4994802703
+淡豆豉 13.900677652
+倒插 11.8212361103
+听信 9.08039608637
+陶希圣 11.8212361103
+西濒 9.87532596124
+一百四十三公里 13.2075304714
+老河 11.0674643079
+哈维尔 12.8020653633
+寒温带 9.30555780184
+爬格子 13.900677652
+由中 10.2117981979
+考校 12.8020653633
+商品生产者 9.96885201925
+岩画 9.65218240993
+洛朗 11.7034530746
+达特 11.4157710022
+老汉 7.50374799676
+岩田 13.900677652
+率兽食人 12.8020653633
+出纳员 11.9547675029
+许昌市 9.71102290995
+听众 9.0884932966
+分体 13.900677652
+甭提 10.9049453784
+疑惧 9.80633308975
+划不来 11.7034530746
+几场 10.0940151622
+花蕊 10.8561552143
+听会 12.5143832909
+京东 9.80633308975
+赫利奥 12.8020653633
+疑惑 7.51886163457
+一股 6.36858950843
+宅门 12.1089181827
+魏冉 11.598092559
+前些时日 13.900677652
+活佛 8.83808261895
+几圈 9.62401153296
+老汪 9.32596667347
+金葫芦 13.2075304714
+花蕾 10.1630080337
+蒙特哥 12.8020653633
+两千五百 11.4157710022
+考核 7.71652876104
+魏军 9.25628675283
+乘便 12.8020653633
+倒挂 8.57766767284
+宝庄 13.2075304714
+中华全国妇女联合会 12.1089181827
+灌起来 13.900677652
+抢炮 13.900677652
+保护局 12.5143832909
+济助 13.900677652
+姚二郎 12.5143832909
+申生 11.7034530746
+都兰 12.2912397395
+神机营 10.9562386728
+一胎 11.2616203224
+叶铁桥 13.900677652
+吴邦国 10.3743171274
+一胖 12.1089181827
+满足需要 10.0294766411
+倒换 9.80633308975
+死地求生 13.900677652
+听作 12.8020653633
+宋师爷 9.69598503258
+沈家本 11.5027823792
+谢持 11.0674643079
+西潘 13.900677652
+偃武修文 11.7034530746
+测血压 12.5143832909
+集线器 13.900677652
+舐食 11.8212361103
+新翼 13.900677652
+尼尚特 13.2075304714
+斯堪地那 13.900677652
+少说两句 12.2912397395
+李西涯 12.8020653633
+咧咧嘴 13.2075304714
+几块 8.52078029844
+东方汽轮机厂 12.8020653633
+排头 11.598092559
+相差 7.63727938938
+慕克吉 13.2075304714
+玉金帛 13.2075304714
+由余 12.1089181827
+搅黄 11.598092559
+某报 12.2912397395
+相左 10.3171587135
+听事 13.900677652
+盖成 11.2616203224
+高山峰 13.2075304714
+措置 10.2897597393
+温情脉脉 11.2616203224
+哪天 9.23723855786
+一脚 7.76945116249
+性贫血 10.642581114
+骂娘 10.3171587135
+巧妇难为无米之炊 11.598092559
+普拉霍 13.900677652
+字形编码 13.900677652
+鞑子 8.65893063692
+那洁静 13.2075304714
+同步卫星 12.2912397395
+蜕变 9.72629038208
+微点 12.8020653633
+一隅 9.37888907493
+倒折 13.2075304714
+谢拉 11.9547675029
+西源 10.604840786
+一脱 11.5027823792
+相州 10.2630914922
+货运公司 11.9547675029
+蓬蓬勃勃 11.8212361103
+硫酸银 13.900677652
+南平 9.54396882529
+一脸 7.53077666915
+听人 9.31571017331
+倒把 8.9519177616
+盖房 9.46986085313
+几团 11.4157710022
+榆次人 13.2075304714
+远比 9.14708746087
+马领兵 12.8020653633
+扬弃 10.1630080337
+杜武库 13.2075304714
+听从 8.1417758781
+排好 10.7226238216
+活产 13.900677652
+一腔 9.23723855786
+闭目养神 10.4041700905
+景耀 11.8212361103
+融券 8.53470163695
+西满 12.5143832909
+几国 11.5027823792
+生意兴隆 10.6818018271
+张牙 13.900677652
+流浆箱 13.900677652
+大呼拉尔 13.2075304714
+夏秋多 11.9547675029
+花蒿 12.5143832909
+质粒 11.0674643079
+高级轿车 9.93038573842
+活了 8.9308643524
+钟罩 13.900677652
+伊萨克 12.1089181827
+向东虏 13.2075304714
+几回 9.32596667347
+一腿 10.8561552143
+疑意 13.900677652
+面包房 11.1926274509
+邋里邋遢 12.1089181827
+古生界 10.2630914922
+执而不化 13.900677652
+西游 10.4666904475
+消化管 10.604840786
+敢出去 13.2075304714
+矾石 13.900677652
+听上 13.900677652
+西港 12.2912397395
+玄武岩 8.53938548627
+阿特巴拉河 12.8020653633
+塞尔吉 13.900677652
+燕知草 13.900677652
+民政工作 13.2075304714
+兴趣正浓 13.2075304714
+西渡 11.0674643079
+负离子 9.74179456862
+曹天钦 13.2075304714
+花葶 12.1089181827
+封丘城 11.8212361103
+新线 11.0103058941
+塑料管道 13.900677652
+西渐 13.2075304714
+黄曲霉 11.5027823792
+防控 8.42003872863
+新约 9.74179456862
+北京市委 11.7034530746
+倒戈 9.59661255877
+诠注 13.900677652
+一部分一 13.900677652
+听丹 13.900677652
+一臂 11.1280889297
+还手 10.1630080337
+诸酋 12.5143832909
+盖拉 11.5027823792
+法亦仿 13.2075304714
+里韦拉 12.8020653633
+玄武峰 12.8020653633
+命苦 9.96885201925
+迪戈加西亚岛 12.8020653633
+倒扣 10.9049453784
+红三军团 12.2912397395
+哈勒姆 12.1089181827
+经承天 12.5143832909
+新经 12.5143832909
+疾书 11.5027823792
+阻止 6.99392287333
+槽孔 13.900677652
+篇页 13.900677652
+全高清 13.2075304714
+第五十九回 12.2912397395
+蜗轮 11.7034530746
+蜕化 11.0674643079
+花落 10.1394775363
+新绿 11.0674643079
+淳化阁 11.7034530746
+童贯军 12.8020653633
+马纳罗 13.900677652
+利钱 11.4157710022
+母兄弟 13.900677652
+一致 6.1882338177
+日坛 12.8020653633
+活上 13.2075304714
+农豪商 12.8020653633
+倒手 12.8020653633
+康熙皇帝 11.2616203224
+大俗大雅 13.900677652
+和庆郡 13.900677652
+晋静公 12.8020653633
+奥伊廷 13.2075304714
+诸臣 9.36807815882
+书志 12.8020653633
+不吐骨头 13.2075304714
+花菜 11.7034530746
+半工半读 11.0674643079
+发面饼 13.900677652
+数十条 10.9049453784
+联产品 13.2075304714
+花菇 13.2075304714
+俏皮话 11.0674643079
+陈安琪 13.900677652
+莆田县 12.1089181827
+疮疖 11.598092559
+农业科研 11.4157710022
+里一明 13.2075304714
+接种率 11.2616203224
+基元电荷 12.1089181827
+主力军 9.20019728618
+唐廷派 12.8020653633
+疮疡 10.8096351986
+森木塞姆 12.8020653633
+疮疤 11.3357282945
+自取其祸 12.2912397395
+几册 13.900677652
+艾思奇 11.9547675029
+砍伐森林 11.5027823792
+排布 10.9049453784
+加盟商 10.7226238216
+家累千金 13.900677652
+凯迪拉克 9.18217878068
+斯卡尔 13.900677652
+几几 12.5143832909
+炸鸡 12.2912397395
+弯身 10.7226238216
+束缚 7.84389363875
+夏秋常 12.2912397395
+疮痂 12.8020653633
+谢斯 12.8020653633
+扩张期 10.8096351986
+锥面 11.3357282945
+岁寒 11.9547675029
+塞萨洛尼基 12.1089181827
+几出 11.5027823792
+地域系统 12.5143832909
+通观 13.900677652
+唇舌 10.6818018271
+宛州 11.0103058941
+疑是 10.604840786
+西铁木 12.8020653633
+旱冰场 13.900677652
+谢文 13.2075304714
+鉴定人 11.8212361103
+巩永固 10.9049453784
+犁地 10.4994802703
+丁巡抚 13.2075304714
+故事类 13.900677652
+大湖地区 11.5027823792
+于顺帝 12.8020653633
+侯府亲 13.900677652
+都城 7.52395070408
+毫不逊色 10.2371160058
+持身 13.900677652
+德扎格 12.5143832909
+步童贯 13.2075304714
+谭献 13.2075304714
+后效 13.2075304714
+聚苯硫醚 11.9547675029
+蒙特勒 13.2075304714
+防撞 11.0103058941
+塔娜用 12.8020653633
+排座 13.2075304714
+黎巴嫩山 12.8020653633
+花草 9.27570483869
+粮行 11.1280889297
+白塔山 11.7034530746
+几儿 12.1089181827
+为国分忧 12.8020653633
+远水 12.1089181827
+杜比 12.5143832909
+丝麻 11.4157710022
+乙二胺四乙酸 11.9547675029
+徐大爷 11.1280889297
+花荣 8.29487558568
+还放 10.2117981979
+还政 11.8212361103
+忿争 12.8020653633
+鉴定书 12.1089181827
+旷废 12.8020653633
+入魔 12.8020653633
+夕照山 12.1089181827
+排序 9.12999302751
+还收 11.2616203224
+未娶 11.9547675029
+花药 10.1164880181
+叶无柄 12.5143832909
+西楼 11.4157710022
+倒数 9.28555713513
+几十篇 12.5143832909
+数十架 11.8212361103
+水力发电量 12.5143832909
+眉目清秀 11.3357282945
+卷云 11.3357282945
+讷讷 10.3171587135
+消化系 12.5143832909
+还教 11.2616203224
+几具 10.9049453784
+凡尘 11.4157710022
+数十枪 12.8020653633
+中国戏曲学院 12.2912397395
+一帮人 10.7226238216
+琅琅的 13.900677652
+花茎 11.0103058941
+傻冒 12.8020653633
+借尸还魂 11.5027823792
+几兆 12.1089181827
+西楚 11.7034530746
+大马帮 13.900677652
+花茶 10.1164880181
+还敢 9.03314320152
+几克 12.5143832909
+数十枚 12.5143832909
+钻孔 9.38981814546
+暴怒之下 13.2075304714
+李家庄 11.0103058941
+申猴 12.8020653633
+血制品 11.9547675029
+新秦 12.8020653633
+拢络 13.2075304714
+推理 8.44535653662
+琅琊山 13.2075304714
+白羊王 12.1089181827
+花苑 10.9049453784
+萧纶 13.2075304714
+轮回亲本 13.2075304714
+寻父 12.8020653633
+花苗 12.8020653633
+十万零四千四百多门 13.2075304714
+天罗地网 10.4666904475
+孙家正 13.900677652
+老母 8.80081122415
+花苞 11.2616203224
+相对 4.96648611664
+萧红 12.1089181827
+万亿日元 8.92394390956
+吴趼人 13.2075304714
+老毛 12.8020653633
+一百位 13.900677652
+众军 8.96620371885
+杯盘 9.96885201925
+苗头 9.22784881751
+远涉 10.7226238216
+既得利益 10.0088573539
+县委会 13.2075304714
+正大光明 10.4994802703
+出纳台 13.2075304714
+掠过 8.36728816325
+生日歌 13.2075304714
+宣夜说 11.5027823792
+浪漫情怀 12.1089181827
+林海雪原 11.9547675029
+掌握主动 11.4157710022
+在我看来 9.12155415886
+杨三 11.9547675029
+排开 10.0505300503
+泥塘 11.0103058941
+排异 11.1926274509
+扎破 11.2616203224
+欺诳 12.2912397395
+泥塑 9.24671730182
+勃勃生机 11.0103058941
+西梁 13.2075304714
+推病 11.0103058941
+兽医学 10.604840786
+一下四周 11.5027823792
+入骨 10.7226238216
+中国人民政治协商会议 9.02548032877
+萧绰 13.2075304714
+窥知 11.9547675029
+老残 13.900677652
+高中同学 11.8212361103
+裹伤 11.5027823792
+西森 12.2912397395
+学道 10.604840786
+锅底朝天 13.900677652
+合同范本 13.900677652
+防敌 12.2912397395
+寻物 13.900677652
+不信任感 11.8212361103
+第二十七位 13.2075304714
+相守 10.8096351986
+相安 11.3357282945
+荷兰王国 11.8212361103
+疆土 9.03314320152
+补充侦查 11.1926274509
+战国七雄 10.7226238216
+融合 7.166085992
+爹娘 8.91707103027
+郑崇俭 9.74179456862
+毛世来 13.900677652
+垫过来 13.900677652
+相宜 9.69598503258
+籍守制 12.8020653633
+萧绎 11.1926274509
+钟祥 10.5684731418
+仿射变换 13.2075304714
+花芯 12.2912397395
+个人档案 12.1089181827
+齿轮油 12.8020653633
+相学 12.1089181827
+老歌 11.598092559
+弗雷格 11.598092559
+慎言谨 13.900677652
+入驻 9.00283785202
+吉米扬 13.2075304714
+三皇五帝 10.9049453784
+远洋 8.25877058104
+钟离 11.3357282945
+窥看 11.7034530746
+名门望族 11.7034530746
+朴拙 11.1926274509
+主潮 12.2912397395
+地磁极 11.0103058941
+硬碰硬 10.2897597393
+房东太太 12.8020653633
+咒骂 9.37888907493
+冰坝 12.1089181827
+灯心绒 13.900677652
+肚皮舞 13.2075304714
+排律 11.3357282945
+乔治湖 13.2075304714
+官方网 11.8212361103
+廉惠山 13.2075304714
+温存 9.54396882529
+傻傻 10.9562386728
+食用糖 13.900677652
+鉴定会 12.8020653633
+陈实功 12.8020653633
+花舞 12.8020653633
+魏国 8.73589167805
+排忧 12.8020653633
+入院 9.89334446674
+奥伊根 13.900677652
+远流 13.2075304714
+旧衣服 10.5684731418
+沙瓤 12.5143832909
+吴金 13.2075304714
+两款 8.66423568915
+谢生 13.900677652
+防旱 13.2075304714
+发布命令 10.2371160058
+娄烦 12.2912397395
+融和 11.1280889297
+弑君 11.0674643079
+藏青 11.2616203224
+国省道 13.2075304714
+行业动态 11.0103058941
+大旗网 13.2075304714
+纪山北 13.2075304714
+花舫 13.900677652
+清末 7.59805867623
+锦石 12.2912397395
+律师函 12.1089181827
+枯草 9.91169360541
+黄鹏 12.8020653633
+哈勒尔 12.5143832909
+西段 8.70218062071
+排尿 9.34680076038
+岳阳县 12.8020653633
+眉棱 12.5143832909
+从容自若 12.2912397395
+和晖晖 13.900677652
+安安心心 11.9547675029
+相声 9.72629038208
+儿子 5.60463000921
+史静寰 13.900677652
+人谋不臧 13.2075304714
+香花供养 13.900677652
+顺从 8.81927328699
+懒散 10.765183436
+一营 9.36807815882
+巨梁 12.1089181827
+储金 13.2075304714
+枯荣 12.2912397395
+焦化厂 11.8212361103
+中央团校 13.900677652
+搞好学习 13.900677652
+紫石 11.0103058941
+谢某 11.7034530746
+储量 7.25039860339
+唐王惊 13.2075304714
+远溯 11.9547675029
+对苯二胺 12.5143832909
+水解反应 11.0103058941
+几口 8.28754954559
+几叠 13.2075304714
+老梅 11.7034530746
+越做越 10.4994802703
+颤动 9.01032852375
+小组长 11.9547675029
+几只 7.86280673205
+明澈 11.9547675029
+顺产 11.9547675029
+克萨尔 12.5143832909
+绘像 11.7034530746
+法尔斯省 12.8020653633
+万端 11.1926274509
+几台 11.3357282945
+阎立 13.900677652
+辙乱旗靡 13.2075304714
+周官徵 13.2075304714
+连济度 12.8020653633
+业务范围 9.48183704418
+装腔作势 10.4041700905
+乃祖 13.2075304714
+数十支 12.8020653633
+流体 8.089536659
+粘贴 10.3453295905
+制浆 11.7034530746
+晃来晃去 10.9049453784
+酌加 11.598092559
+腾讯网 11.4157710022
+几双 11.1280889297
+上官大夫 12.2912397395
+谢林 10.604840786
+那板儿 12.5143832909
+过顶球 13.900677652
+束紧 12.1089181827
+二万五千名 13.900677652
+受刑者 11.8212361103
+盾皮鱼类 11.8212361103
+还有 4.02764930692
+防暑 11.9547675029
+偶们 13.900677652
+细挑 13.900677652
+印第安人 7.85804481829
+星系团 10.2117981979
+帝异 12.8020653633
+马和狗 12.8020653633
+安国君 13.900677652
+还望 9.49395840471
+藤篮 12.8020653633
+克雷芒 11.3357282945
+萧索 11.4157710022
+赫鲁晓夫 9.75754292558
+几区 13.900677652
+中国人民政治协商会议全国委员会 10.3453295905
+几匹 10.3743171274
+贯彻 7.93453091285
+倒推 12.2912397395
+防暴 11.8212361103
+顺乎 11.9547675029
+日丽风清 13.900677652
+海象 10.1164880181
+还本 10.765183436
+几包 10.6818018271
+马达加斯加 9.21854642485
+屏门 11.7034530746
+远游 10.9562386728
+帐额 13.2075304714
+搔头皮 13.2075304714
+孟合己 12.8020653633
+陨石坑 11.0674643079
+词频 13.900677652
+日益减少 10.765183436
+一党制 10.8561552143
+乌兰察布草原 12.8020653633
+泰米尔 11.0103058941
+单连域 13.2075304714
+党性修养 11.2616203224
+传达出来 11.4157710022
+乡土气息 10.2371160058
+双成 12.2912397395
+请多关照 13.2075304714
+隐瞒不住 13.2075304714
+库存服装 13.900677652
+控制不了 11.0674643079
+受骗人 13.900677652
+老树 9.55687223012
+车同轨 12.1089181827
+疏落 11.9547675029
+新篁 12.8020653633
+数十斤 12.1089181827
+新篇 11.5027823792
+猞猁 9.93038573842
+倒杯 13.2075304714
+亚述学 11.9547675029
+睡态 13.2075304714
+报效祖国 11.9547675029
+锌黄 13.900677652
+几十 8.80081122415
+鞭毛蛋白 13.900677652
+规定性 10.1164880181
+海底捞月 12.8020653633
+六畜兴旺 13.2075304714
+美国杜克大学 12.5143832909
+花脸 10.8096351986
+衍义 10.8096351986
+张治国 11.5027823792
+尽些 13.2075304714
+还来 9.63799777493
+利兹鱼 13.2075304714
+海南大学 13.2075304714
+女议员 13.900677652
+顺世 12.2912397395
+林昭亮 13.2075304714
+顾颉刚 10.4349417492
+贻害无穷 13.900677652
+应对 6.2353929335
+分辨本领 11.1280889297
+全体同学 13.900677652
+赤兔马 10.642581114
+墨海书 11.9547675029
+住房补贴 11.4157710022
+几动 12.1089181827
+德奥意 13.2075304714
+老槐 12.5143832909
+银行业 6.78023327958
+秦都区 13.2075304714
+紫盖 12.2912397395
+扬子 9.35738286971
+魏吴 12.5143832909
+新税 12.1089181827
+赔上去 13.900677652
+推知 10.604840786
+锦盒 11.1280889297
+索儿 12.2912397395
+麦克风 10.8561552143
+唇腺 13.900677652
+官家可 12.8020653633
+亚利山 13.900677652
+草成 12.2912397395
+轮过来 13.900677652
+跑哮 13.900677652
+外周血 11.1280889297
+元霄 13.900677652
+人人平等 10.1394775363
+躲过去 12.2912397395
+国家经济贸易委员会 13.900677652
+方用杏 12.8020653633
+几星期 11.2616203224
+抓纲治国 12.8020653633
+四平八稳 11.8212361103
+顺便 8.05713323494
+多维尔 13.900677652
+几勺 13.2075304714
+卢卫国 12.5143832909
+斩关夺隘 13.900677652
+翻云覆雨 11.0103058941
+穆林斯 13.900677652
+景宗陵 13.2075304714
+众口 11.3357282945
+充填 9.55687223012
+浏阳县 11.7034530746
+能去 11.0103058941
+拭目 12.8020653633
+紫皮 11.8212361103
+性格演员 13.2075304714
+花肥 12.5143832909
+玄德见 10.8561552143
+记下来 10.2371160058
+护发 10.9562386728
+应用光学 12.1089181827
+疮痍 11.9547675029
+孟加拉国 9.66657114738
+巴彦温 13.2075304714
+往里面 9.85762638414
+西樵 12.2912397395
+鳄鱼 10.1871055853
+坑洼 10.8096351986
+诸艺 12.8020653633
+掠走 11.0674643079
+倒映 11.0103058941
+绿衣使者 13.900677652
+相好 9.12999302751
+诸色 10.4349417492
+不值一驳 12.1089181827
+弓短箭 12.2912397395
+贝尔湖 11.4157710022
+飞行队 10.765183436
+紫癜 10.533381822
+报警器 11.1280889297
+同价 10.1164880181
+云天化 10.5684731418
+几分 7.31726842982
+还是 3.98442196016
+混不下去 11.0674643079
+一百圈 12.8020653633
+下丘脑 9.18217878068
+游行者 13.2075304714
+章子怡 10.0088573539
+坑洞 11.3357282945
+几划 13.2075304714
+词首 11.9547675029
+凤哥儿 12.1089181827
+合作项目 9.30555780184
+大汶河 11.3357282945
+槽式 12.5143832909
+几则 12.2912397395
+上甘岭 11.5027823792
+不加思索 11.2616203224
+相夫 12.1089181827
+旷工 13.2075304714
+嘎嘎响 12.8020653633
+夏尔马 13.2075304714
+水夫谣 12.8020653633
+诸般 9.96885201925
+新站 12.5143832909
+粗制品 13.900677652
+克森和 13.900677652
+采矿工业 11.2616203224
+郭勋 13.2075304714
+集体化 10.4666904475
+终成眷属 11.4157710022
+唇膏 9.94943393339
+新立 10.8096351986
+太古民 13.2075304714
+铜盆 10.4349417492
+怠忽 11.8212361103
+黑店 12.5143832909
+利器 9.30555780184
+阳畦 13.2075304714
+新竹 9.94943393339
+高度文明 11.8212361103
+睡意 9.37888907493
+便条纸 13.900677652
+儿皇帝 11.3357282945
+生命科学 9.44633035572
+新章 12.5143832909
+砷化物 12.5143832909
+一字一板 11.598092559
+宅邸 10.1871055853
+赛塞尔 13.2075304714
+连老大 13.900677652
+张叔夜 10.765183436
+夏菊花 13.2075304714
+轴套 12.8020653633
+郭勒 13.900677652
+杨忙 12.5143832909
+巴巴多斯 10.4994802703
+消化性 11.0674643079
+赵翼 11.2616203224
+遥闻 12.1089181827
+落后面貌 11.5027823792
+汤志钧 11.9547675029
+出点子 11.5027823792
+范天顺 13.2075304714
+露水夫妻 13.900677652
+卢纳桥 13.2075304714
+张丽华 13.2075304714
+松江鲈 12.1089181827
+紧张度 11.8212361103
+碧莹莹 13.900677652
+蒙大圣 12.2912397395
+美艳 10.7226238216
+谢秀 13.900677652
+故事性 11.2616203224
+储运 10.642581114
+由命 12.8020653633
+新政 8.11685246965
+远点 11.0674643079
+梁小姐 10.4666904475
+诸公皆 13.900677652
+绞缠 11.9547675029
+西疆 13.900677652
+鲁克 12.8020653633
+陆栖动物 11.9547675029
+多种不同 10.2630914922
+混频 11.9547675029
+均位力积 13.900677652
+绥远 9.6811699468
+工程图纸 12.8020653633
+新教 8.25170341381
+洪剑涛 12.5143832909
+周贵妃 13.2075304714
+钟摆 10.642581114
+森林狼队 12.8020653633
+不留余地 11.598092559
+运行部 12.5143832909
+大客车 10.765183436
+连合 11.0103058941
+气吞山河 11.8212361103
+幸徽笞 13.2075304714
+护庇 11.9547675029
+轴头 12.5143832909
+贝蕾 13.2075304714
+一马 10.1630080337
+副团长 10.1394775363
+避嫌 10.7226238216
+寨里 9.18217878068
+刘恢 13.2075304714
+舒莲记 13.2075304714
+一驾 11.3357282945
+慈禧 7.27661242418
+乌石 12.8020653633
+沁人心脾 10.8096351986
+外分泌 11.5027823792
+西画 10.8561552143
+子纽林 13.2075304714
+每天 5.81734904319
+夺冠 10.3453295905
+百分百 10.9049453784
+利害 8.17382990439
+一阵子 8.13235665618
+西甲 11.8212361103
+投资国 10.604840786
+第二两次 13.900677652
+新文 13.900677652
+重叠式 12.8020653633
+岩漠 13.2075304714
+中国人民革命军事博物馆 12.1089181827
+老人头 13.2075304714
+新新 11.5027823792
+紫楠 12.8020653633
+纪山之 13.2075304714
+小庄子 13.900677652
+一千三四百 13.2075304714
+新方 12.8020653633
+曲词儿 13.2075304714
+利安 11.4157710022
+贝萨里 12.8020653633
+命馆 12.8020653633
+西柏坡 10.533381822
+还礼 9.21854642485
+数十篇 10.9049453784
+见容 12.2912397395
+谢神 12.2912397395
+米村 12.2912397395
+康家庄 13.2075304714
+撕烂 11.598092559
+承恩殿 12.5143832909
+前套 12.8020653633
+花鼓 11.2616203224
+蹂躏 9.05649056552
+艺术剧院 10.4666904475
+奥菲利 13.2075304714
+艰危 11.7034530746
+防磁 13.2075304714
+热菜 10.7226238216
+疑窦 11.3357282945
+谢礼 11.4157710022
+一高 10.765183436
+三千多块 13.900677652
+倒票 11.1926274509
+白影 11.5027823792
+卓着 11.8212361103
+护师 13.2075304714
+三百余户 12.8020653633
+新旺 13.900677652
+多请 13.2075304714
+身心愉快 13.2075304714
+张骏祥 13.2075304714
+沁人心腑 13.900677652
+李剑农 12.5143832909
+老套子 12.5143832909
+花鼠 11.5027823792
+是夜 8.96620371885
+笃疾 12.8020653633
+竞开 12.2912397395
+一路平安 10.765183436
+每套 10.1164880181
+玉米芯 11.9547675029
+地广兵 13.2075304714
+控股权 9.5062284973
+杨延朗 13.900677652
+展宽 9.7898037878
+尽兴 10.0720362555
+尽其 12.1089181827
+尖声高叫 12.5143832909
+沁人心肺 13.2075304714
+奥涅格 12.2912397395
+马纳斯 13.900677652
+寇慎 13.2075304714
+避害 12.2912397395
+岩溶 10.2897597393
+俯望 13.900677652
+花黄 13.900677652
+卡黄素 13.900677652
+好几趟 11.4157710022
+展室 11.4157710022
+奥格斯堡 11.0674643079
+假文凭 13.900677652
+禁不起 10.7226238216
+寄钱 10.8096351986
+钟放 13.900677652
+陈廷敬 12.5143832909
+南平市 11.598092559
+乃是 7.33259974056
+谦词 12.2912397395
+社团组织 12.5143832909
+唇齿 10.642581114
+骨灰箱 13.900677652
+展场 12.5143832909
+无子嗣 12.5143832909
+斯尼德 12.5143832909
+计划体制 12.8020653633
+生活实践 11.1280889297
+八府巡按 13.900677652
+欣赏者 12.1089181827
+翻为 12.8020653633
+鳙鱼 12.5143832909
+金线绣 12.2912397395
+预备性 12.5143832909
+郭有恒 10.9562386728
+师于吉 13.2075304714
+明智之举 10.642581114
+打牙祭 11.8212361103
+束成 13.2075304714
+岩滩 11.2616203224
+娄江 11.598092559
+乘员 8.03704647638
+克拉科夫 10.604840786
+澳门航空公司 13.900677652
+被告人 8.44963919841
+魏奔楚 13.2075304714
+何老凤 12.2912397395
+迪斯尼乐园 9.34680076038
+双林寺 13.2075304714
+活塞环 12.8020653633
+西瓜 8.28754954559
+封晋国 11.9547675029
+制片 9.85762638414
+制版 10.642581114
+贾政叹 12.2912397395
+抄查 12.1089181827
+避寒 10.7226238216
+实习课 13.2075304714
+修理店 13.900677652
+郭廷 12.8020653633
+郭延 13.2075304714
+国家杜马 10.8096351986
+玉米秆 13.2075304714
+封大怒 13.2075304714
+就席 12.8020653633
+肾病 8.93783302172
+旅游圈 13.2075304714
+锦州市 10.9562386728
+阵痛 10.3171587135
+抄有 13.900677652
+听后 9.4233408375
+边疆民族 11.7034530746
+西琳 13.900677652
+齿落舌钝 13.900677652
+活命 9.20019728618
+陆小四 13.2075304714
+秦钟一一 13.2075304714
+罗洛宏 12.5143832909
+夹个 13.2075304714
+马钰之 13.900677652
+疟蚊 12.8020653633
+盖碗 10.642581114
+钟文 13.900677652
+鹅卵石 10.0940151622
+斗篷 9.26594866375
+抄本 9.22784881751
+寻源 13.2075304714
+分散介质 12.5143832909
+贝特洛 12.8020653633
+绞纱 13.2075304714
+听听 7.52565283215
+南海岸 11.7034530746
+花鹿 12.5143832909
+王孔目 12.8020653633
+灰瓦 11.9547675029
+砷化氢 12.8020653633
+网络攻击 12.2912397395
+以退为进 11.1926274509
+连台本戏 12.2912397395
+措施 5.49486304854
+巨柱 11.7034530746
+疾呼 11.2616203224
+每名 10.6818018271
+人性化 9.19114745066
+普通农民 11.5027823792
+一部分周 13.2075304714
+武斌 13.900677652
+士诚 13.2075304714
+弗勒吕斯 12.2912397395
+杭汉站 12.2912397395
+伦皮拉 13.900677652
+祖日桓 13.900677652
+律师业 11.598092559
+七千五百 13.2075304714
+避孕 9.75754292558
+民事纠纷 10.8561552143
+杨秀清 10.5684731418
+活吃 13.900677652
+就座 9.89334446674
+锦标 11.7034530746
+听命 10.0720362555
+保健专家 13.900677652
+五六日 12.1089181827
+金兰语 13.2075304714
+郎与纯 13.900677652
+修理工 11.598092559
+李冰修 13.2075304714
+异乡人 11.9547675029
+控股方 12.2912397395
+道行军 11.1926274509
+刮开 12.1089181827
+轴孔 13.900677652
+轴子 13.900677652
+利夫 13.900677652
+清君侧 10.3743171274
+卡隆特 13.2075304714
+而后快 11.1926274509
+见外 9.93038573842
+王熊通 13.2075304714
+新朋 12.8020653633
+新月 6.78509552579
+灯用煤油 13.2075304714
+洛美 11.4157710022
+老人家 7.68606955355
+剖宫产 10.765183436
+千里眼 10.8561552143
+说来说去 10.0088573539
+利多 8.83177344976
+老瓦 11.8212361103
+见天 10.6818018271
+几例 11.5027823792
+秋露白 12.8020653633
+粪筐 12.8020653633
+评论界 10.7226238216
+啸聚 11.9547675029
+性伙伴 12.2912397395
+何占豪 13.2075304714
+滇红 10.8096351986
+手爪 11.9547675029
+活埋 9.40086798165
+帝御 13.900677652
+中古时代 12.2912397395
+匿名信 10.765183436
+李剑华 12.8020653633
+搭住 10.765183436
+灰市 12.1089181827
+泽鲁阿勒 13.900677652
+新村 9.46986085313
+利好 6.48972577639
+原大 10.8561552143
+大公让 13.900677652
+态度顽固 12.5143832909
+哑巴吃黄连 12.5143832909
+顺势 8.24818847171
+弱者 9.37888907493
+护岸 11.1280889297
+邓元觉 11.3357282945
+乘坐 7.88208443748
+郭州 13.2075304714
+利奥 10.642581114
+戏剧性 8.76487921493
+宣传弹 12.5143832909
+士衡 12.8020653633
+何进之 12.5143832909
+化学地雷 12.8020653633
+银行卡 8.76487921493
+甲酸钠 12.2912397395
+新松 11.3357282945
+酒肉朋友 12.2912397395
+防空 7.29537973103
+印度尼西亚 7.94225295895
+宋太祖 9.71102290995
+一顷 11.8212361103
+畅音阁 12.8020653633
+一页 7.88208443748
+实践家 12.2912397395
+预算表 13.900677652
+一项 6.38915300358
+一顿 7.12531156104
+利奇 11.598092559
+郭崇 12.5143832909
+脉冲 8.41173992582
+一领 9.16447920358
+新林 11.8212361103
+接下来 7.14957618304
+乃文 13.900677652
+一槌定音 13.900677652
+新枝 11.4157710022
+一颗 6.84364067028
+彭萨科拉 13.900677652
+阿夫沙 12.8020653633
+利国 11.1926274509
+一题 11.5027823792
+五锭 13.2075304714
+阿道尔 13.2075304714
+于佩尔 12.8020653633
+刮得 9.58318953844
+小河边 10.4666904475
+灰石 12.2912397395
+数十秒 13.2075304714
+褐斑 11.9547675029
+呼玛县 11.4157710022
+岩洞 9.22784881751
+五十二文 13.2075304714
+粪篓 13.900677652
+兰氏城 12.5143832909
+投资品 9.44633035572
+劳心者治 12.5143832909
+可储存 12.2912397395
+东市区 10.8096351986
+数十种 9.87532596124
+路人皆知 11.1926274509
+展堂 11.9547675029
+售票厅 12.8020653633
+第三梯队 12.1089181827
+顺利 6.63175752378
+三皈 12.5143832909
+电解质 8.80081122415
+黄麂 12.5143832909
+每季 10.7226238216
+储贷 13.2075304714
+长期不懈 13.2075304714
+不好办 9.63799777493
+授牌 11.1926274509
+活在 9.85762638414
+一飞 11.0674643079
+谢笺 13.900677652
+不先去 13.2075304714
+十一二年 13.900677652
+产出量 11.9547675029
+丝胶 11.9547675029
+甭管 9.98865464655
+均衡论 13.2075304714
+奎尔 12.5143832909
+新北区 11.9547675029
+尽力 7.92432674268
+几位 7.19259356812
+位似中心 13.900677652
+肾癌 11.9547675029
+几何 7.40541209604
+丰园 13.900677652
+猎捕 11.1280889297
+利姆 12.8020653633
+唯实论 13.2075304714
+高天厚地 13.2075304714
+老病 11.0103058941
+李佐贤 13.2075304714
+护工 11.9547675029
+新星 9.77354326693
+散养 12.1089181827
+顺口 9.82314020807
+西皮 11.3357282945
+一餐 10.1164880181
+花鳅 12.8020653633
+南海市 13.2075304714
+几人 9.29550746599
+吴淞江 10.1630080337
+协处理器 12.5143832909
+几亿 10.642581114
+新昌 10.5684731418
+排除异己 10.5684731418
+代办处 11.7034530746
+傻乐 12.8020653633
+哒哒 10.1871055853
+云烟过眼 12.5143832909
+长庚星 11.8212361103
+蒋门神 10.3171587135
+百十个 10.642581114
+泅渡 11.3357282945
+灰白 8.96620371885
+银行券 8.74162235276
+新网 12.2912397395
+饫甘餍肥 13.900677652
+作曲者 12.5143832909
+斯密 8.3285236198
+新实在论 11.3357282945
+冯将军 12.2912397395
+合金钢 9.84023464143
+退还 9.09665660724
+桉树林 13.900677652
+夜未央 13.900677652
+几代 9.4233408375
+紫檀 10.1164880181
+马村区 12.2912397395
+智善寺 13.2075304714
+陈菲 13.2075304714
+舍得吃 11.4157710022
+新晃 11.9547675029
+李掌柜 11.8212361103
+几件 8.29487558568
+萧惠 13.2075304714
+几任 11.4157710022
+海茨 13.2075304714
+邯郸市 11.0674643079
+几份 10.3171587135
+西盟 11.598092559
+皮特曼 13.2075304714
+申河 12.8020653633
+隐君子 13.2075304714
+租佃制 11.3357282945
+成交量 6.33178198857
+寿比南山 12.5143832909
+一饱 11.3357282945
+郭峰 10.9562386728
+吃得出 13.900677652
+任夫人 13.900677652
+安康线 13.2075304714
+几付 13.2075304714
+新景 12.5143832909
+倒立 10.2371160058
+终极版 13.2075304714
+世俗主义 12.8020653633
+诸多方面 10.4666904475
+皇道 12.5143832909
+物超所值 11.8212361103
+几两 9.66657114738
+几个 4.80563590436
+觉得惊奇 12.1089181827
+枯黄 10.1871055853
+讲习班 11.2616203224
+听嘉 12.5143832909
+几串 11.7034530746
+郭尔 12.1089181827
+滇缅 10.2897597393
+一首 7.74158226348
+罩杯 13.900677652
+鲁甸 13.2075304714
+不好受 9.94943393339
+枯黑 12.5143832909
+猎户 9.46986085313
+剿抚兼施 13.2075304714
+江华瑶族自治县 11.9547675029
+娘娘腔 12.1089181827
+几下 7.92432674268
+几丈 9.93038573842
+决策权 10.6818018271
+余子式 13.2075304714
+红头丽 13.2075304714
+贝尔特 11.9547675029
+沃提尼 11.9547675029
+荆其诚 12.8020653633
+谢道韫 12.8020653633
+抄收 11.1926274509
+卡尔宾斯 13.2075304714
+不可须臾离 13.2075304714
+几丝 9.87532596124
+大英博物馆 11.8212361103
+左翼中旗 11.7034530746
+入营 11.0103058941
+跨越国界 13.2075304714
+众位 8.79473217808
+误入歧途 11.1926274509
+倒空 12.8020653633
+一风吹 11.8212361103
+利士 11.8212361103
+充要条件 11.0103058941
+众体 13.900677652
+阿克莱 12.1089181827
+吊挂式 13.2075304714
+卫屏 13.2075304714
+老生 9.87532596124
+新曲 11.8212361103
+芝罘湾 12.2912397395
+猎手 10.0720362555
+登徒子 12.1089181827
+烫酒 11.0674643079
+巴索 12.2912397395
+高度发达 9.91169360541
+几乎 5.03339112799
+那峰 12.5143832909
+老田 12.5143832909
+蒙克莱 12.8020653633
+串珠 9.66657114738
+宗宝庆 12.8020653633
+快枪 11.0674643079
+傻事 10.642581114
+顺化 10.6818018271
+音频格式 13.900677652
+有损于 10.4994802703
+见弃 11.5027823792
+心乱如麻 10.2117981979
+羊肠小道 11.1926274509
+活出 11.7034530746
+郭宏 13.900677652
+珍珠贝 10.6818018271
+参天两地 13.900677652
+寻欢 11.8212361103
+推注 12.2912397395
+新愁 12.2912397395
+老狗 10.4041700905
+落第 10.4041700905
+七十六岁 12.5143832909
+台塑 12.8020653633
+新意 9.48183704418
+听写 13.2075304714
+一鸣 10.533381822
+保密观念 13.900677652
+啸虎 13.2075304714
+莫斯卡 13.2075304714
+陈传康 12.5143832909
+短兵相接 10.4994802703
+利弗 13.900677652
+郭宪 13.900677652
+魏伟 12.5143832909
+数理哲学 13.900677652
+利弊 10.0720362555
+抓紧时间 9.33632946051
+听决 13.900677652
+展示出 10.2117981979
+就学 8.67493097826
+骨灰级 12.1089181827
+老狼 11.1280889297
+魏伐 12.2912397395
+落笔 10.4994802703
+寻死 9.61021821083
+组织关系 11.0674643079
+袁世海 12.2912397395
+重议 11.9547675029
+弗洛尔 13.2075304714
+酒酣耳热 11.598092559
+免疫原 13.2075304714
+寨门 9.17328983326
+阔叶植物 13.900677652
+高效化 12.5143832909
+电气工程师 11.9547675029
+汤碗 12.2912397395
+荫棚 12.8020653633
+宣传处 11.598092559
+利彦 12.8020653633
+顺和 11.8212361103
+普莱桑 13.2075304714
+口气道 9.84023464143
+首席专家 11.2616203224
+相干性 11.8212361103
+听凭 10.0088573539
+连云港市 10.2117981979
+芳草 10.1164880181
+特索 13.900677652
+临时动议 13.900677652
+张良劝 12.8020653633
+张良力 13.2075304714
+邵明立 11.7034530746
+听出 8.52539924429
+训令 10.7226238216
+固氮菌属 13.900677652
+永徽 10.4666904475
+突出重围 10.5684731418
+汉城人 13.900677652
+拉高 8.60236028543
+老版 12.1089181827
+谢石 12.8020653633
+就寝 9.77354326693
+老牌 8.95903522937
+利德 13.900677652
+花魁 11.0674643079
+顺命 12.8020653633
+避席 12.2912397395
+社会风尚 11.8212361103
+见得 9.19114745066
+老牛 9.66657114738
+吃闲饭 11.5027823792
+黎明 8.02014466558
+最佳人选 11.5027823792
+老物 13.900677652
+辛氏 11.598092559
+婆罗浮屠 11.7034530746
+利得 10.4994802703
+美苏英 13.2075304714
+知恩报德 13.900677652
+兵法 8.58255765813
+霸王龙 12.1089181827
+郭军 12.2912397395
+碰到问题 13.900677652
+推求 10.9049453784
+鞋店 11.8212361103
+几发 11.2616203224
+展布 10.0088573539
+木扎勒 12.8020653633
+掘进机 12.5143832909
+俯拍 13.900677652
+乘凉 9.69598503258
+甘卓 12.5143832909
+抄手 10.9049453784
+两首歌 13.900677652
+决策性 13.2075304714
+活儿 8.17382990439
+洛神 10.765183436
+展平 12.2912397395
+违心 10.604840786
+曼齐尼 13.900677652
+蓬莱仙境 12.5143832909
+萧条 8.15447446144
+郭孝 12.2912397395
+工业硅 13.2075304714
+钟情 9.65218240993
+登楼 10.9049453784
+普莱森 13.2075304714
+有案 13.900677652
+高轶军 13.900677652
+李为 11.9547675029
+促生产 13.2075304714
+消防梯 13.900677652
+榛属 13.900677652
+修和财 13.2075304714
+叮咛 9.5062284973
+老爷 6.65430957187
+老父 10.0294766411
+老爹 9.44633035572
+老爸 9.66657114738
+古今之 11.0674643079
+顺向 11.8212361103
+寻母 9.56994431169
+万松林 12.5143832909
+破身 13.900677652
+喧嚷 10.6818018271
+东方省 12.1089181827
+西点 11.5027823792
+科技体制 11.8212361103
+井场 13.900677652
+阜宁 11.2616203224
+胆俞 13.900677652
+日薄西山 11.0674643079
+单单是 11.4157710022
+塔式起重 13.2075304714
+魏主 10.1630080337
+魏为 12.5143832909
+桌儿 12.1089181827
+吴通 12.8020653633
+南海区 12.1089181827
+李冬野 13.900677652
+新欢 11.0674643079
+灰灰 13.2075304714
+创造才能 12.5143832909
+秦晋二 12.1089181827
+卡斯卡 11.8212361103
+南军 10.0720362555
+元气大伤 10.533381822
+北京电视台 11.7034530746
+十病九痛 13.2075304714
+利希 11.598092559
+怀王 11.5027823792
+王言 12.5143832909
+利布 12.1089181827
+王赵构 10.8561552143
+活像 9.63799777493
+武早 9.41204128224
+灰灭 13.2075304714
+机关干部 9.7898037878
+空房间 12.1089181827
+投资区 11.4157710022
+魏书 10.0505300503
+老王 8.9308643524
+热水袋 11.5027823792
+一齐 6.73673096763
+父权制 11.0103058941
+材种 12.8020653633
+叮咬 10.4041700905
+清偿债务 11.0674643079
+茶业 9.80633308975
+轴封 13.2075304714
+半虫 11.3357282945
+旁听席 11.9547675029
+压倒一切 10.3171587135
+全副武装 9.74179456862
+主油箱 13.2075304714
+弹回去 13.900677652
+梆梆 11.8212361103
+拭泪 10.5684731418
+百分率 10.7226238216
+避忌 11.5027823792
+欧洲央行 8.44109213783
+翻跟头 10.9562386728
+塔瓦纳 13.2075304714
+静安区 11.7034530746
+千金小姐 11.0103058941
+郭威 10.5684731418
+吸血鬼 10.8096351986
+捅射 13.900677652
+软耳朵 13.900677652
+卷吸作用 13.2075304714
+艺术创作 9.61021821083
+诸项 12.1089181827
+见底 8.59240995457
+称霸一方 11.9547675029
+李丰 11.1926274509
+养虎遗患 13.2075304714
+郭娟 13.900677652
+诸女伎 13.900677652
+听候 8.87679713113
+皇陵 9.45802639549
+魏二 13.900677652
+神投手 13.2075304714
+宾童贯 12.8020653633
+农夫山泉 8.19356738723
+授田 10.7226238216
+星球大战 10.8561552143
+雪上加霜 9.37888907493
+每封 13.2075304714
+德宗建 11.598092559
+推测 7.65457088649
+锐不可挡 12.5143832909
+曾世英 11.7034530746
+求过于供 13.2075304714
+力量对比 9.59661255877
+展开 6.03818045475
+灰烬 9.0884932966
+避开 7.88696249593
+与此相关 10.3453295905
+赵的卓 13.2075304714
+避役 10.9562386728
+业者 9.72629038208
+官胥吏 13.900677652
+冯公公 8.10461990121
+李沃夫 12.5143832909
+宫千秋 13.2075304714
+紫气 11.1280889297
+反犹主义 12.8020653633
+赵匡胤 9.4233408375
+上照 12.8020653633
+给点钱 13.2075304714
+每届 9.66657114738
+石勒病 13.2075304714
+四魂 13.900677652
+老猪 9.58318953844
+卫葑笑 12.5143832909
+每层 10.3171587135
+每局 10.9562386728
+制盐 9.49395840471
+尽善 12.1089181827
+斯道夫 12.8020653633
+远略 11.9547675029
+矛盾论 11.5027823792
+白求恩 10.2630914922
+宁侯朱 13.2075304714
+唐军攻 12.1089181827
+局部利益 11.8212361103
+聊表 11.0103058941
+猎枪 9.20019728618
+蔡口镇 13.2075304714
+护士 7.96843246453
+千吨级 11.0103058941
+东港区 13.2075304714
+宋江引 10.8096351986
+听厌 13.900677652
+十平方米 12.8020653633
+公可速 11.7034530746
+活口 11.4157710022
+论定 11.3357282945
+广成子 12.5143832909
+姜政委 11.8212361103
+米建国 13.900677652
+哈杜尔 12.5143832909
+张家庄 12.2912397395
+液状 12.1089181827
+李嘉图 9.01787572939
+脑袋瓜儿 13.2075304714
+缢蛏 11.7034530746
+护壁 13.2075304714
+干政之 11.598092559
+西王 10.604840786
+国际货币基金组织 8.18036587537
+悔之不及 11.8212361103
+圩田 12.1089181827
+展示台 13.900677652
+贝茨 12.8020653633
+萧旷 13.2075304714
+北京晚报 10.8096351986
+南海子 11.4157710022
+自侮 13.2075304714
+葬送 10.3743171274
+花香 9.49395840471
+嗉子 13.900677652
+张公公 11.1280889297
+百分点 6.47412857958
+下大本钱 13.900677652
+听取 8.38322475551
+多呈岩 12.8020653633
+里韦罗 12.8020653633
+矮星 11.0103058941
+议事会 10.1394775363
+里斯特 12.5143832909
+柜员机 12.1089181827
+头痛脑热 13.900677652
+混起来 13.900677652
+小组赛 10.4666904475
+中国人民解放军军乐团 12.8020653633
+刀锯 11.4157710022
+南南北北 12.5143832909
+瞬时值 11.7034530746
+博加兹 13.900677652
+选拔干部 11.5027823792
+解放初期 11.3357282945
+金羊网 13.2075304714
+公正司法 12.8020653633
+护墙 12.2912397395
+谢泼德 11.8212361103
+大月氏 10.2630914922
+预备期 13.2075304714
+济世 10.0505300503
+融会 10.765183436
+金朝派 12.5143832909
+太古界 11.4157710022
+主治大夫 11.8212361103
+持久力 11.7034530746
+管理体系 9.40086798165
+发上来 13.2075304714
+谢罪 9.96885201925
+每张 9.63799777493
+常佩 13.900677652
+活宝 11.2616203224
+缓不济急 11.9547675029
+分散开来 11.4157710022
+缂丝 11.1280889297
+黄陵县 11.598092559
+伊奥利 12.2912397395
+轴心 10.0505300503
+刁光覃 12.8020653633
+较后 11.5027823792
+花饰 11.9547675029
+刮宫 11.1280889297
+贝莱 11.1280889297
+莫斯凯 13.2075304714
+疏钞 13.900677652
+老火 12.5143832909
+防线 8.33615724465
+区委书记 9.93038573842
+新探 12.5143832909
+线条 8.03138073884
+新接 11.5027823792
+无所不能 10.604840786
+辜濂松 13.900677652
+罗兰贝 13.2075304714
+靠背椅 11.5027823792
+杨白泉 10.4666904475
+十几架 11.7034530746
+农民阶级 10.8096351986
+护堤 11.2616203224
+个例 10.9049453784
+吴道 13.2075304714
+郭奕 13.900677652
+团结奋进 12.5143832909
+萧散 12.1089181827
+子澄澈 13.900677652
+利差 8.37124856446
+顺嘴 11.4157710022
+倒置 10.1630080337
+灰玉 13.900677652
+产品检验 12.8020653633
+山鸣谷应 12.8020653633
+搁不下 12.1089181827
+但俊斌 13.2075304714
+济事 11.9547675029
+利川 11.1926274509
+北京大学人民医院 11.8212361103
+白乎乎 12.5143832909
+利州 11.598092559
+猎杀 11.0103058941
+罩成 13.900677652
+穆蒂 13.900677652
+必败 9.89334446674
+立体几何 12.8020653633
+展示区 12.1089181827
+连唱 11.9547675029
+避居 10.3453295905
+李向前 9.49395840471
+每当 7.74794495727
+猪狗不如 11.3357282945
+玻壳 11.9547675029
+巨型计算机 11.1280889297
+数十米 9.82314020807
+利尼 11.8212361103
+利尿 8.9102450652
+每座 10.1630080337
+寻根 10.9562386728
+四亿法郎 12.5143832909
+矮杆 13.2075304714
+花飞 12.8020653633
+谢维 13.900677652
+携款 11.8212361103
+满嘴都是 11.7034530746
+彼得罗夫 11.9547675029
+胡如雷 11.1280889297
+陆小姐 13.900677652
+柔荑 11.1280889297
+新戏 10.4666904475
+成帝绥 12.5143832909
+泸州市 11.8212361103
+吴遂 13.2075304714
+迂路 13.2075304714
+辗过 13.2075304714
+新房 8.16733637508
+百家讲坛 13.2075304714
+脱落酸 11.7034530746
+一百零六个 13.2075304714
+青溪 9.75754292558
+木筏子 13.2075304714
+装点门面 12.5143832909
+还纳 12.8020653633
+弹尽援绝 12.5143832909
+毫无疑问 7.94225295895
+防缩 12.1089181827
+远瞩 12.8020653633
+萧余庆 12.5143832909
+旷古未有 12.8020653633
+横切面 11.0103058941
+河马 10.4666904475
+入股 8.50705010562
+还织 13.2075304714
+国惜才 13.900677652
+巍然屹立 11.5027823792
+九曲桥 12.2912397395
+还给 7.63347710343
+砂轮厂 13.2075304714
+新手 10.0294766411
+波波尔 13.2075304714
+那小太监 12.5143832909
+融为 12.1089181827
+那红布 12.5143832909
+宽宏大量 10.642581114
+表露出 11.4157710022
+活力 7.55855623325
+红极一时 11.0674643079
+平江县 11.8212361103
+力量薄弱 10.9049453784
+岩棉 13.900677652
+司法厅 10.8561552143
+人儿 9.08039608637
+两百多年 11.1280889297
+笃爱 13.2075304714
+浊者自浊 12.8020653633
+精武门 13.2075304714
+立常洛 12.8020653633
+郑新立 12.8020653633
+灰狐 13.900677652
+松嫩平原 9.45802639549
+娄金狗 12.5143832909
+诚惶诚恐 10.0294766411
+九节鞭 13.2075304714
+牛录额 11.8212361103
+护好 13.900677652
+活剧 12.2912397395
+寻梦 13.2075304714
+绞碎 11.7034530746
+赵宋 11.9547675029
+连贯起来 12.8020653633
+金鳞 11.9547675029
+远看 10.3171587135
+拉尔山 13.2075304714
+皇帝 5.6227573938
+费拉里 12.5143832909
+乘务 12.5143832909
+远眺 9.44633035572
+黑心 10.1871055853
+必需元素 11.8212361103
+教师报 13.900677652
+无所不至 11.5027823792
+旌旗 8.98802276624
+尴尬 7.38448457593
+知难而进 13.900677652
+乘势 8.63281949291
+听到 5.73930262878
+新报 10.4041700905
+一部分分 13.900677652
+护套 11.0103058941
+方正科技 12.1089181827
+回文 10.642581114
+鄂嫩河 11.2616203224
+养鱼业 11.8212361103
+奉公 12.2912397395
+贝苗 13.2075304714
+五百万马克 12.8020653633
+纳扎尔巴耶夫 12.1089181827
+货流 11.3357282945
+西特 10.6818018271
+班克斯 12.2912397395
+新招 11.4157710022
+龙争虎斗 12.5143832909
+手疾眼快 11.5027823792
+文字版 9.98865464655
+北京天文馆 12.2912397395
+石勒石 13.2075304714
+心胆俱裂 11.8212361103
+不当得利 11.3357282945
+痊愈 8.87679713113
+动摇不定 12.8020653633
+培植 9.23723855786
+每年 5.57222658516
+皴裂 13.2075304714
+入耳 10.4666904475
+矮林 10.4994802703
+数十粒 12.5143832909
+窥测 10.3453295905
+万理 12.5143832909
+寒蝉凄切 13.900677652
+每幅 11.8212361103
+银行团 10.6818018271
+汉丽宝 13.2075304714
+情报源 13.900677652
+推演 9.37888907493
+郑一钧 12.5143832909
+七八位 12.5143832909
+一切都是 8.40761620864
+拉基尔 13.900677652
+兰小子 12.8020653633
+芳菲 10.6818018271
+西片 12.5143832909
+争名 12.2912397395
+污七八糟 13.900677652
+捻指间 11.9547675029
+一言堂 11.598092559
+老练 9.28555713513
+活存 13.2075304714
+吸收式 12.1089181827
+邵佳一 13.900677652
+比色计 12.8020653633
+寻机 11.3357282945
+社会舆论 9.66657114738
+既定目标 11.2616203224
+南岸区 11.5027823792
+钟氏 13.900677652
+泥牛入海 13.2075304714
+护国 9.5186510173
+审美评价 13.900677652
+元至顺 12.8020653633
+四十三万余 12.8020653633
+新洋 12.2912397395
+护肤品 10.1630080337
+通非斯 13.2075304714
+争吃 12.8020653633
+新洲 11.1280889297
+巴山蜀水 11.9547675029
+花音 13.2075304714
+每册 12.1089181827
+白羊村 12.8020653633
+亦步亦趋 10.4994802703
+甘性温 12.8020653633
+新派 10.0940151622
+锣鼓队 12.5143832909
+朱拱之 11.7034530746
+鉴湖 10.9562386728
+技术顾问 11.3357282945
+中国电影资料馆 13.2075304714
+新津 11.7034530746
+不名誉 12.1089181827
+言论集 12.5143832909
+当众宣布 11.5027823792
+手工艺者 12.5143832909
+持股 6.35528790236
+马尔库斯 13.900677652
+手用 11.9547675029
+卡洛斯 10.642581114
+贝尔福 11.598092559
+文帝初 11.7034530746
+撕破 9.87532596124
+郭城 11.2616203224
+富克斯 12.1089181827
+相交 8.34771806705
+相人 11.9547675029
+缓冲地带 11.1280889297
+女模特 13.2075304714
+通信联络 10.9562386728
+一位数 12.5143832909
+相亲 9.5186510173
+矮树 12.2912397395
+花鞋 11.0674643079
+混乱状态 11.4157710022
+尘封已久 12.8020653633
+同学会 11.9547675029
+随机性 10.0505300503
+娄敬 13.2075304714
+相争 9.59661255877
+怎么着 8.82550383674
+鱼朝恩 11.598092559
+听差 10.4994802703
+防灾 10.6818018271
+峰回路转 10.3171587135
+士良 12.2912397395
+江兆申 13.2075304714
+顺境 11.7034530746
+新浦 11.8212361103
+捅出 11.0103058941
+相互 6.32714638923
+吴家庄 11.9547675029
+南斯拉夫政府 13.2075304714
+贝赫 12.8020653633
+防火 9.63799777493
+第五十七 13.2075304714
+花青 13.2075304714
+入轨 11.1926274509
+胶原纤维 11.5027823792
+相书 12.8020653633
+得病 9.61021821083
+鸭蛋 10.4041700905
+拉尔卡 13.2075304714
+民族素质 12.5143832909
+推恩 11.0674643079
+恋旧 11.7034530746
+都水营 12.8020653633
+夜深沉 12.1089181827
+尔孟 12.8020653633
+科萨人 12.1089181827
+安喜县 12.8020653633
+移星换斗 13.2075304714
+诸镇 10.4041700905
+咏史 11.5027823792
+相乘 11.0103058941
+海苔 13.900677652
+司法局 10.5684731418
+利厄 12.5143832909
+家门口 8.56795885871
+听不进去 10.3743171274
+练习场 12.8020653633
+坑穴 12.8020653633
+申朝 13.2075304714
+相中 9.6811699468
+协助执行 12.5143832909
+张绣军 12.8020653633
+圣斗士 12.5143832909
+后期制作 12.1089181827
+恪尽 12.8020653633
+腌鱼 12.1089181827
+每具 12.8020653633
+利口 11.7034530746
+断裂韧性 12.1089181827
+北凉主 12.8020653633
+乙酰氯 11.8212361103
+疑犯 10.8096351986
+东门寨 13.2075304714
+扩展器 13.900677652
+花露 12.8020653633
+相与 10.0088573539
+新添 10.3171587135
+封丘县 13.900677652
+外交部新闻司 11.2616203224
+白毛男 13.2075304714
+士英 12.5143832909
+撕碎 10.2897597393
+肉毒素 10.8096351986
+防热 11.5027823792
+各种渠道 10.0940151622
+葳蕤 12.1089181827
+宣传员 11.9547675029
+新民 9.35738286971
+花雕 11.7034530746
+勐海 12.1089181827
+集团公司 7.54283538547
+单向收费 10.3171587135
+相信 5.66134822407
+锌合金 11.5027823792
+详细描述 11.0674643079
+扎萨克 12.1089181827
+拥着 9.84023464143
+触类旁通 12.5143832909
+加水煮 11.1280889297
+街心公园 12.2912397395
+花雅 13.900677652
+撕票 10.642581114
+寻春 11.8212361103
+民营化 11.5027823792
+外交学院 11.598092559
+特色产业 10.2371160058
+护城 11.8212361103
+命途 13.900677652
+总装线 12.2912397395
+活性白土 13.2075304714
+上鞋 13.900677652
+申曲 13.900677652
+制程 12.2912397395
+一千八九百文 13.2075304714
+远离 7.60541165054
+听岩 13.900677652
+宣传周 13.900677652
+见到 6.10338637843
+唇面 13.2075304714
+展厅 9.74179456862
+花雨 12.5143832909
+利刃 9.71102290995
+脓胸 11.5027823792
+阵地失守 13.900677652
+尽头 7.86519621945
+库里南 13.2075304714
+尽失 10.8561552143
+护垫 11.5027823792
+重新制定 11.1280889297
+不三不四 10.1871055853
+展台 10.1871055853
+每季度 10.0720362555
+军统局 12.8020653633
+隧道口 11.9547675029
+山阳区 13.900677652
+公方 13.900677652
+新汶 11.2616203224
+鉴定家 11.4157710022
+利剑 9.55687223012
+手生 12.2912397395
+汤先居 13.2075304714
+魏之策 13.2075304714
+疑猜 12.8020653633
+窃钩者诛 13.900677652
+西升东 13.2075304714
+坚守不渝 13.900677652
+洛瓦 12.8020653633
+格鲁吉亚人 11.598092559
+白间色 13.2075304714
+郭图 10.9049453784
+防盾 11.1926274509
+岑氏 12.8020653633
+避匿 12.8020653633
+甘受宗 13.2075304714
+龙庆峡 13.900677652
+粉碎机 12.1089181827
+陈忱 12.8020653633
+新沙 11.8212361103
+郭嘉 10.4666904475
+杳无消息 12.5143832909
+梅纳特 13.2075304714
+北运河 9.91169360541
+练习器 13.900677652
+堵师赞 13.900677652
+微咸湖 12.8020653633
+老罗 12.5143832909
+骨董 10.0720362555
+肾素 11.1280889297
+宣传品 11.0103058941
+当间儿 12.2912397395
+普莱斯 11.1280889297
+叶宗留 11.598092559
+放射性同 13.900677652
+城市热岛 13.2075304714
+睡着 7.45178825783
+唇音 12.2912397395
+石增至 13.2075304714
+西晋时期 12.5143832909
+同学们 8.61241062128
+北西西 11.0103058941
+乔迁之喜 13.900677652
+层高 10.7226238216
+胆结石 11.0103058941
+工业用 9.4233408375
+谈艺琐 13.2075304714
+万亿年 13.2075304714
+精忠报国 12.1089181827
+舞蹈演员 9.74179456862
+国家科技进步奖 11.2616203224
+绞盘 9.41204128224
+睡眠 7.89926277401
+倒灶 10.9562386728
+顺天 9.74179456862
+不伦不类 10.0505300503
+新法 9.06439574502
+凌洪 13.2075304714
+地利人和 13.2075304714
+相传 7.4855806928
+神火飞 12.8020653633
+清清白白 10.5684731418
+张良弼 12.1089181827
+申明 9.38981814546
+广大干警 13.900677652
+夏允彝 11.9547675029
+山阳县 12.1089181827
+睡眼 10.765183436
+相伴 8.9519177616
+平阳府 11.5027823792
+新泰 11.4157710022
+狂暴地 13.2075304714
+六十二斤 13.2075304714
+鱼水深情 12.8020653633
+亲和性 11.7034530746
+展卖 13.2075304714
+呼叫转移 13.2075304714
+相会 8.36728816325
+诗三首 13.900677652
+骡驮子 11.7034530746
+抗蛋白酶 13.900677652
+加深了解 13.900677652
+林冲大 12.8020653633
+赛义德 10.7226238216
+掐住 10.7226238216
+沂源县 11.7034530746
+敢于斗争 11.8212361103
+一退 10.3743171274
+推拿 8.41588071849
+绵子 13.900677652
+跟我学 12.8020653633
+搅过 12.8020653633
+诸韦 12.8020653633
+祸从口出 11.8212361103
+胡辉中 9.94943393339
+听得 7.20983537456
+防爆 10.5684731418
+一锁 11.9547675029
+特艾萨 13.2075304714
+降下来 9.77354326693
+一途 11.2616203224
+一通 8.23425096386
+诸韵 13.2075304714
+东门外 10.0088573539
+成交额 7.91171623509
+逞能 10.2630914922
+词调 11.8212361103
+万瓦 12.5143832909
+推拒 11.9547675029
+储能 10.8561552143
+曲词宾 13.2075304714
+眼角膜 11.7034530746
+抄没 10.6818018271
+西羌 10.6818018271
+步足 10.2630914922
+两百多匹 13.900677652
+李调元 12.1089181827
+利兹 11.3357282945
+西翼 11.4157710022
+走遍全国 12.8020653633
+每只 12.5143832909
+除油剂 13.2075304714
+见光 10.2371160058
+每句 10.9049453784
+垒上 13.2075304714
+工业盐 12.8020653633
+又饥又渴 11.7034530746
+一遍 6.58280145335
+储薪 13.2075304714
+一道 6.18199215678
+子和皇 13.2075304714
+昭通市 12.1089181827
+原始森林 8.9308643524
+见数 13.900677652
+倒班 12.2912397395
+申文 11.1280889297
+李新德 13.900677652
+珍珠草 12.8020653633
+谢玄 10.4349417492
+疾忙 11.0103058941
+每双 13.900677652
+活得 8.56795885871
+青椒 10.6818018271
+入超 10.765183436
+浸泡液 13.2075304714
+申新 12.1089181827
+叶企孙 12.8020653633
+银行学 12.5143832909
+泰国政府 11.598092559
+利克 9.40086798165
+满室生辉 13.2075304714
+通信联系 11.9547675029
+统一天下 11.1280889297
+丝衣 13.900677652
+十六张 13.2075304714
+拜他为师 12.2912397395
+远端 9.5186510173
+古德尔 13.900677652
+换热站 13.2075304714
+申斥 9.96885201925
+贝尼奥夫 11.8212361103
+撕毁协定 13.900677652
+米坦尼 12.1089181827
+人妖 11.7034530746
+扩展名 11.7034530746
+避债 13.2075304714
+狄拉克 10.0505300503
+丝袜 10.9049453784
+齿轮箱 11.0103058941
+花镜 11.5027823792
+罗西娜 13.900677652
+爆炸物 11.0674643079
+每区 12.5143832909
+淮南市 11.2616203224
+两千余 10.5684731418
+曼妙 11.5027823792
+电力公司 9.69598503258
+远程 8.11071748108
+人取我与 12.8020653633
+推托 9.54396882529
+一板三眼 12.2912397395
+西缘 9.54396882529
+推打 12.8020653633
+西阿斯 13.2075304714
+贝达 12.5143832909
+序曲 9.62401153296
+列车票价 13.900677652
+推手 8.9308643524
+老米 12.1089181827
+入赘 10.6818018271
+金屋藏娇 11.9547675029
+越飞越 11.8212361103
+前后夹攻 11.9547675029
+慢慢说 10.0940151622
+石头子儿 12.1089181827
+银行家 8.37921673411
+仇得报 13.2075304714
+绞痛 10.533381822
+疑点 9.94943393339
+红着脸 8.65893063692
+入货 12.5143832909
+入账 10.6818018271
+入贡 10.7226238216
+推戴 10.5684731418
+花销 9.98865464655
+伯莱塔 12.8020653633
+秋水仙素 12.8020653633
+十冬腊月 11.9547675029
+某月 11.9547675029
+补给品 11.7034530746
+阙至尊 13.2075304714
+阵线 9.23723855786
+一阵儿 10.765183436
+经费不足 11.3357282945
+腮帮 10.3171587135
+海德公园 11.598092559
+西罗 11.3357282945
+一部 6.47591589015
+米建威 12.2912397395
+制种 10.9049453784
+助听器 11.0103058941
+双柏县 13.2075304714
+西窗 12.8020653633
+宋向晋 13.2075304714
+罗吉尔 12.8020653633
+文部省 11.9547675029
+阵纪 13.900677652
+石油业 11.7034530746
+见出 12.2912397395
+险阻艰难 13.2075304714
+花键 11.4157710022
+西线 9.08039608637
+在我心中 10.9049453784
+亚述人 10.9562386728
+父母辈 12.2912397395
+盟旗 10.9049453784
+花都 10.1871055853
+赫胥黎 10.8561552143
+西纳 11.5027823792
+圣贤书 10.9562386728
+麻衣麻 13.2075304714
+山阳公 12.8020653633
+骂个 12.1089181827
+卡洛曼 13.2075304714
+感光材料 10.2630914922
+顺心 10.8561552143
+论文答辩 11.9547675029
+明初开 12.8020653633
+褴褛不堪 13.2075304714
+花银 11.7034530746
+尽孝 10.2371160058
+丝料 11.9547675029
+后半辈子 11.2616203224
+龙尾山 12.5143832909
+转变观念 11.2616203224
+通过考核 12.2912397395
+马进宫 12.8020653633
+萧梁 11.0674643079
+越来越重 9.93038573842
+楼门口 11.7034530746
+郭云龙 10.3171587135
+洋枪队 12.2912397395
+喻侯萧 13.2075304714
+慌忙 7.5393751744
+寒湿 10.2117981979
+新湖 10.0505300503
+展出 8.5488195185
+乘幂 13.900677652
+各色各样 11.4157710022
+陈忠 12.5143832909
+计皇明 13.2075304714
+推推 10.7226238216
+活度 10.765183436
+萧森 13.2075304714
+居夏州 13.2075304714
+扬优 13.2075304714
+花钱 8.36728816325
+一锹 11.8212361103
+情报战 12.8020653633
+阿拉伯人 7.97375162601
+参政权 11.7034530746
+钠钾泵 13.900677652
+词赋 11.598092559
+丝质 11.3357282945
+华素 13.900677652
+慌得 8.47572763449
+推掉 10.9562386728
+寄走 12.2912397395
+唐招 12.8020653633
+西织 13.2075304714
+盖特 11.5027823792
+一酸 9.40086798165
+十一点二十分 13.2075304714
+尤鼎盛 13.900677652
+充气棒 13.900677652
+韭菜子 13.2075304714
+方用玉 13.900677652
+钻工 13.2075304714
+开关损耗 13.900677652
+呼喊声 10.7226238216
+结缔组织 9.35738286971
+性经历 13.900677652
+旗手 10.4666904475
+满身是血 13.2075304714
+堕入 10.3453295905
+李固渡 12.5143832909
+医护人员 9.53122979951
+迂腐 10.1871055853
+不由得 7.00600761254
+李永波 12.8020653633
+环鸟苷酸 13.2075304714
+通俗化 10.8096351986
+每到 8.57280148319
+源热泵 12.5143832909
+道德文章 11.5027823792
+阿特利 12.8020653633
+途经 8.9308643524
+每分 11.1280889297
+玉帝闻 11.3357282945
+雨花石 11.2616203224
+灰绿 11.3357282945
+以此类推 10.5684731418
+纱衣 12.8020653633
+古生物 9.53122979951
+便捷性 11.3357282945
+文字狱 10.5684731418
+宣传团 12.1089181827
+杜莉 10.4994802703
+顺子 13.900677652
+第八届全国人民代表大会 12.1089181827
+耐腐蚀性 11.0674643079
+慌张 8.87023973058
+推挽 12.1089181827
+王赵楷 13.2075304714
+那扎格 13.2075304714
+上火 9.27570483869
+一量 11.598092559
+一里 9.17328983326
+一重 9.72629038208
+喷起来 13.900677652
+上官桀 11.8212361103
+萧子显 12.1089181827
+嗉囊 11.9547675029
+埃姆登 13.900677652
+侵蚀性 13.2075304714
+推挡 12.5143832909
+束缚态 12.8020653633
+推挤 11.598092559
+魏兵之 13.2075304714
+察举 10.3743171274
+质量标准 10.5684731418
+无人不知 10.9049453784
+闻其语 13.2075304714
+外圈 11.598092559
+儿媳妇 8.73589167805
+避免 6.06866347147
+斯德哥尔摩 9.29550746599
+避光 11.8212361103
+雅室 12.2912397395
+新滩 12.5143832909
+萨布里 13.2075304714
+吊挂在 12.5143832909
+官高爵 12.8020653633
+方用理 11.8212361103
+保持中立 10.1394775363
+睡狮 11.9547675029
+授粉 10.0720362555
+衅隙 12.8020653633
+工业炉 11.9547675029
+哪个 6.80395627348
+一阕 11.5027823792
+承压区 13.900677652
+一队 7.86759143018
+管护 11.9547675029
+谢病 13.2075304714
+罩棚 13.2075304714
+老童 11.9547675029
+蒙泰朗 12.8020653633
+锦旗 10.0505300503
+格塞尔 11.598092559
+尽属 11.598092559
+亚历山大广场 13.2075304714
+单章 13.900677652
+大和绘 11.7034530746
+见地 12.1089181827
+一阶 10.1394775363
+雪花呢 12.8020653633
+舆论界 11.2616203224
+玉亭叔 12.1089181827
+夏秋之 11.0674643079
+哪一 11.0674643079
+排上 11.1280889297
+陈庄揽 12.8020653633
+挪威海 10.9049453784
+西移 10.2897597393
+脑袋瓜子 11.3357282945
+骨灰盒 10.7226238216
+难以相信 10.3743171274
+言巷语 13.2075304714
+尿素生成 13.900677652
+急电 10.604840786
+南半 13.2075304714
+紫斑 11.9547675029
+度量 9.01032852375
+看人下菜 12.1089181827
+老窖 8.85082164473
+西秦 9.87532596124
+老窝 10.3171587135
+展团 13.2075304714
+一院 10.533381822
+上海市人民政府 10.533381822
+反躬自省 12.8020653633
+修理厂 10.4041700905
+贝西 11.9547675029
+此路不通 12.1089181827
+新楼 10.2897597393
+老明友 13.2075304714
+制罐 12.8020653633
+曾在武 13.2075304714
+中山南路 13.900677652
+老脑筋 12.1089181827
+白洋淀 10.642581114
+乌海市 11.0103058941
+乳膏 13.900677652
+奔走呼号 11.598092559
+郑文宝 13.900677652
+金窝银 13.900677652
+庄叔随 13.2075304714
+霸王鞭 12.2912397395
+汪玉凯 13.2075304714
+鸭苗 10.8561552143
+一隔 11.7034530746
+雷纳托 13.900677652
+麋鹿 10.2371160058
+易地做官 12.8020653633
+衍射 8.9308643524
+还用 8.59240995457
+活套 12.8020653633
+东方红 9.72629038208
+斜投影 13.900677652
+有眼不识 12.1089181827
+疏附 12.2912397395
+管押 12.1089181827
+光盘机 13.900677652
+夏忠靖 12.8020653633
+四公里 12.5143832909
+南非洲 13.2075304714
+利基 10.8561552143
+一集 10.765183436
+黄瑞兰 10.6818018271
+哀乐声 12.1089181827
+阿夫拉 13.2075304714
+一段时间 6.47710920772
+气象条件 9.53122979951
+韩公廉 12.2912397395
+索取权 10.7226238216
+宣传册 12.5143832909
+内丹术 12.1089181827
+弱质 12.2912397395
+咒语 8.96620371885
+推搡 9.93038573842
+命门 10.6818018271
+西祠 12.8020653633
+排他 12.2912397395
+亡魂 10.3453295905
+刘渔仲 12.5143832909
+吴秀英 13.900677652
+定居者 11.8212361103
+师资队伍 11.5027823792
+生荒 12.8020653633
+疾奔 12.5143832909
+中位数 11.1280889297
+吕光部 12.8020653633
+据调查 9.74179456862
+河南人民出版社 11.7034530746
+咒诅 11.9547675029
+重文轻武 11.5027823792
+达川市 12.8020653633
+马进忠 13.900677652
+固氮作用 13.2075304714
+咒词 13.900677652
+疏阔 12.1089181827
+谢甘 13.900677652
+鲁卫 13.2075304714
+决策树 11.8212361103
+小说作品 11.7034530746
+顺差 8.93783302172
+一震 9.13850371718
+有失身份 11.9547675029
+加成反应 9.82314020807
+诸郡 9.82314020807
+一霎 11.598092559
+两百多名 12.8020653633
+数十百 13.2075304714
+少部分 9.44633035572
+刮倒 11.3357282945
+黩武 11.9547675029
+马思聪 11.598092559
+誊稿 13.900677652
+哪会 10.1394775363
+风停了 12.1089181827
+凡宫女 13.2075304714
+碱基组成 12.5143832909
+汉克尔 12.8020653633
+共鸣管 13.900677652
+工人体育场 12.5143832909
+一露 11.5027823792
+随机数 9.91169360541
+庆春路 12.8020653633
+一霸 10.9049453784
+卢本巴希 12.2912397395
+冲激响应 13.2075304714
+原地待命 13.2075304714
+鸭茅 12.5143832909
+布拉马普特拉河 10.642581114
+森纳赫 11.8212361103
+线性系统 10.5684731418
+锥虫 11.8212361103
+片瓦不留 13.900677652
+溥仪充 12.8020653633
+天知道 9.91169360541
+胡桃木 12.1089181827
+诸邦 11.1926274509
+寻找 6.04010686644
+官至礼 11.7034530746
+轴向 9.84023464143
+杰赤城 11.9547675029
+救兵 9.14708746087
+东方网 11.4157710022
+推断 8.1386262692
+过电压 10.9049453784
+墨点 13.900677652
+盖瑞 13.900677652
+推斥 13.2075304714
+一面 5.88865941282
+钟楼 9.27570483869
+香农 11.8212361103
+由头 9.91169360541
+六盘山 9.62401153296
+氧化亚砷 13.900677652
+护厂 12.5143832909
+哪位 9.23723855786
+兼容并蓄 10.9049453784
+皮特森 13.2075304714
+听声 11.3357282945
+新桥 10.4666904475
+排位 11.2616203224
+海绿石 11.598092559
+护养 11.9547675029
+三段论法 13.900677652
+校验位 13.900677652
+护卫 8.24119543622
+制约 6.98992686401
+每吨 8.17382990439
+推敲 9.15574552361
+一百二十万平方公里 13.2075304714
+排便 9.94943393339
+展成幂 13.2075304714
+六十八卷 12.8020653633
+鲍文玉 13.2075304714
+申扎 12.5143832909
+制纸 13.900677652
+词讼 11.2616203224
+消化液 10.0505300503
+细皮嫩肉 11.5027823792
+郭刚 13.2075304714
+申批 13.900677652
+声光 11.1280889297
+食用油 8.55357012126
+忍耻含羞 13.900677652
+总督署 12.2912397395
+活塞 9.16447920358
+一鞭 9.82314020807
+二季度 6.91042115148
+不间断 9.20019728618
+二项分布 11.9547675029
+张量分析 11.9547675029
+窥望 11.2616203224
+诸道 10.2897597393
+左青龙 12.5143832909
+防疫 9.96885201925
+忿忿 10.3453295905
+什切青 11.8212361103
+每周 7.73947033028
+词语 9.0884932966
+奥扎仪 13.2075304714
+束源 13.900677652
+防病 10.2117981979
+综合测试 13.2075304714
+谢琰 13.2075304714
+持股数 9.03314320152
+洮州 11.2616203224
+谢琳 13.2075304714
+陶陶然 13.900677652
+新棉 11.7034530746
+罗五世 13.900677652
+盖瓦 13.900677652
+钨丝 10.8096351986
+练个 13.2075304714
+科罗拉多 10.533381822
+和大邦 13.900677652
+游客量 12.1089181827
+就势 9.66657114738
+由然而生 13.900677652
+里斯科 13.900677652
+千瓦小时 12.5143832909
+制粉 11.0674643079
+词话 10.8096351986
+义学 10.7226238216
+见图 8.64840422393
+警察机关 11.598092559
+农业部 9.00283785202
+寻来寻 13.2075304714
+反垄断 10.2371160058
+企及 10.0720362555
+宣传单 10.533381822
+刮匙 12.8020653633
+打秋千 11.8212361103
+开国元老 12.5143832909
+花釉 12.5143832909
+依韵 11.8212361103
+顺延 10.0505300503
+郭倪 13.900677652
+代田法 11.8212361103
+束流 11.8212361103
+共质体 12.2912397395
+多光年 13.2075304714
+手头紧 12.1089181827
+石子儿 11.4157710022
+强身健体 11.1280889297
+就养 12.2912397395
+加速运动 11.3357282945
+新款 9.08039608637
+听宫 13.2075304714
+飒飒声 13.900677652
+孔敬府 13.900677652
+熔点 7.84858848305
+雷子炮 12.2912397395
+拉弗尔 13.2075304714
+暗度陈仓 11.9547675029
+大而无当 11.2616203224
+高层建筑 10.1871055853
+鼻孔朝天 12.5143832909
+紫晶 11.9547675029
+授给 10.6818018271
+红铃虫 12.2912397395
+笃笃 10.3171587135
+词表 12.1089181827
+北非洲 13.900677652
+乏困 13.900677652
+外源性 10.533381822
+含愤 13.900677652
+士著 12.8020653633
+花醇 12.1089181827
+防癌 10.7226238216
+新歌 11.9547675029
+顺序 7.57631868959
+黄瓜片 13.900677652
+蒋山 12.2912397395
+携手 8.43684584695
+展示室 13.900677652
+推杆 11.9547675029
+郭凯 13.2075304714
+军事委员 12.5143832909
+拳击手 12.2912397395
+二十万平方米 13.2075304714
+练习册 13.2075304714
+骂人 9.01032852375
+直接受理 11.1926274509
+另一面 9.44633035572
+顺应 8.51618258919
+急风骤雨 11.8212361103
+香港立法会 13.900677652
+展品 9.74179456862
+旗杆 9.34680076038
+花酒 11.2616203224
+千回百转 12.1089181827
+冲口而出 10.604840786
+紫杉 11.8212361103
+打家截道 13.900677652
+甜菊糖 13.900677652
+黑天 9.91169360541
+吴子注 13.2075304714
+每场 10.1630080337
+卡尔萨基 13.900677652
+月明如镜 13.2075304714
+漂着 10.533381822
+粉碎性 11.5027823792
+橙黄色 10.2897597393
+韵味儿 13.900677652
+顺平 12.8020653633
+落絮 13.900677652
+活字 10.2630914922
+防皱 12.5143832909
+每圈 12.8020653633
+乘客 7.9817837977
+南海县 11.3357282945
+串线 13.900677652
+避向 12.8020653633
+国家广播 11.9547675029
+维农山 12.5143832909
+一钱 10.3171587135
+王氏翼 13.2075304714
+猎户星座 13.900677652
+陶德曼 13.2075304714
+唇部 10.6818018271
+方用益 12.8020653633
+第四课 13.900677652
+防盗 9.85762638414
+斗上 11.598092559
+丁亥年 13.2075304714
+模塑科技 12.5143832909
+顺带 11.598092559
+鸭肉 10.5684731418
+班班可考 13.900677652
+孙冯翼 13.2075304714
+叮嘱 8.28390655431
+青桐 12.5143832909
+受文者 13.900677652
+刮取 11.0103058941
+倒睫 12.1089181827
+一铢 13.2075304714
+邯郸县 12.8020653633
+制动闸 13.900677652
+九大行星 10.3743171274
+知本家 13.900677652
+无触点 12.8020653633
+光辉业绩 12.8020653633
+上巨虚 13.900677652
+刘诗平 12.5143832909
+鸭肫 13.900677652
+虞世南 10.9049453784
+顺帝 9.74179456862
+热带海洋 10.1630080337
+美国联邦调查局 12.5143832909
+清世宗 11.1280889297
+每块 10.0294766411
+实际意义 9.55687223012
+豫西 8.85725253506
+巷子深 12.2912397395
+拉生意 13.2075304714
+老秀 11.0103058941
+微波通信 10.765183436
+出其不意 9.21854642485
+敦敦 13.2075304714
+一锅 9.05649056552
+刮刀 10.4666904475
+层层迭迭 13.900677652
+被称作 9.00283785202
+中国航空学会 12.8020653633
+一阵响 11.9547675029
+钾肥厂 11.8212361103
+新学说 12.1089181827
+小黑河 13.2075304714
+企业库 12.8020653633
+一错 11.7034530746
+飞上来 13.900677652
+按理说 9.62401153296
+唐僧扶 13.2075304714
+总协定 11.1280889297
+一锤 11.4157710022
+六十余种 12.5143832909
+紫星 13.900677652
+陈征 13.900677652
+买入价 11.4157710022
+一键 10.9562386728
+寻思 8.02574692112
+流浪狗 12.8020653633
+利吉 13.2075304714
+取决于 6.8106008162
+红巨星 10.9562386728
+刮到 11.2616203224
+沙溪庙 13.2075304714
+鄂氏 13.2075304714
+特别感谢 12.8020653633
+石羊镇 13.900677652
+智力活动 11.8212361103
+长兄为父 13.2075304714
+刮削 10.8096351986
+吃过饭 9.41204128224
+一镇 10.7226238216
+花繁叶茂 13.900677652
+秋水仙碱 11.7034530746
+普设仓 13.2075304714
+程旷 13.2075304714
+炼丹术 10.8096351986
+摄影艺术 13.2075304714
+赵祯朝 13.2075304714
+俐落 13.900677652
+西端 9.25628675283
+一镑 12.5143832909
+防着 10.4994802703
+媚气 12.1089181827
+顺德 9.46986085313
+鸭脚 12.8020653633
+赛义夫 13.900677652
+清冷渊 13.900677652
+柔软光滑 12.8020653633
+人事安排 11.5027823792
+赤兔 11.598092559
+西站 10.2630914922
+西欧国家 9.82314020807
+司法官 12.2912397395
+十六年 8.092535162
+每回 10.9049453784
+稿酬 12.1089181827
+一镶 13.900677652
+登报声明 13.2075304714
+滔天罪行 11.9547675029
+贝尔纳 11.1926274509
+自由滑 12.2912397395
+洛水村 12.5143832909
+睡熟 9.61021821083
+玉帝金 12.8020653633
+在家出家 13.2075304714
+贺统军 11.4157710022
+远缘 11.2616203224
+培根 9.55687223012
+日见好转 13.900677652
+新闻报导 12.8020653633
+莫愁湖 11.4157710022
+索性 7.86999239171
+莫雷洛斯州 12.8020653633
+护具 11.3357282945
+护兵 10.3453295905
+刘育英 13.2075304714
+对苯二酚 11.598092559
+推来 11.5027823792
+命在旦夕 11.7034530746
+入行 11.4157710022
+退休职工 10.7226238216
+莞尔一笑 10.3171587135
+莫塞莱 11.7034530746
+墨西卡利 12.1089181827
+效用函数 11.8212361103
+错误行为 12.1089181827
+尽心 8.98069672615
+灼见 11.9547675029
+萧氏 11.598092559
+再多 12.5143832909
+彩妆师 12.8020653633
+二重唱 12.2912397395
+顺当 11.0103058941
+东乌珠穆沁旗 11.7034530746
+容祖儿 13.900677652
+淮南子 10.0088573539
+独木难支 12.5143832909
+申思 13.900677652
+两段式 13.2075304714
+况且 7.50208271744
+中国佛学院 12.8020653633
+挥之即去 11.9547675029
+略知一二 10.7226238216
+企划 10.5684731418
+锦春 13.2075304714
+拜揖 11.1926274509
+万石 10.9562386728
+番茄酱 11.7034530746
+精囊炎 13.2075304714
+更进一步 9.04086524761
+官家奏 12.8020653633
+和监军 11.7034530746
+隆重推出 12.1089181827
+尽得 10.765183436
+顺式 10.7226238216
+封赏银 13.2075304714
+一闪 8.06879517469
+周阁老 10.9562386728
+一门 7.34532076017
+一问 8.32094782599
+新招数 13.2075304714
+拿手戏 13.2075304714
+冯公子 13.2075304714
+外行话 12.1089181827
+防冻液 11.0674643079
+推服 13.2075304714
+丝路 10.604840786
+一闹 10.1394775363
+写封信 10.1630080337
+玩花样 13.2075304714
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/jieba.dict.utf8 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/jieba.dict.utf8
new file mode 100644
index 0000000000..01235a9744
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/jieba.dict.utf8
@@ -0,0 +1,348981 @@
+AT&T 3 nz
+B超 3 n
+c# 3 nz
+C# 3 nz
+c++ 3 nz
+C++ 3 nz
+T恤 4 n
+一 217830 m
+一一 1670 m
+一一二 11 m
+一一例 3 m
+一一分 8 m
+一一列举 34 i
+一一对 9 m
+一一对应 43 l
+一一记 2 m
+一一道来 4 l
+一丁 18 d
+一丁不识 3 i
+一丁点 3 m
+一丁点儿 24 m
+一七 22 m
+一七八不 3 l
+一万 442 m
+一万一千 4 m
+一万一千五百二十颗 2 m
+一万一千八百八十斤 2 m
+一万一千多间 2 m
+一万一千零九十五册 4 m
+一万七千 5 m
+一万七千余 2 m
+一万七千多 2 m
+一万七千多户 2 m
+一万万 4 m
+一万万两 4 m
+一万三千 8 m
+一万三千五百一十七 2 m
+一万三千五百斤 4 m
+一万三千余种 2 m
+一万三千块 2 m
+一万两 124 m
+一万两万 4 m
+一万两千 3 m
+一万个 62 m
+一万九千 2 m
+一万九千余 2 m
+一万二 10 m
+一万二千 7 m
+一万二千两 2 m
+一万二千五百 4 m
+一万二千五百一十二 2 m
+一万二千五百余 2 m
+一万二千五百余吨 2 m
+一万二千亩 2 m
+一万二千余 2 m
+一万二千六百八十二箱 2 m
+一万二千名 3 m
+一万二千里 3 m
+一万五 6 m
+一万五千 45 m
+一万五千一百四十四卷 2 m
+一万五千两 4 m
+一万五千个 2 m
+一万五千二百余 2 m
+一万五千余 9 m
+一万五千元 3 m
+一万五千名 4 m
+一万五千多 2 m
+一万五千家 2 m
+一万亿 3 m
+一万亿美元 5 m
+一万余 41 m
+一万余吨 2 m
+一万余顷 2 m
+一万倍 14 m
+一万元 61 m
+一万八 5 m
+一万八千 7 m
+一万八千余 8 m
+一万八千多元 2 m
+一万公里 2 m
+一万六千 5 m
+一万六千三百户 2 m
+一万六千余户 2 m
+一万六千多 3 m
+一万册 2 m
+一万刀 7 m
+一万匹 4 m
+一万卷 2 m
+一万双 6 m
+一万发 2 m
+一万句 11 m
+一万只 9 m
+一万名 16 m
+一万四千 3 m
+一万四千二百四十三户 2 m
+一万四千余顷 2 m
+一万四千多元 3 m
+一万回 2 m
+一万块 49 m
+一万声 2 m
+一万多 86 m
+一万多一点 2 m
+一万多两 9 m
+一万多个 10 m
+一万多例 2 m
+一万多元 10 m
+一万多只 2 m
+一万多名 26 m
+一万多块 6 m
+一万多平方公里 2 m
+一万多年 4 m
+一万多斤 3 m
+一万多顷 2 m
+一万天 2 m
+一万头 2 m
+一万宗 2 m
+一万家 8 m
+一万左右 3 m
+一万年 39 m
+一万张 3 m
+一万户 5 m
+一万斤 9 m
+一万条 4 m
+一万次 16 m
+一万步 30 m
+一万盏 4 m
+一万种 2 m
+一万贯 4 m
+一万遍 9 m
+一万里 4 m
+一万间 5 m
+一万零五百亿斤 2 m
+一丈 298 m
+一三 19 m
+一三五 6 m
+一三六八 2 m
+一三四团 3 m
+一上 3 s
+一上午 53 t
+一上台 3 m
+一上场 3 m
+一下 13924 m
+一下一下 22 m
+一下下 37 m
+一下二十 2 m
+一下余 2 m
+一下全部 3 m
+一下十三 2 m
+一下半 3 m
+一下周 3 m
+一下四周 6 m
+一下圈 2 m
+一下场 3 m
+一下头 54 m
+一下子 2333 m
+一下子全部 3 m
+一下子发 2 m
+一下子多出 2 m
+一下子成 16 m
+一下子打 10 m
+一下子把 61 m
+一下子站 15 m
+一下子脸 3 m
+一下床 6 m
+一下张 8 m
+一下手 17 m
+一下眼 10 m
+一下站 25 m
+一下肚子 2 m
+一下脸 10 m
+一下页 2 m
+一下顶 5 m
+一下顿 2 m
+一下首 2 m
+一不做 87 i
+一不压众 3 i
+一不小心 125 l
+一不怕苦 10 l
+一不扭众 3 i
+一不注意 3 i
+一不留神 3 i
+一专多能 27 l
+一世 770 t
+一世之雄 2 i
+一世英名 3 m
+一世龙门 3 i
+一丘一壑 3 i
+一丘之貉 12 i
+一业 37 n
+一业为主 3 i
+一丛丛 31 m
+一丝 1186 m
+一丝一毫 67 m
+一丝不挂 60 i
+一丝不紊 3 i
+一丝不苟 112 i
+一丝丝 58 mq
+一丝两气 3 i
+一丝半粟 3 i
+一两 382 m
+一两一 2 m
+一两一两 2 m
+一两万 40 m
+一两万元 6 m
+一两万块 4 m
+一两万美元 2 m
+一两丈 5 m
+一两下 7 m
+一两个 424 m
+一两九十元 2 m
+一两二两 3 m
+一两五 4 m
+一两件 39 m
+一两倍 4 m
+一两八 5 m
+一两分 7 m
+一两分钟 17 m
+一两千 38 m
+一两千元 3 m
+一两千块 2 m
+一两千平方米 2 m
+一两千架 2 m
+一两半两 2 m
+一两发 2 m
+一两口 7 m
+一两句 68 m
+一两句话 3 i
+一两只 21 m
+一两叶 2 m
+一两名 8 m
+一两周 4 m
+一两回 8 m
+一两场 10 m
+一两块 4 m
+一两声 24 m
+一两处 14 m
+一两多 5 m
+一两天 169 m
+一两套 7 m
+一两家 13 m
+一两寸 3 m
+一两尺 2 m
+一两岁 17 m
+一两年 164 m
+一两张 8 m
+一两成 2 m
+一两手 8 m
+一两折 2 m
+一两招 12 m
+一两支 3 m
+一两日 19 m
+一两月 7 m
+一两本 8 m
+一两条 8 m
+一两杯 5 m
+一两枚 8 m
+一两株 2 m
+一两样 13 m
+一两根 4 m
+一两次 73 m
+一两款 2 m
+一两步 5 m
+一两点 19 m
+一两片 6 m
+一两百 7 m
+一两百万 4 m
+一两百个 2 m
+一两百元 5 m
+一两百年 7 m
+一两碗 2 m
+一两秒 3 m
+一两篇 5 m
+一两米 6 m
+一两辆 2 m
+一两遍 2 m
+一两部 6 m
+一两里 3 m
+一两重 5 m
+一两门 3 m
+一两间 4 m
+一两页 17 m
+一两项 6 m
+一两颗 5 m
+一两首 3 m
+一个 142747 m
+一个一个把 2 m
+一个一千多年 2 m
+一个一号 2 m
+一个一尺 2 m
+一个一岁 4 m
+一个一百多年 2 m
+一个一百多斤 2 m
+一个一米 3 m
+一个七八 2 m
+一个七八岁 8 m
+一个七十 2 m
+一个七十岁 2 m
+一个七品 4 m
+一个七岁 2 m
+一个万里 2 m
+一个三十 19 m
+一个三十余岁 2 m
+一个三十出头 3 m
+一个三十多岁 25 m
+一个三十岁 6 m
+一个三品 3 m
+一个三四岁 3 m
+一个三四百 2 m
+一个三天 4 m
+一个三层 4 m
+一个三岁 7 m
+一个三维 4 m
+一个三面 3 m
+一个两万四千元 2 m
+一个两万多 4 m
+一个两岁 7 m
+一个个 2055 m
+一个九十度 2 m
+一个九品 3 m
+一个九头 4 m
+一个九岁 3 m
+一个九曲 2 m
+一个二两 2 m
+一个二元 7 m
+一个二十 11 m
+一个二十七八岁 3 m
+一个二十三岁 3 m
+一个二十五六岁 7 m
+一个二十五岁 3 m
+一个二十多岁 13 m
+一个二十岁 6 m
+一个二维 4 m
+一个二重 3 m
+一个五六岁 2 m
+一个五十 11 m
+一个五十两 2 m
+一个五十余岁 2 m
+一个五十多岁 16 m
+一个五十岁 3 m
+一个五十左右 2 m
+一个五品 5 m
+一个五尺 2 m
+一个五岁 12 m
+一个五百 2 m
+一个五袋 2 m
+一个亿 24 m
+一个亿万 4 m
+一个伍 2 m
+一个八九十岁 2 m
+一个八九岁 6 m
+一个八品 2 m
+一个八岁 2 m
+一个六七岁 5 m
+一个六十 2 m
+一个六十七岁 2 m
+一个六十多 2 m
+一个六十多岁 2 m
+一个六十岁 2 m
+一个六口 2 m
+一个六品 16 m
+一个六尺 2 m
+一个六层 2 m
+一个六岁 6 m
+一个几万 6 m
+一个几亿 17 m
+一个几千万元 2 m
+一个几岁 3 m
+一个几百万 5 m
+一个劲 42 d
+一个劲儿 143 d
+一个劲地 101 d
+一个包 26 m
+一个十 18 m
+一个十一 4 m
+一个十一二岁 7 m
+一个十七八岁 8 m
+一个十七岁 6 m
+一个十七级 2 m
+一个十三四岁 11 m
+一个十三岁 4 m
+一个十个 3 m
+一个十九岁 3 m
+一个十二 22 m
+一个十二三岁 9 m
+一个十二岁 3 m
+一个十五六岁 9 m
+一个十五岁 8 m
+一个十余丈 4 m
+一个十余岁 2 m
+一个十八九岁 7 m
+一个十八岁 11 m
+一个十六七岁 12 m
+一个十六岁 4 m
+一个十几岁 14 m
+一个十四五岁 9 m
+一个十四岁 4 m
+一个十多岁 4 m
+一个十岁 10 m
+一个千 15 m
+一个千年 4 m
+一个半 148 m
+一个半头 4 m
+一个半月 52 m
+一个半桩 2 m
+一个双 30 m
+一个名 76 m
+一个响 21 m
+一个四六级 2 m
+一个四十 11 m
+一个四十余岁 4 m
+一个四十出头 2 m
+一个四十多岁 19 m
+一个四十岁 4 m
+一个四品 6 m
+一个四圈 2 m
+一个四岁 5 m
+一个团 89 m
+一个圈 29 m
+一个多 378 m
+一个多亿 3 m
+一个多元 8 m
+一个多头 2 m
+一个多月 406 m
+一个多项 2 m
+一个天 93 m
+一个头 70 m
+一个套 14 m
+一个家 94 m
+一个少数派 2 m
+一个尺 5 m
+一个巴掌拍不响 9 l
+一个帖 8 m
+一个床 9 m
+一个心眼 3 l
+一个情节 3 t
+一个愿打 3 n
+一个愿挨 3 nr
+一个打 86 m
+一个拖拉机 2 l
+一个排 42 m
+一个支 24 m
+一个数万 3 m
+一个整 13 m
+一个整团 3 m
+一个月 1811 m
+一个样 62 m
+一个样儿 5 m
+一个桶 5 m
+一个点 77 m
+一个班 84 m
+一个瓢 4 m
+一个甲子 5 m
+一个男孩 3 n
+一个百里 2 m
+一个盆 5 m
+一个碗 17 m
+一个程 5 m
+一个第一次 16 m
+一个第三种 2 m
+一个筐 5 m
+一个箭步 3 l
+一个系列 14 m
+一个纸 36 m
+一个组 18 m
+一个终日 2 m
+一个终生 4 m
+一个肚子 6 m
+一个胎 2 m
+一个脚印 4 n
+一个舒服 3 n
+一个萝卜一个坑 8 l
+一个角 13 m
+一个身 56 m
+一个通 25 m
+一个遍 7 m
+一个集 20 m
+一个零 10 m
+一个顶 20 m
+一个鼻孔 3 l
+一中 5590 s
+一中一台 45 l
+一中全会 227 j
+一中院 13 j
+一串 687 m
+一串串 4 n
+一串红 2 l
+一串骊珠 3 i
+一丸 3 n
+一举 848 d
+一举一动 190 i
+一举万里 3 i
+一举三反 3 i
+一举三得 13 i
+一举两全 3 i
+一举两得 67 i
+一举中标 3 l
+一举之劳 3 i
+一举千里 3 i
+一举四得 4 i
+一举多得 9 i
+一举成名 204 i
+一举手一 3 i
+一举数得 11 l
+一久 3 m
+一义 3 n
+一之为甚 3 i
+一之已甚 3 i
+一之谓甚 3 nr
+一乐 3 a
+一乙醇胺 6 nz
+一九 25 m
+一九一一 2 m
+一九一九年 5 m
+一九一二年 2 m
+一九一五年 2 m
+一九一六年 4 m
+一九一四年 3 m
+一九七 20 m
+一九七一年 8 m
+一九七七 4 m
+一九七七年 18 m
+一九七三年 8 m
+一九七九年 23 m
+一九七二年 12 m
+一九七五年 8 m
+一九七八 3 m
+一九七八年 15 m
+一九七六 3 m
+一九七六年 28 m
+一九七四年 5 m
+一九七零年 4 m
+一九三 6 m
+一九三一年 4 m
+一九三七年 23 m
+一九三三年 4 m
+一九三九年 17 m
+一九三二年 3 m
+一九三五年 9 m
+一九三八年 17 m
+一九三六年 17 m
+一九三四年 4 m
+一九九 12 m
+一九九一年 6 m
+一九九七 7 m
+一九九七年 67 m
+一九九三 2 m
+一九九三年 9 m
+一九九九年 18 m
+一九九二 2 m
+一九九二年 13 m
+一九九五年 20 m
+一九九八 3 m
+一九九八年 47 m
+一九九六 5 m
+一九九六年 19 m
+一九九四年 12 m
+一九九零年 3 m
+一九二 4 m
+一九二七年 15 m
+一九二九 4 m
+一九二九年 2 m
+一九二二年 3 m
+一九二五年 5 m
+一九二八年 6 m
+一九二四年 6 m
+一九五 42 m
+一九五一年 21 m
+一九五七年 22 m
+一九五三年 19 m
+一九五九年 13 m
+一九五二年 26 m
+一九五五年 17 m
+一九五八年 12 m
+一九五六年 10 m
+一九五四年 21 m
+一九五零年 2 m
+一九八 20 m
+一九八一年 19 m
+一九八七年 5 m
+一九八三年 14 m
+一九八九 2 m
+一九八九年 10 m
+一九八二年 16 m
+一九八五年 9 m
+一九八八年 11 m
+一九八六年 13 m
+一九八四年 16 m
+一九六 17 m
+一九六一年 8 m
+一九六七年 17 m
+一九六三年 22 m
+一九六九年 17 m
+一九六二年 268 m
+一九六五年 20 m
+一九六八年 12 m
+一九六六 3 m
+一九六六年 21 m
+一九六四年 12 m
+一九六零年 2 m
+一九四 13 m
+一九四一 2 m
+一九四一年 10 m
+一九四七年 27 m
+一九四三 3 m
+一九四三年 21 m
+一九四九年 107 m
+一九四二 2 m
+一九四二年 25 m
+一九四五年 19 m
+一九四八 5 m
+一九四八年 24 m
+一九四六年 20 m
+一九四四年 20 m
+一乡 13 m
+一买一卖 3 l
+一乱涂地 3 i
+一乾二净 2 i
+一了百了 61 l
+一了百当 3 i
+一事 893 n
+一事不明 3 i
+一事不知 3 i
+一事无成 59 i
+一二 938 m
+一二一 5 m
+一二万 12 m
+一二万贯 2 m
+一二三 21 m
+一二三四 7 m
+一二三四五 5 m
+一二三四五六七八九十 2 m
+一二两 4 m
+一二个 22 m
+一二九 190 m
+一二二七年 2 m
+一二五 3 m
+一二亩 2 m
+一二件 8 m
+一二位 6 m
+一二例 16 m
+一二倍 2 m
+一二八 20 m
+一二分 8 m
+一二分钟 10 m
+一二十 20 m
+一二十万 8 m
+一二十两 3 m
+一二十个 5 m
+一二十件 2 m
+一二十元 2 m
+一二十匹 3 m
+一二十卷 2 m
+一二十厘米 2 m
+一二十天 3 m
+一二十岁 2 m
+一二十年 24 m
+一二十户 4 m
+一二十日 3 m
+一二十种 2 m
+一二十米 2 m
+一二十里 4 m
+一二十页 3 m
+一二十首 3 m
+一二千 18 m
+一二千两 2 m
+一二千米 4 m
+一二叠 2 m
+一二句 7 m
+一二只 2 m
+一二名 4 m
+一二品 7 m
+一二四 2 m
+一二声 3 m
+一二天 9 m
+一二寸 3 m
+一二尺 6 m
+一二层 3 m
+一二年 41 m
+一二成 6 m
+一二招 3 m
+一二斤 2 m
+一二日 66 m
+一二枚 2 m
+一二根 2 m
+一二次 21 m
+一二点 20 m
+一二片 2 m
+一二百 40 m
+一二百万 3 m
+一二百两 7 m
+一二百个 7 m
+一二百元 3 m
+一二百分 2 m
+一二百号 2 m
+一二百名 6 m
+一二百块 2 m
+一二百年 21 m
+一二百招 2 m
+一二百斤 3 m
+一二百米 5 m
+一二百辆 3 m
+一二百里 7 m
+一二百首 2 m
+一二种 3 m
+一二节 2 m
+一二里 19 m
+一二零 2 m
+一五 90 m
+一五一十 127 m
+一五五年 2 m
+一五日元 2 m
+一五零 2 m
+一些 33468 m
+一些丝 2 m
+一些余部 2 m
+一些则 132 m
+一些半 8 m
+一些半些 3 m
+一些场次 2 m
+一些支 3 m
+一些片 10 m
+一些种 22 m
+一些第三 3 m
+一些篇 5 m
+一些系列 2 m
+一些纸 2 m
+一些美金 2 m
+一产 3 j
+一亩 112 m
+一亮 3 a
+一亲芳泽 3 nr
+一人之下 26 i
+一人之交 3 i
+一人份 3 m
+一人传虚 3 i
+一人向隅 2 l
+一人善射 3 l
+一人得道 7 l
+一人班 3 m
+一亿 51 m
+一亿一千万元 2 m
+一亿一千多万 2 m
+一亿七千万 2 m
+一亿三千万 2 m
+一亿三千万年 2 m
+一亿三千余万两 2 m
+一亿三千多万年 2 m
+一亿两千万 2 m
+一亿二千万 2 m
+一亿五千万 5 m
+一亿人 3 l
+一亿人次 2 m
+一亿八千八百余万元 2 m
+一亿六千多万元 2 m
+一亿分 2 m
+一亿四千五百万日元 2 m
+一亿多 23 m
+一亿多年 4 m
+一亿多美元 2 m
+一亿年 2 m
+一亿担 2 m
+一亿次 18 m
+一亿零一百万两 2 m
+一亿零五百万 2 m
+一介 3 n
+一介不取 3 l
+一介不苟 3 i
+一介之善 3 l
+一介之士 3 i
+一介之才 3 l
+一介书生 20 n
+一介武夫 3 nr
+一仍其旧 3 nr
+一仍旧贯 3 nr
+一代 2101 m
+一代人 66 n
+一代代 93 m
+一代宗师 3 i
+一代宗臣 3 i
+一代文宗 3 nz
+一代新人 3 nz
+一代楷模 3 nr
+一代英豪 3 l
+一代谈宗 3 nz
+一代豪杰 3 i
+一代风流 3 i
+一代鼎臣 3 i
+一以当十 3 i
+一以当百 3 i
+一以贯之 44 i
+一件 6216 m
+一件件 2 l
+一任 188 m
+一份 3677 m
+一伍 3 n
+一休哥 3 n
+一伙 491 m
+一伙人 3 r
+一伙儿 3 r
+一会 3178 m
+一会一节 5 m
+一会儿 3200 m
+一会儿双行 2 m
+一会儿回 2 m
+一会儿天 3 m
+一会儿头 2 m
+一会儿开 8 m
+一会儿张 2 m
+一会儿打 4 m
+一会儿摊 2 m
+一会儿步 2 m
+一会儿站 13 m
+一会儿记 2 m
+一会儿门 4 m
+一会家 3 m
+一会开 2 m
+一会方 2 m
+一传 72 b
+一传十 3 i
+一似 3 a
+一位 9387 m
+一位数 3 l
+一体 1526 n
+一体化 1178 l
+一体同心 3 l
+一体式 6 l
+一体机 29 d
+一佛出世 5 l
+一例 226 m
+一侧 729 f
+一便士 2 n
+一俟 3 nrt
+一倍 986 m
+一倡一和 3 l
+一倡三叹 3 l
+一倡百和 3 l
+一偏 3 d
+一偏之见 3 i
+一偏之论 3 i
+一停 3 d
+一元 168 m
+一元二次方程 3 nz
+一元函数 3 l
+一元化 25 t
+一元复始 5 l
+一元大武 3 t
+一元方程 3 l
+一元论 35 n
+一元说 3 l
+一元酸 2 n
+一元醇 6 n
+一兆元 3 nr
+一克 14 m
+一党制 29 n
+一党独大 3 i
+一兜 10 m
+一八 1096 m
+一八九 3 m
+一八九九 3 m
+一八二六年 2 m
+一八八七年 3 m
+一八八五年 2 m
+一八四八年 2 m
+一公顷 6 m
+一六 11 m
+一六六 2 m
+一六四八年 2 m
+一六四四 2 m
+一六角 2 m
+一共 726 j
+一兵一卒 3 i
+一具 468 m
+一内一外 3 j
+一册 54 m
+一再 1140 d
+一再嘱咐 3 l
+一再声明 3 i
+一再强调 3 l
+一再表示 3 i
+一再说明 3 i
+一写出 3 i
+一写到 3 i
+一决胜负 3 l
+一决雌雄 28 l
+一准 32 n
+一准儿 2 l
+一凉 3 a
+一几 10 m
+一出 964 m
+一出场 3 m
+一出头 3 m
+一出戏 3 i
+一击必杀 3 i
+一刀 1547 m
+一刀两断 60 i
+一刀两段 14 i
+一刀切 67 i
+一刀斩 3 v
+一分 1236 m
+一分一毫 11 m
+一分一秒 2 m
+一分为二 108 i
+一分之差 3 l
+一分收获 3 i
+一分耕耘 3 n
+一分货 3 n
+一分钟 496 m
+一分钱 3 n
+一分钱一 3 i
+一分高下 4 l
+一切 16361 r
+一切万物 3 l
+一切从严 3 i
+一切众生 17 i
+一切办法 3 l
+一切就简 3 i
+一切权利 3 l
+一切正常 3 i
+一切照旧 3 i
+一切都在 3 i
+一切都是 3 i
+一切顺利 3 i
+一划 3 n
+一列 192 m
+一则 851 m
+一则以喜 3 l
+一则以忧 3 l
+一则以惧 3 i
+一删而空 3 z
+一别 3 d
+一别多年 3 i
+一券 3 n
+一刹 3 n
+一刹那 212 t
+一刻 1150 m
+一刻一刻 2 m
+一刻不停 26 l
+一刻千金 3 m
+一刻多 4 m
+一刻起 71 m
+一刻里 37 m
+一刻钟 47 m
+一刻间 5 m
+一剂 3 n
+一前 3 t
+一前一后 3 i
+一剑 1198 n
+一剑之任 3 i
+一剪梅 5 nr
+一副 1916 m
+一副副 2 j
+一力 79 d
+一力承当 4 l
+一加仑 3 ns
+一动 280 d
+一动不动 503 l
+一动不如一静 2 l
+一劳久逸 3 i
+一劳永逸 34 nr
+一勇之夫 3 i
+一勺 66 m
+一包 364 m
+一包在内 3 l
+一匙 3 n
+一匙之量 3 n
+一匡九合 3 i
+一匡天下 5 i
+一匹 896 m
+一十 36 m
+一十七 9 m
+一十七个 3 m
+一十七具 3 m
+一十七名 3 m
+一十七员 4 m
+一十七岁 2 m
+一十七招 5 m
+一十七枝 2 m
+一十七种 4 m
+一十七路 11 m
+一十三 20 m
+一十三万 2 m
+一十三名 3 m
+一十三处 4 m
+一十三层 2 m
+一十三岁 2 m
+一十三年 11 m
+一十三招 23 m
+一十三拳 13 m
+一十三记 2 m
+一十三载 2 m
+一十三道 2 m
+一十九 12 m
+一十九句 7 m
+一十九名 4 m
+一十九岁 4 m
+一十九道 2 m
+一十二 9 m
+一十二个 4 m
+一十二员 4 m
+一十二年 14 m
+一十二路 3 m
+一十五 24 m
+一十五万 2 m
+一十五个 3 m
+一十五位 3 m
+一十五名 7 m
+一十五员 8 m
+一十五岁 2 m
+一十五年 14 m
+一十五种 3 m
+一十五里 2 m
+一十八 24 m
+一十八个 8 m
+一十八位 7 m
+一十八名 9 m
+一十八天 2 m
+一十八岁 9 m
+一十八年 30 m
+一十八手 2 m
+一十八日 2 m
+一十八架 4 m
+一十八次 2 m
+一十六 10 m
+一十六下 2 m
+一十六名 3 m
+一十六员 5 m
+一十六岁 3 m
+一十六年 40 m
+一十六招 6 m
+一十六枚 3 m
+一十员 6 m
+一十四个 9 m
+一十四员 3 m
+一十四年 2 m
+一十四遍 3 m
+一千 499 m
+一千一万 2 m
+一千一万个 3 m
+一千一百 7 m
+一千一百一十一个 4 m
+一千一百万 2 m
+一千一百万元 2 m
+一千一百万吨 3 m
+一千一百八十 2 m
+一千一百里 2 m
+一千七百 6 m
+一千万 29 m
+一千万两 9 m
+一千万元 12 m
+一千万年 3 m
+一千万斤 2 m
+一千万镑 2 m
+一千三四百 3 m
+一千三百 18 m
+一千三百一十九处 2 m
+一千三百万斤 2 m
+一千三百三十九家 4 m
+一千三百三十五卷 2 m
+一千三百个 2 m
+一千三百余 4 m
+一千三百余名 6 m
+一千三百六十二年 2 m
+一千三百名 3 m
+一千三百多个 2 m
+一千三百多年 3 m
+一千三百文 2 m
+一千三百零八公里 2 m
+一千两 145 m
+一千两千 5 m
+一千两百 4 m
+一千个 96 m
+一千九百个 2 m
+一千九百余 2 m
+一千九百八十门 2 m
+一千九百六十余万日元 2 m
+一千二 3 m
+一千二三百 2 m
+一千二百 18 m
+一千二百七十二处 2 m
+一千二百万 2 m
+一千二百万元 2 m
+一千二百两 4 m
+一千二百九十七所 2 m
+一千二百亩 6 m
+一千二百余种 2 m
+一千二百元 3 m
+一千二百八十三家 2 m
+一千二百六十二万余两 2 m
+一千二百名 6 m
+一千二百块 2 m
+一千二百多 3 m
+一千二百多万 2 m
+一千二百多年 2 m
+一千二百多座 2 m
+一千二百多种 2 m
+一千二百户 2 m
+一千二百株 3 m
+一千二百里 3 m
+一千五 4 m
+一千五百 47 m
+一千五百万 3 m
+一千五百两 7 m
+一千五百九十五万余两 2 m
+一千五百件 2 m
+一千五百余 2 m
+一千五百余处 2 m
+一千五百余家 2 m
+一千五百余箱 2 m
+一千五百元 9 m
+一千五百名 7 m
+一千五百块 6 m
+一千五百多 5 m
+一千五百多个 2 m
+一千五百多名 2 m
+一千五百多处 4 m
+一千五百家 2 m
+一千五百年 3 m
+一千五百文 2 m
+一千五百米 2 m
+一千五百辆 2 m
+一千五百里 3 m
+一千亩 4 m
+一千亿 4 m
+一千亿港元 2 m
+一千件 2 m
+一千份 21 m
+一千余 38 m
+一千余万两 2 m
+一千余万元 2 m
+一千余万斤 2 m
+一千余匹 2 m
+一千余名 5 m
+一千余年 3 m
+一千余里 4 m
+一千余页 2 m
+一千倍 4 m
+一千元 27 m
+一千八九百文 2 m
+一千八声 2 m
+一千八百 4 m
+一千八百万吨 5 m
+一千八百余 2 m
+一千八百余名 2 m
+一千八百八十余个 2 m
+一千八百多块 2 m
+一千八百多年 2 m
+一千公里 2 m
+一千六 3 m
+一千六百 13 m
+一千六百一十六万余 2 m
+一千六百万镑 4 m
+一千六百五十 2 m
+一千六百元 3 m
+一千六百八十五部 2 m
+一千六百四十三所 2 m
+一千六百多文 2 m
+一千几百 2 m
+一千刀 5 m
+一千分 2 m
+一千包 4 m
+一千匹 9 m
+一千卷 7 m
+一千句 5 m
+一千只 10 m
+一千名 37 m
+一千吨 2 m
+一千员 2 m
+一千四五百文 2 m
+一千四百 2 m
+一千四百万零二千七百六十户 2 m
+一千四百二十七万余两 2 m
+一千四百多 4 m
+一千四百多年 2 m
+一千块 36 m
+一千声 2 m
+一千处 2 m
+一千多 101 m
+一千多万 11 m
+一千多个 12 m
+一千多亿颗 2 m
+一千多元 8 m
+一千多公里 2 m
+一千多匹 2 m
+一千多只 5 m
+一千多名 12 m
+一千多吨 3 m
+一千多块 8 m
+一千多家 2 m
+一千多年 176 m
+一千多度 2 m
+一千多米 2 m
+一千多遍 2 m
+一千多部 2 m
+一千多里 16 m
+一千多顷 2 m
+一千天 4 m
+一千头 7 m
+一千家 3 m
+一千岁 2 m
+一千左右 3 m
+一千平方公里 3 m
+一千年 68 m
+一千度 2 m
+一千户 7 m
+一千把 2 m
+一千招 3 m
+一千文 24 m
+一千斤 6 m
+一千有余 2 m
+一千本 3 m
+一千条 7 m
+一千架 8 m
+一千次 22 m
+一千步 12 m
+一千点 2 m
+一千碗 2 m
+一千箱 2 m
+一千美元 2 m
+一千遍 11 m
+一千部 2 m
+一千里 13 m
+一千间 3 m
+一千零一夜 30 m
+一千零七 2 m
+一千零二十 2 m
+一千零二十四锭 2 m
+一千零五 2 m
+一千零六 2 m
+一千零六十三卷 2 m
+一千零六十六公里 2 m
+一千顷 2 m
+一半 4586 m
+一半一半 2 m
+一半儿 43 m
+一半分 4 m
+一半则 8 m
+一半处 2 m
+一半多 20 m
+一半多一点 3 m
+一半左右 51 m
+一半折 2 m
+一半摊 3 m
+一半站 4 m
+一半脸 2 m
+一半路 6 m
+一华里 2 m
+一卡通 20 nz
+一卧不起 3 i
+一卷 348 m
+一压下 3 l
+一压到 3 l
+一压在 3 l
+一厘 3 ns
+一厢 3 n
+一厢情愿 92 i
+一去一来 3 l
+一去不回 3 i
+一去不复 3 i
+一去不复返 41 i
+一去不复返了 29 l
+一去不返 29 i
+一友 3 n
+一双 1760 m
+一双两好 2 l
+一双千层 2 m
+一双半 5 m
+一双双 40 m
+一双双手 2 m
+一双多 3 m
+一双夜 2 m
+一双家 4 m
+一双滴 2 m
+一双点 2 m
+一双眼 11 m
+一反其道 3 i
+一反常态 58 l
+一反既往 3 i
+一发 545 m
+一发不可 3 i
+一发不可收 8 l
+一发千钧 3 i
+一发发 7 j
+一发破的 3 l
+一发而不可收 11 l
+一发而不可收拾 6 i
+一叠 204 m
+一叠叠 3 m
+一口 3789 m
+一口一声 9 i
+一口三舌 3 i
+一口两匙 3 n
+一口价 3 n
+一口口 39 n
+一口同声 3 i
+一口同音 3 i
+一口咬定 86 i
+一口气 1934 i
+一口泉 3 n
+一口袋 28 mq
+一口钟 3 mq
+一古脑 5 l
+一古脑儿 108 l
+一句 8647 m
+一句句 36 m
+一只 6814 m
+一台 591 m
+一右 3 m
+一叶 146 m
+一叶扁舟 3 n
+一叶报秋 3 n
+一叶知秋 4 i
+一叶荻 3 nr
+一叶蔽目 3 i
+一叶迷山 3 i
+一叶障目 10 n
+一号 802 m
+一号机 2 n
+一号线 7 n
+一号通 3 i
+一同 1031 d
+一名 4733 m
+一后 3 d
+一吐为快 12 i
+一向 1487 d
+一向如此 3 l
+一吠百声 3 i
+一吨 42 m
+一吨半 3 m
+一听之下 3 i
+一员 630 m
+一员大将 3 n
+一周 993 m
+一周岁 6 m
+一周年 320 m
+一味 762 m
+一呵而就 3 i
+一呼再喏 3 nr
+一呼百应 40 l
+一呼百诺 10 l
+一命之荣 3 i
+一命呜呼 183 i
+一命归天 3 i
+一命归西 9 i
+一命归阴 3 l
+一命鸣呼 3 i
+一品 827 m
+一品堂 3 n
+一品夫人 3 n
+一品白衫 3 n
+一品红 136 l
+一品锅 3 n
+一哄而上 28 i
+一哄而散 51 i
+一哄而起 14 i
+一响 746 m
+一唱一和 27 i
+一唱三叹 2 i
+一唱百和 3 i
+一啃 3 l
+一喊出 3 i
+一喊到 3 l
+一喝到 3 l
+一喷一醒 3 i
+一噎止餐 3 i
+一嚬一笑 3 v
+一四 5 m
+一四五团 2 m
+一回 2491 m
+一回回 3 l
+一回生 3 i
+一团 1135 m
+一团乱 3 i
+一团乱麻 29 i
+一团和气 23 n
+一团漆黑 34 i
+一团糟 37 i
+一国三公 3 l
+一国两制 451 l
+一国之主 3 i
+一国之君 3 l
+一圈 806 m
+一圈圈 2 n
+一场 5781 m
+一场场 22 n
+一场春梦 8 i
+一场空 30 n
+一场虚惊 3 i
+一坐一起 3 l
+一坐尽倾 3 i
+一坐尽惊 3 i
+一坐皆惊 3 i
+一块 7001 m
+一块儿 648 d
+一块块 3 d
+一块钱 3 n
+一垒 3 n
+一垒手 3 n
+一堂 113 m
+一堂课 3 n
+一堆 882 m
+一堆堆 3 ns
+一堵 143 m
+一塌刮子 3 i
+一塌糊涂 107 i
+一塌胡涂 36 i
+一墙之隔 27 i
+一壁 34 m
+一壁厢 42 n
+一声 16017 m
+一声不吭 215 l
+一声不响 181 l
+一声令下 146 l
+一声声 101 m
+一声春雷 3 i
+一壶千金 3 i
+一壶水 3 i
+一壶酒 3 i
+一壸千金 3 q
+一处 2335 m
+一处处 28 m
+一夔一契 3 v
+一夔已足 3 nr
+一夕 3 t
+一夕一朝 3 t
+一夕之间 3 i
+一多 53 m
+一多半 63 m
+一多数 17 m
+一多等 2 m
+一夜 1662 m
+一夜之间 3 i
+一夜性 3 l
+一夜情 3 i
+一夜间 297 t
+一夜风流 3 i
+一夥人 3 vn
+一夥儿 3 z
+一大 3248 a
+一大二公 4 i
+一大半 194 m
+一大口 3 m
+一大块 3 m
+一大堆 3 m
+一大宗派 2 nr
+一大家子 25 l
+一大帮 3 m
+一大截 3 m
+一大批 53 m
+一大排 3 m
+一大早 403 l
+一大步 3 m
+一大笔 3 m
+一大笔钱 3 l
+一大群 3 m
+一大跳 3 i
+一大部分 33 m
+一天 8470 m
+一天一地 3 i
+一天两天 3 m
+一天到晚 297 l
+一天天 183 m
+一天星斗 5 i
+一夫 127 n
+一夫一妻 3 i
+一夫一妻制 103 i
+一夫之勇 3 i
+一夫多妻 3 i
+一夫多妻制 48 i
+一夫当关 16 i
+一失一得 3 i
+一失足成 3 i
+一失足成千古恨 7 i
+一头 1916 m
+一头儿 10 l
+一头儿沉 3 i
+一头则 4 m
+一头把 5 m
+一头架 2 m
+一头沉 3 i
+一头热 3 i
+一头雾水 3 l
+一奇 3 a
+一套 2837 m
+一套套 3 m
+一女一男 3 nr
+一奶同胞 3 l
+一好 3 d
+一好百好 3 l
+一如 336 c
+一如往昔 3 i
+一如既往 209 i
+一妻制 3 n
+一妻多夫 3 i
+一子 3 m
+一子一女 3 l
+一孔不达 3 i
+一孔之见 5 i
+一字一句 71 l
+一字一板 11 l
+一字一泪 3 l
+一字一珠 3 i
+一字一顿 53 l
+一字不差 22 l
+一字不易 3 l
+一字不漏 3 i
+一字不苟 3 i
+一字之差 15 l
+一字之师 3 l
+一字之贬 3 l
+一字兼金 3 l
+一字千斤 3 n
+一字千秋 3 i
+一字千金 5 l
+一字千钧 3 i
+一字师 3 n
+一字排开 176 l
+一字褒贬 3 l
+一字连城 3 i
+一字长城 3 n
+一季 75 m
+一季度 403 mq
+一孤之腋 3 i
+一宗 75 m
+一官半职 31 i
+一定 25293 d
+一定不易 3 l
+一定不移 3 i
+一定之规 35 l
+一定量 328 n
+一审 90 n
+一审判决 3 nr
+一室生春 3 i
+一家 5441 m
+一家一户 29 m
+一家一火 3 i
+一家一计 3 i
+一家之主 3 i
+一家之作 3 l
+一家之学 3 l
+一家之言 26 i
+一家之计 3 i
+一家之辞 3 i
+一家之长 7 i
+一家亲 2 n
+一家人 808 n
+一家子 150 n
+一家家 20 l
+一家无二 3 i
+一家村 2 nr
+一家独大 3 i
+一家眷属 3 i
+一家老小 56 l
+一寒如此 3 i
+一寸 303 m
+一寸丹心 3 i
+一寸光阴一寸金 3 i
+一寸赤心 3 i
+一对 2409 m
+一对一 101 m
+一对二 2 m
+一对半 2 m
+一对对 10 m
+一封 1298 m
+一封信 3 i
+一封封 2 ns
+一将难求 9 i
+一尊 209 m
+一小 1343 d
+一小包 3 j
+一小半 25 m
+一小块 3 m
+一小堆 3 l
+一小撮 88 m
+一小撮一小撮 2 m
+一小片 3 m
+一小部分 3 m
+一少 3 m
+一少部分 4 m
+一尘不到 3 i
+一尘不染 85 i
+一尘莫沾 3 i
+一尝 3 d
+一尸两命 3 i
+一尺 282 m
+一尾 60 m
+一局 157 m
+一局上半 3 i
+一局下半 3 i
+一屁股债 3 l
+一层 2761 m
+一层层 90 m
+一层楼 3 n
+一届 480 m
+一展 3 l
+一展无垠 3 l
+一展歌喉 4 l
+一展身手 8 l
+一展长才 3 l
+一展风采 2 l
+一山一水 5 i
+一山之隔 3 i
+一岁 136 m
+一岁一枯 3 nr
+一岁三迁 3 i
+一岁九迁 3 i
+一岁再赦 3 i
+一岁载赦 3 i
+一岗双责 5 l
+一峰 52 m
+一川 7 n
+一左 3 m
+一左一右 3 m
+一差两讹 3 i
+一差二悮 3 n
+一差二误 3 i
+一差二错 3 i
+一差半错 3 i
+一己 3 r
+一己之私 6 i
+一己之见 2 i
+一巴掌 3 i
+一巷 3 n
+一帆顺风 3 i
+一帆风顺 125 i
+一师 78 n
+一帖 31 m
+一带 4254 n
+一带而过 5 l
+一帧 24 m
+一席 219 m
+一席之地 107 l
+一席话 150 l
+一席谈 3 i
+一帮 325 m
+一帮人 3 n
+一幅 1460 d
+一幅幅 11 d
+一幕 548 m
+一幕幕 4 n
+一幢 209 m
+一幢幢 4 z
+一干 3 m
+一干二净 115 l
+一干人犯 10 i
+一平二调 18 nz
+一平方米 18 m
+一年 7966 m
+一年一度 182 l
+一年之计 3 l
+一年之计在于春 3 i
+一年到头 77 l
+一年制 2 l
+一年半载 96 m
+一年四季 143 t
+一年多来 3 l
+一年期 23 t
+一年生 153 b
+一年生植 3 l
+一年级 3 b
+一年计划 3 n
+一并 352 d
+一并处理 3 i
+一床 90 m
+一序列 3 l
+一应 372 d
+一应俱全 100 i
+一府两院 3 j
+一度 2653 mq
+一座 6401 m
+一座座 11 n
+一座皆惊 3 l
+一廉如水 3 i
+一开 240 m
+一开出 3 i
+一开出来 3 l
+一开到 3 l
+一式 3 b
+一式一样 3 l
+一式两份 3 n
+一弘清泉 3 nr
+一弛一张 3 v
+一张 5665 m
+一张一弛 7 i
+一张一驰 3 i
+一张白纸 3 n
+一弹指 3 j
+一弹指顷 3 l
+一当 3 d
+一彻万融 3 i
+一往 3 d
+一往情深 97 i
+一往无前 58 i
+一往直前 5 i
+一往而深 3 i
+一律 1565 d
+一律平等 3 l
+一得 3 d
+一得之功 3 i
+一得之愚 3 i
+一得之见 5 i
+一德一心 2 i
+一心 863 d
+一心一力 3 i
+一心一德 5 i
+一心一意 231 i
+一心一腹 3 i
+一心一计 3 i
+一心一路 3 i
+一心不乱 3 i
+一心两用 3 i
+一心为公 3 i
+一心二用 6 l
+一心同体 2 i
+一心同功 3 i
+一心同归 3 i
+一心向上 3 l
+一心多用 3 l
+一心无二 2 i
+一忍再忍 3 i
+一忙 3 d
+一念 3 n
+一念之差 26 i
+一念之误 3 i
+一念之间 3 i
+一忽儿 66 m
+一忽见 3 l
+一怒之下 104 i
+一怒而去 3 i
+一息 3 n
+一息奄奄 3 i
+一息尚存 16 l
+一悲一喜 3 i
+一想之下 3 l
+一意 3 d
+一意孤行 72 i
+一成 144 m
+一成一旅 3 j
+一成不变 374 i
+一成不易 3 l
+一战 642 j
+一战之下 3 l
+一截 3 m
+一截儿 4 m
+一户 152 m
+一户户 3 i
+一房一厅 3 i
+一所 806 m
+一所所 3 i
+一扇 262 m
+一扇门 3 i
+一手 1665 m
+一手一脚 2 i
+一手一足 6 i
+一手交货 3 n
+一手交钱 3 n
+一手包办 25 i
+一手托天 3 i
+一手独拍 3 l
+一手遮天 14 i
+一打 171 m
+一扫光 3 i
+一扫而光 41 i
+一扫而空 36 i
+一扫而过 3 i
+一批 4476 m
+一批批 6 m
+一技之长 56 i
+一把 4755 m
+一把子 3 l
+一把手 282 m
+一把抓 194 l
+一把死拿 3 n
+一把汗 3 l
+一抓到底 3 l
+一抔黄土 3 v
+一投手 3 i
+一折 74 m
+一抢而光 8 i
+一抢而空 12 i
+一报到 3 l
+一抬到 3 l
+一抷黄土 3 v
+一抹 200 m
+一抹黑 6 i
+一担 138 m
+一拉之下 3 l
+一拍即合 40 i
+一拍即和 3 i
+一拖 62 j
+一拖二 3 m
+一拖再拖 21 l
+一招 2780 m
+一招一式 99 l
+一招半式 3 l
+一招毙命 3 z
+一拜天地 3 i
+一拥而上 295 i
+一拥而入 21 i
+一拨儿 3 n
+一拳 843 m
+一挂之下 3 i
+一按下 3 l
+一按到 3 l
+一按在 3 l
+一挥九制 3 n
+一挥而就 16 i
+一挥而成 3 i
+一振 3 a
+一捆 106 m
+一捇仆 3 nr
+一捋 3 i
+一损俱损 18 l
+一捺 3 v
+一掉头 3 l
+一掊土 3 vn
+一排 570 m
+一排排 3 j
+一接如旧 3 i
+一推两搡 3 v
+一推之下 3 i
+一推了之 6 i
+一掷乾坤 3 i
+一掷千金 26 i
+一掷百万 3 i
+一提之下 3 i
+一揽包收 3 l
+一揽子 49 l
+一搏 3 n
+一搭一档 6 i
+一搭两用 3 l
+一搭二用 3 l
+一摊 184 m
+一摊子 3 n
+一摞 99 m
+一摸之下 3 i
+一撅一拐 3 v
+一撇 86 m
+一播 3 vn
+一播出 3 n
+一撮 3 m
+一支 3837 m
+一支半节 3 i
+一支花 3 i
+一改故辙 3 i
+一教就会 3 l
+一数 42 m
+一整 8 d
+一整只 4 m
+一整块 5 m
+一整夜 3 m
+一整天 134 m
+一整头 3 m
+一整套 234 m
+一整座 2 m
+一整张 2 m
+一整杯 2 m
+一整片 5 m
+一整瓶 3 m
+一敷 3 v
+一文 471 m
+一文不值 19 l
+一文不名 9 l
+一文如命 3 l
+一文钱 3 n
+一斑 35 n
+一斑半点 3 l
+一斑窥豹 3 i
+一斗 120 m
+一斤 741 m
+一断 3 d
+一新 597 d
+一方 2109 m
+一方之任 3 l
+一方平安 7 m
+一方有难 3 l
+一方水土 4 n
+一方水土养一方人 5 l
+一方面 2945 mq
+一旁 1005 s
+一旁凉快 3 l
+一旁观 16 l
+一族 3 n
+一无可取 2 l
+一无所取 3 i
+一无所得 14 i
+一无所恃 3 i
+一无所成 3 i
+一无所有 158 i
+一无所求 3 i
+一无所知 218 i
+一无所能 3 i
+一无所获 84 i
+一无所长 8 i
+一无所闻 3 i
+一无是处 37 l
+一无长物 3 l
+一日 2277 m
+一日万几 3 m
+一日万机 3 l
+一日万里 3 m
+一日三复 3 i
+一日三岁 3 m
+一日三月 3 m
+一日三省 2 ns
+一日三秋 2 i
+一日三覆 3 i
+一日三餐 59 m
+一日不见 8 l
+一日为师 3 i
+一日之功 11 i
+一日之计 3 i
+一日之长 5 i
+一日之雅 3 i
+一日九迁 3 i
+一日份 3 m
+一日千丈 3 m
+一日千里 26 m
+一日数惊 3 l
+一日日 8 m
+一日游 109 l
+一旦 5312 d
+一旦一夕 3 i
+一早 785 d
+一旬 3 t
+一时 5389 d
+一时一事 3 l
+一时一刻 8 d
+一时三刻 118 m
+一时之权 3 l
+一时之秀 3 i
+一时之选 4 i
+一时之间 3 l
+一时伯仲 3 nr
+一时冲动 3 i
+一时千载 3 m
+一时半会 13 l
+一时半会儿 51 l
+一时半刻 28 i
+一时半晌 3 t
+一时半霎 3 t
+一时性 17 d
+一时拥有 3 i
+一时无两 3 i
+一时期 702 d
+一时间 469 t
+一星半点 17 m
+一星级 5 b
+一是一 18 l
+一昼 3 n
+一显身手 34 i
+一晃 488 a
+一晃儿 3 nr
+一晃眼 3 i
+一晃而过 3 i
+一晚 3 t
+一晤 3 v
+一晦一明 3 i
+一暗 3 d
+一暝不视 3 v
+一暴十寒 3 l
+一曝十寒 3 i
+一曲 359 m
+一曲曲 2 n
+一曲阳关 3 l
+一月 623 m
+一月份 276 mq
+一月底 2 t
+一服 31 m
+一服药水 3 n
+一望无垠 12 i
+一望无涯 2 i
+一望无边 9 i
+一望无际 82 i
+一望而知 29 i
+一朝 196 t
+一朝一夕 79 i
+一朝之忿 3 i
+一朝之患 3 i
+一朝千里 3 i
+一朝天子 3 i
+一朝天子一朝臣 10 i
+一期 641 d
+一期稻作 3 l
+一木难支 3 i
+一本 1467 m
+一本万利 24 l
+一本初衷 3 i
+一本正经 224 d
+一朵 509 m
+一朵朵 37 m
+一朵花 3 n
+一机部 9 n
+一杆 147 m
+一村 313 n
+一束 496 m
+一束花 3 n
+一杠 3 n
+一条 10251 m
+一条心 58 d
+一条条 5 l
+一条线 3 l
+一条藤 3 n
+一条藤儿 2 l
+一条街 86 n
+一条龙 93 i
+一来 854 d
+一来一去 3 i
+一来一往 3 d
+一来二去 48 l
+一来二往 3 d
+一杯 1464 m
+一杯杯 4 m
+一板一眼 32 i
+一板三眼 5 i
+一枕南柯 3 nr
+一枕槐安 3 nr
+一枕邯郸 3 ns
+一枕黄梁 3 i
+一枕黄粱 2 i
+一枚 1071 m
+一枝 605 m
+一枝一栖 3 nr
+一枝一节 3 i
+一枝之栖 3 nr
+一枝春 3 i
+一枝梅 2 nr
+一枝独秀 35 i
+一枝花 3 i
+一枝香 3 i
+一枝黄花 3 i
+一枪 467 m
+一架 989 m
+一架次 2 m
+一柜 3 n
+一查到底 3 l
+一柱 40 m
+一柱承天 3 nr
+一柱擎天 3 n
+一栋 127 m
+一栋栋 3 i
+一栏 3 d
+一树了之 3 i
+一树百获 3 i
+一栖两雄 3 l
+一株 743 m
+一株株 2 i
+一样 22569 r
+一样样 9 l
+一根 2778 m
+一根一板 3 nz
+一格 3 n
+一框 2 m
+一案 169 m
+一桌 270 m
+一档 49 m
+一档子 11 m
+一桩 328 m
+一桶 152 m
+一桶桶 3 n
+一梦 50 n
+一梦华胥 3 nr
+一梭 3 n
+一梯 3 n
+一梯次 3 b
+一棍子 3 n
+一棍子打死 16 i
+一棵 668 m
+一棵树 99 ns
+一棵树上吊死 5 l
+一楼 106 n
+一概 467 d
+一概不理 3 i
+一概不知 3 i
+一概而论 49 i
+一榻横陈 3 n
+一榻糊涂 3 n
+一榻胡涂 3 n
+一槌定音 3 i
+一模一样 591 l
+一模二样 3 l
+一次 19249 m
+一次函数 3 l
+一次性 429 d
+一次方程 15 m
+一次次 155 m
+一次能源 3 nz
+一款 295 m
+一歌 4 m
+一正 3 d
+一正一负 3 i
+一步 5346 m
+一步一个脚印 37 l
+一步一趋 3 i
+一步一鬼 3 i
+一步之遥 3 l
+一步到位 42 l
+一步棋 3 l
+一步步 259 m
+一步法 3 l
+一步登天 41 i
+一步舞 3 l
+一死一伤 3 i
+一死一生 3 i
+一死了之 3 i
+一段 4532 m
+一段时间 3 l
+一段段 2 n
+一段票 3 n
+一段落 3 l
+一段话 3 l
+一段距离 3 n
+一段路 3 l
+一比 3 j
+一毛不拔 14 i
+一毛钱 3 n
+一毫 3 m
+一毫不差 3 i
+一毫不染 3 i
+一毫不苟 3 i
+一毫千里 3 m
+一毫升 2 m
+一民同俗 3 i
+一气 127 n
+一气之下 56 i
+一气呵成 84 i
+一气浑成 3 i
+一氧化二氮 4 nz
+一氧化氮 12 nz
+一氧化物 3 n
+一氧化碳 191 nz
+一氧化铅 2 nz
+一氯甲烷 2 nz
+一水之隔 6 i
+一水儿 3 n
+一江之隔 5 i
+一江春水向东流 24 i
+一池 3 n
+一池春水 3 i
+一池秋水 3 i
+一汪 28 m
+一汽 71 j
+一汽大众 2 nt
+一汽集团 4 nt
+一沓 82 m
+一法郎 3 m
+一波万波 3 i
+一波三折 34 i
+一波又起 22 i
+一波未平 24 i
+一泻万里 3 i
+一泻千里 17 i
+一泻百里 3 i
+一泻而下 6 i
+一泼 3 a
+一洗尘俗 3 i
+一派 1318 m
+一派胡言 23 l
+一流 1366 n
+一流人才 3 i
+一流大学 3 l
+一浆十饼 3 n
+一浪高过一浪 22 l
+一涂 3 a
+一清二楚 321 l
+一清二白 5 l
+一清如水 3 l
+一清早 54 t
+一溜 189 m
+一溜儿 22 d
+一溜歪斜 3 l
+一溜烟 108 d
+一溜烟儿 3 l
+一溜风 3 l
+一滑 3 a
+一滴 348 m
+一滴水 3 n
+一潭死水 12 i
+一灯 862 n
+一灯大师 3 i
+一炖 3 v
+一炮打响 12 l
+一炮而红 3 l
+一炷香 3 z
+一点 14165 m
+一点一撇 2 m
+一点一滴 78 m
+一点一点 133 m
+一点一点把 3 m
+一点两点 5 m
+一点五万 2 m
+一点五米 2 m
+一点余 2 m
+一点儿 1058 m
+一点儿一点儿 5 m
+一点六亿 4 m
+一点几 3 m
+一点半 3 m
+一点半滴 2 m
+一点半点 5 m
+一点四十五分 5 m
+一点多 138 m
+一点很多 3 m
+一点灵犀 3 nr
+一点点 735 m
+一点点儿 12 m
+一点红 14 l
+一点钟 3 m
+一烘 3 a
+一熟 3 a
+一爱上 3 l
+一片 6931 m
+一片丹心 3 nz
+一片冰心 3 i
+一片宫商 3 n
+一片成名 3 i
+一片散沙 3 i
+一片汪洋 39 i
+一片焦土 9 n
+一片片 122 m
+一片狼藉 15 i
+一片生机 3 l
+一片痴心 3 i
+一片空白 3 l
+一片至诚 3 l
+一片苦心 3 i
+一版再版 2 l
+一牛九锁 3 i
+一牛吼地 3 n
+一牛鸣 3 i
+一牛鸣地 3 i
+一物 3 n
+一物不知 3 l
+一犬吠形 3 i
+一狐之腋 3 i
+一狠二狠 3 d
+一献三售 3 l
+一献三酬 3 l
+一环扣一环 8 l
+一现昙华 3 z
+一班 389 m
+一班一级 3 l
+一班一辈 3 l
+一班人 132 n
+一班人马 5 ns
+一班半点 3 n
+一球 3 n
+一琴一鹤 3 i
+一瓢 76 m
+一瓣 3 n
+一瓣心香 3 n
+一瓦 9 m
+一瓶 326 m
+一瓶子不满 2 n
+一生 3488 m
+一生一世 149 l
+一生一代 3 t
+一生不变 3 i
+一生九死 3 i
+一生何求 3 l
+一用到 3 l
+一甲子 3 n
+一甲子六十年 2 m
+一甲胺 4 nz
+一男一女 3 l
+一男二女 3 l
+一男半女 6 l
+一画开天 3 i
+一番 3553 m
+一番多 6 m
+一番夜 2 m
+一番方 2 m
+一番滋味 3 n
+一番苦心 3 i
+一番话 151 n
+一番重 3 m
+一病不起 42 i
+一瘸一拐 3 v
+一登龙门 3 ns
+一百 472 m
+一百一十 9 m
+一百一十七个 2 m
+一百一十万箱 2 m
+一百一十三个 2 m
+一百一十三根 2 m
+一百一十九个 3 m
+一百一十九种 2 m
+一百一十二 2 m
+一百一十二万 2 m
+一百一十二文 2 m
+一百一十二着 2 m
+一百一十五座 2 m
+一百一十余名 2 m
+一百一十余处 2 m
+一百一十八万三千四百七十七亩 2 m
+一百一十八篇 2 m
+一百一十六个 2 m
+一百一十六卷 2 m
+一百一十六家 2 m
+一百一十卷 3 m
+一百一十多万户 2 m
+一百一十多元 2 m
+一百一十里 2 m
+一百七 4 m
+一百七十 2 m
+一百七十一万四千余 2 m
+一百七十三 2 m
+一百七十九斤 2 m
+一百七十亩 2 m
+一百七十亿 3 m
+一百七十余 2 m
+一百七十余年 3 m
+一百七十六篇 2 m
+一百七十卷 3 m
+一百七十四 2 m
+一百七十四卷 2 m
+一百七十多 3 m
+一百七十多万 2 m
+一百七十多个 2 m
+一百七十年 2 m
+一百万 108 m
+一百万两 43 m
+一百万两则 2 m
+一百万个 9 m
+一百万倍 2 m
+一百万元 9 m
+一百万名 2 m
+一百万年 2 m
+一百万户 3 m
+一百万斤 4 m
+一百万毫升 2 m
+一百万瓶 2 m
+一百万美元 4 m
+一百万贯 3 m
+一百万贯两匹 2 m
+一百万镑 5 m
+一百丈 3 m
+一百三十 11 m
+一百三十一卷 2 m
+一百三十一里 2 m
+一百三十七万两 2 m
+一百三十七卷 2 m
+一百三十七所 2 m
+一百三十万两 2 m
+一百三十个 2 m
+一百三十五万三千四百一十八两 2 m
+一百三十五亿年 2 m
+一百三十余万 2 m
+一百三十余篇 2 m
+一百三十元 4 m
+一百三十八 3 m
+一百三十卷 8 m
+一百三十名 2 m
+一百三十四万余两 2 m
+一百三十四万多亩 2 m
+一百三十四两 2 m
+一百三十四年 2 m
+一百三十多万 4 m
+一百三十多万户 2 m
+一百三十多名 2 m
+一百三十年 3 m
+一百三十斤 2 m
+一百三十里 3 m
+一百下 4 m
+一百两 110 m
+一百两百 2 m
+一百个 242 m
+一百九十 7 m
+一百九十三 3 m
+一百九十个 2 m
+一百九十余 2 m
+一百九十八 3 m
+一百九十六 2 m
+一百九十多匹 2 m
+一百二 4 m
+一百二三十万两 3 m
+一百二三十斤 2 m
+一百二十 26 m
+一百二十一万 2 m
+一百二十七 2 m
+一百二十七辆 2 m
+一百二十万 7 m
+一百二十万两 3 m
+一百二十万平方公里 2 m
+一百二十个 25 m
+一百二十九万元 2 m
+一百二十九个 2 m
+一百二十二个 2 m
+一百二十五 4 m
+一百二十五年 2 m
+一百二十余 5 m
+一百二十元 4 m
+一百二十八 5 m
+一百二十八万 2 m
+一百二十八两 3 m
+一百二十六 3 m
+一百二十刀 3 m
+一百二十分 2 m
+一百二十名 2 m
+一百二十四个 2 m
+一百二十四卷 4 m
+一百二十四年 2 m
+一百二十块 4 m
+一百二十处 2 m
+一百二十多 5 m
+一百二十多万 2 m
+一百二十多个 4 m
+一百二十多件 2 m
+一百二十家 4 m
+一百二十岁 4 m
+一百二十年 8 m
+一百二十文 2 m
+一百二十斤 6 m
+一百二十条 2 m
+一百二十步 6 m
+一百二十毫米 8 m
+一百二十股 2 m
+一百二十行 2 m
+一百二十里 9 m
+一百五六十分 2 m
+一百五六十年 2 m
+一百五十 27 m
+一百五十万 12 m
+一百五十万两 5 m
+一百五十万元 2 m
+一百五十万英镑 2 m
+一百五十万贯 2 m
+一百五十万镑 2 m
+一百五十三 2 m
+一百五十两 19 m
+一百五十个 3 m
+一百五十九卷 2 m
+一百五十九座 2 m
+一百五十二 2 m
+一百五十二万 4 m
+一百五十五 2 m
+一百五十亩 2 m
+一百五十余 6 m
+一百五十余家 2 m
+一百五十余年 4 m
+一百五十元 13 m
+一百五十八支 2 m
+一百五十公里 7 m
+一百五十卷 4 m
+一百五十名 13 m
+一百五十四万余 2 m
+一百五十块 3 m
+一百五十多个 3 m
+一百五十多年 2 m
+一百五十套 2 m
+一百五十年 10 m
+一百五十斤 7 m
+一百五十步 7 m
+一百五十毫米 13 m
+一百五十里 5 m
+一百五十门 2 m
+一百亩 18 m
+一百亿 7 m
+一百亿年 2 m
+一百亿美元 2 m
+一百件 8 m
+一百位 2 m
+一百余 34 m
+一百余万 4 m
+一百余万两 2 m
+一百余丈 2 m
+一百余位 2 m
+一百余名 3 m
+一百余员 2 m
+一百余家 3 m
+一百余岁 2 m
+一百余年 9 m
+一百余招 8 m
+一百余里 11 m
+一百倍 31 m
+一百元 65 m
+一百八 27 m
+一百八十 8 m
+一百八十七 2 m
+一百八十七条 2 m
+一百八十三亿 2 m
+一百八十九 2 m
+一百八十八公斤 2 m
+一百八十八天 2 m
+一百八十八种 2 m
+一百八十卷 2 m
+一百八十四公里 2 m
+一百八十四年 2 m
+一百八十年 3 m
+一百八十度 19 m
+一百八十斤 2 m
+一百八十种 2 m
+一百八十里 11 m
+一百八瓶 2 m
+一百公里 4 m
+一百六七十斤 2 m
+一百六十 8 m
+一百六十一吨 2 m
+一百六十万 4 m
+一百六十万元 2 m
+一百六十万四千二百多镑 2 m
+一百六十两 3 m
+一百六十个 5 m
+一百六十五 5 m
+一百六十五辆 2 m
+一百六十八年 2 m
+一百六十八种 2 m
+一百六十六 4 m
+一百六十六元 2 m
+一百六十六公里 2 m
+一百六十卷 2 m
+一百六十四 2 m
+一百六十四座 2 m
+一百六十四里 2 m
+一百六十多 2 m
+一百六十多万 2 m
+一百六十多年 2 m
+一百几十 2 m
+一百几十个 3 m
+一百几十年 2 m
+一百分 14 m
+一百匹 14 m
+一百十一万 2 m
+一百千米 2 m
+一百单八 4 m
+一百单八将 7 i
+一百卷 22 m
+一百双 2 m
+一百句 7 m
+一百只 20 m
+一百号 2 m
+一百名 77 m
+一百周年 7 m
+一百四五十 4 m
+一百四十 6 m
+一百四十一个 2 m
+一百四十七万余顷 2 m
+一百四十三公里 2 m
+一百四十三天 2 m
+一百四十两 2 m
+一百四十九 2 m
+一百四十余处 2 m
+一百四十余户 2 m
+一百四十六万 4 m
+一百四十六座 2 m
+一百四十卷 5 m
+一百四十四 2 m
+一百四十四卷 2 m
+一百四十块 3 m
+一百四十多个 2 m
+一百回 5 m
+一百圈 3 m
+一百块 52 m
+一百声 6 m
+一百多 93 m
+一百多万 23 m
+一百多万两 2 m
+一百多万平方公里 2 m
+一百多丈 2 m
+一百多两 4 m
+一百多个 38 m
+一百多亩 2 m
+一百多亿美元 2 m
+一百多位 30 m
+一百多元 10 m
+一百多公里 5 m
+一百多匹 4 m
+一百多只 8 m
+一百多号 5 m
+一百多名 37 m
+一百多块 19 m
+一百多天 12 m
+一百多家 3 m
+一百多岁 3 m
+一百多年 141 m
+一百多张 2 m
+一百多支 2 m
+一百多斤 23 m
+一百多条 5 m
+一百多栋 2 m
+一百多种 3 m
+一百多米 13 m
+一百多遍 2 m
+一百多道 3 m
+一百多部 2 m
+一百多里 28 m
+一百多门 2 m
+一百多间 3 m
+一百多页 5 m
+一百天 28 m
+一百头 16 m
+一百套 4 m
+一百家 4 m
+一百对 2 m
+一百封 2 m
+一百岁 28 m
+一百年 219 m
+一百廿个 2 m
+一百张 13 m
+一百户 7 m
+一百招 17 m
+一百拳 3 m
+一百支 2 m
+一百数十 2 m
+一百数十年 2 m
+一百数十斤 2 m
+一百文 8 m
+一百斤 36 m
+一百日 9 m
+一百有余 2 m
+一百条 14 m
+一百枚 2 m
+一百架 2 m
+一百样 2 m
+一百根 5 m
+一百棵 2 m
+一百次 18 m
+一百步 11 m
+一百海里 2 m
+一百瓦 2 m
+一百种 7 m
+一百篇 3 m
+一百米 30 m
+一百辆 3 m
+一百遍 5 m
+一百里 24 m
+一百零七 2 m
+一百零七余万两 2 m
+一百零七卷 3 m
+一百零三 9 m
+一百零三天 2 m
+一百零九个 2 m
+一百零九页 2 m
+一百零二 2 m
+一百零二卷 2 m
+一百零二岁 2 m
+一百零五 5 m
+一百零五个 4 m
+一百零五岁 2 m
+一百零八 14 m
+一百零八个 3 m
+一百零八位 2 m
+一百零八名 4 m
+一百零八响 2 m
+一百零八颗 4 m
+一百零六 4 m
+一百零六个 2 m
+一百零六岁 2 m
+一百顷 4 m
+一百颗 6 m
+一百首 4 m
+一盅 3 n
+一盆 259 m
+一盎司 4 l
+一盏 460 m
+一盏灯 3 n
+一盏盏 3 n
+一盒 157 m
+一盒盒 3 n
+一盘 392 m
+一盘散沙 52 n
+一盘棋 27 n
+一盘菜 3 n
+一目 233 m
+一目之士 3 i
+一目了然 165 i
+一目五行 3 i
+一目十行 10 i
+一目数行 3 i
+一直 18596 d
+一直未果 3 i
+一相情原 3 i
+一相情愿 8 i
+一盾 6 m
+一省两地 3 i
+一看之下 3 l
+一看再看 3 l
+一眨 3 i
+一眨巴眼 3 i
+一眨眼 3 i
+一眼 5692 m
+一眼看穿 3 l
+一着 331 m
+一着不慎 3 l
+一睹 61 l
+一睹为快 5 l
+一睹之下 3 l
+一睹芳容 3 i
+一瞑不视 3 i
+一瞥 416 n
+一瞧之下 3 vn
+一瞬 232 t
+一瞬千里 3 m
+一瞬即逝 3 i
+一瞬而逝 3 i
+一瞬间 219 m
+一瞬间把 2 m
+一瞻丰采 3 i
+一矢双穿 3 i
+一知半见 3 i
+一知半解 57 i
+一知片解 3 i
+一石两鸟 3 i
+一石二鸟 23 i
+一石多鸟 3 i
+一石激起千层浪 15 l
+一石激起千重浪 3 i
+一码 3 d
+一码事 10 n
+一码当先 3 l
+一码软件 3 l
+一码领先 3 l
+一砖一瓦 3 i
+一碗 1097 m
+一碗水 40 n
+一碗水端平 12 l
+一碟 3 n
+一碧万倾 3 i
+一碧万顷 3 l
+一碧千里 3 i
+一碧如洗 8 i
+一磅 37 m
+一神教 11 nz
+一神论 3 i
+一票 120 m
+一票人 3 n
+一票人马 3 l
+一票制 3 n
+一票否决 7 l
+一票否决制 4 l
+一票否决权 4 l
+一票通 3 n
+一禁 3 d
+一秉大公 2 nr
+一秉至公 3 nr
+一秉虔诚 3 vn
+一种 31355 m
+一秒 135 m
+一秒钟 8 i
+一程 156 n
+一程子 9 n
+一稿多投 3 n
+一穷二白 22 i
+一空依傍 3 nr
+一窍 3 n
+一窍不通 128 i
+一窝蜂 114 d
+一窝风 2 l
+一窥全豹 3 i
+一立方米 3 m
+一竖 3 d
+一站 303 m
+一站式 39 b
+一站站 3 n
+一站通 3 n
+一章 279 m
+一端 737 m
+一竿 3 n
+一竿子 3 i
+一竿子打 3 i
+一笑一颦 2 i
+一笑了之 20 i
+一笑了事 3 i
+一笑倾城 3 i
+一笑千金 2 l
+一笑百媚 3 i
+一笑置之 30 i
+一笑而过 3 l
+一笔 1168 m
+一笔一画 3 i
+一笔不苟 6 i
+一笔划 3 n
+一笔勾断 3 i
+一笔勾消 4 i
+一笔勾销 83 i
+一笔带过 14 l
+一笔抹摋 3 l
+一笔抹杀 3 i
+一笔抹煞 7 i
+一笔笔 2 i
+一笔钩断 3 l
+一第二部 2 m
+一第四部 2 m
+一等 777 m
+一等一 3 b
+一等兵 3 n
+一等功 50 l
+一等品 3 l
+一等奖 443 n
+一等舱 3 n
+一筐 29 m
+一筹 113 j
+一筹莫展 117 i
+一算 3 d
+一算之下 3 i
+一管 3 c
+一箩 3 n
+一箩筐 3 nr
+一箪一瓢 3 nr
+一箪食 3 vn
+一箭上垛 3 n
+一箭之仇 24 i
+一箭之地 24 i
+一箭之遥 7 l
+一箭双 3 i
+一箭双雕 43 i
+一箭双鵰 3 nz
+一箭地 3 n
+一箱 65 m
+一篇 1152 m
+一篇篇 8 m
+一篑之功 3 v
+一篓 16 m
+一篓篓 3 n
+一篮 3 n
+一簇 3 m
+一簇簇 24 m
+一簧两舌 3 n
+一米 208 m
+一米板 3 n
+一米阳光 3 nz
+一类 2906 m
+一粒 575 m
+一粗一细 3 i
+一糊 3 a
+一系 3 m
+一系列 4786 m
+一索得男 3 nr
+一索成男 3 nr
+一紧 3 d
+一约 3 d
+一级 6006 m
+一级代理 3 l
+一级准尉 3 n
+一级品 3 l
+一级相变 3 l
+一级简码 3 l
+一级预防 3 l
+一纸 237 m
+一纸千金 3 i
+一纸空文 29 i
+一线 1398 m
+一线之路 3 l
+一线品牌 3 n
+一线天 12 l
+一线希望 3 nz
+一线生机 47 b
+一线通 3 n
+一练 3 a
+一组 735 m
+一组组 3 m
+一经 563 d
+一统 208 n
+一统天下 76 l
+一统江湖 3 l
+一维 55 m
+一缕 273 m
+一缕缕 3 i
+一缘一会 3 l
+一缸 3 n
+一缸水 3 n
+一罐 46 m
+一网尽扫 3 i
+一网打尽 103 i
+一网通 2 i
+一美元 19 m
+一群 2037 m
+一群群 4 l
+一羽 5 m
+一翻出 3 i
+一翻到 3 l
+一老一少 53 l
+一者 3 c
+一而再 75 i
+一而再再 3 i
+一联 3 j
+一肉之味 3 i
+一肚子 235 m
+一肚子气 3 l
+一肚子火 3 l
+一股 3082 m
+一股劲 3 l
+一股劲儿 28 n
+一股就灵 3 l
+一股脑 31 l
+一股脑儿 34 l
+一股风 28 l
+一肢半节 3 n
+一胎 29 m
+一胎化 2 n
+一脉同气 3 l
+一脉相传 8 l
+一脉相承 56 l
+一脉相通 6 l
+一脉香烟 3 i
+一脚 1104 mq
+一脚不移 3 i
+一脱二 3 i
+一脸 798 m
+一脸茫然 3 i
+一腔 122 m
+一腔热血 20 i
+一腔热诚 3 l
+一臂之力 120 i
+一至于斯 3 nr
+一致 5406 d
+一致同意 3 i
+一致性 140 n
+一致意见 3 i
+一致百虑 3 i
+一般 30311 a
+一般化 21 l
+一般地说 10 l
+一般性 86 l
+一般方程 3 l
+一般无二 22 i
+一般来讲 85 l
+一般来说 146 l
+一般照明 3 l
+一般而言 37 l
+一般而论 34 l
+一般般 5 l
+一般见识 128 l
+一般说来 399 l
+一艘 857 m
+一艘船 3 vn
+一色 183 n
+一节 443 m
+一节课 3 n
+一花独放 3 i
+一花独放不是春 2 i
+一花独秀 3 i
+一苇可航 3 nr
+一英寸 9 m
+一英里 4 m
+一茬 83 m
+一草一木 35 i
+一荣俱荣 19 i
+一荤一素 3 v
+一药 39 n
+一落千丈 51 i
+一落泻势 3 i
+一虎不河 3 i
+一虎势单 3 n
+一蛇两头 3 i
+一行 1619 m
+一行作吏 3 i
+一行行 21 n
+一衣带水 28 i
+一表人才 17 n
+一表人材 4 n
+一表人物 3 n
+一表堂堂 3 i
+一表非俗 11 i
+一表非凡 3 l
+一袋 137 m
+一褱而论 3 v
+一要 3 b
+一要到 3 l
+一见了然 3 i
+一见倾心 10 i
+一见如故 67 i
+一见如旧 3 i
+一见方 2 i
+一见钟情 62 i
+一见锺情 4 nr
+一视同仁 125 i
+一览 71 n
+一览无余 45 i
+一览无遗 8 i
+一览表 41 n
+一觉 3 d
+一角 491 m
+一角钱 3 n
+一觞一咏 3 v
+一触 3 i
+一触即发 117 i
+一触即溃 30 i
+一触即爆 3 l
+一言 3 u
+一言一行 68 i
+一言不发 425 i
+一言不合 3 i
+一言不和 3 i
+一言两语 3 i
+一言丧邦 3 i
+一言中的 3 l
+一言为定 63 l
+一言九鼎 34 i
+一言以蔽 3 l
+一言以蔽之 17 i
+一言兴邦 3 i
+一言千金 3 i
+一言半句 2 i
+一言半语 17 i
+一言半辞 3 i
+一言堂 14 i
+一言既出 66 i
+一言未发 3 i
+一言蔽之 3 i
+一言难尽 56 i
+一议 3 n
+一记 397 m
+一讲出 3 l
+一讲到 3 l
+一试之下 3 i
+一试身手 12 i
+一语不发 3 i
+一语不合 3 i
+一语中人 3 l
+一语中的 17 l
+一语双关 5 l
+一语惊人 4 i
+一语惊醒 3 i
+一语破的 5 l
+一语道破 38 i
+一误再误 3 l
+一说到 3 l
+一诺千金 15 l
+一诺无辞 3 i
+一读再读 3 i
+一调之下 3 l
+一谦四益 3 nr
+一谷不升 3 l
+一谷不登 3 i
+一败如水 3 i
+一败涂地 177 i
+一贫 3 a
+一贫如洗 31 i
+一贯 1030 m
+一贯下来 3 i
+一贯主张 3 n
+一贯作业 3 i
+一贯作风 3 i
+一贯制 34 i
+一贯性 41 n
+一贯方针 3 i
+一贯煎 2 n
+一贯道 3 m
+一资半级 3 l
+一走了之 78 i
+一起 15976 m
+一趟 1001 m
+一足 3 a
+一跃而起 197 i
+一跃而过 3 l
+一跃龙门 3 i
+一跌不振 3 l
+一跌再跌 3 l
+一跤 3 v
+一路 2921 m
+一路上 762 l
+一路下 6 m
+一路两 2 m
+一路出 8 m
+一路分 3 m
+一路则 2 m
+一路发 3 j
+一路响 6 l
+一路平安 31 ns
+一路张 2 m
+一路打 29 m
+一路斗 2 m
+一路派 2 m
+一路盘升 3 l
+一路神祇 3 nz
+一路福星 3 nr
+一路节 2 m
+一路行 36 j
+一路货 3 n
+一路货色 8 l
+一路路 8 m
+一路顺车 3 l
+一路顺风 21 l
+一路领先 3 l
+一路风尘 5 l
+一路风清 3 l
+一踏 3 d
+一蹦三跳 3 l
+一蹭 3 v
+一蹴可几 3 i
+一蹴可及 3 i
+一蹴可成 3 i
+一蹴而及 3 i
+一蹴而就 69 i
+一蹴而得 3 i
+一蹴而成 3 i
+一蹴而易 3 i
+一蹶不兴 3 i
+一蹶不振 87 i
+一蹶不起 3 i
+一身 2291 m
+一身两头 3 i
+一身两役 3 i
+一身二任 3 l
+一身五心 3 i
+一身是汗 3 l
+一身是胆 3 i
+一身正气 12 i
+一身清白 4 l
+一身轻 3 d
+一车 131 m
+一车子 3 n
+一轨同风 3 l
+一转眼 73 d
+一转瞬间 5 i
+一轮 965 m
+一软 3 a
+一轻 30 d
+一载 15 m
+一较高下 3 l
+一较高低 3 n
+一辆 1161 m
+一辆车 3 n
+一辆辆 2 m
+一辈 181 m
+一辈子 1821 m
+一辈子头 4 m
+一辈子打 5 m
+一辈子架 6 m
+一辙 3 n
+一辞同轨 3 i
+一辞莫赞 3 i
+一边 7114 d
+一边倒 80 i
+一过 3 c
+一迎一和 3 i
+一近 3 t
+一还一报 3 i
+一进到 3 l
+一连 569 d
+一连串 347 n
+一连几天 3 i
+一连气儿 3 l
+一迭 3 d
+一迭连声 3 l
+一迳 3 vn
+一途 3 d
+一通 396 m
+一通百通 6 i
+一通通 3 l
+一逞兽欲 3 i
+一遍 2395 m
+一道 3879 m
+一道道 165 mq
+一遭 403 m
+一遮之下 3 i
+一部 2982 m
+一部分 4998 m
+一部分一 19 m
+一部分一部分 2 m
+一部分分 4 m
+一部分千户 2 m
+一部分台 3 m
+一部分周 2 m
+一部分回 2 m
+一部分班 2 m
+一部分瓦 2 m
+一部分第 4 m
+一醉方休 8 l
+一里 155 m
+一重 73 m
+一重一掩 3 i
+一量 3 m
+一针 110 n
+一针一线 25 i
+一针一缐 3 v
+一针见血 71 i
+一钱不值 46 l
+一钱不名 3 i
+一钱如命 3 i
+一铢 3 m
+一锅煮 10 v
+一锅端 11 n
+一锅粥 47 l
+一错 3 a
+一错再错 3 i
+一锤 34 m
+一锤子买卖 8 l
+一锤定音 46 n
+一锭 125 m
+一键 3 n
+一键必杀 3 n
+一锹 3 n
+一镑 7 m
+一长一短 14 i
+一长两短 3 i
+一长串 3 n
+一长二短 3 i
+一长制 68 j
+一长半短 3 i
+一门 2174 m
+一门同气 3 l
+一门心思 97 l
+一门忠烈 3 i
+一闪即逝 3 i
+一闪而过 50 l
+一问一答 3 l
+一问三不 3 l
+一问三不知 29 i
+一问之下 3 i
+一间 1210 m
+一闻千悟 3 i
+一阕 13 m
+一队 791 m
+一阳指 3 n
+一阵 7671 m
+一阵一阵 27 m
+一阵儿 25 m
+一阵发 25 m
+一阵响 51 m
+一阵子 437 m
+一阵子两 2 m
+一阵枪 4 m
+一阵溜 2 m
+一阵线 2 m
+一阵阵 410 m
+一阵雨 3 l
+一阵风 194 l
+一阶半级 3 l
+一阶半职 3 l
+一阶效率 3 n
+一阶理论 3 n
+一院制 847 j
+一隅 663 n
+一隅三反 3 i
+一隅之地 3 i
+一隅之见 3 i
+一隅之说 3 i
+一集 47 m
+一雕双兔 3 i
+一雨成秋 3 i
+一零一 2 m
+一雷二闪 3 l
+一霎 56 t
+一霎时 44 t
+一霎眼 3 t
+一霎那 15 t
+一霎间 3 t
+一霸 3 n
+一面 6773 m
+一面之交 14 i
+一面之款 3 l
+一面之缘 41 i
+一面之识 3 i
+一面之词 26 i
+一面之辞 42 i
+一面之雅 3 i
+一面倒 3 d
+一面儿理 3 l
+一面如旧 3 i
+一面镜子 3 n
+一面面 16 d
+一鞭先著 3 i
+一页 3791 m
+一顶 461 m
+一顷 11 m
+一项 2874 m
+一项项 4 n
+一顺儿 3 nr
+一顾倾城 3 i
+一顾千金 3 i
+一顿 2300 m
+一顿饭 3 i
+一颗 2055 m
+一颗颗 3 n
+一题 3 n
+一颦一笑 28 l
+一风吹 3 i
+一飞冲天 25 i
+一餐 94 m
+一餐饭 3 i
+一饥两饱 3 i
+一饭一啄 3 i
+一饭之德 3 i
+一饭千金 3 l
+一饮一啄 3 i
+一饮而尽 3 i
+一饱口福 3 i
+一饱眼福 18 i
+一馈十起 3 n
+一首 825 m
+一首一尾 9 m
+一首一首 2 m
+一首七 9 m
+一首五 7 m
+一首名 3 m
+一首歌 53 m
+一首首 13 m
+一马一鞍 3 n
+一马平川 21 ns
+一马当先 65 i
+一马领先 3 i
+一驾 10 m
+一骑当千 3 i
+一骨碌 61 d
+一高一低 30 i
+一高二低 3 i
+一鳞一爪 3 i
+一鳞半爪 14 i
+一鳞半甲 3 i
+一鳞片爪 3 i
+一鳞片甲 3 i
+一鸣惊人 33 i
+一麟半爪 3 i
+一麾出守 3 vn
+一鼓一板 3 i
+一鼓作气 88 i
+一鼻子灰 25 l
+一鼻孔 3 i
+一鼻孔出 3 i
+一鼻孔出气 11 i
+一齐 2769 d
+一齐众楚 3 l
+一龙一猪 3 n
+一龙一蛇 3 i
+一龙九种 3 i
+丁 3607 nr
+丁一卯二 3 m
+丁一确二 3 n
+丁一笑 2 nr
+丁一粮 2 nr
+丁丁 24 nr
+丁丁东 4 nr
+丁丁冬冬 4 o
+丁丁咣 2 nr
+丁丁当当 7 o
+丁丁虫 5 nr
+丁七世 3 nr
+丁三爷 9 nr
+丁上篮 2 nr
+丁不三 3 nr
+丁不四 3 nr
+丁丑 17 nr
+丁丑年 2 nr
+丁东 3 nr
+丁中制 3 nr
+丁丹妮 3 nr
+丁乃竺 3 nr
+丁之发 2 nr
+丁二世 6 nr
+丁二侠 2 nr
+丁二烯 46 nr
+丁二石 2 nr
+丁二酮肟 2 nz
+丁二酸 12 nz
+丁二酸酐 2 nz
+丁二醇 12 nr
+丁云鹏 3 nr
+丁五世 2 nr
+丁亥 5 m
+丁亥年 4 m
+丁亥日 2 nz
+丁产 2 n
+丁从征 2 nr
+丁伟志 4 nr
+丁佩华 3 nr
+丁俊晖 5 nr
+丁俊辉 3 nr
+丁修政 2 nr
+丁儒廉 3 nr
+丁元竹 3 nr
+丁充夫 3 nr
+丁先儿 4 nr
+丁先生 11 nr
+丁光生 3 nr
+丁光训 6 nr
+丁克 35 nr
+丁克家庭 3 nr
+丁入地 3 nr
+丁公佶 2 nr
+丁公凿井 3 i
+丁公府 2 nr
+丁公藤 3 nr
+丁六粮 2 nr
+丁关根 66 nr
+丁典叹 2 nr
+丁典抢 3 nr
+丁典攻 2 nr
+丁典猜 2 nr
+丁典笑 2 nr
+丁军门 14 nr
+丁冬 21 nr
+丁凤英 2 nr
+丁力士 2 nr
+丁加奴 10 nr
+丁勇贷 3 nr
+丁卯 277 m
+丁卯年 3 m
+丁卯日 4 m
+丁原洪 6 nr
+丁取忠 8 nr
+丁受田 2 nr
+丁口转 2 nr
+丁吉相 7 nr
+丁同心 2 nr
+丁同提 4 nr
+丁同陪 2 nr
+丁名楠 7 nr
+丁向民 2 nr
+丁善德 8 nr
+丁嘉丽 3 nr
+丁嘉元 3 nr
+丁嘉莉 3 nr
+丁四世 2 nr
+丁国宝 135 nr
+丁坚微微 2 nr
+丁坚铭 7 nr
+丁坝 12 nr
+丁基 70 nr
+丁基橡胶 12 n
+丁基正 2 nr
+丁基胶 3 n
+丁基锂 5 nr
+丁壮之 2 nr
+丁声树 3 nr
+丁大全 41 nr
+丁大利 4 nr
+丁大哥 117 nr
+丁大帝 7 nr
+丁大旺 256 nr
+丁夫人 59 nr
+丁奉合 2 nr
+丁姑娘 2 nr
+丁子峻 3 nr
+丁字 27 nr
+丁字尺 3 nr
+丁字形 14 n
+丁字楼 4 nr
+丁字湾 2 nr
+丁字街 3 nr
+丁字裤 3 nr
+丁字规 3 nr
+丁字镐 3 nr
+丁宁 19 nr
+丁宁宁 4 nr
+丁守中 5 nr
+丁安庆 4 nr
+丁宗洛 2 nr
+丁宝忠 3 nr
+丁审银 3 nr
+丁家人 2 nr
+丁家坎 2 nr
+丁家宜 3 nr
+丁家山 2 nr
+丁家河 7 nr
+丁家洲 4 nr
+丁家花园 2 nr
+丁宽授 2 nr
+丁小华 10 nr
+丁小芹 3 nr
+丁少春 2 nr
+丁尼亚 5 nr
+丁巡抚 2 nr
+丁巳 7 nr
+丁巳日 3 nr
+丁师叔 2 nr
+丁师姊 7 nr
+丁庄镇 3 nr
+丁度 6 n
+丁建华 4 nr
+丁建阳 6 nr
+丁开山 5 nr
+丁当 30 o
+丁征正 2 nr
+丁得孙 35 nr
+丁德尔 2 nr
+丁志刚 2 nr
+丁志忠 4 nr
+丁志成 3 nr
+丁志诚 3 nr
+丁忧 21 nr
+丁念廷 2 nr
+丁思甜 493 nr
+丁恩甜 5 nr
+丁戊己 5 nr
+丁戌 3 m
+丁托列 4 nr
+丁抚台 4 nr
+丁拱辰 2 nr
+丁敏君 161 nr
+丁敏尹 3 nr
+丁数 4 n
+丁文江 25 nr
+丁文沛 2 nr
+丁文深 2 nr
+丁文琪 3 nr
+丁斯特比尔 2 nrt
+丁斯特贝尔 2 nrt
+丁新炉 2 nr
+丁施二 2 nr
+丁无粮 2 nr
+丁日昌 9 nr
+丁春秋 314 nr
+丁是丁 6 nr
+丁是丁卯 3 i
+丁显华 5 nr
+丁晋存 26 nr
+丁晓莲 25 nr
+丁普朗 3 nr
+丁普郎 7 nr
+丁有粮 2 nr
+丁未 7 nr
+丁未七款 2 m
+丁杀季 4 nr
+丁果仙 2 nr
+丁格尔 2 nr
+丁此吕 3 nr
+丁氰橡胶 3 n
+丁汝俊 3 nr
+丁汝夔 14 nr
+丁汝昌 317 nr
+丁汝骏 3 nr
+丁海峰 3 nr
+丁海明 10 nr
+丁渝洲 2 nr
+丁火旺 30 nr
+丁灵威 4 nr
+丁炔 3 n
+丁点 28 n
+丁点儿 11 nr
+丁烯 29 nr
+丁烯二 3 nr
+丁烯氧化 3 nz
+丁烷 44 nr
+丁烷脱氢 3 nr
+丁特起 18 nr
+丁玉珍 7 nr
+丁玲 66 nr
+丁珰 3 v
+丁甘如 2 nr
+丁甲神 3 nr
+丁癸草 3 nr
+丁真吾 42 nr
+丁督师 9 nr
+丁石孙 262 nr
+丁磊 24 nr
+丁祥瑞 23 nr
+丁秀才 5 nr
+丁种 3 m
+丁种维生 3 n
+丁税 3 n
+丁笑宜 3 nr
+丁管家 2 nr
+丁红萍 2 nr
+丁级 3 n
+丁绪贤 2 nr
+丁翠萍 2 nr
+丁老三 9 nr
+丁老仙 2 nr
+丁老儿 2 nr
+丁老四 4 nr
+丁老怪 8 nr
+丁肇中 44 nr
+丁胺卡那霉素 3 nz
+丁能通 1233 nr
+丁腈橡胶 11 n
+丁至帝 3 nr
+丁良恒 3 nr
+丁艰 3 nr
+丁苯 11 n
+丁苯橡胶 16 n
+丁菲飞 3 nr
+丁蜀镇 6 nr
+丁西林 5 nr
+丁谓正 2 nr
+丁贤俊 8 nr
+丁达夫 3 nr
+丁达尔 6 nr
+丁逸鸣 3 nr
+丁道衡 2 nr
+丁遥思 2 nr
+丁部领 2 nr
+丁酉 14 nr
+丁酉年 3 m
+丁酉日 2 m
+丁酮 6 n
+丁酯 3 nz
+丁酸 37 n
+丁醇 29 nr
+丁醛 6 n
+丁野夫 4 nr
+丁银均 3 nr
+丁银才 2 nr
+丁锡国 2 nr
+丁阿姨 2 nr
+丁零 39 o
+丁零当啷 3 o
+丁零当郎 3 o
+丁零族 2 nr
+丁零诸 2 nr
+丁零零 3 o
+丁青 3 nr
+丁青县 3 nr
+丁青皮 2 nr
+丁韪良 7 nr
+丁页 3 m
+丁项 3 m
+丁香 132 nr
+丁香油 3 nr
+丁香油酚 3 nz
+丁香花 34 nr
+丁香酚 3 nz
+丂 2 zg
+七 7675 m
+七一 49 m
+七一下子 2 m
+七一五 15 m
+七一年 6 m
+七一眼 2 m
+七一讲话 3 l
+七七 41 m
+七七七 2 m
+七七事变 69 nz
+七七八八 23 m
+七七四十 7 m
+七七四十九个 3 m
+七七四十九乡 2 m
+七七四十九响 128 m
+七七四十九天 2 m
+七七四十九日 8 m
+七七年 3 m
+七七数 7 m
+七七日 2 m
+七万 42 m
+七万二千六百九十处 2 m
+七万余 5 m
+七万六千锭 2 m
+七万块 2 m
+七万多 12 m
+七万多平方公里 2 m
+七万家 2 m
+七万户 3 m
+七丈 5 m
+七三 2 m
+七三一 6 m
+七三年 2 m
+七上八下 111 m
+七上八落 8 i
+七下 31 m
+七世 3 t
+七世夫妻 3 i
+七丝 3 m
+七两 12 m
+七个 780 m
+七中全会 75 nt
+七九 7 m
+七九六十三 4 m
+七九年 7 m
+七了八当 3 i
+七事八事 3 i
+七二六 6 m
+七二年 5 m
+七五 82 m
+七五左右 2 m
+七五折 4 m
+七五期间 3 t
+七五计划 3 nz
+七亘村 4 ns
+七亩 4 m
+七人制 6 nz
+七亿 9 m
+七亿人 3 l
+七仙 5 n
+七仙女 21 nr
+七代 6 t
+七件 23 m
+七伽社 3 nz
+七位 93 m
+七位数 3 n
+七侠五义 9 nz
+七倍 8 m
+七元 7 m
+七克 2 m
+七八 238 m
+七八万 20 m
+七八万元 3 m
+七八丈 43 m
+七八下 14 m
+七八两 2 m
+七八个 258 m
+七八亩 2 m
+七八代 3 m
+七八件 5 m
+七八位 9 m
+七八倍 7 m
+七八公里 2 m
+七八具 5 m
+七八分 44 m
+七八分钟 4 m
+七八匹 4 m
+七八十 47 m
+七八十万 2 m
+七八十万元 2 m
+七八十下 2 m
+七八十两 4 m
+七八十个 14 m
+七八十位 32 m
+七八十元 2 m
+七八十卷 2 m
+七八十台 2 m
+七八十名 5 m
+七八十声 2 m
+七八十天 2 m
+七八十岁 21 m
+七八十年 11 m
+七八十招 12 m
+七八十拳 3 m
+七八十摄氏度 8 m
+七八十斤 13 m
+七八十棵 2 m
+七八十次 3 m
+七八十米 3 m
+七八十里 12 m
+七八千 26 m
+七八千万 4 m
+七八千两 2 m
+七八千元 16 m
+七八千块 2 m
+七八千年 7 m
+七八千种 3 m
+七八千里 2 m
+七八厘米 2 m
+七八口 11 m
+七八句 6 m
+七八只 11 m
+七八名 75 m
+七八圈 3 m
+七八块 10 m
+七八处 15 m
+七八天 49 m
+七八头 9 m
+七八家 12 m
+七八寸 16 m
+七八尺 20 m
+七八层 2 m
+七八岁 53 m
+七八年 81 m
+七八座 4 m
+七八张 15 m
+七八成 60 m
+七八把 2 m
+七八招 40 m
+七八拳 3 m
+七八支 7 m
+七八斤 8 m
+七八日 23 m
+七八本 3 m
+七八条 26 m
+七八枚 13 m
+七八枝 4 m
+七八株 4 m
+七八根 5 m
+七八桶 2 m
+七八棵 4 m
+七八次 18 m
+七八步 25 m
+七八点 4 m
+七八片 3 m
+七八百 23 m
+七八百两 2 m
+七八百个 2 m
+七八百元 5 m
+七八百年 2 m
+七八百招 2 m
+七八百里 5 m
+七八盏 3 m
+七八碗 3 m
+七八种 10 m
+七八米 20 m
+七八粒 2 m
+七八级 3 m
+七八艘 2 m
+七八趟 3 m
+七八遍 3 m
+七八道 6 m
+七八里 75 m
+七八间 14 m
+七八颗 3 m
+七公 3 n
+七六 6 m
+七六九团 6 m
+七六年 3 m
+七具 2 m
+七册 2 m
+七出 17 m
+七刀 3 m
+七分 162 m
+七分裤 3 n
+七分钟 5 m
+七划 3 n
+七副 4 m
+七匹 3 m
+七匹狼 16 nz
+七区 3 ns
+七十 353 m
+七十一 20 m
+七十一万 2 m
+七十一岁 8 m
+七十七 6 m
+七十七口 2 m
+七十七国集团 13 nt
+七十七座 2 m
+七十万 21 m
+七十三 7 m
+七十三万两 2 m
+七十三岁 3 m
+七十三年 19 m
+七十三招 5 m
+七十三路 3 m
+七十两 3 m
+七十个 10 m
+七十九 5 m
+七十九个 2 m
+七十九岁 2 m
+七十九年 2 m
+七十九日 3 m
+七十九期 3 m
+七十九点 2 m
+七十二 206 m
+七十二万 2 m
+七十二个 5 m
+七十二候 6 l
+七十二变 9 nz
+七十二句 4 m
+七十二员 3 m
+七十二处 2 m
+七十二家 4 m
+七十二岁 6 m
+七十二峰 13 m
+七十二座 3 m
+七十二所 2 m
+七十二扇 2 m
+七十二招 8 m
+七十二条 4 m
+七十二根 2 m
+七十二烈 3 l
+七十二行 24 m
+七十二路 44 m
+七十二面 3 m
+七十二项 18 m
+七十五 17 m
+七十五万 3 m
+七十五匹 2 m
+七十五岁 7 m
+七十五年 2 m
+七十五座 3 m
+七十五部 2 m
+七十亩 2 m
+七十余 28 m
+七十余万 6 m
+七十余万斤 2 m
+七十余个 3 m
+七十余口 4 m
+七十余家 4 m
+七十余岁 7 m
+七十余年 18 m
+七十余招 3 m
+七十余里 5 m
+七十余颗 2 m
+七十八 9 m
+七十八岁 4 m
+七十公斤 2 m
+七十六 6 m
+七十六个 4 m
+七十六岁 5 m
+七十几岁 3 m
+七十出 2 m
+七十卷 4 m
+七十厘米 2 m
+七十只 3 m
+七十名 4 m
+七十四 27 m
+七十四卷 2 m
+七十四岁 2 m
+七十四条 3 m
+七十四部 2 m
+七十块 5 m
+七十多 15 m
+七十多万 6 m
+七十多万件 2 m
+七十多万户 2 m
+七十多个 6 m
+七十多发 2 m
+七十多块 2 m
+七十多岁 39 m
+七十多年 12 m
+七十多种 3 m
+七十多里 2 m
+七十家 3 m
+七十岁 78 m
+七十年 98 m
+七十年代 14 m
+七十招 2 m
+七十支 2 m
+七十斤 2 m
+七十日 2 m
+七十期 2 m
+七十条 17 m
+七十架 2 m
+七十步 2 m
+七十篇 2 m
+七十米 2 m
+七十里 18 m
+七千 94 m
+七千七百七十七名 3 m
+七千万 2 m
+七千万两 4 m
+七千万年 2 m
+七千两 3 m
+七千五百 4 m
+七千五百亿斤 2 m
+七千亿美元 2 m
+七千余 4 m
+七千余只 2 m
+七千余部 2 m
+七千余里 4 m
+七千元 3 m
+七千八百六十五门 2 m
+七千名 5 m
+七千吨 6 m
+七千四百 2 m
+七千块 2 m
+七千多万 2 m
+七千多万口 2 m
+七千多个 2 m
+七千多家 3 m
+七千头 2 m
+七千年 4 m
+七千里 3 m
+七卷 25 m
+七发 12 nz
+七口 16 m
+七口八嘴 3 i
+七古 3 ns
+七句 3 m
+七只 39 m
+七台 5 m
+七台河 4 ns
+七台河市 8 ns
+七叶 6 t
+七叶树 10 n
+七号 91 m
+七名 120 m
+七员 12 m
+七周 2 t
+七周岁 16 m
+七周年 3 m
+七味 2 m
+七品 149 m
+七哥 3 ns
+七喜 3 n
+七嘴八张 3 i
+七嘴八舌 114 i
+七四年 2 m
+七回 3 m
+七团 3 m
+七国 3 ns
+七国集团 4 nt
+七国首脑 3 l
+七圈 3 m
+七场 19 m
+七块 16 m
+七堵 2 m
+七声 25 m
+七处 27 m
+七夕 37 t
+七夕节 3 t
+七夜 69 t
+七夜怪谈 3 i
+七大八小 3 l
+七大姑八大姨 8 l
+七大洲 10 ns
+七天 228 t
+七头 3 m
+七套 42 m
+七子八婿 3 i
+七孔 3 n
+七孔生烟 3 i
+七宗 9 m
+七宗罪 3 i
+七宝 33 nz
+七家 26 m
+七寸 40 m
+七封 2 m
+七尊 3 m
+七尺 60 m
+七尺之躯 3 i
+七尺之驱 3 i
+七尾 2 m
+七局 16 m
+七层 27 m
+七层楼 3 n
+七届 294 m
+七岁 122 m
+七峰 7 m
+七巧板 11 n
+七巷 3 nz
+七席 2 m
+七帮 3 m
+七年 1094 m
+七年之病 3 l
+七年之痒 3 i
+七年级 3 b
+七庙 7 ns
+七度 10 m
+七座 411 m
+七开八得 3 i
+七弟 3 n
+七张 13 m
+七张八嘴 25 i
+七弦琴 24 i
+七弯八拐 3 l
+七彩 58 nz
+七彩缤纷 3 i
+七彩虹 4 i
+七彩谷 3 i
+七律 71 n
+七情 46 n
+七情六欲 44 i
+七慌八乱 3 i
+七成 130 m
+七户 13 m
+七所 10 m
+七手八脚 58 i
+七扭八歪 3 i
+七把 7 m
+七折 6 m
+七折八扣 3 i
+七担八挪 3 l
+七拉八扯 3 i
+七拐八拐 3 l
+七招 16 m
+七拱八翘 3 nr
+七拳 6 m
+七拼八凑 3 i
+七捞八攘 3 i
+七损八伤 3 i
+七损八益 3 l
+七排 3 m
+七推八阻 3 i
+七搭八扯 3 l
+七搭八搭 3 l
+七擒七纵 4 i
+七支 20 m
+七支八搭 3 nr
+七政 5 n
+七数 32 m
+七文 3 nz
+七斗 4 m
+七斤 7 m
+七断八续 8 i
+七日 268 t
+七日来复 3 i
+七日香 3 nz
+七早八早 3 l
+七旬 23 t
+七时 2 t
+七星 172 nz
+七星井 3 ns
+七星区 3 ns
+七星山 3 ns
+七星岩 23 nr
+七星拳 2 i
+七星河 19 ns
+七星泡 3 b
+七星街 3 ns
+七星针 2 i
+七星鱼 256 nz
+七景 3 n
+七曜 4 nz
+七月 923 t
+七月份 3 nz
+七服 2 m
+七期 3 t
+七本 5 ns
+七朵 2 m
+七机部 3 nt
+七条 50 m
+七杯 3 m
+七枚 13 m
+七枝 21 m
+七架梁 3 ns
+七株 2 m
+七样 2 m
+七根 6 m
+七格 3 n
+七桶 3 m
+七梯次 3 b
+七棱八瓣 3 n
+七棵 4 m
+七楼 3 ns
+七横八竖 3 i
+七次 64 m
+七步 19 m
+七步之才 4 i
+七步八叉 3 nz
+七步成章 3 i
+七步成诗 5 l
+七歪八扭 3 i
+七死七生 3 i
+七死八活 2 i
+七段 14 m
+七派 3 m
+七湾八拐 3 nr
+七满八平 3 i
+七滴 3 m
+七濑美雪 3 nz
+七点 103 m
+七点时 3 m
+七点钟 3 m
+七爷 3 n
+七爷八爷 3 n
+七片 3 m
+七狼八狈 3 i
+七班 6 m
+七生七死 3 i
+七男八婿 3 i
+七番 3 m
+七疮八孔 3 i
+七病八倒 3 i
+七病八痛 3 i
+七百 36 m
+七百一十多万两 2 m
+七百七十三年 3 m
+七百七十六年 2 m
+七百万 10 m
+七百万元 2 m
+七百万斤 2 m
+七百三十万两 5 m
+七百三十余万两 2 m
+七百三十卷 2 m
+七百两 5 m
+七百乡 3 m
+七百二三十枚 2 m
+七百二十五名 2 m
+七百五十万 6 m
+七百五十万两 2 m
+七百五十四 2 m
+七百余 6 m
+七百余万 4 m
+七百余年 2 m
+七百余里 8 m
+七百元 4 m
+七百八十二万三千两 2 m
+七百八十多名 2 m
+七百六十八米 2 m
+七百六十六万一千余锭 2 m
+七百名 5 m
+七百吨 2 m
+七百多 4 m
+七百多万 2 m
+七百多位 2 m
+七百多名 2 m
+七百多年 7 m
+七百年 7 m
+七百架 2 m
+七百里 18 m
+七盏 8 m
+七盒 3 m
+七盘 12 m
+七盘菜 3 n
+七相五公 3 i
+七眼桥镇 2 ns
+七砂 2 nz
+七破八补 3 i
+七碗 7 m
+七票 3 n
+七种 102 m
+七秒 2 m
+七秒钟 3 i
+七穿八洞 3 l
+七穿八烂 3 i
+七窍 56 n
+七窍冒火 3 i
+七窍冒烟 3 i
+七窍流血 3 i
+七窍玲珑 3 i
+七窍生烟 17 i
+七窝八代 3 l
+七站 6 m
+七章 7 m
+七端 16 m
+七笔 3 m
+七篇 11 m
+七米 131 m
+七类 10 m
+七粒 6 m
+七絃琴 3 nz
+七级 16 m
+七级浮屠 3 nz
+七级风 3 l
+七纵七禽 3 n
+七纵八横 3 l
+七线 3 m
+七绝 69 ns
+七美 9 nz
+七老八倒 3 i
+七老八十 10 i
+七股 3 m
+七脚八手 3 i
+七舌八嘴 3 i
+七艘 7 m
+七色 3 n
+七色板 3 n
+七节 6 t
+七节课 3 n
+七行 2 m
+七行俱下 3 i
+七行诗 3 n
+七袋 39 m
+七角 21 m
+七角井 3 ns
+七言 89 n
+七言八语 3 i
+七言句 3 i
+七言律诗 3 n
+七言绝句 3 i
+七言诗 29 l
+七贞九烈 3 i
+七起 6 m
+七足八手 3 i
+七路 15 m
+七轮 9 m
+七载 10 m
+七辆 6 m
+七辆车 3 n
+七辑 2 m
+七返还丹 3 i
+七连冠 7 i
+七通 3 nz
+七通一平 2 i
+七遍 4 m
+七道 99 m
+七邻 3 n
+七郤八手 3 nz
+七部 26 m
+七都镇 2 ns
+七里 51 m
+七里坪 4 ns
+七里桥 3 ns
+七里沟 238 ns
+七里河 4 ns
+七里河区 3 ns
+七里湖 2 ns
+七里香 3 nr
+七重 8 m
+七重唱 3 l
+七重奏 3 i
+七长八短 3 i
+七门 26 m
+七间 4 t
+七队 13 m
+七阵 2 m
+七雄 3 ns
+七集 2 m
+七零八 9 m
+七零八散 3 i
+七零八碎 3 i
+七零八落 205 i
+七青八黄 3 i
+七面 5 m
+七音 3 nz
+七顶 2 m
+七顷 2 m
+七项 34 m
+七颗 16 m
+七题 3 n
+七颠八倒 11 i
+七首 8 m
+七首八脚 3 i
+七高八低 9 i
+七鳃鳗 13 n
+七龙珠 3 nz
+丆 2 zg
+万 29391 m
+万一 1494 m
+万一会 3 m
+万一出 32 m
+万一回 4 m
+万一帮 2 m
+万一开 2 m
+万一把 7 m
+万一日 2 m
+万一路 2 m
+万一集 3 m
+万万 976 m
+万万不可 3 i
+万万不能 3 i
+万万出 2 m
+万万千千 3 m
+万万岁 91 m
+万万年 8 m
+万万条 4 m
+万丈 123 m
+万丈光芒 3 nr
+万丈深渊 25 i
+万丈红尘 3 n
+万丈高楼 3 i
+万丈高楼平地起 3 i
+万三 17 m
+万三千户 2 m
+万三蹄 6 nr
+万不失一 3 i
+万不得已 58 i
+万不该 3 d
+万世 337 nr
+万世一 6 t
+万世一时 3 t
+万世不易 3 l
+万世之 10 nr
+万世安 4 nz
+万世师表 4 nz
+万世开 4 nr
+万世无疆 3 i
+万世景 2 nr
+万世流芳 3 nr
+万两 98 m
+万两左右 2 m
+万个 344 m
+万串 2 m
+万丹 18 nr
+万乘 22 nz
+万乘之国 3 i
+万乘之尊 3 i
+万事 303 n
+万事万物 3 l
+万事不求人 3 i
+万事亨通 3 i
+万事俱备 27 i
+万事兴 3 nz
+万事具备 3 l
+万事利 3 nz
+万事吉 3 nr
+万事大吉 48 i
+万事如意 21 i
+万事开头难 13 i
+万事无忧 3 i
+万事皆备 3 i
+万事达 2 nz
+万事达卡 5 nz
+万事达卡国际组织 3 nt
+万事通 4 nz
+万二 3 m
+万云龙 13 nr
+万亩 3169 m
+万人之上 27 l
+万人之敌 5 i
+万人传实 3 i
+万人敌 3 i
+万人次 709 m
+万人空巷 13 i
+万人迷 13 nz
+万亿 75 m
+万亿个 3 m
+万亿元 52 m
+万亿千瓦 4 m
+万亿千瓦时 3 m
+万亿千米 4 m
+万亿吨 15 m
+万亿年 2 m
+万亿度 4 m
+万亿斤 2 m
+万亿日元 40 m
+万亿次 7 m
+万亿法郎 2 m
+万亿立方米 33 m
+万亿米 2 m
+万亿美元 21 m
+万亿里拉 2 nr
+万亿韩元 2 m
+万仁宏 7 nr
+万仇谷 2 nr
+万仞玄 2 nr
+万仞高山 3 nr
+万代 27 t
+万代千秋 3 i
+万件 68 m
+万份 106 m
+万伏 2 m
+万众 81 n
+万众一心 51 i
+万众所归 3 i
+万众欢腾 3 i
+万众瞩目 44 i
+万位 4 m
+万余 817 m
+万余个 3 m
+万余人次 7 m
+万余件 31 m
+万余份 2 m
+万余例 2 m
+万余元 73 m
+万余公里 11 m
+万余公顷 44 m
+万余具 3 m
+万余册 7 m
+万余副 17 m
+万余匹 5 m
+万余千米 7 m
+万余卷 9 m
+万余口 11 m
+万余只 2 m
+万余名 40 m
+万余吨 18 m
+万余块 2 m
+万余处 2 m
+万余家 14 m
+万余尊 4 m
+万余平方公里 20 m
+万余平方米 14 m
+万余座 4 m
+万余张 4 m
+万余户 17 m
+万余所 3 m
+万余支 2 m
+万余斤 2 m
+万余条 10 m
+万余枚 4 m
+万余株 5 m
+万余次 2 m
+万余种 15 m
+万余米 4 m
+万余辆 20 m
+万余里 7 m
+万余门 3 m
+万余顷 5 m
+万余首 4 m
+万佛塔 3 nr
+万佛寺 2 nr
+万佛峡 4 nr
+万佛洞 2 nr
+万佛阁 2 nr
+万佳 3 nz
+万佳乐 5 nr
+万例 11 m
+万俟 5 nrt
+万倍 65 m
+万儿 13 m
+万儿八千 3 m
+万元 7476 m
+万元以上 3 l
+万元户 11 n
+万光年 19 m
+万克 5 m
+万全 54 nr
+万全之策 37 i
+万全之计 7 i
+万全县 4 nr
+万全街 3 nr
+万八千 2 m
+万公斤 777 m
+万公里 223 m
+万公顷 2740 m
+万六 5 m
+万兰特 3 nz
+万具 2 m
+万兽之王 3 nr
+万册 87 m
+万军 15 nr
+万几 16 m
+万出头 4 m
+万刀 2 m
+万分 804 m
+万分之 44 nr
+万分之一 65 m
+万分之三 6 m
+万分之二 4 m
+万分危急 3 i
+万分感激 3 l
+万分钟 12 m
+万则 3 m
+万利 2 nz
+万利达 5 nz
+万别千差 3 i
+万副 4 m
+万劫不复 47 i
+万劫不渝 3 i
+万劫棋 2 nr
+万劫谷 46 nr
+万包 2 m
+万化之 2 nr
+万匹 30 m
+万千 153 m
+万千伏 2 m
+万千克 13 m
+万千气象 3 l
+万千瓦 885 m
+万千米 254 m
+万千重 5 m
+万华 6 nz
+万华区 3 ns
+万华正 3 nr
+万华站 3 nz
+万华蝶 2 nr
+万卷 45 m
+万卷书 3 nr
+万卷书屋 3 n
+万卷书库 3 n
+万卷楼 2 nr
+万历 1664 nz
+万厚良 2 nr
+万县 34 ns
+万县市 10 ns
+万双 5 m
+万发 20 nz
+万变 3 nz
+万变不离 3 l
+万变不离其宗 21 i
+万叠 3 m
+万口 18 m
+万口一词 3 i
+万口一谈 3 i
+万口一辞 3 i
+万古 82 ns
+万古不变 2 l
+万古千秋 3 i
+万古常青 3 nr
+万古愁 3 nr
+万古流芳 7 nr
+万古留芳 3 nr
+万古长存 3 nr
+万古长新 3 nz
+万古长春 3 nr
+万古长青 6 nr
+万古霉素 3 nz
+万句 5 m
+万只 47 m
+万台 285 m
+万叶 21 m
+万名 409 m
+万向 561 n
+万向节 3 nr
+万向轮 3 nr
+万向集团 22 n
+万吨 5026 m
+万吨级 301 b
+万吨轮 41 m
+万品 3 m
+万哈宁 2 nr
+万善殿 18 nr
+万嗣铨 4 nr
+万四千余里 3 m
+万回 5 m
+万国 155 ns
+万国公法 3 nz
+万国宫 9 nr
+万国权 31 nr
+万国表 2 nr
+万国邮政联盟 12 nt
+万国邮联 16 nz
+万国音标 3 n
+万圣 10 nz
+万圣宫 2 nr
+万圣节 9 nr
+万圭 89 ns
+万场 3 m
+万块 189 m
+万埠镇 2 nr
+万基 2 nz
+万堆 3 m
+万壑争流 3 n
+万壑千岩 3 nr
+万壑松 5 nr
+万壑松风 3 nr
+万士 4 m
+万士和 2 nz
+万声 9 m
+万处 4 m
+万多 433 m
+万多一点 3 m
+万多个 50 m
+万多亩 1025 m
+万多人次 9 m
+万多亿 4 m
+万多亿美元 2 m
+万多件 6 m
+万多份 9 m
+万多例 3 m
+万多倍 2 m
+万多元 52 m
+万多光年 2 m
+万多公里 307 m
+万多公顷 73 m
+万多册 2 m
+万多千瓦 3 m
+万多千米 24 m
+万多卷 2 m
+万多口 2 m
+万多只 6 m
+万多台 4 m
+万多名 54 m
+万多吨 19 m
+万多块 9 m
+万多处 2 m
+万多家 8 m
+万多尊 2 m
+万多平方公里 16 m
+万多平方米 10 m
+万多座 10 m
+万多张 5 m
+万多户 4 m
+万多所 2 m
+万多条 20 m
+万多枚 7 m
+万多架 2 m
+万多株 3 m
+万多片 2 m
+万多种 30 m
+万多立方米 4 m
+万多米 8 m
+万多美元 4 m
+万多艘 7 m
+万多行 2 m
+万多起 2 m
+万多辆 5 m
+万多间 2 m
+万多顷 3 m
+万多颗 2 m
+万大哥 3 nr
+万大平 3 nr
+万大溪 2 nr
+万天 2 m
+万夫 4 nr
+万夫不当 3 i
+万夫不当之勇 27 i
+万夫莫开 9 nr
+万夫莫当 11 nrt
+万夫莫敌 3 i
+万夫长 11 nr
+万头 330 m
+万头攒动 29 l
+万头窜动 3 l
+万套 51 m
+万字号 3 n
+万学文 256 nz
+万学远 256 nr
+万宁 26 nr
+万宁县 3 ns
+万宁市 4 ns
+万安 191 nz
+万安县 13 ns
+万安渡 3 nr
+万安镇 2 nr
+万宝 95 nz
+万宝全书 3 nz
+万宝瑞 6 nr
+万宝路 19 nr
+万宝镇 3 nr
+万客隆 6 nr
+万家 1075 m
+万家乐 7 nr
+万家寨 2 nr
+万家灯火 44 i
+万家生佛 7 nz
+万家香 3 nr
+万对 26 m
+万寿台 2 nr
+万寿圣 5 nr
+万寿塔 4 nr
+万寿宫 7 nr
+万寿寺 8 nr
+万寿山 12 nr
+万寿无疆 64 i
+万寿果 3 nr
+万寿羹 256 nr
+万寿节 7 nr
+万寿菊 3 nr
+万寿观 2 nr
+万寿路 7 nr
+万寿道 4 nr
+万寿门 3 nr
+万封 4 m
+万尊 4 m
+万尼亚 14 ns
+万尾 514 m
+万山 103 ns
+万山特区 3 ns
+万山红 3 nr
+万岁 2642 m
+万岁军 2 nr
+万岁千秋 3 i
+万岁通天 13 i
+万岳朝 2 nr
+万峦 3 n
+万峰 14 m
+万川 2 ns
+万州 106 ns
+万州区 6 ns
+万左右 82 m
+万师伯 23 nr
+万师嫂 3 nr
+万师弟 2 nr
+万希润 2 nz
+万帐 2 m
+万幅 6 m
+万幕 2 m
+万幢 2 m
+万平方 8 m
+万平方公里 1704 m
+万平方米 1977 m
+万年 1077 m
+万年前 31 t
+万年历 9 t
+万年县 5 ns
+万年无疆 3 i
+万年青 22 nr
+万幸 89 nr
+万庆 6 ns
+万庆澜 3 nz
+万应灵丹 5 nr
+万应灵药 2 i
+万应锭 3 n
+万府 3 n
+万度 17 m
+万座 12 m
+万延元 2 nr
+万张 62 m
+万德森 4 nr
+万德润 2 nr
+万德福 3 nr
+万德荣 2 nr
+万德莱 22 nr
+万念俱寂 3 i
+万念俱灰 70 i
+万恨千愁 3 i
+万恶 68 n
+万恶之源 3 i
+万恶之首 3 i
+万成 9 m
+万户 293 m
+万户侯 24 nr
+万户千家 2 i
+万户千门 3 i
+万所 21 m
+万手 23 m
+万把 34 m
+万把块 3 m
+万担 7 m
+万招 5 m
+万拱 3 nz
+万摄氏度 7 m
+万支 34 m
+万数 15 m
+万斛泉源 3 nz
+万斤 295 m
+万斯 11 nz
+万斯同 3 nr
+万方 249 m
+万方数据 3 l
+万无一失 199 i
+万日元 31 m
+万明坚 16 nr
+万春 3 nr
+万春亭 6 nr
+万春园 4 nr
+万景网 3 nz
+万有余 2 i
+万有引力 114 l
+万有模型 3 n
+万木林 4 nr
+万本 6 m
+万朵 11 m
+万条 34 m
+万杰医院 18 nz
+万杰鼎 2 nr
+万松林 2 nr
+万松浦 34 nr
+万枚 81 m
+万果 2 n
+万枝 2 m
+万枪 4 m
+万架 10 m
+万架次 9 m
+万柏林区 3 ns
+万树园 4 nr
+万树梨花 7 nr
+万株 18 m
+万样 6 m
+万根 13 m
+万桶 31 m
+万梓良 2 ns
+万棵 2 m
+万次 85 m
+万欢英 4 nr
+万步 4 m
+万死一生 131 i
+万死不辞 42 i
+万死犹轻 3 i
+万段 8 m
+万毕术 4 nr
+万民 263 n
+万民法 8 nz
+万民涂炭 3 n
+万水千山 21 nz
+万永年 44 nr
+万江 2 ns
+万泉 2 nz
+万泉寺 3 nr
+万泉庄 2 nr
+万泉河 19 ns
+万法唯 2 nr
+万法郎 14 nr
+万泽蒂 7 nr
+万洋山 13 ns
+万洲号 3 nz
+万流景仰 3 n
+万海里 9 nr
+万港元 49 m
+万源 3 nz
+万源县 3 ns
+万源市 2 ns
+万澳元 5 m
+万灵丹 3 nr
+万灵药 3 nr
+万点 18 m
+万点大关 3 i
+万烟谷 2 nr
+万片 21 m
+万物 848 n
+万物之灵 16 i
+万物化 2 nz
+万特 7 nz
+万状 91 nz
+万瓦 4 m
+万瓶 4 m
+万用刀 3 n
+万用手册 3 l
+万用电表 3 n
+万用表 6 n
+万盎司 9 m
+万盏 47 m
+万盘 3 m
+万盛 5 nz
+万盛区 3 ns
+万盛溪 3 nr
+万目 5 m
+万目睚眦 3 v
+万目睽睽 3 i
+万石山 2 nr
+万码 3 n
+万码奔腾 3 l
+万磅 19 m
+万神庙 3 nr
+万票 2 m
+万福 81 nz
+万福成 3 nr
+万福金安 3 nr
+万秀区 3 nr
+万种 138 m
+万种风姿 3 l
+万种风情 3 l
+万科 75 nz
+万秒 5 m
+万穗俱寂 3 nr
+万立方 11 m
+万立方米 980 m
+万站 36 m
+万章 3 m
+万端 23 m
+万笏朝 2 nr
+万笔 6 m
+万签插架 3 n
+万箭攒心 2 l
+万箭穿心 4 i
+万箭穿身 3 i
+万箭齐 5 nr
+万箱 4 m
+万篇 7 m
+万籁 9 n
+万籁俱寂 58 i
+万籁无声 17 i
+万籁鸣 8 nr
+万米 113 m
+万米长跑 3 ns
+万类 5 m
+万粒 13 m
+万精兵 2 nr
+万紫千红 22 nr
+万紫朗 2 nr
+万紫花 2 nr
+万红千紫 3 i
+万红强 5 nr
+万纳姆 3 nr
+万线 259 m
+万绪千头 3 i
+万绪千端 3 i
+万绮雯 3 nrfg
+万绳楠 2 nr
+万维 3 m
+万维网 38 nz
+万绿丛中 5 nr
+万绿园 2 nr
+万绿湖 7 nr
+万缕 9 m
+万缕千丝 3 i
+万缘 3 n
+万网 11 nz
+万美元 2034 m
+万美金 16 m
+万股 547 m
+万能 179 nz
+万能事 3 n
+万能五笔 3 nz
+万能工专 3 l
+万能无比 3 i
+万能胶 3 n
+万能表 3 nr
+万能论 3 n
+万能选手 3 l
+万能钥匙 3 n
+万能锅 3 n
+万能键 3 nr
+万般 61 a
+万般无奈 70 i
+万般皆下品 10 l
+万艘 18 m
+万艾可 5 nr
+万节 3 m
+万花 6 nz
+万花争艳 3 l
+万花山 2 ns
+万花筒 21 n
+万花谷 2 nr
+万苦千辛 3 i
+万英尺 7 m
+万英镑 130 m
+万荣 8 nr
+万荣县 6 nr
+万虑俱清 3 l
+万蛇 5 n
+万行 17 m
+万袋 5 m
+万言书 8 n
+万语千言 3 i
+万象 94 n
+万象市 2 n
+万象新 2 nr
+万象更新 31 nr
+万象森罗 3 nr
+万豪 3 nr
+万贯 47 nr
+万贯家 3 m
+万贯家产 3 i
+万贯家私 3 i
+万贯家财 14 i
+万贯文 3 nr
+万贵妃 28 nr
+万赖俱寂 3 i
+万赖无声 3 i
+万起 4 m
+万超尘 5 nr
+万足齐 2 i
+万身 2 m
+万载 37 m
+万载千秋 3 i
+万载县 3 nr
+万辆 929 m
+万辆次 3 m
+万达 72 nz
+万达队 6 nz
+万选蓉 2 nr
+万选青钱 3 n
+万通 28 nz
+万道 45 m
+万邦 21 nz
+万部 61 m
+万里 804 m
+万里一碧 3 nr
+万里学院 3 nz
+万里拉 4 nrt
+万里无云 28 i
+万里晴空 3 nr
+万里电池 7 nz
+万里行 3 nr
+万里迢迢 52 i
+万里长城 121 ns
+万里长征 18 nr
+万里长空 3 nr
+万里风 3 nr
+万里鹏程 3 nr
+万里鹏翼 3 nr
+万重 11 m
+万重山 3 nr
+万金 68 n
+万金油 16 nz
+万钟 6 m
+万钧之力 3 i
+万钧巨 2 nr
+万钧神 2 nr
+万锭 11 m
+万镑 263 m
+万门 50 m
+万间 5 m
+万隆 34 nr
+万隆会议 20 nz
+万难 94 n
+万难不却 3 l
+万集 3 m
+万零 2 m
+万震山 244 nr
+万面 3 m
+万韩元 6 m
+万页 4 m
+万顷 54 m
+万顷琉璃 3 nr
+万顷碧波 3 nr
+万顺 3 nz
+万顿 3 m
+万颗 16 m
+万首 16 m
+万马 3 nz
+万马克 14 nr
+万马奔腾 23 i
+万马庄 5 nr
+万马齐喑 10 i
+万鹤声 6 nr
+丈 1039 n
+丈二和尚 3 n
+丈二和尚摸不着头脑 18 i
+丈二金刚 3 n
+丈人 143 n
+丈八蛇矛 3 i
+丈夫 4283 n
+丈母 53 n
+丈母娘 53 n
+丈量 206 n
+丈量土地 3 n
+丈量法 3 n
+丈量面积 3 n
+三 42542 m
+三一三 3 m
+三一三十一 2 m
+三一下子 2 m
+三一八 7 m
+三一回 3 m
+三一学院 3 nz
+三一律 18 l
+三一斤 2 m
+三一顿 2 m
+三七 102 m
+三七二十一 8 m
+三七分 5 m
+三七年 3 m
+三七廿一 2 m
+三七开 6 m
+三七等 6 m
+三万 289 m
+三万七千公里 2 m
+三万万两 2 m
+三万两 46 m
+三万两万 2 m
+三万个 3 m
+三万九千 2 m
+三万二千 3 m
+三万二千余 2 m
+三万二千元 2 m
+三万五万 8 m
+三万五千 7 m
+三万五千五百余箱 2 m
+三万五千余 2 m
+三万五千余顷 2 m
+三万五千八百 2 m
+三万五千四百四十五箱 2 m
+三万亩 4 m
+三万人 3 nrt
+三万件 2 mq
+三万余 41 m
+三万余户 5 m
+三万余所 3 m
+三万余次 2 m
+三万元 7 m
+三万八千 2 m
+三万八千一百九十四户 2 m
+三万八千元 2 m
+三万六千多枚 2 m
+三万六千顷 2 m
+三万匹 3 m
+三万口 2 m
+三万名 20 m
+三万四千 2 m
+三万四千三百余顷 2 m
+三万四千余吨 2 m
+三万四千元 2 m
+三万块 7 m
+三万多 178 m
+三万多两 5 m
+三万多元 4 m
+三万多户 2 m
+三万家 2 m
+三万年 2 m
+三万户 11 m
+三万斤 2 m
+三万美元 3 m
+三万英尺 3 m
+三万贯 3 m
+三万里 11 m
+三万重 16 m
+三丈 220 m
+三三 15 m
+三三两两 70 m
+三三五五 3 m
+三三制 32 j
+三三四四 3 m
+三三数 6 m
+三三行 4 j
+三下 304 m
+三下两下 3 m
+三下乡 3 m
+三下五除二 24 i
+三不拗六 3 nr
+三不放过 3 l
+三不朽 3 i
+三不管 5 l
+三专制 3 j
+三专生 3 b
+三世 391 nrt
+三世佛 3 nz
+三丙 3 nz
+三丝 2 m
+三两 82 m
+三两下 13 m
+三两个 43 m
+三两六 3 m
+三两卷 2 m
+三两句 3 m
+三两只 6 m
+三两声 3 m
+三两天 11 m
+三两层 2 m
+三两年 11 m
+三两日 4 m
+三两本 2 m
+三两枝 5 m
+三两步 2 m
+三两碗 5 m
+三两米 3 m
+三两缕 2 m
+三两重 3 m
+三两面 2 m
+三个 8409 m
+三个代表 225 nz
+三个臭皮匠 6 l
+三个面向 3 n
+三中 542 ns
+三中全会 572 j
+三丰 16 nz
+三串 7 m
+三义 8 n
+三义墓 3 n
+三乐 6 nz
+三乙胺 4 nz
+三乙醇胺 8 nz
+三九 133 m
+三九医药 23 nz
+三九天 6 m
+三九生化 9 nz
+三九药业 3 nz
+三九集团 40 nt
+三二 8 m
+三二两 4 m
+三二六 2 m
+三二十 14 m
+三二十个 10 m
+三二十匹 3 m
+三二十步 2 m
+三二年 5 m
+三二日 5 m
+三二百 2 m
+三二百个 3 m
+三二百匹 2 m
+三二百里 2 m
+三二里 9 m
+三二零 2 m
+三五 78 m
+三五七 3 m
+三五万 5 m
+三五丈 3 m
+三五下 6 m
+三五两 9 m
+三五个 72 m
+三五九旅 8 nz
+三五分 3 m
+三五分钟 6 m
+三五匹 2 m
+三五十 20 m
+三五十万 2 m
+三五十个 16 m
+三五十件 2 m
+三五十只 2 m
+三五十块 2 m
+三五十年 2 m
+三五十步 5 m
+三五十米 2 m
+三五十里 4 m
+三五千 11 m
+三五千两 2 m
+三五句 4 m
+三五回 3 m
+三五声 2 m
+三五天 34 m
+三五层 2 m
+三五年 53 m
+三五成群 189 m
+三五户 5 m
+三五文 2 m
+三五斗 5 m
+三五日 30 m
+三五杯 2 m
+三五枝 3 m
+三五株 2 m
+三五次 6 m
+三五步 7 m
+三五百 14 m
+三五百元 2 m
+三五百斤 2 m
+三五百步 2 m
+三五百里 2 m
+三五种 2 m
+三五米 3 m
+三五遍 2 m
+三五里 11 m
+三井 59 ns
+三亚 179 ns
+三亚会议 3 nz
+三亚市 41 ns
+三亚旅游 3 nz
+三亚机场 2 ns
+三亚港 4 ns
+三亚湾 2 ns
+三产 12 j
+三亩 23 m
+三亲六故 4 i
+三亲六眷 3 i
+三亲四眷 3 i
+三人为众 3 i
+三人份 3 nz
+三人成虎 2 nz
+三人舞 3 i
+三人行 14 j
+三人间 3 n
+三亿 7 m
+三亿七千万 4 m
+三亿三千万余美元 2 m
+三亿三千余万两 2 m
+三亿两 2 m
+三亿五千万元 2 m
+三亿五千零九十一万余两 2 m
+三亿人 3 l
+三仁 3 nz
+三仁汤 4 nz
+三从四德 23 nr
+三仙湖镇 2 ns
+三代 461 t
+三代人 3 nz
+三代同堂 3 nz
+三令五申 54 i
+三件 295 mq
+三件套 3 nz
+三价 18 n
+三任 24 m
+三份 77 mq
+三伍 3 n
+三伏 22 j
+三伏天 19 t
+三优 11 b
+三伙 2 mq
+三会两课 3 n
+三伯 3 ns
+三伯母 3 nr
+三伯父 3 nrt
+三位 1127 m
+三位一体 137 l
+三位数 3 n
+三体问题 3 l
+三余 6 m
+三余一 4 m
+三余度 3 m
+三余读书 3 n
+三例 8 m
+三侠五义 3 nz
+三保 24 j
+三保直街 3 ns
+三信 3 nz
+三倍 124 m
+三倍体 9 n
+三儿 4 m
+三元 659 m
+三元催化 2 nr
+三元区 3 n
+三元及第 3 nz
+三元组 2 n
+三元里 22 t
+三光 18 nz
+三光政策 19 n
+三克 3 m
+三八 50 m
+三八二十四 2 m
+三八作风 3 l
+三八妇女节 16 i
+三八式 15 nz
+三八枪 4 m
+三八红旗手 10 i
+三八线 123 m
+三八节 3 m
+三八面 3 m
+三公 139 j
+三公主 10 n
+三公九卿 3 nr
+三六 3 m
+三六九 3 m
+三六九日 4 m
+三六九等 19 m
+三六九集 2 m
+三具 50 m
+三兽渡河 3 i
+三册 10 m
+三写成乌 3 nz
+三写易字 3 nz
+三军 617 j
+三军团 16 nt
+三农 86 nz
+三农问题 3 n
+三冬二夏 3 t
+三几年 3 m
+三刀 83 m
+三分 2201 m
+三分三 2 m
+三分之一 34 mq
+三分之二 15 m
+三分像人 6 n
+三分天下有其二 7 i
+三分法 3 n
+三分王 2 n
+三分球 184 n
+三分钟 72 mq
+三分鼎立 3 i
+三分鼎足 3 i
+三列 20 m
+三则 50 m
+三利 2 nz
+三剑圣 3 nr
+三剑客 31 nr
+三副 27 m
+三勺 2 m
+三包 27 m
+三化 7 j
+三化螟 16 n
+三北 35 ns
+三匹 89 m
+三区 33 ns
+三十 747 m
+三十一 50 m
+三十一万七千余 2 m
+三十一个 3 m
+三十一二岁 2 m
+三十一卷 4 m
+三十一处 2 m
+三十一岁 13 m
+三十一年 152 m
+三十一日 18 m
+三十一枚 2 m
+三十一次 2 m
+三十一点 3 m
+三十一篇 5 m
+三十一部 2 m
+三十七 23 m
+三十七丈 2 m
+三十七个 3 m
+三十七八 2 m
+三十七八岁 5 m
+三十七员 3 m
+三十七团 3 m
+三十七处 2 m
+三十七岁 26 m
+三十七年 56 m
+三十七文 2 m
+三十七部 4 m
+三十万 123 m
+三十万两 16 m
+三十万两匹 2 m
+三十万余 2 m
+三十万元 3 m
+三十万匹 4 m
+三十万吨 2 m
+三十万年 2 m
+三十万斤 3 m
+三十丈 9 m
+三十三 41 m
+三十三万 3 m
+三十三个 14 m
+三十三亿美元 2 m
+三十三名 3 m
+三十三天 10 m
+三十三岁 14 m
+三十三年 129 m
+三十三座 2 m
+三十三日 2 m
+三十三种 2 m
+三十三章 3 m
+三十三篇 8 m
+三十三起 3 m
+三十三首 2 m
+三十下 6 m
+三十两 37 m
+三十个 66 m
+三十九 25 m
+三十九个 2 m
+三十九分 2 m
+三十九卷 2 m
+三十九号 4 m
+三十九处 2 m
+三十九天 2 m
+三十九岁 14 m
+三十九幅 2 m
+三十九年 61 m
+三十九度 2 m
+三十九点 2 m
+三十九篇 2 m
+三十九类 2 m
+三十九级 2 m
+三十九页 2 m
+三十二 77 m
+三十二万两 2 m
+三十二三 2 m
+三十二三岁 5 m
+三十二两卷 2 m
+三十二个 6 m
+三十二位 3 m
+三十二刀 3 m
+三十二卷 13 m
+三十二名 6 m
+三十二员 2 m
+三十二团 3 m
+三十二块 2 m
+三十二处 2 m
+三十二天 3 m
+三十二岁 22 m
+三十二席 2 m
+三十二年 115 m
+三十二度 2 m
+三十二开 3 m
+三十二张 5 m
+三十二招 3 m
+三十二条 3 m
+三十二章 2 m
+三十二篇 2 m
+三十二路 2 m
+三十五 52 m
+三十五万 8 m
+三十五万六千余两 2 m
+三十五个 6 m
+三十五元 7 m
+三十五公里 2 m
+三十五六 4 m
+三十五六岁 11 m
+三十五分 3 m
+三十五名 6 m
+三十五周年 2 m
+三十五块 2 m
+三十五岁 45 m
+三十五席 5 m
+三十五年 93 m
+三十五等 2 m
+三十五米 2 m
+三十五部 6 m
+三十五里 4 m
+三十五顷 2 m
+三十亩 14 m
+三十件 4 m
+三十位 3 m
+三十余 98 m
+三十余万 41 m
+三十余万匹 2 m
+三十余万户 2 m
+三十余丈 4 m
+三十余个 7 m
+三十余件 3 m
+三十余口 23 m
+三十余名 15 m
+三十余头 2 m
+三十余家 3 m
+三十余岁 7 m
+三十余年 60 m
+三十余所 2 m
+三十余招 15 m
+三十余条 3 m
+三十余次 3 m
+三十余步 2 m
+三十余种 3 m
+三十余篇 2 m
+三十余米 2 m
+三十余级 2 m
+三十余艘 2 m
+三十余载 4 m
+三十余里 47 m
+三十倍 2 m
+三十元 11 m
+三十八 33 m
+三十八万余 2 m
+三十八个 6 m
+三十八九岁 2 m
+三十八代 4 m
+三十八位 2 m
+三十八卷 3 m
+三十八处 2 m
+三十八岁 17 m
+三十八席 2 m
+三十八年 78 m
+三十八所 2 m
+三十八文 2 m
+三十八种 2 m
+三十八类 3 m
+三十八艘 2 m
+三十八轮 2 m
+三十公里 4 m
+三十六 294 m
+三十六七 4 m
+三十六七岁 4 m
+三十六万 3 m
+三十六万余 2 m
+三十六万镑 2 m
+三十六个 42 m
+三十六代 2 m
+三十六位 5 m
+三十六刀 4 m
+三十六卷 7 m
+三十六只 7 m
+三十六名 17 m
+三十六员 9 m
+三十六块 2 m
+三十六处 7 m
+三十六天 14 m
+三十六家 2 m
+三十六岁 21 m
+三十六峰 3 m
+三十六幅 3 m
+三十六年 86 m
+三十六扇 128 m
+三十六把 2 m
+三十六招 7 m
+三十六斤 2 m
+三十六方 3 m
+三十六日 14 m
+三十六期 4 m
+三十六条 5 m
+三十六根 2 m
+三十六点 2 m
+三十六着 6 m
+三十六策 3 i
+三十六行 3 m
+三十六计 3 i
+三十六路 15 m
+三十六里 2 m
+三十六门 7 m
+三十六面 4 m
+三十六项 2 m
+三十几 3 m
+三十几两 3 m
+三十几个 14 m
+三十几号 2 m
+三十几块 2 m
+三十几头 5 m
+三十几家 2 m
+三十几岁 20 m
+三十几年 8 m
+三十几条 2 m
+三十几米 2 m
+三十几面 2 m
+三十出头 19 m
+三十分 12 m
+三十分钟 13 m
+三十匹 12 m
+三十华里 2 m
+三十卷 41 m
+三十厘米 2 m
+三十只 13 m
+三十名 43 m
+三十员 2 m
+三十周年 21 m
+三十四 38 m
+三十四万 2 m
+三十四万人次 2 m
+三十四两几 2 m
+三十四个 3 m
+三十四中 3 nz
+三十四五 2 m
+三十四五岁 5 m
+三十四卷 2 m
+三十四员 2 m
+三十四块 3 m
+三十四处 2 m
+三十四岁 12 m
+三十四年 72 m
+三十四款 2 m
+三十四点 2 m
+三十四篇 4 m
+三十块 21 m
+三十处 3 m
+三十多 28 m
+三十多万 10 m
+三十多万两 2 m
+三十多下 2 m
+三十多个 69 m
+三十多亩 3 m
+三十多位 4 m
+三十多公里 5 m
+三十多名 10 m
+三十多块 7 m
+三十多处 3 m
+三十多天 3 m
+三十多家 4 m
+三十多封 2 m
+三十多岁 95 m
+三十多年 406 m
+三十多户 2 m
+三十多斤 6 m
+三十多种 4 m
+三十多米 5 m
+三十多里 15 m
+三十夜 3 m
+三十大 4 nz
+三十天 13 m
+三十好几 3 m
+三十家 10 m
+三十岁 172 m
+三十左右 6 m
+三十席 2 m
+三十年 837 m
+三十年河东 12 ns
+三十度 2 mq
+三十座 5 m
+三十张 2 m
+三十户 2 m
+三十招 40 m
+三十支 2 m
+三十文 4 m
+三十斤 29 m
+三十日 72 m
+三十有余 2 m
+三十本 2 m
+三十条 7 m
+三十桌 2 m
+三十棵 3 m
+三十次 4 m
+三十款 6 m
+三十步 12 m
+三十种 2 m
+三十秒 7 m
+三十章 2 m
+三十篇 6 m
+三十米 12 m
+三十级 2 m
+三十而立 17 i
+三十艘 3 m
+三十辆 2 m
+三十辑 2 m
+三十里 170 m
+三十里铺 3 nz
+三十门 3 m
+三十顷 8 m
+三十颗 6 m
+三千 630 m
+三千七百 6 m
+三千万 13 m
+三千万两 6 m
+三千万人次 2 m
+三千万美元 4 m
+三千丈 6 m
+三千三百五十七刀 2 m
+三千两 73 m
+三千个 5 m
+三千九百两 2 m
+三千二百二十七万余 2 m
+三千五 2 m
+三千五千 6 m
+三千五百 10 m
+三千五百七十九卷 2 m
+三千五百两 3 m
+三千五百九十 2 m
+三千五百余 2 m
+三千五百户 3 m
+三千亩 3 m
+三千件 2 m
+三千份 4 m
+三千余 35 m
+三千余两 2 m
+三千余亩 3 m
+三千余匹 3 m
+三千余只 3 m
+三千余家 3 m
+三千余年 2 m
+三千余户 4 m
+三千余里 6 m
+三千元 18 m
+三千八 3 m
+三千八百 2 m
+三千八百万两 2 m
+三千八百四十五家 2 m
+三千八百户 3 m
+三千八百米 2 m
+三千六 3 m
+三千六百 2 m
+三千六百万条 2 m
+三千六百九十 2 m
+三千六百二十余卷 2 m
+三千六百刀 4 m
+三千六百分 3 m
+三千六百天 2 m
+三千副 2 m
+三千匹 6 m
+三千名 21 m
+三千四百万美元 2 m
+三千块 26 m
+三千多 38 m
+三千多万 8 m
+三千多两 2 m
+三千多亩 3 m
+三千多元 5 m
+三千多刀 3 m
+三千多名 16 m
+三千多块 2 m
+三千多家 2 m
+三千多年 11 m
+三千多条 2 m
+三千多种 2 m
+三千多里 2 m
+三千家 4 m
+三千尊 2 m
+三千尺 3 m
+三千幅 2 m
+三千年 49 m
+三千户 2 m
+三千文 3 m
+三千条 5 m
+三千枚 2 m
+三千步 4 m
+三千米 5 m
+三千粒 256 m
+三千里 49 m
+三千面 2 m
+三华里 4 ns
+三博 9 nz
+三占从二 3 i
+三卫 5 nz
+三危山 2 ns
+三卷 107 m
+三厘米 8 m
+三原 32 ns
+三原县 21 ns
+三原色 17 n
+三厢车 3 nz
+三叉 317 nz
+三叉戟 186 n
+三叉神经 10 n
+三叉神经痛 6 n
+三叉苦 3 n
+三叉街 3 n
+三叉路口 3 n
+三叉骨 3 n
+三友 26 n
+三双 28 m
+三反 77 b
+三反五反 12 i
+三反四覆 3 nz
+三发 22 nz
+三叠 81 m
+三叠系 39 b
+三叠纪 74 t
+三叠阳关 3 t
+三口 197 m
+三句 184 m
+三句不离 3 i
+三句话 3 l
+三句话不离本行 6 i
+三只 318 m
+三只手 12 i
+三台 66 m
+三台八座 3 m
+三台县 3 ns
+三台山 7 ns
+三台山乡 3 ns
+三台村 2 ns
+三台联播 3 nz
+三叶 43 m
+三叶期 3 n
+三叶草 15 n
+三叶虫 49 n
+三号 109 m
+三合 876 j
+三合一 31 b
+三合会 19 nt
+三合土 2 n
+三合房 3 n
+三合板 3 n
+三合院 7 nt
+三名 663 m
+三吐三握 3 i
+三吨 3 m
+三告投杼 3 i
+三员 59 m
+三周 33 m
+三周岁 4 m
+三周年 21 m
+三味 22 m
+三味书屋 3 nz
+三味线 2 nz
+三命而俯 3 nr
+三和土 3 nz
+三和银行 7 nt
+三品 515 m
+三响 49 m
+三唑 3 nz
+三唑仑 3 nz
+三唑酮 2 nz
+三嗪 4 nz
+三四 105 m
+三四万 152 m
+三四万块 2 m
+三四万户 2 m
+三四丈 18 m
+三四两句 3 m
+三四个 164 m
+三四五次 2 m
+三四代 2 m
+三四位 5 m
+三四倍 4 m
+三四分 11 m
+三四分钟 7 m
+三四十 62 m
+三四十万 5 m
+三四十万元 2 m
+三四十丈 4 m
+三四十下 2 m
+三四十个 21 m
+三四十亩 2 m
+三四十口 3 m
+三四十只 3 m
+三四十名 13 m
+三四十处 3 m
+三四十岁 19 m
+三四十年 17 m
+三四十户 2 m
+三四十招 11 m
+三四十斤 2 m
+三四十样 3 m
+三四十步 3 m
+三四十种 5 m
+三四十米 5 m
+三四十艘 2 m
+三四十遍 2 m
+三四十里 17 m
+三四千 159 m
+三四千万 2 m
+三四千万元 3 m
+三四千两 3 m
+三四千元 4 m
+三四千克 2 m
+三四千块 4 m
+三四千年 13 m
+三四千美元 2 m
+三四千里 2 m
+三四厘米 3 m
+三四口 3 m
+三四句 2 m
+三四只 11 m
+三四名 12 m
+三四品 7 m
+三四回 5 m
+三四声 2 m
+三四天 75 m
+三四家 4 m
+三四寸 8 m
+三四封 2 m
+三四尊 2 m
+三四尺 12 m
+三四层 8 m
+三四岁 20 m
+三四年 75 m
+三四成 18 m
+三四户 2 m
+三四招 11 m
+三四斤 3 m
+三四日 11 m
+三四期 3 m
+三四条 8 m
+三四样 3 m
+三四根 3 m
+三四次 30 m
+三四步 3 m
+三四流 6 n
+三四点 23 m
+三四百 57 m
+三四百两 3 m
+三四百个 6 m
+三四百元 4 m
+三四百公里 2 m
+三四百只 2 m
+三四百名 7 m
+三四百块 3 m
+三四百家 2 m
+三四百年 7 m
+三四百斤 6 m
+三四百步 2 m
+三四百米 4 m
+三四百里 2 m
+三四百页 2 m
+三四碗 2 m
+三四种 2 m
+三四秒 2 m
+三四篇 2 m
+三四米 8 m
+三四趟 2 m
+三四辆 2 m
+三四遍 2 m
+三四道 3 m
+三四里 31 m
+三四顷 2 m
+三四顿 2 m
+三回 47 mq
+三回九转 3 i
+三回五次 10 i
+三团 15 m
+三围 8 n
+三国 1063 ns
+三国志 90 n
+三国演义 194 nz
+三国策 3 n
+三国群英 3 nr
+三国鼎立 3 nz
+三圈 36 m
+三圣宫 3 nr
+三场 160 mq
+三坊七巷 2 ns
+三块 113 m
+三坝 2 ns
+三坟五典 3 i
+三垒手 3 n
+三城 24 ns
+三堂 14 m
+三堆 12 m
+三堡 4 ns
+三堰 3 ns
+三堵 5 m
+三塔 21 nrt
+三塘 3 ns
+三塘乡 3 ns
+三塚 4 vn
+三塚博 2 vn
+三壁 10 m
+三声 281 m
+三声无奈 3 i
+三处 190 m
+三复斯言 3 nz
+三复白圭 3 nr
+三多 15 m
+三多两 4 m
+三多等 3 m
+三夜 66 m
+三大作风 3 l
+三大块 3 m
+三大寺 12 nz
+三大差别 3 i
+三大战役 115 nz
+三大法宝 3 nz
+三大王 26 nz
+三大纪律 29 nz
+三大部 6 m
+三天 1496 m
+三天三夜 94 m
+三天两头 79 m
+三天打鱼 11 i
+三太子 3 nr
+三夫之对 3 i
+三夫之言 3 i
+三头 117 m
+三头两日 3 m
+三头两绪 3 i
+三头两面 3 m
+三头八臂 3 i
+三头六臂 64 i
+三头六证 3 i
+三头六面 3 m
+三头对案 3 n
+三头钳 3 n
+三夹板 3 n
+三套 54 m
+三好两歉 3 l
+三好两歹 3 i
+三好学生 3 l
+三好生 3 i
+三妻四妾 30 i
+三姑 3 n
+三姑六婆 3 nr
+三姓 21 n
+三姓家奴 3 nr
+三委 3 j
+三婆两嫂 3 nr
+三媒六证 6 i
+三子 265 m
+三字经 40 l
+三字词 3 n
+三季 14 m
+三季度 49 mq
+三季稻 3 n
+三学 14 n
+三宅 3 n
+三宗 15 m
+三官 32 n
+三官堂 2 nr
+三官庙 60 ns
+三定 8 b
+三宝 187 nz
+三宝颜 6 nr
+三实 5 n
+三审 3 n
+三审制 2 j
+三客 3 n
+三室 15 n
+三室一厅 12 i
+三室两厅 3 i
+三宫 25 ns
+三宫六院 27 ns
+三害 3 n
+三家 587 m
+三家子 2 nr
+三家店 4 ns
+三家村 46 ns
+三寸 127 m
+三寸丁 3 i
+三寸不烂 3 i
+三寸不烂之舌 26 i
+三寸之舌 3 i
+三寸半 3 i
+三寸舌 3 i
+三寸金莲 3 nr
+三寸鸟 3 i
+三对六面 3 m
+三封 23 m
+三尊 29 m
+三小块 3 m
+三小片 3 m
+三尖杉 30 nr
+三尖瓣 9 n
+三尸五鬼 3 i
+三尸暴跳 3 i
+三尸神 5 i
+三尺 486 m
+三尾 3 m
+三局 309 j
+三局两胜 3 i
+三层 1428 m
+三层楼 3 n
+三居室 12 nr
+三屉桌 3 nz
+三届 105 m
+三屯 2 ns
+三山 150 ns
+三山五岳 10 ns
+三岁 226 m
+三岁时 3 l
+三岔 11 b
+三岔口 24 ns
+三岔河 26 ns
+三岔路 2 ns
+三岔路口 22 ns
+三岔路村 3 ns
+三岔镇 8 ns
+三岛 48 ns
+三峡 3095 ns
+三峡地区 6 ns
+三峡大坝 272 nz
+三峡学院 2 nt
+三峡工程 27 nz
+三峡库区 13 ns
+三峡总公司 6 nt
+三峡水利枢纽工程 9 nz
+三峡水库 4 nz
+三峡游 5 nz
+三峰 44 m
+三峰驼 3 n
+三川 15 ns
+三差两错 3 i
+三差五错 3 i
+三巷 3 nz
+三席 11 m
+三帮 4 mq
+三幅 9 m
+三幕 2 m
+三幢 5 m
+三平二满 3 i
+三平方米 2 m
+三年 5637 m
+三年之艾 3 i
+三年五载 24 m
+三年制 3 b
+三年化碧 3 n
+三年有成 3 l
+三年期 7 t
+三年生 3 b
+三年级 3 b
+三年计划 3 n
+三床 4 nz
+三废 27 n
+三度 48 mq
+三度空间 8 n
+三座 506 m
+三座大山 17 ns
+三座门 657 ns
+三弄 24 ns
+三式 3 b
+三张 122 m
+三张犁 3 nr
+三弦 88 n
+三弦乐器 3 n
+三弦琴 2 n
+三强 43 nz
+三影塔 3 n
+三徙成国 3 i
+三徙成都 3 i
+三德 4 nrt
+三心两意 22 i
+三心二意 56 i
+三志 11 n
+三态 9 n
+三态变化 3 l
+三态逻辑 3 l
+三思 102 n
+三思而后 3 i
+三思而后行 23 i
+三思而行 30 i
+三性 25 n
+三怨成府 3 l
+三总部 18 nt
+三愿 11 n
+三成 137 m
+三成新 3 nz
+三战 3 nz
+三战三北 3 nz
+三战两胜 3 nz
+三截 3 m
+三户 530 m
+三户亡秦 3 nz
+三房 17 n
+三房一厅 3 n
+三房两厅 3 n
+三房二厅 3 n
+三所 35 j
+三扇 6 m
+三手 6 m
+三才 64 t
+三才升 3 nr
+三打 27 m
+三批 95 m
+三把 64 m
+三折 22 m
+三折其肱 3 l
+三折肱 2 n
+三抹 2 m
+三担 3 m
+三拇指 3 n
+三招 400 m
+三招两式 3 l
+三拳 65 m
+三拳两脚 3 i
+三振 3 n
+三振出局 3 i
+三捆 4 m
+三排 19 m
+三接头 3 n
+三推六问 2 nz
+三摊 3 m
+三撇 2 m
+三撑峡 3 n
+三支 186 m
+三支两军 27 j
+三改一加强 2 nz
+三教 66 nz
+三教九流 43 l
+三数 6 m
+三数十年 2 m
+三数日 6 m
+三整 34 m
+三文 11 nz
+三文治 3 nz
+三文鱼 21 nz
+三斑家蚊 3 n
+三斗 31 m
+三斗坪 7 nz
+三斤 65 m
+三方 194 m
+三方点格 3 n
+三族 3 nz
+三无 31 j
+三日 735 t
+三日份 3 nz
+三日新妇 3 n
+三旨相公 3 nr
+三旬九食 3 nr
+三明 42 nz
+三明市 22 ns
+三明治 39 nz
+三星 363 nz
+三星公司 13 nt
+三星在天 3 i
+三星在户 3 i
+三星堆 30 m
+三星期 3 b
+三星村 4 ns
+三星电子 79 nz
+三星电子公司 28 nt
+三星级 54 b
+三星队 2 nt
+三星集团 7 nt
+三春柳 2 nr
+三昧 52 n
+三晋 85 j
+三晚 3 t
+三智 3 n
+三智五猜 3 i
+三曲 4 m
+三更半夜 40 i
+三曹对案 3 l
+三替 4 nz
+三月 1417 m
+三月不知肉味 3 i
+三月中 6 nz
+三月份 38 mq
+三月初 28 t
+三月底 22 t
+三月末 10 t
+三朋四友 3 l
+三服 6 m
+三朝 3 t
+三朝五日 3 i
+三朝元老 15 nr
+三期 180 t
+三木 40 n
+三本 60 ns
+三朵 39 m
+三机部 5 n
+三权分离 3 i
+三权分立 3 i
+三杆 6 m
+三束 7 m
+三杠 3 n
+三条 452 m
+三来一补 9 i
+三杯 210 m
+三杯水 3 n
+三杰 11 nrt
+三板 4 n
+三板斧 14 nz
+三极 16 ns
+三极真空 3 l
+三极管 34 n
+三枚 442 m
+三枝 166 m
+三枪 30 m
+三架 38 m
+三架梁 3 ns
+三柱 13 m
+三栋 5 m
+三校 21 j
+三校生 7 n
+三株 37 m
+三样 44 m
+三根 148 m
+三格 3 n
+三桅帆船 3 nr
+三案 25 m
+三桌 9 m
+三档 10 m
+三桥 90 ns
+三桥村 8 nz
+三桩 8 m
+三棉 3 j
+三棒鼓 5 nz
+三棱 38 b
+三棱锥 3 nz
+三棱镜 32 nz
+三棵 13 m
+三棵树 5 ns
+三楼住户 3 i
+三榜定案 3 l
+三槐九棘 3 nr
+三次 1405 m
+三次方 4 nz
+三次曲面 3 nz
+三次采油 3 nz
+三款 35 m
+三步 341 m
+三步两脚 3 i
+三步并作两步 35 i
+三步走 81 l
+三段 48 m
+三段制 3 n
+三段式 12 n
+三段票 3 n
+三段论 97 n
+三段论式 3 l
+三段论法 2 l
+三毛 95 n
+三毛七孔 3 i
+三民 6 n
+三民主义 279 nz
+三民路 3 nz
+三氟乙酸 10 nz
+三氟化硼 6 nz
+三氟氯乙烯 18 nz
+三氧化二砷 11 n
+三氧化二铁 14 nz
+三氧化二铝 3 nz
+三氧化二铬 3 nz
+三氧化二锑 2 nz
+三氧化氮 3 nz
+三氧化物 3 nz
+三氧化硫 3 nz
+三氧化钨 8 nz
+三氧化钼 7 nz
+三氯 6 nz
+三氯乙烯 8 nz
+三氯乙烷 3 nz
+三氯乙醛 19 nz
+三氯化硼 3 nz
+三氯化碘 3 nz
+三氯化铋 3 n
+三氯化铝 10 nz
+三氯氢硅 2 nz
+三氯氧磷 2 nz
+三氯甲烷 9 nz
+三氯甲苯 2 nz
+三水 53 n
+三水区 3 ns
+三水县 3 ns
+三水市 2 ns
+三求四告 3 n
+三汊河 5 ns
+三江 146 ns
+三江七泽 3 nz
+三江五湖 3 ns
+三江侗族自治县 2 ns
+三江口 25 ns
+三江师范学堂 5 nt
+三江平原 64 ns
+三池 6 ns
+三汤两割 3 i
+三汤五割 3 i
+三沐三熏 3 nr
+三沐三薰 3 nr
+三河 94 ns
+三河县 13 ns
+三河坝 8 ns
+三河市 14 ns
+三河镇 31 ns
+三河马 11 ns
+三泉 5 nz
+三法 3 n
+三法印 5 nz
+三波六折 3 i
+三泰 3 nz
+三泽 3 nz
+三洋 18 ns
+三洞 29 ns
+三洞桥 4 ns
+三津 2 ns
+三派 90 m
+三流 46 n
+三流九等 3 i
+三浦 2 nz
+三浦友和 3 nz
+三浴三衅 3 nr
+三海里 2 ns
+三涂 3 nrt
+三清 70 t
+三清四白 3 l
+三清山 13 ns
+三清殿 24 nr
+三温暖 3 nr
+三港 2 ns
+三湖 12 ns
+三湘 18 ns
+三湘四水 6 nz
+三湾 36 ns
+三溪 3 ns
+三滤 12 n
+三滴 7 m
+三潭印月 19 nz
+三灾八难 4 l
+三灾六难 3 i
+三炮 9 n
+三点 306 m
+三点一线 3 m
+三点式 14 b
+三点水 7 n
+三点钟 3 m
+三热爱 2 l
+三焦 80 nz
+三焦俞 3 nr
+三熏三沐 3 nr
+三熟制 16 n
+三爷 44 n
+三片 22 m
+三牲 22 n
+三牲五鼎 3 nz
+三王 329 nrt
+三环 61 nz
+三环五扣 3 nz
+三环股份 41 nz
+三环路 19 nz
+三班 27 m
+三班倒 15 l
+三班六房 3 ns
+三班制 3 nz
+三瓣 3 n
+三瓦 4 m
+三瓦两巷 3 i
+三瓦两舍 3 i
+三瓶 9 m
+三生 42 b
+三生有幸 40 i
+三生石 3 n
+三用喷枪 3 l
+三田 5 nz
+三甲 245 b
+三甲基氯硅烷 7 nz
+三甲胺 15 nz
+三甲镇 2 ns
+三申五令 3 nr
+三界 38 n
+三略 3 n
+三番 39 m
+三番两次 11 m
+三番五次 47 m
+三番四复 3 i
+三番四次 3 m
+三病四痛 3 i
+三白草 3 n
+三百 348 m
+三百七十七万 2 m
+三百七十万四千二百八十一两 2 m
+三百七十余 2 m
+三百七十六 2 m
+三百万 34 m
+三百万两 10 m
+三百万元 3 m
+三百万年 5 m
+三百万镑 2 m
+三百万顷 3 m
+三百丈 5 m
+三百三十一 2 m
+三百三十一天 2 m
+三百三十万 2 m
+三百三十二万余两 2 m
+三百三十年 2 m
+三百下 3 m
+三百两 61 m
+三百个 32 m
+三百乡 2 m
+三百二十七公里 2 m
+三百二十三 2 m
+三百二十五座 2 m
+三百二十四 4 m
+三百二十步 3 m
+三百二十毫米 2 m
+三百五十 8 m
+三百五十一里 2 m
+三百五十万 2 m
+三百五十二万二千一百六十三 2 m
+三百五十余万 2 m
+三百五十六 2 m
+三百五十四部 2 m
+三百五十斤 3 m
+三百五十里 4 m
+三百五百 3 m
+三百亩 6 m
+三百余 40 m
+三百余万 3 m
+三百余位 2 m
+三百余匹 2 m
+三百余名 4 m
+三百余堵 2 m
+三百余年 12 m
+三百余户 3 m
+三百余招 5 m
+三百余次 3 m
+三百余种 3 m
+三百余里 30 m
+三百余顷 3 m
+三百元 40 m
+三百八十七万四千七百多顷 2 m
+三百八十万两 9 m
+三百八十万户 2 m
+三百八十四 2 m
+三百八十家 2 m
+三百公里 4 m
+三百六 3 m
+三百六十 12 m
+三百六十万 2 m
+三百六十两 2 m
+三百六十五 5 m
+三百六十五个 2 m
+三百六十五天 11 m
+三百六十六万七千七百多顷 2 m
+三百六十天 13 m
+三百六十岁 3 m
+三百六十度 4 m
+三百六十斤 2 m
+三百六十日 7 m
+三百六十种 2 m
+三百六十行 18 m
+三百六十里 3 m
+三百六十门 3 m
+三百匹 11 m
+三百卷 2 m
+三百只 7 m
+三百名 52 m
+三百吨 2 m
+三百员 3 m
+三百四十万镑 2 m
+三百四十三家 2 m
+三百四十余万两 2 m
+三百四十八卷 4 m
+三百四百 2 m
+三百块 5 m
+三百多 41 m
+三百多万 4 m
+三百多个 7 m
+三百多元 4 m
+三百多公里 3 m
+三百多口 2 m
+三百多名 11 m
+三百多年 23 m
+三百多斤 2 m
+三百多方 2 m
+三百多米 3 m
+三百多里 7 m
+三百头 3 m
+三百家 2 m
+三百尺 2 m
+三百左右 3 m
+三百年 120 m
+三百年天 4 m
+三百户 4 m
+三百招 9 m
+三百文 6 m
+三百斤 13 m
+三百杯 2 m
+三百架 2 m
+三百次 2 m
+三百步 7 m
+三百种 2 m
+三百米 10 m
+三百里 39 m
+三百零五毫米 10 m
+三百零六幅 2 m
+三百面 4 m
+三百顷 2 m
+三百项 2 m
+三百颗 3 m
+三百首 17 m
+三皇 57 nz
+三皇五帝 32 nr
+三皈 3 n
+三皈依 3 n
+三盆 7 m
+三盈三虚 3 nr
+三盏 24 m
+三盒 6 m
+三盖沟村 3 ns
+三盘 64 m
+三盛公 5 nr
+三目 9 n
+三相 115 n
+三相点 3 n
+三眼 32 m
+三眼井 3 nz
+三碗 92 m
+三碗不过冈 5 nz
+三票 7 n
+三禁 2 b
+三秋 16 t
+三种 1421 m
+三科 33 nz
+三秒 14 m
+三秒钟 13 i
+三秦 40 t
+三穗 4 nz
+三穗县 3 ns
+三窝两块 3 n
+三章 19 m
+三端 201 m
+三端网络 3 n
+三竿日上 3 l
+三笔 12 m
+三等 268 m
+三等九格 3 nz
+三等九般 3 l
+三等亲 3 n
+三等兵 3 n
+三等分 3 l
+三等功 48 l
+三等品 3 n
+三等奖 175 nz
+三等舱 3 n
+三管齐下 9 l
+三箱 3 m
+三篇 43 m
+三米 24 m
+三米板 3 nz
+三类 644 m
+三类判断 3 n
+三粒 35 m
+三精 10 nz
+三系杂种 3 l
+三级 1962 b
+三级片 3 n
+三级管 3 n
+三级网络 3 n
+三级跳 25 l
+三级跳远 8 l
+三级预防 3 l
+三纲 3 n
+三纲五常 29 i
+三纵两横 2 l
+三纸无驴 3 i
+三线 88 m
+三线工业 3 n
+三线建设 3 l
+三线放松 3 n
+三组 45 m
+三结合 39 i
+三统 3 n
+三维 236 m
+三维光栅 3 nz
+三维动画 3 n
+三维县 3 ns
+三维图 3 nrt
+三维模式 3 l
+三维空间 42 n
+三维线 2 nz
+三维重建 3 nz
+三缄其口 17 i
+三缕 2 m
+三缸 3 nz
+三缺一 8 i
+三美 8 m
+三翻四复 3 i
+三翻四覆 3 i
+三老 50 n
+三老五更 3 i
+三老四严 3 i
+三老四少 2 l
+三者 472 n
+三联 144 ns
+三联书店 57 nt
+三联体 7 j
+三联单 32 j
+三联式 3 nz
+三联画 3 n
+三聚 3 nz
+三聚体 3 nz
+三聚氰胺 66 nz
+三聚氰胺甲醛树脂 4 nz
+三聚甲醛 7 nz
+三聚磷酸钠 9 nz
+三股 84 m
+三胎 6 m
+三胞胎 8 n
+三脚 46 mq
+三脚两步 19 i
+三脚架 31 n
+三脚猫 34 n
+三腔 24 m
+三臂卡环 3 nz
+三臡八菹 3 nr
+三自一包 3 i
+三自爱国 259 ns
+三舍 4 nrt
+三般两样 3 l
+三船 10 nz
+三艘 101 m
+三色 3 mq
+三色堇 4 n
+三色旗 4 ns
+三色版 3 n
+三色笔 3 n
+三色苋 3 n
+三节 352 m
+三节两寿 3 i
+三节课 3 n
+三节鞭 3 n
+三芝 3 nrt
+三花接骨散 2 i
+三花脸 3 l
+三苯基膦 5 n
+三英里 5 m
+三茂 6 nz
+三茬 4 m
+三茶六礼 3 nz
+三茶六饭 3 i
+三荤五厌 3 nr
+三菱 87 nz
+三菱公司 4 nt
+三萜 9 n
+三萜类 3 n
+三营 35 b
+三落实 3 i
+三薰三沐 3 nr
+三藏 1322 ns
+三藩市 3 nr
+三蛇七鼠 3 i
+三衅三浴 3 nr
+三行 47 j
+三街两市 3 i
+三街六巷 3 i
+三街六市 3 ns
+三袋 9 m
+三西 2 ns
+三要素 3 l
+三观 6 nz
+三视图 2 n
+三角 613 m
+三角债 16 n
+三角函数 54 l
+三角区 25 ns
+三角叶杨 3 nz
+三角回归 3 l
+三角地 8 n
+三角型 5 n
+三角城 2 ns
+三角墙 3 n
+三角学 52 n
+三角尺 3 n
+三角帆 8 nz
+三角带 2 n
+三角形 479 n
+三角恋 3 n
+三角恋爱 6 l
+三角方程 3 l
+三角旗 3 ns
+三角杂化 3 n
+三角村 2 ns
+三角板 5 n
+三角枫 3 nr
+三角架 17 n
+三角梅 3 ns
+三角洲 663 ns
+三角测量 3 n
+三角淀 3 ns
+三角点 6 n
+三角状 15 nz
+三角瓶 3 n
+三角皮带 3 n
+三角网 15 nz
+三角翼 24 n
+三角肌 3 n
+三角裤 6 n
+三角钢琴 3 nz
+三角钱 3 n
+三角铁 10 n
+三言两句 3 i
+三言两语 89 i
+三言讹虎 3 i
+三记 22 m
+三讲 142 j
+三讲两思 3 l
+三讲教育 3 l
+三论宗 12 nz
+三证 2 j
+三评一考 3 j
+三请四唤 3 i
+三读会 3 nz
+三读通过 3 n
+三课 3 n
+三谏之义 3 i
+三豕涉河 3 i
+三贞九烈 3 nr
+三贞五烈 3 i
+三贤 5 nrt
+三贤人 3 nr
+三贤祠 3 nr
+三资 48 n
+三资企业 59 j
+三起 48 m
+三起三落 3 l
+三趟 7 m
+三足鼎立 31 i
+三趾马 55 n
+三距交汇 3 nz
+三跪九叩 3 nr
+三路 728 m
+三路狂奔 3 nr
+三身 18 m
+三车 7 n
+三轮 148 m
+三轮儿 3 n
+三轮式 3 nz
+三轮车 160 n
+三轮车夫 3 n
+三载 49 m
+三辆 51 m
+三辈 13 m
+三辈子 4 m
+三辑 2 n
+三辰 5 nz
+三边 149 ns
+三边形 3 n
+三达德 3 nrt
+三迁之教 3 l
+三进 42 nz
+三连冠 66 nr
+三连胜 10 nr
+三连音 3 nz
+三迭阳关 3 ns
+三通 433 nz
+三通一平 2 nz
+三通阀 3 l
+三速链轮 3 nz
+三遍 91 m
+三道 329 m
+三道坎 2 nr
+三道沟 10 ns
+三道湾 2 ns
+三遭 5 m
+三邀四请 3 nr
+三邻四舍 3 i
+三部 186 m
+三部合唱 3 l
+三部曲 294 m
+三都县 2 ns
+三都水族自治县 8 ns
+三都澳 9 ns
+三都赋 4 nr
+三里 119 m
+三里屯 27 ns
+三里河 10 ns
+三重 231 m
+三重人 3 nz
+三重人格 3 nz
+三重唱 3 l
+三重奏 15 nr
+三重市 3 j
+三重态 3 l
+三重门 3 nz
+三野 16 n
+三金 6 n
+三鑫 2 nz
+三针 3 n
+三钢 3 j
+三铁 7 n
+三铢 7 m
+三锅 3 n
+三锤 12 m
+三锭 6 m
+三镇 67 ns
+三长两短 99 j
+三长制 22 j
+三长四短 3 j
+三门 329 m
+三门县 3 ns
+三门四户 3 l
+三门峡 94 ns
+三门峡市 26 ns
+三门峡水库 5 nz
+三间 436 m
+三间房 14 n
+三闾大夫 3 ns
+三队 80 m
+三防训练 3 n
+三阳 24 ns
+三阳交泰 3 nz
+三阳开泰 8 nz
+三阳络 3 n
+三阴交 3 i
+三阵 11 m
+三阶 3 n
+三阶教 6 n
+三院 301 j
+三陪 55 j
+三陪女 3 n
+三陵 5 ns
+三集 12 m
+三零七年 2 m
+三青团 20 nt
+三面 1193 mq
+三面亚当 3 nrt
+三面体 3 n
+三面夏娃 3 nz
+三面红旗 47 nz
+三页 7 m
+三顶 9 m
+三顷 7 m
+三项 475 m
+三项式 3 nz
+三项教育 3 l
+三项方程 3 l
+三顾 3 n
+三顾之请 3 i
+三顾茅庐 267 i
+三顾茅芦 3 i
+三顾草庐 5 i
+三顿 35 m
+三频 3 b
+三颗 108 m
+三颗针 3 n
+三风十愆 3 n
+三餐 74 m
+三餐不继 3 i
+三饥两饱 3 i
+三首 35 m
+三首六臂 3 i
+三马同槽 3 nz
+三驾 4 m
+三高农业 3 nz
+三魂七魄 4 i
+三魂出窍 3 i
+三鲜 265 ns
+三鲜汤 2 nz
+三鹰 2 nz
+三鹿 11 nz
+三麦 3 ns
+三黄鸡 9 ns
+三鼎 10 nz
+三龙 5 nz
+上 258101 f
+上一年 85 t
+上一阶段 3 t
+上万 208 m
+上万两 8 m
+上万个 17 m
+上万件 7 m
+上万份 4 m
+上万倍 6 m
+上万元 295 m
+上万公里 4 m
+上万匹 3 m
+上万千米 3 m
+上万发 2 nz
+上万口 2 ns
+上万只 3 m
+上万名 33 m
+上万头 128 m
+上万度 2 ns
+上万斤 3 m
+上万月 2 m
+上万条 6 m
+上万枚 3 m
+上万株 4 l
+上万次 2 m
+上万种 2 m
+上万间 2 m
+上三 89 t
+上三路 3 ns
+上上 6 t
+上上下下 243 l
+上上个月 3 t
+上上之策 3 l
+上上品 2 n
+上上大吉 3 ns
+上上星期 3 b
+上上网 6 v
+上下 2142 f
+上下一心 25 l
+上下一致 3 l
+上下交困 3 j
+上下交征 3 j
+上下交流 3 j
+上下位 3 n
+上下其手 10 l
+上下册 4 v
+上下半场 7 ns
+上下卷 8 m
+上下同心 3 l
+上下同欲 3 i
+上下同门 3 ns
+上下场 4 n
+上下学 10 l
+上下左右 58 m
+上下床 3 v
+上下文 111 j
+上下水 134 ns
+上下水道 2 l
+上下游 40 j
+上下班 94 v
+上下级 68 b
+上下结合 3 j
+上下联 5 j
+上下肢 7 n
+上下行 9 j
+上下议院 3 nt
+上下调整 3 l
+上下跳动 3 l
+上下车 12 n
+上下颠倒 3 i
+上下齐心 13 l
+上不去 3 t
+上不着天 6 l
+上不起 3 v
+上世 3 t
+上东 41 ns
+上个 3 b
+上个世纪 3 t
+上个季度 3 l
+上个星期 3 t
+上个月 207 t
+上中 91 ns
+上中下 36 f
+上中下游 3 j
+上中农 4 j
+上中旬 6 j
+上中游 21 j
+上丹墀 9 nr
+上丹根 3 ns
+上举 35 v
+上义夫 8 nr
+上乘 430 v
+上乘之作 3 i
+上书 818 v
+上了贼船 5 l
+上交 220 v
+上交不谄 3 i
+上交利润 3 n
+上交所 23 j
+上京 138 ns
+上亮子 5 nr
+上代 60 t
+上任 541 v
+上会 3 j
+上传 98 v
+上传下载 3 b
+上传下达 8 l
+上传区 3 n
+上传完毕 3 nr
+上传者 3 n
+上位 71 n
+上位法 4 n
+上体 86 n
+上佳 43 j
+上例 3 n
+上供 51 v
+上元 73 t
+上元节 7 t
+上光 18 n
+上光机 3 n
+上党 139 n
+上党梆子 12 n
+上关 3 ns
+上兵 3 v
+上兵伐谋 3 ns
+上册 22 v
+上冒头 3 l
+上农 3 nt
+上冻 3 t
+上刀山 3 ns
+上刑 12 v
+上划 3 n
+上列 18 ns
+上到 3 v
+上前 1658 t
+上剑影 2 nr
+上剑招 2 nr
+上加奇 2 ns
+上劲 64 v
+上勤 10 j
+上勤下顺 3 ns
+上区 3 ns
+上医医国 3 nt
+上千 54 m
+上千人 3 l
+上千亿 11 m
+上千年 7 m
+上升 3747 v
+上升幅度 3 l
+上升时 15 n
+上升时间 3 n
+上升期 13 n
+上升段 3 n
+上升流 40 n
+上升率 3 n
+上升股 3 n
+上升限度 3 n
+上午 3088 t
+上半 65 t
+上半区 2 ns
+上半叶 172 t
+上半场 857 ns
+上半夜 21 t
+上半天 37 t
+上半年 851 t
+上半时 65 t
+上半期 47 t
+上半身 68 n
+上半部 3 n
+上南落北 3 ns
+上卷 171 v
+上原 19 ns
+上去 3421 t
+上发条 3 n
+上变 3 v
+上变频 3 b
+上口 19 ns
+上古 237 ns
+上古史 8 n
+上古时代 3 t
+上台 762 ns
+上台子 6 ns
+上台演唱 3 n
+上台演奏 3 n
+上台演讲 3 l
+上叶 3 t
+上司 1137 n
+上吊 225 v
+上吊自杀 3 i
+上同调 5 l
+上同调群 3 l
+上吐下泻 14 l
+上君亭 3 nr
+上告 59 v
+上告信 3 nz
+上周 572 t
+上周三 4 nr
+上周二 4 nr
+上周五 64 n
+上周四 24 nr
+上周日 28 n
+上周末 59 n
+上呼吸道 59 l
+上和下睦 2 l
+上品 268 n
+上唇 78 n
+上唇线 3 n
+上善若水 3 nr
+上国 3 ns
+上国村 3 ns
+上图 26 v
+上圈 3 n
+上地 104 j
+上场 416 n
+上场比赛 3 ns
+上场门 2 n
+上坟 49 v
+上坡 58 ns
+上坡路 5 ns
+上坡道 3 ns
+上坪 6 ns
+上垒 3 n
+上城 194 ns
+上堂 22 ns
+上士 33 ns
+上声 9 v
+上夜 3 t
+上天 312 t
+上天入地 14 l
+上天无路 19 l
+上头 195 v
+上奏 3 v
+上套 3 b
+上套儿 3 n
+上好 86 v
+上好下甚 3 i
+上好佳 3 z
+上妆 11 v
+上嫚下暴 3 v
+上季 3 t
+上学 880 n
+上学时 3 n
+上官 67 n
+上官义 4 nr
+上官义驱 2 nr
+上官云 93 nr
+上官云朗 2 ns
+上官云珠 8 nr
+上官仪 4 nr
+上官体 2 b
+上官俸的 2 nr
+上官兄 3 nr
+上官兄弟 3 nr
+上官剑南 15 nr
+上官卑 3 nr
+上官占 2 v
+上官周 2 nr
+上官大哥 2 ns
+上官大夫 5 ns
+上官太 3 nr
+上官太后 10 nr
+上官婉儿 9 nr
+上官帮主 7 n
+上官得 2 v
+上官桀 11 nr
+上官毅 10 nr
+上官毅山 18 nr
+上官氏 6 nr
+上官洲 256 ns
+上官灵凤 3 nr
+上官燕 3 nr
+上官犯 2 v
+上官者亦 2 nr
+上官虹 30 nr
+上官贵 2 nr
+上官铁 5 nr
+上官铁生 33 nr
+上官长老 4 nr
+上官鼎 3 nr
+上宝光 3 nr
+上宝山 4 ns
+上实联合 2 l
+上家 10 n
+上宾 61 ns
+上寒武 2 nr
+上寒玉 3 nr
+上寒秀 2 nr
+上将 709 n
+上将军官 3 nr
+上尉 136 n
+上尉军官 3 nr
+上小贝 3 nr
+上少安 2 nr
+上层 1066 b
+上层建筑 242 l
+上层社会 3 l
+上层组织 3 l
+上屈 3 v
+上届 173 j
+上屋 51 ns
+上屏 3 ns
+上山 840 ns
+上山下乡 119 ns
+上山下海 3 ns
+上岁数 7 n
+上岗 301 ns
+上岗证 9 j
+上岛 3 ns
+上岩 4 ns
+上岸 381 f
+上岸时 3 n
+上峰 140 ns
+上川 4 ns
+上工 73 v
+上巨虚 3 nr
+上市 3199 ns
+上市公司 3 nt
+上市户 3 ns
+上市日 33 b
+上帝 1170 n
+上帝保佑 3 nz
+上帝教 3 nz
+上席 3 v
+上年 2075 t
+上广电 15 nz
+上庄 6 ns
+上床 308 v
+上床睡觉 3 n
+上座儿 3 n
+上座率 37 b
+上座部 27 n
+上廉 3 nrt
+上建桥 2 ns
+上式 3 b
+上弦 22 v
+上弦月 3 n
+上弹 3 v
+上当 382 v
+上当受骗 3 l
+上当学乖 3 v
+上影线 3 n
+上得 3 v
+上得峰 3 ns
+上得起 3 v
+上御玺 128 nr
+上德帝 4 nr
+上心 32 v
+上思 17 v
+上思县 2 ns
+上恒山 13 nr
+上情下达 3 l
+上慢下暴 3 n
+上成 172 v
+上战 3 v
+上户 62 n
+上房 236 n
+上手 60 v
+上托 3 v
+上扬 393 v
+上批 3 v
+上承圣 2 nr
+上报 677 v
+上捷轩 2 nr
+上排 30 v
+上接 3 v
+上控制限 3 n
+上推 68 v
+上推下卸 3 v
+上援下推 3 nr
+上摊 3 v
+上摸 3 v
+上收 16 v
+上攻 193 v
+上数 5 n
+上料 5 n
+上新世 100 t
+上方 726 f
+上方不足 3 l
+上方剑 3 nr
+上方宝剑 3 nr
+上方山 2 ns
+上旋 3 v
+上旋球 3 n
+上无片瓦 4 nz
+上日 3 t
+上旬 280 t
+上昆 3 ns
+上明 3 v
+上明帝 3 nr
+上星期 18 b
+上映 213 v
+上映期间 3 n
+上晃 25 v
+上晶脉 2 n
+上智下愚 3 nr
+上替下陵 3 n
+上月 207 t
+上月底 22 t
+上有 3 v
+上有天堂 3 l
+上有所好 3 l
+上有政策 6 n
+上有老 11 nr
+上有老下有小 5 l
+上朝 215 t
+上期 67 t
+上机 87 n
+上机操作 3 l
+上机时间 3 l
+上杉 3 n
+上村 16 ns
+上来 3970 t
+上杭 28 ns
+上杭县 30 ns
+上林 20 ns
+上林县 2 ns
+上林苑 8 ns
+上架 45 v
+上柜 10 n
+上柴 15 v
+上标 29 j
+上栏 3 n
+上树 3 ns
+上树拔梯 3 nr
+上栗县 3 ns
+上校 262 j
+上校军官 3 n
+上根大器 3 nz
+上格 3 ns
+上桅 3 n
+上框 3 n
+上桌 58 n
+上档 3 b
+上档次 20 b
+上梁 16 ns
+上梁不正 3 i
+上梁不正下梁歪 16 i
+上梅洲村 3 ns
+上楼 220 ns
+上楼去 3 i
+上楼去梯 3 nr
+上楼来 3 nr
+上榜 55 v
+上榜名单 3 n
+上次 930 t
+上款 8 v
+上步 65 v
+上段 3 t
+上殿赐 2 nr
+上气不接 3 v
+上气不接下气 90 l
+上水 35 ns
+上水船 3 n
+上水道 3 n
+上江 5 ns
+上汽 3 j
+上沃尔特 3 ns
+上河 16 ns
+上油 3 n
+上流 163 b
+上流人士 3 ns
+上流社会 3 nt
+上浆 13 n
+上浆翻领 3 n
+上浮 137 v
+上海 16377 ns
+上海东方 38 ns
+上海中央局 18 nt
+上海书店 3 nt
+上海交大 70 j
+上海交通大学 208 nt
+上海人民出版社 78 nt
+上海人民美术出版社 3 nt
+上海体育场 2 nt
+上海体育馆 5 nt
+上海光大会展中心 3 nt
+上海公报 6 nt
+上海出版公司 2 nt
+上海动物园 6 ns
+上海医学院 26 nt
+上海医科大学 10 nt
+上海华山医院 2 nt
+上海南京东路 2 ns
+上海南京路 10 ns
+上海博物馆 26 ns
+上海卷 3 nz
+上海县 19 ns
+上海古籍出版社 52 nt
+上海图书馆 21 nt
+上海圣约翰大学 17 nt
+上海地区 70 ns
+上海复旦大学 14 nt
+上海大众 10 nt
+上海大众汽车有限公司 5 nt
+上海大学 65 nt
+上海女排 2 nt
+上海宝钢集团 2 nt
+上海对外贸易学院 3 nt
+上海展览中心 7 l
+上海市 1910 ns
+上海市人 11 n
+上海市人大常委会 4 nt
+上海市人民政府 9 nt
+上海市公安局 9 nt
+上海市分行 2 nt
+上海市劳动和社会保障局 7 nt
+上海市委 24 nt
+上海市工人文化宫 2 ns
+上海市工商局 2 nt
+上海市工商联 2 nt
+上海市总工会 3 nt
+上海市房地局 2 nt
+上海市政协 11 nt
+上海市政府 49 nt
+上海市教委 14 nt
+上海市浦东新区 6 ns
+上海市科委 9 nt
+上海市第一中级人民法院 5 nt
+上海市第一人民医院 5 nt
+上海师范大学 40 nt
+上海开明书店 2 nt
+上海强生 10 nz
+上海戏剧学院 21 nt
+上海战役 8 nz
+上海教育电视台 2 nt
+上海教育考试院 4 nt
+上海文艺出版社 9 nt
+上海民族乐团 3 nt
+上海水产大学 516 nt
+上海浦东 71 ns
+上海浦东发展银行 9 nt
+上海浦东国际机场 3 nt
+上海浦东新区 8 ns
+上海海关 5 ns
+上海港 66 ns
+上海滩 54 ns
+上海热线 3 nz
+上海牌 4 nz
+上海理工大学 17 nt
+上海申花 89 nz
+上海申花队 35 nz
+上海电影制片厂 41 nt
+上海电视台 4 nt
+上海石化 9 j
+上海社科院 10 nt
+上海站 23 nt
+上海第二军医大学 4 nt
+上海第二医科大学 11 nt
+上海籍 7 nr
+上海罗氏制药有限公司 2 nt
+上海联和投资有限公司 2 nt
+上海联家超市有限公司 4 i
+上海芭蕾舞团 4 nt
+上海虹桥机场 13 ns
+上海街 3 ns
+上海警备区 5 nt
+上海证券交易所 391 nt
+上海译文出版社 3 nt
+上海贝尔 42 ns
+上海财大 3 nt
+上海财经大学 26 nt
+上海辞书出版社 5 nt
+上海通用 6 nt
+上海邮通 2 nt
+上海铁路局 46 nt
+上海银行 17 nt
+上海锅炉厂 2 n
+上海长征医院 3 nt
+上海队 64 nt
+上海音乐学院 24 nt
+上消化道 22 l
+上涌 142 v
+上涨 2389 v
+上涨幅度 3 l
+上涨率 12 n
+上清 3 t
+上清帝 3 nr
+上渡 3 v
+上港村 3 ns
+上港集箱 18 nz
+上游 1780 f
+上游工业 3 nt
+上湖村 3 ns
+上溢 3 v
+上溢下漏 3 n
+上溯 159 v
+上滔下骄 3 i
+上漏下湿 3 v
+上演 642 v
+上演税 3 n
+上潮 3 n
+上火 60 v
+上灵宝 3 nr
+上灵州 3 ns
+上灵霄 6 nr
+上点 3 n
+上烝下报 3 vn
+上焙乾 3 nr
+上焦 18 v
+上照 3 v
+上爬 257 v
+上片 3 n
+上片时间 3 l
+上牌 2 v
+上牙膛 3 n
+上犹 16 nrt
+上犹县 8 ns
+上玉帝 4 nr
+上玉皇 2 nr
+上环 3 ns
+上班 1337 v
+上班族 216 nz
+上班时间 3 l
+上班服 3 n
+上甘岭 75 ns
+上甘岭区 3 ns
+上甘岭战役 20 nz
+上田 22 ns
+上甲微 4 nr
+上甲板 3 n
+上甲科 2 nz
+上界 3 n
+上界岭 2 ns
+上略 3 v
+上瘾 80 v
+上百 73 j
+上百万 7 m
+上百人 3 n
+上百年 8 m
+上百户 2 n
+上皮 246 n
+上皮根鞘 3 l
+上皮珠 3 nr
+上皮组织 24 l
+上皮细胞 3 l
+上皮附着 3 n
+上盘 3 v
+上眼 3 t
+上眼皮 3 l
+上着 3 v
+上知 3 v
+上石 3 t
+上码头 12 n
+上礼 3 v
+上社 2 nt
+上祥云 2 nr
+上移 49 v
+上税 8 j
+上空 1063 v
+上空装 3 j
+上窜下跳 8 l
+上章 3 n
+上端 104 f
+上竿掇梯 3 nz
+上等兵 16 n
+上等品 3 n
+上等货 3 n
+上策 142 n
+上算 11 v
+上篇 9 b
+上篇上论 3 l
+上篮 258 n
+上篮得分 3 l
+上簇 3 v
+上粪 3 n
+上紧 3 v
+上紫云 2 nr
+上级 3243 b
+上级指示 3 n
+上级法院 3 nt
+上级菜单 3 n
+上级部门 3 l
+上级院 3 nt
+上级领导 3 n
+上纲上线 15 n
+上线 657 n
+上缘 3 v
+上缴 155 v
+上缴利润 3 n
+上缴国库 3 n
+上网 849 v
+上网冲浪 3 nz
+上网卡 7 n
+上网者 9 n
+上网费 11 n
+上群豪 16 nr
+上翠微 4 nr
+上翻门 3 l
+上联 58 ns
+上肢 94 n
+上肢骨 3 n
+上肥 3 ns
+上胶塞 3 n
+上脘 3 n
+上腹 37 n
+上膘 3 v
+上膛 3 n
+上臂 63 n
+上臂骨 3 n
+上自 3 ns
+上至 3 v
+上航 2 j
+上船 328 v
+上色 29 b
+上节 3 t
+上节育环 3 n
+上苍 62 ns
+上荣木 2 nr
+上药 41 n
+上药膏 3 nz
+上荷珠 2 nr
+上菜 44 n
+上蒸下报 3 n
+上蓉儿 3 nr
+上蔡 20 ns
+上蔡县 5 ns
+上藏马村 2 ns
+上虞 56 ns
+上虞县 7 ns
+上虞市 4 ns
+上蜡 9 v
+上行 433 v
+上行下效 25 n
+上行列车 3 n
+上行波 3 ns
+上街 235 ns
+上街区 3 ns
+上衡 7 v
+上衣 438 n
+上衣翻领 3 l
+上表 142 v
+上装 94 v
+上西天 60 ns
+上规模 56 b
+上角 3 ns
+上解 40 v
+上言 3 v
+上计 3 v
+上议院 272 nt
+上记明 2 nz
+上访 212 v
+上访事件 3 n
+上访信 3 nt
+上访户 3 n
+上访者 5 n
+上证 120 j
+上证所 8 nt
+上证指数 3 n
+上证综指 3 n
+上诉 187 v
+上诉书 3 n
+上诉人 3 n
+上诉期 3 b
+上诉状 4 n
+上课 650 v
+上课时 3 n
+上课时数 3 n
+上课证 3 n
+上调 313 v
+上谕 143 v
+上谷 47 ns
+上账 5 v
+上货 3 nt
+上贼船 2 l
+上赛季 96 nr
+上起 3 v
+上路 363 ns
+上蹿下跳 18 l
+上身 269 v
+上车 381 n
+上车时 3 ns
+上轨 3 b
+上载 17 v
+上辈 13 n
+上辈人 2 l
+上辈子 19 l
+上边 555 f
+上边带 3 n
+上达 57 ns
+上过 3 v
+上进 67 v
+上进心 36 nt
+上述 5261 b
+上述事实 3 n
+上述情况 3 n
+上送 43 v
+上选 3 v
+上道 3 v
+上道儿 2 nr
+上邦 3 ns
+上部 348 f
+上酒家 3 n
+上釉 3 n
+上野 30 ns
+上野未来 3 l
+上金 3 n
+上金枋 3 nr
+上金钗 2 nr
+上钢 16 j
+上钩 70 v
+上银幕 3 b
+上铺 317 ns
+上链 2 n
+上锁 38 v
+上错 3 v
+上镜 4 n
+上镜头 3 v
+上镜率 3 n
+上门 500 ns
+上门去 3 l
+上门服务 3 l
+上门来 3 ns
+上闩 3 n
+上闻下达 3 nt
+上阵 275 v
+上阿松 2 nr
+上限 228 v
+上院 356 j
+上陵下替 3 n
+上集 29 v
+上雨旁风 3 l
+上青 7 nt
+上青霄 2 nr
+上静静 2 nr
+上面 4976 f
+上项 3 b
+上颌 91 n
+上颌体 3 n
+上颌前突 3 n
+上颌后缩 3 n
+上颌牙 3 n
+上颌骨 44 n
+上颔骨 3 z
+上颚 36 n
+上颚骨 3 z
+上额 3 b
+上风 333 v
+上飞云 2 nr
+上飞旋 2 nr
+上饶 81 ns
+上饶县 13 ns
+上饶市 12 ns
+上馆子 10 n
+上首 82 v
+上香 3 ns
+上香茗 2 nr
+上马 1114 ns
+上驷 3 i
+上驷之材 3 i
+上髎 3 z
+上高 97 v
+上高县 3 ns
+上黄 14 b
+下 108294 f
+下一代 438 t
+下一场 51 l
+下一版 3 b
+下一辈 7 l
+下一阶段 3 t
+下三滥 50 l
+下三烂 21 l
+下三路 3 l
+下下 3 v
+下下个月 3 t
+下下之策 3 l
+下下星期 3 t
+下下棋 3 l
+下下策 3 n
+下下签 3 v
+下不为例 29 l
+下不了台 42 l
+下不去 3 v
+下不来 42 v
+下不来台 13 l
+下不着地 5 l
+下世 17 v
+下世纪 60 t
+下世纪初 3 t
+下丘脑 247 n
+下个世纪 3 t
+下个季度 3 l
+下个星期 3 t
+下个月 3 t
+下中农 11 b
+下为 3 v
+下乔迁谷 3 ns
+下乘之才 3 i
+下九 3 t
+下九流 18 n
+下乡 439 v
+下书 3 v
+下井 3 n
+下井投石 3 i
+下人 182 n
+下代 3 t
+下令 2080 v
+下任 24 v
+下任总统 3 n
+下传 3 v
+下位 56 n
+下位法 3 n
+下体 77 n
+下余 3 l
+下作 38 v
+下例 3 n
+下侧 3 f
+下倾 3 v
+下元 5 t
+下光 3 v
+下关 122 v
+下关区 2 n
+下关市 11 ns
+下册 17 v
+下冒头 3 l
+下冲 3 v
+下冲断层 3 n
+下决心 235 v
+下凡 112 v
+下出 3 v
+下切 55 v
+下切侵蚀 3 n
+下划 5 n
+下划线 10 l
+下列 1082 v
+下到 3 v
+下剩 3 v
+下力 3 n
+下功夫 265 n
+下加利福尼亚 6 ns
+下加利福尼亚州 3 ns
+下劲 3 v
+下勺 3 n
+下北 3 f
+下区 3 n
+下午 4712 t
+下午茶 3 n
+下半 3 t
+下半区 2 ns
+下半叶 211 t
+下半场 827 n
+下半夜 59 t
+下半年 838 t
+下半旗 7 ns
+下半时 78 t
+下半晌 3 t
+下半月 3 t
+下半生 12 t
+下半身 56 n
+下单 38 n
+下卷 105 v
+下厂 3 n
+下压 84 v
+下厨 40 v
+下厨房 3 vn
+下去 10474 t
+下发 380 v
+下发文件 3 n
+下叔村 3 n
+下变频 3 n
+下口 36 n
+下句话 3 l
+下召 3 v
+下台 183 v
+下台阶 3 n
+下叶 20 t
+下合穴 3 n
+下同 110 v
+下吏 2 n
+下吴村 3 nz
+下周 77 t
+下周一 16 l
+下和村 3 ns
+下咽 73 v
+下品 73 n
+下唇 82 n
+下唇线 3 n
+下喙 3 i
+下回 75 v
+下回分解 309 l
+下围棋 3 l
+下图 50 v
+下土 3 v
+下在 3 t
+下地 230 n
+下地干活 3 l
+下地无门 3 l
+下场 322 n
+下场比赛 3 ns
+下场门 2 v
+下坠 99 v
+下坠球 3 n
+下坡 78 ns
+下坡路 17 n
+下垂 285 v
+下垫面 19 n
+下城 101 ns
+下基层 53 n
+下堂 19 n
+下堕 3 i
+下塘村 3 ns
+下塞上聋 3 i
+下士 68 n
+下处 90 v
+下大力 29 l
+下大力气 3 l
+下大工夫 3 n
+下大本钱 3 n
+下头 32 v
+下女 3 n
+下奶 3 n
+下好 3 v
+下嫁 58 v
+下子 22 n
+下存 3 v
+下季 3 t
+下学 25 n
+下学上达 3 l
+下学时 3 n
+下学期 3 n
+下完 3 v
+下官 249 n
+下定 106 v
+下定义 15 l
+下定决心 201 l
+下家 37 n
+下宿 2 v
+下寨村 3 ns
+下寺 11 ns
+下小河村 3 n
+下层 509 n
+下层社会 3 l
+下层组织 3 l
+下届 51 b
+下属 1202 v
+下属单位 3 n
+下屯乡 2 ns
+下山 766 ns
+下岗 2270 v
+下岗人员 3 n
+下岗女工 3 n
+下岗工人 3 n
+下岗职工 3 n
+下川 8 ns
+下工 25 v
+下工夫 18 n
+下差别阈 3 n
+下巴 281 n
+下巴颊 3 n
+下巴颏 22 n
+下巴颏儿 11 n
+下巴颗 3 n
+下市 3 v
+下帖 11 n
+下帖子 3 n
+下年 11 t
+下庄 2 ns
+下床 3 v
+下底 3 t
+下底传中 3 l
+下店 3 n
+下式 3 n
+下弦 8 v
+下弦月 21 n
+下影线 4 n
+下得 3 v
+下怀 3 v
+下悬窗 3 n
+下情 21 n
+下情上达 2 l
+下意识 251 v
+下愚 3 n
+下愚不移 3 i
+下成 3 v
+下战书 3 n
+下户 37 n
+下房 3 n
+下手 919 v
+下手尝试 3 i
+下拉 20 ns
+下拉框 3 n
+下拉箭头 3 n
+下拉菜单 3 n
+下拜 3 v
+下拨 26 v
+下挫 46 v
+下排 3 v
+下探 15 v
+下接 3 v
+下推 20 v
+下推队列 3 l
+下摆 81 v
+下操 7 n
+下放 266 v
+下放干部 3 n
+下放知青 3 l
+下文 202 n
+下料 3 n
+下断语 3 l
+下方 244 f
+下旋 3 v
+下旬 673 t
+下星期 15 t
+下晚儿 3 t
+下月 90 t
+下月初 2 t
+下有 3 v
+下有对策 6 l
+下有小 6 l
+下有苏杭 3 nz
+下朝 3 t
+下期 120 t
+下木 3 n
+下机 11 n
+下村 4 n
+下条子 3 n
+下来 16620 t
+下极限 3 n
+下枋 3 n
+下柬 3 n
+下标 15 v
+下树 3 n
+下格 3 n
+下框 3 n
+下档 3 b
+下桥 3 v
+下棋 262 v
+下楼 435 v
+下楼去 3 l
+下楼来 3 l
+下楼梯 3 n
+下榻 155 v
+下榻留宾 3 n
+下欠 2 v
+下次 632 t
+下款 137 v
+下步 3 v
+下死劲 8 n
+下段 3 t
+下毒 159 v
+下毒手 181 v
+下比有余 3 l
+下民 3 n
+下气 3 n
+下气怡声 3 z
+下气怡色 3 z
+下水 496 v
+下水典礼 3 n
+下水礼 3 n
+下水管 5 n
+下水船 3 n
+下水道 103 n
+下江 25 ns
+下江兵 4 n
+下汤镇 3 ns
+下沉 319 v
+下沙 6 ns
+下河 50 ns
+下油 3 n
+下泄 31 v
+下法 3 v
+下注 74 v
+下泻 13 v
+下洋 2 ns
+下流 155 v
+下流人士 3 n
+下流坯 3 n
+下流无耻 3 l
+下流社会 3 l
+下流话 9 l
+下浮 19 v
+下海 148 ns
+下海经商 3 n
+下港 3 ns
+下游 1578 f
+下游工业 3 n
+下溢 2 v
+下滑 700 v
+下潜 90 v
+下潮 3 n
+下炕 3 n
+下焦 19 v
+下片 3 n
+下片时 3 b
+下片时间 3 l
+下牙 3 ns
+下狠心 33 l
+下狱 196 v
+下班 623 v
+下班时间 3 l
+下生 3 v
+下田 27 n
+下甲板 3 n
+下界 122 n
+下略 3 v
+下疳 14 n
+下痢 3 n
+下痿 3 v
+下盘 3 v
+下直 3 v
+下相微乳 3 n
+下眼皮 3 l
+下眼睑 3 n
+下着 3 v
+下着雨 3 l
+下着雪 3 l
+下矿 3 n
+下礼 3 v
+下礼拜 6 l
+下种 16 v
+下移 43 v
+下章 3 n
+下端 105 f
+下笔 100 v
+下笔千言 3 l
+下笔如神 3 l
+下笔成文 3 nz
+下笔成章 2 i
+下笔成篇 3 l
+下笔有神 3 n
+下等货 3 n
+下策 20 n
+下签 3 v
+下管 3 v
+下箸 3 vn
+下篇 30 b
+下级 1345 b
+下级单位 3 l
+下级机关 3 l
+下级生 3 n
+下级组织 3 l
+下级职员 3 l
+下级菜单 3 n
+下线 59 n
+下结论 55 n
+下缘 3 v
+下网 66 v
+下联 57 ns
+下聘 3 v
+下肉 3 n
+下肚 119 v
+下肢 182 n
+下肢骨 7 n
+下脘 3 n
+下脚 34 v
+下脚料 12 n
+下脚货 3 n
+下脣 3 vn
+下腰 143 v
+下腹 48 n
+下腹部 3 n
+下膊 3 n
+下臂护甲 3 n
+下臣 61 n
+下自 3 v
+下自成蹊 3 a
+下至 3 v
+下船 59 v
+下花园 5 n
+下花园区 3 ns
+下花桥镇 3 ns
+下苦功 21 l
+下苦功夫 6 l
+下药 25 n
+下菜 3 n
+下营 22 v
+下萨克森 4 ns
+下萨克森州 13 ns
+下落 699 v
+下落不明 91 l
+下葬 129 v
+下蛋 31 v
+下行 161 v
+下行列车 3 n
+下行测井 3 n
+下袅 3 l
+下装 27 v
+下襬 3 vn
+下角 3 n
+下议院 24 n
+下设 686 v
+下诹访市 3 nr
+下诺夫哥罗德 8 nrt
+下课 96 v
+下课后 3 n
+下课时 3 n
+下课时间 3 n
+下课铃 10 n
+下调 471 v
+下调和解 3 l
+下象棋 3 n
+下账 3 v
+下贱 87 v
+下走 3 v
+下起 3 v
+下跌 980 v
+下跌股 3 n
+下跪 133 v
+下身 166 v
+下车 492 v
+下车之始 3 i
+下车伊始 2 ns
+下车作威 3 n
+下车时 3 n
+下车泣罪 3 n
+下载 1151 v
+下载不能 3 l
+下载区 3 n
+下载安装 3 l
+下载工具 3 l
+下载方式 3 l
+下载点 3 n
+下载版 3 b
+下载狂 3 l
+下载站 3 l
+下载者 3 n
+下载速度 2 l
+下载量 2 l
+下载页 3 n
+下辈 7 n
+下辈子 36 l
+下辖 1097 v
+下边 516 f
+下边带 3 n
+下达 1120 v
+下达任务 3 l
+下达指示 3 l
+下达通知 3 l
+下过 399 v
+下述 205 v
+下逐客令 9 n
+下遂客令 3 n
+下遣 3 v
+下部 551 f
+下部结构 3 l
+下酒 51 v
+下酒菜 24 n
+下里巴人 14 nrt
+下野 70 v
+下钓 3 v
+下铺 39 n
+下锅 565 n
+下键 3 n
+下门 3 v
+下问 3 v
+下阕 2 n
+下阙 3 n
+下附 3 v
+下陆区 257 n
+下降 4833 v
+下降时 47 n
+下降时间 3 n
+下降段 3 n
+下限 142 v
+下院 391 n
+下陵上替 3 n
+下陷 95 v
+下集 13 v
+下雨 481 v
+下雨天 27 n
+下雪 145 v
+下雪天 4 n
+下雪量 3 n
+下雹 3 n
+下雾 3 n
+下霜 3 n
+下面 3980 f
+下顿 3 v
+下颌 263 n
+下颌位 3 n
+下颌体 3 n
+下颌切迹 3 n
+下颌前突 3 n
+下颌后缩 3 n
+下颌牙 3 n
+下颌角点 3 n
+下颌运动 3 n
+下颌部 3 n
+下颌隆凸 3 n
+下颌骨 57 n
+下颚 81 n
+下颚骨 3 z
+下额 3 n
+下风 50 v
+下饭 28 v
+下馆子 3 n
+下首 91 v
+下马 1043 v
+下马冯妇 3 i
+下马威 44 ns
+下马村 3 ns
+下马看花 3 i
+下马观花 3 n
+下驷 3 i
+下髎 3 vn
+下龙湾 5 ns
+丌 14 zg
+不 360331 d
+不一 840 c
+不一会 131 l
+不一会儿 229 m
+不一枚举 3 i
+不一而足 57 i
+不一致性 2 l
+不三不四 85 i
+不上不下 10 l
+不上不落 3 l
+不下 2030 v
+不下于 41 c
+不下雨 3 l
+不世之业 3 l
+不世之功 18 i
+不世之材 3 i
+不世出 3 i
+不世奇勋 3 n
+不严 127 a
+不中 769 v
+不中不西 3 l
+不中意 3 l
+不中用 3 l
+不丰不俭 3 i
+不丰不杀 3 i
+不丹 102 ns
+不为 3 c
+不为五斗米折腰 2 i
+不为人知 200 i
+不为己甚 3 i
+不为已甚 10 i
+不为所动 41 i
+不为牛后 3 i
+不为瓦全 144 i
+不为过 240 l
+不主故常 3 i
+不举 3 d
+不久 4679 a
+不久以后 25 l
+不久任 4 l
+不久前 591 t
+不久包 4 l
+不久周 7 t
+不久回 8 m
+不久天 3 t
+不久张 2 m
+不久汪 2 m
+不久程 2 l
+不久章 2 i
+不久重 2 l
+不义 3 n
+不义之财 46 i
+不乏 427 v
+不乏先例 3 i
+不乏其人 22 i
+不乏其例 3 i
+不乐 3 a
+不乐意 3 i
+不习地土 3 n
+不习水土 3 n
+不买账 22 l
+不乱 3 a
+不了 5358 v
+不了不当 3 l
+不了了之 116 i
+不了情 3 i
+不了而了 3 l
+不予 407 v
+不予承认 3 i
+不予理睬 3 i
+不予置评 3 l
+不予考虑 3 i
+不予认定 3 l
+不争 172 n
+不争气 3 n
+不事边幅 3 n
+不二 215 m
+不二价 3 n
+不二法门 10 l
+不亚于 185 v
+不亢不卑 23 i
+不交 3 v
+不亦乐乎 110 i
+不亦善夫 3 i
+不产小麦 3 n
+不产气菌 3 l
+不亮也光 3 ns
+不人道 35 l
+不什 3 l
+不仁 3 v
+不仁不义 3 i
+不仁慈 3 nr
+不仅 11895 c
+不仅仅 1135 d
+不仅如此 742 l
+不今不古 3 l
+不介意 3 l
+不以 3 c
+不以为奇 29 i
+不以为意 139 i
+不以为然 308 i
+不以为耻 32 i
+不以规矩 3 l
+不伏烧埋 3 i
+不休 372 v
+不会 19515 v
+不会弄错 3 i
+不会错 3 i
+不传之密 3 i
+不伤 3 v
+不伤和气 3 n
+不伤脾胃 3 n
+不伦不类 98 i
+不伦瑞克 19 ns
+不似 3 a
+不但 4575 c
+不但如此 3 r
+不住 2023 v
+不体面 3 c
+不体面地 3 l
+不作 3 v
+不作兴 3 l
+不作声 3 n
+不作数 3 l
+不作第二 3 l
+不作美 3 i
+不佞 3 n
+不使 3 c
+不使它 3 n
+不依 167 v
+不依不饶 58 i
+不便 1093 c
+不便水土 3 n
+不俗 222 a
+不信 3 v
+不信任感 13 n
+不信任案 29 n
+不信邪 3 i
+不俭省 3 i
+不修小节 3 i
+不修边幅 20 n
+不倒翁 21 n
+不倦 3 a
+不值 152 n
+不值一提 54 l
+不值一文 9 i
+不值一看 3 l
+不值一笑 8 l
+不值一钱 3 l
+不值一顾 3 l
+不值一驳 4 l
+不值钱 3 n
+不假外出 3 i
+不假思索 83 i
+不偏 3 d
+不偏不倚 47 i
+不偏不党 3 i
+不做不休 3 l
+不做声 203 i
+不停 2035 d
+不停息 3 v
+不停顿 3 v
+不偢不倸 3 z
+不像样 3 l
+不像话 60 l
+不僧不俗 3 i
+不先 3 d
+不先去 3 i
+不先来 3 l
+不光 502 c
+不光会 3 n
+不光滑 3 i
+不克 3 m
+不免 2074 c
+不免有些 3 nr
+不入 3 v
+不入时宜 3 i
+不入流 28 i
+不入虎穴 14 i
+不全是 3 l
+不公 218 n
+不公平地 3 n
+不公平性 4 n
+不共戴天 125 i
+不共载天 3 l
+不关 3 v
+不关我事 3 l
+不关痛痒 8 i
+不关紧要 3 l
+不兴 3 a
+不具 107 n
+不兹 3 ns
+不再 6513 d
+不再出版 3 l
+不冷不热 46 l
+不冻港 37 n
+不准 1283 v
+不凉不酸 3 l
+不减 161 v
+不减当年 38 i
+不凡 348 d
+不出 3 v
+不出去玩 3 n
+不出意外 33 a
+不出所料 66 i
+不击舟 3 n
+不分 3 d
+不分上下 18 l
+不分伯仲 2 n
+不分场合 3 l
+不分彼此 40 l
+不分性别 3 i
+不分昼夜 3 v
+不分玉石 3 i
+不分畛域 3 nr
+不分皂分 3 l
+不分皂白 4 l
+不分胜负 3 l
+不分轩轾 6 nr
+不分青白 3 l
+不分青红 3 l
+不分青红皂白 47 l
+不分首从 3 i
+不切 3 a
+不切实际 146 l
+不切题 3 n
+不刊之书 3 l
+不刊之典 3 n
+不刊之论 3 l
+不刊之说 3 l
+不划算 3 l
+不列颠 258 ns
+不则声 3 d
+不删 3 v
+不利 1818 a
+不利于 617 v
+不利因素 3 l
+不利条件 3 l
+不到 11072 v
+不到之处 3 l
+不到长城非好汉 2 i
+不到黄河心不死 6 i
+不前 3 t
+不前不后 3 l
+不剩 3 v
+不力 252 n
+不加 3 v
+不加分析 3 l
+不加区分 3 n
+不加思索 3 i
+不加渲染 3 nr
+不加考虑 3 i
+不务正业 45 n
+不务空名 3 n
+不劣方头 3 l
+不动 3 v
+不动产 135 l
+不动产业 2 n
+不动声色 456 i
+不动情 3 n
+不动点 24 n
+不动神色 3 l
+不动精子 3 n
+不动配子 3 n
+不劳而得 3 l
+不劳而成 3 l
+不劳而获 21 i
+不勤而获 3 i
+不包分配 3 l
+不升 3 v
+不升反降 3 i
+不卑不亢 45 i
+不单 217 a
+不单单是 3 l
+不单是 3 l
+不即不离 29 i
+不厌 53 v
+不厌其烦 58 i
+不厌其繁 3 l
+不厌其详 3 i
+不及 1498 c
+不及之法 3 i
+不及其余 6 i
+不及格 3 i
+不及格率 3 nz
+不及格者 2 n
+不及物 3 l
+不发火 3 n
+不受 3 v
+不变 2148 v
+不变价格 8 l
+不变其文 3 i
+不变式 7 l
+不变性 3 l
+不变资本 809 l
+不古不今 3 l
+不另行 3 i
+不可 9674 v
+不可一世 282 i
+不可不 253 l
+不可为训 3 i
+不可乡迩 3 i
+不可企及 14 l
+不可估量 70 l
+不可偏废 12 i
+不可分割 157 l
+不可判定 16 n
+不可动摇 35 i
+不可同日而语 83 i
+不可名状 17 i
+不可向迩 3 l
+不可否认 3 i
+不可告人 109 i
+不可多得 76 l
+不可奈何 3 i
+不可开交 109 i
+不可思议 437 i
+不可或缺 164 l
+不可抗力 39 l
+不可捉摸 33 i
+不可揆度 3 vn
+不可摸捉 3 i
+不可收拾 143 i
+不可救疗 3 l
+不可救药 44 i
+不可救葯 3 nz
+不可教 3 l
+不可教训 3 n
+不可数 3 l
+不可旁贷 3 i
+不可枚举 3 i
+不可理喻 56 i
+不可知论 37 i
+不可磨灭 93 i
+不可端倪 3 l
+不可等闲视之 8 l
+不可终日 7 i
+不可考 3 l
+不可胜举 3 i
+不可胜数 45 l
+不可胜算 3 l
+不可胜纪 2 i
+不可胜言 2 i
+不可胜计 12 i
+不可胜记 6 i
+不可胜道 3 i
+不可自拔 3 i
+不可补救 3 i
+不可见光 3 i
+不可视区 3 n
+不可解地 3 l
+不可解性 3 l
+不可触摸 3 i
+不可言传 26 i
+不可言喻 18 i
+不可言宣 3 i
+不可言状 3 i
+不可讳言 3 i
+不可论证 3 i
+不可违 3 i
+不可逆性 31 l
+不可逆波 3 i
+不可逆转 109 i
+不可造次 3 l
+不可逾越 70 i
+不可避免 650 l
+不可限量 44 l
+不可靠性 3 n
+不可须臾离 4 i
+不吃 1059 v
+不吃不喝 3 l
+不合 507 v
+不合宜 3 a
+不合情理 3 l
+不合时令 3 l
+不合时宜 103 i
+不合时尚 3 n
+不合标准 3 n
+不合格品 9 n
+不合格率 2 n
+不合格者 31 n
+不合理 470 n
+不合理性 7 n
+不合算 3 l
+不合规定 3 a
+不合规律 3 l
+不合规格 3 l
+不合调 3 l
+不合身 3 n
+不合逻辑 3 l
+不吉之兆 3 i
+不同 29383 a
+不同之处 3 l
+不同于 1131 c
+不同凡响 79 l
+不同印本 3 l
+不同寻常 141 i
+不同戴天 3 i
+不同流俗 8 i
+不同点 42 n
+不名一文 6 i
+不名一格 3 i
+不名一钱 3 l
+不名数 3 l
+不名誉 8 l
+不吐不茹 3 n
+不吐骨头 3 i
+不吝 50 a
+不吝指教 3 i
+不吝指正 3 i
+不吝珠玉 3 i
+不吝赐教 18 i
+不吝金玉 3 i
+不含 3 v
+不含税 3 l
+不含糊 14 z
+不听使唤 3 i
+不听话 3 l
+不吭 3 l
+不吭一声 3 i
+不吭声 3 i
+不吵不闹 3 l
+不告而别 3 i
+不告而辞 3 i
+不周 60 t
+不周到 3 l
+不周延 17 n
+不和睦 3 l
+不和蔼 3 nr
+不咎既往 15 i
+不咸不淡 12 l
+不哼一声 3 i
+不哼不哈 5 z
+不哼声 3 i
+不啻 62 d
+不啻天渊 3 nr
+不善 409 v
+不善言辞 16 i
+不喜勿下 3 i
+不回话 3 l
+不因 3 c
+不因不由 3 l
+不因人热 3 i
+不图 24 v
+不在 3705 v
+不在乎 490 i
+不在其位 10 i
+不在少数 76 l
+不在意 3 i
+不在此列 3 l
+不在此限 3 l
+不在话下 324 l
+不均 277 a
+不均一性 3 l
+不坏 3 v
+不堪 983 v
+不堪一击 134 i
+不堪入目 29 i
+不堪入耳 10 i
+不堪其忧 3 i
+不堪回首 42 i
+不堪救药 3 i
+不堪言状 3 i
+不堪设想 184 i
+不堪负担 3 l
+不堪造就 3 i
+不堪重负 59 i
+不堵车 3 l
+不塞下流 3 i
+不塞不流 3 i
+不声不吭 3 l
+不声不响 105 l
+不声不气 3 l
+不壹 3 m
+不壹而三 3 nr
+不壹而足 3 nr
+不备 99 v
+不复 21 v
+不复位瓣 3 n
+不复堪命 3 i
+不复存在 195 l
+不外 134 c
+不外乎 117 l
+不外借 3 v
+不外是 3 l
+不多 3 m
+不多不少 3 l
+不多会儿 3 m
+不多时 731 d
+不多见 3 l
+不夜城 14 i
+不夜天 2 t
+不够 2651 v
+不够意思 5 l
+不够格 3 l
+不够看 3 l
+不大 795 a
+不大一样 3 l
+不大不小 77 l
+不大可能 3 i
+不大好 3 l
+不大想 3 i
+不大清楚 3 z
+不太会 3 n
+不太可能 3 i
+不太好 3 v
+不太想 3 n
+不太熟悉 3 ns
+不太能 3 n
+不失 353 v
+不失为 272 v
+不失众望 3 i
+不失圭撮 3 nr
+不失时宜 3 i
+不失时机 139 l
+不失毫厘 3 i
+不失良机 3 l
+不失黍絫 3 z
+不夷不惠 3 i
+不奈 3 d
+不奈之何 3 i
+不奈烦 3 i
+不好 5027 d
+不好不坏 2 i
+不好办 3 i
+不好受 3 a
+不好惹 32 a
+不好意思 829 a
+不好战 3 l
+不好死 3 i
+不好比 3 z
+不好玩 3 a
+不好用救 3 i
+不好谈 3 i
+不好过 81 l
+不如 2518 c
+不如人意 16 i
+不如归去 3 i
+不如意 136 i
+不如意事常八九 2 l
+不如说 95 l
+不如说是 3 c
+不妙 454 a
+不妥 486 a
+不妨 1481 v
+不妨一试 3 v
+不媿下学 3 vn
+不嫉妒 3 i
+不嫌 3 v
+不孕 134 v
+不孕症 14 n
+不存 3 v
+不存不济 3 l
+不存芥蒂 3 l
+不孚众望 3 l
+不孝 191 a
+不孝之子 9 l
+不孝子 3 l
+不孝有三 3 i
+不学 3 n
+不学无术 41 l
+不学无识 3 l
+不宁 3 c
+不宁唯是 3 n
+不守 3 v
+不守信用 3 l
+不安 1531 a
+不安于位 3 l
+不安于室 3 i
+不安份 3 n
+不安全感 22 n
+不安其室 3 i
+不安分 3 n
+不安宁 3 ns
+不安定感 2 n
+不完全性 13 l
+不定 733 d
+不定人称 3 n
+不定冠词 3 i
+不定型 4 n
+不定式 61 l
+不定形 3 n
+不定期 147 d
+不定根 25 n
+不定积分 13 l
+不定词 3 n
+不定量 3 n
+不宜 1290 a
+不宜复印 3 i
+不宜居住 3 i
+不宜深造 3 l
+不实 3 d
+不实之处 3 l
+不实之词 9 l
+不审慎 3 n
+不宣而战 23 l
+不害噪 3 i
+不害羞 3 n
+不容 655 n
+不容乐观 74 l
+不容分说 39 l
+不容分辩 3 l
+不容小视 17 l
+不容忽视 147 l
+不容置喙 2 i
+不容置疑 89 i
+不容置辩 3 l
+不容许 3 d
+不寐 3 v
+不寒而慄 3 nr
+不寒而栗 117 i
+不察 3 v
+不对 695 d
+不对劲 3 l
+不对味 3 l
+不对头 3 l
+不对称性 3 n
+不对茬 3 n
+不对茬儿 3 n
+不封 3 v
+不射之射 3 l
+不小 1092 a
+不少 8340 d
+不少台 24 m
+不少名 10 m
+不少圈 2 m
+不少招 2 m
+不少次 5 m
+不少汪 2 m
+不少种 7 m
+不少端 2 n
+不少第五等 2 m
+不少篇 3 m
+不少线 2 n
+不尚空谈 8 i
+不尴不尬 2 i
+不尽 985 d
+不尽一致 3 i
+不尽人意 27 i
+不尽合理 11 l
+不尽根 3 i
+不尽然 38 i
+不尽相同 3 i
+不屈 568 v
+不屈不挠 104 i
+不屑 355 v
+不屑一顾 96 i
+不屑于 3 n
+不屑教诲 3 i
+不屑毁誉 3 i
+不巧 73 a
+不差上下 3 l
+不差什么 3 l
+不差毫厘 3 i
+不差毫发 3 i
+不差累黍 3 n
+不已 1069 d
+不帅 3 n
+不常 3 d
+不常出现 3 i
+不干不净 55 l
+不干胶 3 n
+不平 551 n
+不平则鸣 3 i
+不平等性 2 l
+不平衡性 17 n
+不平道人 3 n
+不幸 1861 a
+不幸病故 3 i
+不幸者 5 n
+不幸而言中 7 i
+不幸身亡 3 i
+不幸逝世 3 vn
+不幸遇害 3 l
+不幸遇难 3 i
+不幸遭遇 3 vn
+不应 3 v
+不应得 3 i
+不应期 7 n
+不废江河 3 i
+不廉 3 a
+不延误 3 l
+不开 3 v
+不弃 3 v
+不弃草昧 3 i
+不弱 3 a
+不强 3 v
+不强不弱 3 l
+不归路 3 i
+不归零制 3 i
+不当 657 d
+不当不正 3 i
+不当之处 3 i
+不当人子 14 l
+不当得利 3 l
+不往 3 d
+不待 3 v
+不待蓍龟 3 nz
+不待说 3 l
+不徇私情 14 i
+不徐不疾 3 i
+不得 6248 v
+不得不 3096 d
+不得不尔 3 d
+不得之心 3 i
+不得了 363 l
+不得人心 49 i
+不得体 3 d
+不得公开 3 l
+不得其所 5 i
+不得其死 3 i
+不得其法 3 i
+不得其解 3 i
+不得劲 8 a
+不得善终 3 i
+不得好死 3 a
+不得已 527 d
+不得已地 3 l
+不得已而为之 50 i
+不得开交 3 i
+不得志 3 i
+不得有误 3 l
+不得申诉 3 n
+不得而知 151 i
+不得要领 55 l
+不得违误 3 i
+不得闲 3 i
+不循常轨 3 i
+不循私情 3 i
+不必 3955 d
+不必因 3 i
+不必要 504 l
+不忌生冷 3 i
+不忍 628 v
+不忍卒读 5 i
+不忍心 3 l
+不忘故旧 3 i
+不忘本 3 l
+不忘沟壑 3 i
+不忙 3 d
+不忙不暴 3 i
+不忠 3 v
+不忠实 3 i
+不忠实地 3 l
+不快 476 d
+不快不慢 3 l
+不忮不求 3 v
+不念 3 n
+不念旧恶 18 i
+不念旧情 3 n
+不忿 3 i
+不怀好意 163 i
+不怎么 261 l
+不怎么样 28 l
+不怕 1607 c
+不怕困难 3 i
+不怕官 3 l
+不怕死 160 l
+不怕没柴烧 20 i
+不怕牺牲 68 l
+不怕累 10 l
+不怕苦 9 l
+不怕难 3 l
+不思好歹 3 i
+不思悔改 5 i
+不思进取 29 l
+不急 3 a
+不急不徐 3 z
+不急之务 12 l
+不怨 3 v
+不怪 3 v
+不恤 3 v
+不恤人言 3 n
+不恭 3 a
+不恭不敬 2 i
+不息 198 v
+不恰当地 3 ns
+不恶而严 3 i
+不悔改 3 i
+不悦 203 a
+不悱不发 3 i
+不情之请 12 i
+不惑 35 v
+不惑之年 14 i
+不惜 882 v
+不惜一切 3 i
+不惜一战 3 i
+不惜代价 3 i
+不惜工本 12 l
+不惜成本 3 l
+不惜牺牲 3 i
+不惜重金 3 l
+不惟 149 c
+不惧 3 a
+不惮 3 v
+不惯 3 n
+不想 4563 v
+不愁 3 a
+不愁吃 3 l
+不愁穿 3 i
+不愉 3 a
+不意 191 v
+不感兴趣 3 l
+不愤不启 3 i
+不愧 336 a
+不愧下学 3 l
+不愧不作 3 v
+不愧为 115 v
+不愧屋漏 3 i
+不慌 3 a
+不慌不乱 2 i
+不慌不忙 202 i
+不慎 189 a
+不慢 3 d
+不懂事 3 l
+不懂装懂 29 l
+不懂道理 3 l
+不懈 269 a
+不懈努力 89 l
+不懊悔 3 vn
+不成 1160 v
+不成三瓦 3 m
+不成人 18 l
+不成人子 3 l
+不成体统 33 l
+不成器 65 l
+不成形 3 l
+不成想 12 i
+不成才 3 l
+不成敬意 3 i
+不成文 3 nz
+不成文法 39 l
+不成文规 3 l
+不成方圆 3 l
+不成材 27 n
+不成比例 3 i
+不成气候 3 l
+不成认 3 l
+不成话 66 l
+不成钢 3 n
+不成问题 3 l
+不戒 3 n
+不戒和尚 3 n
+不战 3 v
+不战不和 3 i
+不战而胜 11 i
+不战而败 3 l
+不战而退 3 l
+不战自败 3 i
+不打不成相识 10 i
+不打不相 3 i
+不打不相识 10 i
+不打紧 3 l
+不打自招 14 i
+不托 3 v
+不扬 3 v
+不扶自直 3 i
+不抗不卑 3 i
+不折 3 a
+不折不扣 164 i
+不折不挠 4 i
+不护细行 3 n
+不报 3 v
+不抽烟者 3 i
+不拔 3 n
+不拔一毛 3 i
+不拔之志 3 i
+不拘 112 v
+不拘一格 59 i
+不拘小节 27 i
+不拘形式 3 nz
+不拘形迹 6 i
+不拘泥 3 i
+不拘礼节 3 i
+不拘细节 3 i
+不拘细行 3 i
+不择 3 v
+不择手段 82 i
+不择生冷 3 i
+不拿薪水 3 i
+不按君臣 3 n
+不按牌理 3 n
+不挑之祖 3 i
+不挠不屈 3 i
+不挠不折 3 i
+不挡 3 v
+不振 99 a
+不捕 3 v
+不换 3 v
+不掉 3 v
+不推迟 3 l
+不揍 3 v
+不提也罢 3 nr
+不揣冒昧 3 n
+不揪不採 3 z
+不揪不睬 3 v
+不揪不采 3 v
+不撮药 3 nr
+不擅辞令 3 nr
+不擒二毛 3 i
+不支 125 m
+不支倒地 3 i
+不收 3 v
+不改其 3 nr
+不改其乐 3 i
+不攻自破 30 i
+不放 3 v
+不放过 3 l
+不敌 3 v
+不敏 3 a
+不教之教 3 l
+不教而杀 3 i
+不教而诛 3 i
+不敢 13208 d
+不敢后人 3 l
+不敢告劳 3 i
+不敢当 313 l
+不敢恭维 3 l
+不敢想像 3 n
+不敢掠美 3 i
+不敢旁骛 3 l
+不敢来啦 3 n
+不敢相信 3 i
+不敢肯定 3 nr
+不敢自专 3 l
+不敢苟同 20 i
+不敢越雷池一步 5 l
+不敢造次 37 l
+不敢问津 20 l
+不敢高攀 3 i
+不散 3 v
+不敬 3 a
+不整洁 3 z
+不文 3 n
+不文不武 3 i
+不文雅 3 i
+不料 1560 n
+不断 14972 d
+不断丰富 3 l
+不断创新 3 l
+不断前进 3 l
+不断加强 3 i
+不断如带 3 i
+不断完善 3 l
+不断扩大 3 n
+不断改进 3 l
+不断更新 3 i
+不断涌现 3 i
+不断深入 3 i
+不断耷拉 3 l
+不断进取 3 l
+不断进步 3 l
+不新不旧 3 i
+不旋肿 3 n
+不旋踵 3 i
+不无 273 v
+不无关系 68 l
+不无可疑 3 i
+不无小补 3 i
+不无禁忌 3 i
+不无裨益 3 i
+不无道理 36 i
+不无遗憾 20 i
+不日不月 3 i
+不日启程 3 l
+不早 3 d
+不早不晚 3 l
+不早了 3 l
+不时 987 c
+不时之需 25 l
+不明 820 v
+不明不暗 3 i
+不明不白 145 l
+不明事里 3 i
+不明底蕴 3 n
+不明智 3 i
+不明朗 3 i
+不明真相 3 i
+不明说 3 l
+不明飞行物 24 l
+不易 1655 a
+不易一字 3 l
+不易之典 3 i
+不易之论 3 i
+不易感动 3 l
+不易控制 3 n
+不易而论 3 i
+不是 46856 c
+不是之处 3 l
+不是冤家不聚头 7 l
+不是味儿 16 l
+不是太好 3 l
+不是故意 3 i
+不显 3 a
+不显山不露水 8 i
+不晓 3 v
+不晓世务 3 l
+不晚 3 d
+不景气 175 a
+不智 3 a
+不智之举 3 i
+不暇 3 d
+不暇顾及 3 i
+不更事 3 i
+不曾 1071 d
+不曾有过 3 i
+不替 3 v
+不服 824 v
+不服气 3 l
+不服水土 13 n
+不服输 3 l
+不期 451 d
+不期修古 3 l
+不期然 3 l
+不期而会 3 l
+不期而同 3 l
+不期而然 3 l
+不期而至 30 l
+不期而遇 39 l
+不朽 339 a
+不朽名作 3 l
+不材 3 n
+不来 3 v
+不来梅 87 l
+不来梅港 2 ns
+不来电 3 l
+不松 3 a
+不枉 3 v
+不果 3 c
+不染一尘 3 l
+不查 3 v
+不栉进士 3 i
+不根之论 3 i
+不根之谈 3 i
+不桃之祖 3 i
+不检 3 v
+不模头 3 l
+不次之位 3 m
+不次之迁 3 v
+不欢而散 36 i
+不欺屋漏 3 i
+不欺暗室 2 i
+不欺闇室 3 i
+不止 981 v
+不止一次 3 l
+不止不行 3 i
+不正 227 d
+不正之风 151 i
+不正当地 3 i
+不正派 3 b
+不正经 3 d
+不此之图 3 i
+不步人脚 3 i
+不死不活 19 i
+不死心 3 i
+不死鸟 3 i
+不毛 14 n
+不毛之地 31 i
+不气 3 n
+不求 3 v
+不求上进 3 i
+不求人 3 n
+不求利 3 i
+不求名 3 i
+不求名利 3 i
+不求有功 11 i
+不求甚解 15 i
+不求闻达 6 i
+不治 3 v
+不治之症 54 l
+不治而死 3 l
+不泄气 3 i
+不法 233 n
+不法之徒 15 i
+不法侵害 3 l
+不法分子 112 l
+不法常可 3 l
+不法者 6 n
+不法行为 3 l
+不洁 3 a
+不测 108 v
+不测之忧 3 i
+不测之祸 3 i
+不测之罪 3 i
+不测风云 4 i
+不济 235 n
+不济事 52 n
+不涂 3 a
+不消 203 v
+不消说 3 l
+不涨 3 v
+不涨反跌 3 l
+不涩 3 a
+不涩不苦 3 n
+不淑 3 a
+不清不楚 3 l
+不清不白 3 l
+不温不火 3 l
+不溶混合 3 l
+不滑稽 3 i
+不满 1880 a
+不满情绪 3 i
+不满意率 3 l
+不满者 3 n
+不满足感 2 i
+不漏 3 v
+不漏水 3 i
+不灭 3 v
+不灭定律 3 n
+不灵 192 a
+不灵巧 3 i
+不灵敏 3 l
+不点 3 d
+不烦 3 a
+不然 1266 c
+不然的话 67 l
+不熟 3 a
+不爱交际 3 l
+不爽 96 a
+不爽快 3 a
+不爽毫发 3 l
+不爽累黍 3 n
+不牧之地 3 n
+不特 3 a
+不犯 118 v
+不狂 3 a
+不独 55 d
+不独有偶 3 i
+不猧不魀 3 z
+不理 707 v
+不理不睬 3 i
+不甘 376 v
+不甘后人 3 i
+不甘寂寞 32 i
+不甘沉沦 3 l
+不甘示弱 46 l
+不甘落后 48 i
+不甘雌伏 3 i
+不甚了了 25 l
+不甚了解 3 l
+不甚明朗 3 i
+不生不灭 18 i
+不用 2829 v
+不用拼音 3 n
+不用浪费 3 n
+不用说 12 l
+不用谢 3 i
+不用选字 3 l
+不由 720 a
+不由分说 105 l
+不由得 3271 d
+不由自主 561 i
+不男不女 3 l
+不畅 3 a
+不畏 309 v
+不畏强敌 3 i
+不畏强暴 39 i
+不畏强权 3 i
+不畏艰险 3 i
+不畏艰难 3 i
+不留 429 v
+不留余地 19 l
+不留后路 3 l
+不留心 3 l
+不留情 3 n
+不留情面 3 l
+不疲倦 3 i
+不疼不痒 8 i
+不疾不徐 3 l
+不痛 3 a
+不痛不痒 23 i
+不痴不聋 3 i
+不瘟不火 4 n
+不登大雅 3 i
+不登大雅之堂 8 l
+不白 3 v
+不白之冤 27 i
+不直一文 3 i
+不直一钱 3 l
+不相上下 97 i
+不相为谋 3 i
+不相容 3 i
+不相容性 3 l
+不相干 231 l
+不相往来 3 i
+不相称 3 n
+不相称地 3 i
+不相等地 3 l
+不相适应 3 i
+不相问闻 3 i
+不相闻问 3 i
+不省人事 69 i
+不省得 41 v
+不看僧面看佛面 13 l
+不真不假 3 l
+不眠不休 3 l
+不眠之夜 22 l
+不着 3 c
+不着疼热 3 i
+不着痕迹 3 l
+不着边际 79 l
+不着陆 3 l
+不睬 3 v
+不瞅不睬 5 i
+不瞒你说 85 l
+不瞒您说 5 l
+不瞽不聋 3 v
+不矜不伐 3 nr
+不矜细行 3 nr
+不知 14806 v
+不知丁董 3 n
+不知下落 3 l
+不知不觉 662 i
+不知世务 3 l
+不知为不 3 l
+不知为不知 5 i
+不知人间有羞耻事 4 i
+不知今夕何夕 6 i
+不知其二 3 i
+不知其可 4 i
+不知其所以然 7 i
+不知凡几 11 i
+不知分寸 3 l
+不知利害 3 l
+不知去向 287 i
+不知天高地厚 80 i
+不知头脑 3 i
+不知好人 3 i
+不知好歹 82 i
+不知寝食 3 i
+不知就里 20 l
+不知廉耻 3 i
+不知悔改 3 i
+不知情 3 i
+不知情地 3 i
+不知所云 90 i
+不知所以 7 i
+不知所出 3 i
+不知所厝 3 ns
+不知所可 3 i
+不知所指 3 i
+不知所措 310 i
+不知所终 30 i
+不知所言 3 i
+不知所谓 3 l
+不知所适 3 l
+不知所错 3 i
+不知有汉 2 i
+不知死活 37 i
+不知深浅 24 i
+不知火舞 3 i
+不知甘苦 3 i
+不知疲倦 3 i
+不知疼痒 3 i
+不知痛痒 3 i
+不知真假 3 i
+不知端倪 3 l
+不知纪极 3 n
+不知羞耻 3 i
+不知老之将至 4 i
+不知者 27 n
+不知肉味 3 i
+不知自爱 3 i
+不知自量 3 i
+不知薡蕫 3 v
+不知起倒 3 i
+不知足 3 i
+不知轻重 26 i
+不知进取 3 l
+不知进退 9 l
+不知颠倒 3 i
+不知高下 3 i
+不知高低 16 i
+不破 132 v
+不破不立 4 i
+不确定性 129 n
+不碍 3 v
+不磨损 3 i
+不礼貌 3 i
+不祥 294 a
+不祥之兆 40 i
+不祧之宗 3 v
+不祧之祖 3 v
+不禁 4190 d
+不禁不由 3 l
+不禁意 3 l
+不离 3 v
+不积跬步 2 l
+不称职 3 i
+不称职者 3 n
+不移 3 v
+不稂不秀 3 i
+不稂不莠 2 i
+不稳 3 a
+不稳固 3 a
+不稳定地 3 n
+不稳定性 75 n
+不稳平衡 4 i
+不稼不穑 3 n
+不立文字 2 n
+不竭 29 v
+不端 92 n
+不符 198 v
+不符逻辑 3 n
+不笨 3 a
+不等 1126 a
+不等价 7 n
+不等号 9 n
+不等式 103 l
+不等方程 3 l
+不等边 3 l
+不等量 3 l
+不箕 3 n
+不算 1651 v
+不算什么 3 l
+不算数 3 n
+不管 4727 c
+不管一二 3 l
+不管三七 3 nz
+不管三七二十一 46 l
+不管不顾 37 l
+不管怎么 3 l
+不管怎样 299 l
+不管是谁 3 i
+不管部 9 n
+不管部长 13 l
+不粗不细 3 i
+不粘锅 4 n
+不精确地 3 n
+不精确性 3 n
+不紧不慢 81 l
+不紧不离 3 l
+不累 3 v
+不繁 3 a
+不约 3 d
+不约而同 385 i
+不纯 3 a
+不经 3 d
+不经一事 3 l
+不经世故 3 i
+不经之语 3 i
+不经之说 3 l
+不经之谈 3 i
+不经事 3 n
+不经意 234 l
+不结之缘 3 i
+不结果实 3 i
+不结盟 114 l
+不结盟国 3 n
+不结盟运动 41 nz
+不给你看 3 l
+不绝 3 v
+不绝于耳 85 i
+不绝如发 3 i
+不绝如带 3 i
+不绝如线 3 l
+不绝如缕 7 i
+不绝若线 3 i
+不缩 3 v
+不缩水 3 n
+不置 3 v
+不置一词 8 i
+不置可否 102 i
+不置褒贬 3 l
+不羁 62 v
+不羁之才 3 nr
+不羁之民 3 nr
+不美观 3 l
+不羞当面 3 i
+不習水土 3 v
+不翼而飞 31 i
+不老少 3 l
+不老泉 3 n
+不老练 3 v
+不老草 3 l
+不耐 3 a
+不耐其烦 3 i
+不耐烦 664 a
+不耻 3 a
+不耻下问 3 l
+不耻最后 3 v
+不联会 3 n
+不肖 128 n
+不肖子孙 28 i
+不肥不瘦 3 i
+不肯 5166 v
+不育 185 v
+不育症 19 n
+不胜 479 v
+不胜举 3 i
+不胜任 3 l
+不胜其任 3 l
+不胜其扰 3 l
+不胜其烦 12 i
+不胜其苦 3 i
+不胜唏嘘 3 z
+不胜感激 3 l
+不胜枚举 77 i
+不胜桮杓 3 nr
+不胜负荷 3 n
+不胜酒力 3 i
+不胫而走 52 i
+不能 33939 v
+不能上演 3 v
+不能不 1440 d
+不能不睬 3 i
+不能不要 11 l
+不能偿还 3 i
+不能允许 3 nr
+不能分解 3 l
+不能到达 3 l
+不能医治 3 n
+不能取消 3 l
+不能变更 3 i
+不能同意 3 i
+不能容忍 3 l
+不能平静 3 i
+不能废除 3 i
+不能引开 3 l
+不能引用 3 l
+不能忘怀 3 i
+不能抑制 3 n
+不能根除 3 i
+不能治愈 3 l
+不能涂抹 3 i
+不能混合 3 i
+不能溶解 3 l
+不能生存 3 l
+不能移去 3 i
+不能缓和 3 i
+不能自制 3 l
+不能自己 68 i
+不能自已 39 i
+不能自拔 77 i
+不能解救 3 i
+不能言传 3 l
+不能证实 3 n
+不能转让 3 i
+不能逃避 3 i
+不脩边幅 3 n
+不脱 3 v
+不腆之仪 3 v
+不臣之心 3 i
+不自 3 d
+不自在 3 d
+不自满假 3 i
+不自禁 283 i
+不自重 3 i
+不自量 7 l
+不自量力 72 l
+不至于 644 c
+不致 846 c
+不致于 194 v
+不舍昼夜 3 v
+不舞之鹤 3 i
+不良 1941 a
+不良习惯 3 n
+不良习气 3 n
+不良份子 3 l
+不良信息 3 i
+不良倾向 3 i
+不良分子 3 l
+不良反应 3 l
+不良后果 3 i
+不良嗜好 3 z
+不良导体 4 n
+不良少年 3 l
+不良影响 3 l
+不良情绪 3 i
+不良率 2 n
+不良现象 3 l
+不良行为 3 i
+不良贷款 3 n
+不良资产 3 l
+不良风气 3 l
+不苟 3 i
+不苟言笑 85 i
+不若 3 c
+不苦 3 a
+不茶不饭 3 i
+不药而愈 3 l
+不莱梅 29 nr
+不菲 138 a
+不落 3 v
+不落人后 3 i
+不落俗套 6 i
+不落窠臼 7 i
+不落边际 3 l
+不蔓不支 3 n
+不蔓不枝 3 n
+不薄 3 a
+不虔诚 3 vn
+不虚 3 a
+不虚此行 25 i
+不虞 3 v
+不虞之誉 3 i
+不虞匮乏 3 i
+不行 3515 v
+不衫不履 3 l
+不衰 143 v
+不装 3 v
+不要 14786 df
+不要南郭 3 n
+不要命 3 l
+不要紧 401 l
+不要脸 236 l
+不见 2257 v
+不见不散 3 i
+不见天日 3 i
+不见得 236 d
+不见森林 2 i
+不见棺材不掉泪 9 l
+不见泰山 3 i
+不见经付 3 n
+不见经传 3 l
+不见踪影 3 i
+不规则 347 a
+不规矩 11 l
+不觉 1348 d
+不觉技痒 3 l
+不解 490 v
+不解之仇 3 i
+不解之缘 53 i
+不解之谜 3 n
+不解事 3 n
+不解风情 3 i
+不言 3 c
+不言不语 43 i
+不言而信 3 i
+不言而喻 211 i
+不言而明 3 i
+不言而谕 3 n
+不言自明 53 i
+不计 258 v
+不计其数 300 i
+不计前嫌 3 l
+不计后果 3 i
+不计得失 3 i
+不计成本 3 l
+不计报酬 3 n
+不认帐 3 v
+不认账 3 l
+不让 2486 v
+不让步者 3 n
+不让进入 3 n
+不让须眉 3 n
+不记前仇 3 l
+不记名投 3 l
+不讲情面 3 l
+不讲方法 3 l
+不讲条件 3 l
+不讲理 3 l
+不讲道理 3 l
+不讳 10 v
+不讳之朝 3 i
+不讳之路 3 i
+不讳之门 3 i
+不许 2701 d
+不许动 3 i
+不许失败 3 i
+不许百姓点灯 4 i
+不论 2373 c
+不论什么 3 l
+不论如何 3 l
+不论怎么 3 l
+不论怎样 3 l
+不论是 443 c
+不论是谁 3 i
+不设防 3 i
+不识 3 v
+不识一丁 3 i
+不识不知 3 i
+不识东家 3 l
+不识之无 3 l
+不识大体 3 l
+不识好歹 47 i
+不识局面 3 n
+不识庐山真面目 6 l
+不识抬举 40 i
+不识时务 46 l
+不识时变 3 l
+不识泰山 3 i
+不识货 3 n
+不识起倒 3 l
+不识闲儿 3 l
+不识阵势 3 l
+不识马肝 3 n
+不识高低 3 i
+不诉 3 v
+不诚实 3 i
+不该 1936 v
+不详 286 v
+不语 913 n
+不误 3 v
+不请自到 5 i
+不请自来 3 i
+不读 3 v
+不调 3 v
+不谋其政 7 i
+不谋其职 3 i
+不谋同辞 3 i
+不谋私利 3 i
+不谋而合 65 i
+不谋而同 3 i
+不谐和 3 nz
+不谓 3 v
+不谙 42 v
+不谙世事 13 l
+不谦虚 3 i
+不象 3 n
+不象样 3 l
+不象话 3 l
+不豫 3 a
+不贝 3 n
+不贞 3 a
+不贞洁 3 l
+不负 435 v
+不负众托 3 n
+不负众望 28 l
+不负使命 3 i
+不负所托 3 n
+不负责任 3 l
+不负重望 2 l
+不败 560 v
+不败之地 7 i
+不贪为宝 3 i
+不贵 3 a
+不费 3 v
+不费之惠 3 i
+不费力气 3 n
+不费吹灰之力 58 l
+不费周折 3 n
+不赀 3 i
+不赏之功 3 l
+不赖 44 v
+不赞一词 3 nr
+不走过场 3 l
+不起作用 3 l
+不起眼 153 l
+不起眼儿 7 l
+不越雷池 3 n
+不足 5615 a
+不足与谋 3 i
+不足为凭 38 i
+不足为外 3 i
+不足为外人道 12 i
+不足为奇 132 i
+不足为怪 33 i
+不足为意 3 i
+不足为据 3 i
+不足为法 3 i
+不足为虑 3 i
+不足为训 6 i
+不足之处 3 i
+不足介意 3 i
+不足以 525 v
+不足取 16 v
+不足挂齿 20 i
+不足称道 3 i
+不足者 15 n
+不足轻重 3 i
+不足道 51 v
+不足道也 3 i
+不足齿数 3 i
+不跌 3 v
+不跌反涨 3 l
+不跟人 3 n
+不蹬大雅 3 nr
+不轨 93 v
+不轨之徒 3 l
+不轻 3 a
+不轻不重 3 i
+不轻然诺 3 l
+不辍 3 v
+不输给 3 n
+不辞 3 v
+不辞劳苦 41 l
+不辞而别 58 i
+不辞辛劳 19 i
+不辞辛苦 25 i
+不辟斧钺 3 i
+不辨是非 3 i
+不辨真伪 3 n
+不辨菽粟 3 nr
+不辨菽麦 3 v
+不辩菽麦 3 v
+不辱使命 28 i
+不迁之庙 3 n
+不过 17372 c
+不过关 3 l
+不过如此 52 c
+不过尔尔 17 nz
+不过意 24 d
+不近人情 49 i
+不近情理 3 i
+不近道理 3 i
+不进不退 3 l
+不进则退 20 l
+不进反退 3 l
+不远 1294 d
+不远万里 22 i
+不远千里 31 i
+不远处 405 s
+不违农时 3 i
+不连续性 15 n
+不连贯 3 i
+不迟 3 d
+不迭 3 d
+不追既往 3 i
+不退 3 v
+不退反进 3 i
+不退赃 3 i
+不适 505 a
+不适中 3 i
+不适感 24 n
+不适症 2 n
+不逊 81 a
+不逊于 3 l
+不透光 3 n
+不透性 3 n
+不透明性 3 n
+不透气 3 n
+不透水 3 n
+不通 542 a
+不通人情 3 n
+不通水火 3 i
+不逞 3 v
+不逞之徒 13 i
+不速之客 79 i
+不遂 41 v
+不遂意 3 i
+不遑启处 3 nr
+不遑宁处 3 nz
+不遑宁息 3 nz
+不遑暇食 3 l
+不遑枚举 3 nr
+不道德 69 i
+不遗余力 126 l
+不遗寸长 3 i
+不遗巨细 3 i
+不避 3 v
+不避斧钺 3 i
+不避水火 3 l
+不避汤火 3 l
+不避艰险 6 l
+不避风险 3 l
+不郎不秀 3 i
+不配 213 v
+不酸 3 n
+不酸不甜 3 l
+不酸不苦 3 l
+不酸不辣 3 l
+不醒 3 v
+不重 3 a
+不重性 3 n
+不量力 3 n
+不钓 3 v
+不锈 6 v
+不锈钢 153 n
+不锈钢丝 3 n
+不锈钢材 4 n
+不锈钢板 4 n
+不锈钢管 3 n
+不锈钢网 3 nz
+不错 5322 a
+不错呀 3 n
+不长 3 v
+不长一智 7 i
+不长不短 3 i
+不长进 3 i
+不问 300 v
+不问不闻 3 i
+不问皂白 3 l
+不问青红皂白 22 l
+不间不界 3 l
+不间断 3 l
+不闻不问 57 l
+不防 3 v
+不阴不阳 16 l
+不降 165 v
+不降反升 3 l
+不限 3 a
+不限在 3 l
+不随以止 3 l
+不随意肌 4 l
+不难 1652 d
+不难想像 3 n
+不难想象 3 l
+不难猜测 3 i
+不难理解 3 l
+不难看出 3 i
+不难设想 3 i
+不雅 3 a
+不雅致 3 n
+不雅观 3 n
+不露 3 v
+不露圭角 3 i
+不露声色 42 i
+不露形色 3 i
+不露痕迹 3 l
+不露神色 3 i
+不露锋芒 3 i
+不露锋铓 3 v
+不静 3 a
+不靠 157 v
+不韪 3 i
+不顺 223 a
+不顺心 3 i
+不顺服 3 i
+不顺遂 3 l
+不须 329 d
+不顾 1722 v
+不顾一切 239 i
+不顾前后 3 i
+不顾后果 3 i
+不顾大局 7 i
+不顾死活 11 i
+不预则废 8 i
+不领 3 v
+不领情 3 l
+不食之地 3 l
+不食周粟 4 i
+不食烟火 3 l
+不食马肝 3 l
+不饥不寒 3 i
+不饮盗泉 3 i
+不饱和 146 nz
+不驯服 3 z
+不骄不躁 6 i
+不骄不馁 3 i
+不骗你 3 n
+不高不低 3 i
+不高不矮 3 n
+不高兴地 3 z
+不鸣则已 5 l
+不齐 105 d
+不齿 84 n
+不齿于人 3 i
+不龟手药 3 n
+与 160984 p
+与世俯仰 3 l
+与世偃仰 3 vn
+与世推移 3 i
+与世无争 56 i
+与世沉浮 3 i
+与世浮沉 3 i
+与世长辞 22 i
+与世隔绝 148 l
+与世隔膜 3 n
+与人为善 46 i
+与人方便 3 l
+与人无争 8 i
+与众不同 409 i
+与众同乐 3 i
+与会 944 v
+与会人士 3 l
+与会代表 3 l
+与会同志 3 l
+与会国 9 l
+与会者 288 n
+与你何干 3 l
+与你同在 3 l
+与其 2523 c
+与其说 63 c
+与其说是 3 c
+与受同科 3 i
+与否 456 v
+与子偕老 3 i
+与己无关 3 i
+与我何干 3 l
+与我无关 3 i
+与或门 3 l
+与日俱增 90 i
+与日而增 3 i
+与时俱进 120 l
+与时偕行 3 i
+与时并进 2 l
+与时推移 3 i
+与时消息 3 i
+与此 3 c
+与此一道 3 l
+与此同时 2287 c
+与此无关 3 l
+与此有关 3 l
+与此相关 3 l
+与此相反 3 c
+与民争利 4 l
+与民同乐 3 i
+与民更始 10 i
+与民除害 3 l
+与水化合 3 i
+与物无竞 3 l
+与狐谋皮 3 i
+与狼共舞 3 i
+与生俱来 72 l
+与虎添翼 3 i
+与虎谋皮 11 i
+与那国岛 18 ns
+与非 213 c
+与非门 3 l
+与鬼为邻 3 i
+丐 899 g
+丐养 3 n
+丐帮 1555 n
+丑 1462 a
+丑丑 3 n
+丑丫头 3 n
+丑事 98 n
+丑儿 3 n
+丑八怪 81 i
+丑剧 15 n
+丑化 42 n
+丑名 3 a
+丑声四溢 3 i
+丑声远播 3 l
+丑女 30 n
+丑妹 3 n
+丑婆子 3 n
+丑小鸭 13 n
+丑态 41 n
+丑态毕露 2 i
+丑态百出 15 i
+丑怪 3 a
+丑恶 225 a
+丑恶嘴脸 3 i
+丑恶报文 3 i
+丑旦 3 n
+丑时 3 t
+丑星 2 n
+丑样 3 n
+丑死 3 n
+丑牛 5 n
+丑男 3 n
+丑相 4 n
+丑类 13 n
+丑类恶物 3 l
+丑脸 3 n
+丑脸汉子 3 n
+丑行 42 n
+丑表功 3 n
+丑角 37 n
+丑话 25 n
+丑语 3 n
+丑闻 182 n
+丑陋 368 a
+丒 2 zg
+专 4975 n
+专一 138 b
+专一不移 3 i
+专一性 51 b
+专上 3 d
+专上程度 3 n
+专业 16214 n
+专业书 14 n
+专业书籍 3 n
+专业人士 3 n
+专业人才 3 n
+专业分工 3 n
+专业化 362 n
+专业厂 2 n
+专业名词 3 n
+专业型 6 n
+专业培训 3 n
+专业学位 3 n
+专业对口 42 n
+专业展 3 vn
+专业性 167 n
+专业户 49 n
+专业技能 3 n
+专业本科 3 n
+专业术语 3 n
+专业村 15 n
+专业版 8 n
+专业班 4 n
+专业界 2 n
+专业知识 3 n
+专业科目 3 n
+专业级 3 n
+专业组 12 n
+专业翻译 3 l
+专业英语 3 n
+专业训练 3 n
+专业词库 3 n
+专业课 193 n
+专业课程 3 n
+专业部 5 n
+专业银行 3 n
+专业队 5 n
+专业队伍 3 n
+专业音响 3 n
+专为 3 d
+专书 3 n
+专事 98 n
+专于 3 d
+专人 237 n
+专任 411 n
+专任教师 3 n
+专使 26 n
+专供 3 v
+专修 34 vn
+专修班 9 n
+专修科 19 nz
+专修科目 3 n
+专储粮 3 n
+专兼职 3 l
+专函 3 n
+专刊 40 n
+专列 136 b
+专利 1171 n
+专利产品 3 n
+专利公报 3 n
+专利制度 3 n
+专利发明 3 n
+专利号 4 n
+专利品 3 n
+专利审查 3 n
+专利局 24 n
+专利技术 3 n
+专利权 113 n
+专利权人 14 n
+专利法 20 n
+专利申请 3 n
+专利税 3 n
+专利者 3 n
+专利证书 3 n
+专利费 88 n
+专制 1249 n
+专制主义 116 n
+专制制度 3 n
+专制型 4 b
+专制政体 3 n
+专制政府 3 n
+专制政治 3 n
+专制权 3 n
+专制起来 3 l
+专力 3 n
+专务 23 n
+专区 942 n
+专升本 3 n
+专卖 213 v
+专卖品 3 n
+专卖局 9 n
+专卖店 156 n
+专卖权 9 n
+专卖柜 3 n
+专卖网 3 n
+专发 3 d
+专史 3 n
+专号 16 n
+专司 157 n
+专名 24 n
+专名号 2 n
+专向 8 n
+专员 255 n
+专员公署 16 n
+专员办 5 n
+专命 3 n
+专唱 3 n
+专在 3 d
+专场 316 n
+专士 3 n
+专委会 2 n
+专守 34 n
+专宠 3 vn
+专家 11094 n
+专家号 8 n
+专家团 3 n
+专家型 8 b
+专家学者 3 n
+专家局 2 n
+专家库 2 n
+专家建议 3 l
+专家教授 3 n
+专家系统 71 l
+专家级 4 b
+专家组 126 n
+专家经 5 b
+专家论证 3 n
+专家门诊 3 n
+专属 173 n
+专属性 2 n
+专属经济 3 n
+专属经济区 110 n
+专差 3 n
+专席 3 n
+专干 33 n
+专库 3 n
+专座 4 n
+专往 3 d
+专征 3 n
+专心 436 n
+专心一志 3 i
+专心一意 3 i
+专心向公 3 n
+专心致志 107 i
+专心诚意 3 i
+专恣 3 i
+专情 3 n
+专户 19 n
+专才 44 n
+专打 3 n
+专找 3 v
+专报 3 n
+专拜 3 n
+专拣 3 v
+专指 3 n
+专控 3 vn
+专摆 3 n
+专擅 38 v
+专收 3 n
+专攻 111 vn
+专政 1154 n
+专政对象 3 n
+专政机关 3 n
+专教 3 n
+专文 11 n
+专断 88 d
+专有 92 b
+专有名称 2 n
+专有名词 8 i
+专有权 16 n
+专有物 2 n
+专机 189 n
+专杀 3 v
+专权 240 n
+专权恣肆 3 i
+专来 3 d
+专柜 52 n
+专柜小姐 3 n
+专栏 224 n
+专栏作家 3 n
+专校 3 n
+专案 44 n
+专案处理 3 n
+专案小组 3 n
+专案工作 3 n
+专案组 176 n
+专横 108 v
+专横跋扈 152 i
+专欲难成 3 i
+专款 107 n
+专款专用 3 l
+专此 3 d
+专治 3 n
+专注 416 v
+专版 38 n
+专用 1013 n
+专用化 4 n
+专用发票 3 n
+专用名词 3 n
+专用品 3 n
+专用地图 3 n
+专用型 23 n
+专用基金 3 n
+专用工具 3 n
+专用性 5 n
+专用机 3 n
+专用权 3 n
+专用汽车 3 n
+专用版 3 n
+专用程序 3 n
+专用章 15 n
+专用箱 3 n
+专用纸 3 n
+专用线 43 n
+专用线路 3 n
+专用网 2 n
+专用肥 3 n
+专用设备 3 n
+专用词 3 n
+专用贴 3 n
+专用车 13 n
+专用车辆 3 n
+专用道 6 n
+专电 320 n
+专着 3 v
+专科 1034 n
+专科专业 3 l
+专科医生 3 nz
+专科医院 3 nz
+专科学校 647 l
+专科学院 3 l
+专科毕业 3 n
+专科生 58 n
+专科门诊 3 n
+专租 3 n
+专程 280 n
+专程到 3 l
+专程前往 3 l
+专程去 3 l
+专程来 3 l
+专稿 57 n
+专章 9 n
+专管 201 n
+专管员 4 n
+专类 7 n
+专类花园 3 n
+专精 3 n
+专精于 3 n
+专线 1175 n
+专线接入 3 n
+专线电话 3 n
+专线车 7 n
+专经 3 d
+专网 5 n
+专署 31 n
+专美 2 nz
+专美于前 3 l
+专而精 3 l
+专职 404 n
+专职人员 3 n
+专职干部 3 n
+专营 102 b
+专营店 14 n
+专营权 14 n
+专著 572 n
+专要 3 b
+专讯 3 n
+专论 32 n
+专设 3 vn
+专访 193 v
+专诚 33 a
+专责 59 n
+专车 80 n
+专车接送 3 n
+专辑 125 n
+专辑名称 3 n
+专辑语言 3 n
+专送 3 v
+专递 3 v
+专销 3 vn
+专长 191 n
+专门 8512 n
+专门人才 3 n
+专门从事 3 l
+专门利人 5 n
+专门化 54 n
+专门家 6 n
+专门店 3 n
+专门性 33 n
+专门术语 3 n
+专门机构 3 n
+专门班子 3 n
+专门知识 3 l
+专门组 3 n
+专门词汇 3 n
+专门调查 3 l
+专集 59 n
+专项 837 n
+专项合同 3 l
+专项基金 3 n
+专项斗争 3 nz
+专项经费 3 n
+专项规划 3 l
+专项资金 3 n
+专题 2367 n
+专题会议 3 n
+专题剧场 3 n
+专题史 2 n
+专题地图 3 n
+专题学习 3 n
+专题性 8 n
+专题技术 3 n
+专题报告 3 n
+专题报道 3 n
+专题片 28 n
+专题研究 3 n
+专题研讨 3 n
+专题组 2 n
+专题讨论 15 n
+专题讲座 3 n
+专题论文 3 n
+专题评测 3 i
+专馆 3 n
+且 10470 zg
+且不论 32 c
+且不说 173 l
+且为 3 c
+且住为佳 3 l
+且慢 332 l
+且战且退 29 l
+且末 39 c
+且末县 8 ns
+且末城 3 ns
+且莫 3 ns
+且说 647 c
+丕 147 g
+世 6523 n
+世上 1877 s
+世上无难事 8 l
+世世 3 n
+世世代代 163 n
+世业 5 n
+世丹 4 n
+世事 421 n
+世事变迁 3 i
+世事多变 3 l
+世事难料 3 l
+世交 63 n
+世亲 37 n
+世人 1201 n
+世仇 36 n
+世仕 3 n
+世代 522 t
+世代书香 3 n
+世代交替 63 nz
+世代相传 340 l
+世代相沿 3 n
+世仪 2 n
+世传 3 n
+世伪知贤 3 l
+世伯 16 n
+世侄 3 n
+世侯 2 n
+世俗 567 n
+世俗主义 4 n
+世俗之见 3 l
+世俗化 33 n
+世俗性 8 n
+世俗社会 3 n
+世修行 12 n
+世兄 66 n
+世兵 6 n
+世冰川 2 nr
+世务 19 n
+世医 15 n
+世博 48 nr
+世博会 99 n
+世博园 37 nr
+世卫 12 n
+世友 2 n
+世叔 18 n
+世变 3 n
+世园 15 n
+世处 3 n
+世外 48 s
+世外桃源 72 n
+世太平 2 nr
+世妇会 2 nt
+世子 148 n
+世孙 50 n
+世宗 169 n
+世实 5 n
+世家 466 n
+世家子弟 3 n
+世宽 11 n
+世尊 3 n
+世尘 3 n
+世局 4 n
+世局多变 3 l
+世居 41 n
+世异 3 n
+世异时移 3 l
+世弊 3 n
+世弟 3 n
+世德 3 n
+世态 31 n
+世态人情 3 n
+世态炎凉 26 l
+世情 61 n
+世扰俗乱 3 n
+世掌丝纶 3 n
+世故 67 n
+世敌 3 n
+世新 3 n
+世族 55 n
+世易时移 3 n
+世权 2 n
+世武 4 n
+世殊事异 3 n
+世民 3 n
+世泽 18 n
+世济其美 3 nz
+世界 34387 n
+世界一统 3 l
+世界主义 3 nz
+世界之最 3 nr
+世界之窗 14 nz
+世界人权宣言 14 l
+世界冠军 3 n
+世界化 12 nz
+世界华人 3 n
+世界博览 3 n
+世界卫生 3 nz
+世界卫生组织 173 nt
+世界反法西斯战争 172 nz
+世界史 71 n
+世界各地 652 l
+世界名牌 3 n
+世界名著 3 n
+世界和平理事会 12 nz
+世界园艺博览会 15 n
+世界围棋 3 l
+世界图书出版公司 2 nt
+世界地图 3 nz
+世界坐标 3 n
+世界大同 3 l
+世界大国 3 nt
+世界大学生运动会 12 nz
+世界大战 236 nz
+世界大赛 3 nz
+世界奇观 3 nz
+世界妇女大会 11 nt
+世界屋脊 34 n
+世界市场 199 n
+世界广论 3 nz
+世界形势 3 n
+世界性 342 n
+世界报 69 nz
+世界排名 3 l
+世界新专 3 nt
+世界旅游组织 37 nt
+世界日报 3 nz
+世界时钟 3 l
+世界末日 3 l
+世界杯 1654 nz
+世界杯赛 153 nz
+世界气象组织 12 nt
+世界潮流 3 n
+世界知识产权组织 20 nt
+世界知识出版社 5 nt
+世界秩序 3 nr
+世界粮食计划署 4 nt
+世界级 123 n
+世界纪录 190 nz
+世界舞台 3 nt
+世界观 315 nz
+世界语 27 nz
+世界贸易中心 4 nt
+世界贸易组织 84 nt
+世界资源研究所 2 nt
+世界足坛 3 n
+世界足球 3 n
+世界遗产 3 n
+世界钟 3 l
+世界银行 188 nt
+世界闻名 3 n
+世界霸权 3 n
+世界领先 3 l
+世盟 3 n
+世相 9 n
+世祖 63 n
+世系 123 n
+世系表 25 n
+世纪 21100 n
+世纪东方 3 n
+世纪之交 75 l
+世纪互联 3 j
+世纪坛 11 n
+世纪末 980 t
+世纪永联 3 nr
+世纪版 3 n
+世纪绝症 3 l
+世纪金辉 3 nr
+世纪钟 5 nr
+世翁 2 n
+世臣 3 n
+世行 71 n
+世袭 676 vn
+世袭制 30 n
+世袭领地 3 n
+世说 36 n
+世说新语 3 l
+世谊 2 n
+世豪杰 3 nr
+世贸 45 n
+世贸中心 3 nt
+世贸大楼 3 nt
+世贸组织 111 nt
+世达 2 l
+世达赖 8 l
+世运 3 n
+世运会 3 j
+世道 173 n
+世道人心 10 nt
+世道人情 3 n
+世钧道 139 nr
+世锦赛 310 nr
+世间 806 n
+世隐居 2 nr
+世雄 2 n
+世青赛 20 nr
+世面 181 n
+世风 24 n
+世风不古 3 l
+世风日下 8 l
+世风浇薄 3 i
+丗 7 zg
+丘 1257 nr
+丘万壑 2 nr
+丘义仁 3 nr
+丘之城 3 nr
+丘九儿 2 nr
+丘云岩 2 nr
+丘任娜 2 nr
+丘伦梅 2 nr
+丘八 10 n
+丘利 2 n
+丘力居 3 nr
+丘北 5 nr
+丘北县 2 ns
+丘县 3 nr
+丘县尉 2 nr
+丘吉尔 197 nr
+丘园 6 n
+丘圣僧 3 nr
+丘坛 4 n
+丘坟 3 n
+丘埃洛 2 nr
+丘基卡 4 nr
+丘基萨 4 nr
+丘墓 3 n
+丘墟 3 n
+丘壑 18 n
+丘处机 599 n
+丘大人 2 nr
+丘大会 3 nr
+丘天官 4 nr
+丘将军 2 nr
+丘屏壑 2 nr
+丘山之功 3 nr
+丘巴良 3 nr
+丘师伯 33 nr
+丘师兄 3 nr
+丘师叔 3 nr
+丘师弟 4 nr
+丘师祖 8 nr
+丘广布 2 nr
+丘慧慧 2 nr
+丘成桐 46 nr
+丘掌教 4 nr
+丘敦氏 2 nr
+丘显辉 2 nr
+丘林斯 2 nr
+丘林氏 4 nr
+丘格 5 n
+丘比丘 2 nr
+丘比特 12 nr
+丘特罗 16 nr
+丘状 2 n
+丘王诸 2 nr
+丘疹 76 n
+丘真人 24 nr
+丘祖殿 12 nr
+丘箭 3 n
+丘群望 128 nr
+丘育汕 7 nr
+丘脑 84 n
+丘赫尔 2 nr
+丘赫莱 2 nr
+丘逢甲 12 nr
+丘道 5 n
+丘道台 4 nr
+丘道长 49 n
+丘郭均 2 nr
+丘钟惠 2 nr
+丘门 2 n
+丘阿尔 2 nr
+丘陵 2477 nr
+丘陵区 120 n
+丘陵地区 3 ns
+丘陵地带 3 n
+丘陵地形 3 n
+丘雷姆 3 nr
+丘顶 3 n
+丘鹤俦 2 nr
+丙 349 n
+丙丁 11 nz
+丙丁酚 3 nz
+丙三醇 3 nz
+丙丑 3 n
+丙二酸 17 nz
+丙二醇 15 nz
+丙二醛 3 nz
+丙亥 3 m
+丙午 7 m
+丙卯 3 m
+丙咪唑 3 nz
+丙国 3 n
+丙型 17 n
+丙型肝炎 3 n
+丙基 3 nz
+丙子 12 n
+丙子年 2 n
+丙子月 2 n
+丙寅 13 m
+丙寅年 2 m
+丙寅日 5 m
+丙巳 3 m
+丙戌 5 m
+丙戌年 3 m
+丙方 3 n
+丙未 3 nz
+丙村 3 n
+丙校 3 n
+丙氨酸 21 nz
+丙炔 3 n
+丙烯 66 n
+丙烯歧化 3 n
+丙烯水合 3 nz
+丙烯画 5 n
+丙烯腈 40 n
+丙烯酮 3 nz
+丙烯酰胺 15 nz
+丙烯酸 12 nz
+丙烯酸甲酯 3 nz
+丙烯酸酯 21 nz
+丙烯醇 3 nz
+丙烯醛 3 nz
+丙烷 54 nz
+丙烷气 3 nz
+丙璜舒 3 nrt
+丙甲甘肽 3 nz
+丙申 5 nz
+丙磺舒 3 n
+丙种 3 m
+丙种射线 3 n
+丙种球蛋白 7 n
+丙稀 3 nz
+丙稀酸 3 nz
+丙等 3 m
+丙等体位 3 n
+丙级 3 n
+丙纶 23 n
+丙线 3 n
+丙肝 21 n
+丙胺 3 nz
+丙腈 3 n
+丙辰 8 n
+丙道 5 n
+丙酉 3 m
+丙酮 109 nz
+丙酮酸 29 nz
+丙酸 30 n
+丙醇 16 n
+丙醛 2 n
+丙项 3 n
+业 4553 n
+业业兢兢 3 i
+业业矜矜 3 v
+业主 345 n
+业主大会 3 n
+业主权益 3 n
+业主论坛 3 n
+业举 3 n
+业余 875 n
+业余人员 3 n
+业余大学 3 l
+业余教育 13 l
+业余时间 3 n
+业余比赛 3 n
+业余活动 3 l
+业余爱好 3 l
+业余生活 3 n
+业余组 7 n
+业余赛 2 n
+业余选手 3 n
+业余队 2 n
+业内 346 f
+业内人士 556 n
+业内外 5 f
+业别 3 n
+业力 6 n
+业务 7737 n
+业务主管 3 n
+业务人员 3 n
+业务员 129 n
+业务培训 3 n
+业务学习 3 n
+业务室 2 n
+业务局 3 n
+业务性 4 n
+业务收入 3 n
+业务楼 3 n
+业务水平 3 n
+业务流程 3 n
+业务知识 3 n
+业务科 3 n
+业务管理 33 n
+业务精 6 n
+业务素质 3 n
+业务组 3 n
+业务经理 3 n
+业务网 6 n
+业务联系 3 n
+业务范围 3 n
+业务费 2 n
+业务部 49 n
+业务部门 3 n
+业务量 42 n
+业协会 3 n
+业大 27 b
+业委会 3 n
+业峻鸿绩 3 n
+业己 3 n
+业已 472 d
+业师 21 n
+业态 45 n
+业户 23 n
+业扩 3 n
+业报 3 n
+业生 4 n
+业界 387 n
+业界事件 3 n
+业精于勤 2 n
+业经 85 n
+业绩 1992 n
+业绩考核 3 n
+业者 97 n
+业迹 3 n
+业障 12 n
+丛 897 nr
+丛一丛 4 nr
+丛丁香 2 nr
+丛不弃 3 v
+丛中 399 f
+丛书 499 n
+丛亚平 4 nr
+丛刊 68 n
+丛刻 7 n
+丛台 3 n
+丛台区 3 n
+丛和亚 2 nr
+丛团团 2 n
+丛密 5 nr
+丛密林 2 nr
+丛小草 2 nr
+丛山 10 nr
+丛山中 2 nr
+丛山之 3 nr
+丛山峻岭 2 nr
+丛峰林 2 nr
+丛式井口 3 nr
+丛情花 2 n
+丛拥幕 2 nr
+丛拥枚 2 nr
+丛木 3 nr
+丛杂 3 v
+丛林 744 nr
+丛林中 23 nr
+丛林区 4 nr
+丛林地 3 nr
+丛林地带 3 n
+丛林战 7 nr
+丛枝病 2 nr
+丛树林 3 nr
+丛毛 5 n
+丛炮 2 n
+丛牡丹 3 nr
+丛状 3 n
+丛玫瑰 9 nr
+丛珊 3 ns
+丛生 213 nr
+丛白毛 3 nr
+丛目 2 n
+丛础 3 n
+丛礁 3 n
+丛福奎 3 nr
+丛竹林 2 nr
+丛红花 4 nr
+丛翠竹 2 nr
+丛花 2 n
+丛草 3 n
+丛草坡 3 nr
+丛莽 21 nr
+丛葬 8 n
+丛蕉唷 2 nr
+丛谈 16 v
+丛轻折轴 3 n
+丛里 7 q
+丛长毛 3 nr
+丛长草 2 nr
+丛长须 3 nr
+丛雀渊鱼 3 nr
+丛集 20 n
+丛飘蓬 2 nr
+丛鹏飞 3 nr
+丛黑针 2 nr
+东 18279 ns
+东一句西 3 ns
+东一西 3 nr
+东丈 3 n
+东三环 9 nr
+东三省 123 ns
+东上 7 s
+东不压桥 3 nz
+东不拉 3 ns
+东东 41 ns
+东中西部 10 nt
+东中部 4 nt
+东丰 4 ns
+东丰县 3 ns
+东临 7 ns
+东临翁 2 nr
+东丹 8 ns
+东丹国 4 ns
+东丹王 2 nr
+东为楚 2 nr
+东主 4 n
+东主爷 6 n
+东丽 11 nr
+东丽区 3 nr
+东丽毛 2 nr
+东丽队 2 nr
+东久区 2 n
+东乌珠穆沁旗 8 ns
+东九鹏 6 nr
+东乡 72 ns
+东乡县 6 ns
+东乡族 36 nz
+东乡族自治县 6 ns
+东乡语 3 nz
+东二环 3 nr
+东五环 3 nr
+东亚 960 ns
+东亚人 15 nr
+东亚区 3 ns
+东亚各国 3 ns
+东亚国家 3 nz
+东亚地区 33 ns
+东亚银行 3 nt
+东交民巷 1042 nz
+东京 2541 ns
+东京国立博物馆 6 nt
+东京国际 3 nt
+东京城 72 ns
+东京大学 52 nt
+东京市 12 ns
+东京帝国大学 43 nt
+东京湾 26 ns
+东京证券交易所 8 nt
+东京都 40 ns
+东京银行 3 nt
+东伸入 2 nr
+东佃 3 nr
+东侧 1242 f
+东便门 5 ns
+东信 14 nz
+东倒西歪 94 i
+东偷西摸 3 i
+东元 3 t
+东光 11 n
+东光公主 2 n
+东光县 6 nr
+东兔西乌 3 nr
+东公启 2 nr
+东六宫 7 nr
+东六环 3 nr
+东兰 7 ns
+东兰县 4 ns
+东关 121 ns
+东兴 20 ns
+东兴区 3 ns
+东兴市 3 ns
+东兴镇 2 ns
+东内特 2 ns
+东冲西 2 nr
+东冲西决 3 i
+东冲西撞 3 i
+东冲西突 3 nz
+东冶 3 j
+东力 8 n
+东加 3 ns
+东加勒比元 18 ns
+东加王国 3 ns
+东劳西燕 3 nr
+东势 3 n
+东势厝 3 ns
+东北 6082 ns
+东北三省 3 ns
+东北九省 3 ns
+东北亚 95 ns
+东北亚地区 21 ns
+东北侧 139 f
+东北军 234 nt
+东北农业大学 2 nt
+东北制药集团 4 nt
+东北区 3 ns
+东北地区 492 ns
+东北大学 831 nt
+东北局 10 nt
+东北工学院 4 nt
+东北师大 3 j
+东北师范大学 18 nt
+东北方 76 f
+东北方向 3 n
+东北民主联军 61 nt
+东北站 3 ns
+东北网 3 nz
+东北菜 4 n
+东北虎 66 nr
+东北角 139 f
+东北财经 3 j
+东北财经大学 6 nt
+东北边 3 f
+东北郊 3 s
+东北部 955 f
+东北隅 10 f
+东北面 3 f
+东北风 23 nr
+东区 72 ns
+东区人 3 n
+东医寿 3 nr
+东升 553 nr
+东升镇 256 nr
+东半 3 f
+东半球 43 n
+东半边 3 ns
+东华 70 nz
+东华大学 25 nt
+东华门 255 ns
+东单 159 n
+东南 4271 ns
+东南之宝 3 nr
+东南之秀 3 nr
+东南之美 3 nz
+东南亚 1648 ns
+东南亚国 3 ns
+东南亚国家联盟 6 nt
+东南亚地区 55 ns
+东南亚虎 2 nz
+东南侧 26 f
+东南区 3 ns
+东南半壁 3 ns
+东南地区 3 ns
+东南大学 106 nt
+东南岸 3 f
+东南工专 3 nt
+东南工业 3 nt
+东南方 80 f
+东南欧 22 ns
+东南汽车 3 nt
+东南竹箭 3 nr
+东南西北 126 ns
+东南角 128 f
+东南边 3 f
+东南郊 14 ns
+东南部 1297 f
+东南雀飞 3 nr
+东南非 6 ns
+东南面 18 f
+东南风 51 nr
+东印度 3 n
+东印度群 3 n
+东厂 6 n
+东厂侦 2 nr
+东原迪 3 nr
+东厢 3 n
+东去 3 t
+东县 3 ns
+东友 2 n
+东古儿 2 nr
+东台 34 ns
+东台县 3 ns
+东台市 7 ns
+东史郎 3 nr
+东吁线 2 n
+东向 3 n
+东向北 2 nr
+东向南 6 nr
+东向西 83 nr
+东吕乡 2 nr
+东君 4 nr
+东吴 381 ns
+东吴大学 39 nt
+东吴招亲 3 nr
+东周 128 t
+东周刊 3 n
+东周时 3 n
+东周时代 3 n
+东周时期 3 n
+东哥特 38 nr
+东喀尔 7 nr
+东喀斯 3 ns
+东四 52 t
+东四十条 12 nz
+东四南大街 2 ns
+东四环 3 nr
+东园 12 ns
+东国洛 2 nr
+东圃镇 3 nr
+东圆研 2 nr
+东土 6 n
+东土唐 6 nr
+东土圣 4 ns
+东土寻 3 nr
+东土远 3 ns
+东土驾 2 nr
+东土默 2 nr
+东圣 3 ns
+东坑 2 ns
+东坑乡 3 ns
+东坑镇 3 ns
+东坝 3 ns
+东坡 437 ns
+东坡区 3 ns
+东坡肉 260 n
+东垂西 2 nr
+东垣 2 ns
+东城 593 ns
+东城区 88 ns
+东域 3 ns
+东塘 3 ns
+东境 3 s
+东墙 2 n
+东墙处子 3 n
+东壁 7 s
+东壁余光 3 n
+东声西击 3 i
+东大 65 j
+东大寺 14 ns
+东大桥 3 ns
+东大营 5 nr
+东大街 14 ns
+东大路 3 nz
+东天山 4 nr
+东太后 2 nr
+东央西告 3 n
+东头 110 s
+东夷 114 ns
+东夷化 3 ns
+东夷族 13 nr
+东夷校 3 nr
+东奔西 2 ns
+东奔西撞 3 i
+东奔西窜 7 i
+东奔西走 24 i
+东奔西跑 20 ns
+东奔西逃 5 i
+东姊儿 2 nr
+东子 9 n
+东学党 7 nt
+东宁 7 ns
+东宁县 4 ns
+东安 175 ns
+东安动力 2 n
+东安区 3 ns
+东安县 3 ns
+东安市场 12 ns
+东安门 282 ns
+东安门大街 3 ns
+东宋镇 3 nr
+东完西缺 3 l
+东宗掌 3 nr
+东宗西 4 nr
+东官郡 3 nr
+东宝 9 nr
+东宝区 258 ns
+东宫 281 ns
+东宫太子 3 nr
+东宫门 10 ns
+东家 222 n
+东家效颦 3 i
+东家西舍 3 ns
+东宽西 2 nr
+东富 3 nz
+东察合 6 n
+东寨 9 ns
+东寨港 16 ns
+东寺 3 ns
+东寻西 3 nr
+东寻西觅 3 nr
+东山 141 ns
+东山之志 3 nr
+东山乡 3 ns
+东山再起 90 i
+东山区 8 ns
+东山县 12 ns
+东山复起 3 i
+东山岛 13 ns
+东山岭 4 ns
+东山镇 5 ns
+东山高卧 3 nr
+东岛 20 ns
+东岭 7 ns
+东岳 807 nr
+东岳庙 29 nr
+东岳泰山 3 ns
+东岸 522 s
+东峰 20 ns
+东峰林 2 nr
+东崖 3 ns
+东川 91 ns
+东川区 3 ns
+东川市 7 ns
+东川路 3 ns
+东州 332 ns
+东州修 3 nr
+东州城 2 ns
+东州建 2 ns
+东差西误 3 n
+东巴 81 ns
+东巴文 9 nr
+东巴文化 3 ns
+东市 3 ns
+东市区 22 ns
+东市朝衣 3 nr
+东布罗夫斯基 3 nrt
+东帝汶 48 nr
+东干久 3 nr
+东平 130 ns
+东平县 13 ns
+东平湖 22 ns
+东平路 3 ns
+东庄 14 ns
+东床 10 nz
+东床之选 3 i
+东床佳婿 3 i
+东床坦腹 3 n
+东床姣婿 3 v
+东床娇婿 3 i
+东床娇客 3 i
+东床快婿 3 i
+东床择对 3 i
+东府 15 n
+东府珍 3 nr
+东府里 3 ns
+东廊 3 n
+东建 4 ns
+东引 3 nr
+东引岛 4 nr
+东张西 2 nr
+东张西张 3 nr
+东张西望 124 nr
+东张西觑 3 i
+东影 2 n
+东征 417 n
+东征中 2 nr
+东征之 2 nr
+东征事 2 n
+东征军 9 nr
+东征刘 2 nr
+东征吴 7 nr
+东征山 2 nr
+东征幽 6 nr
+东征御 3 nr
+东征苏 2 nr
+东征西 12 nr
+东征西怨 3 i
+东征西讨 20 i
+东征金 2 n
+东徙西迁 3 i
+东德 71 nr
+东德人 3 nr
+东怒西怨 3 i
+东思西 3 nr
+东怨西怒 3 i
+东戈壁省 2 ns
+东成西就 3 i
+东扬西荡 3 ns
+东扭西捏 3 i
+东扯西拉 4 l
+东扯西拽 3 l
+东扶西倒 3 i
+东抄西袭 3 n
+东投西窜 3 i
+东抹西涂 3 i
+东拉河 114 ns
+东拉西扯 64 l
+东拦西阻 3 nr
+东拼西凑 12 i
+东指 3 j
+东挦西扯 3 v
+东挦西撦 3 v
+东挨西撞 3 i
+东挪西借 2 i
+东挪西凑 3 nr
+东挪西撮 3 nr
+东捞西摸 3 i
+东捱西问 3 v
+东捻军 3 n
+东接 3 b
+东掩西遮 3 i
+东搜西罗 3 nr
+东摇西摆 3 i
+东撙西节 3 v
+东播西流 3 n
+东支 3 n
+东支西吾 3 ns
+东敲西敲 3 l
+东敲西逼 3 i
+东斯 5 ns
+东斯拉沃尼亚 3 ns
+东斯科 2 nz
+东新路 3 nz
+东方 3993 s
+东方不亮西方亮 6 l
+东方不败 3 l
+东方中学 3 nt
+东方之珠 3 nr
+东方人 57 nr
+东方仗助 3 i
+东方公司 4 nt
+东方军事 3 nt
+东方出版社 2 nt
+东方化 2 nr
+东方千骑 3 nr
+东方卫 2 nr
+东方发白 3 nr
+东方号 18 n
+东方君 3 nr
+东方城 3 nr
+东方夜谭 3 i
+东方女性 3 n
+东方学 35 nt
+东方学家 13 n
+东方宾馆 4 nt
+东方将白 3 nr
+东方工专 3 nt
+东方广场 5 ns
+东方式 6 n
+东方影都 3 n
+东方快车 3 nt
+东方文化 3 nz
+东方日报 3 nz
+东方时空 3 nr
+东方明珠 26 nr
+东方朔 25 nr
+东方未曙 3 nr
+东方歌舞团 8 nt
+东方汽轮机厂 2 nt
+东方玉 3 nr
+东方电子 2 nz
+东方电机 5 nz
+东方电机厂 2 nt
+东方省 7 ns
+东方红 112 nr
+东方红一号 2 nz
+东方网 35 nz
+东方网景 3 n
+东方美女 3 nr
+东方老爷 2 nr
+东方耳 4 nr
+东方航空 10 nt
+东方航空公司 14 nt
+东方艺术 3 n
+东方花园 2 ns
+东方财经 3 l
+东方路 3 nr
+东方通信 8 nt
+东方闻樱 3 nr
+东方队 6 nt
+东方集团 9 nt
+东方龙 3 nr
+东施 38 n
+东施效颦 14 i
+东昌 25 ns
+东昌区 3 ns
+东昌府 12 nr
+东昌府区 2 ns
+东昌路 4 ns
+东明 5 nr
+东明县 5 ns
+东明路 3 nr
+东昏侯 5 nr
+东星 13 nz
+东映 2 v
+东晋 676 t
+东晋时 3 nr
+东晋时代 3 nr
+东晋时期 3 nr
+东普鲁 4 nr
+东暖阁 163 nr
+东曦既驾 3 nr
+东有 3 b
+东望西观 3 nr
+东朝西 130 nr
+东木 2 ns
+东木公 5 nr
+东村 17 ns
+东条 29 n
+东条英机 40 n
+东来 141 t
+东来西去 3 i
+东来顺 32 nr
+东林 187 ns
+东林党 361 nt
+东林列 2 ns
+东林寺 11 nr
+东林派 55 nr
+东林西 2 ns
+东林诸 8 nr
+东柏坡 2 ns
+东柏林 18 nr
+东查西 2 ns
+东校区 2 n
+东桥 3 ns
+东楼 5 ns
+东横西倒 3 i
+东欧 726 ns
+东欧各国 3 ns
+东欧国家 3 n
+东欧地区 5 ns
+东欧平原 3 ns
+东歌 5 n
+东正教 203 nz
+东武城 6 ns
+东歪西倒 5 i
+东段 188 n
+东比利 2 ns
+东水关 3 ns
+东水西 2 ns
+东汉 2005 t
+东汉时代 3 nr
+东汉时期 3 nz
+东江 174 ns
+东江纵队 3 nt
+东江镇 4 ns
+东汽 3 j
+东汽一中 3 nz
+东沙 11 ns
+东沙岛 14 ns
+东沙河 2 ns
+东沙礁 4 ns
+东沙群岛 3 ns
+东沟 23 ns
+东沟县 3 ns
+东河 21 ns
+东河区 6 ns
+东河塘 3 ns
+东沿淮 2 nr
+东法兰 6 ns
+东波美 2 ns
+东洋 187 ns
+东洋人 16 n
+东洋兰 3 ns
+东洋刀 3 n
+东洋味 3 nz
+东洋大海 3 ns
+东洋界 3 n
+东洋车 7 n
+东洲 3 ns
+东洲区 3 ns
+东流 3 n
+东流纳 2 ns
+东流西上 3 ns
+东流西窜 3 i
+东流西落 3 ns
+东流贯 7 nr
+东海 923 ns
+东海县 14 ns
+东海大学 3 nt
+东海岛 3 ns
+东海岸 176 s
+东海广场 3 ns
+东海扬尘 3 nr
+东海捞针 3 i
+东海水晶 3 nr
+东海电脑 3 nt
+东海舰队 133 nt
+东海路 3 ns
+东海逝波 3 v
+东海道 20 ns
+东海郡 11 nr
+东海鲸波 3 nr
+东海龙王 12 nz
+东涂西抹 3 i
+东渡 117 ns
+东渡港 3 ns
+东渡路 3 ns
+东港 15 ns
+东港区 3 ns
+东港市 5 ns
+东游 3 f
+东游西 2 ns
+东游西荡 10 ns
+东游西逛 5 i
+东游记 3 n
+东湖 1866 ns
+东湖区 3 ns
+东湖国小 3 j
+东湖开发区 258 nt
+东湖新技术开发区 256 nt
+东湖路 3 ns
+东湖高新技术开发区 256 nt
+东湾 2 ns
+东源 10 n
+东源县 2 ns
+东溪 8 ns
+东溪村 13 nr
+东滚西爬 3 i
+东滨波 2 ns
+东滩 12 ns
+东滩矿 5 nz
+东潞州 3 nr
+东澳岭 2 ns
+东濒亚 2 nr
+东瀛 18 nr
+东灵山 2 nr
+东灵道 2 nr
+东烂西 3 nr
+东照 4 n
+东照宫 2 nr
+东照誓 2 nr
+东牟侯 4 nr
+东牟山 2 ns
+东犯 4 n
+东猎西渔 3 nr
+东猜西疑 3 i
+东王公 7 nr
+东环路 3 nz
+东瓜 5 ns
+东瓦窑 3 nr
+东瓯 21 ns
+东田 3 ns
+东界博 2 nz
+东白山 2 ns
+东皇太 3 nr
+东皋 4 ns
+东益 2 n
+东益地 2 n
+东盛 30 nz
+东盛科技 7 nz
+东盟 264 j
+东盟国家 3 n
+东盟自由贸易区 2 nt
+东直 5 j
+东直门 44 ns
+东看西看 3 l
+东真国 4 ns
+东睃西望 3 v
+东瞧西望 3 v
+东瞧西瞧 3 v
+东石 3 nr
+东碰西撞 3 l
+东磁 3 n
+东磕西撞 3 l
+东福克 4 nr
+东科迪 13 nr
+东科迪勒 9 nz
+东移 77 n
+东穿西撞 3 i
+东突 20 nz
+东突厥 3 n
+东窗事发 16 i
+东窗事犯 3 i
+东窗消息 3 i
+东窗计 3 i
+东窗跃 2 nr
+东站 159 n
+东端 112 f
+东笋 3 n
+东箭南金 3 n
+东篱 14 ns
+东米德 2 nr
+东线 153 n
+东经 1271 n
+东缘 27 n
+东群 2 ns
+东群沙 2 ns
+东羲既驾 3 nr
+东翻西 4 nr
+东翼 2 n
+东耶路撒冷 10 ns
+东聊 3 v
+东联 8 ns
+东胜 63 nr
+东胜区 2 n
+东胜市 7 ns
+东胡 20 nr
+东胡族 5 nr
+东胡林 2 nr
+东至 284 ns
+东至县 3 nr
+东至西 4 nr
+东至郭 2 nr
+东航 72 j
+东色雷 4 nr
+东色雷斯 4 ns
+东芝 104 nz
+东芝公司 43 nt
+东苏丹 3 ns
+东荆河 9 ns
+东荡西除 3 i
+东荡西驰 3 i
+东药集团 3 nt
+东莞 275 ns
+东莞县 9 ns
+东莞市 55 ns
+东莨菪碱 14 n
+东莱 39 ns
+东莱街 6 ns
+东营 25 ns
+东营区 4 n
+东营市 18 n
+东萨哈 2 ns
+东萨彦 4 nr
+东萨摩亚 12 ns
+东藏西躲 4 nr
+东虹 2 nz
+东行 3 j
+东街 160 ns
+东街口 15 ns
+东街村 5 ns
+东补西凑 3 nr
+东西 18877 ns
+东西南北 96 ns
+东西南北中 9 ns
+东西南朔 3 ns
+东西向 130 f
+东西方 280 f
+东西易面 3 n
+东西欧 6 ns
+东西洋 2 ns
+东西湖区 259 ns
+东西连 8 ns
+东西部 63 f
+东西长 29 nr
+东西魏 2 nr
+东观之殃 3 n
+东观汉 8 ns
+东观续史 3 n
+东观西 3 ns
+东观西望 3 ns
+东角 3 f
+东讨西伐 3 n
+东讨西征 3 n
+东诓西骗 3 v
+东谈西说 3 n
+东谷 9 ns
+东豆川 2 nr
+东豫州 2 ns
+东购 3 v
+东走西撞 3 i
+东走西顾 2 i
+东起 120 s
+东起海 17 nr
+东趋西步 3 l
+东跃西 2 nr
+东跑西颠 8 ns
+东路 447 ns
+东路兵 2 nr
+东路军 69 nr
+东踅西倒 3 v
+东躲西藏 22 l
+东躲西跑 3 l
+东软 6 j
+东辛房 3 nr
+东边 819 s
+东边儿 2 nr
+东辽 3 ns
+东辽县 3 ns
+东迁西徙 3 n
+东进东 2 nr
+东连吴 258 ns
+东逃西散 3 j
+东逃西窜 3 i
+东道 314 n
+东道主 151 nr
+东道主人 3 n
+东道之谊 3 nr
+东道国 41 ns
+东遮西掩 3 i
+东邦 3 ns
+东邪西毒 3 i
+东邻西舍 2 i
+东郊 154 s
+东郡韦 3 nr
+东部 5551 f
+东郭 23 nr
+东郭先生 12 nr
+东都 3 ns
+东里 9 s
+东野 4 ns
+东野巴人 3 n
+东野败驾 3 nr
+东量西折 3 n
+东钱湖 6 ns
+东长安 4 nr
+东长安街 397 ns
+东门 409 ns
+东门国小 3 nt
+东门城 2 ns
+东门外 63 s
+东门寨 2 ns
+东门屿 3 ns
+东门市场 3 ns
+东门礁 3 ns
+东门路 3 ns
+东门逐兔 3 i
+东门黄犬 3 n
+东闪西 5 nr
+东闪西挪 3 i
+东闪西躲 3 nr
+东问西 4 nr
+东闯西走 3 nr
+东闾氏 4 nr
+东阳 60 ns
+东阳县 3 ns
+东阳市 5 ns
+东阳镇 6 ns
+东阿 43 ns
+东阿南 2 ns
+东阿县 7 ns
+东院 2 n
+东陵 25 ns
+东陵区 3 ns
+东隅已逝 3 i
+东雍州 2 ns
+东零西散 3 i
+东零西碎 3 i
+东零西落 3 i
+东霍尔 2 nr
+东静静 2 nr
+东非 311 ns
+东非各国 3 ns
+东非国家 3 l
+东非地区 7 ns
+东非大裂谷 56 nt
+东面 438 f
+东顺城街 3 ns
+东风 1075 n
+东风人面 3 n
+东风入律 3 n
+东风公司 2 n
+东风剧场 3 n
+东风化雨 3 nz
+东风区 3 ns
+东风压倒西风 6 i
+东风忘 3 i
+东风悦达 3 i
+东风教育 3 l
+东风村 9 nr
+东风汽车 3 n
+东风汽车公司 263 nt
+东风浩荡 3 i
+东风热线 3 n
+东风牌 3 n
+东风电信 3 nz
+东风破 3 nr
+东风论坛 3 n
+东风路 3 nz
+东风过耳 3 i
+东风通信 3 nz
+东风里 2 s
+东风镇 2 ns
+东风马耳 3 i
+东飘西徙 3 v
+东飘西泊 3 nr
+东飘西荡 2 i
+东飞西 2 nr
+东食西宿 3 l
+东首 8 f
+东首椅 2 nr
+东马 12 ns
+东驰西击 3 i
+东驰西撞 3 i
+东驰西骋 3 i
+东高西 2 ns
+东魏 184 t
+东鱼河 2 ns
+东鳞西爪 3 i
+东鸡儿 5 nr
+东鸣西应 3 ns
+东麓 54 f
+东麓南 2 nr
+东龙 2 ns
+丝 2807 m
+丝丝 3 m
+丝丝入扣 31 i
+丝丝缕缕 27 z
+丝光 27 n
+丝光处理 3 l
+丝光棉 3 n
+丝兰 3 nz
+丝包线 3 n
+丝印 3 n
+丝印机 3 n
+丝厂 24 n
+丝发之功 3 l
+丝图腾 3 i
+丝巾 30 n
+丝布 3 n
+丝帕 3 n
+丝带 61 n
+丝弦 30 n
+丝恩发怨 3 i
+丝挂子 3 l
+丝料 3 n
+丝束 3 m
+丝杠 7 n
+丝来线去 3 l
+丝板 3 n
+丝极 3 n
+丝棉 20 n
+丝毫 2603 m
+丝毫不少 3 l
+丝毫不差 3 l
+丝毫不爽 3 i
+丝毫无损 3 l
+丝毯 24 n
+丝氨酸 5 nz
+丝状 122 n
+丝瓜 37 n
+丝瓜布 3 nrt
+丝瓜络 2 n
+丝瓜藤 3 nz
+丝竹 107 n
+丝竹空 3 n
+丝竹管弦 5 n
+丝米 3 m
+丝糕 2 n
+丝素 3 n
+丝纺 7 b
+丝线 164 n
+丝织 118 n
+丝织业 72 n
+丝织厂 13 n
+丝织品 127 n
+丝织版 3 n
+丝织物 42 n
+丝绒 48 n
+丝绒布 3 n
+丝结 3 n
+丝绘 3 n
+丝绢 26 nrt
+丝绳 31 n
+丝绵 21 z
+丝绵被 3 n
+丝绸 413 n
+丝绸业 6 l
+丝绸之路 285 l
+丝绸厂 3 n
+丝绸品 3 l
+丝绸服装 3 l
+丝绸版 2 l
+丝绸面料 3 l
+丝缕 3 m
+丝网 31 nz
+丝胶 3 n
+丝萝 3 n
+丝蒂 4 nrt
+丝虫 19 n
+丝虫病 26 n
+丝蝇 3 n
+丝衣 3 n
+丝袜 29 n
+丝袜图 3 n
+丝袜美女 3 n
+丝袜美腿 3 n
+丝裂原 3 n
+丝裂霉素 3 n
+丝质 14 n
+丝质体 3 n
+丝路 77 n
+丝路之旅 3 n
+丝路花雨 5 l
+丝都 11 n
+丝锥 6 nz
+丝麻 8 n
+丞 645 n
+丞相 1320 n
+丟 4 zg
+丟了 3 y
+丟档 3 vn
+丟車保帅 3 nz
+丢 2859 zg
+丢三忘四 3 i
+丢三拉四 2 nr
+丢三落四 8 i
+丢上去 3 v
+丢上来 3 l
+丢下 354 v
+丢下不管 3 l
+丢下去 3 l
+丢下来 3 l
+丢丑 12 v
+丢乌纱帽 3 nr
+丢了棒 3 i
+丢人 188 v
+丢人现眼 49 l
+丢份儿 3 l
+丢入 3 v
+丢分 3 v
+丢到 3 v
+丢卒保车 8 i
+丢却 3 v
+丢去 3 v
+丢在脑后 3 l
+丢失 437 v
+丢官 26 v
+丢开 86 v
+丢弃 146 v
+丢手 16 v
+丢手不管 3 l
+丢掉 340 v
+丢掷 3 v
+丢盔卸甲 6 i
+丢盔弃甲 12 i
+丢盔抛甲 3 v
+丢眼色 2 l
+丢置 3 v
+丢置不管 3 l
+丢脸 184 v
+丢词 3 v
+丢起 3 v
+丢起来 3 l
+丢钱 3 v
+丢面 3 v
+丢面子 29 l
+丢饭碗 6 l
+丢魂丢魄 3 nr
+丢魂丧胆 3 i
+丢魂失魄 3 i
+丢魂落魄 3 i
+两 43011 m
+两一 4 m
+两万 258 m
+两万七八千 3 m
+两万万两 3 m
+两万三千 3 m
+两万三千户 2 m
+两万两 7 m
+两万个 2 m
+两万二 2 m
+两万二千九百三十七卷 2 m
+两万二千八百七十七卷 2 m
+两万二千米 2 m
+两万五 4 m
+两万五千 7 m
+两万五千余 2 m
+两万五千六百七十八吨 2 m
+两万五千名 2 m
+两万五千里 2 m
+两万五千里长征 7 i
+两万人 3 i
+两万人次 2 m
+两万件 2 m
+两万份 2 m
+两万余 84 m
+两万余册 2 m
+两万余名 4 m
+两万余户 2 m
+两万余里 2 m
+两万元 34 m
+两万八千 2 m
+两万八千余 2 m
+两万八千多 2 m
+两万六千 2 m
+两万名 19 m
+两万四千 12 m
+两万四千一百 2 m
+两万四千余吨 2 m
+两万块 32 m
+两万多 50 m
+两万多两 2 m
+两万多个 3 m
+两万多元 7 m
+两万多名 3 m
+两万多块 5 m
+两万多平方公里 2 m
+两万多支 2 m
+两万家 2 m
+两万左右 3 m
+两万平方米 5 m
+两万户 3 m
+两万斤 7 m
+两万枚 2 m
+两万步 2 m
+两万片 2 m
+两万篇 2 m
+两万里 5 m
+两万顷 8 m
+两丈 93 m
+两三 91 m
+两三万 48 m
+两三万元 2 m
+两三丈 20 m
+两三下 5 m
+两三个 293 m
+两三代 3 m
+两三件 6 m
+两三份 2 m
+两三位 6 m
+两三倍 10 m
+两三公里 5 m
+两三分 2 m
+两三分钟 14 m
+两三匹 6 m
+两三千 38 m
+两三千元 11 m
+两三千名 2 m
+两三千吨 3 m
+两三千年 4 m
+两三千户 5 m
+两三千里 2 m
+两三口 4 m
+两三句 12 m
+两三只 5 m
+两三号 2 m
+两三名 3 m
+两三回 5 m
+两三圈 2 m
+两三场 7 m
+两三声 8 m
+两三处 6 m
+两三天 178 m
+两三家 13 m
+两三寸 6 m
+两三封 2 m
+两三尺 8 m
+两三层 7 m
+两三岁 22 m
+两三年 202 m
+两三座 3 m
+两三张 3 m
+两三成 10 m
+两三截儿 2 m
+两三户 4 m
+两三招 10 m
+两三支 3 m
+两三斤 2 m
+两三日 22 m
+两三条 6 m
+两三杯 3 m
+两三枚 4 m
+两三株 2 m
+两三样 3 m
+两三根 4 m
+两三棵 2 m
+两三次 25 m
+两三步 19 m
+两三点 19 m
+两三片 3 m
+两三百 23 m
+两三百元 8 m
+两三百名 7 m
+两三百年 7 m
+两三百文 2 m
+两三百里 3 m
+两三盏 2 m
+两三碗 3 m
+两三种 8 m
+两三篇 2 m
+两三米 10 m
+两三粒 3 m
+两三缕 2 m
+两三股 3 m
+两三行 2 m
+两三起 2 m
+两三遍 12 m
+两三里 30 m
+两三颗 2 m
+两下 659 m
+两下子 39 m
+两不找 3 v
+两不相干 3 l
+两不误 3 l
+两世为人 3 i
+两两 30 m
+两两三三 3 m
+两两成 4 m
+两两艘 2 m
+两个 28947 m
+两个凡是 267 l
+两个转变 3 l
+两串 41 m
+两九 2 m
+两二个 2 m
+两亩 17 m
+两亲性 3 n
+两人份 3 m
+两亿 14 m
+两亿一千五百五十四万元 2 m
+两亿七千万 2 m
+两亿两 2 m
+两亿九千余万两 2 m
+两亿五千万法郎 2 m
+两亿人 3 l
+两亿八千八百二十二万两 2 m
+两亿六千万余 2 m
+两亿多年 4 m
+两亿年 4 m
+两代 1630 m
+两仪 3 n
+两件 729 m
+两件事 3 n
+两件套 3 l
+两任 23 m
+两份 233 m
+两伊 71 m
+两伙 4 m
+两会 511 m
+两位 3673 m
+两位数 3 n
+两例 10 m
+两侧 4863 f
+两倍 255 m
+两元 31 m
+两克 3 m
+两党关系 3 n
+两党制 18 n
+两全 30 n
+两全其美 65 i
+两公里 12 m
+两具 131 m
+两册 15 m
+两军人马 3 ns
+两刀 65 m
+两分 152 m
+两分法 2 n
+两分钟 82 m
+两列 244 m
+两则 24 m
+两剂 3 n
+两副 45 m
+两勺 6 m
+两包 45 m
+两匹 239 m
+两匹马 3 nz
+两千 242 m
+两千一百万 3 m
+两千一百余年 2 m
+两千七百七十二尺 2 m
+两千万 12 m
+两千万两 4 m
+两千万元 13 m
+两千三千 6 m
+两千三百余万 2 m
+两千三百四十六万 2 m
+两千三百多年 2 m
+两千两 28 m
+两千个 3 m
+两千五百 9 m
+两千五百万英镑 3 m
+两千五百多年 2 m
+两千五百文 2 m
+两千人 3 i
+两千余 28 m
+两千余卷 2 m
+两千余名 4 m
+两千余处 2 m
+两千余年 6 m
+两千余斤 2 m
+两千余种 2 m
+两千余里 5 m
+两千元 31 m
+两千八 2 m
+两千八百万元 2 m
+两千八百九十部 2 m
+两千八百二十亩 2 m
+两千八百二十匹 2 m
+两千八百六十三家 2 m
+两千八百门 2 m
+两千公里 4 m
+两千六百一十万余 2 m
+两千六百五十三 2 m
+两千只 3 m
+两千名 11 m
+两千四百 3 m
+两千四百余 2 m
+两千四百辆 2 m
+两千块 10 m
+两千多 59 m
+两千多万 8 m
+两千多个 5 m
+两千多元 8 m
+两千多只 2 m
+两千多名 4 m
+两千多吨 2 m
+两千多块 5 m
+两千多年 80 m
+两千多斤 2 m
+两千多种 3 m
+两千多米 2 m
+两千多间 2 m
+两千家 3 m
+两千左右 3 m
+两千年 94 m
+两千户 5 m
+两千担 2 m
+两千斤 2 m
+两千次 2 m
+两千种 3 m
+两千箱 2 m
+两千米 5 m
+两千节 2 m
+两千里 2 m
+两千零五十名 2 m
+两半 208 m
+两半个 5 m
+两半儿 3 m
+两半截 3 m
+两半片 2 m
+两半球 3 n
+两半部 8 m
+两卷 96 m
+两厅 3 n
+两厢 31 n
+两厢情愿 6 i
+两厢版 3 nz
+两厢车 3 l
+两双 69 m
+两双手 8 m
+两发 20 m
+两叠 5 m
+两口 371 m
+两口儿 42 n
+两口子 264 n
+两口气 3 n
+两句 1081 m
+两句诗 3 l
+两句话 3 l
+两只 2566 m
+两只手 3 i
+两只鱼 3 i
+两可之间 3 l
+两可离子 3 i
+两台 162 m
+两叶 14 m
+两叶掩目 3 i
+两号 10 m
+两名 1886 m
+两吨 5 m
+两员 105 m
+两周 221 m
+两周岁 2 m
+两周年 10 m
+两味 16 m
+两品 3 m
+两响 124 m
+两四百文 2 m
+两回 86 m
+两回事 42 l
+两团 59 m
+两国 3 ns
+两国之间 3 l
+两国人民 3 n
+两国关系 3 l
+两国政府 3 l
+两国论 26 n
+两国间 3 n
+两圆 3 n
+两圈 51 m
+两地 1174 n
+两地分居 3 l
+两地相思 3 l
+两场 294 m
+两块 636 m
+两块钱 3 n
+两城 179 ns
+两城镇 10 ns
+两基 31 n
+两堂 9 m
+两堆 17 m
+两堵 7 m
+两壁 41 m
+两声 663 m
+两壶 3 n
+两处 436 m
+两夜 109 m
+两大块 3 m
+两大宗 2 m
+两大洲 3 ns
+两大片 3 m
+两大类 3 m
+两大部 2 m
+两大部类 4 m
+两大阵营 3 l
+两天 2417 m
+两天晒网 12 i
+两头 606 m
+两头三绪 3 i
+两头三面 3 m
+两头为难 3 i
+两头和番 3 ns
+两头尖 3 l
+两头白面 3 n
+两头空 3 n
+两头落空 3 i
+两头蛇 3 i
+两头跑 3 l
+两套 180 m
+两女一男 3 n
+两女两男 3 n
+两姐妹 3 n
+两委 50 j
+两姨亲 3 n
+两字词 3 n
+两季 130 m
+两宋时代 3 n
+两宗 32 m
+两审 3 n
+两审终审 3 n
+两客 3 n
+两害相权 3 n
+两家 1069 m
+两家子 3 n
+两寸 59 m
+两对 289 m
+两对半 11 m
+两封 89 m
+两封信 3 n
+两尊 34 m
+两小无猜 7 i
+两尺 110 m
+两尾 11 m
+两局 81 m
+两层 996 m
+两层楼 3 n
+两居室 13 n
+两届 1149 m
+两岁 175 m
+两岁半 3 i
+两岸 2911 f
+两岸三地 3 n
+两岸人民 3 n
+两岸关系 3 n
+两岸通航 3 n
+两峰 22 m
+两帖 4 m
+两席 15 m
+两帮 7 m
+两幅 328 m
+两幕 5 m
+两幕间 3 n
+两幢 42 m
+两平方米 3 m
+两年 3732 m
+两年制 25 b
+两年生 3 b
+两广 281 j
+两广总督 3 n
+两床 8 m
+两度 198 m
+两座 1396 m
+两式 3 n
+两张 394 m
+两张床 3 n
+两张牌 3 n
+两张皮 3 n
+两弹 13 n
+两弹一星 14 nz
+两强 37 b
+两当县 3 ns
+两得其便 3 i
+两性 366 n
+两性之间 3 l
+两性人 15 n
+两性关系 30 l
+两性现象 3 n
+两性生殖 10 l
+两性生活 3 l
+两性用品 3 n
+两性知识 3 l
+两性离子 3 n
+两性空间 3 n
+两性胶体 3 n
+两性花 3 n
+两性融合 3 n
+两性话题 3 l
+两性间 3 n
+两性霉素 3 n
+两情相悦 3 i
+两情遣眷 3 i
+两意三心 3 l
+两成 47 m
+两截 3 m
+两截式 3 n
+两户 17 m
+两房一厅 3 n
+两房两厅 3 n
+两所 86 m
+两扇 167 m
+两扇门 3 n
+两手 675 m
+两手俱利 3 i
+两手几 3 m
+两手十 2 m
+两手发 2 i
+两手对 2 m
+两手打 2 m
+两手把 2 m
+两手抓 97 l
+两手掌 3 i
+两手支 2 m
+两手硬 3 z
+两手空空 77 n
+两手端 4 m
+两批 50 m
+两把 310 m
+两把刷子 3 n
+两折 10 m
+两抵 3 b
+两抹 3 m
+两担 18 m
+两招 168 m
+两拨 3 v
+两拳 53 m
+两捆 15 m
+两排 142 m
+两摞 3 m
+两撇 32 m
+两支 798 m
+两数 6 m
+两文 17 m
+两斗 5 m
+两斤 70 m
+两方 589 m
+两旁 969 f
+两日 379 m
+两日份 3 m
+两日游 7 n
+两晋 321 j
+两晋时代 3 l
+两曲 5 m
+两服 5 m
+两期 78 f
+两本 107 m
+两本书 3 n
+两朵 70 m
+两朵花 3 n
+两权分离 3 n
+两权分立 3 l
+两杆 16 m
+两束 61 m
+两杠 3 n
+两条 2260 m
+两条线 3 n
+两条腿 3 n
+两条腿走 3 l
+两条船 3 n
+两条路 3 n
+两条路线 3 l
+两条道路 3 l
+两杯 149 m
+两极 349 n
+两极分化 3 n
+两极化 6 n
+两极管 3 n
+两枚 386 m
+两枝 105 m
+两枪 36 m
+两架 223 m
+两柱 6 m
+两栋 12 m
+两栖 587 b
+两栖作战 3 l
+两栖动物 43 l
+两栖植物 3 l
+两栖登陆 3 ns
+两栖类 3 l
+两栖纲 3 n
+两栖舰 15 n
+两栖部队 3 l
+两株 96 m
+两样 292 r
+两根 562 m
+两格 3 n
+两案 19 m
+两桌 25 m
+两档 17 m
+两档子 2 m
+两桩 15 m
+两桶 25 m
+两梯 3 n
+两梯次 3 b
+两棵 89 m
+两棵树 3 ns
+两次 3903 m
+两次三番 3 m
+两次曝光 3 i
+两次运球 3 nz
+两款 88 m
+两步 962 m
+两步走 3 l
+两段 200 m
+两段制 3 n
+两段式 3 n
+两段票 3 n
+两汉 194 ns
+两江 126 ns
+两江道 2 ns
+两汪 3 m
+两河 212 ns
+两河口 23 ns
+两河镇 3 ns
+两法 38 n
+两派 425 m
+两派人马 3 n
+两浙 3 j
+两淮 3 j
+两清 14 b
+两湖 913 ns
+两湖总督 3 n
+两湖盆地 3 ns
+两湾城 3 ns
+两溜 8 m
+两滴 46 m
+两潘 3 ns
+两点 614 m
+两点水 3 n
+两点论 3 n
+两点钟 3 m
+两点阈 3 n
+两片 223 m
+两班 105 m
+两班制 3 n
+两瓢 2 m
+两瓣 3 n
+两瓶 69 m
+两用 318 n
+两用人才 3 n
+两用人材 3 n
+两用品 3 n
+两用型 4 n
+两用机 3 n
+两用桥 114 n
+两用衫 3 n
+两用车 6 n
+两男一女 3 l
+两男两女 3 l
+两番 50 m
+两百 85 m
+两百一十五册 2 m
+两百七十五辆 2 m
+两百万 11 m
+两百万两 2 m
+两百三十万 2 m
+两百三十万镑 2 m
+两百三十三种 2 m
+两百两 2 m
+两百个 5 m
+两百二十余处 2 m
+两百二十册 2 m
+两百二十门 2 m
+两百五十 2 m
+两百五十余 2 m
+两百五十八家 2 m
+两百亩 2 m
+两百人 3 n
+两百亿 4 m
+两百份 2 m
+两百余 9 m
+两百余万 2 m
+两百余万两 2 m
+两百余个 2 m
+两百余名 2 m
+两百余处 2 m
+两百余年 8 m
+两百余招 2 m
+两百余种 4 m
+两百余篇 2 m
+两百余起 2 m
+两百元 7 m
+两百八十里 2 m
+两百公里 2 m
+两百六十余 2 m
+两百六十公里 2 m
+两百六十六万四千余 2 m
+两百匹 2 m
+两百卷 3 m
+两百名 26 m
+两百四十三公里 2 m
+两百块 5 m
+两百多 20 m
+两百多万 8 m
+两百多万元 2 m
+两百多个 5 m
+两百多位 2 m
+两百多公里 3 m
+两百多匹 2 m
+两百多名 6 m
+两百多年 31 m
+两百多所 2 m
+两百多斤 3 m
+两百多种 3 m
+两百多里 4 m
+两百多面 2 m
+两百天 2 m
+两百头 2 m
+两百家 2 m
+两百岁 2 m
+两百年 64 m
+两百座 2 m
+两百招 2 m
+两百拳 2 m
+两百斤 5 m
+两百架 6 m
+两百次 5 m
+两百步 7 m
+两百箱 2 m
+两百米 8 m
+两百里 7 m
+两百颗 2 m
+两盅 3 n
+两盆 20 m
+两盎司 2 m
+两盏 81 m
+两盒 31 m
+两盘 130 m
+两目 20 m
+两相宜 3 i
+两相情原 3 i
+两相情愿 10 i
+两相系统 3 l
+两省区 3 ns
+两眼 625 m
+两眼一抹黑 12 i
+两眼一摸黑 4 i
+两眼发呆 3 i
+两眼发直 3 i
+两眼发黑 18 l
+两着 2 m
+两瞽相扶 3 nz
+两码 3 n
+两码事 53 n
+两码子 3 n
+两码见字 3 n
+两碗 214 m
+两碗饭 3 n
+两磅 5 m
+两票 4 m
+两种 7154 m
+两种制度 3 l
+两秒 14 m
+两秒钟 3 i
+两程 5 n
+两税 69 j
+两税法 40 n
+两立 17 b
+两立方米 2 m
+两站 23 m
+两章 16 m
+两端 700 m
+两笔 31 m
+两等 27 m
+两筐 10 m
+两筒 3 n
+两箱 19 m
+两篇 125 m
+两篓 5 m
+两米 213 m
+两类 1341 m
+两粒 119 m
+两粒装 3 n
+两粤 3 ns
+两粤总督 3 j
+两系 51 n
+两级 948 m
+两线 107 m
+两组 337 m
+两维 2 m
+两缕 2 m
+两缸 3 n
+两罐 6 m
+两群 6 m
+两翼 472 n
+两者 3252 n
+两者之间 3 l
+两耳 3 n
+两耳塞豆 3 ns
+两联 3 ns
+两联式 3 n
+两肋 3 n
+两肋插刀 14 l
+两股 180 m
+两肩 3 n
+两肩荷口 3 l
+两胎 6 m
+两脚一蹬 3 n
+两脚书橱 3 n
+两脚居间 3 n
+两脚规 3 n
+两脚野狐 3 n
+两腔 4 m
+两腮 3 b
+两臂 3 n
+两般三样 3 l
+两艘 430 m
+两节 67 m
+两节课 3 n
+两英里 4 m
+两茬 4 m
+两虎相争 3 i
+两虎相斗 3 i
+两行 608 j
+两袋 21 m
+两袖 3 n
+两袖清风 22 l
+两角 50 m
+两讫 3 n
+两记 37 m
+两课 2 n
+两豆塞耳 3 n
+两败俱伤 102 i
+两败具伤 3 l
+两起 47 m
+两趟 43 m
+两跑楼梯 3 n
+两路 538 m
+两路横队 3 n
+两路纵队 3 n
+两身 5 m
+两车 11 m
+两轮 124 m
+两载 10 m
+两辆 152 m
+两辆车 3 n
+两辈 17 m
+两辈子 2 m
+两辑 2 m
+两边 1634 f
+两边倒 5 i
+两边讨好 3 l
+两连胜 3 ns
+两连败 3 n
+两通 2 m
+两造 3 b
+两遍 154 m
+两道 659 m
+两道三科 3 ns
+两道菜 3 n
+两遭 18 m
+两部 446 m
+两部委 3 n
+两部戏 3 n
+两部鼓吹 3 i
+两里 32 m
+两重 104 m
+两重天 3 z
+两重性 35 n
+两重意义 3 l
+两锅 3 n
+两锭 23 m
+两键 3 n
+两门 274 m
+两门课 3 n
+两间 215 f
+两间房 3 n
+两队 364 m
+两阵 81 m
+两阶 3 n
+两院 956 j
+两院制 1310 j
+两难 56 n
+两霸 3 n
+两面 1178 m
+两面三刀 15 m
+两面二舌 3 i
+两面作战 3 l
+两面倒 3 i
+两面光 7 n
+两面分 2 m
+两面夹攻 3 i
+两面性 50 n
+两面手法 3 n
+两面派 26 n
+两面第 2 n
+两面角 2 n
+两面讨好 3 l
+两面针 53 n
+两页 34 m
+两顶 16 m
+两项 518 m
+两顿 47 m
+两颊 3 n
+两颗 345 m
+两颗心 3 n
+两题 3 n
+两餐 30 m
+两首 88 m
+两首歌 3 m
+两驾 2 m
+两高一优 3 b
+两鬃苍苍 3 z
+两鬓 114 n
+两鬓如霜 3 i
+两鼠斗穴 3 n
+严 2591 a
+严三星 3 nr
+严世藩 10 nr
+严东生 2 nr
+严丝合缝 25 i
+严严 15 a
+严严实实 217 z
+严严密密 3 nr
+严严格格 3 nr
+严义埙 257 n
+严义明 2 nr
+严于 3 v
+严于律己 20 nr
+严于律已 3 nr
+严云京 58 nr
+严亮祖 29 nr
+严介和 2 nr
+严令 113 nr
+严令禁止 12 l
+严以律己 10 nr
+严以自律 3 nr
+严仲子 3 nr
+严修 2 nr
+严先生 4 nr
+严克强 24 nr
+严公子 2 nr
+严冬 80 nr
+严冷 3 a
+严凤笙 40 nr
+严凤英 5 nr
+严分宜 2 a
+严刑 339 v
+严刑峻制 3 i
+严刑峻法 41 i
+严刑峻罚 3 i
+严刑拷打 3 vn
+严剑葵 3 n
+严办 35 v
+严加 274 v
+严加惩处 3 i
+严加戒备 3 n
+严加管教 3 n
+严加防范 3 nr
+严千帆 4 nr
+严卫民 3 nr
+严厉 1260 ad
+严厉打击 3 i
+严厉批评 3 vn
+严厉查处 3 i
+严可均 11 nr
+严可求 2 nr
+严台端 2 nr
+严命 3 nr
+严和东 2 nr
+严国群 2 nr
+严培中 4 nr
+严处 3 v
+严复 93 nr
+严复感 2 nr
+严复译 3 nr
+严大人 10 nr
+严如平 20 nr
+严妈妈 3 nr
+严子健 2 nr
+严子陵 15 nr
+严守 468 a
+严守一 3 nr
+严守中立 3 nr
+严守纪律 3 nr
+严安 2 a
+严宏谟 2 nr
+严实 53 ad
+严家 136 n
+严家岗 3 nr
+严家淦 3 nr
+严家饿隶 3 n
+严密 977 a
+严密性 15 nr
+严密掌握 3 i
+严密控制 3 n
+严寒 513 a
+严寒季节 3 nr
+严寒酷暑 3 l
+严察 3 v
+严峻 1241 a
+严峻形势 3 i
+严峻性 5 nr
+严峻考验 3 nr
+严嵩万 2 nr
+严嵩之 3 nr
+严嵩依然 2 nr
+严嵩横 4 nr
+严嵩窥 3 nr
+严州 7 ns
+严师 25 nr
+严式标 2 nr
+严志达 9 nr
+严怡民 2 nr
+严惩 375 v
+严惩不贷 36 i
+严惩凶手 3 i
+严慈相 2 nr
+严慧书 8 nr
+严打 41 v
+严打斗争 3 l
+严抓 3 v
+严挺 6 a
+严挺之 3 nr
+严控 7 v
+严敦杰 16 nr
+严整 384 a
+严文井 7 nr
+严斥 3 v
+严既澄 2 nr
+严旨切 11 nr
+严明 226 a
+严明法纪 3 nr
+严晓群 3 nr
+严晓频 256 nr
+严景耀 3 nr
+严智怡 2 nr
+严智泽 256 nr
+严查 62 v
+严格 4728 ad
+严格主义 3 nr
+严格凸 3 nr
+严格执法 3 nr
+严格执行 3 nr
+严格把关 3 nr
+严格控制 3 n
+严格教育 3 l
+严格来说 3 l
+严格监督 3 nr
+严格管理 3 nr
+严格纪律 3 nr
+严格考核 3 nr
+严格要求 3 l
+严格训练 3 nr
+严格说来 3 l
+严格遵守 3 nr
+严桐江 2 nr
+严正 327 nr
+严正声明 3 nr
+严母慈 2 nr
+严气正性 3 nr
+严汉青 3 nr
+严治 3 nr
+严法 3 a
+严法峻刑 3 l
+严济慈 8 nr
+严灵峰 2 nr
+严然 4 ad
+严父 23 nr
+严父慈母 4 nr
+严父甚 2 nr
+严田古 2 nr
+严白虎 5 nr
+严禁 552 v
+严禁吸烟 3 n
+严禁烟火 3 i
+严竣 3 nr
+严管 4 v
+严素使 2 nr
+严素见 2 nr
+严紧 22 a
+严细 3 ad
+严老烈 2 nr
+严老爷 4 nr
+严老爹 2 nr
+严耕望 13 nr
+严肃 1650 a
+严肃处理 3 nr
+严肃性 49 nr
+严肃查处 3 nr
+严肃认真 3 n
+严良 6 a
+严色厉 6 nr
+严苛 26 a
+严范孙 2 nr
+严行 3 a
+严衍著 2 nr
+严要求 3 l
+严规 6 a
+严词 46 nr
+严词拒绝 3 l
+严谕李 2 nr
+严谨 742 a
+严谨性 5 nr
+严责 3 v
+严辞 6 nr
+严进宽 2 nr
+严酷 307 a
+严酷性 2 n
+严重 10445 a
+严重不足 3 i
+严重事故 3 i
+严重危害 3 l
+严重后果 3 i
+严重困难 3 i
+严重威胁 3 n
+严重局面 3 n
+严重性 158 nr
+严重损失 3 l
+严重破坏 3 i
+严重者 180 nr
+严重错误 3 i
+严锡命 3 nr
+严防 99 v
+严防死守 3 i
+严防豪雨 3 nr
+严阵以待 43 i
+严阵会 2 nr
+严阵划 2 nr
+严阵来 4 t
+严阵真 2 nr
+严阵连 2 nr
+严陈以待 3 i
+严陵钓 2 nr
+严霜 34 nr
+严顺开 3 nr
+严颖 4 a
+严颖书 6 nr
+严颜军 2 nr
+严颜引 2 nr
+严首辅 5 nr
+並 9 zg
+丧 1013 vg
+丧主 3 v
+丧乱 24 v
+丧事 298 v
+丧亡 8 v
+丧亲之痛 3 i
+丧假 3 v
+丧偶 20 n
+丧偶之痛 3 l
+丧命 200 v
+丧天害理 3 i
+丧夫 3 n
+丧夫之痛 3 i
+丧失 1693 v
+丧失殆尽 3 z
+丧失理智 3 i
+丧失者 3 n
+丧失能力 3 i
+丧妻 3 n
+丧妻之痛 3 i
+丧家 5 n
+丧家之犬 20 i
+丧家之狗 6 i
+丧家狗 3 i
+丧尸 3 n
+丧尽天良 31 i
+丧居 3 v
+丧师辱国 6 i
+丧心 6 v
+丧心病狂 26 i
+丧志 6 n
+丧手 3 v
+丧明之痛 3 i
+丧服 72 v
+丧权辱国 174 i
+丧母 3 n
+丧母之痛 3 l
+丧气 70 n
+丧气话 9 l
+丧父 73 n
+丧父之痛 3 i
+丧生 229 v
+丧生者 2 n
+丧礼 33 v
+丧胆 48 v
+丧胆亡魂 3 i
+丧胆游魂 3 i
+丧胆销魂 3 n
+丧葬 97 v
+丧葬费 9 n
+丧身 41 v
+丧身失节 3 i
+丧钟 28 n
+丧门 54 n
+丧门星 8 n
+丧门神 13 i
+丧门鬼 3 i
+丧魂失魄 21 i
+丧魂落魄 17 i
+丨 61 zg
+个 125538 q
+个个 1842 r
+个中三味 3 l
+个中之味 3 l
+个中内情 3 n
+个中妙趣 3 l
+个中滋味 8 n
+个人 12744 n
+个人专辑 3 l
+个人主义 86 n
+个人主页 3 n
+个人住房 3 n
+个人保险 3 n
+个人信息 3 n
+个人信用 3 n
+个人修养 3 n
+个人党性 3 n
+个人全能 3 j
+个人兴趣 3 n
+个人冠军 3 n
+个人利益 3 n
+个人制做 3 l
+个人努力 3 l
+个人化 27 n
+个人卫生 3 n
+个人头像 3 n
+个人奖 4 n
+个人展 2 j
+个人崇拜 216 l
+个人帐户 3 n
+个人得失 3 n
+个人性 11 n
+个人感觉 3 n
+个人成分 3 l
+个人成长 3 n
+个人所得 2 l
+个人所得税 67 l
+个人所得税法 12 n
+个人所有 16 l
+个人承包 3 n
+个人收入 3 n
+个人数字助理 12 n
+个人文集 3 n
+个人日记 3 n
+个人档案 3 l
+个人消费 3 n
+个人爱好 3 a
+个人版 3 n
+个人特长 3 n
+个人独资 3 l
+个人用品 3 n
+个人用户 3 n
+个人电脑 92 n
+个人相册 3 l
+个人空间 3 n
+个人简介 3 l
+个人简历 3 l
+个人经历 3 n
+个人股 3 n
+个人自传 3 l
+个人艺术 3 n
+个人行为 3 n
+个人见解 3 l
+个人观点 3 n
+个人词库 3 n
+个人词汇 3 n
+个人说明 3 l
+个人财产 3 j
+个人账户 3 n
+个人资料 3 n
+个人赛 25 n
+个人身份 3 n
+个人隐私 3 l
+个人风格 3 n
+个位 26 n
+个位数 10 n
+个体 2407 n
+个体主义 3 n
+个体劳动 3 l
+个体化 30 n
+个体发育 3 l
+个体变元 3 n
+个体差异 3 l
+个体性 5 n
+个体户 116 n
+个体所有 3 l
+个体所有制 4 l
+个体手工 3 n
+个体承包 3 n
+个体经济 99 n
+个体经营 78 n
+个体经营者 7 n
+个体老板 3 n
+个例 25 n
+个儿 304 n
+个别 3125 n
+个别人 75 n
+个别命令 3 n
+个别差异 11 l
+个别性 15 n
+个别情况 3 n
+个别托盘 3 n
+个别指导 3 n
+个别教学 3 n
+个别测验 3 n
+个别现象 3 n
+个别生产 3 n
+个别谈话 3 n
+个别辅导 3 n
+个协 8 j
+个头 540 n
+个头儿 25 n
+个子 403 n
+个字元 3 n
+个字符 3 n
+个展 18 vn
+个度 3 n
+个性 1531 n
+个性化 308 n
+个性头像 3 n
+个性标记 3 n
+个性特征 3 n
+个性特点 3 n
+个把位 2 n
+个把月 13 n
+个数 242 n
+个旧 69 a
+个旧市 8 n
+个案 99 n
+个案研究 3 n
+个案纪录 3 n
+个私 12 n
+个税 4 n
+个税法 3 n
+个股 774 n
+个贷 4 n
+个里 3 q
+丫 227 n
+丫丫 3 n
+丫丫币 3 n
+丫头 1652 n
+丫头帮 3 n
+丫嬛 3 n
+丫子 3 n
+丫杈 3 n
+丫环 332 n
+丫髻 14 n
+丫鬟 399 n
+丬 3 zg
+中 243191 f
+中三 3 ns
+中上 86 ns
+中上层 43 b
+中上游 166 f
+中上程度 3 n
+中上阶层 3 n
+中上阶级 3 l
+中下 38 f
+中下层 56 n
+中下旬 76 t
+中下游 658 j
+中下祸根 3 i
+中下程度 3 n
+中下等 15 b
+中下级 44 b
+中下部 25 f
+中下阶层 3 n
+中下阶级 3 l
+中不溜 3 l
+中不溜儿 3 l
+中不边界 3 ns
+中专 775 j
+中专处 2 nt
+中专学校 3 nt
+中专文化 3 j
+中专班 2 j
+中专生 47 j
+中世 10 nz
+中世纪 859 nz
+中东 1159 ns
+中东国家 3 ns
+中东地区 132 ns
+中东战争 70 nz
+中东欧 18 ns
+中东社 3 nt
+中东部 56 nt
+中东问题 3 n
+中丞 41 n
+中丹 2 ns
+中丹田 2 nz
+中举 75 n
+中义 5 n
+中义关系 3 n
+中乐 3 ns
+中书令 114 n
+中书君 5 n
+中书平 5 n
+中书省 640 nt
+中了铅毒 3 l
+中二 3 nz
+中云 6 ns
+中井贵一 3 nr
+中亚 1078 ns
+中亚国家 3 ns
+中亚地区 114 ns
+中产 155 j
+中产者 3 n
+中产阶层 19 n
+中产阶级 574 n
+中亨利 2 ns
+中京 32 ns
+中亭街 3 ns
+中人 230 nt
+中人网 3 nz
+中介 606 j
+中介业 3 j
+中介人 16 n
+中介代理 3 n
+中介子 3 nr
+中介性 3 n
+中介方 3 n
+中介机构 3 n
+中介现象 3 n
+中介组织 3 j
+中介费 26 n
+中仑 3 ns
+中仑站 3 ns
+中仙 4 ns
+中代 3 t
+中价 3 n
+中企 15 j
+中伏 51 j
+中休 2 ns
+中会 3 j
+中伤 33 n
+中位值 3 n
+中位数 33 n
+中位沼泽 3 nr
+中低 53 j
+中低产田 5 n
+中低层 3 j
+中低收入 20 j
+中低收入者 23 j
+中低档 9 b
+中低端 22 j
+中低级 2 b
+中体 21 n
+中体网 3 nz
+中体西用 20 nt
+中俄 3 ns
+中俄关系 3 nt
+中俄军演 3 n
+中俄总理定期会晤委员会 5 nt
+中保 66 j
+中信 202 nz
+中信公司 8 nt
+中信实业银行 8 nt
+中信旅游总公司 4 nt
+中信证券 66 nt
+中信银行 13 nt
+中信集团 3 nt
+中值 3 n
+中储 33 j
+中元 37 t
+中元节 10 t
+中共 3136 j
+中共一大 3 j
+中共七大 8 nt
+中共三大 3 j
+中共上海市委 21 nt
+中共上海市委宣传部 2 nt
+中共中央 3917 nt
+中共中央东北局 9 nt
+中共中央书记处 65 nt
+中共中央党史研究室 55 nt
+中共中央党校 46 nt
+中共中央办公厅 45 nt
+中共中央北方局 4 nt
+中共中央台办 3 nt
+中共中央国务院 4 nt
+中共中央宣传部 51 nt
+中共中央对外联络部 12 nt
+中共中央政治局 324 nt
+中共中央政治局常委会 2 nt
+中共中央政法委员会 3 nt
+中共中央文献研究室 20 nt
+中共中央纪委 2 nt
+中共中央纪律检查委员会 7 nt
+中共中央组织部 12 nt
+中共中央统战部 7 nt
+中共中央顾问委员会 22 nt
+中共二大 3 nz
+中共云南省委 3 nt
+中共党史 3 nz
+中共党员 3 n
+中共八大 4 nt
+中共六届六中全会 4 nt
+中共军队 3 nt
+中共北京市委 16 nt
+中共十一届三中全会 21 nt
+中共十三大 6 nt
+中共十五大 2 nt
+中共十四大 7 nt
+中共南京市委 5 nt
+中共四川省委 3 nt
+中共天津市委 4 nt
+中共安徽省委 20 nt
+中共山东省委 2 nt
+中共广东 3 ns
+中共广东省委 20 nt
+中共政府 3 nt
+中共晋察冀中央局 2 nt
+中共江苏省委 10 nt
+中共江西省委 6 nt
+中共河南省委 5 nt
+中共浙江省委 2 nt
+中共湖北省委 10 nt
+中共湖南省委 8 nt
+中共湘区委员会 3 nt
+中共甘肃省委 2 nt
+中共福建省委 23 nt
+中共贵州省委 2 nt
+中共鄂豫皖省委 3 nt
+中共陕西省委 3 nt
+中关 14 ns
+中关村 153 ns
+中关村地区 2 ns
+中关村科技园区 3 ns
+中兴 684 ns
+中兴公司 3 nt
+中兴大业 3 nt
+中兴大学 3 nt
+中兴小学 3 nt
+中兴新村 3 ns
+中兴法商 3 nt
+中兴路 3 ns
+中兴通讯 55 nt
+中兽医 4 n
+中册 7 n
+中冓之言 3 v
+中军 560 j
+中军帐 71 n
+中农 63 nz
+中冶 12 j
+中冷 13 ns
+中准价 3 nz
+中凯 3 nz
+中凯文化 3 ns
+中出 3 vn
+中分 3 n
+中切 3 ns
+中列明 3 ns
+中到大雨 6 l
+中到大雪 2 l
+中前场 27 n
+中剖定理 3 n
+中副 3 j
+中办 10 j
+中办发 3 j
+中办国办 3 nt
+中加 130 ns
+中化 37 j
+中北 28 ns
+中北大学 3 nt
+中北欧 3 ns
+中北路 3 ns
+中北部 109 f
+中北非 3 ns
+中区 26 ns
+中医 1034 j
+中医中药 3 nt
+中医医院 6 nt
+中医学 99 nt
+中医学院 21 nt
+中医师 11 nt
+中医理论 3 n
+中医界 3 nz
+中医疗法 3 n
+中医科 14 nz
+中医肿瘤 3 l
+中医药 168 nt
+中医药大学 279 nt
+中医药学会 6 nt
+中医药局 3 nt
+中医院 45 nt
+中午 1449 t
+中午饭 35 n
+中华 2446 nz
+中华世纪坛 11 nz
+中华书局 280 nt
+中华书库 3 nz
+中华人民 3 ns
+中华人民共和国 9989 ns
+中华人民共和国中央人民政府 180 nt
+中华人民共和国中央军事委员会 2066 nt
+中华人民共和国全国人民代表大会 137 nt
+中华人民共和国国务院 921 nt
+中华人民共和国国防部 4 nt
+中华人民共和国外交部 41 nt
+中华人民共和国宪法 1099 nz
+中华人民共和国政府 69 nt
+中华人民共和国教育部 13 nt
+中华人民共和国文化部 3 nt
+中华人民共和国海关 2 nt
+中华人民共和国澳门特别行政区 2 nt
+中华人民共和国财政部 2 nt
+中华人民共和国香港特别行政区 43 nt
+中华会馆 7 nt
+中华儿女 3 n
+中华全国 3 nt
+中华全国体育总会 18 nt
+中华全国供销合作总社 2 nt
+中华全国台湾同胞联谊会 5 nt
+中华全国妇女联合会 8 nt
+中华全国学生联合会 9 nt
+中华全国工商业联合会 13 nt
+中华全国归国华侨联合会 4 nt
+中华全国总工会 72 nt
+中华全国新闻工作者协会 10 nt
+中华全国集邮联合会 2 nt
+中华全国青年联合会 9 nt
+中华医专 3 nt
+中华医学会 54 nt
+中华和钟 512 nz
+中华商场 3 nt
+中华字典 3 ns
+中华小姐 3 n
+中华工专 3 nt
+中华工业 3 nt
+中华工商 3 nt
+中华开放 3 ns
+中华情 3 n
+中华慈善总会 2 nt
+中华按蚊 14 n
+中华文化 3 nt
+中华文明 3 ns
+中华日报 3 nz
+中华民国 826 ns
+中华民国政府 28 nt
+中华民族 2640 nz
+中华民族文化促进会 4 nt
+中华民族解放先锋队 5 nt
+中华民族解放行动委员会 6 nt
+中华民谣 3 n
+中华烟 3 nz
+中华牌 7 nz
+中华环保基金会 2 nt
+中华环境保护基金会 4 nt
+中华电信 3 nt
+中华电视 3 nt
+中华神差 3 n
+中华经济 3 n
+中华网 73 nt
+中华美食 3 n
+中华苏维埃共和国 121 ns
+中华街 3 ns
+中华路 12 ns
+中华车 3 nt
+中华轩 3 nr
+中华轿车 3 n
+中华邮 3 ns
+中华门 1553 ns
+中华队 3 nt
+中华革命 3 nz
+中华预防医学会 8 nt
+中华魂 3 n
+中华鲟 789 n
+中南 618 ns
+中南亚 3 ns
+中南区 3 ns
+中南半岛 3 ns
+中南大学 33 nt
+中南局 14 nt
+中南工业大学 2 nt
+中南林 3 ns
+中南林学院 2 nt
+中南欧 3 ns
+中南海 359 ns
+中南海怀仁堂 5 ns
+中南海西花厅 12 ns
+中南美 5 ns
+中南美洲 21 ns
+中南财经大学 4 nt
+中南财经政法大学 533 nt
+中南部 1011 nt
+中卫 68 ns
+中卫县 20 ns
+中卫市 3 ns
+中印 3 nt
+中印关系 3 nt
+中印国界 3 nz
+中厅 3 ns
+中压 16 n
+中厚板 3 n
+中原 2825 ns
+中原军区 52 nt
+中原区 4 ns
+中原地区 181 ns
+中原大学 3 nt
+中原油气 5 nt
+中原油田 9 nt
+中原逐鹿 2 n
+中去 3 t
+中县 3 ns
+中友 2 n
+中发 53 nt
+中叔皇 3 nr
+中叙 6 n
+中古 138 ns
+中古世纪 3 nz
+中古史 14 nz
+中古品 3 n
+中古时代 3 t
+中古车 3 ns
+中台 19 ns
+中台办 3 j
+中台医专 3 nt
+中叶 1329 t
+中号 12 n
+中后场 10 n
+中后期 137 f
+中君臣 5 nr
+中吨位 2 n
+中和 567 ns
+中和作用 3 nt
+中和剂 3 nz
+中和力 3 nz
+中和市 3 ns
+中和突变 3 n
+中和表位 3 n
+中和西乡 3 ns
+中唐 3 t
+中唐时期 3 nz
+中商 4 nt
+中商网 3 nz
+中固 3 ns
+中国 129470 ns
+中国万网 3 nz
+中国下载 3 b
+中国专利 3 nt
+中国东方电气集团 2 nt
+中国东方航空 2 nt
+中国东方航空公司 9 nt
+中国东方资产管理公司 5 nt
+中国中医研究院 13 nt
+中国中央政府 12 nt
+中国中央电视台 10 nt
+中国之最 3 nr
+中国乒乓球协会 3 nt
+中国乒乓球队 36 nt
+中国书店 6 nt
+中国书法家协会 8 nt
+中国书画 3 n
+中国互联网络信息中心 22 nt
+中国交响乐团 8 n
+中国京剧 3 nz
+中国京剧院 13 nt
+中国人事部 2 nt
+中国人口学会 2 nt
+中国人民保险公司 6 nt
+中国人民外交学会 57 nt
+中国人民大学 139 nt
+中国人民大学出版社 27 nt
+中国人民对外友好协会 9 nt
+中国人民志愿军 136 nt
+中国人民抗日军政大学 5 nt
+中国人民抗日战争纪念馆 2 n
+中国人民政治协商会议 616 nt
+中国人民政治协商会议全国委员会 36 nt
+中国人民武装警察部队 19 nt
+中国人民爱国统一战线 3 nt
+中国人民解放军 1328 nt
+中国人民解放军三军仪仗队 2 nt
+中国人民解放军军乐团 4 nt
+中国人民解放军军事科学院 258 nt
+中国人民解放军国防大学 5 nt
+中国人民解放军总参谋部 8 nt
+中国人民解放军总后勤部 8 nt
+中国人民解放军总政治部 19 nt
+中国人民解放军总部 25 nt
+中国人民解放军海军 26 nt
+中国人民解放军空军 15 nt
+中国人民解放战争 24 nz
+中国人民银行 230 nt
+中国人民银行总行 3 nt
+中国人民银行研究局 2 nt
+中国人民革命军事博物馆 8 nt
+中国企业家协会 3 nt
+中国企业文化促进会 2 nt
+中国企业联合会 9 nt
+中国企业评价协会 2 nt
+中国伊斯兰教协会 8 nt
+中国传媒 3 n
+中国体育代表团 5 nt
+中国佛学院 4 nt
+中国佛教协会 12 nt
+中国作协 12 nt
+中国作家协会 81 nt
+中国使馆 10 nt
+中国保护消费者基金会 2 nt
+中国保监会 11 nt
+中国保险监督管理委员会 3 nt
+中国信息产业部 6 nt
+中国信达资产管理公司 5 nt
+中国儿童少年基金会 4 nt
+中国儿童艺术剧院 5 nt
+中国光大银行 4 nt
+中国公学 26 nt
+中国公安部 4 nt
+中国共产主义青年团 71 nt
+中国共产党 6832 nt
+中国共产党中央委员会 297 nt
+中国共产党第一次全国代表大会 45 nz
+中国共产党第七次全国代表大会 28 nz
+中国共产党第九次全国代表大会 8 nz
+中国兵器工业集团 2 nt
+中国内蒙古自治区 50 ns
+中国军力 3 nt
+中国军方 3 nt
+中国农业大学 39 nt
+中国农业科学院 17 nt
+中国农业银行 66 nt
+中国农大 3 nt
+中国农学会 2 nt
+中国农工民主党 46 nt
+中国农科院 2 nt
+中国农行 3 nt
+中国凤凰 5 nz
+中国出版工作者协会 6 nt
+中国剧院 5 nt
+中国动物学会 7 nt
+中国化 59 nt
+中国化学会 27 nt
+中国北方地区 17 ns
+中国北方工业公司 8 nt
+中国区 224 nt
+中国医学科学院 34 nt
+中国医学科学院肿瘤医院 8 nt
+中国医科大学 13 nt
+中国医科院肿瘤医院 2 nt
+中国华北地区 16 ns
+中国协和医科大学 25 nt
+中国南方航空公司 4 nt
+中国南极长城站 6 nt
+中国南瓜 3 ns
+中国卫生部 26 nt
+中国历史博物馆 546 nt
+中国台北 22 ns
+中国台北队 25 nt
+中国台湾 186 ns
+中国台湾地区 18 ns
+中国史 67 nz
+中国史学会 45 nt
+中国史纲 3 n
+中国同盟 3 nt
+中国同盟会 46 nt
+中国和平统一促进会 2 nt
+中国商会 3 nt
+中国商银 3 nz
+中国嘉陵 6 ns
+中国围棋 3 l
+中国围棋协会 7 nt
+中国国奥队 30 nt
+中国国家体育总局 4 nt
+中国国家文物局 5 nt
+中国国家旅游局 10 nt
+中国国家航天局 2 nt
+中国国家队 16 nt
+中国国情 3 n
+中国国歌 3 nz
+中国国民党 379 nt
+中国国民党临时行动委员会 11 nt
+中国国民党革命委员会 70 nt
+中国国防部 6 nt
+中国国际交流协会 3 nt
+中国国际信托投资公司 8 nt
+中国国际展览中心 3 l
+中国国际广播电台 13 nt
+中国国际战略学会 2 n
+中国国际旅游交易会 5 nt
+中国国际旅行社 23 nt
+中国国际航空公司 12 nt
+中国国际贸易中心 4 nt
+中国国际贸易促进委员会 15 nt
+中国国际金融有限公司 3 nt
+中国国际问题研究所 2 n
+中国国青队 2 nt
+中国图书馆学会 6 nt
+中国地产 3 j
+中国地图出版社 4 nt
+中国地质大学 541 nt
+中国地质学会 8 nt
+中国地质科学院 2 nt
+中国地震局 3 nt
+中国基督教三自爱国运动 2 nz
+中国基督教三自爱国运动委员会 6 nt
+中国基督教协会 5 nt
+中国塑料 3 nz
+中国外交学院 2 nt
+中国外交部 370 nt
+中国外商投资企业协会 2 nt
+中国外汇交易中心 6 nt
+中国大使馆 18 nt
+中国大学 308 nt
+中国大百科全书出版社 15 nt
+中国大酒店 3 nt
+中国大饭店 4 ns
+中国天主教主教团 3 nt
+中国天主教爱国会 8 nt
+中国天文学会 4 nt
+中国太平洋保险公司 2 nt
+中国奥委会 22 nt
+中国奥林匹克委员会 2 nt
+中国女子垒球队 2 nt
+中国女排 63 nt
+中国女篮 41 nt
+中国女足 50 nt
+中国女队 177 nt
+中国妇女报 4 nt
+中国娃娃 3 n
+中国宁波 3 ns
+中国家用电器协会 2 nt
+中国家电 3 nt
+中国家电协会 2 nt
+中国富豪 3 nz
+中国少年儿童出版社 3 nt
+中国少年先锋队 8 nt
+中国少年队 4 nt
+中国崛起 3 vn
+中国工会 11 nt
+中国工农红军 293 nt
+中国工商银行 34 nt
+中国工程物理研究院 4 nt
+中国工程院 94 nt
+中国幼教 3 n
+中国康复研究中心 4 nt
+中国建材 3 nt
+中国建筑学会 7 nt
+中国建设银行 31 nt
+中国式 131 nz
+中国惠普有限公司 5 n
+中国戏剧出版社 5 nt
+中国戏剧家协会 16 nt
+中国戏曲 3 n
+中国戏曲学院 10 nt
+中国战区 3 nt
+中国扶贫基金会 4 nt
+中国投资有限公司 3 nt
+中国投资银行 2 nt
+中国抗癌协会 8 nt
+中国护士 3 n
+中国摄影家协会 15 nt
+中国收藏家协会 2 nz
+中国政协 260 nt
+中国政府 1232 nt
+中国政法大学 62 nt
+中国教会 6 nt
+中国教育学会 7 nt
+中国教育工会 3 nt
+中国教育电视台 15 nt
+中国教育部 5 nt
+中国敦煌吐鲁番学会 3 nt
+中国数学会 10 nt
+中国数学学会 2 nt
+中国文化书院 2 nt
+中国文化部 3 nt
+中国文学艺术界联合会 19 nt
+中国文联 68 nt
+中国新民主主义青年团 10 nt
+中国新民主主义革命 112 nz
+中国新疆地区 11 ns
+中国新闻摄影学会 3 nt
+中国新闻社 4 nt
+中国旅游出版社 3 nt
+中国旅游协会 8 nt
+中国旅行社 37 nt
+中国旅行社总社 12 nt
+中国日报 177 nz
+中国时报 3 nt
+中国曲艺家协会 2 nt
+中国有色金属建设股份有限公司 7 nt
+中国服装协会 3 nt
+中国机电产品进出口商会 4 nt
+中国林业 3 nt
+中国林学会 3 nt
+中国林科院 2 nt
+中国核学会 6 nt
+中国棋院 58 nt
+中国模具 3 l
+中国歌剧舞剧院 9 nt
+中国武术 3 n
+中国武术协会 3 nt
+中国残疾人福利基金会 2 nt
+中国残疾人联合会 31 nt
+中国残疾人艺术团 2 nt
+中国残联 17 nt
+中国民主促进会 65 nt
+中国民主同盟 92 nt
+中国民主同盟中央 7 nt
+中国民主建国会 66 nt
+中国民主政团同盟 42 nt
+中国民俗 3 n
+中国民歌 3 nz
+中国民生银行 3 nt
+中国民用航空总局 6 nt
+中国民航 44 nt
+中国民航总局 15 nt
+中国民间文艺家协会 4 nt
+中国气象局 12 nt
+中国水产学会 2 nt
+中国水利学会 5 nt
+中国汽车工业协会 2 nt
+中国汽车运动联合会 2 nt
+中国法学会 10 nt
+中国注册会计师协会 12 nt
+中国海 28 ns
+中国海专 3 nt
+中国海事 3 nt
+中国海关 46 nt
+中国海军舰艇编队 3 nt
+中国海洋石油总公司 8 nt
+中国海监总队 2 nt
+中国消费者协会 16 nt
+中国清政府 31 nt
+中国演出家协会 2 nt
+中国烟草 3 nz
+中国物理学会 25 nt
+中国环境科学学会 2 nt
+中国环境科学研究院 2 nt
+中国现代文学馆 7 nt
+中国田协 3 nt
+中国田径协会 2 nt
+中国电信 179 nt
+中国电信集团 7 nt
+中国电力企业联合会 3 nt
+中国电子商会 13 nt
+中国电子商务协会 10 nt
+中国电子技术标准化研究所 12 nt
+中国电子进出口总公司 2 nt
+中国电子音响工业协会 17 n
+中国电影家协会 5 nt
+中国电影资料馆 4 nt
+中国电影集团 2 nt
+中国电影集团公司 130 nt
+中国男女队 6 nt
+中国男子乒乓球队 2 nt
+中国男篮 195 nt
+中国男足 2 nt
+中国男队 134 nt
+中国画 245 n
+中国画展 2 nt
+中国画研究院 8 nt
+中国画系 6 nt
+中国画院 21 nt
+中国登山协会 3 nt
+中国登山队 15 nt
+中国石化集团 5 nt
+中国石油化工集团 7 nt
+中国石油化工集团公司 2 nt
+中国石油天然气集团 17 nt
+中国石油天然气集团公司 3 nt
+中国矿业 3 nt
+中国矿业大学 10 nt
+中国社会主义青年团 35 nt
+中国社会出版社 3 nt
+中国社会科学出版社 20 nt
+中国社会科学院 164 nt
+中国社会科学院哲学研究所 2 nt
+中国社会科学院文化研究中心 2 nt
+中国社会科学院民族研究所 4 nt
+中国社会科学院研究生院 9 nt
+中国社会科学院社会学研究所 3 nt
+中国社会科学院经济研究所 2 nt
+中国社会科学院美国研究所 2 nt
+中国社会科学院近代史研究所 11 nt
+中国社科院 38 nt
+中国福利会 13 nt
+中国科协 60 nt
+中国科大 3 nt
+中国科学技术协会 16 nt
+中国科学技术馆 2 nt
+中国科学院 873 nt
+中国科学院上海植物生理研究所 2 nt
+中国科学院动物研究所 4 nt
+中国科学院北京天文台 2 nt
+中国科学院学部 4 nt
+中国科学院心理研究所 8 nt
+中国科学院生物学部 2 nt
+中国科学院自动化研究所 4 nt
+中国科学院自然科学史研究所 129 nt
+中国科学院计算技术研究所 6 nt
+中国科学院近代物理研究所 9 nt
+中国科学院金属研究所 2 nt
+中国科技促进发展研究中心 2 nt
+中国科技大学 45 nt
+中国科技部 2 nt
+中国科技馆 11 nt
+中国移动 396 nt
+中国移动公司 2 nt
+中国移动通信 15 nt
+中国移动通信公司 2 nt
+中国移动通信集团 3 nt
+中国移动通信集团公司 18 nt
+中国移动集团 2 nt
+中国空军 158 nt
+中国空间技术研究院 6 nt
+中国站长 3 n
+中国第一历史档案馆 15 nt
+中国第二历史档案馆 6 nt
+中国篮协 5 nt
+中国篮球 3 nt
+中国籍 36 n
+中国红十字会 24 nt
+中国红十字会总会 7 nt
+中国红十字总会 2 nt
+中国纺织工业协会 3 nt
+中国经济时报 7 nt
+中国经贸 3 nt
+中国网民 3 n
+中国网络通信有限公司 6 nt
+中国网通 81 nt
+中国美术学院 6 nt
+中国美术家协会 65 nt
+中国美术馆 13 nt
+中国羽毛球 27 nt
+中国羽毛球女队 10 nt
+中国羽毛球队 81 nt
+中国联通 236 nt
+中国联通公司 4 nt
+中国致公党 35 nt
+中国舞蹈家协会 5 nt
+中国航天 3 nt
+中国航天科技集团 2 nt
+中国航天科技集团公司 11 nt
+中国航空学会 3 nt
+中国航空工业第一集团 3 nt
+中国航空工业第一集团公司 33 nt
+中国航空工业第二集团 2 nt
+中国船舶工业集团公司 5 nt
+中国船舶重工集团公司 4 nt
+中国艺术研究院 10 nt
+中国芯 3 nz
+中国花卉 3 n
+中国花卉协会 2 nt
+中国茶叶博物馆 4 nt
+中国茶叶研究所 3 nt
+中国西藏自治区 40 ns
+中国解放军 25 nt
+中国计算机学会 4 nt
+中国记协 2 nt
+中国证券业协会 4 nt
+中国证券监督管理委员会 88 nt
+中国证监会 265 nt
+中国象棋 3 n
+中国财政部 4 nt
+中国贫富 3 l
+中国足协 417 nt
+中国足球协会 4 nt
+中国足球队 13 nt
+中国跳水队 10 nt
+中国软件行业协会 3 l
+中国进出口银行 5 nt
+中国通 25 nt
+中国通史 3 n
+中国道教协会 7 nt
+中国邮政 3 nt
+中国野生动物保护协会 6 nt
+中国金属学会 2 nt
+中国铁路工程总公司 3 nt
+中国铁路文工团 2 nt
+中国铁道部 5 nt
+中国银联 3 nt
+中国银行 197 nt
+中国长城学会 6 nt
+中国长城资产管理公司 5 nt
+中国长江三峡工程开发总公司 4 nt
+中国队 2029 nt
+中国陶行知研究会 2 n
+中国青基会 2 nt
+中国青少年发展基金会 7 nt
+中国青少年基金会 2 nt
+中国青少年研究中心 6 nt
+中国青年出版社 7 nt
+中国青年女足 2 nt
+中国青年报 99 nt
+中国青年报社 22 nt
+中国青年政治学院 7 nt
+中国青年艺术剧院 9 nt
+中国革命军事博物馆 2 nt
+中国革命博物馆 390 nt
+中国音乐学院 8 nt
+中国音乐家协会 40 nt
+中国音乐著作权协会 3 n
+中国音协 2 nt
+中国预防医学科学院 5 nt
+中国食品工业协会 16 nt
+中国饲料 3 n
+中国馆 13 nt
+中国香港 75 ns
+中国香港地区 3 ns
+中国香港队 4 nt
+中国驴 3 n
+中国驻南使馆 4 nt
+中国驻南斯拉夫大使馆 2 nt
+中国驻埃及大使馆 10 nt
+中国驻德国使馆 2 nt
+中国驻韩国大使馆 16 nt
+中国高科 19 nz
+中图 2 ns
+中图法 3 nz
+中圈 3 nz
+中圈套 3 n
+中土 276 n
+中地 62 ns
+中场 355 n
+中坚 165 n
+中坚份子 3 n
+中坚力量 3 n
+中坜 4 ns
+中坜人 3 ns
+中坜地区 3 ns
+中坜市 2 ns
+中坝 3 ns
+中坝镇 2 ns
+中坤 3 ns
+中垂线 3 n
+中型 751 b
+中型企业 3 n
+中型公车 3 n
+中型机 3 n
+中型车 3 n
+中垦 3 n
+中城 13 ns
+中堂 348 ns
+中士 44 ns
+中备 12 n
+中夏 3 ns
+中外 1846 f
+中外代 3 n
+中外关系 3 l
+中外历史 3 n
+中外古今 6 l
+中外合作 3 l
+中外合璧 3 n
+中外合资 114 l
+中外文 14 nz
+中外杂志 3 n
+中外比 3 j
+中外观众 3 nt
+中外记者 3 n
+中外运 13 j
+中外驰名 3 i
+中大 335 nt
+中大奖 3 nz
+中大通 5 nz
+中天 113 t
+中天恒 3 nr
+中央 15954 n
+中央乐团 26 nt
+中央书记处 211 nt
+中央人民广播电台 74 nt
+中央人民政府 2434 nt
+中央人民政府政务院 49 nt
+中央信托 3 n
+中央党 40 nt
+中央党史研究室 2 nt
+中央党校 110 nt
+中央党部 3 nt
+中央全会 3 nt
+中央公园 3 nt
+中央军 51 nt
+中央军事委员会 1017 nt
+中央军委 748 nt
+中央办公厅 63 nt
+中央区 19 nt
+中央台 32 nt
+中央商务区 3 nt
+中央团校 3 nt
+中央图书 3 n
+中央处理 3 n
+中央处理器 68 nt
+中央外办 4 nt
+中央大学 170 nt
+中央大街 4 ns
+中央委员 461 n
+中央委员会 772 nt
+中央实验话剧院 2 nt
+中央宣传部 35 nt
+中央对外联络部 2 nt
+中央尖 3 n
+中央局 113 nt
+中央山脉 3 ns
+中央工艺美术学院 9 nt
+中央常委 3 nt
+中央广播事业局 2 nt
+中央广播电台 6 nt
+中央广播电视大学 5 nt
+中央广播说唱团 4 nt
+中央情报 3 nt
+中央情报部 6 nt
+中央戏剧 3 n
+中央戏剧学院 39 nt
+中央政府 448 nt
+中央政治局 761 nt
+中央政治局常委 231 nt
+中央政治局常委会 18 nt
+中央政法委员会 7 nt
+中央政策研究室 9 nt
+中央教科所 5 nt
+中央文件 2 n
+中央文史研究馆 4 nt
+中央文史馆 3 nt
+中央文明办 4 nt
+中央文献 3 n
+中央文献出版社 2 nt
+中央新村 3 ns
+中央新闻纪录电影制片厂 2 nt
+中央日报 3 nt
+中央标准 3 n
+中央档案馆 14 nt
+中央歌剧芭蕾舞剧院 3 nt
+中央歌剧院 7 nt
+中央民族乐团 4 nt
+中央民族大学 19 nt
+中央民族学院 14 nt
+中央气象台 56 nt
+中央气象局 4 nt
+中央电大 3 nt
+中央电视台 495 nt
+中央电视台文艺中心 2 nt
+中央直属机关 2 ns
+中央研究院 182 nt
+中央社 3 nt
+中央社会主义学院 2 nt
+中央社会治安综合治理委员会 3 nt
+中央税 5 j
+中央空调 3 n
+中央窝 3 ns
+中央红军 183 nt
+中央级 9 b
+中央纪委 38 nt
+中央纪律检查委员会 220 nt
+中央组织部 27 nt
+中央细胞 3 n
+中央经线 3 nt
+中央统战部 8 nt
+中央编译出版社 4 nt
+中央美术学院 71 nt
+中央美院 8 nt
+中央芭蕾舞团 3 nt
+中央苏区 77 nt
+中央视觉 3 n
+中央警卫团 3 nt
+中央警卫局 3 nt
+中央警官 3 n
+中央财政 3 nt
+中央财经 3 j
+中央通讯 3 nt
+中央邦 13 nt
+中央酒店 3 nt
+中央银行 178 nt
+中央集权 463 n
+中央革命军事委员会 39 nt
+中央革命根据地 116 ns
+中央音乐 3 nt
+中央音乐学院 45 nt
+中央音乐学院附中 3 nt
+中央顾问委员会 150 nt
+中央预算 3 n
+中头 3 ns
+中奖 166 nz
+中奖人 2 n
+中奖号码 3 n
+中奖率 6 n
+中奖者 3 n
+中套 13 nz
+中委 5 nt
+中子 425 n
+中子弹 26 n
+中子态 3 n
+中子星 58 nz
+中子流 4 n
+中子源 3 n
+中子通量 3 n
+中学 8338 n
+中学化学 3 nt
+中学教师 3 nt
+中学数学 3 nt
+中学校园 3 n
+中学校长 3 n
+中学毕业 3 n
+中学物理 3 n
+中学生 385 n
+中学生物 3 nt
+中学老师 3 n
+中学英语 3 nz
+中学西用 3 nt
+中学语文 3 nz
+中学部 4 nt
+中学阶段 3 n
+中宁 7 ns
+中宁县 5 ns
+中宇 3 nz
+中安网 3 nz
+中实 31 n
+中客 3 n
+中宣部 172 nt
+中宣部宣教局 4 nt
+中密度 777 ns
+中富 38 nz
+中寮 3 ns
+中导 3 n
+中封 3 ns
+中将 763 n
+中将汤 3 n
+中尉 135 n
+中尉军官 3 nr
+中小 587 j
+中小企业 716 j
+中小医院 4 nt
+中小型 194 b
+中小型机 3 n
+中小城市 56 j
+中小城镇 24 j
+中小学 1032 j
+中小学校 58 j
+中小学生 210 j
+中小板 3 n
+中小银行 3 j
+中少社 4 nt
+中尺度 15 ns
+中尼公路 9 ns
+中尾 3 ns
+中局 3 j
+中层 405 n
+中层干部 3 n
+中层阶级 3 b
+中居 89 ns
+中居正广 3 nz
+中山 1117 ns
+中山东路 3 ns
+中山公园 1184 ns
+中山北路 7 ns
+中山医 3 n
+中山医学 3 nt
+中山医学院 2 nt
+中山医科大学 3 nt
+中山南路 3 ns
+中山堂 519 ns
+中山大学 192 nt
+中山大学哲学系 3 nt
+中山大道 3 ns
+中山太郎 6 ns
+中山市 97 ns
+中山服 6 nz
+中山楼 3 ns
+中山狼 42 ns
+中山王 29 nz
+中山秀征 3 ns
+中山站 21 ns
+中山纪念中学 2 nt
+中山纪念堂 10 ns
+中山网 3 nz
+中山美穗 3 nz
+中山舰 3 nt
+中山装 60 nz
+中山西路 7 ns
+中山路 287 ns
+中山门 3 ns
+中山陵 56 ns
+中山陵园 3 ns
+中山音乐堂 4 nt
+中岛 27 ns
+中岛宏 8 ns
+中岛美雪 3 n
+中岭雄 3 ns
+中岳 25 ns
+中峰 14 ns
+中崇仰 3 nr
+中川 15 ns
+中州 101 ns
+中州工专 3 nt
+中州韵 3 nr
+中巴 68 ns
+中巴关系 3 nt
+中巴车 13 ns
+中师 22 nt
+中师文化 3 nt
+中常 365 b
+中常会 12 nt
+中幔 3 n
+中幡 3 n
+中平 56 ns
+中年 1026 t
+中年人 434 n
+中年夫妇 3 n
+中年妇女 3 n
+中年期 3 t
+中年武师 3 nt
+中年男人 3 l
+中年男子 3 l
+中年级 3 b
+中广 3 nz
+中广公司 3 nt
+中广网 3 nz
+中庆 6 ns
+中府 3 n
+中度 82 ns
+中度锓 3 nr
+中度颱风 3 vn
+中庭 3 ns
+中庶子 4 n
+中庸 179 nrt
+中庸之道 79 l
+中庸思想 3 i
+中建 291 ns
+中建岛 12 ns
+中式 226 n
+中式服装 3 l
+中式盐 3 n
+中弹 193 n
+中彩 8 nz
+中彩网 3 nz
+中影 14 n
+中影集团 2 nt
+中微子 92 n
+中德 3 ns
+中德关系 3 nt
+中心 23969 n
+中心主义 21 n
+中心代数 3 n
+中心列 3 ns
+中心动词 3 n
+中心化 6 j
+中心区 60 ns
+中心区位 3 n
+中心医院 3 nt
+中心原子 3 n
+中心地带 3 n
+中心地段 3 n
+中心对称 3 n
+中心小学 3 j
+中心局 8 nt
+中心广场 3 ns
+中心店 3 ns
+中心思想 15 i
+中心摇摇 3 i
+中心是悼 3 v
+中心校 4 n
+中心法则 3 n
+中心注水 3 n
+中心点 32 n
+中心环节 3 l
+中心球 3 n
+中心盲 3 n
+中心矩 3 n
+中心社 3 nt
+中心站 11 n
+中心粒 3 n
+中心线 21 n
+中心组 28 n
+中心角 3 n
+中心论 40 n
+中心诊所 3 n
+中心词 11 n
+中心语 2 nz
+中心质 3 n
+中心镇 7 ns
+中怡康 6 nr
+中性 468 n
+中性人 3 n
+中性化 3 n
+中性区 3 n
+中性名词 3 n
+中性平衡 3 nz
+中性染料 3 n
+中性溶剂 3 nz
+中性点 12 n
+中性盐 3 n
+中性碱基 3 nz
+中性笔 3 n
+中性线 3 n
+中性词 3 n
+中情 3 n
+中情局 16 nt
+中意 96 n
+中慧 10 n
+中慧格 2 nr
+中戏 9 nt
+中成 25 nz
+中成药 142 nz
+中房 3 n
+中所 3 j
+中承式 3 n
+中技 13 nz
+中投 40 j
+中报 23 nz
+中拇指 2 n
+中招 29 j
+中招办 4 v
+中括号 10 nz
+中拳 3 nz
+中指 374 j
+中捷 4 nz
+中排 16 j
+中控台 3 nt
+中控室 3 nz
+中控锁 3 nz
+中提琴 29 n
+中提琴手 3 n
+中支 3 ns
+中放 53 nt
+中散 32 j
+中文 1755 nz
+中文之家 3 l
+中文之星 3 nz
+中文书库 3 nz
+中文信息 3 nt
+中文信息处理 2 l
+中文包 3 n
+中文台 3 nt
+中文名 40 n
+中文名称 3 n
+中文字体 3 n
+中文字幕 3 n
+中文学校 3 nt
+中文实名 3 l
+中文平台 3 ns
+中文搜索 3 nr
+中文数字 3 n
+中文机 3 n
+中文标点 3 n
+中文歌曲 3 ns
+中文歌词 3 l
+中文版 77 nz
+中文电脑 3 nt
+中文系 147 nt
+中文系统 3 l
+中文网 3 nz
+中文网址 3 n
+中文网站 3 nt
+中文翻译 3 l
+中文舞曲 3 n
+中文论坛 3 n
+中文邮 3 ns
+中文键盘 3 n
+中断 917 ns
+中断向量 3 n
+中断点 3 n
+中断请求 3 n
+中断过程 3 l
+中新 3 ns
+中新世 99 j
+中新社 155 nt
+中新网 532 nz
+中方 1408 f
+中方县 3 ns
+中旅 132 j
+中旅总社 46 nt
+中旗 15 ns
+中日 1005 t
+中日关系 3 nz
+中日友好医院 24 nt
+中日友好协会 3 nt
+中日合作 3 ns
+中日战争 3 nz
+中日甲午 3 n
+中日词典 3 n
+中日韩 3 ns
+中旬 922 t
+中时 91 t
+中时晚报 3 nz
+中明兄 3 n
+中明器 2 n
+中易 23 n
+中星 445 nz
+中星仪 9 nz
+中星微 4 b
+中晚唐 11 j
+中晚期 93 j
+中晟泰 2 nr
+中景 10 n
+中暑 91 t
+中曾 219 nrt
+中曾根 3 nr
+中曾根康弘 4 nr
+中服 14 n
+中朝 3 t
+中期 2169 t
+中期基因 3 n
+中期贷款 3 n
+中杏 4 n
+中材 3 n
+中村 14 ns
+中村俊辅 4 nr
+中村克己 3 nr
+中村正雄 4 nr
+中条 4 ns
+中条山 77 ns
+中杰 3 n
+中板 11 n
+中极 3 ns
+中林 2 ns
+中果皮 7 n
+中枢 764 n
+中枢性 20 n
+中枢神经 301 l
+中枢系统 3 l
+中枢论 3 n
+中枪 3 n
+中柱 3 n
+中柱原 3 ns
+中柱鞘 3 n
+中标 127 n
+中标人 3 n
+中标率 3 n
+中标者 4 n
+中栏 3 ns
+中校 102 j
+中核总 2 b
+中格 3 ns
+中桅 3 n
+中档 29 b
+中档车 3 nt
+中桥 18 ns
+中梁 3 ns
+中楷 3 n
+中楼 3 ns
+中横框 3 n
+中欣队 6 nr
+中欧 226 ns
+中欧国家 3 n
+中欧国际工商学院 7 nt
+中欧地区 3 ns
+中止 265 v
+中止执行 3 n
+中止犯罪 3 l
+中正 166 nz
+中正厅 3 nt
+中正国中 3 nz
+中正国小 3 b
+中正无私 3 i
+中正机场 3 n
+中正理工 3 nz
+中正路 3 nz
+中段 827 n
+中毒 1379 nz
+中毒事件 3 n
+中毒已深 3 l
+中毒者 41 n
+中比 3 j
+中比关系 3 l
+中气 3 n
+中气不足 3 i
+中水 75 ns
+中汇 25 ns
+中江 19 ns
+中江县 3 ns
+中江村 3 ns
+中沙 3 ns
+中沙群岛 3 ns
+中沙镇 2 ns
+中河 31 ns
+中河失舟 3 i
+中油 26 n
+中油气 2 nt
+中油网 3 nt
+中泉 3 ns
+中法 3 nt
+中法关系 3 nt
+中法战争 3 nz
+中法网 3 nz
+中法词典 3 n
+中波 35 ns
+中波段 3 n
+中波长 3 n
+中注协 3 nt
+中泰 5 nz
+中泰关系 3 nt
+中泽 4 ns
+中洲 772 ns
+中洲子 2 nt
+中派 3 n
+中流 78 n
+中流一壶 3 n
+中流一壸 3 v
+中流击楫 3 n
+中流底柱 3 ns
+中流砥柱 343 i
+中浩 18 nz
+中海 136 ns
+中海油 3 nt
+中消协 22 nt
+中淋溶 2 nz
+中渎 3 v
+中渚 3 ns
+中温动物 3 n
+中港 28 ns
+中港台 3 nt
+中港城 3 ns
+中港溪 3 ns
+中游 1019 f
+中游网 3 nz
+中演 6 nz
+中火 3 n
+中灶 5 n
+中炬高新 9 nz
+中点 29 n
+中点站 3 nt
+中焦 33 n
+中煤 5 nt
+中煤网 3 nz
+中爪哇 14 nrt
+中牟 27 ns
+中牟县 13 ns
+中物 19 n
+中特网 3 nz
+中环 32 ns
+中环线 2 nz
+中班 4 ns
+中生 3 nt
+中生代 239 t
+中生植物 3 j
+中用 209 n
+中田 24 ns
+中田英寿 21 ns
+中电 23 nt
+中电投 3 nt
+中电联 3 nt
+中电集团 6 nt
+中男 3 nt
+中甸 13 ns
+中甸县 11 ns
+中界岭 3 nz
+中百 24 nz
+中的菜 3 n
+中盘 71 n
+中盘商 3 n
+中盘股 3 n
+中直 60 j
+中直人 3 n
+中直工委 8 nt
+中直机关 39 ns
+中省 3 ns
+中省地 3 ns
+中着丝 3 nz
+中短 7 j
+中短期 6 j
+中短波 2 n
+中短程 18 b
+中短篇 11 b
+中短途 11 b
+中石 2 ns
+中石化 141 j
+中石化集团 2 nt
+中石器时代 29 t
+中石没矢 3 i
+中矿 5 n
+中研 2 nt
+中研院 4 nt
+中硬地层 3 j
+中碳钢 9 n
+中秋 163 t
+中秋佳节 3 nr
+中秋月 3 t
+中秋月饼 3 nz
+中秋节 133 t
+中科 61 ns
+中科健 9 nz
+中科大 56 j
+中科委 3 nt
+中科院 246 nt
+中科院动物所 2 nt
+中科院动物研究所 2 nt
+中科院计算所 3 nt
+中程 259 n
+中程导弹 3 n
+中程计划 3 n
+中程飞弹 3 n
+中稻 12 n
+中空 124 n
+中空板 3 n
+中空玻璃 3 nt
+中立 406 b
+中立不倚 3 i
+中立主义 4 n
+中立区 3 ns
+中立国 75 ns
+中立国家 3 n
+中立地区 3 ns
+中立地带 3 n
+中立性 3 n
+中立政策 3 n
+中立派 3 n
+中站 3 ns
+中站区 3 ns
+中等 1630 b
+中等专业 3 l
+中等偏上 9 l
+中等城市 3 n
+中等学校 23 nt
+中等教育 85 l
+中等水平 3 n
+中等生 3 b
+中等职业 3 n
+中等舱 3 n
+中等量 8 n
+中策 28 n
+中签号 3 n
+中签率 3 n
+中箭 3 nt
+中箭落马 3 n
+中篇 44 b
+中篇小说 160 l
+中粮 14 j
+中粮可口可乐饮料有限公司 2 l
+中纤板 3 n
+中级 874 b
+中级人民 3 n
+中级会计 3 l
+中级品 3 n
+中级工 6 nt
+中级法院 3 nt
+中级班 3 n
+中级职称 3 n
+中级车 3 nt
+中级轿车 3 n
+中纪委 71 nt
+中纬 3 b
+中纬度 58 n
+中纺 1418 j
+中纽 3 n
+中纽关系 3 nt
+中线 377 n
+中线发球 3 n
+中组部 90 nt
+中经 51 nt
+中经网 3 nz
+中统 275 n
+中统钞 13 n
+中继 80 nz
+中继器 6 nz
+中继站 32 nz
+中继线 4 nz
+中继者 3 n
+中缀 3 n
+中编办 3 nt
+中缝 8 n
+中缝大核 3 n
+中缝核 3 n
+中网 3 nz
+中置 3 n
+中置同轴 3 nz
+中美 3 ns
+中美关系 3 nt
+中美史克 6 ns
+中美合作 3 ns
+中美商贸联委会 3 nt
+中美州 3 ns
+中美洲 293 ns
+中美洲地区 12 ns
+中群伦 2 ns
+中群豪 7 nr
+中老年 72 j
+中老年人 69 n
+中考 118 ns
+中考题 3 n
+中耕 29 nr
+中耳 42 n
+中耳炎 52 nz
+中职 57 n
+中联 71 ns
+中联部 80 nt
+中联重科 34 j
+中肯 64 nz
+中胚层 3 n
+中胚质层 3 n
+中胡 3 ns
+中能 305 j
+中能队 3 nt
+中脑 56 n
+中脘 3 n
+中腹 18 n
+中腹之战 3 i
+中膂俞 3 nr
+中航 42 j
+中航技 26 nt
+中航油 13 nt
+中航第二集团公司 6 nt
+中船 22 n
+中苏 3 ns
+中苏关系 3 nt
+中苑 2 ns
+中英 3 nz
+中英两国 3 j
+中英关系 3 n
+中英对照 3 n
+中英文 57 nz
+中英街 3 ns
+中英词典 3 n
+中草药 123 nt
+中草药材 18 nz
+中药 1106 n
+中药厂 3 nt
+中药味 6 nz
+中药学 22 nt
+中药店 11 nt
+中药房 3 n
+中药方 3 nz
+中药材 144 n
+中药铺 7 nz
+中药饮片 3 n
+中莹然 2 nr
+中菜 3 n
+中菲 3 ns
+中营 3 ns
+中落 3 n
+中葡 3 n
+中葯 3 vn
+中藏 114 ns
+中融通 3 nz
+中行 347 j
+中街 81 ns
+中表 10 nz
+中装 24 nt
+中裤 3 n
+中西 330 ns
+中西亚 5 ns
+中西关系 3 nt
+中西区 2 ns
+中西医 119 j
+中西合壁 3 ns
+中西合并 3 n
+中西合璧 9 ns
+中西和璧 3 ns
+中西思想 3 n
+中西文 3 nz
+中西文化 3 ns
+中西方 26 f
+中西药 10 nt
+中西药业 2 nz
+中西词典 3 n
+中西部 294 nt
+中西餐 5 j
+中观 55 n
+中规中矩 38 l
+中视 25 j
+中视公司 3 nt
+中觉 3 n
+中计 37 v
+中讯 8 nz
+中论 3 n
+中证报 3 nt
+中证网 3 nt
+中词 5 n
+中译本 96 n
+中译英 3 nr
+中试 22 j
+中试厂 3 n
+中诚信 4 j
+中谷 3 ns
+中负载 2 b
+中财网 3 nt
+中资 93 n
+中资企业 6 j
+中资股 3 n
+中资银行 3 nt
+中超杯 3 ns
+中超联赛 3 ns
+中越 3 ns
+中越关系 3 b
+中越国界 3 n
+中距离 71 n
+中路 1020 ns
+中路梆子 6 n
+中转 110 v
+中转地 6 n
+中转港 7 n
+中转站 67 n
+中软 11 nt
+中轴 70 nz
+中轴线 1243 nz
+中辍 5 v
+中辰 3 n
+中达 6 ns
+中运河 29 ns
+中近东 3 nt
+中近程 7 n
+中远 58 ns
+中远期 3 b
+中远队 3 nt
+中选 114 j
+中选优 3 n
+中选会 3 n
+中途 587 b
+中途下车 3 l
+中途岛 3 n
+中途站 3 n
+中途辍学 3 vn
+中通外直 3 j
+中速 19 n
+中道 612 ns
+中道而废 3 i
+中邦队 3 nt
+中邪 17 n
+中郎 3 ns
+中郎将 114 n
+中部 5299 f
+中部肋骨 3 l
+中都 3 ns
+中都之战 3 nz
+中采莲 2 nr
+中重型 5 nz
+中重度 2 n
+中野 16 ns
+中量 3 n
+中量级 3 b
+中金 30 n
+中金公司 5 nt
+中钢 2 nt
+中钨高新 33 nz
+中铁 66 n
+中铁二局 3 nt
+中银 34 nz
+中银国际 22 nt
+中铺 8 ns
+中锋 168 n
+中键 3 n
+中长 73 n
+中长大衣 3 nz
+中长期 164 j
+中长波 3 ns
+中长篇 3 b
+中长线 28 j
+中长跑 24 ns
+中长距离 8 n
+中长途 17 b
+中长铁路 3 nz
+中门 3 ns
+中间 6547 f
+中间业务 3 n
+中间人 77 n
+中间代码 3 n
+中间件 74 n
+中间价 48 n
+中间体 419 n
+中间品 2 n
+中间商 30 n
+中间层 19 n
+中间性 3 n
+中间性格 3 n
+中间方 3 n
+中间桥基 3 nz
+中间派 83 n
+中间状态 3 n
+中间环节 3 nz
+中间级 3 n
+中间线 3 nz
+中间色 3 n
+中间色律 3 n
+中间视觉 3 n
+中间设备 3 n
+中间语 3 nz
+中间轴 5 nz
+中队 781 n
+中队长 57 n
+中阮 3 nr
+中阳 304 ns
+中阳县 5 ns
+中院 52 j
+中集 14 nt
+中集集团 5 nt
+中雨 149 n
+中雪 2 ns
+中青 20 nt
+中青年 166 j
+中青报 3 nt
+中青旅 75 j
+中青班 2 ns
+中青网 3 nt
+中青队 5 nt
+中静修 2 nr
+中非 158 ns
+中非共和国 31 ns
+中非国家 3 l
+中非地区 5 ns
+中非政府 4 nt
+中非金融合作法郎 3 l
+中革军委 18 nt
+中靶 3 n
+中韩 3 ns
+中韩关系 3 nt
+中韩词典 3 nr
+中韩镇 2 ns
+中音 24 n
+中音部 3 nt
+中顾委 15 nt
+中频 45 b
+中风 139 ns
+中风病 3 n
+中餐 43 n
+中餐厅 7 n
+中餐馆 17 n
+中饭 28 n
+中饭时 3 ns
+中饱 3 nz
+中饱私囊 23 i
+中馈乏人 3 n
+中馈犹虚 3 n
+中马 3 ns
+中高 43 ns
+中高层 52 b
+中高档 40 b
+中高级 88 b
+中高音 3 nz
+中魁 3 n
+中魔 3 n
+中鲁 2 ns
+中鸿网 3 nz
+中黄 3 ns
+中齿 3 n
+中龄林 3 ns
+中龙 9 ns
+丰 784 a
+丰业 3 nz
+丰丽 2 a
+丰义 2 nz
+丰乐 36 a
+丰乐镇 3 nr
+丰九域 5 nr
+丰乳 8 nz
+丰产 567 n
+丰产林 3 nz
+丰产田 3 nz
+丰亨豫大 3 nr
+丰伟 2 a
+丰体 13 a
+丰俭 3 a
+丰利 4 a
+丰功 2 a
+丰功伟业 9 l
+丰功伟绩 69 nr
+丰功传绩 3 n
+丰功厚利 3 i
+丰功大业 3 i
+丰功懿德 3 nr
+丰功盛烈 3 i
+丰功硕德 3 nr
+丰功茂德 3 nr
+丰华 3 nz
+丰南 9 ns
+丰南区 3 ns
+丰南县 3 ns
+丰厚 402 a
+丰原 23 ns
+丰原市 3 ns
+丰县 29 ns
+丰取刻与 3 i
+丰台 98 ns
+丰台区 46 ns
+丰台站 3 nz
+丰城 17 ns
+丰城市 3 ns
+丰塔纳 4 nr
+丰塞卡 9 nr
+丰墙峭阯 3 i
+丰墙硗下 3 vn
+丰壤 3 ns
+丰太郎 2 nr
+丰姿 30 a
+丰姿冶丽 3 nr
+丰姿绰约 6 i
+丰威汉 2 nr
+丰子恺 31 nr
+丰宁 15 nr
+丰宁县 4 ns
+丰宁满族自治县 4 ns
+丰实 2 a
+丰容靓饰 3 nr
+丰寄禄 3 nr
+丰富 11867 a
+丰富充裕 3 nr
+丰富化 5 nr
+丰富含义 3 nr
+丰富多彩 355 i
+丰富多采 60 i
+丰富性 32 nr
+丰富除子 3 nz
+丰屋之戒 3 i
+丰屋之祸 3 i
+丰屋之过 3 i
+丰屋延灾 3 i
+丰屋生灾 3 i
+丰屋蔀家 3 ns
+丰岛 10 ns
+丰川卫 2 nr
+丰川悦 2 nr
+丰川悦司 3 nr
+丰州 11 ns
+丰州滩 9 ns
+丰干 2 a
+丰年 64 nr
+丰年祭 3 l
+丰年稔岁 3 vn
+丰年虫 10 nz
+丰度 66 a
+丰度翩翩 3 i
+丰张真人 2 i
+丰微微 2 nr
+丰德寺 2 nr
+丰心 6 a
+丰意 3 a
+丰收 395 v
+丰收在忘 3 i
+丰收在望 3 i
+丰收年 19 n
+丰收期 2 n
+丰林 9 nz
+丰标不凡 3 l
+丰桥 2 nz
+丰水 12 nr
+丰水年 3 nr
+丰水期 44 nz
+丰江 9 ns
+丰沙 3 ns
+丰沙尔 2 nr
+丰沛 116 a
+丰泰 5 nz
+丰泽 4 nr
+丰泽区 3 nr
+丰泽园 11 nr
+丰润 39 a
+丰润区 3 nr
+丰润县 2 nr
+丰溪 3 nr
+丰满 281 a
+丰满区 3 nr
+丰满度 3 nr
+丰满水库 7 nz
+丰滦密 2 nr
+丰滨 3 ns
+丰特 2 a
+丰璋王子 2 nr
+丰田 156 nz
+丰田佐吉 4 nr
+丰田佳美 3 nr
+丰田公司 6 nt
+丰田市 3 ns
+丰田悦司 3 nr
+丰田杯 3 nz
+丰田汽车公司 7 nt
+丰登 4 nr
+丰盈 30 a
+丰盛 244 a
+丰真人 2 nr
+丰硕 146 a
+丰硕成果 3 nr
+丰碑 48 nz
+丰神 2 nz
+丰神俊 3 nr
+丰神异彩 3 i
+丰神绰约 3 i
+丰神隽 4 nr
+丰秀 2 a
+丰科城 3 nr
+丰稔 17 a
+丰筋多力 3 nz
+丰美 193 a
+丰联广场 2 ns
+丰肌弱骨 3 i
+丰肌秀骨 3 i
+丰胸 3 n
+丰胸丸 3 nr
+丰腴 63 a
+丰臣氏 2 nr
+丰臣秀 124 nr
+丰臣秀吉 3 nr
+丰茂 47 a
+丰草 3 nz
+丰草长林 3 nz
+丰衣足食 18 i
+丰裕 22 a
+丰西泽 4 nr
+丰豫之 128 nr
+丰赡 4 n
+丰足 28 a
+丰达 6 a
+丰邑坪 2 nr
+丰都 39 ns
+丰都县 8 ns
+丰采 31 a
+丰镇 8 ns
+丰镇厅 2 nr
+丰镇市 6 ns
+丰韵 8 a
+丰顺 5 nz
+丰顺县 3 nr
+丰饶 65 a
+丰饶丰足 3 ns
+丰骨劲 2 nr
+丰鸿门 2 nr
+串 971 v
+串上去 3 v
+串上来 3 v
+串串 3 n
+串串香 3 n
+串亲戚 2 n
+串亲访友 3 n
+串休 3 v
+串会 3 v
+串供 2 v
+串儿 6 n
+串出来 3 v
+串列 3 v
+串口 16 vn
+串口卡 3 ns
+串口线 3 n
+串台 3 v
+串号 3 n
+串味 4 n
+串味儿 3 v
+串场 8 n
+串场河 9 n
+串城 3 ns
+串子 9 n
+串家走巷 3 i
+串家走户 3 i
+串岗 3 ns
+串并口 3 i
+串并联 3 j
+串成 3 v
+串户 3 n
+串换 3 v
+串接 3 v
+串改 3 v
+串气 3 n
+串流 3 n
+串游 3 vn
+串演 6 v
+串烧 2 v
+串烧版 3 n
+串珠 317 n
+串线 3 n
+串联 193 ns
+串联体 3 n
+串联共振 3 l
+串联式 7 n
+串联探针 3 n
+串联端接 3 i
+串联词 3 n
+串联酶 3 n
+串联阻尼 3 n
+串行 32 v
+串行化 3 n
+串行口 3 n
+串行总线 4 n
+串行接口 6 n
+串街 3 ns
+串讲 23 v
+串讲班 3 n
+串话 2 v
+串谋 9 n
+串起 3 v
+串连 80 v
+串通 113 vn
+串通一气 12 i
+串铃 9 n
+串门 98 n
+串门儿 7 n
+串门子 6 n
+串音 3 n
+串骗 3 v
+丳 22 zg
+临 2810 v
+临事而惧 3 i
+临产 41 b
+临产前 3 b
+临产时 3 b
+临人 3 b
+临刑 37 v
+临利 3 ns
+临别 93 v
+临别依依 3 ns
+临别时 3 ns
+临别赠言 3 n
+临别赠语 3 n
+临到 117 v
+临危 103 v
+临危不惧 18 i
+临危不挠 3 i
+临危不顾 3 i
+临危受命 3 i
+临危授命 6 i
+临危时 3 i
+临危致命 3 i
+临去 3 v
+临去秋波 3 i
+临县 13 ns
+临场 118 n
+临场发挥 64 v
+临场感 3 v
+临场经验 3 n
+临城 36 ns
+临城县 2 ns
+临城镇 2 ns
+临夏 41 ns
+临夏县 5 ns
+临夏回族自治州 10 ns
+临夏州 3 ns
+临夏市 9 ns
+临头 249 b
+临安 417 ns
+临安县 15 ns
+临安市 11 ns
+临客 47 v
+临崖勒马 3 ns
+临川 59 ns
+临川区 3 ns
+临川县 2 ns
+临川市 11 ns
+临川羡鱼 3 i
+临帖 18 n
+临幸 22 v
+临床 2472 vn
+临床冠 3 i
+临床医学 3 l
+临床学 3 l
+临床学科 2 nz
+临床实践 3 l
+临床实验 3 l
+临床意义 3 i
+临床教学 3 l
+临床法 3 n
+临床用 6 l
+临床经验 3 n
+临床药理 3 n
+临床表现 3 i
+临床试验 3 n
+临床部 2 n
+临建 9 ns
+临快 3 v
+临战 65 v
+临战状态 3 l
+临拼 3 v
+临摹 98 v
+临敌卖阵 3 i
+临敌易将 3 i
+临文不讳 3 i
+临时 4483 b
+临时中央政治局 25 nt
+临时代办 17 nz
+临时准备 3 l
+临时动议 3 n
+临时工 78 n
+临时性 104 b
+临时抱佛 3 i
+临时政府 3 nt
+临时文件 17 l
+临时演员 3 l
+临时许可 3 i
+临时费用 3 n
+临朐 17 ns
+临朐县 3 ns
+临朝 79 n
+临期 3 b
+临末 3 ns
+临机 3 b
+临机应变 10 i
+临村 3 ns
+临桂 7 nrt
+临桂县 10 ns
+临检 3 v
+临武 3 ns
+临武县 2 ns
+临死 493 v
+临死前 3 i
+临死时 3 i
+临水 3 ns
+临水登山 3 ns
+临江 106 ns
+临江仙 11 ns
+临江会 3 nt
+临江市 3 ns
+临江楼 5 ns
+临江镇 2 ns
+临江门 4 ns
+临池 5 ns
+临池学书 3 n
+临汾 165 ns
+临汾地区 2 ns
+临汾市 11 ns
+临汾路 3 ns
+临沂 132 ns
+临沂人 3 n
+临沂市 32 ns
+临沐 3 v
+临沐县 3 l
+临沧 32 ns
+临沧县 4 ns
+临沧地区 5 ns
+临沧市 3 ns
+临沭 2 ns
+临沭县 7 ns
+临河 39 ns
+临河区 3 ns
+临河地区 3 ns
+临河市 5 ns
+临河羡鱼 3 l
+临泉 4 ns
+临泉县 5 ns
+临泣 6 v
+临泽 8 ns
+临泽县 3 ns
+临津 10 ns
+临津江 6 ns
+临洮 59 ns
+临洮县 9 ns
+临济 3 n
+临海 93 ns
+临海人 2 nrt
+临海地区 3 ns
+临海市 10 ns
+临涧 2 ns
+临淄 125 ns
+临淄区 7 ns
+临淄王 4 nrt
+临深履薄 2 i
+临清 117 b
+临清市 5 ns
+临渊 3 ns
+临渊履薄 3 i
+临渊羡鱼 3 l
+临渭区 3 ns
+临港 9 ns
+临渴掘井 3 i
+临渴气井 3 i
+临渴穿井 3 i
+临湖 3 ns
+临湖地区 3 ns
+临湖轩 3 nz
+临湘 15 ns
+临湘县 3 ns
+临湘市 2 ns
+临溪 3 ns
+临漳 32 ns
+临漳县 10 ns
+临潭 15 ns
+临潭县 3 ns
+临潼 87 ns
+临潼区 6 ns
+临潼县 18 ns
+临潼斗宝 3 ns
+临澧 21 ns
+临澧县 6 v
+临猗 12 ns
+临猗县 11 ns
+临画 3 v
+临界 304 b
+临界乳光 3 n
+临界体积 3 n
+临界值 9 l
+临界功率 3 b
+临界半径 3 n
+临界压 3 b
+临界压力 3 nz
+临界参量 3 l
+临界态 3 n
+临界指数 3 nz
+临界日长 3 nz
+临界暗期 3 n
+临界期 3 b
+临界波长 3 n
+临界温度 3 n
+临界点 43 n
+临界物质 3 n
+临界状态 3 l
+临界现象 3 n
+临界盐度 3 ns
+临界角 4 nz
+临界距离 3 n
+临界边 3 b
+临界阻尼 3 nz
+临界频率 3 nz
+临盆 16 ns
+临盆时 3 ns
+临眺 3 v
+临睡 3 v
+临睡前 3 n
+临睡时 3 n
+临立会 11 n
+临管会 3 nt
+临终 337 d
+临终关怀 3 i
+临终前 3 i
+临终时 3 i
+临翔区 3 ns
+临考 3 v
+临行 158 v
+临街 87 ns
+临街房 3 ns
+临街面 4 i
+临西 2 ns
+临西县 2 ns
+临视 3 b
+临证指南 3 ns
+临财不苟 3 i
+临走 382 v
+临走前 3 b
+临走时 3 b
+临近 607 v
+临近联想 3 i
+临邑 13 ns
+临邑县 5 ns
+临门 40 ns
+临门一脚 3 i
+临阵 123 v
+临阵磨刀 3 i
+临阵磨枪 14 l
+临阵脱逃 45 i
+临阵逃脱 3 nz
+临难 3 b
+临难不恐 3 i
+临难不惧 3 i
+临难不避 3 l
+临难无慑 3 n
+临难苟免 3 i
+临难铸兵 3 l
+临震 12 n
+临靠 3 v
+临靠着 3 v
+临颍 20 nrt
+临颍县 4 ns
+临颖 3 i
+临颖县 3 n
+临风 26 v
+临风对月 3 i
+临高 6 v
+临高县 7 ns
+丶 40 zg
+丸 859 zg
+丸剂 27 n
+丸子 74 n
+丸散膏丹 3 n
+丸泥封关 3 n
+丸药 104 n
+丸药盒 3 n
+丸髻 3 n
+丹 2594 ns
+丹下 5 ns
+丹丘 14 ns
+丹东 182 ns
+丹东市 59 ns
+丹东港 6 ns
+丹丹 3 ns
+丹书白马 3 nr
+丹书铁券 7 nt
+丹书铁契 3 nr
+丹井 19 ns
+丹伯 2 ns
+丹佛 23 nr
+丹佛市 3 ns
+丹佛掘金 3 n
+丹佛斯 3 nr
+丹凤 26 nr
+丹凤县 4 nr
+丹凤朝阳 7 nr
+丹凤眼 27 nr
+丹剧 3 n
+丹化 6 ns
+丹参 85 nr
+丹参滴丸 3 n
+丹参片 9 n
+丹参酮 3 n
+丹吉尔 18 nr
+丹器 6 n
+丹埃 2 ns
+丹墀 152 nr
+丹妮丝 3 nr
+丹妮尔 3 nr
+丹宁 2 ns
+丹宫 24 ns
+丹寨 3 ns
+丹寨县 2 ns
+丹尼 17 nr
+丹尼尔 147 nr
+丹尼尔公司 4 nt
+丹尼尔斯 19 ns
+丹尼尔航 4 nr
+丹尼斯 79 ns
+丹尼森 6 nr
+丹尼洛夫 2 ns
+丹山 7 ns
+丹巴 12 ns
+丹巴县 4 ns
+丹徒 39 nr
+丹徒区 3 ns
+丹徒县 14 ns
+丹心 40 n
+丹心如故 3 i
+丹心照 3 nr
+丹心碧血 3 i
+丹房 24 n
+丹方 3 nr
+丹术 2 n
+丹根 96 ns
+丹桂 19 nr
+丹棱 4 nr
+丹棱县 3 ns
+丹毒 27 nz
+丹比 2 ns
+丹水 3 ns
+丹江 28 ns
+丹江口 542 ns
+丹江口市 272 ns
+丹江口水库 265 ns
+丹河 2 ns
+丹波哲郎 2 nr
+丹泽尔 3 nr
+丹津 8 ns
+丹湖 42 ns
+丹溪 5 ns
+丹溪心法 3 nr
+丹漆随梦 3 i
+丹珠尔 5 nr
+丹瑞 2 nr
+丹田 394 nr
+丹田功 3 nr
+丹皮 2 nr
+丹皮尔 11 nr
+丹砂 35 n
+丹科 2 ns
+丹红素 3 nr
+丹红色 3 nr
+丹纳 16 ns
+丹绒不碌港 2 v
+丹荔 3 nrt
+丹药 17 n
+丹贝旺旭 2 nr
+丹铅甲乙 3 nr
+丹阳 209 ns
+丹阳市 8 ns
+丹陵 3 ns
+丹霞 39 nr
+丹霞地貌 3 nz
+丹霞山 10 nr
+丹青 247 nr
+丹青不渝 3 i
+丹青图 3 nr
+丹青妙手 3 nr
+丹青生 3 nr
+丹顶鹤 74 nr
+丹顿 3 ns
+丹麦 1024 ns
+丹麦克朗 3 ns
+丹麦政府 3 nt
+丹麦文 5 nr
+丹麦王国 11 ns
+丹麦皇家芭蕾舞团 3 nt
+丹麦语 15 nr
+丹麦队 274 nt
+丹黄甲乙 3 nr
+为 295952 p
+为丛驱雀 6 l
+为主 11807 v
+为之一变 19 i
+为之一振 76 l
+为之一新 5 l
+为之动容 21 l
+为了 21073 p
+为五斗米折腰 4 i
+为人处世 3 l
+为人处事 31 l
+为人师表 44 l
+为人忠厚 3 i
+为人所用 3 l
+为人所知 3 i
+为人正派 3 l
+为人正直 3 i
+为人注意 4 i
+为人说项 3 n
+为什么 9561 r
+为仁不富 3 l
+为今之计 3 l
+为伍 112 v
+为伴 80 v
+为何 2217 r
+为先 171 v
+为准 567 v
+为名 681 v
+为啥 282 r
+为善最乐 3 z
+为国为民 52 l
+为国争光 3 l
+为国出力 3 l
+为国分忧 9 l
+为国增光 3 l
+为国捐躯 40 i
+为国捐驱 3 i
+为国牺牲 3 l
+为好成歉 3 l
+为学之道 3 l
+为官 223 v
+为官一任 9 l
+为官者 25 n
+为害 484 v
+为富不仁 38 i
+为尊者讳 6 i
+为小失大 3 l
+为山止篑 3 i
+为德不卒 4 i
+为德不终 3 i
+为恶不悛 3 i
+为您服务 3 l
+为情所伤 3 i
+为情所困 3 i
+为我所用 29 l
+为所欲为 254 i
+为政 337 v
+为政不廉 3 l
+为政之道 6 l
+为政以德 5 l
+为政者 25 n
+为数 547 n
+为数不多 184 l
+为数不少 60 l
+为数众多 95 l
+为数甚少 20 l
+为数甚微 3 l
+为时不晚 6 l
+为时不远 14 l
+为时尚早 27 l
+为时已晚 54 l
+为时晚矣 3 i
+为时未晚 3 l
+为时过早 44 l
+为时过晚 5 l
+为期 955 r
+为期不远 6 l
+为止 1927 v
+为此 434 r
+为民 621 v
+为民前锋 3 l
+为民喉舌 3 n
+为民服务 3 l
+为民父母 3 l
+为民请命 23 l
+为民造福 13 l
+为民除害 33 l
+为法自弊 3 i
+为渊驱鱼 6 l
+为生 462 v
+为的是 352 c
+为着 622 p
+为虎作伥 31 i
+为虎傅翼 3 i
+为虎添翼 3 i
+为虺弗摧 3 nr
+为蛇添足 3 i
+为蛇画足 3 i
+为蛇若何 3 i
+为裘为箕 3 i
+为辅 197 v
+为重 491 v
+为难 429 v
+为非作恶 7 l
+为非作歹 87 i
+为题 106 n
+为首 2021 v
+为首者 5 n
+为鬼为蜮 3 n
+主 14838 b
+主一无适 3 l
+主上 3 n
+主业 125 n
+主中桅 3 n
+主义 2416 n
+主义哲学 3 vn
+主义教育 3 n
+主义理论 3 n
+主义精神 3 n
+主义者 447 n
+主事 3 b
+主事者 3 n
+主产 186 b
+主产区 67 n
+主产县 3 n
+主产品 6 n
+主产地 14 n
+主产省 3 n
+主人 3865 n
+主人公 478 n
+主人家 85 n
+主人翁 69 n
+主仆 132 n
+主仆关系 3 v
+主从 137 n
+主从关系 3 l
+主从复制 3 l
+主件 3 n
+主任 13853 b
+主任医师 147 n
+主任医生 3 n
+主任委员 281 n
+主任科员 3 n
+主伐 3 n
+主会场 22 n
+主位 3 n
+主体 2851 n
+主体作用 3 n
+主体信号 3 n
+主体化 2 vn
+主体工程 3 n
+主体性 26 b
+主体派 3 b
+主体群落 3 l
+主体观 3 n
+主体资格 3 n
+主体际性 3 b
+主使 54 n
+主使人 3 n
+主使者 3 n
+主供 3 v
+主修 76 vn
+主修科目 3 n
+主债务 3 n
+主值 3 n
+主儿 170 n
+主光轴 31 n
+主公 447 n
+主减速 3 n
+主凶 8 n
+主刀 45 n
+主刑 21 n
+主创 17 n
+主创人员 7 n
+主创者 4 n
+主副食 3 n
+主副食品 13 n
+主力 2644 n
+主力军 97 n
+主力庄家 3 n
+主力球员 3 n
+主力舰 61 n
+主力部队 3 n
+主力阵容 3 n
+主办 978 b
+主办人 12 n
+主办单位 3 n
+主办员 4 n
+主办国 6 n
+主办地 5 n
+主办方 129 n
+主办权 8 n
+主办者 37 n
+主动 3515 b
+主动仗 3 n
+主动免疫 3 n
+主动出击 3 vn
+主动力 17 n
+主动型 4 b
+主动威胁 3 n
+主动式 19 b
+主动性 399 b
+主动攻击 17 n
+主动权 236 n
+主动精神 3 n
+主动脉 60 n
+主动脉弓 7 n
+主动脉瓣 16 n
+主动脉瘤 3 l
+主动轮 46 n
+主动轴 3 n
+主动进攻 3 v
+主动防御 5 n
+主卧室 3 n
+主厅 12 n
+主厨 5 n
+主叉同态 3 n
+主反射器 3 n
+主句 9 n
+主叫 94 v
+主台 6 n
+主合同 3 n
+主名 3 n
+主和派 3 n
+主唱 32 n
+主因 67 n
+主圣臣直 3 z
+主圣臣良 3 z
+主场 1338 n
+主场优势 3 n
+主坝 14 n
+主城 17 n
+主城区 11 n
+主基督 3 n
+主墙 3 n
+主声道 3 n
+主外 3 b
+主奏 3 n
+主妇 139 n
+主委 31 n
+主婚 38 v
+主婚人 13 n
+主子 503 n
+主存 65 n
+主存储器 49 n
+主守自盗 3 n
+主官 43 n
+主审 36 b
+主审官 3 n
+主客 82 n
+主客体 7 n
+主客场 29 n
+主客场制 5 n
+主客观 34 n
+主客颠倒 3 z
+主宰 357 v
+主宰世界 3 n
+主宰权 3 n
+主宰者 15 n
+主家 3 n
+主宾 3 n
+主宾席 10 n
+主导 1437 b
+主导产业 3 n
+主导产品 3 n
+主导作用 3 n
+主导力量 3 n
+主导地位 3 n
+主导型 8 b
+主导工业 3 n
+主导性 6 n
+主导意见 3 n
+主导权 15 n
+主导者 10 n
+主将 339 n
+主少国疑 3 l
+主峰 1241 n
+主币 3 n
+主帅 666 n
+主帆 3 n
+主席 20859 n
+主席令 4 n
+主席台 442 n
+主席团 1561 n
+主席国 27 n
+主席职位 3 n
+主干 254 n
+主干渠 3 n
+主干线 18 n
+主干网 4 n
+主干课程 3 n
+主干路 3 n
+主干道 28 n
+主平面 3 n
+主序星 42 n
+主库 3 n
+主应力 3 n
+主开关 3 n
+主张 6284 n
+主弦律 3 n
+主心骨 28 n
+主忧臣辱 3 vn
+主情造意 3 n
+主意 2900 n
+主戏 3 n
+主战 400 b
+主战场 64 n
+主战派 63 n
+主打 90 n
+主打产品 3 n
+主承销 3 n
+主抓 13 v
+主报 4 n
+主持 5153 v
+主持人 2146 n
+主持会议 3 n
+主持公道 3 n
+主持正义 3 b
+主持稿 3 n
+主持者 21 n
+主持词 3 n
+主掌 8 n
+主控 20 b
+主控制 3 n
+主控台 2 n
+主控室 3 n
+主控板 3 n
+主推 19 b
+主播台 3 n
+主攻 211 vn
+主攻手 7 n
+主政 207 n
+主政者 52 n
+主教 267 n
+主教团 5 n
+主教堂 9 n
+主教练 669 n
+主文 8 n
+主文谲谏 3 vn
+主料 269 n
+主旋律 278 n
+主族 3 n
+主日学 3 n
+主旨 226 n
+主时 35 b
+主星 32 n
+主星序 22 n
+主景 9 n
+主机 445 b
+主机厂 3 n
+主机名 3 n
+主机房 3 n
+主机板 3 n
+主机系列 3 b
+主权 2129 n
+主权利 3 n
+主权国 7 n
+主权国家 3 n
+主权在民 3 n
+主权者 9 n
+主板 103 n
+主板驱动 3 n
+主极大 3 n
+主枝 11 n
+主枢纽 3 n
+主架 3 n
+主根 55 n
+主格 13 n
+主栽 5 n
+主桅 3 n
+主档 3 b
+主桥 19 n
+主桥基 3 n
+主桥墩 2 n
+主梁 24 n
+主楼 84 n
+主槽 2 n
+主模型 3 n
+主模式 3 n
+主次 80 b
+主次颠倒 3 v
+主段 4 n
+主殿 31 n
+主母 3 n
+主沉浮 3 b
+主河道 9 n
+主油箱 3 n
+主治 257 n
+主治医师 40 n
+主治医生 30 n
+主治大夫 3 n
+主波长 3 n
+主流 1054 b
+主流产品 3 n
+主流派 13 n
+主流程 4 n
+主流线 3 n
+主渠道 28 n
+主滚筒 3 n
+主滤子 3 n
+主演 825 n
+主潮 11 n
+主炮 3 n
+主点 3 n
+主焦点 3 n
+主焦煤 3 n
+主父 34 n
+主牌 3 b
+主犯 91 n
+主球场 3 n
+主理 11 n
+主瓣 3 b
+主甲板 3 n
+主症 4 n
+主监 3 n
+主盘 3 n
+主目录 2 n
+主着陆 3 n
+主矢量 3 vn
+主矩 3 n
+主碑 3 n
+主神 45 n
+主祭 54 v
+主祭人 3 vn
+主祷文 3 n
+主科 3 n
+主程序 5 n
+主稿 3 n
+主穹顶 3 z
+主站 3 n
+主笔 61 n
+主管 2884 n
+主管人员 3 n
+主管护 3 n
+主管机关 3 n
+主管机构 3 n
+主管者 3 n
+主管部门 3 n
+主粮 14 n
+主纤维 3 l
+主线 196 n
+主组 3 n
+主结晶 3 n
+主编 1201 b
+主罚 61 n
+主罪 6 n
+主群 3 n
+主群组 3 n
+主考 87 v
+主考人 3 n
+主考官 103 n
+主耶稣 3 n
+主脉 3 n
+主脉力 3 n
+主脑 10 n
+主脑人 3 n
+主航道 29 n
+主色调 3 n
+主茎 3 n
+主菜 24 n
+主营 108 b
+主营业务 229 n
+主薄 16 b
+主街 9 n
+主表 3 n
+主裁 23 n
+主裁判 189 n
+主要 57991 b
+主要参数 3 n
+主要演员 3 n
+主要用途 3 n
+主要症状 3 vn
+主要矛盾 162 l
+主要职责 3 l
+主见 181 n
+主观 1139 n
+主观主义 176 n
+主观努力 3 l
+主观原因 3 n
+主观唯心 3 n
+主观因素 3 n
+主观性 26 n
+主观武断 3 l
+主观能动 3 n
+主观臆断 15 l
+主观臆测 3 l
+主观视点 3 n
+主观轮廓 3 n
+主观题 3 n
+主视 3 b
+主视图 3 n
+主视射击 3 n
+主视点 3 n
+主角 693 n
+主角奖 28 n
+主计 3 v
+主计处 3 n
+主计室 3 n
+主计长 3 n
+主记 3 n
+主记忆体 3 n
+主讲 86 v
+主讲人 18 n
+主设备 2 n
+主诉 14 v
+主词 8 n
+主试 3 vn
+主试官 3 n
+主试者 3 n
+主语 97 n
+主课 11 n
+主调 12 n
+主谋 59 n
+主谋者 3 n
+主谓 28 b
+主谓句 3 v
+主谓结构 3 vn
+主赛场 2 n
+主跑道 3 n
+主跨 31 n
+主路 5 n
+主路线 3 n
+主轴 106 n
+主轴电机 3 n
+主辅修制 9 n
+主辩 3 v
+主辱臣死 3 z
+主进 3 v
+主送 3 v
+主通道 2 n
+主部 3 n
+主重音 3 n
+主钢缆 3 n
+主钩 3 n
+主销 2 n
+主键 3 n
+主长 3 n
+主队 301 n
+主阵地 3 n
+主除子 3 n
+主震 6 n
+主面 5 b
+主音 28 n
+主音箱 3 n
+主音量 3 n
+主页 68 n
+主项 41 b
+主顾 74 v
+主频 39 b
+主题 2673 n
+主题乐园 3 n
+主题公园 3 n
+主题医院 3 n
+主题卡 3 n
+主题思想 3 n
+主题性 13 n
+主题曲 14 n
+主题标引 3 n
+主题歌 14 n
+主题法 3 n
+主题深刻 3 l
+主题目录 3 n
+主题索引 3 n
+主题词 28 n
+主题词表 3 n
+主题鲜明 3 n
+主食 219 n
+主食品 3 n
+主食库 3 n
+主骨架 3 n
+主麻日 2 n
+丽 1145 nr
+丽丽 81 nr
+丽亚 4 ns
+丽人 148 nrt
+丽人行 3 nt
+丽句清词 3 n
+丽句清辞 3 n
+丽台 4 ns
+丽园路 3 ns
+丽大街 2 ns
+丽妮 5 nrt
+丽婴房 3 nr
+丽山 3 ns
+丽斯 2 ns
+丽日 14 nrt
+丽日中天 3 nz
+丽春院 3 nt
+丽景嘉园 3 nr
+丽水 54 ns
+丽水地区 5 ns
+丽水市 10 ns
+丽江 269 ns
+丽江县 4 ns
+丽江地区 8 ns
+丽江市 3 ns
+丽江纳西族自治县 14 ns
+丽池 8 ns
+丽珠集团 2 nt
+丽而不媚 3 nr
+丽色 2 n
+丽莎 35 nrt
+丽萨 6 ns
+丽藻春葩 3 nr
+丽贝卡 3 nr
+丽质 6 n
+丽质天姿 3 nr
+丽质天生 3 nr
+丽都 15 ns
+举 6506 v
+举一反三 57 i
+举一废百 3 i
+举不胜举 18 i
+举世 144 v
+举世公认 3 i
+举世文明 3 i
+举世无匹 3 n
+举世无双 41 i
+举世无敌 2 i
+举世混浊 3 n
+举世皆知 3 i
+举世瞩目 112 i
+举世罕见 3 i
+举世闻名 280 i
+举为 3 v
+举事 3 v
+举人 662 n
+举例 275 n
+举例发凡 3 l
+举例来说 39 l
+举例说明 3 l
+举借 39 v
+举债 41 v
+举兵 127 n
+举其一端 3 i
+举凡 45 v
+举出 272 v
+举办 3541 v
+举办国 4 n
+举办地 10 n
+举办方 4 n
+举办权 3 n
+举办活动 3 l
+举办者 7 n
+举动 1190 v
+举十知九 3 l
+举升 3 v
+举升机 3 n
+举发 14 v
+举哀 30 v
+举善荐贤 3 n
+举国 3 n
+举国一致 8 i
+举国上下 47 l
+举国之力 3 l
+举国体制 8 l
+举国欢庆 3 i
+举国欢腾 3 i
+举国若狂 3 i
+举头 33 v
+举好 3 v
+举如鸿毛 3 i
+举子 227 n
+举家 114 n
+举手 389 v
+举手之劳 37 i
+举手加额 3 i
+举手发言 3 i
+举手投足 50 i
+举手敬礼 3 i
+举手相庆 3 i
+举手礼 2 i
+举手表决 3 i
+举手赞成 3 vn
+举报 535 v
+举报中心 3 i
+举报书 3 n
+举报人 29 n
+举报信 21 i
+举报电话 3 l
+举报箱 5 n
+举报线索 3 n
+举报者 4 n
+举抬 3 v
+举措 754 v
+举措不当 3 n
+举措失当 3 n
+举旗 3 n
+举无遗策 3 i
+举有 3 v
+举杯 190 n
+举杯畅饮 3 l
+举枉措直 3 n
+举析 3 v
+举枪 3 n
+举架 6 n
+举案齐眉 15 i
+举棋不定 53 i
+举棋若定 3 i
+举止 511 v
+举止不凡 3 l
+举止大方 3 i
+举止失措 3 i
+举止娴雅 3 z
+举止文雅 5 i
+举止洒脱 2 l
+举止端庄 6 n
+举止自若 3 i
+举止行为 3 i
+举止言谈 3 i
+举止轻浮 3 i
+举步 97 v
+举步为艰 3 l
+举步生风 3 l
+举步维艰 38 l
+举火 3 v
+举烛 3 n
+举用 3 v
+举目 100 n
+举目千里 3 i
+举目可见 3 i
+举目四望 8 i
+举目无亲 26 i
+举目望去 8 i
+举目远眺 3 i
+举直 3 v
+举直措枉 3 n
+举直错枉 3 v
+举箸 3 vn
+举组 3 n
+举荐 192 v
+举行 17900 v
+举行仪式 3 n
+举行会谈 3 i
+举行宴会 3 l
+举行座谈 3 n
+举要 12 v
+举要删芜 3 ns
+举证 35 v
+举证责任 3 l
+举贤 20 v
+举贤任能 7 i
+举贤使能 3 i
+举贤荐能 3 vn
+举起 200 v
+举起手来 3 l
+举足 3 v
+举足轻重 209 i
+举轻若重 3 i
+举过 3 v
+举过去 3 l
+举过来 3 l
+举进士 3 n
+举重 155 v
+举重若轻 37 i
+举重选手 3 l
+举重队 13 n
+举错 3 v
+举高 6 v
+举鼎 3 n
+举鼎拔山 3 i
+乀 2 zg
+乂 14 zg
+乃 4905 v
+乃东 25 ns
+乃东县 7 ns
+乃兄 3 n
+乃公 3 n
+乃堆拉 4 ns
+乃尔 3 ns
+乃弟 3 n
+乃心王室 3 n
+乃我困汝 3 nr
+乃文 3 v
+乃文乃武 3 nr
+乃是 1792 c
+乃曰 3 c
+乃武乃文 3 nr
+乃父 3 n
+乃祖 3 v
+乃翁 3 n
+乃能 3 v
+乃至 1309 c
+乃至于 32 c
+乃蛮 69 n
+乃见 3 c
+乃需 3 v
+久 7645 a
+久久 355 d
+久久不忘 3 i
+久久不绝 6 i
+久之 50 d
+久仰 198 v
+久仰大名 9 i
+久保 9 v
+久保田 3 nr
+久候 3 d
+久假不归 3 i
+久利 20 nrt
+久别 42 d
+久别重逢 58 i
+久加诺夫 26 nrt
+久卡诺维奇 2 nrt
+久历风尘 3 i
+久坂玄瑞 3 nr
+久坐 3 v
+久存 3 v
+久安 4 nrt
+久安长治 3 i
+久安长浴 3 nr
+久居 71 v
+久居人下 3 i
+久已 131 d
+久归道山 3 i
+久怀慕蔺 3 nr
+久悬不决 3 l
+久惯牢成 3 v
+久惯老诚 3 v
+久慕 3 v
+久战沙场 3 l
+久拉登 3 nrt
+久拖 3 l
+久拖不决 13 l
+久拖不办 3 i
+久攻不下 3 i
+久旱 30 a
+久旱不雨 3 l
+久旱逢甘 3 nr
+久旱逢甘雨 3 l
+久暂 3 a
+久未联系 3 l
+久束湿薪 3 l
+久治 2 v
+久治不愈 25 l
+久治县 2 ns
+久浸 3 v
+久游网 3 nz
+久演不衰 9 l
+久炼成钢 3 nz
+久留 128 v
+久病 101 v
+久病入络 3 l
+久病在床 3 i
+久病必瘀 3 l
+久病必虚 3 i
+久病成医 6 l
+久病成良 3 i
+久盛不衰 4 l
+久盼 3 v
+久等 52 d
+久经 118 d
+久经世故 3 i
+久经沙场 23 l
+久经考验 26 l
+久经锻炼 3 l
+久经风霜 3 i
+久美 256 nz
+久而久之 229 i
+久蛰思动 3 nz
+久要不忘 3 l
+久负盛名 57 l
+久跪 3 v
+久远 257 d
+久违 140 v
+久长 52 v
+久间 16 t
+久闻 3 v
+久闻其名 8 i
+久闻大名 20 i
+久隆 3 t
+久雨 3 v
+久雨成灾 3 i
+乇 113 q
+么 11322 y
+么么唱唱 3 nr
+么妹儿 3 nr
+么法儿 2 nr
+义 5628 ng
+义万富翁 3 ns
+义不反顾 3 l
+义不取容 3 i
+义不容辞 110 i
+义不生财 3 l
+义不辞难 3 l
+义举 64 n
+义乌 92 nz
+义乌人 10 nrt
+义乌县 7 ns
+义乌市 9 ns
+义仆 3 n
+义仓 18 n
+义侠 4 n
+义侠记 3 n
+义债累累 3 l
+义兄 127 n
+义兴 15 ns
+义军 1416 n
+义冢 2 n
+义决 3 v
+义利 31 n
+义利观 2 n
+义务 2059 n
+义务人 205 n
+义务兵 36 n
+义务兵役 5 n
+义务兵役制 41 n
+义务劳动 31 l
+义务工 16 n
+义务役 3 n
+义务性 9 n
+义务教育 726 l
+义务教育法 56 n
+义务服务 5 n
+义务法 3 n
+义务献工 3 n
+义务献血 3 n
+义勇 76 a
+义勇兵 3 n
+义勇军 338 n
+义勇队 22 n
+义卖 27 v
+义卖会 3 n
+义卖场 3 n
+义县 36 ns
+义和团 2114 n
+义和团运动 341 nz
+义和庄 3 ns
+义和拳 91 n
+义国 3 ns
+义国人 3 n
+义堂 3 n
+义堂镇 4 ns
+义塾 8 n
+义士 191 n
+义大利 3 nz
+义大利人 3 nz
+义大利式 3 nz
+义大利文 3 nz
+义大利王 3 nz
+义夫 5 n
+义女 70 n
+义妈 3 n
+义子 90 n
+义学 27 n
+义宁 6 ns
+义安 4 nz
+义工 13 n
+义工联 3 nt
+义师 40 n
+义庄 3 n
+义弟 3 n
+义形于色 5 l
+义律 21 n
+义愤 89 n
+义愤填胸 3 i
+义愤填膺 215 i
+义战 3 nz
+义捐 6 n
+义断恩绝 3 i
+义方之训 3 i
+义旗 55 n
+义无反顾 109 i
+义无旋踵 3 i
+义无返顾 13 i
+义正严词 3 i
+义正词严 45 i
+义正辞严 28 i
+义正辞约 3 i
+义母 25 n
+义民 3 n
+义气 375 n
+义气相投 3 i
+义气风发 3 i
+义法 3 n
+义浆仁粟 3 i
+义海恩山 3 ns
+义演 28 n
+义熙 34 n
+义父 711 n
+义犬 3 n
+义理 107 n
+义生 3 n
+义田 3 n
+义结金兰 3 nz
+义美 3 nz
+义肢 4 n
+义胆忠肝 3 i
+义节 3 n
+义蕴 3 n
+义薄云天 24 i
+义行 3 n
+义警 3 n
+义诊 48 n
+义赛 3 n
+义足 3 a
+义部 3 n
+义重恩深 3 i
+义门 159 n
+义险固守 3 n
+义项 11 n
+义颌 3 n
+义风 3 n
+义马 23 n
+义马市 4 ns
+义齿 34 n
+义齿型盒 3 n
+义齿填塞 3 i
+义齿边缘 3 n
+乊 5 zg
+之 140957 u
+之一 21053 r
+之一百二十 2 i
+之三 141 r
+之上 3503 f
+之下 6012 f
+之中 10597 r
+之为 3 c
+之举 3 r
+之久 3 r
+之乎者也 14 i
+之乐 3 ns
+之乡 3 r
+之书 3 r
+之事 3 r
+之二 399 r
+之于 3 c
+之于法 3 nr
+之人 3 r
+之余 3 r
+之便 3 c
+之内 2470 f
+之冤 3 n
+之刃 3 n
+之列 3 ns
+之利 3 ns
+之前 8828 f
+之劳 3 ns
+之友 3 n
+之后 20879 f
+之国 3 ns
+之城 3 ns
+之处 3 r
+之外 5635 f
+之字形 3 n
+之字路 3 n
+之家 3 r
+之岛 3 ns
+之年 3 r
+之恋 3 nr
+之愤 3 n
+之我见 3 i
+之所以 3180 c
+之旁 3 f
+之日 3 r
+之日起 3 ns
+之时 3 r
+之本 3 ns
+之欢 3 nr
+之死不渝 3 i
+之死靡二 3 i
+之死靡他 3 n
+之死靡它 3 n
+之比 3 ns
+之江 761 ns
+之法 3 r
+之流 149 r
+之灾 3 n
+之父 3 r
+之用 490 r
+之症 3 n
+之类 2475 r
+之而后快 3 i
+之能事 3 n
+之至 3 c
+之致 3 c
+之蛙 3 n
+之行 3 r
+之言 3 r
+之论 3 c
+之说 3 c
+之谜 3 n
+之路 3 r
+之身 3 r
+之躯 3 n
+之辈 3 r
+之过 3 c
+之遥 3 ns
+之长 3 r
+之门 3 ns
+之间 25306 f
+之际 2719 f
+之面 3 f
+之首 3 f
+乌 1680 nr
+乌七八糟 15 i
+乌丘 2 ns
+乌丙安 2 nr
+乌东 3 ns
+乌丝 3 nr
+乌丸校 2 nr
+乌丸氏 4 nr
+乌丹城 2 ns
+乌之雌雄 3 i
+乌云 655 nr
+乌云其木格 256 ns
+乌云压顶 3 n
+乌云密布 12 nr
+乌亮 24 nr
+乌什 45 ns
+乌什县 3 ns
+乌仑古湖 3 ns
+乌代雅 4 nr
+乌伊岭区 3 ns
+乌伊法 3 nr
+乌伦古 23 ns
+乌伦古湖 19 ns
+乌伦贝 4 nr
+乌伦贝克 2 nrt
+乌克兰 696 nr
+乌克兰人 39 nrt
+乌克兰国防部 5 nt
+乌克兰政府 5 nt
+乌克兰语 7 nz
+乌克兰队 3 nz
+乌兰 7 ns
+乌兰乌德 3 nrt
+乌兰伊 2 nr
+乌兰县 6 ns
+乌兰哈达 4 ns
+乌兰图 2 nr
+乌兰夫 5 nr
+乌兰察 2 nr
+乌兰察布 3 ns
+乌兰察布盟 20 ns
+乌兰察布草原 3 ns
+乌兰山 3 ns
+乌兰巴托 85 nrt
+乌兰巴托市 2 ns
+乌兰布 14 nr
+乌兰布和沙漠 15 ns
+乌兰查 3 nr
+乌兰浩特 12 ns
+乌兰浩特市 7 ns
+乌兰湖 2 ns
+乌兰牧骑 7 nr
+乌兰诺娃 8 nr
+乌兰达 2 nr
+乌共 3 j
+乌关 2 ns
+乌兹别克 109 ns
+乌兹别克斯坦 138 ns
+乌兹别克斯坦共和国 6 ns
+乌兹别克族 5 nr
+乌兹卡 3 nr
+乌凯雷 2 nr
+乌切洛 6 nr
+乌利 32 ns
+乌力 59 n
+乌力吉 2 nr
+乌力马 2 nr
+乌加河 9 ns
+乌加里 2 ns
+乌勒吉 2 nr
+乌勒格 2 nr
+乌卡亚 3 nr
+乌卡亚利 7 ns
+乌卢阿 3 nr
+乌发 35 nz
+乌台诗 3 nr
+乌叶海亚 10 ns
+乌合 3 nr
+乌合之众 83 i
+乌吉亚 3 ns
+乌启罗 34 nr
+乌呼 3 nr
+乌呼鲁 2 nr
+乌咀乡 14 i
+乌哈笃 2 nr
+乌垒城 7 nr
+乌塌菜 4 i
+乌多文科 4 nrt
+乌天黑地 3 i
+乌头 131 n
+乌头马角 3 ns
+乌夷 3 ns
+乌奴奴 5 nr
+乌姆之 3 nr
+乌姆盖万 2 nr
+乌姆赖 3 nr
+乌姆鲁勒 2 nr
+乌娜吉 7 nr
+乌孙人 3 nr
+乌孙公主 8 nr
+乌孙兵 4 nr
+乌孙国 4 ns
+乌孙大 2 nr
+乌孙族 3 nr
+乌孙王 9 nr
+乌孙语 2 nr
+乌孙诸 2 nr
+乌孙达 2 nr
+乌孙遂 4 nr
+乌孜别克 41 ns
+乌孜别克族 30 nz
+乌季达 3 nr
+乌孤筑 2 nr
+乌审 2 n
+乌审旗 29 nr
+乌尔 54 nr
+乌尔城 7 ns
+乌尔基萨 5 ns
+乌尔姆 4 nr
+乌尔德 2 nr
+乌尔扎尔 4 nrt
+乌尔拉 2 nrt
+乌尔斯 2 nr
+乌尔旦 2 nr
+乌尔根奇 10 nrt
+乌尔比诺 5 nrt
+乌尔班 5 nr
+乌尔禾 9 nr
+乌尔禾区 3 nr
+乌尔纳姆 5 nrt
+乌尔苏 3 ns
+乌尔逊 4 nr
+乌尔都 2 ns
+乌尔都文 2 nz
+乌尔都语 34 nz
+乌尔里 2 nrt
+乌尔马尼斯 2 nrt
+乌尼马克 2 ns
+乌局 3 n
+乌山 7 ns
+乌山头 3 ns
+乌巢劫 2 nr
+乌巢禅师 6 nr
+乌市 3 ns
+乌布利 7 ns
+乌布苏 6 ns
+乌帽红裙 3 nr
+乌干达 158 nr
+乌干达先令 3 nr
+乌干达共和国 5 ns
+乌库尔 2 nr
+乌廷玉 11 nr
+乌弋山 19 nr
+乌弗埃 8 nr
+乌当区 3 ns
+乌得勒 12 nr
+乌德丁 3 nr
+乌德勒 3 nr
+乌思藏 61 nr
+乌恰 2 nr
+乌恰县 3 ns
+乌戈国 6 ns
+乌戈尔 19 nr
+乌戎潘 6 nr
+乌托邦 108 nr
+乌托邦主 3 nr
+乌拉 87 nrt
+乌拉圭 256 ns
+乌拉圭东岸共和国 2 ns
+乌拉圭人 7 nr
+乌拉圭队 2 nt
+乌拉坦 3 ns
+乌拉尔 178 nr
+乌拉尔军区 15 ns
+乌拉尔山 25 ns
+乌拉尔山脉 83 ns
+乌拉尔河 33 ns
+乌拉山 12 ns
+乌拉特 2 nr
+乌拉特中旗 5 ns
+乌拉特前旗 17 ns
+乌拉特后旗 2 ns
+乌拉草 12 nr
+乌提卡 4 nr
+乌政府 2 nt
+乌斯 169 ns
+乌斯塔夏 4 ns
+乌斯季 13 nr
+乌斯宾 2 ns
+乌斯帕 2 nr
+乌斯带 18 nr
+乌斯怀亚 12 ns
+乌斯曼 10 nr
+乌斯河 2 ns
+乌斯湖 2 ns
+乌斯满 2 nr
+乌斯特 2 nr
+乌斯著 9 nr
+乌斯藏 14 ns
+乌斯达 2 nr
+乌方 7 n
+乌日 3 nrt
+乌日图 256 nr
+乌日娜 3 nr
+乌旺阿 10 nr
+乌旺阿普 3 nr
+乌普萨拉 24 nrt
+乌有 8 nr
+乌有先生 3 nr
+乌木 62 nr
+乌木剑 3 nr
+乌朱穆 2 nr
+乌杜尼斯 3 nrt
+乌来 3 nr
+乌来乡 3 ns
+乌林之 2 nr
+乌枣 3 n
+乌查利 4 nr
+乌格尔 2 nr
+乌格拉 2 nr
+乌桓 174 nr
+乌桓亦 2 nr
+乌桓人 7 nr
+乌桓俗 2 nr
+乌桓军 2 nr
+乌桓势 2 nr
+乌桓南 3 nr
+乌桓号 2 nr
+乌桓均 2 nr
+乌桓常 2 nr
+乌桓攻 2 nr
+乌桓族 2 nr
+乌桓校 14 nr
+乌桓连 3 nr
+乌桓遂 2 nr
+乌桓降 2 nr
+乌桕 333 n
+乌桕树 4 n
+乌梁海 19 ns
+乌梁海人 3 nr
+乌梁素海 11 ns
+乌梅 17 nr
+乌梅汁 3 nr
+乌梅酒 3 nr
+乌梢蛇 3 nr
+乌江 120 ns
+乌江流域 2 ns
+乌江镇 35 ns
+乌池 3 ns
+乌沈沈 3 nr
+乌沉沉 3 z
+乌沙村 2 ns
+乌沙科夫 14 nrt
+乌油油 13 n
+乌法 8 n
+乌波卢 6 nr
+乌波尔 2 nr
+乌洛侯 2 nr
+乌洛托品 2 nr
+乌洽会 3 nr
+乌浒水 2 nz
+乌浩宫 2 nr
+乌浩特 3 nr
+乌海 5 ns
+乌海市 15 ns
+乌涂 3 ns
+乌溜溜 22 z
+乌溪 11 ns
+乌溪南 2 ns
+乌溪江 7 nr
+乌滋别克 3 ns
+乌灯黑火 2 i
+乌烟瘴气 173 i
+乌焉成马 3 i
+乌焦巴弓 3 nr
+乌特利 2 nr
+乌特河 2 ns
+乌玛尔 2 nr
+乌玛达 2 nr
+乌珠弹 2 nr
+乌珠穆沁 11 ns
+乌瓦白 2 nr
+乌甲素 4 nr
+乌申斯基 8 nrt
+乌白马角 3 ns
+乌盟 7 ns
+乌目山 3 ns
+乌石乡 2 ns
+乌礁湾 3 nr
+乌移奎 2 nr
+乌程 8 n
+乌程侯 4 nr
+乌第河 14 ns
+乌篷 3 n
+乌篷船 24 n
+乌纱帽 108 n
+乌纳拉 2 nr
+乌纳水 2 nr
+乌纳河 2 ns
+乌维拉 2 nr
+乌维科 3 nr
+乌羊王 89 nr
+乌羊石 13 nr
+乌老大 69 nr
+乌耆 3 ns
+乌耳姆 2 nr
+乌脚病 3 n
+乌苏 27 ns
+乌苏勒 2 nr
+乌苏县 3 ns
+乌苏哩 5 nr
+乌苏市 3 ns
+乌苏河 2 ns
+乌苏里 16 ns
+乌苏里斯克 2 nrt
+乌苏里江 103 ns
+乌苏镇 2 ns
+乌苏阿 5 nr
+乌药 8 n
+乌莎 3 nrt
+乌莱玛 5 nr
+乌菲齐 5 nr
+乌蒙宣 2 nr
+乌蒙山 21 ns
+乌蒙蒙 4 nr
+乌蓝 2 nr
+乌蓬船 3 nr
+乌蚕衣 12 nr
+乌衣之游 3 nr
+乌衣子弟 2 nr
+乌衣巷 3 nr
+乌衣门第 3 nr
+乌裕尔河 6 ns
+乌豆 2 n
+乌贝罗 5 nr
+乌贼 97 n
+乌贼骨 3 i
+乌贾基 14 nr
+乌踆兔走 3 nr
+乌达 9 nr
+乌达区 3 ns
+乌达姆 3 nr
+乌达河 3 ns
+乌达盟 11 ns
+乌进孝 8 nr
+乌连戈 4 nr
+乌迪内 74 nr
+乌迪内斯 4 ns
+乌迪德 3 nr
+乌里 13 ns
+乌里亚 17 ns
+乌里扬诺夫 5 nrt
+乌里扬诺夫斯克 8 nrt
+乌里斯 2 nr
+乌里雅 4 nr
+乌里雅苏台 11 ns
+乌里韦 13 nr
+乌金 28 n
+乌错 2 ns
+乌镇 106 ns
+乌陆鲁 2 nr
+乌陇古 4 nr
+乌隆府 2 nr
+乌隆迪 6 nr
+乌雅束 2 nr
+乌雅氏 2 nr
+乌集之交 3 nr
+乌集之众 3 nr
+乌雷松 2 nr
+乌青 40 nr
+乌面鹄形 3 i
+乌鞘岭 18 ns
+乌韦阿 6 nr
+乌飞免走 3 i
+乌飞兔走 3 i
+乌饭树 2 ns
+乌马 4 ns
+乌马儿 2 nr
+乌马尔 5 nr
+乌马河区 3 ns
+乌骨鸡 21 nr
+乌鱼 262 n
+乌鱼子 3 nr
+乌鱼蛋 3 nr
+乌鲁伯 2 nr
+乌鲁克 22 nr
+乌鲁卡 3 nr
+乌鲁卡基 2 nr
+乌鲁古 2 ns
+乌鲁图 4 nr
+乌鲁木齐 435 ns
+乌鲁木齐县 5 ns
+乌鲁木齐市 51 ns
+乌鲁木齐机场 5 ns
+乌鲁班 2 nr
+乌鲳 6 n
+乌鳢 8 n
+乌鸟私情 3 i
+乌鸡 35 ns
+乌鸡汤 3 nr
+乌鸦 317 n
+乌鸦嘴 3 nz
+乌黑 241 ns
+乌黑亮丽 3 z
+乌黑黑 3 z
+乌龙 65 nr
+乌龙岭 44 ns
+乌龙潭 2 ns
+乌龙球 13 nr
+乌龙茶 45 nr
+乌龙草 2 nr
+乌龙院 3 ns
+乌龙驹 171 nr
+乌龟 508 nr
+乌龟壳 12 nr
+乌龟王八 3 nr
+乍 598 ns
+乍一听 3 l
+乍一看 3 l
+乍冷 3 ns
+乍冷乍热 3 z
+乍听 3 l
+乍听之下 3 l
+乍富 3 ns
+乍寒乍热 3 z
+乍往乍来 3 vn
+乍得 142 ns
+乍得湖 53 ns
+乍暖 3 l
+乍暖乍寒 3 vn
+乍暖还寒 12 l
+乍毛变色 3 l
+乍浦 21 ns
+乍浦港 2 ns
+乍浦镇 4 ns
+乍热 3 ns
+乍热乍冷 3 z
+乍然 3 l
+乍现 3 l
+乍看 3 l
+乍看之下 3 l
+乍看来 3 l
+乍见 3 l
+乍读 3 l
+乍读之下 3 v
+乍雨乍晴 3 v
+乎 1399 zg
+乎呼 3 z
+乎噜 3 z
+乏 409 a
+乏人问津 3 l
+乏力 269 a
+乏力感 3 l
+乏味 141 a
+乏善 3 a
+乏善可陈 14 l
+乏困 3 a
+乏指 3 v
+乏术 17 l
+乏汽 3 l
+乏煤 3 v
+乏色 3 a
+乏话 3 a
+乏货 3 v
+乏顿 3 a
+乐 3667 a
+乐一乐 5 nr
+乐一词 2 nr
+乐不可支 22 i
+乐不可极 3 i
+乐不可言 3 i
+乐不思蜀 10 i
+乐不极盘 3 i
+乐业 28 n
+乐业县 3 n
+乐业安居 3 n
+乐东 9 ns
+乐东县 2 ns
+乐东艇 4 nr
+乐东黎族自治县 3 ns
+乐之境 2 nr
+乐之心 2 nr
+乐之路 3 nr
+乐乎 2 a
+乐乐 14 a
+乐事 49 n
+乐事劝功 3 nr
+乐于 639 v
+乐于助人 25 i
+乐亭 22 nr
+乐亭县 18 nr
+乐亿阳 3 nr
+乐以忘忧 5 i
+乐儿 5 nr
+乐凯胶片 3 n
+乐则意 2 nr
+乐利 3 a
+乐力 5 n
+乐升平 2 nr
+乐卫尉 4 nr
+乐厚 6 a
+乐厚双 2 nr
+乐友网 3 nr
+乐受 3 a
+乐句 22 n
+乐吧 6 n
+乐呵呵 58 z
+乐命 3 n
+乐和乐 2 nr
+乐和舅 2 nr
+乐善 17 a
+乐善不倦 3 i
+乐善堂 5 nr
+乐善好义 3 i
+乐善好施 36 i
+乐喜金星 2 nr
+乐嗟苦咄 3 i
+乐嘉城 4 nr
+乐器 1144 n
+乐器厂 3 n
+乐器网 3 n
+乐器行 3 n
+乐团 203 n
+乐园 999 n
+乐土 49 n
+乐圣 3 nr
+乐在其中 14 i
+乐坊 3 n
+乐坏了 3 l
+乐坛 39 n
+乐城 2 ns
+乐基儿 3 nr
+乐境 3 n
+乐声 153 n
+乐大娘 2 nr
+乐大娘子 3 nr
+乐天 102 nr
+乐天任命 3 i
+乐天安命 2 nz
+乐天派 9 nr
+乐天知命 8 i
+乐子 27 n
+乐子之 3 nr
+乐学中 3 nr
+乐守天涯 2 i
+乐安 43 nr
+乐安县 4 ns
+乐安居 3 nr
+乐官 3 n
+乐宫钟 2 nr
+乐寿堂 59 nr
+乐尔号 6 nr
+乐尽哀生 3 i
+乐尽悲来 3 i
+乐山 106 ns
+乐山乐水 3 ns
+乐山市 29 ns
+乐山爱水 3 nr
+乐工 99 n
+乐工舞 16 n
+乐师 101 n
+乐帮主 4 n
+乐帮众 4 n
+乐帮石 5 nr
+乐帮群 12 nr
+乐平 34 nr
+乐平县 2 ns
+乐平市 2 ns
+乐府 200 n
+乐府诗 45 nr
+乐彩网 3 nr
+乐往哀来 3 i
+乐律 56 n
+乐得 9 v
+乐得嘴 2 nr
+乐得屁 2 nr
+乐得眉 2 nr
+乐心 3 n
+乐志论 2 nr
+乐悠悠 2 z
+乐悠游 2 nr
+乐意 459 n
+乐意于 3 v
+乐意效劳 3 i
+乐感 8 a
+乐愿 32 n
+乐成人美 3 nz
+乐户 3 n
+乐手 28 n
+乐捐 3 n
+乐捐箱 3 n
+乐捐运动 3 i
+乐新厌旧 3 i
+乐施 2 n
+乐施会 3 nr
+乐无忧 3 i
+乐昌 16 nr
+乐昌之镜 3 nr
+乐昌公主 7 nr
+乐昌分镜 3 l
+乐昌县 3 ns
+乐昌市 3 ns
+乐昌破镜 3 nr
+乐曲 336 n
+乐曲声 16 nr
+乐未央 2 nr
+乐极则忧 3 i
+乐极则悲 3 i
+乐极哀来 3 i
+乐极悲来 3 i
+乐极悲生 3 i
+乐极生哀 3 nr
+乐极生悲 17 i
+乐果 10 n
+乐歌 69 n
+乐此不倦 3 i
+乐此不彼 3 i
+乐此不疲 66 i
+乐死 3 nr
+乐段 12 n
+乐毅则 3 nr
+乐毅卒 3 nr
+乐毅子 3 nr
+乐毅攻 5 nr
+乐毅畏 3 nr
+乐毅破 2 nr
+乐毅离 3 nr
+乐池 10 n
+乐浪 17 nz
+乐浪郡 13 nr
+乐海帆 2 nr
+乐清 27 nr
+乐清县 3 nr
+乐清市 6 ns
+乐渊源 2 nr
+乐游宴 2 n
+乐滋滋 10 z
+乐满地 3 z
+乐玉华 2 nr
+乐现 2 v
+乐班 7 n
+乐理 46 n
+乐生励 16 nr
+乐生恶 4 nr
+乐甫波 6 nr
+乐百氏 10 nr
+乐百氏杯 2 nr
+乐神 3 n
+乐祸幸灾 3 i
+乐章 159 nr
+乐绍延 4 nr
+乐缘片 11 n
+乐美 2 a
+乐美之 2 nr
+乐翻天 3 nr
+乐者 3 n
+乐者聆 16 nr
+乐而不厌 3 i
+乐而不淫 3 i
+乐而不荒 3 i
+乐而忘形 3 i
+乐而忘忧 3 i
+乐而忘死 3 i
+乐而忘返 3 i
+乐育 3 n
+乐育人才 3 n
+乐腾 3 nr
+乐至 4 nr
+乐至县 3 nr
+乐舞 260 n
+乐艺 66 n
+乐花楸 2 n
+乐茂盛 2 nr
+乐融融 6 n
+乐行忧违 3 i
+乐行者 3 n
+乐见 6 a
+乐观 827 a
+乐观主义 66 n
+乐观其成 18 i
+乐记 3 n
+乐论 3 n
+乐评人 6 n
+乐评家 3 n
+乐调 3 n
+乐谱 48 n
+乐谱架 3 n
+乐谷 2 n
+乐趣 494 a
+乐趣园 3 nr
+乐趣横生 3 i
+乐趣网 3 n
+乐进 3 a
+乐进引 2 nr
+乐迷 8 nr
+乐退安贫 3 i
+乐透型 3 n
+乐透彩 3 n
+乐透网 3 n
+乐道 8 nr
+乐道好古 3 nr
+乐道安命 3 nr
+乐道安贫 3 nr
+乐道忘饥 3 i
+乐道遗荣 3 nr
+乐都 43 ns
+乐都县 3 ns
+乐钟 2 nr
+乐闲 2 a
+乐闻 16 n
+乐队 657 n
+乐陵 42 nr
+乐陵县 3 ns
+乐陵市 3 ns
+乐陶陶 3 nr
+乐随缘 2 nr
+乐障 3 n
+乐音 73 n
+乐颠颠 11 z
+乒 125 n
+乒乒 3 j
+乒乒乓乓 84 o
+乒乓 106 o
+乒乓外交 3 n
+乒乓室 3 n
+乒乓球 336 n
+乒乓球台 6 n
+乒乓球室 3 n
+乒乓球拍 3 n
+乒乓球桌 6 n
+乒乓球赛 15 n
+乒乓球队 28 n
+乒乓网 3 n
+乒协 8 j
+乒坛 10 n
+乒球 9 n
+乒羽 38 n
+乓 117 o
+乓乓 3 o
+乔 583 zg
+乔三槐 17 nr
+乔世彪 2 nr
+乔丹 80 nr
+乔乔桑 3 nr
+乔二爷 48 nr
+乔云萍 5 nr
+乔伊斯 13 nr
+乔伊纳 7 nr
+乔伯年 36 nr
+乔依尔 2 nr
+乔允升 5 nr
+乔先生 5 nr
+乔其纱 3 nr
+乔冠华 7 nr
+乔凡尼 2 nr
+乔利蒂 2 nr
+乔卢奥 2 nr
+乔卢特 4 nr
+乔发科 4 nr
+乔口区 3 n
+乔吉姆 21 nr
+乔名峰 2 nr
+乔国 5 ns
+乔国老 3 nr
+乔大侠 2 nr
+乔大哥 13 nr
+乔大夯 127 nr
+乔大爷 6 nr
+乔妆打扮 3 i
+乔妆改扮 3 i
+乔姆斯基 9 nrt
+乔家 18 n
+乔家大院 34 nt
+乔家栅 3 nr
+乔家院 2 nr
+乔寨主 5 nr
+乔尔乔涅 6 nrt
+乔尔贝亚 9 nrt
+乔峰冷 4 nr
+乔峰击 2 nr
+乔峰右 2 nr
+乔峰叹 6 nr
+乔峰听 4 nr
+乔峰呆 2 nr
+乔峰命 2 nr
+乔峰夺 2 nr
+乔峰奇 5 nr
+乔峰微微 8 nr
+乔峰心 18 nr
+乔峰怒 2 nr
+乔峰摇 5 nr
+乔峰放 2 nr
+乔峰朗 3 nr
+乔峰知 2 nr
+乔峰笑 6 nr
+乔峰素 2 nr
+乔峰行 2 nr
+乔巴姆 4 nr
+乔巴山 15 nr
+乔布 3 nr
+乔布斯 48 nr
+乔师望 2 nr
+乔帮主 120 nr
+乔庄村 5 nr
+乔应甲 2 nr
+乔建中 2 nr
+乔德里 2 nr
+乔志强 2 nr
+乔恰拉 2 nr
+乔戈里 3 nr
+乔戈里峰 27 nr
+乔扮 3 v
+乔拉 2 nrt
+乔掌柜 7 nr
+乔文假醋 3 i
+乔晓阳 514 nr
+乔普乐 4 nr
+乔普拉 2 nr
+乔普林 2 nr
+乔木 469 nr
+乔木林 8 nr
+乔本龙 2 nr
+乔杰立 3 nr
+乔松举 19 nr
+乔松之寿 3 nr
+乔林 2 nr
+乔柏年 54 nr
+乔梓 12 nrfg
+乔森潘 6 nr
+乔榛 5 nrfg
+乔模乔 2 nr
+乔治 283 nr
+乔治乌 10 nr
+乔治亚 21 nr
+乔治亚州 3 ns
+乔治华盛 3 nr
+乔治城 5 nr
+乔治堡 2 nr
+乔治山 2 nr
+乔治岛 2 nr
+乔治市 2 ns
+乔治式 2 n
+乔治敦 19 ns
+乔治敦大学 4 nt
+乔治湖 3 nr
+乔治湾 2 nr
+乔治王 2 nr
+乔治王岛 9 ns
+乔治街 5 nr
+乔治跳 2 nr
+乔清秀 6 nr
+乔灌木 11 nr
+乔然山 3 nr
+乔燕琴 2 nr
+乔瓦尼 5 nr
+乔石 182 nr
+乔福应 2 nr
+乔秀荣 5 nr
+乔科尔 2 nr
+乔答摩 3 nr
+乔红 261 nr
+乔纳斯 2 nr
+乔纳森 118 nr
+乔老爷 3 nr
+乔脑 3 n
+乔致庸 3 nrfg
+乔舒亚 2 nr
+乔装 48 n
+乔装成 6 nr
+乔装打扮 22 i
+乔装改扮 67 i
+乔装易 2 n
+乔西奇 2 nr
+乔贝河 7 nr
+乔贵妃 8 nr
+乔路埃 2 nr
+乔迁 17 nr
+乔迁之喜 7 nr
+乔迁盛宴 3 nr
+乔道清 116 nr
+乔里乔 2 nr
+乔韵华 2 nr
+乔驾鹤 2 nr
+乔龙画虎 3 nr
+乕 9 zg
+乖 626 a
+乖乖 579 d
+乖乖仔 3 ns
+乖乖女 3 nz
+乖乖狗 3 v
+乖乖虎 3 nz
+乖僻 24 a
+乖僻邪谬 3 nr
+乖到 3 a
+乖唇蜜舌 3 n
+乖嘴蜜舌 3 n
+乖孩子 47 n
+乖宝宝 3 n
+乖巧 116 a
+乖异 3 a
+乖张 32 a
+乖得 3 d
+乖戾 65 a
+乖离 21 n
+乖觉 41 n
+乖谬 21 a
+乖隔 3 n
+乖顺 6 a
+乗 65 zg
+乘 4150 v
+乘上 3 d
+乘专机 3 l
+乘了 3 p
+乘云行泥 3 n
+乘人之危 75 i
+乘以 83 v
+乘伪行诈 3 i
+乘便 3 d
+乘兴 14 nz
+乘兴而去 3 i
+乘兴而往 3 i
+乘兴而来 10 l
+乘其不备 11 i
+乘其不意 3 i
+乘具 3 n
+乘凉 97 v
+乘利席胜 3 l
+乘到 3 v
+乘务 30 n
+乘务员 76 n
+乘务组 2 n
+乘务警 3 n
+乘务长 8 n
+乘势 374 n
+乘势使气 3 i
+乘势而上 5 i
+乘号 3 n
+乘员 397 n
+乘坐 687 v
+乘坚策肥 3 n
+乘客 670 n
+乘客单 3 n
+乘客电梯 3 n
+乘幂 3 n
+乘座 3 n
+乘快艇 3 n
+乘性同余 3 l
+乘性约化 3 l
+乘敌不备 3 i
+乘数 46 n
+乘数词头 3 n
+乘方 20 n
+乘时乘势 3 i
+乘晕宁 5 i
+乘机 1116 n
+乘机打劫 3 i
+乘机而入 3 i
+乘法 134 n
+乘法器 13 n
+乘法表 8 n
+乘火打劫 9 i
+乘火车 3 n
+乘热打铁 3 i
+乘用车 3 n
+乘着 304 p
+乘积 112 n
+乘空 3 n
+乘筏 3 n
+乘肥衣轻 3 i
+乘胜 110 v
+乘胜前进 15 i
+乘胜追击 69 i
+乘胜逐北 3 i
+乘舆 30 n
+乘舆播越 3 z
+乘船 177 n
+乘虚 85 v
+乘虚而入 73 i
+乘虚蹈隙 3 i
+乘虚迭出 3 l
+乘警 12 n
+乘起 3 v
+乘起来 3 l
+乘车 345 n
+乘车戴笠 3 i
+乘轻驱肥 3 i
+乘轿 3 n
+乘过 3 p
+乘过去 3 l
+乘过来 3 d
+乘间 3 n
+乘间伺隙 3 n
+乘间投隙 3 n
+乘间抵隙 3 l
+乘除 21 v
+乘险抵巇 3 l
+乘隙 83 n
+乘隙捣虚 3 i
+乘隙而入 12 i
+乘顺水船 3 nz
+乘风 56 n
+乘风兴浪 3 i
+乘风扬土 3 i
+乘风扬帆 3 l
+乘风破浪 23 i
+乘风转舵 3 i
+乘飞机 3 n
+乘马 230 n
+乘骑 21 n
+乘高决水 3 n
+乘鸾跨凤 3 nz
+乘龙 17 nz
+乘龙佳婿 3 i
+乘龙快婿 11 i
+乘龙配凤 3 n
+乙 953 n
+乙丑 10 n
+乙丑年 3 m
+乙丑日 3 nz
+乙丙 11 nrfg
+乙丙橡胶 9 n
+乙二胺 13 nz
+乙二胺四乙酸 4 nz
+乙二醇 31 nz
+乙亥 5 m
+乙内酰胺 3 nz
+乙午 3 n
+乙卯 9 n
+乙卯日 2 l
+乙地 8 n
+乙型 37 n
+乙型肝炎 88 n
+乙基 26 nz
+乙子 3 n
+乙存 3 n
+乙寅 3 m
+乙巳 8 m
+乙巳日 2 m
+乙戌 3 m
+乙方 43 n
+乙未 9 nz
+乙未年 3 l
+乙炔 126 n
+乙烯 300 n
+乙烯厂 3 n
+乙烯基 15 nz
+乙烯基醚 3 nz
+乙烯氧化 3 nz
+乙烷 38 nz
+乙状结肠 14 l
+乙状结肠镜 3 l
+乙班 3 n
+乙申 3 nz
+乙硫醇 2 nz
+乙硼烷 5 nz
+乙种 9 n
+乙种射线 3 n
+乙种粒子 3 l
+乙种维生 3 l
+乙等 3 b
+乙类 16 n
+乙级 72 n
+乙级队 3 n
+乙组 2 n
+乙肝 363 n
+乙肝患者 3 n
+乙肝疫苗 3 n
+乙肝病毒 3 n
+乙胺 10 nz
+乙脑 14 n
+乙腈 8 n
+乙苯 3 n
+乙辰 3 n
+乙道 6 n
+乙酉 16 m
+乙酉两次 2 m
+乙酉年 7 m
+乙酯 25 nz
+乙酰 36 n
+乙酰乙酸乙酯 19 nz
+乙酰化 3 nz
+乙酰唑胺 3 nz
+乙酰基 10 nz
+乙酰氯 13 nz
+乙酰胆碱 51 l
+乙酰胺 12 nz
+乙酰螺旋霉素 5 n
+乙酸 122 n
+乙酸乙酯 63 nz
+乙酸酐 22 nz
+乙酸酯 10 nz
+乙酸钠 9 nz
+乙酸铵 3 nz
+乙醇 470 n
+乙醇汽油 3 nz
+乙醇溶液 3 nz
+乙醇胺 16 nz
+乙醇钠 3 nz
+乙醚 227 n
+乙醛 63 nz
+乙醛酸 3 nz
+乜 50 nr
+乜乜斜斜 3 nr
+乜嘢 3 v
+乜斜 27 v
+九 8003 m
+九一三 7 m
+九一八 54 m
+九一八事 3 i
+九一八事变 101 nz
+九七 14 m
+九万 11 m
+九万一千余吨 2 m
+九万七千三百二十四匹 2 m
+九万三千九百九十多公里 2 m
+九万个 2 m
+九万二千平方公里 2 m
+九万五千 2 m
+九万余 6 m
+九万块 2 m
+九万多平方公里 3 m
+九万大山 10 ns
+九万里 6 m
+九丈 131 m
+九三 9 m
+九三个 2 m
+九三军人 3 nr
+九三学社 89 nt
+九三学社中央 8 nt
+九三年 2 m
+九三路 2 m
+九下 6 m
+九世 3 t
+九世之仇 3 i
+九世纪 3 t
+九个 672 m
+九中 45 ns
+九中全会 3 nt
+九九 59 m
+九九乘法 3 i
+九九九 3 m
+九九八十 2 m
+九九八十一 15 m
+九九八十一刀 2 m
+九九八十一只 4 m
+九九八十一日 4 m
+九九八十一路 4 m
+九九年 2 m
+九九归一 5 i
+九九归原 3 ns
+九九歌 11 m
+九九表 3 nr
+九九重阳 3 nz
+九乡 7 ns
+九二 9 m
+九五 446 t
+九五之尊 397 m
+九五至尊 3 i
+九井 2 ns
+九亩 2 m
+九亿 9 m
+九亿八千万两 2 m
+九亿八千二百二十三万余两 2 m
+九亿八千二百多万两 2 m
+九代 6 t
+九件 5 m
+九份 4 m
+九位 28 m
+九位数 3 n
+九倍 3 m
+九儒十丐 3 nr
+九八 12 m
+九八年 7 m
+九六 6 m
+九六年 6 m
+九关虎豹 3 nr
+九具 6 m
+九冬会 5 nr
+九刀 8 m
+九分 48 m
+九分新 3 nz
+九分熟 3 i
+九列 3 m
+九则 3 m
+九制 5 n
+九剑 16 nz
+九副 2 m
+九匹 5 m
+九十 340 m
+九十一 4 m
+九十一团 3 m
+九十七 6 m
+九十七个 3 m
+九十七卷 2 m
+九十七篇 2 m
+九十万 4 m
+九十三 2 m
+九十三岁 3 m
+九十个 2 m
+九十九 41 m
+九十九个 11 m
+九十九件 2 m
+九十九卷 2 m
+九十九年 14 m
+九十九条 3 m
+九十九米 16 m
+九十九道 2 m
+九十二卷 2 m
+九十五万 2 m
+九十五个 3 m
+九十五卷 2 m
+九十五岁 4 m
+九十五条 4 m
+九十亩 3 m
+九十余 2 m
+九十余万 4 m
+九十余处 4 m
+九十余年 3 m
+九十元 3 m
+九十八 10 m
+九十八万两 2 m
+九十八个 2 m
+九十八卷 2 m
+九十八名 6 m
+九十八篇 2 m
+九十六 15 m
+九十六家 2 m
+九十六岁 8 m
+九十六年 2 m
+九十六期 2 m
+九十六门 2 m
+九十其仪 3 nz
+九十分钟 4 m
+九十卷 5 m
+九十厘米 2 m
+九十四年 4 m
+九十块 4 m
+九十多 2 m
+九十多万 3 m
+九十多个 2 m
+九十多块 2 m
+九十多处 2 m
+九十多岁 3 m
+九十多年 3 m
+九十天 3 m
+九十岁 18 m
+九十年 18 m
+九十年代 60 m
+九十度 15 m
+九十文 2 m
+九十斤 2 m
+九十日 2 m
+九十点 5 m
+九十盒 4 m
+九十袋 2 m
+九十里 10 m
+九千 17 m
+九千万 2 m
+九千两 15 m
+九千个 2 m
+九千九百九十九间 7 m
+九千九百岁 5 m
+九千余 2 m
+九千余卷 2 m
+九千元 4 m
+九千四百二十六亿 2 m
+九千多 6 m
+九千岁 7 m
+九千年 3 m
+九千户 3 m
+九华 19 nz
+九华山 91 ns
+九华灯 2 nz
+九卷 9 m
+九卿 227 nr
+九原 20 ns
+九原可作 3 i
+九变十化 3 nz
+九叠 7 m
+九口 5 m
+九句 7 m
+九只 20 m
+九台 7 m
+九台县 3 ns
+九台市 5 ns
+九叶 135 t
+九号 18 m
+九合一匡 3 nr
+九名 39 m
+九员 2 n
+九命怪猫 3 i
+九品 225 n
+九品中正 3 nz
+九响 4 m
+九四 12 m
+九四年 2 m
+九四段 3 m
+九回 20 m
+九回肠断 3 i
+九团 4 m
+九圆 3 nz
+九圈 3 m
+九场 21 m
+九块 14 m
+九垓八埏 3 nr
+九城 3 ns
+九堂 4 ns
+九塘 3 ns
+九声 4 m
+九处 11 m
+九大 250 j
+九大行星 3 nz
+九天 212 t
+九天之外 3 i
+九天九地 3 nz
+九天仙女 3 nr
+九天揽月 3 nz
+九天音乐 3 ns
+九头 23 m
+九头鸟 10 i
+九夷 7 ns
+九套 7 m
+九姓 62 n
+九子 2 m
+九孔 3 n
+九宗七祖 3 nr
+九宫 110 ns
+九宫山 291 ns
+九宫格 3 nr
+九宫格儿 3 nr
+九宫键 3 nr
+九宵 3 t
+九宵云 3 nr
+九宵云外 3 i
+九家 30 m
+九寨 21 ns
+九寨沟 120 ns
+九寨沟县 3 ns
+九寸 6 m
+九尺 282 m
+九尾 61 ns
+九尾狐 4 nr
+九层 69 m
+九届 48 m
+九届全国人大 36 nt
+九届全国人大常委会 19 nt
+九届全国政协 7 nt
+九岁 93 m
+九岭山 13 ns
+九峰 9 ns
+九峰山 6 ns
+九嶷山 3 ns
+九州 257 ns
+九州四海 3 ns
+九州岛 39 ns
+九左右 2 m
+九市 3 ns
+九帐 3 m
+九幅 2 m
+九幕 2 m
+九平方米 6 m
+九年 1184 t
+九年之储 3 nz
+九年之蓄 3 i
+九年制 33 n
+九度 2 ns
+九座 9 m
+九张 7 m
+九弦琴 3 nr
+九归 7 ns
+九成 155 m
+九成新 3 nz
+九所 9 m
+九打 7 m
+九把刀 3 m
+九折 5 m
+九招 7 m
+九支 3 m
+九故十亲 3 i
+九数 4 m
+九斗 2 m
+九斤 13 m
+九方 10 m
+九族 35 nz
+九日 132 t
+九日山 6 ns
+九旬 9 t
+九时 2 t
+九曲 314 m
+九曲十八弯 5 i
+九曲回肠 1030 i
+九曲堂 3 nz
+九曲桥 5 ns
+九曲溪 7 ns
+九月 974 t
+九月九 3 t
+九月份 11 nz
+九月初 23 t
+九月底 20 t
+九月末 3 t
+九服 5 n
+九朝古都 3 ns
+九期 2 t
+九朵 6 m
+九朽一罢 3 i
+九条 61 m
+九枚 12 m
+九枝 5 m
+九架 2 m
+九架梁 3 ns
+九样 2 m
+九格 3 n
+九次 21 m
+九歌 36 m
+九步 2 m
+九死一生 67 i
+九死不悔 3 i
+九死未悔 3 i
+九死生 3 i
+九段 81 m
+九江 818 ns
+九江八河 3 ns
+九江县 6 ns
+九江市 44 ns
+九江路 3 ns
+九江镇 3 ns
+九泉 42 nz
+九泉之下 68 i
+九洲 12 ns
+九洲四海 3 ns
+九派 3 m
+九流 15 n
+九流三教 4 nz
+九流人物 3 n
+九流十家 3 l
+九流宾客 3 n
+九流百家 3 n
+九渡河镇 10 ns
+九湾 3 ns
+九溪 69 ns
+九点 141 m
+九点半 3 m
+九点整 3 m
+九点钟 3 m
+九炼成钢 3 nz
+九烈三贞 3 nr
+九片 2 m
+九牛一毛 22 nz
+九牛一毫 3 i
+九牛二虎 3 nz
+九牛二虎之力 32 i
+九牧王 3 nr
+九班 3 m
+九瓶 3 m
+九田 3 nz
+九百 40 m
+九百七十九公里 2 m
+九百万 8 m
+九百万两 2 m
+九百万亿元 2 m
+九百两 4 m
+九百个 2 m
+九百九十七 2 m
+九百九十七声 2 m
+九百九十九 2 m
+九百九十九步 2 m
+九百九十八 2 m
+九百九十六年 2 m
+九百二十二 2 m
+九百二十二万余两 2 m
+九百二十四名 2 m
+九百五十六万七千二百六十一户 2 m
+九百亩 8 m
+九百余万元 2 m
+九百余只 2 m
+九百余里 2 m
+九百八十卷 6 m
+九百六十万平方公里 9 m
+九百多 4 m
+九百多年 2 m
+九百多篇 2 m
+九百本 2 m
+九百等 2 m
+九百里 2 m
+九百门 2 m
+九皇 2 nz
+九皋 3 ns
+九眼 4 m
+九眼桥 5 nz
+九碗 5 m
+九种 32 m
+九秒 2 m
+九窍 3 n
+九章 297 m
+九章算术 3 n
+九篇 25 m
+九米 3 m
+九类 5 m
+九粒 4 m
+九级 30 m
+九线 262 nz
+九组 3 m
+九股 12 m
+九脸 3 m
+九腔 3 m
+九臂钹 3 nr
+九艘 3 m
+九色鹿 3 nz
+九节 36 t
+九节菖蒲 3 n
+九节鞭 31 nr
+九蒸三熯 3 nz
+九行八业 3 nz
+九街 3 ns
+九衢三市 3 v
+九袋 9 m
+九角 3 m
+九角形 3 n
+九评 2 j
+九课 3 n
+九谷 2 ns
+九路 13 m
+九转功成 3 i
+九轮 7 m
+九载 6 m
+九运 2 j
+九运会 15 nz
+九连 6 ns
+九连城 3 ns
+九连宝灯 3 nz
+九连山 15 ns
+九连环 10 ns
+九通 3 nz
+九道 54 m
+九郡 3 ns
+九部 28 m
+九里 34 m
+九里区 3 ns
+九里山 9 ns
+九里山乡 3 ns
+九里香 2 nr
+九重 174 m
+九重天 7 nz
+九重葛 3 nr
+九重霄 3 nr
+九针 3 n
+九门 169 ns
+九门提督 10 n
+九间 654 t
+九间大殿 3 nz
+九间朝殿 3 nz
+九阍虎豹 3 nz
+九队 6 m
+九阳 256 ns
+九阴真经 313 i
+九难 3 n
+九集 3 m
+九零 2 m
+九零年 3 m
+九霄 49 nr
+九霄云外 51 i
+九面 4 m
+九顶 8 m
+九项 8 m
+九颗 11 m
+九首 2 m
+九首歌 3 m
+九香虫 3 nr
+九鲤湖 3 ns
+九鼎 158 nz
+九鼎一丝 3 nz
+九鼎大吕 3 nr
+九龙 256 nz
+九龙区 3 ns
+九龙半岛 3 ns
+九龙县 3 ns
+九龙坡 6 ns
+九龙坡区 6 ns
+九龙城 4 ns
+九龙城区 2 ns
+九龙塘 3 ns
+九龙壁 7 ns
+九龙山 15 ns
+九龙杯 2 nz
+九龙江 43 ns
+九龙湖 2 ns
+九龙湾 3 ns
+乞 806 n
+乞丐 470 n
+乞乞缩缩 3 v
+乞儿 28 n
+乞儿乘车 3 n
+乞儿马医 3 n
+乞力马扎罗山 27 ns
+乞命 3 n
+乞和 3 ns
+乞哀告怜 3 nr
+乞婆 46 n
+乞巧 3 n
+乞怜 27 v
+乞怜摇尾 3 v
+乞恕 3 v
+乞悯告怜 3 nr
+乞援 15 v
+乞求 137 v
+乞浆得酒 3 n
+乞灵 3 n
+乞爱者 3 n
+乞穷俭相 3 vn
+乞粮 3 n
+乞讨 102 v
+乞讨者 5 n
+乞贷 3 n
+乞降 3 v
+乞食 34 n
+乞骸骨 5 n
+也 307851 d
+也好 2084 y
+也就是说 1430 l
+也无晴 3 l
+也罢 708 y
+也许 6846 d
+也门 234 d
+也门共和国 14 ns
+习 1216 v
+习与性成 3 i
+习中学 3 n
+习举业 2 n
+习举子 2 n
+习之法 3 nr
+习习 45 v
+习乾坤 2 nr
+习于 3 v
+习于久 16 nr
+习以为常 141 i
+习以成俗 3 i
+习以成性 3 nr
+习以成风 3 i
+习仲勋 22 nr
+习作 59 n
+习作簿 3 n
+习俗 1148 n
+习俗移性 3 n
+习军 3 n
+习吏幼 2 nr
+习吸星 3 n
+习天台 2 nr
+习天文 2 nr
+习好 3 n
+习孔教 3 nr
+习字 23 n
+习字帖 3 n
+习字本 3 n
+习字课 3 n
+习学得 2 nr
+习学记 4 n
+习定 3 n
+习家池 256 nr
+习小乘 2 nr
+习尚 29 n
+习平 10 n
+习弓马 2 nr
+习得白 2 nr
+习得行为 3 n
+习性 867 n
+习性学 3 n
+习惯 4593 n
+习惯于 318 v
+习惯势力 3 i
+习惯化 3 n
+习惯性 118 n
+习惯成自然 21 i
+习惯法 43 n
+习惯用法 3 n
+习惯用语 3 n
+习惯线 5 n
+习惯自然 3 i
+习战射 2 n
+习拳 5 n
+习故安常 3 i
+习文 6 n
+习斋记 2 nr
+习旅 8 n
+习服 3 n
+习染 3 v
+习气 104 n
+习水 3 n
+习水县 3 nr
+习水战 9 n
+习汉俗 7 nr
+习法相 2 nr
+习焉不察 3 nr
+习用 51 n
+习用语 3 n
+习相远 2 nr
+习称兀 2 nr
+习称葱 2 nr
+习称钦 2 nr
+习管弦 16 n
+习练 65 n
+习练未 2 nr
+习练经 2 n
+习而不察 3 v
+习艺 28 n
+习艺所 3 n
+习行 2 n
+习见 49 n
+习语 6 n
+习谚 3 n
+习近平 4 nrfg
+习非 3 n
+习非成是 2 i
+习非胜是 3 i
+习题 118 n
+习题课 3 n
+习题集 11 n
+乡 13348 n
+乡丁 2 n
+乡下 676 s
+乡下人 206 n
+乡下佬 3 l
+乡下城 3 n
+乡下老儿 3 l
+乡乡 7 n
+乡乡镇镇 2 n
+乡书难寄 3 n
+乡事会 3 n
+乡井 3 n
+乡亲 469 n
+乡亲们 3 n
+乡人 54 n
+乡企 3 n
+乡企局 3 n
+乡会 3 n
+乡佬 3 n
+乡俗 3 n
+乡党 58 n
+乡党委 25 n
+乡公所 3 n
+乡关 2 n
+乡农 74 n
+乡利倍义 3 n
+乡办 3 n
+乡办企业 3 n
+乡勇 3 n
+乡原 3 n
+乡友 3 n
+乡名 3 n
+乡味 3 n
+乡土 157 n
+乡土味 3 n
+乡土建筑 3 l
+乡土文学 18 l
+乡土气 3 n
+乡土气息 307 n
+乡土艺术 3 n
+乡土观念 3 n
+乡土风味 3 l
+乡城 2 n
+乡城县 3 ns
+乡塾 3 n
+乡壁虚造 3 l
+乡宁 3 n
+乡宁县 2 ns
+乡官 12 n
+乡宦 65 n
+乡居 3 n
+乡巴佬 46 l
+乡干部 3 n
+乡心 3 n
+乡思 7 n
+乡情 37 n
+乡愁 14 n
+乡愿 6 n
+乡政府 266 n
+乡曲 3 n
+乡村 2134 n
+乡村人口 3 n
+乡村化 3 n
+乡村干部 3 n
+乡村服 3 n
+乡村规划 3 n
+乡村音乐 3 n
+乡校 3 n
+乡民 129 n
+乡民代表 3 n
+乡气 3 n
+乡级 8 n
+乡绅 109 n
+乡规民约 7 n
+乡试 397 n
+乡谈 13 n
+乡谊 12 n
+乡贤 4 n
+乡运会 3 n
+乡邮 3 n
+乡邻 43 n
+乡里 253 s
+乡里乡亲 3 n
+乡野 27 n
+乡镇 1277 n
+乡镇代表 3 n
+乡镇企业 918 n
+乡镇企业局 5 n
+乡镇企业管理局 3 n
+乡镇党委 3 n
+乡镇场 2 n
+乡镇干部 3 n
+乡镇政府 3 n
+乡镇民代 3 n
+乡镇级 3 n
+乡镇经济 3 n
+乡镇财政 3 n
+乡镇长 7 n
+乡长 1301 n
+乡间 173 n
+乡间别墅 3 n
+乡音 43 n
+乡鸽不通 3 z
+乢 6 zg
+乥 6 zg
+书 18993 n
+书上 252 s
+书上门 3 n
+书不尽 3 i
+书不尽意 3 i
+书不尽言 4 i
+书不释手 3 i
+书业 8 n
+书丛 3 n
+书亭 4 n
+书仪 4 n
+书价 14 n
+书会 28 n
+书体 77 n
+书信 401 n
+书信体 12 n
+书信往来 3 i
+书信往返 3 i
+书信来往 3 i
+书信集 12 n
+书僮 64 n
+书册 12 n
+书写 1368 n
+书写台 3 n
+书写器 3 n
+书写困难 3 n
+书写方向 3 n
+书写纸 5 n
+书写能力 3 n
+书函 45 n
+书刊 152 n
+书刊号 3 n
+书刊市场 3 n
+书刊杂志 3 n
+书剑 4 n
+书剑飘零 3 i
+书包 206 n
+书包带 3 n
+书匠 3 n
+书协 8 j
+书单 9 n
+书卡 3 n
+书卷 30 n
+书卷气 24 n
+书友 3 n
+书友会 3 n
+书口 3 n
+书号 9 n
+书同文 8 n
+书名 187 n
+书名卡 3 n
+书名号 6 n
+书名目录 3 n
+书名索引 3 nr
+书名页 3 n
+书后 43 n
+书吏 47 n
+书吧 20 n
+书启 3 v
+书呆 3 v
+书呆子 142 n
+书呆子气 7 n
+书品 3 n
+书商 30 n
+书囊无底 3 i
+书圣 3 ns
+书场 26 n
+书坊 57 n
+书坛 14 n
+书城 276 n
+书堆 3 n
+书塾 3 n
+书声 8 n
+书声朗朗 4 ns
+书声琅琅 3 n
+书夹 3 n
+书契 3 n
+书套 2 n
+书学 3 n
+书室 6 n
+书家 3 n
+书富五车 3 n
+书局 104 n
+书屋 46 n
+书展 7 n
+书山 6 n
+书市 24 n
+书库 36 n
+书店 294 n
+书店价 3 n
+书店名称 3 n
+书归正传 3 i
+书录 16 n
+书形 3 n
+书影 226 n
+书志 5 n
+书我买 3 l
+书房 828 n
+书房门 18 n
+书扉 3 n
+书报 41 n
+书报亭 3 n
+书报刊 16 n
+书报摊 3 n
+书报杂志 3 n
+书报滩 3 n
+书报费 3 n
+书摊 22 n
+书摘 3 n
+书斋 55 n
+书明 3 n
+书本 564 n
+书本上 3 n
+书本子 9 n
+书本知识 3 n
+书本费 11 n
+书札 64 n
+书机 3 n
+书林 19 n
+书架 210 n
+书架上 3 n
+书架子 3 n
+书架箱 3 n
+书柜 37 n
+书标 3 n
+书案 97 n
+书桌 288 n
+书桌上 3 n
+书桌下 3 n
+书档 3 b
+书楼 7 n
+书橱 30 n
+书款 3 n
+书法 1114 n
+书法作品 3 n
+书法史 8 n
+书法家 252 n
+书法导报 6 n
+书法展 3 n
+书法报 3 n
+书法网 3 n
+书法艺术 3 n
+书法课 3 n
+书法集 10 n
+书海 10 n
+书牍 3 n
+书物 3 n
+书状 3 n
+书生 637 n
+书生之见 15 i
+书生本色 3 n
+书生气 13 n
+书用 3 n
+书画 913 n
+书画作品 3 n
+书画卯酉 3 l
+书画名家 3 n
+书画家 90 n
+书画展 27 n
+书画界 6 n
+书画社 3 n
+书画网 3 n
+书画艺术 3 n
+书画院 3 n
+书画集 5 n
+书痴 3 n
+书皮 6 n
+书目 515 n
+书目工作 3 n
+书眉 3 n
+书社 21 n
+书稿 108 n
+书空咄咄 3 i
+书立 6 v
+书童 73 n
+书符咒水 3 i
+书签 32 n
+书简 32 n
+书箧 3 i
+书箱 5 n
+书籍 1055 n
+书籍装帧 3 n
+书籍费 3 n
+书系 26 n
+书纪 2 n
+书经 3 n
+书缺有间 3 n
+书缺简脱 3 l
+书肆 3 n
+书背 9 n
+书脊 9 n
+书艺文 3 n
+书荒 3 n
+书虫 5 n
+书虫子 3 n
+书蠹 3 n
+书袋 3 n
+书讯 3 n
+书记 7681 n
+书记员 22 n
+书记处 228 n
+书记官 3 n
+书记长 17 n
+书论 3 n
+书证 16 n
+书评 50 n
+书评人 3 n
+书评请 3 nr
+书读五车 3 n
+书豪 2 n
+书账 10 n
+书贩 3 n
+书费 11 n
+书迷 3 n
+书通二酉 3 l
+书道 48 n
+书钉 3 n
+书铺 16 n
+书院 543 n
+书集 3 n
+书面 673 n
+书面上 3 n
+书面发言 3 n
+书面声明 3 i
+书面形式 3 n
+书面报告 3 n
+书面材料 3 n
+书面言语 3 i
+书面语 43 n
+书面语言 3 n
+书面资料 3 n
+书面通知 3 n
+书页 49 n
+书馆 13 n
+书馆儿 3 n
+书香 30 n
+书香世家 2 n
+书香人家 5 n
+书香园 3 n
+书香社会 3 n
+书香门户 3 n
+书香门第 32 n
+书龄 3 n
+乩 120 x
+乪 40 zg
+乬 41 zg
+乭 4 zg
+买 10529 v
+买一送一 3 l
+买上告下 3 l
+买上嘱下 3 l
+买下 219 v
+买下来 3 v
+买不到 3 v
+买不起 122 v
+买东买西 3 nrt
+买主 132 v
+买主儿 13 n
+买书 3 n
+买买 3 v
+买买提 272 n
+买些 3 nr
+买价 4 v
+买光 3 n
+买入 213 v
+买入价 9 n
+买关节 3 n
+买到 3 v
+买办 251 v
+买办资本 3 n
+买办阶级 3 n
+买单 97 n
+买卖 1832 v
+买卖业 3 n
+买卖人 20 n
+买卖双方 3 nr
+买卖合同 3 n
+买卖婚姻 3 n
+买卖成 3 v
+买卖方 3 n
+买卖网 3 n
+买卖通 3 n
+买博客 2 nr
+买去 3 v
+买受人 14 n
+买嘱 9 v
+买回 3 v
+买回去 3 l
+买回来 3 l
+买壳 3 n
+买好 63 v
+买定 3 v
+买定离手 3 n
+买客 2 n
+买家 163 n
+买帐 3 n
+买张 3 v
+买得 3 v
+买得起 53 v
+买成 3 v
+买户 3 n
+买房 259 n
+买房人 7 n
+买房子 3 n
+买房者 2 n
+买手 3 v
+买手机 3 n
+买担心 3 n
+买断 60 v
+买断式 3 n
+买方 238 n
+买方市场 3 n
+买春 3 v
+买来 292 v
+买来买去 3 l
+买椟还珠 3 nr
+买气 8 n
+买淫 3 v
+买点 114 n
+买点儿 8 v
+买爵贩官 3 v
+买牛卖剑 3 n
+买牛息戈 3 v
+买犁卖剑 3 n
+买犊卖刀 3 n
+买王得羊 3 l
+买田阳羡 3 nr
+买盘 3 v
+买碟 3 n
+买票 83 n
+买空 3 n
+买空卖空 7 n
+买笑寻欢 3 l
+买笑迎欢 3 nr
+买笑追欢 3 l
+买给 3 v
+买绢帛 2 nr
+买者 293 n
+买臣覆水 3 i
+买药 3 n
+买菜 3 n
+买菜求益 3 n
+买账 2 v
+买货 3 n
+买贱卖贵 3 i
+买起 3 v
+买超 3 v
+买路钱 19 n
+买车 3 n
+买辆 3 n
+买进 125 v
+买进卖出 10 v
+买通 30 v
+买醉 3 v
+买铁思金 3 n
+买静求安 3 i
+买面子 3 n
+买鞋 3 n
+买饭 3 v
+买马 3 v
+买马招兵 3 v
+买马招军 3 n
+乱 8329 d
+乱七八糟 277 i
+乱世 191 v
+乱世之音 3 i
+乱世佳人 3 i
+乱世儿女 3 n
+乱世凶年 3 i
+乱世英雄 3 i
+乱丝 3 n
+乱丢垃圾 3 n
+乱丢纸屑 3 v
+乱乎 3 z
+乱乱哄哄 3 z
+乱乱的 8 z
+乱乱纷纷 3 i
+乱乱腾腾 3 i
+乱乱轰轰 3 i
+乱了套 31 i
+乱了手脚 3 i
+乱了阵脚 3 i
+乱事 3 n
+乱云飞渡 4 l
+乱交 4 v
+乱伦 79 z
+乱估 3 v
+乱作一团 31 i
+乱作胡为 3 l
+乱倒 3 v
+乱倒垃圾 3 n
+乱免 3 v
+乱党 3 n
+乱兵 59 n
+乱写 3 v
+乱军 3 n
+乱冲 3 z
+乱切 3 z
+乱删 3 v
+乱刺 3 v
+乱加 3 v
+乱加干涉 3 i
+乱动 121 v
+乱占耕地 3 i
+乱发 67 v
+乱叫 192 v
+乱吵 3 v
+乱吼 3 v
+乱吼乱叫 3 n
+乱咬 3 v
+乱哄哄 103 z
+乱喊 3 v
+乱喊乱叫 3 i
+乱喝 3 v
+乱国 3 ns
+乱图 3 v
+乱坟岗 3 n
+乱坠天花 3 i
+乱堆 3 n
+乱头粗服 3 l
+乱套 31 n
+乱子 126 n
+乱射 3 v
+乱局 3 n
+乱序 3 n
+乱序执行 4 i
+乱序提交 3 i
+乱弄 3 v
+乱弹 34 n
+乱弹琴 32 n
+乱征 3 n
+乱性 3 n
+乱成 3 v
+乱成一团 146 i
+乱扑扑 3 z
+乱扒 3 n
+乱打 518 v
+乱扣帽子 3 l
+乱扯 3 v
+乱抄 3 v
+乱拥 3 v
+乱挤 3 v
+乱掉 3 v
+乱推 3 v
+乱提 3 n
+乱搞 32 v
+乱摊 3 v
+乱摊子 3 n
+乱摊派 3 n
+乱摸 3 v
+乱撞 3 z
+乱支 3 n
+乱收 3 v
+乱收费 3 n
+乱改 3 v
+乱放 26 v
+乱数 3 n
+乱杂 3 z
+乱来 46 v
+乱来乱去 3 i
+乱民 32 n
+乱泥 3 n
+乱流 88 n
+乱涂 3 z
+乱涂乱画 3 i
+乱涨 3 v
+乱涨价 3 i
+乱源 3 n
+乱滚 3 z
+乱点鸳鸯 3 i
+乱点鸳鸯谱 5 n
+乱烘烘 3 z
+乱猜 3 v
+乱猜瞎疑 3 i
+乱琼碎玉 3 i
+乱生 3 v
+乱画 3 n
+乱盖 3 v
+乱相 3 n
+乱真 15 v
+乱真谱带 3 n
+乱石 212 n
+乱石堆 32 n
+乱石山村 9 ns
+乱石滩 3 n
+乱码 10 n
+乱码转换 3 l
+乱砍 322 v
+乱砍乱伐 3 i
+乱砍滥伐 12 i
+乱神 3 n
+乱离 3 v
+乱穿 3 v
+乱窜 3 v
+乱答 3 v
+乱箭 3 n
+乱箭攒心 3 l
+乱糟 3 z
+乱糟糟 106 z
+乱纪 3 n
+乱纷纷 58 z
+乱罚款 3 n
+乱腾 3 z
+乱腾腾 3 z
+乱臣 3 n
+乱臣贼子 24 i
+乱舞 3 v
+乱花 3 n
+乱花渐欲迷人眼 2 i
+乱花钱 3 n
+乱葬 3 v
+乱葬岗 7 n
+乱葬岗子 2 n
+乱蓬蓬 43 z
+乱行 3 v
+乱视 3 v
+乱记 3 n
+乱讲 3 v
+乱设 3 v
+乱试 3 v
+乱语胡言 3 l
+乱说 167 v
+乱说一通 3 i
+乱说乱动 3 i
+乱说话 3 l
+乱调 3 v
+乱象 3 n
+乱账 3 v
+乱购 3 v
+乱贼 3 n
+乱跑 125 v
+乱跑乱跳 3 i
+乱蹦 3 z
+乱蹦乱跳 3 i
+乱转 3 v
+乱辱骂 3 i
+乱运 3 n
+乱送 3 v
+乱逛 3 v
+乱邦 3 n
+乱采 10 v
+乱锯 3 v
+乱闯 3 v
+乱闹 3 z
+乱飞 97 v
+乱首垢面 3 i
+乱马 3 n
+乱骂 3 v
+乱骑 3 n
+乱鸦 3 n
+乱麻 42 z
+乱麻麻 3 z
+乳 835 ng
+乳业 53 n
+乳交 3 n
+乳儿 8 n
+乳光 3 n
+乳制品 84 n
+乳制品厂 3 n
+乳剂 101 n
+乳化 51 n
+乳化剂 98 n
+乳化塔 3 n
+乳化机 3 n
+乳化油 3 n
+乳化液 3 n
+乳名 54 n
+乳品 75 n
+乳品业 3 n
+乳品厂 4 n
+乳声乳气 3 n
+乳夜 3 n
+乳头 266 n
+乳头状 3 n
+乳头肌 3 n
+乳娘 7 n
+乳山 13 n
+乳山县 3 ns
+乳山市 8 ns
+乳峰 3 n
+乳房 586 n
+乳房状 3 n
+乳晕 3 n
+乳根 3 n
+乳母 97 n
+乳比重计 3 i
+乳汁 207 n
+乳汁状 3 n
+乳沟 3 n
+乳油 2 n
+乳浆 5 n
+乳浊 2 n
+乳浊剂 3 n
+乳浊液 6 n
+乳液 64 n
+乳液聚合 3 n
+乳清 6 n
+乳清粉 3 n
+乳源 3 n
+乳源瑶族自治县 6 ns
+乳熟期 2 n
+乳燕 6 n
+乳燕营巢 3 n
+乳牙 11 ns
+乳牙列 3 ns
+乳牙早失 3 i
+乳牙残余 3 i
+乳牙滞留 3 i
+乳牛 32 n
+乳状 3 n
+乳状液 27 n
+乳状物 3 n
+乳猪 10 n
+乳疾灵 3 n
+乳癌 68 n
+乳白 36 n
+乳白色 380 n
+乳突 54 n
+乳突炎 3 n
+乳类 3 n
+乳粉 18 n
+乳粥 3 n
+乳糖 89 n
+乳糖酶 3 n
+乳糜 21 n
+乳糜管 3 vn
+乳紫色 3 n
+乳线 3 n
+乳罩 39 n
+乳胶 80 n
+乳胶制品 3 n
+乳胶手套 3 nz
+乳胶漆 2 n
+乳胶版 3 n
+乳脂 4 n
+乳脂状 3 n
+乳脂糖 3 n
+乳脂酸 3 n
+乳腐 2 n
+乳腺 288 n
+乳腺炎 17 n
+乳腺病 3 n
+乳腺瘤 2 n
+乳腺癌 457 n
+乳膏 4 n
+乳臭 9 n
+乳臭未乾 3 i
+乳臭未干 27 i
+乳臭未除 3 i
+乳草 3 n
+乳虎 3 n
+乳虎啸 3 n
+乳质 3 n
+乳透 3 nz
+乳酒 3 n
+乳酪 66 n
+乳酶 3 n
+乳酸 141 n
+乳酸杆菌 3 n
+乳酸盐 3 n
+乳酸菌 28 n
+乳酸钙 2 n
+乳酸饮料 3 n
+乳钵 3 n
+乳链菌肽 8 nz
+乳间股脚 3 n
+乳饮料 30 n
+乳饼 3 n
+乳香 21 n
+乳香树 3 n
+乳香脂 3 n
+乳鸽 5 n
+乳黄 6 n
+乳黄色 14 n
+乳齿 16 n
+乴 7 zg
+乵 3 zg
+乸 5 zg
+乹 2 zg
+乺 28 zg
+乻 2 zg
+乾 1551 zg
+乾上 3 t
+乾个够 3 nr
+乾乾净净 3 nr
+乾乾翼翼 3 nr
+乾儿子 3 nr
+乾净俐落 3 nr
+乾县 19 ns
+乾咳 3 n
+乾哥哥 3 nr
+乾嘉学派 22 nr
+乾坤 342 nz
+乾坤袋 3 ns
+乾女儿 3 nr
+乾妹妹 3 nr
+乾姊姊 3 nr
+乾季 3 t
+乾安 3 nr
+乾安县 3 ns
+乾巴巴 3 nr
+乾弟弟 3 nr
+乾性 3 n
+乾性皮肤 3 n
+乾打雷 3 nr
+乾旱 3 nr
+乾旱地区 3 n
+乾杯 3 nz
+乾柴 3 nz
+乾柴烈火 3 nr
+乾洗店 3 n
+乾燥 3 nr
+乾燥剂 3 nz
+乾燥器 3 nz
+乾燥机 3 nz
+乾燥箱 3 nz
+乾爸 3 n
+乾爸爸 3 nr
+乾片 3 n
+乾电池 3 nz
+乾瘦 3 n
+乾瘪瘪 3 z
+乾癣 3 n
+乾眼病 3 nr
+乾着急 3 n
+乾瞪眼 3 n
+乾端坤倪 3 nr
+乾粮 3 j
+乾肉片 3 nz
+乾脆 3 nz
+乾草叉 3 nr
+乾草堆 3 nr
+乾草机 3 nr
+乾菜 3 n
+乾裂 3 n
+乾酪 3 n
+乾闼婆 3 v
+乾陵 17 nr
+乾隆 2435 nr
+乾隆帝 3 nr
+乾隆年间 3 n
+乾隆皇帝 3 nr
+乾饭 3 n
+乾馏 3 n
+乾馏法 3 n
+乾鲜 3 ns
+亀 4 zg
+亂 6 zg
+亃 88 zg
+了 883634 ul
+了不可见 3 i
+了不得 179 v
+了不相涉 3 i
+了不起 826 v
+了不长进 3 i
+了了 3 v
+了了可见 3 i
+了事 156 v
+了哥王 3 nr
+了如指掌 126 i
+了得 226 v
+了悟 15 v
+了愿 3 v
+了断 52 v
+了无惧色 3 nr
+了无生趣 9 i
+了无痕迹 3 l
+了暧昧 3 nr
+了望 3 v
+了望台 3 nr
+了望塔 3 nr
+了望所 3 i
+了案 3 v
+了此一生 8 i
+了此心愿 3 i
+了此残生 3 i
+了然 95 a
+了然于心 3 i
+了然于胸 48 i
+了然无闻 3 i
+了结 330 v
+了若指掌 25 i
+了解 11774 v
+了身脱命 3 i
+了身达命 3 l
+予 1068 vg
+予人口实 3 i
+予付 3 v
+予以 2431 v
+予以安排 3 i
+予以强调 3 i
+予以注册 3 i
+予以考虑 3 i
+予以重创 3 i
+予及 3 v
+予取予夺 3 i
+予取予携 3 i
+予取予求 3 i
+予夺生杀 3 i
+予智予雄 3 i
+予期 3 v
+予齿去角 3 i
+争 3841 v
+争上游 3 v
+争产 3 vn
+争价 3 vn
+争优 3 v
+争作 3 vn
+争做 26 v
+争先 92 vn
+争先发言 3 i
+争先后 3 i
+争先恐后 131 i
+争光 68 n
+争光奖 2 n
+争光荣 3 i
+争冠 16 n
+争出 3 v
+争分夺妙 3 i
+争分夺秒 31 i
+争创 48 v
+争利 3 vn
+争利益 3 n
+争前恐后 3 i
+争办 3 v
+争功 3 v
+争功劳 3 i
+争功诿过 3 v
+争取 4048 v
+争取和平 3 i
+争取时间 3 l
+争口气 3 n
+争吃 3 v
+争名 3 v
+争名利 3 l
+争名夺利 7 i
+争名竞利 3 l
+争名谋位 3 n
+争吵 574 v
+争吵不休 3 l
+争吵声 10 v
+争嘴 3 v
+争多论少 3 l
+争天抗俗 3 i
+争夺 2142 v
+争夺战 96 i
+争夺者 9 n
+争奇斗艳 162 l
+争妍 12 v
+争妍斗丽 3 v
+争妍斗胜 3 v
+争妍斗艳 3 v
+争宠 43 vn
+争强 3 v
+争强好胜 34 i
+争强斗狠 3 i
+争强斗胜 7 l
+争强显胜 3 i
+争当 23 v
+争得 147 v
+争战 55 v
+争执 624 v
+争执不下 3 i
+争执性 3 n
+争抢 143 v
+争持 46 v
+争持不下 3 i
+争搏 3 v
+争收 3 v
+争斗 467 vn
+争斗不休 3 l
+争斤论两 3 i
+争权 77 n
+争权力 3 n
+争权夺利 107 l
+争权攘利 3 i
+争气 222 n
+争求 3 v
+争点 3 n
+争猫丢牛 3 vn
+争相 517 n
+争相抢购 3 n
+争相罗致 3 i
+争短论长 3 l
+争竞 37 v
+争端 497 n
+争胜 62 v
+争胜好强 3 i
+争胜行为 3 i
+争脸 3 v
+争艳 5 a
+争芳斗艳 3 l
+争荣夸耀 3 n
+争衡 3 v
+争议 1105 n
+争议地区 3 n
+争议性 9 n
+争议榜 3 n
+争论 1337 v
+争论不休 65 l
+争论点 3 n
+争论者 3 n
+争讼 3 vn
+争讼不已 3 n
+争购 14 v
+争起 3 v
+争辉 24 n
+争辨 3 v
+争辩 321 v
+争过 3 v
+争逐 3 v
+争金夺银 2 n
+争锋 36 v
+争锋吃醋 3 i
+争长 3 v
+争长竞短 3 i
+争长论短 3 i
+争闹 52 v
+争雄 78 n
+争雄记 3 n
+争霸 165 v
+争霸战 3 i
+争霸赛 8 n
+争风吃醋 37 i
+争食 17 v
+争鲜斗艳 3 i
+争鸡失羊 3 i
+争鸣 40 v
+亊 10 zg
+事 44769 n
+事不关己 29 l
+事不宜迟 144 l
+事不师古 3 l
+事不有余 3 l
+事不过三 14 l
+事与原违 3 i
+事与心违 3 i
+事与愿违 67 i
+事业 10025 n
+事业兴旺 3 l
+事业单位 3 n
+事业团 3 n
+事业型 5 n
+事业年度 3 n
+事业心 83 n
+事业性 16 n
+事业成功 3 n
+事业有成 34 l
+事业费 14 n
+事业部 124 n
+事业部制 8 n
+事主 28 n
+事事 295 n
+事事处处 6 l
+事事如意 3 l
+事事物物 3 n
+事事躬亲 3 n
+事亲至孝 3 l
+事以密成 3 l
+事件 7578 n
+事件处理 6 l
+事件报告 4 n
+事件真相 3 l
+事件簿 3 n
+事件调查 3 l
+事件间隔 3 l
+事件队列 3 l
+事件驱动 2 l
+事体 94 n
+事例 581 n
+事倍功半 17 n
+事假 10 n
+事儿 1886 n
+事先 1601 d
+事关 444 n
+事关全局 5 n
+事关大局 3 l
+事关重大 85 l
+事典 17 n
+事出不意 3 l
+事出无奈 3 i
+事出有因 41 n
+事出肘腋 3 i
+事到临头 109 l
+事到如今 3 l
+事前 304 t
+事前事后 3 l
+事功 13 n
+事务 5380 n
+事务主义 3 n
+事务司 7 n
+事务员 5 n
+事务处 41 n
+事务处理 3 l
+事务官 3 n
+事务局 93 n
+事务性 38 n
+事务所 674 n
+事务所律师 25 n
+事务故障 3 n
+事务时 15 n
+事务管理 3 n
+事务繁多 3 l
+事务署 8 n
+事务股 3 n
+事务部 58 n
+事务部长 8 n
+事务长 14 n
+事势 3 n
+事半功倍 90 l
+事半功百 3 i
+事危累卵 3 i
+事发 175 n
+事变 594 n
+事后 576 t
+事后诸葛 3 l
+事后诸葛亮 6 l
+事在人为 24 l
+事在必行 3 l
+事在萧墙 3 i
+事宜 754 n
+事实 4593 n
+事实上 2752 l
+事实如此 3 l
+事实婚 7 l
+事实性 3 l
+事实标准 3 n
+事实根据 3 l
+事实清楚 3 l
+事实真相 3 l
+事实真象 3 l
+事实确凿 3 l
+事实简述 3 l
+事实胜于 3 l
+事实胜于雄辩 7 l
+事实证明 3 l
+事实陈述 3 n
+事宽则圆 3 l
+事宽即圆 3 i
+事已如此 3 l
+事已至此 3 l
+事往日迁 3 i
+事必躬亲 33 i
+事态 527 n
+事态严重 3 l
+事态法 2 n
+事情 15354 n
+事成之后 3 l
+事捷功倍 3 l
+事故 1766 n
+事故保险 3 n
+事故倾向 3 n
+事故学 3 n
+事故率 9 n
+事故现场 3 n
+事故责任 3 l
+事故隐患 3 i
+事无二成 3 l
+事无大小 8 l
+事无巨细 34 i
+事无常师 3 l
+事有必至 3 l
+事机 33 n
+事权 79 n
+事核言直 3 n
+事檎 3 n
+事母至孝 3 l
+事毕 3 n
+事火咒龙 3 i
+事物 4044 n
+事物本质 3 n
+事理 97 n
+事生肘腋 3 i
+事由 107 n
+事略 33 n
+事相 3 n
+事竟成 3 i
+事端 137 n
+事缓则圆 3 i
+事败 3 n
+事败垂成 3 l
+事过境迁 19 i
+事过情迁 3 i
+事过景迁 3 i
+事迹 722 n
+事迹报告 3 l
+事迹材料 3 l
+事隔 3 n
+事隔多年 3 l
+事非得已 3 l
+事项 2572 n
+事预则立 3 l
+事齐事楚 3 l
+二 26135 m
+二一一 2 m
+二一五 56 m
+二一六年 2 m
+二一回 2 m
+二一添作五 15 l
+二丁 3 nrt
+二丁挂 3 n
+二七 316 m
+二七区 3 ns
+二七路 257 m
+二万 112 m
+二万一千七百六十五两 2 m
+二万万两 6 m
+二万三万 2 m
+二万两 26 m
+二万个 3 m
+二万二三千 2 m
+二万二千八百七十七卷 2 m
+二万五千 9 m
+二万五千元 2 m
+二万五千名 2 m
+二万五千里 32 m
+二万五千里长征 146 i
+二万人 3 nrt
+二万余 17 m
+二万余箱 2 m
+二万余里 2 m
+二万八千九百五十五 2 m
+二万名 7 m
+二万块 2 m
+二万多 40 m
+二万多两 2 m
+二万左右 2 m
+二万平方米 2 m
+二万年 2 m
+二万户 6 m
+二万斤 2 m
+二丈 68 m
+二三 124 m
+二三万 17 m
+二三丈 3 m
+二三两 7 m
+二三个 9 m
+二三例 16 m
+二三倍 2 m
+二三公里 4 m
+二三其德 3 ns
+二三其意 3 i
+二三具 2 m
+二三分 5 m
+二三十 206 m
+二三十万 31 m
+二三十万元 4 m
+二三十丈 6 m
+二三十两 5 m
+二三十个 46 m
+二三十亩 4 m
+二三十位 2 m
+二三十倍 3 m
+二三十元 5 m
+二三十匹 4 m
+二三十只 5 m
+二三十号 2 m
+二三十名 11 m
+二三十块 5 m
+二三十天 2 m
+二三十家 5 m
+二三十岁 12 m
+二三十幢 2 m
+二三十年 59 m
+二三十户 6 m
+二三十所 2 m
+二三十招 16 m
+二三十斤 4 m
+二三十条 4 m
+二三十架 2 m
+二三十根 3 m
+二三十次 5 m
+二三十步 2 m
+二三十米 6 m
+二三十道 4 m
+二三十里 19 m
+二三千 16 m
+二三千年 5 m
+二三千米 3 m
+二三卷 2 m
+二三句 2 m
+二三君子 3 nr
+二三周 2 m
+二三品 2 m
+二三天 3 m
+二三寸 3 m
+二三尺 14 m
+二三层 7 m
+二三年 27 m
+二三成 11 m
+二三斤 3 m
+二三日 9 m
+二三月 47 m
+二三月份 3 nz
+二三期 2 m
+二三次 2 m
+二三流 7 j
+二三百 69 m
+二三百万 7 m
+二三百万两 4 m
+二三百万年 4 m
+二三百两 3 m
+二三百个 8 m
+二三百元 7 m
+二三百只 3 m
+二三百名 3 m
+二三百块 3 m
+二三百年 6 m
+二三百户 2 m
+二三百斤 5 m
+二三百条 2 m
+二三百株 2 m
+二三百步 2 m
+二三百片 2 m
+二三百种 3 m
+二三百米 11 m
+二三百里 7 m
+二三米 5 m
+二三起 2 m
+二三里 37 m
+二下 11 m
+二不休 88 l
+二不怕死 9 l
+二专 3 j
+二专制 3 j
+二世 671 nrt
+二两 136 m
+二两五 3 m
+二两册 2 m
+二两米 2 m
+二个 186 m
+二个月 3 m
+二中 556 nrt
+二中全会 243 j
+二中院 3 j
+二义 2 n
+二义性 3 n
+二乎 3 c
+二乘幂 3 nr
+二乙二醇 3 nz
+二乙烯苯 3 nz
+二乙胺 2 nz
+二乙胺基 3 nz
+二乙醇胺 4 nz
+二九 7 m
+二九一十八 3 m
+二九二 2 m
+二二 8 m
+二二八 62 m
+二二得四 3 i
+二二拍子 3 l
+二五 17 m
+二五一十 3 m
+二五仔 3 nr
+二五八团 8 m
+二五户 2 m
+二五眼 21 m
+二亩 59 m
+二人 7705 nrt
+二人份 3 m
+二人同心 3 l
+二人组 3 m
+二人转 65 l
+二亿 20 m
+二亿七千万吨 2 m
+二亿三千多万 17 m
+二亿两 6 m
+二亿二千三百万 17 m
+二亿二千二百三十三万余两 2 m
+二亿二千八百六十三万元 2 m
+二亿人 3 l
+二亿四百九十七万余两 2 m
+二付 3 n
+二仙 2 n
+二代 93 t
+二代证 3 j
+二件 11 m
+二件套 3 l
+二价 31 n
+二份 8 m
+二伍 3 n
+二伏 6 j
+二传 14 b
+二传手 12 n
+二伯 19 nrt
+二伯母 3 nr
+二伯父 3 nrt
+二位 929 m
+二位数 3 n
+二体问题 3 l
+二佛涅槃 3 ns
+二倍 36 m
+二倍体 55 n
+二倍性 3 b
+二元 219 m
+二元关系 2 l
+二元化 4 t
+二元论 28 n
+二元酸 10 n
+二元醇 9 n
+二党制 3 n
+二八 67 m
+二八佳人 3 i
+二八十六 3 m
+二八年华 3 nz
+二八线 8 m
+二八面 2 m
+二六 16 m
+二六二 2 m
+二六五 6 m
+二关 3 ns
+二具 3 m
+二册 7 m
+二冲程 3 n
+二刀 3 m
+二分 417 m
+二分之一 5 m
+二分明月 3 n
+二分法 3 n
+二分点 7 m
+二分线 3 m
+二分院 3 n
+二分音符 3 n
+二划 3 n
+二列 8 m
+二列相关 3 ns
+二则 468 c
+二副 12 m
+二动 3 b
+二化螟 17 n
+二匹 11 m
+二区 3 n
+二医大 2 nz
+二十 1408 m
+二十一 346 m
+二十一万 3 m
+二十一万元 2 m
+二十一万八千两 2 m
+二十一世纪出版社 8 nt
+二十一个 10 m
+二十一中 3 nrt
+二十一二岁 10 m
+二十一分 8 m
+二十一卷 3 m
+二十一名 7 m
+二十一团 2 m
+二十一天 7 m
+二十一家 2 m
+二十一局 2 m
+二十一岁 67 m
+二十一幅 2 m
+二十一年 248 m
+二十一座 2 m
+二十一折 2 m
+二十一日 83 m
+二十一时 3 m
+二十一本 2 m
+二十一条 344 m
+二十一部 2 m
+二十一间 3 m
+二十一项 2 m
+二十七 94 m
+二十七个 11 m
+二十七中 3 nz
+二十七八 7 m
+二十七八岁 13 m
+二十七分 2 m
+二十七名 3 m
+二十七天 4 m
+二十七家 2 m
+二十七岁 25 m
+二十七席 4 m
+二十七年 580 m
+二十七所 2 m
+二十七日 334 m
+二十七秒 2 m
+二十七章 2 m
+二十七级 2 m
+二十万 260 m
+二十万万马克 2 m
+二十万两 118 m
+二十万两匹 8 m
+二十万人次 2 m
+二十万件 2 m
+二十万元 9 m
+二十万全部 2 m
+二十万具 2 m
+二十万匹 3 m
+二十万套 9 m
+二十万左右 3 m
+二十万平方米 2 m
+二十万斤 2 m
+二十万零九百一十一 2 m
+二十丈 20 m
+二十三 107 m
+二十三两三 2 m
+二十三个 10 m
+二十三中 3 nz
+二十三亿美元 2 m
+二十三十 3 m
+二十三名 3 m
+二十三四岁 14 m
+二十三处 2 m
+二十三家 2 m
+二十三层 4 m
+二十三届 4 m
+二十三岁 46 m
+二十三年 242 m
+二十三座 2 m
+二十三日 85 m
+二十三时 3 m
+二十三条 21 m
+二十三路 5 m
+二十三道 2 m
+二十世纪 3 nz
+二十两 90 m
+二十两重 2 m
+二十个 182 m
+二十九 96 m
+二十九万二 2 m
+二十九个 21 m
+二十九中 3 nz
+二十九件 6 m
+二十九任 2 m
+二十九卷 5 m
+二十九名 8 m
+二十九员 2 m
+二十九岁 16 m
+二十九年 178 m
+二十九座 2 m
+二十九日 69 m
+二十九条 3 m
+二十九笔 4 m
+二十九篇 2 m
+二十九艘 2 m
+二十二 85 m
+二十二万 9 m
+二十二三岁 9 m
+二十二个 22 m
+二十二中 3 nz
+二十二代 2 m
+二十二位 3 m
+二十二卷 2 m
+二十二只 2 m
+二十二号 14 m
+二十二名 2 m
+二十二团 4 m
+二十二处 2 m
+二十二尊 2 m
+二十二届 2 m
+二十二岁 40 m
+二十二年 291 m
+二十二日 73 m
+二十二时 3 m
+二十二条 2 m
+二十二点 7 m
+二十二艘 2 m
+二十二行 3 m
+二十二里 2 m
+二十五 263 m
+二十五万 15 m
+二十五万两 2 m
+二十五万五千两 4 m
+二十五万人次 3 m
+二十五万匹 2 m
+二十五两 5 m
+二十五个 16 m
+二十五中 3 l
+二十五亩 2 m
+二十五倍 3 m
+二十五元 5 m
+二十五六岁 13 m
+二十五分 2 m
+二十五史 3 nz
+二十五员 2 m
+二十五团 2 m
+二十五块 4 m
+二十五处 2 m
+二十五家 2 m
+二十五届 3 m
+二十五岁 33 m
+二十五年 249 m
+二十五斤 5 m
+二十五日 12 m
+二十五条 2 m
+二十五次 2 m
+二十五款 2 m
+二十五米 2 m
+二十五艘 3 m
+二十五里 14 m
+二十五顷 2 m
+二十五项 2 m
+二十亩 22 m
+二十亿 8 m
+二十亿元 2 m
+二十份 2 m
+二十位 7 m
+二十余 148 m
+二十余万 37 m
+二十余万口 3 m
+二十余万平方公里 2 m
+二十余丈 23 m
+二十余个 5 m
+二十余件 3 m
+二十余位 3 m
+二十余口 2 m
+二十余只 7 m
+二十余名 32 m
+二十余处 3 m
+二十余天 5 m
+二十余家 7 m
+二十余封 2 m
+二十余岁 12 m
+二十余年 144 m
+二十余招 41 m
+二十余斤 2 m
+二十余日 23 m
+二十余条 2 m
+二十余枚 2 m
+二十余架 2 m
+二十余样 2 m
+二十余次 3 m
+二十余种 9 m
+二十余艘 7 m
+二十余载 6 m
+二十余里 80 m
+二十余间 2 m
+二十倍 16 m
+二十元 42 m
+二十八 109 m
+二十八万 3 m
+二十八万五千两 2 m
+二十八万户 2 m
+二十八个 12 m
+二十八中 3 l
+二十八九岁 8 m
+二十八分 2 m
+二十八员 5 m
+二十八处 2 m
+二十八宿 106 l
+二十八岁 34 m
+二十八席 2 m
+二十八年 208 m
+二十八招 2 m
+二十八支 2 m
+二十八文 2 m
+二十八日 95 m
+二十八期 2 m
+二十八次 2 m
+二十八点 3 m
+二十八种 2 m
+二十八篇 2 m
+二十八行 2 m
+二十八辆 2 m
+二十公里 8 m
+二十六 103 m
+二十六七 3 m
+二十六七岁 12 m
+二十六万余 2 m
+二十六两卷 2 m
+二十六个 8 m
+二十六中 3 nrt
+二十六位 3 m
+二十六元 3 m
+二十六岁 42 m
+二十六席 2 m
+二十六年 362 m
+二十六座 2 m
+二十六日 77 m
+二十六条 2 m
+二十六点 2 m
+二十六艘 3 m
+二十几 22 m
+二十几万 6 m
+二十几丈 2 m
+二十几两 4 m
+二十几个 75 m
+二十几位 3 m
+二十几元 2 m
+二十几分钟 2 m
+二十几匹 2 m
+二十几发 2 m
+二十几只 7 m
+二十几名 16 m
+二十几天 7 m
+二十几头 2 m
+二十几层 2 m
+二十几岁 21 m
+二十几年 34 m
+二十几度 3 m
+二十几座 3 m
+二十几条 3 m
+二十几步 2 m
+二十几米 6 m
+二十几里 6 m
+二十出 3 m
+二十出头 26 m
+二十分 9 m
+二十分钟 38 m
+二十匹 18 m
+二十华里 3 m
+二十卷 25 m
+二十厘米 7 m
+二十发 7 m
+二十只 26 m
+二十名 104 m
+二十吨 2 m
+二十员 5 m
+二十周岁 3 m
+二十周年 5 m
+二十品 5 m
+二十响 28 m
+二十四 313 m
+二十四万 6 m
+二十四万一千七百余两 2 m
+二十四万亩 2 m
+二十四万枚 2 m
+二十四丈 2 m
+二十四两 4 m
+二十四个 52 m
+二十四中 3 nz
+二十四五 6 m
+二十四五岁 9 m
+二十四代 2 m
+二十四份 2 m
+二十四位 3 m
+二十四分 3 m
+二十四匹 2 m
+二十四卷 3 m
+二十四只 12 m
+二十四史 47 nz
+二十四名 10 m
+二十四员 4 m
+二十四块 3 m
+二十四孝 3 nr
+二十四家 3 m
+二十四小 3 l
+二十四岁 30 m
+二十四席 2 m
+二十四幅 2 m
+二十四平方公里 4 m
+二十四年 518 m
+二十四座 11 m
+二十四所 2 m
+二十四把 7 m
+二十四支 2 m
+二十四斤 2 m
+二十四日 71 m
+二十四时 3 m
+二十四条 7 m
+二十四枚 2 m
+二十四枝 4 m
+二十四款 2 m
+二十四步 2 m
+二十四点 2 m
+二十四番 12 m
+二十四种 3 m
+二十四篇 6 m
+二十四节 2 m
+二十四节气 60 l
+二十四路 5 m
+二十四部 7 m
+二十四门 6 m
+二十四间 2 m
+二十四页 2 m
+二十四颗 3 m
+二十四首 2 m
+二十块 40 m
+二十多 39 m
+二十多一点 2 m
+二十多万 29 m
+二十多丈 2 m
+二十多两 5 m
+二十多个 71 m
+二十多亩 5 m
+二十多位 4 m
+二十多元 2 m
+二十多公里 4 m
+二十多分钟 3 m
+二十多匹 3 m
+二十多口 3 m
+二十多只 2 m
+二十多名 16 m
+二十多场 2 m
+二十多块 3 m
+二十多天 44 m
+二十多家 5 m
+二十多封 3 m
+二十多岁 89 m
+二十多年 321 m
+二十多户 2 m
+二十多斤 4 m
+二十多条 3 m
+二十多架 2 m
+二十多次 3 m
+二十多种 2 m
+二十多篇 2 m
+二十多米 9 m
+二十多辆 3 m
+二十多里 16 m
+二十大 48 nrt
+二十天 77 m
+二十头 9 m
+二十套 6 m
+二十好几 4 m
+二十家 6 m
+二十尊 3 m
+二十岁 244 m
+二十峰 2 m
+二十年 1227 m
+二十年代 3 m
+二十度 6 m
+二十张 5 m
+二十招 4 m
+二十捆 2 m
+二十支 5 m
+二十文 5 m
+二十斤 36 m
+二十日 125 m
+二十时 5 m
+二十有余 2 m
+二十条 4 m
+二十枚 7 m
+二十株 2 m
+二十根 5 m
+二十桌 2 m
+二十次 8 m
+二十款 2 m
+二十步 10 m
+二十点 6 m
+二十碗 3 m
+二十种 4 m
+二十篇 2 m
+二十米 102 m
+二十艘 3 m
+二十许 2 m
+二十载 5 m
+二十通 2 m
+二十遍 5 m
+二十部 10 m
+二十里 182 m
+二十锭 3 m
+二十门 3 m
+二十面 8 m
+二十页 3 m
+二十顷 6 m
+二十首 6 m
+二千 223 m
+二千一百七十六万五千四百文 2 m
+二千一百名 2 m
+二千七百万 2 m
+二千万 12 m
+二千万两 3 m
+二千三百九十一条 2 m
+二千两 68 m
+二千个 3 m
+二千九百两 2 m
+二千五百 12 m
+二千五百两 3 m
+二千五百五十四公里 2 m
+二千五百元 4 m
+二千五百六十余 2 m
+二千五百户 2 m
+二千五百颗 2 m
+二千人 3 l
+二千亿颗 2 m
+二千余 33 m
+二千余名 10 m
+二千余年 6 m
+二千元 4 m
+二千八百六十五万余两 2 m
+二千六百户 2 m
+二千分 17 m
+二千匹 3 m
+二千名 9 m
+二千吨 2 m
+二千块 3 m
+二千多 3 m
+二千多万册 2 m
+二千多名 3 m
+二千多吨 2 m
+二千多年 17 m
+二千多里 2 m
+二千尺 2 m
+二千平方米 128 m
+二千年 25 m
+二千户 4 m
+二千文 2 m
+二千斤 4 m
+二千石 3 nr
+二千艘 2 m
+二千辆 2 m
+二千里 13 m
+二千锤 3 m
+二半 3 m
+二卵双生 3 nr
+二卵生 3 n
+二卷 44 m
+二叉 3 b
+二叉树 3 n
+二发 8 j
+二叔 3 nrt
+二叔叔 3 nr
+二变量 3 l
+二叠 54 m
+二叠系 31 b
+二叠纪 94 t
+二口 8 m
+二口网络 3 n
+二句 26 m
+二句话 3 c
+二只 7 m
+二台 25 m
+二台子乡 3 ns
+二叶 20 t
+二号 209 m
+二号分机 3 n
+二号机 3 n
+二号桥 3 n
+二号楼 3 n
+二号线 7 n
+二合 8 b
+二合一 4 b
+二名 27 m
+二向色性 3 n
+二员 39 n
+二周 9 m
+二周目 3 n
+二味 4 m
+二品 215 n
+二哥 714 ns
+二四 15 m
+二四个 3 m
+二四六 7 m
+二四步 2 m
+二回 24 m
+二回熟 3 l
+二团 5 m
+二圆 3 n
+二地主 3 n
+二场 2 m
+二块 7 m
+二块钱 3 n
+二坚为灾 3 i
+二垒 3 n
+二垒手 3 n
+二堂 16 n
+二堂哥 3 nr
+二堂妹 3 nr
+二堂姊 3 nr
+二堂姊夫 3 nr
+二堂嫂 3 nr
+二堂弟 3 nr
+二声 4 m
+二处 56 m
+二外 41 c
+二多 12 m
+二夜 2 m
+二天 24 m
+二天晒网 3 nz
+二头 9 m
+二头肌 3 n
+二夹弦 2 i
+二奖 3 nz
+二套 11 m
+二女一男 3 nr
+二女二男 3 nr
+二女儿 3 n
+二奶 108 n
+二妈 3 n
+二妙散 3 i
+二妹 3 n
+二妹夫 3 nr
+二姊夫 3 nr
+二姐 3 n
+二姑 3 n
+二姑丈 3 n
+二姑妈 3 n
+二姑母 3 n
+二姓为好 3 i
+二姓之好 3 i
+二姨 3 n
+二姨妈 3 nr
+二娘 134 n
+二婚 3 n
+二婚头 4 n
+二婶 3 n
+二婶婆 3 nr
+二嫂 68 n
+二子 3 n
+二子一女 3 l
+二子二女 3 l
+二字词 3 n
+二季 16 m
+二季度 3 mq
+二宇 2 n
+二宗 25 nrt
+二审 28 b
+二家 45 m
+二寸 61 m
+二封 8 m
+二尊 14 m
+二小 31 b
+二少爷 3 nr
+二尖瓣 54 b
+二尺 135 m
+二尾 2 nrt
+二局 6 n
+二局上半 3 i
+二局下半 3 i
+二层 133 m
+二居室 3 nr
+二届 104 m
+二届国代 3 nz
+二岁 15 m
+二峰 3 nrt
+二巯基丙 3 nz
+二帝 10 nrt
+二席 3 n
+二幅 3 m
+二年 2328 m
+二年制 3 b
+二年生 3 b
+二年级 3 b
+二年计划 3 n
+二度 93 n
+二度春 3 ns
+二度梅 5 nz
+二座 15 m
+二异氰酸酯 2 nz
+二式 3 b
+二弟 3 n
+二张 30 m
+二弦 3 n
+二当家 3 l
+二形人 3 n
+二律背反 3 i
+二心 32 n
+二心三意 3 i
+二心两意 3 i
+二态二氢 3 nz
+二恶英 3 nr
+二惠竞爽 3 nr
+二意 6 n
+二意性 3 n
+二愣子 13 v
+二成 159 nrt
+二战 576 nz
+二战名将 3 n
+二战时期 3 nz
+二户 3 m
+二房 34 n
+二房东 12 ns
+二所 7 m
+二扇 2 m
+二手 74 m
+二手书 3 nz
+二手买卖 3 l
+二手交易 3 nz
+二手仪器 3 n
+二手市场 3 n
+二手店 3 nz
+二手房 73 n
+二手房屋 3 n
+二手手机 3 nz
+二手机床 3 nz
+二手楼 6 n
+二手烟 3 nz
+二手物品 3 n
+二手电脑 3 nz
+二手票 3 n
+二手空调 3 l
+二手网 3 nz
+二手设备 3 n
+二手货 14 n
+二手车 6 n
+二手轿车 3 n
+二手钢琴 3 nz
+二批 63 m
+二把 7 m
+二把刀 2 m
+二把手 68 m
+二折 2 m
+二担 3 m
+二拇指 21 n
+二招 6 m
+二择 3 v
+二排 4 m
+二支 13 m
+二数 128 m
+二斗 20 m
+二斤 47 m
+二方 6 m
+二日 114 t
+二日份 3 nz
+二日游 3 nz
+二时 3 c
+二星 28 nz
+二星级 20 b
+二是二 8 l
+二晚 3 t
+二晶 2 nrt
+二曲 2 m
+二月 1036 m
+二月份 3 nz
+二月河 2 nz
+二期 203 b
+二期工程 3 l
+二期稻作 3 l
+二本 81 ns
+二机部 3 n
+二杆 2 m
+二杆子 26 n
+二条 32 m
+二来 610 t
+二杯 8 m
+二板 5 n
+二板股票 3 n
+二极体 3 n
+二极真空 3 l
+二极管 147 n
+二林 3 nrt
+二枚 12 m
+二枝 7 m
+二枪 5 m
+二架 5 m
+二柱 256 m
+二栋 3 m
+二株 3 m
+二样 2 r
+二根 7 m
+二桃杀三士 7 nz
+二档 4 b
+二桶 3 m
+二棱大麦 3 ns
+二楼 256 n
+二楼住户 3 n
+二次 984 m
+二次世界大战 29 nz
+二次元 3 m
+二次域 3 ns
+二次大战 73 nz
+二次开发 3 nz
+二次收费 3 nz
+二次方 13 nz
+二次方程 26 nz
+二次曲线 3 nz
+二次曲面 12 nz
+二次污染 3 nz
+二次生油 3 nz
+二次电子 3 nz
+二次破碎 3 i
+二次编码 3 l
+二次能源 3 nz
+二次葬 3 n
+二次革命 3 nz
+二款 2 m
+二步 12 m
+二武 23 nrt
+二段 24 m
+二段制 3 n
+二段式 2 n
+二段票 3 n
+二段跳 3 l
+二氢叶酸 3 nz
+二氢吡啶 3 nz
+二氢尿苷 3 nz
+二氢蝶啶 3 n
+二氧 3 b
+二氧六环 7 nz
+二氧化 3 n
+二氧化氮 17 nz
+二氧化氯 4 nz
+二氧化物 3 n
+二氧化硅 71 nz
+二氧化硒 3 nz
+二氧化硫 166 nz
+二氧化碳 581 nz
+二氧化碳气 2 nz
+二氧化钛 16 nz
+二氧化铅 4 nz
+二氧化锆 4 nz
+二氧化锡 6 nz
+二氧化锰 3 nz
+二氯 276 nz
+二氯乙烷 15 nz
+二氯化锰 3 nz
+二氯甲烷 12 nz
+二氯苯 3 nz
+二水 33 nrt
+二汽 4 j
+二泉映月 12 n
+二流 94 b
+二流人才 3 n
+二流子 40 n
+二流角色 3 n
+二满三平 3 ns
+二滩 42 ns
+二滩水电站 4 nz
+二滩电站 2 nz
+二滴 3 m
+二炮 181 n
+二点 25 m
+二点三万 2 m
+二点五 2 m
+二点六 3 m
+二点透视 3 l
+二点钟 3 m
+二爷 492 n
+二爹 3 n
+二片 2 m
+二版 3 b
+二环 288 b
+二环路 37 nz
+二班 20 m
+二班制 3 n
+二瓶 3 m
+二用 3 b
+二甲 45 b
+二甲基 22 nz
+二甲基二氯硅烷 2 nz
+二甲基亚砜 3 nz
+二甲基甲 3 nz
+二甲基甲酰胺 13 nz
+二甲基苯胺 2 nz
+二甲胺 8 nz
+二甲胺基 3 nz
+二甲苯 32 nz
+二甲苯基 3 nz
+二甲酚橙 3 nz
+二甲酯 2 nz
+二甲酸 3 nz
+二甲醚 3 nz
+二男一女 3 l
+二男二女 3 l
+二百 236 m
+二百一十 2 m
+二百一十一亩 2 m
+二百一十三 2 m
+二百一十五万斤 2 m
+二百一十五章 2 m
+二百一十卷 4 m
+二百一十块 2 m
+二百一十毫米 4 m
+二百七十 2 m
+二百七十三年 6 m
+二百七十个 2 m
+二百七十九目 2 m
+二百七十余年 2 m
+二百七十六年 2 m
+二百七十卷 2 m
+二百七十多年 6 m
+二百七十岁 3 m
+二百七十年 8 m
+二百万 21 m
+二百万两 9 m
+二百三十 3 m
+二百三十一 4 m
+二百三十万户 2 m
+二百三十九处 2 m
+二百三十五 3 m
+二百三十余条 2 m
+二百三十八 2 m
+二百三十卷 3 m
+二百三十四万八千六百九十七亩 2 m
+二百三十多 2 m
+二百两 70 m
+二百两一张 2 m
+二百个 21 m
+二百九十三 2 m
+二百九十九 2 m
+二百九十四卷 5 m
+二百二 3 m
+二百二十万 2 m
+二百二十五 2 m
+二百二十五卷 2 m
+二百二十余 2 m
+二百二十余万 2 m
+二百二十余年 2 m
+二百二十八卷 2 m
+二百二十八架 2 m
+二百二十卷 6 m
+二百五 20 m
+二百五六十斤 2 m
+二百五十 8 m
+二百五十万 3 m
+二百五十万两 4 m
+二百五十两 2 m
+二百五十元 3 m
+二百五十卷 4 m
+二百五十名 3 m
+二百五十四卷 2 m
+二百五十四毫米 2 m
+二百五十支 2 m
+二百五十米 3 m
+二百五十里 5 m
+二百亩 6 m
+二百人 3 n
+二百余 50 m
+二百余万 3 m
+二百余万两 5 m
+二百余丈 2 m
+二百余匹 2 m
+二百余口 2 m
+二百余名 7 m
+二百余处 2 m
+二百余家 3 m
+二百余席 2 m
+二百余年 11 m
+二百余招 6 m
+二百余斤 3 m
+二百余里 14 m
+二百元 30 m
+二百克 2 m
+二百八十 5 m
+二百八十七家 2 m
+二百八十万 3 m
+二百八十万两 6 m
+二百八十二节 2 m
+二百八十亿余 2 m
+二百八十余 2 m
+二百八十元 2 m
+二百八十年 3 m
+二百八十本 2 m
+二百六十 6 m
+二百六十五块 2 m
+二百六十余年 3 m
+二百六十匹 3 m
+二百六十名 12 m
+二百六十四 2 m
+二百六十年 2 m
+二百六十所 2 m
+二百几十年 3 m
+二百匹 13 m
+二百千米 2 m
+二百卷 9 m
+二百只 4 m
+二百名 44 m
+二百四十 6 m
+二百四十个 4 m
+二百四十二年 3 m
+二百四十五 2 m
+二百四十五万余 2 m
+二百四十六道 8 m
+二百四十名 4 m
+二百四十多名 2 m
+二百四十家 3 m
+二百四十里 3 m
+二百块 15 m
+二百多 36 m
+二百多万 6 m
+二百多万两 5 m
+二百多万元 2 m
+二百多两 3 m
+二百多个 7 m
+二百多位 4 m
+二百多元 3 m
+二百多双 2 m
+二百多只 2 m
+二百多号 2 m
+二百多名 13 m
+二百多块 5 m
+二百多天 3 m
+二百多年 30 m
+二百多户 2 m
+二百多斤 3 m
+二百多条 2 m
+二百多米 2 m
+二百多里 12 m
+二百天 5 m
+二百家 3 m
+二百对 2 m
+二百帖 2 m
+二百年 74 m
+二百户 6 m
+二百招 11 m
+二百拳 2 m
+二百文 7 m
+二百斤 20 m
+二百架 2 m
+二百次 2 m
+二百步 9 m
+二百海里 3 m
+二百米 9 m
+二百艘 2 m
+二百里 38 m
+二百零七卷 2 m
+二百零七篇 2 m
+二百零三 3 m
+二百零八艘 2 m
+二百零六 2 m
+二百零四万 2 m
+二百零四个 3 m
+二百首 3 m
+二皮脸 3 l
+二盒 2 m
+二目 16 n
+二硅化物 3 nz
+二硝基苯 3 nz
+二硫化物 4 nz
+二硫化碳 18 nz
+二硫化钼 9 nz
+二硫化铁 3 nz
+二硫基丙 3 nz
+二硫键 3 n
+二碗 2 m
+二碳化钙 3 nz
+二磷酸 3 nz
+二种 43 m
+二科 3 nrt
+二秒 3 m
+二秒钟 3 nr
+二程 36 n
+二竖为虐 3 i
+二章 3 m
+二童一马 3 nz
+二端 12 m
+二端网络 3 n
+二笔 3 m
+二笼 3 n
+二等 193 b
+二等亲 3 n
+二等兵 3 n
+二等功 41 l
+二等品 3 n
+二等奖 257 nz
+二等舱 3 n
+二筒 3 n
+二篇 6 m
+二簧 28 n
+二米 7 m
+二类 114 m
+二粒 6 m
+二级 1863 b
+二级企业 3 l
+二级准尉 3 n
+二级图谱 3 l
+二级域名 3 n
+二级强化 3 l
+二级标准 3 n
+二级相变 3 l
+二级简码 3 l
+二级缓存 3 i
+二级风 3 l
+二纸 2 m
+二线 95 m
+二组 17 m
+二维 157 m
+二维地震 3 nr
+二维电泳 3 l
+二维码 4 n
+二绿 3 b
+二缶钟惑 3 nr
+二缶锺惑 3 nr
+二羧酸 3 n
+二老 219 n
+二老板 3 n
+二者 1264 n
+二者不可得兼 2 i
+二者之间 3 l
+二联 3 ns
+二联体 3 j
+二联单 3 j
+二联式 3 n
+二聚体 3 n
+二聚化 3 nz
+二聚环戊二烯 4 nz
+二股 5 m
+二肽 3 n
+二肽酶 3 n
+二胎 18 m
+二胡 115 n
+二胡曲 4 n
+二胺 11 nz
+二舅 3 n
+二舅妈 3 n
+二舅母 3 n
+二艘 8 m
+二色性 3 n
+二色视觉 3 n
+二节 3 m
+二节棍 3 n
+二花脸 6 l
+二苯基 10 nz
+二苯基唑 3 nz
+二苯胺蓝 3 nz
+二苯醚 4 nz
+二茂铁 27 nrt
+二茬 9 m
+二萜 5 n
+二虎相斗 3 i
+二行 9 j
+二行程 3 n
+二表哥 3 n
+二表妹 3 n
+二表姊 3 nr
+二表姊夫 3 n
+二表嫂 3 n
+二表弟 3 n
+二袋 6 m
+二裂舌 3 l
+二角 13 m
+二话 15 n
+二话不说 145 l
+二话没说 62 l
+二课 3 n
+二象性 3 n
+二路 1047 m
+二路纵队 3 n
+二踢脚 3 n
+二轮 17 m
+二轮影院 3 nt
+二轮电影 3 n
+二轮马车 3 n
+二轻 12 nz
+二轻局 2 n
+二载 35 m
+二辆 2 m
+二过一 3 l
+二进位 5 n
+二进位制 3 n
+二进制 99 n
+二进制位 3 n
+二进制码 3 l
+二进宫 16 nr
+二进数群 3 n
+二连 59 ns
+二连冠 3 nr
+二连浩特 11 ns
+二连浩特市 16 ns
+二通 8 nz
+二遍 24 m
+二道 240 m
+二道区 3 n
+二道桥 4 nr
+二道江区 3 ns
+二道河 5 ns
+二道河子 2 n
+二道贩子 12 n
+二郎 118 nrt
+二郎山 12 nrt
+二郎庙 266 ns
+二郎担山 4 l
+二郎滩 3 nrt
+二郎神 16 n
+二郎腿 38 n
+二部 57 m
+二部制 3 n
+二部合唱 3 l
+二部曲 3 m
+二部曲式 3 n
+二里 104 nrt
+二里头 277 nrt
+二里岗 19 nrt
+二里庄 3 ns
+二重 54 m
+二重人格 3 n
+二重化 11 j
+二重唱 14 l
+二重奏 12 n
+二重性 32 n
+二重接 3 b
+二重根 3 nz
+二重积分 3 l
+二重级数 3 l
+二锅头 24 n
+二锤 19 m
+二门 282 m
+二间 4 m
+二队 78 m
+二阶 62 n
+二阶堂 3 n
+二陈汤 3 nr
+二难 18 n
+二集 8 m
+二零零一年 2 m
+二零零三年 13 m
+二零零二年 2 m
+二零零五年 11 m
+二零零八年 5 m
+二零零六年 9 m
+二零零四年 8 m
+二零零零年 4 m
+二青洞 3 nr
+二面 21 m
+二面角 3 n
+二页 3 m
+二顶 3 m
+二顷 5 m
+二项 23 m
+二项分布 3 n
+二项式 28 nz
+二颗 6 m
+二餐 2 m
+二首 36 m
+二首歌 3 m
+二马路 3 nrt
+二驾 23 m
+二黄 5 b
+二龙 290 nrt
+二龙山 33 ns
+二龙戏珠 133 nz
+二龙路 3 ns
+亍 185 x
+于 106176 p
+于一举 2 nr
+于一园 2 nr
+于一城 16 nr
+于一夫 3 nr
+于万亭 15 nr
+于不忠 2 nr
+于世务 6 nr
+于世嘉 2 nr
+于世宗 2 nr
+于世祖 3 nr
+于世者 16 nr
+于世钧 2 nr
+于东夷 4 nr
+于东海 11 nr
+于东虢 3 nr
+于东观 3 nr
+于东邻 2 nr
+于东郡 4 nr
+于东风 2 nr
+于中缘 4 nr
+于临池 2 nr
+于临颍 3 nr
+于丹 2 nr
+于丹墀 4 nr
+于主脉 2 nr
+于丽景 2 nr
+于乃弟 2 nr
+于乐寿 2 nr
+于乐毅 3 nr
+于乐艺 16 nr
+于乐调 16 nr
+于乔峰 3 nr
+于乘丘 2 nr
+于也儿 2 nr
+于乾道 2 nr
+于事无补 53 i
+于二净 2 nr
+于二龙 307 nr
+于于 3 c
+于云中 2 nr
+于云台 2 nr
+于云嘉 16 nr
+于云浮 2 nr
+于云际 2 nr
+于五军 2 nr
+于五凤 2 nr
+于亚太 2 nr
+于亚志 3 nr
+于亚述 5 nr
+于亚非 3 nr
+于京兆 4 nr
+于京师 3 nr
+于京畿 2 nr
+于人豪 32 nr
+于仁宗 5 nr
+于今 209 nr
+于今为烈 2 l
+于今犹烈 3 l
+于仕宦 4 nr
+于令尹 3 nr
+于仲景 2 nr
+于众生 2 nr
+于众议 3 nr
+于会昌 4 nr
+于会芳 2 nr
+于体节 2 nr
+于余曲折 3 l
+于佛义 2 nr
+于佩尔 6 nr
+于修礼 3 nr
+于儒伯 2 nr
+于元丰 2 nr
+于元光 4 nr
+于元嘉 2 nr
+于元康 4 nr
+于元朝 2 nr
+于先帝 2 nr
+于光豪 3 nr
+于光轴 2 nr
+于光远 11 nr
+于克光 2 nr
+于克商 2 nr
+于克里 20 nr
+于全真 3 nr
+于全邦 48 nr
+于公卿 2 nr
+于公室 2 nr
+于兴平 2 nr
+于其子 2 nr
+于内廷 5 nr
+于军国 2 nr
+于军演 2 nr
+于冢宰 2 nr
+于冥冥 4 nr
+于凤至 6 nr
+于刀剑 8 nr
+于制陶 4 nr
+于前明 2 nr
+于剑尖 2 nr
+于剑招 2 nr
+于剑阁 2 nr
+于加丹 2 nr
+于加尔 2 nr
+于努尔 3 nr
+于北庭 2 nr
+于北燕 2 nr
+于北魏 6 nr
+于千泉 2 nr
+于华中 3 nr
+于华山 5 nr
+于华明 3 nr
+于华雄 2 nr
+于南征 2 nr
+于博客 2 nr
+于博州 2 nr
+于占田 2 nr
+于卫国 17 nr
+于厂卫 2 nr
+于厘毫 2 nr
+于原生 2 nr
+于友先 3 nr
+于友道 2 nr
+于双汇 2 nr
+于叔本 3 nr
+于取利 16 nr
+于取媚 16 nr
+于召陵 3 nr
+于右任 12 nr
+于司天 2 nr
+于同频 4 nr
+于向阳 2 nr
+于君臣 4 nr
+于含章 3 nr
+于呼哀哉 3 nr
+于和林 3 nr
+于咸水 2 nr
+于哈儿 2 nr
+于喀山 2 nr
+于喀斯 2 nr
+于善德 32 nr
+于嘉泰 3 nr
+于嘉瑞 16 nr
+于四府 3 nr
+于国军 2 nr
+于国君 2 nr
+于国子 2 nr
+于国赋 16 nr
+于土石 16 nr
+于圣主 2 nr
+于圣克 2 nr
+于圣历 3 nr
+于圣西 6 nr
+于在邦 16 nr
+于城邦 322 nr
+于城镇 11 nr
+于基尔 4 nr
+于基性 2 nr
+于基民 2 nr
+于基质 3 nr
+于塔尔 7 nr
+于塔斯 2 nr
+于壁衣 4 nr
+于外邦 32 nr
+于多伦 3 nr
+于大昌 2 nr
+于大汶 2 nr
+于大海 7 nr
+于大纲 2 nr
+于大英 2 nr
+于大顺 4 nr
+于大鹏 3 nr
+于大龙 50 nr
+于天凤 2 nr
+于天宝 11 nr
+于天明 2 nr
+于天聪 5 nr
+于太安 4 nr
+于太康 2 nr
+于太清 2 nr
+于太甲 3 nr
+于夫椒 2 nr
+于夫罗 3 nr
+于夷仪 2 nr
+于夷狄 5 nr
+于夷陵 5 nr
+于如皋 2 nr
+于姚宏 2 nr
+于子午 2 nr
+于子嗣 16 nr
+于子城 2 nr
+于孙权 2 nr
+于孝公 2 nr
+于孝惠 2 nr
+于孟津 5 nr
+于学官 7 nr
+于学宫 2 nr
+于学武 5 nr
+于学非 2 nr
+于守御 2 nr
+于安丰 2 nr
+于安思危 3 nr
+于安特 4 nr
+于安西 4 nr
+于安邑 2 nr
+于宗周 4 nr
+于宗敏 2 nr
+于官田 2 nr
+于定军 3 nr
+于宜宾 2 nr
+于宝山 2 nr
+于宝庆 2 nr
+于宣府 5 nr
+于宣抚 4 nr
+于宪宗 2 nr
+于宫禁 3 nr
+于家为国 3 nr
+于家务 3 nr
+于富室 16 nr
+于富平 3 nr
+于富贵 3 nr
+于寒冰 2 nr
+于尊荣 16 nr
+于小丘 2 nr
+于小伟 3 nr
+于小冬 7 nr
+于小慧 3 nr
+于小景 2 nr
+于小波 2 nr
+于小龙 10 nr
+于少侠 4 nr
+于少林 4 nr
+于少阳 2 nr
+于尔根 4 nr
+于居洋 10 nrfg
+于山海 2 nr
+于山溪 3 nr
+于岩壑 2 nr
+于岩礁 3 nr
+于岭北 2 nr
+于岳州 3 nr
+于岷江 2 nr
+于峰巅 4 nr
+于崇德 5 nr
+于崇政 2 nr
+于崇祯 36 nr
+于川康 17 nr
+于巨室 3 nr
+于巨潮 6 nr
+于己于人 3 i
+于巴尔 2 nr
+于希拉 2 nr
+于平南 2 ns
+于平城 8 nr
+于平阳 5 nr
+于幽州 8 nr
+于广信 2 nr
+于广德 2 nr
+于广陵 2 nr
+于庄村 4 nr
+于庆历 2 nr
+于庆王爷 2 nr
+于库伦 7 nr
+于应昌 11 nr
+于废帝 3 nr
+于庭州 2 nr
+于康居 2 nr
+于延兴 2 nr
+于延津 2 nr
+于廷弼 2 nr
+于建元 8 nr
+于建安 4 nr
+于建康 11 nr
+于建德 4 nr
+于建文 2 nr
+于建武 6 nr
+于建水 2 nr
+于建炎 6 nr
+于建虏 5 nr
+于建隆 2 nr
+于开平 4 nr
+于开普 2 nr
+于开港 6 nr
+于开皇 5 nr
+于弘州 3 nr
+于彝陵 3 nr
+于彦平 3 nr
+于径山 3 nr
+于律文 2 nr
+于御河 2 nr
+于御营 3 nr
+于微软 6 nr
+于德安 2 nr
+于德尔 2 nr
+于德性 18 nr
+于心不忍 24 i
+于心不甘 3 nr
+于心何 2 nr
+于心何忍 11 i
+于心无愧 3 i
+于志学 2 nr
+于志宁 5 nr
+于忠肃 5 nr
+于怀特 2 nr
+于思 3 nr
+于恒山 3 nr
+于恩图 2 nr
+于恭谨 2 nr
+于恶波 2 nr
+于悼王 5 nr
+于惠陵 2 nr
+于慈利 2 nr
+于慈禧 4 nr
+于慎行 5 nr
+于成王 3 nr
+于成皋 8 nr
+于成龙 2 nr
+于才德 16 nr
+于承圣 3 nr
+于拉栖 16 nr
+于拜仁 3 nr
+于拥帝 2 nr
+于摩尔 2 nr
+于政制 16 nr
+于敖山 2 nr
+于敬轩 2 nr
+于文义 2 nr
+于文侯 3 nr
+于斯为盛 2 nr
+于斯泰 2 nr
+于新浪 2 nr
+于无声处 12 i
+于无礼 2 nr
+于旬日 2 nr
+于旭阳 3 nr
+于昆阳 6 nr
+于明公 3 nr
+于明军 3 nr
+于明初 3 nr
+于明嘉靖 7 nr
+于明帝 2 nr
+于明德 2 nr
+于明教 7 nr
+于明洪武 4 nr
+于昔木 4 nr
+于春海 2 nr
+于昭烈 2 nr
+于昭苏 2 nr
+于是 13536 c
+于是乎 56 c
+于显宦 2 nr
+于显庆 4 nr
+于显德 3 nr
+于晋阳 8 nr
+于晓雪 3 nr
+于晚志 2 nr
+于晨露 5 nr
+于普拉 2 nr
+于景德 3 nr
+于景龙 2 nr
+于曼联 3 nr
+于月仙 3 nr
+于朗州 2 nr
+于朝臣 5 nr
+于木剑 2 nr
+于未然 3 nr
+于本博 2 nr
+于本司 2 nr
+于本周 16 nr
+于权宜 16 nr
+于李世 2 nr
+于李之 2 nr
+于李乎 2 nr
+于李高 2 nr
+于杏城 2 nr
+于杰迪 2 nr
+于松嫩 3 nr
+于松山 3 nr
+于松科 2 nr
+于林丹 4 nr
+于林庄村 3 nr
+于果 3 c
+于枫丹 2 nr
+于柏举 4 nr
+于柏林 8 nr
+于柔靡 16 nr
+于树华 2 nr
+于树洞 3 nr
+于根伟 2 nr
+于格兰 3 nr
+于桂陵 10 nr
+于桃里 3 nr
+于桐城 2 nr
+于棘津 2 nr
+于楚州 3 nr
+于横峰 2 nr
+于欣欣 20 nr
+于正邪 2 nr
+于此 3 c
+于步军 2 nrfg
+于步廊 128 nr
+于武学 11 nr
+于武帝 5 nr
+于武氏 2 nr
+于武王 4 nr
+于殇子 2 nr
+于殷周 4 nr
+于民勤 2 nr
+于水府 2 nr
+于水田 2 nr
+于水笙 2 nr
+于永乐 8 nr
+于永嘉 4 nr
+于永平 3 nr
+于永徽 2 nr
+于永正 17 nr
+于永波 29 nr
+于汉军 3 nr
+于汉初 257 nr
+于汉律 3 nr
+于汉族 5 nr
+于汉籍 3 nr
+于汉超 16 nr
+于汉阳 2 nr
+于汉魏 2 nr
+于江宁 5 nr
+于汴梁 3 nr
+于沙海 2 ns
+于沣河 2 nr
+于沪江 2 nr
+于河东 3 nr
+于河州 2 ns
+于河阳 3 nr
+于治璞 2 nr
+于泓水 3 nr
+于法华 2 nr
+于法无据 3 l
+于波尔 3 nr
+于波希 2 nr
+于洋 46 ns
+于洛州 2 nr
+于洛水 3 nr
+于津梁 16 nr
+于洪 2 nr
+于洪区 2 nr
+于洪州 2 nr
+于洪武 6 nr
+于洪洲 2 nr
+于洪琛 5 nr
+于洲 2 ns
+于浅海 4 nr
+于海东 2 nr
+于海军 19 nr
+于海印 3 nr
+于海晏 2 nr
+于海波 2 nr
+于海洋 29 nr
+于海滨 3 nr
+于海生 10 nr
+于海西 3 nr
+于深宫 3 nr
+于淳化 3 nr
+于清初 4 nr
+于清华 2 nr
+于清泰 2 nr
+于清议 3 nr
+于湖广 3 nr
+于湘军 2 nr
+于湘淮 3 nr
+于湘雅 2 nr
+于潜航 2 nr
+于潭州 2 nr
+于澎湖 5 nr
+于澧水 2 nr
+于濠州 6 nr
+于濡源 2 nr
+于火浣 2 nr
+于灵州 4 nr
+于灵谷 2 nr
+于灵长 2 nr
+于炀帝 2 nr
+于焉 2 nr
+于燕京 3 nr
+于牧野 3 nr
+于献帝 3 nr
+于玄德 3 nr
+于玉茎 5 nr
+于玉麟 14 nr
+于玲范 20 nr
+于琢玉 2 nr
+于瓜希 2 nr
+于瓦桥 2 nr
+于田 20 nr
+于田县 5 nr
+于登仙 3 nr
+于登州 2 nr
+于皇叔 2 nr
+于皇庆 2 nr
+于盐政 3 nr
+于盛京 3 ns
+于盛唐 6 nr
+于盟津 3 nr
+于省吾 3 nr
+于睦州 4 nr
+于石亭 5 nr
+于石城 2 nr
+于祁山 2 nr
+于祖庙 3 nr
+于祖庚 2 nr
+于神宗 2 nr
+于祠庙 16 nr
+于祭仪 16 nr
+于禄兀 2 nr
+于秀峦 2 nr
+于秋冬 2 nr
+于科尔 3 nr
+于科洛 2 nr
+于窝阔 2 nr
+于立婷 3 nr
+于竟宁 2 nr
+于答儿 3 nr
+于管家 11 nr
+于紫微 2 nr
+于紫烟 2 nr
+于纯绵 3 nr
+于绍良 2 nr
+于罗兰 2 nr
+于美制 2 nr
+于美索 6 nr
+于羽郊 3 nr
+于老夫 2 nr
+于老庄 2 nr
+于耶鲁 19 nr
+于良辰 2 nr
+于艺婉 10 nr
+于艾陵 2 nr
+于芷蔚 3 nr
+于若林 2 nr
+于英法 3 nr
+于苻坚 2 nr
+于茂陵 4 nr
+于茜草 2 nr
+于荣光 3 nr
+于荣府 2 nr
+于荥阳 11 nr
+于荫霖 2 nr
+于莱喀 16 nr
+于莲抱 2 nr
+于营子 2 nr
+于营官 2 nr
+于萨尔 3 nr
+于葭芦 3 nr
+于薄壁 2 nr
+于虎丘 3 nr
+于虎翼 2 nr
+于蜀营 2 nr
+于蜀郡 3 nr
+于襄州 2 nr
+于襄平 3 nr
+于襄江 2 nr
+于西军 3 nr
+于西州 4 ns
+于西秦 5 nr
+于西陵 2 nr
+于观津 3 nr
+于言 6 c
+于证圣 2 nr
+于诸公 2 nr
+于谢安 3 nr
+于谦击 3 nr
+于谦祠 2 nr
+于谦统 2 nr
+于谦非 2 nr
+于豪亮 2 nr
+于豪奢 16 nr
+于豫州 2 nr
+于豫皖 2 nr
+于贝尔 7 nr
+于贞元 4 nr
+于贞观 15 nr
+于贤良 16 nr
+于贵君 15 nr
+于贵霜 2 nr
+于赫梯 2 nr
+于起纳 2 nr
+于越尊 4 nr
+于越王 2 nr
+于辉州 2 nr
+于辽兵 2 nr
+于辽清 3 nr
+于连泉 2 nr
+于逊尼 2 nr
+于造山 2 nr
+于道显 6 nr
+于邦国 34 nr
+于邦齐 2 nr
+于邺郡 7 nr
+于都县 4 ns
+于里昂 2 nr
+于金代 2 nr
+于金伯 2 nr
+于金墉 2 nr
+于金朝 4 nr
+于金滕 2 nr
+于金陵 3 nr
+于钦天 3 nr
+于钦察 7 nr
+于铁坚 2 nr
+于银河 2 nr
+于锋镝 2 nr
+于锡兰 2 nr
+于长乐 3 nr
+于长安 21 nr
+于长平 7 nr
+于长春 3 nr
+于长江 339 nr
+于长洪 7 nr
+于阔端 2 nr
+于阗侯 2 nr
+于阗僧 2 nr
+于阗国 2 nr
+于阗复 2 nr
+于阗文 10 nr
+于阗王 6 nr
+于阗语 6 nr
+于阿尔 6 nr
+于阿斯 2 nr
+于阿瑜 2 nr
+于际训 2 nr
+于隶臣 2 nr
+于雅先 104 nr
+于震旦 7 nr
+于露梁 2 nr
+于青萍 3 nr
+于青龙 2 nr
+于静水 3 nr
+于静江 3 nr
+于顺帝 3 nr
+于顾恺 2 nr
+于领陆 2 nr
+于颍州 2 nr
+于额尔 2 nr
+于风陵 3 nr
+于飞之乐 3 nr
+于首阳 2 nr
+于高丽 7 nr
+于高平 2 nr
+于高祥 4 nr
+于高端 3 nr
+于魁智 3 nr
+于魏郡 2 nr
+于麦克 3 nr
+于黎丽 28 nr
+于黎阳 5 nr
+于龙兴 3 nr
+于龙华 2 nr
+于龙朔 2 nr
+于龟兹 5 nr
+亏 1580 v
+亏了 159 v
+亏产 3 vn
+亏到 3 v
+亏困 2 vn
+亏失 3 vn
+亏少 3 d
+亏待 146 v
+亏得 182 v
+亏心 21 v
+亏心事 63 n
+亏心短行 3 n
+亏折 3 vn
+亏损 1140 vn
+亏损企业 3 n
+亏损率 3 n
+亏损累累 3 n
+亏损面 21 n
+亏损额 42 n
+亏掉 3 v
+亏本 103 n
+亏本生意 3 n
+亏格 5 n
+亏欠 37 v
+亏死 3 v
+亏盈 3 vn
+亏短 3 v
+亏秤 3 n
+亏空 83 vn
+亏空公款 3 n
+亏累 3 v
+亏缺 3 v
+亏耗 6 v
+亏蚀 15 vn
+亏负 50 v
+亏量 3 vn
+云 6353 ns
+云丫头 6 nr
+云中 191 ns
+云中仙鹤 3 nr
+云中君 2 nr
+云中子 3 nr
+云中府 2 nt
+云中白鹤 3 nr
+云中郡 9 nr
+云中雕 45 nr
+云中鹤 229 nr
+云云 165 nr
+云交雨合 3 n
+云从龙 8 nr
+云体 5 n
+云佛山 3 ns
+云六州 2 ns
+云兴月性 3 nr
+云兴霞蔚 3 nr
+云冈 35 ns
+云冈石佛 3 ns
+云冈石窟 19 ns
+云冷杉 2 nr
+云净天空 3 nz
+云半雾 4 n
+云南 3139 ns
+云南人民出版社 8 nt
+云南大学 42 nt
+云南府 2 nt
+云南新闻 3 nz
+云南旅游 3 nz
+云南日报 3 nz
+云南昆明 3 ns
+云南松 20 nr
+云南白药 31 nt
+云南省 504 ns
+云南省人民政府 10 nt
+云南省公安厅 5 nt
+云南省德宏傣族景颇族自治州 7 ns
+云南省政府 2 nt
+云南省楚雄彝族自治州 2 ns
+云南省西双版纳傣族自治州 5 ns
+云南省迪庆藏族自治州 2 ns
+云南红塔集团 42 nt
+云南菜 3 n
+云南迪庆藏族自治州 2 ns
+云南铜业 7 nz
+云南队 4 nt
+云南高原 31 ns
+云卷云 6 nr
+云卷云舒 3 nr
+云县 6 ns
+云台 38 ns
+云台山 49 ns
+云合响应 3 n
+云合景从 3 n
+云合雾集 3 ns
+云吉班 3 nr
+云吞 4 v
+云吞面 3 n
+云和 34 ns
+云和县 2 ns
+云和山 3 ns
+云和月 3 nr
+云四州 2 nr
+云团 37 n
+云图 42 nr
+云块 15 n
+云城区 3 ns
+云堦月地 3 v
+云大 8 ns
+云天 57 nr
+云天化 3 nr
+云天空 3 nr
+云天雾地 3 ns
+云天高谊 3 nr
+云头 193 ns
+云奉尉 3 nr
+云奔雨骤 3 l
+云子 3 n
+云安 10 ns
+云安军 5 nr
+云安县 3 ns
+云官威仪 3 nr
+云实根 3 nz
+云室 37 n
+云容月貌 3 nz
+云寺 3 ns
+云寺佛 5 nr
+云封雾 3 nr
+云尔 2 ns
+云尤雨殢 3 nr
+云层 161 n
+云居寺 25 nr
+云屯席卷 3 nr
+云屯星聚 3 nr
+云屯森立 3 nr
+云屯蚁聚 3 i
+云屯雨 2 nr
+云屯雨集 3 nr
+云屯雾 2 nr
+云屯雾散 3 nr
+云屯雾集 3 ns
+云屯飙散 3 z
+云屯鸟散 3 nr
+云山 117 ns
+云山城 2 ns
+云山屯 18 ns
+云山文稿 3 nz
+云山白 3 nr
+云山雾罩 18 nz
+云岗 3 ns
+云岗石窟 8 ns
+云岛主 2 nr
+云岩 5 nr
+云岩区 5 ns
+云岩寺 6 nr
+云岫谷 2 nr
+云岭 60 ns
+云峰山 3 ns
+云崖 5 ns
+云州 32 ns
+云州秦 5 nr
+云左山 2 ns
+云布雨施 3 nr
+云布雨润 3 nr
+云帆济 3 nr
+云开日出 4 l
+云开月 3 nr
+云开见天 3 nr
+云开见日 3 nr
+云开雾散 8 nr
+云开雾释 3 nr
+云强盗 3 n
+云彩 137 nr
+云影 5 n
+云心水性 3 n
+云心鹤眼 3 nr
+云总镖 4 nr
+云悲海思 3 nr
+云情雨意 3 i
+云愁雨怨 3 i
+云愁雾惨 3 nr
+云扰幅裂 3 nr
+云扶石 2 nr
+云拂羽 128 nr
+云收雨散 3 i
+云散 25 nr
+云散风流 3 n
+云散高 2 nr
+云斯顿 3 ns
+云昏 3 v
+云景 3 n
+云朝雨暮 3 nr
+云期雨信 3 nz
+云期雨约 3 n
+云木香 4 nr
+云朵 355 n
+云杉 128 nr
+云杉坪 3 ns
+云杉林 32 ns
+云杜姆 2 nr
+云来雾 2 nr
+云板 158 n
+云板声 2 n
+云林 11 ns
+云林人 3 nr
+云林县 11 ns
+云林坪 2 ns
+云林工专 3 nt
+云枝女 2 nr
+云树之 4 nr
+云树之思 3 nr
+云树遥隔 3 l
+云栖寺 8 nr
+云栖茶 2 nr
+云根朝 2 nr
+云梦 16 nz
+云梦县 262 nr
+云梦山 2 nr
+云梦泽 27 nr
+云梦睡 2 nr
+云梦秦 41 nr
+云梦闲情 3 l
+云梯 211 n
+云梯车 2 n
+云楼 12 ns
+云楼宫 2 nr
+云横秀 2 nr
+云次鳞集 3 nr
+云母 563 nr
+云母片 8 n
+云母石 3 nr
+云母粉 3 nr
+云气 44 n
+云水 7 ns
+云水全 2 nr
+云水怒 4 nr
+云水洞 3 nr
+云汉 5 ns
+云江 2 ns
+云江鼎 2 nr
+云河 3 ns
+云泥之别 4 i
+云泥之差 3 n
+云泥异路 3 n
+云泥殊路 3 n
+云洞 2 ns
+云洞中 2 nr
+云洞圣 2 nr
+云洞岩 2 nr
+云浮 12 ns
+云浮县 3 ns
+云浮市 6 ns
+云海 83 ns
+云消雨散 3 i
+云消雾散 4 l
+云涌 3 nr
+云涌风飞 3 nr
+云涌飙发 3 vn
+云淡星 2 nr
+云淡风 3 nr
+云淡风轻 10 i
+云游 95 n
+云游四方 3 n
+云溪区 3 ns
+云滴 13 n
+云烟 46 n
+云烟氤氲 3 v
+云烟过眼 5 l
+云煌岩 2 nr
+云爆弹 3 n
+云片 4 n
+云片糕 3 nz
+云状 9 nz
+云瑞道 2 nr
+云瑞霭 2 nr
+云盘 384 n
+云程 3 n
+云程万里 3 nr
+云窗月帐 3 i
+云窗月户 3 i
+云窗雾阁 3 nr
+云窗霞户 3 nr
+云端 95 n
+云篦 3 n
+云系 5 n
+云素梅 4 nr
+云纹法 3 nr
+云绕龙 128 nr
+云罗天网 3 nz
+云美兄 3 nr
+云翳 11 nr
+云翻雨覆 3 i
+云老爷 2 nr
+云脚 3 ns
+云舒霞卷 3 nr
+云航 3 j
+云英 3 nr
+云英岩 12 nr
+云药 3 n
+云蒙山 5 ns
+云蒙峡 3 ns
+云蒸雾集 3 nz
+云蒸霞蔚 2 nr
+云蒸龙变 3 nz
+云行雨施 3 n
+云行雨洽 3 nr
+云表 3 n
+云西新村 3 ns
+云谷寺 5 nr
+云豆 3 n
+云豹 60 nr
+云贵 33 nr
+云贵川 9 nr
+云贵高原 79 ns
+云起雪飞 3 nr
+云起龙襄 3 nr
+云起龙骧 3 nr
+云趋鹜赴 3 l
+云轩里 2 nr
+云达 5 ns
+云过天空 3 l
+云迷雾罩 3 l
+云迷雾锁 3 nr
+云迹 2 n
+云逸道 8 nr
+云遮 20 l
+云遮雾障 2 i
+云里金刚 3 nr
+云里雾 5 nr
+云里雾里 3 ns
+云里飞 3 nr
+云量 23 n
+云金翅 9 nr
+云铝股份 7 nz
+云铮修 2 nr
+云铮道 13 nr
+云锣 5 nr
+云锦 31 nr
+云锦天章 3 nr
+云长乃 2 nr
+云长之 6 nr
+云长交 2 nr
+云长今 2 nr
+云长何 2 nr
+云长公 2 nr
+云长军 2 nr
+云长守 3 nr
+云长引 4 nr
+云长恐 2 nr
+云长提 2 nr
+云长未 2 nr
+云长欲 2 nr
+云长知 2 nr
+云长领 5 nr
+云门 2 ns
+云门山 2 ns
+云门舞集 3 n
+云间 12 n
+云间城 3 ns
+云阳 55 ns
+云阳县 4 ns
+云阳水 2 ns
+云阶月地 3 n
+云际 3 n
+云雀 32 n
+云雁道人 2 nr
+云集 1092 ns
+云集响应 3 n
+云集景从 3 n
+云集景附 3 nr
+云集雾散 3 nr
+云雨 28 nr
+云雨巫山 3 nr
+云雨至 4 nr
+云雷纹 8 nr
+云雷鼓 2 nr
+云雾 663 n
+云雾山 23 ns
+云雾茶 3 nr
+云雾迷蒙 3 nr
+云霄 95 nr
+云霄县 4 ns
+云霄阁 3 nr
+云霄飞车 3 nr
+云霓 3 n
+云霓之望 3 v
+云霞 91 nr
+云霭 3 nr
+云露方 2 nr
+云顶 5 ns
+云顶山 3 ns
+云顶岩 3 ns
+云须 3 n
+云飘逸 3 nr
+云飞扬 3 nr
+云飞泥沉 3 nr
+云飞烟灭 3 nr
+云飞雨散 3 nr
+云饮露 2 nr
+云香主 3 nr
+云骑尉 5 nr
+云骑风 2 nr
+云髻 3 n
+云鬓 38 nr
+云鬟 5 n
+云鬟雾鬓 3 nr
+云麓漫 2 nr
+云麾勋章 3 nr
+云龙 33 ns
+云龙井蛙 3 i
+云龙区 3 ns
+云龙县 4 ns
+云龙山 4 ns
+云龙桥 2 ns
+云龙艺 2 nr
+云龙风虎 3 nz
+互 2051 d
+互不 517 d
+互不侵犯 37 l
+互不侵犯条约 39 l
+互不干涉 3 i
+互不相让 35 l
+互为 270 d
+互为因果 15 i
+互为奥援 3 n
+互为条件 3 l
+互为补充 3 l
+互为表里 15 l
+互争 3 n
+互争雄长 3 n
+互于 3 d
+互交 3 v
+互享 3 v
+互以 3 d
+互传 3 v
+互保 3 v
+互信 94 v
+互信互谅 3 l
+互信互重 3 l
+互信息 3 n
+互信无猜 3 i
+互借 3 v
+互养共栖 3 l
+互利 227 n
+互利互惠 3 n
+互利共栖 3 ns
+互利性 3 n
+互制 3 v
+互剥痛疮 3 i
+互加 3 d
+互动 657 d
+互动关系 3 l
+互动型 4 n
+互动学习 7 n
+互动式 15 n
+互动性 27 n
+互动论 3 n
+互助 557 v
+互助会 14 v
+互助县 4 n
+互助友爱 3 l
+互助合作 3 n
+互助土族自治县 3 ns
+互助社 2 n
+互助组 52 n
+互助金 3 n
+互勉 3 v
+互勉互励 3 l
+互反性 3 n
+互发 3 v
+互变异构 3 l
+互变霉素 3 n
+互向 3 d
+互唱 3 v
+互喊 3 v
+互填 3 v
+互学 3 n
+互定 3 d
+互市 92 n
+互帮 3 n
+互帮互利 3 l
+互帮互助 5 l
+互帮互学 9 l
+互异 5 n
+互引相 3 n
+互得 3 v
+互怜 3 v
+互惠 116 v
+互惠互利 3 l
+互惠协定 3 l
+互惠待遇 14 l
+互惠条约 3 n
+互感 26 n
+互感器 38 n
+互感应 2 l
+互感系数 3 l
+互成 3 v
+互打 3 v
+互指 3 n
+互换 156 v
+互换原理 3 n
+互换性 16 n
+互换行 3 n
+互推 3 v
+互搏 3 v
+互操作 26 l
+互操作性 25 n
+互救 9 v
+互教互学 3 l
+互敬 3 v
+互敬互爱 3 l
+互斥 7 v
+互斥性 2 n
+互无 3 v
+互易 3 d
+互易定理 3 n
+互易网络 3 n
+互替 3 v
+互有 3 v
+互有权 3 n
+互有胜负 3 l
+互有输赢 3 n
+互殴 4 v
+互派 32 n
+互派大使 3 n
+互济 15 n
+互济会 3 n
+互添 3 v
+互溶 13 n
+互溶剂 3 n
+互溶性 3 n
+互点 3 d
+互爱 3 v
+互生 3 v
+互生叶 3 n
+互用 3 v
+互相 4546 d
+互相交换 3 i
+互相促进 3 i
+互相关心 3 l
+互相关照 3 l
+互相冲突 3 i
+互相切磋 3 i
+互相制约 3 n
+互相合作 3 l
+互相学习 3 n
+互相帮助 3 l
+互相承认 3 l
+互相推诿 26 l
+互相支持 3 i
+互相攻击 3 i
+互相标榜 3 n
+互相榜样 3 l
+互相残杀 3 i
+互相照顾 3 i
+互相爱护 3 i
+互相理解 3 l
+互相监督 3 n
+互相盘绕 3 i
+互相矛盾 3 l
+互相联系 3 l
+互相转化 3 l
+互相配合 2 i
+互相间 3 n
+互祝 3 v
+互竞长短 3 l
+互答 3 v
+互罚 3 v
+互联 187 v
+互联互通 3 l
+互联影库 3 n
+互联星空 3 n
+互联网 1813 n
+互联网内容 2 n
+互联网协议 2 n
+互联网安全 11 l
+互联网服务 3 n
+互联网界 4 n
+互联网站 8 n
+互联网络 133 n
+互聘 3 v
+互致问候 3 l
+互补 291 v
+互补原理 3 l
+互补式 3 l
+互补性 44 n
+互补色 3 l
+互见 6 v
+互让 4 v
+互设 3 v
+互访 149 v
+互证 3 v
+互评 3 v
+互诉 3 v
+互译 3 v
+互调 3 v
+互谅 3 v
+互谅互让 3 l
+互谋 3 n
+互谋其利 3 i
+互质 3 n
+互质数 3 n
+互赠 3 v
+互转 3 v
+互连 80 d
+互连网 3 n
+互选 3 v
+互递 3 v
+互通 233 n
+互通信息 3 n
+互通声气 3 l
+互通式 12 n
+互通性 3 n
+互通情况 3 n
+互通情报 3 n
+互通有无 34 l
+互道 3 d
+互道珍重 3 l
+互锁 3 v
+互问 3 v
+互闹 3 v
+亓 70 nr
+亓瑜萍 2 nr
+亓诗教 4 nr
+五 15665 m
+五一 2261 m
+五一一天 2 m
+五一七天 3 m
+五一九 6 m
+五一九队 4 m
+五一六 17 m
+五一出 4 m
+五一劳动 3 l
+五一劳动奖章 6 l
+五一劳动节 4 l
+五一回 3 m
+五一国际劳动节 6 l
+五一广场 3 l
+五一班 2 m
+五一眼 2 m
+五一节 41 m
+五一路 6 m
+五丁 3 nrt
+五七 41 m
+五七一 2 m
+五七三十五 2 m
+五七个 14 m
+五七分 4 m
+五七十 3 m
+五七十亩 2 m
+五七十拳 2 m
+五七千 2 m
+五七千里 2 m
+五七干校 25 j
+五七年 15 m
+五七担 2 m
+五七斤 3 m
+五七日 15 m
+五七杯 6 m
+五七百 12 m
+五七百个 2 m
+五七百步 2 m
+五七遍 2 m
+五七里 6 m
+五万 234 m
+五万七千多 2 m
+五万万 2 m
+五万三千多公里 2 m
+五万两 38 m
+五万二千 2 m
+五万五千 5 m
+五万亩 2 m
+五万人次 3 m
+五万余 11 m
+五万余两 2 m
+五万余家 2 m
+五万余级 2 m
+五万元 13 m
+五万八千平方米 2 m
+五万匹 2 m
+五万卷 4 m
+五万名 6 m
+五万块 3 m
+五万多 40 m
+五万多名 2 m
+五万头 2 m
+五万里 3 m
+五万零五百公里 2 m
+五丈 334 m
+五三 6 m
+五三年 5 m
+五下 9 m
+五不准 2 n
+五专 3 j
+五专生 3 j
+五世 210 nrt
+五世其昌 3 nz
+五世同堂 2 nz
+五丙 3 nz
+五两 109 m
+五两一锭 2 m
+五两余 2 m
+五两案 2 m
+五两重 3 m
+五个 1860 m
+五个一工程 103 l
+五中 270 nrt
+五中全会 239 j
+五丰 3 nz
+五串 4 m
+五九 15 m
+五九四十五 2 m
+五九年 6 m
+五乡 6 m
+五二 21 m
+五二年 5 m
+五五 18 m
+五五分 2 m
+五五分帐 3 m
+五五年 2 m
+五五开 3 m
+五五数 6 m
+五五波 3 nr
+五五百百名 2 m
+五五草案 3 i
+五亩 21 m
+五亲六眷 3 i
+五人制 3 n
+五亿 5 m
+五亿八千万 2 m
+五仙 4 n
+五仙教 19 nz
+五代 1734 t
+五代十国 3 nz
+五代史 3 nz
+五代同堂 4 nz
+五件 31 m
+五件套 3 nz
+五任 4 m
+五份 3 m
+五伦 7 nrt
+五伯 3 ns
+五位 214 m
+五位一体 6 l
+五位数 3 n
+五体投地 85 i
+五体投诚 3 nz
+五例 3 m
+五侯七贵 3 nr
+五侯蜡烛 3 n
+五保 790 j
+五保户 14 n
+五倍 73 m
+五倍子 38 n
+五倍子虫 3 n
+五假 3 t
+五儿 19 m
+五元 70 m
+五光十色 64 i
+五党 3 n
+五八 5 m
+五八年 7 m
+五公斤 2 m
+五公祠 13 nr
+五公里 10 m
+五六 126 m
+五六万 25 m
+五六万匹 2 m
+五六万户 2 m
+五六万米 2 m
+五六丈 23 m
+五六两 2 m
+五六个 142 m
+五六亩 2 m
+五六份 2 m
+五六位 4 m
+五六倍 8 m
+五六元 4 m
+五六分 5 m
+五六分钟 12 m
+五六匹 3 m
+五六十 75 m
+五六十万 5 m
+五六十万两 2 m
+五六十万元 3 m
+五六十丈 2 m
+五六十两 4 m
+五六十个 11 m
+五六十元 4 m
+五六十匹 2 m
+五六十只 2 m
+五六十名 3 m
+五六十块 2 m
+五六十家 2 m
+五六十岁 22 m
+五六十年 15 m
+五六十年代 3 m
+五六十招 4 m
+五六十斤 7 m
+五六十株 2 m
+五六十米 6 m
+五六十艘 2 m
+五六十里 22 m
+五六千 151 m
+五六千两 4 m
+五六千元 17 m
+五六千克 3 m
+五六千块 2 m
+五六千年 15 m
+五六千米 3 m
+五六只 13 m
+五六名 13 m
+五六回 4 m
+五六块 8 m
+五六处 4 m
+五六天 29 m
+五六家 4 m
+五六寸 6 m
+五六尺 8 m
+五六层 3 m
+五六岁 29 m
+五六平方米 2 m
+五六年 70 m
+五六座 2 m
+五六成 7 m
+五六把 4 m
+五六担 2 m
+五六招 3 m
+五六斤 7 m
+五六日 9 m
+五六月 2 m
+五六本 2 m
+五六条 7 m
+五六杯 2 m
+五六枚 2 m
+五六次 18 m
+五六步 13 m
+五六海里 2 m
+五六百 36 m
+五六百个 2 m
+五六百元 11 m
+五六百名 3 m
+五六百块 3 m
+五六百年 5 m
+五六百户 4 m
+五六百斤 3 m
+五六百米 3 m
+五六百里 2 m
+五六碗 7 m
+五六种 3 m
+五六米 23 m
+五六级 2 m
+五六路 2 m
+五六遍 3 m
+五六道 2 m
+五六里 50 m
+五六门 2 m
+五六间 4 m
+五六页 3 m
+五六顿 2 m
+五六颗 2 m
+五关 3 ns
+五具 22 m
+五典三坟 3 n
+五内 3 t
+五内俱崩 3 i
+五内俱焚 3 i
+五内如焚 7 i
+五册 4 m
+五冬六夏 3 ns
+五凤 32 nz
+五凤楼 23 nr
+五出戏 3 i
+五刀 7 m
+五分 1110 m
+五分之一 7 m
+五分之二 2 m
+五分制 3 n
+五分裤 3 n
+五分钟 88 m
+五刑 40 n
+五列 3 m
+五则 6 m
+五力 3 n
+五加 26 nz
+五加皮 8 n
+五劳七伤 2 i
+五包 4 m
+五匙 3 n
+五匹 27 m
+五十 666 m
+五十一 20 m
+五十一万 5 m
+五十一个 3 m
+五十一卷 3 m
+五十一岁 2 m
+五十一年 22 m
+五十七 12 m
+五十七个 3 m
+五十七岁 8 m
+五十七年 18 m
+五十万 112 m
+五十万两 19 m
+五十万两匹 4 m
+五十万元 7 m
+五十万册 2 m
+五十万左右 2 m
+五十丈 4 m
+五十三 19 m
+五十三两个 2 m
+五十三亩 2 m
+五十三分钟 2 m
+五十三卷 2 m
+五十三名 2 m
+五十三家 2 m
+五十三岁 7 m
+五十三年 14 m
+五十三日 4 m
+五十三线 2 m
+五十下 3 m
+五十两 131 m
+五十两一锭 2 m
+五十个 46 m
+五十九 23 m
+五十九厘米 2 m
+五十九岁 8 m
+五十九年 23 m
+五十九招 3 m
+五十九篇 2 m
+五十二 14 m
+五十二万 2 m
+五十二万余 2 m
+五十二个 4 m
+五十二任 2 m
+五十二卷 4 m
+五十二处 2 m
+五十二天 19 m
+五十二岁 4 m
+五十二年 15 m
+五十二文 2 m
+五十二篇 2 m
+五十二辑 2 m
+五十五 14 m
+五十五万两 2 m
+五十五万余 2 m
+五十五个 3 m
+五十五六岁 3 m
+五十五岁 35 m
+五十五年 37 m
+五十五类 2 m
+五十亩 15 m
+五十代 2 m
+五十余 36 m
+五十余万 9 m
+五十余万平方公里 2 m
+五十余丈 2 m
+五十余只 3 m
+五十余名 3 m
+五十余员 2 m
+五十余处 2 m
+五十余天 2 m
+五十余家 2 m
+五十余岁 10 m
+五十余年 7 m
+五十余座 2 m
+五十余所 3 m
+五十余招 3 m
+五十余斤 3 m
+五十余日 7 m
+五十余条 3 m
+五十余米 3 m
+五十余节 2 m
+五十余辆 2 m
+五十余里 12 m
+五十元 45 m
+五十克 3 m
+五十八 15 m
+五十八万四千八百一十六公里 2 m
+五十八卷 2 m
+五十八发 2 m
+五十八名 2 m
+五十八岁 13 m
+五十八年 20 m
+五十八条 2 m
+五十八种 2 m
+五十公里 9 m
+五十六 25 m
+五十六万 2 m
+五十六万两 2 m
+五十六个 8 m
+五十六岁 14 m
+五十六年 27 m
+五十六文 2 m
+五十六条 2 m
+五十六线 2 m
+五十六部 2 m
+五十几 4 m
+五十几个 4 m
+五十几岁 6 m
+五十出头 6 m
+五十分钟 4 m
+五十匹 10 m
+五十卷 18 m
+五十只 5 m
+五十名 58 m
+五十周年 14 m
+五十四 41 m
+五十四万 2 m
+五十四个 2 m
+五十四五 2 m
+五十四五岁 2 m
+五十四句 2 m
+五十四家 2 m
+五十四岁 7 m
+五十四年 24 m
+五十四座 2 m
+五十四斤 2 m
+五十四步 2 m
+五十四辆 2 m
+五十块 21 m
+五十多 15 m
+五十多万 2 m
+五十多个 9 m
+五十多件 2 m
+五十多位 3 m
+五十多只 9 m
+五十多名 8 m
+五十多天 2 m
+五十多岁 66 m
+五十多年 24 m
+五十多户 2 m
+五十多米 3 m
+五十多里 6 m
+五十多间 3 m
+五十天 11 m
+五十好几 2 m
+五十岁 134 m
+五十年 184 m
+五十年代 10 m
+五十开 2 m
+五十张 3 m
+五十户 3 m
+五十把 5 m
+五十招 8 m
+五十支 2 m
+五十文 6 m
+五十斤 30 m
+五十条 3 m
+五十根 6 m
+五十步 14 m
+五十步笑百步 5 i
+五十毫升 2 m
+五十点 2 m
+五十种 3 m
+五十秒 2 m
+五十篇 4 m
+五十米 20 m
+五十辆 8 m
+五十道 2 m
+五十里 98 m
+五十铃 6 nz
+五十间 3 m
+五十顷 4 m
+五十首 3 m
+五十马克 2 nrt
+五千 472 m
+五千万 28 m
+五千万两 2 m
+五千万元 3 m
+五千三百户 2 m
+五千两 74 m
+五千个 7 m
+五千九百零一匹 2 m
+五千二百余亩 2 m
+五千五百余万元 2 m
+五千五百年 2 m
+五千亩 8 m
+五千亿元 17 m
+五千余 41 m
+五千余名 3 m
+五千余箱 2 m
+五千余里 2 m
+五千元 43 m
+五千八 3 m
+五千六百四十一万余两 2 m
+五千名 7 m
+五千响 3 m
+五千四百八十一卷 3 m
+五千四百岁 7 m
+五千块 10 m
+五千多 7 m
+五千多万 2 m
+五千多两 2 m
+五千多个 2 m
+五千多名 2 m
+五千多年 4 m
+五千多户 2 m
+五千年 117 m
+五千户 11 m
+五千文 5 m
+五千斤 2 m
+五千本 3 m
+五千步 4 m
+五千米 2 m
+五千股 2 m
+五千部 2 m
+五千里 40 m
+五千零六十万 2 m
+五千零四十八卷 4 m
+五千零四十八斤 2 m
+五千顷 3 m
+五卅 42 m
+五卅惨案 3 vn
+五卅运动 226 nz
+五华 16 nz
+五华区 3 ns
+五华县 3 ns
+五华山 3 ns
+五华里 5 ns
+五卫 3 j
+五卷 59 m
+五原 97 ns
+五原县 10 ns
+五县 276 ns
+五反运动 3 nz
+五发 7 j
+五口 94 m
+五口之家 3 l
+五古 21 ns
+五句 14 m
+五只 75 m
+五台 74 m
+五台县 22 ns
+五台山 388 ns
+五叶 9 t
+五叶饰 3 n
+五号 58 m
+五号线 3 n
+五合一 3 b
+五合六聚 3 nz
+五合板 2 n
+五名 423 m
+五员 16 n
+五周岁 3 m
+五周年 8 m
+五味 65 m
+五味俱全 8 i
+五味子 58 n
+五味斋 3 nz
+五味杂陈 3 l
+五味瓶 10 i
+五品 199 n
+五响 3 m
+五商 3 n
+五四 667 m
+五四三 3 m
+五四式 3 nz
+五四新文化运动 45 nz
+五四时代 3 t
+五四路 2 m
+五四运动 1030 nz
+五回 2 m
+五国城 4 ns
+五国部 3 nt
+五圆 3 n
+五圣山 18 nr
+五场 30 m
+五块 90 m
+五坪 3 ns
+五城 70 ns
+五堂 8 m
+五堰 3 ns
+五堵 3 m
+五塘镇 3 ns
+五壮士 3 ns
+五声 42 m
+五声道 3 i
+五处 40 m
+五夜 22 t
+五大 541 j
+五大三粗 15 i
+五大州 3 ns
+五大洲 3 ns
+五大湖 3 ns
+五大类 3 m
+五大连池 51 ns
+五大连池市 8 ns
+五天 297 t
+五头 8 m
+五套 7 m
+五女山 2 ns
+五子 3 m
+五子棋 20 nr
+五子登科 5 nr
+五孔桥 3 nr
+五字 3 nz
+五季 3 t
+五宗 7 m
+五官 216 n
+五官科 12 nr
+五官端正 3 nr
+五客 3 n
+五家 67 m
+五家渠 3 nr
+五家渠市 3 ns
+五寨 9 ns
+五寨县 2 ns
+五寸 66 m
+五对 13 m
+五封 10 m
+五小 11 j
+五小时 3 j
+五尺 250 m
+五尺之僮 3 n
+五尺之童 3 l
+五尺竖子 3 i
+五尺童子 3 l
+五尺道 16 i
+五局 6 j
+五层 35 m
+五屉柜 2 nz
+五届 404 m
+五岁 179 m
+五岭 44 nrt
+五岳 630 ns
+五峰 304 m
+五峰县 5 ns
+五峰土家族自治县 262 ns
+五巷 3 nz
+五师 3 n
+五帝 83 nrt
+五席 5 m
+五常 28 t
+五常县 3 ns
+五常市 3 n
+五幅 3 m
+五幕 2 m
+五年 4330 t
+五年制 7 n
+五年期 9 t
+五年级 3 b
+五年计划 185 n
+五床 3 nz
+五度 38 mq
+五度五关 3 ns
+五座 294 m
+五建 131 j
+五式 3 n
+五弟 3 n
+五张 30 m
+五弦琴 3 n
+五彩 417 nz
+五彩夺目 3 i
+五彩斑斓 28 i
+五彩池 3 nr
+五彩洒金 3 i
+五彩石 3 nr
+五彩祥云 3 nr
+五彩纷呈 4 i
+五彩纸屑 3 i
+五彩缤纷 97 i
+五律 38 n
+五德 23 nrt
+五心六意 3 i
+五感 3 n
+五成 56 m
+五成新 3 nz
+五成谱 3 l
+五戒 29 n
+五截 3 m
+五户 29 m
+五所 23 j
+五扇 3 m
+五批 2 m
+五把 13 m
+五折 8 m
+五抢六夺 3 i
+五报 3 nz
+五招 40 m
+五拳 3 m
+五指 238 j
+五指山 51 ns
+五指山区 6 ns
+五指山市 3 ns
+五指峰 3 nz
+五指毛桃 3 nz
+五排 2 m
+五支 37 m
+五支箭 5 n
+五文 5 nz
+五文钱 3 n
+五斗 89 m
+五斗折腰 3 l
+五斗柜 3 nz
+五斗橱 17 n
+五斤 41 m
+五方 86 m
+五方杂处 5 l
+五方面 10 mq
+五日 195 t
+五日一石 3 nz
+五日京兆 3 nz
+五日份 3 nz
+五日游 3 nz
+五星 237 nz
+五星上将 3 i
+五星旗 3 nr
+五星村 2 nr
+五星红旗 570 nr
+五星级 145 b
+五显岗 3 nr
+五晚 3 t
+五更 397 t
+五更天 3 i
+五月 1355 t
+五月份 3 nz
+五月天 3 t
+五月披裘 3 i
+五月节 6 t
+五月花 13 nz
+五月雪 3 nr
+五月飞霜 3 i
+五服 42 n
+五朔节 3 i
+五期 12 t
+五本 5 ns
+五朵 36 m
+五权 3 n
+五权分立 3 i
+五权宪法 45 nz
+五条 179 m
+五杯 4 m
+五板 3 n
+五林 5 nz
+五枚 37 m
+五枝 5 m
+五枢 3 n
+五枪 5 m
+五架 4 m
+五栋 3 m
+五株 6 m
+五样 8 m
+五根 103 m
+五格 3 n
+五档 3 m
+五梏 3 n
+五棓子 3 t
+五棵松 10 ns
+五榖 3 vn
+五榖丰收 3 nr
+五樂崾 3 vn
+五横 256 nz
+五次 220 m
+五次犯规 3 i
+五欲 3 n
+五款 5 m
+五步 50 m
+五步成诗 3 l
+五步曲 3 m
+五步蛇 3 i
+五段 14 m
+五毒 120 nz
+五毒俱全 3 i
+五毒教 106 nz
+五毛 3 n
+五毛钱 3 n
+五氧化二磷 6 nz
+五氧化二钒 14 n
+五氯化磷 4 nz
+五氯酚钠 2 nz
+五河 9 ns
+五河县 3 ns
+五泉 10 nz
+五洋 5 ns
+五洞 3 ns
+五洲 66 ns
+五洲四海 20 ns
+五派 102 m
+五海村 3 ns
+五湖 3 ns
+五湖四海 57 nz
+五溪蛮 2 nr
+五灵脂 7 ns
+五点 129 m
+五点四 2 m
+五点钟 3 m
+五爷 3 n
+五片 9 m
+五版 3 n
+五牛 54 nz
+五牛队 36 n
+五环 14 nz
+五环旗 3 ns
+五环路 6 nz
+五班 2 m
+五瓶 6 m
+五甲 3 b
+五申三令 3 nr
+五男二女 3 l
+五番 4 m
+五百 537 m
+五百万 22 m
+五百万两 16 m
+五百万元 8 m
+五百万斤 2 m
+五百万镑 3 m
+五百万马克 4 m
+五百三十 4 m
+五百三十余万 2 m
+五百两 95 m
+五百两一张 2 m
+五百个 24 m
+五百二十一位 2 m
+五百二十卷 4 m
+五百二十门 2 m
+五百五 2 m
+五百五十万 5 m
+五百五十万两 2 m
+五百五十万元 2 m
+五百五十万平方米 3 m
+五百五十二家 4 m
+五百五十余万两 2 m
+五百五十余平方公里 2 m
+五百五十卷 2 m
+五百亿美元 2 m
+五百件 2 m
+五百份 18 m
+五百位 2 m
+五百余 33 m
+五百余万 2 m
+五百余匹 3 m
+五百余名 2 m
+五百余年 12 m
+五百余次 2 m
+五百余种 3 m
+五百余里 6 m
+五百元 21 m
+五百八十二卷 2 m
+五百八十五 2 m
+五百公斤 4 m
+五百公里 3 m
+五百六十万 2 m
+五百具 2 m
+五百匹 18 m
+五百卷 5 m
+五百发 2 m
+五百口 2 m
+五百只 3 m
+五百名 51 m
+五百吨 2 m
+五百响 4 m
+五百四十 2 m
+五百四十万 2 m
+五百四十万马克 2 m
+五百四十五辆 2 m
+五百块 17 m
+五百多 27 m
+五百多万 5 m
+五百多两 4 m
+五百多个 5 m
+五百多位 3 m
+五百多名 5 m
+五百多封 2 m
+五百多年 11 m
+五百多座 2 m
+五百多里 2 m
+五百头 5 m
+五百家 5 m
+五百岁 4 m
+五百年 228 m
+五百强 3 nr
+五百户 7 m
+五百所 2 m
+五百担 2 m
+五百文 7 m
+五百斤 9 m
+五百枝 3 m
+五百步 12 m
+五百米 4 m
+五百载 3 m
+五百里 45 m
+五百零三部 2 m
+五百零九万两 2 m
+五盏 5 m
+五盒 6 m
+五盘 10 m
+五目 4 n
+五眼 8 m
+五短 3 nz
+五短身材 17 i
+五石六鹢 3 nz
+五矿 15 j
+五码 3 n
+五碗 4 m
+五福 10 nz
+五福临门 3 ns
+五福娃 3 nr
+五禽戏 15 i
+五种 314 m
+五科 3 nz
+五秒 2 m
+五积六受 3 i
+五站 2 m
+五章 2 m
+五端 3 m
+五笔 5 m
+五笔划 3 nz
+五笔加加 3 nz
+五笔型 3 nz
+五笔字 6 nz
+五笔字型 10 nz
+五笔桥 3 nz
+五笔画 3 n
+五符 3 nz
+五等 80 m
+五等奖 3 nz
+五筒 3 n
+五箱 3 m
+五篇 14 m
+五米 36 m
+五类 149 m
+五类分子 3 n
+五粒 4 m
+五粮液 163 n
+五素 3 n
+五素县 3 ns
+五级 54 b
+五线 3 m
+五线谱 29 n
+五组 4 m
+五经 140 n
+五经扫地 3 i
+五绝 40 ns
+五维 5 m
+五缕 2 m
+五罐 3 m
+五羊 8 n
+五美元 2 m
+五羖大夫 3 nz
+五群 6 m
+五老峰 10 nr
+五联 11 ns
+五股 12 m
+五股乡 3 nz
+五胎 3 m
+五胞胎 3 n
+五胡 3 nr
+五胡之乱 3 i
+五胡乱华 3 i
+五胡十六 3 nrt
+五脊六兽 2 i
+五脏 128 n
+五脏俱全 9 i
+五脏六腑 121 i
+五船 3 n
+五艘 26 m
+五色 183 n
+五色土 643 n
+五色旗 3 ns
+五色无主 3 i
+五色相宣 3 i
+五色缤纷 10 i
+五节 17 t
+五节课 3 n
+五花 38 n
+五花八门 152 i
+五花大绑 65 l
+五花杀马 3 i
+五花海 3 ns
+五花肉 15 n
+五花马 3 ns
+五芳斋 4 nr
+五苓散 6 nr
+五英里 3 m
+五荒 3 ns
+五荤 4 n
+五莲 5 nr
+五莲县 3 ns
+五莲山 3 nr
+五营 3 b
+五营区 3 n
+五蕴 31 n
+五蕴皆空 3 nr
+五藏六府 3 ns
+五虎 3 nz
+五虎上将 3 i
+五虎将 3 i
+五虚六耗 3 l
+五行 931 j
+五行俱下 3 i
+五行八作 3 i
+五行字 3 n
+五行并下 3 i
+五行生克 3 nz
+五行阵 3 n
+五街 3 ns
+五衰 3 n
+五袋 26 m
+五规范 3 l
+五角 31 m
+五角六张 3 ns
+五角场 3 n
+五角大厦 3 ns
+五角大楼 351 ns
+五角形 7 n
+五角星 147 nz
+五角枫 3 nr
+五角钱 3 n
+五言 71 n
+五言律诗 3 n
+五言绝句 3 i
+五言诗 51 n
+五言长城 3 i
+五记 2 n
+五讲四美 4 j
+五课 3 n
+五谷 347 n
+五谷不分 3 l
+五谷不升 3 l
+五谷丰熟 3 ns
+五谷丰登 38 nz
+五谷杂粮 17 n
+五起 10 m
+五趟 3 m
+五路 84 m
+五路纵队 3 n
+五车 32 n
+五轮 57 m
+五轮真弓 3 nz
+五轻 3 nz
+五载 12 m
+五辆 15 m
+五辆车 3 n
+五辈子 2 m
+五输穴 3 n
+五边形 12 n
+五连冠 141 nr
+五迷三道 3 i
+五通 7 nz
+五通桥 6 ns
+五通桥区 3 ns
+五遍 3 m
+五道 325 m
+五道口 3 n
+五郎 12 m
+五部 76 m
+五部委 3 n
+五部曲 3 m
+五里 536 m
+五里亭 3 nrt
+五里冲 3 nr
+五里店 3 ns
+五里桥 4 ns
+五里桥乡 5 ns
+五里河 14 ns
+五里湖 3 ns
+五里镇 2 ns
+五里雾 26 i
+五里雾中 3 ns
+五重 11 m
+五重奏 19 nr
+五金 75 n
+五金交电 4 nz
+五金产品 3 n
+五金件 2 n
+五金制品 3 n
+五金厂 3 n
+五金塑料 3 nz
+五金工具 3 n
+五金工艺 3 n
+五金店 6 nz
+五金建材 3 nz
+五金机械 3 n
+五金材料 3 n
+五金模具 3 l
+五金网 3 nz
+五金行业 3 n
+五金装饰 3 n
+五金配件 3 n
+五铢 11 m
+五铢钱 65 n
+五锭 2 m
+五门 303 m
+五间 1103 t
+五间坊 3 nz
+五间坊村 3 ns
+五队 11 m
+五阵 2 m
+五院 3 j
+五陵 5 ns
+五陵年少 3 nrt
+五陵英少 3 nr
+五陵豪气 3 n
+五雀六燕 3 nr
+五集 3 m
+五零 3 m
+五零二落 3 i
+五零四 2 m
+五零四散 3 i
+五雷轰顶 27 i
+五霸 93 nz
+五面 16 m
+五面体 3 n
+五音 30 n
+五音不全 4 l
+五音六律 3 l
+五页 2 m
+五顶 4 m
+五顷 10 m
+五项 269 m
+五项原则 3 n
+五顿 4 m
+五颗 26 m
+五颗星 3 nr
+五题 3 n
+五颜六色 124 i
+五风十雨 3 i
+五餐 3 m
+五餐饭 3 n
+五首 20 m
+五香 33 n
+五香十味 3 nz
+五香粉 2 nz
+五香豆 3 nr
+五马 7 ns
+五马分尸 19 i
+五鬼闹判 3 l
+五黄六月 3 i
+五鼎万钟 3 i
+五龙 45 nz
+五龙山 6 ns
+五龙潭 3 ns
+井 1460 zg
+井上 33 s
+井上敏夫 4 nr
+井上毅 2 nr
+井上靖 3 nr
+井下 170 s
+井下测量 3 n
+井中月 3 nr
+井中水 2 nr
+井中求火 3 i
+井中盟 3 nr
+井中视星 3 n
+井之制 3 nr
+井之法 2 nr
+井井 3 ns
+井井有序 3 i
+井井有方 3 i
+井井有条 89 i
+井井有法 3 i
+井井有绪 3 i
+井伊直 2 nr
+井位 4 n
+井位标 3 n
+井俊二 11 nr
+井元代 2 nr
+井冈 16 ns
+井冈山 486 ns
+井冈山市 10 ns
+井冈山革命博物馆 2 ns
+井出 17 v
+井口 350 ns
+井口俊英 4 nr
+井口帽 3 n
+井口模块 3 i
+井台 64 ns
+井喷 81 nz
+井喷式 3 nr
+井四郎 3 nr
+井场 4 n
+井坂 3 ns
+井壁 50 s
+井壁取心 3 i
+井壁污染 3 i
+井头 2 n
+井岗山 2 nr
+井岸镇 3 nr
+井巷 10 nr
+井平灶 2 nr
+井底 89 s
+井底之蛙 37 i
+井底捞月 3 i
+井底虾蟆 3 nr
+井底蛙 2 n
+井底蛤蟆 3 n
+井底鸣蛙 3 i
+井式 2 n
+井式炉 2 nr
+井径 3 n
+井户川 2 ns
+井斜测量 3 n
+井有顺 2 nr
+井木犴 19 nr
+井架 16 n
+井栏 3 n
+井栏圈 2 n
+井水 84 ns
+井水不犯河水 36 i
+井沿 3 s
+井法 3 n
+井渫不食 3 v
+井渫莫食 3 nz
+井灌 2 nr
+井灌井 2 nr
+井然 9 nr
+井然有序 49 i
+井然有条 3 i
+井牧其 3 nr
+井田 45 nr
+井田制 42 nr
+井田制度 3 n
+井盐 40 n
+井盖 6 nr
+井眼 3 n
+井眼条件 3 n
+井石根 2 nr
+井研 3 n
+井研县 3 ns
+井穴 23 n
+井筒 22 n
+井绳 11 n
+井网密度 3 n
+井臼 3 ns
+井臼亲操 3 n
+井蛙 3 n
+井蛙之见 2 nr
+井蛙观天 3 nr
+井蛙醯鸡 3 vn
+井边 46 s
+井里汶 2 nr
+井队 3 n
+井陉 52 ns
+井陉县 26 ns
+井陉矿区 3 ns
+亖 4 zg
+亗 2 zg
+亘 25 n
+亘古 47 n
+亘古不灭 3 i
+亘古亘今 3 v
+亘古奇闻 3 i
+亘古新闻 3 n
+亘古未有 11 i
+亘古通今 3 i
+亚 5789 j
+亚丁 57 nrt
+亚丁港 4 ns
+亚丁湾 37 ns
+亚世 6 nrt
+亚世达 2 nr
+亚东 38 ns
+亚东关系 3 nt
+亚东县 5 ns
+亚东工专 3 nt
+亚东工业 3 nt
+亚乃夫 2 nr
+亚之杰 3 nr
+亚乔木 3 nr
+亚乙基 2 nr
+亚书 3 n
+亚伊杰 2 nr
+亚优杯 3 nr
+亚伦 7 ns
+亚伯 2 ns
+亚伯奎 6 nr
+亚伯拉罕 19 nrt
+亚伯特 2 nr
+亚伯达 4 nr
+亚伯迪 2 nr
+亚佐夫 3 nr
+亚信 3 nz
+亚俱杯 8 nz
+亚俱罗 2 nr
+亚健康 49 nr
+亚克 17 nrt
+亚克兴 4 ns
+亚克力 3 nr
+亚典波罗 3 nz
+亚军 352 nr
+亚军奖 3 nz
+亚军奖牌 3 n
+亚冠赛 4 nr
+亚冬会 3 nr
+亚凯迪严市 2 ns
+亚利安 3 ns
+亚利安人 3 nrt
+亚利山 2 ns
+亚利桑 14 nr
+亚利桑纳 2 ns
+亚利桑那 21 ns
+亚利桑那大学 2 nt
+亚利桑那州 46 ns
+亚力 10 n
+亚力克 3 nr
+亚力合 9 nr
+亚力山 7 nr
+亚力山大 3 ns
+亚加力 3 nr
+亚华 4 nz
+亚协国家 3 nz
+亚博卢 4 nr
+亚历 4 n
+亚历克 2 ns
+亚历克斯 5 ns
+亚历山 4 ns
+亚历山大 550 ns
+亚历山大图书馆 10 nt
+亚历山大城 34 ns
+亚历山大广场 13 ns
+亚历山大港 18 ns
+亚历山德 3 ns
+亚历山德拉 2 ns
+亚历山德罗 3 ns
+亚历山德罗夫 4 ns
+亚历山德里亚 3 ns
+亚原子 18 nr
+亚原子性 3 n
+亚吉 14 nrt
+亚哈 2 nrt
+亚哥 3 ns
+亚商 2 n
+亚喀巴 12 ns
+亚喀巴湾 24 ns
+亚圣 3 ns
+亚圣孟子 3 nr
+亚圣府 2 nr
+亚地带 2 j
+亚型 36 n
+亚基 10 nrt
+亚基含 2 nr
+亚基斯 6 ns
+亚基河 2 ns
+亚塔珠 5 nr
+亚声速 3 n
+亚大 8 ns
+亚大帝 2 nr
+亚太 84 nr
+亚太二号 3 nz
+亚太区 78 ns
+亚太地区 642 ns
+亚太经合 3 nr
+亚太经合组织 10 nt
+亚太经济 9 n
+亚太经济合作组织 10 nt
+亚太经社会 8 nt
+亚威农 4 nr
+亚娜 6 nrt
+亚宙斯 19 nr
+亚宝 3 nrt
+亚宾斯 2 nr
+亚寒带 43 nr
+亚尔 60 nrt
+亚尔乡 3 ns
+亚尔代 2 nr
+亚尔兑 3 nr
+亚尔公 16 nr
+亚尔古 5 ns
+亚尔果 2 ns
+亚尔果斯 4 nrt
+亚尔青 3 nr
+亚尔青斯 3 ns
+亚尼 10 nrt
+亚山 2 ns
+亚布力 3 nr
+亚平 345 ns
+亚平刚 2 nr
+亚平妈 127 nr
+亚平姐 4 nr
+亚平姐姐 2 nr
+亚平娘 3 nr
+亚平宁 30 ns
+亚平宁半岛 18 ns
+亚广联 2 ns
+亚当 180 nrt
+亚当史密 3 ns
+亚当夏娃 3 nrt
+亚当斯 57 nrt
+亚彭德 3 nr
+亚得里亚 24 ns
+亚得里亚海 50 ns
+亚德 5 nrt
+亚德里亚 6 ns
+亚心 3 n
+亚急性 3 n
+亚戈 3 nrt
+亚拉 10 nrt
+亚拉伯 4 ns
+亚拉伯湾 3 ns
+亚拉巴马 9 ns
+亚拉巴马州 14 ns
+亚拉河 2 ns
+亚排联 5 j
+亚文化 25 nr
+亚斯 21 ns
+亚斯坦 3 ns
+亚斯河 3 ns
+亚斯纳亚 2 ns
+亚显微 6 nr
+亚暴 2 n
+亚松森 21 nr
+亚欧 6 ns
+亚欧会议 8 n
+亚欧大陆 55 ns
+亚欧大陆桥 24 ns
+亚毫米波 3 nr
+亚氯 3 nz
+亚氯酸 2 nz
+亚氯酸盐 2 nz
+亚沃维 4 nr
+亚河 4 ns
+亚油酸 33 n
+亚泰 119 nz
+亚泰队 41 nt
+亚洲 5863 ns
+亚洲一号 4 nz
+亚洲信托 3 nr
+亚洲公主 3 n
+亚洲区 18 ns
+亚洲协会 7 nt
+亚洲司 22 nt
+亚洲各国 3 ns
+亚洲商业 3 nt
+亚洲地区 55 ns
+亚洲太平洋地区 3 ns
+亚洲小姐 3 nr
+亚洲开发银行 18 nt
+亚洲明星 3 nz
+亚洲杯 57 nz
+亚洲杯赛 18 nz
+亚洲版 3 n
+亚洲电视 3 nt
+亚洲纪录 3 n
+亚洲记录 3 nz
+亚洲象 27 n
+亚海滨 2 ns
+亚热 2 nrt
+亚热带 2267 n
+亚父 10 n
+亚特 12 nrt
+亚特兰 3 ns
+亚特兰大 82 ns
+亚特兰大奥运会 5 nz
+亚特兰蒂斯 13 nrt
+亚特尔 4 nrt
+亚特木卡姆 3 nrt
+亚玛逊 2 nr
+亚琛 16 nr
+亚瑟 5 nrt
+亚瑟王 2 nrt
+亚瓦纳 8 nr
+亚甲蓝 2 nr
+亚的斯亚贝巴 46 ns
+亚盖洛 2 nr
+亚盛 8 nz
+亚盟 3 ns
+亚目 3 n
+亚眠 19 ns
+亚砜 3 nz
+亚砷酸 3 n
+亚砷酸盐 3 n
+亚砷酸钠 2 n
+亚硝化螺菌 3 n
+亚硝基 9 nr
+亚硝胺 71 nz
+亚硝酸 36 nz
+亚硝酸盐 149 nz
+亚硝酸钠 52 nz
+亚硫酐 3 nz
+亚硫酰氯 4 nz
+亚硫酸 15 nz
+亚硫酸氢钠 4 nz
+亚硫酸盐 7 nz
+亚硫酸钠 4 nz
+亚磷酸 2 nz
+亚磷酸盐 3 nz
+亚种 176 n
+亚科 282 ns
+亚稳平衡 3 nr
+亚稳态 12 n
+亚稳相 3 nr
+亚稳离子 3 n
+亚穆纳 4 nr
+亚穆纳河 5 ns
+亚穆苏克罗 8 nrt
+亚纲 196 nr
+亚纲基 2 nr
+亚纲枝 2 nr
+亚纳 10 ns
+亚纳耶夫 2 nrt
+亚纳邦 4 nr
+亚细亚 434 ns
+亚细亚洲 3 ns
+亚细亚生 3 ns
+亚细安 34 ns
+亚罗 9 nrt
+亚罗斯 2 ns
+亚美 3 ns
+亚美利 5 ns
+亚美利加 9 ns
+亚美尼亚 223 ns
+亚美尼亚人 35 nz
+亚美尼亚共和国 7 ns
+亚美尼亚语 11 nz
+亚耶 2 nrt
+亚联 3 ns
+亚肩叠背 3 nr
+亚肩迭背 3 nr
+亚胺 20 nz
+亚航 9 j
+亚艺节 3 n
+亚莉丝 3 nr
+亚行 63 j
+亚裔 17 n
+亚西尔 3 ns
+亚西雷 4 nr
+亚视 2 j
+亚记联 3 nz
+亚语 3 nz
+亚诺 2 nrt
+亚诺夫 4 nr
+亚诺尔 2 nr
+亚诺金 3 nr
+亚赛 3 ns
+亚足联 14 ns
+亚辛 4 nrt
+亚达 3 ns
+亚运 132 j
+亚运会 765 j
+亚运意识 3 n
+亚运村 36 ns
+亚运选手 3 n
+亚述 150 nr
+亚述人 26 nr
+亚述学 5 n
+亚述王 3 nr
+亚速尔群岛 25 ns
+亚速海 42 ns
+亚那 19 ns
+亚都 4 ns
+亚里士 4 ns
+亚里士多德 313 nrt
+亚金 5 n
+亚铁 13 n
+亚铁氰化钾 8 nz
+亚铁磁性 3 n
+亚铅 3 nz
+亚银 3 nz
+亚锡 2 ns
+亚锦赛 23 nr
+亚阿隆 2 nr
+亚雪带 3 nr
+亚青赛 13 nr
+亚非 23 ns
+亚非会议 9 nt
+亚非拉 46 nr
+亚音速 46 n
+亚音频 3 nr
+亚马 5 ns
+亚马孙 86 nr
+亚马孙地区 3 ns
+亚马孙河 128 ns
+亚马尔 6 nrt
+亚马尼 2 nr
+亚马逊 40 nrt
+亚马逊族 3 nr
+亚马逊河 47 ns
+亚高山 4 ns
+亚麦杜 16 nr
+亚麻 234 n
+亚麻子 3 nr
+亚麻布 19 nr
+亚麻棉 3 nr
+亚麻油 5 n
+亚麻色 3 nr
+亚麻酸 26 n
+亚齐 26 ns
+亚龙 8 ns
+亚龙湾 24 ns
+些 17919 q
+些个 3 m
+些些 3 m
+些小 116 a
+些微 75 d
+些许 163 d
+些许端 2 m
+些须 3 d
+亜 20 zg
+亝 6 zg
+亞 13 zg
+亟 182 v
+亟待 114 v
+亟待解决 31 l
+亟欲 3 v
+亟疾苛察 3 vn
+亟盼 11 v
+亟需 52 v
+亟须 20 d
+亡 2209 vg
+亡不待夕 3 i
+亡不旋踵 3 i
+亡佚 84 v
+亡兄 3 n
+亡党 3 n
+亡党亡国 3 n
+亡友 11 n
+亡可奈何 3 i
+亡命 105 v
+亡命之徒 50 i
+亡命天涯 3 i
+亡命徒 17 n
+亡国 614 n
+亡国之器 3 l
+亡国之声 3 i
+亡国之社 3 l
+亡国之音 3 i
+亡国大夫 3 n
+亡国奴 24 n
+亡国灭种 10 n
+亡国破家 3 n
+亡国论 23 n
+亡国论者 3 n
+亡夫 17 n
+亡失 6 v
+亡妹 3 n
+亡妻 24 n
+亡戟得矛 3 i
+亡故 77 n
+亡母 3 n
+亡灵 126 n
+亡灵族 3 n
+亡父 3 n
+亡猿灾木 3 i
+亡猿祸木 3 i
+亡秦三户 3 i
+亡羊 2 n
+亡羊之叹 3 i
+亡羊得牛 3 i
+亡羊补牢 38 i
+亡者 26 n
+亡魂 45 n
+亡魂丧胆 3 i
+亡魂丧魄 3 i
+亡魂失魄 3 i
+亢 143 nr
+亢奋 107 v
+亢心憍气 3 v
+亢旱 2 a
+亢极之悔 3 i
+亢盛 7 a
+亢直 3 a
+亢进 92 v
+亢进症 4 i
+亢金龙 12 nr
+亢雪松 3 nr
+亢音高唱 3 nr
+亢龙有悔 68 i
+亣 75 zg
+交 6026 v
+交上 134 n
+交上去 3 v
+交上来 3 l
+交下 3 n
+交下去 3 l
+交下来 3 l
+交与 85 v
+交予 11 v
+交于 3 v
+交互 311 v
+交互作用 3 l
+交互型业务 2 l
+交互式 61 l
+交互性 21 l
+交互技术 2 n
+交互支抗 3 n
+交互故障 3 n
+交互方式 5 l
+交互规划 3 l
+交互运作 3 l
+交互进行 3 nt
+交互错误 3 l
+交井 3 n
+交些 3 d
+交交 3 v
+交人 3 n
+交付 911 v
+交付使用 3 n
+交付给 3 vn
+交代 911 n
+交代任务 3 n
+交代作用 3 n
+交代罪行 3 n
+交代问题 3 n
+交件 3 n
+交会 173 n
+交会处 28 n
+交会法 3 n
+交会点 33 n
+交会穴 3 n
+交住 3 v
+交保 3 j
+交入 3 v
+交公 18 n
+交关 22 vn
+交兵 3 n
+交出 370 v
+交出去 3 v
+交出来 3 l
+交到 178 v
+交割 121 v
+交割单 3 n
+交割日 3 n
+交割股 3 n
+交办 57 v
+交加 90 v
+交卷 29 n
+交卸 3 vn
+交叉 753 n
+交叉共轭 3 n
+交叉分组 3 n
+交叉双臂 3 l
+交叉口 36 n
+交叉处 13 n
+交叉学科 3 n
+交叉射击 3 n
+交叉开关 3 n
+交叉性 32 n
+交叉感染 6 n
+交叉有致 3 n
+交叉杂交 3 n
+交叉极化 3 n
+交叉步 4 n
+交叉渡线 3 n
+交叉点 184 n
+交叉犁耕 3 n
+交叉着 3 l
+交叉科学 4 n
+交叉竞争 3 l
+交叉端化 3 n
+交叉耦合 3 z
+交叉调制 3 n
+交叉调节 3 n
+交叉赛 4 n
+交叉路口 12 n
+交叉迁移 3 n
+交友 113 n
+交友不慎 3 l
+交友平台 2 nt
+交友网 3 n
+交变 40 v
+交变电场 7 l
+交叠 33 v
+交口 17 n
+交口县 4 n
+交口同声 3 n
+交口称誉 3 n
+交口称赞 23 n
+交口赞誉 3 nz
+交合 24 v
+交响 92 vn
+交响乐 125 n
+交响乐厅 3 n
+交响乐团 310 n
+交响乐章 3 n
+交响乐队 29 n
+交响协奏曲 3 n
+交响曲 283 n
+交响组曲 3 n
+交响诗 47 n
+交响音乐 25 n
+交响音乐会 9 n
+交售 40 vn
+交回 3 v
+交回去 3 l
+交回来 3 l
+交困 3 v
+交城 7 n
+交城县 7 ns
+交大 114 j
+交头互耳 3 l
+交头接耳 89 l
+交好 43 v
+交媾 26 v
+交子 38 n
+交存 32 v
+交学费 3 n
+交完 3 v
+交家电 2 j
+交对 3 v
+交尾 28 n
+交尾季节 3 n
+交巡警 2 j
+交工 2 n
+交差 26 n
+交差了事 3 l
+交帐 3 n
+交并 3 v
+交底 8 n
+交往 1626 v
+交往甚密 3 i
+交待 407 v
+交心 26 n
+交恶 30 n
+交情 243 n
+交感 39 n
+交感神经 153 l
+交战 734 v
+交战团体 6 n
+交战国 71 nt
+交战图 3 n
+交战状态 3 l
+交房 3 n
+交手 204 n
+交托 15 n
+交投 61 j
+交拜 3 v
+交换 3579 v
+交换代数 3 l
+交换价值 201 l
+交换台 3 n
+交换器 5 n
+交换图表 3 l
+交换子 3 n
+交换式 3 n
+交换律 3 n
+交换意见 3 l
+交换所 28 j
+交换排列 3 l
+交换文件 9 l
+交换机 129 n
+交换李群 3 n
+交换条件 3 l
+交换法 3 n
+交换电流 3 n
+交换网 6 n
+交换装置 2 n
+交换量 4 n
+交接 317 v
+交接仪式 3 n
+交接处 28 n
+交接点 4 n
+交接班 6 n
+交接班制 3 n
+交收 14 v
+交易 4060 n
+交易中心 5 nt
+交易价格 3 n
+交易会 232 nt
+交易员 33 n
+交易品 3 n
+交易商 20 n
+交易市场 5 n
+交易师 3 n
+交易平台 3 n
+交易成本 3 n
+交易所 613 nt
+交易方式 6 n
+交易日 466 n
+交易权 2 n
+交易法 7 n
+交易税 8 n
+交易类型 3 n
+交易系统 3 n
+交易网 3 n
+交易者 16 n
+交易规则 3 n
+交易过程 3 n
+交易量 46 n
+交易额 48 n
+交映 7 v
+交替 937 v
+交替法 3 n
+交朋友 115 n
+交朋结友 3 n
+交权 3 n
+交来 3 v
+交杯 3 n
+交杯酒 29 n
+交梨火枣 3 n
+交椅 138 n
+交欢 20 v
+交款 33 n
+交汇 414 n
+交汇处 90 nt
+交汇点 28 n
+交沙霉素 3 n
+交河 36 n
+交河城 8 ns
+交法 2 n
+交泰 29 nz
+交活 3 vn
+交流 5027 n
+交流中心 3 l
+交流会 107 n
+交流体会 3 n
+交流信息 3 n
+交流史 36 n
+交流学习 3 n
+交流干扰 3 l
+交流平台 3 n
+交流式 10 n
+交流心得 3 l
+交流思想 3 n
+交流活动 3 l
+交流电 106 n
+交流电力 3 n
+交流电法 3 n
+交流电源 3 n
+交流电路 3 n
+交流经验 3 n
+交流腐蚀 3 n
+交浅言深 2 l
+交涉 1014 v
+交淡 3 v
+交淡若水 3 i
+交清 3 v
+交游 54 n
+交游广阔 3 i
+交溃 3 v
+交火 19 n
+交点 95 n
+交班 7 n
+交用 3 n
+交由 192 n
+交电 3 j
+交界 569 n
+交界地 6 n
+交界处 518 n
+交界线 9 n
+交界面 12 n
+交瘁 3 v
+交白卷 8 n
+交直流 3 n
+交相 44 n
+交相辉映 72 i
+交租 3 n
+交租金 3 n
+交移 3 v
+交税 35 n
+交稿 3 n
+交管 18 n
+交管局 28 nt
+交管部门 3 n
+交粮 8 n
+交纳 479 v
+交织 374 n
+交织成 3 n
+交织着 3 l
+交结 61 v
+交给 3204 v
+交缠 7 v
+交联 89 j
+交联凝胶 3 n
+交联剂 6 n
+交联基 3 n
+交联密度 3 n
+交联指数 3 n
+交联网络 3 n
+交能易作 3 n
+交臂 3 n
+交臂历指 3 n
+交臂失之 5 i
+交臂相失 3 i
+交融 121 n
+交行 74 v
+交角 37 n
+交角券 3 n
+交警 280 j
+交警大队 3 nt
+交警支队 3 n
+交警车管所 3 nt
+交警部门 3 n
+交警队 7 nt
+交谈 909 v
+交谈服务 3 n
+交谈起来 3 l
+交谊 32 n
+交谊会 3 nt
+交谊厅 3 nt
+交谊舞 6 n
+交账 9 n
+交货 432 n
+交货付现 3 l
+交货值 261 l
+交货单 3 n
+交货期 3 n
+交货港 3 n
+交费 77 vn
+交费用 3 n
+交足 3 v
+交趾 50 n
+交辉 3 n
+交辉相映 3 i
+交过 3 v
+交过去 3 l
+交过来 3 l
+交运 12 n
+交还 222 v
+交还给 3 i
+交进 3 v
+交迫 3 v
+交送 3 v
+交通 10908 n
+交通不便 3 l
+交通业 4 n
+交通中枢 3 l
+交通事故 49 n
+交通信号 4 n
+交通卡 3 n
+交通厅 19 nt
+交通史 31 n
+交通员 143 n
+交通图 14 n
+交通地图 3 n
+交通堵塞 3 n
+交通壕 41 n
+交通委 7 nt
+交通安全 3 l
+交通局 44 nt
+交通岗 4 n
+交通岛 3 n
+交通工具 234 l
+交通干道 3 n
+交通广播 3 l
+交通建筑 3 l
+交通拥堵 3 i
+交通指挥 3 n
+交通条件 3 n
+交通枢纽 3 l
+交通标志 10 n
+交通民警 3 n
+交通法庭 3 nt
+交通法规 3 n
+交通流 2 n
+交通流量 3 n
+交通渠化 3 n
+交通灯 4 n
+交通状况 3 n
+交通秩序 3 nz
+交通站 9 n
+交通管制 11 n
+交通管理 115 n
+交通系统 11 l
+交通线 84 n
+交通线路 3 n
+交通网 61 n
+交通网络 2 n
+交通肇事 3 nz
+交通船 8 n
+交通艇 6 n
+交通要道 3 l
+交通规则 3 n
+交通警 3 n
+交通警察 8 n
+交通设备 3 n
+交通设施 3 n
+交通费 40 n
+交通路线 3 n
+交通车 5 n
+交通运输 44 j
+交通运输业 140 n
+交通违章 33 i
+交通部 182 nt
+交通部长 13 n
+交通部门 26 n
+交通量 32 n
+交通银行 125 nt
+交通阻塞 3 n
+交道 61 n
+交道口 5 n
+交邮 3 vn
+交配 525 vn
+交配季节 3 n
+交钱 116 n
+交锋 568 n
+交错 695 v
+交错代数 3 n
+交错切口 3 l
+交错化子 3 n
+交错带 8 n
+交错法 3 n
+交际 206 n
+交际圈 6 n
+交际处长 3 v
+交际性 3 n
+交际舞 3 n
+交际花 24 n
+交际费 2 n
+交际赛 3 n
+交集 151 v
+交颈并头 3 n
+交风 3 n
+交验 3 n
+交齐 3 v
+亥 195 t
+亥时 3 t
+亥猪 3 t
+亥豕相望 3 nz
+亥豕鲁鱼 3 nz
+亦 9343 d
+亦不例外 3 vn
+亦不得 3 v
+亦且 3 nr
+亦佳 3 nr
+亦可 409 v
+亦可覆舟 3 i
+亦喜亦忧 4 i
+亦复如是 3 i
+亦对于 3 v
+亦工亦农 3 nr
+亦师亦友 2 nr
+亦庄 9 nr
+亦庄亦谐 5 nr
+亦应如此 3 i
+亦无不可 3 i
+亦正亦邪 3 nr
+亦步亦趋 38 i
+亦然 104 nr
+亦能覆舟 3 i
+亦趋亦步 3 nr
+亦需 3 v
+亦非 3 v
+亦非台 3 nr
+亦须 3 v
+产 6838 n
+产下 59 n
+产业 8756 n
+产业化 1261 n
+产业区 8 n
+产业协会 3 n
+产业后备 3 n
+产业园 276 n
+产业基地 3 n
+产业工人 169 n
+产业布局 3 n
+产业带 5 n
+产业性 2 n
+产业政策 3 n
+产业界 38 n
+产业省 17 n
+产业结构 3 n
+产业群 8 n
+产业群体 3 n
+产业资本 330 n
+产业部 3 n
+产业部门 109 n
+产业链 256 n
+产业革命 43 n
+产中 3 j
+产乳 3 n
+产乳汁 3 n
+产乳量 3 n
+产于 786 v
+产从 3 v
+产仔 3 n
+产仔数 3 n
+产供销 17 l
+产值 3813 n
+产假 21 n
+产儿 9 n
+产出 396 v
+产出率 11 n
+产出量 7 n
+产前 3 t
+产前检查 3 n
+产前诊断 3 l
+产加销 3 n
+产区 861 n
+产卵 1634 v
+产卵器 3 n
+产卵场 11 n
+产卵期 3 n
+产卵洄游 3 l
+产后 16 n
+产后检查 3 n
+产品 22801 n
+产品产量 3 n
+产品代理 3 n
+产品价格 13 n
+产品出口 3 n
+产品包装 2 n
+产品化 13 n
+产品升级 3 n
+产品名 11 n
+产品名称 3 n
+产品品种 3 n
+产品品质 3 n
+产品商情 3 n
+产品图片 3 n
+产品型号 3 n
+产品安全 8 n
+产品展销 3 l
+产品库 3 n
+产品开发 7 l
+产品成本 2 l
+产品报价 3 n
+产品推介 3 n
+产品描述 3 n
+产品数量 3 n
+产品检验 3 n
+产品目录 3 n
+产品种类 2 n
+产品税 4 n
+产品策划 3 n
+产品简介 3 l
+产品类别 3 n
+产品约 12 n
+产品线 79 n
+产品组 4 n
+产品组合 3 n
+产品编号 3 n
+产品规格 3 n
+产品认证 3 n
+产品设计 53 n
+产品质量 28 n
+产品质量法 14 n
+产品软件 3 l
+产品部 15 n
+产品链 6 n
+产品销售 10 j
+产地 984 n
+产地证 3 j
+产地证明 3 n
+产奶量 9 n
+产妇 423 n
+产婆 9 n
+产子 8 n
+产学研 52 n
+产宝石 3 n
+产床 3 n
+产成品 3 n
+产房 45 n
+产期 22 n
+产权 625 n
+产权交易 3 n
+产权保护 5 n
+产权制度 3 n
+产权处 2 n
+产权局 3 n
+产权法 9 n
+产权证 2 j
+产权酒店 3 n
+产棉区 27 n
+产棉省 2 n
+产气菌 3 n
+产氢菌 3 n
+产水量 3 n
+产沙率 3 n
+产沙量 3 n
+产油 3 n
+产油国 81 n
+产油量 14 n
+产流 3 n
+产煤区 11 n
+产物 1628 n
+产物保险 3 n
+产状 64 n
+产生 19495 n
+产生共鸣 3 l
+产生分歧 3 n
+产生器 10 n
+产生式系统 2 l
+产生矛盾 3 l
+产生算符 3 n
+产生纠纷 3 z
+产生误会 3 l
+产生误解 3 l
+产甲烷 3 n
+产甲烷菌 3 n
+产界 3 n
+产科 43 n
+产科医生 3 n
+产科医院 3 n
+产科病人 3 n
+产科病房 3 n
+产程 3 n
+产米 3 n
+产米地 3 n
+产粮 31 j
+产粮区 24 n
+产经 115 n
+产经新闻 3 n
+产羔 2 n
+产羔率 2 n
+产者 8 n
+产能 533 v
+产自 3 v
+产色细菌 3 n
+产茧量 5 n
+产茶 3 n
+产茶地 3 n
+产草量 13 n
+产莲区 3 n
+产蛋率 4 n
+产蛋鸡 3 n
+产褥 3 n
+产褥期 16 n
+产褥热 2 n
+产道 49 n
+产量 5358 n
+产量模式 3 l
+产量比 14 n
+产钳 3 n
+产销 143 v
+产销两旺 3 l
+产销区 2 n
+产销合一 3 n
+产销合同 3 n
+产销地 3 n
+产销率 289 n
+产销者 3 n
+产销量 20 n
+产门 3 n
+产院 3 n
+产险 4 n
+产额 3 n
+亨 517 nrt
+亨伯 8 nrt
+亨克尔 14 nrt
+亨利 503 nrt
+亨利四世 3 nr
+亨嘉之会 3 nr
+亨廷顿 29 nr
+亨得利 3 nrt
+亨德 2 nrt
+亨德利 3 nrt
+亨德尔 17 nrt
+亨德森 6 nrt
+亨曼 4 nrt
+亨根 20 nrt
+亨森 2 nrt
+亨特 353 nrt
+亨莱因 2 nrt
+亨蒂迪 4 nrt
+亨通 8 nrt
+亩 2726 q
+亩产 89 vn
+亩产值 3 n
+亩产量 9 n
+亩数 3 n
+享 840 v
+享之千金 3 l
+享乐 155 v
+享乐主义 19 l
+享享福 5 l
+享利洛生 3 ns
+享受 2791 v
+享受在后 3 l
+享受型 5 n
+享受性 15 n
+享国 3 ns
+享堂 8 v
+享寿 3 v
+享尽 3 v
+享帚自珍 3 n
+享年 71 v
+享有 2766 v
+享有声誉 3 l
+享有盛名 3 l
+享有盛誉 46 l
+享有者 3 n
+享服 3 v
+享清福 28 l
+享用 489 v
+享福 96 v
+享誉 158 v
+享誉中外 3 n
+京 6583 ns
+京东 70 ns
+京东八号 2 nz
+京东方 32 nz
+京丰 3 nz
+京九 31 nz
+京九一 2 nz
+京九线 269 nz
+京九铁路 283 nz
+京二胡 3 n
+京价 2 nz
+京兆 110 nz
+京兆尹 149 nz
+京兆画眉 3 n
+京剧 820 n
+京剧团 47 nt
+京剧学 5 nt
+京剧界 6 n
+京剧迷 3 nz
+京剧院 20 nt
+京剧院团 2 nt
+京包线 3 nz
+京华 79 nz
+京华春梦 3 nz
+京南 27 ns
+京口 3 ns
+京口区 3 ns
+京叭 3 nz
+京味 10 nz
+京哈 3 nz
+京哈线 4 nz
+京哈铁路 2 nz
+京城 2105 ns
+京城俱乐部 2 nt
+京大戟 3 n
+京官 131 n
+京客隆 3 nz
+京山 293 ns
+京山县 521 ns
+京山市 3 ns
+京山线 5 nz
+京市 2 ns
+京师 947 n
+京师大学堂 52 nt
+京师大学堂师范馆 2 nt
+京广 267 nz
+京广中心 128 nt
+京广桥 3 nz
+京广线 561 nz
+京广铁路 593 nz
+京府 3 n
+京戏 36 n
+京户 3 n
+京房 11 n
+京报 131 nz
+京报网 3 nz
+京政发 3 nz
+京文 2 nz
+京族 294 nz
+京昆 2 ns
+京朝 2 n
+京本政树 3 n
+京杭 3 ns
+京杭大运河 24 nz
+京杭运河 155 nz
+京棉 3 ns
+京求 9 n
+京汉 426 ns
+京汉铁路 3 nz
+京沪 160 j
+京沪线 18 nz
+京沪铁路 125 nz
+京沪高速铁路 61 nz
+京油子 3 n
+京治 2 nz
+京洛 2 ns
+京津 72 ns
+京津冀 36 n
+京津唐 3 nz
+京津地区 31 ns
+京津塘 3 ns
+京津塘高速公路 9 nz
+京津沪 2 nz
+京派 8 n
+京海 3 ns
+京片子 3 nz
+京珠 3 nz
+京瓷 10 nz
+京瓷公司 3 n
+京瓷振华 3 n
+京畿 102 nz
+京畿道 10 ns
+京白 3 ns
+京白梨 3 ns
+京石高速公路 2 nz
+京福高速 3 nz
+京秦线 6 nz
+京胡 16 n
+京腔 34 n
+京药监 3 n
+京菜 2 n
+京西 325 ns
+京西宾馆 3 ns
+京调 3 nz
+京谷 3 ns
+京郊 111 ns
+京都 303 ns
+京都大学 28 nt
+京都市 5 ns
+京都府 5 nt
+京野琴美 3 ns
+京门 16 ns
+京韵 9 n
+京韵大鼓 32 nz
+京顺路 3 ns
+京骨 3 n
+亭 2829 ng
+亭亭 3 n
+亭亭玉立 34 i
+亭午 3 n
+亭台 19 n
+亭台楼榭 2 i
+亭台楼阁 46 n
+亭子 232 n
+亭子间 39 n
+亭桥 3 n
+亭榭 17 n
+亭榭画廊 3 ns
+亭湖区 3 n
+亭长 18 n
+亮 4307 v
+亮丑 3 n
+亮丽 380 a
+亮亮堂堂 4 z
+亮亮的 26 z
+亮儿 3 n
+亮光 197 n
+亮光光 3 n
+亮光漆 3 z
+亮出 126 v
+亮分 3 n
+亮到 3 v
+亮化 36 v
+亮堂 27 n
+亮堂堂 17 z
+亮子 3 n
+亮家伙 3 n
+亮底 3 n
+亮底牌 4 n
+亮度 221 n
+亮度对比 3 n
+亮度比 2 n
+亮度计 3 n
+亮度高 2 n
+亮晃晃 12 z
+亮晶晶 102 z
+亮暗比 3 n
+亮氨酸 5 n
+亮泽 2 n
+亮灯 2 n
+亮点 353 n
+亮片 7 n
+亮牌 3 n
+亮相 656 n
+亮眼 5 n
+亮眼人 3 n
+亮票 3 n
+亮红灯 3 n
+亮线 3 n
+亮绿 3 z
+亮色 27 n
+亮节 3 n
+亮节高风 3 n
+亮话 3 n
+亮起 3 v
+亮铮铮 3 l
+亮银色 3 n
+亮闪闪 24 z
+亯 668 zg
+亰 17 zg
+亱 23 zg
+亲 10670 v
+亲丁 4 n
+亲上做亲 3 l
+亲上加亲 8 n
+亲上成亲 3 l
+亲不亲 3 l
+亲临 405 v
+亲临一线 3 l
+亲临其境 2 i
+亲临指导 3 n
+亲临现场 3 n
+亲事 201 n
+亲交 3 n
+亲亲 3 n
+亲亲热热 50 z
+亲亲爱爱 3 l
+亲亲的 2 z
+亲人 1012 n
+亲人或 3 l
+亲仁善邻 3 i
+亲代 64 n
+亲任 3 n
+亲体 22 n
+亲信 914 n
+亲儿子 3 n
+亲兄妹 3 n
+亲兄弟 114 n
+亲兄弟明 3 n
+亲兵 1877 n
+亲冒矢石 7 i
+亲切 1104 a
+亲切友好 3 l
+亲切感 30 n
+亲切服务 3 l
+亲力亲为 14 l
+亲华人士 3 n
+亲历 85 n
+亲历其境 3 l
+亲历者 7 n
+亲历记 3 n
+亲友 378 n
+亲友们 3 n
+亲友团 3 n
+亲口 263 n
+亲口答应 3 n
+亲口说 3 n
+亲合 4 v
+亲合力 5 n
+亲合性 2 n
+亲启 3 v
+亲吻 169 n
+亲和力 108 n
+亲和层析 3 l
+亲和性 17 n
+亲和柱 3 n
+亲哥哥 3 n
+亲善 29 v
+亲善大使 3 i
+亲善访问 3 l
+亲嘴 36 n
+亲处 3 d
+亲多 3 d
+亲夫 3 n
+亲如一家 2 l
+亲如兄弟 3 l
+亲如家人 3 l
+亲如手足 11 i
+亲如骨肉 3 l
+亲妈 3 n
+亲姆 3 n
+亲姊妹 3 n
+亲姊姊 3 n
+亲姐妹 17 n
+亲姐姐 3 n
+亲威 3 n
+亲娘 72 n
+亲子 90 n
+亲子关系 3 l
+亲子园 3 n
+亲子活动 3 l
+亲子装 3 n
+亲子鉴定 3 n
+亲家 224 n
+亲家公 3 n
+亲家庭 3 n
+亲家母 24 n
+亲家翁 3 n
+亲密 653 a
+亲密关系 3 n
+亲密合作 3 n
+亲密性 3 n
+亲密无间 45 i
+亲展 3 v
+亲属 721 n
+亲属关系 3 l
+亲属制度 3 n
+亲属称谓 3 l
+亲师 3 n
+亲弟兄 3 n
+亲当矢石 3 i
+亲往 3 d
+亲征 775 n
+亲情 289 n
+亲戚 1254 n
+亲戚关系 3 n
+亲戚家 51 n
+亲戚朋友 3 n
+亲手 747 d
+亲手做 3 i
+亲抚 3 n
+亲授 3 n
+亲操井臼 3 n
+亲收 3 v
+亲政 289 n
+亲故 3 n
+亲族 58 n
+亲日 3 n
+亲日派 199 n
+亲昵 157 a
+亲昵性 3 vn
+亲朋 82 n
+亲朋好友 123 l
+亲本 70 n
+亲权 3 n
+亲核反应 3 l
+亲母 3 n
+亲民党 46 n
+亲水 21 n
+亲水性 15 n
+亲洽 3 v
+亲潮 7 n
+亲热 560 a
+亲热戏 3 n
+亲爱 443 a
+亲爱精诚 3 n
+亲父 3 n
+亲爹 3 n
+亲率 214 n
+亲王 1384 n
+亲生 503 n
+亲生儿 3 n
+亲生女 3 n
+亲生女儿 3 n
+亲生子女 3 n
+亲生父母 3 n
+亲生骨肉 3 n
+亲电取代 3 n
+亲电重排 3 n
+亲疏 74 a
+亲疏贵贱 3 i
+亲痛仇快 3 i
+亲眷 35 n
+亲眼 881 d
+亲眼所见 3 l
+亲眼目睹 199 l
+亲眼看到 3 l
+亲眼看见 3 l
+亲眼见到 3 l
+亲睦 2 a
+亲睹 13 v
+亲知 6 n
+亲离众叛 3 i
+亲笔 252 n
+亲笔信 30 n
+亲笔写 3 n
+亲笔文件 3 n
+亲笔签名 3 n
+亲缘 120 n
+亲者痛 3 n
+亲耳 69 d
+亲耳所闻 3 i
+亲职 3 n
+亲职教育 3 l
+亲脂性 3 n
+亲脸 3 d
+亲自 5315 d
+亲自出马 3 i
+亲自动手 3 n
+亲自参加 3 l
+亲英派 4 n
+亲见 115 n
+亲见亲闻 2 i
+亲贤人远 3 l
+亲贵 3 a
+亲赴 3 v
+亲身 562 n
+亲身经历 3 n
+亲身经验 3 n
+亲迎 3 v
+亲近 549 d
+亲近感 19 n
+亲逾手足 3 i
+亲闻 8 n
+亲随 3 v
+亲驾 3 n
+亲骨肉 39 n
+亳 82 ns
+亳县 3 ns
+亳州 62 ns
+亳州市 12 ns
+亴 86 zg
+亵 114 zg
+亵慢 3 v
+亵渎 163 v
+亵渎神明 3 z
+亵玩 3 v
+亵臣 3 v
+亵衣 3 v
+亶 79 zg
+亷 9 zg
+亸 425 zg
+亹 63 zg
+亹亹不倦 3 v
+人 313209 n
+人一己百 3 nz
+人丁 140 n
+人丁兴旺 17 ns
+人丁旺盛 3 l
+人上有人 3 n
+人不为己 4 i
+人不可貌 3 i
+人不知 149 l
+人不知鬼 3 i
+人不聊生 3 i
+人不自安 3 i
+人与狗 3 n
+人与自然 3 i
+人与车 3 n
+人世 364 n
+人世沧桑 6 i
+人世间 112 n
+人丛 241 n
+人中之龙 3 i
+人中狮子 3 n
+人中豪杰 3 l
+人中骐骥 3 nr
+人中龙虎 3 nz
+人为 1829 n
+人为万物 3 l
+人为刀俎 5 i
+人为因素 3 l
+人为失误 3 i
+人为财死 3 i
+人主 3 n
+人之初 3 l
+人之将死 3 i
+人之常情 58 l
+人之长情 3 n
+人事 1338 n
+人事不省 15 i
+人事不知 49 l
+人事不醒 3 l
+人事主管 3 n
+人事代理 3 n
+人事代谢 3 i
+人事全非 3 i
+人事关系 3 l
+人事制度 3 n
+人事厅 29 n
+人事变动 3 l
+人事司 3 n
+人事处 31 n
+人事安排 3 nt
+人事室 3 n
+人事局 64 n
+人事工作 3 n
+人事权 4 n
+人事档案 3 l
+人事监察 3 n
+人事科 5 n
+人事管理 3 n
+人事网 3 n
+人事行政 3 n
+人事部 185 n
+人事部人事考试中心 9 l
+人事部门 102 n
+人云 3 n
+人云亦云 32 i
+人亡家破 3 i
+人亡政息 8 n
+人亡物在 2 n
+人亡邦瘁 3 i
+人人 2713 n
+人人为师 3 i
+人人为我 3 i
+人人乐 3 n
+人人喊打 12 i
+人人平等 3 l
+人人得而 3 l
+人人有则 3 n
+人人有责 3 l
+人人爱 3 l
+人人皆知 60 i
+人人自危 44 i
+人人过关 3 l
+人代 3 n
+人代会 285 n
+人代大会 3 nt
+人以群分 21 l
+人们 24841 n
+人仰马翻 26 i
+人份 8 n
+人众 3 n
+人众胜天 3 i
+人伦 61 n
+人伦关系 3 nt
+人体 3316 n
+人体器官 3 l
+人体实验 3 l
+人体工学 3 nt
+人体彩绘 3 n
+人体摄影 3 n
+人体模型 3 n
+人体模特 3 n
+人体漫游 3 n
+人体炸弹 3 n
+人体生理 3 n
+人体科学 3 nt
+人体素描 3 n
+人体美 3 n
+人体舒适 3 n
+人体艺术 3 n
+人保公司 3 n
+人偶 28 n
+人像卡 3 n
+人像画 3 n
+人像靶 3 n
+人儿 162 n
+人兽交 3 i
+人别 31 n
+人到中年 3 l
+人前人后 3 l
+人剥削人 3 vn
+人力 2134 n
+人力不足 3 i
+人力物力 3 n
+人力资本 3 l
+人力资源 3 n
+人力资源部 242 nt
+人力车 39 n
+人化 16 n
+人千人万 3 i
+人单势孤 3 l
+人厨子 3 v
+人去楼空 32 i
+人参 347 n
+人参果 29 n
+人参精 3 n
+人参芦 3 n
+人参酒 3 n
+人取我与 3 i
+人口 23243 n
+人口不足 3 i
+人口众多 3 l
+人口减少 3 i
+人口危机 3 l
+人口压力 3 n
+人口地理 3 n
+人口基数 3 n
+人口增殖 3 l
+人口学 38 nt
+人口学家 5 n
+人口密度 3 n
+人口平衡 3 i
+人口总数 3 n
+人口数 1580 n
+人口数量 3 n
+人口断层 3 n
+人口普查 3 n
+人口构成 3 n
+人口比例 3 n
+人口爆炸 3 n
+人口稠密 3 n
+人口素质 3 n
+人口统计 3 n
+人口老化 3 n
+人口老龄化 21 n
+人口规划 3 n
+人口论 21 n
+人口质量 3 n
+人口贩子 3 n
+人口迁移 3 n
+人口过剩 3 l
+人口过密 3 n
+人口预测 3 l
+人吃人 3 n
+人各有志 28 l
+人同此心 14 l
+人名 78 n
+人名册 128 n
+人名医院 3 n
+人名录 3 n
+人员 19810 n
+人员不足 3 i
+人员伤亡 3 n
+人员名单 3 n
+人员培训 3 n
+人员构成 3 n
+人员测评 3 n
+人员素质 3 n
+人员编制 3 n
+人员选拔 3 n
+人员配备 3 n
+人味 13 n
+人味儿 3 n
+人命 200 n
+人命关天 20 l
+人命危浅 3 l
+人命官司 3 n
+人和事 3 n
+人和镇 2 n
+人品 442 n
+人品出众 3 nt
+人品问题 3 n
+人商 3 n
+人喊马嘶 22 i
+人困马乏 42 i
+人在何处 3 l
+人在何方 3 n
+人在旅途 3 n
+人在曹营心在汉 2 i
+人在江湖 3 l
+人地 3 n
+人地关系 3 l
+人地生疏 16 n
+人均 3051 j
+人均产值 3 l
+人均指标 3 n
+人均收入 152 n
+人堆 3 n
+人墙 37 n
+人士 5774 n
+人士处 17 n
+人声 281 n
+人声吵杂 3 l
+人声嘈杂 3 z
+人声鼎沸 71 i
+人外有人 3 l
+人多势众 137 i
+人多口杂 10 i
+人多嘴杂 10 i
+人多地少 3 l
+人多怪少 3 l
+人多手杂 6 i
+人多阙少 3 v
+人大 12955 j
+人大主任 3 n
+人大代表 5284 nz
+人大会堂 3 nt
+人大常委会 4544 nt
+人大常委会法工委 2 nt
+人大网 3 nz
+人大附中 23 nz
+人夫 38 n
+人头 402 n
+人头像 4 n
+人头攒动 54 l
+人头熟 4 l
+人头猪脑 3 n
+人头畜鸣 3 i
+人头税 3 n
+人头费 18 n
+人头马 6 n
+人头骨 24 n
+人如潮涌 4 l
+人妖 33 n
+人子 20 n
+人字 3 n
+人字形 11 n
+人字拖 3 l
+人字架 3 n
+人存政举 3 l
+人学 558 n
+人定 3 n
+人定胜天 19 n
+人家 8314 n
+人寰 3 n
+人寿 124 n
+人寿保险 81 n
+人寿年丰 2 l
+人小气大 3 l
+人小鬼大 3 l
+人尖子 5 n
+人尽其才 23 i
+人尽其材 3 i
+人尽可夫 3 i
+人尽皆知 3 i
+人居 71 n
+人居奖 3 nz
+人山人海 99 ns
+人工 2816 n
+人工免疫 2 l
+人工关节 3 l
+人工制品 3 n
+人工化 8 n
+人工受孕 3 n
+人工合成 3 l
+人工呼吸 69 l
+人工地貌 3 n
+人工基 3 n
+人工孵化 3 vn
+人工岛 26 n
+人工工资 3 l
+人工干预 3 l
+人工录入 3 n
+人工心脏 3 n
+人工成本 3 l
+人工授粉 3 l
+人工授精 68 l
+人工控制 30 n
+人工效率 3 n
+人工整理 3 n
+人工智慧 3 l
+人工智能 151 n
+人工林 34 n
+人工模拟 3 i
+人工河 9 n
+人工流产 66 l
+人工混响 3 l
+人工港 18 n
+人工湖 309 n
+人工牙 3 n
+人工牙列 3 n
+人工甘味 3 l
+人工生命 3 l
+人工神经网络 13 n
+人工繁殖 3 l
+人工费 3 n
+人工降雨 17 n
+人差方程 3 l
+人己一视 3 l
+人师 3 n
+人平 16 n
+人弃我取 3 l
+人强胜天 3 i
+人强马壮 11 i
+人形 257 n
+人形师 3 n
+人影 704 n
+人影儿 25 n
+人影憧憧 4 l
+人微望轻 3 i
+人微权轻 3 i
+人微言贱 3 l
+人微言轻 24 i
+人心 1440 n
+人心不古 11 i
+人心不同 3 i
+人心不足蛇吞象 5 i
+人心丧尽 3 i
+人心叵测 2 i
+人心向背 12 i
+人心大快 13 i
+人心如面 3 l
+人心归向 3 i
+人心思变 9 i
+人心思汉 3 n
+人心思治 3 n
+人心悦诚服 9 i
+人心惟危 3 i
+人心惶惶 93 i
+人心所向 16 i
+人心所归 3 i
+人心果 2 n
+人心果李 3 n
+人心浮动 32 l
+人心涣散 26 i
+人心皇皇 3 i
+人心神 14 n
+人心莫测 3 i
+人心隔肚皮 8 l
+人心难测 15 i
+人心齐 3 i
+人怕出名猪怕壮 4 i
+人急偎亲 3 i
+人急智生 4 i
+人急计生 3 i
+人性 897 n
+人性化 128 n
+人性尊严 3 l
+人性本善 3 l
+人性本恶 3 n
+人性美 2 n
+人性论 53 n
+人怨天怒 3 i
+人怨神怒 3 i
+人情 447 n
+人情世态 14 n
+人情世故 41 i
+人情之常 11 i
+人情事故 3 n
+人情债 14 n
+人情冷暖 8 i
+人情化 2 n
+人情味 67 n
+人情味儿 5 n
+人情恟恟 3 v
+人情案 2 n
+人情汹汹 3 i
+人情电 3 n
+人意 58 n
+人愧 3 d
+人愿 29 n
+人我不分 3 l
+人我是非 3 l
+人所共知 54 i
+人所共见 3 l
+人手 393 n
+人手一册 8 l
+人手不足 3 i
+人才 8742 n
+人才中介 3 n
+人才交流 3 i
+人才出众 6 i
+人才培养 3 l
+人才外流 5 i
+人才学 9 n
+人才库 19 n
+人才思想 3 i
+人才流 2 n
+人才流动 3 i
+人才流失 3 i
+人才济济 38 n
+人才热线 3 n
+人才网 3 n
+人才观 57 n
+人才资源 3 n
+人才辈出 23 i
+人才队伍 3 n
+人才难得 7 i
+人才需求 3 n
+人托人 3 n
+人挪活 2 i
+人教版 3 n
+人教社 3 nt
+人数 8857 n
+人文 1046 n
+人文主义 117 n
+人文主义者 23 n
+人文地理 3 n
+人文大学 3 nt
+人文奥运 3 nz
+人文学科 18 nz
+人文学院 3 nt
+人文景观 3 n
+人文涵养 3 n
+人文环境 3 l
+人文科学 124 nt
+人文精神 3 n
+人文荟萃 14 i
+人无千日 3 i
+人无完人 9 l
+人无远虑 8 i
+人是衣妆 3 n
+人有千算 3 l
+人有旦夕 3 i
+人有旦夕祸福 10 i
+人本 148 n
+人本主义 55 n
+人机 113 n
+人机一体 3 l
+人机交互 26 v
+人机对话 11 l
+人机工程 3 l
+人机接口 8 n
+人机环境 2 l
+人机界面 19 n
+人机系统 7 l
+人权 401 n
+人权主义 3 n
+人权会 3 n
+人权委员会 3 nt
+人权学 3 n
+人权宣言 3 l
+人权思想 3 n
+人权意识 3 l
+人权法 3 n
+人权观 3 n
+人权记录 3 n
+人材 50 n
+人材出众 3 n
+人材外流 3 n
+人来人往 83 i
+人来客去 3 l
+人来客往 3 l
+人来疯 14 l
+人杰 35 n
+人杰地灵 272 i
+人极 3 n
+人极计生 3 n
+人样 3 n
+人样儿 3 l
+人格 1012 n
+人格保证 3 n
+人格健全 3 nz
+人格分裂 3 i
+人格化 53 n
+人格尊严 3 i
+人格担保 3 n
+人格教育 3 l
+人格权 7 n
+人格特质 3 nz
+人格理论 3 n
+人格类型 3 n
+人格结构 3 n
+人格解体 3 nt
+人格障碍 3 n
+人格魅力 3 i
+人梯 16 n
+人模人样 3 l
+人模狗样 3 i
+人次 575 n
+人欢马叫 8 i
+人欲横流 3 i
+人武 41 n
+人武惟扬 3 i
+人武部 39 n
+人死留名 3 n
+人母 17 n
+人比人 3 n
+人比怪多 3 l
+人氏 216 n
+人民 43719 n
+人民之声 3 l
+人民代表 106 n
+人民代表大会 25030 nt
+人民代表大会常务委员会 7713 nt
+人民保险 3 n
+人民党 171 nt
+人民公仆 3 n
+人民公社 1813 nt
+人民公社化 104 nt
+人民共和国 295 nt
+人民军 107 nt
+人民军队 654 nt
+人民出版社 86 nt
+人民剧场 5 n
+人民卫生出版社 3 nt
+人民商场 2 n
+人民团体 575 n
+人民城郭 3 n
+人民大众 3 nt
+人民大会堂 1196 nt
+人民大学 42 nt
+人民富足 3 i
+人民币 2968 n
+人民广场 143 n
+人民性 25 n
+人民意志 3 n
+人民战争 192 nz
+人民报 23 n
+人民政协 333 nt
+人民政府 15227 nt
+人民政权 41 n
+人民教育出版社 17 nt
+人民文学出版社 48 nt
+人民日报 1087 nz
+人民日报社 67 nt
+人民检察院 577 nt
+人民武装 302 n
+人民武装警察部队 5 nt
+人民民主党 20 nt
+人民法庭 3 nt
+人民法院 6465 nt
+人民满意 3 l
+人民网 413 n
+人民美术出版社 8 nt
+人民英雄纪念碑 825 nz
+人民解放军 1492 nt
+人民解放军总部 150 nt
+人民解放战争 537 nz
+人民警察 49 n
+人民调解 3 l
+人民起义 3 l
+人民邮电 3 nz
+人民邮电出版社 5 nt
+人民银行 53 nt
+人民阵线 3 l
+人民院 6 nt
+人民陪审员 4 n
+人民音乐出版社 4 nt
+人气 425 n
+人气值 3 n
+人气儿 2 n
+人气度 3 n
+人气指标 3 n
+人气旺盛 3 l
+人治 34 n
+人流 268 n
+人流量 23 n
+人浪 3 n
+人浮于世 3 l
+人浮于事 29 l
+人浮于食 3 l
+人海 32 n
+人海战术 20 n
+人海茫茫 3 l
+人涉卬否 3 n
+人淡如菊 3 i
+人渣 3 n
+人溺己溺 3 n
+人满为患 56 i
+人满之患 3 i
+人潮 42 n
+人潮如涌 3 l
+人烟 91 n
+人烟凑集 3 vn
+人烟稀少 74 l
+人烟稠密 27 n
+人物 10520 n
+人物传记 3 n
+人物史 3 n
+人物周刊 3 n
+人物图片 3 n
+人物奖 7 n
+人物属性 3 n
+人物形象 3 n
+人物志 3 n
+人物性格 3 n
+人物描写 3 n
+人物画 90 n
+人物肖像 3 i
+人物造型 3 n
+人犯 122 n
+人猿 10 n
+人猿泰山 3 i
+人理 44 n
+人琴两亡 3 l
+人琴俱亡 3 l
+人琴俱逝 3 l
+人瑞 4 nz
+人生 4255 n
+人生七十 3 i
+人生七十古来稀 3 i
+人生价值 3 l
+人生哲学 3 nt
+人生哲理 3 i
+人生在世 54 l
+人生地不熟 37 l
+人生大事 3 n
+人生如寄 3 v
+人生如朝 3 l
+人生如梦 12 l
+人生态度 3 n
+人生意义 3 l
+人生感 2 n
+人生旅途 3 n
+人生朝露 3 i
+人生权 3 n
+人生目标 3 n
+人生自古谁无死 15 i
+人生若寄 3 v
+人生观 178 n
+人生路 7 n
+人生路不熟 2 l
+人生道路 3 n
+人界篇 3 n
+人畜 3 n
+人百其身 3 i
+人皆有之 27 i
+人皮 3 n
+人眼 112 n
+人确 27 d
+人神共嫉 3 i
+人神共愤 9 l
+人神共鉴 3 i
+人神同嫉 3 v
+人祸 27 n
+人离乡贱 3 i
+人种 270 n
+人种学 14 l
+人称 485 n
+人穷志短 5 i
+人穷智短 3 i
+人算不如 3 i
+人类 9464 n
+人类史 3 n
+人类史上 3 l
+人类基因 3 n
+人类学 282 n
+人类学家 71 n
+人类学系 7 n
+人类学者 17 n
+人类文明 3 l
+人粪尿 11 n
+人精 3 n
+人约黄昏 3 i
+人给家足 3 i
+人缘 140 n
+人缘儿 2 n
+人缝 3 n
+人群 2369 n
+人老珠黄 7 n
+人老眼花 3 n
+人而无信 3 i
+人肉 3 n
+人肉市场 3 n
+人胎素 3 n
+人脉 3 n
+人脉关系 3 l
+人脑 141 n
+人脸 135 n
+人脸识别 2 n
+人臣 3 n
+人自为战 4 i
+人自为政 3 i
+人至察则无徒 4 i
+人艺 22 n
+人荒马乱 3 i
+人莫予毒 3 l
+人蛇 3 n
+人行 391 n
+人行天桥 4 n
+人行横道 7 n
+人行路 2 n
+人行道 469 n
+人要衣装 3 n
+人见人爱 3 l
+人言 3 n
+人言利博 3 l
+人言可畏 10 i
+人言啧啧 3 l
+人言籍籍 3 n
+人言藉藉 3 vn
+人论 3 n
+人证 25 j
+人证物证 3 n
+人话 3 n
+人语 3 nz
+人语马嘶 3 i
+人谋不臧 3 i
+人豪 3 n
+人财两旺 3 i
+人财两空 11 i
+人财物 21 nt
+人质 245 n
+人质事件 3 n
+人质危机 3 l
+人贩 3 n
+人贩子 58 n
+人贫智短 3 i
+人赃俱获 3 i
+人赃并获 3 i
+人走灯灭 3 i
+人走茶凉 3 i
+人足家给 3 i
+人身 1375 n
+人身事故 3 i
+人身依附 3 i
+人身保护 3 n
+人身保险 3 n
+人身安全 3 i
+人身攻击 3 i
+人身权 20 n
+人身权利 3 l
+人身自由 71 l
+人身自由权 2 l
+人身险 5 n
+人迹 226 n
+人迹罕到 3 i
+人迹罕至 78 i
+人选 1981 n
+人造 1330 n
+人造丝 32 n
+人造云母 3 n
+人造冠 3 n
+人造冰 3 n
+人造卫星 163 n
+人造地球 3 n
+人造奶油 3 n
+人造板 37 n
+人造棉 23 n
+人造橡皮 3 n
+人造橡胶 3 n
+人造毛 4 n
+人造毛皮 3 n
+人造皮 3 n
+人造石 3 n
+人造石油 8 n
+人造磁铁 5 n
+人造纤维 42 l
+人造美女 3 n
+人造肉 5 n
+人造肥料 3 l
+人造花 2 n
+人造草坪 3 n
+人造行星 2 n
+人造雨 3 n
+人造革 48 n
+人造黄油 3 n
+人逢喜事 3 i
+人逢喜事精神爽 8 i
+人道 133 n
+人道主义 351 n
+人道主义法 3 n
+人道报 10 n
+人道精神 3 n
+人部 3 n
+人间 1942 n
+人间仙境 3 n
+人间喜剧 3 n
+人间地狱 21 n
+人间天上 10 l
+人间天堂 19 n
+人间正道 3 n
+人间烟火 3 n
+人间蒸发 3 nz
+人防 32 n
+人防办 3 n
+人阵 32 n
+人际 231 n
+人际交往 3 i
+人际关系 473 l
+人际排斥 3 v
+人际服务 3 n
+人际沟通 3 nz
+人际消息 3 n
+人际网 5 n
+人际艺术 3 n
+人非土木 3 i
+人非圣贤 11 l
+人非木石 3 i
+人非物是 3 l
+人非草木 11 i
+人面 148 n
+人面像 3 n
+人面兽心 10 i
+人面桃花 28 n
+人面狗心 3 i
+人饥己饥 3 i
+人马 3354 n
+人马宫 3 n
+人马座 43 n
+人高马大 13 nz
+人鬼不分 3 l
+人鱼 43 n
+人鱼公主 3 n
+人龙 56 n
+亻 10 zg
+亻尔 3 v
+亻至刂 3 nz
+亽 3 zg
+亾 507 zg
+亿 4023 m
+亿万 389 m
+亿万个 5 m
+亿万人民 27 nz
+亿万元 2 m
+亿万家 2 m
+亿万家财 3 nz
+亿万富翁 3 n
+亿万富豪 3 nz
+亿万年 25 m
+亿万户 2 m
+亿万斯年 3 nz
+亿万群众 3 n
+亿两 7 m
+亿个 40 m
+亿九 2 m
+亿亩 15 m
+亿人次 51 m
+亿亿吨 2 m
+亿份 28 m
+亿余两 2 m
+亿余元 24 m
+亿余立方米 3 m
+亿俩 2 m
+亿倍 7 m
+亿元 15600 m
+亿兆 8 m
+亿兆一心 3 nz
+亿光年 14 m
+亿克朗 6 nz
+亿八 2 m
+亿公斤 8 m
+亿公顷 66 m
+亿兰特 5 nz
+亿册 4 m
+亿刀 8 m
+亿分 11 m
+亿分钟 3 m
+亿利 3 nz
+亿加元 6 m
+亿千克 15 m
+亿千瓦 82 m
+亿千瓦时 283 m
+亿千米 12 m
+亿发 11 m
+亿只 25 m
+亿台 9 m
+亿名 4 m
+亿吨 1135 m
+亿吨公里 3 m
+亿吨级 6 m
+亿品 2 m
+亿唐 3 nz
+亿块 3 m
+亿多 68 m
+亿多两 17 m
+亿多个 2 m
+亿多亩 3 m
+亿多人次 2 m
+亿多元 297 m
+亿多公顷 2 m
+亿多千瓦 3 m
+亿多吨 22 m
+亿多年 16 m
+亿多张 2 m
+亿多支 2 m
+亿多斤 2 m
+亿多次 2 m
+亿多立方米 14 m
+亿多线 2 m
+亿多美元 23 m
+亿多辆次 34 m
+亿头 2 m
+亿套 4 m
+亿客隆 8 nz
+亿岁 4 m
+亿左右 27 m
+亿平方米 7 m
+亿年 298 m
+亿度 81 m
+亿张 17 m
+亿户 11 m
+亿所 3 m
+亿支 12 m
+亿斤 13 m
+亿方 2 m
+亿日 13 m
+亿日元 172 m
+亿条 8 m
+亿株 257 m
+亿根 2 m
+亿桶 19 m
+亿次 28 m
+亿比索 3 m
+亿法郎 25 m
+亿测 3 n
+亿港元 54 m
+亿澳元 9 m
+亿片 23 m
+亿瓶 6 m
+亿立方米 1534 m
+亿等 6 m
+亿米 14 m
+亿粒 11 m
+亿网行 3 n
+亿美元 3217 m
+亿美金 10 m
+亿股 113 m
+亿英镑 52 m
+亿载 2 m
+亿载金城 3 nz
+亿辛万苦 3 nz
+亿邮网 3 nz
+亿部 25 m
+亿里 5 m
+亿里拉 2 nz
+亿镑 6 m
+亿阳信通 2 nz
+亿韩元 6 m
+亿页 4 m
+亿颗 2 m
+亿马克 22 m
+什 1233 r
+什一税 25 n
+什不闲儿 3 n
+什么 59317 r
+什么世道 3 z
+什么样 1849 r
+什么游戏 3 v
+什件 3 n
+什件儿 3 n
+什伍东西 3 nrt
+什切青 14 nrt
+什刹海 30 ns
+什叶 2 n
+什叶派 149 n
+什围伍攻 3 n
+什字 3 n
+什未林 2 nrt
+什物 89 r
+什科夫 27 nrt
+什维克 3 nrt
+什维利 9 nrt
+什袭以藏 3 n
+什袭珍藏 3 n
+什袭而藏 3 n
+什邡 7 ns
+什邡县 3 ns
+什邡市 3 ns
+什锦 14 n
+什锦炒面 3 n
+什锦糖 3 n
+什锦菜 3 n
+什锦锉 3 n
+什锦陷 3 n
+什锦面 3 n
+什鲁斯伯里 4 nrt
+仁 1173 ng
+仁丹 9 nr
+仁义 314 nr
+仁义之兵 3 nr
+仁义之师 33 nr
+仁义君子 2 nr
+仁义道德 58 nr
+仁人 23 n
+仁人义士 16 ns
+仁人君子 13 nr
+仁人志士 43 nr
+仁仁义 2 nr
+仁以恤民 3 n
+仁兄 566 nr
+仁公主 2 nr
+仁化 3 n
+仁化县 3 ns
+仁医 3 nr
+仁厚 65 nr
+仁同一视 3 i
+仁和 27 nr
+仁和区 3 ns
+仁和镇 4 ns
+仁天皇 6 nr
+仁学 12 n
+仁安羌 11 nr
+仁寿 70 nr
+仁寿县 3 nr
+仁寿街 3 nr
+仁川 73 ns
+仁川港 2 ns
+仁布 3 nr
+仁布县 3 ns
+仁弟 2 nr
+仁德 30 nr
+仁心 18 n
+仁心仁术 3 nr
+仁心仁闻 3 i
+仁怀 18 nr
+仁怀县 2 nr
+仁怀市 6 nr
+仁惠 2 nr
+仁意 16 n
+仁慈 203 nr
+仁慈地 3 nr
+仁慈心 3 nr
+仁政 99 nr
+仁术 3 n
+仁果 2 n
+仁柔寡断 3 i
+仁武 3 nr
+仁民爱物 3 nr
+仁波切 3 nr
+仁浆义粟 3 n
+仁济 3 n
+仁爱 58 nr
+仁爱为接 3 nr
+仁爱之心 3 nr
+仁爱医院 3 nr
+仁爱国中 3 nr
+仁爱国小 3 nr
+仁爱路 3 nr
+仁皇后 2 nr
+仁者 38 n
+仁者乐山 3 i
+仁者无敌 3 i
+仁者能仁 3 nr
+仁者见仁 23 i
+仁至义尽 32 i
+仁言利博 3 nr
+仁言利溥 3 nr
+仃 37 x
+仄 116 n
+仄仄 3 n
+仄声 12 n
+仄韵 3 n
+仅 12193 d
+仅举 3 d
+仅仅 3286 d
+仅仅只是 3 i
+仅仅如此 3 l
+仅以身免 6 l
+仅供 3 v
+仅供参考 621 l
+仅凭 3 v
+仅剩 3 v
+仅及 3 v
+仅只 41 d
+仅够 3 v
+仅存 3 v
+仅容旋马 3 i
+仅指 3 v
+仅次于 2032 d
+仅此 3 d
+仅此一次 3 l
+仅此而已 45 l
+仅管 3 v
+仅识之无 3 l
+仅足 3 v
+仅限 3 v
+仅限于 3 l
+仅靠 3 v
+仆 1135 ng
+仆人 904 n
+仆仆亟拜 3 vn
+仆仆道途 3 i
+仆仆风尘 2 i
+仆从 90 n
+仆从国 11 n
+仆佣 2 n
+仆倒 7 n
+仆其 3 n
+仆参 3 n
+仆妇 120 n
+仆役 141 n
+仆隶 3 n
+仇 1555 n
+仇世华 10 nr
+仇云波 3 nr
+仇人 472 n
+仇人相见 5 i
+仇人见面 3 n
+仇兄 2 n
+仇兆燕 2 nr
+仇兆鳌 2 nr
+仇先生 3 nr
+仇兼琼 3 nr
+仇十洲 4 nr
+仇士华 9 nr
+仇士良 15 nr
+仇子明 6 nr
+仇家 127 n
+仇富 15 nr
+仇岂可 5 nr
+仇岂非 2 nr
+仇得报 10 n
+仇必报 9 nr
+仇志海 11 nr
+仇怨 99 n
+仇总兵 4 nr
+仇恨 696 n
+仇恶 3 n
+仇报 3 n
+仇敌 152 n
+仇敏业 2 n
+仇教灭 2 nr
+仇文确 2 nr
+仇日 5 n
+仇旭东 4 nr
+仇春霖 2 nr
+仇晓光 3 nr
+仇未复 8 nr
+仇未报 12 nr
+仇杀 44 v
+仇松年 8 nr
+仇水 3 n
+仇池 14 n
+仇洋 8 n
+仇深似 24 nr
+仇由氏 2 nr
+仇真人 2 nr
+仇者 7 n
+仇者快 3 nr
+仇萌芽 16 nr
+仇视 143 n
+仇遇 3 n
+仇隙 30 n
+仇雪批复 3 n
+仈 36 zg
+仉 38 nr
+今 23913 zg
+今不如昔 6 t
+今世 62 t
+今乐 2 t
+今人 154 n
+今何在 3 i
+今儿 688 t
+今儿个 212 t
+今公子 2 nr
+今兴安 2 nr
+今冬 22 t
+今冬明春 3 t
+今古传奇 3 nr
+今古奇观 3 nr
+今古奇闻 3 i
+今古文 2 t
+今叶 2 t
+今后 3051 t
+今后任务 3 n
+今周 2 t
+今夏 58 t
+今夕 36 t
+今夕何夕 3 i
+今夜 753 t
+今大兵 2 nr
+今天 15960 t
+今天上午 3 nr
+今天下午 3 nr
+今天天气 3 i
+今子 2 t
+今宵 34 t
+今岁 3 t
+今川北 3 nr
+今年 9959 t
+今年以来 3 i
+今年冬天 3 t
+今年初 108 t
+今年夏天 3 nr
+今年年初 3 t
+今年年底 3 t
+今年底 27 t
+今年春节 3 t
+今年过年 3 i
+今德 128 t
+今愁古恨 3 i
+今文 67 t
+今文学 3 nr
+今文经学 3 n
+今日 10258 t
+今日报价 3 i
+今日有酒今日醉 2 i
+今日毕 3 nr
+今日热点 3 n
+今日焦点 3 n
+今日要闻 3 i
+今日说法 3 i
+今明 17 t
+今明两天 3 i
+今明两年 3 i
+今昔 26 t
+今昔之感 3 i
+今昔对比 3 i
+今春 62 t
+今是昔非 3 i
+今是昨非 3 nr
+今晋 2 t
+今晋南 2 nr
+今晚 1509 t
+今晚报 21 nr
+今晨 36 t
+今景宗久 3 nr
+今月古月 3 t
+今朝 130 t
+今朝有酒 3 nr
+今朝有酒今朝醉 12 i
+今期 3 t
+今来古往 3 i
+今果 2 n
+今次 3 t
+今正阳 128 nr
+今江陵 2 nr
+今生 126 t
+今生今世 58 i
+今生缘 3 nr
+今番 149 t
+今秋 13 t
+今胜如昔 3 i
+今草 3 nr
+今蝉蜕壳 3 v
+今西宁 2 nr
+今视网 3 n
+今译 17 nr
+今豪杰 2 nr
+今运河 2 nr
+今镇江 3 nr
+今雨新知 3 i
+今非夕比 3 i
+今非昔比 43 i
+今音 11 n
+今题网 3 i
+今魏 2 t
+介 435 nr
+介东 8 ns
+介乎 65 v
+介于 810 v
+介休 28 v
+介休县 7 nr
+介休市 2 v
+介体 2 n
+介入 684 v
+介入性 8 n
+介公子 4 n
+介召 3 v
+介在 3 v
+介士 4 n
+介壳 47 n
+介子 125 n
+介寒 2 v
+介导 12 v
+介弟 2 n
+介怀 13 v
+介意 203 v
+介文 2 n
+介末 2 n
+介杆 3 n
+介村夫 2 nr
+介生 2 v
+介甲 2 n
+介电常数 15 n
+介电强度 3 n
+介电损耗 6 v
+介电效应 3 n
+介石 6 n
+介福 3 v
+介系词 3 n
+介素 6 n
+介绍 8926 v
+介绍书 3 nr
+介绍信 59 nr
+介绍性 4 nr
+介绍所 63 n
+介绍费 4 nr
+介胄 3 n
+介草 5 n
+介蒂 2 nr
+介虫 3 n
+介词 65 n
+介质 942 n
+介质击穿 3 n
+介质天线 3 n
+介质弛豫 3 z
+介质波导 3 n
+介质隔离 3 n
+介错 5 v
+介面 8 n
+介面卡 3 n
+介音 7 n
+仌 2 zg
+仍 18627 zg
+仍以 3 d
+仍停留 3 vn
+仍旧 1618 d
+仍旧会 3 vn
+仍未 3 d
+仍来 3 d
+仍然 8526 d
+仍要 3 d
+仍陋袭简 3 nr
+仍须 3 d
+仍须努力 3 ns
+从 110435 p
+从一而终 27 i
+从一阳 2 nr
+从上到下 3 l
+从上向下 3 l
+从下到上 3 l
+从下向上 3 l
+从不 1386 d
+从不间断 3 l
+从世民 3 nr
+从业 1346 v
+从业人员 3 l
+从业员 3 n
+从业者 126 n
+从东向西 3 nr
+从东山 3 nr
+从东州 5 nr
+从严 317 d
+从严办理 3 l
+从严处理 3 i
+从严治党 3 nr
+从严治检 3 nr
+从中 1170 d
+从中作梗 10 i
+从中取利 3 l
+从中渔利 6 l
+从临颍 4 nr
+从丹炉 2 nr
+从义净 2 nr
+从乐亭 2 nr
+从书篮 2 nr
+从乾方 2 nr
+从乾清 8 nr
+从事 7036 v
+从事贸易 3 l
+从五开始 2 i
+从井救人 3 i
+从亚冠 3 nr
+从亨利 3 nr
+从今 208 t
+从今以后 130 l
+从今天起 3 l
+从今年起 3 l
+从今开始 3 i
+从今往后 3 l
+从从容容 16 l
+从令如流 3 l
+从价税 3 l
+从众 42 d
+从优 21 d
+从优办理 3 l
+从何下手 3 l
+从何寻 3 nr
+从何而来 3 l
+从何说起 3 l
+从俊武 2 nr
+从俗 9 a
+从俗就简 3 i
+从俗浮沉 3 i
+从保亭 2 nr
+从债 3 v
+从健妇 6 nr
+从兀良 2 nr
+从先 3 d
+从先帝 2 nr
+从先秦 2 nr
+从兴凯 2 nr
+从兴庆 2 nr
+从其所好 3 l
+从内廷 4 nr
+从军 201 nr
+从军报国 3 i
+从军行 3 nr
+从军记 6 nr
+从冥殿 2 nr
+从冰斗 2 nr
+从凯恩 2 nr
+从刑 12 v
+从前 1310 t
+从努尔 5 nr
+从勒尔 2 nr
+从化县 3 nr
+从化市 6 ns
+从北向南 3 nr
+从华山 3 nr
+从南到北 3 l
+从博客 2 nr
+从博鳌 2 nr
+从即日起 3 i
+从古以来 3 l
+从古到今 50 l
+从古至今 49 l
+从句 36 d
+从右到左 3 nr
+从君亭 2 nr
+从启祥 2 nr
+从吾言 2 nr
+从命 72 v
+从商 39 v
+从善如流 21 i
+从善如登 3 i
+从善若流 3 i
+从嘉和 3 nr
+从嘉平 2 nr
+从国美 2 nr
+从城旦 2 nr
+从堂兄弟 3 nr
+从堂姐妹 3 nr
+从壁上观 3 i
+从士伍 3 nr
+从外到里 3 l
+从外向内 3 l
+从大清 131 nr
+从天梁 2 nr
+从天而下 3 i
+从天而降 116 i
+从头 318 v
+从头做起 3 l
+从头再来 3 l
+从头到尾 159 i
+从头到脚 3 l
+从头合成 3 l
+从头开始 3 i
+从头彻尾 3 i
+从头来 3 l
+从头来起 3 i
+从头测序 3 l
+从头至尾 108 i
+从头说起 3 i
+从头越 3 d
+从夷陵 5 nr
+从奇珍 3 nr
+从如皋 4 nr
+从始至终 39 l
+从孝公 3 nr
+从宁远 9 nr
+从安彩 2 nr
+从宏德 2 nr
+从官寨 2 nr
+从宙斯 2 nr
+从定仙 2 nr
+从宜城 2 nr
+从实 26 d
+从实招来 3 l
+从容 498 v
+从容不迫 240 i
+从容就义 15 l
+从容应对 21 i
+从容自如 3 i
+从容自若 7 i
+从宽 51 nr
+从宽办理 3 l
+从宽发落 3 l
+从宽处理 3 nr
+从小 1254 d
+从小儿 59 nr
+从小到大 77 l
+从小到老 3 l
+从小孔 2 nr
+从小红 4 nr
+从少安 2 nr
+从少平 2 nr
+从属 317 v
+从属关系 3 l
+从属性 8 b
+从属景观 3 l
+从岩国 2 nr
+从崇祯 24 nr
+从左到右 3 l
+从左往右 3 l
+从师 103 nr
+从平阳 2 nr
+从庆远 2 nr
+从庆连 2 nr
+从延津 5 nr
+从建城 2 nr
+从建州 3 nr
+从建康 4 nr
+从开普 2 nr
+从开田 2 nr
+从弱到强 3 l
+从彰义 7 nr
+从征钦 3 nr
+从御营 2 nr
+从微 2 d
+从德胜 12 nr
+从心所欲 7 i
+从快 16 d
+从总体上 3 l
+从恭默 2 nr
+从恶如崩 3 i
+从恶是崩 3 i
+从恶若崩 3 i
+从慈宁 3 nr
+从慧梅 7 nr
+从戎 9 nr
+从我做起 3 l
+从承天 3 nr
+从技术上 3 l
+从政 249 nr
+从政者 2 nr
+从教 30 v
+从文中 3 nr
+从文件 16 l
+从文华 2 nr
+从旁协助 3 i
+从旁观看 3 l
+从无到有 53 i
+从早 3 d
+从早到晚 72 l
+从明叔 2 nr
+从明师 2 nr
+从明年起 3 l
+从显庆 2 nr
+从晓霞 3 nr
+从晨鸣 6 nr
+从暖阁 2 nr
+从曼海 2 nr
+从有到无 3 l
+从朗杰 2 nr
+从朝彦 2 nr
+从朝阳 2 nr
+从木梁 3 nr
+从木梯 3 nr
+从未 1517 d
+从未有过 214 l
+从未能 3 l
+从未见过 3 l
+从权 22 v
+从来 3548 d
+从来不 952 d
+从来如此 3 c
+从来未 3 d
+从来未有 3 i
+从来没 3 d
+从松山 2 nr
+从松林 2 nr
+从树林 2 nr
+从根本上 3 d
+从楚卿 2 nr
+从此 5348 c
+从此以后 82 l
+从武英 2 nr
+从毓庆 2 nr
+从水生 2 nr
+从永宁 2 nr
+从永定 3 nr
+从永平 7 nr
+从汉仪 3 nr
+从汉川 2 nr
+从汉法 2 nr
+从江 51 nr
+从江县 2 ns
+从汴梁 2 nr
+从没 547 d
+从河东 2 nr
+从洛贝尔 2 nr
+从流忘反 3 i
+从浙川 2 nr
+从浩宇 2 nr
+从海洞 2 nr
+从海道 9 nr
+从涌泉 2 nr
+从滋水 2 nr
+从潇湘 3 nr
+从澄海 2 nr
+从炀帝 4 nr
+从爱生 4 nr
+从犯 31 v
+从狗洞 3 nr
+从献公 3 nr
+从献忠 4 nr
+从玉泉 2 nr
+从现在起 3 l
+从瑷珲 2 nr
+从生到死 3 l
+从界岭 5 nr
+从登州 3 nr
+从百宝 3 nr
+从益州 2 nr
+从盘庚 3 nr
+从神禾 2 nr
+从福临 3 nr
+从简 46 nr
+从紧 6 d
+从红瓦 2 nr
+从红转 2 nr
+从绍鸥 2 nr
+从维熙 2 nr
+从缓 3 d
+从美茵 2 nr
+从翰林 3 nr
+从翰香 13 nr
+从考研 4 nr
+从而 7775 c
+从腔子 4 nr
+从良 31 nr
+从茶庄 2 nr
+从茶蓬 2 nr
+从薪泽 2 nr
+从襄垣 4 nr
+从襄子 2 nr
+从西向东 3 nr
+从觉华 2 nr
+从警 2 v
+从谏如流 22 i
+从贞观 2 nr
+从轻 89 d
+从轻发落 14 i
+从轻处理 3 i
+从迎霜 2 nr
+从这一点 3 l
+从这以后 3 l
+从这时起 3 l
+从远安 2 nr
+从速 55 d
+从那之后 3 l
+从那以后 3 l
+从那时起 3 l
+从里到外 3 l
+从里向外 3 l
+从重 83 v
+从重从快 3 l
+从重处理 3 l
+从量税 2 l
+从金军 2 nr
+从金华 3 nr
+从金境 3 nr
+从铁栅 2 nr
+从铁罩 2 nr
+从锡兰 4 nr
+从长商议 3 l
+从长计议 87 i
+从长计较 5 i
+从长远看 3 i
+从阅舰 2 nr
+从阿尔 2 nr
+从难从严 11 i
+从雄体 2 l
+从雅库 3 nr
+从雅虎 2 nr
+从零开始 3 i
+从青楼 2 nr
+从风而服 3 i
+从风而靡 3 i
+从麟州 2 nr
+仐 24 zg
+仑 63 g
+仑背 3 ns
+仓 974 nr
+仓位 28 n
+仓促 197 ad
+仓促从事 3 i
+仓促应战 3 i
+仓促间 3 j
+仓储 107 j
+仓储业 3 n
+仓储式 8 n
+仓储笼 3 n
+仓卒 116 n
+仓卒主人 3 nr
+仓卒之际 3 i
+仓单 3 n
+仓及义 2 nr
+仓受纳 2 nr
+仓堪布 3 nr
+仓央嘉 13 nr
+仓容 14 n
+仓容量 2 n
+仓山 4 n
+仓山亚 2 ns
+仓山区 3 n
+仓州 3 ns
+仓库 833 n
+仓库业 3 n
+仓库区 8 n
+仓库货架 3 n
+仓廪 48 n
+仓廪充实 3 nr
+仓惶 29 ad
+仓房 31 n
+仓木麻衣 3 n
+仓海桑田 3 ns
+仓满库盈 3 nr
+仓猝 53 z
+仓田保昭 3 nr
+仓皇 224 n
+仓皇出逃 3 i
+仓皇失措 8 i
+仓皇无措 3 i
+仓盈粮丰 3 nr
+仓管员 3 n
+仓管处 3 n
+仓茶卡 2 nr
+仓遂兼 2 nr
+仓雅之 2 nr
+仓颉 17 nr
+仓颉输入 3 nr
+仓颉造 2 nr
+仓鼠 20 n
+仔 500 zg
+仔仔 3 n
+仔仔细细 40 z
+仔密 3 ad
+仔岛 5 nrt
+仔服 3 n
+仔母牛 3 n
+仔猪 15 n
+仔畜 3 n
+仔禽 3 n
+仔细 2997 ad
+仔细分析 3 n
+仔细听 3 n
+仔细听讲 3 n
+仔细想 3 n
+仔细搜索 3 z
+仔细检查 3 n
+仔细观察 3 n
+仔细观看 3 n
+仔细观赏 3 n
+仔细认真 3 z
+仔细阅读 3 n
+仔肩 3 n
+仔鱼 3 n
+仔鸡 6 n
+仕 462 n
+仕奇 3 n
+仕女 102 n
+仕女图 18 n
+仕女画 3 n
+仕官 3 n
+仕宦 45 n
+仕进 3 n
+仕途 327 n
+他 401339 r
+他乡人 3 l
+他乡异县 3 l
+他乡故知 3 i
+他乡遇故知 19 l
+他人 2288 r
+他们 93969 r
+他俩 468 r
+他国 137 r
+他妈的 850 l
+他家 807 r
+他山之石 17 l
+他山攻错 3 i
+他山石 15 n
+他杀 270 vn
+他物权 7 n
+他用 495 r
+他项权证 3 n
+仗 3272 n
+仗义 183 a
+仗义执言 24 i
+仗义疏财 30 i
+仗助 3 v
+仗势 3 v
+仗势凌人 3 i
+仗势欺人 28 i
+仗恃 18 v
+仗持 3 v
+仗持着 3 i
+仗气使酒 3 i
+仗胆 3 v
+仗马寒蝉 3 i
+付 1954 v
+付上 3 v
+付下 3 v
+付下去 3 l
+付与 64 v
+付丙 3 nr
+付丙丁 2 nr
+付东流 4 nr
+付之一叹 3 i
+付之一炬 180 i
+付之一笑 7 l
+付之丙丁 2 nr
+付之东流 26 i
+付之密 3 nr
+付之度外 3 i
+付之梨枣 3 n
+付之流水 3 i
+付之策 12 nr
+付予 2 v
+付交 3 v
+付产 3 v
+付价 3 v
+付伊籍 2 nr
+付体 5 n
+付免息 2 l
+付凯家 3 nr
+付出 1517 v
+付出代价 3 i
+付出劳动 3 l
+付到 3 v
+付印 32 v
+付去 3 v
+付天余 4 nr
+付好 3 v
+付完即止 3 l
+付定金 4 nr
+付帐 3 v
+付应祯 3 nr
+付强 3 v
+付得 3 v
+付息 45 v
+付息额 2 n
+付悠然 2 nr
+付托 79 v
+付托重任 3 nr
+付承发 2 nr
+付掉 3 v
+付排 3 v
+付方 3 nr
+付智勇 2 nr
+付有 3 v
+付朱谕 2 nr
+付来 3 v
+付梓 5 nr
+付款 279 v
+付款人 29 n
+付款单 3 n
+付款处 3 l
+付款日 3 l
+付款条件 3 l
+付永刚 10 nr
+付汇联 3 nr
+付海峰 181 nr
+付清 60 nr
+付点 3 n
+付煦然 2 nr
+付现 12 v
+付现金 3 nr
+付瑞成 3 nr
+付瑞灿 3 nr
+付笑谈 18 i
+付笛生 3 nr
+付组合 4 nr
+付给 297 v
+付艺伟 3 nr
+付讫 5 v
+付诸 98 nr
+付诸一炬 3 i
+付诸一笑 3 l
+付诸东流 23 nr
+付诸于 6 l
+付诸实施 118 l
+付诸实行 3 l
+付诸实践 23 l
+付诸洪乔 3 nr
+付诸流水 3 l
+付诸行动 3 l
+付账 27 v
+付费 159 v
+付费卡 2 nr
+付费者 3 n
+付起 3 v
+付足 3 v
+付过 3 v
+付邮 3 nr
+付酬 5 v
+付酬制度 3 l
+付钱 45 v
+付长昆 2 nr
+仙 4284 ng
+仙丹 79 ns
+仙乐 22 n
+仙乡 12 ns
+仙人 598 n
+仙人庄 2 ns
+仙人指路 12 nz
+仙人掌 105 n
+仙人掌果 3 n
+仙人桥 7 ns
+仙人洞 25 ns
+仙人渡 9 ns
+仙人球 2 n
+仙人跳 3 l
+仙人鞭 3 n
+仙仙琼阁 3 nz
+仙侠 2 n
+仙侣 3 n
+仙儿 3 n
+仙凡道 3 l
+仙剑 9 n
+仙剑三 3 i
+仙剑奇 3 i
+仙力 2 n
+仙台 16 n
+仙台病毒 3 n
+仙后座 23 n
+仙器 181 n
+仙境 119 n
+仙女 276 n
+仙女下凡 3 l
+仙女们 3 n
+仙女山 3 ns
+仙女座 3 n
+仙女湖 3 ns
+仙妮蕾德 3 n
+仙姑 109 n
+仙姿 3 n
+仙姿佚貌 3 nz
+仙姿玉色 3 i
+仙姿玉貌 3 i
+仙姿玉质 3 l
+仙子 160 n
+仙客 2 n
+仙客来 3 l
+仙宫 16 ns
+仙家 3 n
+仙尼亚 3 ns
+仙居 4 n
+仙居县 3 ns
+仙山 62 ns
+仙山楼阁 4 nz
+仙山琼客 3 nz
+仙山琼阁 2 nz
+仙岛 3 ns
+仙岩 3 n
+仙岳 3 ns
+仙峰 6 n
+仙师 7 n
+仙庄 3 ns
+仙府 3 n
+仙景 4 n
+仙术 3 n
+仙果 3 n
+仙桃 3117 n
+仙桃市 1552 ns
+仙桃草 3 n
+仙气 65 n
+仙水 3 n
+仙洞 28 n
+仙液琼浆 3 nz
+仙游 20 n
+仙游县 10 ns
+仙湖 2 ns
+仙源 6 n
+仙灵脾 3 n
+仙王座 3 n
+仙界 47 n
+仙石 3 n
+仙童 29 n
+仙童公司 6 n
+仙翁 3 n
+仙花 12 n
+仙茅 4 ns
+仙草 158 n
+仙药 3 n
+仙踪 3 n
+仙逝 25 v
+仙道彰 3 i
+仙郎 2 n
+仙都 88 ns
+仙阁里 3 n
+仙霞 12 n
+仙霞岭 35 ns
+仙霞路 3 ns
+仙露明珠 2 nz
+仙风道格 3 n
+仙风道气 3 n
+仙风道骨 11 n
+仙魔录 3 v
+仙鹤 69 n
+仙鹤草 6 n
+仛 154 zg
+仜 7 zg
+仝 32 nr
+仞 45 q
+仟 18 m
+仟克 3 m
+仠 23 zg
+仡 130 nz
+仡佬 33 nz
+仡佬族 291 nz
+代 6666 q
+代丙二 2 nr
+代为 331 v
+代为说项 3 n
+代主任 392 n
+代主席 16 n
+代之以 3 v
+代乐毅 2 nr
+代书 12 n
+代书记 3 n
+代买 3 v
+代乳粉 3 n
+代交 7 n
+代人 3 n
+代人受过 3 l
+代人捉刀 3 i
+代人说项 3 n
+代付 3 vn
+代付款 3 n
+代代 3 n
+代代传 3 vn
+代代木 3 n
+代代相传 61 l
+代代相承 5 nr
+代代红 3 nr
+代件 3 n
+代价 1286 n
+代位 6 n
+代位权 3 n
+代位继承 3 nr
+代偿 83 vn
+代克 2 n
+代入 28 n
+代公 7 n
+代养 2 n
+代写 3 v
+代冬桂 5 nr
+代出 3 v
+代刘恺 2 nr
+代办 88 v
+代办处 31 n
+代办所 14 n
+代办点 3 n
+代办费 14 n
+代加工 3 n
+代劳 32 n
+代北旧 3 nr
+代华商 2 n
+代卖 4 v
+代卢象 2 nr
+代卫留成 3 nr
+代县 17 n
+代县长 3 n
+代发 7 v
+代取 3 v
+代号 451 n
+代名 3 n
+代名词 86 n
+代售 28 vn
+代售处 3 n
+代售点 8 n
+代唱 3 n
+代唱者 3 n
+代善 24 v
+代善伯 3 nr
+代国君 3 nr
+代型 3 n
+代垫 3 n
+代培 5 vn
+代培生 3 nr
+代基民 2 n
+代夏 3 n
+代夏政 3 nr
+代天子 2 nr
+代天抚 6 nr
+代天父 2 nr
+代天立 2 nr
+代夫 3 n
+代奥陶 2 nr
+代子 3 n
+代孕 30 v
+代孕网 3 n
+代宗 7 nr
+代宗命 3 nr
+代宗广 2 nr
+代宗朱 4 nr
+代宫 2 n
+代尔 10 nr
+代尔夫 8 nr
+代尔诺 3 nr
+代州 6 n
+代州雁 5 nr
+代工 42 n
+代工厂 9 n
+代己 2 n
+代币 2 n
+代币券 3 n
+代市长 2 n
+代帝陵 2 nr
+代序 4 n
+代庖 3 i
+代府 5 n
+代康有为 2 nr
+代建制 3 n
+代录 3 n
+代役 9 n
+代役金 6 n
+代役银 3 nr
+代征 3 n
+代微积 9 n
+代总理 35 n
+代总统 15 n
+代打 3 v
+代打者 3 n
+代扣 6 n
+代扣代缴 3 n
+代拆代行 3 n
+代换 14 v
+代换品 3 n
+代换性质 3 l
+代掌教 25 n
+代收 43 v
+代收款 3 n
+代收费 5 n
+代数 508 n
+代数和 41 n
+代数学 182 n
+代数式 31 n
+代数数域 3 n
+代数方程 90 n
+代数根 3 n
+代数闭域 3 n
+代数集 3 n
+代文臣 2 nr
+代斯勒 2 nr
+代旗 2 n
+代曹魏 2 nr
+代替 2262 v
+代替品 3 n
+代有财 16 n
+代朕督 2 nr
+代杨镐 3 nr
+代查 3 vn
+代森锌 2 nr
+代步 27 n
+代步车 4 n
+代武王 3 nr
+代殷商 3 nr
+代母 3 n
+代汉 12 n
+代沃布 2 nr
+代沟 26 n
+代湖广 2 nr
+代演 3 n
+代点 3 n
+代烃 5 n
+代烷 10 n
+代父 3 n
+代王 14 n
+代王侑 3 nr
+代王嘉 3 nr
+代王恒 2 nr
+代王权 2 nr
+代理 1946 n
+代理中心 3 n
+代理人 574 n
+代理会 3 n
+代理制 20 n
+代理员 11 n
+代理商 191 n
+代理处 7 n
+代理官 3 n
+代理店 3 n
+代理律师 3 n
+代理服务 3 n
+代理服务器 2 n
+代理权 35 n
+代理点 26 n
+代理行 23 n
+代理词 3 n
+代理费 12 n
+代理配送制 3 n
+代用 39 n
+代用品 16 n
+代田法 8 nr
+代电 3 n
+代皇帝 3 nr
+代益 3 n
+代省长 3 n
+代码 2049 n
+代码优化 4 n
+代码变换 3 l
+代码执行 2 n
+代码扩充 3 n
+代码段 4 n
+代码生成 3 n
+代码移动 3 l
+代码证 3 n
+代码运行 3 n
+代碎叶 5 nr
+代磊庆 3 nr
+代租 3 n
+代称 73 n
+代立 2 v
+代立拉 15 nr
+代笔 21 n
+代签 10 n
+代签人 3 n
+代管 53 n
+代管人 3 n
+代糖 3 n
+代续修 2 nr
+代缴 5 v
+代罪羔羊 3 n
+代群 6 n
+代考 7 v
+代耕 3 nr
+代耶律 2 nr
+代聊 3 v
+代职 17 n
+代脉 11 n
+代臣 2 n
+代薪 2 n
+代行 112 n
+代表 32777 n
+代表人 220 n
+代表作 1106 n
+代表作品 65 n
+代表制 20 n
+代表团 1792 n
+代表处 124 n
+代表大会 1387 n
+代表性 949 n
+代表权 7 n
+代表者 25 n
+代表证 6 n
+代表队 89 n
+代表院 10 n
+代西魏 2 nr
+代言 96 n
+代言人 217 n
+代订 4 v
+代议 3 n
+代议制 71 n
+代议政治 3 n
+代词 80 n
+代诗文 2 nr
+代课 171 n
+代课老师 3 n
+代谢 920 v
+代谢作用 3 n
+代谢共栖 3 nr
+代谢区室 3 n
+代谢工程 3 n
+代谢性 35 n
+代谢期 3 n
+代谢物 21 n
+代谢率 3 n
+代谢能 3 n
+代购 26 v
+代赫纳 5 nr
+代赭石 3 vn
+代越庖俎 3 n
+代跑 3 v
+代跑员 3 n
+代跑者 3 n
+代转 2 v
+代郡武 2 nr
+代部长 13 n
+代金 15 n
+代金券 3 n
+代销 86 v
+代销商 3 n
+代销店 3 n
+代销点 9 n
+代闯王 3 nr
+代际 32 n
+代雪李 2 nr
+代青贝 2 nr
+代顿 11 nr
+代领 22 n
+代马依风 3 nr
+代马望北 3 nr
+令 9565 v
+令不虚行 3 l
+令严 3 n
+令亲 3 n
+令人 4728 nrt
+令人不安 54 l
+令人不解 22 l
+令人作呕 25 i
+令人信服 61 l
+令人兴奋 3 l
+令人切齿 3 i
+令人厌倦 3 i
+令人厌恶 3 i
+令人发指 34 i
+令人叹服 14 l
+令人吃惊 3 i
+令人同情 3 l
+令人咋舌 3 v
+令人喷饭 3 l
+令人困倦 3 i
+令人困惑 3 l
+令人堪忧 8 i
+令人寒心 3 i
+令人尊敬 3 i
+令人心寒 3 i
+令人心悸 13 i
+令人心醉 3 i
+令人忧伤 3 i
+令人恐怖 3 i
+令人恶心 3 i
+令人恼火 3 z
+令人惊叹 3 i
+令人惊骇 3 n
+令人感动 21 l
+令人担心 22 l
+令人担忧 61 l
+令人振奋 36 l
+令人捧腹 3 i
+令人敬畏 3 l
+令人昏眩 3 i
+令人欣慰 3 i
+令人气恼 3 l
+令人气愤 3 l
+令人气结 3 l
+令人注目 16 i
+令人深思 3 l
+令人满意 122 l
+令人激动 3 l
+令人烦恼 3 l
+令人焦虑 3 i
+令人生厌 8 l
+令人生畏 34 l
+令人疲倦 3 i
+令人瞠目 3 vn
+令人瞩目 58 i
+令人神往 14 l
+令人称奇 4 i
+令人窒息 3 vn
+令人羡慕 57 l
+令人莫测 3 l
+令人讨厌 3 i
+令人费解 3 l
+令人起敬 6 l
+令人遗憾 3 i
+令人钦佩 19 l
+令人难忘 3 i
+令人震惊 3 l
+令人高兴 3 l
+令人鼓舞 43 i
+令人齿冷 5 i
+令兄 56 n
+令出如山 3 l
+令原之戚 3 l
+令友 3 n
+令叔 3 nrt
+令坦 3 nrt
+令堂 43 nrt
+令妹 20 n
+令媛 3 nrt
+令嫒 6 n
+令尊 224 nr
+令尊大人 3 i
+令岳 3 nrt
+令师 3 n
+令弟 28 n
+令徒 3 nrt
+令慈 3 nrt
+令旗 80 n
+令望 3 nrt
+令爱 65 nrt
+令牌 69 nrt
+令牌环 3 n
+令状 8 n
+令狐 486 nr
+令狐世兄 2 nr
+令狐侠士 2 n
+令狐兄 60 nr
+令狐兄弟 11 nr
+令狐公子 132 n
+令狐冲 4787 nr
+令狐冲举 4 i
+令狐冲久 2 i
+令狐冲伸 10 i
+令狐冲倚 2 i
+令狐冲公子 4 i
+令狐冲决 2 i
+令狐冲凝 4 nr
+令狐冲刚 2 nr
+令狐冲初 2 i
+令狐冲剑 16 i
+令狐冲原 2 i
+令狐冲双 8 i
+令狐冲右 7 i
+令狐冲叹 26 i
+令狐冲吁 3 i
+令狐冲吓 3 nr
+令狐冲听 13 i
+令狐冲呆 2 i
+令狐冲命 2 i
+令狐冲喜 16 i
+令狐冲喝 4 i
+令狐冲嘻 2 nr
+令狐冲大 13 i
+令狐冲奇 24 i
+令狐冲奔 4 nr
+令狐冲好 9 i
+令狐冲学 3 i
+令狐冲定 2 i
+令狐冲强 2 i
+令狐冲微 6 i
+令狐冲微微 26 i
+令狐冲心 115 i
+令狐冲忍 2 i
+令狐冲忙 4 i
+令狐冲念 3 i
+令狐冲忽 3 nr
+令狐冲怒 13 i
+令狐冲情 3 i
+令狐冲惊 9 i
+令狐冲愈 2 nr
+令狐冲扶 3 nr
+令狐冲抢 6 nr
+令狐冲拉 4 nr
+令狐冲拔 2 i
+令狐冲招 3 i
+令狐冲拿 2 nr
+令狐冲挥 2 i
+令狐冲提 5 i
+令狐冲摇 8 i
+令狐冲攻 2 i
+令狐冲放 3 i
+令狐冲朗 2 i
+令狐冲望 3 i
+令狐冲横 3 i
+令狐冲正 4 i
+令狐冲深 2 i
+令狐冲甚 2 i
+令狐冲略 2 i
+令狐冲疾 3 i
+令狐冲直 2 i
+令狐冲相 4 i
+令狐冲睡 2 nr
+令狐冲知 14 i
+令狐冲确 2 i
+令狐冲神 2 i
+令狐冲笑 162 i
+令狐冲素 4 i
+令狐冲缩 2 nr
+令狐冲耳 7 i
+令狐冲背 3 i
+令狐冲腿 2 n
+令狐冲见 12 i
+令狐冲记 2 i
+令狐冲谦 2 nr
+令狐冲赞 3 i
+令狐冲越 7 i
+令狐冲跃 3 i
+令狐冲身 15 i
+令狐冲躺 2 nr
+令狐冲转 13 i
+令狐冲迎 2 i
+令狐冲运 3 i
+令狐冲进 2 i
+令狐冲连 5 i
+令狐冲递 2 nr
+令狐冲酒 2 i
+令狐冲隔 2 i
+令狐冲飞 2 i
+令狐大侠 10 nr
+令狐大哥 259 nr
+令狐少侠 42 nr
+令狐少君 6 nr
+令狐师 5 nr
+令狐师兄 19 nr
+令狐德 18 nr
+令狐掌 4 i
+令狐掌门 66 i
+令狐楚 14 nr
+令狐楚继 2 i
+令狐绝 3 i
+令狐贤 12 nr
+令甥 3 n
+令祖 3 nrt
+令箭 79 n
+令箭荷花 3 n
+令节 3 n
+令行如流 3 l
+令行禁止 19 l
+令誉 3 n
+令郎 96 nrt
+令郞 3 nrt
+令酒 3 n
+令闻 3 n
+以 136106 p
+以一儆百 3 i
+以一击十 3 i
+以一奉百 3 i
+以一当十 29 i
+以一持万 3 i
+以一知万 3 i
+以一警百 3 l
+以上 24969 f
+以上学历 3 l
+以上者 61 c
+以下 7611 f
+以下内容 3 l
+以下几点 3 l
+以下犯上 3 l
+以不变应 3 l
+以不变应万变 40 l
+以不济可 3 l
+以东 1087 f
+以丰补歉 3 l
+以为 6133 c
+以为后图 3 i
+以义割恩 3 l
+以义断恩 3 ns
+以书为御 3 nr
+以于 3 c
+以产定销 3 l
+以人为本 173 l
+以人为鉴 3 i
+以人为镜 2 l
+以人废言 3 l
+以人择官 3 n
+以众暴寡 3 l
+以优吃劣 3 l
+以伪乱真 3 i
+以佚待劳 3 nr
+以使 3 c
+以例说明 3 l
+以便 2167 c
+以信为本 3 l
+以候 3 v
+以候通知 3 n
+以假乱真 27 i
+以假充真 4 i
+以假谬真 3 i
+以偏概全 18 i
+以儆效尤 11 i
+以免 1200 c
+以免费 4 v
+以党举官 3 l
+以公灭私 3 i
+以其 3 c
+以其昏昏 3 i
+以养伤身 3 i
+以内 1074 f
+以军 104 v
+以农为本 4 l
+以农立国 3 ns
+以冠补履 3 l
+以冰止蝇 3 i
+以冰致蝇 3 i
+以刑去刑 3 i
+以刑止刑 3 i
+以刑致刑 3 i
+以利 134 ns
+以利于 3 v
+以利再战 3 l
+以利累形 3 ns
+以前 9343 f
+以前年度 3 l
+以力服人 3 l
+以功补过 3 l
+以功覆过 3 i
+以功赎罪 3 i
+以劣充优 3 l
+以劣胜优 3 l
+以势压人 5 i
+以勤补拙 3 i
+以北 2100 f
+以升量石 3 n
+以半击倍 3 l
+以南 1607 f
+以博 4 ns
+以博欢心 3 i
+以卵击石 13 n
+以卵投石 3 n
+以卵敌石 3 l
+以厂为家 3 l
+以及 30775 c
+以及人之老 6 i
+以叔援嫂 3 nr
+以口问心 3 i
+以古为鉴 3 i
+以古为镜 2 l
+以古况今 3 l
+以古制今 3 l
+以古喻今 3 l
+以古方今 3 l
+以古非今 3 l
+以史为鉴 22 i
+以史为镜 2 l
+以后 21386 f
+以后鬼 3 l
+以和为贵 8 i
+以售其奸 3 n
+以商养文 3 nz
+以噎废飡 3 i
+以噎废餐 3 i
+以国防部 7 nt
+以图 150 v
+以壮行色 3 i
+以备 280 v
+以备不时 3 l
+以备不测 11 i
+以外 3436 c
+以多胜少 3 l
+以夜继日 3 i
+以夜继昼 3 nr
+以夜继朝 3 i
+以夜续昼 3 n
+以大恶细 3 i
+以天下为己任 26 l
+以太 151 nz
+以太网 31 nz
+以太网交换机 3 nz
+以太网卡 3 nz
+以太风 3 nr
+以夷伐夷 3 ns
+以夷制夷 10 i
+以夷攻夷 3 i
+以夷治夷 3 ns
+以子之矛 3 i
+以学愈愚 3 l
+以守为攻 3 i
+以定 3 d
+以宫笑角 3 i
+以容取人 3 l
+以寡击众 3 i
+以寡敌众 3 i
+以小人之心 19 i
+以小见大 8 i
+以少胜多 3 l
+以屈求伸 3 i
+以岗定薪 3 nr
+以工代干 3 l
+以工代赈 14 l
+以工补农 3 l
+以己度人 8 nz
+以已度人 3 l
+以弗所 5 ns
+以弱制强 3 l
+以弱胜强 22 i
+以强凌弱 6 i
+以强胜弱 3 l
+以彼之道 47 i
+以往 1951 t
+以往鉴来 3 i
+以待 194 v
+以微知着 3 l
+以微知著 3 i
+以德 48 t
+以德取人 3 i
+以德报德 3 nz
+以德报怨 16 i
+以德服人 12 i
+以德育人 3 nr
+以德追祸 3 i
+以心传心 3 i
+以心问心 3 i
+以快先睹 3 i
+以怨报德 20 i
+以恶报恶 3 i
+以情动人 4 l
+以情感人 2 l
+以意为之 3 i
+以意逆志 3 i
+以慎为键 3 nr
+以我为主 33 i
+以战养战 13 nz
+以战去战 3 i
+以手加额 8 i
+以执代审 3 n
+以拖待变 3 l
+以指挠沸 3 i
+以指测河 3 nz
+以攻为守 35 i
+以政代企 3 j
+以文乱法 3 l
+以文会友 11 l
+以文害辞 3 i
+以方 49 f
+以日为年 3 l
+以日继夜 3 i
+以旧换新 3 l
+以旧翻新 3 l
+以是 3 c
+以智取胜 3 i
+以暴制暴 3 i
+以暴易暴 8 i
+以暴治暴 3 i
+以期 194 f
+以杀去杀 3 i
+以杀止杀 3 i
+以权代法 3 nz
+以权谋私 50 i
+以权达变 3 l
+以来 10402 f
+以柔克刚 37 nr
+以柔制刚 3 i
+以桃代李 3 i
+以案释法 3 i
+以桐 2 ns
+以次 31 c
+以次充好 26 l
+以正视听 3 i
+以此 1445 c
+以此为准 3 i
+以此为戒 3 i
+以此为由 3 l
+以此为荣 3 l
+以此为证 3 i
+以此为限 3 l
+以此类推 33 l
+以毁为罚 3 i
+以毒攻毒 49 l
+以毛相马 3 i
+以民为本 10 l
+以水投水 3 i
+以水投石 3 i
+以水救水 3 i
+以水洗血 3 l
+以水济水 3 l
+以求 665 v
+以求一逞 2 i
+以汤止沸 3 i
+以汤沃沸 3 i
+以汤沃雪 3 nr
+以沫相濡 3 nr
+以法 56 v
+以法为教 3 l
+以法治税 3 l
+以泪洗面 17 l
+以泽量尸 3 n
+以渴服马 3 i
+以火去蛾 3 n
+以火救火 3 i
+以火止沸 3 i
+以点带面 6 l
+以父之名 3 l
+以牙还牙 52 i
+以狸至鼠 3 i
+以狸饵鼠 3 n
+以玉抵乌 3 l
+以珠弹雀 3 i
+以理服人 20 l
+以疏间亲 3 i
+以疑决疑 3 l
+以白为黑 3 l
+以白诋青 3 z
+以直报怨 3 i
+以直抱怨 3 i
+以眼还眼 9 l
+以石投卵 3 i
+以石投水 3 i
+以碫投卵 3 n
+以示 760 v
+以示公允 3 l
+以示公平 3 nz
+以礼相待 61 i
+以私害公 3 i
+以私废公 3 i
+以税代利 3 nz
+以筌为鱼 3 ns
+以策安全 3 nz
+以筦窥天 3 n
+以简御繁 3 nr
+以简驭繁 3 i
+以管窥天 3 i
+以管窥豹 3 i
+以索续组 3 n
+以紫为朱 3 nr
+以紫乱朱 3 n
+以终天年 3 i
+以绝后患 3 i
+以罚代刑 3 l
+以羊易牛 3 nz
+以老卖老 3 i
+以耳为目 3 i
+以耳代目 3 i
+以职谋私 3 i
+以肉去蚁 3 l
+以肉啖虎 3 nz
+以肉喂虎 3 nz
+以肉餧虎 3 nz
+以肉驱蝇 3 i
+以胶投漆 3 nz
+以至 1497 c
+以至于 747 c
+以致 1580 c
+以致于 3 v
+以色列 2041 ns
+以色列国 31 ns
+以色列国防军 25 nt
+以色列国防部 14 nt
+以色列外交部 2 nt
+以色列工党 7 nt
+以色列政府 10 nt
+以色列空军 26 nt
+以色谋财 3 i
+以艳丽 3 nr
+以苦为乐 4 i
+以苦为荣 2 i
+以荷析薪 3 l
+以莛叩钟 3 nr
+以莛扣钟 3 nr
+以莛撞钟 3 n
+以蚓投鱼 3 nz
+以螳当车 3 v
+以蠡测海 3 i
+以血偿血 3 i
+以血洗血 3 l
+以血还血 3 i
+以西 923 f
+以见一斑 3 l
+以观后效 27 i
+以规为瑱 3 nt
+以言为讳 3 i
+以言举人 3 i
+以言代法 3 i
+以言取人 3 i
+以言废人 3 l
+以言徇物 3 i
+以誉为赏 3 i
+以誉进能 3 i
+以计代战 3 nz
+以讹传讹 16 i
+以讹化讹 3 i
+以词定字 3 l
+以词害意 3 i
+以诚待人 3 i
+以诚相待 16 i
+以诚相见 3 i
+以话引话 3 l
+以误传误 3 l
+以貌取人 20 i
+以貍至鼠 3 nz
+以货易货 3 nt
+以质取胜 2 i
+以贷还贷 3 n
+以资抵债 3 l
+以资鼓励 3 l
+以身作则 86 i
+以身报国 3 i
+以身殉国 3 i
+以身殉职 14 i
+以身相许 3 nr
+以身许国 17 i
+以身试法 13 i
+以身试险 3 l
+以辞取人 3 i
+以辞害意 3 i
+以近 3 f
+以进为退 3 l
+以进养出 3 l
+以退为进 35 i
+以逸击劳 3 i
+以逸待劳 110 i
+以邻为壑 6 i
+以郄视文 3 vn
+以销定产 2 l
+以锥刺地 3 l
+以锥飡壸 3 n
+以锥餐壶 3 n
+以键 3 n
+以镒称铢 3 nr
+以闻其声 3 i
+以防 513 v
+以防万一 37 l
+以防不测 35 l
+以飨读者 3 nz
+以马内利 3 ns
+以骨去蚁 3 l
+以鱼驱蝇 3 i
+以鹿为马 3 i
+以黑为白 3 l
+仨 78 m
+仨俩 3 m
+仨月 8 m
+仪 1711 ng
+仪仗 859 n
+仪仗队 52 n
+仪典 10 n
+仪刑 3 n
+仪制 3 n
+仪剑 34 n
+仪化 3 n
+仪卫 15 n
+仪器 1429 n
+仪器仪表 3 n
+仪器厂 11 n
+仪器接口 3 n
+仪器网 3 n
+仪器设备 3 n
+仪型 3 n
+仪容 42 n
+仪容俊秀 3 nr
+仪容检查 3 nr
+仪宾 3 n
+仪封 3 ns
+仪巴达特 3 nz
+仪式 3429 n
+仪式化 4 n
+仪式性 3 n
+仪征 61 n
+仪征市 9 n
+仪态 37 n
+仪态万千 3 i
+仪态万方 22 n
+仪文 6 n
+仪止 2 n
+仪注 2 n
+仪灵 2 n
+仪生 4 n
+仪真 5 nz
+仪礼 82 n
+仪节 34 n
+仪菁 2 nz
+仪表 613 n
+仪表仪器 3 n
+仪表出众 3 n
+仪表厂 4 n
+仪表堂堂 27 n
+仪表板 11 n
+仪表盘 12 n
+仪表网 3 nz
+仪表舱 3 n
+仪表阀门 3 vn
+仪表非凡 3 l
+仪观 3 n
+仪象 5 n
+仪轨 27 n
+仪门 3 n
+仪队 3 n
+仪陇 6 nr
+仪陇县 13 ns
+仪静体闲 3 nr
+仪驾 2 n
+仫佬 23 nz
+仫佬族 34 nz
+们 41212 k
+仮 32 zg
+仯 11 zg
+仰 1186 v
+仰不愧天 3 l
+仰之弥高 3 l
+仰事俛畜 3 v
+仰事俯育 3 l
+仰人眉睫 3 i
+仰人鼻息 4 l
+仰仗 83 v
+仰仗着 3 l
+仰体 2 n
+仰光 101 nr
+仰八叉 11 nr
+仰其容 16 nr
+仰冲 2 nr
+仰华寺 2 nr
+仰卧 89 v
+仰卧位 3 v
+仰卧起坐 23 i
+仰取俯拾 3 l
+仰天 348 nr
+仰天一望 3 l
+仰天大笑 71 l
+仰天湖 3 nr
+仰天长叹 35 nr
+仰天长啸 3 nr
+仰头 180 v
+仰头一看 3 l
+仰头望 2 l
+仰屋着书 3 i
+仰屋窃叹 3 i
+仰屋著书 3 nr
+仰山 2 ns
+仰山慧 2 nr
+仰式 3 n
+仰德大道 3 nr
+仰惟吾 2 nr
+仰慕 248 v
+仰慕者 3 nr
+仰承 4 nr
+仰承其 16 nr
+仰拾俯取 3 vn
+仰望 217 v
+仰止 3 v
+仰泳 41 nr
+仰看 3 v
+仰看着 3 l
+仰给 3 v
+仰脖 3 nr
+仰脸 4 d
+仰荷圣 2 nr
+仰观俯察 3 l
+仰视 104 v
+仰角 43 ns
+仰赖 35 v
+仰赖着 3 v
+仰起 3 v
+仰身直 3 d
+仰躺着 3 l
+仰靠 3 v
+仰靠着 3 v
+仰面 125 d
+仰面唾天 3 z
+仰面朝天 24 i
+仰韶 18 nr
+仰韶文化 107 l
+仰韶村 9 nr
+仰首 21 v
+仰首伸眉 3 nr
+仰首吟 2 nr
+仰首朝 2 nr
+仰高 3 v
+仱 4 zg
+仲 274 zg
+仲丁醇 3 nr
+仲介 3 nr
+仲介公司 3 nr
+仲代达矢 3 nr
+仲伯难分 3 nr
+仲冬 7 nr
+仲升 2 v
+仲华你 2 nr
+仲华可 2 nr
+仲华忒 2 nr
+仲华阅 2 nr
+仲呈祥 3 nr
+仲夏 44 nr
+仲夏夜 3 nr
+仲大军 2 nr
+仲家 8 n
+仲尼 8 nr
+仲巴 3 nr
+仲巴县 3 nr
+仲巴呼 2 nr
+仲平和 3 nr
+仲康死 3 nr
+仲德之 2 nr
+仲敦巴 3 nr
+仲星火 3 nr
+仲春 18 nr
+仲景之 4 nr
+仲景旧 2 nr
+仲景牌 4 nr
+仲派驹 3 nr
+仲秋 7 nr
+仲裁 604 vn
+仲裁书 3 nr
+仲裁人 3 nr
+仲裁员 56 n
+仲裁委 10 nr
+仲裁庭 34 nr
+仲裁方 3 nr
+仲裁条款 3 n
+仲裁法 5 nr
+仲裁者 21 n
+仲裁费 3 n
+仲让 2 v
+仲达之 3 nr
+仲长统 5 nr
+仲间 3 t
+仲雍奔 3 nr
+仲麦巴 2 nr
+仳 3 x
+仴 34 zg
+仵 8 nr
+仵作 21 n
+仵作一 2 nr
+仵作人 2 n
+仵官 2 n
+仵延东 2 nr
+仵德厚 2 nr
+件 6482 zg
+件产品 4 n
+件头 3 n
+件夹 2 n
+件套 3 n
+件数 24 n
+件次 3 n
+件物品 5 n
+价 3061 n
+价位 214 n
+价低 3 n
+价值 15777 n
+价值体系 3 n
+价值千金 7 n
+价值尺度 3 n
+价值形式 76 n
+价值观 515 n
+价值观念 3 n
+价值规律 162 l
+价值论 42 n
+价值连城 85 n
+价值量 282 n
+价值链 46 n
+价内 3 n
+价单 3 n
+价增一顾 3 i
+价外 3 n
+价差 23 n
+价带 3 n
+价廉 30 n
+价廉物美 35 l
+价态起伏 3 l
+价标 3 n
+价格 11762 n
+价格上涨 3 l
+价格下降 3 n
+价格不菲 3 n
+价格优势 3 n
+价格低 4 n
+价格低廉 3 n
+价格体系 3 n
+价格便宜 4 n
+价格公道 3 n
+价格冻结 3 n
+价格合理 3 n
+价格战 127 n
+价格指数 3 n
+价格控制 3 n
+价格政策 3 n
+价格昂贵 5 i
+价格比 71 n
+价格水平 5 n
+价格法 21 n
+价格牌 2 n
+价格竞争 3 l
+价格网 3 n
+价格行情 3 n
+价格表 8 n
+价格调整 4 l
+价款 84 n
+价比高 3 n
+价率 3 n
+价电子 26 n
+价目 3 n
+价目单 3 n
+价目表 5 n
+价码 57 n
+价码儿 3 n
+价等连城 3 n
+价签 3 n
+价费字 2 n
+价轻字 3 n
+价重字 3 n
+价金 3 n
+价钱 520 n
+价额 5 n
+价高 3 n
+仺 54 zg
+任 16831 r
+任一 113 r
+任一飞 3 nr
+任三司 4 nr
+任丘人 3 nr
+任丘市 14 n
+任东南 2 nr
+任东州 2 nr
+任东平 3 nr
+任东郡 3 nr
+任东阁 3 nr
+任中书 11 nr
+任中华 2 nr
+任为 3 v
+任为兵 2 nr
+任为典 2 nr
+任为卿 3 nr
+任为长老 16 nr
+任主其 2 nr
+任之 21 nr
+任事 3 r
+任于阗 2 nr
+任亚卿 3 nr
+任亚夫 2 nr
+任亚琛 2 nr
+任京兆 2 nr
+任京湖 3 nr
+任京营 2 nr
+任人 3 r
+任人为贤 3 nr
+任人唯 6 nr
+任人唯亲 40 n
+任人唯贤 12 nr
+任人宰割 27 i
+任人惟亲 3 i
+任人摆布 11 i
+任代掌 3 nr
+任伏威 2 nr
+任伏龙 2 nr
+任伯年 3 nr
+任佐治 2 nr
+任何 14635 r
+任何一方 3 i
+任何事物 3 n
+任何人 1368 r
+任何借口 3 n
+任何原因 3 n
+任何时刻 3 r
+任何理由 3 n
+任何迹象 3 l
+任你拿 3 nr
+任你挑 3 n
+任你玩 3 nr
+任你选 3 nr
+任你邮 3 nr
+任侠 8 nr
+任保民 2 nr
+任光禄 3 nr
+任克拉克 2 nr
+任克溥 20 nr
+任克礼 257 nr
+任克里 2 nr
+任免 4568 v
+任免权 269 n
+任全印 3 nr
+任全苏 3 nr
+任公卿 2 nr
+任兴元 3 nr
+任兵科 2 nr
+任其发展 3 i
+任其子 3 nr
+任其宁 2 nr
+任其自流 3 i
+任其自然 16 i
+任冀察 4 nr
+任内 82 r
+任军政 2 nr
+任凉州 3 nr
+任凭 270 nr
+任凭风浪起 3 i
+任前军 2 nr
+任剑桥 8 nr
+任务 15213 n
+任务书 8 n
+任务分析 3 l
+任务分配 3 l
+任务区 8 n
+任务在身 3 n
+任务栏 3 n
+任务模型 3 n
+任务艰巨 3 i
+任务说明 3 n
+任务调度 2 n
+任务量 3 n
+任劳 16 nr
+任劳任怨 42 i
+任化邦 2 nr
+任北平 12 nr
+任北洋 2 nr
+任北路 4 nr
+任北魏 2 nr
+任华东 9 nr
+任华新 3 nr
+任南洋 2 nr
+任卫东 4 nr
+任卷舒 2 nr
+任原 8 n
+任原西 2 nr
+任县 16 r
+任参知 7 nr
+任台军 4 nr
+任台谏 2 nr
+任右仆 2 nr
+任右佥 2 nr
+任右通 2 nr
+任司农 2 nr
+任吉森 2 nr
+任同知 2 nr
+任吏 4 n
+任吏部 2 nr
+任吴相 2 nr
+任周瑜 2 nr
+任命 1969 n
+任命书 4 n
+任命权 8 n
+任命状 3 n
+任命者 3 n
+任哈雷 4 nr
+任商 2 n
+任喀山 2 nr
+任嘉诚 2 nr
+任国子 3 nr
+任国民 3 nr
+任国相 4 nr
+任国立 2 nr
+任城区 3 n
+任基尔 3 nr
+任基洛 2 nr
+任士人 2 nr
+任复旦 4 nr
+任大人 2 nr
+任大哥 3 nr
+任天堂 42 nr
+任天民 2 nr
+任天知 2 nr
+任太仆 2 nr
+任太尉 6 nr
+任太常 5 nr
+任夫人 3 nr
+任姓挚 2 nr
+任威廉 5 nr
+任子 2 n
+任孟山 2 nr
+任安 5 nr
+任安丰 2 nr
+任安国 2 nr
+任安福 2 nr
+任官 88 n
+任定边 2 nr
+任宝顺 3 nr
+任宣差 3 nr
+任宣抚 16 nr
+任家村 2 nr
+任家萱 3 n
+任宾努 2 nr
+任密苏 2 nr
+任导 2 n
+任封疆 2 nr
+任少正 2 nr
+任尚书 3 nr
+任尚书郎 3 nr
+任岩仓 2 nr
+任川汉 3 nr
+任川陕 2 nr
+任工 6 n
+任布兰 2 nr
+任帮主 4 n
+任平生 2 nr
+任平章 6 nr
+任幽州 2 nr
+任建州 2 nr
+任建康 5 nr
+任建新 25 nr
+任建民 3 nr
+任开封 3 nr
+任开州 3 nr
+任开普 2 nr
+任引军 2 nr
+任弗朗 2 nr
+任张嘉 2 nr
+任弼时 255 nrfg
+任彦生 2 nr
+任征夷 2 nr
+任征行 2 nr
+任得敬 31 nr
+任御史 11 nr
+任德共 2 nr
+任德耀 2 nr
+任志刚 2 nr
+任志强 6 nr
+任思强 2 nr
+任怡亲王 2 nr
+任性 262 n
+任怨任劳 3 i
+任总兵 7 nr
+任总管 2 n
+任恒山 3 nr
+任情 60 n
+任情率性 3 n
+任惕隐 2 nr
+任意 951 v
+任意子 3 n
+任意性 31 n
+任意球 286 n
+任意键 3 n
+任我游 3 n
+任我行 3 n
+任所 3 n
+任承应 2 nr
+任护国 2 n
+任护法 7 n
+任拱卫 2 nr
+任振华 2 nr
+任掌 3 n
+任提领 2 nr
+任摩尔 2 nr
+任教 964 n
+任教于 3 nr
+任教授 3 n
+任教者 3 n
+任文学 2 nr
+任文部 2 nr
+任斯克 4 nr
+任斯基 7 nr
+任新南 2 nr
+任新民 265 nr
+任新浪 3 nr
+任日中 2 nr
+任日坚 2 nr
+任明教 2 nr
+任明辉 6 nr
+任昭文 2 nr
+任晓华 2 nr
+任景丰 2 nr
+任有 3 v
+任朝散 2 nr
+任期 5456 n
+任期制 11 n
+任本兵 6 nr
+任本宁 2 nr
+任权 8 n
+任柏林 28 nr
+任校 2 r
+任校书 2 nr
+任校委 2 nr
+任格致 3 nr
+任检校 2 n
+任楚郡 2 nr
+任欢忻 2 nr
+任正非 12 nr
+任步赖 2 nr
+任民 7 n
+任民峰 3 nr
+任气 3 n
+任汉阳 4 nr
+任汝芬 6 nr
+任江宁 2 nr
+任汪伪 5 nr
+任沪军 2 nr
+任法军 3 nr
+任泽芝 3 nr
+任浚 28 nrfg
+任浚命 2 nr
+任海军 9 nr
+任海德 2 nr
+任海霞 3 nr
+任淞沪 4 nr
+任港英 2 nr
+任湘军 4 nr
+任满 44 nr
+任潼川 2 nr
+任燕京 5 nr
+任率兵 2 nr
+任玉岭 6 nr
+任王潮 3 nr
+任瑞恩 3 nr
+任用 637 v
+任用干部 3 n
+任由 239 n
+任由摆布 3 i
+任登州 2 nr
+任皇后 2 nr
+任盈盈 3 nr
+任直隶 7 nr
+任相国 5 nr
+任相邦 2 nr
+任真州 2 nr
+任督 5 n
+任知州 4 nr
+任知真 2 nr
+任礼部 7 nr
+任祖渊 2 nr
+任神职 16 n
+任秋凌 3 nr
+任科伦 2 nr
+任程伟 3 nr
+任粤军 7 nr
+任粤督 2 nr
+任素 11 n
+任素兰 2 nr
+任索邦 4 nr
+任红军 5 nr
+任约翰 2 nr
+任组长 31 n
+任绍庆 2 nr
+任统裁 2 nr
+任继愈 7 nr
+任继荣 36 nr
+任维东 6 nr
+任维尔 4 nr
+任美江 2 nr
+任美锷 2 nr
+任群牧 2 nr
+任翰林 12 nr
+任耶拿 4 nr
+任耶鲁 9 nr
+任职 2468 v
+任职期间 3 n
+任职者 13 n
+任育才 2 nr
+任脉 66 n
+任致公 2 nr
+任苏共 5 nr
+任苏松 2 nr
+任若恩 2 nr
+任英印 2 nr
+任茂东 256 nr
+任范阳 2 nr
+任荆南 2 nr
+任荣将军 2 nr
+任莱顿 2 nr
+任萨拉 2 nr
+任蒂宾 3 nr
+任藩镇 3 nr
+任蜀州 2 nr
+任行寿 2 nr
+任西伯 3 nr
+任许州 2 nr
+任课 51 v
+任课教师 3 n
+任课老师 3 n
+任谏议 2 nr
+任贤使能 3 nr
+任贤齐 259 nr
+任质斌 3 nr
+任贺鲁 2 nr
+任达不拘 3 i
+任达华 3 nr
+任远东 2 nr
+任选 73 v
+任通武 25 nr
+任郎官 2 nr
+任里昂 3 nr
+任重才轻 3 i
+任重而道远 23 i
+任重至远 3 nr
+任重道悠 3 nr
+任重道远 48 nr
+任金陵 5 nr
+任镇军 2 nr
+任镇南 2 nr
+任镇威 2 nr
+任长史 3 nr
+任长安 4 nr
+任长霞 3 nr
+任长风 3 nr
+任陆军 18 nr
+任陇海 4 nr
+任陇西 2 nr
+任雅武 2 nr
+任集贤 2 nr
+任震宇 2 nr
+任顺天 3 nr
+任领军 3 nr
+任飞燕 96 nr
+任首辅 13 nr
+任马堡 4 nr
+任高卢 3 nr
+任魏博 2 nr
+任魏尹 2 nr
+任魏玛 3 nr
+仼 15 zg
+份 4674 q
+份儿 165 n
+份儿饭 3 n
+份内份外 3 n
+份地 3 n
+份子 66 n
+份数 35 n
+份文件 7 n
+份量 96 n
+份额 1082 n
+份额油 3 n
+份饭 3 n
+仾 4 zg
+仿 614 d
+仿佛 3124 d
+仿冒 39 v
+仿冒品 3 n
+仿制 315 v
+仿制品 44 n
+仿制者 8 n
+仿办 3 v
+仿单 3 d
+仿古 66 d
+仿古砖 3 nz
+仿字 3 nz
+仿宋 34 b
+仿宋体 3 n
+仿射 17 v
+仿射变换 12 v
+仿射坐标 3 n
+仿射概形 3 vn
+仿射群 3 n
+仿建 3 v
+仿徨失措 3 v
+仿效 317 v
+仿木 4 n
+仿毛 10 n
+仿照 336 v
+仿玛瑙 3 n
+仿生 29 v
+仿生学 26 n
+仿画 3 v
+仿皮 3 n
+仿盛大 3 nz
+仿真 212 d
+仿真器 26 nz
+仿真度 2 d
+仿真技术 3 n
+仿真机 15 d
+仿真枪 3 nz
+仿真植物 3 n
+仿真线 3 nz
+仿真花 3 nz
+仿章 3 n
+仿红木 3 n
+仿纸 9 v
+仿绢 3 n
+仿羊绒 3 nz
+仿膳 8 v
+仿若 2 v
+仿行 3 v
+仿造 84 v
+仿造品 3 n
+伀 116 zg
+企 766 n
+企业 34826 n
+企业主 134 n
+企业亏损 3 vn
+企业会员 3 n
+企业会计 3 n
+企业伦理 3 n
+企业信用 3 n
+企业信箱 3 n
+企业倒闭 3 n
+企业债 7 n
+企业债券 3 n
+企业动态 3 n
+企业化 40 n
+企业博客 3 n
+企业名单 3 n
+企业名称 3 n
+企业型 9 n
+企业基金 3 n
+企业宗旨 3 n
+企业宣传 3 vn
+企业家 596 n
+企业局 3 n
+企业库 3 n
+企业应用 7 n
+企业录 3 n
+企业形象 3 n
+企业承包 3 n
+企业法 13 n
+企业法人 28 n
+企业界 116 n
+企业目录 3 n
+企业破产 3 n
+企业社 3 n
+企业简介 3 vn
+企业管理者 44 n
+企业级 31 n
+企业经营者 24 n
+企业职工 3 n
+企业财务 3 n
+企业资质 3 n
+企业邮局 3 n
+企业邮箱 3 n
+企业顾问 3 n
+企事业 188 n
+企仰 3 n
+企信通 3 n
+企划 54 n
+企划书 3 n
+企划人 3 n
+企划厅 3 n
+企划案 3 n
+企划组织 3 n
+企划部 9 n
+企及 40 v
+企口接 3 n
+企口板 3 n
+企图 2694 n
+企图心 3 n
+企待 3 v
+企慕 3 v
+企望 32 n
+企机 3 n
+企求 155 n
+企盼 273 v
+企祷 3 v
+企管 7 n
+企管科 3 n
+企管系 3 n
+企管网 3 n
+企足矮首 3 n
+企足而待 3 n
+企踵可待 3 v
+企鹅 154 n
+企鹅岛 2 n
+企鹅村 3 n
+企鹅牌 3 n
+企鹅肉 3 n
+伃 66 zg
+伄 23 zg
+伅 38 zg
+伆 54 zg
+伈伈睍睍 3 z
+伈黄鹉侨 3 n
+伉 8 nr
+伉俪 40 n
+伉俪之情 3 v
+伉俪情深 3 v
+伊 1890 ns
+伊万 241 nrt
+伊万年科 5 nz
+伊万见 2 nr
+伊万诺 4 nr
+伊万诺夫 147 nrt
+伊万诺娃 10 nr
+伊万诺维奇 23 nrt
+伊世珍 2 nr
+伊东 45 ns
+伊东俊 8 nr
+伊东市 2 ns
+伊东忠 2 nr
+伊东浩 2 nr
+伊东美 3 ns
+伊丝塔 2 nr
+伊丝塔尔 2 nr
+伊丹 3 ns
+伊丽娜 4 nr
+伊丽沙 2 nr
+伊丽莎白 134 nr
+伊丽莎白港 6 ns
+伊丽道 2 nr
+伊于胡底 3 nr
+伊亚德 3 nr
+伊人 34 nrt
+伊代尔群 3 nr
+伊伦 4 nr
+伊伯尔 3 nr
+伊何底止 3 n
+伊儿汗 23 nr
+伊克哈 4 nrt
+伊克塔 2 nr
+伊克塞 2 nr
+伊克巴尔 7 nrt
+伊克昭盟 65 ns
+伊兰 27 ns
+伊兰伊 3 nr
+伊兰咬 2 nr
+伊兰特 3 nz
+伊兹密 12 nr
+伊兹密尔 14 nr
+伊兹尼 3 nr
+伊兹梅 2 nr
+伊兹梅尔 3 nrt
+伊凡 75 nr
+伊凡诺 12 nr
+伊凡诺夫 3 nrt
+伊凡雷 14 nr
+伊利 269 nz
+伊利亚 4 ns
+伊利亚特 8 nrt
+伊利哇拉 3 ns
+伊利埃斯库 2 nz
+伊利斯 3 ns
+伊利湖 46 ns
+伊利石 7 nr
+伊利耶 2 nr
+伊利莎白 4 nr
+伊利诺 20 nr
+伊利诺伊 20 nrt
+伊利诺伊大学 11 nz
+伊利诺伊州 22 ns
+伊利诺斯 4 nrt
+伊利诺斯州 4 ns
+伊利运河 3 ns
+伊力特 6 nr
+伊力诺 3 nr
+伊加尔 4 nr
+伊努语 2 nr
+伊势湾 5 nr
+伊勒 5 nz
+伊勒呼里山 7 ns
+伊化 2 nz
+伊博族 4 nz
+伊博语 3 nz
+伊卜拉欣 5 nr
+伊卡 2 ns
+伊卡萨 2 nr
+伊司马仪 4 nz
+伊合瓦 2 nr
+伊吾 41 nr
+伊吾军 4 nr
+伊吾卢 5 nr
+伊吾县 3 ns
+伊吾唐 2 nz
+伊吾城 3 ns
+伊吾屯 6 ns
+伊吾庐 2 nr
+伊吾郡 7 nr
+伊哈尼 2 nr
+伊哈桑 3 nr
+伊图尔 3 nr
+伊图里河 8 ns
+伊基克 5 nz
+伊基托斯 8 nrt
+伊堪怀 2 nr
+伊塔 20 nrt
+伊塞克 5 nr
+伊塞克湖 22 ns
+伊塞尔 3 nr
+伊塞顿 10 ns
+伊壁 5 ns
+伊壁鸠鲁 3 v
+伊士曼 3 nr
+伊士曼柯达公司 2 ns
+伊夫 6 nrt
+伊夫堡 7 nr
+伊夫尼 3 nr
+伊夫蒂卡尔 2 nrt
+伊奈恭子 3 nr
+伊奥利 4 nr
+伊奥娜 2 nr
+伊奥尼亚 8 ns
+伊奥尼亚海 9 ns
+伊奥斯 3 nr
+伊妹儿 2 nr
+伊姆雷 8 nr
+伊始 145 nz
+伊娃 4 nr
+伊子亦 2 nr
+伊季山 2 nr
+伊宁 32 ns
+伊宁县 6 ns
+伊宁市 22 ns
+伊尔 364 nrt
+伊尔库茨克 25 nrt
+伊尔库茨克州 7 nrt
+伊尔根 19 nz
+伊尔格斯 4 nrt
+伊尔汉 3 nr
+伊尔汗 3 nr
+伊尔河 2 ns
+伊尔金斯基 2 nrt
+伊尹活 3 nr
+伊尹相 2 nr
+伊尼扬 3 nr
+伊尼格 3 nr
+伊山德 2 nr
+伊岭岩 3 nr
+伊川 18 ns
+伊川县 8 ns
+伊州 4 ns
+伊州纳 2 ns
+伊巴 4 ns
+伊巴丹 10 ns
+伊巴利 2 ns
+伊巴尼 2 nr
+伊巴河 2 ns
+伊布拉 20 nrt
+伊希斯 3 nr
+伊庇罗 16 nr
+伊庇鲁 8 nr
+伊底帕斯 3 nrt
+伊康 5 nz
+伊延普 2 nr
+伊德 10 nrt
+伊德拉 6 nr
+伊德里斯 17 nrt
+伊德里西 4 nrt
+伊戈尔 27 nr
+伊成格 3 nr
+伊拉 21 nrt
+伊拉克 2671 nrt
+伊拉克人 40 nrt
+伊拉克共和国 8 ns
+伊拉克政府 3 nt
+伊拉克队 3 nz
+伊拉克阿拉伯复兴社会党 2 nt
+伊拉姆 6 nrt
+伊拉斯 4 ns
+伊拉苏 2 ns
+伊文 2 nz
+伊文思 10 nr
+伊文斯 13 nr
+伊斯 15 ns
+伊斯克杰 2 nrt
+伊斯兰 686 ns
+伊斯兰会议组织 6 nt
+伊斯兰共和国 5 ns
+伊斯兰堡 61 ns
+伊斯兰式 3 nz
+伊斯兰教 1877 nz
+伊斯兰教协会 256 nz
+伊斯兰教历 9 nz
+伊斯哈 4 nz
+伊斯坎 4 nr
+伊斯坎德尔 4 nrt
+伊斯坦堡 3 ns
+伊斯坦布尔 108 nrt
+伊斯塔 2 nrt
+伊斯巴 6 nrt
+伊斯帕 15 nr
+伊斯帕尼奥拉岛 11 nrt
+伊斯帕诺 2 nrt
+伊斯拉 4 nrt
+伊斯曼 6 nr
+伊斯梅 5 nr
+伊斯梅利亚 9 ns
+伊斯梅尔 22 nrt
+伊斯河 2 ns
+伊斯法 2 nz
+伊斯法罕 40 nz
+伊斯灵 2 nr
+伊斯特 50 nrt
+伊斯特拉 3 nrt
+伊斯玛 19 nr
+伊斯肯 6 nr
+伊斯顿 6 nrt
+伊方 15 nz
+伊施波 2 nr
+伊春 20 nr
+伊春区 3 ns
+伊春市 18 ns
+伊普斯 3 nr
+伊普斯威奇 3 nrt
+伊曼 2 nr
+伊曼式 3 nz
+伊曼纽尔 8 nz
+伊朗 3820 ns
+伊朗人 55 nrt
+伊朗伊斯兰共和国 7 ns
+伊朗伊斯兰共和国通讯社 4 nt
+伊朗外交部 39 nt
+伊朗政府 41 nt
+伊朗核 3 nr
+伊朗议会 2 nt
+伊朗语 42 nz
+伊朗队 51 nz
+伊朗高原 3 ns
+伊本吉 2 nr
+伊松佐 2 nr
+伊林 8 nz
+伊柳塞 4 nr
+伊柳申 8 nr
+伊格 2 nrt
+伊格尔 5 nr
+伊格尔森 18 nrt
+伊格尔顿 3 nrt
+伊格林 2 nr
+伊格纳 3 nr
+伊格纳季耶夫 5 nrt
+伊格莱西亚斯 2 nrt
+伊桑 23 nrt
+伊桑阿 5 nr
+伊梅里 3 nr
+伊比 2 nrt
+伊比利 3 ns
+伊比利亚 122 ns
+伊比利亚人 25 nrt
+伊比利半 3 nr
+伊比比奥 3 nrt
+伊永文 2 nr
+伊沃 4 nz
+伊沃尔金 2 nrt
+伊沙 3 ns
+伊沙克 13 ns
+伊河 5 ns
+伊泰普 13 nr
+伊泰莲娜 3 nr
+伊泽尔 3 nr
+伊泽特贝戈维奇 2 ns
+伊洛克 5 nr
+伊洛夫 2 nr
+伊洛娃 6 nr
+伊洛斯 2 nr
+伊洛河 5 ns
+伊洛潘 3 nr
+伊洛瓦底 4 nrt
+伊洛瓦底江 47 ns
+伊海军 4 nr
+伊涅斯塔 5 nrt
+伊热夫 2 nr
+伊热夫斯克 4 nz
+伊特 30 nrt
+伊特拉 5 nrt
+伊特鲁 6 nr
+伊犁 338 ns
+伊犁哈萨克自治州 14 ns
+伊犁地区 24 ns
+伊犁州 3 ns
+伊犁河 91 ns
+伊犁河谷 22 ns
+伊犁马 9 ns
+伊王 2 nrt
+伊玛 4 nrt
+伊玛姆 2 nr
+伊玛尼 6 nr
+伊玛目 67 nr
+伊琳娜 2 nr
+伊瑟尔 2 nrt
+伊璜兄 2 nr
+伊瓜苏 26 ns
+伊瓦尔沃 2 nrt
+伊瓦绍 3 nr
+伊瓦绍夫 2 nr
+伊甸 3 ns
+伊甸乐园 3 ns
+伊甸园 41 ns
+伊留申 7 nr
+伊登 17 nrt
+伊盟 13 ns
+伊福玻 2 nr
+伊秉绶 5 nr
+伊科 4 nz
+伊米尔 5 nr
+伊索 25 ns
+伊索克拉 5 nrt
+伊红 3 nz
+伊纳克 2 nr
+伊纳爵 3 nr
+伊罗戈 2 nr
+伊美军 9 nr
+伊美姬 3 nr
+伊美姬网 3 nr
+伊美尔 3 nr
+伊肯斯 2 nr
+伊能静 3 nr
+伊苏 3 ns
+伊苏斯 2 ns
+伊茨 3 nrt
+伊莉莎 3 nrt
+伊莉莎白 4 nr
+伊莎贝尔 16 nrt
+伊莎贝拉 20 nrt
+伊莫拉 3 nrt
+伊莱 5 nrt
+伊莱克斯 2 nrt
+伊莱博 4 nr
+伊莱索 8 nr
+伊莱索斯 4 nrt
+伊莲娜 3 nr
+伊菲亚 16 nr
+伊菲格 5 nr
+伊萨 9 ns
+伊萨伊 2 nr
+伊萨克 9 nz
+伊萨凯 3 nr
+伊萨卡 2 nr
+伊萨尔 7 nr
+伊萨尔河 4 ns
+伊萨尔科 2 nz
+伊萨巴尔 2 nrt
+伊萨科夫 3 nrt
+伊萨贝尔 2 nz
+伊萨贝拉 4 nrt
+伊蒂哈 40 nrt
+伊蒂哈德 3 nrt
+伊蕾娜 2 nr
+伊藤俊介 3 nr
+伊藤傅文 2 nr
+伊藤公式 3 nr
+伊藤博 17 nr
+伊藤博文 203 nr
+伊藤忠 5 nr
+伊藤润二 3 nr
+伊藤秀介 3 nr
+伊藤过程 3 nr
+伊蚊 19 nr
+伊西德罗 3 nrt
+伊西斯 11 ns
+伊西莱 3 nr
+伊诺努 9 nr
+伊诺特 4 nr
+伊豆 14 nz
+伊贝母 3 nr
+伊赛克 5 nr
+伊赫万 3 nr
+伊达 12 nz
+伊达尔戈 19 nrt
+伊达戈 4 nr
+伊迪丝 3 nr
+伊迪卡拉 9 nrt
+伊逊河 4 nr
+伊通 5 nz
+伊通河 4 ns
+伊通满族自治县 2 ns
+伊通社 2 nt
+伊都锦 3 nr
+伊采夫 15 nr
+伊里亚 11 ns
+伊里亚特 3 nrt
+伊里奇 6 nr
+伊里安 30 ns
+伊里安查亚 8 ns
+伊里齐 2 nr
+伊金霍 3 nr
+伊金霍洛旗 9 ns
+伊阿古 5 ns
+伊阿宋 11 nr
+伊韦尔 2 nr
+伊顿 13 ns
+伊顿公 17 nr
+伊麻尼 3 nr
+伊龙 2 nz
+伋 6 zg
+伍 540 nr
+伍万 3 nr
+伍世文 4 nr
+伍中豪 2 nr
+伍丹戈 4 nr
+伍之清 2 nr
+伍人相 2 nr
+伍伦贡 2 nr
+伍修权 4 nr
+伍元 3 m
+伍先生 2 nr
+伍兹堡 4 nr
+伍兹霍 8 nr
+伍卫国 3 nr
+伍员山 3 nr
+伍咏薇 3 nrfg
+伍增荣 256 nr
+伍奢 8 nr
+伍子管 2 nr
+伍子胥 376 nr
+伍学焱 3 nr
+伍宇娟 3 nr
+伍家岗区 256 nr
+伍将军 2 nr
+伍尔夫 5 nr
+伍崇曜 2 nr
+伍应星 3 nr
+伍廷芳 243 nr
+伍德华 8 nr
+伍德合金 3 nr
+伍德斯 2 nr
+伍德沃 8 nr
+伍德罗 21 nr
+伍思凯 3 nr
+伍拾 3 nr
+伍斯特 14 nr
+伍斯特郡 3 nr
+伍淑清 2 nrfg
+伍献文 2 nr
+伍珀塔尔 2 nrt
+伍等 2 m
+伍组合 2 nr
+伍绍祖 19 nr
+伍联德 2 nr
+伍荣彰 2 nr
+伍蠡甫 3 nr
+伍贤标 6 nr
+伍连德 3 nr
+伍遵契 2 nr
+伍长德 2 nr
+伍麦叶 8 nr
+伍龙章 2 nr
+伎 224 ng
+伎两 3 n
+伎俩 152 n
+伏 2420 v
+伏一军 2 nr
+伏下去 3 t
+伏下来 3 t
+伏两军 3 nr
+伏丹墀 2 nr
+伏乾归 12 nr
+伏于其 2 nr
+伏于寨 4 nr
+伏于山 5 nr
+伏于蒿 2 nr
+伏于阶 3 nr
+伏伊伏丁那 6 ns
+伏低做小 3 l
+伏侍 170 v
+伏侍凤 3 nr
+伏侍唐 6 nr
+伏侍姐姐 2 nr
+伏侍宝玉 5 nr
+伏侍贾 4 nr
+伏侍黛 3 nr
+伏俟城 4 nr
+伏倒 3 v
+伏公府 3 nr
+伏兵 225 nr
+伏击 185 v
+伏击圈 14 n
+伏击战 26 n
+伏到 3 v
+伏卢氏 2 nr
+伏卧 8 nr
+伏司繁 4 nr
+伏后仰 5 nr
+伏启奏 2 nr
+伏国仁 10 nr
+伏在峰 2 nr
+伏在水 3 nr
+伏在沙 2 nr
+伏在石 2 nr
+伏在钟 2 nr
+伏在鞍 3 nr
+伏地 6 ns
+伏地圣人 3 nr
+伏地挺身 3 nr
+伏坦 5 ns
+伏坦主 2 nr
+伏天 31 t
+伏契克 4 nr
+伏妖 3 n
+伏威自 2 nr
+伏季 3 t
+伏季休渔 3 nr
+伏安 15 ns
+伏安图 3 nr
+伏安表 3 nr
+伏安计 3 nr
+伏尔加 86 nr
+伏尔加格勒 20 ns
+伏尔加河 205 ns
+伏尔塔 4 nr
+伏尔塔瓦河 10 ns
+伏尔泰 76 nr
+伏尔特 2 nr
+伏尔甘 3 nr
+伏尔肯 2 nr
+伏尔铿 5 nr
+伏尸遍野 3 n
+伏尼契 4 nr
+伏山 2 ns
+伏左 2 ns
+伏帖 3 nr
+伏念臣 8 nr
+伏惟 2 nr
+伏惟力 2 nr
+伏惟尚 2 nr
+伏惟照 2 nr
+伏斯基 2 nr
+伏方腊 2 nr
+伏日 3 t
+伏旱 16 nr
+伏明霞 267 nr
+伏暑 4 nr
+伏暮末 4 nr
+伏案 51 n
+伏案写作 3 n
+伏案疾书 3 n
+伏水 2 ns
+伏汛 11 nr
+伏沙 2 ns
+伏法 10 nr
+伏法受诛 3 n
+伏波山 3 nr
+伏流 37 n
+伏炽磐 8 nr
+伏牛 68 nr
+伏牛山 138 ns
+伏特 76 nr
+伏特加 32 nr
+伏特加酒 3 nr
+伏特计 3 nr
+伏玛格 4 nr
+伏生授 3 nr
+伏白首 2 nr
+伏皇后 11 nr
+伏笔 62 n
+伏罗希 9 nr
+伏罪 17 nz
+伏羲 86 nr
+伏羲女娲 2 nr
+伏羲庙 5 nr
+伏羲氏 14 nr
+伏羲考 2 nr
+伏羲陵 2 nr
+伏而咶天 3 v
+伏脉 7 ns
+伏苓 2 nr
+伏藏 6 ns
+伏虎 38 nr
+伏虎寺 3 nr
+伏虎式 2 nr
+伏虎拳 8 nr
+伏虎掌 15 nr
+伏虎罗汉 3 ns
+伏虎降 2 nr
+伏虎降龙 3 nr
+伏诛 24 n
+伏象 2 n
+伏贴 4 n
+伏路 11 ns
+伏路军 6 nr
+伏身 3 v
+伏辩 4 nr
+伏连筹 2 nr
+伏道傍 2 nr
+伏首 3 ns
+伏首称臣 3 nr
+伏首贴耳 3 nr
+伏魔剑 2 nr
+伏魔功 5 nr
+伏魔圈 4 nr
+伏魔录 3 nr
+伏魔拳 2 nr
+伏魔真 2 nr
+伏麒麟 2 nr
+伏龙凤雏 3 nr
+伏龙寺 4 nr
+伏龙涅 2 nr
+伏龙肝 3 n
+伏龙芝 12 nr
+伏龙芝军事学院 8 nt
+伐 1175 v
+伐冰之家 3 n
+伐功矜能 3 vn
+伐区 5 n
+伐善 3 v
+伐异党同 3 n
+伐性之斧 3 n
+伐木 87 n
+伐木业 3 n
+伐木区 3 n
+伐木场 2 n
+伐木工 3 n
+伐木工人 3 n
+伐木者 5 n
+伐柯 3 n
+伐树 6 n
+伐毛换髓 3 n
+伐毛洗髓 3 n
+伐罪吊人 3 n
+伐罪吊民 3 n
+休 2320 zg
+休业 3 v
+休业式 3 n
+休书 21 v
+休伊 18 nrt
+休伊特 97 nrt
+休休有容 3 n
+休会 49 v
+休会期 3 vn
+休会期间 3 n
+休伦 12 nrt
+休伦湖 28 ns
+休假 227 v
+休假日 3 t
+休克 281 nrt
+休兵 27 v
+休兵罢战 3 nz
+休养 237 v
+休养地 8 n
+休养城市 3 n
+休养所 3 n
+休养生息 82 n
+休养院 3 nz
+休刊 3 v
+休到 3 v
+休博会 3 n
+休士顿 3 nrt
+休声美誉 3 i
+休姆 6 nrt
+休学 67 n
+休学在家 3 n
+休宁 11 ns
+休宁县 10 ns
+休工 3 v
+休市 5 v
+休庭 8 n
+休得 3 v
+休怪 3 v
+休息 3825 v
+休息区 55 n
+休息厅 11 n
+休息天 5 t
+休息室 117 nz
+休息日 59 t
+休息时间 3 i
+休息权 2 v
+休息痢 2 n
+休息袋 3 nz
+休想 190 v
+休憩 51 v
+休战 81 v
+休戚 9 n
+休戚与共 11 i
+休戚相关 22 i
+休整 196 vn
+休斯 120 nrt
+休斯敦 92 ns
+休斯敦大学 4 nt
+休斯顿 34 nrt
+休明盛世 3 ns
+休止 50 v
+休止符 14 n
+休渔 3 v
+休火山 3 ns
+休牛归马 3 i
+休牛放马 3 nz
+休牛散马 3 i
+休班 5 v
+休眠 91 v
+休眠期 18 t
+休眠火山 12 n
+休眠状态 16 n
+休眠芽 4 n
+休耕 3 v
+休耕地 4 i
+休要 3 v
+休课 3 v
+休谟 3 ns
+休达 5 v
+休闲 1114 v
+休闲业 3 n
+休闲包 3 i
+休闲吧 3 n
+休闲地 9 i
+休闲型 5 n
+休闲形态 3 i
+休闲服 12 v
+休闲椅 3 n
+休闲活动 3 i
+休闲游 29 v
+休闲游戏 18 i
+休闲类 3 i
+休闲装 20 v
+休闲裤 3 n
+休闲鞋 5 i
+伒 41 zg
+伓 61 zg
+伔 31 zg
+伕 86 zg
+伖 6 zg
+众 11353 ng
+众乡亲 6 n
+众人 9329 n
+众人国士 3 n
+众人广坐 3 i
+众人拾柴火焰高 4 i
+众人皆知 3 i
+众人皆醉 3 i
+众位 3 m
+众体 3 n
+众信 14 n
+众军 3 n
+众则难摧 3 i
+众判亲离 3 n
+众叛亲离 59 i
+众口 51 n
+众口一声 3 i
+众口一词 159 i
+众口一辞 12 i
+众口交传 3 i
+众口交赞 3 i
+众口同声 3 i
+众口嗷嗷 3 i
+众口如一 3 i
+众口烁金 3 i
+众口熏天 3 l
+众口相传 3 i
+众口纷纭 3 i
+众口铄金 6 i
+众口销金 3 n
+众口难调 2 i
+众啄同音 3 v
+众喣山动 3 nz
+众喣漂山 3 n
+众喣飘山 3 l
+众城 2 n
+众多 4769 m
+众多乡 2 m
+众多人口 3 m
+众多名 3 m
+众多文 5 m
+众多盆 2 m
+众多股 2 m
+众多部 3 m
+众多非一 3 i
+众好众恶 3 i
+众好必察 3 l
+众妙 3 n
+众家 77 n
+众寡 3 n
+众寡不敌 17 i
+众寡势殊 3 i
+众寡悬殊 22 i
+众寡悬绝 3 i
+众将 560 n
+众将士 3 n
+众少成多 3 l
+众川赴海 3 i
+众心 34 n
+众心如城 3 i
+众心成城 3 i
+众志成城 30 n
+众怒 27 n
+众怒难任 3 i
+众怒难息 3 i
+众怒难犯 7 i
+众怨之的 3 l
+众恶必察 3 l
+众所共知 3 i
+众所周知 339 i
+众所曙目 3 vn
+众所瞩目 3 i
+众擎易举 3 i
+众数 3 m
+众星 10 n
+众星拱北 3 i
+众星拱月 5 i
+众星拱极 3 i
+众星捧月 400 i
+众星攒月 3 i
+众星环极 3 n
+众智 3 n
+众望 35 n
+众望所归 50 i
+众望所盼 3 i
+众望攸归 3 i
+众毁销骨 3 n
+众毛攒裘 3 i
+众毛飞骨 3 i
+众流归海 3 i
+众犬吠声 3 i
+众生 107 n
+众生像 3 n
+众生相 9 n
+众目 3 n
+众目共睹 3 i
+众目共视 3 i
+众目具瞻 3 i
+众目四望 3 i
+众目昭彰 2 i
+众目照彰 3 i
+众目睽睽 112 i
+众盲摸象 3 n
+众矢之地 3 i
+众矢之的 47 i
+众虎同心 3 i
+众街坊 3 nz
+众议 3 n
+众议员 97 n
+众议成林 3 n
+众议院 491 n
+众说不一 12 i
+众说纷揉 3 i
+众说纷纭 83 i
+众谋佥用 3 n
+众醉独醒 3 i
+众采众说 3 i
+众院 19 n
+众难群疑 3 i
+众难群移 3 i
+众鸟蔽日 3 i
+优 1486 n
+优于 532 v
+优价 2 n
+优会价 3 n
+优伶 75 z
+优先 1204 vn
+优先化 3 n
+优先发展 3 l
+优先方法 3 n
+优先权 64 n
+优先照顾 3 i
+优先级 25 b
+优先股 11 n
+优先购买 3 l
+优先选择 3 l
+优利欧 3 n
+优劣 403 a
+优劣势 3 l
+优势 5811 n
+优势互补 3 i
+优势产业 3 n
+优势种群 3 l
+优化 952 vn
+优化大师 3 n
+优化组合 3 n
+优化结构 3 n
+优厚 129 a
+优哉 3 a
+优哉游哉 19 l
+优哩婆湿 4 nz
+优妮姿 3 n
+优孟 257 nrt
+优孟衣冠 3 n
+优容 3 n
+优尼科 3 nz
+优异 533 a
+优异性 3 n
+优异成绩 3 l
+优异者 8 n
+优弧 3 n
+优待 225 v
+优待券 3 n
+优待票 3 n
+优待证 3 n
+优待金 5 n
+优惠 1166 vn
+优惠价 6 n
+优惠价格 3 n
+优惠供应 3 l
+优惠关税 3 l
+优惠券 9 n
+优惠卡 16 n
+优惠卷 3 n
+优惠待遇 34 l
+优惠政策 3 n
+优惠期 2 n
+优惠机票 3 n
+优惠权 3 n
+优惠条件 3 n
+优惠活动 3 l
+优惠证 5 n
+优惠酬宾 3 n
+优抚 36 n
+优抚对象 9 n
+优抚工作 3 n
+优抚金 3 n
+优昙一现 3 v
+优材生 3 n
+优柔 8 a
+优柔寡断 53 i
+优派 2 n
+优流 3 n
+优渥 10 a
+优游 10 vn
+优游不断 3 l
+优游卒岁 3 i
+优游岁月 3 n
+优游涵泳 3 n
+优游自在 3 l
+优游自如 3 i
+优游自得 3 l
+优游自若 3 i
+优游自适 3 l
+优点 1302 n
+优特 2 a
+优生 45 b
+优生优育 21 l
+优生学 42 n
+优生法 3 n
+优百特 3 n
+优盘 4 n
+优礼有加 6 l
+优秀 5256 a
+优秀人才 3 n
+优秀企业 3 n
+优秀作品 3 n
+优秀作家 3 n
+优秀儿女 3 n
+优秀党员 3 n
+优秀分子 3 n
+优秀员工 3 n
+优秀品格 3 n
+优秀品质 3 n
+优秀团员 3 n
+优秀奖 33 n
+优秀学生 3 n
+优秀干部 3 n
+优秀成果 3 n
+优秀教师 3 n
+优秀率 2 n
+优秀生 30 n
+优秀者 29 n
+优秀论文 3 n
+优秀青年 3 n
+优种 163 n
+优等 28 b
+优等品 3 n
+优等奖 3 n
+优等生 18 b
+优素福 11 nrt
+优絮 3 n
+优级 3 b
+优缺点 37 n
+优美 1075 a
+优美加 3 l
+优美环境 3 l
+优者 3 n
+优育 3 vn
+优胜 365 v
+优胜劣汰 62 l
+优胜劣败 19 l
+优胜奖 10 n
+优胜者 83 n
+优胜者杯 9 n
+优胜队 3 n
+优良 3378 z
+优良传统 3 n
+优良作风 3 l
+优良单株 3 l
+优良品种 3 n
+优良性 3 n
+优良率 3 n
+优虎降龙 3 n
+优裕 64 a
+优贤扬历 3 l
+优贤飏历 3 v
+优质 2525 n
+优质产品 3 n
+优质优价 6 n
+优质化 2 vn
+优质品 4 n
+优质服务 3 n
+优质棉 9 n
+优质稻 8 n
+优质课 3 n
+优质钢 3 n
+优越 1073 a
+优越性 252 b
+优越感 116 b
+优选 58 v
+优选法 14 n
+优遇 14 n
+优酪乳 3 n
+优酸乳 3 n
+优钢 3 n
+优闲 18 z
+优降糖 3 n
+优雅 425 a
+优雅兰 3 nrt
+优雅风度 3 n
+优龙凤雏 3 n
+伙 1298 n
+伙伴 1611 n
+伙伴儿 3 n
+伙伴关系 3 n
+伙伴国 10 n
+伙同 49 n
+伙同他人 3 n
+伙夫 37 n
+伙头 2 n
+伙头军 3 n
+伙子 3 n
+伙房 53 n
+伙犯 3 n
+伙计 496 n
+伙食 161 n
+伙食团 3 n
+伙食费 57 n
+会 92091 v
+会上 2076 t
+会上会下 3 n
+会东 5 n
+会东县 3 ns
+会主 2 n
+会付 3 v
+会仙楼 2 n
+会众 87 n
+会会 3 n
+会做人 4 n
+会儿 392 n
+会元 8 q
+会党 52 n
+会典 3 n
+会分 3 n
+会刊 23 n
+会前 87 t
+会剿 3 v
+会务 45 n
+会务费 6 n
+会动 3 n
+会升 3 v
+会卡 3 n
+会厅 3 n
+会厌 17 v
+会厌软骨 5 n
+会去 3 t
+会友 38 n
+会合 551 v
+会合处 8 n
+会合点 8 n
+会同 859 n
+会同县 7 n
+会后 750 t
+会员 1196 n
+会员中心 3 n
+会员价 3 n
+会员制 30 n
+会员区 3 n
+会员单位 3 n
+会员卡 14 n
+会员号 3 n
+会员名 3 n
+会员名单 3 n
+会员团 3 n
+会员国 161 n
+会员大会 3 n
+会员帐号 3 n
+会员版 3 n
+会员证 4 n
+会员费 12 n
+会员资料 3 n
+会商 73 n
+会地 3 n
+会场 813 n
+会址 327 n
+会堂 47 n
+会填 3 v
+会够 3 v
+会头 3 n
+会头银 3 n
+会子 3 n
+会宁 53 ns
+会宁县 2 ns
+会审 323 n
+会客 24 n
+会客厅 17 n
+会客室 85 n
+会家不忙 3 l
+会密 2 n
+会少离多 3 n
+会展 190 vn
+会展业 12 n
+会展中心 3 n
+会展经济 8 n
+会展网 3 n
+会师 349 n
+会庆 3 t
+会底银 3 n
+会弹 3 n
+会徽 24 ns
+会心 61 n
+会心一笑 3 l
+会心微笑 3 n
+会意 324 n
+会意字 3 n
+会战 502 n
+会所 39 n
+会扣 3 n
+会报 3 n
+会指 3 n
+会播 3 vn
+会操 8 n
+会教 3 n
+会旗 20 n
+会时常 3 t
+会昌 34 ns
+会昌县 5 ns
+会晒 3 v
+会晤 663 v
+会服 3 n
+会期 50 t
+会来 3 t
+会标 134 n
+会款 3 n
+会歌 9 n
+会水 3 n
+会泽 9 n
+会泽县 2 ns
+会派 80 n
+会演 51 n
+会点 3 n
+会理 22 n
+会理县 2 n
+会生 3 n
+会用 3 n
+会画 3 n
+会盟 75 n
+会社 57 n
+会票 3 n
+会种 3 n
+会稽山 20 ns
+会稽王 7 n
+会稿 3 n
+会站 3 n
+会章 4 n
+会签 26 n
+会管 3 n
+会籍 3 n
+会约 3 n
+会考 67 v
+会者不忙 3 l
+会者不难 3 l
+会聚 91 v
+会聚波 3 n
+会聚透镜 5 n
+会萃 3 v
+会见 1940 n
+会见室 3 n
+会见者 3 n
+会计 1473 v
+会计专业 3 n
+会计业 2 n
+会计人员 3 n
+会计代理 3 n
+会计信息 3 n
+会计公司 3 n
+会计准则 3 n
+会计凭证 3 n
+会计分录 3 n
+会计制度 3 n
+会计员 3 n
+会计处 6 n
+会计学 78 n
+会计学院 3 n
+会计室 7 n
+会计工作 3 n
+会计师 567 n
+会计年度 3 n
+会计报告 3 n
+会计报表 3 n
+会计核算 3 n
+会计法 13 n
+会计科目 3 n
+会计簿 3 n
+会计簿册 3 v
+会计系 25 n
+会计统计 3 n
+会计网 3 n
+会计职称 3 n
+会计论文 3 n
+会计证 8 n
+会计课 3 n
+会计账 3 n
+会计部 3 n
+会议 28363 n
+会议主题 3 n
+会议厅 45 n
+会议员 20 n
+会议室 594 n
+会议局 3 n
+会议展览 3 n
+会议录 3 n
+会议桌 28 n
+会议礼品 3 n
+会议纪要 3 n
+会议议程 3 n
+会议记录 3 n
+会议记要 3 n
+会议费 10 n
+会诊 94 v
+会试 476 n
+会话室 3 n
+会话层 3 n
+会话式 6 n
+会说会写 3 n
+会谈 1699 v
+会谈纪要 3 n
+会谈记要 3 n
+会账 3 n
+会费 60 n
+会费额 3 n
+会车 3 n
+会通 157 n
+会逢其适 3 l
+会道能说 3 n
+会道门 25 n
+会钞 3 n
+会错意 3 n
+会长 1625 n
+会阳 3 n
+会阴 44 n
+会阴部 3 n
+会集 82 n
+会面 231 n
+会面处 3 n
+会面时 12 n
+会风 7 n
+会餐 452 n
+会馆 204 n
+会首 19 n
+会齐 3 t
+伛 6 v
+伛偻 4 v
+伛偻病 3 vn
+伝 16 zg
+伞 1062 n
+伞兵 298 n
+伞兵团 25 n
+伞兵部队 3 n
+伞具 3 n
+伞包 4 n
+伞型 2 b
+伞套 3 n
+伞形 45 n
+伞形天线 3 n
+伞形花序 35 n
+伞投 3 v
+伞架 4 n
+伞柄 3 n
+伞状 31 n
+伞盖 172 n
+伞索 3 n
+伞罩 3 n
+伞菌 16 n
+伞衣 11 n
+伞降 37 v
+伞面 3 n
+伞齿轮 8 n
+伟 398 zg
+伟业 94 n
+伟人 186 n
+伟伦 2 nz
+伟力 8 n
+伟哥 75 n
+伟大 4150 a
+伟大事业 3 nz
+伟大光荣 3 nz
+伟大工程 3 nz
+伟大意义 3 nz
+伟大成就 3 n
+伟大旗帜 3 n
+伟大祖国 3 n
+伟大胜利 3 nz
+伟大领袖 3 n
+伟岸 27 n
+伟康 3 a
+伟晶岩 57 n
+伟民 22 n
+伟绩 8 n
+伟绩丰功 3 n
+伟航 3 nz
+伟论 3 n
+伟达 2 a
+传 10664 n
+传上 3 v
+传上去 3 v
+传上来 3 v
+传下 3 v
+传下去 3 v
+传下来 3 v
+传不到 3 v
+传世 547 n
+传世之作 14 i
+传中 156 v
+传中球 13 n
+传为 3 v
+传为佳话 20 l
+传为笑柄 3 i
+传为笑谈 3 i
+传为美谈 26 i
+传主 25 v
+传之其人 3 i
+传习 46 v
+传习录 3 n
+传习所 18 n
+传书 3 n
+传书鸽 3 n
+传人 260 n
+传代 20 n
+传代培养 3 n
+传令 527 n
+传令兵 6 n
+传传 3 vn
+传位 3 n
+传信 3 v
+传信鸽 3 n
+传入 1139 v
+传入神经 25 l
+传出 970 v
+传出去 3 v
+传出神经 27 n
+传到 891 v
+传制权 3 n
+传功 3 n
+传功长老 3 n
+传动 476 vn
+传动件 3 n
+传动力 3 n
+传动带 3 n
+传动比 12 n
+传动系统 3 n
+传动装置 2 n
+传动轴 11 n
+传动链 3 n
+传化 4 vn
+传单 175 n
+传去 3 v
+传号 3 n
+传名 3 v
+传告 3 n
+传呼 399 v
+传呼台 3 n
+传呼机 5 n
+传呼电话 3 l
+传唤 98 v
+传唱 65 v
+传回 64 v
+传国 3 n
+传圭袭组 3 n
+传声 14 n
+传声器 25 n
+传声器阵列 2 l
+传声筒 18 n
+传奇 924 n
+传奇一生 3 i
+传奇三 3 i
+传奇世界 3 nz
+传奇人物 3 n
+传奇幻想 3 i
+传奇式 8 n
+传奇性 20 n
+传奇色彩 3 n
+传奇论坛 3 n
+传媒 1040 n
+传媒业 25 n
+传媒大学 3 n
+传媒界 3 n
+传媒网 3 n
+传子 3 n
+传宗 3 n
+传宗接代 35 i
+传审 3 v
+传家 21 n
+传家之宝 11 i
+传家宝 15 n
+传对 3 v
+传导 298 n
+传导体 3 n
+传导冷却 3 l
+传导性 14 n
+传导率 3 n
+传导电流 3 n
+传布 102 v
+传帮带 7 n
+传开 140 v
+传得 3 v
+传情 24 n
+传感 30 n
+传感器 487 n
+传戒 3 n
+传扬 79 v
+传承 225 v
+传承文明 3 n
+传承者 3 n
+传抄 87 v
+传报 3 n
+传捷报 3 n
+传授 859 n
+传授法 3 n
+传授给 3 i
+传接 11 v
+传接球 15 n
+传播 3877 vn
+传播业 4 n
+传播价值 3 n
+传播声音 3 n
+传播媒介 3 n
+传播媒体 2 n
+传播学 37 n
+传播学系 3 n
+传播学院 3 n
+传播常数 3 n
+传播常量 3 n
+传播效应 3 n
+传播方式 2 n
+传播界 3 n
+传播网 3 n
+传播者 164 n
+传播速度 3 n
+传教 307 n
+传教士 334 n
+传旨 3 n
+传曼特 3 nz
+传本 3 n
+传来 2337 v
+传来传去 3 l
+传杯换盏 3 n
+传柄移藉 3 nz
+传染 282 vn
+传染性 167 n
+传染扩散 3 n
+传染期 2 n
+传染源 37 n
+传染病 529 n
+传染科 5 n
+传染给 3 n
+传标 3 n
+传檄而定 3 z
+传毒 3 n
+传灯 2 n
+传热 84 v
+传热介质 2 n
+传热学 11 n
+传热性 3 n
+传热系数 3 n
+传爵袭紫 3 nr
+传球 343 n
+传球法 3 n
+传电 3 n
+传略 9 n
+传看 3 v
+传真 451 v
+传真件 2 n
+传真号码 3 n
+传真机 29 n
+传真照片 3 n
+传真电报 3 nz
+传真电话 3 l
+传真纸 3 n
+传神 153 n
+传神写照 2 n
+传神阿堵 3 i
+传票 28 n
+传种 10 n
+传种接代 3 n
+传粉 43 n
+传经 34 n
+传经授道 3 l
+传经送宝 3 n
+传给 494 v
+传统 11445 n
+传统习俗 3 n
+传统产业 3 n
+传统化 3 n
+传统医学 3 n
+传统友谊 3 nz
+传统名称 3 n
+传统型 12 n
+传统媒体 3 n
+传统工艺 3 n
+传统式 12 n
+传统性 9 n
+传统意义 2 n
+传统戏 23 n
+传统服装 3 n
+传统模式 2 l
+传统武术 3 n
+传统相机 3 n
+传统美德 3 nz
+传统节日 3 n
+传统节目 3 n
+传统观念 3 n
+传绯闻 3 v
+传美版 3 n
+传自 3 v
+传艺 18 n
+传衣钵 3 n
+传观 3 n
+传言 349 n
+传讯 83 n
+传记 404 n
+传记小说 3 l
+传记文学 3 n
+传记片 4 n
+传记类 6 n
+传讹 3 n
+传译 174 v
+传译出 3 n
+传话 144 n
+传话人 4 n
+传说 3372 n
+传说人物 3 l
+传诵 112 v
+传诵一时 3 n
+传诵不已 3 n
+传谕 3 n
+传谣 3 n
+传质 26 n
+传质阻力 3 n
+传赞 3 v
+传起 3 v
+传输 857 vn
+传输器 3 n
+传输媒体 3 n
+传输层 3 n
+传输技术 2 n
+传输控制协议 3 nz
+传输数据 7 n
+传输方式 12 n
+传输服务 2 n
+传输流 6 n
+传输率 14 n
+传输码 3 n
+传输线 28 n
+传输网 13 n
+传输速度 20 n
+传输速率 16 n
+传达 763 v
+传达出来 3 l
+传达员 18 n
+传达处 3 l
+传达室 29 n
+传达物 3 l
+传过 3 v
+传过去 3 v
+传过来 3 l
+传述 3 v
+传送 670 v
+传送器 3 n
+传送带 44 n
+传送数据 3 n
+传送机 3 n
+传送模式 3 n
+传送点 3 n
+传送率 3 n
+传送速度 4 n
+传送门 3 n
+传递 1719 v
+传递信息 3 n
+传递函数 15 n
+传递性 6 n
+传递情报 3 n
+传递数据 3 n
+传递窗 3 n
+传递细胞 3 n
+传递集 3 n
+传遍 220 v
+传遍全国 3 n
+传道 45 v
+传道受业 3 n
+传道士 3 n
+传道授业 11 l
+传销 425 v
+传销价 3 n
+传销员 3 n
+传销商 3 n
+传销商品 3 n
+传销案 3 n
+传错 8 v
+传问 3 v
+传闻 506 n
+传闻中 3 n
+传闻失实 3 i
+传闻失真 3 i
+传闻异辞 3 i
+传阅 42 v
+传音 18 n
+传音入密 3 n
+传颂 32 v
+传颂一时 3 i
+传颂千古 3 i
+传风扇火 3 i
+传风搧火 3 v
+传魂 3 n
+传龟袭紫 3 i
+伡 17 zg
+伢 13 n
+伢子 7 n
+伣 12 zg
+伤 7363 v
+伤亡 1047 v
+伤亡事故 3 n
+伤亡人数 3 n
+伤亡惨重 3 i
+伤亡率 8 n
+伤亡者 2 n
+伤人 454 n
+伤人案 3 n
+伤俘 50 v
+伤停补时 5 i
+伤元气 3 n
+伤兵 67 n
+伤别离 3 v
+伤到 3 v
+伤力 3 n
+伤势 632 n
+伤化败俗 3 i
+伤及 144 v
+伤口 1528 n
+伤口发炎 3 n
+伤口处 18 n
+伤号 20 n
+伤员 428 n
+伤型 3 n
+伤处 122 n
+伤天害理 89 n
+伤害 1797 a
+伤害事故 3 n
+伤害力 3 n
+伤害性 3 n
+伤害案 6 n
+伤害罪 5 n
+伤害者 5 n
+伤寒 232 a
+伤寒杆菌 3 n
+伤寒病 3 n
+伤寒论 49 n
+伤弓之鸟 3 i
+伤心 1388 n
+伤心事 16 n
+伤心地 94 n
+伤心惨目 3 i
+伤心欲绝 3 i
+伤心疾首 3 i
+伤心落泪 3 i
+伤心蒿目 3 vn
+伤心雨 3 i
+伤怀 26 vn
+伤性情 3 n
+伤患 3 n
+伤患人数 3 l
+伤悲 36 a
+伤悼 3 v
+伤情 107 n
+伤愈 106 v
+伤感 415 n
+伤感情 3 n
+伤损 28 vn
+伤教败俗 3 i
+伤春悲秋 3 i
+伤来伤去 3 i
+伤残 155 a
+伤残人 37 n
+伤残人员 4 n
+伤残者 2 n
+伤气 3 n
+伤湿膏 3 n
+伤生 3 v
+伤疤 174 n
+伤病 184 n
+伤病号 5 n
+伤病员 38 n
+伤病残 6 n
+伤病者 3 n
+伤痕 355 n
+伤痕累累 45 l
+伤痛 240 a
+伤眼 3 n
+伤神 24 n
+伤离别 3 n
+伤科 8 n
+伤筋动骨 27 i
+伤者 179 n
+伤耗 3 n
+伤肺 3 n
+伤肾 3 n
+伤胃 3 n
+伤脑筋 38 n
+伤自尊 3 i
+伤自尊了 3 i
+伤言扎语 3 i
+伤财 3 v
+伤身 3 n
+伤透 3 v
+伤逝 19 v
+伤错 3 a
+伤风 61 n
+伤风克 3 n
+伤风感冒 3 l
+伤风败俗 27 i
+伤风败化 3 i
+伤食 6 n
+伥 6 n
+伥鬼 2 n
+伦 970 ns
+伦之梦 4 nr
+伦云 13 ns
+伦会盟 8 nt
+伦克 2 ns
+伦加德 45 ns
+伦勃朗 31 nr
+伦博 2 ns
+伦台 3 ns
+伦哲如 2 nr
+伦四虎 2 nr
+伦图纳 2 nr
+伦堡城 2 ns
+伦墩大学 3 nr
+伦多夫 4 nrt
+伦大虎 18 nr
+伦威尔 7 nr
+伦家族 2 nr
+伦尼 5 ns
+伦左旗 12 ns
+伦巴 54 ns
+伦巴第 44 nr
+伦帕河 3 ns
+伦常 71 ns
+伦常之 3 nr
+伦常乖 2 nr
+伦常名 2 nr
+伦德 4 ns
+伦德尔 4 nr
+伦德格 2 nr
+伦敦 2255 ns
+伦敦城 13 ns
+伦敦大学 107 nt
+伦敦市 10 ns
+伦敦希思罗机场 4 ns
+伦敦桥 3 ns
+伦敦经济学院 13 nt
+伦敦经济政治学院 24 nt
+伦敦证券交易所 4 nt
+伦斯 4 ns
+伦斯勒 2 nr
+伦斯基 5 nr
+伦格兰 4 ns
+伦楹希 2 nr
+伦次 6 ns
+伦比 272 ns
+伦永亮 3 nr
+伦汇宗 2 nr
+伦池 2 ns
+伦泳 2 n
+伦润明 16 nr
+伦港 2 ns
+伦特 5 ns
+伦特罗 24 nr
+伦理 596 ns
+伦理化 3 n
+伦理学 255 nt
+伦理学史 3 n
+伦理学家 8 n
+伦理思想 3 n
+伦理片 3 n
+伦理观 13 n
+伦理道德 3 nr
+伦琴 61 nr
+伦琴射线 23 n
+伦皮拉 2 nrt
+伦福德 6 nr
+伦福瑞 2 nr
+伦科夫 10 nr
+伦纪 3 n
+伦纳 5 ns
+伦纳德 5 nr
+伦茨 5 nrt
+伦蒂岛 6 ns
+伦西亚 2 ns
+伦诺克斯 2 nrt
+伦贝格 2 nr
+伦贾科夫 3 nr
+伦迪克 2 nr
+伦道夫 5 nr
+伦钦夏 4 nr
+伦长公主 2 n
+伦顿 2 ns
+伧 21 x
+伨 2 zg
+伩 27 zg
+伪 923 j
+伪书 67 n
+伪作 34 v
+伪供 3 v
+伪冒 8 v
+伪军 458 n
+伪力 3 n
+伪劣 42 n
+伪劣产品 3 v
+伪劣商品 3 nz
+伪县长 3 n
+伪名 3 v
+伪君子 75 n
+伪命 3 n
+伪品 6 n
+伪善 62 v
+伪善性 3 n
+伪善者 3 n
+伪学 3 n
+伪学者 3 n
+伪币 2 n
+伪彩 3 n
+伪托 14 v
+伪报 4 n
+伪指令 3 n
+伪政府 18 n
+伪政权 26 n
+伪本 3 n
+伪满 33 v
+伪满州国 3 ns
+伪满政府 3 n
+伪满洲国 53 ns
+伪玩家 3 v
+伪科学 21 n
+伪称 7 v
+伪经 3 n
+伪药 3 n
+伪补格 3 n
+伪装 483 v
+伪装做 3 v
+伪装品 3 n
+伪装成 3 n
+伪装物 3 n
+伪装网 6 n
+伪装者 3 n
+伪言 3 n
+伪誓 3 v
+伪证 71 j
+伪证人 3 n
+伪证罪 6 n
+伪谬 3 n
+伪足 17 v
+伪造 332 v
+伪造品 3 n
+伪造文书 3 n
+伪造检测 3 n
+伪造罪 3 n
+伪造者 3 n
+伪造证件 3 n
+伪造证据 3 n
+伪钞 33 n
+伪预解式 3 n
+伪饰 5 n
+伪麻黄碱 9 n
+伫 21 zg
+伫候 3 v
+伫列 3 v
+伫立 133 v
+伫足 3 v
+伬 16 zg
+伯 1600 nr
+伯之霸 2 nr
+伯乐 52 nr
+伯乐一顾 3 i
+伯乐树 2 nr
+伯乐相马 3 nr
+伯以田 2 nr
+伯仲 16 nr
+伯仲之间 48 nr
+伯仲叔季 3 nr
+伯伊德 2 nr
+伯伟良 2 nr
+伯伯 948 nr
+伯俞廉 3 nr
+伯俞泣杖 3 v
+伯克之 4 nr
+伯克伊 2 nr
+伯克兰 5 nr
+伯克利 37 nr
+伯克利分校 25 n
+伯克利加州大学 2 nt
+伯克利大学 5 nt
+伯克尔 13 nr
+伯克拥 2 nr
+伯克来 2 nr
+伯克莱 2 nr
+伯克贝 3 nr
+伯克赖 2 nr
+伯克郡 5 nr
+伯克霍 6 nr
+伯公 3 nr
+伯六叔 2 nr
+伯兹瓦纳 3 nrt
+伯内特 3 nr
+伯刘孔 7 nr
+伯刘泽 2 nr
+伯刘良 2 nr
+伯利克 32 nr
+伯利兹 76 nr
+伯利安 96 nr
+伯利恒 19 nr
+伯力 20 n
+伯努利 105 nr
+伯努利盘 3 nr
+伯劳 3 nr
+伯劳飞燕 3 nr
+伯劳鸟 3 nr
+伯勒达 3 nr
+伯南克 6 nr
+伯南布哥 6 ns
+伯南布哥州 2 ns
+伯叔 11 nr
+伯叔兄 2 nr
+伯吉斯 11 nr
+伯吉父 5 nr
+伯吴汝 2 nr
+伯周奎 2 nr
+伯唐通 3 nr
+伯垂真 2 nr
+伯埙仲篪 3 nr
+伯塞斯库 3 nr
+伯夷叔 6 nr
+伯婆 3 nr
+伯孤鸿 2 nr
+伯尔尼 86 nr
+伯尔特 2 nr
+伯尔纳 7 nr
+伯尔萨 2 nr
+伯尼埃 5 nr
+伯工厂 2 nt
+伯巨炮 2 nr
+伯巴赫 2 nr
+伯希和 14 nr
+伯德特 5 nr
+伯德金 3 nr
+伯志飞 4 nr
+伯恩 9 nr
+伯恩斯 14 nr
+伯恩斯坦 27 nrt
+伯恩施坦 3 nr
+伯恩茅 3 nr
+伯扬父 2 nr
+伯拦塔 2 nr
+伯斯坦 2 nr
+伯斯特 4 nr
+伯明氏 3 nr
+伯明罕 3 nr
+伯明翰 136 nr
+伯服均 3 nr
+伯朗士 2 nr
+伯朗宁 3 nr
+伯朝拉 17 nr
+伯木古 4 nr
+伯李国 2 nr
+伯杰 3 nr
+伯杰龙 4 nr
+伯林根 3 nr
+伯查德 2 nr
+伯根地 3 ns
+伯格 41 nr
+伯格斯 2 nr
+伯格曼 19 nr
+伯格特 2 nr
+伯歌季舞 3 nr
+伯母 330 nr
+伯比奇 4 nr
+伯河 2 ns
+伯济 2 n
+伯灵顿 4 nr
+伯爵 387 nr
+伯爵夫人 3 nr
+伯爵爵位 3 nr
+伯父 379 nr
+伯父母 3 nr
+伯牙 20 ns
+伯特利 3 nr
+伯玉知非 3 nr
+伯班克 7 nr
+伯理 2 n
+伯理复 2 nr
+伯益之 2 nr
+伯祖 49 nr
+伯祖母 3 nr
+伯祥兄 3 nr
+伯禹夏 2 nr
+伯纳乌 98 nr
+伯纳姆 4 nr
+伯纳尔 2 nr
+伯纳德 7 nr
+伯纳斯 3 nr
+伯纳迪 6 nr
+伯罗奔 4 nr
+伯罗奔尼撒 162 ns
+伯罗虎 3 nr
+伯署府 3 nr
+伯舒拉 5 nr
+伯莎 2 nrt
+伯莱塔 3 nr
+伯蒂奇 2 nr
+伯虎兄 3 nr
+伯言兄 7 nr
+伯赞著 2 nr
+伯远帖 4 nr
+伯通兄 4 nr
+伯道无儿 3 nr
+伯邑考 8 nr
+伯郑遵 3 nr
+伯里 10 nrt
+伯里亚 2 nr
+伯里克 10 nr
+伯里兹 3 nr
+伯里安 5 nr
+伯阳父 5 nr
+伯陈永 3 nr
+伯雨师 2 nr
+伯顿法 2 nr
+伯颜 104 nr
+伯颜任 2 nr
+伯颜入 2 nr
+伯颜分 2 nr
+伯颜帖 31 nr
+伯颜独 6 nr
+伯颜猛 2 nr
+伯颜督 3 nr
+伯颜继 3 nr
+伯颜邀 2 nr
+伯高杰 2 nr
+估 380 n
+估产 4 n
+估价 316 n
+估价人 3 n
+估价单 3 n
+估价发票 3 n
+估价师 3 n
+估价表 3 n
+估价鉴定 3 n
+估估 2 v
+估值 177 n
+估分 3 n
+估到 3 v
+估单 3 n
+估堆儿 3 v
+估成 3 v
+估摸 118 v
+估斤算两 3 n
+估测 12 v
+估税员 3 n
+估算 293 v
+估衣 7 n
+估计 3893 v
+估计不足 3 v
+估计值 22 n
+估计数 12 n
+估计者 3 n
+估计量 3 n
+估评 3 v
+估量 194 n
+伱 4 zg
+伲 60 zg
+伴 1567 v
+伴侣 282 n
+伴侣蛋白 3 n
+伴偶 3 v
+伴儿 62 n
+伴同 22 v
+伴唱 32 v
+伴唱机 3 n
+伴唱版 3 n
+伴奏 369 v
+伴奏带 3 n
+伴奏网 3 n
+伴奏者 3 n
+伴娘 48 n
+伴宿 6 v
+伴我行 3 n
+伴我飞 3 n
+伴时宰相 3 n
+伴星 39 n
+伴有 493 v
+伴游 23 v
+伴热输送 3 n
+伴生 630 v
+伴生树 3 n
+伴生气 3 n
+伴生物 2 n
+伴白蛋白 3 n
+伴舞 22 v
+伴舞乐队 3 n
+伴读 13 v
+伴送 3 v
+伴郎 11 n
+伴随 1018 v
+伴随模型 3 n
+伴随物 3 n
+伴音 22 n
+伴食 3 v
+伴食中书 3 n
+伴食宰相 3 n
+伶 248 ns
+伶人 3 a
+伶仃 31 a
+伶仃孤苦 2 ns
+伶仃洋 17 ns
+伶俐 178 a
+伶俐乖巧 3 i
+伶牙俐齿 27 i
+伶牙利爪 3 i
+伶牙利齿 3 i
+伷 2 zg
+伸 3417 v
+伸上 3 v
+伸上去 3 v
+伸上来 3 v
+伸下 3 v
+伸下去 3 v
+伸下来 3 v
+伸伸 61 v
+伸伸手 2 i
+伸伸脚 3 i
+伸入 3 v
+伸冤 66 v
+伸冤理枉 3 i
+伸出 2392 v
+伸出头 33 v
+伸出手 3 v
+伸到 3 v
+伸去 3 v
+伸及 3 v
+伸向 167 v
+伸回 3 v
+伸回去 3 i
+伸回来 3 i
+伸在 3 v
+伸头 3 v
+伸头探脑 3 i
+伸头缩颈 3 n
+伸屈 3 v
+伸展 565 v
+伸展不了 3 v
+伸展出 3 v
+伸展出去 3 v
+伸展到 3 v
+伸展台 3 n
+伸展操 3 n
+伸平 3 v
+伸延 21 v
+伸开 83 v
+伸张 36 v
+伸张正义 26 i
+伸懒腰 17 v
+伸手 4337 v
+伸手不见 3 i
+伸手不见五指 65 i
+伸手派 3 v
+伸曲 3 v
+伸来 3 v
+伸来伸去 3 i
+伸港 3 v
+伸畅 3 v
+伸直 115 v
+伸直长度 3 i
+伸筋草 3 i
+伸缩 379 v
+伸缩器 3 n
+伸缩尺 3 i
+伸缩尼龙 3 nz
+伸缩式 14 b
+伸缩性 31 b
+伸缩缝 3 i
+伸缩自如 3 i
+伸缩门 3 v
+伸脚 3 v
+伸腰 13 v
+伸腿 22 v
+伸舌头 127 v
+伸诉 3 v
+伸起 3 v
+伸起来 3 v
+伸过 3 v
+伸过去 3 v
+伸过来 3 v
+伸进 126 v
+伸进去 3 v
+伸进来 3 v
+伸钩索铁 3 n
+伸长 218 v
+伸长率 10 n
+伹 2 zg
+伺 183 zg
+伺候 603 v
+伺奉 3 v
+伺察 3 v
+伺弄 6 v
+伺服 80 v
+伺服器 3 nz
+伺服机构 3 nz
+伺服电机 7 nz
+伺服系统 3 nz
+伺机 162 d
+伺机作案 3 v
+伺机报复 3 nz
+伺机而动 3 v
+伺瑕导蠙 3 nz
+伺瑕抵蠙 3 z
+伺瑕抵隙 3 n
+伺隙 3 d
+伻 3 zg
+似 7763 d
+似乎 9544 d
+似仙非仙 3 i
+似动知觉 3 i
+似可 3 d
+似地 684 d
+似懂非懂 61 l
+似旧 3 d
+似是 3 d
+似是而非 90 i
+似曾 5 d
+似曾相识 77 i
+似有如无 3 l
+似有若无 3 i
+似水 3 l
+似水如鱼 3 l
+似水流年 9 l
+似漆如胶 3 i
+似火 3 l
+似然比 6 i
+似的 4637 u
+似真似假 2 i
+似神非神 3 i
+似笑非笑 110 l
+似箭在弦 3 i
+似能 3 d
+似角 3 l
+似醉如痴 3 i
+似钢 3 i
+似锦 3 l
+似非而是 3 l
+似马一样 3 i
+伽 812 zg
+伽利略 209 nr
+伽师 25 nr
+伽师县 2 nr
+伽楠香 3 nr
+伽玛刀 16 nr
+伽罗瓦论 3 nr
+伽蓝 51 nr
+伽达默尔 2 nrt
+伽马 57 nrt
+伽马刀 11 nr
+伽马射线 2 n
+伾 10 zg
+佀 5 zg
+佃 392 n
+佃农 169 n
+佃妇 3 n
+佃客 82 n
+佃户 189 n
+佃权 59 n
+佃租 2 n
+佃粮 3 n
+但 110709 c
+但丁 86 nr
+但东林 5 nr
+但丽鹃 2 nr
+但乔峰 2 nr
+但亏 3 d
+但仁信 2 nr
+但他却 3 l
+但仪琳 3 nr
+但俊奇 2 nr
+但俊德 2 nr
+但俊斌 2 nr
+但俊武 2 nr
+但保皇 2 nr
+但兰香 3 nr
+但其与 3 nr
+但凡 221 nr
+但剑尖 4 nr
+但剑招 3 nr
+但力帆 3 nr
+但努尔 2 nr
+但原告 3 nr
+但君亭 12 nr
+但嘉乔 2 nr
+但嘉平 5 nr
+但因 3 c
+但塔娜 3 nr
+但奉军 2 nr
+但妙风 2 nr
+但孙科 3 nr
+但学武 4 nr
+但安娜 2 nr
+但宝柱 2 nr
+但宪宗 4 nr
+但小僧 3 nr
+但小龙 16 nr
+但少安 8 nr
+但少平 8 nr
+但崇祯 41 nr
+但庆玉 2 nr
+但庆金 2 nr
+但彦章 3 nr
+但恒山 3 nr
+但愿 458 v
+但愿人长久 2 i
+但愿如此 3 i
+但慈恩 2 nr
+但慧梅 4 nr
+但慧英 2 nr
+但成军 2 nr
+但文帝 4 nr
+但明军 2 nr
+但明叔 5 nr
+但是 28055 c
+但有 3 c
+但林平 2 nr
+但林彪 3 nr
+但格格 2 nr
+但楚军 3 nr
+但求无过 11 i
+但汉译 2 nr
+但江青 2 nr
+但沛然 2 nr
+但海子 2 nr
+但海瑞 2 nr
+但海萍 2 nr
+但润叶 3 nr
+但润生 2 nr
+但湘军 3 nr
+但爱丽 2 nr
+但献忠 3 nr
+但玉亭 3 nr
+但瑛姑 4 nr
+但秀眉 2 nr
+但秀莲 5 nr
+但素知 6 nr
+但紫光 3 nr
+但纯子 2 nr
+但群僧 2 nr
+但群豪 5 nr
+但英军 3 nr
+但荣禄 2 nr
+但薇薇 2 nr
+但行好事 3 i
+但要 3 c
+但见 3 c
+但适航 2 nr
+但那次 3 nr
+但重码多 3 l
+但金学 2 nr
+但金富 2 nr
+但金强 2 nr
+但金德 2 nr
+但金朝 2 nr
+但静闻 2 nr
+但香香 2 nr
+佇 8 zg
+佉 17 zg
+位 16243 q
+位丁兄 2 nr
+位不期骄 3 i
+位与 16 v
+位东林 3 nr
+位义兄 6 n
+位于 14654 v
+位于下面 3 l
+位会员 3 n
+位似中心 3 n
+位似变换 3 l
+位列 125 v
+位力定理 3 n
+位力系数 3 n
+位势 38 n
+位势论 3 n
+位卑言高 3 n
+位哥儿 2 nr
+位哲罗 2 nr
+位图 3 v
+位图文件 3 n
+位址 3 n
+位址栏 3 n
+位处 123 v
+位夏婆 3 nr
+位太子 2 n
+位子 326 n
+位密度 2 n
+位尊 56 v
+位尊望重 3 n
+位小友 2 nr
+位小禅师 5 nr
+位少帅 2 nr
+位居 1409 v
+位居要津 3 nr
+位差 3 n
+位师伯 5 nr
+位师叔 4 nr
+位形坐标 3 n
+位形积分 3 n
+位形空间 3 n
+位彩民 9 nr
+位恒山 3 nr
+位操作 2 n
+位数 73 n
+位方孝 2 nr
+位明叔 2 nr
+位木桑 2 nr
+位杨贤 4 nr
+位极人臣 17 n
+位标 5 n
+位次 60 n
+位武学 6 n
+位段 16 n
+位点 17 n
+位玉娘 7 nr
+位瑛姑 2 nr
+位田兄 2 nr
+位皇军 2 nr
+位相 3 n
+位督帅 2 n
+位码 3 n
+位福公子 2 nr
+位移 246 v
+位移共振 3 l
+位移电流 3 n
+位移试剂 3 n
+位童兄 2 nr
+位纤 3 n
+位线 3 n
+位置 7886 v
+位置图 3 nr
+位置服务 3 n
+位置灯 3 n
+位置矢量 3 i
+位老臣 2 nr
+位聪辩 2 nr
+位能 11 v
+位色 3 n
+位贵子 2 nr
+位金学 3 n
+位金蛇 2 n
+位错 18 v
+位阁臣 2 nr
+位阶 6 n
+位阿琪 2 nr
+位阿碧 2 nr
+位青衫 2 nr
+位非 6 v
+位高权重 32 n
+低 15504 a
+低三下四 59 i
+低下 1181 v
+低下去 3 v
+低下头 3 n
+低下头去 3 l
+低下头来 3 l
+低不就 10 d
+低买 3 v
+低买高卖 3 l
+低于 2100 v
+低于正常 3 i
+低云 12 n
+低产 14 n
+低产期 3 n
+低产田 11 n
+低产量 3 n
+低人一等 18 l
+低价 436 n
+低价买进 3 l
+低价位 18 n
+低价卖出 3 l
+低价商品 3 n
+低价房 7 n
+低价股 3 n
+低价高报 3 n
+低优先级 2 l
+低估 287 v
+低位 85 n
+低位沼泽 3 v
+低位牙 3 n
+低低的 80 z
+低俗 53 a
+低俗小说 3 l
+低保 40 v
+低保户 3 n
+低保真 3 n
+低保金 3 n
+低倍 3 d
+低值 9 n
+低值易耗 3 n
+低值易耗品 2 n
+低共熔点 3 n
+低共熔物 3 l
+低凹 9 n
+低分 139 n
+低分子烃 3 n
+低分辨率 4 n
+低利 3 n
+低利率 3 n
+低剂量 3 n
+低功耗 24 n
+低劣 98 a
+低劣性 3 l
+低压 202 v
+低压槽 17 n
+低压火炬 3 i
+低压电器 3 n
+低压配电 3 n
+低压钠灯 3 nz
+低合金 3 n
+低合金钢 3 n
+低吟 3 v
+低吟浅唱 3 i
+低品质 3 n
+低哑 6 a
+低唱 3 v
+低唱浅斟 3 i
+低唱浅酌 3 i
+低噪声 36 nz
+低噪音 3 nz
+低回 26 v
+低回不已 3 l
+低坝 3 n
+低垂 163 v
+低声 3202 n
+低声下气 57 l
+低声哑气 3 n
+低声悄语 3 n
+低声波 3 n
+低声细语 6 i
+低声诉说 3 l
+低头 1756 n
+低头不见抬头见 8 i
+低头不语 3 i
+低头丧气 3 i
+低头哈腰 3 l
+低头搭脑 3 l
+低头碎步 3 i
+低头耷脑 3 l
+低姿势 3 n
+低姿态 3 l
+低字节 3 n
+低密度 3 n
+低射 30 v
+低层 75 n
+低层次 4 b
+低峰 3 n
+低工资 3 n
+低常儿童 3 n
+低平 79 n
+低年级 15 b
+低幼 6 d
+低度 19 n
+低度酒 3 n
+低廉 291 a
+低徊 9 v
+低微 212 d
+低心下意 3 i
+低息 33 n
+低息贷款 3 n
+低情曲意 3 i
+低成本 22 l
+低损耗 3 n
+低收入 126 n
+低收入者 22 n
+低收益 3 n
+低放废物 3 n
+低效 36 a
+低效率 6 n
+低效益 3 n
+低效能 3 n
+低时钟 2 l
+低柔 3 a
+低栏 2 n
+低栏赛 3 n
+低格 3 n
+低档 55 b
+低档车 3 b
+低段 3 n
+低毒 38 v
+低毒性 2 n
+低气压 3 n
+低气压区 5 n
+低氧 14 n
+低氧习服 3 n
+低水平 36 n
+低污染 3 b
+低沈 3 j
+低沉 382 a
+低油耗 3 n
+低洼 202 a
+低洼地 21 n
+低洼地区 3 n
+低浅 3 a
+低浓度 3 n
+低消耗 3 n
+低温 748 n
+低温冰箱 3 n
+低温学 3 n
+低温干燥 3 l
+低温气候 3 n
+低温泵 3 n
+低温浓缩 3 l
+低温特报 3 nz
+低温计 3 n
+低湿 3 a
+低潮 233 n
+低潮期 9 n
+低点 52 n
+低烟 2 n
+低烧 4 v
+低热 35 a
+低热值 9 n
+低热量 3 n
+低版 3 v
+低版本 3 n
+低电压 3 n
+低电平 3 n
+低电量 3 n
+低眉 3 n
+低眉垂眼 3 i
+低眉折腰 3 i
+低眉顺眼 3 i
+低着头 3 v
+低矮 179 a
+低码率 3 n
+低硫 2 n
+低硫煤 2 n
+低碳钢 14 n
+低穹 3 n
+低空 369 n
+低空飞行 3 n
+低端 156 n
+低等 95 b
+低等动物 17 l
+低等植物 21 l
+低等生物 3 l
+低粘度 3 n
+低糖 3 n
+低级 462 b
+低级语言 3 n
+低级趣味 35 l
+低纬度 93 n
+低缓 29 v
+低耗 9 v
+低耗电 3 n
+低聚物 6 n
+低聚甲醛 3 nz
+低聚糖 3 n
+低胸 3 n
+低胸装 3 n
+低能 57 v
+低能儿 10 n
+低能者 3 n
+低能耗 3 n
+低脂肪 3 n
+低腰 10 v
+低腰裤 3 n
+低荡 3 v
+低落 215 v
+低薪 3 n
+低蛋白 3 l
+低血压 41 n
+低血糖 64 n
+低血糖症 3 n
+低语 42 nz
+低调 218 v
+低谷 148 n
+低质 6 n
+低质量 3 n
+低贱 36 a
+低资费 3 n
+低辐射 3 nz
+低迷 182 v
+低迷不振 4 l
+低迷区 3 z
+低通滤波器 3 n
+低速 176 d
+低酚棉 3 n
+低钠血症 3 nz
+低钾血症 3 nz
+低阶 3 n
+低阶语言 3 n
+低陷 3 v
+低靡 4 a
+低音 98 n
+低音大管 3 n
+低音弦 3 n
+低音提琴 12 n
+低音炮 3 n
+低音管 3 n
+低音部 3 n
+低音长号 3 n
+低领 5 v
+低频 105 b
+低频词 3 n
+低飞 3 v
+低飞球 3 n
+低首 3 v
+低首下心 2 i
+低首下气 3 i
+低高型 3 b
+低龄 6 n
+低龄化 15 v
+住 29609 v
+住乐 3 n
+住交会 3 n
+住勤 3 n
+住区 11 n
+住博会 3 n
+住友 29 n
+住友银行 11 nt
+住口 147 n
+住嘴 41 n
+住在一起 3 v
+住地 34 n
+住址 127 n
+住处 537 n
+住宅 1194 n
+住宅产业 3 n
+住宅区 141 n
+住宅小区 3 n
+住宅布局 3 n
+住宅建设 3 n
+住宅房 3 n
+住宅楼 23 n
+住客 24 n
+住家 43 n
+住宿 562 n
+住宿地 5 n
+住宿服务 3 n
+住宿楼 4 n
+住宿生 3 n
+住宿费 138 n
+住寺 3 n
+住居 53 n
+住屋 3 n
+住店 62 n
+住总集团 2 nt
+住惯 3 n
+住户 192 n
+住房 2242 n
+住房价格 3 n
+住房供给 3 n
+住房条件 3 n
+住房补贴 3 n
+住房贷款 3 n
+住房问题 3 n
+住房难 3 n
+住房面积 3 n
+住所 285 n
+住所地 29 n
+住手 122 n
+住持 161 v
+住校 18 n
+住校生 3 n
+住民 4 n
+住满 36 v
+住用 3 n
+住者 3 n
+住诊 3 v
+住读 3 v
+住读生 3 n
+住院 589 n
+住院医师 3 nt
+住院医生 3 n
+住院处 2 n
+住院手续 3 n
+住院日 3 n
+住院楼 3 n
+住院治疗 3 n
+住院病人 3 n
+住院费 26 n
+住院费用 3 n
+住院部 12 nt
+佐 809 vg
+佐丹奴 3 nr
+佐伯 2 ns
+佐佐木 3 nr
+佐使 3 n
+佐剂 2 n
+佐勒菲卡尔 4 nrt
+佐夫 41 nrt
+佐尔 7 nrt
+佐尔格 2 nrt
+佐拉 3 nrt
+佐料 65 n
+佐林 2 nrt
+佐治 9 nrt
+佐治亚 18 ns
+佐治亚大学 3 nt
+佐治亚州 22 ns
+佐法尔 6 nrt
+佐洛 5 nrt
+佐理 10 n
+佐理员 3 n
+佐细胞 3 n
+佐罗 3 nrt
+佐藤 28 nrt
+佐藤俊子 2 nr
+佐藤嘉恭 2 nr
+佐藤浩市 3 nr
+佐藤荣作 3 nr
+佐藤蓝子 3 nr
+佐证 138 n
+佐贺 3 nrt
+佐贺县 4 ns
+佐酒 7 n
+佐野 3 nrt
+佐阿廷 2 nr
+佐雍得尝 3 nr
+佐餐 19 n
+佐饔得尝 3 v
+佑 723 zg
+佑助 6 v
+佑庇 3 v
+佑德 3 v
+佑护 3 v
+体 9670 n
+体专 3 n
+体伍 2 n
+体会 1032 n
+体会出 3 n
+体位 58 n
+体位法 3 n
+体体面面 10 n
+体例 192 n
+体健 7 n
+体元 2 n
+体全 2 n
+体全息图 3 n
+体内 2168 s
+体内平衡 3 nr
+体内诱变 3 nz
+体制 6243 n
+体制性 17 n
+体制改革 3 l
+体力 1023 n
+体力不支 3 n
+体力值 3 n
+体力劳动 3 l
+体力活 3 n
+体力过人 3 n
+体协 25 j
+体博会 3 n
+体味 128 n
+体囊 2 n
+体国经野 3 n
+体坛 152 n
+体坛人士 3 n
+体坛周报 3 n
+体型 392 n
+体壁 17 n
+体外 330 s
+体外受精 3 n
+体外循环 4 n
+体外诱变 3 nz
+体大思精 3 nr
+体天格物 3 n
+体委 155 n
+体姿 2 n
+体宽 3 v
+体察 79 v
+体察下情 3 n
+体察出 3 n
+体察到 3 l
+体察民情 7 n
+体尝 3 v
+体层 4 n
+体工队 17 n
+体己 5 n
+体平 3 n
+体式 33 n
+体弱 315 v
+体弱多病 38 n
+体弱者 12 n
+体形 317 n
+体彩 7 n
+体彩网 3 n
+体征 149 n
+体循环 12 n
+体念 16 n
+体态 184 n
+体态语 3 n
+体态轻盈 3 l
+体性 18 n
+体总 4 n
+体总网 3 n
+体恤 57 v
+体恤入微 3 n
+体恤衫 3 n
+体息 3 n
+体悉 3 v
+体悟 21 n
+体惜 6 v
+体操 700 nr
+体操台 3 n
+体操器械 3 n
+体操房 3 n
+体操比赛 3 n
+体操课 3 n
+体操赛 14 n
+体操选手 3 n
+体操队 28 n
+体改 6 v
+体改办 3 nr
+体改委 18 nr
+体文风 2 nr
+体无完皮 3 l
+体无完肤 29 i
+体晶 7 n
+体查 3 vn
+体柱 2 n
+体校 51 n
+体格 679 n
+体格健壮 3 nr
+体格检查 3 nr
+体检 583 v
+体检中心 3 n
+体检工作 3 n
+体检标准 3 n
+体检表 22 n
+体检费 3 n
+体毛 48 n
+体气渐衰 3 i
+体法 3 n
+体波 6 n
+体测 2 v
+体液 245 n
+体温 363 n
+体温节律 3 n
+体温表 8 n
+体温计 2 n
+体炎 3 n
+体热 8 n
+体物缘情 3 n
+体现 5372 v
+体现者 13 n
+体生 2 n
+体用 3 n
+体癣 4 n
+体相 2 n
+体矩阵 3 nr
+体积 1390 n
+体积小 3 n
+体积计 3 n
+体突变 3 n
+体系 7876 n
+体系化 21 n
+体系结构 98 n
+体细胞 141 n
+体统 126 n
+体罚 116 n
+体美 3 n
+体肤 2 n
+体肤之亲 3 n
+体育 6976 vn
+体育专科 3 n
+体育中心 3 n
+体育事业 3 n
+体育产业 3 n
+体育人物 3 n
+体育健儿 3 n
+体育台 3 n
+体育史 3 n
+体育周 2 nr
+体育器材 3 n
+体育场 729 n
+体育场地 3 n
+体育场馆 26 n
+体育局 25 n
+体育彩票 3 n
+体育总局 3 n
+体育报 18 n
+体育教师 3 n
+体育新闻 3 n
+体育明星 3 n
+体育比赛 3 n
+体育片 3 n
+体育版 3 n
+体育用品 3 n
+体育用品业 3 n
+体育界 50 n
+体育科 4 n
+体育竞争 3 l
+体育竞技 3 n
+体育竞赛 3 nr
+体育类 3 n
+体育精神 3 n
+体育系 12 n
+体育组 3 n
+体育网 3 n
+体育老师 3 n
+体育考试 3 n
+体育节 3 n
+体育节目 3 n
+体育训练 3 n
+体育讯 3 n
+体育论文 3 n
+体育设施 3 n
+体育课 21 n
+体育赛事 3 n
+体育运动 220 n
+体育迷 2 n
+体育选手 3 n
+体育道德 3 nr
+体育部 25 n
+体育锻炼 3 nr
+体育院校 3 n
+体育项目 3 n
+体育频道 3 n
+体育馆 250 n
+体胀系数 2 n
+体能 278 v
+体能测验 3 n
+体能训练 3 n
+体腔 135 n
+体膨胀 6 l
+体臭 3 n
+体臭味 3 n
+体色 25 n
+体节 15 n
+体范 3 v
+体虚 259 n
+体虱 10 n
+体表 525 n
+体衰 2 n
+体裁 367 n
+体裁形式 3 n
+体西学 4 n
+体要 3 v
+体规画圆 3 n
+体视 3 v
+体视学 3 n
+体觉 3 n
+体认 10 v
+体认出 3 v
+体认到 3 v
+体词 3 n
+体诗 8 n
+体谅 164 v
+体貌 16 n
+体貌特征 3 n
+体质 762 n
+体贴 332 n
+体贴人 3 n
+体贴入妙 3 i
+体贴入微 16 i
+体违 5 v
+体酶类 3 n
+体重 1187 n
+体重儿 2 nr
+体重减轻 3 i
+体重增加 3 nr
+体重表 3 n
+体重计 3 n
+体量 19 n
+体长 653 n
+体阳 3 n
+体院 39 n
+体面 353 n
+体面地 3 n
+体面扫地 3 i
+体面起来 3 l
+体香 3 n
+体验 1688 n
+体验出 3 n
+体验型 3 n
+体验式 3 n
+体验性 4 n
+体验版 3 n
+体验生活 3 n
+体骨 2 n
+体高 3 v
+体魄 122 n
+体鸣 8 v
+佔 2 zg
+何 5940 r
+何三七 3 nr
+何不 806 d
+何东昌 3 nr
+何中华 3 nr
+何丰伦 2 nr
+何为 188 c
+何为俊 2 nr
+何为虚 2 nr
+何丽华 2 nr
+何乐不为 22 i
+何乐而不为 79 i
+何乔远 3 nr
+何九叔 63 nr
+何事 470 r
+何云辉 3 nr
+何亮工 2 nr
+何人 494 r
+何人之手 3 i
+何仙姑 2 nr
+何以 1445 c
+何以堪 3 nr
+何以自处 3 i
+何以见得 3 i
+何休亦 2 nr
+何休著 2 nr
+何休见 2 nr
+何作霖 2 nr
+何依静 3 nr
+何俐恩 3 nr
+何保卫 2 nr
+何元朗 2 nr
+何兆武 4 nr
+何先生 23 nr
+何光峰 2 nr
+何光显 5 nr
+何光景 4 nr
+何光暐 3 v
+何克赤 2 nr
+何公敢 2 nr
+何其 113 c
+何其毒也 3 i
+何其相似 3 nr
+何其糊涂 3 i
+何其芳 13 nr
+何兹全 6 nr
+何况 2353 c
+何剑如 2 nr
+何力 28 d
+何加正 7 nr
+何劳言 2 nr
+何升赏 2 nr
+何华武 9 nr
+何华章 14 nr
+何占豪 2 nr
+何厚铧 3 nr
+何原因 3 nr
+何去何从 93 i
+何叔衡 43 nr
+何可得 2 nr
+何可汗 2 nr
+何可纲 25 nr
+何可议 2 nr
+何台军 2 nr
+何名目 2 nr
+何向明 2 nr
+何向阳 6 nr
+何启南 3 nr
+何啻 3 d
+何善德 2 nr
+何嘉文 3 nr
+何国 3 r
+何国珍 4 nr
+何国舅 2 nr
+何在 523 d
+何在乎 2 nr
+何地 124 r
+何地何 2 nr
+何基沣 20 nr
+何堪 6 nr
+何壮哉 2 nr
+何处 1703 r
+何处寻 3 nr
+何夕兮 4 nr
+何大一 12 nr
+何大爷 8 nr
+何太冲 232 nr
+何太医 22 nr
+何太后 11 nr
+何夫人 3 nr
+何奇不有 3 i
+何如 238 c
+何如云 3 nr
+何妙法 6 nr
+何妙策 8 nr
+何妨 169 r
+何婆婆 8 nr
+何婉盈 3 nr
+何子友 2 nr
+何孟春 5 nr
+何孟雄 20 nr
+何宗道 3 nr
+何宝山 3 nr
+何宝林 2 nr
+何宝生 3 nr
+何宝贝 2 nr
+何家劲 3 nr
+何家数 2 nr
+何家村 5 nr
+何家槐 2 nr
+何家湾 5 nr
+何家驹 3 nr
+何小波 2 nr
+何少华 2 nr
+何尝 346 d
+何尝不可 2 i
+何居士 9 nr
+何师伯 2 nr
+何师我 6 nr
+何希斌 5 nr
+何干 101 nr
+何年 48 r
+何年何 26 l
+何年何月 3 l
+何广沂 2 nr
+何庆彦 25 nr
+何庆魁 3 n
+何应钦 455 nr
+何廉 3 nr
+何建军 3 nr
+何建民 4 nr
+何当 3 d
+何得相 2 d
+何德何 17 nr
+何德何能 3 nr
+何德治 3 nr
+何德能 2 nr
+何徽临 2 nr
+何心隐 335 nr
+何必 1876 d
+何必如此 3 l
+何必当初 15 nr
+何忍 12 nr
+何忍言 2 nr
+何志军 3 nr
+何志孔 6 nr
+何志平 3 nr
+何志毅 2 nr
+何思敬 3 nr
+何思虞 30 nr
+何思豪 50 nr
+何怪 4 d
+何患 3 n
+何患无词 3 i
+何患无辞 16 i
+何惕守 121 nr
+何惜那 2 nr
+何惠飞 7 nr
+何惧 3 v
+何惧哉 17 nr
+何意 27 d
+何意呀 2 nr
+何慧娴 2 nr
+何所不为 3 c
+何所不有 3 c
+何所不至 3 c
+何所云 2 nr
+何执中 3 nr
+何承天 11 nr
+何振东 36 nr
+何振梁 10 nr
+何授丁 2 nr
+何政军 3 nr
+何故 517 d
+何敢 10 d
+何敢复 2 nr
+何敢言 2 nr
+何文杰 7 nr
+何文秀 3 nr
+何新 6 d
+何方 273 r
+何方神圣 3 nr
+何无忌 2 i
+何日 135 r
+何时 923 c
+何时休 3 nr
+何时何地 3 r
+何时能 3 nr
+何星亮 2 nr
+何春梅 12 nr
+何春芳 8 nr
+何昭阳 4 nr
+何晏叹 2 nr
+何晓道 2 nr
+何晔晖 256 nr
+何晟铭 256 nr
+何晨光 4 nr
+何景明 10 nr
+何暇 3 d
+何曼笑 2 nr
+何曾 130 nr
+何曾洁 2 nr
+何月 19 r
+何月何日 3 i
+何月华 140 nr
+何月方 6 nr
+何望海 3 nr
+何朝宗 3 nr
+何来 162 d
+何来实 2 d
+何杰金 6 nr
+何林祥 2 nr
+何柱国 30 nr
+何样 4 r
+何格恩 2 nr
+何椿霖 264 nr
+何模样 3 nr
+何止 186 v
+何氏凤仙 3 nr
+何氏语 2 nr
+何水根 2 nr
+何永康 4 nr
+何永智 2 nr
+何永生 2 nr
+何永盛 4 nr
+何求 2 v
+何沅君 38 nr
+何泽慧 5 nr
+何洛会 8 nr
+何洪泽 2 nr
+何海霞 8 nr
+何涞凼 2 nr
+何润东 3 nr
+何润宇 8 nr
+何深仇 2 nr
+何清涟 5 n
+何清濂 2 nr
+何清笑 3 nr
+何渊源 4 nr
+何满子 2 nr
+何炬离 3 nr
+何炳松 2 nr
+何炳林 2 nr
+何烧戈 5 nr
+何物 151 n
+何独 3 d
+何献中 3 nr
+何玉棠 3 nr
+何玉芬 28 nr
+何理立 9 nr
+何瑞荣 3 nr
+何生亮 4 nr
+何用 340 d
+何用尔 2 nr
+何用途 2 nr
+何疑 4 d
+何疑焉 2 nr
+何百采 4 nr
+何益焉 2 nr
+何相公 2 nr
+何相干 12 nr
+何示 2 v
+何祚庥 19 nr
+何祚麻 3 nr
+何秀玲 24 nr
+何秋涛 3 nr
+何秋萍 3 nr
+何种 397 r
+何种地步 3 l
+何立伟 3 nr
+何竹淇 4 nr
+何等 945 r
+何策擒 2 nr
+何策胜 2 nr
+何红药 125 nr
+何绍华 14 nr
+何绍基 3 nr
+何绍庚 2 nr
+何维新 2 nr
+何罪之有 3 i
+何美婷 3 nr
+何美细 3 nr
+何美萍 3 nr
+何美钿 3 nr
+何耀强 2 nr
+何耀珊 3 nrfg
+何老伯 5 nr
+何老凤 5 nr
+何老拳师 4 i
+何老爹 40 nr
+何老衲 2 nr
+何者 234 c
+何而生 2 nr
+何腾蚊 2 nr
+何腾蛟 77 nr
+何自力 4 nr
+何至于 3 c
+何至于此 3 l
+何艇 6 n
+何艇长 3 n
+何良俊 3 nr
+何良策 17 nr
+何若 3 c
+何苦 287 d
+何苦乃尔 3 nr
+何苦来哉 3 i
+何荣儿 2 nr
+何药治 2 nr
+何莉莉 3 nr
+何虑 3 v
+何虑哉 2 nr
+何虑焉 2 nr
+何见谕 3 nr
+何解 2 v
+何计 2 v
+何计破 2 i
+何训示 4 nr
+何许 18 d
+何许人 6 nr
+何许人也 30 i
+何论魏晋 3 nr
+何谈 3 v
+何谓 111 nr
+何谕示 2 nr
+何赛飞 3 nr
+何超仪 3 nr
+何超明 3 nr
+何趣 2 n
+何足为奇 20 i
+何足介意 3 nr
+何足忧 2 i
+何足惜 12 nr
+何足挂齿 45 i
+何足畏 2 i
+何足轻重 3 i
+何足道 135 nr
+何足道哉 3 i
+何进之 3 nr
+何远 2 d
+何道士 2 nr
+何金寿 2 nr
+何鉴明 2 nr
+何钧谕 3 nr
+何铁手 47 nr
+何错之有 3 i
+何长工 53 nr
+何长荣 3 nr
+何门 135 d
+何门何 4 r
+何队 3 n
+何难 4 d
+何难之有 3 i
+何难哉 23 nr
+何需 3 n
+何非 3 c
+何面目 3 i
+何韵诗 3 nr
+何须 73 d
+何颜见 2 nr
+何首乌 26 nr
+何香主 9 nr
+何香凝 24 nr
+何高明 3 nr
+何高见 43 nr
+何鲁丽 278 nr
+何鲁之 2 nr
+何鲁敏 3 nr
+何黄彪 6 nr
+何黑奴 2 nr
+佖 2 zg
+佗 56 g
+佘 38 zg
+佘一元 35 nr
+佘东初 3 nr
+佘太君 6 nr
+佘祥林 3 nr
+佘诗曼 3 nr
+余 7959 m
+余一元 4 m
+余一寸 2 m
+余一枚 2 m
+余一片 3 m
+余丁才 3 nr
+余万 547 m
+余万两 4 m
+余万亩 3 m
+余万人次 9 m
+余万件 7 m
+余万元 312 m
+余万公顷 7 m
+余万册 7 m
+余万千瓦 4 m
+余万卷 2 m
+余万发 2 m
+余万口 8 m
+余万只 2 m
+余万号 2 m
+余万名 4 m
+余万吨 17 m
+余万平方公里 8 m
+余万平方米 7 m
+余万度 2 m
+余万户 8 m
+余万斤 2 m
+余万株 2 m
+余万港元 2 m
+余万种 5 m
+余万立方米 2 m
+余万美元 2 m
+余万股 4 m
+余丈 2 m
+余三 15 m
+余三寸 2 m
+余上沅 3 nr
+余下 562 m
+余下来 3 l
+余业 4 n
+余业遗烈 3 n
+余丛考 4 nr
+余东风 3 nr
+余个 150 m
+余之遥 2 nr
+余事后叙 3 nr
+余二 7 m
+余二千万 2 m
+余五 2 m
+余亩 263 m
+余人彦 7 nr
+余人次 8 m
+余亿元 2 m
+余亿吨 2 m
+余亿美元 2 m
+余件 57 m
+余份 7 m
+余众 7 n
+余位 17 m
+余佩皋 2 nr
+余例 9 n
+余倍 4 m
+余值 3 n
+余元 23 m
+余兆兴 10 nr
+余光 38 nr
+余光中 4 nrfg
+余光分人 3 n
+余光里 2 nr
+余党 52 n
+余公里 154 m
+余公顷 14 m
+余兴 9 nr
+余兴未尽 4 i
+余兴节目 3 n
+余具 2 m
+余册 2 m
+余冠英 2 nr
+余凤兰 4 nr
+余出 11 m
+余函数 3 n
+余分钟 10 m
+余切 14 r
+余切向量 3 n
+余则 6 m
+余利 5 nr
+余剩 10 v
+余割 4 v
+余力 38 n
+余勇可嘉 3 nr
+余勇可贾 3 nr
+余匹 3 m
+余十 2 m
+余十四 2 m
+余千克 5 m
+余千米 53 m
+余半点 2 m
+余卓成 9 nrfg
+余卷 9 m
+余厘米 3 m
+余叔岩 277 nr
+余古帝 2 nr
+余只 10 m
+余台 7 m
+余名 157 m
+余吨 12 m
+余味 19 n
+余味回甘 3 nr
+余味无穷 4 i
+余品 2 n
+余响 2 m
+余响绕梁 3 n
+余嘉锡 7 nr
+余四壁 2 m
+余因子 3 nr
+余地 697 n
+余场 4 n
+余场次 3 m
+余址 3 n
+余块 6 m
+余堵 2 m
+余壮远 45 nr
+余声三日 3 m
+余处 324 m
+余多 7 m
+余大帅 4 nr
+余大钧 2 nr
+余天 12 m
+余太山 8 nr
+余夫亦 8 nr
+余头 3 m
+余套 7 m
+余妙绕梁 3 nr
+余姚 140 nr
+余姚人 31 nr
+余姚市 14 ns
+余威 25 nr
+余婆婆 3 nr
+余子式 3 nr
+余子碌碌 3 i
+余存 3 nr
+余孙强 2 nr
+余孽 168 n
+余安安 3 nr
+余定远 3 nr
+余实 148 n
+余家 653 m
+余家村 2 nr
+余容 2 n
+余宽休 2 nr
+余封 3 m
+余尊 9 m
+余小惠 3 nr
+余少群 256 nr
+余少镭 3 nr
+余岁 14 m
+余师伯 2 nr
+余幅 17 m
+余干 3 m
+余干县 2 ns
+余平方公里 12 m
+余平方米 265 m
+余年 466 m
+余年前 3 l
+余广逊 2 nr
+余庆 11 nr
+余庆县 3 ns
+余度 3 n
+余座 116 m
+余式定理 3 n
+余张 5 m
+余弦 32 nr
+余弦公式 3 n
+余弦定理 3 n
+余德军 3 nr
+余德鸿 5 nr
+余志回 3 nr
+余志远 3 nr
+余怀一 2 nr
+余怀则 2 nr
+余怀同 2 nr
+余怀和 5 nr
+余怀皱 2 nr
+余怀转 3 nr
+余怒 21 nr
+余怒未消 3 l
+余悸 24 v
+余悸犹存 3 nr
+余情 2 n
+余情未了 3 l
+余户 4 m
+余所 58 m
+余振东 2 nr
+余支 14 m
+余数 25 m
+余文乐 3 nr
+余料 3 n
+余斤 5 m
+余方 5 m
+余日 11 m
+余晖 40 nr
+余晨波 9 nr
+余暇 129 n
+余有丁 15 nr
+余本 9 ns
+余条 55 m
+余杭 56 nr
+余杭区 3 ns
+余杭县 9 ns
+余杭市 5 ns
+余杭镇 3 nr
+余枚 22 m
+余架 76 m
+余架次 4 m
+余株 4 m
+余桃啖君 3 v
+余桃市 3 ns
+余模 3 n
+余次 100 m
+余款 30 m
+余正钧 2 nr
+余步 3 m
+余段 2 m
+余毒 24 n
+余毫米 11 m
+余氏勤 4 nr
+余氯 3 n
+余永定 3 nr
+余汉谋 4 nr
+余江 9 ns
+余江县 5 ns
+余沧海 107 ns
+余波 26 nr
+余波未停 3 nr
+余波未平 3 nr
+余波荡漾 3 nr
+余派 6 m
+余海华 44 nr
+余海里 3 nr
+余淡心 6 nr
+余清楚 5 nr
+余滴 3 m
+余潇枫 2 nr
+余火未熄 3 n
+余点 2 m
+余烬 16 n
+余烬复燃 3 v
+余热 79 n
+余牙 2 ns
+余犯 3 n
+余率军 2 nr
+余瑞璜 3 nr
+余生 23 nr
+余田予 2 nr
+余电 3 n
+余留 3 nr
+余百三十五 2 m
+余盐 2 n
+余相公 7 nr
+余祥贞 2 nr
+余秋里 6 nr
+余秋雨 61 nrfg
+余种 1187 m
+余程 36 n
+余立波 2 nr
+余立金 3 nr
+余章 3 m
+余篇 119 m
+余米 259 m
+余类推 3 nr
+余粮 49 n
+余粮收集 3 n
+余纬度 3 nr
+余纯顺 3 nr
+余继军 8 nr
+余绪 3 n
+余绳武 3 nr
+余维数 3 nr
+余缺 6 nr
+余者 87 n
+余联沅 3 nr
+余股 10 m
+余脉 335 ns
+余腥残秽 3 i
+余致远 2 nr
+余艘 47 m
+余英时 2 nr
+余药夫 14 nr
+余蓄 3 n
+余行 8 m
+余裕 45 nr
+余观主 77 nr
+余角 3 m
+余言 2 n
+余让水 4 nr
+余诗曼 3 nr
+余身 6 m
+余辆 48 m
+余辉 24 nr
+余连发 3 nr
+余部 219 m
+余郭襄 2 nr
+余里 27 m
+余量 6 m
+余钱 31 n
+余门 17 m
+余闲 3 nr
+余间 18 n
+余集 4 m
+余震 24 nr
+余震不断 3 l
+余音 33 n
+余音嫋嫋 3 ns
+余音犹在 3 l
+余音绕梁 5 nr
+余音缭绕 3 i
+余音袅绕 3 l
+余音袅袅 9 l
+余韵 17 nr
+余韵流风 3 n
+余项 23 m
+余顺平 3 nr
+余顺福 2 nr
+余颗 3 m
+余额 540 n
+余风 3 nr
+余风遗文 3 nr
+余食赘行 3 l
+余首 62 m
+余香 8 nr
+余香满 3 nr
+余香满口 3 nr
+余鱼 141 n
+余鱼同 3 nr
+佚 277 vg
+佚事 4 n
+佚名 34 n
+佚失 3 n
+佚文 30 n
+佛 3080 n
+佛乐 8 nz
+佛事 60 n
+佛佗 3 nz
+佛像 405 n
+佛像卡 3 nz
+佛光 41 nz
+佛光寺 19 nz
+佛光山 3 nz
+佛兰克林 3 nz
+佛兰德 39 nz
+佛兰芒语 2 nz
+佛典 29 ns
+佛冈 3 ns
+佛冈县 3 ns
+佛利 2 nz
+佛力 3 nz
+佛劳伦斯 3 ns
+佛协 3 n
+佛口蛇心 3 n
+佛号 41 nz
+佛吉尼亚 2 ns
+佛国 54 ns
+佛土 3 nz
+佛坪 6 ns
+佛坪县 3 ns
+佛堂 75 nz
+佛塔 374 nz
+佛头 14 n
+佛头加秽 3 n
+佛头着粪 2 n
+佛头著粪 3 n
+佛如 3 ns
+佛学 132 n
+佛学界 3 nz
+佛学院 5 nz
+佛宝 3 nz
+佛家 113 n
+佛家弟子 3 n
+佛家语 3 nz
+佛寺 158 nz
+佛尔 10 nz
+佛山 264 ns
+佛山人 9 nz
+佛山市 37 ns
+佛州 2 ns
+佛得角 66 ns
+佛得角共和国 3 ns
+佛得角非洲独立党 2 ns
+佛心 3 n
+佛心蛇口 3 n
+佛性 3 n
+佛性禅心 3 n
+佛手 43 n
+佛手柑 3 n
+佛手瓜 3 n
+佛拉 16 nz
+佛拉明戈 3 nrt
+佛拉芒 3 n
+佛提树 3 n
+佛教 2594 nz
+佛教协会 259 nt
+佛教史 26 n
+佛教徒 103 n
+佛教文化 3 nz
+佛教界 10 n
+佛教论坛 3 n
+佛是金妆 3 n
+佛朗哥 5 nz
+佛森 4 nz
+佛殿 51 nz
+佛法 228 nz
+佛法徒 3 n
+佛法无边 3 nz
+佛波醇 3 nz
+佛洛伊德 3 nrt
+佛洛依德 3 nz
+佛湾 7 ns
+佛灯 3 nz
+佛爷 89 n
+佛牙 22 ns
+佛珠 137 nz
+佛甲草 3 nz
+佛眼佛心 3 nz
+佛眼相看 3 i
+佛祖 219 n
+佛经 285 nz
+佛罗伦 3 ns
+佛罗伦萨 296 ns
+佛罗伦萨队 2 nz
+佛罗多 3 ns
+佛罗棱萨 3 ns
+佛罗里 3 ns
+佛罗里达 125 ns
+佛罗里达州 74 ns
+佛罗里达海峡 19 ns
+佛老 3 n
+佛肚竹 3 n
+佛脚 3 ns
+佛蒙特 3 ns
+佛蒙特州 7 ns
+佛要金装 3 n
+佛诞 3 n
+佛诞节 8 n
+佛语 3 nz
+佛跳墙 3 nz
+佛释 3 n
+佛门 204 ns
+佛门弟子 41 n
+佛阁 5 nz
+佛陀 149 nz
+佛青 3 nz
+佛香阁 13 nz
+佛骨 3 n
+佛龛 29 n
+作 28016 v
+作业 1525 n
+作业区 18 n
+作业吃水 3 n
+作业员 3 n
+作业处理 2 n
+作业录入 3 n
+作业成绩 3 n
+作业控制 9 n
+作业本 21 n
+作业机 2 n
+作业条件 3 n
+作业点 3 n
+作业状态 2 n
+作业管理 3 n
+作业簿 3 n
+作业系统 3 n
+作业线 3 n
+作业组 4 n
+作业负担 3 n
+作业量 9 n
+作业面 3 n
+作业题 3 n
+作东 26 n
+作为 28567 v
+作主 154 v
+作乐 28 n
+作乱 88 v
+作事 3 n
+作事不时 3 i
+作人 21 n
+作代会 4 n
+作件 3 n
+作价 51 n
+作伐 2 n
+作伥 3 i
+作伪 106 n
+作伪者 3 n
+作伪证 3 j
+作伪证者 3 n
+作伴 66 n
+作伴儿 17 n
+作何 3 n
+作何解释 3 n
+作作有芒 3 n
+作俑 3 n
+作保 28 v
+作假 57 n
+作假者 4 n
+作兴 3 v
+作准 3 n
+作出 8169 v
+作出公断 3 n
+作出努力 3 n
+作出反应 3 n
+作出姿态 3 i
+作出指示 3 v
+作出评价 3 n
+作出贡献 3 n
+作别 137 n
+作到 37 v
+作功 3 n
+作势 119 n
+作协 68 v
+作古 22 n
+作古正经 3 n
+作呕 36 v
+作品 9248 n
+作品名称 3 n
+作品展 49 n
+作品展览 3 n
+作品版权 3 n
+作品简介 3 i
+作品选 23 n
+作品集 48 n
+作响 363 n
+作善降祥 3 n
+作困兽斗 3 i
+作图 61 n
+作图器 3 n
+作坊 380 n
+作坊式 9 n
+作壁上观 23 n
+作声 3 n
+作奇 2 n
+作奸犯科 25 n
+作好 254 v
+作好作歹 4 i
+作如是观 4 i
+作威作福 57 n
+作嫁 3 v
+作嫁衣裳 3 n
+作孽 108 n
+作宅 3 n
+作官 3 n
+作客 70 n
+作家 3358 n
+作家出版社 9 nt
+作家列表 3 n
+作家协会 3 nt
+作家网 3 n
+作家群 13 n
+作对 276 v
+作小服低 3 n
+作崇 3 v
+作工 13 n
+作庄 3 n
+作序 3 n
+作序言 3 n
+作废 80 v
+作弄 68 v
+作弊 203 n
+作弊器 3 n
+作弊码 3 n
+作弊者 3 n
+作态 3 n
+作怒 3 v
+作怪 147 v
+作息 73 n
+作息制度 3 n
+作息时间 52 n
+作恶 96 v
+作恶多端 103 i
+作恶者 2 n
+作戏 3 n
+作成 147 v
+作战 10812 v
+作战区 25 n
+作战处 9 n
+作战室 20 n
+作战方案 3 n
+作战服 8 n
+作战科 10 nz
+作战经验 3 n
+作战部 56 n
+作手脚 3 n
+作揖 181 v
+作操 3 n
+作数 3 n
+作文 660 n
+作文法 3 n
+作文簿 3 n
+作文网 3 n
+作文课 3 n
+作文选 3 n
+作文集 3 n
+作文题 22 n
+作文题目 3 n
+作料 33 n
+作曲 325 n
+作曲家 400 n
+作曲法 2 n
+作曲系 10 n
+作曲者 4 n
+作月子 3 n
+作案 80 n
+作案人 11 n
+作案分子 3 n
+作案动机 3 n
+作案嫌疑 3 z
+作案工具 3 n
+作案时间 3 n
+作案现场 3 n
+作案者 2 n
+作梗 38 n
+作梦 3 n
+作槽 3 n
+作歹 3 n
+作死 3 v
+作殊死战 3 n
+作法 354 n
+作法自弊 3 i
+作法自毙 5 i
+作活 3 v
+作派 26 n
+作浪兴风 3 n
+作滴答声 3 n
+作爱 3 v
+作物 1282 n
+作物布局 3 n
+作物栽培 3 vn
+作物气象 3 n
+作物科学 3 n
+作物组合 3 n
+作物起源 3 n
+作生意 3 n
+作用 22078 v
+作用力 93 n
+作用域 3 n
+作用点 17 n
+作画 150 n
+作痛 3 n
+作登乡 2 n
+作礼拜 3 n
+作祟 95 v
+作福作威 3 n
+作秀 51 n
+作笔记 3 n
+作答 182 v
+作罢 136 v
+作者 4024 n
+作者姓名 3 i
+作者简介 3 i
+作者群 6 n
+作育人材 3 n
+作脸 3 n
+作舍道旁 3 n
+作舍道边 3 n
+作船 3 n
+作色 3 n
+作艺 3 n
+作茧自缚 14 i
+作裁判 3 n
+作言造语 3 n
+作训 38 n
+作训服 30 n
+作记号 3 n
+作证 230 v
+作词 21 n
+作词家 3 n
+作诗 3 n
+作贡献 3 n
+作账 3 v
+作贱 18 n
+作贱自己 3 i
+作贼 3 n
+作贼心虚 20 i
+作赔 3 v
+作践 87 v
+作辍无常 3 nr
+作过 3 v
+作金石声 3 n
+作陪 72 v
+作难 17 n
+作风 1524 n
+作风严谨 3 i
+作风修养 3 n
+作风正派 3 n
+作风民主 3 n
+作风浮夸 3 i
+作风粗暴 3 i
+作风纪律 3 n
+作风过硬 3 i
+作风霸道 3 n
+作饭 3 v
+作鬼 10 n
+作鬼脸 3 i
+作鸟兽散 24 i
+佝 15 n
+佝偻 127 v
+佝偻病 52 n
+佝瘘病 3 vn
+佞 86 zg
+佞人 3 n
+佞佛 3 n
+佞口 3 n
+佞笑 3 n
+佞臣 114 n
+佟 230 nr
+佟伟杰 2 nr
+佟佳氏 6 nr
+佟公爷 2 nr
+佟养性 2 nr
+佟军门 3 nr
+佟国纲 44 nr
+佟国维 4 nr
+佟图赖 12 nr
+佟大雷 197 nr
+佟大霄 2 nr
+佟夫人 27 nr
+佟妹妹 3 nr
+佟娘娘 2 nr
+佟家姐姐 2 nr
+佟家栋 10 nr
+佟小雷 30 nr
+佟湘玉 3 nr
+佟皇亲 6 nr
+佟麟阁 16 nr
+你 234587 r
+你一言 30 l
+你一言我一语 52 i
+你中有我 18 i
+你争我夺 19 l
+你们 21386 r
+你们好 47 l
+你俩 3 r
+你唱我和 3 i
+你夺我争 3 l
+你好 725 l
+你好坏 3 l
+你家 714 r
+你报 24 r
+你推我让 3 l
+你来我往 79 l
+你死我活 201 i
+你老 321 r
+你追我赶 15 l
+佡 4 zg
+佣 932 n
+佣中佼佼 3 n
+佣书 3 n
+佣人 165 n
+佣仆 3 n
+佣兵 3 n
+佣兵团 3 n
+佣奴 3 n
+佣工 298 n
+佣懒 3 n
+佣耕 3 n
+佣金 127 n
+佣金制 3 n
+佣钱 3 n
+佤 50 nz
+佤族 72 nz
+佥 137 g
+佥都御史 25 n
+佩 539 zg
+佩丁冬 4 nr
+佩之剑 6 nr
+佩佩亚 2 nr
+佩佩尔 3 nr
+佩克 14 nrt
+佩克尔曼 2 nrt
+佩克曼 7 nr
+佩克欧 4 nr
+佩兰 9 nr
+佩内塔 10 nr
+佩内明 4 nr
+佩内洛普 3 nrt
+佩刀 111 nr
+佩切湾 11 nr
+佩列尔 2 nr
+佩利 2 nrt
+佩利佐 6 nr
+佩剑 113 nr
+佩勒利 4 nr
+佩吉特 6 nr
+佩奇 16 nrt
+佩奇制 3 nr
+佩尔 10 nrt
+佩尔修斯 3 nr
+佩尔戈 2 nrt
+佩尔松 3 nr
+佩尔森 6 nr
+佩尔狄 3 nr
+佩尔蒂尼 3 nrt
+佩尼亚 5 nr
+佩尼韦蒂 2 nrt
+佩带 90 n
+佩带在 3 nr
+佩带着 3 n
+佩德 7 nrt
+佩德拉 3 nrt
+佩德森 4 nr
+佩德罗 25 nr
+佩思 2 nr
+佩戴 217 v
+佩戴桂冠 3 nr
+佩拉 4 nrt
+佩挂 3 v
+佩文斋 5 nr
+佩文韵 3 nr
+佩斯 28 nrt
+佩斯利 2 nrt
+佩斯卡拉 2 nrt
+佩斯捷 3 nr
+佩斯维尔 2 nrt
+佩服 1245 v
+佩服之致 3 nr
+佩林 7 nr
+佩楚奇 2 nr
+佩洛塔斯 4 nrt
+佩滕科 2 nr
+佩烈杰 2 nr
+佩特 6 nrt
+佩特拉 30 nrt
+佩特森 7 nr
+佩特洛 5 nr
+佩特里 3 nrt
+佩玉 21 nr
+佩环 3 nr
+佩珀 2 nrt
+佩着 3 v
+佩紫怀黄 3 nr
+佩纳明 5 nr
+佩纳菲 3 nr
+佩罗 5 nrt
+佩罗塔 3 nrt
+佩罗夫 4 nr
+佩耶夫 2 nr
+佩舍尔 2 nr
+佩花 3 nr
+佩萨罗 2 nr
+佩萨莫 2 nr
+佩蒂特 4 nr
+佩蒂翁 13 nr
+佩西 2 nrt
+佩西奥 3 nrt
+佩西奥利 2 nrt
+佩里 50 nrt
+佩里哈 2 nrt
+佩金字 2 nr
+佩银字 2 nr
+佩雷托 5 nrt
+佩雷拉 31 nrt
+佩雷斯 27 nr
+佩韦佩弦 3 nr
+佩顿 15 nrt
+佩饰 27 v
+佩香囊 2 nr
+佩鲁吉诺 3 nr
+佩鲁甲 3 nr
+佩鲁贾 11 nr
+佩鲁齐 2 nr
+佩龙文 2 nr
+佬 366 ng
+佮 3 zg
+佯 191 v
+佯伪 3 v
+佯动 15 v
+佯嗔 3 v
+佯改 3 v
+佯攻 50 v
+佯死 3 v
+佯狂 4 v
+佯称 10 v
+佯笑 3 v
+佯细 3 v
+佯装 82 v
+佯装不知 3 v
+佯言 3 v
+佯轮诈败 3 nz
+佯输诈败 3 nz
+佯降 3 v
+佯风诈冒 3 vn
+佰 7 m
+佰草集 3 vn
+佲 58 zg
+佳 2412 a
+佳丽 40 ns
+佳乐水 3 n
+佳人 164 n
+佳人才子 3 n
+佳人薄命 3 nz
+佳作 175 n
+佳作奖 3 n
+佳佳 3 nz
+佳佳影院 3 nt
+佳佳艾 3 i
+佳侣 3 n
+佳偶 27 n
+佳偶天成 3 nz
+佳儿佳妇 3 n
+佳兵不祥 3 nz
+佳冬 3 t
+佳利 3 nz
+佳县 4 ns
+佳句 27 n
+佳品 64 n
+佳园 3 n
+佳城 2 ns
+佳境 14 n
+佳士得 4 nz
+佳妙 3 n
+佳婿 7 n
+佳客 3 n
+佳宾 5 ns
+佳日 3 t
+佳旺 3 ns
+佳景 6 n
+佳期 12 n
+佳期已近 3 n
+佳木斯 70 ns
+佳木斯大学 2 nt
+佳木斯市 18 ns
+佳木斯港 3 ns
+佳构 3 n
+佳洁士 11 n
+佳的美 3 ns
+佳篇 3 n
+佳约 3 ns
+佳绩 100 n
+佳美 3 nz
+佳肴 1657 n
+佳肴珍馐 3 n
+佳肴美酒 3 nz
+佳能 36 n
+佳能公司 7 n
+佳节 169 n
+佳茗 3 n
+佳讯 3 nz
+佳评 3 n
+佳评如潮 3 i
+佳话 75 n
+佳貌 3 nz
+佳软 3 n
+佳软中国 3 nt
+佳运 3 n
+佳通 3 nz
+佳酿 29 n
+佳里 3 ns
+佳闻 3 n
+佳音 17 n
+佳音频传 2 nz
+併 92 zg
+佶 8 g
+佶屈聱牙 5 i
+佷 652 zg
+佸 2603 zg
+佹 907 zg
+佹形僪状 3 v
+佹得佹失 3 v
+佺 562 zg
+佻 8 g
+佻身飞镞 3 n
+佼 35 zg
+佼佼 3 n
+佼佼者 127 n
+佼容 3 n
+佼貌 3 n
+佽 480 zg
+佾 6 g
+佾舞生 3 z
+使 64655 v
+使不得 183 v
+使乖弄巧 3 nr
+使人昭昭 3 l
+使令 21 v
+使出 631 v
+使剑者 7 n
+使功不如使过 2 l
+使劲 906 v
+使劲儿 23 n
+使劲顶 3 n
+使君 73 v
+使君子 12 n
+使命 1191 v
+使命感 129 n
+使唤 232 v
+使嘴使舌 3 l
+使团 183 n
+使坏 3 v
+使女 33 n
+使役 42 v
+使徒 58 n
+使得 3483 v
+使心作倖 3 v
+使心作幸 3 n
+使心别气 3 l
+使心用倖 3 v
+使心用幸 3 n
+使心用腹 3 n
+使性傍气 3 z
+使性子 11 l
+使性掼气 3 v
+使性谤气 3 n
+使愚使过 3 v
+使料所及 3 l
+使智使勇 3 l
+使然 133 v
+使用 24035 v
+使用不当 3 l
+使用寿命 3 n
+使用性能 3 n
+使用手册 3 l
+使用手记 3 n
+使用指南 3 l
+使用方便 3 l
+使用暴力 3 l
+使用期 11 n
+使用权 220 n
+使用版 3 v
+使用率 43 n
+使用税 9 n
+使用者 285 n
+使用证 3 n
+使用费 38 n
+使用量 104 n
+使眼色 184 l
+使羊将狼 3 n
+使者 938 n
+使臂使指 3 n
+使臂指使 3 n
+使臣 364 n
+使舵 3 v
+使节 497 n
+使节团 20 n
+使蚊负山 3 n
+使贤任能 3 l
+使贪使愚 3 nr
+使酒骂坐 3 n
+使酒骂座 3 n
+使领馆 154 n
+使馆 768 n
+使馆区 284 n
+侀 287 zg
+侁 8 zg
+侂 29 zg
+侃 101 i
+侃价 9 v
+侃侃 52 d
+侃侃而言 3 i
+侃侃而谈 99 i
+侃侃訚訚 3 i
+侃侃谔谔 3 nr
+侃大山 11 i
+侃山 3 v
+侃快 3 d
+侃直 3 d
+侄 991 n
+侄儿 632 n
+侄外孙 3 n
+侄女 248 n
+侄女儿 19 n
+侄女婿 4 n
+侄妇 3 n
+侄婿 3 n
+侄媳 15 n
+侄媳妇 14 n
+侄子 192 n
+侄孙 51 n
+侄孙女 15 n
+來 22 zg
+侈 54 vg
+侈丽闳衍 3 nr
+侈人观听 3 vn
+侈侈不休 3 v
+侈恩席宠 3 nr
+侈纵偷苟 3 i
+侈衣美食 3 nz
+侈言 3 v
+侈谈 10 v
+侈谈和平 3 z
+侈靡 4 a
+侉 17 n
+侉子 5 n
+侊 222 zg
+例 2753 v
+例举 3 v
+例会 63 v
+例假 31 v
+例假日 3 i
+例句 30 n
+例外 1198 v
+例外情况 3 n
+例如 6232 v
+例如说是 3 i
+例子 1607 n
+例数 3 n
+例文 8 n
+例案 3 n
+例牌 2 v
+例直禁简 3 i
+例示 18 v
+例程 2 n
+例行 817 v
+例行公事 58 n
+例行决策 3 n
+例行工作 3 n
+例行差事 3 i
+例行程序 3 n
+例规 3 n
+例言 4 v
+例证 189 v
+例证法 2 n
+例语 3 n
+例题 50 n
+侌 2 zg
+侍 1204 nr
+侍一夫 3 nr
+侍中 7 nr
+侍中淳 2 nr
+侍中王 2 nr
+侍中萧 2 nr
+侍之制 2 nr
+侍之名 3 nr
+侍书 9 n
+侍书雪 2 nr
+侍人 2 n
+侍仆 30 nr
+侍从 279 v
+侍从官 3 nr
+侍从长 3 nr
+侍传奏 3 nr
+侍传旨 2 nr
+侍候 528 n
+侍儿取 2 nr
+侍公主 2 nr
+侍养 3 n
+侍剑听 3 nr
+侍剑姊 16 nr
+侍卖官 3 nr
+侍卫 1950 nr
+侍卫官 8 nr
+侍卫长 11 n
+侍唐廷 3 nr
+侍回家 2 n
+侍太监 30 nr
+侍奉 180 nr
+侍女 312 n
+侍妾 3 n
+侍子 4 n
+侍子如 2 nr
+侍子定 2 nr
+侍子留 2 nr
+侍孙海 3 nr
+侍宗爱 3 nr
+侍官 3 n
+侍宫女 4 nr
+侍宴 4 n
+侍已非 3 nr
+侍师父 4 nr
+侍应 15 v
+侍应生 4 nr
+侍弄 23 v
+侍役 10 n
+侍御史 75 nr
+侍执巾节 3 nr
+侍李舜 4 nr
+侍李谦 2 nr
+侍樊丰 2 nr
+侍汤奉 2 nr
+侍班阁 2 nr
+侍生熊 2 nr
+侍皇后 3 nr
+侍皇帝 4 nr
+侍省 4 n
+侍省发 2 nr
+侍禁庐 3 nr
+侍立 183 v
+侍立在 53 nr
+侍立御 3 nr
+侍立门 2 nr
+侍立闯 2 nr
+侍立阶 6 nr
+侍章京 2 nr
+侍童 4 n
+侍管霸 2 nr
+侍老爷 3 nr
+侍者 117 n
+侍臣奏 2 nr
+侍臣扶 2 nr
+侍臣闻 2 nr
+侍董琬 3 nr
+侍许嘉 3 nr
+侍诸王 3 nr
+侍读 2 v
+侍读学士 15 n
+侍贾母 2 nr
+侍近臣 2 nr
+侍郎 1490 nr
+侍酒 3 n
+侍魂 3 n
+侎 30 zg
+侏 13 t
+侏儒 64 nr
+侏儒一节 3 nr
+侏儒症 4 n
+侏儒观戏 3 nr
+侏罗 23 nr
+侏罗世 38 nr
+侏罗系 24 nr
+侏罗纪 138 t
+侑 43 g
+侒 19 zg
+侓 2 zg
+侔 42 g
+侔色揣称 3 vn
+侗 237 zg
+侗乡 2 nz
+侗寨 5 nz
+侗族 853 nz
+侚 4 zg
+供 8136 v
+供不应求 150 l
+供不起 9 l
+供事 3 n
+供产销 2 n
+供人 3 n
+供住 3 v
+供体 41 n
+供佛 3 n
+供养 872 v
+供养人 17 n
+供养父母 3 l
+供冷 3 vn
+供出 3 v
+供制 3 vn
+供办 3 v
+供参考 5 l
+供品 34 n
+供售 3 vn
+供堂 3 n
+供大于求 62 l
+供奉 1188 v
+供应 2615 vn
+供应价格 3 n
+供应司 2 n
+供应品 10 n
+供应商 270 n
+供应器 3 n
+供应国 20 n
+供应地 29 n
+供应处 9 n
+供应方 7 n
+供应点 4 n
+供应科 6 n
+供应站 13 n
+供应粮 3 n
+供应线 7 n
+供应者 12 n
+供应舰 6 n
+供应船 4 n
+供应部 3 n
+供应量 97 n
+供应链 140 n
+供房 3 n
+供招 3 n
+供排水 4 l
+供料 3 n
+供方 7 n
+供暖 35 v
+供暖系统 3 l
+供暖费 3 n
+供果 3 n
+供案 2 n
+供桌 60 n
+供楼 3 n
+供气 41 n
+供气站 3 n
+供氢裂化 3 n
+供水 255 n
+供水干管 3 n
+供水管 3 n
+供水系统 3 l
+供水量 4 n
+供求 506 v
+供求信息 3 i
+供求关系 3 l
+供求失调 3 i
+供求平衡 3 i
+供求律 3 n
+供求矛盾 3 l
+供求网 3 n
+供油 21 n
+供油泵 3 n
+供热 77 vn
+供热量 2 n
+供状 18 n
+供献 20 n
+供用电 2 n
+供电 288 vn
+供电局 46 nt
+供电所 2 nt
+供电站 3 n
+供电系统 26 l
+供电量 2 n
+供神 3 n
+供种 5 n
+供称 5 v
+供稿 40 n
+供粮 3 n
+供给 1175 vn
+供给制 43 n
+供给方 2 n
+供给燃料 3 n
+供给者 8 n
+供给部 8 n
+供给量 34 n
+供者 11 n
+供职 206 vn
+供膳宿 3 vn
+供血者 7 n
+供认 33 v
+供认不讳 15 l
+供词 32 n
+供货 159 n
+供货商 25 n
+供货期 3 n
+供货渠道 3 n
+供货量 2 l
+供过于求 41 l
+供述 35 vn
+供述动机 3 n
+供选择 3 l
+供配电 3 n
+供销 136 vn
+供销业 3 n
+供销中心 3 l
+供销合作 3 n
+供销合同 3 n
+供销员 10 n
+供销商 3 n
+供销社 126 n
+供销科 2 n
+供销系统 3 l
+供销部门 3 n
+供需 162 n
+供需双方 3 l
+供需失调 3 l
+供需平衡 3 n
+供需矛盾 3 l
+供需见面 3 n
+供餐 3 n
+侜 3 zg
+侜张为幻 3 nr
+依 4797 d
+依丱附木 3 nz
+依丽莎白 3 nr
+依人 3 n
+依人作嫁 3 i
+依人篱下 3 i
+依从 193 p
+依从关系 3 l
+依从性 3 nr
+依仗 179 v
+依例 3 n
+依侍 3 v
+依依 111 z
+依依不舍 82 i
+依依恋恋 3 nr
+依依惜别 15 i
+依依难舍 2 i
+依偎 107 v
+依傍 53 v
+依傍在 3 i
+依兰 38 nr
+依兰县 11 ns
+依兰特 3 nr
+依兰镇 2 nr
+依其 3 d
+依凭 12 v
+依利诺 3 nr
+依利达 3 nr
+依命 2 v
+依品 3 n
+依地酸二钠 2 nz
+依多金 4 nr
+依头缕当 3 z
+依头顺尾 3 i
+依妹儿 3 nr
+依存 161 v
+依存关系 3 l
+依存度 19 n
+依存性 3 n
+依存链 3 n
+依安 3 nr
+依安县 3 ns
+依官 3 n
+依小妹 2 nr
+依小弟 4 nr
+依小生 2 z
+依山傍水 304 i
+依师兄 2 nr
+依序 3 n
+依序是 3 l
+依归 104 v
+依律 23 d
+依循 27 v
+依循着 3 n
+依心像意 3 n
+依恃 21 v
+依恋 200 v
+依成法 16 n
+依我来看 3 l
+依我看 140 l
+依我看来 3 l
+依托 629 v
+依据 3856 p
+依据事实 3 n
+依旧 1495 z
+依旧会 3 l
+依星 3 n
+依曼结构 9 n
+依杖 3 n
+依柳辛 3 nr
+依样 4 d
+依样画葫 3 l
+依样画葫芦 8 l
+依样葫芦 43 l
+依次 1959 d
+依此 3 d
+依此类推 47 l
+依法 2359 n
+依法严办 3 i
+依法严惩 3 n
+依法制裁 3 n
+依法办事 3 l
+依法办案 3 n
+依法办理 3 l
+依法取缔 3 l
+依法处理 3 l
+依法惩治 3 i
+依法打击 3 l
+依法执法 3 n
+依法查处 3 l
+依法治国 3 ns
+依法治理 3 l
+依法炮制 3 l
+依法砲制 3 vn
+依法罢免 3 i
+依法行事 3 n
+依法行政 3 n
+依法追究 3 l
+依法逮捕 3 vn
+依波 2 n
+依流平进 3 l
+依然 3628 d
+依然如故 23 i
+依然故我 17 i
+依照 3359 p
+依物 3 n
+依率 3 n
+依理 4 v
+依稀 320 d
+依稀可见 158 l
+依稀记得 3 l
+依约 3 d
+依纪 10 n
+依纳 3 v
+依经傍注 3 i
+依维斯 3 nr
+依缘 3 n
+依翠偎红 3 i
+依老卖老 3 i
+依臣 17 n
+依草附木 3 i
+依葫芦画瓢 6 i
+依规蹈矩 3 i
+依言 38 n
+依计 3 v
+依语 2 nz
+依赖 1660 v
+依赖于 3 v
+依赖图 3 nr
+依赖型 4 n
+依赖度 24 n
+依赖思想 3 n
+依赖性 147 n
+依赖感 5 n
+依赖成性 3 n
+依赖症 3 n
+依赖边 3 nr
+依达乡 3 l
+依违 2 v
+依违不决 3 i
+依违两可 3 i
+依通 3 v
+依通县 3 ns
+依那普利 2 ns
+依门傍户 3 i
+依门卖笑 3 l
+依阿华 5 nr
+依阿华州 5 ns
+依阿取容 3 nr
+依附 466 v
+依附于 3 nr
+依附性 21 n
+依随 3 v
+依靠 3149 v
+依靠人民 3 n
+依靠群众 3 i
+依靠职工 3 n
+依靠集体 3 n
+依韵 3 n
+依顺 11 nr
+依顺着 3 l
+侠 981 nr
+侠义 259 n
+侠义精神 3 i
+侠义道 3 n
+侠之大 3 i
+侠之大者 3 n
+侠侣 3 n
+侠士 40 n
+侠女 19 n
+侠客 225 n
+侠客岛 3 n
+侠客游 3 n
+侠客狂花 3 i
+侠客行 3 n
+侠心 3 n
+侠气 12 n
+侠溪 3 n
+侠白 3 a
+侠盗 13 n
+侠肝义胆 9 i
+侠行 3 n
+侠辣 3 a
+侠风 3 n
+侠骨 24 n
+価 2 zg
+侣 139 zg
+侣伴 3 n
+侤 6 zg
+侥 69 a
+侥幸 657 a
+侥幸取胜 3 nz
+侥幸心理 3 vn
+侥幸获胜 3 nz
+侦 220 v
+侦候 3 n
+侦办 9 v
+侦办案件 3 n
+侦听 109 v
+侦听台 3 n
+侦听员 3 n
+侦听器 3 n
+侦察 2110 v
+侦察兵 102 n
+侦察员 74 n
+侦察器 2 n
+侦察地形 3 n
+侦察排 7 n
+侦察机 462 n
+侦察车 3 n
+侦察连 14 n
+侦察队 11 n
+侦探 82 v
+侦探团 3 n
+侦探小说 32 l
+侦探所 3 n
+侦探片 10 n
+侦探社 3 l
+侦探网 3 n
+侦控 3 v
+侦控措施 3 n
+侦查 397 v
+侦查人员 3 n
+侦查员 8 n
+侦查学 9 n
+侦查局 5 n
+侦查权 14 n
+侦查案件 3 n
+侦查监督 3 n
+侦查终结 3 l
+侦检 3 v
+侦毒 3 v
+侦测 50 v
+侦测器 3 n
+侦测码 3 n
+侦破 106 v
+侦破小说 3 l
+侦破案件 3 n
+侦结 2 v
+侦结率 3 n
+侦缉 28 v
+侦缉队 3 n
+侦获 3 v
+侦讯 3 n
+侦问 3 v
+侦防 3 v
+侦骑 3 n
+侧 3498 v
+侧冲 3 n
+侧击 30 v
+侧刀 3 n
+侧卧 53 v
+侧卧位 3 n
+侧卧法 3 n
+侧厅 8 n
+侧压力 2 n
+侧压系数 3 n
+侧反射 3 nz
+侧台 3 n
+侧后 28 f
+侧后方 16 f
+侧向 59 n
+侧向侵蚀 3 nz
+侧向运移 3 i
+侧向配位 3 n
+侧基反应 3 n
+侧堡 3 n
+侧壁 24 n
+侧天窗 3 n
+侧室 27 n
+侧弯 2 v
+侧影 24 n
+侧支索 3 n
+侧方 23 f
+侧方关系 3 n
+侧方压缩 3 nz
+侧方平衡 3 nz
+侧方运动 3 nz
+侧旁 3 f
+侧板 14 n
+侧枝 38 n
+侧柏 31 n
+侧柏叶 3 n
+侧柱 3 n
+侧根 44 nz
+侧泳 3 vn
+侧滑 5 v
+侧目 100 n
+侧目而视 13 i
+侧睡 3 v
+侧空翻 3 v
+侧笔 3 n
+侧线 145 n
+侧翻 3 v
+侧翼 109 n
+侧翼区 3 n
+侧翼序列 3 n
+侧耳 243 n
+侧耳细听 3 i
+侧脑室 3 n
+侧腹 3 n
+侧舷炮 3 v
+侧芽 11 v
+侧蚀力 3 n
+侧视 21 v
+侧视图 3 n
+侧视圈 3 n
+侧记 26 n
+侧足而立 3 i
+侧身 491 v
+侧身而卧 3 i
+侧边 31 f
+侧近 3 f
+侧部 3 f
+侧重 423 v
+侧重于 3 n
+侧重点 101 n
+侧门 87 n
+侧闻 3 n
+侧面 645 f
+侧面偏重 3 i
+侧面图 3 n
+侧面影象 3 n
+侧面性 3 n
+侧面采光 3 nz
+侨 1073 n
+侨乡 97 n
+侨光商专 3 j
+侨兴 19 nz
+侨办 12 v
+侨务 50 n
+侨务办公室 2 n
+侨务委员 3 n
+侨务工作 3 n
+侨商 6 n
+侨团 2 n
+侨委会 3 j
+侨居 137 v
+侨居国 3 n
+侨居地 3 n
+侨居海外 3 nz
+侨属 2 n
+侨情 4 n
+侨报 5 n
+侨校 3 n
+侨民 188 n
+侨汇 25 n
+侨汇券 3 n
+侨生 3 n
+侨界 11 n
+侨眷 308 n
+侨社 3 n
+侨联 5 nz
+侨胞 169 n
+侨资 4 n
+侨陵 3 n
+侨领 4 n
+侩 14 g
+侪 19 n
+侪辈 26 n
+侬 92 g
+侭多侭少 3 nrt
+侮 317 zg
+侮弄 3 v
+侮慢 19 v
+侮蔑 3 v
+侮辱 428 v
+侮辱性 23 n
+侮辱猥亵 3 v
+侮辱罪 3 nz
+侮骂 3 v
+侯 1246 nr
+侯三爷 2 nr
+侯世军 2 nr
+侯世家 2 nr
+侯世爵 7 nr
+侯世禄 3 nr
+侯东莱 4 nr
+侯义斌 257 nr
+侯之子 3 nr
+侯之孙 3 nr
+侯之封 2 nr
+侯之概 2 nr
+侯事惠 2 nr
+侯二人 6 nr
+侯亲晋 2 nr
+侯人英 13 nr
+侯人雄 6 nr
+侯仁之 7 nr
+侯伟生 2 nr
+侯伯子 4 nr
+侯佩岑 4 nr
+侯俊山 3 nr
+侯健制造 2 nr
+侯健管 2 nr
+侯元年 2 nr
+侯公子 2 nr
+侯关云 2 nr
+侯关某 2 nr
+侯凤菁 3 nr
+侯刘文 5 nr
+侯利仓 2 nr
+侯利红 2 nr
+侯剑锋 2 nr
+侯勋臣 2 nr
+侯勋贵 2 nr
+侯午敦 2 nr
+侯双亭 2 nr
+侯叔献 2 nr
+侯受封 2 nr
+侯司徒 2 nr
+侯君集 16 nr
+侯吴瑾 2 nr
+侯周勃 2 nr
+侯哲安 2 nr
+侯喜瑞 9 nr
+侯国 13 ns
+侯国中 2 nr
+侯国之 4 nr
+侯国兵 2 nr
+侯国如 2 nr
+侯国的 3 nr
+侯国间 10 nr
+侯国鲁 2 nr
+侯均初 2 nr
+侯均方 3 nr
+侯外庐 17 nr
+侯大人 3 nr
+侯大苟 4 nr
+侯天来 3 nr
+侯孝贤 24 nr
+侯宗宾 2 nr
+侯宝山 48 nr
+侯宝林 9 nr
+侯宝璋 2 nr
+侯家庄 14 nr
+侯家窑 2 nr
+侯家骑 2 nr
+侯寨主 4 nr
+侯封伯 2 nr
+侯少华 2 nr
+侯少奎 2 nr
+侯府中 2 nr
+侯府亲 2 nr
+侯张信 256 nr
+侯张良 2 nr
+侯德宾 2 nr
+侯德强 5 nr
+侯德榜 11 nr
+侯德耀 13 nr
+侯志通 3 nr
+侯惧耳 2 nr
+侯成引 2 nr
+侯方域 282 nr
+侯方夏 4 nr
+侯无人 2 nr
+侯明杰 3 nr
+侯晓鸥 2 nr
+侯景之 26 nr
+侯景发 3 nr
+侯景立 2 nr
+侯服玉食 3 n
+侯朝宗 8 nr
+侯李伟 6 nr
+侯李国 4 nr
+侯杨玉 2 nr
+侯树忱 2 nr
+侯殿禄 3 nr
+侯氏制 4 nr
+侯湘婷 3 nr
+侯潜奢 2 nr
+侯爵 114 nr
+侯爵地位 3 nr
+侯爵夫人 3 nr
+侯狼何 2 nr
+侯玉山 5 nr
+侯玉英 52 nr
+侯王庙 3 nr
+侯生才 17 nr
+侯白沙 3 nr
+侯监集 29 nr
+侯相公 8 nr
+侯相埒 2 nr
+侯相楚 2 nr
+侯石亨 5 nr
+侯祥麟 12 nr
+侯继林 3 nr
+侯耀华 3 nr
+侯老爷 6 nr
+侯致仕 3 nr
+侯莫陈 14 nr
+侯薛汴 5 nr
+侯藏兵 31 nr
+侯贵戚 2 nr
+侯贵松 13 nr
+侯赛因 84 nr
+侯跃华 3 nr
+侯车 3 n
+侯迁州 2 nr
+侯选人 2 nr
+侯选皆 2 nr
+侯选者 2 nr
+侯通海 151 nr
+侯逸凡 8 nr
+侯郭英 2 nr
+侯钦孟 3 nr
+侯铁榜 3 nr
+侯长安 256 nr
+侯长荣 3 nr
+侯门似海 3 nr
+侯门公 2 nr
+侯门如海 3 nr
+侯门深似海 4 nr
+侯门艳 2 nr
+侯陈承 2 nr
+侯非常 2 nr
+侯飞文 8 nr
+侯马 48 nr
+侯马市 7 ns
+侯高智 2 nr
+侯魏冉 4 nr
+侯鸟 4 nr
+侯鹤祥 2 nr
+侯龙涛 3 nr
+侲 3 zg
+侳 4 zg
+侵 1187 v
+侵伐 3 v
+侵入 1432 v
+侵入体 3 n
+侵入校正 3 n
+侵入直径 3 n
+侵凌 98 v
+侵华 317 v
+侵华日军 3 n
+侵华日军南京大屠杀遇难同胞纪念馆 3 ns
+侵占 849 v
+侵占到 3 n
+侵占罪 3 n
+侵吞 111 v
+侵吞公款 3 n
+侵夺 55 v
+侵害 383 v
+侵害人 8 n
+侵害到 3 v
+侵并 3 v
+侵扰 177 v
+侵扰到 3 nz
+侵掠 77 v
+侵晓 3 v
+侵晨 3 nz
+侵权 260 v
+侵权人 4 n
+侵权案 7 n
+侵权者 2 n
+侵权行为 3 n
+侵染 56 vn
+侵染源 3 n
+侵犯 1279 v
+侵略 2969 v
+侵略军 733 n
+侵略国 4 n
+侵略性 30 n
+侵略成性 3 n
+侵略战争 3 n
+侵略扩张 3 n
+侵略者 1912 n
+侵蚀 784 v
+侵蚀作用 3 n
+侵蚀到 3 n
+侵蚀土壤 3 n
+侵蚀循环 3 n
+侵蚀性 3 n
+侵蚀面 3 n
+侵袭 319 v
+侵袭到 3 nz
+侵越 19 v
+侶 2 zg
+侷 3 zg
+侸 3 zg
+侹 3 zg
+便 55339 d
+便于 1331 v
+便于工作 3 l
+便于管理 3 l
+便于解决 3 i
+便函 3 v
+便利 1042 a
+便利化 4 v
+便利商店 3 n
+便利店 20 n
+便利形 3 n
+便利性 11 n
+便名 3 a
+便器 3 n
+便士 249 n
+便壶 21 n
+便宜 2013 a
+便宜从事 5 i
+便宜施行 3 i
+便宜行事 16 i
+便宜货 16 n
+便宴 14 v
+便尿 3 v
+便帽 15 v
+便当 294 a
+便当盒 3 n
+便成仁 3 i
+便捷 503 a
+便捷性 5 n
+便携 74 b
+便携包 3 i
+便携式 153 b
+便携式电脑 3 l
+便携性 3 b
+便携机 11 b
+便无权 3 l
+便是 6978 v
+便服 84 v
+便条 12 m
+便条儿 3 n
+便条纸 3 n
+便桶 3 m
+便步 3 m
+便步走 3 l
+便民 71 n
+便民利民 3 n
+便民卡 3 n
+便民店 3 n
+便民措施 3 n
+便民服务 3 n
+便民网 3 n
+便池 5 n
+便溺 11 v
+便盆 10 m
+便益 7 v
+便秘 269 a
+便笺 2 n
+便笺本 3 n
+便签 2 v
+便药 3 v
+便血 44 v
+便衣 237 v
+便衣人员 3 n
+便衣侦探 3 n
+便衣警察 3 n
+便衣队 3 n
+便装 52 v
+便览 3 v
+便车 4 v
+便辞巧说 3 i
+便辟 3 v
+便道 79 v
+便酌 3 v
+便门 10 v
+便鞋 3 n
+便餐 6 v
+便饭 8 v
+係 5 zg
+促 758 v
+促产 3 vn
+促使 1460 v
+促凝剂 3 n
+促分裂原 3 n
+促动 11 v
+促发展 3 nz
+促性腺激 3 l
+促性腺素 3 l
+促成 589 v
+促排卵 3 v
+促智药 3 n
+促狭 26 a
+促生产 20 v
+促织 54 v
+促胃动素 3 n
+促脉 3 v
+促膝 21 v
+促膝交谈 5 i
+促膝谈心 33 i
+促膝长谈 4 i
+促请 15 v
+促进 6674 v
+促进会 87 v
+促进作用 3 n
+促进剂 21 n
+促进性 3 n
+促进改革 3 l
+促进法 7 v
+促进派 3 v
+促退 3 v
+促销 464 v
+促销价 3 n
+促销员 36 n
+促销品 2 n
+促销服 3 n
+促销期 2 n
+促黄体素 3 n
+俄 5645 j
+俄亥俄 88 ns
+俄亥俄州 85 ns
+俄亥俄河 37 ns
+俄何焼戈 3 nz
+俄克拉何马 12 ns
+俄克拉何马州 7 ns
+俄克拉荷 3 n
+俄克拉荷马 3 ns
+俄克拉荷马州 4 ns
+俄共 209 j
+俄内务部 3 nt
+俄军 432 j
+俄军总参谋部 7 nt
+俄军方 3 nt
+俄勒冈 11 ns
+俄勒冈州 14 ns
+俄勒岗 3 ns
+俄北方舰队 7 nt
+俄喀河 3 ns
+俄国 2626 ns
+俄国人 254 nz
+俄国共产 3 j
+俄国家杜马 3 nz
+俄国政府 17 nt
+俄国话 3 n
+俄国防部 28 nt
+俄城 3 ns
+俄外交部 7 nt
+俄外长 3 n
+俄央行 2 nt
+俄尔 4 ns
+俄帝 3 n
+俄式 37 nz
+俄总统 3 n
+俄政府 28 nt
+俄文 78 nz
+俄文版 9 nz
+俄文系 3 nt
+俄文组 3 nt
+俄斯特拉发 15 nz
+俄新社 15 nt
+俄方 134 n
+俄海军 3 nt
+俄狄浦斯 3 ns
+俄皇 3 nz
+俄空军 3 nt
+俄罗斯 6099 ns
+俄罗斯共 3 n
+俄罗斯内务部 2 nt
+俄罗斯博物馆 5 ns
+俄罗斯卢布 4 ns
+俄罗斯国家图书馆 3 nt
+俄罗斯国家杜马 8 ns
+俄罗斯国防部 23 nt
+俄罗斯国际文传电讯社 6 nt
+俄罗斯外交部 3 nt
+俄罗斯太平洋舰队 3 nt
+俄罗斯娃 3 nz
+俄罗斯平 3 ns
+俄罗斯政府 22 nt
+俄罗斯族 31 nz
+俄罗斯杜马 2 ns
+俄罗斯电视台 4 nt
+俄罗斯研究会 3 nt
+俄罗斯科学院 9 nt
+俄罗斯联邦 172 ns
+俄罗斯联邦委员会 3 nt
+俄罗斯联邦政府 2 nt
+俄罗斯语 2 nz
+俄罗斯远东地区 12 ns
+俄罗斯队 16 nt
+俄罗斯黑海舰队 10 nt
+俄联邦 101 nt
+俄联邦安全局 4 nt
+俄联邦政府 7 nt
+俄语 153 nz
+俄语系 3 n
+俄语组 3 n
+俄通社 35 nt
+俄顷 36 d
+俄黑海舰队 9 nt
+俅 292 x
+俇 10 zg
+俉 7 zg
+俊 1411 a
+俊俏 113 a
+俊儿们 3 n
+俊发飘逸 3 i
+俊文 21 nz
+俊朗 20 a
+俊材 3 n
+俊杰 27 nr
+俊杰廉悍 3 i
+俊爽 3 a
+俊男靓女 7 nr
+俊秀 82 a
+俊美 136 a
+俊逸 14 nr
+俊雅 69 a
+俊马 3 nz
+俌 509 zg
+俍 5 zg
+俎 57 nr
+俎上之肉 3 nr
+俎上肉 3 nr
+俎樽折冲 3 nr
+俏 383 a
+俏丽 88 a
+俏丽短发 3 n
+俏似 3 a
+俏佳人 8 n
+俏俏 3 a
+俏唇 3 n
+俏夕阳 3 n
+俏头 3 n
+俏女 3 n
+俏娇娃 3 n
+俏成俏败 3 n
+俏房客 3 n
+俏江南 3 n
+俏生生 17 n
+俏皮 53 a
+俏皮话 20 n
+俏神贯注 3 n
+俏货 2 n
+俏销 3 v
+俏鬼 3 n
+俏黄蓉 3 n
+俐 12 x
+俐落 3 nr
+俐齿伶牙 3 i
+俑 263 ng
+俑坑 5 n
+俓 2 zg
+俔 301 zg
+俕 2 zg
+俗 1429 a
+俗下文字 3 l
+俗不可医 3 l
+俗不可待 3 i
+俗不可耐 16 l
+俗不堪耐 3 i
+俗世 16 v
+俗业 3 n
+俗乐 3 n
+俗事 3 n
+俗人 69 n
+俗体 3 n
+俗体字 7 l
+俗例 3 n
+俗务 68 n
+俗务缠身 3 l
+俗化 3 v
+俗名 573 v
+俗士 3 n
+俗套 44 n
+俗子 3 n
+俗字 15 n
+俗学 3 n
+俗家 83 n
+俗家子弟 3 l
+俗尚 3 n
+俗念 3 n
+俗态 3 n
+俗文学 3 l
+俗曲 3 n
+俗气 53 n
+俗物 25 n
+俗琐 3 a
+俗称 1176 v
+俗缘 3 n
+俗艳 6 a
+俗论 3 n
+俗话 91 v
+俗话说 442 l
+俗话说得好 39 l
+俗语 189 n
+俗语说 3 l
+俗谚 3 n
+俗谚口碑 3 v
+俗谛 3 n
+俘 2454 n
+俘敌 3 n
+俘获 261 v
+俘虏 1137 n
+俘虏营 3 n
+俚 101 zg
+俚俗 102 n
+俚医 3 n
+俚曲 11 n
+俚歌 18 n
+俚言 3 n
+俚语 48 n
+俚谚 3 n
+俛拾仰取 3 nr
+俛拾地芥 3 nr
+俛首帖耳 3 n
+俜 41 zg
+保 5119 v
+保万全 4 nr
+保不住 125 v
+保不定 15 v
+保不齐 5 v
+保丽龙 3 nr
+保举 54 v
+保久 3 a
+保久乳 3 nr
+保产 3 n
+保产供料 3 l
+保亭 17 nr
+保亭县 2 ns
+保亭黎族苗族自治县 2 ns
+保人 33 n
+保价 14 n
+保价信 3 n
+保住 679 v
+保佑 488 v
+保供 3 v
+保修 28 v
+保修包换 3 nr
+保修单 3 n
+保修卡 3 nr
+保修期 7 n
+保修期限 2 n
+保值 77 n
+保值储蓄 3 n
+保健 1093 nr
+保健专家 3 l
+保健产品 3 n
+保健作用 3 n
+保健医 2 nr
+保健员 3 n
+保健品 181 n
+保健型 3 n
+保健室 3 n
+保健所 2 n
+保健操 21 nr
+保健枕 3 nr
+保健法 2 n
+保健球 3 n
+保健用品 3 n
+保健知识 3 n
+保健站 3 n
+保健箱 3 n
+保健网 3 nz
+保健茶 2 nr
+保健药 3 n
+保健费 3 n
+保健酒 96 n
+保健院 12 n
+保健食品 58 n
+保健饮料 3 n
+保全 970 v
+保全人员 3 n
+保全公司 3 n
+保全申请 3 nr
+保全盛誉 3 nz
+保全费 3 n
+保养 327 v
+保养品 3 n
+保养工 3 n
+保养站 3 n
+保养费 3 n
+保养部 3 n
+保养间 3 n
+保军转民 2 n
+保准 42 v
+保利 37 n
+保利剧院 3 nt
+保利大厦 2 ns
+保剑峰 3 nr
+保剑锋 3 nr
+保加利亚 494 ns
+保加利亚人 42 nrt
+保加利亚共和国 7 ns
+保加利亚语 26 nz
+保加利亚队 3 nt
+保加尔 8 nr
+保华殿 3 nr
+保单 74 n
+保卢斯 2 nr
+保卫 1565 v
+保卫人员 3 n
+保卫和平 3 nz
+保卫团 12 n
+保卫国家 3 n
+保卫处 24 n
+保卫局 14 n
+保卫工作 3 n
+保卫战 135 nz
+保卫政权 3 n
+保卫祖国 3 n
+保卫科 21 nz
+保卫组 3 n
+保卫者 17 n
+保卫部 39 n
+保合门 7 n
+保命 59 v
+保命丹 3 nr
+保命田 3 nz
+保命钱 8 n
+保和 8 v
+保和丸 4 nz
+保和殿 296 nr
+保唐僧 23 nr
+保固 3 v
+保固期 3 n
+保国 27 ns
+保国乡 2 n
+保国会 14 nt
+保国卫 2 nr
+保国卫民 3 n
+保国安民 7 n
+保国寺 2 nr
+保国村 2 nr
+保土 9 n
+保土安 2 ns
+保圣寺 3 nr
+保圣教 2 nr
+保坪乡 2 ns
+保境安 19 nr
+保境息民 4 n
+保墒 15 v
+保外 3 v
+保外就医 14 l
+保外执行 3 nt
+保大帅 2 nr
+保太松 2 nr
+保姆 515 nrt
+保姆式 2 nz
+保婴 3 n
+保媒 3 n
+保存 3073 v
+保存信息 2 n
+保存实力 3 l
+保存文档 3 nr
+保存期 14 n
+保存率 2 n
+保存起来 3 l
+保宁 11 ns
+保宁府 2 nr
+保守 762 v
+保守主义 71 n
+保守党 163 n
+保守党人 3 n
+保守党政府 11 n
+保守力 3 n
+保守势力 3 n
+保守序列 3 n
+保守思想 3 n
+保守政府 3 n
+保守机密 3 n
+保守派 110 nr
+保守疗法 8 n
+保守系 3 n
+保守重组 3 n
+保安 478 nz
+保安人员 3 n
+保安厅 58 n
+保安员 11 n
+保安器 8 n
+保安团 73 n
+保安大队 3 nt
+保安局 8 n
+保安族 19 nz
+保安服 3 n
+保安村 3 nr
+保安林 3 nr
+保安警察 3 n
+保安镇 5 ns
+保安队 40 n
+保定 739 v
+保定军校 4 l
+保定市 40 n
+保定路 2 n
+保家 3 n
+保家卫国 45 ns
+保密 675 n
+保密体制 3 n
+保密制度 3 n
+保密守则 3 n
+保密室 4 n
+保密局 11 n
+保密工作 3 n
+保密性 36 n
+保密法 4 n
+保密观念 3 n
+保密锁 3 nr
+保密防谍 3 n
+保尔 51 nrt
+保尔森 2 nr
+保山 77 ns
+保山市 14 ns
+保川会 4 nz
+保州升 2 nr
+保平 3 n
+保平争 10 nz
+保平安 3 ns
+保序映射 3 n
+保底 18 n
+保康 262 a
+保康县 264 ns
+保径钻头 3 i
+保得住 31 v
+保得灵 2 nr
+保德 11 nrt
+保德信 2 nr
+保德县 2 ns
+保息 3 v
+保慈丹 2 nr
+保慧梅 3 nr
+保成 3 v
+保户 4 n
+保护 13874 v
+保护主义 96 n
+保护主义者 4 n
+保护价 44 n
+保护伞 36 n
+保护关税 41 n
+保护剂 5 n
+保护区 424 n
+保护卡 3 n
+保护器 11 n
+保护国 79 n
+保护圈 2 n
+保护地 73 n
+保护套 2 n
+保护局 2 n
+保护层 28 n
+保护性 69 n
+保护意识 3 n
+保护措施 7 n
+保护方式 6 n
+保护期 18 n
+保护权 20 n
+保护林 8 n
+保护模式 3 n
+保护法 60 n
+保护率 4 n
+保护环 3 n
+保护环境 101 n
+保护神 47 n
+保护网 15 n
+保护者 44 n
+保护膜 23 n
+保护色 21 n
+保护装置 3 n
+保护视力 3 n
+保护计算机 3 n
+保护费 6 n
+保护鸟 3 n
+保拉 3 nrt
+保持 10261 v
+保持一致 3 n
+保持中立 3 nr
+保持原状 3 n
+保持平衡 4 n
+保持数据 3 n
+保持晚节 3 n
+保持架 3 n
+保持沉默 3 nr
+保持清洁 3 nr
+保持稳定 12 n
+保持系 3 n
+保持者 18 n
+保持联系 3 n
+保持良好 6 n
+保持警惕 3 nr
+保持足够 4 nr
+保持身材 3 n
+保持高速 3 n
+保收 5 v
+保无虞 4 nr
+保时捷 18 nr
+保暖 85 v
+保暖性 13 n
+保暖房 9 nr
+保暖棚 2 nr
+保有 177 v
+保有储量 25 n
+保有量 12 n
+保本 35 n
+保正 3 v
+保正庄 3 nr
+保正承 2 nr
+保残守缺 3 l
+保母车 3 n
+保民 20 n
+保民卫国 3 ns
+保民官 20 n
+保水 14 n
+保水剂 17 n
+保永全 2 nr
+保河阳 3 ns
+保法止 3 l
+保泰持盈 3 nr
+保泰松 4 nr
+保洁 36 a
+保洁员 3 n
+保洁工 2 n
+保洁箱 3 n
+保津 2 ns
+保津川 2 ns
+保洪忠 2 nr
+保济丸 2 n
+保温 126 n
+保温套 3 nz
+保温层 5 n
+保温材料 3 n
+保温杯 4 nz
+保温板 3 n
+保温桶 3 n
+保温瓶 9 n
+保温管 3 n
+保温箱 3 n
+保温车 2 n
+保湿 62 v
+保湿霜 3 nz
+保溼 3 vn
+保状 3 n
+保用 3 v
+保用期间 3 n
+保用期限 3 n
+保甲 90 n
+保甲法 3 n
+保留 2445 v
+保留住 3 nr
+保留体积 3 n
+保留余地 3 l
+保留值 2 n
+保留剧目 21 n
+保留区 3 n
+保留图书 3 n
+保留地 74 n
+保留字 4 n
+保留意见 3 l
+保留条款 3 n
+保留盈余 3 n
+保留空间 3 n
+保留节目 3 n
+保留项目 3 n
+保皇 31 n
+保皇会 6 nr
+保皇党 11 nr
+保皇兵 3 nr
+保皇军 2 nr
+保皇派 37 nr
+保皇狗 17 nr
+保盈持泰 3 nr
+保监会 3 j
+保监局 3 j
+保真 7 nz
+保真度 4 n
+保票 27 n
+保禄位 4 nr
+保福乡 2 nr
+保福村 3 nr
+保科原 2 ns
+保秘 3 v
+保积函子 3 n
+保税 50 n
+保税仓 3 nr
+保税仓库 3 n
+保税区 47 n
+保管 495 v
+保管人 8 n
+保管员 23 n
+保管室 3 n
+保管箱 3 n
+保管费 5 n
+保管部 7 n
+保级 196 n
+保级圈 7 n
+保级战 6 nz
+保结 3 v
+保统兵 2 n
+保罗 311 nrt
+保罗一世 4 nrt
+保罗三世 3 ns
+保罗胜 6 nr
+保翊冲 2 nr
+保育 58 v
+保育员 7 n
+保育费 2 n
+保育院 22 n
+保胎 8 n
+保苗 4 n
+保荐 272 v
+保荐人 19 n
+保莱塔 3 nr
+保藏 47 v
+保藏品 3 n
+保藏秣草 3 nr
+保警 3 v
+保证 9062 v
+保证书 32 n
+保证价格 3 n
+保证体系 3 n
+保证供应 3 l
+保证供给 3 n
+保证数据 2 n
+保证期 3 n
+保证率 5 n
+保证系统 4 n
+保证质量 3 n
+保证车辆 2 n
+保证金 125 n
+保贞堂 256 nr
+保质 18 n
+保质保量 10 n
+保质期 57 n
+保费 77 v
+保赦 3 v
+保身 3 v
+保送 104 v
+保送入学 3 n
+保送生 103 n
+保释 47 v
+保释人 3 n
+保释金 3 n
+保重 216 v
+保量 3 n
+保金 3 n
+保钓 3 v
+保钓运动 3 l
+保镖 158 n
+保长 146 v
+保防 3 v
+保防工作 3 n
+保防教育 3 l
+保险 2635 n
+保险业 89 n
+保险业务 3 n
+保险丝 24 n
+保险产品 3 n
+保险人 35 n
+保险代理 3 n
+保险信封 3 n
+保险公司 147 n
+保险刀 3 n
+保险制度 3 n
+保险单 37 n
+保险卡 3 n
+保险号 2 n
+保险合同 3 n
+保险商 3 n
+保险套 3 n
+保险学 3 n
+保险客户 3 n
+保险局 4 n
+保险市场 3 n
+保险带 5 n
+保险库 3 n
+保险总额 3 n
+保险期 5 n
+保险期限 3 n
+保险机构 3 n
+保险杆 3 n
+保险杠 5 n
+保险条例 3 n
+保险条款 3 n
+保险柜 59 n
+保险法 37 n
+保险灯 3 n
+保险盒 3 n
+保险管 3 n
+保险箱 27 n
+保险类别 3 n
+保险粉 3 n
+保险经纪 3 n
+保险网 3 n
+保险罩 3 n
+保险行业 3 n
+保险装置 3 n
+保险费 116 n
+保险费率 8 n
+保险费用 12 n
+保险资金 3 n
+保险金 69 n
+保险金额 3 n
+保险门 3 n
+保障 6335 v
+保障人权 3 n
+保障体系 3 n
+保障制度 3 n
+保障卡 5 n
+保障型 2 n
+保障局 36 n
+保障性 20 n
+保障机制 3 n
+保障法 12 n
+保障税 2 n
+保障系统 3 n
+保障线 13 n
+保障计算机 2 n
+保障部 7 n
+保障部门 47 n
+保障金 19 n
+保靖 7 nz
+保靖县 5 ns
+保静军 2 nr
+保额 16 n
+保马法 3 n
+保驾 92 v
+保驾护航 3 nr
+保鲜 118 ns
+保鲜剂 26 nz
+保鲜库 3 nz
+保鲜期 2 n
+保鲜盒 3 nz
+保鲜纸 3 nz
+保鲜膜 13 nz
+保鲜袋 2 nz
+保龄 7 n
+保龄球 123 n
+保龄球场 3 n
+保龄球热 3 n
+保龄球赛 3 vn
+保龄球道 2 n
+保龄球馆 14 n
+俞 693 zg
+俞万春 2 nr
+俞三伯 7 nr
+俞三侠 33 nr
+俞三哥 17 nr
+俞三弟 2 nr
+俞丽拿 5 nr
+俞之阴 4 nr
+俞二伯 10 nr
+俞二侠 28 nr
+俞二叔 2 nr
+俞伯牙 513 nr
+俞作柏 2 nr
+俞作豫 15 nr
+俞允 3 nr
+俞元良 6 nr
+俞先生 2 nr
+俞光远 6 nr
+俞兴茂 2 nr
+俞剑华 5 nr
+俞募配穴 3 ns
+俞国华 3 nr
+俞国宝 3 nr
+俞国申 7 nr
+俞国良 4 nr
+俞大侠 16 nr
+俞大猷 177 nr
+俞大维 2 nr
+俞宗怡 2 nr
+俞宜国 4 nr
+俞家军 5 nr
+俞小凡 256 nr
+俞岱岩 3 nrfg
+俞平伯 15 nr
+俞康宰 45 nr
+俞志忠 48 nr
+俞振飞 7 nr
+俞明震 2 nr
+俞晓松 13 nr
+俞曙霞 2 nr
+俞朝奉 6 nr
+俞正声 266 nr
+俞正山 5 nr
+俞正燮 4 nr
+俞汉谋 10 nr
+俞汝捷 3 nr
+俞济时 2 nr
+俞祖彭 2 nr
+俞福柏 6 nr
+俞秀山 4 nr
+俞良甫 2 nr
+俞莲舟 376 nr
+俞菊笙 3 nr
+俞观文 2 nr
+俞连舟 3 nr
+俞院长 2 nr
+俞顺福 7 nr
+俞飞鸿 3 nr
+俞鸿钧 8 nr
+俞鼎孙 2 nr
+俟 299 zg
+俟机 3 nr
+俟河之清 3 nr
+信 11188 n
+信不信 3 v
+信不过 84 v
+信世凯 2 nr
+信中真 2 nr
+信丰 4 nz
+信丰县 14 ns
+信丰红 2 nr
+信义 110 n
+信义为立 3 nr
+信义千金 3 nz
+信义国中 3 nz
+信义国小 3 n
+信义计划 3 n
+信义路 3 n
+信之理 2 nr
+信乐团 3 n
+信产部 12 n
+信令 9 n
+信以为真 108 i
+信仰 1910 n
+信仰主义 2 n
+信仰危机 3 i
+信仰者 16 n
+信仰自由 3 n
+信件 582 n
+信任 1986 n
+信任他人 3 n
+信任别人 3 n
+信任危机 3 n
+信任度 21 n
+信任感 24 n
+信任投票 8 n
+信任案 3 n
+信任票 10 n
+信众 11 n
+信佛 42 n
+信佛教 3 nz
+信使 127 n
+信儿 42 n
+信元划界 3 n
+信兰成 2 nr
+信函 178 n
+信利 2 n
+信到 3 v
+信包 3 n
+信区 3 n
+信及豚鱼 3 v
+信友 2 n
+信叔 15 n
+信叔贤 3 nr
+信口 99 n
+信口吹 3 nr
+信口开合 3 i
+信口开呵 3 nr
+信口开喝 3 i
+信口开河 129 ns
+信口胡言 8 n
+信口胡说 3 n
+信口雌黄 32 i
+信史 31 n
+信号 2402 n
+信号交换 4 i
+信号传 4 n
+信号兵 3 n
+信号台 4 n
+信号器 3 n
+信号处理 87 n
+信号处理器 9 n
+信号工 3 n
+信号工区 3 n
+信号弹 59 n
+信号强度 3 n
+信号情报 29 n
+信号摆幅 3 n
+信号施工 3 n
+信号旗 14 n
+信号机 25 n
+信号机房 3 n
+信号枪 25 n
+信号楼 3 n
+信号流图 3 n
+信号源 20 n
+信号灯 50 n
+信号电缆 3 n
+信号系统 3 n
+信号线 6 n
+信号肽 3 n
+信号转导 3 n
+信号量 3 n
+信君 2 n
+信命 3 n
+信哉斯 2 nr
+信噪比 20 nz
+信国公 10 nr
+信塞 2 n
+信增 3 v
+信士 7 n
+信大义 2 nr
+信天游 45 nr
+信天翁 32 nr
+信奉 1098 v
+信奉宗教 3 nr
+信奉异教 3 nr
+信奉者 12 nr
+信女 5 n
+信守 117 n
+信守不弃 3 i
+信守不渝 3 i
+信守合同 3 n
+信守诺言 3 nr
+信安江 3 ns
+信宜 9 n
+信宜县 14 ns
+信宜市 3 ns
+信实 2 n
+信宿 7 n
+信封 412 v
+信封袋 3 n
+信小义 2 nr
+信小乘 3 nr
+信小龙 2 nr
+信州 22 ns
+信州区 3 ns
+信差 14 n
+信度 7 n
+信建言 2 nr
+信彩信 2 nr
+信徒 367 n
+信得 3 v
+信得过 125 v
+信徙 3 n
+信德府 4 nr
+信德省 14 ns
+信心 2629 n
+信心倍增 3 i
+信心十足 3 i
+信心危机 3 i
+信心百倍 144 i
+信念 865 n
+信念修正 3 nz
+信性儿 2 n
+信息 12256 n
+信息业 12 n
+信息中心 162 nt
+信息产业 99 n
+信息产业部 269 nt
+信息产业部无线电管理局 3 nt
+信息产业部科技司 6 nt
+信息估计 3 n
+信息内容 33 n
+信息冗余 3 vn
+信息办 5 n
+信息加工 3 n
+信息化 1348 n
+信息卡 6 n
+信息压缩 3 nz
+信息反馈 3 n
+信息司 3 n
+信息员 13 n
+信息处理 119 n
+信息处理系统 25 n
+信息学 49 n
+信息安全 161 nz
+信息家电 3 nz
+信息工程 61 n
+信息库 18 n
+信息廊 3 n
+信息性 5 n
+信息战 43 nz
+信息技术 397 n
+信息提取 3 i
+信息时代 3 n
+信息时报 3 nz
+信息格式 2 nz
+信息检索 51 n
+信息比价 3 n
+信息沟通 3 nz
+信息流 27 n
+信息测度 3 n
+信息港 12 n
+信息源 21 n
+信息点 17 n
+信息熵 15 n
+信息率 3 n
+信息科学 3 nt
+信息管理 79 n
+信息管理系统 7 n
+信息箱 3 n
+信息系统 224 n
+信息组 2 n
+信息结构 4 n
+信息网 391 n
+信息网络 3 n
+信息论 38 n
+信息费 23 n
+信息资源管理 6 n
+信息资讯 3 n
+信息部 17 n
+信息量 107 n
+信息隐蔽 3 n
+信惠悦 2 nr
+信手 35 n
+信手拈来 23 i
+信托 322 n
+信托业 31 n
+信托公司 3 n
+信托局 14 n
+信托投资 3 nz
+信托投资公司 25 nt
+信托法 2 n
+信托贸易 3 n
+信报 100 n
+信报箱 12 n
+信报箱群 12 n
+信报讯 3 n
+信据 2 n
+信摩诃 2 nr
+信教 55 nz
+信教者 13 n
+信文 4 n
+信无义 2 i
+信春鹰 260 nr
+信有德 2 nr
+信服 111 n
+信望 4 v
+信末 2 n
+信札 30 n
+信条 153 n
+信杨过 2 n
+信标 32 n
+信标台 4 n
+信标委 2 n
+信步 114 n
+信步漫游 3 n
+信步而行 24 i
+信步闲游 3 n
+信汇 8 n
+信江 34 ns
+信浓川 2 nr
+信源 46 n
+信燕铁 3 nr
+信牌 3 n
+信物 29 n
+信王 7 n
+信王选 2 nr
+信用 1745 n
+信用制度 3 n
+信用卡 329 n
+信用原则 3 n
+信用可靠 3 i
+信用合作 3 n
+信用度 17 n
+信用放款 3 n
+信用状 3 n
+信用社 166 n
+信用等级 3 n
+信用联社 5 nt
+信用证 61 n
+信用调查 3 l
+信用贷款 3 n
+信用风险 3 n
+信疑 2 v
+信皮 5 n
+信皮儿 3 nr
+信真 3 nz
+信石 31 n
+信社 3 n
+信神 4 n
+信神佛 2 nr
+信称义 7 n
+信稿 3 n
+信笔 3 n
+信笔拈来 3 i
+信笔涂鸦 3 n
+信笔直书 3 n
+信符 16 n
+信笺 85 n
+信筒 3 n
+信简 3 n
+信管 3 n
+信箱 155 n
+信箱号码 3 n
+信箱地址 3 n
+信纲 2 n
+信纸 66 n
+信纸信封 3 n
+信群发 2 nr
+信者 11 n
+信而好古 3 i
+信而有征 3 i
+信而有证 3 i
+信耐 3 n
+信袋 6 n
+信言不美 3 i
+信誉 254 n
+信誉卓着 3 i
+信誉度 12 n
+信誉第一 3 n
+信誉至上 3 i
+信誓旦旦 63 i
+信访 68 v
+信访件 2 n
+信访办 3 n
+信访室 2 n
+信访局 2 n
+信访工作 3 n
+信访部门 3 n
+信诊 3 n
+信贷 633 n
+信贷业务 3 n
+信贷员 18 n
+信贷处 2 n
+信贷政策 3 n
+信贷科 3 n
+信贷管理 3 n
+信贷资金 40 n
+信贷部 4 n
+信贷风险 3 n
+信赏 2 v
+信赏必罚 5 n
+信赖 395 n
+信赖感 9 n
+信路德 2 nr
+信达 3 nz
+信达公司 15 n
+信达资产管理公司 2 nt
+信远斋 2 nr
+信通 2 n
+信通捷 3 nr
+信道 252 n
+信道容量 3 n
+信道编码 3 n
+信邪 38 n
+信邸 2 n
+信郡王 5 nr
+信都芳 4 nr
+信里 3 n
+信重阳 2 nr
+信金邦 2 nr
+信长 3 n
+信阳 167 n
+信阳县 5 ns
+信阳市 13 ns
+信陵公子 3 n
+信陵君 20 nr
+信音乖 2 n
+信风 98 n
+信风带 3 n
+信香 3 n
+信马由缰 7 i
+信鸟 3 n
+信鸽 47 n
+信鸽网 3 nz
+俢 12 zg
+俣 139 x
+俤 5 zg
+俥 4 zg
+俦 70 zg
+俧 19 zg
+俨 136 v
+俨乎其然 3 v
+俨如 11 v
+俨然 272 v
+俨若 3 v
+俩 2508 m
+俩一 27 m
+俩一句 3 m
+俩一场 2 m
+俩一套 2 m
+俩一眼 3 m
+俩个 13 m
+俩出 4 m
+俩分 2 m
+俩双双 3 m
+俩发 2 m
+俩口 11 m
+俩头 2 m
+俩好久 4 m
+俩家 2 m
+俩对 14 m
+俩成 4 m
+俩手 2 m
+俩打 7 m
+俩把 8 m
+俩本 4 m
+俩目 8 m
+俩眼 13 m
+俩站 7 m
+俩终生 2 m
+俩行 5 m
+俪 160 g
+俬 2 zg
+俭 121 ag
+俭不中礼 3 v
+俭以养廉 3 v
+俭以养德 3 v
+俭可养廉 3 v
+俭存奢失 3 i
+俭岁 3 v
+俭故能广 3 v
+俭明 3 a
+俭朴 211 a
+俭汤 12 v
+俭汤乡 2 vn
+俭用 3 v
+俭省 4 v
+俭约 20 v
+俭腹高谈 3 v
+修 6007 v
+修一修 3 nr
+修丁立 2 nr
+修三司 3 nr
+修业 44 n
+修业年限 3 n
+修业期满 3 v
+修为实 4 nr
+修为远 2 nr
+修之士 3 nr
+修习 301 v
+修习之 2 nr
+修习本 3 n
+修习止 3 nr
+修习瑜 2 nr
+修习者 8 n
+修书 3 v
+修书付 2 nr
+修书令 2 nr
+修于清 3 nr
+修仙 50 nr
+修仙求 5 nr
+修仙练 2 nr
+修仙长 2 nr
+修会通 3 nr
+修修 15 v
+修修改改 3 nr
+修修补补 10 nr
+修关 3 v
+修养 627 v
+修养成 3 nr
+修凉州 2 nr
+修函 3 nr
+修凿 14 v
+修到 3 v
+修剪 95 v
+修华丽 2 nr
+修参禅 3 nr
+修史 56 n
+修和财 2 nr
+修善 2 v
+修嗣修 5 nr
+修园子 45 nr
+修国史 22 nr
+修土菲 2 nr
+修城 6 ns
+修堤 2 nr
+修士 45 n
+修复 610 v
+修复一新 3 l
+修复器 3 nr
+修复者 3 nr
+修复过程 3 l
+修夏国 2 ns
+修女 39 n
+修好 41 v
+修学 16 n
+修宗迪 3 nr
+修官 6 n
+修定 7 v
+修家谱 2 nr
+修密书 4 nr
+修庙塑 3 nr
+修建 2616 v
+修建设计 3 nr
+修律 3 n
+修得 3 v
+修得真 2 nr
+修得道 2 v
+修德养 2 nr
+修心养性 13 n
+修憩 3 v
+修成 118 v
+修房 2 n
+修房子 3 nr
+修承天 256 nr
+修护 13 v
+修护国 3 n
+修护液 3 n
+修护站 3 n
+修护队 3 n
+修护露 3 nr
+修持 3 v
+修持禅 2 nr
+修持者 2 n
+修指甲 3 nr
+修撰 14 v
+修改 5259 v
+修改器 3 nr
+修改意见 3 l
+修改文章 3 nr
+修改权 3 nr
+修改案 3 n
+修改版 3 n
+修改稿 5 n
+修改草案 3 n
+修整 111 vn
+修文 15 nr
+修文偃武 3 nrt
+修文兄弟 2 nr
+修文县 6 nr
+修文微 2 nr
+修文殿 4 nr
+修斯钉 2 nr
+修方 2 n
+修方志 2 nr
+修无果 2 nr
+修日语 2 nz
+修旧利废 2 i
+修旧起废 3 i
+修明 103 v
+修明史 9 nr
+修明崇 2 nr
+修昔底 12 nr
+修术行 3 n
+修枝 3 nr
+修枝剪 3 nr
+修桥 12 nr
+修桥补路 3 nr
+修桥铺路 3 ns
+修械所 2 v
+修正 812 nr
+修正主义 266 n
+修正图 3 nr
+修正案 237 n
+修正液 3 nr
+修正版 3 n
+修正率 3 nr
+修正稿 3 n
+修武 15 nr
+修武县 3 ns
+修水 46 v
+修水利 3 nr
+修水县 7 ns
+修永宁 3 nr
+修汴渠 2 nr
+修沈增 2 nr
+修治 24 v
+修治丹 2 nr
+修治兵 3 nr
+修治浚 2 nr
+修浚 11 v
+修清漪 2 nr
+修炼 661 v
+修炼法 3 nr
+修理 596 v
+修理业 3 n
+修理包 3 n
+修理匠 3 n
+修理厂 18 n
+修理工 15 n
+修理店 4 n
+修理所 9 n
+修理点 3 n
+修理站 3 n
+修理者 3 n
+修理行业 3 n
+修理费 18 n
+修理起来 3 l
+修理部 2 n
+修理铺 6 n
+修生祠 3 nr
+修眉凤 4 nr
+修真之 3 nr
+修真养性 5 n
+修真界 3 nr
+修真者 3 nr
+修短 3 v
+修短随化 3 l
+修竹乔 2 nr
+修筑 742 v
+修筑公路 3 n
+修筑工事 3 n
+修筑工程 3 n
+修筑道路 3 n
+修纂 4 v
+修练 76 vn
+修编 8 v
+修缮 1217 v
+修缮一新 3 v
+修缮费 3 vn
+修罗 3 nr
+修罗刀 12 nr
+修罗场 3 ns
+修老尼 2 nr
+修胡刀 3 nr
+修脚 15 v
+修脚师 3 n
+修脸 3 v
+修船 28 v
+修船厂 3 n
+修色斯 16 nr
+修萧荣 2 nr
+修葺 474 v
+修葺一新 12 l
+修行 901 v
+修行在个人 4 n
+修行录 3 n
+修行者 12 n
+修补 358 v
+修补剂 3 n
+修补术 3 nr
+修补者 3 nr
+修订 852 v
+修订本 47 n
+修订案 14 n
+修订版 20 n
+修订稿 150 n
+修订者 3 n
+修词学 3 nr
+修说 2 v
+修读 3 v
+修课 3 v
+修起 3 v
+修路 106 n
+修蹄 3 n
+修身 80 v
+修身养性 24 n
+修身洁行 3 l
+修身砺德 3 nr
+修身齐家 3 l
+修车 24 v
+修车点 3 n
+修车铺 3 n
+修辞 143 v
+修辞学 44 l
+修辞学家 3 l
+修辞手法 3 i
+修辞格 27 nr
+修辞癖 3 n
+修辞立诚 3 nr
+修边机 3 n
+修通 42 v
+修造 128 v
+修造厂 9 n
+修造船 7 n
+修道 178 v
+修道人 3 nr
+修道士 14 nr
+修道院 136 nr
+修配 61 v
+修配业 3 n
+修配厂 10 n
+修铁路 3 nr
+修长 114 v
+修防修 3 nr
+修陈史 2 nr
+修院 5 n
+修院修 3 nr
+修院圣 5 nr
+修陵寝 2 nr
+修面 5 n
+修鞋 5 n
+修鞋匠 3 n
+修鞋店 3 n
+修鞋摊 3 n
+修饰 174 v
+修饰句 3 n
+修饰字 3 n
+修饰符 2 n
+修饰词 3 n
+修饰语 25 n
+修饰边幅 3 n
+修鱼骨 2 nr
+修鳞养爪 3 nr
+修齐 3 nr
+修齐治平 3 ns
+俯 543 v
+俯下 3 v
+俯下去 3 v
+俯仰 125 v
+俯仰之间 2 i
+俯仰唯唯 3 i
+俯仰异观 3 i
+俯仰无愧 2 i
+俯仰由人 2 i
+俯仰角 11 i
+俯仰随人 3 i
+俯伏 124 v
+俯允 3 v
+俯冲 206 v
+俯冲点 3 i
+俯冲角 3 i
+俯卧 35 v
+俯卧撑 22 v
+俯头 3 v
+俯姿 3 n
+俯察 7 v
+俯射 4 v
+俯射角 3 n
+俯就 3 v
+俯念 3 v
+俯拍 3 v
+俯拾 3 v
+俯拾仰取 3 i
+俯拾即是 2 i
+俯拾皆是 9 i
+俯曲 3 v
+俯望 2 v
+俯泳 3 v
+俯看 3 v
+俯瞰 113 v
+俯视 129 v
+俯视图 5 i
+俯视景观 3 i
+俯览 3 v
+俯角 9 n
+俯身 641 v
+俯首 106 v
+俯首下心 3 i
+俯首听命 12 i
+俯首就擒 3 i
+俯首就缚 3 i
+俯首就范 3 l
+俯首帖耳 22 i
+俯首弭耳 3 v
+俯首戢耳 3 v
+俯首甘为孺子牛 3 i
+俯首称臣 14 i
+俯首认罪 3 i
+俯首认错 3 i
+俯首贴耳 4 i
+俰 13 zg
+俱 2295 dg
+俱乐部 1958 n
+俱乐部杯 4 n
+俱乐部赛 2 n
+俱乐部队 16 n
+俱佳 41 a
+俱全 362 v
+俱发 3 v
+俱备 34 n
+俱往 3 v
+俱收并蓄 3 n
+俳 87 ng
+俳优 14 n
+俳句 18 n
+俵 9 zg
+俶 58 zg
+俸 475 nr
+俸恤 3 n
+俸禄 241 n
+俸给 3 n
+俸褖 3 n
+俸钱 3 n
+俺 2596 r
+俺也来 3 vn
+俺们 311 r
+俺家 96 r
+俺村 11 r
+俻 2 zg
+俽 4 zg
+俾 224 zg
+俾众周知 3 ns
+俾夜作昼 3 nr
+俾斯麦 126 nrt
+俾斯麦群岛 11 ns
+俾昼作夜 3 v
+俾有所悟 3 ns
+俾能 3 nrt
+俾资挹注 3 vn
+俾路支 29 ns
+俾路支省 11 ns
+俾面 3 nrt
+倀 2 zg
+倁 2 zg
+倅 5 zg
+倈 2 zg
+倉 9 zg
+個 13 zg
+倌 95 g
+倍 4282 m
+倍低音 3 n
+倍倍尔 13 nr
+倍偿 3 v
+倍儿 10 n
+倍加 85 v
+倍加福 3 nr
+倍半萜 4 n
+倍受 71 v
+倍受尊敬 3 nr
+倍受欢迎 3 nr
+倍受青睐 3 nr
+倍受鼓舞 3 n
+倍可亲 3 n
+倍增 156 v
+倍增器 17 nr
+倍增学 3 nr
+倍大提琴 3 nr
+倍律 3 n
+倍感 86 n
+倍捻机 3 n
+倍数 117 n
+倍日并行 3 n
+倍率 46 n
+倍生 3 n
+倍称 3 v
+倍藏艰辛 3 ns
+倍觉 3 n
+倍谢 3 v
+倍赏 3 v
+倍赏必罚 3 n
+倍速 3 d
+倍道兼行 3 nr
+倍道兼进 3 nr
+倍道而行 3 n
+倍道而进 3 nr
+倍频 3 n
+倍频器 18 n
+倍频程 3 n
+倍频链 3 n
+倏 199 zg
+倏地 277 d
+倏地点 3 d
+倏尔 6 d
+倏忽 156 d
+倏忽之间 3 v
+倏然 105 d
+倐 27 zg
+們 32 zg
+倒 21994 v
+倒三七 3 ns
+倒三角 3 i
+倒三角形 7 n
+倒三颠四 3 i
+倒上去 3 v
+倒上来 3 v
+倒下 459 v
+倒不如 140 v
+倒不如说 33 l
+倒不少见 3 l
+倒不开 3 v
+倒为 3 v
+倒也不 3 l
+倒也不会 3 l
+倒也不是 3 l
+倒也罢了 3 i
+倒买 3 v
+倒买倒卖 4 l
+倒仓 3 v
+倒仰 6 v
+倒伏 55 v
+倒休 3 v
+倒像 211 v
+倒儿爷 3 n
+倒入 121 v
+倒八 3 n
+倒八字 3 l
+倒八眉 3 i
+倒冠落佩 3 l
+倒凤颠鸾 3 i
+倒凹区 3 l
+倒出 3 v
+倒到 3 v
+倒刺 46 v
+倒剪 2 v
+倒勾 2 n
+倒包 3 v
+倒卖 69 v
+倒卧 3 v
+倒卵形 50 n
+倒叙 14 v
+倒叙法 3 n
+倒句 3 n
+倒台 79 v
+倒吃甘蔗 3 n
+倒向天线 3 l
+倒吸 3 v
+倒味口 3 v
+倒嗓 3 n
+倒嗓子 3 n
+倒嚼 3 v
+倒回去 3 l
+倒因为果 3 i
+倒圆角 3 n
+倒地 330 n
+倒地不起 3 l
+倒坍 3 v
+倒垂 3 v
+倒塌 299 v
+倒大霉 3 l
+倒头 98 v
+倒好 272 v
+倒屣相迎 3 nr
+倒履相迎 3 l
+倒山倾海 3 i
+倒峡泻河 3 n
+倒帐 3 n
+倒带机 3 n
+倒床 3 v
+倒序 4 n
+倒底 18 v
+倒廪倾囷 3 v
+倒彩 2 n
+倒影 73 n
+倒影池 3 n
+倒忙 7 v
+倒念 3 v
+倒悬 64 v
+倒悬之急 3 i
+倒悬之苦 3 i
+倒戈 113 v
+倒戈卸甲 3 i
+倒戈相向 3 i
+倒戢干戈 3 nz
+倒手 7 v
+倒打一瓦 3 i
+倒打一耙 10 i
+倒扣 22 v
+倒扣分 2 l
+倒扣草 3 l
+倒执手版 3 n
+倒把 144 v
+倒折 3 v
+倒拉一把 3 l
+倒持干戈 3 i
+倒持戈矛 3 i
+倒持手板 3 n
+倒持泰阿 3 i
+倒挂 51 v
+倒挂金钟 3 l
+倒挂金钩 5 i
+倒换 82 v
+倒掉 52 v
+倒排 3 v
+倒推 8 v
+倒插 17 v
+倒插笔 3 n
+倒插门 11 l
+倒摄干扰 3 i
+倒摄抑制 3 n
+倒放 12 v
+倒数 173 n
+倒数第 3 l
+倒料 3 n
+倒时差 3 l
+倒易律 3 n
+倒映 61 v
+倒映在 3 i
+倒春寒 11 i
+倒替 3 v
+倒来 3 v
+倒来倒去 3 i
+倒杯 3 v
+倒杯水 3 n
+倒杯茶 3 n
+倒果为因 3 i
+倒栽葱 17 l
+倒梯形 4 n
+倒楣 3 n
+倒楣鬼 3 v
+倒槽式拱 3 n
+倒毁 3 v
+倒毙 69 v
+倒水 77 v
+倒汇 3 v
+倒油 3 n
+倒流 76 v
+倒海翻江 9 i
+倒淌河 4 ns
+倒满 3 v
+倒灌 58 v
+倒灶 20 v
+倒焊 3 n
+倒爷 3 n
+倒班 3 v
+倒睫 3 n
+倒票 6 n
+倒空 3 v
+倒立 74 v
+倒算 17 v
+倒箧倾囊 3 v
+倒箧倾筐 3 nr
+倒粪 3 n
+倒绷孩儿 3 v
+倒置 58 v
+倒置地貌 3 i
+倒置干戈 3 l
+倒置阻生 3 i
+倒翁 3 n
+倒胃 3 v
+倒胃口 7 n
+倒背如流 16 i
+倒腾 211 v
+倒苦水 3 i
+倒茬 2 v
+倒萨 3 n
+倒行 3 v
+倒行逆施 111 i
+倒街卧巷 3 i
+倒装 21 v
+倒装句 3 l
+倒装法 3 l
+倒装钻具 3 n
+倒裳索领 3 nz
+倒角 4 n
+倒角机 3 n
+倒计 3 v
+倒计时 164 n
+倒计时牌 2 n
+倒计时钟 5 l
+倒记时 3 n
+倒象棱镜 3 n
+倒账 3 v
+倒贴 37 v
+倒赔 4 v
+倒起 3 v
+倒车 31 v
+倒车档 3 n
+倒车灯 3 n
+倒车镜 3 n
+倒转 286 v
+倒轮闸 3 n
+倒载干戈 3 l
+倒过儿 3 l
+倒运 13 v
+倒进 3 v
+倒进去 3 v
+倒进来 3 l
+倒退 657 v
+倒逼 8 v
+倒金字塔 3 n
+倒钩 32 v
+倒钩卡环 3 n
+倒锁 3 v
+倒错 3 v
+倒锥钻 3 l
+倒闭 275 v
+倒闭年 3 n
+倒阁 7 n
+倒霉 586 a
+倒霉事 3 n
+倒霉熊 3 n
+倒霉蛋 3 n
+倒霉鬼 3 n
+倒马关 4 ns
+倒骑驴 6 n
+倒骑龙 5 n
+倓 85 zg
+倔 121 a
+倔劲 3 a
+倔头倔脑 3 z
+倔头强脑 3 z
+倔强 298 a
+倔强倨傲 3 i
+倔强地 3 z
+倔犟 45 a
+倕 4 zg
+倖 22 zg
+倗 27 zg
+倘 937 c
+倘不 3 c
+倘不如此 3 c
+倘佯 5 v
+倘使 772 c
+倘或 208 c
+倘有 3 c
+倘来之物 3 v
+倘然 13 c
+倘能 3 v
+倘若 4919 c
+候 1332 v
+候人兮 2 nr
+候俊杰 3 nr
+候元孟 2 nr
+候光 3 n
+候冠群 3 nr
+候命 2 n
+候场 3 n
+候复 3 v
+候孔明 2 nr
+候官治 2 nr
+候审 67 n
+候客室 3 n
+候小龙 2 nr
+候府 2 n
+候捷音 2 nr
+候教 2 n
+候旨 12 n
+候机 27 n
+候机厅 15 n
+候机室 11 n
+候机楼 39 n
+候温 3 n
+候潮路 2 l
+候潮门 4 nr
+候爵 5 nr
+候缺 3 v
+候耀华 3 nr
+候耀文 3 nr
+候船 3 n
+候船室 3 n
+候芳魂 2 nr
+候藏兵 3 nr
+候补 266 b
+候补人 3 l
+候补人员 3 l
+候补委员 502 l
+候补者 3 n
+候补键 3 nr
+候补队员 3 l
+候诊 9 v
+候诊室 5 n
+候诊椅 2 n
+候车 27 n
+候车亭 3 nr
+候车厅 3 n
+候车室 61 n
+候车站 3 n
+候选 127 v
+候选人 3708 n
+候选国 3 n
+候选框 3 n
+候选者 23 n
+候选词 3 l
+候通赤 4 nr
+候销 3 v
+候风 3 n
+候风地动仪 20 n
+候风相 16 nr
+候马 3 n
+候马市 3 n
+候驾 3 nr
+候鱼 3 n
+候鸟 100 n
+倚 1109 zg
+倚人庐下 3 vn
+倚仗 77 v
+倚偎 3 v
+倚傍 3 v
+倚傍门户 3 i
+倚势凌人 3 i
+倚坐 7 v
+倚墙而立 3 i
+倚多为胜 3 i
+倚天 3 v
+倚天剑 134 i
+倚天拔地 3 i
+倚姣作媚 3 v
+倚官仗势 3 i
+倚官挟势 3 v
+倚山傍水 3 i
+倚强凌弱 3 i
+倚恃 3 v
+倚望 3 v
+倚栏 3 v
+倚玉偎香 3 i
+倚立 3 v
+倚翠偎红 3 i
+倚老卖老 45 i
+倚草附木 3 i
+倚装待发 3 i
+倚财仗势 3 i
+倚赖 23 v
+倚赖心 3 v
+倚赖性 3 v
+倚赖成性 3 i
+倚重 148 v
+倚门 3 v
+倚门倚闾 3 i
+倚门傍户 3 i
+倚门卖俏 3 i
+倚门卖笑 3 i
+倚门献笑 3 i
+倚门窥户 3 i
+倚闾望切 3 i
+倚靠 59 v
+倚靠在 3 v
+倚靠着 3 v
+倚音 3 v
+倚马七纸 3 n
+倚马千言 3 i
+倚马可待 3 i
+倛 29 zg
+倜 27 x
+倜傥 32 a
+倜傥不羁 3 v
+倜傥不群 3 v
+倝 69 zg
+倞 123 zg
+借 4411 v
+借东风 12 n
+借个火 3 n
+借书 33 n
+借书单 3 n
+借书处 3 n
+借书留真 3 i
+借书证 3 n
+借了 3 p
+借交报仇 3 i
+借人 3 n
+借代 7 n
+借以 558 v
+借位 3 n
+借住 31 v
+借余 3 v
+借作 3 v
+借借 3 p
+借借看 3 l
+借债 61 n
+借债人 2 n
+借债度日 3 n
+借光 25 n
+借入 68 v
+借入款 3 n
+借入者 42 n
+借公行私 3 n
+借兵 3 n
+借减 3 v
+借出 11 v
+借出去 3 v
+借出来 3 l
+借出物 3 l
+借刀杀人 36 i
+借到 3 v
+借剑杀人 4 i
+借力 172 n
+借力顺推 3 l
+借助 969 v
+借助于 221 v
+借势 81 n
+借去 3 v
+借取 3 v
+借口 1446 n
+借古借今 3 l
+借古喻今 6 l
+借古讽今 17 i
+借听于聋 3 i
+借唱 3 v
+借喻 6 v
+借回 3 v
+借回去 3 l
+借回来 3 l
+借地 3 n
+借坐 3 v
+借坡下驴 3 l
+借垫 3 n
+借增 3 v
+借壳上市 3 n
+借好 3 v
+借完 3 v
+借宝地 3 n
+借客报仇 3 l
+借宿 140 v
+借宿一夜 3 i
+借宿一晚 3 i
+借尸还阳 3 i
+借尸还魂 23 i
+借差 3 n
+借帐 3 n
+借弹 3 v
+借得 3 v
+借托 3 v
+借抄 3 v
+借抽 3 i
+借招 3 n
+借据 20 p
+借支 9 n
+借放 3 v
+借故 78 n
+借方 22 n
+借方余额 3 n
+借方差额 3 i
+借景 25 n
+借景抒情 3 i
+借景生情 3 n
+借有 3 v
+借期 3 n
+借机 239 n
+借机报复 3 l
+借条 17 n
+借来 103 v
+借来借去 3 l
+借款 637 n
+借款人 68 n
+借款单 3 n
+借款国 7 n
+借款方 2 n
+借款者 4 n
+借此 16 d
+借此机会 112 l
+借水推船 3 n
+借水行舟 2 i
+借满 3 v
+借火 5 v
+借点 3 n
+借球 3 n
+借用 325 v
+借用还 3 v
+借看 3 v
+借看一下 3 l
+借着 458 p
+借穿 3 v
+借端 3 n
+借端生事 3 l
+借端肇事 3 vn
+借箸代筹 3 v
+借箸代谋 3 vn
+借篷使风 3 n
+借约 3 v
+借给 213 v
+借腹 4 n
+借腹怀胎 3 l
+借腹生子 3 n
+借自 3 v
+借花献佛 15 n
+借让 3 v
+借记 2 n
+借记卡 44 n
+借词 24 n
+借读 16 v
+借读生 5 n
+借读费 21 n
+借调 16 v
+借账 3 v
+借贷 450 n
+借贷无门 3 n
+借贷资本 3 n
+借走 3 v
+借身报仇 3 i
+借车 3 n
+借过 3 p
+借过一下 3 l
+借道 3 v
+借酒 3 v
+借酒浇愁 11 i
+借酒消愁 3 i
+借酒装疯 3 l
+借重 50 v
+借鉴 819 v
+借钱 202 v
+借镜 3 n
+借镜观形 3 n
+借问 16 v
+借阅 41 v
+借阅室 3 n
+借面吊丧 3 i
+借领 3 v
+借题 3 n
+借题发挥 31 i
+借风使船 3 l
+借鸡生蛋 4 n
+倠 9 zg
+倡 259 v
+倡乱 3 v
+倡仪 6 n
+倡优 6 v
+倡导 951 v
+倡导人 6 n
+倡导者 94 n
+倡廉 4 n
+倡情冶思 3 vn
+倡条冶叶 3 t
+倡狂 3 v
+倡而不和 3 v
+倡言 3 v
+倡议 651 n
+倡议书 36 n
+倡议权 3 n
+倡议者 2 n
+倡首 3 v
+倢 12 zg
+倣 6 zg
+倥 10 a
+倥偬 21 a
+倦 344 zg
+倦乏 3 a
+倦勤 3 a
+倦容 13 n
+倦尾赤色 3 n
+倦态 2 n
+倦怠 146 a
+倦怠感 3 vn
+倦意 44 a
+倦意顿消 3 n
+倦感 3 a
+倦游 3 n
+倦色 3 n
+倦鸟归巢 3 n
+倦鸟投林 3 n
+倦鸟知归 3 n
+倦鸟知返 3 n
+倦鸟知还 3 n
+倧 16 zg
+倨 44 ag
+倨傲 49 a
+倨傲不恭 3 v
+倩 120 zg
+倩人捉刀 3 v
+倩况 3 n
+倩女 8 n
+倩女幽魂 3 n
+倩女离魂 3 n
+倩影 42 n
+倪 229 nr
+倪不大 3 nr
+倪不小 3 nr
+倪世斌 5 nr
+倪云林 10 nr
+倪元璐 4 nr
+倪匡 3 nr
+倪匡兄 4 nr
+倪嗣冲 8 nr
+倪大哥 2 nr
+倪家塔 256 nr
+倪宽赞 2 nr
+倪小林 3 nr
+倪岳峰 256 nr
+倪巧银 2 nr
+倪徵燠 6 nr
+倪志福 29 nr
+倪志钦 2 nr
+倪文俊 28 nr
+倪文焕 7 nr
+倪林惠 3 nr
+倪欣雷 5 nr
+倪正东 5 nr
+倪氏昆 3 nr
+倪润峰 2 nr
+倪淑君 3 nrfg
+倪焕之 2 nr
+倪红梅 3 nr
+倪继德 2 nr
+倪虹洁 3 nr
+倪贻德 5 nr
+倪进贤 2 nr
+倬 18 g
+倭 353 n
+倭奴 15 n
+倭寇 496 n
+倭寇船 3 vn
+倭瓜 9 n
+倮 12 g
+倰 2 zg
+倱 2 zg
+倲 11 zg
+倴 3 zg
+倵 2 zg
+倸 51 zg
+倹 6 zg
+债 661 n
+债主 76 n
+债利 2 n
+债券 649 n
+债券市场 3 n
+债务 1035 n
+债务人 185 n
+债务国 27 n
+债务纠纷 3 z
+债务缠身 5 i
+债务额 3 n
+债台 3 n
+债台高筑 14 n
+债各有主 4 i
+债多不愁 3 i
+债市 18 n
+债息 3 n
+债户 11 n
+债有主 20 n
+债权 371 n
+债权人 244 n
+债权债务 3 n
+债权团 3 n
+债权国 36 n
+债权者 8 n
+债款 33 n
+债转股 8 n
+债额 8 n
+倻 10 zg
+值 5361 n
+值不值 3 l
+值不值得 14 l
+值勤 63 a
+值勤者 3 n
+值千金 3 l
+值参 8 n
+值域 17 n
+值夜 35 v
+值夜班 3 n
+值守 15 v
+值完 3 v
+值当 3 v
+值得 3214 v
+值得一提 60 l
+值得一提的是 178 l
+值得一看 3 l
+值得主义 3 l
+值得出力 3 l
+值得反思 3 l
+值得尊敬 3 l
+值得尊重 3 l
+值得崇拜 3 l
+值得引用 3 l
+值得注意 3 l
+值得注视 3 l
+值得称赞 3 l
+值得称颂 3 l
+值得纪念 3 v
+值得羡慕 3 l
+值指示剂 3 n
+值日 32 n
+值日官 3 l
+值日生 8 l
+值日表 3 l
+值早班 3 l
+值星 3 n
+值星官 3 l
+值星班长 3 n
+值晚班 3 n
+值机 8 n
+值班 473 v
+值班人 3 n
+值班人员 3 l
+值班员 51 n
+值班室 82 n
+值班船 3 l
+值遇 3 v
+值钱 417 v
+倽 7 zg
+倾 1934 n
+倾下 3 v
+倾下去 3 v
+倾下来 3 v
+倾于 3 v
+倾侧 25 n
+倾倒 198 v
+倾倒垃圾 3 n
+倾入 3 v
+倾其所有 3 i
+倾出 3 v
+倾刻 3 n
+倾刻之间 3 i
+倾力 20 n
+倾动 3 v
+倾化 3 v
+倾危 3 v
+倾卸 4 v
+倾吐 79 v
+倾吐衷情 3 i
+倾向 2344 v
+倾向性 68 n
+倾向艺术 3 n
+倾听 956 v
+倾听意见 3 i
+倾囊 34 n
+倾囊相助 3 i
+倾囊相授 3 n
+倾囊而出 3 i
+倾国 3 n
+倾国倾城 22 n
+倾城 26 n
+倾城倾国 2 n
+倾城而出 3 i
+倾塌 3 v
+倾复 3 v
+倾天 3 n
+倾宵 3 n
+倾家 3 n
+倾家破产 3 n
+倾家竭产 3 i
+倾家荡产 117 i
+倾家败产 3 i
+倾尽 24 v
+倾尽全力 3 i
+倾巢 35 n
+倾巢出动 12 i
+倾巢来犯 3 i
+倾巢而出 3 i
+倾废 2 v
+倾度 3 n
+倾心 338 n
+倾心吐意 3 i
+倾心吐胆 6 i
+倾心尽力 3 i
+倾情 11 n
+倾慕 52 v
+倾抱写诚 3 i
+倾摇懈弛 3 i
+倾斜 1144 v
+倾斜仪 2 n
+倾斜地 3 z
+倾斜度 17 n
+倾斜政策 3 n
+倾斜角 8 n
+倾斜距离 3 n
+倾斜面 3 n
+倾析 3 vn
+倾柯卫足 3 i
+倾泄 11 v
+倾注 177 v
+倾注全力 3 i
+倾泻 116 v
+倾点 3 n
+倾盆 22 n
+倾盆大雨 30 i
+倾盆而降 2 i
+倾盖 6 v
+倾盖如故 3 i
+倾筐倒箧 3 i
+倾箱倒柜 3 i
+倾箱倒箧 3 i
+倾羡 3 v
+倾耳 3 n
+倾耳注目 3 i
+倾耳细听 3 i
+倾耳而出 3 i
+倾耳而听 3 i
+倾肝沥胆 3 i
+倾肠倒肚 3 i
+倾肠倒腹 3 i
+倾船 3 n
+倾覆 296 v
+倾覆力臂 3 i
+倾角 122 n
+倾诉 233 v
+倾诉人 3 n
+倾诉者 3 n
+倾诉衷情 3 n
+倾诉衷曲 3 n
+倾谈 11 v
+倾轧 139 v
+倾述 2 v
+倾销 109 v
+倾销价 3 n
+倾销差价 3 n
+倾销幅度 3 l
+倾销法 3 n
+倾销税 3 n
+倾陷 3 v
+倾颓 13 v
+偀 10 zg
+偁 40 zg
+偂 47 zg
+偃 176 zg
+偃兵修文 3 i
+偃卧 3 n
+偃师 99 ns
+偃师县 6 ns
+偃师市 7 ns
+偃旗仆鼓 3 i
+偃旗卧鼓 3 i
+偃旗息鼓 45 i
+偃月 3 n
+偃松 7 ns
+偃武休兵 3 n
+偃武修文 8 i
+偃武兴文 3 ns
+偃武崇文 3 i
+偃武息戈 3 i
+偃武櫜兵 3 v
+偃武行文 3 ns
+偃武觌文 3 vn
+偃甲息兵 3 i
+偃革为轩 3 i
+偃革倒戈 3 i
+偃革尚文 3 ns
+偃鼠饮河 3 i
+偄 6 zg
+偅 923 zg
+偆 7 zg
+假 5051 n
+假丑恶 3 i
+假人 22 n
+假人假义 3 l
+假人辞色 3 i
+假仁假义 28 i
+假仁假意 3 i
+假仁纵敌 3 i
+假令 3 n
+假以时日 22 l
+假以辞色 3 i
+假传 3 v
+假传圣旨 3 n
+假体 12 n
+假作 3 vn
+假使 646 c
+假使会 3 n
+假使能 3 n
+假使说 3 l
+假信号 3 n
+假借 173 v
+假借名义 3 l
+假借法 3 n
+假充 16 v
+假公济私 31 n
+假公营私 3 n
+假冒 363 v
+假冒伪劣 115 j
+假冒着 3 l
+假冒者 3 n
+假分数 3 n
+假列 3 v
+假力于人 3 l
+假劣 39 n
+假动作 3 n
+假单 3 n
+假发 36 v
+假发票 3 n
+假台口 3 n
+假合同 3 n
+假名 94 v
+假名假姓 3 i
+假名字 3 n
+假名托姓 3 n
+假名牌 3 n
+假哭 3 v
+假哭者 3 i
+假唱 4 v
+假喀斯特 3 nz
+假善人 2 n
+假嗓子 2 n
+假图 3 n
+假基因 3 n
+假塑性 3 n
+假大空 6 n
+假如 1340 c
+假如会 3 l
+假如能 3 l
+假娘 3 n
+假孕 3 v
+假学历 3 n
+假定 1376 v
+假定性 15 n
+假寐 18 v
+假小子 3 n
+假尼姑 3 n
+假尿苷 3 n
+假山 199 n
+假峰 3 n
+假币 23 n
+假帐 4 n
+假带 3 n
+假座 3 n
+假彩票 3 n
+假彩色 3 n
+假性 39 n
+假性幻觉 3 l
+假性痴呆 3 i
+假性近视 3 l
+假恶丑 17 i
+假情假意 3 i
+假惜 3 v
+假想 159 n
+假想敌 94 i
+假惺惺 67 z
+假意 189 v
+假慈悲 3 i
+假戏真做 9 i
+假戏真唱 3 n
+假手 63 n
+假手于人 2 i
+假手他人 3 n
+假托 59 v
+假扣押 3 n
+假执行 3 n
+假扮 136 v
+假扮作 3 l
+假报 3 n
+假拟结构 3 n
+假摔 3 n
+假撇清 7 n
+假文凭 3 n
+假新闻 3 n
+假旋转 3 i
+假日 338 t
+假日办 122 n
+假日活动 3 l
+假日经济 6 n
+假日酒店 3 n
+假显性 3 n
+假期 631 t
+假期作业 3 n
+假条 4 n
+假果 3 c
+假根 46 n
+假案 2 n
+假植 3 v
+假模假式 8 l
+假正经 3 b
+假死 31 v
+假泪 3 n
+假洋鬼子 3 l
+假消息 3 n
+假牌 3 n
+假牙 15 n
+假牙齿 3 n
+假珠宝 3 n
+假球 29 n
+假用 3 v
+假画 3 n
+假病毒 3 n
+假痴不癫 3 z
+假痴假呆 3 i
+假皮 3 n
+假相 18 n
+假眉三道 2 i
+假眼 3 n
+假睡 3 v
+假睫毛 3 n
+假票 3 n
+假种 33 n
+假笑 3 v
+假结 3 v
+假结婚 3 v
+假缎 3 n
+假肢 35 n
+假色 2 n
+假若 335 c
+假若会 3 l
+假若有 3 i
+假若能 3 v
+假药 103 n
+假药案 3 n
+假虎张威 3 i
+假装 652 n
+假装会 3 n
+假装地 3 n
+假装神圣 3 n
+假装能 3 n
+假角蛋白 3 l
+假言 51 n
+假言判断 3 n
+假誉驰声 3 i
+假警察 3 v
+假设 1026 vn
+假设会 3 n
+假设性 4 n
+假设敌 4 i
+假设检验 3 n
+假设能 3 n
+假证 9 v
+假话 215 n
+假说 240 c
+假象 193 n
+假象牙 3 n
+假负载 3 b
+假账 3 n
+假货 131 n
+假贷 3 n
+假足 3 v
+假退役 3 vn
+假送 3 v
+假途灭虢 2 i
+假造 34 v
+假造文件 3 n
+假道 3 v
+假道学 11 n
+假道灭虢 3 i
+假酒 11 n
+假释 46 v
+假释官 3 n
+假释期间 3 n
+假释犯 3 n
+假钞 14 n
+假钱 3 n
+假锁 3 v
+假门 3 n
+假门假事 3 l
+假门假氏 3 n
+假面 37 c
+假面具 11 n
+假面舞 18 n
+假面舞会 3 n
+假领 3 n
+假髻 3 n
+假鱼 3 n
+假齿 3 n
+偈 161 zg
+偈语 21 n
+偉 10 zg
+偊 3 zg
+偌 39 b
+偌大 298 b
+偍 10 zg
+偎 153 v
+偎依 32 v
+偎倚 39 v
+偎傍 3 v
+偎慵堕懒 3 i
+偎抱 3 v
+偎着 3 v
+偎红倚翠 3 i
+偎贴 3 v
+偎近 3 v
+偏 3833 a
+偏三向四 3 i
+偏上 3 f
+偏上去 3 v
+偏上来 3 v
+偏下 7 f
+偏东 3 n
+偏东北 3 ns
+偏东南 3 ns
+偏乡僻壤 3 i
+偏二甲肼 4 nz
+偏于 3 v
+偏会 3 n
+偏低 3 v
+偏侧凸颌 3 n
+偏侧化 3 n
+偏信 8 v
+偏信则暗 3 i
+偏倒 3 d
+偏倚 3 v
+偏偏 1284 d
+偏僻 312 a
+偏僻地区 3 n
+偏光 11 n
+偏光片 3 n
+偏光镜 2 n
+偏关 15 v
+偏关县 3 ns
+偏到 3 v
+偏劳 8 a
+偏北 3 f
+偏北风 8 n
+偏南 317 f
+偏南风 12 n
+偏历 3 n
+偏压 3 n
+偏口鱼 4 n
+偏右 3 n
+偏后 3 f
+偏向 379 n
+偏向角 3 n
+偏听 3 v
+偏听偏信 18 i
+偏听偏言 3 i
+偏听则暗 3 i
+偏回 3 v
+偏回去 3 l
+偏回来 3 l
+偏处 3 d
+偏处一隅 3 l
+偏外 3 f
+偏大 3 a
+偏失 9 v
+偏头 3 n
+偏头疼 3 v
+偏头痛 45 n
+偏好 120 d
+偏守 3 v
+偏安 49 nz
+偏安一隅 9 i
+偏宜 3 v
+偏室 3 n
+偏宽 3 v
+偏射 3 v
+偏将 208 d
+偏少 3 d
+偏峰 3 n
+偏左 3 v
+偏巧 39 d
+偏差 368 n
+偏己 3 n
+偏巷 3 n
+偏师 26 n
+偏序 4 n
+偏店 3 n
+偏废 12 v
+偏微分 3 n
+偏德 3 n
+偏心 79 n
+偏心器 3 n
+偏心圆 3 n
+偏心率 16 n
+偏心眼 4 n
+偏心眼儿 3 n
+偏心短节 3 i
+偏心轮 3 n
+偏房 38 n
+偏执 60 v
+偏执狂 14 i
+偏折 11 a
+偏护 3 v
+偏护着 3 n
+偏振 115 n
+偏振光 91 n
+偏振度 3 n
+偏振片 3 n
+偏振镜 3 n
+偏掉 3 v
+偏摩尔量 3 nz
+偏斜 31 v
+偏方 83 n
+偏旁 39 f
+偏旁部首 3 n
+偏暗 3 d
+偏来 3 v
+偏来偏去 3 i
+偏松 3 a
+偏析 3 vn
+偏枯 3 v
+偏正 5 d
+偏正结构 3 n
+偏歪 3 a
+偏殿 71 n
+偏流 8 n
+偏激 107 v
+偏爱 185 v
+偏狂 3 a
+偏狭 16 a
+偏疼 3 v
+偏瘦 3 a
+偏瘫 33 n
+偏相关 3 n
+偏短 3 v
+偏码 3 n
+偏硅酸 2 nz
+偏磷酸 3 n
+偏离 487 v
+偏离正轨 3 i
+偏私 93 n
+偏科 11 n
+偏移 35 v
+偏移不足 3 i
+偏移电压 3 nz
+偏移量 3 n
+偏窄 3 a
+偏紧 3 d
+偏紫 3 a
+偏累 3 v
+偏细 3 a
+偏置 7 n
+偏胖 3 a
+偏至 3 d
+偏航 3 v
+偏色 3 n
+偏蓝 3 n
+偏蚀 3 v
+偏衫 3 n
+偏袒 121 v
+偏西 109 n
+偏西北 3 f
+偏西南 3 ns
+偏西风 9 n
+偏要 279 a
+偏见 357 v
+偏角 11 n
+偏误 3 n
+偏转 103 v
+偏转板 3 n
+偏转线圈 3 n
+偏轻 3 d
+偏辞 3 v
+偏远 193 d
+偏远地区 3 ns
+偏重 533 a
+偏重于 3 l
+偏锋 22 n
+偏长 3 n
+偏门 21 n
+偏靠 3 v
+偏靠在 3 n
+偏顾 3 v
+偏顾着 3 l
+偏颇 81 nz
+偏题 27 n
+偏食 56 n
+偏饭 3 v
+偏黄 3 n
+偐 22 zg
+偑 8 zg
+偒 4 zg
+偓 35 zg
+偔 6 zg
+偕 370 vg
+偕同 42 v
+偕老 30 v
+偕行 5 v
+偖 39 zg
+偗 20 zg
+偘 2 zg
+偙 3 zg
+做 50331 v
+做一天和尚撞一天钟 4 i
+做一套 3 n
+做不了 131 v
+做不来 3 v
+做东 23 n
+做东道 2 n
+做为 208 v
+做主 192 v
+做习题 3 n
+做买卖 3 n
+做事 799 v
+做亲 3 n
+做人 605 n
+做人做世 3 i
+做人情 3 n
+做人流 3 n
+做伴 68 v
+做作 107 v
+做作业 3 n
+做作业时 3 n
+做假账 3 n
+做做 106 v
+做做事 3 v
+做做饭 4 v
+做出 3306 v
+做刚做柔 3 l
+做到 2688 v
+做功 55 v
+做卖买 3 v
+做呕 3 v
+做圈套 3 n
+做头 11 v
+做好 2565 v
+做好事 3 n
+做好做恶 3 i
+做好做歹 3 i
+做媒 73 n
+做媚眼 3 i
+做学问 3 n
+做完作业 3 l
+做官 307 n
+做客 243 n
+做寿 15 n
+做小伏低 3 v
+做工 229 v
+做市商 4 n
+做广告 3 n
+做庄 3 n
+做张做势 3 i
+做张做智 3 i
+做张做致 3 i
+做得好 3 v
+做得来 3 v
+做戏 58 v
+做成 846 v
+做成花环 3 i
+做手 3 v
+做手势 3 n
+做手术 3 n
+做手脚 28 n
+做掉 3 v
+做操 8 n
+做文章 96 n
+做案 3 n
+做梦 492 v
+做法 3412 v
+做活 71 v
+做活儿 23 n
+做派 51 n
+做满月 3 i
+做点事 3 v
+做爱 75 v
+做爱做 3 i
+做爱图 3 n
+做爱时 3 i
+做爱片 3 n
+做爱网 3 n
+做牌 3 v
+做牛做马 3 v
+做生意 363 v
+做生日 5 n
+做眉做眼 3 v
+做礼拜 19 v
+做神做鬼 3 i
+做秀 3 v
+做答 3 v
+做股票 3 n
+做菜 34 n
+做账 3 v
+做贼心虚 24 i
+做起 393 v
+做针线 24 n
+做错事 3 v
+做零工 3 v
+做题 3 n
+做饭 991 v
+做饭吃 3 n
+做鬼 39 v
+做鬼做神 3 i
+做鬼脸 3 i
+偛 40 zg
+停 5934 v
+停上 3 v
+停上去 3 v
+停上来 3 v
+停下 569 v
+停下去 3 v
+停下来 3 v
+停不下 3 v
+停不下来 3 v
+停不住 3 v
+停业 77 v
+停业处份 3 n
+停业整顿 3 l
+停云落月 3 i
+停产 274 v
+停付 3 v
+停会 3 v
+停住 3 v
+停停 48 v
+停停当当 3 v
+停停看 3 v
+停刊 90 v
+停刊处分 3 l
+停到 3 v
+停制 3 v
+停办 81 v
+停匀 3 a
+停发 31 v
+停售 3 v
+停好 3 v
+停妥 5 a
+停妻再娶 3 i
+停学 7 v
+停完 3 v
+停尸 15 v
+停尸房 3 n
+停尸间 3 n
+停工 112 v
+停工处分 3 l
+停工待料 3 l
+停建 30 v
+停开 3 v
+停当 321 v
+停征 7 v
+停得 3 v
+停息 84 v
+停战 454 v
+停战协定 3 i
+停战和约 3 n
+停战线 3 n
+停手 31 v
+停拨 3 v
+停掉 3 v
+停摆 14 v
+停播 3 v
+停放 260 v
+停放在 3 v
+停显 3 a
+停有 3 v
+停机 66 n
+停机位 3 n
+停机场 3 n
+停机坪 64 n
+停机库 3 n
+停机问题 3 n
+停来停去 3 v
+停板 3 n
+停歇 118 v
+停止 3842 v
+停止下来 3 l
+停止不前 8 i
+停止使用 3 i
+停步 341 v
+停水 12 v
+停水通知 3 i
+停泊 330 v
+停泊地 8 n
+停泊费 3 n
+停滞 418 v
+停滞不前 85 i
+停火 95 v
+停火协办 3 i
+停火协定 3 i
+停火协议 3 i
+停火线 9 n
+停灵 19 v
+停牌 209 v
+停用 65 v
+停电 61 v
+停电通知 3 l
+停留 1315 v
+停留时间 3 l
+停留长智 3 i
+停站 3 n
+停笔 3 v
+停约 3 v
+停线 3 n
+停经 26 v
+停经期 3 n
+停经片 3 n
+停缴 3 v
+停置 3 v
+停职 57 v
+停职反省 3 i
+停职检查 3 n
+停航 16 v
+停船 3 v
+停船靠岸 3 n
+停药 3 v
+停薪 3 v
+停薪留职 5 i
+停表 2 v
+停训 2 v
+停诊 4 v
+停话 3 v
+停课 50 v
+停赛 121 v
+停跳 4 v
+停蹄 3 n
+停车 258 v
+停车位 16 n
+停车场 152 n
+停车处 2 n
+停车库 3 n
+停车换乘 3 i
+停车楼 4 n
+停车灯 3 n
+停车站 2 n
+停车线 3 n
+停车费 18 n
+停车难 3 i
+停转 2 v
+停载 3 v
+停辛伫苦 3 z
+停辛贮苦 3 n
+停过 3 v
+停过去 3 v
+停过来 3 v
+停运 60 v
+停进 3 v
+停进去 3 v
+停进来 3 v
+停错 3 v
+停闭 11 v
+停靠 225 v
+停靠在 3 v
+停靠点 6 n
+停靠站 3 n
+停顿 401 v
+停顿下来 3 i
+停飞 43 v
+停食 3 v
+停驶 7 v
+停驻 3 v
+偞 2 zg
+偢 30 zg
+偣 208 zg
+偤 11 zg
+健 1514 a
+健与美 3 nz
+健体 10 a
+健健康康 4 nz
+健儿 90 n
+健全 1765 a
+健全人 60 n
+健全人格 3 nz
+健全制度 3 n
+健全性 3 n
+健全法制 3 nz
+健力宝 31 nz
+健在 95 v
+健在者 3 n
+健壮 504 a
+健壮如牛 3 l
+健壮性 3 n
+健存 3 v
+健将 54 n
+健康 5971 a
+健康人 50 nz
+健康作品 3 n
+健康器 3 nz
+健康心理 3 n
+健康成长 3 nz
+健康报 30 nz
+健康权 6 n
+健康检查 3 n
+健康歌 3 nz
+健康活泼 3 n
+健康状况 3 n
+健康秤 3 nz
+健康网 3 nz
+健康美 3 nz
+健康证 4 nz
+健康长寿 3 nz
+健康险 2 n
+健心 2 a
+健忘 70 a
+健忘症 2 n
+健忘者 3 n
+健慰器 3 n
+健教 3 nz
+健旺 59 a
+健智牌 3 n
+健朗 9 a
+健次郎 3 nz
+健步 23 vn
+健步如飞 17 l
+健民 67 n
+健硕 31 a
+健立 3 v
+健美 356 a
+健美先生 3 n
+健美小姐 3 n
+健美操 28 l
+健美活动 3 l
+健美裤 3 nz
+健美运动 4 nz
+健胃 39 a
+健脑 3 n
+健脾 3 n
+健脾开胃 3 v
+健脾胃 3 v
+健行 3 v
+健行工专 3 n
+健行队 3 n
+健谈 28 v
+健身 587 v
+健身卡 6 n
+健身器 6 n
+健身器材 3 n
+健身房 113 n
+健身操 17 l
+健身椅 3 n
+健身法 4 n
+健身活动 3 l
+健身球 4 n
+健身车 2 n
+健身运动 3 l
+健骨生 3 n
+偦 26 zg
+偧 9 zg
+偩 14 zg
+偪 4 zg
+偫 6 zg
+偬 15 x
+偭 2 zg
+偭规越矩 3 nr
+偭规错矩 3 n
+偮 3 zg
+偯 10 zg
+偱 2 zg
+偲 7 zg
+側 2 zg
+偶 982 d
+偶一 3 d
+偶一为之 15 i
+偶也来 3 i
+偶人 30 n
+偶们 3 n
+偶像 367 n
+偶像人物 3 n
+偶像剧 2 n
+偶像化 3 n
+偶像崇拜 3 i
+偶函数 3 n
+偶发 44 d
+偶发事件 3 n
+偶发性 7 n
+偶变投隙 3 i
+偶合 9 n
+偶合器 3 n
+偶姻 3 n
+偶尔 1361 d
+偶性 3 n
+偶感 3 a
+偶或 20 d
+偶提 3 n
+偶数 95 n
+偶数号 3 n
+偶数按摩 3 n
+偶数排 3 n
+偶数班 3 n
+偶极子 29 n
+偶极矩 31 n
+偶氮 3 n
+偶氮化物 3 n
+偶氮染料 9 n
+偶然 1312 d
+偶然中断 3 i
+偶然之间 3 i
+偶然事故 18 n
+偶然变异 3 i
+偶然学习 3 n
+偶然性 141 n
+偶然误差 3 n
+偶然间 3 n
+偶犯 3 n
+偶笔 3 d
+偶而 3 d
+偶而为之 3 i
+偶联 3 n
+偶联剂 3 n
+偶联聚合 3 n
+偶见 3 a
+偶记 3 n
+偶语 3 n
+偶象 3 n
+偶起 3 a
+偶蹄 12 n
+偶蹄目 38 n
+偶逢 3 v
+偶遇 39 n
+偷 2578 v
+偷上 3 d
+偷上去 3 v
+偷上来 3 v
+偷下 3 v
+偷下去 3 v
+偷下来 3 d
+偷东摸西 3 i
+偷东西 3 i
+偷书 3 v
+偷人 60 v
+偷作 3 v
+偷做 3 v
+偷停 3 d
+偷偷 853 d
+偷偷地 3 i
+偷偷插入 3 i
+偷偷摸摸 118 i
+偷光 3 v
+偷入 3 v
+偷凉 3 v
+偷出 3 v
+偷出去 3 i
+偷出来 3 i
+偷到 3 v
+偷办 3 v
+偷功夫 3 i
+偷加 3 d
+偷包 3 v
+偷去 3 v
+偷发 3 v
+偷取 3 v
+偷取者 3 n
+偷叫 3 v
+偷吃 3 v
+偷合取容 3 i
+偷合苟从 3 i
+偷合苟容 3 i
+偷听 163 v
+偷吸 3 v
+偷售 3 v
+偷喝 3 v
+偷嘴 6 v
+偷回 3 v
+偷回去 3 i
+偷回来 3 l
+偷垒 3 v
+偷填 3 v
+偷声细气 3 i
+偷天换日 2 i
+偷夹 3 n
+偷奸取巧 3 i
+偷奸耍滑 4 l
+偷媚取容 3 i
+偷存 3 v
+偷学 3 v
+偷安 8 v
+偷安旦夕 3 i
+偷宰 3 v
+偷寄 3 v
+偷寒送暖 3 i
+偷尝禁果 3 i
+偷工 2 v
+偷工减料 53 i
+偷巧 3 d
+偷师 3 v
+偷带 3 v
+偷开 3 v
+偷开到 3 l
+偷开去 3 i
+偷开来 3 i
+偷录 3 v
+偷得浮生 3 i
+偷心 3 v
+偷情 69 v
+偷情盗爱 3 i
+偷懒 116 v
+偷打 3 v
+偷抄 3 v
+偷抗税案 3 n
+偷报 3 v
+偷抱 3 v
+偷拍 22 v
+偷拍图 3 i
+偷拍某 3 n
+偷拍照 3 i
+偷拍网 3 i
+偷拿 3 v
+偷换 27 v
+偷换概念 3 i
+偷搞 3 v
+偷搬 3 v
+偷摸 3 v
+偷收 3 v
+偷教 3 v
+偷数 3 d
+偷来 3 v
+偷来偷去 3 i
+偷架 3 v
+偷梁换柱 25 i
+偷樑换柱 3 n
+偷欢 3 v
+偷水 3 v
+偷汉子 12 l
+偷油 3 v
+偷法 3 v
+偷泡 3 v
+偷洗 3 v
+偷渡 70 v
+偷渡客 2 i
+偷渡案 3 n
+偷渡者 5 n
+偷渡过境 3 l
+偷溜 3 v
+偷溜走 3 l
+偷漏 5 v
+偷漏税 5 j
+偷炒 3 v
+偷牛盗马 3 i
+偷狗戏鸡 3 i
+偷猎 22 v
+偷猎者 25 n
+偷球 3 v
+偷生 67 v
+偷电 5 j
+偷盗 149 v
+偷看 189 v
+偷眼 89 d
+偷着乐 3 i
+偷着哭 3 i
+偷睡 3 v
+偷砍 3 v
+偷种 3 v
+偷税 94 v
+偷税案 3 j
+偷税漏税 3 j
+偷税罪 3 n
+偷税额 3 n
+偷空 12 v
+偷窃 72 v
+偷窃狂 3 i
+偷窃罪 3 i
+偷窃行为 3 i
+偷窥 54 v
+偷窥图 3 i
+偷窥女 3 i
+偷窥狂 3 i
+偷窥网 3 i
+偷窥者 3 n
+偷笑 3 v
+偷腥 3 n
+偷花 3 v
+偷花贼 3 i
+偷营 13 vn
+偷营劫寨 3 i
+偷袭 463 v
+偷讲 3 v
+偷请 3 v
+偷读 3 v
+偷课 3 v
+偷调 3 v
+偷走 57 v
+偷起 3 v
+偷起来 3 l
+偷越 13 d
+偷跑 3 v
+偷跳 3 v
+偷车 3 v
+偷车贼 3 i
+偷载 3 v
+偷过去 3 i
+偷过来 3 d
+偷运 34 v
+偷逃 16 v
+偷逃税 2 j
+偷采 3 v
+偷钱 3 v
+偷铁 3 j
+偷闲 15 v
+偷闲躲静 3 i
+偷领 3 v
+偷食禁果 3 i
+偷香窃玉 4 i
+偷骑 3 n
+偷鸡不着 3 i
+偷鸡不着蚀把米 14 l
+偷鸡摸狗 60 i
+偷鸡盗狗 3 i
+偷鸡贼 2 i
+偺们 3 rr
+偻 37 x
+偼 10 zg
+偾 18 g
+偿 337 v
+偿付 132 v
+偿付能力 3 n
+偿债 37 v
+偿债基金 3 n
+偿债率 6 n
+偿其大欲 3 n
+偿命 84 v
+偿回 3 v
+偿回去 3 n
+偿回来 3 n
+偿愿 3 v
+偿清 3 v
+偿还 480 v
+偿还债务 3 n
+偿还日 3 n
+偿还期 7 n
+偿还血债 3 n
+傀 10 n
+傀儡 551 n
+傀儡戏 13 n
+傀儡政府 3 n
+傀儡政权 3 n
+傀奇 3 n
+傀异 3 n
+傀标 3 n
+傃 4 zg
+傄 2 zg
+傅 932 nr
+傅丁根 4 nr
+傅世华 4 nr
+傅东华 2 nr
+傅东辉 3 nr
+傅临政 3 nr
+傅二氏 2 nr
+傅以渐 92 nr
+傅作义 112 nr
+傅佩嘉 3 nr
+傅元天 2 nr
+傅先生 5 nr
+傅全有 68 nr
+傅公悌 2 nr
+傅兰雅 5 nr
+傅利叶 3 nr
+傅勇凡 3 nr
+傅友德 32 nr
+傅双琪 4 nr
+傅司马孚 3 nr
+傅同钦 2 nr
+傅国涌 24 nr
+傅增湘 5 nr
+傅士仁 24 nr
+傅大人 7 nr
+傅大夫 3 nr
+傅天颖 3 nr
+傅娟 3 nrfg
+傅孝思 3 nr
+傅孟真 2 nr
+傅学诚 3 nr
+傅宏宇 2 nr
+傅宗龙 191 nr
+傅家坡 4 nr
+傅家宝 2 nr
+傅家庄 2 nr
+傅家边 3 nr
+傅尔明 2 nr
+傅尚书 4 nr
+傅崇碧 19 nr
+傅庙离 2 nr
+傅德辉 768 nr
+傅志寰 262 nrfg
+傅思归 32 nr
+傅恒之 2 nr
+傅惜华 3 nr
+傅慕容 2 nr
+傅承义 2 nr
+傅抱石 24 nr
+傅振邦 257 nr
+傅改兵 3 nr
+傅教惠 2 nr
+傅斯年 37 nr
+傅明宪 3 nr
+傅春早 17 nr
+傅晓宇 3 nr
+傅氏晚 2 nr
+傅沙沙 2 nr
+傅泛济 2 nr
+傅海峰 6 nr
+傅湘荣 20 nr
+傅焕光 2 nr
+傅璇琮 4 nr
+傅秋涛 3 nr
+傅秋芳 4 nr
+傅科摆 3 v
+傅立叶 25 nr
+傅粉何郎 3 nr
+傅粉施朱 3 nr
+傅统先 2 nr
+傅羽佳 3 nr
+傅自应 256 nrfg
+傅良佐 3 nr
+傅艺伟 3 nr
+傅莉丽 3 nr
+傅衣凌 12 nr
+傅贵九 3 nr
+傅达林 2 nr
+傅里叶 135 nr
+傅钟繇 2 nr
+傅铁山 4 nr
+傅难芯 2 nr
+傅青主 3 nr
+傅鞍酌 6 nr
+傇 2 zg
+傈 14 nz
+傈僳 48 nz
+傈僳族 60 nz
+傉 25 zg
+傍 409 t
+傍亮儿 3 i
+傍人依户 3 i
+傍人篱壁 3 i
+傍人篱落 3 i
+傍人门户 3 i
+傍偟 3 t
+傍午 3 t
+傍晚 775 t
+傍晚时候 3 t
+傍水 3 i
+傍系 3 i
+傍花随柳 3 i
+傍若无人 6 i
+傍观冷眼 3 i
+傍观者清 3 i
+傍轴条件 3 v
+傍轴近似 3 nr
+傍边 3 i
+傍边儿 3 i
+傍靠 3 i
+傍黑 3 i
+傍黑儿 3 i
+傐 2 zg
+傑 3 zg
+傒 27 zg
+傕 148 zg
+傗 1167 zg
+傘 45 zg
+備 1305 zg
+傚 1724 zg
+傛 1353 zg
+傜 486 zg
+傝 830 zg
+傞 386 zg
+傢 2 zg
+傢俬 3 z
+傣 195 nz
+傣乡 3 nz
+傣历 19 nz
+傣味 2 nz
+傣家 10 nz
+傣族 675 nz
+傤 2 zg
+傥 19 c
+傥来之物 3 v
+傦 119 zg
+傧 19 n
+傧相 10 n
+储 478 zg
+储位 3 n
+储供 3 v
+储信艳 4 nr
+储值卡 3 n
+储光羲 4 nr
+储公仓 16 nr
+储吉旺 9 nr
+储君 23 nr
+储君之 3 nr
+储备 1263 vn
+储备品 3 n
+储备基金 3 n
+储备库 10 n
+储备棉 3 n
+储备物资 3 n
+储备粮 15 n
+储备粮库 2 n
+储备量 10 n
+储备金 3 n
+储存 947 n
+储存区 3 n
+储存卡 3 nr
+储存器 7 n
+储存处 3 n
+储存室 3 n
+储存库 4 nr
+储存期 7 n
+储存罐 3 n
+储存起来 3 l
+储存量 4 n
+储安平 4 nr
+储宫 2 n
+储层 2 n
+储户 45 n
+储放 3 v
+储放槽 3 n
+储智博 3 nr
+储望华 2 nr
+储气库 2 n
+储气罐 2 n
+储氢 4 n
+储水 16 n
+储水柜 3 n
+储水瓶 2 n
+储水量 11 n
+储油 29 n
+储油区 3 n
+储油平台 3 n
+储油库 3 n
+储油构造 266 n
+储油罐 5 n
+储油量 6 n
+储济仓 50 nr
+储灰场 2 n
+储物柜 3 n
+储物箱 3 n
+储电量 3 n
+储盐 3 n
+储秀宫 41 nr
+储积 3 n
+储积量 2 n
+储粮 22 n
+储精蓄税 3 n
+储罐 9 n
+储能 8 n
+储蓄 413 n
+储蓄卡 3 n
+储蓄员 3 n
+储蓄型 4 n
+储蓄存款 11 n
+储蓄所 15 n
+储蓄机构 3 n
+储蓄率 27 n
+储蓄罐 5 n
+储蓄金 3 n
+储蓄银行 3 n
+储蓄额 2 n
+储藏 145 n
+储藏室 34 n
+储藏库 4 n
+储藏所 3 n
+储藏柜 3 n
+储藏量 279 n
+储藏间 3 n
+储装 3 n
+储训 3 vn
+储训人才 3 n
+储训干部 3 n
+储谷 3 n
+储贷 3 n
+储起来 3 l
+储运 33 vn
+储运部 3 n
+储量 2628 n
+储金 2 n
+储金会 2 n
+储金池 3 nr
+储集 14 n
+储集层 6 n
+储集岩 3 nr
+储雷架 4 n
+傩 104 g
+傩戏 16 n
+傩神 3 n
+傪 2 zg
+傫如丧狗 3 n
+催 1405 zg
+催乳 14 n
+催乳素 6 n
+催交 2 v
+催产 7 vn
+催产素 32 n
+催产药 3 n
+催人奋进 11 i
+催人泪下 32 i
+催人老 3 n
+催促 767 v
+催债 3 n
+催健 3 n
+催办 6 v
+催动 111 v
+催化 475 v
+催化亚基 3 nz
+催化作用 3 n
+催化剂 752 n
+催化反应 3 l
+催化反应器 2 n
+催化器 3 n
+催化机理 3 n
+催化核心 3 n
+催化氢化 3 nz
+催化氢波 3 nz
+催化活性 3 n
+催化蒸馏 3 n
+催化裂化 3 n
+催化部位 3 n
+催化重整 3 l
+催发 3 v
+催吐 3 v
+催吐剂 2 n
+催告 10 n
+催命 49 vn
+催命鬼 3 n
+催奶 2 n
+催奶剂 3 n
+催干剂 3 n
+催征 3 v
+催情 9 n
+催情剂 7 n
+催情粉 3 n
+催情药 3 n
+催收 12 v
+催林 3 n
+催款 7 n
+催款函 3 n
+催款单 2 n
+催残 3 v
+催毁 3 v
+催毁性 3 n
+催泪 3 n
+催泪剂 3 n
+催泪弹 17 n
+催泪物 3 l
+催泪瓦斯 3 n
+催涎剂 3 n
+催熟 32 v
+催片 3 n
+催生 97 v
+催生作用 3 n
+催生出 3 v
+催眠 145 v
+催眠地 3 n
+催眠曲 9 n
+催眠术 15 n
+催眠疗法 3 n
+催眠药 11 n
+催租 3 n
+催粮 19 n
+催缴 11 v
+催缴资本 3 n
+催肥 4 n
+催花量 3 n
+催芽 13 v
+催要 9 v
+催讨 3 v
+催账单 3 n
+催赶 3 v
+催赶着 3 i
+催还通知 3 i
+催迫 9 v
+催逼 55 v
+催青 7 n
+傭 3 zg
+傲 215 a
+傲不可长 3 i
+傲世 3 nr
+傲世轻物 3 i
+傲人 3 n
+傲头傲脑 3 i
+傲岸 10 nr
+傲岸不群 3 i
+傲性 3 n
+傲慢 315 a
+傲慢不逊 8 i
+傲慢少礼 3 nr
+傲慢无礼 19 i
+傲气 72 a
+傲气凌人 3 i
+傲江湖 2 nr
+傲然 97 d
+傲然屹立 2 i
+傲然挺立 3 l
+傲然自得 3 i
+傲物 2 n
+傲睨一世 3 i
+傲睨一切 3 i
+傲睨万物 3 l
+傲睨得志 3 i
+傲睨自若 3 i
+傲神传 3 nr
+傲立 9 v
+傲视 39 v
+傲视一切 3 i
+傲视群伦 3 i
+傲视群芳 3 i
+傲视群雄 3 i
+傲贤慢士 3 i
+傲起来 3 l
+傲雪凌霜 3 i
+傲雪欺霜 3 i
+傲霜凌雪 3 nr
+傲霜斗雪 3 i
+傲骨 7 nr
+傲骨凌人 3 i
+傲骨嶙峋 3 l
+傲骨嶙嶙 3 l
+債 2 zg
+傺 9 x
+傻 2114 a
+傻不拉唧 3 z
+傻丫头 3 n
+傻乎乎 66 z
+傻乐 3 n
+傻了眼 45 l
+傻事 41 n
+傻傻 3 v
+傻傻忽忽 3 z
+傻傻的 6 z
+傻儿巴叽 3 n
+傻冒 7 v
+傻劲 3 n
+傻劲儿 8 n
+傻呵呵 5 z
+傻大姐 3 n
+傻大黑粗 3 z
+傻头傻脑 16 i
+傻女 3 n
+傻子 543 n
+傻小子 3 n
+傻屄 3 z
+傻帽 2 n
+傻帽儿 6 l
+傻干 5 n
+傻强 3 v
+傻憨 3 z
+傻气 25 n
+傻狗 3 n
+傻瓜 303 n
+傻瓜化 3 n
+傻瓜式 3 n
+傻瓜机 3 n
+傻瓜版 3 n
+傻瓜相机 3 n
+傻瓜蛋 3 n
+傻眼 67 n
+傻笑 109 v
+傻脱 3 v
+傻蛋 271 n
+傻话 35 n
+傻里傻气 42 z
+傻高 3 n
+傽 3 zg
+僄 3 zg
+僅 2 zg
+僆 10 zg
+僇 2 zg
+僇辱 3 vn
+僈 10 zg
+僌 3 zg
+像 31874 v
+像不像 3 v
+像册 4 v
+像圈 3 n
+像头 35 v
+像形夺名 3 l
+像心像意 3 l
+像心如意 3 l
+像心称意 3 l
+像心适意 3 n
+像是 2388 v
+像样 175 v
+像样儿 3 l
+像框 10 n
+像模像样 41 l
+像煞有介 3 vn
+像爬虫 3 n
+像片 37 n
+像章 45 n
+像素 96 n
+像素数 3 n
+像素点 3 n
+像胶 3 n
+像貌 3 n
+像距 3 v
+僑 4 zg
+僓 10 zg
+僖 52 nrt
+僖宗 22 nrt
+僗 26 zg
+僘 2 zg
+僚 179 n
+僚佐 8 n
+僚友 10 n
+僚属 94 n
+僚机 22 n
+僛 45 zg
+僜 7 zg
+僝 3 zg
+僡 6 zg
+僢 3 zg
+僥 5 zg
+僦 35 g
+僧 3908 n
+僧人 1003 n
+僧众 153 n
+僧伽 3 n
+僧伽罗 3 nz
+僧伽罗语 7 nz
+僧侣 282 n
+僧侣主义 3 nz
+僧俗 45 n
+僧堂 3 n
+僧多粥少 6 i
+僧孺 3 n
+僧寺 3 n
+僧尼 86 nr
+僧帽 3 n
+僧徒 34 n
+僧服 3 n
+僧格林沁 17 nz
+僧舍 16 n
+僧衣 3 n
+僧袍 78 n
+僧道 241 n
+僧院 8 n
+僧面 3 n
+僧鞋 3 n
+僬 13 x
+僭 4123 g
+僭赏滥刑 3 v
+僮 176 n
+僮仆 31 n
+僰 31 zg
+僳 3 x
+僳僳族 3 nz
+僵 507 n
+僵住 3 v
+僵冷 11 a
+僵冻 3 v
+僵化 264 v
+僵卧 14 v
+僵固 3 a
+僵尸 593 n
+僵尸洞 3 n
+僵局 274 n
+僵持 233 v
+僵持不下 3 n
+僵掉 3 v
+僵李代桃 3 n
+僵桃代李 3 n
+僵死 58 v
+僵滞 3 v
+僵直 81 v
+僵硬 306 a
+僵硬不变 3 n
+僵立 3 v
+僵蚕 4 n
+價 11 zg
+僺 2 zg
+僻 325 ag
+僻典 3 n
+僻壤 8 n
+僻处一隅 3 n
+僻字 3 n
+僻字涩句 3 n
+僻巷 4 n
+僻远 4 a
+僻道 3 n
+僻陋 3 a
+僻静 142 a
+僻静处 40 n
+僼 8 zg
+僽 3 zg
+儁 66 zg
+儂 3 zg
+億 2 zg
+儆 62 g
+儆戒 4 v
+儇 7 g
+儉 31 zg
+儊 14 zg
+儋 29 ns
+儋县 9 ns
+儋州 12 ns
+儋州市 4 ns
+儌 20 zg
+儍 2 zg
+儎 41 zg
+儏 363 zg
+儐 38 zg
+儒 613 n
+儒医 2 n
+儒商 15 n
+儒墨 3 n
+儒士 45 n
+儒学 286 n
+儒学家 5 n
+儒家 981 n
+儒家思想 3 n
+儒家文化 3 nz
+儒将 29 n
+儒教 86 nz
+儒术 61 n
+儒林 10 nz
+儒林外史 30 nz
+儒生 220 n
+儒略历 19 n
+儒者 23 n
+儒艮 23 n
+儒道 32 n
+儒门 2 n
+儒门事亲 3 n
+儒雅 125 nz
+儒雅风流 2 n
+儓 34 zg
+儔 2 zg
+儕 72 zg
+儗 59 zg
+儗不于伦 3 nr
+儗非其伦 3 nz
+儙 8 zg
+儚 206 zg
+儜 35 zg
+儠 5 zg
+儡 3 x
+儢 2 zg
+儣 3 zg
+儤 4 zg
+儦 5 zg
+儧 2 zg
+儨 48 zg
+優 4 zg
+儫 71 zg
+儭 28 zg
+儰 6 zg
+儲 22 zg
+儳 40 zg
+儴 469 zg
+儵 4 zg
+儷 15 zg
+儸 2 zg
+儹 78 zg
+儻 18 zg
+儿 15411 n
+儿化 9 n
+儿女 973 n
+儿女之债 3 l
+儿女之命 3 l
+儿女之情 3 n
+儿女亲家 3 l
+儿女债 3 n
+儿女心肠 3 n
+儿女情 7 n
+儿女情长 24 n
+儿女成群 3 n
+儿女成行 3 n
+儿媳 291 n
+儿媳妇 229 n
+儿媳妇儿 3 n
+儿子 9364 n
+儿子般 3 l
+儿子身份 3 n
+儿孙 130 n
+儿孙满堂 8 l
+儿孙自有 3 i
+儿少 7 n
+儿戏 134 n
+儿时 162 t
+儿歌 75 n
+儿男 3 n
+儿皇帝 15 n
+儿科 115 n
+儿科医生 3 n
+儿科医院 3 nt
+儿科学 5 nt
+儿童 5456 n
+儿童不宜 3 i
+儿童乐园 3 n
+儿童书 2 n
+儿童公园 3 n
+儿童剧 23 n
+儿童剧院 5 nt
+儿童医院 55 nt
+儿童哮喘 3 n
+儿童团 5 nt
+儿童图书 3 n
+儿童床 3 n
+儿童座椅 3 n
+儿童心理 3 n
+儿童性 4 n
+儿童房 3 n
+儿童教育 3 l
+儿童文学 130 nt
+儿童文学家 6 l
+儿童智力 3 n
+儿童服装 3 l
+儿童期 33 n
+儿童村 13 n
+儿童活动 3 l
+儿童片 2 n
+儿童玩具 3 n
+儿童用 8 n
+儿童用品 3 n
+儿童画 3 n
+儿童票 3 n
+儿童笑话 3 l
+儿童组 3 n
+儿童网 3 n
+儿童节 25 n
+儿童节目 3 n
+儿童英语 3 nz
+儿童诗 5 n
+儿童读物 3 n
+儿童音乐 3 n
+儿艺 4 n
+儿茶 10 n
+儿茶素 7 n
+儿茶酚 3 n
+儿茶酚胺 17 n
+儿行千里母担忧 3 l
+儿郎 14 n
+儿马 11 n
+兀 1027 ag
+兀然 3 d
+兀突 3 n
+兀立 3 n
+兀自 977 d
+兀鹫 9 n
+兀鹰 3 n
+允 1345 v
+允从 3 v
+允修 13 v
+允准 23 v
+允可 2 v
+允堪 2 v
+允当 21 v
+允怒 2 v
+允执其中 2 nr
+允执厥中 2 nr
+允承 3 v
+允文允武 3 nr
+允祀 6 v
+允行 2 v
+允许 3247 v
+允许值 6 nr
+允许浓度 3 nr
+允许温差 3 nr
+允许量 3 nr
+允诺 82 v
+允饶 2 v
+兂 480 zg
+元 28837 m
+元万顷 2 nr
+元世祖 454 nr
+元丰 100 nz
+元丰郡 2 nr
+元义宁 5 nr
+元义方 33 nr
+元书纸 3 nz
+元二帝 2 nr
+元亨利 3 nr
+元仁宗 35 nr
+元代 1470 t
+元件 363 n
+元件厂 3 n
+元件库 3 n
+元佑 2 nz
+元修义 4 nr
+元元 3 t
+元元之民 3 nr
+元元旦 3 t
+元元本本 3 n
+元元贞 8 nr
+元兴元 13 nr
+元军 55 nr
+元军平 2 nr
+元军渡 3 nr
+元凤鸣 14 nr
+元凳 3 n
+元凶 54 n
+元初 3 t
+元利 4 nz
+元勋 68 nr
+元化道 2 n
+元华 3 nz
+元古 3 t
+元古代 56 t
+元古宇 3 nr
+元古宙 9 nr
+元古界 29 n
+元史 3 n
+元名臣 2 nr
+元君庙 2 nr
+元善见 3 nr
+元嗣圣 2 nr
+元嘉之 8 nr
+元嘉体 3 nr
+元器 3 n
+元器件 110 n
+元四家 7 nr
+元圣儿 3 nr
+元圣政 2 nr
+元圣武 3 nr
+元地理学 3 n
+元坝区 2 ns
+元境侵 2 nr
+元夜 6 t
+元大仙 6 nr
+元大德 2 nr
+元大都 1319 nz
+元天历 3 nr
+元天寿 3 nr
+元天德 2 nr
+元天福 3 nr
+元天聪 2 nr
+元太宗 3 nr
+元太祖 15 nr
+元奸巨恶 3 n
+元好问 3 nr
+元始 54 nz
+元子 16 n
+元子乃 2 nr
+元子陪 2 nr
+元字符 6 nr
+元宝 201 nr
+元宝区 3 nr
+元宝山 11 nr
+元宝山区 3 ns
+元宝枫 3 nr
+元宝草 3 nr
+元宪宗 7 nr
+元宫城 128 nr
+元宵 169 t
+元宵夜 3 t
+元宵节 148 t
+元山 22 nr
+元崇德 2 nr
+元帅 874 nr
+元帝初 2 nr
+元帝建 2 nr
+元帝皇后 3 nr
+元年 4512 t
+元广波 9 nr
+元廷另 2 nr
+元廷授 2 nr
+元廷调 2 nr
+元建武 2 nr
+元建炎 2 nr
+元开平 2 nr
+元张弘 2 nr
+元彬 3 nz
+元德明 2 nr
+元德通 2 nr
+元恶 3 n
+元恶大奸 3 n
+元恶大憨 3 nr
+元悲 2 n
+元惠宗 2 nr
+元戎 12 nr
+元戎启行 3 nr
+元成宗 28 nr
+元敬兄 6 nr
+元方季方 3 nr
+元日 3 t
+元旦 465 t
+元旦假期 3 t
+元旦晚会 3 nr
+元旦节 3 t
+元昊建国 2 nr
+元昊皇后 2 nr
+元昊选 2 nr
+元明两代 3 nr
+元明史 2 nr
+元明善 5 nr
+元明宗 4 nr
+元明时 3 t
+元明清 53 nr
+元明粉 4 nr
+元春 18 t
+元景仲 2 nr
+元景炎 2 nr
+元曲 35 n
+元曲选 12 nr
+元月 81 t
+元月份 7 nz
+元朗 4 nr
+元朝 1101 t
+元末明 20 nr
+元本 3 n
+元杂剧 3 n
+元桌 3 n
+元梁王 2 nr
+元武宗 8 nr
+元氏 22 nr
+元氏县 2 nr
+元气 294 n
+元气大伤 3 n
+元气大衰 3 nr
+元永初 2 nr
+元永嘉 2 nr
+元永昌 11 nr
+元永贞 2 nr
+元江哈尼族彝族傣族自治县 4 ns
+元治平 2 nr
+元法 26 n
+元洪业 2 nr
+元济 3 n
+元济匿 3 nr
+元澄道 3 nr
+元澄道人 6 nr
+元煤 3 n
+元熙 7 nz
+元狩 72 nz
+元珠笔 3 n
+元田盛 3 nr
+元痛 3 n
+元皇庆 2 nr
+元皇泰 2 nr
+元盛 3 nz
+元祖 3 nr
+元神祭 2 nr
+元祥兴 2 nr
+元祺祥 3 nr
+元禅师 2 nr
+元章武 4 nr
+元素 1914 n
+元素主义 3 n
+元素周期 3 n
+元素对比 3 n
+元素符号 14 n
+元素靶 3 nr
+元组 3 n
+元绍汉 2 nr
+元经秘旨 3 n
+元老 451 nr
+元老派 3 nr
+元老级 3 n
+元老院 3 nr
+元至顺 2 nr
+元良勇 4 nr
+元色 3 n
+元英宗 17 nr
+元裔之 3 nr
+元规则 3 n
+元认知 3 n
+元语言 4 nr
+元谋 10 n
+元谋人 22 n
+元谋县 11 nr
+元谋猿人 5 n
+元贞观 2 nr
+元贵靡 3 nr
+元辅张 7 nr
+元进宝 2 nr
+元通 19 nz
+元通宝 2 nr
+元通镇 5 nr
+元逻辑 3 n
+元遗山 3 nr
+元配 23 nr
+元金统 2 nr
+元针 3 n
+元钉 3 nr
+元阳 18 nr
+元阳县 2 ns
+元隆武 3 nr
+元雅 3 nr
+元霄节 3 nr
+元青花 3 nr
+元音 176 n
+元顺帝 104 nr
+元首 635 t
+元首级 3 nr
+元魏 2 t
+元麦 3 nr
+元龙 5 nr
+元龙豪气 3 nr
+元龙高卧 3 nr
+兄 3402 n
+兄友弟恭 3 i
+兄台 3 n
+兄妹 387 n
+兄妹俩 3 n
+兄妹情 3 n
+兄姐 3 n
+兄嫂 47 n
+兄弟 9644 n
+兄弟两人 3 n
+兄弟二人 3 n
+兄弟会 33 n
+兄弟俩 3 n
+兄弟姐妹 3 n
+兄弟怡怡 3 nr
+兄弟杯 3 n
+兄弟般 3 n
+兄弟阋于墙 4 i
+兄弟阋墙 6 i
+兄死弟及 3 n
+兄终弟及 3 i
+兄肥弟瘦 3 n
+兄贵 3 n
+兄长 686 n
+充 1549 v
+充任 236 v
+充仿 3 v
+充作 3 v
+充值 22 n
+充值卡 10 n
+充假 3 a
+充充 3 v
+充充气 3 n
+充公 30 n
+充其量 119 n
+充内行 3 n
+充军 281 n
+充分 7052 ad
+充分体现 3 v
+充分保证 3 n
+充分准备 3 n
+充分利用 3 n
+充分利用网络 2 n
+充分反映 4 i
+充分发扬 3 i
+充分发挥 72 n
+充分就业 3 l
+充分性 5 n
+充分条件 3 n
+充分考虑 11 n
+充分肯定 3 nz
+充分行使 3 n
+充分认识 3 l
+充分证明 3 n
+充分说明 3 l
+充分调动 3 l
+充分运用 3 l
+充到 3 v
+充塞 73 v
+充塞着 3 v
+充填 97 v
+充填剂 4 n
+充填器 3 n
+充填工具 3 n
+充填机 3 n
+充天塞地 3 i
+充好 3 a
+充实 704 ad
+充实感 3 n
+充当 981 a
+充当人质 3 l
+充当先锋 3 l
+充放电 11 n
+充数 18 n
+充斥 256 v
+充斥市面 3 n
+充栋汗牛 3 i
+充栋盈车 3 i
+充气 104 n
+充气卡通 3 nz
+充气吹胀 3 l
+充气床 3 n
+充气式 5 n
+充气机 3 n
+充气棒 2 n
+充气泵 3 n
+充气袋 3 n
+充氧 6 v
+充水 3 v
+充沛 475 a
+充溢 57 v
+充满 4432 a
+充满信心 3 i
+充满希望 3 nz
+充满活力 3 l
+充满热情 3 n
+充满生机 3 l
+充满著 3 n
+充电 304 v
+充电器 12 n
+充电式 3 n
+充电机 3 n
+充电电池 3 n
+充电电流 3 n
+充电站 3 n
+充畅 3 a
+充盈 91 a
+充盛 3 a
+充磁 3 n
+充箱盈架 3 n
+充类至尽 3 l
+充耳不闻 63 i
+充耳无闻 3 i
+充腹 3 n
+充血 176 v
+充血性 3 n
+充裕 239 a
+充要 3 a
+充要条件 17 l
+充足 1227 a
+充足率 11 n
+充门面 3 n
+充闾之庆 3 i
+充阔 3 a
+充阔气 3 i
+充饥 161 v
+充饥画饼 3 v
+兆 1231 m
+兆位 4 n
+兆周 3 n
+兆头 92 n
+兆惠 3 nz
+兆欧 3 nz
+兆欧表 3 n
+兆欧计 3 n
+兆比特 3 nz
+兆瓦 63 q
+兆示 7 n
+兆赫 74 q
+兆赫兹 3 nz
+兆载永劫 3 vn
+兆麟 3 nz
+先 25558 d
+先上 3 d
+先上去 3 t
+先上来 3 t
+先下 3 t
+先下手 3 n
+先下手为强 75 i
+先世 62 n
+先严 3 a
+先为 3 d
+先主 170 n
+先买 26 v
+先了一步 3 i
+先予 3 v
+先予执行 3 i
+先于 273 d
+先交 3 n
+先享后付 3 n
+先人 217 n
+先人后己 7 i
+先人后已 3 i
+先人着鞭 3 i
+先付 3 v
+先代 10 t
+先令 662 n
+先以 3 d
+先会 3 n
+先例 295 n
+先借 3 v
+先兄 3 n
+先兆 86 n
+先入为主 63 i
+先入之见 4 i
+先公 3 n
+先公后私 5 n
+先农坛 142 n
+先农坛体育场 7 n
+先决 15 v
+先决条件 104 n
+先决问题 3 n
+先减 3 v
+先出法 3 n
+先刊 3 n
+先列 3 n
+先别 3 d
+先前 1438 t
+先剪 3 n
+先务之急 3 i
+先包 3 n
+先去 3 t
+先发制人 158 n
+先史时代 3 n
+先号后庆 3 i
+先号后笑 3 i
+先同 3 d
+先后 10115 t
+先后座 3 n
+先后顺序 3 i
+先向 3 n
+先君 3 n
+先吸 3 v
+先哲 21 n
+先唱 3 n
+先嚐 3 v
+先回到 3 l
+先回去 3 i
+先土后洋 3 i
+先圣 51 a
+先圣先师 3 n
+先在 3 t
+先声 64 d
+先声后实 3 i
+先声夺人 49 n
+先天 476 t
+先天下之忧而忧 19 i
+先天不足 41 i
+先天之精 9 i
+先天属性 3 n
+先天性 223 n
+先天性免疫 3 l
+先天理论 3 n
+先夫 3 n
+先头 137 n
+先头部队 3 n
+先套 3 n
+先奸后杀 3 i
+先妣 3 i
+先存 3 n
+先守 3 n
+先守后攻 3 i
+先宰 3 v
+先容 3 n
+先寄 3 v
+先寇布 3 i
+先富 30 a
+先富起来 3 i
+先导 188 n
+先导性 3 n
+先小人后 3 i
+先尝 3 d
+先尝后买 3 l
+先师 222 n
+先帝 279 n
+先带 3 n
+先府君 3 n
+先延 3 n
+先往 3 d
+先征 3 n
+先得我心 3 i
+先心病 31 n
+先忧后乐 3 i
+先悉必具 3 ns
+先意承志 3 n
+先意承指 3 n
+先意承旨 3 n
+先意承颜 3 n
+先慈 3 a
+先我着鞭 3 i
+先战 3 n
+先戴 3 n
+先手 7 n
+先手棋 3 n
+先抓 3 v
+先报 3 n
+先抱 3 n
+先抽 3 nz
+先拍 3 n
+先拔头筹 19 i
+先挑 3 a
+先捡 3 v
+先排 3 d
+先攻后守 3 i
+先救 3 v
+先教办 3 n
+先敷 3 v
+先斩后奏 17 i
+先斩后闻 3 i
+先断 3 d
+先断后闻 3 i
+先易后难 10 i
+先是 1101 d
+先服 3 n
+先期 419 t
+先期到达 3 l
+先机 73 n
+先来 3 t
+先来先上 3 i
+先来先下 3 i
+先来后上 3 l
+先来后下 3 i
+先来后到 6 l
+先查 3 v
+先歉 3 a
+先母 3 n
+先民 184 n
+先河 169 n
+先河后海 3 i
+先泡 3 n
+先洗 3 b
+先派 3 n
+先测 3 v
+先演 3 n
+先点 3 n
+先烈 212 a
+先照 3 n
+先父 115 n
+先猜 3 v
+先王 49 n
+先生 14470 n
+先用 3 n
+先皇 3 n
+先盛后衰 3 i
+先睹 3 v
+先睹为快 11 i
+先知 174 n
+先知先觉 10 i
+先知先觉者 2 n
+先知后觉 3 i
+先砍 3 v
+先礼后兵 24 i
+先祖 105 n
+先科 9 n
+先秦 506 t
+先秦散文 3 nz
+先秦文学 3 n
+先秦时代 3 n
+先站 3 n
+先端 59 n
+先笑后号 3 i
+先签 3 n
+先纳 3 v
+先缝 3 n
+先考 3 v
+先聊 3 a
+先自隗始 3 vn
+先花后果 3 n
+先苦后甘 3 v
+先苦后甜 3 i
+先行 1132 n
+先行一步 3 i
+先行判决 3 n
+先行后闻 3 n
+先行官 9 n
+先行点 2 n
+先行算法 3 n
+先行者 93 n
+先裁 3 n
+先要 3 b
+先见 58 n
+先见之明 40 i
+先觉 11 n
+先觉先知 3 n
+先讨 3 v
+先让人 3 n
+先记 3 n
+先试后买 2 v
+先读 3 v
+先调 3 n
+先谈 3 n
+先谴队 3 vn
+先贤 71 n
+先贤祠 4 ns
+先赢后输 3 n
+先走一步 3 i
+先载 3 b
+先辈 134 n
+先辈遗训 3 n
+先进 13966 a
+先进个人 3 n
+先进事迹 3 n
+先进人物 3 n
+先进先出 3 i
+先进典型 3 n
+先进分子 3 n
+先进县 27 n
+先进后出 3 i
+先进岗 2 n
+先进性 167 n
+先进村 3 n
+先进校 8 n
+先进武器 3 n
+先进经验 3 n
+先进设备 3 n
+先进集体 3 n
+先进青年 3 n
+先逛 3 v
+先遣 70 b
+先遣部队 3 n
+先遣队 48 n
+先采 3 n
+先量 3 n
+先钓 3 v
+先销 3 n
+先锋 1169 n
+先锋号 2 n
+先锋岗 3 n
+先锋报 3 n
+先锋派 41 n
+先锋网 3 n
+先锋论坛 3 n
+先锋队 81 n
+先锋霉素 3 n
+先降 3 v
+先难后获 3 i
+先露 27 v
+先驰得点 3 i
+先驱 534 n
+先驱报 3 n
+先驱新党 7 n
+先驱者 81 n
+先驱蝼蚁 3 n
+先验 77 n
+先验概率 3 i
+先验论 16 n
+先验论者 3 n
+光 10895 n
+光与影 3 n
+光临 289 v
+光临惠顾 3 i
+光临指导 3 i
+光乎乎 3 z
+光云 6 n
+光交联 3 j
+光亮 509 a
+光亮亮 4 nr
+光亮剂 3 n
+光亮度 12 n
+光以太 3 nr
+光伏 13 j
+光会 3 n
+光体 5 n
+光佛 4 n
+光催化 3 nr
+光催化剂 3 nr
+光光 57 n
+光光亮亮 3 nr
+光光明明 3 nr
+光光滑滑 3 n
+光光荣荣 3 nr
+光具组 3 n
+光养生物 3 n
+光利 16 n
+光刻 11 n
+光刻机 3 n
+光刻胶 3 n
+光前启后 3 nr
+光前绝后 3 i
+光前裕后 3 nr
+光剑 2 n
+光化 26 n
+光化作用 3 n
+光化学 86 n
+光华 1962 nz
+光华四射 3 nz
+光华夺目 3 n
+光华木材厂 128 n
+光华路 3 n
+光卤石 11 n
+光压 20 n
+光反射 3 l
+光反应 3 l
+光变 32 n
+光口 2 n
+光可鉴人 11 i
+光合 120 v
+光合产物 3 n
+光合作用 278 n
+光合强度 3 n
+光同化 3 n
+光向 3 n
+光吸收 3 n
+光周期 3 n
+光呼吸 3 l
+光和热 3 n
+光唱 3 n
+光唸 3 z
+光喝 3 v
+光器 5 n
+光四射 3 nz
+光团 3 n
+光固化 3 n
+光圈 39 n
+光圈值 3 l
+光坦 3 a
+光塔 4 n
+光复 213 v
+光复会 44 nt
+光复国土 3 n
+光复国小 3 l
+光复旧物 3 l
+光复活 3 i
+光复节 3 nr
+光复路 3 l
+光大 199 j
+光大起来 3 l
+光大银行 39 nt
+光天化日 95 nz
+光头 179 n
+光头党 3 n
+光子 260 n
+光存储 3 nr
+光孝寺 3 nr
+光学 1217 n
+光学仪器 3 n
+光学图像 6 n
+光学家 4 n
+光学录音 2 n
+光学材料 3 n
+光学玻璃 36 nt
+光学系统 2 l
+光学薄膜 3 n
+光学设备 3 n
+光学镜片 3 n
+光守 3 n
+光宗耀祖 37 nr
+光宝 3 n
+光宠 3 a
+光密 13 n
+光密介质 3 n
+光密度 3 n
+光密度计 3 n
+光导 31 n
+光导元件 3 n
+光导管 3 n
+光导纤维 44 l
+光屁股 5 n
+光屏 3 n
+光山 25 n
+光山县 5 ns
+光州 26 ns
+光巴 3 n
+光带 30 n
+光年 365 n
+光度 219 n
+光度学 13 nt
+光度法 3 n
+光度表 3 n
+光度计 29 n
+光异构化 3 n
+光强 65 v
+光彩 585 n
+光彩四射 3 l
+光彩夺目 293 i
+光彩溢目 3 l
+光彩炫目 3 nr
+光彩照人 45 n
+光彩熠熠 3 nr
+光彩耀目 3 i
+光彩耀眼 3 i
+光彩起来 3 l
+光彩陆离 3 i
+光彩霁月 3 i
+光影 104 n
+光得 3 v
+光心 3 n
+光念 3 n
+光怪 3 n
+光怪陆离 44 i
+光想 3 n
+光感受器 3 n
+光慈姑 3 nr
+光手 3 n
+光扫描器 3 i
+光拴 3 nr
+光排照 3 j
+光控 4 j
+光掺杂 3 z
+光收 3 n
+光效 2 a
+光敏 73 nr
+光敏剂 3 n
+光敏化 3 n
+光敏感性 3 n
+光敏电阻 3 n
+光数 3 n
+光斑 33 n
+光斗 2 n
+光旗 4 n
+光明 1219 n
+光明之路 3 i
+光明前途 3 i
+光明大道 3 i
+光明日报 86 nz
+光明日报出版社 2 nt
+光明日报社 2 nt
+光明正大 115 i
+光明港 4 nr
+光明磊落 177 i
+光明网 18 n
+光明节 2 n
+光明行 2 nt
+光明面 3 n
+光明顶 3 n
+光是 236 n
+光是在 3 l
+光晕 28 n
+光景 364 n
+光未然 6 i
+光术 2 n
+光机 17 n
+光机所 3 n
+光机电 5 n
+光杆 12 n
+光杆儿 3 n
+光杆司令 21 n
+光束 212 n
+光杠杆 3 nr
+光板 15 n
+光板儿 3 n
+光枝勾 3 nr
+光枪 3 n
+光柱 113 n
+光栅 77 n
+光栅尺 3 nr
+光栅扫描 7 n
+光标 43 n
+光标跟随 3 n
+光标键 3 n
+光核桃 3 n
+光棍 115 n
+光棍儿 2 n
+光棍汉 10 n
+光棍节 3 n
+光武帝 61 nr
+光殿 2 n
+光气 31 n
+光氧化 3 n
+光污染 2 i
+光油油 3 n
+光泉 3 n
+光波 224 n
+光波炉 3 n
+光波长 3 n
+光泽 1006 n
+光泽县 3 nr
+光泽度 8 n
+光泽感 3 n
+光泽精 3 nr
+光洁 79 a
+光洁度 11 n
+光洋 13 n
+光活化 3 n
+光涌 3 n
+光润 48 n
+光源 284 n
+光溜 7 z
+光溜溜 82 z
+光滑 511 a
+光滑度 2 n
+光滑性 3 n
+光滑明亮 3 n
+光滑滑 3 n
+光滑簇 3 i
+光滑髓针 3 n
+光漂白 3 z
+光激电离 3 n
+光火 24 n
+光灯 7 n
+光灿夺目 3 i
+光灿灿 13 z
+光灿然 3 z
+光点 47 n
+光热 30 n
+光焰 45 n
+光焰万丈 3 i
+光照 310 n
+光照处理 3 l
+光照度 14 n
+光照强度 3 l
+光照阶段 3 n
+光熙 135 n
+光物理 3 n
+光猜 3 v
+光环 195 n
+光球 4 n
+光生物学 3 nt
+光用 3 n
+光电 616 j
+光电位 3 n
+光电催化 3 vn
+光电子 61 n
+光电子学 10 n
+光电开关 3 nt
+光电效应 75 n
+光电池 10 n
+光电流 3 n
+光电磁 3 n
+光电管 27 n
+光电钟 3 n
+光电鼠 3 n
+光电鼠标 3 n
+光疗 5 n
+光盘 364 n
+光盘启动 3 i
+光盘库 3 n
+光盘机 2 n
+光盘片 3 n
+光盘版 3 n
+光着 3 v
+光着头 3 l
+光碎片化 3 nz
+光碟 12 n
+光碟世界 3 n
+光碟塔 3 nr
+光碟机 2 n
+光碟网 3 n
+光碟读头 3 n
+光祖 3 n
+光神霉素 3 n
+光秃 19 z
+光秃秃 123 z
+光程 49 n
+光端机 3 n
+光笔 10 n
+光管 15 n
+光緒 3 z
+光纤 407 n
+光纤卡 3 n
+光纤网 3 n
+光纤网络 3 n
+光纤通信 38 l
+光线 802 n
+光线方向 3 n
+光线枪 3 n
+光绪 2449 n
+光绪帝 224 nr
+光绪年间 3 n
+光绪皇帝 3 nr
+光缆 367 n
+光网 5 n
+光罩 4 n
+光耀 186 nr
+光考 3 v
+光能 3 n
+光脆性 3 l
+光脑 5 n
+光脚 3 n
+光膀子 3 l
+光致发光 3 n
+光致变色 3 l
+光致抗蚀剂 3 n
+光致溶血 3 n
+光致聚合 3 i
+光良 3 z
+光色 9 n
+光色素 3 n
+光艳 12 a
+光艳动人 3 i
+光芒 1838 n
+光芒万丈 9 i
+光芒四射 31 nz
+光荣 2088 nr
+光荣义务 3 n
+光荣任务 3 n
+光荣传统 3 n
+光荣史 2 nr
+光荣席 3 n
+光荣感 6 n
+光荣榜 9 nr
+光荣牌 3 n
+光荣牺牲 3 i
+光荣称号 3 n
+光荣花 3 nr
+光荣院 3 nr
+光荣革命 3 l
+光莹 2 a
+光蕊 22 n
+光蛋 3 n
+光蝶 3 n
+光行差 3 n
+光补偿点 3 n
+光表 3 n
+光裸 3 z
+光要 3 a
+光视效率 3 n
+光视蛋白 3 n
+光解 3 v
+光解作用 3 n
+光解离 3 n
+光解酶 3 n
+光触媒 3 i
+光诱导 3 nr
+光说不做 3 i
+光说不练 3 i
+光读 3 v
+光谱 579 n
+光谱仪 42 n
+光谱信息 3 n
+光谱分析 65 l
+光谱学 60 n
+光谱干扰 3 l
+光谱法 3 n
+光谱测量 3 n
+光谱线 51 n
+光谱色 3 n
+光谷 567 n
+光赤 3 nr
+光路 5 n
+光路图 3 n
+光身汉 3 n
+光车骏马 3 nz
+光轮 3 n
+光轴 3 n
+光辉 1223 nr
+光辉业绩 3 n
+光辉夺目 3 i
+光辉灿烂 39 i
+光辉耀眼 3 i
+光辐射 41 nz
+光输 3 vn
+光过 3 v
+光还原 3 i
+光送 3 v
+光送不卖 3 l
+光通 4 n
+光通信 27 nt
+光通量 20 n
+光速 248 n
+光道 2 n
+光采 26 n
+光重排 3 n
+光量子 65 n
+光锥 3 n
+光镜 3 n
+光闪闪 156 z
+光阁 2 n
+光阴 158 n
+光阴似箭 9 l
+光阴如箭 3 l
+光阴荏苒 15 i
+光降 43 v
+光降解 3 n
+光雾 2 n
+光靠 3 a
+光面 20 n
+光顺 3 nz
+光顾 225 v
+光预解离 3 i
+光频 3 n
+光风霁月 9 i
+光风霏月 3 nr
+光饼 3 n
+光驱 89 n
+光驱线 3 n
+光鲜 88 a
+光鲜亮丽 3 nr
+光黄素 3 n
+兊 5 zg
+克 6270 m
+克丁克卯 3 n
+克丘亚 21 nr
+克丘亚语 6 nz
+克东 3 ns
+克东县 3 ns
+克丝钳子 3 n
+克主杰 2 nr
+克丽丝 3 nr
+克丽奥 15 nr
+克丽奥佩 8 nr
+克丽斯 4 nr
+克丽缇娜 3 nr
+克丽西 2 nr
+克二世 2 nr
+克亚吉 2 nr
+克什 10 nrt
+克什克腾旗 22 ns
+克什米尔 206 nrt
+克什米尔地区 23 ns
+克什米尔语 3 nz
+克仑特罗 3 ns
+克伐怨欲 3 i
+克传弓冶 3 nr
+克伦人 3 nrt
+克伦威尔 43 nrt
+克伦尼 2 nr
+克伦斯 4 nr
+克伦斯基 15 nrt
+克伦河 2 ns
+克伦特 8 nr
+克伦语 5 nr
+克伯克 3 nr
+克佩勒 5 nr
+克俭 3 nr
+克俭克勤 3 nr
+克兢 2 i
+克兰 11 ns
+克兰河 6 nr
+克兰福德 3 nrt
+克兰科 2 nz
+克兰西 3 nr
+克分子 3 nr
+克列奥 2 nrt
+克列沃 5 nr
+克列缅 5 nrt
+克列蒙 3 nr
+克利 14 nrt
+克利亚 2 ns
+克利克 3 nr
+克利兰 2 ns
+克利夫 8 nr
+克利夫兰 44 nrt
+克利奥 18 nrt
+克利斯 70 nr
+克利特 4 nrt
+克利福德 7 nrt
+克利福洛 3 nr
+克利科 2 nr
+克利青 4 nr
+克利马 7 ns
+克制 522 v
+克制不住 3 v
+克制性 3 nr
+克努特 9 nr
+克劳 11 nrt
+克劳修 9 nr
+克劳修斯 4 nr
+克劳塞维茨 35 nrt
+克劳奇 18 nr
+克劳德 14 nrt
+克劳斯 26 nrt
+克劳特 2 nrt
+克劳狄 17 nr
+克劳琛 5 nr
+克劳福德 6 nrt
+克劳语 2 nr
+克劳迪 13 nr
+克劳迪斯 2 nrt
+克劳馥 4 nr
+克勒 9 nrt
+克勒尔 9 nr
+克勒斯 79 nr
+克勒曼 2 nr
+克勒泽尔 2 nr
+克勒芒 2 nr
+克勒青 5 nr
+克勤克俭 7 nr
+克勤郡 3 nr
+克南 3 ns
+克卢埃 2 nr
+克卢日 9 nrt
+克原子 15 nr
+克吕兹 5 nr
+克吕尼 11 nr
+克吾力 2 nz
+克嗣良裘 3 nr
+克图珲 2 nr
+克地曼 3 nr
+克塔迪 3 nr
+克塞尔 3 nr
+克塞诺 2 nr
+克塞诺芬 2 nrt
+克复 46 nr
+克多伦 2 nrt
+克奴姆 4 nr
+克姆契 2 nr
+克威克 3 nr
+克威尔 3 nr
+克嫩 3 ns
+克孜勒 9 nrt
+克孜勒河 3 ns
+克孜勒苏 4 ns
+克孜勒苏柯尔克孜自治州 11 ns
+克孜尔 22 nrt
+克孜族 3 nz
+克宋江 2 nr
+克尔 60 nrt
+克尔三 2 nr
+克尔克 6 nrt
+克尔凯 3 nr
+克尔凯戈 3 nrt
+克尔奥 2 nrt
+克尔孙 2 nr
+克尔得 48 nrt
+克尔恰 4 nr
+克尔斯 2 nrt
+克尔斯蒂奇 15 nrt
+克尔曼 12 nrt
+克尔曼沙 5 ns
+克尔曼省 2 ns
+克尔梅 22 nr
+克尔欧 2 ns
+克尔特 57 nrt
+克尔白 21 nr
+克尔盒 3 nz
+克尔纳 3 nr
+克尔维尔 4 nrt
+克尔罗 2 nrt
+克尔诺夫 2 nrt
+克尔逊 6 nrt
+克尔阶 3 nr
+克尼亚 4 ns
+克尼利 2 nr
+克尼杜 48 nr
+克尽厥职 3 i
+克尽夫道 3 nr
+克尽妇道 3 i
+克尽孝 16 nr
+克尽职守 3 i
+克山 38 ns
+克山县 2 ns
+克山病 12 nr
+克己 49 nr
+克己复礼 74 nz
+克己奉公 13 nr
+克己慎行 3 i
+克已复礼 3 nr
+克已奉公 3 nr
+克巴尔 5 nrt
+克建昌 2 nr
+克张宁 2 nr
+克当量 3 v
+克御强 2 nr
+克德浑 12 nr
+克恭克顺 3 nz
+克息州 2 nr
+克扣 121 nr
+克承家 3 nr
+克拉 391 nrt
+克拉伦斯 2 nrt
+克拉克 88 nrt
+克拉克空军基地 3 nz
+克拉别克 3 ns
+克拉夫 3 nrt
+克拉夫丘克 6 nrt
+克拉夫特 10 nrt
+克拉姆 8 nrt
+克拉尔 4 nrt
+克拉底 90 nrt
+克拉拉 8 nrt
+克拉斯 3 nrt
+克拉斯诺亚尔斯克 30 nrt
+克拉斯诺夫 2 nrt
+克拉斯诺雅尔斯克 2 nrt
+克拉泽博格 2 ns
+克拉特 3 nrt
+克拉玛依 45 nr
+克拉玛依市 19 ns
+克拉玛依油田 5 ns
+克拉珀 10 nrt
+克拉码头 3 ns
+克拉科夫 45 nrt
+克拉索夫 10 nrt
+克拉苏 27 ns
+克拉通 3 nr
+克拉马依 3 nr
+克拉默 2 nr
+克敌 83 nr
+克敌制胜 91 i
+克数 3 nz
+克斯 53 nrt
+克斯伯爵 2 nr
+克斯克 2 nrt
+克斯夫人 2 nrt
+克斯弗 2 nr
+克斯波 5 nr
+克斯蒂奇 3 nrt
+克斯语 2 nz
+克斯霍尔 2 nrt
+克斯韦 23 nr
+克族 16 nz
+克星 152 nz
+克服 1473 v
+克服困难 3 i
+克服缺点 3 n
+克朗 66 nr
+克期 3 nr
+克来德曼 3 nr
+克林姆 2 nr
+克林德 15 nr
+克林斯曼 5 nrt
+克林格 3 nr
+克林格尔 4 nrt
+克林特 3 nr
+克林顿 295 nr
+克林顿政府 15 nt
+克格勃 28 nr
+克森和 2 nr
+克死 3 v
+克毕尔 2 nr
+克氏符号 3 nr
+克汀病 18 n
+克汝宁 2 nr
+克沃兹 9 nr
+克沙赫 7 nr
+克波尔 3 nr
+克泽河 2 nr
+克洛代 3 nr
+克洛代尔 2 nrt
+克洛伊 2 nrt
+克洛克 2 nrt
+克洛塔尔 3 nrt
+克洛夫 3 nr
+克洛宁 4 nr
+克洛德 14 nrt
+克洛斯 8 nr
+克洛普 2 nr
+克洛泽 3 nr
+克洛瓦 4 nrt
+克洛维 17 nr
+克洛诺斯 3 nrt
+克清州 2 nr
+克烈部 6 nr
+克爱克威 3 nr
+克特 13 nrt
+克特拉 3 nrt
+克特西 2 nrt
+克瑞斯 3 nr
+克瑞格 14 nr
+克瑞翁 3 nr
+克瑞西 2 nr
+克瓦希涅夫斯基 2 nrt
+克瓦查 2 nr
+克留杜 16 nr
+克留格 2 nr
+克秀奈 7 nr
+克秀耐 2 nr
+克科钦 2 nr
+克立 4 v
+克米伦 3 nr
+克索斯 2 nr
+克纳普 3 nr
+克纳济 2 nr
+克绍箕裘 3 i
+克维勒 2 nrt
+克维勒奥 2 nrt
+克维奇 6 nr
+克维尔 2 nr
+克罗 22 nrt
+克罗伊 8 nrt
+克罗依 2 nr
+克罗克 14 nr
+克罗利 4 ns
+克罗同 2 nr
+克罗地亚 332 ns
+克罗地亚人 33 nz
+克罗地亚共和国 4 ns
+克罗地亚民主共同体 4 nt
+克罗地亚议会 2 nt
+克罗地亚语 12 nz
+克罗地亚队 4 nz
+克罗夫 3 nr
+克罗夫特 2 nrt
+克罗德 3 nrt
+克罗恩 13 nr
+克罗托夫 2 nrt
+克罗斯 18 nr
+克罗曼 2 nr
+克罗格 3 nrt
+克罗梅 2 nr
+克罗泽 8 nr
+克罗滋 3 nr
+克罗米 3 nrt
+克罗索 2 nr
+克罗索斯 2 nrt
+克罗蒂亚 3 nrt
+克罗诺 2 nr
+克罗诺斯 4 nrt
+克罗齐 7 nr
+克耳孙 9 nr
+克耳斯 5 nr
+克耳逊 2 nr
+克耶族 2 nr
+克耶邦 3 nr
+克肩一心 3 i
+克腊则 2 nr
+克腊见 2 nr
+克苦耐劳 3 i
+克药 3 nz
+克莉丝 3 nr
+克莉丝蒂 3 nr
+克莉斯 3 nr
+克莉斯蒂 2 nrt
+克莫斯 2 nrt
+克莱 17 nrt
+克莱佩 2 nr
+克莱儿 3 nr
+克莱克 5 nr
+克莱克斯 3 nrt
+克莱因 19 nrt
+克莱夫 5 nr
+克莱奥 3 nr
+克莱奥梅 3 nr
+克莱姆 12 nr
+克莱尔 22 nr
+克莱德 19 nr
+克莱德曼 3 nrt
+克莱德河 3 ns
+克莱恩 3 nr
+克莱斯 5 nr
+克莱斯勒 40 nrt
+克莱斯勒公司 9 nt
+克莱斯特 20 nrt
+克莱斯蒂尔 2 nrt
+克莱昂 3 nr
+克莱格 3 nr
+克莱森 2 nr
+克莱武 4 nr
+克莱特 4 nr
+克莱登 10 nr
+克莱罗 5 nr
+克莱蒙 8 nr
+克莱蒙费朗 2 nrt
+克莱门斯 2 nrt
+克莱门汀 2 nrt
+克莱门特 3 nrt
+克莱门茨 2 nrt
+克莱门蒂 2 nrt
+克莱顿 3 nr
+克莱默 4 nr
+克菲尔德 23 nrt
+克萨卡 2 nr
+克萨哥 6 nr
+克萨尔 3 nr
+克虏伯 98 nz
+克西 39 ns
+克西凉 2 nr
+克西宴 16 nr
+克西斯 5 nr
+克西曼 7 nr
+克诺索 6 nr
+克诺索斯 7 nrt
+克谯城 2 nr
+克豪森 4 nr
+克贝里 2 nrt
+克赖斯特彻奇 10 nrt
+克赛钦 9 nr
+克迪斯 7 nrt
+克逊 3 nrt
+克逮克容 3 v
+克郎 3 nr
+克郎棋 2 nr
+克郎球 3 nr
+克里 216 nrt
+克里亚 48 nrt
+克里什 2 nrt
+克里克 27 nrt
+克里城 16 nrt
+克里夫 9 nrt
+克里夫兰 3 nrt
+克里奥 3 nrt
+克里奥尔 5 nrt
+克里姆 27 nrt
+克里姆林 3 nrt
+克里姆林宫 86 nrt
+克里尔 5 nrt
+克里山 2 nr
+克里岛 3 nrt
+克里希 11 nrt
+克里希纳 2 nrt
+克里斯 94 nrt
+克里斯丹 3 nrt
+克里斯塔 5 nrt
+克里斯多 2 nrt
+克里斯多佛 2 nrt
+克里斯托 8 nrt
+克里斯托夫 12 nrt
+克里斯托弗 22 nrt
+克里斯滕森 2 nrt
+克里斯特尔 8 nrt
+克里斯琴 3 nrt
+克里斯蒂 27 nrt
+克里斯蒂亚尼 2 nrt
+克里斯蒂娜 3 nrt
+克里斯蒂安 10 nrt
+克里普 2 nrt
+克里普斯 4 nrt
+克里木 96 nr
+克里特 541 nrt
+克里特克 3 nrt
+克里特岛 178 nrt
+克里琴 4 nr
+克里米亚 39 nrt
+克里米亚半岛 19 ns
+克里纳 3 nrt
+克里莫夫 9 nrt
+克里蒙 4 nrt
+克里雅 5 nrt
+克里雅河 8 ns
+克里默 3 nr
+克钦人 3 nr
+克钦族 3 nr
+克钦邦 5 nr
+克隆 313 nr
+克隆人 8 nr
+克隆位点 3 n
+克隆变异 3 nr
+克隆扩充 3 n
+克隆技术 3 nr
+克隆版 3 nz
+克隆牛 6 nr
+克隆率 3 nr
+克隆病 3 nr
+克隆繁殖 3 n
+克隆缺失 3 n
+克隆羊 11 nr
+克隆选择 3 nr
+克难 3 nr
+克难街 3 nr
+克雅 3 nrt
+克雅氏症 3 nz
+克集庆 4 nr
+克雷伯 11 nr
+克雷夫 2 nr
+克雷尔 3 nr
+克雷布 3 nr
+克雷布斯 2 nrt
+克雷库 44 nr
+克雷斯 3 nr
+克雷斯波 5 nrt
+克雷格 6 nrt
+克雷森 2 nr
+克雷毕 2 nr
+克雷泰伊 3 nrt
+克雷洛夫 6 nrt
+克雷福德 8 nrt
+克雷芒 14 nr
+克雷莫纳 4 nrt
+克雷蒂安 9 nrt
+克雷蒙 4 nr
+克雷西 2 nr
+克霉唑 6 nz
+克霍斯特 2 nrt
+克须卢 16 nr
+克食 3 v
+克鲁人 3 nr
+克鲁伊夫 6 nrt
+克鲁伦 8 nr
+克鲁伦河 33 ns
+克鲁克斯 8 nrt
+克鲁兹 30 nr
+克鲁吉 8 nr
+克鲁奇 3 nr
+克鲁姆 3 nr
+克鲁尔 2 nr
+克鲁尼 3 nr
+克鲁斯 19 nr
+克鲁柏 2 nr
+克鲁格 21 nr
+克鲁格曼 2 nrt
+克鲁泡 8 nr
+克鲁玛 20 nr
+克鲁瓦 2 nr
+克鲁赛 2 nr
+克鲁马 2 nr
+克麦罗沃州 2 ns
+兌 20 zg
+免 1786 v
+免不了 366 v
+免不得 25 v
+免与 3 v
+免为其难 3 i
+免予 47 v
+免于 343 v
+免于一死 3 i
+免交 39 v
+免俗 11 n
+免修 4 v
+免冠 32 n
+免冠照 3 n
+免刑 6 v
+免却 11 v
+免去 245 v
+免受 160 v
+免复 3 v
+免官 3 n
+免定 3 v
+免开尊口 10 n
+免强 3 v
+免役 82 v
+免征 97 v
+免得 1031 v
+免怀之岁 3 l
+免息 31 v
+免息期 3 vn
+免战 2 v
+免战牌 11 nz
+免扰 3 v
+免报 3 v
+免抵退 3 l
+免持 3 v
+免掉 21 v
+免提 6 v
+免提通话 3 n
+免收 76 v
+免料 3 n
+免检 13 v
+免死状 3 n
+免水 2 v
+免洗 3 v
+免洗餐具 3 n
+免激活 3 n
+免烫 6 v
+免用 3 v
+免疫 1263 v
+免疫优势 3 n
+免疫佐剂 3 v
+免疫刺激 3 n
+免疫力 216 n
+免疫化学 3 n
+免疫印 3 n
+免疫原 3 n
+免疫原性 3 n
+免疫发光 3 n
+免疫吸附 3 n
+免疫固定 3 n
+免疫增强 3 n
+免疫学 95 n
+免疫学家 8 n
+免疫定位 3 n
+免疫性 75 n
+免疫扩散 3 n
+免疫抑制 3 n
+免疫抗体 3 n
+免疫放射 3 n
+免疫斑点 3 n
+免疫染色 3 n
+免疫检测 3 n
+免疫毒素 3 n
+免疫沉淀 3 vn
+免疫治疗 3 n
+免疫测定 3 n
+免疫电泳 3 n
+免疫病 3 n
+免疫病理 3 n
+免疫监视 3 n
+免疫科 6 n
+免疫筛选 3 vn
+免疫系统 3 n
+免疫组化 3 n
+免疫缺损 3 n
+免疫耐受 3 n
+免疫耗竭 3 n
+免疫能力 3 n
+免疫荧光 3 z
+免疫血清 3 n
+免疫诊断 3 n
+免疫调节 3 n
+免疫选择 3 n
+免疫针 5 n
+免疫预防 3 n
+免礼 17 v
+免票 15 n
+免票入场 3 n
+免租 10 v
+免税 147 v
+免税区 2 n
+免税单 3 n
+免税品 3 n
+免税商店 3 n
+免税店 23 n
+免税车 3 n
+免税额 2 n
+免签 8 v
+免纳 3 v
+免缴 6 v
+免罚 3 vn
+免罪 32 v
+免考 38 v
+免耕 22 v
+免职 175 v
+免蜡 3 v
+免订 3 v
+免证 3 v
+免诉权 3 n
+免试 99 vn
+免试生 3 v
+免课 3 v
+免调 3 v
+免谈 19 v
+免责 27 v
+免责权 3 n
+免贴 3 v
+免费 1810 vn
+免费中文 3 n
+免费书 3 n
+免费信箱 3 n
+免费入场 3 n
+免费刷 3 n
+免费动画 3 n
+免费参观 3 n
+免费发 3 n
+免费同志 3 n
+免费听 3 n
+免费大餐 3 n
+免费小说 3 n
+免费影视 3 n
+免费影院 3 n
+免费性 3 n
+免费成人 3 n
+免费手机 3 n
+免费打 3 n
+免费搭车 3 n
+免费模板 3 n
+免费漫画 3 n
+免费激情 3 n
+免费片 3 n
+免费版 3 n
+免费电 3 n
+免费电影 3 n
+免费相册 3 n
+免费网 3 n
+免费色 3 n
+免费视听 3 n
+免费视频 3 n
+免费论文 3 n
+免费资源 3 n
+免费赠品 3 n
+免费软件 3 n
+免费送 3 v
+免费邮件 3 n
+免费邮箱 3 n
+免费音乐 3 n
+免费餐 4 n
+免蹈覆辙 3 i
+免进 3 v
+免遭 158 v
+免遭物议 3 nz
+免除 403 v
+免除混乱 3 i
+免验 3 vn
+免验证 3 n
+免骚扰 3 l
+兏 37 zg
+児 8 zg
+兑 1295 v
+兑付 54 v
+兑制 3 v
+兑卦 3 v
+兑取 8 v
+兑坊 3 n
+兑奖 15 v
+兑帐 3 v
+兑换 1409 v
+兑换券 13 n
+兑换处 3 n
+兑换率 13 n
+兑款 3 v
+兑现 259 v
+兑端 3 n
+兑领 3 v
+兒 23 zg
+兓 5 zg
+兔 683 n
+兔丝燕麦 3 n
+兔仔 3 n
+兔儿 3 n
+兔儿爷 13 n
+兔八哥 3 n
+兔唇 6 n
+兔头麞脑 3 nz
+兔女郎 3 n
+兔妹妹 3 n
+兔娃 86 n
+兔子 343 n
+兔子不吃窝边草 5 l
+兔崽子 40 n
+兔年 3 n
+兔形目 5 n
+兔死凫举 3 vn
+兔死狐悲 18 i
+兔死狗烹 15 i
+兔毛 14 n
+兔毫 28 n
+兔皮 6 n
+兔肉 36 n
+兔脚 3 n
+兔脣 3 t
+兔脱 3 nz
+兔葵燕麦 3 v
+兔角牛翼 3 i
+兔角龟毛 3 n
+兔走乌飞 3 i
+兔走鹘落 3 i
+兔起乌沉 3 i
+兔起凫举 3 vn
+兔起鹘落 33 i
+兕 18 g
+兖 123 ns
+兖州 156 ns
+兖州县 3 ns
+兖州市 6 ns
+兖州煤业 23 nz
+兖矿 3 nz
+兗 6 zg
+兘 1063 zg
+党 23403 n
+党专政 26 j
+党世英 4 nr
+党世隆 3 nr
+党世雄 10 nr
+党中央 2737 nt
+党义 3 n
+党争 3 nz
+党云飞 4 nr
+党人 219 n
+党代会 25 nt
+党代表 127 n
+党代表大会 13 nz
+党八股 57 n
+党内 1315 s
+党内人士 3 n
+党内外 167 s
+党内斗争 3 nz
+党军 3 nt
+党刊 21 n
+党办 2 nt
+党务 123 n
+党务工作 3 n
+党卫 2 n
+党卫军 59 nt
+党卫队 3 nt
+党参 19 n
+党友 3 n
+党史 59 n
+党同伐异 22 nz
+党同妒异 3 i
+党名 3 n
+党员 1873 n
+党员个人 3 n
+党员大会 3 nt
+党员干部 3 n
+党员意识 3 n
+党员秤 3 n
+党员素质 3 n
+党员证 3 j
+党员队伍 3 n
+党和人民 3 n
+党和国家 3 nz
+党和政府 3 nt
+党团 101 n
+党团员 5 n
+党团活动 3 n
+党团组织 3 nt
+党国 48 n
+党国元老 3 nr
+党坚势盛 3 nr
+党外 138 s
+党外人士 43 n
+党委 1656 j
+党委书记 352 n
+党委会 37 nt
+党委制 3 j
+党委办 5 j
+党委委员 3 n
+党委政府 3 nt
+党孙文 2 nr
+党守素 4 nr
+党宋伯 2 nr
+党小组 10 j
+党小组长 3 j
+党工 3 n
+党工委 5 nt
+党建 141 j
+党建网 3 nz
+党建读物出版社 17 nt
+党徒 27 n
+党御史 4 n
+党徽 5 nz
+党心 2 n
+党性 150 n
+党性修养 3 n
+党性原则 3 n
+党总支 34 n
+党总支部 2 n
+党恶佑奸 3 v
+党执政 3 nr
+党报 87 n
+党支书 13 n
+党支部 298 j
+党政 668 n
+党政不分 3 l
+党政军 337 nt
+党政军民 9 n
+党政办 2 nt
+党政工 4 nt
+党政干部 3 n
+党政机关 160 nt
+党政纪 2 n
+党政群 3 n
+党政部门 11 n
+党政领导 3 n
+党旗 27 n
+党晋阳 3 nr
+党权 2 n
+党李璜 2 nr
+党校 189 n
+党格 3 n
+党棍 3 n
+党歌 3 n
+党河 17 nz
+党法 20 n
+党派 659 n
+党甘亭 2 nr
+党的基本 3 l
+党的建设 3 l
+党的性质 3 l
+党的政策 3 n
+党的方针 3 n
+党的纪律 3 n
+党的纲领 3 n
+党的路线 3 l
+党的领导 3 n
+党票 3 n
+党祸 3 n
+党禁 8 n
+党立委 2 nt
+党章 288 n
+党籍 219 n
+党纪 43 n
+党纪国法 29 nz
+党纪处分 3 l
+党纪政纪 7 n
+党纲 59 nr
+党组 580 n
+党组书记 3 n
+党组会 3 nt
+党组织 694 nt
+党群 25 n
+党群关系 11 l
+党群干群 3 nr
+党羽 163 nr
+党职 3 n
+党营 3 n
+党规 22 n
+党言 3 n
+党证 3 j
+党课 13 n
+党豺为虐 3 i
+党费 13 n
+党邪丑正 3 i
+党邪陷正 3 i
+党部 119 n
+党锢 25 n
+党阀 3 n
+党际 6 n
+党鞭 3 n
+党项 155 n
+党项族 27 nz
+党顾秉 3 nr
+党风 340 n
+党风不正 3 i
+党风好转 3 i
+党风廉政 3 nr
+党风建设 3 l
+党首 9 n
+党魁 34 n
+党魂 3 n
+党龄 23 n
+兜 1081 v
+兜住 3 v
+兜儿 12 n
+兜兜 21 n
+兜兜裤儿 3 n
+兜兜风 3 n
+兜兰 3 n
+兜剿 3 v
+兜售 60 v
+兜圈 10 n
+兜圈子 110 n
+兜头盖脸 3 n
+兜子 16 n
+兜帽 3 n
+兜底 16 s
+兜抄 3 v
+兜捕 3 v
+兜揽 18 v
+兜揽生意 3 v
+兜游 3 n
+兜率 3 n
+兜率天 3 n
+兜生意 3 n
+兜着走 3 v
+兜翻 3 v
+兜老底 3 n
+兜肚 10 v
+兜肚连肠 3 n
+兜里 109 s
+兜鍪 27 n
+兜销 3 v
+兜风 20 n
+兠 8 zg
+兢 106 i
+兢兢业业 117 i
+兢兢乾乾 3 i
+兢兢干干 3 i
+兢兢战战 3 i
+兢兢翼翼 3 i
+入 20209 v
+入不敷出 53 i
+入不敷支 3 i
+入世 146 nrt
+入世未深 3 i
+入主 301 v
+入主中原 3 ns
+入主出奴 3 n
+入乡问俗 3 i
+入乡随乡 3 i
+入乡随俗 40 i
+入云龙 3 ns
+入井望天 3 i
+入产 3 v
+入仓 2 v
+入仕 62 v
+入伍 269 v
+入伍通知 3 n
+入伍须知 3 n
+入伏 16 v
+入伙 96 v
+入会 59 v
+入会者 7 n
+入会费 14 n
+入住 195 v
+入住率 22 n
+入侵 2027 v
+入侵者 134 n
+入党 258 n
+入关 345 v
+入册 3 v
+入冬 64 v
+入出 2 v
+入出境 7 n
+入列 3 v
+入厕 3 n
+入原 2 ns
+入厨 3 v
+入口 704 ns
+入口关 3 ns
+入口处 153 i
+入口税 3 n
+入口站 3 n
+入口通道 3 i
+入吾彀中 3 vn
+入味 21 v
+入团 16 n
+入园率 4 n
+入围 122 v
+入围奖 2 n
+入围者 11 n
+入国问俗 3 i
+入国问禁 3 i
+入土 237 v
+入土为安 29 i
+入圣超凡 3 ns
+入地无门 16 i
+入场 182 n
+入场券 110 n
+入场式 3 n
+入场证 3 v
+入场费 3 v
+入坞 3 ns
+入城 3 ns
+入城式 12 n
+入境 721 n
+入境处 3 v
+入境手续 3 i
+入境案 3 n
+入境游 3 n
+入境签证 3 n
+入境者 75 n
+入境证 3 v
+入境问俗 3 i
+入境问禁 3 i
+入境随俗 3 i
+入声 22 v
+入夏 19 ns
+入夜 112 v
+入夜后 3 i
+入套 3 n
+入孝出弟 3 i
+入学 732 n
+入学年龄 3 n
+入学率 835 n
+入学考试 3 n
+入定 50 v
+入室 51 n
+入室升堂 3 n
+入室弟子 6 n
+入室操戈 3 i
+入室昇堂 3 n
+入寇 3 nrt
+入寐 3 v
+入射 3 v
+入射光 3 n
+入射光瞳 3 v
+入射波 3 n
+入射点 4 n
+入射窗 3 n
+入射线 7 n
+入射角 31 n
+入川 369 ns
+入市 701 ns
+入帐 3 v
+入席 71 v
+入幕之宾 2 n
+入库 334 n
+入店 3 ns
+入座 100 v
+入役 3 v
+入微 43 v
+入怀 3 v
+入情入理 22 i
+入户 32 n
+入户门 3 ns
+入手 487 v
+入托 24 v
+入教 3 v
+入文出武 3 i
+入时 37 ns
+入春 12 ns
+入暮 3 n
+入木三分 19 l
+入村 3 ns
+入校 66 n
+入档 3 v
+入梅 4 ns
+入梦 25 v
+入棺 3 v
+入款 3 v
+入死出生 3 i
+入殓 47 v
+入气室 3 n
+入水 3 v
+入水管 3 n
+入法 12 v
+入流 14 v
+入海 441 ns
+入海口 75 ns
+入海处 21 i
+入海流 3 ns
+入海算沙 3 n
+入海量 2 n
+入渗 9 v
+入港 29 ns
+入港税 3 n
+入火赴汤 3 i
+入炉 24 v
+入狱 246 v
+入球 76 n
+入球数 3 n
+入理 3 v
+入理切情 3 n
+入画 44 v
+入监 3 n
+入盟 11 ns
+入直 3 v
+入眠 20 v
+入眼 38 v
+入睡 415 v
+入社 3 n
+入神 33 n
+入禀 3 v
+入秋 21 n
+入窖 3 n
+入竟问禁 3 i
+入籍 149 n
+入级检验 3 n
+入编 3 v
+入网 102 v
+入网费 5 n
+入耳 128 v
+入耳式 3 n
+入股 179 v
+入药 127 v
+入营 3 v
+入行 3 v
+入贡 3 ns
+入账 51 v
+入货 3 n
+入赘 37 v
+入超 50 v
+入超国 3 ns
+入轨 22 v
+入迷 27 v
+入选 490 v
+入选为 3 n
+入选国 3 n
+入选者 5 n
+入道 3 v
+入邦问俗 3 i
+入邪 3 v
+入铁主簿 3 n
+入锅 3 v
+入门 312 ns
+入门教程 3 l
+入门篇 3 n
+入门级 3 l
+入门者 2 n
+入门费 4 n
+入门问讳 3 i
+入闱 5 v
+入阁 214 ns
+入阁登坛 3 ns
+入队 13 n
+入院 50 n
+入静 3 v
+入驻 56 v
+入骨 82 n
+入骨相思 3 i
+入魔 38 n
+內 34 zg
+全 22165 a
+全三册 3 m
+全三卷 3 m
+全下 3 m
+全世界 2721 n
+全中文 3 nr
+全义 6 n
+全义忧 3 nz
+全义降 3 nr
+全乌力 6 nr
+全乎 3 d
+全乡 43 n
+全书 943 n
+全人 9 n
+全人类 31 n
+全价 33 n
+全份 3 n
+全休 3 nr
+全优 12 b
+全会 1101 n
+全会精神 3 n
+全传 20 n
+全体 5382 n
+全体一致 3 d
+全体人员 3 n
+全体会议 3 n
+全体出席 3 n
+全体利益 3 n
+全体同仁 3 i
+全体同学 3 nt
+全体学生 3 n
+全体官兵 3 n
+全体师生 3 n
+全体干警 3 n
+全体成员 3 n
+全信 3 nt
+全值 3 n
+全像 3 n
+全光烈 3 nr
+全免 2 d
+全免费 3 n
+全党 1747 n
+全党全军 3 nt
+全党全国 3 nt
+全党同志 3 n
+全党外 3 n
+全公社 9 nt
+全兴 50 b
+全兴队 3 nt
+全兵团 2 n
+全其节 2 n
+全内置 3 n
+全军 1345 n
+全军尽墨 3 i
+全军覆没 287 i
+全军覆灭 38 i
+全冠 4 n
+全冠清 128 nr
+全减器 3 n
+全凭 2 n
+全分音符 3 n
+全剧 61 n
+全副 99 m
+全副武装 230 n
+全副精力 3 i
+全力 1161 n
+全力以赴 196 i
+全力支持 3 n
+全功尽弃 4 i
+全功略 3 n
+全功能 3 n
+全加器 3 n
+全劳动力 3 l
+全勋 3 n
+全勤 12 n
+全勤奖 3 nz
+全勤奖金 3 n
+全包价 3 n
+全北界 3 n
+全区 450 n
+全华班 2 n
+全南 5 nt
+全南县 3 ns
+全卷 2 m
+全厂 77 n
+全厚瓣 3 n
+全县 893 n
+全双工 2 nr
+全双水 5 nr
+全反射 31 l
+全受全归 3 i
+全口义齿 3 n
+全台 3 n
+全同粒子 3 n
+全名 71 m
+全名单 3 n
+全名是 3 n
+全向 3 n
+全向天线 3 n
+全员 83 n
+全员化 3 n
+全员承包 3 n
+全员聘用 3 n
+全周 3 m
+全唐文 14 nz
+全唐诗 43 nr
+全四册 3 m
+全四卷 3 m
+全因 3 n
+全团 65 n
+全园 5 n
+全固态 3 n
+全国 48874 n
+全国一盘棋 3 l
+全国三八红旗手 3 nt
+全国上下 3 l
+全国五一劳动奖章 5 l
+全国人大 5551 nt
+全国人大外事委员会 2 nt
+全国人大常务委员会 14 nt
+全国人大常委会 6930 nt
+全国人大常委会办公厅 2 nt
+全国人大常委会法制工作委员会 12 nt
+全国人大常委会法工委 2 nt
+全国人大教科文卫委员会 4 nt
+全国人大民委 2 nt
+全国人大民族委员会 2 nt
+全国人大法律委员会 11 nt
+全国人民代表大会 10505 nt
+全国人民代表大会常务委员会 5988 nt
+全国代表大会 655 nt
+全国会计 3 l
+全国侨联 11 nt
+全国假日办 41 nt
+全国假日旅游部际协调会议办公室 13 nt
+全国公安 3 nt
+全国农业展览馆 4 n
+全国冠军 3 nr
+全国劳模 3 l
+全国十佳 3 nz
+全国台联 7 nt
+全国同胞 3 n
+全国妇联 83 nt
+全国学联 29 nt
+全国工会 5 nt
+全国工商联 35 nt
+全国性 826 n
+全国总工会 61 nt
+全国政协 1500 nt
+全国政协外事委员会 16 nt
+全国政协文史资料委员会 4 nt
+全国政治协商会议 4 nt
+全国文联 8 nt
+全国爱卫会 3 nt
+全国电信用户委员会 3 n
+全国科学大会 7 nt
+全国科学大会奖 41 nz
+全国纪录 3 n
+全国考委 27 nt
+全国联网 3 nt
+全国自考办 3 nt
+全国记录 3 nz
+全国运动会 28 nz
+全国青年联合会 2 nt
+全国青联 15 nt
+全国高校 3 nt
+全国高等教育自学考试指导委员会 15 nt
+全场 627 n
+全场欢呼 3 n
+全垒打 3 n
+全城 595 n
+全域 3 n
+全堂影 2 n
+全塞 2 n
+全境 1460 n
+全备 17 n
+全外置 3 n
+全天 289 m
+全天候 247 n
+全天性 3 n
+全天然 3 b
+全套 193 m
+全套教材 3 n
+全套设备 3 n
+全始全终 5 i
+全委 5 n
+全委会 7 nt
+全宁路 2 n
+全宇宙 3 nr
+全宋词 3 nr
+全宗 24 m
+全家 863 n
+全家乐 3 nr
+全家人 194 n
+全家电 3 n
+全家福 273 nr
+全家老小 3 n
+全密封 3 nr
+全对数 3 n
+全寺 2 n
+全寺僧 4 nr
+全封闭 87 b
+全封闭式 18 n
+全局 724 n
+全局变量 3 n
+全局性 82 n
+全局知识 3 n
+全局观念 3 n
+全屏 3 n
+全屏幕 3 nr
+全屏播放 3 i
+全属 62 n
+全山 4 n
+全岛 255 n
+全川 4 n
+全州 366 n
+全州县 3 ns
+全市 7178 n
+全市性 4 n
+全师 14 n
+全师东 3 nr
+全师官兵 3 nr
+全席 4 n
+全干扰 3 l
+全年 3302 m
+全年候 3 n
+全年收入 3 n
+全年雨量 3 n
+全年龄 3 n
+全庄 2 n
+全序 2 n
+全序集 2 n
+全度妍 3 nr
+全延津 2 nr
+全开 14 ad
+全异 3 n
+全弹 26 n
+全强盗 3 n
+全归 3 n
+全当 3 d
+全形 12 n
+全彩 6 n
+全彩夜 2 n
+全彩屏 3 nr
+全律 2 n
+全德 18 n
+全心 4 n
+全心全意 384 i
+全心投入 3 i
+全忠全 2 nr
+全总 31 n
+全息 104 n
+全息图 18 n
+全息术 3 n
+全息照相 13 n
+全息疗法 3 n
+全恶 16 n
+全愈 2 d
+全意 3 n
+全慧彬 3 i
+全或无 3 l
+全所 3 n
+全所同仁 3 i
+全手动 3 nz
+全手工 3 n
+全才 18 n
+全托 7 n
+全押 2 vn
+全拼 3 n
+全拼形 3 n
+全接触 3 n
+全推 3 b
+全揭密 3 i
+全收录 3 n
+全攻 3 vn
+全攻全守 8 i
+全攻略 3 n
+全散 3 n
+全数 122 n
+全文 599 n
+全文如下 3 l
+全文完 3 nr
+全文检索 2 n
+全文索引 3 nr
+全文逛逛 3 v
+全斗焕 13 nr
+全新 900 d
+全方位 463 m
+全方向 6 n
+全族 6 n
+全无喜 2 i
+全无奇 2 i
+全无心肝 8 i
+全无是处 3 l
+全日 55 m
+全日制 168 nz
+全日空 6 nz
+全明星 3 nr
+全明星赛 3 n
+全是真话 3 l
+全晋 4 n
+全景 251 n
+全景图 3 nr
+全景式 15 n
+全景电影 3 n
+全景网 3 n
+全景网络 3 n
+全智全 2 nr
+全智全能 3 n
+全智能 3 n
+全智贤 4 nr
+全曲 2 n
+全月 3 m
+全木质 3 n
+全未 2 d
+全本 18 n
+全机 2 n
+全权 415 n
+全权代表 597 n
+全权处理 3 n
+全权大使 3 n
+全权负责 3 l
+全材 3 n
+全村 260 n
+全村人 65 n
+全林远 5 nr
+全枪 2 n
+全校 225 n
+全校同学 3 nt
+全校学生 3 n
+全校师生 3 nr
+全株含 2 nr
+全根 3 m
+全案 3 n
+全椒 8 n
+全椒县 3 n
+全欧 2 n
+全款 3 n
+全武将 3 n
+全歼 230 v
+全段 5 n
+全毛 5 n
+全毛料 3 n
+全民 1326 n
+全民企业 3 n
+全民公决 32 l
+全民动手 3 n
+全民忌惮 3 i
+全民性 10 n
+全民所有 3 i
+全民投票 3 n
+全民政治 3 n
+全民教育 3 l
+全民皆兵 3 i
+全民运动 3 nz
+全气密 2 n
+全氟 2 n
+全水栖 2 nr
+全河 4 n
+全洲 45 n
+全流通 3 n
+全消 3 v
+全液压 3 n
+全淹 2 n
+全港 34 n
+全湿 2 n
+全灵 2 n
+全然 895 ad
+全然不同 3 i
+全然不知 3 i
+全然不觉 3 i
+全然不解 3 l
+全然不顾 3 i
+全片 12 n
+全班 151 n
+全班人马 3 nz
+全班同学 3 nt
+全班学生 3 n
+全球 5288 n
+全球中文 3 nz
+全球化 760 n
+全球华人 3 n
+全球华语 3 nz
+全球卫星 3 nz
+全球呼 3 n
+全球商务 3 n
+全球定位系统 48 n
+全球性 306 n
+全球战略 3 n
+全球排名 3 n
+全球电信 3 nz
+全球网 2 n
+全球股市 3 n
+全球通 232 n
+全璧归赵 3 i
+全生育期 3 n
+全由 3 n
+全留 3 nr
+全疆 2 n
+全盔 3 n
+全盘 278 n
+全盘否定 3 l
+全盘性 5 n
+全盘托出 4 n
+全盘接受 3 i
+全盘皆活 3 i
+全盘皆输 3 i
+全盘考虑 3 n
+全盘西化 3 n
+全盛 128 nz
+全盛时代 8 l
+全盛时期 3 nz
+全盛期 8 n
+全盟 9 n
+全相平 4 nr
+全省 12895 n
+全省各地 3 l
+全真 227 ad
+全真众 2 n
+全真剑 51 nr
+全真教 3 nz
+全真群 3 nr
+全真诸 11 nr
+全真道 66 n
+全真道人 20 n
+全真道士 7 n
+全真高 2 nr
+全瞎 3 n
+全知全能 13 n
+全石梯 2 n
+全矿 3 n
+全码 3 n
+全社 15 n
+全祖望 6 nr
+全神 6 n
+全神倾注 3 i
+全神关注 3 l
+全神贯注 259 i
+全票 20 n
+全票价 3 n
+全福 26 nz
+全科 64 n
+全科医师 5 nt
+全称 612 n
+全程 361 n
+全程化 4 n
+全程参加 3 n
+全程无 3 b
+全稿 3 n
+全空间 3 n
+全立交 7 n
+全站 9 n
+全站仪 3 n
+全等变换 3 l
+全等号 3 n
+全等形 3 n
+全篇 62 m
+全篇文章 3 n
+全系列 3 m
+全纪录 3 n
+全纯包 3 n
+全线 477 n
+全线产品 3 n
+全线作战 3 n
+全线出击 3 i
+全线崩溃 3 i
+全线贯通 3 n
+全线进攻 3 nr
+全线通车 3 n
+全组 3 n
+全细胞式 3 n
+全网 25 n
+全罗 9 nz
+全罗北道 2 n
+全罗斯 2 nr
+全罗道 6 nr
+全羊 34 n
+全羊宴 4 n
+全羊席 4 n
+全美 150 nz
+全美达 3 nr
+全羽领 2 nr
+全考 3 n
+全耗 2 n
+全职 70 n
+全职太太 4 n
+全聚德 44 nr
+全聚德烤鸭店 8 ns
+全胜 154 n
+全胜记录 3 n
+全能 209 n
+全能全智 3 n
+全能冠军 3 nr
+全能化 2 n
+全能型 7 n
+全能性 17 n
+全能王 3 nr
+全能运动 10 nz
+全脂 5 n
+全脂奶粉 3 n
+全脱产 3 n
+全脱机 3 n
+全自动 91 nz
+全般 7 d
+全般支援 3 i
+全舰 16 n
+全舰舰 2 nt
+全舵主 10 n
+全艇 3 n
+全色 4 n
+全色片 3 n
+全色盲者 3 n
+全苗 3 n
+全英文 6 nr
+全英班 4 m
+全草 2 n
+全营 101 n
+全蚀 3 nz
+全蝎 10 n
+全行 27 n
+全衡 3 n
+全裸 3 i
+全裸体 3 i
+全裸图 3 i
+全裸照 3 i
+全要 3 b
+全观道 2 n
+全角 3 n
+全角字 3 n
+全训 3 n
+全记录 3 n
+全译本 15 n
+全象骨 2 n
+全豹 3 n
+全貌 57 n
+全责 12 n
+全资 69 n
+全距 4 n
+全距离 3 n
+全路 17 n
+全身 3714 n
+全身上下 3 i
+全身像 7 n
+全身心 86 n
+全身性 81 n
+全身检查 3 n
+全身而退 3 i
+全身远害 3 i
+全车 3 n
+全输 3 vn
+全过程 254 n
+全运会 55 nz
+全选 3 n
+全透明 3 n
+全通网络 3 n
+全逝去 3 z
+全速 66 ad
+全速前进 3 i
+全速行进 3 nz
+全速进行 3 n
+全邦 400 n
+全邦其 16 nr
+全邦民 16 nr
+全邦诸 16 nr
+全郡马 3 nr
+全部 11398 n
+全部一包 2 m
+全部一次 11 m
+全部九十名 16 m
+全部内容 3 n
+全部列 2 m
+全部包 10 m
+全部四个 2 m
+全部堆 2 m
+全部堵 2 m
+全部处 6 m
+全部封 7 m
+全部开 6 m
+全部打 23 m
+全部折 2 m
+全部排 2 m
+全部摊 5 m
+全部整 2 m
+全部歌手 3 l
+全部歌曲 3 n
+全部百 2 m
+全部种 5 m
+全部记 5 n
+全部轮 2 m
+全部载 2 m
+全部遭 2 m
+全部都是 3 n
+全部重 3 m
+全部顶 2 m
+全都 2068 n
+全都会 3 nt
+全酶 3 n
+全重 3 n
+全量表 2 n
+全金发 62 nz
+全金属 3 n
+全金诗 4 n
+全钢 6 n
+全钾 3 n
+全错 3 n
+全镇 70 n
+全长 1950 n
+全长约 3 n
+全队 301 n
+全防 3 n
+全院 61 n
+全院干警 3 n
+全险 3 n
+全集 320 n
+全面 9321 n
+全面完成 3 l
+全面实施 3 n
+全面实现 3 i
+全面性 39 n
+全面战争 3 nz
+全面推广 3 nz
+全面推行 3 n
+全面提高 3 n
+全面禁止 3 l
+全面继承 3 i
+全面落实 3 i
+全面规划 3 n
+全面解决 3 i
+全面进步 3 n
+全面铺开 3 l
+全音 8 n
+全音符 6 n
+全项 3 m
+全顺 25 nz
+全频 3 n
+全频段 3 n
+全额 138 n
+全额奖金 3 n
+全食 10 n
+全馆 10 n
+全高清 4 nr
+全麦 17 n
+全麻 3 n
+全黑 6 n
+兩 15 zg
+八 7422 m
+八一 655 m
+八一七路 3 m
+八一女排 4 j
+八一建军节 4 l
+八一湖 2 l
+八一电影制片厂 14 nt
+八一男篮 8 nz
+八一起义纪念馆 2 nz
+八一镇 5 j
+八一队 82 m
+八七 364 m
+八七年 3 m
+八七水灾 3 i
+八万 61 m
+八万三千 2 m
+八万两 13 m
+八万个 6 m
+八万九千元 3 m
+八万五 4 m
+八万五千 2 m
+八万余 14 m
+八万元 3 m
+八万名 5 m
+八万四千 4 m
+八万四千条 4 m
+八万四千里 3 m
+八万块 4 m
+八万多 2 m
+八万多倍 2 m
+八万斤 256 m
+八万里 4 m
+八丈 11 m
+八三 6 m
+八三年 2 m
+八下 21 m
+八世 3 t
+八世纪 3 t
+八两 29 m
+八个 1299 m
+八中 309 t
+八中全会 3 j
+八九 80 m
+八九七十二 4 m
+八九万 4 m
+八九丈 9 m
+八九不离十 33 i
+八九两 2 m
+八九个 61 m
+八九位 2 m
+八九出 2 m
+八九分 47 m
+八九十 18 m
+八九十个 4 m
+八九十名 2 m
+八九十岁 2 m
+八九十年 3 m
+八九十斤 2 m
+八九十里 2 m
+八九千 10 m
+八九口 2 m
+八九名 4 m
+八九块 2 m
+八九天 7 m
+八九岁 32 m
+八九年 26 m
+八九成 27 m
+八九招 2 m
+八九斤 4 m
+八九日 4 m
+八九月 7 m
+八九月份 5 nz
+八九枚 3 m
+八九步 2 m
+八九点 20 m
+八九点钟 2 m
+八九百 2 m
+八九百个 3 m
+八九百元 4 m
+八九米 2 m
+八九级 2 m
+八九里 7 m
+八九间 2 m
+八乡 5 n
+八二三 2 m
+八五 370 m
+八五一 2 m
+八五八 4 m
+八五年 4 m
+八五折 3 m
+八五期间 3 t
+八五规划 3 l
+八五计划 3 n
+八亩 5 m
+八亿 14 m
+八亿美元 2 m
+八仙 141 n
+八仙桌 114 n
+八仙洞 3 n
+八仙花 5 n
+八仙过海 33 nz
+八仙过海各显神通 3 l
+八代 34 t
+八件 18 m
+八份 2 m
+八会穴 3 n
+八位 63 m
+八位位组 3 n
+八位字节 3 n
+八位数 3 n
+八佰伴 16 nz
+八倍 8 m
+八元 9 m
+八克 2 m
+八八 13 m
+八八九九 4 m
+八八八八八 4 m
+八八六十四 8 m
+八八六十四个 2 m
+八八六十四招 3 m
+八八六十四队 2 m
+八八年 3 m
+八公山上 2 l
+八公山区 3 nt
+八公里 6 m
+八六三计划 34 nz
+八关 3 n
+八具 3 n
+八册 5 m
+八刀 5 m
+八分 106 m
+八分九裂 3 i
+八分斋 3 n
+八分熟 3 l
+八分钟 5 m
+八分音符 2 n
+八分饱 3 n
+八列 2 m
+八则 3 n
+八副 2 m
+八包 3 m
+八匹 27 m
+八区 3 n
+八十 157 m
+八十一 33 m
+八十一个 5 m
+八十一分 2 m
+八十一只 17 m
+八十一名 2 m
+八十一岁 6 m
+八十一招 3 m
+八十一斤 6 m
+八十一日 2 m
+八十一笔 2 m
+八十一路 4 m
+八十一门 2 m
+八十七 11 m
+八十七处 2 m
+八十七年 2 m
+八十万 38 m
+八十万两 13 m
+八十万人次 2 m
+八十万元 3 m
+八十万镑 2 m
+八十三 6 m
+八十三万 7 m
+八十三任 2 m
+八十三岁 4 m
+八十两 9 m
+八十个 13 m
+八十九 8 m
+八十九年 2 m
+八十九条 2 m
+八十九篇 2 m
+八十二 6 m
+八十二卷 2 m
+八十二斤 2 m
+八十二首 2 m
+八十五 5 m
+八十五万英镑 2 m
+八十五号 2 m
+八十五天 6 m
+八十五岁 12 m
+八十五篇 3 m
+八十亩 2 m
+八十余 5 m
+八十余万 7 m
+八十余口 3 m
+八十余年 5 m
+八十余里 2 m
+八十八 14 m
+八十八万 2 m
+八十八味 2 m
+八十八年 3 m
+八十公斤 2 m
+八十六 6 m
+八十六年 2 m
+八十六所 2 m
+八十匹 3 m
+八十卷 8 m
+八十名 3 m
+八十周年 19 m
+八十四 14 m
+八十四位 2 m
+八十四岁 4 m
+八十四篇 2 m
+八十回 8 m
+八十块 3 m
+八十多 2 m
+八十多个 7 m
+八十多亩 2 m
+八十多件 2 m
+八十多岁 22 m
+八十多年 5 m
+八十多条 2 m
+八十多种 2 m
+八十多里 2 m
+八十天 3 m
+八十岁 59 m
+八十年 171 m
+八十年代 294 m
+八十度 2 m
+八十斤 11 m
+八十次 5 m
+八十步 2 m
+八十点 2 m
+八十米 3 m
+八十道 8 m
+八十里 24 m
+八十锭 3 m
+八十顷 2 m
+八十颗 2 m
+八千 86 m
+八千一百一十二尺 2 m
+八千一百三十七万七千二百三十六口 2 m
+八千一百八十户 2 m
+八千七百五十万元 2 m
+八千七百户 3 m
+八千万 10 m
+八千万口 2 m
+八千万法郎 2 m
+八千两 5 m
+八千九百万两 2 m
+八千二百八十二公里 2 m
+八千五百二十四万元 2 m
+八千余 6 m
+八千余家 2 m
+八千余户 2 m
+八千余种 3 m
+八千元 3 m
+八千八百万 2 m
+八千卷 7 m
+八千名 2 m
+八千多 2 m
+八千多元 2 m
+八千多名 2 m
+八千多平方公里 2 m
+八千户 3 m
+八千根 2 m
+八千里 16 m
+八千零九十三处 2 m
+八卦 703 n
+八卦丹 3 ns
+八卦刀 62 n
+八卦图 13 n
+八卦山 3 ns
+八卦岭 3 ns
+八卦拳 2 n
+八卦掌 57 n
+八卦教 13 n
+八卦新闻 3 n
+八卦楼 2 n
+八卦阵 40 n
+八卷 35 m
+八厂 3 n
+八厘麻 3 n
+八发 4 j
+八叠 3 m
+八口 17 m
+八句 40 m
+八只 57 m
+八台 6 m
+八号 19 n
+八号分机 3 n
+八名 228 m
+八员 37 n
+八周 3 t
+八周年 3 m
+八味 6 n
+八品 33 n
+八响 3 m
+八哥 195 n
+八哥儿 3 n
+八喜 3 n
+八嘎 2 ns
+八回 3 m
+八团 9 n
+八国 3 ns
+八国联军 1623 nt
+八国集团 5 nt
+八圈 3 m
+八场 5 n
+八块 54 m
+八块钱 3 n
+八堵 4 m
+八声 3 m
+八处 13 m
+八夜 3 t
+八大 506 j
+八大关 2 ns
+八大处 13 m
+八大山人 6 nz
+八大胡同 3 l
+八大菜系 3 n
+八天 72 t
+八头 4 n
+八套 13 m
+八字 267 n
+八字墙 2 n
+八字宪法 3 n
+八字打开 3 l
+八字桥 2 n
+八字步 15 n
+八字没一撇 3 l
+八字眉 4 n
+八字胡 3 n
+八字脚 6 n
+八字贴 3 n
+八字贴儿 3 n
+八季 3 t
+八宝 303 nz
+八宝山 25 ns
+八宝山革命公墓 7 n
+八宝箱 3 n
+八宝粥 5 n
+八宝菜 3 n
+八宝饭 4 n
+八客 3 n
+八家 57 m
+八家子 2 n
+八宿 3 n
+八宿县 2 ns
+八寸 30 m
+八封 11 m
+八尊 2 m
+八小时 3 j
+八尺 78 m
+八尾 3 m
+八局 5 n
+八层 17 m
+八层楼 3 n
+八届 391 m
+八届人大常委会 2 nt
+八届全国人大 19 nt
+八届全国人大常委会 22 nt
+八届全国政协 3 nt
+八岁 112 m
+八岁时 3 n
+八带鱼 3 n
+八席 3 n
+八幅 10 n
+八幡 15 n
+八平柴 3 nz
+八年 2991 t
+八年级 3 b
+八床 2 n
+八府巡按 2 i
+八度 105 n
+八座 19 m
+八廓街 4 ns
+八开 8 m
+八开本 3 l
+八式 10 n
+八张 16 m
+八强 3 n
+八强战 3 nz
+八强赛 3 n
+八德 4 t
+八思巴 3 n
+八成 260 m
+八成新 3 nz
+八戒 1686 n
+八截 3 m
+八户 8 m
+八所 23 j
+八扇 3 m
+八手 9 m
+八打 12 m
+八把 5 m
+八折 17 m
+八抬大轿 13 l
+八担 6 m
+八拐 5 j
+八招 19 m
+八拜 3 ns
+八拜之交 21 i
+八拳 3 m
+八拿马 3 ns
+八掌溪 3 n
+八支 12 m
+八斗 9 m
+八斗之才 3 l
+八斗子 3 n
+八斗才 3 n
+八斤 12 m
+八斤重 3 i
+八方 112 n
+八方之外 3 l
+八方呼应 3 l
+八方客 3 n
+八方支持 3 n
+八方支援 10 i
+八方来客 5 n
+八方资源 3 n
+八方风雨 3 l
+八旗 619 n
+八旗子弟 31 n
+八日 128 t
+八日上午 3 t
+八日下午 3 m
+八日晚上 3 l
+八日游 3 nz
+八旬 25 t
+八时 2 t
+八晚 3 t
+八景 52 n
+八月 1374 t
+八月份 3 nz
+八月八 3 t
+八月节 11 t
+八服 2 n
+八期 3 t
+八木 2 n
+八木佑 3 nz
+八木天线 3 nz
+八朵 5 m
+八杆 2 n
+八条 79 m
+八杯 10 m
+八杯酒 3 n
+八极 12 n
+八极拳 23 n
+八枚 5 m
+八枝 3 m
+八枪 6 m
+八架 8 m
+八柱 16 n
+八栋 8 m
+八样 7 m
+八根 26 m
+八格 3 n
+八桂 3 j
+八桌 7 m
+八桶 3 m
+八棵 3 m
+八楼 3 n
+八次 60 m
+八款 2 m
+八歌 3 n
+八正散 7 i
+八步 27 m
+八步区 3 n
+八段 8 m
+八段锦 13 n
+八毛 4 n
+八渡 3 n
+八点 154 m
+八点党 3 nt
+八点半 3 m
+八点档 3 m
+八点钟 3 m
+八爷 3 n
+八片 5 m
+八版 3 n
+八王坟 3 n
+八珍 29 b
+八珍玉食 3 i
+八班 3 m
+八瓶 5 m
+八甲 3 n
+八番 14 m
+八百 115 m
+八百一十万元 2 m
+八百七十名 2 m
+八百万 149 m
+八百万两 2 m
+八百万余斤 2 m
+八百三十亩 2 m
+八百两 23 m
+八百个 2 m
+八百二十部 2 m
+八百五十文 2 m
+八百余 12 m
+八百余亩 2 m
+八百余年 4 m
+八百余枚 2 m
+八百余篇 2 m
+八百余里 6 m
+八百元 7 m
+八百八味 4 m
+八百公里 5 m
+八百六十卷 2 m
+八百卷 3 m
+八百名 6 m
+八百块 2 m
+八百壮士 3 n
+八百多 4 m
+八百多个 3 m
+八百多名 2 m
+八百多块 2 m
+八百多年 5 m
+八百孤寒 3 i
+八百岁 2 m
+八百年 29 m
+八百弓 3 nz
+八百当 3 n
+八百户 2 m
+八百文 4 m
+八百斤 6 m
+八百米 4 m
+八百里 72 m
+八百零七万 2 m
+八百零八年 2 m
+八百零八步 2 m
+八盆 2 m
+八盏 3 m
+八盒 3 m
+八盘 10 n
+八目 4 n
+八目妖 3 n
+八目鳗 3 n
+八碗 11 m
+八磅 6 m
+八神 3 n
+八神庵 3 n
+八种 99 m
+八科 3 n
+八秒 3 m
+八秒钟 3 i
+八稚女 3 n
+八窗玲珑 3 i
+八站 5 n
+八章 13 m
+八竿子打不着 9 l
+八笔 4 m
+八筒 3 n
+八篇 8 m
+八米 5 m
+八类 9 m
+八粒 4 m
+八级 159 n
+八纮同轨 3 n
+八线 3 n
+八维 15 m
+八罐 3 m
+八股 90 m
+八股文 75 nz
+八脚 3 n
+八腊 2 ns
+八艘 17 m
+八节 30 t
+八花九裂 3 i
+八英寸 2 m
+八荒 16 n
+八荒之外 3 i
+八荣八 3 i
+八荣八耻 3 i
+八营 3 n
+八行 16 j
+八行书 4 n
+八街 3 n
+八街九陌 3 n
+八袋 50 n
+八角 757 m
+八角亭 16 ns
+八角帽 131 n
+八角形 35 n
+八角枫 8 n
+八角楼 2 n
+八角茴香 4 n
+八角莲 2 n
+八角街 3 ns
+八角钱 3 n
+八角鼓 17 n
+八记 3 n
+八课 3 n
+八起 3 m
+八路 158 m
+八路军 885 n
+八路军总司令部 4 nt
+八路军总部 153 nt
+八路军第一一五师 17 l
+八轮 3 m
+八载 23 m
+八辈 16 m
+八辈子 24 m
+八边 3 n
+八边形 3 n
+八达 48 nz
+八达岭 107 ns
+八达岭特区办事处 4 nt
+八达岭长城 49 ns
+八达岭高速公路 6 nz
+八达通 3 nz
+八运 4 n
+八运会 32 j
+八进位 3 n
+八进制 6 n
+八连 26 ns
+八连冠 5 n
+八通 3 nz
+八通关 3 n
+八通网 3 n
+八遍 7 m
+八道 78 m
+八道江区 7 ns
+八邪 3 n
+八部 131 m
+八酒杯 3 n
+八里 63 m
+八里乡 3 ns
+八里台 11 ns
+八里庄 12 ns
+八里桥 13 ns
+八里沟 3 ns
+八重 16 m
+八钱 3 n
+八门 58 n
+八间 4 t
+八闽 8 j
+八队 94 n
+八阵 33 m
+八阵图 3 nz
+八难三灾 3 i
+八集 3 n
+八面 48 n
+八面体 34 n
+八面光 3 n
+八面受敌 3 i
+八面圆通 3 n
+八面威风 14 n
+八面山 11 n
+八面张罗 3 nz
+八面来风 4 l
+八面玲珑 18 i
+八面见光 3 n
+八面锋 3 n
+八面风 2 n
+八面驶风 3 n
+八音 26 n
+八音匣子 3 n
+八音盒 9 n
+八音节 3 n
+八音遏密 3 i
+八页 3 m
+八顷 4 m
+八项 77 m
+八项注意 40 l
+八颗 15 m
+八风 3 n
+八首 7 m
+八首歌 3 m
+八骏图 3 nz
+公 5628 n
+公一母 3 nr
+公丈 3 n
+公丘福 2 nr
+公东征 13 nr
+公两 3 m
+公主 3531 n
+公主坟 45 n
+公主岭 10 n
+公主岭市 12 n
+公主道 179 n
+公举 36 n
+公举之 2 nr
+公乃命 2 nr
+公乃汉 4 nr
+公义 17 n
+公义私 2 n
+公之于世 9 i
+公之于众 29 i
+公之勇 2 nr
+公之子 7 nr
+公之尊 2 nr
+公之意 2 nr
+公之才 2 nr
+公之礼 2 nr
+公之言 3 nr
+公九卿 8 nr
+公买公 2 n
+公买公卖 3 n
+公了 3 v
+公事 326 n
+公事公办 44 n
+公事包 2 n
+公事房 3 n
+公交 286 n
+公交公司 3 nt
+公交化 6 n
+公交查询 3 nr
+公交站 3 n
+公交站点 3 n
+公交系统 5 n
+公交线 2 n
+公交线路 5 n
+公交网 3 n
+公交路线 3 n
+公交车 150 n
+公交车站 3 n
+公产 123 n
+公亩 3 q
+公亮兄 4 nr
+公人 273 n
+公仆 138 n
+公今 2 t
+公仓 16 n
+公仔 13 n
+公仰天 2 nr
+公价 3 n
+公任官 16 n
+公份 3 n
+公伏 2 q
+公伐 2 n
+公休 13 v
+公休日 3 t
+公众 2941 n
+公众形象 3 n
+公众网 256 n
+公众股 249 n
+公会 187 n
+公会堂 2 n
+公伤 3 n
+公伯峡 3 nr
+公估 16 v
+公佐武 3 nr
+公何 2 n
+公余 3 n
+公余之暇 3 i
+公使 973 n
+公使团 3 n
+公使衔 101 n
+公使馆 65 n
+公例 6 n
+公依言 2 nr
+公侯 38 n
+公侯之 3 nr
+公侯伯 7 nr
+公侯勋 4 nr
+公侯将相 3 nr
+公侯止 2 nr
+公保大楼 3 n
+公信 5 n
+公信力 71 n
+公信度 3 n
+公倍数 3 n
+公债 123 n
+公债券 16 n
+公假 3 n
+公傅友 2 nr
+公允 59 nr
+公元 6748 q
+公元前 5270 t
+公兄 3 n
+公先王 5 nr
+公克 3 q
+公兔 3 n
+公公 969 n
+公公平平 3 n
+公公正正 3 nr
+公公诉 3 nr
+公共 4271 b
+公共事业 6 n
+公共事务 3 n
+公共交通 15 nt
+公共信息 4 nt
+公共信道 3 n
+公共关系 3 n
+公共利益 3 n
+公共卫生 3 n
+公共厕所 3 n
+公共品 2 n
+公共场合 3 n
+公共场所 117 nt
+公共安全 3 nr
+公共对象 2 n
+公共广播 3 l
+公共建筑 3 n
+公共开支 3 n
+公共性 15 n
+公共成分 3 l
+公共政策 3 n
+公共数据 4 n
+公共服务 7 n
+公共汽车 56 nt
+公共电视 3 nt
+公共电话 3 n
+公共租界 3 n
+公共秩序 3 nr
+公共积累 2 l
+公共绿地 3 n
+公共英语 3 nz
+公共行政 3 n
+公共设施 3 n
+公共课 43 n
+公共财产 3 j
+公共财政 3 nt
+公共责任 3 n
+公共资源 37 n
+公共通信 3 nt
+公共道德 3 nr
+公共部门 3 n
+公共频道 3 n
+公关 418 n
+公关业 5 n
+公关先生 3 n
+公关员 3 n
+公关小姐 3 nr
+公关活动 3 l
+公关礼仪 3 nr
+公关能力 3 n
+公关部 63 n
+公冢孙 3 nr
+公决 40 ad
+公冶乾 128 nr
+公冶二 15 nr
+公冶长 3 nr
+公凸 256 n
+公出 3 v
+公函 21 n
+公分 86 n
+公分子 3 n
+公分母 3 n
+公切线 3 n
+公则活 2 nr
+公则飞 2 nr
+公判 3 n
+公判大会 3 n
+公制 34 n
+公制化 3 n
+公力 2 n
+公办 264 n
+公办民助 9 n
+公务 839 n
+公务人员 3 n
+公务员 1382 n
+公务员惩 3 n
+公务员法 3 n
+公务在身 3 n
+公务机 8 n
+公务活动 3 n
+公务用车 3 n
+公务缠身 3 i
+公务网 3 n
+公务舱 8 n
+公务车 3 n
+公勤 47 n
+公勺 3 n
+公升 36 v
+公卖 3 v
+公卖局 3 n
+公卿 106 nr
+公卿之 6 nr
+公卿士 2 nr
+公卿奏 5 nr
+公卿皆 4 nr
+公卿议 2 nr
+公历 94 n
+公厕 41 n
+公厘 49 q
+公叔 6 n
+公可速 4 n
+公司 45604 n
+公司业绩 3 n
+公司传真 3 nr
+公司债 3 n
+公司债券 3 n
+公司债务 3 n
+公司党委 3 n
+公司公告 3 n
+公司出品 3 n
+公司制 34 n
+公司化 9 n
+公司名录 3 n
+公司员工 3 n
+公司地址 3 n
+公司库 3 n
+公司律师 3 n
+公司总裁 3 n
+公司总部 3 n
+公司概况 3 i
+公司法 245 n
+公司法人 3 n
+公司版权 3 n
+公司章程 3 n
+公司简介 3 nr
+公司老总 3 nr
+公司股票 3 n
+公司财务 3 n
+公吏 4 n
+公吏人 4 nr
+公吨 16 m
+公听会 3 n
+公听并观 3 i
+公启 4 t
+公告 1919 n
+公告价格 3 n
+公告地价 3 n
+公告日 27 t
+公告栏 20 n
+公告牌 4 n
+公告费 2 n
+公告送达 3 n
+公呵呵 6 nr
+公和祥 2 nr
+公哈哈 4 nr
+公哥 2 n
+公器 3 n
+公器私用 3 n
+公因式 3 n
+公因数 7 n
+公园 4609 n
+公园区 3 n
+公园式 2 n
+公园形式 3 n
+公园类型 3 n
+公园路 3 n
+公园道路 3 n
+公国 222 n
+公地 3 n
+公垂线 3 n
+公堂 82 n
+公墓 87 n
+公墓区 2 n
+公士 3 n
+公大史 4 n
+公大怒 6 nr
+公奉成 4 nr
+公奏议 3 n
+公奴 3 n
+公妇 16 n
+公妻 16 n
+公威 3 n
+公娼 3 n
+公婆 91 n
+公子 1801 n
+公子侯 3 nr
+公子光 8 nr
+公子克 2 nr
+公子华 3 nr
+公子发 2 nr
+公子哈哈 2 nr
+公子哥 19 nr
+公子哥儿 43 nr
+公子嘉 4 nr
+公子微微 4 nr
+公子明 2 nr
+公子模样 2 l
+公子爷 89 nr
+公子王孙 9 nr
+公子稷 2 n
+公子章 2 nr
+公子纠 2 nr
+公子醒 2 nr
+公存 2 n
+公孙 301 n
+公孙一清 3 nr
+公孙丑 5 nr
+公孙为 2 nr
+公孙之子 3 nr
+公孙侨 2 nr
+公孙先生 9 nr
+公孙夏 3 nr
+公孙大娘 5 nr
+公孙夫人 2 nr
+公孙姑娘 14 nr
+公孙家 2 n
+公孙寿 2 nr
+公孙尼子 3 nr
+公孙康 11 nr
+公孙康之 2 nr
+公孙弘 13 nr
+公孙敖 2 nr
+公孙杵臼 2 nr
+公孙树 8 nr
+公孙止 317 nr
+公孙止于 2 nr
+公孙止交 2 n
+公孙止似 2 nr
+公孙止冷 2 nr
+公孙止刀 4 n
+公孙止双 2 nr
+公孙止可 2 nr
+公孙止右 2 nr
+公孙止叹 2 nr
+公孙止听 2 nr
+公孙止害 2 n
+公孙止得 2 nr
+公孙止微 2 nr
+公孙止心 2 n
+公孙止忙 2 nr
+公孙止怒 2 nr
+公孙止恚 2 nr
+公孙止放 2 nr
+公孙止斗 2 n
+公孙止极 2 n
+公孙止正 2 nr
+公孙止激 6 nr
+公孙止知 2 n
+公孙止笑 2 nr
+公孙止缓 2 nr
+公孙止腿 2 n
+公孙止落 2 n
+公孙止见 16 n
+公孙止越 2 nr
+公孙止身 4 n
+公孙止转 2 nr
+公孙止进 2 nr
+公孙止连 2 nr
+公孙止金 6 n
+公孙止长 2 n
+公孙止隔 2 n
+公孙止面 2 n
+公孙止飞 2 nr
+公孙止黑 2 nr
+公孙氏 4 nr
+公孙渊 23 nr
+公孙渊兵 2 nr
+公孙渊果 3 nr
+公孙瓒 51 nr
+公孙绿 132 nr
+公孙绿萼 3 n
+公孙老儿 11 nr
+公孙胜 243 nr
+公孙胜一 2 nr
+公孙胜先 2 nr
+公孙胜先生 3 nr
+公孙胜引 3 nr
+公孙胜扶 2 nr
+公孙舍 2 nr
+公孙舍之 2 nr
+公孙衍 8 nr
+公孙谷 15 nr
+公孙谷主 219 n
+公孙贺 2 nr
+公孙贾 2 nr
+公孙述 9 nr
+公孙鞅 9 nr
+公孙龙 10 nr
+公孙龙则 2 n
+公孙龙子 10 nr
+公季 4 t
+公学 14 n
+公学中 2 n
+公学堂 2 n
+公学特 3 nr
+公学里 2 n
+公安 2800 n
+公安交通 3 nt
+公安人员 65 n
+公安军 5 nr
+公安分局 3 n
+公安厅 62 n
+公安县 527 nr
+公安处 41 n
+公安大学 3 nt
+公安局 584 nt
+公安局长 21 n
+公安工作 3 n
+公安干警 3 n
+公安战士 3 n
+公安战线 3 n
+公安机关 3 n
+公安段 3 n
+公安民警 3 n
+公安法 3 n
+公安派 3 n
+公安消防 3 n
+公安系统 3 n
+公安网 3 n
+公安部 319 n
+公安部出入境管理局 11 nt
+公安部经济犯罪侦查局 8 n
+公安部长 2 n
+公安部门 201 n
+公安部队 266 n
+公安队伍 3 n
+公安院校 3 nt
+公定 6 n
+公定价 3 n
+公定价格 3 n
+公审 107 n
+公室 7 n
+公害 132 n
+公害病 3 n
+公家 239 n
+公家人 13 n
+公家机关 3 n
+公家机构 3 n
+公寓 597 n
+公寓化 3 n
+公寓床 3 n
+公寓式 6 n
+公寓楼 14 n
+公寸 3 n
+公封侯 4 nr
+公尔忘私 3 n
+公尺 95 q
+公尺见方 3 n
+公屋 4 n
+公展元 2 n
+公山 13 n
+公岩 34 n
+公州 2 n
+公差 250 n
+公差费 3 n
+公布 5476 v
+公布于世 6 nr
+公布于众 11 n
+公布出来 3 l
+公布栏 4 n
+公希预 2 nr
+公帐 3 n
+公帑 18 n
+公干 70 n
+公平 1646 n
+公平交易 22 n
+公平信实 3 n
+公平化 9 n
+公平合理 29 n
+公平性 39 n
+公平无私 3 i
+公平正义 3 n
+公平理论 3 n
+公平秤 3 n
+公平竞争 3 l
+公平网 3 n
+公序良 4 nr
+公库 5 n
+公府 13 n
+公开 5094 ad
+公开信 65 nr
+公开出来 3 l
+公开化 56 nr
+公开场合 3 n
+公开型 3 b
+公开墙 3 nr
+公开处理 3 n
+公开审判 3 n
+公开审理 3 n
+公开密钥 3 nr
+公开市场 3 n
+公开性 21 n
+公开批评 3 n
+公开招标 3 n
+公开挑衅 3 v
+公开栏 13 nr
+公开监督 3 nr
+公开竞选 3 nr
+公开课 6 n
+公开赛 253 nr
+公开选拔 3 n
+公式 1158 n
+公式主义 3 n
+公式化 29 n
+公引 3 n
+公张溶 10 nr
+公强 2 v
+公彭春 2 nr
+公役 3 n
+公微微 5 nr
+公德 127 n
+公德心 3 nr
+公心 28 n
+公忠义 4 nr
+公忠体国 15 nr
+公忠谋 2 nr
+公怒 2 v
+公意 57 n
+公愤 189 n
+公慕华 3 nr
+公房 75 n
+公所 70 n
+公所传 3 l
+公才公望 3 nr
+公才献 2 nr
+公投 19 v
+公投法 3 n
+公折 2 n
+公报 847 n
+公报私仇 9 i
+公担 2 n
+公拆 3 v
+公掌力 5 n
+公推 85 b
+公摊面积 3 n
+公撮 3 m
+公敌 63 n
+公教 14 n
+公教人员 2 n
+公文 450 n
+公文书 3 n
+公文信 3 nr
+公文包 44 n
+公文旅行 3 nt
+公文箱 3 n
+公文纸 3 n
+公文网 3 n
+公文袋 2 n
+公斗 3 n
+公斤 3635 q
+公断 10 v
+公方 53 n
+公方代表 3 n
+公族 8 n
+公族中 2 n
+公明 20 n
+公明党 14 n
+公明正大 3 b
+公明镇 8 nr
+公易 2 n
+公易登 2 nr
+公映 27 v
+公是公非 3 l
+公晓 2 t
+公曹髦 4 nr
+公有 530 b
+公有住房 3 n
+公有制 434 n
+公有化 23 n
+公有土地 3 n
+公服 11 n
+公望 2 n
+公未 2 d
+公朱仝 4 nr
+公朱能 3 nr
+公权 8 n
+公权力 3 n
+公树 4 n
+公格尔 5 nr
+公格尔山 6 nr
+公案 270 n
+公检法 36 n
+公检法司 3 nt
+公款 425 n
+公款吃喝 22 l
+公款消费 3 n
+公正 1361 nr
+公正不阿 3 i
+公正司法 3 n
+公正处理 3 n
+公正廉明 3 nr
+公正廉洁 3 nr
+公正性 37 b
+公正执法 3 n
+公正无私 9 i
+公母 2 n
+公比 4 n
+公毫 3 m
+公民 12636 n
+公民投票 3 n
+公民权 83 n
+公民权利 3 n
+公民科 3 n
+公民自由 3 n
+公民课 3 n
+公民道德 3 n
+公民院 2 nt
+公池 2 n
+公汽 12 n
+公沙 2 n
+公法 28 n
+公派 13 n
+公派留学 3 n
+公测 3 v
+公测版 3 n
+公海 102 n
+公海自由 3 n
+公海远航 2 nt
+公演 95 n
+公然 574 ad
+公然侮辱 3 vn
+公然反对 3 l
+公然反抗 3 n
+公爵 356 n
+公爵夫人 3 nr
+公爷 27 n
+公爹 15 n
+公牍 3 n
+公牛 201 n
+公牛队 3 n
+公物 38 n
+公狗 3 n
+公狗母 2 nr
+公狮 3 n
+公狼 3 n
+公猪 8 n
+公猫 2 n
+公率军 2 nr
+公王岭 11 nr
+公理 420 n
+公理会 5 n
+公理化 49 n
+公理学 3 n
+公瑾之 5 nr
+公生 128 n
+公生右 4 nr
+公生桥 640 n
+公生门 129 n
+公用 238 n
+公用事业 82 n
+公用企业 3 n
+公用信息 3 n
+公用局 4 n
+公用权 3 n
+公用电话 34 n
+公用电话亭 14 n
+公用程式 3 n
+公用计算机 2 n
+公用设施 3 n
+公田 55 n
+公田之 5 nr
+公田按 3 nr
+公田法 2 nr
+公田藉 2 nr
+公畜 3 n
+公略 4 n
+公益 404 n
+公益事业 3 n
+公益广告 3 n
+公益性 92 n
+公益林 2 n
+公益活动 3 n
+公益行 3 n
+公益金 39 n
+公相 26 n
+公相助 2 nr
+公真 2 ad
+公知吾 2 nr
+公石 3 n
+公示 119 v
+公示制 3 n
+公示栏 2 n
+公礼 4 n
+公礼叹 2 nr
+公社 1714 n
+公社化 25 n
+公祖 2 n
+公祭 191 v
+公私 470 n
+公私不分 3 l
+公私两便 3 i
+公私两利 3 n
+公私两济 3 n
+公私交困 3 i
+公私交迫 3 i
+公私兼顾 40 i
+公私分明 3 n
+公私合营 3 n
+公秉 3 nr
+公秉藩 4 nr
+公积 51 n
+公积每 2 nr
+公积转 2 nr
+公积金 556 n
+公称 5 n
+公立 254 v
+公立医院 3 nt
+公立学校 3 n
+公章 153 n
+公筷 3 n
+公筷母匙 3 n
+公粮 47 n
+公精舍 3 n
+公约 948 n
+公约国 3 n
+公约数 3 n
+公网 4 n
+公署 123 n
+公羊 23 n
+公羊传 3 nr
+公羊墨 2 nr
+公羊学 4 n
+公羊家 2 n
+公老虎 2 nr
+公而忘私 14 i
+公职 788 n
+公职人员 3 n
+公肃 3 ad
+公股 3 n
+公育 16 n
+公臣 3 n
+公至昭 2 nr
+公至正 2 nr
+公若有 3 nr
+公范骅 2 nr
+公营 30 n
+公营事业 3 n
+公营企业 3 n
+公萧半 2 nr
+公董局 2 n
+公虎 3 n
+公蚁 3 n
+公蚊子 3 n
+公行 3 n
+公规密谏 3 l
+公言 3 n
+公言报 3 n
+公言极 3 n
+公誓辞 2 i
+公认 981 v
+公议 78 n
+公论 45 n
+公设 43 n
+公设辩护 3 n
+公证 226 n
+公证书 4 n
+公证人 26 n
+公证人员 3 n
+公证会 3 nt
+公证员 9 n
+公证处 57 n
+公证机关 3 n
+公证法 3 n
+公证结婚 3 n
+公证费 3 n
+公诉 106 v
+公诉书 3 n
+公诉人 28 n
+公诉方 3 n
+公话 2 n
+公说公有 3 l
+公说公有理 12 n
+公诸于世 14 l
+公诸于众 10 l
+公诸同好 3 l
+公谊 4 n
+公谋父 2 n
+公谏录 5 nr
+公象 3 n
+公财 3 n
+公费 133 n
+公费医疗 3 n
+公费旅游 3 n
+公费生 6 n
+公费留学 3 n
+公贿 8 v
+公赐第 2 nr
+公路 8748 n
+公路交通 8 n
+公路局 16 n
+公路工程 3 n
+公路桥 382 n
+公路沿线 3 n
+公路线 15 n
+公路绿化 3 n
+公路网 388 n
+公路赛 7 n
+公路运输 3 l
+公车 144 n
+公车上 3 n
+公车处 3 n
+公车票 3 n
+公车私用 3 n
+公车站 3 n
+公车管理 3 n
+公转 146 v
+公辅之 2 nr
+公辅成 9 nr
+公输 2 vn
+公输子 2 n
+公辞 2 n
+公运单 2 n
+公进京 2 nr
+公连发 2 nr
+公选 2 v
+公遇窘 2 nr
+公道 590 n
+公道合理 3 n
+公道话 47 n
+公邑 2 n
+公采邑 2 nr
+公里 13083 q
+公里跑 3 n
+公钱 3 n
+公铁 4 n
+公锥 3 n
+公门 10 n
+公门中 2 n
+公门桃李 3 n
+公闻 2 n
+公陈午 2 nr
+公雅奏 2 nr
+公雷神 2 nr
+公霸业 2 n
+公顷 739 q
+公项 3 n
+公馆 213 n
+公马 4 n
+公驴 4 n
+公鸡 217 n
+公鹅 3 n
+公鹿 15 n
+公鼠 3 n
+六 8392 m
+六一 44 m
+六一伙 3 m
+六一散 2 i
+六一路 3 m
+六七 86 m
+六七万 165 m
+六七万两 2 m
+六七丈 16 m
+六七个 69 m
+六七件 2 m
+六七倍 5 m
+六七八九十 3 m
+六七公里 3 m
+六七六 6 m
+六七具 2 m
+六七分 11 m
+六七十 44 m
+六七十万 13 m
+六七十丈 3 m
+六七十个 5 m
+六七十元 3 m
+六七十名 3 m
+六七十岁 21 m
+六七十年 16 m
+六七十年代 2 m
+六七十招 5 m
+六七十斤 2 m
+六七十步 2 m
+六七十米 2 m
+六七十里 3 m
+六七千 18 m
+六七千两 3 m
+六七千元 6 m
+六七千年 8 m
+六七口 4 m
+六七只 4 m
+六七名 27 m
+六七品 6 m
+六七块 2 m
+六七处 5 m
+六七天 16 m
+六七套 2 m
+六七家 2 m
+六七寸 4 m
+六七尺 8 m
+六七岁 29 m
+六七年 34 m
+六七成 15 m
+六七户 2 m
+六七招 8 m
+六七支 2 m
+六七日 9 m
+六七杆 2 m
+六七条 4 m
+六七杯 2 m
+六七枝 2 m
+六七次 7 m
+六七步 7 m
+六七点 4 m
+六七百 24 m
+六七百万元 2 m
+六七百个 2 m
+六七百元 7 m
+六七百斤 3 m
+六七百米 2 m
+六七种 4 m
+六七米 4 m
+六七里 21 m
+六万 92 m
+六万三千七百一十九亩 2 m
+六万两 7 m
+六万个 3 m
+六万九千 2 m
+六万九千余两 2 m
+六万五千 2 m
+六万五千余箱 2 m
+六万五千美元 2 m
+六万人 3 i
+六万余 7 m
+六万元 6 m
+六万吨 2 m
+六万块 2 m
+六万多 5 m
+六万大山 5 ns
+六万平方米 2 m
+六万户 2 m
+六万美元 2 m
+六丈 6 m
+六三 10 m
+六三制 3 j
+六三年 6 m
+六三路 2 m
+六下 6 m
+六世 102 t
+六世祖 8 n
+六世纪 10 t
+六两 10 m
+六两四 6 m
+六个 1287 m
+六个月 3 m
+六中 261 ns
+六中全会 243 j
+六串 3 m
+六九 2 m
+六九五十四 2 m
+六九年 4 m
+六乡 10 ns
+六书 18 n
+六二 5 m
+六二五 9 m
+六二年 5 m
+六五 35 m
+六五年 3 m
+六亩 2 m
+六亲 4 n
+六亲不认 34 i
+六亲无靠 3 i
+六人份 3 m
+六人行 3 j
+六亿 8 m
+六亿五千万 3 m
+六亿人 3 m
+六亿元 3 m
+六亿多 3 m
+六仙桌 3 n
+六代 17 t
+六件 18 m
+六任 2 m
+六份 4 m
+六位 248 m
+六位数 3 n
+六便士 5 ns
+六信 3 j
+六倍 19 m
+六元 28 m
+六元金码 3 n
+六八 7 m
+六八面 2 m
+六公园 2 n
+六公里 4 m
+六六 36 m
+六六三十六 2 m
+六六三十六招 4 m
+六六六 15 m
+六具 8 m
+六册 4 m
+六军 3 j
+六出 23 m
+六出纷飞 3 i
+六出花 3 i
+六刀 8 m
+六分 75 m
+六分之一 3 m
+六分仪 9 n
+六分钟 4 m
+六划 3 n
+六列 2 m
+六副 2 m
+六匹 13 m
+六区 3 ns
+六十 423 m
+六十一 34 m
+六十一岁 4 m
+六十一年 21 m
+六十七 10 m
+六十七万九千多亿元 2 m
+六十七块 2 m
+六十七岁 3 m
+六十万 98 m
+六十万两 10 m
+六十万个 4 m
+六十三 14 m
+六十三万 4 m
+六十三个 2 m
+六十三卷 2 m
+六十三家 2 m
+六十三岁 13 m
+六十三手 2 m
+六十三艘 2 m
+六十两 7 m
+六十个 25 m
+六十九 5 m
+六十九万 2 m
+六十九卷 2 m
+六十九岁 8 m
+六十九条 5 m
+六十二 11 m
+六十二万 2 m
+六十二万册 2 m
+六十二代 2 m
+六十二场 2 m
+六十二岁 4 m
+六十二年 2 m
+六十二斤 2 m
+六十二艘 3 m
+六十五 11 m
+六十五元 3 m
+六十五卷 2 m
+六十五名 2 m
+六十五岁 16 m
+六十五年 2 m
+六十亿美元 2 m
+六十余 11 m
+六十余万 6 m
+六十余家 2 m
+六十余岁 5 m
+六十余年 6 m
+六十余招 4 m
+六十余种 4 m
+六十余艘 2 m
+六十余里 3 m
+六十余门 2 m
+六十元 11 m
+六十八 4 m
+六十八卷 3 m
+六十八岁 4 m
+六十八条 2 m
+六十八款 2 m
+六十公里 2 m
+六十六 13 m
+六十六两卷 2 m
+六十六卷 4 m
+六十六天 20 m
+六十六家 2 m
+六十六岁 11 m
+六十几个 4 m
+六十几岁 2 m
+六十出头 7 m
+六十匹 2 m
+六十卷 9 m
+六十名 7 m
+六十周年 8 m
+六十四 78 m
+六十四个 3 m
+六十四代 4 m
+六十四位 2 m
+六十四公里 2 m
+六十四卷 4 m
+六十四名 2 m
+六十四天 17 m
+六十四岁 9 m
+六十四招 5 m
+六十块 6 m
+六十多 12 m
+六十多万 5 m
+六十多万两 6 m
+六十多个 4 m
+六十多块 2 m
+六十多天 2 m
+六十多家 2 m
+六十多岁 51 m
+六十多年 19 m
+六十多里 4 m
+六十大寿 3 nz
+六十天 8 m
+六十家 4 m
+六十岁 85 m
+六十年 120 m
+六十年代 13 m
+六十度 2 m
+六十开 2 m
+六十招 3 m
+六十斤 16 m
+六十日 5 m
+六十条 38 m
+六十根 128 m
+六十步 3 m
+六十篇 7 m
+六十米 4 m
+六十路 2 m
+六十里 45 m
+六十门 2 m
+六十顷 4 m
+六千 38 m
+六千七百万担 2 m
+六千七百三十九 2 m
+六千万 6 m
+六千万元 6 m
+六千两 9 m
+六千个 3 m
+六千五百 3 m
+六千五百平方公里 2 m
+六千五百年 2 m
+六千亩 2 m
+六千人 3 i
+六千余 8 m
+六千元 3 m
+六千六百元 3 m
+六千六百八十六万元 2 m
+六千出 2 m
+六千只 2 m
+六千名 4 m
+六千块 5 m
+六千多 4 m
+六千多万 4 m
+六千年 7 m
+六千斤 2 m
+六千米 2 m
+六千里 3 m
+六卷 24 m
+六厂 3 n
+六发 6 j
+六口 15 m
+六口之家 3 i
+六句 13 m
+六句话 3 i
+六只 51 m
+六只手 3 i
+六台 2 m
+六叶 2 t
+六号 47 m
+六号楼 3 n
+六合 421 j
+六合一 3 b
+六合之内 3 nz
+六合刀 7 n
+六合区 3 n
+六合县 20 ns
+六合彩 13 n
+六合拳 19 n
+六合源 3 n
+六合皇 3 n
+六合网 3 nz
+六合采 3 i
+六名 127 m
+六吨 2 m
+六员 21 m
+六周 20 t
+六周年 3 m
+六味 28 m
+六味地黄 55 nz
+六和塔 32 ns
+六和彩 3 nz
+六品 181 m
+六响 4 m
+六哥 3 ns
+六四 3 m
+六四年 4 m
+六四式 16 nz
+六四手 2 m
+六回 3 m
+六团 2 m
+六国 3 ns
+六国论 3 n
+六圈 4 m
+六圩 8 ns
+六场 28 m
+六块 23 m
+六块钱 3 nz
+六堂 13 m
+六堰 3 ns
+六堵 3 m
+六塘 2 ns
+六声 6 m
+六壶 3 n
+六壶酒 3 i
+六处 12 m
+六夜 6 t
+六大 461 j
+六大块 3 m
+六大片 3 m
+六大类 3 m
+六天 106 m
+六头 8 m
+六套 10 m
+六妹 3 n
+六季 3 t
+六安 89 ns
+六安县 3 ns
+六安市 11 ns
+六宗 8 m
+六害 3 n
+六家 46 m
+六寸 23 m
+六尊 12 m
+六小 3 j
+六小时 3 j
+六小龄童 3 n
+六尘不染 3 i
+六尺 52 m
+六尺之孤 3 n
+六尺之讬 3 nz
+六尺之驱 3 i
+六尾 3 m
+六局 9 j
+六局上半 3 i
+六局下半 3 i
+六层 17 m
+六届 330 m
+六岁 112 m
+六岁时 3 i
+六巷 3 ns
+六师 3 n
+六席 3 m
+六幅 14 m
+六幢 2 m
+六年 1633 m
+六年制 6 n
+六年级 3 b
+六库镇 2 ns
+六度 14 ns
+六座 15 m
+六弄 3 ns
+六式 3 n
+六弟 3 n
+六张 15 m
+六张犁 3 ns
+六弦琴 3 n
+六必居 12 i
+六成 77 m
+六成新 3 nz
+六截 3 m
+六户 2 m
+六房 3 n
+六所 10 j
+六扇 11 m
+六手 3 m
+六批 2 m
+六把 7 m
+六折 6 m
+六招 26 m
+六指儿 5 n
+六排 3 m
+六支 15 m
+六斗 9 m
+六斤 6 m
+六斤重 3 i
+六方 95 m
+六方会谈 3 nz
+六方晶系 3 n
+六方钻杆 3 nz
+六日 97 t
+六日游 3 nz
+六日电 3 nz
+六旬 47 t
+六旬万 10 m
+六时 3 t
+六星期 3 t
+六星级 2 b
+六晚 3 t
+六曲 3 m
+六月 869 t
+六月份 3 nz
+六月天 3 t
+六月雪 2 n
+六月飞霜 3 i
+六朝 226 t
+六朝金粉 3 nz
+六期 263 t
+六本 4 ns
+六本木 3 ns
+六朵 3 m
+六机部 3 n
+六杆 4 m
+六条 106 m
+六杯 3 m
+六枚 20 m
+六枝 16 m
+六枝特区 2 ns
+六枪 2 m
+六架 5 m
+六柱 6 m
+六栋 3 m
+六栏 3 n
+六株 2 m
+六样 4 m
+六根 29 m
+六根清净 13 i
+六根清静 3 i
+六格 3 n
+六案 8 m
+六档 3 m
+六桶 3 m
+六梯 3 n
+六梯次 3 b
+六棵 3 m
+六楼 3 ns
+六次 52 m
+六欲 6 n
+六款 11 m
+六步 14 m
+六段 11 m
+六氟化硫 6 nz
+六河 3 ns
+六法全书 3 nz
+六洞 3 ns
+六派 18 m
+六渡桥 3 ns
+六滴 3 m
+六灶镇 2 ns
+六点 138 m
+六点二 4 m
+六点半 3 m
+六点钟 3 m
+六爷 3 n
+六爻 3 n
+六片 8 m
+六版 3 n
+六环路 3 nz
+六班 5 m
+六瓣 3 n
+六瓶 5 m
+六甲 68 ns
+六畜 11 j
+六畜不安 3 i
+六畜兴旺 2 i
+六番 2 m
+六百 83 m
+六百一十九万五千七百五十七 2 m
+六百一十五万户 2 m
+六百一十六所 2 m
+六百万 20 m
+六百万两 3 m
+六百万元 5 m
+六百万英镑 2 m
+六百万贯 2 m
+六百万贯左右 2 m
+六百万镑 4 m
+六百三十万斤 2 m
+六百三十三 2 m
+六百三十余首 2 m
+六百三十四 4 m
+六百两 12 m
+六百个 3 m
+六百串 2 m
+六百九十匹 2 m
+六百二十五号 2 m
+六百五十 3 m
+六百五十七部 2 m
+六百五十二 2 m
+六百五十米 2 m
+六百人 3 n
+六百余 2 m
+六百余万 2 m
+六百余万元 2 m
+六百余亩 2 m
+六百余家 4 m
+六百元 4 m
+六百六十 2 m
+六百六十三万亿元 2 m
+六百册 2 m
+六百名 6 m
+六百四十九万斤 2 m
+六百块 6 m
+六百多 5 m
+六百多个 2 m
+六百多分 2 m
+六百多名 2 m
+六百多年 6 m
+六百多户 2 m
+六百多支 2 m
+六百多种 2 m
+六百多行 2 m
+六百多里 2 m
+六百年 13 m
+六百户 2 m
+六百文 4 m
+六百斤 7 m
+六百步 2 m
+六百米 4 m
+六百里 32 m
+六百零六家 2 m
+六盏 6 m
+六盘 3 m
+六盘山 79 ns
+六盘水 13 ns
+六盘水市 10 ns
+六碗 3 m
+六礼 3 nz
+六祖 3 n
+六神 14 n
+六神不安 3 i
+六神丸 3 n
+六神无主 73 i
+六种 135 m
+六科 3 ns
+六秒 2 m
+六章 6 m
+六等 26 m
+六等奖 3 nz
+六筒 3 n
+六箱 3 m
+六篇 150 m
+六篓 3 m
+六篮 3 nz
+六米 7 m
+六类 25 m
+六粒 21 m
+六粒装 3 n
+六级 233 m
+六级风 3 n
+六线 4 m
+六线谱 3 n
+六组 2 m
+六经 97 j
+六联 3 ns
+六股 13 m
+六胎 2 m
+六脚 4 ns
+六腑 47 n
+六臂三头 3 i
+六船 3 j
+六艘 21 m
+六艺 40 n
+六节 5 t
+六节诗 3 n
+六节课 3 n
+六英寸 2 m
+六营 3 ns
+六行 8 j
+六街 5 ns
+六街三市 16 ns
+六街三陌 3 n
+六袋 14 m
+六西格玛 3 ns
+六角 422 m
+六角亭 3 ns
+六角形 48 n
+六角网 3 n
+六言诗 3 n
+六记 19 m
+六课 3 n
+六谷 3 ns
+六起 2 m
+六趟 2 m
+六趣轮回 3 i
+六路 288 m
+六路横队 3 i
+六路纵队 3 n
+六车 3 n
+六轮 11 m
+六轻 3 j
+六载 19 m
+六辆 6 m
+六辑 3 n
+六边 3 ns
+六边形 20 n
+六连 3 ns
+六连冠 12 j
+六通 3 m
+六通四辟 3 i
+六通四达 3 nz
+六遍 3 m
+六道 82 m
+六道菜 3 n
+六道轮回 5 i
+六部 1173 m
+六里 9 m
+六里屯 4 ns
+六里桥 9 ns
+六重 2 m
+六重唱 3 j
+六钱 3 n
+六锅 3 n
+六镇 3 ns
+六门 151 m
+六问三推 3 i
+六间 11 t
+六间房 6 n
+六队 7 m
+六阳 25 ns
+六阵 4 m
+六阶 3 n
+六陆 3 ns
+六集 3 m
+六零 5 m
+六面 33 m
+六面体 3 n
+六韬 3 nrfg
+六韬三略 3 i
+六顷 2 m
+六项 185 m
+六颗 17 m
+六题 3 n
+六餐 2 m
+六首 7 m
+六首歌 3 m
+六马仰秣 3 n
+六龄童 3 n
+六龟 3 n
+兮 566 y
+兮兮 3 z
+兰 1390 nr
+兰世立 256 nr
+兰中校 2 nr
+兰丹 3 ns
+兰亚科 5 nr
+兰亭 12 nr
+兰亭图 5 nr
+兰亭序 22 nr
+兰亭诗 3 nr
+兰亭集 3 nr
+兰亭集序 3 nr
+兰伯特 13 nr
+兰光桑 2 nr
+兰光科技 3 nz
+兰克 8 nrt
+兰兰 8 ns
+兰利 12 ns
+兰剑笑 5 nr
+兰博基 3 nr
+兰博基尼 3 nr
+兰卡 2 nrt
+兰卡威 51 nr
+兰卡斯 2 nr
+兰友瓜戚 3 nr
+兰古瑞萨 3 ns
+兰叶描 3 nr
+兰哥儿 11 nr
+兰啊兰 2 nr
+兰因絮果 3 nr
+兰国未 2 nr
+兰图尔 4 nr
+兰坪 13 ns
+兰坪县 2 ns
+兰坪白族普米族自治县 6 ns
+兰士瓦 29 nr
+兰多夫 5 nrt
+兰大 21 ns
+兰天野 3 nr
+兰姆 31 nrt
+兰姆赛 3 nr
+兰子你 2 nr
+兰宁利 2 nr
+兰宝石 3 nr
+兰室 3 nr
+兰封 2 ns
+兰将军 8 nr
+兰小子 3 nr
+兰尼加 7 ns
+兰尼姆 2 nr
+兰山 28 ns
+兰山区 7 ns
+兰屿 20 nr
+兰州 727 ns
+兰州军区 22 ns
+兰州大学 34 nt
+兰州市 46 ns
+兰州站 2 ns
+兰州铁路局 7 nt
+兰布卡 5 nr
+兰布达 2 nr
+兰帕德 20 nr
+兰平原 3 ns
+兰平贵 2 nr
+兰开夏 8 nr
+兰开夏郡 10 nr
+兰开斯 6 nr
+兰开斯特 50 nr
+兰形棘心 3 nr
+兰德 91 nrt
+兰德伯爵 4 nr
+兰德尔 15 nr
+兰德拉 2 nr
+兰德斯 29 nr
+兰德步 2 nr
+兰德瑞 2 nr
+兰德队 2 nr
+兰心慧 3 nr
+兰心蕙 2 nr
+兰心蕙性 3 nr
+兰才基 3 nr
+兰托公 2 nr
+兰摧玉折 3 nr
+兰斯 23 nrt
+兰斯凯 7 nr
+兰斯敦 3 ns
+兰斯洛 3 nr
+兰斯洛特 2 nrt
+兰新 4 nr
+兰新线 8 nr
+兰新铁路 22 nz
+兰时齐 2 nr
+兰村泉 3 nr
+兰杰山 3 nr
+兰板 3 n
+兰根 3 ns
+兰格 14 nrt
+兰桂坊 2 nr
+兰桂齐芳 2 nr
+兰桨 3 nz
+兰歌娜 5 nr
+兰氏城 2 nr
+兰江 11 ns
+兰河 3 ns
+兰治河 7 ns
+兰波特 2 nr
+兰洽会 3 nr
+兰湖 256 ns
+兰溪 58 nr
+兰溪市 7 ns
+兰潭 2 ns
+兰熏桂馥 3 nr
+兰特 96 nrt
+兰狄尼 2 nr
+兰甘亨 13 nr
+兰癸亚 3 nr
+兰登 11 nrt
+兰盆 2 ns
+兰盆会 3 nr
+兰益群 2 nr
+兰科 29 nr
+兰红光 5 nr
+兰考 46 nr
+兰考县 10 ns
+兰色姆 3 nr
+兰艾同焚 3 nr
+兰艾难分 3 nr
+兰芝 147 nrt
+兰芝常生 3 nz
+兰花 546 nr
+兰花指 11 nz
+兰花网 3 nz
+兰花花 6 nr
+兰花苕子 3 v
+兰花草 3 nr
+兰芷之室 3 nr
+兰若 6 nr
+兰茨 6 nrt
+兰草 10 nr
+兰萨罗 3 nr
+兰蒂斯 3 nr
+兰薰桂馥 3 nr
+兰虎沟 2 nr
+兰西 9 ns
+兰西县 3 ns
+兰西瓦 17 ns
+兰言解 2 nr
+兰谱 3 nr
+兰质熏心 3 nr
+兰质蕙 2 nr
+兰质蕙心 3 nr
+兰质薰心 3 nr
+兰赫尔 4 nr
+兰迪斯 3 nr
+兰那泰 3 nr
+兰阳 23 ns
+兰阳溪 4 nr
+兰阳西 2 ns
+兰陵 14 ns
+兰陵王 6 nr
+兰陵笑笑 2 nr
+兰青线 3 nr
+兰非兰 3 nr
+兰顿 32 nrt
+兰香先 2 nr
+共 22996 d
+共上 3 d
+共上站 3 n
+共业 3 n
+共为 3 d
+共为唇齿 3 i
+共主 3 n
+共乐 6 n
+共事 147 n
+共亏 3 d
+共五 2 n
+共产 152 n
+共产主义 1027 n
+共产主义者 78 n
+共产主义青年团 10 nt
+共产党 3506 nt
+共产党人 855 n
+共产党员 961 n
+共产制 3 n
+共产国际 1052 nt
+共产国际执委会 14 nt
+共产风 7 n
+共亨 3 n
+共享 665 v
+共享主义 3 n
+共享内存 2 n
+共享器 3 l
+共享存储器 2 n
+共享性 9 n
+共享方法 2 l
+共享版 3 n
+共享税 3 n
+共享资源 2 l
+共享软件 3 l
+共价 15 n
+共价半径 3 l
+共价层析 3 l
+共价键 76 n
+共价闭 3 n
+共传递 3 nt
+共促 3 v
+共保 3 j
+共党 47 n
+共养 3 n
+共军 3 n
+共凝集 3 n
+共凝集素 3 n
+共出 3 v
+共出动 3 l
+共切 3 d
+共创 34 n
+共勉 22 v
+共匪 3 n
+共印 3 n
+共发射极 3 n
+共取 3 v
+共变微分 3 l
+共变指标 3 l
+共叙 3 v
+共合体 3 n
+共同 10510 d
+共同之处 3 l
+共同任务 3 n
+共同体 269 n
+共同利益 3 n
+共同刺激 3 l
+共同前进 3 l
+共同努力 3 l
+共同化 2 n
+共同受体 3 n
+共同商定 3 l
+共同声明 3 l
+共同奋斗 3 i
+共同完成 3 l
+共同富裕 3 nz
+共同市场 45 n
+共同开发 3 l
+共同性 30 n
+共同愿望 3 n
+共同提高 3 l
+共同条令 3 n
+共同海损 3 l
+共同点 89 n
+共同爱好 3 l
+共同犯罪 3 l
+共同理想 3 n
+共同社 42 nt
+共同纲领 263 n
+共同致富 3 l
+共同行动 3 l
+共同表位 3 n
+共同识别 3 n
+共同话题 3 l
+共同语 17 nz
+共同语言 57 l
+共同财产 3 l
+共同进步 3 l
+共吸附 3 i
+共呼吸 3 l
+共命运 15 n
+共和 1948 nz
+共和元年 43 n
+共和党 200 nt
+共和党人 37 n
+共和军 15 n
+共和制 112 n
+共和县 12 ns
+共和国 2389 ns
+共和国宫 2 n
+共和政体 3 n
+共和派 50 n
+共唱 3 v
+共商 74 n
+共商国事 3 nt
+共商国是 44 l
+共商大计 3 nz
+共图 3 n
+共图国事 3 l
+共圆 3 n
+共培养 4 n
+共基极 3 n
+共处 62 d
+共处一室 3 n
+共夺 3 v
+共妻 3 n
+共存 226 v
+共存亡 3 l
+共存共荣 3 l
+共学 3 n
+共守 3 v
+共对 3 d
+共尾性 3 n
+共工 62 n
+共帽化 3 l
+共庆 3 n
+共度 57 d
+共建 228 v
+共建文明 3 l
+共建点 3 n
+共引发剂 3 n
+共形天线 3 l
+共形溶液 3 n
+共忆 3 n
+共性 116 n
+共总 10 n
+共患难 37 l
+共患难了 3 l
+共感 3 n
+共感染 3 l
+共扩散 3 j
+共抑制 3 n
+共抵 3 d
+共拜 3 v
+共持 3 v
+共振 177 n
+共振吸收 3 l
+共振器 2 n
+共振态 21 n
+共振效应 3 l
+共振板 3 n
+共振波模 3 n
+共振荧光 3 z
+共振频率 3 n
+共挽鹿车 3 nz
+共推 3 v
+共摆 3 v
+共收 3 v
+共收录 3 n
+共收缴 3 n
+共效 3 n
+共时 3 d
+共显性 3 n
+共晶 2 n
+共曼凝 3 n
+共有 736 v
+共有区 3 n
+共有基序 3 l
+共来 3 d
+共极化 3 n
+共析 3 vn
+共析钢 3 n
+共枝别干 3 ns
+共栖 3 b
+共欣赏 3 i
+共歉 3 v
+共沉淀 3 l
+共沉降 3 l
+共测 3 v
+共济 44 n
+共济会 10 n
+共济失调 3 l
+共济网 3 n
+共浴 3 v
+共渡难关 3 l
+共溅射 3 vn
+共点力 3 d
+共点力系 3 l
+共焦点 3 n
+共犯 7 n
+共犯论处 3 l
+共生 404 n
+共生体 5 n
+共生死 3 l
+共生生物 3 l
+共生矿 11 n
+共生藻 3 n
+共用 279 n
+共登 3 v
+共相 3 d
+共睡 3 v
+共睡一床 3 n
+共睹 3 v
+共研 3 n
+共祝 3 v
+共端 3 n
+共管 32 n
+共约 3 d
+共纯化 3 n
+共纺 3 j
+共线 19 n
+共线性 3 n
+共聚 55 v
+共聚一堂 3 nz
+共聚反应 3 l
+共聚合 3 n
+共聚物 64 n
+共聚集体 3 n
+共育 4 n
+共舞 3 n
+共苦 3 d
+共荣互利 3 l
+共荣圈 23 n
+共获 3 v
+共蒸发 3 nz
+共表达 3 nz
+共襄感举 3 n
+共襄盛举 3 n
+共要 3 b
+共计 509 v
+共计价格 3 n
+共议 3 n
+共识 586 n
+共诊 3 v
+共话 10 n
+共语 3 nz
+共诱导 3 nz
+共谋 79 n
+共谋国事 3 n
+共质 3 n
+共质体 3 n
+共贯同条 3 l
+共费 3 n
+共贺 3 v
+共赚 3 v
+共赴 3 v
+共赴国难 18 l
+共转化 3 n
+共转变 3 l
+共转导 3 n
+共转录物 3 n
+共转染 3 n
+共轭 3 n
+共轭体系 3 n
+共轭像 3 n
+共轭光线 3 n
+共轭双键 3 n
+共轭复数 3 n
+共轭点 5 n
+共轭物 3 n
+共轭角 3 n
+共轭象 3 n
+共轭轴 3 n
+共轭酸 3 n
+共轴 3 n
+共轴管 3 n
+共载 3 v
+共输 3 vn
+共运 3 n
+共进会 3 n
+共进午餐 3 n
+共进退 3 l
+共通 182 n
+共通性 2 n
+共通点 7 n
+共邀 3 v
+共铺 3 n
+共降 3 v
+共青 6 n
+共青团 163 nt
+共青团中央 19 nt
+共青团中央书记处 5 nt
+共青团员 57 n
+共青城 11 n
+共面 3 n
+共面力 3 n
+共面力系 3 l
+共餐 11 n
+共骑 3 n
+共鸣 219 v
+共鸣器 5 n
+共鸣板 3 n
+共鸣点 4 n
+共鸣管 3 n
+共鸣箱 7 n
+关 7068 v
+关一战 3 nr
+关上 535 s
+关上灯 3 n
+关上门 58 n
+关下 3 v
+关不上 3 v
+关不了 3 v
+关不住 3 v
+关不料 3 l
+关东 435 ns
+关东军 218 nr
+关东出相 3 n
+关东地区 3 ns
+关东煮 3 nr
+关东糖 3 nr
+关严 9 n
+关中 618 s
+关中人 14 nr
+关中地区 3 ns
+关中平原 101 ns
+关丽仪 3 nr
+关乃忻 3 nr
+关之琳 3 nr
+关乎 132 v
+关书 3 n
+关了 3 p
+关了机 3 nr
+关了灯 3 nr
+关了门 3 nr
+关予 2 v
+关二哥 7 nr
+关二爷 6 nr
+关于 13762 p
+关于度量 3 n
+关于软件 2 l
+关云长 39 nr
+关亡 3 v
+关人 3 n
+关令尹 2 nr
+关伟伦 3 nr
+关住 3 v
+关保儿 2 nr
+关停 19 v
+关停令 3 n
+关停并转 12 i
+关健 5 nr
+关健雄 4 nr
+关元俞 3 nr
+关入 3 v
+关公 628 nr
+关兰馨 31 nr
+关关 3 v
+关关雎 3 nr
+关兴 32 ns
+关兴引 5 nr
+关兵 2 n
+关内 309 s
+关冲剑 6 nr
+关出 3 v
+关刀 3 n
+关切 533 v
+关到 3 v
+关务 3 n
+关劳 3 n
+关勤王 6 nr
+关化国 2 ns
+关华宫 3 nr
+关协 3 v
+关南 2 ns
+关南原 4 ns
+关卡 75 n
+关卡基因 3 n
+关卡税 3 n
+关厘卡 4 nr
+关原 4 n
+关厢 7 n
+关反 3 v
+关口 466 n
+关口守御 2 nr
+关合 3 v
+关吉玉 2 nr
+关名 3 v
+关吏 6 n
+关向东 3 nr
+关向应 11 n
+关员 7 n
+关咏荷 3 n
+关回 3 v
+关回去 3 l
+关国光 11 nr
+关圣大帝 2 nr
+关在 3 v
+关在东 3 nr
+关城 20 ns
+关城邦 16 nr
+关堂官 3 nr
+关塔那摩 7 ns
+关塔那摩湾 5 ns
+关塞 3 n
+关境 8 n
+关壮缪 3 nr
+关外 330 s
+关天关 3 nr
+关天培 13 nr
+关夫子 17 nr
+关头 592 n
+关好 3 v
+关子 45 n
+关子岭 3 nr
+关孝和 2 nr
+关学曾 5 nr
+关宁兵 123 nr
+关宁军 10 nr
+关宁精 5 nr
+关安基 69 nr
+关宏达 3 nr
+关定 3 v
+关宝慧 3 nr
+关家庄 2 nr
+关将军 3 nr
+关尹子 4 nr
+关履权 5 nr
+关山 578 ns
+关山万里 3 ns
+关山月 17 nr
+关山超递 3 nr
+关山迢递 3 l
+关山重重 3 n
+关山阻隔 3 n
+关岛 240 ns
+关岭 4 ns
+关岭境 2 n
+关岭布依族苗族自治县 2 ns
+关工委 3 nt
+关帝 33 n
+关帝山 5 nr
+关帝庙 105 nr
+关帝开 2 nr
+关帝爷 8 nr
+关帝祖 2 nr
+关平 65 n
+关平入 2 n
+关平告 2 n
+关平引 2 nr
+关平恐 2 nr
+关平银 2 nr
+关广富 257 nr
+关应麟 2 nr
+关底 3 n
+关庙 3 n
+关张 28 n
+关得 3 v
+关得密 2 nr
+关德兴 3 nr
+关德辉 3 nr
+关心 3261 n
+关心伟 3 nr
+关心体贴 3 n
+关心国 9 n
+关心妍 3 nr
+关心群众 3 n
+关心舜 2 nr
+关心集体 3 n
+关志华 3 nr
+关念 7 n
+关怀 697 nr
+关怀备至 16 nr
+关怀面 3 nr
+关情脉脉 3 n
+关意权 2 n
+关成败 2 nr
+关押 338 v
+关押情况 3 n
+关拔寨 7 nr
+关掉 80 v
+关文 19 n
+关文捧 2 nr
+关文献 2 nr
+关文运 2 nr
+关断 3 v
+关明梅 136 nr
+关景华 2 nr
+关有 3 v
+关朝银 2 nr
+关木通 3 nr
+关本 3 n
+关本忠弘 2 nr
+关机 104 n
+关机器 3 n
+关机时 3 n
+关机闹钟 3 n
+关村 3 n
+关村坝 3 nr
+关来关去 3 l
+关某休 2 nr
+关栅 2 n
+关栈 3 n
+关格 3 n
+关楼 3 n
+关死 3 v
+关水 3 n
+关汉卿 60 nr
+关沉伏 2 nr
+关河 9 ns
+关治瀛 8 nr
+关泉群 2 nr
+关法 3 n
+关法玛 2 nr
+关注 5229 v
+关注度 26 n
+关注点 42 n
+关津 3 ns
+关津制 2 nr
+关津识 3 nr
+关洪野 128 nr
+关海山 3 ns
+关海涛 2 nr
+关涉 81 v
+关淑仪 3 nrfg
+关淑怡 3 i
+关渡 3 v
+关渡庙 3 nr
+关渭贞 9 i
+关满 3 v
+关灯 19 n
+关照 334 p
+关爱 254 v
+关爷 4 n
+关牧村 4 nr
+关王 2 n
+关王爷 5 nr
+关琴 2 n
+关白 3 v
+关白附 3 nr
+关百战 5 n
+关益全 2 nr
+关相云 162 nr
+关着 3 p
+关破秦 2 nr
+关碍 3 n
+关礼杰 3 nr
+关禁 2 v
+关禁闭 7 n
+关秀娟 3 nrfg
+关秀媚 3 nr
+关税 578 n
+关税区 7 n
+关税及贸易总协定 26 nz
+关税同盟 3 nt
+关税壁垒 21 n
+关税法 5 n
+关税率 5 n
+关穴通 2 nr
+关窗 6 n
+关窗户 3 nr
+关系 32105 n
+关系不大 3 l
+关系人 629 n
+关系史 52 n
+关系妄想 3 l
+关系密切 3 nr
+关系式 57 n
+关系恶化 3 n
+关系户 32 n
+关系数据 3 n
+关系数据库 13 n
+关系暧昧 3 nr
+关系正常 3 nr
+关系法 33 n
+关系紧张 3 l
+关系网 39 n
+关系融洽 3 nr
+关系词 3 n
+关系逻辑 3 n
+关索 8 v
+关索李 7 nr
+关索杨 8 nr
+关紧 18 v
+关统 3 n
+关羽 230 nr
+关羽皆 2 nr
+关老爷 9 nr
+关者王 3 nr
+关联 883 ns
+关联失效 3 n
+关联度 19 n
+关联性 16 n
+关联方 89 n
+关联矩阵 2 nr
+关联系数 3 n
+关联系统 3 n
+关联能 3 j
+关联词 6 n
+关肃霜 5 nr
+关肇直 2 nr
+关胜交 2 n
+关胜勒 2 nr
+关胜寨 2 nr
+关胜引 7 nr
+关胜正 2 nr
+关胜见 3 nr
+关脉 2 n
+关节 890 n
+关节炎 142 n
+关节点 11 n
+关节病 24 n
+关节痛 28 n
+关节盘 3 n
+关节窝 3 n
+关节结节 3 n
+关节轴承 3 n
+关节镜 3 n
+关芝琳 3 ns
+关西 84 ns
+关西出将 3 n
+关西地区 3 ns
+关说 3 n
+关贸 3 n
+关贸总协定 4 nz
+关赋百 2 nr
+关起 3 v
+关起门来 3 l
+关路圻 256 nr
+关辽民 2 nr
+关过 3 p
+关迎敌 2 nr
+关进 16 v
+关进去 3 v
+关进来 6 nr
+关进牢 4 nr
+关连 81 v
+关连性 3 n
+关道 2 v
+关铝 4 n
+关锋 13 n
+关锦鹏 5 nr
+关键 5721 n
+关键人物 3 n
+关键件 3 n
+关键作用 3 n
+关键因素 3 nr
+关键在于 3 n
+关键处 7 n
+关键字 151 n
+关键帧 3 nr
+关键性 111 n
+关键所在 3 n
+关键技术 7 n
+关键时刻 3 n
+关键时期 3 n
+关键期 13 n
+关键步骤 3 n
+关键点 36 n
+关键环节 3 n
+关键球 3 n
+关键码 3 n
+关键设备 3 n
+关键词 116 n
+关键部件 2 n
+关键部位 3 n
+关键问题 8 n
+关镇 8 n
+关长 15 n
+关长林 3 nr
+关门 527 n
+关门主义 39 n
+关门养虎 3 n
+关门声 3 n
+关门大吉 8 ns
+关门打狗 7 n
+关门捉贼 3 i
+关门歇业 3 n
+关门落闩 3 n
+关门闭户 14 n
+关门闭窗 3 n
+关闪存 2 n
+关闭 1892 v
+关闭不全 3 l
+关闭电源 2 n
+关闭程序 3 n
+关闭系统 3 n
+关闸 7 n
+关防 98 n
+关陆 2 n
+关陇川 2 nr
+关陇清 3 nr
+关陕道 2 nr
+关陵 19 n
+关陵行 2 nr
+关隐达 4 nr
+关隘 120 n
+关露 109 v
+关顺田 3 nr
+关顾 48 v
+关顾之 2 nr
+关颖珊 8 i
+关鸿羽 3 nr
+关黄陈 6 nr
+关龙蓬 2 nr
+关龙逢 7 nr
+兴 4294 v
+兴业 70 n
+兴业县 4 n
+兴业电 3 n
+兴业银行 5 nt
+兴中会 104 j
+兴举 3 v
+兴义 27 n
+兴义市 7 ns
+兴之所至 3 i
+兴云布雨 3 nr
+兴云致雨 3 i
+兴亡 125 v
+兴亡史 2 n
+兴亡祸福 3 i
+兴亡继绝 3 i
+兴仁 3 nr
+兴仁县 3 ns
+兴会 20 n
+兴会淋漓 3 l
+兴修 201 v
+兴修水利 3 nz
+兴元 28 n
+兴元星辰 3 n
+兴兵 157 n
+兴兵动众 3 i
+兴农 3 nz
+兴农网 3 nz
+兴冲冲 197 z
+兴凯湖 26 ns
+兴利 21 ns
+兴利除害 7 l
+兴利除弊 13 i
+兴办 378 v
+兴办事业 3 n
+兴匆匆 3 z
+兴化 73 v
+兴化县 3 ns
+兴化市 8 ns
+兴化戏 3 n
+兴华 27 nz
+兴华路 3 ns
+兴南 10 ns
+兴县 36 ns
+兴发 31 v
+兴发街 3 n
+兴叹 55 v
+兴味 74 n
+兴味盎然 3 i
+兴味索然 15 i
+兴和 5 ns
+兴和县 2 ns
+兴嘉 3 ns
+兴国 839 ns
+兴国县 27 ns
+兴国安邦 3 nt
+兴城 49 ns
+兴城县 3 ns
+兴城市 22 ns
+兴复 3 v
+兴复不浅 3 i
+兴大 24 a
+兴头 122 v
+兴头上 3 l
+兴头很大 3 nr
+兴奋 2575 v
+兴奋不已 40 i
+兴奋剂 151 n
+兴奋异常 3 i
+兴奋性 55 n
+兴奋期 2 n
+兴奋点 21 n
+兴如嚼蜡 3 i
+兴妖作乱 3 i
+兴妖作孽 3 n
+兴妖作怪 4 i
+兴威 2 ns
+兴学 26 n
+兴宁 21 ns
+兴宁区 3 ns
+兴宁县 2 ns
+兴宁市 11 ns
+兴安 118 ns
+兴安区 3 ns
+兴安县 24 ns
+兴安岭 62 ns
+兴安盟 25 ns
+兴安省 3 ns
+兴家立业 4 n
+兴宾区 3 ns
+兴富 3 a
+兴尽而返 3 i
+兴山 299 ns
+兴山区 3 ns
+兴山县 265 ns
+兴工 11 n
+兴师 38 n
+兴师动众 71 n
+兴师问罪 29 i
+兴平 29 ns
+兴平县 4 ns
+兴平市 3 ns
+兴庆 57 ns
+兴庆区 3 ns
+兴庆宫 10 ns
+兴废 3 v
+兴废存之 3 i
+兴废继绝 3 i
+兴建 2148 v
+兴微继绝 3 i
+兴德 3 ns
+兴文 9 nz
+兴文匽武 3 v
+兴文县 3 ns
+兴旺 357 ns
+兴旺发达 70 ns
+兴旺繁荣 3 nr
+兴替 12 v
+兴林 6 ns
+兴桑养蚕 3 nr
+兴海 3 ns
+兴海县 4 ns
+兴澄 10 z
+兴灭 3 v
+兴灭继绝 3 i
+兴犹未尽 10 i
+兴盛 410 nz
+兴筑 3 n
+兴绿原 3 ns
+兴致 442 v
+兴致勃勃 213 i
+兴致淋漓 3 i
+兴致索然 3 i
+兴落 3 v
+兴衰 723 v
+兴衰史 6 n
+兴衰存亡 5 l
+兴衰成败 28 l
+兴衰起伏 3 l
+兴观群怨 3 i
+兴许 108 v
+兴讼 3 v
+兴词构讼 3 l
+兴象 3 n
+兴起 1950 v
+兴趣 3955 n
+兴趣不大 3 a
+兴趣十足 3 i
+兴趣小组 3 n
+兴趣正浓 3 l
+兴趣测验 3 n
+兴趣浓厚 3 i
+兴趣爱好 3 a
+兴趣班 10 v
+兴趣盎然 10 i
+兴趣缺失 3 i
+兴趣缺缺 3 i
+兴达 2 v
+兴邦 11 ns
+兴邦立国 3 ns
+兴隆 232 ns
+兴隆县 9 ns
+兴隆台区 3 ns
+兴隆山 11 ns
+兴隆村 3 ns
+兴隆洼 4 ns
+兴隆路 3 ns
+兴革 10 n
+兴风作浪 54 i
+兴高彩烈 3 i
+兴高采烈 286 i
+兵 16574 n
+兵丁 254 n
+兵不厌权 3 l
+兵不厌诈 25 i
+兵不接刃 3 i
+兵不污刃 3 i
+兵不由将 3 i
+兵不血刃 45 i
+兵不雪刃 3 i
+兵临 61 v
+兵临城下 54 i
+兵书 214 n
+兵乱 20 n
+兵事 3 n
+兵兵 3 n
+兵凶战危 10 i
+兵出无名 3 i
+兵刃 1841 n
+兵刃相接 3 i
+兵分 3 n
+兵分二路 3 n
+兵制 211 n
+兵力 2452 n
+兵劲城固 3 i
+兵勇 57 n
+兵卒 114 n
+兵变 195 n
+兵员 131 n
+兵味 3 n
+兵哥 3 n
+兵哥哥 3 n
+兵器 1569 n
+兵器工业 3 n
+兵器工业集团公司 3 nt
+兵器库 3 n
+兵器装备集团公司 3 nt
+兵器谱 3 n
+兵团 1764 n
+兵团农二师 2 nt
+兵圣 7 ns
+兵在其颈 3 n
+兵士 414 n
+兵备 3 n
+兵备道 26 n
+兵多将广 3 i
+兵多者败 3 l
+兵学 24 n
+兵家 167 n
+兵家必争 3 l
+兵家必争之地 347 i
+兵富难战 3 i
+兵工 34 n
+兵工厂 138 n
+兵工署 3 nt
+兵差 4 n
+兵库 9 n
+兵库县 12 ns
+兵强则灭 3 i
+兵强将勇 3 i
+兵强马壮 49 i
+兵役 170 n
+兵役制 20 n
+兵役制度 3 n
+兵役法 22 n
+兵役节 3 n
+兵微将寡 3 i
+兵患 3 n
+兵慌马乱 8 i
+兵戈 30 n
+兵戈扰攘 3 i
+兵戈相见 3 i
+兵戎 14 n
+兵戎相见 37 i
+兵拏祸结 3 n
+兵挫地削 3 vn
+兵操 10 n
+兵数 3 n
+兵无常势 2 i
+兵无常形 3 i
+兵无血刃 3 i
+兵曹 11 n
+兵未血刃 3 i
+兵权 293 n
+兵来将挡 26 i
+兵殷 3 v
+兵油子 25 n
+兵法 430 n
+兵法云 3 n
+兵源 59 n
+兵火 283 n
+兵灾 3 n
+兵燹 47 n
+兵甲 3 n
+兵略 3 n
+兵疲意阻 3 i
+兵痞 24 n
+兵痞子 3 n
+兵祸 3 n
+兵种 178 n
+兵种部 10 n
+兵科 3 n
+兵站 73 n
+兵站部 9 n
+兵符 59 n
+兵籍 3 n
+兵籍卡 3 n
+兵籍号码 3 n
+兵籍表 3 n
+兵粮 3 n
+兵舰 13 n
+兵船 87 n
+兵荒马乱 120 i
+兵营 190 n
+兵营区 3 n
+兵蜂 3 n
+兵行诡道 2 i
+兵要地志 13 n
+兵谏 36 v
+兵谏亭 3 i
+兵豆 3 n
+兵败如山倒 27 i
+兵败将亡 3 i
+兵贵先声 3 i
+兵贵神速 21 i
+兵车 30 n
+兵车之会 3 n
+兵车行 3 nt
+兵连祸接 3 i
+兵连祸结 15 i
+兵部 1332 n
+兵闻拙速 3 i
+兵阵 45 n
+兵革 19 n
+兵革互兴 3 l
+兵革满道 3 l
+兵饷 3 n
+兵马 820 n
+兵马俑 91 n
+兵马俑博物馆 3 n
+兵马未动 2 i
+兵骄将傲 3 i
+其 71322 r
+其一 884 r
+其一据 3 l
+其三 191 r
+其中 34173 r
+其中奇 3 i
+其乐不穷 3 i
+其乐无穷 23 i
+其乐融融 32 nz
+其乐陶陶 3 nz
+其事 3 r
+其二 362 r
+其人 3 r
+其他 25753 r
+其他人 613 rr
+其他同学 3 l
+其他应计 3 l
+其他支出 3 i
+其他用户 3 l
+其他词汇 3 l
+其他费用 3 l
+其他软件 3 l
+其他配件 3 n
+其余 4454 r
+其余不问 3 l
+其余部分 3 l
+其内 336 f
+其利断金 6 l
+其势凶凶 3 i
+其势汹汹 3 i
+其后 776 c
+其味无穷 3 i
+其善不赏 3 i
+其四 84 r
+其外 3 c
+其妻 71 r
+其子 332 r
+其它 7498 r
+其它窗口 3 i
+其实 11950 d
+其实不然 39 l
+其实质 3 l
+其实难副 3 i
+其家 3 r
+其属下 3 l
+其应如响 3 i
+其应若响 3 i
+其志可嘉 3 nz
+其怪自败 3 i
+其恶必罚 3 i
+其情可悯 3 nr
+其意 93 d
+其意自现 3 i
+其文 3 r
+其时 764 r
+其本质 3 n
+其次 2777 r
+其父 479 r
+其管辖 3 n
+其职 58 nz
+其言 3 r
+其言也善 10 i
+其计不售 3 l
+其貌不扬 31 i
+其身正 3 d
+其道无由 3 l
+其里 3 r
+其间 1784 r
+具 6228 v
+具体 9769 a
+具体任务 3 n
+具体位置 3 n
+具体做法 3 v
+具体内容 6 n
+具体分析 3 l
+具体办法 3 l
+具体劳动 7 l
+具体化 103 v
+具体化起 3 l
+具体地址 3 n
+具体地说 54 l
+具体型号 3 v
+具体安排 3 n
+具体实施 3 l
+具体思维 3 l
+具体性 18 n
+具体情况 22 l
+具体意见 3 v
+具体指导 3 v
+具体措施 3 n
+具体操作 3 l
+具体方法 3 l
+具体条件 3 l
+具体来讲 7 c
+具体来说 39 c
+具体步骤 3 l
+具体物 3 l
+具体而微 3 l
+具体表 3 v
+具体表现 3 l
+具体说来 77 v
+具佳 3 a
+具保 3 v
+具像 3 v
+具名 93 v
+具备 4224 v
+具备条件 3 n
+具定 3 v
+具情 3 a
+具报 3 v
+具文 3 v
+具有 25225 v
+具有专长 3 l
+具有活力 3 l
+具有特征 3 n
+具有生气 3 l
+具本承 3 l
+具结 7 v
+具结书 3 v
+具结悔过 3 l
+具象 32 v
+具象化 2 v
+具象化系 3 n
+具领 2 v
+典 1614 zg
+典业 3 n
+典出人 3 n
+典则俊雅 3 z
+典卖 13 v
+典型 3430 n
+典型人物 3 n
+典型值 3 n
+典型化 6 n
+典型性 32 n
+典型示范 3 n
+典型群 3 n
+典型调查 3 v
+典型过程 3 n
+典妻鬻子 3 v
+典当 94 a
+典当业 9 n
+典当行 3 v
+典押 9 v
+典故 186 n
+典狱 62 n
+典狱官 3 n
+典狱长 3 n
+典礼 814 n
+典章 347 n
+典章制度 3 n
+典章文物 3 n
+典籍 314 n
+典范 316 n
+典范态射 3 n
+典范赋值 3 vn
+典藉 3 a
+典藏 10 n
+典藏本 3 n
+典藏版 3 n
+典试 3 n
+典试委员 3 n
+典身卖命 3 n
+典鉴 3 n
+典雅 390 a
+典雅无华 3 n
+兹 508 rg
+兹事体大 10 i
+兹将 3 n
+兹曼 70 nrt
+兹洛夫 3 nrt
+兹罗提 3 nrt
+养 3311 v
+养上 3 v
+养下来 3 l
+养不起 3 v
+养乐多 3 l
+养亲 3 n
+养人 20 n
+养伤 122 v
+养儿 3 nr
+养儿备老 3 nr
+养儿育 6 l
+养儿防老 11 n
+养兔场 2 n
+养公田 2 nr
+养兵 39 nr
+养兵之道 3 i
+养兵千日 11 i
+养其子 2 nr
+养其性 2 nr
+养养 3 v
+养军千日 2 i
+养分 202 n
+养勇德 16 nr
+养呢 3 n
+养命 2 vn
+养地 3 n
+养地作物 3 l
+养士 10 n
+养士之 2 nr
+养大 3 nr
+养女 76 n
+养女杳然 3 nr
+养好兵 2 nr
+养威蓄锐 3 nr
+养媳 3 n
+养媳妇 2 nr
+养子 184 n
+养实兄 3 nr
+养家 61 n
+养家活口 2 n
+养家糊口 42 l
+养家费 3 nr
+养尊处优 72 i
+养廉 19 nr
+养廉银 3 nr
+养得 3 v
+养德斋 54 nr
+养心 21 n
+养心殿 183 nr
+养心汤 2 nr
+养心益 2 nr
+养志 3 nr
+养性 30 n
+养性修 2 nr
+养性延 8 nr
+养性殿 3 nr
+养息 11 n
+养息牧 2 nr
+养成 809 v
+养成教育 3 l
+养成类 3 n
+养护 143 v
+养护中心 3 n
+养护段 3 n
+养护费 2 n
+养料 106 n
+养新录 2 nr
+养晦 3 v
+养晦韬光 3 i
+养条狗 3 nr
+养正兄 9 nr
+养正轩 2 nr
+养殖 2675 vn
+养殖业 141 n
+养殖区 4 n
+养殖厂 3 n
+养殖场 49 n
+养殖户 17 n
+养殖池 3 n
+养殖网 3 n
+养殖面积 3 n
+养母 47 nr
+养民 17 n
+养气 30 n
+养汉 3 nr
+养活 383 vn
+养济院 5 n
+养父 84 n
+养父母 19 nr
+养牛 333 nr
+养牛业 37 n
+养牛场 3 n
+养物丰 2 nr
+养狐场 2 n
+养猪 412 n
+养猪业 22 n
+养猪人 3 n
+养猪厂 3 n
+养猪场 23 n
+养猪户 27 n
+养猪村 3 nr
+养猫 2 n
+养生 200 v
+养生丧死 3 i
+养生之道 23 i
+养生堂 2 nr
+养生学 3 n
+养生术 6 n
+养生茶 3 nr
+养生送死 3 i
+养生送终 3 i
+养由基 5 nr
+养畜 32 n
+养病 155 n
+养痈成患 3 i
+养痈贴患 3 i
+养痈贻患 3 v
+养痈遗患 5 i
+养痛畜疽 3 n
+养痛贻害 3 vn
+养目镜 3 nr
+养眼 31 n
+养神 78 n
+养禽 30 n
+养精畜锐 3 i
+养精蓄锐 40 i
+养羊 13 nr
+养羊业 45 nr
+养老 651 nr
+养老保险 3 n
+养老保险费 3 n
+养老保险金 14 n
+养老送终 14 i
+养老金 99 nr
+养老院 28 nr
+养老险 3 n
+养而不教 3 i
+养肥 3 n
+养育 191 vn
+养育之恩 37 nr
+养育恩 3 nr
+养育院 3 n
+养胃 3 n
+养花 4 n
+养草 2 n
+养荣丸 5 nr
+养营汤 4 nr
+养虎为患 3 i
+养虎伤身 3 i
+养虎留患 3 i
+养虎自啮 3 v
+养虎自残 3 i
+养虎自毙 3 i
+养虎自齧 3 v
+养虎遗患 3 i
+养虎饴患 3 i
+养虫室 3 n
+养虫工厂 3 n
+养虺成蛇 3 v
+养蚕 63 nr
+养蚕业 18 n
+养蚕户 3 n
+养蚕织 2 n
+养蜂 62 nr
+养蜂业 9 nr
+养蜂人 5 nr
+养蜂场 2 n
+养蜜蜂 2 nr
+养蟹 4 n
+养血 3 v
+养貂业 2 nr
+养贤纳士 3 nr
+养起 3 v
+养起来 3 l
+养路 12 n
+养路工 13 nr
+养路费 37 n
+养身 14 v
+养身之道 3 i
+养车 3 n
+养锐蓄威 3 nr
+养阴润 7 nr
+养阴清 21 nr
+养阴生 2 nr
+养阴益 3 nr
+养音九皋 3 nr
+养颜护 2 nr
+养颜类 2 nr
+养马业 6 nr
+养马岛 3 nr
+养驯 13 nr
+养鱼 141 n
+养鱼业 7 n
+养鱼场 5 n
+养鱼塘 3 nr
+养鱼户 3 n
+养鱼池 6 nr
+养鳗 4 n
+养鸟 3 n
+养鸡 50 n
+养鸡业 9 n
+养鸡场 282 n
+养鸡户 4 n
+养鸡房 3 n
+养鸭 9 n
+养鸭人家 3 n
+养鸭户 3 n
+养鹰飏去 3 nr
+养鹰鹞 2 nr
+养鹿业 3 nr
+兼 7927 v
+兼人之勇 3 i
+兼任 1004 v
+兼任教师 3 n
+兼优 11 v
+兼修 3 v
+兼具 136 v
+兼办 31 v
+兼包并容 3 i
+兼包并畜 3 n
+兼及 97 v
+兼取 3 v
+兼听则明 6 i
+兼售 3 v
+兼善 3 v
+兼善天下 3 i
+兼备 1063 v
+兼学 12 v
+兼容 296 v
+兼容并包 44 i
+兼容并蓄 25 i
+兼容性 71 l
+兼容性问题 6 l
+兼容机 21 i
+兼容问题 2 l
+兼差 5 v
+兼并 893 v
+兼并案 5 i
+兼并热 3 i
+兼并额 3 i
+兼弱攻昧 3 i
+兼得 44 v
+兼性离子 3 i
+兼性营养 3 v
+兼收 58 v
+兼收博采 3 i
+兼收并录 3 i
+兼收并畜 3 n
+兼收并蓄 39 i
+兼收并采 3 i
+兼施 24 v
+兼有 687 v
+兼朱重紫 3 i
+兼权尚计 3 i
+兼权熟计 3 i
+兼毫 3 v
+兼济 11 v
+兼爱 3 v
+兼爱无私 3 i
+兼理 3 v
+兼用 201 v
+兼用型 8 n
+兼祧 3 n
+兼程 42 v
+兼程前进 3 i
+兼程并进 3 i
+兼筹并顾 3 i
+兼管 141 v
+兼类 3 n
+兼而有之 61 i
+兼职 594 v
+兼职教师 3 l
+兼职网 3 i
+兼营 171 v
+兼营农业 3 n
+兼葭倚玉 3 nr
+兼葭秋水 3 v
+兼行 3 v
+兼览博照 3 i
+兼语 3 v
+兼课 5 v
+兼通 3 v
+兼项 13 v
+兼顾 651 v
+兽 2047 n
+兽中之王 3 nz
+兽亚纲 6 n
+兽人 3 n
+兽人族 3 nz
+兽兵 3 n
+兽力 3 n
+兽力车 3 n
+兽化 3 n
+兽医 136 n
+兽医学 45 n
+兽医局 4 n
+兽医站 14 n
+兽医系 3 n
+兽医院 3 n
+兽困则噬 3 l
+兽圈 3 n
+兽媒花 3 n
+兽孔目 2 n
+兽心 3 n
+兽心人面 3 n
+兽性 47 n
+兽性大发 3 nz
+兽栏 3 n
+兽槛 3 n
+兽欲 19 n
+兽王 5 n
+兽环 3 n
+兽用 4 n
+兽皮 93 n
+兽穴 3 n
+兽穷则齧 3 n
+兽窝 3 n
+兽类 160 n
+兽群 3 n
+兽聚鸟散 3 n
+兽脂 3 n
+兽药 14 n
+兽药厂 3 n
+兽行 8 n
+兽迒鸟迹 3 n
+兽面 45 n
+兽骨 48 n
+兾 4 zg
+冀 412 ns
+冀东 94 ns
+冀东水泥 6 nt
+冀中 80 ns
+冀中南 4 ns
+冀中平原 14 ns
+冀二州 2 nr
+冀六州 5 ns
+冀其成长 3 nr
+冀北 7 ns
+冀北山 5 ns
+冀北空群 3 j
+冀华会 2 nt
+冀南 79 ns
+冀南区 3 ns
+冀县 27 ns
+冀四州 4 ns
+冀宁 6 ns
+冀州 169 ns
+冀州市 3 ns
+冀望 8 nr
+冀求 3 nr
+冀热察 4 nr
+冀热辽 2 ns
+冀考委 2 nr
+冀蒙采纳 3 nr
+冀西 26 ns
+冀馆陶 3 n
+冀魏县 3 nr
+冀鲁 4 ns
+冀鲁豫 47 nr
+冁然而笑 3 v
+冂 4 zg
+冃 3 zg
+内 50204 n
+内三元 3 nr
+内丘 4 ns
+内丘县 3 ns
+内业 9 n
+内东裕 2 nr
+内中 3 s
+内丹 11 ns
+内丹术 5 n
+内丹派 2 nr
+内丹炼 2 nr
+内主 3 n
+内乌肯 2 nr
+内乡 34 n
+内乡县 8 ns
+内书堂 6 n
+内乱 423 n
+内乱外患 3 i
+内乱罪 3 i
+内争 3 n
+内亘 3 v
+内亲 4 n
+内人 41 n
+内伊 8 nrt
+内伤 165 n
+内伤发热 3 n
+内伶仃岛 4 ns
+内伸 3 v
+内体 3 n
+内体壁 2 n
+内体小泡 3 n
+内侄 40 n
+内侄女 4 n
+内侍 243 n
+内侧 326 f
+内侵 3 v
+内修外攘 3 i
+内债 15 n
+内倾 3 b
+内像素 3 n
+内兄 21 n
+内克 19 ns
+内公切线 3 n
+内六角 3 ns
+内共生 3 n
+内关 3 ns
+内典 3 ns
+内出血 32 n
+内分 3 n
+内分泌 529 n
+内分泌学 3 n
+内分泌科 52 n
+内分泌腺 62 n
+内切圆 3 nr
+内利亚 3 ns
+内利斯 23 ns
+内制 3 n
+内力 1557 n
+内功 1167 n
+内加尔 3 ns
+内务 314 n
+内务司法委员会 258 nt
+内务府 3 nt
+内务条令 3 n
+内务柜 3 n
+内务部 51 nt
+内务部长 18 n
+内务部队 19 nt
+内助 9 v
+内助之贤 3 nr
+内劲震 2 nr
+内勒 3 nrt
+内勤 11 n
+内勤人员 3 n
+内包装 4 n
+内化 22 n
+内化力 4 n
+内半缩醛 3 n
+内华达 89 ns
+内华达州 83 ns
+内卡河 8 ns
+内卡钳 3 nr
+内卷 3 n
+内厅 3 n
+内参 241 n
+内史 3 n
+内史密斯 3 ns
+内司委 6 n
+内向 190 n
+内向型 8 b
+内向电流 3 n
+内含 189 v
+内含子 3 nr
+内含甜蜜 16 z
+内吸性 2 n
+内哄 16 v
+内哥罗 8 nrt
+内啡肽 4 n
+内囊 3 n
+内因 110 n
+内园 3 n
+内固醇 3 n
+内图 9 n
+内圆 3 n
+内圆外方 3 n
+内圈 3 n
+内圣外王 5 nr
+内在 724 b
+内在化 3 n
+内在性 3 n
+内在激励 3 l
+内在美 3 nr
+内在联系 3 n
+内在论 3 n
+内地 2181 n
+内地工业 3 n
+内地版 3 n
+内地税 32 j
+内场 7 n
+内坜 3 ns
+内城 781 ns
+内埔 3 ns
+内堂奔 3 nr
+内塔尼亚胡 95 nrt
+内塞斯 5 ns
+内墙 14 n
+内墙漆 3 n
+内墙砖 3 n
+内壁 166 n
+内外 1811 s
+内外交困 61 i
+内外勾结 3 i
+内外呼应 3 l
+内外墙 5 n
+内外夹击 20 i
+内外夹功 3 i
+内外夹攻 31 i
+内外并重 3 i
+内外援 2 n
+内外有别 8 n
+内外科 9 n
+内外线 3 n
+内外贸 2 n
+内外资 3 n
+内外跤困 3 vn
+内外部 14 nt
+内外销 3 n
+内夫 13 n
+内奸 62 n
+内妹 3 n
+内嫂 3 n
+内子 3 n
+内存 884 n
+内存不足 3 i
+内存价格 3 n
+内存保护 3 n
+内存储器 10 n
+内存卡 3 nr
+内存地址 3 n
+内存大小 3 n
+内存容量 3 n
+内存整理 3 n
+内存条 3 n
+内存模块 5 n
+内存空间 3 n
+内孙 3 n
+内学 3 n
+内宅 84 n
+内官监 4 nr
+内定 27 n
+内审 4 n
+内审员 3 n
+内室 121 n
+内宫城 2 ns
+内宫监 2 nr
+内家 96 n
+内家剑 2 nr
+内容 15468 n
+内容丰富 3 nr
+内容健康 3 nr
+内容分析 3 l
+内容提要 3 n
+内容摘要 3 n
+内容效度 3 n
+内容栏 3 n
+内容梗概 3 n
+内容空洞 3 n
+内容简介 3 nr
+内宾 3 ns
+内寄生 14 nr
+内对口器 3 n
+内射 2 n
+内射分解 3 n
+内小臣 4 nr
+内尔 24 ns
+内尔松 3 nr
+内尚存 2 nr
+内层 87 n
+内层轨道 3 n
+内屋 8 n
+内山 7 ns
+内岳 3 ns
+内峻外和 3 i
+内嵌 3 v
+内嵌字幕 3 n
+内嵌式 3 n
+内币 3 n
+内布拉 3 nrt
+内布拉斯加 10 ns
+内布拉斯加州 16 ns
+内希特 7 nr
+内幕 139 n
+内幕消息 3 n
+内幕重重 3 n
+内平 3 n
+内应 145 n
+内应力 3 n
+内府 65 n
+内庭 11 n
+内廷 3 n
+内廷太监 2 nr
+内廷宝 2 nr
+内廷尚 2 nr
+内廷紫 2 nr
+内建 3 ns
+内建函数 3 n
+内建势 3 n
+内建式 3 n
+内引外联 3 n
+内弘文 4 nr
+内弟 36 n
+内张力 3 n
+内弦 3 n
+内当家 6 n
+内录 3 n
+内录机 3 n
+内影像 3 n
+内径 25 n
+内德 4 nrt
+内德维 2 nr
+内心 2081 n
+内心世界 3 n
+内心深处 3 i
+内心独白 3 i
+内心话 3 n
+内忧 32 n
+内忧外侮 3 n
+内忧外患 46 i
+内思 3 n
+内急 14 a
+内患 3 n
+内情 108 n
+内情不详 3 i
+内感受器 3 n
+内战 1811 n
+内戮 3 v
+内托 4 n
+内扣 3 n
+内挂版 3 n
+内掌柜 2 nr
+内控 21 b
+内插法 23 n
+内援 12 n
+内摩擦 3 l
+内收蛋白 3 n
+内放 3 n
+内政 633 n
+内政外交 3 n
+内政部 49 nt
+内政部长 56 n
+内敛 46 v
+内文 8 n
+内斗 3 n
+内斜 3 n
+内斜视 2 n
+内斯 54 ns
+内斯堡 3 ns
+内斯塔 28 nrt
+内斯尔 2 nrt
+内斯库 4 nr
+内斯特 15 nrt
+内旋转 3 nr
+内日峰 2 ns
+内昆线 3 nr
+内明 3 n
+内景 23 n
+内服 97 n
+内服药 11 n
+内杜斯 16 nrt
+内果皮 11 n
+内柔 3 ns
+内柔外刚 3 i
+内查外调 3 n
+内柱 3 n
+内标 4 n
+内栖凤 2 nr
+内核 178 n
+内核模块 3 n
+内格夫 3 nr
+内格夫沙漠 2 ns
+内格林 2 nr
+内格罗 9 nr
+内格罗河 14 ns
+内梯透镜 3 n
+内棺 16 n
+内模 3 n
+内模共振 3 i
+内正毅 2 nr
+内毒素 14 n
+内江 48 ns
+内江市 10 ns
+内江街 3 ns
+内河 1265 ns
+内河航运 3 n
+内河运输 3 j
+内沿 3 s
+内波 21 n
+内流 3 n
+内流区域 3 n
+内流河 26 ns
+内测 3 v
+内测号 3 n
+内海 47 ns
+内海地区 3 ns
+内消旋 2 n
+内涝 20 n
+内涵 1100 n
+内涵式 7 n
+内港 19 ns
+内湖 16 ns
+内湖区 3 ns
+内湖国中 3 ns
+内湖国小 3 n
+内源 16 n
+内源性 18 n
+内热 49 n
+内热阻 3 n
+内焰 9 n
+内燃 17 b
+内燃器 3 n
+内燃机 178 n
+内燃机车 30 n
+内特 25 nrt
+内犯 3 n
+内环 14 n
+内环线 4 n
+内环路 3 n
+内瓤 3 n
+内生 127 n
+内生孢子 3 n
+内生性 2 n
+内生植物 3 n
+内生菌根 3 n
+内电路 3 n
+内电阻 3 n
+内画 6 n
+内疚 194 a
+内疚感 8 n
+内痔 9 n
+内皮 45 n
+内皮层 3 n
+内皮素 3 n
+内皮细胞 3 n
+内益生 2 n
+内盐 3 n
+内监梁 3 nr
+内盖夫 2 n
+内盗 3 n
+内盛 3 nr
+内省 31 ns
+内省不疚 3 n
+内省法 3 n
+内眷 22 n
+内眼角 3 n
+内码 3 n
+内码转换 3 l
+内磺肽 3 n
+内禀方程 3 v
+内禀能垒 3 v
+内秀 11 nr
+内科 205 n
+内科主任 3 n
+内科医生 3 n
+内科手术 3 n
+内科病人 3 n
+内科病房 3 n
+内秦淮 2 nr
+内积 22 n
+内窥镜 32 n
+内篇 3 n
+内紧外松 3 n
+内线 181 n
+内线交易 3 n
+内绍夫 8 nr
+内经 64 n
+内维尔 27 nr
+内缘 18 n
+内网 4 n
+内网资源 3 n
+内罗华 3 nr
+内罗毕 74 ns
+内置 119 n
+内置在 3 n
+内置式 7 n
+内翠寒 2 nr
+内耗 42 n
+内耳 66 n
+内联 12 ns
+内联升 4 nr
+内联外引 3 n
+内联蛋白 3 n
+内聚 3 v
+内聚力 15 n
+内聚性 5 n
+内肽酶 3 n
+内胆 13 n
+内胎 20 n
+内能 94 n
+内脂 3 n
+内脏 437 n
+内脏器官 3 n
+内腔 17 n
+内膜 243 n
+内膜系统 3 n
+内膝体 3 i
+内臣 3 n
+内舱 3 n
+内营力 3 n
+内蒂 9 nrt
+内蒙 128 ns
+内蒙古 1425 ns
+内蒙古人民出版社 7 nt
+内蒙古军区 3 ns
+内蒙古地区 24 ns
+内蒙古大学 22 nt
+内蒙古自 3 ns
+内蒙古自治区 301 ns
+内蒙古自治区人民政府 5 nt
+内蒙古自治区公安厅 2 nt
+内蒙古草原 25 ns
+内蒙古高原 77 ns
+内蕴 47 n
+内藏 3 ns
+内藏式 3 n
+内藤 3 n
+内藤虎 2 nr
+内融合 3 n
+内螺纹 3 n
+内行 115 n
+内行人 8 n
+内行星 16 n
+内行话 3 n
+内衣 140 n
+内衣厂 3 n
+内衣展 3 n
+内衣店 3 n
+内衣模特 3 nr
+内衣秀 3 nr
+内衣网 3 n
+内衣裤 9 n
+内衬 29 n
+内装 3 n
+内裙 3 n
+内裤 108 n
+内视 9 n
+内视反听 3 i
+内角 9 n
+内角球 3 n
+内讧 810 v
+内设 347 n
+内证 3 n
+内话 2 n
+内详 3 v
+内调 3 n
+内质 3 n
+内质体 3 n
+内质网 46 n
+内贸 11 n
+内贸局 4 nt
+内贸部 8 nt
+内贼 3 n
+内贾德 5 nr
+内资 36 n
+内资股 3 n
+内赫尔 3 nr
+内踝 11 n
+内转换 3 i
+内转载 3 b
+内边 3 f
+内道 3 n
+内部 6937 f
+内部事务 3 n
+内部人员 3 n
+内部会计 3 n
+内部刊物 3 n
+内部化 2 n
+内部单位 3 n
+内部噪声 3 n
+内部测试 3 n
+内部消息 3 n
+内部监督 3 n
+内部矛盾 3 l
+内部空间 3 n
+内部管理 3 n
+内部结构 3 n
+内部网 6 n
+内部联系 3 n
+内部联网 3 n
+内部表征 3 n
+内部表象 3 n
+内部言语 3 n
+内部资料 3 n
+内酯 22 n
+内酰胺 3 n
+内酰胺酶 2 n
+内釉上皮 3 n
+内里 237 s
+内里费 3 n
+内野 3 n
+内野区 3 n
+内野手 3 n
+内铺 3 n
+内销 43 n
+内销品 3 n
+内销货 3 n
+内错角 3 n
+内镜 34 n
+内门 15 n
+内阁 2739 n
+内阁会议 3 n
+内阁制 107 n
+内阁大臣 65 nr
+内阁总理 90 n
+内防 3 n
+内阻 33 n
+内阿尔 2 nr
+内阿尔斯 2 nrt
+内陆 1116 n
+内陆国 43 n
+内陆地区 3 ns
+内陆河 42 n
+内陆海 10 n
+内陆湖 13 n
+内院 3 n
+内陷 3 n
+内隐记忆 3 n
+内隔 3 n
+内障 16 n
+内难 6 n
+内雕 3 n
+内需 167 n
+内面 34 f
+内页 3 n
+内项 3 n
+内顾之忧 3 i
+内食 3 n
+内饰 2 n
+内饰件 3 n
+内驱力 20 n
+内骨骼 14 n
+内鬼 3 n
+内黄 20 n
+内黄县 3 ns
+内龙模型 3 n
+内龙骨 3 n
+冇 3 zg
+冈 777 ns
+冈仁波齐峰 17 ns
+冈山 16 ns
+冈山县 5 ns
+冈山镇 3 ns
+冈岛 2 ns
+冈峦 5 nr
+冈峦起伏 3 nr
+冈崎 5 ns
+冈崎片段 3 nr
+冈底斯 3 nrt
+冈底斯冈 3 nrt
+冈底斯山脉 33 ns
+冈德 2 nrt
+冈村 26 ns
+冈比亚 68 ns
+冈比亚河 17 ns
+冈比西斯 12 ns
+冈特 4 nrt
+冈瓦纳 29 nrt
+冈田 3 nz
+冈田武史 2 nr
+冈石 3 ns
+冈纳 8 ns
+冈萨雷斯 15 nrt
+冈陵 3 ns
+冈陵起伏 3 nr
+冉 174 nr
+冉先菀 2 nr
+冉兴让 12 nr
+冉冉 202 nr
+冉冉上升 3 nr
+冉冉不绝 3 nr
+冉冉升起 3 nr
+冉斯登 3 nr
+冉森派 3 nr
+冉永平 12 nr
+冉璞计 2 nr
+冉细丛 2 nr
+冉闵灭 3 nr
+冉阿让 5 nr
+冉魏 18 nr
+册 1277 q
+册亨 3 n
+册亨县 2 ns
+册叶 3 n
+册子 89 n
+册封 312 v
+册数 4 n
+册文 3 n
+册立 356 v
+册页 27 n
+再 55507 d
+再一 3 d
+再三 628 d
+再三再四 13 i
+再上 3 d
+再上去 3 v
+再不其然 3 c
+再不去 3 v
+再不来 3 d
+再不然 3 d
+再世 41 nrt
+再为 3 c
+再也 3990 d
+再也不会 3 l
+再也不是 3 l
+再也不能 3 l
+再于 3 c
+再以 3 c
+再作冯妇 4 i
+再作道理 24 l
+再侵染 3 l
+再侵染源 3 l
+再保险 3 l
+再借不难 3 l
+再假定 3 l
+再做冯妇 3 i
+再做道理 3 l
+再入 3 v
+再其次 3 d
+再再 3 d
+再分 3 d
+再则 81 c
+再创 318 v
+再创新高 3 l
+再别 3 d
+再别康桥 3 nrt
+再制品 3 l
+再制盐 3 i
+再刻 3 d
+再剪 3 v
+再割 3 v
+再加 3 d
+再加之 15 c
+再压缩 2 l
+再启动 4 l
+再回首 3 i
+再多 3 d
+再好 3 d
+再好不过 3 l
+再好没有 3 i
+再娶 3 v
+再婚 24 v
+再婚者 3 n
+再嫁 46 v
+再嫁夫人 3 l
+再孕妇 3 n
+再定 3 d
+再审 39 v
+再寄 3 v
+再就业率 3 l
+再就是 99 c
+再帖 3 v
+再度 1255 d
+再延 3 v
+再往 3 d
+再循环 3 i
+再忙 3 d
+再快 3 d
+再慢 3 d
+再战 134 v
+再押 3 v
+再拜 136 v
+再挤 3 v
+再捡 3 v
+再接再励 3 l
+再接再历 3 l
+再接再厉 115 i
+再搬 3 v
+再摇 3 v
+再断言 3 i
+再有 745 v
+再来 3 d
+再来一个 3 d
+再植 32 v
+再植术 4 l
+再次 5293 d
+再次出现 3 v
+再次发生 3 i
+再测信度 3 n
+再混 3 v
+再混合物 3 l
+再演 3 v
+再煎 3 v
+再燃 3 v
+再版 93 v
+再版书 3 n
+再犯 84 v
+再现 501 v
+再现部 3 n
+再生 633 v
+再生之恩 2 l
+再生产 571 l
+再生侠 3 n
+再生制动 3 l
+再生力 8 l
+再生性 8 n
+再生父母 5 l
+再生稻 2 n
+再生纸 3 v
+再生缘 3 v
+再生胶 3 l
+再生能源 3 l
+再生资源 3 l
+再租 3 v
+再移 3 v
+再立 3 v
+再立新功 3 i
+再答 3 v
+再经 3 d
+再结晶 3 n
+再续 3 d
+再者 185 c
+再者说 13 c
+再而三 67 i
+再聊 3 v
+再聚合 3 i
+再融资 3 n
+再行 473 v
+再补 3 v
+再衰三竭 3 i
+再见 343 v
+再见面 3 d
+再触 3 v
+再认 25 v
+再认广度 3 l
+再讨 3 v
+再议 3 v
+再试一下 3 i
+再试一次 3 i
+再说 3065 c
+再说下去 3 l
+再读 3 v
+再谢 3 v
+再败 3 v
+再贴现 3 i
+再贴现率 2 n
+再赌 3 v
+再赔 3 v
+再赢 3 v
+再起 127 v
+再起波澜 3 i
+再过 3 c
+再运行 3 v
+再进一步 74 l
+再远 3 d
+再选 24 v
+再造 115 v
+再造之恩 5 l
+再造想象 3 l
+再造术 4 l
+再那里呢 3 n
+再配 3 v
+再醮 3 v
+再防雨 3 l
+再降 3 v
+再障 3 v
+冏 24 zg
+冐 3 zg
+冑 12 zg
+冒 5231 v
+冒上去 3 v
+冒上来 3 v
+冒假 3 v
+冒傻气 3 i
+冒充 332 v
+冒充货 3 n
+冒冒 3 v
+冒冒失失 38 i
+冒冒险 3 n
+冒出 3 v
+冒出来 3 v
+冒功 3 a
+冒升 3 v
+冒口 2 n
+冒号 12 n
+冒名 19 v
+冒名接脚 3 i
+冒名顶替 12 i
+冒大不韪 3 i
+冒天下之大不韪 32 i
+冒失 86 v
+冒失鬼 8 i
+冒头 8 v
+冒尖 15 n
+冒尖户 33 n
+冒往 3 v
+冒昧 101 a
+冒死 3 v
+冒气 6 n
+冒汗 64 v
+冒泡 15 v
+冒泡排序 4 i
+冒泡泡 2 n
+冒渎 24 v
+冒火 69 v
+冒烟 271 v
+冒然 3 z
+冒牌 34 v
+冒牌货 23 n
+冒犯 379 v
+冒犯之处 3 i
+冒用 19 v
+冒着危险 3 i
+冒称 3 v
+冒血 3 v
+冒认 3 v
+冒贷 3 n
+冒贷案 3 n
+冒起 3 v
+冒进 145 v
+冒里冒失 2 z
+冒险 856 n
+冒险主义 224 n
+冒险家 70 n
+冒险岛 3 n
+冒险性 41 n
+冒险游戏 3 n
+冒险犯难 3 i
+冒险王 3 n
+冒险篇 3 n
+冒险类 3 n
+冒险者 10 n
+冒险蛮干 3 i
+冒险记 3 n
+冒雨 91 v
+冒雪 3 n
+冒顶 6 n
+冒领 25 v
+冒风险 3 n
+冓 11 zg
+冕 82 nrt
+冕宁 4 nrt
+冕宁县 2 ns
+冕旒 5 n
+冕服 3 n
+冕牌玻璃 3 n
+冗 86 zg
+冗位 3 n
+冗余 15 a
+冗余参数 3 n
+冗余度 3 n
+冗余技术 3 n
+冗务 3 n
+冗员 55 n
+冗官 3 n
+冗数 3 n
+冗杂 8 a
+冗笔 3 n
+冗繁 3 a
+冗职 3 n
+冗肿 3 n
+冗言 3 n
+冗词 3 n
+冗词赘句 3 v
+冗语 3 n
+冗费 3 n
+冗长 73 n
+写 17024 v
+写上去 3 v
+写上来 3 v
+写下 979 v
+写下去 3 v
+写书人 2 n
+写作 1530 v
+写作学 8 n
+写作家 3 n
+写作技巧 3 n
+写作提纲 3 n
+写作文 3 n
+写作方法 3 n
+写作水平 3 n
+写作班 3 n
+写作知识 3 n
+写作组 5 n
+写作网 3 n
+写作者 29 n
+写作能力 3 n
+写信 641 v
+写信人 7 n
+写信给 3 n
+写入 135 v
+写写 32 v
+写写字 6 n
+写写画画 5 n
+写出 725 v
+写出去 3 v
+写到 3 v
+写卡器 3 n
+写去 3 v
+写回去 3 n
+写在下方 3 n
+写字 154 n
+写字台 130 n
+写字板 14 n
+写字枱 3 vn
+写字楼 188 n
+写字间 8 n
+写实 181 v
+写实主义 58 n
+写实性 6 n
+写实派 3 n
+写实片 3 n
+写封信 3 n
+写序言 3 v
+写意 114 v
+写意画 6 n
+写成 764 v
+写成标志 3 n
+写手 47 v
+写数据线 3 n
+写文章 3 n
+写日记 3 n
+写明 145 v
+写景 82 n
+写景文 3 n
+写有 3 v
+写本 103 n
+写来 3 v
+写来写去 3 v
+写歌 3 v
+写毛笔字 3 n
+写法 106 v
+写点 3 n
+写照 139 v
+写生 126 v
+写生画 3 n
+写盘 3 v
+写真 53 v
+写真机 3 n
+写真照 2 n
+写真片 3 n
+写真级 3 n
+写真网 3 n
+写真集 6 n
+写真馆 3 n
+写票 5 n
+写稿 22 v
+写稿人 3 n
+写篇 3 n
+写经 35 v
+写给 227 v
+写访问 3 n
+写诗 144 n
+写账 3 v
+写起 3 v
+写过信 3 v
+写过来 3 v
+写进 3 v
+写进去 3 v
+写进来 3 v
+写道 868 v
+写错 3 v
+写错字 3 n
+军 27200 n
+军不血刃 3 i
+军中 1169 s
+军中无戏言 4 l
+军临城下 3 i
+军乐 37 n
+军乐团 9 nt
+军乐队 40 n
+军书 3 n
+军事 16552 n
+军事优势 3 n
+军事体育 9 l
+军事冲突 3 n
+军事力量 3 n
+军事动态 3 n
+军事化 57 n
+军事医学 3 nt
+军事医学科学院 9 nt
+军事博物馆 10 n
+军事史 59 n
+军事同盟 3 nt
+军事图片 3 n
+军事地理 3 n
+军事基地 160 n
+军事天地 3 n
+军事委员 3 n
+军事学 50 n
+军事学术 60 n
+军事学院 122 nt
+军事实力 3 n
+军事家 239 n
+军事小说 3 l
+军事志 3 n
+军事情报 3 n
+军事战略 3 n
+军事手段 3 n
+军事挑衅 3 v
+军事援助 3 n
+军事政变 3 n
+军事机密 3 n
+军事检察院 533 nt
+军事法庭 88 n
+军事法院 537 nt
+军事演习 3 n
+军事科学 77 nt
+军事科学出版社 8 nt
+军事科学院 44 nt
+军事管制 37 n
+军事素质 3 n
+军事网 3 n
+军事行动 3 n
+军事装备 3 n
+军事训练 3 n
+军事论坛 3 n
+军事设施 3 n
+军事路线 3 n
+军事运输 3 l
+军事部 32 n
+军事部长 13 n
+军事院校 3 nt
+军事顾问 3 l
+军交运输 25 j
+军人 2728 n
+军人专政 3 j
+军人家庭 3 nt
+军人证 8 j
+军代处 4 n
+军代室 7 n
+军代局 3 nt
+军代表 67 n
+军令 256 n
+军令如山 19 l
+军令状 170 n
+军令部 3 n
+军伍 3 n
+军体 13 n
+军体拳 3 n
+军公教 3 n
+军公教子 3 n
+军兵种 187 n
+军内 3 s
+军内外 9 s
+军军 3 n
+军刀 56 n
+军分区 121 n
+军列 3 n
+军制 90 n
+军制史 3 n
+军制学 3 n
+军力 279 n
+军功 66 n
+军功章 26 n
+军务 416 n
+军务院 3 nt
+军区 1345 n
+军区某 3 n
+军区队 17 n
+军医 139 n
+军医大 5 nt
+军医大学 3 nt
+军医学院 3 nt
+军医治 3 n
+军博 2 j
+军口 3 n
+军史 3 n
+军史馆 3 n
+军号 57 n
+军命 3 n
+军品 46 n
+军品店 3 n
+军售 227 vn
+军器 179 n
+军团 636 n
+军团菌 3 n
+军团菌属 3 n
+军团长 26 n
+军国 3 n
+军国主义 192 n
+军国主义者 10 n
+军国大事 3 nt
+军地 60 n
+军垦 7 n
+军士 1153 n
+军士长 13 n
+军备 362 n
+军备品 3 n
+军备竞赛 3 n
+军大衣 51 n
+军委 355 n
+军委主席 3 n
+军委会 323 nt
+军委办公厅 2 nt
+军委总政治部 4 nt
+军委纪委 4 nt
+军姿 3 n
+军威 74 n
+军婚 9 n
+军嫂 15 n
+军字号 3 n
+军官 2322 n
+军官团 3 n
+军官学校 3 n
+军官证 2 n
+军宣队 4 nt
+军容 335 n
+军容严整 3 l
+军容风纪 3 n
+军属 68 n
+军屯 63 n
+军屯村 3 ns
+军山 37 n
+军工 270 n
+军工企业 3 j
+军工厂 18 n
+军工路 3 n
+军师 1158 n
+军师职 3 n
+军帐 107 n
+军帖 3 n
+军帽 106 n
+军律 3 n
+军徽 61 n
+军心 347 n
+军心涣散 3 i
+军情 431 n
+军战 38 n
+军战史 6 n
+军户 3 n
+军报 152 n
+军控 30 j
+军援 3 n
+军操 3 n
+军政 750 n
+军政人员 3 n
+军政大学 3 nt
+军政委 12 nt
+军政府 449 nt
+军政当局 3 n
+军政时期 3 n
+军政权 3 n
+军政界 4 n
+军方 1218 n
+军旅 161 n
+军旗 108 n
+军旗装 3 n
+军服 136 n
+军机 397 n
+军机处 145 n
+军机大臣 3 n
+军权 78 n
+军校 376 n
+军校生 3 n
+军械 408 n
+军械员 3 n
+军械士 3 n
+军械处 3 n
+军械库 9 n
+军械部 14 n
+军棋 9 n
+军歌 22 n
+军毯 3 n
+军民 1771 n
+军民一家 3 l
+军民一致 3 l
+军民共建 29 ns
+军民共建点 4 n
+军民关系 3 n
+军民合作 3 n
+军民品 3 n
+军民团结 3 n
+军民结合 3 n
+军民联欢 3 n
+军民联防 3 n
+军民鱼水 2 n
+军油 3 n
+军法 143 n
+军法从事 29 l
+军法官 3 n
+军法审判 3 n
+军港 207 n
+军火 382 n
+军火交易 3 n
+军火商 44 n
+军火库 13 n
+军火贩子 3 n
+军烈属 12 n
+军犬 27 n
+军用 1113 n
+军用品 10 n
+军用头盔 2 n
+军用机 4 n
+军用机场 3 n
+军用桥 4 n
+军用物资 3 n
+军用犬 3 n
+军用电话 3 n
+军用车 8 n
+军用车辆 3 n
+军用飞机 3 n
+军界 46 n
+军略 3 n
+军眷 6 n
+军礼 72 n
+军神 3 n
+军种 348 n
+军管 51 n
+军管会 18 nt
+军管区 3 n
+军籍 44 n
+军粮 175 n
+军纪 337 n
+军统 84 n
+军统局 3 nt
+军绿色 2 n
+军职 29 n
+军职人员 3 n
+军舰 1173 n
+军舰鸟 3 nz
+军船 8 n
+军艺 3 n
+军营 548 n
+军营区 3 n
+军衔 327 n
+军衔制 4 n
+军衣 50 n
+军装 295 n
+军裤 11 n
+军规 28 n
+军警 3554 n
+军警民 3 n
+军警靴 3 n
+军训 311 n
+军训教官 3 n
+军训课 3 n
+军训部 6 n
+军语 3 n
+军调部 5 n
+军谘府 3 nt
+军购案 3 n
+军费 664 n
+军费开支 3 n
+军资 55 n
+军路 5 n
+军车 55 n
+军转 29 n
+军转办 3 n
+军转民 6 n
+军邮 11 j
+军部 232 n
+军都山 6 ns
+军长 805 n
+军门 51 n
+军闻社 3 nt
+军阀 2334 n
+军阀主义 3 vn
+军阀作风 3 vn
+军阀割据 3 n
+军阀统治 3 v
+军队 11317 n
+军队干部 3 n
+军队院校 3 n
+军阵 58 n
+军阶 8 n
+军需 258 n
+军需品 22 n
+军需处 2 n
+军需官 3 n
+军需补给 3 n
+军需部 9 n
+军靴 6 n
+军鞋 3 n
+军风 6 n
+军风纪 3 n
+军饷 217 n
+军马 1235 n
+军马场 19 n
+军魂 4 n
+军鸽 2 n
+军鼓 3 n
+军龄 13 n
+农 1880 zg
+农一师 3 nr
+农专 5 j
+农业 16233 n
+农业与农村委员会 256 nt
+农业专科 3 n
+农业中学 3 nt
+农业丰收 3 l
+农业产业 3 n
+农业凋零 3 z
+农业劳动 3 l
+农业化 3 n
+农业化学 3 nt
+农业区 371 n
+农业区划 3 n
+农业厅 7 n
+农业县 18 n
+农业发展银行 4 nt
+农业品 2 n
+农业国 79 n
+农业土壤 3 n
+农业地带 3 n
+农业地理 3 n
+农业大学 32 nt
+农业学大 3 nt
+农业局 20 nt
+农业工人 3 n
+农业布局 3 n
+农业总产 3 n
+农业户 2 n
+农业户口 3 n
+农业投入 3 n
+农业机器 3 n
+农业机械 3 n
+农业村镇 3 n
+农业气候 3 n
+农业生产者 16 n
+农业用地 3 n
+农业知识 3 n
+农业社 45 nt
+农业科研 3 n
+农业税 44 n
+农业网 3 n
+农业装备 3 n
+农业试验 3 n
+农业贷款 3 n
+农业遥感 3 n
+农业部 968 nt
+农业部渔业局 512 nt
+农业部长 7 n
+农业部门 33 n
+农业银行 83 nt
+农业银行总行 2 nt
+农业院校 3 nt
+农业集体 3 nt
+农中 3 nt
+农丰 3 nz
+农丰里 3 nr
+农习班 2 n
+农乡 3 n
+农事 123 n
+农二师 3 nr
+农交会 3 j
+农产 120 j
+农产品 1572 n
+农产品收 3 n
+农产物 3 n
+农产量 2 n
+农人 64 n
+农仓 3 n
+农会 86 n
+农作 132 n
+农作曲 3 n
+农作机 3 n
+农作物 1465 n
+农信社 16 nt
+农八师 3 n
+农六师 2 nr
+农具 239 n
+农具厂 3 n
+农军 14 n
+农函大 11 l
+农副 9 n
+农副业 12 j
+农副产品 237 n
+农办 7 j
+农务 3 n
+农化 17 n
+农化系 3 n
+农区 87 n
+农十师 2 n
+农协 93 j
+农协会 3 nt
+农博会 3 j
+农博网 4 n
+农历 677 n
+农历年 3 n
+农友 3 n
+农发行 22 nt
+农口 3 n
+农合 2 n
+农吉利 3 nr
+农商 4 n
+农商部 2 nt
+农器 2 n
+农四师 2 nr
+农园 3 n
+农固 2 j
+农地 9 n
+农地重划 3 j
+农场 628 n
+农场主 258 n
+农场农村 3 n
+农场地 3 n
+农场管理 3 n
+农垦 58 n
+农垦区 7 n
+农垦局 2 nt
+农垦工作 3 n
+农垦经济 3 n
+农垦部 3 nt
+农复会 3 nt
+农大 36 j
+农夫 313 n
+农夫山泉 2 nz
+农奴 609 n
+农奴主 64 n
+农奴制 161 n
+农奴制度 3 n
+农奴阶级 3 n
+农妇 55 n
+农委 13 n
+农委会 3 nt
+农学 147 n
+农学会 10 nt
+农学家 30 n
+农学系 5 n
+农学院 101 nt
+农安 16 nz
+农安县 6 ns
+农官 2 n
+农宜牧 4 nr
+农家 471 n
+农家乐 277 nr
+农家品种 3 n
+农家女 7 n
+农家娃 3 nr
+农家子弟 3 n
+农家宝 3 nr
+农家肥 11 n
+农家肥料 3 l
+农家菜 5 n
+农家院 5 nt
+农家饭 18 n
+农居 6 n
+农展馆 5 nt
+农工 151 n
+农工党 37 nt
+农工商 60 n
+农工委 3 nt
+农工民主党 7 nt
+农工民主党中央 3 nt
+农工职业 3 n
+农工贸 3 j
+农工部 6 nt
+农帮恭 2 nr
+农庄 111 n
+农微微 2 nr
+农忙 41 nr
+农忙时节 3 l
+农惠农 2 nr
+农户 402 n
+农户家 5 n
+农技 46 n
+农技协 3 nt
+农技员 3 n
+农技团 3 n
+农技站 11 n
+农抑商 5 n
+农政 12 n
+农救会 3 nz
+农时 35 n
+农曰羲 2 nr
+农望 2 n
+农机 193 n
+农机具 29 n
+农机化 3 n
+农机厂 6 n
+农机员 3 n
+农机局 2 n
+农机手 3 n
+农机更新 3 nz
+农机站 6 n
+农机系 3 n
+农机配件 3 n
+农杆氨酸 3 n
+农杆糖酯 3 n
+农杆素 3 n
+农杆菌素 3 n
+农村 11478 n
+农村信用 3 nt
+农村党员 3 n
+农村公社 3 nt
+农村公路 3 n
+农村化 3 n
+农村卫生 3 n
+农村土地 3 n
+农村基层 3 n
+农村妇女 3 n
+农村居民 3 nr
+农村干部 3 n
+农村户口 3 n
+农村政策 3 n
+农村教师 3 n
+农村片 3 n
+农村用电 3 n
+农村税费 3 n
+农村调查 3 l
+农村部 4 n
+农村金融 3 n
+农村面貌 3 n
+农林 163 n
+农林下路 2 n
+农林业 27 j
+农林厅 3 nt
+农林厅长 3 nz
+农林局 2 nt
+农林水产 4 n
+农林水利 3 nz
+农林牧 19 j
+农林牧业 7 j
+农林牧副 3 j
+农林牧副渔 10 j
+农林牧渔 10 j
+农林牧渔业 260 j
+农林部 6 nt
+农校 15 n
+农桑 92 n
+农桑辑 12 n
+农桑通 3 nr
+农桓范 4 nr
+农械 3 n
+农模样 2 l
+农民 11866 n
+农民之友 3 l
+农民党 21 nt
+农民协会 37 nt
+农民工 247 n
+农民战争 130 nz
+农民房 3 n
+农民收入 3 n
+农民日报 4 nz
+农民画 4 n
+农民负担 3 n
+农民起义 291 l
+农民银行 3 nt
+农民阶级 3 n
+农水 3 n
+农活 70 n
+农渔 2 j
+农渠 3 n
+农牧 208 j
+农牧业 315 n
+农牧区 47 n
+农牧厅 3 n
+农牧场 14 n
+农牧局 3 j
+农牧林 5 n
+农牧民 53 n
+农牧渔业 10 j
+农牧渔业部 5 nt
+农牧结合 3 j
+农用 373 n
+农用品 2 n
+农用地 9 n
+农用物资 3 n
+农用车 11 n
+农田 618 n
+农田基本 3 l
+农田小气 3 l
+农田水利 352 nz
+农田灌溉 3 l
+农电 4 j
+农电局 3 nt
+农电工 14 n
+农电站 2 n
+农畜 52 n
+农畜产品 3 n
+农神 3 n
+农神节 2 n
+农科 20 n
+农科大 3 j
+农科所 8 nt
+农科技术 3 n
+农科教 5 nz
+农科村 48 nr
+农科院 63 nt
+农税 3 n
+农立国 6 n
+农经 3 n
+农经站 3 n
+农经系 3 n
+农经网 3 n
+农耕 205 nr
+农耕业 2 n
+农耕区 18 n
+农耕地 13 n
+农耕机 3 n
+农耕社会 3 l
+农耕队 3 n
+农肥 3 n
+农胞 3 n
+农膜 9 n
+农舍 102 n
+农艺 26 n
+农艺学 11 nt
+农艺师 20 n
+农艺系 3 n
+农艺馆 3 n
+农药 467 n
+农药厂 13 n
+农药味 2 n
+农药商 3 n
+农药污染 3 nz
+农行 364 j
+农试所 3 n
+农话 3 n
+农谚 11 n
+农豪商 4 n
+农负 3 n
+农贷 10 n
+农贸 15 j
+农贸市场 90 n
+农资 21 n
+农转工 3 n
+农转非 7 n
+农达 10 nz
+农运 4 n
+农运会 2 j
+农闲 52 n
+农隙 3 n
+农鞋 3 n
+农高会 3 nt
+冝 4 zg
+冞 2 zg
+冠 1507 n
+冠上加冠 3 i
+冠上履下 3 l
+冠丰华 3 nz
+冠亚 2 nz
+冠亚军 19 n
+冠以 473 v
+冠内固位 3 n
+冠冕 34 n
+冠冕堂皇 79 i
+冠军 3173 n
+冠军杯 117 n
+冠军杯赛 5 n
+冠军级 3 l
+冠军联赛 3 n
+冠军赛 53 n
+冠军足球 3 n
+冠军队 14 n
+冠县 6 n
+冠名 173 n
+冠名权 8 n
+冠名者 3 n
+冠周炎 3 n
+冠城队 3 n
+冠外固位 3 n
+冠多发乱 3 i
+冠子 19 n
+冠履 3 n
+冠履倒易 3 l
+冠履倒置 3 i
+冠屦倒施 3 v
+冠山戴粒 3 ns
+冠帽 3 n
+冠心病 209 n
+冠心病人 2 n
+冠振海 3 nz
+冠捷 21 nz
+冠接 3 v
+冠桥学 3 n
+冠毛 3 n
+冠状 34 n
+冠状动脉 112 l
+冠状沟 3 n
+冠状病毒 3 l
+冠玉 3 n
+冠王 3 n
+冠生园 12 n
+冠瘿 3 n
+冠瘿瘤 3 n
+冠盖 6 n
+冠盖云集 2 i
+冠盖如云 3 i
+冠盖相望 3 i
+冠礼 3 n
+冠绝 3 v
+冠绝一时 3 l
+冠绝群芳 3 l
+冠群 5 n
+冠脉 25 n
+冠英 11 nz
+冠蛋白 3 l
+冠袍带履 2 i
+冠词 13 n
+冠部 3 n
+冠醚 3 n
+冠鸡 3 n
+冡 2 zg
+冢 498 ng
+冢中枯骨 2 i
+冢木已拱 3 i
+冣 4 zg
+冤 834 n
+冤亲 3 n
+冤仇 70 v
+冤假 3 n
+冤假错案 151 i
+冤冤相报 6 i
+冤各有头 4 l
+冤呀 3 n
+冤大头 48 n
+冤天冤地 3 i
+冤天屈地 3 i
+冤头 3 n
+冤孽 66 n
+冤家 191 n
+冤家债主 3 n
+冤家对头 14 n
+冤家路窄 16 i
+冤屈 105 v
+冤恨 3 v
+冤情 24 n
+冤有头 17 n
+冤有头债 3 l
+冤枉 570 v
+冤枉路 20 n
+冤枉钱 26 n
+冤案 96 n
+冤死 38 v
+冤气 6 n
+冤沉海底 5 l
+冤狱 51 n
+冤苦 13 v
+冤钱 3 n
+冤鬼 3 n
+冤鬼路 3 l
+冤魂 65 n
+冥 452 ng
+冥冥 3 a
+冥冥中 57 l
+冥冥之中 43 l
+冥器 14 n
+冥夜 3 n
+冥婚 3 n
+冥寿 2 n
+冥府 22 n
+冥思 13 n
+冥思若索 3 i
+冥思苦想 36 i
+冥思苦索 3 i
+冥想 37 n
+冥报 3 n
+冥昭瞢闇 3 z
+冥晦 3 a
+冥暗 3 a
+冥河 8 n
+冥漠之乡 3 n
+冥漠之都 3 n
+冥王 3 n
+冥王星 92 n
+冥王篇 3 l
+冥界 7 n
+冥纸 5 n
+冥行盲索 3 n
+冥衣 3 n
+冥诞 3 a
+冥钞 3 n
+冥钱 3 n
+冥顽 22 a
+冥顽不化 3 i
+冥顽不灵 11 i
+冦 72 zg
+冧 177 zg
+冨 407 zg
+冩 202 zg
+冪 227 zg
+冫 3 zg
+冬 1487 t
+冬不拉 11 nr
+冬令 29 n
+冬令救济 3 n
+冬令营 8 nr
+冬作物 2 l
+冬候鸟 9 nr
+冬储 3 j
+冬冬 3 t
+冬凉 2 t
+冬凌草 2 nr
+冬化 3 j
+冬去春来 16 l
+冬园 3 n
+冬夏 8 t
+冬夜 35 t
+冬天 1194 t
+冬奥 7 nrt
+冬奥会 107 j
+冬妮娅 6 nrt
+冬季 1580 t
+冬季世界 3 n
+冬季两项 14 n
+冬季运动 3 l
+冬学 3 n
+冬宫 32 n
+冬寒 39 t
+冬寒抱冰 3 nr
+冬小麦 66 nr
+冬常服 4 n
+冬扇夏炉 3 nr
+冬播 3 nrt
+冬日 133 t
+冬日可爱 3 l
+冬日夏云 3 nz
+冬春 93 t
+冬春季 8 t
+冬景 3 n
+冬暖 34 v
+冬暖夏凉 42 nr
+冬暖式 3 l
+冬月 21 t
+冬枣 2 n
+冬柴 3 n
+冬柴铁三 2 nr
+冬桃 4 n
+冬汛 4 n
+冬油菜 3 n
+冬泳 22 n
+冬温 3 n
+冬温夏清 3 l
+冬灌 3 nr
+冬炼 3 v
+冬烘 4 nr
+冬烘先生 4 nr
+冬烘头脑 3 l
+冬瓜 344 n
+冬瓜子 3 nr
+冬瓜汤 4 nr
+冬瓜皮 3 n
+冬瓜茶 3 nr
+冬眠 171 v
+冬眠期 3 t
+冬种 6 n
+冬笋 25 n
+冬箑夏裘 3 nr
+冬粉 3 n
+冬练三九 3 nr
+冬耕 3 nr
+冬肥 6 n
+冬至 306 t
+冬至点 6 l
+冬至线 3 l
+冬至节 7 nr
+冬节 3 t
+冬荫功 3 nr
+冬菇 13 n
+冬菜 14 n
+冬葱 3 b
+冬葵 3 n
+冬葵子 3 nr
+冬葵果 3 nr
+冬藏 3 j
+冬虫夏草 30 nz
+冬虫草 3 n
+冬行春令 3 n
+冬衣 26 n
+冬装 18 n
+冬裘夏葛 3 nr
+冬训 50 n
+冬运 9 j
+冬运会 10 j
+冬闲 12 nr
+冬防 3 n
+冬阴功 3 nr
+冬雨 22 t
+冬雪 14 n
+冬雷震 3 nr
+冬雾 3 n
+冬青 45 nr
+冬青树 5 nr
+冬青油 4 j
+冬风 3 n
+冬麦 14 n
+冬麦区 13 ns
+冭 172 zg
+冮 169 zg
+冯 646 nr
+冯一俊 3 nr
+冯三才 9 nr
+冯不摧 9 nr
+冯不破 3 nr
+冯世伦 16 nr
+冯世宽 91 nr
+冯两努 3 nr
+冯乃超 13 nr
+冯之浚 259 nr
+冯云乔 256 nr
+冯云山 23 nr
+冯亦珍 9 nr
+冯京葆 2 nr
+冯亲王 2 nr
+冯伯爵 2 nr
+冯伯爷 2 nr
+冯俊扬 3 nr
+冯保一 15 nr
+冯保仍 2 nr
+冯保伸 6 nr
+冯保便 4 nr
+冯保先 2 nr
+冯保则 2 nr
+冯保刚 3 nr
+冯保叹 2 nr
+冯保听 9 nr
+冯保命 2 nr
+冯保喊 3 nr
+冯保嘴 9 nr
+冯保回 4 nr
+冯保坐 5 nr
+冯保奏 3 nr
+冯保家 4 nr
+冯保已 3 nr
+冯保带 2 nr
+冯保干 2 nr
+冯保府 2 nr
+冯保微微 3 nr
+冯保心 7 nr
+冯保忙 4 nr
+冯保念 2 nr
+冯保想 4 nr
+冯保才 6 nr
+冯保打 2 nr
+冯保抢 2 nr
+冯保朝 4 nr
+冯保本 10 nr
+冯保正 5 nr
+冯保派 2 nr
+冯保略 2 nr
+冯保皱 2 nr
+冯保眯 9 nr
+冯保眼 3 nr
+冯保瞄 2 nr
+冯保瞅 4 nr
+冯保立 2 nr
+冯保笑 3 nr
+冯保答 7 nr
+冯保约 2 nr
+冯保自 2 nr
+冯保见 4 nr
+冯保让 3 nr
+冯保趋 3 nr
+冯保问 3 nr
+冯保闯 2 nr
+冯保除 2 nr
+冯保顿 2 nr
+冯保领 2 nr
+冯元彪 10 nr
+冯元桢 2 nr
+冯元蔚 4 nr
+冯兄弟 3 nr
+冯先生 13 nr
+冯光荣 3 nr
+冯公公 309 nr
+冯公子 6 nr
+冯兰洲 2 nr
+冯其庸 6 nrfg
+冯冬明 8 nr
+冯刚毅 5 nr
+冯勇进 21 nr
+冯去疾 3 nr
+冯友兰 18 nr
+冯叔献 2 nr
+冯司令 2 nr
+冯同知 12 nr
+冯向杰 2 nr
+冯启聪 2 nr
+冯和桂 2 nr
+冯唐头白 3 nr
+冯唐已老 3 nr
+冯唐易老 3 nr
+冯唐白首 3 nr
+冯国安 2 nr
+冯国庆 3 nr
+冯国强 3 nr
+冯国彰 2 nr
+冯国斌 43 nr
+冯国璋 75 nr
+冯国用 2 nr
+冯国胜 3 nr
+冯增秀 2 nr
+冯大人 8 nr
+冯大哥 5 nr
+冯大爷 8 nr
+冯天佑 17 nrfg
+冯天林 2 nr
+冯太后 28 nr
+冯太监 10 nr
+冯夫人 2 nr
+冯奇太太 5 nr
+冯婉贞 2 nr
+冯媛甄 3 nr
+冯子才 2 nr
+冯子材 22 nr
+冯学敏 4 nr
+冯宇辉 12 nr
+冯宏顺 2 nr
+冯宗异 4 nr
+冯官屯 2 nr
+冯定国 3 nr
+冯宝妻 2 nr
+冯宝宝 3 nr
+冯家俊 3 nr
+冯家妹 3 nr
+冯家村 2 nr
+冯家爱 2 nr
+冯将军 4 nr
+冯小军 4 nr
+冯小刚 34 nr
+冯小宁 2 nr
+冯小怜 8 nr
+冯小洁 2 nr
+冯尔康 4 nr
+冯尼格 2 nr
+冯师傅 10 nr
+冯师弟 3 nr
+冯师父 5 nr
+冯应京 3 nr
+冯延巳 9 nr
+冯德伦 3 nr
+冯德培 2 nr
+冯德尔 2 nr
+冯志军 10 nr
+冯志高 7 nr
+冯恃其众 3 v
+冯恩洪 2 nr
+冯恩霖 5 nr
+冯恩鹤 3 nr
+冯恺章 7 nr
+冯惟敏 7 nr
+冯惠芳 2 nr
+冯承钧 21 nr
+冯振武 10 nr
+冯提尔 2 nr
+冯敏杰 115 nr
+冯敬之 2 nr
+冯文修 120 nr
+冯文敏 3 nr
+冯文海 2 nr
+冯春哲 3 nr
+冯昭奎 2 nr
+冯晓泉 3 nr
+冯晓芳 12 nr
+冯校长 3 nr
+冯格庄村 3 nr
+冯格庄镇 3 nr
+冯桂芬 14 nr
+冯梦龙 34 nr
+冯武 2 nr
+冯武樾 22 nr
+冯氏兄弟 2 nr
+冯永华 8 nr
+冯永生 2 nr
+冯河暴虎 3 nr
+冯治安 5 nr
+冯泽芳 3 nr
+冯润胜 3 nr
+冯淬帆 3 v
+冯潇霆 11 nr
+冯爱慈 3 nr
+冯玉祥 371 nr
+冯理达 2 nr
+冯琢庵 8 nr
+冯瑛冰 2 nr
+冯白驹 2 nr
+冯皇后 2 nr
+冯祖荀 8 nr
+冯福生 3 nr
+冯秀乾 2 nr
+冯秉铨 2 nr
+冯简子 2 nr
+冯粹发财 3 nr
+冯粹帆 3 nr
+冯素弗 5 nr
+冯素波 3 nr
+冯紫英 58 nr
+冯绍霆 2 nr
+冯绳武 34 nr
+冯维辛 3 nr
+冯翊县 2 nr
+冯翊夏 2 nr
+冯胜征 2 nr
+冯自由 2 nrfg
+冯英子 2 nr
+冯虚御风 3 nr
+冯远征 3 nr
+冯道事 2 nr
+冯道济 6 nr
+冯邦宁 44 nr
+冯野王 3 nr
+冯铁匠 66 nr
+冯锡范 208 nr
+冯镜如 2 nr
+冯长根 2 nr
+冯长舅 2 nr
+冯阿三 9 nr
+冯院长 6 nr
+冯难敌 43 nr
+冯雪峰 15 nr
+冯霄霆 10 nr
+冯骥才 28 nr
+冯默风 92 nr
+冰 2173 n
+冰上 125 s
+冰上表演 3 n
+冰上运动 4 i
+冰下河道 3 n
+冰丘 4 n
+冰丛 2 n
+冰之源 3 nr
+冰乙酸 3 n
+冰人 5 n
+冰任 3 n
+冰其淋 3 nr
+冰冠 2 n
+冰冰 3 z
+冰冰冷冷 3 z
+冰冰凉 3 z
+冰冰凉凉 3 z
+冰冷 484 z
+冰冻 90 n
+冰冻三尺 8 i
+冰冻三尺非一日之寒 4 i
+冰冻期 14 t
+冰冻蚀刻 3 n
+冰冻食品 3 n
+冰凉 347 z
+冰凉凉 2 z
+冰凉花 3 z
+冰凌 51 nr
+冰凝器 3 n
+冰刀 15 n
+冰刀鞋 3 n
+冰分凝 3 nr
+冰剑 3 n
+冰厂 2 n
+冰原 39 n
+冰参 2 n
+冰台 2 n
+冰咆哮 3 v
+冰品 3 n
+冰场 13 n
+冰块 227 n
+冰坛 3 n
+冰坝 3 n
+冰坡 3 n
+冰坨 3 ns
+冰城 10 ns
+冰塔 9 n
+冰塔林 7 nr
+冰壁 42 n
+冰壑 3 n
+冰壶 22 n
+冰壶玉尺 3 i
+冰壶秋月 3 i
+冰壸秋月 3 v
+冰天 6 t
+冰天雪地 91 i
+冰天雪窑 3 nr
+冰天雪窖 3 n
+冰好 3 z
+冰姿玉骨 3 i
+冰孔 3 n
+冰室 3 n
+冰室京介 3 n
+冰容偏覆 3 i
+冰寒 3 n
+冰寒于水 3 i
+冰封 64 ns
+冰封王座 3 n
+冰封雪冻 3 i
+冰封雪裹 2 n
+冰封雪飘 3 nr
+冰层 145 n
+冰屑 3 n
+冰山 280 ns
+冰山一角 3 i
+冰山易倒 3 i
+冰山结构 3 n
+冰山美人 3 nz
+冰山难靠 3 i
+冰岛 202 ns
+冰岛人 9 n
+冰岛克朗 2 ns
+冰岛共和国 4 ns
+冰岛语 6 n
+冰岩 4 n
+冰峰 9 n
+冰峰雪岭 2 ns
+冰川 1547 ns
+冰川作用 3 nt
+冰川化 3 ns
+冰川变化 3 nz
+冰川学 16 nt
+冰川学家 4 n
+冰川带 3 n
+冰川期 5 t
+冰川河流 3 ns
+冰川补给 3 nr
+冰川退缩 3 nr
+冰川隙 3 n
+冰帽 5 n
+冰床 16 n
+冰库 23 n
+冰店 3 n
+冰心 43 n
+冰心一片 3 i
+冰态水 3 n
+冰情 20 n
+冰成 3 v
+冰挂 5 n
+冰排 3 n
+冰擦痕 3 n
+冰散瓦解 3 i
+冰斗 4 n
+冰斗冰川 3 n
+冰斧 3 n
+冰景 2 n
+冰晶 69 n
+冰晶石 10 n
+冰暴 13 n
+冰月 72 t
+冰期 270 t
+冰期后 3 t
+冰枕 3 n
+冰架 33 n
+冰柜 14 n
+冰柱 22 n
+冰柱雪车 3 n
+冰棍 23 n
+冰棍儿 9 n
+冰棒 5 n
+冰楔 3 n
+冰橇 3 n
+冰橙子 3 nr
+冰毒 10 n
+冰毒案 3 n
+冰水 101 n
+冰水儿 3 n
+冰河 61 ns
+冰河作用 3 n
+冰河时代 3 t
+冰河时期 3 t
+冰河期 7 n
+冰河纪 3 n
+冰河解冻 3 n
+冰沼 4 n
+冰洁渊清 3 nr
+冰洁玉清 3 nr
+冰洞 24 n
+冰洲石 26 n
+冰浴 3 n
+冰海 13 ns
+冰消云散 3 i
+冰消冻解 3 i
+冰消瓦解 3 i
+冰消雪释 3 n
+冰消雾散 3 i
+冰淇淋 79 nr
+冰淇淋机 3 n
+冰清水冷 3 nr
+冰清玉洁 41 nr
+冰清玉润 3 nr
+冰清玉粹 3 nr
+冰湖 8 ns
+冰溜子 2 nr
+冰激凌 42 n
+冰激淋 3 n
+冰瀑 2 n
+冰火 21 n
+冰灯 6 n
+冰炭 8 n
+冰炭不投 3 ns
+冰炭不言 3 n
+冰炭消溶 3 n
+冰点 55 n
+冰点价 3 n
+冰熊 3 z
+冰爪 2 n
+冰片 24 n
+冰牛奶 3 n
+冰王子 7 nr
+冰球 104 n
+冰球场 3 n
+冰球界 2 n
+冰球赛 2 n
+冰球队 3 n
+冰球馆 3 n
+冰瓶 3 n
+冰盏儿 3 nr
+冰盖 120 n
+冰盖层 3 n
+冰砖 5 n
+冰硼散 5 nr
+冰碛 102 n
+冰碛物 20 n
+冰碴 7 n
+冰碴儿 7 n
+冰窖 90 n
+冰窟 29 n
+冰窟窿 15 n
+冰箱 391 n
+冰箱门 3 n
+冰粒 6 n
+冰糕 3 n
+冰糖 87 n
+冰糖水 3 n
+冰糖葫芦 45 n
+冰红茶 3 nr
+冰结 6 n
+冰缘 9 n
+冰美人 3 nr
+冰肌 3 n
+冰肌玉骨 3 i
+冰肌雪肠 3 n
+冰胶结 3 n
+冰脊 3 n
+冰舌 30 n
+冰船 3 n
+冰芯 5 n
+冰花 10 n
+冰花土 3 n
+冰茶 3 n
+冰莹 2 z
+冰蓝 8 z
+冰虫 3 n
+冰蚀湖 3 n
+冰蚕 20 n
+冰蟾 3 nrt
+冰袋 9 n
+冰解云散 3 i
+冰解冻释 3 n
+冰解壤分 3 n
+冰解的破 3 i
+冰起 3 s
+冰起来 3 nr
+冰轮 11 n
+冰过 3 v
+冰透镜体 3 n
+冰醋酸 10 n
+冰释 18 n
+冰释理顺 3 i
+冰量 2 n
+冰鉴 3 n
+冰铜 4 n
+冰销叶散 3 n
+冰锥 6 n
+冰镇 27 n
+冰镩 5 n
+冰隙 3 n
+冰雕 17 n
+冰雨 3 n
+冰雪 486 n
+冰雪严寒 3 nr
+冰雪传奇 3 nr
+冰雪儿 3 nr
+冰雪消融 3 n
+冰雪界 2 n
+冰雪聪明 12 nr
+冰雪节 7 nr
+冰雪遍地 3 i
+冰雹 173 n
+冰雾 3 n
+冰霜 39 n
+冰面 84 n
+冰鞋 7 n
+冰风暴 2 n
+冰风谷 3 n
+冰魂素魄 3 i
+冰魂雪魄 3 i
+冰魄 10 n
+冲 8402 v
+冲上去 3 v
+冲上来 3 v
+冲下 3 v
+冲下去 3 v
+冲下来 3 v
+冲了 3 p
+冲云破雾 3 i
+冲任 3 v
+冲任失调 3 i
+冲倒 3 v
+冲值卡 3 n
+冲克 2 ns
+冲入 230 v
+冲关 3 vn
+冲冠发怒 3 i
+冲冠怒发 3 i
+冲冠眦裂 3 i
+冲冲 3 vn
+冲冲喜 5 z
+冲冲水 3 i
+冲决 11 vn
+冲决堤防 3 l
+冲凉 18 a
+冲出 645 v
+冲出亚洲 3 nz
+冲出去 3 v
+冲出重围 3 n
+冲击 1986 vn
+冲击力 145 n
+冲击性 10 n
+冲击摆 3 n
+冲击波 140 n
+冲击波前 3 i
+冲击疗法 3 n
+冲击钻 2 n
+冲击韧性 3 n
+冲到 3 v
+冲刷 169 vn
+冲刺 264 vn
+冲刺班 3 n
+冲剂 30 n
+冲力 43 n
+冲动 943 vn
+冲动型 2 n
+冲动性 8 n
+冲劲 30 a
+冲劲儿 3 n
+冲劲十足 3 i
+冲印 22 v
+冲印店 3 n
+冲压 84 vn
+冲压件 12 n
+冲压机 3 n
+冲去 3 v
+冲口 31 vn
+冲口而出 72 i
+冲古寺 3 ns
+冲吊 7 v
+冲向 191 v
+冲喜 7 v
+冲地 3 n
+冲坏 3 v
+冲坚毁锐 3 i
+冲垮 44 v
+冲塌 3 v
+冲天 274 n
+冲天炉 11 n
+冲天炮 4 n
+冲头 14 v
+冲子 3 n
+冲孔 3 n
+冲孔网 3 n
+冲州撞府 3 n
+冲州过府 3 n
+冲帐 3 n
+冲床 6 vn
+冲床工 3 n
+冲开 473 v
+冲开水 3 i
+冲扩 3 vn
+冲抵 9 v
+冲掉 149 v
+冲撞 259 vn
+冲撞力 3 n
+冲散 311 v
+冲断 58 v
+冲昏 16 v
+冲昏头脑 8 i
+冲曹 3 n
+冲服 24 v
+冲杀 302 vn
+冲来 3 v
+冲来冲去 3 i
+冲桩 3 n
+冲桩管线 3 n
+冲模 3 n
+冲毁 46 v
+冲水 16 vn
+冲沙闸 8 ns
+冲沟 3 ns
+冲泡 97 n
+冲泡式 3 n
+冲洗 329 vn
+冲洗器 3 n
+冲洗照片 3 n
+冲洗阀 3 n
+冲浪 74 nz
+冲浪板 14 n
+冲浪网 3 nz
+冲浪者 2 n
+冲消 4 v
+冲淡 143 a
+冲澡 2 v
+冲激 30 v
+冲激函数 3 n
+冲激响应 3 n
+冲片 3 n
+冲片机 3 nz
+冲犯 5 v
+冲盹儿 3 v
+冲着 503 p
+冲砂 3 n
+冲破 919 vn
+冲积 268 n
+冲积土 3 n
+冲积堤 3 n
+冲积层 3 n
+冲积平原 562 n
+冲积成 3 n
+冲积扇 112 n
+冲积物 3 n
+冲积锥 3 n
+冲程 60 n
+冲突 2737 vn
+冲突地区 3 n
+冲突性 3 n
+冲突检测 3 n
+冲突法 32 i
+冲突消解 3 i
+冲突点 5 n
+冲级 3 vn
+冲线 2 n
+冲绳 167 n
+冲绳县 21 ns
+冲绳岛 27 ns
+冲翼艇 8 n
+冲脉 17 n
+冲茶 18 v
+冲荡 10 vn
+冲虚 352 a
+冲虚道长 3 i
+冲蚀 3 vn
+冲襟 3 n
+冲要 3 a
+冲账 2 v
+冲走 90 v
+冲起 3 v
+冲车 3 n
+冲过 3 p
+冲过去 3 v
+冲过来 3 l
+冲进 3 v
+冲进去 3 v
+冲进来 3 v
+冲退 3 v
+冲量 36 n
+冲销 9 vn
+冲锋 333 n
+冲锋号 13 n
+冲锋在前 3 i
+冲锋枪 413 n
+冲锋舟 18 i
+冲锋衣 3 n
+冲锋裤 3 n
+冲锋队 3 n
+冲锋陷坚 3 i
+冲锋陷锐 3 i
+冲锋陷阵 125 i
+冲阳 3 ns
+冲霄 11 n
+冲顶 21 n
+冲风冒寒 3 i
+冲风冒雨 3 i
+冲风破浪 3 i
+冲鼻 3 v
+决 4589 v
+决一死战 151 i
+决一胜负 3 i
+决一雄雌 3 l
+决一雌雄 12 i
+决不 827 d
+决不会 413 v
+决不允许 3 i
+决不再 3 d
+决不反悔 3 i
+决不可 3 v
+决不宽贷 3 i
+决不待时 2 i
+决不罢休 3 i
+决不能 843 v
+决不食言 3 i
+决了食言 3 i
+决出 85 v
+决出名次 3 i
+决别 3 d
+决口 153 n
+决命争首 3 n
+决堤 52 n
+决定 32770 v
+决定书 51 n
+决定性 744 n
+决定权 47 n
+决定簇 3 i
+决定系数 3 n
+决定论 80 n
+决心 2405 v
+决心书 2 n
+决心很大 3 z
+决志 3 n
+决意 472 v
+决战 861 v
+决择 3 v
+决斗 128 v
+决斗者 3 n
+决断 345 v
+决断力 3 n
+决断如流 3 i
+决无 251 v
+决无异言 3 i
+决无此事 15 i
+决明 5 v
+决明子 11 n
+决死 48 v
+决死队 8 n
+决然 89 d
+决窍 3 v
+决策 2953 n
+决策人员 4 n
+决策依据 3 i
+决策准则 4 n
+决策函数 6 n
+决策分析 3 n
+决策制定 4 n
+决策单位 3 n
+决策学 3 n
+决策层 48 n
+决策当局 3 n
+决策性 4 n
+决策控制 3 n
+决策支持系统 24 n
+决策机构 3 n
+决策权 21 n
+决策树 9 n
+决策矩阵 13 i
+决策程序 3 n
+决策空间 3 n
+决策者 206 n
+决策表 3 n
+决策问题 3 n
+决算 165 v
+决算书 3 n
+决算法 3 n
+决算表 2 n
+决绝 76 v
+决置 3 v
+决美 3 v
+决而不行 3 i
+决胜 152 v
+决胜千里 13 i
+决胜千里之外 4 i
+决胜局 48 n
+决胜庙堂 3 n
+决胜盘 19 n
+决胜负 3 n
+决裂 160 v
+决计 858 v
+决议 6873 n
+决议书 3 n
+决议文 3 n
+决议案 307 n
+决赛 1761 n
+决赛圈 32 n
+决赛权 36 n
+决选 3 v
+决速步 3 n
+决雌雄 11 i
+决非 285 v
+决非偶然 9 l
+况 367 c
+况且 766 c
+况味 5 nr
+况图敌 2 nr
+况普天 2 nr
+况浩文 7 nr
+况臣莽 2 nr
+况贾母 2 nr
+冶 433 zg
+冶叶倡条 3 n
+冶容 3 n
+冶容诲淫 3 vn
+冶工 3 n
+冶游 5 n
+冶炼 447 v
+冶炼业 3 n
+冶炼厂 26 n
+冶炼炉 4 n
+冶炼车间 3 n
+冶练 3 n
+冶艳 3 v
+冶金 1502 n
+冶金业 3 n
+冶金学 53 n
+冶金学家 3 n
+冶金工业 3 n
+冶金工业部 2 nt
+冶金焦 2 n
+冶金矿产 3 n
+冶金部 9 n
+冶铁 3 n
+冶铸 43 v
+冶锻 3 n
+冷 5144 a
+冷一笑 2 nr
+冷丁 2 nr
+冷下来 3 l
+冷不丁 95 nr
+冷不冷 3 a
+冷不防 132 v
+冷丝丝 4 nr
+冷二郎 2 nr
+冷于冰 3 nr
+冷作 3 vn
+冷傲 13 a
+冷僻 15 a
+冷光 46 nr
+冷光源 3 nr
+冷光片 3 n
+冷兵器 71 n
+冷冰冰 161 nr
+冷冲压 3 z
+冷冲模 3 nr
+冷冷 78 a
+冷冷冰冰 3 z
+冷冷地 11 z
+冷冷淡淡 12 z
+冷冷清清 76 z
+冷冷的 612 z
+冷冷瞅 4 nr
+冷冷道 39 nr
+冷冷青 2 z
+冷冷静静 3 z
+冷冻 183 v
+冷冻剂 7 n
+冷冻厂 2 n
+冷冻固定 3 n
+冷冻室 5 n
+冷冻干燥 3 nr
+冷冻库 2 nr
+冷冻机 4 n
+冷冻柜 3 nr
+冷冻电 3 n
+冷冻管 3 n
+冷冻箱 4 n
+冷冻货 3 n
+冷冻间 3 n
+冷凄凄 3 z
+冷凉 16 a
+冷凝 94 nr
+冷凝剂 3 n
+冷凝器 17 n
+冷凝控制 3 n
+冷凝水 3 n
+冷凝液罐 3 n
+冷凝点 3 n
+冷凝物 3 n
+冷加工 13 nr
+冷动 3 vn
+冷却 772 v
+冷却剂 22 n
+冷却器 8 n
+冷却塔 14 nr
+冷却套管 3 n
+冷却旋管 3 n
+冷却水 15 nr
+冷却水浴 3 n
+冷却液 7 n
+冷却空气 3 n
+冷却管 3 n
+冷却系统 3 n
+冷厉 4 a
+冷厥 2 n
+冷古丁 3 nr
+冷吟 3 z
+冷启动 3 nr
+冷嘲 3 v
+冷嘲热讽 84 i
+冷嘲热骂 3 i
+冷噤 3 n
+冷器 2 n
+冷圈 3 n
+冷圈学 3 n
+冷场 36 n
+冷声 8 n
+冷处理 6 nr
+冷夏凉 5 nr
+冷夏暖 4 nr
+冷大哥 6 nr
+冷天 35 t
+冷如冰 5 nr
+冷媒 3 n
+冷子 3 n
+冷子兴 10 nr
+冷子管 3 nr
+冷字 3 n
+冷季 3 t
+冷室 3 n
+冷宫 62 nr
+冷害 10 a
+冷寂 30 a
+冷寒星 3 nr
+冷寞 3 a
+冷峭 9 a
+冷峻 122 a
+冷工作业 3 n
+冷巴 3 n
+冷巷 3 n
+冷布 2 v
+冷干机 3 n
+冷平流 4 n
+冷床 9 n
+冷库 20 n
+冷开水 3 nr
+冷待 3 v
+冷心冷面 3 n
+冷思考 3 nr
+冷性 4 n
+冷恐子 2 nr
+冷意 3 v
+冷感 2 n
+冷感症 3 n
+冷战 603 v
+冷拔 3 n
+冷挤压 3 z
+冷敷 19 nr
+冷敷法 3 nr
+冷无风 3 nr
+冷星云 3 nr
+冷暖 119 an
+冷暖人间 3 n
+冷暖空气 10 z
+冷暖空调 3 n
+冷暖箱 4 n
+冷暖自如 3 nr
+冷暖自知 10 i
+冷暴力 3 n
+冷月 16 t
+冷月均 17 nr
+冷月清 2 nr
+冷月窥 3 nr
+冷期 3 n
+冷机 15 n
+冷杉 153 nr
+冷杉木 3 nr
+冷杉林 9 nr
+冷板凳 15 n
+冷枪 21 n
+冷柜 6 n
+冷森森 31 nr
+冷气 211 n
+冷气团 28 n
+冷气机 3 n
+冷气设备 3 n
+冷水 335 n
+冷水冷面 3 n
+冷水器 3 n
+冷水域 2 n
+冷水性 29 n
+冷水机 3 n
+冷水机组 3 n
+冷水江 8 nr
+冷水江市 11 ns
+冷水浇头 3 n
+冷水浇背 3 i
+冷水浴 8 nr
+冷水滩 3 nr
+冷水滩区 2 n
+冷水滩市 3 ns
+冷水澡 16 n
+冷水烫猪 3 nr
+冷汗 633 nr
+冷汗直流 3 i
+冷流 3 n
+冷浸 5 v
+冷涡 8 n
+冷涩 3 a
+冷淡 382 a
+冷清 181 nr
+冷清清 33 nr
+冷温性 6 n
+冷温水 2 nr
+冷湖 17 nr
+冷湿 4 a
+冷源 4 n
+冷漠 415 n
+冷激 3 v
+冷火消 2 l
+冷灰爆豆 3 n
+冷炮 4 n
+冷点 7 n
+冷烫 3 z
+冷烫精 3 nr
+冷热 96 a
+冷热板 3 n
+冷热水 6 n
+冷热病 3 n
+冷热箱 3 n
+冷热自明 3 nr
+冷焊 2 n
+冷然 61 d
+冷球蛋白 3 n
+冷畏寒 2 nr
+冷疗法 3 n
+冷盘 17 n
+冷眉冷眼 3 i
+冷眼 97 a
+冷眼旁观 41 l
+冷眼相待 5 i
+冷眼相觑 3 i
+冷眼静看 3 i
+冷知暖 2 nr
+冷禅冷 5 nr
+冷禅剑 3 nr
+冷禅心 4 nr
+冷禅忽 2 nr
+冷禅朗 4 nr
+冷禅笑 2 nr
+冷禅言 2 nr
+冷禅身 2 nr
+冷禅非 2 nr
+冷科长 2 n
+冷空气 183 n
+冷窗冻壁 3 i
+冷笑 2227 nr
+冷笑声 3 nr
+冷箭 32 n
+冷缩 5 v
+冷美人 3 nr
+冷翠人 2 nr
+冷翠山 2 nr
+冷肃 4 a
+冷脸 3 n
+冷腌法 3 vn
+冷色 17 n
+冷色调 3 n
+冷艳 12 nr
+冷若冰霜 34 nr
+冷荤 7 v
+冷菜 21 n
+冷落 272 v
+冷落慢待 3 i
+冷藏 89 n
+冷藏器 3 n
+冷藏室 3 n
+冷藏库 2 nr
+冷藏柜 3 nr
+冷藏法 3 n
+冷藏箱 2 n
+冷藏车 5 n
+冷血 28 v
+冷血动物 15 n
+冷觉 5 n
+冷言冷语 25 i
+冷言热语 3 i
+冷言讽语 3 i
+冷话 3 n
+冷语 6 nz
+冷语冰人 3 nr
+冷调 4 v
+冷谈 3 v
+冷货 3 n
+冷轧 16 v
+冷轧卷 3 nz
+冷轧带 3 n
+冷轧机 2 n
+冷轧板 3 n
+冷遇 59 n
+冷酒 2 n
+冷酷 240 a
+冷酷无情 3 l
+冷醒 2 a
+冷钢化 3 nr
+冷铸 3 nr
+冷锋 27 nr
+冷锻法 2 nr
+冷门 234 n
+冷门课 3 n
+冷门货 3 n
+冷阴极 3 nr
+冷雨夜 3 nr
+冷雨晓晓 3 nr
+冷霜 3 nr
+冷露 5 v
+冷静 1102 a
+冷静下来 3 i
+冷静王 3 nr
+冷静静 3 z
+冷面 46 n
+冷面寒铁 3 i
+冷面馆 3 n
+冷颤 23 v
+冷风 169 n
+冷风吹 3 nr
+冷风机 3 n
+冷飕飕 18 z
+冷食 17 n
+冷食部 3 n
+冷餐 20 n
+冷饮 57 n
+冷饮店 2 n
+冷饮部 3 n
+冷骤 2 n
+冷龙岭 15 nr
+冻 928 v
+冻伤 64 v
+冻住 3 v
+冻僵 39 v
+冻儿 3 n
+冻冰 8 v
+冻凝点 3 n
+冻到 3 v
+冻原 3 n
+冻原地带 3 n
+冻啤酒 3 n
+冻土 242 n
+冻土地 2 n
+冻土学 14 n
+冻土层 23 n
+冻土带 17 n
+冻土进化 3 n
+冻土退化 3 n
+冻坏 3 v
+冻害 34 v
+冻干 4 n
+冻干机 3 n
+冻干粉 5 n
+冻库 3 n
+冻得 3 v
+冻成 3 v
+冻拔 3 n
+冻死 151 v
+冻洁 3 v
+冻浦鱼惊 3 nr
+冻港 3 n
+冻猪肉 2 n
+冻疮 31 n
+冻硬 3 v
+冻糕 3 n
+冻结 378 v
+冻结成 3 v
+冻结指数 3 n
+冻结标记 3 n
+冻结深度 3 n
+冻结资产 3 n
+冻结资金 3 n
+冻肉 12 n
+冻胀 3 v
+冻胀力 3 n
+冻融 21 n
+冻融循环 3 n
+冻裂 6 v
+冻解冰释 3 n
+冻豆腐 3 n
+冻过 3 v
+冻雨 11 n
+冻顶 3 n
+冻顶乌龙 3 n
+冻饿 3 n
+冻馁 7 v
+冻鸡 7 n
+冼 44 nr
+冼星海 26 nr
+冽 21 g
+冿 116 zg
+净 1952 a
+净业 3 n
+净亏损 3 vn
+净产值 5 n
+净价 3 n
+净余 3 n
+净值 109 n
+净光合 3 n
+净利 21 n
+净利润 548 n
+净利润率 8 n
+净剩 3 v
+净化 422 n
+净化剂 4 n
+净化器 8 n
+净化水 3 n
+净化环境 3 n
+净化系统 3 n
+净口 3 n
+净含量 3 n
+净土 176 n
+净土宗 3 n
+净增 40 v
+净室 16 n
+净宽 3 n
+净尽 39 v
+净差 3 n
+净度 5 n
+净心 2 n
+净手 3 n
+净损 3 n
+净支 3 n
+净收入 18 n
+净数 3 n
+净月潭 4 n
+净本 3 n
+净桶 11 n
+净气 3 n
+净水 48 n
+净水剂 3 n
+净水厂 3 n
+净水器 3 n
+净水机 3 n
+净洁 3 n
+净洗剂 3 n
+净流入 2 n
+净流量 6 n
+净济 3 n
+净清 3 n
+净现金 5 n
+净瓶 3 n
+净盘将军 3 n
+净空 153 n
+净素 3 n
+净胜 10 n
+净胜球 19 n
+净菜 6 n
+净菜社 3 n
+净角 5 n
+净资产 196 n
+净资产值 17 n
+净赚 24 v
+净赚额 3 v
+净赢 3 n
+净身 35 n
+净车价 3 n
+净重 34 n
+净重量 3 n
+净销 3 n
+净额 60 n
+净高 5 n
+凄 155 a
+凄入肝脾 3 i
+凄冷 13 a
+凄凄 3 a
+凄凄凉凉 3 z
+凄凄切切 3 z
+凄凄惨惨 16 z
+凄凉 413 a
+凄切 18 a
+凄切动人 3 i
+凄历 3 i
+凄厉 151 a
+凄咽 3 i
+凄唱 3 i
+凄婉 45 a
+凄怆 29 a
+凄怨 3 a
+凄恻 19 a
+凄惘 3 a
+凄惨 161 a
+凄惶 52 a
+凄戾 3 a
+凄楚 103 a
+凄沧 3 i
+凄清 31 a
+凄然 278 z
+凄然泪下 3 i
+凄神寒骨 3 i
+凄绝 3 z
+凄美 22 a
+凄艳 3 a
+凄苍 3 z
+凄苦 98 a
+凄迷 12 a
+凄迷不振 3 i
+凄酸 3 a
+凄风 3 a
+凄风冷雨 2 i
+凄风寒雨 3 i
+凄风楚雨 3 i
+凄风苦雨 12 i
+准 3672 v
+准予 71 v
+准予上映 3 n
+准会 3 v
+准位 3 n
+准保 11 v
+准信 3 v
+准信儿 3 n
+准假 4 v
+准儿 12 n
+准入 60 v
+准入关 11 n
+准入制 11 n
+准入条件 3 n
+准军事 62 n
+准军事化 5 n
+准决赛 3 v
+准分子 3 n
+准则 894 n
+准单向 3 v
+准周期性 3 n
+准噶尔 245 ns
+准噶尔盆地 89 ns
+准备 16199 v
+准备不周 3 n
+准备会 37 n
+准备充分 3 n
+准备后事 3 n
+准备就绪 3 n
+准备期 3 n
+准备考 3 n
+准备金 239 n
+准备金率 18 n
+准头 89 v
+准奏 3 v
+准妈咪 3 n
+准妈妈 3 n
+准字号 2 n
+准定 3 v
+准宾语 3 nz
+准对称 3 n
+准对称性 3 n
+准将 68 n
+准尉 22 n
+准平原 3 ns
+准度 3 n
+准建证 3 n
+准心 3 v
+准性生殖 3 l
+准据 3 n
+准据法 37 n
+准收 3 v
+准新娘 3 n
+准新郎 3 n
+准时 226 v
+准时出席 3 n
+准时到达 3 l
+准星 44 n
+准格尔 12 ns
+准格尔旗 11 ns
+准港姐 3 n
+准滤光片 3 nz
+准点 13 n
+准照 3 v
+准现房 3 n
+准生证 4 v
+准直 15 v
+准直光束 3 n
+准确 2668 a
+准确度 62 n
+准确性 164 n
+准确无误 26 n
+准确率 39 n
+准种 3 v
+准稳态 3 n
+准系统 3 n
+准素分解 3 n
+准素子模 3 n
+准素环 3 ns
+准线 16 n
+准绳 63 n
+准考号 7 n
+准考证 156 n
+准考证号 31 n
+准能 3 v
+准许 265 v
+准话 3 v
+准谱 2 n
+准谱儿 3 n
+准轨 3 v
+准迁证 3 n
+准连续区 3 n
+凇 121 x
+凈 9 zg
+凉 1622 v
+凉丝丝 9 n
+凉了半截 3 v
+凉亭 118 nrt
+凉伞 3 n
+凉冰冰 5 z
+凉凉 3 a
+凉凉快快 3 z
+凉凉爽爽 3 z
+凉凉的 14 z
+凉台 5 n
+凉嗖嗖 10 z
+凉城 5 ns
+凉城县 3 ns
+凉如水 3 n
+凉山 46 ns
+凉山州 3 ns
+凉山彝族自治州 18 ns
+凉州 205 ns
+凉州区 3 ns
+凉席 25 n
+凉帽 10 n
+凉开水 23 ns
+凉快 70 a
+凉意 86 n
+凉拌 322 v
+凉拌菜 3 n
+凉拌面 3 n
+凉月 10 n
+凉果 12 n
+凉棚 20 n
+凉椅 3 n
+凉气 174 n
+凉水 177 n
+凉水井 2 n
+凉水塔 3 n
+凉水池 3 n
+凉水河 3 ns
+凉水澡 4 n
+凉津津 3 ns
+凉浸浸 3 z
+凉爽 256 a
+凉爽呢 2 n
+凉瓜 2 n
+凉瓶 3 n
+凉白开 3 ns
+凉皮 3 n
+凉碟 3 n
+凉簌簌 3 z
+凉粉 114 n
+凉粉条 3 n
+凉糕 8 a
+凉苏苏 3 ns
+凉茶 58 n
+凉茶铺 3 n
+凉药 14 n
+凉菜 21 n
+凉薯 2 n
+凉血动物 3 n
+凉面 2 n
+凉鞋 47 n
+凉风 121 n
+凉风习习 3 n
+凉风阵阵 3 nz
+凉飕飕 27 z
+凋 79 zg
+凋亡 6 v
+凋敝 64 a
+凋枯 3 v
+凋残 3 v
+凋萎 2 v
+凋落 15 v
+凋谢 50 v
+凋败 3 v
+凋逝 3 v
+凋零 87 v
+凌 370 nr
+凌上虐下 3 l
+凌乱 113 a
+凌乱不堪 3 l
+凌云 32 nr
+凌云之志 3 nr
+凌云凤 3 nr
+凌云县 3 nr
+凌云塔 2 nr
+凌云壮志 3 nr
+凌云宫 7 nr
+凌云山 2 nr
+凌云志 3 nr
+凌云渡 5 nr
+凌云阁 3 nr
+凌京尧 4 nr
+凌传昌 2 nr
+凌侮 6 v
+凌公绩 2 nr
+凌加卫 2 nr
+凌历 2 t
+凌厉 507 nr
+凌厉攻势 3 nr
+凌叔华 3 nr
+凌君甫 12 nr
+凌国康 2 nr
+凌夷 3 nr
+凌姐姐 8 nr
+凌姑娘 5 nr
+凌子风 4 nr
+凌宗英 3 nr
+凌家滩 8 nr
+凌小 2 a
+凌小姐 17 nr
+凌岩寺 40 nr
+凌州 21 ns
+凌广志 2 nr
+凌弱 2 a
+凌弱暴寡 3 l
+凌德权 5 nr
+凌志 4 nr
+凌振放 2 nr
+凌日 2 t
+凌晨 702 t
+凌晨时分 3 nr
+凌景埏 2 nr
+凌杂 3 a
+凌杂米盐 3 nr
+凌气逼人 3 nr
+凌汛 7 nr
+凌河 24 nr
+凌河区 3 ns
+凌波丽 3 nr
+凌波仙子 6 nr
+凌波微 79 nr
+凌波步 2 nr
+凌海 2 ns
+凌海市 4 ns
+凌源 20 nr
+凌源县 3 nr
+凌源市 5 ns
+凌烟阁 17 nr
+凌白笑道 2 nr
+凌空 340 nr
+凌空飞行 3 nr
+凌空高飞 3 nr
+凌纯声 3 nr
+凌绝顶 3 l
+凌统引 2 nr
+凌美华 3 nr
+凌翰林 5 nr
+凌虐 6 v
+凌虚子 5 nr
+凌诚沛 2 nr
+凌贵兴 3 nr
+凌轹 3 nr
+凌辱 800 nr
+凌迟 180 nr
+凌迟霍 2 nr
+凌退思 33 nr
+凌锥 3 nr
+凌雪妍 20 nr
+凌霄之志 3 nr
+凌霄城 90 nr
+凌霄殿 3 nr
+凌霄花 4 nr
+凌霄飞车 3 nr
+凌霜华 2 nr
+凌霜道 3 nr
+凌驾 135 nr
+凌驾于 3 nr
+凌驾在 3 nr
+凌鸿勋 2 nr
+凍 8 zg
+减 2112 v
+减下 6 v
+减为 3 v
+减亏 13 v
+减产 374 vn
+减人 4 v
+减人增效 8 n
+减仓 30 v
+减价 45 v
+减价出售 3 l
+减价时间 3 l
+减份 3 n
+减低 146 v
+减借 3 v
+减债 3 v
+减值 123 v
+减免 294 v
+减免税 21 j
+减免额 3 n
+减分 3 v
+减刑 54 v
+减利 2 vn
+减到 3 v
+减削 3 v
+减化 3 v
+减半 73 v
+减压 139 v
+减压器 3 n
+减压塔 3 n
+减压氧化 3 n
+减压水槽 3 n
+减压渣油 3 n
+减压蒸馏 3 n
+减压阀 4 n
+减压馏程 3 n
+减去 202 v
+减反射膜 3 n
+减号 6 v
+减员 131 v
+减员增效 25 n
+减噪 8 v
+减声器 3 n
+减好 3 v
+减字谱 4 n
+减对 3 v
+减寿 3 v
+减小 576 v
+减少 7275 v
+减师半德 3 n
+减幅 11 n
+减并 3 v
+减弱 611 v
+减弱到 3 l
+减征 5 v
+减得 3 v
+减息 93 v
+减慢 150 v
+减拨 3 v
+减持 89 v
+减按 3 n
+减振 30 v
+减振器 57 n
+减损 4 vn
+减掉 36 v
+减排 14 v
+减摇鳍 3 n
+减摩 11 v
+减支 3 v
+减收 12 v
+减收增支 3 n
+减数 140 n
+减数分裂 3 v
+减方 3 n
+减日 3 vn
+减时线 3 n
+减毒株 3 l
+减毒疫苗 3 n
+减水剂 2 n
+减法 38 v
+减法器 3 n
+减消 3 v
+减灾 61 vn
+减班 3 v
+减省 3 v
+减省得 3 v
+减租 96 v
+减租减息 3 n
+减税 107 v
+减税法 3 n
+减笔字 3 nz
+减算 3 v
+减粘裂化 3 n
+减纳 3 v
+减缓 180 v
+减缓放慢 3 n
+减缩 20 v
+减缩到 3 v
+减肥 530 v
+减肥乐 3 n
+减肥操 3 n
+减肥法 15 n
+减肥网 3 nz
+减肥茶 3 n
+减肥药 15 n
+减肥餐 3 n
+减胖 3 v
+减至 111 v
+减色 14 v
+减色性 3 n
+减色法 3 n
+减薪 11 v
+减让 10 v
+减课 3 v
+减负 61 v
+减负办 3 n
+减资 4 vn
+减轻 1504 v
+减轻处分 3 v
+减轻法 3 n
+减轻负担 3 n
+减退 341 v
+减退症 3 n
+减速 193 v
+减速剂 5 n
+减速器 47 n
+减速带 3 n
+减速慢行 3 n
+减速时 2 n
+减速时间 3 n
+减速期 3 n
+减速机 3 n
+减速板 14 n
+减速比 3 n
+减速运动 3 nz
+减速顶 2 n
+减速马达 3 nz
+减重 38 v
+减量 22 v
+减量化 13 v
+减金 3 n
+减阻 18 v
+减阻剂 3 n
+减除 9 v
+减震 15 v
+减震器 21 n
+减食 3 v
+凑 1396 v
+凑上去 3 v
+凑上来 3 v
+凑不出来 3 v
+凑个 3 v
+凑乱 3 a
+凑份子 13 v
+凑兴 3 a
+凑凑 3 a
+凑凑合合 4 z
+凑出 3 v
+凑到 3 v
+凑合 217 v
+凑合着 3 a
+凑和 15 v
+凑在一起 3 v
+凑够 3 v
+凑巧 309 a
+凑得 3 v
+凑成 3 v
+凑手 12 v
+凑拢 11 v
+凑搭 3 v
+凑数 14 v
+凑热闹 91 z
+凑趣 47 a
+凑趣儿 10 v
+凑足 35 a
+凑近 202 v
+凑钱 23 v
+凑集 10 v
+凑齐 3 a
+凒 3 zg
+凔 2 zg
+凖 18 zg
+凗 7 zg
+凘 2 zg
+凛 479 z
+凛冽 108 a
+凛凛 99 z
+凛厉 3 a
+凛如霜雪 3 vn
+凛然 222 z
+凛然正气 3 z
+凛若冰霜 3 nr
+凛若秋霜 3 nz
+凝 871 v
+凝为 3 v
+凝乳 2 nz
+凝乳酶 3 n
+凝住 37 v
+凝冰 3 nr
+凝冻 8 v
+凝剂 2 n
+凝力 7 n
+凝华 26 nz
+凝合 2 v
+凝合力 3 n
+凝固 395 v
+凝固剂 3 n
+凝固化 2 n
+凝固性 6 n
+凝固时间 3 n
+凝固汽油 6 n
+凝固点 39 n
+凝定 3 v
+凝寂 2 v
+凝寒 3 v
+凝思 134 nr
+凝思须臾 3 nr
+凝息 4 v
+凝想 3 v
+凝意 2 v
+凝成 48 v
+凝招 2 v
+凝望 217 v
+凝析 5 v
+凝析气 3 n
+凝析油 3 n
+凝止 3 v
+凝气 2 n
+凝汽器 8 n
+凝汽式 5 n
+凝注 9 v
+凝滞 36 v
+凝灰岩 30 n
+凝炼 20 v
+凝然 14 a
+凝目 20 n
+凝眸 24 v
+凝睇 2 v
+凝瞩不转 3 l
+凝神 592 n
+凝神专注 2 l
+凝神静听 3 nr
+凝立 22 v
+凝练 33 v
+凝结 336 v
+凝结为 3 v
+凝结剂 3 n
+凝结力 3 n
+凝结器 3 n
+凝结尾流 3 n
+凝结核 3 v
+凝结水 3 nr
+凝结点 3 n
+凝缩 3 v
+凝聚 705 v
+凝聚剂 3 nz
+凝聚力 266 n
+凝聚态 35 n
+凝聚性 2 n
+凝聚系统 3 n
+凝胶 114 n
+凝胶体 3 n
+凝胶灌制 3 n
+凝胶电泳 3 n
+凝脂 27 n
+凝脂点漆 3 n
+凝血 3 v
+凝血剂 3 n
+凝血因子 3 n
+凝血烷 3 nz
+凝血药 7 n
+凝血酶 4 n
+凝血酶原 8 n
+凝视 681 v
+凝视着 3 n
+凝视者 3 n
+凝运 2 v
+凝重 240 v
+凝铸 3 v
+凝集 49 v
+凝集力 3 n
+凝集反应 3 n
+凝集素 3 n
+凝霜 2 nz
+凝静 2 a
+凞 3 zg
+几 8320 m
+几丁质 3 n
+几万 520 m
+几万万 5 m
+几万两 26 m
+几万个 12 m
+几万人 3 l
+几万倍 5 m
+几万元 28 m
+几万克 3 m
+几万几十万 7 m
+几万匹 2 m
+几万千瓦 2 m
+几万千米 3 m
+几万卷 2 m
+几万句 2 m
+几万只 2 m
+几万名 9 m
+几万块 19 m
+几万头 6 m
+几万家 2 m
+几万年 12 m
+几万斤 10 m
+几万片 128 m
+几万种 3 m
+几万米 12 m
+几万里 12 m
+几丈 62 m
+几下 1229 m
+几下子 3 m
+几不欲生 3 i
+几世 3 m
+几世纪 3 n
+几丝 61 m
+几两 118 m
+几两几 4 m
+几两米 2 m
+几两重 4 m
+几个 13134 m
+几串 10 m
+几乎 9754 d
+几于 3 d
+几亩 51 m
+几人份 3 m
+几亿 29 m
+几亿倍 2 m
+几亿元 10 m
+几亿年 14 m
+几亿美元 3 m
+几付 3 n
+几代 203 m
+几代人 3 n
+几令 3 n
+几件 488 m
+几件事 3 l
+几任 19 m
+几份 56 m
+几伍 3 n
+几会 3 m
+几位 1376 m
+几位数 3 n
+几何 1424 r
+几何亏格 3 l
+几何体 2 l
+几何变换 4 l
+几何图形 52 l
+几何均数 3 l
+几何学 431 l
+几何学家 3 l
+几何平均 2 ns
+几何异构 3 l
+几何形 37 n
+几何级数 26 l
+几例 10 m
+几倍 158 m
+几儿 3 m
+几元 11 m
+几兆 3 m
+几克 11 m
+几党 3 n
+几公斤 2 m
+几公里 32 m
+几关 3 ns
+几具 37 m
+几内亚 381 ns
+几内亚共和国 6 ns
+几内亚比绍 103 ns
+几内亚比绍共和国 3 ns
+几内亚湾 84 ns
+几册 4 m
+几几 4 m
+几几乎乎 3 l
+几出 12 m
+几刀 62 m
+几分 1103 m
+几分收获 3 i
+几分耕耘 3 n
+几分钟 324 m
+几划 3 n
+几列 13 m
+几则 8 m
+几副 35 m
+几动 3 d
+几勺 3 m
+几包 30 m
+几匹 73 m
+几匹马 3 ns
+几区 3 ns
+几十 389 m
+几十万 244 m
+几十万两 12 m
+几十万个 5 m
+几十万倍 4 m
+几十万元 25 m
+几十万千米 4 m
+几十万发 2 m
+几十万只 4 m
+几十万名 3 m
+几十万吨 2 m
+几十万块 3 m
+几十万年 9 m
+几十万斤 4 m
+几十万米 6 m
+几十万颗 6 m
+几十丈 12 m
+几十下 2 m
+几十两 18 m
+几十个 517 m
+几十亩 16 m
+几十人 3 n
+几十亿 19 m
+几十亿年 8 m
+几十亿美元 13 m
+几十代 19 m
+几十件 4 m
+几十份 5 m
+几十位 19 m
+几十倍 60 m
+几十元 29 m
+几十光年 2 m
+几十公斤 4 m
+几十公里 20 m
+几十具 5 m
+几十几条 2 m
+几十几百 2 m
+几十几道 2 m
+几十出 2 m
+几十分 9 m
+几十分之一 9 m
+几十分钟 17 m
+几十副 2 m
+几十包 3 m
+几十匹 21 m
+几十千克 4 m
+几十千瓦 2 m
+几十千米 26 m
+几十卷 2 m
+几十厘米 14 m
+几十双 2 m
+几十发 3 m
+几十口 11 m
+几十句 5 m
+几十只 20 m
+几十台 11 m
+几十号 12 m
+几十名 92 m
+几十吨 12 m
+几十员 3 m
+几十回 3 m
+几十场 3 m
+几十块 34 m
+几十处 13 m
+几十天 20 m
+几十头 8 m
+几十家 46 m
+几十对 2 m
+几十封 2 m
+几十尊 2 m
+几十尺 3 m
+几十层 4 m
+几十岁 13 m
+几十平方公里 3 m
+几十年 1361 m
+几十年如一日 27 l
+几十度 5 m
+几十座 11 m
+几十张 142 m
+几十微米 5 m
+几十户 16 m
+几十所 8 m
+几十把 4 m
+几十担 3 m
+几十招 2 m
+几十支 6 m
+几十文 3 m
+几十斤 285 m
+几十本 4 m
+几十杆 2 m
+几十条 41 m
+几十杯 3 m
+几十枚 9 m
+几十架 8 m
+几十栋 2 m
+几十株 2 m
+几十样 6 m
+几十根 6 m
+几十桌 4 m
+几十棵 5 m
+几十次 43 m
+几十款 2 m
+几十步 22 m
+几十毫米 2 m
+几十片 3 m
+几十盏 4 m
+几十碗 5 m
+几十种 61 m
+几十秒 7 m
+几十箱 3 m
+几十篇 6 m
+几十米 81 m
+几十粒 3 m
+几十艘 8 m
+几十载 2 m
+几十辆 10 m
+几十辈子 2 m
+几十遍 13 m
+几十道 8 m
+几十部 7 m
+几十里 103 m
+几十门 8 m
+几十间 9 m
+几十页 2 m
+几十项 3 m
+几十颗 7 m
+几十首 3 m
+几千 403 m
+几千万 65 m
+几千万两 2 m
+几千万元 10 m
+几千万年 10 m
+几千两 19 m
+几千个 37 m
+几千亩 4 m
+几千人 3 l
+几千亿颗 2 m
+几千位 2 m
+几千倍 3 m
+几千元 38 m
+几千克 4 m
+几千公里 6 m
+几千几万 6 m
+几千几万头 2 m
+几千几万年 6 m
+几千几万条 5 m
+几千几万次 2 m
+几千几万遍 4 m
+几千几百 3 m
+几千几百个 2 m
+几千分 2 m
+几千千瓦 2 m
+几千千米 12 m
+几千口 2 m
+几千句 3 m
+几千只 9 m
+几千名 41 m
+几千吨 4 m
+几千块 25 m
+几千声 2 m
+几千头 3 m
+几千家 7 m
+几千封 2 m
+几千年 452 m
+几千度 6 m
+几千户 3 m
+几千招 2 m
+几千斤 12 m
+几千本 2 m
+几千条 7 m
+几千枚 7 m
+几千株 2 m
+几千次 3 m
+几千片 3 m
+几千瓦 3 m
+几千百个 3 m
+几千百句 2 m
+几千百处 2 m
+几千百年 4 m
+几千百次 7 m
+几千百遍 6 m
+几千种 7 m
+几千篇 2 m
+几千米 51 m
+几千美元 2 m
+几千艘 3 m
+几千载 2 m
+几千辆 2 m
+几千遍 2 m
+几千里 29 m
+几千顷 2 m
+几千颗 5 m
+几半 5 m
+几卷 21 m
+几历 3 n
+几厘米 31 m
+几双 23 m
+几发 15 m
+几叠 3 m
+几口 478 m
+几句 3737 m
+几句话 3 l
+几只 424 m
+几只羊 3 ns
+几台 23 m
+几号 10 m
+几号楼 3 n
+几名 627 m
+几吨 8 m
+几员 28 m
+几周 71 m
+几味 34 m
+几品 27 m
+几响 25 m
+几回 142 m
+几团 14 m
+几国 3 ns
+几圆 3 n
+几圈 89 m
+几场 143 m
+几块 344 m
+几块钱 3 n
+几垒 3 n
+几堂 5 m
+几堆 26 m
+几堵 3 m
+几声 785 m
+几壶 3 n
+几处 298 m
+几多 52 m
+几夜 55 m
+几大 3 m
+几大块 3 m
+几大片 3 m
+几大类 3 m
+几天 4341 m
+几天几夜 3 m
+几头 46 m
+几套 82 m
+几好 3 d
+几孔 3 n
+几字 3 n
+几季 3 m
+几宗 6 m
+几客 3 n
+几室 3 n
+几家 577 m
+几家愁 3 l
+几家欢乐 3 i
+几寸 17 m
+几对 24 m
+几封 51 m
+几封信 3 n
+几尊 13 m
+几小时 3 m
+几尺 37 m
+几尼 3 ns
+几尾 11 m
+几局 8 m
+几层 220 m
+几层楼 3 n
+几届 16 m
+几岁 219 m
+几巷 3 n
+几师 3 n
+几希 3 ns
+几席 13 m
+几幅 53 d
+几幕 2 m
+几幢 15 m
+几年 4137 m
+几年生 3 n
+几年级 3 l
+几床 3 m
+几度 96 d
+几座 155 m
+几开 3 m
+几弄 3 ns
+几张 281 m
+几弹 3 n
+几微 3 d
+几微米 5 m
+几成 75 m
+几成新 3 l
+几截 3 m
+几户 47 m
+几所 64 m
+几扇 8 m
+几手 63 m
+几打 3 m
+几批 25 m
+几把 113 m
+几抹 5 m
+几担 6 m
+几招 236 m
+几拳 30 m
+几捆 12 m
+几排 28 m
+几摞 3 m
+几支 124 m
+几文 15 m
+几文钱 3 n
+几斗 7 m
+几斤 89 m
+几斤几两 3 i
+几方 7 m
+几旅 3 n
+几无二致 3 l
+几日 702 m
+几日份 3 m
+几时 490 d
+几时休 3 l
+几易其稿 4 n
+几星 3 n
+几星期 3 m
+几晚 3 d
+几曲 2 m
+几曾 3 d
+几月 24 m
+几月份 3 mq
+几服 5 m
+几期 17 d
+几本 94 m
+几本书 3 n
+几朵 47 m
+几杆 16 m
+几束 8 m
+几条 622 m
+几杯 261 m
+几杯酒 3 n
+几板 3 n
+几枚 91 m
+几枝 41 m
+几枪 26 m
+几架 57 m
+几柱 2 m
+几栋 12 m
+几株 85 m
+几样 175 m
+几根 264 m
+几格 3 n
+几案 44 m
+几桌 21 m
+几档 3 m
+几桩 18 m
+几桶 4 m
+几梯次 3 n
+几棵 105 m
+几楼 3 n
+几次 2534 m
+几次三番 56 m
+几欲 3 n
+几款 20 m
+几步 1328 m
+几段 84 m
+几比 7 ns
+几比几 3 l
+几毛 3 n
+几毛钱 3 n
+几毫克 2 m
+几毫米 20 m
+几洞 3 n
+几派 4 m
+几滴 95 m
+几滴水 3 n
+几炷香 3 z
+几点 416 m
+几点钟 3 m
+几片 102 m
+几版 3 n
+几率 239 n
+几率比 3 n
+几环 3 ns
+几班 3 m
+几瓢 2 m
+几瓶 41 m
+几画 3 n
+几番 138 m
+几百 320 m
+几百万 118 m
+几百万两 17 m
+几百万个 3 m
+几百万倍 2 m
+几百万元 8 m
+几百万千瓦 2 m
+几百万名 2 m
+几百万吨 3 m
+几百万块 3 m
+几百万年 19 m
+几百万开 2 m
+几百万种 3 m
+几百万美元 7 m
+几百万镑 5 m
+几百丈 3 m
+几百两 25 m
+几百个 81 m
+几百乡 4 m
+几百亩 15 m
+几百人 3 n
+几百亿 8 m
+几百亿吨 2 m
+几百亿根 8 m
+几百亿美元 2 m
+几百件 8 m
+几百份 5 m
+几百位 3 m
+几百例 4 m
+几百倍 12 m
+几百元 52 m
+几百公斤 2 m
+几百公里 10 m
+几百几千 2 m
+几百几百 2 m
+几百匹 4 m
+几百千克 3 m
+几百千瓦 2 m
+几百千米 23 m
+几百口 2 m
+几百句 3 m
+几百只 20 m
+几百台 2 m
+几百号 11 m
+几百名 66 m
+几百吨 5 m
+几百回 2 m
+几百块 54 m
+几百声 2 m
+几百处 2 m
+几百头 11 m
+几百家 21 m
+几百对 3 m
+几百封 3 m
+几百岁 3 m
+几百幅 4 m
+几百平方米 2 m
+几百年 600 m
+几百年几千年 3 m
+几百度 3 m
+几百张 3 m
+几百微米 3 m
+几百户 6 m
+几百所 2 m
+几百支 2 m
+几百文 3 m
+几百斤 273 m
+几百条 11 m
+几百枚 5 m
+几百桶 2 m
+几百棵 3 m
+几百次 17 m
+几百步 7 m
+几百海里 2 m
+几百点 5 m
+几百瓦 2 m
+几百种 20 m
+几百篇 5 m
+几百米 71 m
+几百美元 6 m
+几百英里 2 m
+几百辆 4 m
+几百遍 6 m
+几百道 3 m
+几百部 4 m
+几百里 69 m
+几百门 3 m
+几百间 3 m
+几百顷 2 m
+几百颗 4 m
+几百首 3 m
+几盆 10 m
+几盏 40 m
+几盒 13 m
+几盒装 3 n
+几盘 25 m
+几眼 243 m
+几着 3 m
+几碗 61 m
+几碗饭 3 l
+几票 3 m
+几种 1737 m
+几科 3 ns
+几秒 55 m
+几秒钟 3 n
+几稀 3 d
+几程 2 m
+几窝 3 n
+几站 8 m
+几章 26 m
+几端 2 m
+几竿 3 n
+几笔 42 m
+几笼 3 n
+几等 14 m
+几筒 3 n
+几箱 13 m
+几篇 76 m
+几篓 2 m
+几米 60 m
+几米远 3 ns
+几类 153 m
+几粒 66 m
+几级 21 m
+几线 4 m
+几组 15 m
+几经 642 d
+几经反复 3 l
+几经周折 35 n
+几经考虑 3 n
+几维 13 m
+几维鸟 9 n
+几缕 35 m
+几罐 2 m
+几群 4 m
+几股 36 m
+几胎 3 m
+几脚 3 n
+几至 3 d
+几艘 36 m
+几节 30 m
+几节课 3 n
+几英里 3 m
+几茬 5 m
+几行 130 m
+几行字 3 n
+几街 3 ns
+几袋 10 m
+几角 4 m
+几角形 3 n
+几记 4 m
+几许 48 d
+几课 3 n
+几起 46 m
+几起几落 3 l
+几趟 32 m
+几趟路 3 v
+几路 76 m
+几身 12 m
+几车 7 m
+几转 3 n
+几轮 59 m
+几辆 69 m
+几辆车 3 n
+几辈 25 m
+几辈子 18 m
+几近 113 d
+几近于 3 l
+几通 3 m
+几遍 242 m
+几道 325 m
+几道菜 3 n
+几遭 19 m
+几部 111 m
+几部戏 3 n
+几里 79 m
+几重 20 m
+几针 3 n
+几钿 3 n
+几锭 11 m
+几门 79 m
+几间 114 m
+几队 7 m
+几阵 12 m
+几集 3 m
+几面 38 m
+几页 70 m
+几顶 9 m
+几顷 2 m
+几项 245 m
+几顿 21 m
+几颗 171 m
+几题 3 n
+几首 56 m
+几首歌 6 m
+凡 5431 d
+凡世 13 nrt
+凡为 3 d
+凡书契 3 nr
+凡事 307 n
+凡事预则立 7 i
+凡于 3 d
+凡人 110 n
+凡以田 2 nr
+凡例 15 d
+凡俗 24 n
+凡偶近器 3 n
+凡入辑 2 n
+凡全真 2 nr
+凡加恩 16 nr
+凡勃伦 2 nr
+凡响 4 n
+凡因 3 n
+凡圣 3 ns
+凡士林 19 nr
+凡天宝 2 nr
+凡夫 18 nr
+凡夫俗子 51 nr
+凡夫肉眼 3 i
+凡学武 2 nr
+凡宫女 2 nr
+凡家录 3 nr
+凡尔 19 nr
+凡尔丁 3 nr
+凡尔登 57 nr
+凡尔纳 8 nr
+凡尔赛 130 nr
+凡尔赛宫 54 ns
+凡尘 12 nr
+凡属 3 n
+凡应 3 d
+凡康熙 3 nr
+凡庸 7 d
+凡延光 2 nr
+凡德性 16 nr
+凡心 21 d
+凡才浅识 3 i
+凡指 3 n
+凡政制 16 n
+凡是 2127 d
+凡未 3 d
+凡本网 3 n
+凡桃俗李 3 nr
+凡此 3 d
+凡此种种 3 l
+凡此等等 3 l
+凡民 3 n
+凡百 133 nr
+凡百一新 3 i
+凡立丁 3 nr
+凡立丁呢 3 nr
+凡立司 3 nr
+凡纳明 4 nr
+凡组合 16 nr
+凡胎浊体 3 n
+凡胎浊骨 3 i
+凡胎肉眼 3 i
+凡蒂冈 3 ns
+凡要 3 d
+凡赫辛 3 nr
+凡铁立 2 nr
+凡间 42 n
+凡需 3 n
+凡须 3 d
+凡高 20 nr
+凤 916 nr
+凤一鸣 32 nr
+凤七爷 2 nr
+凤七笑 2 nr
+凤丫头 62 nr
+凤丹霞 2 nr
+凤之声 3 nr
+凤仙花 19 nr
+凤仙郡 15 nr
+凤仪亭 7 nr
+凤仪兽舞 3 nr
+凤元年 3 nr
+凤冈 3 ns
+凤冈县 3 ns
+凤冠 57 nr
+凤冠霞帔 15 i
+凤凰 1348 nr
+凤凰于飞 3 nr
+凤凰卫视 3 nz
+凤凰县 13 ns
+凤凰古城 3 ns
+凤凰台 5 ns
+凤凰在笯 3 nz
+凤凰寺 22 ns
+凤凰山 311 ns
+凤凰岭 15 ns
+凤凰岭村 2 ns
+凤凰木 3 ns
+凤凰来仪 4 nz
+凤凰树 10 ns
+凤凰桥 36 ns
+凤凰池 3 ns
+凤凰琴 44 nr
+凤凰社 3 nr
+凤凰竹 3 nr
+凤凰网 3 nz
+凤凰股份 6 nz
+凤凰脚 3 ns
+凤凰花 3 nz
+凤凰花开 3 ns
+凤凰血 3 nz
+凤凰衣 3 nz
+凤凰誓 3 nr
+凤南天 3 nr
+凤历幻 2 nr
+凤县 14 ns
+凤县东 3 nr
+凤友鸾交 3 nr
+凤友鸾谐 3 nr
+凤双飞 2 nr
+凤只鸾孤 3 i
+凤台 15 ns
+凤台县 4 ns
+凤叹虎视 3 i
+凤合县 3 ns
+凤吟鸾吹 3 nr
+凤哥儿 6 nr
+凤四州 3 nr
+凤城 30 ns
+凤城市 4 ns
+凤城镇 3 nr
+凤天南 235 nr
+凤头 30 n
+凤头村 2 nr
+凤头珠 4 nr
+凤头苗 4 nr
+凤头豹 2 nr
+凤头雨 2 nr
+凤姊姊 5 nr
+凤姐儿 431 nr
+凤姐姐 23 nr
+凤姑娘 5 nr
+凤子龙 2 nr
+凤子龙孙 3 nr
+凤尾 52 ns
+凤尾松 3 nr
+凤尾竹 2 nr
+凤尾草 4 nr
+凤尾菇 3 n
+凤尾蘑 3 n
+凤尾鱼 12 nr
+凤山 287 nr
+凤山县 8 ns
+凤山市 2 ns
+凤山溪 3 nr
+凤州 3 ns
+凤庆 2 nr
+凤庆县 2 nr
+凤引九雏 3 nr
+凤愁鸾怨 3 i
+凤掌力 2 nr
+凤昌之 2 nr
+凤景泉 3 nr
+凤来仪 42 nr
+凤来鸡 2 nr
+凤林 4 nr
+凤枭同巢 3 v
+凤梧 3 nrt
+凤梧乡 3 ns
+凤梨 31 nr
+凤梨汁 3 nr
+凤楼龙阙 3 nr
+凤歌笑 2 nr
+凤歌鸾舞 3 nr
+凤正言 2 nr
+凤毛济美 3 nr
+凤毛鸡胆 3 i
+凤毛麋角 3 v
+凤毛麟角 51 nr
+凤毛龙甲 3 nr
+凤求凰 5 nr
+凤求鸾 2 nr
+凤泉区 3 ns
+凤泊鸾漂 3 nr
+凤泊鸾飘 3 nr
+凤洲 2 ns
+凤爪 3 nr
+凤狂龙躁 3 i
+凤生凤 8 nr
+凤生祥 2 nr
+凤皇于蜚 3 i
+凤盘兄 2 nr
+凤眼 5 nr
+凤眼兰 3 nr
+凤眼朝 3 nr
+凤眼莲 6 nr
+凤祥银 2 nr
+凤管鸾笙 3 nr
+凤箫龙管 3 nr
+凤翅金 3 nr
+凤翅银 2 nr
+凤翔 116 nr
+凤翔县 13 nr
+凤翔路 3 nr
+凤翥鸾回 3 nr
+凤翥鸾翔 3 nr
+凤翥鹏翔 3 nr
+凤翥龙翔 3 nr
+凤翥龙蟠 3 nr
+凤翥龙骧 3 nr
+凤老大 3 nr
+凤老爷 52 nr
+凤腾蛟 2 nr
+凤臆龙鬐 3 nz
+凤舞香罗 3 nr
+凤舞鸾 2 nr
+凤舞龙蟠 3 nr
+凤舞龙飞 3 nr
+凤艳阁 3 nr
+凤英忙 2 nr
+凤英才 2 nr
+凤藻宫 5 nr
+凤虚凰 4 nr
+凤蝶 18 nr
+凤表龙姿 3 nz
+凤贾瑞 2 nr
+凤起路 3 nr
+凤辣子 2 nr
+凤采鸾章 3 nr
+凤阁鸾 16 nr
+凤阁龙 3 nr
+凤阁龙楼 3 nr
+凤阳 208 ns
+凤阳县 18 ns
+凤阳山 7 nr
+凤阳花鼓 3 nr
+凤阳路 3 nr
+凤附龙攀 3 i
+凤雏乎 2 nr
+凤雏麟子 3 nr
+凤靡鸾吪 3 i
+凤飞飞 3 nr
+凤食鸾栖 3 nr
+凤骨龙姿 3 nr
+凤髓龙肝 3 n
+凤鸟纹 3 nr
+凤鸣古 2 nr
+凤鸣朝阳 3 nr
+凤鸣歧 7 nr
+凤鸣轩 3 nr
+凤鸣鹤唳 3 i
+凤鸣麟出 3 i
+凤麟龙 2 nr
+処 4 zg
+凨 2 zg
+凫 49 zg
+凫居雁聚 3 nr
+凫水 7 v
+凫短鹤长 3 z
+凫胫鹤膝 3 nr
+凫趋雀跃 3 nr
+凫鹤从方 3 z
+凭 5717 p
+凭仗 11 n
+凭依 14 v
+凭信 28 n
+凭借 1551 p
+凭借着 120 p
+凭几之诏 3 n
+凭几据杖 3 n
+凭券 3 n
+凭单 9 n
+凭单日记 3 n
+凭吊 71 v
+凭坚 5 n
+凭城借一 3 n
+凭处方 3 n
+凭恃 3 v
+凭感觉 3 n
+凭据 54 p
+凭栏 38 n
+凭栏处 3 n
+凭照 16 p
+凭白无故 3 i
+凭直觉 3 i
+凭眺 4 v
+凭着 223 p
+凭祥 28 n
+凭祥市 8 ns
+凭票 3 n
+凭票供应 3 n
+凭票入场 3 n
+凭空 170 n
+凭空出现 3 i
+凭空妄断 3 i
+凭空想像 3 n
+凭空想象 3 n
+凭空捏造 17 i
+凭空猜测 3 i
+凭空臆造 3 vn
+凭肉眼 3 i
+凭良心 3 n
+凭良心讲 3 n
+凭良心说 3 i
+凭藉 6 v
+凭藉着 3 y
+凭虚公子 3 n
+凭虚御风 3 n
+凭证 318 n
+凭证入场 3 n
+凭证式 4 n
+凭轼旁观 3 ns
+凭轼结辙 3 v
+凭险 3 n
+凭靠 3 v
+凭靠着 3 n
+凮 7 zg
+凯 365 nr
+凯丝 7 nrt
+凯丰 4 nz
+凯伊 5 nrt
+凯伦 38 nrt
+凯克 4 nrt
+凯兴 4 nrt
+凯内马 2 nz
+凯利 114 nrt
+凯别兴 3 nr
+凯勒 12 nrt
+凯华 7 nz
+凯南 7 ns
+凯厄 3 nrt
+凯地 10 nrt
+凯地系 2 nz
+凯塔 3 nrt
+凯塞尔江 3 ns
+凯塞琳 3 nrt
+凯夫 9 nrt
+凯夫拉维克 2 nrt
+凯奇 4 nrt
+凯宾斯基 10 nrt
+凯尔 12 nrt
+凯尔奈克 3 nr
+凯尔恩斯 4 nrt
+凯尔森 9 nr
+凯尔特 77 nrt
+凯尔特人 3 nrt
+凯尔特语 7 nz
+凯尔盖朗 2 nr
+凯尼 5 nrt
+凯尼恩 2 nr
+凯巴鲁斯 4 nrt
+凯布 2 nrt
+凯德 8 nrt
+凯恩 17 nrt
+凯恩斯 120 nrt
+凯恩斯主义 30 nr
+凯悦 5 nr
+凯拉 6 nrt
+凯撒 145 nrt
+凯撒公司 3 nr
+凯撒大帝 6 nrt
+凯文 40 nz
+凯斯 12 nrt
+凯斯勒 2 nrt
+凯旋 297 nr
+凯旋归来 531 i
+凯旋路 3 nr
+凯旋门 56 nr
+凯普 6 nrt
+凯普莱特 2 nrt
+凯末尔 57 nrt
+凯桑 4 nrt
+凯歌 114 nr
+凯比尔 5 nr
+凯氏定氮 3 nz
+凯氏带 3 nr
+凯泰 2 nz
+凯泽斯劳 51 nr
+凯洛 15 nrt
+凯特 12 nrt
+凯特尔 7 nrt
+凯特林 2 nr
+凯瑟 7 nrt
+凯瑟琳 19 nrt
+凯瑟纳斯 3 nrt
+凯神网 3 nz
+凯科 11 nrt
+凯纳 3 nrt
+凯维奇 14 nr
+凯罗 4 nrt
+凯美瑞 3 nr
+凯莱 30 nrt
+凯萨格兰 2 nrt
+凯蒂 24 nrt
+凯西 11 nrt
+凯迪拉克 8 nrt
+凯里 46 nrt
+凯里尼亚 3 nrt
+凯里市 7 ns
+凯门鳄 3 n
+凯马 3 nrt
+凯鲁万 3 nr
+凯鲁亚克 3 nrt
+凰 125 x
+凰凤 3 nz
+凰牙 3 nz
+凰裰 3 n
+凳 415 n
+凳子 352 n
+凵 28 zg
+凶 1674 zg
+凶事 3 n
+凶信 7 a
+凶兆 17 n
+凶具 3 n
+凶凶 3 n
+凶凶恶恶 3 i
+凶凶狠狠 3 i
+凶吉难卜 3 n
+凶喘肤汗 3 n
+凶器 47 n
+凶多吉少 112 i
+凶嫌 3 a
+凶宅 30 n
+凶岁 3 n
+凶巴巴 7 z
+凶年 11 n
+凶年饥岁 3 i
+凶徒 3 n
+凶得狠 3 a
+凶恶 278 a
+凶悍 122 a
+凶手 419 n
+凶暴 43 a
+凶服 3 a
+凶杀 88 v
+凶杀案 10 n
+凶案 4 n
+凶横 36 a
+凶死 3 a
+凶残 120 a
+凶残成性 2 i
+凶气 11 a
+凶焰 12 n
+凶煞 7 n
+凶犯 23 n
+凶狂 4 a
+凶狠 298 a
+凶狠残暴 3 i
+凶猛 698 a
+凶猛地 3 i
+凶相 24 n
+凶相毕露 139 i
+凶神 18 n
+凶神恶煞 83 i
+凶神附体 3 i
+凶终隙未 3 i
+凶终隙末 3 i
+凶耗 3 n
+凶起来 3 i
+凶险 547 an
+凶顽 22 a
+凶魔 5 n
+凸 565 v
+凸凹 8 n
+凸凹不平 10 l
+凸凹性 3 l
+凸出 259 v
+凸出去 3 v
+凸出成 3 v
+凸出来 3 v
+凸出舞台 3 n
+凸出蛋白 3 l
+凸函数 3 l
+凸嘴 3 v
+凸多边形 3 l
+凸多面锥 3 n
+凸字形 3 n
+凸岸坝 3 n
+凸度 3 n
+凸显 181 a
+凸显出 3 v
+凸板印刷 3 l
+凸版 32 v
+凸版印刷 3 l
+凸状 3 n
+凸状物 3 l
+凸环 3 n
+凸现 145 v
+凸着 3 v
+凸砖层 3 n
+凸窗 3 n
+凸纹 5 n
+凸纹饰物 3 n
+凸缘 3 n
+凸角 3 n
+凸起 143 v
+凸起来 3 l
+凸起碱基 3 n
+凸轮 19 n
+凸轮轴 6 n
+凸边 3 n
+凸边角 3 n
+凸透 3 v
+凸透镜 31 n
+凸镜 5 n
+凸面 9 n
+凸面镜 12 n
+凸颌畸形 3 vn
+凹 659 a
+凹下 3 v
+凹下去 3 l
+凹下来 3 l
+凹凸 123 n
+凹凸不平 49 l
+凹凸感 2 l
+凹凸棒 3 nz
+凹凸棒石 10 nz
+凹凸镜 2 nz
+凹凹 3 n
+凹凹凸凸 3 l
+凹印机 3 n
+凹口 3 n
+凹地 3 n
+凹坑 13 n
+凹处 3 n
+凹字 3 nz
+凹度 3 n
+凹形 10 n
+凹槽 31 nz
+凹槽铁轨 3 n
+凹沟 3 n
+凹洞 3 n
+凹洼 3 nz
+凹版 21 v
+凹玻片 3 l
+凹痕 3 n
+凹角 3 nz
+凹进 16 v
+凹透 3 nz
+凹透镜 12 nz
+凹镜 2 nz
+凹陷 178 v
+凹陷型 2 n
+凹陷处 3 n
+凹面 19 n
+凹面镜 31 nz
+出 85847 v
+出一头地 3 i
+出上 3 v
+出下 3 v
+出不去 3 v
+出不来 3 v
+出不起 3 v
+出丑 87 v
+出丑扬疾 3 i
+出丑放乖 3 i
+出世 272 v
+出世作 3 i
+出世离群 3 i
+出世超凡 3 i
+出丧 3 v
+出个价 3 n
+出之以诚 3 l
+出乎 324 v
+出乎反乎 3 l
+出乎意外 24 l
+出乎意料 204 l
+出乎意表 3 l
+出乎预料 19 l
+出乖弄丑 3 i
+出乖露丑 3 i
+出书 95 v
+出乱子 40 l
+出了名 3 i
+出了门 3 i
+出事 258 v
+出事地点 3 n
+出于 2743 v
+出于公心 3 l
+出于意外 3 l
+出于意表 3 l
+出于无奈 25 i
+出云 11 v
+出云入泥 3 i
+出井 8 v
+出亡 3 v
+出产 442 vn
+出产地 2 n
+出人命 69 i
+出人头地 86 i
+出人意外 39 i
+出人意料 284 l
+出人意表 30 l
+出人望外 3 i
+出人预料 5 l
+出仓 6 v
+出仕 3 v
+出以公心 7 l
+出价 85 v
+出任 1238 v
+出份子 3 n
+出伏 3 v
+出众 171 n
+出位 3 v
+出何典记 3 n
+出何经典 3 n
+出使 382 v
+出借 17 v
+出借书 3 n
+出入 2403 v
+出入人罪 3 i
+出入口 39 i
+出入境 239 l
+出入将相 3 i
+出入库 3 n
+出入无间 3 i
+出入生死 3 i
+出入神鬼 3 i
+出入证 2 j
+出公差 5 n
+出公忘私 3 i
+出关 109 v
+出兵 763 v
+出其不备 3 i
+出其不意 316 i
+出其不虞 3 v
+出具 329 v
+出典 15 n
+出内之吝 3 i
+出军 3 v
+出冷汗 10 l
+出冷门 2 v
+出凡入胜 3 i
+出出 64 v
+出出入入 3 i
+出出律律 3 n
+出出气 12 i
+出出进进 32 v
+出击 720 v
+出刀 3 v
+出刊 3 v
+出列 8 v
+出到 3 v
+出力 372 n
+出动 859 v
+出勤 21 v
+出勤率 12 n
+出卖 826 v
+出卖方 3 n
+出卖灵魂 6 i
+出厂 110 n
+出厂价 28 n
+出厂价格 3 n
+出厂日期 3 n
+出去 9979 v
+出去玩 3 n
+出双入对 3 i
+出发 3887 v
+出发地 17 n
+出发点 398 n
+出口 8237 vn
+出口业 4 n
+出口产品 3 n
+出口伤人 15 n
+出口值 59 n
+出口儿 3 n
+出口入耳 3 i
+出口创汇 3 n
+出口品 12 n
+出口商 65 n
+出口商品 3 n
+出口国 130 n
+出口型 43 n
+出口处 41 i
+出口导向型 8 n
+出口成章 51 i
+出口权 2 n
+出口气 3 n
+出口率 2 n
+出口税 17 n
+出口货 3 n
+出口贸易 3 l
+出口路 27 n
+出口部 2 n
+出口配额 3 n
+出口量 126 n
+出口额 117 n
+出台 1317 v
+出名 1138 v
+出名门 3 n
+出品 291 n
+出品人 3 n
+出品商 3 n
+出品地 3 n
+出售 2413 vn
+出售一空 3 n
+出售摊 3 n
+出售方 4 n
+出售者 20 n
+出唱片 3 n
+出国 915 v
+出国人员 3 l
+出国前 3 l
+出国境 13 l
+出国时 3 l
+出国梦 2 l
+出国深造 3 l
+出国游 8 n
+出国考察 3 n
+出国者 3 n
+出国访问 3 l
+出圈 3 n
+出圈儿 3 l
+出土 1785 v
+出土文物 89 l
+出圣入神 3 i
+出场 677 n
+出场费 8 v
+出埃及记 3 i
+出城 3 v
+出塞 62 v
+出塞曲 3 n
+出境 830 n
+出境游 233 v
+出境签证 3 n
+出境证 3 v
+出境部 7 n
+出声 3 v
+出声思维 3 l
+出声语言 3 i
+出处 95 v
+出处殊涂 3 v
+出处殊途 3 n
+出处语默 3 v
+出处进退 3 l
+出备 7 v
+出外 253 v
+出外人 3 n
+出外景 3 n
+出头 320 v
+出头之日 74 i
+出头天 3 i
+出头露面 25 i
+出头首 2 i
+出头鸟 3 i
+出夷入险 3 i
+出奇 329 a
+出奇不穷 3 i
+出奇划策 3 i
+出奇制胜 323 i
+出奇取胜 3 i
+出奇无穷 3 i
+出奇致胜 3 i
+出奔 63 v
+出奴入主 3 n
+出奶 3 n
+出好 3 v
+出如脱兔 3 i
+出嫁 389 v
+出家 302 v
+出家为尼 10 l
+出家人 271 n
+出将入相 17 i
+出尔反尔 58 nz
+出尘 3 v
+出尘不染 3 i
+出尘子 3 n
+出尘脱俗 2 i
+出局 122 n
+出展 2 vn
+出山 283 v
+出山泉水 3 i
+出山济世 3 l
+出岔 3 v
+出岔子 17 l
+出巡 77 v
+出工 18 v
+出差 409 v
+出差费 6 i
+出差错 3 i
+出师 221 n
+出师不利 17 l
+出师无名 3 i
+出师有名 3 i
+出师表 20 n
+出帐期 3 n
+出带 8 v
+出席 4001 v
+出席人 27 n
+出席会议 3 l
+出席率 3 n
+出席观看 3 l
+出席证 2 n
+出幽升高 3 n
+出库 12 n
+出度 6 n
+出庭 72 n
+出庭作证 3 n
+出庭应讯 3 n
+出弦度 3 n
+出彩 25 v
+出征 1444 v
+出徒 3 n
+出得 3 v
+出恭 16 v
+出息 239 v
+出战 191 v
+出手 1468 v
+出手不凡 8 l
+出手得卢 3 n
+出报 3 v
+出招表 3 v
+出拳 48 v
+出掌 3 v
+出摊 2 v
+出操 18 v
+出操课 3 n
+出敌不意 35 i
+出敌意外 3 i
+出文入武 3 i
+出料 4 v
+出断 3 v
+出新 299 v
+出新招 3 j
+出新规 3 n
+出有 3 v
+出有入无 2 i
+出来 31017 v
+出栏 301 v
+出栏数 3 n
+出栏率 8 n
+出校 3 n
+出格 55 n
+出榜 62 v
+出此下策 3 l
+出死入生 16 i
+出死力 18 n
+出死断亡 3 i
+出殡 39 v
+出殡日 3 vn
+出毛病 21 n
+出气 121 v
+出气口 3 vn
+出气筒 21 n
+出水 165 v
+出水口 14 n
+出水孔 8 n
+出水才看两腿泥 5 l
+出水管 5 n
+出水芙蓉 13 i
+出水量 7 n
+出汗 217 v
+出污泥而不染 6 i
+出没 320 v
+出没不定 3 v
+出没不常 3 i
+出没无常 17 i
+出油 3 v
+出油率 5 n
+出洋 75 n
+出洋相 11 n
+出活 5 vn
+出浅入深 3 i
+出浴 12 v
+出海 303 v
+出海口 76 n
+出海打鱼 3 i
+出海捕鱼 3 l
+出淤泥而 3 l
+出淤泥而不染 2 l
+出清 10 v
+出渣 4 n
+出港 37 n
+出港证 3 j
+出游 376 vn
+出游率 2 n
+出游者 13 n
+出溜 3 v
+出漏子 2 i
+出演 26 v
+出炉 368 v
+出点 147 n
+出点子 8 v
+出版 5962 v
+出版业 49 n
+出版业务 3 n
+出版事业 3 n
+出版单位 3 n
+出版发行 3 n
+出版商 48 n
+出版地缺 3 l
+出版学 10 n
+出版家 29 n
+出版局 11 n
+出版日期 3 n
+出版期缺 3 l
+出版权 6 n
+出版法 3 n
+出版物 320 n
+出版界 46 n
+出版社 1160 n
+出版署 50 n
+出版者 18 n
+出版部 28 n
+出版部门 3 n
+出版量 3 n
+出版项 3 n
+出牌 3 v
+出狱 231 v
+出猎 50 v
+出现 25633 v
+出现分歧 3 n
+出现异常 3 l
+出现意外 3 l
+出球 3 n
+出生 1979 v
+出生人数 3 l
+出生入死 100 i
+出生创伤 3 l
+出生地 84 n
+出生地点 3 n
+出生年月 3 l
+出生日期 3 n
+出生率 325 n
+出生纸 3 v
+出生证 2 v
+出生证明 3 v
+出生高峰 3 n
+出电 2 v
+出界 159 n
+出疹子 7 n
+出盘 3 v
+出砂层 3 n
+出示 253 v
+出示证件 3 n
+出神 110 v
+出神入化 110 l
+出神入定 3 l
+出离 3 v
+出租 251 v
+出租人 10 n
+出租屋 5 n
+出租店 3 n
+出租房 3 n
+出租方 3 n
+出租汽车 105 n
+出租率 22 n
+出租车 395 n
+出租车费 5 n
+出稿 3 v
+出窑 3 v
+出站口 9 n
+出笼 43 v
+出米率 4 n
+出类拔萃 117 i
+出粉率 4 n
+出粪口 3 n
+出纰漏 3 vn
+出纳 79 v
+出纳台 3 n
+出纳员 9 n
+出纳处 3 i
+出纳科 3 nrt
+出纳系统 3 l
+出纳组 3 n
+出线 127 n
+出线权 28 n
+出给 3 v
+出缺 295 v
+出群拔萃 3 i
+出老千 3 i
+出肉率 2 n
+出脉冲 2 i
+出脓 3 v
+出脱 11 v
+出自 847 v
+出自于 3 v
+出自内心 3 i
+出自意外 3 i
+出航 46 v
+出色 1260 v
+出色完成 3 l
+出芽 28 v
+出芽法 3 n
+出芽生殖 8 l
+出苗 22 v
+出苗率 4 n
+出落 31 v
+出虚汗 3 l
+出血 563 v
+出血性 31 n
+出血指数 3 n
+出血点 7 n
+出血热 24 i
+出血病 6 n
+出血量 42 n
+出行 414 v
+出行分布 3 n
+出行生成 3 v
+出街 3 v
+出言 407 v
+出言不慎 4 i
+出言不逊 30 i
+出言吐气 3 i
+出言吐词 3 i
+出言吐语 3 i
+出言成章 3 i
+出言无状 10 i
+出言有章 3 i
+出警 7 v
+出警率 3 n
+出让 108 v
+出让方 3 n
+出让金 8 n
+出访 396 v
+出诊 62 v
+出词吐气 3 i
+出语成章 3 i
+出调 3 v
+出谋划策 85 n
+出谋献策 13 n
+出谋画策 3 i
+出账 3 v
+出货 53 v
+出货单 3 n
+出货量 80 l
+出质人 3 n
+出费 3 vn
+出资 391 vn
+出资人 10 n
+出资方 2 n
+出资者 5 n
+出资额 22 n
+出赛 6 vn
+出走 119 v
+出起 3 v
+出超 31 v
+出超国 3 i
+出超额 3 i
+出路 881 v
+出身 2739 v
+出身高贵 3 i
+出车 24 v
+出车祸 3 i
+出轨 47 v
+出轨行为 3 l
+出过 233 v
+出迎 130 v
+出运 3 v
+出进 3 v
+出远门 3 n
+出逃 147 v
+出道 51 v
+出道时 3 n
+出量 3 v
+出钱 298 v
+出钱出力 3 i
+出锋头 3 n
+出错 156 v
+出错中断 3 i
+出错率 6 n
+出镜 13 n
+出镜率 19 n
+出门 1716 v
+出门儿 3 l
+出门合辙 3 i
+出门在外 42 l
+出门如宾 3 i
+出门子 7 n
+出门应辙 3 i
+出门时 3 l
+出阁 73 v
+出阵 61 v
+出陈易新 3 i
+出院 166 n
+出险 19 v
+出险率 2 n
+出难题 11 n
+出震继离 3 i
+出面 896 n
+出鞘 182 v
+出韵 3 n
+出题 238 n
+出题者 12 n
+出题词 3 i
+出风口 4 n
+出风头 75 l
+出饭 3 v
+出首 3 v
+出马 371 v
+出马上场 3 n
+出马上阵 3 i
+出鬼 3 v
+出鬼入神 3 i
+出齐 3 v
+击 4400 v
+击中 646 v
+击中目标 2 n
+击中要害 13 i
+击伤 106 v
+击倒 100 v
+击其不意 3 i
+击其惰归 2 vn
+击出 166 v
+击剑 120 v
+击剑场地 3 i
+击剑队 3 i
+击发 2 v
+击向 3 v
+击坠王 3 n
+击垒 3 v
+击垮 27 v
+击壤鼓腹 3 i
+击天抓地 3 z
+击弦机 6 n
+击打 189 v
+击打噪声 3 n
+击打式打印机 10 i
+击掌 96 v
+击排冒没 3 i
+击搏挽裂 3 vn
+击撞 3 v
+击昏 3 v
+击杀 3 v
+击板 3 v
+击楫中流 3 vn
+击槌 3 v
+击毁 144 v
+击毂摩肩 3 i
+击毙 248 v
+击水 3 v
+击沉 208 v
+击溃 335 v
+击爆 3 v
+击玉敲金 3 i
+击球 179 v
+击球员 16 n
+击球手 3 n
+击电奔星 3 i
+击石弹丝 3 n
+击破 182 v
+击碎 3 v
+击碎唾壶 3 v
+击穿 158 v
+击穿场强 3 i
+击筑 3 v
+击筑悲歌 3 vn
+击缶 3 vn
+击节 49 v
+击节叹赏 3 i
+击节称赏 3 i
+击落 503 v
+击败 1612 v
+击退 347 v
+击钟陈鼎 3 i
+击钟鼎食 3 i
+击钵催诗 3 v
+击错 3 v
+击锣 3 v
+击键 5 n
+击鞭锤镫 3 i
+击鼓 122 v
+击鼓作乐 3 i
+击鼓鸣冤 3 i
+击鼓鸣金 3 i
+凼 77 g
+凼仔岛 9 ns
+函 543 n
+函令 3 n
+函件 37 n
+函养 3 n
+函告 6 n
+函商 3 n
+函复 3 v
+函大 7 j
+函寄 3 v
+函括 3 v
+函授 90 n
+函授大学 12 n
+函授学校 3 n
+函授教育 3 n
+函授班 2 n
+函授生 7 n
+函授站 3 n
+函授课 2 n
+函授部 6 n
+函数 2648 n
+函数参数 4 n
+函数库 3 n
+函数指针 2 n
+函数调用 3 n
+函梏关 3 vn
+函洞 3 n
+函电 17 n
+函盖乾坤 3 nz
+函盖充周 3 n
+函矢相攻 3 nr
+函索 3 n
+函聘 3 v
+函蕴 3 n
+函询 4 vn
+函调 3 n
+函谷关 45 n
+函购 3 v
+函购量 3 n
+函送 3 v
+函馆 3 n
+凿 1011 v
+凿井 37 n
+凿井机 3 n
+凿冰 14 v
+凿出 3 v
+凿出去 3 v
+凿出来 3 v
+凿凿 3 v
+凿凿可据 3 i
+凿凿有据 3 i
+凿印 3 v
+凿壁偷光 3 i
+凿壁谈婚 3 i
+凿子 54 n
+凿孔 10 n
+凿孔机 3 n
+凿定 3 v
+凿山 3 n
+凿岩 14 n
+凿岩机 12 n
+凿川 3 n
+凿开 3 v
+凿成 3 v
+凿枘相应 3 nz
+凿柱取书 3 n
+凿楹纳书 3 nz
+凿沉 3 v
+凿洞 3 n
+凿状切牙 3 l
+凿穴 3 n
+凿空 11 n
+凿空之论 3 i
+凿空取办 3 i
+凿空投隙 3 n
+凿穿 3 v
+凿船 3 n
+凿进 3 v
+凿进去 3 v
+凿进来 3 l
+凿隧入井 3 n
+凿饮耕食 3 n
+凿骨捣髓 3 i
+凿龟数策 3 n
+刀 9271 n
+刀下留人 3 n
+刀下留情 3 n
+刀不刃血 3 i
+刀世勋 2 n
+刀丹 146 n
+刀丹之 2 i
+刀丹修 2 n
+刀丹元婴 5 n
+刀伤 59 n
+刀俎 5 n
+刀俎余生 3 i
+刀俎鱼肉 3 i
+刀修 7 nrfg
+刀儿 4 n
+刀光 3 n
+刀光剑影 61 i
+刀光血影 5 i
+刀兵 67 n
+刀兵刀叉 3 n
+刀具 155 n
+刀具厂 3 n
+刀具耐用 3 l
+刀刀 3 n
+刀刀见血 3 i
+刀刃 158 n
+刀切 2 n
+刀切斧砍 3 i
+刀刮水洗 3 i
+刀刻 3 n
+刀削 36 b
+刀削面 11 n
+刀剑 474 n
+刀剑笑 3 i
+刀剪 7 n
+刀割 94 n
+刀功 3 n
+刀匠 3 n
+刀叉 33 n
+刀口 53 n
+刀口尺 3 i
+刀口浪尖 3 n
+刀头 55 n
+刀头之蜜 3 n
+刀头剑首 3 i
+刀头燕尾 3 i
+刀头舔蜜 3 z
+刀子 595 n
+刀子嘴 6 n
+刀客 3 n
+刀尖 125 n
+刀山 63 n
+刀山剑林 7 i
+刀山剑树 3 i
+刀山火海 12 i
+刀工 264 n
+刀币 19 n
+刀库 3 n
+刀开关 3 i
+刀形天线 3 n
+刀影 12 n
+刀手 30 n
+刀把 50 n
+刀把儿 3 n
+刀把子 12 n
+刀数 3 n
+刀斧手 78 n
+刀旋 42 n
+刀术 5 n
+刀枪 245 n
+刀枪不入 66 i
+刀枪入库 3 n
+刀枪剑戟 34 i
+刀架 23 n
+刀柄 91 n
+刀柱 2 n
+刀械 3 n
+刀棍 3 n
+刀棍齐加 3 i
+刀法 623 n
+刀片 74 n
+刀片式 3 n
+刀王 4 n
+刀疤 36 n
+刀痕 150 n
+刀白凤 3 n
+刀笔 12 n
+刀笔春秋 3 i
+刀箭 3 n
+刀红光 2 n
+刀美兰 260 nrfg
+刀耕火种 62 i
+刀耕火耘 3 n
+刀背 94 n
+刀芒 11 n
+刀螂 3 n
+刀豆 12 n
+刀豆氨酸 3 n
+刀身 37 n
+刀过竹解 3 i
+刀锋 155 n
+刀锋冷 3 i
+刀锋战士 3 n
+刀锯 16 n
+刀锯斧钺 3 i
+刀面 3 n
+刀鞘 81 n
+刀马 9 n
+刀马旦 8 i
+刀魂 3 n
+刀鱼 24 n
+刁 108 nr
+刁光覃 3 nr
+刁吉儿 3 nr
+刁天决地 3 i
+刁徒藏 2 nr
+刁德一 2 nr
+刁恶 2 a
+刁悍 3 a
+刁斗 15 nr
+刁斗森严 3 nr
+刁明忠 15 nr
+刁明生 4 nr
+刁柔 2 a
+刁民 28 nr
+刁滑 11 a
+刁滑奸诈 3 i
+刁猾 3 a
+刁翎镇 4 nr
+刁老镖 2 nr
+刁蛮 18 nr
+刁诈 3 a
+刁钻 101 nr
+刁钻促搯 3 i
+刁钻刻薄 3 i
+刁钻古怪 51 i
+刁难 97 a
+刁顽 11 nr
+刁顽不化 3 i
+刂 208 zg
+刃 1027 ng
+刃儿 3 n
+刃具 6 n
+刃具厂 2 n
+刃口 36 n
+刃树剑山 3 n
+刃片 3 n
+刃磨 2 v
+刃脊 3 n
+刃角 3 n
+刃迎缕解 3 n
+刃量具 3 n
+刃量具厂 3 n
+刃锋 3 n
+刄 27 zg
+分 34660 v
+分一杯 3 m
+分一杯羹 3 n
+分三别两 3 i
+分三步 3 m
+分不出 3 v
+分不开 3 v
+分不清 3 l
+分不清楚 3 l
+分业 5 n
+分业制 3 n
+分丝析缕 3 i
+分两路 3 m
+分个 3 m
+分中心 24 n
+分为 8259 v
+分为两叉 3 l
+分久必合 10 i
+分书 3 n
+分争 20 vn
+分享 3091 v
+分享者 2 n
+分付 292 vn
+分众传媒 3 l
+分会 436 n
+分会场 17 n
+分体 9 n
+分体式 3 n
+分作 3 vn
+分保 3 vn
+分信 3 vn
+分值 180 n
+分做 3 v
+分光 73 n
+分光仪 20 n
+分光计 5 n
+分光蹈影 3 i
+分光镜 10 n
+分克 3 q
+分党 3 n
+分公司 701 n
+分兵 3 n
+分兵把口 3 n
+分兵把守 3 v
+分内 81 n
+分内之事 3 n
+分内事 3 n
+分内分外 3 l
+分册 42 v
+分出 326 v
+分出层次 3 m
+分分 3 d
+分分合合 8 n
+分分秒秒 10 i
+分切 8 vn
+分切机 3 n
+分划 51 n
+分划格 3 n
+分列 235 q
+分列为 3 v
+分列式 8 n
+分则 47 n
+分利 2 vn
+分别 16537 d
+分别安 3 ns
+分别独立 4 i
+分别编 22 v
+分别部居 3 n
+分别门户 3 n
+分到 3 v
+分剧 3 n
+分割 803 v
+分割器 3 n
+分割线 3 n
+分割肉 3 n
+分割部分 3 l
+分力 23 n
+分动箱 29 n
+分劳赴功 3 i
+分匀 3 vn
+分包 4 n
+分包商 2 n
+分化 1354 vn
+分化中心 3 l
+分化成 3 n
+分化抗原 3 n
+分化时 3 n
+分化瓦解 24 n
+分化腺癌 6 n
+分区 280 n
+分区制 3 n
+分区蛋白 3 n
+分区表 3 n
+分区规划 3 n
+分区赛 3 n
+分升 3 v
+分半信度 3 n
+分占 3 v
+分卷 25 m
+分卷压缩 3 l
+分厂 100 n
+分压器 6 n
+分厘卡 3 q
+分厘毫丝 3 m
+分去 3 v
+分叉 116 v
+分发 178 v
+分发者 3 n
+分句 14 m
+分号 19 n
+分合 3 vn
+分唱 3 v
+分团 256 n
+分团委 3 n
+分国 3 n
+分圆单位 3 n
+分在 3 v
+分地 3 n
+分场 25 n
+分块 14 n
+分型 35 n
+分处 20 d
+分外 263 vn
+分外夺目 2 n
+分外妖娆 3 i
+分外眼红 4 l
+分头 384 v
+分头办理 3 n
+分头去 3 l
+分头来 3 d
+分奏 3 v
+分好 3 d
+分委会 14 n
+分娩 306 v
+分娩台 3 n
+分娩期 10 n
+分子 6094 n
+分子光谱 3 n
+分子力 6 n
+分子尾 3 n
+分子式 282 n
+分子晶体 3 n
+分子溶液 10 n
+分子热 7 n
+分子生物 3 n
+分子生物学 84 n
+分子生物学家 7 n
+分子电流 3 n
+分子病 7 n
+分子磁矩 3 n
+分子离子 3 n
+分子积分 3 n
+分子筛 29 n
+分子结构 124 n
+分子论 2 n
+分子运动 3 l
+分子量 194 n
+分季 3 n
+分守 3 v
+分守要津 3 l
+分宜 9 v
+分宜县 3 ns
+分家 110 n
+分家析产 3 n
+分寄 3 v
+分寸 131 n
+分寸之末 3 i
+分寸已乱 3 i
+分对 3 d
+分封 269 v
+分封制 3 n
+分小组 2 n
+分尸 3 n
+分尸案 3 n
+分局 410 n
+分局长 2 n
+分层 178 n
+分层抽样 3 i
+分层负责 3 l
+分居 99 v
+分屏 3 n
+分属 273 n
+分岐 3 nrt
+分岔 26 v
+分岔系数 3 l
+分岗 3 vn
+分崩离兮 3 i
+分崩离析 52 i
+分工 1166 vn
+分工会 3 n
+分工协作 3 n
+分工合作 42 n
+分工负责 3 l
+分工负责制 4 l
+分币 2 n
+分布 12435 v
+分布力 3 n
+分布区 182 n
+分布区型 3 n
+分布图 48 n
+分布式 62 n
+分布式应用 2 n
+分布式文件系统 2 l
+分布式服务 2 n
+分布式系统 3 l
+分布式计算 8 n
+分布模式 2 n
+分布电容 3 n
+分布负载 3 b
+分布面 6 n
+分帐 3 n
+分带 3 n
+分床 3 vn
+分床同梦 3 i
+分床而眠 3 l
+分床而睡 3 l
+分库 10 n
+分店 67 n
+分度 24 n
+分度器 3 n
+分度头 2 n
+分度规 3 n
+分庭 3 n
+分庭亢礼 3 i
+分庭伉礼 3 vn
+分庭抗礼 59 n
+分开 1155 v
+分式 11 n
+分式域 3 n
+分式方程 3 l
+分张 3 v
+分当 3 d
+分录 3 v
+分形 31 n
+分形共气 3 l
+分形同气 3 l
+分得 74 v
+分得出 3 v
+分得清 3 v
+分心 136 v
+分心挂腹 3 i
+分忧 111 v
+分忧解愁 3 i
+分情破爱 3 i
+分成 2237 v
+分成二份 3 nz
+分成等级 3 l
+分我杯羹 3 n
+分截 3 v
+分户帐 3 n
+分房 76 n
+分房减口 3 n
+分所 22 v
+分手 439 v
+分手时 3 n
+分批 234 m
+分批交货 3 n
+分批分期 3 m
+分批发酵 3 n
+分批培养 3 l
+分批工艺 3 n
+分批抽提 3 vn
+分批提取 3 l
+分批操作 3 l
+分批法 3 n
+分批过滤 3 n
+分批进行 3 n
+分担 273 v
+分拆 84 v
+分拆函数 3 n
+分拣 26 v
+分拣机 4 n
+分拨 84 v
+分持 3 v
+分指 3 n
+分指数 8 n
+分排 3 vn
+分插 3 v
+分摊 104 vn
+分支 1551 n
+分支机关 3 n
+分支机构 4 n
+分支行 10 j
+分散 1432 v
+分散主义 2 n
+分散介质 3 n
+分散剂 9 n
+分散力 3 n
+分散化 10 n
+分散型 8 n
+分散城市 3 n
+分散学习 3 n
+分散度 3 n
+分散开来 3 i
+分散式 4 n
+分散性 9 n
+分散控制 5 n
+分散机 3 n
+分散染料 3 n
+分散片 3 n
+分散相 24 n
+分散系统 3 n
+分散聚合 3 n
+分散酶 3 n
+分数 1157 n
+分数指数 3 n
+分数段 24 n
+分数线 569 n
+分文 118 n
+分文不值 4 l
+分文不取 8 l
+分文不名 3 l
+分文不收 3 l
+分文不直 3 v
+分文未取 3 l
+分斤拨两 3 i
+分斤掰两 3 nr
+分日线 3 n
+分时 45 d
+分时图 3 n
+分时操作系统 9 l
+分时系统 2 l
+分明 1254 v
+分星劈两 3 nr
+分星拨两 3 i
+分星擘两 3 nr
+分晓 103 v
+分朋引类 3 n
+分期 302 vn
+分期付款 99 l
+分期偿付 3 n
+分期分批 3 n
+分期清偿 3 i
+分机 11 n
+分机号 3 n
+分机电话 3 l
+分权 110 n
+分束器 3 n
+分条机 3 n
+分条析理 3 n
+分来 3 v
+分来分去 3 l
+分析 11086 vn
+分析仪 27 n
+分析仪器 3 n
+分析判断 3 n
+分析化学 52 n
+分析员 43 n
+分析和综 3 n
+分析器 14 n
+分析天平 3 n
+分析家 228 n
+分析属性 3 n
+分析师 510 n
+分析报告 3 n
+分析攻击 3 n
+分析方法 4 n
+分析树 3 n
+分析案情 3 n
+分析模型 7 n
+分析法 169 n
+分析测试 3 n
+分析画像 3 n
+分析程序 4 n
+分析线 3 n
+分析表明 3 n
+分析语 2 n
+分析课文 3 n
+分析阶段 5 n
+分析题 3 n
+分枝 279 n
+分枝杆菌 3 l
+分枝菌素 3 n
+分枝菌酸 3 n
+分枝进化 3 n
+分架 3 n
+分栏 3 n
+分校 417 n
+分株 29 m
+分格 3 n
+分桃 3 n
+分档 4 b
+分梳 3 vn
+分检 2 v
+分次 3 d
+分次施肥 3 v
+分次理想 3 n
+分款 3 n
+分步 43 d
+分步法 3 n
+分歧 984 n
+分歧点 6 n
+分段 169 n
+分段印模 3 n
+分段收票 3 n
+分段法 3 n
+分段策略 3 n
+分段运输 3 l
+分段进行 3 n
+分母 26 n
+分毫 160 m
+分毫不值 3 l
+分毫不取 3 l
+分毫不差 137 i
+分毫不爽 3 i
+分毫无爽 3 i
+分毫析厘 3 i
+分水 73 n
+分水器 3 n
+分水岭 614 n
+分水线 11 n
+分水闸 4 n
+分油 3 n
+分治 385 v
+分泌 1432 v
+分泌乳汁 3 n
+分泌液 9 n
+分泌物 304 n
+分泌管 3 n
+分泌系统 3 n
+分泌素 3 n
+分泌腺 3 n
+分泌量 3 n
+分法 3 n
+分洪 35 vn
+分洪区 7 n
+分洪河道 3 n
+分洪道 10 n
+分洪闸 3 n
+分派 210 n
+分派任务 3 n
+分流 1329 n
+分流器 4 n
+分流方程 3 l
+分流港 3 ns
+分流管 2 n
+分浅缘薄 3 i
+分润 3 n
+分清 142 v
+分清主次 7 n
+分清敌我 3 i
+分清是非 3 l
+分灶 3 n
+分点 40 n
+分烟析产 3 n
+分烟析生 3 n
+分片 24 n
+分片包干 3 n
+分片模式 3 l
+分牌 3 v
+分牙器 3 n
+分牙术 3 n
+分率 7 n
+分班 3 v
+分班考试 3 n
+分理 14 vn
+分理处 15 n
+分甘共苦 3 i
+分甘同苦 3 i
+分甘绝少 3 l
+分生 3 v
+分生孢子 3 n
+分生组织 3 n
+分用 3 v
+分由 3 d
+分电器 3 n
+分画 3 n
+分界 102 n
+分界点 133 n
+分界线 185 n
+分病毒 3 n
+分登 3 v
+分相 3 d
+分省 3 n
+分社 172 n
+分神 208 n
+分离 2309 v
+分离主义 7 n
+分离出来 3 i
+分离剂 3 n
+分离单元 3 n
+分离器 11 n
+分离式 11 n
+分离态射 3 n
+分离性 3 n
+分离机 12 n
+分离法 17 n
+分离点 3 n
+分离舱 3 n
+分种 3 m
+分科 70 n
+分秒 15 q
+分秒不差 3 i
+分秒必争 23 i
+分租 3 n
+分税制 13 n
+分立 243 v
+分立元件 6 n
+分立式 3 n
+分立电路 3 n
+分站 57 n
+分站赛 5 n
+分章 3 n
+分章析句 3 n
+分等级 2 b
+分管 320 vn
+分管领导 3 n
+分箱 3 n
+分篮 3 n
+分米 7 q
+分米波 6 n
+分类 3201 n
+分类人员 3 n
+分类单位 3 n
+分类卡 3 n
+分类号 3 n
+分类器 2 n
+分类学 111 n
+分类帐 3 n
+分类广告 3 n
+分类排列 3 l
+分类整理 3 n
+分类机 3 n
+分类法 133 n
+分类目录 3 n
+分类知觉 3 i
+分类程序 3 n
+分类空间 3 n
+分类管理 4 n
+分类箱 3 n
+分类索引 3 n
+分类者 3 n
+分类账 3 n
+分粒器 3 n
+分系统 43 l
+分红 219 v
+分红险 3 n
+分级 167 vn
+分级分离 3 n
+分级分类 3 n
+分级制 3 n
+分级制度 3 n
+分级机 3 n
+分级淬火 3 z
+分级管理 25 l
+分级网 3 n
+分线 2 n
+分线器 3 n
+分线盒 3 n
+分线盘 3 n
+分线规 3 n
+分组 151 vn
+分组会 3 n
+分组活动 3 l
+分组码 6 n
+分组讨论 3 n
+分组赛 6 n
+分给 391 v
+分维 3 n
+分网 3 n
+分置 3 v
+分署 9 v
+分群 3 n
+分而治之 18 l
+分肥 3 n
+分至 3 d
+分至点 13 d
+分色 12 n
+分色片 3 n
+分色镜 3 n
+分节 3 vn
+分节歌 3 n
+分花拂柳 9 i
+分花约柳 3 n
+分茅列土 3 n
+分茅胙土 3 vn
+分茅裂土 3 n
+分茅赐土 3 i
+分茅锡土 3 n
+分获 34 v
+分菜 3 n
+分营 2 vn
+分葱 3 b
+分蘖 48 n
+分蘖力 3 vn
+分蘖期 3 vn
+分蘖节 3 z
+分蜜机 3 n
+分行 437 v
+分行业 6 n
+分表 8 n
+分裂 2418 v
+分裂主义 33 n
+分裂性 3 n
+分裂法 3 n
+分裂症 3 n
+分裂细胞 3 n
+分装 46 v
+分规 3 vn
+分角器 3 n
+分解 1363 v
+分解代谢 3 i
+分解力 3 n
+分解器 3 n
+分解成 3 n
+分解掉 3 v
+分解者 27 n
+分解表 3 n
+分设 145 vn
+分词 19 n
+分词器 3 n
+分词构句 3 n
+分说 3 v
+分课 3 v
+分贝 98 n
+分账 3 v
+分贫振穷 3 i
+分赃 189 v
+分赃不均 3 i
+分赛区 4 n
+分走 3 v
+分赴 100 v
+分起 3 v
+分路 85 n
+分路扬镳 3 i
+分身 229 v
+分身乏术 3 n
+分身减口 3 i
+分身无术 3 l
+分身术 5 n
+分车 3 n
+分载 3 v
+分辨 712 v
+分辨力 13 n
+分辨善恶 3 i
+分辨时间 3 n
+分辨是非 3 i
+分辨本领 3 n
+分辨率 354 n
+分辨真假 3 n
+分辩 157 v
+分辩率 3 n
+分边 3 d
+分过 3 v
+分运 3 v
+分进 3 v
+分进合击 36 l
+分送 188 v
+分选 48 v
+分途 3 d
+分道 3 v
+分道扬镖 3 n
+分道扬镳 63 i
+分遣队 3 n
+分部 269 n
+分配 5410 vn
+分配不公 3 n
+分配任务 3 n
+分配关系 3 n
+分配内存 4 n
+分配利润 3 n
+分配制 2 n
+分配制度 3 n
+分配原则 3 n
+分配器 3 n
+分配奖品 3 n
+分配律 5 n
+分配情况 3 n
+分配机制 3 n
+分配权 7 n
+分配格 3 n
+分配模式 2 n
+分配比例 3 n
+分配水平 3 n
+分配率 3 n
+分配程序 3 n
+分配资源 3 n
+分配阀 3 n
+分野 48 n
+分量 630 n
+分金 3 n
+分金宴 3 n
+分金掰两 3 nr
+分针 5 n
+分钗劈凤 3 nz
+分钗断带 3 n
+分钗破镜 3 n
+分钟 6285 q
+分钟时段 3 n
+分钱 15 v
+分销 106 vn
+分销商 35 n
+分销店 3 n
+分镜头 11 n
+分长 3 v
+分门 3 n
+分门别户 3 n
+分门别类 80 n
+分队 377 n
+分队长 11 n
+分阴 4 n
+分阶段 7 n
+分际 3 n
+分院 599 n
+分隔 244 v
+分隔符 15 n
+分隔线 3 l
+分集 3 v
+分鞋破镜 3 n
+分页 7 m
+分项 18 m
+分领 3 v
+分频 7 d
+分频器 13 n
+分风劈流 3 vn
+分飞 3 v
+分飞燕 3 n
+分食 3 n
+分餐 3 n
+分餐制 2 n
+分饰 3 v
+分饰两角 3 n
+分馆 21 n
+分馏 40 v
+分馏器 3 n
+分馏塔 3 n
+分馏法 3 n
+分香卖履 3 n
+分驾 3 v
+分龄 3 n
+切 3026 v
+切上 3 v
+切上去 3 v
+切上来 3 l
+切下 3 v
+切下去 3 l
+切下来 3 l
+切不 3 l
+切不可 3 v
+切丝 3 nrt
+切中 30 v
+切中时弊 13 l
+切中时病 3 l
+切中要害 7 l
+切事 3 v
+切克 7 nrt
+切入 141 v
+切入口 5 l
+切入点 82 n
+切出 3 v
+切出去 3 v
+切出来 3 l
+切刀 3 n
+切分 23 ad
+切分音 3 n
+切切 46 ad
+切切在心 3 l
+切切实实 23 z
+切切此布 3 i
+切切私语 3 i
+切利 7 ad
+切利尼 4 nrt
+切到 3 v
+切削 185 v
+切削力 3 n
+切削性能 3 n
+切削机 3 n
+切削油 3 n
+切削液 3 n
+切削用量 3 n
+切削角 3 n
+切削速度 3 n
+切削面 3 n
+切割 492 v
+切割刀 3 l
+切割器 7 l
+切割成 3 l
+切割机 3 l
+切割片 3 l
+切勿 165 d
+切厚 3 v
+切去 3 v
+切变 10 v
+切变线 6 l
+切变结构 3 l
+切口 103 n
+切叶机 3 n
+切合 201 v
+切合实际 3 l
+切合需要 3 l
+切向应力 3 l
+切向速度 4 n
+切圆 3 v
+切块 267 n
+切夫斯基 58 nrt
+切宜 3 v
+切实 1260 ad
+切实做好 3 l
+切实加强 3 l
+切实可行 108 l
+切实增强 3 l
+切实有力 3 l
+切实有效 3 l
+切实落实 3 l
+切实际 3 l
+切导 3 v
+切导斜度 3 n
+切导盘 3 n
+切导针 3 n
+切尔 9 nrt
+切尔克斯 3 nrt
+切尔卡瑟 4 nrt
+切尔尼戈夫 2 nrt
+切尔斯基 6 nrt
+切尔滕纳姆 2 nrt
+切尔西 153 nrt
+切尔西队 11 nt
+切尔诺 3 nrt
+切尔诺夫 3 nrt
+切尔诺梅尔金 20 nrt
+切尔诺贝利 29 nrt
+切尔诺贝利核电站 6 nz
+切尼 19 nrt
+切屑 7 v
+切开 144 ad
+切开术 12 l
+切当 6 v
+切忌 153 v
+切成 3 v
+切拉 17 nrt
+切换 90 v
+切换器 3 l
+切换键 3 n
+切掉 3 v
+切断 464 v
+切断术 3 l
+切断机 3 l
+切断阀 3 l
+切斯 6 nrt
+切斯特 5 nrt
+切时 3 ad
+切望 8 v
+切机 2 n
+切树倒根 3 i
+切汇 3 nrt
+切沃 74 nz
+切点 5 n
+切片 136 n
+切片机 3 nz
+切片检查 3 n
+切牙 3 ns
+切特 2 nrt
+切理会心 3 l
+切理厌心 3 l
+切理餍心 3 z
+切瑳琢磨 3 v
+切直 3 d
+切盼 9 v
+切碎 40 v
+切磋 135 v
+切磋琢磨 3 i
+切端支托 3 v
+切端沟 3 nr
+切粒机 3 l
+切糕 3 n
+切纸 3 v
+切纸刀 3 n
+切纸机 3 nz
+切线 49 n
+切细 3 ad
+切结 3 v
+切缘 3 v
+切缘结节 3 i
+切肉 3 n
+切肉刀 3 l
+切肤 3 n
+切肤之痛 18 i
+切脉 18 n
+切腹 3 n
+切腹自杀 3 i
+切花 15 n
+切莫 91 nrt
+切菜 3 n
+切菜刀 16 n
+切菜机 3 n
+切菜板 3 n
+切萨皮克湾 5 nrt
+切要 3 v
+切角 3 n
+切记 129 v
+切诊 14 v
+切诺基 14 nrt
+切起 3 v
+切起来 3 l
+切身 134 v
+切身体会 10 l
+切身利益 93 l
+切身得益 3 l
+切身感受 3 l
+切身经验 3 l
+切边 3 d
+切过 3 v
+切过去 3 l
+切过来 3 l
+切近 22 v
+切近的当 3 l
+切进 3 v
+切进去 3 l
+切进来 3 l
+切送 3 v
+切道 3 v
+切道斜度 3 l
+切错 3 v
+切锥 3 nz
+切除 450 v
+切除术 50 l
+切除率 4 nz
+切面 29 ad
+切音 3 n
+切题 25 n
+切骨之仇 3 l
+切齐 3 d
+切齿 77 n
+切齿拊心 3 z
+切齿痛心 3 i
+切齿痛恨 26 i
+切齿腐心 3 l
+刈 155 vg
+刈包 3 v
+刈稻 3 v
+刈草 3 v
+刈草机 3 vn
+刈除 3 v
+刊 564 zg
+刊出 67 v
+刊出来 3 v
+刊到 3 v
+刊刻 71 n
+刊印 70 v
+刊发 54 v
+刊号 7 n
+刊名 8 v
+刊后语 3 n
+刊在 3 v
+刊大 2 v
+刊头 3 v
+刊布 3 v
+刊心刻骨 3 n
+刊授 3 n
+刊授大学 3 n
+刊播 3 v
+刊文 17 n
+刊本 3 n
+刊正 3 v
+刊物 1141 n
+刊用 3 v
+刊登 681 v
+刊着 3 v
+刊行 135 v
+刊误 3 n
+刊误表 3 n
+刊谬补缺 3 n
+刊起 3 v
+刊载 118 v
+刊过 3 v
+刊错 3 v
+刊首语 3 n
+刍 77 zg
+刍狗 4 n
+刍秣 3 n
+刍粮 3 n
+刍草 3 n
+刍荛 4 n
+刍荛之见 3 v
+刍荛之言 3 v
+刍言 3 n
+刍议 13 n
+刎 24 g
+刎颈之交 3 v
+刑 1618 n
+刑为先 2 nr
+刑书 2 n
+刑事 1059 b
+刑事侦察 3 n
+刑事侦查学 12 nz
+刑事判决 3 nr
+刑事处分 3 l
+刑事拘留 3 i
+刑事案 2 n
+刑事案件 3 n
+刑事法 3 n
+刑事法庭 4 n
+刑事法律 3 n
+刑事犯 2 n
+刑事犯罪 63 i
+刑事科学 3 l
+刑事管辖 3 n
+刑事警察 35 n
+刑事诉讼 3 l
+刑事诉讼法 169 n
+刑事责任 3 l
+刑事赔偿 3 nz
+刑事追究 3 l
+刑于之化 3 l
+刑余之 2 l
+刑余之人 3 l
+刑侦 17 j
+刑侦处 4 nz
+刑侦局 3 n
+刑侦队 3 nz
+刑具 61 n
+刑典 3 b
+刑务 2 n
+刑厥夤 2 nr
+刑台石 2 nr
+刑司 2 n
+刑吉田 3 nr
+刑名 55 n
+刑场 244 n
+刑堂 4 nr
+刑天 2 n
+刑天争神 3 n
+刑天氏 2 nr
+刑天舞 3 nr
+刑官 3 n
+刑审 2 j
+刑宪 3 j
+刑宽 2 j
+刑庭 3 n
+刑律 45 n
+刑徒 43 n
+刑徒伐 2 nr
+刑徒免 2 l
+刑徒城 3 nr
+刑徒归 3 nr
+刑戮 3 v
+刑房 8 n
+刑拘 5 j
+刑按察 23 nr
+刑措不用 3 n
+刑改为 2 nr
+刑政 6 n
+刑期 92 b
+刑期无刑 3 l
+刑杖 3 n
+刑案 4 n
+刑治 2 n
+刑法 671 n
+刑法典 18 nr
+刑法学 33 l
+刑法学家 5 l
+刑法志 3 nr
+刑满 12 j
+刑满释放 16 l
+刑禁勒 2 nr
+刑种 3 b
+刑科 14 j
+刑统 2 n
+刑罚 753 n
+刑罚学 3 n
+刑者 2 n
+刑薄赋 2 nr
+刑警 54 j
+刑警大队 3 n
+刑警支队 3 n
+刑警队 12 n
+刑讯 19 nz
+刑讯室 7 n
+刑讯逼供 24 i
+刑诉 2 v
+刑诉法 3 n
+刑责 3 n
+刑辱 3 n
+刑道栄 3 v
+刑部 2118 n
+刑部侍郎 3 nr
+刑部公 2 nr
+刑部右 2 l
+刑部堂 3 n
+刑部尚 5 n
+刑部礼 4 n
+刑部议 4 n
+刑部详 2 nr
+刑释解教 3 j
+划 2513 v
+划一 268 b
+划一不二 3 i
+划上 3 v
+划下 3 v
+划不来 3 v
+划为 3 v
+划付 3 v
+划代原则 4 n
+划价 5 v
+划伤 33 v
+划入 166 v
+划具 3 v
+划出 257 v
+划出界限 3 n
+划分 4449 v
+划分界线 3 l
+划分算法 3 n
+划划 3 v
+划到 3 v
+划动 3 v
+划去 3 v
+划回 3 v
+划在 3 v
+划地 3 v
+划地为牢 4 i
+划地自限 3 n
+划奖 3 v
+划子 19 n
+划定 365 v
+划帐 3 v
+划开 3 v
+划归 316 v
+划得来 8 v
+划成 3 v
+划手 35 v
+划拉 26 v
+划拨 69 v
+划拨帐号 3 n
+划拳 23 v
+划掉 3 v
+划时代 198 b
+划来划去 3 l
+划框框 3 n
+划桨 53 v
+划款 3 v
+划段 3 n
+划水 92 v
+划法 3 v
+划清 114 v
+划清界线 3 l
+划清界限 3 n
+划片 10 v
+划界 51 n
+划痕 24 n
+划的来 3 l
+划着 108 v
+划着走 3 v
+划破 160 v
+划等号 7 b
+划策 3 v
+划算 111 v
+划粉 3 v
+划线 44 n
+划线支票 3 n
+划船 152 v
+划艇 23 n
+划艇座板 3 n
+划花 8 v
+划行 3 v
+划设 4 v
+划走 3 v
+划起 3 v
+划起来 3 v
+划足 3 v
+划转 81 v
+划过 98 v
+划过去 3 v
+划过来 3 v
+划进 3 v
+划进去 3 v
+划进来 3 v
+刓 6 zg
+刕 106 zg
+刖 77 g
+刖趾适履 3 nr
+列 5778 v
+列一警百 3 nr
+列上 3 v
+列上去 3 v
+列上来 3 v
+列为 4856 v
+列举 612 v
+列举如下 3 i
+列举如右 3 i
+列于 3 v
+列伊 20 nrt
+列传 231 v
+列位 270 n
+列作 3 vn
+列克 19 nrt
+列克斯 3 nr
+列克星顿 5 nr
+列克谢 3 nr
+列入 2003 v
+列兵 23 nr
+列出 389 v
+列出来 3 v
+列别杰夫 4 nr
+列到 3 v
+列功覆过 3 i
+列印 3 v
+列印机 3 n
+列名 29 v
+列国 138 ns
+列国志 3 nr
+列土分茅 3 i
+列土封疆 3 ns
+列块 3 n
+列城 10 ns
+列增 3 v
+列夫斯基 17 nrt
+列奥 14 nrt
+列奥纳多 3 nrt
+列女 3 n
+列姆 3 nrt
+列子 22 n
+列宁 735 nr
+列宁主义 47 n
+列宁全集 3 nr
+列宁格勒 140 nrt
+列宁格勒大学 15 nt
+列宁格勒州 4 ns
+列宁选集 3 nr
+列宗 3 nr
+列居 2 v
+列岛 128 ns
+列巴 7 nrt
+列席 873 n
+列席代表 3 n
+列席会议 3 n
+列式 3 n
+列强 655 v
+列当 13 v
+列成 3 v
+列报 3 n
+列拉 3 nrt
+列支 32 n
+列支敦士登 39 ns
+列支敦士登公国 2 ns
+列斯 82 nrt
+列斯联 3 ns
+列方程 3 nr
+列日 16 nrt
+列日涅夫 101 nrt
+列昂尼 4 nr
+列昂诺夫 13 nrt
+列明 3 nr
+列星 3 nr
+列普宁 4 nr
+列有 3 v
+列特 4 nrt
+列甯格勒 3 v
+列示 3 v
+列祖 3 nr
+列祖列宗 66 nr
+列管 3 vn
+列管式 3 n
+列管流氓 3 n
+列维坦 7 nr
+列编 4 v
+列缺 13 v
+列茨科夫 2 nrt
+列表 480 n
+列表机 3 n
+列表框 3 n
+列计 3 v
+列记 3 n
+列译码 3 n
+列译码器 3 n
+列调 3 v
+列账 3 v
+列车 1780 n
+列车信息 3 nt
+列车员 28 n
+列车时 3 n
+列车时刻 3 n
+列车段 2 n
+列车票价 3 n
+列车表 3 n
+列车车次 3 n
+列车运行 6 nt
+列车长 15 n
+列队 179 n
+列队欢迎 3 nr
+列队行进 3 nr
+列阵 71 nr
+列项 3 n
+列风淫雨 3 i
+列鼎而食 3 i
+刘 5839 zg
+刘一儒 35 nr
+刘一夫 3 nr
+刘一舟 150 nr
+刘七爷 2 nr
+刘七爹 141 nr
+刘三吾 3 nr
+刘三姐 11 nr
+刘三爷 45 nr
+刘上阳 4 nr
+刘世亭 2 nr
+刘世昕 4 nr
+刘世锦 5 nr
+刘丘王 4 nr
+刘东仿 2 nr
+刘东凯 8 nr
+刘东方 22 nr
+刘东根 3 nr
+刘中军 3 nr
+刘中垒 2 nr
+刘中山 3 nr
+刘中藻 15 nr
+刘丽华 76 nr
+刘丽川 4 nr
+刘丽敏 3 nr
+刘丽琴 7 nr
+刘丽英 3 nr
+刘丽霞 3 nr
+刘义宣 2 nr
+刘义庆 8 nr
+刘义康 16 nr
+刘义恭 5 nr
+刘义欣 2 nr
+刘义真 3 nr
+刘义符 7 nr
+刘义隆 14 nr
+刘之余 6 nr
+刘之冰 3 nr
+刘之权 2 nr
+刘乘风 22 nr
+刘九庵 2 nr
+刘也刚 3 nr
+刘习良 2 nr
+刘乡长 2 nr
+刘书宏 3 nr
+刘书文 3 nr
+刘书经 20 nr
+刘二人 5 nr
+刘二军 2 nr
+刘二奶奶 5 nr
+刘二祖 2 nr
+刘二虎 20 nr
+刘于义 8 nr
+刘云山 22 nr
+刘云峰 5 nr
+刘云川 2 nr
+刘云若 3 nr
+刘云非 6 nr
+刘云飞 22 nr
+刘亚楼 9 nr
+刘亚津 3 nr
+刘亚洲 2 nr
+刘亚生 15 nr
+刘亚辉 8 nr
+刘亦婷 3 nr
+刘亦菲 256 nr
+刘亦铭 2 nr
+刘亨立 7 nr
+刘京京 11 nr
+刘亮明 6 nr
+刘人顺 2 nr
+刘仁恭 8 nr
+刘仁轨 7 nr
+刘仁达 23 nr
+刘仁静 24 nr
+刘从梦 2 nr
+刘仙洲 8 nr
+刘代英 20 nr
+刘以敬 7 nr
+刘以达 3 nr
+刘仪伟 2 nr
+刘仰峤 2 nr
+刘仲康 10 nr
+刘仲昆 2 nr
+刘仲武 15 nr
+刘仲甫 6 nr
+刘仲藜 7 nr
+刘伟仁 3 nr
+刘伟师 6 nr
+刘伟强 3 nr
+刘伯坚 7 nr
+刘伯姬 2 nr
+刘伯承 448 nr
+刘伯温 70 nr
+刘伯钦 4 nr
+刘佐卿 4 nr
+刘佐臣 2 nr
+刘佐龙 2 nr
+刘体仁 3 nr
+刘体斌 6 nr
+刘体纯 329 nr
+刘佩琦 3 nr
+刘佩琪 3 nr
+刘佩琼 4 nr
+刘使君 16 nr
+刘俊伟 2 nr
+刘俊哲 3 nr
+刘俊威 14 nr
+刘俊峰 5 nr
+刘俊秀 4 nr
+刘俊谦 21 nr
+刘俊青 2 nr
+刘信叔 3 nr
+刘倩道 3 nr
+刘健仪 2 nr
+刘健回 2 nr
+刘健头 2 nr
+刘健明 2 nr
+刘僧绍 2 nr
+刘儒庭 5 nr
+刘儒林 2 nr
+刘元仁 3 nr
+刘元斌 5 nr
+刘元进 2 nr
+刘元鹤 107 nr
+刘兄弟 2 nr
+刘兆铭 3 nr
+刘先云 2 nr
+刘先生 39 nr
+刘光世 93 nr
+刘光亮 9 nr
+刘光佐 4 nr
+刘光华 2 nr
+刘光国 3 nr
+刘光大 15 nr
+刘光弟 6 nr
+刘光斌 30 nr
+刘光琦 2 nr
+刘光祖 9 nr
+刘光第 21 nr
+刘光菊 2 nr
+刘克庄 9 nr
+刘克智 4 nr
+刘克济 2 nr
+刘克田 3 nr
+刘全妻 2 nr
+刘全应 3 nr
+刘全生 2 nr
+刘全进 2 nrfg
+刘公公 11 nr
+刘公子 3 nr
+刘公岛 61 nr
+刘公武 2 nr
+刘兰芝 2 nr
+刘兰芳 8 nr
+刘关权 3 nr
+刘兴刚 4 nr
+刘兴国 4 nr
+刘兴安 5 nr
+刘兴居 2 nr
+刘兴弟 26 nr
+刘其兵 3 nr
+刘养正 18 nr
+刘军宁 4 nr
+刘冠雄 3 nr
+刘冬冬 256 nr
+刘凤云 76 nr
+刘凤岩 25 nr
+刘凤浩 3 nr
+刘凤起 2 nr
+刘凯列 3 nr
+刘刚道 8 nr
+刘利民 3 nr
+刘别谦 4 nr
+刘前刚 6 nr
+刘剑锋 3 nr
+刘副将 3 nr
+刘加文 6 nr
+刘劭希 3 nr
+刘劭著 2 nr
+刘勃舒 4 nr
+刘勇以后 3 nr
+刘医师 4 nr
+刘千总 6 nr
+刘半农 15 nr
+刘华强 3 nr
+刘华新 2 nr
+刘华清 311 nr
+刘华秋 39 nr
+刘南奎 3 nr
+刘博士 2 nr
+刘博文 23 nr
+刘卫东 256 nr
+刘卫兵 4 nr
+刘卫辰 11 nr
+刘厅长 3 nr
+刘厚生 4 nr
+刘友虎 2 nr
+刘可心 7 nr
+刘司令 113 nr
+刘合炳 256 nr
+刘同学 3 nr
+刘名侃 2 nr
+刘名榜 3 nr
+刘向依 3 nr
+刘向奉 3 nr
+刘向接 2 nr
+刘向校 3 nr
+刘向歆 2 nr
+刘向阳 2 nr
+刘启一 2 nr
+刘呐鸥 2 nr
+刘和光 11 nr
+刘和珍 261 nr
+刘和谦 2 nr
+刘品言 3 nr
+刘哲生 2 nr
+刘唐便 2 nr
+刘唐守 2 nr
+刘嘉玲 8 nr
+刘四厢 25 nr
+刘国光 2 nr
+刘国强 3 nr
+刘国昌 3 nr
+刘国权 3 nr
+刘国杰 3 nr
+刘国栋 3 nr
+刘国梁 28 nr
+刘国正 256 nr
+刘国礼 2 nr
+刘国胜 5 nr
+刘国能 122 nr
+刘国臻 5 nrfg
+刘国裕 2 nr
+刘国轩 18 nr
+刘国钧 5 nr
+刘圣孚 4 nr
+刘坤一 3 ns
+刘培生 55 nr
+刘基 128 nr
+刘基刘 3 nr
+刘士奇 5 nr
+刘士祯 2 nr
+刘士舜 8 nr
+刘士豪 2 nr
+刘处玄 81 nr
+刘备 1753 nrfg
+刘备东 2 nr
+刘备乃 2 nr
+刘备之 4 nr
+刘备亲 2 nr
+刘备依 3 nr
+刘备入 8 nr
+刘备兵 3 nr
+刘备军 4 nr
+刘备屯 2 nr
+刘备必 4 nr
+刘备才 2 nr
+刘备新 2 nr
+刘备方 2 nr
+刘备未 2 nr
+刘备知 2 nr
+刘备若 3 nr
+刘备败 3 nr
+刘备起 2 nr
+刘备闻 4 nr
+刘复之 5 nr
+刘复兴 4 nr
+刘复基 2 nr
+刘多权 2 nr
+刘大为 2 nr
+刘大人 21 nr
+刘大伟 8 nr
+刘大刀 2 nr
+刘大响 261 nr
+刘大哥 21 nr
+刘大夏 14 nr
+刘大夫 4 nr
+刘大奎 13 nr
+刘大妈 12 nr
+刘大姐 8 nr
+刘大年 12 nr
+刘大杰 4 nr
+刘大爷 4 nr
+刘大白 7 nr
+刘大顺 88 nr
+刘天华 7 nr
+刘天池 3 nr
+刘天韵 2 nr
+刘太保 3 nr
+刘太公 35 nr
+刘太尉 11 nr
+刘太平 2 nr
+刘太监 24 nr
+刘太行 3 nr
+刘夫人 21 nr
+刘夫生 2 nr
+刘奎龄 3 nr
+刘女士 3 nr
+刘好礼 6 nr
+刘如仲 4 nr
+刘如意 14 nr
+刘姊姊 2 nr
+刘姓 34 nrfg
+刘姓诸 5 nr
+刘姝威 5 nr
+刘姥姥 306 nrfg
+刘娘子 3 nr
+刘婉芳 27 nr
+刘媛媛 2 nr
+刘嫂子 2 nr
+刘子业 2 nr
+刘子华 768 nr
+刘子厚 256 nr
+刘子庚 5 nr
+刘子扬 4 nr
+刘子政 161 nr
+刘子枫 3 nr
+刘子羽 33 nr
+刘孔和 11 nr
+刘孔昭 19 nr
+刘存厚 5 nr
+刘存周 2 nr
+刘季云 3 nr
+刘季先生 2 nr
+刘季玉 8 nr
+刘季篪 2 nr
+刘学宇 3 nr
+刘学根 3 nr
+刘宇亮 38 nr
+刘守光 7 nr
+刘守斌 3 nr
+刘安 59 nr
+刘安东 3 nr
+刘安叫 2 nr
+刘宋 52 nr
+刘宋时 7 nr
+刘宋永 4 nr
+刘宋陆 2 nr
+刘完素 5 nr
+刘宏明 2 nr
+刘宗吉 7 nr
+刘宗周 151 nr
+刘宗敏 1399 nr
+刘定之 3 nr
+刘宝全 14 nr
+刘宝华 3 nr
+刘家 319 nrfg
+刘家仁 3 nr
+刘家兄弟 2 nr
+刘家圪瘩 3 z
+刘家寺 2 nr
+刘家岛 2 nr
+刘家峡 13 nr
+刘家峡水库 5 nz
+刘家峡水电站 10 nt
+刘家庄 3 nr
+刘家村 2 nr
+刘家沟 2 nr
+刘家港 12 nr
+刘家良 2 nr
+刘家辉 3 nr
+刘寄奴 6 nr
+刘封引 2 nr
+刘将军 10 nr
+刘将爷 10 nr
+刘将闾 2 nr
+刘尊棋 2 nr
+刘小东 9 nr
+刘小光 15 nr
+刘小兵 2 nr
+刘小军 9 nr
+刘小姐 14 nr
+刘小宁 3 nr
+刘小峰 3 nr
+刘小明 7 nr
+刘小枫 21 nr
+刘小芳 2 nr
+刘小锋 3 nr
+刘小青 2 nr
+刘少君 3 nr
+刘少奇 1025 nr
+刘少宇 3 nr
+刘少引 4 nr
+刘少龙 3 nr
+刘尔卓 16 nr
+刘尚勇 5 nr
+刘尚志 2 nr
+刘履丁 54 nr
+刘山在 2 nr
+刘岩兄弟 2 nr
+刘峰岩 3 nr
+刘崇卒 3 nr
+刘崇官 3 nr
+刘崇结 2 nr
+刘崇见 3 nr
+刘崇远 2 nr
+刘崇部 2 nr
+刘巧儿 8 nr
+刘师伯 3 nr
+刘师傅 6 nr
+刘师兄 22 nr
+刘师勇 2 nr
+刘师叔 34 nr
+刘师培 18 nr
+刘师弟 7 nr
+刘希亮 6 nr
+刘希尧 21 nr
+刘平豫 2 nr
+刘广凯 2 nr
+刘庄村 4 nr
+刘庆生 3 nr
+刘庆邦 2 nr
+刘库仁 7 nr
+刘应明 256 nr
+刘应杰 3 nr
+刘庭华 2 nr
+刘延东 6 nr
+刘延宇 14 nr
+刘延庆 132 nr
+刘延绶 2 nr
+刘廷焕 2 nr
+刘廷让 2 nr
+刘建业 81 nr
+刘建军 3 nr
+刘建华 3 nr
+刘建同 4 nr
+刘建国 3 nr
+刘建宏 2 nr
+刘建新 7 nr
+刘建明 2 nr
+刘建林 2 nr
+刘建永 28 nr
+刘建生 3 nr
+刘建章 3 nr
+刘建超 183 nr
+刘建锋 6 nr
+刘开明 2 nr
+刘开朝 7 nr
+刘开渠 9 nr
+刘弗陵 9 nr
+刘弘之 2 nr
+刘弘代 2 nr
+刘彦修 2 nr
+刘彦军 2 nr
+刘彦宗 41 nr
+刘彦彬 33 nz
+刘彦青 3 nr
+刘彭祖 7 nr
+刘彻初 2 nr
+刘彻通 2 nr
+刘得富 2 nr
+刘得福 2 nr
+刘御史 7 nr
+刘德一 12 nr
+刘德凯 3 nr
+刘德华 37 nr
+刘德有 2 nr
+刘德洁 3 nr
+刘德海 5 nr
+刘德生 8 nr
+刘德盈 2 nr
+刘德胜 4 nr
+刘徽注 9 nr
+刘徽约 2 nr
+刘心悠 3 nr
+刘心武 42 nr
+刘志丹 34 nr
+刘志军 269 nr
+刘志刚 18 nr
+刘志勇 2 nr
+刘志华 3 nr
+刘志向 5 nr
+刘志坚 31 nr
+刘志强 3 nr
+刘志明 6 nr
+刘志江 2 nr
+刘志祥 49 nr
+刘志英 17 nr
+刘志荣 3 nr
+刘志青 2 nr
+刘忠录 2 nr
+刘忠德 47 nr
+刘忠文 18 nr
+刘忠武 19 nr
+刘忠汉 2 nr
+刘念友 3 nr
+刘念台 2 nr
+刘怀正 3 nr
+刘思复 4 nr
+刘思扬 2 nr
+刘总宪 6 nr
+刘恒 39 nr
+刘恒林 3 nr
+刘恒继 2 nr
+刘恢先 3 nr
+刘恩溥 2 nr
+刘恺威 3 nr
+刘悦笛 2 nr
+刘惠亮 3 nr
+刘惠君 2 nr
+刘惠萍 3 nr
+刘愈之 2 nr
+刘慈欣 3 nr
+刘慧灵 2 nr
+刘慧琴 4 nr
+刘成左 3 nr
+刘成果 5 nr
+刘我成 15 nr
+刘扬三 3 nr
+刘承俊 3 nr
+刘承奉 17 nr
+刘承干 5 nr
+刘抑曹 2 nr
+刘抗曹 2 nr
+刘招华 3 nr
+刘振亚 3 nr
+刘振伟 256 nr
+刘振华 3 nr
+刘振声 3 nr
+刘振秀 2 nr
+刘振英 8 nr
+刘捷轩 6 nr
+刘掌柜 8 nr
+刘敏学 4 nr
+刘敦桢 9 nr
+刘敬叔 4 nr
+刘敬宣 2 nr
+刘敬往 2 nr
+刘整督 2 nr
+刘文元 5 nr
+刘文典 17 nr
+刘文凯 2 nr
+刘文刚 2 nr
+刘文喜 3 nr
+刘文彩 6 nr
+刘文杰 3 nr
+刘文正 3 nr
+刘文武 40 nr
+刘文治 3 nr
+刘文波 3 nr
+刘文泮 2 nr
+刘文淇 4 nr
+刘文炳 19 nr
+刘文玉 3 nr
+刘文秀 19 nr
+刘文虎 2 nr
+刘文辉 9 nr
+刘文金 5 nr
+刘文静 6 nr
+刘斯奋 7 nrfg
+刘新华 2 nr
+刘新民 3 nr
+刘新生 44 nr
+刘方仁 3 nr
+刘方宇 38 nr
+刘方家族 11 nr
+刘於义 3 nr
+刘无忌 2 nr
+刘旭辉 2 nr
+刘时平 9 nr
+刘时文 4 nr
+刘昌伟 3 nr
+刘昌蓉 56 nr
+刘昌裔 2 nr
+刘昌赫 8 nr
+刘明召 4 nr
+刘明康 6 nr
+刘明源 2 nr
+刘明祖 257 nr
+刘明辉 2 nr
+刘明远 10 nr
+刘易斯 57 nr
+刘易斯堡 4 nrt
+刘昕璐 2 nr
+刘昕酉 2 nr
+刘映花 2 nr
+刘春华 5 nr
+刘春山 3 nr
+刘春明 32 nr
+刘春晓 3 nr
+刘春牛 5 nr
+刘春蕾 3 nr
+刘春贤 2 nr
+刘春霖 4 nr
+刘昭注 2 nr
+刘显红 36 nr
+刘晏之 3 nr
+刘晏充 2 nr
+刘晏继 3 nr
+刘晓东 5 nr
+刘晓光 2 nr
+刘晓庆 26 nr
+刘晓放 7 nr
+刘晓明 3 nr
+刘晓波 68 nr
+刘晓烨 3 nr
+刘晓玲 2 nr
+刘晓程 16 nr
+刘晓艳 2 nr
+刘晓贞 3 nr
+刘晓路 2 nr
+刘晓连 23 nr
+刘晔谏 2 nr
+刘景升 10 nr
+刘景山 5 nr
+刘景德 2 nr
+刘景莲 2 nr
+刘智伯 2 nr
+刘智泰 3 nr
+刘智远 2 nrfg
+刘曜闻 2 nr
+刘曼卿 2 nr
+刘有义 3 nr
+刘朝晖 3 nr
+刘李党 2 nr
+刘松仁 3 nr
+刘松山 3 nr
+刘松金 2 nr
+刘某金 3 nr
+刘树华 2 nr
+刘树桐 2 nr
+刘校长 2 nr
+刘根民 49 nr
+刘桂真 2 nr
+刘桂莲 5 nr
+刘梦云 2 nr
+刘梦熊 4 nr
+刘梦龙 18 nr
+刘次昌 10 nr
+刘歆伪 2 nr
+刘正宗 2 nr
+刘正彦 16 nr
+刘正风 248 nr
+刘步尘 4 nr
+刘步蟾 81 nrfg
+刘步飞 2 nr
+刘武周 2 nr
+刘毅伟 3 nr
+刘毅答诏 3 nr
+刘毓滨 3 nr
+刘氏兄弟 2 nr
+刘氏劝 2 nr
+刘氏复 2 nr
+刘氏诸 2 nr
+刘民声 3 nr
+刘水泉 3 nr
+刘永刚 2 nr
+刘永华 7 nr
+刘永好 3 nr
+刘永宏 2 nr
+刘永成 3 nrfg
+刘永春 5 nr
+刘永清 3 nr
+刘永生 3 nr
+刘永福 20 nr
+刘永良 9 nr
+刘永行 2 nr
+刘永言 2 nr
+刘汉元 3 nr
+刘汉宏 6 nr
+刘汉强 3 nr
+刘汉彬 3 nrfg
+刘汉杰 3 nr
+刘汉铨 2 nr
+刘江俞 4 nr
+刘江华 3 nr
+刘江涛 3 nr
+刘治平 2 nr
+刘泉龙 2 nr
+刘法官 2 nr
+刘注似 8 nr
+刘注相 8 nr
+刘泽民 4 nr
+刘泽清 58 nr
+刘洪康 3 nr
+刘洪泉 16 nr
+刘洪波 5 nr
+刘济美 4 nr
+刘海 65 nr
+刘海儿 5 nr
+刘海南 4 nr
+刘海峰 4 nr
+刘海明 5 nr
+刘海洋 12 nr
+刘海粟 17 nr
+刘海若 3 nr
+刘海荣 2 nr
+刘海藩 2 nr
+刘海西 2 nr
+刘海鹏 3 nr
+刘润华 3 nr
+刘淑仪 3 nrfg
+刘清芬 12 nr
+刘渊 55 nr
+刘渊回 2 nr
+刘渊病 2 nr
+刘渊趁 2 nr
+刘渔仲 4 nr
+刘渝敏 8 nr
+刘湛恩 256 nr
+刘澜涛 45 n
+刘炳森 3 nr
+刘炳银 4 nr
+刘焉之 2 nr
+刘焉令 2 nr
+刘焉死 2 nr
+刘焯华 2 nr
+刘燕华 2 nr
+刘燕君 2 nr
+刘燮阳 2 nr
+刘爱卿 2 nr
+刘爱玲 3 nr
+刘爱萍 21 nr
+刘牢之 23 nr
+刘猪儿 2 nr
+刘玄北 3 nr
+刘玄处 3 nr
+刘玄德 48 nr
+刘玉凤 3 nr
+刘玉勋 2 nr
+刘玉升 91 nr
+刘玉娘 7 nr
+刘玉宝 2 nr
+刘玉尺 241 nr
+刘玉明 7 nr
+刘玉林 50 nr
+刘玉民 4 nr
+刘玉玲 2 nr
+刘玉琴 7 nr
+刘玉翠 153 nr
+刘玉芬 6 nr
+刘瑛姑 3 nr
+刘瑞升 3 nr
+刘瑞琪 3 nr
+刘瑞麟 3 nr
+刘瑾之 2 nr
+刘瑾伏 3 nr
+刘瑾兄 3 nr
+刘瑾因 2 nr
+刘瑾正 2 nr
+刘璋亦 2 nr
+刘璋归 2 nr
+刘璋闻 2 nr
+刘白方 9 nr
+刘白羽 11 nr
+刘皇叔 48 nr
+刘皇后 4 nr
+刘皇帝 3 nr
+刘盈之 2 nr
+刘益川 2 nr
+刘益州 3 nr
+刘益良 3 nr
+刘盛休 2 nr
+刘盛佳 17 nr
+刘盛起 3 nr
+刘真人 3 nr
+刘真然 3 nr
+刘知几 6 nr
+刘知寨 26 nr
+刘知末 3 nr
+刘知炳 4 nr
+刘知远 38 nr
+刘石泉 256 nr
+刘祉锋 2 vn
+刘禅 42 nr
+刘禅继 2 nr
+刘福印 7 nr
+刘福通 71 nr
+刘禹锡 44 nr
+刘秀乃 2 nr
+刘秀兄弟 6 nr
+刘秀全 3 nr
+刘秀唱 2 nr
+刘秀奉 2 nr
+刘秀才 12 nr
+刘秀甲 2 nr
+刘秀荣 4 nr
+刘秉忠 29 nr
+刘积斌 259 nr
+刘稻村 27 nr
+刘穆之 2 nr
+刘竞雄 2 nr
+刘端祺 5 nr
+刘竹庄 6 nr
+刘竹承 2 nr
+刘精松 257 nr
+刘素芬 4 nr
+刘索拉 3 nr
+刘絮云 336 nr
+刘繇寨 2 nr
+刘红婴 3 nr
+刘纪文 7 nr
+刘纪鹏 8 nr
+刘纯东 3 nr
+刘细君 2 nr
+刘绍先 2 nr
+刘绍棠 10 nrfg
+刘绍铭 2 nr
+刘经纶 2 nr
+刘统勋 2 nr
+刘继业 2 nr
+刘继元 3 nr
+刘继卣 2 nr
+刘继安 5 nr
+刘继明 6 nr
+刘继雄 3 nr
+刘维佳 6 nr
+刘维尔 17 nr
+刘罗锅 7 nr
+刘美君 3 nr
+刘美娟 3 nrfg
+刘美诗 4 nr
+刘羲叟 2 nr
+刘翔 423 nr
+刘翔脚 3 nr
+刘翠华 2 nr
+刘耀辉 8 nr
+刘老公 3 nr
+刘老六 2 nr
+刘老吉 9 nr
+刘老太 2 nr
+刘老师 3 nr
+刘老板 12 nr
+刘老根 3 nr
+刘老爷 29 nr
+刘老爷子 2 nr
+刘耕宏 3 nr
+刘联军 7 nr
+刘肇基 2 nr
+刘育海 25 nr
+刘育英 2 nr
+刘胡兰 49 nr
+刘胡兰纪念馆 2 nr
+刘自强 12 nrfg
+刘自豫 2 nr
+刘舜仁 14 nr
+刘良佐 38 nr
+刘艺舟 3 nr
+刘芊蒂 3 nr
+刘芳亮 294 nr
+刘若愚 9 nr
+刘若英 2 nr
+刘英丽 2 nr
+刘英毅 3 nr
+刘茂恩 4 nr
+刘茂林 10 nr
+刘荃正 2 nr
+刘荣之 2 nr
+刘荣册 2 nr
+刘莉莉 3 nr
+刘莉视 2 nr
+刘薇薇 3 nr
+刘虹桦 3 nr
+刘蜀永 2 nr
+刘表 71 nr
+刘表军 2 nr
+刘表新 3 nr
+刘表适 3 nr
+刘表遂 2 nr
+刘表闻 3 nr
+刘裕 187 nr
+刘裕代 3 nr
+刘裕国 5 nr
+刘裕派 2 nr
+刘裕灭 3 nr
+刘裕遂 2 nr
+刘西杰 13 nr
+刘诗平 4 nr
+刘诗昆 7 nr
+刘语杰 3 nr
+刘诸子 2 nr
+刘谋儿 20 nr
+刘谷华 2 nr
+刘豫军 2 nr
+刘豫州 24 nr
+刘贞贤 2 nr
+刘责芳 2 nr
+刘贤文 4 nr
+刘质平 2 nr
+刘贯道 2 nr
+刘贵亭 4 nr
+刘贵妃 71 nr
+刘贵立 25 nr
+刘贵芳 16 nr
+刘赞画 5 nr
+刘转运 15 nr
+刘辰翁 5 nr
+刘迎健 4 nr
+刘迎胜 4 nr
+刘运来 2 nr
+刘进忠 11 nr
+刘进荣 2 nr
+刘连昆 2 nr
+刘适兰 2 nr
+刘逢君 2 nr
+刘道宁 2 nr
+刘道怜 4 nr
+刘道玉 256 nr
+刘道衡 2 nr
+刘道规 4 nr
+刘道醇 2 nr
+刘遵宪 2 nr
+刘邦 837 nr
+刘郎前度 3 nr
+刘郎浦 513 nr
+刘醒龙 261 nr
+刘采云 24 nr
+刘重阳 6 nr
+刘金兰 3 nr
+刘金华 5 nr
+刘金国 2 nr
+刘金妹 3 nr
+刘金山 3 nr
+刘金平 13 nr
+刘金祥 4 nr
+刘金英 20 nr
+刘金萍 3 nr
+刘金贵 11 nr
+刘金霞 2 nr
+刘金鱼 2 nr
+刘銮雄 3 nr
+刘铁军 7 nr
+刘铁匠 4 nr
+刘铁山 2 nr
+刘铭传 16 nr
+刘锡为 2 nr
+刘锡才 3 nr
+刘锡明 3 nr
+刘锡田 3 nr
+刘锡荣 3 nr
+刘锦云 3 nr
+刘锦才 2 nr
+刘锦棠 6 nrfg
+刘锦波 2 nr
+刘锦玲 3 nr
+刘锦藻 4 nr
+刘镇武 2 nr
+刘长乐 3 nr
+刘长卿 7 nr
+刘长忠 2 nr
+刘长春 3 nr
+刘长江 2 nr
+刘长瑜 4 nr
+刘门亲 2 nr
+刘阁学 4 nr
+刘阮入 2 nr
+刘阿姨 5 nr
+刘陈邓 3 nr
+刘院长 2 nr
+刘陶任 3 nr
+刘隐卒 2 nr
+刘隗劝 4 nr
+刘雁飞 256 nr
+刘雅丽 3 nr
+刘雍凡 9 nr
+刘雪华 3 nr
+刘雪荣 256 nr
+刘震云 38 nr
+刘青云 3 nr
+刘青山 24 nr
+刘静逸 44 nr
+刘韵洁 5 nr
+刘顺尧 3 nr
+刘领路 3 nr
+刘首辅 5 nr
+刘香兰 6 nr
+刘骜之 2 nr
+刘高倬 31 nr
+刘高那 3 nr
+刘鸿儒 3 nr
+刘鸿声 2 nr
+刘鸿生 6 nr
+刘鸿训 5 nr
+刘鸿飞 2 nr
+刘鹤真 106 nr
+刘麻子 5 nr
+刘黎敏 256 nr
+刘黑闼 9 nr
+则 32160 d
+则例 3 l
+则否 3 u
+则声明 3 l
+则安之 16 nrfg
+则徐 9 nrfg
+则甚 11 u
+刚 9881 d
+刚一柔 15 nr
+刚中柔外 3 i
+刚为 3 d
+刚亦柔 2 nr
+刚体 207 n
+刚健 56 a
+刚关 3 t
+刚内方外 3 ns
+刚出去 3 i
+刚出狱 3 i
+刚出生 3 i
+刚出道 3 i
+刚刚 4585 d
+刚刚开始 3 nr
+刚办 3 n
+刚加 3 d
+刚劲 46 a
+刚劲有力 3 n
+刚勇 3 d
+刚化原理 3 n
+刚印 3 n
+刚去 3 t
+刚回到 3 i
+刚回去 3 i
+刚回来 3 i
+刚在 3 t
+刚够 3 a
+刚夹 3 n
+刚好 667 d
+刚娶 3 n
+刚嫁 3 n
+刚定 3 d
+刚察 3 n
+刚察县 4 ns
+刚巧 114 d
+刚度 59 d
+刚强 61 a
+刚性 131 n
+刚性杆 3 n
+刚性链 3 n
+刚愎 27 an
+刚愎自用 43 i
+刚成立 3 nr
+刚戾自用 3 v
+刚才 5617 t
+刚扣 3 n
+刚抬 3 i
+刚晶 3 n
+刚来 3 t
+刚来时 3 d
+刚板硬正 3 i
+刚构桥 14 n
+刚果 313 n
+刚果人 13 n
+刚果共和国 8 ns
+刚果惊魂 3 i
+刚果民主共和国 14 ns
+刚果河 122 ns
+刚果红 3 nr
+刚架 3 n
+刚柔 33 a
+刚柔并济 33 i
+刚柔相济 31 i
+刚正 27 d
+刚正不阿 19 i
+刚毅 435 nr
+刚毅不屈 3 nr
+刚毅木纳 3 nr
+刚毛 48 n
+刚溼 3 t
+刚满 3 a
+刚烈 57 a
+刚烧 3 n
+刚玉 60 nr
+刚玩 3 n
+刚盛 3 a
+刚直 28 d
+刚直不阿 17 i
+刚相 3 d
+刚石 3 n
+刚硬 62 a
+刚肠嫉恶 3 i
+刚背 3 n
+刚要 3 d
+刚订 3 n
+刚试 3 n
+刚读 3 n
+刚贴 3 n
+刚赐 3 n
+刚赶 3 ns
+刚超逸 2 nr
+刚跑 3 ns
+刚过去 3 i
+刚过来 3 d
+刚进宫 3 nr
+刚进山 2 nr
+刚醒 3 a
+刚铺 3 n
+刚锯 3 n
+刚镀 3 n
+刚雇 3 n
+刚领 3 n
+刚风 3 n
+创 2757 n
+创一流 3 n
+创下 277 v
+创世 64 v
+创世神 3 nz
+创世纪 3 nz
+创业 1528 n
+创业史 20 n
+创业园 261 n
+创业垂统 3 n
+创业基金 3 n
+创业家 3 n
+创业投资 22 n
+创业板 7 n
+创业楷模 3 v
+创业精神 3 n
+创业维艰 3 n
+创业网 3 n
+创业者 117 n
+创业资金 2 n
+创业项目 3 n
+创举 60 v
+创产值 3 n
+创价 12 n
+创优 11 j
+创伤 352 v
+创伤外科 3 n
+创伤性 3 n
+创作 6322 vn
+创作力 9 n
+创作员 5 n
+创作奖 8 n
+创作实践 3 n
+创作室 10 n
+创作才能 3 n
+创作技巧 3 n
+创作方法 3 n
+创作界 4 n
+创作组 6 n
+创作经验 3 n
+创作者 78 n
+创作自由 3 n
+创佳 3 j
+创例 3 n
+创元科技 2 nz
+创先 2 vn
+创先争优 3 n
+创出 176 v
+创刊 350 n
+创刊号 30 n
+创刊词 3 n
+创利 59 n
+创利税 3 n
+创制 690 v
+创制权 3 n
+创剧痛深 3 n
+创办 2160 v
+创办人 44 n
+创办者 15 n
+创办资本 3 n
+创化 3 vn
+创卫 4 v
+创口 102 n
+创可贴 45 n
+创名牌 3 n
+创始 133 v
+创始人 770 n
+创始国 12 n
+创始者 30 n
+创安 3 n
+创安小区 3 n
+创导 6 n
+创巨痛深 9 i
+创建 2017 v
+创建人 117 n
+创建对象 3 n
+创建活动 3 n
+创建者 1117 n
+创建表格 3 n
+创意 481 v
+创意作品 3 n
+创意曲 3 n
+创意设计 3 n
+创意造言 3 n
+创投 42 j
+创投公司 2 nt
+创收 87 v
+创效 3 n
+创新 4681 v
+创新作品 3 n
+创新力 11 n
+创新型 83 n
+创新奖 3 nz
+创新性 60 n
+创新纪录 3 n
+创新者 6 n
+创新能力 15 n
+创智 2 n
+创智科技 2 n
+创术 3 n
+创校 3 n
+创汇 410 n
+创汇率 3 n
+创汇额 2 n
+创演 4 v
+创牌子 3 n
+创生 67 v
+创生科技 3 nz
+创痍未寥 3 i
+创痍满目 3 i
+创痕 6 n
+创痛 16 n
+创立 1567 v
+创立出 3 n
+创立者 105 n
+创纪录 69 n
+创维 214 n
+创维集团 15 nt
+创编 17 v
+创联 3 j
+创见 121 v
+创见性 4 n
+创议 14 n
+创记录 3 n
+创设 244 vn
+创说 3 v
+创通 3 n
+创造 6687 v
+创造力 250 n
+创造发明 3 n
+创造型 5 n
+创造学 2 n
+创造性 732 n
+创造性地 3 n
+创造才能 3 n
+创造条件 23 n
+创造物 25 n
+创造精神 3 n
+创造者 118 n
+创造财富 3 n
+创钜痛深 3 nz
+创面 45 n
+刜 4 zg
+初 14072 f
+初一 419 t
+初一学生 3 l
+初一级 3 b
+初一英语 3 nr
+初七 68 t
+初三 221 t
+初三化学 3 l
+初三级 3 l
+初上 3 f
+初中 2570 f
+初中化学 3 l
+初中历史 3 l
+初中文化 3 l
+初中期 2 b
+初中版 2 b
+初中班 11 nr
+初中生 49 nr
+初中生物 3 l
+初中级 6 b
+初中英语 3 nr
+初中试卷 3 n
+初中语文 3 nr
+初中部 7 f
+初为人 3 l
+初九 74 t
+初乳 8 n
+初乳激肽 3 n
+初二 152 t
+初二级 3 l
+初亏 4 d
+初五 101 t
+初亚非 2 nr
+初交 9 b
+初产妇 3 n
+初仕魏 2 nr
+初任 50 n
+初伏 6 t
+初会 3 n
+初会乍练 3 i
+初会盟 2 l
+初传 3 b
+初体验 3 vn
+初侵染 3 l
+初修通 2 nr
+初值 34 n
+初值问题 3 l
+初元 14 t
+初八 125 t
+初六 99 t
+初兴靖 128 nr
+初具 28 n
+初具规模 155 l
+初写黄庭 3 n
+初冬 204 t
+初出茅庐 49 i
+初出茅芦 3 i
+初刊 3 n
+初创 75 n
+初创期 2 n
+初加工 6 n
+初十 62 t
+初升朝 2 nr
+初印 2 n
+初印模 3 n
+初叶 76 t
+初号机 3 n
+初名子 3 nr
+初启程序 3 l
+初吻 3 n
+初哈利 2 nr
+初唐 34 t
+初四 99 t
+初夏 130 t
+初夜 6 t
+初夜权 6 l
+初始 297 v
+初始值 6 l
+初始化 84 l
+初始密码 3 n
+初始条件 50 l
+初始模型 3 n
+初始段 3 n
+初始流形 3 n
+初始状态 18 l
+初始装入 3 l
+初婚 15 v
+初子午 4 nr
+初学 92 n
+初学人员 3 n
+初学者 27 n
+初宁陵 2 nr
+初定 3 d
+初审 79 v
+初小 7 b
+初小文化 3 l
+初左宗 2 nr
+初平 2 n
+初平初 2 nr
+初年 620 t
+初幼嘉 26 nr
+初度 3 d
+初建 3 v
+初征 3 n
+初征银 2 nr
+初心 3 n
+初恋 115 v
+初恋女友 3 l
+初恋情人 3 l
+初愿 3 d
+初战 63 v
+初战告捷 3 l
+初承元 3 nr
+初掌 3 n
+初探 29 v
+初教六 2 l
+初日 3 t
+初旬 3 t
+初时 540 t
+初春 51 t
+初春时节 3 t
+初晓 3 t
+初更 3 t
+初月 3 t
+初有志 3 nr
+初期 2951 t
+初权臣 4 nr
+初来乍到 52 i
+初来者 3 n
+初查 2 vn
+初校样 3 nr
+初样 9 d
+初检 3 v
+初模型 3 n
+初次 503 d
+初次应答 3 l
+初次见面 3 d
+初步 3302 d
+初步判断 3 n
+初步成效 3 l
+初步查明 3 l
+初步统计 3 l
+初步编目 3 l
+初步解决 3 l
+初步设计 3 i
+初步阶段 3 n
+初段 14 t
+初民 3 n
+初涉 71 v
+初演 3 v
+初潮 53 n
+初版 40 v
+初版书 3 n
+初版本 2 n
+初犯 27 n
+初献 3 n
+初现 3 v
+初生 152 b
+初生之犊 6 l
+初生之犊不畏虎 2 i
+初生仔 3 nr
+初生儿 2 t
+初生叶 2 t
+初生壁 8 n
+初生态 3 l
+初生牛犊 6 l
+初生牛犊不怕虎 12 l
+初生生长 3 n
+初登宝 5 nr
+初盛唐 2 nr
+初相遇 3 l
+初祖庵 2 nr
+初秋 45 t
+初稿 88 n
+初等 145 b
+初等变换 3 l
+初等教育 307 l
+初等数学 28 l
+初等矩阵 3 nr
+初筛 6 n
+初级 1748 b
+初级中学 13 l
+初级产品 3 l
+初级小学 6 l
+初级工 5 l
+初级性比 3 l
+初级成分 3 l
+初级教程 3 l
+初级班 2 n
+初级社 22 l
+初级线圈 3 n
+初级职称 3 n
+初级苷 3 n
+初级读本 3 n
+初级输出 3 n
+初级错误 3 l
+初级阶段 609 n
+初级阶段论 2 l
+初级阶级 3 l
+初绽 3 n
+初缩 3 v
+初聊 3 v
+初航 3 v
+初芽 3 n
+初莲花 2 nr
+初萧何 2 nr
+初血 3 n
+初衷 262 d
+初装 4 b
+初装费 14 n
+初见 143 v
+初见成效 42 i
+初见端倪 11 l
+初记 2 n
+初访 3 v
+初评 11 v
+初识 31 n
+初诊 9 v
+初试 50 vn
+初试啼声 3 l
+初试锋芒 3 n
+初赛 15 n
+初进宫 3 nr
+初进洪 2 nr
+初选 58 v
+初速 145 d
+初速度 3 n
+初逢 3 v
+初长成 3 nr
+初阳 2 t
+初阶 3 n
+初雪 8 n
+初露 18 v
+初露头角 11 i
+初露峥嵘 3 nr
+初露端倪 7 l
+初露锋芒 3 i
+初高中 14 nr
+刞 37 zg
+删 207 v
+删了 3 v
+删减 14 v
+删减成 3 i
+删削 12 v
+删剪 3 v
+删华就素 3 i
+删去 84 v
+删字 3 v
+删帖 3 v
+删成 3 v
+删掉 38 v
+删改 40 v
+删档 3 v
+删汰 3 v
+删略 3 v
+删繁就简 4 i
+删节 39 v
+删节号 3 n
+删节本 3 n
+删节版 3 n
+删补 3 v
+删词 3 v
+删除 358 v
+删除异常 3 i
+删除程序 3 i
+刡 3 zg
+判 1330 zg
+判下 3 v
+判下去 3 v
+判下来 3 v
+判为 3 v
+判乱 3 v
+判令 13 v
+判例 73 n
+判例汇编 3 n
+判军 3 n
+判决 1181 v
+判决书 59 v
+判决额 3 v
+判分 3 v
+判刑 265 v
+判别 145 v
+判别函数 3 n
+判别分析 3 i
+判别式 3 n
+判匪 3 v
+判卷 3 v
+判变 3 v
+判处 889 v
+判处刑罚 3 i
+判处死刑 3 i
+判官 427 v
+判官笔 3 v
+判定 383 v
+判徒 3 n
+判成 3 v
+判据 34 v
+判断 4324 v
+判断力 103 n
+判断句 2 i
+判断是非 3 i
+判断者 3 n
+判断能力 3 n
+判断裁决 3 i
+判断题 3 n
+判明 61 v
+判明是非 3 i
+判案 33 v
+判死罪 3 i
+判然不同 3 i
+判离 3 v
+判罚 138 vn
+判罪 13 vn
+判若 8 v
+判若两人 43 i
+判若云泥 7 i
+判若天渊 3 i
+判若水火 3 i
+判若鸿沟 3 i
+判词 9 n
+判读 25 v
+判读标志 3 n
+判起 3 v
+判起来 3 v
+別 21 zg
+刨 615 v
+刨冰 5 n
+刨冰机 3 n
+刨出来 3 i
+刨刀 7 n
+刨削 5 v
+刨土 3 n
+刨地 3 n
+刨坑 3 n
+刨子 8 n
+刨工 3 n
+刨床 18 n
+刨成 3 v
+刨树搜根 3 vn
+刨根 3 nz
+刨根儿 3 n
+刨根究底 3 n
+刨根问底 22 i
+刨花 18 n
+刨花板 24 n
+刨除 8 v
+利 5167 n
+利一世 2 nr
+利七世 6 nr
+利三世 7 nr
+利上滚利 3 l
+利上篮 2 n
+利不亏义 3 l
+利与弊 3 n
+利为民 7 nr
+利么 2 v
+利义政 2 nr
+利义满 3 nr
+利之品 2 n
+利之徒 6 nr
+利乌斯 14 nr
+利二世 8 nr
+利于 636 v
+利五世 7 nr
+利亚 262 ns
+利亚人 16 nr
+利亚克 3 nr
+利亚努 3 nr
+利亚城 5 nr
+利亚多 2 nr
+利亚太 2 nr
+利亚姆 3 nr
+利亚尔 12 nr
+利亚州 3 ns
+利亚德 3 nr
+利亚斯 5 nr
+利亚族 16 nr
+利亚纳 3 nr
+利亚语 5 nr
+利亚诺 5 nr
+利亚雷 4 nr
+利人 3 n
+利人利己 3 n
+利仁荣 3 nr
+利仓 2 v
+利他主义 3 n
+利他行为 3 n
+利令志惛 3 nt
+利令智昏 12 nr
+利休 8 v
+利伯河 2 nr
+利伯维尔 11 nrt
+利便 3 a
+利俱利 2 nr
+利傍倚刀 3 i
+利克特 3 nr
+利克里 2 nrt
+利八世 9 nr
+利六世 11 nr
+利兮敌 2 nr
+利兹 16 nr
+利兹城 2 nr
+利兹联 9 ns
+利兹鱼 2 nr
+利养 3 n
+利再战 3 nr
+利出一孔 3 n
+利刀 30 n
+利刃 272 n
+利则利 3 nr
+利利索索 10 ns
+利剑 191 nr
+利加乔 5 nr
+利加努 2 nr
+利加洲 6 ns
+利努斯 2 nr
+利勒哈默尔 3 nrt
+利升 2 v
+利卡 5 n
+利卡基 2 nr
+利卡西 2 nr
+利厄 3 nrt
+利口 31 n
+利口冲 2 nr
+利口捷给 3 nr
+利口酒 3 n
+利古尔 2 nr
+利古里亚 4 nrt
+利可图 5 nr
+利可安 2 nr
+利司通 2 nr
+利君沙 3 nr
+利哈乔夫 2 nrt
+利商民 3 n
+利喙赡辞 3 vn
+利嘴 3 v
+利器 262 n
+利四世 31 nr
+利四民 3 nr
+利团 2 n
+利国 8 ns
+利国乡 4 n
+利国利民 11 n
+利国益民 3 n
+利国福民 3 nr
+利在当代 3 v
+利城邦 16 nr
+利基 6 nr
+利士 6 n
+利多 40 nrt
+利多于弊 3 i
+利多卡因 3 nrt
+利多弊少 3 n
+利多消息 3 n
+利大于弊 3 i
+利夫 4 n
+利夫兰 3 nr
+利奇尔 2 nr
+利奥 23 nrt
+利奥塔德 3 nrt
+利奥波 5 nr
+利奥波德 37 nrt
+利奴羊 2 nr
+利好 174 a
+利姆诺 16 nr
+利子 2 n
+利子厚 2 nr
+利它素 3 i
+利安一世 2 nr
+利安人 25 n
+利安徒 16 nr
+利定昌 3 nr
+利宜归 3 nr
+利害 1882 v
+利害关系 3 n
+利害冲突 3 n
+利害得失 10 n
+利害悠关 3 n
+利害攸关 4 i
+利害相关 3 n
+利家 3 n
+利家与松 3 nr
+利导 3 n
+利尊氏 3 nr
+利小便 3 nr
+利尔 28 nr
+利尔城 2 nr
+利尔杰 5 nr
+利尔赛 24 nr
+利尔达 3 nr
+利尼人 16 nrt
+利尿 173 n
+利尿剂 39 n
+利尿药 3 n
+利川 16 ns
+利川市 259 ns
+利州 6 ns
+利州路 3 ns
+利差 25 n
+利己 36 n
+利己主义 24 n
+利己利人 3 n
+利己损人 3 n
+利巴利 6 nr
+利巴韦 6 nr
+利市 11 n
+利市三倍 3 nr
+利布 9 v
+利布曼 3 nr
+利帕里 2 nrt
+利库德 23 nr
+利库德集团 12 nt
+利庭扫穴 3 n
+利弊 119 n
+利弊得失 3 n
+利弗莫 4 nr
+利得 3 v
+利德 4 nrt
+利德尔 4 nr
+利德布尔 2 nrt
+利思义 4 nr
+利息 1436 n
+利息支出 3 v
+利息收入 3 n
+利息率 536 n
+利息税 10 n
+利息费用 3 n
+利息额 3 n
+利惹名牵 3 nr
+利扎拉祖 2 nrt
+利拉河 2 ns
+利拉琴 11 nr
+利摩日 2 nr
+利撒 32 nrt
+利改税 6 n
+利文 11 n
+利文三藏 2 nr
+利文斯 34 nr
+利斧 3 n
+利斯一世 2 nrt
+利斯丁 7 nr
+利斯克 2 nr
+利斯基 3 nr
+利斯塔 3 nr
+利斯特 4 nr
+利方 3 n
+利时及物 3 n
+利是 3 n
+利普尼 2 nr
+利普斯 12 nr
+利普施 2 nr
+利普港 2 ns
+利普王子 2 nr
+利普维 2 nr
+利普顿 3 nr
+利权 26 n
+利析秋毫 3 n
+利林费 3 n
+利根 2 n
+利格尼 2 nr
+利欲 14 n
+利欲熏心 20 l
+利欲薰心 3 nr
+利比 11 v
+利比亚 391 ns
+利比亚人 5 nrt
+利比里亚 114 ns
+利民 31 n
+利水 3 n
+利水渗 8 nr
+利水渗湿 3 n
+利水通 3 nr
+利沃依德 3 nr
+利沃夫 12 nr
+利沃诺 12 nr
+利沙 3 n
+利河 3 ns
+利法尔 3 nr
+利波尔 3 nr
+利泽门 3 nr
+利洛夫 2 nr
+利津 17 ns
+利津入 5 nr
+利津县 3 ns
+利派 3 n
+利涅尔 4 nr
+利涉 4 v
+利润 4472 n
+利润分配 3 n
+利润总额 3 n
+利润率 1206 n
+利润留成 3 nr
+利润表 18 n
+利润额 11 n
+利淡 14 a
+利深祸速 3 i
+利清谷 7 nr
+利港镇 3 ns
+利湿 42 a
+利源 3 n
+利源镇 3 nr
+利滚利 3 nr
+利灾乐祸 3 l
+利爪 48 n
+利爽 2 a
+利牙 3 ns
+利物 2 n
+利物浦 278 ns
+利物浦港 3 ns
+利物浦队 4 nt
+利特 8 nrt
+利特尔 7 nr
+利率 1443 n
+利率差 2 n
+利率政策 3 n
+利率表 3 n
+利王子 10 nr
+利玛窦 52 nr
+利生 11 n
+利用 13559 n
+利用业务 2 n
+利用人体 2 n
+利用光 24 n
+利用厚生 3 n
+利用外资 3 n
+利用微 3 nr
+利用效率 5 n
+利用率 215 n
+利用生物 2 n
+利用系数 3 n
+利用网关 2 n
+利用网络 3 n
+利用职权 3 n
+利用自身 2 n
+利用装置 2 n
+利用计算机 6 n
+利用设备 2 n
+利用软件 2 n
+利略 2 n
+利皮尼 3 nr
+利皮耶 2 nr
+利益 8351 n
+利益一致 3 n
+利益冲突 3 n
+利益均沾 8 nr
+利益者 4 n
+利益观 3 n
+利益输送 3 n
+利益集团 3 n
+利益驱动 3 n
+利眠宁 5 nr
+利禄 155 nr
+利福平 16 nr
+利科尔 2 nr
+利科罗 9 nr
+利税 702 n
+利税分流 3 n
+利空 80 n
+利空消息 3 n
+利箭 26 n
+利类思 2 n
+利索 141 n
+利纳斯 4 nr
+利纳雷斯 4 nrt
+利维 48 n
+利维坦 8 nr
+利维夫 3 nr
+利维斯 2 nr
+利绾名牵 3 nr
+利群 17 n
+利群岛 3 ns
+利翁 4 n
+利翁河 2 nr
+利翁湾 2 nr
+利而利 2 nr
+利耶夫 3 nr
+利耶帕亚 3 nrt
+利胆 2 n
+利胆素 2 nr
+利莎 5 nrt
+利萨 4 n
+利萨拉 2 nr
+利落 176 n
+利蒙湾 4 ns
+利血平 21 n
+利行 2 v
+利西 3 n
+利西泰 2 nr
+利诱 67 v
+利贝拉 2 nrt
+利贝曼 3 nr
+利贞皇帝 3 nr
+利车 3 n
+利辛 3 nr
+利辛县 3 ns
+利迪霉素 3 nz
+利通区 3 n
+利邦 16 n
+利里恩 5 nr
+利金 2 n
+利金人 2 n
+利针 2 n
+利钝 3 a
+利钱 14 n
+利锁名缰 3 i
+利阿斯 4 nr
+利阿诺 2 nr
+利隆圭 8 nr
+利雅得 44 nr
+利雅德 3 nr
+利雅迪 15 nr
+利霍夫 3 nr
+利马 87 n
+利马窦 3 nr
+利高曼 2 nr
+利鹿 5 n
+利默里克 4 nrt
+利齐切夫 3 nrt
+利齿 12 n
+利齿伶牙 3 i
+利齿能牙 3 n
+别 14132 r
+别上去 3 i
+别上来 3 l
+别下 3 r
+别下去 3 l
+别业 19 n
+别个 3 r
+别之弟 2 nr
+别乡 3 r
+别人 8252 r
+别人找 3 v
+别介 3 n
+别介意 3 nr
+别以为 3 nr
+别价 3 n
+别传 15 nr
+别伤 2 v
+别体 3 n
+别作一眼 3 l
+别作声 3 n
+别作良 5 nr
+别作良图 3 nr
+别做声 3 i
+别傻了 3 i
+别儿哥 13 nr
+别克 11 nr
+别克君 4 nr
+别克君威 3 nr
+别克巴 2 nr
+别克惕 3 nr
+别克斯 2 nr
+别党 3 r
+别关 3 v
+别具 3 n
+别具一格 93 l
+别具匠心 10 i
+别具只眼 3 i
+别具心肠 3 i
+别具慧眼 3 l
+别具手眼 3 l
+别具特色 28 l
+别具肺肠 3 i
+别具风味 9 l
+别具风采 2 i
+别出去 3 i
+别出心裁 133 i
+别出手眼 3 i
+别出新意 3 i
+别出新裁 3 i
+别出机杼 3 i
+别击伊 2 nr
+别创一格 3 nz
+别利伯爵 4 nr
+别别扭扭 13 z
+别刻 3 r
+别力弹 3 n
+别办 3 v
+别加 3 v
+别动 160 v
+别动队 12 n
+别勒古 8 nr
+别区 3 r
+别去了 3 l
+别县 3 r
+别句 3 n
+别史 13 n
+别号 108 n
+别吉太 2 nr
+别名 646 a
+别后 3 c
+别吓人 3 nr
+别吓惊 2 i
+别吵 8 nr
+别哭 3 v
+别善恶 3 nr
+别喝了 3 l
+别嘌呤醇 3 n
+别嘴 3 nr
+别国 258 r
+别墅 564 n
+别墅区 13 n
+别墅式 3 b
+别墅网 3 n
+别墅设计 3 n
+别处 930 r
+别多生 2 nr
+别太重 2 nr
+别失八里 51 i
+别套 3 r
+别妇抛雏 3 v
+别妻离子 3 n
+别子 19 n
+别字 33 n
+别存 2 v
+别守 3 v
+别室 3 n
+别家 59 r
+别尔乌 13 nr
+别尔克 2 nr
+别尔卡 2 nr
+别尔哥罗德 5 nrt
+别尔金 2 nr
+别局 3 r
+别居异财 3 i
+别帅石 2 nr
+别师 3 n
+别府 5 n
+别康桥 3 nr
+别廖佐 2 nr
+别开一格 3 nr
+别开生面 67 l
+别开蹊径 3 l
+别弟笃 2 nr
+别弹 3 n
+别当真 3 nr
+别录 6 n
+别必雄 256 nr
+别忘了 3 l
+别忘记 3 n
+别念 2 n
+别怕 3 c
+别急 3 a
+别怪 3 v
+别恋 5 v
+别情 27 n
+别情依依 3 nr
+别成 3 v
+别房 2 n
+别打我 3 i
+别扭 270 a
+别找我 3 l
+别抡剑 2 vn
+别抱琵琶 3 l
+别拉亚 2 nr
+别拉屯 2 nr
+别拉洪 2 nr
+别拍 3 v
+别拔 3 n
+别拗 3 a
+别拿洋 2 nz
+别挤 3 a
+别捷夫 6 nr
+别捷赫 3 nr
+别排 3 v
+别揍 3 v
+别描头 3 n
+别提 198 nr
+别搞 3 v
+别搬 3 v
+别支 3 n
+别收 3 v
+别教 3 nz
+别数 3 n
+别斯兰 4 nr
+别斯谢 6 nr
+别族 3 r
+别无二致 8 i
+别无他法 3 l
+别无他物 5 l
+别无其他 3 l
+别无出路 9 i
+别无分号 3 i
+别无分店 3 n
+别无它法 2 i
+别无所求 3 i
+别无良策 8 i
+别无选择 76 l
+别无长物 3 i
+别时圆 2 nr
+别替 3 v
+别有人间 3 i
+别有天地 3 i
+别有奇 2 nr
+别有心肝 3 i
+别有心肠 3 i
+别有情趣 3 i
+别有所指 3 i
+别有洞天 20 i
+别有滋味 3 l
+别有用心 195 l
+别有用意 3 i
+别有肺肠 3 i
+别有良 3 nr
+别有见地 3 i
+别有风味 266 i
+别有风趣 3 i
+别本 3 r
+别束 3 v
+别来无恙 46 i
+别来无羔 3 nr
+别来爱 2 nr
+别构作用 3 n
+别构剂 3 n
+别构性 3 n
+别构抑制 3 n
+别构效应 3 n
+别构活化 3 n
+别构激活 3 n
+别构蛋白 3 l
+别构调节 3 n
+别构转换 3 l
+别构部位 3 n
+别构配体 3 n
+别构酶 3 n
+别林斯 4 nr
+别林斯基 25 nz
+别架 3 n
+别栋 3 r
+别树一帜 3 i
+别树一旗 3 nr
+别树一格 3 nr
+别校 3 r
+别样 80 r
+别样红 3 l
+别气 3 n
+别洛乌 2 nr
+别洛夫 5 nr
+别洛韦日 3 nrt
+别派 3 r
+别派剑 2 nr
+别派武 3 nr
+别清浊 6 nr
+别王 3 nrt
+别现 3 v
+别班 3 r
+别理 6 n
+别生枝节 3 i
+别生气 3 n
+别疆封 2 nr
+别的 4354 r
+别省 3 r
+别着 3 r
+别着急 3 i
+别睡了 3 n
+别碰 7 v
+别离 59 v
+别种 3 r
+别科 2 r
+别科夫 4 nr
+别称 151 v
+别答 3 v
+别管 159 c
+别箱 3 n
+别籍异居 3 n
+别籍异财 3 n
+别类分门 3 n
+别线 3 n
+别练 2 a
+别组 3 r
+别绪 3 n
+别罐 3 n
+别置一喙 3 i
+别老是 3 l
+别耶夫 2 nr
+别胜新 3 nr
+别胡说 3 l
+别脚 3 n
+别致 188 v
+别藻蓝素 3 n
+别虞姬 2 nr
+别西姆 2 nr
+别见怪 59 i
+别讨 3 v
+别记 3 n
+别论 3 c
+别试 3 v
+别误会 3 l
+别说 1418 c
+别说出 3 i
+别说起 3 i
+别课 3 v
+别谈 3 v
+别谋算 3 i
+别谦虚 3 nr
+别财异居 3 i
+别费 2 n
+别赏 3 v
+别趣 3 n
+别趴下 3 vn
+别跑 3 v
+别跟我 3 nr
+别踢 3 i
+别输 3 v
+别过 3 c
+别过来 3 l
+别连科 25 nr
+别逃 3 v
+别里别扭 3 z
+别里哥 7 nr
+别针 18 n
+别错过 3 l
+别闹 2 a
+别队 3 n
+别院 23 r
+别难过 3 l
+别集 57 v
+别露 2 v
+别项 3 r
+别题 3 n
+别风淮雨 3 nr
+别饶风致 3 l
+别饶风趣 3 l
+别馆 4 r
+别首 3 v
+别骑 3 n
+别鹤孤鸾 3 nr
+别鹤离鸾 3 nr
+刬 2 zg
+刬旧谋新 3 ns
+刬草除根 3 nz
+刭 8 zg
+刮 1317 v
+刮下 3 v
+刮下去 3 i
+刮下来 3 l
+刮伤 3 v
+刮倒 3 v
+刮刀 40 n
+刮刮卡 8 n
+刮刮叫 7 i
+刮刮杂杂 6 i
+刮削 25 v
+刮匙 3 n
+刮去 3 v
+刮取 3 v
+刮地皮 2 i
+刮垢 3 n
+刮垢磨光 3 i
+刮好 3 v
+刮宫 30 n
+刮开 3 v
+刮得 3 v
+刮打 3 v
+刮掉 3 v
+刮搭板儿 3 n
+刮来刮去 3 i
+刮板 12 n
+刮棒 3 n
+刮水器 262 n
+刮油 3 n
+刮治 3 v
+刮片 7 n
+刮痕 2 n
+刮痧 56 vn
+刮皮 3 n
+刮目 5 n
+刮目相待 3 i
+刮目相看 136 i
+刮目相见 3 i
+刮研 3 vn
+刮破 3 vn
+刮空 3 n
+刮粪机 3 n
+刮肠洗胃 3 n
+刮胡刀 3 n
+刮胡子 16 n
+刮脸 81 v
+刮脸刀 5 i
+刮脸皮 3 i
+刮腻子 3 l
+刮舌 3 n
+刮蜡器 3 n
+刮蜡片 3 n
+刮走 3 v
+刮起 3 v
+刮起来 3 i
+刮过 3 v
+刮过去 3 i
+刮过来 3 i
+刮野扫地 3 i
+刮铲 3 n
+刮面 3 n
+刮须 3 n
+刮风 102 n
+刮风下雨 3 i
+刮骨 3 n
+刮骨刀 3 i
+刮骨去毒 3 i
+刮骨抽筋 3 i
+刮鼻子 3 n
+到 205341 v
+到任 111 v
+到会者 3 n
+到位 852 v
+到位率 2 l
+到发场 3 l
+到哪去 3 z
+到场 145 d
+到场人员 3 l
+到埠 3 n
+到处 3414 d
+到处跑 3 v
+到头 198 v
+到头来 297 l
+到岸 35 v
+到岸价 3 n
+到底 6043 d
+到庭 21 d
+到户 46 v
+到手 235 d
+到时候 544 l
+到期 334 d
+到期日 12 l
+到来 2665 d
+到来之际 164 l
+到来撒 3 v
+到极点 3 l
+到校 71 v
+到案 24 v
+到次 3 d
+到此一游 19 l
+到此为止 114 l
+到此结束 3 l
+到职 34 v
+到职人员 3 l
+到访 55 v
+到货 22 v
+到达 3107 v
+到达场 3 l
+到达某 3 n
+到达港 3 l
+到达站 3 l
+到顶 26 v
+到齐 3 d
+刳 12 g
+刳形去皮 3 nr
+刳心雕肾 3 n
+刳精呕血 3 vn
+刳精鉥心 3 z
+刳肝沥胆 3 nr
+刳胎杀夭 3 nr
+刳胎焚夭 3 nr
+刳脂剔膏 3 i
+制 11750 n
+制丝 7 n
+制丸机 3 n
+制为 3 v
+制件 18 n
+制伏 47 v
+制住 3 v
+制作 4804 vn
+制作业 13 n
+制作人员 3 n
+制作厂 2 n
+制作商 10 n
+制作器 3 n
+制作方 3 n
+制作方法 3 n
+制作组 3 n
+制作者 20 n
+制假 26 n
+制假者 2 n
+制做 46 v
+制做发布 3 v
+制做群 3 v
+制冰 3 v
+制冰机 3 n
+制冷 127 v
+制冷剂 53 n
+制冷机 45 n
+制冷系统 3 n
+制冷量 2 n
+制出 70 v
+制刷厂 3 n
+制剂 502 n
+制剂室 3 n
+制动 150 v
+制动功率 3 n
+制动器 130 n
+制动液 3 n
+制动缸 3 n
+制动闸 3 n
+制动阀 256 n
+制单 3 n
+制博会 3 n
+制卡商 3 n
+制印 3 v
+制发 3 v
+制取 309 v
+制品 1529 n
+制品业 3 n
+制品厂 5 n
+制哪个呢 3 nr
+制售 26 vn
+制图 107 n
+制图人 3 n
+制图员 2 n
+制图学 5 n
+制图室 3 n
+制图师 3 n
+制图样 3 n
+制图精度 3 n
+制图者 3 n
+制备 421 v
+制定 13662 v
+制定方案 3 n
+制定者 29 n
+制宜 6 v
+制宪 116 n
+制宪会议 3 n
+制导 922 n
+制导技术 3 n
+制导武器 3 n
+制导系统 77 n
+制币 3 n
+制帽 12 n
+制度 21517 n
+制度化 460 n
+制度性 37 n
+制式 453 n
+制式化 4 v
+制式教练 3 n
+制成 2805 v
+制成品 114 n
+制报 3 n
+制敌机先 3 n
+制服 487 v
+制服呢 3 n
+制材 10 n
+制模 2 n
+制止 1048 v
+制止动乱 3 n
+制毒 8 v
+制氢 8 n
+制氧机 5 n
+制氮机 3 n
+制法 131 n
+制浆 27 n
+制海权 56 n
+制漆 2 n
+制热 5 v
+制热量 3 n
+制片 114 n
+制片人 73 n
+制片厂 183 n
+制片商 3 n
+制片方 4 n
+制版 42 v
+制版工艺 3 n
+制版术 3 n
+制版机 3 n
+制盐 78 n
+制盐人 3 n
+制砂机 3 n
+制砖机 27 n
+制礼作乐 3 n
+制种 12 n
+制程 3 n
+制空权 133 n
+制笔厂 3 n
+制粉 19 n
+制粒机 3 n
+制糖 336 n
+制糖业 36 n
+制糖厂 15 n
+制约 1602 n
+制约力 3 n
+制约性 8 n
+制约逻辑 3 n
+制纸 3 n
+制罐 3 n
+制胜 195 v
+制胜之道 12 n
+制胜因素 3 n
+制胜球 3 n
+制艺 12 n
+制茶业 2 n
+制药 1026 n
+制药业 16 n
+制药厂 58 n
+制药学 3 n
+制药机械 3 n
+制衡 97 v
+制衡作用 3 n
+制衣 25 n
+制衣厂 9 n
+制表 61 n
+制表机 3 n
+制表符 7 n
+制表键 3 n
+制袋机 3 n
+制裁 897 n
+制裁者 3 n
+制规 3 n
+制订 1419 v
+制贩 2 n
+制造 6418 v
+制造业 847 n
+制造业者 3 n
+制造事端 3 n
+制造厂 194 n
+制造厂商 3 n
+制造品 9 n
+制造商 418 n
+制造器 3 n
+制造场 3 n
+制造家 26 n
+制造局 3 n
+制造悬念 3 n
+制造执行系统 2 n
+制造术 3 n
+制造机 2 n
+制造矛盾 3 l
+制造纠纷 3 z
+制造者 71 n
+制造舆论 3 l
+制造费用 3 n
+制酸剂 3 n
+制酸性 3 n
+制醣 3 vn
+制钉机 3 n
+制钱 91 v
+制铁 28 n
+制锁 2 v
+制锌版术 3 n
+制陶 112 n
+制霉菌素 7 n
+制面 3 n
+制革 185 vn
+制革厂 5 n
+制革工厂 3 n
+制鞋 97 n
+制鞋业 13 n
+制鞋厂 3 n
+制音器 3 n
+制高点 100 n
+制黄 3 n
+制黄贩黄 3 n
+刷 1990 zg
+刷上 3 v
+刷上去 3 v
+刷上来 3 v
+刷下 3 v
+刷下去 3 v
+刷下来 3 v
+刷写 5 v
+刷刷 289 v
+刷刷声 3 n
+刷刷牙 2 n
+刷卡 80 n
+刷卡器 2 nz
+刷卡机 7 n
+刷去 3 v
+刷墙 3 n
+刷子 97 n
+刷屏 3 n
+刷拉 7 v
+刷拉拉 3 nz
+刷掉 3 v
+刷新 201 v
+刷新周期 3 n
+刷新测试 3 n
+刷新率 3 n
+刷新纪录 3 n
+刷新记录 3 nz
+刷来 3 v
+刷来刷去 3 z
+刷毛 16 n
+刷油漆 3 z
+刷洗 32 v
+刷浆 3 n
+刷漆 3 z
+刷牙 113 v
+刷牙漱口 3 n
+刷白 11 v
+刷耻 3 n
+刷装备 3 n
+刷起 3 v
+刷起来 3 v
+刷钱 3 v
+刷麸 3 n
+券 508 n
+券别 3 n
+券商 228 n
+券式 3 n
+券桥乡 2 n
+券种 3 n
+券门 649 n
+券面 3 n
+刹 228 t
+刹住 31 v
+刹帝利 26 n
+刹带 3 n
+刹把 6 n
+刹时 23 t
+刹时间 30 t
+刹海 3 n
+刹车 85 n
+刹车声 3 n
+刹车油 3 n
+刹车灯 3 n
+刹车片 2 n
+刹车盘 3 n
+刹车踏板 3 n
+刹那 124 t
+刹那之间 3 n
+刹那间 389 t
+刹闸 3 n
+刹风整纪 3 n
+刺 7172 v
+刺上 3 v
+刺上化下 3 n
+刺上去 3 v
+刺上来 3 v
+刺下 3 v
+刺下去 3 v
+刺下来 3 v
+刺丝 4 n
+刺中 173 v
+刺五加 17 nz
+刺人 3 n
+刺伤 268 v
+刺儿 16 n
+刺儿头 6 n
+刺入 3 v
+刺出 3 v
+刺出去 3 v
+刺刀 602 n
+刺刀见红 3 v
+刺到 3 v
+刺刺 3 v
+刺刺不休 3 v
+刺参 8 n
+刺史 1136 n
+刺啦 7 o
+刺头 13 v
+刺头儿 3 n
+刺孔 3 n
+刺字 27 n
+刺客 491 n
+刺客列传 3 n
+刺山柑 3 n
+刺开 3 v
+刺心切骨 3 z
+刺心刻骨 3 n
+刺心裂肝 3 n
+刺戳 3 n
+刺扎 3 v
+刺探 97 v
+刺探出 3 n
+刺有 3 v
+刺杀 346 v
+刺杀位 3 n
+刺杀出局 3 n
+刺柏 3 n
+刺桐 13 n
+刺梅 3 n
+刺梨 3 n
+刺棒 3 n
+刺棱 3 v
+刺槐 37 n
+刺死 3 v
+刺毛 3 n
+刺毛虫 3 n
+刺毛辊 3 n
+刺溜 3 z
+刺激 2873 v
+刺激作用 3 n
+刺激剂 2 n
+刺激器 5 n
+刺激子 3 n
+刺激性 234 n
+刺激扩散 3 n
+刺激法 3 n
+刺激物 31 n
+刺激素 8 n
+刺激维度 3 n
+刺激阈限 3 v
+刺猬 142 n
+刺猬皮 3 vn
+刺玫 2 n
+刺疼 3 v
+刺痒 6 v
+刺痛 188 v
+刺痛性 3 n
+刺痛感 3 n
+刺目 18 n
+刺眼 111 v
+刺破 4 v
+刺秦 3 ns
+刺秦王 3 nz
+刺穿 3 v
+刺细胞 11 n
+刺绣 229 n
+刺绣品 2 n
+刺绣工 3 n
+刺网 5 v
+刺者 3 n
+刺耳 195 n
+刺股 3 v
+刺股悬梁 3 n
+刺股读书 3 n
+刺花 3 n
+刺花样 3 n
+刺菜蓟 3 n
+刺蒺藜 3 n
+刺身 6 v
+刺透 3 v
+刺配 21 v
+刺酮碱 3 n
+刺针 6 n
+刺青 3 n
+刺骨 95 n
+刺鼠 3 n
+刺鼻 95 v
+刻 2524 v
+刻上去 3 v
+刻上来 3 v
+刻下 69 v
+刻下去 3 v
+刻下来 3 v
+刻不容松 3 n
+刻不容缓 86 i
+刻不待时 3 i
+刻丝 3 n
+刻于 3 v
+刻作 3 v
+刻其 3 d
+刻写 15 v
+刻出 3 v
+刻刀 7 n
+刻划 93 n
+刻划入微 3 i
+刻划出 3 i
+刻到 3 v
+刻制 27 v
+刻印 105 v
+刻即 3 d
+刻图章 3 i
+刻字 63 n
+刻字机 3 n
+刻工 3 n
+刻度 99 n
+刻度井 3 n
+刻度尺 3 i
+刻度盘 11 n
+刻录 20 v
+刻录光盘 2 n
+刻录成 3 v
+刻录机 3 n
+刻录盘 3 n
+刻录碟 3 n
+刻意 336 v
+刻意模仿 3 v
+刻意求工 3 i
+刻意求精 3 i
+刻意经营 3 i
+刻意追求 3 i
+刻成 3 v
+刻掉 3 v
+刻有 582 v
+刻木为吏 3 i
+刻木为鹄 3 n
+刻本 339 n
+刻板 81 n
+刻款 3 n
+刻毒 32 v
+刻版 3 v
+刻版印刷 3 n
+刻画 527 n
+刻画入微 3 i
+刻画出 3 i
+刻画无盐 3 i
+刻画来 3 i
+刻画脸谱 3 n
+刻痕 9 n
+刻盘 3 v
+刻石 61 n
+刻碟 3 n
+刻章琢句 3 i
+刻纸 3 n
+刻线 19 n
+刻翠裁红 3 n
+刻肌刻骨 3 i
+刻舟求剑 12 i
+刻花 21 n
+刻苦 322 v
+刻苦耐劳 6 i
+刻苦自励 3 v
+刻苦钻研 3 n
+刻薄 150 a
+刻薄寡思 3 i
+刻薄寡恩 3 n
+刻薄话 3 i
+刻蚀 13 v
+刻蚀地貌 3 n
+刻蜡纸 3 n
+刻赤 13 n
+刻起 3 v
+刻起来 3 v
+刻足 3 a
+刻过去 3 i
+刻过来 3 d
+刻钟 6 q
+刻镂 3 v
+刻雾裁风 3 n
+刻面 2 n
+刻骨 21 n
+刻骨仇恨 14 i
+刻骨崩心 3 i
+刻骨相思 8 i
+刻骨铭心 94 i
+刻骨镂心 3 i
+刻鹄成鹜 3 i
+刻鹄类鹜 3 i
+刼 4 zg
+刽 17 n
+刽子手 115 n
+刿 10 zg
+刿心刳肺 3 v
+刿心刳腹 3 v
+刿心怵目 3 vn
+刿心鉥肾 3 v
+刿目怵心 3 z
+刿目鉥心 3 z
+刿鉥心腑 3 n
+刿鉥肝肾 3 n
+剀 17 x
+剀切 3 nr
+剁 817 zg
+剁岚县 3 v
+剁成 3 v
+剁碎 16 v
+剁肉 3 v
+剂 1615 zg
+剂型 157 n
+剂子 3 n
+剂量 504 n
+剂量学 3 n
+剂量效应 3 n
+剂量测定 3 n
+剂量率 3 n
+剂量计 3 n
+剃 538 v
+剃光头 16 n
+剃刀 42 n
+剃刀鲸 3 n
+剃发 3 v
+剃发为尼 3 n
+剃发令 23 n
+剃头 134 n
+剃头刀 8 n
+剃头匠 32 n
+剃头发 3 n
+剃度 56 n
+剃得 3 v
+剃毛器 3 n
+剃泪 3 n
+剃着 3 v
+剃面 3 n
+剃须 3 n
+剃须刀 19 n
+剃齿刀 2 n
+剄 2 zg
+剅 2048 zg
+則 5 zg
+剉 5860 zg
+削 1411 zg
+削价 16 v
+削低 3 v
+削光 3 v
+削减 545 v
+削减到 3 i
+削减成 3 i
+削刮 3 v
+削削 3 v
+削去 3 v
+削发 53 v
+削发为僧 3 n
+削发为尼 3 l
+削壁 12 v
+削尖 3 v
+削尖脑袋 7 l
+削峰平谷 3 i
+削平 46 v
+削弱 1115 v
+削成 3 v
+削掉 3 v
+削断 3 v
+削方为圆 3 l
+削木为吏 3 i
+削来削去 3 n
+削株掘根 3 i
+削波 3 v
+削波器 3 n
+削球 11 v
+削球手 5 n
+削瘦 33 a
+削皮 6 v
+削皮刀 3 l
+削短 3 v
+削职 3 v
+削职为民 3 l
+削肩 3 v
+削苹果 3 l
+削草除根 3 i
+削薄 3 a
+削足就履 3 l
+削足适履 11 i
+削过 3 v
+削铁如泥 35 i
+削铁无声 3 i
+削铅笔 3 v
+削铅笔机 3 l
+削销笔 3 n
+削除 4 v
+削面 7 v
+剋 10 zg
+剌 962 zg
+前 62779 f
+前一刻 3 i
+前一天 617 t
+前一晚 3 t
+前一阵子 67 l
+前三位 3 n
+前三合村 3 n
+前三名 3 i
+前三天 3 t
+前三季 3 t
+前三强 3 i
+前三步 3 l
+前三甲 3 n
+前三章 3 i
+前不久 390 i
+前不巴村 3 l
+前不见古人 2 i
+前世 120 t
+前两天 3 i
+前两节 3 i
+前个 3 r
+前中期 5 f
+前为 3 v
+前事 3 n
+前事不忘 27 i
+前五强 3 i
+前些 3 r
+前些天 3 t
+前些年 139 t
+前些时 44 t
+前些时候 3 t
+前些时日 3 t
+前人 507 n
+前人失脚 3 i
+前人栽树 3 l
+前人种树 2 n
+前仆后继 184 i
+前仇 3 v
+前代 3 t
+前仰后合 46 i
+前件 3 n
+前任 279 n
+前伸关系 3 l
+前伸平衡 3 i
+前伸运动 3 l
+前例 8 n
+前侧 23 f
+前信号灯 3 n
+前俯后仰 5 l
+前倨后卑 3 i
+前倨后恭 6 i
+前倾 3 b
+前兆 65 n
+前军 3 n
+前几日 3 i
+前几次 3 i
+前列 1218 v
+前列康 3 n
+前列环素 3 n
+前列腺 245 n
+前列腺炎 3 n
+前列腺病 3 n
+前列腺癌 63 n
+前列腺素 49 n
+前前后后 150 i
+前功尽废 3 i
+前功尽弃 60 i
+前功尽灭 3 i
+前功皆弃 3 i
+前十名 3 l
+前十强 3 i
+前十款 3 n
+前十页 3 n
+前半 3 t
+前半场 3 n
+前半夜 13 t
+前半天 3 t
+前半年 19 t
+前半晌 4 t
+前半期 3 t
+前半段 3 t
+前半生 3 t
+前半部 13 n
+前南 7 f
+前南斯拉夫地区 3 ns
+前卫 172 n
+前卫团 3 n
+前卫片 3 n
+前卫者 3 n
+前危后则 3 i
+前厂 3 n
+前厅 183 n
+前去 1502 t
+前叉 2 v
+前叙 3 v
+前古未有 3 i
+前古未闻 3 i
+前台 210 n
+前台分区 3 n
+前史 3 n
+前叶 3 t
+前合后仰 3 n
+前后 2870 f
+前后一致 3 i
+前后任 3 l
+前后夹攻 3 i
+前后左右 3 l
+前后排 3 s
+前后文 6 n
+前后方 7 f
+前后相悖 3 i
+前后相随 3 i
+前后矛盾 3 l
+前后脚 3 i
+前后脚儿 3 l
+前后轮 9 n
+前后部 3 f
+前后门 21 n
+前向串扰 3 l
+前向掩蔽 3 i
+前周 3 t
+前呼后应 3 l
+前呼后拥 65 i
+前哨 334 n
+前哨战 7 n
+前哨站 3 n
+前哨阵地 3 n
+前因 3 n
+前因后果 79 i
+前园 3 n
+前场 203 n
+前埔 3 ns
+前堂 10 n
+前堵后追 19 l
+前夕 782 f
+前夜 84 t
+前大灯 3 n
+前天 271 t
+前夫 54 n
+前头 315 f
+前奏 131 n
+前奏曲 29 n
+前套 3 n
+前女友 3 n
+前妻 74 n
+前委 118 n
+前嫌 48 v
+前宋村 3 n
+前定 3 v
+前导 326 n
+前尘 22 n
+前尘影事 3 i
+前尘往事 3 i
+前屋 3 n
+前山 28 n
+前川 6 n
+前巷 3 n
+前帖 3 n
+前年 434 t
+前序 2 n
+前度刘郎 3 ns
+前庭 112 n
+前庭悬鱼 3 i
+前庭盾 3 i
+前廊 13 n
+前弓 3 n
+前弓区 3 n
+前往 2528 t
+前徒倒戈 3 l
+前怕狼 3 i
+前怕狼后怕虎 9 i
+前思后想 9 i
+前悬架 3 n
+前情 3 n
+前情摘要 3 i
+前愆 3 n
+前戏 3 n
+前房 3 n
+前所 59 n
+前所未有 691 i
+前所未见 31 i
+前所未闻 18 i
+前扑后继 3 i
+前扑后起 3 i
+前指 19 n
+前挽后推 3 i
+前排 110 v
+前排观众 3 i
+前提 3829 n
+前提条件 3 n
+前支索 3 i
+前敌 157 n
+前文 3 n
+前方 649 f
+前旗 23 n
+前无古人 48 i
+前日 423 t
+前晌 3 t
+前晚 3 t
+前景 1663 n
+前景色 11 n
+前朝 218 t
+前期 1384 f
+前期工作 3 l
+前期损益 3 n
+前期白斑 3 l
+前朱雀 2 i
+前机 34 n
+前束词 3 n
+前来 2917 t
+前松后紧 3 n
+前栋 3 r
+前桅 3 n
+前桥 4 n
+前楼 3 n
+前次 141 r
+前款 21 n
+前歌后舞 3 l
+前此 3 r
+前步 3 n
+前段 151 n
+前段时间 3 n
+前殿 371 n
+前汉 9 t
+前江 6 f
+前池 3 n
+前沿 521 s
+前沿性 9 n
+前沿技术 3 n
+前沿科学 2 n
+前沿轨道 3 n
+前沿阵地 3 nz
+前浪 4 n
+前海 10 f
+前清 51 t
+前清后欠 3 n
+前湾 4 n
+前滚 3 v
+前滚翻 3 i
+前灯 4 n
+前爪 53 n
+前牙 3 n
+前生 59 n
+前田 6 n
+前田亘辉 3 ns
+前田知惠 3 i
+前男友 3 n
+前目后凡 3 i
+前瞻 42 n
+前瞻后顾 3 i
+前瞻性 69 n
+前短后长 3 i
+前磨牙 3 i
+前科 38 n
+前秦 237 t
+前移 189 v
+前程 295 n
+前程万里 6 i
+前程似锦 11 n
+前程无忧 23 i
+前程远大 3 i
+前程锦绣 3 n
+前空翻 5 i
+前窗 3 n
+前站 24 n
+前童村 3 n
+前童镇 2 n
+前端 312 f
+前端开发 2 i
+前紧后松 3 l
+前级 3 n
+前线 1325 n
+前缀 51 v
+前缘 178 n
+前缘走廊 3 n
+前置 71 n
+前置式 2 n
+前置条件 4 n
+前置柱 3 i
+前置程序 3 n
+前置词 2 i
+前翼子板 3 n
+前者 2105 n
+前肢 150 n
+前胸 244 n
+前胸袋 3 n
+前脑 14 n
+前脚 85 n
+前腰 19 n
+前臂 46 n
+前臂骨 3 i
+前臼齿 30 n
+前舱 3 n
+前苇塘 3 n
+前茅 50 n
+前藏 3 n
+前行 460 v
+前街后巷 3 i
+前襟 56 n
+前覆后戒 3 i
+前言 99 n
+前言不对 3 i
+前言不搭后语 12 i
+前言往行 3 i
+前识 3 n
+前话 9 n
+前谷 3 n
+前负荷 3 n
+前贤 45 n
+前赴后继 28 i
+前跋后疐 3 i
+前路 186 n
+前蹄 3 n
+前身 648 r
+前车 3 n
+前车之覆 2 i
+前车之鉴 55 i
+前车可鉴 6 i
+前轮 23 n
+前轮驱动 3 l
+前轴 17 n
+前辈 1900 n
+前辐照 3 n
+前辙可鉴 3 nz
+前边 635 f
+前进 2957 v
+前进不懈 3 i
+前进区 3 n
+前进报 18 n
+前进方向 3 n
+前进波 3 n
+前进观察 3 n
+前述 159 b
+前途 1263 n
+前途广阔 3 i
+前途无亮 3 l
+前途无量 37 l
+前途渺茫 3 i
+前途远大 3 i
+前遮后拥 3 i
+前邵村 3 ns
+前部 449 f
+前部船舱 3 n
+前郭尔罗斯蒙古族自治县 6 ns
+前重后轻 3 i
+前锋 790 n
+前锋线 21 n
+前镇 3 n
+前门 397 n
+前门大街 131 ns
+前门拒狼 3 l
+前门拒虎 2 l
+前闸 3 n
+前院 131 n
+前面 5024 f
+前面板 3 n
+前顶 3 n
+前项 23 r
+前额 161 n
+前馈 20 v
+前首相 3 i
+前驱 62 n
+前齿 3 n
+剎 32 zg
+剐 232 v
+剑 12553 n
+剑侠 33 n
+剑侠传 3 nz
+剑侠情缘 3 n
+剑光 3 n
+剑兰 3 ns
+剑兰花 3 nz
+剑冢 3 n
+剑刚 2 n
+剑南 36 ns
+剑南春 7 ns
+剑及履及 3 i
+剑及屦及 3 v
+剑叶 3 n
+剑圣 3 ns
+剑士 102 n
+剑头一吷 3 nz
+剑宗 3 nz
+剑客 61 n
+剑尖 3 n
+剑尾 3 ns
+剑峰 4 ns
+剑川 15 ns
+剑川县 4 ns
+剑形 3 n
+剑影 2 n
+剑心 3 n
+剑态箫心 3 nr
+剑戟 30 n
+剑戟森森 3 nr
+剑拔弩张 63 i
+剑持 3 n
+剑持勇 3 i
+剑术 390 n
+剑杆 2 n
+剑柄 3 n
+剑柱 7 n
+剑树刀山 3 ns
+剑桥 213 ns
+剑桥大学 207 nt
+剑桥大学出版社 3 nt
+剑桥市 2 ns
+剑桥郡 6 ns
+剑武 2 ns
+剑气 78 n
+剑气箫心 3 nr
+剑河 2 ns
+剑河县 2 ns
+剑法 1951 n
+剑湖山 3 ns
+剑潭 3 ns
+剑灵 2 ns
+剑王 3 nt
+剑眉 28 ns
+剑眉一剔 3 i
+剑羚 3 n
+剑胆琴心 2 i
+剑背 3 n
+剑舞 3 n
+剑芒 25 n
+剑诀 3 n
+剑迹 3 n
+剑锋 190 n
+剑门关 3 ns
+剑门山 3 ns
+剑门昆鹏 7 nz
+剑阁 56 ns
+剑阁县 4 ns
+剑陈 3 ns
+剑靶 3 n
+剑鞘 161 n
+剑首一吷 3 nz
+剑魔 3 n
+剑麻 88 n
+剑齿 2 n
+剑齿虎 8 i
+剑齿象 32 n
+剑龙 8 ns
+剒 9 zg
+剔 130 zg
+剔了 3 v
+剔光 3 v
+剔出 6 v
+剔去 3 v
+剔庄货 3 n
+剔开 3 v
+剔得 3 v
+剔抽秃揣 3 v
+剔掉 3 v
+剔牙 9 v
+剔着 3 v
+剔红 18 v
+剔蝎撩蜂 3 v
+剔选 3 v
+剔透 14 v
+剔透玲珑 2 i
+剔除 102 v
+剔骨 17 v
+剕 12 zg
+剖 256 n
+剖决如流 3 i
+剖宫产 28 n
+剖幽析微 3 n
+剖开 101 v
+剖心坼肝 3 v
+剖心析肝 3 n
+剖心析胆 3 n
+剖心泣血 3 i
+剖成 3 v
+剖析 245 vn
+剖析入微 3 i
+剖析肝胆 3 n
+剖毫析芒 3 i
+剖玄析微 3 i
+剖白 16 v
+剖示 2 v
+剖示图 3 n
+剖肝沥胆 3 i
+剖肝泣血 3 n
+剖腹 112 n
+剖腹产 45 n
+剖腹生产 3 n
+剖腹自杀 3 i
+剖腹藏珠 3 n
+剖蚌得珠 3 i
+剖蚌求珠 3 i
+剖视 3 v
+剖视图 4 n
+剖解 3 v
+剖释 3 v
+剖面 160 n
+剖面图 21 n
+剖面形式 3 n
+剖面法 3 n
+剗旧谋新 3 ns
+剗草除根 3 nz
+剚 6 zg
+剛 5 zg
+剜 175 v
+剜肉做疮 3 i
+剜肉医疮 3 i
+剜肉成疮 3 i
+剜肉生疮 3 i
+剜肉补疮 3 i
+剜除 3 i
+剞 2 x
+剟 6 zg
+剠 14 zg
+剡 24 ns
+剡溪 9 ns
+剢 23 zg
+剤 44 zg
+剥 1020 v
+剥下 3 v
+剥光 3 v
+剥削 1321 v
+剥削制度 3 n
+剥削者 53 n
+剥削阶级 168 n
+剥剥啄啄 3 o
+剥去 3 v
+剥啄 8 o
+剥壳 4 n
+剥夺 998 v
+剥夺公权 3 n
+剥夺权利 3 n
+剥夺走 3 n
+剥床及肤 3 n
+剥开 3 v
+剥弃 3 v
+剥得 3 v
+剥掉 3 v
+剥极则复 3 n
+剥极将复 3 n
+剥极必复 3 v
+剥皮 144 v
+剥皮抽筋 3 v
+剥皮机 2 n
+剥离 147 v
+剥离强度 3 n
+剥离技术 3 n
+剥离机 3 n
+剥线机 3 n
+剥肤之痛 3 n
+剥肤及髓 3 n
+剥肤椎髓 3 n
+剥脱 3 v
+剥花生 3 n
+剥茧 4 n
+剥茧抽丝 3 z
+剥落 250 v
+剥蚀 201 v
+剥蚀面 3 n
+剥除 3 v
+剦 14 zg
+剧 1769 n
+剧中 237 n
+剧中人 27 n
+剧作 440 n
+剧作家 365 n
+剧作者 14 n
+剧减 23 v
+剧务 5 n
+剧务员 3 n
+剧动 3 n
+剧协 35 j
+剧变 139 n
+剧名 3 a
+剧团 713 n
+剧场 579 n
+剧场版 3 n
+剧坛 3 n
+剧增 97 v
+剧展 3 vn
+剧情 326 n
+剧情片 3 n
+剧情简介 3 vn
+剧挫 3 v
+剧曲 3 n
+剧本 897 n
+剧本创作 3 n
+剧本小说 3 n
+剧校 3 n
+剧毒 520 n
+剧烈 1082 a
+剧烈地 3 n
+剧烈性 3 n
+剧烈运动 3 n
+剧照 247 n
+剧痛 478 n
+剧目 617 n
+剧社 566 n
+剧种 228 n
+剧组 90 n
+剧终 5 v
+剧艺 3 n
+剧艺社 10 n
+剧评 10 n
+剧评人 3 n
+剧跌 3 v
+剧里 3 n
+剧院 846 n
+剧集 3 n
+剧雪 3 n
+剨 5 zg
+剩 1852 v
+剩下 3240 v
+剩个 3 l
+剩余 629 v
+剩余产品 302 l
+剩余价值 2306 l
+剩余价值率 435 l
+剩余偏移 3 l
+剩余劳力 3 l
+剩余劳动 463 l
+剩余劳动力 29 l
+剩余时间 3 l
+剩余次数 3 l
+剩余物 5 l
+剩余物资 3 l
+剩山残水 3 l
+剩得 3 l
+剩料 3 n
+剩水残山 3 l
+剩磁 31 n
+剩肉 3 n
+剩菜 42 n
+剩菜残羹 3 n
+剩过 3 v
+剩酒 3 v
+剩钱 3 v
+剩饭 71 v
+剩饭剩菜 3 l
+剩馥残膏 3 nz
+剪 1601 v
+剪下 3 n
+剪下去 3 v
+剪下来 3 v
+剪作 3 vn
+剪出 3 v
+剪刀 623 n
+剪刀差 6 n
+剪刀手 3 n
+剪切 109 vn
+剪切力 6 n
+剪切应力 3 n
+剪切机 3 n
+剪切板 3 n
+剪切模量 3 i
+剪切角 3 n
+剪到 3 v
+剪剪 3 vn
+剪力 6 n
+剪力墙 9 n
+剪反 3 v
+剪发 28 v
+剪发杜门 3 nz
+剪取 5 v
+剪口 6 vn
+剪头发 3 i
+剪子 196 n
+剪字 3 n
+剪床 3 vn
+剪应力 3 n
+剪应变 3 n
+剪开 3 v
+剪彩 64 n
+剪彩仪式 3 n
+剪影 53 n
+剪径 25 n
+剪恶除奸 3 i
+剪成 3 v
+剪截 3 v
+剪报 35 n
+剪指甲 3 n
+剪掉 3 v
+剪接 20 v
+剪接体 3 n
+剪接受体 3 n
+剪接室 3 n
+剪接法 3 n
+剪断 3 v
+剪板机 3 n
+剪枝 9 n
+剪树 3 n
+剪毛 10 n
+剪毛机 3 n
+剪法 3 n
+剪灭 3 v
+剪点 3 n
+剪烛西窗 3 i
+剪片 3 n
+剪短 20 v
+剪票 3 n
+剪票口 14 n
+剪票员 3 n
+剪秋萝 3 n
+剪纸 101 n
+剪纸作品 3 n
+剪纸片 8 n
+剪纸片儿 3 nz
+剪线 3 n
+剪绒 5 n
+剪羊毛 3 n
+剪羊毛机 3 n
+剪花 3 n
+剪草 3 n
+剪草机 3 n
+剪草除根 5 nz
+剪裁 85 n
+剪裁法 3 n
+剪贴 20 n
+剪贴出 3 n
+剪贴板 3 n
+剪贴画 3 n
+剪贴簿 3 n
+剪起 3 v
+剪起来 3 v
+剪辑 77 n
+剪辑法 3 n
+剪辑版 3 n
+剪过 3 v
+剪过去 3 v
+剪过来 3 v
+剪除 76 v
+剪须和药 3 n
+剪齐 3 v
+剮 2 zg
+副 33113 b
+副业 112 n
+副业产品 3 n
+副业生产 3 n
+副主教 3 n
+副主编 3 n
+副乡长 3 n
+副井 3 n
+副产品 50 n
+副产物 3 n
+副代理人 3 n
+副价 3 n
+副会长 3 n
+副伤寒 11 n
+副体 3 n
+副作用 425 n
+副刊 144 n
+副券 3 n
+副区长 3 n
+副博士 7 n
+副厂长 3 n
+副厅 3 n
+副厅级 8 b
+副厅长 3 b
+副县级 6 b
+副县长 3 n
+副参谋长 3 n
+副反射器 3 n
+副反应 9 n
+副台长 3 n
+副司令 3 n
+副司令员 3 n
+副司长 3 n
+副品 2 n
+副团职 3 n
+副团长 3 n
+副基 3 n
+副处 29 n
+副处级 12 b
+副处长 3 n
+副外长 3 n
+副大队长 3 n
+副委员长 3 n
+副学士 3 n
+副官 341 n
+副官处长 3 n
+副审 3 n
+副寺 3 n
+副将 336 n
+副局级 7 b
+副局长 3 n
+副州长 3 n
+副庭长 3 n
+副性征 7 n
+副总 382 n
+副总司令 3 n
+副总干事 3 n
+副总经理 3 n
+副总编 3 n
+副总裁 3 n
+副所长 3 n
+副手 68 n
+副攻 5 n
+副攻手 2 n
+副政委 3 n
+副教授 263 n
+副景 3 n
+副本 83 n
+副染色体 3 n
+副染色质 3 n
+副标题 5 n
+副校长 3 n
+副核 3 n
+副根 3 n
+副案 3 n
+副检察长 3 n
+副歌 2 n
+副油箱 83 n
+副流感 8 n
+副炮 3 n
+副热带 3 n
+副牌 3 n
+副现象论 3 n
+副班长 3 n
+副球蛋白 3 n
+副理事长 3 n
+副瓣 3 n
+副甲状线 3 n
+副省级 3 n
+副省长 3 n
+副睾 3 n
+副矿长 3 n
+副研究员 3 n
+副社长 3 n
+副神经 3 n
+副科级 7 n
+副科长 3 n
+副程式 3 n
+副突变 3 n
+副粘病毒 3 n
+副线圈 4 n
+副组长 3 n
+副经理 3 n
+副署 3 n
+副翼 29 n
+副耳机 3 n
+副职 346 n
+副肾 3 n
+副董 3 n
+副董事长 3 n
+副蛋白 3 n
+副行长 3 n
+副议长 3 n
+副讯道 3 n
+副词 16 n
+副词片语 3 n
+副跨 3 n
+副轴 3 n
+副部级 35 n
+副部长 3 n
+副酪蛋白 3 n
+副镇长 3 n
+副队长 3 n
+副领队 3 n
+副题 2 n
+副食 36 n
+副食品 86 n
+副食店 9 n
+副馆长 3 n
+副驾驶 3 v
+副驾驶员 3 n
+副高级 5 b
+剰 363 zg
+割 1826 v
+割上 3 v
+割下 3 v
+割下去 3 v
+割下来 3 v
+割伤 25 v
+割作 3 v
+割入 3 v
+割出 3 v
+割刀 3 v
+割切 21 v
+割到 3 v
+割剥元元 3 v
+割剩 3 v
+割包 3 v
+割包皮 3 n
+割去 3 v
+割取 3 v
+割喉岛 3 n
+割回 3 v
+割回去 3 i
+割回来 3 i
+割地 139 v
+割地求和 3 i
+割地称臣 3 n
+割地赔款 3 n
+割好 3 v
+割完 3 v
+割尾巴 3 n
+割席 2 v
+割席分坐 3 i
+割席绝交 3 i
+割开 48 v
+割弃 3 v
+割得 3 v
+割恩断义 3 i
+割成 3 v
+割手 3 v
+割捆机 2 n
+割据 551 v
+割据一方 3 n
+割掉 3 v
+割接法 3 n
+割断 270 v
+割晒机 4 n
+割机 3 n
+割来 3 v
+割来割去 3 i
+割法 3 v
+割漆 3 n
+割爱 14 v
+割破 3 v
+割碎 3 v
+割礼 41 v
+割离 3 v
+割禾 3 n
+割稻 3 n
+割稻机 3 n
+割管器 3 n
+割线 4 n
+割绒 3 n
+割给 3 v
+割肉 27 n
+割肉补疮 3 i
+割肉饲虎 3 n
+割肚牵肠 3 i
+割股之心 3 n
+割股疗亲 3 n
+割胶 11 n
+割腕 3 v
+割腕自杀 3 v
+割臂之盟 3 i
+割臂盟公 3 n
+割舍 90 nrt
+割舍不下 3 v
+割草 46 v
+割草机 10 n
+割补阻碍 3 n
+割裂 224 v
+割襟之盟 3 i
+割让 180 v
+割让土地 3 n
+割走 3 v
+割起 3 v
+割起来 3 v
+割过 3 v
+割过去 3 v
+割过来 3 v
+割进 3 v
+割进去 3 v
+割进来 3 v
+割除 34 v
+割须弃袍 3 n
+割骨疗亲 3 n
+割麦 17 nrt
+剳 69 zg
+剴 2 zg
+剷 10 zg
+剸 19 zg
+剸繁决剧 3 n
+剸繁治剧 3 n
+剹 3 zg
+剺 7 zg
+剻 8 zg
+剼 88 zg
+剽 31 zg
+剽劫 3 v
+剽取 3 v
+剽悍 97 a
+剽掠 3 v
+剽窃 60 v
+剽窃者 3 n
+剽袭 3 v
+剿 749 v
+剿丝 3 v
+剿共 90 v
+剿匪 147 v
+剿匪抗战 3 nz
+剿匪时期 3 v
+剿平 3 v
+剿抚兼施 3 nr
+剿捕 3 v
+剿敌 3 v
+剿杀 35 v
+剿灭 217 v
+剿获 3 v
+剿袭 3 v
+剿除 45 v
+劁 21 v
+劂 2 x
+劄 23 zg
+劄记 3 v
+劅 143 zg
+劈 1492 v
+劈倒 3 d
+劈刀 3 n
+劈到 3 v
+劈刺 19 v
+劈刺训练 3 n
+劈削 3 v
+劈劈 3 n
+劈劈啪啪 17 o
+劈叉 5 v
+劈哩啪啦 3 z
+劈啪 21 o
+劈天盖地 3 i
+劈头 122 n
+劈头盖脑 9 i
+劈头盖脸 65 i
+劈山 14 n
+劈山凿水 3 i
+劈开 71 v
+劈形终端 3 i
+劈形膜 3 n
+劈成 3 v
+劈手 34 d
+劈挂拳 2 i
+劈掌 3 v
+劈杀 13 v
+劈材 3 n
+劈柴 63 n
+劈波斩浪 9 i
+劈胸 10 d
+劈脸 53 d
+劈荆斩棘 3 i
+劈裂 5 v
+劈里啪啦 7 o
+劈锥曲面 3 l
+劈面 3 d
+劈风斩浪 3 i
+劊 23 zg
+劋 8 zg
+劍 338 zg
+劎 9 zg
+劓 54 zg
+劖 7 zg
+劘 9 zg
+劙 16 zg
+劚 36 zg
+劚山觅玉 3 nr
+劚玉如泥 3 nr
+力 10777 n
+力不从心 189 i
+力不胜任 3 l
+力不能及 3 i
+力不能支 2 i
+力不自胜 3 i
+力主 220 n
+力争 657 nz
+力争上游 37 n
+力人 3 n
+力作 109 n
+力促 51 v
+力保 65 nz
+力倍功半 3 i
+力偶 29 n
+力偶矩 3 n
+力偶系 3 n
+力克 99 nz
+力克斯 3 nz
+力击 3 v
+力劝 43 v
+力加 13 v
+力劲 5 n
+力反馈 3 n
+力可拔山 3 i
+力回馈 3 n
+力图 695 n
+力图振作 3 i
+力图自强 3 i
+力场 26 n
+力均势敌 3 i
+力士 106 n
+力士乐 3 nz
+力壮身强 3 i
+力多边形 3 i
+力大无比 6 i
+力大无穷 21 i
+力天 3 n
+力夫特 3 nz
+力夺 2 v
+力孤势危 3 i
+力学 1619 n
+力学不倦 3 i
+力学性能 3 n
+力学笃行 3 n
+力学系统 3 n
+力守 3 n
+力小任重 3 n
+力尽 3 v
+力尽盘疲 3 i
+力尽神危 3 i
+力尽筋疲 3 i
+力屈计穷 3 i
+力巴 3 n
+力帆 130 nz
+力帆队 41 n
+力常数 3 n
+力度 1787 n
+力役 3 n
+力心 3 n
+力戒 17 n
+力战 127 nz
+力所不及 11 i
+力所能及 92 i
+力抓 10 v
+力护 17 v
+力拒 3 v
+力拔山兮 3 i
+力拼 8 v
+力拼众敌 3 i
+力持 3 v
+力挫 10 v
+力挫群雄 3 v
+力挽狂澜 51 i
+力排 3 v
+力排众议 47 i
+力推 50 v
+力攻 3 v
+力敌势均 3 i
+力敌千钧 3 i
+力斗 3 n
+力殚财竭 3 nr
+力比多 3 l
+力气 1463 n
+力气活 12 i
+力求 954 n
+力求上进 3 i
+力济九区 3 n
+力源 3 n
+力点 13 n
+力特 2 nz
+力率 3 n
+力疾 3 n
+力疾从公 3 i
+力矩 126 n
+力矩电机 3 nz
+力穷势孤 3 n
+力竭 3 n
+力竭声嘶 5 i
+力系 3 n
+力能 3 n
+力能扛鼎 3 v
+力臂 7 n
+力荐 23 v
+力薄才疏 3 i
+力螺旋 3 n
+力行 21 n
+力表 3 n
+力证 4 n
+力诺 5 nz
+力距 3 n
+力达 3 nz
+力迫关系 3 n
+力退 3 v
+力退众敌 3 i
+力透纸背 9 n
+力道 377 n
+力避 3 v
+力量 10069 n
+力量之源 3 n
+力量型 5 n
+力量对比 3 n
+力量强大 3 nz
+力量悬殊 3 l
+力量感 2 n
+力量薄弱 3 l
+力量雄厚 3 l
+力钱 3 n
+力阻 20 n
+力陈 3 n
+劝 3543 v
+劝世歌 3 nz
+劝业 16 v
+劝业场 4 n
+劝住 3 v
+劝农 3 nz
+劝出 3 v
+劝出去 3 v
+劝出来 3 v
+劝到 3 v
+劝劝 3 v
+劝勉 6 v
+劝募 6 v
+劝募者 3 n
+劝化 7 v
+劝君 3 v
+劝告 232 v
+劝善 3 v
+劝善惩恶 3 i
+劝善戒恶 3 i
+劝善黜恶 3 i
+劝回 3 v
+劝回去 3 i
+劝回来 3 i
+劝学 22 v
+劝学篇 11 n
+劝导 53 v
+劝开 3 v
+劝慰 183 v
+劝戒 19 vn
+劝捐 3 vn
+劝服 11 v
+劝架 30 v
+劝止 40 v
+劝百讽一 3 i
+劝解 184 v
+劝解者 3 n
+劝诫 34 v
+劝诱 25 v
+劝说 648 v
+劝说者 3 n
+劝谏 174 v
+劝谕 26 v
+劝起 3 v
+劝起来 3 v
+劝返 6 v
+劝进 42 v
+劝退 13 v
+劝酒 61 v
+劝阻 449 v
+劝阻无效 3 i
+劝降 191 v
+劝降书 16 n
+劝驾 3 v
+办 10314 v
+办不到 3 v
+办不完 3 v
+办不成 3 v
+办事 2314 n
+办事不牢 3 v
+办事员 46 n
+办事处 1159 n
+办事房 3 n
+办事效率 2 n
+办事机构 3 n
+办事组 20 n
+办伙 3 n
+办公 872 n
+办公会 35 n
+办公会议 41 n
+办公区 22 n
+办公厅 468 n
+办公台 3 n
+办公地 10 n
+办公处 23 n
+办公大楼 3 n
+办公室 4373 n
+办公建筑 3 n
+办公房 6 n
+办公时间 3 n
+办公枱 3 vn
+办公桌 199 n
+办公椅 3 n
+办公楼 296 n
+办公流程 3 n
+办公点 2 n
+办公用品 3 n
+办公用房 3 n
+办公网 3 n
+办公自动化 3 n
+办公设备 3 n
+办公费 2 n
+办刊 7 n
+办到 182 v
+办厂 33 n
+办发 6 v
+办后事 3 n
+办喜事 3 n
+办处 3 n
+办好 258 v
+办好事 3 n
+办妥 3 v
+办嫁妆 3 n
+办学 1127 n
+办学不力 3 n
+办学条件 3 n
+办学点 4 n
+办完 121 v
+办实事 3 n
+办得到 3 v
+办得好 3 v
+办得更好 3 n
+办成 183 v
+办手续 3 n
+办报 38 n
+办报人 4 n
+办校 17 n
+办案 136 n
+办案人 4 n
+办案文明 3 n
+办案费 3 n
+办毕 3 v
+办水 3 n
+办水热 3 n
+办法 10633 n
+办班 16 n
+办理 2142 n
+办理手续 3 n
+办税 10 n
+办稿 3 n
+办站 3 n
+办结 4 v
+办罪 3 vn
+办置 3 n
+办证 19 n
+办证费 3 n
+办货 8 n
+办起 100 v
+功 5641 n
+功一美二 3 i
+功不可没 66 i
+功业 203 n
+功亏 3 n
+功亏一篑 62 i
+功令 3 n
+功其一点 3 i
+功利 158 n
+功利主义 52 n
+功利主义者 6 n
+功利化 3 n
+功利性 20 n
+功到自然成 10 i
+功力 892 n
+功力者 3 n
+功劳 705 n
+功劳木 3 n
+功劳簿 2 n
+功勋 316 n
+功勋卓著 3 nr
+功勋彪炳 3 nr
+功参造化 3 n
+功名 248 n
+功名利禄 32 n
+功名富贵 39 i
+功在千秋 3 i
+功在当代 2 i
+功垒 3 n
+功大于过 3 l
+功夫 4168 n
+功夫不负有心人 23 i
+功夫片 21 n
+功夫片儿 3 nz
+功夫茶 6 n
+功夫过硬 3 i
+功学社 3 n
+功底 147 n
+功德 222 n
+功德圆满 22 i
+功德无量 32 i
+功德林 3 nz
+功德碑 7 n
+功心为止 3 i
+功成不居 3 l
+功成名就 46 i
+功成名遂 3 l
+功成引退 3 l
+功成弗居 3 l
+功成行满 3 i
+功成身退 35 l
+功成骨枯 3 i
+功放 2 l
+功放机 3 n
+功放板 3 n
+功放管 3 n
+功效 593 n
+功服 3 n
+功架 5 n
+功标青史 3 n
+功法 30 n
+功法修 2 l
+功率 923 n
+功率因数 32 n
+功率密度 13 n
+功率展宽 3 n
+功率放大 3 nz
+功率管 3 n
+功率表 7 n
+功率较 2 i
+功率达 3 n
+功用 173 n
+功盖天下 3 i
+功盖天地 3 i
+功绩 524 n
+功罪 12 n
+功考食淡 3 l
+功耗 78 n
+功能 8056 n
+功能丰富 3 nz
+功能主义 29 n
+功能主治 3 n
+功能位置 2 n
+功能分析 3 l
+功能化 2 n
+功能区 19 n
+功能印模 3 n
+功能叶 3 n
+功能块 3 n
+功能型 7 n
+功能域 3 n
+功能完善 2 l
+功能定位 3 n
+功能属性 2 n
+功能强大 3 i
+功能性 132 n
+功能扩充 3 n
+功能柱 3 n
+功能模块 3 n
+功能测试 2 n
+功能表 3 n
+功能设计 3 i
+功能选单 3 n
+功能键 3 n
+功能键号 3 n
+功能障碍 3 n
+功能集 2 n
+功能齐全 15 i
+功臣 715 n
+功若丘山 3 i
+功莫大焉 6 i
+功薄蝉翼 3 i
+功课 490 n
+功课表 3 n
+功败垂成 38 i
+功过 207 n
+功过相抵 3 n
+功遂身退 3 i
+功首罪魁 3 n
+功高 3 n
+功高不赏 3 i
+功高望重 3 i
+功高盖世 3 i
+功高盖主 3 n
+功高震主 3 n
+加 11537 v
+加一点 3 d
+加上 5605 v
+加上条纹 3 n
+加下 3 v
+加下去 3 v
+加丹加 16 ns
+加丹加省 2 ns
+加为 3 v
+加为好友 3 l
+加丽素 3 nr
+加之 817 c
+加九锡 7 nr
+加于 3 v
+加产 3 vn
+加亮 4 nr
+加人 3 nrt
+加人一等 3 l
+加仑 47 ns
+加仑量 3 nr
+加付 3 v
+加以 4286 v
+加以克服 3 nr
+加以分析 3 l
+加以控制 2 n
+加以改进 3 l
+加以解决 3 l
+加价 112 v
+加价热潮 3 n
+加价率 2 n
+加伊 5 nrt
+加伊纳 2 nr
+加伦将军 2 nr
+加伦河 3 ns
+加依尔 4 nr
+加修习 3 nr
+加倍 313 m
+加倍努力 3 nr
+加值 3 v
+加元 62 q
+加克利 4 nr
+加入 4855 v
+加入书 6 nr
+加入成员 3 l
+加入收藏 3 n
+加入者 8 n
+加入药物 3 n
+加入适量 2 n
+加入门派 3 n
+加兰 3 ns
+加兰德 2 nr
+加兹尼 6 nr
+加兹登 3 nr
+加内 3 ns
+加内特 13 ns
+加冕 118 v
+加冕典礼 3 nr
+加冕礼 7 nr
+加写 3 v
+加农 12 nr
+加农炮 95 nr
+加冠 8 nr
+加冬 4 v
+加冰 2 nr
+加减 3 v
+加减乘除 16 i
+加减器 3 n
+加减法 16 n
+加减法非 3 i
+加出 3 v
+加分 2 v
+加分法 3 n
+加刑 14 v
+加利 27 ns
+加利亚 9 ns
+加利亚尼 4 ns
+加利利 8 ns
+加利卜 2 nr
+加利奇 2 nr
+加利波 10 nr
+加利略 3 nr
+加利福 2 nr
+加利福尼 3 nr
+加利福尼亚 232 ns
+加利福尼亚大学 54 nt
+加利福尼亚大学洛杉矶分校 7 nt
+加利福尼亚州 176 ns
+加利福尼亚州大学 3 nt
+加利福尼亚州立大学 2 nt
+加利福尼亚湾 14 ns
+加利纳 3 ns
+加利西亚 24 ns
+加到 3 v
+加剂 3 n
+加前缀 3 nr
+加剧 843 v
+加剪 3 v
+加力 92 v
+加力燃烧 3 l
+加加 3 v
+加加减减 3 i
+加加在线 3 n
+加加林 19 ns
+加加酱油 3 n
+加劲 121 v
+加劲木 2 nr
+加劲梁 7 nr
+加勒 10 nrt
+加勒德 2 nr
+加勒斯 3 nr
+加勒比 174 nrt
+加勒比地区 45 ns
+加勒比海 294 ns
+加勒特 3 nr
+加区 3 ns
+加升 3 v
+加升汝 2 nr
+加印 14 v
+加卷 3 v
+加历练 2 nr
+加压 135 v
+加压力 2 n
+加压法 3 n
+加压素 3 n
+加压舱 3 n
+加压釜 3 n
+加厚 66 nr
+加厚型 3 nr
+加参劾 3 nr
+加参研 3 nr
+加发 3 v
+加号 29 n
+加合物 3 nt
+加合离子 3 n
+加吉鱼 2 nr
+加味 39 v
+加味水 8 v
+加哩粉 3 nz
+加喜特 6 nr
+加回 3 v
+加回去 3 l
+加回来 3 l
+加固 253 v
+加固作用 3 n
+加国 3 ns
+加图 34 v
+加在 3 v
+加在一起 3 i
+加场 3 n
+加场赛 3 v
+加垫 3 n
+加塔梅 2 nr
+加塞 3 v
+加塞儿 3 nr
+加填 3 v
+加增 3 v
+加多 15 ns
+加多少 3 m
+加够 3 v
+加大 2272 v
+加大力度 3 ns
+加太兰 3 nr
+加太基 3 nr
+加太尉 2 nr
+加奈隆 2 nr
+加套 3 v
+加奥 9 nrt
+加好 3 v
+加姆 2 nrt
+加守 3 v
+加完 3 v
+加官 43 v
+加官晋 8 nr
+加官晋爵 3 nr
+加官晋级 3 nr
+加官进爵 9 nr
+加官进禄 3 nr
+加定 3 v
+加害 327 v
+加害于 3 v
+加害人 6 n
+加害者 4 n
+加宽 57 v
+加宽函数 3 l
+加寄 3 v
+加密 145 ns
+加密井 3 nr
+加密传输 3 nr
+加密协议 3 nt
+加密器 3 nr
+加密技术 7 n
+加密狗 3 nr
+加密算法 3 n
+加密锁 3 nr
+加富尔 6 nr
+加对 3 v
+加封 81 v
+加少保 5 nr
+加尔利 2 ns
+加尔各答 112 ns
+加尔各达 2 nrt
+加尔巴 4 nr
+加尔文 33 nr
+加尔斯 7 nr
+加尔河 3 ns
+加尔登 2 nrt
+加尔维斯顿 4 nrt
+加尔西 3 ns
+加尔赫峰 5 nr
+加尔达湖 3 ns
+加尔铁 2 nr
+加尔默 3 nr
+加尔默罗 3 nrt
+加尧姆 2 nr
+加尼福尼 3 nr
+加尾 3 nrt
+加州 222 ns
+加州人 3 nr
+加州大学 3 nt
+加州大学洛杉矶分校 13 nt
+加州理工学院 16 nt
+加州红 3 nr
+加工 4877 vn
+加工业 175 n
+加工件 3 n
+加工余量 3 l
+加工出口 3 n
+加工区 49 nt
+加工厂 145 nt
+加工品 27 n
+加工场 3 n
+加工型 4 n
+加工工业 3 nt
+加工性 14 n
+加工成本 3 l
+加工机 135 n
+加工款 3 n
+加工水平 3 n
+加工点 5 n
+加工硬化 3 l
+加工者 3 n
+加工能力 3 n
+加工订货 3 n
+加工费 11 n
+加工资 3 n
+加工过程 2 l
+加工量 5 n
+加巴 6 ns
+加布 12 v
+加布罗沃 2 nrt
+加布里 8 nrt
+加布里埃尔 3 nrt
+加带 3 v
+加帽 3 v
+加帽位点 3 n
+加帽酶 3 l
+加幸欢 3 nr
+加座 3 v
+加廷根 5 nr
+加开 64 v
+加开班次 3 ns
+加异勒 6 nr
+加强 11080 v
+加强免疫 3 l
+加强力量 3 l
+加强团 2 n
+加强团结 3 l
+加强型 6 n
+加强指导 3 n
+加强排 3 nr
+加强版 3 n
+加强监督 3 nr
+加强筋 3 nr
+加强纪律 3 l
+加强营 9 nr
+加强连 7 nr
+加强锻炼 3 nz
+加强防卫 3 l
+加当 3 v
+加征 30 v
+加征练 5 nr
+加得 3 v
+加德 3 nrt
+加德士 3 nr
+加德满都 66 ns
+加德纳 11 nr
+加快 3480 v
+加快步伐 3 i
+加快脚步 3 i
+加快调整 3 l
+加快进度 3 l
+加快进程 3 l
+加快速度 3 n
+加急 42 vn
+加急电报 10 nz
+加性效应 3 l
+加总 8 nr
+加息 291 v
+加惠 33 vn
+加意 100 v
+加成 161 v
+加成反应 3 l
+加成收费 3 n
+加成法 2 nr
+加成聚合 3 nz
+加成计费 3 n
+加扎 3 v
+加打 3 v
+加把劲 14 v
+加护 2 v
+加报 3 v
+加拈 3 i
+加拉 39 nrt
+加拉加斯 68 ns
+加拉帕戈斯 17 nrt
+加拉拉 2 nrt
+加拉斯 9 ns
+加拉白垒峰 2 ns
+加拉茨 6 nrt
+加拨 3 v
+加拿 3 ns
+加拿大 2067 ns
+加拿大人 48 nz
+加拿大元 5 ns
+加拿大多伦多大学 7 nt
+加拿大政府 9 nt
+加拿大籍 3 nr
+加拿大约克大学 2 nt
+加拿大航空公司 11 nt
+加拿大队 4 nt
+加持 3 v
+加持良治 3 nr
+加挂 33 v
+加挂车厢 3 nz
+加捻 3 n
+加排 3 v
+加措 3 v
+加提 3 v
+加提成 3 nr
+加播 3 vn
+加收 28 v
+加放 2 v
+加放量 2 n
+加数 24 n
+加敷 3 v
+加料 18 v
+加料处理 3 l
+加料酒 3 n
+加斯 27 ns
+加斯佩 2 nr
+加斯帕 2 nr
+加斯普 2 nr
+加斯波 4 nr
+加斯特 2 nrt
+加斯科 2 nr
+加斯科因 3 nrt
+加施 2 v
+加时 38 c
+加时赛 55 nr
+加映 3 v
+加有 3 v
+加朗 5 ns
+加朗派 3 nr
+加权 79 v
+加权指数 3 n
+加来 29 v
+加来加去 3 v
+加杯 3 v
+加杯水 3 n
+加林 4 ns
+加林娜 4 nr
+加枝添叶 3 nr
+加查 12 vn
+加查县 3 ns
+加标签 3 n
+加样槽 3 v
+加格 2 nrt
+加格尔 2 nr
+加格达奇 5 nrt
+加格达齐 3 ns
+加框 3 n
+加档 3 v
+加榴 2 n
+加榴炮 26 n
+加殊锡 2 nr
+加比 4 v
+加气 6 v
+加气仪 3 nr
+加氢 32 v
+加氢精制 3 nz
+加氢裂化 3 n
+加氧酶 3 n
+加氯 3 nz
+加氯处理 3 n
+加水 126 v
+加水煮 3 nr
+加沙 64 ns
+加沙城 3 ns
+加油 417 v
+加油加醋 3 n
+加油卡 3 nr
+加油器 3 n
+加油战 3 nz
+加油打气 3 nt
+加油机 234 n
+加油泵 3 n
+加油添酱 39 i
+加油添醋 13 i
+加油站 111 nt
+加油车 7 n
+加油量 2 n
+加油阀 3 n
+加法 84 v
+加法器 30 nr
+加注 39 v
+加注机 3 n
+加泰罗 3 nr
+加泰罗尼亚 38 ns
+加泰罗尼亚地区 2 ns
+加泰罗尼亚语 4 nz
+加泰隆 9 nr
+加泼 3 v
+加洗 3 v
+加洗照片 3 n
+加洛尔 3 nr
+加洛斯 4 nr
+加洲 4 ns
+加洲旅馆 3 nt
+加派 3 v
+加浓炮 2 nr
+加涂 3 ns
+加涨 3 v
+加深 740 v
+加深了解 3 l
+加深处理 3 l
+加添 21 v
+加温 66 v
+加温器 11 nr
+加温法 3 nr
+加湿 14 v
+加湿器 10 n
+加湿机 3 n
+加满 3 v
+加演 4 v
+加点 68 n
+加点油 3 v
+加热 1005 v
+加热器 42 n
+加热式 3 n
+加热棒 3 n
+加热法 3 n
+加热炉 17 n
+加热盘管 3 n
+加热管 3 v
+加热输送 3 n
+加煎 3 v
+加特 18 nrt
+加特林 24 nr
+加特纳 3 nr
+加珠光 2 nr
+加班 686 v
+加班加点 102 n
+加班津贴 3 nz
+加班费 74 n
+加班车 3 ns
+加瓦 6 ns
+加生 3 v
+加略 2 v
+加登 5 v
+加的夫 23 ns
+加的斯 8 ns
+加盐 3 v
+加盐加醋 3 i
+加盖 128 v
+加盖楼顶 3 nr
+加盟 519 ns
+加盟商 3 n
+加盟店 51 nt
+加盟网 3 nz
+加盟者 4 n
+加盟费 8 n
+加码 33 n
+加砖添瓦 3 nr
+加硝 3 n
+加硝处理 3 n
+加碘 3 nz
+加碘处理 3 n
+加碘盐 15 n
+加禄语 8 nr
+加租 3 v
+加积作用 3 n
+加税 3 v
+加穿 3 v
+加等 3 v
+加筋土挡墙 3 l
+加筑 263 v
+加箍 3 nz
+加算 3 v
+加管柱 34 nr
+加米 24 q
+加粗 3 nr
+加精 3 v
+加精选 3 nr
+加糖 6 v
+加索尔 3 nr
+加紧 1040 v
+加紧努力 3 l
+加紧练习 3 nr
+加紧脚步 3 l
+加紧训练 3 nr
+加紫笋 2 nr
+加纳 255 v
+加纳人 2 nrt
+加纳共和国 4 ns
+加纳队 3 nt
+加线 3 n
+加练 3 vn
+加组 3 vn
+加给 3 v
+加缝 3 v
+加缪 16 nrt
+加罗 6 nrt
+加罗华 12 nr
+加罗尔 2 nr
+加罗斯 3 ns
+加罗林 24 ns
+加罗法 2 nr
+加罚 3 vn
+加美 2 ns
+加美兰 9 ns
+加考 3 v
+加考科目 3 n
+加考释 2 nr
+加聚反应 3 l
+加聚型 2 n
+加膝坠泉 3 i
+加膝坠渊 3 i
+加舒尔 3 nr
+加航 5 v
+加色 3 v
+加色剂 3 n
+加色合成 3 ns
+加色处理 3 l
+加色法 3 n
+加色混合 3 i
+加芬克 3 nr
+加莱义 2 nr
+加莱亚 2 ns
+加莱亚诺 2 nrt
+加莱奥 3 nr
+加莱拉 2 nr
+加菜 3 v
+加菜金 3 n
+加菲尔 4 nr
+加菲猫 3 nr
+加萨走廊 3 ns
+加蒂斯 16 nr
+加蒂诺 2 nr
+加蓬 232 ns
+加蓬共和国 8 ns
+加薪 381 nr
+加藤 50 nr
+加藤嘉明 3 nr
+加藤爱 3 nr
+加血 3 v
+加行 3 v
+加补 3 v
+加装 272 v
+加西亚 47 ns
+加解密 3 nr
+加计 4 v
+加订 3 v
+加训 3 vn
+加设 3 vn
+加词 3 v
+加试 107 vn
+加说 3 v
+加诸 3 v
+加诺夫 2 nr
+加课 3 v
+加调 3 v
+加贝斯 3 nr
+加贴 9 v
+加费莱 6 nr
+加贺 3 v
+加赛 17 vn
+加赛一场 3 n
+加赠 3 v
+加足 3 v
+加足马力 3 n
+加车 3 v
+加轮 3 n
+加载 77 v
+加载点 3 n
+加辅国 2 nr
+加达默尔 3 nrt
+加过 3 v
+加过来 3 v
+加进 131 v
+加进去 3 v
+加进来 3 nr
+加迪夫 6 nr
+加送 3 v
+加选 3 v
+加选法 3 n
+加通湖 4 ns
+加速 3517 v
+加速上扬 3 i
+加速卡 10 nr
+加速器 277 n
+加速室 3 n
+加速度 212 n
+加速度计 3 nz
+加速性 6 n
+加速泵 3 n
+加速电容 3 n
+加速运动 10 nz
+加造 3 v
+加那利 43 ns
+加酒 3 v
+加酸 3 n
+加酸处理 3 vn
+加醋 3 v
+加里 100 ns
+加里东 7 ns
+加里克 4 nrt
+加里宁 13 nr
+加里宁格勒 20 nrt
+加里宁格勒州 10 ns
+加里曼丹 32 ns
+加里曼丹岛 43 ns
+加里森 2 nr
+加里波第 18 nrt
+加里逊 2 nrt
+加重 1170 v
+加重比例 3 n
+加重计分 3 l
+加重负担 3 n
+加金紫 2 nr
+加钱 3 v
+加锁 5 v
+加锁王 3 nr
+加错 3 v
+加键笙 2 nr
+加长 112 v
+加长型 12 nr
+加长版 3 n
+加长车 3 n
+加队 3 n
+加附 3 v
+加雅涅 2 nr
+加雷特 2 nr
+加鞭 37 v
+加韦拉 3 nrt
+加顿 9 ns
+加餐 11 v
+加饭 9 v
+加饭酒 7 n
+加香机 3 nr
+加高 57 v
+加鲁法 3 nr
+加默兰 2 nrt
+加龙河 11 ns
+加龙骧 2 nr
+务 1342 d
+务使 56 v
+务农 174 v
+务农人家 3 n
+务器 2 n
+务头 3 v
+务实 614 d
+务实去等 3 n
+务实性 2 n
+务实精神 3 n
+务川 3 ns
+务工 101 v
+务工人员 55 n
+务工地 3 n
+务工者 6 n
+务工证 3 n
+务工青年 8 n
+务当 3 d
+务必 573 d
+务期 12 d
+务本 3 d
+务本力穑 3 n
+务本抑末 3 n
+务正 3 d
+务求 117 v
+务虚 21 v
+务虚会 36 n
+务要 3 d
+务请 3 v
+务须 179 d
+劢 19 g
+劣 349 a
+劣于 3 v
+劣势 363 n
+劣品 3 n
+劣地 3 n
+劣弧 2 n
+劣性 23 n
+劣株 3 n
+劣根 3 n
+劣根性 43 n
+劣种 55 b
+劣等 46 b
+劣等品 3 n
+劣等性 3 b
+劣等生 3 b
+劣等货 3 n
+劣绅 12 n
+劣者 3 n
+劣货 3 n
+劣质 148 n
+劣质品 2 n
+劣质奶粉 3 n
+劣迹 79 n
+劣迹昭彰 3 i
+劣迹昭着 3 i
+劣迹昭著 3 i
+劣酒 3 n
+劣马 25 n
+劦 2 zg
+劧 586 zg
+动 12509 v
+动一动 3 l
+动上 3 n
+动不动 348 l
+动不失时 3 l
+动中窾要 3 v
+动之以情 30 l
+动乱 455 n
+动乱不安 3 i
+动了动 3 l
+动了心 3 l
+动产 84 n
+动人 590 n
+动人心弦 17 i
+动人心肺 3 l
+动人心魄 25 i
+动令 3 n
+动作 3344 n
+动作光谱 3 n
+动作性 3 n
+动作感觉 3 n
+动作游戏 3 n
+动作片 12 n
+动作电位 3 n
+动作示范 3 n
+动作类 3 n
+动作迅速 4 nz
+动作速度 3 n
+动作键 3 n
+动兵 66 n
+动刀 3 n
+动刀动枪 3 l
+动刑 3 n
+动到 3 v
+动力 3367 n
+动力仪 3 n
+动力伞 6 n
+动力区 3 n
+动力厂 2 n
+动力学 624 n
+动力工程 3 n
+动力性 9 n
+动力机 34 n
+动力机械 3 n
+动力源 24 n
+动力火车 3 n
+动力电池 3 n
+动力站 3 n
+动力箱 2 n
+动力系统 2 l
+动力舱 31 n
+动力艇 3 n
+动力蛋白 3 l
+动力装置 11 n
+动力设备 3 n
+动力车 3 n
+动动 3 n
+动动手 3 n
+动动看 3 l
+动动脑 3 n
+动压 14 n
+动口 3 n
+动合子 3 n
+动名词 9 n
+动向 429 n
+动向不明 3 l
+动听 177 v
+动员 1657 n
+动员令 52 n
+动员会 29 n
+动员大会 3 n
+动员戡乱 3 vn
+动员群众 3 n
+动嘴 3 n
+动因 73 n
+动土 15 n
+动地 3 n
+动地惊天 3 i
+动如参商 3 l
+动如脱兔 13 i
+动容 111 n
+动宾 3 n
+动工 433 n
+动干戈 14 l
+动平衡 15 n
+动式 2 n
+动弹 747 n
+动弹不得 3 v
+动彻 3 v
+动心 169 n
+动心忍性 3 l
+动心忍情 3 i
+动心怵目 3 vn
+动心骇目 3 i
+动态 3053 n
+动态内存 3 n
+动态分析 7 l
+动态分配 3 l
+动态创建 2 n
+动态化 7 n
+动态变化 2 l
+动态图 3 n
+动态地图 3 n
+动态域名 3 n
+动态存储分配 3 n
+动态平衡 63 n
+动态性 9 n
+动态扭斜 3 l
+动态控制 3 n
+动态效果 2 n
+动态数据 2 n
+动态显示 4 n
+动态桌面 3 n
+动态漫游 3 n
+动态码率 3 n
+动态网 3 n
+动态链接库 8 l
+动态错误 3 n
+动态随机 2 n
+动怒 117 v
+动情 190 n
+动情周期 3 n
+动情处 3 n
+动情期 3 n
+动感 138 n
+动感单车 3 l
+动感地带 3 n
+动感情 27 n
+动感论坛 3 n
+动感超人 3 i
+动手 3082 n
+动手做 3 i
+动手动脚 55 n
+动手术 40 n
+动手脚 3 n
+动拆迁 2 v
+动摇 813 v
+动摇不定 21 v
+动摇不稳 3 v
+动摩擦力 3 n
+动撼 3 v
+动景运动 3 l
+动机 982 n
+动机训练 3 n
+动来动去 3 l
+动枪 3 n
+动检 6 j
+动植物 475 n
+动植物园 266 n
+动植物学 3 n
+动植物种 3 n
+动武 214 n
+动气 18 n
+动滑轮 10 n
+动滤失量 3 n
+动漫 139 n
+动漫人 3 n
+动漫卡通 3 n
+动漫堂 3 n
+动漫展 3 n
+动漫画 4 n
+动漫网 3 n
+动火 9 n
+动物 8230 n
+动物下体 3 n
+动物交往 3 i
+动物传布 3 n
+动物体 3 n
+动物保健 3 n
+动物力学 3 n
+动物化学 3 n
+动物化石 3 n
+动物区系 3 n
+动物医院 3 n
+动物园 346 n
+动物图片 3 n
+动物学 78 n
+动物学家 53 n
+动物志学 3 n
+动物性 75 n
+动物所 64 n
+动物模型 3 n
+动物毒素 3 n
+动物油 10 n
+动物界 150 n
+动物类 2 n
+动物纤维 5 l
+动物细胞 3 n
+动物群 160 n
+动物群落 3 l
+动物解剖 3 i
+动状词 3 n
+动理学 3 n
+动用 566 n
+动用储量 3 n
+动电学 3 n
+动画 262 n
+动画人物 3 n
+动画图 3 n
+动画图片 3 n
+动画城 3 n
+动画师 2 n
+动画影片 3 n
+动画教程 3 n
+动画文件 3 n
+动画片 132 n
+动画片儿 3 n
+动画版 3 n
+动画电影 3 n
+动画短片 3 n
+动画素材 3 n
+动画网 3 n
+动画设计 3 i
+动真格 3 n
+动真格的 25 l
+动眼神经 3 l
+动窝 3 n
+动笔 67 n
+动粗 3 n
+动系统 11 n
+动线地图 3 n
+动肝火 7 n
+动能 291 n
+动能定理 3 n
+动脉 458 n
+动脉夹 3 n
+动脉弓 3 l
+动脉炎 3 n
+动脉瘤 37 l
+动脉硬化 93 l
+动脉血 51 n
+动脑 19 n
+动脑子 3 n
+动脑筋 95 n
+动脚 3 n
+动若脱兔 2 i
+动荡 666 v
+动荡不安 51 i
+动荡不定 12 l
+动蛋白 3 l
+动蛹 3 n
+动觉 3 n
+动觉计 3 l
+动议 115 n
+动词 277 n
+动词化 3 n
+动词变化 3 l
+动质 3 n
+动质体 3 n
+动起 3 v
+动身 649 n
+动身前往 3 i
+动车 36 n
+动车组 25 n
+动轮 14 n
+动轮轴 3 n
+动辄 215 d
+动辄得咎 11 i
+动迁 21 v
+动迁户 3 n
+动迁房 3 n
+动过心 3 n
+动过手脚 3 l
+动配合 3 n
+动量 212 n
+动量定理 3 n
+动量矩 11 n
+动量表象 3 n
+动问 3 n
+动静 1379 n
+动静有常 3 i
+动静脉 3 n
+动魄惊心 3 i
+动鼠标 2 n
+助 2127 v
+助于 21 v
+助产 28 vn
+助产士 7 n
+助产婆 2 n
+助人 26 n
+助人下石 3 n
+助人为乐 19 i
+助人为快 3 i
+助人行为 3 n
+助兴 85 b
+助养 2 v
+助养金 3 n
+助凝剂 3 n
+助剂 41 n
+助剂厂 3 n
+助力 135 n
+助力器 3 n
+助力器械 3 n
+助力车 3 n
+助动词 6 n
+助动车 2 n
+助听 4 v
+助听器 29 n
+助困 8 b
+助天为虐 3 i
+助威 104 n
+助威团 3 n
+助威声 10 n
+助学 470 n
+助学金 115 n
+助工 2 n
+助您 3 l
+助我张目 3 i
+助战 121 v
+助手 685 n
+助推 87 vn
+助推器 70 n
+助攻 390 vn
+助攻王 3 n
+助教 149 n
+助散 3 v
+助桀为虐 3 i
+助检员 3 n
+助残 55 vn
+助残日 3 i
+助消化 36 n
+助滤剂 3 n
+助焊剂 3 n
+助燃 27 b
+助燃剂 3 n
+助理 1282 vn
+助理员 30 n
+助理级 3 b
+助益 6 n
+助研 3 vn
+助纣为虐 35 i
+助细胞 3 n
+助老 22 n
+助耕 3 v
+助色团 3 n
+助虐 3 v
+助记 3 n
+助记符 4 n
+助词 14 n
+助语 3 n
+助跑 35 v
+助辩 3 v
+助边输财 3 n
+助选 3 v
+助选员 3 n
+助选团 3 n
+助长 234 n
+助长声势 3 n
+助阵 51 n
+助飞器 3 n
+助饷 3 n
+努 460 ad
+努乔马 7 nrt
+努佩 3 nrt
+努儿海 3 ns
+努克 3 nrt
+努力 7757 ad
+努力下去 3 v
+努力争取 3 nr
+努力以赴 3 nr
+努力做到 3 v
+努力创造 3 nr
+努力奋斗 3 nr
+努力学习 3 nr
+努力完成 3 nr
+努力实现 3 nr
+努力提高 3 nrt
+努努嘴 3 ns
+努劲儿 3 nr
+努嘴 78 ns
+努嘴儿 3 nr
+努埃尔 4 nrt
+努尔 155 nrt
+努尔丁 3 nrt
+努尔哈 354 nrt
+努尔哈赤 3 nrt
+努库阿洛法 9 nrt
+努得 3 nrt
+努斯勒提 3 nrt
+努斯拉特 11 nrt
+努曼 3 nrt
+努比亚 35 ns
+努沙登加拉 16 nrt
+努瓦克肖 3 nr
+努瓦克肖特 15 ns
+努瓦迪布 9 nrt
+努目 3 ad
+努着 3 ad
+努着嘴 3 v
+努美阿 9 ns
+努起 3 v
+努起嘴 3 nr
+努起嘴来 3 v
+努里 10 nrt
+劫 1284 v
+劫争 3 vn
+劫匪 44 n
+劫去 3 t
+劫后 22 t
+劫后余生 22 l
+劫夺 56 v
+劫富济贫 25 i
+劫寨 3 n
+劫得 3 v
+劫持 132 v
+劫持人质 3 n
+劫持犯 3 i
+劫持者 3 n
+劫掠 192 v
+劫掠一空 7 i
+劫数 37 n
+劫数难逃 3 i
+劫机 18 n
+劫机犯 3 i
+劫机者 3 n
+劫杀 8 v
+劫波 4 n
+劫牢 3 v
+劫狱 31 v
+劫监 3 n
+劫盗 3 n
+劫簸 3 v
+劫船 3 n
+劫色 3 n
+劫获 3 v
+劫营 3 vn
+劫走 3 v
+劫车 3 n
+劫运 3 v
+劫道 3 v
+劫难 120 v
+劬 87 g
+劬劳 8 a
+劬劳之恩 3 v
+劬劳顾复 3 nr
+劭 24 g
+劯 143 zg
+励 140 nr
+励人 2 n
+励兵秣马 3 i
+励展博览集团 2 n
+励志 17 n
+励志书 3 nr
+励志社 2 nr
+励志竭精 3 i
+励忠义 3 nr
+励磁 57 n
+励磁机 3 n
+励磁电 2 n
+励粗图治 3 i
+励精图志 3 i
+励精图治 82 i
+励精图进 3 i
+励精更始 3 i
+励精求治 3 i
+励行 3 n
+劲 3175 n
+劲健 25 n
+劲儿 420 n
+劲力 547 n
+劲升 3 v
+劲吹 8 v
+劲地 3 n
+劲头 198 n
+劲头儿 12 n
+劲头十足 3 n
+劲射 66 v
+劲度系数 3 n
+劲敌 231 n
+劲旅 156 n
+劲松 9 n
+劲歌 2 n
+劲歌热舞 3 n
+劲直 3 v
+劲舞 4 n
+劲舞团 3 n
+劲草 4 n
+劲道 3 n
+劲酒 3 n
+劲雷 3 n
+劲风 243 n
+劲骨丰肌 3 n
+劳 1106 vn
+劳三军 14 nr
+劳乏 16 v
+劳亚古 7 nr
+劳人费马 3 n
+劳什子 70 l
+劳伤 5 vn
+劳伦斯 132 nr
+劳伦斯伯克利 2 nrt
+劳佛尔 2 nr
+劳作 285 vn
+劳作室 3 n
+劳作课 3 n
+劳保 30 vn
+劳保单 3 n
+劳保局 3 nt
+劳保用品 3 n
+劳保鞋 3 n
+劳修斯 17 nr
+劳倦 37 a
+劳做 3 v
+劳兄 6 n
+劳先生 2 nr
+劳克林 5 nr
+劳其筋骨 9 i
+劳军 45 n
+劳军动 2 l
+劳军团 3 nt
+劳农 3 n
+劳利斯 4 nr
+劳力 336 n
+劳力士 25 n
+劳力士表 3 n
+劳加族 3 n
+劳务 855 vn
+劳务中介 3 n
+劳务工 3 n
+劳务市场 17 n
+劳务所 3 nt
+劳务费 27 n
+劳务输出 3 n
+劳动 11598 vn
+劳动人事 3 l
+劳动人民文化宫 775 l
+劳动价值论 26 l
+劳动保护 3 n
+劳动保险 10 n
+劳动保障部 14 n
+劳动党 88 n
+劳动党中央 7 nt
+劳动力 3498 n
+劳动化 3 vn
+劳动卫生 3 n
+劳动厅 3 n
+劳动合同 3 l
+劳动合同制 9 l
+劳动和社会保障部 44 nt
+劳动和社会保障部劳动科学研究所 2 nt
+劳动和社会保障部职业技能鉴定中心 3 n
+劳动基准 3 n
+劳动定员 3 n
+劳动定额 3 n
+劳动密集 7 n
+劳动密集型 118 n
+劳动对象 53 l
+劳动就业 3 l
+劳动局 26 n
+劳动工具 3 l
+劳动工分 3 l
+劳动工资 3 l
+劳动布 3 n
+劳动强度 133 l
+劳动态度 3 n
+劳动成果 3 n
+劳动所 59 n
+劳动所得 3 l
+劳动手段 3 n
+劳动报 9 n
+劳动报酬 3 l
+劳动收入 3 n
+劳动改造 60 l
+劳动效率 3 n
+劳动教养 3 n
+劳动新闻 3 n
+劳动服 3 n
+劳动权 4 n
+劳动模范 163 l
+劳动法 66 n
+劳动生产率 357 n
+劳动竞赛 3 n
+劳动纪律 3 l
+劳动组合 3 l
+劳动者 1255 n
+劳动致富 3 l
+劳动节 57 n
+劳动英雄 3 n
+劳动营 4 vn
+劳动课 7 n
+劳动资料 250 l
+劳动部 41 n
+劳动部门 63 n
+劳动量 194 n
+劳动锻炼 3 l
+劳动防护 3 n
+劳动阶级 3 l
+劳勃许 2 nr
+劳厄湖 2 nr
+劳发 3 vn
+劳合 6 vn
+劳合社 3 nt
+劳命伤财 3 n
+劳图斯 8 nr
+劳埃德 32 nr
+劳埃德银行 2 nt
+劳培科 3 nr
+劳基法 3 n
+劳塔罗 9 nr
+劳复 10 vn
+劳大哥 2 nr
+劳太后 3 nr
+劳太监 3 nr
+劳夫林 2 nr
+劳委会 3 nt
+劳宫 3 n
+劳宸忧 2 nr
+劳少得 2 nr
+劳山派 2 nr
+劳工 317 vn
+劳工保险 3 n
+劳工处 2 l
+劳工局 3 nt
+劳工市场 3 n
+劳工法 20 n
+劳工神圣 3 n
+劳工证 3 n
+劳工部 4 nt
+劳工阶层 3 l
+劳工阶级 3 l
+劳师 3 n
+劳师动众 8 n
+劳师无 6 nr
+劳师父 3 nr
+劳师糜饷 3 v
+劳师袭 2 nr
+劳师袭远 3 nr
+劳师远 3 nr
+劳形 3 n
+劳形苦心 3 l
+劳役 363 n
+劳役地租 18 l
+劳律 2 n
+劳得诺 2 nr
+劳德曼 3 nr
+劳德诺 229 nr
+劳心 46 n
+劳心焦思 3 l
+劳心者治 3 l
+劳心苦思 3 l
+劳思 3 n
+劳思逸淫 3 i
+劳恩凯 2 nr
+劳恩堡 5 nr
+劳恩河 2 nr
+劳损 50 vn
+劳支 3 n
+劳改 107 vn
+劳改犯 21 l
+劳改营 3 nr
+劳改队 8 l
+劳教 96 nz
+劳教所 3 nt
+劳斯特 2 nr
+劳斯老 16 nr
+劳斯莱斯 97 nrt
+劳方 3 n
+劳旋 3 vn
+劳有所得 2 l
+劳服 3 n
+劳林斯 2 nr
+劳格 5 n
+劳模 180 n
+劳步 3 vn
+劳民 2 n
+劳民伤财 41 n
+劳民动众 3 n
+劳民费财 3 l
+劳烦 17 a
+劳燕分飞 10 nr
+劳特尔 2 nr
+劳瑞恩 3 nr
+劳甚子 6 l
+劳申伯 2 nr
+劳瘁 9 a
+劳碌 64 a
+劳碌命 3 i
+劳神 62 n
+劳福德 2 nr
+劳秀斯 10 nr
+劳科所 3 nt
+劳科院 3 nt
+劳筋苦骨 3 i
+劳累 381 vn
+劳累过度 3 l
+劳经系 3 n
+劳绩 13 n
+劳维尔 2 nr
+劳考晋 3 nr
+劳而无功 26 i
+劳而无获 3 i
+劳联 2 vn
+劳臣 4 n
+劳苦 157 a
+劳苦功高 23 i
+劳苦大众 3 i
+劳费 3 vn
+劳费尔 2 nr
+劳资 134 vn
+劳资关系 3 l
+劳资双方 3 l
+劳资政 4 n
+劳资科 3 n
+劳资纠纷 3 z
+劳身焦思 3 l
+劳逊 3 nr
+劳通 2 vn
+劳逸 4 nr
+劳逸不均 3 nr
+劳逸病 2 nr
+劳逸结合 56 i
+劳部发 3 l
+劳里 7 n
+劳金 2 n
+劳长剑 2 nr
+劳雷尔 2 nr
+劳顿 56 nr
+劳驾 40 nr
+劵 2 zg
+劸 2 zg
+効 195 zg
+劻 407 zg
+劼 8 zg
+劾 199 g
+势 5320 n
+势不两存 3 i
+势不两立 76 i
+势不可当 32 i
+势不可挡 48 i
+势不可遏 3 i
+势不并立 3 i
+势之所趋 3 i
+势倾天下 3 i
+势倾朝野 3 i
+势函数 3 n
+势利 82 n
+势利之交 3 i
+势利小人 5 n
+势利眼 12 n
+势力 4786 n
+势力值 3 n
+势力范围 3 n
+势单力孤 7 l
+势单力薄 18 l
+势合形离 3 i
+势在必得 15 i
+势在必然 3 i
+势在必行 83 i
+势在必进 2 i
+势均力敌 91 i
+势垒 36 n
+势垒穿透 3 i
+势垒高度 3 n
+势大力沉 8 i
+势头 963 n
+势如冰炭 3 i
+势如劈竹 3 ns
+势如水火 3 i
+势如破竹 91 i
+势如累卵 3 i
+势孤力薄 3 i
+势必 860 d
+势必会 3 n
+势必牵动 3 i
+势必能 3 n
+势态 20 n
+势成骑虎 4 i
+势所必然 13 i
+势所必至 2 i
+势所难免 3 i
+势派 25 n
+势焰 4 n
+势焰熏天 3 z
+势电解质 3 n
+势穷力屈 3 i
+势穷力敌 3 i
+势穷力竭 3 i
+势穷力蹙 3 i
+势能 90 n
+势至 3 d
+势若脱兔 3 i
+势阱 3 n
+势高益危 3 i
+勃 420 nz
+勃兰特 18 nz
+勃兰登堡 41 ns
+勃兰登堡州 2 ns
+勃兰登堡门 35 ns
+勃兴 33 nz
+勃列日涅 3 nrt
+勃利 4 nz
+勃利县 3 ns
+勃利市 3 ns
+勃勃 109 nz
+勃勃生机 52 i
+勃勃的 19 z
+勃发 78 nz
+勃发生机 3 nz
+勃固 12 nz
+勃拉姆斯 25 nrt
+勃朗 9 ns
+勃朗宁 14 nr
+勃朗峰 27 nr
+勃朗特 23 nrt
+勃然 3 z
+勃然变色 3 l
+勃然大怒 150 i
+勃然失色 3 i
+勃然奋励 3 l
+勃然而起 3 i
+勃立奇 3 nr
+勃艮第 77 nz
+勃谿 3 z
+勃起 103 v
+勃郎宁 7 nr
+勃长期 3 nr
+勃雷 5 nrt
+勅 4 zg
+勇 1873 n
+勇为 23 v
+勇于 366 v
+勇于创新 3 l
+勇于开拓 3 i
+勇于批评 3 l
+勇于探索 3 i
+勇于认错 3 i
+勇于进取 3 l
+勇健 3 a
+勇冠三军 5 n
+勇决 3 v
+勇力 22 n
+勇动多怨 3 i
+勇勇敢敢 3 v
+勇士 613 n
+勇士队 3 n
+勇夫 6 n
+勇夫悍卒 3 v
+勇夺 42 v
+勇往 3 v
+勇往直前 70 i
+勇悍 40 a
+勇挑 3 a
+勇挑重担 22 l
+勇探实录 3 n
+勇攀 3 v
+勇攀高峰 3 l
+勇救 3 v
+勇敢 1436 a
+勇敢善战 3 i
+勇敢无畏 3 i
+勇敢沉着 3 l
+勇敢的人 3 l
+勇敢者 11 n
+勇斗 34 n
+勇斗歹徒 3 i
+勇武 50 a
+勇毅 3 a
+勇气 1537 n
+勇气十足 3 i
+勇气可嘉 3 n
+勇气号 3 n
+勇猛 412 a
+勇猛善战 3 i
+勇猛果敢 3 l
+勇猛直前 3 i
+勇猛精进 12 i
+勇猛过人 3 i
+勇男蠢妇 3 i
+勇者 26 n
+勇者不惧 3 i
+勇者胜 3 i
+勇而无谋 3 i
+勇退 3 v
+勇锐 3 a
+勇闯 6 v
+勉 138 zg
+勉为 3 v
+勉为其难 83 i
+勉力 100 v
+勉励 136 v
+勉勉强强 17 z
+勉县 2 ns
+勉强 1486 v
+勋 531 n
+勋业 38 n
+勋伯格 6 n
+勋努达美 3 n
+勋劳 4 n
+勋爵 79 n
+勋章 1004 n
+勋绩 49 n
+勋衔 3 n
+勌 4 zg
+勐 53 ns
+勐仑 2 ns
+勐海 4 ns
+勐海县 4 ns
+勐腊 10 ns
+勐腊县 8 ns
+勒 1818 v
+勒乌 4 nrt
+勒令 133 n
+勒住 3 v
+勒克 4 nrt
+勒克斯 8 nrt
+勒克瑙 14 nrt
+勒克莱尔 19 nrt
+勒兵 3 n
+勒内 12 nrt
+勒努瓦 3 nrt
+勒勒车 7 ns
+勒南 8 ns
+勒卡 2 nrt
+勒古 2 ns
+勒夫波 3 nrt
+勒头 3 v
+勒姆 8 nrt
+勒孔特 2 nrt
+勒尔 5 nrt
+勒巴 5 nrt
+勒布 2 nrt
+勒布伦 2 nrt
+勒布朗 48 nrt
+勒庞 2 n
+勒弗库森 2 nrt
+勒抑 3 v
+勒拿河 41 ns
+勒斯 42 nrt
+勒曼 3 nrt
+勒格 2 nrt
+勒梅尔 3 nrt
+勒死 47 v
+勒沃库森 20 nrt
+勒法夫瑞 3 nrt
+勒派 3 n
+勒热夫 2 nrt
+勒石 8 n
+勒碑 3 n
+勒穆瓦纳 2 nrt
+勒索 184 nrt
+勒索案 3 n
+勒索钱财 3 n
+勒紧 50 v
+勒紧裤带 3 n
+勒纳 5 nrt
+勒绳 3 n
+勒腰 3 v
+勒芒 2 n
+勒诈 3 v
+勒诺 8 nrt
+勒贝尔 7 nrt
+勒贝格 12 nrt
+勒达 4 nrt
+勒逼 3 v
+勒那海 3 ns
+勒邦 3 ns
+勒韦尔 2 nrt
+勒马 242 nrt
+勔 20 zg
+勖 43 g
+勗 37 zg
+勗勉 3 v
+勘 460 vn
+勘乱 3 v
+勘定 39 v
+勘察 194 v
+勘察者 3 n
+勘察队 6 n
+勘探 533 vn
+勘探员 3 n
+勘探局 2 n
+勘探工程 3 n
+勘探成本 3 n
+勘探者 14 n
+勘探者号 2 n
+勘探队 7 n
+勘探队员 3 n
+勘查 161 vn
+勘查业 3 n
+勘校 3 n
+勘正 3 v
+勘测 203 vn
+勘测员 3 n
+勘测局 3 n
+勘测队 3 n
+勘灾 3 vn
+勘界 23 n
+勘订 3 v
+勘误 2 vn
+勘误表 3 v
+勘验 26 vn
+勝 2 zg
+募 386 vg
+募兵 50 v
+募兵制 29 v
+募化 13 v
+募得 3 v
+募捐 322 v
+募捐箱 13 n
+募款 262 v
+募用 3 v
+募穴 3 v
+募股 7 v
+募集 487 v
+勠 3 zg
+勣 31 zg
+勤 676 a
+勤于 84 v
+勤于思考 3 l
+勤仆 3 n
+勤以补拙 3 i
+勤俭 72 a
+勤俭为服 3 l
+勤俭务实 3 l
+勤俭建国 14 l
+勤俭持家 14 l
+勤俭朴实 3 i
+勤俭节约 36 l
+勤前教育 3 l
+勤力 3 n
+勤加练习 3 n
+勤务 298 n
+勤务兵 22 n
+勤务员 30 n
+勤务训练 3 n
+勤劳 706 a
+勤劳努力 3 l
+勤劳勇敢 3 l
+勤劳者 6 n
+勤劳致富 3 l
+勤勉 79 ad
+勤勤恳恳 47 z
+勤奋 377 a
+勤奋努力 3 l
+勤奋好学 3 l
+勤奋学习 3 n
+勤奋工作 3 l
+勤学 26 n
+勤学好问 3 l
+勤学苦练 16 i
+勤工 7 n
+勤工俭学 78 l
+勤工助学 72 l
+勤快 84 a
+勤恳 29 a
+勤政 55 n
+勤政为民 3 l
+勤政廉政 6 l
+勤政殿 36 n
+勤有功嬉 3 i
+勤朴 3 a
+勤杂 2 a
+勤杂人员 4 n
+勤杂工 13 n
+勤洗勤换 3 l
+勤洗手 3 n
+勤王 148 n
+勤益工专 3 l
+勤练 3 a
+勤耕 3 v
+勤能补拙 3 i
+勤苦 17 a
+勤读 3 v
+勤谨 40 a
+勨 49 zg
+勩 292 zg
+勪 783 zg
+勫 1631 zg
+勬 1297 zg
+勭 714 zg
+勮 797 zg
+勯 757 zg
+勰 52 g
+勶 437 zg
+勺 342 q
+勺儿 11 n
+勺园 5 n
+勺子 95 n
+勺水一脔 3 n
+勺状软骨 3 n
+勻 2 zg
+勾 1700 v
+勾一勾 2 nr
+勾三搭四 3 i
+勾上 3 v
+勾下 3 v
+勾云形 2 nr
+勾人 3 nrt
+勾住 2 v
+勾佬 3 n
+勾兑 22 v
+勾出 3 v
+勾划 3 n
+勾勒 160 nrt
+勾勾 3 nr
+勾勾搭搭 24 z
+勾去 3 v
+勾取 3 v
+勾号 3 n
+勾娌充 2 nr
+勾子 7 n
+勾引 181 v
+勾当 547 v
+勾御前 2 nr
+勾心斗角 64 i
+勾拳 4 n
+勾挂 3 v
+勾掉 8 v
+勾描 3 v
+勾搭 67 v
+勾方加 4 nr
+勾来勾去 3 i
+勾栏 50 n
+勾法 2 n
+勾消 3 v
+勾球 3 n
+勾画 99 n
+勾画出 3 i
+勾留 10 v
+勾线 4 n
+勾结 779 v
+勾绘 3 v
+勾缝 2 n
+勾股义 2 n
+勾股定理 60 n
+勾股形 3 n
+勾肩搭背 8 i
+勾脸 3 v
+勾芡 2 v
+勾花网 3 n
+勾蛋子 3 n
+勾解佥 3 nr
+勾走 3 v
+勾起 3 v
+勾践 144 v
+勾践乃 2 nr
+勾践乘 3 nr
+勾践兵 2 nr
+勾践剑 7 nr
+勾践卑 3 nr
+勾践奇 2 nr
+勾过 3 v
+勾过去 3 v
+勾过来 3 v
+勾连 18 v
+勾选框 2 n
+勾通 15 nr
+勾针 3 n
+勾销 15 v
+勾阑 3 nr
+勾除 3 v
+勾魂 14 n
+勾魂引 3 nr
+勾魂战地 3 i
+勾魂摄魄 7 i
+勿 1003 d
+勿下 3 n
+勿以恶小而为之 3 i
+勿动 3 n
+勿吉 22 n
+勿失良机 3 l
+勿如 3 n
+勿宁说 3 l
+勿庸置疑 9 i
+勿庸赘言 3 l
+勿忘 3 l
+勿忘我 4 i
+勿忘草 4 n
+勿念 3 n
+勿怠勿忘 3 l
+勿扰 3 l
+勿施于人 28 i
+勿枉勿纵 3 i
+勿药 3 n
+勿药有喜 3 l
+勿要 3 n
+勿言 3 n
+勿近 3 n
+勿进 3 n
+勿需 3 n
+匀 423 v
+匀停 3 d
+匀兑 3 l
+匀净 25 a
+匀出 3 a
+匀出来 3 l
+匀匀 4 a
+匀实 3 a
+匀摊 3 l
+匀整 9 a
+匀染 3 b
+匀浆 2 n
+匀溜 3 a
+匀称 198 a
+匀红点翠 3 z
+匀细 6 a
+匀脂抹粉 3 vn
+匀脸 3 d
+匀调 3 a
+匀速 54 d
+匀速圆周 3 n
+匀速直线 3 l
+匀速转动 3 l
+匀速运动 15 l
+匀齐 6 a
+匂 3 zg
+包 5289 v
+包一机 2 nr
+包三哥 6 nr
+包三爷 3 nr
+包上 3 v
+包上去 3 v
+包上来 3 v
+包上牌 3 v
+包下 3 v
+包下去 3 v
+包下来 3 v
+包不同 3 v
+包世臣 7 nr
+包业 2 n
+包严 2 v
+包举 3 v
+包乘 3 v
+包乘制 3 nr
+包乘组 3 n
+包书皮 3 n
+包书皮纸 3 n
+包买商 24 n
+包二奶 32 nr
+包交换 2 v
+包产 42 v
+包产到户 147 l
+包仁丹 2 nr
+包伙 2 v
+包伤 3 v
+包佃 3 v
+包住 67 v
+包体 5 n
+包佶充 2 nr
+包修 4 v
+包兄 11 n
+包兆龙 2 nr
+包公 31 nr
+包公祠 4 nr
+包兰线 2 nz
+包兰铁路 24 nz
+包养 24 v
+包养二 2 nr
+包准 3 v
+包办 164 v
+包办代替 11 n
+包办婚姻 3 n
+包勒德 6 nr
+包勒斯 4 nr
+包包 3 v
+包医 3 v
+包协 4 v
+包卷 6 v
+包厢 183 n
+包去 3 v
+包叙定 3 nr
+包吃 9 v
+包吃包住 3 i
+包吃包穿 3 i
+包合 3 v
+包合作用 3 n
+包合物 6 n
+包君满意 3 nr
+包含 2938 v
+包商 3 v
+包囊 10 n
+包围 1607 v
+包围住 3 nr
+包围圈 121 n
+包围网 3 n
+包围起来 3 l
+包圆儿 3 nr
+包在 3 v
+包在剑 2 nr
+包场 10 n
+包埋 3 v
+包埋剂 3 n
+包塞 2 v
+包夜 3 v
+包天 3 v
+包天剑 238 nr
+包天心 26 nr
+包天笑 2 nr
+包头 199 v
+包头市 45 ns
+包头钢铁公司 23 nt
+包夹 3 n
+包好 3 v
+包子 162 n
+包子铺 8 n
+包子馅 3 n
+包孕 3 v
+包孝肃 3 nr
+包学忠 15 nr
+包容 152 v
+包容心 3 n
+包容性 22 n
+包容百川 3 nr
+包封 7 v
+包小包 11 nr
+包小松 3 nr
+包小袋 4 nr
+包尔汉 6 nr
+包尔沙 2 nr
+包层 9 n
+包工 15 v
+包工包料 3 n
+包工头 69 n
+包工队 7 n
+包巾 2 n
+包干 71 v
+包干儿 3 nr
+包干到户 3 l
+包干制 4 n
+包干区 3 ns
+包干性 3 n
+包干负责 3 l
+包庇 125 v
+包庇罪 3 nz
+包式终端 3 l
+包心菜 2 n
+包惜弱 159 nr
+包惠僧 21 nr
+包成 2 v
+包户 9 n
+包房 41 n
+包扎 316 v
+包扎法 3 nr
+包扎着 3 i
+包打 3 v
+包打听 4 v
+包打天下 12 i
+包扶 7 v
+包抄 112 v
+包括 24052 v
+包拯 52 nr
+包拯集 2 nr
+包换 5 v
+包探 3 v
+包揽 177 v
+包揽生意 3 l
+包揽词讼 4 l
+包摄 3 v
+包放 4 v
+包教 3 nz
+包教包会 3 n
+包文正 2 nr
+包文翊 5 nr
+包文青 3 nr
+包方田 2 nr
+包月 68 n
+包月仅 3 nr
+包月制 5 v
+包月卡 3 nr
+包月费 9 v
+包机 420 n
+包机去 3 v
+包机来 3 l
+包梏 3 n
+包氏娘子 2 nr
+包永镭 5 nr
+包河 5 ns
+包河区 3 ns
+包治百病 4 n
+包法利 15 nr
+包润石 16 nr
+包涵 84 v
+包点 2 n
+包牌价 3 n
+包特氏 3 nr
+包特菌属 3 n
+包玉刚 13 nr
+包玉英 2 nr
+包皮 61 n
+包皮炎 2 nr
+包着 3 v
+包石栎 3 nr
+包票 3 n
+包租 4 v
+包租公 3 n
+包租婆 3 n
+包税制 5 n
+包立 12 v
+包管 40 v
+包箱 3 n
+包米 4 n
+包紧 3 v
+包红巾 128 nr
+包给 3 v
+包络 11 v
+包络检波 3 n
+包络线 3 n
+包缝机 2 n
+包罗 27 nr
+包罗万有 7 i
+包罗万象 47 nr
+包罗宏 2 nr
+包羞忍耻 3 i
+包羞忍辱 3 i
+包老三 2 nr
+包而不办 3 i
+包背装 2 n
+包脚 3 v
+包膜 48 n
+包膜抗原 3 n
+包膜突起 3 i
+包膜蛋白 3 n
+包船 5 v
+包船去 3 i
+包船来 3 nr
+包茎 13 n
+包菜 3 n
+包藏 49 v
+包藏奸心 3 n
+包藏祸心 35 i
+包虫病 2 n
+包衣 70 v
+包袋 5 n
+包袋厂 3 n
+包被 43 n
+包被抗原 3 nr
+包袱 947 n
+包袱井 3 n
+包袱底儿 3 n
+包装 910 v
+包装业 3 n
+包装厂 3 n
+包装品 3 n
+包装容器 2 l
+包装工 5 n
+包装工人 3 n
+包装带 3 n
+包装机 3 n
+包装材料 3 n
+包装桶 3 n
+包装法 3 n
+包装物 9 l
+包装率 3 n
+包装用 6 n
+包装盒 22 n
+包装箱 10 n
+包装纸 18 n
+包装网 3 n
+包装者 3 n
+包装袋 27 n
+包装费 3 n
+包裹 915 v
+包裹单 2 nr
+包覆 11 v
+包谷 120 n
+包豪斯 19 nr
+包购包销 3 n
+包赔 5 v
+包走 3 v
+包起 3 v
+包起帆 6 nr
+包身 2 v
+包身契 3 nr
+包身工 20 n
+包车 52 v
+包车去 3 i
+包车来 3 nr
+包车费 3 n
+包转发 3 v
+包运 2 v
+包退 3 v
+包道乙 8 nr
+包道格 6 nr
+包里 2 nr
+包金 273 n
+包钢 29 n
+包银 273 nr
+包销 67 v
+包销商 3 n
+包长老 3 nr
+包门套 3 nz
+包间 20 n
+包青天 10 nr
+包风 3 v
+包饭 3 v
+包馅 2 v
+包鸽松 4 nr
+包龙图 14 nr
+匆 114 z
+匆促 24 a
+匆促之间 3 v
+匆促间 3 vn
+匆匆 1574 z
+匆匆一看 3 v
+匆匆忙忙 133 z
+匆卒 3 a
+匆忙 439 z
+匆忙之间 3 vn
+匆猝 3 z
+匆遽 3 a
+匈 312 ns
+匈奴 1536 n
+匈奴血 3 n
+匈牙利 882 ns
+匈牙利人 40 n
+匈牙利共和国 23 ns
+匈牙利大 3 ns
+匈牙利政府 8 nt
+匈牙利语 24 nz
+匈牙利队 2 n
+匋 12 zg
+匍 45 v
+匍伏 3 v
+匍匐 144 v
+匍匐之救 3 n
+匍匐前进 3 n
+匍匐茎 16 n
+匍匐运动 3 n
+匏 41 x
+匏瓜空悬 3 nr
+匐 39 x
+匐伏 3 n
+匕 113 n
+匕首 1041 n
+匕鬯不惊 3 v
+匕鬯无惊 3 nr
+化 7067 n
+化丁基 6 nr
+化万豪 11 nr
+化为 664 v
+化为乌有 73 i
+化为己有 3 i
+化为泡影 33 i
+化为灰烬 50 l
+化二清 2 nr
+化仙 4 n
+化作 196 n
+化做 22 v
+化儿 10 n
+化儿伙 2 n
+化元素 2 n
+化入 23 n
+化公为私 14 l
+化军 256 n
+化冻 4 n
+化净 2 v
+化出 3 v
+化分 3 n
+化剂 5 n
+化剑 2 n
+化劲 2 n
+化募 3 v
+化及豚鱼 3 v
+化友 3 n
+化发展 14 l
+化合 142 v
+化合价 23 n
+化合反应 3 l
+化合态 3 n
+化合性 3 n
+化合物 1680 n
+化合量 3 n
+化名 199 n
+化器 3 n
+化圆 12 n
+化堂 2 n
+化境 29 n
+化处 3 n
+化外 3 l
+化外之民 3 l
+化大为 2 nr
+化妆 286 n
+化妆包 5 n
+化妆台 3 n
+化妆品 458 n
+化妆室 8 n
+化妆师 16 n
+化妆柜 3 n
+化妆棉 3 n
+化妆水 13 n
+化妆盒 2 n
+化妆箱 3 n
+化妆舞会 3 n
+化妆袋 3 n
+化妆镜 3 n
+化妆间 17 n
+化妙 2 n
+化婆 2 n
+化子 128 n
+化子声 2 n
+化子招 2 nr
+化子群 2 nr
+化子见 2 nr
+化学 5457 n
+化学交联 3 nt
+化学作用 3 l
+化学修饰 3 n
+化学偶联 3 n
+化学元素 257 n
+化学全同 3 l
+化学农药 3 n
+化学分子 3 n
+化学分析 47 l
+化学剂 10 n
+化学剥蚀 3 i
+化学势 3 n
+化学化 8 n
+化学原料 3 n
+化学反应 345 l
+化学发光 3 n
+化学变化 71 l
+化学合成 3 l
+化学名 3 n
+化学品 108 n
+化学地雷 3 n
+化学堵水 3 n
+化学奖 3 n
+化学家 359 n
+化学工业 346 n
+化学工厂 3 n
+化学工程 3 l
+化学平衡 26 nr
+化学建材 3 n
+化学式 71 n
+化学当量 3 l
+化学性 49 n
+化学性质 194 l
+化学感受 3 l
+化学感觉 3 n
+化学成分 2 l
+化学战 31 n
+化学战争 3 nz
+化学战剂 3 n
+化学抛光 3 z
+化学教案 3 n
+化学方程 3 l
+化学机理 3 n
+化学材料 3 n
+化学武器 139 l
+化学治疗 3 n
+化学法 7 n
+化学活化 3 l
+化学清蜡 3 l
+化学溶蚀 3 n
+化学物质 8 n
+化学电池 14 n
+化学界 7 n
+化学矿 3 n
+化学科 7 n
+化学系 98 n
+化学纤维 85 l
+化学纯 3 nr
+化学网 3 n
+化学肥料 18 l
+化学能 76 n
+化学脱盐 3 n
+化学药品 61 n
+化学试剂 3 n
+化学试题 3 n
+化学诱变 3 nz
+化学课 3 n
+化学课件 3 n
+化学迁移 3 n
+化学部 3 n
+化学键 96 n
+化学镀 3 n
+化学防治 3 n
+化学降解 3 l
+化学题 3 n
+化安山 3 nr
+化害为利 3 l
+化州 10 n
+化州县 3 ns
+化州市 7 ns
+化工 4022 n
+化工业 23 n
+化工产品 3 n
+化工企业 3 n
+化工公司 3 n
+化工厂 121 n
+化工原料 2 n
+化工品 11 n
+化工填料 3 n
+化工大学 3 nt
+化工学院 3 nt
+化工局 4 n
+化工市场 3 n
+化工机械 3 n
+化工染料 3 n
+化工泵 3 n
+化工用品 3 n
+化工类 3 n
+化工系 12 n
+化工网 3 n
+化工行业 3 n
+化工设备 3 n
+化工部 13 n
+化工集团 3 nt
+化师 2 n
+化干戈为 3 nr
+化干戈为玉帛 13 i
+化开 3 v
+化形 3 n
+化德 2 nr
+化德县 3 nr
+化性 4 n
+化性起伪 3 n
+化感素 3 l
+化成 204 v
+化成剑 2 nr
+化成灰 5 l
+化成白 2 l
+化成美女 2 l
+化探 3 n
+化敌 2 n
+化敌为友 44 l
+化整为零 24 i
+化斋 37 nr
+化日光天 3 l
+化时 3 n
+化有为 2 l
+化机 5 n
+化机制 2 n
+化枭为鸠 3 n
+化步骤 2 l
+化武 3 nr
+化民成俗 16 n
+化民易俗 3 n
+化气 2 n
+化氢 7 n
+化氨 3 n
+化氮 3 n
+化水谷 2 n
+化汞 3 n
+化油器 3 n
+化洪七 2 nr
+化浓妆 2 n
+化淤 2 n
+化物所 3 n
+化物酶 3 n
+化王噶 2 nr
+化生 9 n
+化生存 3 n
+化生寺 2 nr
+化生成 2 nr
+化用 3 n
+化疗 547 n
+化疗剂 3 n
+化疗敏 3 l
+化疗药 3 n
+化痰 119 v
+化痰止咳 3 n
+化痰药 5 n
+化石 1701 n
+化石林 3 nr
+化石群 13 n
+化硅 3 n
+化硫 4 n
+化碘 3 nz
+化碳 3 n
+化磷 3 n
+化简 2 n
+化粪池 3 n
+化繁为简 3 i
+化纤 447 n
+化纤制 3 l
+化纤厂 11 n
+化纤工业 3 l
+化纤布 6 n
+化纤面料 3 l
+化缘 64 n
+化考 3 v
+化聚异 2 n
+化肥 824 n
+化肥厂 47 n
+化育 3 n
+化脓 77 v
+化脓性 104 n
+化腐为奇 3 l
+化腐成奇 3 l
+化腐朽为 3 l
+化腐朽为神奇 10 l
+化若偃草 3 vn
+化药厂 3 n
+化虚 2 n
+化蝶 4 n
+化蝶飞 3 nr
+化被万方 3 i
+化装 132 n
+化装品 2 n
+化装室 3 n
+化装师 3 n
+化装舞会 3 l
+化解 621 v
+化解矛盾 3 l
+化费 12 n
+化身 263 n
+化身为 3 l
+化释 4 v
+化钙 3 n
+化钛基 2 nr
+化钠 3 n
+化钡 3 n
+化钱 3 n
+化钾 3 n
+化铁 3 n
+化铁炉 8 n
+化铅 3 n
+化铋 3 n
+化铜 3 n
+化铝 3 n
+化铝锂 8 nr
+化铯 3 n
+化锰 3 n
+化镁 2 n
+化除 3 v
+化险为夷 62 i
+化隆 7 nr
+化隆县 3 nr
+化隆回族自治县 4 ns
+化隆西 2 nr
+化雨 3 n
+化雨春风 3 nr
+化零为志 3 i
+化零为整 3 l
+化食 5 n
+化饮 3 n
+化香 2 n
+化香树 3 nr
+化验 319 n
+化验单 23 n
+化验员 6 n
+化验品 3 n
+化验室 15 n
+化骨绵 10 l
+化鸱为凤 3 ns
+化龙巷 3 nr
+化龙桥 3 nr
+化龙池 2 nr
+北 17860 ns
+北一 3 t
+北一女 3 nr
+北三环 141 ns
+北三面 3 nr
+北上 992 f
+北上列车 3 ns
+北丐 9 n
+北丐洪 3 nr
+北东 25 ns
+北东东 7 ns
+北为恒 2 nr
+北乔峰 23 nr
+北九州 31 nr
+北乡 13 ns
+北二环 3 nr
+北二路 3 nz
+北五环 3 ns
+北五祖 7 nr
+北亚 74 ns
+北交大 3 j
+北京 34488 ns
+北京世界公园 2 nz
+北京东方 3 ns
+北京中医医院 4 nt
+北京中医学院 2 nt
+北京中医药大学 13 nt
+北京中华世纪坛 4 nz
+北京中南海 9 ns
+北京中国国际展览中心 3 nz
+北京中山公园 131 ns
+北京京剧团 7 nt
+北京京剧院 5 nt
+北京人民大会堂 29 nt
+北京人民广播电台 6 nt
+北京人民艺术剧院 32 nt
+北京人艺 15 nt
+北京会议中心 128 nt
+北京住总集团 3 nt
+北京体育大学 12 nt
+北京体育学院 5 nt
+北京保利大厦 4 nt
+北京信息工程学院 4 nt
+北京八中怡海分校 3 nr
+北京公交 3 n
+北京军区 102 nt
+北京军区总医院 30 nt
+北京军区政治部 3 nt
+北京军区空军 4 nt
+北京军区联勤部 2 nt
+北京农业大学 13 nt
+北京出版社 4 nt
+北京出版社出版集团 2 nt
+北京分行 8 nt
+北京动物园 8 ns
+北京化工大学 14 nt
+北京北海公园 5 ns
+北京北站 9 nt
+北京医科大学 12 nt
+北京医院 18 nt
+北京十月文艺出版社 6 nt
+北京华 3 nz
+北京华旗资讯 3 nt
+北京协和医院 66 nt
+北京卫戍区 135 nt
+北京印刷学院 3 nz
+北京友谊医院 7 nt
+北京口腔医院 3 n
+北京吉普 3 ns
+北京吉普汽车有限公司 3 nt
+北京同仁医院 17 nt
+北京商场 3 nt
+北京四中 4 ns
+北京国安 75 ns
+北京国安队 55 nt
+北京图书大厦 2 nt
+北京地区 302 ns
+北京地铁 3 ns
+北京城 1586 ns
+北京城乡贸易中心 28 nt
+北京城建集团 9 nt
+北京外企服务集团 2 nt
+北京外国语大学 21 nt
+北京大学 2053 nt
+北京大学中国经济研究中心 5 nt
+北京大学人口研究所 2 nt
+北京大学人民医院 11 nt
+北京大学光华管理学院 13 nt
+北京大学党委 3 nt
+北京大学出版社 63 nt
+北京大学医学部 5 nt
+北京大学历史系 28 nt
+北京大学哲学系 18 nt
+北京大学国际关系学院 3 nt
+北京大学国际政治系 6 nt
+北京大学图书馆 12 nt
+北京大学数学力学系 4 nt
+北京大学法学院 9 nt
+北京大学法律系 6 nt
+北京大学社会学系 5 nt
+北京大学第一医院 15 nt
+北京大学第三医院 3 nt
+北京大学经济系 2 nt
+北京大学附属中学 3 nt
+北京大宝 3 nz
+北京天坛医院 2 nt
+北京天安门广场 12 ns
+北京天文台 8 nt
+北京天文馆 5 nt
+北京奥运 3 nt
+北京妇产医院 6 nt
+北京安贞医院 2 nt
+北京宣武医院 2 nt
+北京宾馆 3 nt
+北京密云水库 2 ns
+北京对外经济贸易大学 2 nt
+北京小吃 3 nr
+北京局 3 nt
+北京展览馆 4 ns
+北京工业大学 23 nt
+北京工人体育馆 5 nt
+北京工商大学 20 nt
+北京巴士 2 ns
+北京市 3392 ns
+北京市东城区少年宫 4 n
+北京市二十一世纪实验学校 6 nt
+北京市人事局 11 nt
+北京市人大 3 nt
+北京市人大常委会 3 nt
+北京市人民政府 135 nt
+北京市公安局 33 nt
+北京市劳动人民文化宫 259 nz
+北京市劳动和社会保障局 4 nt
+北京市区 3 nt
+北京市卫生局 27 nt
+北京市委 53 nt
+北京市委教育工委 2 nt
+北京市工商局 7 nt
+北京市工商行政管理局 6 nt
+北京市建委 18 nt
+北京市总工会 4 nt
+北京市政协 264 nt
+北京市政府 148 nt
+北京市教委 12 nt
+北京市文物局 5 nt
+北京市文联 8 nt
+北京市旅游局 71 nt
+北京市民 3 ns
+北京市消协 11 nt
+北京市物价局 2 nt
+北京市社会科学院 2 nt
+北京市科委 2 nt
+北京市第一中级人民法院 3 nt
+北京市第二中级人民法院 3 nt
+北京市红十字会 7 nt
+北京市经济管理干部学院 2 n
+北京市统计局 8 nt
+北京市西城区人民法院 2 nt
+北京市高级人民法院 3 nt
+北京师大 4 nt
+北京师范大学 112 nt
+北京师范大学中文系 4 nt
+北京师范大学历史系 7 nt
+北京师范大学物理系 2 nt
+北京广播学院 11 nt
+北京广播电视大学 2 nt
+北京建工集团 3 nt
+北京心理卫生协会 2 nt
+北京房产 3 n
+北京政府 163 nt
+北京故宫 39 ns
+北京故宫博物院 16 ns
+北京旅游局 13 nt
+北京日报 3 nz
+北京晚报 3 nz
+北京晨报 16 nz
+北京服装 3 nz
+北京服装学院 3 nt
+北京朝阳医院 2 nt
+北京机场 6 ns
+北京机票 3 n
+北京林业大学 14 nt
+北京植物园 7 ns
+北京民族文化宫 2 ns
+北京海关 10 ns
+北京火车站 41 nt
+北京烤鸭 3 n
+北京牌 2 nz
+北京物资学院 3 nt
+北京犬 3 nr
+北京狗 3 nr
+北京猿人 69 n
+北京王府井 3 ns
+北京理工 3 nt
+北京理工大学 64 nt
+北京电台 2 nt
+北京电子管厂 17 nt
+北京电影制片厂 24 nt
+北京电影学院 25 nt
+北京电影学院摄影系 5 nt
+北京电视台 28 nt
+北京画院 11 nt
+北京石油 3 nt
+北京石油学院 3 nt
+北京科技大学 40 nt
+北京科技大学管理学院 2 nt
+北京积水潭医院 3 n
+北京移动通信有限责任公司 8 nt
+北京站 49 nt
+北京第二外国语学院 20 nt
+北京籍 3 nr
+北京经济技术开发区 4 nt
+北京翻译 3 nr
+北京联合大学 22 nt
+北京肿瘤医院 3 nt
+北京自然博物馆 4 ns
+北京自考 3 ns
+北京舞蹈学院 5 nt
+北京航天 3 nt
+北京航空航天大学 28 nt
+北京街头 3 ns
+北京西 26 ns
+北京西站 34 ns
+北京警方 3 nt
+北京语言文化大学 3 nt
+北京路 31 ns
+北京邮电 3 nt
+北京邮电大学 39 nt
+北京郊区 3 ns
+北京酒吧 3 n
+北京钓鱼台国宾馆 3 ns
+北京铁路局 29 nt
+北京阜外医院 3 nt
+北京队 56 nt
+北京青年报 31 nt
+北京音乐厅 44 nt
+北京饭店 31 ns
+北京首都体育馆 2 nt
+北京首都机场 15 ns
+北京首钢队 3 nt
+北京高校 3 nt
+北京鸭 8 nz
+北京黑马 3 ns
+北人 37 ns
+北仑 8 ns
+北仑区 6 ns
+北仑河 6 ns
+北仑河口 6 ns
+北仑港 9 ns
+北仓 16 ns
+北仰南 2 nr
+北伐 498 j
+北伐军 356 nr
+北伐战争 279 nz
+北伸延 5 nr
+北体大 3 nt
+北侧 704 f
+北信源 2 nr
+北元兵 2 nr
+北光丸 2 nr
+北入潞 2 nr
+北六环 3 ns
+北关 62 ns
+北关区 3 ns
+北军 24 j
+北军兵 2 nt
+北冥真 7 nr
+北冰洋 326 ns
+北凉 27 ns
+北凉主 3 nr
+北凉南 7 ns
+北凉王 3 nr
+北加州 2 ns
+北势溪 3 nr
+北北东 31 ns
+北北西 3 ns
+北区 48 ns
+北医 2 j
+北医三院 11 nt
+北医大 2 nt
+北半球 252 ns
+北半部 3 ns
+北南 17 ns
+北卡罗 3 nr
+北卡罗来 3 ns
+北卡罗来纳 20 ns
+北卡罗来纳州 31 ns
+北卡罗莱纳州 5 ns
+北卫滩 5 ns
+北原 16 ns
+北原兵 3 nr
+北去 3 t
+北县 3 ns
+北县人 3 nr
+北双熊 11 nr
+北双雄 7 nr
+北叟失马 3 nr
+北口 39 ns
+北台 10 ns
+北后 6 f
+北向 469 f
+北向东 3 nr
+北向南 57 nr
+北向西 2 nr
+北周 316 t
+北商 3 n
+北四环 17 nr
+北四环路 2 nz
+北四阁 2 nr
+北回 3 ns
+北回归线 81 l
+北回铁路 3 ns
+北园春 3 ns
+北园路 3 ns
+北固亭 6 nr
+北固山 7 ns
+北国 81 ns
+北国之春 3 nr
+北国网 3 nt
+北国风光 3 nz
+北图 28 ns
+北地 3 ns
+北地郡 4 ns
+北圻 3 ns
+北坡 210 ns
+北城 281 ns
+北埔 3 ns
+北堂 13 ns
+北塔区 3 ns
+北塘 149 ns
+北塘区 3 ns
+北塬 5 ns
+北境 5 n
+北壁 5 ns
+北外 87 f
+北外滩 3 nr
+北大 1580 j
+北大中文系 8 nt
+北大人民医院 2 nt
+北大仓 6 nr
+北大医院 5 nt
+北大图书馆 11 nt
+北大学生 3 nz
+北大方正 3 nz
+北大方正集团 6 nt
+北大法学院 8 nt
+北大清华 3 nz
+北大港 5 ns
+北大社会学系 2 nt
+北大第一医院 2 nt
+北大考 2 ns
+北大荒 97 ns
+北大营 47 ns
+北大街 17 ns
+北大西洋 165 ns
+北大西洋公约组织 77 nt
+北大附中 7 ns
+北天极 4 ns
+北太平 3 nr
+北太平庄 3 ns
+北头 30 ns
+北奥塞 2 nr
+北威州 3 ns
+北婆罗 130 nr
+北子岛 2 ns
+北宁 16 ns
+北宁市 3 ns
+北宁铁路 3 nz
+北宅 4 n
+北安 181 ns
+北安市 5 ns
+北安路 3 ns
+北宋 1415 t
+北宗掌 3 nr
+北宗禅 6 nr
+北宜公路 3 ns
+北宫 2 ns
+北宫婴儿 3 nr
+北宫玄 2 nr
+北宽南 5 nr
+北寒带 3 nr
+北寨 16 ns
+北寨苏 2 ns
+北展 2 j
+北屯 3 ns
+北屯牧 2 nr
+北山 360 ns
+北山区 2 ns
+北山愚 2 nr
+北山酒精 3 nz
+北山酒经 3 nz
+北岗 6 ns
+北岛 61 ns
+北岛群 3 nr
+北岩 2 ns
+北岭 7 ns
+北岳 29 ns
+北岳区 10 ns
+北岸 776 f
+北峪河 3 ns
+北峰 12 ns
+北川 14 ns
+北川县 2 ns
+北工大 4 j
+北市 3 ns
+北市人 3 n
+北市区 3 ns
+北市商 3 nt
+北师 3 nr
+北师专 3 nr
+北师大 60 j
+北帝岩 2 nr
+北帝庙 6 ns
+北帝爷 2 nr
+北平 4403 ns
+北平协和医学院 14 nt
+北平市 149 ns
+北平话 3 n
+北广 5 nz
+北广场 3 ns
+北庄 3 ns
+北府 3 ns
+北府兵 45 nr
+北府军 2 nt
+北庭 71 ns
+北庭伊 2 nr
+北康 2 ns
+北开 10 ns
+北彊 3 v
+北彝陵 2 ns
+北影 3 n
+北影厂 3 nt
+北征 11 nr
+北御辽 3 nr
+北德文 12 nr
+北德路 2 ns
+北恩古 2 nr
+北惠庭 2 nr
+北戴河 155 ns
+北戴河区 3 ns
+北房 3 n
+北扬 2 ns
+北投 3 j
+北投区 2 nt
+北支 2 ns
+北攻姑 3 nr
+北教场 3 n
+北斋清 2 t
+北斐特 2 nr
+北斗 265 nr
+北斗七星 56 nz
+北斗之尊 3 l
+北斗星 33 nz
+北斗神拳 3 nz
+北新 15 ns
+北新桥 11 ns
+北方 3850 f
+北方交大 3 nt
+北方交通 3 nt
+北方交通大学 11 nt
+北方佬 4 nz
+北方四岛 3 ns
+北方地区 58 ns
+北方大学 4 nt
+北方局 136 nt
+北方工业 3 nt
+北方工业大学 9 nt
+北方方言 3 l
+北方昆曲剧院 2 nt
+北方省 4 ns
+北方网 3 nz
+北方话 14 l
+北方邦 32 nt
+北方领土 3 n
+北明翰 11 nr
+北昭武 3 nr
+北普陀 2 ns
+北曲 6 ns
+北朝 180 t
+北朝元 2 nr
+北朝南 3 ns
+北朝鲜 108 ns
+北村 2 ns
+北杜味拿 3 nr
+北条 5 n
+北条司 3 n
+北来 3 t
+北极 409 ns
+北极光 20 ns
+北极冰 3 nr
+北极区 3 ns
+北极圈 97 n
+北极带 3 n
+北极星 172 n
+北极村 3 ns
+北极洲 3 ns
+北极海 3 ns
+北极点 5 n
+北极熊 67 n
+北极狐 21 nz
+北极雪 3 n
+北林 2 ns
+北林区 3 ns
+北查科 3 nr
+北柱兽 3 nr
+北校区 2 n
+北桥 3 ns
+北桥芯片 4 nz
+北梦琐 5 nr
+北楼 3 ns
+北横公路 3 n
+北欧 410 ns
+北欧国家 3 n
+北段 431 t
+北水南调 3 nz
+北汉 141 ns
+北汝河 3 nr
+北江 86 ns
+北江区 3 ns
+北江里 3 ns
+北池子 12 nr
+北汽 22 j
+北沙 2 ns
+北沙参 3 nr
+北河 78 ns
+北河乡 3 ns
+北河口 260 ns
+北河沿 2 ns
+北注协 3 nt
+北洋 936 ns
+北洋军 62 nt
+北洋军阀 724 l
+北洋大学 3 nt
+北洋政府 578 nt
+北洋武备 3 l
+北洋水师 105 nt
+北洛河 14 ns
+北洞山 3 ns
+北流 376 ns
+北流市 3 ns
+北海 505 ns
+北海公园 25 ns
+北海岸 2 s
+北海市 28 ns
+北海旅游 3 nz
+北海村 4 ns
+北海港 10 ns
+北海舰队 84 nt
+北海道 141 ns
+北海道人 3 nr
+北涌 2 nz
+北涛南 2 nr
+北温带 59 n
+北港 3 ns
+北港人 3 nz
+北港溪 3 ns
+北港镇 2 ns
+北游录 2 n
+北游燕 3 nr
+北湖 270 ns
+北湖区 3 ns
+北湖园 3 ns
+北源 18 ns
+北源楚 2 nr
+北源石 2 nr
+北溪 7 ns
+北滨 3 ns
+北滨公路 3 ns
+北燕 36 nr
+北爱 199 nr
+北爱党 3 nt
+北爱尔兰 129 ns
+北狄 2 nr
+北王兴 2 ns
+北王志 2 nr
+北环路 3 ns
+北理工 27 j
+北瓜 14 ns
+北瓦济 2 nr
+北电 38 j
+北界 2 n
+北界城 3 ns
+北疆 64 ns
+北白川 3 ns
+北盘江 29 ns
+北直隶 15 ns
+北碚 4 nr
+北碚区 3 ns
+北票 14 n
+北票市 5 ns
+北科大 20 j
+北科迪勒 2 nz
+北空 11 s
+北窗高卧 3 nr
+北站 33 ns
+北端 428 f
+北端落 2 nr
+北竿 3 n
+北竿岛 3 nr
+北约 1124 ns
+北约组织 3 nt
+北约集团 38 nt
+北纬 1558 b
+北纬度 3 nr
+北线 30 n
+北经希 2 nr
+北绕 2 v
+北缘 106 f
+北罗 9 ns
+北美 874 ns
+北美华人 3 nz
+北美地区 27 ns
+北美洲 375 ns
+北美版 3 nz
+北美票房 3 ns
+北美自由贸易区 6 nt
+北美自由贸易协定 4 nz
+北能 3 j
+北至 3 ns
+北至南 2 ns
+北至燕 3 nr
+北航 96 j
+北艾尔湖 2 ns
+北苏门答腊 3 ns
+北苑 7 ns
+北苑路 3 ns
+北莫尔斯克 3 nrt
+北蒙 2 ns
+北行 2 j
+北街 41 ns
+北西 15 ns
+北西西 10 ns
+北角 31 ns
+北语 6 nz
+北语招 5 nr
+北语英 3 nr
+北语雅 2 nr
+北诸宗 2 nr
+北豆根 3 nz
+北货 3 n
+北赤道洋 3 ns
+北起 3 s
+北越 3 ns
+北越军 3 nr
+北越法 3 nr
+北路 402 ns
+北路军 15 nt
+北路甲 3 ns
+北辕适楚 3 nr
+北辕适粤 3 nr
+北辙南辕 3 nr
+北辛庄 3 ns
+北辰 15 nr
+北辰区 5 nt
+北辰星拱 3 nr
+北边 404 f
+北辽朝 2 nr
+北达科他 3 ns
+北达科他州 8 ns
+北迁 4 ns
+北迎明 2 nr
+北迎海 3 nr
+北运 3 j
+北运河 53 ns
+北道 69 ns
+北道主人 3 n
+北道区 3 ns
+北道行 2 nt
+北道达 2 nr
+北邮 10 ns
+北邻温 2 nr
+北郊 247 ns
+北郊区 8 ns
+北部 4963 f
+北部湾 99 nr
+北郭先生 3 nr
+北鄂尔 3 nr
+北鄙之声 3 l
+北鄙之音 3 l
+北里 17 ns
+北野 6 ns
+北野武 7 nr
+北金堤 2 nr
+北钢 5 j
+北镇 59 ns
+北镇县 3 ns
+北镇抚 25 nr
+北长山 4 ns
+北门 776 ns
+北门一带 3 nz
+北门之寄 3 nr
+北门之管 3 l
+北门南牙 3 ns
+北门管钥 3 n
+北门锁钥 5 nr
+北陆 7 ns
+北陵 8 ns
+北隅 2 f
+北雁南 3 ns
+北霍鲁 2 nr
+北青报 3 nt
+北青旅 6 j
+北青网 3 nt
+北静王 32 nr
+北静王妃 4 nr
+北静郡王 5 nr
+北非 530 ns
+北非人 4 nr
+北非国家 3 l
+北非地区 14 ns
+北非洲 2 ns
+北面 768 f
+北面称臣 3 n
+北韩 5 ns
+北顿涅茨河 3 ns
+北领地 16 l
+北风 397 ns
+北风之恋 3 nr
+北风吹 3 nr
+北首岭 3 ns
+北马里亚纳群岛 6 ns
+北高加索 22 ns
+北高加索军区 8 ns
+北高加索地区 7 ns
+北高南 7 ns
+北高峰 5 nr
+北魏 640 t
+北魏修 2 nr
+北魏军 5 nr
+北魏初 6 nr
+北魏南 2 nr
+北魏太 2 nr
+北魏孝 5 nr
+北魏官 4 nr
+北魏改 2 nr
+北魏攻 2 nr
+北魏文 5 nr
+北魏明 4 nr
+北魏末 5 nr
+北魏永 4 nr
+北魏登 3 nr
+北魏继 3 nr
+北魏行 5 nr
+北魏贾 2 nr
+北魏道 2 nr
+北魏郦 6 nr
+北鲁 2 ns
+北鲵 2 n
+北麓 462 f
+北齐 365 ns
+北齐书 3 nr
+北龙 14 ns
+匙 186 n
+匙吻鲟 4 n
+匙子 6 n
+匙里 2 n
+匚 51 zg
+匜 7 zg
+匝 198 q
+匝地 24 n
+匝数 3 n
+匝月 3 n
+匝道 7 n
+匟床 3 vn
+匠 728 ng
+匠人 142 n
+匠师 94 n
+匠心 22 n
+匠心独具 6 i
+匠心独妙 3 i
+匠心独运 16 i
+匠气 3 n
+匠石运金 3 n
+匠门弃材 3 n
+匡 309 nr
+匡乱反正 3 i
+匡俗济时 3 i
+匡助 3 v
+匡国济时 3 nr
+匡庐图 3 nr
+匡扶 34 nr
+匡扶汉 5 nr
+匡救 3 v
+匡救弥缝 3 i
+匡时济世 3 nr
+匡时济俗 3 nr
+匡正 17 nr
+匡济 4 nr
+匡济之 2 nr
+匡算 5 v
+匡红艳 3 nr
+匡衡凿壁 3 i
+匡谬正俗 3 i
+匣 496 n
+匣剑帷灯 3 n
+匣子 266 n
+匣子枪 14 n
+匣式 3 n
+匣里龙吟 3 n
+匣钵 4 n
+匦 172 zg
+匪 627 ng
+匪伊朝夕 3 i
+匪伪 3 n
+匪党 3 n
+匪共 3 n
+匪兵 3 n
+匪军 3 n
+匪匪翼翼 3 n
+匪区 3 n
+匪史 3 n
+匪夷匪惠 3 vn
+匪夷所思 214 i
+匪巢 3 n
+匪帮 19 n
+匪干 3 n
+匪徒 104 n
+匪患 44 n
+匪情 3 n
+匪懈 3 i
+匪方 3 n
+匪朝伊夕 3 i
+匪气 8 n
+匪特 3 n
+匪盗 4 n
+匪石之心 3 i
+匪石匪席 3 n
+匪祸 3 n
+匪穴 3 n
+匪窝 3 n
+匪窟 3 n
+匪类 3 n
+匪话 3 n
+匪谍 3 n
+匪货 3 n
+匪贼 3 n
+匪躬之节 3 i
+匪酋 3 n
+匪里匪气 3 n
+匪首 41 n
+匬 7 zg
+匭 36 zg
+匮 88 zg
+匮乏 228 v
+匮竭 3 v
+匮缺 5 v
+匴 2 zg
+匹 1013 q
+匹亚 3 ns
+匹兹堡 49 ns
+匹夫 98 ns
+匹夫之勇 39 i
+匹夫匹妇 2 i
+匹夫怀璧 3 i
+匹夫无罪 3 i
+匹夫有责 29 i
+匹夫沟渎 3 ns
+匹妇沟渠 3 nz
+匹带 3 v
+匹敌 134 v
+匹练 4 vn
+匹茨堡 3 ns
+匹萨 3 ns
+匹萨饼 3 n
+匹配 526 v
+匹配段 3 n
+匹配终端 3 i
+匹马单枪 9 i
+匹马只轮 3 n
+匹马当先 3 i
+区 24952 n
+区三圣 3 nr
+区乡 3 n
+区书 3 n
+区产 3 n
+区位 136 n
+区位商 3 n
+区位因子 3 n
+区位理论 3 n
+区位码 3 n
+区位系数 3 n
+区位记录 3 n
+区光彪 2 nrfg
+区党委 22 n
+区公所 24 n
+区内 434 s
+区内外 10 s
+区凯玲 3 nr
+区分 1284 n
+区分值 3 n
+区分序列 3 n
+区分度 5 n
+区分效度 3 n
+区分法 3 n
+区分符 3 n
+区划 685 n
+区划图 16 n
+区别 3776 n
+区别对待 3 n
+区别性 3 n
+区别情况 3 n
+区别词 3 n
+区区 299 n
+区区之众 3 n
+区区小事 13 n
+区区此心 3 l
+区县 90 n
+区号 3 n
+区四园 256 nr
+区块 17 n
+区域 6406 n
+区域代理 3 n
+区域估计 3 n
+区域保护 2 n
+区域分割 2 n
+区域分异 3 n
+区域分析 3 n
+区域化 28 n
+区域合作 3 n
+区域开发 3 n
+区域性 200 n
+区域描述 3 n
+区域气候 3 n
+区域环境 3 n
+区域科学 3 n
+区域系统 3 n
+区域经理 3 n
+区域规划 3 n
+区域评价 3 n
+区域试验 3 n
+区域间 3 n
+区声白 2 n
+区外 24 s
+区委 271 n
+区委书记 3 n
+区宇 3 n
+区宇一清 3 nr
+区寒武 2 nr
+区局 7 n
+区属 30 n
+区工会 2 n
+区市 3 n
+区带 17 n
+区庄 3 n
+区情 3 n
+区招飞 2 nr
+区政 256 n
+区政府 100 n
+区旗 29 n
+区星 3 n
+区柯克 6 nr
+区标 3 n
+区梅元 2 nr
+区楚良 3 z
+区段 64 n
+区法院 3 n
+区淑贞 3 nrfg
+区瑞强 3 nr
+区直 21 v
+区码 3 n
+区级 24 n
+区署 2 n
+区薪 2 n
+区西溪 13 nr
+区西科 2 nr
+区议会 7 n
+区越远 2 nr
+区辉光 2 nr
+区运 3 n
+区运会 3 n
+区里 71 s
+区金蓉 2 nr
+区长 1668 n
+区间 194 n
+区间车 6 n
+区闻陬见 3 v
+区际 10 n
+区院 3 n
+区隔 3 n
+区雄楚 512 nr
+区麦维 6 nr
+医 1040 n
+医不好 3 v
+医专 5 j
+医书 81 n
+医事 3 n
+医事职业 3 n
+医保 273 j
+医保卡 2 n
+医典 22 n
+医务 331 n
+医务人员 3 n
+医务兵 3 n
+医务处 13 n
+医务室 16 n
+医务所 5 n
+医务界 6 n
+医务科 13 n
+医务部 3 n
+医卫 6 n
+医卫界 3 n
+医卫组 3 n
+医嘱 62 n
+医圣 20 n
+医坛 3 n
+医士 22 n
+医大 17 j
+医好 3 n
+医学 3433 n
+医学专业 3 j
+医学专家 3 n
+医学中心 3 n
+医学书店 3 n
+医学书籍 3 n
+医学会 68 n
+医学博士 3 n
+医学史 26 n
+医学士 3 n
+医学奖 61 n
+医学家 104 n
+医学工程 3 n
+医学影像 3 n
+医学教育 3 n
+医学整形 3 n
+医学期刊 3 n
+医学杂志 3 n
+医学生 3 n
+医学界 72 n
+医学知识 3 n
+医学科 13 n
+医学类 41 n
+医学系 15 n
+医学纲目 3 n
+医学网 3 n
+医学美容 3 n
+医学观察 3 n
+医学论坛 3 n
+医学论文 3 n
+医学部 28 n
+医学院 443 n
+医学院校 14 n
+医宗金鉴 3 n
+医官 3 n
+医家 58 n
+医工 2 n
+医巫闾山 9 ns
+医师 629 n
+医师公会 3 n
+医师法 5 n
+医师资格 3 n
+医德 59 n
+医心无悔 3 n
+医患 71 n
+医托 8 n
+医技 3 n
+医护 175 n
+医护人员 3 n
+医护兵 3 n
+医改 32 j
+医方 27 n
+医时救弊 3 n
+医术 170 n
+医林改错 3 n
+医案 3 n
+医械 3 n
+医治 370 n
+医治创伤 3 n
+医治无效 3 n
+医源性 3 n
+医王 3 n
+医理 43 n
+医生 4263 n
+医用 168 n
+医界 11 n
+医疗 3488 n
+医疗事故 3 n
+医疗保健 3 n
+医疗保险 200 n
+医疗保障 3 n
+医疗卡 2 n
+医疗卫生 3 n
+医疗器械 3 n
+医疗室 5 n
+医疗广告 3 n
+医疗期 5 n
+医疗机构 3 n
+医疗法 2 n
+医疗点 4 n
+医疗用具 3 n
+医疗界 20 n
+医疗站 12 n
+医疗系 7 n
+医疗系统 3 n
+医疗纠纷 3 z
+医疗组 3 n
+医疗网 2 n
+医疗费 69 n
+医疗队 89 n
+医疗险 3 n
+医病 3 n
+医科 181 n
+医科大 3 j
+医科大学 3 n
+医科院 4 j
+医管局 4 n
+医者 20 n
+医药 3417 n
+医药业 9 n
+医药产业 3 n
+医药代理 3 n
+医药企业 3 n
+医药保健 3 n
+医药公司 3 n
+医药包装 3 n
+医药卫生 3 n
+医药原料 3 n
+医药品 4 n
+医药学 27 n
+医药学家 3 n
+医药局 2 n
+医药工业 3 n
+医药瓶 3 n
+医药界 15 n
+医药箱 2 n
+医药网 3 n
+医药罔效 3 vn
+医药行业 3 n
+医药费 73 n
+医药集团 3 n
+医葯 3 vn
+医述 3 b
+医道 74 n
+医道高明 3 n
+医错 3 n
+医院 7376 n
+医院地址 3 n
+医院船 3 j
+医院软件 3 n
+医院院长 3 n
+医风 29 n
+医馆 3 n
+医马论典 3 n
+医魂 3 n
+匼 12 zg
+匽 8 zg
+匾 764 n
+匾文 3 n
+匾牌 10 n
+匾联 4 n
+匾额 1798 n
+匿 114 vg
+匿伏 3 v
+匿名 99 v
+匿名下载 3 n
+匿名举报 3 n
+匿名信 41 n
+匿名性 8 n
+匿名登录 3 n
+匿名账号 3 n
+匿影藏形 3 n
+匿情 3 n
+匿户 3 n
+匿报 3 n
+匿料 3 n
+匿瑕含垢 3 nr
+匿藏 2 v
+匿迹 4 n
+匿迹消声 3 n
+匿迹潜形 3 n
+匿迹销声 3 n
+匿迹隐形 3 n
+十 7926 m
+十一 1116 m
+十一万 5 m
+十一万零六百余两 2 m
+十一下 3 m
+十一个 112 m
+十一个月 7 m
+十一二 3 m
+十一二岁 18 m
+十一二年 3 m
+十一二点 5 m
+十一五 661 m
+十一五首年 256 m
+十一亿元 2 m
+十一位 12 m
+十一倍 2 m
+十一元 3 m
+十一分 2 m
+十一卷 10 m
+十一口 3 m
+十一只 2 m
+十一号 3 m
+十一名 14 m
+十一员 2 m
+十一团 3 m
+十一块 3 m
+十一处 7 m
+十一大 55 j
+十一天 7 m
+十一家 6 m
+十一层 5 m
+十一届 518 m
+十一届三中全会 836 nz
+十一岁 46 m
+十一年 508 m
+十一座 3 m
+十一张 4 m
+十一所 2 m
+十一担 5 m
+十一日 88 m
+十一时 3 d
+十一月 565 m
+十一月份 3 nz
+十一期 2 d
+十一枝 2 m
+十一架 2 m
+十一楼 3 i
+十一次 3 m
+十一款 4 m
+十一歌 4 m
+十一点 49 m
+十一点七 2 m
+十一点九 2 m
+十一点二 3 m
+十一点二十分 2 m
+十一点半 7 m
+十一点多 9 m
+十一点左右 3 m
+十一烯酸 2 nz
+十一碗 2 m
+十一种 21 m
+十一章 3 m
+十一篇 7 m
+十一艘 2 m
+十一载 6 m
+十一遍 2 m
+十一郎 3 m
+十一部 7 m
+十一门 3 m
+十一间 4 m
+十一面 3 m
+十一项 4 m
+十七 627 m
+十七万 20 m
+十七万七千八百顷 2 m
+十七万左右 2 m
+十七世纪 3 nz
+十七个 29 m
+十七中 3 nz
+十七亿 2 m
+十七位 5 m
+十七元 3 m
+十七八 29 m
+十七八万 4 m
+十七八个 24 m
+十七八代 6 m
+十七八刀 4 m
+十七八名 5 m
+十七八块 12 m
+十七八天 2 m
+十七八家 2 m
+十七八岁 86 m
+十七八年 2 m
+十七八条 2 m
+十七八杯 2 m
+十七八次 4 m
+十七八段 2 m
+十七八遍 4 m
+十七八道 2 m
+十七具 3 m
+十七冶 3 j
+十七分 2 m
+十七卷 9 m
+十七口 2 m
+十七号 9 m
+十七名 4 m
+十七员 2 m
+十七块 2 m
+十七处 2 m
+十七天 4 m
+十七孔桥 3 nz
+十七宗 2 m
+十七层 3 m
+十七届 8 m
+十七岁 149 m
+十七帖 4 m
+十七年 779 m
+十七廿八块 5 m
+十七廿八级 2 m
+十七所 2 m
+十七招 3 m
+十七斤 2 m
+十七日 114 m
+十七时 3 m
+十七条 6 m
+十七次 8 m
+十七点 3 m
+十七点七 2 m
+十七种 3 m
+十七章 3 m
+十七篇 5 m
+十七级 2 m
+十七艘 2 m
+十七路 2 m
+十七路军 3 j
+十七载 6 m
+十七部 3 m
+十七里 2 m
+十七项 2 m
+十七首 3 m
+十万 571 m
+十万两 76 m
+十万个 11 m
+十万二十万 4 m
+十万亩 2 m
+十万人 3 i
+十万份 2 m
+十万余 20 m
+十万倍 2 m
+十万元 37 m
+十万八万 10 m
+十万八千 2 m
+十万八千年 3 m
+十万八千里 55 m
+十万出 2 m
+十万分 3 m
+十万分之一 10 m
+十万匹 5 m
+十万卷 5 m
+十万台 2 m
+十万名 4 m
+十万吨 4 m
+十万块 9 m
+十万多 7 m
+十万大山 14 nz
+十万天 13 m
+十万家 5 m
+十万左右 9 m
+十万年 3 m
+十万户 9 m
+十万数 2 m
+十万枝 4 m
+十万次 2 m
+十万港元 2 m
+十万火急 79 i
+十万火速 3 nz
+十万百万 2 m
+十万美元 5 m
+十万贯 17 m
+十万里 2 m
+十万零一千 2 m
+十万零四千四百多门 2 m
+十万顷 2 m
+十丈 58 m
+十三 1808 m
+十三一 8 m
+十三一眼 3 m
+十三万 26 m
+十三万户 5 m
+十三丈 2 m
+十三个 375 m
+十三亿 27 m
+十三亿余元 2 m
+十三件 4 m
+十三位 7 m
+十三例 2 m
+十三倍 2 m
+十三元 2 m
+十三公里 2 m
+十三分 5 m
+十三匹 3 m
+十三卷 7 m
+十三发 2 m
+十三口 4 m
+十三只 4 m
+十三号 3 m
+十三名 8 m
+十三四 4 m
+十三四万 2 m
+十三四个 2 m
+十三四岁 34 m
+十三场 3 m
+十三块 4 m
+十三处 5 m
+十三多年 2 m
+十三大 168 j
+十三天 7 m
+十三太保 4 j
+十三套 3 m
+十三姨 3 l
+十三家 59 m
+十三层 26 m
+十三届 201 m
+十三岁 105 m
+十三年 698 m
+十三幺 3 n
+十三所 5 m
+十三手 3 m
+十三招 3 m
+十三排 5 m
+十三斤 4 m
+十三方 2 m
+十三日 91 m
+十三时 3 t
+十三条 10 m
+十三枚 2 m
+十三枪 3 m
+十三根 4 m
+十三次 5 m
+十三款 5 m
+十三步 2 m
+十三点 131 m
+十三点七 2 m
+十三点九 2 m
+十三点点 5 m
+十三种 8 m
+十三站 3 m
+十三篇 14 m
+十三米 2 m
+十三类 4 m
+十三经 20 j
+十三脸 2 m
+十三腔 2 m
+十三艘 5 m
+十三行 14 j
+十三路 5 m
+十三身 2 m
+十三载 8 m
+十三辙 3 i
+十三道 60 m
+十三部 8 m
+十三里 10 m
+十三铢 2 m
+十三间 4 m
+十三陵 66 j
+十三陵水库 10 nz
+十三顷 2 m
+十下 14 m
+十不当一 3 l
+十不得一 3 l
+十不闲儿 3 l
+十世单传 3 l
+十世纪 3 t
+十两 154 m
+十两三 2 m
+十两八两 5 m
+十两左右 2 m
+十两重 4 m
+十个 977 m
+十个月 3 m
+十中 3 j
+十中全会 3 j
+十串 3 m
+十之八九 137 m
+十九 382 m
+十九万 2 m
+十九万四千两 2 m
+十九世纪 3 nz
+十九个 17 m
+十九中 3 nz
+十九人 3 nz
+十九代 3 m
+十九元 3 m
+十九具 5 m
+十九分 3 m
+十九匹 2 m
+十九号 4 m
+十九块 3 m
+十九处 2 m
+十九天 3 m
+十九层 2 m
+十九岁 62 m
+十九峰 5 m
+十九年 566 m
+十九招 2 m
+十九日 116 m
+十九时 3 m
+十九杯 3 m
+十九楼 3 i
+十九点 3 m
+十九点九 2 m
+十九第一次 3 m
+十九路 33 m
+十九道 6 m
+十九门 4 m
+十九首 22 m
+十九首集 2 m
+十二 1396 m
+十二万 52 m
+十二万两 2 m
+十二万五千余次 2 m
+十二万余两 2 m
+十二万分 8 m
+十二万四千 2 m
+十二万四千担 2 m
+十二三 6 m
+十二三万 2 m
+十二三天 2 m
+十二三岁 37 m
+十二三年 3 m
+十二三招 2 m
+十二三碗 2 m
+十二三里 2 m
+十二下 6 m
+十二两 17 m
+十二个 248 m
+十二五 274 m
+十二亩 2 m
+十二亿 4 m
+十二亿三百八十二万余两 2 m
+十二亿五千余万两 2 m
+十二代 2 m
+十二件 3 m
+十二位 11 m
+十二倍 2 m
+十二元 9 m
+十二册 2 m
+十二分 82 m
+十二包 2 m
+十二匹 6 m
+十二卷 33 m
+十二口 2 m
+十二句 2 m
+十二只 7 m
+十二号 3 m
+十二名 35 m
+十二员 5 m
+十二周 2 m
+十二团 3 m
+十二块 2 m
+十二处 8 m
+十二多 4 m
+十二大 166 j
+十二天 29 m
+十二头 2 m
+十二宫 3 nz
+十二家 9 m
+十二局 2 m
+十二届 152 m
+十二属 3 l
+十二属相 8 nz
+十二岁 98 m
+十二峰 10 m
+十二幅 2 m
+十二平均 3 j
+十二平方米 6 m
+十二年 698 m
+十二度 3 m
+十二张 6 m
+十二律 3 l
+十二把 3 m
+十二招 7 m
+十二拳 2 m
+十二指肠 127 l
+十二支 7 m
+十二文 2 m
+十二斤 4 m
+十二日 85 m
+十二时 15 t
+十二月 575 m
+十二月份 3 nz
+十二条 40 m
+十二枚 6 m
+十二枝 5 m
+十二架 3 m
+十二株 3 m
+十二棵 5 m
+十二楼 3 nz
+十二次 17 m
+十二款 5 m
+十二步 3 m
+十二海里 3 m
+十二点 98 m
+十二片 3 m
+十二生肖 27 l
+十二用 3 nz
+十二皮部 3 nz
+十二码球 3 nz
+十二种 22 m
+十二章 7 m
+十二篇 4 m
+十二米 3 m
+十二类 2 m
+十二粒 4 m
+十二级 2 m
+十二经别 3 i
+十二经筋 3 nz
+十二经脉 3 nz
+十二艘 6 m
+十二行 4 m
+十二角 2 m
+十二路 6 m
+十二载 6 m
+十二辆 5 m
+十二辑 2 m
+十二道 13 m
+十二部 5 m
+十二里 5 m
+十二重 3 m
+十二金牌 3 nz
+十二金钗 4 i
+十二钗 3 i
+十二铢 6 m
+十二锭 2 m
+十二门 6 m
+十二队 2 m
+十二面 13 m
+十二项 4 m
+十二颗 7 m
+十二首 14 m
+十五 2584 m
+十五一笔 5 m
+十五万 64 m
+十五万两 9 m
+十五万元 4 m
+十五万名 2 m
+十五万户 2 m
+十五万斤 2 m
+十五万英镑 2 m
+十五丈 3 m
+十五世纪 3 t
+十五两 3 m
+十五两三 2 m
+十五个 56 m
+十五亿元 3 m
+十五亿美元 2 m
+十五件 3 m
+十五位 12 m
+十五元 4 m
+十五公斤 2 m
+十五公里 5 m
+十五六 12 m
+十五六万 4 m
+十五六丈 2 m
+十五六个 6 m
+十五六天 2 m
+十五六岁 64 m
+十五六年 7 m
+十五六米 2 m
+十五六里 5 m
+十五六门 2 m
+十五分 22 m
+十五分钟 31 m
+十五匹 2 m
+十五卷 24 m
+十五只 18 m
+十五号 3 m
+十五名 26 m
+十五块 12 m
+十五处 4 m
+十五夜 10 m
+十五大 606 j
+十五天 21 m
+十五头 3 m
+十五家 4 m
+十五小 4 j
+十五层 2 m
+十五届 60 m
+十五岁 162 m
+十五年 1817 m
+十五张 2 m
+十五户 5 m
+十五招 6 m
+十五捆 2 m
+十五支 3 m
+十五斤 5 m
+十五日 254 m
+十五条 3 m
+十五次 12 m
+十五步 3 m
+十五点八 3 m
+十五碗 3 m
+十五种 12 m
+十五秒 2 m
+十五章 3 m
+十五篇 3 m
+十五米 7 m
+十五级 4 m
+十五络 3 l
+十五胎 2 m
+十五艘 2 m
+十五路 2 m
+十五载 13 m
+十五道 277 m
+十五部 4 m
+十五里 37 m
+十五间 3 m
+十五阵 4 m
+十五顷 3 m
+十五项 2 m
+十亩 37 m
+十亲九故 3 i
+十亲九眷 3 i
+十人九慕 3 l
+十人份 3 m
+十亿 19 m
+十亿九千二百四十六万两 2 m
+十亿分 4 m
+十亿吨 3 m
+十亿四千万余美元 2 m
+十亿斤 2 m
+十亿片 2 m
+十亿美元 5 m
+十付 3 mq
+十代 22 t
+十令 3 n
+十件 30 m
+十件事 3 l
+十任 3 m
+十份 9 m
+十传百 3 nz
+十位 74 m
+十位数 3 l
+十余 376 m
+十余万 181 m
+十余万两 2 m
+十余万元 2 m
+十余万口 6 m
+十余万头 2 m
+十余万年 2 m
+十余万户 7 m
+十余万顷 2 m
+十余丈 248 m
+十余下 9 m
+十余两 3 m
+十余个 33 m
+十余件 6 m
+十余位 11 m
+十余公里 2 m
+十余具 4 m
+十余分钟 2 m
+十余匹 6 m
+十余口 2 m
+十余只 16 m
+十余名 109 m
+十余吨 4 m
+十余场 2 m
+十余块 8 m
+十余处 8 m
+十余天 15 m
+十余头 5 m
+十余家 21 m
+十余岁 4 m
+十余幢 2 m
+十余年 378 m
+十余座 5 m
+十余张 8 m
+十余所 3 m
+十余把 2 m
+十余招 113 m
+十余斤 2 m
+十余日 46 m
+十余朵 2 m
+十余条 18 m
+十余枚 21 m
+十余枝 16 m
+十余架 3 m
+十余株 5 m
+十余根 5 m
+十余次 22 m
+十余步 32 m
+十余点 2 m
+十余着 2 l
+十余碗 3 m
+十余种 30 m
+十余篇 2 m
+十余米 18 m
+十余股 2 m
+十余艘 7 m
+十余行 2 m
+十余路 3 m
+十余载 13 m
+十余辆 6 m
+十余遍 2 m
+十余道 6 m
+十余部 5 m
+十余里 163 m
+十余重 2 m
+十余顷 2 m
+十余项 3 m
+十余首 2 m
+十佳 105 z
+十佳评选 3 i
+十例 2 m
+十信 3 j
+十倍 437 m
+十元 56 m
+十兆 3 nz
+十光五色 3 i
+十克 2 m
+十克拉 3 nz
+十全 29 nz
+十全十美 68 nz
+十全大补 3 j
+十全街 3 n
+十八 1304 m
+十八万 5 m
+十八万两 3 m
+十八万九千余 2 m
+十八万余 2 m
+十八丈 2 m
+十八世纪 3 nz
+十八两 7 m
+十八两个 2 m
+十八个 61 m
+十八九 13 m
+十八九个 3 m
+十八九岁 51 m
+十八九年 5 m
+十八亩 3 m
+十八亿美元 2 m
+十八代 64 m
+十八件 2 m
+十八位 10 m
+十八余里 2 m
+十八元 2 m
+十八具 2 m
+十八分 3 m
+十八卷 7 m
+十八双 4 m
+十八变 3 nz
+十八号 2 m
+十八名 44 m
+十八周岁 5 m
+十八块 7 m
+十八处 7 m
+十八天 29 m
+十八头 2 m
+十八姑娘 3 l
+十八家 2 m
+十八尊 8 m
+十八层 45 m
+十八层地 3 l
+十八岁 256 m
+十八年 1859 m
+十八座 2 m
+十八式 3 l
+十八弯 3 l
+十八怪 3 i
+十八手 2 m
+十八打 3 m
+十八招 4 m
+十八掌 3 i
+十八摸 3 i
+十八文 2 m
+十八斗 3 m
+十八斤 5 m
+十八日 271 m
+十八本 4 m
+十八朵 3 m
+十八条 4 m
+十八架 4 m
+十八株 3 m
+十八棵 8 m
+十八次 4 m
+十八款 3 m
+十八点 6 m
+十八点五 2 m
+十八班 5 m
+十八番 3 m
+十八盘 7 m
+十八相送 3 nz
+十八碗 2 m
+十八禁 3 i
+十八种 5 m
+十八笔 2 m
+十八粒 2 m
+十八级 6 m
+十八罗汉 38 nz
+十八脸 2 m
+十八般 4 l
+十八般兵器 12 l
+十八般武艺 29 l
+十八英寸 2 m
+十八身 2 m
+十八辆 4 m
+十八辈 2 m
+十八道 83 m
+十八部 7 m
+十八里 20 m
+十八里店 3 nz
+十八间 2 m
+十八颗 7 m
+十公克 3 m
+十公分 3 m
+十公升 3 m
+十公尺 3 m
+十公斤 2 m
+十公里 12 m
+十六 1183 m
+十六七 19 m
+十六七件 2 m
+十六七名 2 m
+十六七岁 67 m
+十六七年 5 m
+十六万 6 m
+十六万九千四百三十一亩 2 m
+十六万余 2 m
+十六世纪 3 nz
+十六两 17 m
+十六个 127 m
+十六亿吨 2 m
+十六代 3 m
+十六位 7 m
+十六元 3 m
+十六分 2 m
+十六分钟 4 m
+十六分音 3 i
+十六卷 10 m
+十六口 2 m
+十六只 5 m
+十六号 3 m
+十六名 56 m
+十六员 2 m
+十六周岁 6 m
+十六和弦 3 i
+十六块 8 m
+十六大 59 j
+十六天 3 m
+十六头 3 m
+十六字诀 3 n
+十六家 5 m
+十六尊 9 m
+十六届 42 m
+十六岁 173 m
+十六平方米 2 m
+十六年 522 m
+十六度 2 m
+十六开 3 m
+十六张 5 m
+十六强 3 j
+十六所 2 m
+十六扇 2 m
+十六招 3 m
+十六排 2 m
+十六斤 4 m
+十六日 93 m
+十六时 3 m
+十六条 24 m
+十六枚 3 m
+十六根 7 m
+十六桌 3 m
+十六次 5 m
+十六款 2 m
+十六点 6 m
+十六点七 2 m
+十六点九 2 m
+十六烷值 3 n
+十六盏 2 m
+十六票 2 m
+十六种 2 m
+十六章 3 m
+十六篇 3 m
+十六级 2 m
+十六节 3 m
+十六行 3 m
+十六进位 3 l
+十六进制 6 j
+十六部 5 m
+十六里 2 m
+十六铺 9 nz
+十六门 2 m
+十六顶 2 m
+十六顷 4 m
+十六首 2 m
+十关 3 t
+十具 9 m
+十册 3 m
+十军 3 j
+十冬腊月 7 nz
+十几 320 m
+十几万 139 m
+十几万两 7 m
+十几万个 3 m
+十几万元 6 m
+十几万韩元 2 m
+十几丈 24 m
+十几下 31 m
+十几两 14 m
+十几个 599 m
+十几串 2 m
+十几二十年 4 m
+十几亩 5 m
+十几人 3 l
+十几亿 9 m
+十几代 21 m
+十几件 3 m
+十几份 9 m
+十几位 67 m
+十几倍 24 m
+十几元 6 m
+十几公斤 2 m
+十几公里 8 m
+十几分 5 m
+十几分钟 194 m
+十几包 4 m
+十几匹 10 m
+十几千米 7 m
+十几厘米 8 m
+十几发 2 m
+十几口 7 m
+十几句 6 m
+十几只 36 m
+十几台 2 m
+十几号 3 m
+十几名 67 m
+十几吨 3 m
+十几员 2 m
+十几圈 4 m
+十几场 4 m
+十几块 47 m
+十几声 3 m
+十几处 10 m
+十几天 109 m
+十几头 16 m
+十几套 5 m
+十几家 48 m
+十几对 4 m
+十几封 3 m
+十几尊 5 m
+十几层 6 m
+十几岁 235 m
+十几平方米 2 m
+十几年 575 m
+十几年如一日 4 l
+十几年来 3 l
+十几座 14 m
+十几张 24 m
+十几户 10 m
+十几所 9 m
+十几批 2 m
+十几把 7 m
+十几招 12 m
+十几排 2 m
+十几支 6 m
+十几斤 15 m
+十几日 7 m
+十几本 2 m
+十几条 154 m
+十几杯 7 m
+十几枚 12 m
+十几枝 5 m
+十几架 10 m
+十几株 2 m
+十几样 6 m
+十几根 17 m
+十几桌 6 m
+十几棵 9 m
+十几次 36 m
+十几步 40 m
+十几滴 2 m
+十几点 2 m
+十几片 7 m
+十几瓶 2 m
+十几盆 3 m
+十几盏 3 m
+十几碗 3 m
+十几种 54 m
+十几秒 9 m
+十几篇 6 m
+十几米 73 m
+十几粒 5 m
+十几美元 2 m
+十几艘 2 m
+十几节 6 m
+十几趟 2 m
+十几路 7 m
+十几载 3 m
+十几辆 17 m
+十几遍 7 m
+十几道 7 m
+十几部 18 m
+十几里 63 m
+十几门 9 m
+十几间 8 m
+十几面 2 m
+十几页 4 m
+十几项 4 m
+十几颗 17 m
+十出 3 m
+十出戏 3 l
+十刀 11 m
+十分 16428 m
+十分之一 149 m
+十分关心 3 l
+十分困难 3 i
+十分复杂 3 i
+十分多谢 3 i
+十分宝贵 3 i
+十分必要 3 l
+十分想念 3 l
+十分明确 3 i
+十分注意 3 i
+十分满意 3 l
+十分激烈 3 l
+十分相似 3 i
+十分艰巨 3 i
+十分迅速 3 nz
+十分重视 3 l
+十分钟 145 m
+十分高兴 3 l
+十划 3 n
+十则 11 m
+十副 2 m
+十加仑 3 ns
+十包 3 m
+十包装 3 l
+十匙 3 n
+十匹 35 m
+十区 3 j
+十十 4 m
+十十五五 3 m
+十千 2 m
+十升 3 m
+十华里 5 m
+十卷 68 m
+十厘米 3 m
+十发 17 j
+十发十中 3 l
+十变五化 3 l
+十口 22 m
+十口相传 3 i
+十句 36 m
+十句话 3 l
+十只 61 m
+十台 2 m
+十叶 3 t
+十号 9 m
+十名 355 m
+十吨 2 m
+十员 30 m
+十周 2 t
+十周年 12 m
+十品 2 m
+十响 4 m
+十四 1634 m
+十四一眼 4 m
+十四万 15 m
+十四万余 2 m
+十四两 3 m
+十四个 77 m
+十四五 10 m
+十四五个 5 m
+十四五岁 54 m
+十四五斤 4 m
+十四五里 5 m
+十四件 2 m
+十四位 3 m
+十四元 3 m
+十四分 3 m
+十四卷 5 m
+十四只 4 m
+十四号 2 m
+十四名 12 m
+十四员 2 m
+十四周岁 8 m
+十四回 4 m
+十四块 3 m
+十四大 224 j
+十四天 12 m
+十四家 4 m
+十四届 138 m
+十四岁 101 m
+十四年 496 m
+十四座 2 m
+十四开 2 m
+十四张 2 m
+十四所 258 m
+十四打 2 m
+十四把 3 m
+十四文 4 m
+十四日 90 m
+十四时 3 t
+十四条 45 m
+十四次 3 m
+十四点 32 m
+十四点六 2 m
+十四点点 4 m
+十四目 3 m
+十四碗 2 m
+十四种 3 m
+十四篇 4 m
+十四行 14 m
+十四行诗 42 l
+十四记 3 m
+十四身 2 m
+十四载 19 m
+十四道 22 m
+十四部 2 m
+十四项 3 m
+十四颗 2 m
+十回 13 m
+十团 2 m
+十围五攻 3 i
+十国 3 ns
+十国集团 3 nt
+十圆 3 z
+十圈 3 m
+十场 15 m
+十块 83 m
+十块钱 3 nz
+十坪 3 ns
+十堂 6 m
+十堂课 3 n
+十堆 2 m
+十堰 3611 ns
+十堰大学 3 ns
+十堰市 3089 ns
+十堰电信 3 ns
+十堰网盟 3 vn
+十声 7 m
+十处 11 m
+十多 50 m
+十多万 40 m
+十多万两 2 m
+十多万元 8 m
+十多丈 18 m
+十多个 125 m
+十多二十名 2 m
+十多亩 3 m
+十多人 3 l
+十多亿 2 m
+十多位 13 m
+十多元 2 m
+十多公里 3 m
+十多具 3 m
+十多分 3 m
+十多分钟 10 m
+十多匹 2 m
+十多只 7 m
+十多台 2 m
+十多号 3 m
+十多名 78 m
+十多块 6 m
+十多处 11 m
+十多天 84 m
+十多头 5 m
+十多家 15 m
+十多岁 24 m
+十多年 465 m
+十多座 4 m
+十多张 3 m
+十多户 2 m
+十多所 4 m
+十多招 6 m
+十多支 2 m
+十多斤 3 m
+十多日 6 m
+十多本 4 m
+十多条 9 m
+十多杯 2 m
+十多枚 8 m
+十多枝 2 m
+十多根 4 m
+十多棵 4 m
+十多次 12 m
+十多步 8 m
+十多碗 3 m
+十多种 21 m
+十多米 12 m
+十多类 8 m
+十多艘 4 m
+十多起 257 m
+十多辆 7 m
+十多遍 3 m
+十多道 3 m
+十多部 4 m
+十多里 31 m
+十多页 2 m
+十夜 7 t
+十大 1619 j
+十大元帅 3 nz
+十大块 3 m
+十大建设 3 l
+十大类 3 m
+十天 546 m
+十天份 3 nz
+十夫桡椎 3 n
+十夫楺椎 3 n
+十头 10 m
+十奖 3 nz
+十套 16 m
+十好几个 4 m
+十好几里 2 m
+十妹 3 n
+十姊妹 3 n
+十字 187 nz
+十字军 258 n
+十字军东 3 l
+十字坡 11 n
+十字型 2 n
+十字头 3 l
+十字形 59 n
+十字支撑 3 n
+十字星 3 nz
+十字架 150 n
+十字架形 3 l
+十字线 2 l
+十字绣 3 n
+十字花 3 n
+十字花科 36 nz
+十字街 28 n
+十字街口 40 l
+十字街头 70 l
+十字路 3 l
+十字路口 170 l
+十字路头 3 l
+十字键 3 n
+十字镐 3 n
+十宗 4 m
+十客 3 j
+十宣 3 j
+十室九匮 3 i
+十室九空 14 i
+十室容贤 3 i
+十家 75 m
+十寒一暴 3 i
+十对 7 d
+十封 2 m
+十封信 3 nz
+十尊 14 m
+十小时 3 j
+十尺 3 m
+十局 4 j
+十层 12 m
+十层楼 3 n
+十届 157 m
+十岁 245 m
+十岁时 3 l
+十巷 3 nz
+十帧 3 m
+十席 5 m
+十常八九 3 l
+十幅 11 d
+十幢 3 m
+十平方 3 m
+十平方米 6 m
+十年 3649 m
+十年一剑 3 l
+十年九旱 5 l
+十年代 2 t
+十年内乱 3 l
+十年动乱 21 l
+十年如一日 4 t
+十年寒窗 136 i
+十年怕井绳 10 l
+十年教训 3 n
+十年树木 3 i
+十年浩劫 31 l
+十年生聚 3 i
+十年磨一剑 6 l
+十年磨剑 3 l
+十年窗下 3 i
+十年规划 3 l
+十年读书 3 n
+十年间 3 t
+十床 4 m
+十度 2 d
+十座 8 m
+十廿 2 m
+十廿年 2 m
+十开 2 m
+十张 13 m
+十强 3 j
+十强县 3 ns
+十强赛 3 nz
+十恶 3 n
+十恶不赦 64 i
+十恶五逆 3 j
+十成 99 m
+十成九稳 3 i
+十成把握 3 l
+十戒 3 n
+十战十胜 3 nz
+十户 21 m
+十所 8 j
+十手争指 3 i
+十手所指 3 i
+十打 3 m
+十把 8 m
+十担 8 m
+十拏九稳 3 l
+十招 93 m
+十拳 6 m
+十拷九棒 3 v
+十拿九稳 50 i
+十指 98 j
+十指关 10 l
+十指如椎 3 n
+十指连心 9 l
+十捉九着 3 i
+十排 2 m
+十支 19 m
+十数 85 m
+十数万 23 m
+十数万元 2 m
+十数丈 21 m
+十数两 2 m
+十数个 74 m
+十数倍 2 m
+十数匹 3 m
+十数只 5 m
+十数名 2 m
+十数员 4 m
+十数回 2 m
+十数处 2 m
+十数家 5 m
+十数对 2 m
+十数尾 3 m
+十数年 33 m
+十数座 4 m
+十数招 2 m
+十数日 16 m
+十数杯 2 m
+十数枝 4 m
+十数步 5 m
+十数碗 4 m
+十数种 4 m
+十数米 2 m
+十数粒 2 m
+十数艘 3 m
+十数行 2 m
+十数辆 2 m
+十数里 24 m
+十数间 3 m
+十文 13 nz
+十斤 94 m
+十方 42 m
+十日 244 t
+十日一水 3 nz
+十日之饮 3 i
+十日份 3 nz
+十日并出 3 i
+十日游 3 nz
+十日谈 20 nz
+十时 2 t
+十星期 3 t
+十星级 6 l
+十晚 3 t
+十景 3 n
+十曲 3 m
+十月 1030 t
+十月份 24 mq
+十月初 11 t
+十月十日 3 nz
+十月底 12 t
+十月革命 409 nz
+十月革命节 2 nz
+十有八九 94 m
+十期 3 t
+十本 11 m
+十朵 3 m
+十朵花 3 n
+十束 3 m
+十条 95 m
+十来 3 t
+十来个 3 d
+十来分 3 d
+十来天 3 d
+十杯 3 m
+十杯水 3 nz
+十杯酒 3 nz
+十杰 6 j
+十枚 9 m
+十枝 3 m
+十枪 2 m
+十架 7 m
+十栋 3 m
+十株 4 m
+十样 3 d
+十样锦 3 l
+十根 80 m
+十格 3 n
+十框 3 m
+十桌 4 m
+十档 3 m
+十桶 5 m
+十棵 2 m
+十楼 3 n
+十次 335 m
+十次革命 3 nz
+十款 7 m
+十步 73 d
+十步之内 3 l
+十步芳草 3 nz
+十步香草 3 nz
+十步香车 3 nz
+十死一生 3 i
+十死不问 3 l
+十死九活 3 i
+十段 25 m
+十段变速 3 n
+十泡 3 n
+十洞 3 n
+十派 3 m
+十浆五馈 3 n
+十渡 5 nz
+十滴 3 m
+十滴水 5 nz
+十炮 3 j
+十点 145 m
+十点五 3 m
+十点钟 3 m
+十爷 3 n
+十片 4 m
+十片装 3 nz
+十版 3 nz
+十班 3 m
+十瓶 10 m
+十瓶装 3 l
+十瓶酒 3 nz
+十生九死 3 i
+十甲 3 j
+十男 3 n
+十番 13 m
+十番乐 3 i
+十番锣鼓 3 i
+十病九痛 3 i
+十百 129 m
+十百千万 2 m
+十盏 4 m
+十盒 5 m
+十目 4 m
+十目所视 3 l
+十眠九坐 3 n
+十碗 6 m
+十磅 4 m
+十种 85 m
+十科 3 nz
+十秒 8 m
+十秒钟 3 i
+十立方 3 m
+十站 3 m
+十章 8 m
+十竹斋 3 nz
+十等 11 m
+十筐 3 m
+十筒 3 n
+十箱 3 m
+十篇 15 m
+十米 49 m
+十米九糠 3 nz
+十类 14 m
+十粒 12 m
+十级 12 m
+十线 3 m
+十组 3 m
+十罐 3 m
+十羊九牧 3 n
+十美元 2 m
+十美图 3 j
+十股 3 m
+十船 3 j
+十艘 16 m
+十色 3 n
+十节 10 t
+十节课 3 n
+十英里 2 m
+十营 3 n
+十行 12 j
+十行俱下 3 i
+十行字 3 nz
+十行纸 3 nz
+十街 3 ns
+十袋 4 m
+十角 3 m
+十角形 3 n
+十记 51 m
+十诫 3 v
+十课 3 n
+十赌九骗 3 vn
+十起 3 m
+十趟 3 m
+十足 732 d
+十足把握 3 l
+十足虫 3 n
+十路 42 m
+十车 9 m
+十转九空 3 i
+十轮 21 m
+十载 43 m
+十载寒窗 2 i
+十辆 21 m
+十辆车 3 n
+十辈子 5 m
+十辑 2 m
+十边 3 d
+十边形 3 n
+十运会 3 j
+十进位 3 n
+十进位制 3 l
+十进位码 3 l
+十进值 3 l
+十进制 64 j
+十进法 3 l
+十进管 3 j
+十连 3 d
+十连技 3 nz
+十通 5 nz
+十遍 25 m
+十道 306 m
+十道菜 3 n
+十邻 3 n
+十部 52 m
+十里 414 m
+十里八乡 18 i
+十里坪 6 ns
+十里堡 7 ns
+十里洋场 9 ns
+十里铺 4 ns
+十里长亭 3 nz
+十里香 3 z
+十重 3 m
+十针 3 j
+十钱 3 n
+十锅 3 n
+十锭 5 m
+十门 13 m
+十间 6 t
+十队 12 m
+十集 2 m
+十雨五风 3 i
+十面 14 m
+十面体 3 d
+十面埋伏 43 i
+十页 3 m
+十顶 3 m
+十顷 14 m
+十项 41 m
+十项全能 3 nz
+十项运动 3 nz
+十颗 12 m
+十题 3 n
+十风五雨 3 i
+十首 16 m
+十首歌 3 m
+十驾 2 m
+十魔九难 3 i
+十鼠同穴 3 i
+卂 51 zg
+千 3728 m
+千一 2 m
+千万 2361 m
+千万个 18 m
+千万买邻 3 i
+千万人次 4 m
+千万亿 3 m
+千万倍 5 m
+千万元 38 m
+千万光年 2 m
+千万分之一 5 m
+千万别 3 i
+千万匹 2 m
+千万千万 17 m
+千万千瓦 3 m
+千万只 16 m
+千万名 6 m
+千万吨 17 m
+千万头 5 m
+千万家 3 m
+千万富翁 3 nr
+千万岁 2 m
+千万年 46 m
+千万度 2 m
+千万座 3 m
+千万户 2 m
+千万把 6 m
+千万支 3 m
+千万朵 2 m
+千万条 11 m
+千万枚 2 m
+千万根 4 m
+千万次 6 m
+千万片 3 m
+千万盏 2 m
+千万种 10 m
+千万级 2 m
+千万缕 2 m
+千万美元 25 m
+千万英镑 3 m
+千万遍 5 m
+千万部 2 m
+千万里 8 m
+千万重 3 m
+千万锭 2 m
+千万颗 2 m
+千丈 85 m
+千三 30 m
+千上万 10 m
+千不该 3 d
+千与千寻 3 i
+千丝 3 m
+千丝万缕 108 i
+千两 16 m
+千个 59 m
+千乘万骑 2 i
+千乘之国 2 i
+千乡 18 m
+千了万当 3 i
+千了百了 3 l
+千了百当 3 i
+千二八百 3 m
+千五 123 m
+千五点 8 m
+千亩 294 m
+千人一面 6 m
+千人在线 3 i
+千人所指 3 i
+千亿 7 m
+千亿元 7 m
+千亿吨 3 m
+千亿美元 7 m
+千仇万恨 3 i
+千仓万箱 3 n
+千仞无枝 3 nr
+千代 3 m
+千代田 4 nr
+千代田区 3 ns
+千件 16 m
+千份 10 m
+千伏 91 q
+千伏安 3 i
+千伶百俐 7 i
+千位 9 m
+千余 177 m
+千余万 3 m
+千余个 7 m
+千余亩 2 m
+千余件 134 m
+千余位 5 m
+千余元 3 m
+千余公里 11 m
+千余千米 2 m
+千余名 25 m
+千余吨 2 m
+千余处 2 m
+千余头 3 m
+千余家 6 m
+千余帐 2 m
+千余平方公里 2 m
+千余年 64 m
+千余座 7 m
+千余张 3 m
+千余招 8 m
+千余斤 5 m
+千余条 4 m
+千余株 2 m
+千余种 7 m
+千余米 8 m
+千余级 2 m
+千余艘 2 m
+千余里 16 m
+千余间 4 m
+千佛山 11 nr
+千佛岩 6 nr
+千佛殿 4 nr
+千佛洞 54 nr
+千例 2 m
+千依万顺 3 i
+千依百顺 27 i
+千倍 27 m
+千儿八百 14 m
+千元 389 m
+千元级 3 l
+千兆 13 m
+千兆比特 2 nr
+千克 1678 q
+千八百 2 m
+千八百九十九万余两 2 m
+千公里 11 q
+千公顷 1026 q
+千兵万马 3 i
+千军 12 n
+千军万马 172 i
+千军易得 5 i
+千刀 29 m
+千刀万剐 108 i
+千分 40 m
+千分之 3 i
+千分之一 36 m
+千分制 3 n
+千分号 3 m
+千分尺 26 m
+千分数 3 m
+千分率 3 n
+千分表 4 n
+千则 2 m
+千利休 15 nr
+千利体 4 n
+千副 3 m
+千匹 19 m
+千千 6 m
+千千万 6 m
+千千万万 174 m
+千千万万个 16 m
+千千万万只 2 m
+千千万万家 2 m
+千千万万对 2 m
+千千万万根 2 m
+千千万万颗 3 m
+千千克 2 q
+千千米 13 q
+千千结 3 i
+千千阙歌 3 nr
+千升 3 m
+千卡 291 q
+千卷 4 m
+千发 2 m
+千变万化 120 l
+千变万状 3 i
+千变万轸 3 nr
+千叠 5 m
+千口 19 m
+千古 620 ns
+千古一律 3 l
+千古一时 3 i
+千古一辙 3 i
+千古不变 5 i
+千古不朽 3 i
+千古不灭 3 i
+千古不磨 3 i
+千古佳话 8 i
+千古兴亡 3 i
+千古奇闻 3 i
+千古独步 3 i
+千古绝唱 9 l
+千古绝调 3 l
+千古罪人 35 n
+千古遗恨 3 i
+千古风范 3 l
+千古骂名 3 i
+千句 2 m
+千只 18 m
+千叮万嘱 15 i
+千叮咛 3 l
+千叮咛万嘱咐 19 l
+千台 2 m
+千叶 65 m
+千叶县 5 nr
+千名 83 m
+千吨 48 m
+千吨当量 3 n
+千吨级 266 b
+千员 7 m
+千周 3 m
+千呼万唤 26 i
+千四 15 m
+千四两道 14 m
+千回 3 m
+千回万转 3 i
+千回百折 3 i
+千回百转 11 i
+千块 16 m
+千声 4 m
+千处 3 m
+千多 8 m
+千多万吨 2 m
+千多万年 4 m
+千多两 2 m
+千多个 12 m
+千多亿吨 3 m
+千多倍 2 m
+千多元 2 m
+千多名 2 m
+千多岁 5 m
+千多年 50 m
+千多种 15 m
+千多米 6 m
+千多集 2 m
+千夫 37 nr
+千夫所指 14 i
+千夫指 3 nz
+千头 7 m
+千头万序 3 i
+千头万绪 60 i
+千奇百怪 74 i
+千奋勇 2 i
+千套 2 m
+千姿万态 3 i
+千姿百态 87 i
+千娇百媚 34 i
+千孔百疮 3 i
+千字 3 n
+千字文 31 n
+千学峰 3 nr
+千宗易 3 nr
+千家 57 m
+千家万户 229 i
+千家峒 3 ns
+千家诗 3 nr
+千对 2 m
+千尊 4 m
+千尺 676 m
+千层 32 m
+千层底 9 l
+千层浪 3 l
+千层饼 3 n
+千居里 3 nr
+千山 60 ns
+千山万壑 7 i
+千山万水 33 i
+千山区 3 ns
+千山风景区 2 ns
+千岁 60 m
+千岁一时 3 i
+千岁爷 3 n
+千岁鹤归 3 i
+千岛 62 ns
+千岛湖 29 ns
+千岛群岛 3 ns
+千岩万壑 4 i
+千岩竞 4 nr
+千岩竞秀 3 nr
+千峰 17 m
+千峰万壑 3 i
+千峰百嶂 3 i
+千左右 2 m
+千巧万 2 i
+千差万别 75 i
+千差万错 3 i
+千帆竞发 3 i
+千帐 2 m
+千幅 8 m
+千平方公里 5 m
+千平方米 5 m
+千年 1040 m
+千年一律 3 l
+千年一遇 3 i
+千年健 3 n
+千年怪兽 3 i
+千年泪 3 i
+千年湖 3 l
+千年老二 3 i
+千年虫 3 n
+千度 5 m
+千座 11 m
+千张 535 m
+千形万状 3 i
+千态万状 3 i
+千思万想 9 i
+千思万虑 3 i
+千恩万谢 44 i
+千惠子 2 nr
+千愁 3 n
+千愁万恨 3 i
+千愁万绪 3 i
+千户 480 m
+千户所 3 i
+千所 9 m
+千手 38 m
+千手佛 3 i
+千手堂 4 i
+千手观音 54 i
+千把 27 m
+千招 15 m
+千推万阻 3 i
+千支 3 m
+千数 11 m
+千数两 2 m
+千数百 3 m
+千文 4 m
+千斤 495 m
+千斤重担 3 n
+千斤顶 30 i
+千方 8 m
+千方万计 3 i
+千方百计 430 i
+千日 15 m
+千日红 3 l
+千明勋 3 nr
+千朵 4 m
+千机变 3 i
+千村万户 3 l
+千村万落 3 l
+千条 39 m
+千条万条 13 i
+千条万端 3 i
+千条万绪 3 i
+千条万缕 3 i
+千杯 8 m
+千杯万盏 3 m
+千杯不醉 3 l
+千枚 5 m
+千枚岩 36 nr
+千枝 4 m
+千架 21 m
+千柱 3 m
+千株 7 m
+千样 7 m
+千根 6 m
+千次 16 m
+千款 2 m
+千步 2200 m
+千水万山 3 i
+千汇万状 3 nz
+千沟万壑 2 i
+千滴 4 m
+千灾百难 3 i
+千点 6 m
+千片 2 m
+千状万态 3 l
+千状万端 3 l
+千王之王 3 nr
+千瓦 231 m
+千瓦小时 10 q
+千瓦时 46 q
+千生万劫 3 i
+千生万死 3 i
+千番 3 m
+千疮百孔 71 i
+千疮百痍 3 i
+千百 76 m
+千百万 85 m
+千百万个 3 m
+千百万只 3 m
+千百万年 3 m
+千百两 2 m
+千百个 34 m
+千百件 4 m
+千百份 4 m
+千百位 3 m
+千百倍 9 m
+千百口 8 m
+千百只 10 m
+千百号 2 m
+千百名 6 m
+千百回 3 m
+千百块 2 m
+千百处 2 m
+千百头 5 m
+千百家 2 m
+千百对 3 m
+千百年 309 m
+千百年来 3 l
+千百度 5 m
+千百成 5 m
+千百户 4 m
+千百把 5 m
+千百数 7 m
+千百斤 13 m
+千百条 10 m
+千百枚 3 m
+千百枝 2 m
+千百样 2 m
+千百根 3 m
+千百次 13 m
+千百片 2 m
+千百盏 3 m
+千百种 15 m
+千百缕 2 m
+千百遍 12 m
+千百道 3 m
+千百里 3 m
+千百面 2 m
+千盏菊 3 nr
+千真万真 3 i
+千真万确 132 i
+千眼 10 m
+千磨百折 3 i
+千禧年 3 nr
+千禧条 3 nr
+千禧龙 3 nr
+千禾夫 2 nr
+千秋 258 nr
+千秋万世 4 i
+千秋万事 3 i
+千秋万代 22 i
+千秋万古 3 i
+千秋万岁 11 i
+千秋万载 56 i
+千秋业 2 nr
+千秋人物 3 i
+千秋伟业 3 nr
+千秋功罪 3 i
+千秋功过 3 i
+千秋大业 8 i
+千秋永垂 3 nr
+千秋雪 3 nr
+千种 50 m
+千秒 15 m
+千穗谷 3 nr
+千立方米 3 m
+千章万句 3 i
+千端万绪 3 i
+千等 4 m
+千篇 2 m
+千篇一律 64 l
+千米 4992 q
+千粒重 3 l
+千红万紫 3 i
+千纸鹤 3 i
+千绪万端 3 i
+千美元 3 m
+千群 3 m
+千般 64 d
+千艘 9 m
+千英宇 2 nr
+千虑一失 3 i
+千虑一得 3 i
+千行 13 m
+千补百衲 3 nr
+千言 3 n
+千言万语 64 i
+千言万说 3 i
+千语万言 3 i
+千赫 36 q
+千车 3 m
+千载 60 m
+千载一会 3 l
+千载一合 3 i
+千载一圣 3 i
+千载一弹 3 i
+千载一日 3 i
+千载一时 5 i
+千载一逢 3 i
+千载一遇 3 i
+千载不变 3 i
+千载奇遇 3 i
+千载难逢 95 i
+千载难遇 3 i
+千辆 10 m
+千辛万苦 117 i
+千遍 13 m
+千遍万遍 7 l
+千道 4 m
+千部 10 m
+千部一腔 3 m
+千里 742 q
+千里一曲 3 m
+千里之任 3 i
+千里之堤 6 i
+千里之志 3 i
+千里之行 6 i
+千里之足 3 i
+千里光 2 nr
+千里冰封 11 ns
+千里同风 3 i
+千里命驾 3 nr
+千里姻缘一线牵 8 i
+千里无烟 3 i
+千里犹面 3 i
+千里目 3 i
+千里眼 21 i
+千里神交 3 i
+千里结言 3 i
+千里花 3 i
+千里莼羹 3 nz
+千里路 3 ns
+千里达 3 nr
+千里迢迢 151 i
+千里送鹅毛 2 i
+千里镜 3 nr
+千里香 3 nr
+千里马 75 ns
+千里驹 4 nr
+千里骏骨 3 nr
+千里鹅毛 3 i
+千重 12 m
+千野 3 n
+千金 251 n
+千金一刻 3 i
+千金一壸 3 nz
+千金一掷 3 i
+千金一瓠 3 nr
+千金一笑 3 i
+千金一诺 8 nr
+千金之子 3 i
+千金之家 3 l
+千金之躯 3 i
+千金买笑 3 i
+千金子 3 nr
+千金子藤 3 nr
+千金小姐 41 nr
+千金市骨 3 i
+千金弊帚 3 n
+千金敝帚 3 i
+千金方 12 n
+千金难买 6 l
+千钧 16 nr
+千钧一发 120 i
+千钧为轻 3 i
+千钧之重 3 i
+千钧石 3 nr
+千钧重负 3 i
+千锤 6 m
+千锤百炼 63 i
+千锤百链 3 n
+千门 11 m
+千门万户 12 i
+千门八将 3 i
+千间 2 m
+千阳 4 ns
+千阳县 3 ns
+千随百顺 3 i
+千难万苦 3 i
+千难万险 17 i
+千难万难 63 i
+千面 3 m
+千面人 3 i
+千页群岛 3 n
+千顷 24 m
+千项 5 m
+千颗 11 m
+千首 7 m
+千骄百媚 3 i
+千鸟 3 n
+千龄万代 3 n
+千龙网 60 i
+卅 33 zg
+卅一日 2 m
+卅三 3 m
+卅年 5 m
+卅日 2 m
+升 4813 zg
+升上 3 v
+升上去 3 v
+升上来 3 v
+升为 3 v
+升仙 3 n
+升任 334 v
+升值 511 v
+升入 135 v
+升出 3 v
+升出来 3 v
+升到 3 v
+升力 3 n
+升势 33 n
+升势受阻 3 l
+升升 3 v
+升华 240 nz
+升华作用 3 n
+升华热 3 n
+升压 26 v
+升号 3 n
+升回 3 v
+升回去 3 l
+升回来 3 l
+升国旗 3 n
+升堂 20 n
+升堂入室 3 n
+升堂拜母 3 n
+升天 85 v
+升天节 8 n
+升好 3 v
+升学 188 n
+升学主义 3 n
+升学压力 3 n
+升学率 381 n
+升学考试 3 n
+升官 144 n
+升官发财 81 l
+升官进爵 2 n
+升山采珠 3 nz
+升帆 8 nz
+升帐 43 n
+升幂 2 n
+升幂级数 3 v
+升幅 44 n
+升平 99 n
+升序 3 n
+升座 3 v
+升得 3 v
+升息 70 v
+升成 3 v
+升技 3 n
+升挡 3 v
+升斗 3 vn
+升斗小民 5 n
+升旗 367 n
+升旗仪式 3 l
+升旗典礼 3 nz
+升旗台 3 l
+升旗手 3 l
+升机 4 n
+升来 3 v
+升来升去 3 l
+升格 122 n
+升档 3 v
+升水 11 v
+升汞 3 nz
+升沉 10 v
+升涨 3 v
+升清降浊 3 n
+升温 234 v
+升温快 3 l
+升火 3 v
+升点 3 n
+升班 5 v
+升班考试 3 n
+升班马 56 nz
+升空 240 vn
+升等考试 3 n
+升级 3593 vn
+升级包 3 l
+升级库 3 n
+升级快 3 l
+升级成 3 l
+升级换代 63 l
+升级档 3 n
+升级版 3 v
+升结肠 4 l
+升职 209 v
+升腾 258 v
+升至 292 v
+升船机 47 n
+升药 3 v
+升读 3 v
+升调 4 v
+升贴 3 v
+升起 904 v
+升迁 259 v
+升迁制度 3 n
+升迁管道 3 l
+升过 3 v
+升速 3 v
+升阳 5 n
+升阶 3 n
+升降 463 v
+升降口 3 n
+升降台 148 n
+升降器 3 n
+升降式 2 n
+升降机 25 n
+升降条件 3 n
+升降梯 3 n
+升降级 3 n
+升降舵 22 n
+升降记号 3 n
+升降车 3 n
+升限 76 v
+升顶 3 n
+升高 1142 v
+升麻 5 n
+升龙 6 nz
+午 897 t
+午休 39 ns
+午前 21 t
+午后 331 t
+午夜 231 t
+午夜凶铃 3 v
+午夜惊魂 3 n
+午安 2 ns
+午宴 37 n
+午市 3 ns
+午时 146 t
+午时茶 3 n
+午炮 3 n
+午眠 3 v
+午睡 61 v
+午膳 3 n
+午觉 58 n
+午门 3000 ns
+午间 92 t
+午餐 267 n
+午餐会 21 n
+午餐时间 3 n
+午餐肉 3 n
+午餐费 3 n
+午饭 491 n
+午饭时间 3 n
+午马 4 ns
+卉 37 ng
+半 8201 m
+半一盘 2 m
+半丈 21 m
+半三不四 3 m
+半上半下 3 t
+半上落下 3 i
+半下 14 m
+半世 26 t
+半世纪 35 t
+半丝 31 m
+半丝半缕 3 i
+半两 47 m
+半两数 2 m
+半个 2233 m
+半个世纪 3 t
+半中腰 3 l
+半主动 5 n
+半买半送 3 n
+半乳糖 3 n
+半乳聚糖 3 n
+半些 2 m
+半交换期 3 n
+半亩 12 m
+半亿 3 m
+半仙 12 n
+半件 13 m
+半价 31 n
+半价优待 3 i
+半价票 3 n
+半份 3 m
+半位点 3 n
+半低不高 3 l
+半侧 9 n
+半信不信 3 i
+半信半疑 101 i
+半倒 3 d
+半停产 14 n
+半儿 3 m
+半元音 6 n
+半兜 2 m
+半八度 4 m
+半公开 8 m
+半公斤 7 m
+半公里 8 m
+半具 2 m
+半兽 3 n
+半兽人 3 i
+半册 2 m
+半冬性 3 n
+半决赛 549 n
+半决赛权 3 n
+半分 464 m
+半分毫 4 m
+半分钟 55 m
+半切牙术 3 l
+半制品 3 n
+半剑 5 n
+半副 2 m
+半功率点 3 n
+半劳动力 3 l
+半勺 8 m
+半包 5 m
+半包围 3 n
+半千 3 m
+半半拉拉 3 ns
+半半路路 3 m
+半单元 3 m
+半单簇 3 i
+半卷 15 m
+半厘米 2 m
+半双 2 m
+半双工 3 nr
+半口 12 m
+半句 353 m
+半句话 3 l
+半只 66 m
+半叶 112 t
+半吊子 17 i
+半吐半露 3 i
+半吞半吐 3 i
+半周 7 t
+半响 23 m
+半固定桥 3 n
+半圆 37 n
+半圆型 2 n
+半圆形 87 n
+半圆规 3 n
+半圈 23 m
+半地穴式 22 b
+半场 148 n
+半块 32 m
+半坡 62 n
+半坪 3 n
+半城 9 n
+半堵 9 m
+半壁 32 n
+半壁山河 3 ns
+半壁店 2 n
+半壁江山 57 ns
+半壁河山 4 ns
+半声 12 m
+半夏 41 n
+半夏蛋白 3 l
+半多 3 m
+半夜 970 m
+半夜三更 108 t
+半夜里 3 t
+半大不小 2 l
+半天 2617 m
+半天空 3 nr
+半失业 3 n
+半头 267 m
+半套 6 m
+半子 12 n
+半完满环 3 i
+半官方 3 nr
+半家 3 m
+半寄生物 3 n
+半寸 80 m
+半导 2 n
+半导体 866 n
+半导体业 2 n
+半导体器件 12 n
+半导体存储器 19 n
+半导体技术 6 n
+半导体芯片 2 n
+半封建 227 ns
+半封建半 3 nr
+半封建社会 102 l
+半封闭 294 b
+半小时 3 b
+半尺 153 m
+半局 3 n
+半层 2 m
+半屏山 2 nr
+半山 126 ns
+半山上 3 l
+半山区 13 ns
+半山坡 14 ns
+半山腰 67 l
+半岁 16 m
+半岛 1520 n
+半岛园 3 n
+半岛网 3 n
+半工半续 3 l
+半工半读 53 l
+半左右 26 m
+半幅 15 m
+半干旱 3 n
+半干法 6 n
+半年 1621 m
+半年份 3 n
+半年刊 3 n
+半年前 99 t
+半年度 3 mq
+半年报 8 n
+半年线 3 n
+半床 7 m
+半度 2 n
+半座 8 m
+半开 45 m
+半开化 3 l
+半开门儿 3 l
+半张 75 m
+半弯 3 n
+半影 18 n
+半径 633 n
+半径大小 3 l
+半懂不懂 8 l
+半成 13 m
+半成品 117 n
+半截 592 m
+半截儿 6 m
+半截入土 2 i
+半截八句 2 m
+半截刀 3 m
+半截子 28 m
+半截脸 2 i
+半截道 3 m
+半截面罩 3 n
+半扇 28 m
+半把 3 m
+半抗原 3 n
+半折 3 m
+半拉 7 nr
+半拉子 2 nr
+半拍 3 n
+半招 50 m
+半拳 3 m
+半挂车 2 l
+半接 2 b
+半推 3 b
+半推半就 23 i
+半掩门 4 i
+半支 12 m
+半支莲 2 nr
+半数 1213 m
+半数以上 2 l
+半数以下 3 l
+半数左右 6 m
+半数票 2 n
+半文 19 m
+半文不值 3 l
+半文不白 3 l
+半文半白 7 l
+半文盲 23 n
+半斗 2 m
+半斤 337 m
+半斤八两 38 i
+半斤八面 3 i
+半新不旧 23 i
+半新半旧 3 i
+半方 2 m
+半旗 3 n
+半日 449 t
+半日一 3 m
+半日分 2 m
+半日制 3 n
+半日头 4 m
+半日方 2 m
+半日潮 21 nr
+半日路 2 m
+半日道 2 m
+半日闲 3 i
+半旧 33 z
+半时 3 t
+半时半刻 3 t
+半明半暗 11 i
+半晌 1725 m
+半晌回 3 m
+半晌家 2 m
+半晌方 16 m
+半晌道 14 m
+半曲 3 m
+半月 498 t
+半月刊 43 n
+半月弯刀 3 i
+半月形 29 n
+半月板 14 n
+半月谈 28 i
+半期 57 t
+半本 25 n
+半本原环 3 n
+半机械化 3 l
+半条 65 m
+半条命 3 n
+半杯 50 m
+半板 3 n
+半枚 89 m
+半枝 3 m
+半架 7 m
+半栋 3 m
+半根 26 m
+半格 2 n
+半桩 9 m
+半桶 18 m
+半桶水 3 n
+半梦半醒 8 i
+半棵 3 m
+半次 5 m
+半步 222 m
+半死 39 n
+半死不活 80 i
+半死半生 3 i
+半死辣活 3 n
+半殖民地 394 n
+半殖民地化 18 n
+半段 44 m
+半毫 2 m
+半波 4 n
+半波整流 3 i
+半波片 3 n
+半波电位 3 n
+半流体 3 n
+半流质 5 n
+半涂而废 3 i
+半涂而罢 3 nr
+半深海相 3 i
+半湿润 3 n
+半滴 9 m
+半潜船 3 n
+半点 1590 m
+半点儿 46 m
+半点口 3 m
+半点折 2 m
+半点本 4 m
+半点钟 3 m
+半焦 2 n
+半熟 3 n
+半片 27 m
+半环 6 n
+半球 219 n
+半球型 3 n
+半球形 3 n
+半球状 3 n
+半球盘 3 n
+半璧江山 3 i
+半瓢 13 m
+半瓶 39 m
+半瓶子晃荡 3 nr
+半瓶子醋 7 n
+半瓶醋 5 n
+半生 118 n
+半生不熟 33 i
+半生半熟 3 i
+半生尝胆 3 i
+半生行 2 n
+半甲 3 b
+半甲基化 3 n
+半疑半信 3 l
+半痴不颠 3 i
+半白 3 n
+半百 13 m
+半盆 12 m
+半盏 32 m
+半盒 10 m
+半盔 3 n
+半盘 9 n
+半目 2 n
+半直积 3 n
+半真半假 29 i
+半眼 7 m
+半睡半醒 3 n
+半睡眠状 3 n
+半码 3 n
+半碗 119 m
+半磅 2 m
+半神 3 n
+半票 7 n
+半票价 3 n
+半私营 3 i
+半种 2 m
+半秒 3 m
+半秒钟 3 i
+半程 19 n
+半空 726 n
+半空中 3 l
+半站 3 m
+半章 3 m
+半筐 3 m
+半筹不纳 3 i
+半筹莫展 3 i
+半箱 3 m
+半篇 7 m
+半米 63 m
+半粒 9 m
+半精装 3 n
+半索动物 3 l
+半级 5 m
+半线 7 n
+半经 3 n
+半统靴 3 n
+半缕 5 m
+半缩酮 3 n
+半群 2 m
+半翅目 10 n
+半老头 3 n
+半老徐娘 6 nr
+半胱氨酸 12 n
+半胱磺酸 3 n
+半胱胺 3 n
+半胶束 3 n
+半脱产 5 i
+半腔 2 m
+半腰 3 n
+半自养 3 i
+半自动 104 i
+半自动化 3 i
+半自给 6 i
+半自耕农 6 i
+半节 11 t
+半节网络 3 n
+半节课 3 n
+半英里 2 m
+半虫 4 n
+半表半里 6 n
+半衰期 74 n
+半袋 17 m
+半袖 2 n
+半裸 3 z
+半角 3 m
+半解一知 3 i
+半课 3 n
+半路 347 m
+半路上 3 l
+半路修行 3 n
+半路出家 34 l
+半身 135 m
+半身不摄 3 v
+半身不遂 34 l
+半身像 3 n
+半身照 3 i
+半身裙 3 n
+半车 3 n
+半轮 11 m
+半轴 4 n
+半载 27 m
+半辆 2 m
+半辈子 108 m
+半辈子架 2 m
+半边 305 s
+半边人 3 n
+半边天 43 i
+半边莲 8 nr
+半透明 154 n
+半透明体 3 n
+半途 65 n
+半途上 3 l
+半途中 7 s
+半途而 3 i
+半途而废 77 i
+半途而癈 3 n
+半通 11 m
+半通道 3 n
+半道 26 m
+半道儿 3 nr
+半遮半掩 3 i
+半遮面 3 l
+半部 267 m
+半部论语 3 l
+半酣 3 z
+半醒 5 v
+半醒半睡 4 l
+半里 113 m
+半重 2 m
+半野 6 n
+半长裤 3 n
+半门 3 m
+半间 23 n
+半间不界 3 l
+半间半界 3 n
+半阕 9 m
+半队 3 n
+半隐居 4 i
+半集 3 m
+半露 5 t
+半露柱 3 i
+半青半黄 3 i
+半面 21 n
+半面不忘 3 i
+半面之交 3 i
+半面之旧 3 i
+半音 39 n
+半音阶 3 n
+半页 6 m
+半颗 9 m
+半饥半饱 4 i
+半饱 18 n
+半饱半饿 3 i
+半饷 3 n
+半首 9 m
+卌 2 zg
+卍 4 zg
+华 4364 ns
+华三世 4 nr
+华不再扬 3 i
+华东 775 ns
+华东区 3 ns
+华东地区 68 ns
+华东局 36 nt
+华东师大 25 nz
+华东师范 3 nr
+华东师范大学 75 nt
+华东师范大学出版社 4 nt
+华东政法 3 nz
+华东政法学院 13 nt
+华东旅游 3 nz
+华东理工 3 nz
+华东理工大学 28 nt
+华东科技 9 nz
+华东野战军 167 nt
+华严孔 2 nr
+华严宗 41 nr
+华严寺 8 nr
+华严经 36 nz
+华中 1235 ns
+华中农业大学 515 nt
+华中地区 271 ns
+华中局 12 nt
+华中师大 2 nt
+华中师范大学 787 nt
+华中理工大学 4 nt
+华中电网 9 nz
+华中科 3 nr
+华中科大 5 nt
+华中科技 3 nz
+华中科技大学 1108 nt
+华丰 5 nz
+华为 373 nr
+华为公司 25 nt
+华为技术 3 n
+华为技术有限公司 15 nt
+华丽 433 nr
+华之都 2 nr
+华云龙 3 nr
+华交会 3 nt
+华亭 37 nr
+华亭县 18 ns
+华亭寺 3 nr
+华亭鹤 2 nr
+华亭鹤唳 3 i
+华人 940 n
+华人乐队 3 nt
+华人华侨 3 n
+华人社区 3 nt
+华人网 3 nz
+华人论坛 3 nz
+华以 16 nz
+华以刚 2 nr
+华传教 8 nz
+华伦夫人 4 nrt
+华伦斯 9 nr
+华伦洛 2 nr
+华伦海 6 ns
+华伯斯基 22 nz
+华体网 3 nz
+华佗 66 nr
+华佗再造丸 2 nz
+华侨 1076 n
+华侨之乡 3 n
+华侨城 81 ns
+华侨城集团 31 nt
+华侨大学 26 nt
+华侨联会 3 nt
+华侨银行 3 nt
+华信 4 nz
+华储 3 nz
+华储网 3 nz
+华元 2 nz
+华元渝 2 nr
+华光 65 nz
+华克尔 4 nr
+华兰 3 ns
+华兴 6 ns
+华兴会 14 nt
+华兹华 22 nr
+华兹华斯 3 ns
+华冈 3 ns
+华冈艺术 3 n
+华军软 3 nr
+华农 3 nz
+华冠丽 3 nr
+华冠丽服 3 nr
+华制华 3 nz
+华力 3 nz
+华力西 46 nr
+华势力 3 nr
+华勒 2 nz
+华化考 4 nr
+华北 3074 ns
+华北军区 151 nt
+华北区 18 ns
+华北地区 134 ns
+华北大学 20 nt
+华北大平原 5 ns
+华北局 14 nt
+华北平原 173 ns
+华北油田 3 nt
+华北电 3 j
+华北电力 3 nz
+华北电力大学 17 nt
+华北石油 3 j
+华北联合大学 19 nt
+华华 4 nz
+华南 647 ns
+华南农业大学 9 nt
+华南区 3 ns
+华南地区 58 ns
+华南城 3 ns
+华南师大 3 nz
+华南理工 3 nz
+华南理工大学 49 nt
+华南虎 48 nz
+华南银行 3 nt
+华博会 12 nr
+华原 5 ns
+华原朋美 3 nr
+华厦 5 ns
+华县 20 ns
+华友 4 nz
+华发 23 nz
+华司徒 5 nr
+华同旭 26 nr
+华名辉 2 nr
+华君武 11 nr
+华商 73 nz
+华商候 2 n
+华商报 15 nz
+华商洋 3 nz
+华商相 2 nz
+华商网 3 nz
+华园 2 ns
+华国 3 ns
+华国锋 365 nr
+华圣境 2 nr
+华坤 3 nz
+华坪 3 ns
+华坪县 3 ns
+华城 3 ns
+华埠 6 ns
+华埠镇 3 ns
+华壁皆 2 nr
+华士 2 ns
+华声报 3 nz
+华夏 1348 ns
+华夏儿女 3 nz
+华夏大地 3 nz
+华夏工专 3 nt
+华夏工业 3 nz
+华夏文化 3 nz
+华夏民族 3 nz
+华夏证券 3 nt
+华夏银行 18 nt
+华夏鳗 5 n
+华外人 2 n
+华大 12 nz
+华大使 3 nr
+华大基因 3 nz
+华天 13 nz
+华夫脱 3 nr
+华夷 10 nz
+华夷译 2 nr
+华夷阁 2 nr
+华奎劾 2 nr
+华威 8 ns
+华婕妤 2 nr
+华宁 3 ns
+华宁县 3 ns
+华宁库 2 nr
+华安 24 nz
+华安县 2 ns
+华宏伟 2 nr
+华宝 25 nz
+华实业 3 nz
+华宫 5 ns
+华家岭 5 nr
+华家池 5 nr
+华容 277 nr
+华容区 256 nr
+华容县 772 nr
+华容道 15 nr
+华富 3 nz
+华富里 3 ns
+华寺 3 ns
+华封三祝 3 nr
+华封三视 3 nr
+华尔兹 23 nr
+华尔兹舞 3 nr
+华尔浦 3 ns
+华尔滋 3 nr
+华尔特 3 nr
+华尔登 2 nr
+华尔维 4 nr
+华尔街 151 ns
+华尔街日报 82 nz
+华尧道 6 nr
+华尼拉 8 ns
+华尾丘墟 3 n
+华尾山丘 3 ns
+华屋 9 ns
+华屋丘墟 3 n
+华屋山丘 3 ns
+华屋秋墟 3 n
+华山 1539 ns
+华山医院 8 nt
+华山参 3 nr
+华山松 23 nr
+华山派 3 nr
+华山论剑 72 nz
+华山路 5 nz
+华岗 3 ns
+华岛 8 ns
+华岳仙 2 nr
+华川 3 ns
+华州 6 ns
+华州华 4 nz
+华州司 2 nt
+华工 71 nz
+华师一 3 nr
+华师大 16 nr
+华师美 2 nr
+华帝燃 3 nr
+华广 18 nz
+华府 22 nr
+华建敏 3 nr
+华强北 3 ns
+华彦钧 3 nr
+华彩 25 nz
+华彩网 3 nr
+华彬 34 nz
+华影 2 n
+华影艺 4 nr
+华微电子 80 nz
+华德普 9 nr
+华意 2 n
+华成 4 nrfg
+华成刚 19 nr
+华成龙 3 nz
+华房 5 n
+华扁穗 2 nr
+华才鼎 2 nr
+华拱 3 nz
+华拳 14 nz
+华文 54 nz
+华文出版社 4 nt
+华新 22 nz
+华新村 3 nr
+华新水泥 7 nz
+华族 10 nz
+华旗 27 ns
+华日 6 nz
+华明 7 nz
+华星 18 nz
+华星秋月 3 nr
+华星辰 3 nr
+华晨 15 nz
+华服 20 nz
+华来儿 5 nr
+华林 12 nz
+华林学 2 nt
+华林寺 4 nr
+华林路 3 nz
+华格纳 3 nr
+华楼宫 2 nr
+华歆入 2 nr
+华歆奏 6 nr
+华歆引 2 nr
+华歌尔 3 nr
+华氏 37 nr
+华氏度 3 ns
+华氏温度 2 ns
+华氏温标 3 nr
+华水发 10 nz
+华汉 3 ns
+华江 3 ns
+华江国中 3 nz
+华江国小 3 nt
+华池 4 ns
+华池县 3 ns
+华沙 307 ns
+华沙公约 3 ns
+华治华 5 nz
+华泰 33 nz
+华洋 4 ns
+华津 3 ns
+华浦 4 ns
+华润 29 nz
+华润集团 7 nt
+华清池 60 nr
+华源 83 nz
+华源集团 26 nt
+华溪渔 2 nr
+华滋 7 ns
+华澳 2 ns
+华灯 100 nz
+华灯初上 12 i
+华版 3 nz
+华特 3 nz
+华特尔 68 nr
+华特林 3 nr
+华理 2 n
+华瑞 364 nz
+华电 28 nz
+华盖 67 nr
+华盛 5 nz
+华盛顿 952 ns
+华盛顿国家动物园 2 nt
+华盛顿大学 25 nt
+华盛顿州 41 ns
+华盛顿市 4 ns
+华盛顿湖 2 ns
+华盛顿纪念碑 3 nz
+华盛顿邮 3 ns
+华盛顿邮报 91 nz
+华目 2 n
+华石镇 3 nr
+华硕 75 nr
+华硕主 3 nr
+华福 3 nz
+华福周 2 nr
+华科技 3 nz
+华立控股 9 nz
+华章 13 nr
+华章锦绣 3 nr
+华筝 132 n
+华筝公主 4 n
+华筝笑 3 nr
+华管藻 2 nr
+华籍 5 n
+华素 3 nz
+华约 58 ns
+华约组织 3 nt
+华纳 74 ns
+华纳公司 2 nt
+华罗庚 59 nr
+华美 212 nz
+华美达 2 nr
+华翰 3 nrt
+华而不媚 3 i
+华而不实 43 i
+华联 29 ns
+华联商厦 5 nt
+华胄 5 nr
+华胜天 13 nr
+华胥氏 2 nr
+华能 32 nz
+华腾联合 3 ns
+华航 3 nz
+华航运 2 nz
+华艾康 2 nr
+华若翰 3 nr
+华英雄 3 nr
+华药 9 nz
+华莱土 2 nr
+华莱士 205 nr
+华莱士瓜 3 ns
+华莱士线 3 nz
+华莹市 3 nr
+华菱 4 nz
+华菱管线 2 nz
+华蓥 6 ns
+华蓥山 38 ns
+华蓥市 6 ns
+华蘅芳 16 nr
+华虹 3 nz
+华融 7 n
+华蟾素 3 nz
+华表 1714 n
+华表奖 8 nz
+华裔 194 nr
+华西 75 ns
+华西医科大学 8 nt
+华西协合大学 3 nt
+华西大学 7 nt
+华西村 21 ns
+华西街 3 ns
+华西都市报 7 nz
+华观 4 nz
+华视 3 n
+华视公司 3 nt
+华视网 3 nz
+华觉明 128 nr
+华诞 90 a
+华语 82 nz
+华语学校 3 nt
+华语音乐 3 n
+华谊 19 nz
+华贵 143 nr
+华资 2 nz
+华赫艮 57 nr
+华辉冷 2 nr
+华辉叹 4 nr
+华辉大 2 nz
+华辉奇 2 nr
+华辉忙 2 nr
+华辉怒 4 nr
+华辉才 2 nr
+华辉接 2 nr
+华辉猜 2 nr
+华辉笑 2 nr
+华辉越 2 nr
+华辞 3 nz
+华辰 130 nz
+华辰春 256 nr
+华达 3 nz
+华达呢 15 nr
+华远 13 nz
+华通 7 nz
+华道胜 2 nr
+华都 11 ns
+华里 147 ns
+华野 30 ns
+华金 7 nz
+华铜 3 nz
+华银 3 nz
+华锡钧 29 nr
+华阳 58 ns
+华阳国志 3 ns
+华阳路 3 nz
+华阴 38 ns
+华阴东 8 ns
+华阴县 16 ns
+华阴市 7 ns
+华陀 6 ns
+华陀在世 3 n
+华陵 3 ns
+华雄引 2 nr
+华雷斯 9 nr
+华露 2 nz
+华顶 2 ns
+华饰 3 n
+华鹰 2 nz
+华龙 17 nz
+华龙区 3 ns
+华龙网 3 nz
+协 590 n
+协从 3 v
+协从犯 3 n
+协会 3145 n
+协会主席 3 n
+协会会员 3 n
+协会会长 3 n
+协会理事 3 n
+协作 726 vn
+协作关系 3 n
+协作办 2 n
+协作区 46 n
+协作单位 3 n
+协作性 6 n
+协作组 19 n
+协作网 6 n
+协作者 3 n
+协保 5 v
+协力 77 n
+协力同心 10 n
+协力车 3 n
+协力齐心 3 i
+协办 126 v
+协办人 3 n
+协办员 2 n
+协办者 3 n
+协助 1873 v
+协助执行 3 n
+协助者 3 n
+协合 3 v
+协同 846 n
+协同作战 3 n
+协同动作 3 n
+协同学 19 n
+协同工作 17 n
+协同式 2 n
+协同效应 3 n
+协同程序 3 n
+协同通信 3 nt
+协和 163 nz
+协和医院 60 nt
+协和式 10 n
+协商 1552 n
+协商一致 3 nz
+协商会 5 nt
+协商会议 3 n
+协商者 3 n
+协处理器 18 n
+协奏 8 n
+协奏曲 243 n
+协定 2687 v
+协律 3 n
+协心同力 3 n
+协心戮力 3 i
+协方差 3 n
+协查 4 vn
+协查通报 3 n
+协洽 3 v
+协济 3 n
+协理 49 n
+协理员 5 n
+协私罔上 3 i
+协税 3 n
+协管 5 n
+协管员 8 n
+协约 57 n
+协约国 211 n
+协统 3 n
+协议 5108 n
+协议书 152 n
+协议价 3 n
+协议对他 3 n
+协议工 18 n
+协议映射 3 n
+协议赡养 3 vn
+协调 4071 v
+协调一致 3 i
+协调世界时 7 n
+协调会 11 n
+协调会议 3 n
+协调公式 3 n
+协调员 20 n
+协调官 3 n
+协调局 2 n
+协调性 46 n
+协调控制 4 n
+协调系统 3 n
+协调组 3 n
+协调者 5 n
+协调部 3 n
+协进 2 v
+协进会 23 n
+协迫 3 v
+协防 26 n
+协防部 3 nt
+卐 3 zg
+卑 644 ag
+卑下 117 n
+卑不足道 3 i
+卑亲属 3 l
+卑以自牧 3 n
+卑俗 3 a
+卑劣 137 a
+卑劣地 3 l
+卑劣性 3 l
+卑劣手段 3 l
+卑南 3 ns
+卑南溪 3 ns
+卑宫菲食 3 n
+卑尊 3 n
+卑尔根 38 ns
+卑屈 7 a
+卑微 124 a
+卑怯 12 a
+卑斯山 3 ns
+卑污 20 n
+卑湿 3 a
+卑琐 3 a
+卑礼厚币 3 n
+卑职 618 n
+卑视 7 n
+卑词厚礼 3 i
+卑谄足恭 3 i
+卑谬 7 a
+卑贱 101 a
+卑身屈体 3 i
+卑身贱体 3 l
+卑躬屈膝 23 i
+卑躬屈节 4 i
+卑辞 3 n
+卑辞厚币 3 n
+卑辞厚礼 3 i
+卑辞重币 3 n
+卑鄙 365 a
+卑鄙无耻 85 i
+卑鄙龌龊 16 i
+卑陋 3 a
+卑陋龌龊 3 i
+卒 4428 ng
+卒业 4 n
+卒子 11 n
+卒岁 3 n
+卓 410 nr
+卓不凡 42 i
+卓乎不群 3 i
+卓乎盛 2 z
+卓于伊 2 nr
+卓亦离 2 nr
+卓依婷 3 nr
+卓克基 3 nr
+卓兰 3 nr
+卓别林 28 nr
+卓博网 5 nr
+卓古城 2 nr
+卓命扶 2 nr
+卓大哥 2 nr
+卓大喜 2 nr
+卓大怒 6 nr
+卓大惊 2 nr
+卓天雄 152 nr
+卓夫切夫 2 nr
+卓奥友峰 16 nr
+卓如你 2 nr
+卓如兄 2 nr
+卓如可 2 nr
+卓小勤 7 nr
+卓尔不群 12 nr
+卓尔独行 3 nr
+卓尼 4 nr
+卓尼县 3 nr
+卓师伯 2 nr
+卓异 22 a
+卓按剑 2 nr
+卓文君 8 nr
+卓旭光 2 nr
+卓有 17 v
+卓有建树 3 nr
+卓有成就 36 i
+卓有成效 243 i
+卓有远见 3 i
+卓柏卡 15 nr
+卓正大 3 nr
+卓波罗 4 nr
+卓溪 3 nr
+卓然 35 a
+卓然有成 3 i
+卓玛背 2 nr
+卓着 3 a
+卓福香 2 nr
+卓立鸡群 3 nr
+卓索图 2 nr
+卓绝 170 nr
+卓而不群 3 i
+卓芬芬 13 nr
+卓荦不羁 3 nr
+卓荦英姿 3 nr
+卓荦超伦 3 nr
+卓著 263 a
+卓著威名 3 nr
+卓行 16 a
+卓见 31 a
+卓识 20 nr
+卓识远见 3 i
+卓资 3 n
+卓资北 2 l
+卓资县 2 nr
+卓越 592 nr
+卓越价 3 nr
+卓越性 3 nr
+卓越贡献 3 nr
+卓达集团 2 nz
+卓迁太 2 nr
+卓进财 2 nr
+卓问肃 2 nr
+卓阿哈 2 nr
+单 5823 n
+单一 1005 b
+单一体 3 b
+单一制 38 b
+单一化 18 nr
+单一型 2 b
+单一培养 3 nr
+单一性 8 b
+单一材料 3 n
+单丁 4 nr
+单丝 11 n
+单丝不成线 2 l
+单丝不线 3 i
+单个 849 b
+单个儿 3 n
+单个地址 3 n
+单义 3 n
+单乐章 3 nr
+单买 3 v
+单于 220 d
+单于争立 3 nr
+单于入朝 2 nr
+单于屯 2 nr
+单于府 2 nr
+单于庭 8 nr
+单于母 2 nr
+单于皆 2 nr
+单于立 2 nr
+单于西迁 2 nr
+单于请兵 2 nr
+单于都护 2 nr
+单井 7 n
+单井设计 3 i
+单交 3 b
+单交种 3 n
+单产 115 n
+单亲 20 n
+单亲家庭 3 nr
+单亲遗传 3 i
+单人 476 n
+单人床 7 n
+单人房 3 n
+单人旁 3 nr
+单人游戏 3 n
+单人滑 14 n
+单人独马 3 i
+单人舞 3 n
+单人赛 2 n
+单人间 3 n
+单以剑 3 nr
+单仰萍 3 nr
+单仲山 3 nr
+单件 41 n
+单价 118 n
+单任务 3 n
+单传 17 b
+单传于 2 nr
+单伯山 6 nr
+单位 17532 n
+单位制 146 n
+单位名单 3 n
+单位名称 3 n
+单位向量 3 n
+单位地址 3 n
+单位态射 3 n
+单位成本 3 l
+单位根 3 n
+单位理想 3 n
+单位矩阵 3 nz
+单位预算 3 l
+单体 357 n
+单体单元 3 nr
+单体性 3 n
+单作 3 n
+单侧 36 n
+单侧平衡 3 nr
+单侧性 2 nr
+单侧约束 3 i
+单倍体 44 n
+单倍性 3 n
+单倍核 3 n
+单值 3 n
+单值分支 3 n
+单储系数 3 n
+单元 795 n
+单元体 3 n
+单元尺寸 3 n
+单元式 2 n
+单元性 3 n
+单元房 12 n
+单元景观 3 nr
+单元格 3 nr
+单元楼 3 nr
+单元测试 9 n
+单元码 3 n
+单兄 2 n
+单光子 2 nr
+单光鼐 2 nr
+单克隆 36 nr
+单兵 262 n
+单兵云 14 nr
+单兵作战 19 n
+单兵孤城 3 nr
+单兵攻击 3 i
+单兵连 2 nr
+单养 3 n
+单军 2 n
+单冠白 2 nr
+单凭 10 n
+单击 18 b
+单击右键 3 n
+单击左键 3 nr
+单刀 721 n
+单刀球 14 n
+单刀直入 49 i
+单刀赴会 23 i
+单刃 3 n
+单刃剑 2 nr
+单分体 3 n
+单分子层 3 n
+单切线 3 n
+单列 42 b
+单则易折 3 n
+单利 8 n
+单力道 2 n
+单功能 3 b
+单加氧酶 3 n
+单务 2 n
+单动道岔 3 n
+单单 221 a
+单单会 3 n
+单单在 3 b
+单单是 3 n
+单单有 3 b
+单单能 3 n
+单卖 3 v
+单卡 3 n
+单卵双生 3 nr
+单县 8 n
+单双打 11 nr
+单双杠 7 nr
+单双面 3 nr
+单反 11 b
+单反相机 3 n
+单发 122 n
+单发前 2 nr
+单发阻 4 n
+单叔山 3 nr
+单口 3 n
+单口相声 7 i
+单句 12 n
+单台静 3 nr
+单叶 49 n
+单叶型 3 n
+单叶或 5 nr
+单号 3 n
+单名 70 n
+单名数 3 n
+单向 286 n
+单向性 5 b
+单向收费 3 n
+单向行驶 3 nr
+单向转运 3 n
+单向通车 3 n
+单向阀 3 n
+单场胜 6 nr
+单型科 4 n
+单士 4 n
+单士元 4 nr
+单声 2 n
+单声道 3 n
+单壳 3 n
+单复变 4 nr
+单复数 9 n
+单大良 2 nr
+单头 3 n
+单姓 3 n
+单姓吕 2 nr
+单姓周 2 nr
+单姓谷 2 nr
+单子 154 n
+单子叶 22 nr
+单孑独立 3 v
+单孔 15 n
+单孔目 15 nr
+单字 79 n
+单字节 2 n
+单字表 3 n
+单季 9 n
+单季山 5 nr
+单季稻 5 n
+单宁 73 nr
+单宁酸 23 n
+单家庄 6 nr
+单家独户 4 i
+单寒 3 b
+单对单 3 n
+单小山 3 nr
+单尾检验 3 n
+单层 196 n
+单层式 3 b
+单层次 4 b
+单层细胞 3 b
+单峰 3 nr
+单峰函数 3 n
+单峰驼 5 n
+单峰骆驼 3 n
+单崩儿 5 nr
+单工槽 3 n
+单帮 3 nr
+单幅 5 n
+单干 92 n
+单干户 2 n
+单床 3 n
+单店 7 n
+单座 7 n
+单座式 3 b
+单廷 19 n
+单廷便 2 nr
+单式 7 n
+单式簿记 3 nr
+单引发 3 nr
+单引号 7 n
+单张 8 n
+单弦 37 n
+单弦儿 3 nr
+单弱 17 a
+单形现象 3 n
+单形的面 3 n
+单彩民 2 nr
+单影 2 n
+单循环 5 nr
+单循环赛 4 n
+单忧极瘁 3 i
+单态性 3 n
+单态现象 3 n
+单性 192 n
+单性合子 3 n
+单性结实 3 n
+单性胚 3 n
+单性花 14 n
+单总线 3 n
+单恋 3 nr
+单手 3 n
+单手剑 3 nz
+单手操作 3 n
+单打 461 n
+单打一 2 l
+单打独斗 150 i
+单抗 2 n
+单挂号 3 n
+单指 3 n
+单指令 4 n
+单挑 3 a
+单据 108 n
+单掌 11 n
+单排 7 n
+单摆 28 n
+单放机 2 n
+单教授 2 n
+单数 63 n
+单数形 3 n
+单数据流 2 n
+单文孤证 3 nr
+单斗 4 n
+单斜 3 n
+单斜层 3 n
+单斜晶硫 3 n
+单斜晶系 3 n
+单方 63 n
+单方面 240 n
+单日 66 n
+单日份 3 nz
+单易 2 n
+单是钗 2 nr
+单显 3 a
+单晶 88 n
+单晶体 8 n
+单晶河 3 nr
+单晶河乡 13 n
+单晶河村 2 n
+单晶硅 14 n
+单曲 2 n
+单曲体 4 n
+单曲榜 3 n
+单月 13 n
+单服 2 n
+单期 3 b
+单本剧 3 n
+单机 99 n
+单机游戏 2 n
+单机版 3 b
+单材拱 3 n
+单杠 46 n
+单条 14 n
+单板 542 n
+单板机 3 n
+单板纲 3 nr
+单极 39 n
+单极子 3 n
+单果 257 n
+单果鲜 256 nr
+单枝 2 n
+单枝型 2 n
+单枪 4 n
+单枪匹马 73 i
+单枪独马 3 i
+单栋全 2 nr
+单树模 56 nr
+单株 25 n
+单株选择 3 nr
+单核 78 n
+单核巨 2 nr
+单核心 3 n
+单核细胞 3 n
+单根 3 n
+单根独苗 3 nr
+单桅船 3 nr
+单桨 2 n
+单梁 2 n
+单梁长 2 n
+单槽 3 n
+单槽式 3 n
+单模 4 b
+单步 3 d
+单步梁 3 nr
+单步法 3 n
+单歧藻 2 nr
+单母音 3 n
+单比 3 nr
+单比例 3 n
+单淘汰制 2 n
+单演函数 3 l
+单点 11 n
+单点故障 3 n
+单点系泊 3 n
+单片 38 n
+单片微 2 nz
+单片机 8 n
+单片系统 3 n
+单片装 3 n
+单独 2307 d
+单独海损 3 nr
+单环 2 n
+单瓣 25 n
+单生 5 n
+单生果 2 n
+单生枝 9 n
+单生花 3 n
+单生茎 2 n
+单用 3 n
+单用户 11 n
+单田方 3 nr
+单田芳 3 nr
+单瘫 3 n
+单目 6 n
+单目潜 2 nr
+单盲 3 n
+单相 37 n
+单相思 19 nr
+单相接地 3 i
+单相电 3 n
+单眼 58 n
+单眼皮 19 n
+单硝酸 3 n
+单碟 3 n
+单磷酸 3 n
+单科 131 n
+单称郎 2 nr
+单程 40 n
+单程票 7 n
+单程距离 3 n
+单稳态 2 n
+单立 3 b
+单立人 3 nr
+单立文 3 nr
+单笔 3 n
+单笔石 2 nr
+单管 54 n
+单管系统 3 n
+单篇 14 b
+单簧管 39 n
+单粒传法 3 n
+单精度 3 n
+单糖 59 n
+单系 3 n
+单红 2 b
+单级 37 b
+单纯 1679 a
+单纯化 3 nr
+单纯形 10 n
+单纯形法 3 n
+单纯性 24 n
+单纯林 3 nr
+单纯词 6 nr
+单纱 8 n
+单纹孔 2 n
+单线 56 n
+单线程 3 b
+单线行驶 3 nr
+单线通车 3 n
+单线铁路 9 n
+单练 3 a
+单组分 3 n
+单细胞 131 n
+单缝衍射 3 nz
+单缸 11 n
+单翼 9 n
+单翼机 5 n
+单翼飞机 3 i
+单耗 2 n
+单耳刀 3 n
+单耳听觉 3 i
+单耳旁 3 nr
+单职 3 n
+单聘仁 2 nr
+单股 3 n
+单肩 2 n
+单胞菌 23 n
+单胞藻 3 n
+单能性 3 n
+单脉冲 2 nr
+单脚 3 n
+单脚站立 3 nr
+单脚跳 3 i
+单臂 27 n
+单臂卡环 3 nr
+单舰 2 n
+单艇 3 n
+单色 93 n
+单色仪 3 nr
+单色光 25 n
+单色光源 3 n
+单色性 3 n
+单色画 3 n
+单色谐调 3 l
+单节 2 n
+单芯片 16 n
+单芯片系统 2 n
+单花 2 n
+单花粉 3 n
+单荣范 2 nr
+单萜 3 n
+单薄 282 a
+单螺杆 3 n
+单行 1610 n
+单行本 55 n
+单行法 3 n
+单行线 6 n
+单行道 11 n
+单衣 20 n
+单衫 2 n
+单被 10 n
+单裤 11 n
+单褂 3 n
+单见浅闻 3 i
+单角 3 n
+单詹歇 128 nr
+单设 3 n
+单证 38 n
+单证员 3 n
+单词 671 n
+单词表 3 n
+单词通 3 nr
+单调 348 n
+单调乏味 3 n
+单调作业 3 n
+单调推理 3 n
+单调无味 3 i
+单调枯燥 3 n
+单谷氨酸 3 nz
+单质 62 n
+单足 3 a
+单足跳 3 i
+单蹄 3 n
+单身 444 n
+单身公寓 3 n
+单身在外 3 i
+单身女人 3 n
+单身情歌 3 i
+单身户 3 n
+单身族 2 n
+单身汉 31 nr
+单身生活 3 i
+单身男人 3 n
+单身男女 3 l
+单身白领 3 n
+单身贵族 3 nr
+单车 83 n
+单车比赛 3 n
+单车竞赛 3 nr
+单轨 8 b
+单轨制 3 n
+单轨铁路 3 n
+单轨铁道 3 n
+单轮 2 n
+单轴取向 3 n
+单轴晶体 3 n
+单轴绞车 3 n
+单辆 3 n
+单边 44 d
+单边主义 18 n
+单边制裁 3 n
+单连域 2 nr
+单选 4 b
+单选框 3 n
+单选题 3 n
+单通 42 n
+单通道 4 n
+单道 2 n
+单醣 3 v
+单钩 2 n
+单铁 3 n
+单铁生 66 nr
+单链 31 n
+单键 19 n
+单镖 2 n
+单门 6 n
+单门式 3 n
+单门独户 5 i
+单间 46 n
+单间儿 3 n
+单雄信 10 nr
+单霁翔 23 nr
+单非 5 d
+单靠 3 a
+单靠着 3 n
+单面 48 n
+单面山 3 n
+单面洞 3 n
+单鞋 3 n
+单鞭 4 n
+单音 5 n
+单音字 3 n
+单音节 3 n
+单音词 3 n
+单项 244 b
+单项奖 7 nz
+单项工程 3 n
+单项式 4 n
+单项样条 3 l
+单项赛 10 nr
+单顺反子 3 l
+单飞 29 nr
+单首 3 n
+单马锡 2 nr
+单骑 86 n
+单黄蓉 2 nr
+单齿 2 n
+卖 7578 v
+卖不出去 3 i
+卖不掉 3 v
+卖东西 3 n
+卖主 35 v
+卖主求荣 13 n
+卖乖 41 v
+卖乖弄俏 3 i
+卖书 3 n
+卖人情 3 n
+卖价 17 n
+卖俏 4 a
+卖俏行奸 3 n
+卖俏迎奸 3 n
+卖假 19 v
+卖儿贴妇 3 n
+卖儿鬻女 3 i
+卖光 3 n
+卖公营私 3 n
+卖关子 52 l
+卖关节 3 l
+卖出 339 v
+卖出价 9 n
+卖出去 3 v
+卖刀买犊 3 l
+卖到 3 v
+卖剑买牛 3 i
+卖剑买犊 3 l
+卖剑买琴 3 i
+卖力 145 n
+卖力气 15 n
+卖劲 11 v
+卖卖 3 v
+卖压 3 v
+卖友 4 n
+卖友求荣 8 l
+卖呆 3 v
+卖命 68 v
+卖唱 26 v
+卖嘴 3 v
+卖国 864 n
+卖国求利 3 l
+卖国求容 3 n
+卖国求荣 272 l
+卖国贼 1364 n
+卖地 74 n
+卖场 159 n
+卖大号 3 nz
+卖头卖脚 3 i
+卖契 3 a
+卖好 17 v
+卖妻鬻子 3 i
+卖字 3 n
+卖字号 3 n
+卖完 3 v
+卖官卖爵 3 i
+卖官贩爵 3 n
+卖官鬻爵 28 i
+卖官鬻狱 3 i
+卖家 104 n
+卖富差贫 3 i
+卖履分香 3 i
+卖底 3 n
+卖座 20 n
+卖弄 152 v
+卖弄口舌 3 i
+卖弄学问 3 l
+卖弄玄虚 3 i
+卖弄风情 3 i
+卖弄风骚 3 i
+卖当劳 3 i
+卖户 3 n
+卖房 3 n
+卖房子 3 n
+卖手 3 v
+卖报 18 v
+卖掉 278 v
+卖文 3 n
+卖文为生 3 l
+卖断 3 v
+卖方 179 n
+卖方市场 3 n
+卖春 3 n
+卖春妇 3 n
+卖本事 3 n
+卖李钻核 3 n
+卖来卖去 3 l
+卖法市恩 3 l
+卖淫 115 v
+卖淫女 3 i
+卖淫妇 3 i
+卖淫嫖娼 3 vn
+卖淫案 3 i
+卖淫罪 2 i
+卖火柴 3 i
+卖炭翁 3 n
+卖点 90 n
+卖烧饼 3 n
+卖狗悬羊 3 i
+卖狗皮膏药 4 i
+卖狗肉 3 i
+卖男鬻女 3 i
+卖盘 3 v
+卖相 10 n
+卖破绽 3 i
+卖票 22 n
+卖空 5 n
+卖笑 22 v
+卖者 3 n
+卖肉 3 n
+卖艺 79 n
+卖艺者 3 n
+卖花 16 n
+卖花女 2 n
+卖苦力 3 l
+卖茶 3 v
+卖菜 3 n
+卖货 3 n
+卖身 74 v
+卖身契 11 n
+卖身投靠 15 i
+卖钱 3 v
+卖面子 3 n
+南 24296 ns
+南一中 3 nr
+南丁格尔 24 ns
+南三府 2 nr
+南三环 2 nr
+南下 528 f
+南下列车 3 ns
+南世子 5 nr
+南东东 3 ns
+南丫岛 24 nr
+南中 30 f
+南中国海 48 ns
+南丰 51 ns
+南丰县 11 ns
+南丰村 3 ns
+南丹 12 ns
+南丹县 9 ns
+南丹州 5 ns
+南丹路 3 ns
+南丽湖 4 nr
+南乐 13 ns
+南乐县 3 ns
+南乔治亚岛 15 ns
+南乡子 2 nr
+南二中 3 nr
+南二环 3 nr
+南云忠 3 nr
+南五环 3 nr
+南五祖 2 nr
+南亚 692 ns
+南亚地区 22 ns
+南亚工专 3 nt
+南亚松 2 nr
+南亚次大陆 118 nz
+南京 7228 ns
+南京东路 16 ns
+南京中医药大学 8 nt
+南京临时政府 83 nt
+南京五台山体育馆 2 nt
+南京军区 75 nt
+南京军区总医院 7 nt
+南京军区福州总医院 2 nt
+南京军区空军 8 nt
+南京农业 3 nt
+南京农业大学 8 nt
+南京医科大学 2 nt
+南京博物院 8 ns
+南京国际展览中心 3 nz
+南京图书馆 9 nt
+南京城 356 ns
+南京大学 112 nt
+南京大学中文系 4 nt
+南京大屠杀 53 nz
+南京审计学院 5 nt
+南京市 2046 ns
+南京师范大学 32 nt
+南京房产 3 n
+南京政府 65 nt
+南京政治学院 3 nt
+南京旅游 3 nz
+南京日报 3 nz
+南京晨报 3 nz
+南京机场 3 ns
+南京港 13 ns
+南京理工 3 nt
+南京站 39 nt
+南京翻译 3 nr
+南京航空航天大学 19 nt
+南京艺术学院 11 nt
+南京路 71 ns
+南京路上好八连 3 nt
+南京金陵大学 12 nt
+南京长江二桥 69 nz
+南京长江大桥 1829 ns
+南京队 3 nt
+南人 3 ns
+南仁通 15 nr
+南仓 5 ns
+南传上座 3 nr
+南伸延 3 nr
+南依骊 2 nr
+南侧 729 f
+南侨 6 n
+南充 48 ns
+南充人 5 nr
+南充县 3 ns
+南充市 16 ns
+南六环 3 ns
+南兰 4 ns
+南兰才 2 nr
+南兰陵 6 ns
+南关 137 ns
+南关区 5 ns
+南关区法院 6 nt
+南兴镇 3 ns
+南内环 3 ns
+南军 20 nr
+南军阵 5 nr
+南冠楚囚 3 n
+南凉 12 ns
+南凉王 4 nr
+南凯科 2 nr
+南剑州 9 nr
+南加 4 ns
+南加利福尼亚 3 ns
+南加利福尼亚大学 6 nt
+南加州 27 ns
+南加罗林 3 ns
+南势溪 3 nr
+南势角 3 i
+南匈奴 3 nrt
+南化塘镇 3 ns
+南北 5877 ns
+南北关系 3 l
+南北向 106 f
+南北宽 3 nr
+南北对话 39 l
+南北战争 78 nz
+南北方 23 f
+南北朝 908 t
+南北极 20 ns
+南北桥 3 ns
+南北洋 2 ns
+南北湖 3 ns
+南北疆 4 ns
+南北移动 3 l
+南北纬 34 nr
+南北议和 3 ns
+南北货 3 j
+南北通衢 3 n
+南北部 5 f
+南北镇 4 ns
+南区 33 ns
+南半 3 t
+南半球 142 ns
+南半部 3 ns
+南华 46 nz
+南华县 2 ns
+南华大学 2 nt
+南华早报 3 nt
+南华西 3 ns
+南南 2 ns
+南南东 2 ns
+南南北北 3 ns
+南南合作 36 ns
+南南西 3 ns
+南博会 3 j
+南卡 9 ns
+南卡罗 4 nr
+南卡罗来 3 ns
+南卡罗来纳 13 ns
+南卡罗来纳州 7 ns
+南卫滩 3 nr
+南原山 2 ns
+南去 3 t
+南去北来 3 l
+南县 574 ns
+南县教育局 6 nt
+南口 577 ns
+南口镇 258 ns
+南召 16 ns
+南召县 16 ns
+南台 24 ns
+南台工专 3 j
+南史 3 n
+南向 191 f
+南向东 2 nr
+南吴北 2 nr
+南和 31 ns
+南和县 3 ns
+南唐 529 t
+南喀尔 9 ns
+南嘉措 3 nr
+南嘉错 2 nr
+南四奇 4 nr
+南四湖 38 nr
+南四环 3 nr
+南回 3 ns
+南回归线 41 l
+南回线 3 l
+南回铁路 3 ns
+南园 7 ns
+南国 131 ns
+南国风光 3 nz
+南土 4 n
+南坡 43 ns
+南坪 18 ns
+南坪县 6 ns
+南城 193 ns
+南城县 3 ns
+南城门 3 ns
+南堡 145 ns
+南塔 6 ns
+南塘 5 ns
+南塘镇 2 ns
+南境 2 n
+南增厚 2 nr
+南士 2 ns
+南大 39 ns
+南大冉 3 nr
+南大洋 5 ns
+南大街 18 ns
+南大门 20 ns
+南天 3 t
+南天一 3 nr
+南天山 3 nr
+南天星 3 nr
+南天竹 3 nr
+南天门 66 nr
+南太平洋 3 ns
+南太湖 3 nr
+南头 38 f
+南夷 3 ns
+南夷兵 2 nr
+南奥克 2 nr
+南奥塞梯 16 ns
+南威尔士 6 ns
+南威岛 2 ns
+南子北 5 ns
+南子岛 2 ns
+南学会 2 nt
+南宁 314 ns
+南宁人 2 nr
+南宁地区 8 ns
+南宁市 70 ns
+南宁市公安局 7 nt
+南宁德 2 nr
+南宁站 2 ns
+南宁糖业 16 nt
+南宁路 2 ns
+南宇兄 3 nr
+南安 145 ns
+南安县 13 ns
+南安市 3 ns
+南安普敦 22 ns
+南安普顿 27 ns
+南宋 1272 t
+南宗掌 2 nr
+南宗禅 2 nr
+南定 9 ns
+南宜洋 2 ns
+南室韦 2 nr
+南宫 116 ns
+南宫市 3 ns
+南宫齐 4 ns
+南寒带 3 nr
+南寨 17 ns
+南尊武 2 nr
+南小街 3 nr
+南少林 2 nr
+南少陵 4 nr
+南屏山 6 ns
+南山 310 ns
+南山人寿 3 ns
+南山区 32 ns
+南山可移 3 i
+南山寺 3 ns
+南山村 3 ns
+南山矿区 3 ns
+南山路 3 ns
+南山铁案 3 n
+南岔 3 ns
+南岔区 3 ns
+南岗 9 ns
+南岗区 19 ns
+南岚镇 3 nr
+南岛 143 ns
+南岛群 4 nr
+南岩 3 ns
+南岩宫 512 nr
+南岭 119 ns
+南岭村 3 ns
+南岳 1077 ns
+南岳区 3 ns
+南岳尖 256 nr
+南岳山 257 ns
+南岳庙 3 ns
+南岳怀让 3 nr
+南岳谢 2 nr
+南岳镇 3 ns
+南岸 979 f
+南岸区 9 ns
+南岸平 2 nr
+南岸校 2 nr
+南岸西 2 ns
+南岸陆 2 nr
+南峰 5 ns
+南嵌溪 3 n
+南川 10 ns
+南川市 3 ns
+南川河 8 ns
+南州冠冕 3 nr
+南巡 192 nr
+南巡讲话 3 j
+南巴 6 ns
+南市 18 ns
+南市区 13 ns
+南布格河 4 ns
+南师大 12 nr
+南希 9 nr
+南希仁 109 nr
+南帝远 2 nr
+南平 380 ns
+南平市 24 ns
+南平镇 4 ns
+南庄 2 ns
+南庄镇 3 ns
+南府 8 ns
+南康 18 ns
+南康县 6 ns
+南康市 3 ns
+南康江 2 ns
+南康河 2 ns
+南开 155 ns
+南开区 17 ns
+南开大学 217 nt
+南开大学中文系 3 nt
+南开大学历史系 3 nt
+南开工专 3 nt
+南开数学研究所 2 nt
+南归 3 ns
+南彝陵 3 ns
+南往 3 t
+南征 178 nr
+南征军 2 nr
+南征北伐 4 nr
+南征北战 64 nz
+南征北讨 8 i
+南征梁 3 nr
+南征楚 3 nr
+南征荆 2 nr
+南征西 2 nr
+南微微 4 nr
+南德 11 ns
+南怀仁 47 nr
+南怀瑾 3 nr
+南恩州 2 nr
+南惟畿 2 nr
+南惠庭 2 nr
+南戴河 7 ns
+南户窥郎 3 n
+南房 2 ns
+南扬哥 2 ns
+南投 20 j
+南投人 3 nz
+南投县 20 ns
+南投市 3 ns
+南拳 36 nz
+南振中 258 nr
+南支 2 ns
+南支锋 3 nr
+南攻楚 4 nr
+南斗 3 vn
+南斯 5 ns
+南斯拉夫 670 nrt
+南斯拉夫共产主义者联盟 6 nt
+南斯拉夫政府 3 nt
+南斯拉夫联盟 34 ns
+南斯拉夫联盟共和国 34 ns
+南斯拉夫联邦 18 nz
+南斯拉夫队 3 nz
+南新路 3 ns
+南方 3736 f
+南方人 73 nr
+南方人才 3 nr
+南方共同市场 4 nt
+南方南极 3 ns
+南方周末 3 nr
+南方城 3 nr
+南方大港 3 ns
+南方局 114 nt
+南方建材 3 nr
+南方日报 3 nz
+南方澳 3 nr
+南方电网 3 nz
+南方网 2 nz
+南方网讯 3 nz
+南方航空公司 14 nt
+南方证券 3 nt
+南方话 3 l
+南方音 3 nr
+南方高科 3 nz
+南无宝 2 nr
+南无阿弥 3 nr
+南昆山 3 ns
+南昆线 15 nz
+南昌 829 ns
+南昌人 15 nr
+南昌县 7 ns
+南昌大学 3 nt
+南昌市 107 ns
+南昌街 3 ns
+南昌起义 303 nz
+南昌铁路局 3 nt
+南明 24 ns
+南明军 2 nr
+南明区 3 ns
+南明唐 3 nr
+南明山 2 ns
+南明弘 16 nr
+南明抗 5 nr
+南明旧 2 nr
+南明桂 4 nr
+南明永 25 nr
+南明河 2 ns
+南明诸 3 nr
+南明隆 6 nr
+南明鲁 6 nr
+南星 8 nz
+南星桥 10 ns
+南昭王 2 nr
+南普陀 3 ns
+南曲 9 ns
+南朝 942 t
+南朝北 3 ns
+南朝梁 5 nr
+南朝鲜 190 ns
+南木 10 ns
+南木林 2 ns
+南木林县 2 ns
+南木错 2 ns
+南村 33 ns
+南村镇 3 ns
+南来 3 t
+南来北往 34 l
+南来顺 5 nr
+南极 770 ns
+南极光 3 ns
+南极区 3 ns
+南极半岛 30 ns
+南极圈 18 n
+南极星 3 nr
+南极洲 162 ns
+南极虾 3 nr
+南果梨 2 nr
+南枝北枝 3 nr
+南柯一梦 21 nz
+南柯子 4 nr
+南柯梦 5 nr
+南校区 2 nr
+南桑威 4 ns
+南桑德 2 ns
+南桥 5 ns
+南梁 5 ns
+南梆子 2 nr
+南森采 3 nr
+南棹北辕 3 nr
+南楼 5 ns
+南横公路 3 l
+南欧 116 ns
+南欧国家 3 n
+南段 132 f
+南水关 2 ns
+南水北调 298 nz
+南水峪村 2 ns
+南水青 2 nr
+南汇 36 ns
+南汇区 4 ns
+南汇县 5 ns
+南汉 9 ns
+南汉宸 2 nr
+南江 6 ns
+南江县 6 ns
+南池子 132 nr
+南沈灶镇 3 ns
+南沙 132 ns
+南沙参 3 nr
+南沙群岛 91 ns
+南沟 15 ns
+南沟村 2 ns
+南沱镇 3 ns
+南河 41 ns
+南河头 256 ns
+南河村 6 ns
+南河沿 5 ns
+南河洲 256 ns
+南油 3 n
+南泉 3 ns
+南泥湾 19 ns
+南洋 377 ns
+南洋国家 3 l
+南洋杉 27 nz
+南洋群岛 3 ns
+南津关 18 ns
+南洲子 256 ns
+南流 3 ns
+南流江 5 ns
+南流贯 5 nr
+南浅北 2 nr
+南济水 2 nr
+南浔 21 ns
+南浔区 3 ns
+南浔庄 2 nr
+南浔镇 3 ns
+南浦 26 ns
+南浦大桥 13 ns
+南海 2087 ns
+南海区 4 ns
+南海县 17 ns
+南海县人 3 nr
+南海发展 5 nt
+南海子 17 nr
+南海学园 3 nr
+南海岸 2 nr
+南海市 12 ns
+南海舰队 100 nt
+南海诸岛 3 ns
+南海路 3 ns
+南海龙 4 ns
+南涧 5 ns
+南涧县 3 ns
+南涧彝族自治县 2 ns
+南清河 3 ns
+南渡 2 ns
+南渡江 13 ns
+南温带 3 nr
+南港 273 ns
+南港区 2 ns
+南港国中 3 nt
+南港国小 3 nt
+南港路 3 ns
+南游 3 f
+南湖 1652 ns
+南湖公园 2 ns
+南湖大山 11 ns
+南湖渠 3 ns
+南湖路 3 ns
+南湘 358 ns
+南湘刚 3 nr
+南湘朝 3 nr
+南湘正 4 nr
+南湘真 2 nr
+南湾 23 ns
+南溪 21 ns
+南溪县 3 ns
+南溪李 2 nr
+南溪河 4 ns
+南溪温泉 5 nz
+南漪湖 2 nr
+南漳 269 ns
+南漳县 258 ns
+南潮村 3 nr
+南澳 34 ns
+南澳县 2 ns
+南澳大利亚 35 ns
+南澳岛 11 ns
+南澳溪 3 ns
+南濒亚 2 nr
+南炳文 2 nr
+南燕 23 nr
+南特 56 ns
+南犯 2 n
+南王 20 nrt
+南王爷 2 nr
+南环路 1024 ns
+南理工 2 j
+南瓜 197 ns
+南瓜子 4 nr
+南瓜氨酸 3 nz
+南瓜籽 7 nr
+南瓜饼 3 nr
+南田 7 ns
+南界 3 n
+南疆 212 ns
+南疆铁路 6 nz
+南皮 21 n
+南皮县 2 ns
+南盘江 50 ns
+南盟 10 ns
+南直隶 17 ns
+南相美 3 nr
+南社 39 ns
+南票区 3 ns
+南禅寺 12 nr
+南科达 3 nr
+南移 466 v
+南窑 2 ns
+南站 113 ns
+南端 960 f
+南竹 10 ns
+南竿塘 2 nr
+南箕北斗 3 i
+南管 3 nt
+南粤 15 ns
+南粮北调 3 j
+南纬 299 nr
+南纬度 3 nr
+南线 59 f
+南缘 153 f
+南罗 3 ns
+南罗得西 3 ns
+南美 432 ns
+南美各国 3 ns
+南美国家 3 ns
+南美地区 3 ns
+南美洲 491 ns
+南群 2 ns
+南翔 13 ns
+南联 4 ns
+南联盟 98 j
+南肯辛 2 nr
+南胡 3 nr
+南腔 3 n
+南腔北调 12 l
+南自 3 ns
+南自云 3 nr
+南至 3 ns
+南至北 2 ns
+南舣北驾 3 nr
+南航 399 j
+南航北骑 3 n
+南航河南分公司 6 nt
+南船 3 n
+南船北车 3 nt
+南船北马 3 nz
+南芬区 3 ns
+南苑 63 ns
+南荣工专 3 l
+南药 7 n
+南营 2 ns
+南营门街 3 ns
+南萨哈林斯克 2 ns
+南落基 2 nr
+南蒂罗尔 2 ns
+南薇滩 2 nr
+南薰殿 4 nr
+南蛇藤 4 nr
+南蛇藤果 3 nr
+南蛮 51 nr
+南蛮子 35 n
+南蛮寺 3 n
+南蛮鴂舌 3 n
+南蛮鴃舌 3 n
+南行 111 j
+南行镇 2 ns
+南街 42 ns
+南街村 3 ns
+南襄 261 ns
+南西 3 ns
+南西川 8 ns
+南诏 112 nr
+南诏王 4 nr
+南谯区 3 ns
+南豫州 3 ns
+南货 3 n
+南货店 5 nt
+南贩北贾 3 l
+南越 192 ns
+南越兴 2 nr
+南越军 3 nr
+南越国 4 ns
+南越平 2 nr
+南越武 6 nr
+南越王 25 nr
+南路 1962 ns
+南路军 8 nr
+南路平 3 ns
+南辕北辙 26 nr
+南边 305 f
+南达 3 ns
+南达科他 2 ns
+南达科他州 14 ns
+南迁平 2 nr
+南运 5 j
+南运河 40 ns
+南迦巴瓦峰 11 ns
+南通 508 nz
+南通人 6 n
+南通县 3 ns
+南通市 22 ns
+南通江山农药化工股份有限公司 3 nt
+南通社 18 nt
+南道东 2 nr
+南邦 4 ns
+南郊 267 ns
+南郊区 3 ns
+南郑 35 ns
+南郑侯 2 nr
+南郑县 2 ns
+南郡 21 ns
+南郡南 2 nr
+南郡城 3 nr
+南郡枝 2 nr
+南部 5612 f
+南部县 3 ns
+南部洛 3 nr
+南部非洲 3 ns
+南郭 3 nr
+南郭先生 6 nr
+南郭处士 3 nr
+南都 40 ns
+南里 24 ns
+南里奥格兰德 2 nrt
+南金东箭 3 nr
+南金地箭 3 l
+南针 3 n
+南钢队 6 nt
+南锡 19 ns
+南锡学派 3 nr
+南锣鼓巷 3 i
+南镇 4 ns
+南镇抚 3 nr
+南长区 3 ns
+南门 831 ns
+南门兜 3 nr
+南门国中 3 ns
+南门国小 3 l
+南门市场 3 ns
+南门湾 3 ns
+南阮北阮 3 nr
+南阳 1615 ns
+南阳人 16 nr
+南阳县 8 ns
+南阳市 26 ns
+南阳村 3 ns
+南阳盆地 29 ns
+南阳网 3 nz
+南阳街 3 ns
+南阳镇 3 ns
+南陈桥 2 nr
+南院 76 ns
+南院宣 2 nr
+南陵 6 ns
+南陵县 2 ns
+南隅 54 f
+南隔堤 3 n
+南雁荡 2 nr
+南雄 16 ns
+南雄县 6 ns
+南雄市 3 ns
+南雄水 2 ns
+南霁云 4 nr
+南霸天 11 nr
+南青龙 2 nr
+南靖 10 t
+南靖县 3 ns
+南非 1715 ns
+南非兰特 2 ns
+南非共产党 3 nt
+南非共和国 25 ns
+南非各国 3 ns
+南非国家 3 l
+南非政府 4 nt
+南非洲 2 ns
+南非语 2 nr
+南非队 3 nt
+南非非洲人国民大会 7 nt
+南面 792 f
+南面百城 3 n
+南面称孤 3 l
+南韩 29 nr
+南音 16 n
+南风 164 nr
+南风不竞 3 nr
+南风窗 3 nr
+南飞雁 4 nr
+南首 2 f
+南马德 3 nr
+南马河 8 ns
+南鹞北鹰 3 nz
+南麓 242 f
+南齐 75 ns
+南齐书 3 nr
+南龙 17 ns
+卙 6 zg
+博 774 nr
+博世 16 nrt
+博乐 7 nr
+博乐市 3 ns
+博乔尼 4 nr
+博乾隆 2 nr
+博亚 3 ns
+博亚卡 6 nr
+博亚尔 2 nr
+博亚网 3 nr
+博什 4 nrt
+博伊尔 5 nr
+博伊德 6 nr
+博伊斯 9 nr
+博伊特 2 nr
+博会 5 n
+博克拉 6 nr
+博克萨 2 nr
+博关经典 3 n
+博兴 8 nr
+博兴县 3 ns
+博内拉 6 nr
+博列洛 8 nr
+博利 2 ns
+博力 3 n
+博功名 2 n
+博加兹 3 nr
+博动 3 n
+博南 9 ns
+博南帕 4 nr
+博博迪乌拉索 2 nrt
+博厄斯 7 nr
+博取 103 v
+博古 152 ns
+博古堂 2 nr
+博古斯瓦 2 nrt
+博古架 4 n
+博古通今 18 l
+博园 5 n
+博埃拉 8 nrt
+博城 2 ns
+博基尼 3 nr
+博士 3373 n
+博士买驴 3 nr
+博士伦 3 nr
+博士后 91 nr
+博士学位 3 n
+博士帽 10 n
+博士德 3 nr
+博士文凭 3 nr
+博士点 21 nr
+博士班 3 nr
+博士生 465 nr
+博士论文 3 nz
+博多 18 nrt
+博多湾 2 ns
+博大 134 a
+博大生物 3 l
+博大精深 107 nr
+博大胸怀 5 i
+博大胸襟 6 n
+博太后 2 nr
+博奈尔 5 nr
+博奕 3 i
+博奥 2 nrt
+博季诺 4 nr
+博季诺夫 6 nr
+博学 147 n
+博学之士 5 nr
+博学多才 53 nr
+博学多闻 7 nr
+博学洽闻 3 nr
+博宁顿 2 nr
+博宗龙 4 nr
+博客 703 nr
+博客园 3 nr
+博客地址 3 n
+博客墙 2 nr
+博客群 7 nr
+博客节 5 nr
+博察 3 v
+博导 34 n
+博尔丁 3 nr
+博尔代 5 nr
+博尔努 30 nr
+博尔哈 2 nrt
+博尔基亚 4 ns
+博尔塔 5 nr
+博尔塔拉 3 nrt
+博尔塔拉蒙古自治州 6 ns
+博尔德 6 nr
+博尔忽 31 nr
+博尔斯克 2 nrt
+博尔曼 3 nr
+博尔术 64 nr
+博尔格蒂 2 nrt
+博尔济 2 nr
+博尔济吉 47 nr
+博尔盖 2 nr
+博尔赫斯 13 nrt
+博尔霍夫 2 nrt
+博尔顿 70 nr
+博尔顿队 2 nt
+博尼法 10 nr
+博尼瓦尔 2 nrt
+博局 3 n
+博山 17 ns
+博山区 3 ns
+博山古 2 ns
+博山炉 20 nr
+博川 7 ns
+博川区 3 ns
+博希孔 2 nr
+博帕尔 10 nr
+博帕德 5 nr
+博平岭 9 ns
+博庭欢 2 nr
+博康加 3 nr
+博异 2 n
+博弈 137 v
+博弈犹贤 3 nr
+博弈者 3 n
+博弈论 19 n
+博引 3 nr
+博彩 63 n
+博彩业 21 nr
+博彩税 3 n
+博得 271 v
+博德 2 nr
+博德曼 3 nr
+博德莱 2 nr
+博恩霍尔 2 nrt
+博拉 19 nrt
+博拉斯 3 nr
+博文 8 nr
+博文约礼 3 nr
+博斗 3 nr
+博斯克 3 nr
+博斯普鲁 3 nrt
+博斯普鲁斯 5 nrt
+博斯普鲁斯海峡 45 ns
+博斯特 2 nr
+博斯纳 2 nr
+博斯腾湖 23 ns
+博施 5 n
+博施法 3 nr
+博施济众 2 nr
+博时基金 3 n
+博普林 2 nr
+博望 10 v
+博望侯 3 nr
+博望坡 4 nr
+博望城 3 nr
+博望镇 3 nr
+博杜安 5 nr
+博杜恩 6 nr
+博来霉素 3 n
+博极群书 2 n
+博根 2 ns
+博格 9 n
+博格坎 9 nr
+博格坎普 31 nrt
+博格特 6 nr
+博格达 11 nr
+博格达峰 15 nr
+博治多闻 3 i
+博洛夫斯 2 nrt
+博洛尼 3 nr
+博洛尼亚 30 ns
+博洛格 2 nr
+博洽多闻 3 nr
+博济 36 n
+博浪 2 n
+博浪沙 4 nr
+博浪鼓 3 i
+博涉文 2 nr
+博湖 13 ns
+博湖县 6 ns
+博燃网 3 n
+博爱 165 nr
+博爱医院 3 nt
+博爱县 8 nr
+博爱路 3 nr
+博物 68 n
+博物多闻 3 i
+博物学家 23 n
+博物洽闻 3 n
+博物通达 3 n
+博物院 48 n
+博物馆 3272 n
+博物馆学 27 n
+博球网 3 n
+博瑞祥 3 nr
+博瓦尼 10 nr
+博甘斯 3 nr
+博登湖 17 nr
+博白 5 nr
+博白县 3 ns
+博硕肥腯 3 ns
+博福斯 25 nr
+博穆博 15 nr
+博穆博果 23 nr
+博索夫 4 nr
+博絮埃 8 nr
+博纳乌 10 nr
+博纳尔 3 nr
+博罗 16 nr
+博罗县 5 ns
+博罗塔 4 nr
+博罗季诺 3 nr
+博罗胡 2 nr
+博罗茂洛 5 nrt
+博美犬 3 nr
+博而不精 3 i
+博而寡要 3 l
+博耐特 2 nr
+博茨瓦纳 88 nrt
+博茨瓦纳共和国 4 ns
+博莱斯瓦 4 nrt
+博莱罗 2 nr
+博落回 2 nr
+博蒂切利 5 nrt
+博蒙特 4 nr
+博览 91 nr
+博览五车 3 n
+博览会 1233 n
+博览古今 3 n
+博览园 5 n
+博览群书 58 n
+博览群籍 3 n
+博览群集 3 ns
+博讯 3 nz
+博识 8 n
+博识多通 3 l
+博识洽闻 3 n
+博赞克 3 nr
+博赫纳 6 nr
+博通经籍 3 n
+博通群 3 nr
+博采 62 nr
+博采众议 3 i
+博采众长 28 i
+博里 3 nrt
+博野 3 n
+博野县 3 nr
+博金斯 2 nr
+博闻 3 n
+博闻多识 3 i
+博闻强志 3 i
+博闻强记 12 n
+博闻强识 2 i
+博闻辩言 3 n
+博阿兹 3 nr
+博阿利 2 nr
+博阿维 3 nr
+博阿维斯塔 3 nrt
+博阿藤 2 nr
+博陵王 2 nr
+博雅 400 nr
+博韦区 2 nr
+博马舍 13 nr
+博鲁克 4 nr
+博鳌 87 nr
+卜 810 nr
+卜一卜 2 nr
+卜一卦 9 nr
+卜万苍 4 nr
+卜世仁 8 nr
+卜之兄 2 nr
+卜京师 2 nr
+卜从善 32 nr
+卜伦阿 2 nr
+卜加勒 2 nr
+卜卡勒 2 nr
+卜卦 52 nr
+卜卦家 3 n
+卜哈河 2 nr
+卜商帖 2 nr
+卜国可 2 nr
+卜地桓 2 nr
+卜夜卜昼 3 nr
+卜子村 3 nr
+卜学亮 256 nr
+卜守则 2 nr
+卜将军 3 nr
+卜尼法 7 nr
+卜居 4 nr
+卜庆华 2 nr
+卜式 2 n
+卜弥格 3 nr
+卜德库 3 nr
+卜拉姆 18 nr
+卜拉希米 6 nr
+卜拉欣 4 nr
+卜昼卜夜 3 nr
+卜法间 2 n
+卜甲 6 nr
+卜祝及 3 nr
+卜祝巫 2 nr
+卜祥志 3 nr
+卜筮 39 n
+卜筮官 3 v
+卜算 3 v
+卜算子 2 n
+卜者 7 n
+卜职司 3 nr
+卜辞 112 nr
+卜里斯 4 nr
+卜问其 2 nr
+卜问吉 3 nr
+卜雷加 6 nr
+卜骨 15 nr
+卜骨树 2 nr
+卜鲁罕 14 nr
+卞 1252 nr
+卞之琳 5 nr
+卞启武 2 nr
+卞大姐 2 nr
+卞太后 16 nr
+卞夫人 30 nr
+卞德培 22 nr
+卞文莲 4 nr
+卞有生 2 nr
+卞氏兽 5 nr
+卞玉京 2 nr
+卞皇太后 2 nr
+卞祥见 2 nr
+卞耀武 2 nr
+卞赛赛 25 nr
+卟 108 x
+卟啉原 3 vn
+占 25139 v
+占上风 136 nr
+占下 3 v
+占为 3 v
+占为己有 3 l
+占优 68 v
+占优势 339 v
+占位 30 v
+占位性 3 n
+占住 3 v
+占便宜 33 v
+占先 25 v
+占全园 2 nr
+占全城 2 nr
+占全河 2 nr
+占全洲 91 nr
+占全疆 2 nr
+占全苏 2 nr
+占全邦 16 nr
+占其邑 2 nr
+占列耶 2 nr
+占到 3 v
+占华民 3 nr
+占卜 216 v
+占卜师 3 nr
+占卜术 6 nr
+占卜者 3 nr
+占卦 13 v
+占压 2 v
+占去 60 v
+占取 3 v
+占地 1347 v
+占地约 3 nr
+占地费 2 v
+占地近 3 v
+占地面积 3 n
+占多数 3 l
+占夺军 3 nr
+占夺民 3 nr
+占婆 7 nr
+占官田 2 nr
+占富室 16 nr
+占居 55 v
+占山为王 3 nr
+占岳州 3 nr
+占巴塞 4 nr
+占广丰 2 nr
+占廷人 4 nr
+占廷军 3 nr
+占廷史 2 nr
+占廷式 3 nr
+占廷皇帝 18 nr
+占开阳 2 nr
+占心术 3 nr
+占戴尔 2 nr
+占据 1716 v
+占据主动 3 n
+占掉 3 v
+占旭刚 2 nr
+占旺相 2 nr
+占星 13 nr
+占星学 2 nr
+占星家 3 nr
+占星师 3 nr
+占星术 33 nr
+占有 2272 v
+占有优势 3 l
+占有权 13 nr
+占有欲 19 nr
+占有物 2 l
+占有率 59 n
+占有者 41 nr
+占有量 40 n
+占朱仙 2 nr
+占梦 3 v
+占款 53 v
+占民田 11 nr
+占治 3 v
+占满 3 v
+占理 2 v
+占用 480 v
+占用率 3 n
+占用费 6 n
+占田令 2 nr
+占田制 10 nr
+占田数 3 nr
+占田达 2 nr
+占空比 3 v
+占筮 3 n
+占课 3 v
+占起 3 v
+占达尔 9 nr
+占达润 7 nr
+占道 4 v
+占金丰 4 nr
+占阿尔 2 nr
+占陆军 2 nr
+占领 3365 v
+占领军 55 nr
+占领区 141 nr
+占领国 20 nr
+占领市场 3 n
+占领者 23 nr
+占风使帆 3 nr
+占风望气 3 l
+占黎川 3 nr
+卡 2991 n
+卡丁车 3 nz
+卡丁车赛 2 nz
+卡万戈 2 nr
+卡丽娜 2 nr
+卡丽来 3 nr
+卡乌伊 2 nrt
+卡乔夫 2 nr
+卡亚 4 ns
+卡亚俄 9 ns
+卡亚镇 2 nr
+卡人 3 nrt
+卡什 28 nrt
+卡介伦 3 nr
+卡介苗 11 nr
+卡他性 6 n
+卡伊 7 nrt
+卡伦布 4 nr
+卡伦指 2 nz
+卡伦河 6 nr
+卡伦津 5 nr
+卡伯特 11 nr
+卡位 4 n
+卡住 90 nr
+卡佩家族 2 nr
+卡佩罗 24 nr
+卡保语 2 nr
+卡克奇 4 nr
+卡兰加 3 nr
+卡兰萨 24 nr
+卡其 16 nr
+卡其布 3 nr
+卡其色 3 nr
+卡其裤 3 nr
+卡具 2 n
+卡兹文 4 nr
+卡内 5 nrt
+卡内基 31 nr
+卡内基音乐厅 4 nt
+卡农 18 nz
+卡切夫 5 nr
+卡切曼 2 nr
+卡列 9 q
+卡列佐 2 nr
+卡列夫 6 nr
+卡列尼 25 nr
+卡利 64 nrt
+卡利亚 47 ns
+卡利亚里 29 nrt
+卡利尼奇 2 nrt
+卡利斯 2 nr
+卡利斯托 3 nrt
+卡利比 2 nrt
+卡利玛 3 nr
+卡制作 2 n
+卡制卡 3 nr
+卡力斯 9 nr
+卡加 5 nrt
+卡加利 6 nr
+卡加尔 2 nr
+卡努特 2 nr
+卡努里 4 nr
+卡劳河 2 nr
+卡勒 11 nrt
+卡勒瓦拉 6 nrt
+卡南加 2 nr
+卡博特 2 nr
+卡卡 29 nrt
+卡卢加 2 nr
+卡卢奇 2 nr
+卡卢姆 2 nr
+卡压 6 nz
+卡口 3 ns
+卡号 24 nz
+卡吉米 2 nr
+卡哇伊 3 ns
+卡哇依 3 ns
+卡哈 2 nrt
+卡哈尔 5 nr
+卡哈马卡 3 nrt
+卡嗒声 3 z
+卡因 14 nrt
+卡圈 3 nz
+卡地亚 4 ns
+卡塔 20 nrt
+卡塔克 3 nr
+卡塔尔 120 nr
+卡塔尔人 3 nrt
+卡塔尔国 2 ns
+卡塔尼亚 6 ns
+卡塔戈 2 nr
+卡塔林 3 nr
+卡塔琳 2 nrt
+卡塔罗 2 nr
+卡塔赫纳 10 nrt
+卡塞姆 4 nr
+卡塞尔 53 nr
+卡塞琳 2 nr
+卡壳 21 nz
+卡多 3 nrt
+卡夫 30 nrt
+卡夫卡 25 nr
+卡奔塔 2 nr
+卡奥斯 2 nr
+卡姆 8 nrt
+卡姆拉 2 nr
+卡姆斯 2 nr
+卡娅 8 nrt
+卡子 16 nr
+卡宾体 3 nr
+卡宾枪 122 nr
+卡宾达 9 nr
+卡富埃 12 nr
+卡尔 161 nrt
+卡尔丹 2 nr
+卡尔内 4 nrt
+卡尔加里 10 nrt
+卡尔吉 3 nr
+卡尔基 81 nr
+卡尔塔 3 nrt
+卡尔多 5 nrt
+卡尔夫 2 nr
+卡尔宾斯 2 nrt
+卡尔巴拉 8 nrt
+卡尔帕克 2 nrt
+卡尔平 5 nr
+卡尔德 8 nrt
+卡尔德拉 3 nrt
+卡尔德隆 3 nrt
+卡尔戈阿 2 nrt
+卡尔敦 2 ns
+卡尔文 13 nr
+卡尔斯 14 nrt
+卡尔斯基 3 nrt
+卡尔斯塔德 2 nrt
+卡尔斯鲁厄 16 nrt
+卡尔施 6 nr
+卡尔普 2 nr
+卡尔曼 15 nr
+卡尔曼滤波 3 nz
+卡尔杜 2 nr
+卡尔松 6 nr
+卡尔梅 3 nr
+卡尔梅克 11 nrt
+卡尔森 11 nr
+卡尔沙 2 nr
+卡尔波 2 nr
+卡尔波夫 7 nrt
+卡尔洛维 5 nrt
+卡尔派 2 nr
+卡尔潘 8 nr
+卡尔特 2 nrt
+卡尔王 2 nrt
+卡尔瓦尔 3 nrt
+卡尔登 3 nrt
+卡尔皮 3 nrt
+卡尔米 3 nrt
+卡尔纳克 3 nrt
+卡尔纳普 8 nrt
+卡尔维纳 5 nrt
+卡尔维诺 7 nrt
+卡尔莱 3 nr
+卡尔萨基 5 nrt
+卡尔蔡 2 nr
+卡尔西 2 nrt
+卡尔诺 4 nr
+卡尔达 6 nr
+卡尔达诺 11 nrt
+卡尔迈勒 12 nrt
+卡尔逊 4 nr
+卡尔霍恩 2 nrt
+卡尔顿 3 nrt
+卡尔马 19 nr
+卡尤拉 5 nr
+卡尺 12 nr
+卡尼亚 5 ns
+卡尼斯 4 nr
+卡尼萨 2 nr
+卡岩型 3 nr
+卡巴 12 nrt
+卡巴尔达 9 nrt
+卡巴斯基 4 nrt
+卡巴诺 2 nr
+卡巴迪 14 nr
+卡巴雷 10 nr
+卡巴雷罗 4 nrt
+卡布列 2 nr
+卡布奇诺 4 nrt
+卡布拉尔 8 nrt
+卡布斯 13 nr
+卡希尔 5 nr
+卡帕 6 nr
+卡帕克 15 nrt
+卡帕尼娜 3 nrt
+卡带 2 n
+卡带机 3 n
+卡带柜 3 nr
+卡带盒 3 n
+卡带箱 3 n
+卡库斯 4 nr
+卡座 4 nz
+卡异尔 3 nr
+卡式 9 nz
+卡式录音机 3 n
+卡式炉 3 nr
+卡彭特 4 nr
+卡德 5 nrt
+卡德兰 2 nr
+卡德洛 2 nr
+卡德纳斯 5 nrt
+卡德罗夫 3 nrt
+卡恩 38 nr
+卡恩斯 2 nr
+卡扎尔 10 nr
+卡扎菲 32 nr
+卡托 23 nrt
+卡托斯 4 nr
+卡托普利 7 nrt
+卡托维兹 5 nrt
+卡扣 2 nz
+卡扬德 2 nr
+卡拉 342 nrt
+卡拉什尼科夫 55 nrt
+卡拉卡尔帕克 7 nrt
+卡拉哈迪 4 nrt
+卡拉哈里 21 nrt
+卡拉奇 96 nr
+卡拉姆 20 nrt
+卡拉尔 3 nr
+卡拉巴尔 3 nrt
+卡拉巴赫 4 nrt
+卡拉布里亚 5 nrt
+卡拉干达 10 nrt
+卡拉库姆 10 nrt
+卡拉扬 21 nr
+卡拉拉 5 nrt
+卡拉斯 4 nrt
+卡拉曼利斯 6 nrt
+卡拉格 7 nrt
+卡拉汉 4 nr
+卡拉泽 3 nr
+卡拉特 3 nrt
+卡拉瓦 16 nrt
+卡拉胶 35 nz
+卡拉蒂 8 nr
+卡拉韦 2 nr
+卡持卡 8 nr
+卡捷琳娜 2 nr
+卡提利 3 nr
+卡搭声 3 n
+卡文 11 nz
+卡文迪什 44 nrt
+卡文迪许 13 nrt
+卡斐尔 11 nr
+卡斯 22 nrt
+卡斯克 2 nrt
+卡斯卡 8 nr
+卡斯塔 5 nrt
+卡斯尔 3 nr
+卡斯尔雷 2 nrt
+卡斯帕 2 nr
+卡斯帕尔 4 nrt
+卡斯帕罗夫 4 nrt
+卡斯托尔 2 nrt
+卡斯族 2 nz
+卡斯泰尔 3 nrt
+卡斯滕 2 nr
+卡斯特 17 nrt
+卡斯特罗 70 nrt
+卡斯特里 10 nrt
+卡斯皮 3 nr
+卡斯腾 3 nr
+卡斯蒂 8 nr
+卡斯蒂亚 2 nrt
+卡斯蒂利 2 nrt
+卡斯蒂利亚 37 nrt
+卡斯蒂斯 2 nrt
+卡斯蒂约 2 nrt
+卡日曲 7 nr
+卡昂 6 nr
+卡明斯 3 nr
+卡明斯基 4 nrt
+卡普亚 4 nr
+卡普兰 3 nr
+卡普勒 3 nr
+卡普尔 4 nr
+卡普拉 3 nrt
+卡普斯 7 nr
+卡普罗 2 nr
+卡普萨 2 nr
+卡普阿 2 nr
+卡普阿斯 2 nrt
+卡曼 22 nrt
+卡曼卡雷 2 nrt
+卡曼奇 3 nr
+卡朗加 2 nr
+卡末林 10 nr
+卡朱拉 8 nr
+卡机 3 n
+卡杜米 10 nrt
+卡杜纳 3 nrt
+卡杰林 4 nr
+卡杰林娜 5 nr
+卡林西亚 2 ns
+卡格薄 2 nr
+卡桑 2 nrt
+卡桑德拉 4 nrt
+卡梅尔 2 nr
+卡梅琳 5 nr
+卡梅申 4 nr
+卡梅隆 2 nr
+卡森堡 3 nr
+卡森市 2 ns
+卡死 3 nr
+卡比 7 nrt
+卡比利 2 nr
+卡比尔 3 nr
+卡比拉 8 nrt
+卡沃里 4 nr
+卡河 9 ns
+卡波尼 6 nr
+卡波济 3 nr
+卡波湖 2 nr
+卡波管 3 nr
+卡波雷 2 nr
+卡泽罗尼 3 nr
+卡洛变换 3 nr
+卡洛夫 13 nr
+卡洛娃 2 nr
+卡洛尔 3 nr
+卡洛斯 142 nr
+卡洛曼 3 nr
+卡洛里 3 nrt
+卡涅姆 19 nrt
+卡消费 2 n
+卡片 170 nz
+卡片式 2 nz
+卡片机 8 nz
+卡片柜 3 nz
+卡片盒 3 nz
+卡片目录 3 n
+卡片箱 3 nz
+卡片纸 3 nz
+卡特 217 nrt
+卡特兰 2 nr
+卡特加 2 nr
+卡特尔 35 nr
+卡特彼勒 10 nrt
+卡特森 37 nr
+卡特琳 3 nrt
+卡特维 2 nr
+卡特迈 2 nr
+卡特里 2 nrt
+卡特里娜 3 nrt
+卡玛 22 nrt
+卡环体 3 nr
+卡环固位 3 n
+卡环臂 3 nr
+卡琳 2 nrt
+卡瑟琳 3 nrt
+卡瓦 18 nrt
+卡瓦列 2 q
+卡瓦列里 20 nrt
+卡瓦利 3 nr
+卡瓦拉 3 nrt
+卡瓦拉多西 2 nrt
+卡瓦瓦 5 nrt
+卡瓦略 2 nr
+卡瓦纳 2 nr
+卡登 2 nrt
+卡百利 3 nr
+卡皮察 11 nr
+卡皮尼 2 nr
+卡盒 3 nz
+卡盖拉 2 nr
+卡盘 2 n
+卡秋莎 2 nr
+卡箍 6 nz
+卡管理 4 nr
+卡簧 3 n
+卡米 3 nrt
+卡米勒 6 nrt
+卡米尔 3 nrt
+卡米拉 102 nrt
+卡米洛 4 nr
+卡米翁 3 nr
+卡米耶 5 nr
+卡累利阿 29 ns
+卡纳克 19 nr
+卡纳塔克 3 nrt
+卡纳塔克邦 3 nrt
+卡纳斯 2 nr
+卡纳瓦 17 nr
+卡纳瓦罗 4 nrt
+卡纳纳斯 5 nrt
+卡纳维拉尔角 14 nrt
+卡纸 2 nz
+卡维尔 2 nr
+卡维龙 2 nr
+卡罗 22 nrt
+卡罗伊 10 nrt
+卡罗会 2 nr
+卡罗夫 3 nr
+卡罗尔 8 nr
+卡罗尼 4 nr
+卡罗尼河 7 ns
+卡罗斯 3 nr
+卡罗林 5 nr
+卡罗琳 5 nrt
+卡罗瑟斯 7 nrt
+卡罗维 19 nr
+卡翁达 13 nr
+卡耐基 22 nr
+卡耶夫 2 nr
+卡耶斯 2 nr
+卡脖子 6 n
+卡舒吉 2 nr
+卡芬雅克 3 nr
+卡茨 12 nrt
+卡莉林 3 nr
+卡莫 2 nrt
+卡莱 7 nrt
+卡莱尔 18 nr
+卡莱斯 5 nr
+卡莱斯基 11 nrt
+卡菲 3 nrt
+卡菲尔 3 nr
+卡萨尔 5 nr
+卡萨尔斯 5 nrt
+卡萨布兰 2 ns
+卡萨布兰卡 51 nrt
+卡萨拉 5 nrt
+卡萨斯 6 nr
+卡萨特 4 nr
+卡萨芒斯 3 nz
+卡萨诺 9 nr
+卡萨诺瓦 3 nrt
+卡葛沙 2 nr
+卡蒂 5 nrt
+卡蒂亚 2 nr
+卡蒂埃 4 nr
+卡蒂普 6 nr
+卡蒂普南 4 nrt
+卡蒂诺 3 nr
+卡蒙斯 2 nr
+卡蜜儿 3 nr
+卡西 23 nrt
+卡西亚 3 ns
+卡西亚斯 2 nrt
+卡西亚诺夫 3 nrt
+卡西克 6 nr
+卡西利 4 nr
+卡西勒 3 nr
+卡西基亚雷河 4 ns
+卡西姆 4 nr
+卡西尔 3 nr
+卡西尼 17 nr
+卡西平 2 nr
+卡西欧 3 ns
+卡西米 3 nrt
+卡西莫夫 2 nrt
+卡西诺 9 nr
+卡西迪 5 nr
+卡西雅 2 nr
+卡规 3 nr
+卡诺定理 3 nr
+卡诺循环 3 nr
+卡诺瓦 3 nr
+卡读写器 3 nz
+卡谢乌 2 nr
+卡贝略 3 nr
+卡费 3 n
+卡赞采夫 13 nr
+卡赫美 2 nr
+卡路斯 3 nr
+卡路里 34 q
+卡车 516 n
+卡车司机 3 n
+卡车工 3 n
+卡轨器 3 n
+卡辛加 2 nr
+卡达 6 nrt
+卡达姆 3 nr
+卡达尔 15 nr
+卡迈勒 5 nrt
+卡连柯 6 nr
+卡迪亚 3 nr
+卡迪威 3 nr
+卡迪尔 6 nr
+卡迪尔汗 2 nrt
+卡迪拉克 25 nrt
+卡迪斯 12 nr
+卡迪林耶 5 nrt
+卡迪洛 2 nr
+卡迪琳娜 3 nrt
+卡迪蓬 2 nr
+卡迪西亚 4 nrt
+卡迪里 2 nrt
+卡迭石 2 nr
+卡逊 22 nrt
+卡通 117 nz
+卡通世界 3 nz
+卡通人物 3 n
+卡通动漫 3 n
+卡通动画 3 n
+卡通化 3 nr
+卡通吧 3 n
+卡通图 3 nr
+卡通图片 3 nz
+卡通城 2 nr
+卡通影片 3 n
+卡通漫画 3 n
+卡通片 4 n
+卡通版 3 n
+卡通电影 3 n
+卡通画 4 n
+卡通美女 3 nr
+卡那霉素 12 nz
+卡采集 2 nr
+卡里 35 nrt
+卡里亚 7 nrt
+卡里亚斯 3 nrt
+卡里克 13 nrt
+卡里埃 3 nr
+卡里基 2 nrt
+卡里姆 5 nrt
+卡里尔 2 nrt
+卡里尼 3 nr
+卡里巴 11 nrt
+卡里米 3 nrt
+卡里莫夫 6 nrt
+卡里辛 6 nrt
+卡钳 2 nr
+卡门 81 ns
+卡门青 2 nr
+卡隆特 2 nr
+卡隆载体 3 nr
+卡雯 8 nz
+卡雷尔 5 nr
+卡雷拉 4 nrt
+卡雷拉斯 3 nrt
+卡霍夫 2 nr
+卡霍夫卡 2 nrt
+卡面 3 n
+卡马 10 nz
+卡马乔 2 nr
+卡马亚 2 nr
+卡马圭 2 nr
+卡马拉 2 nrt
+卡马河 12 nr
+卡马西平 11 ns
+卡鲁斯 3 nr
+卡鲁比 6 nrt
+卡鲁索 6 nr
+卡黄素 8 nr
+卡默古 2 nrt
+卡默林 3 nrt
+卢 801 nr
+卢一峰 3 nr
+卢世荣 5 nr
+卢主事 2 n
+卢之超 2 nr
+卢九德 8 nr
+卢二人 2 nr
+卢传友 3 nr
+卢作孚 3 nr
+卢佩章 2 nr
+卢俊义 532 nr
+卢俊君 8 nr
+卢先生 6 nr
+卢光志 2 nr
+卢光瑞 2 nr
+卢克俭 2 nr
+卢克曼 2 nr
+卢克焕 9 nr
+卢克索 22 nr
+卢克纳 112 nr
+卢克莱 15 nr
+卢克莱修 3 nr
+卢冠廷 3 nr
+卢切尼 2 nr
+卢创坚 2 nr
+卢功勋 2 nr
+卢勇刚 3 nr
+卢卡 19 nr
+卢卡奇 7 nr
+卢卡契 3 nr
+卢卡斯 18 nr
+卢卡申科 32 nr
+卢卡约 2 nr
+卢卡诺夫 2 nr
+卢卡雷 5 nr
+卢卢克 3 nr
+卢卫国 3 nr
+卢受封 3 nr
+卢受晋 2 nr
+卢台生 2 nr
+卢员外 65 nr
+卢嘉锡 13 nr
+卢固语 3 nr
+卢基扬诺夫 5 nrt
+卢塞恩 6 nr
+卢大人 3 nr
+卢大夫 101 nr
+卢太监 2 nr
+卢姆节 2 nr
+卢字母 2 nr
+卢宁军 3 nr
+卢安瓜 7 nr
+卢安达 4 nr
+卢小南 2 nr
+卢小姐 2 nr
+卢尔德 3 nr
+卢展工 3 nr
+卢崩和 2 nr
+卢巧音 3 nr
+卢巴纳 2 nr
+卢布 334 nr
+卢布尔雅那 15 nrt
+卢布林 15 nr
+卢希亚 21 nr
+卢希特 2 nr
+卢庆辉 3 nr
+卢庚戌 3 nz
+卢开万 17 nr
+卢彦得 2 nr
+卢德铭 3 nr
+卢怀谦 2 nr
+卢思道 3 nr
+卢惠光 3 nr
+卢戈金 4 nr
+卢成汉 2 nr
+卢托斯 3 nr
+卢投注 2 nr
+卢文佐 2 nr
+卢文记 2 nr
+卢新宁 4 nr
+卢日支 9 nr
+卢日科夫 3 nr
+卢旺达 109 nr
+卢旺达共和国 2 ns
+卢明月 4 nr
+卢昭容 2 nr
+卢晓南 48 nr
+卢普斯 74 nr
+卢普莱斯库 3 nz
+卢月岚 5 nr
+卢本巴希 9 nr
+卢枢不蠹 3 n
+卢格尔 3 nr
+卢梅利 2 nr
+卢梅尔 5 nr
+卢梭 163 nr
+卢森堡 270 nr
+卢森堡人 3 nr
+卢森堡大公国 4 ns
+卢森堡法郎 3 nr
+卢武铉 18 nr
+卢比 171 nrt
+卢氏 60 nr
+卢氏县 39 nr
+卢水平 2 nr
+卢水神 9 nr
+卢水胡 13 nr
+卢永祥 21 nr
+卢江郡 2 nr
+卢沟 2 ns
+卢沟晓 3 nr
+卢沟桥 88 nr
+卢沟桥事变 33 nz
+卢沟水 2 nr
+卢沟河 3 nr
+卢泰愚 41 nr
+卢洁云 3 nr
+卢津 6 ns
+卢洪春 5 nr
+卢济塔 3 nr
+卢浮宫 91 nr
+卢海潮 3 nr
+卢海鹏 3 nr
+卢淑仪 3 nrfg
+卢湖山 2 nr
+卢湾 9 ns
+卢湾公安分局 2 n
+卢湾区 12 ns
+卢炳辉 8 nr
+卢照邻 13 nr
+卢瑞华 259 nr
+卢瑟 4 nr
+卢瑟福 112 nr
+卢瓦尔 18 nr
+卢瓦尔河 11 ns
+卢瓦雷 5 nr
+卢禹舜 5 nr
+卢科夫 14 nr
+卢竟跃 2 nr
+卢筑盛 2 nr
+卢米埃尔 10 nrt
+卢红春 2 nr
+卢纳察 7 nr
+卢纳桥 2 nr
+卢继传 2 nr
+卢维伦 2 nr
+卢维图 15 nr
+卢维杜 2 nr
+卢羡文 2 nr
+卢肃 2 ns
+卢肇钧 2 nr
+卢胜奎 6 nr
+卢舍夫 3 nr
+卢舍那 7 nr
+卢荣景 8 nr
+卢萨卡 34 nr
+卢萨提 5 nr
+卢蒙巴 17 nr
+卢裕富 3 nr
+卢西乌 2 nr
+卢西亚 6 ns
+卢西亚科 2 ns
+卢西亚诺 7 nr
+卢西坦 4 nr
+卢西奥 4 nr
+卢西尼 3 nr
+卢见曾 2 nr
+卢象升 382 nr
+卢赛洛 4 nr
+卢邦博 3 nr
+卢邦正 257 nr
+卢长春 6 nr
+卢阎王 5 nr
+卢阿拉 6 nr
+卢雁影 2 nr
+卢鲁克 5 nr
+卢鹤绂 2 nr
+卢鹿剑 4 nr
+卢齐利 2 nr
+卢龙 45 nr
+卢龙军 7 nr
+卢龙县 2 ns
+卢龙道 3 nr
+卢龙镇 2 nr
+卣 135 g
+卤 778 n
+卤代烃 44 n
+卤仿反应 3 n
+卤制 2 n
+卤化 96 n
+卤化烃瓶 3 v
+卤化物 40 n
+卤化物灯 4 n
+卤味 5 n
+卤族 5 nz
+卤水 61 n
+卤汁 2 n
+卤湖 3 n
+卤碱 3 n
+卤簿 3 n
+卤素 173 n
+卤素灯 3 n
+卤肉 12 n
+卤肉饭 3 n
+卤莽 37 nz
+卤莽灭裂 3 n
+卤菜 8 n
+卤虾 3 n
+卤蛋 3 n
+卤质 3 n
+卤钝 3 a
+卤钨灯 19 n
+卤面 3 n
+卤鸡 517 n
+卤鸡肉 3 n
+卤鸭 4 n
+卦 1095 n
+卦书 3 n
+卦千纸 3 n
+卦师 2 n
+卦意 3 n
+卦爻 2 n
+卦象 3 n
+卦辞 3 n
+卧 1050 v
+卧下 3 n
+卧下去 3 l
+卧下来 3 l
+卧不安 6 i
+卧不安席 3 l
+卧不安枕 3 i
+卧佛 26 ns
+卧佛寺 30 ns
+卧倒 81 v
+卧倒在地 3 i
+卧具 14 n
+卧城 3 ns
+卧姿 3 n
+卧室 596 n
+卧室家具 3 n
+卧射 3 v
+卧床 104 n
+卧床不起 38 l
+卧底 49 n
+卧式 42 n
+卧得 3 v
+卧房 111 n
+卧旗息鼓 3 i
+卧柜 3 n
+卧榻 49 n
+卧榻之上 3 n
+卧榻鼾睡 3 vn
+卧槽 3 n
+卧槽马 2 n
+卧游 3 n
+卧牛山 5 ns
+卧病 69 n
+卧病在床 3 n
+卧舱 5 n
+卧薪嚐胆 3 n
+卧薪尝胆 325 i
+卧虎居 3 i
+卧虎山 3 ns
+卧虎沟 2 ns
+卧虎藏龙 18 ns
+卧蚕眉 10 n
+卧谈 3 v
+卧车 17 n
+卧轨 6 b
+卧轨自杀 3 l
+卧铺 66 n
+卧铺票 16 n
+卧铺车 2 l
+卧雪眠霜 3 n
+卧鱼 2 n
+卧龙 176 ns
+卧龙区 3 ns
+卧龙山 4 ns
+卧龙岗 21 ns
+卧龙生 3 n
+卧龙自然保护区 10 ns
+卨 8 zg
+卩 2 zg
+卫 1650 n
+卫东 2 nr
+卫东区 3 nt
+卫之地 2 nr
+卫之子 3 nr
+卫九哥 2 nr
+卫于楚 2 nr
+卫京师 9 nt
+卫亲军 8 nr
+卫从 3 n
+卫仲乐 2 nr
+卫伯玉 3 nr
+卫体 2 n
+卫侯李 2 nr
+卫兵 529 n
+卫冕 295 nr
+卫冕冠军 3 nr
+卫冕者 2 nr
+卫冕赛 3 nr
+卫军泰 3 nr
+卫凌难 4 nr
+卫前军 2 nr
+卫司马 2 nr
+卫周祚 3 nr
+卫喇特 3 nr
+卫四厢 4 nr
+卫四娘 18 nr
+卫国 445 ns
+卫国之 130 nr
+卫国保家 3 n
+卫国公 3 nr
+卫国君 3 nr
+卫国左 2 nr
+卫国干城 3 nr
+卫国战争 81 nz
+卫国赵 2 nr
+卫国遂 3 nr
+卫城 43 nr
+卫塞节 3 nr
+卫士 669 n
+卫士长 3 nr
+卫大哥 2 nr
+卫大汗 2 nr
+卫天侯 2 nr
+卫天望 28 nr
+卫太太 6 nr
+卫夫人 7 nr
+卫婕妤 2 nr
+卫子夫 23 nr
+卫将军 5 nr
+卫尉 40 nr
+卫尉主 2 nr
+卫尉之 2 nr
+卫尉卿 2 nr
+卫尉相 3 nr
+卫尉秩 2 nr
+卫尉职 2 nr
+卫州城 2 nr
+卫市易 2 n
+卫师 2 n
+卫师弟 2 nr
+卫志 8 n
+卫怒马 2 nr
+卫总兵 2 nr
+卫懿公 3 nr
+卫戊部队 3 n
+卫戌 3 nz
+卫戍 79 nr
+卫戍区 18 nt
+卫戍司令 3 n
+卫戍部队 3 nt
+卫成侯 2 nr
+卫成公 3 nr
+卫所 3 n
+卫所军 4 nr
+卫护 32 nr
+卫护丘 2 nr
+卫报 50 n
+卫拉特 23 nr
+卫指挥 7 nr
+卫教 3 nz
+卫教系 3 n
+卫文公 3 nr
+卫斯理 14 nr
+卫斯里 3 nr
+卫星 3057 nr
+卫星侦察 3 nr
+卫星国 18 nt
+卫星城 47 nr
+卫星城镇 3 nr
+卫星天线 3 nr
+卫星工业 3 nt
+卫星平台 3 nt
+卫星广播 3 nr
+卫星影象 3 n
+卫星电视 3 nt
+卫星电话 3 n
+卫星网络 3 n
+卫星舱 3 n
+卫星象片 3 n
+卫星转播 3 nr
+卫星通信 3 nt
+卫星镇 3 nr
+卫星频道 3 n
+卫春华 228 nr
+卫普港 8 nr
+卫朝廷 4 nr
+卫木匠 2 nr
+卫束 3 n
+卫校 269 n
+卫桑梓 2 nr
+卫武公 2 nr
+卫民 2 n
+卫气 4 n
+卫气营 13 nr
+卫汝成 2 nr
+卫汝贵 2 nr
+卫河之 4 nr
+卫津路 2 nr
+卫浴 5 nr
+卫浴设备 3 nr
+卫浴间 3 n
+卫消字 2 n
+卫温 4 n
+卫滨区 3 nt
+卫灵公 9 nr
+卫牛员 4 n
+卫王仪 2 nr
+卫王子 2 nr
+卫王宽 2 nr
+卫王赵 2 nr
+卫理 3 n
+卫理公会 9 nt
+卫璧 3 n
+卫生 4290 an
+卫生丸 3 nr
+卫生习惯 3 n
+卫生事业 3 n
+卫生事件 3 n
+卫生保健 3 nr
+卫生动员 3 n
+卫生勤务 3 n
+卫生厅 98 nt
+卫生司 3 nt
+卫生员 42 n
+卫生城 2 nr
+卫生城市 3 n
+卫生处 3 nt
+卫生大队 3 nt
+卫生学 37 nt
+卫生学家 3 n
+卫生学校 3 nt
+卫生室 12 nt
+卫生局 160 nt
+卫生局长 6 n
+卫生工作者 4 n
+卫生巾 33 nr
+卫生带 3 n
+卫生性 3 n
+卫生所 28 nt
+卫生指标 3 n
+卫生机关 3 nt
+卫生机构 3 n
+卫生条件 3 n
+卫生标准 3 n
+卫生桥 3 nr
+卫生桥体 3 nt
+卫生棉 6 n
+卫生死角 3 n
+卫生法 23 n
+卫生洁具 3 n
+卫生状况 3 n
+卫生球 11 n
+卫生用品 3 n
+卫生界 9 n
+卫生科 3 nr
+卫生站 2 nt
+卫生系 2 n
+卫生系统 3 n
+卫生纸 24 n
+卫生组织 3 nt
+卫生统计 3 n
+卫生网 3 n
+卫生署 17 nt
+卫生衣 3 n
+卫生裤 3 n
+卫生设备 2 n
+卫生设施 3 n
+卫生费 2 n
+卫生部 651 nt
+卫生部医政司 4 nt
+卫生部长 32 n
+卫生部门 81 n
+卫生镇 3 nr
+卫生间 150 n
+卫生队 13 nt
+卫生防护 3 n
+卫生防疫 33 n
+卫生院 182 nt
+卫生陶瓷 3 nz
+卫生领域 3 n
+卫生香 2 nr
+卫留成 3 nr
+卫百司 3 n
+卫矛 9 nr
+卫立煌 27 nr
+卫箭筒 2 n
+卫紫衣 3 nr
+卫红的 3 nr
+卫绍王 6 nr
+卫老三 3 nr
+卫至嘉靖 2 nr
+卫若兰 2 nr
+卫葑和 6 nr
+卫葑笑 4 nr
+卫藏 4 n
+卫视 137 n
+卫视台 4 nt
+卫贾森 2 nr
+卫辉 39 nr
+卫辉市 5 n
+卫运河 8 nz
+卫道 3 n
+卫道之士 3 nr
+卫道士 5 nr
+卫道者 4 n
+卫铁 256 n
+卫队 515 n
+卫队长 7 n
+卫青击 3 nr
+卫青取 2 nr
+卫青因 2 nr
+卫青征 3 nr
+卫风 4 n
+卫首领 3 nr
+卫鼎高 2 nr
+卬 25 zg
+卬头阔步 3 nr
+卬首信眉 3 ns
+卮 140 zg
+卯 195 t
+卯上 3 t
+卯兔 3 t
+卯时 3 t
+卯是卯 6 i
+卯月 3 t
+卯榫 2 n
+卯眼 3 t
+卯起 3 n
+卯起来 3 i
+卯足 3 n
+卯足了劲 3 i
+印 3458 v
+印上 3 ns
+印上去 3 v
+印上来 3 v
+印下 3 n
+印下去 3 v
+印下来 3 ns
+印不出 3 v
+印不到 3 v
+印业 3 n
+印之战 3 nz
+印书 3 n
+印书馆 9 nt
+印人 3 ns
+印作 3 vn
+印信 49 nz
+印像 3 n
+印像坊 3 n
+印儿 4 n
+印共 25 j
+印写机 3 n
+印军 67 n
+印军演 20 nr
+印出 3 v
+印出去 3 v
+印出来 3 vn
+印到 3 v
+印制 165 n
+印制板 3 n
+印制法 3 n
+印制电路 3 nz
+印刷 1232 vn
+印刷业 41 n
+印刷业者 3 n
+印刷体 4 n
+印刷厂 48 n
+印刷品 58 n
+印刷工 3 n
+印刷所 27 n
+印刷技术 3 n
+印刷术 118 n
+印刷机 57 n
+印刷版 8 n
+印刷物 2 n
+印刷电路 3 n
+印刷纸 4 n
+印刷网 3 n
+印刷错误 3 n
+印刻 19 n
+印加 122 ns
+印加人 45 n
+印加公主 2 n
+印加国 5 ns
+印加帝国 3 ns
+印加王 9 nr
+印务 3 n
+印卡机 3 nz
+印印 3 nz
+印历 5 nz
+印压 3 n
+印发 190 nz
+印古什 13 ns
+印台 3 ns
+印台区 3 ns
+印吉利 2 ns
+印售 3 vn
+印地 16 ns
+印地安 15 ns
+印地安人 3 nz
+印地安纳 3 ns
+印地安话 3 n
+印地文 2 nz
+印地语 49 nz
+印堂 21 ns
+印堂发黑 3 ns
+印墨 4 ns
+印子 27 n
+印子钱 8 n
+印字 3 nz
+印字机 9 n
+印尼 1000 ns
+印尼政府 6 nt
+印尼男队 18 nt
+印尼盾 34 nr
+印尼语 6 nz
+印尼队 118 nt
+印巴 3 ns
+印度 9701 ns
+印度人 280 nz
+印度人民党 11 nt
+印度共和国 21 ns
+印度半岛 80 ns
+印度卢比 3 ns
+印度国防部 24 nt
+印度大平 3 ns
+印度尼西亚 703 ns
+印度尼西亚共和国 8 ns
+印度尼西亚政府 3 nt
+印度尼西亚盾 4 nz
+印度尼西亚语 12 nz
+印度尼西亚队 3 nt
+印度工业联合会 2 nt
+印度报业托拉斯 12 nz
+印度支那 136 ns
+印度政府 131 nt
+印度教 388 nz
+印度斯坦 47 ns
+印度河 264 ns
+印度洋 1049 ns
+印度理工学院 2 nt
+印度籍 3 n
+印度航空公司 5 nt
+印度议会 4 nt
+印度语 14 nz
+印度谷螟 3 n
+印度象 3 n
+印度豹 3 nz
+印度鳄 3 n
+印张 3 ns
+印影件 3 n
+印得 3 ns
+印成 3 v
+印把子 9 n
+印支 47 n
+印数 24 n
+印文 4 nz
+印文册 2 nr
+印方 9 n
+印有 106 v
+印本 31 ns
+印机 3 n
+印来印去 3 nr
+印板 2 n
+印染 100 vn
+印染助剂 3 n
+印染厂 20 n
+印染布 3 n
+印染机械 3 n
+印模 12 n
+印模托盘 3 n
+印模材料 3 n
+印模石膏 3 n
+印模糊剂 3 n
+印模膏 3 n
+印模面 3 n
+印次 3 ns
+印欧 98 ns
+印欧语 240 n
+印永业 10 nr
+印求法 2 n
+印江 3 ns
+印江土家族苗族自治县 2 ns
+印油 2 n
+印泥 21 n
+印海军 7 nt
+印满 3 v
+印满红 2 nr
+印版 21 v
+印玺 16 nr
+印痕 54 n
+印盒 3 n
+印盖 2 ns
+印相纸 3 n
+印督 2 n
+印空军 7 nt
+印章 227 n
+印章学 3 nr
+印章机 3 nr
+印符术 2 n
+印第安 237 ns
+印第安人 746 nz
+印第安纳 20 ns
+印第安纳州 16 ns
+印第安纳波利斯 6 ns
+印第安语 58 nz
+印第安那 8 ns
+印第安那州 4 ns
+印第安那波利斯 3 ns
+印累绶若 3 n
+印累绶苦 3 n
+印纸 3 nz
+印纹 11 n
+印纹陶 5 nr
+印纽 3 n
+印经院 4 nt
+印绶 51 nr
+印色 4 n
+印芬皇 2 nr
+印花 87 n
+印花厂 3 ns
+印花布 44 ns
+印花机 3 n
+印花税 34 n
+印花纸 3 nz
+印英军 2 nr
+印行 70 v
+印表 3 n
+印表机 3 nz
+印裔 2 n
+印记 276 n
+印证 272 j
+印谱 16 n
+印象 2079 n
+印象主义 150 n
+印象分 10 n
+印象形成 3 nr
+印象法 3 n
+印象派 57 nr
+印质明 3 n
+印起 3 ns
+印起来 3 v
+印过去 3 v
+印过来 3 v
+印迹 28 n
+印迹杂交 3 n
+印鉴 12 nr
+印钞厂 4 n
+印钞机 2 n
+印钤盖 2 nr
+印错 3 ns
+印锡茶 3 nr
+印陆军 2 nt
+印顺 3 ns
+印鼻 3 ns
+危 609 n
+危之士 3 nr
+危乎 3 v
+危于累卵 3 i
+危亡 237 v
+危亡之秋 3 i
+危亡之际 3 n
+危亦林 4 nr
+危则立 2 nr
+危力 2 n
+危厄 2 an
+危及 478 v
+危可解 2 i
+危品 256 n
+危在旦夕 67 i
+危地马拉 145 ns
+危地马拉城 3 ns
+危地马拉政府 3 ns
+危坐 6 v
+危城 15 n
+危境 27 n
+危墙 3 n
+危壁 3 n
+危如 3 v
+危如朝露 3 i
+危如累卵 12 i
+危实安 2 nz
+危室 3 n
+危室壁 2 nr
+危害 1781 n
+危害不大 3 i
+危害别人 3 n
+危害性 76 n
+危害面 3 n
+危局 106 n
+危岩 7 n
+危峰 4 n
+危崖 28 n
+危急 1161 a
+危急关头 3 i
+危急存亡 9 i
+危急性 3 n
+危急情况 3 n
+危惧 12 an
+危房 67 n
+危房改造 3 n
+危改 3 v
+危方 2 n
+危旧房 10 n
+危旧房屋 3 n
+危月燕 5 nr
+危机 4310 n
+危机四伏 61 i
+危机意识 3 n
+危机感 88 n
+危机重重 3 i
+危楼 11 n
+危殆 41 a
+危疑 5 v
+危禁品 2 n
+危立 2 v
+危笃 5 nr
+危而不持 3 i
+危而复 2 i
+危若安 3 nr
+危若朝露 3 i
+危若累卵 2 i
+危言 18 n
+危言危行 3 i
+危言核论 3 n
+危言正色 3 i
+危言竦论 3 vn
+危言耸听 95 i
+危言覈论 3 nz
+危言逆耳 3 i
+危言高论 3 i
+危语 3 n
+危象 12 n
+危象期 2 n
+危辞耸听 3 i
+危途 3 n
+危邦 2 n
+危重 92 n
+危重病 3 n
+危重症 5 n
+危陋平房 3 i
+危险 3979 an
+危险区 12 n
+危险品 19 n
+危险废物 3 n
+危险度 6 n
+危险性 210 n
+危险期 22 n
+危险源 2 n
+危险点 3 n
+危险物 7 n
+危险物品 6 n
+危险率 3 n
+危难 582 an
+危须 2 n
+即 34677 v
+即为 3 c
+即事穷理 3 i
+即今 3 t
+即令 275 c
+即以其人之道 12 i
+即位 1214 v
+即使 6462 c
+即使如此 21 l
+即便 2075 c
+即便如此 3 l
+即候 3 d
+即兴 160 b
+即兴之作 7 l
+即兴曲 10 ns
+即兴诗 3 l
+即刻 433 d
+即刻义齿 3 i
+即刻起 3 l
+即化 3 v
+即可 1052 d
+即告 3 v
+即墨 68 v
+即墨县 3 ns
+即墨市 14 ns
+即夜 3 t
+即好 3 d
+即如 3 c
+即将 2643 d
+即将来临 3 ns
+即小见大 3 i
+即已 3 d
+即席 37 v
+即席演讲 3 l
+即席讲演 3 n
+即度 3 d
+即成 3 v
+即或 28 c
+即打即现 3 i
+即插即用 4 i
+即日 437 t
+即日起 3 l
+即早 3 d
+即时 428 c
+即时性 4 d
+即时战略 3 n
+即时新闻 3 i
+即时比分 3 l
+即时消息 3 l
+即时清结 3 l
+即时联想 3 n
+即时贴 3 n
+即时运算 3 l
+即时通 3 d
+即时通讯 3 nz
+即是 3 c
+即是色 3 l
+即景 26 n
+即景生情 3 n
+即有 3 c
+即期 40 d
+即期支票 3 n
+即欧 3 ns
+即温听厉 3 i
+即物穷理 6 n
+即纳 3 v
+即若 8 c
+即行 3 v
+即要 3 c
+即逝 3 v
+即速 3 d
+即食 7 v
+即鹿无虞 3 i
+却 61348 d
+却不曾 3 d
+却之不恭 20 i
+却令谷 2 nr
+却似龙 2 nr
+却俱臻 2 nr
+却又静 2 nr
+却大异 2 nr
+却宛似 2 nr
+却尘缘 3 nr
+却尚远 2 nr
+却引兵 5 nr
+却引军 2 nr
+却微 2 d
+却恭谨 2 nr
+却愀然 3 z
+却明明 9 nr
+却是 7797 d
+却朝南 2 nr
+却柔声 3 nr
+却步 5 d
+却没能 3 v
+却浑然 3 nr
+却甜甜 5 nr
+却病延年 3 i
+却老还童 3 nr
+却行求前 3 i
+却见杨 2 nr
+却见潇 2 nr
+却见瑛 3 nr
+却见鲁 2 nr
+却译成 16 nr
+却说 1921 v
+却运劲 2 nr
+却道 3 d
+却金暮夜 3 nr
+却露 2 v
+却静静 2 nr
+卵 1546 n
+卵与石斗 3 n
+卵原细胞 3 n
+卵圆形 3 n
+卵块 12 n
+卵块发育 3 n
+卵壳 20 n
+卵壳蛋白 3 n
+卵子 129 n
+卵孢子 5 n
+卵寄生物 3 n
+卵巢 357 n
+卵巢功能 3 b
+卵巢囊肿 3 n
+卵巢癌 38 n
+卵式生殖 3 n
+卵形 184 n
+卵形瓶 3 n
+卵形面 3 n
+卵核 3 n
+卵核分裂 3 n
+卵母细胞 3 n
+卵泡 60 n
+卵生 101 n
+卵用鸡 3 n
+卵白 14 n
+卵石 111 n
+卵石不敌 3 n
+卵磷脂 23 n
+卵管 3 n
+卵粘蛋白 3 n
+卵细胞 77 n
+卵翼 11 n
+卵翼之下 3 n
+卵胎生 3 n
+卵膜 3 n
+卵蛋 3 n
+卵裂 3 n
+卵覆鸟飞 3 n
+卵质 3 n
+卵配子 3 n
+卵鞘蛋白 3 n
+卵黄 52 b
+卵黄生成 3 n
+卵黄磷肽 3 n
+卵黄蛋白 3 n
+卷 5269 m
+卷上 40 n
+卷丹 3 ns
+卷云 16 n
+卷住 3 v
+卷儿 13 n
+卷入 332 v
+卷入漩涡 3 n
+卷入纠纷 3 z
+卷内 6 s
+卷册 3 v
+卷动 4 v
+卷动门 3 n
+卷发 32 v
+卷发器 3 n
+卷发夹 3 n
+卷取 3 v
+卷叶虫 3 n
+卷叶蛾 6 n
+卷叶螟 2 n
+卷吸作用 2 l
+卷商 3 n
+卷回恢复 3 l
+卷图 3 n
+卷土重来 126 l
+卷士重来 3 i
+卷子 166 n
+卷子本 3 n
+卷宗 295 nz
+卷尺 3 n
+卷尾 14 n
+卷尾猴 16 n
+卷层云 13 l
+卷布 4 v
+卷帘 33 n
+卷帘格 3 n
+卷帘门 2 n
+卷帙 15 n
+卷帙浩繁 23 l
+卷席而居 3 i
+卷席而葬 3 n
+卷库 3 n
+卷心菜 84 n
+卷成 3 v
+卷扬 4 v
+卷扬机 10 i
+卷收 3 v
+卷数 8 n
+卷族 3 nz
+卷旗息鼓 3 i
+卷曲 96 n
+卷曲度 3 n
+卷曲螺旋 3 n
+卷曲霉素 3 n
+卷末 15 n
+卷杀 3 v
+卷材 2 n
+卷来卷去 3 i
+卷板机 3 n
+卷柏 16 n
+卷染 3 v
+卷款逃走 3 n
+卷毛 3 n
+卷烟 315 n
+卷烟厂 48 n
+卷烟机 3 n
+卷烟盒 3 n
+卷烟纸 6 n
+卷甲倍道 3 n
+卷甲束兵 3 n
+卷甲衔枚 3 i
+卷甲韬戈 3 i
+卷积 12 n
+卷积云 8 n
+卷积定理 3 n
+卷积码 3 n
+卷笔刀 3 n
+卷筒 40 n
+卷筒纸 3 n
+卷紧 3 v
+卷纬 3 n
+卷纸 3 n
+卷绕 22 v
+卷缠 3 v
+卷缩 3 v
+卷缩发 3 i
+卷舌 4 n
+卷舌元音 3 n
+卷舌音 4 n
+卷舒 3 n
+卷菸 3 vn
+卷袖 3 n
+卷装 3 n
+卷起 433 v
+卷轴 93 n
+卷轴式 3 nz
+卷轴架 3 n
+卷轴装 3 n
+卷进 52 v
+卷逃 8 v
+卷铺盖 18 l
+卷铺盖走人 5 i
+卷闸门 3 n
+卷面 24 n
+卷须 26 n
+卷领 3 n
+卷风 3 n
+卷首 26 n
+卷首语 3 i
+卸 955 v
+卸下 132 v
+卸下去 3 v
+卸下来 3 v
+卸任 151 v
+卸入 3 v
+卸到 3 v
+卸包狱 3 i
+卸去 77 v
+卸好 3 v
+卸妆 77 v
+卸妆乳 2 nz
+卸妆品 3 nz
+卸妆水 3 i
+卸妆油 3 nz
+卸妆液 4 nz
+卸完 3 v
+卸得 3 v
+卸成 3 v
+卸掉 37 v
+卸料 12 v
+卸法 3 v
+卸甲 3 v
+卸甲庄 3 nz
+卸甲归田 3 i
+卸磨杀驴 5 i
+卸职 13 v
+卸肩 3 v
+卸船 3 v
+卸荷 3 nz
+卸装 7 v
+卸装法 3 nz
+卸责 2 v
+卸责任 3 i
+卸货 31 v
+卸货口岸 3 i
+卸货机 3 nz
+卸货间 3 i
+卸车 19 v
+卸载 25 v
+卸载掉 3 i
+卸过 3 v
+卸过去 3 v
+卸过来 3 v
+卸进 3 v
+卸进去 3 v
+卸进来 3 v
+卸除 3 v
+卸除负荷 3 nz
+卺 4 g
+卻 14 zg
+卿 1123 nr
+卿兄弟 3 nr
+卿卿 14 nr
+卿卿我我 29 i
+卿士 11 nr
+卿大夫 29 nr
+卿本佳人 3 nr
+卿相 3 nr
+厀 11 zg
+厂 5728 zg
+厂主 52 n
+厂休 3 n
+厂办 5 j
+厂务 5 n
+厂区 35 n
+厂医 3 n
+厂卫 43 n
+厂史 3 n
+厂名 10 n
+厂商 1183 n
+厂商会 4 j
+厂商稿 3 n
+厂地 3 n
+厂场 3 n
+厂址 25 n
+厂子 115 n
+厂家 654 n
+厂家直销 3 n
+厂庆 5 n
+厂房 309 n
+厂房信息 3 n
+厂房设备 3 n
+厂方 38 n
+厂方直销 3 n
+厂校挂钩 3 n
+厂桥 3 n
+厂棚 3 n
+厂牌 5 n
+厂用电 3 n
+厂甸 4 n
+厂矿 103 n
+厂矿企业 3 j
+厂税 3 n
+厂籍 4 n
+厂级 3 n
+厂纪 2 n
+厂规 3 n
+厂部 17 n
+厂里 306 n
+厂长 789 n
+厂长室 2 n
+厂长负责 3 n
+厄 683 ns
+厄加勒斯角 11 ns
+厄勒 13 nrt
+厄境 3 n
+厄尔 34 nrt
+厄尔尼诺 77 nrt
+厄尔巴岛 8 nrt
+厄尔布鲁士山 5 ns
+厄尼 2 nrt
+厄斯金 3 nrt
+厄普 8 nrt
+厄瓜多尔 209 nrt
+厄瓜多尔人 4 nrt
+厄瓜多尔共和国 5 ns
+厄瓜多尔政府 6 nt
+厄立特里亚 101 ns
+厄米算符 3 n
+厄运 134 n
+厄里 3 nrt
+厄难 3 n
+厅 4146 n
+厅事 3 n
+厅堂 364 n
+厅子 3 n
+厅局 6 n
+厅局级 10 b
+厅局长 10 n
+厅属 3 n
+厅房 44 n
+厅级 14 b
+厅舍 3 n
+厅里 122 n
+厅长 406 n
+历 1988 n
+历七主 2 nr
+历三世 5 nr
+历三主 4 nr
+历三帝 4 nr
+历三朝 6 nr
+历下亭 2 nr
+历下区 25 n
+历世 17 n
+历世务 2 n
+历世摩钝 3 i
+历世更 16 nr
+历世磨钝 3 i
+历世诸 2 nr
+历为川 2 nr
+历为郡 4 nr
+历久 27 d
+历久不衰 10 l
+历久常新 3 i
+历久弥坚 3 nr
+历久弥新 5 l
+历之初 2 nr
+历之子 3 nr
+历九帝 2 nr
+历书 74 n
+历二主 2 nr
+历五朝 3 nr
+历井扪天 3 i
+历仕 5 n
+历仕八 2 nr
+历仕刘 2 nr
+历仕各 2 nr
+历代 2261 n
+历代先皇 3 nr
+历代帝王 3 n
+历代祖先 3 n
+历代记 3 n
+历任 1372 n
+历元 18 n
+历克塞 7 nr
+历克斯 2 nr
+历克谢 3 nr
+历六主 2 nr
+历兵 2 n
+历兵秣马 3 i
+历兵粟马 3 n
+历其境 3 n
+历劫 3 v
+历劫归来 3 i
+历十才 3 nr
+历南朝 3 nr
+历历 50 n
+历历可数 5 i
+历历可考 3 l
+历历可见 3 i
+历历可辨 3 l
+历历在目 74 i
+历历在耳 3 i
+历历如画 3 i
+历叙古 2 nr
+历史 34460 n
+历史主义 37 n
+历史书籍 3 n
+历史事实 3 n
+历史使命 3 n
+历史使命感 4 n
+历史关头 3 n
+历史剧 145 n
+历史博物馆 100 n
+历史名人 3 n
+历史唯物主义 155 n
+历史唯物论 2 n
+历史学 179 n
+历史学家 397 n
+历史学者 3 n
+历史小说 3 l
+历史性 669 n
+历史悠久 3 l
+历史感 21 n
+历史拟合 3 n
+历史教案 3 n
+历史教训 3 n
+历史数据 10 n
+历史文物 3 n
+历史文献 3 n
+历史档案 3 l
+历史沿革 3 nr
+历史渊源 3 l
+历史潮流 3 n
+历史状况 3 n
+历史瞬间 3 l
+历史系 129 n
+历史纪录 3 n
+历史组 6 n
+历史背景 3 n
+历史舞台 3 n
+历史观 109 n
+历史记录 5 n
+历史论文 3 n
+历史试题 3 n
+历史课 32 n
+历史进程 3 n
+历史长河 3 n
+历史风云 3 n
+历史风貌 3 n
+历后梁 2 nr
+历后汉 3 nr
+历四主 5 nr
+历城 25 n
+历城区 8 n
+历声 3 n
+历天子 5 nr
+历学应 2 n
+历官 8 n
+历官太 4 nr
+历官工 2 nr
+历官御 2 nr
+历官至 2 nr
+历官馆 2 n
+历害 4 n
+历封宗 2 nr
+历少保 3 nr
+历尽 96 d
+历尽沧桑 14 i
+历尽磨难 3 i
+历尽艰辛 24 i
+历尽艰难 3 i
+历届 508 b
+历山 13 n
+历山卓 14 nr
+历山川 2 ns
+历山德 2 nr
+历帝 7 n
+历帝朱 5 nr
+历年 420 n
+历年来 74 l
+历年试题 3 n
+历志 4 n
+历战阵 6 n
+历所闻 5 i
+历扼 3 l
+历数 71 n
+历新建 4 nr
+历新政 2 nr
+历日 3 n
+历日旷久 3 i
+历时 1618 n
+历昭帝 2 nr
+历是存 2 l
+历晋 2 n
+历月 3 n
+历朝 40 n
+历朝历代 48 i
+历朝均 2 nr
+历朝廷 9 nr
+历朝皇帝 5 nr
+历朝相 5 nr
+历本 3 n
+历来 2078 v
+历来如此 3 l
+历桑 2 n
+历桑德 2 nr
+历次 293 d
+历江 2 ns
+历法 309 n
+历炼 4 v
+历皇帝 5 nr
+历科 2 n
+历程 762 n
+历立成 2 nr
+历算 22 n
+历算论点 3 n
+历精为治 3 i
+历精图治 3 n
+历精更始 3 i
+历纪 2 n
+历练 78 n
+历练老成 3 nr
+历经 873 d
+历经沧桑 7 i
+历观 4 n
+历览 2 n
+历记 2 n
+历访 3 v
+历谱 6 n
+历象考 2 nr
+历阳 14 n
+历险 36 n
+历险地 3 n
+历险归来 3 i
+历险记 36 n
+历雨阅 3 nr
+历顺宗 2 nr
+厉 272 nr
+厉世摩钝 3 i
+厉之极 2 nr
+厉之色 2 nr
+厉以宁 21 nr
+厉先生 2 nr
+厉兵秣马 11 i
+厉兵粟马 3 nr
+厉厉 2 a
+厉声 977 d
+厉声厉色 3 i
+厉声叱斥 3 vn
+厉天闰 13 nr
+厉宁叹 2 nr
+厉宁道 6 nr
+厉害 3850 a
+厉庄镇 3 nr
+厉建中 3 nr
+厉无畏 264 i
+厉有为 2 nrfg
+厉王太子 2 nr
+厉王奔 5 nr
+厉王死 8 nr
+厉王赐 2 nr
+厉禁 3 d
+厉精图治 3 nr
+厉精更始 3 i
+厉色 2 a
+厉色严 2 nr
+厉行 47 a
+厉行改革 6 l
+厉行节俭 3 nr
+厉行节约 34 n
+厉颜厉 2 nr
+厉鬼 98 nr
+压 4586 v
+压下 3 n
+压下去 3 v
+压下来 3 l
+压下量 3 n
+压不住 3 v
+压不碎 3 v
+压井液 3 n
+压井阀 3 n
+压仰 3 n
+压价 39 n
+压低 475 v
+压住 3 v
+压倒 417 v
+压倒一切 3 i
+压倒优势 3 n
+压倒元白 3 l
+压倒多数 3 l
+压倒性 64 n
+压倒群雄 3 l
+压光 2 n
+压光机 2 n
+压克力 3 n
+压克力板 3 n
+压减 8 v
+压出 20 v
+压出去 3 v
+压出来 3 v
+压分 3 n
+压到 3 v
+压制 689 n
+压制住 3 v
+压制性 3 n
+压制版 3 n
+压制群众 3 n
+压力 6044 n
+压力仪表 3 n
+压力壳 7 n
+压力容器 3 l
+压力强度 3 n
+压力感 9 n
+压力机 15 n
+压力梯度 3 n
+压力表 7 n
+压力计 16 n
+压力跃变 3 nz
+压力锅 2 n
+压力降 3 n
+压匀 3 v
+压印 12 n
+压卷 2 n
+压卷之作 5 l
+压压 3 n
+压台 3 n
+压台戏 4 n
+压回 3 v
+压回去 3 l
+压回来 3 l
+压圈 3 n
+压土机 3 n
+压在心底 3 l
+压场 3 n
+压场戏 3 n
+压坏 3 v
+压块 3 n
+压型 6 n
+压型制品 3 n
+压型板 3 n
+压垮 33 v
+压塌 10 v
+压塑 2 n
+压境 64 n
+压够 3 v
+压头 4 n
+压好 3 v
+压完 3 v
+压宝 3 n
+压实 32 n
+压实校正 3 n
+压寨 3 n
+压寨夫人 9 n
+压岁 6 n
+压岁钱 41 n
+压差 15 n
+压带 3 n
+压平 34 n
+压库 3 n
+压底 3 n
+压延 31 v
+压延性 3 n
+压延机 3 n
+压弯 18 n
+压强 202 v
+压强计 3 l
+压得 3 v
+压惊 40 v
+压感 5 n
+压扁 3 n
+压扭作用 3 l
+压抑 664 v
+压抑感 13 n
+压抑着 3 l
+压担子 3 n
+压挤 3 v
+压敏 7 v
+压敏电阻 3 n
+压敏粘合 3 n
+压敏胶 3 n
+压服 48 n
+压机 2 n
+压条 48 n
+压条法 3 n
+压条繁殖 3 l
+压板 5 n
+压枝 3 n
+压根 142 n
+压根儿 236 n
+压案不查 3 l
+压榨 130 v
+压榨器 3 nz
+压榨机 5 nz
+压死 69 v
+压气 3 n
+压气机 22 n
+压水井 2 n
+压水堆 38 n
+压港 3 n
+压滤 3 v
+压滤机 3 n
+压焊 2 n
+压片 8 n
+压片机 3 n
+压电 102 n
+压电体 3 n
+压电式 3 n
+压电性 3 n
+压电效应 17 n
+压痕 3 n
+压痕机 3 l
+压痕硬度 3 l
+压痛 103 n
+压盖 4 n
+压盘石 3 n
+压直 3 d
+压砖机 3 n
+压破 3 vn
+压碎 3 v
+压碟 3 n
+压秤 3 n
+压箱底 3 n
+压簧 3 n
+压紧 3 v
+压线 3 n
+压缩 718 v
+压缩冲量 3 n
+压缩力 3 n
+压缩功 3 n
+压缩包 3 n
+压缩卡 3 n
+压缩器 4 n
+压缩工具 3 n
+压缩性 26 n
+压缩成 3 v
+压缩文件 3 n
+压缩机 79 n
+压缩比 3 n
+压缩氧 3 n
+压缩版 3 n
+压缩率 3 n
+压缩盘 3 n
+压缩空气 35 n
+压缩算法 8 n
+压缩系数 3 n
+压缩软件 3 n
+压缩饼干 11 n
+压群芳 3 n
+压而不服 3 l
+压肩叠背 3 l
+压肩迭背 3 l
+压脚 2 n
+压腿 4 n
+压舌板 3 n
+压舱 6 n
+压舱物 3 v
+压船 3 n
+压良为贱 3 l
+压花 3 n
+压花机 3 n
+压花玻璃 3 n
+压藤 3 n
+压裂 3 v
+压裂液 3 n
+压裂管柱 3 n
+压裂车 3 n
+压觉适应 3 n
+压账 3 n
+压货 6 n
+压起 3 v
+压起来 3 l
+压路 3 n
+压路机 12 n
+压轴 28 n
+压轴好戏 3 l
+压轴子 3 n
+压轴戏 18 n
+压载 16 v
+压边 3 n
+压过 3 v
+压近 3 v
+压进 3 v
+压进去 3 v
+压进来 3 l
+压迫 1546 v
+压迫感 13 n
+压迫者 30 n
+压逼 3 v
+压铸 4 v
+压铸件 3 n
+压铸厂 3 n
+压铸机 3 n
+压铸模 3 n
+压锭 26 n
+压阑石 3 i
+压队 3 n
+压阵 26 n
+压雪求油 3 n
+压面机 2 n
+压韵 3 n
+压顶 18 n
+压题 29 n
+压马路 3 n
+压齐 3 d
+厌 551 v
+厌世 20 v
+厌倦 228 v
+厌倦感 3 vn
+厌厌 3 v
+厌吃 3 v
+厌学 3 v
+厌弃 57 v
+厌恨 3 v
+厌恶 568 v
+厌恶感 3 n
+厌恶疗法 3 n
+厌憎 3 n
+厌战 14 v
+厌战心理 3 n
+厌战情绪 3 n
+厌故喜新 3 n
+厌旧喜新 3 n
+厌氧发酵 3 n
+厌氧胶 3 n
+厌氧菌 22 n
+厌烦 236 v
+厌烦感 11 n
+厌物病 3 n
+厌腻 3 n
+厌足 3 v
+厌闻饫听 3 vn
+厌难折冲 3 n
+厌食 47 v
+厌食症 13 n
+厍 155 g
+厍狻保 2 nr
+厍蛟硕 2 nr
+厐 2 zg
+厑 4 zg
+厓 29 zg
+厔 70 zg
+厕 141 n
+厕坑 3 n
+厕所 906 n
+厕所间 3 n
+厕足其间 3 n
+厕身 3 n
+厕身其间 3 n
+厖 55 zg
+厗 3 zg
+厘 428 m
+厘出 3 m
+厘升 3 q
+厘定 24 v
+厘摩 3 v
+厘正 3 v
+厘清 22 vn
+厘米 3894 q
+厘米波 11 n
+厘订 3 v
+厘金 3 n
+厚 4878 a
+厚人薄己 3 i
+厚今薄古 3 i
+厚利 3 nz
+厚厚 102 a
+厚厚的 461 z
+厚古薄今 2 i
+厚味 18 n
+厚味腊毒 3 nz
+厚嘴唇 3 n
+厚型 8 n
+厚墩墩 8 z
+厚壁 36 n
+厚壁孢子 3 nz
+厚壁组织 3 n
+厚大 3 a
+厚实 157 a
+厚实实 3 z
+厚层压板 3 n
+厚己薄人 3 i
+厚度 685 n
+厚彼薄此 3 i
+厚往薄来 3 i
+厚待 36 v
+厚德 3 nz
+厚德国小 3 n
+厚德载物 3 i
+厚德载福 3 nz
+厚恩 55 n
+厚意 64 n
+厚望 111 a
+厚朴 47 a
+厚朴花 3 z
+厚板 7 n
+厚植国力 3 n
+厚此薄彼 15 i
+厚泽 3 n
+厚漆 3 z
+厚点 3 n
+厚爱 86 a
+厚片 3 n
+厚生 11 n
+厚生利用 3 n
+厚生省 3 n
+厚用 3 n
+厚电 3 nz
+厚皮 15 n
+厚着脸皮 3 i
+厚礼 108 nz
+厚禄 3 n
+厚禄高官 3 n
+厚福 3 nz
+厚积 5 n
+厚积薄发 12 i
+厚粉 3 n
+厚纸 3 nz
+厚纸板 3 nz
+厚脸 3 n
+厚脸皮 13 n
+厚腻 3 a
+厚茧 4 n
+厚茸茸 3 z
+厚葬 42 n
+厚薄 84 a
+厚薄规 3 i
+厚薪 3 n
+厚街镇 3 n
+厚角组织 3 n
+厚谊 2 nz
+厚谢 3 v
+厚貌深情 3 i
+厚貌深文 3 i
+厚貌深辞 3 i
+厚赐 3 n
+厚软 3 a
+厚透镜 3 nz
+厚遇 3 n
+厚道 122 n
+厚道人 16 n
+厚重 435 a
+厚重感 10 n
+厚非 3 n
+厚颜 5 n
+厚颜无耻 44 i
+厚黑学 3 n
+厛 194 zg
+厜 147 zg
+厝 74 ns
+厝火燎原 3 vn
+厞 4 zg
+原 16926 n
+原东 2 n
+原东德 3 nr
+原丝体 7 n
+原中法 2 n
+原丹徒 2 nr
+原为 3 d
+原主 36 n
+原义 17 n
+原乡 8 n
+原乡勇 3 nr
+原书久 3 nr
+原书名 3 n
+原于 3 d
+原交 3 n
+原产 276 n
+原产地 83 n
+原产物 3 n
+原京汉 3 nr
+原人 15 n
+原代 3 n
+原代码 3 n
+原以 3 d
+原以为 3 nr
+原件 221 n
+原价 87 n
+原任 3 n
+原位 72 n
+原位杂交 3 n
+原位癌 11 n
+原住民 17 n
+原体 48 n
+原作 101 n
+原作者 7 n
+原值 12 n
+原儿茶酸 3 n
+原先 1083 d
+原六镇 2 nr
+原兴藏 2 nr
+原典 3 n
+原军 4 n
+原函数 3 n
+原分生 3 n
+原则 9541 n
+原则上 359 d
+原则同意 3 l
+原则性 87 d
+原则立场 3 n
+原创 214 n
+原创性 14 n
+原初 48 d
+原判 28 n
+原动力 29 n
+原动机 23 n
+原印钤 2 nr
+原厂 2 n
+原原委委 3 n
+原原本本 58 n
+原发 92 d
+原发型 4 n
+原发性 124 n
+原发灶 3 n
+原发癌 4 n
+原可宽 2 nr
+原可攀 2 nr
+原史奈 3 nr
+原叶体 7 n
+原名 1278 n
+原告 412 n
+原告人 3 n
+原告席 5 n
+原告方 5 n
+原味 12 n
+原哈建 2 nr
+原唱 3 n
+原唱者 3 n
+原器 5 n
+原因 12682 n
+原因无他 3 l
+原国统 2 n
+原国芳 2 nr
+原图 6 n
+原图片 3 n
+原在东 2 nr
+原地 479 n
+原地不动 3 l
+原地保存 3 n
+原地待命 3 l
+原地打转 3 l
+原地踏步 3 d
+原址 309 n
+原坡 11 n
+原型 473 n
+原型机 176 n
+原型说 3 l
+原型车 3 n
+原基 8 n
+原声 3 d
+原声带 3 n
+原声集 3 n
+原处 30 d
+原大 3 a
+原大清 2 nr
+原太平 2 nr
+原始 3432 v
+原始人 98 n
+原始公社 75 n
+原始农业 3 n
+原始凭证 3 n
+原始动物 3 n
+原始反终 3 l
+原始型 3 n
+原始思维 3 nr
+原始性 16 n
+原始数据 17 n
+原始时代 3 n
+原始林 17 nr
+原始森林 3 nr
+原始社会 250 n
+原始积累 75 l
+原始群 14 n
+原始股 3 n
+原始舞 3 n
+原始要终 4 l
+原始见终 3 l
+原始规 3 n
+原始记录 3 n
+原始部落 3 l
+原委 204 n
+原子 2306 n
+原子事件 3 n
+原子价 5 n
+原子光谱 32 n
+原子公式 7 n
+原子力 4 n
+原子化 2 n
+原子反应 3 l
+原子反应堆 11 l
+原子团 28 n
+原子城 22 nr
+原子基 2 nr
+原子学 3 n
+原子实 4 n
+原子尘 3 n
+原子序 3 n
+原子序数 119 n
+原子弹 509 n
+原子数 2 n
+原子时代 3 n
+原子束 12 n
+原子核 478 n
+原子核反 3 l
+原子格 3 n
+原子武器 34 n
+原子灰 3 n
+原子炉 3 n
+原子炸弹 3 n
+原子物理 3 n
+原子理论 3 n
+原子笔 6 n
+原子簇 8 nr
+原子级 3 n
+原子结构 57 n
+原子能 303 n
+原子能发电站 4 n
+原子能委 3 n
+原子能学 3 n
+原子能部 2 n
+原子芯 3 nr
+原子荧光 3 nr
+原子论 3 n
+原子质量 3 n
+原子轨道 3 n
+原子量 244 n
+原子鏸 3 vn
+原子钟 29 nr
+原子锅 3 n
+原子间 2 n
+原子频标 3 n
+原守关 3 n
+原官品 2 n
+原定 402 d
+原宜 3 n
+原审 7 n
+原宣治 4 nr
+原宥 5 n
+原封 12 n
+原封不动 43 l
+原封未动 7 l
+原尔朱 2 nr
+原尾虫 2 n
+原属 3 n
+原山煌 2 ns
+原岗 3 n
+原岩 25 n
+原峰村 3 n
+原崇信 4 nr
+原州区 3 ns
+原巴勒 2 nr
+原帖 3 n
+原平 24 n
+原平县 3 ns
+原平市 7 n
+原式 3 n
+原形 60 n
+原形毕露 22 i
+原形败露 3 i
+原形质 3 n
+原心定罪 3 l
+原性 8 n
+原意 265 d
+原指 3 n
+原振侠 3 nr
+原故 75 n
+原教旨 3 n
+原教旨主义 23 n
+原文 331 n
+原文中 4 nr
+原文书 3 n
+原文件 3 n
+原料 4055 n
+原料及主 3 n
+原料库 3 n
+原料林 3 n
+原料油 3 n
+原料类 2 n
+原料药 74 n
+原无 3 l
+原旧 3 d
+原明亮 10 nr
+原易好 3 n
+原是 3 d
+原是武 2 nr
+原曲 3 n
+原有 2285 v
+原木 63 n
+原木色 3 n
+原本 1923 n
+原本会 3 n
+原本穷末 3 n
+原机 3 n
+原杉达 2 nr
+原材 5 n
+原材料 958 n
+原条 2 n
+原来 15084 d
+原来如此 276 l
+原样 75 d
+原核 107 n
+原核细胞 3 n
+原案 34 n
+原棉 6 n
+原款 3 n
+原毛 3 n
+原水 43 n
+原永昌 2 nr
+原汁 8 n
+原汁原味 57 n
+原油 729 n
+原油价格 3 n
+原油分析 3 l
+原油期货 3 n
+原注 7 v
+原浆 3 n
+原液 2 n
+原点 52 n
+原煤 104 n
+原片 2 n
+原版 55 n
+原版书 3 n
+原物 88 n
+原状 79 n
+原猴亚 6 nr
+原班 18 n
+原班人马 16 ns
+原球茎 3 n
+原理 3267 n
+原理图 2 n
+原理篇 3 n
+原璧归赵 3 i
+原生 181 n
+原生动物 108 n
+原生地 2 n
+原生孔隙 3 n
+原生态 46 n
+原生性 2 n
+原生晕 3 n
+原生植物 3 l
+原生矿物 4 n
+原生质 62 n
+原用 3 n
+原田 9 n
+原由 178 n
+原由子 3 n
+原电池 3 n
+原画 3 n
+原画集 3 n
+原癌基因 3 n
+原盐 37 n
+原盘 3 n
+原直野 5 nr
+原着 3 v
+原着者 3 n
+原知 3 n
+原石榴 2 n
+原石重 2 n
+原矿 8 n
+原码 3 n
+原研 2 n
+原研药 2 n
+原碟 3 n
+原秀夫 2 nr
+原种 3337 n
+原种场 1024 n
+原称义 3 n
+原程序 3 n
+原税 3 n
+原稿 62 n
+原稿纸 3 n
+原穴 3 n
+原籍 257 n
+原粮 3 n
+原糖 2 n
+原素 7 n
+原索动物 2 n
+原线圈 4 n
+原络配穴 3 n
+原统军 2 n
+原绢 2 n
+原罪 49 n
+原职 3 n
+原聚友 2 n
+原肠祖 2 n
+原肠胚 8 n
+原胶 12 n
+原自 3 d
+原色 32 n
+原苏联 3 ns
+原苻坚 3 nr
+原著 97 n
+原虫 23 n
+原被告 2 nr
+原装 50 n
+原装机 3 n
+原装电话 3 l
+原装货 3 n
+原西京 4 ns
+原西康 3 nr
+原西来 2 nr
+原西河 10 nr
+原西籍 4 n
+原西鹤 3 nr
+原订 3 v
+原证 3 n
+原诉 3 v
+原词 3 n
+原诗 2 n
+原话 37 n
+原语 4 n
+原说话 3 l
+原谅 617 nr
+原象 2 n
+原貌 75 n
+原贤二 10 nr
+原质 3 n
+原质团 2 n
+原路 3 n
+原路潜 2 nr
+原载 3 v
+原辅料 3 l
+原辅材料 9 l
+原配 45 v
+原酒 7 n
+原野 249 n
+原野奇侠 3 nr
+原野游侠 3 n
+原金丰 7 nr
+原银 2 n
+原队 3 n
+原队人马 3 n
+原阳 15 n
+原阳县 6 ns
+原需 3 n
+原非易 2 l
+原音 3 n
+原须 3 d
+原鸽 5 n
+原鹿 2 n
+厠 59 zg
+厡 17 zg
+厢 462 n
+厢式 2 n
+厢式车 3 n
+厢房 546 n
+厢拱 3 n
+厢橱 3 n
+厢间 3 n
+厣 82 g
+厤 51 zg
+厥 291 r
+厥为 3 nz
+厥功甚伟 3 nr
+厥脱 3 nz
+厥证 3 nz
+厥阴 3 nz
+厥阴俞 3 nr
+厦 274 ns
+厦中 3 ns
+厦华 27 nz
+厦华公司 3 nt
+厦南 5 ns
+厦大 25 ns
+厦新 4 ns
+厦禾路 3 vn
+厦航 2 j
+厦门 943 ns
+厦门人 7 nz
+厦门信达 5 nt
+厦门厦新 2 nz
+厦门大学 85 nt
+厦门岛 7 ns
+厦门市 106 ns
+厦门市委 2 nt
+厦门房产 3 n
+厦门日报 3 nz
+厦门港 11 ns
+厦门经济特区 3 nt
+厦门航空 3 nt
+厦门航空公司 4 nt
+厦门路 19 ns
+厦门队 159 nt
+厧 18 zg
+厨 401 n
+厨具 9 n
+厨具全 3 n
+厨刀 7 n
+厨卫 12 n
+厨园 3 n
+厨娘 3 n
+厨子 141 n
+厨工 6 n
+厨师 209 n
+厨师长 4 n
+厨房 1023 n
+厨房家具 3 n
+厨房用 2 n
+厨房用具 3 n
+厨房用品 3 n
+厨房电器 3 n
+厨房设备 3 n
+厨房设施 3 n
+厨房门 6 n
+厨手 3 n
+厨柜 3 n
+厨灶 3 n
+厨神 3 n
+厨艺 27 n
+厩 89 n
+厩肥 11 n
+厫 13 zg
+厬 4 zg
+厭 86 zg
+厮 1249 v
+厮守 111 v
+厮打 110 v
+厮杀 505 v
+厮混 68 v
+厮缠 2 v
+厰 20 zg
+厱 4 zg
+厲 3 zg
+厶 47 g
+厷 168 zg
+厹 7 zg
+厺 4 zg
+去 123402 v
+去一趟 3 v
+去不去 3 t
+去不成 3 v
+去世 1590 t
+去买烟 3 n
+去伪存真 14 l
+去住两难 3 i
+去冠器 3 n
+去冬 28 t
+去冬今春 5 l
+去函 3 n
+去势 168 n
+去危就安 3 l
+去去 3 t
+去去就来 3 l
+去取 333 v
+去向 307 v
+去向不明 3 l
+去垢 3 n
+去处 470 v
+去夏 17 t
+去天尺五 3 n
+去太去甚 3 i
+去头去尾 3 i
+去就之分 3 l
+去屑 2 n
+去岁 28 t
+去年 6730 t
+去年今天 3 l
+去年初 32 t
+去年同期 3 n
+去年底 176 t
+去年末 8 t
+去年此时 3 l
+去往 56 t
+去恶从善 3 i
+去拿礼乐 3 i
+去掉 238 v
+去故就新 3 i
+去故纳新 3 i
+去日 3 t
+去暑 3 t
+去暗投明 3 i
+去末归本 3 n
+去本就末 3 n
+去本趋末 3 n
+去杀胜残 3 i
+去杂去劣 3 n
+去极化 3 n
+去核 10 v
+去模糊 3 l
+去死吧 3 n
+去死皮 3 n
+去汙粉 3 v
+去污 18 v
+去污剂 3 n
+去污力 2 n
+去污粉 4 n
+去污系数 3 n
+去泰去甚 3 i
+去浄 3 vq
+去湿机 3 n
+去甚去泰 3 i
+去甲 31 n
+去留 93 v
+去痛片 4 n
+去皮 36 n
+去看房 3 v
+去石 25 n
+去磁 3 n
+去离子水 3 n
+去秋 12 t
+去粗取精 12 l
+去者 27 n
+去职 40 v
+去胶 3 n
+去腥 3 n
+去芜存菁 3 nz
+去蔽 3 v
+去蜡 3 n
+去角质 3 n
+去路 334 n
+去过 550 vq
+去逛 3 v
+去逝 3 v
+去邪归正 3 i
+去除 222 v
+去除率 3 n
+去食存信 3 l
+去鳞 3 n
+厼 4 zg
+县 25322 zg
+县一中 3 n
+县上 198 n
+县丞 23 n
+县乡 16 n
+县乡镇 2 n
+县人委 3 n
+县令 294 n
+县份 60 n
+县公安局 3 n
+县内 32 n
+县区 28 n
+县县 27 n
+县名 3 n
+县吏 34 n
+县团级 6 n
+县城 1500 n
+县域 297 n
+县境 837 n
+县处级 7 b
+县太爷 56 n
+县委 1363 n
+县委书记 3 n
+县委会 2 n
+县学 3 n
+县官 103 n
+县尉 51 n
+县局 3 n
+县属 28 n
+县差 3 n
+县市 2458 n
+县市区 515 n
+县市政府 3 n
+县市级 2 b
+县市长 4 n
+县府 365 n
+县志 52 n
+县总工会 3 n
+县情 3 n
+县惑 3 n
+县政 7 n
+县政协 10 j
+县政府 1115 n
+县检察院 3 n
+县民 12 n
+县治 3 n
+县法院 3 n
+县狱 3 n
+县界 3 n
+县监狱 3 n
+县直机关 3 n
+县知事 16 n
+县立 7 b
+县级 3647 b
+县级市 1180 n
+县老爷 3 n
+县联社 5 n
+县衙 112 n
+县衙门 3 n
+县议会 3 n
+县议员 3 n
+县辖市 3 n
+县运会 3 n
+县道 2 n
+县里 353 n
+县镇 3 n
+县长 2752 n
+县院 3 n
+叁 28 m
+叁天 3 m
+参 2849 n
+参上 3 v
+参不透 3 v
+参与 7060 v
+参与制 3 n
+参与度 12 n
+参与性 24 n
+参与感 4 n
+参与方 2 n
+参与权 10 n
+参与率 2 n
+参与者 175 n
+参事 52 v
+参事官 7 n
+参事室 9 n
+参伍错纵 3 n
+参伍错综 3 n
+参众两院 30 j
+参会 112 v
+参会者 7 n
+参佐 3 v
+参保 36 v
+参军 359 n
+参军事 5 n
+参军入伍 3 n
+参前倚衡 3 i
+参加 22828 v
+参加国 20 n
+参加考试 3 n
+参加者 129 n
+参加锻炼 3 nz
+参加骚动 3 l
+参劾 17 v
+参半 26 v
+参变量 3 n
+参合 33 v
+参商 8 v
+参商之虞 3 i
+参回斗转 3 l
+参团 51 n
+参堂 3 n
+参天 82 v
+参天两地 3 i
+参天大树 14 n
+参天贰地 3 z
+参奏 8 v
+参展 278 v
+参展人 2 n
+参展商 45 n
+参展团 9 n
+参展国 23 n
+参展者 3 n
+参差 235 n
+参差不一 3 l
+参差不齐 101 i
+参差错落 8 i
+参建 2 v
+参悟 59 v
+参战 501 v
+参战国 10 n
+参拍者 5 n
+参拜 156 v
+参拜者 2 n
+参政 246 n
+参政会 88 n
+参政党 29 nt
+参政员 40 n
+参政权 3 n
+参政议政 72 n
+参数 1670 n
+参数井 3 n
+参数传递 15 l
+参数估计 3 n
+参数信息 2 n
+参数值 7 n
+参数均 2 n
+参数块 3 n
+参数检验 3 n
+参数簇 3 i
+参数表 2 n
+参数设置 3 n
+参数集总 3 n
+参杂 35 v
+参校 3 n
+参横斗转 3 i
+参比电极 3 n
+参演 185 v
+参照 553 v
+参照卡 3 n
+参照实行 3 n
+参照物 22 n
+参照系 18 n
+参看 102 v
+参知政事 98 n
+参禅 61 v
+参编 3 v
+参考 2597 v
+参考书 126 n
+参考书目 3 n
+参考价 28 n
+参考价值 3 n
+参考价格 3 n
+参考值 6 n
+参考圆 3 n
+参考字 3 n
+参考室 3 n
+参考性 4 n
+参考手册 3 n
+参考报 3 n
+参考文献 3 n
+参考模型 4 n
+参考法 3 n
+参考消息 27 n
+参考点 9 n
+参考特藏 3 n
+参考答案 3 n
+参考系 69 n
+参考资料 3 n
+参联会 20 j
+参股 76 v
+参芪 3 n
+参茸 4 n
+参见 718 v
+参见互照 3 l
+参见注 3 v
+参观 1978 n
+参观券 3 n
+参观团 20 n
+参观团体 3 n
+参观指导 3 n
+参观点 11 n
+参观票 3 n
+参观者 82 n
+参观记 3 n
+参议 146 n
+参议会 35 n
+参议员 175 n
+参议长 3 n
+参议院 951 n
+参访 4 v
+参访团 11 n
+参评 47 v
+参试 12 v
+参详 3 v
+参谋 919 v
+参谋军士 3 n
+参谋处 13 n
+参谋总部 3 n
+参谋总长 3 n
+参谋部 125 n
+参谋长 819 n
+参谒 12 v
+参赌 19 v
+参赌者 2 j
+参赛 733 n
+参赛国 7 n
+参赛权 3 n
+参赛者 34 n
+参赛证 6 n
+参赛选手 3 n
+参赛队 21 n
+参赞 578 v
+参赞处 3 nz
+参辰卯酉 3 l
+参辰日月 3 i
+参选 79 v
+参选人 13 n
+参选者 2 n
+参透 29 v
+参透机关 3 n
+参道 3 v
+参酌 15 v
+参量 167 n
+参错 3 v
+参阅 62 v
+参附汤 10 n
+参院 20 n
+参预 230 v
+參 31 zg
+叅 2 zg
+叆 127 zg
+叇 8 zg
+又 150749 d
+又会到 3 l
+又会在 3 l
+又会有 3 l
+又作别论 5 l
+又创新高 3 l
+又名 2093 n
+又哭又笑 3 l
+又哭又闹 17 l
+又坏了 3 l
+又复归于 3 l
+又弱一个 3 n
+又当别论 5 l
+又快又好 3 l
+又惊又喜 411 l
+又成画饼 3 n
+又打又骂 3 l
+又摇又摆 3 l
+又有何难 3 l
+又爱又怕 3 l
+又生一秦 3 nr
+又称 7008 n
+又红又专 8 l
+又臭又长 3 l
+又饥又渴 3 l
+又高又大 3 l
+又黄又瘦 3 l
+叉 1397 n
+叉住 3 v
+叉叉 3 v
+叉号 3 n
+叉子 31 n
+叉开 28 v
+叉形 3 n
+叉手 69 v
+叉架 3 n
+叉烧 6 v
+叉烧包 3 n
+叉烧饭 3 n
+叉腰 49 v
+叉路 3 n
+叉路口 6 n
+叉车 35 n
+叉车配件 3 n
+叉鱼 3 n
+叉齿 3 n
+及 49988 c
+及于 3 c
+及其 12663 c
+及冠 3 n
+及宾有鱼 3 n
+及早 393 d
+及早准备 3 i
+及时 3762 c
+及时努力 3 n
+及时发现 3 i
+及时处理 3 i
+及时性 7 d
+及时行乐 5 n
+及时雨 53 i
+及格 148 ad
+及格率 6 n
+及格线 16 n
+及格者 3 n
+及格赛 3 n
+及格边缘 3 n
+及溺呼船 3 v
+及物动词 3 n
+及瓜而代 3 i
+及笄 9 v
+及笄年华 3 vn
+及第 67 n
+及第成名 3 n
+及至 463 c
+及锋而试 3 i
+友 1271 ng
+友人 239 n
+友人网 3 n
+友党 3 n
+友军 96 n
+友协 71 j
+友友 3 n
+友台 3 n
+友善 170 a
+友坂 3 ns
+友坂理惠 3 nr
+友好 2568 a
+友好人士 3 n
+友好代表 3 n
+友好使者 3 n
+友好关系 3 n
+友好区 3 n
+友好合作 3 a
+友好周 3 nr
+友好城市 3 n
+友好度 3 a
+友好往来 3 nr
+友好条件 3 n
+友好条约 3 n
+友好用户 3 n
+友好相处 3 n
+友好襄助 3 nr
+友好访问 3 n
+友好邻邦 3 nr
+友弟 2 n
+友情 218 n
+友情网 3 n
+友情链接 3 nr
+友方 3 n
+友朋 6 n
+友机 4 n
+友爱 203 a
+友爱新党 3 nt
+友生 3 n
+友矩阵 3 nr
+友社 3 n
+友社区 3 n
+友联 2 ns
+友舰 3 n
+友谊 1499 nr
+友谊关 36 ns
+友谊医院 22 nt
+友谊县 3 ns
+友谊商店 3 nt
+友谊大学 3 nt
+友谊峰 20 nr
+友谊座 3 nr
+友谊林 3 nr
+友谊桥 4 nr
+友谊比赛 3 ns
+友谊股份 12 nz
+友谊赛 33 nr
+友谊路 3 ns
+友达 2 a
+友道 2 n
+友邦 48 n
+友邦保险 3 n
+友邻 28 n
+友队 3 n
+友阪理惠 3 ns
+友非 10 ns
+友风子雨 3 n
+双 8395 n
+双一顶 2 m
+双下 4 m
+双下巴 3 n
+双下肢 3 n
+双两位 2 m
+双两只 2 m
+双丰 3 nz
+双丰收 3 nr
+双乳 7 nz
+双乳头瓣 3 n
+双二 6 m
+双二倍体 3 nz
+双井子 3 nr
+双亡 3 n
+双亲 221 n
+双人 198 n
+双人床 20 nz
+双人房 3 n
+双人滑 12 n
+双人舞 17 n
+双人跳 3 nr
+双人近景 3 n
+双人间 14 n
+双代会 3 nz
+双份 40 n
+双休 3 nr
+双休日 71 t
+双优 9 b
+双位 4 n
+双位数 3 n
+双低型 3 b
+双体 14 n
+双体船 4 n
+双余度 2 m
+双作稻 3 n
+双侧平衡 3 nr
+双侧约束 3 i
+双保险 3 n
+双倍 80 m
+双偶 3 n
+双儿 537 n
+双儿伏 2 nr
+双儿嘻 3 nr
+双儿微微 4 nr
+双儿羞 2 nr
+双儿跃 3 nr
+双元 9 m
+双光束 3 nr
+双全 28 nr
+双关 44 n
+双关语 16 nz
+双内核 3 n
+双冠 4 n
+双冠王 19 nr
+双凤鸣 2 nr
+双凤麒麟 2 nr
+双凫一雁 3 nz
+双击 4 b
+双击鼠标 3 n
+双刀 217 n
+双刃 25 n
+双刃剑 70 nr
+双分 2 n
+双列 10 m
+双列杂交 3 n
+双创双 2 nr
+双制 3 n
+双制式 3 b
+双剑交 2 nr
+双剑便 2 nr
+双剑击 2 nr
+双剑剑 7 nr
+双剑合 4 nr
+双剑如 3 nr
+双剑微 2 nr
+双剑攻 2 nr
+双剑疾 2 nr
+双剑盖 2 nr
+双剑相 3 nr
+双剑竟 3 nr
+双剑舞 3 nr
+双剑连 3 nr
+双剑齐 25 nr
+双力 3 n
+双动 3 n
+双动道岔 3 n
+双包 17 n
+双十 96 m
+双十佳 3 nr
+双十协议 3 nz
+双十国庆 3 nz
+双十节 3 m
+双十革命 3 nz
+双千兆 3 nz
+双博士 3 nr
+双卡通 3 nr
+双厚坪 5 nr
+双叉岭 3 nr
+双双 384 m
+双双出 6 m
+双双对 11 m
+双双对对 3 m
+双双封 2 nr
+双双把 3 m
+双双折 3 nr
+双发 57 nz
+双口 4 n
+双只 2 m
+双台 4 n
+双台子 10 nr
+双台子区 3 n
+双叶 21 n
+双号 3 n
+双号座号 3 n
+双合 4 n
+双合盛 3 nz
+双名 26 m
+双后腰 3 n
+双向 372 n
+双向交流 3 n
+双向交通 3 nz
+双向性 3 n
+双向打印 3 n
+双向收费 3 n
+双向电泳 3 n
+双向选择 3 l
+双向通信 3 n
+双听技术 3 n
+双启动 3 nr
+双周 3 m
+双周刊 6 n
+双响 3 n
+双响炮 3 n
+双唇 45 n
+双唇症 3 n
+双唇音 3 n
+双啸齐 2 nr
+双喜 725 nr
+双喜临门 23 nr
+双四 4 m
+双回 7 m
+双回路 3 n
+双园 2 n
+双园区 3 ns
+双圈 11 m
+双块 2 n
+双垂尾 11 nr
+双城 13 n
+双城县 3 ns
+双城市 6 ns
+双城记 12 n
+双城镇 3 nr
+双基色 3 n
+双堆 5 m
+双塔 42 n
+双塔区 3 ns
+双塔堡 2 nr
+双塔奇谋 3 nr
+双塔寺 3 nr
+双增双节 3 nr
+双增长 3 nr
+双壁 2 n
+双声 18 m
+双声带 3 n
+双声道 3 n
+双处理器 10 n
+双多向 5 n
+双夜 2 m
+双头 42 n
+双头肌 3 n
+双头蛇 3 n
+双套 3 m
+双女户 2 n
+双姓 6 n
+双姜胃 2 nr
+双子 87 n
+双子叶 11 nr
+双子塔 3 nr
+双子宫 3 nr
+双子座 22 nr
+双子星 3 nr
+双子楼 3 nr
+双孔 8 n
+双字 3 n
+双孢菇 3 n
+双季 6 m
+双季稻 42 n
+双学 3 n
+双学位 33 n
+双学双比 7 j
+双学士 3 n
+双安 7 nz
+双宾语 5 nz
+双宿双栖 3 nr
+双宿双飞 9 nr
+双小小 2 b
+双尖山 2 nr
+双尖牙 2 nr
+双尾 16 n
+双层 241 n
+双层公车 3 n
+双层床 6 n
+双层经营 3 b
+双层结构 3 n
+双层车 2 n
+双屏 3 n
+双屏双显 3 nr
+双屏幕 3 nr
+双屿 4 n
+双岭村 3 nr
+双峰 31 nr
+双峰分布 3 n
+双峰县 5 ns
+双峰驼 8 n
+双峰骆驼 3 n
+双崖集 3 nr
+双工 3 n
+双工器 2 n
+双工方式 2 n
+双差生 2 n
+双带 9 n
+双幅 3 n
+双年展 3 nt
+双床间 3 n
+双庙 2 n
+双座 84 m
+双开 5 m
+双开门 3 nr
+双引号 17 n
+双引擎 7 nr
+双弦 7 n
+双彩屏 3 nr
+双影 3 n
+双循环 4 nr
+双忠巷 4 nr
+双性人 3 n
+双性化 2 n
+双性恋 3 nr
+双截棍 3 n
+双截龙 3 nz
+双所 7 n
+双扁扁 3 nr
+双扇 7 n
+双扇门 3 nr
+双手 4990 n
+双手万能 3 nz
+双手柄 3 n
+双手赞成 3 nz
+双打 352 nz
+双打比赛 3 nr
+双打赛 3 nr
+双扩散 3 j
+双找工 3 l
+双折射 3 nr
+双抢 16 nr
+双护玉 2 nr
+双拐 21 nr
+双拥 863 nr
+双拥办 3 nr
+双拳 130 n
+双拼 3 nr
+双拼加加 3 nr
+双挂号 3 nz
+双掌击 7 nr
+双掌刚 2 nr
+双掌力 5 nr
+双掌如 3 nr
+双掌平 3 nr
+双掌开 4 nr
+双掌柔 2 nr
+双掌猛 2 nr
+双掌疾 5 nr
+双掌相 3 nr
+双掌空 2 nr
+双掌虚 3 nr
+双掌轻 2 nr
+双掌连 7 nr
+双掌齐 52 nr
+双排 9 m
+双支 4 m
+双敏电子 3 n
+双数 77 n
+双文 6 nz
+双文对校 3 n
+双文明 2 nr
+双斗 8 n
+双料 51 n
+双料冠军 3 n
+双方 7289 n
+双方同意 3 n
+双日 15 m
+双星 223 nz
+双星集团 5 nt
+双晶 26 n
+双曲 47 n
+双曲拱桥 175 nr
+双曲线 67 n
+双曲螺线 3 n
+双曲面 11 n
+双月刊 21 n
+双机 2 n
+双杂交 3 n
+双杆 3 n
+双杖齐 2 nr
+双杠 39 n
+双杠体操 3 nr
+双条 5 m
+双杯 9 m
+双板 4 n
+双林 6 nz
+双林寺 5 nr
+双林路 3 nz
+双林镇 5 nr
+双枝 12 n
+双枪 58 n
+双柏 3 nr
+双柏县 3 ns
+双柑斗酒 3 nr
+双柳子 4 nr
+双柳河 3 nr
+双栅极 3 n
+双栈机 3 i
+双树 6 n
+双树意 4 nr
+双栖 5 b
+双栖双 2 nr
+双栖双宿 3 nr
+双核 131 n
+双核心 3 n
+双核芯 5 nr
+双根 3 nz
+双格 3 n
+双桂联芳 3 nr
+双桅 3 n
+双桅帆船 3 nr
+双桅船 3 nr
+双档 3 b
+双桥 270 n
+双桥区 3 ns
+双桥沟 3 ns
+双桥镇 2 nr
+双桨 32 n
+双梁 7 n
+双棒儿 3 nr
+双棒齐 3 nr
+双榆树 3 nr
+双槐树 2 nr
+双模 4 b
+双模卡 6 nr
+双模式 3 n
+双橡园 3 n
+双气囊 3 n
+双氟 3 nr
+双氧 3 b
+双氧水 29 n
+双水村 213 nr
+双水模型 3 n
+双水翼 2 nr
+双汇 68 n
+双汇发展 83 nz
+双汇集团 16 nt
+双江 16 ns
+双江口 6 ns
+双沟 7 n
+双河 2 ns
+双泉 2 nz
+双泉堡 2 nr
+双泪 3 n
+双泾 3 ns
+双泾村 11 n
+双流 30 n
+双流县 8 ns
+双涡轮 3 n
+双清 5 nr
+双清区 3 nr
+双港镇 3 ns
+双湖 261 ns
+双溪 7 nr
+双溪公园 3 nr
+双溪口 2 nr
+双溪寺 2 nr
+双满意 3 nr
+双滦区 2 nr
+双灯 3 n
+双灵敏 2 nr
+双点 5 n
+双点点 2 m
+双烯 13 n
+双烯烃 7 n
+双熊 2 n
+双燃料 3 n
+双爪 7 n
+双爱双 2 nr
+双片 3 n
+双牌 3 n
+双牌县 2 n
+双特班 3 nr
+双特生 3 nr
+双环 24 n
+双环科技 6 nz
+双玻璃窗 3 nz
+双球菌 10 n
+双生 79 n
+双生儿 3 nr
+双生女 3 n
+双生子 3 n
+双生牙 3 nr
+双甲 2 b
+双电源 3 n
+双百 23 m
+双百方针 8 n
+双皮奶 3 n
+双盘 8 n
+双盘浮船 3 n
+双目 878 n
+双目失明 3 i
+双目成像 3 n
+双盲 3 n
+双盲实验 3 n
+双相 3 n
+双眉微 14 nr
+双眉扬 3 nr
+双眉深 6 nr
+双眉直 3 nr
+双眉紧 2 nr
+双眉越 2 nr
+双眸 31 n
+双眼 2026 m
+双眼皮 44 n
+双眼线索 3 n
+双眼视差 3 n
+双睛红 2 nr
+双瞳 3 v
+双瞳剪水 3 vn
+双矛齐 2 nr
+双石铺 5 n
+双硕士 3 nr
+双硬盘 3 n
+双碟 3 n
+双秀眉 5 nr
+双程 3 n
+双稳态 3 n
+双穴齐 2 nr
+双立人 3 nr
+双站 3 n
+双童 6 n
+双童剑 2 nr
+双端 2 n
+双笔 50 m
+双等 15 b
+双筒 3 n
+双筒井 3 n
+双管 3 n
+双管齐下 47 l
+双箭齐 3 nr
+双簧 28 n
+双簧管 28 n
+双簧箫 3 n
+双类 3 n
+双糖 12 n
+双系统 3 n
+双索面 2 n
+双线 101 n
+双线性 3 b
+双组分 3 n
+双绞线 10 n
+双缝衍射 3 nz
+双缸 6 n
+双网卡 3 n
+双翅 3 n
+双翅目 39 n
+双翅飞 2 nr
+双翅齐 2 nr
+双翼 57 n
+双翼飞机 3 i
+双耳 3 nr
+双耳时差 3 n
+双耳瓶 3 n
+双职工 17 n
+双联 109 nz
+双股 21 m
+双股螺旋 3 n
+双肩 94 n
+双肩包 3 nr
+双肩挑 3 n
+双胎 18 n
+双胞 3 n
+双胞胎 65 n
+双胶纸 3 nz
+双脚 467 n
+双脸 3 m
+双腿 550 n
+双腿奇 2 nr
+双腿微 4 nr
+双臂 673 n
+双臂卡环 3 nz
+双至强 3 nr
+双色 2 n
+双色球 12 n
+双节 7 n
+双节棍 3 n
+双菱藻 3 nr
+双蒸水 3 n
+双虹楼 8 nr
+双蛇 3 n
+双蝶 2 n
+双螺旋 34 n
+双螺杆 3 n
+双行 24 n
+双行线 2 n
+双衰变 3 n
+双袖 14 n
+双见杨 3 nr
+双规 10 n
+双角 35 n
+双解 3 n
+双语 30 nz
+双语学校 3 n
+双语报 2 n
+双语版 3 n
+双调和 3 nr
+双象 3 n
+双赛 18 n
+双赢 105 nr
+双足刚 3 nr
+双足力 3 n
+双足挺 2 nr
+双足重茧 3 n
+双足钉 3 n
+双足齐 2 nr
+双路 4 n
+双蹦灯 3 n
+双身 2 n
+双身子 3 n
+双车 3 n
+双轨 24 b
+双轨制 32 n
+双轨铁路 3 n
+双轮 121 m
+双轴 35 n
+双轴晶体 3 n
+双边 701 n
+双边会谈 3 nz
+双边关系 3 n
+双边协定 3 nz
+双边协议 3 nz
+双边合作 3 n
+双边条约 3 ns
+双边贸易 3 l
+双辽 5 nr
+双辽县 3 nr
+双辽市 3 ns
+双连通度 3 n
+双选会 23 n
+双选周 2 nr
+双通道 3 n
+双道 137 n
+双遣 3 b
+双遮 3 l
+双重 662 n
+双重人格 6 n
+双重函数 3 n
+双重分离 3 n
+双重国籍 3 n
+双重性 8 n
+双重性格 3 n
+双重标准 3 n
+双重牙列 3 n
+双重身份 3 nz
+双重身分 3 l
+双重领导 3 n
+双金属 3 n
+双金属片 3 nz
+双金钏 2 nr
+双钢轮 3 nz
+双钩 73 nz
+双铁戟 3 nr
+双铁牌 2 nz
+双铁罗汉 2 nz
+双铧犁 3 nr
+双链 31 n
+双锋 2 n
+双锥 21 nz
+双锥天线 3 n
+双键 74 n
+双镖飞 2 vn
+双门 12 n
+双间 2 n
+双阳 6 ns
+双阳区 3 ns
+双阳县 3 ns
+双阳台 3 n
+双阳极 3 ns
+双陆 3 n
+双陪集 3 nr
+双雄会 3 nr
+双面 78 n
+双面书架 3 n
+双面娇娃 3 nr
+双面板 3 n
+双面研磨 3 n
+双面绒 3 n
+双面绣 7 n
+双面胶 2 n
+双面谍 3 n
+双靥 3 n
+双音 13 n
+双音词 5 n
+双音频 3 n
+双顶 6 n
+双颊 3 n
+双颌前突 3 n
+双频 6 b
+双风贯 4 nr
+双飞 3 nr
+双飞双 4 nr
+双飞燕 11 nr
+双飞翼 2 nr
+双饷 3 n
+双首 2 m
+双马 14 n
+双高 16 n
+双高型 3 b
+双高清 6 nr
+双鬓 3 n
+双鱼 17 n
+双鱼座 12 nz
+双鱼牌 3 n
+双鸣凤 6 nr
+双鸭山 17 ns
+双鸭山市 7 ns
+双鸽 4 n
+双鹰均 2 nr
+双黄 8 b
+双黄线 3 n
+双黄连 3 nr
+双龙 32 nz
+双龙传 3 nr
+双龙岗 2 nr
+双龙抢 2 nr
+双龙护 3 nr
+双龙泉 5 nr
+双龙洞 3 nr
+双龙纹 2 nr
+反 13500 zg
+反丁烯二酸 19 nz
+反世贸 3 n
+反中子 3 l
+反串 16 v
+反为 3 v
+反主为客 3 n
+反义 18 n
+反义基因 3 n
+反义字 3 n
+反义词 19 n
+反之 728 c
+反之亦是 3 l
+反之亦然 34 i
+反于 3 v
+反交 3 v
+反交换 3 v
+反代型 3 vn
+反传网络 3 n
+反作弊 3 i
+反作用 32 n
+反作用力 47 n
+反例 4 n
+反侧 11 f
+反侵略 3 n
+反侵略战 3 n
+反修 3 v
+反倒 859 v
+反倾销 289 v
+反倾销法 9 n
+反倾销税 13 n
+反光 59 v
+反光性 3 n
+反光板 3 n
+反光灯 3 n
+反光膜 3 n
+反光镜 11 nz
+反党 186 n
+反党集团 3 nt
+反共 671 d
+反共宣传 3 nz
+反共抗俄 3 nt
+反其道 3 i
+反其道而行之 39 i
+反写 3 v
+反军购 3 v
+反冲 33 v
+反冲力 3 n
+反击 1323 v
+反击式 3 n
+反击战 62 n
+反函数 17 l
+反分裂 3 i
+反分裂法 3 n
+反切 51 a
+反刍 49 v
+反刍动物 14 n
+反到 3 v
+反制 71 v
+反剪 158 v
+反力 3 d
+反动 2232 vn
+反动份子 3 n
+反动分子 3 n
+反动势力 3 i
+反动派 697 n
+反动透顶 3 n
+反动集团 3 n
+反劫 3 v
+反劫机 3 n
+反劳为逸 3 i
+反千组 3 n
+反华 78 nz
+反反 3 v
+反反复复 87 l
+反叛 292 v
+反叛党 3 n
+反叛军 3 n
+反叛者 18 n
+反叠构象 3 n
+反口 3 vn
+反台独 3 j
+反右 74 v
+反右派斗 3 i
+反向 144 v
+反向地 3 n
+反向恢复 3 l
+反向混合 3 i
+反向移情 3 i
+反向而行 3 i
+反向转运 3 n
+反向运动 3 l
+反听内视 3 n
+反听收视 3 i
+反吹 3 v
+反告 3 v
+反咬 10 v
+反咬一口 20 i
+反响 509 vn
+反响强烈 3 n
+反哺 18 v
+反哺为恩 3 ns
+反哺之恩 3 v
+反哺之情 3 v
+反哺之私 3 v
+反唇相稽 17 i
+反唇相讥 58 i
+反唱 3 v
+反噬 19 v
+反回头 3 l
+反坐 3 v
+反坦克 3 nz
+反坦克炮 86 n
+反坦克雷 18 n
+反垃圾 3 n
+反垄断 3 n
+反垄断法 26 n
+反基因组 3 n
+反复 2882 v
+反复强调 3 l
+反复性 4 n
+反复推敲 17 l
+反复无常 36 i
+反复研究 3 n
+反复计算 2 i
+反复证明 3 l
+反季节 19 n
+反守为攻 3 i
+反安装 3 n
+反定理 3 n
+反客为主 37 i
+反宾为主 3 i
+反对 9366 d
+反对党 223 n
+反对声 7 n
+反对方 2 n
+反对派 285 n
+反对票 198 n
+反对称性 3 n
+反对者 100 n
+反导 210 vn
+反导向飞 3 n
+反导弹 3 n
+反封建 3 n
+反射 1100 v
+反射亢进 3 i
+反射体 6 n
+反射光 3 n
+反射光栅 3 n
+反射动作 3 n
+反射器 3 n
+反射壁 3 n
+反射学 3 n
+反射定律 20 n
+反射层 15 n
+反射式 10 n
+反射弧 28 n
+反射强度 3 n
+反射性 2 n
+反射板 3 n
+反射炉 19 n
+反射率 21 n
+反射系数 9 n
+反射线 5 n
+反射角 3 n
+反射镜 80 n
+反射面 13 n
+反将 3 d
+反差 162 v
+反差调整 3 l
+反帝 1015 n
+反常 325 d
+反常吸收 3 l
+反常对策 3 n
+反常情况 3 n
+反常散射 3 v
+反常混晶 3 nz
+反常现象 3 n
+反常规 5 vn
+反干扰 3 l
+反序 3 n
+反应 7652 vn
+反应力 4 n
+反应变量 3 l
+反应器 60 n
+反应堆 196 n
+反应堆心 3 v
+反应塔 3 n
+反应式 18 n
+反应截面 3 i
+反应方程 3 l
+反应时间 6 n
+反应溅射 3 vn
+反应炉 2 n
+反应热 3 i
+反应物 173 n
+反应类型 3 n
+反应罐 3 n
+反应蒸发 3 i
+反应进度 3 n
+反应迟钝 3 i
+反应速度 4 n
+反应速度快 2 i
+反应釜 3 n
+反应锅 3 n
+反式 44 n
+反式切割 3 l
+反式剪接 3 nz
+反式加成 3 v
+反式构象 3 n
+反式消除 3 i
+反式灭活 3 v
+反式阻抑 3 nz
+反弹 410 v
+反弹力 3 n
+反弹球 3 n
+反得 3 v
+反循环 3 i
+反德 3 n
+反思 596 v
+反思性 2 n
+反恐 352 v
+反恐怖 3 i
+反恐精英 3 i
+反悔 153 v
+反情报 3 n
+反意 3 v
+反感 511 v
+反戈 13 v
+反戈一击 31 i
+反戈相向 3 i
+反成 3 v
+反战 75 v
+反战份子 3 n
+反手 533 v
+反手可得 3 i
+反扑 123 v
+反扒 3 n
+反托拉斯 3 nz
+反托拉斯法 18 nz
+反投影 3 i
+反抗 2233 v
+反抗军 3 n
+反抗性 6 n
+反抗者 3 n
+反折 13 v
+反折射 3 v
+反担保 3 n
+反拍 3 v
+反持 3 v
+反排 3 v
+反接 3 v
+反控制 6 n
+反推 3 vn
+反推力 3 n
+反提 3 v
+反撞力 3 n
+反收购 12 n
+反攻 618 vn
+反攻为守 3 i
+反攻倒算 23 i
+反攻复国 3 i
+反攻大陆 3 n
+反文儿 3 n
+反文旁 3 n
+反斗 3 vn
+反方 23 n
+反旋 3 v
+反无 3 v
+反日 62 d
+反映 6618 v
+反映论 15 n
+反是 41 c
+反木马 3 nz
+反本 3 d
+反朴归真 3 i
+反杜林论 3 nz
+反来 3 v
+反查 3 vn
+反正 2166 d
+反正拨乱 3 i
+反殖 3 vn
+反毒 3 v
+反毒害 3 l
+反比 174 v
+反比例 7 n
+反民主 3 n
+反气旋 3 vn
+反水 13 v
+反水不收 3 l
+反求诸己 2 i
+反汇编 2 n
+反治其身 3 i
+反法 3 v
+反法西斯 3 nz
+反法西斯战争 51 nz
+反洗 3 v
+反洗钱 3 v
+反洗钱法 3 n
+反派 9 v
+反派人物 3 l
+反浪费 3 n
+反清 3 v
+反清复明 3 l
+反渗透 9 nz
+反渗透膜 3 n
+反演 33 vn
+反演中心 3 l
+反潜 675 vn
+反潜巡逻机 38 nz
+反潜机 68 n
+反潜舰 21 n
+反潜艇 3 n
+反潮流 14 n
+反火力 3 n
+反烟 3 v
+反烟运动 3 l
+反照 21 v
+反照率 3 n
+反照镜 3 n
+反物质 9 n
+反犬旁 3 n
+反犬旁儿 3 i
+反犯罪 3 i
+反犹 7 v
+反犹主义 4 l
+反犹太 3 n
+反璞归真 3 i
+反生 3 v
+反电动势 3 n
+反町隆史 3 nz
+反病毒 79 n
+反白 3 v
+反白字 3 n
+反盗版 3 n
+反目 22 n
+反目为仇 2 i
+反目成仇 22 i
+反目无情 3 i
+反相 3 d
+反相器 3 l
+反省 288 n
+反省起来 3 v
+反看 3 v
+反眼不识 3 l
+反码 3 d
+反离子 3 n
+反科学 11 l
+反空降 35 v
+反穿 3 v
+反窃听 3 i
+反粒子 3 n
+反经 3 d
+反经合义 3 n
+反经合道 3 n
+反经行权 3 n
+反绑 26 v
+反给 3 v
+反编码链 3 n
+反编译 3 n
+反编译器 3 n
+反老还童 3 l
+反而 3547 c
+反聘 3 v
+反胃 25 v
+反能 3 v
+反脸无情 3 i
+反腐 33 v
+反腐倡廉 57 l
+反腐败 3 v
+反自同构 3 l
+反舰导弹 3 nz
+反英 3 nz
+反补贴 3 v
+反衬 29 v
+反衬度 3 vn
+反装甲 3 l
+反裘伤皮 3 i
+反裘负薪 3 i
+反褶积 3 n
+反要 3 v
+反覆 3 v
+反覆思量 3 i
+反覆无常 4 i
+反观 68 n
+反角 3 n
+反论 3 c
+反讽 8 v
+反证 9 v
+反证法 6 n
+反诉 30 v
+反诘 11 v
+反话 7 v
+反诬 3 v
+反语 8 nz
+反读 3 v
+反调 12 v
+反责 3 v
+反败为胜 61 i
+反质子 30 n
+反贪 22 vn
+反贪动态 3 i
+反贪局 58 j
+反贪工作 3 j
+反贪污 3 i
+反贪科 3 j
+反贼 243 n
+反走私 3 i
+反超 94 v
+反踢 3 i
+反身 88 v
+反身代词 3 i
+反身自问 3 i
+反躬自省 6 i
+反躬自责 3 i
+反躬自问 4 i
+反转 84 v
+反转剧 3 d
+反转来 3 d
+反转温度 3 n
+反转片 5 n
+反辱相稽 3 i
+反过 3 v
+反过来 405 d
+反过来说 69 l
+反退 3 v
+反遭 3 v
+反遭毒手 3 v
+反避税 3 l
+反邪归正 3 i
+反邪教 3 i
+反酸 3 n
+反醒 3 v
+反钓鱼 3 l
+反铐 3 n
+反锁 38 vn
+反错构象 3 n
+反键 3 n
+反锯齿 3 n
+反问 187 v
+反问句 4 i
+反间 31 n
+反间之计 3 l
+反间计 53 l
+反间谍 3 n
+反霸 15 v
+反面 264 d
+反面人物 18 l
+反面典型 3 n
+反面反应 3 l
+反面教员 4 n
+反面教材 12 n
+反面文章 3 i
+反面无情 3 i
+反面材料 3 n
+反面角色 3 n
+反面设计 3 i
+反革命 1261 nz
+反顾 3 v
+反题 3 n
+反颜相向 3 i
+反颠覆 3 i
+反风灭火 3 i
+反馈 514 v
+反馈作用 3 n
+反馈性 3 n
+反馈系统 3 n
+反馈表 2 n
+反驳 409 v
+反驳者 3 n
+反骄破满 3 i
+反魂乏术 3 n
+収 83 zg
+叏 130 zg
+发 16840 v
+发一分光 3 l
+发一组 3 n
+发上 3 v
+发上冲冠 3 i
+发上去 3 v
+发上指冠 3 l
+发上来 3 l
+发下 3 v
+发下去 3 l
+发不 3 l
+发不出 3 v
+发不到 3 l
+发不起 3 v
+发丝 52 v
+发两张 3 l
+发丧 3 vn
+发个贴 3 n
+发为 3 v
+发乎 9 v
+发乎情 3 l
+发书 3 v
+发乳 5 v
+发乾 3 ns
+发予 3 v
+发于 3 v
+发交 3 v
+发亮 250 v
+发人 3 n
+发人深思 21 l
+发人深省 38 l
+发付 3 vn
+发令 80 v
+发令员 3 n
+发令枪 14 l
+发件 3 n
+发件人 2 l
+发件箱 3 n
+发价 3 vn
+发传单 3 n
+发传真 3 l
+发低工资 3 l
+发低烧 3 l
+发作 1274 vn
+发信 571 vn
+发信人 539 n
+发信号 3 n
+发信机 3 l
+发信站 3 n
+发债 8 vn
+发傻 6 v
+发像管 3 n
+发光 957 v
+发光体 16 n
+发光字 3 l
+发光度 2 l
+发光强度 3 l
+发光棒 3 n
+发光片 3 n
+发光物 3 l
+发光管 4 n
+发光粉 3 n
+发光闪烁 3 i
+发兵 242 v
+发冷 41 vn
+发凉 3 v
+发几张 3 l
+发凡 3 v
+发凡起例 3 l
+发出 5628 v
+发出信号 2 n
+发出回声 3 l
+发出声响 5 l
+发出声音 4 l
+发出报警 2 n
+发出臭味 3 l
+发出请求 2 n
+发出通知 7 l
+发函 5 v
+发刊 4 v
+发刊词 27 l
+发到 97 v
+发制品 3 n
+发刷 3 vn
+发力点 5 n
+发务成业 3 l
+发动 5248 vn
+发动战争 3 nz
+发动机 2584 n
+发动机厂 6 n
+发动机盖 3 l
+发动机短 3 l
+发动机舱 3 n
+发动群众 3 l
+发动者 13 n
+发动蛋白 3 l
+发动革命 3 l
+发包 21 v
+发包人 3 n
+发包方 3 n
+发单 2 a
+发卖 3 v
+发卡 85 n
+发卡人 3 n
+发卡行 3 n
+发卡量 8 n
+发卷 3 v
+发去 3 v
+发叶 3 n
+发号施令 223 n
+发向 3 v
+发呆 97 v
+发呆地 3 n
+发呕 3 v
+发咒 3 v
+发响 3 vn
+发哑 3 a
+发哥 3 n
+发售 79 vn
+发售日 3 n
+发售日期 3 n
+发售点 4 n
+发售量 3 n
+发善心 28 l
+发喘 4 v
+发嗲 3 l
+发器 2 n
+发回 61 v
+发回去 3 l
+发回重审 3 n
+发困 3 v
+发国难财 3 l
+发图片 3 l
+发在 3 v
+发场光大 3 l
+发坏 3 v
+发型 161 vn
+发型屋 3 n
+发型师 6 n
+发型秀 3 v
+发型设计 3 n
+发堵 3 v
+发声 191 v
+发声器 15 l
+发声器官 3 l
+发声明 3 l
+发声法 3 l
+发大水 3 l
+发大财 28 l
+发夹 7 n
+发夹环 3 l
+发夹结构 3 l
+发奋 39 v
+发奋图强 16 l
+发奖 26 vn
+发奖仪式 3 n
+发套 3 a
+发奸擿伏 3 n
+发好 3 v
+发妻 15 n
+发姐 3 n
+发威 3 v
+发威动怒 3 i
+发完 3 v
+发审 13 vn
+发审委 223 j
+发宪布令 3 n
+发家 35 n
+发家史 2 n
+发家致富 23 l
+发射 4636 v
+发射乐团 3 n
+发射光谱 40 l
+发射功率 3 n
+发射区 3 n
+发射卫星 3 n
+发射台 39 n
+发射器 319 n
+发射场 79 n
+发射塔 12 n
+发射成功 3 l
+发射机 77 n
+发射极 8 n
+发射架 199 n
+发射点 18 n
+发射物 3 n
+发射率 28 n
+发射站 5 n
+发射筒 2 n
+发射管 186 n
+发射系统 4 l
+发射结 3 n
+发射能力 6 n
+发射臂 3 n
+发射营 2 n
+发射装置 6 n
+发屋 2 n
+发屋求狸 3 n
+发展 68664 vn
+发展中国家 1135 l
+发展党员 3 l
+发展前景 13 l
+发展前途 94 n
+发展势头 3 l
+发展史 511 l
+发展商 42 n
+发展壮大 3 l
+发展局 66 l
+发展性 18 l
+发展期 41 n
+发展权 17 l
+发展潜力 10 n
+发展社会化 2 l
+发展社会学 4 l
+发展经济学 10 l
+发展缓慢 3 n
+发展署 6 l
+发展观 579 l
+发展费 5 n
+发展趋势 40 l
+发展趋向 3 l
+发展辉煌 3 ns
+发展部 35 n
+发工资 3 l
+发市 3 v
+发布 7785 v
+发布会 4417 n
+发布公告 3 n
+发布厅 213 n
+发布命令 3 n
+发布新闻 3 n
+发布权 259 n
+发布者 9 n
+发布费 2 n
+发布量 3 n
+发布页 3 n
+发布页面 3 n
+发帖 124 n
+发帖人 3 n
+发帖子 3 n
+发帖数 3 n
+发帖榜 3 n
+发帖量 3 n
+发带 3 v
+发廊 12 n
+发廊女 3 nz
+发廊妹 3 nr
+发式 34 n
+发引 3 v
+发引千钧 3 i
+发彩信 3 l
+发往 3 v
+发得 3 v
+发怒 284 v
+发怒冲冠 3 i
+发怒穿冠 3 l
+发怔 3 v
+发急 44 vn
+发性 7 n
+发怨言 3 l
+发怵 51 v
+发恼 3 a
+发悸 3 v
+发情 130 n
+发情周期 3 n
+发情探测 3 l
+发情期 15 n
+发愁 296 v
+发愣 61 v
+发愤 41 a
+发愤图强 15 i
+发愤忘食 2 i
+发愿 40 v
+发慈悲 13 l
+发慌 23 a
+发憷 9 v
+发懒 5 v
+发成 3 v
+发手机 3 l
+发扬 844 v
+发扬光大 104 i
+发扬成绩 3 l
+发扬民主 3 i
+发扬踔厉 2 nr
+发扬蹈厉 3 i
+发抒 3 i
+发抒心志 3 i
+发抖 658 v
+发护发 3 n
+发报 76 vn
+发报人 3 n
+发报员 3 n
+发报器 3 n
+发报机 18 n
+发指 3 n
+发指眦裂 3 i
+发挥 5889 v
+发挥优势 3 n
+发挥余热 3 l
+发挥作用 3 n
+发挥出来 3 l
+发挥性 3 n
+发挥所长 3 n
+发挥特长 3 n
+发挥计算机 2 n
+发掉 3 v
+发排 3 vn
+发掘 1579 v
+发掘出 3 n
+发掘出来 3 i
+发收 3 v
+发改委 3 j
+发放 1397 v
+发放贷款 3 n
+发放量 2 n
+发政施仁 3 n
+发散 131 v
+发散透镜 3 n
+发文 66 n
+发文件 3 l
+发文者 3 n
+发料 3 n
+发新帖 3 n
+发旧 3 v
+发明 2757 v
+发明专利 3 l
+发明人 58 n
+发明创造 7 l
+发明奖 17 nz
+发明家 101 l
+发明权 18 n
+发明者 81 n
+发昏 37 v
+发春 3 vn
+发晕 39 v
+发暗 3 a
+发有 3 v
+发木 3 n
+发条 60 n
+发条橙 3 n
+发来 199 v
+发来发去 3 l
+发标 3 v
+发标人 3 n
+发根 26 v
+发案 11 v
+发案单位 3 n
+发案地 3 n
+发案率 3 n
+发梢 31 n
+发棠之请 3 n
+发植穿冠 3 l
+发楞 9 v
+发榜 13 v
+发横 4 v
+发横财 12 l
+发款 3 v
+发比 2 v
+发毛 136 n
+发气 3 n
+发水 3 v
+发汗 48 v
+发汗剂 3 n
+发汗药 2 l
+发油 3 n
+发泄 441 v
+发泡 25 v
+发泡剂 20 n
+发泡机 3 n
+发泡胶 3 n
+发洋财 4 l
+发派 3 v
+发浊音 3 n
+发消息 5 n
+发源 440 n
+发源地 562 n
+发潮 4 n
+发火 138 v
+发火器 3 l
+发火点 3 n
+发炎 126 n
+发炎性 3 n
+发炮 3 n
+发点 3 n
+发烟 58 v
+发烟硝酸 4 n
+发烟硫酸 5 nz
+发烧 249 v
+发烧友 37 n
+发烧时 3 n
+发烧极 3 n
+发烧站 3 n
+发烧级 3 n
+发烧音响 3 l
+发热 388 v
+发热器 3 n
+发热时 3 l
+发热板 3 n
+发热管 3 n
+发热量 57 n
+发片 3 n
+发牌 22 v
+发牢骚 96 v
+发物 3 n
+发状 3 n
+发狂 65 a
+发狂地 3 l
+发狠 75 v
+发獃 3 vn
+发现 24826 v
+发现异常 3 l
+发现矛盾 3 l
+发现者 61 n
+发现自己 38 l
+发现错误 5 l
+发球 198 n
+发球区 10 n
+发球员 14 n
+发球局 3 n
+发球权 13 n
+发球线 8 n
+发生 24052 v
+发生争执 3 n
+发生冲突 3 n
+发生变化 19 l
+发生响声 3 n
+发生器 123 l
+发生地 293 l
+发生学 17 l
+发生巨变 3 i
+发生意外 3 l
+发生源 3 l
+发生炉煤 3 n
+发生爆炸 3 n
+发生率 126 n
+发生量 10 n
+发生额 6 n
+发电 858 vn
+发电厂 118 n
+发电场 5 n
+发电所 3 v
+发电报 3 n
+发电机 345 n
+发电机组 76 n
+发电电压 2 v
+发电站 80 n
+发电能力 3 l
+发电设备 2 n
+发电量 105 n
+发留言 3 l
+发疯 262 v
+发疹 3 n
+发疹子 3 n
+发病 947 v
+发病指数 3 n
+发病率 353 n
+发痒 97 v
+发痛 3 v
+发痧 2 vn
+发痴 26 v
+发癣 3 n
+发白 160 v
+发白时 3 l
+发皇 3 n
+发直 3 v
+发着 3 v
+发矢 3 n
+发短 14 v
+发短信 3 j
+发短心长 3 l
+发硎新试 3 nr
+发硬 3 a
+发硬时 3 l
+发神经 12 l
+发神经病 3 l
+发祥 7 n
+发祥之地 5 l
+发祥地 400 n
+发票 271 n
+发票记录 2 n
+发福 21 vn
+发科打诨 3 i
+发稿 113 v
+发窘 40 v
+发端 88 n
+发端词 3 l
+发笑 65 vn
+发笔 3 v
+发策决科 3 n
+发簪 15 n
+发粉 3 n
+发糕 4 a
+发紧 3 v
+发紫 3 a
+发红 135 v
+发红包 3 l
+发纵指使 3 n
+发纵指示 3 l
+发结 3 v
+发给 483 vn
+发给你 3 l
+发给您 3 l
+发综指示 3 n
+发绿 7 v
+发网 3 v
+发罗拉 5 nz
+发聋振聩 3 i
+发肤 3 n
+发育 4047 vn
+发育不全 3 l
+发育不良 3 l
+发育成 3 l
+发育期 27 n
+发育条件 3 l
+发育沟 3 n
+发育畸形 3 i
+发育节律 3 l
+发育调节 3 l
+发育阶段 3 n
+发肿 3 v
+发胀 46 v
+发胀感 3 n
+发胖 68 a
+发胶 6 n
+发脾气 319 v
+发自 296 v
+发自体内 3 l
+发自内心 3 l
+发自肺腑 3 i
+发臭 35 v
+发至 3 v
+发船 3 vn
+发花 22 n
+发芽 184 v
+发芽势 3 n
+发芽率 13 n
+发芽生殖 3 l
+发芽试验 3 n
+发菜 36 n
+发落 180 v
+发蒙 3 vn
+发蒙振落 3 l
+发蒙解惑 3 l
+发蒙解缚 3 v
+发蓝 3 n
+发蔫 3 v
+发薪 19 v
+发薪日 3 n
+发薪水 3 n
+发虚 29 v
+发蜡 11 v
+发蜡条 3 n
+发行 3498 v
+发行业 3 n
+发行中心 6 l
+发行人 87 n
+发行价 5 n
+发行体 3 n
+发行史 2 n
+发行员 5 n
+发行商 17 n
+发行所 7 n
+发行期 2 n
+发行权 15 n
+发行版 3 v
+发行科 2 n
+发行网 2 n
+发行者 9 n
+发行股票 3 n
+发行部 21 n
+发行量 203 n
+发行额 11 n
+发表 8028 v
+发表声明 3 l
+发表意见 3 l
+发表文章 3 n
+发表权 9 n
+发表演说 3 l
+发表议论 3 n
+发表谈话 3 l
+发见 3 v
+发觉 908 v
+发觉出 3 l
+发觉到 3 l
+发言 1521 v
+发言人 10241 l
+发言权 171 l
+发言条 3 l
+发言盈庭 3 l
+发言稿 20 n
+发言者 26 n
+发誓 315 v
+发议论 3 n
+发证 33 v
+发话 121 v
+发话器 3 l
+发语词 2 n
+发财 355 v
+发财树 3 l
+发财梦 10 l
+发财致富 83 l
+发财路 3 l
+发货 52 n
+发货人 5 l
+发货单 3 n
+发货地 3 l
+发货票 16 l
+发货量 51 l
+发贴 3 v
+发贴人 3 n
+发贴子 3 n
+发贴数 3 l
+发起 2134 v
+发起人 346 l
+发起国 6 l
+发起方 2 l
+发起烧来 3 l
+发起组 22 v
+发起者 19 n
+发踊冲冠 3 v
+发踪指使 3 nz
+发踪指示 3 l
+发车 61 v
+发车场 3 n
+发软 3 a
+发辫 36 n
+发达 5557 v
+发达县 13 l
+发达国家 1356 l
+发过 3 v
+发过来 3 l
+发运 37 vn
+发运人 3 l
+发还 60 v
+发进 3 v
+发进去 3 l
+发进来 3 l
+发迹 99 n
+发迹史 3 l
+发送 585 v
+发送信息 3 n
+发送到 3 l
+发送器 3 n
+发送打印 2 l
+发送数据 3 n
+发送机 3 n
+发送窗口 3 i
+发送站 3 n
+发送给 3 n
+发送缓冲区 3 n
+发送者 16 n
+发送至 3 l
+发送量 32 n
+发邮件 2 n
+发配 110 vn
+发酒疯 12 l
+发酵 358 v
+发酵出来 3 n
+发酵剂 3 n
+发酵图谱 3 n
+发酵法 18 n
+发酵液 4 n
+发酵粉 3 n
+发酵罐 4 n
+发酵酒 3 n
+发酵饲料 3 n
+发酸 86 n
+发野 3 vn
+发针 3 n
+发钞 12 vn
+发钱 3 v
+发错 8 v
+发长 3 v
+发问 72 v
+发问者 3 n
+发闷 3 v
+发际 25 n
+发隐擿伏 3 n
+发难 282 v
+发霉 82 a
+发霜 3 n
+发青 3 vn
+发面 17 n
+发面饼 4 n
+发音 327 n
+发音器 3 l
+发音器官 3 l
+发音学 3 l
+发音版 3 n
+发颤 3 v
+发飘 3 v
+发飙 3 n
+发饰 5 v
+发饷 38 n
+发香味 3 n
+发高烧 31 l
+发高热 3 l
+发髻 120 n
+发鬓 3 n
+发麻 179 n
+发黄 111 v
+发黑 134 v
+叓 211 zg
+叔 2571 n
+叔丁醇 4 n
+叔伯 131 n
+叔伯弟兄 3 n
+叔侄 109 n
+叔公 12 n
+叔叔 1103 n
+叔婆 3 n
+叔婶 3 n
+叔嫂 3 n
+叔子 3 n
+叔孙通 3 n
+叔岳 3 n
+叔平 5 n
+叔度陂湖 3 v
+叔惠 483 n
+叔本华 3 n
+叔母 8 n
+叔父 320 n
+叔祖 83 n
+叔祖母 3 n
+叔胺 3 n
+叔舅 3 n
+叕 68 zg
+取 10965 v
+取下 3 v
+取义 3 v
+取义成仁 3 i
+取之不尽 43 i
+取之不竭 3 i
+取之于 3 v
+取之于民 7 i
+取之有道 3 i
+取乐 105 v
+取乱侮亡 3 vn
+取乱存亡 3 i
+取予有节 3 i
+取代 2007 v
+取代拼音 3 i
+取代法 3 vn
+取保 61 v
+取保候审 3 n
+取信 34 v
+取信于 3 l
+取信于人 5 i
+取信于民 17 i
+取值 118 v
+取其精华 3 i
+取决 1071 v
+取决于 303 v
+取出 3048 v
+取分 9 v
+取到 3 v
+取去 3 v
+取反 3 v
+取名 608 v
+取名为 3 i
+取名字 3 i
+取向 293 v
+取向极化 3 i
+取回 112 v
+取回去 3 i
+取回来 3 l
+取土 14 v
+取士 189 n
+取大优先 3 v
+取如拾遗 3 i
+取字 6 v
+取宠 8 v
+取尽 3 v
+取巧 39 n
+取巧图便 3 i
+取平 3 v
+取开 3 v
+取得 11882 v
+取得实效 3 i
+取得成功 3 i
+取得成效 3 i
+取得联系 3 n
+取得胜利 3 i
+取心钻压 3 nz
+取快一时 3 i
+取息 8 v
+取悦 149 v
+取悦于 3 n
+取悦于人 3 i
+取悦于民 3 i
+取报 3 v
+取指令 4 n
+取掉 3 v
+取数时间 3 n
+取景 30 n
+取景器 4 n
+取景框 2 n
+取暖 284 v
+取暖器 5 nz
+取暖油 3 nz
+取暖法 3 i
+取暖炉 3 nz
+取暖费 2 n
+取材 336 v
+取材于 3 l
+取材自 3 nz
+取来 3 v
+取样 86 v
+取样器 3 l
+取样率 3 v
+取款 60 v
+取款单 3 n
+取款机 9 n
+取水 119 v
+取水口 9 n
+取水量 3 n
+取法 67 v
+取法乎上 3 l
+取法于 3 v
+取消 3052 v
+取消资格 3 n
+取火 3 v
+取现 64 v
+取用 55 v
+取码 3 v
+取穴 32 v
+取笑 276 v
+取精用宏 3 nz
+取经 392 v
+取给 4 v
+取缔 329 v
+取缔法 3 l
+取而代之 191 i
+取胜 1010 v
+取自 125 v
+取舍 211 v
+取舍不定 3 i
+取舍之间 3 i
+取舍难定 3 i
+取色 3 v
+取药 3 v
+取证 88 v
+取证难 3 v
+取词 3 v
+取诸宫中 3 i
+取货 3 v
+取费 3 v
+取走 3 v
+取辖投井 3 n
+取送 3 v
+取适量 3 n
+取道 121 v
+取钱 3 v
+取长弃短 3 i
+取长补短 64 i
+取闹 2 v
+取阅 6 v
+取青妃白 3 n
+取青媲白 3 z
+取青配白 3 i
+取静集 3 i
+取食 213 v
+取齐 30 v
+受 25796 v
+受不乐 3 l
+受不了 535 l
+受不得 3 v
+受业 97 n
+受之无愧 3 i
+受之有愧 11 i
+受了伤 3 l
+受事 3 v
+受人之托 3 v
+受人牵制 3 l
+受众 244 n
+受众面 3 l
+受传者 2 n
+受伤 2402 v
+受伤害 3 n
+受伤者 15 n
+受体 323 n
+受俘 3 v
+受保人 3 n
+受俸 3 n
+受冷 4 v
+受冻 23 v
+受凉 32 v
+受刑 246 v
+受刑人 3 n
+受刑者 3 n
+受到 11428 v
+受到冲击 3 i
+受到好评 3 l
+受到感染 3 l
+受到牵连 3 l
+受到破坏 3 l
+受到谴责 3 vn
+受到重视 3 l
+受到限制 3 l
+受制 63 v
+受制于 97 v
+受制于人 35 l
+受刺激 3 v
+受力 125 n
+受力钢筋 3 n
+受动 3 v
+受助 24 v
+受助生 2 v
+受助者 8 n
+受压 83 v
+受压迫 3 i
+受受 3 v
+受后付款 3 l
+受听 3 v
+受命 1602 v
+受困 39 v
+受困者 4 n
+受够 3 v
+受够了 3 l
+受奖 30 v
+受委屈 3 n
+受委托人 3 n
+受孕 125 v
+受孕率 3 n
+受完 3 v
+受宠 67 v
+受宠若惊 86 i
+受审 73 v
+受害 151 v
+受害人 45 n
+受害国 9 n
+受害者 271 n
+受寒 29 v
+受尽 137 v
+受尽压迫 3 i
+受尽折磨 3 i
+受屈 3 v
+受得了 72 l
+受得住 3 v
+受惊 110 v
+受惊吓 3 i
+受惠 74 v
+受惠无穷 3 l
+受惠者 7 n
+受惩 3 v
+受戒 30 v
+受托 58 v
+受托人 3 n
+受托承销 3 n
+受折磨 3 v
+受持 3 v
+受挤 3 v
+受挫 143 v
+受损 336 v
+受损害 3 l
+受损率 3 n
+受控 105 v
+受控对象 21 n
+受控系统 2 n
+受援 2 v
+受援国 10 n
+受敌 54 v
+受教 3 v
+受教育者 36 n
+受文者 3 n
+受旱 9 a
+受暑 3 v
+受有 3 v
+受术者 3 n
+受权 11 v
+受案 3 v
+受案率 3 n
+受检 6 v
+受检者 8 n
+受欢迎 3 v
+受款 3 v
+受气 35 v
+受气包 5 l
+受水区 2 n
+受治者 3 n
+受洗 33 v
+受测者 2 n
+受淹 3 n
+受潮 29 v
+受激发射 3 l
+受灾 174 v
+受灾人口 3 l
+受灾县 3 l
+受灾国 5 l
+受灾地区 3 l
+受灾户 2 l
+受灾面 3 l
+受灾面积 3 l
+受点 3 n
+受热 345 v
+受热捧 3 v
+受理 1212 v
+受理费 13 n
+受用 233 v
+受用不尽 3 l
+受用无穷 3 l
+受用终身 3 l
+受田 3 n
+受电架 3 n
+受病 2 v
+受益 447 v
+受益不浅 3 l
+受益人 27 n
+受益匪浅 49 l
+受益权 7 n
+受益者 75 n
+受益费 3 v
+受益非浅 3 l
+受看 3 v
+受礼 11 v
+受礼人 3 n
+受礼者 3 n
+受禄 2 n
+受穷 19 v
+受窘 8 v
+受粉 10 n
+受精 194 v
+受精卵 148 i
+受精率 8 n
+受累 91 v
+受约人 3 n
+受约束 3 v
+受纳 22 v
+受罚 211 v
+受罪 132 v
+受者 17 n
+受聘 106 v
+受聘者 3 n
+受胎 6 v
+受胎率 3 n
+受苦 236 v
+受苦受累 3 l
+受苦受难 3 l
+受落 3 v
+受虐 3 v
+受虐狂 3 l
+受血者 5 n
+受表彰 3 i
+受让 67 v
+受让人 9 n
+受让方 38 n
+受训 81 v
+受训人 3 n
+受训练人 3 n
+受训者 4 n
+受讯 3 v
+受记 3 v
+受访 17 v
+受访人 8 n
+受访者 272 n
+受诉 3 v
+受词 3 n
+受试者 27 n
+受话人 3 l
+受话器 6 l
+受话机 3 l
+受调查者 5 n
+受贿 341 v
+受贿人 4 n
+受贿案 7 n
+受贿罪 24 n
+受贿者 5 n
+受资国 26 n
+受赏 15 v
+受赐良多 3 l
+受赠 21 v
+受赠人 3 n
+受赠者 2 n
+受距 3 v
+受身 3 v
+受辱 148 v
+受过 738 v
+受过伤 3 l
+受迫对流 3 n
+受迫振动 3 n
+受邀 73 v
+受邀者 3 r
+受重 8 v
+受错 3 v
+受阻 218 v
+受阻于 3 n
+受降 114 v
+受降仪式 3 n
+受降典礼 3 n
+受限 88 v
+受限于 3 l
+受限制 3 n
+受难 124 v
+受难日 4 l
+受难者 15 n
+受难记 3 n
+受雇 36 v
+受领 40 v
+受领支票 3 n
+受饿 3 v
+受骗 180 v
+受骗上当 3 n
+受骗人 5 n
+受骗者 3 n
+变 12121 v
+变上 3 v
+变上去 3 v
+变上来 3 v
+变下 3 v
+变下去 3 v
+变为 1658 v
+变乱 112 v
+变了又变 3 l
+变了样 3 l
+变产 3 vn
+变亮 3 v
+变价 10 vn
+变价款 2 l
+变位 25 vn
+变低 3 v
+变体 118 n
+变体字 3 vn
+变作 3 vn
+变例 45 n
+变俗易教 3 n
+变修 3 vn
+变做 3 v
+变农为商 3 n
+变冷 3 vn
+变凉 3 v
+变凤凰 3 n
+变出 3 v
+变分法 67 n
+变则 6 n
+变则通 3 l
+变到 3 v
+变动 1761 vn
+变动不居 9 l
+变动性 5 n
+变动率 5 n
+变动表 11 n
+变化 14935 vn
+变化万端 3 l
+变化不测 3 l
+变化不穷 3 l
+变化器 3 n
+变化多端 86 l
+变化如神 3 l
+变化很大 5 z
+变化无常 26 l
+变化无穷 36 l
+变化检测 3 n
+变化率 56 n
+变化球 3 n
+变化系 3 n
+变化莫测 32 l
+变化规律 3 l
+变化趋势 4 l
+变卖 119 v
+变卖家产 3 n
+变卦 109 v
+变危为安 3 l
+变压 6 vn
+变压器 240 n
+变压器厂 2 n
+变厚 3 v
+变去 3 v
+变反 3 v
+变变 3 v
+变变看 3 l
+变古乱常 3 i
+变古易俗 3 n
+变古易常 3 i
+变名易姓 3 n
+变向 3 v
+变向器 3 n
+变味 28 n
+变味儿 4 v
+变咸 3 v
+变回 3 v
+变回去 3 l
+变回来 3 l
+变因 3 n
+变圆 3 n
+变址 3 n
+变坏 68 v
+变型 117 vn
+变声 10 n
+变声期 4 n
+变复如是 3 l
+变大 3 v
+变天 23 n
+变天账 4 l
+变奏 13 v
+变奏曲 25 n
+变奏曲式 3 n
+变好 3 v
+变子 3 n
+变容 13 v
+变宽 3 v
+变小 120 v
+变少 3 v
+变局 19 n
+变差 2 n
+变幅 76 n
+变平 3 n
+变幻 245 v
+变幻不测 3 i
+变幻无常 8 i
+变幻无穷 18 i
+变幻莫测 68 i
+变应原 3 n
+变应性 6 n
+变废为宝 268 i
+变异 591 n
+变异中心 3 l
+变异型 5 n
+变异性 22 n
+变异系数 3 l
+变弄 3 v
+变弱 3 v
+变强 14 v
+变形 998 n
+变形体 3 n
+变形杆菌 3 l
+变形缝 3 l
+变形虫 15 n
+变形记 3 n
+变形运动 3 l
+变形金刚 3 n
+变影 3 n
+变得 4499 v
+变得丰美 3 i
+变得坚韧 3 i
+变得复杂 3 i
+变得宽容 3 l
+变得残忍 3 i
+变心 33 v
+变心易虑 3 i
+变快 3 v
+变态 783 n
+变态传奇 3 n
+变态反应 106 l
+变态心理 3 i
+变态性 3 n
+变态版 3 v
+变态狂 6 l
+变态男 3 n
+变态百出 3 i
+变性 188 n
+变性人 3 n
+变性凝胶 3 n
+变性剂 3 n
+变性手术 3 l
+变性蛋白 3 l
+变性酒精 3 n
+变感器 3 l
+变慢 3 v
+变戏法 50 n
+变戏法者 3 n
+变成 6555 v
+变成流了 3 l
+变成菜色 3 n
+变扁 3 n
+变招 168 v
+变换 994 v
+变换位置 3 n
+变换分析 3 l
+变换器 20 l
+变换处理 2 l
+变换编码 3 l
+变换语义 3 l
+变故 393 n
+变故易常 3 i
+变数 128 n
+变新 3 v
+变旋 3 vn
+变旋酶 3 n
+变易 41 vn
+变星 144 n
+变晴 3 v
+变暖 3 v
+变暗 3 n
+变更 1345 v
+变更转储 3 nz
+变服诡行 3 i
+变本 3 n
+变本加厉 117 i
+变来 3 v
+变来变去 3 l
+变松 3 vn
+变构 3 n
+变样 19 n
+变格 3 n
+变法 646 vn
+变法儿 3 l
+变法维新 48 l
+变法运动 3 l
+变流 20 vn
+变流器 13 n
+变浅 3 v
+变浓 3 nz
+变淡 3 v
+变清 3 v
+变清蛋白 3 l
+变温 11 n
+变温动物 15 l
+变温层 3 n
+变湿 3 v
+变灭 3 v
+变炫无穷 3 nr
+变热 3 v
+变焦 11 vn
+变焦镜头 3 n
+变率 3 n
+变现 34 v
+变甜 3 n
+变生不测 18 l
+变生肘腋 2 i
+变电 35 vn
+变电器 4 n
+变电所 60 n
+变电站 21 n
+变白 3 v
+变白蛋白 3 l
+变相 225 n
+变相加价 3 n
+变相处理 3 l
+变相涨价 3 i
+变相肘腋 3 i
+变着法 19 l
+变着法儿 3 l
+变矩器 17 nz
+变短 2 v
+变硬 3 v
+变种 198 n
+变空 3 vn
+变窄 34 v
+变粗 3 n
+变紧 3 v
+变红 3 v
+变线 12 n
+变细 3 n
+变给 3 vn
+变绿 3 v
+变翘 3 n
+变胺蓝 3 nz
+变脏 3 n
+变脸 81 v
+变脸变色 3 l
+变脸王 3 n
+变色 294 n
+变色之言 3 i
+变色易容 3 n
+变色机能 3 n
+变色杯 3 n
+变色牙 3 n
+变色笔 3 n
+变色蜴 3 n
+变色镜 5 n
+变色龙 32 n
+变节 33 vn
+变节分子 3 n
+变节者 3 n
+变节自首 3 i
+变薄 3 v
+变蛋 3 n
+变视紫质 3 n
+变调 56 v
+变质 742 n
+变质处理 3 vn
+变质岩 447 n
+变质石 3 n
+变质量系 3 n
+变贪厉薄 3 i
+变走 3 v
+变起 3 v
+变距阵 3 n
+变身 3 v
+变躬迁席 3 n
+变轨 16 vn
+变软 3 v
+变轻 3 v
+变迁 1103 vn
+变迁兴衰 3 l
+变过 3 v
+变过来 3 l
+变迟 3 v
+变送器 3 n
+变通 79 vn
+变通之计 3 l
+变通办法 3 n
+变通处理 3 l
+变通方法 3 n
+变通法 3 n
+变通途 3 n
+变速 57 v
+变速器 21 n
+变速机 3 n
+变速杆 3 n
+变速箱 110 n
+变速精灵 3 n
+变速装置 3 n
+变速运动 2 nz
+变速齿轮 3 n
+变造 5 vn
+变造出 3 n
+变配电 3 n
+变酸 3 n
+变重 3 v
+变量 1172 vn
+变量值 3 l
+变量名 3 v
+变错 3 v
+变长 3 v
+变阵 3 v
+变阻器 10 n
+变青 3 vn
+变青蛙 3 n
+变革 2441 vn
+变革性 4 n
+变革时代 3 l
+变音 3 n
+变音器 3 n
+变音期 3 n
+变频 70 vn
+变频器 7 n
+变频空调 3 n
+变频管 3 n
+变颜变色 3 l
+变风改俗 3 i
+变风易俗 3 i
+变风量 3 n
+变魔术 3 v
+变黄金 3 n
+变黑 3 v
+叙 1386 ns
+叙事 304 v
+叙事体 3 n
+叙事学 2 nt
+叙事性 16 n
+叙事文 10 n
+叙事曲 17 n
+叙事歌曲 3 l
+叙事诗 130 n
+叙写 3 v
+叙利亚 643 ns
+叙利亚人 15 n
+叙别 7 v
+叙功 3 v
+叙及 3 ns
+叙叙 3 v
+叙叙旧 3 ns
+叙家常 13 ns
+叙情 3 n
+叙政府 2 nt
+叙文 3 n
+叙旧 58 ns
+叙永 6 ns
+叙永县 4 ns
+叙浦 3 ns
+叙浦县 3 ns
+叙言 3 v
+叙词 3 n
+叙话 3 v
+叙说 102 v
+叙说着 3 v
+叙谈 27 v
+叙述 1401 v
+叙述体 3 n
+叙述出来 3 n
+叙述性 6 n
+叙述法 3 n
+叙述者 3 n
+叚 69 zg
+叛 625 n
+叛乱 1028 v
+叛乱份子 3 n
+叛乱分子 3 n
+叛乱者 17 n
+叛党 12 n
+叛党叛国 3 n
+叛兵 6 n
+叛军 264 n
+叛匪 25 n
+叛卖 12 v
+叛变 276 v
+叛国 67 n
+叛国罪 30 n
+叛将 3 n
+叛徒 466 n
+叛敌 3 v
+叛离 44 v
+叛离正轨 3 n
+叛臣 9 n
+叛贼 45 n
+叛逃 82 v
+叛逃者 4 n
+叛逆 230 v
+叛逆者 17 n
+叛逆行为 3 n
+叜 13 zg
+叞 223 zg
+叟 94 g
+叠 914 v
+叠出 3 v
+叠出去 3 v
+叠出来 3 v
+叠前偏移 3 i
+叠加 207 v
+叠加定律 3 n
+叠加定理 3 n
+叠加速度 3 n
+叠印 7 v
+叠压 37 v
+叠叠 3 v
+叠叠看 3 i
+叠句 3 n
+叠合 13 v
+叠好 3 v
+叠字 7 n
+叠小 3 z
+叠层 9 n
+叠层石 17 n
+叠嶂 22 n
+叠嶂层峦 3 nr
+叠席 3 n
+叠平 3 n
+叠床 3 v
+叠床架屋 3 n
+叠彩区 3 n
+叠彩山 2 i
+叠成 3 v
+叠接 3 v
+叠放 13 v
+叠来叠去 3 z
+叠氮 3 n
+叠氮化物 3 n
+叠氮吖啶 3 nz
+叠氮钠 3 n
+叠片 2 n
+叠盖 3 v
+叠盖线 3 n
+叠矩重规 3 i
+叠石 6 n
+叠石为山 3 i
+叠罗汉 4 ns
+叠置 3 v
+叠翠 27 z
+叠被 14 n
+叠词 3 n
+叠起 3 v
+叠起来 3 v
+叠音 4 n
+叠韵 12 n
+叡 121 zg
+口 20778 q
+口上 3 s
+口下留情 3 n
+口不二价 3 i
+口不应心 3 i
+口不择言 16 i
+口中 1617 s
+口中蚤虱 3 n
+口中雌黄 3 i
+口乾 3 ns
+口乾舌燥 3 i
+口交 3 n
+口令 157 n
+口令句 3 n
+口伐 3 n
+口传 66 n
+口传心授 6 n
+口似悬河 3 i
+口供 95 v
+口信 45 n
+口信儿 7 n
+口儿 3 n
+口内 3 s
+口内支抗 3 n
+口出不逊 3 i
+口出大言 3 i
+口出怨言 17 i
+口出狂言 16 i
+口出秽言 3 i
+口前 38 s
+口北 3 s
+口区 4 n
+口印 3 n
+口口 3 n
+口口声声 203 i
+口口相传 6 i
+口号 1716 n
+口号声 162 n
+口号式 7 n
+口吃 135 n
+口吃者 3 n
+口吐 3 v
+口吐珠玑 3 i
+口吐白沫 3 n
+口含天宪 3 i
+口吻 373 n
+口吻生花 3 n
+口呆目瞪 3 i
+口呆目钝 3 i
+口味 2153 n
+口味淡 3 v
+口味重 3 v
+口呼 3 n
+口哨 97 n
+口哨儿 3 n
+口哨声 9 n
+口唇 120 n
+口喊 3 v
+口喊着 3 l
+口喻 3 n
+口器 107 n
+口坠天花 3 i
+口型 8 n
+口壅若川 3 ns
+口外 3 s
+口外支抗 3 i
+口多食寡 3 l
+口头 527 n
+口头上 3 l
+口头地 3 n
+口头报告 3 n
+口头文学 42 n
+口头禅 83 n
+口头语 21 i
+口如悬河 3 i
+口子 927 n
+口子酒 4 n
+口孔 9 n
+口实 49 n
+口密腹剑 3 i
+口密腹箭 3 n
+口尚乳臭 3 n
+口岸 500 s
+口干 3 n
+口干燥症 3 n
+口干舌焦 3 n
+口干舌燥 42 l
+口弦 11 n
+口形 7 n
+口彩 8 n
+口径 2130 n
+口德 3 n
+口快心直 3 i
+口惠 3 vn
+口惠而实不至 2 l
+口感 131 n
+口才 178 n
+口才好 3 l
+口技 31 n
+口拙 3 v
+口授 68 n
+口授法 3 n
+口无择言 3 i
+口是心苗 3 n
+口是心非 38 i
+口服 326 n
+口服心服 19 i
+口服液 64 n
+口服药 8 n
+口服药物 5 n
+口杯 4 n
+口气 1418 n
+口气道 116 n
+口水 134 n
+口水仗 3 n
+口水战 3 n
+口水直流 3 i
+口水鸡 3 n
+口沫 3 n
+口沫横飞 3 l
+口沸目赤 3 i
+口渴 168 n
+口渴难忍 3 i
+口湖 22 n
+口炎 5 n
+口燥唇干 3 i
+口琴 65 n
+口生莲花 3 n
+口疮 15 n
+口盖 16 n
+口直心快 3 i
+口眼歪斜 3 l
+口碑 121 n
+口碑网 3 i
+口碑载道 5 i
+口碱 3 n
+口福 26 n
+口福不浅 3 i
+口禾 3 n
+口禾髎 3 l
+口称 88 n
+口算 3 n
+口粗 3 n
+口粮 139 n
+口粮田 2 n
+口紧 3 v
+口红 90 n
+口约 3 n
+口绝行语 3 i
+口缘 3 n
+口罩 136 n
+口耳 3 n
+口耳之学 3 l
+口耳并重 3 i
+口耳相传 3 i
+口耳相承 3 i
+口脣 3 vn
+口腔 690 n
+口腔前庭 3 i
+口腔医学 3 n
+口腔医院 3 n
+口腔卫生 3 n
+口腔学 3 n
+口腔康复 3 i
+口腔溃疡 3 n
+口腔炎 3 n
+口腔疾病 3 n
+口腔病灶 3 i
+口腔癌 13 n
+口腔科 16 n
+口腔粘膜 3 n
+口腔红斑 3 l
+口腔褥疮 3 n
+口腔诊所 3 n
+口腹 33 n
+口腹之欲 5 i
+口腹之累 3 i
+口臭 39 n
+口臭病 3 n
+口舌 166 n
+口舌之争 3 l
+口舌之利 3 l
+口若悬河 34 i
+口苦 45 n
+口蘑 26 n
+口蜜腹剑 13 i
+口血未干 3 i
+口衔天宪 3 i
+口袋 996 n
+口袋书 3 n
+口袋吧 3 n
+口袋妖怪 3 n
+口角 150 n
+口角唇炎 3 n
+口角春风 3 n
+口角流涎 3 v
+口角炎 2 n
+口角生风 3 n
+口角线 3 n
+口角锋芒 3 n
+口角风情 3 n
+口讲指画 3 n
+口诀 235 n
+口词 3 n
+口译 104 n
+口译员 3 n
+口试 67 vn
+口诛笔伐 15 i
+口语 326 n
+口语体 3 n
+口语化 14 n
+口语程度 3 n
+口语翻译 3 l
+口语记录 3 n
+口误 5 n
+口说 151 n
+口说无凭 23 i
+口诵 3 v
+口诵心维 3 n
+口谈 3 n
+口谐辞给 3 l
+口谕 3 n
+口蹄疫 14 n
+口轻 3 v
+口轻舌薄 3 i
+口边 3 s
+口述 112 n
+口述出来 3 n
+口述法 3 n
+口部 3 n
+口里 546 s
+口重 3 n
+口镇 4 n
+口镜 3 n
+口门 21 n
+口间 2 n
+口阝可 3 vn
+口阿 3 ns
+口难开 3 i
+口音 547 n
+口颌系统 3 n
+口风 78 n
+口香 3 n
+口香糖 120 n
+口鼻长 3 n
+口齿 155 n
+口齿不清 3 l
+口齿伶俐 3 i
+口齿清晰 3 l
+口齿清楚 3 l
+口齿生香 3 n
+古 8464 a
+古一军 2 nr
+古丈 6 n
+古丈县 3 nr
+古三国 256 ns
+古三苗 2 nr
+古为今用 29 l
+古丽巴哈尔 2 nrt
+古义 21 n
+古义治 3 nr
+古之仙 2 nr
+古之僵尸 2 nr
+古书 196 n
+古书屋 3 n
+古书店 3 n
+古井 72 n
+古井不波 3 i
+古井无波 3 i
+古亚 2 ns
+古亚述 7 nr
+古交 2 b
+古交区 3 n
+古交市 4 n
+古亭区 3 nr
+古亭国中 3 nr
+古亭国小 3 nr
+古人 1270 n
+古人云 3 nr
+古人类 328 n
+古人类学 13 n
+古人类学家 13 n
+古今 802 t
+古今中外 108 l
+古今之 4 nr
+古今有之 3 i
+古今笑 2 nr
+古今谭 2 nr
+古今风 2 nr
+古代 8438 t
+古代人 75 n
+古代史 65 n
+古代性 3 n
+古代文学 3 nt
+古代文明 3 nr
+古代汉语 3 nz
+古代篇 3 n
+古传本 2 nr
+古体 20 n
+古体文 3 nr
+古体诗 24 nr
+古健杰 4 nr
+古儿 2 t
+古儿汗 3 nr
+古元真 2 nr
+古全浊 4 nr
+古公卒 4 nr
+古公后 3 nr
+古公父 2 nr
+古兰 5 ns
+古兰经 172 nr
+古关峪 6 nr
+古关道 2 nr
+古典 1245 ns
+古典主义 139 n
+古典作品 3 n
+古典名著 3 nr
+古典型 3 n
+古典学派 3 n
+古典家具 3 n
+古典小说 3 n
+古典建筑 3 n
+古典式 36 n
+古典文学 140 nt
+古典派 3 nr
+古典舞 34 nr
+古典艺术 3 n
+古典音乐 3 n
+古典风格 3 n
+古兹密 2 nr
+古冰川 21 nr
+古冰斗 8 nr
+古冶区 3 ns
+古准 2 n
+古列 2 b
+古列维奇 4 nrt
+古列耶 16 nr
+古利 2 ns
+古利克 9 nr
+古利特 4 nr
+古刹 75 n
+古力 145 n
+古力特 3 nr
+古加拉 2 nr
+古勃金 4 nr
+古勒寨 2 nr
+古北 4 ns
+古北口 50 ns
+古北新区 3 ns
+古北界 26 n
+古医经 2 n
+古华容 256 nr
+古南 2 ns
+古南都 2 ns
+古印加 3 nr
+古印度 3 n
+古印格 2 nr
+古印谱 3 nr
+古历 4 t
+古厝 3 nrt
+古原 2 ns
+古县 3 ns
+古古怪怪 3 i
+古史 142 n
+古右文 2 nr
+古号 3 n
+古吉拉 3 nr
+古吉拉特 28 nrt
+古吉拉特邦 12 ns
+古名 3 a
+古名崇 2 nr
+古吴轩 3 nr
+古喀斯 3 nr
+古器 4 n
+古回文 2 nr
+古国 110 ns
+古国之 2 nr
+古国伊 2 nr
+古国史 3 nr
+古图 8 n
+古图索 2 nr
+古土壤 3 ns
+古圣先贤 4 nr
+古圣贤 9 nr
+古在希 16 nr
+古地图 3 ns
+古地理学 3 n
+古坟 3 n
+古埃及 3 ns
+古城 1664 ns
+古城区 3 ns
+古城堡 31 ns
+古城墙 3 nr
+古城子 2 nr
+古城村 2 nr
+古城热线 3 n
+古城镇 3 ns
+古埙 3 n
+古堡 177 ns
+古堰 3 ns
+古塔 56 nr
+古塔区 3 ns
+古塔山 11 nr
+古塔波 3 nr
+古塘 9 ns
+古墓 1852 n
+古墓俪影 3 vn
+古墓派 3 n
+古墓群 284 n
+古墓葬 22 n
+古壁 2 n
+古士 96 n
+古士也 16 nr
+古大秦 2 nr
+古天乐 3 nr
+古夷民 2 nr
+古奇沙 3 nr
+古契科 2 nr
+古奥 14 nr
+古妆 3 n
+古字 12 n
+古学 5 n
+古宅 3 n
+古宇田 2 nr
+古安切 9 nr
+古宗列 7 nr
+古宙 9 n
+古定剑 4 nr
+古家具 3 n
+古宾 3 ns
+古寺 42 ns
+古尔伯 2 nr
+古尔勃 2 nr
+古尔奈 6 nr
+古尔德 12 nr
+古尔斯 2 nr
+古尔本 2 ns
+古尔沟 2 ns
+古尔河 3 ns
+古尔泰 36 nr
+古尔湖 3 nr
+古尔特 2 nr
+古尔班 2 nr
+古尔班通古特沙漠 15 ns
+古尔琴 2 nr
+古尔登 11 nr
+古尔盾 2 nr
+古尔维 3 nr
+古尔蒂 2 nr
+古尔语 2 nr
+古尔邦 2 nr
+古尔邦节 24 nr
+古尸 245 n
+古屋 4 n
+古屋传奇 3 nr
+古山 266 ns
+古山龙 3 nr
+古崖居 2 nr
+古川 3 ns
+古巨基 3 nr
+古巨山 6 nr
+古已有之 30 i
+古巴 818 ns
+古巴人 8 nrt
+古巴共产党 13 nt
+古巴共和国 10 ns
+古巴战士 3 nz
+古巴政府 12 nt
+古巴比伦 3 ns
+古巴队 3 n
+古币 6 n
+古布利 16 nr
+古希腊 796 ns
+古广陵 2 nr
+古庙 69 ns
+古庙中 4 nr
+古建 27 ns
+古建筑 1335 nr
+古建筑群 3 n
+古式 8 n
+古录 6 n
+古彝文 3 nr
+古彩 5 n
+古往今来 136 l
+古径 3 n
+古律今 2 nr
+古徐闻 2 nr
+古微堂 2 nr
+古德伊尔 9 nrt
+古德尔 2 nr
+古德曼 3 nr
+古德诺 10 nr
+古德里 2 nr
+古德里奇 3 nrt
+古德里安 14 nrt
+古思帖 12 nr
+古怪 1316 a
+古息 4 n
+古惑 3 a
+古惑仔 3 nr
+古惑狼 3 nr
+古意 36 n
+古意盎然 3 i
+古战场 3 n
+古托夫 5 nr
+古拉 16 nrt
+古拉一世 4 nrt
+古拉峰 9 nr
+古拉拉 2 nrt
+古拉格 4 nr
+古拉特 3 nr
+古拉蒂 2 nr
+古拙 28 a
+古文 368 nr
+古文体 3 nr
+古文化 310 nr
+古文字 100 nr
+古文字学 35 n
+古文学 3 nr
+古文明 3 nr
+古文献 36 nr
+古文观止 3 l
+古斯塔 5 nr
+古斯塔夫 36 nrt
+古斯拉夫 4 nrt
+古斯曼 6 nr
+古斯特 3 nr
+古新世 30 nr
+古新统 7 nr
+古方 16 n
+古日山 2 ns
+古旧 81 a
+古旧书 3 n
+古时 337 t
+古时候 74 n
+古明华 3 nr
+古昔 18 t
+古昔斋 2 nr
+古是今非 3 l
+古晋 12 t
+古普塔 4 nr
+古曲 10 n
+古月 258 t
+古有名训 3 nr
+古有明 2 nr
+古木参天 21 nr
+古本 37 ns
+古本竹 24 nr
+古术 3 n
+古朴 200 a
+古村群 2 nr
+古村落 3 nr
+古来 88 t
+古来有之 3 i
+古来氏 8 nr
+古来稀 3 nr
+古杰兰 3 nr
+古杰拉尔 11 nr
+古松 66 a
+古板 46 n
+古板板 3 n
+古果 9 n
+古柯 27 nr
+古柯叶 3 nr
+古树 81 n
+古树名 7 nr
+古树森 2 nr
+古树盘 2 nr
+古栗树 4 nr
+古根汉姆 3 nr
+古根海姆 7 ns
+古格 36 n
+古格奴 6 nr
+古格王 4 nr
+古格王国 9 ns
+古格银 11 nr
+古桥 27 ns
+古森林 2 nr
+古楚 7 a
+古楚汗 2 nr
+古楼 7 n
+古樟 6 ns
+古歌 4 n
+古武术 3 n
+古比 3 ns
+古比斯 3 nr
+古比雪夫 14 nr
+古民居 3 n
+古气候 3 n
+古水文学 3 n
+古汉 11 t
+古汉语 3 nr
+古汴河 5 nr
+古汴渠 2 nr
+古河 16 ns
+古河村 2 ns
+古泉汇 3 nr
+古法 3 n
+古法之 3 nr
+古泗水 4 nr
+古波斯 34 nr
+古洋 2 ns
+古洛夫 2 nr
+古济水 4 n
+古浪 5 nz
+古浪县 3 ns
+古浪河 2 nr
+古涅昆 2 nr
+古滇国 6 nr
+古滨 3 ns
+古漪园 2 nr
+古潜山 2 nr
+古灵精怪 3 i
+古炮 4 n
+古物 367 n
+古特兰 2 nr
+古特尼 3 nr
+古特提 4 nr
+古猿 77 nr
+古玉器 3 nr
+古玉图 4 nr
+古玛雅 4 nr
+古玩 240 n
+古玩商 10 nr
+古玩城 3 nr
+古玩店 10 nz
+古玺印 2 nr
+古珊瑚 2 nz
+古班 2 n
+古琴 94 nr
+古琴台 269 ns
+古琴曲 3 nr
+古瓦西 10 nr
+古生 6 n
+古生代 182 t
+古生物 116 n
+古生物学 74 n
+古生物学家 32 n
+古生界 24 n
+古田 344 nr
+古田会议 31 nz
+古田县 22 ns
+古画 61 n
+古登堡 4 nr
+古登巴 2 nr
+古皓 3 nrfg
+古砚 4 nr
+古砚微 2 nr
+古礼义 2 nr
+古神 2 n
+古神庙 3 nr
+古称 517 n
+古称泽 2 nr
+古称渝 2 nr
+古稀 29 a
+古稀之年 13 l
+古立克 2 nr
+古笃诚 26 nr
+古筝 34 n
+古筝曲 3 n
+古箭虫 2 n
+古籍 387 n
+古籍整理 3 n
+古紫色 3 nr
+古纳兰 11 nr
+古纳河 3 ns
+古纳特 3 nr
+古细菌 3 n
+古维语 2 nr
+古罗斯 6 nr
+古罗糖 2 nr
+古罗马 301 ns
+古老 2695 nr
+古老古朴 3 nr
+古者圣 3 nr
+古般若 2 nr
+古船 35 n
+古色古香 59 n
+古色林 2 nr
+古若般 3 nr
+古茨 3 nrt
+古荥镇 3 nr
+古莫斯 4 nr
+古莱子 3 nr
+古萧窑 2 nr
+古葛洛 16 nr
+古董 294 nr
+古董商 3 nr
+古董店 6 ns
+古董表 3 nr
+古董车 3 n
+古董铺 3 n
+古蒂左 3 nr
+古蔡试验 3 vn
+古蔺 17 nr
+古蔺县 8 ns
+古藤杯 11 nr
+古蜥蜴 3 n
+古街 9 ns
+古装 32 n
+古装剧 8 n
+古装戏 11 n
+古装片 5 n
+古观星 2 nr
+古观象台 15 n
+古训 59 n
+古诗 283 n
+古诗文 7 nr
+古诗词 11 nr
+古话 38 n
+古语 71 nz
+古语云 3 nr
+古语词 3 n
+古诺 6 nr
+古诺尔 5 nr
+古调不弹 3 l
+古调单弹 3 l
+古调独弹 3 l
+古谚 9 n
+古貌古心 3 n
+古贾尔 3 nr
+古越族 3 nr
+古运河 2 ns
+古运河畔 2 ns
+古远清 6 nr
+古迪逊 3 nr
+古迭儿 3 nr
+古迹 1277 n
+古道 147 n
+古道循肠 3 i
+古道热肠 13 n
+古遗音 3 n
+古邓城 2 nr
+古邗国 2 nr
+古邳镇 2 ns
+古都 670 ns
+古里 66 t
+古里亚 2 ns
+古里古怪 45 nz
+古里安 5 nr
+古里耶夫 4 nrt
+古钢琴 3 nr
+古钱 23 n
+古钱币 11 n
+古铜 34 n
+古铜剑 5 nr
+古铜色 27 n
+古铜鼎 2 nr
+古镇 276 ns
+古镇村 2 nr
+古镜 46 n
+古镜中 2 nr
+古镜卦 2 nr
+古镜古 2 nr
+古镜拿 2 nr
+古镜镇 4 nr
+古长城 3 nr
+古长堤 256 nr
+古长安 3 nr
+古长江 3 nr
+古阳洞 2 nr
+古陆 28 n
+古隆 5 t
+古隆中 262 nr
+古雅 39 nr
+古音 74 n
+古风 74 n
+古香主 9 nr
+古香古色 2 n
+古马 4 ns
+古马乡 3 ns
+古鲁孙 37 nr
+古鸡 3 n
+古黄河 4 nr
+古齐里耶夫 2 nrt
+古齿 2 n
+古龙 20 nr
+古龙标 2 nr
+古龙水 4 nr
+句 6294 q
+句句 163 q
+句句实话 3 l
+句号 142 n
+句型 92 n
+句型分析 3 l
+句型练习 3 n
+句子 482 n
+句子成分 16 l
+句容 21 n
+句容县 3 ns
+句容市 3 n
+句式 82 n
+句数 3 n
+句斟字酌 3 v
+句末 3 n
+句柄 6 n
+句栉字比 3 vn
+句法 55 n
+句法关系 2 l
+句法分析 3 l
+句法树 3 n
+句法结构 4 n
+句点 13 n
+句词 3 n
+句读 23 n
+句调 3 n
+句首 3 n
+另 22635 r
+另一人 3 i
+另一侧 3 i
+另一则 3 c
+另一半 3 d
+另一只 3 c
+另一台 3 l
+另一名 3 i
+另一回 3 i
+另一回事 3 i
+另一头 3 d
+另一家 3 l
+另一封 3 i
+另一帖 3 n
+另一手 3 d
+另一方 3 i
+另一方面 3365 c
+另一版 3 l
+另一番 3 d
+另一端 3 i
+另一类 3 i
+另一组 3 n
+另一边 3 d
+另一面 3 c
+另为 3 c
+另于 3 c
+另付 3 v
+另件 3 n
+另借 3 v
+另具 3 n
+另册 14 v
+另加 42 d
+另告 3 n
+另唱 3 v
+另外 10239 c
+另存 3 v
+另存为 3 i
+另寄 3 v
+另寻 3 v
+另开一张 3 i
+另开生面 3 l
+另当别论 28 i
+另征 3 n
+另悉 11 v
+另想办法 3 l
+另成一家 3 l
+另打主意 3 l
+另担 3 v
+另换 3 v
+另据报道 3 n
+另接 3 c
+另搞 3 v
+另搞一套 3 v
+另攀高枝 3 l
+另收 3 v
+另有企图 3 l
+另有其 3 c
+另有所指 10 i
+另有打算 3 i
+另有新欢 3 i
+另有洞天 3 i
+另有隐情 3 i
+另有高就 3 i
+另样 3 d
+另案 3 n
+另案处理 3 i
+另楚寒巫 3 i
+另眼相待 7 i
+另眼相看 91 i
+另眼看待 28 i
+另眼看戏 3 l
+另立 3 v
+另签 3 v
+另类 165 n
+另类版 3 n
+另纳 3 v
+另结新欢 3 i
+另缴 3 v
+另行 447 v
+另行安排 3 n
+另行规定 3 l
+另行通知 3 i
+另行高就 3 i
+另装 3 v
+另觅新欢 3 i
+另计 3 v
+另订 3 v
+另议 12 n
+另记 3 n
+另许 3 d
+另请高明 8 i
+另谋 3 n
+另谋出路 3 i
+另谋高就 10 i
+另购 3 v
+另起炉灶 28 i
+另辟 3 v
+另辟蹊径 25 l
+另述 3 c
+另选 27 v
+另配 3 v
+另附 3 v
+叧 127 zg
+叨 218 v
+叨光 3 v
+叨叨 3 v
+叨咕 11 v
+叨唠 4 v
+叨在知己 3 v
+叨念 20 v
+叨扰 35 v
+叨教 3 v
+叨陪末座 3 nr
+叩 1148 v
+叩关 4 v
+叩出 3 v
+叩击 35 v
+叩击者 3 n
+叩响 13 v
+叩头 934 v
+叩头虫 8 n
+叩开 15 v
+叩得 3 v
+叩心泣血 3 n
+叩打 3 v
+叩拜 86 v
+叩来叩去 3 z
+叩源推委 3 n
+叩石垦壤 3 n
+叩见 3 v
+叩诊 28 v
+叩谢 85 v
+叩门 20 v
+叩门声 15 n
+叩门求见 3 v
+叩问 21 v
+叩阍无路 3 nz
+叩首 64 v
+叩马而谏 3 v
+叩齿 6 v
+只 101442 d
+只不过 2183 c
+只为 3 c
+只乐乡 3 i
+只争旦夕 3 i
+只争朝夕 18 i
+只借不还 3 l
+只可会意 3 l
+只可意会 15 l
+只因 3 c
+只在乎 3 i
+只多不少 3 d
+只够 3 v
+只好 5466 d
+只字不提 47 l
+只字未提 18 l
+只字片纸 3 l
+只字片语 4 i
+只学到 3 l
+只守不攻 3 i
+只守到 3 l
+只定 3 d
+只害 3 v
+只射 3 v
+只射到 3 v
+只尽到 3 l
+只帮忙 3 l
+只延 3 v
+只开出 3 v
+只开到 3 v
+只开去 3 v
+只开回 3 v
+只开来 3 l
+只当 316 d
+只录 3 v
+只录到 3 v
+只得 2921 v
+只怕 2702 c
+只怕有心人 7 i
+只思淫欲 3 i
+只恐 3 v
+只想出 3 v
+只想去 3 l
+只想哭 3 l
+只想来 3 l
+只成 3 v
+只手遮天 3 i
+只敢 3 d
+只是 4875 c
+只有 5622 c
+只欠东风 14 i
+只此 3 c
+只此一家 262 l
+只求 361 v
+只求无过 3 i
+只求自保 3 v
+只用 328 v
+只知其一 26 i
+只租不买 3 l
+只租不卖 3 l
+只管 1041 c
+只缘身在此山中 6 i
+只能 6263 v
+只能靠 3 v
+只要 10675 c
+只见 8906 v
+只见树木 2 i
+只言 3 c
+只言片语 34 i
+只订 3 v
+只许 153 d
+只许州官放火 5 i
+只许成功 3 i
+只说不做 5 i
+只读 59 v
+只读光盘 3 i
+只身 103 v
+只身一人 13 i
+只身孤影 3 i
+只轮不反 3 i
+只轮不返 3 l
+只轮无反 3 i
+只闻其声 3 i
+只限 44 v
+只顾 816 d
+只骑不反 3 i
+只鳞片爪 3 i
+只鳞片甲 3 i
+只鸡斗酒 3 i
+只鸡樽酒 3 i
+只鸡絮酒 3 vn
+叫 43431 v
+叫上去 3 v
+叫上来 3 v
+叫个不停 3 v
+叫价 19 v
+叫住 141 v
+叫作 1057 v
+叫做 4030 v
+叫停 50 v
+叫冤 3 v
+叫出 3 v
+叫动 3 v
+叫劲 4 v
+叫化 417 v
+叫化子 140 n
+叫卖 602 v
+叫卖声 26 n
+叫卖网 3 n
+叫名 3 v
+叫吠 3 v
+叫响 18 vn
+叫唆 3 v
+叫唤 256 v
+叫唤声 3 i
+叫啸 3 v
+叫喊 321 v
+叫喊声 3 i
+叫嚣 128 v
+叫嚷 260 v
+叫嚷声 3 v
+叫声 861 v
+叫外卖 3 v
+叫天子 2 n
+叫好 285 v
+叫好声 18 i
+叫安 7 v
+叫屈 30 v
+叫床 3 v
+叫床声 3 i
+叫座 24 v
+叫惯 3 n
+叫来 3 v
+叫板 59 n
+叫法 39 v
+叫渴 3 v
+叫牌 3 v
+叫真儿 3 n
+叫绝 27 v
+叫花子 52 n
+叫苦 157 v
+叫苦不迭 57 i
+叫苦叫累 3 i
+叫苦连天 27 i
+叫醒 169 v
+叫门 54 n
+叫门声 3 n
+叫阵 38 v
+叫驴 43 n
+叫骂 130 v
+叫骂声 23 i
+叫魂 9 n
+叫鸡 3 n
+召 1561 v
+召之即来 10 i
+召人 8 v
+召募 59 v
+召唤 221 v
+召唤兽 3 i
+召唤师 3 i
+召唤术 3 n
+召回 499 v
+召回公文 3 n
+召安 3 v
+召开 9138 v
+召开大会 3 v
+召引 3 v
+召来 3 v
+召祸 3 v
+召租 3 v
+召见 1151 v
+召请 3 v
+召集 4032 v
+召集人 148 n
+召集令 3 n
+召集帖 3 n
+召集贴 3 n
+叭 298 o
+叭儿狗 4 n
+叭叭 3 o
+叭嗒 4 o
+叮 529 zg
+叮人 3 v
+叮人战术 3 l
+叮叮 3 o
+叮叮噹噹 3 o
+叮叮当当 137 o
+叮呤当啷 3 o
+叮咚 54 o
+叮咛 112 v
+叮咬 66 v
+叮嘱 419 v
+叮噹 3 v
+叮噹响 3 v
+叮噹声 3 v
+叮当 170 o
+叮当作响 14 l
+叮当响 3 v
+叮当声 3 v
+叮当猫 3 l
+叮问 3 v
+可 95892 v
+可丁可卯 3 l
+可上 3 v
+可上演 3 v
+可下 3 v
+可不 1415 c
+可不可以 84 c
+可不可能 3 l
+可不填 3 v
+可不是 1247 c
+可为 3 c
+可乐 111 a
+可乐吧 3 n
+可乘之机 132 i
+可乘之隙 3 i
+可也没 3 i
+可也没有 3 l
+可予 3 v
+可争议 3 n
+可于 3 c
+可交谈 3 v
+可亲 63 v
+可亲可敬 4 l
+可亲可近 3 l
+可人儿 6 l
+可仑坡 3 ns
+可以 70958 c
+可以信赖 3 l
+可以攻玉 7 i
+可任意 3 n
+可会 3 v
+可传 3 v
+可伦坡 3 ns
+可估价 3 n
+可伸缩性 2 l
+可体 4 n
+可作 3 v
+可佩 3 v
+可使 3 c
+可供 3 v
+可供使用 3 l
+可供参考 3 l
+可供执行 3 l
+可信 282 v
+可信任 3 l
+可信度 53 l
+可信性 25 n
+可信计算 3 l
+可信赖 3 l
+可修改性 3 l
+可修理 3 n
+可倾斜 3 v
+可假定 3 l
+可做饭 3 v
+可停 3 v
+可偿还 3 l
+可储存 3 n
+可充电 3 l
+可先 3 v
+可先去 3 l
+可先来 3 l
+可免 3 v
+可免于 3 l
+可兑换 3 n
+可兑换性 3 n
+可兰经 30 nz
+可再生 3 l
+可再生性 9 l
+可写 3 v
+可减轻 3 i
+可凭 3 v
+可出 3 v
+可出租 3 l
+可分 3 v
+可分元 3 n
+可分张量 3 l
+可分性 7 n
+可分离性 3 n
+可分解 3 l
+可切除 3 i
+可列举 3 v
+可判 3 v
+可判定性 3 n
+可利用率 3 n
+可别 3 v
+可到 3 v
+可加 3 v
+可加可减 3 i
+可动性 3 n
+可动摇 3 l
+可动油图 3 n
+可化 8 v
+可医好 3 l
+可卑 3 n
+可卡因 42 n
+可卡犬 3 n
+可印刷 3 l
+可压 3 v
+可压榨 3 nz
+可压缩 3 l
+可压缩性 3 n
+可厌 3 v
+可去 3 v
+可发 3 v
+可取 295 v
+可取之处 3 l
+可受 3 v
+可变 191 v
+可变形体 3 l
+可变性 11 l
+可变电容 3 l
+可变电阻 3 l
+可变码率 3 l
+可变资本 916 l
+可变转录 3 n
+可口 687 v
+可口可乐 139 i
+可口可乐中国有限公司 3 nt
+可口可乐公司 26 l
+可可 602 v
+可可亚 3 nz
+可可儿的 3 l
+可可岛 9 n
+可可托海 3 i
+可可树 7 l
+可可油 2 l
+可可粉 14 l
+可可茶 3 l
+可可西 3 l
+可可西里 18 l
+可可西里山 19 ns
+可可豆 22 n
+可叹 85 v
+可向 3 v
+可否 251 v
+可听 3 v
+可听声 2 i
+可听性 3 n
+可吸入 3 l
+可吸入颗粒物 7 n
+可和解 3 l
+可哀 3 v
+可品尝 3 v
+可哦就 3 v
+可售性 3 n
+可唱 3 v
+可喜 384 v
+可喜可贺 3 v
+可喜局面 3 l
+可喜成果 3 i
+可喜成绩 3 l
+可喜进步 3 l
+可嘉 56 nz
+可回复 3 l
+可回忆 3 l
+可回收 3 l
+可因 3 c
+可园 3 n
+可图 35 v
+可圈可点 27 l
+可坐 3 v
+可塑 15 v
+可塑性 60 n
+可复性 3 l
+可多可少 3 l
+可大 3 a
+可大可小 3 l
+可夫 27 n
+可好 213 v
+可好了 3 l
+可存取性 3 l
+可学 3 n
+可守可攻 3 i
+可安装性 3 l
+可定义 3 l
+可定义性 3 n
+可容 3 v
+可容忍 3 l
+可宽恕性 3 vn
+可察觉 3 n
+可尊敬 3 i
+可小可大 3 l
+可少不了 3 l
+可少可多 3 l
+可居住性 3 n
+可展性 3 l
+可巧 94 a
+可度量化 3 v
+可延 3 v
+可延续性 3 l
+可延长 3 l
+可建性 3 l
+可开发量 9 l
+可引用性 3 n
+可归约性 3 n
+可归罪 3 i
+可归还 3 i
+可当 3 v
+可录音 3 n
+可往 3 v
+可征服 3 n
+可征税 3 n
+可待因 3 n
+可得 3 v
+可循 76 v
+可心 22 v
+可心如意 3 l
+可忍受 3 l
+可怕 1950 c
+可怖 268 a
+可怜 1906 v
+可怜兮兮 20 z
+可怜可悯 3 v
+可怜天下父母心 8 l
+可怜巴巴 71 z
+可怜相 22 v
+可怜虫 23 v
+可怜见 84 v
+可恨 145 v
+可恶 289 v
+可恼 3 a
+可悲 145 a
+可悲可叹 3 i
+可惊可叹 3 i
+可惜 3283 v
+可想 3 v
+可想而知 471 l
+可意 11 v
+可愿 3 v
+可慢可快 3 l
+可憎 82 a
+可成形 3 l
+可执行性 2 n
+可执行文件 14 n
+可执行程序 4 n
+可扩充性 4 n
+可扩展性 10 n
+可抑制 3 n
+可折叠 3 v
+可抢救 3 i
+可抹掉 3 v
+可抽吸 3 i
+可拆卸 18 v
+可拉明 3 nz
+可拍照 3 v
+可拔 3 v
+可拜访 3 i
+可拨打 3 i
+可持续性 20 n
+可挖苦 3 n
+可挡 3 v
+可挽回 3 i
+可捐 3 v
+可捕量 4 l
+可接受性 3 n
+可控 64 v
+可控因素 3 n
+可控孔度 3 n
+可控性 15 n
+可控硅 10 nz
+可控表面 3 n
+可推断 3 l
+可摇 3 v
+可撤回 3 z
+可播放 3 b
+可操作性 61 l
+可操左券 3 l
+可操纵 3 i
+可擦 6 v
+可擦掉 3 i
+可攀登 3 l
+可支配 3 v
+可收 3 v
+可收回 3 l
+可改正 3 nz
+可攻 3 v
+可攻克 3 n
+可攻可守 3 i
+可放 3 v
+可救 3 v
+可教 3 v
+可敬 67 v
+可敬可佩 13 l
+可数 24 n
+可数名词 3 l
+可无 3 l
+可是 14820 c
+可更改 3 i
+可更新资源 5 l
+可有 3 v
+可有可无 61 l
+可望 296 v
+可望而不可即 13 i
+可望而不可及 23 i
+可期 3 v
+可构成性 3 n
+可染 3 v
+可染性 3 n
+可查 3 v
+可模仿 3 v
+可欺 36 v
+可歇可泣 3 v
+可歌可泣 74 l
+可比 748 v
+可比价 257 l
+可比价格 11 l
+可比克 3 nrt
+可比性 26 l
+可气 25 v
+可气化 3 l
+可氧化 3 n
+可求 3 v
+可汗 136 v
+可汽化 3 l
+可没收 3 v
+可泣可歌 3 i
+可测性 3 n
+可消化 3 l
+可液化 3 n
+可渗透 3 nz
+可湿 3 v
+可湿性 3 n
+可溶 18 v
+可溶性 95 n
+可溶解 3 l
+可演 3 v
+可点 9 n
+可焊性 4 n
+可然律 3 l
+可然性 3 n
+可熄灭 3 l
+可燃 58 v
+可燃冰 3 n
+可燃性 23 n
+可燃物 8 l
+可燃物质 3 n
+可爱 989 v
+可爱多 3 l
+可爱女生 3 l
+可爱淘 3 l
+可玩性 3 v
+可用 1835 v
+可用内存 3 l
+可用性 27 n
+可用资产 3 l
+可用资金 2 l
+可畏 3 v
+可疑 341 v
+可疑人物 3 l
+可疑分子 3 l
+可疑地 3 l
+可登记 3 n
+可的松 8 l
+可看 3 v
+可看性 2 l
+可真会 3 l
+可真有 3 l
+可真能 3 l
+可真要 3 l
+可知 777 v
+可知性 3 l
+可研磨性 3 n
+可租 3 v
+可称 3 v
+可移植 3 l
+可移植性 16 l
+可穿 3 v
+可穿著 3 n
+可穿透 3 l
+可笑 698 v
+可简化 3 l
+可算 3 v
+可管理性 6 n
+可米小子 3 l
+可紧可松 3 l
+可纠正 3 z
+可约表示 3 n
+可纺性 2 n
+可结晶段 3 n
+可维修性 3 n
+可维护性 10 n
+可缓和 3 i
+可编 3 v
+可编程 21 l
+可考 3 v
+可耕地 69 l
+可耻 181 a
+可耻下场 3 l
+可胜者 2 n
+可能 31213 v
+可能性 1572 n
+可苏醒 3 n
+可获 3 v
+可藏 3 v
+可虑 3 v
+可行 611 v
+可行之道 3 l
+可行性 339 n
+可行性研究 52 n
+可行方向 3 n
+可被粉碎 3 i
+可要 3 c
+可覆盖图 3 i
+可见 2567 v
+可见一斑 91 l
+可见光 200 v
+可见度 4 l
+可观 410 a
+可观上 3 l
+可观察量 3 n
+可观规律 3 l
+可视 71 v
+可视化 31 n
+可视区 3 n
+可视性 3 n
+可视电话 31 l
+可言 301 v
+可计数 3 n
+可计算性 21 n
+可让 3 v
+可议之处 3 l
+可设 3 v
+可证实 3 n
+可诉 3 v
+可诉讼 3 l
+可说 3 c
+可说是 389 c
+可说服 3 v
+可读 3 v
+可读性 69 n
+可调 92 v
+可调式 6 l
+可调节性 3 l
+可谓 1529 v
+可责备 3 l
+可贵 235 a
+可贵地 3 l
+可贵性 3 l
+可贵精神 3 i
+可贺 85 v
+可资利用 3 l
+可赔 3 v
+可赛 3 v
+可身 3 v
+可转债 11 l
+可辨 90 v
+可辨认 3 i
+可辩护 3 n
+可辩论 3 l
+可达 3 v
+可达性 3 l
+可过 3 c
+可运 3 v
+可运到 3 l
+可进 3 v
+可进可退 3 l
+可追溯 3 l
+可追踪 3 i
+可退回 3 v
+可逆 211 v
+可逆反应 9 l
+可逆性 34 n
+可逆过程 3 l
+可选 3 v
+可选性 3 n
+可选择性 4 n
+可选项 3 n
+可递降 3 n
+可造之才 3 l
+可逼近性 3 l
+可遗坐标 3 l
+可邀 3 v
+可鄙 18 a
+可配 3 v
+可采储量 45 n
+可重复性 4 l
+可重获 3 i
+可锻铸铁 5 l
+可长可短 3 i
+可问 3 v
+可闻 3 n
+可防 3 v
+可防性 2 n
+可降解 3 l
+可限 3 v
+可随 3 v
+可靠 1546 v
+可靠人士 3 n
+可靠保证 3 n
+可靠性 490 n
+可靠消息 3 n
+可预付 3 n
+可预测性 3 n
+可预见到 3 l
+可预见性 6 l
+可预言 3 l
+可风 3 v
+可食用 3 l
+可食用性 3 l
+可饮用 3 l
+可饱和 3 nz
+可驯养 3 vn
+可驳斥 3 i
+可验证 3 n
+台 16964 q
+台上 1297 s
+台上台下 3 ns
+台下 895 s
+台下盆 3 ns
+台东 41 ns
+台东人 3 n
+台东区 2 ns
+台东县 12 ns
+台东市 5 ns
+台东师范 3 nr
+台东缘 2 nr
+台中 3 s
+台中人 3 n
+台中县 17 ns
+台中合资 3 n
+台中商专 3 j
+台中市 17 ns
+台中师范 3 nr
+台中港 3 ns
+台中盆地 3 ns
+台之子 3 nr
+台伯河 7 ns
+台位 3 n
+台儿庄 79 ns
+台儿庄区 3 ns
+台军兵 4 nr
+台军成 2 nr
+台军方 3 n
+台军花 3 nr
+台凤 3 ns
+台凤公司 3 n
+台制 3 n
+台制品 3 n
+台前 302 s
+台前县 3 ns
+台前台后 3 nr
+台前幕后 3 n
+台剧 3 n
+台办 30 j
+台北 631 ns
+台北人 4 n
+台北体专 3 nt
+台北区 3 ns
+台北医学 3 nt
+台北县 33 ns
+台北县人 2 n
+台北商专 3 j
+台北工专 3 j
+台北工业 3 j
+台北市 95 ns
+台北市立 3 nt
+台北师范 3 nr
+台北师院 3 nt
+台北护专 3 n
+台北护理 3 n
+台北桥 3 ns
+台北盆地 3 ns
+台北讯 3 nt
+台北路 3 ns
+台北队 3 nt
+台区 14 ns
+台南 89 ns
+台南人 3 n
+台南县 12 ns
+台南家专 3 nt
+台南市 22 ns
+台南师范 3 nr
+台卡 2 ns
+台卡仪 3 nr
+台历 12 n
+台司勋 3 nr
+台吉 28 ns
+台后 74 s
+台启 3 nr
+台唇 3 n
+台商 130 n
+台地 369 ns
+台城 10 ns
+台基 349 ns
+台塑 3 n
+台塑集团 4 nt
+台大 213 ns
+台大医院 3 nt
+台大学生 3 n
+台奉成 2 nr
+台子 75 n
+台子上 45 ns
+台安 3 ns
+台安县 5 ns
+台尔曼 6 ns
+台尺 3 n
+台属 3 n
+台山 86 ns
+台山县 6 ns
+台山市 9 ns
+台岛 37 ns
+台州 158 ns
+台州市 40 ns
+台币 22 n
+台布 27 ns
+台希德 7 ns
+台座 10 n
+台式 97 n
+台式机 116 n
+台式机处理器 14 n
+台当局 3 n
+台德山 3 ns
+台怀镇 4 ns
+台扇 3 n
+台拉维夫 3 ns
+台数 18 n
+台斤 3 q
+台方若 2 nr
+台普济 2 n
+台服 3 n
+台木尔 2 ns
+台本 10 ns
+台机 3 n
+台板 14 n
+台架 14 n
+台柱 19 n
+台柱子 7 n
+台标 2 n
+台椅 2 n
+台榭 16 ns
+台次 15 ns
+台步 3 n
+台毯 9 n
+台江 9 ns
+台江区 3 ns
+台江县 3 ns
+台汽 3 j
+台汽客运 3 n
+台海 367 ns
+台海两岸 3 n
+台海基 2 ns
+台海开 2 ns
+台海空 2 s
+台港 3 ns
+台港澳 20 ns
+台港澳侨 4 j
+台湾 8683 ns
+台湾人 114 n
+台湾光复 3 nr
+台湾同胞 3 n
+台湾地区 142 ns
+台湾大学 57 nt
+台湾大学历史系 4 nt
+台湾岛 151 ns
+台湾师范 3 nt
+台湾当局 3 nz
+台湾成人 3 nz
+台湾日报 3 nz
+台湾歌手 3 nt
+台湾民主自治同盟 21 nt
+台湾水果 3 ns
+台湾汽车 3 nt
+台湾海基会 2 nt
+台湾海峡 193 ns
+台湾海洋 3 ns
+台湾版 3 nz
+台湾独立 3 nr
+台湾玉 3 nr
+台湾电力 3 nz
+台湾电视 3 nt
+台湾疗养 3 n
+台湾省 632 ns
+台湾省政 3 nt
+台湾省立 3 nt
+台湾神学 3 nt
+台湾籍 4 n
+台湾糖业 3 nt
+台湾网 3 nz
+台湾肥料 3 ns
+台湾航业 3 nt
+台湾艺术 3 n
+台湾街 2 ns
+台湾铝业 3 nz
+台湾银行 3 nt
+台湾队 3 nt
+台澎金马 3 nr
+台灯 67 n
+台照 3 n
+台独 397 ns
+台独分子 3 n
+台独运动 3 n
+台班 7 ns
+台球 65 n
+台球厅 3 n
+台球城 2 ns
+台球室 5 n
+台球桌 7 n
+台生子 2 n
+台甫 9 nr
+台电 3 j
+台电公司 3 nt
+台盟 28 ns
+台盟中央 4 nt
+台省 3 ns
+台秤 5 n
+台站 285 ns
+台端 3 n
+台笔 3 n
+台糖 3 n
+台糖公司 3 nt
+台统兵 2 n
+台维斯 2 ns
+台网 15 n
+台翠岩 2 nr
+台联 17 ns
+台联党 3 nt
+台肥 3 ns
+台背斜 3 n
+台胞 72 n
+台胞证 3 n
+台航 3 j
+台菜 3 n
+台菜餐厅 3 n
+台衔 3 n
+台装 3 n
+台装货 3 n
+台西 8 ns
+台视 3 j
+台视公司 3 nt
+台词 129 n
+台语 9 n
+台语歌 3 n
+台账 3 n
+台资 55 n
+台路沟乡 2 ns
+台车 9 n
+台轮 3 n
+台金 3 n
+台金学 2 nt
+台鉴 3 n
+台钟 3 n
+台钳 3 n
+台钻 3 n
+台铝 3 j
+台银 3 j
+台镜 3 n
+台长 63 n
+台门 3 ns
+台阁 28 ns
+台阁生风 3 n
+台阶 1041 n
+台阶式 7 n
+台阶覆盖 3 n
+台面 61 n
+台风 340 ns
+台风稳健 3 n
+台驾 3 n
+叱 410 v
+叱吒风云 3 v
+叱咤 27 v
+叱咤风云 52 i
+叱喝 39 v
+叱嗟风云 3 i
+叱诧风云 3 v
+叱责 7 v
+叱问 3 v
+叱骂 28 v
+史 7637 nr
+史万奎 6 nr
+史三叔 9 nr
+史三哥 9 nr
+史三馆 2 nr
+史不绝书 8 i
+史丞相 2 nr
+史严云 2 nr
+史中臣 2 nr
+史丹佛大 3 nz
+史丹利 3 nr
+史丹福 2 nr
+史为清 3 nr
+史主察 2 n
+史久镛 3 nr
+史之功 2 nr
+史之秩 2 nr
+史乘 2 nr
+史乘考 4 nr
+史乘龙 2 nr
+史书 561 n
+史事 195 n
+史二叔 2 nr
+史二爷 2 nr
+史二镖 4 nr
+史于谦 2 nr
+史五叔 6 nr
+史五哥 2 nr
+史亦称 2 nr
+史令 3 n
+史仲俊 30 nr
+史仲浚 2 nr
+史仲猛 43 nr
+史伍可 4 nr
+史传 5 nr
+史传克 16 nr
+史传小说 3 n
+史传王 16 nr
+史传篇 2 nr
+史伯威 67 nr
+史体 2 n
+史何国 2 nr
+史侯恂 4 nr
+史保林 59 nr
+史傅汉 2 nr
+史兀良 2 nr
+史元杨 2 nr
+史元道 2 nr
+史兰芽 3 nr
+史册 407 n
+史刘宗 4 nr
+史前 240 nr
+史前史 6 nr
+史前时代 3 nr
+史努比 2 nr
+史华慈 7 nr
+史占春 16 nr
+史卡利杰 6 nr
+史参奏 2 nr
+史发兵 2 nr
+史叔刚 67 nr
+史叙论 4 nr
+史可夫 3 nr
+史可查 4 nr
+史可法 353 nr
+史可程 2 nr
+史可考 5 nr
+史后纪 2 nr
+史周忱 2 nr
+史周显 4 nr
+史国公 2 nr
+史国良 6 nr
+史地 70 n
+史坚如 2 nr
+史坛 6 n
+史坦福 3 nr
+史坦顿 2 nr
+史增海 13 nr
+史大人 12 nr
+史大司马 2 nr
+史大哥 2 nr
+史大夫 3 nr
+史大妹妹 2 nr
+史大官人 7 nr
+史大桢 3 nr
+史大郎 10 nr
+史天倪 5 nr
+史天天 2 nr
+史天泽 18 nr
+史天雄 395 nr
+史太公 2 nr
+史太君 5 nr
+史奉使 2 nr
+史奴比 3 nr
+史妹妹 3 nr
+史婆婆 131 nr
+史孟捷 33 nr
+史孟麟 3 nr
+史孟龙 3 nr
+史季强 46 nr
+史学 816 n
+史学会 30 nr
+史学史 3 nr
+史学家 208 n
+史学工作者 5 n
+史学方法 3 n
+史学界 87 n
+史学观点 6 n
+史安斌 32 nr
+史宗星 3 nr
+史官 124 nr
+史实 369 nr
+史室设 2 nr
+史家 160 n
+史家兄弟 15 nr
+史家庄 7 nr
+史家村 5 nr
+史家谓 3 nr
+史宾赛 2 nr
+史密斯 206 nr
+史密松 3 nr
+史密森 13 nr
+史小燕 4 nr
+史小翠 14 nr
+史少捷 34 nr
+史尹之 3 nr
+史崇仁 3 nr
+史帮主 35 nr
+史府 4 n
+史府治 2 nr
+史异闻 2 nr
+史弘肇 9 nr
+史张孝 2 nr
+史张昭 6 nr
+史张楷 4 nr
+史张腊 2 nr
+史张鹏 2 nr
+史弥远 24 nr
+史徐道 2 nr
+史德威 2 nr
+史志 13 nr
+史志宏 8 nr
+史忠正 2 nr
+史忠萍 3 nr
+史思明 38 nr
+史抄 3 nr
+史抚治 2 nr
+史择题 3 n
+史文彬 3 nrfg
+史文恭 56 nr
+史文译 2 nr
+史料 1153 n
+史料选编 3 n
+史方 269 n
+史方静 5 nr
+史无前例 81 i
+史无明 7 nr
+史无详 2 i
+史春生 40 nr
+史景 2 n
+史景迁 36 nr
+史曹思 2 nr
+史曹永 2 nr
+史有明 6 nr
+史朔闰 2 nr
+史朝义 9 nr
+史朝宾 2 nr
+史末资 6 nr
+史权重 2 nr
+史李光 2 nr
+史李化 3 nr
+史李柏 3 nr
+史李森 2 nr
+史李沾 2 nr
+史李盛 2 nr
+史李邦 5 nr
+史来贺 2 nr
+史杨仪 6 nr
+史杨寅 2 nr
+史杨崇 3 nr
+史杨深 2 nr
+史杨维 2 nr
+史杨锐 4 nr
+史林铭 2 nr
+史树青 2 nr
+史桂堂 2 nr
+史梅国 3 nr
+史楚金 6 nr
+史正阳 3 nr
+史氏兄弟 20 nr
+史氏昆 8 nr
+史氏贤 2 nr
+史汀 2 nrt
+史汉军 4 nr
+史沫特莱 7 nr
+史治 2 n
+史泰龙 6 nr
+史济湘 2 nr
+史游 2 n
+史湘云 74 nr
+史湘云偶 2 nr
+史湘云笑 3 nr
+史源 2 n
+史潘庆 2 nr
+史火龙 50 nr
+史特劳斯 3 nr
+史玉柱 2 nr
+史王燮 2 nr
+史王瑾 2 nr
+史班勇 5 nr
+史班超 3 nr
+史瑞克 3 nr
+史瓦西 13 nr
+史界喻 2 nr
+史略 29 n
+史登达 24 nr
+史百氏 2 nr
+史碧丝 3 nr
+史秉光 7 nr
+史秉文 3 nr
+史秉直 2 nr
+史秋实 2 nr
+史称 3 nr
+史称夷 2 nr
+史称孝 3 nr
+史称崇 2 nr
+史称庆 2 nr
+史称申 3 nr
+史称皇 5 nr
+史称贞 3 nr
+史称顺 2 nr
+史稽察 2 nr
+史稿 3 n
+史籍 259 n
+史索班 2 nr
+史红石 9 nr
+史红艳 11 nr
+史纲 25 nr
+史经世 2 nr
+史维华 4 nr
+史美泗 2 nr
+史老三 2 nr
+史老大 2 nr
+史考异 3 nr
+史考特 2 nr
+史者 3 n
+史臣 7 nr
+史臣论 6 nr
+史良娣 4 nr
+史莱克 2 nr
+史莱姆 3 nr
+史萧淮 2 nr
+史葛守 8 nr
+史葛诚 2 nr
+史董元 3 nr
+史蒂夫 95 nr
+史蒂文 10 nr
+史蒂文斯 6 nr
+史蒂文森 3 nr
+史蒂芬 28 nr
+史蒋式 3 nr
+史蔡启 2 nr
+史薛璋 2 nr
+史行 7 n
+史袁世 4 nr
+史见服 2 nr
+史观 29 n
+史言官 3 nr
+史记 554 n
+史记卷 3 nr
+史论 90 n
+史论家 3 n
+史评 11 nr
+史识 2 n
+史诗 523 nr
+史诗作者 3 n
+史诗剧 9 n
+史诗式 5 nr
+史诗性 14 nr
+史诗片 3 nr
+史话 22 n
+史语 4 nr
+史语所 3 n
+史贵知 2 nr
+史赵启 4 nr
+史赵评 2 nr
+史载 5 nr
+史载唐 2 nr
+史载秦 4 nr
+史载舜 2 nr
+史达林 3 nr
+史达祖 3 nr
+史迁普 5 nr
+史迁殿 3 nr
+史进引 2 nr
+史迪威 45 nr
+史述论 4 nr
+史迹 93 n
+史道邻 58 nr
+史遗规 2 nr
+史郑二 2 nr
+史部 19 n
+史郭维 2 nr
+史都华 3 nr
+史酷比 3 n
+史重史 2 nr
+史重平 2 nr
+史量 2 n
+史金波 18 nr
+史铁生 2 nr
+史镖头 31 vn
+史阁部 5 nr
+史陈九 3 nr
+史陈婴 3 nr
+史陈敬 2 nr
+史陈明 2 nr
+史陈瓒 2 nr
+史隆飞 2 nr
+史雷士 2 nr
+史静寰 7 i
+史馆 3 n
+史高捷 2 nr
+史高攀 4 nr
+史魏裔 2 nr
+史黄宗 2 nr
+史黄桂 2 nr
+史黄立 2 nr
+右 9451 f
+右上 14 f
+右上图 2 n
+右上方 16 f
+右上角 29 f
+右下 8 f
+右下方 14 f
+右下角 31 f
+右丞相 151 n
+右中前卫 3 ns
+右中后卫 3 n
+右乘环 3 n
+右书僮 3 n
+右乳 3 n
+右云 3 n
+右云县 3 ns
+右佥都御史 35 n
+右侍郎 3 n
+右侧 622 f
+右倾 655 b
+右倾分子 3 n
+右倾化 2 n
+右倾机会 3 n
+右军 3 n
+右军习气 3 n
+右击 13 b
+右列环 3 n
+右券 3 n
+右前 16 f
+右前卫 6 n
+右前方 22 f
+右前锋 3 n
+右半 13 f
+右半块 3 n
+右半球 3 n
+右半部 3 n
+右卫 38 n
+右后 13 f
+右后卫 3 n
+右后方 3 f
+右图 11 n
+右声道 3 n
+右安门 9 ns
+右室 5 n
+右导数 3 n
+右小腿 3 n
+右岸 181 f
+右幺元 3 v
+右序模 3 n
+右归丸 8 n
+右心室 3 n
+右心房 3 n
+右手 3450 n
+右手定则 3 n
+右手掌 3 n
+右手画圆 4 n
+右手边 3 n
+右拳 3 n
+右掌 452 n
+右摇杆 3 b
+右方 41 f
+右旋 3 n
+右旋晶体 3 n
+右旋糖酐 6 n
+右旗 34 n
+右江 64 ns
+右江区 3 ns
+右江河谷 2 ns
+右派 796 n
+右派分子 3 n
+右玉 9 n
+右玉县 6 ns
+右白虎 3 n
+右眉 3 n
+右眼 116 n
+右矢 3 n
+右移 7 n
+右端 3 f
+右翦左屠 3 nr
+右翼 474 n
+右翼中旗 3 ns
+右翼前旗 3 ns
+右翼后旗 3 n
+右耳 52 n
+右肋 3 n
+右肘 32 n
+右肩 3 n
+右肺 8 n
+右肾 3 n
+右脑 8 n
+右脚 221 n
+右腕 112 n
+右腿 331 n
+右腿骨 3 n
+右膝 3 n
+右膝盖 3 vn
+右臂 559 n
+右舷 24 n
+右行 3 n
+右衽 11 n
+右角 3 n
+右诺特环 3 ns
+右路 154 n
+右转 3 n
+右边 672 f
+右边前卫 6 ns
+右边后卫 3 n
+右边锋 4 n
+右都御史 42 n
+右钩拳 3 n
+右锋 3 n
+右键 3 n
+右阿廷环 3 ns
+右零因子 3 n
+右面 38 f
+右颊 3 n
+右首 3 n
+叴 52 zg
+叵 142 v
+叵测 14 v
+叵测之心 3 v
+叵耐 49 v
+叶 4617 nr
+叶三姐 10 nr
+叶三娘 4 nr
+叶下珠 2 nr
+叶世荣 3 nr
+叶丛 9 nr
+叶丛生 2 nr
+叶丽仪 3 nr
+叶乔木 2 nr
+叶乔波 5 nr
+叶二娘 210 nr
+叶云杉 2 nr
+叶亦心 57 nr
+叶仙忽 2 nr
+叶仙笑 2 nr
+叶代焉 3 nr
+叶企孙 3 nr
+叶传萍 46 nr
+叶体 14 n
+叶佩斯 2 nr
+叶佩英 2 nr
+叶佩雯 3 nr
+叶倩文 5 nr
+叶倾城 3 nr
+叶儿 9 nr
+叶先生 3 nr
+叶光庭 3 nr
+叶克勇 3 nr
+叶全真 3 nr
+叶公 2 nr
+叶公好龙 3 nr
+叶公琦 2 nr
+叶公超 7 nr
+叶兰 3 nr
+叶凯士 10 nr
+叶利钦 163 nr
+叶制器 4 n
+叶剑英 445 nr
+叶占雄 2 nr
+叶卡捷 60 nr
+叶卡捷琳堡 17 nr
+叶卡捷琳娜 5 nr
+叶卵圆 2 nr
+叶卵形 2 n
+叶卵状 2 nr
+叶原基 5 nr
+叶县 74 ns
+叶变叶 2 nr
+叶吉格 2 nr
+叶名琛 7 nr
+叶向高 48 nr
+叶君健 259 nr
+叶和根 2 nr
+叶和真 2 nr
+叶和芽 2 nr
+叶和茎 2 nr
+叶和鞍 2 nr
+叶哗哗 2 nr
+叶啸天 97 nr
+叶嘉莹 2 nr
+叶四仙 2 nr
+叶圣陶 35 nr
+叶均可 2 nr
+叶坚颖 2 nr
+叶型 2 n
+叶城 16 nr
+叶城今 2 nr
+叶城县 3 ns
+叶城至 2 nr
+叶基常 2 nr
+叶基生 5 nr
+叶基部 4 nr
+叶塞宁 3 nr
+叶大鹰 896 nr
+叶天士 15 nr
+叶天星 2 nr
+叶天龙 3 nr
+叶如棠 256 nr
+叶子 1205 nr
+叶子奇 3 nr
+叶子媚 3 nr
+叶子楣 3 nr
+叶子烟 3 nr
+叶子花 3 nr
+叶子龙 4 nr
+叶孔目 8 nr
+叶学齐 2 nr
+叶宗留 26 nr
+叶宪祖 4 nr
+叶家 68 n
+叶家集 10 nr
+叶容顺 14 nr
+叶密立 17 nr
+叶密里 2 nr
+叶对生 4 nr
+叶尊者 3 nr
+叶小君 6 nr
+叶小文 7 nr
+叶尔万德 2 nr
+叶尔姆斯 5 nr
+叶尔布 2 nr
+叶尔玛 4 nr
+叶尔绍夫 2 nr
+叶尔羌 66 nr
+叶尔羌河 37 ns
+叶尔莫洛 5 nrt
+叶尔马克 24 nrt
+叶尼克 2 nr
+叶尼基河 3 ns
+叶尼塞 22 nr
+叶尼塞河 67 ns
+叶布舒 3 nr
+叶希八 2 nr
+叶常绿 4 nr
+叶序 5 n
+叶廷秀 16 nr
+叶廷芳 2 nr
+叶开泰 2 nr
+叶开道 3 nr
+叶引唐 2 nr
+叶弗列 5 nr
+叶张根 5 nr
+叶德娴 3 nr
+叶德辉 3 nr
+叶心 4 n
+叶志新 2 nr
+叶志清 46 nr
+叶志超 15 nr
+叶志连 11 nr
+叶怡兰 4 nr
+叶性 2 n
+叶恭绰 5 nr
+叶惠美 3 nr
+叶惠贤 3 nr
+叶成朵 2 nr
+叶护可汗 4 nr
+叶挺 190 nr
+叶挺部 2 nr
+叶挻 3 nz
+叶掌状 2 nr
+叶文辉 3 nr
+叶斑 3 n
+叶斑病 18 n
+叶斗峰 3 nr
+叶方杉 2 nr
+叶方霭 18 nr
+叶无柄 3 nr
+叶昊天 3 nr
+叶明强 2 nr
+叶明洲 3 nr
+叶星林 3 nr
+叶星雨 3 nr
+叶春善 6 nr
+叶春平 3 nr
+叶显恩 2 nr
+叶晓彦 2 nr
+叶普多基莫娃 3 nrt
+叶景奎 55 nr
+叶景林 58 nr
+叶木属 2 nr
+叶枕 3 nr
+叶林娜 3 nr
+叶枝 6 nr
+叶枯病 3 n
+叶柄 123 nr
+叶树科 3 nr
+叶树茵 3 nr
+叶梗 3 n
+叶梦得 5 nr
+叶梦熊 2 nr
+叶楚伦 3 nr
+叶楚伧 3 nrfg
+叶榆县 2 nr
+叶榆泽 2 nr
+叶水夫 3 nr
+叶水青 3 nr
+叶永安 7 nr
+叶永烈 4 nr
+叶永笔 2 nr
+叶江川 46 nr
+叶河房 16 nr
+叶波一世 2 nr
+叶泰安 14 nr
+叶泽云 25 nr
+叶浅予 32 nr
+叶浩吾 2 nr
+叶海亚 18 nr
+叶海峰 256 nr
+叶清入 2 nr
+叶清同 2 nr
+叶清拜 2 nr
+叶清望 2 nr
+叶渚沛 2 nr
+叶灯 12 n
+叶片 469 n
+叶片泵 3 nz
+叶状 15 n
+叶状体 22 n
+叶状枝 3 nr
+叶状苞 3 nr
+叶状茎 2 nr
+叶猴 35 nr
+叶玉卿 3 nr
+叶球 7 n
+叶琢堂 2 nr
+叶琳娜 2 nr
+叶甜菜 3 nr
+叶甫盖 18 nr
+叶甲属 4 nr
+叶甲科 2 nr
+叶瘤 2 n
+叶瘦花残 3 i
+叶盛兰 8 nr
+叶盛章 3 nr
+叶石栎 2 nr
+叶碧秋 370 nr
+叶祖奎 2 nr
+叶秀山 4 nr
+叶秀峰 3 nr
+叶窗 3 n
+叶立培 13 nr
+叶立德 7 nr
+叶立梅 5 nr
+叶立钦 4 nr
+叶笃初 6 nr
+叶笃正 7 nr
+叶类 3 n
+叶红素 3 nr
+叶红雨 6 nr
+叶绍钧 4 nr
+叶绿体 129 nr
+叶绿素 128 nr
+叶绿莲 2 nr
+叶羽状 2 nr
+叶翠翠 3 nr
+叶耀宇 2 nr
+叶老汉 2 nr
+叶肉 34 n
+叶脉 51 nr
+叶脤 3 nz
+叶腋 68 n
+叶自茎 2 nr
+叶至善 4 nr
+叶舌 16 n
+叶舒宪 2 nr
+叶良辅 2 nr
+叶色 4 n
+叶芝 3 nrt
+叶芽 12 nr
+叶芽儿 3 nr
+叶苔草 3 nr
+叶茂 8 nr
+叶茂中 3 nr
+叶茎 2 nr
+叶草 3 nr
+叶草科 2 nr
+叶荣泗 10 nr
+叶荣顺 7 nr
+叶莲子 839 nr
+叶莲美 9 nr
+叶菊 5 nr
+叶菜类 2 n
+叶落 2 n
+叶落归根 10 nr
+叶落知秋 3 nr
+叶蕴仪 3 nr
+叶藻科 2 nr
+叶藻苔 2 nr
+叶虞候 2 nr
+叶蜂 26 nr
+叶蜡石 41 n
+叶蝉 11 nr
+叶蝉科 2 nr
+叶诚万 4 nr
+叶象科 2 nr
+叶赛宁 9 nr
+叶赫那拉 10 nrt
+叶赫部 14 nr
+叶轮 46 n
+叶轮式 8 n
+叶连娜 9 nr
+叶连松 8 nr
+叶选平 14 nr
+叶酸 116 n
+叶酸片 3 n
+叶针 3 n
+叶钊颖 44 nr
+叶铁桥 2 nr
+叶铜矛 2 nr
+叶锈病 2 n
+叶镇城 2 nr
+叶长于 2 nr
+叶长青 5 nr
+叶门 3 nr
+叶防己 2 nr
+叶附生 2 nr
+叶雪安 2 nr
+叶震环 2 nr
+叶青谷 2 nr
+叶面 47 n
+叶面施肥 3 nr
+叶面积 17 n
+叶面肥 3 n
+叶革质 5 n
+叶鞘 53 n
+叶音 3 n
+叶韵 6 nr
+叶黄杨 3 nr
+叶黄素 26 nr
+叶齐德 3 nr
+叶龙斌 2 nr
+号 44621 m
+号丧 3 v
+号令 824 n
+号令如山 3 l
+号兵 16 n
+号叫 43 v
+号召 1825 v
+号召书 2 n
+号召力 78 n
+号咷大哭 3 v
+号哭 54 v
+号啕 22 v
+号啕大哭 57 l
+号型 26 n
+号声 24 n
+号天扣地 3 l
+号子 80 n
+号子声 13 n
+号寒啼饥 3 l
+号徽 3 n
+号志 3 n
+号志灯 3 n
+号房 21 n
+号手 25 n
+号数 19 n
+号旗 3 n
+号段 55 n
+号淘大哭 3 l
+号源 3 n
+号炮 48 n
+号牌 29 n
+号码 980 n
+号码机 3 n
+号码灯 3 n
+号码牌 3 n
+号称 1936 v
+号笛 3 n
+号筒 131 n
+号脉 8 n
+号衣 57 n
+号角 325 n
+号角声 53 n
+号音 3 n
+司 5271 nr
+司一正 16 nr
+司一秘 4 nr
+司一职 2 nr
+司三秘 12 nr
+司业 3 n
+司乃祖 2 nr
+司之议 2 nr
+司乘人员 2 n
+司书 3 n
+司二秘 8 nr
+司仙吏 2 nr
+司令 2511 n
+司令台 3 n
+司令员 1307 n
+司令官 162 nr
+司令部 1806 n
+司仪 29 nr
+司兵甲 2 nr
+司其钥 2 nr
+司农仰屋 3 n
+司农卿 7 nr
+司农司 17 nt
+司农寺 4 nr
+司农赋 2 nr
+司则合 2 nr
+司判官 2 n
+司利达 16 nr
+司务 26 n
+司务厅 6 nt
+司务官 5 n
+司务小 2 n
+司务纪 3 n
+司务长 30 n
+司南 39 nr
+司卢镗 3 nr
+司卫所 3 n
+司可巴 2 nr
+司右军 3 nr
+司号 3 n
+司号员 5 n
+司各特 10 nr
+司各脱 3 nr
+司同知 7 nr
+司吏 2 n
+司吏目 2 nr
+司员 4 n
+司命 3 n
+司和考 2 nr
+司和行 2 nr
+司售 3 v
+司售人员 3 n
+司坊官 4 nr
+司城子 3 nr
+司城氏 2 nr
+司堂官 2 nr
+司塔斯弗 3 nr
+司增勤 10 nr
+司夜巡 2 nr
+司天之 2 nr
+司天台 3 nr
+司天太监 3 nr
+司天监 6 nr
+司天秘 2 nr
+司天鱼 4 nr
+司奇计 2 nr
+司始设 2 nr
+司官 8 n
+司宣慰 2 nr
+司宪中 2 nr
+司密斯 2 nr
+司寇 44 n
+司寇下 2 nr
+司寇或 3 nr
+司寨村 3 nr
+司少卿 3 nr
+司局 42 n
+司局级 21 n
+司局长 2 n
+司州领 2 nr
+司库 46 n
+司库员 16 n
+司府制 2 nr
+司府厅 2 nr
+司建官 2 nr
+司彦文 4 nr
+司徒 229 n
+司徒乔 4 nr
+司徒伯雷 34 nr
+司徒前帮 3 nr
+司徒千钟 33 nr
+司徒华 11 nr
+司徒华赫 3 nr
+司徒大哥 11 nr
+司徒少侠 5 nr
+司徒尚纪 46 nr
+司徒崔浩 4 nr
+司徒帮主 27 nr
+司徒府 3 nr
+司徒慧敏 5 nr
+司徒普 4 nr
+司徒横 4 nr
+司徒氏 3 nr
+司徒王允 6 nr
+司徒王寻 4 nr
+司徒王朗 3 nr
+司徒美堂 6 nr
+司徒老儿 3 nr
+司徒逸民 2 nr
+司徒雷 5 nr
+司徒雷登 13 nr
+司徒鹤 25 nr
+司徒鹤站 2 nr
+司御史 2 nr
+司户佐 3 nr
+司户参 3 nr
+司户曹 2 nr
+司拉绪 176 nr
+司掌 8 n
+司提举 5 nr
+司晨 2 nr
+司机 1455 n
+司机员 3 n
+司棋因 2 nr
+司正堂 2 nr
+司母戊 6 nr
+司母辛 3 nr
+司汤达 9 nr
+司法 2527 n
+司法人员 3 n
+司法会计 3 n
+司法公正 3 nr
+司法制度 3 n
+司法厅 7 nr
+司法员 3 n
+司法官 4 nr
+司法官员 9 n
+司法宫 3 nr
+司法局 9 nt
+司法机关 3 n
+司法权 46 nr
+司法案例 3 n
+司法独立 3 nr
+司法界 9 n
+司法程序 3 n
+司法考试 3 n
+司法腐败 3 n
+司法解释 3 n
+司法警察 3 n
+司法部 312 nt
+司法部长 49 n
+司法部门 45 n
+司法鉴定 3 nr
+司法院 3 nt
+司法院长 3 n
+司洛夫 2 nr
+司炉 23 n
+司炉工 3 n
+司理 3 n
+司盐校 2 nr
+司盐监 4 nr
+司盐运 3 nr
+司真定 2 nr
+司礼太监 31 nr
+司礼监 403 nr
+司礼韩 2 nr
+司祭 8 nr
+司空 308 n
+司空玄 3 nr
+司空见惯 99 n
+司章奏 2 nr
+司约翰 2 nr
+司线员 5 n
+司署 3 n
+司考中 3 nr
+司考考 3 nr
+司职 23 n
+司职掌 16 nr
+司职田 2 nr
+司药 3 n
+司行方 7 n
+司赞女 5 nr
+司赫德 9 nr
+司输纳 2 nr
+司达鲁 2 nr
+司迎宾 2 nr
+司运 2 n
+司通政 4 nr
+司道属 2 nr
+司郎官 4 nr
+司金登 2 nr
+司钻房 3 nr
+司铎 2 nr
+司铎主 2 nr
+司长 788 n
+司长级 3 n
+司门前镇 3 nr
+司问谳 2 nr
+司陶特 2 nr
+司隶 2 n
+司隶校 61 n
+司隶部 3 n
+司马 669 nr
+司马义 268 nr
+司马仲达 4 nr
+司马伦 24 nr
+司马元显 6 nr
+司马光 138 nr
+司马光任 2 nr
+司马光死 2 nr
+司马光著 3 nr
+司马公 4 nr
+司马南 3 nr
+司马卫 21 nr
+司马召 2 nr
+司马台 2 nr
+司马台长城 7 ns
+司马大 3 nr
+司马子伯 2 nr
+司马孚 2 nr
+司马岛主 3 nr
+司马岩 2 nr
+司马师 25 nr
+司马师东 3 nr
+司马师妻 2 nr
+司马师引 2 nr
+司马康 3 nr
+司马彪 3 nr
+司马德 5 nr
+司马德操 3 nr
+司马徽 3 nr
+司马懿 255 nr
+司马懿克 2 nr
+司马懿入 7 nr
+司马懿兵 2 nr
+司马懿功 2 nr
+司马懿善 3 nr
+司马懿奏 3 nr
+司马懿引 12 nr
+司马懿攻 2 nr
+司马懿料 3 nr
+司马懿留 2 nr
+司马懿知 2 nr
+司马懿营 2 nr
+司马懿见 3 nr
+司马懿谏 2 nr
+司马懿谓 3 nr
+司马懿闻 2 nr
+司马或 2 nr
+司马承祯 6 nr
+司马昭 97 nr
+司马昭之 2 nr
+司马昭之心 7 i
+司马昭兵 2 nr
+司马昭欲 3 nr
+司马昭闻 2 nr
+司马曜 5 nr
+司马望 7 nr
+司马林 83 nr
+司马林冷 3 nr
+司马林见 2 nr
+司马柬 2 nr
+司马楚之 4 nr
+司马欣 3 nr
+司马歆 4 nr
+司马歆派 2 nr
+司马氏 62 nr
+司马氏家族 2 nr
+司马法 2 nr
+司马炎 55 nr
+司马炎代 2 nr
+司马炎女 3 nr
+司马炎谋 3 nr
+司马炽 9 nr
+司马猎律 2 nr
+司马王甫 2 nr
+司马玮 8 nr
+司马班超 5 nr
+司马相公 2 nr
+司马相如 47 nr
+司马称好 3 nr
+司马腾 2 nr
+司马臧 2 nr
+司马范骅 3 nr
+司马衍 3 nr
+司马覃 4 nr
+司马越 3 nr
+司马越弟 2 nr
+司马迁 185 nr
+司马迁祠 2 nr
+司马道子 9 nr
+司马邺 6 nr
+司马邺讳 5 nr
+司马金龙 3 nr
+司马错 6 nr
+司马隽 2 nr
+司马青衫 3 nr
+司马颖 21 nr
+司马鲁 2 nr
+司鼎立 2 nr
+司鼓 2 n
+司龙神 3 nr
+叹 4144 zg
+叹一口气 3 i
+叹为观止 92 i
+叹伤 3 v
+叹口气 3 i
+叹号 3 v
+叹声 3 v
+叹息 998 v
+叹息声 3 i
+叹惋 6 v
+叹惜 15 v
+叹服 85 v
+叹气 313 v
+叹气声 4 i
+叹绝 3 v
+叹羡 3 v
+叹老嗟卑 3 i
+叹观止矣 3 i
+叹词 3 v
+叹赏 14 v
+叹道 3 v
+叺 210 zg
+叻 49 g
+叼 216 zg
+叽 109 zg
+叽叽 74 o
+叽叽咕咕 3 o
+叽叽唧唧 3 o
+叽叽喳喳 66 o
+叽叽嘎嘎 6 o
+叽咕 15 o
+叽哩咕噜 100 l
+叽喳 3 o
+叽喳不断 3 vn
+叽里呱啦 3 o
+叽里咕噜 6 o
+叽驾 3 v
+叾 184 zg
+叿 39 zg
+吀 18 zg
+吁 319 vg
+吁叹 3 v
+吁吁 3 v
+吁咈都俞 3 nr
+吁天呼地 3 v
+吁气 3 v
+吁求 3 v
+吁请 26 v
+吂 20 zg
+吃 36799 v
+吃一堑 13 l
+吃一堑长一智 7 i
+吃上官司 3 l
+吃不上 3 l
+吃不下 3 l
+吃不了兜着走 46 l
+吃不住 18 v
+吃不准 3 v
+吃不出 3 v
+吃不出来 3 l
+吃不完 3 v
+吃不开 3 v
+吃不得 38 v
+吃不服 3 l
+吃不来 2 l
+吃不消 88 l
+吃不胖 3 a
+吃不起 26 v
+吃不透 3 l
+吃不饱 3 l
+吃不香 3 v
+吃了亏 3 l
+吃了饭 3 l
+吃亏 282 v
+吃亏上当 6 l
+吃人不吐骨头 4 i
+吃人口软 3 i
+吃人肉 3 l
+吃住 3 v
+吃住行 10 v
+吃偏食 3 l
+吃偏饭 3 l
+吃光 47 v
+吃公攒私 3 l
+吃准 4 v
+吃出 3 v
+吃到 3 v
+吃剩 3 v
+吃力 172 n
+吃力不讨好 15 l
+吃劲 4 a
+吃劳保 3 l
+吃卡 3 v
+吃吃喝喝 23 l
+吃吃饭 6 l
+吃后悔药 8 l
+吃哑巴亏 3 l
+吃喜糖 3 n
+吃喝 317 v
+吃喝嫖赌 28 l
+吃喝拉撒 3 n
+吃喝玩乐 62 i
+吃喝风 4 l
+吃回扣 4 l
+吃大亏 60 l
+吃大便 3 l
+吃大户 9 l
+吃大锅饭 14 l
+吃奶 3 n
+吃好饭 3 l
+吃子 3 n
+吃完饭 3 l
+吃官司 16 l
+吃定 3 v
+吃客 3 v
+吃宵夜 3 i
+吃小灶 3 l
+吃尽苦头 3 l
+吃屎 3 v
+吃幅千里 3 l
+吃干饭 15 l
+吃得下 22 l
+吃得了 3 l
+吃得住 4 v
+吃得出 3 v
+吃得出来 3 l
+吃得完 3 v
+吃得开 9 v
+吃得来 3 l
+吃得消 11 l
+吃得起 3 v
+吃得饱 3 l
+吃快餐 3 l
+吃惊 942 a
+吃惊受怕 3 i
+吃成 3 v
+吃拿卡要 3 l
+吃掉 323 v
+吃斋 43 v
+吃斋念佛 3 l
+吃晚饭 3 l
+吃本 3 a
+吃来 3 v
+吃来吃去 3 l
+吃水 184 v
+吃水果 3 n
+吃水标尺 3 l
+吃水线 6 l
+吃水量 3 l
+吃水难 3 l
+吃法 559 v
+吃法呢 3 n
+吃派饭 7 l
+吃海鲜 3 i
+吃火锅 3 l
+吃独食 6 i
+吃玩 3 v
+吃现成 4 l
+吃现成饭 3 l
+吃瓦片儿 3 l
+吃白食 20 n
+吃白饭 8 l
+吃皇粮 3 n
+吃盐 3 n
+吃眼前亏 3 l
+吃着不尽 3 l
+吃睡 5 v
+吃硬不吃软 3 i
+吃空额 23 n
+吃穿住行 3 l
+吃穿用度 3 l
+吃粉笔灰 3 i
+吃粮 3 v
+吃糖 3 v
+吃糠咽菜 3 v
+吃素 31 n
+吃紧 133 v
+吃罪 3 v
+吃罪不起 3 l
+吃老本 8 l
+吃腻 3 a
+吃苦 246 a
+吃苦在前 3 i
+吃苦头 23 l
+吃苦耐劳 62 i
+吃荤 41 v
+吃药 235 v
+吃药前 3 l
+吃药后 3 l
+吃药时 3 n
+吃螃蟹 3 v
+吃衣著饭 3 n
+吃请 32 v
+吃豆乾 3 i
+吃豆腐 10 l
+吃豆豆 3 n
+吃败仗 35 l
+吃货 3 n
+吃起 3 v
+吃起饭来 3 l
+吃软 3 a
+吃软不吃 3 l
+吃软不吃硬 6 i
+吃软饭 3 l
+吃过饭 3 l
+吃透 45 v
+吃酒 304 v
+吃醋 94 v
+吃里扒外 20 i
+吃里爬外 3 l
+吃重 5 a
+吃锅 3 v
+吃错 3 a
+吃错药 3 l
+吃长斋 2 n
+吃闭门羹 3 n
+吃闲饭 20 l
+吃零嘴 3 l
+吃零食 3 i
+吃食 115 v
+吃饭 3082 v
+吃饭时间 3 l
+吃饭钱 3 l
+吃饭问题 3 l
+吃饭防噎 3 i
+吃饱 3 v
+吃饱喝足 3 i
+吃饱穿暖 3 i
+吃饺子 3 v
+吃馆子 10 n
+吃香 100 v
+吃香喝辣 7 l
+吃香的喝辣的 10 l
+吃鸭蛋 3 n
+各 44807 r
+各上去 3 l
+各上来 3 l
+各不相同 3 l
+各不相让 13 l
+各不相谋 3 i
+各业 56 r
+各个 6029 r
+各个击破 185 l
+各个单位 3 l
+各个方面 3 l
+各个环节 3 l
+各个系统 3 l
+各个部门 3 l
+各个领域 3 l
+各为其主 23 i
+各举 3 r
+各乡 13 r
+各乡镇 3 ns
+各享 3 v
+各人 1727 r
+各人自扫门前雪 6 i
+各从其志 3 i
+各从其类 3 i
+各从其走 3 l
+各位 2010 r
+各位朋友 3 l
+各例 3 l
+各党 65 r
+各党派 3 l
+各兵种 3 l
+各具特色 254 l
+各养 3 v
+各军兵种 3 l
+各军区 3 l
+各减 3 v
+各凭本事 3 l
+各分部 3 v
+各创 3 v
+各创一格 3 l
+各别 474 a
+各削 3 a
+各剩 3 l
+各剪 3 v
+各区 131 r
+各半 26 v
+各单项 3 b
+各印 3 v
+各卷 41 r
+各厂 20 r
+各厅 3 ns
+各厢 3 i
+各县 253 r
+各县区 3 ns
+各县市 3 ns
+各取所长 3 i
+各取所需 31 l
+各口岸 3 i
+各司其事 3 i
+各司其职 296 i
+各吊 3 v
+各向同性 49 l
+各向异性 70 l
+各吸 3 l
+各唸 3 z
+各器官 3 l
+各回合 3 l
+各团 3 r
+各园 3 r
+各国 5912 r
+各地 7252 r
+各地党委 3 l
+各地风俗 3 i
+各场 3 r
+各型 320 r
+各型各式 3 l
+各填 3 v
+各处 771 r
+各处室 3 i
+各大军区 3 l
+各大报 3 l
+各奏 3 v
+各奔东西 18 ns
+各奔前程 11 l
+各如其人 3 l
+各如其面 3 l
+各委办 3 l
+各季 3 r
+各学科 3 l
+各安生业 3 l
+各安职守 3 i
+各家 1065 r
+各家各户 306 l
+各寄 3 v
+各就各位 34 l
+各尽其 3 i
+各尽其妙 3 i
+各尽其责 5 l
+各尽所能 29 i
+各局 3 r
+各层次 3 l
+各展所长 3 l
+各岛屿 3 ns
+各州 542 r
+各工种 3 l
+各巷 3 l
+各币种 3 l
+各市 870 r
+各市区 3 l
+各市县 3 ns
+各市地 3 l
+各帮派 3 l
+各年 3 r
+各年次 3 l
+各年级 3 l
+各庄 13 r
+各庄镇 3 ns
+各床 3 v
+各延 3 v
+各异 413 a
+各式 218 r
+各式各样 253 l
+各形各色 3 l
+各得其宜 3 i
+各得其所 83 i
+各忙各 3 l
+各念 3 v
+各怀鬼胎 3 l
+各总部 3 ns
+各截 3 v
+各户 65 r
+各执一端 4 i
+各执一词 43 i
+各执己见 3 i
+各抒 3 i
+各抒己见 46 i
+各抒已见 3 i
+各抒所见 3 i
+各投其好 3 l
+各报 29 r
+各拉丹冬雪山 5 ns
+各拨 3 v
+各持己见 9 i
+各挤 3 a
+各捡 3 v
+各排 3 v
+各揍 3 v
+各搬 3 v
+各搭 3 z
+各携 3 b
+各摇 3 l
+各摊 3 l
+各播 3 l
+各擅胜场 3 nz
+各支部 3 ns
+各政党 3 i
+各敷 3 v
+各方 794 r
+各方对 3 l
+各方瞩目 3 l
+各施 3 v
+各族 1529 r
+各族人民 3 l
+各族群众 3 l
+各显其能 10 i
+各显神通 26 l
+各显身手 3 l
+各有不同 3 l
+各有利弊 13 i
+各有千秋 31 i
+各有所好 5 l
+各有所得 3 l
+各有所爱 3 l
+各有所短 3 i
+各有所职 3 l
+各有所见 3 l
+各有所长 64 i
+各有特点 3 l
+各有特色 3 l
+各有胜负 3 l
+各有输赢 3 v
+各服 3 a
+各期 3 r
+各期刊 3 v
+各机 5 r
+各村 106 r
+各条 289 r
+各条战线 3 l
+各栏 3 r
+各校 1217 r
+各样 47 r
+各梳 3 b
+各棒 3 a
+各楼层 3 l
+各榜 3 v
+各次 3 r
+各款 13 r
+各段 63 r
+各段落 3 l
+各沿 3 ns
+各泼 3 a
+各洗 3 v
+各派 811 r
+各添 3 v
+各湖泊 3 ns
+各演 3 v
+各版 3 r
+各版面 3 l
+各牵 3 v
+各献其能 3 i
+各玩 3 a
+各班次 3 l
+各班级 3 l
+各界 1695 r
+各界人士 3 l
+各盒 3 r
+各盟 3 l
+各盟邦 3 i
+各直属 3 l
+各省 2345 r
+各省县 3 ns
+各省市 3 ns
+各矿 3 r
+各社 3 r
+各种 22183 r
+各种各样 726 l
+各种因素 3 l
+各种渠道 3 i
+各种类型 3 l
+各种规格 3 l
+各科 143 r
+各立门户 3 i
+各站 41 r
+各章 33 r
+各签 3 l
+各箱 3 v
+各类 3682 r
+各粒 3 v
+各系 34 r
+各系所 3 l
+各级 19839 r
+各级党委 3 l
+各线路 3 l
+各组 74 r
+各罚 3 v
+各考点 3 l
+各自 4330 r
+各自为战 51 i
+各自为政 40 i
+各色 283 r
+各色人等 44 l
+各色各样 17 l
+各色名样 3 l
+各行 100 r
+各行其事 8 i
+各行其志 3 i
+各行其是 69 l
+各行其道 3 i
+各行各业 178 l
+各街道 3 l
+各试 3 v
+各说各话 3 l
+各课 3 v
+各谋 3 l
+各谋出路 3 i
+各谋生路 3 l
+各负其责 18 l
+各赏 3 v
+各赛区 3 l
+各路 756 r
+各路人马 3 l
+各踢 3 i
+各车 3 r
+各车厢 3 i
+各车次 3 i
+各辑 3 l
+各输 3 l
+各邀 3 v
+各部 2808 r
+各部委 3 v
+各里 3 r
+各钓 3 v
+各键 3 b
+各镇 39 r
+各门 337 r
+各门派 3 r
+各闯 3 v
+各间 3 r
+各队 129 r
+各阶 3 i
+各阶层 3 l
+各附 3 v
+各院 3 r
+各院校 3 l
+各院系 3 l
+各随其好 3 l
+各音 3 l
+各项 4798 r
+各项事业 3 l
+各项任务 3 l
+各项措施 3 vn
+各项改革 3 l
+各项政策 3 l
+各项规定 3 l
+各领风骚 3 l
+各餐 3 r
+吅 3 zg
+吆 158 v
+吆五喝六 15 l
+吆呼 3 v
+吆喊 3 v
+吆喝 621 v
+吆喝声 46 l
+吇 52 zg
+合 9453 v
+合一 422 vn
+合一部件 3 l
+合上 3 v
+合不拢嘴 40 l
+合不来 4 v
+合不着 3 v
+合两为一 3 l
+合丰 3 ns
+合为 198 v
+合为一体 3 l
+合久必分 8 l
+合乎 1183 v
+合乎情理 3 l
+合乎规律 3 l
+合乎逻辑 3 l
+合二为一 172 l
+合二而一 9 l
+合于 3 v
+合从连衡 3 i
+合付 3 vn
+合众 28 n
+合众国 46 ns
+合众社 10 nt
+合伙 250 n
+合伙人 145 n
+合伙制 2 n
+合会 3 n
+合住 23 v
+合体 167 n
+合体技 3 n
+合作 13478 vn
+合作主义 3 n
+合作伙伴 7 n
+合作制 9 n
+合作化 128 n
+合作医疗 74 n
+合作厅 2 n
+合作商店 3 n
+合作型 3 n
+合作局 6 n
+合作开发 3 l
+合作性 6 n
+合作愉快 3 z
+合作意向 3 n
+合作方 44 n
+合作无间 3 l
+合作现象 3 n
+合作社 379 l
+合作经营 3 l
+合作网 5 n
+合作者 50 n
+合作部 4 n
+合作金库 3 n
+合作镇 5 n
+合作项目 3 n
+合借 3 v
+合做 3 v
+合共 15 b
+合兴 266 a
+合养 3 v
+合写 49 v
+合冲 3 vn
+合出 3 v
+合击 37 vn
+合刊 10 n
+合则两利 3 l
+合到 3 v
+合剂 54 n
+合力 562 n
+合力偶 3 n
+合办 128 v
+合十 300 v
+合卺 20 v
+合发 3 v
+合取 3 v
+合取范式 9 n
+合口 3 vn
+合口味 8 n
+合叶 7 n
+合合 3 vn
+合同 3572 a
+合同书 10 n
+合同价 2 n
+合同制 34 n
+合同商 7 n
+合同工 15 n
+合同文书 3 n
+合同文本 3 l
+合同期 13 n
+合同条款 3 n
+合同法 109 n
+合同纠纷 3 z
+合同范本 3 n
+合同规定 3 l
+合同诈骗 3 i
+合同额 3 n
+合唱 246 v
+合唱团 258 n
+合唱曲 22 n
+合唱组 3 n
+合唱节 3 n
+合唱队 87 n
+合围 168 n
+合在 3 v
+合在一起 3 i
+合壁 3 n
+合声 4 n
+合夥人 3 vn
+合奏 138 v
+合奏曲 3 n
+合好 3 a
+合婚 3 v
+合子 81 n
+合子期 3 n
+合定 3 a
+合宜 126 a
+合宪性 5 n
+合家 52 n
+合家幸福 3 i
+合家欢 12 l
+合家欢乐 3 i
+合山 12 ns
+合山市 3 ns
+合川 31 ns
+合川县 8 ns
+合川市 10 ns
+合工大 3 j
+合并 2921 v
+合并债务 3 n
+合并式 3 n
+合并案 2 n
+合并症 34 n
+合并者 3 n
+合府 3 n
+合度 3 n
+合建 17 v
+合式 43 n
+合式公式 3 l
+合弹 3 n
+合归 3 v
+合影 337 n
+合影留念 3 n
+合得 3 v
+合得来 20 v
+合心 3 n
+合性 2 n
+合恩角 11 n
+合情 9 n
+合情合法 3 n
+合情合理 75 n
+合情理 3 n
+合意 78 v
+合成 2266 v
+合成体 3 n
+合成作用 3 l
+合成列 3 l
+合成器 23 l
+合成图 3 n
+合成地图 3 nz
+合成塔 3 n
+合成孔径 3 n
+合成孔径雷达 2 i
+合成岩石 3 n
+合成机 3 n
+合成染料 22 n
+合成树脂 43 l
+合成橡胶 87 n
+合成气 11 n
+合成氨 64 n
+合成洗涤 3 v
+合成洗涤剂 13 n
+合成照 3 n
+合成物 3 l
+合成石油 2 n
+合成系 2 l
+合成纤维 114 l
+合成纸 3 nz
+合成药 6 n
+合成视频 3 n
+合成词 17 n
+合成酶 8 l
+合成革 18 l
+合战 3 v
+合报 3 n
+合抱 56 v
+合抱之木 3 i
+合拍 65 v
+合拍片 3 n
+合拢 94 v
+合掌 117 n
+合数 12 n
+合板 3 n
+合校 3 n
+合格 1664 n
+合格品 2 n
+合格率 156 n
+合格者 60 n
+合格证 115 n
+合格证书 28 n
+合欢 55 v
+合欢山 3 n
+合欢树 5 n
+合欢椅 3 n
+合欢皮 3 n
+合欢花 5 n
+合每股 3 l
+合气道 9 n
+合水 5 n
+合水县 2 ns
+合江 19 ns
+合江县 4 ns
+合江省 4 ns
+合法 3048 n
+合法利益 3 n
+合法化 122 vn
+合法婚姻 3 n
+合法席位 3 n
+合法性 164 n
+合法性检查 8 n
+合法收入 3 n
+合法政府 3 nt
+合法斗争 3 l
+合法权 6 n
+合法权利 3 l
+合法权益 3 n
+合法经营 3 l
+合法财产 3 l
+合注井 3 n
+合洗 3 vn
+合派 3 n
+合流 99 n
+合流制 3 n
+合流处 3 n
+合济 3 n
+合浦 25 ns
+合浦县 14 ns
+合浦还珠 3 nz
+合演 27 vn
+合点受精 3 n
+合照 6 v
+合照留念 3 n
+合牵 3 v
+合班 3 v
+合理 3870 vn
+合理冲撞 3 i
+合理化 100 n
+合理合情 3 n
+合理合法 11 n
+合理安排 3 n
+合理密植 3 l
+合理布局 6 n
+合理性 197 n
+合理收入 3 n
+合理收费 3 n
+合理流动 3 l
+合理要求 3 l
+合理负担 3 n
+合理配置 10 n
+合璧 66 n
+合瓣 3 n
+合瓣花冠 3 n
+合生元 3 n
+合用 102 v
+合盖 3 v
+合盘托出 4 n
+合眼 109 a
+合眼摸象 3 l
+合租 21 n
+合租房 3 n
+合租者 3 n
+合称 364 v
+合站 3 n
+合签 3 v
+合算 97 v
+合纤 8 n
+合约 193 n
+合纵 29 v
+合纵连横 14 l
+合线期 3 b
+合练 13 vn
+合组 96 vn
+合编 183 v
+合缝 3 n
+合署 8 v
+合群 130 n
+合群性 3 n
+合而为一 99 l
+合股 64 n
+合肥 406 n
+合肥人 3 n
+合肥工业大学 9 nt
+合肥市 85 ns
+合肥市公安局 17 nt
+合肥晚报 3 nz
+合肥联大 3 nt
+合胃口 3 n
+合胆同心 3 l
+合胞 17 n
+合脚 3 n
+合舟共济 3 i
+合营 435 vn
+合营企业 3 n
+合营者 3 n
+合著 176 a
+合葬 351 v
+合葬墓 293 n
+合蕊柱 3 n
+合补 3 v
+合规 68 vn
+合规律 3 l
+合规律性 3 n
+合规性 8 b
+合计 629 vn
+合订 6 v
+合订本 12 n
+合训 9 vn
+合议 70 n
+合议制 12 n
+合议庭 22 n
+合该 26 v
+合请 3 v
+合读 3 v
+合调 3 v
+合谋 128 n
+合谐 3 a
+合谷 3 n
+合购 3 v
+合资 832 vn
+合资企业 122 n
+合资方 2 n
+合资经营 3 n
+合起 3 v
+合踢 3 i
+合身 71 v
+合辙 6 n
+合辙押韵 3 nr
+合运动 3 l
+合适 2426 a
+合通 3 vn
+合速度 3 n
+合金 1004 n
+合金丝 5 n
+合金刀具 3 n
+合金制品 3 n
+合金化 5 n
+合金弹头 3 n
+合金战甲 3 nz
+合金材料 3 n
+合金管 3 n
+合金粉 3 n
+合金结 3 n
+合金装备 3 n
+合金钢 183 n
+合钓 3 v
+合铸 3 v
+合锯 3 v
+合闸 9 vn
+合阳 9 ns
+合阳县 6 ns
+合集 40 v
+合霉素 2 n
+合面 6 n
+合音 3 n
+合页 5 n
+合领 3 v
+合题 3 n
+合骑 3 n
+合黎山 8 ns
+合龙 42 ns
+吉 2590 nr
+吉丁斯 5 nr
+吉丁科 2 nr
+吉丁虫 2 nr
+吉东 4 ns
+吉东明 3 nr
+吉丹森 3 nr
+吉丽娜 12 nr
+吉乃尔 2 nr
+吉之兆 5 nr
+吉之言 5 nr
+吉乌斯蒂 2 nrt
+吉事多 3 l
+吉事达 3 nz
+吉亚戈 2 nr
+吉人 6 nrt
+吉人天相 8 nr
+吉人自有天相 11 i
+吉人通 2 nr
+吉他 108 ns
+吉他手 5 n
+吉他曲 3 ns
+吉他社 3 nr
+吉他网 3 nz
+吉他谱 3 nr
+吉伟征 2 nr
+吉伦特 7 nr
+吉伯 10 ns
+吉伯林 6 nr
+吉佩定 262 nr
+吉兆 55 nr
+吉光凤羽 3 nr
+吉光华 5 nr
+吉光片羽 3 nr
+吉光片翼 3 nz
+吉光片裘 3 nr
+吉克斯 2 nr
+吉公然 2 nr
+吉兰 16 ns
+吉兰丹 8 nr
+吉兰泰 9 nz
+吉兰特 19 nr
+吉兰达 3 nr
+吉内普 2 nr
+吉冈 4 ns
+吉凶 162 n
+吉凶未卜 3 l
+吉凶祸福 27 i
+吉凶难卜 3 l
+吉凶难料 3 i
+吉列 5 ns
+吉列夫 9 nr
+吉利 374 ns
+吉利区 3 ns
+吉利果 3 nr
+吉利话 3 n
+吉利车 3 ns
+吉剌思 7 nr
+吉剌部 2 nr
+吉剧 3 n
+吉力湖 3 nr
+吉勒 2 nrt
+吉勒耶 2 nr
+吉化 5 ns
+吉卜利 6 nrt
+吉卜林 8 nr
+吉卜赛 10 nr
+吉卜赛人 14 nrt
+吉县 4 ns
+吉司亚 3 nr
+吉合 3 nr
+吉国 3 ns
+吉坚赞 15 nr
+吉塔 7 nrt
+吉塞克 2 nr
+吉士 79 ns
+吉士出 2 nr
+吉备真 13 nr
+吉多 6 nrt
+吉大港 22 ns
+吉奥 3 nrt
+吉奥克 35 nr
+吉奥克斯 70 nrt
+吉奥尔 2 nr
+吉奥尼 4 nr
+吉奥森 83 nr
+吉妮 3 nrt
+吉姆 45 nrt
+吉姆斯博 2 nr
+吉姆萨带 3 nrt
+吉娃娃 3 nr
+吉子玉 12 nr
+吉它 9 n
+吉它曲 3 i
+吉安 124 ns
+吉安县 6 ns
+吉安地区 5 ns
+吉安市 13 ns
+吉尔伯 14 nr
+吉尔伯特 67 nrt
+吉尔克 3 nr
+吉尔古 2 ns
+吉尔吉 10 nr
+吉尔吉斯 78 nrt
+吉尔吉斯共和国 4 ns
+吉尔吉斯斯坦 144 nrt
+吉尔吉斯斯坦共和国 4 ns
+吉尔吉斯语 4 nz
+吉尔巴 10 nr
+吉尔巴特 2 nrt
+吉尔德 4 nr
+吉尔扎 5 nrt
+吉尔斯 4 nr
+吉尔松 3 nr
+吉尔特 3 nrt
+吉尔苏 4 ns
+吉尔达 2 nr
+吉尔队 4 nt
+吉尤姆 4 nr
+吉尼斯 45 nr
+吉尼斯世界纪录 22 nz
+吉尼玛 257 nr
+吉川 3 ns
+吉川幸次 3 nr
+吉州区 3 ns
+吉州庐 4 ns
+吉州窑 4 ns
+吉布提 92 nr
+吉布提共和国 4 ns
+吉布斯 55 nr
+吉布森 9 nr
+吉师弟 2 nr
+吉庆 54 ns
+吉庆街 3 nr
+吉库尤 9 nr
+吉德玛 2 nr
+吉思子 2 nr
+吉思曾 2 nr
+吉思汗 24 nr
+吉思益 2 nr
+吉思部 3 nr
+吉恩 7 nr
+吉房 3 n
+吉打 12 nz
+吉拉 3 nrt
+吉拉乌 7 nr
+吉拉尔 8 nr
+吉拉尼 5 nr
+吉拉德 3 nr
+吉拉林 5 nr
+吉拉迪 7 nr
+吉拉迪诺 3 nrt
+吉文 5 nr
+吉文衮 2 nrt
+吉斯 76 nrt
+吉斯卡尔 9 nrt
+吉斯尼 3 nr
+吉斯贝尔 2 nrt
+吉新鹏 261 nr
+吉日 83 nrt
+吉日良时 6 nr
+吉日良辰 9 nr
+吉时 15 ns
+吉星文 2 nr
+吉星高照 7 nr
+吉普 175 nr
+吉普赛 3 nr
+吉普赛人 28 nrt
+吉普车 294 nr
+吉服 6 n
+吉服冠 2 nr
+吉期 18 n
+吉木乃 3 nr
+吉木乃县 2 ns
+吉木萨尔 20 ns
+吉木萨尔县 5 ns
+吉本 9 ns
+吉村寿 2 nr
+吉杰博 4 nr
+吉林人民出版社 3 nt
+吉林大学 34 nt
+吉林工业大学 3 nt
+吉林市 90 ns
+吉林敖东 4 nr
+吉林省 424 ns
+吉林省人民政府 3 nt
+吉林省延边朝鲜族自治州 5 ns
+吉林省政府 2 nt
+吉林路 3 nr
+吉林长春 3 nr
+吉林队 4 nt
+吉格 2 nrt
+吉格斯 14 nr
+吉格梅 2 nr
+吉梅尔斯 2 nrt
+吉檀迦 5 nr
+吉水 9 ns
+吉水县 2 ns
+吉水府 2 nr
+吉永雅 2 nr
+吉河 11 ns
+吉河德 3 nr
+吉泊村 3 ns
+吉泰 6 nz
+吉洛姆 4 nr
+吉洛特 4 nr
+吉洪诺夫 4 nr
+吉烈迷 4 nr
+吉特 73 nrt
+吉瑞之 2 nr
+吉甫奏 2 nr
+吉田吹木 2 nr
+吉田忠雄 7 nr
+吉田松阴 9 ns
+吉田精 2 nr
+吉田耕造 2 nr
+吉田茂 7 nr
+吉登斯 7 nr
+吉百利 3 nr
+吉硅 3 nz
+吉礼指 3 nr
+吉祥 926 nr
+吉祥图案 3 nr
+吉祥天 3 nr
+吉祥如意 41 nr
+吉祥寺 6 nr
+吉祥村 3 nr
+吉祥止止 3 nr
+吉祥物 45 nr
+吉祥算 3 nr
+吉祥路 3 nr
+吉科宁 5 nr
+吉米 221 nrt
+吉米卡 2 nr
+吉米尔 2 nr
+吉米才 2 nr
+吉米扬 2 nr
+吉约姆 11 nr
+吉纳默 2 nr
+吉维森 3 nr
+吉网罗钳 3 nr
+吉罗 10 nrt
+吉舍夫 6 nr
+吉良乘 9 nr
+吉良吉影 3 nr
+吉莫 2 nrt
+吉萨 25 ns
+吉萨省 6 ns
+吉蔑族 3 v
+吉诃德 46 nr
+吉语 3 nz
+吉诺夫 9 nr
+吉象 256 n
+吉象牌 256 n
+吉贝 6 nr
+吉贝尔 3 nr
+吉赛尔 16 nr
+吉达 161 nr
+吉达港 7 ns
+吉通 3 nr
+吉里 5 nrt
+吉里寨 2 nr
+吉里耶 4 nr
+吉野 85 nr
+吉野家 3 nr
+吉野川 2 nr
+吉金 2 n
+吉阳 3 ns
+吉隆 15 nr
+吉隆县 3 ns
+吉隆坡 85 nr
+吉隆波 3 nr
+吉隆滩 7 nr
+吉雅德 2 nr
+吉非贝 2 nr
+吉首 28 ns
+吉首市 11 ns
+吉马 2 ns
+吉马良斯 3 nr
+吉马迪 2 nr
+吉马雷 3 nr
+吉鸿昌 70 nr
+吉黑 2 nrt
+吊 1450 zg
+吊上去 3 v
+吊上来 3 l
+吊下 3 n
+吊下去 3 l
+吊下来 3 l
+吊丧 37 v
+吊个 3 b
+吊儿郎当 23 l
+吊兰 5 nz
+吊具 2 n
+吊到 3 v
+吊卷 3 n
+吊去 3 v
+吊取 3 v
+吊古 3 ns
+吊古伤今 3 n
+吊古寻幽 3 i
+吊吊 3 v
+吊唁 180 v
+吊嗓 3 n
+吊嗓子 2 n
+吊塔 3 n
+吊好 3 v
+吊子 3 n
+吊孝 32 n
+吊客 16 n
+吊射 7 v
+吊尔郎当 3 i
+吊带 34 n
+吊带衫 3 n
+吊带袜 3 n
+吊带装 3 n
+吊带裙 3 n
+吊带裤 3 n
+吊床 10 n
+吊式 4 n
+吊形吊影 3 i
+吊慰 3 v
+吊扇 5 n
+吊打 3 v
+吊扣 15 n
+吊挂 3 v
+吊挂在 3 l
+吊挂式 3 nz
+吊挂着 3 l
+吊提 3 n
+吊放 12 v
+吊文 3 nz
+吊斗 2 n
+吊杆 16 n
+吊来吊去 3 i
+吊架 10 n
+吊柜 3 n
+吊桥 202 n
+吊桶 42 n
+吊梯 3 n
+吊楼 3 n
+吊死 130 v
+吊死扶伤 3 i
+吊死问疾 3 i
+吊死鬼 3 n
+吊民伐罪 32 nz
+吊滞 3 v
+吊灯 31 n
+吊牌 33 n
+吊环 41 n
+吊球 18 n
+吊瓶 12 n
+吊白块 31 n
+吊盘 3 n
+吊眼皮 3 l
+吊睛 5 n
+吊祭 11 v
+吊空 3 n
+吊窗 3 n
+吊竹梅 3 nz
+吊篮 20 nz
+吊索 5 n
+吊索具 3 n
+吊线 3 n
+吊绳 3 n
+吊罗山 6 ns
+吊耳 3 n
+吊胃口 3 n
+吊胆惊心 3 i
+吊胆提心 3 i
+吊脚 3 n
+吊脚楼 344 n
+吊膀 3 n
+吊膀子 4 l
+吊臂 23 n
+吊舱 288 n
+吊袜 3 n
+吊袜带 5 n
+吊袜腰带 3 n
+吊装 21 n
+吊装带 3 n
+吊装绳 3 l
+吊裤 3 n
+吊裤带 3 n
+吊角楼 3 n
+吊誉沽名 3 n
+吊走 3 v
+吊起 92 v
+吊起来 3 l
+吊车 92 n
+吊针 10 n
+吊钟 3 n
+吊钢丝 3 nz
+吊钩 8 nz
+吊铺 2 n
+吊链 3 n
+吊销 100 v
+吊销其 3 n
+吊销执照 3 n
+吊锚柱 3 vn
+吊门 3 n
+吊顶 11 n
+吊顶龙骨 3 i
+吊饰 15 n
+吋 60 zg
+同 37578 p
+同一 3327 b
+同一个 1036 b
+同一天 141 d
+同一律 19 d
+同一性 112 b
+同一时 10 c
+同一时间 3 d
+同一首歌 3 i
+同上 48 f
+同下 3 f
+同业 142 j
+同业公会 16 nt
+同业工会 3 nt
+同业相仇 3 l
+同中有异 3 i
+同为 3 c
+同义 66 n
+同义字 6 n
+同义词 824 n
+同义语 38 nz
+同乐 36 n
+同乐会 2 n
+同乡 180 n
+同乡会 31 n
+同事 2249 n
+同于 63 c
+同亚非 2 ns
+同产 3 j
+同享 3 v
+同人 80 n
+同人图 3 n
+同人小说 3 l
+同人志 3 n
+同仁 159 nr
+同仁医院 30 nt
+同仁县 6 ns
+同仁堂 62 nr
+同仇敌忾 193 i
+同仇敌慨 3 i
+同付 3 v
+同代人 17 n
+同价 4 n
+同价位 3 n
+同休共戚 3 n
+同休等戚 3 n
+同伙 125 n
+同伦类 3 nr
+同伦群 2 nr
+同伦逆 3 nr
+同伴 567 n
+同位 3 n
+同位素 432 n
+同位素量 3 n
+同位角 3 n
+同位语 7 n
+同住 3 v
+同住者 3 n
+同体 13 n
+同余式 15 l
+同侪 12 n
+同促效应 3 i
+同倍体 3 n
+同僚 208 n
+同光体 2 n
+同党 53 n
+同兴 2 b
+同减 3 v
+同凯泽 2 nr
+同出 3 v
+同出一辙 3 i
+同出同进 3 i
+同分 3 d
+同分异构 3 n
+同分数 3 n
+同列 41 b
+同则不继 8 d
+同创 24 j
+同创大业 3 nz
+同创杯 2 nz
+同创集团 3 nt
+同利相死 3 i
+同到 3 v
+同前 3 f
+同功一体 3 b
+同功器官 3 n
+同功酶 4 n
+同化 176 j
+同化作用 10 n
+同化力 5 n
+同化商 3 j
+同化政策 7 n
+同化组织 3 nt
+同区 3 n
+同升 3 v
+同去 3 v
+同县 3 ns
+同参数 3 n
+同发 7 j
+同口径 3 n
+同台 54 n
+同右 3 j
+同号 3 n
+同吃同住 3 i
+同合子 3 n
+同名 210 n
+同名同姓 3 i
+同名数 3 n
+同向 35 d
+同向重复 3 i
+同启东 2 nr
+同告 3 n
+同呼吸 8 l
+同呼吸共命运 6 l
+同命 3 n
+同命相连 4 i
+同命运 3 n
+同唱 3 v
+同喜 13 n
+同喜同乐 3 i
+同国 3 ns
+同地 3 j
+同场 17 n
+同场竞技 7 n
+同垂不朽 3 i
+同型 3 b
+同型发酵 3 v
+同型号 2 n
+同型配子 3 n
+同埋 3 v
+同城 3 j
+同堂 148 n
+同堂兄弟 3 nr
+同塔 3 n
+同增 3 v
+同声 348 d
+同声一辞 3 i
+同声传 3 i
+同声共气 3 i
+同声同气 3 i
+同声相应 4 i
+同声相求 3 i
+同声翻译 3 l
+同声附和 3 i
+同多碱 3 l
+同多糖 3 nr
+同多酸 3 nz
+同大 32 j
+同奉军 2 nr
+同好 30 d
+同好者 2 n
+同姓 148 n
+同姓同名 3 i
+同子杰 5 nr
+同学 4396 n
+同学们 3 n
+同学会 23 n
+同学录 13 n
+同学聚会 3 n
+同安 9 nz
+同安区 3 ns
+同安县 16 ns
+同宗 78 nr
+同宗配合 3 nr
+同定 3 d
+同宝钗 2 nr
+同室 23 n
+同室操戈 24 i
+同寝室 3 i
+同对 3 d
+同尘合污 3 i
+同尾酶 3 n
+同层人 3 b
+同居 265 j
+同居一室 3 nz
+同居人 3 nr
+同屋 9 n
+同属 152 n
+同岁 8 n
+同崇祯 6 nr
+同工 3 j
+同工不同酬 3 l
+同工同酬 522 l
+同工异曲 3 n
+同工激素 3 n
+同工酶 3 n
+同希洛 2 nr
+同平章 5 nr
+同年 3154 t
+同年同月 3 i
+同年级 3 b
+同年而语 3 i
+同年龄 3 b
+同年龄组 3 n
+同庆 8 ns
+同床 3 n
+同床共枕 16 i
+同床各梦 3 l
+同床异梦 26 i
+同庚 5 nr
+同度 3 n
+同开普 2 nr
+同归 45 v
+同归于尽 207 i
+同归殊涂 3 n
+同归殊途 3 n
+同形 49 n
+同形体 3 n
+同形异义 3 l
+同形词 2 i
+同往 3 d
+同德 7 nrt
+同德一心 3 i
+同德协力 3 nz
+同德县 2 ns
+同德同心 3 nt
+同德殿 2 nr
+同德耀 2 nr
+同德齐 2 nr
+同心 209 n
+同心一力 3 i
+同心一德 3 i
+同心僇力 3 vn
+同心共济 3 n
+同心共胆 3 i
+同心协力 86 i
+同心协德 3 i
+同心协济 3 n
+同心县 18 nr
+同心叶力 3 n
+同心合力 8 n
+同心合德 3 i
+同心合意 5 i
+同心合胆 3 i
+同心同德 82 i
+同心圆 32 nr
+同心戮力 12 i
+同心断金 3 n
+同心毕力 3 i
+同心盟 3 j
+同心结 3 nr
+同志 8992 n
+同志会 42 nt
+同志图片 3 nz
+同志小说 3 n
+同志文学 3 nt
+同志电影 3 n
+同志网 3 nz
+同忧相救 3 i
+同态 21 n
+同态复仇 3 l
+同态滤波 3 n
+同性 86 n
+同性恋 170 v
+同性恋爱 32 l
+同性恋者 31 n
+同性爱 3 l
+同性相斥 3 i
+同恶共济 3 i
+同恶相党 3 i
+同恶相助 3 i
+同恶相恤 3 n
+同恶相求 3 i
+同恶相济 3 i
+同悲 7 n
+同情 1092 n
+同情心 94 n
+同情者 14 n
+同意 5348 d
+同意书 4 n
+同意权 3 n
+同感 105 n
+同慧梅 33 nr
+同慧琼 6 nr
+同慧英 12 nr
+同房 39 n
+同房兄弟 3 n
+同指 3 j
+同捷轩 14 nr
+同排 3 v
+同支 3 n
+同改 3 j
+同敝相济 3 i
+同敬轩 15 nr
+同文共规 3 n
+同文共轨 3 n
+同文同种 3 n
+同文馆 32 n
+同方 75 f
+同方向 43 n
+同旁内角 3 n
+同族 73 nz
+同日 250 t
+同日生 3 nz
+同日而言 3 i
+同日而论 3 i
+同日而语 26 i
+同时 30245 c
+同时代 142 t
+同时在线 3 l
+同时对比 3 n
+同时并举 3 i
+同时性 14 b
+同时效度 3 n
+同昆钢 2 nr
+同明军 4 nr
+同明叔 2 nr
+同明相照 3 i
+同明远 3 nr
+同春哥 11 nr
+同是 3 c
+同是天涯沦落人 5 l
+同月 128 t
+同月同日 3 i
+同有 3 c
+同期 1610 b
+同期相比 3 i
+同期运移 3 i
+同机 15 n
+同村 42 n
+同条共贯 3 i
+同来 3 c
+同来同往 3 i
+同杨诚 2 nr
+同构 22 n
+同构化 2 n
+同枕共眠 3 i
+同校 3 j
+同样 7733 d
+同核体 3 n
+同根 12 nz
+同根词 16 i
+同格 3 n
+同案 3 n
+同案犯 19 n
+同桌 68 n
+同桌后生 3 n
+同档 3 b
+同档次 9 b
+同梯 3 n
+同楼 3 n
+同欢 3 v
+同正 3 d
+同此 3 c
+同步 1056 d
+同步化 3 j
+同步卫星 10 nz
+同步器 3 n
+同步增长 3 i
+同步带 3 n
+同步序列 3 l
+同步性 5 n
+同步总线 3 n
+同步控制 2 n
+同步操作 3 l
+同步机 3 n
+同步率 3 n
+同步电动 3 l
+同步电机 3 n
+同步网 3 nz
+同步进行 3 j
+同母 3 n
+同母兄弟 7 n
+同母异父 3 n
+同比 2135 j
+同比增加 3 nr
+同气 3 n
+同气相求 7 i
+同气连枝 24 i
+同江 57 ns
+同江县 3 ns
+同江市 3 ns
+同治 477 n
+同治帝 13 n
+同派 3 n
+同流合 3 n
+同流合汙 3 v
+同流合污 58 n
+同济 85 n
+同济医科大学 5 nt
+同济大学 174 nt
+同浴讥裸 3 z
+同渡 3 v
+同温 3 n
+同温同压 3 n
+同温层 16 n
+同游 16 j
+同源 129 n
+同源共流 3 n
+同源异派 3 n
+同源异流 3 i
+同源性 3 b
+同源配对 3 i
+同点 3 n
+同然一辞 3 i
+同父 3 n
+同父异母 3 n
+同犯 3 n
+同献忠 27 nr
+同玩 3 n
+同现 8 v
+同班 74 n
+同班同学 3 nt
+同理 82 n
+同理可知 3 i
+同理可证 3 j
+同琼英 2 nz
+同甘 6 j
+同甘共苦 75 i
+同甘苦 27 i
+同生 3 b
+同生作用 3 n
+同生共死 51 i
+同生日 3 t
+同生死 23 i
+同用 3 b
+同病相怜 56 i
+同登 15 nrt
+同盖 3 v
+同盘而食 3 i
+同盟 1210 j
+同盟会 336 nt
+同盟军 72 nt
+同盟国 168 ns
+同盟条约 94 n
+同盟网 3 n
+同盟罢工 3 nz
+同盟者 82 n
+同相 3 d
+同相轴 3 n
+同省 3 j
+同知 141 v
+同社友 3 n
+同离子 3 n
+同种 179 r
+同种位 3 n
+同种型 3 n
+同种移植 3 l
+同科 3 j
+同科特 2 nr
+同租 3 n
+同程网 3 n
+同突触 3 n
+同窗 67 n
+同窗好友 3 i
+同窗学友 3 i
+同站 3 n
+同章 3 n
+同符合契 3 n
+同等 863 b
+同等学力 40 n
+同等学历 10 n
+同等对待 3 l
+同等待遇 3 l
+同等条件 3 n
+同篇 3 b
+同类 666 n
+同类产品 3 n
+同类品系 3 n
+同类相从 3 i
+同类相残 3 i
+同类相求 3 i
+同类系 3 n
+同类经营 3 n
+同类群 3 n
+同类项 2 n
+同类题材 8 n
+同系 3 n
+同系物 27 l
+同素 3 n
+同素异 17 nr
+同素异形 3 n
+同素异性 3 n
+同红霞 2 nr
+同约 3 j
+同级 449 b
+同级生 3 n
+同线 3 j
+同线型 3 b
+同组 31 n
+同罪 3 v
+同美相妒 3 i
+同翅目 13 n
+同联 3 j
+同聚 3 v
+同聚多肽 3 nz
+同聚物 3 n
+同胞 1423 n
+同胞们 3 n
+同胞兄弟 18 n
+同胞共气 3 n
+同胞爱 3 n
+同舟共命 3 i
+同舟共济 56 i
+同舟敌国 3 i
+同舟遇风 3 i
+同船 19 j
+同船合命 3 nz
+同色相 3 n
+同色系 3 n
+同花 7 n
+同花顺 3 nr
+同苦共乐 3 i
+同莺儿 2 nr
+同蒲 35 nrt
+同蒲线 3 nz
+同行 817 j
+同行业 110 n
+同行人 5 n
+同行同业 3 n
+同行者 14 n
+同袍 8 n
+同袍同泽 3 i
+同裂酶 3 n
+同订 3 v
+同论 3 c
+同调 52 v
+同调代数 3 n
+同调群 3 nr
+同谋 68 n
+同谋犯 2 n
+同谋者 3 n
+同豪格 2 nr
+同质 63 n
+同质化 56 n
+同质多晶 3 n
+同质性 7 n
+同贺 2 v
+同赴 3 v
+同趣 3 n
+同路 24 n
+同路人 25 n
+同身寸 3 n
+同车 3 n
+同轴 25 n
+同轴天线 3 nz
+同轴开关 3 l
+同轴电缆 14 nz
+同轴线 2 n
+同辈 86 n
+同辙 3 n
+同边 3 f
+同过 3 c
+同进同出 3 i
+同进士 3 n
+同道 129 n
+同道中人 3 n
+同道者 3 n
+同配性别 3 n
+同配生殖 3 l
+同酬 3 n
+同里 47 r
+同里镇 2 ns
+同量 3 n
+同长 3 j
+同门 303 n
+同门异户 3 l
+同队 3 n
+同集路 3 n
+同音 43 n
+同音共律 3 n
+同音字 9 n
+同音词 3 n
+同项 3 b
+同题 3 n
+同饮 3 n
+同香兰 2 nr
+同龄 80 n
+同龄人 96 n
+同龄林 3 nr
+名 26255 q
+名下 81 n
+名下无虚 14 i
+名不副实 36 i
+名不符实 7 i
+名不虚传 194 i
+名不虚得 3 i
+名不虚立 3 i
+名不见经传 54 i
+名专栏 3 n
+名为 1281 v
+名为集体 3 n
+名主 3 n
+名义 1671 n
+名义工资 14 n
+名书 3 n
+名产 51 n
+名人 1112 n
+名人传 3 i
+名人名言 3 i
+名人坊 3 n
+名人堂 3 n
+名人字画 3 n
+名人录 5 n
+名人战 5 n
+名人效应 3 n
+名人荟萃 3 i
+名人赛 2 n
+名人轶事 3 vn
+名从主人 3 n
+名仓 2 v
+名份 3 n
+名企 129 j
+名优 570 n
+名优产品 3 n
+名优新 3 v
+名优特 3 nr
+名优特产 2 l
+名优特新 2 l
+名优茶 3 v
+名传千古 3 i
+名伶 6 n
+名位 436 n
+名作 112 n
+名作家 13 n
+名信片 3 n
+名儒 3 n
+名儿 3 n
+名公巨人 3 n
+名公巨卿 3 n
+名公钜人 3 nr
+名公钜卿 3 nr
+名典 10 n
+名册 95 n
+名分 75 n
+名列 688 n
+名列前矛 3 i
+名列前茅 398 i
+名列榜首 158 i
+名列第一 3 n
+名列首位 3 n
+名利 210 n
+名利双收 22 l
+名利场 13 n
+名利客 3 n
+名利思想 3 n
+名刹 3 n
+名刺 17 n
+名剑 3 n
+名剧 17 n
+名副其实 819 i
+名匠 14 n
+名医 177 n
+名医堂 3 n
+名医药 3 n
+名单 1823 n
+名卿钜公 3 nr
+名厨 20 n
+名古 6 n
+名古屋 92 n
+名古屋人 3 n
+名句 73 n
+名叫 2141 v
+名号 128 n
+名同实异 3 l
+名品 35 n
+名品店 3 n
+名品服饰 3 n
+名唤 90 v
+名嘴 3 n
+名器 3 n
+名噪 3 v
+名噪一时 34 l
+名团 10 n
+名园 54 n
+名园古刹 3 n
+名地 3 n
+名垂万古 3 i
+名垂不朽 3 i
+名垂千古 9 i
+名垂史册 3 n
+名垂后世 3 i
+名垂竹帛 3 i
+名垂青史 34 n
+名城 1846 n
+名堂 217 n
+名士 272 n
+名士风流 3 n
+名声 653 n
+名声不好 3 l
+名声在外 17 i
+名声大噪 3 i
+名声大振 28 i
+名声过实 3 i
+名声远播 3 l
+名声鹊起 2 i
+名头 345 n
+名如其人 3 i
+名妓 3 n
+名媛 3 nr
+名子 140 n
+名字 5359 n
+名存实亡 91 l
+名学 3 n
+名实 57 n
+名实相副 3 i
+名实相符 7 l
+名实难副 3 i
+名家 548 n
+名家书画 3 n
+名宿 58 n
+名寺 3 n
+名导 13 n
+名将 754 n
+名局 3 n
+名山 457 n
+名山事业 3 n
+名山县 3 ns
+名山大川 46 ns
+名山胜川 3 ns
+名山胜水 3 n
+名师 406 n
+名师出高徒 8 i
+名帖 75 n
+名店 9 n
+名店街 3 n
+名录 229 n
+名德重望 3 i
+名我固当 3 l
+名手 30 n
+名扬 189 v
+名扬中外 3 i
+名扬四海 18 i
+名扬天下 54 i
+名护 7 v
+名护市 6 n
+名教 136 n
+名教授 4 n
+名数 14 n
+名方 8 n
+名旦 35 n
+名星 5 n
+名曰 277 v
+名曲 35 n
+名望 272 v
+名木 7 n
+名权位 3 n
+名条 3 n
+名来利往 3 i
+名标青史 3 n
+名校 228 n
+名模 24 n
+名次 485 n
+名次表 3 n
+名款 3 n
+名歌 2 n
+名歌手 3 i
+名歌星 3 n
+名正理顺 3 i
+名正言顺 120 i
+名氏 3 n
+名气 366 n
+名泉 6 n
+名流 119 n
+名流巨子 3 n
+名满天下 60 i
+名演员 10 n
+名烟 2 n
+名爵 10 n
+名片 1713 n
+名片册 3 n
+名片夹 2 n
+名片机 3 n
+名片盒 3 n
+名片纸 3 n
+名片设计 3 i
+名牌 2001 n
+名牌产品 3 n
+名牌商品 3 n
+名牌商标 3 n
+名牌大学 3 n
+名牌战略 3 n
+名牌服装 3 n
+名牌服饰 3 n
+名牌货 5 n
+名物 17 n
+名特产 3 n
+名特优 261 nr
+名特优新 5 l
+名犬 3 n
+名状 3 n
+名狗 3 n
+名理 3 n
+名琴 5 n
+名画 73 n
+名画家 7 n
+名留青史 21 n
+名盘 3 n
+名目 202 n
+名目繁多 86 i
+名相 3 n
+名碟 3 n
+名称 5468 n
+名称权 3 n
+名称栏 3 n
+名窑 13 n
+名章 3 n
+名笔 2 n
+名符其实 38 i
+名篇 100 n
+名簿 3 n
+名系 3 n
+名缰利锁 3 n
+名耆 3 ns
+名胜 887 n
+名胜区 976 n
+名胜古迹 1360 n
+名胜地 3 n
+名脚儿 3 n
+名臣 93 n
+名色 3 n
+名节 31 n
+名花 46 n
+名花异草 4 l
+名花有主 3 i
+名茶 863 n
+名药 11 n
+名菜 25 n
+名落孙山 33 i
+名著 327 n
+名表 18 n
+名角 50 n
+名角儿 7 n
+名言 223 n
+名言录 3 n
+名誉 886 n
+名誉主席 3 n
+名誉会员 3 n
+名誉会长 3 n
+名誉博士 3 n
+名誉扫地 3 i
+名誉教授 3 n
+名誉权 21 n
+名誉职 3 n
+名讳 3 v
+名词 1177 n
+名词委 3 n
+名词术语 3 n
+名词解释 3 n
+名诗 12 n
+名贯 3 v
+名贵 1381 n
+名贵物品 3 n
+名贵药材 3 n
+名贸实易 3 l
+名车 31 n
+名辩 3 v
+名过其实 3 i
+名酒 39 n
+名重一时 18 i
+名门 195 n
+名门世家 3 n
+名门世族 3 nz
+名门望族 14 n
+名门贵族 3 n
+名门闺秀 3 i
+名间 3 n
+名间乡 3 n
+名闻 69 n
+名闻中外 3 i
+名闻于世 3 i
+名闻遐迩 274 i
+名难副实 3 i
+名震一时 4 i
+名震中外 3 l
+名鞿利鞚 3 v
+名额 1731 n
+名额有限 3 n
+名食 3 n
+名马 3 n
+名驹 3 n
+名高天下 3 i
+名高难副 3 i
+名鸟 3 n
+后 124793 f
+后七子 14 nr
+后上 3 t
+后下 3 f
+后不后悔 3 i
+后不巴店 3 ns
+后不着店 3 n
+后不见来者 2 i
+后世 1096 t
+后丹根 2 nz
+后主 286 n
+后举兵 24 n
+后乐堂 5 n
+后事 124 n
+后事之师 29 n
+后人 1035 n
+后人乘凉 2 i
+后人把滑 3 n
+后付费 3 n
+后代 1192 t
+后代人 7 n
+后代子孙 3 nr
+后仰 3 n
+后件 3 n
+后任 365 n
+后伊尹 2 nr
+后会 3 n
+后会无期 3 n
+后会有期 111 n
+后作物 3 n
+后侧 31 f
+后儿 6 t
+后兀良 3 nr
+后克利 2 nr
+后写 43 v
+后军 3 n
+后冠 3 n
+后冷器 3 n
+后分 3 n
+后刘乡 3 nr
+后剑招 2 nr
+后力不继 3 i
+后加安全 3 nr
+后劲 368 n
+后劲不足 3 i
+后劲后来 3 i
+后势 3 n
+后勤 1279 n
+后勤人员 3 n
+后勤保障 3 n
+后勤区 3 n
+后勤处 8 n
+后勤局 2 n
+后勤工作 3 n
+后勤机关 3 n
+后勤组 3 n
+后勤部 77 n
+后勤部长 3 n
+后勤部门 3 n
+后勤部队 3 n
+后北征 4 nr
+后区 3 n
+后半 3 t
+后半场 3 n
+后半夜 99 t
+后半季 3 t
+后半拍 3 n
+后半期 94 t
+后半段 40 t
+后半生 80 t
+后半程 6 n
+后半辈子 22 t
+后半部 3 n
+后卫 491 n
+后卫线 14 n
+后去 3 t
+后参征 2 n
+后发 137 v
+后发优势 8 n
+后发制人 35 n
+后台 331 n
+后台任务 3 n
+后台作业 2 n
+后台程序 3 n
+后台老板 14 n
+后叶 3 t
+后同步码 3 n
+后含物 3 n
+后周 174 t
+后唐 240 t
+后嗣 85 nr
+后园 87 n
+后图 3 n
+后土 22 n
+后场 208 n
+后坐 78 v
+后坐力 61 n
+后埔 3 ns
+后基因组 3 n
+后堂 225 n
+后墙 3 n
+后墙纵帆 3 l
+后壁 3 n
+后壁乡 3 n
+后处理 33 n
+后备 517 n
+后备军 90 n
+后备军人 3 n
+后备军官 3 n
+后备军官选拔培训工作办公室 2 n
+后备力量 3 n
+后备干部 3 n
+后备式 3 n
+后备支撑 3 n
+后备箱 6 n
+后备系统 2 n
+后备软盘 3 n
+后天 352 t
+后天下之乐而乐 18 i
+后天免疫 3 n
+后天性 28 n
+后头 311 n
+后奏曲 3 n
+后妃 228 n
+后妈 16 n
+后妻 24 n
+后娘 30 n
+后子头 3 n
+后学 3 n
+后安禄 2 nr
+后室 3 n
+后宫 707 n
+后宰门 11 n
+后尘 66 n
+后尾 3 t
+后屋 3 n
+后山 218 ns
+后峰 2 n
+后巴普 2 nr
+后巷 3 n
+后市 308 n
+后平沙 2 ns
+后平飞 3 nr
+后年 20 t
+后序 3 n
+后废帝 7 nr
+后座 108 n
+后座力 3 n
+后庭 5 n
+后庭姬 3 nr
+后庭花 3 n
+后廷 2 n
+后弘期 4 nr
+后影 13 n
+后微仰 2 n
+后心 3 n
+后心飞 3 nr
+后必生 2 nr
+后怕 50 v
+后怕虎 2 i
+后恕儿 2 nr
+后悔 988 v
+后悔不及 3 i
+后悔不已 3 i
+后悔不迭 9 i
+后悔无及 11 i
+后悔痛苦 3 i
+后悔药 11 n
+后悔莫及 32 i
+后患 149 n
+后患无穷 56 i
+后成仙 3 nr
+后成论 3 n
+后房 3 n
+后手 10 n
+后手不接 2 i
+后拥前呼 3 i
+后排 62 vn
+后掠角 43 n
+后推术 3 n
+后援 43 v
+后援会 3 j
+后援军 3 nr
+后援团 3 n
+后援存储器 2 n
+后撤 150 v
+后改鹰 2 nr
+后放 3 t
+后效 3 n
+后方 637 f
+后方区 3 n
+后方城市 3 ns
+后旗 29 n
+后无来者 29 i
+后日 3 t
+后晋 132 t
+后晌 85 t
+后晚 3 t
+后普京 2 ns
+后景 5 n
+后望镜 3 n
+后期 2557 t
+后期制作 3 l
+后期合成 3 l
+后期后勤 3 n
+后来 13932 t
+后来之秀 3 i
+后来居上 61 i
+后来者 55 n
+后来者居上 3 i
+后果 1766 n
+后果严重 3 i
+后果堪忧 3 i
+后果堪虑 3 i
+后果自负 3 i
+后架 7 n
+后桅 3 n
+后桥 3 n
+后梁太祖 3 nr
+后椅 3 n
+后步 3 n
+后殖民 3 n
+后段 3 t
+后殿 3 n
+后殿中 2 nr
+后殿溜 2 nr
+后殿里 2 nr
+后母 28 n
+后汉 142 t
+后汉书 96 nr
+后河 260 ns
+后河乡 2 ns
+后浪 3 n
+后浪推前浪 7 i
+后海 6 f
+后海先河 3 nr
+后港 3 ns
+后湖 274 ns
+后灯 3 n
+后点 3 n
+后燕 14 nr
+后燕主 2 nr
+后燕军 2 nr
+后燕复 3 nr
+后燕太子 2 nr
+后燕相 3 nr
+后父 5 n
+后爹 9 n
+后牙 3 ns
+后牵索 3 i
+后玄武 2 nr
+后现代 37 n
+后现代主义 30 n
+后生 286 n
+后生可畏 24 i
+后生小子 30 n
+后生晚学 3 n
+后用 3 n
+后甲板 3 n
+后申侯 3 nr
+后白蛋白 3 n
+后皆召 2 nr
+后皇马 2 nr
+后盖板 3 n
+后直飞 6 nr
+后盾 122 n
+后知后觉 3 i
+后石 4 t
+后福 19 nr
+后福无量 3 i
+后秃 3 n
+后秦 137 t
+后移 198 v
+后稷 3 n
+后空翻 12 n
+后窗 52 n
+后窗玻璃 3 nz
+后端 3 f
+后端网 3 n
+后竹围 3 n
+后绘图 3 nr
+后继 66 nr
+后继乏人 11 n
+后继人 7 nr
+后继无人 16 i
+后继无力 3 i
+后继有人 28 n
+后继机 3 nr
+后继者 59 nr
+后继舰 4 nr
+后续 374 v
+后续力 3 n
+后缀 49 n
+后缀名 3 vn
+后缘 123 n
+后置 70 n
+后置词 3 i
+后羿 25 nrt
+后翼 3 n
+后者 2961 n
+后肢 152 n
+后背 310 n
+后脑 125 n
+后脑勺 94 n
+后脑勺子 3 n
+后脑壳 2 n
+后脚 70 n
+后脸儿 3 nr
+后腰 145 n
+后腿 118 n
+后膛 3 n
+后舜天 2 nr
+后舱 34 n
+后节 3 t
+后花园 83 n
+后菜园 3 n
+后营村 3 n
+后藏 30 n
+后藤 3 n
+后藤象二郎 2 nr
+后行 3 n
+后街 13 n
+后裔 811 n
+后襟 20 n
+后襬 3 vn
+后西征 3 nr
+后见潇 2 nr
+后视 7 n
+后视图 2 n
+后视镜 18 n
+后记 51 n
+后语 3 nz
+后负荷 3 n
+后账 3 n
+后赫拉 3 nr
+后赵 97 t
+后起之秀 45 i
+后跃开 24 nr
+后路 85 n
+后踝 3 n
+后身 25 r
+后车 3 n
+后车之戒 3 i
+后车之鉴 2 i
+后车站 3 n
+后轮 13 n
+后轴 23 n
+后辈 169 n
+后辈小子 3 l
+后辍 3 v
+后辙 3 n
+后边 859 f
+后过渡期 5 n
+后进 89 v
+后进之秀 3 nr
+后进先出 3 i
+后进村 2 nr
+后进生 39 nr
+后进领袖 3 n
+后连跃 2 nr
+后述 3 b
+后退 697 v
+后遗 3 n
+后遗症 143 n
+后部 402 f
+后里 5 r
+后金 313 n
+后金刃 3 n
+后镜 3 n
+后门 336 n
+后门进狼 3 n
+后门进虎 3 n
+后闸 3 n
+后防 83 n
+后防线 54 n
+后院 368 n
+后院起火 10 n
+后隋村 3 vn
+后随链 3 n
+后静静 2 nr
+后面 4308 f
+后顶 3 n
+后项 3 r
+后顾之忧 122 i
+后颈 3 n
+后魏 287 t
+后鼎足 2 i
+后鼓 8 n
+后龙溪 3 nr
+吏 781 ng
+吏卒 10 n
+吏员 26 n
+吏官 3 n
+吏治 192 n
+吏目 32 n
+吏部 1255 n
+吐 2930 v
+吐下去 3 v
+吐下来 3 v
+吐丝 57 ns
+吐丝自缚 3 i
+吐丹 2 ns
+吐出 3 v
+吐出来 3 v
+吐刚茹柔 3 ns
+吐到 3 v
+吐口 42 ns
+吐司 3 n
+吐司面包 3 n
+吐吐 3 v
+吐吐气 3 n
+吐哈 3 o
+吐哺 3 v
+吐哺捉发 3 vn
+吐哺握发 3 nr
+吐哺辍洗 3 vn
+吐噜 10 o
+吐字 33 nz
+吐实 3 v
+吐尔地 2 ns
+吐属 3 n
+吐屯 3 ns
+吐峪沟 4 ns
+吐弃 3 v
+吐心吐胆 3 i
+吐成 3 v
+吐掉 3 v
+吐故纳新 17 ns
+吐方 2 n
+吐来吐去 3 i
+吐根 3 ns
+吐根碱 7 nz
+吐根素 3 nz
+吐气 52 n
+吐气扬眉 7 ns
+吐气若兰 3 nr
+吐沫 20 n
+吐泡 3 ns
+吐泻 8 v
+吐温 15 n
+吐火罗文 5 nz
+吐火罗语 16 nz
+吐番 16 ns
+吐痰 3 v
+吐真言 3 nr
+吐穗 2 nr
+吐絮 3 n
+吐纳 56 ns
+吐绶鸡 10 nr
+吐肝露胆 3 i
+吐胆倾心 3 i
+吐舌 3 n
+吐舌习惯 3 n
+吐舌头 3 ns
+吐艳 9 nr
+吐芽 3 v
+吐苦水 3 ns
+吐蕃 659 ns
+吐蕃王 5 n
+吐藩 3 nr
+吐血 158 v
+吐诉 3 v
+吐话 3 v
+吐谷浑 124 nr
+吐过去 3 v
+吐过来 3 l
+吐酸 3 nz
+吐露 322 v
+吐露出 3 i
+吐露真情 11 i
+吐音 2 n
+吐食握发 3 n
+吐骨头 3 n
+吐鲁番 250 ns
+吐鲁番地区 7 ns
+吐鲁番市 18 ns
+向 75979 p
+向一夫 3 nr
+向上 919 d
+向上一路 3 nr
+向上伸延 3 nr
+向上倾斜 3 v
+向下 767 v
+向下倾斜 3 v
+向下兼容 3 nr
+向世卫 2 nr
+向世钧 8 nr
+向业界 2 n
+向东 1037 nr
+向东冲 4 nr
+向东奔 3 nr
+向东山 3 nr
+向东开 2 nr
+向东流 19 nr
+向东疾 4 nr
+向东看 3 nr
+向东虏 2 nr
+向东走 3 nr
+向东韶 2 nr
+向东驰 2 nr
+向丹墀 3 nr
+向丹湖 2 nr
+向义军 4 nr
+向义渠 3 nr
+向乔峰 8 nr
+向二子 2 nr
+向云中 3 nr
+向云山 2 nr
+向亚冠 3 nr
+向亨特 2 nr
+向仪琳 7 nr
+向仲华 3 nr
+向伊军 6 nr
+向众军 3 nr
+向众卿 2 nr
+向传功 2 nr
+向例 6 n
+向侧面 3 nr
+向保华 3 nr
+向保罗 2 nr
+向信标 2 nr
+向健妇 4 nr
+向元军 4 nr
+向元廷 2 nr
+向兆惠 3 nr
+向光 3 nr
+向光性 16 nr
+向光明 5 nr
+向光武 2 nr
+向克捷 9 nr
+向全城 2 nr
+向其纳 2 nr
+向内地 3 n
+向内走 3 nr
+向凤姐 5 nr
+向前 3028 t
+向前看齐 3 nr
+向前行驶 3 nr
+向前走 3 nr
+向剑刃 2 nr
+向剑州 2 nr
+向北朝 2 nr
+向北看 3 nr
+向北走 3 nr
+向北飞 2 nr
+向华山 2 nr
+向华强 3 nr
+向南东 2 nr
+向南疾 2 nr
+向南看 3 nr
+向南西 2 nr
+向南走 3 nr
+向南飞 4 nr
+向双儿 6 nr
+向双喜 7 nr
+向双雕 2 nr
+向叔惠 2 nr
+向可旺 2 nr
+向台军 2 nr
+向右爱 3 nr
+向右看 3 nr
+向右看齐 3 nr
+向右走 3 nr
+向右转 3 nr
+向右转走 3 nr
+向后平 2 nr
+向后散射 3 nr
+向后看 3 v
+向后走 3 nr
+向后转 3 nr
+向后转走 3 nr
+向哲罗 3 nr
+向善 72 v
+向喜峰 2 nr
+向嘉禾 2 nr
+向四侠 2 nr
+向国师 13 nr
+向国清 2 nr
+向在远 2 nr
+向地性 5 nr
+向墨索 2 nr
+向壁虚构 3 nr
+向壁虚造 3 nr
+向士隐 2 nr
+向声背实 3 nr
+向夏国 3 ns
+向外看 3 v
+向外走 3 v
+向大年 3 nr
+向大顺 3 nr
+向天歌 3 nr
+向天盏 3 nz
+向天笑 3 nr
+向天飞 5 nr
+向天鹰 2 nr
+向太后 7 nr
+向太空 3 nr
+向奉宸 2 nr
+向威尔 2 nr
+向威廉 2 nr
+向婆子 2 nr
+向孝文 3 nr
+向宗子 2 nr
+向宗敏 5 nr
+向宗正 3 nr
+向宗第 3 nr
+向官仓 2 nr
+向定逸 4 nr
+向定静 2 nr
+向宝月 2 nr
+向宝树 5 nr
+向宝玉 11 nr
+向宝象 2 nr
+向宝钗 14 nr
+向宝钛 2 nr
+向宣抚 2 nr
+向家坝 3 nr
+向家师 3 nr
+向寒秀 2 nr
+向导 326 v
+向导公司 3 n
+向导员 3 n
+向小丘 2 nr
+向小威 2 nr
+向小建 2 nr
+向小昭 3 nr
+向小校 4 nr
+向小王 2 nr
+向小袁 4 nr
+向小龙 101 nr
+向少安 2 nr
+向少平 2 nr
+向少林 3 nr
+向岳灵 3 nr
+向崇祯 38 nr
+向川甘 3 nr
+向左爱 3 nr
+向左看 3 nr
+向左看齐 3 nr
+向左走 3 nr
+向左转 3 nr
+向左转走 3 nr
+向巧慧 5 nr
+向巴平措 3 nr
+向师叔 2 nr
+向平之原 3 nr
+向平之愿 3 nr
+向平儿 7 nr
+向庙坪 2 nr
+向度 11 d
+向延展 2 nr
+向建虏 2 nr
+向开田 2 nr
+向往 1218 d
+向往已久 3 nr
+向御营 3 nr
+向德军 3 nr
+向德华 2 nr
+向德山 4 nr
+向德川 3 nr
+向德胜 2 nr
+向心 42 v
+向心力 49 nr
+向心法则 3 n
+向忠发 296 nr
+向思特 2 nr
+向怡红 3 nr
+向性 22 n
+向恒山 7 nr
+向慈恩 4 nr
+向慈禧 6 nr
+向慕 3 v
+向慧剑 2 nr
+向慧梅 21 nr
+向慧珠 2 nr
+向慧英 12 nr
+向懿律 3 nr
+向戌 3 nz
+向承欢 4 nr
+向拜仁 2 nr
+向探春 2 nr
+向搜索 3 nr
+向敏敏 6 nr
+向文帝 2 nr
+向文泰 3 nr
+向斜 64 v
+向斜层 3 nr
+向斯万 2 nr
+向新月 2 nr
+向方怡 3 nr
+向方生 2 nr
+向无此例 3 i
+向日性 3 nr
+向日葵 196 n
+向春义 2 nr
+向春川 2 nr
+向晓霞 2 nr
+向晚 38 d
+向普京 3 nr
+向景帝 2 nr
+向曼桢 11 nr
+向望海 6 nr
+向朝臣 3 nr
+向木桑 3 nr
+向束 3 v
+向来 1360 v
+向来如此 3 nr
+向来都是 3 n
+向松山 4 nr
+向林平 5 nr
+向桃枝 3 nr
+向桃根 5 nr
+向梅超 2 nr
+向棂星 3 nr
+向楚军 2 nr
+向楹柱 2 nr
+向欧阳锋 2 nr
+向武关 2 nr
+向殿壁 2 nr
+向水笙 4 nr
+向永历 3 nr
+向永福 2 nr
+向汉阳 3 nr
+向汝宁 2 nr
+向汝才 4 nr
+向汴梁 2 nr
+向沐剑 7 nr
+向河心 2 nr
+向法军 2 nr
+向法王 8 nr
+向洋兵 2 nr
+向洪七 5 nr
+向洪基 2 nr
+向流云 4 nr
+向济尔 3 nr
+向济度 2 n
+向海 100 nr
+向海岚 3 nr
+向海萍 2 nr
+向润叶 2 nr
+向润润 2 nr
+向淘宝 2 nr
+向渊圣 5 nr
+向渔洋 2 nr
+向渔隐 2 nr
+向潇尹 2 nr
+向潇湘 16 nr
+向澄光 3 nr
+向火乞儿 3 i
+向灵智 2 nr
+向父帅 3 nr
+向父皇 2 nr
+向献忠 10 nr
+向玉儿 2 nr
+向玉娘 2 nr
+向玉帝 2 nr
+向玉皇 2 nr
+向琛航 2 nr
+向瑛姑 7 nr
+向用 3 v
+向百思 2 nr
+向皇亲 7 nr
+向皇爷 4 nr
+向皇阿 3 nr
+向盈盈 6 nr
+向监国 3 nr
+向直军 3 nr
+向着 827 p
+向知客 2 nr
+向石清 4 nr
+向碧初 3 nr
+向社友 4 nr
+向福临 6 nr
+向福公子 2 nr
+向福康 3 nr
+向秀丽 3 nr
+向秀注 2 nr
+向秀相 2 nr
+向程英 2 nr
+向紫文 18 nr
+向紫鹃 6 nr
+向红基 3 nr
+向红妆 2 nr
+向红娘子 2 nr
+向红河 3 nr
+向红玉 2 nr
+向红端 5 nr
+向纪晓 2 nr
+向绣桔 2 nr
+向继东 5 nr
+向罗虎 2 nr
+向美商 2 nr
+向群丐 2 nr
+向群蜂 2 nr
+向群豪 9 nr
+向群道 2 nr
+向聚义 2 nr
+向聚君 2 nr
+向背 43 v
+向舜天 3 nr
+向舷外 3 vn
+向若而叹 3 nr
+向英王 4 nr
+向荣彩 4 nr
+向荣禄 3 nr
+向莱顿 4 nr
+向莺儿 3 nr
+向萧峰 7 nr
+向虚竹 21 nr
+向襄邑 3 nr
+向西伸 3 nr
+向西军 2 nr
+向西华 2 nr
+向西南方 3 nr
+向西山 2 nr
+向西流 5 nr
+向西疾 11 nr
+向西行 2 nr
+向西驰 2 nr
+向觉华 2 nr
+向触 3 v
+向警予 3 v
+向谷主 2 nr
+向豫州 2 nr
+向豫湘 2 nr
+向贤昆 2 nr
+向贵帮 2 nr
+向贾珍 2 nr
+向辅臣 2 nr
+向辛楣 2 nr
+向辽军 4 nr
+向辽圣 2 nr
+向达尔 2 nr
+向远海 5 nr
+向迩 3 nr
+向量 248 n
+向量丛 3 nr
+向量分析 3 n
+向量地图 3 nz
+向量场 3 n
+向量指令 3 n
+向量量化 3 v
+向金主 2 nr
+向金军 2 nr
+向金国 3 nr
+向金朝 4 nr
+向钟灵 2 nr
+向钱看 10 nr
+向银联 8 nr
+向锡兰 2 nr
+向锺兆 3 nr
+向锺氏 3 nr
+向镇南 2 nr
+向长安 10 nr
+向长辛 2 nr
+向问天 3 nr
+向阳 671 nr
+向阳区 3 ns
+向阳坡 2 nr
+向阳处 9 nr
+向阳大道 3 nr
+向阳花 3 nr
+向阳路 3 nr
+向阳镇 3 nr
+向阿公 2 nr
+向阿琪 4 nr
+向阿紫 3 nr
+向陆 5 v
+向陇海 2 nr
+向陈柱子 2 nr
+向隅 3 nrt
+向隅而泣 3 i
+向雪妍 3 nr
+向雪梅 2 nr
+向青青 3 nr
+向靖蓉 2 nr
+向静嘉 2 nr
+向风坡 5 nr
+向风慕义 3 nr
+向风清 2 nr
+向风针 3 nr
+向风际 4 n
+向香兰 4 nr
+向香帅 4 nr
+向黛玉 11 nr
+向龙木 2 nr
+吒 34 g
+吓 4156 v
+吓一跳 3 v
+吓不了 3 v
+吓不倒 3 v
+吓了一跳 3 v
+吓人 246 v
+吓住 3 v
+吓倒 226 v
+吓傻 3 v
+吓出 3 v
+吓出病来 3 vn
+吓到 3 v
+吓呆 37 v
+吓呆了 3 y
+吓哭 3 v
+吓唬 275 v
+吓唬人 3 vn
+吓坏 330 v
+吓怕 3 v
+吓成 3 v
+吓昏 17 v
+吓来吓去 3 z
+吓死 3 v
+吓死人 3 v
+吓瘫 3 v
+吓破 3 v
+吓破胆 3 v
+吓老 3 a
+吓跑 73 v
+吓退 3 v
+吓阻 3 v
+吓阻力量 3 v
+吔 7 zg
+吕 935 nr
+吕七先生 9 nr
+吕不韦 19 nr
+吕世明 2 nr
+吕中因 2 nr
+吕丽萍 3 nr
+吕之悦 146 nr
+吕二嫂 24 nr
+吕京金 2 nr
+吕仙祠 2 nr
+吕传赞 2 nr
+吕伯望 6 nr
+吕伯道 2 nr
+吕佩师 2 nr
+吕保维 3 nr
+吕元事 4 nr
+吕元晤 2 nr
+吕元祜 3 nr
+吕兆龙 4 nr
+吕先生 23 nr
+吕光伐 2 nr
+吕光部 2 nr
+吕克托 32 nr
+吕克昂 4 nr
+吕克莱 2 nr
+吕克贝 2 nr
+吕公望 2 nr
+吕公祠 19 nr
+吕公著 5 nr
+吕兴贵 17 nr
+吕凤子 5 nr
+吕剧 31 n
+吕勒奥 7 nr
+吕南老 4 nr
+吕厚民 2 nr
+吕叔湘 13 nr
+吕后之 3 nr
+吕嘉问 3 nr
+吕四娘 3 nr
+吕四港 2 nr
+吕国增 4 nr
+吕国庆 2 nr
+吕国祥 2 nr
+吕国蔚 3 nr
+吕城坝 2 nr
+吕大临 10 nr
+吕大乐 2 nr
+吕大人 5 nr
+吕大帅 5 nr
+吕大渝 3 nr
+吕大防 2 nr
+吕天成 8 nr
+吕太后 6 nr
+吕夷简 4 nr
+吕奇恩 4 nr
+吕奉先 4 nr
+吕好问 4 nr
+吕始东 64 nr
+吕子明 2 nr
+吕季调 16 nr
+吕学俭 13 nr
+吕学海 2 nr
+吕安系 2 nr
+吕安题凤 3 n
+吕宋 21 nr
+吕宋岛 51 nr
+吕宋海 2 nr
+吕宋烟 3 nr
+吕宏强 4 nr
+吕小品 3 nr
+吕小妹 27 nr
+吕尼科 16 nr
+吕布 332 nr
+吕布乃 6 nr
+吕布之 10 nr
+吕布乘 2 nr
+吕布令 2 nr
+吕布入 3 nr
+吕布兰 4 nr
+吕布分 2 nr
+吕布寨 2 nr
+吕布射 3 nr
+吕布引 5 nr
+吕布必 6 nr
+吕布来 5 nr
+吕布袭 3 nr
+吕布见 3 nr
+吕布败 2 nr
+吕布领 3 nr
+吕师叔 7 nr
+吕师囊 13 nr
+吕师弟 7 nr
+吕师爷 3 nr
+吕希贤 14 nr
+吕庆龙 2 nr
+吕建中 3 nr
+吕彦直 4 nr
+吕志伊 2 nr
+吕志名 2 nr
+吕志星 4 nr
+吕忠梅 256 nr
+吕思勉 3 nr
+吕思诚 2 nr
+吕惠卿 34 nr
+吕才曾 2 nr
+吕振羽 14 nr
+吕擎点 2 nr
+吕擎阳 4 nr
+吕文德 54 nr
+吕文焕 40 nr
+吕斯百 4 nr
+吕日周 3 nr
+吕景亚 3 nr
+吕有慧 3 nr
+吕望 17 nr
+吕本中 3 nr
+吕本元 2 nr
+吕本富 8 nr
+吕根岛 2 nr
+吕格达 16 nr
+吕桑德 32 nr
+吕梁 64 nr
+吕梁地区 2 ns
+吕梁山 30 nr
+吕梁山区 2 ns
+吕梁市 3 ns
+吕欠斯 2 nr
+吕歇尔 2 nr
+吕正义 7 nr
+吕正平 32 nr
+吕正操 10 nr
+吕武操莽 3 nr
+吕毅中 3 nr
+吕氏家族 4 nr
+吕氏春秋 3 nr
+吕洞宾 41 nr
+吕清非 2 nr
+吕温侯 2 nr
+吕潭镇 2 nr
+吕爱红 17 nr
+吕特维 4 nr
+吕用之 16 nr
+吕留良 54 nr
+吕登明 7 nr
+吕碧城 50 nr
+吕祖善 3 nr
+吕祖庵 7 nr
+吕祖殿 5 nr
+吕祖谦 12 nr
+吕秀莲 15 nr
+吕秀菱 3 nr
+吕第亚 48 nr
+吕米亚 32 nr
+吕精义 2 nr
+吕素初 3 nr
+吕纯操 2 nr
+吕纯阳 5 nr
+吕绍刚 2 nr
+吕维棋 28 nr
+吕维祺 59 nr
+吕聪敏 3 nr
+吕良伟 3 nr
+吕艺生 3 nr
+吕萨克 36 nr
+吕葆中 3 nr
+吕蒙 78 nr
+吕蒙乘 2 nr
+吕蒙引 4 nr
+吕蒙正 11 nr
+吕蒙袭 2 nr
+吕西安 4 nr
+吕西斯 3 nr
+吕览 2 nr
+吕诚昭 8 nr
+吕调阳 197 nr
+吕贝克 18 nr
+吕赫若 2 nr
+吕达嵘 3 nr
+吕通打 2 nr
+吕通相 3 nr
+吕通膝 2 nr
+吕邦列 12 nr
+吕金丹 3 nr
+吕阁老 6 nr
+吕顺保 2 nr
+吕颂贤 3 nr
+吕飞杰 2 nr
+吕香阁 31 nr
+吖 21 x
+吖啶 3 n
+吖啶橙 3 n
+吖啶黄 3 n
+吖啶黄素 3 n
+吖嗪 3 n
+吗 21245 y
+吗啉 7 n
+吗啡 89 n
+吗啡中毒 3 n
+吗啡烷 3 n
+吘 43 zg
+吙 52 zg
+君 3153 nz
+君不见 32 l
+君临 42 ns
+君临天下 3 l
+君主 2747 n
+君主专制 138 l
+君主专政 3 n
+君主主义 3 nz
+君主制 236 n
+君主国 38 ns
+君主政体 3 n
+君主政治 3 n
+君主权 3 n
+君主立宪 120 n
+君主立宪制 100 nz
+君主立宪派 12 nz
+君主队 3 n
+君信 2 nz
+君合 7 nz
+君命无二 3 l
+君唱臣和 3 i
+君圣臣贤 3 nr
+君士坦丁 68 nz
+君士坦丁堡 242 nz
+君子 847 n
+君子一言 17 l
+君子三戒 3 n
+君子之交 3 l
+君子之交淡如水 3 i
+君子兰 17 nz
+君子协定 28 nz
+君子固穷 3 l
+君子国 4 ns
+君子好逑 5 i
+君子成人之美 5 nz
+君子爱财 3 l
+君安 31 nz
+君山 93 ns
+君山区 2 ns
+君暗臣蔽 3 i
+君权 337 n
+君权神授 3 n
+君王 872 nz
+君臣 445 n
+君臣佐使 3 nr
+君臣父子 3 nr
+君辱臣死 3 i
+君集 4 n
+君音 8 n
+吜 3 zg
+吝 25 a
+吝啬 117 a
+吝啬鬼 16 n
+吝惜 57 v
+吝舍 3 n
+吝色 2 n
+吞 1112 v
+吞下 3 v
+吞下去 3 v
+吞下来 3 l
+吞了下去 3 i
+吞云吐雾 16 i
+吞刀刮肠 3 i
+吞刀吐火 3 i
+吞到 3 v
+吞剑者 3 n
+吞剥 3 v
+吞占 3 v
+吞口水 3 i
+吞吐 140 v
+吞吐能力 3 i
+吞吐量 507 n
+吞吞 3 v
+吞吞吐吐 189 i
+吞咽 154 v
+吞咽困难 3 l
+吞噬 255 v
+吞噬作用 3 l
+吞噬细胞 24 l
+吞声 27 n
+吞声忍气 3 i
+吞声忍泪 3 i
+吞声饮恨 3 i
+吞声饮气 3 i
+吞声饮泣 3 i
+吞并 315 v
+吞恨 3 v
+吞掉 3 v
+吞服 41 v
+吞武里 7 l
+吞没 197 v
+吞涎症 3 i
+吞火者 3 n
+吞灭 19 v
+吞炭漆身 3 n
+吞符翕景 3 vn
+吞纸抱犬 3 i
+吞舟之鱼 5 i
+吞舟是漏 3 i
+吞舟漏网 3 i
+吞蚀 18 v
+吞言咽理 3 l
+吞进 3 v
+吞进去 3 v
+吞金 3 n
+吞风饮雨 3 i
+吞食 155 v
+吞食天地 3 i
+吞食鱼 3 l
+吟 614 v
+吟味 3 v
+吟咏 37 v
+吟哦 48 v
+吟唱 79 v
+吟游 3 v
+吟花咏柳 3 ns
+吟诗 133 v
+吟诗作对 3 i
+吟诵 74 v
+吟风咏月 3 vn
+吟风弄月 6 i
+吠 267 vg
+吠叫 3 n
+吠声 3 n
+吠声吠影 3 vn
+吠形吠声 3 z
+吠影吠声 3 z
+吠檀多 7 n
+吠舍 19 n
+吠舍离 2 n
+吠陀 3 n
+吠非其主 3 n
+吡 86 n
+吡咯 25 nz
+吡咯啉 3 n
+吡咯烷 3 n
+吡咯烷酮 2 n
+吡哆胺 3 nz
+吡哆醇 3 nz
+吡哆醛 3 nz
+吡哌酸 3 nz
+吡唑 6 nz
+吡唑酮 3 nz
+吡啶 63 n
+吡啶啉 3 n
+吡啶基 3 nz
+吡啶甲酸 3 nz
+吡啶酮 2 nz
+吡喃 25 n
+吡喃糖 7 n
+吡嗪 16 n
+吣 34 v
+吥 5 zg
+否 1000 zg
+否决 276 v
+否决制 3 v
+否决权 75 v
+否决票 4 v
+否决者 3 n
+否则 4209 c
+否则请 3 i
+否去泰来 3 i
+否定 1459 v
+否定一切 3 i
+否定句 3 n
+否定性 14 n
+否定词 3 i
+否往泰来 3 i
+否极泰回 3 i
+否极泰来 15 i
+否极阳回 3 i
+否终则泰 3 i
+否终复泰 3 i
+否认 986 v
+否诀 3 v
+吧 25526 y
+吧台 18 n
+吧哒 2 o
+吧唧 11 o
+吧嗒 53 o
+吨 5810 m
+吨位 140 n
+吨公里 8 q
+吨数 5 n
+吨粮 3 n
+吨粮县 2 n
+吨粮田 258 n
+吨级 77 b
+吨重 3 b
+吩 39 v
+吩咐 3208 v
+吩嗪 3 n
+含 6950 v
+含下 3 v
+含义 1339 n
+含义丰富 3 nr
+含仁怀义 3 nr
+含住 3 v
+含入 3 v
+含入口中 3 i
+含入口内 3 n
+含冤 56 v
+含冤九泉 3 i
+含冤受屈 3 i
+含冤而死 3 i
+含冤而终 3 i
+含冤莫白 3 i
+含冤负屈 3 i
+含冰量 3 n
+含凝胶 3 n
+含到 3 v
+含劲 2 a
+含化 2 v
+含含糊糊 76 z
+含哺鼓腹 3 nr
+含商咀征 3 i
+含在口中 3 i
+含在口内 3 i
+含垢 2 n
+含垢包羞 3 i
+含垢匿瑕 3 i
+含垢弃瑕 3 i
+含垢忍污 3 i
+含垢忍耻 3 i
+含垢忍辱 2 i
+含垢纳污 3 i
+含垢藏瑕 3 i
+含垢藏疾 3 i
+含宫咀征 3 i
+含山 5 n
+含山县 2 ns
+含怒 15 v
+含怨 3 v
+含怨而死 3 i
+含怨而终 3 i
+含恨 12 v
+含恨在心 3 i
+含恨而死 3 i
+含恨而终 3 i
+含悲 3 a
+含情 16 n
+含情脉脉 34 i
+含意 309 v
+含愤 3 a
+含愧 3 v
+含时微扰 3 l
+含明隐迹 3 i
+含有 2856 v
+含有本 2 n
+含权 4 n
+含毫砚墨 3 nr
+含气边界 3 n
+含气面积 3 n
+含氟 2 n
+含氟量 14 n
+含氢 5 n
+含氢指数 3 n
+含氧 5 n
+含氧酸 30 n
+含氧量 26 n
+含氮 3 n
+含氯氟烃 3 n
+含氰苷 3 nz
+含水 71 n
+含水分 3 n
+含水层 62 n
+含水率 12 n
+含水率仪 3 n
+含水量 86 n
+含汞 2 n
+含污忍垢 3 i
+含沙 3 n
+含沙射影 21 n
+含沙影射 3 n
+含沙量 171 n
+含油 103 n
+含油层 3 n
+含油率 3 n
+含油量 33 n
+含泪 210 n
+含淀粉 3 n
+含混 70 v
+含混不清 21 i
+含漱剂 2 n
+含片 12 n
+含牙囊肿 3 n
+含牙带角 3 n
+含牙戴角 3 i
+含猪油 3 n
+含珠 2 n
+含瑕积垢 3 v
+含疚 3 a
+含盐 2 n
+含盐度 47 n
+含盐量 48 n
+含着泪 3 n
+含硫 17 n
+含硫分 3 n
+含硫量 4 n
+含硼 4 n
+含碳 2 n
+含碳量 70 n
+含磷 9 n
+含磷量 4 n
+含章天挺 3 nr
+含章挺生 3 nr
+含笑 376 v
+含笑九泉 10 nr
+含笑入地 3 i
+含笑而死 3 i
+含笑而终 3 i
+含答案 3 n
+含糊 443 a
+含糊不明 3 i
+含糊不清 3 l
+含糊其词 14 i
+含糊其辞 84 i
+含糊地 3 z
+含糖 9 n
+含糖量 31 n
+含羞 57 a
+含羞草 32 n
+含而不发 3 i
+含而不露 3 i
+含胡 3 nr
+含致癌 3 n
+含苞 9 nr
+含苞待放 19 i
+含苞欲放 10 i
+含英咀华 3 i
+含菁咀华 3 z
+含菌细胞 3 n
+含蓄 321 n
+含蓄地 3 n
+含蓼问疾 3 nr
+含蕴 6 n
+含蜡 3 n
+含血 3 v
+含血喷人 6 n
+含血噀人 3 nz
+含血潠人 3 nz
+含起 3 v
+含辛忍苦 3 i
+含辛茹若 3 i
+含辛茹苦 39 i
+含鄱口 2 ns
+含酒精 3 n
+含酸 3 n
+含量 2926 n
+含金 3 n
+含金量 123 n
+含钒 2 n
+含钙 3 n
+含钙量 22 n
+含钡 2 n
+含铁 20 n
+含铅 24 nz
+含铅量 3 n
+含铬 2 n
+含银 3 n
+含锌 3 n
+含锌量 3 n
+含锰 4 n
+含镁 3 n
+含霜履雪 3 i
+含饴弃孙 3 i
+含饴弄孙 3 i
+含齿戴发 3 i
+听 45776 v
+听不出 3 v
+听不出来 3 v
+听不得 28 v
+听不懂 3 v
+听不清 3 v
+听不见 3 v
+听不进 3 v
+听不进去 3 v
+听丘 3 n
+听丹 2 v
+听之任之 48 i
+听书网 3 n
+听事 3 v
+听人摆布 3 v
+听人穿鼻 3 i
+听从 508 v
+听从命令 3 i
+听从指挥 3 i
+听任 134 v
+听众 555 n
+听众席 6 v
+听会 3 v
+听作 3 v
+听作是 3 n
+听信 185 v
+听候 297 v
+听候处理 3 n
+听候通知 3 n
+听其自流 3 i
+听其自然 11 i
+听其言 26 i
+听写 67 v
+听写测验 3 n
+听决 3 v
+听凭 78 v
+听凭处置 3 i
+听出 3 v
+听到 5294 v
+听力 526 n
+听力测验 3 n
+听力计 3 i
+听厌 3 v
+听取 2984 v
+听取意见 3 i
+听取批评 3 l
+听取报告 3 n
+听取汇报 3 n
+听后感 3 n
+听听 865 v
+听听看 3 v
+听听课 2 v
+听命 94 v
+听命于 3 v
+听声辨位 3 n
+听天由命 101 i
+听太后 3 nr
+听头 3 v
+听子 3 n
+听完 3 v
+听宝玉 8 nr
+听审 2 v
+听宫 3 v
+听小骨 3 nr
+听岩 2 n
+听差 33 v
+听得出 3 v
+听得出来 3 v
+听得懂 3 v
+听得见 3 v
+听惯 3 n
+听懂 219 v
+听戏 65 v
+听成 3 v
+听政 44 v
+听明 3 v
+听来 3 v
+听来听去 3 i
+听歌 3 v
+听歌曲 3 nr
+听歌网 3 i
+听泉 2 n
+听洪 2 v
+听清 3 v
+听琴 4 v
+听的歌 3 n
+听盈盈 2 nr
+听相声 3 i
+听碟 3 n
+听神经 12 n
+听程 2 n
+听筒 62 n
+听管 3 v
+听罢 241 v
+听者 110 n
+听者有心 3 i
+听而不闻 62 i
+听腻 3 a
+听良 2 v
+听装 3 v
+听见 4507 v
+听觉 338 v
+听觉区 3 n
+听觉反射 3 l
+听觉定位 3 n
+听觉掩蔽 3 nr
+听觉敏度 3 n
+听觉理论 3 n
+听觉疲劳 3 vn
+听觉登记 3 nr
+听觉编码 3 l
+听觉范围 3 n
+听训 3 v
+听讲 73 v
+听讼 10 v
+听证 79 v
+听证会 116 n
+听诊 31 v
+听诊器 31 n
+听译 3 v
+听话 455 v
+听话儿 3 n
+听话者 3 n
+听说 5887 v
+听说读写 3 i
+听课 105 v
+听课者 2 n
+听课证 3 n
+听起 3 v
+听辨 5 v
+听进 3 v
+听道 3 v
+听错 95 v
+听闻 84 n
+听阈 11 n
+听雨轩 3 nr
+听雷 3 v
+听青青 2 nr
+听音 3 n
+听音器 2 n
+听风听水 3 i
+听风是雨 3 i
+听骨 15 n
+听鹂 4 n
+吭 269 zg
+吭哧 47 o
+吭声 382 v
+吭气 16 v
+吮 163 v
+吮乳 3 v
+吮促 3 v
+吮吸 97 v
+吮吸反射 3 v
+吮墨 3 v
+吮疽舐痔 3 n
+吮痈舐痔 3 n
+启 1279 v
+启东 95 ns
+启东县 3 ns
+启东市 4 ns
+启事 82 v
+启功 41 v
+启动 1810 vn
+启动器 6 l
+启动子 3 l
+启动市场 3 n
+启动时 3 l
+启动易 3 l
+启动盘 4 n
+启动装置 3 n
+启动费 3 vn
+启动资金 3 l
+启动项 3 n
+启发 745 v
+启发式 26 l
+启发式程序 2 l
+启发性 24 n
+启发法 3 n
+启发者 3 n
+启口 3 vn
+启奏 245 v
+启始 3 v
+启子 3 n
+启宠纳侮 3 n
+启封 28 v
+启幕 4 v
+启开 21 v
+启德 272 nrt
+启德机场 3 ns
+启悟 3 v
+启新 14 v
+启明 25 v
+启明学校 3 l
+启明星 19 nz
+启智 2 v
+启智班 3 n
+启殿 3 ns
+启瓶器 3 l
+启用 858 v
+启示 511 v
+启示录 32 n
+启禀 3 v
+启程 279 n
+启美 3 ns
+启聪 3 nz
+启聪学校 3 l
+启航 68 v
+启蒙 352 v
+启蒙教育 3 l
+启蒙者 18 n
+启蒙运动 122 l
+启行 3 v
+启衡 3 v
+启辉器 3 nz
+启运 11 v
+启迪 141 nz
+启锚 5 v
+启门 3 v
+启闭 34 v
+启闭机 3 n
+启齿 28 v
+吱 425 o
+吱吱 15 o
+吱吱作响 3 n
+吱吱叫 3 n
+吱吱响 3 n
+吱吱响声 3 n
+吱吱喳喳 14 o
+吱吱嘎嘎 10 o
+吱吱声 5 n
+吱吱悠悠 3 n
+吱吾 3 v
+吱呀 41 o
+吱呀呀 3 o
+吱哩哇啦 3 n
+吱唔 3 o
+吱喳 3 o
+吱声 140 v
+吱溜 2 o
+吲 20 n
+吲哚 41 n
+吲哚霉素 3 v
+吴 7711 nr
+吴一氓 17 nr
+吴三呈 13 nr
+吴三国 7 nr
+吴三挂 7 nr
+吴三桂 2546 nr
+吴下阿蒙 3 nr
+吴与晋 3 nr
+吴与楚 2 nr
+吴世子 3 nr
+吴世道 3 nr
+吴世雄 7 nr
+吴丙丁 18 nr
+吴东梅 5 nr
+吴中 37 nr
+吴中公 2 nr
+吴中兵 3 nr
+吴中军 18 nr
+吴中区 3 nr
+吴中四 4 nr
+吴中秋 5 nr
+吴中行 91 nr
+吴中路 3 nr
+吴丹红 2 nr
+吴为一 4 nr
+吴为仰 2 nr
+吴为会 4 nr
+吴为则 2 nr
+吴为刚 3 nr
+吴为原 2 nr
+吴为听 2 nr
+吴为回 2 nr
+吴为好 2 nr
+吴为学 2 nr
+吴为家 3 nr
+吴为常 2 nr
+吴为心 2 nr
+吴为才 5 nr
+吴为拥 2 nr
+吴为本 3 nr
+吴为熬 2 nr
+吴为真 3 nr
+吴为缩 2 nr
+吴为者 2 nr
+吴为能 2 nr
+吴为转 4 nr
+吴为那 6 nr
+吴为问 2 nr
+吴主传 2 nr
+吴主孙 16 nr
+吴乃文 2 nr
+吴乃武 2 nr
+吴之书 2 nr
+吴之策 2 nr
+吴之荣 165 nr
+吴之计 3 nr
+吴之议 3 nr
+吴习洲 5 nr
+吴书的 2 nrfg
+吴书记 4 nr
+吴二人 9 nr
+吴二叔 2 nr
+吴二哥 5 nr
+吴二国 2 nr
+吴于廑 8 nr
+吴于稷 2 nr
+吴亚明 7 nr
+吴亦侠 2 nr
+吴京安 3 nr
+吴亮嗣 4 nr
+吴亮平 2 nr
+吴人易 2 nr
+吴仁宝 2 nr
+吴从斌 2 nr
+吴仕期 4 nr
+吴仞之 3 nr
+吴令英 25 nr
+吴仪 327 nr
+吴仲华 4 nr
+吴仲平 42 nr
+吴伐越 7 nr
+吴伟业 35 nr
+吴伟安 38 nr
+吴伟强 3 nr
+吴伟贤 4 nr
+吴传玉 4 nr
+吴传钧 2 nr
+吴伯萧 3 nr
+吴伯雄 10 nr
+吴作乐 2 nr
+吴作人 11 nr
+吴作栋 14 nr
+吴作贺 2 nr
+吴佩孚 247 nr
+吴佩文 3 nr
+吴佩珍 93 nr
+吴侯乃 2 nr
+吴侯之 4 nr
+吴侯执 2 nr
+吴俊光 2 nr
+吴俊明 10 nr
+吴信泉 8 nr
+吴修平 2 nr
+吴倩莲 3 nr
+吴健彰 3 nr
+吴健豪 3 nr
+吴健雄 28 nr
+吴元华 126 nr
+吴元年 18 nr
+吴元德 3 nr
+吴元济 25 nr
+吴元炳 2 nr
+吴元载 2 nr
+吴先生 32 nr
+吴光胜 33 nr
+吴克善 3 nr
+吴克坚 3 nr
+吴克群 3 nr
+吴入蜀 2 nr
+吴全节 6 nr
+吴公公 9 nr
+吴公子 3 nr
+吴六奇 169 nr
+吴六破 3 nr
+吴兰修 2 nr
+吴关琦 6 nr
+吴兴 87 nr
+吴兴人 10 nr
+吴兴刘 2 nr
+吴兴区 3 nr
+吴兴华 9 nr
+吴兴县 7 nr
+吴兴国 3 ns
+吴兵尽 3 nr
+吴兵屯 2 nr
+吴兵折 2 nr
+吴兵皆 3 nr
+吴兵见 3 nr
+吴兵远 3 nr
+吴兵骤 2 nr
+吴冀南 3 nr
+吴军兵 3 nr
+吴军北 3 nr
+吴军溯 2 nr
+吴军遂 2 nr
+吴军门 2 nr
+吴冠中 44 nr
+吴冠英 3 nr
+吴冷西 8 nr
+吴几康 2 nr
+吴凤工专 3 nr
+吴凤庙 3 nr
+吴则虞 3 nr
+吴刚伐 4 nr
+吴刚伐桂 3 nr
+吴利明 2 nr
+吴劲草 38 nr
+吴升便 6 nr
+吴升半 2 nr
+吴升叹 4 nr
+吴升听 2 nr
+吴升好 2 nr
+吴升心 2 nr
+吴升见 2 nr
+吴升那 2 nr
+吴华品 2 nr
+吴南轩 3 nr
+吴卫东 3 nr
+吴卫凤 2 nr
+吴印咸 9 nr
+吴厂长 2 nr
+吴历合 2 nr
+吴县 206 ns
+吴县人 139 nr
+吴县市 3 ns
+吴县月 2 nr
+吴县西 2 nr
+吴又见 2 nr
+吴友如 3 nr
+吴双艺 3 nr
+吴君如 3 nr
+吴启华 3 nr
+吴启迪 3 nr
+吴哥 69 nr
+吴哥城 8 nr
+吴哥寺 12 nr
+吴哥窟 11 ns
+吴哥通 2 nr
+吴唯佳 2 nr
+吴喜公 2 nr
+吴喜林 3 nr
+吴喜鹏 2 nr
+吴嘉丽 3 nr
+吴嘉禾 2 nr
+吴四哥 2 nr
+吴四长老 9 nr
+吴因唐 2 nr
+吴国 174 ns
+吴国众 2 nr
+吴国伦 261 nr
+吴国公子 2 nr
+吴国剑 20 nr
+吴国华 2 nr
+吴国和 2 nr
+吴国大 2 nr
+吴国太 10 nr
+吴国将军 2 nr
+吴国忠 14 nr
+吴国敬 3 nr
+吴国栋 42 nr
+吴国桢 4 nr
+吴国清 2 nr
+吴国祯 2 nr
+吴国终 3 nr
+吴国铸 2 nr
+吴坎笑 6 nr
+吴坪枫 8 nr
+吴城镇 4 nr
+吴基传 257 nr
+吴堡县 3 nr
+吴士宏 23 nr
+吴士深 2 nr
+吴壮达 55 nr
+吴大人 7 nr
+吴大叔 5 nr
+吴大哥 31 nr
+吴大娘 2 nr
+吴大帝 16 nr
+吴大澄 2 nr
+吴大猷 7 nr
+吴大维 3 nr
+吴大鹏 43 nr
+吴天保 4 nr
+吴天墀 16 nr
+吴天天 3 nr
+吴天德 8 nr
+吴天智 5 nr
+吴天祚 6 nr
+吴天祥 7 nr
+吴太后 5 nr
+吴太夫人 6 nr
+吴太子入 2 nr
+吴太平 2 nr
+吴夫人 6 nr
+吴头楚 2 nr
+吴头楚尾 3 nr
+吴奇伟 10 nr
+吴奇民 3 nr
+吴奇隆 3 nr
+吴奈温 8 nr
+吴妈妈 4 nr
+吴姐姐 2 nr
+吴婉客 4 nr
+吴婉容 115 nr
+吴婵娟 5 nr
+吴子 34 nr
+吴子兰 5 nr
+吴子宜 2 nr
+吴子注 2 nr
+吴孟明 59 nr
+吴孟超 8 nr
+吴孟达 3 nr
+吴季方 6 nr
+吴学周 2 nr
+吴学谦 45 nr
+吴宇森 4 nr
+吴宇风 6 nr
+吴安年 3 nr
+吴宏权 12 nr
+吴宏达 3 nr
+吴宗国 12 nr
+吴宗宪 8 nr
+吴官正 5 nr
+吴定富 261 nr
+吴宝宇 3 nr
+吴宝康 2 nr
+吴宝柱 34 nr
+吴家丽 3 nr
+吴家乐 3 nr
+吴家包村 3 nr
+吴家可 2 nr
+吴家山 3 nr
+吴家庄 14 nr
+吴家样 2 nr
+吴家桥 3 nr
+吴家沟 4 nr
+吴家砖 4 nr
+吴家馨 32 nr
+吴家骧 3 nr
+吴寄南 8 nr
+吴寿章 2 nr
+吴将军 22 nr
+吴将爷 3 nr
+吴小姐 15 nr
+吴小平 3 nr
+吴小莉 15 nr
+吴少勋 256 nr
+吴少诚 2 nr
+吴少阳 10 nr
+吴尔夫 11 nr
+吴尚峰 2 nr
+吴山之 3 nr
+吴山友 3 nr
+吴山圆 43 nr
+吴山越 7 nr
+吴岱融 3 nrfg
+吴川县 3 ns
+吴川市 6 ns
+吴巨姓 3 nr
+吴巨慧 2 nr
+吴市之箫 3 nr
+吴市吹箫 3 nr
+吴师伐 2 nr
+吴师叔 12 nr
+吴师弟 12 nr
+吴师机 4 nr
+吴师败 2 nr
+吴师道 3 nr
+吴帝孙 5 nr
+吴帝杨 4 nr
+吴带当风 6 nr
+吴平西 19 nr
+吴广为 3 nr
+吴广义 2 nr
+吴广便 2 nr
+吴广林 3 nr
+吴庆龙 2 nr
+吴应寿 4 nr
+吴应熊 284 nr
+吴府尊 3 nr
+吴庭艳 14 nr
+吴延陵 2 nr
+吴廷康 3 nr
+吴廷英 47 nr
+吴建业 6 nr
+吴建号 2 nr
+吴建屏 3 nr
+吴建平 3 nr
+吴建民 145 nr
+吴建豪 3 nr
+吴式芬 8 nr
+吴引兵 2 nr
+吴彦祖 5 nr
+吴彩云 2 nr
+吴征镒 5 nr
+吴德仁 5 nr
+吴德馨 256 nr
+吴必虎 3 nr
+吴志刚 2 nr
+吴志剑 3 nr
+吴志强 3 nr
+吴志文 2 nr
+吴忠市 20 nr
+吴思礼 18 nr
+吴思远 3 nr
+吴恒权 4 nr
+吴恩琪 3 nr
+吴恩裕 2 nr
+吴惟忠 22 nr
+吴慧琴 2 nr
+吴懿四 3 nr
+吴懿引 3 nr
+吴成典 2 nr
+吴成方 9 nr
+吴成良 2 nr
+吴承志 5 nr
+吴承恩 21 nr
+吴承明 2 nr
+吴承瑛 123 nr
+吴承禧 2 nr
+吴拉茂 4 nr
+吴振华 2 nr
+吴掌柜 2 nr
+吴提督 3 nr
+吴摩西 689 nr
+吴支谦 3 nr
+吴改吴 2 nr
+吴敏茜 3 nr
+吴敏霞 18 nr
+吴敦义 5 nr
+吴敦夫 5 nr
+吴敬恒 7 nr
+吴敬梓 3 nr
+吴敬琏 44 nr
+吴数德 3 nr
+吴文俊 33 nr
+吴文凯 6 nr
+吴文学 4 nr
+吴文斌 7 nr
+吴文艳 5 nr
+吴文英 14 nr
+吴文藻 4 nr
+吴文赏 4 nr
+吴斌庆 3 nr
+吴新丝 2 nr
+吴新刚 177 nr
+吴新登 12 nr
+吴方言 4 nr
+吴方辉 3 nr
+吴旗县 7 nr
+吴日生 4 nr
+吴时来 5 nr
+吴昌华 2 nr
+吴昌文 2 nr
+吴昌时 6 nr
+吴昌硕 59 nr
+吴昌顺 2 nr
+吴明彻 6 nr
+吴明熹 2 nr
+吴春晗 2 nr
+吴显国 9 nr
+吴晓东 5 nr
+吴晓敏 3 nr
+吴晓明 3 nr
+吴晓波 4 nr
+吴晓灵 27 nr
+吴晓邦 4 nr
+吴晓铃 2 nr
+吴晔丽 5 nr
+吴晗 80 nr
+吴晗因 2 nr
+吴晗译 2 nr
+吴景旭 2 nr
+吴景略 3 nr
+吴景超 8 nr
+吴晶晶 3 nr
+吴智节 3 nr
+吴曾通 3 nr
+吴月娘 7 nr
+吴月琴 52 nr
+吴月辉 2 nr
+吴有一 3 nr
+吴有训 13 nr
+吴柏英 3 nr
+吴栅子 2 nr
+吴树平 10 nr
+吴树青 2 nr
+吴桂芳 5 nr
+吴桂贤 2 nr
+吴桥县 7 nr
+吴梅村 5 nr
+吴梦玲 44 nr
+吴梨花 2 nr
+吴楚 275 nr
+吴楚七 9 nr
+吴楚七国之乱 25 i
+吴楚交 3 nr
+吴楚兵 2 nr
+吴楚军 9 nr
+吴楚帆 2 nr
+吴楚材 2 nr
+吴楼村 2 nr
+吴次尾 16 nr
+吴正德 3 nr
+吴正治 2 nr
+吴毅将 3 nr
+吴氏仙 3 nr
+吴永刚 3 nr
+吴永真 2 nr
+吴永磷 2 nr
+吴汝义 533 nr
+吴汝孝 13 nr
+吴汝康 3 nr
+吴汝纶 2 nr
+吴江 86 nr
+吴江县 20 nr
+吴江市 13 ns
+吴江梅 2 nr
+吴江派 2 nr
+吴沃尧 4 nr
+吴法宪 26 nr
+吴泽洲 4 nr
+吴泽霖 4 nr
+吴洪乐 8 nr
+吴洪林 3 nr
+吴洪裕 2 nr
+吴派舟 3 nr
+吴浊流 9 nr
+吴海军 8 nr
+吴海燕 3 nr
+吴淑珍 3 nrfg
+吴淞 76 nr
+吴淞军港 2 nr
+吴淞区 2 nr
+吴淞口 283 nr
+吴淞基 4 nr
+吴淞江 46 nr
+吴淞西 2 nr
+吴淞青 2 nr
+吴淡如 3 nr
+吴淳夫 8 nr
+吴清源 6 nr
+吴湖帆 5 nr
+吴湘韩 2 nr
+吴炳著 2 nr
+吴焕先 2 nr
+吴燕生 256 nr
+吴爱珍 80 nr
+吴爱英 3 nr
+吴牛喘月 2 i
+吴献成 18 nr
+吴率军 3 nr
+吴玉华 3 nr
+吴玉桂 2 nr
+吴玉章 35 nr
+吴玉芳 3 nr
+吴玉霞 2 nr
+吴王光 5 nr
+吴王刘 2 nr
+吴王夫 44 nr
+吴王孙 3 nr
+吴班引 2 nr
+吴理真 3 nr
+吴琴木 2 nr
+吴生学 2 nr
+吴用 155 nr
+吴用分 2 nr
+吴用劝 3 nr
+吴用听 3 nr
+吴用唤 3 nr
+吴用堰 2 nr
+吴用授 2 nr
+吴用正 2 nr
+吴用知 2 nr
+吴用笑 8 nr
+吴用见 5 nr
+吴用谏 9 nr
+吴田玉 3 nr
+吴登峰 6 nr
+吴皇后 6 nr
+吴皇帝 3 nr
+吴相争 2 nr
+吴相公 5 nr
+吴真人 4 nr
+吴碧莲 2 nr
+吴祖光 11 nr
+吴祖强 12 nr
+吴祖荣 2 nr
+吴祖谋 6 nr
+吴祥和 3 nr
+吴祥来 2 nr
+吴祯兄弟 2 nr
+吴禄贞 6 nr
+吴秀才 36 nr
+吴秀英 3 nr
+吴秉彝 8 nr
+吴称臣 2 nr
+吴称藩 2 nr
+吴稚晖 15 nrfg
+吴窑村 2 ns
+吴立身 157 nr
+吴组缃 6 nr
+吴绍周 3 nr
+吴经国 6 nr
+吴经理 2 nr
+吴继善 2 nr
+吴绮敏 9 nrfg
+吴美枝 3 nr
+吴美珩 3 nr
+吴耀宗 4 nr
+吴耀汉 3 nr
+吴老大 5 nr
+吴老将军 5 nr
+吴老板 8 nr
+吴老爷子 4 nr
+吴老苏 2 nr
+吴肇光 26 nr
+吴肇毅 4 nr
+吴肇汉 32 nr
+吴自牧 3 nr
+吴良兄弟 2 nr
+吴良辅 79 nr
+吴良镛 4 nr
+吴艳艳 18 nr
+吴苏琳 2 nr
+吴若权 3 nr
+吴若甫 3 nr
+吴英宝 3 nr
+吴茱萸 13 n
+吴茶情 2 nr
+吴茶清 149 nr
+吴荣恪 3 nrfg
+吴荣根 2 nr
+吴菱仙 3 nr
+吴蔚云 2 nr
+吴蕴初 12 nr
+吴虹飞 10 nr
+吴觉农 64 nr
+吴觉迎 2 nr
+吴觉非 2 nr
+吴设司 2 nr
+吴调侯 2 nr
+吴谷丰 3 nr
+吴谷平 2 nr
+吴象婴 2 nr
+吴貞婉 3 nr
+吴贵临 4 nr
+吴贻弓 2 nr
+吴赤乌 4 nr
+吴起 49 nr
+吴起仕 2 nr
+吴起传 2 nr
+吴起守 3 nr
+吴起死 2 nr
+吴起甚 2 nr
+吴起镇 28 nr
+吴起问 2 nr
+吴越 181 nr
+吴越之 3 nr
+吴越众 2 nr
+吴越剑 2 nr
+吴越同舟 3 nr
+吴越国 8 nr
+吴越常 3 nr
+吴越王 21 nr
+吴越设 2 nr
+吴趼人 2 nr
+吴辰君 3 nr
+吴达海 39 nr
+吴达澎 9 nr
+吴连明 2 nr
+吴道子 54 nr
+吴道通 58 nr
+吴邦国 369 nr
+吴邦雅 2 nr
+吴郡吴 8 nr
+吴郡富 7 nr
+吴郭鱼 3 nr
+吴都平 2 nr
+吴重远 2 nr
+吴量恺 2 nr
+吴金印 4 nr
+吴金贵 161 nr
+吴钊燮 9 nr
+吴铁城 4 nr
+吴铨叙 8 nr
+吴铭德 32 nr
+吴镇军 3 nr
+吴镇宇 3 nr
+吴镇营 2 nr
+吴长庆 17 nr
+吴长老 66 nr
+吴长贵 15 nr
+吴长风 35 nr
+吴门派 9 nr
+吴阶平 9 nr
+吴阿姨 2 nr
+吴阿衡 2 nr
+吴雁泽 6 nr
+吴雄寺 8 nr
+吴雅氏 3 nr
+吴霍安 2 nr
+吴青烈 9 nr
+吴静娴 3 nr
+吴静波 6 nr
+吴鞠通 8 nr
+吴音相 2 nr
+吴领军 3 nr
+吴飞鹏 4 nr
+吴香主 3 nr
+吴香香 277 nr
+吴黄武 3 nr
+吴黎平 6 nr
+吴鼎昌 5 nr
+吴龙生 2 nr
+吵 1045 v
+吵到 3 v
+吵吵 3 v
+吵吵嚷嚷 45 v
+吵吵闹闹 71 v
+吵嘴 60 v
+吵嚷 99 v
+吵扰 3 v
+吵杂 3 v
+吵来吵去 3 v
+吵架 347 v
+吵起 3 v
+吵起来 3 v
+吵过 3 v
+吵过去 3 v
+吵过来 3 v
+吵醒 74 v
+吵闹 241 v
+吵闹声 11 v
+吵骂 3 v
+吶 22 zg
+吸 2556 v
+吸上 3 v
+吸上去 3 v
+吸上来 3 v
+吸下 3 v
+吸下去 3 v
+吸下来 3 v
+吸住 3 v
+吸储 3 v
+吸允 3 v
+吸光 3 n
+吸光性 3 n
+吸入 287 v
+吸入压力 3 n
+吸入式 3 n
+吸入性 11 n
+吸出 3 v
+吸出去 3 v
+吸出来 3 v
+吸到 3 v
+吸力 54 n
+吸去 3 v
+吸反 3 v
+吸取 722 v
+吸取教训 3 n
+吸取经验 3 n
+吸吮 61 v
+吸吸 3 v
+吸咽者 3 n
+吸回 3 v
+吸回去 3 l
+吸回来 3 l
+吸地 3 n
+吸地板 3 n
+吸地毯 3 n
+吸塑机 3 n
+吸墨 3 v
+吸墨纸 3 n
+吸声 46 v
+吸声材料 3 l
+吸声板 3 n
+吸头 3 v
+吸奶器 3 n
+吸好 3 v
+吸完 3 v
+吸小 3 v
+吸尘 13 n
+吸尘器 44 n
+吸尘机 3 n
+吸尘系统 3 l
+吸尽 14 v
+吸干 3 v
+吸引 3307 v
+吸引住 3 l
+吸引力 650 n
+吸引区 3 n
+吸引圈 3 n
+吸引外资 3 l
+吸得 3 v
+吸成 3 v
+吸掉 3 v
+吸收 4089 v
+吸收体 5 n
+吸收光谱 54 n
+吸收剂 3 n
+吸收剂量 3 n
+吸收力 3 n
+吸收器 8 n
+吸收塔 3 n
+吸收外资 3 l
+吸收式 12 n
+吸收性 3 n
+吸收截面 3 n
+吸收率 29 n
+吸收玻璃 3 n
+吸收系数 3 l
+吸收能力 3 n
+吸收谱带 3 n
+吸收量 7 n
+吸断 3 v
+吸新吐故 3 n
+吸杂 3 v
+吸来 3 v
+吸来吸去 3 l
+吸棉 3 n
+吸毒 228 v
+吸毒上瘾 3 l
+吸毒人 2 n
+吸毒者 22 n
+吸毒贩毒 3 l
+吸气 160 n
+吸氧 3 v
+吸水 131 v
+吸水势 3 n
+吸水层段 3 n
+吸水性 40 n
+吸水指数 3 n
+吸水机 3 n
+吸水水池 3 n
+吸水率 5 n
+吸水纸 3 n
+吸水能力 3 n
+吸汗 3 v
+吸汗带 3 n
+吸汗性 3 n
+吸油烟机 3 n
+吸油纸 3 n
+吸法 3 v
+吸浆虫 3 n
+吸涎器 3 n
+吸液管 3 n
+吸湿 16 v
+吸湿性 39 n
+吸溜 15 v
+吸潮 17 n
+吸烟 617 v
+吸烟区 2 n
+吸烟史 2 n
+吸烟客 2 n
+吸烟室 2 n
+吸烟率 9 n
+吸烟者 47 n
+吸热 49 v
+吸热反应 3 l
+吸牢 3 v
+吸盘 102 v
+吸盘式 3 n
+吸着 146 v
+吸着剂 3 nz
+吸着烟 3 v
+吸着物 3 l
+吸积 23 v
+吸管 22 v
+吸管虫 3 n
+吸纳 222 v
+吸绵 3 n
+吸者 3 n
+吸虫 35 n
+吸虫病 9 n
+吸血 3 v
+吸血虫 3 n
+吸血鬼 69 n
+吸走 3 v
+吸起 3 v
+吸起来 3 v
+吸跑 3 v
+吸过 3 v
+吸过去 3 v
+吸过来 3 l
+吸进 60 v
+吸进去 3 v
+吸进来 3 v
+吸透 3 v
+吸遍 3 v
+吸量管 3 n
+吸金 3 n
+吸铁 3 n
+吸铁石 21 nz
+吸附 345 v
+吸附催化 3 vn
+吸附剂 24 nz
+吸附力 10 n
+吸附器 3 nz
+吸附平衡 3 nz
+吸附性 11 n
+吸附水 3 n
+吸附滞后 3 n
+吸音 12 n
+吸音板 3 n
+吸音棉 3 n
+吸顶灯 4 n
+吸风 2 v
+吸风饮露 3 l
+吸食 115 v
+吸食毒品 3 l
+吸饱 3 v
+吹 4119 v
+吹上去 3 v
+吹上来 3 v
+吹下去 3 v
+吹下来 3 v
+吹乐 3 n
+吹乱 3 v
+吹乾 3 i
+吹倒 30 v
+吹入 3 v
+吹入器 3 n
+吹冷气 3 l
+吹冷风 3 l
+吹出 3 v
+吹出去 3 v
+吹出来 3 v
+吹到 3 v
+吹动 64 v
+吹发 3 v
+吹口哨 3 n
+吹台 4 v
+吹叶嚼蕊 3 n
+吹号 12 n
+吹吹打打 26 i
+吹吹拍拍 3 l
+吹响 191 vn
+吹哨 3 v
+吹哨声 3 n
+吹哨子 3 n
+吹唇唱吼 3 i
+吹喇叭 4 n
+吹嘘 188 v
+吹嘘大王 3 n
+吹塑 11 n
+吹塑机 3 n
+吹大气 9 i
+吹大牛 3 nz
+吹头 3 v
+吹头发 3 i
+吹奏 187 v
+吹奏乐 3 n
+吹奏乐器 3 n
+吹奏者 3 n
+吹干 4 v
+吹开 3 v
+吹弹 3 v
+吹弹得破 3 v
+吹弹歌舞 3 i
+吹影镂尘 3 i
+吹成 3 v
+吹打 57 v
+吹打乐 15 i
+吹拂 72 v
+吹拉弹唱 3 n
+吹拍 3 v
+吹捧 56 v
+吹掉 3 v
+吹揍 3 v
+吹擂 3 v
+吹散 7 v
+吹来 3 v
+吹来吹去 3 i
+吹棒 3 n
+吹毛利刃 3 i
+吹毛数睫 3 i
+吹毛求瑕 3 i
+吹毛求疵 22 i
+吹毛洗垢 3 i
+吹毛索垢 3 i
+吹毛索疵 3 i
+吹气 3 n
+吹气如兰 12 i
+吹气胜兰 3 n
+吹氧管 3 n
+吹水 3 v
+吹沙 3 n
+吹法 3 v
+吹法螺 3 n
+吹泡泡 3 n
+吹火 3 v
+吹火筒 2 n
+吹灭 3 v
+吹灯 338 n
+吹灯拔蜡 3 i
+吹灰 3 n
+吹灰之力 9 i
+吹炼 3 v
+吹熄 46 n
+吹牛 197 n
+吹牛大王 3 nz
+吹牛拍马 21 i
+吹牛皮 38 n
+吹瓶 3 n
+吹瓶机 3 n
+吹皱一池 3 i
+吹直 3 v
+吹眠曲 3 n
+吹破 3 v
+吹竹弹丝 3 n
+吹笙 3 n
+吹笛 3 n
+吹管 14 v
+吹箫 64 v
+吹箫乞食 3 i
+吹箭 3 n
+吹篪乞食 3 i
+吹糠见米 3 i
+吹绵蚧 4 n
+吹网欲满 3 i
+吹耳边风 3 i
+吹胡子瞪眼 18 i
+吹腔 16 n
+吹膜机 3 n
+吹花嚼蕊 3 n
+吹萧 3 i
+吹蚀 3 v
+吹袭 3 v
+吹角 3 n
+吹角连营 2 i
+吹起 3 v
+吹起来 3 v
+吹过来 3 l
+吹进 3 v
+吹进去 3 v
+吹进来 3 v
+吹送 14 v
+吹遍 4 v
+吹雪 3 n
+吹风 77 v
+吹风会 184 n
+吹风机 12 n
+吹飞 3 v
+吹鼓 3 v
+吹鼓手 45 i
+吻 2502 v
+吻上了 3 v
+吻下去 3 v
+吻别 4 v
+吻别时 3 v
+吻合 311 v
+吻合器 8 n
+吻合效应 3 n
+吻合术 5 n
+吻吻 3 v
+吻抱 3 v
+吻痕 3 n
+吻遍 3 v
+吻颈 3 v
+吼 1077 v
+吼出 3 v
+吼到 3 v
+吼叫 199 v
+吼叫声 18 n
+吼吼 3 v
+吼声 244 n
+吼起来 3 v
+吼道 3 v
+吼鸣 3 v
+吽 12 zg
+吾 3250 r
+吾主 3 nrt
+吾人 28 r
+吾令 3 nrt
+吾侪 4 r
+吾兄 3 l
+吾国 3 r
+吾妻 2 r
+吾子 3 r
+吾将上下而求索 6 l
+吾师 3 r
+吾民 3 nrt
+吾爱 3 nrt
+吾王 3 nrt
+吾膝如铁 3 l
+吾自有处 3 l
+吾谁与归 3 l
+吾辈 53 r
+吿 4 zg
+呀 9580 y
+呀儿哟 3 nr
+呀呀 8 y
+呀呀学语 3 nr
+呂方 3 z
+呃 171 y
+呃逆 22 v
+呆 4383 v
+呆人 3 n
+呆似木鸡 3 i
+呆住 3 v
+呆傻 17 a
+呆呆 3 z
+呆呆傻傻 3 i
+呆呆地 251 z
+呆呆挣挣 3 i
+呆呆笨笨 3 nr
+呆坏账 10 n
+呆坐 70 v
+呆头 3 n
+呆头呆脑 31 z
+呆头鹅 3 n
+呆如木鸡 3 i
+呆子 487 n
+呆宝静 3 n
+呆小症 3 n
+呆帐 3 n
+呆帐损失 3 n
+呆愣愣 2 z
+呆料 3 n
+呆板 107 n
+呆楞楞 3 z
+呆气 3 n
+呆滞 138 a
+呆滞无神 3 i
+呆笑 3 a
+呆笨 5 a
+呆若 3 z
+呆若木鸡 52 i
+呆账 46 n
+呆里呆气 3 z
+呆里撒奸 3 i
+呈 8976 v
+呈上升 3 v
+呈交 31 v
+呈几何 3 nr
+呈圆形 3 n
+呈子 4 n
+呈报 88 v
+呈拱形 3 n
+呈文 41 v
+呈献 24 v
+呈献给 3 v
+呈现 1776 v
+呈现出 3 v
+呈示 15 v
+呈示部 3 n
+呈祥 2 nr
+呈缴 18 v
+呈缴本 3 n
+呈网状 3 n
+呈脉络状 3 n
+呈色反应 3 n
+呈览 3 v
+呈请 20 v
+呈贡 2 v
+呈贡县 3 ns
+呈送 27 v
+呈递 35 v
+呈酸性 3 n
+呈阅 3 v
+呈露 3 v
+呈验 3 v
+告 3737 v
+告一段落 104 l
+告便 3 v
+告倒 9 v
+告借 3 v
+告假 31 v
+告假还乡 3 l
+告别 973 v
+告别仪式 3 l
+告别式 3 l
+告别赛 3 v
+告劳 3 v
+告发 189 v
+告吹 14 v
+告嘱 3 v
+告官 18 v
+告密 111 v
+告密者 9 n
+告往知来 3 l
+告急 145 v
+告慰 32 v
+告成 58 v
+告成镇 7 n
+告戒 10 v
+告扰 3 v
+告捷 68 v
+告朔 3 ns
+告朔饩羊 3 vn
+告枕头状 3 i
+告特 3 ns
+告特叶 3 l
+告状 346 v
+告状信 33 l
+告申庭 3 n
+告病 3 v
+告白 29 v
+告知 685 v
+告破 9 v
+告示 226 v
+告示板 3 n
+告示版 3 n
+告示牌 4 n
+告竣 11 v
+告终 286 v
+告绝 3 v
+告缺 5 v
+告罄 34 v
+告罪 32 v
+告老 20 v
+告老在家 3 l
+告老还乡 27 l
+告老还家 3 l
+告警 106 v
+告警信号 3 n
+告警信息 2 l
+告诉 10953 v
+告诉乃论 3 l
+告诉您 3 l
+告诫 336 v
+告语 3 v
+告谢 3 v
+告负 56 v
+告贷 3 v
+告贷无门 3 n
+告辞 717 v
+告退 134 v
+告送 3 v
+告饶 36 v
+呋 55 n
+呋喃 42 n
+呋喃丹 6 n
+呋喃唑酮 3 nz
+呋喃妥因 5 nz
+呋喃树脂 3 n
+呋喃糖 3 n
+呋喃西林 5 nz
+呋喃霉素 3 n
+呎 109 zg
+呐 431 y
+呐喊 697 v
+呐喊助威 43 l
+呐喊助阵 3 l
+呐喊声 73 l
+呑 2 zg
+呒 57 zg
+呒啥 3 r
+呓 32 n
+呓语 30 n
+呔 33 e
+呕 289 v
+呕出 3 v
+呕吐 625 v
+呕吐时 3 i
+呕吐物 3 i
+呕吐者 3 i
+呕哑 3 v
+呕心 3 v
+呕心抽肠 3 i
+呕心沥血 65 i
+呕心滴血 3 i
+呕心镂骨 3 i
+呕气 3 v
+呕血 92 v
+呕血时 3 i
+呖 29 o
+呖呖 11 o
+呗 255 y
+员 5970 zg
+员司 3 n
+员外 194 n
+员外郎 122 n
+员大将 3 n
+员山 3 n
+员工 3748 n
+员工工资 3 n
+员工福利 3 n
+员工素质 3 n
+员林 3 n
+员林市 3 n
+员警 3 n
+员雷 2 n
+员额 181 n
+呙 19 nr
+呛 679 v
+呛伤 3 a
+呛到 3 v
+呛咳 3 v
+呛喉 3 v
+呛得 3 v
+呛水 3 v
+呛熏 3 v
+呛着 3 v
+呛起来 3 v
+呛鼻 4 a
+呛鼻子 3 v
+呜 971 o
+呜乎哀哉 3 l
+呜儿呜儿 3 l
+呜呜 28 l
+呜呜咽咽 84 l
+呜呜声 3 l
+呜呼 79 e
+呜呼哀哉 35 l
+呜呼噫嘻 3 z
+呜咽 318 v
+呜唈 3 v
+呜枪 3 v
+呜钟 3 l
+呟 3 zg
+呠 2 zg
+呢 28623 y
+呢喃 30 n
+呢喃细语 3 nz
+呢大衣 18 nz
+呢子 21 n
+呢子大衣 3 nz
+呢帽 12 n
+呢料 3 n
+呢绒 120 n
+呣 4 zg
+呤 54 x
+呤呤 3 n
+呦 154 e
+周 8326 nr
+周一 327 t
+周一围 3 nr
+周一岳 3 nr
+周一良 52 nr
+周三 211 t
+周世俭 3 nr
+周世兄 7 nr
+周世六 2 t
+周世宗 37 nr
+周东棣 2 ns
+周东迁 5 nr
+周中尚 2 nr
+周丹红 2 nr
+周为氏 2 nr
+周为肃 2 nr
+周丽枫 2 nr
+周丽淇 3 nr
+周义霖 15 nr
+周之会 2 nr
+周之冕 4 nr
+周之太 2 nr
+周之宗 2 nr
+周之桐 5 nr
+周之阴 2 nr
+周书平 3 nr
+周书补 3 nr
+周二 392 t
+周云阳 41 nr
+周云鹏 3 nr
+周云鹤 2 nr
+周五 269 t
+周五输 3 nr
+周亚夫 49 nr
+周亦助 2 nr
+周人农 2 nr
+周人深 3 nr
+周人甲 4 nr
+周仁回 2 nr
+周仆义 3 nr
+周仆亲 2 nr
+周仆停 3 nr
+周仆刚 3 nr
+周仆叉 3 nr
+周仆叹 3 nr
+周仆微微 2 nr
+周仆正 3 nr
+周仆皱 2 nr
+周仆瞅 3 nr
+周仆笑 5 nr
+周介生 8 nr
+周仓引 2 nr
+周代 260 t
+周仲英 389 nr
+周伟良 8 nr
+周伟阁 2 nr
+周传家 2 nr
+周传瑛 6 nr
+周传雄 256 nr
+周伯信 55 nr
+周伯华 3 nr
+周伯通 1476 nr
+周伯齐 2 nr
+周佛海 38 nr
+周作人 92 n
+周作民 3 nr
+周俊伟 3 nr
+周俊勋 5 nr
+周俊杰 4 nr
+周保中 2 nr
+周信芳 16 nr
+周停飞 2 nr
+周僖王 2 nr
+周元忠 6 nr
+周元王 5 nr
+周兆年 3 nr
+周先庚 2 nr
+周先慎 2 nr
+周先生 8 nr
+周光召 17 nr
+周光富 3 nr
+周克玉 2 nr
+周克芹 2 nr
+周全 261 nr
+周八师 8 nr
+周公东 3 nr
+周公之 4 nr
+周公之礼 3 nr
+周公传 2 nr
+周公吐哺 3 i
+周公子 3 nr
+周公孔 2 nr
+周公封 3 nr
+周公庙 31 nr
+周公才 3 nr
+周公旦 29 nr
+周公死 2 nr
+周公瑾 12 nr
+周公祈 2 nr
+周公老 3 nr
+周公致 3 nr
+周公规 2 nr
+周公语 2 nr
+周公辅 5 nr
+周公阅 2 nr
+周六 341 t
+周六日 3 m
+周共王 3 nr
+周兴政 2 nr
+周其仁 2 nr
+周军全 3 nr
+周军胜利 2 nr
+周军进 2 nr
+周冬梅 3 nr
+周冰倩 3 nr
+周凤臣 2 nr
+周凤萍 3 nr
+周刊 978 n
+周刑统 2 nr
+周则天 9 nr
+周初 72 t
+周到 443 v
+周剑虹 2 nr
+周勃 43 nr
+周勃之 3 nr
+周勃复 2 nr
+周勃重 2 nr
+周勇江 19 nr
+周半城 2 ns
+周华健 3 nr
+周南女 2 nr
+周占顺 3 nr
+周厉王 35 nr
+周厚健 2 nr
+周厚卿 3 nr
+周原甲 3 nr
+周去非 2 nr
+周又增 2 nr
+周叔莲 2 nr
+周口 37 n
+周口市 11 n
+周口店 110 n
+周口店地区 3 ns
+周口店遗址博物馆 7 ns
+周各庄 2 nr
+周启明 4 nr
+周启生 3 nr
+周吴郑 10 nr
+周吴陈 6 nr
+周和平 6 nr
+周哲文 3 nr
+周嘉玲 3 nr
+周嘉谟 13 nr
+周四 204 t
+周围 5681 f
+周围环境 3 l
+周围神经 26 l
+周国丈 2 nr
+周国卿 10 nr
+周国平 2 nr
+周国美 2 nr
+周国舅 2 nr
+周国贤 3 nr
+周坚卫 5 nr
+周坤仁 257 ns
+周城镇 3 nr
+周培公 256 nr
+周培毅 8 nr
+周培源 9 nr
+周境才 2 t
+周境有 3 nr
+周士朴 8 nr
+周复唐 2 nr
+周大人 7 nr
+周大儒 2 nr
+周大哥 49 nr
+周大奶奶 26 nr
+周大娘 5 nr
+周大新 2 nr
+周大璞 2 nr
+周大福 4 nr
+周大镖 4 nr
+周天 40 t
+周天之 3 nr
+周天伦 9 nr
+周天全 3 nr
+周天勇 7 nr
+周天卦 27 nr
+周天古 10 nr
+周天子 29 nr
+周天度 2 nr
+周天爵 2 nr
+周天王 3 nr
+周太保 3 nr
+周太史 2 nr
+周太后 3 nr
+周太王 4 nr
+周夷王 2 nr
+周奶妈 2 nr
+周如斗 2 nr
+周妻何肉 3 n
+周姊姊 14 nr
+周姐姐 2 nr
+周姨娘 10 nr
+周威信 20 nr
+周威烈 8 nr
+周婉峰 3 nr
+周媛媛 3 nr
+周嫂子 5 nr
+周子东 6 nr
+周子寒 3 nr
+周子山 2 nr
+周子旺 10 nr
+周子昆 6 nr
+周子玉 4 nr
+周子谅 3 nr
+周孔之 2 nr
+周孔惠 9 nr
+周孝侯 2 nr
+周孝正 3 nr
+周孤桐 3 nr
+周学军 2 nr
+周学农 3 nr
+周学文 2 nr
+周学源 4 nr
+周宁县 3 nr
+周安王 2 nr
+周宏英 10 nr
+周宗建 8 nr
+周宗欣 4 nr
+周官屯 2 nr
+周官徵 2 nr
+周官礼 2 nr
+周官禄 2 nr
+周官经 4 nr
+周官解 2 nr
+周官辨 4 nr
+周定公 6 nr
+周定公共 2 nr
+周宜兴 3 nr
+周宝珠 11 nr
+周宝裕 7 nr
+周宣帝 2 nr
+周宣王 60 nr
+周室 15 n
+周家 298 n
+周家为 2 nr
+周家口 9 nr
+周家庄 9 nr
+周家恩 2 nr
+周家旺 3 nr
+周家桥 2 nr
+周家洼 3 nr
+周家渡 3 nr
+周家湖 256 nr
+周家玲 3 nr
+周密 447 nr
+周密安排 3 nr
+周密计划 3 n
+周密调查 3 nr
+周小川 23 nr
+周小明 7 nr
+周小燕 27 nr
+周小舟 21 nr
+周少波 256 nr
+周岁 496 m
+周崇光 9 nr
+周巍峙 4 nr
+周师傅 3 nr
+周师兄 17 nr
+周师叔 28 nr
+周希汉 3 nr
+周平王 15 nr
+周年 1533 t
+周年纪念 3 n
+周幽王 22 nr
+周庄 100 nr
+周庄镇 6 nr
+周庆山 3 nr
+周庆祥 4 nr
+周庆行 3 nr
+周府中 2 nr
+周康王 14 nr
+周延 33 nr
+周延儒 169 nr
+周廷儒 2 nr
+周建人 8 nr
+周建安 3 nr
+周建新 3 nr
+周建明 6 nr
+周建玲 3 nr
+周建琳 2 nr
+周彦中 2 nr
+周德东 3 nr
+周德兴 6 nr
+周德武 7 nr
+周德清 2 nr
+周德熙 2 nr
+周心媛 8 nr
+周志俊 3 nr
+周志军 2 nr
+周志农 3 nr
+周志华 3 nr
+周志平 3 nr
+周志方 9 nr
+周志腾 12 nr
+周志道 2 nr
+周忠介 2 nr
+周思源 3 nr
+周思聪 9 nr
+周思详 2 nr
+周总理 36 nr
+周总镖 13 nr
+周恩来 3067 t
+周情孔思 3 nr
+周惠久 2 nr
+周慈朴 11 nr
+周慕莲 3 nr
+周慧敏 3 nr
+周懿王 8 nr
+周成刚 3 nr
+周成汉 26 nr
+周成王 43 nr
+周承恩 17 nr
+周折 120 nr
+周报 127 n
+周报制 2 n
+周拔贡 6 nr
+周拥平 3 nr
+周指周 2 nr
+周振全 2 nr
+周振天 2 nr
+周振甫 2 nr
+周振鹤 3 nr
+周掌门 3 nr
+周教授 2 n
+周敦颐 21 nrfg
+周敬王 12 nr
+周文中 2 nr
+周文健 3 nr
+周文元 9 nr
+周文华 2 nr
+周文广 5 nr
+周文德 2 nr
+周文昌 6 nr
+周文杰 2 nr
+周文王 95 nr
+周文王子 4 nr
+周文矩 3 nr
+周文重 3 nr
+周文雍 3 nr
+周文骏 2 nr
+周文龙 44 nr
+周旋 398 nr
+周旋到底 3 i
+周族 9 nz
+周日 337 t
+周旺生 2 nr
+周昂二 3 nr
+周昂战 2 nz
+周昌贡 2 nr
+周明帝 3 nr
+周明泰 2 nr
+周易 191 n
+周星弛 3 nr
+周星明 4 nr
+周星星 3 nr
+周星驰 44 nr
+周昭王 25 nr
+周显德 2 nr
+周显王 4 nr
+周显谟 48 nr
+周晓峰 4 nr
+周晓鸥 4 nr
+周景扬 3 nr
+周景王 3 nr
+周有光 5 nr
+周朝 182 t
+周期 2325 t
+周期函数 12 l
+周期律 41 n
+周期性 387 n
+周期性地 3 l
+周期时间 3 t
+周期率 8 n
+周期短 3 n
+周期窃取 3 l
+周期素 3 n
+周期群 3 nr
+周期表 86 n
+周期长 3 n
+周木杨 3 nr
+周末 654 t
+周末好 3 nr
+周末版 11 n
+周末风 3 nr
+周朴园 6 nr
+周村 30 nr
+周村区 6 nr
+周来祥 3 nr
+周杰伦 89 nr
+周树人 3 nr
+周树基 3 nr
+周树春 3 nr
+周树杰 8 nr
+周桂生 4 nr
+周桂笙 3 nr
+周桂英 2 nr
+周桓王 4 nr
+周梅森 2 nr
+周森锋 256 nr
+周欣伟 2 nr
+周正 18 nr
+周正平 2 nr
+周正庆 260 nr
+周正毅 2 nr
+周正猷 2 nr
+周武仲 3 nr
+周武帝 37 nr
+周武王 99 nr
+周殊士 2 nr
+周比利 3 nr
+周氏兄弟 3 nr
+周氏昆 2 nr
+周水子 2 nr
+周永年 30 nr
+周永康 4 nr
+周永恒 3 nr
+周永玲 2 nr
+周永香 3 nr
+周汉江 2 nr
+周汝昌 7 nr
+周汶锜 3 ns
+周沧海 6 ns
+周治平 3 nr
+周泓洋 6 nr
+周法高 4 nr
+周波 8 nr
+周泰听 2 nr
+周泰守 3 nr
+周泰引 5 nr
+周泰者 2 nr
+周泰领 2 nr
+周泽琳 7 nr
+周洁宇 3 nr
+周洪宇 8 nr
+周洪涛 2 nr
+周派军 2 nr
+周济 139 n
+周浑元 2 nr
+周海婴 2 nr
+周海媚 3 nr
+周海晏 2 nr
+周海滨 27 nr
+周润 7 n
+周润发 6 nr
+周淑贞 2 nrfg
+周清澍 19 nr
+周渝民 3 nr
+周游 123 f
+周游世界 3 n
+周游列国 3 ns
+周满生 5 nr
+周灵王 4 nr
+周牧怒 2 nr
+周玉宝 21 nr
+周玉清 256 nr
+周王城 6 nr
+周王子 2 nr
+周王朱 2 nr
+周琦思 80 nr
+周瑜 316 nr
+周瑜之 3 nr
+周瑜入 2 nr
+周瑜唤 2 nr
+周瑜寨 2 nr
+周瑜恐 2 nr
+周瑜打黄盖 7 nr
+周瑜精 2 nr
+周瑜调 2 nr
+周瑜部 4 nr
+周瑜闻 3 nr
+周瑜领 3 nr
+周瑞发 3 nr
+周瑞媳妇 4 nr
+周瑞旺 2 nr
+周璇 6 nr
+周生生 3 nr
+周生贤 3 nr
+周留城 2 nr
+周瘦鹃 6 nr
+周皇亲 6 nr
+周皇后 14 nr
+周皮 5 n
+周相公 7 nr
+周睿羊 3 l
+周知 17 nr
+周砥微微 2 nr
+周砥见 2 nr
+周礼 260 nr
+周礼义 5 nr
+周礼六 2 nr
+周礼注 2 nr
+周礼考 3 nr
+周礼难 2 nr
+周祖培 4 nr
+周祖谟 3 nr
+周祭谱 3 nr
+周秀兰 4 nr
+周秀英 3 nr
+周秉也 2 nr
+周秉德 3 nr
+周秉道 12 nr
+周秦 12 t
+周秦至 2 nr
+周穆王 76 nr
+周立三 2 nr
+周立勋 10 nr
+周立波 12 nr
+周章军 6 nr
+周笔畅 10 nr
+周纤纤 3 n
+周纯全 257 nr
+周细姐 2 nr
+周绍熹 2 nr
+周绍良 2 nr
+周继红 262 nr
+周维衍 5 nr
+周缘 22 nr
+周耀庭 3 nr
+周老汉 5 nr
+周老爷 3 nr
+周老爷子 12 nr
+周而不比 3 i
+周而复 4 nr
+周而复始 73 i
+周自公 3 nr
+周自齐 2 nr
+周至 34 t
+周至县 7 nr
+周至德 2 nr
+周至柔 5 nr
+周良洛 2 nr
+周良霄 28 nr
+周艳泓 3 nr
+周花树 5 nr
+周芳明 2 nr
+周芷若 815 nr
+周英杰 30 nr
+周荣曜 28 nr
+周荫昌 2 nr
+周薪 5 nr
+周藤吉 2 nr
+周行逢 7 nr
+周行郡 3 nr
+周表 9 n
+周襄王 10 nr
+周观政 9 nr
+周规折矩 3 n
+周解蓉 2 nr
+周训德 2 nr
+周详 198 nr
+周语 9 nz
+周谷城 23 nr
+周质体 3 n
+周贫济老 3 l
+周贵妃 6 nr
+周贻白 2 nr
+周赧王 12 nr
+周起元 3 nr
+周超凡 8 nr
+周身 372 n
+周转 899 nr
+周转不灵 3 i
+周转基金 3 n
+周转天 3 nr
+周转期 62 n
+周转率 75 n
+周转箱 3 n
+周转粮 3 nr
+周转资金 3 n
+周转量 73 n
+周转金 4 n
+周转额 25 n
+周边 1722 f
+周边产品 3 n
+周边国家 3 n
+周边地区 3 ns
+周边城市 3 ns
+周边店 3 ns
+周边式 3 n
+周边旅游 3 nz
+周边游 3 nr
+周边环境 3 l
+周边视觉 3 n
+周边设备 3 n
+周达明 3 nr
+周达观 3 nr
+周远清 4 nr
+周逸平 3 nr
+周逸梅 2 nr
+周逸群 264 nr
+周遇吉 9 nr
+周遭 144 m
+周遭事物 3 v
+周邦彥 3 t
+周邦彦 21 nr
+周郎安 2 nr
+周郎顾 5 nr
+周郎顾曲 3 nr
+周里京 3 nr
+周铁农 3 nz
+周铁鹤 3 nr
+周锡生 9 nr
+周镳才 2 nr
+周长 514 n
+周长生 2 nr
+周长福 3 nr
+周长达 2 nr
+周阁老 2 nr
+周阳侯 2 nr
+周阿三 7 nr
+周阿六 8 nr
+周青臣 48 nr
+周静帝 7 nr
+周静波 2 nr
+周韶华 4 nr
+周韶宁 4 nr
+周顺昌 45 nr
+周颠 134 ns
+周飞舞 2 nr
+周香华 13 nr
+周高中 2 nrfg
+周鹤洋 19 nr
+呪 9 zg
+呫 59 zg
+呬 254 zg
+呭 437 zg
+呮 309 zg
+呯 229 zg
+呰 576 zg
+呱 81 o
+呱呱 71 o
+呱呱叫 19 z
+呱呱坠地 11 i
+呱呱堕地 3 i
+呱哒 12 o
+呱唧 2 o
+呱嗒 3 o
+呱嗒板 3 z
+呱嗒板儿 3 z
+呲 57 v
+味 4348 n
+味之素 4 n
+味儿 312 n
+味全 2 n
+味十足 3 i
+味同嚼蜡 12 i
+味如嚼蜡 3 i
+味如鸡肋 3 n
+味尘 3 n
+味精 140 n
+味精厂 3 n
+味素 3 n
+味素包 3 n
+味苦 3 n
+味蕾 22 n
+味觉 115 n
+味觉区 3 n
+味觉器 3 n
+味觉敏度 3 n
+味觉混合 3 n
+味道 2808 n
+味道不好 3 i
+味道鲜美 3 nz
+味醇 7 n
+呴 179 zg
+呴湿濡沫 3 n
+呵 2416 y
+呵令 3 v
+呵佛骂祖 3 n
+呵冻 3 v
+呵叱 3 v
+呵叻 17 ns
+呵呵 119 v
+呵呵哈 3 v
+呵呵大笑 3 v
+呵喝 3 v
+呵壁问天 3 n
+呵护 190 v
+呵斥 148 v
+呵欠 91 v
+呵欠连天 3 z
+呵气 3 n
+呵痒 13 v
+呵责 12 v
+呶 104 g
+呶呶不休 3 v
+呷 217 v
+呷醋节帅 3 nz
+呸 556 e
+呻 6 v
+呻吟 756 v
+呻吟声 3 z
+呻唤 26 v
+呻喻 3 v
+呼 3306 zg
+呼不给吸 3 l
+呼中 7 nr
+呼么喝六 3 l
+呼之不来 3 l
+呼之即来 2 i
+呼之欲出 27 i
+呼之欲跃 3 i
+呼伦河 2 ns
+呼伦湖 33 ns
+呼伦贝尔 49 nr
+呼伦贝尔市 6 ns
+呼伦贝尔盟 48 ns
+呼伦贝尔草原 23 ns
+呼保义 15 nr
+呼儿唤 4 nr
+呼入 3 v
+呼兰 11 ns
+呼兰厅 2 nr
+呼兰县 9 ns
+呼兰府 3 nr
+呼兰河 10 ns
+呼兰河流 3 ns
+呼兰镇 2 nr
+呼出 3 v
+呼出来 3 v
+呼卢喝雉 3 n
+呼口号 3 n
+呼叫 620 v
+呼叫器 2 n
+呼叫声 29 nr
+呼叫指令 3 n
+呼叫者 6 n
+呼叫转移 3 i
+呼召冰 2 nr
+呼召群 2 nr
+呼号 83 n
+呼吁 1282 v
+呼吁书 11 i
+呼吸 2618 v
+呼吸与共 3 l
+呼吸之间 3 l
+呼吸作用 3 l
+呼吸器 25 l
+呼吸器官 38 l
+呼吸困难 3 l
+呼吸声 29 n
+呼吸机 13 n
+呼吸相通 3 l
+呼吸科 12 nr
+呼吸系数 3 l
+呼吸系统 89 l
+呼吸肌 15 n
+呼吸衰竭 3 n
+呼吸计 3 l
+呼吸跃变 3 l
+呼吸道 331 l
+呼吸阀 3 l
+呼呼 569 v
+呼呼啦啦 2 o
+呼呼地 39 z
+呼呼大睡 3 l
+呼和浩特 241 ns
+呼和浩特市 66 ns
+呼哧 11 o
+呼哧呼哧 31 o
+呼哨 86 o
+呼唤 667 nr
+呼唤声 7 i
+呼啦 43 o
+呼啦啦 32 o
+呼啦圈 3 nz
+呼啸 470 v
+呼啸声 3 nr
+呼啸山庄 3 nr
+呼啸而过 3 nr
+呼喊 492 v
+呼喊声 30 i
+呼喝 290 v
+呼喝声 26 i
+呼嗒 3 o
+呼噜 108 o
+呼噜噜 11 o
+呼噪 3 v
+呼图克图 25 nr
+呼图壁 3 nr
+呼图壁县 4 ns
+呼声 963 n
+呼声最高 3 nr
+呼声甚高 3 i
+呼天叩地 3 nr
+呼天叫地 3 i
+呼天号地 3 i
+呼天吁地 3 i
+呼天唤地 3 i
+呼天抢地 37 i
+呼天钥地 3 n
+呼奴唤 2 nr
+呼家楼 3 nr
+呼局 3 n
+呼巴音 17 nr
+呼市 14 ns
+呼幺喝六 6 i
+呼应 276 v
+呼应声 3 nr
+呼庚呼癸 3 nr
+呼延 397 nr
+呼延万善 3 nr
+呼廷灼 2 nr
+呼扇 5 n
+呼拉圈 3 nr
+呼拉尔 10 nr
+呼拉拉 4 nr
+呼救 219 v
+呼救信号 3 nz
+呼救声 9 i
+呼朋唤友 5 i
+呼朋引 4 nr
+呼朋引类 2 n
+呼机 30 n
+呼来唤去 3 i
+呼来喝去 3 l
+呼来挥去 3 i
+呼死你 3 nr
+呼气 82 n
+呼牛作马 3 ns
+呼牛呼马 3 i
+呼玄喝六 3 i
+呼玄德 2 nr
+呼玛 8 nr
+呼玛县 8 ns
+呼玛尔 13 nr
+呼玛河 3 nr
+呼盟 9 j
+呼罗珊 61 ns
+呼罗迦 2 nr
+呼群结党 3 i
+呼肠 3 n
+呼衍族 2 nz
+呼衍氏 2 nr
+呼衍王 11 nr
+呼衰 3 v
+呼语 3 nz
+呼起 3 v
+呼起来 3 l
+呼转 3 v
+呼达雅 4 nr
+呼隆呼 2 nr
+呼集朋 16 nr
+呼韩邪 13 nr
+呼音克 13 nr
+呼风唤雨 93 i
+呼风换雨 3 i
+呼饥号寒 3 i
+命 11603 n
+命不由人 3 l
+命不由己 3 l
+命不该绝 3 i
+命世之才 3 n
+命丧 143 v
+命丧九泉 3 l
+命中 761 v
+命中注定 3 l
+命中率 256 n
+命乖运蹇 3 i
+命书 6 n
+命令 8003 n
+命令主义 37 n
+命令句 3 n
+命令字 3 n
+命令式 10 n
+命令性 3 n
+命令提示符 2 n
+命令状 3 n
+命令行 3 n
+命令语气 3 n
+命令集 3 n
+命作 3 n
+命名 2356 n
+命名大会 3 n
+命名日 3 n
+命名权 4 n
+命在旦夕 22 i
+命妇 56 n
+命官 103 n
+命定 20 n
+命宫 3 n
+命意 108 n
+命数 3 n
+命根 13 n
+命根儿 4 n
+命根子 65 n
+命案 34 n
+命比纸薄 3 n
+命理 12 n
+命理网 3 n
+命相 25 n
+命相学 3 n
+命相家 3 n
+命相馆 3 n
+命笔 3 n
+命脉 214 n
+命若悬丝 3 l
+命苦 98 v
+命薄 3 n
+命薄相穷 3 l
+命词遣意 3 n
+命该如此 3 i
+命赴黄泉 4 l
+命蹇时乖 3 v
+命辞遣意 3 n
+命运 3117 n
+命运之神 3 l
+命运多舛 8 l
+命运攸关 3 l
+命途 3 n
+命途多舛 3 l
+命里注定 3 n
+命门 55 n
+命门穴 2 n
+命题 1542 n
+命题作文 3 n
+命题演算 3 n
+命题表征 3 n
+命题逻辑 3 n
+命馆 3 n
+呾 3 zg
+咀 847 v
+咀咒 3 v
+咀嚼 337 v
+咀嚼出 3 vn
+咀嚼型 3 vn
+咀嚼循环 3 ns
+咀嚼效能 3 v
+咀嚼片 3 z
+咀嚼粘膜 3 nz
+咀嚼系统 3 nz
+咀嚼英华 3 nz
+咀嚼运动 3 v
+咀巧 3 v
+咂 136 v
+咂咂嘴 13 n
+咂嘴 22 v
+咂嘴咂舌 3 n
+咂嘴弄唇 3 nr
+咂嘴弄舌 3 v
+咂嘴舔唇 3 nr
+咂巴 4 n
+咂摸 18 v
+咃 205 zg
+咄 175 i
+咄咄 3 i
+咄咄书空 3 i
+咄咄怪事 13 i
+咄咄逼人 194 i
+咄嗟 3 v
+咄嗟之间 3 i
+咄嗟便办 3 i
+咄嗟叱咤 3 v
+咄嗟立办 3 i
+咅 2 zg
+咆 9 v
+咆哮 229 v
+咆哮地 3 l
+咆哮声 9 l
+咆哮如雷 14 l
+咆哮山庄 3 l
+咆哮起来 3 l
+咆啸 3 v
+咇 2 zg
+咋 1409 r
+咋个 3 r
+咋办 3 v
+咋呼 19 v
+咋咋呼呼 8 z
+咋唬 16 v
+咋啦 3 z
+咋搞 3 v
+咋样 119 r
+咋玩 3 v
+咋舌 54 v
+和 555815 c
+和一夫 4 nr
+和不同尘 3 i
+和世卫 16 nr
+和世钧 12 nr
+和丰 262 nz
+和丹根 2 nz
+和为贵 13 nr
+和丽丽 20 nr
+和丽春 2 nr
+和义 11 nz
+和义兄 3 nr
+和义兰 10 nr
+和义净 3 nr
+和义勇 8 nr
+和义妹 2 nr
+和义律 3 nr
+和义渠 4 nr
+和乐 32 nz
+和乐且孺 3 i
+和事佬 21 nz
+和事老 8 nr
+和亚平 13 nr
+和亚欧 2 nr
+和亚眠 3 nr
+和亨利 5 nr
+和亨根 4 nr
+和亨特 5 nr
+和亮祖 2 nr
+和亲 106 n
+和亲政策 3 nr
+和仉欣 2 nr
+和仙器 2 nr
+和仪文 3 nr
+和休伦 2 nr
+和众僧 3 nz
+和众兵 2 nz
+和伟哥 2 nr
+和佐治 2 nr
+和佩奇 2 nr
+和佩斯 3 nr
+和俊奇 15 nr
+和俊山 4 nr
+和俊文 5 nr
+和俊斌 2 nr
+和俊武 9 nr
+和俊男 2 nr
+和俏银 2 nr
+和保罗 9 nr
+和修佛 7 nr
+和修灵 4 nr
+和健妇 3 nr
+和兀良 4 nr
+和兆域 2 nr
+和兆海 2 nr
+和兆鹏 4 nr
+和先帝 3 nr
+和光同尘 7 nr
+和光荣 27 nr
+和光轴 2 nz
+和克利 2 nz
+和克德 2 nr
+和兴兴 2 nr
+和兵卫 6 nr
+和兵民 2 nr
+和兵科 3 nz
+和内廷 3 nr
+和军标 2 nr
+和冬云 2 nr
+和冶铁 2 nr
+和冶铸 3 nr
+和凉州 4 nr
+和凯泽 3 nr
+和列侯 3 nr
+和列娜 17 nr
+和刻本 3 l
+和剂局方 3 n
+和剑刃 2 nr
+和努尔 10 nr
+和勃艮 3 nr
+和勇毅 16 nr
+和勋臣 4 nr
+和勒威 2 nr
+和勒狗 2 nr
+和北东 2 ns
+和卓之 3 nr
+和卫葑 6 nr
+和厚壁 3 nr
+和县 390 ns
+和参研 3 nr
+和叔妹 2 nr
+和叔惠 17 nr
+和召公 6 nr
+和合学 7 n
+和合雅俗 3 n
+和吏民 2 nr
+和吏科 2 nr
+和君亭 18 nr
+和君士 5 nr
+和君臣 14 nr
+和启东 3 nr
+和启沃 16 nr
+和和气气 27 nz
+和和睦睦 5 nr
+和和美美 2 nz
+和哥廷 2 nr
+和哲孟 3 nr
+和哲罗 2 nr
+和喀尔 11 nr
+和善 165 nr
+和善业 32 nr
+和喜儿 2 nr
+和嘉丽 4 nr
+和嘉乔 5 nr
+和嘉和 9 nr
+和嘉平 24 nr
+和嘉草 12 nr
+和嘉轩 6 nr
+和围岩 2 nr
+和圆业 2 n
+和土尔 2 nr
+和圣乔 3 nr
+和圣姑 2 nr
+和圣德 2 nr
+和圣玛 2 nr
+和圣训 7 nr
+和培根 2 nz
+和塔娜 7 nr
+和塔斯 3 nr
+和塔纳 2 nr
+和增仓 5 nr
+和壁儿 6 nr
+和士开 4 nr
+和声 141 n
+和复社 5 nr
+和大邦 16 nz
+和夫兰 4 nr
+和央宗 5 nr
+和奇珍 6 nr
+和好如初 7 l
+和好相处 3 i
+和如琴瑟 3 nr
+和妍子 3 nr
+和妹儿 2 nr
+和威尔 6 nr
+和威尼 4 nr
+和威廉 3 nr
+和威斯 3 nr
+和娈童 3 nr
+和娜拉 7 nr
+和娜杰 2 nr
+和婉 6 a
+和婷婷 6 nr
+和孙镗 2 nr
+和孚威 2 nr
+和孝文 5 nr
+和孝武 4 nr
+和守寨 2 nr
+和定逸 4 nr
+和宜兰 2 nr
+和宜林 2 nr
+和宝琴 3 nr
+和实德 3 nr
+和家富 2 nz
+和容悦色 3 i
+和察博 4 nr
+和小孔 12 nr
+和小宁 2 nr
+和小宗 2 nr
+和小建 2 nr
+和小红 6 nr
+和小罗 5 nr
+和小霍 3 nr
+和小静 2 nr
+和少安 33 nr
+和少平 29 nr
+和尔大 3 nz
+和尚 3959 nr
+和尚头 7 nr
+和尾羽 6 nr
+和岩体 4 nr
+和岩脉 2 nr
+和岩钉 2 nr
+和岸勤 2 nr
+和崇仁 2 nr
+和崇光 2 nr
+和川西 4 ns
+和州 3 ns
+和巧姐 3 nr
+和布克赛尔蒙古自治县 7 ns
+和帆帆 3 nr
+和平 7998 nz
+和平东路 3 nz
+和平为处 3 i
+和平主义 44 nz
+和平主义者 14 nz
+和平乡 2 nz
+和平共处 262 nz
+和平共存 3 l
+和平利用 3 nz
+和平力量 3 nz
+和平区 47 ns
+和平医院 3 nz
+和平县 4 ns
+和平友好 3 nr
+和平口号 3 nz
+和平号 24 nz
+和平国中 3 nz
+和平国小 3 nr
+和平奖 21 nz
+和平岛 3 ns
+和平建议 3 nz
+和平攻势 3 n
+和平新党 3 nz
+和平时期 3 nz
+和平村 2 nr
+和平棋 3 nr
+和平溪 3 nr
+和平演变 3 nz
+和平相处 3 i
+和平统一 3 nz
+和平街 5 ns
+和平西路 3 nz
+和平解决 3 i
+和平谈判 43 n
+和平路 4 nz
+和平过渡 3 nz
+和平部队 3 n
+和平门 10 ns
+和平队 3 nz
+和平鸽 17 nz
+和幺妹 37 nr
+和庆亲王 2 nr
+和庆堂 5 nr
+和庆玉 14 nr
+和庆连 2 nr
+和庆郡 2 nr
+和庆金 6 nz
+和廷尉 2 nr
+和廷臣 2 nr
+和建宁 2 nr
+和建康 2 nr
+和建阳 2 nr
+和开田 25 nr
+和异戊 2 nr
+和式 5 nz
+和引生 2 nr
+和弗兰 3 nr
+和弦 98 nr
+和弦铃声 3 n
+和弦铃音 3 n
+和弦音 3 n
+和彦生 2 nr
+和彩妆 3 nr
+和徒儿 2 nr
+和御营 4 nr
+和微尘 2 nr
+和微晶 2 nr
+和微溶 2 nr
+和德华 8 nr
+和德性 3 nr
+和德秀 16 nr
+和德胜 2 nr
+和志强 4 nr
+和忠王妃 2 nr
+和怒晴 2 nr
+和恒山 18 nr
+和恒隐 2 nr
+和恩格 4 nr
+和悦 32 nr
+和惠良 2 nr
+和慈恩 12 nr
+和慈禧 133 nr
+和慧剑 2 nr
+和慧梅 60 nr
+和慧珠 3 nr
+和慧英 29 nr
+和懿安 2 nr
+和执礼 16 nr
+和承欢 2 nr
+和抗凝 2 nr
+和振型 2 nr
+和捷轩 5 nr
+和政制 16 n
+和政县 3 nr
+和敏妹 4 nr
+和敏敏 30 nr
+和文 100 nz
+和文元 2 nr
+和明教 7 nz
+和易 42 nz
+和易近人 3 n
+和春义 15 nr
+和春生 5 nr
+和春英 2 nr
+和晓霞 42 nr
+和晖晖 32 nr
+和普京 3 nz
+和普华 2 nz
+和普罗 2 nr
+和晴雯 3 nr
+和晶格 2 nz
+和晶界 2 n
+和智深 3 nr
+和暖 100 nr
+和曼桢 26 nr
+和服 81 nz
+和朝章 2 nr
+和朝臣 8 nr
+和术赤 3 nr
+和杏山 3 nr
+和林北 8 nr
+和林格尔 24 nz
+和林格尔县 4 ns
+和林生 3 nr
+和枫丹 6 nr
+和标营 3 nr
+和栎林 2 nr
+和栖霞 3 nr
+和校验 3 n
+和桃枝 5 nr
+和桐城 2 nr
+和梭伦 32 nr
+和棋 21 nr
+和森亦 2 nr
+和楠普 2 nr
+和歌 66 nz
+和歌山 4 nr
+和氏璧 3 ns
+和气生财 14 l
+和气致祥 3 nr
+和气请问 3 n
+和永嘉 2 nr
+和永宁 5 nr
+和永昌 3 nr
+和汉志 2 nr
+和沁河 3 nr
+和沅江 3 nr
+和沐剑 5 nr
+和河东 5 nr
+和波普 2 nr
+和波束 3 nr
+和洛河 2 nr
+和洞玄 2 nr
+和洽 3 nr
+和济嘎 2 nr
+和济尔 6 nr
+和济慈 2 nr
+和浓丽 2 nr
+和浦珠还 3 nr
+和海子 2 nr
+和海权 2 nr
+和海民 4 nr
+和润叶 51 nr
+和润生 12 nr
+和湘湘 5 nr
+和源氏 2 nr
+和潇湘 18 nr
+和澄心 3 nr
+和澄观 3 nr
+和澳洲 3 ns
+和灌丛 7 nr
+和烯醇 3 nz
+和煦 53 nr
+和熙 3 nz
+和爱云 4 nr
+和爱光 7 nr
+和爱爱 5 nr
+和爱珍 4 nr
+和牌 3 nz
+和献忠 7 nr
+和玉檀 2 nr
+和玛丽 2 nr
+和玛雅 7 nr
+和玮玮 2 nr
+和玺彩画 3 nr
+和珅 3 z
+和珍儿 2 nr
+和珍罗 2 nr
+和琏儿 2 nr
+和琢玉 2 nr
+和琴音 3 nr
+和琼崖 18 nz
+和瑛姑 23 nr
+和瑟斯 2 nr
+和璧隋珠 3 nz
+和瓦霞 7 nr
+和甜甜 2 nr
+和田 200 nz
+和田伯光 21 nz
+和田县 7 nr
+和田地区 5 ns
+和田市 6 ns
+和田归农 4 nr
+和田晓萌 3 nr
+和田晓霞 19 nr
+和田河 23 nr
+和田海民 11 nr
+和田润生 2 nz
+和田玉 3 nr
+和田玉产 2 nr
+和田福军 9 nr
+和田福堂 12 nr
+和田福贤 4 nr
+和田见秀 38 nr
+和田青文 2 nz
+和畅 7 a
+和登云 5 nr
+和百慧 4 nr
+和皇兄 5 nr
+和盈方 2 nr
+和监军 6 nr
+和盘托出 53 n
+和睦 170 nr
+和睦家 3 nr
+和睦相处 43 i
+和矫哲 2 nr
+和硕 55 nr
+和硕亲王 6 nr
+和硕公主 4 nr
+和硕县 2 nr
+和硕显 2 nr
+和硕特 52 nr
+和硕礼 6 nr
+和硕英 3 nr
+和硕襄 2 nr
+和硕豫 2 nr
+和硕贝 7 nr
+和碧初 6 nr
+和祥子 2 nr
+和福军 4 nr
+和福格 3 nr
+和秀兰 2 nr
+和秀春 2 nr
+和秀英 3 nr
+和秀莲 40 nr
+和积财 16 nr
+和稀泥 40 nr
+和空姐 3 nr
+和立宪 3 nr
+和立盟 4 nr
+和竞业 2 nr
+和竹青 7 nr
+和笛卡 2 nr
+和笛木 4 nr
+和籽实 17 nr
+和粉儿 2 nr
+和粤军 3 nr
+和素馨 2 nr
+和絃 3 z
+和红梅 5 nr
+和约 882 n
+和纵连横 3 nr
+和细姐 2 nr
+和统军 2 nr
+和继发 7 nr
+和维尔 2 nr
+和维金 4 nr
+和缓 93 a
+和缓地 3 nr
+和美索 5 nr
+和美语 3 nz
+和群豪 8 nr
+和羽林 2 nr
+和羽纹 2 nr
+和翠翠 3 nr
+和翠芝 10 nr
+和翼尖 2 nr
+和而不同 10 i
+和而不唱 3 l
+和耶律 2 nr
+和耶鲁 8 nr
+和联勤 2 nr
+和胃健脾 3 n
+和舜天 2 nr
+和良渚 3 nr
+和艳萍 2 nr
+和艾灸 2 nr
+和芬利 2 nr
+和芳亮 3 nr
+和芳官 4 nr
+和英子 11 nr
+和英字典 3 nr
+和英王 2 nr
+和英词典 3 nr
+和茂堂 2 nr
+和茂陵 3 nr
+和茶清 6 nr
+和荷尔 4 nr
+和荷珠 3 nz
+和荷荷 3 nr
+和莱利 2 nz
+和莱恩 2 nr
+和莱昂 2 nr
+和莱特 2 nr
+和莲莲 3 nr
+和菊娃 4 nr
+和菊韵 4 nr
+和菲利 4 nr
+和菲尔 2 nr
+和菲菲 2 nr
+和蒂森 3 nr
+和蒿俊 6 nr
+和蓉儿 9 nr
+和蔼 134 nr
+和蔼可亲 54 nr
+和蔼近人 3 nr
+和薇薇 9 nr
+和虚竹 10 nr
+和衣而卧 8 i
+和衣而睡 3 l
+和衷共济 97 i
+和裁会 3 n
+和裕阳 4 nr
+和觉华 3 nr
+和解 394 v
+和解书 3 nz
+和解少阳 3 nr
+和解提议 3 n
+和议 135 nz
+和讯 24 nz
+和讯网 11 nz
+和诺尔 3 nr
+和诺思 3 nr
+和诺维 5 nr
+和诺雷 4 nr
+和谈 361 nz
+和谐 1578 a
+和谐一致 3 nz
+和谐无间 3 l
+和谐社会 3 l
+和谐社区 3 l
+和豪奢 16 nr
+和豪格 7 nr
+和贤妹 4 nr
+和资阳 3 n
+和赛虎 5 nz
+和赤纬 2 nr
+和赤龙 2 nr
+和超微 2 nr
+和超镁 2 nr
+和路雪 3 nr
+和转子 2 nr
+和辉月 6 nz
+和辽军 2 nr
+和远海 2 nr
+和适航 5 nr
+和逢甲 2 nr
+和里布 3 nr
+和野津 2 nr
+和金兵 2 nr
+和金奈 2 nr
+和金学 3 n
+和钦察 4 nr
+和锡兰 10 nr
+和锡尔 6 nr
+和锡尼 2 nr
+和键长 2 n
+和镇安 3 nr
+和长平 3 nr
+和长松 8 nr
+和长生 4 nr
+和阗玉 3 nr
+和阿琪 2 nr
+和陇海 2 nr
+和隋之珍 3 nz
+和隐逸 2 nr
+和隶农 2 nr
+和雅思 2 nr
+和雅虎 6 nr
+和雨子 6 nr
+和雨帘 2 nr
+和雪梅 7 nr
+和雪生 2 nr
+和青楼 2 nr
+和静县 8 nr
+和非晶 2 nr
+和面机 3 nz
+和顺 97 nz
+和顺县 10 nr
+和领军 4 nr
+和颍水 2 nr
+和颖书 4 nr
+和颜悦色 76 i
+和颜说色 3 i
+和风丽日 3 nz
+和风徐徐 3 nr
+和风拂面 3 i
+和风细雨 14 i
+和香兰 3 nr
+和馨儿 2 nr
+和鸿才 3 nr
+和鸿林 2 nr
+和鹫峰 2 nr
+和麟德 2 nr
+和黛玉 9 nr
+和鼎晖 2 nr
+和鼎桥 2 nr
+和龙 81 nz
+和龙县 3 ns
+和龙市 2 ns
+咍 3 zg
+咎 184 ng
+咎有应得 3 i
+咎由应得 3 i
+咎由自取 29 i
+咏 615 n
+咏史 3 n
+咏史诗 3 n
+咏叹 56 v
+咏叹调 42 n
+咏唱 3 v
+咏嘲风月 3 v
+咏志 3 n
+咏怀 26 v
+咏春 4 n
+咏春拳 3 n
+咏月嘲风 3 vn
+咏柳 3 n
+咏桑寓柳 3 n
+咏梅 3 n
+咏歌 3 n
+咏泰 2 n
+咏物 3 n
+咏物诗 6 n
+咏经 3 n
+咏诗 3 n
+咏赞 3 v
+咏雪 3 n
+咏雪之慧 3 n
+咐 45 x
+咒 449 v
+咒天骂地 3 n
+咒心 3 n
+咒怨 3 v
+咒文 12 n
+咒符 3 n
+咒诅 15 v
+咒词 3 n
+咒语 165 n
+咒骂 231 v
+咔 149 zg
+咔叽 4 o
+咔哒 4 o
+咔唑 3 n
+咔啉 3 n
+咔喳 3 o
+咔嗒 5 o
+咔嚓 156 o
+咕 250 o
+咕叨 3 v
+咕咕 241 o
+咕咚 104 o
+咕咚一声 3 z
+咕咚咕咚 26 o
+咕咾肉 3 v
+咕哝 199 v
+咕哩美 3 z
+咕唧 7 o
+咕喨 3 v
+咕嘟 113 o
+咕嘟嘟 11 o
+咕噜 110 o
+咕噜一声 3 z
+咕噜咕噜 3 o
+咕噜噜 23 o
+咕隆 10 o
+咖 37 n
+咖哩 6 n
+咖哩汁 3 nz
+咖哩粉 3 nz
+咖哩鸡 3 nz
+咖啡 1400 n
+咖啡具 3 n
+咖啡厅 55 n
+咖啡吧 3 n
+咖啡因 95 n
+咖啡园 18 n
+咖啡壶 8 n
+咖啡室 3 n
+咖啡屋 13 n
+咖啡师 3 n
+咖啡店 28 n
+咖啡机 3 n
+咖啡杯 17 n
+咖啡渍 2 n
+咖啡猫 3 n
+咖啡碱 16 n
+咖啡粉 5 n
+咖啡色 33 n
+咖啡节 2 n
+咖啡茶 3 n
+咖啡豆 28 n
+咖啡豆象 3 n
+咖啡馆 184 n
+咖喱 12 n
+咖喱粉 3 nz
+咖喱饭 3 n
+咖喱鸡 3 n
+咙 9 x
+咚 291 o
+咚咚 254 o
+咛 56 x
+咝 142 o
+咝儿 2 n
+咝咝 3 n
+咝咝声 5 n
+咣 110 o
+咣当 55 o
+咤 18 x
+咥 2 zg
+咦 823 e
+咧 668 v
+咧咧 3 n
+咧咧嘴 4 n
+咧嘴 95 v
+咧嘴一笑 3 v
+咧嘴大笑 3 v
+咧开 3 v
+咧开嘴笑 3 v
+咧着 3 v
+咨 161 zg
+咨商 6 vn
+咨师访友 3 n
+咨文 73 n
+咨议 29 vn
+咨讯 5 nz
+咨讯网 3 n
+咨询 4342 vn
+咨询业 27 n
+咨询中心 3 n
+咨询会 46 n
+咨询台 11 n
+咨询员 24 n
+咨询团 9 n
+咨询处 36 n
+咨询室 3 n
+咨询师 3 n
+咨询性 7 n
+咨询摊 2 n
+咨询服务 3 n
+咨询机构 3 n
+咨询点 14 n
+咨询电话 3 n
+咨询组 4 n
+咨询者 12 n
+咨询部 5 n
+咩 56 zg
+咩咩叫 3 z
+咪 410 n
+咪咪 26 o
+咪咪叫 3 n
+咪唑 47 nz
+咪唑类 6 nz
+咪康唑 5 nz
+咪表 3 n
+咫 7 n
+咫尺 50 n
+咫尺万里 3 i
+咫尺之书 3 l
+咫尺之功 3 i
+咫尺之遥 3 l
+咫尺之间 8 l
+咫尺千里 2 i
+咫尺天涯 14 i
+咫尺天颜 3 i
+咫尺威颜 3 i
+咬 3558 v
+咬一口 3 i
+咬了一口 3 i
+咬伤 111 v
+咬住 3 v
+咬住不放 3 l
+咬入 3 v
+咬合 36 v
+咬合纸 3 n
+咬咬 30 v
+咬咬牙 66 i
+咬唇症 3 i
+咬啮 34 v
+咬嘴 3 v
+咬噬 22 v
+咬嚼 14 v
+咬姜呷醋 3 v
+咬字 17 n
+咬字儿 3 l
+咬字清晰 3 l
+咬字清楚 3 l
+咬字眼 3 l
+咬字眼儿 3 l
+咬定 46 v
+咬定牙关 5 l
+咬定牙根 3 i
+咬定青山不放松 4 l
+咬得菜根 3 n
+咬掉 3 v
+咬文啮字 3 vn
+咬文嚼字 27 l
+咬文齧字 3 vn
+咬断 3 v
+咬点 3 n
+咬烂 3 v
+咬牙 549 v
+咬牙切齿 479 i
+咬牙恨齿 3 i
+咬牙根 3 i
+咬牙齿 3 i
+咬着不放 3 l
+咬着唇 3 n
+咬着牙 3 l
+咬破 3 v
+咬碎 3 v
+咬磨 3 v
+咬紧 3 v
+咬紧牙 3 l
+咬紧牙关 135 l
+咬紧牙根 3 i
+咬群 3 n
+咬耳朵 9 n
+咬舌 3 v
+咬舌儿 3 l
+咬菜根 3 n
+咬血为盟 3 i
+咬起来 3 l
+咬钉 3 n
+咬钉嚼铁 3 i
+咬音咂字 3 n
+咬颊症 3 v
+咭 140 zg
+咭吱咯吱 3 o
+咯 425 o
+咯吱 14 o
+咯吱吱 4 o
+咯吱咯吱 24 o
+咯咯 192 o
+咯咯吱吱 2 o
+咯噔 74 o
+咯既然 3 z
+咯痰 11 v
+咯血 47 v
+咱 4884 r
+咱们 14946 r
+咱俩 528 r
+咱家 211 r
+咱村 57 r
+咱校 3 r
+咱班 3 r
+咱队 3 r
+咳 806 v
+咳唾凝珠 3 nz
+咳唾成珠 3 nz
+咳喘 27 nz
+咳嗽 1235 v
+咳嗽声 3 n
+咳嗽病 6 n
+咳嗽药 3 n
+咳声 3 v
+咳声叹气 2 i
+咳得 3 v
+咳珠唾玉 3 nz
+咳痰 29 v
+咳血 31 v
+咴 50 x
+咵 5 zg
+咶 2 zg
+咷 3 zg
+咸 440 ns
+咸与惟新 3 nr
+咸与维新 2 nr
+咸丰 635 ns
+咸丰县 257 ns
+咸丰帝 3 nr
+咸乎乎 3 nr
+咸五登三 3 nr
+咸兴 10 ns
+咸兴市 3 ns
+咸刘商 2 nr
+咸化 2 ns
+咸卤 3 n
+咸味 48 n
+咸咸的 6 nr
+咸嘴淡舌 3 nr
+咸嘴谈舌 3 n
+咸土 3 n
+咸宁 1606 ns
+咸宁市 1545 ns
+咸安区 256 ns
+咸宜 3 nr
+咸宣治 2 nr
+咸干品 4 n
+咸平 23 ns
+咸度 3 ns
+咸康 12 ns
+咸得 3 ns
+咸性 3 n
+咸水 54 ns
+咸水歌 2 nr
+咸水水 3 ns
+咸水湖 80 ns
+咸水相 2 nr
+咸水鱼 2 nr
+咸永道 3 nr
+咸池 14 ns
+咸津津 3 ns
+咸海 46 ns
+咸淡 4 nr
+咸淡适中 3 nr
+咸湖 3 ns
+咸熙 10 nz
+咸猪 2 n
+咸猪肉 3 n
+咸盐 3 n
+咸福宫 7 nr
+咸类 3 n
+咸肉 18 n
+咸菜 90 n
+咸菜乾 3 nr
+咸蛋 288 nr
+咸补海 3 nr
+咸认为 3 n
+咸豊 3 nz
+咸酥鸡 2 nr
+咸镜北道 4 ns
+咸镜南道 7 ns
+咸镜道 2 nr
+咸阳 366 ns
+咸阳一炬 3 nr
+咸阳宫 10 ns
+咸阳市 56 ns
+咸阳桥 3 ns
+咸风蛋雨 3 n
+咸鱼 45 n
+咸鱼翻身 3 nr
+咸鸭蛋 7 n
+咹 7 zg
+咻 27 g
+咼 2 zg
+咽 1093 v
+咽下 154 n
+咽下去 3 v
+咽不下 3 v
+咽住 3 v
+咽侧体 2 n
+咽后壁瓣 3 n
+咽喉 670 n
+咽喉炎 33 n
+咽喉癌 3 n
+咽喉部 3 n
+咽头 2 n
+咽头炎 3 n
+咽峡炎 9 n
+咽旁间隙 3 n
+咽气 51 n
+咽炎 32 n
+咽苦吐甘 3 n
+咽苦吞甘 3 n
+咽部 86 n
+咽镜 3 n
+咽鼓管 15 n
+咾 3 zg
+咿 51 o
+咿呀 21 o
+咿呀学语 2 i
+咿咿呀呀 32 o
+咿咿唔唔 3 o
+咿哑 3 i
+咿哑学语 3 v
+咿唔 3 o
+咿唷 3 o
+哀 695 vg
+哀丝豪竹 3 i
+哀乐 63 a
+哀乐声 6 i
+哀伤 142 v
+哀兵必胜 5 i
+哀叫 15 v
+哀史 3 n
+哀号 46 n
+哀号不已 3 i
+哀叹 74 v
+哀吊 3 v
+哀启 3 v
+哀告 65 n
+哀告宾服 3 n
+哀呼 3 v
+哀咽 3 v
+哀哀 3 an
+哀哀切切 3 i
+哀哀欲绝 5 i
+哀哀父母 4 i
+哀哉 3 a
+哀哭 3 v
+哀唤 3 v
+哀啼 3 z
+哀嚎 39 v
+哀声叹气 3 i
+哀天叫地 3 i
+哀婉 30 a
+哀子 3 n
+哀家 3 n
+哀帝 28 n
+哀怒 3 v
+哀怜 37 v
+哀思 34 v
+哀思如潮 3 i
+哀怨 86 v
+哀恳 3 a
+哀恸 17 a
+哀恸不已 3 v
+哀悯 3 v
+哀悼 168 v
+哀悼之意 3 n
+哀悼日 2 n
+哀悼者 3 n
+哀惜 3 v
+哀愁 56 a
+哀意 3 v
+哀感 3 a
+哀感中年 3 i
+哀感天地 3 i
+哀感顽艳 2 i
+哀戚 14 n
+哀梨蒸食 3 n
+哀歌 44 n
+哀毁瘠立 3 vn
+哀毁骨立 2 i
+哀求 332 v
+哀求不已 3 i
+哀求地 3 i
+哀泣 7 v
+哀牢夷 7 ns
+哀牢山 33 ns
+哀痛 64 a
+哀痛不已 3 i
+哀痛欲绝 3 i
+哀矜 3 a
+哀祭 3 v
+哀穷悼屈 3 n
+哀而不伤 5 i
+哀肠寸断 3 i
+哀艳 3 a
+哀苦 3 an
+哀荣 4 v
+哀诉 2 v
+哀辞 5 v
+哀鸣 46 v
+哀鸣不已 3 i
+哀鸿 3 n
+哀鸿遍地 3 i
+哀鸿遍野 7 i
+品 2278 v
+品位 691 n
+品冠 3 n
+品出 3 v
+品名 19 n
+品味 239 n
+品嚐 3 vn
+品头论足 22 i
+品头评足 3 i
+品头题足 3 i
+品学 3 n
+品学兼优 54 i
+品尝 321 v
+品尼高 3 n
+品川 4 n
+品德 2399 n
+品德教育 3 n
+品德课 2 n
+品德高尚 3 n
+品性 193 n
+品性不好 3 v
+品性好 3 n
+品数 5 n
+品族 3 n
+品月 3 n
+品格 292 n
+品格高尚 3 n
+品检 3 v
+品流 3 n
+品牌 3205 n
+品牌价值 3 n
+品牌优势 3 n
+品牌化 9 n
+品牌女装 3 n
+品牌形象 3 n
+品牌意识 3 n
+品牌战略 3 n
+品牌手机 3 n
+品牌效应 3 n
+品牌服装 3 n
+品牌服饰 3 n
+品牌机 3 n
+品牌童装 3 n
+品牌策略 3 n
+品牌网 3 n
+品牌设计 3 n
+品牌鞋 3 n
+品特 6 n
+品玉 3 n
+品目 3 n
+品相 3 n
+品种 5542 n
+品种改良 3 n
+品种登记 3 n
+品种繁多 3 n
+品种纯度 3 n
+品种鉴定 3 n
+品种齐全 3 i
+品竹弹丝 3 n
+品竹调丝 3 n
+品竹调弦 3 n
+品第 7 n
+品管 3 n
+品管圈 3 n
+品管部 3 n
+品箫 3 n
+品类 182 n
+品类繁多 3 i
+品系 40 n
+品红 13 n
+品红色 3 n
+品级 558 n
+品绩 3 n
+品绿 3 n
+品而第之 3 i
+品脱 7 v
+品色堂 3 n
+品节 3 n
+品花宝鉴 3 n
+品茗 40 n
+品茶 103 n
+品蓝 3 n
+品行 229 n
+品行不端 3 n
+品行不良 3 i
+品行优良 3 n
+品行好 3 n
+品行端正 3 n
+品议 3 n
+品论 3 n
+品评 117 n
+品读 9 v
+品貌 33 n
+品貌出众 3 n
+品貌双全 3 i
+品貌非凡 3 i
+品质 1562 n
+品质因数 3 n
+品质恶劣 3 n
+品质管制 3 n
+品质育种 3 n
+品质超群 3 nr
+品质音乐 3 n
+品赏 8 n
+品酒 30 n
+品鉴 4 n
+品题 10 n
+哂 195 vg
+哂然 3 v
+哂笑 19 v
+哂纳 3 v
+哃 2 zg
+哄 1881 v
+哄乱 3 v
+哄人 22 n
+哄传 76 vn
+哄到 3 v
+哄劝 3 v
+哄动 31 vn
+哄动一时 3 i
+哄哄 3 v
+哄堂 5 n
+哄堂大笑 63 i
+哄弄 3 v
+哄抢 93 v
+哄抬 38 v
+哄抬物价 3 i
+哄来哄去 3 i
+哄然 3 v
+哄然大笑 16 i
+哄笑 111 v
+哄笑声 22 i
+哄话 3 v
+哄诱 3 v
+哄走 3 v
+哄起来 3 v
+哄过 3 v
+哄过去 3 i
+哄过来 3 i
+哄逗 3 v
+哄闹 3 v
+哄骗 43 v
+哆 145 v
+哆哆嗦嗦 3 z
+哆啰哆嗦 3 z
+哆嗦 380 v
+哆罗罗 3 v
+哆里哆嗦 3 z
+哇 1045 y
+哇呀 3 e
+哇呀呀 3 o
+哇哇 270 o
+哇哇叫 3 z
+哇哇地 3 z
+哇哇声 3 z
+哇哇大叫 3 z
+哇哇大哭 3 vn
+哇啦 71 o
+哇啦哇啦 3 z
+哇喇 2 o
+哇噻 2 l
+哇塞 3 e
+哇巴因 3 l
+哈 2482 nr
+哈丁 27 nrt
+哈三卫 6 nr
+哈丽雅特 2 nrt
+哈乃斐 12 nr
+哈亚 2 ns
+哈亦命 2 nr
+哈什 6 nrt
+哈伊 6 nrt
+哈伊亚 12 nrt
+哈伊勒 4 nrt
+哈伊马角 8 nrt
+哈伍德 2 nrt
+哈伦 23 nrt
+哈伯 13 ns
+哈伯德 10 nr
+哈佐尔 4 nr
+哈佛 153 nrt
+哈佛商学院 11 nt
+哈佛大学 252 nt
+哈佛大学医学院 3 nt
+哈佛大学商学院 3 nt
+哈依尔 3 nr
+哈依洛 10 nr
+哈依纳 2 nr
+哈克 32 nrt
+哈克斯 3 nr
+哈克曼 3 nr
+哈克纳斯 3 nrt
+哈克贝 2 nr
+哈兰 4 ns
+哈兰德 5 nr
+哈兹木 2 nr
+哈兹里 2 nrt
+哈内亨 13 nr
+哈军工 3 nr
+哈利 29 ns
+哈利克雅尔 2 nrt
+哈利利 2 ns
+哈利勒 4 nr
+哈利卡 4 nr
+哈利德 4 nr
+哈利斯 3 nr
+哈利斯科州 2 ns
+哈利法 10 nr
+哈利法克斯 9 nrt
+哈利波 5 nr
+哈利逊 3 nr
+哈剌温 2 nr
+哈剌鲁 2 nr
+哈加吉 2 nr
+哈加尔 5 nr
+哈加纳 3 nr
+哈努克 2 nr
+哈努卡 2 nr
+哈勃 91 nr
+哈勒 15 nrt
+哈勒哈 2 nrt
+哈勒姆 8 nr
+哈勒尔 6 nr
+哈勒欣 5 nr
+哈医大 11 nt
+哈医大一院 2 nt
+哈医大二院 79 nt
+哈博罗内 13 ns
+哈卡姆 2 nr
+哈卡斯 7 nr
+哈叭狗 3 n
+哈合台 3 nt
+哈吉 17 nrt
+哈吧狗 3 n
+哈哈 1864 o
+哈哈哈 221 o
+哈哈哈哈 3 o
+哈哈地笑 3 l
+哈哈大笑 1577 l
+哈哈笑 3 nr
+哈哈网 3 nz
+哈哈镜 12 nr
+哈啰 3 z
+哈喇 9 o
+哈喇子 7 nr
+哈坎苏克 3 nrt
+哈基姆 7 nr
+哈基宁 3 nr
+哈塔夫 11 nr
+哈塔米 18 nrt
+哈塔维 4 nr
+哈塞尔 12 nr
+哈士 2 ns
+哈士奇 3 nr
+哈大线 14 nz
+哈大霸 8 nr
+哈夫拉 5 nrt
+哈夫斯 12 nr
+哈夫曼 3 nr
+哈夫迪 2 nr
+哈奈特 3 nr
+哈奈菲 2 nr
+哈好颇多 3 nz
+哈姆 23 nrt
+哈姆丹 2 nr
+哈姆拉 3 nrt
+哈姆林 2 nr
+哈姆莱特 2 nrt
+哈姆迪 3 nr
+哈姆雷 5 nr
+哈姆雷特 90 nrt
+哈姆雷特式 3 nrt
+哈宁昆 4 nr
+哈密 235 nrt
+哈密地区 7 ns
+哈密尔顿 26 nrt
+哈密市 7 ns
+哈密瓜 22 nr
+哈密网 3 nr
+哈密路 3 nr
+哈密顿 3 nr
+哈密顿圈 3 nz
+哈密顿量 3 nr
+哈尔 46 nrt
+哈尔丹 5 nr
+哈尔乌 2 nr
+哈尔克 14 nrt
+哈尔克岛 6 nrt
+哈尔切夫 3 nrt
+哈尔哈 2 nrt
+哈尔基 2 nrt
+哈尔巴 2 nrt
+哈尔帕 2 nrt
+哈尔德 5 nrt
+哈尔斯 7 nrt
+哈尔斯克 4 nrt
+哈尔施 3 nr
+哈尔格萨 5 nrt
+哈尔滨 988 ns
+哈尔滨人 7 nz
+哈尔滨军事工程学院 2 nt
+哈尔滨制药六厂 2 nt
+哈尔滨医科大学第二附属医院 4 nt
+哈尔滨工业大学 52 nt
+哈尔滨工程大学 10 nt
+哈尔滨市 139 ns
+哈尔滨市妇联 3 nt
+哈尔滨市委 5 nt
+哈尔滨港 3 ns
+哈尔滨火车站 4 nt
+哈尔滨理工大学 3 nt
+哈尔滨铁路局 2 nt
+哈尔科 2 nrt
+哈尔科夫 56 nrt
+哈尔腾 6 nr
+哈尔茨 10 nrt
+哈尔蒂 2 nrt
+哈尔西 6 nrt
+哈尔语 4 nz
+哈尔贾 3 nr
+哈尔迪亚 2 nrt
+哈尔麻 3 nr
+哈尼 68 nrt
+哈尼亚 2 ns
+哈尼人 3 nrt
+哈尼夫 3 nr
+哈尼尔 9 nr
+哈尼族 569 nz
+哈尼法 2 nr
+哈尼语 4 nz
+哈局 3 n
+哈工大 66 nt
+哈巴 25 nrt
+哈巴德 3 nrt
+哈巴河 8 ns
+哈巴河县 2 ns
+哈巴烈那 3 nrt
+哈巴狗 17 nr
+哈巴罗夫斯克 20 nrt
+哈市 41 ns
+哈布卜 2 nr
+哈布尔 2 nrt
+哈布斯堡 108 nrt
+哈师大 3 nr
+哈希 3 nrt
+哈希姆 11 nr
+哈帕勒 3 nrt
+哈异译 2 nr
+哈弗尔 4 nr
+哈弗斯 3 nr
+哈得孙 27 nr
+哈得孙湾 26 ns
+哈得斯 2 nr
+哈得逊 2 nr
+哈德 24 nrt
+哈德威 2 nr
+哈德成 3 nr
+哈德拉毛 2 nrt
+哈德斯 3 nr
+哈德森 2 nr
+哈德良 9 nr
+哈德逊 4 nr
+哈德门 3 nr
+哈总管 3 nr
+哈恩 25 nrt
+哈扎 2 nrt
+哈扎布 3 nr
+哈扎拉 3 nrt
+哈托 3 nrt
+哈托尔 4 nrt
+哈拉 50 nrt
+哈拉哈河 5 ns
+哈拉夫 4 nrt
+哈拉尔 6 nrt
+哈拉帕 19 nrt
+哈拉智 3 nr
+哈拉浩 2 nr
+哈拉海湾村 2 ns
+哈拉湖 3 ns
+哈拉赫 2 nr
+哈拉雷 27 nr
+哈拉韦 4 nr
+哈拉齐 3 nr
+哈斯 21 nrt
+哈斯勒 19 nrt
+哈斯勒姆 12 nrt
+哈斯宝 4 nr
+哈斯布 5 nrt
+哈斯效应 3 nz
+哈斯特 5 nrt
+哈斯登 2 nrt
+哈斯科 4 nrt
+哈斯高娃 3 nr
+哈日 3 nrt
+哈日族 3 nz
+哈普斯 16 nr
+哈普斯堡 4 nrt
+哈普西 13 nr
+哈曼 3 nrt
+哈朗先 2 nr
+哈朗辅 2 nr
+哈木孙 2 nr
+哈杜尔 6 nrt
+哈杜尔舒 3 nrt
+哈杰尔 7 nr
+哈杰泰 2 nr
+哈林根 3 nz
+哈林队 3 nt
+哈林顿 2 nr
+哈根 5 ns
+哈根达斯 10 nrt
+哈格 2 nrt
+哈格斯 5 nr
+哈桑 54 nrt
+哈桑区 3 ns
+哈桑纳尔 2 ns
+哈桑萨斯 3 ns
+哈梅内伊 18 nrt
+哈森海德 3 ns
+哈欠 102 nr
+哈比人 3 nrt
+哈比卜 4 nr
+哈比布拉 5 nrt
+哈氏网 3 nr
+哈气 16 nz
+哈沃斯 6 nr
+哈泼斯 3 nr
+哈洛德 2 nrt
+哈洽会 3 nr
+哈济亲王 2 nr
+哈灵顿 2 nr
+哈特 77 nrt
+哈特利 2 nrt
+哈特勒 4 nrt
+哈特尔 2 nr
+哈特山 2 nr
+哈特曼 7 nr
+哈特河 2 ns
+哈特福 2 nr
+哈特福德 4 nrt
+哈特莱 3 nr
+哈特里 3 nrt
+哈狗帮 3 nr
+哈珀 12 nrt
+哈瑙 8 nrt
+哈瑟瑞 2 nr
+哈瓦利 14 nrt
+哈瓦特 2 nrt
+哈瓦那 108 nrt
+哈登 4 nrt
+哈登堡 10 nr
+哈福兹 3 nr
+哈科特 2 nrt
+哈科特港 11 ns
+哈立德 14 nr
+哈立麻 6 nr
+哈站 3 ns
+哈米 3 nrt
+哈米德 32 nrt
+哈米拉 2 nrt
+哈米提 4 nr
+哈米特 8 nrt
+哈纳斯 2 nr
+哈纳迪 2 nr
+哈继铭 15 nr
+哈维亚 3 ns
+哈维兰 5 nr
+哈维尔 21 nr
+哈罗 49 nrt
+哈罗德 33 nrt
+哈罗维兹 3 nrt
+哈耳琼 16 nr
+哈耶克 17 nrt
+哈肯 7 nrt
+哈腰 16 n
+哈航 26 j
+哈苏 3 ns
+哈苏纳 2 nr
+哈茨 3 nrt
+哈茨山 3 ns
+哈药集团 11 nt
+哈莉维尔 4 nrt
+哈莱姆 4 nr
+哈莱斯 5 nr
+哈菲兹 18 nr
+哈萨 3 nrt
+哈萨克 417 nr
+哈萨克人 3 nrt
+哈萨克斯坦 373 nrt
+哈萨克斯坦共和国 13 ns
+哈萨克斯坦队 3 nz
+哈萨克族 346 nz
+哈萨克语 28 nz
+哈萨河 3 ns
+哈萨维 2 nr
+哈蒂 2 nrt
+哈蒙 2 nrt
+哈蒙德 4 nr
+哈虎文 2 nr
+哈蜜瓜 2 nr
+哈蟆镜 3 l
+哈西 4 ns
+哈西娜 5 nr
+哈西特 6 nrt
+哈西迈 2 nr
+哈西鲁 2 nr
+哈诺 3 nrt
+哈诺贝 2 nr
+哈谟第 48 nr
+哈谢 40 nrt
+哈谢克 5 nrt
+哈贝马斯 3 nrt
+哈贾吉 2 nr
+哈赤亲 2 nr
+哈赤和尚 7 nr
+哈赤大师 3 nr
+哈辛塔 2 nrt
+哈达 102 nrt
+哈达威 3 nr
+哈达铺 18 ns
+哈迈德 2 nrt
+哈迪 5 nr
+哈迪亚 2 nrt
+哈迪伦 3 nr
+哈迪扬 10 nr
+哈迪斯 3 nrt
+哈迪杨 2 nr
+哈里 333 nrt
+哈里勒 2 nrt
+哈里发 3 nr
+哈里姆 5 nrt
+哈里宾 2 nrt
+哈里尔 2 nrt
+哈里斯 27 nrt
+哈里斯堡 3 nrt
+哈里曼 9 nrt
+哈里森 39 nr
+哈里法克斯 2 nrt
+哈里波特 3 nrt
+哈里逊 3 nrt
+哈里里 2 nrt
+哈金斯 3 nr
+哈钦松 3 nr
+哈钦森 13 nr
+哈钦森牙 3 nr
+哈隆 4 o
+哈雷彗星 36 nr
+哈韦利 2 nrt
+哈韦尔 19 nrt
+哈韩族 3 nr
+哈顿 6 nrt
+哈飞公司 2 nt
+哈马 13 ns
+哈马丹 16 nr
+哈马姆 3 nrt
+哈马德 7 nrt
+哈马斯 70 nrt
+哈马杰 2 nr
+哈马迪 20 nr
+哈默尔 2 nrt
+哈默尔恩 2 nrt
+哈默斯 3 nrt
+哈齐 3 nrt
+哉 679 y
+哊 2541 zg
+哌 37 n
+哌唑嗪 2 nz
+哌啶 10 n
+哌嗪 5 n
+哌嗪二酮 3 n
+哌替啶 4 nz
+响 5346 zg
+响亮 473 a
+响动 250 v
+响叮当 3 i
+响和景从 3 n
+响器 66 n
+响地 3 n
+响堂铺 2 n
+响声 518 n
+响头 3 v
+响导 26 n
+响尾蛇 103 n
+响应 1171 v
+响应值 3 n
+响应函数 3 n
+响应分析 5 i
+响应号召 3 n
+响应窗口 3 i
+响应者 11 n
+响应速度 3 n
+响度 31 n
+响当当 86 v
+响彻 243 v
+响彻云表 3 i
+响彻云际 3 i
+响彻云霄 138 i
+响成 3 v
+响指 10 n
+响晴 3 v
+响杨 3 n
+响板 7 n
+响水 8 n
+响水县 2 ns
+响炮 3 n
+响答影随 3 i
+响箭 42 n
+响起 1111 v
+响遍 10 v
+响遏云行 3 i
+响遏行云 4 i
+响铃 12 n
+响铃钟 3 n
+响铛铛 3 i
+响雷 10 n
+响鞭 3 v
+响音 8 n
+响马 52 n
+响马党羽 3 n
+响鼻 13 v
+哎 1282 e
+哎呀 378 e
+哎呀呀 21 y
+哎哟 236 e
+哏 26 v
+哐 122 o
+哐啷 24 o
+哐当 14 o
+哑 639 v
+哑剧 33 n
+哑口 3 n
+哑口无声 3 i
+哑口无言 85 i
+哑吧 3 n
+哑哑 3 n
+哑嗓 3 n
+哑场 3 n
+哑女 4 n
+哑婆婆 3 n
+哑子 3 n
+哑子做梦 3 i
+哑子吃黄连 3 i
+哑子寻梦 3 i
+哑子得梦 3 i
+哑子托梦 3 n
+哑巴 714 n
+哑巴亏 13 n
+哑巴吃 3 n
+哑巴吃黄 3 i
+哑巴吃黄连 9 i
+哑弹 2 n
+哑梢公 3 l
+哑火 5 n
+哑炮 7 n
+哑然 28 z
+哑然失笑 45 i
+哑然无声 2 i
+哑言失笑 3 i
+哑语 11 n
+哑调 3 n
+哑谜 31 n
+哑迷 3 n
+哑铃 41 n
+哑门 4 n
+哑音 3 n
+哑默悄声 3 z
+哒 297 zg
+哒嗪 3 n
+哓 11 zg
+哓哓 3 z
+哓哓不休 3 v
+哓音瘏口 3 nz
+哔 20 n
+哔叽 27 n
+哔哔声 3 z
+哔哩啪啦 3 o
+哕 81 zg
+哖 2 zg
+哗 701 vg
+哗世动俗 3 i
+哗世取名 3 i
+哗世取宠 3 i
+哗众 4 v
+哗众取宠 44 i
+哗变 110 v
+哗哗 15 v
+哗哗哗 3 o
+哗哗啦 3 o
+哗哗啦啦 6 o
+哗啦 105 o
+哗啦一声 3 z
+哗啦哗啦 41 o
+哗啦啦 108 o
+哗啦声 3 z
+哗喇 3 o
+哗喇喇 3 o
+哗然 97 z
+哗笑 7 v
+哙 22 g
+哚 2 nr
+哜 13 g
+哝 110 x
+哞 17 o
+哟 1341 zg
+哟大过年 3 v
+哠 28 zg
+員 5 zg
+哥 4609 n
+哥们 97 n
+哥们义气 3 n
+哥们儿 95 n
+哥伦布 201 ns
+哥伦比亚 410 ns
+哥伦比亚人 5 nrt
+哥伦比亚共和国 34 ns
+哥伦比亚号 16 nz
+哥伦比亚大学 179 nt
+哥伦比亚政府 4 nt
+哥伦比亚河 18 ns
+哥伦比亚特区 12 ns
+哥伦比亚省 16 ns
+哥伦比亚革命武装力量 2 n
+哥俩 57 n
+哥儿 154 n
+哥儿义气 3 n
+哥儿们 33 n
+哥儿俩 227 n
+哥哥 4323 ns
+哥哥妹妹 3 nr
+哥嫂 3 n
+哥廷根 4 nr
+哥廷根大学 8 nt
+哥得兰 2 ns
+哥德 12 ns
+哥德人 3 nr
+哥德堡 28 ns
+哥德堡大学 3 nt
+哥德尔 3 nr
+哥德巴赫 10 nrt
+哥德巴赫猜想 32 nz
+哥德式 3 nr
+哥德曼 3 nr
+哥斯拉 3 ns
+哥斯达黎加 160 ns
+哥斯达黎加队 7 nt
+哥本哈根 97 ns
+哥本哈根大学 29 nt
+哥林 2 ns
+哥比 2 ns
+哥特 49 ns
+哥特人 17 nrt
+哥特式 107 nz
+哥登堡 3 ns
+哥白尼 98 nr
+哥窑 19 ns
+哥罗芳 3 nr
+哥老会 18 n
+哥萨克 116 ns
+哥萨克人 8 nrt
+哥达 27 ns
+哥达德 12 ns
+哥达纲领 3 nr
+哥里 3 ns
+哥顿 5 ns
+哦 3470 zg
+哦哦哦 3 v
+哦开机可 3 v
+哧 200 o
+哧哧 3 o
+哧溜 9 o
+哨 1638 ng
+哨位 21 n
+哨兵 284 n
+哨卡 19 n
+哨口 10 n
+哨响 23 n
+哨塔 3 n
+哨声 70 n
+哨声波 3 n
+哨子 63 n
+哨岗 5 n
+哨房 3 n
+哨所 57 n
+哨探 71 n
+哨棒 27 n
+哨楼 4 n
+哨站 4 n
+哨音 32 n
+哨音响 3 n
+哨音声 3 n
+哩 4421 y
+哩哩啦啦 4 z
+哩哩啰啰 3 z
+哩哩罗罗 3 v
+哩噜 3 z
+哩溜歪斜 3 z
+哪 12138 r
+哪一位 3 r
+哪一刻 3 r
+哪一只 3 c
+哪一块 3 r
+哪一天 3 r
+哪一年 3 r
+哪一方面 3 c
+哪一条 3 mq
+哪一点 3 mq
+哪一篇 3 r
+哪一部 3 r
+哪一首 3 l
+哪个 1874 r
+哪么多 3 r
+哪些 2849 r
+哪些因素 3 v
+哪些地方 3 vn
+哪些方面 3 z
+哪些项目 3 nz
+哪份 3 mq
+哪会儿 3 r
+哪会子 3 r
+哪位 145 r
+哪儿 2244 r
+哪几 3 r
+哪几个 3 l
+哪几天 3 l
+哪几种 3 l
+哪句 3 l
+哪吒 98 nrt
+哪吒闹海 3 v
+哪国 3 r
+哪够 3 l
+哪天 3 r
+哪家 108 r
+哪年哪月 3 vn
+哪怕 1038 c
+哪敢 3 l
+哪有什么 3 l
+哪有卖 3 l
+哪条 3 mq
+哪样 64 r
+哪次 3 r
+哪知 3 l
+哪种 3 r
+哪篇 3 r
+哪行 3 r
+哪边 35 r
+哪部 3 r
+哪里 7571 r
+哪里找 3 l
+哪里话 64 l
+哪门子 46 l
+哪集 3 l
+哪项 3 r
+哭 7478 v
+哭上去 3 l
+哭上来 3 l
+哭丧 25 v
+哭丧棒 55 i
+哭丧着脸 98 l
+哭丧脸 3 l
+哭个够 3 v
+哭个痛快 3 l
+哭于斯 3 l
+哭出 3 v
+哭叫 170 v
+哭叫声 18 n
+哭号 3 n
+哭哭 3 v
+哭哭啼啼 97 z
+哭哭笑笑 3 i
+哭啼 3 z
+哭喊 137 v
+哭喊声 26 i
+哭坟 3 n
+哭墓 3 n
+哭墙 16 n
+哭声 771 n
+哭天哭地 2 i
+哭天喊地 7 i
+哭天嚎地 3 z
+哭天抢地 10 i
+哭天抹泪 6 i
+哭尽 3 v
+哭成 3 v
+哭成一团 3 l
+哭无泪 3 i
+哭来 3 v
+哭来哭去 3 i
+哭死了 3 l
+哭求 17 v
+哭泣 543 v
+哭泣声 19 i
+哭泪 3 n
+哭灵 7 n
+哭穷 15 z
+哭笑不得 173 l
+哭笑俱齐 3 i
+哭肿 3 n
+哭脏 3 n
+哭脸 3 n
+哭腔 52 n
+哭诉 127 v
+哭调 3 v
+哭醒 3 v
+哭闹 80 v
+哭骂 3 v
+哭鼻子 31 n
+哮 39 n
+哮喘 328 n
+哮喘病 60 n
+哮证 3 n
+哮鸣音 7 n
+哱 44 zg
+哲 515 n
+哲人 82 n
+哲人其萎 3 n
+哲伦 3 nrt
+哲嗣 3 n
+哲学 4412 n
+哲学体系 3 n
+哲学博士 3 n
+哲学原理 3 n
+哲学史 182 n
+哲学学派 3 n
+哲学家 929 n
+哲学应用 3 n
+哲学思想 3 n
+哲学思潮 3 n
+哲学流派 3 n
+哲学理论 3 n
+哲学笔记 3 n
+哲学系 80 n
+哲学范畴 3 n
+哲学著作 3 n
+哲学观 2 n
+哲学评论 3 n
+哲学领域 3 n
+哲宗 34 nrt
+哲思 3 n
+哲理 258 n
+哲理性 49 n
+哲盟 2 n
+哲罗星 3 n
+哲罗鱼 2 n
+哲蚌寺 27 ns
+哲言 3 n
+哲里木 2 nrt
+哲里木盟 19 ns
+哳 18 zg
+哵 149 zg
+哺 172 zg
+哺乳 146 n
+哺乳动物 369 n
+哺乳室 3 n
+哺乳期 74 n
+哺乳类 133 n
+哺乳纲 44 n
+哺养 37 n
+哺糟啜醨 3 z
+哺糟歠醨 3 n
+哺育 98 n
+哺育之恩 3 l
+哻 7 zg
+哼 3113 v
+哼出 3 v
+哼哈二将 11 n
+哼哧 6 o
+哼哼 308 v
+哼哼哈哈 15 z
+哼哼唧唧 3 z
+哼唧 8 o
+哼唱 24 v
+哼唷 3 o
+哼声 3 v
+哼歌 3 v
+哼着唱 3 v
+哼腰 3 v
+哼起 3 v
+哼起来 3 v
+哽 76 zg
+哽住 3 v
+哽咽 557 v
+哽哽咽咽 3 n
+哽噎 6 v
+哽在 3 v
+哽塞 4 v
+哽着 3 v
+哿 20 g
+唁 15 n
+唁函 3 n
+唁电 5 n
+唃 8 zg
+唄 5 zg
+唆 276 zg
+唆使 250 v
+唇 890 zg
+唇不离腮 3 i
+唇亡齿寒 16 i
+唇侧翼缘 3 i
+唇向错位 3 n
+唇吻 6 n
+唇尖舌利 3 l
+唇干口燥 3 l
+唇干舌燥 9 l
+唇弓 3 nz
+唇形 3 n
+唇形科 14 nz
+唇彩 8 nz
+唇挡 3 n
+唇揭齿寒 3 i
+唇敝舌腐 3 l
+唇杆 3 n
+唇枪舌剑 34 i
+唇枪舌战 3 i
+唇沟板 3 nz
+唇炎 3 nz
+唇焦口燥 3 l
+唇焦舌敝 3 i
+唇牵开器 3 l
+唇瓣 3 n
+唇疤疹 3 n
+唇疱疹 3 n
+唇竭齿寒 3 i
+唇系带 3 n
+唇红 3 nz
+唇红缘 3 n
+唇红齿白 14 l
+唇缘 3 n
+唇腐齿落 3 i
+唇腭裂 3 j
+唇腺 3 n
+唇膏 46 nz
+唇舌 58 n
+唇舌之争 3 l
+唇色 3 n
+唇裂 14 n
+唇角 3 nz
+唇辅相连 3 i
+唇部 27 n
+唇面 3 n
+唇音 6 n
+唇齿 29 n
+唇齿之邦 3 i
+唇齿相依 11 i
+唇齿相须 3 i
+唇齿音 3 n
+唉 2420 zg
+唉叹 6 v
+唉呀 3 i
+唉唉叫 3 z
+唉声叹气 116 i
+唎 7 zg
+唏 50 zg
+唏嗒唏嗒 3 o
+唏嘘 92 v
+唐 4769 nr
+唐一娜 407 nr
+唐一禾 4 nr
+唐一菲 256 nr
+唐三友 3 nr
+唐三弟 2 nr
+唐三彩 41 nr
+唐三爷 3 nr
+唐三省 2 ns
+唐三藏 48 nr
+唐上 3 t
+唐中宗 25 nr
+唐临晋帖 3 nr
+唐为云 2 nr
+唐为幽 128 nr
+唐为振 2 nr
+唐为敌 2 nr
+唐义净 2 nr
+唐之享 2 nr
+唐之奇 3 nr
+唐之安 3 nr
+唐书 47 nr
+唐书兵 2 nr
+唐书表 2 nr
+唐乾元 4 nr
+唐乾宁 2 nr
+唐乾封 2 nr
+唐乾符 3 nr
+唐二哥 2 nr
+唐五代 3 t
+唐亚伟 2 nr
+唐京 3 ns
+唐人 133 nr
+唐人传 2 nr
+唐人杨 2 nr
+唐人街 33 nr
+唐人谓 2 nr
+唐人馆 2 nr
+唐仆尚 3 nr
+唐代 2269 t
+唐代宗 28 nr
+唐以文 3 nr
+唐以朱 3 nr
+唐仪凤 2 nr
+唐仲友 6 nr
+唐会昌 10 nr
+唐传奇 17 nr
+唐伯英 2 nr
+唐伯虎 59 nr
+唐俊生 32 nr
+唐僖宗 15 nr
+唐僧 863 nr
+唐僧乃 7 nr
+唐僧亲 2 nr
+唐僧入 3 nr
+唐僧勒 4 nr
+唐僧合 5 nr
+唐僧和尚 2 nr
+唐僧哩 5 nr
+唐僧喜 5 nr
+唐僧型 4 nr
+唐僧备 2 nr
+唐僧复 2 nr
+唐僧径 3 nr
+唐僧怒 2 nr
+唐僧才 3 nr
+唐僧扶 2 nr
+唐僧抱 2 nr
+唐僧拿 3 nr
+唐僧推 2 nr
+唐僧擒 2 nr
+唐僧治 2 nr
+唐僧猜 2 nr
+唐僧玄 4 nr
+唐僧笑 2 nr
+唐僧肉 5 nr
+唐僧背 2 nr
+唐僧脱 3 nr
+唐僧蒸 2 nr
+唐僧藏 2 nr
+唐僧西 6 nr
+唐僧见 2 nr
+唐僧言 2 nr
+唐僧谢 5 nr
+唐僧转 2 nr
+唐僧进 3 nr
+唐僧闻 3 nr
+唐僧马 4 nr
+唐僧骑 2 nr
+唐僧高 3 nr
+唐兀惕 2 nr
+唐兀或 2 nr
+唐元和 4 nr
+唐光启 5 nr
+唐光雄 8 nr
+唐入宋 2 nr
+唐六典 16 nr
+唐六如 2 nr
+唐六爷 5 nr
+唐六臣 5 nr
+唐兴元 2 nr
+唐兵复 2 nr
+唐其势 11 nr
+唐册立 3 nr
+唐再丰 2 nr
+唐再加 52 nr
+唐军征 2 nr
+唐军攻 6 nr
+唐初 198 t
+唐初亦 3 nr
+唐初名 2 nr
+唐初复 4 nr
+唐初属 2 nr
+唐初才 2 t
+唐初承 2 nr
+唐初改 2 nr
+唐初相 2 nr
+唐初至 5 nr
+唐初设 2 nr
+唐初贞 3 nr
+唐制复 3 nr
+唐加勒 2 nr
+唐努乌 5 nr
+唐努乌拉 3 nrt
+唐努乌梁 3 nr
+唐努图 2 nr
+唐努山 3 nr
+唐劲道 2 nr
+唐北庭 2 nr
+唐南诏 8 nr
+唐博学 3 nr
+唐占魁 85 nrfg
+唐卡洛 2 nr
+唐卡画 3 nr
+唐卫彬 2 nrfg
+唐县 20 ns
+唐及唐 3 nr
+唐双宁 3 nr
+唐发华 2 nr
+唐叔虞 8 nr
+唐古征 2 nr
+唐古忒 2 nr
+唐古拉 16 nr
+唐古拉山 124 ns
+唐古拉山脉 21 ns
+唐古文 2 nr
+唐古特 7 nr
+唐司令 4 nr
+唐吉柯德 3 nr
+唐吉诃 18 nr
+唐吉诃德 3 nr
+唐君铂 2 nr
+唐命云 2 nr
+唐和尚 4 nr
+唐咸亨 2 nr
+唐咸通 9 nr
+唐哀帝 3 nr
+唐哉皇哉 3 nr
+唐四杰 12 nr
+唐国 4 ns
+唐国强 90 nr
+唐国汉 4 nr
+唐圣僧 5 nr
+唐圣历 3 nr
+唐在今 4 nr
+唐圭璋 4 nr
+唐复名 2 nr
+唐复改 2 nr
+唐大人 4 nr
+唐大历 10 nr
+唐大明 5 nr
+唐大沛 3 nr
+唐天 6 t
+唐天子 3 nr
+唐天宁 2 nr
+唐天宝 44 nr
+唐天授 3 nr
+唐天标 2 nr
+唐太太 2 nr
+唐太宗 289 nr
+唐好白 2 nr
+唐姚思 3 nr
+唐娜薇 2 nr
+唐婉如 11 nr
+唐孔颖 8 nr
+唐季 5 t
+唐学华 5 nr
+唐学曾 47 nr
+唐宁街 24 nr
+唐安国 2 ns
+唐安西 3 nr
+唐宋 276 t
+唐宋之 6 nr
+唐宋元 11 nr
+唐宋八 23 nr
+唐宋八大 3 nr
+唐宋古 4 nr
+唐宋文 4 nr
+唐宋时 6 nr
+唐宋木 2 nr
+唐宋派 14 nr
+唐宋皆 2 nr
+唐宋词 6 nr
+唐宋诸 5 nr
+唐宋间 4 nr
+唐宗宋 10 nr
+唐宗汉 2 nr
+唐官屯 2 nr
+唐宝锷 4 nr
+唐实叉 2 nr
+唐宣宗 9 nr
+唐宪宗 50 nr
+唐家会村 3 nr
+唐家岭 7 nr
+唐家庄 3 nr
+唐家河 10 nr
+唐家湾 2 nr
+唐家琪 2 nr
+唐家璇 218 nr
+唐寅 73 nr
+唐寅兄 2 nr
+唐寓之 2 nr
+唐封其 2 nr
+唐封行 3 nr
+唐将军 6 nr
+唐将领 2 nr
+唐小姐 5 nr
+唐小岷 32 nr
+唐小英 3 nr
+唐小西 2 nr
+唐尧 12 nr
+唐尧东 37 nr
+唐尧虞 2 nr
+唐属营 3 nr
+唐山人 14 nr
+唐山地区 4 ns
+唐山大 3 nr
+唐山大兄 3 nr
+唐山市 56 ns
+唐山市委 2 nt
+唐山站 3 nr
+唐山钢铁公司 4 nt
+唐山镇 2 nr
+唐山陶瓷 5 nr
+唐州 9 ns
+唐州城 3 ns
+唐州连 2 nr
+唐师曾 3 nr
+唐师父 3 nr
+唐庄乡 3 nr
+唐庄镇 2 nr
+唐府改 2 nr
+唐庭斌 9 nr
+唐廷优 2 nr
+唐廷派 3 nr
+唐廷诏 2 nr
+唐建中 4 nr
+唐建宇 2 nr
+唐建平 8 nr
+唐建立 2 nr
+唐开元 47 nr
+唐开成 5 nr
+唐式飞 2 nr
+唐张太 2 nr
+唐张巡 2 nr
+唐张彦 3 nr
+唐律疏 27 nr
+唐徕渠 3 nr
+唐御史 3 nr
+唐御妹 3 nr
+唐御弟 6 nr
+唐德刚 6 nr
+唐德华 2 nr
+唐德宗 42 nr
+唐志中 3 nr
+唐志德 2 nr
+唐志远 2 nr
+唐总章 2 nr
+唐懿宗 2 nr
+唐才 3 t
+唐才常 56 nr
+唐招提寺 11 nr
+唐改其 3 nr
+唐敏之 21 nr
+唐敏敏 3 nr
+唐敖庆 10 nr
+唐文亮 38 nr
+唐文宗 9 nr
+唐文成 7 nr
+唐文标 2 nr
+唐文粹 4 nr
+唐文雅 2 nr
+唐文龙 3 nr
+唐斌见 3 nr
+唐斌领 3 nr
+唐明周 5 nr
+唐明皇 38 nr
+唐昭宗 29 nr
+唐显庆 6 nr
+唐晓伟 5 nr
+唐晓军 3 nr
+唐晓芙 2 nr
+唐景云 3 nr
+唐景福 2 nr
+唐有祺 2 nr
+唐朝 826 t
+唐朝廷 2 nr
+唐朝阳 17 nr
+唐末 56 t
+唐末天 2 t
+唐末有 2 nr
+唐末朱 2 nr
+唐末至 2 nr
+唐末藩 6 nr
+唐李吉 4 nr
+唐李延寿 3 nr
+唐李问 2 nr
+唐李鼎 3 nr
+唐杖子 2 nr
+唐杜氏 4 nr
+唐杨端 3 nr
+唐树备 5 nr
+唐格森 2 nr
+唐棣 3 ns
+唐棣华 2 nrfg
+唐森德 11 nr
+唐槐秋 2 nr
+唐正东 23 nr
+唐武宗 19 nr
+唐武德 68 nr
+唐永徽 8 nr
+唐永泰 3 nr
+唐永淑 11 nrfg
+唐永銮 5 nr
+唐求法 8 nr
+唐汤民 3 nr
+唐汴州 6 nr
+唐河 30 nr
+唐河县 8 ns
+唐治平 3 nr
+唐泽寿明 3 nr
+唐洋 6 ns
+唐浩明 3 nr
+唐海 14 nr
+唐海伦 2 nr
+唐海县 4 ns
+唐淮源 2 nr
+唐湘岳 2 nr
+唐炳然 2 nr
+唐煮宋 3 nr
+唐牛儿 33 nr
+唐物女子 2 n
+唐物茶 3 nr
+唐献名 2 nr
+唐玄奘 15 nr
+唐玄宗 211 nr
+唐玉牒 3 nr
+唐王 92 nr
+唐王先 2 nr
+唐王御 2 nr
+唐王惊 2 nr
+唐王朱 5 nr
+唐王闻 3 nr
+唐王驾 5 nr
+唐璜 17 nr
+唐生智 26 nr
+唐登科 2 nr
+唐白居 2 nr
+唐睿宗 6 nrt
+唐知州 2 nr
+唐穆宗 9 nr
+唐突 64 nr
+唐突西子 3 nr
+唐突西施 3 nr
+唐纪 5 t
+唐纪琛 3 nr
+唐纳 7 nr
+唐纳德 18 nr
+唐纳森 3 nr
+唐绍仪 49 nr
+唐继尧 53 nr
+唐维红 5 nr
+唐置伊 3 nr
+唐置安 3 nr
+唐置羁 2 nr
+唐翠沉 19 nr
+唐老爷 28 nr
+唐老鸦 3 n
+唐老鸭 10 n
+唐而盛 2 nr
+唐耶尔 4 nr
+唐耿良 2 nr
+唐肃宗 26 nr
+唐胜利 11 nr
+唐臣升 3 nr
+唐至元 2 nr
+唐至宋 2 nr
+唐至德 9 nr
+唐至清 3 nr
+唐良智 256 nr
+唐良相 2 nr
+唐花 3 nr
+唐英年 3 nr
+唐菖蒲 12 n
+唐蔡州 2 nr
+唐虞之治 3 nr
+唐装 13 nr
+唐西州 6 ns
+唐设西 4 nr
+唐诗 205 nr
+唐诗三百 3 nr
+唐诗咏 3 n
+唐诗宋词 3 nr
+唐诗歌 7 nr
+唐语林 3 nr
+唐贞元 15 nr
+唐贞观 323 nr
+唐贾公 6 nr
+唐赛儿 7 nr
+唐运张 2 nr
+唐通差 4 nr
+唐道宣 5 nr
+唐郭子 2 nr
+唐金江 2 nr
+唐金秀 21 nr
+唐锐涛 2 nr
+唐长安 5 nr
+唐长庆 2 nr
+唐长老 18 nr
+唐阎立 2 nr
+唐陆希 2 nr
+唐陆羽 2 nr
+唐陈玄 2 nr
+唐雷恒 2 nr
+唐霍塞 4 nr
+唐靖 2 t
+唐韩愈 2 nr
+唐音统 2 nr
+唐韵正 2 nr
+唐顺之 24 nr
+唐顺宗 6 nr
+唐颜师 2 nr
+唐高宗 55 nr
+唐高祖 50 nr
+唐高齐 3 nr
+唐龙通 2 nr
+唑 89 x
+唔 476 y
+唔该晒 3 v
+唖 2 zg
+唙 3 zg
+唞 4 zg
+唠 44 v
+唠叨 172 z
+唠唠叨叨 67 z
+唠嗑 12 v
+唠扯 3 v
+唢 3 n
+唢呐 165 n
+唢呐声 10 n
+唣 18 x
+唤 1625 vg
+唤作 3 v
+唤出 3 v
+唤取 4 v
+唤名 3 v
+唤呼 3 v
+唤回 29 v
+唤头 3 v
+唤来 3 v
+唤来唤去 3 z
+唤起 503 v
+唤起民众 3 v
+唤醒 242 v
+唧 15 o
+唧咕 3 o
+唧哝 3 v
+唧唧 377 o
+唧唧咕咕 3 o
+唧唧喳喳 13 o
+唧唧嘎嘎 3 o
+唧啾 3 o
+唧拉喳拉 3 o
+唧筒 7 n
+唨 17 zg
+唪 4 g
+唫 3 zg
+唬 723 zg
+唬人 45 v
+唬住 3 v
+唬吓 3 v
+唬得 3 v
+唬来唬去 3 z
+售 803 v
+售与 3 v
+售书 11 n
+售予 7 v
+售价 311 n
+售假 14 n
+售出 97 v
+售前 3 v
+售卖 58 v
+售卖机 3 n
+售后 27 n
+售后服务 151 l
+售完 28 v
+售房 22 n
+售房方 3 n
+售房款 3 n
+售报亭 3 n
+售楼 76 n
+售楼员 6 n
+售楼处 3 n
+售楼盘 3 n
+售楼部 3 n
+售油立管 3 n
+售电量 3 n
+售票 183 n
+售票亭 2 n
+售票厅 5 n
+售票口 11 n
+售票员 66 n
+售票处 45 l
+售票机 7 n
+售票点 9 n
+售票车 2 n
+售禁令 3 n
+售粮 3 n
+售给 3 v
+售罄 6 v
+售解禁 3 n
+售让 3 v
+售货 36 n
+售货亭 2 n
+售货区 3 l
+售货员 74 l
+售货摊 3 l
+售货机 3 l
+售货棚 3 l
+售车 3 n
+售饭机 3 l
+唯 997 b
+唯一 4448 b
+唯一一 34 b
+唯一性 24 b
+唯一性集 3 i
+唯一无二 3 i
+唯一标准 3 n
+唯你 3 b
+唯你是问 3 l
+唯其 3 d
+唯其如此 14 l
+唯分数论 2 l
+唯利是从 3 i
+唯利是图 33 l
+唯利是求 3 l
+唯利是视 3 l
+唯力是视 3 l
+唯名论 20 l
+唯吾独尊 3 i
+唯命是从 12 i
+唯命是听 3 i
+唯唯 3 l
+唯唯否否 3 i
+唯唯喏喏 3 v
+唯唯诺诺 59 l
+唯唯连声 3 l
+唯妙 3 b
+唯妙唯肖 3 i
+唯实 3 d
+唯实论 3 l
+唯心 30 b
+唯心主义 340 n
+唯心主义者 20 n
+唯心史观 24 l
+唯心论 31 n
+唯恐 374 v
+唯恐天下 3 i
+唯成分论 4 l
+唯我 3 b
+唯我主义 3 l
+唯我独尊 32 l
+唯我论 3 l
+唯我论者 3 n
+唯所欲为 3 i
+唯才是举 7 i
+唯有 642 b
+唯有读书 3 n
+唯有读书高 8 n
+唯灵论 3 n
+唯物 20 n
+唯物主义 409 n
+唯物主义者 58 n
+唯物史观 107 n
+唯物论 49 n
+唯物论者 8 n
+唯物辨证 3 n
+唯物辩证 3 n
+唯物辩证法 60 n
+唯独 597 d
+唯理主义 3 n
+唯理论 45 n
+唯生产力 3 l
+唯生产力论 5 l
+唯美 49 a
+唯美主义 3 l
+唯美图 3 l
+唯美派 3 n
+唯肖 3 b
+唯能论 3 n
+唯识 3 n
+唯识宗 34 b
+唯象理论 3 n
+唯邻是卜 3 l
+唯金牌论 4 n
+唰 176 zg
+唱 4365 v
+唱主角 16 n
+唱付 3 v
+唱出 3 v
+唱出来 3 l
+唱到 3 v
+唱功 26 n
+唱友 3 n
+唱双簧 3 i
+唱反 3 v
+唱反调 26 l
+唱名 287 v
+唱和 62 v
+唱响 11 n
+唱唱 3 v
+唱喏 39 v
+唱回 3 v
+唱回去 3 l
+唱回来 3 l
+唱国歌 3 n
+唱声 3 n
+唱大戏 3 l
+唱头 2 n
+唱对台戏 13 n
+唱山歌 3 n
+唱工 4 n
+唱录机 3 n
+唱念 3 n
+唱戏 209 n
+唱收 3 v
+唱曲 56 n
+唱本 31 n
+唱机 9 n
+唱来唱去 3 l
+唱歌 351 n
+唱歌曲 3 l
+唱歌跳舞 3 l
+唱段 27 n
+唱沙作米 3 n
+唱法 41 n
+唱游 3 n
+唱点 3 n
+唱片 372 n
+唱片业 4 n
+唱片名 3 n
+唱片目录 3 n
+唱片集 3 n
+唱独脚戏 3 l
+唱独角戏 4 l
+唱白脸 10 l
+唱的歌 3 n
+唱盘 13 n
+唱着歌 3 n
+唱破 3 v
+唱碟 2 n
+唱票 11 n
+唱票人 3 n
+唱票员 3 n
+唱筹量沙 2 n
+唱红 6 n
+唱红脸 11 l
+唱腔 193 n
+唱词 70 n
+唱诗 15 n
+唱诗班 9 n
+唱赞歌 3 vn
+唱起 193 v
+唱起来 3 l
+唱起歌 3 v
+唱道 170 v
+唱酬 3 n
+唱针 5 n
+唱首歌 3 n
+唱高调 11 n
+唲 8 zg
+唳 42 g
+唴 71 zg
+唵 33 zg
+唶 3 zg
+唷 268 x
+唸 5 zg
+唸一唸 3 v
+唸下去 3 v
+唸书 3 vn
+唸书下去 3 nr
+唸了 3 y
+唸佛 3 v
+唸作 3 vn
+唸到 3 vn
+唸咒 3 v
+唸唸 3 z
+唸唸有词 3 v
+唸好 3 z
+唸完 3 v
+唸得 3 vn
+唸成 3 vn
+唸来唸去 3 z
+唸法 3 vn
+唸点 3 z
+唸着 3 y
+唸经 3 z
+唸给 3 vn
+唸起来 3 v
+唸过 3 vq
+唸错 3 vn
+唹 17 zg
+唺 36 zg
+唻 25 zg
+唼 7 x
+唽 3 zg
+唾 165 zg
+唾余 3 n
+唾吐 3 v
+唾地成文 3 i
+唾壶击碎 3 i
+唾壶击缺 3 i
+唾壶敲缺 3 i
+唾弃 62 v
+唾手可取 3 i
+唾手可得 55 i
+唾沫 332 n
+唾沫星子 24 n
+唾液 172 n
+唾液学 3 n
+唾液腺 35 n
+唾液薄膜 3 n
+唾液酸 4 n
+唾液酸酶 3 n
+唾腺 3 n
+唾面自乾 3 i
+唾面自干 3 i
+唾骂 70 v
+唿 47 n
+唿哨 83 n
+唿扇 3 n
+啀 240 zg
+啁 20 o
+啁啾 25 o
+啂 2 zg
+啃 664 v
+啃上 3 l
+啃下 3 v
+啃书 3 v
+啃书本 10 l
+啃书虫 3 l
+啃出 3 v
+啃到 3 v
+啃去 3 v
+啃啮 2 v
+啃噬 3 v
+啃得 3 v
+啃掉 3 v
+啃来啃去 3 l
+啃着 3 v
+啃老族 3 l
+啃蚀 3 v
+啃起 3 v
+啃起来 3 l
+啃过 3 v
+啃过去 3 l
+啃过来 3 l
+啃进 3 v
+啃青 3 l
+啃食 3 v
+啃骨头 3 l
+啄 476 v
+啄伤 3 v
+啄取 3 v
+啄木 3 n
+啄木鸟 70 n
+啄痕 3 n
+啄穿 3 v
+啄米 3 n
+啄虫 3 n
+啄起 3 v
+啄食 52 n
+啅 9 zg
+商 3853 n
+商一己 2 nr
+商与徽 2 nr
+商专 3 n
+商丘 251 n
+商丘县 3 ns
+商丘市 11 ns
+商丘站 3 n
+商业 6280 n
+商业专科 3 nt
+商业中心 3 nt
+商业主义 3 n
+商业价值 3 l
+商业伙伴 3 n
+商业保险 3 n
+商业保险公司 2 nt
+商业信息 3 nt
+商业利润 3 n
+商业利益 3 n
+商业化 116 n
+商业区 146 n
+商业发票 3 n
+商业地产 3 n
+商业城 16 n
+商业城市 3 n
+商业学校 3 nt
+商业局 22 nt
+商业广告 3 n
+商业广场 3 nt
+商业性 115 n
+商业智能 11 n
+商业机会 3 nt
+商业机构 3 n
+商业来往 3 l
+商业楼 4 n
+商业模式 3 n
+商业法 3 n
+商业活动 3 n
+商业渠道 3 n
+商业港 3 n
+商业片 6 n
+商业版 3 n
+商业理论 3 n
+商业用途 3 n
+商业界 26 n
+商业登记 3 n
+商业秘密 3 n
+商业移民 3 n
+商业空间 3 n
+商业系统 3 n
+商业网 6 n
+商业网站 3 nt
+商业职业 3 n
+商业职工 3 n
+商业行为 3 n
+商业街 55 n
+商业贷款 3 n
+商业贸易 3 l
+商业资本 3 n
+商业资讯 3 nt
+商业软件 3 n
+商业道德 3 n
+商业部 21 nt
+商业部长 5 n
+商业部门 38 n
+商业银行 354 nt
+商业银行总行 6 nt
+商业间谍 3 n
+商中英 2 nr
+商主 2 n
+商之利 3 nr
+商之引 2 nr
+商事 23 n
+商事法 3 n
+商云集 4 nr
+商交所 6 nt
+商亭 3 nr
+商人 2829 n
+商人资本 3 l
+商代 457 t
+商令 3 n
+商会 246 n
+商会会长 3 n
+商伯大 2 ns
+商伯维 2 nr
+商住 8 v
+商住楼 4 n
+商兑 3 v
+商兼松 2 nr
+商军 2 n
+商军前 3 t
+商函 3 n
+商剑 8 n
+商剑鸣 41 nr
+商办 3 v
+商务 1166 n
+商务中心 3 nt
+商务人士 3 n
+商务代表 3 n
+商务会议 3 nt
+商务信息 3 nt
+商务办事 3 n
+商务区 5 nt
+商务印书 3 n
+商务印书馆 184 nt
+商务厅 3 nt
+商务处 3 nt
+商务大厦 3 nt
+商务局 13 nt
+商务师 3 nt
+商务平台 3 nt
+商务快车 3 nt
+商务旅行 3 nt
+商务机型 3 n
+商务楼 3 n
+商务活动 3 n
+商务洽谈 3 n
+商务电话 3 n
+商务礼仪 3 n
+商务礼品 3 n
+商务签证 3 n
+商务网 44 nt
+商务考察 3 n
+商务英语 3 n
+商务论坛 3 n
+商务调查 3 l
+商务谈判 3 n
+商务车 3 nt
+商务通 9 nt
+商务部 230 nt
+商务部长 2 n
+商务酒店 3 nt
+商务院 3 nt
+商励展 2 nr
+商千料 2 l
+商南 8 ns
+商南县 4 ns
+商博良 6 nr
+商占有 3 nr
+商厦 67 n
+商史 3 n
+商号 60 n
+商同 3 n
+商同孚 2 nr
+商君书 3 nr
+商吴天 7 nr
+商周 319 t
+商和周 3 nr
+商品 10160 n
+商品交换 3 v
+商品交易 3 n
+商品价格 3 n
+商品住宅 3 n
+商品信息 3 nt
+商品化 127 n
+商品名称 3 n
+商品型号 3 n
+商品学 3 nt
+商品展览 3 n
+商品形象 3 n
+商品性 32 n
+商品房 225 n
+商品标示 3 n
+商品检验 3 n
+商品棉 6 n
+商品流转 3 l
+商品流通 199 n
+商品猪 6 n
+商品率 58 n
+商品生产 233 n
+商品生产者 87 n
+商品盘损 3 n
+商品盘盈 3 l
+商品目录 3 n
+商品种类 3 n
+商品税 3 n
+商品粮 147 n
+商品粮棉 3 n
+商品经济 494 n
+商品编号 3 n
+商品质量 3 n
+商品资本 3 n
+商品资金 3 n
+商品输出 3 n
+商品量 137 n
+商品销售 3 l
+商器 2 n
+商团 27 n
+商图 3 n
+商图国事 3 nt
+商圈 21 n
+商场 730 n
+商均 6 j
+商城 1270 ns
+商城价 3 n
+商城县 4 ns
+商埠 114 n
+商增裕 2 nr
+商大 6 nt
+商大东 2 ns
+商大贾 2 nr
+商天娥 3 n
+商太古 3 nr
+商女 3 n
+商妥 3 nr
+商委 3 n
+商嫂 3 n
+商学 8 n
+商学系 3 n
+商学院 388 nt
+商定 311 n
+商宝震 216 nr
+商客 8 n
+商客居 3 n
+商家 376 n
+商家业 2 n
+商家冠 2 nr
+商家堡 93 nr
+商家嫂子 3 n
+商家庭 4 nt
+商对策 3 n
+商对象 3 n
+商展 3 vn
+商屯 3 ns
+商山 7 ns
+商州 185 ns
+商州区 3 ns
+商州市 6 ns
+商工 15 n
+商工职业 3 n
+商左右 2 nr
+商并雄 3 n
+商店 886 n
+商建国 3 ns
+商归周 3 nr
+商彝周 2 nr
+商彝周鼎 3 nr
+商彝夏鼎 3 nr
+商得 3 v
+商情 7 n
+商情报 3 n
+商情网 3 n
+商惠洛 2 nr
+商战 27 n
+商户 70 n
+商承祚 3 nr
+商报 105 n
+商报讯 3 nt
+商报路 3 n
+商拟 3 v
+商政 4 n
+商数 9 n
+商旅 357 n
+商旅网 3 nt
+商族 11 n
+商族先 2 n
+商旗昌 5 nr
+商易网 3 n
+商星 2 n
+商映射 3 n
+商普金 2 n
+商曲 3 n
+商曲辞 4 n
+商有量 3 n
+商朝 414 t
+商朝人 3 nr
+商末 5 t
+商末周 4 t
+商机 180 n
+商权 3 n
+商标 365 n
+商标代理 3 n
+商标名 3 n
+商标局 5 nt
+商标权 19 n
+商标法 15 n
+商标注册 3 n
+商标纸 3 n
+商标网 3 n
+商标设计 3 n
+商校 2 n
+商桥 3 n
+商检 28 j
+商检单 3 j
+商检单证 3 j
+商检局 5 nt
+商检工作 3 n
+商检机构 3 n
+商检章 3 n
+商检部门 3 n
+商榷 73 v
+商民 12 n
+商民皆 3 nr
+商水 13 n
+商水县 4 ns
+商永宁 2 nr
+商汇利 2 n
+商江岫 2 nr
+商汤 48 n
+商汤之 5 nr
+商汤尊 3 nr
+商汤攻 3 nr
+商汤陈 3 nr
+商汪德 2 nr
+商沃达 4 nr
+商河 3 ns
+商河县 15 ns
+商法 31 n
+商法典 9 n
+商泛代数 3 n
+商洛 72 nr
+商洛地区 13 ns
+商洛山 392 ns
+商洛市 7 ns
+商洲 3 ns
+商洽 17 v
+商流 7 n
+商海 38 ns
+商海博杀 3 n
+商涵 3 n
+商港 67 ns
+商演 2 n
+商献洛 3 nr
+商王 26 n
+商王武 9 nr
+商王派 2 nr
+商王畿 6 nr
+商王赏 2 nr
+商瑞华 3 nr
+商瑞记 2 nr
+商瑞银 3 nr
+商用 266 n
+商用化 7 n
+商用品 3 n
+商用机 11 n
+商用车 516 n
+商界 103 n
+商百富 3 nr
+商益生 2 n
+商礼 2 n
+商礼和 2 nr
+商社 16 n
+商神州 2 nr
+商祺 3 nr
+商禅臣 2 nr
+商科 12 n
+商积年 4 n
+商税 3 n
+商税纳 3 nr
+商立国 2 ns
+商站 12 n
+商竟增 2 nr
+商管委 2 nt
+商籁体 4 nr
+商纣 3 n
+商约 16 n
+商纳 2 ns
+商羊 2 n
+商群 3 n
+商老太 50 nr
+商职 3 n
+商聚 2 v
+商肆 2 n
+商臣 2 n
+商船 285 n
+商船海事 3 nt
+商船队 39 nt
+商英联 15 nr
+商茶 3 n
+商茶行 2 nt
+商荣华 2 nr
+商董 3 n
+商行 98 n
+商衍瀛 2 nr
+商角征 2 n
+商誉 4 n
+商计 3 v
+商订 3 v
+商讨 216 v
+商讨对策 3 n
+商讨问题 3 n
+商议 1729 n
+商讯 16 n
+商讯网 3 n
+商请 3 v
+商调 3 n
+商调蝶 2 nr
+商谈 178 v
+商谈对策 3 n
+商谜 3 n
+商贤臣 3 nr
+商贩 162 n
+商贸 658 n
+商贸业 4 nt
+商贸城 7 n
+商贸点 3 n
+商贸网 3 nt
+商贸通 3 nt
+商贾 264 n
+商赵乙 2 nr
+商路 57 n
+商轮 3 n
+商载 2 v
+商运商 6 n
+商道 21 n
+商郊 3 n
+商都 61 ns
+商都县 3 ns
+商都网 3 nt
+商酌 10 v
+商量 2706 n
+商量一下 3 l
+商量余地 3 l
+商量对策 3 n
+商量研究 3 n
+商鉴 2 n
+商银 3 n
+商铺 48 n
+商销 2 n
+商队 63 n
+商阳 10 ns
+商阳剑 13 nr
+商陆 2 n
+商陆科 2 n
+商鞅 120 nr
+商音 2 n
+商音弦 4 n
+商颂 4 v
+商高盛 2 nr
+商鲁麟 3 nr
+商鸿源 2 nr
+商鸿逵 2 nr
+商麦金 2 n
+啉 37 x
+啊 21810 zg
+啊呀 48 e
+啊呀呀 13 n
+啊哈 90 e
+啊哟 417 e
+啊啊啊 3 nr
+啋 49 zg
+啎 2 zg
+問 3 zg
+啐 240 zg
+啑 6 zg
+啒 50 zg
+啓 41 zg
+啕 4 g
+啖 52 zg
+啖以重利 3 nz
+啗 750 zg
+啘 45 zg
+啙 3 zg
+啛 38 zg
+啛啛喳喳 3 o
+啜 80 vg
+啜泣 79 v
+啜泣声 8 n
+啜英咀华 3 z
+啜菽饮水 3 nr
+啜饮 12 v
+啝 5 zg
+啡 47 x
+啡厅 3 nz
+啢 9 zg
+啣 13 zg
+啤 170 n
+啤酒 673 n
+啤酒业 5 n
+啤酒厂 20 n
+啤酒大麦 3 n
+啤酒屋 3 n
+啤酒店 13 n
+啤酒杯 15 n
+啤酒沫 3 n
+啤酒瓶 11 n
+啤酒罐 3 n
+啤酒肚 17 n
+啤酒节 32 n
+啤酒花 25 n
+啤酒设备 3 n
+啤酒酵母 3 n
+啤酒馆 15 n
+啥 3651 r
+啥事 3 r
+啥子 74 r
+啥意思 3 n
+啥时候 3 r
+啥样子 3 n
+啥病 3 r
+啦 9891 y
+啦啦队 9 n
+啦啦队员 3 n
+啦啦队长 3 n
+啦瘌 3 n
+啧 66 o
+啧啧 110 o
+啧啧声 4 l
+啧啧称奇 48 i
+啧啧称羡 3 n
+啧啧称赞 28 l
+啧有烦言 3 i
+啪 829 o
+啪哒啪哒 3 o
+啪唧 7 o
+啪啦 24 o
+啪啪 4 o
+啪嗒 19 o
+啪嚓 4 o
+啫 15 zg
+啫哩 3 nr
+啫喱 3 n
+啬 78 g
+啬己奉公 3 nr
+啭 23 g
+啮 48 n
+啮合 20 v
+啮合角 3 n
+啮噬 3 v
+啮檗吞针 3 n
+啮臂之好 3 n
+啮血为盟 3 n
+啮血沁骨 3 z
+啮雪吞毡 3 n
+啮雪餐毡 3 n
+啮齿 35 n
+啮齿动物 13 n
+啮齿类 29 n
+啮齿类动物 6 n
+啯 35 zg
+啰 275 zg
+啰唆 3 v
+啰啰嗦嗦 3 z
+啰嗦 3 z
+啱 2 zg
+啲 7 zg
+啵 141 y
+啶 27 x
+啷 457 x
+啸 346 v
+啸傲 3 nr
+啸傲湖山 3 nr
+啸傲风月 3 nr
+啸叫 3 v
+啸吒风云 3 v
+啸咏 3 n
+啸咤风云 3 v
+啸声 137 n
+啸桐 60 n
+啸聚 9 v
+啸聚山林 12 l
+啸虎 3 n
+啸闹 3 v
+啸鸣 3 nr
+啹 40 zg
+啺 13 zg
+啻 61 g
+啼 263 v
+啼乌 3 n
+啼叫 39 v
+啼呜 3 i
+啼哭 225 v
+啼啼哭哭 3 i
+啼声 37 v
+啼天哭地 3 i
+啼明 3 v
+啼泣 3 v
+啼猿 3 n
+啼笑 3 v
+啼笑皆非 62 i
+啼莺 3 n
+啼血 2 v
+啼饥号寒 11 i
+啼鸣 39 v
+啾 169 x
+啿 60 zg
+喀 1472 ns
+喀丝丽 3 ns
+喀什 311 ns
+喀什地区 10 ns
+喀什市 16 ns
+喀什米尔 3 ns
+喀吧 6 o
+喀喀湖 25 ns
+喀喇昆仑 5 ns
+喀喇昆仑山 55 ns
+喀喇沁左翼 2 ns
+喀喇沁左翼蒙古族自治县 6 ns
+喀喇沁旗 6 ns
+喀嚓 64 o
+喀嚓一声 3 z
+喀土穆 50 ns
+喀城 3 ns
+喀尔巴阡山 16 ns
+喀尔巴阡山脉 32 ns
+喀尔隆 2 ns
+喀山 42 ns
+喀左 6 ns
+喀布尔 90 ns
+喀布尔河 13 ns
+喀拉 102 ns
+喀拉拉 3 ns
+喀拉拉邦 9 ns
+喀斯喀特 18 ns
+喀斯特 181 ns
+喀斯特化 3 ns
+喀斯特地貌 92 nz
+喀斯特水 3 ns
+喀琅施塔 3 n
+喀秋莎 16 nz
+喀纳斯 3 ns
+喀纳斯湖 12 ns
+喀里多尼亚 6 ns
+喀麦隆 216 ns
+喀麦隆人 6 nz
+喀麦隆共和国 7 ns
+喀麦隆队 3 nz
+喁 49 g
+喂 2208 v
+喂乳 3 v
+喂入 25 v
+喂养 198 v
+喂喂 3 v
+喂奶 77 v
+喂奶时 3 vn
+喂料 3 v
+喂料机 3 vn
+喂母乳 3 vn
+喂狗 3 v
+喂猪 3 v
+喂给 3 v
+喂羊 3 v
+喂草 3 v
+喂药 3 v
+喂食 43 v
+喂饭 3 v
+喂饱 3 v
+喂饲 16 v
+喂鱼 3 v
+喂鸡 3 v
+喂鸭 3 v
+喃 47 o
+喃喃 800 o
+喃喃地 3 i
+喃喃细语 3 i
+喃喃自语 119 i
+喃嗟班 3 i
+喃语 3 i
+善 5835 v
+善与人交 3 i
+善为 53 v
+善为保管 3 l
+善为说辞 3 i
+善举 42 v
+善书 3 n
+善事 86 n
+善于 1707 v
+善于引导 3 n
+善于词令 3 i
+善于辞令 3 i
+善人 648 n
+善价而估 3 n
+善体 3 n
+善体人意 3 i
+善刀而藏 3 i
+善加 3 v
+善加利用 3 n
+善化 3 v
+善卷洞 9 n
+善友 2 n
+善变 26 v
+善后 145 a
+善后事宜 3 i
+善后处理 3 i
+善后工作 3 l
+善哉 148 a
+善善从长 3 i
+善善恶恶 3 i
+善堂 3 n
+善士 3 n
+善处 5 n
+善始令终 3 i
+善始善终 17 i
+善导寺 3 n
+善小而 3 i
+善待 140 v
+善御 3 v
+善心 61 n
+善心人士 3 i
+善忘 2 v
+善思 3 n
+善性 3 n
+善恶 246 a
+善恶不分 3 i
+善恶不变 3 i
+善恶不辨 3 l
+善恶值 3 i
+善意 207 v
+善意回应 3 i
+善感 5 n
+善战 192 v
+善报 3 n
+善攻者 7 n
+善文 3 n
+善文能武 3 n
+善有善报 15 i
+善本 70 a
+善本书 9 n
+善根 3 n
+善款 17 n
+善气迎人 3 i
+善游者溺 3 n
+善用 147 v
+善男信女 30 i
+善眉善眼 3 i
+善睐 3 v
+善策 100 n
+善类 3 n
+善纳忠言 3 i
+善终 70 v
+善罢干休 5 i
+善罢甘休 58 i
+善者 16 n
+善者不来 24 i
+善自为谋 3 i
+善自保重 3 i
+善良 641 a
+善莫大 3 i
+善莫大焉 17 i
+善行 244 v
+善解 14 v
+善解人意 65 i
+善言 29 n
+善财难舍 3 i
+善贾而沽 3 ns
+善辩 31 v
+善辩者 3 n
+善门难开 3 i
+善马熟人 3 i
+善骑者堕 3 i
+喅 100 zg
+喆 21 zg
+喇 775 n
+喇叭 431 n
+喇叭口 25 n
+喇叭声 38 n
+喇叭天线 3 n
+喇叭形 26 n
+喇叭手 3 n
+喇叭筒 34 n
+喇叭管 3 n
+喇叭线 3 n
+喇叭花 9 n
+喇叭裤 7 n
+喇嘛 1052 n
+喇嘛寺 3 n
+喇嘛寺院 3 ns
+喇嘛庙 3 n
+喇嘛教 113 n
+喇嘛教徒 4 n
+喇蛄 3 n
+喈 4 x
+喉 599 n
+喉切开术 3 n
+喉咙 592 n
+喉咙干 3 z
+喉咙痛 3 vn
+喉塞音 2 n
+喉头 307 n
+喉头炎 3 n
+喉宝 3 n
+喉擦音 3 n
+喉气管 2 n
+喉清暗雅 3 n
+喉炎 34 n
+喉片 3 n
+喉癌 44 n
+喉科 3 n
+喉科学 3 n
+喉管 30 n
+喉结 44 n
+喉舌 59 n
+喉道 3 n
+喉部 70 n
+喉镜 10 n
+喉长气短 3 n
+喉音 25 n
+喉风 3 n
+喉骨 3 n
+喊 4712 v
+喊一声 3 n
+喊上去 3 v
+喊上来 3 v
+喊下去 3 v
+喊下来 3 v
+喊价 3 n
+喊住 3 v
+喊停 3 v
+喊冤 30 v
+喊冤叫屈 2 i
+喊出 3 v
+喊出去 3 v
+喊出来 3 v
+喊到 3 v
+喊叫 342 v
+喊叫声 30 n
+喊嗓子 3 n
+喊嚷 3 v
+喊回 3 v
+喊回去 3 i
+喊回来 3 i
+喊堂威 3 i
+喊声 627 n
+喊成 3 v
+喊救 3 v
+喊救命 3 n
+喊来 3 v
+喊来喊去 3 i
+喊破 3 v
+喊穷 3 v
+喊话 88 v
+喊起 3 v
+喊起来 3 v
+喊进 3 v
+喊进去 3 v
+喊进来 3 v
+喊道 585 v
+喊醒 3 v
+喋 51 i
+喋喋 3 i
+喋喋不休 78 i
+喋血 19 v
+喋血记 3 i
+喌 57 zg
+喎 97 zg
+喏 320 x
+喏喏连声 3 z
+喑 39 v
+喑了 3 v
+喑哑 25 v
+喑噁叱咤 3 v
+喓 3 zg
+喔 119 e
+喔啊声 3 z
+喔喔叫 3 z
+喕 4 zg
+喘 833 v
+喘出 3 v
+喘吁吁 31 z
+喘喘 3 v
+喘喘气 6 z
+喘嘘嘘 6 z
+喘息 468 v
+喘息之间 3 v
+喘息声 3 v
+喘息未定 3 n
+喘振 4 v
+喘月吴牛 3 vn
+喘气 313 v
+喘气声 3 z
+喘证 3 v
+喙 273 zg
+喙长三尺 3 v
+喚 4 zg
+喛 2 zg
+喜 7380 v
+喜上加 3 v
+喜上加喜 15 i
+喜上眉梢 34 i
+喜不喜欢 28 i
+喜不自禁 14 i
+喜不自胜 75 i
+喜丧 3 v
+喜临门 3 i
+喜之郎 3 l
+喜乐 71 ns
+喜乐蒂 3 i
+喜事 665 v
+喜人 105 n
+喜从何来 3 i
+喜从天降 24 i
+喜信 5 v
+喜儿 25 n
+喜兴 3 ns
+喜冲冲 3 z
+喜出望外 217 i
+喜刷刷 3 z
+喜剧 633 n
+喜剧之王 3 n
+喜剧效果 3 n
+喜剧演员 3 n
+喜剧片 44 n
+喜剧电影 3 n
+喜剧类 3 n
+喜剧色彩 3 n
+喜剧路线 3 n
+喜力 6 n
+喜功 3 a
+喜唰唰 3 z
+喜唱乐听 3 i
+喜地欢天 3 i
+喜多 18 v
+喜多郎 3 ns
+喜好 232 v
+喜娘 15 n
+喜子 3 n
+喜字 15 n
+喜孜孜 47 ns
+喜宴 45 v
+喜容 3 v
+喜封 3 v
+喜峰口 30 ns
+喜帐 3 n
+喜帖 5 n
+喜幛 3 n
+喜幸 3 v
+喜庆 378 ns
+喜庆宴会 3 vn
+喜形于色 55 i
+喜得 3 v
+喜德 3 ns
+喜德县 2 ns
+喜忧参半 11 i
+喜怒 77 v
+喜怒不形 3 i
+喜怒哀乐 89 i
+喜怒哀愁 3 i
+喜怒无常 39 i
+喜性 3 n
+喜恶 3 v
+喜悦 756 a
+喜悦之情 3 i
+喜悦感 2 i
+喜意 8 v
+喜感 3 n
+喜报 38 v
+喜按 3 n
+喜新厌故 3 i
+喜新厌旧 26 i
+喜来登 15 i
+喜极而泣 27 i
+喜果 4 n
+喜树 12 n
+喜树碱 15 n
+喜欢 9783 v
+喜歌剧 3 n
+喜气 76 n
+喜气洋洋 117 i
+喜泪 3 v
+喜洋 3 ns
+喜洋洋 16 ns
+喜溢眉宇 3 n
+喜溢眉梢 3 l
+喜滋滋 50 z
+喜满你 3 l
+喜爱 1356 v
+喜玛拉雅 10 ns
+喜盈盈 2 z
+喜盈门 3 n
+喜相逢 3 i
+喜眉笑眼 3 i
+喜看 3 v
+喜笑频开 3 i
+喜笑颜开 36 i
+喜筵 13 n
+喜糖 13 n
+喜结良缘 16 i
+喜结连理 3 i
+喜联 4 ns
+喜脉 3 ns
+喜色 192 n
+喜芙浓 3 nz
+喜获 10 v
+喜获丰收 3 i
+喜蛋 3 n
+喜行于色 3 i
+喜见于色 3 i
+喜讯 267 nz
+喜讯传来 3 i
+喜跃 2 v
+喜跃抃舞 3 n
+喜车 3 n
+喜迁 5 v
+喜迁新居 3 ns
+喜迎 52 v
+喜迎春 2 i
+喜逐颜开 3 i
+喜逢 8 v
+喜酒 168 v
+喜钱 4 v
+喜闻 3 n
+喜闻乐见 93 i
+喜阳 2 ns
+喜雀 3 n
+喜雨 15 n
+喜饼 3 n
+喜马偕尔邦 7 ns
+喜马拉 3 ns
+喜马拉雅 165 ns
+喜马拉雅山 197 ns
+喜马拉雅山脉 113 ns
+喜鹊 122 n
+喝 10053 vg
+喝一杯 3 v
+喝下去 3 v
+喝了酒 3 v
+喝令 148 v
+喝住 3 v
+喝倒彩 4 l
+喝光 3 v
+喝入 3 v
+喝出 3 v
+喝到 3 v
+喝口水 3 ns
+喝叱 3 v
+喝咖啡 3 nr
+喝啤酒 3 n
+喝喝 3 v
+喝墨水 3 ns
+喝声道 30 l
+喝够 3 v
+喝完 3 v
+喝尽 3 v
+喝彩 307 v
+喝彩声 45 l
+喝得 3 v
+喝掉 3 v
+喝斥 48 v
+喝来喝去 3 l
+喝杯 3 v
+喝水 302 v
+喝汤 3 v
+喝牛奶 3 v
+喝粥 3 v
+喝茶 463 v
+喝药 3 v
+喝血 3 v
+喝西北风 49 ns
+喝起 3 v
+喝过 3 v
+喝进 3 v
+喝进去 3 v
+喝道 3557 v
+喝酒 1437 v
+喝醉 236 v
+喝醉酒 3 l
+喝采 269 v
+喝采声 3 n
+喝问 223 v
+喝闷酒 12 v
+喝风 3 v
+喟 74 g
+喟叹 15 v
+喟然 3 v
+喟然而叹 3 v
+喟然长叹 3 v
+喤 3 zg
+喦 17 zg
+喧 236 v
+喧叫 3 v
+喧响 3 vn
+喧哗 446 v
+喧哗声 3 i
+喧器 3 n
+喧噪 10 v
+喧嚣 311 v
+喧嚣一时 3 i
+喧嚣声 5 i
+喧嚷 39 v
+喧嚷一时 3 v
+喧嚷声 3 v
+喧声四起 3 i
+喧天 3 v
+喧天锣鼓 3 i
+喧宾夺主 27 i
+喧扰 14 v
+喧扰已久 3 i
+喧杂 3 v
+喧沸 3 v
+喧用 3 v
+喧笑 3 v
+喧腾 45 v
+喧腾一时 3 i
+喧腾声 3 i
+喧腾已久 3 i
+喧闹 161 v
+喧闹不休 3 v
+喧闹声 149 v
+喧闹纷乱 3 n
+喧骚 3 v
+喨 16 zg
+喱 8 x
+喳 65 zg
+喳喳 23 o
+喵 547 o
+喷 1274 v
+喷上 3 v
+喷上去 3 v
+喷上来 3 v
+喷下 3 v
+喷下去 3 v
+喷下来 3 v
+喷丝头 5 n
+喷丸 5 n
+喷云吐雾 12 i
+喷云泄雾 3 i
+喷入 3 v
+喷出 561 v
+喷出去 3 v
+喷出来 3 v
+喷剂 6 n
+喷发 379 v
+喷发物 7 n
+喷口 3 n
+喷吐 40 v
+喷喷 3 v
+喷喷水 3 v
+喷喷香 3 z
+喷嘴 46 v
+喷嘴式 3 n
+喷嚏 153 v
+喷墨 21 n
+喷墨式 3 n
+喷壶 10 n
+喷头 15 v
+喷子 3 n
+喷孔 3 n
+喷字 3 nz
+喷射 219 v
+喷射出 3 n
+喷射制品 3 n
+喷射器 13 n
+喷射客机 3 n
+喷射式 13 n
+喷射性 3 n
+喷射机 8 n
+喷射泵 3 n
+喷射船 2 n
+喷射钻井 3 nz
+喷射飞机 3 n
+喷打 3 v
+喷撒 2 v
+喷施 3 v
+喷枪 5 n
+喷桶 3 n
+喷气 250 n
+喷气发动 3 l
+喷气孔 3 b
+喷气式 182 b
+喷气快艇 3 n
+喷气机 8 n
+喷水 105 v
+喷水喷头 3 n
+喷水孔 3 n
+喷水池 7 n
+喷水管 2 n
+喷沙 2 nz
+喷油 4 n
+喷油嘴 3 n
+喷油器 2 n
+喷油泵 3 n
+喷油量 3 n
+喷泉 190 nz
+喷泻 3 v
+喷洒 87 v
+喷洒在 3 z
+喷洒着 3 l
+喷洒车 3 i
+喷流 3 n
+喷浆 3 n
+喷涂 60 z
+喷涂机 3 n
+喷涂线 3 n
+喷涌 69 v
+喷淋 3 z
+喷淋塔 3 nz
+喷湿 3 v
+喷溅 12 v
+喷漆 22 n
+喷灌 53 v
+喷火 131 v
+喷火分队 3 n
+喷火口 3 n
+喷火器 49 n
+喷火山 3 nz
+喷火龙 3 nz
+喷灯 34 n
+喷珠泻玉 3 i
+喷着气 3 l
+喷着水 3 v
+喷码机 3 n
+喷砂 2 n
+喷砂嘴 3 nz
+喷砂机 3 n
+喷管 39 v
+喷粉 3 n
+喷粉器 3 nz
+喷粪 2 n
+喷绘 2 v
+喷绘机 3 n
+喷胶棉 3 n
+喷花 3 n
+喷药 7 n
+喷薄 8 b
+喷薄欲出 3 i
+喷薄而出 17 i
+喷血 3 v
+喷血自污 3 i
+喷赤河 5 nz
+喷起 3 v
+喷起来 3 v
+喷锚网 2 vn
+喷镀 3 v
+喷雨嘘云 3 n
+喷雾 58 n
+喷雾剂 9 nz
+喷雾器 6 nz
+喷雾干燥 3 l
+喷雾式 3 l
+喷雾机 3 n
+喷雾瓶 3 n
+喷饭 8 v
+喷香 20 v
+喷香的 14 z
+喷鼻儿香 3 n
+喷鼻息 3 n
+喷鼻血 3 v
+喹 42 n
+喹吖因 3 v
+喹哪啶红 3 nz
+喹啉 48 n
+喹嗪 3 n
+喹诺酮 6 nz
+喻 299 nr
+喻上猷 43 nr
+喻世明 15 nr
+喻为 48 nr
+喻之以理 3 nr
+喻于义 2 nr
+喻以利害 3 nr
+喻侯萧 2 nr
+喻南强 2 nr
+喻可欣 22 nr
+喻家碑 256 nr
+喻广生 2 nr
+喻恩泰 3 nr
+喻旭初 2 nr
+喻明发 2 nr
+喻林祥 256 nr
+喻示 132 v
+喻继高 3 nr
+喻长林 2 nr
+喽 290 zg
+喽啰 3 n
+喽罗 255 n
+喾 57 g
+嗂 2 zg
+嗄 109 e
+嗅 460 n
+嗅出 3 v
+嗅到 115 v
+嗅探器 2 n
+嗅探者 3 n
+嗅盐 3 n
+嗅神经 3 n
+嗅觉 270 n
+嗅觉作用 3 n
+嗅觉区 3 n
+嗅觉缺乏 3 n
+嗅觉阈限 3 v
+嗅闻 3 n
+嗉 37 n
+嗉囊 8 n
+嗉子 3 n
+嗌 66 g
+嗍 78 v
+嗍奶头 3 vn
+嗏 44 zg
+嗐 585 zg
+嗑 82 v
+嗑牙料嘴 3 nz
+嗑瓜子 3 v
+嗒 321 o
+嗒然若丧 3 v
+嗓 80 n
+嗓声 3 n
+嗓子 772 n
+嗓子疼 3 n
+嗓子眼 58 n
+嗓子眼儿 10 n
+嗓门 252 n
+嗓门儿 5 n
+嗓音 351 n
+嗔 561 v
+嗔怒 30 v
+嗔怨 3 v
+嗔怪 68 v
+嗔戒 3 v
+嗔目切齿 3 nz
+嗔言 3 v
+嗔责 3 v
+嗕 868 zg
+嗖 210 o
+嗖嗖 94 o
+嗗 1112 zg
+嗘 715 zg
+嗙 363 zg
+嗚 371 zg
+嗛 288 zg
+嗜 497 vg
+嗜书如渴 3 i
+嗜好 188 v
+嗜杀成性 3 n
+嗜欲 11 n
+嗜烟 3 n
+嗜痂之癖 3 n
+嗜痂成癖 3 n
+嗜眠症 3 n
+嗜睡 72 v
+嗜茶 3 n
+嗜血 3 n
+嗜血成性 3 n
+嗜酒 3 n
+嗜酒如命 3 i
+嗜酒者 4 n
+嗜铬细胞 3 n
+嗜鱼蛇 3 n
+嗝 94 n
+嗝儿 9 n
+嗞 6 zg
+嗟 333 v
+嗟叹 88 v
+嗟悔 3 v
+嗟悔无及 3 i
+嗟来之食 4 i
+嗟来食 3 i
+嗡 222 zg
+嗡嗡 422 o
+嗡嗡作响 3 vn
+嗡嗡叫 3 z
+嗡嗡响 3 vn
+嗡嗡响声 3 nr
+嗡嗡嘤嘤 3 nr
+嗡嗡地 3 z
+嗡嗡声 3 z
+嗢 5 zg
+嗣 860 ng
+嗣业 3 n
+嗣位 3 n
+嗣后 99 t
+嗣子 3 t
+嗣宗 3 n
+嗣承 3 n
+嗤 1226 zg
+嗤之以鼻 55 i
+嗤池 3 v
+嗤笑 10 v
+嗥 46 g
+嗥叫 19 v
+嗦 227 zg
+嗨 368 e
+嗨哟 8 e
+嗨嗨网 3 vn
+嗪 60 g
+嗫 37 v
+嗫嗫嚅嚅 12 z
+嗫嚅 161 v
+嗫嚅小儿 3 z
+嗬 221 e
+嗬哟 3 e
+嗭 888 zg
+嗯 2213 e
+嗯帮忙 3 z
+嗲 68 l
+嗲地 3 l
+嗲声嗲气 19 l
+嗲得 3 l
+嗳 404 e
+嗳呀 3 n
+嗳声叹气 3 n
+嗳气 20 n
+嗳酸 3 n
+嗵 157 o
+嗶 2 zg
+嗷 121 o
+嗷嗷 56 o
+嗷嗷叫 21 i
+嗷嗷待哺 16 i
+嗻 77 zg
+嗽 271 n
+嗽口 3 n
+嗽叭声 3 n
+嗽嗽声 3 n
+嗽血 3 n
+嗾 28 g
+嘀 152 v
+嘀咕 253 o
+嘀嗒 26 o
+嘀嘀 4 z
+嘀嘀咕咕 19 z
+嘀噜嘟噜 3 o
+嘀里嘟噜 3 o
+嘁 97 o
+嘁嘁喳喳 34 o
+嘁嘁嚓嚓 9 o
+嘁嘁沙沙 3 vn
+嘈 118 a
+嘈嘈切切 2 z
+嘈嘈杂杂 7 z
+嘈嚷 3 z
+嘈杂 283 a
+嘈杂声 3 z
+嘉 2623 nr
+嘉业堂 23 nr
+嘉义 33 nr
+嘉义人 3 nr
+嘉义农专 3 nr
+嘉义县 13 ns
+嘉义市 17 ns
+嘉义师范 3 nr
+嘉会 3 nz
+嘉佑 2 nz
+嘉信 2 nz
+嘉偶天成 3 nr
+嘉公主 6 nr
+嘉兴 407 nr
+嘉兴人 18 nr
+嘉兴县 3 ns
+嘉兴市 27 ns
+嘉兴府 3 nr
+嘉兴街 3 ns
+嘉勉 7 nr
+嘉华 9 nz
+嘉南 3 ns
+嘉南大圳 3 ns
+嘉南药专 3 nr
+嘉善 28 nr
+嘉善县 2 ns
+嘉士伯 4 nr
+嘉奖 136 nz
+嘉奖令 4 n
+嘉娜宝 3 nr
+嘉定 196 ns
+嘉定区 4 ns
+嘉定县 11 ns
+嘉宝莉 3 nr
+嘉实多 3 nr
+嘉宾 440 ns
+嘉尔曼 3 nr
+嘉山 5 ns
+嘉山县 3 ns
+嘉峪关 98 ns
+嘉峪关市 19 ns
+嘉州 3 ns
+嘉平正 3 nr
+嘉年华 71 nz
+嘉年华会 6 nt
+嘉庆 279 ns
+嘉庆帝 3 nr
+嘉应大学 3 nr
+嘉应学院 3 n
+嘉手纳 27 nz
+嘉星 3 nz
+嘉木样 258 nr
+嘉泰 15 nz
+嘉熙 12 nz
+嘉瑞新 3 nr
+嘉礼 3 nr
+嘉祥 10 nr
+嘉祥县 3 nr
+嘉禾 48 nr
+嘉禾县 2 nr
+嘉禾路 3 nr
+嘉联 3 ns
+嘉肴美馔 3 n
+嘉荫 10 nr
+嘉荫县 4 nr
+嘉言善状 3 nr
+嘉言善行 3 nr
+嘉言录 3 nr
+嘉言懿行 3 nr
+嘉许 34 nr
+嘉谋善政 3 nr
+嘉酿 3 nr
+嘉里 61 ns
+嘉阳 3 ns
+嘉阴 3 ns
+嘉阴县 3 ns
+嘉陵 19 nr
+嘉陵区 4 ns
+嘉陵江 120 nr
+嘉陵江流域 4 ns
+嘉靖 2290 t
+嘉音 3 nz
+嘉香肉 3 nr
+嘉鱼 12 nr
+嘉鱼县 257 ns
+嘉黎 2 ns
+嘉黎县 2 ns
+嘌 66 g
+嘌呤 52 n
+嘌呤霉素 3 n
+嘎 406 o
+嘎叭 3 o
+嘎吱 41 o
+嘎啦 9 o
+嘎嘎 70 o
+嘎嘎响 3 nr
+嘎嘎声 3 nr
+嘎嘣脆 3 z
+嘎巴 7 o
+嘎渣儿 3 nr
+嘎然 3 z
+嘎登 3 nrt
+嘎达梅林 12 nz
+嘎那 4 nrt
+嘏 31 g
+嘓嘓 3 z
+嘘 241 e
+嘘下台 3 n
+嘘下台去 3 i
+嘘下台来 3 i
+嘘唏不已 3 v
+嘘声 26 n
+嘘声四起 3 i
+嘘寒问暖 40 i
+嘘开 3 v
+嘘枯吹生 3 i
+嘘气 6 n
+嘚 9 zg
+嘛 3437 y
+嘞 57 y
+嘟 131 o
+嘟哝 63 v
+嘟嘟 90 o
+嘟嘟哝哝 3 v
+嘟嘟囔囔 27 z
+嘟嘟声 3 z
+嘟噜 35 o
+嘟嚷 3 v
+嘟囔 97 z
+嘡 19 zg
+嘣 115 o
+嘤 271 o
+嘤其鸣矣 3 nr
+嘦 3 zg
+嘧 44 n
+嘧啶 55 n
+嘫 93 zg
+嘬 72 v
+嘭 174 o
+嘯 5 zg
+嘱 283 v
+嘱令 3 v
+嘱告 3 v
+嘱咐 999 v
+嘱托 133 v
+嘱目 3 v
+嘲 92 v
+嘲叽 3 n
+嘲弄 132 v
+嘲弄地 3 z
+嘲戏 3 v
+嘲热 3 v
+嘲笑 475 v
+嘲笑地 3 v
+嘲笑声 3 v
+嘲笑戏弄 3 v
+嘲笑者 3 n
+嘲讪 3 v
+嘲讽 255 v
+嘲讽地 3 z
+嘲谑 3 v
+嘲风咏月 3 n
+嘲骂 18 v
+嘴 6654 n
+嘴上 3 s
+嘴上无毛 3 l
+嘴严 3 n
+嘴中 3 s
+嘴乖 3 n
+嘴刁 3 v
+嘴利牙尖 3 n
+嘴勤 3 n
+嘴唇 1247 n
+嘴啃泥 8 l
+嘴头 13 s
+嘴子 3 n
+嘴尖 11 n
+嘴尖舌巧 3 n
+嘴巧 3 n
+嘴巴 1104 n
+嘴形 21 n
+嘴快 18 a
+嘴快舌长 3 n
+嘴把式 3 n
+嘴损 3 n
+嘴松 3 n
+嘴清舌白 3 l
+嘴渴 3 n
+嘴甜 15 a
+嘴甜心苦 3 i
+嘴皮 18 n
+嘴皮子 26 n
+嘴直 3 a
+嘴直心快 3 i
+嘴硬 48 a
+嘴碎 3 n
+嘴笨 18 a
+嘴紧 3 a
+嘴脣 3 v
+嘴脸 155 n
+嘴角 788 n
+嘴讲 3 v
+嘴软 6 a
+嘴边 342 s
+嘴部 3 n
+嘴里 2002 s
+嘴里塞 3 n
+嘴馋 15 a
+嘶 408 zg
+嘶叫 52 v
+嘶吼 15 v
+嘶哑 262 a
+嘶喊 13 v
+嘶鸣 70 v
+嘷 2 zg
+嘹 14 a
+嘹亮 122 a
+嘻 742 zg
+嘻刷刷 3 z
+嘻嘻 3 z
+嘻嘻哈哈 120 z
+嘻皮涎脸 3 i
+嘻皮笑脸 15 i
+嘻笑 130 v
+嘻笑怒骂 3 i
+嘼 2 zg
+嘾 12 zg
+嘿 481 e
+嘿嘿 965 o
+嘿嘿不语 3 v
+嘿嘿嘿 2 o
+噀 55 zg
+噀玉喷珠 3 nr
+噁 12 zg
+噇 3 zg
+噉 3 zg
+噌 65 zg
+噍 9 vg
+噎 209 zg
+噎住 70 v
+噎到 3 v
+噎嗝 3 v
+噎噎 3 v
+噎着 3 v
+噎膈 13 n
+噑 2 zg
+噔 100 o
+噕 4 zg
+噗 445 zg
+噗咚 3 o
+噗哧 141 o
+噗嗤 30 o
+噗嗤一声 3 v
+噗噗跳 3 vn
+噗噜噜 3 o
+噗通 52 o
+噗通一声 3 v
+噘 77 v
+噘嘴 10 v
+噘嘴儿 3 v
+噙 212 v
+噙齿戴发 3 ns
+噜 102 a
+噜嗦 3 a
+噜囌 3 a
+噜苏 6 a
+噢 814 e
+噢冷酷 3 nr
+噣 21 zg
+噤 30 n
+噤口 3 n
+噤口卷舌 3 i
+噤口捲舌 3 n
+噤口痢 3 n
+噤声 26 n
+噤若寒蝉 20 i
+噦 25 zg
+噧 13 zg
+器 4219 n
+器乐 170 n
+器乐曲 48 n
+器二不匮 3 i
+器件 416 n
+器具 304 n
+器宇 7 n
+器宇不凡 3 i
+器宇轩昂 10 i
+器官 1868 n
+器官移植 3 l
+器小易盈 3 n
+器度 3 n
+器材 702 n
+器材厂 267 n
+器材店 3 n
+器材行 3 n
+器械 744 n
+器械体操 2 n
+器械感 3 n
+器械科 2 n
+器满则覆 3 i
+器满将覆 3 i
+器满意得 3 i
+器物 657 n
+器物录 3 n
+器用 24 n
+器皿 255 n
+器识 3 n
+器质性 54 n
+器重 193 n
+器量 21 n
+器鼠难投 3 i
+噩 14 n
+噩兆 3 n
+噩噩浑浑 3 z
+噩梦 240 n
+噩梦般 3 n
+噩耗 110 n
+噩耗传来 3 n
+噩运 12 n
+噩鱼 3 n
+噪 138 n
+噪响 3 n
+噪声 488 n
+噪声冲击 3 n
+噪声容限 3 n
+噪声控制 3 n
+噪声效应 3 n
+噪声污染 3 n
+噪声温度 3 n
+噪声源 10 n
+噪声系数 3 n
+噪杂 3 a
+噪音 221 n
+噪音控制 3 n
+噪音管制 3 n
+噪音量 3 n
+噪鸣 3 n
+噫 102 e
+噬 206 zg
+噬人鲨 5 n
+噬斑 3 n
+噬箘体 3 n
+噬脐何及 3 i
+噬脐无及 3 i
+噬脐莫及 2 i
+噬菌体 89 n
+噬食弧菌 3 n
+噬食菌 3 n
+噭 12 zg
+噯 61 zg
+噰 25 zg
+噱 14 n
+噱头 50 n
+噲 2 zg
+噳 18 zg
+噴 9 zg
+噵 2 zg
+噶 230 nrt
+噶举派 24 n
+噶伦 7 nrt
+噶伦堡 2 ns
+噶厦 9 ns
+噶尔 116 nrt
+噶尔丹 75 ns
+噶尔县 3 ns
+噶玛噶举派 4 nz
+噷 764 zg
+噸 232 zg
+噹 111 zg
+噹啷 3 o
+噹噹 3 z
+噺 79 zg
+噻 16 n
+噻吩 20 n
+噻唑 21 n
+噻嗪 31 n
+噻烯霉素 3 n
+噼 29 o
+噼啪 35 o
+噼噼叭叭 7 o
+噼噼啪啪 38 o
+噼里啪啦 38 o
+噾 59 zg
+噿 3 zg
+嚂 4 zg
+嚅 36 x
+嚅嚅 3 z
+嚇 15 zg
+嚈 29 zg
+嚊 6 zg
+嚌 14 zg
+嚎 241 zg
+嚎叫 93 v
+嚎叫声 7 n
+嚎哭 33 v
+嚎啕 98 d
+嚎啕大哭 3 vn
+嚎天动地 3 n
+嚎天喊地 3 n
+嚏 16 n
+嚏喷 4 n
+嚐个 3 t
+嚐了 3 y
+嚐出 3 vn
+嚐到 3 vn
+嚐嚐 3 z
+嚐来嚐去 3 z
+嚐点 3 z
+嚐试 3 vn
+嚑 348 zg
+嚒 24 zg
+嚓 158 o
+嚓嚓 2 o
+嚕 7 zg
+嚖 2 zg
+嚗 2 zg
+嚘然而止 3 v
+嚜 491 zg
+嚟 40 zg
+嚣 91 l
+嚣张 165 a
+嚣张一时 3 l
+嚣张气焰 286 l
+嚣杂 3 a
+嚣浮 3 a
+嚣然 3 a
+嚣闹 3 a
+嚦 133 zg
+嚧 33 zg
+嚨 6 zg
+嚩 15 zg
+嚫 245 zg
+嚬 223 zg
+嚭 629 zg
+嚮 112 zg
+嚯 37 e
+嚱 2 zg
+嚳 7 zg
+嚷 1136 v
+嚷出 3 v
+嚷出去 3 v
+嚷出来 3 v
+嚷叫 3 v
+嚷嚷 208 v
+嚷声 3 v
+嚷起来 3 v
+嚷闹 3 v
+嚼 780 v
+嚼不了 3 v
+嚼之无味 3 n
+嚼制 3 n
+嚼墨喷纸 3 n
+嚼子 3 n
+嚼穿龈血 3 n
+嚼肌肥大 3 n
+嚼肌间隙 3 n
+嚼腭搥床 3 vn
+嚼舌 3 n
+嚼舌头 28 n
+嚼舌根 13 n
+嚼舌自尽 3 v
+嚼蜡 3 n
+嚼铁咀金 3 vn
+嚼齿穿龈 3 n
+囊 1387 zg
+囊中 196 s
+囊中之物 23 l
+囊中物 3 l
+囊中羞涩 12 i
+囊匣如洗 3 n
+囊尾蚴 9 n
+囊括 153 v
+囊括四海 3 n
+囊斑 3 n
+囊漏储中 3 n
+囊漏贮中 3 n
+囊状体 5 n
+囊状滤泡 3 n
+囊盖 3 v
+囊空如洗 3 i
+囊肿 96 n
+囊胚 18 n
+囊胚腔 3 n
+囊膪 3 v
+囊萤映雪 3 nr
+囊萤照书 3 nz
+囊萤照光 3 nz
+囊萤照读 3 nr
+囊虫 9 n
+囊蚴 7 n
+囊谦 2 nrt
+囊谦县 2 ns
+囊里盛锥 3 i
+囊锥露颖 3 i
+囍喜喜 3 z
+囏 2 zg
+囓合 3 z
+囓齿类 3 nz
+囔 12 v
+囔囔 4 v
+囔着 3 v
+囗 2 zg
+囚 299 n
+囚人 3 n
+囚困 3 v
+囚室 45 n
+囚居 3 v
+囚徒 142 n
+囚房 3 n
+囚歌 4 n
+囚牢 7 n
+囚犯 252 n
+囚狱 3 n
+囚禁 276 v
+囚笼 36 n
+囚粮 3 n
+囚衣 9 n
+囚车 57 n
+囚首丧面 3 n
+囚首垢面 3 z
+四 19090 m
+四一九 2 m
+四一二 64 m
+四一居士 3 i
+四丁 3 nrt
+四七 11 m
+四七二十八个 2 m
+四七年 7 m
+四万 102 m
+四万七千 4 m
+四万七千三百七十六亿元 2 m
+四万七千年 4 m
+四万七千群 3 m
+四万万 18 m
+四万万七千五百万 2 m
+四万两 14 m
+四万个 3 m
+四万五千余家 2 m
+四万人 3 nrt
+四万余 23 m
+四万余顷 2 m
+四万元 7 m
+四万八千岁 2 m
+四万名 5 m
+四万块 3 m
+四万多 43 m
+四万多个 2 m
+四万多元 4 m
+四万多名 4 m
+四万多户 2 m
+四万户 6 m
+四万斤 2 m
+四万顷 8 m
+四丈 24 m
+四三三 3 m
+四上 3 f
+四下 1166 m
+四下里 3 m
+四不像 12 v
+四不拗六 3 nr
+四不象 9 l
+四世 197 nrt
+四世同堂 16 nz
+四两 66 m
+四两位 2 m
+四两分 2 m
+四两卷 2 m
+四两句 3 m
+四两多 2 m
+四两拨千斤 32 n
+四两重 2 m
+四个 4507 m
+四个坚持 3 n
+四个现代 3 j
+四中 545 ns
+四中全会 230 j
+四串 3 m
+四乙 3 n
+四乙基铅 6 nz
+四乙基铵 3 nz
+四九 16 m
+四九三十六 2 m
+四九年 9 m
+四乡 54 ns
+四书 57 n
+四书五经 63 nz
+四二 18 m
+四二一 2 m
+四二六二 2 m
+四二千 2 m
+四二年 2 m
+四五 248 m
+四五一 3 m
+四五万 21 m
+四五万元 3 m
+四五万块 2 m
+四五万年 2 m
+四五丈 24 m
+四五两 3 m
+四五个 149 m
+四五事件 6 n
+四五亿元 3 m
+四五代 2 m
+四五件 2 m
+四五位 2 m
+四五倍 11 m
+四五八 2 m
+四五分 9 m
+四五分钟 5 m
+四五十 59 m
+四五十万 11 m
+四五十万两 2 m
+四五十万年 2 m
+四五十丈 2 m
+四五十个 13 m
+四五十元 5 m
+四五十匹 3 m
+四五十口 4 m
+四五十只 2 m
+四五十名 6 m
+四五十处 2 m
+四五十岁 15 m
+四五十年 7 m
+四五十招 4 m
+四五十支 2 m
+四五十斤 7 m
+四五十日 6 m
+四五十条 2 m
+四五十碗 2 m
+四五十米 2 m
+四五十里 14 m
+四五千 32 m
+四五千两 3 m
+四五千元 4 m
+四五千克 2 m
+四五千年 23 m
+四五千第 2 m
+四五千里 2 m
+四五口 3 m
+四五只 4 m
+四五名 13 m
+四五块 5 m
+四五声 2 m
+四五处 3 m
+四五天 27 m
+四五家 3 m
+四五寸 8 m
+四五对 3 m
+四五尺 16 m
+四五岁 22 m
+四五年 42 m
+四五座 2 m
+四五张 2 m
+四五成 5 m
+四五把 2 m
+四五折 2 m
+四五招 3 m
+四五支 2 m
+四五斗 2 m
+四五斤 2 m
+四五日 15 m
+四五条 3 m
+四五枝 4 m
+四五根 4 m
+四五桌 3 m
+四五次 9 m
+四五步 8 m
+四五点 9 m
+四五瓶 2 m
+四五百 42 m
+四五百万 3 m
+四五百元 8 m
+四五百名 7 m
+四五百年 2 m
+四五百户 2 m
+四五百斤 4 m
+四五百起 2 m
+四五百里 3 m
+四五碗 2 m
+四五种 2 m
+四五米 7 m
+四五级 5 m
+四五袋 2 m
+四五趟 3 m
+四五路 5 m
+四五辆 2 m
+四五运动 3 nz
+四五遍 5 m
+四五道 4 m
+四五里 31 m
+四亩 8 m
+四亭八当 3 i
+四人一组 3 m
+四人份 3 m
+四人制 2 j
+四人帮 841 j
+四人邦 3 nt
+四亿 3 m
+四亿七千五百万 3 m
+四亿五千万 4 m
+四亿五千万两 7 m
+四亿人 3 l
+四亿法郎 4 m
+四仁 3 ns
+四仙桌 3 n
+四代 87 t
+四代同堂 3 nt
+四仰八叉 14 l
+四件 47 mq
+四件套 3 l
+四价 4 n
+四份 25 mq
+四伏 14 j
+四会 9 j
+四会县 3 ns
+四会市 3 ns
+四位 587 m
+四位一体 11 l
+四位数 3 n
+四体 4 n
+四体不勤 6 l
+四体书 4 n
+四体百骸 3 i
+四余度 11 m
+四例 2 m
+四倍 41 m
+四倍体 8 n
+四停八当 3 i
+四健会 3 nz
+四元 85 m
+四元组 3 n
+四兄弟 3 n
+四克 3 ns
+四八 11 m
+四八三十二数 2 m
+四八年 3 m
+四公开 3 m
+四公里 8 m
+四六 35 m
+四六体 3 j
+四六分 6 m
+四六句 5 m
+四六名 2 m
+四六尺 2 m
+四六开 2 m
+四六文 5 m
+四六等 2 m
+四六级 80 m
+四具 23 m
+四册 9 m
+四冲八达 3 i
+四冲六达 3 i
+四冲程 3 n
+四出 98 m
+四出戏 3 i
+四出活动 3 l
+四刀 9 m
+四分 420 m
+四分之一 22 mq
+四分之三 3 m
+四分之二 3 m
+四分五 5 m
+四分五剖 3 i
+四分五落 9 i
+四分五裂 106 i
+四分天下 3 m
+四分开 3 m
+四分法 3 n
+四分钟 3 mq
+四分音符 3 n
+四列 4 m
+四则 10 m
+四则运算 45 l
+四副 4 m
+四包 10 m
+四化 37 j
+四化大业 3 nz
+四化建设 20 l
+四匹 65 m
+四区 14 ns
+四十 494 m
+四十一 36 m
+四十一个 2 m
+四十一中 3 nrt
+四十一位 2 m
+四十一岁 13 m
+四十一年 56 m
+四十一道 2 m
+四十一页 2 m
+四十七 26 m
+四十七万 5 m
+四十七个 5 m
+四十七中 3 nz
+四十七八岁 3 m
+四十七卷 2 m
+四十七名 2 m
+四十七员 3 m
+四十七处 2 m
+四十七岁 8 m
+四十七年 70 m
+四十万 58 m
+四十万两 22 m
+四十万家 2 m
+四十万贯 5 m
+四十万零八千 2 m
+四十丈 3 m
+四十三 27 m
+四十三万余 3 m
+四十三万平方米 2 m
+四十三个 2 m
+四十三中 3 nz
+四十三处 2 m
+四十三天 19 m
+四十三岁 8 m
+四十三年 62 m
+四十三篇 2 m
+四十三类 2 m
+四十下 2 m
+四十不惑 3 l
+四十两 18 m
+四十个 43 m
+四十中 3 nrt
+四十九 43 m
+四十九万 2 m
+四十九个 4 m
+四十九中 3 nz
+四十九名 7 m
+四十九团 3 m
+四十九岁 13 m
+四十九年 11 m
+四十九扇 2 m
+四十九日 9 m
+四十九枝 2 m
+四十九根 3 m
+四十九盏 4 m
+四十九里 2 m
+四十二 33 m
+四十二万 2 m
+四十二个 2 m
+四十二中 3 nz
+四十二件 2 m
+四十二卷 11 m
+四十二名 3 m
+四十二员 3 m
+四十二岁 21 m
+四十二年 50 m
+四十二条 2 m
+四十二章 111 m
+四十二笔 2 m
+四十二篇 3 m
+四十二行 2 m
+四十五 52 m
+四十五万 2 m
+四十五万两 13 m
+四十五两 2 m
+四十五个 2 m
+四十五中 3 nz
+四十五亿 2 m
+四十五六岁 6 m
+四十五分 9 m
+四十五分钟 7 m
+四十五卷 5 m
+四十五天 19 m
+四十五岁 16 m
+四十五年 51 m
+四十五度 10 m
+四十五斤 2 m
+四十五篇 2 m
+四十五载 2 m
+四十五里 263 m
+四十五项 2 m
+四十亩 4 m
+四十亿 2 m
+四十位 2 m
+四十余 52 m
+四十余万 16 m
+四十余万斤 2 m
+四十余下 2 m
+四十余个 3 m
+四十余口 2 m
+四十余只 4 m
+四十余名 4 m
+四十余天 2 m
+四十余岁 5 m
+四十余年 27 m
+四十余座 2 m
+四十余所 3 m
+四十余招 19 m
+四十余斤 2 m
+四十余日 2 m
+四十余次 2 m
+四十余篇 2 m
+四十余艘 3 m
+四十余里 11 m
+四十倍 2 m
+四十元 6 m
+四十八 103 m
+四十八万七千五百七十二 2 m
+四十八个 5 m
+四十八中 3 l
+四十八卷 2 m
+四十八员 2 m
+四十八处 2 m
+四十八岁 12 m
+四十八年 58 m
+四十八斤 129 m
+四十八日 2 m
+四十八条 7 m
+四十八篇 7 m
+四十八里 3 m
+四十公斤 2 m
+四十公里 3 m
+四十六 17 m
+四十六七岁 4 m
+四十六个 8 m
+四十六中 3 nrt
+四十六号 2 m
+四十六岁 10 m
+四十六年 43 m
+四十六日 4 m
+四十六次 2 m
+四十六起 2 m
+四十六辑 2 m
+四十几万两 2 m
+四十几天 3 m
+四十几岁 14 m
+四十几年 2 m
+四十几度 2 m
+四十出 4 m
+四十出头 14 m
+四十分钟 12 m
+四十匹 4 m
+四十千米 2 m
+四十卷 15 m
+四十厘米 3 m
+四十发 3 m
+四十口 5 m
+四十名 22 m
+四十员 2 m
+四十周年 3 m
+四十四 25 m
+四十四万九千八百镑 2 m
+四十四万多平方公里 5 m
+四十四丈 3 m
+四十四个 9 m
+四十四中 3 nz
+四十四代 2 m
+四十四岁 5 m
+四十四年 69 m
+四十回 16 m
+四十块 4 m
+四十声 2 m
+四十多 19 m
+四十多万 8 m
+四十多万两 3 m
+四十多个 19 m
+四十多分 2 m
+四十多分钟 3 m
+四十多名 2 m
+四十多天 4 m
+四十多家 4 m
+四十多岁 95 m
+四十多年 69 m
+四十多斤 2 m
+四十多架 2 m
+四十多根 2 m
+四十多次 3 m
+四十多篇 2 m
+四十多米 2 m
+四十多辆 2 m
+四十多里 6 m
+四十多门 2 m
+四十多间 2 m
+四十天 5 m
+四十好几 3 m
+四十岁 160 m
+四十左右 9 m
+四十年 306 m
+四十年代 5 m
+四十度 7 mq
+四十开 2 m
+四十张 5 m
+四十把 2 m
+四十招 2 m
+四十文 2 m
+四十斤 9 m
+四十日 9 m
+四十条 5 m
+四十步 4 m
+四十种 2 m
+四十篇 3 m
+四十米 2 m
+四十里 59 m
+四十锭 3 m
+四十顷 3 m
+四十颗 4 m
+四十首 3 m
+四千 89 m
+四千一百二十四箱 2 m
+四千一百五十四万余两 2 m
+四千七百 3 m
+四千七百七十二万余两 2 m
+四千万 4 m
+四千万元 2 m
+四千三百两 3 m
+四千两 15 m
+四千个 3 m
+四千五 3 m
+四千五百 2 m
+四千五百二十七匹 2 m
+四千人 3 i
+四千余 21 m
+四千余箱 2 m
+四千元 6 m
+四千八百 2 m
+四千八百万口 2 m
+四千八百名 2 m
+四千六百二十六万余两 2 m
+四千名 3 m
+四千块 3 m
+四千多 13 m
+四千多亿美元 2 m
+四千多名 2 m
+四千多套 2 m
+四千多年 11 m
+四千多片 2 m
+四千左右 3 m
+四千年 25 m
+四千户 8 m
+四千文 2 m
+四千里 3 m
+四千零三十 2 m
+四卷 75 m
+四双 5 m
+四发 13 j
+四叔 3 n
+四叠体 6 nz
+四口 75 m
+四句 190 m
+四只 203 m
+四台 24 m
+四史 3 n
+四叶 8 t
+四叶参 3 n
+四叶草 3 n
+四号 48 m
+四号位 3 n
+四号台 3 n
+四号楼 3 n
+四号线 3 n
+四合 39 j
+四合房 2 n
+四合院 193 nt
+四合院儿 3 n
+四名 655 m
+四君子 3 nr
+四君子汤 3 nz
+四吨 3 m
+四员 55 m
+四周 2785 m
+四周围 23 f
+四周岁 7 m
+四味 10 m
+四呼 3 v
+四品 575 n
+四响 7 m
+四哥 3 ns
+四唑氮蓝 3 nz
+四喜 3 ns
+四四 15 m
+四四二 3 m
+四四年 2 m
+四四方方 20 m
+四回 4 mq
+四团 15 m
+四围 51 f
+四国 137 ns
+四国岛 7 ns
+四国赛 3 ns
+四国银行 3 nt
+四圆 3 n
+四圈 433 m
+四场 65 mq
+四块 99 m
+四坪 3 ns
+四堆 3 m
+四堵 12 m
+四塘 2 ns
+四境 31 n
+四增四减 3 i
+四壁 218 ns
+四声 88 m
+四壶 3 n
+四处 1032 m
+四处坚持 3 nr
+四处奔波 25 i
+四处奔走 3 i
+四处寻找 3 l
+四处张望 3 i
+四处活动 3 l
+四外 3 f
+四夜 17 m
+四大 4428 j
+四大发明 47 nz
+四大名捕 3 n
+四大名著 15 i
+四大块 3 m
+四大家族 38 nz
+四大洋 3 ns
+四大洲 3 ns
+四大片 3 m
+四大皆空 19 i
+四大美女 3 l
+四大行 3 nt
+四大部 15 nt
+四天 179 m
+四头 50 m
+四套 10 m
+四套班子 3 n
+四好连队 3 nt
+四姐妹 3 nr
+四姑娘山 13 ns
+四姻九戚 3 n
+四子王旗 5 ns
+四孔 3 n
+四季 422 m
+四季如春 32 l
+四季如画 3 l
+四季常青 140 b
+四季度 73 mq
+四季春 3 nr
+四季歌 3 n
+四季海棠 3 ns
+四季豆 20 n
+四季长春 3 nr
+四季青 7 nr
+四季青村 3 ns
+四季风 2 l
+四宗 3 m
+四定 3 d
+四客 3 j
+四害 11 n
+四家 204 m
+四家子 3 n
+四寸 27 m
+四封 11 m
+四射 86 v
+四尊 6 m
+四小 18 j
+四小块 3 m
+四小片 3 m
+四小龙 22 j
+四尺 219 m
+四尾 3 ns
+四局 14 j
+四层 76 m
+四层楼 3 n
+四届 148 m
+四山五岳 3 ns
+四岁 82 m
+四岛 6 ns
+四岳 16 ns
+四峰 2 ns
+四川 3779 ns
+四川人 55 nz
+四川人民出版社 8 nt
+四川全兴 3 nt
+四川北路 4 ns
+四川双马 2 ns
+四川大学 105 nt
+四川火锅 3 n
+四川版 3 nz
+四川电视台 4 nt
+四川盆地 169 ns
+四川省 788 ns
+四川省人民政府 3 nt
+四川省委 12 nt
+四川省政府 9 nt
+四川省旅游局 7 nt
+四川省统计局 2 nt
+四川省阿坝藏族羌族自治州 3 ns
+四川籍 4 n
+四川航空公司 4 nt
+四川菜 3 n
+四川话 3 n
+四川长虹 14 nt
+四川队 23 nt
+四巷 3 ns
+四帧 2 m
+四席 4 m
+四幅 25 m
+四幕 2 m
+四幢 2 m
+四平 102 ns
+四平乡 3 ns
+四平八稳 17 i
+四平市 19 ns
+四平方公里 2 m
+四平方米 3 m
+四平调 3 nz
+四平路 3 m
+四年 2655 m
+四年制 3 n
+四年生 3 b
+四年级 3 b
+四库 200 nz
+四库全书 3 n
+四度 34 mq
+四度空间 3 n
+四座 82 m
+四座宾朋 3 n
+四开 20 m
+四开本 3 ns
+四式 3 n
+四张 79 m
+四张机 3 n
+四强赛 3 nz
+四德 6 nrt
+四恩 3 nrt
+四惠 3 j
+四惠东 3 nr
+四成 56 m
+四战 3 j
+四战之国 3 nz
+四战之地 6 i
+四截 3 m
+四户 10 m
+四所 26 j
+四扇 10 m
+四手 49 m
+四手操作 3 l
+四批 18 m
+四把 28 m
+四折 17 m
+四招 37 m
+四拳 6 m
+四排 5 m
+四掾袱 3 n
+四支 41 m
+四散 287 j
+四数 4 m
+四文 4 nz
+四斗 6 m
+四斤 6 m
+四方 1089 m
+四方之志 3 i
+四方八面 11 m
+四方区 3 ns
+四方台 3 mq
+四方台区 3 ns
+四方响应 3 n
+四方形 28 n
+四方步 4 m
+四方脸 6 m
+四方藤 3 nz
+四方街 5 ns
+四方面 20 mq
+四方面军 39 nt
+四旁 12 f
+四日 139 t
+四日份 3 nz
+四日游 3 nz
+四日电 3 nz
+四旧 93 j
+四时 120 t
+四时不绝 3 i
+四时之气 3 i
+四时八节 4 i
+四明 34 ns
+四明山 21 ns
+四星 39 nz
+四星期 3 b
+四星级 83 b
+四晚 3 t
+四智 3 n
+四曲 2 m
+四更将残 3 i
+四月 1216 m
+四月份 3 mq
+四月八 3 t
+四望 48 v
+四期 64 f
+四本 16 ns
+四朵 7 m
+四杆 3 m
+四村 2 ns
+四条 226 m
+四条友 3 n
+四条线 3 n
+四杯 11 m
+四板 3 n
+四极 26 ns
+四极管 5 n
+四枚 61 m
+四枝 13 m
+四枪 3 m
+四架 24 m
+四架梁 3 ns
+四柜 3 n
+四柱 25 m
+四栋 3 m
+四株 9 m
+四样 34 m
+四根 163 m
+四格 3 n
+四桌 2 m
+四档 35 m
+四桶 3 m
+四棱柱 3 i
+四棱豆 4 n
+四棵 15 m
+四楼 3 ns
+四楼住户 3 i
+四次 460 m
+四次会议 3 nz
+四次曲线 3 nz
+四款 14 m
+四步 20 m
+四步曲 3 m
+四步舞 3 i
+四段 27 m
+四毛 7 n
+四民 3 n
+四氟乙烯 22 nz
+四氢吡咯 9 nz
+四氢呋喃 17 n
+四氧化二氮 8 nz
+四氯 3 nz
+四氯化硅 3 nz
+四氯化碳 33 nz
+四氯化钛 8 nz
+四氯甲烷 3 nz
+四河 13 ns
+四洞 3 ns
+四洲 8 ns
+四洲志 3 ns
+四派 56 m
+四流 2 ns
+四海 372 ns
+四海一家 4 m
+四海为家 25 l
+四海之内 17 nz
+四海之内皆兄弟 3 l
+四海九州 3 ns
+四海他人 3 nz
+四海升平 3 n
+四海工业 3 nt
+四海帮 3 j
+四海承风 3 nr
+四海昇平 3 nz
+四海波静 3 i
+四海飘零 3 i
+四海鼎沸 3 i
+四清 30 t
+四清六活 3 i
+四清运动 3 l
+四渎 3 v
+四湖 9 ns
+四溅 130 v
+四源 3 n
+四溢 65 v
+四满 3 j
+四点 147 m
+四爷 221 n
+四片 28 m
+四版 3 n
+四物汤 9 n
+四环 41 ns
+四环素 70 l
+四环素牙 3 ns
+四环萜烷 3 n
+四环路 3 ns
+四现 3 v
+四班 15 m
+四球 3 n
+四瓣 3 n
+四瓣花 3 n
+四瓶 2 m
+四男 3 n
+四番 4 m
+四白 3 ns
+四百 151 m
+四百一十名 2 m
+四百七十架 2 m
+四百万 31 m
+四百万两 3 m
+四百万元 2 m
+四百万斤 2 m
+四百三十万 2 m
+四百三十三公里 2 m
+四百三十元 2 m
+四百三十八万余吨 2 m
+四百下 9 m
+四百两 42 m
+四百个 3 m
+四百九十七章 2 m
+四百九十多条 8 m
+四百二十二家 2 m
+四百五十 8 m
+四百五十万 4 m
+四百五十万平方米 2 m
+四百五十余万元 2 m
+四百五十元 3 m
+四百五百 2 m
+四百人 3 n
+四百亿美元 2 m
+四百余 8 m
+四百余万 3 m
+四百余万头 2 m
+四百余卷 2 m
+四百余名 4 m
+四百余年 7 m
+四百余种 2 m
+四百余起 2 m
+四百余里 4 m
+四百余门 2 m
+四百元 9 m
+四百八十 4 m
+四百八十元 2 m
+四百公里 2 m
+四百六十七 2 m
+四百六十七目 2 m
+四百六十七种 2 m
+四百六十九公里 2 m
+四百六十文 2 m
+四百六十章 2 m
+四百卷 2 m
+四百名 19 m
+四百四十八万人次 2 m
+四百四十八万余两 2 m
+四百四病 3 n
+四百块 3 m
+四百多 26 m
+四百多万 2 m
+四百多万两 2 m
+四百多个 3 m
+四百多分 2 m
+四百多名 5 m
+四百多场 16 m
+四百多年 13 m
+四百多次 5 m
+四百多篇 3 m
+四百多米 3 m
+四百多里 3 m
+四百年 30 m
+四百度 4 m
+四百座 2 m
+四百户 2 m
+四百文 2 m
+四百斤 9 m
+四百条 2 m
+四百米 4 m
+四百美元 2 m
+四百艘 3 m
+四百部 2 m
+四百里 20 m
+四盆 14 m
+四盏 15 m
+四盒 2 m
+四盘 19 m
+四目 80 n
+四眼 20 m
+四眼井 3 i
+四眼田鸡 3 ns
+四眼鱼 3 l
+四码 3 n
+四碗 12 m
+四神丸 5 n
+四票 3 n
+四种 436 m
+四科 3 ns
+四秒 3 m
+四秒钟 3 i
+四章 13 m
+四端 10 m
+四端网络 3 n
+四笔 3 m
+四等 77 m
+四等奖 4 nz
+四筒 3 n
+四箱 4 m
+四篇 18 m
+四米 25 m
+四类 71 m
+四类人 3 n
+四粒 28 m
+四絃琴 3 v
+四级 602 m
+四级字 3 l
+四纵 519 nrt
+四纷五落 3 i
+四线 17 m
+四组 12 m
+四绝 3 ns
+四维 488 m
+四维八德 3 ns
+四维动量 3 n
+四维张量 3 n
+四维时空 3 l
+四维空间 11 n
+四维路 3 ns
+四维速度 3 ns
+四缘 3 n
+四美 3 m
+四群 2 m
+四联 3 ns
+四联单 3 j
+四聚体 3 n
+四股 12 m
+四肢 887 n
+四肢发达 3 n
+四肢无力 3 i
+四肢百体 3 n
+四肢百骸 55 i
+四肢骨 3 n
+四胎 3 m
+四胞胎 3 n
+四胡 16 n
+四脚 3 mq
+四脚朝天 10 i
+四脚蛇 4 i
+四膜虫 3 n
+四自 6 ns
+四至 56 d
+四至八道 3 i
+四舅 3 n
+四舍五入 5 i
+四船 3 j
+四艘 45 m
+四色 3 mq
+四色笔 3 n
+四色问题 3 n
+四节 41 m
+四节课 3 n
+四苯硼钠 3 nz
+四英里 2 m
+四荒 22 ns
+四荒八极 3 i
+四药 3 j
+四营 9 ns
+四行 81 j
+四街 3 ns
+四衢八街 3 ns
+四袋 13 m
+四角 305 m
+四角俱全 3 i
+四角号码 9 n
+四角帽 3 n
+四角形 3 n
+四言诗 14 n
+四记 9 n
+四课 3 n
+四谛 3 n
+四象 3 n
+四起 181 m
+四趟 2 m
+四跨 4 j
+四路 135 m
+四路纵队 3 nt
+四蹄 75 n
+四轮 59 m
+四轮车 15 n
+四轮驱动 8 nz
+四轴挠性 3 vn
+四载 8 m
+四辆 14 m
+四辑 6 n
+四边 81 f
+四边形 35 n
+四达 7 ns
+四连冠 9 j
+四逆散 3 i
+四逆汤 5 i
+四通 33 nz
+四通五达 3 nt
+四通八达 670 i
+四通公司 3 nt
+四通利方 3 n
+四通集团 5 nt
+四遍 12 m
+四道 159 m
+四道关 3 ns
+四道口 3 mq
+四邑 6 ns
+四邻 71 n
+四邻八村 3 l
+四郊 3 ns
+四郊多垒 3 n
+四郎探母 12 n
+四部 117 m
+四部丛刊 55 n
+四部合唱 3 l
+四部备要 14 l
+四部委 3 nt
+四部曲 6 m
+四里 22 m
+四里八乡 3 ns
+四重 12 m
+四重唱 3 l
+四重奏 64 n
+四重峰 3 nz
+四野 89 ns
+四野茫茫 3 i
+四铢 4 m
+四锅 3 n
+四锤 2 m
+四锭 4 m
+四镇 3 ns
+四门 322 ns
+四间 25 f
+四间房 2 n
+四队 35 m
+四阵 7 m
+四阶 3 n
+四阿 3 ns
+四隅 3 nrt
+四集 6 m
+四面 846 mq
+四面体 81 n
+四面佛 3 d
+四面八方 653 i
+四面出击 22 i
+四面受困 3 i
+四面受敌 15 i
+四面山 6 ns
+四面弹 3 n
+四面楚歌 25 i
+四音 3 n
+四音节 3 n
+四页 4 m
+四顶 9 m
+四顷 19 m
+四项 692 m
+四顾 146 d
+四顾无人 13 i
+四颗 52 m
+四颗星 3 n
+四餐 7 m
+四首 27 m
+四首歌 3 m
+四马攒蹄 3 i
+四马难追 3 i
+四驱车 8 n
+四魂 3 n
+四魂之玉 3 i
+囝 2 zg
+回 23572 v
+回不去 3 v
+回不来 3 v
+回丝 8 v
+回中 3 v
+回乡 300 v
+回乡务农 3 nz
+回乡证 3 nz
+回书 3 v
+回事 1195 v
+回事儿 3 n
+回互 3 v
+回交 3 v
+回京 3 ns
+回人 3 n
+回令 3 v
+回传 39 v
+回传球 5 n
+回位 2 v
+回信 160 v
+回修 3 v
+回光反照 5 i
+回光返照 22 i
+回光镜 3 nz
+回冲 5 v
+回击 244 v
+回函 4 v
+回到 6103 v
+回到未来 3 l
+回力 22 n
+回力卡环 3 nz
+回动 3 v
+回升 439 v
+回单 6 v
+回历 40 v
+回去 6209 v
+回叙 3 v
+回叫 3 v
+回台 3 v
+回合 358 v
+回合制 3 n
+回吐 52 v
+回向 3 v
+回告 10 v
+回味 128 v
+回味无穷 288 i
+回咬 3 v
+回响 67 vn
+回嗔作喜 12 i
+回嘴 11 v
+回嘴百争 3 i
+回回 3 v
+回国 1892 ns
+回国探亲 3 n
+回圈 3 nz
+回城 185 ns
+回城券 3 n
+回城卷 3 nz
+回填 21 v
+回填土 3 i
+回声 215 v
+回声营 3 i
+回复 492 v
+回复人 3 n
+回复体 3 n
+回复力矩 3 i
+回复数 3 n
+回复率 4 nz
+回复突变 3 i
+回大陆 3 nz
+回天 28 v
+回天之力 15 i
+回天乏力 3 nz
+回天乏术 10 n
+回天倒日 3 i
+回天再造 3 i
+回天挽日 3 i
+回天无力 9 i
+回天无术 2 i
+回天转地 3 i
+回天运斗 3 nz
+回头 3656 v
+回头一看 3 i
+回头客 28 n
+回头是岸 32 i
+回头率 27 n
+回头草 3 n
+回头见 33 v
+回头路 11 n
+回娘家 3 n
+回宫 3 v
+回家 3197 n
+回家吧 3 n
+回家路上 3 l
+回家途中 3 i
+回屋 3 v
+回山倒海 3 i
+回山转海 3 nz
+回差现象 3 n
+回师 141 n
+回帖 24 n
+回席 3 v
+回干就湿 3 l
+回应 548 v
+回廊 276 n
+回延安 3 ns
+回弹 15 v
+回弹力 3 n
+回弹性 6 n
+回归 1270 v
+回归估计 3 n
+回归年 62 n
+回归方程 3 n
+回归热 5 i
+回归祖国 3 n
+回归系数 3 n
+回归线 4 n
+回归自然 3 i
+回形夹 3 n
+回形针 3 n
+回得 3 v
+回得去 3 v
+回得来 3 v
+回心 3 v
+回心转意 140 i
+回忆 1408 v
+回忆录 237 n
+回忆往事 3 i
+回忆法 3 n
+回忆起 3 i
+回念 3 v
+回想 526 v
+回想出 3 v
+回想到 3 v
+回想起来 3 l
+回手 74 v
+回扣 331 v
+回执 35 v
+回执单 3 n
+回执表 3 n
+回扫 3 v
+回扫时间 3 i
+回护 3 v
+回报 1133 v
+回报率 95 n
+回拜 16 v
+回拨 5 v
+回拨卡 3 n
+回授 3 v
+回掉 3 v
+回接工具 3 n
+回援 5 v
+回撤 17 v
+回收 526 v
+回收公司 3 n
+回收塔 3 n
+回收期 6 n
+回收机 3 n
+回收率 20 n
+回收站 4 n
+回放 53 v
+回教 59 nz
+回教人 3 n
+回教信徒 3 n
+回教帝国 3 ns
+回教徒 5 n
+回敬 93 v
+回文 31 nz
+回文织锦 3 n
+回文结构 3 n
+回文诗 2 n
+回旋 582 v
+回旋余地 3 n
+回旋加速 3 n
+回旋半径 3 n
+回旋器 3 n
+回旋手机 3 n
+回旋曲 15 n
+回旋曲式 3 n
+回旋酶 3 n
+回族 2034 nz
+回映 3 v
+回春 35 v
+回春之术 3 l
+回春作用 3 n
+回春妙手 3 i
+回春方 3 nz
+回暖 49 v
+回望 59 v
+回本 3 n
+回来 12128 v
+回校 3 n
+回档 3 v
+回款 13 v
+回母校 3 n
+回民 158 n
+回民区 3 n
+回水 26 v
+回水温度 3 n
+回汉 3 ns
+回油泵 3 n
+回波 45 v
+回波箱 3 nz
+回流 178 v
+回流焊 3 n
+回流率 3 n
+回流阀 3 n
+回涨 3 v
+回港 3 ns
+回游 281 v
+回溯 57 v
+回溯到 3 l
+回潮 33 v
+回潮率 3 nz
+回灌 8 v
+回火 30 v
+回炉 27 v
+回环 43 vn
+回生 29 v
+回生起死 3 v
+回用 4 v
+回电 21 v
+回目 28 n
+回眸 68 v
+回眸一笑 3 i
+回礼 48 v
+回神 3 v
+回禀 119 v
+回禄 3 n
+回禄之灾 3 n
+回程 55 n
+回程票 2 n
+回稳 8 v
+回空 3 v
+回笼 34 v
+回笼觉 3 n
+回笼资金 3 n
+回答 8822 v
+回答者 9 n
+回筹转策 3 n
+回签 3 v
+回纥 112 nz
+回纥兵 3 vn
+回纥军 3 vn
+回纹柱 3 n
+回纹针 3 n
+回绕 16 v
+回绝 96 v
+回翔 3 v
+回老家 264 n
+回肠 16 v
+回肠九转 3 i
+回肠伤气 3 n
+回肠寸断 3 i
+回肠百转 3 i
+回肠荡气 21 i
+回航 3 v
+回航途中 3 n
+回船转舵 3 i
+回良玉 6 nz
+回荡 140 v
+回落 331 v
+回覆 3 v
+回见 108 v
+回记得 3 nz
+回访 51 v
+回诊 3 v
+回话 111 v
+回诵 3 v
+回请 3 v
+回调 87 v
+回购 154 v
+回赎 3 i
+回赠 22 v
+回走 3 v
+回起 3 v
+回跌 8 v
+回路 142 v
+回路转 3 i
+回跳 3 v
+回身 615 v
+回车 33 v
+回车符 3 n
+回车键 3 n
+回转 298 v
+回转仪 3 nz
+回转半径 3 n
+回转台 3 n
+回转头 13 n
+回转式 3 n
+回转木马 3 nz
+回转窑 3 nz
+回软 4 v
+回迁 11 v
+回迁房 3 n
+回过 1827 v
+回过头来 3 l
+回返 31 v
+回退 3 v
+回退键 3 n
+回送 8 v
+回递性 3 n
+回途 3 n
+回道 3 v
+回避 984 v
+回避学习 3 v
+回避率 3 l
+回避行为 3 i
+回邪入正 3 i
+回邮 3 ns
+回邮信封 3 n
+回部 3 n
+回采 23 v
+回銮 24 v
+回铃音 3 n
+回销 3 v
+回锅 265 v
+回锅油 3 n
+回锅肉 8 n
+回门 38 v
+回防 31 v
+回青 3 v
+回音 174 n
+回音壁 14 n
+回顾 1454 v
+回顾历史 3 i
+回顾展 16 i
+回顾性 2 n
+回顾总结 3 n
+回顾过去 3 i
+回风 3 v
+回风管道 3 l
+回飞棒 3 i
+回馈 44 v
+回馈性 3 n
+回首 225 v
+回首往事 3 i
+回马枪 20 nz
+回驳 3 v
+回骂 3 v
+回魂 3 v
+回魂夜 3 i
+回鹘 298 ns
+回黄转绿 3 i
+回龙 10 nz
+回龙山 3 ns
+回龙观 3 nz
+囟 77 n
+囟门 9 n
+因 29186 p
+因为 35698 c
+因之 3 c
+因乌及屋 3 i
+因事 3 n
+因事制宜 3 n
+因人 3 n
+因人事兴 3 n
+因人事废 3 i
+因人制宜 5 i
+因人成事 7 i
+因人施教 3 i
+因人而异 92 i
+因任授官 3 n
+因企制宜 4 n
+因公 3 n
+因公假私 3 i
+因公护照 3 n
+因公殉职 6 i
+因公殉难 3 i
+因公行私 3 n
+因公请假 3 n
+因公负伤 3 n
+因其 3 c
+因利乘便 6 i
+因势利导 75 n
+因变数 3 n
+因变量 11 n
+因噎废食 21 i
+因地制宜 167 i
+因子 485 n
+因子分析 3 l
+因小失大 20 i
+因小见大 3 i
+因年而异 3 i
+因应 49 n
+因应之道 3 i
+因式 3 n
+因式分解 7 l
+因循 36 v
+因循坐误 3 n
+因循守旧 38 i
+因循旧规 3 n
+因循苟且 3 i
+因扎吉 26 i
+因故 367 n
+因故取消 3 l
+因故未来 3 i
+因故辞职 3 i
+因敌为资 3 l
+因敌取资 3 i
+因数 46 n
+因数分解 3 n
+因斯 8 n
+因斯布鲁克 10 nrt
+因日而异 3 i
+因时 3 c
+因时制宜 13 i
+因时因地 8 i
+因明 52 n
+因材 3 n
+因材施教 35 n
+因果 268 c
+因果关系 3 n
+因果律 4 n
+因果性 7 n
+因果报应 44 n
+因果论 3 c
+因树为屋 3 i
+因次 3 c
+因此 23294 c
+因此之故 3 i
+因涉嫌 3 n
+因特 5 nrt
+因特尔 3 nrt
+因特网 292 n
+因特网址 3 n
+因由 47 n
+因病 3 n
+因病未来 3 i
+因病请假 3 n
+因着 10 c
+因祸为福 3 i
+因祸得福 34 i
+因私 3 n
+因私护照 3 n
+因素 7420 n
+因素负荷 3 n
+因缘 110 n
+因缘为市 3 i
+因缘际会 3 n
+因而 6235 c
+因而是 139 c
+因袭 87 v
+因袭旧规 3 i
+因袭陈规 3 i
+因贤任能 3 i
+因购买 3 l
+因车祸 3 n
+因陀罗 9 n
+因陋守旧 3 i
+因陋就寡 3 i
+因陋就简 24 i
+因难见巧 3 i
+因雨 3 n
+因雨取消 3 l
+因雨延期 3 i
+因雨暂停 3 vn
+因风吹火 3 i
+囡 15 zg
+团 6703 n
+团丁 50 n
+团中央 93 nt
+团代会 3 n
+团伙 157 n
+团伙化 3 n
+团体 4923 n
+团体之间 3 l
+团体会员 3 n
+团体冠军 3 n
+团体性 3 n
+团体操 8 n
+团体机票 3 n
+团体比赛 3 n
+团体活动 3 l
+团体测验 3 n
+团体照 2 n
+团体票 7 n
+团体赛 154 n
+团作 3 n
+团保 3 j
+团儿 7 n
+团党委 3 nt
+团务工作 3 n
+团区委 4 n
+团十三大 3 j
+团县委 3 n
+团名 3 a
+团员 325 n
+团员意识 3 n
+团员证 3 n
+团员青年 3 n
+团团 587 n
+团团围住 3 l
+团团圆圆 5 n
+团团簇簇 3 z
+团团转 71 i
+团团长 3 n
+团圆 185 n
+团圆夜 3 n
+团圆年 2 n
+团圆日 3 n
+团圆节 3 n
+团圆饭 28 n
+团场 25 n
+团坐 3 v
+团块 24 n
+团城 537 n
+团头聚面 3 n
+团头鲂 12 n
+团契 3 a
+团委 107 n
+团委书记 3 n
+团委干部 3 n
+团子 1567 n
+团小组 4 n
+团山子 28 n
+团工委 2 nt
+团市委 24 nt
+团干 10 n
+团干部 5 n
+团年饭 2 n
+团建 3 a
+团弄 3 v
+团徽 20 ns
+团总支 3 n
+团扇 58 n
+团拜 14 ns
+团拜会 33 n
+团支书 3 n
+团支部 30 n
+团政委 20 nt
+团旗 2 n
+团日 4 n
+团服 3 n
+团校 8 n
+团河 3 ns
+团泊洼 3 ns
+团状 3 n
+团省委 24 nt
+团章 3 n
+团管区 3 n
+团籍 3 n
+团粉 3 n
+团粒 6 n
+团粒结构 3 n
+团级 38 n
+团练 107 a
+团组 6 n
+团组织 65 nt
+团结 3941 a
+团结一心 147 i
+团结一致 3 i
+团结乡 3 n
+团结互助 3 l
+团结党 12 n
+团结出版社 2 nt
+团结协调 3 n
+团结友爱 4 l
+团结合作 3 n
+团结奋战 3 i
+团结奋斗 3 i
+团结奋进 3 i
+团结报 14 n
+团结拼博 3 i
+团结村 3 n
+团结湖 8 n
+团结紧张 3 l
+团结起来 3 l
+团职 12 n
+团聚 185 v
+团脐 3 n
+团脸 3 n
+团花 26 n
+团花簇锦 3 v
+团茶 3 n
+团藻 14 n
+团讯 3 n
+团课 3 n
+团购 19 v
+团购网 3 n
+团费 135 n
+团身 5 n
+团部 68 n
+团里 133 n
+团长 1702 n
+团队 1103 n
+团队精神 3 n
+团队餐 3 n
+团音 3 n
+团风 3 n
+团风县 256 ns
+团鱼 7 n
+团龄 3 n
+団 13 zg
+囤 127 v
+囤积 98 v
+囤积居奇 14 i
+囤积者 3 i
+囤粮 3 v
+囤聚 3 v
+囤货 3 v
+囥 54 zg
+囦 243 zg
+囧 654 zg
+囨 516 zg
+囩 199 zg
+囪 182 zg
+囫 2 d
+囫囵 83 d
+囫囵半片 3 i
+囫囵吞枣 13 i
+囫囵竹 3 i
+囬 113 zg
+园 1914 zg
+园丁 67 n
+园丁奖 3 nz
+园中 222 s
+园中园 4 n
+园主 3 n
+园亭 5 n
+园内 220 s
+园凳 3 n
+园区 397 n
+园号 3 n
+园囿 5 n
+园圃 25 n
+园地 125 n
+园外 3 s
+园子 423 n
+园寝 3 n
+园工 3 n
+园庭 3 n
+园形 3 n
+园数 3 n
+园木 3 n
+园林 1286 n
+园林分区 3 n
+园林化 7 n
+园林区划 3 n
+园林城市 3 n
+园林学史 3 n
+园林局 5 n
+园林工具 3 n
+园林工程 3 n
+园林建筑 3 n
+园林式 262 n
+园林形式 3 n
+园林施工 3 n
+园林景观 3 n
+园林机械 3 n
+园林植物 3 n
+园林水景 3 n
+园林管理 3 n
+园林绿化 3 n
+园林美学 3 n
+园林艺术 3 n
+园林规划 3 n
+园林设计 3 n
+园桌 3 n
+园洲 3 n
+园滚 3 n
+园满 3 n
+园灯 3 n
+园点 3 n
+园珠笔 2 n
+园田 8 n
+园田化 3 n
+园艺 171 n
+园艺业 28 n
+园艺产品 3 n
+园艺作物 3 n
+园艺场 606 n
+园艺学 21 n
+园艺家 5 n
+园艺工具 3 n
+园艺师 2 n
+园艺店 3 n
+园里 161 s
+园长 22 n
+园陵 3 n
+园领杉 3 n
+囮 4 zg
+困 1425 v
+困乏 116 an
+困于 3 v
+困人 3 n
+困住 3 v
+困倦 118 a
+困倦起来 3 v
+困兽 3 n
+困兽之斗 3 i
+困兽犹斗 15 i
+困厄 38 an
+困围 3 n
+困境 1017 n
+困处 5 n
+困守 53 v
+困局 27 n
+困心衡虑 3 i
+困惑 537 a
+困惑不解 3 l
+困惑混乱 3 i
+困惫 5 a
+困扰 669 v
+困油 3 n
+困知勉行 3 vn
+困穷 5 an
+困窘 38 a
+困竭 3 v
+困累 3 v
+困而不学 3 l
+困而学之 3 l
+困苦 166 an
+困觉 6 n
+困迫 3 a
+困阨 3 v
+困难 7599 an
+困难严重 3 i
+困难性 3 n
+困难户 46 l
+困难生 4 l
+困难群众 3 l
+困难者 10 n
+困难职工 3 l
+困难重重 57 l
+困顿 82 v
+困顿不堪 3 l
+困魔咒 3 v
+囱 24 x
+围 4010 v
+围上 3 v
+围上去 3 v
+围上来 3 v
+围下 3 v
+围下去 3 v
+围下来 3 v
+围产 2 v
+围产期 3 n
+围住 444 v
+围兜 2 n
+围兜兜 3 n
+围兜起来 3 l
+围击 3 v
+围剿 854 v
+围包 3 v
+围嘴 3 v
+围困 427 v
+围困战 10 v
+围地 3 n
+围场 36 n
+围场县 3 n
+围场满族蒙古族自治县 3 ns
+围场路 3 n
+围坐 115 v
+围坐在 3 l
+围坐着 3 l
+围垦 53 v
+围垦地 3 n
+围城 276 n
+围城打援 2 i
+围堤 18 n
+围堰 138 n
+围堵 44 v
+围墙 1346 n
+围子 22 n
+围屋 14 n
+围屏 25 n
+围岩 74 n
+围巾 103 n
+围得 3 v
+围成 3 v
+围打 3 v
+围抢 2 v
+围护 32 v
+围护结构 3 n
+围拢 93 v
+围拢过来 3 l
+围挡 3 v
+围捕 25 v
+围擒 3 v
+围攻 993 v
+围攻战 3 n
+围栅 3 n
+围标 3 n
+围栏 169 n
+围桌 7 n
+围棋 473 v
+围棋子 16 n
+围棋比赛 3 n
+围棋王 2 n
+围棋界 3 n
+围棋网 3 i
+围棋赛 26 n
+围棋队 5 n
+围椿 3 n
+围模蜡 3 v
+围歼 145 v
+围殴 3 v
+围海造地 3 n
+围湖造田 9 n
+围炉 3 n
+围点打援 6 v
+围猎 62 v
+围田 3 n
+围甲 29 n
+围界 3 n
+围盘 3 v
+围看 3 v
+围看着 3 l
+围着 618 v
+围砌 3 v
+围绕 2065 v
+围绳 3 n
+围网 15 v
+围网渔业 3 n
+围而不打 3 i
+围聚 8 v
+围脖 8 n
+围脖儿 3 n
+围腰布 3 v
+围裙 120 n
+围裙带 3 vn
+围裹 20 n
+围观 237 n
+围观者 32 n
+围视 3 v
+围起 3 v
+围起来 3 v
+围过去 3 v
+围过来 3 l
+围追 184 v
+围追堵截 3 n
+围隔 3 v
+围靠 3 v
+围靠在 3 v
+围魏救赵 25 i
+囵 2 x
+囷 146 zg
+囹 2 n
+囹圄 19 n
+固 1724 j
+固不可彻 3 v
+固为 3 c
+固习 3 v
+固于 3 c
+固件 3 n
+固位 3 n
+固位体 3 n
+固位形 3 n
+固位指 3 n
+固体 1313 a
+固体化 3 l
+固体声 3 l
+固体废弃物 4 l
+固体废物 33 l
+固体潮 16 n
+固体燃料 38 l
+固体物理 3 l
+固体电路 3 l
+固体蛇 3 l
+固体酒精 3 l
+固化 88 v
+固化剂 13 n
+固原 62 ns
+固原县 18 ns
+固原地区 7 ns
+固原市 4 ns
+固城 266 ns
+固墙镇 2 n
+固壁清野 3 i
+固如 3 c
+固始 22 a
+固始县 3 ns
+固守 309 a
+固守岗位 3 n
+固守成法 3 l
+固安 11 a
+固安县 2 ns
+固定 3844 a
+固定不动 3 l
+固定价格 3 l
+固定债务 3 n
+固定值 3 l
+固定化 37 l
+固定器 6 l
+固定字长 4 l
+固定岗 2 ns
+固定床 3 n
+固定座位 3 n
+固定式 73 l
+固定性 18 n
+固定成本 3 l
+固定指标 3 l
+固定收入 3 l
+固定术 5 l
+固定架 4 n
+固定桥 3 l
+固定模型 3 n
+固定汇率 27 n
+固定汇率制 4 l
+固定沙丘 3 ns
+固定点 21 n
+固定物 3 l
+固定班次 3 l
+固定码率 3 n
+固定窗 3 n
+固定翼 3 n
+固定脂 3 l
+固定装置 3 n
+固定设备 3 n
+固定设置 4 n
+固定资产 1148 l
+固定资本 3 l
+固定资金 2 l
+固定量 3 l
+固定额 3 n
+固定首字 3 l
+固实 3 a
+固实压缩 3 l
+固实模式 3 l
+固山 3 ns
+固形物 5 l
+固态 185 n
+固态复萌 3 i
+固执 408 a
+固执己见 26 i
+固执已见 3 l
+固执成见 3 l
+固控指数 3 nz
+固无 3 v
+固有 625 b
+固有分泌 3 n
+固有性 3 l
+固有文化 3 l
+固有特征 2 n
+固有质量 3 l
+固有长度 3 l
+固有频率 3 n
+固本 15 a
+固步自封 25 l
+固氮 67 n
+固氮作用 3 n
+固氮菌 22 n
+固氮菌属 3 n
+固氮酶 9 n
+固沙 32 ns
+固沙林 4 ns
+固溶体 3 n
+固然 1632 c
+固然会 3 l
+固特异 2 l
+固疾 3 n
+固瘤 3 n
+固相侵入 3 l
+固相聚合 3 l
+固着 123 c
+固砂技术 3 n
+固砂树脂 3 n
+固红 3 b
+固结 64 a
+固绿 3 b
+固色剂 3 n
+固若金汤 19 l
+固著 3 a
+固辞 15 n
+固醇 15 n
+固镇 6 ns
+固镇县 3 ns
+固阳 6 ns
+固阳县 4 ns
+固陋 3 a
+固顶 3 n
+国 29996 n
+国一 3 nz
+国一上 3 l
+国一生 3 nr
+国一配 3 nz
+国丈 3 n
+国三 3 nz
+国三上 3 t
+国三下 3 t
+国三生 3 nr
+国与国 3 nt
+国世子 6 nz
+国世平 6 nz
+国东夷 2 nr
+国丞相 7 nr
+国丧 3 vn
+国中 3 s
+国中生 3 nr
+国中网 3 nt
+国中罕 3 nr
+国中青 4 nr
+国为君 3 nr
+国主 3 n
+国之力 3 n
+国之君 20 nr
+国之基 2 nr
+国之士 32 nr
+国之威 2 nr
+国之宝 5 nr
+国之干城 3 nr
+国之恩 2 nr
+国之政 3 nr
+国之臣 5 nr
+国之航 2 nr
+国乐 21 n
+国乐团 3 nt
+国乐家 3 n
+国乐社 3 nt
+国九条 3 nz
+国书 61 n
+国争光 9 n
+国事 317 n
+国事犯 3 n
+国事访问 125 n
+国二 3 nz
+国二上 3 t
+国二下 3 t
+国二生 3 nz
+国于民 4 nr
+国亡 3 n
+国亡身死 3 i
+国交 13 n
+国产 773 n
+国产化 77 n
+国产化率 2 n
+国产品牌 3 n
+国产商品 2 n
+国产奔驰 3 nr
+国产手机 3 n
+国产机 3 n
+国产棉 3 n
+国产汽车 3 nt
+国产片 3 n
+国产电影 3 n
+国产货 5 n
+国产车 2 n
+国产软件 3 l
+国产轿车 3 n
+国人 610 n
+国仁代 3 nr
+国仁父 4 nr
+国仁王 2 nr
+国仇 3 n
+国仇家恨 5 i
+国代 3 n
+国代选举 3 l
+国以民为本 3 l
+国企 341 j
+国企改革 3 j
+国企股 3 n
+国优 5 b
+国会 1447 n
+国会制 3 n
+国会山 8 n
+国会议员 3 n
+国体 68 n
+国何益 2 n
+国作金 3 n
+国侨办 3 nt
+国信 53 nz
+国信办 3 nt
+国信证券有限责任公司 9 nt
+国信通信 3 nt
+国债 405 n
+国债券 24 n
+国债资金 3 n
+国储局 3 nt
+国储铜 8 n
+国兀颜 3 nr
+国光 51 n
+国光号 3 n
+国光社 3 nt
+国八条 3 n
+国公 3 n
+国公府 8 nt
+国公景 3 n
+国公沐 2 nr
+国公爷 8 n
+国共 778 j
+国共两党 3 nt
+国共合作 559 n
+国兴 10 b
+国兴兵 4 nr
+国典 4 n
+国内 12450 s
+国内外 1889 s
+国内安全 3 nz
+国内定价 3 n
+国内形势 3 n
+国内战争 3 nz
+国内新闻 3 nz
+国内机票 3 n
+国内汽车 3 nt
+国内法 84 n
+国内游 3 n
+国内航线 3 n
+国内贸易 3 nz
+国内迁移 3 n
+国内部 15 nt
+国内长途 3 n
+国内革命战争 42 nz
+国内首创 3 nz
+国军 209 n
+国军之 2 nr
+国军战 3 nz
+国军退除 3 i
+国凤仙 2 nr
+国分 8 n
+国利 11 n
+国利民 2 n
+国利病 4 n
+国别 176 n
+国别史 7 n
+国剑士 7 nr
+国剧 3 n
+国剧团 3 nt
+国剧社 3 nt
+国力 373 n
+国力队 4 nt
+国办 16 j
+国办发 3 j
+国务 590 n
+国务会议 3 nt
+国务卿 411 n
+国务委员 1495 n
+国务委员会 7 nt
+国务总理 3 n
+国务秘书 3 n
+国务部长 18 n
+国务院 15768 nt
+国务院令 261 n
+国务院办公厅 75 nt
+国务院参事 5 nt
+国务院发展研究中心 27 nt
+国务院台办 5 nt
+国务院台湾事务办公室 5 nt
+国务院外事办公室 5 nt
+国务院学位办 3 nt
+国务院学位委员会 47 nt
+国务院学位委员会学科评议组 3 nt
+国务院扶贫办 2 nt
+国务院新闻办 19 nt
+国务院新闻办公室 37 nt
+国务院法制办 7 nt
+国务院研究室 28 nt
+国务院纠风办 16 v
+国务院西部开发办 3 nt
+国势 253 n
+国医 8 n
+国医治 3 nz
+国华 6 nz
+国华人寿 3 n
+国协 4 j
+国卫民 3 n
+国历 3 n
+国厚恩 7 nr
+国发 7 nt
+国变 3 nz
+国台办 103 j
+国史 143 n
+国史大纲 3 nr
+国史馆 23 nt
+国号 401 n
+国合 10 vn
+国同休 2 nr
+国名 218 n
+国后岛 2 n
+国向武 3 nr
+国君 190 n
+国吴宝 3 nz
+国吴析 2 nz
+国吴黄 8 nr
+国周郎 2 n
+国命 3 nz
+国商 44 n
+国嘉 4 nz
+国四 3 nz
+国四班 3 nz
+国园 3 n
+国国民 2 n
+国图 7 n
+国土 2101 n
+国土厅 2 nt
+国土局 15 nt
+国土开发 3 nt
+国土报 12 nt
+国土整治 3 n
+国土规划 3 n
+国土资源 3 n
+国土资源厅 10 nt
+国土资源部 23 nt
+国土面积 3 n
+国在华 2 nr
+国地税 3 j
+国城 2 n
+国基 3 nz
+国基永 2 nr
+国境 214 n
+国境疆土 3 n
+国境线 44 n
+国增光 2 nr
+国士 16 n
+国士之 2 nr
+国士无双 3 nr
+国士相 2 nr
+国外 3852 s
+国外同类 4 n
+国外品牌 3 n
+国外市场 3 n
+国外经验 3 n
+国外贸易 3 l
+国外软件 3 l
+国大 114 j
+国大代表 3 nz
+国大党 217 nt
+国天惠 2 nr
+国天益 2 nr
+国太平 3 nr
+国奉圣 2 nr
+国奉贡 2 nr
+国奥 90 nz
+国奥队 132 nt
+国姓 141 n
+国姓爷 3 nr
+国威 49 n
+国子 18 n
+国子学 14 n
+国子寺 2 nr
+国子生 3 nr
+国子监 180 nr
+国字 3 n
+国字号 33 n
+国孙吴 7 nr
+国孝家 2 nr
+国学 97 n
+国学常识 3 n
+国学社 3 nt
+国学网 3 n
+国宅 2 n
+国宅会 3 n
+国宅处 3 n
+国安 390 nz
+国安会 3 nt
+国安俱乐部 10 nt
+国安局 3 nt
+国安法 3 n
+国安队 124 nt
+国定 18 n
+国定假日 3 l
+国宝 358 nz
+国宝展 3 nr
+国宝级 21 n
+国宣劳 3 nr
+国宴 27 n
+国家 79520 n
+国家一级 16 b
+国家专利 4 l
+国家专利局 2 nt
+国家中医药管理局 13 nt
+国家主义 19 n
+国家主权 3 n
+国家乒乓球队 6 nt
+国家人事部 8 nt
+国家体委 95 nt
+国家体改委 3 nt
+国家体育总局 54 nt
+国家信息中心 13 nt
+国家信息产业部 5 nt
+国家信访局 4 nt
+国家元首 3 n
+国家公安部 6 nt
+国家兴亡 3 i
+国家决算 3 l
+国家劳动和社会保障部 7 nt
+国家劳动部 4 nt
+国家化 16 nt
+国家医药管理局 11 nt
+国家博物馆 564 nt
+国家卫生研究院 2 nt
+国家卫生部 13 nt
+国家发展计划委员会 27 nt
+国家发明奖 9 nz
+国家图书奖 6 nz
+国家图书馆 59 nt
+国家地震局 3 nt
+国家外国专家局 3 nt
+国家外汇 3 n
+国家外汇管理局 23 nt
+国家大剧院 137 nt
+国家奥林匹克体育中心 3 nt
+国家女篮 9 nt
+国家安全部 17 nt
+国家审计署 8 nt
+国家局 13 nt
+国家工商 3 nt
+国家工商局 3 nt
+国家工商行政管理局 7 nt
+国家广播 3 nz
+国家广电总局 35 nt
+国家建委 7 nt
+国家建设部 5 nt
+国家开发投资公司 2 nt
+国家开发行 4 nt
+国家开发银行 13 nt
+国家情报局 2 nt
+国家所有 62 i
+国家技术监督局 9 nt
+国家教委 156 nt
+国家教育委员会 4 nt
+国家教育部 62 nt
+国家文物局 58 nt
+国家文物鉴定委员会 2 nt
+国家旅游局 303 nt
+国家有关 34 nt
+国家机关 2356 nt
+国家机器 33 nz
+国家机密 3 n
+国家杜马 116 nz
+国家杰出青年基金 2 nz
+国家林业局 8 nt
+国家标准 114 n
+国家栋梁 7 nr
+国家档案局 9 nt
+国家档案馆 23 nt
+国家检察官学院 3 nt
+国家森林公园 808 nt
+国家歌剧 3 n
+国家民委 11 nt
+国家民族事务委员会 6 nt
+国家民航总局 6 nt
+国家气象中心 3 nt
+国家法官学院 4 nt
+国家测绘局 5 nt
+国家海洋局 28 nt
+国家火炬 3 i
+国家火炬计划 3 nz
+国家烟草 3 n
+国家烟草专卖局 2 nt
+国家煤矿安全监察局 7 nt
+国家版权局 23 nt
+国家环保局 43 nt
+国家环保总局 10 nt
+国家环境保护总局 3 nt
+国家电网 3 nz
+国家知识产权局 27 nt
+国家禁毒委员会 2 n
+国家科委 65 nt
+国家科学技术委员会 2 nt
+国家科技进步奖 16 nz
+国家科技部 14 nt
+国家税务 3 n
+国家税务局 3 nt
+国家税务总局 43 nt
+国家税收 2 n
+国家级 3374 b
+国家经委 7 nt
+国家经济体制改革委员会 3 nt
+国家经济贸易委员会 3 nt
+国家经贸委 69 nt
+国家统计局 86 nt
+国家羽毛球队 6 nt
+国家股 41 n
+国家能源委员会 2 nt
+国家能源部 2 nt
+国家自然科学基金 10 nt
+国家自然科学基金委员会 5 nt
+国家自然科学奖 55 nz
+国家至上 3 l
+国家航天局 2 nt
+国家航空航天局 3 nt
+国家药品监督管理局 4 nt
+国家药监局 72 nt
+国家行政学院 55 nt
+国家补贴 3 n
+国家裁判 3 n
+国家计划 598 n
+国家计划委员会 23 nt
+国家计划生育委员会 9 nt
+国家计委 61 nt
+国家计生委 3 nt
+国家认可委员会 4 nt
+国家语委 8 nt
+国家财政部 13 nt
+国家赔偿 3 nz
+国家足球队 7 nt
+国家邮政局 3 nt
+国家银行 58 nt
+国家队 490 nt
+国家队教练组 5 n
+国家集训队 14 nt
+国家青年队 2 nt
+国家食品质量监督检验中心 2 nt
+国家验收 3 n
+国宾 273 n
+国宾戏院 3 nt
+国宾酒店 3 nt
+国宾饭店 3 n
+国宾馆 17 nt
+国富 9 nz
+国富兵强 3 nr
+国富民丰 3 nz
+国富民安 3 nz
+国富民强 13 nt
+国富论 16 n
+国寿录 3 nr
+国将不国 5 n
+国尉 3 n
+国小 3 j
+国小王子 2 nr
+国少队 17 nt
+国尔忘家 3 n
+国尽忠 4 nr
+国尽节 6 l
+国展 3 vn
+国币 3 n
+国师 1214 n
+国师举 2 nr
+国师久 2 nr
+国师刚 3 nr
+国师叹 2 nr
+国师宗 3 nr
+国师心 2 nt
+国师必 2 nr
+国师正 3 nr
+国师笑 4 nr
+国师若 2 nr
+国师连 2 nr
+国师金 6 n
+国师铁 5 nr
+国师银 2 nr
+国帑 3 n
+国广一叶 3 nz
+国庆 131 t
+国庆大典 3 nz
+国庆日 140 t
+国庆节 348 t
+国库 409 n
+国库券 40 nt
+国库卷 3 n
+国库库印 3 nr
+国府 13 n
+国度 129 n
+国建 3 nt
+国建学术 3 n
+国建计划 3 n
+国开行 3 nt
+国弘化 2 nr
+国强 3 n
+国强民富 3 nz
+国彰德 2 nr
+国徐整 2 nr
+国徽 1170 n
+国忠代 2 nr
+国忠少 2 nr
+国恨家仇 3 l
+国情 1049 n
+国情咨文 3 nz
+国情教育 3 l
+国惜才 2 nr
+国成汉 2 nz
+国戚 15 n
+国房 3 n
+国房网 3 n
+国手 61 n
+国投 40 j
+国政 252 n
+国故 16 n
+国敌 3 n
+国教 144 nz
+国教司 3 nt
+国教派 3 n
+国文 86 nz
+国文人 2 n
+国文科 3 nr
+国文臣 5 nr
+国文课 3 n
+国新办 3 j
+国旅 177 j
+国旅总社 31 nt
+国旗 1144 n
+国旗护卫队 62 nt
+国旗歌 3 nr
+国旗法 3 nr
+国旗班 159 nz
+国无二君 3 nz
+国无君 2 nr
+国无宁日 9 nz
+国是 3 n
+国是会议 3 l
+国曹魏 5 nr
+国有 3482 b
+国有产权 3 n
+国有企业 3 n
+国有制 9 n
+国有化 121 n
+国有国法 3 n
+国有土地 3 n
+国有政策 3 n
+国有经济 3 n
+国有股 90 n
+国有财产 3 l
+国有资产 3 n
+国有资产管理局 7 nt
+国有资本 3 l
+国有银行 3 nt
+国朝 3 t
+国朝中 2 nr
+国朝文 4 nr
+国朝诗 4 nr
+国本 40 n
+国术 14 n
+国术团 3 nt
+国术社 3 nt
+国权 14 n
+国权臣 3 n
+国林 3 nz
+国林风 3 nr
+国柄 3 n
+国柱 2 n
+国标 43 n
+国标码 3 n
+国标舞 6 n
+国树 4 n
+国校 3 n
+国格 6 n
+国棉 8 n
+国槐 8 n
+国欢庆 2 nr
+国歌 160 n
+国歌声 25 n
+国步 3 n
+国步维 2 nz
+国步艰难 3 l
+国殇 17 n
+国母 22 n
+国民 3939 n
+国民中学 3 nt
+国民之声 4 n
+国民之声党 4 n
+国民会议 3 nt
+国民住宅 3 n
+国民党 9949 nt
+国民党中央 373 nt
+国民党中央委员会 9 nt
+国民党中常委 4 nt
+国民党员 3 n
+国民兵 3 n
+国民军 166 nt
+国民外交 3 n
+国民大会 3 nt
+国民学校 3 nt
+国民小学 3 nt
+国民平均 3 j
+国民待遇 3 n
+国民性 44 n
+国民所得 3 l
+国民报 3 nt
+国民收入 253 n
+国民政府 1359 nt
+国民政府军事委员会 59 nt
+国民教育 2 l
+国民生产 3 n
+国民素质 3 n
+国民经济 4137 n
+国民警卫 3 n
+国民议会 3 nt
+国民身分 3 l
+国民革命 3 nz
+国民革命军 1068 nt
+国民革命军第八路军 42 nt
+国法 104 n
+国法难容 3 n
+国泰 76 nz
+国泰产物 3 nt
+国泰人寿 3 nz
+国泰公司 3 nt
+国泰医院 3 nt
+国泰君安 3 nz
+国泰君安证券股份有限公司 12 nt
+国泰民安 178 nz
+国泰电影院 2 nt
+国泰综合 3 i
+国泰航空公司 2 nt
+国洪起 3 nr
+国浩罕 2 nr
+国海军 8 nt
+国清寺 31 nr
+国父 151 n
+国父思想 3 n
+国父纪念 3 n
+国父遗嘱 3 n
+国片 3 n
+国片商 3 nz
+国片展 3 nt
+国特 3 nz
+国特局 3 nt
+国王 3312 n
+国王发狂 3 nz
+国王杯 3 nz
+国王队 3 nt
+国玺 15 n
+国球 5 n
+国理民 2 n
+国用 3 n
+国电 13 j
+国电电力 6 nz
+国画 92 n
+国画家 4 n
+国画系 3 n
+国画院 3 nt
+国界 208 n
+国界线 13 nz
+国盛 2 nz
+国相 4 n
+国相印 3 nr
+国相邦 2 nr
+国省道 3 n
+国破君 2 nr
+国破家亡 46 i
+国礼 8 n
+国社党 3 nt
+国秀集 2 nr
+国科会 4 nt
+国税 21 n
+国税函 3 n
+国税发 3 j
+国税局 56 nt
+国立 597 b
+国立中央 3 nt
+国立功 2 nr
+国立大学 3 nt
+国立艺专 3 nt
+国策 163 n
+国策顾问 3 n
+国籍 471 n
+国籍法 20 n
+国粹 49 n
+国统 45 n
+国统会 61 nt
+国统军 3 nt
+国统区 27 nt
+国统矿 3 n
+国网公司 8 nt
+国美 285 nz
+国美安 2 nz
+国美苏 2 nr
+国者 26 n
+国而忘家 3 l
+国耶律 2 nr
+国耻 178 n
+国耻日 3 n
+国联 173 nz
+国联军 6 nt
+国联安 3 nz
+国肖太后 2 nr
+国胜 2 n
+国能 22 n
+国脉 5 n
+国脉杯 4 nz
+国脚 36 n
+国腿 3 n
+国舅 63 n
+国航 106 j
+国航局 3 nt
+国色 10 n
+国色天姿 3 n
+国色天香 16 n
+国花 26 n
+国芳百 2 nr
+国药 91 n
+国药准字 3 nz
+国菜 4 n
+国营 516 n
+国营事业 3 n
+国营企业 172 n
+国营农场 3 n
+国营商业 3 n
+国营经济 3 n
+国葬 8 n
+国藩丁 3 nr
+国藩坚 2 nr
+国藩襄 2 nr
+国虹 3 nz
+国蜀汉 8 nr
+国计 3 n
+国计民生 141 n
+国议会 4 nt
+国语 304 nz
+国语专辑 3 l
+国语剧 3 n
+国语文 3 n
+国语日报 3 nz
+国语歌 3 n
+国语版 3 n
+国语科 3 n
+国语罗马 3 nz
+国语课 3 n
+国诸臣 2 nr
+国谯郡 4 nr
+国货 20 n
+国货国运 3 nt
+国贸 39 j
+国贸局 3 nt
+国贸科 3 nz
+国贸系 3 nt
+国贼 293 n
+国资 46 vn
+国资办 3 n
+国资委 151 nt
+国资局 4 nt
+国赔 3 vn
+国足 2 nt
+国轮 3 n
+国轮国造 3 n
+国辱 3 n
+国边防 3 n
+国运 98 n
+国运昌隆 3 nz
+国道 445 n
+国野 2 n
+国铁 6 n
+国镇南 7 nr
+国门 437 n
+国闻 6 n
+国防 3728 n
+国防军 98 nt
+国防力量 3 n
+国防医学 3 nt
+国防大学 75 nt
+国防委员 3 n
+国防委员会 1142 nt
+国防工业 3 nt
+国防建设 3 l
+国防报 11 nt
+国防教育 3 l
+国防法 12 n
+国防生 3 n
+国防科 3 n
+国防科委 5 nt
+国防科学技术大学 4 nt
+国防科学技术工业委员会 17 nt
+国防科工办 2 nt
+国防科工委 86 nt
+国防科技 3 nt
+国防科技大学 9 nt
+国防管理 3 n
+国防绿 3 n
+国防观 3 n
+国防论 3 n
+国防费 101 n
+国防部 1306 nt
+国防部外事办公室 4 nt
+国防部长 825 n
+国防部门 6 n
+国际 24601 n
+国际业余田径联合会 12 nt
+国际主义 92 n
+国际主义者 3 n
+国际乒联 9 nt
+国际争端 3 n
+国际事务 3 n
+国际互借 3 i
+国际互联网络 4 n
+国际交往 3 l
+国际交流 14 n
+国际会计 3 nz
+国际会议中心 30 nt
+国际公制 3 n
+国际公法 21 n
+国际公约 3 n
+国际共产主义运动 62 nz
+国际共管 6 nz
+国际共运 41 nt
+国际关系学院 25 nt
+国际刑警 3 n
+国际刑警组织 8 nt
+国际制裁 3 n
+国际前列 3 n
+国际劳工局 7 nt
+国际劳工组织 26 nt
+国际化 689 nt
+国际协会 3 nt
+国际博览 3 n
+国际卫生组织 2 nt
+国际原子能机构 55 n
+国际原油 3 nt
+国际友人 3 nz
+国际台 9 nt
+国际合作部 2 nt
+国际周 10 n
+国际品牌 3 n
+国际商专 3 nt
+国际商业机器公司 17 nt
+国际商会 9 nt
+国际商用机器公司 2 nt
+国际商贸 3 nt
+国际型 8 n
+国际域名 3 n
+国际大坝委员会 2 nt
+国际天文学联合会 17 nt
+国际奖 17 nz
+国际奥委会 86 nt
+国际奥委会执委会 3 nt
+国际奥林匹克委员会 22 nt
+国际妇女节 3 nt
+国际威望 3 n
+国际学舍 3 n
+国际宇航科学院 5 nt
+国际射箭联合会 2 nt
+国际射联 3 nt
+国际小行星中心 2 nt
+国际局 21 nt
+国际局势 3 n
+国际展览 3 n
+国际展览中心 4 l
+国际帝国 3 nt
+国际广播电台 38 nt
+国际形势 3 n
+国际形象 3 n
+国际性 253 n
+国际惯例 3 n
+国际护士节 2 n
+国际排总 3 j
+国际排联 2 nt
+国际收支 3 n
+国际数学联盟 3 nt
+国际数据公司 2 n
+国际文传电讯社 4 nt
+国际文教 3 nz
+国际日期变更线 26 nz
+国际时装 3 nz
+国际服装 3 n
+国际服饰 3 n
+国际期货 3 nt
+国际机场 3 n
+国际标准 34 n
+国际标准化组织 29 nt
+国际检疫 3 n
+国际棋联 3 nt
+国际歌 4 n
+国际水域 3 n
+国际汽联 3 nt
+国际法 403 n
+国际法庭 18 nt
+国际法院 3 nt
+国际泳联 19 nt
+国际海事卫星组织 8 nt
+国际海事组织 8 nt
+国际清算银行 4 nt
+国际漫游 3 n
+国际版 3 n
+国际特赦 3 l
+国际玉米小麦改良中心 2 i
+国际田联 38 nt
+国际电信 5 nt
+国际电信联盟 10 nt
+国际电工委员会 12 nt
+国际电联 7 nt
+国际石油 3 nt
+国际禁毒日 2 nz
+国际私法 104 n
+国际私法学 2 l
+国际竞争 3 l
+国际米兰 3 nz
+国际红十字会 10 nt
+国际级 25 n
+国际纵横 3 l
+国际纵队 15 nt
+国际经济组织 2 nt
+国际经贸 3 nt
+国际网联 7 nt
+国际羽联 138 nt
+国际联盟 64 nt
+国际联运 3 nt
+国际背景 3 n
+国际能源机构 3 nt
+国际舆论 3 l
+国际舞台 3 nt
+国际航班 3 nz
+国际航空 3 nt
+国际航空公司 9 nt
+国际航运 3 nt
+国际裁判 3 n
+国际要闻 3 n
+国际观 3 n
+国际象棋 128 n
+国际象棋队 5 nt
+国际货币基金 4 nt
+国际货币基金组织 227 nt
+国际货物 3 nt
+国际贷款 3 n
+国际贸易 3 nz
+国际贸易中心 8 nt
+国际足坛 3 n
+国际足球 3 n
+国际足联 68 nt
+国际轨道 3 n
+国际部 28 nt
+国际都市 3 n
+国际金融 3 n
+国际金融公司 9 nt
+国际金融报 7 nt
+国际金融组织 3 nt
+国际钢铁 3 nz
+国际铝卡 3 nz
+国际队 246 nt
+国际音标 12 n
+国际风云 3 nz
+国际饭店 7 n
+国陆军 4 nt
+国难 81 n
+国难当头 36 l
+国难方殷 3 nr
+国难日 3 n
+国难财 3 l
+国雄 3 n
+国青男 2 nr
+国青队 51 nt
+国音 8 n
+国风 26 n
+国马钧 4 nr
+国骂 5 vn
+国魂 10 n
+国魏 8 t
+国魏孙 2 nr
+国魏曹 3 nr
+国鸟 2 n
+国鼎立 2 nr
+国龙亢 2 nr
+图 12112 n
+图下方 3 n
+图丹 256 ns
+图丹却吉尼玛 2 nz
+图书 1186 n
+图书中心 3 n
+图书交换 3 i
+图书卡 3 n
+图书周转 3 n
+图书城 15 n
+图书大厦 3 n
+图书奖 12 n
+图书室 45 n
+图书市场 3 n
+图书库 3 n
+图书店 3 n
+图书架 3 n
+图书消毒 3 n
+图书目录 3 n
+图书站 18 n
+图书管 3 n
+图书网 3 n
+图书费 3 n
+图书资料 3 n
+图书超市 3 ns
+图书馆 1551 n
+图书馆员 6 n
+图书馆学 124 n
+图书馆长 3 n
+图亚 4 nrt
+图仪 7 n
+图们 17 n
+图们市 9 ns
+图们江 45 ns
+图件 17 n
+图位 3 n
+图作不轨 3 i
+图例 3 n
+图例查询 3 n
+图像 1093 n
+图像匹配 2 nz
+图像压缩 7 l
+图像去噪 3 i
+图像增强 5 n
+图像处理 31 n
+图像复原 5 n
+图像文件 3 n
+图像格式 3 n
+图像编码 2 n
+图像编辑 3 n
+图像识别 3 n
+图像资料 3 n
+图儿 2 n
+图元 5 n
+图克 61 nrt
+图克斯伯里 3 nrt
+图兰 21 ns
+图兰多 3 nrt
+图兰朵 8 n
+图典 3 n
+图册 1957 n
+图列 3 n
+图利 6 n
+图利他人 3 n
+图勒 7 nrt
+图卜鲁格 10 nrt
+图卢 3 nrt
+图卢兹 34 nrt
+图卷 10 n
+图右 3 n
+图同构 3 n
+图名 5 n
+图名图利 3 n
+图图 2 n
+图块 3 n
+图坦 27 nrt
+图坦哈蒙 8 nrt
+图塔 43 nrt
+图存 3 n
+图季曼 5 nrt
+图宾 4 nrt
+图尔 71 nrt
+图尔克 3 nrt
+图尔卡纳 3 nrt
+图尔卡纳湖 5 ns
+图尔布青 3 nrt
+图尔库 9 nrt
+图尔斯 2 nrt
+图尔盖 2 nrt
+图层 3 n
+图左 3 nrt
+图巴 56 nrt
+图布人 3 nrt
+图库 1272 n
+图式 49 n
+图式理论 3 n
+图强 61 n
+图录 27 n
+图形 903 n
+图形保真 3 l
+图形化 3 n
+图形卡 3 n
+图形后效 3 l
+图形图像 3 n
+图形图表 2 n
+图形处理 11 l
+图形学 3 n
+图形工作站 9 n
+图形库 3 n
+图形控制 3 n
+图形操作 3 l
+图形文件 3 n
+图形核心 3 n
+图形用户界面 10 n
+图形界面 3 n
+图形畸变 3 i
+图形符号 8 n
+图形系统 4 l
+图形菜单 3 n
+图形适配器 2 n
+图恩 5 nrt
+图报 28 n
+图拉 76 nrt
+图拉丁 3 nrt
+图拉吉 2 nrt
+图拉姆 2 nrt
+图拉河 6 ns
+图文 88 n
+图文并茂 24 l
+图文本 3 n
+图文混排 3 n
+图文集 3 n
+图斯 87 nrt
+图普 3 nrt
+图景 57 n
+图曼斯基 3 nrt
+图板 9 n
+图林根 15 ns
+图标 40 n
+图标工具 3 n
+图标库 3 n
+图样 162 n
+图格里克 4 nrt
+图框 3 n
+图案 2643 n
+图案化 9 n
+图案画 3 n
+图案矮篱 3 n
+图案色 3 n
+图档 3 n
+图档室 3 v
+图森 8 nrt
+图法 16 n
+图法赫 2 nrt
+图波列夫 3 nrt
+图海道 3 n
+图灵 32 n
+图灵奖 3 n
+图灵机 54 n
+图片 6689 n
+图片下载 3 n
+图片吧 3 n
+图片壁纸 3 n
+图片大小 3 n
+图片尺寸 3 n
+图片展 15 nz
+图片展览 3 n
+图片库 8 n
+图片格式 3 nz
+图片社 8 n
+图片站 3 n
+图片素材 3 n
+图片网 3 n
+图片说明 3 n
+图片铃声 3 n
+图片链接 3 l
+图片附件 3 n
+图片集 3 n
+图版 9 n
+图瓦 44 nrt
+图瓦卢 59 nrt
+图瓦鲁 3 nrt
+图画 449 n
+图画书 3 n
+图画册 3 n
+图画文字 18 n
+图画纸 3 n
+图画课 2 n
+图示 35 n
+图稿 2 n
+图穷匕现 3 i
+图穷匕见 6 i
+图章 41 n
+图符 3 n
+图籍 24 n
+图纸 401 n
+图纸文件 3 n
+图纹 12 n
+图线 3 n
+图腾 218 n
+图腾崇拜 3 nr
+图蒂 2 nrt
+图表 204 n
+图表法 3 n
+图表说明 3 n
+图西 11 nrt
+图西族 4 n
+图解 71 n
+图解法 9 n
+图记 4 n
+图论 3 n
+图说 55 n
+图谋 568 n
+图谋不轨 44 i
+图谱 111 n
+图象 39 n
+图象合成 3 n
+图象增强 3 nr
+图象处理 3 n
+图象复合 3 n
+图象模拟 3 i
+图象识别 3 n
+图象重叠 3 l
+图财害命 3 i
+图道多吉 256 ns
+图释 2 n
+图里 22 nrt
+图鉴 7 n
+图钉 18 n
+图锥体 3 n
+图集 95 n
+图雷 3 nrt
+图雷斯基 4 nrt
+图面 3 n
+囿 114 vg
+囿于 5 v
+囿于一时 3 v
+囿于成见 3 v
+圃 287 ng
+圆 3841 n
+圆丘 3 n
+圆业 3 n
+圆乎乎 3 z
+圆二色性 3 n
+圆体 3 n
+圆光 3 n
+圆全 3 a
+圆凳 9 n
+圆凿 3 a
+圆台 5 n
+圆台面 3 n
+圆号 25 n
+圆周 80 t
+圆周率 122 n
+圆周角 3 n
+圆周运动 34 l
+圆圆 620 n
+圆圆满满 3 z
+圆圆的 203 z
+圆圆胖胖 3 z
+圆圈 414 n
+圆圈式 3 l
+圆场 35 n
+圆坟 3 n
+圆墩 3 n
+圆头 18 n
+圆子 28 n
+圆孔 53 n
+圆孔方木 3 n
+圆实 3 n
+圆寂 116 a
+圆屋顶 3 n
+圆山 39 ns
+圆帽 7 n
+圆底线脚 3 n
+圆度仪 3 nz
+圆弧 59 n
+圆弧底 3 n
+圆弧形 15 n
+圆弧法 3 n
+圆弧状 4 nz
+圆弧规 3 n
+圆形 1003 n
+圆形动物 2 l
+圆形槽 3 n
+圆形波导 3 n
+圆径 3 n
+圆心 64 n
+圆心角 3 n
+圆成 3 v
+圆房 9 n
+圆扫描 3 n
+圆括号 20 n
+圆攒尖 3 l
+圆整 2 a
+圆明园 168 n
+圆明园遗址公园 5 ns
+圆月 42 t
+圆木 70 n
+圆木椿 3 nr
+圆木警枕 3 l
+圆材 3 n
+圆板状 3 n
+圆极化 3 n
+圆柱 667 n
+圆柱体 55 n
+圆柱型 3 n
+圆柱形 166 n
+圆柱投影 3 n
+圆柱状 3 n
+圆柱面 19 n
+圆柱齿轮 3 n
+圆桌 83 n
+圆桌会议 29 n
+圆桌武士 3 n
+圆桌面 5 n
+圆桶 3 n
+圆梦 22 n
+圆棒 2 n
+圆椎 3 n
+圆楼梯 3 n
+圆活 3 a
+圆浑 8 z
+圆涡 3 n
+圆润 103 n
+圆溜溜 13 z
+圆滑 75 a
+圆滚 3 z
+圆滚滚 22 z
+圆满 824 a
+圆满完成 3 l
+圆满成功 3 l
+圆满结束 3 n
+圆满解决 3 l
+圆澄 3 z
+圆点 39 n
+圆点花 3 n
+圆熟 18 a
+圆状 15 n
+圆环 58 n
+圆环一带 3 n
+圆环状 3 n
+圆珠 10 n
+圆珠笔 65 n
+圆珠笔芯 8 nz
+圆球 127 n
+圆球儿 3 n
+圆球形 3 n
+圆畅 3 a
+圆白菜 4 n
+圆盒 8 n
+圆盖 4 n
+圆盘 169 n
+圆盘代数 3 n
+圆盘式 3 n
+圆盘犁 3 ns
+圆盘耙 4 n
+圆盘衍射 3 nz
+圆真 3 a
+圆石 3 n
+圆碟 3 n
+圆窗 10 n
+圆笔 3 n
+圆笼 5 n
+圆筒 83 n
+圆筒形 100 n
+圆筒状 3 n
+圆筒筛 3 n
+圆管 8 n
+圆籽 3 n
+圆籽汤 3 n
+圆织机 3 n
+圆经 3 n
+圆脸 81 n
+圆舞曲 20 n
+圆融 15 n
+圆螺母 3 n
+圆规 23 n
+圆角 12 n
+圆谎 20 v
+圆跳动 3 l
+圆通 34 n
+圆通寺 3 n
+圆通山 3 ns
+圆金柑 3 n
+圆钉 3 n
+圆钢 2 n
+圆锉 2 n
+圆锥 120 n
+圆锥体 7 n
+圆锥台 3 n
+圆锥形 376 n
+圆锥曲线 48 l
+圆锥花序 112 l
+圆锥阵 3 l
+圆锯 2 n
+圆锯片 3 n
+圆锹 3 n
+圆雕 54 n
+圆面积 3 n
+圆音 3 n
+圆韵 3 n
+圆顶 109 n
+圆顶方趾 3 n
+圆顿 3 ns
+圆颅方趾 3 n
+圆领 55 n
+圆领衫 5 n
+圆饼 9 n
+圆鼓鼓 2 z
+圈 2645 q
+圈住 3 v
+圈儿 49 n
+圈养 36 n
+圈内 3 n
+圈内人 6 n
+圈占 3 v
+圈围 3 n
+圈圈 80 n
+圈圈点点 2 n
+圈地 160 n
+圈墙 3 n
+圈外 3 vn
+圈外人 3 n
+圈套 274 n
+圈子 947 n
+圈子里 3 n
+圈定 182 v
+圈层 45 n
+圈形 3 n
+圈形卡环 3 ns
+圈拢 3 v
+圈操 3 n
+圈梁 3 n
+圈椅 42 n
+圈点 30 n
+圈牛 3 n
+圈牢 3 n
+圈牢养物 3 n
+圈环 3 vn
+圈秩 3 nz
+圈羊 3 n
+圈肥 3 n
+圈舍 3 n
+圈起 3 v
+圈起来 3 v
+圈进 3 v
+圈选 3 v
+圈里 66 q
+圈里人 3 n
+圈钱 3 n
+圈闭 50 v
+圈闭容积 3 n
+圈阅 3 v
+圈马 3 ns
+圉 92 g
+圉限 3 nr
+圊 2 g
+國 10 zg
+圌 3 zg
+園 10 zg
+圓 2 zg
+圖 5 zg
+圗 12 zg
+團 2 zg
+圚 4 zg
+圜 220 zg
+圜丘 15 n
+圞 5 zg
+土 8560 zg
+土专家 6 l
+土丘 224 n
+土中木马 3 ns
+土井 11 n
+土产 75 n
+土人 119 n
+土人族 3 nz
+土付出 3 n
+土伦 25 ns
+土伦杯 146 nz
+土体 78 n
+土体蠕动 3 vn
+土俗 3 n
+土偶 3 n
+土偶蒙金 3 l
+土党参 3 n
+土八路 3 nz
+土冈 3 ns
+土制 9 n
+土制品 3 n
+土力学 3 n
+土办法 3 n
+土包 16 n
+土包子 16 n
+土匪 521 n
+土卫六 22 nz
+土台 25 n
+土台子 276 n
+土司 2172 n
+土司官寨 14 n
+土司面包 3 n
+土味 4 n
+土味十足 3 i
+土土 3 n
+土土气气 3 n
+土地 11240 n
+土地交易 3 n
+土地价格 3 n
+土地储备 3 n
+土地公 3 n
+土地出让 3 l
+土地分类 3 n
+土地分级 3 l
+土地划拨 3 v
+土地利用 3 ns
+土地刻面 3 n
+土地功能 3 n
+土地单元 3 ns
+土地国有 3 nz
+土地堂 3 ns
+土地增值 3 l
+土地婆 3 n
+土地局 7 n
+土地属性 3 n
+土地平整 3 l
+土地庙 71 ns
+土地开垦 3 nz
+土地批租 3 l
+土地改良 3 nz
+土地改革 291 l
+土地权 4 n
+土地权属 3 n
+土地法 34 n
+土地爷 12 n
+土地特性 3 n
+土地税 19 n
+土地管理法 13 n
+土地类型 3 n
+土地细分 3 n
+土地补偿 3 i
+土地要素 3 l
+土地规划 3 l
+土地证 6 j
+土地评价 3 n
+土地质量 3 n
+土地费 5 n
+土地重划 3 n
+土地银行 3 nt
+土地革命 530 nz
+土地革命战争 370 nz
+土坎 13 n
+土坑 361 n
+土块 303 n
+土坝 25 n
+土坡 94 ns
+土坪 3 ns
+土坯 90 n
+土坯墙 3 n
+土坯房 15 n
+土坷垃 14 n
+土埂 11 n
+土城 307 ns
+土城乡 3 ns
+土城子 140 n
+土城路 3 ns
+土堆 61 n
+土堡 3 ns
+土堤 6 n
+土堤仓 3 nr
+土墙 124 n
+土墩 30 n
+土壤 3360 n
+土壤侵蚀 3 nz
+土壤冻结 3 n
+土壤圈 3 n
+土壤处置 3 n
+土壤复区 3 n
+土壤学 39 n
+土壤学家 3 n
+土壤层 10 n
+土壤带 3 n
+土壤微生 3 n
+土壤排水 3 n
+土壤改良 3 nz
+土壤改良剂 4 nz
+土壤有机 3 n
+土壤条件 3 n
+土壤比重 3 i
+土壤气候 3 n
+土壤水 3 n
+土壤水分 3 n
+土壤污染 24 i
+土壤温度 3 n
+土壤湿度 3 n
+土壤溶液 3 n
+土壤特性 3 n
+土壤环境 3 n
+土壤生物 3 n
+土壤组合 3 n
+土壤细流 3 n
+土壤结构 3 n
+土壤结皮 3 n
+土壤耕性 3 n
+土壤肥力 3 n
+土壤胶体 3 n
+土壤腐蚀 3 nz
+土壤调查 3 n
+土壤质地 3 n
+土壤资源 3 n
+土壤退化 3 i
+土壤通气 3 n
+土壤酸度 3 n
+土壶 3 n
+土大黄 3 nz
+土头土脑 8 l
+土头土脸 3 l
+土宜 3 n
+土家 868 n
+土家族 1662 nz
+土尔其 2 ns
+土尔扈特 26 nrt
+土尔扈特部 27 nrt
+土层 520 n
+土居 7 n
+土屋 38 n
+土屋里 4 ns
+土山 67 ns
+土岐 3 nrt
+土岗 9 ns
+土岭 8 ns
+土岭乡 3 ns
+土崩 7 n
+土崩瓦解 74 i
+土崩鱼烂 3 i
+土工 16 n
+土工布 3 n
+土工网 3 n
+土工膜 3 n
+土布 61 n
+土库 3 n
+土库曼 66 ns
+土库曼斯坦 96 ns
+土建 41 ns
+土建工程 12 l
+土建类 3 n
+土性 17 n
+土戏 3 n
+土房 27 n
+土扶成墙 3 n
+土拉河 4 ns
+土拨鼠 11 n
+土改 236 v
+土改运动 72 l
+土政策 20 n
+土断 3 n
+土方 57 n
+土方工程 3 l
+土方平衡 3 nz
+土族 308 nz
+土星 141 n
+土木 237 n
+土木工程 145 l
+土木建筑 3 l
+土木形骸 3 n
+土木系 3 n
+土枪 11 n
+土栽 3 n
+土桥 5 n
+土棍 3 n
+土楼 20 n
+土槿皮 3 n
+土模 3 n
+土气 38 n
+土池 3 n
+土沟 8 ns
+土沟村 3 ns
+土沥青 3 z
+土法 18 n
+土法上马 3 l
+土法炼钢 3 n
+土法生产 3 l
+土洋并举 3 i
+土洋结合 4 i
+土洞墓 15 n
+土温 11 n
+土灰 3 n
+土灶 15 n
+土炕 102 n
+土炮 20 n
+土燕 3 n
+土牛 3 n
+土牛木马 3 ns
+土牢 4 n
+土物 26 n
+土特产 591 n
+土特产品 167 n
+土状 3 n
+土狗 8 n
+土球移植 3 nr
+土瓦 2 ns
+土生 56 n
+土生土长 71 n
+土田 18 n
+土番 3 ns
+土疙瘩 14 l
+土登 2 ns
+土皇帝 11 nr
+土石 56 n
+土石山区 2 ns
+土石方 27 n
+土砂 3 n
+土砖 16 n
+土神庙 3 n
+土种 3 n
+土穰细流 3 nr
+土穴 3 n
+土窑 34 n
+土窑洞 14 ns
+土窟 3 n
+土筐 3 n
+土筑房 3 n
+土管 3 n
+土管员 3 n
+土籍 3 n
+土粪 3 n
+土系 4 n
+土纸 16 n
+土老儿 5 n
+土老冒 3 n
+土老帽 2 n
+土老财 3 l
+土耳其 1180 ns
+土耳其人 262 i
+土耳其共和国 18 ns
+土耳其帝 3 n
+土耳其政府 12 nt
+土耳其族 5 nz
+土耳其语 39 nz
+土耳其队 3 n
+土肥 34 n
+土腥味 11 n
+土腥味儿 3 n
+土腥气 9 n
+土色 148 n
+土茯苓 4 n
+土荆皮 3 n
+土荆芥 4 n
+土著 441 n
+土著人 36 n
+土著居民 3 n
+土葬 129 n
+土蚕 3 n
+土蛋 3 n
+土蜂 8 n
+土蝗 2 n
+土褐色 3 n
+土话 30 n
+土语 28 nz
+土谢图汗 27 l
+土谷祠 3 ns
+土豆 493 n
+土豆丝 8 n
+土豆块 3 n
+土豆条 3 n
+土豆泥 3 n
+土豆片 7 n
+土豆皮 3 n
+土豆粉 6 nz
+土豆网 3 nz
+土豆饼 3 n
+土豚 6 n
+土豪 105 n
+土豪劣绅 61 l
+土豹 2 n
+土贝母 3 nz
+土货 94 n
+土质 152 n
+土质条件 3 n
+土路 40 n
+土造 3 n
+土遁 4 v
+土邦 22 n
+土里 3 n
+土里土气 5 n
+土银 3 nz
+土链 3 n
+土门 9 n
+土门关 2 ns
+土阶茅屋 3 n
+土阶茅茨 3 nr
+土阿莫土 10 nrt
+土霉素 8 n
+土音 6 n
+土风 6 n
+土风舞 2 l
+土鲁蕃洼 3 n
+土鲮鱼 2 n
+土鳖 5 n
+土鳖虫 2 n
+土鸡 17 n
+土鸡场 3 n
+土鸡城 3 ns
+土鸡瓦犬 3 i
+土鸡瓦狗 3 nz
+土黄 11 n
+土黄色 27 n
+土默川 8 nrt
+土默特 24 nrt
+土默特右旗 5 ns
+土默特左旗 2 ns
+土龙刍狗 3 n
+土龙沐猴 3 i
+圢 11 zg
+圣 3999 j
+圣三一 6 t
+圣三利 3 ns
+圣上 243 t
+圣严 3 n
+圣主 3 n
+圣主垂衣 3 n
+圣乔治 31 nrt
+圣书 3 n
+圣井 9 ns
+圣人 555 n
+圣代 3 t
+圣伯夫 3 nrt
+圣伯纳 3 ns
+圣伯纳德 7 nrt
+圣但尼 3 ns
+圣体 37 n
+圣何塞 39 n
+圣佩德罗 9 nrt
+圣使 24 n
+圣保利 3 ns
+圣保禄 3 nr
+圣保罗 139 nr
+圣保罗岛 3 ns
+圣保罗州 10 ns
+圣保罗市 4 ns
+圣俸 3 n
+圣像 82 n
+圣像雕塑 3 n
+圣僧 154 nz
+圣光 3 n
+圣克拉拉 18 nrt
+圣克里斯托瓦尔 5 nrt
+圣克鲁兹 4 ns
+圣克鲁斯 20 ns
+圣克鲁斯省 2 ns
+圣公会 18 n
+圣典 3 ns
+圣凯瑟琳 2 nrt
+圣功 3 a
+圣加仑 4 ns
+圣劳伦斯 111 nrt
+圣卡洛斯 4 nrt
+圣卡洛斯港 2 ns
+圣卢西亚 36 ns
+圣印 3 n
+圣君 40 nrt
+圣君贤相 3 nr
+圣周 5 t
+圣哥 11 ns
+圣哲 5 nr
+圣哲先贤 3 nr
+圣喜美 3 ns
+圣因师太 3 nr
+圣园 3 ns
+圣土 128 n
+圣地 723 n
+圣地亚哥 144 ns
+圣地亚哥市 3 ns
+圣地牙哥 3 ns
+圣坛 10 n
+圣埃蒂安队 2 nz
+圣城 33 ns
+圣域 3 n
+圣基茨 23 nrt
+圣堂 3 n
+圣塞巴斯蒂安 3 nrt
+圣塞瓦斯蒂安 6 nrt
+圣境 6 n
+圣多明各 28 nrt
+圣多美 19 ns
+圣多美和普林西比 28 ns
+圣女 58 n
+圣婴 14 n
+圣子 25 n
+圣子到 3 nr
+圣安东尼奥 69 ns
+圣安娜 11 nr
+圣安德 3 ns
+圣安德列斯 2 ns
+圣安德烈 7 ns
+圣安德鲁 3 ns
+圣尼古拉 4 nrt
+圣尼古拉斯 3 nrt
+圣山 17 ns
+圣巴巴拉 3 nrt
+圣布拉斯 4 nrt
+圣帕特里克 7 nrt
+圣帝明王 3 nr
+圣庙 16 ns
+圣弗兰西 3 nrt
+圣弗兰西斯科 8 nrt
+圣弗朗西斯 2 nrt
+圣彼得 18 nrt
+圣彼得堡 339 ns
+圣彼得堡市 4 ns
+圣彼得大 3 ns
+圣彼得大教堂 21 ns
+圣彼得广场 7 ns
+圣彼得斯堡 2 ns
+圣彼德 3 nrt
+圣彼德堡 3 ns
+圣徒 54 n
+圣德 3 nrt
+圣德尼 4 nr
+圣心 41 n
+圣恩 3 nrt
+圣戈班 3 nrt
+圣战 50 nz
+圣战士 3 nz
+圣战手镯 3 n
+圣战者 6 n
+圣手 60 n
+圣托马斯 13 nrt
+圣托马斯岛 6 nrt
+圣教 3 nz
+圣教序 3 n
+圣文森特 29 nrt
+圣文森特岛 6 nrt
+圣斗士 3 n
+圣方 2 n
+圣日尔曼 3 nrt
+圣日尔曼队 3 nz
+圣日耳曼 13 ns
+圣旨 679 n
+圣明 130 ns
+圣杖 3 n
+圣杯 3 nz
+圣果 3 n
+圣桑 3 nrt
+圣歌 10 n
+圣殿 80 n
+圣殿山 2 nr
+圣殿教 2 nz
+圣母 517 n
+圣母子 8 n
+圣母玛利 3 ns
+圣母院 12 n
+圣母颂 3 nr
+圣水 578 n
+圣泉 4 nz
+圣洁 95 a
+圣洛 2 nrt
+圣洛伦索 9 ns
+圣济总录 3 n
+圣海伦斯 3 ns
+圣淘沙 12 nz
+圣湖 23 ns
+圣火 219 n
+圣火台 3 n
+圣灵 53 n
+圣父 17 n
+圣物 61 n
+圣王 25 nrt
+圣玛丽 2 nr
+圣玛丽亚 17 ns
+圣玛丽斯 10 nrt
+圣玛利亚 5 ns
+圣玛尔塔 3 nrt
+圣皮埃尔 26 nrt
+圣相 3 n
+圣礼 3 n
+圣神文武 3 nr
+圣祠 3 ns
+圣米格尔 12 nrt
+圣约 3 ns
+圣约瑟 8 nrt
+圣约翰 65 nrt
+圣约翰市 3 ns
+圣纪节 2 t
+圣经 438 n
+圣经上 3 n
+圣经神学 3 n
+圣经贤传 3 nr
+圣罗兰 3 ns
+圣者 21 n
+圣职 14 n
+圣职衣 3 n
+圣胡安 28 ns
+圣胡安河 3 ns
+圣艾蒂安 2 ns
+圣药 10 n
+圣莫尼卡 10 nrt
+圣菲 6 nrt
+圣菲波哥大 14 nrt
+圣菲省 2 ns
+圣萨尔瓦多 20 nrt
+圣裔 3 n
+圣西门 3 ns
+圣言 3 n
+圣詹姆斯 4 nrt
+圣训 117 n
+圣诗 3 n
+圣诞 165 t
+圣诞卡 7 n
+圣诞叶 3 t
+圣诞夜 3 t
+圣诞岛 3 n
+圣诞快乐 3 n
+圣诞树 27 n
+圣诞歌 3 n
+圣诞灯 3 n
+圣诞版 3 n
+圣诞礼品 3 n
+圣诞礼物 3 n
+圣诞票 2 n
+圣诞红 3 n
+圣诞老人 25 n
+圣诞节 166 t
+圣谕 66 n
+圣贤 205 nrt
+圣贤书 3 nr
+圣费尔南多 7 nrt
+圣赫勒拿岛 21 ns
+圣路易 21 n
+圣路易斯 38 nrt
+圣路易斯市 4 ns
+圣达菲 3 nrt
+圣迭戈 43 nr
+圣迭戈市 2 ns
+圣迹 9 n
+圣雄 3 ns
+圣雄甘地 9 ns
+圣雪绒 9 nr
+圣雷莫 2 nrt
+圣餐 33 n
+圣餐布 3 n
+圣马丁 35 nrt
+圣马丁岛 2 ns
+圣马克 4 nrt
+圣马利亚 3 ns
+圣马力诺 65 nz
+圣马力诺共和国 3 ns
+圣马可 28 nrt
+圣马洛 3 nrt
+圣马科斯 6 nrt
+圣驾 3 n
+圣骑士 3 n
+圥 2 zg
+圧 3 zg
+在 727915 p
+在上文 3 v
+在下文 3 v
+在世 140 nrt
+在世界上 3 l
+在业 91 v
+在业人口 3 n
+在乎 302 v
+在于 5141 v
+在京举行 3 n
+在京开幕 3 n
+在会谈中 3 l
+在位 724 v
+在位者 3 n
+在你看来 3 l
+在内 2328 u
+在册 36 v
+在劫难逃 33 i
+在历史上 3 l
+在发言中 3 i
+在台协会 3 i
+在品种上 3 l
+在哪玩呢 3 nr
+在商言商 7 n
+在场 1089 v
+在场者 4 n
+在城镇 285 nrt
+在外 1157 v
+在天之灵 97 i
+在天有灵 37 i
+在官言官 3 l
+在实践上 3 n
+在实践中 3 n
+在家 1016 r
+在家出家 3 l
+在家千日好 4 l
+在岸 28 v
+在工作中 3 l
+在座 406 v
+在建 444 v
+在建设中 3 i
+在思想上 3 l
+在意 367 v
+在我心中 3 i
+在我看来 3 l
+在战前 3 i
+在所不惜 35 i
+在所不计 8 i
+在所不辞 45 i
+在所自处 3 i
+在所难免 85 i
+在手 503 v
+在技术上 3 l
+在押 49 v
+在押人员 3 n
+在押犯 8 n
+在握 30 v
+在改革中 3 l
+在政治上 3 l
+在敌之手 3 i
+在数目上 3 l
+在朝党 3 i
+在来米 3 n
+在某些特 3 q
+在校 1213 v
+在校学生 3 n
+在校生 392 n
+在案 45 v
+在此一举 32 i
+在此之前 3 i
+在此之后 3 i
+在此期间 3 l
+在水一方 3 i
+在水中央 3 n
+在理儿 6 l
+在生活上 3 l
+在生活中 3 l
+在短期内 3 l
+在籍 29 b
+在精神上 3 i
+在线 1082 b
+在线书库 3 n
+在线听 3 i
+在线商城 3 n
+在线影视 3 l
+在线影院 3 l
+在线提交 3 b
+在线播放 3 b
+在线收 2 l
+在线教程 3 l
+在线教育 3 l
+在线杀毒 14 l
+在线歌曲 3 l
+在线漫画 3 n
+在线点播 3 l
+在线电影 3 n
+在线电视 3 b
+在线看 3 l
+在线翻译 3 l
+在线视听 3 i
+在线视频 3 n
+在线造词 3 n
+在线音乐 3 n
+在组织上 3 l
+在经济上 3 l
+在结构上 3 l
+在编 43 v
+在编人员 3 l
+在群众中 3 i
+在职 621 v
+在职人员 3 l
+在职员工 3 n
+在职工人 3 l
+在职干部 3 n
+在职训练 3 n
+在职进修 3 l
+在色之戒 3 i
+在营休假 3 v
+在表面上 3 l
+在讲话中 3 l
+在读 131 v
+在谷满谷 3 i
+在贫穷中 3 i
+在逃犯 3 i
+在野 88 v
+在野党 86 n
+在野党派 3 n
+在野派 6 n
+在陈之厄 3 n
+圩 199 zg
+圩区 15 n
+圩场 26 n
+圩垸 6 n
+圩埂 3 n
+圩堤 8 n
+圩子 5 n
+圩田 7 n
+圩镇 6 ns
+圩院 3 n
+圪 156 n
+圪台 3 n
+圪台子 3 n
+圪塔 36 n
+圪节 336 n
+圫 4 zg
+圬 4 g
+圭 802 ns
+圭亚那 176 ns
+圭亚那政府 2 nt
+圭多 4 ns
+圭璋特达 3 nz
+圭臬 3 n
+圭表 36 n
+圭角 3 ns
+圭角不露 3 ns
+圭角岸然 3 n
+圮 27 zg
+圯 26 g
+地 160541 uv
+地丁 17 n
+地丁银 2 nz
+地上 4925 s
+地上天官 3 n
+地上天宫 3 n
+地上权 14 n
+地上茎 15 n
+地下 4708 s
+地下仓库 3 n
+地下修文 3 n
+地下党 121 n
+地下党员 34 n
+地下军 3 n
+地下冰 3 n
+地下冷库 3 n
+地下商场 3 n
+地下坑穴 3 l
+地下城 3 n
+地下室 213 n
+地下害虫 3 n
+地下工厂 3 n
+地下工程 3 n
+地下建筑 3 n
+地下开采 3 i
+地下排水 3 n
+地下掩体 3 i
+地下水 1244 n
+地下水位 3 n
+地下水库 3 n
+地下水面 3 n
+地下河 3 n
+地下活动 3 l
+地下火 3 n
+地下狂飙 3 n
+地下管道 3 n
+地下组织 3 n
+地下茎 32 n
+地下街 3 n
+地下资源 3 n
+地下通道 3 n
+地下道 12 n
+地下铁 3 n
+地下铁路 3 n
+地下铁道 73 n
+地下隧道 15 n
+地下音乐 3 n
+地不容 3 n
+地丑力敌 3 i
+地丑德齐 3 nr
+地中 3 s
+地中海 1289 ns
+地中海地区 52 ns
+地中衡 2 nr
+地主 1742 n
+地主之仪 3 n
+地主之谊 3 nz
+地主分子 3 n
+地主国 3 n
+地主婆 3 n
+地主家 23 n
+地主队 3 n
+地主阶级 249 n
+地久 2 n
+地久天长 10 n
+地五会 3 n
+地亚 82 ns
+地产 426 n
+地产商 3 n
+地产界 6 n
+地产税 2 n
+地产股 34 n
+地亩 3 n
+地仓 3 n
+地仙城 2 nr
+地仙封 14 nr
+地仙幕 2 n
+地仙村 64 nr
+地价 78 n
+地价款 2 n
+地价税 3 n
+地位 11660 n
+地位人格 3 n
+地位级 3 n
+地低 3 n
+地保 20 j
+地儿 50 n
+地光 17 n
+地全顶 2 n
+地利 77 n
+地利人和 4 nz
+地力 20 n
+地动 3 n
+地动仪 25 n
+地动山摇 31 l
+地动山摧 3 i
+地势 3045 n
+地势曲线 3 n
+地勘 4 v
+地勤 34 n
+地勤人员 3 n
+地北天南 3 ns
+地区 39590 n
+地区冲突 3 n
+地区差价 3 n
+地区性 221 n
+地厅级 3 b
+地压 16 n
+地县 3 ns
+地召民 2 n
+地台 146 n
+地史学 11 n
+地名 406 n
+地名办 3 n
+地名学 17 n
+地名正名 3 i
+地向波 2 n
+地图 3085 n
+地图信息 3 n
+地图分幅 3 n
+地图分析 3 l
+地图分类 3 n
+地图判读 3 n
+地图功能 3 n
+地图包 3 n
+地图图型 3 n
+地图学 30 n
+地图学史 3 n
+地图工房 3 n
+地图投影 3 i
+地图搜索 3 nr
+地图更新 3 nz
+地图板 2 n
+地图概括 3 i
+地图符号 3 n
+地图纸 3 n
+地图编绘 3 n
+地图编辑 3 n
+地图网 3 nz
+地图规范 3 n
+地图设计 3 i
+地图评价 3 n
+地图语言 3 n
+地图量算 3 n
+地图集 26 n
+地圈 3 n
+地地导弹 24 n
+地地道道 80 n
+地址 3386 n
+地址变换 6 nr
+地址总线 17 n
+地址映射 2 n
+地址栏 8 n
+地址码 2 n
+地址部 3 n
+地坑 3 n
+地块 112 n
+地坛 293 n
+地坛公园 4 n
+地坪 9 n
+地坼天崩 3 v
+地垄 2 n
+地垄墙 3 n
+地垒 3 n
+地埋灯 3 n
+地域 1470 n
+地域性 51 n
+地域类型 3 n
+地域系统 3 n
+地域观念 3 n
+地基 296 n
+地基基础 3 n
+地基承载 3 nr
+地堂腿 3 n
+地堡 78 n
+地堪院 2 l
+地塌天荒 3 i
+地塞米松 18 nrt
+地壳 744 n
+地壳均衡 3 n
+地壳运动 3 l
+地处 2766 s
+地大 3 nz
+地大喊 3 nr
+地大物博 25 nz
+地头 107 n
+地头蛇 36 n
+地契 32 n
+地委 387 n
+地委书记 3 n
+地学 54 n
+地学家 4 n
+地学界 2 n
+地学部 4 n
+地守候 3 n
+地守护 3 nr
+地安门 144 n
+地宜选 2 nr
+地宫 207 n
+地富 3 n
+地对地 34 n
+地对空 73 n
+地尽其力 3 i
+地层 1094 n
+地层下陷 3 n
+地层图 3 n
+地层学 68 n
+地峡 132 n
+地崩山摧 3 i
+地市 32 n
+地市级 21 n
+地带 2601 n
+地带性 209 n
+地幔 168 n
+地幔隆起 3 ns
+地平 3 n
+地平仪 2 n
+地平天成 3 nz
+地平线 158 n
+地广 3 nz
+地广人希 3 nz
+地广人稀 49 nz
+地广兵 2 nr
+地库 9 n
+地应力 16 n
+地底 245 n
+地底下 53 s
+地府 93 n
+地建园 2 n
+地开石 2 nr
+地弹簧 3 n
+地形 1801 n
+地形匹配 3 nz
+地形区 34 n
+地形图 98 n
+地形基面 3 n
+地形学 9 n
+地形模型 3 n
+地形气候 3 n
+地役权 15 n
+地微撑 2 nr
+地心 65 n
+地心吸力 3 n
+地心引力 11 n
+地心说 32 n
+地志 24 n
+地志学 3 n
+地拉 114 nrt
+地拉那 46 ns
+地接社 35 n
+地摊 59 n
+地摊儿 2 n
+地摊货 3 n
+地支 71 n
+地政 2 n
+地政事务 3 n
+地效 3 n
+地文星 2 n
+地斗韵 3 n
+地方 52641 n
+地方主义 6 n
+地方党委 3 n
+地方军 41 n
+地方分权 3 n
+地方化 42 n
+地方史 12 n
+地方国营 3 n
+地方官 376 n
+地方官吏 3 n
+地方库 3 n
+地方志 37 n
+地方性 3760 n
+地方戏 49 n
+地方法院 3 nt
+地方病 18 n
+地方矿 3 n
+地方税 11 n
+地方税务局 4 nt
+地方舰队 3 nt
+地方色彩 3 n
+地方队 52 n
+地方风味 3 n
+地旷人稀 3 i
+地明器 2 n
+地普仑 2 n
+地木梁 3 nr
+地机 3 n
+地权 30 n
+地条钢 3 n
+地板 681 n
+地板刷 3 n
+地板厂 256 n
+地板条 3 n
+地板漆 3 n
+地板砖 2 n
+地板蜡 4 n
+地板采暖 3 n
+地板革 3 n
+地极 23 n
+地枫皮 3 nr
+地标 32 n
+地栗 3 n
+地核 60 n
+地格 3 n
+地梨 3 n
+地检处 3 n
+地棘天荆 3 nr
+地椒 3 n
+地榆 14 n
+地槽 3 n
+地步 1071 n
+地步但 3 ns
+地段 423 n
+地毡 3 n
+地毯 747 n
+地毯厂 259 n
+地毯式 18 n
+地气 44 n
+地沃宜 2 nr
+地沟 55 n
+地沟油 3 n
+地沥青 3 nr
+地波 14 n
+地洞 114 n
+地温 33 n
+地温表 3 n
+地滑 3 n
+地滚球 3 n
+地漏 8 n
+地火 13 n
+地灵 11 n
+地灵人杰 3 nr
+地灵星 3 nr
+地炉 5 n
+地炕 6 n
+地点 2357 n
+地热 184 n
+地热井 4 n
+地热学 2 n
+地热异常 3 l
+地热水 5 n
+地热能 31 n
+地热能源 3 n
+地热资源 3 n
+地煞 3 n
+地照梦 2 n
+地牢 72 n
+地物 40 n
+地狱 616 n
+地狱之火 3 i
+地狱冰 3 n
+地狱判官 3 n
+地狱变相 2 n
+地狱火 3 n
+地狱般 3 n
+地狱论坛 3 n
+地狱谷 3 n
+地狱雷光 3 n
+地玄珠 5 nr
+地王 12 n
+地球 4590 n
+地球仪 19 n
+地球体 3 n
+地球化学 276 n
+地球日 40 n
+地球村 30 n
+地球物理 3 n
+地球磁场 3 n
+地球科学 3 n
+地球空间 3 n
+地球表层 3 n
+地球表面 3 n
+地理 8066 n
+地理专名 3 n
+地理书 3 n
+地理位置 3 n
+地理信息 3 n
+地理信息系统 29 n
+地理分布 3 n
+地理分析 3 l
+地理制图 3 n
+地理剖面 3 n
+地理单元 3 n
+地理因子 3 n
+地理图 3 n
+地理圈 3 n
+地理坐标 3 n
+地理学 827 n
+地理学史 3 n
+地理学家 161 n
+地理学者 3 n
+地理底图 3 n
+地理景观 3 n
+地理杂志 3 n
+地理环境 3 n
+地理界线 3 n
+地理盲 3 n
+地理知识 3 n
+地理精度 3 n
+地理系 15 n
+地理系统 3 n
+地理纬度 3 n
+地理经度 3 n
+地理综合 3 n
+地理考察 3 n
+地理试题 3 n
+地理课 3 n
+地理过程 3 n
+地理通名 3 n
+地理遥感 3 n
+地理阻障 3 n
+地瓜 71 n
+地瓜干 3 n
+地瓜汤 3 n
+地生兰 3 n
+地生态学 3 n
+地电 3 n
+地电剖面 3 n
+地界 59 n
+地痞 66 n
+地痞流氓 3 n
+地瘠民贫 3 v
+地皮 123 n
+地盘 353 n
+地直 47 n
+地相异 2 n
+地矿 14 n
+地矿厅 4 n
+地矿局 3 n
+地矿部 5 n
+地砖 18 n
+地磁 124 n
+地磁力 3 n
+地磁场 122 n
+地磁学 28 n
+地磁极 32 n
+地磅 3 n
+地福康 2 nr
+地租 1251 n
+地秤 3 n
+地积 4 n
+地税 57 n
+地税局 32 n
+地税所 6 n
+地税网 3 n
+地穴 81 n
+地空导弹 301 n
+地窖 123 n
+地窖子 3 v
+地窝子 9 n
+地窟 3 n
+地窨子 38 n
+地笑丁 2 nr
+地籍 13 n
+地籍图 2 n
+地籍簿 3 n
+地精 3 n
+地级 47 n
+地级市 885 n
+地纪胜 17 nr
+地线 19 n
+地维 3 n
+地缆 3 n
+地缘 138 n
+地缘关系 3 n
+地缘政治学 13 n
+地缘文化 3 n
+地缝 33 n
+地缝里 3 n
+地网 9 n
+地网天罗 3 nz
+地翻土 2 nr
+地老天昏 3 i
+地老天荒 8 n
+地老虎 8 nr
+地老鼠 3 n
+地耳草 3 n
+地肤 9 n
+地肤子 3 n
+地胆草 3 n
+地脉 75 n
+地脚 3 n
+地脚螺丝 3 n
+地膜 44 n
+地膜覆盖 3 n
+地自谦 2 nr
+地自雄 2 nr
+地舒卷 3 nr
+地花鼓 6 n
+地藏寺 3 ns
+地藏庵 4 ns
+地藏王 14 n
+地藏经 3 n
+地蜜 3 n
+地蜡 3 n
+地衣 98 n
+地衣学 3 n
+地衣淀粉 3 n
+地衣红 3 n
+地表 943 n
+地表水 352 n
+地被 449 n
+地裂山崩 3 n
+地裂运动 3 n
+地西泮 3 nr
+地覆天翻 3 i
+地角 20 n
+地角天涯 3 n
+地计丁 2 n
+地译成 3 n
+地貌 1497 n
+地貌世代 3 n
+地貌倒置 3 n
+地貌图 7 n
+地貌学 46 n
+地貌序列 3 n
+地貌成因 3 n
+地貌组合 3 n
+地貌过程 3 n
+地负海涵 3 n
+地质 3014 n
+地质公园 3 n
+地质剖面 3 n
+地质力学 3 n
+地质勘探 3 n
+地质博物馆 9 n
+地质图 54 n
+地质地主 3 n
+地质处置 3 n
+地质学 375 n
+地质学家 178 n
+地质家 3 n
+地质局 10 n
+地质师 4 n
+地质年代 3 n
+地质录井 3 n
+地质所 9 n
+地质模型 3 n
+地质测量 3 n
+地质灾害 3 n
+地质矿产 3 n
+地质矿产部 2 n
+地质系 11 n
+地质编录 3 n
+地质部 56 n
+地质队 16 n
+地贫 3 b
+地走了 3 l
+地走动 3 n
+地趟 3 v
+地躺拳 2 n
+地转风 7 n
+地轴 32 n
+地边 3 s
+地运仪 2 nz
+地远山险 3 n
+地道 431 n
+地道口 3 n
+地道战 53 n
+地邻 3 n
+地里 572 s
+地金喜 2 n
+地钱 3 n
+地铁 1127 n
+地铁口 4 n
+地铁票 2 n
+地铁站 56 n
+地铁线 6 n
+地铺 169 n
+地锚 2 n
+地锦 4 n
+地锦草 3 nr
+地闻风 2 n
+地陪 42 n
+地陷 3 n
+地雷 460 n
+地雷场 3 n
+地雷战 39 n
+地雷阵 11 nr
+地雷震 3 nr
+地震 2663 n
+地震仪 27 nr
+地震台 5 n
+地震学 46 n
+地震局 17 n
+地震带 82 n
+地震棚 3 n
+地震波 70 nr
+地震测深 3 n
+地震源 3 n
+地震烈度 16 n
+地震钻机 3 n
+地震震级 2 n
+地震预报 3 n
+地霉素 3 n
+地霸 3 n
+地静立 2 nr
+地面 6096 n
+地面信号 3 n
+地面升起 3 n
+地面实况 3 n
+地面战 6 nz
+地面材料 3 n
+地面水 20 n
+地面沉降 3 i
+地面温度 3 n
+地面灌溉 3 l
+地面监视 3 n
+地面砖 2 n
+地面站 74 n
+地面蒸发 3 nz
+地面逆温 3 n
+地面部队 3 n
+地飘散 2 i
+地骨皮 3 n
+地高辛 3 nr
+地魔 3 n
+地鳖 3 n
+地鳖虫 3 n
+地黄 43 n
+地黄丸 7 n
+地黄牛 3 n
+地鼠 13 n
+地龙 3 n
+圳 28 nt
+圳沟 3 ns
+圷 28 zg
+圹 18 ng
+场 11435 q
+场上 879 s
+场下 31 s
+场主 12 n
+场依存性 3 nz
+场内 193 s
+场内外 9 s
+场助扩散 3 n
+场区 22 n
+场合 1982 n
+场圃 3 n
+场地 763 s
+场地分析 3 n
+场地地形 3 n
+场地场合 3 n
+场地工程 3 n
+场地感 3 n
+场地自治 3 n
+场地设施 3 n
+场地面积 3 n
+场场 48 n
+场址 5 n
+场坝 3 n
+场外 105 s
+场头 3 n
+场子 127 n
+场屋 3 n
+场强 62 n
+场强仪 3 n
+场房 3 n
+场所 2496 n
+场所感 3 n
+场效应 3 n
+场效应晶 3 n
+场效应管 3 n
+场景 926 n
+场次 151 n
+场氧化层 3 n
+场流分级 3 n
+场源 3 n
+场点 3 n
+场电位 3 n
+场磁铁 3 n
+场磙 3 n
+场站 20 n
+场规 3 n
+场解吸 3 n
+场记 2 n
+场论 3 n
+场边 74 s
+场道 10 n
+场部 11 n
+场里 53 s
+场长 29 n
+场院 34 n
+场面 1601 n
+场面话 14 n
+场频 3 n
+场馆 104 n
+圻 38 g
+圻春 3 ns
+圼 19 zg
+圾 16 x
+址 548 zg
+坂 51 nr
+坂口反应 3 nz
+坂垣征 2 nr
+坂安治 2 nr
+坂崎 3 nrt
+坂崎琢磨 3 nr
+坂崎由莉 3 nr
+坂崎良 3 nr
+坂本龙 4 nr
+坂田荣男 3 nr
+坂田黄 2 nr
+坃 231 zg
+坆 8 zg
+均 20776 d
+均三甲苯 5 nz
+均享 3 v
+均价 3 n
+均位力积 3 n
+均依 3 nz
+均值 55 n
+均分 49 n
+均列 3 n
+均势 91 n
+均匀 1213 a
+均匀值 3 nz
+均匀分布 3 nz
+均匀度 8 ns
+均匀沉淀 3 vn
+均匀线 3 nz
+均化器 3 nz
+均告 3 n
+均告失败 3 n
+均夷线 3 ns
+均安 3 a
+均安镇 3 ns
+均富 3 a
+均居 3 n
+均差 3 a
+均摊 19 n
+均数 7 n
+均方连续 3 n
+均是由 3 n
+均权 3 n
+均热炉 3 n
+均照 3 n
+均田 3 nz
+均田制 86 nz
+均田制度 3 n
+均相聚合 3 n
+均窑 3 nz
+均等 141 a
+均等分裂 3 n
+均等化 3 n
+均线 61 n
+均衡 781 a
+均衡化 16 n
+均衡器 3 n
+均衡性 8 n
+均衡点 4 n
+均衡生产 3 n
+均衡论 2 n
+均裂 3 v
+均质机 3 n
+均贫 3 a
+均贫富 3 n
+均输法 11 n
+均达 22 a
+均遭 3 n
+均须 3 n
+坈 8 zg
+坊 1031 ng
+坊地 3 n
+坊子 3 n
+坊子区 3 n
+坊本 3 n
+坊肆 3 n
+坊间 44 n
+坋 3 zg
+坌 13 g
+坌鸟先飞 3 nr
+坍 144 zg
+坍倒 3 v
+坍台 3 v
+坍坏 3 v
+坍塌 185 v
+坍崩 3 v
+坍方 2 v
+坍缩 3 v
+坍缩星 3 v
+坍落度 3 v
+坍陷 4 v
+坎 532 nrt
+坎上乡 2 l
+坎井之蛙 3 n
+坎代 4 nrt
+坎伯 2 nrt
+坎伯兰 5 nrt
+坎伯利 2 nrt
+坎佩切 2 nrt
+坎儿 45 n
+坎儿井 33 ns
+坎农 11 nrt
+坎坎坷坷 5 z
+坎坷 204 a
+坎坷一生 3 l
+坎坷不平 12 l
+坎坷人生 3 l
+坎坷路 3 l
+坎坷道路 3 l
+坎城 3 nrt
+坎城影展 3 n
+坎培 2 q
+坎培拉 3 ns
+坎大哈 18 nrt
+坎子 12 n
+坎宁 4 nrt
+坎宁安 3 ns
+坎尔井 3 nrt
+坎尼 19 nrt
+坎巴 3 nrt
+坎市 3 ns
+坎布里亚郡 3 ns
+坎布里奇 9 nrt
+坎帕尼亚 3 nrt
+坎帕拉 17 nrt
+坎德 3 nrt
+坎德拉 14 nrt
+坎托 10 nrt
+坎昆 5 ns
+坎普 12 nrt
+坎止流行 3 l
+坎比 2 nrt
+坎比亚 3 ns
+坎比亚索 4 nrt
+坎波 4 nrt
+坎洼 3 a
+坎特 23 nrt
+坎特伯雷 31 nrt
+坎纳拉 3 nrt
+坎肩 27 n
+坎诺特 4 nrt
+坎贝尔 38 nrt
+坎顿 3 nrt
+坏 4624 a
+坏东西 19 n
+坏主意 9 n
+坏习惯 3 n
+坏书 3 n
+坏事 596 n
+坏人 691 n
+坏人坏事 11 n
+坏人心术 3 n
+坏分子 74 n
+坏名声 3 n
+坏块 3 n
+坏处 94 n
+坏天气 3 n
+坏女孩 3 n
+坏孩子 3 n
+坏官 3 n
+坏小子 3 n
+坏小孩 3 n
+坏帐 58 n
+坏帧 3 n
+坏得多 3 l
+坏心 3 n
+坏心眼 3 n
+坏心肠 3 n
+坏恶 3 n
+坏掉 3 v
+坏植散群 3 n
+坏死 228 v
+坏死性 13 n
+坏死病毒 3 n
+坏毛病 3 n
+坏水 14 n
+坏法乱纪 3 n
+坏消息 3 n
+坏灭 3 v
+坏点 3 n
+坏猫 3 n
+坏球 3 n
+坏男孩 3 n
+坏疽 23 n
+坏相 3 n
+坏种 3 n
+坏绅 3 n
+坏脾气 3 n
+坏良心 3 n
+坏蛋 121 n
+坏血 3 n
+坏血病 18 n
+坏血酸 3 n
+坏裳为裤 3 nr
+坏话 149 n
+坏账 110 n
+坏运 3 n
+坏透 3 v
+坐 15447 v
+坐上 3 v
+坐上去 3 v
+坐上来 3 v
+坐上琴心 3 l
+坐下 2589 v
+坐不住 3 v
+坐不垂堂 3 i
+坐不安席 3 i
+坐不改姓 7 i
+坐不稳 3 v
+坐不窥堂 3 i
+坐不起 3 v
+坐不重席 3 i
+坐于涂炭 3 i
+坐井观天 15 i
+坐享其功 3 i
+坐享其成 23 i
+坐以待斃 3 n
+坐以待旦 2 i
+坐以待毙 30 i
+坐会 3 v
+坐位 80 v
+坐位表 3 n
+坐便器 3 l
+坐像 54 v
+坐公车 3 n
+坐具 9 v
+坐冷板凳 24 l
+坐凳 2 n
+坐凳栏杆 3 ns
+坐到 3 v
+坐力 10 n
+坐功 6 v
+坐劳 3 v
+坐化 12 v
+坐北朝南 22 l
+坐南朝北 132 i
+坐卧不宁 14 i
+坐卧不安 33 i
+坐卧不离 3 i
+坐卧针毡 3 i
+坐取 3 v
+坐台 4 v
+坐台女 3 n
+坐吃山崩 3 i
+坐吃山空 22 i
+坐向 3 v
+坐呀 3 n
+坐商 3 v
+坐喷气式 5 l
+坐困 3 v
+坐困愁城 7 i
+坐在 6601 v
+坐地 149 n
+坐地分脏 3 n
+坐地分赃 5 i
+坐地自划 3 l
+坐地铁 3 i
+坐坐 192 v
+坐垫 24 n
+坐堂 43 n
+坐墩 9 n
+坐大 3 v
+坐天下 3 i
+坐失 16 v
+坐失事机 3 i
+坐失机宜 3 i
+坐失良机 37 i
+坐好 3 v
+坐姿 62 n
+坐守 3 v
+坐定 349 v
+坐客 12 v
+坐山吃空 3 i
+坐山观虎 3 i
+坐山观虎斗 17 i
+坐山雕 6 i
+坐席 35 v
+坐庄 29 n
+坐床 17 v
+坐式 7 n
+坐待 25 v
+坐得 3 v
+坐忘 3 v
+坐怀不乱 7 i
+坐抵 3 v
+坐拥书城 3 i
+坐拥百城 3 i
+坐探 21 v
+坐支 3 v
+坐收 23 v
+坐收渔利 5 i
+坐无虚席 3 i
+坐无车公 3 i
+坐月子 43 n
+坐望 3 v
+坐板凳 3 n
+坐果 5 n
+坐标 779 v
+坐标值 3 n
+坐标卡 3 n
+坐标曲线 3 n
+坐标系 185 n
+坐标纸 3 n
+坐标轴 21 n
+坐树不言 3 i
+坐树无言 3 i
+坐椅 70 n
+坐次 14 n
+坐正 3 v
+坐江山 25 i
+坐法 3 v
+坐浴 39 v
+坐满 3 v
+坐火车 3 n
+坐牢 93 v
+坐班 13 v
+坐电梯 3 n
+坐监 10 n
+坐知千里 3 i
+坐票 3 n
+坐禁闭 2 v
+坐禅 47 v
+坐禅关 3 n
+坐科 3 n
+坐立 3 v
+坐立不安 135 i
+坐等 60 v
+坐筹帷幄 3 i
+坐罪 3 v
+坐而待弊 3 i
+坐而待旦 3 i
+坐而待毙 3 i
+坐而论道 14 i
+坐背 3 v
+坐舱 5 n
+坐船 142 v
+坐船到 3 i
+坐船去 3 i
+坐船来 3 i
+坐药 2 v
+坐落 530 v
+坐落于 3 v
+坐薪尝胆 3 i
+坐薪悬胆 3 i
+坐蜡 3 v
+坐观成败 5 l
+坐观虎斗 3 i
+坐视 72 v
+坐视不救 8 i
+坐视不理 3 i
+坐视不管 11 i
+坐视成败 3 i
+坐言起行 3 i
+坐诊 7 v
+坐误 3 v
+坐谈会 3 n
+坐贾行商 3 vn
+坐赃 3 v
+坐起 3 v
+坐车 153 v
+坐车到 3 i
+坐车去 3 i
+坐车来 3 i
+坐轮椅 3 n
+坐轿 3 n
+坐轿子 3 n
+坐运筹策 3 n
+坐镇 239 n
+坐领乾薪 3 i
+坐飞机 3 n
+坐食山空 3 i
+坐骑 457 n
+坐骨 17 n
+坐骨神经 9 i
+坑 1440 n
+坑井 3 n
+坑人 15 n
+坑儒 3 n
+坑儒焚典 3 v
+坑农 8 n
+坑口 39 n
+坑坑 3 n
+坑坑洞洞 3 l
+坑坑洼洼 44 l
+坑塘 2 n
+坑害 56 n
+坑害百姓 3 n
+坑家败业 3 l
+坑底 13 n
+坑掉 3 v
+坑木 7 n
+坑杀 3 v
+坑洞 255 n
+坑洼 53 n
+坑灰未冷 3 n
+坑穴 7 n
+坑绷拐骗 3 l
+坑蒙 3 n
+坑蒙拐骗 11 l
+坑蚀 3 v
+坑起来 3 l
+坑道 429 n
+坑道工事 3 l
+坑道战 5 l
+坑里 3 n
+坑骗 6 v
+坒 2 zg
+坔 2 zg
+坕 2 zg
+块 6749 zg
+块体 39 n
+块儿 58 n
+块儿八毛 3 n
+块内存 3 n
+块冰 11 n
+块净荷 3 n
+块块 3 n
+块垒 13 n
+块头 18 n
+块拷贝 2 v
+块料面层 3 n
+块板 3 n
+块根 67 nz
+块根作物 3 n
+块然一身 3 n
+块煤 2 n
+块状 166 n
+块状图 3 n
+块状崩落 3 n
+块石 14 n
+块砖 11 n
+块茎 70 n
+块茎作物 3 v
+块茎指数 3 v
+块菌 6 n
+块规 3 n
+块钱 17 n
+块长 5 n
+坘 2 zg
+坙 6 zg
+坚 1151 v
+坚不可摧 34 i
+坚信 341 v
+坚信不疑 13 i
+坚信不移 3 i
+坚冰 104 v
+坚决 3168 ad
+坚决不变 3 v
+坚决不移 3 v
+坚决声言 3 i
+坚决执行 3 i
+坚决拥护 3 v
+坚决贯彻 3 i
+坚劲 7 a
+坚厚 3 a
+坚固 610 a
+坚固耐用 3 n
+坚城 59 v
+坚壁 29 n
+坚壁清野 32 i
+坚如磐石 13 i
+坚守 690 v
+坚守不渝 3 i
+坚守岗位 3 n
+坚守自盗 3 i
+坚守阵地 3 i
+坚宗 2 nrt
+坚定 1241 a
+坚定不移 255 i
+坚定信心 3 i
+坚定信念 3 n
+坚定性 60 n
+坚实 658 ad
+坚实基础 3 l
+坚强 1146 v
+坚强不屈 7 i
+坚强不挠 3 i
+坚强意志 3 i
+坚强有力 3 i
+坚忍 69 v
+坚忍不拔 15 i
+坚戈 4 v
+坚执不从 3 i
+坚拒 3 v
+坚持 10215 v
+坚持下去 3 i
+坚持不下 3 i
+坚持不懈 176 i
+坚持不渝 3 i
+坚持到底 3 i
+坚持原则 3 n
+坚持己见 3 i
+坚持真理 3 i
+坚挺 71 a
+坚果 132 n
+坚果壳 3 n
+坚毅 146 a
+坚毅不屈 3 l
+坚牢 36 v
+坚牢度 3 i
+坚牢耐用 3 i
+坚甲利兵 2 n
+坚甲利刃 3 i
+坚甲厉兵 3 i
+坚硬 592 a
+坚硬无比 3 i
+坚称 29 v
+坚翘 3 n
+坚船利炮 7 n
+坚苦 2 a
+坚苦卓绝 3 i
+坚苦卓越 3 i
+坚贞 32 a
+坚贞不屈 157 i
+坚贞不渝 2 i
+坚赞 2 v
+坚辞 36 v
+坚韧 249 a
+坚韧不拔 59 i
+坚韧度 3 i
+坚韧性 2 n
+坚额健舌 3 n
+坛 5158 ng
+坛主 32 n
+坛友 3 n
+坛台 3 n
+坛场 3 n
+坛坛罐罐 14 l
+坛子 117 n
+坛子岭 2 l
+坛经 3 n
+坝 919 n
+坝上 64 s
+坝体 59 n
+坝区 21 n
+坝址 45 n
+坝基 18 n
+坝堤 3 n
+坝头 66 n
+坝子 53 n
+坝桥 8 n
+坝段 11 n
+坝王岭 9 ns
+坝田 3 n
+坝顶 56 n
+坞 354 ng
+坞乡集 3 n
+坞墩 3 n
+坟 1159 n
+坟丘 59 n
+坟典 3 n
+坟冢 9 n
+坟包 27 n
+坟园 3 n
+坟地 118 n
+坟场 42 n
+坟堆 33 n
+坟墓 494 n
+坟头 81 n
+坟山 11 n
+坟岗 2 n
+坟茔 30 n
+坠 672 v
+坠下 3 v
+坠下去 3 v
+坠下来 3 v
+坠体 3 n
+坠儿 42 n
+坠入 128 v
+坠入情网 3 n
+坠地 34 n
+坠失 3 v
+坠子 28 n
+坠心 3 v
+坠机 26 n
+坠机身亡 3 n
+坠楼 6 n
+坠毁 140 v
+坠溷飘茵 3 z
+坠胡 3 n
+坠落 186 v
+坠落在 3 v
+坠车 3 n
+坠马 3 v
+坡 1606 n
+坡口 6 n
+坡向 3 n
+坡地 119 n
+坡坡 10 n
+坡垒 15 n
+坡头区 3 n
+坡岸 5 n
+坡底 8 n
+坡度 353 n
+坡田 3 n
+坡积物 3 n
+坡缕石 2 n
+坡耕地 6 n
+坡脚 5 n
+坡路 3 n
+坡道 84 n
+坡面流 3 n
+坡顶 15 n
+坢 39 zg
+坤 1844 ns
+坤伶 2 n
+坤包 9 n
+坤宁宫 224 ns
+坤宅 3 n
+坤舆 3 ns
+坤表 6 n
+坤角 3 ns
+坤角儿 3 n
+坤车 3 ns
+坤造 3 ns
+坤鞋 3 n
+坥 3 zg
+坦 906 n
+坦丁 12 n
+坦佩雷 7 nrt
+坦克 4443 n
+坦克兵 50 n
+坦克团 75 n
+坦克师 86 n
+坦克炮 84 n
+坦克车 39 n
+坦克部队 3 n
+坦噶尼喀 47 n
+坦噶尼喀湖 37 ns
+坦坦 3 ns
+坦坦然然 3 n
+坦坦荡荡 8 z
+坦实 3 n
+坦尼 2 nrt
+坦帕 11 n
+坦平 3 n
+坦承 42 v
+坦普尔 5 nrt
+坦桑 7 n
+坦桑尼亚 238 ns
+坦桑尼亚联合共和国 5 ns
+坦波夫 2 nrt
+坦洁 3 a
+坦洲 3 ns
+坦然 326 ad
+坦然自若 9 i
+坦率 287 n
+坦率地 3 n
+坦率直言 3 n
+坦登 3 nrt
+坦白 218 n
+坦白交代 3 n
+坦白从宽 17 i
+坦白罪行 3 n
+坦白讲 3 v
+坦白说 3 n
+坦白问题 3 n
+坦直 6 a
+坦缓 2 a
+坦胸露背 3 i
+坦腹 3 n
+坦腹东床 3 n
+坦荡 101 v
+坦荡荡 8 z
+坦葛 3 n
+坦言 206 n
+坦诚 308 a
+坦诚以待 3 i
+坦诚相待 2 i
+坦诚相见 6 i
+坦赞铁路 11 nz
+坦迪 3 nz
+坦途 35 n
+坦陈 7 n
+坦露 4 v
+坧 7 zg
+坨 120 v
+坨子 15 n
+坩 10 zg
+坩埚 57 n
+坩埚钢 3 vn
+坩锅 3 n
+坪 848 ns
+坪上 21 ns
+坪上村 2 ns
+坪值 3 n
+坪内 6 nrt
+坪地 4 ns
+坪坝 3 ns
+坪塘 3 ns
+坪寨 13 ns
+坪山镇 3 ns
+坪林 3 ns
+坪林乡 3 ns
+坪石 3 ns
+坪石乡 2 ns
+坫 8 g
+坭 23 g
+坮 2 zg
+坯 139 n
+坯子 30 n
+坯布 10 n
+坯料 24 n
+坯胎 3 n
+坳 71 g
+坵 5 zg
+坶 44 x
+坷 20 n
+坷垃 8 n
+坹 4 zg
+坻 6 g
+坼 12 zg
+垀 2 zg
+垁 63 zg
+垂 2376 v
+垂下 3 v
+垂下去 3 v
+垂下来 3 v
+垂了下去 3 i
+垂了下来 3 i
+垂体 714 n
+垂体瘤 3 n
+垂倒 3 v
+垂入 3 v
+垂到 3 v
+垂危 224 v
+垂危之际 3 i
+垂发 3 v
+垂台钩栏 3 n
+垂名竹帛 3 i
+垂名青史 3 n
+垂告 3 n
+垂周分裂 3 i
+垂垂老矣 7 i
+垂头 72 v
+垂头丧气 147 i
+垂头塌翅 3 n
+垂头塞耳 3 i
+垂头搨翼 3 v
+垂头铩羽 3 v
+垂尾 40 n
+垂帘 15 n
+垂帘听决 3 i
+垂帘听政 302 i
+垂带 3 n
+垂度 3 n
+垂心 3 v
+垂念 3 v
+垂怜 3 v
+垂成 3 v
+垂手 3 v
+垂手可得 3 i
+垂手帖耳 3 i
+垂手而得 3 i
+垂扬袅袅 3 z
+垂拱 37 v
+垂拱而治 3 i
+垂挂 28 v
+垂教 3 v
+垂暮 7 n
+垂暮之年 19 i
+垂杨 16 n
+垂杨柳 16 n
+垂枝盆景 3 i
+垂柳 80 n
+垂死 84 v
+垂死挣扎 31 i
+垂死者 3 n
+垂泣 3 v
+垂注 3 v
+垂泪 155 v
+垂涎 46 v
+垂涎三尺 15 i
+垂涎欲滴 18 i
+垂涕 3 v
+垂爱 16 v
+垂片 3 n
+垂盆草 2 i
+垂直 1550 v
+垂直于 3 v
+垂直叠加 3 i
+垂直地带 3 i
+垂直带 63 n
+垂直平分 3 i
+垂直性 3 n
+垂直扫描频率 56 n
+垂直极化 3 i
+垂直线 14 n
+垂直绿化 3 i
+垂直舵 3 i
+垂直角 3 i
+垂直起落 3 i
+垂直跃迁 3 i
+垂直距离 3 n
+垂直轴 3 n
+垂直遮阳 3 i
+垂直阻生 3 i
+垂直面 10 i
+垂盼 3 v
+垂着头 3 v
+垂着手 3 v
+垂线 21 n
+垂老 3 n
+垂耳下首 3 i
+垂花 3 n
+垂花门 10 n
+垂范 22 v
+垂范百世 3 n
+垂落 19 v
+垂询 48 v
+垂足 3 v
+垂钓 89 v
+垂钓者 2 i
+垂问 3 v
+垂青 63 z
+垂顾 3 v
+垂饵虎口 3 n
+垂首 3 v
+垂首丧气 3 i
+垂首帖耳 3 i
+垂首贴耳 3 i
+垂髫 6 n
+垃 14 n
+垃圾 1165 n
+垃圾场 19 n
+垃圾堆 44 n
+垃圾处理 9 n
+垃圾处置 3 n
+垃圾文件 3 n
+垃圾斗 3 n
+垃圾桶 33 n
+垃圾池 2 n
+垃圾清运 3 n
+垃圾焚烧 25 vn
+垃圾焚烧炉 31 nr
+垃圾猪 12 n
+垃圾猪肉 2 n
+垃圾站 4 n
+垃圾筒 3 n
+垃圾箱 31 n
+垃圾股 2 n
+垃圾虫 3 n
+垃圾袋 6 n
+垃圾词 3 n
+垃圾车 18 n
+垃圾道 6 n
+垃圾邮件 3 n
+垄 148 v
+垄亩 3 n
+垄作 3 v
+垄坎 3 n
+垄断 1687 v
+垄断价格 3 l
+垄断利润 3 l
+垄断市场 3 l
+垄断性 76 l
+垄断权 34 l
+垄断案 3 n
+垄断组织 3 l
+垄断者 12 n
+垄断行业 3 l
+垄断资产 3 l
+垄断资本 107 l
+垄断集团 3 n
+垄沟 18 n
+垄统 3 n
+垄耕 3 v
+垅 61 zg
+垆 13 zg
+垇 4 zg
+垉 4 zg
+垊 18 zg
+型 13750 k
+型业务 4 n
+型函数 3 n
+型台 8 n
+型号 1193 n
+型基金 3 n
+型式 433 n
+型录 3 n
+型彩票 3 n
+型态 23 n
+型文法 8 n
+型材 21 n
+型板 3 n
+型模 3 n
+型煤 2 n
+型电脑 3 n
+型砂 7 n
+型管 4 n
+型腔 5 n
+型范 3 n
+型谱 261 n
+型钢 15 n
+型领 3 n
+型飞机 3 n
+垍 5 zg
+垎 345 zg
+垏 60 zg
+垐 22 zg
+垑 2 zg
+垒 433 v
+垒上 3 v
+垒上无人 3 n
+垒上有人 3 n
+垒土 3 n
+垒块 3 n
+垒坝 3 n
+垒墙 3 n
+垒外 3 v
+垒沟 3 n
+垒球 61 n
+垒球员 3 n
+垒球场 3 n
+垒球棒 3 n
+垒球队 2 n
+垒石 3 n
+垒砌 21 v
+垒砖 3 n
+垒窝 3 n
+垓 149 g
+垓下 3 nr
+垔 3 zg
+垕 43 zg
+垖 11 zg
+垗 12 zg
+垘 3 zg
+垙 69 zg
+垚 289 zg
+垛 256 v
+垛口 409 n
+垛子 25 n
+垜 1663 zg
+垝 58 zg
+垞 2 zg
+垟 25 zg
+垠 6 ng
+垡 32 g
+垡头 6 ns
+垢 196 zg
+垢弊 3 i
+垢汙 3 i
+垢污 3 i
+垢泥 3 i
+垢面蓬头 3 i
+垣 273 ng
+垣曲 11 ns
+垣曲县 7 ns
+垤 11 g
+垦 262 v
+垦丁 6 nrt
+垦丁公园 3 ns
+垦利 4 vn
+垦利县 7 ns
+垦区 44 ns
+垦地 3 n
+垦复 3 v
+垦殖 114 vn
+垦殖地 3 n
+垦殖场 7 n
+垦殖指数 3 n
+垦民 3 n
+垦种 3 n
+垦荒 100 v
+垦荒地 8 n
+垦荒者 2 n
+垧 7 m
+垨 57 zg
+垩 10 zg
+垩粉 3 n
+垪 20 zg
+垫 1008 zg
+垫上去 3 v
+垫上来 3 v
+垫上运动 3 v
+垫下 3 v
+垫下去 3 v
+垫下来 3 v
+垫个 3 n
+垫仓板 3 n
+垫付 60 v
+垫入 3 v
+垫写 3 v
+垫出 3 v
+垫出去 3 v
+垫出来 3 v
+垫回 3 v
+垫回去 3 n
+垫回来 3 ns
+垫圈 22 n
+垫块 2 n
+垫子 88 n
+垫层 3 n
+垫布 3 v
+垫平 3 n
+垫底 3 n
+垫底儿 3 n
+垫座 3 n
+垫戏 3 n
+垫支 6 n
+垫支资本 3 n
+垫料 3 n
+垫木 3 n
+垫板 4 n
+垫档 3 n
+垫款 28 n
+垫步 3 n
+垫江 9 ns
+垫江县 4 ns
+垫片 2 n
+垫盘 3 n
+垫着 3 v
+垫纸 3 n
+垫肩 2 n
+垫背 28 n
+垫脚 11 n
+垫脚石 24 n
+垫补 3 v
+垫衬 3 v
+垫被 3 n
+垫褥 3 n
+垫过 3 v
+垫过去 3 v
+垫过来 3 v
+垫钱 3 v
+垫鞋 3 n
+垫高 2 v
+垬 731 zg
+垭 104 zg
+垭口 35 n
+垭子口 3 n
+垮 1277 v
+垮下 3 v
+垮下去 3 v
+垮下来 3 v
+垮台 170 v
+垮向 3 v
+垮塌 9 v
+垮得 3 v
+垮成 3 v
+垮掉 3 v
+垯 59 zg
+垰 54 zg
+垱 1547 zg
+垴 4 g
+垵 52 zg
+垶 22 zg
+垷 4 zg
+垸 4893 ng
+垺 4 zg
+垼 2 zg
+垽 18 zg
+埁 16 zg
+埂 198 ng
+埂堰 3 n
+埂子 3 n
+埃 1678 ns
+埃个儿 3 nr
+埃亚 2 ns
+埃伊萨 2 nr
+埃伏尔 160 nr
+埃伦菲尔 8 nrt
+埃佩尔曼 8 nrt
+埃克 4 ns
+埃克哈德 3 nrt
+埃克塞特 2 nrt
+埃克尔斯 4 nrt
+埃克巴 2 nr
+埃克斯 6 nr
+埃克曼 36 nr
+埃克森 22 nr
+埃克特 12 nr
+埃克脱 9 nr
+埃克芳 16 nr
+埃克霍夫 2 nrt
+埃兰 38 ns
+埃兹 2 ns
+埃兹沃尔 2 ns
+埃兹蛋白 3 nr
+埃内斯 8 ns
+埃切维 2 nr
+埃利 6 ns
+埃利亚 9 ns
+埃利奇 2 nr
+埃利奥 2 nr
+埃利奥特 5 nrt
+埃利尼 2 nr
+埃利希 4 nr
+埃利斯 36 ns
+埃利森 3 nr
+埃利蒂斯 2 ns
+埃加迪 2 nr
+埃努古 2 nr
+埃勒克 2 nr
+埃勒曼 3 nr
+埃勒格 6 nr
+埃华山 2 ns
+埃南 2 ns
+埃卢亚尔 2 nrt
+埃厄忒斯 2 nr
+埃及 2888 ns
+埃及共和国 4 ns
+埃及内政部 3 nt
+埃及政府 13 nt
+埃及文 3 nr
+埃及民族民主党 5 nt
+埃及王国 9 ns
+埃及西奈半岛 11 ns
+埃及馆 3 ns
+埃可病毒 3 n
+埃吉纳 2 nr
+埃吕司 16 nr
+埃因霍 3 nr
+埃因霍温 50 nr
+埃因霍温队 4 nr
+埃塔 15 nrt
+埃塞俄比亚 444 ns
+埃塞俄比亚人 10 nr
+埃塞俄比亚人民革命民主阵线 3 nt
+埃塞俄比亚政府 3 ns
+埃塞克斯 7 ns
+埃塞奎博 3 nr
+埃塞萨 3 ns
+埃士顿 3 nr
+埃夫伦 18 nr
+埃奈斯 4 nr
+埃姆努 5 nr
+埃姆斯 7 nr
+埃姆登 2 nr
+埃姆雷 6 nr
+埃富蒂 2 nr
+埃尔一世 3 nrt
+埃尔伯 4 nr
+埃尔兰根 3 ns
+埃尔切 3 nr
+埃尔利 11 ns
+埃尔加 3 ns
+埃尔南 3 ns
+埃尔南德斯 3 ns
+埃尔卡纳 2 nrt
+埃尔哈 3 nrt
+埃尔坎 4 nr
+埃尔埃斯 2 nrt
+埃尔基 3 nr
+埃尔塔 2 nrt
+埃尔塞维 5 nrt
+埃尔夫 4 nr
+埃尔夫斯 11 nrt
+埃尔富特 3 ns
+埃尔尼诺 3 nrt
+埃尔巴坎 4 nrt
+埃尔帕索 5 nrt
+埃尔德 2 nr
+埃尔托 8 nrt
+埃尔文 20 nr
+埃尔斯 22 nr
+埃尔斯沃 4 nrt
+埃尔斯特 2 nrt
+埃尔曼 4 nr
+埃尔朗 3 nr
+埃尔朗根 12 nrt
+埃尔比勒 4 nrt
+埃尔温 4 nr
+埃尔湖 7 ns
+埃尔盖奈孔 3 nr
+埃尔祖鲁 4 nr
+埃尔米 17 nrt
+埃尔维 2 nr
+埃尔维斯 12 nrt
+埃尔萨 8 nr
+埃尔西 2 ns
+埃尔通 2 nr
+埃尔金 2 nr
+埃尔门 4 ns
+埃尔雅基 3 nrt
+埃尔韦斯 2 nrt
+埃尔顿 24 nr
+埃尔马 2 ns
+埃尔默 2 nr
+埃尔齐亚 2 ns
+埃尤尔 4 nr
+埃尼克 4 ns
+埃居 16 nrt
+埃巴 2 ns
+埃布埃 3 ns
+埃布尔 3 nr
+埃布罗 2 nr
+埃布罗河 12 ns
+埃师父 2 nr
+埃希氏 2 nr
+埃帕米 4 nrt
+埃弗拉 2 nrt
+埃弗森 3 nr
+埃弗里 9 nrt
+埃弗顿 117 nr
+埃弗顿队 27 nr
+埃德 10 nrt
+埃德伯 2 nr
+埃德加 4 nr
+埃德尔 2 nr
+埃德尔曼 2 nrt
+埃德温 4 nr
+埃德蒙 13 nr
+埃德蒙顿 9 ns
+埃德赛 2 nr
+埃扎纳 5 nr
+埃托 14 nrt
+埃托利 5 nr
+埃托奥 65 nrt
+埃拉 18 nrt
+埃拉托 20 nrt
+埃拉特 4 nrt
+埃文 15 nr
+埃文基 2 nr
+埃文斯 22 nr
+埃文格 4 nr
+埃斯 30 ns
+埃斯克 6 nr
+埃斯卡 3 nr
+埃斯图 4 nr
+埃斯基 2 nr
+埃斯塔 3 nr
+埃斯塔克 2 nrt
+埃斯奎 8 nr
+埃斯帕 4 nr
+埃斯库 21 nr
+埃斯库多 7 nrt
+埃斯托 27 nrt
+埃斯梅 2 nr
+埃斯梅拉达斯 4 nrt
+埃斯波 4 nr
+埃斯泰尔 2 nrt
+埃斯特 42 nrt
+埃斯特拉达 3 nrt
+埃斯特角 4 ns
+埃斯登 2 nr
+埃斯皮 4 nr
+埃斯科 3 nr
+埃斯蒙 2 nr
+埃斯金 5 nr
+埃明帕 2 nr
+埃普森 4 nr
+埃曼纽 2 nr
+埃朗根 4 nr
+埃林顿 4 nr
+埃柯夫 2 nr
+埃格伯 3 nr
+埃格林 6 nr
+埃格蒙特 6 ns
+埃森 24 nr
+埃森哲 3 nr
+埃法特 4 nr
+埃波罗 2 nr
+埃洛拉 4 nrt
+埃洛石 2 nr
+埃洛贝 2 nr
+埃涅阿斯 5 nrt
+埃特 92 nrt
+埃特纳 15 nr
+埃特里 2 nrt
+埃米 4 nrt
+埃米尔 51 nr
+埃索 2 ns
+埃纳 2 ns
+埃纳河 2 ns
+埃纳雷斯 2 nrt
+埃维人 2 nrt
+埃维塔 4 nr
+埃维昂 10 nr
+埃罗 3 nrt
+埃罗斯 9 ns
+埃罗芒 2 nr
+埃罗菲 2 nr
+埃罗菲斯 2 nrt
+埃莉诺 17 nr
+埃莫森 11 nr
+埃莱娜 3 nr
+埃莱阿 2 nr
+埃菲尔 6 nr
+埃菲尔铁塔 12 nz
+埃菲斯 3 nr
+埃菲特 2 nr
+埃菲社 8 nr
+埃萨拉 3 ns
+埃贝尔 19 nr
+埃贡 3 ns
+埃赫桑 7 nr
+埃达 2 ns
+埃达克 6 nr
+埃达鲁 2 nr
+埃迪尔内 4 nrt
+埃迪沃 4 nr
+埃里 18 ns
+埃里克 28 nrt
+埃里克松 15 nrt
+埃里克森 168 nrt
+埃里卡特 6 nrt
+埃里希 2 nr
+埃里森 4 nr
+埃里温 16 nr
+埃雷利 21 nr
+埃雷拉 11 nrt
+埃雷特 4 nr
+埃马兰吉 3 nrt
+埃马努 2 nr
+埃鲁 6 ns
+埃默森 4 nr
+埃默里 4 nrt
+埃默里奇 3 nrt
+埃默顿 2 nrt
+埄 62 zg
+埅 26 zg
+埆 158 zg
+埇 43 zg
+埉 8 zg
+埋 2394 v
+埋三怨四 3 i
+埋下 3 v
+埋下去 3 v
+埋伏 846 v
+埋伏圈 4 v
+埋伏牙 3 v
+埋入 69 v
+埋单 55 v
+埋名 4 v
+埋名隐姓 3 i
+埋地灯 3 v
+埋声晦迹 3 i
+埋天怨地 3 i
+埋头 258 v
+埋头伏案 3 i
+埋头工作 3 i
+埋头苦干 117 i
+埋头顾影 3 i
+埋层 3 v
+埋布 3 v
+埋得 3 v
+埋怨 537 v
+埋怨起来 3 i
+埋植 2 v
+埋汰 8 v
+埋没 104 v
+埋没人才 3 i
+埋没人材 3 i
+埋电缆 3 n
+埋线 5 v
+埋置 3 v
+埋葬 365 v
+埋葬地 3 i
+埋藏 329 v
+埋藏地 3 i
+埋设 78 v
+埋起 3 v
+埋起来 3 v
+埋轮破柱 3 i
+埋雷 3 v
+埋首 11 v
+埋骨 48 v
+埌 743 zg
+埍 63 zg
+城 19953 n
+城上城 3 ns
+城下 531 s
+城下之盟 20 l
+城下之辱 3 l
+城东 267 ns
+城东乡 3 ns
+城东区 3 ns
+城东湖 3 ns
+城东路 3 ns
+城中 1929 s
+城中区 6 ns
+城中城 3 ns
+城中心 27 n
+城中村 3 ns
+城中路 3 ns
+城主 3 n
+城乡 2316 n
+城乡之间 3 n
+城乡人民 3 n
+城乡居民 3 n
+城乡差别 3 n
+城乡差异 3 i
+城乡建设 3 l
+城乡游 9 n
+城乡经济 3 n
+城乡结合 3 n
+城乡规划 3 n
+城信 3 n
+城八区 5 n
+城关 89 ns
+城关区 6 ns
+城关镇 82 ns
+城内 2143 s
+城北 910 s
+城北区 3 ns
+城北徐公 3 ns
+城区 1517 n
+城区部 3 n
+城南 466 ns
+城南区 3 ns
+城南庄 2 ns
+城厢 20 n
+城厢区 3 ns
+城厢镇 2 ns
+城口 4 n
+城口县 2 ns
+城商行 3 j
+城固 12 v
+城固县 4 ns
+城址 386 n
+城垛 46 n
+城垣 589 ns
+城域 11 n
+城域网 18 n
+城堡 616 ns
+城堡石 3 ns
+城堤 3 n
+城墙 1957 n
+城墙根 19 n
+城壕 3 n
+城外 1683 s
+城外诚 3 n
+城头 646 n
+城子 61 n
+城子河区 3 ns
+城寨 25 ns
+城工部 5 n
+城市 25084 ns
+城市之光 5 n
+城市交通 10 nt
+城市信用社 2 nt
+城市公交 3 n
+城市公园 3 n
+城市分类 3 n
+城市勘察 3 n
+城市化 251 n
+城市化村 3 n
+城市园林 3 ns
+城市地图 3 ns
+城市地标 3 j
+城市居民 3 n
+城市布局 3 n
+城市引力 3 n
+城市形态 3 n
+城市形象 3 n
+城市户口 3 n
+城市排水 3 n
+城市改建 3 j
+城市更新 3 nz
+城市核心 3 nt
+城市气候 3 n
+城市污染 3 n
+城市污水 14 n
+城市热岛 3 ns
+城市猎人 3 n
+城市用地 3 n
+城市管理者 4 n
+城市组团 3 nt
+城市给水 3 ns
+城市绿化 3 ns
+城市绿地 3 n
+城市美学 3 nt
+城市群 23 n
+城市职能 3 n
+城市蔓生 3 n
+城市规划 3 n
+城市论坛 3 n
+城市贫民 51 n
+城市轨道 3 n
+城市辐集 3 n
+城市边缘 3 n
+城市选址 3 n
+城市道路 100 n
+城市防洪 3 n
+城市防灾 3 n
+城市集群 3 n
+城市雕塑 3 n
+城府 96 n
+城府甚深 3 i
+城建 127 ns
+城建局 6 nt
+城建监察 3 n
+城建税 3 n
+城影院 3 n
+城旦 3 ns
+城标 3 n
+城根 37 ns
+城楼 4615 n
+城步 4 n
+城步苗族自治县 4 ns
+城池 609 n
+城河 3 ns
+城狐社鼠 3 n
+城献 3 n
+城砖 145 n
+城管 26 n
+城管办 3 j
+城管局 3 nt
+城西 408 ns
+城西乡 2 ns
+城西区 3 ns
+城西湖 3 ns
+城调队 7 n
+城轨 3 n
+城运会 4 j
+城近郊区 2 n
+城邑 55 ns
+城邦 10341 n
+城郊 770 s
+城郊乡 5 ns
+城郊区 3 s
+城郊型 258 b
+城郭 119 n
+城里 2264 s
+城里人 215 n
+城铁 5 n
+城镇 2194 ns
+城镇人口 3 ns
+城镇化 54 n
+城镇化率 2 n
+城镇居民 3 n
+城镇群 4 n
+城镇职工 3 n
+城门 2153 n
+城门口 3 ns
+城门失火 5 n
+城门洞 35 ns
+城门立雪 3 n
+城门鱼殃 3 n
+城阙 7 n
+城防 124 n
+城防工事 3 n
+城阳区 4 ns
+城际 30 n
+城际通 3 nz
+城陵矶 33 ns
+城隅 3 n
+城隍 89 ns
+城隍庙 68 ns
+城隍爷 3 ns
+城隍阁 2 ns
+城雕 3 n
+埏 3 g
+埐 3 zg
+埑 12 zg
+埒 19 g
+埒才角妙 3 nr
+埒材角妙 3 nr
+埓 17 zg
+埔 69 g
+埔心 3 ns
+埔盐 3 ns
+埔里 3 ns
+埔里镇 4 ns
+埕 9 g
+埖 5 zg
+埗 89 zg
+埘 29 n
+埙 49 ng
+埙篪相和 3 nz
+埛 72 zg
+埜 21 zg
+埝 12 zg
+埞 24 zg
+域 1124 n
+域分 3 n
+域名 269 n
+域名服务 3 n
+域名空间 3 n
+域名经济 3 n
+域名解析 3 n
+域外 28 s
+域性 7 n
+域扩张 3 n
+域控制器 3 n
+域民 3 n
+域特征数 3 n
+域的复合 3 n
+域论 3 n
+埠 185 ng
+埠头 7 n
+埡 26 zg
+埢 39 zg
+埤 2 zg
+埥 15 zg
+埧 42 zg
+埪 2 zg
+埬 2 zg
+埭 26 zg
+埮 15 zg
+埱 2 zg
+埳井之蛙 3 n
+埴 2 g
+埵 8 zg
+執 5 zg
+埸 3 g
+培 260 v
+培优 3 v
+培修 3 vn
+培元 3 n
+培元固本 3 n
+培养 5850 v
+培养人才 3 n
+培养出来 3 v
+培养后代 3 n
+培养基 52 n
+培养对象 3 n
+培养感情 3 n
+培养教育 3 n
+培养料 8 n
+培养液 12 n
+培养皿 4 n
+培养目标 3 n
+培养箱 3 n
+培养能力 3 n
+培养费 3 n
+培华 3 v
+培土 17 v
+培基 3 v
+培基语言 3 n
+培尔 3 nrt
+培根 131 nz
+培植 200 v
+培植亲信 3 n
+培植出 3 n
+培罗蒙 2 nrt
+培育 1177 vn
+培育出 3 n
+培育法 3 n
+培英 2 n
+培训 4676 vn
+培训中心 3 n
+培训基地 3 nz
+培训师 3 n
+培训成人 3 n
+培训教材 3 n
+培训期 2 n
+培训班 590 n
+培训网 7 nz
+培训者 2 n
+培训论坛 3 n
+培训评估 3 n
+培训费 43 n
+培训资料 3 n
+培训部 19 n
+基 3644 a
+基丁 3 n
+基业 152 n
+基丹 56 n
+基于 1777 p
+基亚 8 nz
+基亚岛 2 ns
+基什 35 nrt
+基价 2 n
+基伍 5 n
+基伍湖 15 nr
+基伦 2 nrt
+基伯 3 n
+基体 72 n
+基体干扰 3 l
+基体效应 3 n
+基佛 3 n
+基作用 3 n
+基佬 3 nz
+基元 3 n
+基元电荷 3 n
+基兰 2 nz
+基兴 4 a
+基准 263 n
+基准价 6 n
+基准值 3 n
+基准兵 3 n
+基准利率 3 nz
+基准日 19 nz
+基准点 11 n
+基准线 3 nz
+基准网络 3 n
+基准面 3 n
+基切 18 a
+基利 10 n
+基加 3 d
+基加利 7 n
+基勒 2 nz
+基化 3 n
+基区 3 n
+基南 2 ns
+基博 5 nz
+基卢瓦岛 6 nrt
+基右矢 3 nr
+基合金 7 n
+基哥 2 n
+基因 1985 n
+基因丰余 3 nr
+基因产业 3 n
+基因修饰 3 n
+基因剔出 3 vn
+基因功能 3 n
+基因图 2 nr
+基因图谱 3 nr
+基因型 3 n
+基因士兵 3 nr
+基因学 2 n
+基因工程 8 n
+基因库 11 nr
+基因座 3 n
+基因战士 3 n
+基因打靶 3 n
+基因指纹 3 n
+基因文库 3 nrt
+基因枪 3 n
+基因毒性 3 n
+基因治疗 3 n
+基因流 3 n
+基因源 3 n
+基因突变 3 n
+基因簇 3 nr
+基因线 3 n
+基因组 56 n
+基因组学 3 n
+基因组研究 3 n
+基因芯片 3 n
+基因连锁 3 nrt
+基团 209 n
+基团频率 3 n
+基地 11481 n
+基地化 20 j
+基地网 3 nz
+基址 90 n
+基坑 9 n
+基型 3 n
+基多 48 d
+基央 3 n
+基奥 14 nrt
+基姆 7 n
+基尔 102 nz
+基尔巴尼 3 nrt
+基尔库克 14 nrt
+基尔比 28 nrt
+基尔肯尼 6 nrt
+基尔霍夫 3 nrt
+基尼 11 nz
+基尼斯 9 nz
+基尼系数 14 nz
+基层 1998 n
+基层人员 3 n
+基层人民 3 n
+基层医院 2 n
+基层单位 3 n
+基层工作 3 n
+基层干部 3 n
+基层建设 3 l
+基层政权 3 n
+基层社 3 n
+基层组织 3 n
+基层队 3 n
+基岩 240 n
+基岩扇 3 n
+基峰 3 n
+基布 3 n
+基希纳 7 nr
+基希纳乌 3 nz
+基希讷乌 3 ns
+基带 16 n
+基带频率 3 n
+基干 21 n
+基干民兵 5 n
+基平面 3 n
+基年 3 n
+基序 3 n
+基库尤 3 nr
+基底 158 n
+基底层 3 n
+基底膜 3 n
+基底节 3 n
+基度 16 n
+基度山 3 ns
+基座 213 n
+基廷 4 n
+基建 179 a
+基建处 3 n
+基建工 4 n
+基建工程 6 l
+基建投资 3 nz
+基建队 8 n
+基弗 5 nz
+基强 2 a
+基律纳 9 nr
+基德 139 n
+基德曼 2 nr
+基态 3 n
+基思 2 n
+基性 27 n
+基性岩 72 n
+基恩 33 n
+基恩斯 3 nrt
+基戈马 5 nz
+基托 6 n
+基托蜡片 3 n
+基拉 9 nrt
+基数 374 n
+基数排序 3 l
+基数词 3 n
+基料 8 n
+基斯 17 nz
+基斯坦 8 nz
+基斯马尤 4 nrt
+基普 7 nz
+基期 28 n
+基本 20479 n
+基本一致 4 d
+基本上 2711 n
+基本保障 3 n
+基本农田 3 n
+基本准则 3 n
+基本前提 3 n
+基本剑术 3 n
+基本功 120 n
+基本功能 3 n
+基本区域 3 n
+基本原理 26 n
+基本参数 3 n
+基本味觉 3 n
+基本国情 3 n
+基本国策 3 n
+基本块 3 n
+基本型 46 n
+基本学科 3 n
+基本定律 3 n
+基本工资 281 n
+基本常识 3 n
+基本平台 2 n
+基本建设 274 l
+基本思路 3 n
+基本成分 3 n
+基本技能 3 n
+基本操作 16 n
+基本方位 3 n
+基本方针 3 n
+基本权利 3 n
+基本核算 3 n
+基本概念 3 l
+基本模式 3 n
+基本民众 3 n
+基本法 180 n
+基本演员 3 n
+基本点 82 n
+基本特征 2 n
+基本电荷 3 n
+基本相同 4 n
+基本矛盾 60 l
+基本知识 3 n
+基本空间 3 n
+基本粒子 48 n
+基本系 5 n
+基本素质 3 n
+基本纲领 3 n
+基本苗 3 n
+基本要素 3 n
+基本要领 3 n
+基本规律 3 n
+基本词 3 n
+基本词汇 9 n
+基本资料 3 n
+基本路线 3 n
+基本面 182 n
+基材 6 n
+基板 72 n
+基极 5 n
+基构 3 n
+基林 5 n
+基架 3 n
+基柱 3 n
+基根 3 nz
+基桑加尼 11 ns
+基武 4 n
+基民 6 n
+基民盟 25 n
+基氨基酸 3 nz
+基波 4 n
+基泰 17 nz
+基泽 5 n
+基洛 57 nrt
+基洛夫 49 nrt
+基流 3 n
+基点 115 n
+基片 35 n
+基片丝 3 nz
+基片插孔 3 n
+基片楔突 3 vn
+基牙 3 n
+基特 7 nrt
+基特尔 3 nrt
+基琴 16 n
+基督 246 n
+基督书院 3 nz
+基督城 8 nz
+基督学院 3 nz
+基督山 6 nz
+基督徒 65 n
+基督教 2274 nz
+基督教协会 258 nt
+基督教堂 12 n
+基督教徒 128 n
+基督教民主联盟 36 nt
+基督教社会联盟 8 nt
+基石 145 n
+基础 18510 n
+基础产业 3 n
+基础代谢 5 l
+基础代谢率 5 n
+基础件 5 n
+基础体温 3 n
+基础医学 3 n
+基础学科 3 n
+基础性 140 n
+基础截 3 n
+基础教程 3 n
+基础教育 175 l
+基础架构 4 n
+基础油 3 n
+基础理论 107 n
+基础知识 8 n
+基础科学 69 l
+基础薄弱 3 l
+基础行业 3 n
+基础表达 3 n
+基础训练 3 n
+基础设施 107 n
+基础课 45 n
+基础转录 3 n
+基社盟 3 n
+基站 77 n
+基站设备 3 n
+基米尔 3 nrt
+基类 36 n
+基粒 5 n
+基纳 13 nz
+基纳巴卢山 9 nrt
+基线 120 n
+基线噪声 3 nz
+基线校正 3 n
+基线漂移 3 n
+基组 3 n
+基维 2 n
+基罗 2 nz
+基罗加 3 nz
+基耶 10 nrt
+基联会 3 n
+基肥 35 n
+基脚 3 n
+基膜 3 n
+基色 17 n
+基萘 3 nz
+基蒂 3 nrt
+基薪 3 n
+基藏库 3 nz
+基西 3 n
+基诺 26 nz
+基诺族 30 nz
+基调 126 n
+基质 153 n
+基质蛋白 3 n
+基转移酶 3 nz
+基轴 2 n
+基辅 202 n
+基辅迪纳莫 4 nz
+基辅迪纳莫队 2 nz
+基辛格 40 n
+基达 3 nz
+基部 388 n
+基里 16 n
+基里亚 3 nrt
+基里尔 6 nrt
+基里巴斯 39 nrt
+基里巴斯共和国 2 ns
+基里延科 2 nr
+基金 3114 n
+基金业 7 n
+基金会 575 n
+基金净值 3 n
+基金委 8 n
+基金安 3 nz
+基金指数 4 n
+基金法 2 n
+基金科 3 nz
+基金组织 3 nt
+基金部 2 n
+基金项目 3 n
+基铁 3 n
+基间平面 3 n
+基阵 2 n
+基隆 151 nz
+基隆人 3 n
+基隆屿 3 nr
+基隆市 10 ns
+基隆河 3 nr
+基隆港 3 ns
+基隆港务 3 n
+基面 20 n
+基韦 2 n
+基音 7 n
+基顿 16 nrt
+基频 6 n
+基马尔 3 nrt
+基默 3 a
+埼 2 zg
+埽 146 g
+堀 7 zg
+堀内 3 vn
+堀起 3 vn
+堂 3849 q
+堂上 282 n
+堂上一呼 3 i
+堂主 35 n
+堂会 55 n
+堂伯 10 n
+堂伯叔 3 n
+堂侄 3 n
+堂倌 39 n
+堂兄 55 n
+堂兄妹 2 n
+堂兄弟 78 n
+堂务 3 n
+堂厅 3 n
+堂叔 10 n
+堂口 6 n
+堂号 4 n
+堂吉诃德 2 v
+堂哉皇哉 3 i
+堂哥 27 n
+堂哥哥 3 n
+堂堂 437 n
+堂堂一表 3 i
+堂堂之阵 3 i
+堂堂正正 90 i
+堂堂皇皇 2 i
+堂奥 11 nrt
+堂妹 11 n
+堂姊 3 n
+堂姊妹 3 n
+堂姐 15 n
+堂姐妹 2 n
+堂嫂 3 n
+堂子 3 n
+堂子里 3 n
+堂客 15 n
+堂屋 343 n
+堂弟 63 n
+堂戏 3 n
+堂房 3 n
+堂房兄弟 3 n
+堂房姐妹 3 n
+堂房弟兄 3 n
+堂本 7 n
+堂本光一 3 i
+堂本刚 3 d
+堂正 3 z
+堂沽 3 i
+堂皇 84 n
+堂皇冠冕 3 n
+堂皇富丽 3 i
+堂皇正大 3 i
+堂而皇之 89 i
+堂花 3 n
+堂鼓 11 n
+堃 47 zg
+堅 2 zg
+堆 2470 v
+堆一堆 3 n
+堆上 3 v
+堆上去 3 v
+堆上来 3 v
+堆下 3 v
+堆儿 34 n
+堆入 3 v
+堆叠 16 v
+堆土 10 n
+堆场 17 n
+堆垒 26 n
+堆垛 10 n
+堆堆 3 n
+堆好 3 v
+堆存 10 v
+堆存处 3 i
+堆密度 3 n
+堆山 11 ns
+堆山积海 3 i
+堆彻 3 v
+堆得 3 v
+堆成 3 v
+堆成堆 3 n
+堆房 3 n
+堆排序 3 i
+堆放 119 v
+堆放台 3 n
+堆有 3 v
+堆木场 3 n
+堆来堆去 3 v
+堆栈 38 n
+堆案盈几 3 n
+堆沟港 4 ns
+堆泥 3 n
+堆浸 2 v
+堆满 193 v
+堆焊 5 vn
+堆石 19 n
+堆石坝 17 n
+堆码 3 n
+堆砌 85 v
+堆积 810 v
+堆积体 6 n
+堆积作用 3 n
+堆积如山 99 i
+堆积层 15 n
+堆积成 3 i
+堆积成山 3 i
+堆积物 61 n
+堆积起来 3 i
+堆笑 3 v
+堆粪 3 n
+堆绣 6 n
+堆置 3 v
+堆聚 3 v
+堆肥 24 v
+堆芯 17 n
+堆草机 3 n
+堆装物 3 n
+堆起 3 v
+堆起来 3 v
+堆过 3 v
+堆过去 3 i
+堆过来 3 v
+堆金叠玉 3 i
+堆金如玉 3 i
+堆金积玉 3 n
+堆金迭玉 3 ns
+堆阵 3 v
+堆集 3 v
+堆雪人 3 i
+堆高 4 v
+堆高机 3 n
+堆龙德庆 7 ns
+堆龙德庆县 4 ns
+堇 48 n
+堇色 3 n
+堇菜 7 n
+堉 22 zg
+堋 99 g
+堌 2 zg
+堍 5 zg
+堎 3 zg
+堐 2 zg
+堑 338 zg
+堑壕 34 n
+堑壕战 3 vn
+堑山堙谷 3 v
+堕 693 v
+堕云雾中 3 nz
+堕入 128 v
+堕海 3 v
+堕溷飘茵 3 z
+堕甑不顾 3 v
+堕胎 78 v
+堕胎药 3 vn
+堕落 390 v
+堕落腐化 3 v
+堕落街 3 v
+堕马 9 v
+堙 33 zg
+堙谷堑山 3 n
+堚 10 zg
+堛 45 zg
+堜 360 zg
+堝 1284 zg
+堞 38 g
+堟 413 zg
+堠 17 g
+堡 1491 ng
+堡主 5 n
+堡垒 323 n
+堡垒作用 3 n
+堡子 11 n
+堡寨 12 n
+堡礁 18 n
+堢 284 zg
+堣 254 zg
+堤 1708 n
+堤上 86 s
+堤内 3 s
+堤围 9 n
+堤坝 107 n
+堤坡 9 n
+堤垸 259 n
+堤埂 2 n
+堤堰 11 n
+堤外 3 s
+堤岸 105 s
+堤岸种植 3 ns
+堤段 8 n
+堤溃蚁孔 3 n
+堤溃蚁穴 3 n
+堤道 3 n
+堤防 113 n
+堤防道 3 n
+堤顶 8 n
+堥 205 zg
+堨 2 zg
+堪 767 zg
+堪为 3 v
+堪为表率 3 n
+堪以告慰 3 n
+堪培拉 61 ns
+堪察 3 v
+堪察加 20 ns
+堪察加半岛 20 ns
+堪察加州 3 ns
+堪布 3 v
+堪当 3 v
+堪当大任 3 l
+堪当重任 3 l
+堪忧 36 v
+堪此重任 3 l
+堪测 3 v
+堪称 956 v
+堪称一绝 8 l
+堪舆 23 ns
+堪舆家 3 ns
+堪萨斯 24 ns
+堪萨斯城 9 ns
+堪萨斯州 15 ns
+堪虞 3 ns
+堪验 3 v
+堬 229 zg
+堰 434 ns
+堰体 3 nz
+堰口 264 ns
+堰围 3 n
+堰塞湖 32 ns
+堰桥 258 ns
+報 10 zg
+場 2 zg
+堵 1193 v
+堵上 3 v
+堵不如疏 3 nr
+堵住 325 v
+堵允锡 6 nr
+堵击 14 v
+堵到 3 v
+堵口 9 v
+堵嘴 3 v
+堵塞 472 v
+堵塞物 2 nr
+堵墙 2 nr
+堵师赞 3 nr
+堵心 3 v
+堵截 274 v
+堵施蛮 4 nr
+堵死 111 v
+堵漏 14 v
+堵漏垫 3 v
+堵漏建制 3 n
+堵破洞 2 nr
+堵紧 3 v
+堵胤锡 4 nr
+堵起 3 v
+堵起来 3 v
+堵车 49 v
+堵门 3 v
+堺 5 zg
+堼 2 zg
+塄 50 g
+塌 722 v
+塌下 3 v
+塌下去 3 v
+塌下来 3 v
+塌倒 3 v
+塌台 2 v
+塌塌米 3 n
+塌实 20 v
+塌心 3 v
+塌方 52 n
+塌架 3 v
+塌棵菜 3 v
+塌毁 4 v
+塌缩 2 v
+塌落 24 v
+塌车 3 v
+塌陷 109 v
+塌陷地 3 n
+塌鼻 3 v
+塌鼻子 3 n
+塍 5 g
+塏 44 zg
+塑 397 n
+塑像 276 n
+塑制 3 n
+塑制品 3 n
+塑化 7 n
+塑化剂 3 n
+塑匠 3 n
+塑型 3 n
+塑封 2 v
+塑封机 3 n
+塑形 10 n
+塑性 313 n
+塑性体 3 n
+塑性变形 3 n
+塑性形变 3 n
+塑性材料 3 n
+塑成 3 v
+塑料 996 n
+塑料五金 3 n
+塑料产品 3 n
+塑料件 6 n
+塑料制品 3 n
+塑料包装 3 n
+塑料厂 3 n
+塑料原料 3 n
+塑料固化 3 n
+塑料大棚 3 n
+塑料套 2 n
+塑料容器 3 n
+塑料工业 3 n
+塑料市场 3 n
+塑料布 43 n
+塑料建材 3 n
+塑料托盘 3 n
+塑料机械 3 n
+塑料杯 3 n
+塑料板 3 n
+塑料板材 3 n
+塑料桶 7 n
+塑料模 3 n
+塑料模具 3 n
+塑料片 3 n
+塑料玩具 3 n
+塑料瓶 9 n
+塑料盆 3 n
+塑料盒 3 n
+塑料盖 3 n
+塑料管 9 n
+塑料管道 3 n
+塑料箱 3 n
+塑料纸 8 n
+塑料绳 2 n
+塑料网 3 n
+塑料膜 6 n
+塑料薄膜 3 n
+塑料袋 96 n
+塑料软管 3 n
+塑料配件 3 n
+塑料门窗 3 n
+塑料零件 3 n
+塑料颗粒 3 n
+塑晶 3 n
+塑木 3 n
+塑机 2 n
+塑条 3 n
+塑模 3 n
+塑炼 3 v
+塑炼机 3 n
+塑胶 72 n
+塑胶五金 3 n
+塑胶产品 3 n
+塑胶体 3 n
+塑胶制品 3 n
+塑胶厂 3 n
+塑胶原料 3 n
+塑胶地板 3 n
+塑胶外壳 3 n
+塑胶套 3 n
+塑胶工业 3 n
+塑胶板 3 n
+塑胶模具 3 n
+塑胶泡绵 3 n
+塑胶片 3 n
+塑胶玩具 3 n
+塑胶球 3 n
+塑胶瓶 3 n
+塑胶管 3 n
+塑胶纸 3 n
+塑胶袋 3 n
+塑胶跑道 3 n
+塑胶钱 3 n
+塑膜 3 n
+塑身 22 n
+塑造 896 v
+塑造出 3 n
+塑造形象 3 n
+塑造成 3 n
+塑造法 3 n
+塑钢 3 n
+塑钢带 3 n
+塑钢窗 3 n
+塑钢门 3 n
+塓 2 zg
+塔 2987 j
+塔中 49 nrt
+塔亚 2 ns
+塔什 24 nrt
+塔什干 119 nrt
+塔什库尔干 36 nrt
+塔什库尔干塔吉克自治县 9 ns
+塔代伊 3 nrt
+塔伊 7 nrt
+塔伊夫 7 nrt
+塔伦坦 3 ns
+塔体 3 n
+塔依尔 10 nr
+塔儿海 2 ns
+塔克 20 nrt
+塔克世 8 nrt
+塔克尔 3 nr
+塔克希 2 nr
+塔克拉玛 2 nrt
+塔克拉玛干 33 ns
+塔克拉玛干大沙漠 5 ns
+塔克拉玛干沙漠 60 ns
+塔克文 3 nr
+塔克萨 3 nr
+塔兰托 14 nrt
+塔兰托市 4 ns
+塔兰泰 4 nz
+塔兰顿 48 nr
+塔内 3 nrt
+塔凌霄 2 nr
+塔列朗 6 nr
+塔利 5 ns
+塔利亚 11 ns
+塔利奥 9 nrt
+塔利班 45 nr
+塔剌海 3 nr
+塔前 11 ns
+塔努斯 11 nr
+塔勒 51 nrt
+塔勒奇 2 nr
+塔博尔 6 nr
+塔卡 7 nrt
+塔卡尔 3 nr
+塔台 46 ns
+塔吉 3 nrt
+塔吉克 97 nr
+塔吉克斯坦 163 nrt
+塔吉克斯坦共和国 12 ns
+塔吉克族 292 nz
+塔吉尔 7 nr
+塔吉耶夫 4 nrt
+塔吉雅 3 nr
+塔吊 6 n
+塔哈 10 nrt
+塔哈维 2 nr
+塔器 2 nz
+塔城 60 ns
+塔城地区 8 ns
+塔城市 5 ns
+塔基 25 nrt
+塔塔儿 39 nr
+塔塔塔 4 nrt
+塔塔尔 21 nr
+塔塔尔族 16 nz
+塔塞维 2 nr
+塔墩 3 nrt
+塔外 3 ns
+塔夫 14 nrt
+塔夫拉 2 nrt
+塔夫绸 2 nr
+塔夫罗 4 nrt
+塔夫脱 8 nrt
+塔头村 3 ns
+塔奇拉 8 nrt
+塔姆 13 nrt
+塔姆沃 2 nr
+塔姆鲁 2 nr
+塔娜用 2 nr
+塔娜醒 3 nr
+塔孟良 2 nr
+塔安纳 2 nr
+塔察儿 6 nr
+塔尔 70 nrt
+塔尔伯特 17 nrt
+塔尔博特 5 nrt
+塔尔卡 4 nrt
+塔尔可 2 nrt
+塔尔图 12 nrt
+塔尔坝 3 ns
+塔尔塔 11 nrt
+塔尔寺 32 nr
+塔尔巴 24 nrt
+塔尔巴哈 3 nrt
+塔尔德 4 nrt
+塔尔斯基 10 nrt
+塔尔湖 6 ns
+塔尔牛 3 nr
+塔尔瓦 2 nrt
+塔尔蒂 5 nrt
+塔尔衮 2 nrt
+塔尔诺 2 nr
+塔尔贝 2 nr
+塔尔迪 3 nr
+塔尔马 2 ns
+塔尖 36 nr
+塔尼 3 nrt
+塔尼亚 19 ns
+塔尼语 5 nz
+塔山 109 ns
+塔崩 3 n
+塔巴 13 nrt
+塔布 27 nrt
+塔布依 2 nr
+塔布克 2 nrt
+塔布茏 2 nr
+塔希尔 16 nr
+塔希提 26 nr
+塔帕 20 nrt
+塔帕斯 5 nrt
+塔座 6 nz
+塔廖夫 4 nr
+塔式 19 nz
+塔式起重 3 nr
+塔形 21 n
+塔德 3 nrt
+塔德努 2 nr
+塔恩 2 nrt
+塔拉 47 nrt
+塔拉修克 2 nz
+塔拉哈西 2 ns
+塔拉基 3 nrt
+塔拉尔 10 nrt
+塔拉巴 3 nrt
+塔拉斯 5 nrt
+塔拉曼 2 nrt
+塔拉特 2 nrt
+塔拉瓦 15 nrt
+塔拉瓦奈 3 nrt
+塔拉瓦岛 3 nrt
+塔拉索夫 8 nrt
+塔斯 4 nrt
+塔斯之 3 nr
+塔斯卡 3 nrt
+塔斯曼 24 nrt
+塔斯社 93 nr
+塔斯科 13 nrt
+塔斯马尼亚 29 ns
+塔斯马尼亚岛 33 nrt
+塔斯马尼亚州 6 ns
+塔斯马尼安 2 nrt
+塔普 2 nrt
+塔普苏 2 ns
+塔曼温度 3 ns
+塔木德 11 nr
+塔杆 3 ns
+塔杜施 5 nr
+塔林 31 ns
+塔架 22 nz
+塔格 20 nrt
+塔格利 2 ns
+塔格峰 4 nr
+塔格特 2 nrt
+塔桥 11 ns
+塔楼 40 ns
+塔步 3 n
+塔比伊 2 nrt
+塔沃尔 3 nr
+塔河 37 ns
+塔河县 3 ns
+塔波乔 2 nr
+塔波尔 4 nr
+塔潘 3 nrt
+塔潘科 3 nr
+塔特 31 nrt
+塔特姆 6 nrt
+塔特怀勒 3 nrt
+塔特拉山 4 ns
+塔玛拉 6 nr
+塔瓦 12 nrt
+塔瓦尔 15 nrt
+塔瓦纳 2 nr
+塔瓦萨 3 nrt
+塔瓦诺 2 nr
+塔科拉 2 nrt
+塔科特 2 nrt
+塔科马 2 nz
+塔米 8 nrt
+塔索 13 nrt
+塔纳 4 nrt
+塔纳拉 10 nrt
+塔纳河 5 ns
+塔纳湖 4 ns
+塔纳苏加恩 2 ns
+塔纳诺 2 nr
+塔维亚尼 2 nrt
+塔维斯 3 nrt
+塔罗 4 nrt
+塔罗牌 3 nz
+塔胡穆 3 nr
+塔腊纳 4 nr
+塔茜娅 2 nr
+塔蓬博 2 nr
+塔西 12 ns
+塔诺 7 nrt
+塔诺河 2 ns
+塔贝斯 3 nrt
+塔贾隆 12 nr
+塔赫塔 4 nr
+塔身 3 n
+塔轮 7 nz
+塔达峰 3 nr
+塔迪兰 2 nr
+塔那摩 2 nrt
+塔那那利佛 24 nrt
+塔里 25 nrt
+塔里亚 2 ns
+塔里寒 2 nr
+塔里木 90 nr
+塔里木河 123 ns
+塔里木河流域 8 ns
+塔里木盆地 140 ns
+塔重修 4 nr
+塔门 20 ns
+塔阳汗 4 ns
+塔院 10 nz
+塔院寺 5 ns
+塔雷 2 nrt
+塔霍河 3 nr
+塔顶 94 ns
+塔马 2 ns
+塔马拉 6 nrt
+塔高 3 nrt
+塔鲁克 2 nr
+塔龙佳 3 nr
+塖 22 zg
+塘 875 j
+塘厦镇 3 v
+塘坝 15 ns
+塘堰 4 ns
+塘塞 3 ns
+塘岸 2 s
+塘村 3 ns
+塘栖 8 ns
+塘桥 4 ns
+塘桥镇 2 ns
+塘沽 240 ns
+塘沽区 15 ns
+塘沽港 6 ns
+塘泥 9 n
+塘湖 3 ns
+塘肥 3 ns
+塘边 30 s
+塘马 24 ns
+塘马村 3 ns
+塘鱼 3 n
+塘鹅 3 n
+塙 5 zg
+塚 4 zg
+塞 2906 v
+塞万提斯 35 nrt
+塞上 55 s
+塞上江南 9 ns
+塞上风 3 nr
+塞下曲 3 nr
+塞丽娜 3 nr
+塞井夷灶 3 nr
+塞井焚舍 3 nr
+塞伊 2 nrt
+塞伊汉 5 nr
+塞伦格 3 nr
+塞伦盖蒂 3 nr
+塞住 3 v
+塞佛特 9 nr
+塞佩姆 2 nr
+塞克 12 nrt
+塞克斯 7 nr
+塞克洛 4 nr
+塞克荷 3 nr
+塞入 115 v
+塞兰 2 ns
+塞内 25 s
+塞内加 3 ns
+塞内加尔 168 ns
+塞内加尔河 33 ns
+塞利 2 ns
+塞利努 2 nr
+塞利姆 6 nr
+塞利诺 2 nr
+塞努尔 2 nr
+塞努福 3 nr
+塞勒 2 nrt
+塞勒凯 2 nr
+塞勒姆 3 nr
+塞勒斯 2 nr
+塞北 70 ns
+塞北江南 4 ns
+塞北高原 3 ns
+塞卜泰 3 nr
+塞卡 3 nrt
+塞卡尔 10 nr
+塞卢斯 2 nr
+塞双屿 3 nr
+塞古 6 ns
+塞吉 4 nrt
+塞图巴尔 2 nrt
+塞塔 6 nrt
+塞塞 2 nrt
+塞塞严 8 nr
+塞外 189 s
+塞外风光 3 l
+塞夫 2 nrt
+塞夫尔 9 nr
+塞奇 4 nrt
+塞奇威 5 nr
+塞姆 7 nrt
+塞姆化 2 nr
+塞姆语 3 nr
+塞子 92 nr
+塞尔 41 nrt
+塞尔伯 3 nr
+塞尔先生 3 nr
+塞尔内 2 nrt
+塞尔吉 21 nr
+塞尔吉奥 4 nrt
+塞尔塔 14 nrt
+塞尔夫 2 nrt
+塞尔对偶 3 nr
+塞尔尼 4 nr
+塞尔帕 4 nr
+塞尔德 4 nrt
+塞尔扣 2 nr
+塞尔抢 2 nr
+塞尔日 2 nrt
+塞尔杜 3 nr
+塞尔杰 13 nr
+塞尔柯克 6 nr
+塞尔柱 94 nr
+塞尔特 2 nrt
+塞尔玛 8 nrt
+塞尔瓦 2 nrt
+塞尔纳 3 nrt
+塞尔维 12 nr
+塞尔维亚 261 nrt
+塞尔维亚人 64 nrt
+塞尔维亚共和国 22 ns
+塞尔维亚族 10 nz
+塞尔维亚民主党 2 nt
+塞尔维亚社会党 2 nt
+塞尔维亚语 7 nz
+塞尔蒂 2 nrt
+塞尔跳 2 nr
+塞尔达 3 nrt
+塞尔马 2 ns
+塞尔默群 3 nr
+塞尚 24 nrt
+塞尺 3 nr
+塞尼山 2 ns
+塞岛 12 ns
+塞巴斯蒂 2 nrt
+塞巴斯蒂安 7 nrt
+塞布河 2 ns
+塞康第 2 nr
+塞得港 27 ns
+塞德 3 nrt
+塞德尔 2 nr
+塞德巴 2 nr
+塞德莱 5 nr
+塞思黑 4 nr
+塞恩城 2 nr
+塞恩斯伯里 2 nrt
+塞托蒂 3 nrt
+塞拉 50 nrt
+塞拉利昂 65 ns
+塞拉斯 14 nrt
+塞拉特 4 nrt
+塞拉芬 2 nr
+塞拉西 10 ns
+塞拉里昂 7 nrt
+塞提夫 2 nr
+塞擦音 11 n
+塞文河 5 nr
+塞斯 14 nrt
+塞斯顿 3 nrt
+塞族 31 nz
+塞普路斯 3 nrt
+塞曼 49 nrt
+塞曼效应 3 nr
+塞林格 8 nr
+塞格德 3 nr
+塞格雷 2 nr
+塞梅尔 3 nr
+塞法杰 4 nr
+塞泽尔 4 nr
+塞浦路斯 155 ns
+塞浦路斯人 2 nz
+塞浦路斯共和国 37 ns
+塞浦路斯岛 12 ns
+塞满 96 nr
+塞牙 8 ns
+塞牙缝 3 n
+塞特 14 nrt
+塞特贝 2 nr
+塞特郡 3 nr
+塞班 19 nrt
+塞班岛 3 ns
+塞瑟布尔 2 nrt
+塞瓦 5 nrt
+塞瓦斯托波尔 21 nrt
+塞甘蒂 3 nr
+塞米蒂 2 nrt
+塞紧 3 v
+塞纳 15 nrt
+塞纳尔 3 nr
+塞纳河 69 ns
+塞纳河畔 16 ns
+塞纳特 3 nr
+塞纳省 2 ns
+塞维利 6 ns
+塞维利亚 77 ns
+塞维利亚队 5 nt
+塞维奇 2 nr
+塞维斯 2 nr
+塞维里亚 3 nrt
+塞维里诺 4 nrt
+塞维鲁 7 nr
+塞缪尔 20 nr
+塞罕坝 3 nrt
+塞罗 16 nrt
+塞翁之马 3 nr
+塞翁失马 10 i
+塞翁得马 3 ns
+塞耳偷铃 3 i
+塞耳盗钟 3 i
+塞舌尔 105 ns
+塞舌尔共和国 3 ns
+塞苍冥 2 nr
+塞茨 2 nrt
+塞药 3 n
+塞莫斯 32 nrt
+塞莱 2 nrt
+塞莱什 3 nrt
+塞莱尼 13 nr
+塞莱斯 8 nr
+塞莱斯特 2 nrt
+塞菲里 2 nrt
+塞萨尔 17 nr
+塞萨洛 3 nr
+塞萨洛尼基 12 nrt
+塞蒂 5 nrt
+塞蚊亚 2 nr
+塞西勒 2 nr
+塞西尔 8 nr
+塞规 2 nr
+塞诺伊 3 nrt
+塞诺语 2 nr
+塞贝克 14 nrt
+塞责 3 v
+塞车 55 ns
+塞进 3 nr
+塞进去 3 nr
+塞进来 3 nr
+塞进陈 2 nr
+塞门 9 ns
+塞闭 3 v
+塞雷尔 6 nr
+塞韦林 2 nr
+塞音 23 nr
+塞饱 3 nr
+塞马沃 2 nrt
+塞黑队 3 nr
+塠 64 zg
+塢 4 zg
+塨 9 zg
+塩 37 zg
+填 1363 v
+填上 3 v
+填上去 3 v
+填上来 3 v
+填个 3 b
+填交 3 v
+填充 231 v
+填充料 8 n
+填充测验 3 n
+填充片段 3 n
+填充物 37 n
+填充色 3 n
+填充题 3 n
+填入 3 v
+填具 3 v
+填写 518 v
+填写内容 3 n
+填写数字 3 n
+填写表格 3 n
+填列 3 v
+填到 3 v
+填制 28 v
+填发 3 v
+填土 3 v
+填土机 3 n
+填坑满谷 3 i
+填埋 22 v
+填埋场 4 n
+填堵 3 v
+填塞 36 v
+填塞料 3 n
+填好 3 v
+填字 3 nz
+填字游戏 3 n
+填实 8 v
+填实起来 3 l
+填平 54 n
+填平补齐 5 i
+填开 3 v
+填得 3 v
+填志愿 3 v
+填息 3 v
+填成 3 v
+填房 7 n
+填报 1366 v
+填报数字 3 n
+填报数据 3 n
+填报自愿 3 i
+填料 37 n
+填料函 3 n
+填方 2 n
+填方路基 3 nz
+填有 3 v
+填权 3 v
+填权行情 3 n
+填来填去 3 i
+填沟壑 2 i
+填海 3 v
+填海造地 3 n
+填涂 53 v
+填满 131 v
+填点 3 n
+填用 3 v
+填空 101 v
+填空补缺 3 l
+填空题 3 n
+填筑 17 v
+填答 7 v
+填缝剂 3 n
+填色 7 n
+填街塞巷 2 nz
+填补 587 v
+填补空白 3 l
+填补空缺 3 l
+填表 39 v
+填表人 3 n
+填表格 3 n
+填装 3 v
+填记 3 v
+填词 70 n
+填词人 3 n
+填起来 3 v
+填过 3 v
+填过去 3 v
+填过来 3 v
+填送 3 v
+填铇 3 vn
+填隙 3 n
+填饱 3 v
+填鸭 5 nz
+填鸭式 8 b
+塬 186 ng
+塯 7 zg
+塴 72 zg
+塵 10 zg
+塶 2 zg
+塷 2 zg
+塸 4 zg
+塻 5 zg
+塽 493 zg
+塾 47 n
+塾师 21 n
+墀 14 g
+墁 6 zg
+境 3916 s
+境像 3 n
+境内 6247 s
+境内外 44 s
+境况 246 n
+境地 693 s
+境域 17 n
+境外 744 s
+境外游 3 n
+境界 1737 n
+境肚 3 n
+境象 3 n
+境过情迁 3 n
+境遇 175 n
+墅 18 x
+墉 15 g
+墉桥区 3 nr
+墊 18 zg
+墍 233 zg
+墎 4 zg
+墏 2 zg
+墑 5 zg
+墒 179 zg
+墒情 7 n
+墓 6535 n
+墓中人 3 n
+墓区 24 n
+墓园 67 n
+墓地 502 n
+墓场 25 n
+墓坑 23 n
+墓子 3 n
+墓室 692 n
+墓志 47 n
+墓志文 3 n
+墓志铭 67 n
+墓木 3 n
+墓木已拱 3 n
+墓石 8 n
+墓碑 224 n
+墓碣 3 n
+墓祭 3 n
+墓穴 277 n
+墓群 67 n
+墓茔 3 n
+墓葬 665 n
+墓葬品 5 n
+墓葬群 3 n
+墓表 4 n
+墓道 412 n
+墓门 3 n
+墕 7 zg
+墖 43 zg
+増 3 zg
+墙 5461 n
+墙上 1562 s
+墙上平架 3 n
+墙上泥皮 3 n
+墙体 51 n
+墙体开裂 3 i
+墙倒众人推 9 i
+墙前 3 s
+墙围子 3 n
+墙地砖 3 n
+墙垛 5 n
+墙垣 47 n
+墙基 15 n
+墙壁 975 s
+墙外汉 3 n
+墙头 194 s
+墙头草 7 n
+墙头诗 3 n
+墙头马上 7 i
+墙子 5 n
+墙宇 3 n
+墙布 2 n
+墙式 7 n
+墙报 15 n
+墙有耳 3 n
+墙板 15 n
+墙根 123 n
+墙根儿 8 n
+墙毯 3 n
+墙洞 31 n
+墙皮 10 n
+墙砖 10 n
+墙篱 3 n
+墙纸 8 n
+墙缝 20 n
+墙脚 65 n
+墙花路柳 3 n
+墙花路草 3 n
+墙裙 3 n
+墙角 378 n
+墙角处 3 s
+墙角落 8 n
+墙跟 3 n
+墙身 3 n
+墙边 150 s
+墙里墙外 3 i
+墙门 12 n
+墙隅 3 n
+墙面 64 n
+墙面抹灰 3 i
+墙面漆 3 n
+墙面砖 3 n
+墙面而立 3 i
+墙风壁耳 3 i
+墙高基下 3 n
+墚 2 g
+墛 12 zg
+墜 359 zg
+墝 18 zg
+增 3054 v
+增上 3 v
+增为 3 v
+增为三倍 3 l
+增亏 3 v
+增产 823 v
+增产增值 3 n
+增产增收 3 n
+增产报国 3 n
+增产率 3 n
+增产节约 3 n
+增产量 3 n
+增人 3 n
+增修 3 v
+增借 3 v
+增值 590 v
+增值率 6 n
+增值税 123 n
+增值税率 2 n
+增值额 2 n
+增光 24 v
+增光添彩 5 l
+增兵 46 v
+增减 220 v
+增减量 3 n
+增减额 3 n
+增函数 2 n
+增刊 14 v
+增列 3 v
+增创 3 v
+增删 33 v
+增删额 3 v
+增利 3 v
+增到 3 v
+增力桥基 3 nz
+增加 16195 v
+增加一倍 3 l
+增加三倍 3 l
+增加值 1861 n
+增加出口 3 n
+增加利润 3 n
+增加收入 3 n
+增加数 3 n
+增加率 3 n
+增加量 4 n
+增加额 34 n
+增势 13 n
+增印 3 v
+增压 117 v
+增压器 11 n
+增压泵 3 n
+增压风机 3 n
+增厚 87 v
+增发 405 v
+增场 3 n
+增城 9 v
+增城县 3 ns
+增城市 2 n
+增塑作用 3 n
+增塑剂 30 n
+增多 1798 v
+增大 1541 v
+增大丸 3 nz
+增子 3 n
+增容 9 v
+增容作用 3 n
+增容费 3 n
+增宽 34 v
+增密工艺 3 n
+增幅 359 n
+增广 10 v
+增广见闻 3 n
+增建 45 v
+增开 90 v
+增强 4300 v
+增强体质 3 n
+增强党性 3 n
+增强器 15 n
+增强团结 3 n
+增强型 40 n
+增强塑料 3 n
+增强子 3 n
+增强性 3 n
+增强支抗 3 n
+增强活力 3 n
+增强版 3 n
+增征 3 v
+增感剂 2 n
+增拨 12 v
+增捕增诉 3 n
+增损 3 v
+增援 390 v
+增援部队 3 n
+增支 4 v
+增收 693 v
+增收节支 22 n
+增效 24 v
+增效剂 5 n
+增效益 3 n
+增斜 3 v
+增方 3 n
+增日 3 n
+增暖 4 v
+增殖 643 v
+增殖性 14 n
+增殖率 4 n
+增殖税 3 n
+增殖腺 3 n
+增氧机 2 n
+增派 75 n
+增液汤 2 n
+增添 1462 v
+增添光彩 3 l
+增添情趣 3 l
+增添设备 3 l
+增温 36 v
+增湿 3 v
+增湿作用 3 n
+增溶 3 v
+增溶作用 3 n
+增溶参数 3 n
+增班 3 v
+增班数 3 n
+增生 366 v
+增生扩散 3 n
+增生症 3 n
+增生算子 3 n
+增田町 3 ns
+增白 39 v
+增白剂 51 n
+增盈 3 v
+增益 90 n
+增益值 3 n
+增益恢复 3 l
+增益道 3 v
+增砖添瓦 3 l
+增税 3 v
+增稠剂 73 n
+增算子 3 n
+增纳 3 v
+增给 3 v
+增编 19 v
+增缴 3 v
+增置 3 v
+增聘 3 v
+增至 655 v
+增色 45 n
+增色添彩 3 l
+增薪 3 v
+增补 222 v
+增补剂 3 n
+增补本 3 n
+增订 39 v
+增订本 18 n
+增记 3 v
+增设 1408 v
+增诉 3 v
+增调 15 v
+增购 23 v
+增贷 3 n
+增资 127 v
+增辉 15 v
+增辟 19 v
+增进 603 v
+增进友谊 3 nz
+增进感情 3 n
+增进法 3 n
+增送 3 v
+增选 125 v
+增透膜 3 n
+增递 3 v
+增速 412 v
+增配 4 v
+增重 16 v
+增量 323 n
+增量调制 3 v
+增长 20465 v
+增长势头 3 n
+增长幅度 3 l
+增长期 12 n
+增长极 9 n
+增长极论 3 n
+增长点 198 n
+增长率 935 n
+增长速度 3 n
+增长量 17 n
+增长额 14 n
+增雨 7 v
+增韧 4 nz
+增韧剂 3 n
+增音机 10 n
+增香剂 2 n
+增高 529 v
+增高药 3 n
+增高鞋 3 n
+墟 387 ng
+墟沟 2 ns
+墠 435 zg
+墡 28 zg
+墣 5 zg
+墤 43 zg
+墥 4 zg
+墦 387 zg
+墧 17 zg
+墨 1243 nr
+墨丘利 5 nr
+墨刑 3 n
+墨勒根 4 ns
+墨华亭 2 nr
+墨卡托 10 nr
+墨吏 3 nr
+墨囊 3 n
+墨国 3 ns
+墨城 23 ns
+墨子 110 n
+墨子或 4 nr
+墨子泣丝 3 n
+墨子贵 2 nr
+墨守 3 nr
+墨守成 4 nr
+墨守成法 3 nr
+墨守成规 28 nr
+墨守盛 2 nr
+墨守陈规 3 nr
+墨宝 39 nr
+墨客 5 nr
+墨家 88 n
+墨尔兹 2 nr
+墨尔本 123 ns
+墨尔本大学 5 nt
+墨尔本市 4 ns
+墨尔根 19 ns
+墨尔钵 3 nr
+墨忒耳 2 nr
+墨斗 15 nr
+墨斗鱼 4 n
+墨旱莲 3 nr
+墨晶 8 nr
+墨杜萨 10 nr
+墨梅图 5 nr
+墨水 128 ns
+墨水儿 3 nr
+墨水台 3 ns
+墨水池 3 nr
+墨水瓶 12 nr
+墨水盒 3 n
+墨水笔 3 n
+墨水罐 3 n
+墨汁 77 nr
+墨汁未干 3 i
+墨江 6 ns
+墨江哈尼族自治县 3 ns
+墨池 9 ns
+墨沈沈 3 nr
+墨洛尼 5 nr
+墨洛温 17 nr
+墨海书 9 nr
+墨渍 4 n
+墨点 3 n
+墨玉 10 nr
+墨玉县 3 nr
+墨玉河 2 nr
+墨玉衔 2 nr
+墨画 3 n
+墨盒 41 n
+墨石 3 nr
+墨砚 2 nr
+墨离 3 n
+墨突不黔 3 nr
+墨竹工卡 4 ns
+墨竹江卡 3 ns
+墨笔 34 n
+墨笔画 4 n
+墨粉 3 n
+墨索里尼 192 nrt
+墨累 2 nr
+墨累河 22 ns
+墨线 26 n
+墨经 3 n
+墨绳 3 ns
+墨绿 36 nr
+墨绿色 63 nr
+墨缘汇 2 nr
+墨脱 54 nrt
+墨脱县 11 ns
+墨色 51 n
+墨色清 2 nr
+墨菊 3 nr
+墨萨 2 ns
+墨西卡利 6 ns
+墨西哥 1301 ns
+墨西哥人 29 nrt
+墨西哥合众国 4 ns
+墨西哥城 176 ns
+墨西哥州 6 ns
+墨西哥市 3 ns
+墨西哥政府 7 nt
+墨西哥湾 167 ns
+墨西哥队 4 nt
+墨西拿 22 nr
+墨角藻 3 nr
+墨辊 2 n
+墨迹 137 n
+墨迹未干 13 i
+墨迹测验 3 n
+墨里勒 2 nr
+墨镜 1146 n
+墨香斋 3 nr
+墨鱼 296 n
+墨鸦 3 n
+墨鸭 3 n
+墨黑 32 ns
+墨黑黑 3 ns
+墨龙睛 2 nr
+墩 1585 v
+墩台 284 n
+墩墩实实 3 n
+墩子 31 n
+墩布 3 n
+墩距 3 n
+墬 4 zg
+墭 19 zg
+墮 703 zg
+墰 34 zg
+墳 2 zg
+墵 4 zg
+墶 3 zg
+墷 12 zg
+墸 11 zg
+墹 5 zg
+墺 12 zg
+墻 3 zg
+墼 16 x
+墽 37 zg
+墿 69 zg
+壀 2 zg
+壁 2300 n
+壁上 671 s
+壁上观 4 n
+壁厢 47 n
+壁垒 164 n
+壁垒分明 3 n
+壁垒森严 6 i
+壁孔 3 n
+壁室 3 n
+壁式 9 n
+壁报 7 n
+壁报比赛 3 n
+壁挂 23 n
+壁挂式 3 n
+壁挂炉 3 n
+壁板 13 n
+壁柜 7 n
+壁柜门 3 n
+壁柱 4 n
+壁橱 18 n
+壁毯 35 n
+壁沿 3 s
+壁泉 3 n
+壁洞 3 n
+壁灯 18 n
+壁炉 42 n
+壁炉台 3 n
+壁炉架 3 n
+壁玉 3 n
+壁球 12 n
+壁画 1046 n
+壁画墓 3 n
+壁立 39 v
+壁立千仞 6 l
+壁纸 35 n
+壁纸漆 3 n
+壁纸酷 3 n
+壁纸集 3 n
+壁虎 79 n
+壁虱 3 n
+壁里安柱 3 n
+壁钟 3 n
+壁间蛇影 3 n
+壁面 33 n
+壁饰 3 n
+壁龛 24 n
+壂 108 zg
+壃 48 zg
+壄 18 zg
+壅 98 zg
+壅塞 44 v
+壅蔽 3 v
+壆 5 zg
+壇 238 zg
+壈 16 zg
+壊 145 zg
+壋 9 zg
+壌 7 zg
+壍 11 zg
+壎 9 zg
+壑 179 ng
+壒 142 zg
+壓 25 zg
+壕 411 n
+壕堑 25 n
+壕堑战 3 n
+壕沟 153 n
+壕沟战 3 n
+壖 2 zg
+壘 84 zg
+壙 26 zg
+壜 3 zg
+壤 274 n
+壤中流 3 n
+壤土 86 n
+壤塘 3 n
+壤塘县 2 ns
+士 2429 n
+士为知己 3 nr
+士为知己者死 16 i
+士义 5 n
+士人 183 n
+士伍 3 n
+士众 2 n
+士兵 3681 n
+士兵证 3 nr
+士农工商 3 n
+士别三日 5 nz
+士别多日 3 nrt
+士力 2 n
+士力架 3 n
+士卒 301 nr
+士可杀不 3 l
+士吏 3 n
+士多啤梨 3 n
+士大夫 295 nr
+士女 14 n
+士子 94 n
+士官 463 n
+士官兵 3 nr
+士官长 3 nr
+士徒 3 n
+士心 5 n
+士敏土 3 nr
+士族 230 n
+士林 74 nr
+士林中 21 nr
+士林区 2 nr
+士林国中 3 nr
+士林国小 3 nr
+士死知己 3 i
+士民 74 n
+士气 724 n
+士气受挫 3 l
+士气涣散 3 i
+士绅 176 n
+士著 3 n
+士长剑 2 nr
+士闻 2 n
+士饱马腾 2 nz
+士马 9 n
+壬 176 m
+壬丑 3 m
+壬亥 3 m
+壬午 21 m
+壬午年 2 m
+壬午日 2 m
+壬卯 3 m
+壬基 3 ns
+壬子 9 m
+壬子年 257 m
+壬子癸丑 3 m
+壬寅 13 m
+壬巳 3 m
+壬戌 11 m
+壬未 3 m
+壬炔 3 n
+壬烯 3 n
+壬烷 3 n
+壬申 15 m
+壬辰 14 m
+壬酉 3 m
+壬酮 3 n
+壬酸 3 n
+壬醇 3 n
+壬醛 3 n
+壮 1577 v
+壮丁 120 nz
+壮丰安 3 nz
+壮丽 1596 a
+壮举 140 v
+壮乡 3 n
+壮伟 5 a
+壮健 64 a
+壮劳力 7 l
+壮发冲冠 3 nz
+壮围 3 n
+壮士 239 n
+壮士断腕 7 n
+壮士解腕 3 n
+壮大 929 a
+壮大力量 3 nz
+壮大声势 3 i
+壮大队伍 3 n
+壮夫 2 n
+壮夫不为 3 i
+壮威 3 nz
+壮实 67 a
+壮工 3 n
+壮年 92 t
+壮年人 8 n
+壮年时期 3 t
+壮心 4 a
+壮心不已 9 i
+壮志 68 n
+壮志凌云 15 nz
+壮志凌霄 3 i
+壮志未酬 18 i
+壮怀 3 v
+壮怀激烈 12 i
+壮戏 3 n
+壮族 994 nz
+壮歌 12 n
+壮气凌云 3 i
+壮气吞牛 3 i
+壮汉 133 t
+壮润 3 nz
+壮烈 235 a
+壮烈牺牲 3 i
+壮男 3 n
+壮盛 3 nz
+壮硕 13 a
+壮秧 3 v
+壮美 61 nz
+壮胆 81 ad
+壮苗 8 n
+壮行 7 v
+壮观 483 a
+壮观霉素 3 n
+壮语 151 nz
+壮起来 3 l
+壮锦 7 n
+壮阔 198 a
+壮阳 27 nz
+壮阳品 3 n
+壮阳药 3 nz
+壮骨 7 n
+声 15713 n
+声东击西 200 n
+声严色厉 3 i
+声乐 256 n
+声乐家 3 n
+声乐系 8 n
+声价 13 n
+声价不凡 3 l
+声价十倍 3 l
+声优 3 n
+声位笔 3 n
+声信 3 n
+声信台 3 n
+声像 50 n
+声光 36 n
+声光化电 7 n
+声光报警 3 n
+声光效应 3 n
+声光效果 3 n
+声光电 6 n
+声全息 3 n
+声全息图 3 n
+声共振 3 i
+声功率 3 n
+声动梁尘 3 n
+声势 749 n
+声势显赫 3 l
+声势汹汹 3 i
+声势浩大 347 i
+声区 3 n
+声华行实 3 n
+声卡 2 n
+声压 32 n
+声压强 3 n
+声压级 11 n
+声名 345 n
+声名在外 3 i
+声名大噪 13 i
+声名大振 3 i
+声名显赫 20 l
+声名狼籍 2 n
+声名狼藉 45 i
+声名远播 19 l
+声名鹊起 12 i
+声呐 3 n
+声响 2029 n
+声嘶力竭 90 i
+声地 3 n
+声场 18 n
+声域 3 n
+声声 115 n
+声声慢 3 l
+声如洪钟 20 l
+声如金石 3 i
+声如银铃 3 i
+声威 93 n
+声威大振 3 l
+声威大震 3 n
+声学 408 n
+声学家 2 n
+声学环境 3 n
+声宝 3 n
+声容 3 n
+声导 3 n
+声导纳 3 n
+声尖叫 3 i
+声屏 2 n
+声希味淡 3 l
+声带 55 n
+声应气和 3 i
+声应气求 3 n
+声张 126 n
+声强 22 n
+声强级 3 n
+声强计 3 i
+声形 3 n
+声律 34 n
+声息 404 n
+声情 3 n
+声情并茂 20 i
+声扬 2 v
+声抗 3 v
+声报 3 n
+声振寰宇 3 nz
+声振屋瓦 3 i
+声振林木 3 n
+声控 7 n
+声援 290 n
+声效 3 n
+声数码 3 n
+声旁 8 n
+声明 2689 n
+声明书 4 n
+声明者 3 n
+声显 3 v
+声显集成 3 n
+声望 302 n
+声望值 3 n
+声望去 3 i
+声桥 3 n
+声母 116 n
+声气 71 n
+声气相投 3 i
+声气相求 3 i
+声气相通 3 i
+声求气应 3 i
+声波 270 n
+声波测井 3 n
+声泪 3 n
+声泪俱下 43 i
+声浪 60 n
+声源 3 n
+声画俱全 3 i
+声码 3 n
+声称 747 n
+声符 3 n
+声级 6 n
+声级计 3 n
+声纳 145 n
+声纳兵 3 n
+声纳遥感 3 n
+声纹 3 n
+声纹识别 3 n
+声线 3 n
+声罪致讨 3 i
+声耦合 3 z
+声能 3 n
+声能学 3 n
+声能比 3 n
+声能通量 3 n
+声腔 109 n
+声色 93 n
+声色俱全 3 i
+声色俱厉 75 i
+声色犬马 18 n
+声色狗马 3 i
+声色货利 3 n
+声觉 3 n
+声言 99 n
+声誉 574 n
+声誉不衰 3 i
+声誉卓着 3 i
+声誉卓著 3 i
+声誉正隆 3 i
+声誉鹊起 14 i
+声讨 120 v
+声讯 40 n
+声讯台 4 n
+声调 365 n
+声谱 3 n
+声谱仪 3 n
+声象 3 n
+声象记忆 3 n
+声轨 3 n
+声辩 10 n
+声速 128 n
+声道 1414 n
+声部 83 n
+声门 27 n
+声闻 3 n
+声闻过情 3 n
+声阻 3 n
+声阻抗 3 n
+声阻抗差 3 n
+声障 3 n
+声震中外 3 l
+声震寰宇 4 nz
+声霸卡 3 n
+声音 10340 n
+声音文件 3 n
+声音洪亮 3 n
+声音笑貌 7 n
+声韵 46 n
+声韵学 2 n
+声频 39 n
+壳 2078 n
+壳体 105 n
+壳儿 3 n
+壳冠 3 n
+壳多糖 3 n
+壳多糖酶 3 nz
+壳子 48 n
+壳牌 15 nz
+壳牌石油公司 8 nt
+壳状牙 3 n
+壳糖 3 n
+壳糖胺 3 nz
+壳聚糖 3 n
+壳菜 3 n
+壳质 11 n
+壳郎猪 3 n
+壳里 3 n
+壳顶 3 n
+壶 1392 q
+壶中天地 3 ns
+壶中日月 3 ns
+壶中物 3 n
+壶关 32 ns
+壶关县 7 ns
+壶内 3 ns
+壶卢 3 ns
+壶口 14 ns
+壶口瀑布 13 ns
+壶嘴 34 ns
+壶外 3 ns
+壶天日月 3 n
+壶底 3 ns
+壶把 3 n
+壶流河 2 ns
+壶浆塞道 3 n
+壶状 3 n
+壶盖 16 ns
+壶胆 3 n
+壶菌 3 n
+壶里 3 ns
+壶里乾坤 3 nz
+壷 5 zg
+壸 4 zg
+壸浆箪食 3 vn
+壹 31 zg
+壹一 2 m
+壹万 3 m
+壹亿元 2 m
+壹仟 3 m
+壹份 3 m
+壹倡三叹 3 v
+壹元 3 m
+壹关县 3 v
+壹分 3 m
+壹号 4 m
+壹套 3 m
+壹年 3 m
+壹百万两 2 m
+壹角 3 m
+壹败涂地 3 z
+夁 2 zg
+夂 53 zg
+处 24967 n
+处世 140 v
+处世之道 3 i
+处世哲学 3 i
+处之泰然 13 i
+处乱不惊 5 i
+处事 168 v
+处于 6122 v
+处于下风 3 l
+处以 246 v
+处以斩首 3 i
+处决 179 v
+处分 973 n
+处分权 3 n
+处分法 3 n
+处刑 42 v
+处到 3 v
+处变不惊 27 l
+处在 762 v
+处堂燕雀 3 i
+处堂燕鹊 3 n
+处境 886 n
+处士 43 n
+处处 1402 v
+处处作对 3 l
+处处设防 3 i
+处处长 3 v
+处女 135 n
+处女作 59 n
+处女地 31 n
+处女峰 3 n
+处女座 3 n
+处女率 3 n
+处女秀 3 i
+处女群岛 3 n
+处女膜 14 n
+处女航 3 n
+处女身 3 n
+处子 23 n
+处子秀 3 n
+处子站 3 n
+处实效功 3 n
+处室 19 n
+处尊居显 3 n
+处得 3 v
+处得来 3 v
+处心积虑 109 i
+处惊不变 3 i
+处所 158 v
+处所词 3 i
+处斩 3 v
+处断 3 v
+处方 334 n
+处方权 2 n
+处方药 75 n
+处暑 8 v
+处死 572 v
+处死刑 3 n
+处治 73 v
+处理 10840 v
+处理不当 47 l
+处理事件 17 n
+处理事务 3 n
+处理函数 2 n
+处理剂 6 n
+处理单元 22 n
+处理厂 49 n
+处理品 4 n
+处理器 737 n
+处理场 4 n
+处理均方 3 n
+处理完毕 3 i
+处理工艺 3 n
+处理意见 3 n
+处理方式 3 n
+处理机 134 n
+处理机对 3 l
+处理权 5 n
+处理率 9 n
+处理程序 31 n
+处理结果 3 n
+处理表 3 n
+处理费 17 n
+处理软件 3 l
+处理过程 16 l
+处理速度 26 n
+处理部件 3 n
+处理量 4 n
+处理错误 4 n
+处男 3 n
+处突 4 vn
+处级 95 v
+处罚 1273 v
+处罚权 3 n
+处罚法 7 n
+处罚金 3 n
+处置 1082 v
+处置权 19 n
+处置法 3 n
+处警 3 v
+处身 78 v
+处过 3 v
+处长 1341 v
+处高临深 3 i
+处高鹜远 3 l
+夆 19 zg
+备 2284 v
+备下 3 v
+备不住 8 v
+备件 37 n
+备件箱 3 n
+备份 116 n
+备份文件 4 n
+备位充数 3 n
+备办 48 v
+备勤 2 n
+备卡 3 n
+备取 4 v
+备取生 3 n
+备受 408 v
+备受凌辱 3 i
+备受瞩目 3 i
+备品 4 n
+备品备件 3 n
+备多力分 3 n
+备尝 3 v
+备尝艰苦 3 i
+备尝艰辛 3 i
+备尝辛苦 3 i
+备巧 3 n
+备当忧患 3 i
+备忘 12 v
+备忘录 214 n
+备感 21 n
+备战 380 v
+备战状态 3 n
+备抵 5 v
+备抵折旧 3 z
+备播 3 vn
+备料 17 n
+备料场 3 n
+备有 311 v
+备查 89 vn
+备案 3491 n
+备案制 4 n
+备案号 3 n
+备注 54 v
+备注栏 3 n
+备灾 4 vn
+备用 208 v
+备用品 3 n
+备用机 3 n
+备用系统 2 n
+备用轮胎 3 n
+备用金 4 n
+备索 3 v
+备置 3 v
+备考 262 v
+备而不用 10 i
+备耕 12 v
+备胎 18 n
+备至 35 v
+备荒 28 v
+备要 7 v
+备解素 3 n
+备课 64 v
+备课室 3 n
+备课组 3 n
+备货 8 n
+备足 14 v
+备车 3 n
+备车前往 3 i
+备车前来 3 i
+备述 3 v
+备选 63 v
+备选语料 3 n
+备降 258 v
+备齐 22 v
+夈 127 zg
+変 936 zg
+夊 1170 zg
+夋 828 zg
+夌 542 zg
+复 6297 v
+复业 7 n
+复义 3 n
+复习 1804 v
+复习内容 3 n
+复习功课 3 n
+复习提纲 3 n
+复习方法 3 n
+复习班 5 n
+复习考试 3 n
+复习计划 3 n
+复习资料 7 n
+复习题 3 n
+复交 52 v
+复亩珍 3 nz
+复仇 403 v
+复仇主义 3 n
+复仇者 26 n
+复仇记 3 n
+复仇雪耻 3 n
+复仞年如 3 v
+复以百万 3 l
+复件 3 n
+复任 3 v
+复会 13 v
+复位 175 v
+复位开关 3 nt
+复信 33 v
+复健 3 a
+复元 27 nz
+复八线 3 nz
+复关 3 v
+复兴 787 a
+复兴中学 3 nt
+复兴乡 3 ns
+复兴党 41 nt
+复兴剧校 3 nt
+复兴剧艺 3 nt
+复兴区 3 nt
+复兴号 3 n
+复兴基地 3 nz
+复兴岗 3 ns
+复兴岛 3 ns
+复兴工商 3 nt
+复兴广播 3 nz
+复兴报 5 nt
+复兴社 3 nt
+复兴社会党 2 nt
+复兴者 3 n
+复兴路 6 nt
+复兴门 11 ns
+复兴门外 3 l
+复兴高中 3 nt
+复写 7 v
+复写纸 8 n
+复决 3 v
+复决权 3 v
+复出 221 v
+复函 18 v
+复分数 3 n
+复分析 3 l
+复刊 42 v
+复列 3 v
+复利 37 a
+复利率 3 n
+复制 670 v
+复制件 5 n
+复制再生 3 l
+复制出 3 v
+复制到 3 v
+复制品 62 n
+复制器 3 n
+复制基因 3 n
+复制子 3 n
+复制技术 2 n
+复制本 2 l
+复制眼 3 l
+复制磁盘 3 n
+复制粘贴 3 n
+复刻 3 a
+复刻版 3 n
+复华 10 nz
+复印 181 v
+复印件 286 n
+复印室 3 nt
+复印机 58 n
+复印纸 12 nz
+复卷机 3 n
+复原 331 n
+复原乳 3 nz
+复发 325 v
+复发性 3 n
+复发率 27 n
+复变 98 v
+复古 126 vn
+复古主义 3 nz
+复古风 3 nz
+复句 2 n
+复叶 136 n
+复合 924 v
+复合体 39 n
+复合元音 4 n
+复合化 2 nt
+复合句 10 n
+复合地板 3 n
+复合型 107 b
+复合墙 3 n
+复合家庭 3 nt
+复合布 3 n
+复合式 41 b
+复合弓 2 nz
+复合性 9 b
+复合控制 2 nz
+复合机 3 n
+复合材料 187 n
+复合板 2 n
+复合树脂 3 l
+复合物 53 nt
+复合矩阵 3 nz
+复合管 3 n
+复合肥 14 n
+复合肥料 12 l
+复合膜 3 n
+复合袋 3 n
+复合词 18 n
+复合量词 3 n
+复合门 3 n
+复合靶 3 n
+复合音 3 n
+复名 3 v
+复名数 3 n
+复名词 3 n
+复吸 2 v
+复员 133 n
+复员令 3 n
+复员兵 6 nt
+复员军人 22 n
+复员证 3 n
+复员费 4 n
+复命 105 v
+复喷 3 v
+复国 105 ns
+复国主义 40 nz
+复垦 39 v
+复壁 3 n
+复壮 4 a
+复姓 70 n
+复婚 34 v
+复子明辟 3 v
+复字键 3 n
+复学 24 n
+复审 61 v
+复层 4 n
+复工 12 v
+复建 36 v
+复建中心 3 nt
+复式 101 n
+复式吊杆 3 n
+复式房 3 n
+复式楼 3 v
+复式票 3 n
+复式簿记 3 v
+复归 127 v
+复形 5 n
+复得 3 v
+复性 20 n
+复折射率 3 n
+复折屋顶 3 n
+复排 2 v
+复摆 17 v
+复政 3 v
+复数 171 n
+复数形 3 n
+复数的模 3 l
+复新 4 v
+复新剂 3 nz
+复方 188 n
+复方脑栓 2 n
+复旦 240 nz
+复旦大学 393 nt
+复旦桥 3 ns
+复旧 51 a
+复旧如初 3 l
+复旧观 6 l
+复明 303 v
+复星 42 nz
+复本 45 a
+复机 3 n
+复杂 6117 a
+复杂事物 3 n
+复杂劳动 5 l
+复杂化 116 v
+复杂型 3 n
+复杂多变 3 l
+复杂岩性 3 n
+复杂度 10 n
+复杂性 307 n
+复杂程度 3 n
+复权 3 v
+复极化 3 n
+复极化比 3 n
+复染 3 v
+复查 265 vn
+复查组 2 n
+复校 3 n
+复核 66 v
+复根 3 nz
+复检 69 v
+复次 3 b
+复比 3 v
+复比例 3 n
+复泳 3 vn
+复活 270 vn
+复活日 3 t
+复活节 73 n
+复活节岛 41 n
+复流形 3 n
+复测 3 v
+复涵 3 v
+复混肥 3 n
+复溜 3 a
+复滑车 3 n
+复燃 14 v
+复现 28 v
+复生 114 v
+复用 89 v
+复用器 6 n
+复用技术 2 n
+复电 3 v
+复盆子 3 l
+复盐 10 n
+复盖 2 v
+复盘 5 v
+复目 3 n
+复眼 101 a
+复礼克己 3 n
+复种 27 v
+复种指数 32 l
+复种面积 3 l
+复算 3 v
+复籍 3 n
+复线 325 n
+复线桥 34 n
+复置 3 v
+复耕 3 v
+复职 56 v
+复聘 3 v
+复膜机 3 n
+复色 3 n
+复色光 10 n
+复苏 426 v
+复视 17 v
+复训 4 vn
+复议 84 v
+复议法 3 n
+复评 4 v
+复诉 3 v
+复诊 10 v
+复词 3 n
+复试 246 v
+复试线 3 n
+复诵 3 v
+复读 35 v
+复读机 4 n
+复读生 3 n
+复课 5 v
+复调 32 v
+复调音乐 3 n
+复责任 3 l
+复赛 56 vn
+复蹈前辙 3 n
+复轨 3 v
+复转 18 v
+复辅音 6 nz
+复辟 467 v
+复辟事件 3 l
+复返 19 v
+复进簧 16 n
+复述 110 v
+复选 3 v
+复选框 3 n
+复选题 3 n
+复通 2 a
+复部 3 n
+复配 9 v
+复钱 3 v
+复钻 3 a
+复阻抗 3 n
+复隆镇 3 ns
+复面洞 3 n
+复音 2 n
+复音词 4 n
+复韵 3 a
+复韵母 3 n
+复频率 3 n
+复馆 3 n
+复验 4 v
+夎 601 zg
+夏 5257 nr
+夏与贵 2 nr
+夏丐尊 7 nr
+夏中星 23 nr
+夏为商 2 nr
+夏之交 4 nr
+夏之兵 3 nr
+夏之西 4 nr
+夏乾良 4 nr
+夏二郡 3 nr
+夏五郭公 3 nr
+夏代 189 t
+夏代冶 3 nr
+夏代积 4 nr
+夏令 10 nr
+夏令卫生 3 nr
+夏令时 12 nr
+夏令时间 3 n
+夏令营 66 nr
+夏任凡 6 nr
+夏伯昆 2 nr
+夏伯阳 3 nr
+夏佐全 256 nr
+夏侯 126 nr
+夏侯兰 3 nr
+夏侯君 4 nr
+夏侯和 3 nr
+夏侯威 6 nr
+夏侯婴 4 nr
+夏侯尚 2 nr
+夏侯尚引 2 nr
+夏侯徳 3 ns
+夏侯恩 2 nr
+夏侯恵 3 ns
+夏侯惇 3 ns
+夏侯惠 6 nr
+夏侯懋 3 nr
+夏侯成 2 nr
+夏侯敦 4 nr
+夏侯楙 3 ns
+夏侯氏 4 nr
+夏侯渊 81 nr
+夏侯渊引 4 nr
+夏侯渊领 2 nr
+夏侯玄 13 nr
+夏侯蔼 75 nr
+夏侯蔼入 2 nr
+夏侯蔼引 8 nr
+夏侯蔼部 2 nr
+夏侯蔼领 5 nr
+夏侯覇 3 ns
+夏侯阳算 2 nr
+夏侯雅伯 11 nr
+夏侯霸 31 nr
+夏侯霸引 2 nr
+夏俊生 3 nr
+夏候鸟 7 nr
+夏允彝 8 nr
+夏克强 2 nr
+夏克达 4 nr
+夏公子 2 nr
+夏养阳 3 nr
+夏内尔 8 nr
+夏军攻 3 nr
+夏军来 2 nr
+夏冬 7 t
+夏冰杏 2 nr
+夏凉冬 7 nr
+夏初 5 t
+夏利 20 nr
+夏利车 3 nr
+夏加尔 3 nr
+夏加平 6 nr
+夏占利 6 nr
+夏占领 2 nr
+夏历 80 t
+夏原吉 15 nr
+夏县 44 ns
+夏口厅 3 nr
+夏后启 2 nr
+夏后氏 7 nr
+夏向德 5 nr
+夏君亭 10 nr
+夏含夷 3 nr
+夏启 4 t
+夏启死 3 nr
+夏命群 6 nr
+夏和周 2 nr
+夏商周 231 t
+夏国 35 ns
+夏国主 4 nr
+夏国之 2 nr
+夏国公 4 nr
+夏国初 3 nr
+夏国存 2 nr
+夏国崇 2 nr
+夏国建国 2 nt
+夏国相 76 nr
+夏国行 3 nt
+夏国谱 2 nr
+夏国钱 2 nr
+夏在汉 3 nr
+夏坚白 3 nr
+夏培肃 2 nr
+夏增文 13 nr
+夏增民 2 nr
+夏士华 4 nr
+夏多布 2 nr
+夏夜 32 t
+夏大侠 2 nr
+夏大豆 3 nr
+夏天 3821 t
+夏天无 3 nr
+夏太康 2 nr
+夏奇拉 3 nr
+夏奈尔 3 nr
+夏姆斯 2 nr
+夏威夷 312 nr
+夏威夷大学 6 nt
+夏威夷岛 3 ns
+夏威夷州 15 ns
+夏威夷群 3 nr
+夏娃 50 nr
+夏婆子 7 nr
+夏季 1492 t
+夏学銮 7 nr
+夏守忠 4 nr
+夏宋 2 t
+夏完淳 8 nr
+夏宗佑 3 nrfg
+夏宗学 3 nr
+夏宗神 3 nr
+夏家人 2 nr
+夏家和 3 nr
+夏家店 3 ns
+夏小正 14 nr
+夏尔丹 8 nr
+夏尔凡 7 nr
+夏尔洛 5 nr
+夏尔米 3 nr
+夏尔马 6 nr
+夏尽秋 5 nr
+夏川纯 3 nr
+夏州 20 ns
+夏州东 2 nr
+夏州城 3 ns
+夏州定 3 nr
+夏巴尼 3 nr
+夏布 59 nr
+夏帕克 5 nr
+夏常服 35 nr
+夏建陆 10 nr
+夏德仁 3 nr
+夏志清 3 nr
+夏志诚 2 nr
+夏忠靖 3 nr
+夏总兵 15 nr
+夏惠宗 2 nr
+夏承德 13 nr
+夏承焘 7 nr
+夏收 34 nr
+夏收夏种 3 n
+夏政权 2 nr
+夏救民 2 nr
+夏敬观 3 nr
+夏文化 3 nr
+夏文彦 3 nr
+夏文斌 2 nr
+夏文汐 3 n
+夏文说 3 nrfg
+夏斗寅 261 nr
+夏斯特 2 nr
+夏方田 5 nr
+夏族 14 nz
+夏无冬 2 nr
+夏日 212 t
+夏日可畏 3 nr
+夏时制 3 nr
+夏普公司 20 nt
+夏景山 2 nr
+夏景海 3 nr
+夏景诗 2 nr
+夏朗德 2 nr
+夏朝 87 t
+夏末 25 t
+夏末秋 14 t
+夏枯草 8 n
+夏桀之 3 nr
+夏棋溪 2 nr
+夏正思 19 nr
+夏正方 3 nr
+夏毛红 3 nr
+夏河 2 nr
+夏河县 7 ns
+夏洛克 12 nr
+夏洛号 2 nr
+夏洛泰 5 nr
+夏洛滕 10 nr
+夏洛特 17 nr
+夏洛特阿马利亚 7 ns
+夏洛蒂 11 nr
+夏津 3 nr
+夏津县 3 ns
+夏洪波 4 nr
+夏洪青 6 nr
+夏济安 5 nr
+夏涨冬 4 nr
+夏淑琴 3 nrfg
+夏清 4 t
+夏满芒 2 nr
+夏炉冬扇 3 n
+夏热冬 5 nr
+夏热握火 3 n
+夏煊泽 10 nr
+夏熟 3 nr
+夏熟作物 3 n
+夏特尔 2 nr
+夏特莱 4 nr
+夏玉米 3 nr
+夏玉莲 349 nr
+夏王廷 2 nr
+夏王相 2 nr
+夏王纳 3 nr
+夏王陵 4 nr
+夏珺 5 v
+夏瓦纳 2 nr
+夏生荣 2 nr
+夏皮尔 4 nr
+夏皮罗 3 nr
+夏盔 3 n
+夏目漱石 10 nr
+夏相公 2 nr
+夏眠 9 nr
+夏神宗 2 nr
+夏禹 46 nr
+夏禹建国 3 nr
+夏禹治水 3 nr
+夏秋 169 t
+夏秋之 7 nr
+夏秋停 2 nr
+夏秋多 6 nr
+夏秋季 58 t
+夏秋常 5 nr
+夏秋航 4 nr
+夏秋茧 3 nr
+夏秋蚕 3 nr
+夏秋谷 2 nr
+夏秋采 2 nr
+夏秋间 5 t
+夏种 2 t
+夏筱青 2 nr
+夏管 3 nr
+夏粮 43 nr
+夏练三伏 3 nr
+夏绿蒂 3 nr
+夏老拳师 3 n
+夏耘 3 nr
+夏聚秋 2 nr
+夏腊 3 ns
+夏至 198 t
+夏至点 4 nr
+夏至线 3 nr
+夏至草 3 nr
+夏艳华 3 nr
+夏茸尕布 7 vn
+夏荒 2 ns
+夏菊花 2 nr
+夏蒙尼 7 nr
+夏虫朝菌 3 nr
+夏虫疑冰 3 nr
+夏虫语冰 3 nr
+夏衍 58 nr
+夏衣 9 nr
+夏装 17 n
+夏西秦 7 nr
+夏言之 2 nr
+夏言兄 2 nr
+夏言先生 2 nr
+夏语冰 2 nr
+夏谷云 2 nr
+夏赞忠 257 nr
+夏迎阳 2 nr
+夏连特 9 nr
+夏迷彩 4 nr
+夏逢春 2 nr
+夏逸夫 3 nr
+夏邑 8 nr
+夏邑南 2 nr
+夏邑县 3 nr
+夏都 19 ns
+夏都城 2 nr
+夏金桂 4 nr
+夏银绥 4 nr
+夏锄 2 nr
+夏长冬 4 nr
+夏门市 3 ns
+夏阿姨 2 nr
+夏雨冬 4 nr
+夏雨占 2 nr
+夏雨去 2 nr
+夏雨型 2 nr
+夏雨夏 4 nr
+夏雨娘 2 nr
+夏雨帮 2 nr
+夏雨扶 2 nr
+夏雨拿 3 nr
+夏雨田 38 nr
+夏雨雨人 3 nr
+夏雨雪 3 nr
+夏雪宜 7 nr
+夏韶声 3 nr
+夏风一 3 nr
+夏风先 3 nr
+夏风呀 3 nr
+夏风哥 2 nr
+夏风哩 3 nr
+夏风夏 12 nr
+夏风帮 2 nr
+夏风才 2 nr
+夏风能 2 nr
+夏风见 2 nr
+夏首辅 6 nr
+夏鸾翔 8 nr
+夏鼎商彝 3 nr
+夐 255 zg
+夔 693 zg
+夔峡 3 ns
+夔门 16 ns
+夔龙 6 ns
+夕 406 tg
+夕姑 3 n
+夕寐宵兴 3 i
+夕惕朝乾 3 i
+夕惕若厉 3 i
+夕日 4 n
+夕晖 3 n
+夕烟 2 n
+夕照 40 n
+夕照山 4 ns
+夕阳 299 ns
+夕阳余晖 3 n
+夕阳古道 3 l
+夕阳工业 3 n
+夕阳红 17 l
+夕阳西下 42 ns
+外 35084 f
+外一首 3 n
+外三元 3 nz
+外三层 3 n
+外专局 2 nt
+外丘 3 n
+外业 3 n
+外为中用 3 l
+外乔 3 nrt
+外乡 22 n
+外乡人 65 n
+外乡口音 3 n
+外事 711 n
+外事办 3 n
+外事办公室 6 nt
+外事口 3 n
+外事司 3 n
+外事处 3 n
+外事委员会 275 nt
+外事学院 3 nt
+外事局 6 nt
+外事活动 3 n
+外事知识 3 n
+外事科 3 n
+外事组 4 n
+外事部 3 nt
+外交 4781 n
+外交事务 3 n
+外交人员 3 n
+外交代表 3 n
+外交使团 3 nt
+外交使节 3 n
+外交信使 3 n
+外交关系 3 n
+外交史 41 n
+外交团 4 nt
+外交大臣 120 n
+外交学 17 nt
+外交学院 28 nt
+外交官 360 n
+外交家 52 n
+外交惯例 3 n
+外交政策 3 n
+外交机构 3 n
+外交活动 3 n
+外交特权 30 n
+外交界 6 n
+外交系 3 n
+外交谋略 3 n
+外交豁免 3 vn
+外交辞 3 n
+外交辞令 14 n
+外交途径 3 n
+外交通商部 3 nt
+外交邮袋 3 n
+外交部 7223 nt
+外交部亚洲司 35 nt
+外交部办公厅 33 nt
+外交部新闻司 378 nt
+外交部长 588 n
+外交部门 51 n
+外交部驻港特派员公署 17 nt
+外交部驻澳门特别行政区特派员公署 4 nt
+外交部驻香港特别行政区特派员公署 4 nt
+外交部驻香港特派员公署 16 nt
+外亲 3 n
+外亲内疏 3 n
+外人 727 n
+外人田 2 nt
+外人道 4 n
+外代 6 n
+外企 458 j
+外传 214 n
+外伤 158 n
+外伤学 3 n
+外伤性 17 n
+外侧 484 f
+外侨 175 n
+外侮 72 n
+外侵 3 v
+外保温 3 n
+外借 7 v
+外债 353 n
+外倾 3 b
+外八庙 8 n
+外公 311 n
+外公切线 3 n
+外六角 3 j
+外关 3 n
+外关活动 3 l
+外兴安岭 3 ns
+外军 107 n
+外凸 3 n
+外出 741 v
+外出服 3 n
+外出血 12 n
+外出装 3 n
+外分泌 26 n
+外分泌腺 3 n
+外分角线 3 n
+外切 3 n
+外切形 3 n
+外刊 28 n
+外刚内柔 3 ns
+外制 3 n
+外力 326 n
+外力作用 3 n
+外办 40 n
+外功 37 n
+外加 324 v
+外加剂 4 n
+外务 25 n
+外务员 3 n
+外务大臣 27 n
+外务省 31 nt
+外务部 37 nt
+外劳 3 n
+外勤 11 n
+外勤人员 3 n
+外包 3 n
+外包装 51 n
+外化 12 n
+外区 3 n
+外协 3 j
+外卖 20 v
+外卡 8 n
+外厂 2 n
+外厉内荏 3 i
+外县 36 ns
+外县市 3 n
+外双溪 3 ns
+外反射 3 n
+外台秘要 3 n
+外史 50 n
+外号 494 n
+外合里差 3 n
+外合里应 3 n
+外向 94 n
+外向型 408 b
+外向电流 3 n
+外听道 3 n
+外周 85 f
+外周血 13 n
+外售 3 vn
+外商 951 n
+外商投资 3 j
+外商独资 3 n
+外因 99 n
+外因论 3 n
+外围 685 f
+外围地区 3 n
+外围设备 3 n
+外围赛 3 n
+外国 7204 ns
+外国专家 3 l
+外国人 801 n
+外国佬 3 nz
+外国化 3 nt
+外国名著 3 n
+外国商人 3 n
+外国投资 3 j
+外国文学 3 nt
+外国法 9 n
+外国海关 3 nt
+外国游客 3 n
+外国籍 5 n
+外国血统 3 n
+外国评论 3 n
+外国语 270 nz
+外国语文 3 n
+外国货 12 n
+外圆内方 5 n
+外圈 21 n
+外在性 3 n
+外在美 3 n
+外地 1226 n
+外地人 132 n
+外地口音 3 n
+外场 45 n
+外型 44 b
+外型加成 3 n
+外城 3 n
+外埔 3 ns
+外域 5 n
+外埠 32 n
+外堡 3 n
+外境 3 n
+外墙 175 n
+外墙板 3 n
+外墙涂料 3 n
+外墙漆 3 n
+外墙砖 3 n
+外墙面 2 n
+外壁 3 n
+外壕 3 n
+外壳 237 n
+外壳命令 3 n
+外壳脚本 3 n
+外备 5 n
+外太空 3 n
+外头 556 n
+外夷 3 n
+外套 160 n
+外套腔 3 n
+外套膜 3 n
+外奶奶 3 n
+外姓 24 n
+外委 3 n
+外委会 4 nt
+外婆 272 n
+外婆家 3 n
+外婆桥 7 n
+外嫁 8 n
+外子 3 n
+外存 10 n
+外存储器 11 n
+外孙 118 n
+外孙女 54 n
+外孙女儿 3 n
+外孙子 12 n
+外学 3 n
+外客 6 n
+外宣 22 j
+外家 3 n
+外宽内忌 3 l
+外宽内明 3 l
+外宽内深 3 l
+外宾 74 n
+外宾来访 3 n
+外宿 3 n
+外宿学生 3 n
+外寄 3 v
+外寄生物 3 n
+外寇 17 n
+外尔群 3 n
+外层 280 n
+外层机理 3 n
+外层空间 3 n
+外屋 13 n
+外展神经 3 l
+外岛 3 n
+外岛地区 3 ns
+外岛部队 3 nt
+外巧内嫉 3 i
+外差 24 n
+外币 146 n
+外币单位 3 n
+外币存款 3 n
+外币流通 3 n
+外币现金 3 n
+外市 3 n
+外帐 3 n
+外带 39 n
+外库 3 n
+外廊 4 n
+外廓 8 n
+外延 155 n
+外延公理 2 n
+外延长度 3 n
+外延隔离 3 l
+外开窗 3 n
+外开门 3 n
+外引内联 3 nz
+外弛内张 3 ns
+外张 3 n
+外弦 2 n
+外强 3 v
+外强中乾 3 ns
+外强中干 39 l
+外录 3 n
+外形 693 n
+外形尺寸 3 n
+外形高点 3 n
+外径 18 n
+外御其侮 2 n
+外心 6 n
+外快 23 v
+外患 71 n
+外患罪 3 n
+外愚内智 3 i
+外感 138 n
+外感内伤 3 n
+外戚 218 n
+外手 3 n
+外扩散 3 j
+外扬 10 v
+外抗 3 v
+外抗强敌 3 n
+外挂 132 n
+外挂字幕 3 n
+外挂式 3 n
+外挂版 3 n
+外挂网 3 nz
+外排 17 n
+外接圆 3 n
+外接圆心 3 n
+外接式 3 n
+外推法 4 n
+外援 592 n
+外摊 3 n
+外放 34 v
+外敌 108 n
+外教 29 n
+外敷 56 v
+外敷药 5 n
+外文 657 n
+外文书 6 n
+外文出版社 11 nt
+外文版 3 n
+外文系 24 n
+外文课 3 n
+外方 117 f
+外方内员 3 n
+外方内圆 3 n
+外族 84 n
+外族人 9 n
+外星 26 n
+外星人 103 n
+外显 3 a
+外显子 3 n
+外景 55 n
+外景图 3 n
+外景地 16 n
+外景队 3 n
+外服 3 n
+外村 31 n
+外村人 6 n
+外来 925 f
+外来人 17 n
+外来人口 21 n
+外来人员 3 n
+外来名 3 n
+外来妹 3 n
+外来工 10 n
+外来干涉 3 i
+外来户 6 n
+外来文化 3 n
+外来者 19 n
+外来词 17 n
+外来语 21 nz
+外来货 3 n
+外来风 3 n
+外果皮 15 n
+外架 3 n
+外柔 3 ns
+外柔内刚 3 n
+外查 3 vn
+外标 3 n
+外标法 3 n
+外校 285 n
+外校学生 3 n
+外格 3 n
+外植体 3 n
+外楼 3 n
+外檐装修 3 l
+外欠 3 n
+外欲 3 n
+外段 3 n
+外毒素 22 n
+外气 3 n
+外水 9 n
+外汇 1386 n
+外汇业务 3 n
+外汇交易 3 n
+外汇储备 3 n
+外汇兑换 3 n
+外汇券 9 nt
+外汇存底 3 n
+外汇宝 3 nz
+外汇局 6 nt
+外汇市场 3 n
+外汇收入 3 n
+外汇新闻 3 n
+外汇牌价 3 n
+外汇率 6 n
+外汇管制 3 n
+外汇管理局 5 nt
+外汇网 3 n
+外汇行市 3 n
+外汇资金 3 n
+外汇逆差 3 n
+外汇通 3 nt
+外江 14 ns
+外沙 4 n
+外治法 18 n
+外沿 3 s
+外泄 61 v
+外洋 3 n
+外活 3 n
+外派 19 n
+外流 238 n
+外流河 13 ns
+外海 128 f
+外海地区 3 ns
+外海地带 3 n
+外涂 3 n
+外渗 3 nz
+外港 3 ns
+外源 29 n
+外源性 22 n
+外溢 19 v
+外滩 140 n
+外漏 3 n
+外激素 3 n
+外烟 3 n
+外焦里嫩 3 l
+外焰 3 n
+外父 3 n
+外片 3 n
+外片报导 3 n
+外物 3 n
+外环 15 n
+外环线 7 n
+外环路 2 n
+外班 3 n
+外生 3 n
+外生性 2 n
+外生殖器 3 n
+外甥 265 n
+外甥女 71 n
+外用 177 n
+外用药 3 n
+外电 281 n
+外电报导 3 n
+外电报道 3 n
+外电路 18 n
+外界 1629 n
+外界人士 3 n
+外界压力 3 n
+外界影响 3 n
+外痔 6 n
+外白渡桥 6 n
+外皮 551 n
+外相 83 n
+外省 175 n
+外省人 28 n
+外省市 3 ns
+外码 3 n
+外研社 3 nt
+外祖 3 n
+外祖母 318 n
+外祖父 128 n
+外祖父母 3 n
+外祸 3 n
+外科 660 n
+外科主任 3 n
+外科医生 3 nz
+外科学 32 nt
+外科手术 3 n
+外科病人 3 n
+外科病房 3 n
+外秘 4 n
+外秘级 3 n
+外积 3 n
+外移 16 v
+外稃 9 n
+外稿 3 n
+外空 16 n
+外突 3 n
+外立面 3 n
+外端 3 n
+外简内明 3 i
+外管局 8 nt
+外篇 3 b
+外籍 305 n
+外籍人 10 n
+外籍人士 3 n
+外籍华人 3 n
+外籍球员 3 n
+外线 85 n
+外线投篮 3 nt
+外经 2 n
+外经外贸 4 nt
+外经委 2 nt
+外经局 3 nt
+外经纬 3 n
+外经贸 290 n
+外经贸厅 3 nt
+外经贸委 3 nt
+外经贸局 3 nt
+外经贸部 67 nt
+外经部 3 nt
+外缘 83 n
+外网 3 n
+外罩 42 n
+外置 11 n
+外置式 3 n
+外置硬盘 3 n
+外群体 3 n
+外翻 3 v
+外翼 20 n
+外耳 23 n
+外耳道 34 n
+外耳门 3 n
+外联 12 ns
+外联部 5 nt
+外聘 3 v
+外聘制 3 n
+外肾 3 n
+外胎 12 n
+外胚层 42 n
+外脑 6 n
+外膜 3 n
+外膝体 3 l
+外舅 3 n
+外航 25 j
+外舱 3 n
+外营力 23 n
+外蒙 14 n
+外藩 3 n
+外螺纹 3 n
+外行 95 n
+外行人 14 n
+外行星 20 n
+外行话 7 n
+外衣 293 n
+外补 3 b
+外表 883 n
+外表美丽 3 n
+外袍 3 n
+外裤 3 n
+外观 626 n
+外观设计 3 n
+外角 3 n
+外角球 3 n
+外设 63 vn
+外访 3 v
+外诊 3 n
+外诊医生 3 n
+外话 3 n
+外语 1187 n
+外语会话 3 n
+外语外贸 3 n
+外语学校 3 nt
+外语学院 3 nt
+外语成绩 3 n
+外语教学 3 nt
+外语教学与研究出版社 7 nt
+外语水平 3 n
+外语片 22 n
+外语类 3 n
+外语系 50 n
+外语翻译 3 l
+外语考试 3 n
+外语课 9 n
+外语部 3 n
+外调 33 n
+外调制 3 n
+外貌 438 n
+外财 5 n
+外账 3 n
+外货 7 n
+外购 26 v
+外贸 1887 n
+外贸代理 3 n
+外贸企业 3 j
+外贸体制 3 n
+外贸信息 3 nt
+外贸公司 3 nt
+外贸出口 3 n
+外贸协会 3 nt
+外贸大学 3 nt
+外贸学院 3 nt
+外贸局 3 nt
+外贸服装 3 l
+外贸服饰 3 n
+外贸生意 3 n
+外贸知识 3 l
+外贸网 3 nt
+外贸英语 3 nz
+外贸软件 3 l
+外贸逆差 3 n
+外贸部 3 nt
+外贸顺差 3 l
+外贸额 3 n
+外资 2363 n
+外资企业 3 n
+外资保险 3 n
+外资来源 3 n
+外资股 49 n
+外资银行 3 nt
+外资项目 3 n
+外路 31 n
+外路长度 3 n
+外转式 3 n
+外轮 75 n
+外轮山 3 n
+外边 945 f
+外迁 29 v
+外运 57 n
+外运发展 4 nt
+外运量 2 n
+外逃 108 v
+外遇 74 n
+外道 20 n
+外遣 3 b
+外邦 3 n
+外邪 45 n
+外部 1356 f
+外部命令 3 n
+外部性 5 n
+外部环境 3 n
+外部设备 3 n
+外部边界 3 n
+外配位层 3 n
+外釉上皮 3 n
+外重内轻 3 nz
+外野 3 n
+外野区 3 nt
+外野安打 3 n
+外野手 3 n
+外钞 3 n
+外铺 3 n
+外销 168 n
+外销员 3 n
+外销品 3 n
+外销房 3 n
+外销货 3 n
+外销量 5 n
+外锅 3 n
+外错角 3 n
+外长 1180 n
+外长级 2 b
+外门 3 n
+外间 192 f
+外防 3 n
+外阴 112 n
+外阴炎 3 n
+外阴部 3 n
+外院 17 n
+外陵 3 n
+外露 34 v
+外面 4049 f
+外面儿光 3 n
+外项 3 n
+外频 3 n
+外颖 3 a
+外馆 3 n
+外骨骼 24 n
+外高加索 49 ns
+外高加索地区 8 ns
+外高桥 29 n
+夙 73 n
+夙世冤业 3 i
+夙世冤家 3 i
+夙仇 3 n
+夙兴夜处 3 i
+夙兴夜寐 4 i
+夙兴昧旦 3 i
+夙夜 15 n
+夙夜不解 3 i
+夙夜匪解 3 n
+夙夜在公 3 i
+夙嫌 3 n
+夙志 3 n
+夙怨 5 n
+夙愿 72 n
+夙敌 3 n
+夙昔 3 n
+夙缘 3 n
+夙诺 3 n
+多 98900 m
+多一丝 2 m
+多一两 5 m
+多一事不如少一事 14 l
+多一些 235 m
+多一份 16 m
+多一会 17 m
+多一会儿 16 m
+多一倍 28 m
+多一分 47 m
+多一分钟 2 m
+多一刻 6 m
+多一半 9 m
+多一回 5 m
+多一层 14 m
+多一届 2 m
+多一点 215 m
+多一点儿 3 m
+多一点点 2 m
+多一百次 2 m
+多一秒 2 m
+多一笔 2 m
+多一重 2 m
+多一间 2 m
+多万 811 m
+多万两 2 m
+多万个 17 m
+多万人次 26 m
+多万件 11 m
+多万份 4 m
+多万例 2 m
+多万元 133 m
+多万公里 10 m
+多万公顷 54 m
+多万册 13 m
+多万千克 2 m
+多万千瓦 22 m
+多万千米 9 m
+多万只 8 m
+多万台 6 m
+多万名 47 m
+多万吨 59 m
+多万头 6 m
+多万家 4 m
+多万平方公里 34 m
+多万平方米 265 m
+多万年 12 m
+多万张 9 m
+多万户 6 m
+多万斤 3 m
+多万条 2 m
+多万枚 3 m
+多万株 7 m
+多万棵 2 m
+多万眼 2 m
+多万种 8 m
+多万立方米 3 m
+多万笔 2 m
+多万米 2 m
+多万美元 15 m
+多万英镑 4 m
+多万趟 34 m
+多万辆 4 m
+多万镑 2 m
+多万颗 3 m
+多万首 4 m
+多丈 2 m
+多三倍 2 m
+多三十岁 2 m
+多下 24 m
+多不多 3 l
+多不少 54 l
+多丑 3 m
+多丝 14 m
+多两倍 9 m
+多两口 2 m
+多两句 2 m
+多个 3543 m
+多中心键 3 n
+多串 2 m
+多久 1215 m
+多么 2899 r
+多义 21 n
+多义字 2 nz
+多义性 5 n
+多义词 7 nr
+多乐 7 nrt
+多乐士 3 n
+多事之秋 22 i
+多二 8 m
+多于 970 d
+多亏 228 d
+多亏是 3 l
+多云 41 nr
+多云偶雨 3 nr
+多云到阴 5 l
+多云有雨 3 i
+多云转晴 2 nr
+多云转阴 3 l
+多云间阴 6 ns
+多五六千吨 2 m
+多井分析 3 l
+多些 126 r
+多产 73 n
+多产作家 3 l
+多产地 3 n
+多产性 3 n
+多亩 34 m
+多人多 7 m
+多人次 19 m
+多亿 71 m
+多亿亩 5 m
+多亿元 46 m
+多亿公斤 2 m
+多亿加元 2 m
+多亿千克 2 m
+多亿台 2 m
+多亿吨 31 m
+多亿年 3 m
+多亿度 6 m
+多亿支 2 m
+多亿斤 2 m
+多亿港元 4 m
+多亿立方米 20 m
+多亿美元 48 m
+多付 19 v
+多代 12 m
+多件 63 m
+多价 7 n
+多任务 52 n
+多任务处理 3 l
+多份 37 m
+多伊奇 3 nrt
+多会儿 12 m
+多伦 20 nrt
+多伦县 5 ns
+多伦多 155 nrt
+多伦多市 4 ns
+多伦诺尔 5 nrt
+多伦路 3 ns
+多位 202 m
+多位数 3 n
+多体问题 3 l
+多余 596 m
+多余因数 3 l
+多佛 24 d
+多佛尔 26 nr
+多佛尔港 2 ns
+多例 16 m
+多保忠 6 nr
+多倍 71 m
+多倍体 28 n
+多值逻辑 3 l
+多做实事 3 l
+多元 516 m
+多元分析 3 l
+多元化 455 vn
+多元回归 3 l
+多元层析 3 l
+多元性 14 n
+多元总体 3 n
+多元智能 3 nr
+多元胞法 3 n
+多元论 11 n
+多元酚 7 nz
+多元酯 3 nz
+多元酸 5 n
+多元醇 17 nr
+多充 3 v
+多兆 3 nz
+多光年 2 m
+多克 58 nrt
+多党制 107 n
+多党合作 3 n
+多公斤 23 m
+多公里 292 m
+多公顷 14 m
+多兰 6 ns
+多具 47 m
+多册 4 m
+多几 4 m
+多几倍 13 m
+多几分 3 m
+多几家 2 m
+多几百元 3 m
+多凶少吉 3 i
+多出 282 m
+多分 77 m
+多分钟 32 m
+多切斯特 3 nrt
+多刊 3 r
+多列 25 m
+多则 161 m
+多利 85 nrt
+多利亚 7 ns
+多利安式 3 nz
+多利少 3 l
+多利德 3 nrt
+多利斯 3 nrt
+多制式 3 b
+多刻 3 m
+多副 5 m
+多力丰筋 3 nz
+多办实事 3 l
+多功能 275 b
+多功能厅 148 n
+多功能性 3 b
+多加练习 3 n
+多动症 20 n
+多劳 3 nrt
+多劳多得 9 nrt
+多匹 4 m
+多十二年 3 m
+多十倍 8 m
+多十天 2 m
+多千 2 m
+多千克 22 m
+多千米 178 m
+多半 1619 m
+多半会 3 m
+多半儿 2 m
+多半天 8 m
+多半年 13 m
+多半截 9 m
+多半辈子 4 m
+多卤化物 3 nz
+多卷 38 m
+多历年所 3 nrt
+多历年稔 3 nr
+多厘米 21 m
+多发 154 m
+多发区 2 n
+多发地 2 n
+多发性 73 n
+多发期 4 b
+多发病 18 n
+多变 275 v
+多变性 13 l
+多口 46 m
+多口相声 3 i
+多口网络 3 n
+多口阿师 3 ns
+多句 2 m
+多只 188 m
+多台 66 m
+多台计算机 4 n
+多吃含 3 v
+多吃多占 23 l
+多吉 15 nrt
+多吉才让 264 nrt
+多吉次仁 13 nz
+多名 1103 m
+多向性 2 b
+多吨 33 m
+多听少讲 3 l
+多呈岩 3 nr
+多员 3 m
+多周 3 m
+多味 11 m
+多味斋 3 nr
+多咯 3 nz
+多哈 27 nrt
+多哥 115 ns
+多哥共和国 3 ns
+多哥队 4 n
+多善德 16 nr
+多喜爱 3 nr
+多喝水 3 l
+多嘴 49 ns
+多嘴多舌 25 i
+多嘴献浅 3 l
+多囊肾 3 n
+多四成 2 m
+多因子 3 nr
+多国 3 ns
+多国公司 2 n
+多国联军 3 n
+多国部队 3 n
+多圈 6 m
+多场 70 m
+多场次 5 m
+多址 22 n
+多块 60 m
+多塞特郡 3 ns
+多声 6 m
+多声道 3 m
+多处 376 m
+多处理器 10 l
+多处理机 7 l
+多处理机系统 12 l
+多复变 12 l
+多多 382 m
+多多保重 3 l
+多多关照 3 l
+多多少少 113 m
+多多指教 3 nz
+多多益办 3 i
+多多益善 49 i
+多多马 6 nrt
+多夜 7 m
+多夜情 3 l
+多天 374 m
+多夫 79 nrt
+多夫制 6 nz
+多夫金 2 nrt
+多头 125 m
+多头图灵机 2 l
+多头并进 3 l
+多头政治 3 l
+多头管理 10 l
+多奇 7 nrt
+多套 43 m
+多好几倍 5 m
+多如牛毛 32 l
+多妻 3 r
+多妻制 15 n
+多姆 69 nrt
+多姿 81 n
+多姿多彩 82 i
+多姿多态 2 l
+多姿多采 5 i
+多娇 3 nr
+多媒体 545 n
+多媒体业务 13 n
+多媒体信息 2 i
+多媒体卡 3 n
+多媒体局 3 n
+多媒体扩展 8 n
+多媒体技术 42 n
+多媒体播放 2 i
+多媒体教学 7 n
+多媒体数据库 5 n
+多媒体演示 2 n
+多媒体电脑 7 n
+多媒体系统 2 n
+多媒体计算机 5 n
+多媒体通信 13 i
+多嫌 3 v
+多子 359 m
+多子多孙 6 nr
+多孔 137 b
+多孔塑料 3 n
+多孔性 8 n
+多孔渗水 3 n
+多孔砖 3 nr
+多孔结构 2 n
+多字词 3 n
+多宗 10 m
+多家 1323 m
+多寐 3 v
+多寡 189 b
+多寡不拘 3 j
+多封 14 m
+多尊 6 m
+多少 10457 m
+多少倍 3 m
+多少岁 3 m
+多少年来 3 l
+多少度 3 m
+多少次 3 m
+多少级 3 m
+多少钱 3 nr
+多尔 47 nrt
+多尔哈鲁邦 2 ns
+多尔多涅 8 nrt
+多尔帕 4 nrt
+多尔戈鲁基 7 nrt
+多尔斯 7 nrt
+多尔曼 3 nrt
+多尔芬 2 nrt
+多尔蒂 3 nrt
+多尔衮 1161 nrt
+多尔钦 2 nr
+多尼 41 nrt
+多尼亚 2 ns
+多尼尔 4 nrt
+多尿症 3 nz
+多层 150 m
+多层建筑 3 l
+多层板 3 n
+多层模式 3 l
+多层次 177 m
+多层次性 3 l
+多层面 3 b
+多届 8 m
+多岁 411 m
+多岩礁 2 nr
+多峰 9 m
+多峰分布 3 n
+多巧 3 d
+多巴 16 nrt
+多巴哥 61 ns
+多巴哥共和国 2 ns
+多巴胺 22 nz
+多常 3 d
+多幅 30 m
+多幕 3 m
+多幕剧 13 n
+多幢 7 m
+多平方公里 45 m
+多平方米 112 m
+多年 7450 m
+多年不见 3 l
+多年冻土 3 n
+多年未见 3 l
+多年生 240 b
+多度 14 m
+多座 481 m
+多张 33 m
+多弹头 32 n
+多形性 20 n
+多彩 55 b
+多彩多姿 18 i
+多彩的 24 z
+多得多 141 d
+多得很 3 nr
+多得是 3 d
+多德 25 nrt
+多心 64 n
+多快好省 38 l
+多态 20 n
+多态性 13 n
+多态现象 3 l
+多恩 15 nrt
+多情 93 n
+多情善感 4 i
+多情多义 3 l
+多情多感 3 l
+多情易劳 3 i
+多情种子 3 l
+多愁 3 a
+多愁善感 32 l
+多愁善病 3 l
+多愁多病 3 l
+多截 3 m
+多户 42 m
+多所 440 m
+多扇 2 m
+多才多艺 55 i
+多批 17 m
+多抹 4 m
+多担 3 m
+多拉 24 nrt
+多招 12 m
+多拳 3 m
+多指 46 nz
+多指令 2 n
+多排 18 m
+多接头 3 n
+多接收器 3 l
+多摄氏度 4 m
+多摩 10 nrt
+多摩教堂 3 nr
+多播 3 nrt
+多支 37 m
+多收并畜 3 n
+多故之秋 3 i
+多故障 3 b
+多数 4471 m
+多数三项 16 m
+多数两项 16 m
+多数乡 2 m
+多数倍 3 m
+多数党 31 n
+多数具 7 m
+多数决定 18 l
+多数则 19 m
+多数据流 6 n
+多数派 31 m
+多数百姓 2 n
+多数票 25 m
+多数种 23 m
+多数第 2 m
+多数遭 4 m
+多文为富 3 l
+多文强记 3 nz
+多文种 3 l
+多斤 17 m
+多斯 59 nrt
+多斯桑托斯 2 nrt
+多斯特 3 nrt
+多方 506 m
+多方位 34 m
+多方指数 3 l
+多方百计 3 l
+多方过程 3 l
+多方阻扰 3 i
+多方面 135 m
+多日 252 m
+多日不见 3 l
+多日未见 3 l
+多早晚 33 l
+多时辰 3 nr
+多明哥 2 nr
+多明尼加 3 ns
+多明戈 8 nr
+多星期 3 b
+多普勒 155 nrt
+多普达 3 nrt
+多晶 38 nrt
+多晶体 7 n
+多晶硅 31 nz
+多曲 10 m
+多月 422 m
+多服 5 m
+多期 275 b
+多本 18 m
+多朵 3 m
+多杀多 3 l
+多材多艺 3 l
+多束 3 m
+多条 578 m
+多来咪 8 nr
+多来米 3 nr
+多极 59 ns
+多极世界 3 n
+多极会 3 n
+多极化 119 n
+多枚 83 m
+多枝 4 m
+多架 110 m
+多架次 5 m
+多柱 3 m
+多栋 2 m
+多株 10 m
+多样 869 r
+多样化 459 l
+多样式 2 l
+多样性 359 l
+多核体 3 n
+多核合子 3 l
+多核心论 3 l
+多核糖体 3 n
+多核细胞 3 b
+多核苷酸 3 n
+多核配子 3 n
+多根 176 m
+多格 3 nrt
+多棱 7 b
+多棱镜 3 nz
+多棵 3 m
+多楔带 3 vn
+多模 8 b
+多次 5410 m
+多次下 13 m
+多次出 8 m
+多次发 2 nz
+多次派 19 m
+多次站 2 nz
+多次通 4 nz
+多次遭 10 m
+多次重 5 m
+多次重复 2 l
+多款 50 m
+多此 3 r
+多此一举 37 l
+多步 6 m
+多歧亡羊 3 l
+多段 12 m
+多毛 42 nrt
+多毛性 3 n
+多毛类 7 n
+多毫米 24 m
+多氧菌素 3 nz
+多氯 3 nz
+多氯联苯 20 nz
+多汁 3 n
+多汗 39 ns
+多汗症 13 l
+多法拉姆 3 nrt
+多洛夫 4 nrt
+多洛斯 2 nrt
+多洛雷斯 4 nrt
+多派 53 m
+多浪 3 nz
+多海里 3 ns
+多涎 3 v
+多渠道 55 nr
+多潘立酮 2 nz
+多灾 3 n
+多灾多难 27 l
+多点 129 m
+多点儿 3 m
+多点通信 3 l
+多片 15 m
+多片电路 3 nz
+多特 17 nrt
+多特蒙德 75 nrt
+多玛河 3 ns
+多玲正 2 nr
+多瑙河 273 ns
+多瑙河畔 10 ns
+多瓣 3 b
+多瓣膜病 3 n
+多瓦 14 m
+多瓶 3 m
+多用 695 b
+多用型 2 n
+多用户 26 n
+多用表 3 n
+多用途 14 n
+多画面 3 n
+多番 21 m
+多疑 146 d
+多瘤病毒 3 n
+多瘦 3 a
+多相 53 d
+多相催化 3 nr
+多看多听 3 i
+多眼 36 m
+多着 119 m
+多着丝 3 l
+多着呢 3 n
+多知卿 2 nr
+多碱 3 n
+多礼 29 nz
+多神教 19 nz
+多票通过 3 l
+多福 27 nrt
+多种 7255 m
+多种不同 4 l
+多种产品 6 l
+多种元 8 m
+多种具 2 l
+多种多样 335 m
+多种形式 41 l
+多种手段 3 m
+多种文 2 m
+多种类型 3 n
+多种经营 3 l
+多种营养 3 n
+多种语言 3 l
+多科性 41 n
+多窗口 3 nr
+多立方米 5 m
+多端 79 m
+多端寡要 3 l
+多端网络 3 l
+多笔 6 m
+多第一只 2 m
+多第头 2 m
+多第站 2 m
+多管闲事 58 l
+多管齐下 17 l
+多箱 3 m
+多篇 141 m
+多米 478 m
+多米尼克 23 nrt
+多米尼加 68 nrt
+多米尼加共和国 35 ns
+多米尼加岛 5 ns
+多米诺 7 nrt
+多米诺骨牌 18 nz
+多类 6 m
+多粒 6 m
+多粘菌素 6 n
+多精入卵 3 i
+多糖 85 n
+多糖类 6 n
+多系杂交 3 l
+多级 95 b
+多级泵 3 n
+多级火箭 12 l
+多级网络 3 n
+多纳 13 nrt
+多线 19 m
+多线期 3 b
+多线程 10 b
+多组 16 m
+多组分 9 l
+多细胞层 3 n
+多维 61 m
+多维分析 3 l
+多维图灵机 2 nrt
+多维奇 6 nrt
+多维尔 4 nrt
+多维度 3 ns
+多维科 2 nrt
+多维系统 3 l
+多缸 4 nz
+多罐 3 m
+多罗 199 nrt
+多罗夫 15 nrt
+多罗斯 5 nrt
+多美 3 m
+多美元 19 m
+多美姿 4 nr
+多美滋 3 nr
+多群 3 m
+多翻空 3 l
+多者 122 r
+多联环 3 ns
+多聚 20 v
+多聚甲醛 6 nz
+多聚糖 4 n
+多股 10 m
+多股丝 3 nz
+多肽 47 nz
+多肽原 3 n
+多肽链 3 n
+多胎 265 m
+多胎生育 3 n
+多胚性 3 n
+多胚现象 3 n
+多胚生殖 3 l
+多胞胎 2 n
+多能五笔 3 nz
+多能多艺 3 l
+多脂 3 n
+多腔 5 m
+多臂机 3 n
+多臭 3 n
+多艘 112 m
+多艺多才 3 l
+多节 27 m
+多节式 3 b
+多芯 2 m
+多花钱 3 n
+多英里 2 m
+多菌灵 5 n
+多萜 3 n
+多萜醇 3 n
+多萝西 2 nrt
+多蒸汽 3 n
+多藏厚亡 3 i
+多虑 3 v
+多虑平 3 nr
+多蛋白 3 l
+多蛾 3 n
+多行 94 m
+多行不义 3 l
+多行不义必自毙 12 i
+多见于 3 d
+多见广识 3 i
+多角 25 m
+多角化 3 ns
+多角度 63 ns
+多角形 23 n
+多角恋 3 nr
+多言多语 8 i
+多言多败 3 l
+多言必失 3 i
+多言或中 3 l
+多言数穷 3 l
+多言繁称 3 n
+多记 17 m
+多许少与 3 nr
+多试试 3 v
+多语种 3 n
+多说无益 3 l
+多诺 7 nrt
+多诺万 3 nrt
+多谋善断 15 i
+多谋善虑 3 i
+多谢 911 nrt
+多谢您 3 nr
+多财善贾 3 l
+多费唇舌 3 l
+多赚 3 v
+多起 92 m
+多趟 2 m
+多足动物 3 l
+多足类 2 n
+多路 170 m
+多路复用 3 l
+多路径 3 n
+多路解编 3 n
+多躁少静 3 nr
+多身 3 r
+多轨 3 b
+多轮 27 m
+多载 9 m
+多辆 53 m
+多边 290 r
+多边合作 3 l
+多边形 63 n
+多边条约 3 ns
+多边贸易 3 l
+多达 278 nrt
+多迪克 4 nrt
+多退少补 3 i
+多选题 3 n
+多通道 9 l
+多遍 13 m
+多道程序 4 l
+多遭 15 m
+多邦城 4 ns
+多部 199 m
+多酶片 5 n
+多醚菌素 3 nz
+多醣 3 z
+多采多姿 3 i
+多里 44 r
+多里克 10 nrt
+多里安 12 nrt
+多里斯 4 nrt
+多重 243 m
+多重人格 3 l
+多重国籍 3 n
+多重式 3 l
+多重态 2 l
+多重性 3 n
+多重照射 3 l
+多重调节 3 l
+多重选择 3 l
+多重集 3 nr
+多量 3 m
+多金之士 3 nr
+多钙 3 nz
+多钟 3 m
+多钩猫 3 n
+多钱善贾 3 i
+多锤 2 m
+多锭 2 m
+多长 375 n
+多长时间 3 n
+多间 32 m
+多闻 25 n
+多闻强记 3 n
+多闻阙疑 3 nr
+多阶 3 n
+多隆 3 nrt
+多隆肉 3 nr
+多难 83 d
+多难兴邦 4 i
+多集 11 m
+多雨区 26 n
+多雾 3 n
+多霜 3 nz
+多面 32 m
+多面交叉 3 nz
+多面体 36 n
+多面性 3 n
+多面手 31 d
+多面角 3 nz
+多韦斯 7 nrt
+多音字 6 n
+多音节 3 n
+多音节词 2 n
+多音轨 3 n
+多页 25 m
+多顶 8 m
+多项 523 m
+多项式 84 l
+多顾虑 3 i
+多颗 39 m
+多餐 19 m
+多饮水 3 n
+多首 59 m
+多马克 2 nrt
+多鱼之漏 3 i
+多鳞 3 n
+夛 198 zg
+夜 4020 t
+夜不成寐 5 i
+夜不能寐 19 i
+夜不闭户 9 l
+夜中 64 t
+夜以接日 3 i
+夜以继日 43 i
+夜以继昼 3 nr
+夜会 3 n
+夜作 3 n
+夜光 27 n
+夜光杯 27 n
+夜光漆 3 n
+夜光粉 3 nr
+夜光虫 9 n
+夜光表 5 n
+夜光质 3 n
+夜凉 4 t
+夜凉如水 3 l
+夜分 3 n
+夜勤 8 n
+夜半 85 t
+夜半三更 3 t
+夜半更深 6 i
+夜半钟声 3 i
+夜叉 76 n
+夜咳 3 n
+夜场 8 n
+夜壶 35 n
+夜夜 3 t
+夜夜心 3 l
+夜夜梦 3 i
+夜大 29 j
+夜大学 14 l
+夜大生 3 nr
+夜天光 5 nr
+夜宴 54 n
+夜宵 44 t
+夜宿 38 n
+夜尿症 2 n
+夜工 21 n
+夜市 62 n
+夜市场 3 n
+夜幕 249 n
+夜幕低垂 5 n
+夜幕沉沉 3 l
+夜幕降临 3 nr
+夜归 3 v
+夜归人 3 n
+夜快 3 v
+夜快车 3 l
+夜总会 52 n
+夜想曲 3 l
+夜战 120 n
+夜时尚 3 n
+夜明 2 t
+夜明星 3 nr
+夜明珠 94 nr
+夜明砂 2 n
+夜星 2 n
+夜晚 1487 t
+夜景 488 n
+夜暗 3 n
+夜暗风高 3 i
+夜曲 23 n
+夜月花朝 3 l
+夜有所梦 9 i
+夜未央 3 n
+夜机 3 n
+夜来 105 t
+夜来香 12 nr
+夜校 58 n
+夜校生 3 n
+夜汗 3 n
+夜泊 9 n
+夜深 132 t
+夜深人静 88 i
+夜深沉 3 i
+夜游 38 n
+夜游症 3 n
+夜游神 11 n
+夜游队 3 n
+夜猫 3 n
+夜猫子 35 nr
+夜猫族 3 nr
+夜玫瑰 3 nr
+夜班 95 n
+夜班车 4 n
+夜生活 58 i
+夜用护板 3 n
+夜的黑 3 l
+夜盲 8 n
+夜盲症 21 n
+夜磨牙症 3 i
+夜礼服 2 nr
+夜神仙 3 nr
+夜祷 3 v
+夜禁 3 v
+夜空 235 n
+夜航 38 j
+夜色 388 n
+夜色迷人 3 l
+夜色迷濛 3 nr
+夜茶 3 n
+夜草 8 n
+夜莺 19 n
+夜营 3 n
+夜虫昼伏 3 vn
+夜蛾 33 n
+夜行 93 n
+夜行人 3 n
+夜行军 5 n
+夜行者 3 n
+夜行衣 3 n
+夜行被绣 3 nr
+夜袭 73 v
+夜视 131 n
+夜视仪 68 n
+夜视器材 3 n
+夜视技术 3 n
+夜警 3 n
+夜访 3 v
+夜话 25 n
+夜读 3 v
+夜谈 27 v
+夜赛 3 n
+夜路 36 n
+夜车 9 n
+夜郎 58 n
+夜郎国 15 ns
+夜郎王 8 nr
+夜郎自大 12 i
+夜里 1459 t
+夜长 3 n
+夜长梦多 40 l
+夜长梦短 3 i
+夜间 1398 t
+夜间人口 3 n
+夜间工作 3 l
+夜间班 3 n
+夜间部 3 n
+夜阑 3 nr
+夜阑人静 7 i
+夜阑珊 3 i
+夜雨 3 t
+夜雨对床 3 n
+夜雾 3 n
+夜静 13 n
+夜静更深 7 i
+夜静更长 3 i
+夜静更阑 3 nr
+夜风 66 n
+夜餐 9 n
+夜饭 8 n
+夜魔侠 3 nr
+夜鸟 10 n
+夜鹰 28 n
+夜黑 3 nrt
+夜黑风高 3 i
+够 4088 zg
+够不上 3 l
+够不够 3 v
+够不着 3 l
+够买 3 v
+够交情 9 l
+够低 3 a
+够凶 3 v
+够剪 3 v
+够割 3 v
+够力 3 a
+够劲 3 a
+够劲儿 3 a
+够印 3 v
+够受 3 v
+够受的 6 l
+够吃 3 a
+够呛 45 v
+够味 3 a
+够味儿 3 v
+够响 3 v
+够学 3 v
+够尖 3 a
+够得上 3 l
+够得着 3 l
+够快 3 a
+够急 3 a
+够意思 65 l
+够慢 3 a
+够戗 44 a
+够打 3 v
+够挤 3 a
+够捡 3 v
+够数 3 a
+够早 3 v
+够晚 3 l
+够朋友 42 l
+够本 29 a
+够格 36 v
+够气 3 a
+够涂 3 a
+够湿 3 a
+够溼 3 v
+够点 3 v
+够玩 3 v
+够用 8 v
+够直 3 v
+够瞧 3 v
+够瞧的 3 a
+够种 3 v
+够笨 3 a
+够紧 3 a
+够罪 3 v
+够花 3 v
+够草 3 v
+够近 3 v
+够酷感 3 l
+够重 3 a
+够面子 3 l
+够香 3 v
+够骑 3 v
+夢 2 zg
+夤 48 t
+夤吃卯粮 3 vn
+夤夜 37 t
+夤缘 7 v
+夤缘攀附 3 vn
+夥 325 zg
+大 144099 a
+大一岁 3 m
+大一统 76 d
+大丈夫 435 n
+大三 146 m
+大三元 3 m
+大三和弦 3 nr
+大三巴 3 nr
+大三巴牌坊 2 ns
+大三通 3 nz
+大三阳 22 ns
+大上大下 3 i
+大不一样 77 l
+大不了 181 l
+大不列颠 106 ns
+大不大 3 d
+大不如前 3 i
+大不敬 31 i
+大不相同 3 i
+大不里士 36 ns
+大专 601 n
+大专同学 3 nt
+大专学校 386 l
+大专学生 3 l
+大专文化 3 l
+大专班 12 nr
+大专生 57 b
+大专院校 236 j
+大丘 6 ns
+大业 1361 n
+大业路 3 n
+大丛 11 n
+大东 20 ns
+大东区 3 ns
+大东海 4 ns
+大个 87 m
+大个儿 39 m
+大个子 220 m
+大中 234 r
+大中专 49 j
+大中专生 3 b
+大中企业 5 j
+大中华 49 nz
+大中华区 76 ns
+大中型 668 b
+大中城市 214 ns
+大中学校 152 nt
+大中学生 9 n
+大中小 30 b
+大中小企业 2 j
+大中小型 17 b
+大中小城市 6 j
+大中小学 11 l
+大中小学校 3 l
+大中小学生 6 l
+大中祥符 18 nr
+大中至正 3 nr
+大丰 16 nz
+大丰县 5 ns
+大丰市 3 ns
+大丰收 3 nr
+大串 3 m
+大串烧 3 l
+大串联 3 n
+大丹 4 ns
+大丹犬 2 nr
+大为 1557 d
+大为吃惊 3 i
+大为异趣 3 l
+大为惊异 3 i
+大为改观 3 l
+大为激动 3 l
+大为称诵 3 i
+大主教 102 nz
+大丽花 27 nr
+大丽菊 2 nr
+大举 786 d
+大举进攻 3 i
+大举进犯 3 i
+大久 68 m
+大义 186 n
+大义凛然 49 i
+大义灭亲 32 n
+大乐 226 n
+大乐透 3 nz
+大乖伦 2 nr
+大乘 284 nz
+大乘瑜 2 nr
+大九卿 11 nr
+大书 3 n
+大书特书 18 nz
+大乱 498 n
+大乱斗 3 i
+大了些 3 nr
+大事 4301 n
+大事不好 3 l
+大事不糊涂 3 i
+大事儿 26 n
+大事劳作 3 l
+大事化小 26 n
+大事去矣 3 i
+大事宣传 3 nz
+大事录 3 n
+大事纪 3 n
+大事记 74 n
+大事铺张 3 n
+大二 75 m
+大二环 2 nz
+大于 1033 d
+大于利 3 nr
+大于号 3 n
+大于求 3 l
+大云 13 n
+大云山 2 ns
+大五码 3 n
+大五金 3 n
+大亚湾 79 ns
+大亚湾核电站 13 nt
+大些 3 r
+大亨 39 nr
+大京九 3 nr
+大人 3573 n
+大人先生 11 i
+大人大量 3 n
+大人物 57 n
+大仁大义 51 nz
+大仁秀 2 nr
+大仁药专 3 nr
+大仇宿怨 3 i
+大仓 3 ns
+大仔恋 3 nr
+大仙 38 n
+大仲马 17 nr
+大件 340 n
+大任 36 n
+大众 1523 n
+大众交通 5 nz
+大众传媒 3 l
+大众传播 3 l
+大众公司 7 nt
+大众化 96 nz
+大众卡 3 nz
+大众呢 3 n
+大众形音 3 i
+大众性 11 n
+大众情人 3 i
+大众报 3 nz
+大众捷运 3 nr
+大众文化 3 nz
+大众文学 3 nt
+大众日报 3 nz
+大众汽车 3 nt
+大众汽车公司 5 nt
+大众汽车集团 15 nt
+大众点 3 n
+大众版 3 nz
+大众网 3 nz
+大众语 3 nz
+大众软件 2 l
+大众通 3 nz
+大伙 706 n
+大伙儿 1039 r
+大伙房 5 n
+大会 9681 n
+大会党 45 nt
+大会决议 3 n
+大会堂 213 n
+大会常务 3 n
+大会战 25 nz
+大会操 3 nr
+大会舞 3 n
+大会计 5 n
+大伟 22 nr
+大伤 3 n
+大伤元气 3 n
+大伤脑筋 3 n
+大伯 222 ns
+大伯子 3 nr
+大伯母 3 nr
+大伯父 3 nr
+大位 78 n
+大佐 9 nr
+大体 1656 n
+大体一致 3 d
+大体上 384 l
+大体描述 3 n
+大体相当 3 l
+大体说来 3 l
+大余 10 r
+大余县 7 ns
+大佛 88 d
+大佛像 11 n
+大佛寺 79 nz
+大佛山 3 ns
+大佛殿 4 nr
+大佛湾 6 ns
+大作 435 n
+大作文章 131 n
+大佬 3 nz
+大佬爱 3 nz
+大使 1498 n
+大使夫人 3 n
+大使级 35 n
+大使馆 279 n
+大侃 2 d
+大侠 793 nr
+大侠客 3 n
+大便 245 d
+大俗大雅 3 i
+大修 311 nr
+大修一 3 nr
+大修厂 3 n
+大修理 3 n
+大修理基 3 nz
+大值 5 n
+大偏差 3 n
+大做文章 54 i
+大儒 3 nr
+大儿 5 n
+大儿媳 8 n
+大儿子 157 n
+大元 3 m
+大元帅 511 nr
+大兄 3 n
+大光 7 n
+大光强 2 nr
+大克鼎 4 nr
+大党 3 n
+大全 130 ad
+大公 437 n
+大公储 3 j
+大公国 32 ns
+大公府 3 nt
+大公报 96 n
+大公无私 39 i
+大公网 3 n
+大公让 3 nr
+大公馆 3 n
+大公鸡 3 n
+大关 176 ns
+大关县 3 ns
+大兴 178 b
+大兴区 14 ns
+大兴县 25 ns
+大兴土木 215 ns
+大兴安岭 273 ns
+大兴安岭地区 12 ns
+大兴岛 2 ns
+大兴水利 3 ns
+大兵 204 n
+大兵团 16 n
+大兵日记 3 nz
+大典 2685 b
+大内 283 nz
+大冒险 3 n
+大写 46 n
+大写字母 11 n
+大写意 12 n
+大军 2880 n
+大军进犯 3 n
+大军鼓 3 i
+大农场 13 n
+大冢 14 nrt
+大冢匡 128 nr
+大冢营 2 nr
+大决战 43 n
+大冶 558 j
+大冶县 5 ns
+大冶市 265 ns
+大冷 16 ns
+大凉山 37 ns
+大凌河 78 ns
+大减价 3 n
+大凛 3 z
+大凡 181 d
+大凤山 3 nr
+大凤鸟 2 nr
+大出血 62 i
+大出风头 22 i
+大凿 3 v
+大刀 765 n
+大刀会 7 n
+大刀阔斧 110 i
+大分 19 n
+大分子 93 n
+大刑 16 n
+大划桨船 3 nr
+大利 49 n
+大利嘉城 3 ns
+大别 4 d
+大别山 1268 ns
+大别山区 57 ns
+大到暴雨 2 l
+大制做 3 i
+大前天 19 i
+大前年 8 t
+大前提 17 nr
+大剑山 3 nr
+大剑师 2 nr
+大剑无锋 3 nr
+大力 2526 n
+大力加强 3 nr
+大力协助 3 i
+大力发展 3 nz
+大力士 40 n
+大力开展 3 nt
+大力推广 3 nz
+大力提倡 3 nr
+大力提高 3 n
+大力支持 3 nr
+大力神 62 n
+大力神杯 5 nz
+大办 63 n
+大功 586 n
+大功告成 135 i
+大功毕成 3 i
+大功率 144 n
+大加 138 d
+大动 3 n
+大动公惯 3 n
+大动干戈 47 l
+大动肝火 14 n
+大动脉 97 n
+大动脉炎 3 n
+大劫 3 v
+大劫案 3 n
+大势 173 n
+大势已去 134 i
+大势已定 3 l
+大势所趋 108 i
+大勃律 2 nr
+大勇若怯 3 v
+大包 147 n
+大包大揽 43 l
+大包干 19 n
+大包月 3 n
+大包装 3 n
+大化 41 n
+大化革新 3 nz
+大北 9 ns
+大北窑 3 ns
+大匙 3 n
+大匠运斤 3 n
+大区 126 n
+大十字 6 nz
+大千 18 m
+大千世界 66 nz
+大午 10 t
+大半 409 m
+大半个 201 m
+大半分 3 m
+大半午 3 t
+大半只 4 m
+大半多 3 m
+大半夜 54 t
+大半天 85 t
+大半天里 2 ns
+大半年 131 t
+大半截 3 m
+大半日 13 t
+大半条 3 m
+大半杯 7 m
+大半瓶 3 m
+大半生 36 n
+大半碗 20 m
+大半辈子 47 m
+大半部 4 m
+大华 177 nz
+大华中学 3 nt
+大华工专 3 nt
+大华晚报 3 nz
+大华网 3 nz
+大协作 3 n
+大南 3 ns
+大南客运 3 n
+大南山 5 ns
+大南沟 2 ns
+大南门 4 ns
+大博尔 2 nr
+大博彩 2 nr
+大卡 45 n
+大卡车 3 n
+大卤面 3 n
+大卫 170 n
+大卫护 3 nr
+大卫王 5 nz
+大印 30 n
+大卷 3 m
+大卸八块 3 n
+大厂 69 n
+大厂县 3 ns
+大厂回族自治县 4 ns
+大厂镇 40 n
+大厅 2273 n
+大历 40 n
+大压杀 3 nz
+大原 3 ns
+大原丽子 3 nr
+大厦 777 n
+大厦将倾 16 i
+大厦将颠 3 i
+大厦栋梁 3 nr
+大厨 276 nz
+大厨师 3 vn
+大县 3 ns
+大又圆 3 nr
+大发 230 nz
+大发作 3 n
+大发利市 3 ns
+大发慈悲 16 i
+大发横财 25 i
+大发电者 3 n
+大发议论 3 n
+大发谬论 3 n
+大发雷霆 79 i
+大叔 283 n
+大叔叔 3 nr
+大受打击 3 i
+大受欢迎 3 i
+大变 3 nz
+大变局 3 n
+大变样 3 l
+大变脸 3 l
+大变身 3 n
+大叠 3 m
+大口 3 n
+大口井 2 n
+大口大气 3 nt
+大只 3 m
+大叫 2556 v
+大可不必 87 d
+大可师法 3 i
+大台北 3 ns
+大台北区 3 ns
+大史记 3 n
+大叶杨 3 nr
+大叶桉 3 n
+大叶茶 5 n
+大叶黄杨 3 n
+大号 81 n
+大司农 41 nz
+大司马 143 n
+大吃一惊 1033 i
+大吃一顿 3 l
+大吃大喝 67 l
+大吆小喝 3 l
+大合唱 69 n
+大吉 68 nr
+大吉大利 39 nz
+大同 563 d
+大同世界 10 nz
+大同乡 3 n
+大同书 3 n
+大同区 3 n
+大同县 3 ns
+大同商专 3 nt
+大同国中 3 nt
+大同小异 129 i
+大同工学 3 nt
+大同市 41 n
+大同江 38 ns
+大同盆地 3 ns
+大同盟 26 n
+大同路 3 n
+大名 838 m
+大名县 6 ns
+大名府 3 n
+大名难居 3 i
+大名鼎鼎 174 i
+大后天 7 i
+大后年 3 t
+大后方 49 n
+大吏 118 n
+大吐苦水 3 i
+大君 9 n
+大含细入 3 n
+大吵 3 v
+大吵一架 3 n
+大吵大闹 30 l
+大吹大打 3 i
+大吹大擂 30 i
+大吹法螺 5 n
+大吼大叫 3 n
+大员 154 n
+大周天 3 m
+大呼小叫 148 z
+大呼小喝 3 l
+大呼拉尔 43 ns
+大命 3 nz
+大和绘 13 n
+大咧咧 23 z
+大咬一口 3 i
+大响 3 n
+大哗 3 v
+大哥 3062 n
+大哥大 83 ns
+大哭 935 v
+大唐 372 nz
+大唐世家 3 nz
+大唐帝国 3 ns
+大唐电信 8 nz
+大唐电讯 3 nz
+大商 20 n
+大商所 8 nt
+大商股份 4 nz
+大啬夫 2 nr
+大喇嘛 61 n
+大喊 286 v
+大喊大叫 116 i
+大喜 464 n
+大喜之日 6 i
+大喜事 19 i
+大喜大悲 7 i
+大喜若狂 3 i
+大喜过望 113 i
+大喝一口 3 l
+大喝一声 3 i
+大嗓门 31 n
+大嘴巴 3 ns
+大嘴鸟 3 i
+大器 96 n
+大器小用 3 l
+大器晚成 18 nz
+大嚷 3 v
+大嚼 3 v
+大四 153 m
+大四喜 3 nr
+大回环 3 ns
+大回转 14 i
+大团 3 n
+大团圆 32 n
+大团结 380 n
+大团购 3 n
+大园 3 n
+大园乡 3 ns
+大围山 4 nr
+大国 1739 ns
+大国主义 4 nz
+大国家党 2 nt
+大图标 3 n
+大圆 63 n
+大圆机 3 n
+大圆满 3 nr
+大圈 3 m
+大土 3 n
+大圣 850 ns
+大圣何 2 nr
+大圣依 2 nr
+大圣堂 3 nr
+大圣寿 2 nr
+大圣怒 2 nr
+大圣战 4 nr
+大圣才 4 nr
+大圣斗 4 nr
+大圣笑 2 nr
+大圣腾 2 nr
+大圣训 5 nr
+大圣闪 3 nr
+大圣闻 6 nr
+大圪村 3 vn
+大地 1657 n
+大地回春 5 ns
+大地春回 2 i
+大地构造 3 n
+大地测量 3 n
+大地滤波 3 nz
+大场 3 n
+大坏蛋 3 n
+大坑 58 n
+大块 682 n
+大块头 13 d
+大块文章 3 n
+大块朵颐 3 l
+大坝 213 ns
+大坡 13 ns
+大坪 18 ns
+大坪里 4 ns
+大型 6672 b
+大型化 38 n
+大型商场 3 n
+大型帆船 3 n
+大型机 48 n
+大型活动 3 l
+大型犬 3 n
+大型超市 3 ns
+大型软件 2 l
+大型项目 3 n
+大城 384 ns
+大城县 3 ns
+大城山 6 ns
+大城市 142 ns
+大城镇 16 ns
+大埔 24 ns
+大埔县 4 ns
+大堂 382 n
+大堂哥 3 nr
+大堂妹 3 nr
+大堂姊 3 nr
+大堂弟 3 nr
+大堆 389 m
+大堆头 3 ns
+大堡 5 ns
+大堡礁 71 nr
+大堤 514 n
+大堰 2 ns
+大堰川 2 ns
+大堰河 2 ns
+大塘 7 ns
+大墙 12 n
+大增 290 v
+大士 68 n
+大士族 3 nz
+大士殿 2 nr
+大声 4698 m
+大声吼叫 3 n
+大声哭喊 3 i
+大声喊叫 3 i
+大声嚷叫 3 z
+大声嚷嚷 3 z
+大声疾呼 199 i
+大壶 3 n
+大处 3 d
+大处方 30 n
+大处着墨 3 i
+大处着眼 23 l
+大处落墨 3 i
+大夏 159 n
+大夏河 10 ns
+大多 3246 m
+大多数 3609 m
+大多数双 3 m
+大多数名 5 m
+大多数对 12 m
+大多数种 10 m
+大夜班 3 i
+大夥儿 3 z
+大大 3455 b
+大大减少 8 i
+大大咧咧 60 z
+大大增加 12 nr
+大大小小 479 z
+大大提高 29 i
+大大方方 71 nz
+大大的 669 nz
+大大简化 4 i
+大大缩短 3 i
+大大落落 3 i
+大大超 3 nr
+大大超越 3 nr
+大大降低 16 n
+大天兴 5 b
+大天白日 6 i
+大天鹅 9 nz
+大夫 2205 n
+大夫网 3 nz
+大失人望 3 i
+大失所望 84 i
+大头 327 n
+大头儿 4 n
+大头小尾 3 i
+大头帖 3 n
+大头照 3 n
+大头菜 14 n
+大头虾 3 n
+大头贴 3 n
+大头针 8 n
+大头钉 3 i
+大头陈 3 l
+大头鞋 2 n
+大头鬼 3 i
+大头鱼 5 n
+大奖 529 nz
+大奖章 3 n
+大奖赛 314 n
+大套 28 m
+大奴湖 8 ns
+大奶妹 3 n
+大好 303 d
+大好事 3 n
+大好人 18 n
+大好局面 3 n
+大好形势 3 i
+大好时光 3 l
+大好时机 3 l
+大好机会 3 l
+大好河山 19 i
+大如斗 3 i
+大妈 728 n
+大妹 3 n
+大妹夫 3 nr
+大妺 3 z
+大姆 4 nrt
+大姆指 3 nz
+大姆指头 3 nz
+大姊夫 3 nr
+大姊姊 3 nr
+大姐 704 n
+大姐大 3 nr
+大姐夫 6 nr
+大姐头 3 nr
+大姑 20 n
+大姑丈 3 n
+大姑妈 3 n
+大姑娘 149 n
+大姑子 4 n
+大姓 83 n
+大姚 3 ns
+大姚县 3 ns
+大姨 30 n
+大姨妈 3 nr
+大姨子 4 nr
+大威 25 ns
+大娄山 13 ns
+大娘 301 n
+大婶 189 n
+大婶儿 26 nr
+大婶婆 3 nr
+大媒 3 n
+大嫂 422 n
+大嫂子 47 n
+大子 3 n
+大子儿 8 nr
+大字 755 n
+大字体 3 n
+大字典 3 n
+大字报 180 n
+大字符集 3 n
+大孢子 3 nz
+大孤山 5 ns
+大学 20025 n
+大学专科 3 n
+大学人文 3 nz
+大学化学 3 nt
+大学城 51 n
+大学堂 37 n
+大学士 1827 n
+大学女生 3 n
+大学排名 3 l
+大学教授 3 n
+大学本科 3 n
+大学校园 3 n
+大学校长 3 n
+大学毕业 3 n
+大学湘 2 nr
+大学物理 3 n
+大学生 3879 n
+大学网 3 nz
+大学美术 3 n
+大学老师 3 n
+大学语文 3 n
+大学部 16 nt
+大学队 8 n
+大学预科 3 n
+大宁 31 ns
+大宁县 3 ns
+大宁河 18 ns
+大宅 51 n
+大宅门 3 n
+大宇 28 n
+大宇公司 12 nt
+大守宫 3 nr
+大安 67 nz
+大安乡 3 ns
+大安区 3 ns
+大安县 3 ns
+大安国中 3 nz
+大安地列 3 ns
+大安山乡 2 ns
+大安市 6 ns
+大安溪 3 ns
+大安镇 3 ns
+大宗 373 m
+大宗维 2 nr
+大官 327 n
+大官人 3 nr
+大官庄 4 nr
+大定 68 d
+大宛 71 nz
+大宛国 3 ns
+大宛王 2 nz
+大宝 92 nz
+大宝队 2 n
+大客 3 n
+大客厅 7 n
+大客机 3 n
+大客车 28 n
+大宫 44 n
+大宴宾客 9 nr
+大家 19177 n
+大家乐 2 nr
+大家伙 51 n
+大家伙儿 4 n
+大家庭 206 nr
+大家愿 3 n
+大家族 78 nz
+大家来找 3 v
+大家畜 3 n
+大家闺秀 25 i
+大家风范 11 n
+大家鼠 4 n
+大容山 5 nr
+大容量 7 n
+大密探 3 n
+大富 36 nz
+大富大贵 3 i
+大富翁 3 nr
+大寒 18 b
+大寒索裘 3 i
+大寨 268 ns
+大寨村 2 ns
+大对虾 3 n
+大寺 58 ns
+大寺安纯 2 nr
+大寿 257 n
+大将 1739 d
+大将之风 3 i
+大将军 537 nr
+大将风度 3 n
+大尉 62 n
+大小 5841 b
+大小不一 3 l
+大小不等 3 l
+大小事 11 b
+大小便 86 nr
+大小兴安岭 15 ns
+大小写 12 b
+大小凉山 2 nr
+大小叶 3 nr
+大小头 3 n
+大小官员 3 n
+大小球 3 n
+大小腿 2 n
+大小通吃 3 l
+大少帅 3 nr
+大少爷 105 nr
+大尖山 2 nr
+大局 1105 n
+大局意识 3 n
+大局观 14 n
+大屈辱 3 i
+大屋 91 n
+大屋里 5 ns
+大屏幕 11 nr
+大屏幕显示器 2 l
+大展 115 vn
+大展宏图 1051 nr
+大展经纶 3 n
+大展身手 6 l
+大屠杀 92 nz
+大屯 44 ns
+大屯山 3 ns
+大山 635 ns
+大山子 34 n
+大山深处 12 nz
+大山猫 18 nz
+大山雀 12 n
+大山顶 11 ns
+大屿 2 n
+大屿山 29 ns
+大岗 3 n
+大岛 202 ns
+大岩 9 n
+大岩桐 2 nr
+大岭 14 ns
+大岳 3 ns
+大峡 3 ns
+大峡谷 385 nz
+大峪 14 ns
+大峪谷 18 ns
+大崩盘 3 n
+大嵩阳 13 nr
+大川 32 ns
+大工 25 n
+大工作上 3 l
+大工告成 3 l
+大巧不工 3 i
+大巧若拙 4 i
+大巫 3 n
+大差 3 n
+大差差 3 i
+大巴 91 n
+大巴回 3 nr
+大巴山 338 ns
+大巴山区 4 ns
+大巴扎 3 nrt
+大巴车 11 n
+大巷 3 n
+大市 53 ns
+大市镇 9 ns
+大帅 337 n
+大帅府 2 n
+大师 2856 n
+大师傅 26 nr
+大师傅和 3 nr
+大师杯 3 nz
+大师级 15 b
+大师赛 76 nr
+大帐篷 3 n
+大帝 226 n
+大帽子 12 n
+大幅 1611 d
+大幅度 759 d
+大幅度提高 15 l
+大幅度降低 6 l
+大幅提高 5 l
+大幅让利 3 l
+大幅面 3 d
+大幕 53 n
+大干 71 m
+大干一场 26 m
+大干一票 3 m
+大平 51 n
+大平正芳 3 nr
+大年 106 m
+大年三十 28 m
+大年初一 93 t
+大年初三 5 t
+大年初二 11 t
+大年夜 8 b
+大幸 40 n
+大庄 2 ns
+大庄园 3 ns
+大庄稼 2 n
+大庆 360 ns
+大庆市 26 ns
+大庆油田 37 nz
+大庆石化 3 ns
+大庆石油管理局 4 nt
+大庆网 3 nz
+大庆路 3 nz
+大库 14 n
+大店 3 n
+大庙 150 n
+大庙山 3 nr
+大度 52 n
+大度包容 3 n
+大度路 3 nz
+大座 3 m
+大庭广众 79 i
+大康 5 nz
+大庸 9 d
+大庸市 2 ns
+大庾岭 25 ns
+大廷广众 3 nr
+大开大合 7 nz
+大开方便之门 12 l
+大开杀戒 3 i
+大开眼界 82 i
+大开绿灯 3 n
+大异 10 n
+大异其趣 3 i
+大式 3 n
+大弟 3 n
+大弟嘉 2 nr
+大张 104 m
+大张伟 3 nr
+大张其词 3 i
+大张口 3 n
+大张声势 3 i
+大张挞伐 15 i
+大张旗鼓 145 i
+大当 3 d
+大当家 3 l
+大彩凤 2 nr
+大彰山 3 nr
+大影 2 n
+大彻大悟 33 i
+大征 3 n
+大得人心 3 i
+大得多 3 d
+大微纳 2 nr
+大德 255 nrt
+大忌 144 n
+大志 21 n
+大忙 98 d
+大忙人 11 i
+大忙时节 4 i
+大快人心 44 i
+大快朵颐 13 l
+大总统 192 n
+大恩 14 nr
+大恩大德 78 nr
+大悟 33 n
+大悟县 260 nr
+大患 3 n
+大悦 5 nr
+大悲 115 n
+大悲咒 3 i
+大悲大喜 4 i
+大悲老人 3 i
+大情圣 3 nz
+大惊一场 3 i
+大惊失色 226 i
+大惊小怪 217 i
+大惑不解 101 i
+大意 215 d
+大意失 3 i
+大意失荆 3 n
+大意失荆州 4 n
+大愚若智 2 nr
+大慈大悲 59 i
+大慈法王 8 nz
+大懒猫 3 nr
+大戏 147 n
+大戏台 3 nt
+大戏院 12 nt
+大成 460 v
+大成拳 3 nz
+大成殿 3 nr
+大成者 3 n
+大战 1238 nz
+大戟 3 n
+大戟科 24 n
+大户 481 n
+大户人家 3 n
+大户型 3 n
+大户室 4 n
+大房 3 n
+大房子 50 n
+大扇 3 n
+大手 3 n
+大手印 3 nz
+大手大脚 30 i
+大手笔 75 n
+大才小用 3 i
+大才榱槃 3 z
+大才榱盘 3 vn
+大才槃槃 3 ns
+大才盘盘 3 n
+大才磐磐 3 i
+大打出手 54 i
+大打折扣 3 i
+大扫荡 3 i
+大扫除 13 i
+大扶康 2 nr
+大批 2518 m
+大批三 2 m
+大批二 2 m
+大批出没 3 l
+大批大批 5 m
+大批滋生 3 n
+大批量 97 m
+大批量生产 5 l
+大把大把 3 m
+大报 14 n
+大披巾 3 nr
+大抵 222 d
+大拇指 379 n
+大拇指头 5 n
+大拍卖 3 l
+大拜拜 3 ns
+大括号 3 n
+大拿 10 ns
+大指 3 n
+大振 235 n
+大捷 235 nz
+大捷龙 3 nr
+大排场 3 n
+大排挡 3 i
+大排查 3 l
+大排档 13 j
+大排行 4 j
+大排量 3 n
+大排长龙 3 j
+大接访 3 i
+大提琴 89 n
+大提琴家 4 n
+大提琴手 3 n
+大提花 3 n
+大提速 3 n
+大摇大摆 67 i
+大撒把 2 n
+大操大办 7 nt
+大放 3 nz
+大放厥词 4 i
+大放厥辞 3 nz
+大放异彩 28 i
+大放悲声 22 i
+大放血 3 n
+大放送 3 nz
+大政 147 n
+大政方针 56 n
+大故 3 n
+大敌 173 n
+大敌当前 84 i
+大散关 8 n
+大数 83 n
+大斗 3 n
+大料 4 n
+大新县 2 ns
+大方 559 n
+大方之家 3 l
+大方县 5 ns
+大方向 28 n
+大旋涡 3 n
+大族 156 nz
+大旗 499 n
+大旗网 3 nz
+大无畏 56 i
+大无畏精 3 i
+大旨 9 n
+大早 19 d
+大旱 107 n
+大旱望云 3 n
+大旺堆 3 l
+大昌 13 ns
+大明 4182 nz
+大明公司 4 n
+大明历 25 nz
+大明宫 16 nr
+大明寺 8 nr
+大明山 12 nr
+大明法度 3 n
+大明湖 22 ns
+大易中文 3 nz
+大星 3 nz
+大春 3 ns
+大昭寺 41 nr
+大是大非 51 i
+大显 49 a
+大显手机 3 n
+大显神威 3 i
+大显神通 13 i
+大显身手 71 i
+大晟府 3 nr
+大晴天 3 nr
+大智大勇 18 nr
+大智大愚 3 nr
+大智大慧 11 nr
+大智如愚 3 nr
+大智度 8 n
+大智禅师 3 nr
+大智若愚 20 nr
+大暑 13 n
+大暴走 3 l
+大暴雨 39 i
+大曲 41 n
+大曲酒 11 n
+大月氏 3 nr
+大有人在 94 i
+大有作为 42 i
+大有分别 3 n
+大有可为 25 i
+大有可观 2 l
+大有好转 3 i
+大有巴士 3 n
+大有希望 3 nr
+大有径庭 3 i
+大有文章 22 nr
+大有用武之地 6 l
+大有益处 20 n
+大有裨益 41 i
+大有见地 3 i
+大有起色 3 i
+大有迳庭 3 v
+大朗镇 3 ns
+大望路 3 n
+大朝山 2 nr
+大木 58 n
+大木作 3 ns
+大木头 3 ns
+大木梁 3 nr
+大未必佳 3 nr
+大本 66 n
+大本大宗 3 nz
+大本本 3 n
+大本营 261 n
+大本钟 19 n
+大札萨 2 nr
+大朵 24 n
+大杀风景 3 i
+大杂烩 11 n
+大杂院 28 n
+大权 722 n
+大权在握 37 l
+大权旁落 20 i
+大权独揽 32 i
+大材不用 3 l
+大材小用 14 n
+大村 17 n
+大杨树 282 nr
+大杯 3 m
+大杼 3 n
+大松林 2 nr
+大板 40 n
+大板车 3 n
+大林 63 nz
+大果榆 3 nr
+大枝 3 n
+大枣 72 n
+大枪 42 n
+大柏树 7 nr
+大染坊 3 n
+大染缸 3 n
+大柜 3 n
+大柱 17 n
+大柱子 3 n
+大柳树 50 nr
+大柴旦镇 3 ns
+大栅栏 158 n
+大树 702 n
+大树下 61 l
+大树将军 3 nr
+大树林 2 nr
+大树枝 3 nr
+大树移植 3 nr
+大栗树 5 nr
+大校 168 n
+大样 9 r
+大样图 3 n
+大根 4 nz
+大案 109 n
+大案要案 40 n
+大桥 3288 ns
+大桥吾郎 3 nz
+大桥头 28 ns
+大桥路 37 nz
+大桩 3 m
+大桶 30 m
+大梁 141 n
+大梅沙 3 nr
+大梦 3 nz
+大梦初醒 12 i
+大梦方醒 3 l
+大梵天 4 n
+大棒 60 n
+大棕桐 5 nr
+大棚 59 n
+大棚菜 4 n
+大棵 3 m
+大椎 3 n
+大椎穴 47 n
+大楷 2 n
+大楼 934 n
+大楼住户 3 n
+大概 3331 d
+大榆树 20 nr
+大榆洞 2 nr
+大榕树 3 nr
+大槐树 39 ns
+大樟 5 ns
+大模大样 79 l
+大樱桃 3 nr
+大檐帽 6 n
+大款 68 n
+大正 15 d
+大步 255 d
+大步流星 25 nz
+大步行走 3 l
+大武 41 nr
+大武口区 3 ns
+大武山 3 ns
+大武溪 3 nr
+大殓 3 v
+大段 60 n
+大殿 1522 n
+大比 3 j
+大比分 3 l
+大比拼 3 nr
+大比武 3 nr
+大毛 14 n
+大氅 24 n
+大民 2 n
+大气 1927 n
+大气候 30 n
+大气压 105 n
+大气压力 3 n
+大气团 3 n
+大气圈 74 n
+大气学 3 n
+大气层 248 n
+大气污染 3 i
+大气物理 37 n
+大气环境 3 l
+大气现象 3 n
+大气磅礴 21 i
+大气窗 3 n
+大气质量 3 n
+大气迁移 3 i
+大水 170 n
+大水坑 3 n
+大水库 3 nz
+大水池 3 n
+大水沟 3 ns
+大水法 20 n
+大水牛 3 nz
+大水缸 3 nz
+大汉 1121 ns
+大汉工商 3 nz
+大汉族主义 7 nz
+大汉民族 3 nz
+大汗 3 ns
+大汗淋漓 80 l
+大汛 8 n
+大江 578 ns
+大江东去 30 i
+大江健 3 nr
+大江健三郎 14 nz
+大江南北 144 ns
+大江网 3 nz
+大汶口 51 ns
+大汶河 8 ns
+大沙河 17 ns
+大沟 21 ns
+大沥镇 3 nr
+大河 585 ns
+大河上下 4 i
+大河乡 21 ns
+大河家乡 3 ns
+大河恋 3 nr
+大河村 11 ns
+大河网 3 nz
+大油 10 n
+大治 20 n
+大治山 3 ns
+大治村 3 n
+大沽 102 ns
+大沽口 526 ns
+大沽路 3 ns
+大沿帽 3 nz
+大泉 10 nz
+大泉眼 3 n
+大法 220 n
+大法官 41 n
+大法小廉 3 l
+大法师 3 n
+大波 2 n
+大波妹 3 nr
+大波斯菊 3 nr
+大波浪 3 nz
+大泽 50 n
+大泽乡 9 ns
+大泽山 10 nr
+大泽贵雄 3 nr
+大泽隆夫 3 nr
+大洋 788 ns
+大洋彼岸 3 ns
+大洋新闻 3 nz
+大洋河 5 ns
+大洋洲 312 ns
+大洋洲人 3 n
+大洋网 3 nz
+大洋论坛 3 n
+大洞 182 n
+大津 3 ns
+大洪山 274 nr
+大洲 203 ns
+大洲岛 9 ns
+大洼 3 n
+大洼县 4 ns
+大流 3 n
+大流士 20 n
+大流氓 3 n
+大浦 4 ns
+大浪 61 nz
+大浪淘沙 10 nz
+大海 1186 ns
+大海侵 2 nr
+大海子 3 nr
+大海战 3 nz
+大海捞针 33 i
+大海棠 2 nr
+大海鲢 3 n
+大海鸟 3 nr
+大涌谷 2 nr
+大润发 3 nz
+大涧村 3 nr
+大涨大跌 3 l
+大清 2819 b
+大清国 109 ns
+大清堂 24 nr
+大清建 2 nr
+大清律 6 nr
+大清早 87 l
+大清水溪 3 ns
+大清河 60 ns
+大清真寺 3 nr
+大渐弥留 3 i
+大渡口 2 n
+大渡口区 2 n
+大渡桥横铁索寒 2 i
+大渡河 142 ns
+大港 151 ns
+大港区 7 ns
+大港油田 11 nt
+大湖 580 ns
+大湖地区 12 ns
+大湖型 3 nz
+大湖塘 2 ns
+大湖山庄 3 ns
+大湖镇 3 ns
+大湾 268 ns
+大湾特 512 ns
+大源 11 n
+大溜 13 m
+大溪 38 ns
+大溪地 3 nz
+大溪港 3 ns
+大溪镇 2 ns
+大满贯 3 nr
+大滩 14 n
+大漆 10 n
+大漠 399 n
+大漠风 3 n
+大潭 6 ns
+大潮 206 n
+大澳 14 ns
+大火 557 n
+大灯 27 n
+大灰熊 3 n
+大灰狼 30 n
+大灶 28 n
+大灾 3 n
+大灾之年 3 l
+大灾难 3 l
+大炮 1013 n
+大炮仗 7 n
+大点 3 n
+大炼钢铁 3 nz
+大烟 75 n
+大烟囱 3 n
+大烟鬼 11 n
+大热天 34 n
+大热已去 3 l
+大煞风景 20 i
+大煞风趣 3 i
+大熊 71 n
+大熊座 25 n
+大熊星座 3 n
+大熊猫 292 n
+大燕国 2 nr
+大爆光 3 nz
+大父 3 n
+大爷 1046 n
+大片 1274 n
+大片大片 55 nz
+大牌 326 n
+大牙 74 ns
+大牛市 3 ns
+大牛股 3 n
+大牢 109 d
+大牧场 3 n
+大牲畜 3 n
+大特写 2 nr
+大犬座 17 n
+大独裁者 3 n
+大猩猩 23 n
+大猫 3 n
+大猫熊 3 nr
+大率 3 n
+大玉儿 2 nr
+大玉海 2 nr
+大王 915 nrt
+大王子 21 nr
+大王峰 2 nr
+大王旗 3 nr
+大王镇 11 nr
+大玩特玩 3 n
+大环内酯 3 nz
+大环配体 3 n
+大珠 3 n
+大珠小珠落玉盘 4 i
+大班 10 ns
+大班制 3 n
+大班台 3 ns
+大班椅 3 n
+大球 10 n
+大球场 6 n
+大理 958 n
+大理人 20 n
+大理寺 519 nz
+大理岩 70 n
+大理州 13 ns
+大理市 33 n
+大理白族自治州 23 ns
+大理石 479 n
+大理石厂 3 n
+大理站 3 n
+大理院 3 nt
+大瑶山 28 ns
+大璞不完 3 nr
+大瓶 3 m
+大生 98 n
+大生产 77 n
+大用 3 n
+大用场 3 n
+大用处 3 n
+大田 42 nz
+大田作物 10 l
+大田制度 3 l
+大田县 2 ns
+大田庄 6 nr
+大田庄乡 5 ns
+大田湾 3 ns
+大甲 9 b
+大甲溪 23 nz
+大甲镇 3 n
+大男人主义 2 nz
+大男大女 3 l
+大男子主义 17 n
+大甸子 4 n
+大略 86 n
+大略在 3 n
+大略是 3 n
+大略有 3 i
+大病 253 n
+大痴 3 n
+大白 83 n
+大白于天下 13 i
+大白兔 3 n
+大白天 49 n
+大白天下 4 i
+大白熊 3 z
+大白痴 3 z
+大白菜 49 n
+大白话 11 n
+大白鲨 3 nz
+大白鼠 3 n
+大百科全 3 nz
+大百科全书 93 nz
+大盂鼎 4 nr
+大盈江 3 nr
+大盐 41 n
+大盒 3 n
+大盖 3 n
+大盖帽 13 n
+大盗 143 n
+大盘 946 n
+大盘商 3 n
+大盘股 21 n
+大盘走势 3 n
+大盘鸡 3 n
+大直 3 d
+大直国中 3 ns
+大直国小 3 l
+大直若屈 3 i
+大相国寺 31 nr
+大相岭 3 nr
+大相庭径 3 i
+大相径庭 105 i
+大相迳庭 3 nz
+大真 3 nz
+大眼 3 m
+大眼瞪 3 a
+大眼袋 3 n
+大眼贼 20 n
+大石 552 n
+大石围 3 n
+大石坝 2 ns
+大石头 142 n
+大石板 20 n
+大石桥 29 ns
+大石桥市 3 ns
+大石牌 4 n
+大石碑 16 n
+大石镇 3 ns
+大砍刀 3 i
+大研 3 n
+大研镇 3 n
+大破大立 3 i
+大硕 2 nrt
+大硬盘 3 n
+大碍 141 n
+大碗 352 m
+大碗茶 9 n
+大碟 5 n
+大礼 474 nz
+大礼包 12 n
+大礼堂 148 nr
+大礼拜 5 nr
+大礼服 4 nr
+大礼盒 3 n
+大礼议 7 n
+大社 30 n
+大祖庭 2 n
+大祚荣 13 nr
+大神 197 n
+大神一郎 3 l
+大祥 4 nr
+大祥区 3 n
+大票 3 n
+大祭司 3 nr
+大祸 432 n
+大祸临头 3 i
+大禅林 2 nr
+大福 15 nz
+大福星 3 nr
+大福晋 4 nr
+大福源 3 nr
+大禹 78 nz
+大禹岭 3 nr
+大禹治水 31 l
+大禾 4 nz
+大秋 3 nr
+大秋作物 3 l
+大种 8 r
+大秦线 4 nz
+大秦铁路 5 nz
+大秧歌 11 n
+大程 2 n
+大程度 45 n
+大空翼 3 n
+大窑湾 3 ns
+大立柜 13 nr
+大站 12 n
+大端 9 n
+大竹 26 n
+大竹县 3 ns
+大竹岭 2 ns
+大竹林 2 nr
+大竹溪 3 nr
+大竺葵 3 n
+大笑 1313 v
+大笑一场 3 l
+大笑一声 3 i
+大笑不止 13 l
+大笑话 3 l
+大笔 197 m
+大笔一挥 3 i
+大笔如椽 3 nr
+大笨象 3 l
+大笨鸟 3 l
+大筛法 3 nr
+大管 3 n
+大管家 3 n
+大箱 3 n
+大箱子 3 n
+大篆 25 n
+大篇 3 m
+大篇幅 3 n
+大篮 3 n
+大篷车 65 n
+大篷车队 3 n
+大米 1898 m
+大米粥 2 nz
+大米饭 11 n
+大类 3 n
+大粒 3 n
+大粪 27 n
+大粪池 3 n
+大粪球 3 n
+大系 29 n
+大索 3 n
+大红 753 b
+大红人 20 n
+大红包 3 n
+大红大紫 11 nr
+大红大绿 10 z
+大红纸 8 nz
+大红色 10 n
+大红花 3 n
+大红袍 39 n
+大红门 270 n
+大红鹰 3 nr
+大约 3858 d
+大约克 3 ns
+大约摸 3 i
+大纲 739 n
+大线 3 n
+大经 3 d
+大经堂 5 n
+大经大法 3 nz
+大结局 3 n
+大统 70 n
+大维 100 n
+大维娅 5 nr
+大缆 3 n
+大缪不然 3 nr
+大缸 3 n
+大罐 3 n
+大网 52 nz
+大罗 48 nz
+大罗神仙 3 nr
+大罢工 3 nz
+大美女 3 n
+大羚羊 3 n
+大群 3 n
+大群人马 3 ns
+大老二 3 nr
+大老婆 42 nr
+大老官 3 nr
+大老爷 175 nr
+大老爷们 10 n
+大老爷们儿 6 n
+大老粗 30 z
+大老级 3 n
+大老远 42 nr
+大考 34 v
+大考大玩 3 n
+大而全 3 i
+大而化之 9 i
+大而无当 16 i
+大而言之 3 i
+大耳贼 3 n
+大职校 3 l
+大联勤 7 j
+大聚义 2 nz
+大聚会 3 nz
+大肆 560 d
+大肆厥辞 3 i
+大肆咆哮 3 v
+大肆宣传 9 l
+大肆宣扬 3 nr
+大肆挥霍 3 nr
+大肆铺张 3 l
+大肉 39 n
+大肉棒 3 nz
+大肚 26 n
+大肚婆 3 n
+大肚子 81 n
+大肚子痞 3 n
+大肚汉 3 n
+大肚溪 3 n
+大肚皮 3 n
+大肚腩 3 n
+大肚量 3 m
+大肠 162 n
+大肠杆菌 81 l
+大肠癌 90 n
+大肠经 3 n
+大肠菌 3 n
+大肠菌类 3 n
+大肠菌群 6 n
+大胆 1539 n
+大胆冲破 3 i
+大胆包身 3 i
+大胜 378 nr
+大胡子 202 nr
+大脑 862 n
+大脑库 3 n
+大脑炎 3 n
+大脑皮层 170 l
+大脑皮质 20 l
+大脑神经 13 l
+大脖子病 4 n
+大脚 85 n
+大脚姆趾 3 n
+大脚怪 3 i
+大脚板 3 n
+大腕 52 n
+大腕儿 3 n
+大腹便便 15 l
+大腹皮 3 n
+大腿 276 n
+大腿肉 3 n
+大腿骨 11 n
+大臣 6120 n
+大自在天 2 i
+大自然 541 d
+大致 1992 d
+大致相同 3 i
+大致说来 14 l
+大舅 107 n
+大舅妈 3 n
+大舅子 37 n
+大舌头 17 n
+大舜 8 n
+大舟 2 nz
+大航 4 j
+大航海家 3 nz
+大船 392 n
+大艘 3 m
+大良史 2 nr
+大良平 2 nr
+大良镇 3 nr
+大艺 2 n
+大节 31 n
+大节不夺 3 i
+大芬村 3 nr
+大芯板 3 n
+大花脸 17 i
+大苏打 3 nz
+大苗山 8 ns
+大苦湖 5 ns
+大英 20 nz
+大英博物馆 18 ns
+大英县 3 ns
+大英国协 3 nt
+大英帝国 35 ns
+大英百科全书 9 nz
+大茴香 3 n
+大荒 3 n
+大荔 27 nrt
+大荔县 9 ns
+大莫与京 3 nz
+大获全胜 97 i
+大菜 35 n
+大菠萝 3 n
+大菱鲆 3 nr
+大萝卜 10 n
+大营 406 b
+大营子镇 4 n
+大营门 2 n
+大葆台 7 ns
+大葱 41 b
+大蒜 166 n
+大蒜油 3 i
+大蒜素 3 i
+大蓉 4 n
+大蓟 3 n
+大蕉 3 n
+大藏 67 ns
+大藏相 3 n
+大藏省 78 ns
+大藏经 75 nz
+大藤峡 6 nr
+大虎 23 nz
+大虫 181 n
+大虾 44 n
+大蛇丸 3 nr
+大蛇雉 3 nr
+大螯虾 3 nz
+大血藤 3 n
+大行 3 n
+大行其道 46 i
+大行大市 3 ns
+大行宫 3 n
+大行星 84 n
+大衍历 7 nz
+大街 2697 ns
+大街坊 3 nz
+大街小巷 443 i
+大衣 350 n
+大衣呢 9 n
+大衣无缝 3 i
+大衣柜 3 n
+大补丸 3 nr
+大补帖 3 nr
+大补贴 3 n
+大表哥 3 n
+大表妹 3 n
+大表姊 3 nr
+大表弟 3 n
+大表惊叹 3 i
+大衿衫 3 nr
+大袄 3 n
+大袋 3 n
+大袋蛾 3 n
+大袋鼠 6 n
+大褂 69 n
+大襟 69 n
+大西 58 ns
+大西军 3 nr
+大西北 42 ns
+大西南 23 ns
+大西洋 1518 ns
+大西洋城 8 ns
+大西洲 10 ns
+大西海 2 ns
+大西海子 3 ns
+大西海子水库 2 nz
+大西门 12 ns
+大要 38 b
+大要案 6 n
+大观 324 n
+大观区 3 n
+大观园 134 n
+大观楼 33 n
+大观览车 3 n
+大观路 3 n
+大规 9 n
+大规模 3965 b
+大规模化 3 l
+大规模集 3 i
+大视野 3 n
+大觉寺 3 nr
+大角 3 n
+大角山 2 ns
+大角鹿 12 n
+大解密 3 n
+大言不惭 65 i
+大计 189 n
+大计小用 3 n
+大记 3 n
+大讲堂 6 n
+大词典 3 n
+大词库 3 n
+大话 100 n
+大话三国 3 n
+大话西游 3 n
+大诰 3 v
+大请大受 3 i
+大调 62 n
+大谋不谋 3 i
+大谬 3 n
+大谬不然 13 i
+大谱 3 n
+大谷 12 n
+大豆 454 n
+大豆价格 3 n
+大豆制品 3 n
+大豆油 34 nz
+大豆磷脂 3 nz
+大豆胶 3 n
+大豆蚜 3 n
+大豆蛋白 3 l
+大豆黄卷 3 nz
+大象 271 n
+大象无形 3 i
+大象者 3 n
+大象项目 3 n
+大豪 30 n
+大豪杰 3 nr
+大财团 3 nt
+大贤 11 nr
+大败 861 n
+大败亏轮 3 l
+大败亏输 35 i
+大败敌军 3 i
+大费周章 3 n
+大资产阶 3 n
+大赌 3 v
+大赔 3 v
+大赚一票 3 l
+大赛 1020 n
+大赢家 3 n
+大赤色 3 nr
+大赦 144 v
+大赦令 4 n
+大赦天下 35 i
+大起大落 75 l
+大足 26 d
+大足县 6 ns
+大跃进 571 nz
+大跌 36 v
+大跌眼镜 32 l
+大跨一步 3 v
+大路 368 n
+大路口 8 n
+大路惠美 3 nr
+大路椎轮 3 n
+大路歌 2 n
+大路活 3 n
+大路菜 3 n
+大路货 19 n
+大路通 3 nz
+大跳水 3 ns
+大踏步 416 d
+大身 3 r
+大车 141 n
+大车以载 3 i
+大转弯 3 n
+大转折 3 i
+大转盘 3 n
+大轴子 3 n
+大轿车 3 n
+大辂椎轮 3 r
+大输 3 n
+大输一场 3 n
+大输液 3 n
+大辞典 3 n
+大辩不言 3 l
+大辩论 34 n
+大边 3 d
+大过天 3 d
+大过年 3 d
+大迈阿密 2 nrt
+大运 23 n
+大运会 3 nz
+大运村 3 nz
+大运河 128 nz
+大远 2 d
+大连 1034 d
+大连人 12 n
+大连商品交易所 3 nt
+大连实德 198 nz
+大连实德俱乐部 8 nt
+大连实德队 67 nz
+大连市 397 ns
+大连市人民政府 4 nt
+大连市委 5 nt
+大连接体 3 n
+大连旅游 3 nz
+大连日报 3 nz
+大连海事大学 4 nt
+大连港 36 ns
+大连湾 37 ns
+大连理工 3 n
+大连理工大学 43 nt
+大连经济技术开发区 3 nt
+大连网 3 nz
+大连酒店 3 n
+大连队 95 n
+大迪克 3 nz
+大逃杀 3 i
+大逆不道 123 i
+大逆无道 5 i
+大逆转 3 i
+大选 626 v
+大选年 3 n
+大通 137 nz
+大通关 3 n
+大通区 3 n
+大通县 2 ns
+大通回族土族自治县 4 ns
+大通曼哈顿银行 10 nt
+大通河 19 ns
+大通道 300 n
+大通银行 4 nt
+大道 8614 n
+大道北 3 ns
+大道理 37 n
+大道至简 3 nr
+大邑 26 ns
+大邑县 14 ns
+大邱 15 ns
+大邱庄 5 nr
+大部 809 n
+大部件 2 m
+大部份 33 m
+大部分 4855 m
+大部分具 2 m
+大部分处 3 m
+大部分种 5 m
+大部地区 3 n
+大部头 26 m
+大都 2129 ns
+大都会 75 nz
+大都城 534 ns
+大都如此 3 i
+大都市 72 ns
+大都市圈 3 nz
+大酒店 237 n
+大酒楼 3 n
+大酱 6 n
+大醇小疵 2 i
+大醉侠 3 nr
+大里 10 r
+大野 21 n
+大量 10535 n
+大量元 5 m
+大量出 24 m
+大量列 5 b
+大量包 3 n
+大量库存 3 n
+大量排 5 m
+大量文 3 nz
+大量文件 4 n
+大量次 3 m
+大量美元 3 m
+大量重 5 b
+大金 3 n
+大金刚 8 nr
+大金国 19 ns
+大金塔 18 nr
+大金朝 5 nr
+大金湖 3 nr
+大金矿 3 n
+大钞 9 n
+大钟 53 m
+大钟寺 7 nr
+大钢琴 3 nz
+大钦茂 2 nr
+大钱 172 n
+大钳 3 n
+大铁鼎 3 nz
+大锅 87 n
+大锅水 3 n
+大锅菜 2 n
+大锅饭 91 n
+大错特错 53 i
+大锣 3 n
+大锤 3 n
+大锦 19 n
+大锦心 3 nr
+大锦见 2 nr
+大锻 3 nz
+大长篇 3 b
+大长老 10 nr
+大门 3262 n
+大门五郎 3 n
+大门口 368 ns
+大间 3 n
+大闸 5 n
+大闸蟹 14 n
+大闹一场 3 l
+大闹天宫 3 n
+大闺女 3 n
+大阔海牌 2 i
+大队 1655 n
+大队人马 152 n
+大队长 120 n
+大阪 391 ns
+大阪市 8 ns
+大阪府 3 nt
+大阮 3 nr
+大阳 5 ns
+大阳烛 8 n
+大阳线 3 nz
+大陆 6521 n
+大陆军 26 n
+大陆军队 7 nt
+大陆同胞 3 n
+大陆坡 59 n
+大陆型 3 n
+大陆妹 3 n
+大陆度 3 n
+大陆性 186 n
+大陆性气 3 n
+大陆性气候 194 n
+大陆架 387 n
+大陆桥 14 n
+大陆棚 3 n
+大陆歌手 3 n
+大陆法系 3 n
+大陆泽 2 n
+大陆漂移 3 i
+大陆航空公司 6 nt
+大陆行 3 nt
+大陆货 3 n
+大限 56 n
+大限已至 3 l
+大限度 59 n
+大院 319 n
+大院君 3 nr
+大院里 82 ns
+大险 3 n
+大陵 3 ns
+大难 194 d
+大难不死 30 i
+大难临头 57 i
+大雁 94 n
+大雁塔 14 nr
+大雄 3 n
+大雄宝殿 91 nr
+大雄殿 4 nr
+大雅 54 ns
+大雅之堂 29 nr
+大雅君子 3 nr
+大雅大俗 2 n
+大集 62 n
+大雕 3 n
+大雨 508 n
+大雨倾盆 31 n
+大雨天 3 i
+大雨如注 16 i
+大雨淋 9 nr
+大雨滂沱 20 l
+大雪 378 n
+大雪山 70 nr
+大雪崩 4 n
+大雪纷飞 27 i
+大雾 126 n
+大雾山 5 ns
+大震 3 n
+大霸尖山 3 n
+大青叶 3 nr
+大青叶蝉 2 nr
+大青山 72 nr
+大青龙汤 3 nz
+大静脉 3 n
+大面 10 n
+大面儿 3 n
+大面积 567 n
+大革 2 nz
+大革命 562 nz
+大韩民国 23 ns
+大韩航空公司 13 nt
+大音希声 3 nz
+大音阶 3 n
+大顶 3 n
+大项 42 m
+大顺 588 nz
+大顺倡 3 nr
+大顺兵 8 nr
+大顺军 227 nr
+大顺国 14 ns
+大顺朝 140 nr
+大顺永 3 nr
+大顺皇 4 nr
+大顺礼 6 nr
+大顺钦 4 nr
+大颗 3 m
+大题 3 n
+大题小作 3 i
+大题小做 3 i
+大题目 3 n
+大颚 3 n
+大额 83 n
+大风 408 n
+大风堂 3 n
+大风大浪 76 nz
+大风子 3 n
+大风歌 3 n
+大风车 2 n
+大风雨 3 i
+大风雪 3 n
+大飞扬草 3 i
+大飞翼 2 i
+大飞跃 3 nr
+大食 3 n
+大食帝国 3 ns
+大餐 65 n
+大饭店 3 ns
+大饱口福 3 nz
+大饱眼福 22 nz
+大饼 56 n
+大香格 2 nr
+大马 80 ns
+大马力 8 n
+大马哈鱼 21 nz
+大马士革 97 nz
+大马帮 3 nr
+大马路 34 nz
+大马金刀 3 n
+大驾光临 3 nr
+大骗子 3 n
+大骨节 5 n
+大骨节病 9 n
+大鱼 119 n
+大鱼吃 3 l
+大鱼吃小鱼 14 i
+大鱼大肉 27 i
+大鱼河 2 ns
+大鱼缸 3 nz
+大鱼际 6 n
+大鲨 4 nz
+大鲵 306 n
+大鸟 3 n
+大鸣大放 3 l
+大鸨 14 n
+大鸭梨 3 n
+大鸿米店 3 nz
+大鹏 43 nr
+大鹏湾 12 nr
+大鹏金 3 nr
+大鹏鸟 5 nr
+大鹰 17 nz
+大鹿岛村 3 ns
+大麦 339 n
+大麦病毒 3 n
+大麦芽 3 nr
+大麦茶 3 nr
+大麴酒 3 vn
+大麻 113 n
+大麻哈鱼 20 l
+大麻子 53 n
+大麻烟 3 n
+大麻碱 3 n
+大麻类 2 n
+大麻苷 3 n
+大麻袋 3 n
+大麻里 3 nr
+大黄 120 b
+大黄山 3 ns
+大黄山市 3 ns
+大黄蜂 3 n
+大黄页 3 n
+大黄鱼 37 n
+大黑 142 ns
+大黑摩季 3 nr
+大黑汀 5 ns
+大黑河 15 ns
+大鼎 8 nz
+大鼓 129 n
+大鼠 3 n
+大鼻子 45 n
+大齿 3 n
+大龄 39 n
+大龄青年 7 n
+大龙 73 nz
+大龙峒 3 ns
+大龙湫 3 nz
+大龙潭 2 ns
+大龙藤 2 nr
+大龙虾 3 nr
+大龙街 3 ns
+大龙邮票 3 n
+夨 16 zg
+天 35979 q
+天一 194 b
+天一亮 10 nr
+天一明 3 nz
+天一阁 26 nr
+天丁 3 nz
+天上 1256 s
+天上人间 33 n
+天上圣母 3 nr
+天上天下 3 i
+天上掉 3 i
+天上石麟 3 nr
+天上碑 3 n
+天上飞 3 nr
+天上麒麟 3 nr
+天下 6255 s
+天下一家 8 l
+天下为一 3 l
+天下为公 20 l
+天下为家 4 l
+天下为笼 3 n
+天下乌鸦一般黑 8 l
+天下事 115 n
+天下人 151 n
+天下兴亡 15 i
+天下大乱 129 i
+天下大事 3 l
+天下大同 3 l
+天下大治 42 l
+天下太平 92 n
+天下奇闻 3 i
+天下布武 3 ns
+天下归心 3 i
+天下扬名 3 i
+天下无双 95 i
+天下无敌 107 i
+天下无难事 6 i
+天下本无 3 l
+天下杂志 3 n
+天下武林 3 ns
+天下汹汹 3 i
+天下父母 3 n
+天下独步 3 l
+天下第一 620 l
+天下第一关 11 l
+天下网 3 n
+天下英雄 3 nr
+天下莫敌 3 i
+天下足球 3 n
+天不从人 3 i
+天不作美 2 i
+天不假年 3 t
+天不怕 82 l
+天不怕地 3 l
+天不绝人 3 i
+天与人归 5 i
+天与地 3 n
+天世钧 2 nr
+天业 25 n
+天主 56 n
+天主堂 26 n
+天主教 1511 nz
+天主教会 136 n
+天主教堂 38 n
+天主教徒 95 n
+天主教派 11 n
+天主教爱国会 257 nt
+天义 15 n
+天义伯 17 nr
+天义叔 73 nr
+天义站 4 n
+天之云 3 nr
+天之僇民 3 v
+天之娇 2 nr
+天之戮民 3 i
+天之痕 3 nr
+天之骄子 18 i
+天乐 5 n
+天乙道人 7 n
+天书 78 n
+天书奇谭 3 i
+天云 2 nr
+天云山 5 ns
+天井 236 n
+天井关 3 ns
+天京 3 ns
+天亮 630 nr
+天亲 3 n
+天人 168 n
+天人之分 3 l
+天人之际 3 l
+天人互动 3 l
+天人共鉴 3 i
+天人关系 3 l
+天人合一 39 l
+天从人原 3 i
+天从人愿 2 i
+天付良缘 3 nr
+天仙 212 n
+天仙子 10 nr
+天仙子胺 3 nz
+天仙藤 3 nr
+天仙配 15 nr
+天价 127 n
+天份 3 nz
+天会 45 n
+天伦 13 ns
+天伦之乐 46 i
+天伦乐 3 ns
+天低吴楚 3 z
+天佑 40 nz
+天佑民安 3 vn
+天体 1092 n
+天体力学 3 l
+天体浴 3 nr
+天体营 3 nr
+天作之合 10 i
+天使 365 n
+天使力 3 n
+天使花房 3 n
+天保 38 nz
+天保九如 3 nr
+天保奴 2 nr
+天候 38 n
+天候不佳 3 nz
+天假之年 3 i
+天假其年 3 i
+天假因缘 3 i
+天假良缘 3 i
+天健信 3 nz
+天健网 3 nz
+天儿 17 n
+天元 80 q
+天元区 3 n
+天元战 16 nz
+天元赛 4 nr
+天兆 2 nz
+天光 112 n
+天光云影 2 i
+天兔 3 n
+天全 14 nz
+天全县 5 nr
+天公 26 nr
+天公不作美 7 i
+天公地道 8 n
+天兴 20 b
+天兴元 4 nr
+天兴州 2 ns
+天兴洲 2 ns
+天兴里 3 ns
+天兵 72 n
+天兵天将 12 i
+天兵神将 3 i
+天养 3 n
+天内 3 s
+天军 2 n
+天冠山 2 nr
+天冬 13 t
+天冬氨酸 3 nz
+天冬草 2 nr
+天冬酰胺 3 nz
+天冷 3 ns
+天净沙 3 nz
+天凝地闭 3 n
+天分 33 n
+天刚亮 8 nr
+天刚明 2 nr
+天剑 7 nz
+天剑剑 3 nr
+天半 3 ns
+天华 62 nz
+天华乱坠 3 i
+天南 32 ns
+天南地北 45 ns
+天南星 24 nz
+天南海北 36 ns
+天卫 9 nz
+天原 10 ns
+天厨 13 nz
+天变 3 nz
+天台 91 n
+天台乌药 2 i
+天台县 6 ns
+天台宗 49 nr
+天台寺 2 ns
+天台山 87 ns
+天台路迷 3 nz
+天各一方 28 l
+天合 5 n
+天同 5 n
+天同寿 6 nr
+天同星 3 nz
+天名精 3 nr
+天后宫 18 nr
+天后庙 5 nr
+天后级 3 l
+天呀 59 e
+天周 3 t
+天命 241 nz
+天命之誓 3 i
+天命攸归 3 i
+天命有归 3 i
+天命难违 3 i
+天园 7 n
+天国 90 ns
+天国阶梯 3 n
+天图 6 n
+天圆 22 n
+天圆地方 3 n
+天圣 32 ns
+天地 1989 n
+天地万物 3 l
+天地不容 3 i
+天地人 11 n
+天地会 566 j
+天地创造 3 l
+天地剖判 3 n
+天地合一 3 b
+天地生 4 nz
+天地经纬 3 n
+天地网 3 nz
+天地良心 20 i
+天地英雄 3 ns
+天地诛戮 3 i
+天地诛灭 3 i
+天地豪情 3 n
+天地长久 3 i
+天地间 3 n
+天坍地陷 3 vn
+天坑 2 n
+天坛 389 n
+天坛公园 9 ns
+天坛医院 7 nt
+天坛生物 4 nt
+天城 26 ns
+天域 16 n
+天基 9 nz
+天堂 1264 n
+天堂二 3 i
+天堂伞 3 nr
+天堂地狱 3 i
+天堂家园 3 ns
+天堂寨 3 nr
+天堂门 3 ns
+天堂鸟 3 nr
+天堑 231 n
+天塌下来 3 i
+天塌地陷 15 i
+天塔 3 nz
+天壤 8 n
+天壤之别 61 i
+天壤之隔 3 i
+天壤悬隔 3 i
+天壤王郎 3 n
+天士力 29 nz
+天声 3 n
+天外 48 s
+天外天 4 l
+天外有天 34 l
+天外来客 8 i
+天外飞仙 3 i
+天外飞来 11 l
+天大 681 nz
+天大圣 3 ns
+天大地大 5 ns
+天天 1855 t
+天天向上 7 l
+天天开心 3 i
+天天新 3 nz
+天天点 3 n
+天天见 3 nr
+天头 7 n
+天夺之年 3 i
+天夺之魄 3 i
+天夺其魄 2 i
+天女 33 n
+天女下凡 3 l
+天女散花 24 n
+天姿 6 n
+天姿国色 6 l
+天威 132 ns
+天威保变 49 l
+天威旗 2 nr
+天威者 3 n
+天威英 49 nr
+天威莫 3 nr
+天威集团 4 nt
+天娱 2 n
+天子 1663 n
+天子山 3 nr
+天子门生 3 n
+天字 39 nz
+天字号 11 n
+天字第一 3 l
+天字第一号 16 nz
+天学国 3 n
+天宁 3 ns
+天宁区 3 ns
+天宁寺 27 ns
+天宁岛 3 ns
+天宇 286 nr
+天安 273 nz
+天安门 34010 ns
+天安门国旗护卫队 12 nt
+天安门城楼 6323 ns
+天安门广场 6940 ns
+天宏 5 nz
+天宗 9 nz
+天官 3 n
+天官赐福 3 nr
+天宝 214 nz
+天宝初 9 nr
+天宝当年 3 i
+天宝时 3 nr
+天宝末 2 nr
+天宝栈 2 nr
+天宝龙 3 nr
+天客隆 2 nr
+天宫 240 ns
+天容 3 n
+天富 6 nz
+天寒 20 b
+天寒地冻 53 i
+天寒岁暮 3 i
+天将 110 n
+天尊 93 n
+天尊宣 3 nr
+天尊玄 2 nr
+天屠龙 14 nz
+天山 679 ns
+天山区 3 ns
+天山南北 86 ns
+天山南路 3 ns
+天山山脉 47 ns
+天山童姥 3 nr
+天山纺织 3 nz
+天山网 3 nz
+天山路 3 nz
+天峨 3 nrt
+天峨县 2 ns
+天峰岭 2 ns
+天峻 3 nr
+天峻县 2 ns
+天崖 41 n
+天崩地塌 3 i
+天崩地裂 35 i
+天崩地解 3 i
+天崩地陷 4 i
+天工 44 n
+天工人代 3 n
+天工开物 3 l
+天差地别 4 i
+天差地远 28 i
+天师 170 n
+天帝 34 n
+天幕 59 n
+天干 61 n
+天干地支 3 ns
+天平 164 n
+天平地成 3 ns
+天平室 3 nz
+天平山 7 ns
+天平座 3 nz
+天平秤 7 nz
+天平集 3 ns
+天年不测 3 l
+天年不遂 3 l
+天年不齐 3 i
+天幸 72 n
+天广 17 nz
+天庆 15 ns
+天庆元 2 nz
+天庆宝 2 nr
+天底 3 t
+天底下 146 s
+天府 1002 n
+天府之国 22 nr
+天府之星 3 nr
+天府广场 5 ns
+天府热线 3 n
+天庭 17 n
+天庭饱满 3 i
+天开 19 v
+天开地辟 4 i
+天开眼 3 l
+天弓 3 nz
+天微微 5 nr
+天德 176 nrt
+天德军 2 nr
+天心 87 n
+天心区 3 n
+天心岩 2 nr
+天心洲 257 ns
+天怒人怨 19 i
+天性 318 n
+天恩 13 nr
+天恩祖 2 nr
+天悬地隔 3 i
+天惊石破 3 i
+天愁地惨 7 i
+天意 150 n
+天成 46 nr
+天成地平 3 nz
+天房 22 n
+天才 467 n
+天才儿童 3 nr
+天才少年 3 nr
+天才梦 2 nr
+天才论 3 i
+天打雷劈 10 i
+天打雷轰 3 nr
+天择 3 v
+天捷星 2 nr
+天授 3 n
+天授礼法延祚 20 l
+天摇地动 12 i
+天摧地塌 3 i
+天放 3 nz
+天敌 136 n
+天数 104 n
+天文 984 nz
+天文单位 31 n
+天文历算 20 l
+天文台 300 nr
+天文地理 22 ns
+天文学 446 nt
+天文学史 9 n
+天文学家 403 n
+天文家 9 n
+天文数字 35 n
+天文系 2 n
+天文表 3 n
+天文钟 10 nr
+天文馆 28 n
+天新网 3 nz
+天方 24 n
+天方夜 3 l
+天方夜谭 71 i
+天方教 3 nz
+天方药业 7 nz
+天旋地转 72 i
+天无二日 3 nz
+天无绝人 3 i
+天无绝人之路 39 i
+天日 54 t
+天旱 3 n
+天时 164 t
+天时地利 26 nz
+天时地利人和 11 nz
+天时达 3 nz
+天明 380 nz
+天昏地惨 3 i
+天昏地暗 50 i
+天昏地转 3 i
+天昏地黑 5 i
+天星 751 nz
+天星哥 2 nr
+天星村 3 nr
+天星桥 4 nr
+天显 8 a
+天晓得 21 nr
+天晓方 2 nr
+天晴 19 nr
+天晴依 3 nr
+天智叔 4 nr
+天暗 3 n
+天曼桢 2 nr
+天有一算 3 l
+天有不测 3 i
+天有不测风云 33 i
+天朗 3 ns
+天朗气清 7 l
+天朝 158 t
+天未明 4 nr
+天末凉风 3 nr
+天机 146 n
+天机不可 3 i
+天机云锦 3 ns
+天机报 3 nz
+天机诗 3 n
+天条 16 n
+天松 2 n
+天松道人 4 nr
+天极 56 ns
+天极网 118 n
+天枢 3 n
+天柱 78 n
+天柱军 2 nr
+天柱剑 2 nr
+天柱县 2 ns
+天柱山 17 nr
+天柱峰 22 nr
+天格 3 n
+天桂海 2 nr
+天桥 528 ns
+天桥区 6 ns
+天桥底下 3 ns
+天梁 16 n
+天梯 34 n
+天棚 399 n
+天正 23 nz
+天母 5 n
+天母国小 3 n
+天气 2657 n
+天气图 49 n
+天气学 24 n
+天气形势 3 n
+天气情况 3 n
+天气报告 3 n
+天气晴好 3 nr
+天气晴朗 3 nr
+天气炎热 3 i
+天气爽朗 3 nr
+天气状况 3 l
+天气现象 3 n
+天气预报 3 n
+天水 148 n
+天水市 21 ns
+天水街 3 ns
+天汉 14 ns
+天汉州 3 ns
+天汉桥 2 ns
+天池 375 ns
+天沟 8 ns
+天河 655 ns
+天河传说 3 n
+天河体育中心 4 nt
+天河区 26 ns
+天河城 3 ns
+天河机场 773 n
+天河石 3 nr
+天河路 3 ns
+天河镇 2 ns
+天泉 2 nz
+天泉桥 2 ns
+天波 34 ns
+天波府 3 nr
+天津 4801 ns
+天津人 32 nr
+天津体育学院 2 nt
+天津劝业场 3 nt
+天津医科大学 3 nt
+天津南开大学 5 nt
+天津地区 18 ns
+天津大学 56 nt
+天津女排 27 nt
+天津工业大学 2 nt
+天津市 473 ns
+天津市人 6 nz
+天津市卫生局 4 nt
+天津市委 5 nt
+天津市政 2 nt
+天津市政府 3 nt
+天津师范大学 4 nt
+天津开发区 5 nt
+天津日报 2 nz
+天津桥 3 ns
+天津泰达 41 nz
+天津泰达队 14 nz
+天津海关 3 ns
+天津港 35 ns
+天津碱厂 2 nt
+天津站 14 nz
+天津经济技术开发区 3 nt
+天津美术学院 2 nt
+天津警备区 2 nt
+天津路 3 nz
+天津队 359 nt
+天津音乐学院 5 nt
+天海 19 ns
+天涯 174 n
+天涯共此时 4 i
+天涯咫尺 3 i
+天涯地角 3 nz
+天涯比邻 3 l
+天涯海角 122 nz
+天涯社区 3 l
+天涯网 3 nz
+天涯若比 3 i
+天涯若比邻 8 i
+天清日白 3 l
+天清气朗 3 ns
+天渊 3 nr
+天渊之别 7 i
+天渊之隔 3 i
+天游峰 3 n
+天湖 14 ns
+天源 2 n
+天溪 3 ns
+天演 8 n
+天演论 32 n
+天潢贵胄 3 nr
+天潮 3 n
+天火 33 n
+天灯 14 n
+天灵盖 108 nr
+天灵盖儿 3 nr
+天灾 130 n
+天灾人祸 55 l
+天灾地变 3 i
+天灾地妖 3 n
+天炫彩 3 nr
+天烛峰 2 nr
+天然 5328 b
+天然丝 3 n
+天然免疫 3 l
+天然堤 3 n
+天然居 3 n
+天然屏障 3 i
+天然更新 3 i
+天然杂交 3 i
+天然材料 3 n
+天然林 60 nz
+天然染料 3 n
+天然树脂 3 l
+天然橡胶 3 n
+天然气 1218 n
+天然气井 3 n
+天然水 20 n
+天然淘汰 3 l
+天然港 3 ns
+天然湖泊 13 n
+天然漆 3 n
+天然煤气 3 n
+天然物 3 n
+天然瓦斯 3 nz
+天然痘 3 n
+天然矿 3 n
+天然碱 17 n
+天然纤维 3 l
+天然胶 3 n
+天然色 3 n
+天然资源 3 n
+天然饵料 3 n
+天煞 3 n
+天煞孤星 3 i
+天燃气 3 n
+天父 47 n
+天牖 3 n
+天牛 39 nz
+天物 3 n
+天狗 20 n
+天狗帮 3 nr
+天狗螺 3 nr
+天狮 5 nz
+天狼子 3 n
+天狼星 61 nr
+天王 495 nrt
+天王星 102 nr
+天王殿 22 nr
+天王老子 29 nr
+天玑 11 nz
+天珠 3 nz
+天球 136 n
+天球仪 21 nz
+天理 146 n
+天理不容 11 l
+天理人情 2 n
+天理何在 3 l
+天理循环 3 n
+天理教 11 nz
+天理昭彰 3 i
+天理昭昭 3 nr
+天理良心 3 n
+天理难容 14 n
+天琴座 29 n
+天璇 4 nr
+天生 561 n
+天生一对 3 i
+天生丽质 29 nz
+天生十几 3 l
+天生地设 3 l
+天生天化 3 nz
+天生天杀 3 i
+天生尤物 5 l
+天生我才 3 l
+天生我材必有用 8 l
+天生桥 25 nz
+天电 10 nz
+天界 33 n
+天界篇 3 b
+天疱疮 21 n
+天百 3 nz
+天皇 649 nz
+天皇制 20 nr
+天皇巨星 3 nr
+天益 3 n
+天益游 3 n
+天监 361 n
+天监监 3 nr
+天盛 18 nz
+天目 121 n
+天目山 103 ns
+天目湖 2 ns
+天目溪 3 ns
+天目通 3 i
+天真 520 nz
+天真无邪 43 i
+天真活泼 3 l
+天真烂漫 100 i
+天真烂熳 3 nr
+天眼 28 n
+天知地知 14 i
+天知地知你知我知 2 l
+天知道 44 i
+天碟 3 n
+天磁 3 n
+天礼伯 14 nr
+天祚帝 101 nr
+天祝 9 nrt
+天祝藏族自治县 6 ns
+天神 275 n
+天禀 3 v
+天禄 9 nr
+天禄阁 2 nr
+天福 52 nz
+天福宫 3 nr
+天福山 2 nr
+天福爷 25 nr
+天禧 12 nrt
+天禾 4 nz
+天秤 3 nz
+天秤座 9 n
+天秤盘 3 n
+天穹 30 n
+天空 1849 n
+天空光 3 n
+天空战记 3 nz
+天空海阔 3 i
+天空网 3 n
+天空软件 3 l
+天空风景 3 n
+天突 3 nz
+天突穴 14 i
+天窗 87 n
+天章阁 5 nr
+天童寺 5 nr
+天竹 6 ns
+天竹黄 3 nr
+天竺 498 ns
+天竺僧 3 nr
+天竺僧人 3 nr
+天竺国 3 nr
+天竺葵 10 n
+天竺黄 3 nr
+天竺鼠 3 nr
+天笑笑 2 l
+天等县 3 n
+天策文 3 nr
+天箭座 3 n
+天篷 2 n
+天籁 63 n
+天籁村 3 nr
+天籁般 3 i
+天纵 46 nz
+天线 449 n
+天线宝宝 3 nz
+天线罩 3 n
+天线色素 3 n
+天线阵 3 nr
+天经地义 143 nz
+天经地纬 3 n
+天绿香 3 nr
+天缘 17 n
+天缘凑合 3 z
+天网 33 nz
+天网恢恢 22 i
+天罗地网 77 nz
+天罚 7 n
+天罡 112 nr
+天翻地覆 150 i
+天翻地覆慨而慷 3 l
+天翼通 3 nz
+天老儿 3 nr
+天老地荒 3 i
+天老爷 13 nr
+天职 29 n
+天聪 46 nz
+天良 29 nr
+天色 998 n
+天色已晚 3 l
+天花 850 n
+天花乱坠 51 i
+天花板 172 n
+天花病 3 n
+天花粉 5 nz
+天荆地棘 3 i
+天草 3 n
+天荒地老 7 i
+天荒坪 3 nr
+天菩萨 7 n
+天落水 2 n
+天葬 28 n
+天葬场 2 n
+天葵 9 n
+天葵子 3 nr
+天蓝 19 b
+天蓝色 36 n
+天蓝蓝 3 nr
+天蓬 31 ns
+天虎 3 nz
+天虎网 3 nz
+天虎音乐 3 ns
+天虚道人 5 i
+天虹 20 nz
+天虹禅师 7 nr
+天蚕 5 n
+天蚕变 3 n
+天蚕蛾 2 n
+天蛾 13 n
+天蝎 3 n
+天蝎女 3 n
+天蝎座 26 n
+天蝎星 3 nr
+天蝎蝴蝶 3 nr
+天融信 3 nz
+天行健 5 nr
+天行建 3 ns
+天行时气 3 n
+天行者 3 n
+天街 142 ns
+天衣无缝 86 i
+天裕 2 nz
+天覆地舟 3 i
+天覆地载 3 i
+天论 3 n
+天诛 3 n
+天诛地灭 40 i
+天诺思 3 nr
+天课 6 n
+天象 224 n
+天象仪 8 nr
+天象图 3 nr
+天资 102 n
+天资国色 3 l
+天资聪颖 3 nr
+天资过人 3 l
+天赋 813 n
+天赋人权 23 l
+天赋异柄 3 i
+天赐 68 n
+天赐礼 4 nr
+天赐福 2 nr
+天赐良机 24 nr
+天赐良缘 3 nr
+天趣 4 n
+天趣盎然 3 i
+天足 3 n
+天路 7 n
+天车 3 n
+天车台 3 n
+天轮 4 n
+天轴 2 nz
+天边 202 s
+天边海角 3 ns
+天运 12 n
+天远地隔 3 i
+天通股份 8 nz
+天造地设 19 l
+天造草昧 3 i
+天道 166 n
+天道人事 3 i
+天道好还 5 i
+天道宁论 3 n
+天道无亲 2 i
+天道盟 3 n
+天道观 21 nr
+天道酬勤 9 n
+天那水 3 ns
+天都 61 ns
+天都峰 14 ns
+天鑫洋 2 nz
+天钩 2 nz
+天铃鸟 24 n
+天铜仪 2 nz
+天镇 3 ns
+天镇县 3 ns
+天镜 26 nz
+天镜禅师 6 nr
+天长 31 n
+天长县 3 ns
+天长地久 39 i
+天长地老 3 j
+天长市 3 n
+天长日久 42 i
+天门 4627 ns
+天门冬 21 nr
+天门县 4 ns
+天门山 3 ns
+天门市 1294 ns
+天门道人 3 n
+天问 109 n
+天阴 3 ns
+天际 110 n
+天际线 6 nz
+天降 3 v
+天降奇缘 3 n
+天险 93 n
+天随人愿 3 i
+天随子 2 n
+天隐子 2 nr
+天雄 35 n
+天雄军 6 nr
+天雄哥 2 nr
+天雨花 3 n
+天雷 11 n
+天震地骇 3 n
+天露山 2 ns
+天露明 2 nr
+天霸 2 nz
+天青 82 nr
+天青石 19 nr
+天青菌素 3 n
+天青蛋白 3 l
+天音 3 n
+天音怒放 3 l
+天顶 59 n
+天顺 444 nz
+天风城 5 ns
+天香国色 2 n
+天香楼 3 nr
+天马 119 ns
+天马山 3 ns
+天马行空 39 n
+天骄 21 nr
+天髎 3 v
+天高云淡 9 nr
+天高任鸟飞 8 i
+天高听下 3 i
+天高听卑 3 i
+天高地 3 nz
+天高地下 3 ns
+天高地厚 23 i
+天高地迥 3 nr
+天高日远 3 nz
+天高气清 3 l
+天高气爽 7 i
+天高皇帝 3 nr
+天高皇帝远 5 ns
+天魔 3 n
+天魔圣 3 nr
+天鸣师 2 nr
+天鸣方丈 3 i
+天鸣禅师 13 nr
+天鹅 552 nz
+天鹅堡 3 ns
+天鹅座 32 nz
+天鹅洲 1536 ns
+天鹅湖 45 ns
+天鹅绒 37 nz
+天鹅肉 3 n
+天鹰 238 nz
+天鹰座 18 nz
+天麻 646 n
+天黑 562 ns
+天黑请 3 nr
+天黑黑 3 ns
+天鼎 3 nz
+天齐寿 3 nr
+天齐庙 3 ns
+天龙 221 nz
+天龙八部 3 nz
+天龙地虎 3 nz
+天龙山 12 ns
+天龙座 3 nz
+天龙镇 2 ns
+天龙队 3 n
+太 24899 d
+太上 3 s
+太上忘情 3 n
+太上玄 2 nr
+太上皇 133 nr
+太上老君 76 nr
+太不像话 3 l
+太不容易 3 l
+太不自量 3 l
+太丑 3 n
+太丘道广 3 nr
+太严 3 n
+太久 21 nr
+太乐网 3 nz
+太乙三 3 nz
+太乙仙 2 nr
+太乙山 2 nr
+太乙散 2 nr
+太乙神 4 nz
+太乙金 3 n
+太仆 7 nr
+太仆公 2 nr
+太仆卿 4 nr
+太仆寺 48 nr
+太仆寺旗 4 nr
+太仆杜 2 nr
+太仓 174 ns
+太仓一粟 3 nr
+太仓促 3 nr
+太仓县 5 ns
+太仓市 10 ns
+太仓港 3 ns
+太仓稊米 3 ns
+太优隆 2 nr
+太会 3 n
+太伯 2 ns
+太伶俐 2 i
+太佳妙 2 nr
+太俗 3 n
+太保 301 j
+太信子 3 nr
+太假 3 n
+太傅 131 n
+太傅府 2 nr
+太傅杨 3 nr
+太傅许 2 nr
+太傅陈 4 nr
+太傻网 3 nr
+太元 51 n
+太元圣母 2 nr
+太光彩 3 nr
+太八 3 n
+太公 276 nr
+太公庙 4 nr
+太公望 3 nr
+太公钓鱼 2 l
+太兴 3 ns
+太冲兄 17 nr
+太冷 4 ns
+太冷冷 11 nr
+太凶了 3 l
+太初 34 nr
+太功利 2 n
+太劳神 4 nr
+太医 255 n
+太医院 3 nt
+太华寺 3 ns
+太华山 2 ns
+太华群 2 nr
+太卡 3 ns
+太厚道 3 nr
+太原 1284 ns
+太原人 10 n
+太原卫星发射中心 3 nt
+太原市 87 ns
+太原战役 2 nz
+太原火车站 2 n
+太原理工 2 n
+太原省 3 ns
+太原路 3 ns
+太古 81 ns
+太古农 2 nz
+太古宇 5 nr
+太古宙 15 n
+太古时代 3 n
+太古民 2 n
+太古界 11 n
+太古菜 3 n
+太史 301 n
+太史令 13 n
+太史儋 2 nr
+太史公 15 nr
+太史慈 64 nr
+太合 8 n
+太吉祥 2 nr
+太后 2906 nr
+太君 57 nr
+太和 714 nz
+太和区 3 ns
+太和县 14 ns
+太和城 9 ns
+太和村 4 ns
+太和殿 1100 nr
+太圆 3 n
+太坏 3 n
+太坦神 10 nr
+太基人 6 nrt
+太基军 3 nr
+太基城 11 ns
+太基政 32 nr
+太基诸 16 nr
+太多 3 ns
+太多年 3 nr
+太大 3 ns
+太大意 9 nr
+太天真 6 nr
+太太 3362 n
+太太平平 26 ns
+太夫人 31 nrt
+太奇 3 nrt
+太好了 3 l
+太妃 114 nr
+太妃糖 2 nr
+太妈 3 n
+太妙 6 a
+太妙了 3 l
+太妹 3 n
+太始 4 nz
+太委屈 3 n
+太姥山 3 nr
+太婆 33 n
+太嫩 4 ns
+太子 3132 n
+太子党 3 n
+太子参 7 nr
+太子奶 3 n
+太子妃 3 nr
+太子河 19 nr
+太子河区 3 ns
+太子港 23 ns
+太学 178 n
+太宁 8 ns
+太守 640 n
+太安 14 ns
+太安静 2 nr
+太宗 311 nrt
+太宗乃 2 nr
+太宗传 3 nr
+太宗准 2 nr
+太宗同 2 nr
+太宗善 3 nr
+太宗喜 2 nr
+太宗天 2 nr
+太宗崇 4 nr
+太宗时 2 nr
+太宗朝 5 nr
+太宗李 9 nr
+太宗死 4 nr
+太宗爷 3 nr
+太宗皇 26 nr
+太宗皇后 3 nr
+太宗皇帝 48 nr
+太宗立 2 nr
+太宗笑 4 nr
+太宗素 3 nr
+太宗纪 2 nr
+太宗耶 7 nr
+太宗误 2 nr
+太宗责 2 nr
+太宗赵 2 nr
+太宗闻 10 nr
+太宗驾 2 nr
+太宰 59 nrt
+太宰王 2 nr
+太宰白 5 nr
+太尉 275 nr
+太尉乃 2 nr
+太尉休 4 nr
+太尉周 11 nr
+太尉宿 5 nr
+太尉府 13 nr
+太尉御 2 nr
+太尉恩 5 nr
+太尉教 2 nr
+太尉杨 8 nr
+太尉蒋 2 nr
+太尉蛮 8 nr
+太尉行 3 nr
+太尉见 2 nr
+太尉贾 2 nr
+太尉钧 5 nr
+太尉闻 2 nr
+太尉陈 8 nr
+太小 381 n
+太小太 2 nr
+太少 3 nr
+太少宰 2 nr
+太尔 3 nrt
+太尖 3 n
+太屈心 3 i
+太山 14 ns
+太山北斗 3 nr
+太岁 49 n
+太岁头上 3 l
+太岁头上动土 25 i
+太岁爷 3 n
+太岳区 39 ns
+太岳地区 3 ns
+太岳山 7 ns
+太巧 15 n
+太差 3 n
+太帅 3 n
+太师 612 n
+太师椅 161 nr
+太师父 34 nr
+太师爷 3 nr
+太常 83 a
+太常卿 13 nr
+太常寺 150 nr
+太常礼 4 nr
+太常音 2 n
+太平 1113 ns
+太平世界 3 nz
+太平乡 2 ns
+太平公主 3 n
+太平军 193 nr
+太平区 3 ns
+太平县 10 ns
+太平国小 3 n
+太平天国 428 ns
+太平天国运动 6 nz
+太平夫人 3 nrt
+太平山 6 ns
+太平岛 3 ns
+太平岭 4 ns
+太平广记 3 nz
+太平庄 3 ns
+太平店 7 ns
+太平斧 3 nz
+太平无事 49 i
+太平无象 3 l
+太平村 9 ns
+太平桥 6 ns
+太平梯 3 ns
+太平洋 2721 ns
+太平洋保险 2 n
+太平洋保险公司 3 nt
+太平洋区 20 ns
+太平洋卡 25 ns
+太平洋地区 113 ns
+太平洋战 3 nz
+太平洋战争 172 nz
+太平洋文 3 nz
+太平洋百货 2 nz
+太平洋铁路 21 nz
+太平洋集团 2 nt
+太平渡 2 ns
+太平湖 9 ns
+太平盛世 56 ns
+太平真君 25 nr
+太平花 3 ns
+太平街 3 ns
+太平路 3 ns
+太平道 3 ns
+太平镇 11 ns
+太平门 9 ns
+太平间 22 n
+太平鼓 6 nr
+太平龙头 3 ns
+太庙 3798 ns
+太座 3 n
+太康 1129 nr
+太康伯 2 nr
+太康兄弟 2 nr
+太康初 2 nr
+太康县 4 ns
+太康时 2 nr
+太康死 2 nr
+太弯 3 n
+太弱 3 a
+太强大 2 nz
+太息 12 n
+太慢 2 a
+太懒 3 n
+太抠 3 l
+太挥剑 2 n
+太政 2 n
+太旧 3 ns
+太昊伏 3 nr
+太昊陵 2 nr
+太晖山 10 nr
+太晖观 258 nr
+太晚 3 nz
+太普 2 nrt
+太普通 3 nz
+太暗 3 n
+太有钱 2 n
+太极 276 ns
+太极剑 34 n
+太极图 29 n
+太极拳 200 n
+太极旗 3 ns
+太极虎 3 n
+太极链 3 n
+太极集团 3 nt
+太棒 5 n
+太棒了 3 nr
+太次 3 nz
+太武帝 24 nr
+太比雅 2 ns
+太水 3 n
+太沉 4 a
+太沉太 2 nr
+太沉重 3 l
+太沙基 4 ns
+太油 3 n
+太浅 4 n
+太浮浅 3 nr
+太清境 3 nr
+太清宫 13 nr
+太清观 2 nr
+太湖 502 ns
+太湖县 3 ns
+太湖流域 43 ns
+太湖石 33 nr
+太湿 3 n
+太溪 3 ns
+太溼 3 z
+太漂亮 3 nr
+太炎 2 n
+太烂 3 n
+太烦 2 a
+太烦人 3 n
+太爷 103 n
+太爽了 3 l
+太牢 2 n
+太狠 3 a
+太猛 3 nr
+太甚 66 nr
+太田 4 ns
+太甲 6 ns
+太甲放 3 nr
+太甲训 3 nr
+太白 187 n
+太白县 5 ns
+太白山 47 ns
+太白星 8 nr
+太白楼 3 n
+太白粉 3 n
+太白路 3 n
+太白金星 3 n
+太白阴经 5 n
+太皇太后 8 nr
+太监 3843 n
+太监急 3 n
+太盛 4 nz
+太短 3 n
+太矮 3 a
+太祖 514 nr
+太祝 3 nrt
+太神 2 n
+太禧宗 2 nr
+太穷 3 a
+太空 1999 n
+太空中心 3 nt
+太空乘具 3 n
+太空人 10 n
+太空医学 3 nt
+太空城 3 n
+太空怪物 3 l
+太空探险 3 n
+太空时代 3 n
+太空服 6 n
+太空机 3 n
+太空梭 3 nr
+太空棉 2 n
+太空游 3 n
+太空病 3 n
+太空科学 3 nt
+太空站 43 n
+太空统署 3 nt
+太空舱 4 n
+太空船 28 n
+太空行走 3 l
+太空衣 4 n
+太空装 3 n
+太空车 3 n
+太空银 3 j
+太空飞行 3 nt
+太笨 3 a
+太米叶 2 nr
+太粗 2 n
+太精彩 3 nr
+太素 2 n
+太紧 3 nz
+太紧张 3 l
+太细 3 n
+太统山 2 nr
+太美 4 ns
+太美丽 3 nr
+太翁 3 n
+太老爷 3 nr
+太肿 3 n
+太胖 3 a
+太臣 2 n
+太苦 3 n
+太英明 2 nr
+太药 3 n
+太薄 3 a
+太虚 67 nrt
+太虚子 2 nr
+太虚幻境 3 l
+太行 353 j
+太行军区 16 n
+太行山 273 ns
+太行山区 27 ns
+太行山麓 8 ns
+太谷 17 n
+太谷县 8 ns
+太贵 17 nr
+太超前 2 nr
+太软 3 a
+太软弱 3 l
+太轻 3 a
+太过分 3 l
+太过火 3 n
+太过谦 5 nr
+太郎 295 n
+太酷 3 a
+太重 302 n
+太金氏 2 nr
+太钢 20 n
+太铁 2 nz
+太长 3 n
+太长久 2 nr
+太长太 3 nr
+太闲 3 n
+太闵氏 2 nr
+太阳 5044 ns
+太阳伞 5 nr
+太阳光 153 nr
+太阳光球 5 n
+太阳党 4 n
+太阳升 3 nr
+太阳历 17 nz
+太阳地儿 3 nz
+太阳城 60 ns
+太阳宫 20 ns
+太阳山 25 ns
+太阳岛 15 ns
+太阳帆 3 nr
+太阳帽 2 n
+太阳年 268 nr
+太阳报 38 nz
+太阳拳 3 nr
+太阳旗 17 ns
+太阳日 14 nz
+太阳时 18 ns
+太阳水 3 ns
+太阳活动 3 n
+太阳灯 3 n
+太阳灶 8 nr
+太阳炉 3 n
+太阳热 3 nz
+太阳电池 37 nz
+太阳眼镜 9 nz
+太阳神 125 nr
+太阳神队 2 n
+太阳穴 170 ns
+太阳系 337 n
+太阳系外 3 l
+太阳网 3 nz
+太阳能 464 n
+太阳膜 3 n
+太阳节 2 n
+太阳谷 3 ns
+太阳辐射 3 nz
+太阳镜 15 nz
+太阳队 3 n
+太阳雨 3 nr
+太阳风 67 nr
+太阳风暴 3 n
+太阳鸟 15 nr
+太阳黑子 44 ns
+太阴 112 ns
+太阴历 5 nr
+太阴君 5 nr
+太阴星 8 nr
+太阴玄 2 nr
+太阿 5 ns
+太阿倒持 2 nr
+太陡 3 ns
+太难受 3 l
+太顺 5 nz
+太饱 3 n
+太高兴 3 ns
+太高明 5 nr
+太鲁阁 11 nr
+太黑 3 ns
+夫 4074 n
+夫人 6539 n
+夫人城 260 ns
+夫人裙带 3 vn
+夫人道 273 n
+夫余 26 n
+夫倡妇随 3 n
+夫南 3 ns
+夫君 57 n
+夫君子 3 n
+夫唱妇随 9 n
+夫妇 2729 n
+夫妇俩 3 n
+夫妇关系 3 n
+夫妻 2212 n
+夫妻之情 3 n
+夫妻俩 3 n
+夫妻关系 3 n
+夫妻反目 3 n
+夫妻店 14 n
+夫妻性 3 n
+夫妻恩爱 3 n
+夫妻情 31 n
+夫妻感情 3 n
+夫妻生活 3 n
+夫妻用品 3 n
+夫妻间 3 n
+夫姓 3 n
+夫婿 41 n
+夫子 91 n
+夫子之墙 3 n
+夫子庙 33 n
+夫子自道 2 n
+夫家 3 n
+夫家人 3 n
+夫差 72 n
+夫役 3 n
+夫斯 58 nrt
+夫斯基 3 nrt
+夫曼 5 nrt
+夫权 31 n
+夫特 7 nrt
+夫琅和费 3 n
+夫职 3 n
+夫荣妻显 3 n
+夫荣妻贵 5 n
+夫负妻戴 3 n
+夫贵妻荣 3 i
+夫运 5 n
+夬 2 zg
+夭 166 zg
+夭亡 28 v
+夭寿 3 v
+夭折 132 v
+夭桃秾李 3 ns
+夭桃穠李 3 ns
+夭矫 12 a
+夭逝 3 v
+央 283 j
+央产房 3 j
+央及 3 v
+央告 63 j
+央托 3 j
+央杰本 2 vn
+央求 136 v
+央版 3 v
+央行 390 j
+央视 418 j
+央视国际 3 nt
+央视春晚 3 j
+央视版 3 nt
+央视网 3 nt
+央请 3 v
+夯 254 zg
+夯土 115 n
+夯土墙 3 n
+夯土层 17 n
+夯地 3 n
+夯实 66 v
+夯歌 3 n
+夯砣 3 n
+夯筑 3 n
+夯货 3 n
+夯铁文夫 3 n
+失 3661 zg
+失不再来 5 i
+失业 1283 n
+失业人数 3 n
+失业工人 3 n
+失业率 249 n
+失业者 53 n
+失业问题 3 n
+失主 23 v
+失之东隅 3 i
+失之于 3 v
+失之交臂 49 i
+失之偏颇 9 l
+失之千里 6 i
+失之毫厘 3 i
+失之空洞 3 n
+失乐园 3 n
+失事 148 v
+失于 3 v
+失人者亡 3 i
+失仪 3 n
+失传 288 v
+失传已久 3 i
+失体 3 n
+失信 101 v
+失信于人 3 i
+失信于民 3 i
+失修 161 v
+失写 3 v
+失写症 3 n
+失分 66 v
+失利 595 vn
+失势 45 n
+失单 8 a
+失却 123 v
+失去 4317 v
+失去人性 3 i
+失去光泽 3 i
+失去平衡 3 i
+失去机会 3 i
+失去活力 3 i
+失去理性 3 n
+失去知觉 3 i
+失口 25 vn
+失合 3 v
+失和 105 v
+失土 3 v
+失地 353 n
+失地农民 3 n
+失声 320 v
+失声痛哭 3 i
+失失慌慌 3 n
+失婚 3 v
+失学 404 n
+失守 316 v
+失官 3 n
+失宜 9 v
+失实 37 v
+失宠 50 v
+失密 3 a
+失察 29 v
+失常 380 a
+失序 2 n
+失度 3 n
+失张冒势 3 i
+失张失志 3 i
+失张失智 3 i
+失张失致 3 i
+失当 194 v
+失德 3 n
+失忆 8 v
+失忆症 6 n
+失态 134 n
+失恃 3 v
+失恋 121 v
+失恋者 3 n
+失惊 52 v
+失惊倒怪 3 i
+失惊打怪 3 i
+失意 144 v
+失意人 3 n
+失意者 3 n
+失慎 3 a
+失所 3 v
+失手 283 v
+失据 3 n
+失掉 125 v
+失控 162 vn
+失措 90 v
+失效 245 a
+失效分布 3 n
+失效恢复 3 i
+失效率 3 n
+失效节点 3 n
+失散 127 v
+失散多年 3 i
+失敬 62 v
+失时落势 3 i
+失明 193 v
+失望 1234 v
+失望绝顶 3 i
+失望透顶 3 n
+失查 3 vn
+失检 3 v
+失欢 3 v
+失款 3 v
+失水 100 v
+失泄密 8 n
+失法 3 v
+失活作用 3 n
+失活牙 3 n
+失火 72 v
+失灵 138 n
+失点 3 n
+失物 3 n
+失物招领 3 n
+失球 67 n
+失用症 3 n
+失盗 11 vn
+失真 64 v
+失真度 3 n
+失眠 366 v
+失眠病 3 n
+失眠症 22 n
+失着 3 v
+失礼 105 v
+失礼地 3 i
+失神 76 n
+失禁 64 v
+失稳 3 a
+失窃 35 v
+失窃案 3 n
+失笑 37 v
+失笑散 3 i
+失笑起来 3 i
+失策 51 n
+失算 32 v
+失精落彩 3 i
+失约 22 v
+失群 7 n
+失而复得 25 i
+失职 142 v
+失职人员 3 n
+失职罪 3 i
+失聪 12 v
+失聪者 2 n
+失脚 10 v
+失脸 3 v
+失色 191 n
+失节 39 vn
+失节事大 5 i
+失范 14 v
+失落 368 v
+失落感 40 n
+失血 112 v
+失血性 10 n
+失血过多 3 l
+失街亭 3 nz
+失衡 278 a
+失言 102 v
+失计 3 v
+失认症 3 v
+失语 39 v
+失语症 22 n
+失误 1213 v
+失诸交臂 3 i
+失读 3 v
+失读症 3 n
+失调 571 v
+失调电压 3 v
+失调症 4 n
+失谐 3 a
+失责 3 v
+失败 4487 v
+失败主义 3 n
+失败定向 3 i
+失败率 6 n
+失败者 138 n
+失败论 3 i
+失败论者 3 n
+失足 123 v
+失足者 3 n
+失足落水 3 i
+失足青年 3 i
+失踪 553 v
+失踪人口 3 i
+失踪案 3 n
+失踪者 3 n
+失蹄 3 n
+失身 63 v
+失迎 49 v
+失迷 3 v
+失速 20 v
+失道寡助 5 i
+失配 3 vn
+失配终端 3 i
+失重 65 v
+失锁 3 v
+失闪 19 v
+失陪 58 v
+失陷 337 v
+失音 14 n
+失音症 3 n
+失风 3 v
+失马塞翁 3 n
+失魂 3 n
+失魂丧胆 3 i
+失魂丧魄 3 i
+失魂荡魄 3 i
+失魂落魄 106 i
+失魄 3 n
+头 28177 n
+头一回 3 i
+头一无二 3 i
+头上 2988 s
+头上安头 3 n
+头上末下 3 i
+头上脚下 3 i
+头上著头 3 n
+头中 3 s
+头临泣 3 i
+头人 139 n
+头份 3 n
+头份镇 3 n
+头伏 3 v
+头会箕敛 3 i
+头会箕赋 3 i
+头像 129 n
+头像图片 3 n
+头儿 780 n
+头先 14 n
+头关 6 n
+头冠 5 n
+头出头没 3 i
+头刷 3 n
+头前 40 t
+头功 31 a
+头发 3096 n
+头发丝 21 n
+头发屑 3 n
+头发菜 3 n
+头号 306 n
+头号人物 3 n
+头号敌人 3 i
+头号新闻 3 n
+头号选手 3 n
+头名 42 n
+头型 25 n
+头城 3 n
+头壳 3 n
+头壳坏去 3 l
+头天 57 t
+头头 142 n
+头头儿 3 n
+头头是道 92 l
+头头脑脑 23 i
+头奖 30 nz
+头套 24 n
+头子 213 n
+头孢 30 n
+头孢他啶 2 nz
+头孢匹罗 3 nz
+头孢哌酮 3 nz
+头孢唑啉钠 2 nz
+头孢噻吩 3 n
+头孢噻肟钠 2 n
+头孢曲松 3 nz
+头孢氨苄 2 nz
+头孢类 3 n
+头孢菌素 16 nz
+头孢西丁 3 nz
+头孢霉属 3 n
+头家 6 n
+头寸 47 n
+头尾 37 n
+头屑 3 n
+头屯河区 3 ns
+头巾 211 n
+头帕 6 n
+头帽 3 n
+头式 7 n
+头彩 6 n
+头悬梁 3 n
+头戴 3 n
+头戴式 3 n
+头把交椅 3 n
+头排 3 s
+头数 52 n
+头文件 3 n
+头文字 3 n
+头昏 55 t
+头昏目晕 3 i
+头昏目眩 7 i
+头昏眼晕 3 i
+头昏眼暗 3 i
+头昏眼花 29 i
+头昏脑涨 11 l
+头昏脑眩 3 i
+头昏脑胀 42 l
+头昏脑闷 3 n
+头晕 411 n
+头晕地 3 i
+头晕目眩 78 i
+头晕眼花 91 i
+头晚 3 t
+头期 3 n
+头期款 3 n
+头条 48 n
+头条新闻 3 n
+头枕 20 n
+头标 3 n
+头梢自领 3 l
+头梳 6 b
+头槌 11 n
+头没杯案 3 n
+头油 16 n
+头涨 3 v
+头灯 7 n
+头焦额烂 3 n
+头版 50 n
+头版头条 25 n
+头版新闻 3 n
+头牌 17 n
+头牛 21 n
+头状 3 n
+头状花序 60 l
+头班车 3 n
+头球 270 n
+头生 20 n
+头疼 372 a
+头疼脑热 18 i
+头痒搔跟 3 v
+头痛 671 n
+头痛医头 12 n
+头痛医脚 3 i
+头痛脑热 3 i
+头癣 5 n
+头皮 290 n
+头皮发麻 3 n
+头皮屑 40 n
+头皮癣 3 n
+头盔 377 n
+头盖 42 n
+头盖腔 3 n
+头盖骨 80 n
+头目 752 n
+头眩目昏 3 i
+头破流血 3 i
+头破血出 3 i
+头破血流 72 n
+头破血淋 3 i
+头窍阴 3 i
+头端 17 n
+头端器 3 n
+头等 260 b
+头等功 3 n
+头等大事 3 l
+头等票 3 n
+头等舱 29 n
+头筛 3 n
+头筹 55 n
+头箍 3 n
+头纱 3 n
+头绪 226 n
+头绳 29 n
+头维 3 n
+头罩 30 n
+头羊 17 n
+头胀 3 v
+头胎 26 n
+头胸甲 49 n
+头胸部 48 n
+头脑 1303 n
+头脑僵化 3 l
+头脑冷静 3 l
+头脑发热 30 l
+头脑好 3 l
+头脑清楚 3 l
+头脑清醒 3 l
+头脑灵活 3 i
+头脑空虚 3 i
+头舱 3 n
+头花 3 n
+头茬 3 n
+头营 3 n
+头虱 4 n
+头蝨 3 v
+头衔 415 n
+头角 11 n
+头角峥嵘 6 i
+头足倒置 3 i
+头足异处 3 i
+头足异所 3 i
+头足纲 15 n
+头路 3 n
+头部 1008 n
+头里 119 s
+头重脚轻 27 i
+头阵 3 n
+头陀 798 n
+头雁 7 n
+头面 91 n
+头面人物 43 n
+头顶 1619 n
+头顶生疮 3 n
+头顶部 11 n
+头项 3 n
+头顿 2 v
+头颅 338 n
+头领 831 n
+头颈 329 n
+头颈部 61 n
+头额 3 n
+头风 3 n
+头饰 31 n
+头马 8 n
+头骨 314 n
+头高头低 3 i
+夶 2 zg
+夷 1437 ng
+夷为平地 59 l
+夷则 6 n
+夷平 33 ns
+夷平作用 3 l
+夷平面 3 l
+夷情 3 n
+夷族 3 n
+夷洲 8 ns
+夷灭 3 v
+夷然自若 3 l
+夷门 10 ns
+夷陵 596 ns
+夷陵区 257 ns
+夸 870 v
+夸下海口 3 ns
+夸克 167 nrt
+夸克子 3 nrt
+夸功 3 nrt
+夸口 60 nrt
+夸嘴 3 v
+夸多斗靡 3 i
+夸大 389 v
+夸大之词 3 i
+夸大其词 27 i
+夸大其辞 12 i
+夸大狂 3 i
+夸夸 3 v
+夸夸其谈 53 i
+夸夸而谈 3 i
+夸奖 261 v
+夸尔 3 nrt
+夸张 701 v
+夸张性 4 n
+夸张拉倒 3 i
+夸强道会 3 i
+夸得 3 v
+夸成 3 nrt
+夸拉州 3 nrt
+夸本 3 nrt
+夸来夸去 3 i
+夸梅 32 nrt
+夸海口 3 ns
+夸父 13 nrt
+夸父追日 3 i
+夸父逐日 3 i
+夸特 556 nrt
+夸着 3 v
+夸示 3 v
+夸祖鲁 3 ns
+夸耀 117 v
+夸胡 6 nrt
+夸脱 2 nrt
+夸诞 3 n
+夸说 3 v
+夸赞 104 nrt
+夸起 3 v
+夸起来 3 v
+夸辩之徒 3 n
+夸过 3 v
+夸里 14 nrt
+夸饰 11 v
+夹 2875 n
+夹七夹八 2 i
+夹上去 3 v
+夹上来 3 l
+夹下 3 v
+夹下去 3 l
+夹下来 3 l
+夹丝 2 n
+夹丝玻璃 3 n
+夹个 3 b
+夹人 3 n
+夹住 5 v
+夹克 28 n
+夹克衫 12 n
+夹入 3 v
+夹入纸页 3 n
+夹具 42 n
+夹击 423 v
+夹到 3 v
+夹剪 3 v
+夹功 3 n
+夹叙夹议 12 l
+夹塞儿 3 n
+夹墙 27 n
+夹壁墙 3 n
+夹够 3 v
+夹大衣 3 n
+夹头 32 n
+夹子 61 n
+夹完 3 v
+夹层 120 n
+夹层墙 3 n
+夹层槽 3 n
+夹层玻璃 4 l
+夹层锅 3 n
+夹山寺 2 ns
+夹巷 3 n
+夹布 3 v
+夹带 97 n
+夹带走私 3 i
+夹心 35 n
+夹心板 3 n
+夹心糖 3 n
+夹心饼 3 n
+夹心饼乾 3 i
+夹心饼干 3 i
+夹手 3 v
+夹批 3 v
+夹承浆 3 n
+夹持 28 v
+夹攻 256 v
+夹断 5 v
+夹断电压 3 n
+夹景 3 n
+夹杀 3 v
+夹杂 344 v
+夹杂着 3 v
+夹来夹去 3 l
+夹板 63 n
+夹板卡环 3 n
+夹板气 5 n
+夹板船 3 n
+夹枪带棍 3 n
+夹枪带棒 9 n
+夹棍 12 n
+夹江 11 ns
+夹江县 3 ns
+夹河 15 ns
+夹法 3 n
+夹注 6 v
+夹注号 3 n
+夹点 3 n
+夹生 19 v
+夹生饭 4 n
+夹皮沟 4 n
+夹盘 3 n
+夹着尾巴 3 n
+夹着烟 3 n
+夹竹桃 67 n
+夹紧 24 v
+夹缝 79 n
+夹缠不清 3 l
+夹肝 3 n
+夹肢窝 3 n
+夹脊 3 n
+夹芯板 3 n
+夹菜 3 n
+夹藏 3 v
+夹衣 13 n
+夹衫 3 n
+夹袄 57 n
+夹袋人物 3 n
+夹袍 3 n
+夹被 10 n
+夹角 121 n
+夹走 3 v
+夹起 3 v
+夹起尾巴 8 n
+夹起来 3 l
+夹轨器 3 n
+夹过去 3 l
+夹过来 3 l
+夹进去 3 l
+夹进来 3 l
+夹送 3 v
+夹道 99 v
+夹道欢迎 20 l
+夹道相迎 3 l
+夹金山 27 ns
+夹针 3 n
+夹钳 3 n
+夹馅 3 n
+夺 3112 v
+夺下 94 v
+夺下来 3 v
+夺人之爱 3 i
+夺人所好 3 i
+夺位 3 v
+夺其谈经 3 i
+夺冠 472 v
+夺冠军 3 i
+夺占 48 v
+夺去 397 v
+夺取 2163 v
+夺名 3 v
+夺命 3 v
+夺命岛 3 ns
+夺回 384 v
+夺回去 3 i
+夺回来 3 i
+夺宝 3 v
+夺宝奇兵 3 i
+夺席谈经 3 i
+夺得 1287 v
+夺志 3 v
+夺斗 3 v
+夺权 185 v
+夺来 3 v
+夺来夺去 3 i
+夺杯 26 v
+夺标 24 v
+夺气 3 v
+夺爱 3 v
+夺目 242 v
+夺眶 3 v
+夺眶而出 109 i
+夺胎换骨 3 i
+夺走 141 v
+夺路 140 v
+夺过 3 v
+夺过去 3 v
+夺过来 3 v
+夺金 11 v
+夺金点 3 i
+夺金牌 3 i
+夺门 3 v
+夺门而入 3 i
+夺门而出 29 i
+夺食 5 v
+夺魁 57 v
+夺魂 3 v
+夺魄 3 i
+夼 6 g
+夾 2 zg
+奁 99 g
+奂 59 zg
+奄 88 i
+奄奄 14 z
+奄奄一息 172 i
+奄奄不振 3 i
+奄奄待毙 5 i
+奄忽 3 z
+奄然 3 z
+奇 4743 ag
+奇丑 3 n
+奇丑无比 3 i
+奇丽 51 a
+奇书 58 n
+奇乾 3 ns
+奇事 129 n
+奇人 172 n
+奇仁 3 nz
+奇伟 27 a
+奇佳 20 nz
+奇侠传 3 nz
+奇偶 51 n
+奇偶性 3 n
+奇偶校验 3 n
+奇偶比 3 nz
+奇光异彩 3 i
+奇兵 123 n
+奇冤 33 v
+奇冷 3 a
+奇冷无比 3 i
+奇函数 3 n
+奇利 3 nz
+奇功 144 a
+奇勋 2 n
+奇卡洛夫 4 nrt
+奇卢巴 3 nrt
+奇台 16 n
+奇台县 4 ns
+奇名 3 a
+奇境 3 n
+奇士 16 n
+奇士谋臣 3 n
+奇声 3 n
+奇天大耻 3 i
+奇夫 3 n
+奇奇 3 a
+奇奇怪怪 3 i
+奇奥 3 nz
+奇奥不测 3 nrt
+奇女 3 n
+奇女子 14 n
+奇妙 364 a
+奇姆肯特 2 nrt
+奇婚记 3 n
+奇寒 27 a
+奇寒彻骨 3 i
+奇尼 5 nz
+奇山异水 2 i
+奇山秀水 2 i
+奇岩 3 n
+奇峰 111 n
+奇峰怪石 3 i
+奇峰突起 3 i
+奇峰镇 2 ns
+奇崛 17 a
+奇巧 39 a
+奇差 3 n
+奇幻 113 n
+奇幻魔法 3 i
+奇庞 2 n
+奇庞福艾 3 ns
+奇异 490 a
+奇异果 3 n
+奇强 11 v
+奇形异状 3 i
+奇形怪状 88 i
+奇志 2 n
+奇思妙想 8 i
+奇怪 3898 v
+奇怪的是 3 i
+奇情 3 n
+奇情片 3 n
+奇惨无比 3 i
+奇想 62 n
+奇想天开 3 i
+奇慢 3 a
+奇才 289 n
+奇才异能 3 i
+奇才队 3 i
+奇技 10 nz
+奇技淫巧 10 i
+奇摩 2 nz
+奇效 49 a
+奇数 109 n
+奇文 19 nz
+奇文共赏 3 i
+奇文瑰句 3 n
+奇普 3 nz
+奇景 103 n
+奇曼 3 nrt
+奇术 3 n
+奇材 2 n
+奇案 3 n
+奇梦石 3 n
+奇正 48 nz
+奇灵王 3 nz
+奇点 32 n
+奇热 3 a
+奇热无比 3 i
+奇特 1089 nz
+奇特性 3 b
+奇珍 307 b
+奇珍异品 3 n
+奇珍异宝 50 i
+奇珍异玩 3 n
+奇瑞 51 nz
+奇瓦瓦 4 nrt
+奇瓦瓦州 3 nrt
+奇画 3 n
+奇痒 61 a
+奇痛 3 a
+奇痛无比 3 i
+奇白 3 v
+奇白无比 3 i
+奇石 20 n
+奇石网 3 nz
+奇石馆 3 n
+奇硬 3 a
+奇硬无比 3 i
+奇祸 3 n
+奇离古怪 3 nz
+奇秀 24 a
+奇秘 3 a
+奇经八脉 3 i
+奇绝 28 v
+奇缘 14 n
+奇缺 51 a
+奇置换 3 i
+奇美 46 nz
+奇耻大辱 116 i
+奇花墨兰 2 ns
+奇花异卉 10 n
+奇花异草 33 i
+奇莱 3 nrt
+奇莱山 3 nz
+奇葩 39 n
+奇葩异卉 3 nr
+奇葩异草 3 v
+奇虎 3 nz
+奇行 3 v
+奇袭 114 v
+奇袭战术 3 n
+奇装 3 v
+奇装异服 27 i
+奇观 273 a
+奇计 3 v
+奇诡 3 i
+奇谈 24 v
+奇谈怪论 21 i
+奇谋 18 n
+奇谭 3 i
+奇谲 3 a
+奇货可居 22 i
+奇趣 12 a
+奇蹄 3 n
+奇蹄目 16 n
+奇软无比 3 i
+奇迹 983 n
+奇迹式 3 n
+奇迹般地 3 i
+奇遇 90 n
+奇遇记 3 n
+奇门 102 n
+奇门遁甲 3 v
+奇闻 82 n
+奇险 99 n
+奇零 3 v
+奇风异俗 3 i
+奇黑 3 v
+奇黑无比 3 i
+奈 823 vg
+奈何 618 v
+奈何桥 3 ns
+奈克 2 nrt
+奈及利亚 3 ns
+奈子 3 nz
+奈尔 6 nrt
+奈德 3 nrt
+奈拉 4 nrt
+奈斯 39 nrt
+奈曼旗 6 ns
+奈特 6 nrt
+奈瑟 12 nrt
+奈瑟菌属 3 n
+奈良 65 v
+奈良县 8 ns
+奈良市 3 ns
+奉 4375 v
+奉为 3 v
+奉为圭臬 4 i
+奉为楷模 3 v
+奉为至宝 2 i
+奉人拍马 3 i
+奉令 34 v
+奉令承教 3 n
+奉侍 3 v
+奉俊豪 3 i
+奉候 3 v
+奉公 22 n
+奉公不阿 3 ns
+奉公克己 3 n
+奉公如法 3 l
+奉公守法 12 n
+奉公正己 3 i
+奉公职守 3 i
+奉养 164 v
+奉养父母 3 n
+奉军 3 v
+奉到 3 v
+奉劝 50 v
+奉化 60 v
+奉化县 3 ns
+奉化市 3 ns
+奉召 3 v
+奉告 55 v
+奉命 749 v
+奉命唯谨 7 i
+奉命惟谨 3 i
+奉命行事 3 n
+奉复 3 v
+奉天 438 ns
+奉天承运 3 n
+奉天省 3 ns
+奉天省长 3 i
+奉头鼠窜 3 i
+奉如神明 3 i
+奉子成婚 3 l
+奉守 3 v
+奉安 5 ns
+奉恒高 256 n
+奉托 3 v
+奉扬仁风 3 i
+奉承 232 v
+奉承拍马 3 n
+奉承者 3 n
+奉承话 25 n
+奉教 3 v
+奉敬 3 v
+奉新 15 v
+奉新县 3 ns
+奉旨 252 v
+奉此 3 l
+奉派 3 v
+奉献 735 v
+奉献精神 3 i
+奉献给 3 v
+奉献者 2 n
+奉祀 36 v
+奉系 3 v
+奉系军阀 3 l
+奉节 75 v
+奉节县 12 ns
+奉若 3 v
+奉若宝典 3 ns
+奉若神明 24 i
+奉行 583 v
+奉行故事 3 i
+奉访 3 v
+奉调 42 v
+奉贤 25 nrt
+奉贤区 6 ns
+奉贤县 3 ns
+奉赠 10 v
+奉赵 3 ns
+奉辛比克党 30 ns
+奉辞伐罪 3 i
+奉迎 14 v
+奉还 58 v
+奉送 53 v
+奉陪 85 v
+奉陪到底 3 n
+奉顺英 3 ns
+奋 377 v
+奋不顾命 3 i
+奋不顾身 176 i
+奋争 9 nz
+奋力 625 d
+奋力抢救 3 i
+奋力拼搏 3 i
+奋勇 369 d
+奋勇争先 12 i
+奋勇作战 3 i
+奋勇前进 3 i
+奋勇向前 3 i
+奋勇当先 10 i
+奋勇直前 3 i
+奋勉 3 v
+奋发 126 v
+奋发上进 2 l
+奋发努力 21 l
+奋发向上 24 l
+奋发图强 44 i
+奋发有为 23 i
+奋发自救 3 i
+奋发踔厉 3 nr
+奋发蹈厉 3 i
+奋发进取 268 l
+奋志 3 v
+奋战 294 v
+奋战不懈 3 i
+奋战到底 3 l
+奋斗 1682 v
+奋斗不息 8 l
+奋斗以成 3 l
+奋斗到底 3 l
+奋斗史 7 l
+奋斗目标 3 l
+奋斗终生 3 i
+奋斗者 3 n
+奋武扬威 3 i
+奋然 3 d
+奋笔 3 v
+奋笔疾书 18 i
+奋笔直书 3 i
+奋翅 3 v
+奋翅展翼 3 n
+奋翼 3 nz
+奋臂 3 v
+奋臂高呼 3 i
+奋袂 3 d
+奋袂而起 3 i
+奋起 600 v
+奋起拼搏 3 i
+奋起直追 15 i
+奋身不顾 3 i
+奋迅 3 nz
+奋进 88 v
+奋进号 7 nz
+奋飞 6 v
+奌 2 zg
+奎 156 nr
+奎因 6 nrt
+奎塔 9 nrt
+奎媛媛 9 nrt
+奎宁 50 nrt
+奎宁环基 3 ns
+奎尔 18 nrt
+奎尼定 3 ns
+奎屯 14 ns
+奎屯市 8 ns
+奎屯河 3 ns
+奎德 3 nrt
+奎文区 3 ns
+奎斯 5 nrt
+奎斯特 10 nrt
+奎松 7 nrt
+奎松城 2 ns
+奎特 4 nrt
+奎瓦斯 3 nrt
+奎达 4 nrt
+奏 4034 v
+奏乐 108 n
+奏书 3 n
+奏事官 3 n
+奏于 3 v
+奏凯 13 v
+奏凯歌 3 n
+奏凯言旋 3 n
+奏出 3 v
+奏出去 3 v
+奏出来 3 v
+奏功 3 n
+奏呜曲 3 z
+奏响 40 n
+奏国歌 3 n
+奏折 524 n
+奏报 150 n
+奏捷 7 n
+奏效 148 n
+奏明 3 v
+奏曲 3 n
+奏本 133 n
+奏法 12 n
+奏点 3 n
+奏琴 3 n
+奏疏 422 n
+奏章 313 n
+奏表 3 n
+奏议 37 n
+奏请 3 v
+奏起来 3 v
+奏鸣 7 v
+奏鸣曲 119 n
+奏鸣曲式 3 n
+契 532 zg
+契丹 1205 ns
+契丹语 8 nz
+契券 3 n
+契单 3 n
+契卡 15 ns
+契友 4 n
+契合 105 v
+契合点 5 n
+契合金兰 3 ns
+契尔氏 3 nr
+契据 6 n
+契文 3 n
+契斯 2 ns
+契机 297 n
+契科 2 ns
+契税 20 n
+契约 727 ns
+契约书 3 n
+契约化 2 ns
+契约型 3 n
+契约式 2 n
+契约性 4 n
+契约法 2 n
+契纸 3 n
+契船求剑 3 n
+契若金兰 3 nr
+契证 3 n
+契诃夫 54 nr
+奓 8 zg
+奓着胆子 3 nr
+奔 6140 zg
+奔丧 62 v
+奔亡 3 v
+奔儿 2 v
+奔出 3 v
+奔劳 3 v
+奔北 3 v
+奔去 3 v
+奔向 3 v
+奔命 14 v
+奔四 3 nz
+奔回 3 v
+奔回来 3 i
+奔头 27 v
+奔头儿 3 n
+奔小康 3 z
+奔往 3 v
+奔忙 52 v
+奔放 129 v
+奔月 19 v
+奔死 3 v
+奔泉 3 nz
+奔波 393 v
+奔波如梭 3 i
+奔波往返 3 i
+奔泻 19 v
+奔流 163 v
+奔涌 74 v
+奔牛节 3 i
+奔突 18 vn
+奔窜 17 v
+奔腾 558 v
+奔萨 5 nrt
+奔行 3 v
+奔袭 101 v
+奔豚 3 n
+奔走 504 v
+奔走之友 3 i
+奔走呼号 35 i
+奔走如市 3 i
+奔走相告 36 i
+奔走钻营 3 i
+奔赴 265 v
+奔赴前线 3 i
+奔跃 3 v
+奔跑 616 v
+奔跳 3 v
+奔轶绝尘 3 v
+奔逃 109 v
+奔逐 3 v
+奔逝 3 v
+奔逸 5 v
+奔逸绝尘 2 i
+奔雷 3 v
+奔马 48 v
+奔驰 558 v
+奔驰公司 13 nt
+奔驰如飞 3 i
+奔驰车 3 nt
+奔驶 5 v
+奕 976 zg
+奕奕 27 z
+奖 3122 n
+奖优罚劣 3 n
+奖分 3 n
+奖券 15 n
+奖券行 3 n
+奖助 3 vn
+奖助学 2 n
+奖助学金 10 n
+奖助金 3 n
+奖励 1168 vn
+奖励制度 3 n
+奖励品 3 n
+奖励性 6 n
+奖励法 3 n
+奖励金 9 n
+奖勉 3 v
+奖勤罚懒 4 n
+奖台 3 n
+奖品 81 n
+奖售 3 vn
+奖学 4 n
+奖学金 563 n
+奖得主 3 n
+奖惩 853 n
+奖惩制 3 n
+奖惩制度 3 n
+奖惩条例 3 n
+奖惩法 3 n
+奖掖 26 vn
+奖提名 3 n
+奖旗 8 n
+奖杯 186 n
+奖牌 141 n
+奖牌数 3 n
+奖牌榜 4 n
+奖状 89 n
+奖盘 2 n
+奖章 465 n
+奖给 23 vn
+奖罚 7 vn
+奖罚分明 5 n
+奖许 3 v
+奖评 3 n
+奖赏 156 v
+奖金 1029 n
+奖金制 4 n
+奖金税 3 n
+奖金额 37 n
+奖门人 3 n
+奖限 3 n
+奖项 207 n
+奖饰 3 n
+套 4300 q
+套上去 3 v
+套上来 3 v
+套下去 3 v
+套下来 3 l
+套丝机 2 n
+套中人 5 n
+套书 14 n
+套交情 14 n
+套件 49 n
+套住 3 v
+套作 3 n
+套儿 3 n
+套入 3 v
+套写 3 v
+套出 3 v
+套出来 3 l
+套利 34 n
+套到 3 v
+套包 3 n
+套印 17 n
+套印本 3 n
+套取 49 v
+套叠 11 v
+套口供 3 v
+套圈 5 n
+套型 2 n
+套头 9 n
+套头毛衣 3 n
+套头衫 3 n
+套套 28 n
+套套片 3 n
+套子 84 n
+套实 3 n
+套得 3 v
+套房 116 n
+套招 3 n
+套换 3 v
+套接 2 v
+套改 3 v
+套数 39 n
+套料 2 n
+套曲 56 n
+套服 3 n
+套杉 3 n
+套来套去 3 v
+套板 3 n
+套汇 36 n
+套版 3 v
+套版印刷 3 n
+套牌车 3 n
+套牢 23 n
+套犁 3 n
+套状 3 n
+套环 4 n
+套现 29 v
+套用 84 n
+套着 3 v
+套票 7 n
+套种 29 n
+套笔 3 n
+套筒 28 n
+套筒气枪 3 n
+套算 3 v
+套管 47 n
+套管接箍 3 n
+套管补贴 3 n
+套索 26 n
+套红 5 n
+套结 3 v
+套绳 11 n
+套耕 3 v
+套色 26 n
+套色版 3 n
+套节目 3 n
+套菜 4 n
+套衫 8 n
+套袋 3 n
+套袖 13 n
+套裁 3 n
+套装 139 n
+套装软体 3 l
+套装门 3 n
+套裙 10 n
+套裤 6 n
+套话 120 n
+套话连篇 2 n
+套语 5 n
+套购 6 v
+套起 3 v
+套起来 3 l
+套路 159 n
+套车 15 n
+套近乎 42 l
+套进 3 v
+套进去 3 v
+套进来 3 l
+套锁 3 v
+套问 18 n
+套问出 3 n
+套间 76 n
+套鞋 9 n
+套餐 800 n
+套马 3 n
+奘 31 g
+奚 201 nr
+奚为遥 2 nr
+奚啸伯 4 nr
+奚国华 2 nr
+奚国皇帝 2 nr
+奚大为 4 nr
+奚夫人 2 nr
+奚普里 2 nr
+奚王名 2 nr
+奚王牙 2 nr
+奚王萧 2 nr
+奚王霞 4 nr
+奚统军 2 nr
+奚美娟 4 nr
+奚胜见 2 nr
+奚臣属 2 nr
+奚落 98 v
+奚长老 28 nr
+奚静之 2 nr
+奠 153 zg
+奠下 3 v
+奠仪 4 n
+奠基 159 n
+奠基人 262 n
+奠基仪式 3 n
+奠基典礼 3 n
+奠基性 24 n
+奠基石 4 n
+奠基礼 5 n
+奠基者 64 n
+奠定 1804 v
+奠礼 3 v
+奠祭 3 v
+奠立 3 v
+奠都 3 v
+奠酒 18 v
+奡 6 zg
+奢 191 n
+奢侈 464 a
+奢侈品 300 n
+奢侈浪费 22 n
+奢华 215 a
+奢想 3 n
+奢望 183 a
+奢欲 3 n
+奢求 11 n
+奢淫 3 a
+奢谈 3 v
+奢费 3 n
+奢靡 77 a
+奢靡浪费 3 n
+奤 39 zg
+奥 2062 nr
+奥丁 4 nr
+奥万大 3 nr
+奥义书 9 nr
+奥亚波 2 nr
+奥伊 2 nrt
+奥伊廷 2 nr
+奥伊斯 6 nr
+奥伊根 2 nz
+奥伦堡 28 nr
+奥伦治 12 nr
+奥伦贝 4 nr
+奥伯丁 4 nr
+奥伯恩 2 nr
+奥伯斯 6 nr
+奥伯林 12 nr
+奥伯特 4 nr
+奥体 5 n
+奥体中心 5 nt
+奥停球 2 n
+奥克 5 nrt
+奥克兰 57 nr
+奥克兰市 2 ns
+奥克兰港 2 ns
+奥克友 2 nr
+奥克尼 7 nr
+奥克帕 2 nr
+奥克拉荷 3 nr
+奥克斯 3 nr
+奥克森菲 5 nrt
+奥克洛 8 nr
+奥克苏 8 nr
+奥克苏斯 2 nrt
+奥克萨 2 nr
+奥克里 2 nrt
+奥兰 23 ns
+奥兰加 2 nz
+奥兰吉那 14 ns
+奥兰多 57 nrt
+奥兰岛 2 ns
+奥兰治 50 nz
+奥其尔 4 nr
+奥其尔巴特 54 ns
+奥凯西 3 nr
+奥列格 7 nr
+奥创 2 nz
+奥利 26 nz
+奥利佛 2 nr
+奥利力 29 nr
+奥利地 3 ns
+奥利塔 2 nr
+奥利安 15 nr
+奥利弗 6 nr
+奥利拉 3 nrt
+奥利根 2 ns
+奥利烷 3 nz
+奥利瓦 2 nr
+奥利维 3 nr
+奥利维亚 4 ns
+奥利金 2 nr
+奥利韦拉 5 nrt
+奥别林 4 nz
+奥加湖 7 ns
+奥加辽 2 nr
+奥勃斯 2 nr
+奥勃洛 4 nr
+奥勒 4 nrt
+奥勒尔 2 nr
+奥勒留 2 nr
+奥博 8 nr
+奥卡万戈 6 nrt
+奥卡卡 8 nr
+奥卡姆 6 nr
+奥卡河 9 nr
+奥卡福 3 nr
+奥古 4 ns
+奥古斯 84 nr
+奥古斯丁 33 nrt
+奥古斯塔 20 nrt
+奥古斯德 2 nrt
+奥古斯特 18 nrt
+奥古斯都 3 ns
+奥吉尔 2 nr
+奥国 3 ns
+奥国人 3 nr
+奥地利 1343 ns
+奥地利人 25 nz
+奥地利共和国 9 ns
+奥地利政府 5 nt
+奥基乔 2 nr
+奥基迪 3 nr
+奥塞梯 14 nr
+奥塞罗 3 nr
+奥塞罗特 3 nrt
+奥墨冬 2 nr
+奥多 24 nrt
+奥多亚 2 ns
+奥多姆 25 nrt
+奥多尔 9 nrt
+奥多拉 2 nrt
+奥夫雷 3 nr
+奥妙 328 nr
+奥妙无比 3 i
+奥妙无穷 25 i
+奥姆 2 nrt
+奥姆真理教 2 nz
+奥委会 103 j
+奥威尔 2 nr
+奥尔丁顿 2 ns
+奥尔丹 2 nr
+奥尔伯 3 nr
+奥尔兰 2 nr
+奥尔加 10 nr
+奥尔加斯 2 nrt
+奥尔南 2 ns
+奥尔圣 2 nr
+奥尔基 2 nr
+奥尔堡 3 nr
+奥尔塔 3 nrt
+奥尔夫 3 nr
+奥尔岛 2 ns
+奥尔巴 2 nr
+奥尔巴尼 9 nrt
+奥尔布 3 nr
+奥尔布赖特 25 nrt
+奥尔德 12 nr
+奥尔忠尼 3 nr
+奥尔文 2 nr
+奥尔斯 3 nr
+奥尔斯克 5 nrt
+奥尔斯姆 9 nrt
+奥尔施 10 nr
+奥尔格里 3 nrt
+奥尔梅克 59 nrt
+奥尔森 3 nr
+奥尔沙 4 nr
+奥尔波特 2 nrt
+奥尔洛夫 16 nrt
+奥尔洪 2 nr
+奥尔洪岛 2 ns
+奥尔温 2 nr
+奥尔特 16 nrt
+奥尔特加 5 nrt
+奥尔特曼 6 nrt
+奥尔珈 2 nrt
+奥尔甫斯 6 nrt
+奥尔登 2 nrt
+奥尔登堡 3 nrt
+奥尔级 3 nr
+奥尔纳 3 nr
+奥尔良 44 nr
+奥尔良城 2 nr
+奥尔语 29 nz
+奥尔诺 2 nr
+奥尼亚 31 ns
+奥尼尔 194 nr
+奥尼斯 2 nr
+奥尼河 2 ns
+奥尼达 4 nr
+奥山 7 ns
+奥山由美 3 nz
+奥巴 2 nrt
+奥巴桑 3 nr
+奥巴桑乔 3 nr
+奥巴马 250 ns
+奥布宁斯 5 ns
+奥布尔 16 nr
+奥布斯 16 nr
+奥布林 2 nr
+奥布莱恩 3 nrt
+奥布赖恩 2 nrt
+奥布里 4 nrt
+奥希金斯 8 nr
+奥帕林 4 nr
+奥帕特拉 23 nrt
+奥帕瓦 2 nr
+奥帕贝 2 nr
+奥庆哈 16 nr
+奥库梅 2 nr
+奥庞波 48 nr
+奥康奈 5 nr
+奥康纳 9 nr
+奥康诺 3 nr
+奥廖克 3 nr
+奥廖尔 12 nr
+奥廷托 2 nr
+奥弗涅 2 nr
+奥彭海 2 nr
+奥得 17 nrt
+奥得河 31 nr
+奥德 20 nrt
+奥德修 27 nr
+奥德兹 4 nr
+奥德塞 2 nr
+奥德奥 3 nr
+奥德姆 5 nr
+奥德威 4 nr
+奥德曼 3 nr
+奥德朗 2 nr
+奥德格 3 nr
+奥德河 3 nr
+奥德翁 6 nr
+奥德萨 2 nr
+奥德赛 21 nr
+奥恩布 2 nr
+奥扎仪 2 nr
+奥托 134 nrt
+奥托一世 3 nrt
+奥托卡 3 nr
+奥扬泰 3 nr
+奥拉 35 nrt
+奥拉夫 2 nr
+奥拉宁 2 nr
+奥拉山 2 ns
+奥拉朱旺 3 nr
+奥拓车 3 n
+奥拜斯 2 nr
+奥援 10 nr
+奥援有灵 3 nr
+奥敦周 2 nr
+奥数 5 nz
+奥数班 3 nr
+奥数网 3 nz
+奥文多 2 nr
+奥文斯 2 nr
+奥文本杜 3 nr
+奥斯丁 51 nr
+奥斯克 3 nr
+奥斯勒 5 nr
+奥斯卡 269 nr
+奥斯卡奖 29 nz
+奥斯卡金像奖 8 nz
+奥斯坦 6 nr
+奥斯塔 6 nr
+奥斯威 2 nr
+奥斯威辛 7 nrt
+奥斯威辛集中营 5 ns
+奥斯戮 3 i
+奥斯托 7 nrt
+奥斯摩 20 nrt
+奥斯曼 187 nr
+奥斯曼帝国 296 ns
+奥斯本 3 ns
+奥斯汀 38 nrt
+奥斯港 3 ns
+奥斯特 58 nrt
+奥斯特洛夫斯基 28 nrt
+奥斯特瓦尔德 18 nrt
+奥斯特罗 3 nrt
+奥斯纳 2 nr
+奥斯维辛 6 nrt
+奥斯达 12 nz
+奥斯陆 81 nr
+奥斯陆大学 17 nt
+奥斯陆市 3 ns
+奥普拉 8 nrt
+奥曼迪 3 nr
+奥木列 30 ns
+奥本山 10 ns
+奥本海默 27 nr
+奥杜瓦 3 nrt
+奥杜贝尔 2 nrt
+奥杜韦 13 nr
+奥杰塔 2 nr
+奥林匹 42 nr
+奥林匹亚 60 nz
+奥林匹亚科斯队 2 nz
+奥林匹克 259 nz
+奥林匹克公园 19 nz
+奥林匹克村 4 nz
+奥林匹克赛 2 nz
+奥林匹克运动 38 nz
+奥林匹克运动会 106 nz
+奥林匹斯 3 nz
+奥林巴斯 19 nrt
+奥林帕斯 36 nrt
+奥林比亚 3 ns
+奥林波斯山 5 ns
+奥果韦 11 nr
+奥柏林 2 nr
+奥柔拉 3 nr
+奥校 3 j
+奥根塔勒 2 nz
+奥格 9 nrt
+奥格兰 5 nr
+奥格斯堡 17 nrt
+奥格朗 3 nr
+奥格登 4 nr
+奥梅尔 2 nr
+奥武甫 4 nr
+奥比 19 j
+奥氏体 30 nr
+奥沙利 14 ns
+奥河 2 ns
+奥波莱 2 nr
+奥泰巴 2 nr
+奥洛夫 3 nr
+奥津 3 ns
+奥涅加 4 nr
+奥涅格 5 nr
+奥涅金 22 nr
+奥温戈 2 nr
+奥焦尔 2 nr
+奥特 8 nrt
+奥特丽 3 nr
+奥特加 3 nr
+奥特尔 17 nr
+奥特斯 3 nr
+奥特曼 6 nr
+奥特朗 3 nr
+奥特朗托 6 nrt
+奥特里 2 nrt
+奥特里尼 2 nrt
+奥特雷 4 nr
+奥特韦 5 nr
+奥狄塞 3 nr
+奥狄氏 2 nr
+奥狄浦 16 nr
+奥瑞纳 16 nr
+奥瓦河 2 nr
+奥瓦霍 2 nr
+奥田硕 5 nr
+奥申委 3 nr
+奥登 2 nrt
+奥登堡 2 nr
+奥登林 2 nr
+奥的斯 13 ns
+奥皇弗 2 nr
+奥神队 3 n
+奥福特 6 nr
+奥科岛 2 nr
+奥科查 5 nr
+奥科萨 2 nr
+奥秒 3 nr
+奥秘 262 nr
+奥立佛 141 nr
+奥立弗 4 nr
+奥精义 2 nr
+奥索卡 3 nr
+奥纳多 4 nrt
+奥组委 21 j
+奥维伦 5 nr
+奥维尔 4 nr
+奥维尔斯 59 nrt
+奥维德 9 nr
+奥罗亚 6 ns
+奥罗宾 5 ns
+奥罗莫 3 nr
+奥美 20 nz
+奥美嘉 3 nr
+奥美定 97 nr
+奥美拉唑 2 nz
+奥联军 2 j
+奥胡斯 2 nr
+奥航 11 j
+奥芬巴 4 nr
+奥莱依 5 nr
+奥莱格 4 nr
+奥菲利 3 nr
+奥菲斯 9 nr
+奥菲莉 2 nr
+奥萨哥 32 nr
+奥萨苏 15 ns
+奥萨苏纳 3 ns
+奥萨贝尔 2 nrt
+奥蒂化 2 nr
+奥蒂拉 2 nr
+奥蒂斯 2 nr
+奥蒂瓦 6 nr
+奥蒙德 5 nr
+奥西姆 2 nr
+奥西波夫 2 nrt
+奥西诺 2 nr
+奥西里 3 ns
+奥西里斯 3 nrt
+奥诡奇幻 3 i
+奥诺费 16 nr
+奥诺马克 16 nrt
+奥谢 6 nrt
+奥贝尔 2 nr
+奥贝德 4 nr
+奥贝斯坦 3 nrt
+奥赛罗 31 nr
+奥赫拉 2 nr
+奥赫洛普 2 nrt
+奥赫里德湖 6 ns
+奥达基 2 nr
+奥运 440 j
+奥运会 1244 j
+奥运会徽 3 nz
+奥运健儿 3 nz
+奥运冠军 3 nr
+奥运团 3 nz
+奥运场馆 3 nz
+奥运村 3 nz
+奥运金牌 3 nz
+奥连布 2 nr
+奥连特省 10 ns
+奥迪 92 nz
+奥迪氏 3 nr
+奥迪牌 3 nz
+奥迪车 12 nz
+奥里 18 nrt
+奥里亚 12 ns
+奥里康 2 nr
+奥里涅 3 nrt
+奥里纳 3 nr
+奥里萨 19 nr
+奥里萨邦 14 ns
+奥里诺科 31 nrt
+奥里诺科河 26 nrt
+奥里雅 3 nr
+奥金莱 3 nr
+奥铃 2 nz
+奥长石 2 nr
+奥陶世 13 nr
+奥陶系 7 nr
+奥陶纪 62 nr
+奥陶统 2 nr
+奥雷利 2 nr
+奥雷斯 3 nr
+奥马 10 ns
+奥马哈 4 nrt
+奥马尔 20 nr
+奥鲁官 2 nr
+奥鲁赤 3 nr
+奥黑尔 3 nr
+奥黛丽 8 nr
+奭 89 zg
+奮 72 zg
+奯 5 zg
+奱异 3 z
+奲 433 zg
+女 27951 b
+女一号 3 nz
+女上位 3 n
+女上司 3 n
+女上衣 3 n
+女上装 3 n
+女丑 3 n
+女丑剧场 3 l
+女业主 3 n
+女中丈夫 5 n
+女中学生 3 n
+女中尧舜 3 nr
+女中豪杰 16 nr
+女中音 19 n
+女主人 110 n
+女主内 3 nz
+女主唱 3 n
+女主持 3 n
+女主播 3 nz
+女主管 3 n
+女主角 3 n
+女举 6 n
+女乐 3 n
+女乒 15 j
+女乘务员 3 n
+女事主 3 n
+女交警 3 j
+女亲属 3 n
+女人 8175 n
+女人体 5 n
+女人味 29 n
+女人图 3 n
+女人家 32 n
+女人帮 3 n
+女人性 3 n
+女人气 15 n
+女人爱 3 n
+女人真 3 nz
+女人篇 3 n
+女人网 3 n
+女人腔 3 n
+女人街 3 n
+女仆 101 n
+女仕 3 n
+女仙 4 n
+女优 3 n
+女伴 78 n
+女伶 3 n
+女低音 5 n
+女体盛 3 nz
+女作家 93 n
+女佣 119 n
+女佣人 2 n
+女侍 10 n
+女侠 50 n
+女侦探 3 n
+女保护人 3 n
+女保护者 3 n
+女保镖 3 n
+女修道院 3 n
+女傧相 3 vn
+女像柱 3 n
+女儿 6700 n
+女儿国 6 n
+女儿墙 6 n
+女儿岛 3 n
+女儿河 3 n
+女儿红 14 n
+女儿节 2 n
+女儿身 12 n
+女兄 3 n
+女党员 3 n
+女公子 5 n
+女兵 286 n
+女内衣 3 n
+女内裤 3 n
+女冒险家 3 n
+女军官 3 n
+女凶手 3 i
+女刑警 3 n
+女医生 3 n
+女单 162 n
+女博士 3 n
+女厕 4 n
+女厕所 3 n
+女友 275 n
+女变男 3 nr
+女叛徒 3 n
+女史 23 n
+女司机 3 n
+女同事 3 n
+女同学 3 n
+女同性恋 3 n
+女同胞 3 n
+女囚 4 n
+女团 12 n
+女垒 16 n
+女墙 17 n
+女士 1448 n
+女士们 3 n
+女士优先 3 nr
+女士内衣 3 nz
+女士香水 3 nz
+女声 46 n
+女声版 3 n
+女声独唱 3 l
+女大使 3 n
+女大十八 3 nz
+女大十八变 7 nz
+女大当嫁 16 i
+女大衣 3 nz
+女大难留 3 i
+女大须嫁 3 i
+女套装 3 n
+女奴 67 n
+女奴隶 3 n
+女妖 18 n
+女妖精 4 n
+女妖魔 3 n
+女姓 3 n
+女娃 60 n
+女娃儿 28 n
+女娃娃 6 n
+女娃子 37 n
+女娇 4 n
+女娘 2 n
+女娲 70 n
+女娲补天 5 l
+女婢 12 n
+女婴 100 n
+女婿 671 n
+女子 5858 n
+女子书院 3 n
+女子单打 3 l
+女子双打 3 l
+女子监狱 3 n
+女子组 14 n
+女子高级 3 n
+女学士 3 n
+女孩 1391 n
+女孩儿 351 n
+女孩子 973 n
+女孩子家 6 n
+女官 3 n
+女客 3 n
+女家 166 n
+女家教 3 nz
+女家长 3 n
+女宾 30 n
+女宿舍 3 n
+女将 153 n
+女将军 3 n
+女尸 366 n
+女尼 70 nz
+女居士 3 n
+女工 411 n
+女巨人 3 n
+女巫 42 n
+女巫婆 3 nr
+女师 3 n
+女帽 5 n
+女干事 3 n
+女年满 3 n
+女店主 3 n
+女店员 3 n
+女式 30 n
+女式西服 3 n
+女弟 3 n
+女弟子 3 n
+女强人 49 n
+女影星 3 n
+女影迷 3 n
+女徒 3 n
+女德 3 n
+女性 5214 n
+女性主义 22 n
+女性内衣 3 n
+女性化 63 n
+女性手机 3 n
+女性朋友 3 n
+女性用品 3 n
+女性网 3 n
+女性美 3 nz
+女性阴道 3 n
+女性频道 3 n
+女总督 3 n
+女患者 3 n
+女战士 3 nz
+女房东 3 n
+女房客 3 n
+女执事 3 n
+女扮男装 65 l
+女找男 3 l
+女抢匪 3 n
+女护士 3 n
+女招待 4 i
+女排 236 n
+女探 3 n
+女教员 3 n
+女教师 3 n
+女方 215 n
+女明星 3 n
+女星 16 n
+女曲 7 n
+女朋友 230 n
+女服 11 n
+女服务员 3 n
+女杀手 3 n
+女权 51 n
+女权主义 22 n
+女权主义者 12 n
+女权运动 3 nz
+女杰 9 n
+女板 7 n
+女校 13 n
+女校长 3 n
+女棋手 3 n
+女模特 3 nr
+女歌唱家 3 n
+女歌手 3 n
+女歌星 3 n
+女歌迷 3 n
+女民警 3 n
+女法官 3 n
+女流 105 n
+女流之辈 3 l
+女流氓 3 n
+女浴室 3 nz
+女海盗 3 n
+女演员 3 n
+女演说者 3 n
+女特务 3 n
+女特工 3 n
+女特警 3 n
+女犯 15 n
+女犯人 3 n
+女猎人 3 n
+女猎手 3 n
+女王 519 n
+女王宫 13 n
+女王蜂 3 n
+女球迷 3 n
+女生 711 n
+女生外向 3 n
+女生宿舍 3 n
+女生版 3 n
+女生节 3 n
+女生部 3 n
+女用 3 n
+女用功 3 n
+女用品 3 n
+女用披风 3 i
+女男平等 3 l
+女画家 3 n
+女病人 3 n
+女白领 3 n
+女皇 75 n
+女监工 3 j
+女相士 2 n
+女真 451 nz
+女真人 114 n
+女真族 49 nz
+女眷 101 n
+女睡衣 3 n
+女知青 3 nr
+女短内裤 3 j
+女硕士 3 nr
+女祖先 3 n
+女神 307 n
+女神像 22 n
+女神庙 9 n
+女秀才 2 nr
+女秘 3 n
+女秘书 3 n
+女童 304 n
+女童军 3 n
+女童班 3 n
+女童遭 3 n
+女管家 3 n
+女篮 178 n
+女篮赛 3 n
+女红 18 n
+女织男耕 3 n
+女经理 3 n
+女网 17 n
+女网友 3 n
+女网赛 3 n
+女羽 3 n
+女老师 3 n
+女老板 3 n
+女职员 3 n
+女职工 3 n
+女色 77 n
+女色狼 3 n
+女艺人 3 n
+女艺员 3 n
+女英雄 3 nr
+女萝 3 n
+女衫 3 n
+女装 46 n
+女装品牌 3 n
+女裙 4 n
+女裤 3 n
+女裸体 3 i
+女角 14 n
+女警 15 n
+女警官 3 n
+女警察 3 n
+女议员 3 n
+女诗人 3 n
+女调解人 3 n
+女貌郎才 3 n
+女贞 46 n
+女贞子 6 nr
+女贞苗 3 nr
+女超人 3 nr
+女足 164 n
+女足赛 5 n
+女追男 3 nr
+女选手 3 n
+女道士 5 n
+女郎 776 n
+女配角 3 n
+女金刚 3 nr
+女长当嫁 3 i
+女长须嫁 3 n
+女间谍 3 n
+女队 377 n
+女队员 11 n
+女阿姨 3 nr
+女附中 3 nz
+女院长 3 n
+女青年会 3 n
+女鞋 7 n
+女鞍 3 n
+女预言家 3 l
+女颜 6 n
+女飞人 3 n
+女飞行员 3 n
+女马 3 n
+女驸马 3 vn
+女骗子 3 n
+女高音 49 n
+女鬼 3 n
+女魔头 3 nr
+女黑人 3 n
+奴 1434 n
+奴仆 321 n
+奴佛卡因 3 n
+奴儿干 35 l
+奴化 35 n
+奴化思想 3 n
+奴化教育 3 l
+奴婢 923 n
+奴家 232 n
+奴尔 5 nrt
+奴工 3 n
+奴役 795 n
+奴性 149 n
+奴性十足 3 l
+奴才 1721 n
+奴才相 3 n
+奴斯 2 nrt
+奴脣婢舌 3 i
+奴隶 4041 n
+奴隶主 361 n
+奴隶主义 3 n
+奴隶制 485 n
+奴隶制度 100 l
+奴隶劳动 3 l
+奴隶式 3 n
+奴隶情人 3 n
+奴隶社会 127 l
+奴隶起义 3 l
+奴颜 3 n
+奴颜婢膝 30 i
+奴颜婢色 3 i
+奴颜媚骨 2 i
+奶 1255 zg
+奶业 6 n
+奶制品 63 n
+奶刷 3 n
+奶名 5 n
+奶咀 3 ns
+奶品 5 n
+奶嘴 2 n
+奶声奶气 6 n
+奶头 32 n
+奶奶 3018 n
+奶奶家 3 n
+奶妈 117 n
+奶娘 71 n
+奶子 164 n
+奶山羊 12 n
+奶房 3 n
+奶昔 3 n
+奶毛 3 n
+奶水 54 n
+奶汁 19 n
+奶油 147 n
+奶油味 3 n
+奶油小生 3 n
+奶油色 3 n
+奶油鸡蛋 3 n
+奶液 4 n
+奶牙 3 n
+奶牛 99 n
+奶牛业 5 n
+奶牛场 6 n
+奶瓶 15 n
+奶疮 3 n
+奶白 3 n
+奶白菜 5 n
+奶皮 4 n
+奶皮子 8 n
+奶类 29 n
+奶粉 446 n
+奶粉罐 3 n
+奶精 3 n
+奶糕 3 n
+奶糖 7 n
+奶罩 3 n
+奶羊 9 n
+奶腺 3 n
+奶茶 89 n
+奶豆腐 5 n
+奶酒 5 n
+奶酥 3 n
+奶酪 73 n
+奶锅 3 n
+奸 924 n
+奸人 193 n
+奸伪 3 a
+奸佞 46 n
+奸佞当道 3 z
+奸党 61 n
+奸匪 3 n
+奸同鬼蜮 3 n
+奸商 68 n
+奸夫 59 n
+奸夫淫妇 3 nr
+奸妇 5 n
+奸宄 14 n
+奸尸 3 n
+奸巧 3 a
+奸徒 49 n
+奸恶 3 a
+奸情 17 n
+奸掳烧杀 3 n
+奸智 3 n
+奸杀 22 v
+奸污 24 v
+奸污妇女 3 n
+奸淫 231 v
+奸淫幼女 3 nr
+奸淫掳掠 3 vn
+奸滑 22 v
+奸猾 36 a
+奸生子 3 n
+奸笑 12 v
+奸细 201 a
+奸臣 285 n
+奸计 132 v
+奸诈 119 a
+奸谋 3 n
+奸贼 334 n
+奸邪 95 a
+奸险 25 n
+奸雄 40 n
+她 134035 r
+她们 5966 r
+她俩 76 r
+她家 262 r
+奼紫 3 ns
+奼紫嫣红 3 nr
+奼紫焉红 3 nr
+好 92543 a
+好一朵 3 m
+好一派 3 m
+好上加好 3 l
+好上好下 3 l
+好下场 3 n
+好不好 609 l
+好不容易 579 l
+好丑 3 m
+好东东 3 ns
+好个 3 m
+好个屁 3 n
+好个秋 3 n
+好丹非素 3 l
+好为事端 3 l
+好为人师 5 l
+好主妇 3 n
+好久 410 m
+好久不见 3 l
+好久好久 48 l
+好久没 3 i
+好乐迪 3 nz
+好乖 3 d
+好书 84 n
+好乱及祸 3 i
+好乾 3 ns
+好了吗 3 v
+好了吧 3 l
+好了没 3 i
+好争吵 3 v
+好事 1218 n
+好事不出门 11 l
+好事之徒 17 i
+好事儿 30 n
+好事多磨 11 l
+好事得 3 l
+好事成双 3 i
+好事者 20 n
+好些 422 m
+好些个 14 m
+好些户 2 m
+好享来 3 l
+好人 562 n
+好人主义 10 n
+好人儿 5 l
+好人好事 20 l
+好人家 17 l
+好人难作 3 l
+好人难做 3 i
+好伦哥 3 ns
+好伴侣 3 n
+好似 380 v
+好佚恶劳 3 nr
+好作文 3 n
+好你个 3 n
+好使 112 v
+好像 5782 v
+好儿女 3 n
+好八连 5 i
+好几 323 m
+好几万 10 m
+好几丈 2 m
+好几下 10 m
+好几两 3 m
+好几个 572 m
+好几亿 2 m
+好几代 12 m
+好几件 10 m
+好几份 6 m
+好几位 66 m
+好几倍 35 m
+好几公里 2 m
+好几刀 2 m
+好几分钟 8 m
+好几匹 2 m
+好几十 5 m
+好几十万 7 m
+好几十万两 2 m
+好几十个 8 m
+好几十倍 2 m
+好几十名 4 m
+好几十块 2 m
+好几十年 11 m
+好几十张 2 m
+好几十里 4 m
+好几千 28 m
+好几千两 2 m
+好几千元 2 m
+好几双 2 m
+好几口 14 m
+好几只 13 m
+好几名 19 m
+好几回 13 m
+好几圈 8 m
+好几场 8 m
+好几块 11 m
+好几声 11 m
+好几处 29 m
+好几夜 3 m
+好几套 2 m
+好几家 7 m
+好几封 3 m
+好几层 10 m
+好几岁 19 m
+好几幢 3 m
+好几年 176 m
+好几座 5 m
+好几张 8 m
+好几户 6 m
+好几打 2 m
+好几批 2 m
+好几把 4 m
+好几支 11 m
+好几斗 2 m
+好几斤 3 m
+好几日 7 m
+好几本 3 m
+好几条 21 m
+好几杯 5 m
+好几架 2 m
+好几株 4 m
+好几样 3 m
+好几根 7 m
+好几棵 5 m
+好几步 11 m
+好几片 5 m
+好几番 2 m
+好几百 24 m
+好几百万 12 m
+好几百万年 2 m
+好几百个 3 m
+好几百元 6 m
+好几百年 3 m
+好几百米 6 m
+好几百里 2 m
+好几百间 2 m
+好几眼 3 m
+好几碗 2 m
+好几种 10 m
+好几秒 3 m
+好几篇 4 m
+好几米 2 m
+好几级 5 m
+好几艘 5 m
+好几行 2 m
+好几起 6 m
+好几趟 13 m
+好几路 3 m
+好几身 2 m
+好几轮 2 m
+好几辆 5 m
+好几辈子 2 m
+好几遍 46 m
+好几道 14 m
+好几部 3 m
+好几里 6 m
+好几门 4 m
+好几间 2 m
+好几页 5 m
+好几顿 3 m
+好几颗 3 m
+好凶 3 n
+好出风头 3 l
+好利忘义 3 l
+好利时 3 n
+好利来 3 l
+好剑法 3 i
+好办 338 v
+好动 64 v
+好动成性 3 l
+好助手 3 v
+好勇斗狠 3 i
+好去处 3 l
+好参谋 3 l
+好又多 46 l
+好友 378 n
+好受 142 v
+好句 3 m
+好吃 2799 v
+好吃好喝 37 l
+好吃懒作 3 i
+好吃懒做 22 i
+好听 309 v
+好听话 12 l
+好呀 3 e
+好哇 3 ns
+好哟 3 e
+好哭包 3 l
+好善乐施 3 l
+好善嫉恶 3 i
+好善恶恶 3 i
+好喝 315 v
+好嗓子 3 n
+好困 3 a
+好地解决 4 l
+好坏 284 v
+好坏不分 3 l
+好域名 3 n
+好壮 3 a
+好声好气 7 l
+好处 2225 d
+好处多多 3 m
+好处费 26 v
+好多 704 m
+好多个 7 m
+好多代 2 m
+好多天 3 m
+好多好多 6 m
+好多年 84 m
+好多着 5 l
+好多遍 6 m
+好多钱 3 l
+好大喜功 47 i
+好天儿 3 l
+好天良夜 3 l
+好头 47 n
+好奇 721 a
+好奇尚异 3 l
+好奇心 328 l
+好奇者 3 n
+好好 2640 d
+好好儿 126 l
+好好先生 49 i
+好好坏坏 3 l
+好好学 3 l
+好好学习 3 n
+好好看 3 a
+好好笑 3 l
+好姊妹 3 n
+好威风 3 l
+好娃娃 3 n
+好孤单 3 z
+好学 42 n
+好学上进 3 l
+好学不倦 4 i
+好学易用 3 n
+好孩子 178 n
+好客 118 n
+好客之道 3 l
+好家伙 74 e
+好容易 347 l
+好山好水 3 l
+好巧 3 a
+好帮手 3 n
+好干涉 3 l
+好开心 3 l
+好彩头 3 l
+好得多 3 l
+好得快 3 d
+好心 193 n
+好心不得好报 5 i
+好心人 50 n
+好心分手 3 l
+好心好意 18 i
+好心没好 3 l
+好心肠 17 l
+好志以暇 3 i
+好怀念 3 l
+好性 13 n
+好性儿 3 l
+好恶 90 a
+好恶不同 3 i
+好恶了 3 l
+好惨 3 a
+好想你 3 l
+好想哭 3 l
+好惹 3 v
+好意 179 v
+好意思 125 l
+好感 237 n
+好感度 3 l
+好懒 3 a
+好戏 138 n
+好戏开锣 3 i
+好戏连台 6 l
+好战 154 v
+好战份子 3 l
+好战凶猛 3 i
+好戴高帽 3 n
+好扁 3 z
+好手 367 v
+好找 58 v
+好搭档 3 n
+好收成 3 l
+好整以暇 26 i
+好斗 75 v
+好日子 258 l
+好时光 3 l
+好时坏 3 l
+好时机 3 l
+好时节 3 l
+好旺 3 a
+好易通 2 n
+好景 10 n
+好景不常 4 a
+好景不长 33 a
+好有时间 3 l
+好望角 120 n
+好杀戮 3 v
+好来坞 3 ns
+好来好去 3 l
+好来宝 14 nz
+好极了 3 l
+好样 69 d
+好样儿的 4 l
+好梦不长 3 l
+好梦难圆 3 l
+好梦难成 3 l
+好榜样 11 l
+好模好样 3 l
+好歹 578 n
+好歹不分 3 i
+好死不如 3 i
+好比 494 v
+好气 172 n
+好气儿 3 l
+好汉 1224 n
+好汉不吃 3 l
+好汉不吃眼前亏 21 l
+好汉做事好汉当 6 l
+好汉坡 3 ns
+好汉歌 3 nz
+好消息 251 n
+好滑 3 v
+好漂漂 3 n
+好点没 3 v
+好烂 3 a
+好烦 3 a
+好熟 3 a
+好爽 3 a
+好玩 190 v
+好玩儿 26 v
+好球 23 n
+好生 1321 v
+好生之德 3 i
+好生了得 3 l
+好生恶杀 3 i
+好生意 3 l
+好生生 9 n
+好男儿 37 l
+好疑 3 d
+好瘦 3 a
+好百年 3 m
+好的开始 3 l
+好看 1113 v
+好眼力 3 l
+好碟 3 n
+好福气 3 n
+好离好散 4 i
+好私服 3 l
+好稀饭 3 l
+好端端 291 z
+好笑 145 v
+好笨 3 a
+好管闲事 4 l
+好紧 3 d
+好累 3 v
+好级了 3 l
+好缠 3 v
+好网址 3 n
+好美家 3 m
+好羡慕 3 l
+好翘 3 n
+好者 5 n
+好耍 23 v
+好聚好散 3 i
+好肉剜疮 3 n
+好肥 3 n
+好胜 13 v
+好胜心 28 n
+好脾气 3 v
+好自为之 20 i
+好色 132 n
+好色之徒 26 i
+好色女 3 n
+好色客 3 n
+好色的人 3 l
+好色者 3 n
+好色鬼 3 n
+好莱坞 262 ns
+好行小惠 3 i
+好行小慧 3 l
+好言好语 11 i
+好言相劝 31 l
+好记星 3 nz
+好评 490 v
+好评率 3 n
+好话 94 v
+好话说尽 3 l
+好语似珠 3 n
+好语如珠 3 l
+好说歹说 28 i
+好读 3 v
+好谋善断 3 i
+好象 1046 n
+好赌 3 v
+好赖 14 v
+好赚 3 v
+好身材 3 n
+好转 796 v
+好辞 3 v
+好辩 3 v
+好运 148 n
+好运来 3 l
+好运气 3 l
+好迷 3 v
+好逑 3 i
+好逸恶劳 16 i
+好酒贪杯 7 i
+好酷 3 a
+好长时间 3 n
+好问决疑 3 l
+好问则裕 3 i
+好闻 19 n
+好险 3 n
+好静 3 a
+好鞋 3 n
+好驴 3 n
+好骑者堕 3 i
+好高务远 3 l
+好高骛远 31 i
+好高鹜远 3 l
+如 56065 v
+如一 112 r
+如一日 3 t
+如上 112 t
+如上图 3 i
+如上所述 60 c
+如下 2153 t
+如不 3 c
+如不胜衣 3 i
+如丘而止 3 i
+如东 21 ns
+如东县 3 ns
+如丝 3 v
+如丧考妣 14 i
+如临其境 2 i
+如临大敌 38 i
+如临深渊 16 i
+如临深谷 3 i
+如之何 3 l
+如之奈何 126 i
+如于 3 c
+如云 163 nr
+如人饮水 3 i
+如今 9684 t
+如今已是 3 l
+如以 3 c
+如众所知 3 i
+如何 19871 r
+如何是好 3 l
+如何治 3 l
+如你所愿 3 l
+如假包换 3 i
+如兄如弟 3 l
+如入无人 3 i
+如入无人之境 49 i
+如其 263 c
+如其人 3 i
+如冰似雪 3 i
+如出一口 3 i
+如出一辙 73 i
+如切如磋 3 i
+如初 185 t
+如前 3 t
+如前所说 18 c
+如前所述 60 c
+如厕 3 n
+如厕难 3 n
+如原以偿 3 i
+如同 2306 d
+如后 3 c
+如因 3 c
+如图所示 3 i
+如在 3 t
+如坐云雾 3 i
+如坐春风 3 l
+如坐针毡 36 i
+如坠五里 3 i
+如坠烟海 3 i
+如坠雾里 3 i
+如埙如箎 3 v
+如埙如篪 3 nr
+如堕烟海 3 i
+如堕烟雾 3 i
+如天之福 3 i
+如实 335 d
+如家 3 r
+如尘 3 n
+如履如临 3 l
+如履平地 15 i
+如履薄冰 42 i
+如山 3 ns
+如山倒 3 i
+如山压卵 3 i
+如左右手 3 i
+如常 192 t
+如应斯响 3 i
+如弃敝屣 3 l
+如弟 3 n
+如影胄 3 nr
+如影随形 61 i
+如影隨形 3 v
+如律令 3 nr
+如心 3 r
+如恒 5 z
+如意 321 v
+如意儿 3 l
+如意卡 3 ns
+如意杯 14 i
+如意棒 3 i
+如意港 3 ns
+如意算盘 60 n
+如意通 3 i
+如意郎君 3 l
+如愿 268 v
+如愿以偿 165 i
+如愿以尝 3 nr
+如我所愿 3 i
+如所周知 3 i
+如手如足 3 i
+如拟 3 v
+如拾地芥 3 nr
+如持左券 3 l
+如指诸掌 3 i
+如振落叶 3 i
+如操左券 3 l
+如故 67 v
+如数 88 n
+如数付清 3 l
+如数奉还 3 l
+如数家珍 53 i
+如数归还 3 i
+如斯 3 ns
+如无 3 i
+如无其事 3 i
+如日东升 3 l
+如日中天 48 l
+如日方中 2 l
+如日方升 3 l
+如昔 3 t
+如春 57 t
+如是 1207 c
+如是我闻 3 i
+如是者 2 c
+如是说 97 c
+如晤 3 v
+如晶 2 n
+如月 21 t
+如有 3 c
+如有所失 8 i
+如有雷同 3 i
+如期 216 t
+如期举行 3 l
+如期完成 3 l
+如期而至 7 i
+如来 257 t
+如来佛 54 d
+如林 303 ns
+如果 38374 c
+如果说 1175 c
+如梦令 4 nr
+如梦初觉 3 i
+如梦初醒 65 i
+如梦如仙 3 i
+如梦如幻 16 i
+如梦如醉 3 i
+如梦方醒 16 l
+如梭 22 v
+如椽大笔 3 nr
+如次 3 r
+如歌如诉 3 i
+如此 17518 c
+如此一来 116 c
+如此来说 3 c
+如此等等 3 l
+如此而已 4 i
+如此说来 3 c
+如此这般 103 l
+如水投石 3 i
+如水般 3 l
+如水赴壑 3 i
+如汤沃雪 3 nr
+如汤泼雪 3 i
+如汤浇雪 3 i
+如汤灌雪 3 i
+如沐春雨 3 i
+如沐春风 11 l
+如法泡制 3 i
+如法炮制 35 l
+如法砲制 3 v
+如泣如诉 28 i
+如泣草芥 3 n
+如洗 3 v
+如浴春风 3 nr
+如渴如饥 3 i
+如漆似胶 3 n
+如潮 3 n
+如火如荼 117 i
+如火燎原 3 l
+如牛负重 3 i
+如狼似虎 41 i
+如狼如虎 3 i
+如狼牧羊 3 n
+如玉 8 nr
+如痴似醉 3 i
+如痴如梦 3 i
+如痴如狂 31 i
+如痴如醉 28 i
+如登仙境 3 i
+如登春台 3 ns
+如皋 124 nr
+如皋县 3 ns
+如皋市 5 ns
+如石投水 3 i
+如箭在弦 6 i
+如簧之舌 3 n
+如糖似蜜 3 n
+如约 66 v
+如织 14 v
+如缕 3 z
+如胶似漆 23 i
+如胶似膝 3 i
+如胶如漆 3 i
+如胶投漆 3 i
+如臂使指 3 i
+如芒刺背 3 i
+如芒在背 2 i
+如花似月 3 i
+如花似朵 3 l
+如花似玉 67 i
+如花似锦 4 i
+如花美眷 6 i
+如若 200 c
+如若不然 7 i
+如茵 5 ns
+如荼如火 3 n
+如获至宝 31 i
+如获至珍 3 i
+如虎傅翼 3 i
+如虎得翼 3 i
+如虎添翼 50 i
+如虎生翼 3 i
+如蚁附膻 4 i
+如蝇逐臭 3 nz
+如要 3 c
+如见 3 c
+如见其人 2 i
+如见肺肝 3 i
+如解倒悬 3 i
+如许 36 d
+如诉如泣 3 l
+如诗如画 16 l
+如蹈水火 3 i
+如蹈汤火 3 i
+如运诸掌 3 i
+如酥如髓 3 n
+如醉初醒 3 i
+如醉如梦 3 i
+如醉如狂 3 i
+如醉如痴 48 i
+如醉方醒 3 i
+如释重负 112 i
+如锥画沙 3 l
+如闻其声 4 i
+如隔三秋 2 i
+如雨 3 t
+如雷 10 v
+如雷似火 3 i
+如雷击顶 3 n
+如雷灌耳 4 i
+如雷贯耳 43 i
+如雷轰顶 3 i
+如雾 3 n
+如须 3 d
+如题 3 n
+如风过耳 3 i
+如饥似渴 34 i
+如饥如渴 3 i
+如饮醍醐 3 n
+如鬼似魅 5 l
+如鱼似水 3 i
+如鱼得水 59 i
+如鱼饮水 2 i
+如鲠在喉 5 i
+如鸟兽散 3 i
+如麻 3 z
+如龙似虎 3 i
+妃 2472 n
+妃嫔 191 n
+妃嫔媵嫱 3 nr
+妃子 170 n
+妃子笑 3 n
+妃色 3 n
+妄 519 v
+妄下雌黄 3 i
+妄为 193 v
+妄人 3 n
+妄作 3 v
+妄加 3 v
+妄加指责 3 i
+妄加评论 3 i
+妄动 73 v
+妄取 3 v
+妄口巴舌 3 i
+妄图 473 v
+妄尘而拜 3 i
+妄念 12 v
+妄想 329 v
+妄想症 3 i
+妄想获取 3 i
+妄断 3 v
+妄求 3 v
+妄求者 3 n
+妄生穿凿 3 i
+妄用 3 v
+妄称 13 v
+妄自 3 v
+妄自尊大 48 i
+妄自菲薄 18 i
+妄言 65 v
+妄言妄听 3 i
+妄语 30 v
+妄说 3 v
+妄谈 3 v
+妄谈祸福 3 i
+妄费 3 v
+妅 2 zg
+妆 425 ng
+妆匣 3 n
+妆台 3 n
+妆奁 68 n
+妆嫫费黛 3 nr
+妆扮 27 v
+妆新 3 v
+妆模作样 3 n
+妆点 3 n
+妆聋做哑 3 v
+妆饰 30 n
+妇 1200 ng
+妇产 3 n
+妇产医生 3 n
+妇产医院 4 n
+妇产科 129 n
+妇人 1097 n
+妇人之仁 26 i
+妇人之见 3 i
+妇人孺子 3 i
+妇人病 3 n
+妇人醇酒 3 n
+妇代会 8 n
+妇会 3 n
+妇保 3 j
+妇儿 14 n
+妇唱夫随 2 n
+妇女 5485 n
+妇女儿童 3 n
+妇女地位 3 n
+妇女学 2 n
+妇女干部 3 n
+妇女杂志 3 n
+妇女界 4 n
+妇女病 6 n
+妇女社团 3 n
+妇女组织 3 n
+妇女网 3 n
+妇女节 5 n
+妇女解放 3 l
+妇女运动 3 l
+妇女部 3 n
+妇女部长 7 n
+妇姑勃谿 3 l
+妇委 8 n
+妇委会 6 j
+妇婴 23 n
+妇孺 261 n
+妇孺皆知 24 i
+妇容 3 n
+妇幼 61 n
+妇幼保健 3 n
+妇幼医院 3 n
+妇幼卫生 3 n
+妇幼用品 3 n
+妇弟 3 n
+妇德 5 n
+妇救会 3 n
+妇权 3 n
+妇炎洁 3 i
+妇科 271 n
+妇科医生 3 n
+妇科医院 3 n
+妇科炎症 3 n
+妇科疾病 3 n
+妇科病 33 n
+妇职 3 n
+妇联 230 j
+妇联会 3 j
+妇联总会 3 n
+妇道 37 n
+妇道人家 60 n
+妈 5014 n
+妈呀 3 n
+妈咪 5 n
+妈妈 4525 n
+妈富隆 3 ns
+妈拉巴子 5 n
+妈祖 36 n
+妈祖庙 10 n
+妈阁庙 2 n
+妊 67 t
+妊妇 3 j
+妊娠 444 v
+妊娠期 120 t
+妊孕 3 v
+妍 181 zg
+妍丽 2 a
+妍妍 3 a
+妍姿艳质 3 n
+妍媸 3 n
+妍蚩好恶 3 v
+妎 2 zg
+妏 13 zg
+妒 194 v
+妒妇 3 n
+妒嫉 36 v
+妒富愧贫 3 i
+妒忌 153 v
+妒忌心 4 i
+妒恨 34 v
+妒意 3 v
+妒火 21 v
+妒火中烧 3 i
+妒痴 3 v
+妒能 3 v
+妒能害贤 3 n
+妒贤嫉能 5 i
+妒贤忌能 3 i
+妒贤疾能 3 i
+妓 438 n
+妓女 446 n
+妓女户 3 n
+妓女装 3 n
+妓女院 3 n
+妓院 286 n
+妓馆 3 n
+妖 2505 n
+妖不胜德 3 i
+妖人 105 n
+妖儿 3 n
+妖冶 14 n
+妖刀 3 n
+妖声妖气 3 i
+妖声怪气 3 i
+妖女 3 n
+妖妄 3 n
+妖妇 3 n
+妖姬 3 n
+妖姿 3 n
+妖娆 46 a
+妖娆地 3 z
+妖婆 11 n
+妖媚 24 a
+妖孽 48 n
+妖异 3 n
+妖形怪状 3 i
+妖怪 352 n
+妖星 3 n
+妖术 63 n
+妖气 46 n
+妖气冲天 3 i
+妖氛 3 n
+妖法 131 n
+妖物 19 n
+妖狐 10 nz
+妖猴 34 n
+妖生惯养 3 n
+妖由人兴 3 n
+妖精 701 n
+妖艳 43 a
+妖草 3 n
+妖言 20 n
+妖言惑众 17 i
+妖道 175 n
+妖邪 3 n
+妖里妖气 7 n
+妖雾 14 n
+妖风 18 n
+妖鬼 3 n
+妖魅 3 n
+妖魔 260 n
+妖魔化 49 i
+妖魔当道 3 i
+妖魔鬼怪 52 i
+妗 303 g
+妗子 3 nr
+妘 11 zg
+妙 2149 a
+妙不可言 33 i
+妙书 3 n
+妙事 3 n
+妙人妙事 3 i
+妙古绝今 3 i
+妙句 7 n
+妙品 6 n
+妙哉 3 nr
+妙境 9 n
+妙处 67 n
+妙处不传 3 i
+妙妙贴 3 nr
+妙峰山 5 nr
+妙师父 2 nr
+妙思 3 nr
+妙悟 5 n
+妙想天开 3 i
+妙手 59 n
+妙手丹青 3 nr
+妙手仁心 3 i
+妙手偶得 3 l
+妙手回春 15 i
+妙手空空 11 i
+妙方 18 n
+妙术 4 n
+妙极 3 n
+妙极了 3 l
+妙棋 3 nr
+妙法 99 n
+妙理 3 n
+妙用 60 n
+妙用无穷 3 i
+妙略 3 n
+妙着 24 n
+妙笔 9 n
+妙笔生花 5 i
+妙答如流 3 i
+妙策 58 n
+妙算 20 n
+妙算神机 3 n
+妙绝 16 ns
+妙绝古今 3 i
+妙绝时人 3 i
+妙舞清歌 3 i
+妙药 25 n
+妙觉 2 n
+妙言 3 n
+妙言妙语 3 i
+妙言要道 3 i
+妙计 224 n
+妙论 6 n
+妙诀 13 n
+妙诣 4 n
+妙语 28 nr
+妙语双关 3 nr
+妙语天下 3 i
+妙语如珠 5 i
+妙语录 3 nr
+妙语惊人 3 i
+妙语解烦 3 i
+妙语解颐 3 l
+妙语连珠 9 nr
+妙趣 16 n
+妙趣横溢 3 i
+妙趣横生 27 i
+妙辞 3 nr
+妙音 2 n
+妙风使 3 nr
+妙香山 7 nr
+妙高台 7 nr
+妙龄 84 nr
+妙龄女 3 nr
+妙龄女子 3 n
+妙龄女郎 3 nr
+妙龄少女 3 nr
+妞 205 zg
+妞儿 145 n
+妞妞 3 n
+妞子 3 n
+妣 6 zg
+妤 104 x
+妥 828 a
+妥为 3 v
+妥为安排 3 n
+妥为照料 3 n
+妥切 3 ad
+妥加 3 v
+妥协 764 v
+妥协性 9 n
+妥否 3 v
+妥善 438 v
+妥善处理 3 v
+妥善处置 3 v
+妥善安置 3 n
+妥善解决 3 v
+妥坝 3 v
+妥坝县 3 ns
+妥妥当当 10 z
+妥妥贴贴 7 z
+妥安 3 a
+妥实 3 ad
+妥帖 53 a
+妥当 430 a
+妥洽 3 v
+妥用 3 v
+妥贴 65 v
+妥靖 3 v
+妥靠 3 a
+妥首帖耳 3 n
+妧 17 zg
+妨 100 zg
+妨主 3 v
+妨事 3 v
+妨功害能 3 v
+妨害 37 v
+妨害交通 3 nz
+妨害自由 3 v
+妨害风化 3 nz
+妨家 3 v
+妨碍 630 v
+妨碍交通 3 nz
+妨阻 3 v
+妩媚 206 a
+妩媚动人 3 i
+妩媚多姿 4 i
+妪 18 g
+妫 237 g
+妬 3 zg
+妭 38 zg
+妮 515 zg
+妮丝 4 nrt
+妮儿 18 n
+妮克 4 nrt
+妮可 9 nrt
+妮塔 7 nrt
+妮娜 3 nrt
+妮子 34 n
+妮弗 5 nrt
+妮斯 2 nrt
+妮维雅 3 nrt
+妯 70 n
+妯娌 48 n
+妱 13 zg
+妲 22 g
+妳 29 zg
+妳们 3 rr
+妳会 3 vn
+妳在 3 z
+妳好吗 3 v
+妳是 3 v
+妳有 3 vn
+妳爱 3 z
+妳自己 3 v
+妴 3 zg
+妶 6 zg
+妸 431 zg
+妹 956 n
+妹儿 216 n
+妹夫 72 n
+妹妹 2149 n
+妹妹低 3 n
+妹妹图 3 n
+妹妹爱好 3 n
+妹妹网 3 n
+妹婿 11 n
+妹子 945 n
+妺 3 zg
+妻 1623 n
+妻儿 140 n
+妻儿老小 22 n
+妻儿老少 3 l
+妻女 69 n
+妻妹 10 n
+妻妾 123 n
+妻子 4532 n
+妻子儿女 3 n
+妻室 126 n
+妻小 34 n
+妻弟 37 n
+妻梅子鹤 3 n
+妻离子散 30 n
+妻管严 2 n
+妻舅 21 n
+妻荣夫贵 3 i
+妻贤夫祸少 2 i
+妽 66 zg
+妾 1023 zg
+姁 10 zg
+姂 5 zg
+姃 8 zg
+姄 41 zg
+姆 1234 x
+姆万扎 5 nrt
+姆博玛 3 nrt
+姆卡帕 5 nrt
+姆妈 46 n
+姆巴 14 nrt
+姆巴巴纳 3 nrt
+姆指 3 n
+姆指山 3 nr
+姆斯基 7 nrt
+姆林宫 3 nrt
+姆特瓦拉 3 nrt
+姆莱 19 nrt
+姆贝基 2 nrt
+姇 61 zg
+姈 16 zg
+姉 117 zg
+姊 4076 n
+姊儿 3 n
+姊夫 236 n
+姊妹 1509 n
+姊妹会 3 n
+姊妹品 3 n
+姊妹市 3 n
+姊妹篇 3 n
+姊妹花 11 n
+姊妹饭 3 n
+姊姊 3 n
+始 4321 d
+始业 3 n
+始业式 3 n
+始乱终弃 12 i
+始于 1109 d
+始于足下 6 i
+始作俑者 52 n
+始兴 16 d
+始兴县 3 ns
+始创 63 v
+始发 70 v
+始发地 5 n
+始发点 2 n
+始发站 9 n
+始发车 3 n
+始基 3 nrt
+始基囊肿 3 n
+始定 3 d
+始建 2355 v
+始得 51 v
+始料 44 n
+始料不及 60 i
+始料所及 3 i
+始料未及 32 i
+始新世 93 nrt
+始末 70 n
+始末原由 3 n
+始末缘由 3 n
+始沸点 3 i
+始点 3 d
+始爆器 3 n
+始皇 3 n
+始皇帝 33 nrt
+始祖 216 nrt
+始祖马 5 n
+始祖鸟 23 n
+始终 5358 d
+始终一贯 3 i
+始终不二 3 i
+始终不变 3 i
+始终不懈 3 i
+始终不易 3 i
+始终不渝 48 i
+始终保持 3 i
+始终如一 43 i
+始终若一 3 i
+始终认为 3 i
+始而 3 d
+始能 3 v
+始自 3 d
+始行 3 v
+始起 2 v
+姌 25 zg
+姎 14 zg
+姏 209 zg
+姐 1301 n
+姐丈 3 n
+姐们 5 n
+姐们儿 6 n
+姐俩 3 n
+姐儿 197 n
+姐儿们 10 n
+姐夫 398 n
+姐妹 842 n
+姐妹俩 29 n
+姐妹篇 5 n
+姐妹花 3 n
+姐姐 2742 n
+姐弟 68 n
+姐弟俩 3 n
+姐弟恋 3 n
+姑 1684 n
+姑丈 46 n
+姑且 231 d
+姑且一试 3 i
+姑佬佬 3 n
+姑公 3 n
+姑塘 2 n
+姑夫 66 n
+姑奶奶 148 n
+姑妄听之 5 i
+姑妄言之 3 i
+姑妈 578 n
+姑姐 3 n
+姑姑 2406 n
+姑姑家 3 n
+姑娘 8853 n
+姑娘家 38 n
+姑婆 46 n
+姑嫂 46 n
+姑嫂俩 3 n
+姑嫂树 8 n
+姑子 82 n
+姑射神人 3 n
+姑息 142 n
+姑息养奸 13 n
+姑息疗法 2 n
+姑息迁就 11 n
+姑母 125 n
+姑洗 6 n
+姑父 110 n
+姑爷 164 n
+姑爹 3 n
+姑置勿论 3 i
+姑老爷 9 n
+姑舅 23 n
+姑舅姐妹 3 n
+姑苏 291 ns
+姑表 19 n
+姑表亲 2 n
+姑表兄弟 3 n
+姒 94 g
+姓 7240 v
+姓付 3 n
+姓别 3 n
+姓名 1924 n
+姓名学 3 n
+姓名权 3 n
+姓名链 3 n
+姓姚 3 n
+姓字 3 n
+姓宋 3 n
+姓常 3 n
+姓张 3 n
+姓戴 3 n
+姓朱 3 n
+姓李 3 n
+姓林 3 n
+姓氏 336 n
+姓氏笔画 3 n
+姓甚名谁 3 nr
+姓范 3 n
+姓薛 3 n
+姓黄 3 n
+姓黎 3 n
+委 1495 zg
+委中 13 n
+委以 72 v
+委以重任 44 l
+委任 239 n
+委任书 3 n
+委任制 5 n
+委任状 16 n
+委任者 3 n
+委任证书 3 n
+委会 18 n
+委内瑞拉 530 ns
+委内瑞拉人 12 n
+委内瑞拉共和国 10 ns
+委内瑞拉政府 3 ns
+委决不下 21 v
+委办 15 v
+委办局 10 n
+委员 9071 n
+委员会 24831 n
+委员会制 33 n
+委员制 3 n
+委员长 5156 n
+委培 11 vn
+委培生 2 n
+委委佗佗 3 nrfg
+委婉 263 a
+委实 233 n
+委实不错 3 i
+委屈 961 v
+委屈求全 3 i
+委弃 3 v
+委托 1977 n
+委托书 312 n
+委托事项 3 n
+委托人 324 n
+委托合同 3 n
+委托收款 3 n
+委托方 2 n
+委托行 3 n
+委托金 3 n
+委推 3 v
+委政府 2 n
+委曲 67 n
+委曲婉转 3 vn
+委曲成全 3 i
+委曲求全 57 i
+委派 505 n
+委派代表 3 n
+委琐 26 a
+委用 3 n
+委系实情 3 n
+委罪 3 n
+委罪于人 3 n
+委聘 3 v
+委肉虎蹊 3 i
+委蛇 4 n
+委身 26 n
+委身事人 3 n
+委身于人 3 i
+委过于人 3 l
+委重投艰 3 i
+委阳 3 ns
+委陵菜 5 n
+委随 3 v
+委靡 11 a
+委靡不振 4 i
+委顿 93 ns
+姖 7 zg
+姗 38 nr
+姗姗 3 i
+姗姗来迟 29 i
+姗拉娜 3 i
+姗笑 3 i
+姘 526 n
+姘夫 3 n
+姘头 44 n
+姘妇 4 n
+姘居 4 n
+姙 53 zg
+姚 476 nr
+姚一个 2 m
+姚一副 2 m
+姚一眼 2 m
+姚世安 2 nr
+姚东照 24 nr
+姚两 3 m
+姚之富 4 nr
+姚乐怡 3 nr
+姚二嘎 3 nr
+姚二郎 5 nr
+姚亮村 2 nr
+姚仁隽 2 nr
+姚从吾 19 nr
+姚令言 3 nr
+姚伟荣 3 nr
+姚伯当 17 nr
+姚伯道 3 nr
+姚侍郎 2 nr
+姚依林 34 nr
+姚先生 3 nr
+姚公渡 3 nr
+姚兴灭 2 nr
+姚兴留 3 nr
+姚兴病 2 nr
+姚兴继 4 nr
+姚几个 2 m
+姚劲波 7 nr
+姚友仲 29 nr
+姚友生 2 nr
+姚向黎 3 nr
+姚启圣 3 nr
+姚国繁 2 nr
+姚培德 3 nr
+姚培谦 2 nr
+姚大伟 6 nr
+姚大力 6 nr
+姚大夫 3 nr
+姚夫人 5 nr
+姚娅媚 3 nr
+姚守拙 2 nr
+姚安 9 nr
+姚安县 2 nr
+姚宏校 3 nr
+姚官屯 4 nr
+姚家 11 nrfg
+姚察曾 2 nr
+姚察者 2 nr
+姚寨主 6 nr
+姚对 4 m
+姚崇出 3 nr
+姚师傅 512 nr
+姚平仲 72 nr
+姚广孝 60 nr
+姚广安 4 nr
+姚康达 3 nr
+姚建华 4 nr
+姚建铨 2 nr
+姚弋仲 10 nr
+姚德升 3 nr
+姚必达 3 nr
+姚思孝 2 nr
+姚思廉 9 nr
+姚恒斌 3 nr
+姚振宗 3 nr
+姚振平 2 nr
+姚敏学 2 nr
+姚文元 112 nr
+姚旺林 2 nr
+姚明 97 nr
+姚明乐 2 nr
+姚明年 3 nr
+姚明强 2 nr
+姚明理 4 nr
+姚春鸽 2 nr
+姚景源 16 nr
+姚期智 257 nr
+姚木兰 3 nr
+姚来泉 256 nr
+姚校尉 2 nr
+姚氏尚 3 nr
+姚氏幽 2 nr
+姚淑月 12 nrfg
+姚清泉 32 nr
+姚湘成 256 nr
+姚滨 23 nr
+姚瀛艇 2 nr
+姚玉洁 2 nr
+姚璇秋 8 nr
+姚畹贞 2 nz
+姚真会 2 nr
+姚硕德 7 nr
+姚祖恩 2 nr
+姚福文 3 nr
+姚秋尔 31 nr
+姚等 2 m
+姚翰林 16 nr
+姚老板 2 nr
+姚苌军 3 nr
+姚苌北 3 nr
+姚苌建 2 nr
+姚苌欲 4 nr
+姚苌死 2 nr
+姚苌病 2 nr
+姚苌破 3 nr
+姚苌至 4 nr
+姚苌营 2 nr
+姚苌载 15 nr
+姚苌遂 3 nr
+姚苌领 3 nr
+姚莹莹 3 nr
+姚蓬子 6 nr
+姚薇元 2 nr
+姚襄军 2 nr
+姚贤镐 6 nr
+姚贵香 2 nr
+姚远方 6 nr
+姚采颖 3 nr
+姚金成 2 nr
+姚锡铭 49 nr
+姚际恒 7 nr
+姚雪垠 10 nr
+姚餐厅 3 s
+姚黄魏品 3 nr
+姚黄魏紫 3 nr
+姛 65 zg
+姜 1053 nr
+姜一守 3 nr
+姜业奎 2 nr
+姜丝 5 nr
+姜丝排 4 nr
+姜丝熬 2 nr
+姜丰年 23 nr
+姜二公 2 nr
+姜亚科 2 nr
+姜亚纲 4 nr
+姜亮夫 3 nr
+姜伯勤 3 nr
+姜伯约 8 nr
+姜伯驹 6 nr
+姜佐禹 2 nr
+姜信真 2 nr
+姜先生 2 nr
+姜克诚 3 nr
+姜冯营村 3 nr
+姜切片 3 nr
+姜占国 19 nr
+姜卫星 2 nr
+姜名维 2 nr
+姜周红 17 nr
+姜味 3 nr
+姜块 3 n
+姜堰 8 nr
+姜堰市 3 ns
+姜声扬 256 nr
+姜大人 3 nr
+姜大伟 3 nr
+姜大卫 3 nr
+姜大明 2 nr
+姜太公 104 nr
+姜太公钓鱼 4 i
+姜女庙 18 nr
+姜妙香 5 nr
+姜姓族 4 nr
+姜姓有 2 nr
+姜威道 2 nr
+姜子牙 27 nr
+姜宁拉 2 nr
+姜宏波 3 nr
+姜小姐 2 nr
+姜小铁 5 nr
+姜尼拉 2 nr
+姜居之 12 nr
+姜师叔 2 nr
+姜师度 7 nr
+姜师立 2 nr
+姜希源 2 nr
+姜帝圭 3 nr
+姜庆植 3 nr
+姜应麟 8 nr
+姜廉夫 11 nr
+姜建慧 3 nr
+姜异康 2 nr
+姜志焕 3 nr
+姜总爷 2 nr
+姜恩宇 2 nr
+姜恩柱 267 nr
+姜政委 17 nr
+姜文 8 nr
+姜文起 2 nr
+姜日广 31 nr
+姜春云 59 nr
+姜春艳 2 nr
+姜曙光 9 nr
+姜末 2 nr
+姜根迪 3 nr
+姜桂之 2 nr
+姜桂之性 3 nr
+姜桂茶 2 nr
+姜椿芳 9 nr
+姜正贵 6 nr
+姜汁 12 nr
+姜汝祥 3 nr
+姜汤 17 nr
+姜泓冰 2 nr
+姜泰吉 2 nr
+姜渭渔 7 i
+姜片 8 n
+姜片虫 10 nr
+姜玉清 2 nr
+姜玉环 2 nr
+姜玉贞 6 nr
+姜白石 2 nr
+姜立夫 9 nr
+姜笑琴 2 nr
+姜粉 3 nr
+姜糖 3 nr
+姜糖水 4 nr
+姜素荣 29 nr
+姜索荣 4 nr
+姜绍书 2 nr
+姜维之 5 nr
+姜维令 4 nr
+姜维入 3 nr
+姜维全 2 nr
+姜维兵 6 nr
+姜维引 15 nr
+姜维归 2 nr
+姜维必 2 nr
+姜维恐 2 nr
+姜维累 2 nr
+姜维至 2 nr
+姜维问 2 nr
+姜维闻 2 nr
+姜维领 5 nr
+姜维驱 2 nr
+姜翠华 10 nr
+姜老者 12 nr
+姜育恒 3 nr
+姜舜源 2 nr
+姜芋 3 n
+姜花族 2 nr
+姜蒜 3 n
+姜虎真 2 nr
+姜诸公 4 nr
+姜辛汤 3 nr
+姜辣素 4 nr
+姜运涛 4 nr
+姜铁山 34 nr
+姜雪丽 2 nr
+姜雪梅 2 nr
+姜饼 3 nr
+姜馨田 8 nr
+姜鸿波 3 nr
+姜鹏翔 11 nr
+姜黄 11 nr
+姜黎黎 3 nr
+姝 983 g
+姞 131 zg
+姟 94 zg
+姠 13 zg
+姡 11 zg
+姢 46 zg
+姣 389 z
+姣丽 3 z
+姣好 27 z
+姣妻 2 n
+姣娘 3 n
+姣美 2 z
+姤 138 zg
+姥 735 n
+姥姥 240 n
+姥姥家 3 ns
+姥娘 2 n
+姥植比 3 n
+姥爷 50 n
+姦 48 zg
+姨 343 n
+姨丈 6 n
+姨儿 3 n
+姨兄弟 3 n
+姨太 3 n
+姨太太 352 n
+姨夫 23 n
+姨奶奶 49 n
+姨妈 227 n
+姨妈家 3 n
+姨妹 2 n
+姨姊妹 3 n
+姨姐 3 n
+姨姥姥 3 nrfg
+姨娘 129 n
+姨婆 4 n
+姨母 25 n
+姨父 32 n
+姨疾 3 n
+姨表 12 n
+姩 322 zg
+姪 30 zg
+姫 6 zg
+姬 380 zg
+姬于织 2 nr
+姬云程 8 nr
+姬大哥 2 nr
+姬姓和 2 nr
+姬姓国 2 nr
+姬宗周 2 nr
+姬师伯 2 nr
+姬师兄 6 nr
+姬师弟 2 nr
+姬归汉 8 nr
+姬彦锋 3 nr
+姬慕容 2 nr
+姬手制 2 nr
+姬晓峰 60 nr
+姬晨牧 3 nr
+姬海涛 55 nr
+姬清玄 3 nr
+姬清虚 54 nr
+姬老三 9 nr
+姬蛙科 2 nr
+姬蜂科 2 nr
+姬道人 2 nr
+姬重耳 4 nr
+姬针神 2 nr
+姬鹏飞 23 nr
+姬麒麟 3 nr
+姬鼠 3 nr
+姭 8 zg
+姮 58 zg
+姯 2 zg
+姱 43 zg
+姱容修态 3 v
+姳 115 zg
+姴 40 zg
+姵 31 zg
+姷 14 zg
+姸 25 zg
+姹 810 i
+姹紫嫣红 27 i
+姹紫焉红 3 i
+姺 2 zg
+姻 108 n
+姻亲 99 n
+姻伯 3 n
+姻兄 3 n
+姻家 3 n
+姻家田 3 n
+姻弟 3 n
+姻戚 3 n
+姻缘 133 n
+姽 29 zg
+姿 313 n
+姿势 692 n
+姿容 36 n
+姿容秀美 3 n
+姿式 168 n
+姿影 3 n
+姿态 995 n
+姿态万千 3 n
+姿态控制 43 n
+姿意妄为 3 vn
+姿色 99 n
+姿貌 3 n
+姿质 3 n
+娀 4 zg
+威 1913 ns
+威严 635 a
+威严地 3 nz
+威仪 72 nz
+威仪凛然 3 i
+威信 521 nz
+威信县 3 nr
+威信扫地 6 i
+威克 10 nrt
+威克岛 7 nrt
+威克瑞 3 nrt
+威凤一羽 3 nr
+威凤祥麟 3 nr
+威刑肃物 3 n
+威利 33 nrt
+威利斯 8 nrt
+威利维岛 3 ns
+威力 1336 n
+威力侦察 3 n
+威势 170 n
+威化 2 vn
+威协 3 v
+威压 3 n
+威县 9 ns
+威名 334 a
+威名显赫 3 nr
+威名远播 3 l
+威吓 84 vn
+威吓性 3 n
+威士忌 59 nr
+威士忌酒 12 n
+威士顿河 3 ns
+威声 3 n
+威奇 2 nrt
+威奇托 5 nrt
+威孚 3 nz
+威宁 27 nrt
+威宁县 6 ns
+威宁彝族回族苗族自治县 11 ns
+威尊命贱 3 i
+威尔 52 nrt
+威尔克斯 9 nrt
+威尔基 3 nrt
+威尔士 154 ns
+威尔士语 4 nz
+威尔斯 42 nrt
+威尔森 3 nrt
+威尔特 7 nrt
+威尔科 3 nrt
+威尔第 13 nrt
+威尔逊 187 nrt
+威尔逊山 8 nrt
+威尔金森 13 nrt
+威尔鹰 3 nr
+威尼 2 nrt
+威尼托 2 nrt
+威尼斯 406 nrt
+威尼斯人 31 nrt
+威廉 319 nrt
+威廉姆斯 78 nrt
+威廉斯 41 nrt
+威廉森 2 nrt
+威廉母斯 3 nr
+威廉法尔 3 nrt
+威廉港 8 ns
+威德 57 nrt
+威恩 2 nrt
+威悉河 12 ns
+威慑 324 vn
+威慑力 49 n
+威慑力量 3 n
+威慑性 2 n
+威慑理论 3 n
+威拉 2 nrt
+威拉蓬 2 ns
+威振天下 3 i
+威摄 3 v
+威摄力 3 n
+威斯 22 nrt
+威斯利 3 nrt
+威斯勒 2 nrt
+威斯巴登 3 nrt
+威斯康星 14 nz
+威斯康星大学 25 nt
+威斯康星州 19 ns
+威斯康辛 5 nrt
+威斯敏 3 nr
+威斯敏斯特 43 ns
+威斯汀 32 nrt
+威斯特 8 nrt
+威斯特摩兰 2 nrt
+威斯特法伦 26 nrt
+威望 391 v
+威望值 3 n
+威望素著 3 nr
+威望迪集团 2 nt
+威权 82 n
+威武 411 nrt
+威武不屈 7 i
+威武之师 5 nr
+威武雄壮 3 i
+威洛 6 nrt
+威海 143 ns
+威海人 2 nrt
+威海卫 117 ns
+威海市 22 ns
+威海港 8 ns
+威海路 3 ns
+威灵 3 n
+威灵仙 13 nr
+威灵顿 3 ns
+威煌 3 ns
+威特 21 nrt
+威猛 197 a
+威登 2 nrt
+威盛 14 nz
+威福 3 nrt
+威科 3 nrt
+威绿达 2 ns
+威耳生雾 3 i
+威胁 3909 vn
+威胁利诱 6 i
+威胁性 24 n
+威胁监控 3 n
+威胁论 191 n
+威舍 4 nrt
+威舍镇 2 nrt
+威茨 34 nrt
+威虎 3 nz
+威虎山 16 ns
+威行 3 vn
+威赫 2 nrt
+威达 4 nrt
+威达电 3 nz
+威远 75 nrt
+威远县 3 ns
+威迪 3 nz
+威迫 11 vn
+威逼 125 v
+威逼利诱 3 i
+威重令行 3 n
+威金 2 n
+威震 151 n
+威震八方 3 i
+威震天下 49 i
+威露士 3 ns
+威风 627 n
+威风八面 25 i
+威风凛冽 3 nr
+威风凛凛 403 i
+威风扫地 7 i
+威风祥麟 3 nr
+威龙 3 nrt
+娂 5 zg
+娃 1783 ng
+娃儿 196 n
+娃哈哈 5 nz
+娃娃 1114 n
+娃娃亲 2 n
+娃娃兵 3 n
+娃娃生 8 n
+娃娃脸 27 n
+娃娃装 3 n
+娃娃车 3 n
+娃娃鞋 3 n
+娃娃鱼 286 n
+娃子 159 n
+娄 118 nr
+娄丞相 9 nr
+娄侯终 3 nr
+娄勤俭 3 nr
+娄子 21 nr
+娄室之 2 nr
+娄宿 2 nr
+娄山 2 ns
+娄山关 21 ns
+娄巴特 3 nr
+娄底 51 nr
+娄底市 12 ns
+娄底市委 5 n
+娄建源 4 nr
+娄敏中 8 nr
+娄星区 3 nr
+娄树华 2 nr
+娄江 10 ns
+娄烦 3 nr
+娄烦县 3 nr
+娄益庆 6 nr
+娄金狗 6 nr
+娅 68 x
+娆 393 x
+娇 652 a
+娇丽 3 a
+娇体 3 a
+娇健 3 a
+娇儿 7 n
+娇养 3 v
+娇喘 3 n
+娇嗔 49 v
+娇声 3 n
+娇声娇气 4 i
+娇声道 5 i
+娇女 9 n
+娇好 3 a
+娇妻 28 n
+娇娃 11 n
+娇娆 4 a
+娇娇 3 v
+娇娇女 2 i
+娇娇嫩嫩 3 z
+娇娘 2 n
+娇娜 2 z
+娇媚 96 a
+娇媚动人 3 i
+娇嫩 156 a
+娇嫩嫩 3 z
+娇嫩欲滴 3 n
+娇子 6 n
+娇宠 12 a
+娇客 14 n
+娇小 64 a
+娇小玲珑 12 i
+娇弱 54 a
+娇态 3 n
+娇惯 23 n
+娇憨 23 a
+娇揉造作 3 i
+娇柔 64 a
+娇气 32 a
+娇滴 3 z
+娇滴滴 88 z
+娇生惯养 50 v
+娇痴 7 z
+娇皮嫩肉 3 n
+娇红 14 z
+娇纵 17 v
+娇美 63 a
+娇羞 80 a
+娇艳 141 a
+娇艳动人 3 i
+娇艳欲滴 14 i
+娇贵 27 a
+娇躯 3 n
+娇里娇气 3 i
+娇韵诗 3 n
+娇鸾雏凤 3 nz
+娈 133 zg
+娈生儿 3 n
+娈童 32 n
+娈童案 3 n
+娉 664 zg
+娉娉婷婷 15 z
+娉婷 11 z
+娉婷婀娜 3 z
+娉婷袅娜 3 z
+娊 24 zg
+娌 951 x
+娌帜桓 3 nr
+娍 99 zg
+娑 813 ns
+娑婆 2 n
+娑罗双树 2 ns
+娑罗子 3 ns
+娑罗树 3 ns
+娓 246 l
+娓娓 33 d
+娓娓不倦 3 i
+娓娓动听 15 i
+娓娓而谈 6 i
+娓娓道来 20 l
+娖 3 zg
+娘 3971 n
+娘亲 9 n
+娘俩 23 n
+娘儿 199 n
+娘儿们 92 n
+娘儿俩 3 n
+娘姨 27 n
+娘娘 972 n
+娘娘庙 25 n
+娘娘腔 10 n
+娘子 1126 n
+娘子军 80 n
+娘家 505 n
+娘家人 25 n
+娘病 3 n
+娘老子 3 n
+娘胎 53 n
+娘舅 137 n
+娘酒 3 n
+娙 2 zg
+娜 1054 x
+娜丽莎 3 nrt
+娜塔 5 nrt
+娜塔丽 3 nrt
+娜塔莉 3 nrt
+娜塔莎 3 nrt
+娜娜 16 nrt
+娜拉 71 nrt
+娜斯 5 nrt
+娜达莎 3 nrt
+娟 1162 zg
+娟好 2 a
+娟好静秀 3 z
+娟子 2 a
+娟秀 36 a
+娠 22 g
+娡 173 zg
+娣 228 g
+娥 1643 n
+娥眉 5 n
+娥眉月 7 n
+娩 53 vg
+娩出 3 n
+娭 2 zg
+娮涎珊 3 i
+娮湘毯 3 nz
+娱 95 vn
+娱乐 1664 vn
+娱乐业 26 n
+娱乐中心 3 n
+娱乐先锋 3 n
+娱乐区 10 n
+娱乐厅 4 n
+娱乐吧 3 n
+娱乐品 3 n
+娱乐圈 27 n
+娱乐场 16 n
+娱乐场所 3 n
+娱乐型 8 n
+娱乐城 100 n
+娱乐室 4 n
+娱乐性 48 n
+娱乐活动 3 n
+娱乐片 2 n
+娱乐版 3 n
+娱乐界 6 n
+娱乐社区 3 n
+娱乐站 3 n
+娱乐网 3 n
+娱乐节目 3 n
+娱妻弄子 3 v
+娱宾 3 n
+娱心悦目 3 n
+娱志 3 n
+娱悦 3 n
+娱情 3 n
+娲 489 x
+娴 564 zg
+娴于辞令 3 nr
+娴淑 5 a
+娴熟 412 a
+娴雅 25 a
+娴静 54 a
+娶 2162 v
+娶亲 91 v
+娶妻 131 v
+娶妻生子 3 v
+娶媳妇 3 nr
+娼 136 n
+娼妇 20 n
+娼妓 113 n
+娼妓馆 3 vn
+娼盛 3 n
+娽 2 zg
+娾 21 zg
+娿 122 zg
+婀 109 i
+婀娜 74 a
+婀娜多姿 31 i
+婁 332 zg
+婂 564 zg
+婃 414 zg
+婄 267 zg
+婅 235 zg
+婆 715 n
+婆妈 3 n
+婆姨 45 n
+婆娑 77 z
+婆娑罗 3 l
+婆娑起舞 2 l
+婆娘 355 n
+婆婆 2295 n
+婆婆嘴 3 n
+婆婆妈妈 88 n
+婆媳 67 n
+婆媳关系 3 n
+婆子 347 n
+婆家 133 n
+婆心 3 n
+婆母 55 n
+婆罗 71 nrt
+婆罗洲 47 ns
+婆罗浮屠 10 nz
+婆罗门 139 ns
+婆罗门参 3 n
+婆罗门教 59 nz
+婆说婆有理 12 i
+婇 146 zg
+婉 193 a
+婉丽 11 a
+婉和 3 a
+婉商 3 v
+婉惜 3 a
+婉拒 35 v
+婉然 3 d
+婉约 58 d
+婉约派 3 l
+婉言 45 v
+婉言拒绝 3 l
+婉言相劝 3 l
+婉言谢绝 44 l
+婉词 2 d
+婉谢 3 v
+婉转 238 v
+婉转动听 3 n
+婉辞 4 v
+婉顺 3 a
+婊 255 n
+婊子 408 n
+婌 2 zg
+婍 4 zg
+婏 355 zg
+婒 2 zg
+婕 127 x
+婕妤 4 n
+婚 2941 n
+婚丧喜庆 3 n
+婚丧嫁娶 34 l
+婚书 11 n
+婚事 376 n
+婚事新办 3 n
+婚介 13 n
+婚介业 3 n
+婚介所 12 j
+婚介网 3 n
+婚俗 69 n
+婚假 8 n
+婚典 6 n
+婚内 3 t
+婚前 138 t
+婚前婚后 3 n
+婚前生子 3 n
+婚变 13 n
+婚史 9 n
+婚后 291 t
+婚否 3 v
+婚外 32 j
+婚外性 3 n
+婚外恋 40 n
+婚外情 60 n
+婚姻 2714 n
+婚姻关系 3 n
+婚姻制度 3 n
+婚姻大事 3 n
+婚姻家庭 3 n
+婚姻恋爱 3 n
+婚姻法 88 n
+婚姻状况 3 n
+婚姻生活 3 n
+婚姻登记 3 n
+婚姻自主 3 n
+婚姻自由 3 n
+婚姻观 4 n
+婚娶 37 n
+婚媾 3 v
+婚嫁 89 n
+婚嫁网 3 n
+婚宴 62 n
+婚帖 3 n
+婚庆 25 t
+婚庆网 3 nz
+婚恋 29 n
+婚恋观 3 n
+婚戒 3 n
+婚托 3 n
+婚托儿 3 n
+婚期 40 t
+婚期定 3 l
+婚检 63 j
+婚检率 3 n
+婚照 2 n
+婚生子 7 n
+婚生子女 3 n
+婚礼 890 n
+婚礼庆典 3 n
+婚礼服 16 n
+婚筵 3 n
+婚约 65 n
+婚纱 82 n
+婚纱店 3 n
+婚纱影楼 3 n
+婚纱照 7 n
+婚纱秀 3 n
+婚纱网 3 n
+婚育 522 vn
+婚资 3 vn
+婚配 176 vn
+婚龄 24 n
+婠婠 3 z
+婢 520 n
+婢仆 3 n
+婢作夫人 3 n
+婢女 110 n
+婢子 3 n
+婢膝奴颜 3 ns
+婧 78 g
+婪 23 x
+婰 2 zg
+婲 509 zg
+婳 16 zg
+婴 523 n
+婴儿 1604 n
+婴儿床 2 n
+婴儿期 26 n
+婴儿油 3 n
+婴儿用品 3 n
+婴儿车 10 n
+婴儿鞋 3 n
+婴孩 103 n
+婴幼 3 n
+婴幼儿 147 n
+婴粟子 3 n
+婵 95 n
+婵娟 15 n
+婶 1428 n
+婶娘 74 n
+婶婆 3 n
+婶婶 125 n
+婶子 340 n
+婶母 18 n
+婷 132 x
+婷婷 3 z
+婷婷玉立 3 nr
+婷美 3 z
+婺 53 ns
+婺剧 7 n
+婺城区 3 ns
+婺州 49 ns
+婺源 71 ns
+婺源县 12 ns
+婺绿 5 n
+婻 2 zg
+婼 27 zg
+婽 66 zg
+婿 187 ng
+媁 10 zg
+媉 4 zg
+媋 7 zg
+媒 515 n
+媒人 122 n
+媒人婆 3 n
+媒介 608 n
+媒介体 3 n
+媒介物 3 n
+媒体 6101 n
+媒体代理 3 n
+媒体化 3 n
+媒体工具 3 n
+媒体广告 3 n
+媒体库 3 n
+媒体报道 3 n
+媒体播放器 5 n
+媒体文件 3 n
+媒体格式 3 n
+媒体演示 3 n
+媒合 3 n
+媒妁 27 n
+媒妁之言 3 v
+媒婆 21 n
+媒染剂 10 n
+媒质 65 n
+媖 14 zg
+媚 267 zg
+媚世 3 n
+媚人 3 n
+媚俗 27 n
+媚外 265 a
+媚妹 3 n
+媚态 25 n
+媚悦流俗 3 n
+媚惑 3 a
+媚气 3 n
+媚眸 3 n
+媚眼 45 n
+媚眼儿 2 n
+媚笑 24 a
+媚颜 3 n
+媚骨 3 n
+媛 112 zg
+媜 2 zg
+媠 9 zg
+媦 2 zg
+媪 38 g
+媭 2 zg
+媯 11 zg
+媰 14 zg
+媱 6 zg
+媲 21 v
+媲美 228 v
+媳 134 n
+媳妇 1871 n
+媳妇儿 150 n
+媴 67 zg
+媵 7 g
+媶 2 zg
+媷 39 zg
+媸 73 g
+媹 6 zg
+媺 61 zg
+媼 4 zg
+媽 2 zg
+媾 45 v
+媾合 3 v
+媾和 115 v
+媾和案 3 vn
+媿 34 zg
+嫀 11 zg
+嫁 2308 v
+嫁不出去 3 i
+嫁个老公 3 n
+嫁了人 3 i
+嫁于 3 v
+嫁人 172 n
+嫁作 3 v
+嫁作人妇 3 n
+嫁入 3 v
+嫁出 3 v
+嫁出去 3 i
+嫁出来 3 i
+嫁到 3 v
+嫁奁 3 n
+嫁女 3 n
+嫁妆 135 v
+嫁妆费 3 n
+嫁娶 39 v
+嫁接 149 v
+嫁接杂种 3 i
+嫁接法 3 i
+嫁接苗 4 n
+嫁犬逐犬 3 i
+嫁狗逐狗 3 i
+嫁狗随狗 20 i
+嫁祸 40 n
+嫁祸于 3 n
+嫁祸于人 12 i
+嫁纱 3 n
+嫁给 3 v
+嫁衣 26 n
+嫁衣裳 10 n
+嫁走 3 v
+嫁过去 3 i
+嫁过来 3 i
+嫁错 3 v
+嫁鸡逐鸡 3 i
+嫁鸡随鸡 25 i
+嫂 806 n
+嫂夫人 20 n
+嫂嫂 236 n
+嫂子 953 n
+嫂溺叔援 3 nrfg
+嫃 17 zg
+嫄 21 zg
+嫅 3 zg
+嫆 22 zg
+嫈 22 zg
+嫉 234 v
+嫉世愤俗 3 i
+嫉妒 382 v
+嫉妒妄想 3 i
+嫉妒心 3 i
+嫉妒者 3 i
+嫉恨 70 v
+嫉恶 3 v
+嫉恶如仇 51 i
+嫉恶若仇 3 i
+嫉视 3 v
+嫉贤傲士 3 i
+嫉贤妒能 8 i
+嫉闲妒能 3 i
+嫋 15 zg
+嫋娜 3 z
+嫋嫋 3 z
+嫌 1710 v
+嫌人 3 n
+嫌人家 3 n
+嫌厌 3 v
+嫌多 3 v
+嫌好道恶 3 i
+嫌好道歉 3 v
+嫌好道歹 3 i
+嫌小 3 n
+嫌少 3 v
+嫌弃 133 v
+嫌忌 3 n
+嫌怨 5 n
+嫌恨 3 n
+嫌恶 34 n
+嫌慢 3 n
+嫌憎 3 n
+嫌犯 21 n
+嫌疑 340 v
+嫌疑人 178 n
+嫌疑犯 46 n
+嫌疑者 3 n
+嫌累 3 v
+嫌贫爱富 10 i
+嫌贵 3 n
+嫌长道短 3 n
+嫌隙 106 n
+嫍 144 zg
+嫎 7 zg
+嫏 5 zg
+嫑 32 zg
+嫒 28 x
+嫓 14 zg
+嫔 130 g
+嫔从 3 n
+嫔妃 523 n
+嫖 163 v
+嫖妓 22 n
+嫖娼 74 v
+嫖娼案 3 n
+嫖娼者 2 n
+嫖客 66 n
+嫖宿 3 v
+嫖赌 3 v
+嫗 3 zg
+嫘 25 g
+嫘祖 264 n
+嫙 13 zg
+嫚 34 zg
+嫛 5 zg
+嫜 11 g
+嫝 9 zg
+嫞 3 zg
+嫟 22 zg
+嫠 38 g
+嫠不恤纬 3 n
+嫡 266 zg
+嫡亲 54 n
+嫡传 62 b
+嫡出 3 v
+嫡嗣 5 n
+嫡堂 26 n
+嫡子 3 n
+嫡孙 10 n
+嫡母 3 n
+嫡派 21 n
+嫡系 101 n
+嫡长子 37 n
+嫢 95 zg
+嫣 958 b
+嫣然 38 b
+嫣然一笑 162 i
+嫣然而笑 3 i
+嫣红 35 b
+嫣红姹紫 3 ns
+嫤 66 zg
+嫥 8 zg
+嫦 41 n
+嫦娥 213 n
+嫦娥奔月 15 l
+嫧 7 zg
+嫨 42 zg
+嫩 2055 a
+嫩叶 64 n
+嫩城 3 ns
+嫩女 3 n
+嫩嫩 3 ns
+嫩嫩的 13 z
+嫩枝 42 n
+嫩江 126 ns
+嫩江县 5 ns
+嫩江省 3 ns
+嫩生生 4 n
+嫩白 14 z
+嫩皮 3 n
+嫩稚 3 n
+嫩竹 4 ns
+嫩红 3 b
+嫩绿 52 b
+嫩绿色 3 n
+嫩肉 3 n
+嫩肤 4 n
+嫩芽 59 n
+嫩苗 3 n
+嫩茎 3 n
+嫩草 12 n
+嫩葫芦 3 n
+嫩豆腐 4 n
+嫩鲜鲜 3 ns
+嫩黄 37 b
+嫩黄瓜 3 ns
+嫩黄色 6 n
+嫪 33 zg
+嫪毐 3 z
+嫫 28 g
+嫭 91 zg
+嫮 4 zg
+嫰 2 zg
+嫱 28 g
+嫳 268 zg
+嫵 20 zg
+嫸 2 zg
+嫼 2 zg
+嫾 29 zg
+嫿 10 zg
+嬀 29 zg
+嬁 46 zg
+嬉 138 zg
+嬉戏 125 v
+嬉水 2 v
+嬉游 3 v
+嬉游曲 3 l
+嬉痞 3 n
+嬉皮 3 v
+嬉皮士 5 l
+嬉皮笑脸 69 l
+嬉笑 87 v
+嬉笑怒骂 17 i
+嬉耍 3 v
+嬉闹 20 v
+嬋 2 zg
+嬎 4 zg
+嬖 148 g
+嬗 51 v
+嬗变 39 v
+嬚 4 zg
+嬛 12 zg
+嬝 9 zg
+嬠 2 zg
+嬢 2 zg
+嬤 2 zg
+嬧 10 zg
+嬨 143 zg
+嬩 662 zg
+嬪 1019 zg
+嬫 778 zg
+嬬 352 zg
+嬭 302 zg
+嬮 334 zg
+嬲 46 g
+嬴 64 nr
+嬴奸买俏 3 nr
+嬴政 13 nr
+嬶 466 zg
+嬷 60 n
+嬷嬷 123 n
+嬾 4 zg
+孀 94 v
+孀妇 7 n
+孀妻弱子 3 n
+孀居 9 v
+孃 2 zg
+孆 2 zg
+孈 6 zg
+孊 2 zg
+孎 30 zg
+子 19089 ng
+子一闪 2 nr
+子不当 2 l
+子不语怪 3 i
+子与圣 2 nr
+子丑寅卯 17 l
+子丕平 2 nr
+子世著 2 nr
+子丘真人 4 nr
+子丘道 5 nr
+子丫头 4 nr
+子中微 2 nr
+子中惟 2 nr
+子串 31 n
+子为帝 5 nr
+子为父隐 3 nr
+子义真 4 nr
+子之仇 4 nr
+子之孝 2 nr
+子之心 2 nr
+子之恩 3 nr
+子之父 3 nr
+子书 14 n
+子亚科 3 nr
+子亦可 3 nr
+子产 3 n
+子京 3 ns
+子从德 2 nr
+子从荣 2 nr
+子代 97 n
+子代数 3 n
+子代病毒 3 n
+子代细胞 3 n
+子仲康 3 nr
+子伍尚 2 nr
+子会 2 n
+子传孙 3 nr
+子伯服 4 nr
+子伯益 2 nr
+子伯禽 2 nr
+子伯萨 16 nr
+子体 7 n
+子体核素 3 n
+子侄 96 n
+子儿 42 nr
+子公司 592 n
+子公子 2 nr
+子关 3 n
+子关平 2 nr
+子兴笑 2 nr
+子其子 2 nr
+子函数 3 n
+子列成 2 nr
+子刘曜 2 nr
+子刘毓 2 nr
+子刘琮 2 nr
+子刘聪 3 nr
+子刘胤 3 nr
+子刘贤 2 nr
+子力 12 n
+子化 2 n
+子区 3 n
+子午 53 t
+子午仪 20 nr
+子午卯酉 8 l
+子午圈 15 nr
+子午岭 4 nr
+子午流 11 nr
+子午环 2 nr
+子午线 56 nr
+子午莲 3 nr
+子午谷 11 nr
+子午面 2 n
+子卷 2 n
+子双掌 2 nr
+子口 1184 n
+子句 5 n
+子台 3 n
+子史 3 n
+子叶 304 nr
+子司业 2 n
+子司马师 2 nr
+子司马炎 2 nr
+子合赞 5 nr
+子名益 2 nr
+子名震 2 nr
+子启继 3 nr
+子和皇 2 nr
+子哈哈 2 nr
+子善骑 2 nr
+子嗣 178 nr
+子嗣数 16 nr
+子嘉贞 2 nr
+子囊 82 n
+子囊壳 3 n
+子囊孢子 3 n
+子囊菌类 3 n
+子团圆 2 nr
+子围 2 n
+子城 2 nr
+子域 2 n
+子堤 9 n
+子塔赫 2 nr
+子复古 3 nr
+子夏悬鹑 3 nr
+子夜 75 n
+子大汗 2 nr
+子太太 2 nr
+子太监 3 nr
+子夺剑 2 nr
+子女 1845 n
+子女子孙 3 nr
+子女教育 3 l
+子女玉帛 3 nr
+子奶奶 2 nr
+子妇 3 n
+子姚兴 2 nr
+子娘娘 3 nr
+子婿 3 n
+子子 3 n
+子子婴 3 nr
+子子孙孙 29 nr
+子存善 2 nr
+子孙 1047 nr
+子孙万代 11 nr
+子孙后代 91 nr
+子孙满堂 3 nr
+子孙饭 3 nr
+子孝父慈 3 nr
+子孟昶 5 nr
+子季历 6 nr
+子宇文 9 nr
+子宗训 3 nr
+子官 2 n
+子官儿 2 nr
+子宜叔 5 nr
+子实 32 n
+子宫 795 nr
+子宫出血 3 n
+子宫套 3 nr
+子宫学 3 nr
+子宫帽 3 n
+子宫炎 3 nr
+子宫病 3 nr
+子宫癌 7 n
+子宫腔 3 n
+子宫颈 54 n
+子宫颈癌 3 n
+子害 2 n
+子密诏 2 nr
+子察合 2 nr
+子寻爷 6 nr
+子小皇帝 6 nr
+子尚 3 n
+子山波 4 nr
+子山谷 3 nr
+子岩生 2 nr
+子岳云 6 nr
+子希声 2 nr
+子常洛 3 nr
+子常洵 3 nr
+子常浩 3 nr
+子幽王 3 nr
+子广德 2 nr
+子库库 2 nr
+子康叔 3 nr
+子康王 4 nr
+子延昭 2 nr
+子式 3 n
+子弘略 2 nr
+子弘范 2 nr
+子弟 959 n
+子弟书 25 nr
+子弟兵 360 nr
+子弟学校 3 n
+子弦 3 nr
+子弹 1125 n
+子弹型 3 n
+子弹壳 7 n
+子弹头 3 n
+子弹箱 4 n
+子徐信 3 nr
+子德明 2 nr
+子心知 2 nr
+子忽尔 2 nr
+子恭道 2 nr
+子息 3 n
+子息嗣 2 nr
+子恺译 2 nr
+子惠文 4 nr
+子惠王 4 nr
+子慈恩 2 nr
+子成王 3 nr
+子房 294 n
+子房壁 3 nr
+子承父业 5 n
+子承钧 2 nr
+子拖雷 13 nr
+子拳 8 n
+子掌力 3 nr
+子掌风 2 nr
+子摇摇 3 nr
+子攀山 4 nr
+子攻城 4 nr
+子政 12 n
+子敬乃 3 nr
+子敬休 3 nr
+子敬岂 2 nr
+子文士 2 nr
+子文库 3 nr
+子文鸯 2 nr
+子斐迪 3 nr
+子方 8 n
+子方兄 4 nr
+子无礼 2 nr
+子旭烈 4 nr
+子昂然 2 nr
+子明保 4 nr
+子明诏 3 nr
+子昭王 2 nr
+子晚子 2 nr
+子曰诗云 3 nr
+子曲 2 n
+子曹丕 2 nr
+子服 6 n
+子朝廷 6 nr
+子朝栋 4 nr
+子术赤 2 nr
+子杆棒 2 nr
+子李光 2 nr
+子李势 2 nr
+子李存 2 nr
+子李寿 2 nr
+子李德 2 nr
+子李期 2 nr
+子李歆 3 nr
+子李班 2 nr
+子李纯 2 nr
+子杨玄 3 nr
+子杰叔 3 nr
+子杼立 3 nr
+子松林 5 nr
+子板 4 n
+子果 2 n
+子枪 3 n
+子标题 3 n
+子校注 2 nr
+子样 3 n
+子样本 3 l
+子核 10 n
+子格 3 n
+子棉 2 n
+子模 9 n
+子模兵 2 nr
+子模军 5 nr
+子模国 2 nr
+子模式 3 nr
+子模新 2 nr
+子模旧 2 nr
+子模样 2 l
+子模沙 4 nr
+子模语 2 nr
+子欲养 2 nr
+子正蒙 4 nr
+子步 3 n
+子武公 2 nr
+子武庚 4 nr
+子武王 2 nr
+子母弹 50 n
+子母扣 3 nr
+子母扣儿 3 nr
+子母机 2 n
+子母船 3 nr
+子母釦 3 nz
+子母钟 3 nr
+子毕公 2 nr
+子民 60 n
+子池队列 3 n
+子汤浇 2 nr
+子汪春 2 nr
+子波整形 3 n
+子洲 3 ns
+子洲县 3 ns
+子游 3 n
+子满奴 2 nr
+子澄澈 2 nr
+子点点 5 n
+子燕帖 2 nr
+子爵 50 nr
+子爵夫人 3 nr
+子牙新河 9 ns
+子牙河 36 ns
+子独承 2 nr
+子猫儿 2 nr
+子献公 2 nr
+子王嫱 2 nr
+子王岩 2 nr
+子王济 2 nr
+子玩 2 n
+子玺书 2 nr
+子理 7 n
+子理兄 11 n
+子璋亦 2 nr
+子田常 2 nr
+子畜 3 n
+子痫 16 n
+子皇帝 56 nr
+子监典 2 nr
+子目 16 n
+子目录 11 nr
+子目标 4 nr
+子相承 16 nr
+子相斗 4 nr
+子相立 3 nr
+子相肖 16 nr
+子祖庚 3 nr
+子神 3 n
+子祠泉 2 nr
+子禄父 6 nr
+子福临 5 nr
+子福晋 3 nr
+子禹阳 2 nr
+子离子 3 n
+子程序 12 n
+子穆王 2 nr
+子窦林 2 nr
+子童阁 256 nr
+子端 2 n
+子笑笑 4 nr
+子管家 2 n
+子类 5 n
+子粒 153 n
+子系统 120 n
+子素 2 n
+子素闻 2 nr
+子约翰 2 nr
+子纳兰 2 nr
+子纽林 2 nr
+子结构 17 n
+子络合 2 nr
+子继筠 2 nr
+子继统 2 nr
+子维兄 4 nr
+子缝 3 n
+子网 10 n
+子网层次 3 n
+子网掩码 3 nz
+子群 9 nr
+子花 4 n
+子苻健 2 nr
+子菌落 3 n
+子菜科 4 nr
+子萨木 3 nr
+子蔚停 2 nr
+子虚 3 nr
+子虚乌有 41 i
+子虚赋 10 nr
+子表 3 n
+子袭爵 3 nr
+子西平 2 nr
+子规 10 n
+子言 2 n
+子话儿 4 nr
+子诸樊 3 nr
+子课题 5 n
+子贝洛 2 nr
+子贡 4 nr
+子贡曰 3 nr
+子贷 3 n
+子赵煦 2 nr
+子赵雍 2 nr
+子路 15 n
+子车 6 n
+子载振 5 nr
+子进关 3 nr
+子连人 2 nr
+子连朱 2 nr
+子逊昵 2 nr
+子道兄 9 nr
+子道长 2 nr
+子邓忠 5 nr
+子郡主 2 nr
+子部 16 n
+子郭思 2 nr
+子金 14 n
+子铁穆 2 nr
+子键 3 n
+子长 13 n
+子长县 15 nr
+子闻 3 n
+子阿吉 2 nr
+子阿尔 2 nr
+子阿鲁 2 nr
+子陈理 3 nr
+子陵栉 3 nr
+子陵滩 3 nr
+子陵鱼 2 nr
+子隆隆 2 nr
+子随父 2 nr
+子雅谑 2 nr
+子集 80 n
+子集合 3 nr
+子集覆盖 3 n
+子震恐 2 nr
+子霖叔 17 nr
+子非子 2 nr
+子非鱼 5 nr
+子面儿 2 nr
+子音 3 n
+子项 6 n
+子项目 6 n
+子额哲 2 nr
+子额娘 2 nr
+子首领 2 nr
+子马钰 9 nr
+子高湛 2 nr
+子高澄 2 nr
+子鸡 5 n
+子鸣啼 2 nr
+子麻 2 n
+子鼠 3 n
+子龙脉 2 nr
+孑 23 zg
+孑口 3 n
+孑孓 7 n
+孑然 3 n
+孑然一身 16 i
+孑遗 64 n
+孔 3142 nr
+孔三传 4 nr
+孔丘 26 nr
+孔中探 2 nr
+孔中望 4 nr
+孔中钻 3 nr
+孔乙己 21 nr
+孔书记 2 nr
+孔亚纲 11 nr
+孔从洲 2 nr
+孔代亲王 4 nr
+孔令华 12 nr
+孔令奇 3 nr
+孔令志 6 nr
+孔令辉 8 nr
+孔先生 2 nr
+孔凡礼 3 nr
+孔凤春 2 nr
+孔函谷 2 nr
+孔分墨 7 nr
+孔切斯 2 nr
+孔则雷 2 nr
+孔刚刚 2 nr
+孔加键 2 nr
+孔北海 2 nr
+孔口 4 nr
+孔和金 5 nr
+孔四贞 15 nr
+孔型 3 n
+孔塔多 5 nr
+孔墨之 3 nr
+孔复古 2 nr
+孔多塞 5 nr
+孔太公 19 nr
+孔夫子 83 nr
+孔子 1103 nr
+孔子像 3 n
+孔孟 29 nr
+孔孟之 16 nr
+孔孟之道 41 nr
+孔孟学会 3 nr
+孔孟朱 2 nr
+孔孟飞 32 nr
+孔安国 8 nr
+孔家 10 nrfg
+孔家庄 3 nr
+孔家店 10 n
+孔小或 2 nr
+孔少府 3 nr
+孔尚任 21 nr
+孔尚贤 14 nr
+孔尼华 2 nr
+孔崇儒 2 nr
+孔席不暖 3 i
+孔席不适 3 l
+孔席墨突 3 nr
+孔广森 5 nr
+孔庆东 3 nr
+孔庆河 2 nr
+孔庙 177 nr
+孔府 52 nr
+孔彦舟 9 nr
+孔径 126 nr
+孔径光阑 3 nr
+孔志约 2 nr
+孔怀兄弟 3 nr
+孔思周情 3 n
+孔急 3 n
+孔情周思 3 nr
+孔成象 4 nr
+孔教 4 nr
+孔敬府 2 nr
+孔数 3 n
+孔文举 2 nr
+孔文卿 2 nr
+孔斯坦 5 nr
+孔方兄 3 nr
+孔明 1183 nr
+孔明一一 2 nr
+孔明乃 19 nr
+孔明之 26 nr
+孔明书 3 nr
+孔明亦 12 nr
+孔明亲 2 nr
+孔明今 2 nr
+孔明便 3 nr
+孔明先 8 nr
+孔明入 18 nr
+孔明兵 2 nr
+孔明分 6 nr
+孔明劝 2 nr
+孔明升 2 nr
+孔明取 2 nr
+孔明只 2 nr
+孔明叹 12 nr
+孔明同 4 nr
+孔明听 7 nr
+孔明告 2 nr
+孔明命 2 nr
+孔明唤 11 nr
+孔明善 2 nr
+孔明回 8 nr
+孔明坐 4 nr
+孔明复 3 nr
+孔明奏 3 nr
+孔明孔 2 nr
+孔明密 3 nr
+孔明寨 3 nr
+孔明尚 2 nr
+孔明尽 2 nr
+孔明山 2 nr
+孔明弃 3 nr
+孔明引 10 nr
+孔明归 2 nr
+孔明必 3 nr
+孔明恐 2 nr
+孔明惊 3 nr
+孔明拜 3 nr
+孔明提 3 nr
+孔明收 3 nr
+孔明教 14 nr
+孔明方 3 nr
+孔明施 2 nr
+孔明曰 3 nr
+孔明来 6 nr
+孔明果 2 nr
+孔明欲 2 nr
+孔明止 3 nr
+孔明求 2 nr
+孔明流 2 nr
+孔明渡 2 nr
+孔明灯 17 nr
+孔明独 2 nr
+孔明登 3 nr
+孔明真 6 nr
+孔明知 2 nr
+孔明离 3 nr
+孔明立 3 nr
+孔明竟 2 nr
+孔明笑 46 nr
+孔明答 5 nr
+孔明约 2 nr
+孔明自 12 nr
+孔明至 3 nr
+孔明见 12 nr
+孔明视 12 nr
+孔明谏 2 nr
+孔明谓 11 nr
+孔明辞 6 nr
+孔明遂 14 nr
+孔明重 2 nr
+孔明问 12 nr
+孔明闲 2 nr
+孔明闻 8 nr
+孔明随 3 nr
+孔明驱 4 nr
+孔晁注 2 nr
+孔晁皆 2 nr
+孔晓宇 4 nr
+孔有德 75 nr
+孔望山 6 nr
+孔林 16 nr
+孔武有力 6 nr
+孔气鸣 5 nr
+孔波利 11 nr
+孔波雷 2 nr
+孔泽尔 5 nr
+孔洞 46 nr
+孔清觉 2 nr
+孔灵芝 3 nr
+孔烂窑 3 nr
+孔父嘉 2 nr
+孔特佩 4 nr
+孔特管 3 nr
+孔狄亚 5 nr
+孔玛朵 2 nr
+孔甲立 2 nr
+孔甲经 3 nr
+孔目 21 n
+孔眼 12 nr
+孔祥复 256 nr
+孔祥星 2 nr
+孔祥泽 4 nr
+孔祥玉 3 nr
+孔穴 26 n
+孔繁森 36 nr
+孔老二 5 nr
+孔蒂奇 2 nr
+孔蒂尼 18 nr
+孔藏布 2 nr
+孔融 47 n
+孔融让梨 3 nr
+孔融谏 2 nr
+孔贲特旗 3 nr
+孔道 323 nr
+孔门 8 nr
+孔门儒 2 nr
+孔隙 140 n
+孔隙率 3 i
+孔雀 385 nr
+孔雀东南 3 ns
+孔雀东南飞 22 nr
+孔雀园 3 nr
+孔雀店村 3 ns
+孔雀开屏 3 nr
+孔雀河 44 nr
+孔雀王 3 nr
+孔雀石 53 nr
+孔雀绿 11 nr
+孔雀舞 9 nr
+孔雀蓝 6 nr
+孔雀鱼 3 nr
+孔颖达 29 nr
+孔飞力 3 nr
+孔鲤科 2 nr
+孕 425 n
+孕产 3 n
+孕产妇 10 n
+孕出 3 v
+孕前 13 t
+孕吐 3 v
+孕妇 498 n
+孕妇装 3 nz
+孕妈咪 3 n
+孕情 2 n
+孕早期 3 nz
+孕晚期 3 t
+孕期 105 t
+孕母 3 n
+孕激素 60 n
+孕甾烷 3 nz
+孕畜 3 n
+孕穗 4 nz
+孕穗期 4 t
+孕育 355 v
+孕育出 3 n
+孕育处 3 n
+孕育期 4 t
+孕酮 3 nz
+孖 6 zg
+字 20380 n
+字串 3 n
+字义 56 n
+字义疏证 3 n
+字书 61 n
+字位 3 n
+字体 618 n
+字体大小 3 n
+字体库 3 n
+字儿 211 n
+字元 3 n
+字元码 3 n
+字元组 3 n
+字典 242 n
+字卷 3 n
+字原 7 n
+字句 116 n
+字号 245 n
+字国瑞 2 nz
+字块 3 n
+字型 310 n
+字头 303 n
+字字 73 n
+字字句句 7 i
+字字珠玉 3 n
+字字珠玑 3 n
+字帖 33 n
+字帖儿 3 n
+字幅 9 n
+字幕 31 n
+字幕机 3 n
+字幕版 3 n
+字幕站 3 n
+字幕组 3 n
+字库 13 n
+字库文件 3 n
+字形 1250 n
+字形档 3 n
+字形码 3 n
+字形编码 2 n
+字意 3 n
+字据 29 n
+字数 831 n
+字数统计 3 n
+字斟句酌 76 i
+字旁 3 n
+字条 140 n
+字林西报 6 nz
+字架 3 n
+字样 582 n
+字根 28 n
+字根表 3 n
+字档 3 n
+字模 30 n
+字正腔圆 23 i
+字段 6 n
+字段名 3 n
+字母 848 n
+字母码 3 n
+字母组合 3 n
+字母脱漏 3 n
+字母表 23 n
+字母键 3 n
+字汇 13 n
+字源 7 n
+字片 3 n
+字牌 34 n
+字画 238 n
+字盘 3 n
+字眼 286 n
+字眼儿 12 n
+字码 8 n
+字码儿 3 n
+字符 347 n
+字符串 213 n
+字符识别 3 n
+字符集 18 n
+字纸 17 n
+字纸篓 11 n
+字线 3 n
+字组 3 n
+字节 87 n
+字节数 3 n
+字若涂鸦 3 ns
+字表 3 n
+字词 3 n
+字词句章 3 i
+字译 3 n
+字调 4 n
+字谜 15 n
+字贴 3 n
+字距 3 n
+字迷 3 n
+字迹 461 n
+字里行间 77 n
+字量 3 n
+字键 3 n
+字长 32 n
+字集 3 n
+字面 107 n
+字面上 3 n
+字音 36 n
+字音表 3 n
+字顺文从 3 i
+字顺索引 3 i
+字频 3 n
+字首 3 n
+字驱动 3 n
+存 3981 v
+存下 3 v
+存世 34 v
+存为 3 v
+存乎一心 5 l
+存乎其人 3 i
+存亡 338 v
+存亡与共 3 i
+存亡之秋 3 n
+存亡之际 3 n
+存亡安危 3 n
+存亡未卜 8 n
+存亡祸福 3 i
+存亡绝续 4 i
+存亡继绝 3 i
+存亡续绝 3 n
+存储 931 j
+存储介质 2 n
+存储体 7 n
+存储体系 2 n
+存储保护 5 n
+存储元件 2 n
+存储单元 20 n
+存储卡 7 n
+存储周期 2 n
+存储器 245 n
+存储容量 3 n
+存储密度 2 n
+存储技术 3 n
+存储栈 3 n
+存储模块 3 n
+存储点 3 n
+存储状态 2 n
+存储用户 2 n
+存储电容 3 n
+存储空间 3 n
+存储管理 34 n
+存储系统 33 n
+存储芯片 3 n
+存储设备 3 n
+存储资源 2 n
+存储转发 5 j
+存储配置 2 n
+存储量 4 n
+存储阵列 2 n
+存入 154 v
+存到 3 v
+存单 32 n
+存取 98 v
+存取控制 5 n
+存取数据 2 n
+存取方法 3 n
+存取时间 10 n
+存取款 7 n
+存取臂 3 n
+存取速度 20 n
+存在 15579 v
+存在主义 73 n
+存在物 12 n
+存在论 2 n
+存小异 3 n
+存底 2 v
+存废 3 v
+存异 19 n
+存心 380 v
+存心不良 3 i
+存心养性 2 n
+存心积虑 3 n
+存息 3 v
+存户 4 n
+存执 3 v
+存折 81 v
+存抚 3 v
+存据 3 n
+存放 414 v
+存放处 3 n
+存放数据 2 n
+存放程序 2 n
+存有 383 v
+存期 2 n
+存查 2 vn
+存栏 15 n
+存栏数 13 n
+存样 3 n
+存根 39 n
+存根联 3 nz
+存案 3 n
+存档 38 v
+存款 898 n
+存款人 25 n
+存款单 12 n
+存款簿 3 n
+存款额 8 n
+存水 3 v
+存水率 3 n
+存活 191 vn
+存活曲线 3 n
+存活期 4 n
+存活率 21 n
+存照 4 v
+存瑞乡 2 n
+存留 86 v
+存疑 27 v
+存盘 18 v
+存目 6 n
+存着 3 v
+存积 3 n
+存立 3 v
+存簿 3 n
+存粮 20 v
+存续 33 v
+存续期 17 n
+存而不论 2 i
+存褶 3 n
+存记 3 v
+存证 3 v
+存货 152 n
+存货量 3 n
+存贮 77 v
+存贮区 3 n
+存贮卡 3 n
+存贮器 43 n
+存贮空间 2 n
+存贷 16 n
+存贷款 10 n
+存身 41 v
+存车 3 n
+存车处 4 n
+存量 122 n
+存量房 3 n
+存钱 35 v
+存钱罐 3 n
+存项 3 n
+存食 3 v
+孙 4645 zg
+孙一丁 3 nr
+孙一生 2 nr
+孙万年 3 nr
+孙三哥 4 nr
+孙三弟 2 nr
+孙三毁 6 nr
+孙三霸 3 nr
+孙不二 3 nr
+孙专掌 2 nr
+孙丕杨 2 nr
+孙东东 4 nr
+孙中山 2171 nr
+孙中界 2 nr
+孙丹尼 3 nr
+孙为民 16 nr
+孙丽丽 6 nr
+孙乐祁 2 nr
+孙九爷 568 nr
+孙书记 4 nr
+孙乾保 2 nr
+孙乾先 3 nr
+孙乾同 2 nr
+孙乾回 3 nr
+孙乾守 2 nr
+孙乾往 3 nr
+孙乾来 2 nr
+孙乾至 2 nr
+孙乾见 2 nr
+孙乾领 3 nr
+孙二人 6 nr
+孙二哥 2 nr
+孙二娘 66 nr
+孙云晓 9 nr
+孙云球 2 nr
+孙云鹤 7 nr
+孙亮微微 2 nr
+孙仁师 2 nr
+孙仁玉 2 nr
+孙从添 2 nr
+孙仙姑 2 nr
+孙代王 2 nr
+孙仲君 154 nr
+孙仲寿 100 nr
+孙仲尹 3 nr
+孙仲引 2 nr
+孙仲河 11 nr
+孙仲秀 2 nr
+孙仲谋 6 nr
+孙伏园 2 nr
+孙伏虎 21 nr
+孙传庭 291 nr
+孙传芳 115 nr
+孙伯益 2 nr
+孙伯符 4 nr
+孙佳君 3 nr
+孙俊人 4 nr
+孙保杰 2 nr
+孙健敏 2 nr
+孙儒败 2 nr
+孙儿 69 nr
+孙儿女 3 nr
+孙儿立 2 nr
+孙元化 20 nr
+孙元良 20 nr
+孙兆秋 2 nr
+孙先生 42 nr
+孙光宪 12 nr
+孙克弘 2 nr
+孙克通 10 nr
+孙全贵 25 nr
+孙公刘 3 nr
+孙兰香 12 nr
+孙其峰 5 nr
+孙其松 5 nr
+孙冯翼 2 nr
+孙冶方 6 nr
+孙冶经 2 nr
+孙刘累 2 nr
+孙刚峰 37 nr
+孙削籍 2 nr
+孙勇军 3 nr
+孙半仙 10 nr
+孙华正 10 nr
+孙博士 2 nr
+孙占元 2 nr
+孙卫民 7 nr
+孙卫红 5 nr
+孙去寻 2 nr
+孙又生 2 nr
+孙叔敖 8 nr
+孙可望 29 nr
+孙启新 3 nr
+孙吴 61 nr
+孙吴之 3 nr
+孙吴亦 2 nr
+孙吴县 3 nr
+孙吴联 2 nr
+孙和平 2 nr
+孙和镖 2 nr
+孙喜圣 2 nr
+孙嘉淦 7 nr
+孙嘉绩 147 nr
+孙四哥 5 nr
+孙四海 594 nr
+孙国参 2 nr
+孙国明 3 nr
+孙国辅 10 nr
+孙图蒙 2 nr
+孙圣斌 4 nr
+孙坚 60 nr
+孙坚引 2 nr
+孙士海 7 nr
+孙多森 2 nr
+孙大人 4 nr
+孙大千 2 nr
+孙大午 13 nr
+孙大发 2 nr
+孙大哥 2 nr
+孙大善 3 nr
+孙大圣 203 nr
+孙大明 3 nr
+孙大炮 3 nr
+孙大闹 2 nr
+孙天勤 2 nr
+孙太后 6 nr
+孙太太 3 nr
+孙太甲 4 nr
+孙夫人 306 nr
+孙失烈 2 nr
+孙夷男 2 nr
+孙女 218 nr
+孙女儿 43 nr
+孙女婿 34 nr
+孙如游 6 nr
+孙如琦 3 nr
+孙姊姊 4 nr
+孙威王 4 nr
+孙威锋 3 nr
+孙婆婆 318 nr
+孙媳妇 13 nr
+孙子 871 nr
+孙子兵法 195 nr
+孙子思 2 nr
+孙子旭 2 nr
+孙子辈 10 n
+孙孚凌 18 nr
+孙孝哲 2 nr
+孙学武 55 nr
+孙宇挺 2 nr
+孙安入 2 nr
+孙安民 2 nr
+孙完颜 2 nr
+孙官人 2 nr
+孙宝传 2 nr
+孙宝文 5 nr
+孙宝琦 7 nr
+孙宝礼 14 nr
+孙家 45 nrfg
+孙家寨 5 nr
+孙家庄 3 nr
+孙家拐 256 nr
+孙家正 6 nr
+孙家泡 2 nr
+孙家湾 4 nr
+孙寒冰 6 nr
+孙寿梦 4 nr
+孙将军 2 nr
+孙小健 2 nr
+孙小姐 5 nr
+孙小平 4 nr
+孙小红 4 nr
+孙小飞 2 nr
+孙少军 2 nr
+孙少安 411 nr
+孙少平 441 nr
+孙尚书 2 nr
+孙尚清 2 nr
+孙巡抚 7 nr
+孙师伯 4 nr
+孙师傅 6 nr
+孙师兄 7 nr
+孙师叔 7 nr
+孙师姊 2 nr
+孙师毅 2 nr
+孙常伟 2 nr
+孙广路 2 nr
+孙庆斌 4 nr
+孙应奎 3 nr
+孙庞斗智 3 nr
+孙康映 2 nr
+孙康映雪 3 nr
+孙延龄 2 nr
+孙廷铨 6 nr
+孙建军 3 nr
+孙建初 2 nr
+孙建国 2 nr
+孙建宏 2 nr
+孙建平 2 nr
+孙建文 128 nr
+孙张鲁 2 nr
+孙彦军 3 nr
+孙彬 38 nrfg
+孙得功 11 nr
+孙德崖 22 nr
+孙德棣 3 ns
+孙德清 3 nr
+孙德谦 2 nr
+孙必干 256 nr
+孙必达 2 nr
+孙志东 2 nr
+孙志刚 23 nr
+孙志强 2 nr
+孙志浩 3 nr
+孙志远 3 nr
+孙思克 39 nr
+孙思邈 43 nr
+孙怡云 2 nr
+孙总兵 2 nr
+孙恭之 2 nr
+孙悟空 247 nr
+孙悦 32 nr
+孙慎行 5 nr
+孙慧丽 2 nr
+孙承奉 3 nr
+孙承宗 226 nr
+孙承平 5 nr
+孙承恩 2 nr
+孙承斌 4 nr
+孙承泽 3 nr
+孙抚台 9 nr
+孙振华 2 nr
+孙振焕 2 nr
+孙政委 2 nr
+孙文便 2 nr
+孙文先生 2 nr
+孙文冬 3 nr
+孙文匪 2 nr
+孙文台 2 nr
+孙文学 2 nr
+孙文学说 3 nrfg
+孙文宏亮 2 nr
+孙文广 2 nr
+孙文抿 2 nr
+孙文林 3 nr
+孙文波 2 nr
+孙文焕 8 nr
+孙文盛 12 nr
+孙文紧 2 nr
+孙文良 3 nr
+孙文说 4 nrfg
+孙文越 6 nr
+孙文转 2 nr
+孙新入 3 nr
+孙无宇 2 nr
+孙无终 2 nr
+孙旭烈 3 nr
+孙时进 2 nr
+孙昆弥 2 nr
+孙明扬 3 nr
+孙明斋 3 nr
+孙明明 3 nr
+孙明杰 12 nr
+孙明瑾 2 nr
+孙明经 7 nr
+孙星衍 12 nr
+孙春兰 3 nr
+孙显祖 6 nr
+孙晋芳 6 nr
+孙晓明 4 nr
+孙晓村 2 nr
+孙晓筠 3 nr
+孙晓群 256 nr
+孙有光 6 nr
+孙朝用 2 nr
+孙本孝 20 nr
+孙本文 6 nr
+孙朱允 2 nr
+孙权 943 nr
+孙权乃 4 nr
+孙权令 5 nr
+孙权入 3 nr
+孙权军 2 nr
+孙权召 2 nr
+孙权命 3 nr
+孙权少 2 nr
+孙权尚 2 nr
+孙权引 2 nr
+孙权必 3 nr
+孙权既 2 nr
+孙权欲 2 nr
+孙权派 6 nr
+孙权皆 2 nr
+孙权知 3 nr
+孙权至 2 nr
+孙权览 3 nr
+孙权闻 4 nr
+孙李彝 2 nr
+孙柏秋 2 nr
+孙柔嘉 18 nr
+孙栋廷 4 nr
+孙树侠 3 nr
+孙树勋 2 nr
+孙桓引 2 nr
+孙桥镇 3 nr
+孙楚庭 106 nr
+孙正义 6 nr
+孙正婷 3 nr
+孙武 71 nr
+孙武子 8 nr
+孙殿英 5 nr
+孙毓修 2 nr
+孙毓敏 2 nr
+孙毓筠 5 nr
+孙氏厚 2 nr
+孙永山 3 nr
+孙永盛 3 nr
+孙永祚 29 nr
+孙沈振 2 nr
+孙泰藏 7 nr
+孙洛泉 2 nr
+孙洪宪 7 nr
+孙海便 2 nr
+孙海客 5 nr
+孙海峡 3 nr
+孙海峰 3 nr
+孙海平 46 nr
+孙海涛 2 nr
+孙海麟 3 nr
+孙淑伟 14 nrfg
+孙湾东 2 nr
+孙滋溪 3 nr
+孙炳文 3 nr
+孙燕姿 4 nr
+孙爷爷 3 nr
+孙犁 44 nr
+孙玉亭 309 nr
+孙玉厚 199 nr
+孙玉波 6 nr
+孙玉玺 128 nr
+孙王昆 2 nr
+孙王离 3 nr
+孙现袭 2 nr
+孙理生 3 nr
+孙璐西 3 nr
+孙甜甜 54 nr
+孙男嫡女 3 nz
+孙男弟 3 nr
+孙白谷 4 nr
+孙皓 34 nrfg
+孙益新 2 nr
+孙相公 5 nr
+孙眉刚 2 nr
+孙督师 2 nr
+孙礼引 4 nr
+孙礼领 2 nr
+孙祖寿 12 nr
+孙秀才 4 nr
+孙秀萍 2 nr
+孙科佳 10 nr
+孙科宅 3 nr
+孙立人 16 nr
+孙立便 2 nr
+孙立军 4 nr
+孙立在 2 nr
+孙立孙 2 nr
+孙立平 3 nr
+孙立引 2 nr
+孙策 125 nr
+孙策分 3 nr
+孙策卒 2 nr
+孙策引 5 nr
+孙策欲 3 nr
+孙红雷 3 nr
+孙绍祖 8 nr
+孙继仁 3 nr
+孙继堂 3 nr
+孙继海 67 nr
+孙继若 2 nr
+孙绳祖 9 nr
+孙维世 2 nr
+孙维佳 4 nr
+孙维民 3 nr
+孙翊铢 2 nr
+孙耀威 3 nr
+孙耀志 14 nr
+孙耀祖 5 nr
+孙老三 12 nr
+孙老九 18 nr
+孙老爷 19 nr
+孙膑 54 nr
+孙自有 8 nrfg
+孙自法 13 nrfg
+孙舍之 2 nr
+孙良诚 2 nr
+孙若肯 2 nr
+孙苻登 4 nr
+孙茂庆 12 nr
+孙茂芳 3 nr
+孙菊仙 11 nr
+孙菲菲 3 nr
+孙蒙哥 3 nr
+孙虹纲 4 nr
+孙虹钢 5 nr
+孙行者 200 nr
+孙诒让 15 nr
+孙贵人 2 nr
+孙赵世 2 nr
+孙起孟 10 nr
+孙起礼 8 nr
+孙轶青 2 z
+孙过庭 6 nr
+孙迎辰 2 nr
+孙运璿 3 nz
+孙连仲 20 nr
+孙连桂 2 nr
+孙逸仙 21 nr
+孙逸仙纪念医院 2 nr
+孙逸飞 3 nr
+孙道临 11 nr
+孙道长 2 nr
+孙邦俊 5 nr
+孙里庆 2 nr
+孙重贵 3 nr
+孙野道 3 nr
+孙金铸 12 nr
+孙金龙 259 nr
+孙钟龄 3 nr
+孙铁匠 9 nr
+孙铁木 11 nr
+孙铁穆 3 nr
+孙铭九 4 nr
+孙银龙 6 nr
+孙长义 3 nr
+孙长老 15 nr
+孙阿鲁 3 nr
+孙隆椿 2 nr
+孙静之 2 nr
+孙飞虎 3 nr
+孙飞鹏 3 nr
+孙马丁 4 nr
+孙麻哈 2 nr
+孙黄狮 2 nr
+孚 73 nrt
+孚众望 3 ns
+孚尹旁达 3 ns
+孚尹明达 3 vn
+孚山 3 nrt
+孚山县 3 ns
+孚日 6 nrt
+孚日山 4 nrt
+孛 252 zg
+孜 200 l
+孜孜 3 l
+孜孜不倦 52 i
+孜孜不怠 3 l
+孜孜不息 3 l
+孜孜不懈 3 i
+孜孜不辍 3 l
+孜孜以求 20 l
+孜孜无倦 3 i
+孜孜无怠 3 l
+孜孜汲汲 3 nr
+孜孜追求 5 l
+孜然 5 l
+孜然芹 3 n
+孝 1863 ng
+孝义 95 n
+孝义县 3 ns
+孝义市 3 ns
+孝亲 4 n
+孝养 3 v
+孝南区 256 ns
+孝堂 3 n
+孝女 9 n
+孝妇 3 n
+孝子 441 n
+孝子慈孙 3 nr
+孝子爱日 3 nr
+孝子贤孙 13 nr
+孝子顺孙 4 nr
+孝宗 38 nrt
+孝家 3 n
+孝帷 3 n
+孝幔 4 n
+孝庄 3 ns
+孝廉 66 nrt
+孝弟 3 n
+孝心 121 n
+孝心感人 3 n
+孝思 3 n
+孝思不匮 3 i
+孝悌 3 nr
+孝悌忠信 3 nr
+孝感 2101 n
+孝感人 258 n
+孝感市 1805 ns
+孝敬 483 v
+孝敬父母 3 nr
+孝敬老人 3 nr
+孝文帝 86 nrt
+孝昌 8 ns
+孝昌县 258 ns
+孝明帝 19 nr
+孝服 39 n
+孝男 3 nr
+孝经 37 n
+孝经起序 3 n
+孝行 8 v
+孝行感人 3 n
+孝衣 13 n
+孝道 67 v
+孝静帝 8 nrt
+孝顺 220 nz
+孝顺为齐 3 i
+孝顺父母 3 nr
+孞 6 zg
+孟 884 nr
+孟东野 6 nr
+孟丽君 5 nr
+孟丽萍 3 nr
+孟买 147 ns
+孟二冬 3 nr
+孟京 2 ns
+孟京辉 3 nr
+孟什维克 51 nrt
+孟仁泉 6 nr
+孟伯飞 48 nr
+孟健雄 120 nr
+孟先汉 2 nr
+孟先生 22 nr
+孟公公 13 nr
+孟兰盆 2 nr
+孟关良 2 nr
+孟养浩 2 nr
+孟冲府 2 nr
+孟凡勤 4 nr
+孟凡强 3 nr
+孟凯帝 6 nr
+孟加拉 237 nr
+孟加拉人民共和国 4 ns
+孟加拉国 243 ns
+孟加拉湾 93 ns
+孟加拉虎 14 nr
+孟加拉语 23 nz
+孟加锡 2 nr
+孟县 44 ns
+孟古 2 ns
+孟合己 3 nr
+孟吉云 4 nr
+孟塞尔 7 nr
+孟大哥 5 nr
+孟大爷 2 nr
+孟太太 12 nr
+孟夫子 8 nr
+孟姜女 43 nr
+孟婆汤 3 nr
+孟子 365 nr
+孟子曰 3 nr
+孟孙恶 2 nr
+孟孙氏 7 nr
+孟学农 4 nr
+孟宇湘 6 nr
+孟宪励 6 nr
+孟宪忠 2 nr
+孟宪承 2 nr
+孟家 50 n
+孟家人 7 nr
+孟家和 2 nr
+孟家庄 18 nr
+孟家花园 2 ns
+孟富林 2 nr
+孟小冬 6 nr
+孟少农 2 nr
+孟尝君 48 nr
+孟尝湖 256 nr
+孟尼利 14 nr
+孟山都 3 ns
+孟州 29 ns
+孟州城 2 ns
+孟州市 3 ns
+孟州温 2 nr
+孟州道 2 nr
+孟师叔 3 nr
+孟席斯 3 nr
+孟广美 3 nr
+孟庆云 2 nr
+孟庆伟 4 nr
+孟庆元 2 nr
+孟庆南 256 nr
+孟庆平 9 nr
+孟庭伟 3 nr
+孟庭苇 3 nr
+孟康注 2 nr
+孟建柱 3 nr
+孟弗之 19 nr
+孟德尔 54 nr
+孟德尔松 3 nr
+孟德斯鸠 39 nrt
+孟德新 5 nr
+孟德维 3 nr
+孟恩远 10 nr
+孟懿子 2 nr
+孟抑荀 2 nr
+孟斐斯 18 nr
+孟族 3 nz
+孟无忧 20 nr
+孟春祈 128 nr
+孟春舫 4 nr
+孟昭兰 2 nr
+孟昭瑞 2 nr
+孟昭英 2 nr
+孟村 3 nr
+孟杜庄 2 nr
+孟格部 4 nr
+孟森摇 2 nr
+孟楼潮 3 nr
+孟正鸿 10 nr
+孟武斌 2 nr
+孟母三迁 3 nr
+孟津 73 ns
+孟津之 2 nr
+孟津伐 2 nr
+孟津县 2 ns
+孟津渡 3 nr
+孟洪涛 3 nr
+孟浩然 281 nr
+孟浪 30 nz
+孟海军 4 nr
+孟灵己 15 nr
+孟特祖 2 nr
+孟玉楼 3 nr
+孟知祥 22 nr
+孟福尔 6 nr
+孟禧子 3 nr
+孟离己 11 nr
+孟称舜 4 nr
+孟繁华 4 nr
+孟繁树 3 nr
+孟继懋 2 nr
+孟罕勒 2 nrt
+孟老爷子 16 nr
+孟老者 7 nr
+孟良崮 29 ns
+孟良崮战役 29 nz
+孟范例 2 n
+孟菲尔 7 nr
+孟菲斯 8 nr
+孟菲斯市 3 ns
+孟西安 10 nr
+孟语 2 nz
+孟轲 21 nr
+孟轲提 2 nr
+孟达引 3 nr
+孟达登 2 nr
+孟连傣族拉祜族佤族自治县 4 ns
+孟速思 2 nr
+孟郊 21 nr
+孟阳 2 ns
+孢 149 n
+孢原细胞 3 n
+孢原质 3 n
+孢囊 3 n
+孢囊被 3 n
+孢子 555 n
+孢子中壁 3 n
+孢子体 3 n
+孢子同型 3 n
+孢子囊 96 n
+孢子异型 3 n
+孢子植物 6 n
+孢子粉 3 n
+孢粉 19 n
+孢粉学 10 n
+季 1619 n
+季世 3 n
+季亚族 16 nr
+季亚科 2 nr
+季任钧 16 nr
+季候 3 n
+季候风 3 n
+季允石 2 nr
+季元 2 n
+季克西 2 nr
+季兴入 2 nr
+季军 32 n
+季军奖 3 n
+季冬 3 nr
+季净营 2 n
+季分明 6 n
+季刊 66 n
+季初 3 nr
+季别尔 2 nr
+季前赛 3 nr
+季华路 2 n
+季历 23 n
+季历之 3 nr
+季历入 3 n
+季历终 2 l
+季友 6 n
+季友伯兄 3 nr
+季后赛 588 nr
+季品时 2 n
+季夏 3 n
+季大姐 4 nr
+季天生 3 nr
+季天笙 3 nr
+季婷婷 141 nr
+季子 5 n
+季子白 5 nr
+季孙 2 n
+季孙之忧 4 l
+季孙氏 6 nr
+季孟之间 3 nr
+季家嘴 256 nr
+季家庄 2 nr
+季布一诺 3 nr
+季常之惧 3 i
+季常之癖 3 n
+季平 3 n
+季度 2086 n
+季度初 3 nr
+季度末 3 n
+季康子 2 nr
+季弟 3 n
+季忠平 3 nr
+季戊四醇 12 nz
+季托夫 4 nr
+季报 79 n
+季文子 2 nr
+季方 3 n
+季明 4 n
+季春 3 nr
+季朗村 3 nr
+季末 3 n
+季梁 258 n
+季正清 6 nr
+季泽 7 n
+季洛杜 3 nr
+季父 3 n
+季直夸 2 nr
+季直表 3 n
+季秋 3 n
+季米尔 21 nr
+季米特洛夫 11 nrt
+季米特里 4 nrt
+季纳斯 2 nr
+季维芹 3 nr
+季羡林 23 nr
+季耶夫 2 nr
+季耶娃 4 nr
+季舍夫 2 nr
+季节 3201 n
+季节冻土 3 n
+季节工 5 n
+季节性 226 n
+季节河 3 n
+季节洄游 3 l
+季节风 3 n
+季荷 2 n
+季莫琴科 2 nr
+季莫申 4 nr
+季莫申科 3 nr
+季莫费 2 nr
+季蒂昂 3 nr
+季诺夫 4 nr
+季诺维 11 nr
+季谢夫 2 nr
+季财报 3 n
+季路一言 3 l
+季辛吉 3 nr
+季连 7 n
+季里特 16 nr
+季铭义 5 nr
+季镖头 6 vn
+季长老 6 nr
+季陶 2 n
+季雨 2 n
+季雨林 71 nr
+季音 13 n
+季风 432 n
+季风区 47 n
+季风性 266 n
+季风气候 946 l
+季风雨 14 l
+季风雨林 3 n
+季麟连 8 nr
+孤 1973 a
+孤云野鹤 3 nr
+孤伶伶 5 z
+孤俦寡匹 3 nr
+孤傲 47 a
+孤傲不群 3 i
+孤僻 72 a
+孤僻成性 3 i
+孤儿 432 nr
+孤儿仔 3 nr
+孤儿寡女 3 l
+孤儿寡妇 15 i
+孤儿寡母 37 l
+孤儿消息 3 l
+孤儿院 37 l
+孤军 117 nr
+孤军作战 15 l
+孤军奋战 59 i
+孤军奋斗 3 i
+孤军深入 30 i
+孤力 7 n
+孤单 213 a
+孤单单 12 z
+孤单时 3 l
+孤危迫切 3 n
+孤哀子 3 nr
+孤啡肽 3 n
+孤园 3 n
+孤坐 3 v
+孤坐独处 3 i
+孤坟 9 n
+孤女 23 n
+孤孀 3 n
+孤子 7 n
+孤孤凄凄 3 z
+孤孤单单 21 z
+孤孤独独 3 i
+孤孤零零 3 z
+孤学坠绪 3 n
+孤家寡人 35 i
+孤寂 124 a
+孤寒 6 a
+孤寡 15 n
+孤寡老人 29 i
+孤寡鳏独 3 v
+孤对电子 3 l
+孤少女 2 nr
+孤履危行 3 i
+孤山 93 nr
+孤屿 3 n
+孤岛 105 n
+孤峰 21 nr
+孤弱 3 a
+孤形吊影 3 i
+孤影 3 n
+孤微 3 a
+孤恋花 3 i
+孤恩负义 3 i
+孤悬客寄 3 nr
+孤悬浮寄 3 nr
+孤意 2 v
+孤愤 3 a
+孤拐 3 nr
+孤拔 10 n
+孤挺花 3 z
+孤掌难鸣 45 i
+孤文只义 3 i
+孤文断句 3 i
+孤旅 7 n
+孤本 29 a
+孤束核 3 n
+孤松 2 a
+孤枕难眠 3 i
+孤标傲世 3 i
+孤标独步 3 l
+孤残 14 a
+孤注 3 v
+孤注一掷 97 i
+孤洁 2 a
+孤灯 26 n
+孤犊触乳 3 n
+孤独 711 a
+孤独受体 3 i
+孤独寂寞 3 i
+孤独感 21 i
+孤独独 3 nr
+孤独症 24 i
+孤独矜寡 3 nr
+孤独鳏寡 3 v
+孤男寡女 3 i
+孤癖 3 n
+孤立 1520 v
+孤立主义 23 n
+孤立寡与 3 i
+孤立无助 9 i
+孤立无援 62 i
+孤立系 3 nr
+孤立语 3 nr
+孤老 22 a
+孤老户 2 i
+孤胆 18 nr
+孤臣孽子 4 i
+孤舟独桨 3 nr
+孤芳自赏 19 i
+孤苦 79 a
+孤苦伶丁 3 i
+孤苦伶仃 62 i
+孤苦无依 8 i
+孤苦零丁 5 i
+孤行 4 v
+孤行一意 3 i
+孤行己意 3 i
+孤行己见 3 i
+孤豚腐鼠 3 v
+孤负 4 v
+孤贫苦节 3 i
+孤赏石 3 nr
+孤身 159 n
+孤身一人 118 i
+孤身只影 2 i
+孤陋 3 a
+孤陋寡闻 53 i
+孤雄生殖 3 l
+孤雌寡鹤 3 i
+孤雌生殖 33 l
+孤雌胚 3 n
+孤雏寡鹤 3 nr
+孤雏腐鼠 3 v
+孤零 3 z
+孤零零 184 z
+孤高 14 a
+孤高自许 3 nr
+孤鬼 4 n
+孤魂 27 n
+孤魂野鬼 13 i
+孤鸾寡鹄 3 nr
+孤鸾寡鹤 3 i
+孤鸿寡鹄 3 nr
+孤鸿影 3 nr
+孥 30 zg
+学 17482 n
+学上 3 n
+学不完 3 v
+学不尽 3 l
+学业 389 n
+学业成绩 3 n
+学业有成 5 n
+学习 13482 v
+学习业务 3 n
+学习体会 3 n
+学习动机 10 n
+学习团 3 n
+学习困境 3 n
+学习型 37 n
+学习外语 3 n
+学习室 6 n
+学习年限 3 n
+学习律 3 n
+学习心得 3 n
+学习态度 3 n
+学习性 3 n
+学习成绩 3 n
+学习指南 3 n
+学习效果 3 n
+学习曲线 5 n
+学习机 11 n
+学习材料 3 n
+学习桌 3 n
+学习气氛 3 n
+学习测量 3 n
+学习热 3 n
+学习班 90 n
+学习用品 3 n
+学习策略 5 n
+学习组 4 n
+学习网 3 n
+学习者 54 n
+学习部 3 n
+学习键 3 n
+学书不成 3 i
+学书学剑 3 n
+学人 71 n
+学代会 3 n
+学以致用 47 l
+学优则仕 3 n
+学会 2639 n
+学位 2634 n
+学位办 5 n
+学位点 2 n
+学位证 12 n
+学位证书 3 n
+学僧 3 n
+学兵 16 n
+学养 26 n
+学军 5 n
+学农 12 n
+学分 275 n
+学分制 55 n
+学刊 24 n
+学到 556 v
+学到老 10 l
+学制 230 n
+学前 25 v
+学前教育 67 l
+学前期 2 n
+学前班 7 n
+学剑不成 3 i
+学力 4 n
+学务 9 n
+学区 23 n
+学区制 3 n
+学医 64 n
+学博 3 v
+学历 1460 n
+学历教育 3 l
+学历者 34 n
+学历证书 3 n
+学历证明 3 n
+学去 3 v
+学友 24 n
+学号 3 n
+学名 90 n
+学呀 3 n
+学员 1001 n
+学员制 3 n
+学员证 3 n
+学员队 11 n
+学回 3 v
+学回去 3 l
+学园 20 n
+学困生 4 n
+学坏 3 v
+学堂 614 n
+学塾 10 n
+学士 1103 n
+学士学位 3 n
+学士府 3 n
+学大庆 3 n
+学好 109 v
+学如不及 3 i
+学如登山 3 i
+学如穿井 3 i
+学如逆水 3 i
+学妹 3 n
+学姊 3 n
+学姐 3 n
+学子 433 n
+学季 3 n
+学学 97 n
+学学习 7 n
+学学看 3 l
+学官两栖 3 l
+学宫 14 n
+学家 322 n
+学富五年 3 i
+学富五车 12 n
+学富才高 3 i
+学工 10 n
+学工办 3 n
+学工处 3 n
+学工部 3 n
+学年 198 n
+学年度 3 n
+学年成绩 3 n
+学年考试 3 n
+学店 3 n
+学府 1010 n
+学府路 519 n
+学弟 11 n
+学徒 201 n
+学徒制 3 l
+学徒工 11 l
+学懂 3 v
+学成 105 v
+学成回国 3 n
+学成归国 3 n
+学成归来 3 l
+学报 45 n
+学政 3 n
+学文 23 n
+学无常师 3 n
+学无止境 17 l
+学时 44 n
+学时数 3 n
+学有专长 8 n
+学有所成 12 i
+学有所用 6 l
+学有所长 4 n
+学有进境 3 n
+学期 342 n
+学期开始 3 l
+学期成绩 3 n
+学期末 3 n
+学期结束 3 n
+学术 3206 n
+学术争论 3 n
+学术交流 3 n
+学术会议 75 n
+学术刊物 3 n
+学术前沿 3 n
+学术化 18 n
+学术史 31 n
+学术团体 62 n
+学术年会 3 n
+学术思想 3 n
+学术性 55 n
+学术报告 3 n
+学术探讨 3 i
+学术期刊 3 n
+学术权威 3 n
+学术活动 3 n
+学术界 404 n
+学术研究 3 n
+学术科 3 n
+学术类 5 n
+学术腐败 3 n
+学术著作 3 n
+学术观点 3 n
+学术讨论 3 n
+学术论坛 3 n
+学术论文 3 n
+学杂费 83 n
+学来 3 v
+学来学去 3 l
+学林 12 n
+学校 17020 n
+学校公寓 3 n
+学校同学 3 n
+学校名称 3 n
+学校后勤 3 n
+学校地址 3 n
+学校工友 3 n
+学校德育 3 n
+学校成绩 3 n
+学校论坛 3 n
+学校食堂 3 n
+学样 3 n
+学案 3 n
+学棍 2 n
+学步 12 n
+学步车 2 n
+学步邯郸 3 ns
+学武 174 n
+学法 51 n
+学法语 3 n
+学派 1432 n
+学浅才疏 3 i
+学海 266 n
+学海无涯 3 i
+学满 3 v
+学潮 11 n
+学点 3 n
+学然后知 3 l
+学然后知不足 6 i
+学理 48 n
+学理科 3 n
+学生 30776 n
+学生上课 3 n
+学生代联 3 nz
+学生会 91 n
+学生会长 3 n
+学生党员 3 n
+学生公寓 3 n
+学生包 3 n
+学生名单 3 n
+学生味 3 n
+学生处 16 n
+学生奶 3 n
+学生妹 3 n
+学生娃 9 n
+学生守则 3 n
+学生家长 3 n
+学生宿舍 3 n
+学生手册 3 n
+学生族 3 n
+学生服 3 n
+学生档案 3 l
+学生用品 3 n
+学生界 3 n
+学生票 9 n
+学生腔 3 n
+学生自治 3 n
+学生装 15 n
+学生证 12 n
+学用 5 n
+学用一致 3 n
+学田 2 n
+学画 87 n
+学界 514 n
+学界泰斗 3 nz
+学疏才浅 3 i
+学监 8 n
+学着点 3 n
+学社 86 n
+学科 3432 n
+学科专业 3 l
+学科分类 3 n
+学科前沿 3 n
+学科建设 3 l
+学科点 3 n
+学科知识 3 n
+学科群 6 n
+学科考试 3 n
+学租 3 n
+学究 174 v
+学究天人 8 n
+学究式 3 n
+学究气 5 n
+学究气地 3 n
+学童 31 n
+学籍 101 n
+学籍表 3 n
+学系 72 n
+学级 3 n
+学组 10 n
+学老于年 3 l
+学者 4212 n
+学者型 12 n
+学者气 3 n
+学而不厌 5 i
+学而不思 3 l
+学而优则 3 n
+学而优则仕 15 i
+学联 561 n
+学舌 14 n
+学舍 3 n
+学艺 344 n
+学艺股 3 n
+学艺股长 3 n
+学苑 256 n
+学行 3 n
+学衔 10 n
+学识 209 n
+学识上 3 n
+学识渊博 53 l
+学诚 3 n
+学说 1962 n
+学说话 3 n
+学贯中西 13 n
+学贯古今 3 n
+学费 950 n
+学起 3 v
+学车网 3 n
+学过来 3 l
+学运 3 n
+学运领袖 3 n
+学道 3 n
+学道者 4 n
+学部 111 n
+学部委员 38 n
+学长 57 n
+学长制 3 n
+学门 3 n
+学问 992 n
+学问为济 3 l
+学问好 3 l
+学问家 17 n
+学问渊博 3 l
+学阀 3 n
+学院 29249 n
+学院奖 8 n
+学院派 50 n
+学院路 1042 n
+学院附中 3 j
+学院院长 3 n
+学雷锋 31 n
+学非所用 5 l
+学风 255 n
+学飞 3 v
+学馆 3 n
+学龄 15 n
+学龄儿童 33 n
+学龄前 35 v
+学龄期 3 n
+孨 156 zg
+孩 216 n
+孩儿 1346 n
+孩儿巷 3 n
+孩子 17465 n
+孩子家 26 n
+孩子气 47 n
+孩子王 8 n
+孩提 44 n
+孩提时代 3 n
+孩童 184 n
+孪 63 zg
+孪井滩 2 n
+孪生 82 b
+孪生儿 3 n
+孪生兄弟 3 n
+孪生姐妹 3 n
+孪生子 8 n
+孫 3 zg
+孬 57 n
+孬种 32 n
+孭 5 zg
+孮 5 zg
+孰 299 r
+孰不可忍 153 l
+孰与 3 v
+孰料 15 l
+孰是孰非 15 l
+孰知 3 v
+孰能 3 v
+孰能无情 2 l
+孰能无过 7 l
+孰若 3 v
+孰谓 3 v
+孰轻孰重 8 l
+孱 13 a
+孱头 3 a
+孱弱 70 a
+孱弱无力 3 nz
+孲 33 zg
+孳 364 zg
+孳乳 2 v
+孳孳不倦 3 v
+孳孳汲汲 3 nr
+孳孳矻矻 3 z
+孳息 3 v
+孳生 48 v
+孳生地 3 v
+孳蔓 3 v
+孳蔓难图 3 ns
+孴 437 zg
+孵 147 v
+孵仔 3 n
+孵出 3 v
+孵出来 3 v
+孵化 454 v
+孵化器 7 nz
+孵化园 3 n
+孵化场 2 n
+孵化期 48 t
+孵化机 3 n
+孵化率 3 n
+孵卵 88 v
+孵卵器 3 n
+孵小鸡 3 n
+孵成 3 v
+孵育 7 vn
+孵蛋 3 v
+孵蛋器 3 n
+孵雏 3 v
+孵鸟 3 n
+學 6 zg
+孺 85 n
+孺人 2 nrt
+孺子 35 n
+孺子不可 3 i
+孺子可教 7 n
+孺子婴 5 n
+孺子牛 4 n
+孽 256 ag
+孽债 3 n
+孽子 3 n
+孽子孤臣 3 i
+孽怨 3 n
+孽根 3 nz
+孽根祸胎 3 i
+孽海 4 nz
+孽海花 11 nz
+孽畜 3 n
+孽种 30 n
+孽障 40 n
+孽障种子 3 n
+孾 99 zg
+宀 215 zg
+宁 1791 j
+宁一山 2 nr
+宁上尉 2 nr
+宁与歆 2 nr
+宁东 2 ns
+宁中则 3 nr
+宁为 3 nr
+宁为玉碎 150 i
+宁为鸡口 3 i
+宁为鸡头 3 i
+宁为鸡首 3 i
+宁乡 32 ns
+宁乡县 17 ns
+宁人息事 3 i
+宁侯朱 2 nr
+宁信其 2 nr
+宁八州 2 ns
+宁公主 16 nr
+宁兴 3 ns
+宁冈 33 ns
+宁冈县 24 ns
+宁凌噶 9 nr
+宁前兵 4 nr
+宁前道 3 nr
+宁化 17 ns
+宁化县 11 ns
+宁南 6 ns
+宁南伯 5 ns
+宁南侯 28 nr
+宁南县 3 ns
+宁县 31 ns
+宁古塔 41 nr
+宁可 847 nr
+宁可信其 3 nr
+宁可信其有 21 i
+宁吴忠 3 nr
+宁周义 56 nr
+宁哥 3 ns
+宁国 44 ns
+宁国县 3 ns
+宁国市 3 ns
+宁国府 35 nt
+宁城 55 ns
+宁城县 6 ns
+宁夏 889 ns
+宁夏人民出版社 2 nt
+宁夏回族 3 nr
+宁夏回族自治区 143 ns
+宁夏回族自治区人民政府 5 nt
+宁夏回族自治区政府 6 nt
+宁夏城 3 ns
+宁夏大学 15 nt
+宁夏平原 3 ns
+宁夏战役 18 nz
+宁夏省 3 ns
+宁夏红 3 nr
+宁夏自治区 2 ns
+宁夏路 3 ns
+宁夷州 2 ns
+宁女侠 10 nr
+宁宁 32 ns
+宁安 25 ns
+宁安县 14 ns
+宁安市 3 ns
+宁安府 3 nr
+宁安镇 3 ns
+宁完我 3 nr
+宁宗 11 nr
+宁宗庆 2 nr
+宁宗死 3 nr
+宁宗逾 3 nr
+宁定心 3 nr
+宁宫 5 ns
+宁宫东 2 ns
+宁宫丹 2 nr
+宁宫传 2 nr
+宁宫启 2 nr
+宁宫太后 13 nr
+宁宫掌 2 nr
+宁宫朝 4 nr
+宁宫皇后 2 nr
+宁宫西 6 ns
+宁宫赐 2 nr
+宁宫里 2 nr
+宁寺 23 ns
+宁寺敬 7 nr
+宁寺碑 3 nr
+宁寺礼 2 nr
+宁寺记 2 nr
+宁寿宫 16 nr
+宁山麓 2 nr
+宁州 16 ns
+宁州彭 3 nr
+宁巴 3 ns
+宁巴峰 3 nr
+宁帖 3 nr
+宁平城 6 ns
+宁府中 3 nr
+宁府宝玉 2 nr
+宁强 2 nrfg
+宁强县 3 ns
+宁强盗 3 i
+宁德 9 nr
+宁德市 7 ns
+宁徽寺 3 ns
+宁心安神 3 nr
+宁愿 549 d
+宁戎校 2 nr
+宁折不弯 10 i
+宁敦伍 2 nr
+宁日 3 d
+宁明 7 nr
+宁明县 5 ns
+宁春红 3 nr
+宁晋 6 nr
+宁晋县 4 nr
+宁晋泊 4 nr
+宁普县 3 ns
+宁杭 3 ns
+宁根 2 ns
+宁正 2 nrfg
+宁武 19 nr
+宁武关 7 ns
+宁武县 8 ns
+宁死 110 nr
+宁死不屈 69 i
+宁死不服 3 i
+宁死不辱 3 i
+宁死不降 3 i
+宁汉 13 ns
+宁江区 3 ns
+宁江州 5 ns
+宁池广 2 nr
+宁沪杭 3 nr
+宁沪高速 3 nz
+宁河 11 ns
+宁河县 8 ns
+宁波 538 ns
+宁波人 12 nr
+宁波大学 3 nt
+宁波市 72 ns
+宁波府 3 nr
+宁波港 10 ns
+宁波网 3 nr
+宁波话 3 nr
+宁津 2 ns
+宁津县 4 ns
+宁洪虎 8 nr
+宁洱 3 ns
+宁海 194 ns
+宁海人 3 nr
+宁海军 5 nr
+宁海县 66 ns
+宁海名 2 nr
+宁海城 12 ns
+宁海州 4 ns
+宁海开 9 nr
+宁海强 2 nrfg
+宁海温泉 14 nr
+宁海能 2 nr
+宁海镇 2 ns
+宁滥毋缺 3 i
+宁王之 3 nr
+宁王兄 3 nr
+宁王友 4 nr
+宁王马 2 nr
+宁玛派 8 nr
+宁神司 2 nr
+宁神归 2 nr
+宁神静 2 nr
+宁绍台 7 nr
+宁绍商 4 nr
+宁缬正 2 nr
+宁缺 3 a
+宁缺勿滥 3 i
+宁缺毋滥 5 i
+宁肯 122 nr
+宁致远 29 nrfg
+宁芜 17 nrfg
+宁芬堡 2 nr
+宁荣二 9 nr
+宁荣街 3 nr
+宁蒗 11 nrt
+宁蒗彝族自治县 5 ns
+宁西 2 ns
+宁要 3 a
+宁谧 5 nr
+宁财神 2 nr
+宁边 3 d
+宁边州 3 ns
+宁远 451 nrfg
+宁远一 3 nr
+宁远之 2 nr
+宁远之战 12 i
+宁远军 3 nr
+宁远卫 3 nr
+宁远县 2 ns
+宁远城 16 nr
+宁远士 2 nr
+宁远守 2 nr
+宁远州 2 ns
+宁远府 2 nr
+宁远方 2 nr
+宁远河 2 nr
+宁远筑 3 nr
+宁远觉 3 nr
+宁连路 2 ns
+宁述勇 5 nr
+宁道何 3 nr
+宁都 78 ns
+宁都县 8 ns
+宁镇 8 ns
+宁镇扬 7 nr
+宁镇杨 2 nr
+宁阳 9 ns
+宁阳侯 2 nr
+宁阳县 5 ns
+宁陕 3 nr
+宁陕县 2 nr
+宁陕镇 3 nr
+宁陵 21 ns
+宁陵县 3 ns
+宁靖 3 nr
+宁靖王 2 nr
+宁静 652 nr
+宁静下来 3 nr
+宁静海 3 nr
+宁静致远 4 nr
+宁馨儿 3 nr
+它 60864 r
+它们 12359 r
+它山之石 3 v
+宄 84 x
+宅 904 n
+宅中图大 3 nz
+宅园 3 n
+宅地 3 n
+宅基 4 n
+宅基地 49 n
+宅墙 3 n
+宅子 293 n
+宅心 3 n
+宅心仁厚 3 n
+宅急送 3 n
+宅电 3 n
+宅第 60 n
+宅舍 3 n
+宅邸 76 n
+宅门 19 n
+宅院 106 n
+宇 548 nr
+宇一郎 2 nr
+宇下 3 n
+宇之表 2 nr
+宇内 10 nz
+宇化 2 n
+宇华 6 nz
+宇多田光 3 nr
+宇天能 3 nr
+宇妥 4 nz
+宇宙 2312 n
+宇宙云 3 nr
+宇宙学 59 l
+宇宙射线 41 l
+宇宙尘 17 nr
+宇宙志 3 nr
+宇宙服 2 l
+宇宙火箭 7 l
+宇宙空间 110 l
+宇宙站 3 l
+宇宙线 110 l
+宇宙船 3 l
+宇宙观 40 l
+宇宙论 6 l
+宇宙速度 12 n
+宇宙飞船 111 l
+宇彩晶 2 nr
+宇文 44 nz
+宇文化及 3 l
+宇文宪 6 nr
+宇文忻 7 nr
+宇文恺 22 nr
+宇文恺卒 2 nr
+宇文懋昭 2 nr
+宇文护 50 nr
+宇文护引 2 nr
+宇文护迁 3 nr
+宇文毓 8 nr
+宇文氏 8 nr
+宇文泰 126 nr
+宇文泰之 4 nr
+宇文泰军 2 nr
+宇文泰和 4 nz
+宇文泰嗣 3 nr
+宇文泰立 2 nr
+宇文泰继 3 nr
+宇文泰自 2 nr
+宇文泰遂 2 nr
+宇文直 3 nr
+宇文粹 3 nr
+宇文胄 5 nr
+宇文莫槐 2 nr
+宇文虚 48 nr
+宇文虚中 6 nr
+宇文融 8 nr
+宇文觉 19 nr
+宇文觉幼 3 l
+宇文达 2 nr
+宇文述 2 nr
+宇文述之 3 nr
+宇文邕 36 nr
+宇文邕平 2 nr
+宇文邕确 3 nr
+宇文阁 6 nr
+宇文阁学 4 n
+宇文阐 3 nr
+宇治 3 n
+宇津保 2 nr
+宇田道 2 nr
+宇称 56 n
+宇称算符 3 n
+宇笑道 7 nr
+宇绿岩 2 nr
+宇网吧 17 n
+宇航 179 nr
+宇航员 289 n
+宇航学 3 n
+宇航局 49 n
+宇航工程 3 n
+宇航服 6 n
+宇航界 3 n
+宇观 6 n
+宇通 3 nz
+宇道 10 n
+宇都 8 n
+宇都宫 4 nr
+宇量 3 n
+宇飞扬 2 nr
+守 5648 v
+守业 15 n
+守丧 6 v
+守丧期间 3 l
+守中立 3 nr
+守义 7 n
+守仁 5 v
+守份 3 n
+守住 3 v
+守信 73 v
+守信用 28 n
+守候 183 n
+守候伏击 3 n
+守候多时 3 n
+守先待后 3 i
+守兵 41 n
+守军 431 n
+守分 6 n
+守分安常 3 i
+守则 82 n
+守制 3 v
+守势 81 n
+守卫 572 v
+守卫者 3 n
+守卫边疆 3 n
+守口如瓶 66 i
+守土 67 n
+守土有责 19 l
+守城 789 n
+守备 266 v
+守备军 3 n
+守备区 3 n
+守备道 3 n
+守备部队 3 n
+守备队 21 n
+守夜 86 n
+守夜人 10 i
+守夜员 3 n
+守如处女 3 l
+守孝 33 v
+守完 3 v
+守宫 51 n
+守宫砂 3 n
+守密 3 n
+守寡 87 v
+守寡人 3 i
+守岁 20 n
+守待 3 v
+守御 232 v
+守恒 206 v
+守恒定律 138 l
+守恒性 2 n
+守成 24 v
+守成不变 3 i
+守成不易 3 l
+守戒 3 n
+守护 493 v
+守护人 3 n
+守护员 3 n
+守护星 3 n
+守护石 3 n
+守护神 69 n
+守护者 15 n
+守拙 19 a
+守擂 3 v
+守敌 51 v
+守方 3 n
+守旧 133 v
+守旧派 44 n
+守旧观念 3 n
+守时 24 n
+守望 62 v
+守望相助 2 i
+守望者 37 n
+守本分 8 n
+守林 3 n
+守株待兔 27 i
+守正不回 3 i
+守正不挠 3 i
+守正不移 3 i
+守正不阿 2 i
+守死善道 3 i
+守法 189 n
+守法主义 3 n
+守法性 3 n
+守活寡 13 l
+守灵 31 n
+守猎 3 v
+守瓶缄口 3 vn
+守生 3 v
+守空房 11 n
+守约 12 v
+守约方 3 n
+守约施博 3 i
+守约施搏 3 i
+守纪 3 n
+守纪律 3 n
+守经达权 3 l
+守缺抱残 3 i
+守职 3 v
+守职尽责 3 l
+守节 35 n
+守节不回 3 l
+守节不移 3 i
+守要 3 v
+守规矩 3 l
+守贞 3 n
+守财 3 v
+守财奴 13 n
+守身 3 v
+守身如玉 26 i
+守身若玉 3 i
+守车 8 n
+守边 3 n
+守道安贫 3 i
+守金如玉 3 i
+守错 3 v
+守门 146 n
+守门人 15 n
+守门员 142 n
+守阙抱残 3 nr
+守队 3 n
+守静 4 a
+安 8837 v
+安七州 256 ns
+安万特 5 nr
+安上 185 v
+安不忘危 3 i
+安与佳 4 nr
+安世 4 nrt
+安世高 2 nr
+安丘 10 ns
+安丘县 3 ns
+安丘市 8 ns
+安业 2 n
+安东 74 ns
+安东内 2 ns
+安东华 2 nr
+安东尼 172 nr
+安东尼奥 39 nrt
+安东尼斯 2 ns
+安东市 2 ns
+安东省 3 ns
+安东街 3 ns
+安东诺夫 41 nr
+安丰 46 ns
+安丰侯 2 nr
+安丰军 5 nr
+安丰塘 7 ns
+安为先 3 nr
+安乃德 2 nr
+安乃近 4 nr
+安义 10 nr
+安义县 7 ns
+安之若命 2 i
+安之若泰 3 nr
+安之若素 10 nr
+安乐 138 ns
+安乐园 3 nr
+安乐国 3 ns
+安乐村 2 nr
+安乐椅 5 nz
+安乐死 30 nr
+安乐窝 20 ns
+安乡 784 ns
+安乡侯 2 nr
+安乡县 4 ns
+安二郎 8 nr
+安于 101 v
+安于一隅 3 i
+安于心 16 nr
+安于故俗 3 i
+安于现状 21 nr
+安于盘石 3 nr
+安亚平 3 nr
+安产 3 j
+安享 37 v
+安享天年 3 nr
+安享晚年 6 i
+安享清福 3 nr
+安亭下 3 nr
+安亭镇 3 nr
+安亲王 21 nr
+安人 3 nrt
+安人运 9 nr
+安仁 13 nr
+安仁义 2 nr
+安仁县 3 ns
+安仁里 7 nr
+安仁镇 7 nr
+安以轩 3 nr
+安份 3 nz
+安份守己 9 l
+安住 3 v
+安体富 4 nr
+安体舒 10 nr
+安保 63 nr
+安信 3 nz
+安倍 11 nr
+安倍晋三 9 nr
+安健刚 42 nr
+安克雷奇 10 nrt
+安全 9921 an
+安全事件 39 nz
+安全事故 3 i
+安全值 2 n
+安全剃刀 3 n
+安全区 22 j
+安全卫士 3 nz
+安全卫生 3 nz
+安全厅 3 nr
+安全可靠 3 i
+安全员 3 n
+安全器 3 nz
+安全器材 3 n
+安全壳 7 nr
+安全套 36 nz
+安全局 299 nt
+安全岛 4 nr
+安全工程 3 nz
+安全带 70 nr
+安全帽 6 nz
+安全形势 3 i
+安全性 337 nr
+安全意识 3 i
+安全感 181 nr
+安全控制 10 nz
+安全措施 39 nr
+安全更新 7 nz
+安全期 8 j
+安全架 3 nz
+安全柜 3 nr
+安全栅 3 nr
+安全标志 3 n
+安全梯 3 nr
+安全检查 44 nr
+安全气囊 3 i
+安全法 53 nr
+安全漏洞 3 n
+安全火柴 3 nz
+安全灯 3 nr
+安全玻璃 3 nt
+安全瓣 3 n
+安全电压 4 nz
+安全监控 4 j
+安全监管 3 j
+安全等级 4 l
+安全策略 3 n
+安全类 10 nz
+安全系数 50 nz
+安全级别 3 n
+安全线 6 nz
+安全网 12 nz
+安全补丁 3 nr
+安全装置 2 n
+安全观 15 nr
+安全角 3 nz
+安全设备 3 i
+安全软件 2 l
+安全部 33 nt
+安全部长 3 n
+安全部门 28 n
+安全部队 22 nt
+安全门 10 nr
+安全阀 13 nz
+安全隐患 3 i
+安全鞋 3 nr
+安公主 2 nr
+安其业 3 nr
+安其妻 16 nr
+安其宜 16 nr
+安其敏 2 nr
+安养 3 v
+安养院 3 nr
+安内 270 nz
+安内乃 2 nr
+安内攘外 5 nr
+安分 97 v
+安分守己 73 i
+安分守已 3 i
+安分知足 3 i
+安切洛 13 nr
+安切洛蒂 4 nrt
+安刘氏 3 nr
+安利 5 ns
+安剑清 14 nr
+安力满 112 nr
+安加拉 16 ns
+安加拉河 15 ns
+安加罗 2 nr
+安努斯 6 nr
+安化 27 v
+安化县 8 ns
+安北 6 ns
+安卓亚 2 nr
+安南 222 ns
+安博塞 2 nr
+安博士 3 nr
+安博维 4 nr
+安博诺 4 nr
+安卡拉 53 nr
+安卧 16 v
+安危 410 nr
+安危与共 3 i
+安危冷暖 3 i
+安危相易 3 l
+安危祸福 3 i
+安厝 3 nrt
+安县 40 ns
+安可 11 nr
+安可复 2 nr
+安史之乱 217 i
+安史部 2 nt
+安吉 45 nr
+安吉丽娜 3 nr
+安吉县 12 ns
+安吉尔 3 nr
+安吉拉 3 nr
+安吉斯 3 nr
+安吉莱斯 3 nr
+安启元 3 nr
+安吴 2 ns
+安命 2 nz
+安和 20 ns
+安和乐利 3 ns
+安和路 3 ns
+安哈尔特 3 nrt
+安哈拉 12 ns
+安哥 15 ns
+安哥拉 295 nr
+安哥拉人民解放运动 8 nz
+安哥拉政府 2 nt
+安哥拉队 2 nt
+安善 3 v
+安喜县 2 ns
+安固 2 v
+安国 103 ns
+安国县 6 ns
+安国君 6 nr
+安国宁家 3 ns
+安国富民 3 nr
+安国市 4 ns
+安图 3 nr
+安图县 4 ns
+安土乐业 3 nz
+安土城 2 ns
+安土桃 2 nr
+安土重居 3 i
+安土重旧 3 z
+安土重迁 3 i
+安圣基 3 nr
+安在旭 5 nr
+安圭拉 18 nr
+安圭拉岛 4 ns
+安地斯山 3 ns
+安坊李 2 nr
+安坐 13 v
+安坐待毙 3 i
+安坦 3 ns
+安城 7 ns
+安培 120 nr
+安培力 14 nr
+安培匝数 3 v
+安培天平 3 nr
+安培数 3 nr
+安培计 2 nr
+安基卢 2 nr
+安堡 2 ns
+安堵乐业 3 n
+安堵如故 3 l
+安塔利亚 9 ns
+安塔基 2 nr
+安塔拉 9 nr
+安塞 24 nr
+安塞县 5 ns
+安塞尔米 3 nrt
+安士 5 ns
+安士伟 8 nr
+安士荣 5 nr
+安外 3 a
+安多 27 ns
+安多县 7 ns
+安大人 13 nr
+安大哥 3 nr
+安大娘 58 nr
+安大略 32 nr
+安大略湖 42 ns
+安大略省 48 ns
+安天命 4 nr
+安夷 4 ns
+安奈特 3 nr
+安奉日 28 nr
+安契塔 7 nr
+安好 166 a
+安如太山 3 nr
+安如泰山 3 nr
+安如磐石 2 nr
+安妍红 3 nr
+安妥 6 a
+安妮 48 nrt
+安妮塔 3 nr
+安妮斯顿 3 nrt
+安妮特 3 nr
+安委会 6 nt
+安娜 973 nr
+安娜停 2 nr
+安娜冲 2 nr
+安娜刚 3 nr
+安娜揉 2 nr
+安娜止 2 nr
+安娜正 2 nr
+安娜火 2 nr
+安娜皱 2 nr
+安娜真 3 nr
+安娜絮 2 nr
+安娜苏 3 nr
+安子介 4 nr
+安子会 2 nr
+安子文 50 nr
+安宁 502 ns
+安宁区 2 ns
+安宁县 3 ns
+安宁市 3 ns
+安宁平静 3 nr
+安宁河 19 ns
+安宅正路 3 nr
+安守本分 2 n
+安安 18 ns
+安安全全 3 nz
+安安定定 3 ns
+安安心 2 nr
+安安心心 11 i
+安安然然 3 i
+安安生生 8 nz
+安安稳稳 64 z
+安安静静 106 z
+安宗社 2 nr
+安定 1278 v
+安定剂 3 n
+安定力 3 nr
+安定区 3 ns
+安定团结 106 n
+安定性 3 nr
+安定片 3 n
+安定物 3 n
+安定路 3 nr
+安定门 318 ns
+安室 5 nz
+安室利处 3 i
+安宫 5 ns
+安家 110 ns
+安家乐业 3 nz
+安家立业 5 nr
+安家落户 27 i
+安家费 17 nr
+安富尊荣 5 nr
+安富恤穷 3 n
+安富恤贫 3 n
+安寨主 4 nr
+安寺 2 ns
+安小慧 64 nr
+安少兵 2 nr
+安尔乐 2 nr
+安尼亚 18 ns
+安尼克 2 nr
+安尼戈 2 nr
+安尼斯顿 4 ns
+安居 142 v
+安居乐业 112 nz
+安居乐教 3 nz
+安居区 3 nr
+安居工程 8 n
+安居房 3 nr
+安居梦 3 nr
+安居镇 3 nr
+安山 18 ns
+安山岩 39 nr
+安山质 2 nr
+安山镇 4 ns
+安岛 2 ns
+安岳 8 nr
+安岳县 3 ns
+安州 7 ns
+安巴 2 ns
+安巴尔 3 nr
+安布 66 v
+安布罗 3 nr
+安帝义 5 nr
+安帝元 2 nr
+安帝初 2 nr
+安帝建 2 nr
+安帝永 21 nr
+安帝隆 4 nr
+安常 16 a
+安常习故 3 n
+安常处顺 3 nr
+安常守分 3 nr
+安常守故 3 i
+安常履顺 3 nr
+安平 38 nr
+安平县 5 ns
+安平古堡 3 ns
+安平君 2 nr
+安平桥 3 ns
+安平港 4 ns
+安平镇 5 ns
+安庄卫 2 nr
+安庆 315 ns
+安庆人 2 nr
+安庆市 20 ns
+安庆街 3 ns
+安府制 2 nr
+安度 35 ns
+安度晚年 3 nz
+安康 124 nr
+安康地区 3 ns
+安康市 14 ns
+安康日报 3 nz
+安康杯 3 nz
+安康社区 3 nt
+安康线 3 nr
+安康路 3 nr
+安康鱼 3 nr
+安归迦 2 nr
+安彩信 6 nr
+安彩高科 14 nr
+安徒生 97 nr
+安得 3 v
+安得倚 2 nr
+安得拉 2 nr
+安得拉邦 14 ns
+安得烈 2 nr
+安得鲁 2 nr
+安德列 13 nr
+安德孙 5 nr
+安德尔 4 nr
+安德拉邦 3 ns
+安德斯 6 nr
+安德施 2 nr
+安德森 105 nr
+安德正 16 nr
+安德洛 34 nr
+安德海 3 nr
+安德烈 72 nr
+安德烈亚 6 nrt
+安德烈奥蒂 3 nrt
+安德烈斯 7 nrt
+安德烈耶夫 4 nrt
+安德烈耶维奇 5 nrt
+安德特 23 nr
+安德生 3 nr
+安德纽 4 nr
+安德罗 51 nr
+安德罗斯 4 ns
+安德莱 27 nr
+安德莱赫特 4 nrt
+安德逊 2 nr
+安德里 13 nr
+安德雷 10 nr
+安德顿 5 nr
+安德鲁 91 nr
+安德鲁斯 17 ns
+安徽 1864 ns
+安徽人民出版社 2 nt
+安徽医科大学 3 nt
+安徽大学 24 nt
+安徽师范大学 6 nt
+安徽教育学院 2 nt
+安徽理工 3 nr
+安徽省 980 ns
+安徽省公安厅 3 nt
+安徽省委 3 nt
+安徽省巢湖地区 4 ns
+安徽省政府 3 nt
+安徽省教育厅 2 nt
+安徽省旅游局 8 nt
+安徽省立医院 2 nt
+安心 570 v
+安心乐业 3 n
+安心乐意 3 i
+安心定志 3 nr
+安心落意 3 i
+安必信 3 nr
+安忍 10 v
+安忍弃 3 nr
+安忍无亲 3 i
+安志杰 3 nr
+安态 3 n
+安思顺 2 nr
+安恙 3 z
+安恬 4 nrfg
+安息 259 v
+安息年 3 t
+安息日 32 nz
+安息油 3 nz
+安息香 34 nr
+安息香酸 2 nz
+安悦榕 4 nr
+安惠君 3 nr
+安慕客 2 nr
+安慧桥 2 nr
+安慧里 3 nr
+安慰 1469 v
+安慰剂 7 nr
+安慰性 3 nr
+安慰赛 3 nr
+安戈斯 2 nr
+安成基 3 nr
+安戮 3 v
+安扎克 3 nr
+安打 3 v
+安打率 3 n
+安托万 20 nr
+安托尔 5 nr
+安托尼 5 nr
+安托法加斯塔 9 nrt
+安托瓦 2 nr
+安技 3 nz
+安抚 629 nr
+安抚下来 3 nr
+安抚住 3 nr
+安抚司 52 nr
+安抵 2 v
+安拉 100 nrt
+安拉之 3 nr
+安拉派 2 nr
+安振东 2 nr
+安捷伦 9 nr
+安捺 3 v
+安排 7836 v
+安排法 3 j
+安排表 15 l
+安提丰 9 nr
+安提柯 3 nr
+安提瓜 2 nr
+安提瓜和巴布达 22 ns
+安提瓜岛 13 ns
+安提督 42 nr
+安提阿 3 nr
+安插 106 v
+安插亲信 3 i
+安插在 3 i
+安插法 3 i
+安放 468 v
+安故重迁 3 i
+安敢 3 a
+安敢怀 2 nr
+安敦 2 ns
+安敦尼 3 nr
+安敦派 2 nr
+安文思 4 nr
+安斯科 2 nr
+安新 6 nr
+安新县 12 ns
+安时处顺 3 nr
+安昌 6 ns
+安明智 15 nr
+安易 3 a
+安景勋 13 nr
+安曼 51 nr
+安替比林 3 nz
+安条克 3 nr
+安杰利 4 nr
+安杰罗 3 nr
+安极尔 2 ns
+安枕 11 nr
+安枕无忧 3 i
+安枕而卧 3 i
+安栋梁 11 nr
+安格尔 8 nr
+安格拉 3 nr
+安格斯 3 nr
+安格隆 5 nr
+安格鲁 3 nr
+安桑式 2 nr
+安桥 2 ns
+安检 50 v
+安检员 5 n
+安检站 3 nt
+安检门 4 nr
+安森美 3 nr
+安次区 2 nz
+安歇 228 v
+安歇吧 3 nr
+安步当年 3 i
+安步当车 3 l
+安民 141 nr
+安民告示 14 n
+安汉 3 ns
+安汉公 5 nr
+安汉室 2 nr
+安汉将军 2 nr
+安江 4 ns
+安江林 2 nr
+安沛 2 a
+安河桥 2 ns
+安治 2 v
+安泰 53 nz
+安泰萨 2 nr
+安泽 3 nr
+安泽县 3 ns
+安洋 2 ns
+安洞主 20 nr
+安济 6 n
+安济桥 4 nr
+安海镇 4 ns
+安清帮 2 nr
+安渖铁路 3 v
+安渡滩 3 nr
+安源 59 ns
+安源区 3 ns
+安溪 35 ns
+安溪县 11 ns
+安澜 21 nrfg
+安灵 4 nr
+安热罗 2 nr
+安然 139 nr
+安然如故 3 i
+安然无事 8 i
+安然无恙 94 i
+安特南 2 ns
+安特卫 3 nr
+安特卫普 102 nr
+安特卫普队 12 nz
+安特尔 2 nr
+安特生 7 nr
+安王 3 nrt
+安王爷 5 nr
+安王福 2 nr
+安珂 3 nrfg
+安理会 528 nt
+安理会常任理事国 67 nt
+安琦飞 2 nr
+安琪儿 2 nr
+安琪拉 3 nr
+安琪马 6 nr
+安瑟伦 7 nr
+安瓜河 2 ns
+安瓿瓶 3 v
+安生 142 an
+安生乐业 3 nz
+安生服业 3 l
+安甯 3 z
+安畅 2 a
+安疆 3 ns
+安白造 2 nr
+安的列斯 26 ns
+安的列斯群岛 38 ns
+安皇后 22 nr
+安皇太后 2 nr
+安益山 2 nr
+安监局 3 j
+安监站 3 nr
+安盟 80 ns
+安省 2 ns
+安眉带眼 3 i
+安眠 30 v
+安眠剂 3 nz
+安眠药 73 n
+安眠葯 3 t
+安眠酮 2 nz
+安睡 119 v
+安睡在 3 n
+安知 12 v
+安知其 2 nr
+安知非 3 nr
+安知非福 2 nr
+安神 101 nr
+安神定魄 3 i
+安祥 9 nr
+安禄山 138 nr
+安福 40 nr
+安福县 4 ns
+安福国会 5 nt
+安福系 13 nr
+安科纳 3 nr
+安稳 281 a
+安穆凯 2 nr
+安立 5 v
+安立甘 14 nr
+安立路 3 nr
+安第斯 86 ns
+安第斯地区 8 ns
+安第斯山 100 ns
+安第斯山脉 102 ns
+安第斯集团 4 nt
+安纳巴 9 nr
+安纳布尔 2 nrt
+安纳德 6 nr
+安纳德拉维达 7 nrt
+安纳托 5 nr
+安纳波利斯 5 ns
+安纳线 3 nr
+安纳肯 11 nr
+安纳金 2 nr
+安络血 3 v
+安置 916 v
+安置人员 3 n
+安置工作 3 l
+安置若素 3 nr
+安置费 3 nr
+安老怀少 3 nr
+安耐克 3 nr
+安联 28 ns
+安联保险公司 2 nt
+安肃 14 ns
+安肃公 2 nr
+安肃军 2 nr
+安肃州 2 ns
+安肃道 2 nr
+安肯 9 v
+安胎 16 n
+安胎药 3 n
+安能 3 v
+安能成 2 nr
+安腾 22 v
+安良除暴 3 i
+安若泰山 3 nr
+安茨 2 nrt
+安茹伯爵 3 nr
+安草儿 101 nr
+安荣生 3 nr
+安莉芳 3 nr
+安莎社 4 nr
+安菲尔德 3 nrt
+安菲波 5 nr
+安菲浦 32 nr
+安营 53 nr
+安营下寨 10 ns
+安营扎寨 40 nr
+安萨 2 ns
+安萨里 17 ns
+安葬 274 v
+安葬地 3 n
+安葬费 3 n
+安蒂利 16 nr
+安蒂叙 16 nr
+安蒂奥 2 nr
+安蒂奥基亚省 2 ns
+安藤政信 3 nr
+安装 2382 v
+安装公司 3 nt
+安装包 3 n
+安装工 3 n
+安装工人 3 l
+安装操作 2 l
+安装文件 3 l
+安装时间 3 l
+安装法 3 n
+安装版 3 n
+安装盘 3 n
+安装程序 6 l
+安装简单 2 nr
+安装者 3 n
+安装费 4 n
+安西 156 ns
+安西东 7 ns
+安西县 2 ns
+安西双 3 nr
+安西奇 4 nr
+安西将军 2 nr
+安西州 4 ns
+安西府 2 nr
+安西王 9 nr
+安西镇 2 ns
+安见得 2 nr
+安设 144 v
+安详 176 v
+安诺本 5 ns
+安谋克 22 nr
+安谒斐雷 3 nr
+安谧 15 nr
+安贞 130 nr
+安贞医院 2 nt
+安贞桥 3 nr
+安贞焕 3 nr
+安贞里 3 nr
+安贫 3 a
+安贫乐贱 3 i
+安贫乐道 7 i
+安贫守道 3 i
+安赛蜜 32 nr
+安赫利 2 nr
+安赫尔 19 nr
+安踏 7 v
+安身 129 v
+安身为乐 3 i
+安身之地 8 i
+安身之处 12 i
+安身乐业 3 nz
+安身立命 44 i
+安车蒲轮 3 nz
+安边 19 ns
+安达 117 nr
+安达信 3 nz
+安达充 3 nr
+安达卢西亚 23 ns
+安达市 8 ns
+安达曼 52 nr
+安达鲁西亚 2 ns
+安进 5 v
+安远 12 nr
+安远侯 3 nr
+安远县 2 ns
+安迪尔 4 nr
+安迪诺 3 nr
+安适 42 a
+安适如常 3 i
+安通 4 nz
+安逸 116 nr
+安道全 63 nr
+安道尔 157 nr
+安道尔公国 5 ns
+安那 15 ns
+安那州 3 ns
+安邦 9 nr
+安邦兴国 3 ns
+安邦定国 17 ns
+安邦河 2 ns
+安邦治 128 nr
+安邦治国 257 ns
+安郡王 19 nr
+安部 14 n
+安重根 2 nr
+安重荣 5 nr
+安金刀 2 nr
+安金槐 3 nr
+安锁子 60 nr
+安锡 15 ns
+安锡湖 6 nr
+安长叹 3 nr
+安闲 84 nr
+安闲地 3 i
+安闲惬意 3 vn
+安闲自在 2 i
+安闲自得 3 i
+安防 8 v
+安防界 2 n
+安防网 3 n
+安阳 225 ns
+安阳县 12 ns
+安阳市 22 ns
+安陆 1572 ns
+安陆市 256 ns
+安陵 17 ns
+安陶尔 3 nr
+安集延 10 nr
+安雯 3 nz
+安静 1199 nr
+安静下去 3 i
+安静下来 3 i
+安静无声 3 i
+安非 2 ns
+安非他命 3 nz
+安非他明 3 ns
+安非拉酮 3 nz
+安顺 54 nr
+安顺场 28 ns
+安顺市 10 ns
+安顿 271 ns
+安顿下来 3 i
+安颜红 3 nr
+安香堡 2 nr
+安魂 4 n
+安魂定魄 3 i
+安魂曲 10 nr
+安鹤宫 4 nr
+安齐奥 4 nr
+安龙 133 nr
+安龙县 3 ns
+宊 22 zg
+宋 4976 nr
+宋一听 2 nr
+宋一国 3 nr
+宋一欣 24 nr
+宋一鸟 2 nr
+宋一鹤 13 nr
+宋万先 2 nr
+宋三史 11 nr
+宋三泰 2 nr
+宋三郎 8 nr
+宋世益 6 nr
+宋东京 2 nr
+宋丞相 4 nr
+宋两军 3 nr
+宋两朝 2 nr
+宋丰年 16 nr
+宋丹丹 5 nr
+宋丹臣 2 nr
+宋为国 2 nr
+宋为河 2 nr
+宋义兵 2 nr
+宋之世 2 nr
+宋之举 2 nr
+宋之制 3 nr
+宋之天 2 nr
+宋之礼 2 nr
+宋之福 2 nr
+宋之程 2 nr
+宋之问 10 nr
+宋九儒 2 nr
+宋书 2 nr
+宋乾德 2 nr
+宋乾道 2 nr
+宋二人 6 nr
+宋二公 10 nr
+宋云西 2 nr
+宋五 4 t
+宋五叔 6 nr
+宋亚坤 2 nr
+宋人晏 2 nr
+宋人林 2 nr
+宋人洪 2 nr
+宋人辽 2 nr
+宋仁宗 77 nr
+宋仁宗庆 3 nr
+宋代 1923 t
+宋仪望 23 nr
+宋任穷 11 nr
+宋企郊 7 nr
+宋伟臣 2 nr
+宋伯仁 2 nr
+宋伯鲁 4 nr
+宋体 170 nr
+宋体字 3 nr
+宋儒臣 2 nr
+宋儒赵 2 nr
+宋允儿 3 nr
+宋元 176 nr
+宋元东 3 nr
+宋元丰 5 nr
+宋元刚 2 nr
+宋元南 31 nr
+宋元名 3 nr
+宋元嘉 7 nr
+宋元图 2 nr
+宋元圆 2 nr
+宋元学 5 nr
+宋元时 7 t
+宋元明 12 nr
+宋元汉 2 t
+宋元港 2 nr
+宋元符 2 nr
+宋元算 8 nr
+宋元语录 2 nr
+宋元诸 10 nr
+宋兄弟 15 nr
+宋兆霖 2 nr
+宋先生 6 nr
+宋光宗 9 nr
+宋克刚 3 nr
+宋公明 171 nr
+宋兴华 2 nr
+宋兵入 2 nr
+宋兵分 2 nr
+宋兵势 6 nr
+宋兵卢 2 nr
+宋兵寨 3 nr
+宋兵战 3 nr
+宋兵果 2 nr
+宋兵甚 2 nr
+宋兵直 2 nr
+宋兵鲁削 3 nr
+宋军乘 2 nr
+宋军先 2 nr
+宋军入 4 nr
+宋军兵 2 nr
+宋军冲 2 nr
+宋军分 2 nr
+宋军可 2 nr
+宋军喝 2 nr
+宋军大 2 nr
+宋军如 2 nr
+宋军寨 2 nr
+宋军将军 2 nr
+宋军开 4 nr
+宋军战 2 nr
+宋军攻 3 nr
+宋军旗 4 nr
+宋军无 2 nr
+宋军民 2 nr
+宋军班 4 nr
+宋军阵 5 nr
+宋军降 2 nr
+宋刊本 6 nr
+宋刑统 3 nr
+宋初 24 t
+宋初沿 2 nr
+宋制略 2 nr
+宋加封 5 nr
+宋十策 2 nr
+宋占标 2 nr
+宋发兵 3 nr
+宋史 124 nr
+宋史丛 4 nr
+宋史中 2 nr
+宋史者 2 nr
+宋司马光 2 nr
+宋同安 2 nr
+宋名臣 2 nr
+宋向晋 2 nr
+宋向金 2 nr
+宋君臣 5 nr
+宋君荣 2 nr
+宋咸平 2 nr
+宋咸淳 4 nr
+宋哥哥 5 nr
+宋哲元 23 nr
+宋哲宗 43 nr
+宋唯原 13 nr
+宋善朋 24 nr
+宋国公 5 nr
+宋国强 5 nr
+宋国荣 3 nr
+宋国蒙 3 nr
+宋国都 2 nr
+宋土广 2 nr
+宋埠 10 ns
+宋培起 68 nr
+宋士杰 2 nr
+宋备战 2 nr
+宋夏联 2 nr
+宋大人 3 nr
+宋大侠 29 nr
+宋大叔 2 nr
+宋大哥 12 nr
+宋大师 2 nr
+宋大明 6 nr
+宋大爷 3 nr
+宋天保 28 nr
+宋天圣 2 nr
+宋天子 6 nr
+宋天宫宝藏 2 nr
+宋天禧 3 nr
+宋太公 41 nr
+宋太宗 114 nr
+宋太宰 2 nr
+宋太平 14 nr
+宋太祖 94 nr
+宋夫人 15 nr
+宋奚陈 10 nr
+宋如何 2 nr
+宋妈妈 3 nr
+宋嬷嬷 7 nr
+宋子文 49 nr
+宋孝宗 52 nr
+宋孝宗淳 2 nr
+宋孝武 5 nr
+宋孝武帝 5 nr
+宋学 8 nr
+宋学义 11 nr
+宋学仁 20 nr
+宋学春 5 nr
+宋学疑 2 nr
+宋孩儿 6 nr
+宋宁宗 30 nr
+宋守军 2 nr
+宋官本 2 nr
+宋宜昌 3 nr
+宋宝元 2 nr
+宋宝华 4 nr
+宋宝瑞 6 nr
+宋室南 11 nr
+宋家 10 nrfg
+宋家二 6 nr
+宋家寨 166 nr
+宋家庄 4 nr
+宋家村 10 nr
+宋家桥 2 nr
+宋寨中 2 nr
+宋寨主 20 nr
+宋少侠 16 nr
+宋少帝 2 nr
+宋少爷 2 nr
+宋州北 2 nr
+宋州谷 2 nr
+宋已成 2 nr
+宋师伯 3 nr
+宋师爷 64 nr
+宋希濂 2 nr
+宋干节 6 nr
+宋幼帝 3 nr
+宋庆宋 2 nr
+宋庆龄 227 nr
+宋庆龄基金会 12 nt
+宋庆龄故居 4 nr
+宋应昌 31 nr
+宋应星 36 nr
+宋府州 2 nr
+宋度宗 21 nr
+宋康浩 3 nr
+宋廷削 2 nr
+宋廷命 2 nr
+宋廷大 2 nr
+宋廷才 2 nr
+宋廷抗 2 nr
+宋建平 3 nr
+宋建康 2 nr
+宋建文 2 nr
+宋建隆 9 nr
+宋开宝 8 nr
+宋张择 3 nr
+宋彦通 10 nr
+宋役法 2 nr
+宋得民 2 nr
+宋德安 2 nr
+宋德方 48 nr
+宋德珠 3 nr
+宋德福 7 nr
+宋徽宗 124 nr
+宋思明 711 nr
+宋恭帝 14 nr
+宋惠乔 3 nr
+宋惠莲 2 nr
+宋慈 7 nr
+宋慈圣 2 nr
+宋慧乔 3 nr
+宋慧娇 3 nr
+宋所赐 3 nr
+宋才潘面 3 nr
+宋承唐 3 nr
+宋承宪 3 nr
+宋承良 2 nr
+宋抗金 3 nr
+宋押司 23 nr
+宋振平 14 nr
+宋振瑜 16 nr
+宋振镇 2 nr
+宋改为 4 nr
+宋改河 2 nr
+宋政权 5 nr
+宋敏姐 3 nr
+宋敏忙 2 nr
+宋教仁 257 nr
+宋敬武 2 nr
+宋敬波 2 nr
+宋文公 2 nr
+宋文富 173 nr
+宋文帝 54 nr
+宋文治 4 nr
+宋文贵 7 nr
+宋文鉴 2 nr
+宋文鑫 16 nr
+宋斤鲁削 3 n
+宋新启 5 nr
+宋新妮 3 nr
+宋新宇 2 nr
+宋日昊 3 nr
+宋时战 2 nr
+宋时有 2 nr
+宋时轮 8 nr
+宋明 80 nr
+宋明之 3 nr
+宋明帝 4 nr
+宋明珠 4 nr
+宋明理学 3 nr
+宋星主 5 nr
+宋春丽 3 nr
+宋春华 2 nr
+宋春舫 3 nr
+宋晓军 4 nr
+宋晓冬 2 nr
+宋晓刚 3 nr
+宋晓娜 3 nr
+宋晓梦 2 nr
+宋晓梧 2 nrfg
+宋晓波 2 nr
+宋晓英 3 nr
+宋景德 3 nr
+宋景诗 9 nr
+宋有官 2 nr
+宋有烈 2 nr
+宋朝 734 t
+宋朝廷 12 nr
+宋末 5 t
+宋末元 9 nr
+宋朱熹 6 nr
+宋案 3 n
+宋梅村 2 nr
+宋楚瑜 31 nr
+宋欧阳修 2 nr
+宋武帝 11 nr
+宋武林 2 nr
+宋氏家族 6 nr
+宋水军 2 nr
+宋汉中 2 nr
+宋汉章 4 nr
+宋汉鄂 2 nr
+宋江 2862 nr
+宋江三 2 nr
+宋江东 2 nr
+宋江举 2 nr
+宋江久 2 nr
+宋江亦 5 nr
+宋江亲 4 nr
+宋江仁 2 nr
+宋江令 11 nr
+宋江众 5 nr
+宋江传 2 nr
+宋江依 7 nr
+宋江便 53 nr
+宋江先 8 nr
+宋江入 7 nr
+宋江全 2 nr
+宋江兵 7 nr
+宋江再 8 nr
+宋江军 9 nr
+宋江分 13 nr
+宋江则 2 nr
+宋江别 3 nr
+宋江劝 2 nr
+宋江勒 4 nr
+宋江升 5 nr
+宋江取 5 nr
+宋江只 5 nr
+宋江叫 9 nr
+宋江合 2 nr
+宋江名 2 nr
+宋江听 47 nr
+宋江告 4 nr
+宋江唤 6 nr
+宋江喝 5 nr
+宋江四 2 nr
+宋江回 7 nr
+宋江因 2 nr
+宋江坚 6 nr
+宋江备 5 nr
+宋江复 2 nr
+宋江夜 2 nr
+宋江央 3 nr
+宋江奏 7 nr
+宋江守 3 nr
+宋江定 3 nr
+宋江寨 10 nr
+宋江山 21 nr
+宋江差 7 nr
+宋江开 5 nr
+宋江引 20 nr
+宋江忙 4 nr
+宋江怒 2 nr
+宋江恰 2 nr
+宋江想 3 nr
+宋江执 3 nr
+宋江扶 4 nr
+宋江指 2 nr
+宋江掌 2 nr
+宋江接 2 nr
+宋江收 6 nr
+宋江教 26 nr
+宋江方 4 nr
+宋江早 2 nr
+宋江未 2 nr
+宋江本 2 nr
+宋江正 8 nr
+宋江求 2 nr
+宋江点 4 nr
+宋江知 3 nr
+宋江立 2 nr
+宋江站 2 nr
+宋江笑 13 nr
+宋江答 3 nr
+宋江纳 2 nr
+宋江背 4 nr
+宋江自 14 nr
+宋江若 2 nr
+宋江营 2 nr
+宋江著 2 nr
+宋江行 3 nr
+宋江见 43 nr
+宋江设 2 nr
+宋江诸 3 nr
+宋江谢 6 nr
+宋江赏 3 nr
+宋江起义 6 nr
+宋江转 2 nr
+宋江辞 3 nr
+宋江进 3 nr
+宋江遂 8 nr
+宋江道 15 nr
+宋江部 2 nr
+宋江锦 2 nr
+宋江问 2 nr
+宋江闻 9 nr
+宋江阵 29 nr
+宋江陪 4 nr
+宋江领 9 nr
+宋江马 4 nr
+宋江驱 2 nr
+宋江鸣 3 nr
+宋沈括 2 nr
+宋沿唐 8 nr
+宋沿江 2 nr
+宋沿边 2 nr
+宋法棠 3 nr
+宋浩波 2 nr
+宋润亚 3 nr
+宋淦鳌 2 nr
+宋淮西 3 nr
+宋淳化 2 nr
+宋清远 2 nr
+宋渔父 2 nr
+宋濂 64 nr
+宋灵州 3 nr
+宋点点 3 nr
+宋照肃 256 nr
+宋燕肃 4 nr
+宋献策 1220 nr
+宋玉东墙 3 nr
+宋玉所 3 nr
+宋玉梅 9 nr
+宋王弼 2 nr
+宋理宗 32 nr
+宋瑞祥 2 nr
+宋用兵 3 nr
+宋画吴冶 3 nr
+宋畏晋 2 nr
+宋登科 2 nr
+宋白 5 nr
+宋皇帝 14 nr
+宋真宗 78 nr
+宋知夏 2 nr
+宋礼修 2 nr
+宋祁 14 nr
+宋祖德 3 nr
+宋祖英 2 nr
+宋神宗 110 nr
+宋福春 3 nr
+宋秀岩 3 nr
+宋秋山 3 nr
+宋立杰 3 nr
+宋童贯 2 nr
+宋端宗 3 nr
+宋等国 2 nr
+宋素卿 4 nr
+宋红巾 2 nr
+宋绍兴 8 nr
+宋绍华 2 nr
+宋美英 3 nr
+宋美龄 84 nr
+宋老儿 2 nr
+宋臣民 4 nr
+宋至明 2 nr
+宋至清 2 nr
+宋良民 2 nr
+宋艳青 2 nr
+宋芳蓉 4 nr
+宋英宗 15 nr
+宋范晔 3 nr
+宋荆襄 3 nr
+宋裴松 2 nr
+宋襄公 19 nr
+宋西安 5 nr
+宋解放 44 nr
+宋词 97 nr
+宋诗 29 nr
+宋诗别 4 nr
+宋诗钞 6 nr
+宋诸军 2 nr
+宋豪杰 2 nr
+宋赠封 2 nr
+宋起凤 3 nr
+宋辽二 2 nr
+宋辽夏 2 nr
+宋辽金 9 nr
+宋辽间 2 nr
+宋达成 3 nr
+宋远桥 215 nr
+宋连友 2 nr
+宋连峰 3 nr
+宋连辉 2 nr
+宋道安 9 nr
+宋邓名 3 nr
+宋郑文 2 nr
+宋郭茂 3 nr
+宋都开 2 nr
+宋重修 3 nr
+宋金人 2 nr
+宋金元 10 nr
+宋金刚 5 nr
+宋金明 21 nr
+宋钟国 3 nr
+宋钦宗 29 nr
+宋长志 3 nr
+宋长老 54 nr
+宋门关 2 nr
+宋阵里 7 nr
+宋陈吴 7 nr
+宋陈师 4 nr
+宋陈振 3 nr
+宋降军 2 nr
+宋降臣 3 nr
+宋隆济 6 nr
+宋集村 3 nr
+宋霭龄 3 nr
+宋青书 229 nr
+宋颖仪 93 nr
+宋马令 2 nr
+宋高宗 88 nr
+宋鱼水 3 nr
+宋鸿钊 2 nr
+宋鹏飞 21 nr
+宋黎辉 3 nr
+宋齐梁 4 nr
+完 13042 v
+完事 57 v
+完事大吉 6 i
+完井法 2 nr
+完井测试 3 i
+完亚冠 4 nr
+完全 15627 ad
+完全一致 3 i
+完全保密 3 nr
+完全免费 3 n
+完全变态 3 l
+完全叶 3 nr
+完全同意 3 i
+完全域 3 nr
+完全安装 3 nz
+完全小学 5 l
+完全彻底 3 i
+完全必要 3 l
+完全性 27 n
+完全恢复 40 i
+完全正确 3 i
+完全气体 3 i
+完全版 3 n
+完全相同 3 i
+完全符合 3 i
+完全缓解 3 i
+完全肥料 3 i
+完全避免 3 l
+完卵 3 v
+完名全节 3 i
+完善 8085 v
+完善化 4 nr
+完城旦 6 nr
+完备 958 v
+完备化 3 n
+完备无缺 3 i
+完好 918 a
+完好如新 3 a
+完好性 6 a
+完好无恙 4 i
+完好无损 64 i
+完好无缺 12 i
+完好率 3 a
+完婚 300 v
+完完全全 36 i
+完完整整 8 z
+完密 3 ad
+完小 14 a
+完工 580 v
+完工后 3 l
+完形 58 v
+完形填空 3 i
+完戏 3 v
+完成 16365 v
+完成使命 3 i
+完成学业 3 l
+完成度 3 l
+完成率 258 n
+完成百分 3 l
+完扬声 2 i
+完整 4142 a
+完整包 3 i
+完整型 3 n
+完整如新 3 i
+完整性 123 n
+完整性检查 2 n
+完整拼音 3 i
+完整无损 3 i
+完整无缺 3 i
+完整权 3 n
+完整版 3 n
+完整篇 3 n
+完整系 3 n
+完档 3 v
+完毕 1336 v
+完泽笃 2 nr
+完浚 3 v
+完满 47 v
+完满数 3 i
+完满无缺 3 i
+完满核 3 nr
+完熟 3 a
+完璧 5 v
+完璧归赵 10 i
+完税 12 v
+完税价格 3 n
+完稿 24 v
+完稿员 3 n
+完竣 5 v
+完粮 3 v
+完粮完课 3 nr
+完结 106 v
+完结篇 3 i
+完美 1509 a
+完美主义 14 nz
+完美性 6 nr
+完美无瑕 2 i
+完美无疵 3 i
+完美无缺 50 i
+完美版 3 nz
+完聚 3 v
+完肤 3 v
+完胜 35 v
+完蛋 228 v
+完败 8 v
+完达山 15 nr
+完钻 3 a
+完颜 102 nrt
+完颜亮 12 nr
+完颜合 2 i
+完颜宗 12 nr
+完颜希 2 nr
+完颜康 143 nr
+完颜昌 11 nr
+完颜杲 3 nr
+完颜洪烈 3 nr
+完颜洪熙 26 nr
+完颜萍 204 nr
+完颜襄 4 nr
+完骨 3 v
+宏 793 n
+宏业 22 n
+宏东 3 n
+宏丽 12 a
+宏亮 21 a
+宏仁 3 nz
+宏代码 3 n
+宏伟 772 a
+宏伟事业 3 l
+宏伟区 3 l
+宏伟目标 3 l
+宏伟蓝图 3 vn
+宏儒 3 n
+宏儒硕学 3 vn
+宏兴 5 a
+宏利 2 nz
+宏单元 3 n
+宏博 2 nz
+宏命令 3 n
+宏国 3 n
+宏图 39 n
+宏图三胞 3 n
+宏图大展 3 nz
+宏图大志 2 nz
+宏基 35 nz
+宏壮 3 a
+宏大 581 a
+宏富 33 nz
+宏微观 3 n
+宏志 7 n
+宏志班 3 nz
+宏恩 2 n
+宏恩医院 3 n
+宏愿 26 n
+宏才大略 3 n
+宏扬 4 a
+宏文 7 nz
+宏旨 3 n
+宏智 3 n
+宏材大略 3 n
+宏村 19 n
+宏杨新城 3 nz
+宏构 2 n
+宏桥 2 n
+宏源 4 n
+宏源证券 3 n
+宏病毒 22 n
+宏硕 3 a
+宏碁 3 v
+宏福 4 nz
+宏程序 3 n
+宏观 1673 n
+宏观世界 12 n
+宏观决策 3 n
+宏观图 3 n
+宏观态 3 n
+宏观指导 3 n
+宏观控制 3 n
+宏观政策 3 n
+宏观物理 3 n
+宏观管理 3 n
+宏观经济 3 n
+宏观调控 3 n
+宏观调节 3 n
+宏观进化 3 n
+宏规 3 n
+宏詹 3 nrt
+宏论 21 n
+宏赡 3 n
+宏达 275 nz
+宏远 71 a
+宏远队 6 n
+宏道 9 n
+宏都拉斯 3 nz
+宏量 3 n
+宏阔 17 a
+宐 7 zg
+宑 15 zg
+宓 146 nr
+宓汝成 2 nr
+宓牟煌 2 nr
+宓牧俳 2 nr
+宓谋砻 2 nr
+宔 7 zg
+宕 205 g
+宕昌 2 nrt
+宕昌县 3 v
+宕机 3 nrt
+宗 3281 nr
+宗一朝 2 nr
+宗一郎 7 nr
+宗三僧 3 nr
+宗三朝 3 nr
+宗上元 2 nr
+宗上尊 3 nr
+宗与笃 2 nr
+宗为倡 2 nr
+宗为尧 2 nr
+宗为庐 3 nr
+宗为皇 3 nr
+宗主 61 n
+宗主国 69 n
+宗主权 44 n
+宗主汗 2 nr
+宗主爷 24 n
+宗主督 26 n
+宗乃立 2 nr
+宗之孙 3 nr
+宗之弟 4 nr
+宗之祖 3 nr
+宗乘胜 2 nr
+宗九族 2 nr
+宗乾元 5 nr
+宗乾宁 5 nr
+宗乾符 3 nr
+宗乾道 3 nr
+宗乾顺 2 nr
+宗二朝 2 nr
+宗云凡 2 nr
+宗亲 115 n
+宗亲会 3 nr
+宗人府 291 n
+宗仰 3 n
+宗任嵬 2 nr
+宗任皇 2 nr
+宗会 2 n
+宗会昌 6 nr
+宗体弱 3 nr
+宗元贞 5 nr
+宗兄 13 nr
+宗关 3 n
+宗列渠 5 nr
+宗刚毅 3 nr
+宗初亦 4 nr
+宗初祖 2 nr
+宗初立 3 nr
+宗务隆 5 nr
+宗匠 18 n
+宗发兵 2 nr
+宗古尔达克 2 nrt
+宗同族 9 nr
+宗和世 2 nr
+宗咸亨 3 nr
+宗咸通 5 nr
+宗咸雍 4 nr
+宗哥川 2 nr
+宗喀巴 59 nr
+宗四朝 5 nr
+宗图联 2 nr
+宗圣政 4 nr
+宗圣观 3 nr
+宗在文 2 nr
+宗地 3 n
+宗垒 6 n
+宗复奔 3 nr
+宗复封 2 nr
+宗夏位 2 n
+宗大为 2 nr
+宗大历 7 nr
+宗大德 11 nr
+宗大怒 5 nr
+宗天会 3 nr
+宗天复 4 nr
+宗天子 2 nr
+宗天顺 2 nr
+宗太公 2 nr
+宗姓 3 n
+宗婆罗 2 nr
+宗子 62 n
+宗子兄 6 nr
+宗子嗣 3 nr
+宗子维 2 nr
+宗学 3 n
+宗学哲 2 nr
+宗宋派 2 nr
+宗完颜 15 nr
+宗宝庆 3 nr
+宗室 943 n
+宗崇信 3 nr
+宗崇宁 6 nr
+宗师 126 n
+宗师案临 3 nt
+宗庙 262 nr
+宗庙丘墟 3 n
+宗庙社稷 3 nr
+宗废太子 2 nr
+宗废德 2 nr
+宗废王 2 nr
+宗废耶 2 nr
+宗建中 4 nr
+宗建炎 6 nr
+宗弘历 15 nr
+宗弟 3 n
+宗弟七 2 nr
+宗微觉 3 nr
+宗忠简 4 nr
+宗惊忧 3 nr
+宗戚 6 n
+宗戚勋 3 nr
+宗拖雷 2 nr
+宗授 2 n
+宗改定 2 nr
+宗政 2 n
+宗敏先 2 nr
+宗敏又 3 nr
+宗敏见 2 nr
+宗教 5982 n
+宗教事务 3 n
+宗教仪式 3 n
+宗教信仰 3 n
+宗教剧 3 n
+宗教史 36 n
+宗教团体 3 n
+宗教地理 3 n
+宗教学 55 n
+宗教局 3 n
+宗教建筑 3 n
+宗教徒 14 nr
+宗教性 23 n
+宗教改革 3 nr
+宗教政策 3 n
+宗教法 5 n
+宗教法庭 3 n
+宗教画 15 n
+宗教界 66 n
+宗教自由 3 n
+宗教观 8 n
+宗教音乐 3 n
+宗文皇帝 2 nr
+宗方 10 n
+宗族 358 n
+宗族势力 3 n
+宗族社会 3 n
+宗旨 1350 n
+宗明昌 2 nr
+宗春山 3 nr
+宗显庆 10 nr
+宗显德 3 nr
+宗景云 7 nr
+宗景龙 3 nr
+宗曾命 2 nr
+宗朱厚 264 nr
+宗朱祁 7 nr
+宗朱翊 17 nr
+宗李乾 13 nr
+宗李旦 3 nr
+宗李显 9 nr
+宗李治 16 nr
+宗李炎 3 nr
+宗李谅 11 nr
+宗李适 4 nr
+宗正 10 nr
+宗正卿 2 nr
+宗正寺 2 nr
+宗正德 2 nr
+宗正秩 3 nr
+宗毛 2 n
+宗气 4 n
+宗永庆 2 nr
+宗永徽 8 nr
+宗永泰 5 nr
+宗永福 2 nr
+宗治平 2 nr
+宗法 242 n
+宗法制度 3 n
+宗法社会 3 nt
+宗法观念 3 n
+宗泽入 2 nr
+宗泽因 2 nr
+宗派 349 n
+宗派主义 98 n
+宗派性 3 n
+宗海山 2 nr
+宗清宁 2 nr
+宗演 2 n
+宗炎 5 n
+宗王居 2 nr
+宗王昔 6 nr
+宗王皇后 3 nr
+宗白华 7 nr
+宗皇帝 21 nr
+宗盛唐 2 nr
+宗知州 2 nr
+宗社 55 n
+宗社籍 2 n
+宗祖乙 2 nr
+宗祖神 3 nr
+宗神 18 n
+宗祠 38 nr
+宗祧 6 n
+宗福才 2 nr
+宗程朱 2 nr
+宗立派 9 nr
+宗素知 3 nr
+宗紫文 2 nr
+宗纳土 2 nr
+宗纳女 2 nr
+宗绍兴 8 nr
+宗统 8 n
+宗维侠 53 nr
+宗耶律 13 nr
+宗耶律洪 2 nr
+宗耶律隆 14 nr
+宗至澶 2 nr
+宗至玄 2 nr
+宗英雄 2 nr
+宗藩封 3 nr
+宗被武 3 nr
+宗讳蒙 2 nr
+宗论 3 n
+宗设朝 2 nr
+宗设格 2 nr
+宗诏礼 2 nr
+宗诗文 2 nr
+宗调露 2 nr
+宗谱 16 n
+宗谱学 2 n
+宗谷 5 n
+宗贞元 11 nr
+宗赐皇后 2 nr
+宗赞王子 18 nr
+宗赵佶 6 nr
+宗赵恒 2 nr
+宗赵构 18 nr
+宗赵桓 2 nr
+宗赵煦 3 nr
+宗达光 3 nr
+宗道 2 n
+宗道君 2 nr
+宗金鉴 4 nr
+宗铁穆 32 nr
+宗铁穆耳 2 nr
+宗长兴 5 nr
+宗雄双 2 nr
+宗靖康 2 nr
+宗麟德 2 nr
+宗龙朔 4 nr
+官 12197 n
+官一旦 2 nr
+官一齐 3 nr
+官不易方 3 n
+官为民 3 nr
+官乃正 2 nr
+官之盛 2 nr
+官书 3 n
+官事 24 n
+官人 430 n
+官仓老鼠 3 n
+官价 32 n
+官伊本 3 ns
+官传序 2 n
+官传旨 4 nr
+官位 264 n
+官佐 15 nr
+官保官 2 n
+官修政 2 nr
+官修方 2 nr
+官修日 2 n
+官修谱 2 nr
+官俸 3 n
+官俸常 3 nr
+官俸料 2 nr
+官倒 23 n
+官偪民反 3 vn
+官僚 1034 n
+官僚主义 206 n
+官僚主义者 6 n
+官僚习气 3 n
+官僚作风 3 l
+官僚化 13 n
+官僚政治 3 n
+官僚机构 3 n
+官僚派 3 n
+官僚资产 3 l
+官僚资本 152 l
+官僚资本主义 36 n
+官僚资本家 2 l
+官僧录 2 nr
+官儿 376 n
+官充馆 2 n
+官光禄 2 nr
+官克瑞 8 nr
+官公卿 3 nr
+官公宇 2 nr
+官公田 3 nr
+官六卿 3 nr
+官兵 2948 n
+官兵一致 3 i
+官兵们 223 n
+官兵关系 3 n
+官内臣 2 n
+官军 2103 n
+官冢宰 3 nr
+官冯锡 2 nr
+官凯文 3 nr
+官刘军 3 nr
+官制 247 n
+官办 93 n
+官功曹 2 nr
+官势 3 n
+官勋戚 2 nr
+官化 2 n
+官卑职小 3 n
+官占田 3 nr
+官印 46 n
+官厅 42 n
+官厅水库 12 nz
+官原品 2 n
+官召郭 2 nr
+官史 3 n
+官右宣 2 nr
+官司 503 n
+官名 151 n
+官吏 2102 n
+官吴革 2 nr
+官员 8591 n
+官品 7 n
+官品高 3 n
+官哥儿 2 nr
+官商 55 n
+官商勾结 3 i
+官园 5 n
+官地 9 n
+官场 603 n
+官场如戏 3 l
+官场礼貌 3 n
+官复原职 25 n
+官多法乱 3 l
+官大呼 2 nr
+官大官 3 nr
+官大权 2 nr
+官太医 2 nr
+官太后 2 nr
+官太太 3 nr
+官奴 3 n
+官子 11 n
+官学化 2 n
+官宁致 2 nr
+官宋隆 3 nr
+官宗伯 3 nr
+官官相为 3 nr
+官官相卫 3 nr
+官官相护 8 nr
+官官纤维 3 l
+官审录 2 n
+官客 3 n
+官宦 110 n
+官家 1230 n
+官家传 3 nr
+官家先 4 nr
+官家可 3 nr
+官家圣 2 nr
+官家奏 3 nr
+官家恩 2 nr
+官家真 2 nr
+官家赐 5 nr
+官家进 2 nr
+官容儿 3 nr
+官寨 104 n
+官封弼 3 nr
+官小吏 3 nr
+官小职 2 nr
+官小辅 2 nr
+官尚方 2 nr
+官尤持 3 nr
+官尹光 7 nr
+官居礼 2 nr
+官属 3 n
+官山 538 ns
+官川 2 n
+官差 43 n
+官帽 3 n
+官干政 2 n
+官庄村 3 nr
+官庄省 2 ns
+官庄镇 3 nr
+官库 3 n
+官应震 3 nr
+官店 3 n
+官府 1197 n
+官府菜 3 n
+官廷 3 n
+官归田 3 nr
+官征官 2 nr
+官征赋 2 nr
+官御史 6 n
+官恰恰 2 nr
+官情纸薄 3 i
+官意 3 n
+官戴铣 3 nr
+官房 10 n
+官房长 2 n
+官房长官 18 n
+官报 12 n
+官报私仇 3 i
+官拜 3 ns
+官拜上卿 3 nr
+官拜宁 3 nr
+官授鲁 2 nr
+官掌诏 4 nr
+官方 1748 n
+官方主页 3 n
+官方人士 3 n
+官方消息 3 n
+官方版 3 n
+官方站点 3 n
+官方网 3 n
+官方网站 2 n
+官方论坛 3 n
+官方语言 3 n
+官无禄 5 nr
+官时隐 2 nr
+官晋爵 11 nr
+官晋秩 2 nr
+官景州 2 nr
+官有权 16 n
+官服 159 n
+官朗声 4 nr
+官朝贺 16 nr
+官本位 17 n
+官架子 9 n
+官校 3 n
+官样 3 n
+官样文章 23 nr
+官桥 2 n
+官桥湖 3 nr
+官检校 2 n
+官模样 3 l
+官止神行 3 n
+官步 3 n
+官民 16 n
+官民田 2 n
+官气 19 n
+官汉儿 2 nr
+官治政 2 n
+官派 3 n
+官渡 50 nr
+官渡之战 27 nz
+官渡区 3 n
+官湖 2 n
+官潘基 4 nr
+官爵 119 n
+官王振 3 nr
+官理 4 n
+官田 72 n
+官田地 4 n
+官田律 2 nr
+官田湖 256 nr
+官田赐 2 nr
+官田达 2 nr
+官田额 3 n
+官瘾 5 n
+官皆乐 3 nr
+官监 2 n
+官监掌 2 nr
+官监甲 2 nr
+官督商 18 n
+官禄 9 nr
+官禄田 3 nr
+官禄马 2 nr
+官私合营 3 n
+官科 2 n
+官秩品 3 nr
+官称 3 n
+官窑 49 n
+官纱 3 n
+官纳言 2 nr
+官绅 257 n
+官置吏 4 nr
+官署 615 n
+官翁波 4 nr
+官翰林 4 nr
+官老爷 29 nr
+官职 1042 n
+官股 19 n
+官胥吏 2 nr
+官能 47 n
+官能单体 3 n
+官能团 71 n
+官能症 3 n
+官腔 21 n
+官腔官调 3 n
+官至兵 3 nr
+官至怀 2 nr
+官至礼 3 nr
+官舍 10 n
+官舱 3 n
+官船 3 n
+官范琼 2 nr
+官茶行 2 nr
+官营 49 n
+官蕊官 2 nr
+官薛昂 2 nr
+官藕官 2 nr
+官虎吏狼 3 nr
+官蛇节 2 n
+官融州 2 nr
+官衔 133 n
+官衙 56 n
+官袍 3 n
+官西蒙 3 nr
+官觉 3 n
+官议允 3 nr
+官词 3 n
+官话 619 n
+官请法正 3 nr
+官调 3 n
+官费 11 n
+官费生 5 n
+官赞礼 3 nr
+官路 22 n
+官轻势微 3 i
+官载师 2 nr
+官轿 3 n
+官运 29 n
+官运亨通 30 nr
+官运官 19 n
+官进禄 2 nr
+官迷 6 n
+官逼民反 22 i
+官道 116 n
+官道傍 4 nr
+官道沟 4 nr
+官邮 3 ns
+官邸 135 n
+官镇东 2 nr
+官长 37 n
+官闻言 2 n
+官阶 72 n
+官陈永 2 nr
+官震肃 2 nr
+官面 24 n
+官饷 3 n
+官马 3 n
+官高爵 4 nr
+官黄友 3 n
+官黄澍 4 nr
+官龄 2 n
+宙 56 zg
+宙斯 305 nrt
+定 15882 v
+定下 297 v
+定下去 3 l
+定业 3 n
+定中结构 3 l
+定为 1060 v
+定义 1823 n
+定义出 3 n
+定义域 51 n
+定义数据 3 n
+定义新 2 ns
+定义方法 3 n
+定义明确 3 n
+定义语言 3 n
+定乱扶衰 3 l
+定乾坤 3 nz
+定于 255 v
+定于一尊 6 l
+定产 3 vn
+定亲 43 n
+定人 3 n
+定价 603 n
+定价权 13 n
+定价表 3 l
+定会 3 n
+定位 1650 n
+定位仪 15 n
+定位克隆 3 n
+定位器 10 n
+定位导航 3 n
+定位平面 3 n
+定位点 5 n
+定位球 39 n
+定位精度 2 n
+定位系统 10 l
+定位问题 2 n
+定住 3 v
+定作 4 vn
+定例 11 n
+定倾扶危 3 n
+定做 73 v
+定兴 12 b
+定兴县 4 ns
+定军山 28 ns
+定冠词 4 n
+定准 5 n
+定出 104 v
+定刑 3 n
+定则 71 n
+定制 324 v
+定力 45 n
+定势 70 n
+定单 74 n
+定单号 3 n
+定南 10 ns
+定南县 3 ns
+定南针 3 n
+定压 3 n
+定压比热 3 l
+定县 54 ns
+定名 291 v
+定向 860 n
+定向井 3 n
+定向仪 3 n
+定向克隆 3 b
+定向分配 2 l
+定向力 3 n
+定向反应 3 l
+定向吸附 3 n
+定向培养 23 l
+定向培育 3 l
+定向天线 4 n
+定向微扰 3 l
+定向招生 23 n
+定向操作符 5 l
+定向测序 3 n
+定向生 50 n
+定向胞腔 3 n
+定向药包 3 n
+定向诱变 3 nz
+定向进化 3 l
+定向选择 3 l
+定向钻井 3 n
+定员 26 n
+定国安邦 3 ns
+定场白 3 v
+定场诗 3 n
+定址 3 n
+定址法 3 n
+定型 416 b
+定型化 13 v
+定型机 3 n
+定型细胞 3 n
+定夺 128 v
+定好 3 d
+定妆 3 v
+定婚 7 v
+定子 37 n
+定存 3 v
+定安 12 ns
+定安县 4 ns
+定安里 2 ns
+定定 3 d
+定将 3 d
+定局 138 n
+定居 829 v
+定居点 59 n
+定居者 7 n
+定岗 11 ns
+定州 67 ns
+定州市 15 ns
+定常 39 d
+定常流动 3 l
+定常约束 3 vn
+定幅 3 d
+定座 8 n
+定式 44 n
+定弦 51 n
+定当 3 d
+定形 74 n
+定形机 3 n
+定影 12 n
+定影剂 3 n
+定影液 3 n
+定影膜 3 n
+定律 1417 n
+定心 29 n
+定心丸 37 n
+定心骨 3 n
+定性 309 n
+定性分析 38 l
+定性处理 3 l
+定性描述 3 n
+定息 24 n
+定情 3 n
+定情之物 3 l
+定惊 9 v
+定慧寺 6 ns
+定房 3 n
+定持 3 v
+定指 2 n
+定数 79 n
+定日 21 n
+定日县 4 ns
+定时 292 d
+定时器 13 l
+定时开关 3 l
+定时炸弹 46 l
+定时装置 3 n
+定时钟 3 l
+定有 3 v
+定期 1389 vn
+定期存单 3 n
+定期存款 3 l
+定期检查 2 n
+定期检验 3 n
+定期维护 4 v
+定期集市 3 n
+定本 3 n
+定林寺 6 ns
+定标 8 n
+定标器 3 n
+定格 91 n
+定案 45 n
+定植 20 v
+定步酶 3 l
+定死 3 v
+定死无疑 3 l
+定法 3 n
+定洋 3 ns
+定活两便 3 l
+定海 36 ns
+定海区 3 ns
+定海县 3 ns
+定海神针 12 n
+定温 3 n
+定滑轮 9 n
+定点 257 n
+定点医院 3 n
+定点数 3 n
+定点诱变 3 nz
+定点转动 3 l
+定然 716 d
+定然如此 3 l
+定率 3 n
+定理 596 vn
+定界 3 n
+定界符 2 n
+定盘星 5 n
+定相 3 d
+定省 3 ns
+定睛 189 n
+定睛一看 3 l
+定碳 3 n
+定碳杯 3 n
+定礼 3 n
+定神 99 n
+定神一看 3 l
+定票 3 n
+定福庄 3 ns
+定稿 70 n
+定窑 18 n
+定粮 3 n
+定约 46 d
+定级 21 b
+定线 7 n
+定结 3 v
+定结县 3 ns
+定结构 19 n
+定给 3 vn
+定编 22 v
+定罪 119 vn
+定置 3 vn
+定职 3 v
+定聚 3 v
+定能 3 v
+定色剂 3 n
+定苗 3 n
+定补面 3 l
+定装 3 v
+定襄 42 ns
+定襄县 5 ns
+定西 49 ns
+定西地区 4 ns
+定西市 3 ns
+定西路 3 ns
+定要 3 b
+定见 20 v
+定规 28 vn
+定计 48 vn
+定论 257 n
+定评 3 v
+定语 45 n
+定调 7 v
+定责 5 v
+定货 41 n
+定货会 3 l
+定货单 2 n
+定货量 3 n
+定购 86 v
+定购价 3 n
+定购粮 3 n
+定身法 3 n
+定轴转动 3 l
+定边 35 d
+定边县 7 ns
+定远 182 d
+定远县 3 ns
+定速巡航 3 nz
+定造 14 v
+定逸 3 v
+定都 214 d
+定都于 3 n
+定都在 3 n
+定量 393 n
+定量供应 3 l
+定量分析 100 l
+定量化 30 n
+定量配给 3 n
+定金 84 n
+定销 3 vn
+定长 3 n
+定阔曲线 3 n
+定阶 2 n
+定陵 37 ns
+定陶 36 vn
+定陶县 3 ns
+定静师太 3 n
+定非 3 d
+定音 25 n
+定音鼓 23 n
+定额 455 n
+定额管理 3 n
+定风波 3 n
+定鼎 27 n
+宛 241 nr
+宛似 19 v
+宛似中 2 nr
+宛似化 2 nr
+宛似御 2 nr
+宛似死 2 nr
+宛似白 2 nr
+宛似醉 2 nr
+宛名驹 2 nr
+宛国贰 2 nr
+宛城 46 ns
+宛城区 4 ns
+宛如 1025 v
+宛子城 4 nr
+宛州 33 ns
+宛平南 2 ns
+宛平县 18 ns
+宛平城 9 ns
+宛服 2 v
+宛然 114 nr
+宛王 2 nrt
+宛良马 4 nr
+宛若 73 nr
+宛蜒行进 3 vn
+宛西 37 ns
+宛西战役 3 nr
+宛财 2 v
+宛转 64 v
+宛转悠扬 3 nr
+宛转蛾眉 3 v
+宛马 3 ns
+宜 3533 vg
+宜丰 2 ns
+宜丰县 3 ns
+宜于 178 v
+宜于设防 3 nr
+宜人 236 nrt
+宜体朕 2 nr
+宜兰 65 ns
+宜兰人 3 nrt
+宜兰县 19 ns
+宜兰县长 3 nr
+宜兰市 4 ns
+宜兰旧 2 ns
+宜兰雨 2 nr
+宜兴 413 ns
+宜兴人 16 nr
+宜兴县 10 ns
+宜兴市 14 ns
+宜农 16 nz
+宜加崇 2 nr
+宜县 3 ns
+宜古宜今 3 nr
+宜君 3 nr
+宜君县 3 ns
+宜善防 2 nr
+宜喜宜嗔 3 v
+宜嗔宜喜 3 v
+宜城 548 ns
+宜城亭 4 nr
+宜城县 3 ns
+宜城市 257 ns
+宜城镇 4 ns
+宜多吃 3 nr
+宜宁 3 ns
+宜守宜 3 nr
+宜安 3 ns
+宜室宜家 3 nr
+宜家 8 ns
+宜家宜室 3 nr
+宜宾 157 ns
+宜宾县 7 ns
+宜宾市 11 ns
+宜居 56 ns
+宜居城市 3 ns
+宜山 24 ns
+宜山路 3 ns
+宜川 13 ns
+宜川县 2 ns
+宜州 2 ns
+宜州华 3 ns
+宜州市 4 ns
+宜市 3 ns
+宜必思 57 nr
+宜昌 5336 ns
+宜昌县 11 ns
+宜昌峡 3 ns
+宜昌市 2858 ns
+宜昌橙 3 nr
+宜春 36 ns
+宜春市 11 ns
+宜林 14 ns
+宜林地 18 ns
+宜林宜 2 nr
+宜清利 5 ns
+宜清营 2 nr
+宜温阳 3 ns
+宜章 4 nr
+宜章县 3 ns
+宜置戍 2 nr
+宜耕宜 2 nr
+宜良 10 nr
+宜良县 3 ns
+宜辛凉 5 nr
+宜辛温 3 nr
+宜都 806 ns
+宜都市 256 ns
+宜阳 56 ns
+宜阳县 7 ns
+宜黄 271 ns
+宜黄县 3 ns
+宝 4496 nr
+宝业 256 n
+宝严寺 4 nr
+宝丫头 21 nr
+宝中之宝 3 nr
+宝中铁路 2 nz
+宝丰 34 nz
+宝丰县 10 nr
+宝二叔 2 nr
+宝二爷 70 nr
+宝云塔 2 nr
+宝云龙 2 nr
+宝亲王 3 nr
+宝位 3 n
+宝佩如 3 nr
+宝元队 7 nr
+宝兄弟 6 nr
+宝光国 11 nr
+宝光寺 3 nr
+宝光莹 2 nr
+宝兰二线 3 nz
+宝兰线 3 nz
+宝兴 4 nr
+宝兴县 4 ns
+宝典 133 nr
+宝冢 3 nrt
+宝刀 584 n
+宝刀不老 7 i
+宝刀未老 2 nr
+宝利通 3 nr
+宝刹 35 nr
+宝剑 861 nr
+宝剑锋 3 nr
+宝力道 5 nr
+宝匣 2 ns
+宝华 2 nz
+宝华山 4 nr
+宝卷 2 nz
+宝历 3 nz
+宝叔房 2 nr
+宝古斋 3 nr
+宝号 14 n
+宝和珍 2 nr
+宝哥儿 6 nr
+宝器 30 n
+宝地 57 n
+宝坻 15 ns
+宝坻区 3 ns
+宝坻县 10 ns
+宝塔 201 nr
+宝塔区 3 nr
+宝塔山 11 nr
+宝塔式 2 nr
+宝塔形 6 nr
+宝塔菜 3 nr
+宝大祥 3 nr
+宝天曼 7 nr
+宝妹妹 6 nr
+宝姐姐 45 nr
+宝子碑 4 nr
+宝安 51 nr
+宝安区 11 ns
+宝安县 14 ns
+宝宝 301 nr
+宝宝版 3 nz
+宝宝秀 3 nr
+宝宝网 3 nr
+宝密圣 9 nr
+宝尾岛 3 nr
+宝山 74 nr
+宝山区 18 ns
+宝山实 2 nr
+宝山校 2 nr
+宝山空回 3 nr
+宝山路 3 nz
+宝山钢铁总厂 29 nt
+宝岛 22 ns
+宝常亦 2 nr
+宝常齐 2 nr
+宝平水 2 nr
+宝庆寺 2 nr
+宝庆府 2 nr
+宝库 763 nz
+宝应 116 n
+宝应县 6 nr
+宝座 528 nz
+宝成线 2 nz
+宝成铁路 3 nz
+宝授真 2 nr
+宝文堂 4 nr
+宝文阁 3 nr
+宝日 2 nz
+宝日吉 4 nr
+宝时捷 2 nr
+宝旺旺 2 nr
+宝月楼 10 nr
+宝杖 5 n
+宝来车 3 n
+宝林 7 nr
+宝林寺 8 nr
+宝柱刚 2 nr
+宝柱妈 39 nr
+宝树举 2 nr
+宝树唤 2 nr
+宝树大师 6 nr
+宝树微微 4 nr
+宝树王 22 nr
+宝树笑 2 nr
+宝树见 5 nr
+宝格丽 3 nr
+宝殿 11 nr
+宝殿非 2 nr
+宝气 3 n
+宝泉局 2 nr
+宝泉岭 3 nr
+宝洁 57 nr
+宝洁公司 13 n
+宝津楼 4 nr
+宝海 256 ns
+宝清 8 nr
+宝清县 3 nr
+宝源局 2 nt
+宝源祥 3 nr
+宝物 342 n
+宝特瓶 3 nr
+宝玉 3911 nr
+宝玉石 3 nr
+宝珍斋 2 nr
+宝珍珠 2 nr
+宝珠 71 nr
+宝珠寺 11 nr
+宝珠市饼 3 n
+宝珠笔 3 nr
+宝琉璃 2 nr
+宝琳娜 2 nr
+宝瓶 150 nr
+宝瓶口 10 n
+宝瓶座 13 nz
+宝生舞 3 nr
+宝盆 2 n
+宝盒 153 n
+宝盖 3 nr
+宝盖儿 3 nr
+宝盖头 3 nr
+宝相寺 3 nr
+宝相精 2 nr
+宝相花 2 nr
+宝眷 24 n
+宝石 624 nr
+宝石商 3 nr
+宝石花 3 nr
+宝石蓝 3 nr
+宝祥号 2 nr
+宝积宾 4 nr
+宝窟 2 n
+宝箱 3 n
+宝籍 2 n
+宝网 6 nz
+宝者 3 n
+宝船 8 n
+宝莱纳 2 nr
+宝莲寺 5 nr
+宝莲灯 14 nr
+宝莲盖 2 nr
+宝蓝 9 nr
+宝蓝色 12 nr
+宝蕴楼 2 nr
+宝藏 298 nr
+宝衣 3 n
+宝视通 3 nz
+宝象 54 n
+宝象和尚 3 nr
+宝象国 7 nr
+宝象怒 4 nr
+宝象笑 3 nr
+宝贝 1073 nr
+宝贝儿 29 nr
+宝贝儿子 3 nz
+宝贝女儿 3 nr
+宝贝孙女 3 nr
+宝贝孙子 3 nr
+宝贝心肝 3 nz
+宝贝疙瘩 6 nr
+宝货 48 n
+宝贵 1041 nr
+宝贵意见 3 nr
+宝贵时间 3 nr
+宝贵机会 3 nr
+宝贵财富 3 nr
+宝轮 3 nz
+宝通 2 nz
+宝通寺 2 nr
+宝鉴 5 nr
+宝钗亦 4 nr
+宝钗因 2 nr
+宝钗姊妹 8 nr
+宝钗宝 2 nr
+宝钗宝玉 4 nr
+宝钗心 2 nr
+宝钗忙 4 nr
+宝钗房 4 nr
+宝钗探 2 nr
+宝钗方 5 nr
+宝钗李 2 nr
+宝钗正 2 nr
+宝钗沉 2 nr
+宝钗笑 87 nr
+宝钗素 5 nr
+宝钗见 6 nr
+宝钗进 2 nr
+宝钗香 2 nr
+宝钗黛 5 nr
+宝钞库 9 nr
+宝钢 53 nr
+宝钢股份 6 nz
+宝钢集团 4 nt
+宝铜铃 2 nz
+宝镜 11 nz
+宝镜空 2 nr
+宝阁珍 2 nr
+宝音 4 n
+宝音德力格尔 2 ns
+宝顶山 8 nr
+宝顺行 2 nr
+宝马 292 nr
+宝马新 3 nr
+宝马车 3 nr
+宝马香车 4 nz
+宝鸡 188 n
+宝鸡县 7 ns
+宝鸡峡 8 nr
+宝鸡市 35 ns
+宝龙中心 3 nr
+实 7258 n
+实不相 3 d
+实不相瞒 3 l
+实与有力 3 n
+实业 810 n
+实业公司 3 n
+实业家 71 n
+实业界 13 n
+实业计划 3 n
+实业部 7 n
+实业银行 3 nt
+实业集团 3 n
+实为 402 v
+实为个人 3 l
+实乃 106 v
+实习 1023 v
+实习医生 3 n
+实习员 2 n
+实习期 32 n
+实习生 321 n
+实习课 3 n
+实事 572 n
+实事求是 1011 n
+实于名归 3 i
+实交 3 v
+实付 3 v
+实价 18 n
+实体 725 n
+实体书 3 n
+实体化 6 vn
+实体图 3 n
+实体墙 3 n
+实体店 3 n
+实体性 8 n
+实体模型 4 n
+实体法 29 n
+实体类 3 vn
+实体线 3 n
+实体肿瘤 3 l
+实体规划 3 l
+实体词 3 n
+实体镜 3 n
+实例 312 n
+实例教程 3 l
+实修 3 v
+实偪处此 3 l
+实像 14 v
+实兵 3 n
+实兵演习 3 n
+实兵演练 3 n
+实况 158 n
+实况录像 3 n
+实况报导 3 n
+实况足球 3 n
+实况转播 3 l
+实出无奈 3 i
+实则 242 n
+实利 49 n
+实到 27 v
+实到人数 3 l
+实力 5304 n
+实力型 4 n
+实力政策 3 n
+实力比 3 n
+实力派 82 n
+实力统计 3 l
+实力股 3 n
+实力雄厚 3 l
+实务 209 n
+实务性 3 n
+实劲 4 v
+实参 3 n
+实发 3 v
+实名 58 v
+实名制 23 n
+实告 3 n
+实因 3 n
+实在 7557 v
+实在太 3 n
+实在性 3 n
+实在是高 3 l
+实在论 41 n
+实在话 54 n
+实地 422 n
+实地址 3 n
+实地考察 3 n
+实地调查 44 l
+实坪 3 n
+实型 3 n
+实增 3 v
+实处 78 d
+实多 3 d
+实姓 3 n
+实字 3 n
+实存 3 v
+实存状态 3 l
+实学 3 n
+实定 3 d
+实实 3 d
+实实在 2 z
+实实在在 457 z
+实实地 6 z
+实寄封 6 n
+实将 3 d
+实小 3 d
+实属 202 n
+实属无奈 3 l
+实干 101 n
+实干型 3 n
+实干家 23 n
+实干精神 3 i
+实底 3 d
+实弹 102 n
+实弹射击 71 n
+实弹演习 3 n
+实录 646 v
+实得 3 v
+实得分数 3 n
+实德 284 n
+实德俱乐部 38 nt
+实德系 3 n
+实德队 277 n
+实心 96 n
+实心体 3 n
+实心实意 20 l
+实心弹 3 n
+实心球 2 n
+实心眼儿 4 l
+实心砖 3 n
+实情 370 n
+实情实理 3 l
+实惠 294 vn
+实意 3 v
+实感 32 n
+实战 678 v
+实战演习 3 n
+实战篇 3 n
+实战经验 3 n
+实战论坛 3 n
+实才 3 n
+实打实 46 i
+实报 3 n
+实报实销 2 l
+实招 29 n
+实据 27 n
+实支 3 n
+实收 33 v
+实政 3 n
+实效 262 v
+实效性 29 n
+实数 204 n
+实施 10713 v
+实施办法 3 n
+实施变 16 v
+实施变迁 3 i
+实施方案 3 n
+实施细则 3 n
+实施者 16 n
+实施规划 3 n
+实无 3 v
+实时 360 d
+实时处理 11 l
+实时性 14 n
+实时控制 8 n
+实时操作系统 8 l
+实时监控程序 2 n
+实是 3 d
+实景 42 n
+实景图 3 n
+实景拍摄 3 i
+实有 199 v
+实有其事 3 i
+实木 3 n
+实木门 3 n
+实权 297 n
+实枪 3 n
+实枪实弹 3 n
+实枪演习 3 n
+实枪演练 3 n
+实样 3 d
+实根 3 n
+实沉 3 v
+实测 93 v
+实测值 7 n
+实测距离 3 n
+实焦点 3 n
+实然 3 d
+实物 821 n
+实物券 3 n
+实物图 3 n
+实物图片 3 n
+实物地租 43 n
+实物展 2 n
+实物性 3 n
+实物税 12 n
+实物量 2 n
+实现 15301 v
+实现理想 3 n
+实现目标 3 n
+实现需求 3 n
+实生林 3 n
+实生砧 3 n
+实生苗 12 n
+实用 1417 v
+实用主义 99 n
+实用价值 3 l
+实用信息 3 n
+实用功能 3 n
+实用化 39 n
+实用品 6 n
+实用型 24 n
+实用工具 3 n
+实用性 107 n
+实用手册 3 n
+实用技巧 3 n
+实用技术 3 n
+实用教程 3 n
+实用文 3 n
+实用新型 3 n
+实用程序 8 n
+实用英语 3 n
+实用软件 3 l
+实用阶段 3 n
+实症 3 n
+实益 16 n
+实相 3 d
+实矩阵 3 i
+实空 3 n
+实繁有徒 3 i
+实纳 3 v
+实线 11 n
+实绩 70 n
+实缴 3 v
+实缺 3 v
+实耗 3 v
+实职 13 v
+实股 3 n
+实脾饮 3 v
+实至名归 20 i
+实获我心 3 i
+实落 3 v
+实蕃有徒 3 n
+实蝇 19 n
+实行 15400 v
+实装 26 v
+实言 3 n
+实言相告 3 n
+实训室 3 n
+实设 3 vn
+实证 168 v
+实证主义 113 n
+实证化 4 n
+实证性 10 n
+实证效度 3 n
+实证法 3 n
+实词 30 n
+实诚 29 v
+实话 454 v
+实话实说 110 l
+实说 3 v
+实象 3 n
+实质 1402 n
+实质性 341 n
+实质成长 3 n
+实质问题 3 n
+实购 3 v
+实赚 3 v
+实足 15 v
+实足年龄 3 n
+实践 5441 v
+实践型 3 n
+实践家 7 n
+实践家专 3 n
+实践家政 3 n
+实践性 35 n
+实践经验 3 n
+实践者 35 n
+实践论 46 n
+实践证明 3 n
+实达 17 v
+实迹 3 n
+实逼处此 10 l
+实销 3 v
+实闭包 3 n
+实际 12010 n
+实际上 9032 d
+实际困难 3 n
+实际工资 21 n
+实际性 3 d
+实际意义 3 n
+实际成本 3 l
+实际成绩 3 n
+实际操作 3 n
+实际收入 3 n
+实际效果 3 n
+实际晶体 3 n
+实际气体 3 n
+实际水平 3 n
+实际汇率 3 n
+实际行动 3 n
+实际证明 3 n
+实难 3 d
+实需 3 n
+实验 5742 vn
+实验仪 3 n
+实验剧场 3 n
+实验区 22 n
+实验台 10 n
+实验员 6 n
+实验品 3 n
+实验场 70 n
+实验学校 3 n
+实验室 2321 n
+实验工厂 3 n
+实验心理 3 n
+实验性 41 n
+实验成绩 3 n
+实验所 44 n
+实验报告 3 n
+实验教学 3 n
+实验教室 3 n
+实验机 3 n
+实验林 3 n
+实验楼 3 n
+实验法 3 n
+实验点 3 n
+实验班 38 n
+实验田 7 n
+实验站 10 n
+实验组 6 n
+实验者 12 n
+实验舱 2 n
+实验论 3 n
+实验设计 3 n
+实验课 3 n
+实验高级 3 n
+实验鼠 25 n
+実 2 zg
+宠 821 v
+宠仆 3 n
+宠信 152 v
+宠儿 41 n
+宠坏 27 v
+宠大 3 v
+宠妃 31 n
+宠姬 10 n
+宠幸 93 n
+宠惯 3 n
+宠柳娇花 3 i
+宠爱 324 v
+宠爱有加 4 i
+宠物 203 n
+宠物中心 3 n
+宠物交易 3 n
+宠物医院 3 n
+宠物商店 3 n
+宠物市场 3 n
+宠物店 3 n
+宠物犬 3 n
+宠物狗 3 n
+宠物猪 3 n
+宠物猫 3 n
+宠物玩具 3 n
+宠物用品 3 n
+宠物网 3 n
+宠物蛋 3 n
+宠物论坛 3 n
+宠物食品 3 n
+宠物鸟 3 n
+宠用 3 v
+宠臣 82 n
+宠辱 3 v
+宠辱不惊 22 i
+宠辱皆忘 3 i
+宠辱若惊 3 i
+审 2723 v
+审价 3 v
+审几度势 3 i
+审判 3805 vn
+审判制度 3 n
+审判厅 6 n
+审判台 9 n
+审判员 1006 n
+审判大会 3 n
+审判学 3 n
+审判官 177 n
+审判庭 21 n
+审判机关 3 n
+审判权 290 n
+审判活动 3 n
+审判监督 3 n
+审判程序 3 n
+审判者 3 n
+审判长 13 n
+审处 3 v
+审官 3 v
+审定 491 v
+审定本 3 n
+审察 96 v
+审己度人 3 i
+审干 3 v
+审度 15 n
+审悉 3 v
+审慎 145 a
+审慎处理 3 i
+审慎考虑 3 i
+审执 3 v
+审批 973 v
+审批同意 3 n
+审批权 17 n
+审批表 8 n
+审改 3 v
+审断 3 v
+审时变势 3 i
+审时度势 226 n
+审曲面势 3 n
+审曲面埶 3 nz
+审查 3478 vn
+审查会议 3 n
+审查员 2 n
+审查室 3 n
+审查批捕 3 n
+审查核准 3 n
+审查级别 3 n
+审查署 3 n
+审查起诉 3 i
+审查逮捕 3 vn
+审校 5 v
+审核 992 v
+审核员 3 n
+审核权 3 n
+审核部 3 n
+审案 180 v
+审死官 3 n
+审片 3 n
+审理 1029 vn
+审理案件 3 n
+审看 5 v
+审稿 8 v
+审稿人 3 n
+审稿员 3 n
+审级 3 vn
+审结 25 v
+审美 894 vn
+审美化 14 j
+审美感受 3 i
+审美活动 3 i
+审美疲劳 3 i
+审美眼光 3 i
+审美观 19 n
+审美观念 3 n
+审美观点 3 n
+审美评价 3 n
+审视 325 v
+审计 1204 v
+审计员 3 n
+审计处 3 i
+审计学 3 n
+审计官 2 n
+审计局 20 n
+审计工作 3 n
+审计师 9 n
+审计报告 3 n
+审计权 3 n
+审计法 3 n
+审计署 292 v
+审计费 2 n
+审计部 8 n
+审计长 1289 n
+审订 5 v
+审订本 3 n
+审议 5238 v
+审议官 2 n
+审议稿 3 n
+审讯 511 v
+审讯官 3 n
+审评 40 v
+审读 24 v
+审问 256 v
+审问权 3 n
+审问者 3 n
+审阅 61 v
+审阅官 3 n
+审限 5 v
+审题 97 n
+审验 21 vn
+客 4415 n
+客串 32 n
+客串性 3 n
+客串演出 3 l
+客人 3444 n
+客位 43 n
+客体 201 n
+客体化 2 n
+客卿 25 n
+客厅 816 n
+客厅家具 3 nz
+客商 526 n
+客囊羞涩 3 n
+客土 2 n
+客地 3 n
+客场 660 n
+客堂 158 n
+客套 123 n
+客套话 34 n
+客姓 2 n
+客官 158 n
+客客气气 98 n
+客室 3 n
+客家 78 n
+客家人 10 n
+客家方言 3 n
+客家楼 3 n
+客家菜 3 n
+客家话 3 n
+客寓 3 n
+客居 28 n
+客属 3 n
+客席 3 n
+客帮 3 n
+客店 624 n
+客座 33 n
+客座教授 39 n
+客座率 13 n
+客户 3798 n
+客户关系 3 n
+客户名单 3 n
+客户服务 87 n
+客户服务器 2 n
+客户机 27 n
+客户档案 3 vn
+客户王 3 n
+客户程序 5 n
+客户端 42 n
+客户端程序 9 n
+客户经理 3 n
+客户群 36 n
+客户资料 3 n
+客户资源 3 n
+客户部 3 n
+客房 345 n
+客房部 8 n
+客星 15 n
+客服 3 n
+客服热线 3 n
+客服群 3 n
+客服部 3 n
+客机 323 n
+客栈 221 n
+客死 28 n
+客死他乡 6 n
+客气 1418 n
+客气话 46 n
+客流 250 n
+客流地理 3 n
+客流量 87 n
+客源 167 n
+客源国 10 n
+客源地 22 n
+客满 10 a
+客畅其行 3 l
+客票 145 n
+客站 6 n
+客籍 25 n
+客舍 24 n
+客舱 36 n
+客船 56 n
+客观 2924 n
+客观主义 5 n
+客观事实 3 n
+客观事物 3 n
+客观化 3 n
+客观原因 3 n
+客观唯心 3 n
+客观唯心主义 32 n
+客观因素 3 n
+客观存在 3 n
+客观实在 3 l
+客观性 74 n
+客观情况 3 n
+客观条件 3 n
+客观测验 3 n
+客观现实 3 n
+客观真理 3 n
+客观规律 3 n
+客货 109 n
+客货船 4 n
+客货车 5 n
+客货轮 277 n
+客货运 9 n
+客货运输 32 j
+客货运量 8 n
+客车 583 n
+客车厂 3 n
+客车厢 3 n
+客车队 5 n
+客轮 94 n
+客运 1599 n
+客运专线 3 j
+客运公司 3 n
+客运员 4 n
+客运处 2 n
+客运段 3 n
+客运港 3 n
+客运码头 3 n
+客运站 79 n
+客运车辆 12 n
+客运量 78 n
+客道 76 n
+客队 177 n
+客随主便 4 n
+客餐 3 n
+客饭 4 n
+客齐集 3 v
+宣 1289 nr
+宣三朝 2 nr
+宣义恭 2 nr
+宣之世 2 nr
+宣之于 2 v
+宣仁太后 7 nr
+宣仁温 2 nr
+宣令官 4 nr
+宣传 4745 vn
+宣传册 5 nr
+宣传单 17 nr
+宣传司 6 nr
+宣传员 14 n
+宣传周 13 nr
+宣传品 44 nr
+宣传团 6 nr
+宣传处 7 nr
+宣传媒体 3 n
+宣传弹 3 nr
+宣传性 10 nr
+宣传战 4 nr
+宣传报道 3 n
+宣传提纲 3 nr
+宣传攻势 3 n
+宣传教育 3 nr
+宣传日 13 nr
+宣传机构 3 n
+宣传材料 3 n
+宣传栏 23 nr
+宣传点 2 nr
+宣传照 3 nr
+宣传煽动 3 vn
+宣传片 12 n
+宣传牌 3 nr
+宣传画 43 nr
+宣传科 15 nr
+宣传站 3 nr
+宣传组 5 nr
+宣传网 3 nr
+宣传者 10 nr
+宣传词 2 nr
+宣传语 3 nr
+宣传费 3 nr
+宣传车 3 n
+宣传部 333 nr
+宣传部长 105 n
+宣传部门 3 n
+宣传队 83 n
+宣俊英 3 nr
+宣判 91 vn
+宣判无罪 3 n
+宣判有罪 3 n
+宣力 3 n
+宣化 79 vn
+宣化区 3 n
+宣化县 3 nr
+宣化承流 3 n
+宣南 4 ns
+宣发 17 v
+宣叙调 13 nr
+宣召 36 v
+宣召皇 2 nr
+宣召进 2 nr
+宣召韦 2 nr
+宣告 2005 n
+宣告成立 3 nr
+宣告无效 3 n
+宣告无罪 3 n
+宣告有罪 3 n
+宣告来临 3 nr
+宣告破产 3 n
+宣和 165 v
+宣和书 3 nr
+宣和博 6 nr
+宣和君 5 nr
+宣和奉 2 nr
+宣和殿 3 nr
+宣喻者 2 nr
+宣城 40 ns
+宣城县 3 ns
+宣城市 2 ns
+宣夜说 15 n
+宣太后 32 nr
+宣威 14 nr
+宣威县 3 ns
+宣威市 3 ns
+宣孔明 2 nr
+宣宋江 3 nr
+宣宗南 13 nr
+宣宗嗣 3 nr
+宣宗大 5 nr
+宣宗时 3 nr
+宣宗曾 3 nr
+宣宗朱 4 nr
+宣宗离 3 nr
+宣宗而 2 nr
+宣宗诏 2 nr
+宣宗遂 3 nr
+宣官传 3 nr
+宣官引 2 nr
+宣官速 2 nr
+宣家堡 9 nr
+宣导 3 vn
+宣州 46 ns
+宣州区 3 ns
+宣州市 7 ns
+宣工 11 vn
+宣布 7604 v
+宣布免除 3 nr
+宣布无效 3 nr
+宣布独立 3 nr
+宣布解密 3 nr
+宣帝元 3 nr
+宣帝时 3 nr
+宣帝至 2 nr
+宣帝许 2 nr
+宣帝诏 2 nr
+宣府曰 2 nr
+宣府监 4 nr
+宣康有为 4 nr
+宣引圣 2 nr
+宣徐茂 2 nr
+宣德 386 nr
+宣徽 5 ns
+宣徽南 4 ns
+宣徽院 6 nr
+宣忠扈 2 nr
+宣怀位 2 nr
+宣怀当 2 nr
+宣怀愧 2 nr
+宣恩 2 nr
+宣恩县 258 nr
+宣恩哀 3 nr
+宣慈寺 3 nr
+宣慰 58 v
+宣慰司 70 nr
+宣战 377 v
+宣战书 3 n
+宣战案 3 n
+宣托司 2 nr
+宣扬 527 v
+宣抚使 220 nr
+宣抚司 223 nr
+宣抚移 2 nr
+宣抚诚 2 nr
+宣政殿 5 nr
+宣政院 36 n
+宣教 33 v
+宣教部 5 n
+宣明 2 nr
+宣景琳 3 nr
+宣杭线 3 nr
+宣武 210 nr
+宣武区 36 nr
+宣武医院 4 n
+宣武门 355 nr
+宣汉 3 nr
+宣汉县 4 nr
+宣泄 197 v
+宣王中 3 nr
+宣王命 3 nr
+宣王死 2 nr
+宣王转 2 nr
+宣示 85 v
+宣礼塔 4 nr
+宣礼词 2 nr
+宣称 718 v
+宣笔 2 v
+宣纪 2 t
+宣纸 101 v
+宣统 313 n
+宣统皇帝 3 nr
+宣肺 13 n
+宣腿 3 n
+宣至殿 3 nr
+宣至金 2 nr
+宣花斧 5 nr
+宣萱 3 n
+宣言 1817 nr
+宣言书 43 nr
+宣誓 266 v
+宣誓书 4 nr
+宣誓代表 3 nr
+宣誓就职 3 nr
+宣讲 141 v
+宣讲会 206 n
+宣讲团 4 n
+宣诏变 2 nr
+宣诏员 128 nr
+宣诏官 141 nr
+宣说 3 v
+宣读 898 v
+宣读文件 3 n
+宣读文告 3 n
+宣谕朕 3 nr
+宣谕本 2 nr
+宣赞休 6 nr
+宣赞可 3 nr
+宣赞尽 3 nr
+宣赞快 2 nr
+宣赞真 2 nr
+宣过誓 3 nr
+宣金受 128 nr
+宣露 4 v
+宣魏征 2 nr
+室 4562 n
+室上性 3 n
+室主任 120 n
+室乐 3 n
+室内 997 s
+室内乐 51 n
+室内剧 4 n
+室内外 15 s
+室内天线 3 n
+室内拖鞋 3 n
+室内气候 3 n
+室内气流 3 n
+室内环境 3 n
+室内空气 3 n
+室内空间 3 n
+室内花园 3 n
+室内装潢 3 n
+室内装璜 3 n
+室内装饰 3 n
+室内设计 3 n
+室内赛 3 n
+室内运动 3 n
+室友 30 n
+室壁瘤 3 n
+室外 224 s
+室外天线 3 n
+室外工程 3 n
+室外机 3 n
+室外梯级 3 n
+室外楼梯 3 n
+室外运动 3 n
+室女 47 n
+室女座 3 n
+室如悬磬 3 n
+室家 3 n
+室徒四壁 3 n
+室怒市色 3 n
+室性早搏 3 v
+室扑 3 n
+室早 3 n
+室温 124 n
+室管膜 7 n
+室而人远 3 n
+室迩人远 3 v
+室迩人遐 3 nr
+室迩人遥 3 ns
+室里 3 s
+室长 14 n
+室间隔 9 n
+室韦 50 n
+室颤 3 n
+宥 210 g
+宦 243 nr
+宦之家 5 nr
+宦刘瑾 2 nr
+宦商民 2 nr
+宦囊 4 n
+宦官 759 n
+宦富豪 2 nr
+宦海 34 nr
+宦海中 3 nr
+宦海沉浮 3 nr
+宦海浮沉 3 nr
+宦海风波 2 nr
+宦游 4 n
+宦者 22 n
+宦途 13 n
+宦门 4 n
+宦门公子 15 n
+宩 2 zg
+宪 287 n
+宪兵 339 n
+宪兵营 6 n
+宪兵队 38 n
+宪制 5 n
+宪宗 332 nrt
+宪政 397 n
+宪政改革 3 n
+宪政时期 3 n
+宪法 9553 n
+宪法大纲 3 n
+宪法学 33 nt
+宪法法院 34 nt
+宪章 305 n
+宪章派 22 n
+宪纲 3 n
+宫 6360 nr
+宫一府 2 nr
+宫一词 3 nr
+宫三清 3 nr
+宫与苑 2 nr
+宫东风 3 nr
+宫中 1884 s
+宫为才 3 nr
+宫主 19 n
+宫主位 2 n
+宫主院 2 n
+宫之中 3 nr
+宫之主 9 nr
+宫之碑 2 nr
+宫九佳 10 nr
+宫于宗 2 nr
+宫京成 6 nr
+宫亲王 2 nr
+宫人 6 n
+宫传旨 4 nr
+宫体 13 n
+宫体诗 10 nr
+宫保 3 nr
+宫保鸡 2 nr
+宫内 291 s
+宫冥殿 3 nr
+宫分 2 n
+宫刊本 2 n
+宫刑 109 n
+宫则宫 4 nr
+宫别苑 3 nr
+宫制 3 n
+宫前 57 s
+宫前殿 3 nr
+宫北 2 s
+宫千秋 2 nr
+宫卫尉 4 nr
+宫卫骑 2 nr
+宫又未 2 nr
+宫口 8 s
+宫古岛 5 nr
+宫叩见 2 nr
+宫后殿 5 nr
+宫后隐 2 nr
+宫含元 2 nr
+宫员 2 n
+宫喜斌 3 nr
+宫四姝 3 nr
+宫圣驾 2 nr
+宫城 663 nr
+宫城之 6 nr
+宫城南 128 nr
+宫城县 3 nr
+宫城居 3 nr
+宫墙 458 n
+宫壁 2 s
+宫声 3 n
+宫外孕 22 n
+宫外通 2 nr
+宫大典 128 nr
+宫大福 3 nr
+宫天挺 3 nr
+宫太后 43 nr
+宫太监 3 nr
+宫夺印 2 nr
+宫女 2181 n
+宫娘娘 19 nr
+宫娥 50 n
+宫嫔妃 2 nr
+宫学艺 7 nr
+宫官 2 n
+宫室 175 n
+宫密奏 2 nr
+宫寺释 3 nr
+宫崇诣 2 nr
+宫崎 17 nrt
+宫崎县 3 nr
+宫崎峻 3 nr
+宫崎滔天 6 nr
+宫崎骏 3 nr
+宫川宏一 6 nr
+宫巡察 3 nr
+宫庄田 2 nr
+宫应选 2 nr
+宫府 18 n
+宫庭 15 n
+宫廷 3782 n
+宫廷式 3 nr
+宫廷政变 27 nr
+宫廷舞 25 nr
+宫式 2 n
+宫引商 2 n
+宫征商 4 nr
+宫律 3 n
+宫德雪野 3 nr
+宫慕久 4 nr
+宫战 2 n
+宫户世 2 nr
+宫扇 3 n
+宫才会 128 nr
+宫掌 2 n
+宫掌事 2 n
+宫掖 3 ns
+宫施 2 n
+宫春晓 3 nr
+宫景华 3 nr
+宫服 3 n
+宫朝贺 17 nr
+宫本 19 n
+宫杀齐 2 nr
+宫权 2 n
+宫来 23 f
+宫来帮 2 nr
+宫来朝 2 nr
+宫来见 4 nr
+宫格 2 n
+宫楼 3 n
+宫殿 2114 nr
+宫殿式 140 nr
+宫治 2 n
+宫泽喜 4 nr
+宫泽喜一 5 nr
+宫泽里惠 3 nr
+宫清修 2 nr
+宫灯 874 n
+宫灵霄 2 nr
+宫爆鸡丁 3 n
+宫猗兰 2 nr
+宫玉国 2 nr
+宫玉波 2 nr
+宫的圣 3 nr
+宫皆设 2 nr
+宫皇后 22 nr
+宫皇太后 26 nr
+宫直攻 2 nr
+宫相 3 n
+宫砂 7 n
+宫神宫 2 nr
+宫禁中 3 nr
+宫禁之 2 nr
+宫空 2 s
+宫端 2 n
+宫筱轩 3 nr
+宫籍 3 n
+宫粉 2 n
+宫粉黛 7 nr
+宫纱 2 n
+宫练剑 2 nr
+宫给杨 2 nr
+宫者 11 n
+宫腔 39 n
+宫腔内 3 nr
+宫腔积 4 n
+宫腔镜 11 nr
+宫腰 3 n
+宫花 2 n
+宫藏 2 n
+宫衫 2 n
+宫装 11 n
+宫见帝 2 nr
+宫见朕 2 nr
+宫见驾 2 nr
+宫观 47 n
+宫观主 2 nr
+宫规 5 n
+宫规宫 3 nr
+宫觐见 4 nr
+宫词 5 n
+宫请懿 2 nr
+宫诸女 4 nr
+宫调 64 n
+宫赠蜜 2 nr
+宫车晏驾 3 nr
+宫辟疑 2 nr
+宫遇灾 2 nr
+宫道士 3 nr
+宫邸 5 n
+宫邻金虎 3 nr
+宫都太监 2 nr
+宫里 468 s
+宫里传 2 nr
+宫里关 2 nr
+宫里养 2 nr
+宫里可 2 nr
+宫里呆 2 nr
+宫里太监 3 nr
+宫里宫 8 nr
+宫里朝 2 nr
+宫里来 3 nr
+宫里混 3 nr
+宫里能 2 nr
+宫里躲 2 nr
+宫里陪 2 nr
+宫锦衣袍 3 n
+宫门 544 n
+宫闱 50 nr
+宫闱画 3 nr
+宫阙 316 nr
+宫院 28 n
+宫雪岭 12 nr
+宫雪花 3 nr
+宫面圣 3 nr
+宫音 9 n
+宫音弦 4 nr
+宫颈 225 n
+宫颈口 3 n
+宫颈炎 3 n
+宫颈癌 120 n
+宫鲁鸣 15 nr
+宬 14 zg
+宭 4 zg
+宮 17 zg
+宰 798 v
+宰人 3 n
+宰具官 2 nr
+宰制 2 n
+宰割 54 v
+宰和卿 2 nr
+宰和邑 2 nr
+宰太牢 2 nr
+宰孔去 2 nr
+宰客 18 nr
+宰张邦 4 nr
+宰德派 3 nr
+宰执中 2 nr
+宰执官 6 nr
+宰执时 2 nr
+宰杀 123 v
+宰李邦 8 nr
+宰海卜 16 nr
+宰牛 3 n
+宰牛刀 2 nr
+宰牲亭 259 n
+宰牲节 11 n
+宰猪 3 n
+宰相 935 n
+宰相之才 3 nr
+宰相肚里 3 n
+宰羊 8 nr
+宰者 2 n
+宰谷 2 n
+宰辅之 10 nr
+宰食 3 n
+宰鸭 3 n
+宱 4 zg
+害 3654 v
+害人 342 n
+害人不浅 14 i
+害人害己 3 i
+害人精 4 n
+害人者 2 n
+害人虫 7 n
+害兽 9 n
+害农 6 n
+害口 3 n
+害命 14 v
+害喜 3 v
+害国害民 3 n
+害处 63 v
+害带 3 n
+害得 3 v
+害忠隐贤 3 i
+害怕 3404 v
+害死 898 v
+害病 60 v
+害眼 8 v
+害羞 232 a
+害群之马 25 i
+害臊 87 a
+害苦 3 v
+害虫 486 n
+害起 3 v
+害起时腋 3 i
+害躁 3 a
+害过 3 v
+害鸟 3 n
+宴 975 n
+宴乐 27 n
+宴会 571 n
+宴会厅 171 n
+宴会服 3 n
+宴会装 3 n
+宴安 3 n
+宴安酖毒 3 n
+宴安鸠毒 3 vn
+宴安鸩毒 3 vn
+宴客 29 n
+宴尔 3 n
+宴尔新婚 3 n
+宴居 3 v
+宴席 147 n
+宴游 3 n
+宴请 461 v
+宴请外宾 3 n
+宴饮 101 n
+宵 317 tg
+宵夜 12 n
+宵小 20 n
+宵旰 3 i
+宵旰图治 3 i
+宵旰忧劳 3 i
+宵旰忧勤 3 i
+宵旰焦劳 3 i
+宵民 3 n
+宵禁 28 v
+宵禁时间 3 i
+宵衣旰食 19 i
+宵鱼垂化 3 i
+家 41022 q
+家一阳 3 nr
+家丁 274 n
+家丑 21 n
+家丑不可外扬 12 i
+家世 90 n
+家业 208 n
+家严 3 n
+家中 1745 s
+家主 202 n
+家主儿 3 n
+家乐 3 n
+家乐福 28 nz
+家乡 1217 n
+家乡人 19 n
+家乡水 3 n
+家乡父老 3 n
+家乡肉 3 n
+家乡话 11 n
+家乡风味 3 i
+家书 87 n
+家事 154 n
+家事商业 3 n
+家事职业 3 n
+家事职校 3 l
+家亚平 2 nr
+家亡国破 3 l
+家产 319 j
+家人 908 n
+家什 45 nrt
+家仆 15 n
+家仇 13 n
+家伙 1546 n
+家传 139 n
+家传之 6 nr
+家传人诵 3 i
+家传户诵 3 i
+家传户颂 3 nr
+家传拳 2 n
+家传武 4 nr
+家传注 2 nr
+家住 113 v
+家信 29 j
+家俱 13 nz
+家俱厂 3 j
+家儿 2 n
+家兄 60 n
+家兔 18 n
+家具 886 n
+家具五金 3 l
+家具公司 3 n
+家具厂 3 n
+家具商 3 n
+家具城 20 n
+家具市场 3 n
+家具店 3 n
+家具材料 3 l
+家具用品 3 n
+家具网 3 nz
+家具行 3 n
+家具行业 3 n
+家具配件 3 n
+家养 65 n
+家制 3 n
+家剑法 2 nr
+家务 1019 n
+家务事 50 n
+家务劳动 3 l
+家务活 21 n
+家务管理 3 n
+家协会 3 nz
+家反宅乱 3 i
+家叔 3 n
+家口 3 s
+家史 21 n
+家商 3 n
+家商职校 3 j
+家商补校 3 l
+家喻户习 3 i
+家喻户晓 244 i
+家园 445 n
+家园网 3 n
+家地 9 s
+家塾 28 n
+家塾本 3 vn
+家境 495 n
+家境清寒 3 i
+家境贫困 3 i
+家境贫寒 3 i
+家声 7 n
+家外 3 s
+家大业大 15 nz
+家奴 134 n
+家姊 3 nr
+家姑 3 n
+家委会 6 j
+家威廉 2 nr
+家子 12 n
+家子样 3 l
+家学 3 n
+家学渊源 25 l
+家宅 36 n
+家守制 3 n
+家安 5 nz
+家宝 11 n
+家室 107 n
+家宴 62 n
+家家 279 n
+家家传 3 nr
+家家影院 3 n
+家家户户 138 n
+家家酒 3 n
+家富尔 3 nr
+家小 87 j
+家小孔 2 nr
+家居 146 n
+家居图 3 nr
+家居时尚 3 nr
+家居服 3 nr
+家居环境 3 l
+家居生活 3 i
+家居用品 3 n
+家居网 3 nz
+家居装饰 3 n
+家居设计 3 i
+家居风水 3 i
+家居饰品 3 n
+家屋 3 n
+家属 1064 n
+家属区 12 n
+家属宿舍 3 n
+家属楼 13 n
+家属院 15 n
+家山 3 n
+家帮 3 j
+家常 177 n
+家常事 2 n
+家常便饭 149 l
+家常茶饭 3 n
+家常菜 22 n
+家常话 24 n
+家常里短 3 i
+家常饭 5 n
+家常饼 3 n
+家庄 3 n
+家底 61 s
+家底儿 6 n
+家庙 291 n
+家庭 8831 n
+家庭不和 3 i
+家庭主妇 3 n
+家庭事务 3 n
+家庭作业 3 n
+家庭保健 3 nr
+家庭出身 3 i
+家庭副业 38 n
+家庭医生 3 n
+家庭史 3 n
+家庭和睦 12 nr
+家庭型 9 n
+家庭妇女 22 n
+家庭婚姻 3 n
+家庭幸福 3 nr
+家庭式 17 n
+家庭影院 3 n
+家庭成员 3 n
+家庭手工 3 n
+家庭收入 3 n
+家庭教师 3 n
+家庭教育 139 l
+家庭旅馆 3 n
+家庭暴力 3 l
+家庭治疗 3 n
+家庭版 2 n
+家庭环境 3 l
+家庭理财 3 n
+家庭用品 3 n
+家庭用户 8 n
+家庭经营 3 n
+家庭网 3 n
+家庭网络 2 n
+家庭聚会 3 n
+家庭装 3 n
+家庭装潢 3 n
+家庭装饰 3 n
+家庭解体 3 n
+家庭计划 3 n
+家庭设备 3 n
+家庭财产 3 l
+家康 4 nz
+家弟 3 n
+家弦户诵 2 i
+家当 406 n
+家徒四壁 13 l
+家徒壁立 3 nr
+家得宝 3 nr
+家御宇 2 nr
+家恋土 2 n
+家情 3 n
+家慈 3 nr
+家成业就 3 n
+家户 3 n
+家把什 3 n
+家政 111 n
+家政专科 3 j
+家政公司 3 n
+家政学 5 n
+家政科 3 n
+家政系 3 n
+家教 208 nz
+家教中心 3 l
+家教信息 3 n
+家教网 3 n
+家散人亡 3 i
+家数 148 n
+家族 1918 nz
+家族企业 3 n
+家族制度 3 n
+家族化 2 n
+家族史 55 n
+家族式 7 n
+家无二主 3 i
+家无儋石 3 vn
+家无宁日 3 i
+家无常礼 3 i
+家无担石 3 l
+家无斗储 3 nz
+家无长物 3 l
+家春秋 3 nr
+家景 3 n
+家暴 3 n
+家有仙妻 3 n
+家有娇妻 3 i
+家有家规 3 n
+家有恩 2 nr
+家有敝帚 3 i
+家村 47 n
+家杖子 2 nr
+家松 3 n
+家校通 3 n
+家殷人足 3 nr
+家母 47 n
+家永邦 3 nr
+家法 63 n
+家洛微 2 nr
+家烦宅乱 3 i
+家燕 18 nr
+家父 147 n
+家犬 20 n
+家猫 3 n
+家珍 3 nr
+家用 152 n
+家用机 3 n
+家用版 3 n
+家用电器 150 n
+家用电脑 2 n
+家用空调 3 n
+家用车 3 n
+家用轿车 3 n
+家电 667 j
+家电业 27 n
+家电产品 6 n
+家电企业 3 j
+家电化 3 j
+家电市场 3 n
+家电网 3 nz
+家电行业 3 n
+家电论坛 3 n
+家畜 420 n
+家眷 169 n
+家破人亡 121 i
+家破人离 3 i
+家破身亡 3 i
+家祖 3 n
+家祠 5 n
+家祭 3 n
+家福妈 6 nr
+家福爹 11 nr
+家禽 229 n
+家禽业 4 n
+家禽家畜 3 n
+家禽类 3 n
+家私 77 n
+家私万贯 3 i
+家私厂 3 n
+家私城 3 n
+家种 16 n
+家童 18 n
+家系 4 n
+家系选择 3 l
+家累 17 v
+家累千金 3 l
+家纺网 3 nz
+家给人足 3 i
+家给民足 3 i
+家维根 2 nz
+家翁 3 n
+家翻宅乱 3 i
+家耻 3 n
+家臣 18 n
+家至人说 3 l
+家至户到 3 i
+家至户察 3 n
+家至户晓 3 i
+家舍业 4 n
+家苗 2 n
+家藏户有 3 i
+家蚊 3 n
+家蚕 29 n
+家蚕素 3 n
+家蝇 10 n
+家装 25 n
+家装网 3 n
+家见户说 3 i
+家规 30 n
+家计 18 n
+家训 41 n
+家访 19 j
+家谕户晓 3 nr
+家谱 54 n
+家财 95 j
+家财万贯 3 i
+家财险 3 j
+家败人亡 3 i
+家贫 78 b
+家贫亲老 3 i
+家贫如洗 3 i
+家贸市场 3 n
+家贼 12 n
+家贼难防 3 i
+家资 3 n
+家过夜 3 l
+家道 52 n
+家道中落 17 l
+家道从容 3 i
+家道小康 3 nr
+家道消乏 3 i
+家酿 3 n
+家里 6390 s
+家里人 291 nrt
+家钵 3 n
+家长 2998 n
+家长会 38 j
+家长作风 3 n
+家长制 63 j
+家长学校 3 j
+家长式 11 n
+家长报 3 j
+家长礼短 3 i
+家长里短 21 i
+家门 565 n
+家门不幸 3 i
+家门口 258 s
+家雀 5 n
+家雀儿 2 nr
+家风 25 n
+家饰 2 n
+家骥人璧 3 i
+家鸡 16 n
+家鸡野雉 3 n
+家鸡野鹜 3 i
+家鸭 5 n
+家鸽 5 n
+家鼠 13 n
+宷 4 zg
+宸 1027 g
+容 2640 a
+容万象 2 nr
+容下 3 a
+容不下 3 i
+容不得 3 v
+容乃大 3 nr
+容于汉 2 nr
+容人 51 n
+容光 16 nr
+容光焕发 79 i
+容光照 5 nr
+容克 65 nr
+容克斯 4 nr
+容凯尔 7 nr
+容分 13 n
+容加金 5 n
+容县 13 ns
+容双茂 2 nr
+容受 3 a
+容后说明 3 i
+容器 433 n
+容国团 5 n
+容城 4 nr
+容城县 3 ns
+容声 4 n
+容头过身 3 i
+容姑 57 n
+容姿绝 2 i
+容子 5 n
+容子矩 6 nr
+容客量 2 n
+容容 3 n
+容容易易 3 n
+容小其 2 nr
+容小可 3 nr
+容并茂 2 nr
+容幸 3 a
+容弹 2 n
+容忍 479 a
+容忍度 9 n
+容忍性 2 n
+容志行 2 nr
+容态 3 n
+容态可掬 3 i
+容性 2 n
+容悦 2 a
+容情 151 a
+容成公 3 nr
+容抗 3 v
+容摩耳 2 nr
+容易 8676 a
+容易接受 3 i
+容易腐烂 3 n
+容星桥 2 nr
+容某先 2 nr
+容格 3 n
+容桂芳 80 nr
+容止 3 v
+容水量 256 n
+容热量 3 n
+容物耶 2 nr
+容犹胜 2 nr
+容电器 3 n
+容留 9 v
+容直 3 a
+容祖儿 3 nr
+容积 238 n
+容积率 3 n
+容纳 608 nr
+容纳得下 3 i
+容纳性 3 nr
+容细思 2 nr
+容细辨 2 nr
+容老奴 2 nr
+容膝之地 3 i
+容膝之安 3 i
+容臣别 2 nr
+容色 17 n
+容色照 2 nr
+容色甚 3 nr
+容色秀美 2 nr
+容让 3 v
+容许 464 v
+容许子群 3 nr
+容许检验 3 n
+容许能力 3 n
+容貌 647 n
+容貌特征 3 nr
+容身 75 n
+容身之地 3 i
+容身之处 3 i
+容重 3 a
+容量 1102 n
+容量因子 3 nr
+容量瓶 11 n
+容量色 3 n
+容错 15 a
+容错性 2 n
+容错码 3 n
+容错过 2 v
+容锦昌 3 nr
+容限 3 a
+容韵琳 3 nr
+容颜 192 nr
+宽 9081 a
+宽严 6 a
+宽仁 19 n
+宽仁大度 3 ns
+宽以待人 4 i
+宽体 18 a
+宽余 6 a
+宽假 3 a
+宽免 10 v
+宽减 2 v
+宽厚 174 a
+宽口 3 n
+宽口径 3 n
+宽城 6 ns
+宽城区 3 ns
+宽城县 3 ns
+宽大 549 a
+宽大为怀 21 i
+宽大地 3 z
+宽大处理 3 i
+宽大政策 3 n
+宽大无边 3 i
+宽宏 58 a
+宽宏大度 7 ns
+宽宏大量 60 i
+宽宥 27 v
+宽容 448 a
+宽容一点 3 l
+宽容度 6 n
+宽容性 3 n
+宽容放纵 3 i
+宽宽 3 v
+宽宽厚厚 3 z
+宽宽大大 3 z
+宽宽松松 3 z
+宽宽的 21 z
+宽宽绰绰 3 i
+宽屏幕 3 l
+宽屏版 3 l
+宽展 3 vn
+宽带 259 n
+宽带去偶 3 i
+宽带接入 24 n
+宽带数据 3 n
+宽带用户 3 n
+宽带网 4 n
+宽带资源 3 n
+宽幅 25 n
+宽广 623 a
+宽度 527 n
+宽廉平正 3 i
+宽延 3 v
+宽式 3 n
+宽待 16 v
+宽心 193 a
+宽心丸 3 n
+宽心丸儿 3 i
+宽怀 3 a
+宽怀大度 2 l
+宽恕 253 v
+宽慰 195 a
+宽扎 9 v
+宽打窄用 3 vn
+宽敝 3 a
+宽敞 289 a
+宽敞明亮 11 l
+宽旷 2 a
+宽松 266 a
+宽松环境 3 n
+宽比 13 v
+宽泛 74 a
+宽洪大量 20 n
+宽洪海量 3 n
+宽爱 3 a
+宽狭 3 a
+宽猛并济 3 i
+宽猛相济 3 i
+宽甸 12 ns
+宽甸县 3 ns
+宽甸满族自治县 7 ns
+宽畅 5 a
+宽皮桔 3 n
+宽窄 58 a
+宽紧 3 a
+宽紧度 3 l
+宽纵 3 v
+宽绰 15 a
+宽缓 11 a
+宽网 3 n
+宽肩 3 n
+宽舒 10 a
+宽街 3 n
+宽衣 29 n
+宽衣解带 3 n
+宽裕 197 a
+宽解 3 v
+宽豁大度 3 vn
+宽贷 13 n
+宽赦 6 v
+宽边 3 n
+宽边帽 3 n
+宽边草帽 3 n
+宽进严出 3 i
+宽银幕 19 n
+宽阔 1079 a
+宽阔无边 3 i
+宽限 33 a
+宽限期 7 n
+宽顶堰 3 ns
+宽领带 3 n
+宽频 30 n
+宽频网 3 n
+宽饶 3 a
+宽高比 3 z
+宾 565 nr
+宾主 180 n
+宾主关系 3 n
+宾主双方 3 nr
+宾主尽欢 3 nr
+宾从 3 n
+宾入如归 3 i
+宾利 6 ns
+宾努亲王 2 nr
+宾县 6 ns
+宾士 3 n
+宾士域 19 nr
+宾士车 3 nr
+宾士轿车 3 n
+宾夕凡尼 3 nr
+宾夕法尼 3 ns
+宾夕法尼亚 37 ns
+宾夕法尼亚大学 24 nt
+宾夕法尼亚州 42 ns
+宾子 13 n
+宾客 435 nr
+宾客如云 2 nr
+宾客盈门 5 n
+宾客迎门 3 nr
+宾川 5 ns
+宾川县 3 ns
+宾川鸡 3 ns
+宾州 32 ns
+宾师 2 n
+宾师之 4 nr
+宾得 3 nr
+宾朋 24 nr
+宾朋满座 3 nr
+宾服 3 n
+宾来如归 3 i
+宾果 3 n
+宾果游戏 3 n
+宾根 3 ns
+宾格 12 n
+宾派 5 n
+宾白 3 nr
+宾礼 8 nr
+宾福德 2 nr
+宾童贯 3 nr
+宾童龙 2 nr
+宾翰 2 nrt
+宾至如归 17 i
+宾西法尼亚 3 ns
+宾词 3 n
+宾语 93 n
+宾铁 3 n
+宾阳 3 ns
+宾阳县 2 ns
+宾阳洞 4 nr
+宾餞日月 3 nz
+宾饯日月 3 v
+宾馆 671 n
+宾馆业 2 n
+宾馆酒店 3 n
+宾馆饭店 3 n
+宿 868 nr
+宿一室 2 nr
+宿一宵 14 nr
+宿三州 2 nr
+宿世冤家 3 vn
+宿业 2 n
+宿主 203 n
+宿主机 2 n
+宿于家 2 nr
+宿仇 2 nr
+宿债 6 n
+宿儒 9 nr
+宿儒黄 2 nr
+宿元景 5 nr
+宿办 2 n
+宿务 8 n
+宿卫 61 nr
+宿卫亲 3 nr
+宿卫者 4 n
+宿县 42 ns
+宿周伯 2 nr
+宿命 83 n
+宿命主义 3 n
+宿命论 52 n
+宿命论者 3 n
+宿因 3 n
+宿地 2 n
+宿城区 6 ns
+宿处 9 n
+宿夜 5 n
+宿太尉 126 nr
+宿娼 16 n
+宿存 22 n
+宿学旧儒 3 nr
+宿宁馨 3 nr
+宿将 34 n
+宿州 45 ns
+宿州市 10 ns
+宿府 2 n
+宿弊 3 n
+宿弊一清 3 n
+宿志 3 n
+宿怨 24 n
+宿愿 38 n
+宿愿已偿 3 n
+宿愿得偿 3 v
+宿敌 23 n
+宿昔 3 nr
+宿未睡 2 nr
+宿松 11 nr
+宿松县 2 nr
+宿松新 6 nr
+宿松矿 2 nr
+宿柳眠花 3 nr
+宿根 28 ns
+宿根园 3 nr
+宿水飡风 3 v
+宿水餐风 3 n
+宿疾 5 nr
+宿疾难医 3 n
+宿缘 3 n
+宿者 2 n
+宿舍 917 n
+宿舍区 53 nr
+宿舍楼 58 nr
+宿茂臻 3 nr
+宿草 3 n
+宿营 109 nr
+宿营地 45 n
+宿营车 9 n
+宿西 3 ns
+宿西县 3 ns
+宿诺 3 nr
+宿豫县 5 nr
+宿费 3 n
+宿迁 75 nr
+宿迁县 3 nr
+宿迁市 34 ns
+宿醉 3 nr
+宿铁 3 n
+宿长春 2 nr
+宿雨餐风 3 n
+宿鸟 14 n
+宿鸟栖 2 nr
+宿鸭湖 2 ns
+寀 36 zg
+寂 211 a
+寂天寞地 3 z
+寂女 3 l
+寂寂 53 a
+寂寂无闻 3 nz
+寂寞 762 a
+寂寞岁月 3 v
+寂寥 74 z
+寂无人声 7 l
+寂灭 22 v
+寂然 115 a
+寂然不动 3 l
+寂然无声 3 l
+寂照 3 v
+寂若无人 3 l
+寂若死灰 3 l
+寂苦 3 a
+寂静 692 a
+寂静地 3 z
+寂静岭 3 l
+寂静无声 3 l
+寂默 3 a
+寃 9 zg
+寄 2577 v
+寄上去 3 v
+寄上来 3 v
+寄主 232 v
+寄主植物 3 n
+寄主范围 3 n
+寄予 121 v
+寄予厚望 3 i
+寄予希望 3 nr
+寄予重托 3 nr
+寄于 3 v
+寄交 3 v
+寄人檐下 3 i
+寄人篱下 41 i
+寄件人 5 n
+寄住 10 v
+寄信 16 v
+寄信人 6 n
+寄儿 3 n
+寄兴寓情 3 n
+寄养 298 v
+寄出 42 v
+寄出去 3 v
+寄到 3 v
+寄剩 3 v
+寄卖 4 v
+寄卖品 3 n
+寄卖处 3 n
+寄卖店 3 n
+寄卡人 3 nr
+寄去 3 v
+寄发 20 v
+寄发凭证 3 n
+寄名 6 v
+寄售 3 vn
+寄售品 3 n
+寄售处 3 n
+寄售库 3 n
+寄售店 3 n
+寄回 3 v
+寄女 3 n
+寄存 181 v
+寄存人 3 n
+寄存器 92 n
+寄存处 2 n
+寄完 3 v
+寄宿 102 v
+寄宿制 6 n
+寄宿生 11 nr
+寄寓 27 n
+寄寓未来 3 nr
+寄居 75 v
+寄居蟹 24 n
+寄希望于 3 nr
+寄往 3 v
+寄怀 3 v
+寄情 21 n
+寄愁 3 v
+寄意 5 v
+寄成 3 v
+寄托 933 v
+寄托号 3 n
+寄托币 3 n
+寄挂号 3 n
+寄挂号信 3 i
+寄放 17 v
+寄放在 3 n
+寄放处 3 n
+寄望 27 v
+寄来 3 v
+寄来寄去 3 nr
+寄款 3 n
+寄满 3 v
+寄灵 2 n
+寄父 3 n
+寄物处 3 n
+寄生 607 v
+寄生兽 3 n
+寄生前夜 3 i
+寄生反馈 3 n
+寄生性 43 n
+寄生振荡 3 i
+寄生植物 3 n
+寄生物 28 n
+寄生电容 3 n
+寄生菌 3 n
+寄生虫 153 n
+寄生虫病 73 n
+寄生蜂 11 n
+寄生蟹 3 n
+寄生调幅 3 n
+寄畅园 3 nr
+寄相思 3 nr
+寄箱 3 n
+寄籍 7 n
+寄给 3 v
+寄自 3 v
+寄至 3 v
+寄花献佛 3 nr
+寄蝇 3 n
+寄语 37 n
+寄读 3 v
+寄费 2 vn
+寄赠 6 v
+寄走 3 v
+寄足 3 v
+寄身 3 v
+寄达 3 v
+寄过去 3 v
+寄过来 3 v
+寄还给 3 i
+寄迹 3 n
+寄迹山林 3 i
+寄送 13 v
+寄递 6 v
+寄钱 3 v
+寄销 3 v
+寄销品 3 n
+寄错 3 v
+寄附 3 v
+寄雁传书 3 nr
+寄静 3 n
+寄颜无所 3 i
+寄食 3 n
+寅 116 mg
+寅吃卯粮 6 i
+寅支卯粮 3 i
+寅时 14 t
+寅粮卯吃 3 i
+寅虎 4 n
+密 3911 a
+密不可分 100 l
+密不透风 45 l
+密不通风 3 l
+密书 78 n
+密云 157 ns
+密云不雨 5 l
+密云县 34 ns
+密云水库 15 ns
+密云路 3 ns
+密令 65 n
+密件 30 n
+密会 3 n
+密使 152 n
+密信 55 n
+密克罗尼西亚 104 ns
+密克罗尼西亚联邦 13 ns
+密函 3 n
+密切 3889 ad
+密切关系 3 l
+密切协作 3 l
+密切合作 3 l
+密切圆 3 z
+密切接触 4 l
+密切注意 3 l
+密切相关 38 l
+密切联系 3 l
+密切配合 3 n
+密勒 8 nrt
+密匝匝 14 z
+密医 3 n
+密县 26 ns
+密友 90 n
+密召 3 v
+密合 3 v
+密告 25 n
+密咒 3 v
+密哦 3 v
+密商 71 n
+密宗 102 nrt
+密实 19 ad
+密室 225 n
+密密 3 ad
+密密丛丛 3 z
+密密匝匝 28 z
+密密实实 8 z
+密密层层 61 z
+密密的 61 z
+密密缝 3 n
+密密麻麻 263 z
+密封 502 ns
+密封件 6 n
+密封剂 5 n
+密封器 3 n
+密封圈 5 n
+密封地 3 ns
+密封垫 3 n
+密封式 7 n
+密封性 10 n
+密封材料 3 n
+密封条 10 n
+密封环 3 ns
+密封盖 2 ns
+密封罐 3 n
+密封胶 3 n
+密封舱 16 n
+密封递价 3 n
+密封门 3 ns
+密封面 6 n
+密尔沃基 12 nrt
+密尔顿 3 ns
+密山 10 ns
+密山县 3 ns
+密山市 5 ns
+密布 852 v
+密度 2412 n
+密度仪 3 nz
+密度估计 3 n
+密度分割 3 l
+密度板 3 n
+密度梯度 3 n
+密度测定 3 n
+密度涨落 3 i
+密度计 3 n
+密得兰 3 ns
+密户 3 n
+密执安 11 ns
+密执安州 4 ns
+密技 3 n
+密报 70 n
+密押 2 v
+密探 90 v
+密接 3 ad
+密支那 27 ns
+密文 21 n
+密斯 12 ns
+密旋霉素 3 n
+密旨 86 n
+密林 240 ns
+密柚 3 n
+密植 34 v
+密歇根 44 ns
+密歇根州 39 ns
+密歇根湖 27 ns
+密法 3 n
+密炼机 2 n
+密特朗 47 ns
+密电 65 n
+密电码 5 n
+密码 1022 n
+密码侦探 3 n
+密码保护 3 n
+密码信 3 n
+密码发送 2 n
+密码员 3 n
+密码子 14 n
+密码子型 3 n
+密码子组 3 n
+密码学 6 n
+密码式 3 n
+密码恢复 3 l
+密码找回 3 l
+密码文件 3 n
+密码本 3 n
+密码术 3 n
+密码机 25 n
+密码模件 3 l
+密码界 5 n
+密码简并 3 l
+密码箱 3 n
+密码簿 3 n
+密码表 3 n
+密码锁 4 n
+密穴 3 n
+密籍 3 n
+密约 97 ns
+密约偷期 3 i
+密级 10 n
+密级信息 3 n
+密组织 3 nt
+密织 3 n
+密结 3 a
+密而不宣 3 i
+密胺 7 n
+密致 6 a
+密苏里 59 ns
+密苏里州 27 ns
+密苏里河 26 ns
+密蒙花 3 ns
+密西 4 ns
+密西根 16 ns
+密西根州 3 ns
+密西西 3 ns
+密西西比 41 ns
+密西西比州 8 ns
+密西西比河 106 ns
+密订 3 v
+密议 3 n
+密访 9 v
+密诏 75 n
+密语 13 nz
+密谈 80 v
+密谋 234 n
+密谋策划 3 n
+密谋者 3 n
+密道 3 n
+密钥 63 n
+密钥建立 3 nr
+密钥流 3 n
+密锣紧鼓 27 l
+密闭 110 v
+密闭式 10 n
+密闭性 2 n
+密陀僧 3 n
+密集 1187 n
+密集区 15 n
+密集型 127 n
+密集度 8 n
+密集式 3 n
+密集架 3 n
+密集柜 3 n
+密集点 3 n
+密麻麻 5 z
+寇 425 nr
+寇三边 2 nr
+寇上谷 2 nr
+寇世勋 3 nr
+寇仇 4 nr
+寇健明 5 nr
+寇准 33 nr
+寇准力 2 nr
+寇凉州 2 nr
+寇台州 2 nr
+寇吕侯 2 nr
+寇员外 11 nr
+寇孙观 2 nr
+寇家伦 5 nr
+寇将军 6 nr
+寇并州 2 nr
+寇幽州 2 nr
+寇振海 3 nr
+寇松乃 2 nr
+寇松线 9 nr
+寇梁兄弟 2 nr
+寇滋扰 2 nr
+寇白门 2 nr
+寇莱公 3 nr
+寇蒂斯 2 nr
+寇谦之 4 nr
+寇阳羡 3 nr
+寈 6 zg
+富 2682 nr
+富临 4 v
+富丽 133 nr
+富丽华 3 nr
+富丽堂皇 206 nr
+富于 803 v
+富于幻想 3 i
+富于春秋 3 nr
+富产 3 n
+富人 965 n
+富人榜 3 nr
+富余 115 a
+富克斯 8 nr
+富克锦 2 nr
+富兰克 2 nr
+富兰克林 141 nz
+富兴 2 a
+富养化 3 nr
+富养植物 3 l
+富冈 3 ns
+富农 253 nz
+富农分子 3 n
+富农经济 3 n
+富冠三 2 nr
+富冰冻土 3 nr
+富利卡 3 nr
+富力壮 3 nr
+富加德 3 nr
+富勒姆 18 nr
+富勒姆队 2 nz
+富勒烯 4 nr
+富华 118 nz
+富厚 3 a
+富厚岗 2 nr
+富县 12 ns
+富口俭 3 nr
+富可敌国 20 i
+富可视 3 l
+富司迪 3 nr
+富含 422 v
+富哈尼 2 nr
+富商 138 n
+富商大贾 26 nr
+富商巨贾 9 nr
+富商蓄贾 3 n
+富国 78 ns
+富国兴邦 3 nt
+富国安民 3 nr
+富国强兵 53 nz
+富国强民 3 nr
+富国彊兵 3 vn
+富国裕民 3 nr
+富国银行 2 nt
+富图纳 14 nr
+富在知足 3 i
+富坚义博 3 nr
+富埒王侯 3 ns
+富埒陶白 3 nz
+富堪敌国 3 i
+富塔贾 2 nr
+富士 121 n
+富士公司 3 nt
+富士山 69 nr
+富士康 4 nr
+富士施乐 11 nr
+富士达 3 nr
+富士通 49 nr
+富士通公司 6 nt
+富士通杯 3 nz
+富士银行 6 nt
+富大贵 21 nr
+富大龙 3 nr
+富婆 45 nr
+富孀 3 n
+富子壮 2 nr
+富子梅 2 nr
+富存区 2 nr
+富宁 3 nr
+富宁县 2 ns
+富安 12 nz
+富安娜 3 nr
+富实 3 a
+富室 98 n
+富室大家 3 nr
+富家 153 n
+富家大室 3 nt
+富家女 3 nr
+富家子 3 nr
+富家子弟 3 nr
+富家巨室 3 nr
+富富有余 3 i
+富察氏 6 nr
+富尔克 4 nr
+富尔奈 2 nr
+富尔敦 3 ns
+富尔曼 3 nr
+富尔杰 4 nr
+富尔语 2 nz
+富尔贝 17 nr
+富尔顿 13 nr
+富屯溪 12 nr
+富山 5 ns
+富岛 2 ns
+富川 12 ns
+富平 19 nr
+富平侯 2 nr
+富平县 3 ns
+富庶 187 a
+富康 5 a
+富康车 3 nr
+富强 333 v
+富强康乐 3 nz
+富强粉 3 nr
+富得流油 3 n
+富得溢 2 nr
+富态 16 n
+富户 732 n
+富拉 12 nrt
+富拉尔基 8 nrt
+富拉尔基区 2 ns
+富拉尼 26 nr
+富拉语 2 nz
+富拉顿 18 nr
+富斯塔 2 nr
+富斯特 3 nr
+富春县 3 nr
+富春山 10 nr
+富春江 48 nr
+富有 2652 v
+富有成效 3 i
+富有成果 3 i
+富有经验 3 n
+富有者 4 n
+富有诗意 3 nr
+富有魔力 3 i
+富林明 2 nr
+富格尔 2 nr
+富比 3 v
+富比王侯 3 nr
+富民 122 n
+富民兴安 3 ns
+富民兴邦 3 nt
+富民县 3 ns
+富民强国 2 ns
+富民政策 4 n
+富民路 3 nz
+富水 271 n
+富江 3 ns
+富池口 9 ns
+富泰 21 nz
+富洁晶 5 nr
+富浠伙 3 nr
+富浠汇 3 nr
+富浠诲 3 nr
+富海 3 ns
+富润 9 n
+富港 2 ns
+富港村 4 nz
+富源 9 n
+富源县 4 ns
+富热隆 2 nr
+富甲一方 7 nz
+富甲天下 3 i
+富益贫 5 nr
+富盛 3 nz
+富矿 42 n
+富矿石 3 nr
+富纳富提 5 nr
+富绅 20 n
+富绶笑 2 nr
+富翁 204 nr
+富而不骄 3 i
+富而好礼 3 i
+富而思进 3 i
+富而骄 3 nr
+富莱堡 3 nr
+富营养化 24 n
+富蕴 8 nr
+富蕴县 9 nr
+富藏 22 ns
+富裕 822 a
+富裕中农 11 nz
+富裕县 7 nr
+富裕户 5 nr
+富裕村 2 nr
+富裕者 3 nr
+富豪 302 nr
+富豪世家 3 nr
+富豪之家 3 l
+富豪榜 3 nr
+富豪统治 3 nr
+富贵 599 a
+富贵不淫 3 i
+富贵不能 3 i
+富贵不能淫 5 i
+富贵利达 3 nr
+富贵在天 3 i
+富贵寿考 3 nr
+富贵手 3 nr
+富贵无常 3 i
+富贵显荣 3 nr
+富贵浮云 3 nr
+富贵病 13 nr
+富贵竹 3 nr
+富贵花 3 nr
+富贵荣华 23 nr
+富贵逼人 3 i
+富贵骄人 3 i
+富贵鸟 3 nr
+富足 92 a
+富轹万古 3 nz
+富达 8 nz
+富连成 4 nr
+富连成社 8 l
+富铁 6 n
+富铝化 9 nz
+富锦 11 nr
+富锦县 3 nr
+富锦市 4 ns
+富锰 2 nz
+富镁 7 nz
+富阳 48 ns
+富阳县 12 ns
+富阳市 3 ns
+富阳镇 3 nr
+富集 200 v
+富集区 12 nt
+富集铀 3 nr
+富面百城 3 n
+富韬略 2 nr
+富顺 3 nr
+富顺县 2 nr
+富饶 229 a
+富马 2 nz
+富马酸 3 nz
+富鲁诺 3 nr
+富齐塔 2 nr
+寎 3 zg
+寐 133 zg
+寑 6 zg
+寒 2011 n
+寒亭区 3 nr
+寒伧 12 v
+寒假 94 n
+寒假作业 3 n
+寒光 217 n
+寒冬 77 t
+寒冬腊月 20 nr
+寒冷 838 a
+寒冷刺骨 3 l
+寒冻风化 3 n
+寒凉 23 a
+寒区 19 n
+寒号虫 3 n
+寒号鸟 3 n
+寒喧 21 nr
+寒噤 93 n
+寒士 15 n
+寒夜 25 t
+寒天 7 t
+寒天冻地 3 n
+寒季 3 t
+寒害 3 a
+寒山寺 15 nr
+寒峭 4 a
+寒峻 2 a
+寒带 120 n
+寒微 35 a
+寒心 87 n
+寒心消志 3 n
+寒心酸鼻 3 n
+寒意 519 n
+寒意料峭 3 l
+寒慄 3 v
+寒战 112 n
+寒族 2 n
+寒星 14 n
+寒星冷月 3 nr
+寒暄 218 nr
+寒暄语 3 v
+寒暑 93 n
+寒暑假 33 n
+寒暑易节 3 n
+寒暑表 3 n
+寒暑计 3 nr
+寒月 4 t
+寒木春华 3 nr
+寒来暑往 4 l
+寒松 2 a
+寒极 13 n
+寒梅 8 nr
+寒森森 3 nr
+寒武 59 nr
+寒武纪 161 nr
+寒毛 71 n
+寒毛卓竖 3 i
+寒气 282 n
+寒气逼人 3 i
+寒水石 3 nr
+寒江雪 3 nr
+寒泉之思 3 nr
+寒波荡漾 3 nr
+寒流 187 n
+寒温 10 n
+寒温带 78 n
+寒湿 39 a
+寒潮 145 n
+寒灰更然 3 i
+寒热 98 a
+寒疟 3 n
+寒症 11 n
+寒痹 3 a
+寒盛 2 a
+寒碜 44 v
+寒秋 4 nr
+寒秕 3 n
+寒窑 3 n
+寒窗 41 n
+寒素 3 n
+寒羽良 3 nr
+寒耕暑耘 3 nr
+寒耕热耘 3 nr
+寒腹短识 3 n
+寒腿 3 n
+寒舍 34 n
+寒色 4 n
+寒芒 4 n
+寒花晚节 3 n
+寒苦 4 a
+寒蝉 10 nr
+寒蝉仗马 3 i
+寒蝉僵鸟 3 nr
+寒蝉凄切 3 i
+寒螿 3 v
+寒衣 15 n
+寒证 9 n
+寒贱 3 a
+寒趣 3 n
+寒酸 104 n
+寒酸气 3 n
+寒酸落魄 3 n
+寒铁 3 n
+寒门 32 n
+寒霜 2 nr
+寒露 17 v
+寒露风 3 nr
+寒颤 44 n
+寒风 498 n
+寒风侵肌 3 n
+寒风凛冽 3 nr
+寒风刺骨 3 l
+寒风料峭 5 l
+寒食 3 n
+寒食节 3 n
+寒鸦 17 n
+寒鸦戏水 3 l
+寒鸭 3 n
+寓 657 n
+寓义 3 n
+寓书 3 n
+寓于 53 v
+寓公 22 n
+寓兵于农 3 l
+寓处 2 n
+寓居 48 n
+寓情于景 4 l
+寓意 297 n
+寓意深远 3 l
+寓意深长 5 i
+寓所 100 n
+寓教于乐 23 l
+寓目 3 n
+寓舍 3 n
+寓藏 3 n
+寓言 239 n
+寓言故事 3 i
+寓言诗 5 n
+寓邸 3 n
+寔 120 zg
+寕 34 zg
+寖 14 zg
+寗 24 zg
+寘 53 zg
+寙 23 zg
+寚 143 zg
+寜 27 zg
+寝 435 n
+寝不安席 3 l
+寝不成寐 3 i
+寝不聊寐 3 i
+寝丘之志 3 n
+寝具 7 n
+寝室 218 n
+寝宫 371 n
+寝床 2 n
+寝皮食肉 3 l
+寝苫枕土 3 nr
+寝苫枕块 3 i
+寝苫枕干 3 nr
+寝苫枕草 3 nr
+寝车 3 n
+寝食 27 n
+寝食不安 34 l
+寝食俱废 3 i
+寝食难安 46 l
+寝食难忘 3 l
+寞 10 zg
+寞寞无声 3 nz
+察 1649 j
+察举 64 v
+察今知古 3 i
+察办 3 v
+察勘 3 v
+察北 6 ns
+察南 19 ns
+察可军 2 i
+察右 3 nrt
+察右前旗 5 ns
+察合台 3 n
+察哈尔 223 nrt
+察哈尔省 22 ns
+察察为明 2 i
+察察而明 3 i
+察尔汗盐湖 14 ns
+察尔珠 3 nrt
+察己知人 3 i
+察布查尔 6 nrt
+察布查尔锡伯自治县 6 ns
+察明 3 v
+察核 3 v
+察看 682 v
+察知 3 v
+察究 3 v
+察见渊鱼 3 i
+察觉 669 v
+察觉出 3 n
+察觉到 3 l
+察言观色 64 i
+察言观行 3 i
+察访 32 v
+察院 3 n
+察隅 24 nrt
+察隅县 12 ns
+察隅河 7 ns
+察雅 3 nrt
+察雅县 3 ns
+察颜观色 14 i
+察验 3 v
+寠 2 zg
+寡 478 n
+寡不敌众 133 i
+寡不胜众 3 i
+寡二少双 3 i
+寡人 161 n
+寡人之疾 3 i
+寡信 3 n
+寡信轻诺 3 i
+寡凫单鹄 3 nr
+寡助 3 v
+寡合 3 n
+寡味 3 n
+寡基因 3 n
+寡头 4793 n
+寡头政治 78 n
+寡女 3 n
+寡妇 431 n
+寡妇村 3 n
+寡妻 6 n
+寡嫂 21 n
+寡居 16 n
+寡廉鲜耻 14 i
+寡恩 3 n
+寡恩少义 3 n
+寡情 3 n
+寡情薄义 3 i
+寡情薄意 3 i
+寡断 3 v
+寡核苷酸 3 n
+寡欢 3 v
+寡欲 20 n
+寡母 12 n
+寡淡 11 a
+寡糖 3 n
+寡糖基 3 n
+寡糖链 3 n
+寡聚 3 v
+寡聚体 3 n
+寡肽 3 n
+寡脱氧 3 n
+寡见少闻 3 i
+寡见鲜闻 3 i
+寡言 17 n
+寡言少语 5 i
+寡闻 2 n
+寡闻寡见 3 i
+寡闻少见 3 i
+寡陋 3 a
+寡霉素 3 n
+寡食性 3 n
+寡鹄孤鸾 3 i
+寣 10 zg
+寤 155 zg
+寤寐 3 v
+寤寐求之 3 v
+寥 62 nr
+寥寂 3 z
+寥寥 180 z
+寥寥可数 11 i
+寥寥数语 3 i
+寥寥无几 127 i
+寥廓 14 z
+寥若星晨 3 i
+寥若晨星 12 i
+寥若辰星 3 i
+寥落 23 z
+寥落晨星 3 i
+寧 15 zg
+寨 4159 ng
+寨主 234 n
+寨外 3 n
+寨子 114 n
+寨里 163 n
+寨门 3 n
+寫 29 zg
+寬 2 zg
+寮 1372 zg
+寯 5 zg
+寰 1701 n
+寰宇 44 n
+寰岛 30 n
+寰海 3 n
+寰球 9 n
+寱 2 zg
+寲 96 zg
+寳 47 zg
+寶 30 zg
+寷 34 zg
+寸 877 m
+寸丝不挂 3 i
+寸丝半粟 3 i
+寸兵尺铁 3 i
+寸利必得 3 l
+寸刻 3 n
+寸功 3 n
+寸劲儿 3 n
+寸口 15 n
+寸善片长 3 i
+寸土 16 n
+寸土不让 4 i
+寸土寸金 19 i
+寸土尺地 3 i
+寸土尺金 3 l
+寸土必争 11 l
+寸地尺天 3 i
+寸头 3 n
+寸心 24 n
+寸心千古 3 i
+寸指测渊 3 i
+寸断 18 l
+寸有所长 6 i
+寸木岑楼 3 v
+寸楷 3 n
+寸步 15 n
+寸步不离 70 i
+寸步不让 15 l
+寸步千里 3 i
+寸步难移 8 i
+寸步难行 51 i
+寸田尺宅 3 n
+寸男尺女 3 l
+寸白虫 3 n
+寸短 3 n
+寸积铢累 3 i
+寸肠 3 n
+寸草 3 n
+寸草不生 46 i
+寸草不留 6 i
+寸草寸金 3 i
+寸草春晖 3 n
+寸草衔结 3 i
+寸辖制轮 3 n
+寸进 3 v
+寸进尺退 3 l
+寸量铢称 3 n
+寸金 3 n
+寸金难买 3 l
+寸铁 3 n
+寸铁在手 3 i
+寸铁杀人 3 i
+寸长 3 n
+寸长尺技 3 i
+寸长尺短 3 i
+寸长片善 3 i
+寸阴 5 n
+寸阴尺璧 3 i
+寸阴是惜 3 l
+寸阴若岁 3 i
+对 184674 p
+对不上 25 l
+对不住 125 v
+对不起 1052 l
+对乙酰氨基酚 8 nz
+对了 695 p
+对二甲苯 9 nz
+对于 18058 p
+对人对事 3 l
+对仗 39 v
+对付 2750 vn
+对位 66 n
+对位法 3 n
+对做对敲 3 l
+对偶 131 n
+对偶函子 3 l
+对偶原理 14 n
+对偶句 3 n
+对偶同构 3 n
+对偶地图 3 l
+对偶性 3 n
+对偶曲线 3 n
+对偶空间 3 n
+对偶网络 3 n
+对偶表示 3 n
+对光 71 n
+对公 25 n
+对内 274 s
+对内搞活 4 vn
+对内政策 3 n
+对冲 71 n
+对决 131 v
+对准 759 n
+对准目标 3 l
+对准精度 3 n
+对劲 41 a
+对劲儿 30 d
+对半分 5 l
+对半卡环 3 n
+对半开 2 l
+对华 392 nz
+对华关系 3 n
+对华政策 3 n
+对华贸易 3 n
+对口 459 vn
+对口唱 3 n
+对口型 3 n
+对口快板 3 n
+对口相声 4 i
+对口词 3 n
+对台戏 2 n
+对台贸易 3 l
+对号入座 37 n
+对号快车 3 l
+对号车 3 n
+对合起来 3 l
+对唱 32 v
+对垒 72 n
+对外 4207 s
+对外关系部 5 nt
+对外劳务 3 l
+对外友协 3 nt
+对外商 10 n
+对外开放 1360 l
+对外文委 2 nt
+对外汉语 3 l
+对外经济贸易大学 20 nt
+对外经贸 3 n
+对外经贸大学 7 l
+对外联络部 4 nt
+对外贸易 656 l
+对外贸易法 2 l
+对外贸易经济合作部 18 nt
+对外部 33 nt
+对天发誓 3 i
+对天盟誓 3 n
+对头 193 n
+对头冤家 4 l
+对夹式 3 l
+对奖券 3 n
+对子 112 n
+对客下菜 3 n
+对客挥毫 3 n
+对对 3 p
+对对子 8 l
+对对看 3 l
+对对碰 3 v
+对对胡 3 n
+对射 25 v
+对局 33 n
+对局室 4 n
+对岸 303 n
+对峙 435 v
+对峙反应 3 vn
+对床夜语 3 l
+对床夜雨 3 l
+对床风雨 3 l
+对应 1087 vn
+对应性 20 n
+对应溶液 3 n
+对应点 14 n
+对应物 7 l
+对应状态 3 l
+对庭 3 n
+对开 85 v
+对弈 67 v
+对待 1920 v
+对得住 3 v
+对得起 235 v
+对我讲 3 l
+对手 4064 v
+对手戏 2 l
+对抗 1799 v
+对抗性 71 n
+对抗性矛盾 2 l
+对抗战 28 l
+对抗赛 72 n
+对折 14 n
+对拷 3 v
+对换 25 v
+对接 189 v
+对接口 6 n
+对撞 14 vn
+对撞机 53 n
+对攻 62 vn
+对攻战 6 n
+对敌 446 v
+对数 164 n
+对数函数 3 l
+对数变换 3 l
+对数定律 3 l
+对数方程 3 l
+对数比例 3 n
+对数积分 3 l
+对数表 10 n
+对敲转帐 3 i
+对方 6479 n
+对於 3 i
+对日元 3 nz
+对日抗战 3 l
+对映 3 v
+对映异构 3 n
+对景伤情 3 n
+对景挂画 3 n
+对望 3 v
+对望一眼 3 l
+对来对去 3 l
+对松山 2 n
+对植 3 v
+对模型 21 n
+对歌 18 n
+对此 1169 d
+对比 1175 v
+对比变换 3 l
+对比度 28 l
+对比律 3 l
+对比性 6 l
+对比曲线 3 l
+对比温度 3 l
+对比联想 3 l
+对比色 4 l
+对流 180 n
+对流云 10 l
+对流层 85 n
+对流性雨 3 l
+对流环路 3 l
+对流电泳 3 l
+对流雨 3 l
+对焊 2 vn
+对焊机 3 n
+对焦 9 vn
+对照 516 p
+对照检查 3 n
+对照组 15 n
+对照表 11 n
+对牛弹琴 21 n
+对牛鼓簧 3 n
+对生 189 v
+对电极 3 n
+对症 155 n
+对症下药 72 i
+对症下葯 3 nz
+对症之药 3 i
+对症发药 3 nz
+对白 186 v
+对看一眼 3 l
+对着 3 p
+对着干 41 l
+对硫磷 5 nz
+对称 928 v
+对称中心 3 l
+对称因素 3 l
+对称张量 3 n
+对称性 148 n
+对称性群 3 l
+对称核 3 n
+对称格 3 n
+对称点 3 n
+对称算子 3 n
+对称网络 3 n
+对称轴 21 n
+对称陀螺 3 n
+对空射击 17 l
+对立 1297 v
+对立性 3 n
+对立物 11 n
+对立统一 75 l
+对立面 121 n
+对端联会 3 l
+对等关系 3 l
+对等条约 3 l
+对等网 3 n
+对答 225 v
+对答如流 50 i
+对策 833 n
+对策元素 3 n
+对簿 3 n
+对簿公堂 15 i
+对系统 71 l
+对练 20 vn
+对联 430 vn
+对联式 3 n
+对胃口 2 n
+对胺苯甲 3 n
+对苯二甲 3 nz
+对苯二胺 44 nz
+对苯二酚 25 nz
+对苯醌 11 nz
+对茦 3 vn
+对薄公堂 3 l
+对虾 91 n
+对襟 67 n
+对视 185 v
+对角 24 n
+对角优势 3 n
+对角线 35 n
+对讲机 28 n
+对证 23 v
+对证下药 3 n
+对话 1433 n
+对话会 3 l
+对话体 3 l
+对话器 3 l
+对话录 5 n
+对话性 3 n
+对话框 26 n
+对话者 3 n
+对读 3 v
+对调 28 v
+对象 4511 n
+对象化 10 n
+对象国 7 n
+对象性 19 n
+对象连接 3 n
+对账 7 v
+对质 35 n
+对赛 3 vn
+对过 27 p
+对过儿 3 l
+对酌 3 v
+对酒当歌 3 i
+对错 31 v
+对错不分 3 l
+对阴极 3 n
+对阵 301 n
+对面 1549 n
+对面鼓 3 l
+对顶角 3 n
+对饮 54 n
+对骂 26 v
+对齐 22 d
+对齐图标 3 l
+寺 5512 ng
+寺僧 3 n
+寺儿沟 3 n
+寺坡 2 n
+寺塔 3 n
+寺山 2 ns
+寺庙 481 n
+寺沟乡 3 ns
+寺观 91 n
+寺规 3 n
+寺里 228 s
+寺门前 3 s
+寺院 625 n
+寻 3495 zg
+寻一寻 4 nr
+寻一胜 2 nr
+寻丁霸 2 nr
+寻中星 3 nr
+寻丹阳 2 nr
+寻主母 2 nr
+寻乌 2 nr
+寻乌县 3 nr
+寻乌水 3 nr
+寻乐 3 nr
+寻事 3 v
+寻事生 3 nr
+寻事生非 3 i
+寻亲 7 v
+寻亲访友 3 l
+寻人 74 nr
+寻人启事 3 i
+寻仇 32 v
+寻仇生 6 nr
+寻以言 3 nr
+寻俗 3 a
+寻偶 2 v
+寻傻姑 2 nr
+寻兆鹏 2 nr
+寻入朝 2 nr
+寻公子 2 nr
+寻出 3 v
+寻到 3 v
+寻医 4 v
+寻医问药 6 l
+寻味 3 v
+寻呼 23 v
+寻呼业 3 l
+寻呼台 15 nr
+寻呼机 11 l
+寻呼网 6 i
+寻回 15 v
+寻回者 3 nr
+寻地仙 2 nr
+寻址 21 v
+寻壑经丘 3 nr
+寻声 10 v
+寻大圣 2 nr
+寻夫至 2 nr
+寻妈妈 2 nr
+寻妹记 2 nr
+寻宋江 3 nr
+寻宝 49 nr
+寻宝套 2 nr
+寻宝玉 2 nr
+寻宝者 7 nr
+寻宝记 3 nr
+寻寻 4 v
+寻寻法 2 nr
+寻寻觅觅 18 l
+寻小宝 2 nr
+寻小龙 2 nr
+寻山问水 3 i
+寻巧玲 3 nr
+寻师求 2 nr
+寻师父 5 nr
+寻常 1246 a
+寻常事 10 i
+寻常疣 4 n
+寻常百姓 3 i
+寻常路 3 nr
+寻幽入微 3 nr
+寻幽探 3 nr
+寻幽探胜 3 nr
+寻幽访胜 3 nr
+寻开口 3 nr
+寻开心 26 nr
+寻弊索瑕 3 n
+寻径函数 3 l
+寻思 1300 nr
+寻慕容 2 nr
+寻找 3960 v
+寻找出来 3 l
+寻找失物 3 l
+寻找无着 3 l
+寻找机会 3 l
+寻拜征 2 nr
+寻摸 2 v
+寻改吏 3 nr
+寻新欢 3 nr
+寻无常 2 i
+寻明 2 v
+寻机 19 v
+寻杜谷 128 nr
+寻来寻 3 nr
+寻枝摘叶 3 i
+寻查 3 v
+寻标器 2 nr
+寻根 37 nr
+寻根拔树 3 nr
+寻根究底 19 i
+寻根究抵 3 n
+寻根追底 3 l
+寻根问底 3 l
+寻梦 7 v
+寻梦园 3 nr
+寻检 2 v
+寻棘藤 2 nr
+寻欢 22 v
+寻欢作乐 78 i
+寻死 171 v
+寻死觅活 27 i
+寻死赖活 3 i
+寻水泉 4 nr
+寻求 1357 v
+寻求出来 3 i
+寻求真理 3 i
+寻求知识 3 i
+寻流逐末 3 i
+寻消问息 3 i
+寻清静 2 nr
+寻源讨本 3 i
+寻点儿 2 nr
+寻片 3 v
+寻物 3 v
+寻瑕伺隙 3 n
+寻甸 5 ns
+寻甸回族彝族自治县 3 ns
+寻瘢索绽 3 nr
+寻短见 22 v
+寻租 28 v
+寻秦记 3 nr
+寻移疾 2 nr
+寻章摘句 5 i
+寻索 4 v
+寻绎 3 v
+寻老尤 2 nr
+寻老高 2 nr
+寻花觅柳 3 i
+寻花问柳 18 i
+寻藏 4 v
+寻衅 75 v
+寻衅滋事 9 l
+寻行数墨 3 i
+寻行逐队 3 i
+寻见 21 v
+寻见孙 2 nr
+寻觅 329 v
+寻视起来 3 l
+寻览 3 v
+寻访 263 v
+寻译 3 v
+寻购 3 v
+寻路 9 v
+寻踪 17 v
+寻踪觅迹 3 i
+寻轨 3 v
+寻迁奉 2 nr
+寻过 3 v
+寻进礼 2 nr
+寻连克 2 nr
+寻迹 3 v
+寻遍 3 v
+寻道 3 v
+寻郭靖 3 nr
+寻问 22 v
+寻阿舅 2 nr
+寻陆展 2 nr
+寻隙 3 n
+寻风捉影 3 i
+寻风捕影 3 l
+寻食 31 v
+寻骨风 3 nr
+寻麻疹 2 n
+寻黄蓉 2 nr
+寻黛玉 3 nr
+寻龙之 2 nr
+寻龙入 2 nr
+导 1274 v
+导以取保 3 n
+导体 290 n
+导光板 3 n
+导入 92 v
+导入到 3 v
+导入期 5 n
+导入正轨 3 n
+导入规约 3 n
+导出 259 v
+导出分数 3 n
+导出单位 3 n
+导出去 3 v
+导出来 3 v
+导出规则 3 n
+导出词条 3 n
+导刊 3 n
+导医网 3 n
+导向 657 n
+导向性 16 n
+导向毒素 3 n
+导向管 4 n
+导向误差 3 n
+导向钻头 3 n
+导向飞弹 3 n
+导坑 13 n
+导士 2 n
+导尿 5 v
+导尿管 9 n
+导师 681 n
+导师制 12 n
+导带 14 n
+导平面 3 n
+导引 280 v
+导引头 3 n
+导弹 8148 n
+导弹兵 10 n
+导弹基地 3 n
+导弹系统 3 n
+导弹网 3 n
+导弹艇 48 n
+导弹部队 3 n
+导德齐礼 3 v
+导扬 3 v
+导抗 3 v
+导护 4 v
+导护老师 3 n
+导报 108 n
+导报讯 3 n
+导播 3 v
+导数 138 n
+导数光谱 3 n
+导板 4 n
+导柱 3 n
+导标 3 n
+导正 3 v
+导正法 3 n
+导气 4 n
+导水管 4 n
+导波 3 n
+导流 46 n
+导流洞 3 n
+导温系数 3 n
+导游 660 n
+导游员 100 n
+导游图 4 n
+导游小姐 3 n
+导游网 3 n
+导游证 17 n
+导游词 3 n
+导源 3 n
+导演 2105 v
+导演奖 72 n
+导演系 11 n
+导演组 2 n
+导演铃 3 n
+导火 3 n
+导火索 66 n
+导火线 103 n
+导火绳 3 n
+导热 30 v
+导热性 43 n
+导热油 3 n
+导热管 3 n
+导爆管 3 n
+导爆索 18 n
+导电 223 n
+导电介质 3 n
+导电体 3 n
+导电布 3 v
+导电性 74 n
+导电胶 3 n
+导盘 3 n
+导盲犬 3 n
+导码 3 n
+导磁率 3 n
+导管 417 n
+导纳 18 v
+导纳圆图 3 n
+导线 240 n
+导线管 3 n
+导缆器 3 n
+导致 6498 v
+导致用户 3 n
+导致系统 3 n
+导航 801 v
+导航仪 14 n
+导航台 17 n
+导航员 10 n
+导航条 3 n
+导航灯 2 n
+导航系统 6 n
+导航网 3 n
+导航键 3 n
+导航页 3 n
+导览 6 v
+导言 20 n
+导论 108 n
+导诊 3 v
+导语 69 n
+导读 28 v
+导购 24 v
+导购员 3 n
+导购网 3 n
+导赤散 3 n
+导轨 66 n
+导轨油 3 n
+导轮 5 n
+导那里呢 3 n
+寽 9 zg
+対 4 zg
+寿 824 n
+寿不压职 3 i
+寿与天 5 nr
+寿丰 3 ns
+寿元无量 3 n
+寿光 15 nr
+寿光县 4 nr
+寿光市 3 n
+寿光鸡 3 nr
+寿兴国 128 ns
+寿南山 12 ns
+寿县 76 ns
+寿司 10 n
+寿司店 2 n
+寿命 1155 n
+寿命短 3 n
+寿命长 3 n
+寿圣节 2 nr
+寿圣院 3 nr
+寿堂 3 nr
+寿大典 2 ns
+寿天德 3 nr
+寿太郎 42 nr
+寿宁 12 nr
+寿宁县 3 ns
+寿宁宫 61 nr
+寿安宫 3 nr
+寿宴 22 n
+寿山 101 ns
+寿山公园 3 ns
+寿山石 8 nr
+寿山福海 3 ns
+寿州 2 ns
+寿州窑 2 ns
+寿带鸟 2 n
+寿庆 3 ns
+寿序 2 n
+寿康太 4 nr
+寿康宫 4 nr
+寿延千 3 nr
+寿张县 2 nr
+寿怡红 3 nr
+寿恒昌 2 nr
+寿数 16 n
+寿斑 2 n
+寿星 81 nr
+寿春城 5 nr
+寿春府 4 nr
+寿木 16 nr
+寿材 11 n
+寿桃 25 n
+寿椿殿 4 nr
+寿比南山 16 ns
+寿永昌 2 nr
+寿满天年 3 nr
+寿烛影 2 nr
+寿王坟 3 n
+寿皇殿 26 nr
+寿相 3 n
+寿礼 61 nr
+寿穴 3 n
+寿筵 7 n
+寿糕 3 n
+寿终 3 nr
+寿终正寝 26 i
+寿经 4 n
+寿考 8 nr
+寿者 2 n
+寿联 2 ns
+寿节 2 n
+寿藏 4 ns
+寿螺 3 n
+寿衣 49 n
+寿诞 20 n
+寿诸州 2 ns
+寿辉传 2 nr
+寿辰 42 nr
+寿酒 2 n
+寿阳 12 ns
+寿阳县 4 ns
+寿限 21 n
+寿险 54 n
+寿险业 3 n
+寿陵匍匐 3 v
+寿陵君 2 nr
+寿陵失步 3 n
+寿面 9 n
+寿香腾 2 nr
+寿高通 2 nr
+封 6721 q
+封一 36 nr
+封万里 3 nr
+封三 24 nr
+封上去 3 l
+封上来 3 l
+封上柱 2 nr
+封下去 3 l
+封下来 3 l
+封不平 17 l
+封世子 2 nr
+封丘 50 nr
+封丘县 3 nr
+封丘城 5 nr
+封东王 3 nr
+封临淮 2 nr
+封为 3 v
+封为丹 2 nr
+封为义 3 nr
+封为圣 2 nr
+封为城 2 nr
+封为安 2 nr
+封为平 3 nr
+封为忠 2 nr
+封为恒 2 nr
+封为贞 2 nr
+封为郡 5 nr
+封主 2 a
+封之政 128 nr
+封之礼 3 nr
+封乌程 4 nr
+封乐毅 3 nr
+封书子 48 nr
+封予卿 3 nr
+封二 30 nr
+封于康 3 nr
+封于燕 9 nr
+封于舒 3 nr
+封于鲁 6 nr
+封伯封 4 nr
+封住 3 v
+封侯 36 nr
+封侯之 3 nr
+封侯封 6 nr
+封侯景 2 nr
+封侯赐 2 nr
+封侯非 3 nr
+封信 151 nr
+封信中 3 nr
+封信付 2 nr
+封信国 2 nr
+封信来 5 l
+封信递 3 nr
+封信邮 3 nr
+封信里 7 nr
+封入 3 v
+封全真 7 nr
+封兰陵 2 nr
+封关 8 v
+封其僧 2 nr
+封其子 6 nr
+封其山 2 nr
+封其弟 8 nr
+封册 3 v
+封冻 208 v
+封冻期 24 t
+封刀挂剑 3 l
+封切机 3 l
+封列侯 10 nr
+封到 3 v
+封前朝 2 nr
+封包 3 n
+封华歆 2 nr
+封博望 3 nr
+封博陵 2 nr
+封卫国 4 nr
+封印 18 nr
+封印先知 2 nr
+封印师 3 nr
+封印木 3 nr
+封双喜 4 nr
+封反 3 v
+封口 282 n
+封口令 3 n
+封口处 2 l
+封口机 3 n
+封口膜 3 n
+封口费 3 n
+封召公 4 nr
+封号 163 n
+封司马懿 2 nr
+封君制 3 nr
+封君太 4 nr
+封君桓 2 nr
+封吴王 3 nr
+封周公 5 nr
+封周王 2 nr
+封和硕 7 nr
+封唐王 2 nr
+封固 3 a
+封国公 2 nr
+封国太后 2 nr
+封国时 2 nr
+封国梁 3 nr
+封土 30 n
+封土堆 16 l
+封地 193 n
+封坛主 8 nr
+封堵 63 v
+封堵器 3 l
+封墙 2 n
+封大圣 2 nr
+封大官 2 nr
+封大怒 2 nr
+封太保 2 nr
+封太尉 2 nr
+封头 4 n
+封奉诚 2 nr
+封套 64 a
+封好 3 a
+封妻荫子 16 l
+封存 211 v
+封孙权 4 nr
+封季历 3 nr
+封学文 3 nr
+封学武 3 nr
+封宋江 4 nr
+封宗王 2 nr
+封官 34 nr
+封官墨 2 nr
+封官晋 2 nr
+封官许原 3 nr
+封官许愿 7 i
+封官赐 2 nr
+封宜侯 2 nr
+封审知 2 nr
+封客氏 3 nr
+封密奏 2 nr
+封封 3 nr
+封少保 5 nr
+封尚师 6 nr
+封山 40 nr
+封山育林 12 nr
+封己守残 3 i
+封师兄 4 nr
+封师古 196 nr
+封师岐 13 nr
+封师歧 5 nr
+封常洵 2 nr
+封常清 7 nr
+封平南 2 nr
+封平西 8 nr
+封广陵 2 nr
+封庆亲王 3 nr
+封庆郡 2 nr
+封底 14 t
+封府库 3 nr
+封建 6694 a
+封建主 255 nr
+封建主义 291 l
+封建制 114 nr
+封建制度 3 l
+封建割据 50 l
+封建思想 3 nr
+封建性 35 nr
+封建意识 3 l
+封建把头 3 l
+封建时代 3 l
+封建残余 24 l
+封建王朝 1037 nr
+封建礼教 75 nr
+封建社会 962 l
+封建统治 3 l
+封建迷信 61 l
+封建道德 3 nr
+封开 4 v
+封开县 3 nr
+封开平 3 nr
+封张良 3 nr
+封徐湛 2 nr
+封得 3 v
+封得密 2 nr
+封循王 3 nr
+封忠王 2 nr
+封怀王 2 nr
+封思北 2 nr
+封恭亲王 3 nr
+封成安 2 nr
+封扎萨 2 nr
+封授 4 n
+封掉 3 v
+封教噶 2 nr
+封文书 4 nr
+封文信 3 nr
+封文王子 2 nr
+封斋 13 nr
+封晋国 3 nr
+封晋王 9 nr
+封曹国 3 nr
+封木华 4 nr
+封杀 72 v
+封杀令 3 nr
+封杀出局 3 l
+封权 3 n
+封李定 2 nr
+封李德 2 nr
+封李渊 2 nr
+封条 62 n
+封来封去 3 l
+封梁国 3 nr
+封梁王 4 nr
+封楚公 3 nr
+封檀石 2 nr
+封死 97 v
+封毕万 3 nr
+封氏观 2 nr
+封氏闻 5 nr
+封汉安 3 nr
+封沈王 3 nr
+封河 3 nr
+封法 3 n
+封泥 45 n
+封泰山 2 nr
+封海西 3 nr
+封淇阳 2 nr
+封港 3 nr
+封潞国 4 nr
+封火 6 n
+封灵藏 3 nr
+封炎帝 2 nr
+封点 3 n
+封燕铁 2 nr
+封爱育 2 nr
+封爵 203 nr
+封片 3 n
+封牢 3 nr
+封特进 3 nr
+封猗卢 2 nr
+封率义 2 nr
+封王信 2 nr
+封王爵 7 nr
+封王礼 7 nr
+封琼英 2 nr
+封申伯 2 nr
+封电子邮件 3 l
+封疆 158 nr
+封皇后 3 nr
+封皮 110 n
+封盖 21 nr
+封盘 3 n
+封短信 2 nr
+封祁国 2 nr
+封神 3 nr
+封神榜 10 nr
+封神演义 15 l
+封禁 22 v
+封禁强 2 nr
+封禅 90 nr
+封禅台 4 nr
+封秦庄 2 nr
+封立 2 v
+封笔 2 n
+封箱 3 n
+封箱机 3 n
+封缄 3 nr
+封罗虎 4 nr
+封耶律 2 nr
+封耿仲 2 nr
+封肃 6 a
+封育 3 vn
+封胡羯末 3 t
+封胡遏末 3 nr
+封臣 19 nr
+封英布 3 nr
+封英王 2 nr
+封莱国 3 nr
+封营平 2 nr
+封萧国 2 nr
+封萨迦 3 nr
+封蔡国 5 nr
+封蜡 3 n
+封装 112 v
+封装数据 2 l
+封西平 3 nr
+封识 3 n
+封诰 6 v
+封诸吕 4 nr
+封豕长蛇 3 i
+封豨修蛇 3 v
+封豫王 3 nr
+封贝子 4 nr
+封贾诩 2 nr
+封资修 12 l
+封赏 133 v
+封赏公 2 nr
+封赏竺 2 nr
+封赏银 2 nr
+封赠 3 v
+封赵国 5 nr
+封赵王 4 nr
+封起 3 v
+封路 7 n
+封辅国 4 nr
+封边机 3 l
+封邑 18 nr
+封邑制 2 nr
+封邓禹 2 nr
+封邦建国 3 nr
+封邱门 3 nr
+封郑国 6 nr
+封郡公 2 nr
+封郡王 5 nr
+封郭表 2 nr
+封里 3 nr
+封金挂印 2 nz
+封钜鹿 3 nr
+封销 3 v
+封锁 1836 nr
+封锁消息 3 l
+封锁线 81 l
+封锁起来 3 l
+封锡禄 2 nr
+封镇国 3 nr
+封镜 3 n
+封长平 4 nr
+封门 25 n
+封闭 1762 v
+封闭剂 3 n
+封闭器 3 n
+封闭型 13 n
+封闭式 204 n
+封闭性 48 n
+封闭抗体 3 n
+封闭液 3 n
+封闭疗法 5 n
+封闭系统 3 l
+封阻 2 v
+封阻剂 3 n
+封陈王 3 nr
+封隔液 3 l
+封雍国 2 nr
+封靖海 2 nr
+封面 545 n
+封面人物 3 l
+封面女郎 3 l
+封面照 3 l
+封面秀 3 nr
+封面纸 3 n
+封面设计 3 i
+封面里 3 l
+封韩信 2 nr
+封顶 164 n
+封领真 3 nr
+封飞奏 2 nr
+封食邑 2 nr
+封驳 3 v
+封高唐 2 nr
+封魏公 7 nr
+封魏国 9 nr
+封魏王 7 nr
+封魔录 3 nr
+封鲁国 3 nr
+封鲁郡 2 nr
+封齐王 5 nr
+専 6 zg
+尃 30 zg
+射 4926 v
+射上去 3 v
+射上来 3 v
+射下 3 n
+射下去 3 v
+射下来 3 v
+射不出 3 v
+射不到 3 v
+射中 177 n
+射人先射马 3 n
+射伤 28 n
+射住 3 v
+射像止啼 3 n
+射入 118 n
+射出 3 v
+射出去 3 v
+射出来 3 vn
+射击 1874 vn
+射击场 8 n
+射击理论 3 n
+射击篇 3 n
+射击类 3 n
+射击训练 3 n
+射击赛 3 n
+射击队 12 n
+射利沽名 3 n
+射到 3 v
+射向 3 n
+射器 25 n
+射回 3 vn
+射回去 3 l
+射回来 3 l
+射天狼 3 n
+射孔 20 n
+射孔液 3 n
+射射 3 v
+射干 12 n
+射弩 2 n
+射弹 3 n
+射影 127 n
+射影含沙 3 n
+射影对应 3 n
+射影直线 3 n
+射影酉群 3 vn
+射成 3 v
+射手 316 n
+射手座 3 n
+射手榜 35 n
+射手网 3 n
+射杀 102 vn
+射来 3 v
+射来射去 3 l
+射死 3 v
+射法 3 n
+射洪 3 vn
+射洪县 3 ns
+射流 60 n
+射流技术 3 n
+射源 3 n
+射灯 97 n
+射猎 65 n
+射球 3 n
+射球入门 3 n
+射电 308 vn
+射电源 3 n
+射电频率 3 n
+射界 42 n
+射石饮羽 3 n
+射程 1119 n
+射程分布 3 n
+射程远 3 n
+射穿 3 v
+射箭 352 n
+射箭场 2 n
+射篮 3 n
+射篮得分 3 n
+射精 75 n
+射精时 3 n
+射精管 7 n
+射线 1258 n
+射线作用 3 n
+射线光刻 3 n
+射线参数 3 n
+射线照片 3 n
+射线理论 3 n
+射线疗法 3 n
+射线管 21 n
+射给 3 vn
+射虎 3 n
+射表 3 n
+射角 30 n
+射起 3 v
+射过去 3 l
+射过来 3 l
+射进 3 v
+射进去 3 v
+射进来 3 v
+射速 200 n
+射钉 3 n
+射钉枪 3 n
+射门 414 n
+射门得分 3 n
+射阳 24 n
+射阳县 5 ns
+射阳河 2 ns
+射雕 3 n
+射靶 3 n
+射频 78 n
+射频卡 3 n
+射频武器 3 n
+射频溅射 3 vn
+射鱼 3 n
+射鱼指天 3 n
+尅 14 zg
+将 122305 d
+将乐县 3 n
+将令 220 n
+将伯之助 3 n
+将伯之呼 3 n
+将佐 3 n
+将作监 2 n
+将信将疑 199 i
+将兵 3 n
+将军 5935 n
+将军令 3 n
+将军位 3 n
+将军墓 20 n
+将军庙 5 n
+将军抽 3 i
+将军抽俥 3 i
+将军抽車 3 i
+将军抽车 3 i
+将军林 3 n
+将军溪 3 n
+将军级 18 n
+将军职位 3 n
+将军职权 3 n
+将军肚 2 i
+将功折罪 19 i
+将功折过 3 i
+将功抵罪 3 vn
+将功补过 17 i
+将功赎罪 27 i
+将勤补拙 3 i
+将取固予 3 i
+将台堡 23 n
+将名 3 n
+将士 2414 n
+将士用命 3 n
+将天就地 3 i
+将夺固与 3 i
+将官 173 n
+将尉 3 n
+将就一下 3 i
+将尽未尽 3 i
+将帅 137 n
+将心比心 35 i
+将心相从 3 i
+将息 76 n
+将才 130 t
+将才学 3 n
+将旗 3 n
+将无作有 3 i
+将无做有 3 i
+将星 30 n
+将有助 3 i
+将本求利 3 n
+将本求财 3 n
+将机就机 3 n
+将机就计 3 i
+将李代桃 3 n
+将材 3 n
+将来 2817 t
+将校 188 n
+将次 3 t
+将欲取之 3 i
+将略 3 n
+将相 66 n
+将相之器 3 i
+将相和 12 i
+将章 3 n
+将胸比肚 3 i
+将虾钓鳖 3 n
+将要 540 d
+将计就计 59 i
+将近 524 t
+将进酒 3 n
+将遇良才 3 n
+将遇良材 3 n
+将错就错 52 i
+将门 114 n
+将门之后 3 i
+将门有将 3 n
+将门虎子 3 n
+将顺其美 3 i
+将领 2977 n
+将飞翼伏 3 i
+將 2 zg
+專 7 zg
+尉 324 nr
+尉中唯 2 nr
+尉伍琼 2 nr
+尉健行 201 nr
+尉冉兴 2 nr
+尉刘璋 2 nr
+尉即军 2 nr
+尉召亚 2 nr
+尉奉晋 2 nr
+尉官 30 nr
+尉屠耆 2 nr
+尉巩永 6 nr
+尉常惠 2 nr
+尉张璩 2 nr
+尉所领 3 nr
+尉曹宽 2 nr
+尉李膺 4 nr
+尉梁怀 2 nr
+尉欧阳伦 3 nr
+尉氏 28 nr
+尉氏乃 2 nr
+尉氏县 14 nr
+尉氏朱 2 nr
+尉氏洧 2 nr
+尉沐昕 256 nr
+尉犁 10 nr
+尉犁县 7 ns
+尉王祥 3 nr
+尉王肃 2 nr
+尉缭 52 nr
+尉耿夔 4 nr
+尉职如 2 nr
+尉袁绍 8 nr
+尉迟 49 nr
+尉迟乐 2 nr
+尉迟乙僧 6 nr
+尉迟伏师 2 nr
+尉迟公 4 nr
+尉迟孙 5 nr
+尉迟孙立 9 nr
+尉迟师兄 4 nr
+尉迟恭 13 nr
+尉迟敬 3 nr
+尉迟敬德 4 nr
+尉迟曜兼 3 nr
+尉迟氏 6 nr
+尉迟眺 2 nr
+尉迟胜 4 nr
+尉迟胜入 3 nr
+尉迟连 7 nr
+尉迟迥 13 nr
+尉遂成 2 nr
+尉陈汤 2 nr
+尉领兵 2 nr
+尉领其 3 nr
+尉领护 3 nr
+尉高俅 3 nr
+尉魏思 2 nr
+尉黄琬 2 nr
+尉黎王 2 nr
+尊 2156 q
+尊严 1289 a
+尊严感 5 n
+尊为 3 v
+尊主 38 v
+尊主泽民 3 n
+尊亲 16 n
+尊令 3 n
+尊位 3 n
+尊俎折冲 3 i
+尊像 3 v
+尊卑 142 n
+尊卑不分 3 l
+尊口 3 n
+尊古卑今 3 n
+尊号 359 n
+尊命 3 v
+尊处 3 v
+尊大人 3 n
+尊夫人 28 nrt
+尊奉 62 v
+尊姓 186 n
+尊姓大名 3 i
+尊威 2 n
+尊容 27 n
+尊崇 157 v
+尊师 166 n
+尊师爱徒 3 i
+尊师爱生 3 i
+尊师贵道 3 i
+尊师重教 19 n
+尊师重道 8 n
+尊年尚齿 3 l
+尊府 3 n
+尊敬 840 v
+尊敬师长 3 i
+尊敬老师 3 i
+尊无二上 3 l
+尊旨 3 n
+尊称 155 v
+尊翁 3 n
+尊老 8 a
+尊老敬老 2 i
+尊老爱幼 19 l
+尊者 41 n
+尊荣 149 v
+尊贤使能 3 i
+尊贤爱才 3 i
+尊贵 353 a
+尊贵型 3 n
+尊重 2383 a
+尊重事实 3 n
+尊重人才 3 n
+尊重人权 3 n
+尊重知识 3 i
+尊重群众 3 i
+尊长 79 v
+尊颜 3 n
+尊驾 185 v
+尊龙 3 n
+尋 7 zg
+尌 92 zg
+導 2 zg
+小 57969 a
+小三 3 nr
+小三儿 3 nr
+小三和弦 3 nr
+小三子 3 nr
+小三峡 23 nr
+小三房 3 nr
+小三角 3 nr
+小三轮 2 nr
+小三通 3 nr
+小三阳 31 nr
+小不忍则 3 i
+小不忍则乱大谋 16 i
+小不点 7 d
+小不点儿 10 l
+小丐 21 n
+小丑 80 nr
+小丑跳梁 3 i
+小丑鱼 3 nr
+小丘 80 nr
+小业主 27 n
+小丛情 2 n
+小东小西 3 nr
+小东江 2 nr
+小东西 82 nr
+小东邪 3 nr
+小东门 3 nr
+小两口 48 n
+小两口儿 3 n
+小两口子 3 n
+小个儿 3 n
+小个子 42 n
+小丫头 143 nr
+小中见大 4 nr
+小丰营村 3 nr
+小串 3 n
+小丸子 3 nr
+小丹根 5 nr
+小主教 3 nz
+小么儿 2 nr
+小义 5 n
+小乐 7 n
+小乔木 12 nr
+小乘 99 nr
+小九九 9 nr
+小九卿 4 nr
+小书 3 n
+小书童 3 n
+小买卖 14 l
+小争执 3 nr
+小事 1017 n
+小事一桩 35 i
+小事儿 18 n
+小事化 8 n
+小事化了 13 l
+小事化无 3 l
+小事糊涂 3 i
+小二 3 nr
+小二仙 4 nr
+小二哥 3 nr
+小二子 6 nr
+小二黑 16 nr
+小于 873 v
+小于号 3 nr
+小于霏霏 3 nr
+小五义 3 nr
+小五台 3 nr
+小五台山 14 ns
+小五郎 3 nr
+小五金 4 nr
+小井 10 n
+小井庄 3 nr
+小亚丁 2 nr
+小亚细亚 3 ns
+小产 4 n
+小亨特 3 nr
+小亭 5 nr
+小亮亮 2 nr
+小人 1640 n
+小人之交 3 i
+小人书 9 n
+小人儿 46 nr
+小人儿书 3 n
+小人国 3 ns
+小人得志 14 n
+小人物 63 n
+小仗 3 n
+小付 3 v
+小令 38 n
+小仪法 2 nr
+小仲马 9 nr
+小件 34 n
+小任 6 n
+小企业 129 n
+小伍 4 n
+小众 3 n
+小众文化 3 nz
+小伙 118 n
+小伙伴 24 n
+小伙儿 23 n
+小伙子 949 n
+小伙计 36 n
+小会 3 n
+小伞 3 n
+小传 28 nr
+小体 3 n
+小作坊 20 n
+小侄 3 n
+小侄女 3 n
+小侧窗 3 nr
+小便 203 nr
+小便器 3 n
+小便宜 18 nr
+小便斗 3 nr
+小便池 3 nr
+小保姆 3 nr
+小俩口 3 m
+小修 17 nr
+小偏宜 3 i
+小偷 183 d
+小偷儿 3 i
+小偷小摸 10 i
+小偷版 3 l
+小傢伙 3 vn
+小僧人 3 nr
+小僧修 3 nr
+小僧心 2 nr
+小僧恭 2 nr
+小僧谨 2 nr
+小儿 607 n
+小儿子 157 nr
+小儿痲痹 3 v
+小儿科 42 nr
+小儿麻痹 11 n
+小儿麻痹症 16 n
+小兄弟 175 nr
+小光盘 3 nr
+小克鼎 2 nr
+小兔 3 n
+小兔兔 3 nr
+小兔子 3 nr
+小公共 5 b
+小公子 2 n
+小公爷 15 nr
+小公牛 3 nr
+小公鸡 3 n
+小兰子 8 nr
+小兰屿 2 nr
+小兴凯 4 nr
+小兴安岭 70 ns
+小兵 87 n
+小兽 12 n
+小册 3 n
+小册子 158 n
+小写 37 n
+小写字母 3 n
+小军 11 n
+小军军 15 nr
+小军监 3 nr
+小军舞 2 nr
+小军飞 2 nr
+小军鼓 3 nr
+小农 173 n
+小农意识 2 n
+小农经济 61 n
+小冰月 5 nr
+小冰期 5 nr
+小冲突 3 nr
+小凉山 11 nr
+小凌河 3 nr
+小凤仙 5 nr
+小凤儿 8 nr
+小凤笑 3 nr
+小刀 174 n
+小刀会 3 nr
+小分 13 n
+小分队 183 n
+小划子 3 n
+小则 3 n
+小利 17 n
+小别 3 d
+小别墅 3 n
+小到中雨 22 l
+小到中雪 12 l
+小剂 3 n
+小剂量 3 n
+小前提 4 nr
+小剧场 32 n
+小力 2 n
+小力微 2 nr
+小动 3 n
+小动作 50 n
+小动画 3 n
+小动脉 3 n
+小勃律 24 nr
+小勐养 3 nr
+小勺 7 nr
+小包 159 n
+小包装 3 n
+小化子 2 n
+小匙 3 n
+小区 414 n
+小区业主 3 n
+小升初 3 nr
+小半 45 d
+小半夜 2 t
+小半截 9 m
+小半条 3 n
+小半杯 2 n
+小半瓶 6 n
+小半碗 14 n
+小半罐 2 n
+小半袋 2 n
+小卒 54 n
+小卖部 28 n
+小南河 6 nr
+小博尔 71 nr
+小厂 3 n
+小历 3 n
+小原 24 n
+小厨 3 n
+小厨房 3 vn
+小厮 466 n
+小友 9 n
+小友杨 3 nr
+小双儿 2 nr
+小双底 3 nr
+小双明 4 nr
+小双桥 2 nr
+小发明 3 nr
+小发财 3 nr
+小叔 12 nr
+小叔之 2 nr
+小叔叔 3 nr
+小叔子 35 nr
+小受大走 3 i
+小叠 3 z
+小口 3 n
+小口径 149 n
+小口袋 21 n
+小叮当 3 l
+小可 239 nr
+小可心 2 nr
+小可怜儿 3 nr
+小可爱 3 nr
+小史 279 n
+小叶 144 n
+小叶杨 7 nr
+小号 59 n
+小号手 3 n
+小吃 938 n
+小吃店 25 n
+小吃摊 7 l
+小吃街 4 n
+小吃部 5 n
+小吃铺 2 n
+小吃馆 3 n
+小合唱 2 n
+小名 76 n
+小名儿 21 nr
+小名头 4 n
+小吏 89 n
+小吕姐姐 3 nr
+小周 3 n
+小周天 3 nr
+小命 148 n
+小命儿 12 nr
+小咬 6 nr
+小品 282 n
+小品文 39 n
+小哥 13 n
+小哥儿 3 nr
+小商 60 n
+小商品 35 n
+小商品生 3 n
+小商品经 3 n
+小商小贩 3 n
+小商店 3 n
+小商贩 29 n
+小喇叭 3 n
+小喇叭手 3 n
+小喜 3 nr
+小喜宝 4 nr
+小喽啰 3 nr
+小嗓 4 n
+小嘎儿 13 nr
+小嘎子 55 nr
+小嘴儿 3 nr
+小器 17 n
+小器作 3 n
+小器易盈 3 l
+小嚐 3 z
+小囊 24 n
+小四儿 9 nr
+小四喜 3 nr
+小四轮 2 m
+小团体 46 n
+小园 2 n
+小园丘 3 nr
+小园赋 3 nr
+小国 193 ns
+小国寡民 10 nr
+小图标 3 nr
+小圆圈 3 n
+小圆块 3 n
+小圆孔 2 nr
+小圆点 3 n
+小圆环 2 nr
+小圆邻 2 nr
+小圈 3 n
+小圈圈 3 n
+小圈子 34 nr
+小土 3 n
+小土岭 6 nr
+小土梁 3 nr
+小土豆 3 n
+小地主 3 n
+小场 3 n
+小场地 3 n
+小坑 20 n
+小块 3 n
+小块头 3 d
+小坚果 3 nr
+小坪数 3 nr
+小型 1652 b
+小型企业 3 n
+小型化 58 n
+小型张 10 n
+小型战船 3 nz
+小型机 19 n
+小型机械 3 n
+小型汽车 3 n
+小型货车 3 n
+小型赛车 3 n
+小型车 16 n
+小城 495 n
+小城邦 21 nr
+小城镇 62 nr
+小堂哥 3 nr
+小堂妹 3 nr
+小堂姊 3 nr
+小堂姊夫 3 nr
+小堂嫂 3 nr
+小堂弟 3 nr
+小堆 3 n
+小声 1161 n
+小声点 3 n
+小壶 3 n
+小处着手 3 l
+小夏 3 n
+小夜曲 18 nr
+小夜灯 3 n
+小夜班 3 nr
+小夥子 3 v
+小大由之 3 nr
+小天使 3 nr
+小天地 3 n
+小天池 2 nr
+小天狼星 3 nr
+小天鹅 40 nr
+小天鹅集团 2 nz
+小太监 137 nr
+小太郎 6 nr
+小头 3 n
+小头小脸 3 i
+小头鬼 3 n
+小奇子 11 nr
+小奏鸣曲 3 n
+小奖 3 n
+小奖章 3 n
+小套 3 n
+小女 260 n
+小女儿 134 nr
+小女子 105 nr
+小女孩 263 n
+小女巫 3 nr
+小女生 3 nr
+小女警 3 n
+小奴 2 n
+小奴恩 2 nr
+小妇人 15 n
+小妖 3 n
+小妖女 3 n
+小妖怪 3 i
+小妖精 12 n
+小妞 33 nr
+小妞儿 54 nr
+小妮子 36 nr
+小妹 246 n
+小妹夫 3 nr
+小妹妹 14 nr
+小妹子 87 nr
+小姊夫 3 nr
+小姊姊 3 nr
+小姐 4414 nr
+小姐儿 2 nr
+小姐姐 3 nr
+小姑 76 n
+小姑丈 3 nr
+小姑妈 3 nr
+小姑姑 3 nr
+小姑娘 891 nr
+小姑子 12 nr
+小姑独处 3 n
+小姓 3 n
+小姨 23 nr
+小姨丈 3 nr
+小姨妈 3 nr
+小姨子 19 nr
+小威廉 2 nr
+小娃 176 nr
+小娃儿 3 nr
+小娃子 3 nr
+小娇娘 2 nr
+小娈童 9 nr
+小娘子 53 nr
+小婆子 2 nr
+小婶 3 n
+小婿 3 n
+小媳妇 45 n
+小嫦娥 5 nr
+小子 3004 n
+小子后生 3 nr
+小孔 679 n
+小字 462 n
+小字体 3 n
+小字报 3 n
+小字辈 8 n
+小孙女 3 nr
+小孙子 37 nr
+小孙孙 8 nr
+小季 2 n
+小孤山 3 nr
+小学 3296 n
+小学同学 3 n
+小学教师 3 n
+小学文化 3 n
+小学校 99 n
+小学校长 3 n
+小学版 3 n
+小学生 556 nr
+小学老师 3 n
+小学部 3 n
+小孩 1589 n
+小孩儿 182 n
+小孩子 1026 n
+小安子 2 nr
+小宗 50 nr
+小宗之 3 nr
+小官 3 n
+小宝 119 nr
+小宝吁 2 nr
+小宝妈 2 nr
+小宝娘 2 nr
+小宝宝 43 nr
+小宝极 2 nr
+小宝爹 2 nr
+小宝相 2 nr
+小宝笑 3 nr
+小宝舒 2 nr
+小宝贝 3 nr
+小客车 3 n
+小室 37 n
+小宫 7 n
+小家 50 n
+小家伙 122 nr
+小家具 3 n
+小家子 6 nr
+小家子气 19 n
+小家庭 40 nr
+小家电 26 n
+小家碧玉 27 nr
+小家鼠 7 nr
+小容 5 n
+小容子 10 nr
+小富 3 n
+小富即安 4 i
+小寒 25 n
+小寨 41 nr
+小寨亦 2 nr
+小寨子 4 nr
+小寿星 3 nr
+小将 575 n
+小尉迟 2 nr
+小小 1108 b
+小小不言 3 i
+小小子 3 nr
+小小子儿 4 nr
+小小年纪 3 n
+小小庵 2 nr
+小小白 3 nr
+小小的 2061 z
+小小罗 3 nr
+小小花 2 nr
+小小说 8 l
+小小鱼 3 nr
+小小鸟 3 nr
+小少爷 11 nr
+小尔依 79 nr
+小尔雅 3 nr
+小尾寒羊 4 nr
+小尾巴 3 nr
+小尾羊 3 nr
+小屁孩 4 nr
+小居士 2 nr
+小屈大伸 3 i
+小屈大申 3 i
+小屋 428 n
+小展弦 3 nr
+小屯村 19 nr
+小山 287 nr
+小山包 20 n
+小山坡 3 nr
+小山头 3 n
+小山子镇 3 nr
+小山屋 3 n
+小山峰 2 nr
+小山村 3 nr
+小山湾 2 nr
+小山羊 3 nr
+小岗村 21 nr
+小岛 492 n
+小岛屿 3 nr
+小崽子 20 n
+小川 7 nr
+小川武 2 nr
+小巢 3 n
+小工 64 n
+小巧 150 n
+小巧玲珑 55 i
+小巫师 3 nr
+小巫见大 3 i
+小巫见大巫 23 i
+小差 20 n
+小己得失 3 i
+小巴 7 n
+小巷 196 n
+小巷子 23 nr
+小市 9 n
+小市民 26 n
+小市镇 28 nr
+小布 3 nr
+小布什 3 nr
+小布衫 2 nr
+小帅哥 5 nr
+小师叔 11 nr
+小师弟 11 nr
+小常识 3 n
+小帽 63 n
+小帽子 3 n
+小幅 98 n
+小幅度 3 d
+小平头 3 n
+小平房 3 n
+小平面 2 n
+小年夜 3 t
+小幸 2 n
+小幸童 2 nr
+小幺儿 19 nr
+小广播 3 nr
+小庄子 2 nr
+小床 3 n
+小店 212 n
+小店主 10 n
+小店区 3 ns
+小康 735 nr
+小康之家 93 nr
+小康人家 3 n
+小康县 513 nr
+小康型 4 nr
+小康家庭 3 nr
+小康村 7 nr
+小康水平 3 nr
+小康生活 3 nr
+小康社会 3 n
+小廉大法 3 nr
+小廉曲谨 3 nr
+小建 151 nr
+小异 6 n
+小异大同 3 i
+小引 3 nr
+小弟 1184 n
+小弟弟 3 nr
+小张 302 n
+小张乙 4 nr
+小张侯 3 nr
+小张庄 3 nr
+小强 70 nr
+小彬彬 3 i
+小彭云 2 nr
+小影 16 n
+小影霸 3 nr
+小往大来 3 i
+小径 152 n
+小徒儿 4 nr
+小徒君 3 nr
+小得多 3 d
+小德出入 3 nr
+小德子 189 nr
+小心 2441 n
+小心眼 26 n
+小心眼儿 18 n
+小心翼翼 503 i
+小心谨慎 136 i
+小怜 2 v
+小性儿 26 nr
+小恩 3 nr
+小恩子 2 nr
+小恩小惠 15 nr
+小惟惟 4 nr
+小惠 7 nr
+小惠全 2 nr
+小惩大诫 3 i
+小意儿 2 n
+小意思 11 nr
+小慧妹妹 7 nr
+小慧子 7 nr
+小憩 45 nr
+小戏 64 n
+小成 3 nr
+小截 3 v
+小户 56 n
+小户人家 22 n
+小户型 3 n
+小房 61 n
+小房子 3 n
+小房间 3 n
+小扁豆 3 nr
+小手 253 n
+小手小脚 9 z
+小手帕 3 n
+小手指 29 nz
+小手指头 7 n
+小手柄 3 n
+小才大用 3 nr
+小才子 3 nr
+小打小闹 40 l
+小批量 3 n
+小抄 3 b
+小抄儿 3 n
+小把戏 3 n
+小护士 8 n
+小报 48 n
+小抽 3 nz
+小拇哥儿 3 n
+小拇指 18 n
+小拉曼 2 nr
+小拜 3 ns
+小拜拜 3 ns
+小拥宪 6 nr
+小括号 3 n
+小拳 3 n
+小拳头 3 n
+小拼 3 v
+小指 118 n
+小挫 3 v
+小振动 3 nr
+小捆 3 m
+小排场 3 n
+小排量 3 n
+小推车 15 n
+小提琴 369 nr
+小提琴家 37 n
+小提琴手 13 n
+小提琴曲 3 n
+小提示 3 nr
+小提箱 3 n
+小搏 2 n
+小摊 309 n
+小摊贩 11 n
+小支 3 n
+小教室 3 n
+小教父 3 n
+小数 90 n
+小数位 3 n
+小数点 38 n
+小数目 3 n
+小敲小打 3 i
+小文臣 3 nr
+小斗篷 3 n
+小方 3 n
+小方块 3 n
+小方桌 3 n
+小旅行车 3 n
+小族 3 n
+小旗 23 nr
+小无须鳕 3 n
+小日子 10 nr
+小旦 48 d
+小早川 3 nr
+小时 8143 n
+小时了了 2 l
+小时候 593 n
+小时工 52 nr
+小时数 13 n
+小明武 2 nr
+小明王 13 nr
+小星 3 n
+小星星 2 nr
+小春 10 nr
+小春作物 3 n
+小昭喜 2 nr
+小昭寺 8 nr
+小昭忽 2 nr
+小昭笑 4 nr
+小景 16 n
+小暑 12 n
+小暴君 3 nr
+小曲 118 n
+小曲儿 28 nr
+小曼奇 2 nr
+小月儿 3 nr
+小有作为 3 n
+小有名气 46 i
+小有成就 3 i
+小有所成 3 i
+小朋友 230 n
+小朝廷 9 nr
+小木凳 2 nr
+小木屋 3 n
+小木虫 3 nr
+小木车 3 n
+小木鼎 5 nr
+小本 3 n
+小本书 3 n
+小本买卖 3 l
+小本儿 6 nr
+小本生意 28 n
+小本票 3 n
+小本经营 10 n
+小朵 2 n
+小机枪 3 n
+小杂种 3 n
+小权 4 n
+小李广 3 nr
+小李飞刀 3 nr
+小材大用 3 n
+小村 207 n
+小村之恋 3 nr
+小村子 21 nr
+小村武 4 nr
+小村镇 7 nr
+小来亨 5 nr
+小杨姐姐 2 nr
+小杨春 2 nr
+小杯 27 n
+小松山 4 nr
+小松林 5 nr
+小板 3 n
+小枉大直 3 i
+小林 267 nr
+小林光一 3 nr
+小林多喜 2 nr
+小林子 11 nr
+小林实 2 nr
+小林觉 3 nr
+小果 2 n
+小枝 3 n
+小枣 11 n
+小枣树 2 nr
+小枪 3 n
+小架 3 n
+小柜子 3 n
+小柱 3 nr
+小柱子 3 nr
+小柴胡 3 nr
+小标题 48 n
+小树 126 n
+小树林 11 nr
+小树枝 3 nr
+小树苗 3 nr
+小栗旬 3 nr
+小校发 2 nr
+小校奉 2 nr
+小校飞 4 nr
+小株 3 n
+小样 9 n
+小样儿 2 nr
+小格 6 n
+小格子 3 nr
+小格格 32 nr
+小桂子 320 nr
+小桌 31 n
+小桌子 3 nr
+小桥 103 nr
+小桥流水 28 ns
+小桶 3 n
+小梅沙 3 nr
+小棒头 3 n
+小棚 14 n
+小椅子 3 n
+小楷 28 nr
+小楷笔 3 nr
+小楼 199 n
+小榄 3 n
+小檗 29 n
+小欣月 19 nr
+小歇片刻 3 n
+小歌剧 3 n
+小步 77 d
+小步舞曲 3 n
+小段 3 n
+小毛 87 n
+小毛头 3 n
+小毛毛 3 nr
+小毛病 3 n
+小毛驴 3 nr
+小民 177 n
+小气 84 n
+小气候 61 n
+小气泡 3 n
+小气鬼 5 n
+小水 3 n
+小水滴 3 n
+小水电 32 n
+小汇报 3 n
+小汛 3 n
+小池 8 n
+小汤 5 n
+小汤山 6 nr
+小汽车 127 n
+小沙丘 3 nr
+小沙弥 3 nr
+小沟 3 n
+小河 255 nr
+小河区 3 ns
+小河口 514 ns
+小河口镇 256 ns
+小河子村 3 nr
+小河沟 7 ns
+小河边 41 nr
+小泉 115 nr
+小法雅 3 nr
+小波 2 nr
+小波浪 3 nr
+小注 3 v
+小泽一郎 2 nr
+小泽征尔 8 nr
+小泽真珠 3 nr
+小洋 8 n
+小洋房 3 n
+小洞 3 n
+小洞天 3 nr
+小津安 12 nr
+小津通 2 nr
+小洪山 2 nr
+小派 3 n
+小流氓 23 n
+小济 2 n
+小浪底 16 n
+小海 13 ns
+小海子 2 nr
+小海豚 3 n
+小海龟 3 nr
+小涨 3 v
+小涵 4 n
+小淘气 3 n
+小淫虫 3 nz
+小混混 3 nr
+小混蛋 2 nr
+小清河 19 nr
+小渊惠 32 nr
+小渊惠三 3 nr
+小温 23 n
+小港 25 ns
+小游园 3 n
+小游戏 3 n
+小湖 59 nr
+小源 2 n
+小溪 182 nr
+小溪水 3 nr
+小溪流 3 nr
+小滴 3 n
+小演员 3 n
+小潘潘 3 nr
+小潮 3 nr
+小瀑布 3 nr
+小瀛洲 2 nr
+小灌丛 2 nr
+小火 74 n
+小火柴 3 n
+小火花 3 n
+小火锅 3 n
+小灵狐 4 nr
+小灵通 84 nr
+小灶 16 n
+小炉儿匠 3 n
+小炉匠 3 n
+小炒 13 v
+小点 59 n
+小点儿 3 nr
+小点声 3 nr
+小点心 3 n
+小照 9 n
+小熊 10 n
+小熊座 18 nr
+小熊星座 3 n
+小熊猫 17 nr
+小熊维尼 3 nr
+小燕儿 2 nr
+小燕子 13 nr
+小爬虫 10 n
+小片 3 n
+小版张 3 n
+小牌 3 n
+小牌明星 3 n
+小牌歌星 3 n
+小牙症 3 n
+小牛 380 n
+小牛犊 6 n
+小牛皮 3 nr
+小牛肉 3 n
+小牛队 84 n
+小牢子 9 nr
+小牧童 4 n
+小牺牲 3 i
+小犬 13 nr
+小狐 3 nz
+小狗 155 nr
+小狗儿 2 nr
+小狗子 3 nr
+小狗狗 3 nr
+小狮子 3 nr
+小猩猩 3 n
+小猪 3 n
+小猪猪 3 n
+小猫 10 n
+小猫儿 2 nr
+小猫咪 3 nr
+小猫熊 3 nr
+小猫猫 3 nr
+小猴子 3 nr
+小玄子 123 nr
+小玉儿 2 nr
+小王子 88 nr
+小王将军 3 nr
+小王庄 5 nr
+小王爷 46 nr
+小玩意 3 v
+小玩意儿 3 n
+小玩艺 3 nr
+小玩艺儿 3 nr
+小玫瑰 7 nr
+小环藻 2 nr
+小玲子 126 nr
+小珠 3 n
+小珠儿 2 nr
+小珠山 2 nr
+小班 25 n
+小班制 3 n
+小班化 3 n
+小球 101 n
+小球儿 4 n
+小球员 3 n
+小球性 3 n
+小球童 2 n
+小球藻 11 n
+小球迷 3 n
+小琉球 3 nr
+小瑶瑶 5 nr
+小瓣 3 n
+小瓶 3 n
+小瓶玉 2 nr
+小瓶酒 3 n
+小甜甜 7 nr
+小生 172 n
+小生产者 50 n
+小生境 7 n
+小生意 3 n
+小田和正 3 nr
+小男孩 3 n
+小男生 3 nr
+小病 55 n
+小登科 3 nr
+小白兔 6 nr
+小白旗 3 nr
+小白桦 3 nr
+小白猪 3 n
+小白羊 5 nr
+小白脸 3 nr
+小白脸儿 3 nr
+小白花 3 n
+小白菜 264 n
+小白虎 3 nr
+小白鹭 17 nr
+小白鼠 3 n
+小白龙 2 nr
+小百货 3 n
+小皇爷 2 nr
+小盂鼎 6 nr
+小盐 4 n
+小监 4 n
+小盒 3 n
+小盒子 3 nr
+小盘 27 n
+小盘子 4 n
+小盘股 2 n
+小目 4 n
+小相公 3 nr
+小相岭 8 nr
+小看 201 v
+小看人 3 nr
+小真真 6 nr
+小眼 74 n
+小眼薄皮 3 l
+小睡 19 nr
+小瞧 48 v
+小矮个 2 n
+小石 13 n
+小石坝 5 nr
+小石城 9 nr
+小石头 3 n
+小石子 3 nr
+小石桥 277 nr
+小砖 3 n
+小破孩 3 n
+小碗 3 n
+小碟 32 n
+小磨 19 n
+小礼 5 nr
+小礼堂 3 nr
+小礼拜 3 nr
+小礼拜堂 3 nr
+小礼拜室 3 nr
+小社儿 2 nr
+小祝融 2 nr
+小神 6 n
+小神通 3 nr
+小神锋 8 nr
+小票 8 n
+小禁区 3 n
+小福临 19 nr
+小福晋 4 nr
+小福王 3 nr
+小秋收 3 nr
+小种 30 n
+小种红茶 3 n
+小秘书 3 nr
+小秘方 3 nr
+小秦淮 8 nr
+小程 2 n
+小税 3 n
+小穗含 3 nr
+小穗基 2 nr
+小穴 3 n
+小穴穴 3 n
+小穹顶 3 z
+小窍门 3 i
+小窗 26 n
+小站 126 n
+小站稻 5 n
+小章鱼 3 nr
+小童 76 n
+小童儿 4 nr
+小童子 2 nr
+小竹林 5 nr
+小竹笛 2 nr
+小笠 15 n
+小笨蛋 3 l
+小笼 3 n
+小笼包 4 n
+小笼包子 2 n
+小笼子 3 n
+小筐 3 n
+小算盘 29 n
+小箱 3 n
+小箱子 3 nr
+小篆 53 n
+小篇幅 3 n
+小簧风琴 3 n
+小米 396 n
+小米粥 30 n
+小米面 3 n
+小米饭 3 n
+小粉 12 n
+小粒 3 n
+小粗坑 3 l
+小精灵 27 nr
+小系 3 n
+小红参 3 nr
+小红山 2 nr
+小红帽 10 n
+小红旗 4 nr
+小红本 3 nr
+小红点 3 n
+小红花 4 nr
+小红莲 3 nr
+小红道 7 nr
+小红门 3 nr
+小红马 113 nr
+小约翰 5 nr
+小纱柜 2 nr
+小纺 3 b
+小组 3116 n
+小组会 21 n
+小组会议 3 n
+小组活动 3 l
+小组第一 3 l
+小组讨论 3 n
+小组赛 96 n
+小组长 6 n
+小绍兴 2 nr
+小结 52 n
+小绵羊 6 nr
+小绿岛 3 nr
+小网膜 3 n
+小罗号 3 nr
+小羊 3 n
+小羊皮 3 nr
+小美人 3 nr
+小美女 3 nr
+小美眉 4 nr
+小群 66 n
+小羽柄 3 nr
+小翼 10 n
+小老儿 26 nr
+小老头 3 nr
+小老头儿 3 n
+小老婆 130 nr
+小老弟 3 nr
+小老虎 3 nr
+小老鼠 3 nr
+小考 10 nr
+小考小玩 3 nr
+小者 3 n
+小而全 3 i
+小而精 3 i
+小耳朵 3 nr
+小聪明 17 nr
+小肚 12 n
+小肚儿 3 n
+小肚子 20 n
+小肚腩 3 n
+小肚鸡肠 11 n
+小肠 238 n
+小肠俞 3 nr
+小股 3 n
+小股民 3 n
+小肥羊 3 nr
+小胖 3 z
+小胜凯 2 nr
+小胡子 44 nr
+小胡桃 3 nr
+小脉管 3 n
+小脑 112 n
+小脚 88 n
+小脚丫 3 nr
+小脚印 2 n
+小脚女人 4 n
+小脚趾头 3 n
+小脸儿 4 nr
+小脸蛋 3 nr
+小腹 449 n
+小腿 181 n
+小腿肉 3 n
+小腿肚 3 n
+小腿肚子 6 n
+小膜 3 n
+小臂 17 n
+小臣 106 n
+小臣墙 2 nr
+小臣宅 2 nr
+小舅 7 n
+小舅妈 3 n
+小舅子 57 n
+小舅母 3 n
+小舅舅 3 n
+小舌 7 n
+小舍儿 2 nr
+小舟 171 nr
+小舱口 3 ns
+小船 612 n
+小船坞 3 n
+小艇 178 n
+小色狼 3 nr
+小艺 17 n
+小节 161 n
+小节目 3 n
+小花 118 n
+小花招 3 nr
+小花样 3 l
+小花狗 5 nr
+小花猫 3 n
+小花脸 3 n
+小苍兰 3 nr
+小苏 14 ns
+小苏学士 2 nr
+小苏打 8 nr
+小苗 13 n
+小若若 3 nr
+小英予 3 nr
+小英子 17 nr
+小苹果 3 nr
+小范 3 n
+小茅屋 3 n
+小茴香 7 n
+小草 50 n
+小草原 3 nr
+小荣椿 2 nr
+小莱豆 3 nr
+小莲庄 5 nr
+小莲转 2 nr
+小菜 74 n
+小菜一碟 3 n
+小菜蛾 6 n
+小萝卜 3 n
+小萝卜头 4 n
+小董 21 n
+小葱 8 b
+小葱拌豆腐 2 n
+小蒙蒙 32 nr
+小蓟 7 nr
+小蔡惟 6 nr
+小薄氏 25 nr
+小虎子 5 nr
+小虎牙 3 nr
+小虎队 3 n
+小虫 16 n
+小虫儿 2 nr
+小虫子 3 n
+小虾 35 n
+小虾米 3 nr
+小蚂蚁 3 l
+小蛇 3 n
+小蜀兵 2 nr
+小蜂 9 n
+小蜂科 6 nr
+小蜜 3 n
+小蜜蜂 3 nr
+小蜻蜓 3 n
+小蝌蚪 3 n
+小蟊贼 3 v
+小行会 3 n
+小行星 169 n
+小行板 3 n
+小街 83 n
+小衣裳 3 n
+小补 3 b
+小表哥 3 n
+小表妹 3 n
+小表姊 3 nr
+小表姊夫 3 nr
+小表嫂 3 nr
+小表弟 3 n
+小衬衣 3 nr
+小袁营 75 nr
+小袋 30 n
+小袋装 2 n
+小袋鼠 3 n
+小袖 3 n
+小褂 31 n
+小褂儿 2 z
+小襟 3 n
+小西 168 n
+小西天 3 nr
+小西行 18 nr
+小西飞 13 nr
+小规模 69 b
+小视 48 n
+小视频 3 n
+小觑 211 v
+小角 12 n
+小角张力 3 n
+小角色 3 n
+小解 9 v
+小言 2 n
+小议 2 n
+小记 22 n
+小许 34 d
+小评 3 n
+小词 9 n
+小词库 3 nr
+小试 11 n
+小试其技 3 n
+小试牛刀 2 n
+小试锋芒 3 n
+小说 5501 n
+小说书 3 n
+小说书库 3 n
+小说作品 3 n
+小说全集 3 i
+小说史 23 n
+小说吧 3 n
+小说城 3 n
+小说家 209 n
+小说月报 3 n
+小说栏 3 n
+小说网 3 n
+小说迷 3 i
+小说集 80 n
+小说频道 3 i
+小诸臣 2 nr
+小调 115 n
+小谷 3 n
+小豆 18 n
+小豆豆 3 n
+小象 3 n
+小象虫 2 n
+小象队 3 n
+小豹 8 n
+小貂儿 2 nr
+小贝 475 nr
+小贝勒 4 nr
+小负 10 n
+小财 3 n
+小财主 3 nr
+小财神 3 nr
+小败 3 n
+小账 3 n
+小贩 213 n
+小贫 3 b
+小贫户 3 i
+小贴士 3 n
+小费 146 n
+小资 3 n
+小资产阶 3 n
+小赌 3 v
+小超人 3 nr
+小越儿 5 nr
+小趾 4 n
+小跌 3 v
+小跑 150 v
+小跑步 3 n
+小路 504 n
+小车 247 n
+小车子 3 n
+小轩窗 3 nr
+小转弯 3 n
+小轮 41 n
+小轿车 68 n
+小辈 104 n
+小辣椒 3 nr
+小辫 31 n
+小辫儿 7 n
+小辫子 23 n
+小边 3 n
+小连接体 3 n
+小迷糊 3 z
+小通草 3 n
+小道 166 n
+小道人 3 nr
+小道儿 3 nr
+小道士 34 nr
+小道消息 38 n
+小邦励 2 nr
+小邦勒 2 nr
+小邦威 12 nr
+小邦巅 2 nr
+小邦成 19 nr
+小邦裁 2 nr
+小邦象 2 nr
+小部 3 n
+小部份 3 n
+小郭襄 2 nr
+小酌 23 nr
+小酒 3 n
+小酒馆 3 n
+小酥鱼 2 n
+小释 11 v
+小里小气 2 z
+小野 21 n
+小野丽莎 3 nr
+小野秀雄 2 nr
+小野鸡尾 3 i
+小量 35 n
+小金 47 n
+小金井 3 nr
+小金人 3 n
+小金刚 3 nr
+小金县 3 nr
+小金娃 2 nr
+小金川 5 nr
+小金库 32 nr
+小金毛 3 nr
+小金蛇 3 nr
+小金铃 3 nr
+小针 3 n
+小针刀 3 nr
+小钞 2 nr
+小钢炮 214 nr
+小钦岛 2 nr
+小钩子 3 n
+小钱 99 n
+小钱币 3 n
+小钱柜 3 n
+小铁中 2 nr
+小铁铲 2 nr
+小铁锤 3 nr
+小铝矿 3 nr
+小银勺 2 nr
+小银铃 5 nr
+小铺 3 n
+小铺子 7 n
+小锅 3 n
+小错 15 nr
+小锚 3 n
+小锣 27 n
+小键盘 2 n
+小镇 362 nr
+小镇风光 3 nr
+小镜 8 n
+小镜湖 23 nr
+小长今 3 nr
+小长山 2 nr
+小长梁 6 nr
+小门 128 n
+小门儿 2 nr
+小间 3 n
+小阁儿 2 nr
+小队 245 n
+小队人马 3 n
+小队员 3 n
+小队长 50 n
+小阳春 9 nr
+小阴唇 3 nr
+小阶 3 n
+小阿儿 2 nr
+小阿尔 3 nr
+小阿敏 32 nr
+小阿沅 2 nr
+小阿紫 3 nr
+小阿苔 6 nr
+小阿雅 5 nr
+小陆 3 n
+小陇山 2 nr
+小陉 3 ns
+小院 166 n
+小院儿 3 nr
+小院门 6 n
+小除夕 3 i
+小隙沉舟 3 i
+小雅 37 nr
+小集团 12 n
+小雨 620 nr
+小雨点 3 n
+小雨雪 2 nr
+小雪 87 n
+小雪人 3 nr
+小雯雯 3 nr
+小雷音 2 nr
+小雾 3 n
+小霸王 23 nr
+小青岛 4 nr
+小青年 27 nr
+小青格 4 nr
+小青河 3 nr
+小青瓦 3 nr
+小青龙汤 3 nr
+小静先 2 nr
+小静刚 2 nr
+小静好 2 z
+小静心 2 nr
+小静挺 2 z
+小静考 2 nr
+小静脉 3 nr
+小静语录 12 n
+小面包 3 n
+小革 2 n
+小鞋 16 n
+小鞋子 3 n
+小鞋穿 3 nz
+小项 39 n
+小顺子 11 nr
+小颌症 3 n
+小题 3 n
+小题大作 16 i
+小题大做 28 i
+小题目 3 n
+小额 135 n
+小额贷款 3 n
+小风 3 n
+小飞侠 5 nr
+小飞扬草 3 i
+小飞象 3 nr
+小食 18 n
+小食店 3 n
+小食部 3 n
+小饮 3 n
+小饼 3 n
+小馒头 3 nr
+小香主 2 nr
+小香猪 3 nr
+小香玉 3 nr
+小香袋 3 nr
+小马 391 n
+小马哥 3 nr
+小马庄 7 nr
+小马拉 3 nr
+小马王 3 nr
+小马路 3 nr
+小驴 3 n
+小驴儿 2 nr
+小驴子 3 nr
+小驹儿 9 nr
+小驿 3 ns
+小骗子 3 n
+小高岭 3 nr
+小高潮 3 nr
+小高炉 3 nr
+小鬟 4 n
+小鬼 352 n
+小鬼头 34 n
+小鬼子 3 n
+小鬼当家 3 l
+小鬼难缠 3 i
+小鱼 213 n
+小鱼儿 3 nr
+小鲵 12 n
+小鸟 196 n
+小鸟依人 23 nr
+小鸟儿 8 nr
+小鸟球 3 n
+小鸟蛋 3 nr
+小鸡 120 n
+小鸡肚肠 3 n
+小鸡鸡 3 n
+小鸦 3 n
+小鸭 18 n
+小鸭子 3 n
+小鸿斌 3 nr
+小鹰 22 nr
+小鹰号 3 nr
+小鹿 113 nr
+小鹿儿 2 nr
+小麦 1683 n
+小麦产地 3 n
+小麦粉 29 nr
+小麦粥 3 n
+小麻烦 3 nr
+小黄瓜 3 n
+小黄花 3 n
+小黄鱼 29 n
+小黎 3 ns
+小黑 12 z
+小黑子 5 nr
+小黑山 3 nr
+小黑板 14 n
+小黑河 2 nr
+小黑点 3 n
+小黑猫 3 nr
+小黑裙 3 nr
+小黑麦 3 nr
+小黠大痴 3 z
+小鼐子 35 nr
+小鼓 22 n
+小鼓手 3 n
+小鼠 54 n
+小鼠洞 3 n
+小齿 2 n
+小齿轮 3 n
+小龄童 2 nr
+小龙 4342 nr
+小龙女 3 nr
+小龙子 4 nr
+小龙潭 4 nr
+小龙虾 3 nr
+尐 16 zg
+少 18155 a
+少不了 292 l
+少不得 169 l
+少不更事 19 i
+少不经事 3 l
+少东家 14 l
+少之又少 3 l
+少于 733 v
+少些 3 m
+少交 3 n
+少产 3 n
+少付 3 v
+少代会 3 n
+少伯 2 n
+少佐 3 nr
+少傅 3 n
+少儿 203 m
+少儿不宜 3 l
+少儿出版社 3 nt
+少儿百科 3 n
+少儿英语 3 nz
+少儿读物 3 n
+少儿部 7 m
+少儿馆 3 n
+少先队 42 n
+少先队员 48 n
+少典 3 n
+少冲 3 n
+少分 3 m
+少列 3 m
+少刻 36 m
+少劳少得 3 l
+少华 10 nz
+少卖 3 v
+少印 3 n
+少吃俭用 3 l
+少吃多餐 3 l
+少吊 3 n
+少吸 3 v
+少商 3 n
+少城 8 n
+少壮 31 a
+少壮派 14 nr
+少夫 3 n
+少夫人 3 nr
+少夫老妻 3 nr
+少头无尾 3 i
+少头缺尾 3 i
+少女 2727 n
+少女懒妇 3 i
+少女时代 3 l
+少女时期 3 n
+少女网 3 n
+少女装 3 n
+少奶奶 157 n
+少妇 442 n
+少子 30 n
+少安勿躁 3 i
+少安无躁 3 l
+少安毋燥 3 nr
+少安毋躁 6 i
+少宗 3 m
+少将 1396 n
+少将军官 3 n
+少尉 84 n
+少尉军官 3 nr
+少小无猜 3 i
+少小离家 3 n
+少少 3 m
+少少的 2 l
+少帅 34 n
+少帝 10 n
+少年 4039 m
+少年中国学会 11 nt
+少年之家 2 l
+少年人 75 n
+少年儿童 475 l
+少年儿童出版社 2 nt
+少年先锋 3 l
+少年宫 34 n
+少年得志 3 l
+少年心 8 l
+少年报 6 n
+少年文学 3 l
+少年时代 3 l
+少年时期 3 n
+少年期 3 n
+少年法庭 3 l
+少年游 3 n
+少年犯 27 l
+少年王 3 n
+少年班 16 n
+少年组 3 n
+少年老成 17 l
+少年老诚 3 l
+少年行 3 n
+少年装 3 l
+少年郎 3 n
+少年队 6 n
+少府 27 n
+少废话 3 l
+少康 28 a
+少引 3 n
+少征 3 n
+少待 25 v
+少心没肺 3 l
+少怀壮志 3 l
+少惹 3 v
+少惹是非 3 l
+少惹闲事 3 l
+少慢差费 3 l
+少成若性 3 l
+少扣 3 n
+少报 3 n
+少掉 3 v
+少掌柜 3 nr
+少提 3 n
+少搞 3 a
+少收 3 n
+少教所 3 n
+少数 4232 m
+少数乡 4 m
+少数党 3 n
+少数具 5 m
+少数几 5 m
+少数几个 162 m
+少数几件 2 m
+少数几位 6 m
+少数几名 5 m
+少数几处 2 m
+少数几家 4 m
+少数几条 3 m
+少数几次 2 m
+少数几片 2 m
+少数几种 16 m
+少数几部 3 m
+少数几项 2 m
+少数分 3 m
+少数十立方米 2 m
+少数干警 3 n
+少数整 3 m
+少数步 2 m
+少数民族 3371 n
+少数派 38 m
+少数票 2 n
+少数种 38 m
+少数类 3 m
+少数行 2 m
+少数车 2 n
+少时 144 n
+少有 282 v
+少条失教 3 l
+少林 1659 n
+少林功夫 9 n
+少林和尚 3 n
+少林寺 1189 nr
+少林拳 43 nr
+少林老僧 3 nr
+少林足球 3 n
+少架 3 m
+少校 151 n
+少校军官 3 n
+少棒 3 n
+少棒赛 3 nr
+少棒队 3 n
+少气无力 3 l
+少油 5 n
+少泽 5 n
+少洗 3 v
+少海 3 ns
+少点 3 m
+少烦 3 a
+少爷 741 n
+少爷兵 3 n
+少猜 3 v
+少生优生 3 l
+少生快富 7 l
+少用 3 n
+少田 3 n
+少男 22 nr
+少男少女 43 l
+少留 3 v
+少白头 3 n
+少盐没醋 3 i
+少睡 3 v
+少礼 3 n
+少私寡欲 3 i
+少算 3 n
+少管 13 n
+少管所 3 n
+少管闲事 3 l
+少纳 3 nr
+少纵即逝 3 i
+少翻 3 v
+少者 39 n
+少而精 3 l
+少耕法 3 n
+少背 3 n
+少若成性 3 l
+少蛋 2 n
+少装 3 n
+少见 458 n
+少见多怪 24 i
+少解 3 v
+少言 2 n
+少言寡语 20 i
+少计 3 n
+少记 3 n
+少讲空话 3 l
+少许 176 m
+少说两句 3 l
+少说几句 3 l
+少说多做 3 l
+少说废话 3 l
+少调 3 n
+少贴 3 n
+少走弯路 3 l
+少运 3 n
+少退 3 v
+少选 3 v
+少部分 89 m
+少采 3 n
+少量 1314 m
+少量下 3 m
+少量出 5 m
+少量列 2 m
+少量多 3 m
+少量多次 2 m
+少量多餐 4 m
+少量重 3 m
+少销 3 n
+少间 3 n
+少阳 114 n
+少阳经 13 n
+少阴 3 n
+少陪 24 nr
+少陵 8 n
+少雨 4 n
+少雾 2 n
+少顷 88 m
+少额 3 n
+尓 37 zg
+尔 3788 nr
+尔伯爵 9 nr
+尔克 8 nrt
+尔冬升 3 nr
+尔冰川 2 nr
+尔勒 2 nrt
+尔博士 3 nr
+尔发明 3 nr
+尔后 200 c
+尔塔 12 nrt
+尔多 21 nrt
+尔大娘 2 nr
+尔夫人 4 nrt
+尔姆 2 nrt
+尔少校 2 nr
+尔尔 3 nr
+尔山羊 2 nr
+尔巴 172 nrt
+尔德 75 nrt
+尔德尼 3 nr
+尔德里 13 nr
+尔文宗 9 nr
+尔斯 104 nrt
+尔曹 5 nr
+尔格 37 nrt
+尔比 4 nrt
+尔汝之交 3 nr
+尔河源 2 nr
+尔海峡 13 nr
+尔海盆 2 nr
+尔特 45 nrt
+尔王庄 2 nr
+尔瓦 17 nrt
+尔登 4 nrt
+尔维修 3 nr
+尔罕 2 nrt
+尔舍 4 nrt
+尔茨 11 nrt
+尔菲 3 nrt
+尔虞我诈 53 i
+尔西 4 nrt
+尔诈我虞 3 i
+尔语 3 nr
+尔贝尔 4 nr
+尔辈 3 n
+尔雅 86 nr
+尔雅有言 3 nr
+尔顿 98 nrt
+尕 96 ns
+尕斯库勒 3 ns
+尕海 2 ns
+尕玛 3 ns
+尕玛多吉 2 ns
+尖 2999 a
+尖儿 68 n
+尖兵 30 n
+尖凿 3 a
+尖刀 212 n
+尖刀班 3 n
+尖刀组 3 n
+尖利 124 a
+尖券 3 n
+尖刺 3 v
+尖刻 80 a
+尖刻话 3 l
+尖削 16 a
+尖劈 12 n
+尖厉 31 a
+尖叫 357 v
+尖叫声 26 n
+尖啸 3 n
+尖嗓 3 n
+尖嘴 3 ns
+尖嘴利 3 ns
+尖嘴猴腮 8 i
+尖嘴薄舌 3 i
+尖团字 3 n
+尖团音 3 n
+尖塔 43 n
+尖声 3 n
+尖声喊叫 3 i
+尖声高叫 3 i
+尖头 56 n
+尖头蝗 3 n
+尖头鞋 3 n
+尖子 81 n
+尖子班 3 n
+尖子生 21 n
+尖尖角 6 n
+尖山 22 ns
+尖山区 3 ns
+尖峭 3 a
+尖峰 22 n
+尖峰岭 7 ns
+尖形坝 3 n
+尖形滩 3 n
+尖形穹窿 3 n
+尖扎 3 v
+尖扎县 4 ns
+尖括号 3 n
+尖晶石 3 n
+尖椒 1282 n
+尖沙咀 5 ns
+尖溜溜 3 l
+尖点 3 n
+尖牙 15 ns
+尖牙卡环 3 ns
+尖瘦 3 a
+尖石 62 n
+尖碑 7 n
+尖端 275 n
+尖端技术 3 n
+尖端放电 23 l
+尖端科学 20 l
+尖端科技 3 l
+尖细 42 a
+尖脐 3 n
+尖草坪区 3 ns
+尖角 43 n
+尖言冷语 3 l
+尖言尖语 3 n
+尖轨 3 b
+尖酸 32 n
+尖酸刻薄 20 l
+尖里尖气 3 n
+尖锐 986 a
+尖锐化 58 v
+尖锐对立 3 v
+尖锐批评 3 l
+尖锐湿疣 3 n
+尖锥 10 n
+尖音 4 n
+尖顶 102 n
+尖顶帽 3 n
+尗 15 zg
+尘 989 n
+尘世 110 n
+尘世间 6 n
+尘事 2 n
+尘俗 24 n
+尘凡 3 v
+尘刹 3 n
+尘务 3 n
+尘劳 3 n
+尘嚣 12 n
+尘土 379 n
+尘土飞扬 3 i
+尘土飞杨 3 i
+尘垢 23 n
+尘垢秕糠 3 v
+尘埃 340 n
+尘埃云 5 i
+尘埃盘 3 i
+尘埃落定 51 i
+尘壤 3 n
+尘寰 14 n
+尘封 83 n
+尘封已久 3 i
+尘心 3 n
+尘暴 22 n
+尘沙 46 n
+尘海 3 n
+尘灰 3 n
+尘烟 6 n
+尘砂 2 n
+尘积网封 3 i
+尘粒 3 n
+尘缘 37 n
+尘网 6 n
+尘羹涂饭 3 i
+尘肺 51 n
+尘肺病 3 n
+尘芥 3 n
+尘螨 11 n
+尘襟尽涤 3 i
+尘迹 3 n
+尘间 3 n
+尘雾 16 n
+尘饭涂羹 3 i
+尙 8 zg
+尚 5434 d
+尚不 3 d
+尚不明 5 d
+尚不知 3 v
+尚不致命 3 i
+尚且 367 c
+尚义 35 nr
+尚义县 9 nr
+尚之信 16 nr
+尚书 4437 n
+尚书令 3 nr
+尚书府 3 nr
+尚书省 3 n
+尚书郎 3 nr
+尚以 3 c
+尚仪局 8 nr
+尚仲贤 2 nr
+尚佳 3 nr
+尚兴俣 4 nr
+尚其亨 3 nr
+尚博尔 3 nr
+尚可 220 d
+尚可一 2 nr
+尚可勉 2 nr
+尚可喜 27 nr
+尚可太 2 nr
+尚君长 6 nr
+尚和玉 6 nr
+尚善 16 v
+尚墨守 2 nr
+尚大哥 4 nr
+尚好 18 d
+尚子明 6 nr
+尚存 141 v
+尚存时 3 nr
+尚存有 4 nr
+尚宝司 10 nr
+尚家大堰 2 nr
+尚容 2 n
+尚容徐 2 nr
+尚小云 17 nr
+尚属 3 n
+尚幼 2 d
+尚应 3 v
+尚延心 6 nr
+尚弗勒 4 nr
+尚待 3 v
+尚德义 2 nr
+尚志 13 nr
+尚志县 3 nr
+尚志市 7 nr
+尚性钡 2 nr
+尚感 3 n
+尚慕杰 15 nr
+尚掌门 2 nr
+尚方剑 66 nr
+尚方宝剑 46 nr
+尚无 1439 v
+尚无不可 3 i
+尚无先例 5 i
+尚无太子 2 nr
+尚无子 2 nr
+尚无情 2 i
+尚无礼 6 nr
+尚无纤 2 nr
+尚明轩 2 nr
+尚晓华 3 nr
+尚普兰 7 nr
+尚有 1213 v
+尚有云 2 nr
+尚有何 3 nr
+尚有余 4 nr
+尚有可为 3 c
+尚有微 3 nr
+尚有情 2 n
+尚有盛 2 nr
+尚有胜 2 nr
+尚朋堂 2 nr
+尚未 3798 d
+尚未付清 3 nr
+尚未可知 3 i
+尚未埋葬 3 n
+尚校 2 n
+尚武 98 nr
+尚武精神 3 nr
+尚气 2 n
+尚沟村 3 nr
+尚活图存 3 n
+尚然 5 d
+尚父 5 n
+尚祈列 2 nr
+尚祈见 2 nr
+尚福林 20 nr
+尚绪谦 3 nr
+尚缺 3 v
+尚美英 19 nr
+尚耿二 6 nr
+尚能 3 v
+尚莒城 3 nr
+尚虚中馈 3 n
+尚衅鳌 3 nr
+尚衣 2 n
+尚衣局 2 n
+尚衣监 9 nr
+尚西泊 4 nr
+尚要 3 d
+尚贤任 2 nr
+尚贤堂 2 nr
+尚足 2 v
+尚输 3 v
+尚远 5 d
+尚逊周 2 nr
+尚金锁 2 nr
+尚锡亭 2 nr
+尚长荣 3 nr
+尚阳堡 9 nr
+尚难 2 d
+尚需 3 n
+尚非 2 d
+尚须 5 d
+尚飨 10 e
+尚鲁智 16 nr
+尛 2 zg
+尝 1295 v
+尝一尝 3 v
+尝个 3 n
+尝出 3 v
+尝到 186 v
+尝到了 3 l
+尝味 3 v
+尝尝 280 v
+尝尝鲜 2 i
+尝新 26 v
+尝来尝去 3 i
+尝点 3 v
+尝甜头 3 i
+尝胆 3 v
+尝胆卧薪 3 i
+尝胆眠薪 3 l
+尝试 1188 vn
+尝试性 7 n
+尝试法 3 v
+尝鲜 8 vn
+尝鼎一脔 2 i
+尞 15 zg
+尟 8 zg
+尡 3 zg
+尢 14 zg
+尢溪 3 nz
+尢溪县 3 nt
+尣 2 zg
+尤 2604 d
+尤万科 2 nr
+尤万诺 5 nr
+尤三姐 41 nr
+尤世威 11 nr
+尤世禄 2 nr
+尤为 856 d
+尤为重要 3 nr
+尤二姐 102 nr
+尤二姨 2 nr
+尤云殢雨 3 nz
+尤云殢雪 3 nz
+尤亲倚 2 nr
+尤以 3 d
+尤以冬 2 nr
+尤以楚 3 nr
+尤伯杯 420 nr
+尤伯杯赛 35 nz
+尤佐夫 2 nr
+尤佳 4 nr
+尤先科 3 nr
+尤其 7135 d
+尤其甚者 3 nr
+尤内斯 7 nr
+尤内斯库 3 nz
+尤利乌 15 nr
+尤利塞 3 nr
+尤利西斯 11 ns
+尤加利 2 nr
+尤加利树 3 ns
+尤卡坦 35 nr
+尤卡坦半岛 30 ns
+尤善画 2 nr
+尤国材 2 nr
+尤太太 2 nr
+尤奈斯库 3 nr
+尤奥洛 4 nr
+尤如 3 nr
+尤小刚 5 nr
+尤尔弗 3 nr
+尤尔特 5 nr
+尤尼克 3 nr
+尤尼瓦 2 nr
+尤尼科 2 nr
+尤尼莱 3 nr
+尤异 3 nr
+尤得胜 17 nr
+尤德利 2 nr
+尤拉齐 2 nr
+尤文三 2 nr
+尤文图 9 nr
+尤文图斯 140 nr
+尤文图斯队 10 nz
+尤斯特 31 nr
+尤晓畅 2 nr
+尤有甚者 3 nr
+尤有进者 3 nr
+尤杯赛 14 nz
+尤正涛 2 nr
+尤氏乃 2 nr
+尤氏凤 4 nr
+尤氏命 2 nr
+尤氏姊妹 2 nr
+尤氏心 2 nr
+尤氏惜 2 nr
+尤氏方 4 nr
+尤氏李 6 nr
+尤氏笑 29 nr
+尤清红 8 nr
+尤溪 5 nr
+尤溪县 8 nr
+尤物 41 nr
+尤特凯 4 nr
+尤瑞那 2 nr
+尤瑟纳 4 nr
+尤甚 3 d
+尤甲仁 44 nr
+尤登尼 4 nr
+尤科斯 2 nr
+尤精历 2 nr
+尤精研 2 nr
+尤精通 2 nr
+尤素夫 3 nr
+尤素福 6 nr
+尤索林 3 nr
+尤红殢翠 3 ns
+尤纳斯 19 nr
+尤维纳利斯 3 nrt
+尤老娘 13 nr
+尤而效之 3 nr
+尤艳春 2 nr
+尤花殢雪 3 nz
+尤苏巴 5 nr
+尤苏弗 2 nr
+尤莉娅 2 nr
+尤西堂 3 nr
+尤贝罗 2 nr
+尤迪安 3 nr
+尤里 72 nrt
+尤里乌 2 nr
+尤里克 2 nr
+尤里卡 26 nr
+尤里安 3 nr
+尤锡良 2 nr
+尤长于 2 nr
+尤非意 2 nr
+尤须 3 d
+尤风宁 3 nr
+尤鼎盛 8 nr
+尥 30 v
+尥蹶子 7 v
+尧 307 zg
+尧天舜日 3 vn
+尧子营村 3 n
+尧山 3 ns
+尧帝 4 nrt
+尧年舜日 3 vn
+尧斯 3 ns
+尧治河村 3 ns
+尧舜 105 n
+尧舜禹 3 nz
+尧舜禹汤 3 nr
+尧西 2 ns
+尧趋舜步 3 vn
+尧都区 3 ns
+尨 12 zg
+尨眉皓发 3 i
+尩 2 zg
+尪 23 zg
+尬 22 x
+尭 2 zg
+尮 10 zg
+尯 272 zg
+尰 59 zg
+就 273122 d
+就业 5847 v
+就业人口 3 n
+就业人数 3 n
+就业办 17 v
+就业处 34 v
+就业局 10 n
+就业指导 3 n
+就业机会 3 n
+就业率 202 n
+就业结构 3 n
+就业网 3 n
+就业者 13 n
+就业观 9 n
+就业证 3 v
+就业辅导 3 n
+就业部 4 n
+就业门路 3 n
+就义 102 v
+就事论事 63 l
+就任 365 v
+就任典礼 3 i
+就任演说 3 l
+就任者 3 n
+就位 144 v
+就位道 3 l
+就其 3 d
+就别进 3 v
+就势 89 d
+就医 440 v
+就医网 3 nz
+就医请 3 i
+就医难 3 l
+就可以看 3 i
+就地免职 3 l
+就地取材 35 i
+就地正法 21 i
+就地解决 3 i
+就坡下驴 3 l
+就学 197 v
+就学年龄 3 n
+就实论虚 3 l
+就实避虚 3 l
+就寝 94 v
+就寝时间 3 i
+就席 3 v
+就座 66 v
+就心离德 3 i
+就戮 3 v
+就手 17 d
+就擒 17 v
+就教于 3 l
+就日瞻云 3 i
+就是 9283 d
+就是指 3 i
+就是说 503 c
+就棍打腿 3 l
+就正有道 3 i
+就此 1432 d
+就此打住 3 i
+就此结束 3 i
+就此而言 4 c
+就汤下面 3 l
+就用到 3 v
+就算 2708 v
+就绪 197 v
+就职 253 v
+就职仪式 3 l
+就职典礼 3 i
+就职演说 3 l
+就聘 3 v
+就范 93 v
+就虚避实 3 i
+就行了 3 l
+就要 2328 d
+就让 1337 v
+就诊 211 v
+就诊者 11 n
+就读 415 v
+就读于 3 n
+就越 3 d
+就近 229 d
+就近入学 3 l
+就这样办 3 l
+就难避易 3 l
+就餐 90 v
+就餐卡 3 n
+就餐者 4 n
+尳 3 zg
+尴 77 a
+尴尬 1430 a
+尴尬事 3 vn
+尵 2 zg
+尶 6 zg
+尸 2496 n
+尸位 3 n
+尸位素餐 9 n
+尸体 2159 n
+尸体解剖 3 i
+尸僵 3 n
+尸变 99 n
+尸居余气 3 n
+尸居龙见 3 i
+尸山血海 5 n
+尸布 7 n
+尸恋 3 v
+尸斑 3 n
+尸检 37 v
+尸横遍野 34 i
+尸毗王 7 nz
+尸王 3 n
+尸王殿 3 n
+尸禄素食 3 n
+尸禄素飡 3 n
+尸禄素餐 3 n
+尸蜡 9 n
+尸衣 3 n
+尸解 10 v
+尸身 534 n
+尸首 587 n
+尸骨 218 n
+尸骨未寒 10 i
+尸骸 129 n
+尸鸠之平 3 i
+尹 516 nr
+尹中余 5 nr
+尹为世 3 nr
+尹丽川 2 nr
+尹丽贞 3 nr
+尹二人 3 nr
+尹仪民 3 nr
+尹仲利 2 nr
+尹优优 5 nr
+尹伯成 2 nr
+尹俊春 2 nr
+尹兄弟 4 nr
+尹光雄 8 nr
+尹克升 8 nr
+尹克西 389 nr
+尹兴圣 40 nr
+尹升厅 3 nr
+尹司马防 2 nr
+尹吉甫 275 nr
+尹同耀 8 nr
+尹商阳 2 nr
+尹基福 3 nr
+尹大勋 3 nr
+尹大哥 3 nr
+尹大目 2 nr
+尹天照 3 nr
+尹子庚 2 nr
+尹子维 3 nr
+尹孙叔 2 nr
+尹宗浩 4 nr
+尹宗禹 8 nr
+尹家庄 5 nr
+尹家河 3 nr
+尹居士 10 nr
+尹师伯 2 nr
+尹师兄 18 nr
+尹师叔 2 nr
+尹师弟 10 nr
+尹常带 2 nr
+尹庆群 2 nr
+尹张佳 2 nr
+尹张顾 2 nr
+尹志平 367 nr
+尹志蕙 3 nr
+尹恩惠 3 nr
+尹成杰 3 nr
+尹成根 3 nr
+尹扬明 3 nr
+尹明善 11 nr
+尹曾兼 2 nr
+尹来风 2 nr
+尹杨明 3 nr
+尹树广 4 nr
+尹汉宁 256 nr
+尹洪东 2 nr
+尹淑珍 3 nrfg
+尹湛纳 7 nr
+尹玉那 2 nr
+尹王章 3 nr
+尹瘦石 3 nr
+尹盛章 7 nr
+尹相杰 3 nr
+尹秉高 2 nr
+尹稼坞村 3 vn
+尹章垓 10 nr
+尹维峻 4 nr
+尹者极 3 nr
+尹良毅 4 nr
+尹西克 3 nr
+尹道兄 3 nr
+尹道爷 2 nr
+尹钧科 34 nr
+尹陈文 3 nr
+尹集镇 256 nr
+尹韩仲 2 nr
+尹香主 28 nr
+尹鸿祝 26 nr
+尹黑牛 6 nr
+尹黙 3 ns
+尺 868 q
+尺书 3 n
+尺二冤家 3 i
+尺二秀才 3 n
+尺八 15 n
+尺兵寸铁 3 i
+尺动脉 3 n
+尺地 3 n
+尺壁寸阴 3 n
+尺头儿 3 n
+尺子 179 n
+尺寸 909 n
+尺寸之功 3 i
+尺寸之地 3 i
+尺寸之柄 3 i
+尺寸千里 3 i
+尺寸可取 3 i
+尺山寸水 3 i
+尺布 3 n
+尺布斗粟 3 n
+尺幅 10 n
+尺幅千里 3 q
+尺度 645 n
+尺度空间 3 n
+尺有所短 6 i
+尺板斗食 3 n
+尺椽片瓦 3 v
+尺步绳趋 3 n
+尺水丈波 3 n
+尺波电谢 3 i
+尺泽 3 n
+尺泽之鲵 3 n
+尺牍 13 n
+尺状 3 n
+尺瑜寸瑕 3 i
+尺短寸长 3 i
+尺码 24 n
+尺竹伍符 3 n
+尺籍伍符 3 n
+尺素 2 n
+尺蚓穿堤 3 n
+尺蠖 20 n
+尺蠖求伸 3 n
+尺蠖蛾 3 n
+尺骨 4 n
+尻 70 g
+尻舆神马 3 v
+尻轮神马 3 v
+尼 2819 nr
+尼一世 2 nr
+尼义钞 2 nr
+尼乌斯 22 nr
+尼亚 176 ns
+尼亚佐夫 4 nr
+尼亚加拉 58 ns
+尼亚加拉大瀑布 2 ns
+尼亚哥 3 nr
+尼亚城 18 ns
+尼亚奈 2 nr
+尼亚尔 7 nr
+尼亚尼 4 nr
+尼亚岛 2 ns
+尼亚斯 4 nr
+尼亚桥 3 nr
+尼亚湾 18 ns
+尼亚瓦 2 nr
+尼亚美 13 nr
+尼亚胡 3 nr
+尼亚萨 8 nr
+尼亚萨兰 8 ns
+尼亚语 3 nr
+尼亚诺 4 nr
+尼亚队 3 nt
+尼什 14 nrt
+尼伦伯格 3 nrt
+尼伯伦 5 nr
+尼伯尔 2 nr
+尼伯龙 2 nr
+尼光佛 2 nr
+尼克 28 nrt
+尼克会 4 nr
+尼克坦 4 nr
+尼克尔 5 nr
+尼克斯 28 nr
+尼克斯队 6 nz
+尼克松 127 nr
+尼克森 3 nr
+尼克索 2 nr
+尼克莱 2 nr
+尼克酸 7 nz
+尼兹亲王 2 nr
+尼冷冷 4 nr
+尼利尔 2 nr
+尼加拉瀑 3 nr
+尼加拉瓜 142 ns
+尼努尔 2 nr
+尼勒克 2 nr
+尼勒克县 3 ns
+尼卡罗 2 nr
+尼古丁 29 nrt
+尼古拉 108 nrt
+尼古拉斯 22 nrt
+尼古拉耶夫 10 nrt
+尼古西亚 3 ns
+尼可刹米 2 ns
+尼哈番 3 ns
+尼哥罗 5 nrt
+尼国 3 ns
+尼基人 15 nrt
+尼基塔 9 nr
+尼塞 4 nrt
+尼塞河 4 ns
+尼多斯 2 nrt
+尼夫 2 nrt
+尼奥 158 nrt
+尼奥夫 10 nr
+尼奥尼 2 nr
+尼奥斯 14 nr
+尼奥罗 3 nrt
+尼姆 8 nrt
+尼姆达 4 nr
+尼姆鲁 3 nr
+尼姑 617 nr
+尼姑庵 19 nr
+尼安岛 4 ns
+尼安得塔 3 ns
+尼安德 10 nr
+尼安海 10 ns
+尼家嗣 16 nr
+尼尔 22 nrt
+尼尔吉 2 nr
+尼尔回 2 nr
+尼尔斯 4 nrt
+尼尔森 49 nr
+尼尔逊 5 nr
+尼尔马 4 ns
+尼尚特 3 nr
+尼尼微 25 nr
+尼山砚 2 nr
+尼巴莱 2 nr
+尼布尔 6 nr
+尼布楚 114 nr
+尼布甲 13 nr
+尼布甲尼 2 nr
+尼庵 3 nr
+尼康 8 nr
+尼康杯 3 nr
+尼德 15 nrt
+尼德兰 93 nr
+尼德炜 4 nr
+尼思哈 2 nr
+尼恩特 2 nrt
+尼扎 9 nrt
+尼扎姆 2 nr
+尼扬维齐 3 nrt
+尼扬贾 4 nr
+尼扬韦 3 nr
+尼拉 2 nrt
+尼拔奉 2 nr
+尼摩星 435 nr
+尼斯 165 nrt
+尼斯河 8 ns
+尼斯湖 3 ns
+尼斯顿 2 nrt
+尼日利亚 435 ns
+尼日利亚人 3 nrt
+尼日利亚政府 9 nt
+尼日利亚联邦共和国 2 ns
+尼日尔 248 nr
+尼日尔共和国 2 ns
+尼日尔河 105 ns
+尼昂 3 ns
+尼普科 4 nr
+尼普顿 2 nr
+尼木 3 nr
+尼木县 3 ns
+尼杜迎 2 nr
+尼果来 2 nr
+尼柯夫 2 nr
+尼柯罗 2 nr
+尼格 6 nrt
+尼格利 22 nr
+尼格罗 154 nr
+尼格罗黑 3 ns
+尼格莱斯 2 nrt
+尼格里 3 nrt
+尼桑 11 nrt
+尼氏体 3 nr
+尼沃契 16 nr
+尼泊尔 365 nr
+尼泊尔人 9 nr
+尼泊尔共产党 2 nt
+尼泊尔政府 3 nt
+尼泊尔王国 19 ns
+尼泊尔语 9 nz
+尼波罗 3 nrt
+尼洋 3 ns
+尼洋曲 9 ns
+尼洋河 4 ns
+尼牙孜 3 ns
+尼特 6 nrt
+尼特斯 7 nr
+尼狄克 5 nr
+尼玛 3 nrt
+尼玛县 2 ns
+尼玛察 2 nr
+尼瓦尔 19 nr
+尼科 6 nrt
+尼科夫 20 nr
+尼科娃 9 nr
+尼科尔 2 nr
+尼科尔斯 28 nrt
+尼科尔森 7 nrt
+尼科巴 40 nr
+尼科拉 2 nrt
+尼科波 2 nr
+尼科波尔 2 nrt
+尼科美 6 nr
+尼科西亚 11 ns
+尼穆莱 6 nr
+尼米 6 nrt
+尼米兹 60 nr
+尼索斯 3 nr
+尼维斯 38 nr
+尼维斯岛 2 ns
+尼罗 49 nrt
+尼罗河 403 ns
+尼罗河畔 2 ns
+尼罗特 19 nrt
+尼罗红 3 nr
+尼罗蓝 3 nr
+尼罗非 2 ns
+尼群地平 2 ns
+尼翁河 6 nr
+尼若牟 4 nr
+尼茨基 13 nrt
+尼莫 2 nrt
+尼莫地平 3 ns
+尼莫萨恩 2 nrt
+尼萨 9 ns
+尼葛洛庞 2 nr
+尼西 3 ns
+尼西亚信 4 nr
+尼西亚公 4 nr
+尼西亚斯 2 ns
+尼西亚语 5 nz
+尼诺夫 5 nr
+尼贝龙 3 nr
+尼赫鲁 61 nr
+尼赫鲁大学 4 nt
+尼达 2 nrt
+尼达姆 2 nr
+尼迈耶 2 nr
+尼迈里 6 nrt
+尼连禅 2 nr
+尼那 11 ns
+尼采 58 nrt
+尼采蒂 4 nr
+尼阿克 7 nr
+尼雅 23 nrt
+尼雅河 4 ns
+尼雪夫 4 nr
+尼雷尔 10 nr
+尼韦勒 2 nrt
+尼韦尔 3 nrt
+尼龙 109 nr
+尼龙丝 22 nr
+尼龙伞 3 nr
+尼龙布 3 nr
+尼龙带 3 nr
+尼龙管 3 nr
+尼龙线 3 nr
+尼龙绳 15 ns
+尼龙网 3 nz
+尼龙衫 3 nr
+尼龙袋 2 nr
+尼龙袜 7 nz
+尽 10117 v
+尽义务 22 l
+尽些 3 d
+尽人事 20 l
+尽人事听 3 i
+尽人皆知 27 i
+尽付东流 3 l
+尽信 3 v
+尽做坏事 3 l
+尽先 2 d
+尽入彀中 3 vn
+尽全力 3 l
+尽全心 3 i
+尽兴 80 d
+尽兴而归 3 i
+尽其 3 c
+尽其在我 3 i
+尽其所有 3 c
+尽其所能 3 i
+尽其所长 3 i
+尽到责任 3 l
+尽力 884 d
+尽力去做 3 i
+尽力尽责 3 l
+尽力尽量 3 l
+尽力皆知 3 i
+尽力而为 68 i
+尽可 3 c
+尽可能 1093 d
+尽可能减少 2 i
+尽可能少 5 d
+尽善 3 v
+尽善尽美 68 i
+尽在不言中 10 l
+尽多尽少 3 l
+尽失 3 v
+尽头 675 d
+尽如 3 c
+尽如人意 81 i
+尽如所期 3 i
+尽孝 45 v
+尽尽 3 d
+尽心 224 d
+尽心尽力 65 i
+尽心尽意 9 i
+尽心尽职 3 i
+尽心竭力 106 i
+尽忠 187 v
+尽忠尽职 3 i
+尽忠报国 54 i
+尽忠竭力 3 i
+尽忠职守 4 i
+尽快 1832 d
+尽快恢复 5 l
+尽态极妍 3 v
+尽性 3 d
+尽悉 3 v
+尽情 446 d
+尽情欢乐 3 i
+尽情欢唱 3 l
+尽情歌唱 3 l
+尽情玩乐 3 i
+尽情聊 3 i
+尽意 3 d
+尽成竭节 3 i
+尽我所能 3 l
+尽收 26 v
+尽收眼底 54 l
+尽散 3 v
+尽数 834 d
+尽早 466 d
+尽是 3 c
+尽显 3 v
+尽本分 3 d
+尽欢 19 v
+尽欢而散 6 i
+尽然 37 c
+尽瘁 8 v
+尽端 3 f
+尽管 7018 c
+尽管如此 365 l
+尽美尽善 3 i
+尽职 81 v
+尽职尽责 38 l
+尽自 3 d
+尽致 8 c
+尽若 3 c
+尽要 3 c
+尽诚竭节 3 i
+尽读 3 v
+尽责 26 v
+尽责任 3 l
+尽责尽力 3 l
+尽责尽职 3 l
+尽速 28 d
+尽释前嫌 3 l
+尽量 2179 d
+尽量减少 12 i
+尽量少 5 l
+尽量避免 11 l
+尾 2899 n
+尾加压肽 3 n
+尾号 7 n
+尾声 200 n
+尾大不掉 16 i
+尾大难掉 3 i
+尾导 3 n
+尾山 2 ns
+尾崎 2 ns
+尾差 3 n
+尾巴 734 n
+尾市 18 n
+尾形 3 n
+尾形码 3 n
+尾数 68 n
+尾旋 7 n
+尾景 3 n
+尾板 2 n
+尾标 3 n
+尾桨 4 n
+尾梁 2 n
+尾椎 3 n
+尾椎骨 3 n
+尾楼 3 n
+尾欠 2 n
+尾款 5 n
+尾款付清 3 n
+尾段 18 n
+尾毛 30 n
+尾气 84 n
+尾水渠 2 n
+尾注 3 v
+尾流 22 n
+尾灯 11 n
+尾牙 3 ns
+尾状核 3 n
+尾生之信 3 i
+尾生抱柱 3 i
+尾田 3 n
+尾盘 3 n
+尾盘报 3 n
+尾眉 3 n
+尾矿 30 n
+尾矿库 10 n
+尾码 3 n
+尾端 58 n
+尾端校正 3 n
+尾管 3 n
+尾索 3 n
+尾羽 93 n
+尾翘 3 n
+尾翼 222 n
+尾舵 3 n
+尾花 3 n
+尾蚴 27 n
+尾行 3 n
+尾身 3 n
+尾车 3 n
+尾边 3 f
+尾追 18 v
+尾部 309 n
+尾闾 57 n
+尾随 131 v
+尾随者 3 n
+尾随追踪 3 i
+尾音 27 n
+尾骨 15 n
+尾鳍 498 n
+尿 1771 n
+尿不湿 3 v
+尿刊酸酶 3 n
+尿卟啉 3 nr
+尿卟啉原 3 vn
+尿嘧啶 9 n
+尿囊 16 n
+尿囊素 2 n
+尿囊酸 3 n
+尿壶 8 n
+尿失禁 3 v
+尿崩 3 n
+尿崩症 21 n
+尿布 69 v
+尿常规 21 n
+尿床 31 n
+尿急 3 n
+尿意 3 n
+尿抑胃素 3 n
+尿样 13 n
+尿桥蛋白 3 n
+尿桶 14 n
+尿检 5 j
+尿毒 3 n
+尿毒症 54 n
+尿水 3 n
+尿沉渣 3 nz
+尿泡 24 n
+尿流屁滚 3 n
+尿浊 3 n
+尿液 130 n
+尿湿 3 n
+尿溼 3 v
+尿潴留 3 vn
+尿激酶 12 n
+尿激酶原 3 n
+尿炕 3 n
+尿片 6 n
+尿盆 26 n
+尿石症 7 n
+尿糖 5 n
+尿素 116 n
+尿素原体 3 n
+尿素氮 3 n
+尿素生成 3 n
+尿素霜 2 n
+尿肥 3 n
+尿胆素 3 n
+尿胆素原 3 n
+尿胞 3 n
+尿舒张肽 3 n
+尿色素 3 n
+尿色素原 3 n
+尿苷酸 3 n
+尿蛋白 3 n
+尿血 23 n
+尿裤子 3 n
+尿赤素 3 n
+尿路 3 n
+尿路感染 3 n
+尿道 234 n
+尿道口 17 n
+尿道感染 3 n
+尿道炎 22 n
+尿酸 84 n
+尿酸酶 3 n
+尿量 3 n
+尿闭 3 v
+尿频 55 n
+尿黄素 3 n
+局 4001 n
+局中人 7 n
+局主席 3 n
+局促 96 v
+局促不安 34 i
+局内 7 n
+局内人 2 n
+局势 1974 n
+局势不妙 3 i
+局势稳定 3 n
+局地 21 n
+局地扣天 3 n
+局地钥天 3 n
+局域 13 n
+局域平衡 3 n
+局域网 133 n
+局域网络 6 n
+局外 13 n
+局外之人 3 n
+局外人 82 n
+局天促地 3 i
+局天扣地 3 n
+局天蹐地 3 v
+局委 3 n
+局子 38 n
+局局长 3 n
+局属 2 n
+局度 3 n
+局座 3 n
+局性 8 n
+局所 6 n
+局数 2 n
+局方 20 n
+局机关 5 n
+局点 3 n
+局确定 13 n
+局端 3 n
+局管内 3 n
+局级 25 n
+局质分泌 3 n
+局部 2441 n
+局部代数 3 n
+局部优化 3 n
+局部凸 3 n
+局部利益 3 n
+局部参数 3 n
+局部变量 40 n
+局部地区 3 n
+局部域 3 n
+局部性 28 n
+局部战争 3 n
+局部收敛 3 i
+局部紧群 3 n
+局部麻痹 3 n
+局里 46 n
+局量 3 n
+局长 2157 n
+局长级 2 n
+局限 740 n
+局限于 3 n
+局限性 280 n
+局限海 3 n
+局限转导 3 n
+局面 3704 n
+局骗 3 v
+局骗拐带 3 n
+局高蹐厚 3 v
+局麻 3 n
+屁 661 n
+屁事 52 n
+屁大 3 n
+屁屁 3 n
+屁屁狗 3 i
+屁滚尿流 36 n
+屁用 3 n
+屁眼 3 n
+屁眼儿 3 n
+屁股 1204 n
+屁股后头 3 n
+屁股头 3 n
+屁股痛 3 n
+屁股蛋子 13 n
+屁臭 3 n
+屁话 38 n
+层 6209 q
+层云 20 n
+层交换机 3 n
+层位 3 n
+层内干扰 3 l
+层内运移 3 n
+层出不穷 251 i
+层出叠见 3 i
+层出迭见 3 l
+层压 11 n
+层压材料 3 n
+层压板 2 n
+层叠 38 z
+层台累榭 3 i
+层呈 2 n
+层层 711 n
+层层加码 3 n
+层层包围 3 n
+层层叠叠 50 z
+层层落实 3 z
+层层迭迭 3 l
+层峦 4 n
+层峦叠嶂 8 i
+层峦叠翠 3 i
+层峰 3 n
+层峰会议 3 n
+层报 4 n
+层排 3 n
+层数 3 n
+层替换 3 l
+层板 10 n
+层析 19 n
+层析介质 3 n
+层析仪 3 n
+层析分析 3 l
+层析分离 3 n
+层析原理 3 n
+层析图 3 n
+层析峰 3 n
+层析带 3 n
+层析性能 3 n
+层析成像 3 n
+层析技术 3 n
+层析效能 3 n
+层析数据 3 n
+层析柱 3 n
+层析离 3 n
+层析系统 3 n
+层析级 3 n
+层析聚焦 3 n
+层析谱 3 n
+层林尽染 3 i
+层楼 3 n
+层次 1728 m
+层次分 10 m
+层次分明 3 nz
+层次化 2 nz
+层次性 8 nz
+层次感 7 nz
+层次数据库 2 n
+层次模型 3 n
+层次等级 3 l
+层次结构 22 n
+层流 68 n
+层状 105 n
+层状介质 3 n
+层理 3 n
+层皮 21 n
+层积 4 n
+层积云 12 n
+层积材 4 n
+层粘蛋白 3 n
+层系 7 n
+层级 90 n
+层级制 3 n
+层结湖 3 n
+层见叠出 3 i
+层见迭出 3 l
+层见错出 3 i
+层间流 3 n
+层间窜流 3 l
+层面 948 n
+层高 10 n
+屃 11 zg
+屄 3 zg
+居 8992 v
+居下讪上 3 z
+居下风 3 l
+居不求安 3 i
+居不重席 3 l
+居不重茵 3 i
+居业 3 n
+居丧 12 v
+居中 252 v
+居中调停 3 l
+居丹徒 3 nr
+居为己有 3 i
+居之不疑 4 l
+居之城 2 nr
+居于 547 v
+居仁堂 2 nr
+居仁由义 3 nr
+居代郡 3 nr
+居会稽 3 l
+居伯塞 16 nr
+居住 3370 v
+居住区 159 n
+居住单元 3 n
+居住地 173 n
+居住小区 3 n
+居住期限 3 n
+居住权 18 n
+居住用地 3 n
+居住者 20 n
+居住舱 7 n
+居住证 14 j
+居住面积 3 n
+居侧宫 2 nr
+居停 4 v
+居停主人 3 n
+居元朝 4 nr
+居先 3 d
+居全洲 3 nr
+居兰陵 2 nr
+居养静 2 nr
+居内什 3 nr
+居利希 2 nr
+居利思义 3 nr
+居功 22 nr
+居功不傲 2 i
+居功厥伟 3 nr
+居功自傲 24 i
+居功自恃 3 i
+居功自满 3 i
+居功至伟 10 nr
+居勒尼 4 nr
+居史馆 2 n
+居各洲 2 ns
+居启祥 2 nr
+居国相 2 nr
+居址 7 n
+居城 3 n
+居士 239 n
+居士林 9 nr
+居处 3 n
+居夏州 3 ns
+居多 618 d
+居多数 3 l
+居大不易 3 l
+居天园 2 nr
+居天子 4 nr
+居奇 3 nr
+居奇牟利 3 nr
+居妇 2 n
+居委 3 n
+居委会 383 j
+居姜水 4 nr
+居宅 2 n
+居安思危 28 i
+居安虑危 3 i
+居安资深 3 n
+居安邑 3 nr
+居宗周 3 nr
+居官 10 n
+居官之 4 nr
+居官守法 3 nr
+居室 174 n
+居宫城 3 nr
+居家 94 n
+居宿卫 3 nr
+居屋 8 n
+居岸 2 n
+居巢 3 n
+居巢区 2 n
+居帮主 2 n
+居常土 3 n
+居常虑变 3 l
+居庆州 2 nr
+居庸 149 n
+居庸关 173 ns
+居延塞 5 nr
+居延海 10 nr
+居延简 3 nr
+居建康 4 nr
+居心 73 n
+居心不良 7 i
+居心叵测 37 i
+居心险恶 3 n
+居怀州 2 nr
+居慈宁 2 nr
+居所 103 n
+居所住地 3 i
+居敬堂 2 nr
+居文沛 256 nr
+居新丰 2 nr
+居无定 3 l
+居无定所 14 i
+居无求安 3 i
+居昌黎 3 nr
+居易 2 n
+居晋阳 3 nr
+居未央 2 nr
+居本洲 2 ns
+居杨爷 2 nr
+居柏塞 64 nr
+居次 3 d
+居正 15 nr
+居正久 3 nr
+居正伸 2 nr
+居正停 2 nr
+居正先 3 nr
+居正刚 12 nr
+居正力 3 nr
+居正听 2 nr
+居正命 2 nr
+居正咬 2 nr
+居正喊 4 nr
+居正嘴 3 nr
+居正因 2 nr
+居正大 2 nr
+居正官 3 nr
+居正府 2 nr
+居正微微 6 nr
+居正心 19 nr
+居正忍 2 nr
+居正怀 2 nr
+居正恭 2 nr
+居正才 3 nr
+居正揉 3 nr
+居正放 4 nr
+居正明 2 nr
+居正朝 6 nr
+居正父 2 nr
+居正略 3 nr
+居正瞅 5 nr
+居正立 3 nr
+居正站 2 nr
+居正笑 6 nr
+居正耐 2 nr
+居正言 2 nr
+居正赞 2 nr
+居正踅 2 nr
+居正遂 2 nr
+居正顿 3 nr
+居正马 2 nr
+居武川 4 nr
+居民 6948 n
+居民区 144 n
+居民委 3 n
+居民家庭 3 n
+居民小区 3 n
+居民收入 3 n
+居民楼 17 n
+居民消费 3 n
+居民点 48 n
+居民身份证 3 n
+居水泊 3 n
+居永嘉 2 nr
+居汲郡 2 nr
+居浩罕 3 nr
+居然 3172 d
+居留 205 v
+居留地 3 n
+居留权 25 nr
+居留证 36 nr
+居皇后 2 nr
+居相州 3 nr
+居碎叶 4 nr
+居禁宫 2 nr
+居积 3 n
+居移气 3 i
+居维叶 15 nr
+居者 25 n
+居胥山 3 nr
+居舍 3 n
+居草庐 2 nr
+居荒谷 2 nr
+居蒙蒂 2 nr
+居西京 2 ns
+居诸卫 2 nr
+居车儿 2 n
+居轴处中 3 l
+居里 188 q
+居里夫人 25 nrt
+居里点 3 n
+居重驭轻 3 i
+居野 3 n
+居金文 2 nr
+居长安 10 nr
+居长生 2 nr
+居间 45 n
+居间人 4 n
+居阿尔 5 nr
+居雅尔 2 nr
+居静室 2 nr
+居首 40 n
+居首位 3 n
+居首功 3 nr
+居髎 3 vn
+居高不下 111 l
+居高临下 173 i
+居鲁士 67 nr
+居龙藏 6 nr
+屆 9 zg
+屇 3 zg
+屈 592 nr
+屈一伸 2 nr
+屈一伸万 3 nr
+屈一膝 3 nr
+屈万乘 2 nr
+屈万祥 2 nr
+屈中恒 3 nr
+屈从 127 v
+屈伸 37 v
+屈光 43 nr
+屈光力 2 nr
+屈光学 2 nr
+屈光度 19 nr
+屈光性 3 nr
+屈光间 3 nr
+屈出律 2 n
+屈切克 2 nr
+屈原 841 n
+屈原号 3 n
+屈原村 2 nr
+屈原滩 5 nr
+屈原祠 6 nr
+屈右膝 2 nr
+屈场 3 n
+屈大均 12 nr
+屈子祠 2 nr
+屈子行 4 nr
+屈子问 3 nr
+屈孝鹏 2 nr
+屈家岭 1550 nr
+屈尊 30 nr
+屈尊俯就 3 v
+屈尊就卑 3 i
+屈尔佩 3 nr
+屈就 17 n
+屈就于 3 nr
+屈居 62 v
+屈居亚军 3 nr
+屈居人 9 nr
+屈戌儿 3 n
+屈才 7 nr
+屈打成招 6 i
+屈折语 3 i
+屈指 90 n
+屈指一算 3 i
+屈指可数 102 i
+屈文中 3 nr
+屈明光 2 nr
+屈明泉 45 nr
+屈晓勇 25 nr
+屈曲 52 n
+屈服 448 n
+屈服于 3 nr
+屈服应力 3 n
+屈服点 3 n
+屈朝阳 3 nr
+屈枉 3 v
+屈柘枝 3 nr
+屈死 33 v
+屈死之 2 i
+屈死鬼 3 i
+屈氏体 3 nr
+屈求伸 2 nr
+屈留大 3 nr
+屈膝 135 nr
+屈膝投降 3 i
+屈臣氏 3 nr
+屈艳班香 3 nr
+屈节 3 n
+屈节辱命 3 i
+屈菜科 5 nr
+屈蠖求伸 3 n
+屈谷巨瓠 3 nr
+屈起 3 v
+屈身 3 v
+屈辱 352 v
+屈辱性 8 n
+屈银华 2 nr
+屈阿栈 4 nr
+屈驾 7 nr
+屈高就下 3 i
+屉 31 n
+屉子 9 n
+届 6120 d
+届临 3 v
+届时 976 d
+届期 7 d
+届满 95 v
+届满时 3 n
+屋 2769 n
+屋上乌 3 n
+屋上架屋 3 n
+屋下作屋 3 n
+屋下架尾 3 n
+屋下架屋 3 n
+屋下盖尾 3 n
+屋中 3 s
+屋主 3 n
+屋久岛 2 n
+屋乌之爱 3 n
+屋乌推爱 3 n
+屋企 3 n
+屋内 285 s
+屋前 55 s
+屋前空地 3 n
+屋后 150 s
+屋基 8 n
+屋基石 3 n
+屋外 230 s
+屋头 3 s
+屋如七星 3 n
+屋子 1795 n
+屋子里 3 n
+屋宇 71 n
+屋架 15 n
+屋梁 69 n
+屋楣 3 n
+屋檐 210 n
+屋檐下 3 n
+屋漏 3 n
+屋瓦 75 n
+屋翳 3 n
+屋脊 775 n
+屋脊爪 3 n
+屋舍 22 n
+屋角 181 n
+屋里 1928 s
+屋里人 32 n
+屋门 124 n
+屋隅 3 n
+屋面 195 n
+屋面板 3 n
+屋面瓦 3 n
+屋顶 1485 n
+屋顶板 3 n
+屋顶织布 3 n
+屋顶花园 3 n
+屋顶违建 3 vn
+屋顶风机 3 n
+屋项 3 n
+屌 38 zg
+屌丝 13 n
+屍 27 zg
+屎 523 n
+屎壳郎 7 n
+屎尿 3 n
+屎屁直流 3 n
+屎流屁滚 3 n
+屎滚尿流 3 n
+屎王 3 n
+屎盆子 4 n
+屎蚵蜋 3 n
+屏 943 n
+屏东 34 ns
+屏东农专 3 n
+屏东县 12 ns
+屏东市 8 ns
+屏东师范 3 n
+屏住 114 v
+屏保 12 nz
+屏南 3 ns
+屏南县 2 ns
+屏声息气 3 n
+屏声敛息 3 vn
+屏声敛气 3 z
+屏声静气 3 i
+屏山 20 ns
+屏山县 3 ns
+屏幕 587 n
+屏幕墙 3 n
+屏幕提示 3 n
+屏幕显示 16 n
+屏弃 10 v
+屏息 171 n
+屏息以待 3 i
+屏息静观 3 n
+屏条 8 n
+屏极 3 n
+屏气 63 n
+屏气凝神 5 n
+屏气吞声 3 i
+屏气慑息 3 n
+屏气敛声 3 z
+屏气敛息 3 vn
+屏流比 3 n
+屏石 3 n
+屏绝 3 v
+屏蔽 191 n
+屏蔽其 3 n
+屏蔽向量 3 n
+屏蔽器 3 n
+屏蔽掉 3 i
+屏蔽泵 3 n
+屏蔽电极 3 n
+屏蔽着 3 n
+屏蔽线 3 n
+屏蔽门 3 n
+屏藩 23 n
+屏边 3 n
+屏边苗族自治县 3 ns
+屏迹 3 n
+屏退 3 v
+屏门 3 n
+屏除 4 v
+屏障 428 n
+屏风 395 n
+屐 33 zg
+屐齿之折 3 v
+屑 404 zg
+屑意 3 n
+展 1961 v
+展业 2 n
+展书官 4 nr
+展云族 2 nr
+展令扬 3 nr
+展会 166 v
+展位 80 n
+展位号 3 n
+展兵刃 4 nr
+展出 589 v
+展区 70 n
+展卖 2 v
+展厅 105 n
+展台 141 v
+展品 165 n
+展商 7 v
+展团 20 n
+展场 8 n
+展子虔 9 nrfg
+展宏图 2 nr
+展室 21 n
+展宽 82 v
+展寿席 2 nr
+展展 2 vn
+展布 14 v
+展平 5 nr
+展延 2 v
+展开 8163 v
+展开剂 3 nr
+展开式 13 nr
+展开攻势 3 n
+展开讨论 3 n
+展开部 3 nr
+展弦比 16 n
+展性 6 n
+展愁眉 2 nr
+展成幂 9 nr
+展拓 8 v
+展播 24 vn
+展教 3 v
+展映 2 v
+展望 295 v
+展望未来 3 nr
+展期 23 vn
+展未展 2 nr
+展板 37 n
+展架 3 v
+展柜 4 n
+展源 3 n
+展演 48 v
+展牌 3 v
+展现 863 v
+展现出 3 v
+展眉 5 nr
+展眉舒眼 3 nr
+展着剂 3 n
+展示 2204 v
+展示中心 3 n
+展示会 28 n
+展示出 3 n
+展示区 12 n
+展示厅 4 n
+展示台 12 n
+展示室 3 n
+展示架 3 n
+展示柜 3 n
+展示馆 5 n
+展秀婷 5 nr
+展线 3 n
+展缓 3 v
+展缓期限 3 n
+展翅 139 v
+展翅欲飞 3 nr
+展翅飞翔 3 nr
+展翅高飞 3 nr
+展翼 2 n
+展视 3 v
+展览 1437 v
+展览业 3 n
+展览会 236 n
+展览会场 3 n
+展览厅 14 n
+展览品 3 n
+展览室 13 n
+展览架 3 n
+展览路 2 n
+展览馆 155 n
+展评 2 v
+展读 3 v
+展转 11 v
+展销 49 v
+展销会 49 n
+展销品 3 n
+展销网 3 n
+展销部 3 n
+展限 2 v
+展露 25 v
+展露出 3 v
+展露出来 3 v
+展露头角 3 n
+展颜 2 nr
+展馆 35 n
+展香主 4 nr
+屘 3 zg
+屙 88 g
+屙金溺银 3 vn
+屜 10 zg
+屝 2 zg
+属 26010 v
+属下 650 v
+属于 6871 v
+属人法 24 n
+属人耳目 3 n
+属僚 3 n
+属区 7 n
+属名 3 v
+属吏 54 n
+属员 11 n
+属国 135 n
+属地 177 n
+属地化 15 v
+属垣有耳 3 v
+属实 304 v
+属性 791 n
+属性数据 3 n
+属性语法 3 n
+属意 19 v
+属意于 3 v
+属望 3 v
+属概念 3 vn
+属毛离里 3 n
+属狗 3 n
+属猪 3 n
+属目 3 n
+属相 93 n
+属词比事 3 n
+属辞比事 3 n
+属间杂交 3 n
+属鸡 3 n
+屟 3 zg
+屠 230 nr
+屠兀耆 2 nr
+屠先生 3 nr
+屠刀 201 n
+屠场 13 n
+屠城 50 nr
+屠城之 3 nr
+屠城记 3 nr
+屠夫 80 nr
+屠宰 178 nr
+屠宰业 3 nr
+屠宰厂 22 nr
+屠宰场 29 n
+屠宰率 6 nr
+屠宰税 3 n
+屠岸贾 3 nr
+屠彭连 8 nr
+屠戮 115 v
+屠户 32 n
+屠所牛羊 3 nr
+屠拉蒂 6 nr
+屠杀 920 vn
+屠格涅夫 33 nr
+屠毒笔墨 3 n
+屠洪刚 3 nr
+屠潭州 2 nr
+屠灭 3 v
+屠知牙 3 nr
+屠苏 3 v
+屠苏酒 4 nr
+屠贩 3 n
+屠赞巴 2 nr
+屠门大嚼 3 v
+屠龙 78 nr
+屠龙之 2 nr
+屠龙之伎 3 nr
+屠龙之技 3 nr
+屠龙之计 3 nr
+屠龙刀 224 nr
+屠龙功 2 nr
+屠龙帮 6 nr
+屠龙记 3 nr
+屡 1152 d
+屡仆屡起 3 vn
+屡劝不听 3 v
+屡劝不改 3 v
+屡受 3 l
+屡变星霜 3 i
+屡增 3 l
+屡屡 296 d
+屡建奇功 3 l
+屡战屡北 3 l
+屡战屡胜 13 l
+屡战屡败 37 l
+屡攻未果 3 i
+屡教不改 15 l
+屡次 332 d
+屡次三番 2 l
+屡犯 3 d
+屡禁 3 d
+屡禁不止 40 l
+屡禁不绝 13 i
+屡见 3 d
+屡见不鲜 139 i
+屡试不爽 29 i
+屡试不第 13 i
+屡试屡验 3 l
+屡败屡战 23 l
+屡进屡退 3 l
+屡遭 3 i
+屣 12 g
+履 316 zg
+履仁蹈义 3 i
+履任 3 v
+履信思顺 3 i
+履历 89 v
+履历表 34 n
+履带 291 n
+履带吊 3 n
+履带式 172 b
+履新 8 v
+履机乘变 3 i
+履汤蹈火 3 i
+履痕 3 n
+履盈蹈满 3 i
+履穿踵决 3 i
+履约 35 v
+履职 24 v
+履舄交错 3 v
+履获 3 v
+履薄临深 3 i
+履行 1684 v
+履行义务 3 n
+履行任务 3 n
+履行合同 3 n
+履行地 14 n
+履行延迟 3 i
+履行期 3 b
+履行职责 3 n
+履行诺言 3 n
+履足差肩 3 i
+履险如夷 12 i
+履险若夷 3 i
+履险蹈危 3 i
+履霜之戒 3 i
+履霜坚冰 3 i
+履霜知冰 3 i
+屦 8 zg
+屦及剑及 3 nrfg
+屦贱踊贵 3 nrfg
+屪 6 zg
+屫 5 zg
+屬 13 zg
+屭 19 zg
+屯 823 n
+屯兵 373 n
+屯垦 69 v
+屯垦员 3 n
+屯子 362 n
+屯守 3 v
+屯戍 20 v
+屯扎 62 v
+屯昌 2 ns
+屯昌县 4 ns
+屯毛不辨 3 v
+屯河 11 ns
+屯溪 29 ns
+屯溪区 4 ns
+屯溪市 3 ns
+屯溪路 3 ns
+屯田 432 ns
+屯田制 3 n
+屯田客 3 n
+屯留 6 v
+屯留县 2 ns
+屯积 25 n
+屯积居奇 3 n
+屯籍 3 n
+屯粮 29 n
+屯粮积草 3 n
+屯聚 3 v
+屯聚处 3 n
+屯落 3 v
+屯街塞巷 3 ns
+屯蹶否塞 3 v
+屯里 8 ns
+屯门 3 ns
+屯集 3 v
+屯驻 67 v
+山 23539 n
+山万岭 4 nr
+山三岭 2 ns
+山上 1537 s
+山上人家 3 l
+山上山下 3 l
+山下 793 s
+山下人家 3 n
+山下真澄 2 nr
+山不容 3 nr
+山不转 3 i
+山不转路转 5 i
+山与泽 3 nr
+山丘 212 ns
+山丘区 14 ns
+山丘陵 15 nr
+山丛 2 n
+山东 4881 ns
+山东丘陵 3 ns
+山东人 66 nr
+山东医科大学 2 nt
+山东半岛 138 ns
+山东地区 6 ns
+山东大学 61 nt
+山东大学中文系 2 nt
+山东大鼓 3 nr
+山东女排 5 nt
+山东工艺美术学院 5 nt
+山东师范大学 9 nt
+山东德衡律师事务所 2 n
+山东快书 18 n
+山东梆子 3 n
+山东泰山 6 ns
+山东海化集团 4 nt
+山东理工大学 5 nt
+山东电力 3 nz
+山东画报出版社 2 nt
+山东省 718 ns
+山东省人大 2 nt
+山东省人民政府 7 nt
+山东省公安厅 2 nt
+山东省委 2 nt
+山东省政府 3 nt
+山东省物价局 4 nt
+山东省统计局 3 nt
+山东站 3 ns
+山东航空公司 6 nt
+山东铝业 14 nz
+山东队 83 nt
+山东鲁能 120 ns
+山东鲁能泰山队 2 nt
+山东鲁能队 29 nt
+山东黄河河务局 2 nt
+山中 746 s
+山中宰相 3 nr
+山中峰 2 nr
+山中建 2 ns
+山中湖 2 ns
+山中瑞 2 nr
+山中采 4 nr
+山中野 3 nr
+山丹 31 ns
+山丹丹 5 ns
+山丹丹花 6 nz
+山丹县 4 ns
+山为垒 3 nr
+山为陵 2 nr
+山主 3 n
+山之东 3 nr
+山之主 2 nr
+山之南 2 nr
+山之宝 10 nr
+山之捷 4 nr
+山之术 2 nr
+山之西 2 nr
+山之誓 2 nr
+山之阳 4 nr
+山乌桓 4 nr
+山九仞 3 nr
+山习 2 n
+山乡 66 ns
+山书会 2 n
+山争田 2 nr
+山亏一篑 3 i
+山产 3 n
+山亭 16 nr
+山亭区 3 ns
+山人 75 n
+山介溪 4 nr
+山仙宫 4 nr
+山以东 3 nr
+山伯 3 ns
+山伯爵 3 nr
+山伯英 2 nr
+山体 497 n
+山体中 3 nr
+山体效应 3 n
+山保林 4 nr
+山光水 2 nr
+山光水色 11 n
+山兔 3 n
+山八珍 2 nr
+山公倒载 3 i
+山兴庆 2 ns
+山内 22 s
+山冈 72 ns
+山农 4 n
+山凹 68 n
+山分甲 5 n
+山前 544 s
+山前山后 3 nr
+山剑法 11 nr
+山剑湖 6 nr
+山剑阵 2 nr
+山势 325 n
+山势峻拔 3 i
+山包 27 n
+山包海容 3 n
+山北 45 ns
+山北坡 5 ns
+山北开 2 ns
+山北端 2 nr
+山匪 3 n
+山区 2809 ns
+山区农业 3 n
+山区县 3 n
+山华牌 3 n
+山卓港 4 ns
+山南 926 ns
+山南地区 18 ns
+山南坡 16 ns
+山南海北 6 ns
+山南行 2 nt
+山南路 3 ns
+山卜 2 n
+山卸岭 35 nr
+山厦 2 n
+山县 51 ns
+山参 9 n
+山口 641 ns
+山口县 10 ns
+山口县岩 2 ns
+山口智子 2 n
+山口百惠 2 nr
+山口组 3 n
+山名 3 n
+山名青 3 nr
+山后 231 nr
+山向东 2 nr
+山吟泽唱 3 nr
+山呼 3 n
+山呼海啸 17 nr
+山和尚 6 nr
+山响 3 n
+山哥 3 ns
+山嘴 17 ns
+山回路转 3 l
+山园 3 ns
+山国 26 ns
+山圆静 2 nr
+山地 4384 n
+山地区 35 ns
+山地同胞 3 n
+山地气候 3 n
+山地沼泽 3 nr
+山地舞 3 n
+山地车 5 ns
+山地部落 3 l
+山场 45 n
+山坑 6 ns
+山坞 9 ns
+山坡 1164 ns
+山坡土 3 n
+山坡地 15 ns
+山坡羊 3 ns
+山坡路 3 ns
+山坳 169 n
+山垄 3 n
+山垭口 2 nr
+山城 152 ns
+山城区 3 ns
+山城堡 6 ns
+山域 3 n
+山堂 2 n
+山堂集 3 nr
+山堡 4 ns
+山堡东 2 ns
+山塘 63 ns
+山填海 5 nr
+山墙 300 n
+山墙饰 3 n
+山壁 165 n
+山壑 2 n
+山士奇 30 nr
+山复整妆 3 n
+山夜 3 n
+山大 17 ns
+山大川 2 ns
+山大玉 3 nr
+山大王 8 nr
+山大路 2 ns
+山太保 34 nr
+山头 764 n
+山头主义 5 n
+山头角 3 n
+山头道 3 n
+山妹 3 n
+山妻 3 n
+山姆 4 nrt
+山姆叔叔 3 nr
+山姆大叔 15 nr
+山子 14 n
+山子石 8 nr
+山子野 2 nr
+山宗 8 nrt
+山官道 3 nr
+山定逸 2 nr
+山客 5 n
+山容 2 n
+山容海纳 3 ns
+山寒水冷 3 nr
+山寨 759 ns
+山寺 26 ns
+山寺镇 256 nr
+山寻龙 5 nr
+山导河 2 n
+山寿马 3 nr
+山小寨 2 nr
+山尖 20 n
+山居 22 n
+山山 6 ns
+山山岭岭 4 ns
+山山水水 27 ns
+山山脉 3 ns
+山山腹 2 nr
+山山谷 2 ns
+山岗 50 ns
+山岚 4 nr
+山岛 7 ns
+山岩 79 ns
+山岩刻 2 nr
+山岭 339 ns
+山岭连亘 3 ns
+山岳 98 ns
+山岳冰川 3 ns
+山峙渊渟 3 ns
+山峡 24 ns
+山峦 147 n
+山峦起伏 3 i
+山峰 783 ns
+山崎 3 ns
+山崎拓 10 nr
+山崎龙二 3 nr
+山崖 169 ns
+山崩 89 n
+山崩地塌 3 i
+山崩地裂 31 i
+山崩地陷 4 i
+山崩川竭 3 i
+山崩水竭 3 i
+山崩海啸 3 nr
+山崩钟应 3 i
+山巅 95 n
+山川 398 ns
+山川相隔 3 nr
+山川米聚 3 nz
+山川险阻 3 n
+山左山 2 ns
+山巨岩 4 nr
+山巨源 4 nr
+山巫陵 15 ns
+山师 3 n
+山师东 4 nr
+山庄 272 ns
+山延历 2 nr
+山建 2 ns
+山开石 2 nr
+山引江 2 nr
+山形 45 n
+山形县 3 ns
+山彪镇 3 nr
+山影 288 n
+山径 64 n
+山德勒 3 nr
+山德拉 3 nr
+山德里娜 2 nrt
+山德鲁 3 nr
+山志 3 n
+山志学 3 nt
+山恶岭 2 nr
+山慈姑 3 nr
+山慈菇 3 nr
+山房 12 n
+山拗 3 v
+山掘子 11 n
+山推股份 11 nz
+山摇地动 14 i
+山旮旯儿 3 z
+山明水秀 17 nr
+山易 3 n
+山春晓 2 nr
+山晕 3 n
+山普阳 2 ns
+山景 10 n
+山望 4 n
+山望见 2 nr
+山木 4 ns
+山木自寇 3 nr
+山本 51 ns
+山本三男 2 nr
+山本博 3 nr
+山本安英 2 nr
+山本芳孝 3 nr
+山本英夫 2 nr
+山本萨夫 2 ns
+山术 4 n
+山李忠 2 nr
+山村 178 ns
+山村里 10 nrt
+山杨 45 nr
+山杨林 3 nr
+山杭 5 ns
+山松 8 n
+山林 401 ns
+山林隐逸 7 nr
+山果 6 n
+山枣 4 n
+山枯石死 3 i
+山查 3 nr
+山栖谷隐 3 nr
+山栖谷饮 3 nr
+山栖霞 2 nr
+山核桃 13 n
+山核桃树 3 n
+山根 40 ns
+山根里 4 ns
+山桃 15 n
+山桐子 3 nr
+山桑 3 nrt
+山梁 74 ns
+山梨 9 nr
+山梨县 2 ns
+山梨糖 2 nr
+山梨酸 50 nz
+山梨酸钾 56 nz
+山梨醇 13 nr
+山椒 3 n
+山楂 110 n
+山楂果 3 n
+山楂树 3 n
+山楂片 6 n
+山楂糕 9 n
+山榄科 4 ns
+山樱桃 3 nr
+山歌 139 n
+山止川行 3 n
+山殽野湋 3 nz
+山毛榉 36 nr
+山民 137 n
+山水 1500 ns
+山水园 2 ns
+山水图 3 nr
+山水情 3 n
+山水画 176 n
+山水相连 6 ns
+山水诗 3 nr
+山汇 5 n
+山沟 222 ns
+山沟沟 4 ns
+山河 1079 ns
+山河大地 3 ns
+山河破碎 7 i
+山河表里 3 n
+山泉 66 ns
+山泉水 6 ns
+山泽 16 n
+山泽之 16 nr
+山洞 894 ns
+山洪 116 nr
+山洪暴发 35 l
+山洪爆发 3 nz
+山洼 6 ns
+山浙西 2 nr
+山海 84 ns
+山海之 2 nr
+山海关 784 ns
+山海关区 3 ns
+山海卫 88 nr
+山海城 53 ns
+山海士 2 ns
+山海工 4 nr
+山海拔 3 nr
+山海经 91 nr
+山涧 87 nr
+山清水秀 24 nr
+山港 7 ns
+山游 3 n
+山湖 3 ns
+山湾 7 ns
+山湾子 2 ns
+山溜穿石 3 n
+山溪 68 ns
+山溪千 2 nr
+山溪性 11 nr
+山满谷 2 nr
+山火 19 n
+山灵岩 2 nr
+山炮 54 n
+山牧季移 3 nr
+山狗 3 n
+山猪 3 n
+山猫 76 n
+山猫队 3 nt
+山王 16 nrt
+山玩景 2 nr
+山环 2 ns
+山环合 2 nr
+山环水 6 ns
+山珍 809 nr
+山珍海味 583 nr
+山珍海错 3 nr
+山瑞 3 nr
+山生成 2 nr
+山田 29 ns
+山田规三生 13 l
+山甲 2 ns
+山百子 2 nr
+山盟 3 ns
+山盟海誓 18 n
+山相宅 3 nr
+山眉水眼 3 i
+山石 676 n
+山砠水厓 3 v
+山碧波 2 nr
+山祖冷 2 nr
+山神 125 n
+山神庙 40 nr
+山神爷 8 nr
+山神野 3 nr
+山秘术 3 n
+山积 3 n
+山积波委 3 n
+山移文 2 nr
+山稀柿 2 nr
+山穴陵 22 nr
+山穷水尽 71 i
+山穷水断 3 i
+山穷水绝 3 i
+山窝 7 n
+山窟 3 ns
+山立祠 2 nr
+山童 4 n
+山童石烂 3 n
+山竹 9 ns
+山竹子 3 nr
+山竽 3 n
+山粟林 256 nr
+山精树 2 nr
+山精水 3 nr
+山系 195 n
+山线 3 n
+山结营 2 nr
+山绵羊 2 nr
+山羊 354 ns
+山羊座 3 nr
+山羊洼 3 nr
+山羊皮 7 nr
+山羊绒 4 nr
+山羊肉 259 n
+山羊胡 4 nr
+山羊胡子 3 nr
+山羊草 3 nr
+山群 3 ns
+山群尼 2 nr
+山群峰 2 ns
+山翁 19 n
+山老爹 3 nr
+山耳东村 2 ns
+山肴海错 3 ns
+山肴野蔌 3 nz
+山胞 3 n
+山脉 1913 ns
+山脊 144 n
+山脚 94 ns
+山脚下 215 s
+山腰 155 n
+山腰上 3 l
+山腰处 6 n
+山腹 83 n
+山自西 257 ns
+山良价 2 n
+山色 45 n
+山艺 3 n
+山艾树 3 nr
+山节藻棁 3 nz
+山芋 48 n
+山芝麻 3 n
+山花 168 n
+山苍子 10 nr
+山若布 2 nr
+山茂召 2 nr
+山茱萸 20 n
+山茶 80 n
+山茶油 3 n
+山茶花 39 nr
+山荆子 2 nr
+山草 24 n
+山药 80 n
+山药蛋 6 nr
+山莨菪碱 4 n
+山菜 17 n
+山葛 3 ns
+山蔬 3 n
+山蝎子 10 nr
+山行旅 3 n
+山行海宿 3 ns
+山裂石 2 n
+山西 2696 ns
+山西人 33 nrt
+山西人民出版社 3 nt
+山西化肥厂 2 ns
+山西大同 3 ns
+山西大学 15 nt
+山西太原 3 ns
+山西旅游 3 nz
+山西晋 3 nr
+山西梆子 6 n
+山西汾酒 11 nz
+山西省 526 ns
+山西省临汾地区 3 ns
+山西省人民政府 2 nt
+山西省军区 2 nt
+山西省吕梁地区 4 ns
+山西省忻州地区 2 ns
+山西省政协 2 nt
+山西省政府 5 nt
+山西省晋中地区 5 ns
+山西省运城地区 4 ns
+山西站 3 ns
+山西财经大学 3 nt
+山西路 24 ns
+山西队 16 n
+山观 2 n
+山观操 2 nr
+山观虎 6 nr
+山诸泉 2 nr
+山谷 1074 n
+山谷地 3 n
+山谷深 6 nr
+山谷风 2 nr
+山豆根 3 nz
+山贝子 9 nr
+山货 21 n
+山贼 3 n
+山资纪 4 n
+山越 20 ns
+山越岭 15 nr
+山路 686 n
+山路小学 3 l
+山轿 3 n
+山边 93 s
+山进香 3 nr
+山远水 2 nr
+山迦叶 2 nr
+山遇仙 15 nr
+山道 546 n
+山道人 73 nr
+山道年 9 nr
+山遥水远 3 ns
+山遥路远 3 l
+山里 855 s
+山里人 65 nrt
+山里娃 6 nr
+山里红 138 nr
+山重水复 11 nr
+山野 241 ns
+山野菜 9 n
+山金 2 n
+山铝业 15 nr
+山链 2 n
+山镇 537 ns
+山镇红 2 nr
+山长水远 3 nr
+山长水阔 3 nr
+山门 345 ns
+山间 457 n
+山间盆地 3 ns
+山阳 78 ns
+山阳仓 2 nr
+山阳公 4 nr
+山阳区 3 ns
+山阳县 8 ns
+山阴 73 ns
+山阴乘兴 3 ns
+山阴县 4 ns
+山阴夜雪 3 nr
+山阴恒 4 nr
+山阴道上 2 ns
+山阻 2 n
+山际 2 n
+山险 19 n
+山陬海噬 3 i
+山陬海澨 3 s
+山陵 48 ns
+山陶塑 2 nr
+山难 3 n
+山难容 2 n
+山雀 24 n
+山雄 2 ns
+山雄峙 2 nr
+山雨 58 n
+山雨欲来 3 i
+山雨欲来风满楼 30 i
+山青水 3 nr
+山青水秀 8 nr
+山青水绿 3 nr
+山静居 5 nr
+山顶 1074 n
+山顶洞 11 ns
+山顶洞人 40 n
+山顶面 3 n
+山颓木坏 3 i
+山额真 26 nr
+山颠 4 ns
+山风 99 n
+山风中 2 ns
+山风光 3 nr
+山驿 3 ns
+山高 3 ns
+山高地燥 3 l
+山高月 3 nr
+山高月小 3 nr
+山高林 5 nr
+山高水 3 ns
+山高水低 11 n
+山高水远 3 ns
+山高水长 14 n
+山高水险 3 n
+山高海 2 ns
+山高皇帝远 11 ns
+山高谷 17 nr
+山高路远 3 ns
+山高路陡 3 ns
+山高路险 3 n
+山鬼 40 n
+山魈 21 n
+山鲁佐 3 nr
+山鸟 5 n
+山鸟飞 4 nr
+山鸡 64 ns
+山鸡椒 3 n
+山鸡舞镜 3 n
+山鸣谷应 3 n
+山鸦 3 n
+山鹑 4 n
+山麓 971 n
+山麓堆积 3 vn
+山麓平原 3 nr
+山鼠 3 n
+山龙虎 2 nr
+山龟 5 n
+屳 17 zg
+屸 57 zg
+屹 29 v
+屹然 10 d
+屹立 154 v
+屹立不动 3 v
+屹立不摇 3 v
+屺 14 zg
+屻 75 zg
+屼 2800 zg
+屽 4132 zg
+屾 3031 zg
+屿 172 ng
+岀 1198 zg
+岁 11719 m
+岁不我与 3 i
+岁修 3 n
+岁入 73 n
+岁凶 3 n
+岁出 16 n
+岁初 3 t
+岁在龙虵 3 nz
+岁在龙蛇 3 i
+岁夕 3 t
+岁寒 8 t
+岁寒三友 8 i
+岁寒松柏 3 n
+岁尾 140 t
+岁岁年年 6 l
+岁岁枯荣 3 i
+岁岁花 3 n
+岁差 33 n
+岁序 3 n
+岁序更新 3 i
+岁收 3 n
+岁数 155 n
+岁时伏腊 3 n
+岁星 27 n
+岁晚 3 t
+岁暮 10 t
+岁暮天寒 3 i
+岁月 932 t
+岁月不居 3 i
+岁月不饶人 5 l
+岁月如梭 3 i
+岁月如流 4 i
+岁月峥嵘 3 i
+岁月悠悠 3 n
+岁月流逝 3 i
+岁月蹉跎 3 v
+岁末 59 t
+岁末年初 3 t
+岁比不登 3 i
+岁稔年丰 3 v
+岁聿云暮 3 nr
+岁聿其莫 3 nz
+岁计 3 n
+岁计有余 3 i
+岁贡 12 n
+岁首 30 n
+岂 4042 d
+岂不怪哉 3 i
+岂不是 3 d
+岂不知 88 i
+岂但 21 c
+岂可 244 v
+岂因祸福避趋之 6 n
+岂容 3 v
+岂弟君子 3 i
+岂敢 179 d
+岂料 28 v
+岂有是理 3 i
+岂有此理 105 i
+岂止 129 v
+岂知 3 v
+岂肯 132 v
+岂能 896 v
+岂非 289 d
+岃 1849 zg
+岄 941 zg
+岅 2 zg
+岈 7 g
+岋 326 zg
+岌 15 i
+岌岌 3 i
+岌岌不保 3 i
+岌岌可危 69 i
+岍 6 g
+岐 98 zg
+岐义 3 ns
+岐出岐入 3 nr
+岐化 3 ns
+岐山 63 ns
+岐山县 14 ns
+岐江 2 ns
+岐视 3 ns
+岐路 3 ns
+岐路亡羊 3 vn
+岐阜 5 ns
+岐阜县 2 ns
+岐黄 3 ns
+岑 59 nr
+岑仲勉 22 nr
+岑其斯 6 nr
+岑凯伦 3 nr
+岑君耀 4 nr
+岑嘉伦 2 nr
+岑嘉州 4 nr
+岑大人 2 nr
+岑威引 2 nr
+岑寂 6 nr
+岑巩 3 nr
+岑巩县 2 nr
+岑建功 2 nr
+岑建勋 3 nr
+岑彭 3 nr
+岑文本 3 nr
+岑春煊 217 nr
+岑格鲁 2 nr
+岑楼齐末 3 nr
+岑毓英 13 nr
+岑氏刊 2 nr
+岑溪 3 nr
+岑溪市 3 nr
+岔 265 n
+岔口 15 n
+岔子 81 n
+岔开 125 v
+岔曲儿 3 n
+岔气 13 n
+岔沟 15 ns
+岔河镇 3 ns
+岔流 2 n
+岔路 105 n
+岔道 58 v
+岕 4 zg
+岗 5473 n
+岗上 25 s
+岗亭 25 n
+岗位 2321 n
+岗位培训 3 n
+岗位数 2 n
+岗位津贴 3 n
+岗位职责 3 n
+岗位补贴 3 n
+岗位责任 3 n
+岗前 13 s
+岗区 5 n
+岗南 18 ns
+岗南乡 3 ns
+岗卡 3 n
+岗口儿甜 3 n
+岗台 5 n
+岗员 3 n
+岗哨 315 n
+岗地 3 n
+岗头 7 n
+岗头泽底 3 n
+岗子 8 n
+岗峦 12 n
+岗巴 3 n
+岗巴县 3 ns
+岗松 2 n
+岗梅 3 n
+岗楼 12 n
+岗背 4 n
+岗警 3 n
+岗长 3 n
+岗陵 3 n
+岘 288 ns
+岘港 18 ns
+岙 10 g
+岚 63 nr
+岚县 3 ns
+岚山 23 ns
+岚烟波影 3 nr
+岚皋 3 ns
+岚皋县 3 ns
+岛 6677 n
+岛上 1461 s
+岛主 316 n
+岛内 229 s
+岛内外 12 s
+岛内居民 3 n
+岛国 209 n
+岛城 3 n
+岛外 18 s
+岛外居民 3 n
+岛子 18 n
+岛山 22 n
+岛屿 1617 n
+岛崎 4 ns
+岛弧 112 n
+岛村 2 n
+岛根县 6 ns
+岛民 23 n
+岛津 46 ns
+岛津义弘 15 nr
+岛状冻土 3 n
+岛瘦郊寒 3 vn
+岛礁 56 n
+岛链 45 n
+岛霉素 3 n
+岜 41 g
+岜关岭 3 v
+岞山 3 vn
+岢 148 g
+岢岚 3 nrt
+岢岚县 3 v
+岣 159 g
+岤 5 zg
+岧 8 zg
+岩 2399 nr
+岩上 41 n
+岩佐 3 n
+岩体 129 n
+岩前 5 ns
+岩土 63 n
+岩墙之下 3 i
+岩壁 104 n
+岩寺 6 n
+岩层 394 n
+岩居 3 n
+岩居川观 3 n
+岩居穴处 3 n
+岩居谷饮 3 n
+岩屑 46 n
+岩屑堆 3 n
+岩屑锥 3 n
+岩山 13 n
+岩岸 3 n
+岩峰 4 n
+岩崖 9 n
+岩崩 4 n
+岩床 73 n
+岩心 30 n
+岩心直径 3 n
+岩性 97 n
+岩性对比 3 n
+岩手 3 n
+岩手县 5 n
+岩栖穴处 3 n
+岩栖谷隐 3 ns
+岩栖谷饮 3 n
+岩棉 3 n
+岩棉板 3 n
+岩洞 413 n
+岩洪 3 n
+岩流圈 3 n
+岩浆 581 n
+岩浆岩 51 n
+岩溶 99 n
+岩溶地貌 3 n
+岩溶洞 5 n
+岩滩 10 n
+岩漆 3 n
+岩漠 3 n
+岩爆 9 n
+岩田 2 n
+岩田良子 10 n
+岩画 138 n
+岩白菜 3 n
+岩白菜素 3 n
+岩盐 342 n
+岩盖 3 n
+岩相 3 n
+岩石 2028 n
+岩石圈 151 n
+岩石学 60 n
+岩石层 8 n
+岩礁 38 n
+岩穴 25 n
+岩穴之土 3 i
+岩穴之士 2 i
+岩缝 70 n
+岩羊 17 n
+岩茶 3 n
+岩蔷薇 3 n
+岩隙 3 n
+岩鹰 3 n
+岪 44 zg
+岫 158 ns
+岫云 3 ns
+岫岩 16 ns
+岫岩县 6 ns
+岫岩满族自治县 2 ns
+岬 219 zg
+岬角 52 n
+岭 3212 n
+岭上 67 s
+岭下 27 s
+岭东 3 ns
+岭东区 3 ns
+岭东商专 3 nt
+岭兜小区 3 n
+岭北 3 s
+岭北行省 18 ns
+岭南 343 ns
+岭南大学 29 nt
+岭南文化 3 nt
+岭南村 2 ns
+岭地 8 n
+岭头 15 n
+岭子 518 n
+岭澳 9 ns
+岱 1279 ns
+岱宗 15 nrt
+岱山 18 ns
+岱山县 4 ns
+岱岳 3 ns
+岱岳区 3 ns
+岱庙 9 ns
+岱海 9 ns
+岱顶 2 ns
+岳 1197 nr
+岳丈 36 nr
+岳不群 1140 nr
+岳之镇 2 nr
+岳乐叹 2 nr
+岳乐才 2 nr
+岳乐笑 4 nr
+岳书仓 2 nr
+岳从忠 3 nr
+岳元声 5 nr
+岳先生 41 nr
+岳凯平 13 nr
+岳北 3 ns
+岳华亭 3 nr
+岳南 5 ns
+岳南区 3 ns
+岳县 3 ns
+岳口 2 n
+岳城 4 ns
+岳城水库 2 nr
+岳塘区 3 ns
+岳大壮 55 nr
+岳大庙 2 nr
+岳大掌 3 nr
+岳夫人 308 nr
+岳姑娘 4 nr
+岳家 328 n
+岳家军 6 nr
+岳寺塔 5 nr
+岳小姐 7 nr
+岳少保 8 nr
+岳尚方 3 nr
+岳居士 2 nr
+岳岳磊磊 3 nr
+岳岳荦荦 3 nr
+岳峙渊渟 3 ns
+岳州 30 ns
+岳州托 2 nr
+岳州窑 3 nr
+岳师伯 9 nr
+岳师兄 23 nr
+岳昌君 4 nr
+岳普湖 3 nr
+岳普湖县 3 ns
+岳月砚 3 nr
+岳林才 3 nr
+岳武穆 32 nr
+岳武穆王 6 nr
+岳母 242 nr
+岳池 2 nr
+岳池县 3 ns
+岳灵珊 3 ns
+岳父 530 nr
+岳父母 10 nr
+岳爷爷 6 nr
+岳王全 2 nr
+岳王庙 19 nr
+岳维山 116 nr
+岳美缇 2 nr
+岳老三 42 nr
+岳老二 30 nr
+岳老儿 6 nr
+岳老大 3 nr
+岳肃 5 ns
+岳西 3 ns
+岳西县 2 ns
+岳贞黎 59 nr
+岳钟琪 36 nr
+岳镇渊渟 3 ns
+岳阳县 9 ns
+岳阳市 30 ns
+岳阳楼 51 nr
+岳阳楼区 4 ns
+岳阳楼记 3 nz
+岳阳道 3 nr
+岳飞 680 nr
+岳鹏举 2 nr
+岳麓 8 nr
+岳麓书社 8 nt
+岳麓书院 12 nt
+岳麓区 3 nr
+岳麓山 8 nr
+岴 2 zg
+岵 45 g
+岶 3 zg
+岷 114 ns
+岷县 23 ns
+岷山 58 ns
+岷江 93 ns
+岸 1925 n
+岸上 522 s
+岸信 6 n
+岸区 6 s
+岸台网络 3 n
+岸基 68 n
+岸堤 2 n
+岸壁 15 s
+岸头 3 s
+岸惠子 3 nr
+岸标 3 n
+岸滩 24 n
+岸炮 40 n
+岸然 4 n
+岸然道貌 3 n
+岸田国士 2 n
+岸礁 3 n
+岸站 6 n
+岸线 167 s
+岸谷之变 3 n
+岸谷五朗 3 nr
+岸边 506 s
+岸防 39 n
+岸防兵 11 n
+岺 3 zg
+岼 7 zg
+岽 22 g
+岾 10 zg
+岿然 3 d
+岿然不动 27 i
+岿然独存 3 i
+峁 278 g
+峂 3 zg
+峄 50 g
+峄城 2 ns
+峄城区 3 ns
+峅 5 zg
+峆 4 zg
+峇 158 zg
+峋 42 x
+峍 2 zg
+峎 2 zg
+峒 42 g
+峖 3 zg
+峗 4 zg
+峘 7 zg
+峙 299 zg
+峙立 3 nr
+峚 4 zg
+峛 5 zg
+峜 3 zg
+峝 4 zg
+峞 263 zg
+峟 2 zg
+峡 1732 j
+峡县 3 ns
+峡口 46 n
+峡山 7 ns
+峡山镇 3 ns
+峡弯海岸 3 n
+峡江 14 ns
+峡江县 3 ns
+峡湾 66 ns
+峡谷 901 n
+峣 279 zg
+峣峣易缺 3 nr
+峤 53 g
+峥 27 nr
+峥峥 3 i
+峥嵘 57 z
+峥嵘岁月 8 i
+峦 67 g
+峨 382 ns
+峨冠博带 9 n
+峨山 12 ns
+峨峨汤汤 3 ns
+峨峨洋洋 3 ns
+峨嵋 548 n
+峨嵋山 8 n
+峨嵋山市 3 n
+峨嵋派 3 n
+峨眉 98 ns
+峨眉山 169 ns
+峨眉山市 11 ns
+峨边 5 ns
+峨边县 2 ns
+峩 3 zg
+峪 192 g
+峪口 26 nrt
+峫 5 zg
+峭 156 n
+峭壁 419 n
+峭寒 3 n
+峭岐镇 2 v
+峭急 3 a
+峭拔 22 n
+峭直 3 a
+峭立 3 n
+峭论鲠议 3 vn
+峯 7 zg
+峰 2257 nr
+峰丘 3 n
+峰会 71 n
+峰值 75 n
+峰值因数 3 n
+峰值检波 3 n
+峰值检测 3 n
+峰化器 3 nz
+峰县 3 n
+峰回 3 n
+峰回路转 24 i
+峰头 3 n
+峰尖 3 n
+峰山 38 n
+峰岭 7 n
+峰峦 85 n
+峰峦叠嶂 3 i
+峰峦翠叠 3 i
+峰峦起伏 3 i
+峰峰 281 n
+峰峰矿区 3 n
+峰嶂 3 n
+峰嶂插天 3 n
+峰巅 20 n
+峰度 3 n
+峰林 43 nz
+峰点 3 n
+峰谷 3 n
+峰顶 181 n
+峰颠 3 ns
+峰驼 2 n
+峰高 3 n
+峰高程 3 n
+峱 9 zg
+峴 2 zg
+峵 5 zg
+島 2 zg
+峸 8 zg
+峹 4 zg
+峺 10 zg
+峻 305 ag
+峻厉 3 a
+峻宇彫墙 3 v
+峻宇雕墙 3 n
+峻岭 32 n
+峻岭崇山 3 vn
+峻峭 35 a
+峻工 7 n
+峻德 3 n
+峻急 3 a
+峻拔 3 n
+峻法 3 n
+峻法严刑 3 n
+峻笔 3 n
+峻节 3 n
+峻阪盐车 3 ns
+峼 3 zg
+崁 5 zg
+崁顶 3 z
+崂 139 ns
+崂山 71 ns
+崂山区 16 ns
+崂山县 3 ns
+崃 111 g
+崄 322 zg
+崅 8 zg
+崆 31 ns
+崆峒 203 ns
+崆峒区 3 ns
+崆峒山 31 ns
+崆峒岛 4 ns
+崆鳂 3 ns
+崇 1080 zg
+崇义 5 nrt
+崇义县 3 ns
+崇仁 137 nrt
+崇仁县 3 ns
+崇仰 9 v
+崇佑 3 v
+崇佑企专 3 nt
+崇信 41 nrt
+崇信县 3 ns
+崇光 182 nrt
+崇圣 16 ns
+崇墉百雉 3 nr
+崇奉 45 v
+崇宁 32 nrt
+崇安 26 nrt
+崇安区 3 ns
+崇尚 413 nrt
+崇尚自我 3 i
+崇山 3 nrt
+崇山峻岭 85 ns
+崇川区 3 ns
+崇州 5 nrt
+崇州市 8 ns
+崇左 7 nrt
+崇左市 3 ns
+崇庆 13 ns
+崇庆县 3 ns
+崇德 77 nrt
+崇拜 1182 nrt
+崇拜偶像 3 n
+崇拜者 74 n
+崇敬 258 v
+崇文 167 nrt
+崇文区 19 ns
+崇文门 175 nrt
+崇明 35 nrt
+崇明县 13 ns
+崇明岛 33 nrt
+崇本务实 3 i
+崇本抑末 3 n
+崇桢 19 t
+崇武 12 nrt
+崇武镇 3 nrt
+崇法务实 3 i
+崇洋 9 ns
+崇洋媚外 34 i
+崇礼 5 nrt
+崇礼县 3 n
+崇祯 3557 nrt
+崇祯帝 3 v
+崇福寺 3 ns
+崇论吰议 3 v
+崇论宏议 3 nz
+崇论谹议 3 v
+崇论闳议 3 vn
+崇阳 4 nrt
+崇阳县 512 ns
+崇雅黜浮 3 vn
+崇高 615 nrt
+崇高品德 3 ns
+崇高品质 3 nz
+崇高威信 3 nrt
+崇高威望 3 nrt
+崇高思想 3 i
+崇高理想 3 i
+崇高目标 3 n
+崇高精神 3 i
+崈 58 zg
+崉 42 zg
+崊 6 zg
+崋 99 zg
+崌 24 zg
+崍 27 zg
+崎 57 zg
+崎婆 3 i
+崎岖 264 a
+崎岖不平 23 i
+崎岖难走 3 i
+崎嵚历落 3 i
+崏 47 zg
+崐 93 zg
+崑 20 zg
+崒 14 zg
+崓 4 zg
+崔 601 nr
+崔世昌 2 nr
+崔世珍 2 nr
+崔书德 2 nr
+崔京周 3 nr
+崔仁师 3 nr
+崔令钦 2 nr
+崔佩仪 3 nr
+崔保山 2 nr
+崔健 43 nr
+崔元大 2 nr
+崔先生 2 nr
+崔光浩 3 nr
+崔军强 4 nr
+崔判官 9 nr
+崔剑平 6 nr
+崔南洙 3 nr
+崔占福 3 nr
+崔卫平 3 nr
+崔可法 3 nr
+崔各庄 2 nr
+崔呈秀 62 nr
+崔哲瀚 12 nr
+崔士鑫 3 nr
+崔大侠 2 nr
+崔大哥 15 nr
+崔大谋 3 nr
+崔天凯 104 nr
+崔天成 30 nr
+崔夫人 2 nr
+崔子忠 5 nr
+崔宗之 2 nr
+崔宗利 3 nr
+崔家庄 2 nr
+崔尚宫 14 nr
+崔峻墉 4 nr
+崔崇林 14 nr
+崔嵬 9 nr
+崔巍 7 nr
+崔州平 2 nr
+崔师兄 2 nr
+崔师叔 2 nr
+崔希敏 100 nr
+崔平浩 3 nr
+崔应元 7 nr
+崔应星 3 nr
+崔府君 2 nr
+崔建华 6 nr
+崔志圆 2 nr
+崔志方 22 nr
+崔念月 4 nr
+崔怀宝 2 nr
+崔恩景 2 nr
+崔慕燕 3 nr
+崔承禧 3 nr
+崔敏用 3 nr
+崔敦礼 2 nr
+崔文军 28 nr
+崔文升 9 nr
+崔新琴 3 nr
+崔昊剑 2 nr
+崔智友 3 nr
+崔木岚 3 nr
+崔殷泽 2 nr
+崔毅庄 2 nr
+崔民植 3 nr
+崔民洙 3 nr
+崔永元 29 nr
+崔永昌 3 nr
+崔济愚 2 nr
+崔浩修 2 nr
+崔浩然 3 nr
+崔海教 2 nr
+崔润英 3 nr
+崔玉蓉 49 nr
+崔玉贵 10 nr
+崔用裴 3 nr
+崔百泉 109 nr
+崔百胜 3 nr
+崔相逸 2 nr
+崔真实 3 nr
+崔真永 3 nr
+崔瞎子 11 nr
+崔秀云 4 nr
+崔秀庭 2 nr
+崔秀钟 3 nr
+崔秋山 125 nr
+崔立凡 75 nr
+崔红红 3 nr
+崔纵充 2 nr
+崔维宁 3 nr
+崔绿华 13 nr
+崔美善 4 nr
+崔老汉 5 nr
+崔胤兼 2 nr
+崔致远 4 nr
+崔莺莺 11 nr
+崔贞润 3 nr
+崔财源 3 nr
+崔述 3 nr
+崔道成 6 nr
+崔镖头 7 vn
+崔隐甫 2 nr
+崔頑 3 nrfg
+崔颢 7 nr
+崔飞烟 3 nr
+崔鸿 6 nr
+崕 21 zg
+崖 1270 ng
+崖刻 9 n
+崖城 3 ns
+崖墓 19 n
+崖壁 108 n
+崖壁画 6 n
+崖头 5 n
+崖岸 3 s
+崖崩 4 n
+崖柏 3 n
+崖洞 3 n
+崖画 5 n
+崖畔 3 n
+崖盐 3 n
+崖石 6 n
+崖葬 3 n
+崖谷 6 n
+崖顶 46 n
+崗 22 zg
+崘 3 zg
+崙 7 zg
+崚 299 zg
+崚嶒 3 z
+崛 80 v
+崛地而起 3 v
+崛起 785 v
+崜 9 zg
+崞 24 g
+崟 43 zg
+崟崎磊落 3 nr
+崠 24 zg
+崡 69 zg
+崤 70 g
+崤函之固 3 i
+崥 5 zg
+崦 19 x
+崧 147 zg
+崧生岳降 3 nr
+崨 2 zg
+崩 526 v
+崩伤 3 v
+崩坍 7 v
+崩坏 18 v
+崩塌 160 v
+崩岸 5 v
+崩掉 3 v
+崩溃 898 v
+崩溃点 3 n
+崩漏 25 v
+崩症 3 n
+崩盘 37 v
+崩落 25 v
+崩裂 46 v
+崩解 33 v
+崩露 3 v
+崩龙 3 n
+崩龙族 5 n
+崪 12 zg
+崬 2 zg
+崭 46 b
+崭新 520 b
+崭新面貌 3 i
+崭然 3 b
+崭现 3 v
+崭露 2 v
+崭露头脚 3 i
+崭露头角 72 i
+崮 34 g
+崯 13 zg
+崰 30 zg
+崱 34 zg
+崲 34 zg
+崳 27 zg
+崴 65 v
+崸 21 zg
+崹 2 zg
+崼 64 zg
+崽 95 n
+崽儿 6 n
+崽子 51 n
+崾 78 zg
+嵁 106 zg
+嵂 24 zg
+嵃 8 zg
+嵄 22 zg
+嵅 2 zg
+嵆 53 zg
+嵇 17 nr
+嵇中散 5 nr
+嵇中散集 5 nr
+嵇康死 2 nr
+嵇康致 2 nr
+嵇康集 4 nr
+嵇永仁 4 nr
+嵈 168 zg
+嵉 8 zg
+嵊 73 ns
+嵊县 40 ns
+嵊州 12 ns
+嵊州市 5 ns
+嵊泗 10 nrt
+嵊泗县 4 ns
+嵋 759 g
+嵌 941 v
+嵌体 3 n
+嵌体蜡 3 nz
+嵌入 180 v
+嵌入式 135 nz
+嵌入式应用 6 n
+嵌入式操作系统 14 n
+嵌入式软件 22 n
+嵌合 4 v
+嵌合体 10 n
+嵌块 3 n
+嵌套 18 nz
+嵌套循环 5 n
+嵌板 6 nz
+嵌段聚合 3 n
+嵌环 3 nz
+嵌石 3 nz
+嵌缝 2 v
+嵌边 3 n
+嵌进 3 v
+嵌金 3 n
+嵌钻石 3 nz
+嵌银 3 nz
+嵌镶 9 v
+嵍 4 zg
+嵎 27 zg
+嵏 12 zg
+嵐 7 zg
+嵑 9 zg
+嵒 30 zg
+嵓 3 zg
+嵕 10 zg
+嵖 4 zg
+嵗 2 zg
+嵘 51 x
+嵙 5 zg
+嵚崎磊落 3 nr
+嵛 25 g
+嵜 2 zg
+嵝 39 g
+嵟 4 zg
+嵡 21 zg
+嵦 4 zg
+嵧 7 zg
+嵨 3 zg
+嵩 182 ns
+嵩县 21 ns
+嵩山 666 ns
+嵩山少林寺 26 ns
+嵩明 3 ns
+嵩明县 2 ns
+嵪 5 zg
+嵫 27 x
+嵬 44 g
+嵬目鸿耳 3 v
+嵮 21 zg
+嵯 37 z
+嵯峨 32 z
+嵴 81 zg
+嵵 7 zg
+嵶 4 zg
+嵷 5 zg
+嵸 13 zg
+嵹 3 zg
+嵺 19 zg
+嵻 3 zg
+嵽 3 zg
+嵾 2 zg
+嵿 8 zg
+嶀 3 zg
+嶁 19 zg
+嶂 91 zg
+嶃 50 zg
+嶄 668 zg
+嶅 1348 zg
+嶅阳镇 3 ns
+嶆 1071 zg
+嶇 578 zg
+嶈 853 zg
+嶉 258 zg
+嶊 5 zg
+嶎 6 zg
+嶏 175 zg
+嶐 4 zg
+嶒 9 zg
+嶓 4 zg
+嶔 4 zg
+嶖 2 zg
+嶙 61 zg
+嶙峋 66 z
+嶛 13 zg
+嶜 5 zg
+嶝 5 g
+嶞 2 zg
+嶟 3 zg
+嶡 9 zg
+嶫 7 zg
+嶯 259 zg
+嶲 2 zg
+嶳 5 zg
+嶷 47 g
+嶽 10 zg
+巂 21 zg
+巅 157 n
+巅峰 156 n
+巅峰期 8 n
+巅峰状态 3 n
+巈 25 zg
+巉 15 zg
+巉岩 3 v
+巍 232 nr
+巍山 13 ns
+巍山县 2 ns
+巍山彝族回族自治县 4 ns
+巍峨 409 z
+巍巍 66 z
+巍巍泰山 3 nr
+巍巍荡荡 3 z
+巍然 70 z
+巍然屹立 15 i
+巍然矗立 3 vn
+巍蛾 3 i
+巎 6 zg
+巔 5 zg
+巖 10 zg
+巙 4 zg
+巛 2 zg
+巜 12 zg
+川 1716 j
+川上 16 ns
+川东 123 ns
+川东南 8 ns
+川东号 3 nz
+川东地区 2 ns
+川丽江 3 nr
+川之兵 2 nr
+川乌 3 ns
+川井 2 ns
+川兵远 2 nr
+川军 57 nr
+川剧 101 n
+川化 25 j
+川北 71 ns
+川南 28 ns
+川原 24 ns
+川双侠 3 nr
+川口 22 ns
+川周明 7 nr
+川味 4 nz
+川圹 9 n
+川壅必溃 3 v
+川妹子 3 nr
+川学海 6 nr
+川守李 3 nr
+川家光 2 nr
+川家康 23 nr
+川山甲 3 nr
+川岛 12 ns
+川岛芳子 5 nr
+川峡 3 ns
+川崎 28 ns
+川师大 3 nr
+川帮 3 j
+川庆喜 8 nr
+川底 12 ns
+川康公路 3 nz
+川恭司 2 nr
+川木通 2 nr
+川木香 4 nr
+川杨河 2 nr
+川楚陕 6 nr
+川楝 8 n
+川楝子 3 n
+川次郎 3 nr
+川汇区 3 ns
+川汉铁路 3 nz
+川江 64 ns
+川沙 3 ns
+川沙县 2 ns
+川沙镇 5 ns
+川泽纳污 3 nr
+川流 3 n
+川流不息 53 i
+川渟岳峙 3 ns
+川溯流 2 nr
+川滇黔 3 nr
+川烟柳 3 nr
+川牛膝 3 nr
+川白芷 2 nr
+川盐 3 nz
+川端康成 12 nr
+川红 3 nr
+川航 5 j
+川芎 32 n
+川芎嗪 3 nz
+川菜 41 n
+川菜馆 4 n
+川藏公路 40 ns
+川藏线 8 nz
+川西 91 ns
+川西云 2 nr
+川西平原 13 ns
+川西桑 2 nr
+川西碧 4 nr
+川西高原 9 ns
+川豆 3 n
+川贝 13 nr
+川贝母 10 nr
+川资 18 n
+川长社 3 j
+川陕宣 8 nr
+川静香 5 nr
+川马 11 ns
+川黔 40 j
+川黔滇 4 nr
+州 15951 n
+州委 15 n
+州官 20 n
+州官放火 3 n
+州市 115 n
+州府 549 n
+州政府 578 n
+州检察院 3 n
+州治 3 n
+州牧 60 n
+州界 20 n
+州立 85 b
+州立大学 3 n
+州郡 183 n
+州长 1944 n
+州际 3 n
+州际公路 3 n
+巟 19 zg
+巡 808 zg
+巡哨 46 n
+巡回 187 v
+巡回医疗 3 n
+巡回展 9 l
+巡回展览 3 n
+巡回检查 3 n
+巡回演出 78 l
+巡回演唱 3 l
+巡回赛 54 n
+巡回车 3 n
+巡夜 22 n
+巡天 15 n
+巡官 7 n
+巡察 50 v
+巡察使 7 n
+巡察队 3 n
+巡展 31 vn
+巡山 32 n
+巡幸 21 n
+巡弋 14 v
+巡戈飞弹 3 l
+巡抚 1299 n
+巡护 4 v
+巡按 123 n
+巡按使 3 n
+巡捕 228 v
+巡捕房 17 n
+巡更 7 v
+巡更机 3 nz
+巡查 104 vn
+巡检 89 v
+巡检仪 3 n
+巡检器 3 n
+巡洋舰 465 n
+巡游 80 n
+巡演 20 v
+巡礼 56 n
+巡线 2 n
+巡线追踪 3 n
+巡缉 3 v
+巡航 286 v
+巡航导弹 648 n
+巡航速度 3 n
+巡航飞弹 3 n
+巡行 52 v
+巡视 380 v
+巡视员 286 n
+巡视组 6 n
+巡视者 3 n
+巡警 165 n
+巡警队 4 n
+巡讲团 2 n
+巡访 2 v
+巡访团 3 n
+巡诊 23 v
+巡边员 5 n
+巡逻 657 v
+巡逻兵 3 n
+巡逻员 3 n
+巡逻哨 3 n
+巡逻机 56 n
+巡逻箱 3 nz
+巡逻舰 30 n
+巡逻艇 74 n
+巡逻车 12 n
+巡逻队 29 n
+巡逻骑兵 3 n
+巡道 42 v
+巡阅 19 v
+巡防 40 v
+巡防舰 3 n
+巡风 3 n
+巢 675 nr
+巢东 4 ns
+巢中 3 ns
+巢伯 2 ns
+巢倾卵破 3 nr
+巢倾卵覆 3 nr
+巢元方 9 nr
+巢内 9 ns
+巢内取 2 nr
+巢匪 3 n
+巢县 16 ns
+巢呈杯 2 nr
+巢呈梨 2 nr
+巢呈浅 3 nr
+巢城 3 ns
+巢域 2 ns
+巢室 5 n
+巢居 3 nr
+巢居穴处 3 nr
+巢材 2 n
+巢林一枝 3 nr
+巢毁卵破 3 n
+巢湖 124 ns
+巢湖市 18 ns
+巢焚原燎 3 nr
+巢畔 2 ns
+巢础 5 n
+巢穴 135 n
+巢窟 3 ns
+巢筑 9 n
+巢脾 6 nr
+巢蛋白 3 nr
+巢车推 2 nr
+巢里 2 ns
+巢门 2 ns
+巢鼠 3 n
+工 3771 n
+工专 3 j
+工业 26775 n
+工业专科 3 n
+工业产值 3 n
+工业产品 10 n
+工业体系 16 n
+工业分散 3 n
+工业制品 3 n
+工业化 1109 vn
+工业化学 3 n
+工业化生产 2 n
+工业区 406 n
+工业区位 3 n
+工业协会 3 n
+工业厅 3 n
+工业原料 3 n
+工业品 194 n
+工业园 526 n
+工业园区 29 n
+工业国 85 n
+工业地带 3 n
+工业家 26 n
+工业局 29 n
+工业布局 3 n
+工业废水 10 n
+工业性 14 n
+工业战线 3 n
+工业扩散 3 n
+工业无产 3 l
+工业气体 3 n
+工业污染 3 n
+工业油 3 n
+工业泵 3 n
+工业涂料 3 n
+工业港 3 n
+工业炉 8 n
+工业燃气 3 n
+工业王国 3 n
+工业生产 55 n
+工业用 76 n
+工业用品 3 n
+工业用地 3 n
+工业用水 3 n
+工业电器 3 n
+工业电炉 3 n
+工业电视 3 n
+工业界 58 n
+工业皮带 3 n
+工业盐 3 n
+工业硅 3 n
+工业空调 3 n
+工业统计 3 n
+工业贸易 3 l
+工业部 79 n
+工业部长 6 n
+工业部门 551 n
+工业锅炉 3 n
+工业集聚 3 nz
+工业革命 175 nz
+工事 358 n
+工于心计 3 l
+工交 9 n
+工人 10209 n
+工人下岗 3 n
+工人体育场 3 n
+工人党 170 n
+工人员 2 n
+工人失业 3 n
+工人工资 3 n
+工人日报 3 nz
+工人贵族 3 n
+工人运动 485 l
+工人阶级 1189 n
+工件 225 n
+工价 32 n
+工休 3 vn
+工休日 3 n
+工会 981 n
+工会主席 3 n
+工会工作 3 n
+工会干部 3 n
+工会战 3 n
+工会法 8 n
+工会组织 3 n
+工会网 3 n
+工伤 63 n
+工伤事故 3 n
+工伤保险 3 n
+工位 21 n
+工体 17 n
+工余 12 n
+工作 66367 vn
+工作人员 2306 n
+工作作风 3 n
+工作到位 3 l
+工作制 58 n
+工作力度 3 n
+工作勤奋 3 l
+工作台 39 n
+工作团 24 n
+工作场地 3 n
+工作坊 7 n
+工作大队 3 n
+工作失误 3 n
+工作姿势 3 l
+工作守则 3 n
+工作实绩 3 n
+工作室 96 n
+工作对口 3 n
+工作岗位 3 n
+工作思路 3 n
+工作手册 3 n
+工作指南 3 n
+工作效率 30 n
+工作文件 9 n
+工作日 789 n
+工作日内 3 l
+工作日程 3 l
+工作服 55 n
+工作栈 3 n
+工作桌 3 n
+工作梯 3 n
+工作母机 4 n
+工作汇报 3 n
+工作浮夸 3 l
+工作液 3 n
+工作温度 22 n
+工作热量 3 n
+工作犬 3 n
+工作狂 21 l
+工作电压 2 n
+工作站 151 n
+工作简报 3 l
+工作组 373 n
+工作组服务器 10 l
+工作细则 3 n
+工作者 925 n
+工作裤 3 n
+工作记忆 3 n
+工作证 27 n
+工作评议 3 n
+工作调动 3 l
+工作过度 3 l
+工作进展 3 l
+工作进度 3 n
+工作部 43 n
+工作部门 530 n
+工作量 139 n
+工作队 78 n
+工作难度 3 l
+工作面 22 n
+工作鞋 3 n
+工作预案 3 n
+工作频率 5 n
+工作餐 18 n
+工信处 288 n
+工值 3 n
+工党 228 n
+工兵 459 n
+工兵团 46 n
+工兵营 45 n
+工兵连 21 j
+工具 4819 n
+工具书 75 n
+工具包 22 n
+工具化 4 l
+工具区 3 n
+工具厂 2 n
+工具室 3 n
+工具性 8 n
+工具房 2 n
+工具机 3 n
+工具条 3 l
+工具柜 3 n
+工具栏 2 n
+工具理性 3 n
+工具箱 9 n
+工具车 4 n
+工具软件 4 l
+工具钢 31 n
+工具集 5 n
+工农 848 n
+工农业 590 n
+工农业总 3 n
+工农兵 271 n
+工农兵学员 9 n
+工农兵学商 7 n
+工农分子 3 n
+工农区 8 n
+工农子弟 3 n
+工农差别 3 n
+工农红军 85 n
+工农联盟 136 j
+工农贸 2 j
+工农路 3 n
+工况 10 n
+工分 69 n
+工分值 3 n
+工副业 3 j
+工力 44 n
+工力悉敌 3 nr
+工办 8 j
+工务 17 n
+工务局 3 n
+工务段 2 n
+工勤 3 n
+工匠 1860 n
+工区 25 n
+工博会 3 j
+工卡 21 n
+工厂 3460 n
+工厂倒闭 3 n
+工厂关门 3 n
+工厂化 23 n
+工厂区 19 n
+工厂权 3 n
+工厂用电 3 n
+工厂破产 3 n
+工友 39 n
+工号 3 n
+工号牌 3 n
+工商 1684 n
+工商专科 3 j
+工商业 934 j
+工商业户 4 n
+工商业界 3 n
+工商业者 102 n
+工商代理 3 n
+工商企业 54 j
+工商企业界 4 n
+工商会 3 j
+工商分局 3 n
+工商司 3 n
+工商大学 3 nt
+工商学院 3 nt
+工商局 428 j
+工商局长 2 n
+工商总局 3 nt
+工商户 69 n
+工商所 10 j
+工商时代 3 n
+工商时报 3 n
+工商界 82 n
+工商登记 3 n
+工商社会 3 j
+工商税 6 j
+工商管理 3 j
+工商管理学 2 nt
+工商管理学士 2 n
+工商网 3 n
+工商职业 3 j
+工商联 72 j
+工商联合 3 j
+工商行 3 j
+工商行政 3 n
+工商行政管理局 10 nt
+工商费 3 n
+工商部 8 j
+工商部门 58 n
+工商银行 3 j
+工团主义 12 n
+工地 704 n
+工地秀 3 nz
+工场 620 n
+工场手工 3 n
+工大 40 j
+工夫 953 n
+工夫茶 11 n
+工头 88 n
+工委 98 n
+工子弟 3 n
+工字 5 n
+工字型 2 n
+工字形 8 n
+工字钢 3 n
+工学 77 n
+工学院 488 n
+工宣队 3 j
+工寮 3 ns
+工尺 17 n
+工展会 3 n
+工工整整 16 l
+工工资 3 n
+工巧 20 n
+工布 9 n
+工布江达 5 ns
+工布江达县 3 ns
+工序 669 n
+工役 3 n
+工房 12 n
+工技 3 n
+工技学院 3 n
+工控 3 vn
+工控微机 3 n
+工控机 3 n
+工控网 3 n
+工效 166 n
+工整 128 vn
+工料 5 n
+工日 3 n
+工时 46 n
+工时费 3 n
+工期 73 vn
+工期短 3 n
+工期紧 3 l
+工本 26 n
+工本费 12 n
+工架 7 n
+工棚 47 n
+工楷 3 n
+工模 3 n
+工横 3 a
+工欲善其 3 nr
+工欲善其事 8 i
+工段 15 n
+工段长 2 n
+工民建 3 n
+工潮 11 n
+工用 6 n
+工矿 103 n
+工矿业 69 n
+工矿企业 143 j
+工矿区 42 n
+工研所 3 j
+工研院 3 j
+工社党 3 n
+工种 115 n
+工科 168 n
+工科大学 3 l
+工科学生 3 n
+工程 16869 n
+工程上马 3 n
+工程兵 76 n
+工程决算 3 n
+工程力学 3 n
+工程化 6 n
+工程史 3 n
+工程图 4 n
+工程图纸 3 n
+工程地质 3 n
+工程塑料 4 n
+工程处 150 n
+工程学 100 n
+工程学系 3 n
+工程学院 1162 n
+工程局 287 n
+工程师 1569 n
+工程师学 3 n
+工程建设 23 l
+工程建设者 2 n
+工程技术 18 n
+工程施工 3 n
+工程机械 2 n
+工程桩 3 n
+工程模式 3 n
+工程款 26 n
+工程浩大 145 n
+工程版 3 n
+工程界 3 n
+工程硕士 3 nr
+工程磁铁 3 n
+工程管线 3 n
+工程系 48 n
+工程细胞 3 n
+工程署 5 n
+工程船 3 n
+工程菌 3 n
+工程装饰 3 n
+工程规划 3 n
+工程设计 7 n
+工程质量 6 n
+工程费 3 n
+工程车 34 n
+工程进度 3 n
+工程造价 2 n
+工程部 17 n
+工程量 43 n
+工程量表 3 n
+工程队 28 n
+工程院 87 n
+工程项目 31 n
+工程顾问 3 l
+工程预算 3 l
+工程验收 3 n
+工稳 18 a
+工笔 90 n
+工笔画 23 n
+工细 28 n
+工缴费 5 n
+工美 6 vn
+工职 3 n
+工联 37 j
+工联主义 11 n
+工联会 3 j
+工致 16 n
+工艺 2692 n
+工艺制作 2 l
+工艺制品 3 n
+工艺厂 6 n
+工艺员 5 n
+工艺品 405 n
+工艺品厂 3 n
+工艺学 29 n
+工艺学校 3 l
+工艺师 6 n
+工艺性 10 n
+工艺性能 3 n
+工艺技术 3 n
+工艺模拟 3 i
+工艺水平 3 n
+工艺流程 28 n
+工艺画 3 n
+工艺礼品 3 n
+工艺程序 3 n
+工艺精品 3 n
+工艺网 3 n
+工艺美术 168 l
+工艺美术品 38 n
+工艺美术家 10 l
+工艺论典 3 n
+工艺设备 3 n
+工艺课 3 n
+工艺鞋 3 n
+工艺馆 3 n
+工薪 31 n
+工薪层 3 n
+工薪族 7 n
+工薪阶层 49 n
+工蚁 36 n
+工蜂 44 n
+工行 92 j
+工装 22 n
+工装裤 3 n
+工读 28 vn
+工读学校 3 n
+工读教育 3 n
+工读生 7 n
+工课 12 n
+工质 60 n
+工贸 307 j
+工贸结合 3 l
+工贼 31 n
+工资 4976 vn
+工资分 8 n
+工资制 41 n
+工资制度 3 n
+工资劳动 3 l
+工资单 7 n
+工资卡 5 n
+工资待遇 3 n
+工资总额 3 n
+工资收入 3 n
+工资改革 3 l
+工资条 3 n
+工资标准 3 n
+工资水平 3 n
+工资福利 3 n
+工资管理 3 n
+工资级别 3 n
+工资表 11 n
+工资袋 3 n
+工资附加 3 n
+工资额 10 n
+工辎兵 3 vn
+工运 3 n
+工部 1768 n
+工部侍郎 3 n
+工部尚书 3 l
+工部局 28 n
+工量具 3 n
+工钱 214 n
+工长 12 n
+工间 3 n
+工间操 5 n
+工青妇 4 n
+工频 3 n
+工龄 103 n
+左 12823 m
+左一剑 3 nr
+左一掌 3 nr
+左一闪 8 nr
+左上 32 f
+左上方 15 f
+左上臂 2 i
+左上角 41 f
+左下 9 m
+左下方 9 m
+左下角 24 m
+左不过 8 l
+左世雄 3 nr
+左丘明 29 nr
+左丞相 116 nr
+左中允 4 nr
+左中前卫 3 nr
+左中后卫 3 nr
+左之助 3 nr
+左书僮 3 n
+左书右息 3 nr
+左二营 2 nr
+左云 5 nr
+左云县 2 nr
+左五营 2 nr
+左仆射 8 nr
+左企弓 38 nr
+左伊育 2 nr
+左传 256 nr
+左伯桃 4 nr
+左侍郎 15 nr
+左侧 866 f
+左倾 27 nr
+左倾份子 3 n
+左偏 3 d
+左光先 51 nr
+左光斗 82 nr
+左光禄 5 nr
+左兵东 3 nr
+左军北 2 nr
+左军右 2 nr
+左军来 2 nr
+左军阵 2 nr
+左军青 2 nr
+左冲右 8 nr
+左冷禅 179 nr
+左分式环 3 nr
+左利手 3 n
+左利者 3 nr
+左券 5 n
+左前 3 f
+左前卫 10 nr
+左前方 3 nr
+左前锋 3 nr
+左剑平 2 nr
+左剑指 2 nr
+左匹配 3 nz
+左半球 3 n
+左卫中 2 nr
+左卫将军 4 nr
+左卫都 2 nr
+左卫门 6 nr
+左右 11169 m
+左右一阵 3 m
+左右万户 2 m
+左右两 59 m
+左右两个 12 m
+左右两半 9 m
+左右两只 4 m
+左右两名 2 m
+左右两员 8 m
+左右两壁 5 m
+左右两座 132 m
+左右两手 2 m
+左右两支 3 m
+左右两派 2 m
+左右两端 2 m
+左右两股 2 m
+左右两行 4 m
+左右两路 4 m
+左右两队 2 m
+左右两难 3 i
+左右两面 3 m
+左右为难 77 i
+左右侧 10 i
+左右分 140 m
+左右列 5 m
+左右包 2 m
+左右十丈 2 m
+左右双 12 m
+左右双刀 3 m
+左右发 3 m
+左右台 3 m
+左右图史 3 nr
+左右壁 2 nr
+左右夹攻 3 i
+左右宗 2 m
+左右岸 3 nr
+左右幕 2 m
+左右开弓 47 nr
+左右张 7 m
+左右手 54 m
+左右排 3 m
+左右摇摆 3 i
+左右支 2 m
+左右方 3 m
+左右束 3 m
+左右江 30 nr
+左右派 23 m
+左右百 3 m
+左右盘 2 m
+左右眼 5 m
+左右端 3 m
+左右群 3 m
+左右羽 6 nr
+左右翼 22 nr
+左右脑 5 i
+左右脚 3 i
+左右逢原 3 i
+左右逢源 54 i
+左右部 6 m
+左右采获 3 i
+左右铭 3 nr
+左右门 132 m
+左右间 19 m
+左右顾盼 3 i
+左司 2 n
+左司谏 3 nr
+左司郎中 3 nr
+左司马曹 2 nr
+左后 3 f
+左后卫 10 nr
+左后方 3 f
+左向 3 nr
+左向右 13 nr
+左善世 2 nr
+左嗓子 3 n
+左四营 9 nr
+左回焉 4 i
+左国城 11 nr
+左图右书 3 nr
+左图右史 3 nr
+左声道 3 m
+左外野 3 nr
+左外野手 3 i
+左大培 2 nr
+左大掌 2 nr
+左太北 12 nr
+左夫人 5 nr
+左奥尔环 3 nr
+左子穆 111 nr
+左孝虎 3 nr
+左宁南 11 nr
+左安安 3 nr
+左安门 8 nr
+左宗棠 89 nrfg
+左宗正 2 nr
+左宜右宜 3 i
+左宜右有 3 i
+左宝贵 3 nr
+左家 2 m
+左家军 3 nr
+左家塘 2 nr
+左家庄 2 nr
+左宽右窄 3 i
+左小腿 2 nr
+左尹非 2 nr
+左山山 2 nr
+左岸 219 f
+左崇楼 3 nr
+左布政 2 nr
+左师伯 20 nr
+左师兄 8 nr
+左平 2 m
+左廊 2 n
+左归丸 8 nr
+左御史 2 nr
+左德敏 2 nr
+左心 6 n
+左心室 2 nr
+左忠毅 5 nr
+左思 22 nr
+左思右 2 nr
+左思右想 72 i
+左性 2 n
+左性子 3 nr
+左总兵 5 nr
+左懋第 17 nr
+左手 3758 m
+左手指 5 i
+左手掌 3 i
+左手画方 3 i
+左手腕 4 n
+左手边 3 n
+左抱右拥 3 i
+左拉 40 nr
+左拐进 2 nr
+左招右 3 nr
+左拥右抱 7 nr
+左拳 7 m
+左掌 67 nr
+左掌伸 5 nr
+左掌击 9 nr
+左掌划 2 nr
+左掌削 2 nr
+左掌右 5 nr
+左掌呼 4 nr
+左掌如 3 nr
+左掌微 3 nr
+左掌忽 3 nr
+左掌托 3 nr
+左掌扬 5 nr
+左掌护 3 nr
+左掌拍 6 nr
+左掌挥 11 nr
+左掌提 2 nr
+左掌摊 2 nr
+左掌撑 2 nr
+左掌横 3 nr
+左掌猛 4 nr
+左掌疾 4 nr
+左掌相 2 nr
+左掌翻 4 nr
+左掌虚 8 nr
+左掌连 3 nr
+左掌门 37 nr
+左掌阳 2 nr
+左掌飞 3 nr
+左提右挈 3 i
+左揽繁 2 l
+左撇子 62 n
+左支右吾 3 nr
+左支右绌 38 i
+左支右调 3 i
+左文清 17 nr
+左文襄公 5 nr
+左方 44 m
+左旁 3 f
+左旋 73 nr
+左旋体 7 n
+左旋多巴 3 nr
+左旗南 7 nr
+左旗境 4 nr
+左昆山 11 nr
+左晴雯 3 nr
+左有林 3 nr
+左末旗 2 nr
+左权 96 n
+左权县 68 nr
+左杖 3 n
+左杰伊 38 nr
+左枝右梧 3 ns
+左柱国 6 nr
+左树声 6 nr
+左校 4 n
+左梦庚 45 nr
+左梦梅 17 nr
+左步青 15 nr
+左武卫 7 nr
+左氏传 3 nr
+左氏春秋 3 nr
+左洛复 3 nr
+左派 425 m
+左派份子 3 n
+左渐晓 3 nr
+左满舵 6 nr
+左理想 3 n
+左监军 2 nr
+左盘右 2 nr
+左眼 158 m
+左祖右 130 nr
+左移 17 nr
+左程右准 3 n
+左章 3 m
+左端 8 m
+左线 3 m
+左美奈 16 nr
+左翅势 2 n
+左翊卫 3 nr
+左翼 640 nr
+左翼中旗 3 nr
+左翼后旗 3 nr
+左翼文化运动 39 nz
+左耳 41 nr
+左耳尖 2 nr
+左联 64 nr
+左联遂 2 nr
+左肋 3 n
+左肩微 5 nr
+左胁斗 2 nr
+左胳膊 3 v
+左脚 329 n
+左脸生 2 nr
+左腿 335 n
+左膀 12 n
+左膀右臂 20 l
+左臂 549 n
+左舜生 3 nr
+左舷 25 n
+左良玉 881 nr
+左英杰 2 nr
+左营 88 nr
+左营区 3 n
+左营桃子 2 n
+左营港 2 nr
+左萦右拂 3 nr
+左行 2 m
+左袒 3 v
+左袖 10 n
+左袖挥 4 nr
+左角 3 m
+左证 3 j
+左诗蓓 3 nr
+左说右说 3 i
+左谏议 2 nr
+左贡 3 nr
+左贡县 3 nr
+左贤王 11 nr
+左足刚 10 nr
+左足微 3 nr
+左足疾 2 nr
+左足轻 2 i
+左足飞 19 nr
+左跃开 3 nr
+左路 157 m
+左路传 7 nr
+左路军 43 nr
+左路起 2 m
+左躲右闪 17 i
+左转 3 nr
+左转成 2 nr
+左轮 7 m
+左轮手枪 42 n
+左轮枪 3 n
+左辅右弼 5 nr
+左辅右粥 3 l
+左辅正 3 nr
+左边 754 f
+左边前卫 3 nr
+左边后卫 3 nr
+左边锋 3 nr
+左迁 8 nr
+左近 136 f
+左选郎 2 nr
+左道 3 m
+左道之 2 nr
+左道傍 2 nr
+左道旁门 5 i
+左道派 2 nr
+左邻 4 nr
+左邻右社 3 l
+左邻右舍 72 i
+左邻右里 2 i
+左部帅 2 nr
+左里奇 7 nr
+左里齐 3 nr
+左金吾 5 nr
+左金王 7 nr
+左针 2 n
+左钦察 2 nr
+左键 2 n
+左镇 6 nr
+左长史 7 nr
+左难右难 3 i
+左青龙 7 nr
+左面 50 f
+左顺门 26 nr
+左顾 3 nr
+左顾右盼 53 i
+左领军 5 nr
+左飞身 2 nr
+左首 184 m
+左首立 2 nr
+左马太 2 nr
+巧 1217 a
+巧不可接 3 i
+巧不可阶 3 i
+巧事 19 n
+巧伪趋利 3 n
+巧作名目 3 i
+巧做 3 v
+巧偷豪夺 3 i
+巧克力 363 nr
+巧克力糖 3 nr
+巧劲 34 a
+巧劲儿 2 nr
+巧匠 162 nr
+巧发奇中 3 nr
+巧取 3 v
+巧取豪夺 51 i
+巧合 278 v
+巧同造化 3 n
+巧名盖世 3 i
+巧夺天公 3 nr
+巧夺天工 38 i
+巧妇 15 nr
+巧妇难为 3 i
+巧妇难为无米之炊 14 i
+巧妙 932 a
+巧姐儿 24 nr
+巧媚 3 a
+巧家 4 n
+巧家县 3 nr
+巧干 6 nr
+巧得很 3 nr
+巧思 20 nr
+巧战 3 v
+巧手 39 v
+巧捷万端 3 nr
+巧猾 3 a
+巧用 3 v
+巧立名目 32 i
+巧立名色 3 i
+巧笑倩兮 9 nr
+巧舌如簧 13 i
+巧言 3 nr
+巧言令色 9 i
+巧言偏辞 3 i
+巧言利口 3 i
+巧言如簧 3 i
+巧计 34 v
+巧设 3 v
+巧诈 3 a
+巧语 2 nr
+巧语花言 3 i
+巧谲 3 a
+巧辞 3 nr
+巧辩 4 nr
+巧遇 325 nr
+巧问妙答 3 nr
+巨 2014 nr
+巨万 4 nr
+巨乳 3 nz
+巨人 358 n
+巨人症 14 n
+巨人般 3 a
+巨人队 3 n
+巨作 17 n
+巨债 3 n
+巨像 3 n
+巨兽 14 n
+巨制 17 n
+巨力 20 n
+巨力撞 3 nr
+巨力相 2 nr
+巨力竟 2 nr
+巨匠 34 n
+巨匾 3 n
+巨厚 3 a
+巨原纤维 3 n
+巨厦 3 n
+巨变 123 nz
+巨口 2 n
+巨口畸形 3 i
+巨响 405 vn
+巨唇症 3 n
+巨商 20 n
+巨嘴鸟 3 nr
+巨噬细胞 3 l
+巨型 329 b
+巨型客机 3 n
+巨型机 41 n
+巨型计算机 2 n
+巨声 2 n
+巨声突 2 nr
+巨声震 2 nr
+巨大 8034 a
+巨大作用 3 n
+巨大力量 3 n
+巨大反映 3 i
+巨大变化 3 nz
+巨大工程 3 n
+巨大成功 3 nr
+巨大成就 3 i
+巨大损失 3 n
+巨大胜利 3 nr
+巨大菌落 3 n
+巨大贡献 3 nr
+巨大进步 3 nr
+巨头 464 n
+巨奖 4 nz
+巨奸 3 n
+巨好 3 a
+巨子 39 n
+巨室 22 n
+巨寇 2 n
+巨富 37 a
+巨岩封 2 nr
+巨岩砰 2 nr
+巨峰 14 nr
+巨幅 455 n
+巨幼样 2 nr
+巨手 13 n
+巨擘 22 n
+巨数 3 n
+巨斧 5 nz
+巨无霸 46 nr
+巨星 171 nr
+巨木撞 3 nr
+巨木旗 13 nr
+巨木盆 2 nr
+巨构 3 n
+巨树 2 n
+巨核细胞 3 b
+巨案 3 n
+巨梁水 2 nr
+巨款 113 n
+巨正则 2 nr
+巨流 12 n
+巨济 3 n
+巨济岛 3 nr
+巨浪 161 nz
+巨浪滔天 3 i
+巨港 23 ns
+巨潮网 4 nz
+巨澜 3 n
+巨炮 2 n
+巨烛 2 n
+巨然 8 b
+巨照 3 nr
+巨片 11 n
+巨牙症 3 nz
+巨物 2 n
+巨球蛋白 3 n
+巨眼 20 a
+巨着 3 a
+巨石 398 nr
+巨石阵 32 nr
+巨祸 5 n
+巨细 18 a
+巨细无遗 3 i
+巨细胞 16 b
+巨细靡遗 3 i
+巨胶束 3 n
+巨能钙 3 nz
+巨臂 3 n
+巨舌症 3 n
+巨舰 31 n
+巨著 147 a
+巨葛庄 3 nr
+巨虫 20 n
+巨蛇 7 n
+巨蛇座 3 nr
+巨蛋 3 n
+巨蜂 3 n
+巨蜥 13 n
+巨螺 2 n
+巨蟒 97 n
+巨蟹 3 n
+巨蟹座 12 nz
+巨观 3 a
+巨视 3 b
+巨象 2 n
+巨贪 8 n
+巨贾 12 nr
+巨资 153 n
+巨轮 182 n
+巨野 21 n
+巨野县 3 nr
+巨野泽 3 nr
+巨量 20 n
+巨钟之 2 nr
+巨钟合 2 nr
+巨钟撞 2 nr
+巨集 3 a
+巨雕 3 n
+巨颌症 3 n
+巨额 604 b
+巨额利润 3 n
+巨额存款 3 n
+巨额财产 3 n
+巨骨 4 n
+巨髎 3 vn
+巨鲸帮 25 nr
+巨鲸船 3 nr
+巨鸟 3 n
+巨鹿 35 nr
+巨鹿县 6 nr
+巨鹿路 3 nr
+巨鹿郡 4 nr
+巨鼠 2 n
+巨齿 3 n
+巨龙 111 nr
+巩 171 nr
+巩乃斯河 6 nr
+巩义 8 nr
+巩义市 24 ns
+巩义段 2 nr
+巩仪县 3 nr
+巩俐 13 nr
+巩利 3 ns
+巩县 42 ns
+巩县任 3 nr
+巩县窑 2 nr
+巩固 2017 v
+巩固国防 3 nr
+巩固基地 3 ns
+巩固政权 3 nr
+巩固率 2 nr
+巩大哥 7 nr
+巩家庄 7 nr
+巩州 2 ns
+巩昌总 2 nr
+巩永固 18 nr
+巩汉林 3 nr
+巩献田 3 nr
+巩珍著 3 nr
+巩留 7 v
+巩留县 4 nr
+巩留野 3 nr
+巩简公 2 nr
+巩膜 26 n
+巩访 2 v
+巫 253 nr
+巫丹 2 ns
+巫之别 2 nr
+巫云楚雨 3 nr
+巫兰英 2 nr
+巫医 13 nr
+巫卜之 2 nr
+巫卜祝 2 nr
+巫启贤 3 nr
+巫头村 3 nr
+巫女 19 n
+巫妪 3 n
+巫婆 28 nr
+巫山 405 ns
+巫山云雨 6 nr
+巫山县 26 ns
+巫山洛水 3 ns
+巫山洛浦 3 ns
+巫山长江大桥 34 ns
+巫峡 45 ns
+巫峡镇 3 ns
+巫师 187 nr
+巫教 2 n
+巫明明 6 nr
+巫术 130 n
+巫毒娃娃 3 n
+巫溪 7 nr
+巫溪县 5 ns
+巫盐 8 n
+巫础 8 n
+巫神 4 n
+巫统 6 n
+巫者 9 n
+巫衣 4 n
+巫陵 5 ns
+巫陵王 24 nr
+差 7254 a
+差一点 176 d
+差一点儿 15 l
+差三错四 3 i
+差下 3 l
+差不多 2548 l
+差不差 3 l
+差不离 19 l
+差不远 3 l
+差之千里 3 l
+差之毫厘 7 i
+差事 136 n
+差些 3 d
+差人 3 n
+差代数 3 l
+差以毫厘 3 i
+差价 142 n
+差价款 3 l
+差价率 4 l
+差任 3 n
+差使 199 n
+差值 62 n
+差值帧 3 n
+差光谱 3 l
+差分 66 n
+差分器 3 l
+差分法 10 n
+差分表 3 n
+差别 2364 d
+差别化 5 l
+差别待遇 3 l
+差别性 6 n
+差别透性 3 n
+差别阈限 3 v
+差动 3 n
+差动力 3 n
+差动滑轮 3 n
+差劲 57 n
+差可 3 l
+差号 3 n
+差向异构 3 l
+差堪自慰 3 i
+差失 3 n
+差官 40 n
+差度 3 n
+差异 2196 n
+差异分离 3 l
+差异化 88 l
+差异基因 3 n
+差异性 68 l
+差异量数 3 l
+差强人意 30 l
+差役 204 n
+差得多 3 l
+差得远 3 d
+差散射 3 l
+差数 44 n
+差旅 9 n
+差旅费 18 n
+差池 64 n
+差波束 3 n
+差派 3 n
+差点 748 n
+差点儿 122 l
+差热分析 3 l
+差猜 9 v
+差率 29 n
+差生 30 n
+差矣 3 i
+差积 3 n
+差误 3 n
+差距 1759 n
+差路 3 n
+差转 5 v
+差转台 3 n
+差迁 3 v
+差远 3 d
+差远了 3 l
+差速 10 d
+差速器 23 n
+差速沉降 3 l
+差速离心 3 n
+差遣 257 v
+差钱 3 n
+差错 237 n
+差错控制 5 n
+差错率 10 n
+差音 3 n
+差额 388 n
+差额选举 777 l
+巯 15 n
+巯基 17 n
+巯基乙胺 3 n
+巯基乙醇 3 n
+巯基喹啉 3 nr
+巯基嘌呤 3 n
+巰 7 zg
+己 1989 r
+己丑 3 n
+己二烯 5 nz
+己二胺 11 nz
+己二酸 19 nz
+己二醇 2 nz
+己亥 2 m
+己亥水 3 nz
+己任 134 n
+己内酰胺 19 nz
+己午 3 m
+己卯 9 m
+己子 22 n
+己寅 3 m
+己巳 7 m
+己巳年 3 m
+己巳日 3 m
+己戌 3 m
+己所不欲 29 i
+己方 234 n
+己未 14 m
+己溺己饥 3 l
+己炔 3 n
+己烯 3 n
+己烷 6 n
+己生来 3 i
+己申 3 m
+己见 42 n
+己身 3 r
+己辰 3 n
+己酉 3 m
+己酉日 3 m
+己酮 3 n
+己酸 5 n
+己酸基 3 n
+己醇 3 n
+己醛 3 n
+已 72638 d
+已不 3 d
+已为 3 d
+已久 3 d
+已于 3 d
+已付 3 v
+已修 14 v
+已假乱真 3 n
+已决犯 5 v
+已利再战 3 n
+已势压人 3 n
+已向 3 d
+已售 3 v
+已婚 170 v
+已婚有偶 3 n
+已婚者 5 n
+已定 3 d
+已对 3 d
+已将 3 d
+已小见大 3 v
+已工补农 3 n
+已开文件 3 n
+已往 39 d
+已征 3 v
+已得 3 d
+已德报怨 3 n
+已成 574 v
+已成定局 3 n
+已扣 3 v
+已报关 3 n
+已拨 3 v
+已损坏 3 v
+已故 151 d
+已旧换新 3 n
+已是 3 d
+已晚 3 d
+已有 3798 v
+已有近 3 v
+已次充好 3 v
+已此为荣 3 ns
+已法治税 3 n
+已然 1440 d
+已燃区 3 n
+已用 3 d
+已登记 3 n
+已知 1228 v
+已知数 5 n
+已礼相待 3 n
+已税 3 v
+已纳 3 nrt
+已经 51289 d
+已缩水 3 v
+已而 3 d
+已见分晓 3 v
+已观后效 3 n
+已触犯 3 n
+已诚相待 3 n
+已资 3 v
+已资鼓励 3 n
+已身殉职 3 vn
+已达成 3 nrt
+已过期 3 d
+已近尾声 3 n
+已远 3 d
+已逝 3 v
+已逸待劳 3 nz
+已销 3 v
+已阅 3 v
+已防万一 3 n
+已非 3 d
+巳 341 mg
+巳时 3 t
+巳蛇 3 t
+巴 4887 ns
+巴丁 39 nrt
+巴三揽四 3 nz
+巴三览四 3 ns
+巴不得 249 l
+巴丘 3 ns
+巴东 343 ns
+巴东县 264 ns
+巴丫儿 2 nr
+巴中 66 ns
+巴中县 2 ns
+巴中市 10 ns
+巴丹 22 ns
+巴丹吉林 17 ns
+巴丹吉林沙漠 22 ns
+巴乌 15 ns
+巴乔 5 nr
+巴乔夫 2 nr
+巴亚 3 ns
+巴亚诺 2 nr
+巴亭广场 3 ns
+巴人 51 nrt
+巴人下里 3 ns
+巴什基尔 29 nrt
+巴以 3 nr
+巴仲麦 2 nr
+巴伊 13 nrt
+巴伊亚 7 ns
+巴伊亚州 5 ns
+巴伐利 4 ns
+巴伐利亚 122 ns
+巴伐利亚州 26 ns
+巴伦 7 ns
+巴伦坦 5 ns
+巴伦支 6 nr
+巴伦支海 51 ns
+巴伦斯 2 ns
+巴伦特 2 nr
+巴伦西 4 ns
+巴伦西亚 31 ns
+巴伦西亚队 2 nt
+巴伯 2 ns
+巴依样 2 nr
+巴倍虫 2 nr
+巴儿吉 5 nr
+巴儿狗 3 nr
+巴儿监 5 nr
+巴克 43 ns
+巴克利 9 ns
+巴克图 10 nr
+巴克夏猪 2 nr
+巴克尔 3 nr
+巴克布尔 2 nrt
+巴克希 2 nr
+巴克德 3 nr
+巴克拉 4 nrt
+巴克斯 12 nr
+巴克特 43 nr
+巴克纳 2 nr
+巴克莱 12 nr
+巴克莱银行 2 nt
+巴克豪 4 nr
+巴克里 2 nrt
+巴兰 7 ns
+巴兰基 2 nr
+巴兰基亚 5 ns
+巴兰德 2 nr
+巴兰斯基 2 nrt
+巴兰格 3 nr
+巴兰水 2 ns
+巴兰钦 16 nr
+巴兹 2 ns
+巴列东 2 ns
+巴列夫 6 nr
+巴列奥 5 nrt
+巴列维 36 nr
+巴列霍 2 nr
+巴利 10 ns
+巴利亚 4 ns
+巴利亚多利德 7 nrt
+巴利奥 4 nr
+巴利奥尔 3 nrt
+巴利巴 2 ns
+巴利文 15 nr
+巴利斯 2 ns
+巴利语 5 nr
+巴利阿里 12 ns
+巴别 3 n
+巴前算后 3 l
+巴力斗 2 nr
+巴勃罗 2 nr
+巴勒 24 nrt
+巴勒克 3 nr
+巴勒尔 2 nr
+巴勒斯 5 ns
+巴勒斯坦 898 ns
+巴勒斯坦人 32 nrt
+巴勒斯坦伊斯兰抵抗运动 6 nz
+巴勒斯坦全国委员会 7 nt
+巴勒斯坦国 19 ns
+巴勒斯坦地区 13 ns
+巴勒斯坦民族权力机构 4 nt
+巴勒斯坦民族解放运动 2 nz
+巴勒斯坦自治区 2 ns
+巴勒斯坦解放组织 21 nt
+巴勒根 2 ns
+巴勒莫 108 nr
+巴南 3 ns
+巴南区 2 ns
+巴博萨 109 nr
+巴卡 2 ns
+巴卡尔 2 nr
+巴卢 29 ns
+巴卢其 16 nr
+巴卢耶 10 nr
+巴厘 45 ns
+巴厘岛 48 ns
+巴厘巴板 2 ns
+巴厘虎 3 nr
+巴县 23 ns
+巴古 17 ns
+巴吉尔米 14 nrt
+巴吉耶 2 nr
+巴吞鲁日 10 ns
+巴哈 52 nrt
+巴哈伊 3 nrt
+巴哈姆 3 nrt
+巴哈尔 6 ns
+巴哈纳 4 ns
+巴哈马 100 ns
+巴哈马籍 2 nr
+巴嘎 3 ns
+巴嘎河 2 ns
+巴嘎班迪 4 ns
+巴固甫 2 nr
+巴国 25 ns
+巴图尔 7 nr
+巴图鲁 2 nr
+巴坚赞 2 nr
+巴坦 3 ns
+巴埃斯 4 nr
+巴基 16 nrt
+巴基斯 7 nr
+巴基斯坦 1238 ns
+巴基斯坦人民党 6 nt
+巴基斯坦伊斯兰共和国 7 ns
+巴基斯坦政府 5 nt
+巴基斯坦穆斯林联盟 2 ns
+巴基耶 3 nr
+巴塔 10 nrt
+巴塔克 3 nr
+巴塔哥尼亚 39 ns
+巴塔戈 2 nr
+巴塔洛 2 nr
+巴塔维 3 nr
+巴塘 17 ns
+巴塘县 3 ns
+巴塞 6 nrt
+巴塞尔 113 nr
+巴塞林 5 ns
+巴塞河 2 ns
+巴塞洛 3 nr
+巴塞罗纳 3 ns
+巴塞罗那 211 ns
+巴塞罗那奥运会 11 ns
+巴塞罗那队 36 nt
+巴塞隆 3 ns
+巴塞隆纳 3 ns
+巴士 142 ns
+巴士底 3 nr
+巴士底狱 17 ns
+巴士拉 49 nrt
+巴士拉省 5 ns
+巴士海峡 28 ns
+巴士点 3 nr
+巴士站 2 nr
+巴士站点 3 n
+巴夏礼 5 nr
+巴多 6 ns
+巴多利奥 8 nrt
+巴多尔 2 nrt
+巴多明 2 nr
+巴天石 189 nr
+巴头探脑 3 l
+巴契亚 16 nrt
+巴契斯 16 nrt
+巴姆 4 nrt
+巴姆城 2 nr
+巴子生 2 nr
+巴富尔 3 nr
+巴尔 78 ns
+巴尔加斯 6 ns
+巴尔勒 3 nrt
+巴尔博亚 8 ns
+巴尔博萨 4 ns
+巴尔卡 3 nrt
+巴尔卡尔 8 nrt
+巴尔古 2 ns
+巴尔喀什 5 ns
+巴尔喀什湖 44 ns
+巴尔塔 2 nrt
+巴尔塔萨 3 nrt
+巴尔多 3 nrt
+巴尔巴 2 ns
+巴尔干 192 ns
+巴尔干半岛 191 ns
+巴尔干地区 21 ns
+巴尔干山 3 ns
+巴尔德 4 nrt
+巴尔德斯 2 nrt
+巴尔扎 7 nrt
+巴尔扎克 54 nrt
+巴尔托 2 nrt
+巴尔托洛 2 nrt
+巴尔斯 8 nrt
+巴尔本 5 ns
+巴尔杜 6 nr
+巴尔杰 2 nr
+巴尔查 3 nr
+巴尔楚 4 nr
+巴尔沃亚 4 ns
+巴尔河 2 ns
+巴尔特 9 nrt
+巴尔狄 3 nr
+巴尔玛 2 nr
+巴尔瑙尔 3 ns
+巴尔登 2 nrt
+巴尔的摩 72 ns
+巴尔的摩市 3 ns
+巴尔米 3 nrt
+巴尔纳斯 2 nrt
+巴尔舍夫斯基 2 nrt
+巴尔萨 2 ns
+巴尔萨斯 6 ns
+巴尔蒙 5 nr
+巴尔虎 3 nr
+巴尔赛 32 nr
+巴尔赞 3 nr
+巴尔赫 8 nr
+巴尔赫姆 5 nrt
+巴尔达 6 nr
+巴尔达斯 2 nrt
+巴尔迪 3 nr
+巴尔迪尼 6 nrt
+巴尔迪维 2 nrt
+巴尔通 3 nr
+巴尔都 4 ns
+巴尔马克 4 nrt
+巴尔默 22 nr
+巴尔齐尼 2 ns
+巴尼亚 3 ns
+巴尼亚斯 2 ns
+巴尼克 14 ns
+巴尼帕 3 nr
+巴尼拔 2 nr
+巴尼河 3 ns
+巴尼特 2 ns
+巴山 136 ns
+巴山中路 3 ns
+巴山夜雨 8 l
+巴山虎 3 nr
+巴山蜀水 8 nr
+巴山越岭 3 ns
+巴山路 3 ns
+巴山雨夜 3 nr
+巴州 15 ns
+巴州区 4 ns
+巴巴 27 ns
+巴巴儿 3 nr
+巴巴劫劫 3 nr
+巴巴多斯 77 nrt
+巴巴多斯岛 3 nrt
+巴巴急急 3 z
+巴巴拉 3 nrt
+巴巴爸爸 3 nr
+巴巴结结 2 nr
+巴巴罗 3 nrt
+巴巴雷 3 nr
+巴布 29 ns
+巴布亚 46 ns
+巴布亚新几内亚 88 ns
+巴布亚新几内亚独立国 3 ns
+巴布尔 5 nr
+巴布延 2 nr
+巴布斯 2 ns
+巴布柯 2 nr
+巴布科夫 3 nrt
+巴布维 2 nr
+巴布豆 3 nr
+巴布达 6 nr
+巴师夏 10 nr
+巴希尔 10 nr
+巴帕尔 2 nr
+巴库 61 ns
+巴彦 4 nr
+巴彦县 2 ns
+巴彦图 2 nr
+巴彦塔拉 2 ns
+巴彦浩特 2 ns
+巴彦浩特镇 4 ns
+巴彦淖 3 nr
+巴彦淖尔 3 ns
+巴彦淖尔盟 23 ns
+巴彦温 2 nr
+巴彦高勒 2 nr
+巴德 60 nrt
+巴德兰 3 nr
+巴德尔 9 nr
+巴德巨 3 nr
+巴德拉 2 nr
+巴德沙 2 nr
+巴德西 4 ns
+巴德诺 13 nr
+巴恩斯 3 nr
+巴悦色 3 nr
+巴戎寺 6 nr
+巴戟天 4 nr
+巴扎 14 nrt
+巴扎罗夫 3 nrt
+巴托 12 nrt
+巴托丽 4 nr
+巴托克 14 nr
+巴托卡 2 nr
+巴托夫 4 nr
+巴托尔 3 nr
+巴托罗 2 nrt
+巴扬科 2 nr
+巴拉 83 nrt
+巴拉克 82 ns
+巴拉兹 3 ns
+巴拉哈斯 3 ns
+巴拉圭 232 ns
+巴拉圭人 7 nr
+巴拉圭河 3 ns
+巴拉圭队 2 nt
+巴拉塔 2 nrt
+巴拉子 2 nr
+巴拉尔 3 ns
+巴拉尼 2 nr
+巴拉巴 2 ns
+巴拉德 4 nrt
+巴拉斯 6 ns
+巴拉望 9 nr
+巴拉望岛 8 ns
+巴拉松 3 nr
+巴拉格尔 6 nrt
+巴拉特 2 nrt
+巴拉维 4 nr
+巴拉蒂 3 nr
+巴拉诺 4 nr
+巴拉诺夫 7 nrt
+巴拉赫 2 nr
+巴拉迪 8 nr
+巴拉那 32 ns
+巴拉那河 54 ns
+巴拉顿 4 ns
+巴拉顿湖 7 ns
+巴拉马 3 ns
+巴拿赫 14 nr
+巴拿马 332 ns
+巴拿马人 4 nz
+巴拿马共 3 nr
+巴拿马共和国 5 ns
+巴拿马地 3 ns
+巴拿马城 28 ns
+巴拿马帽 3 nz
+巴拿马政府 6 nt
+巴拿马运 3 nz
+巴拿马运河 86 ns
+巴掌 424 nr
+巴政府 4 nt
+巴斯 64 ns
+巴斯丁 2 nr
+巴斯克 54 nrt
+巴斯克语 8 nz
+巴斯卡 9 ns
+巴斯基 2 nr
+巴斯夫 4 nr
+巴斯康蒂 4 nr
+巴斯德 48 nrt
+巴斯托 2 nrt
+巴斯湾 2 ns
+巴斯滕 5 nr
+巴斯特尔 12 nrt
+巴斯腾 3 nr
+巴斯蒂 3 nr
+巴斯蒂亚 2 ns
+巴斯蒂安 4 nrt
+巴斯贝 2 nr
+巴斯贝克 4 nrt
+巴新 10 ns
+巴族 3 nz
+巴旦杏 5 nr
+巴昔农 2 nr
+巴昔卡 7 nr
+巴普蒂 16 nr
+巴普蒂斯 11 nrt
+巴朗星 31 nr
+巴望 33 nr
+巴札尔 4 nr
+巴松错 3 nr
+巴林 158 ns
+巴林右旗 6 ns
+巴林国 2 ns
+巴林塘海峡 2 ns
+巴林左旗 11 ns
+巴林站 3 ns
+巴林队 3 nt
+巴枯宁 3 n
+巴柏恩 30 nr
+巴格 11 nrt
+巴格拉 14 nrt
+巴格莱 4 nr
+巴格达 384 nr
+巴格达城 2 ns
+巴格达省 2 ns
+巴格野 2 nr
+巴桑 18 nrt
+巴楚 4 nr
+巴楚县 3 ns
+巴武装 3 nr
+巴比 49 j
+巴比伦 343 ns
+巴比伦王国 36 ns
+巴比合金 3 ns
+巴比妥钠 2 nz
+巴比松 8 nr
+巴比特 3 ns
+巴氏 11 nr
+巴氏合金 3 nr
+巴氏吸管 3 nr
+巴氏奶 3 nr
+巴氏小体 3 nr
+巴氏菌属 3 n
+巴沙 5 ns
+巴沙尔 3 ns
+巴河 24 ns
+巴河镇 2 ns
+巴波亚 3 ns
+巴泰 2 nz
+巴泰凯 4 nr
+巴泽雷克 7 nr
+巴洛 7 ns
+巴洛克 134 nr
+巴洛克式 3 nrt
+巴洛斯 2 ns
+巴洛特 3 nrt
+巴海 2 ns
+巴涅尔 5 nr
+巴渝舞 3 nr
+巴激进 3 nr
+巴燕戎 3 nr
+巴特 67 nrt
+巴特克 4 nr
+巴特兹 13 nr
+巴特农 2 nr
+巴特列 4 ns
+巴特利 5 ns
+巴特勒 68 nr
+巴特基 2 nr
+巴特尔 18 nr
+巴特尔斯 3 nrt
+巴特拉伊 4 nrt
+巴特斯 2 nr
+巴特满 2 nr
+巴特瓦 2 ns
+巴特莱 2 nr
+巴特菲 2 nr
+巴特那 12 ns
+巴特里 3 nrt
+巴瑟斯特 2 nrt
+巴瓦 3 ns
+巴生 5 nr
+巴生河 2 nr
+巴生港 4 ns
+巴甫洛 5 nr
+巴甫洛夫 44 nrt
+巴甫洛娃 3 nr
+巴甫洛达尔 3 nrt
+巴登 32 nrt
+巴登邦 2 nr
+巴监藏 3 nr
+巴盟 2 ns
+巴祖卡 4 nr
+巴符州 9 nr
+巴米 7 nrt
+巴米扬 19 nr
+巴米累克 3 ns
+巴索 2 ns
+巴索夫 17 nr
+巴纳 9 ns
+巴纳尔 4 nr
+巴纳德 18 nr
+巴纳恩 2 nr
+巴纳特 3 nr
+巴纳贝 2 nr
+巴结 226 nr
+巴维克 3 nr
+巴维尔 2 nr
+巴罗 38 nrt
+巴罗克 2 ns
+巴罗克式 8 nrt
+巴罗内 2 ns
+巴罗夫 2 nr
+巴罗斯 3 ns
+巴罗萨 7 ns
+巴耶夫 3 nr
+巴腊贡 5 nr
+巴自治 3 nr
+巴航 3 j
+巴色 3 ns
+巴芬岛 5 ns
+巴芬湾 16 ns
+巴苏 23 ns
+巴茵宫 2 ns
+巴莫 8 nrt
+巴莫尔 2 nrt
+巴莱 2 ns
+巴莱密 2 nr
+巴菲 2 nrt
+巴菲特 37 nrt
+巴萨 86 ns
+巴萨峡 3 ns
+巴萨特 3 nr
+巴萨耶夫 5 nrt
+巴蒂 3 nrt
+巴蒂安 2 nr
+巴蒂尔 3 nr
+巴蒂斯塔 11 nrt
+巴蒂斯特 5 nrt
+巴蓬案 3 nr
+巴藏卜 5 nr
+巴蜀 395 nr
+巴西 1628 ns
+巴西人 49 nrt
+巴西利 5 ns
+巴西利亚 75 ns
+巴西政府 7 nt
+巴西木 21 ns
+巴西站 3 ns
+巴西联邦共和国 4 ns
+巴西议会 2 nt
+巴西队 267 nt
+巴西龟 3 nr
+巴解 33 v
+巴解执委会 2 nt
+巴解组织 77 nt
+巴解组织执委会 2 nt
+巴豆 20 nr
+巴豆霜 3 nr
+巴贝克 5 nrt
+巴贝多 3 nrt
+巴贝夫 12 nr
+巴贝奇 61 nr
+巴赫 105 nr
+巴赫兰 2 nr
+巴赫切 2 nr
+巴赫奇 5 nr
+巴赫拉 4 nr
+巴赫蒂 10 nr
+巴赫金 3 nr
+巴赫马 4 nr
+巴辛 5 nrt
+巴达 10 ns
+巴达律 16 nr
+巴达维 15 nr
+巴达赫 3 nr
+巴达赫尚 2 nrt
+巴迪约 2 ns
+巴郎星 3 nr
+巴郡城 2 nr
+巴郡江 2 nr
+巴里 144 ns
+巴里坤 26 ns
+巴里坤哈萨克自治县 2 ns
+巴里坤湖 13 ns
+巴里奥 2 nrt
+巴里岛 3 ns
+巴里斯 18 nrt
+巴里耶夫 2 nrt
+巴金 88 ns
+巴锡 9 ns
+巴锡谒 3 nr
+巴门尼德 3 ns
+巴陵 9 ns
+巴陵山庄 3 ns
+巴陵郡 8 nr
+巴隆 16 ns
+巴雅 2 ns
+巴雅夫斯基 2 nrt
+巴雅尔图 3 nrt
+巴雅西 2 ns
+巴雷克 2 nr
+巴雷托 5 nr
+巴雷特 4 nr
+巴雾河 2 ns
+巴露丽 2 nr
+巴青 3 nr
+巴青县 3 ns
+巴非特 3 nr
+巴音布 6 nr
+巴音朝鲁 2 ns
+巴音郭 3 nr
+巴音郭楞 5 ns
+巴音郭楞蒙古自治州 14 ns
+巴顿 130 ns
+巴颜喀 5 nr
+巴颜喀喇 3 nr
+巴颜喀拉 13 ns
+巴颜喀拉山 28 ns
+巴颜法师 3 nr
+巴马 67 ns
+巴马州 3 ns
+巴马科 22 nr
+巴高望上 3 ns
+巴高枝儿 3 nr
+巴鲁 36 ns
+巴鲁克 3 nr
+巴鲁耶 4 nr
+巴鲁耶夫 8 nrt
+巴鲁迪 5 nr
+巴黎 3756 ns
+巴黎公社 92 nt
+巴黎凯旋门 4 ns
+巴黎和会 3 nt
+巴黎国民银行 5 nt
+巴黎圣母院 35 ns
+巴黎埃菲尔铁塔 2 ns
+巴黎城 2 ns
+巴黎大学 3 nt
+巴黎市 10 ns
+巴黎市政府 4 nt
+巴黎政治学院 2 nt
+巴黎盆地 3 ns
+巴龙霉素 2 nz
+巵 4 zg
+巶 33 zg
+巷 581 ng
+巷口 125 s
+巷名 3 n
+巷子 165 n
+巷子口 12 n
+巷子深 3 n
+巷尾街头 3 n
+巷弄 7 v
+巷成 3 v
+巷战 190 n
+巷议 3 n
+巷议街谈 3 n
+巷识别 3 n
+巷道 120 n
+巷里 3 s
+巷陌 7 n
+巹 8 zg
+巺 5 zg
+巻 54 zg
+巼 25 zg
+巽 145 g
+巽他 3 ns
+巽他群岛 21 ns
+巾 639 ng
+巾东 3 n
+巾国英雄 3 i
+巾帕 9 n
+巾帼 72 b
+巾帼丈夫 3 i
+巾帼不让须眉 4 l
+巾帼奇才 3 i
+巾帼英雄 34 i
+巾帼豪杰 3 i
+巾帼须眉 3 i
+巿 74 zg
+帀 376 zg
+币 590 n
+币值 95 n
+币制 130 n
+币原 2 n
+币外挂 3 n
+币帛 3 n
+币望 3 n
+币望台 3 n
+币望哨 3 n
+币望塔 3 n
+币种 28 n
+币重言甘 3 nr
+市 40141 n
+市上 3 s
+市不二价 3 n
+市中区 43 n
+市中心 794 n
+市中心区 49 n
+市二中 3 n
+市井 175 n
+市井之徒 13 n
+市井之臣 3 n
+市井小人 11 n
+市井小民 3 n
+市井庸愚 3 i
+市井无赖 13 i
+市井气 2 n
+市亩 3 n
+市人大 19 j
+市价 105 n
+市侩 23 n
+市侩主义 3 n
+市侩气 5 n
+市俗 6 n
+市值 196 n
+市党部 3 n
+市公所 3 n
+市公车 3 n
+市内 796 s
+市内电话 3 n
+市农会 3 n
+市况 15 n
+市况报导 3 n
+市净率 26 n
+市分 3 n
+市制 11 n
+市办 3 n
+市北 39 s
+市北区 4 n
+市区 2460 n
+市升 3 n
+市卒 3 n
+市南 35 s
+市南区 6 n
+市厅级 3 b
+市厘 3 n
+市县 283 n
+市口 21 n
+市名 6 n
+市图书馆 3 n
+市地 11 n
+市场 26927 n
+市场主体 3 n
+市场价 29 n
+市场份额 3 n
+市场供应 3 n
+市场准入 60 n
+市场分析家 4 n
+市场前景 3 n
+市场动态 3 n
+市场化 383 n
+市场占有率 144 n
+市场原油 3 n
+市场商情 3 n
+市场学 8 n
+市场导向 3 n
+市场开发部 2 n
+市场总监 3 n
+市场报 30 n
+市场推广 3 n
+市场机制 3 n
+市场潜力 3 n
+市场疲软 3 i
+市场监管 3 n
+市场秩序 3 nr
+市场竞争 3 l
+市场策划 3 n
+市场策略 3 n
+市场管理费 3 n
+市场繁荣 3 n
+市场经济 1846 n
+市场萎缩 3 n
+市场营销 3 n
+市场营销部 6 n
+市场行情 3 n
+市场观 3 n
+市场规律 3 n
+市场调研 3 n
+市场调节 3 n
+市场走势 3 n
+市场趋势 3 n
+市场运作 3 n
+市场部 145 n
+市场需求 3 n
+市场预测 3 l
+市域规划 3 n
+市声 3 n
+市外 14 s
+市妇联 3 n
+市委 1964 n
+市委书记 3 n
+市委党校 3 n
+市委常委 3 n
+市容 530 n
+市容整洁 3 l
+市容管理 3 n
+市寸 3 n
+市尺 3 n
+市局 6 n
+市属 112 n
+市川 4 n
+市工商局 3 n
+市布 6 n
+市府 43 n
+市府办 3 n
+市府大楼 3 n
+市廛 42 n
+市建委 3 n
+市徽 3 n
+市情 6 n
+市报 2 n
+市招 33 n
+市政 630 n
+市政中心 3 n
+市政协 52 j
+市政厅 152 n
+市政局 2 n
+市政工程 3 n
+市政府 1259 n
+市政府办 3 n
+市政建设 3 l
+市政当局 3 n
+市政报告 3 n
+市政管理 3 n
+市政路 3 n
+市政道路 3 n
+市教委 3 n
+市数 3 n
+市斤 20 n
+市无二价 3 n
+市易 21 n
+市易法 15 n
+市村 2 n
+市树 3 n
+市民 3506 n
+市民住宅 3 n
+市民化 2 n
+市民心声 3 n
+市民意识 3 n
+市民文学 7 n
+市消委会 3 n
+市灯泡厂 3 n
+市用制 2 n
+市电 6 n
+市盈率 108 n
+市直 31 n
+市直机关 3 n
+市石 6 n
+市立 56 v
+市立疗养 3 n
+市管县 3 n
+市级 667 n
+市编委 3 n
+市肆 30 n
+市舶司 58 n
+市花 34 n
+市营 3 n
+市营公车 3 n
+市行 3 n
+市街图 3 n
+市议会 3 n
+市议员 3 n
+市话 55 n
+市话局 4 n
+市话网 3 n
+市话费 4 n
+市话通 3 n
+市貌 4 n
+市贾 3 n
+市赢率 2 n
+市辖区 1061 n
+市运 3 n
+市运会 3 n
+市道 12 n
+市道之交 3 l
+市道小人 3 n
+市郊 261 s
+市郊区 3 s
+市里 442 s
+市镇 484 n
+市长 8782 n
+市际 3 n
+市际交通 3 n
+市集 94 n
+市面 141 n
+市面上 3 n
+布 4827 nr
+布丁 14 nr
+布下 77 n
+布丰 4 nz
+布丽雅 3 nr
+布二司 2 nr
+布什 708 nrt
+布什主义 3 nz
+布什尔 8 nrt
+布什总统 3 l
+布仑斯 4 ns
+布代尔 2 nr
+布伞 5 nr
+布伦丹 2 nr
+布伦坦 3 nr
+布伦坦诺 6 nrt
+布伦塔诺 8 nr
+布伦奇 2 nr
+布伦希 2 nr
+布伦托 11 nr
+布伦斯 4 nr
+布伦斯维 2 nr
+布伦特 32 nr
+布伦特兰 3 ns
+布伦纳 10 nr
+布伦达 2 nr
+布依 128 nr
+布依弹 2 nr
+布依族 600 nr
+布依语 5 nr
+布偶 3 n
+布偶戏 3 n
+布儒斯 18 nr
+布克 6 nrt
+布克奖 2 nz
+布克斯顿 2 nrt
+布克萨尔 2 nrt
+布克赛 9 nr
+布兰 8 ns
+布兰代 2 nr
+布兰代斯 2 nz
+布兰克 3 nr
+布兰卡 7 nr
+布兰卡港 2 ns
+布兰塔斯 2 nrt
+布兰夏 2 nr
+布兰太尔 5 nrt
+布兰妮 3 nrt
+布兰尼 3 nr
+布兰布尔 7 nrt
+布兰德 104 nr
+布兰敦 3 ns
+布兰森 4 nr
+布兰特 9 nr
+布兰登 3 nr
+布兰科 3 nr
+布兰肯堡 2 nrt
+布兰达 3 nr
+布兰迪斯 2 nrt
+布兹嘎 3 nr
+布冉利 2 nr
+布军裤 2 nr
+布农族 3 nz
+布切斯 9 nr
+布列 28 ns
+布列亚 3 nr
+布列兹 3 nr
+布列兹涅 3 nrt
+布列坦 4 nr
+布列塔尼 44 nrt
+布列斯 2 nr
+布列斯特 27 nrt
+布利 34 ns
+布利亚 3 ns
+布利克斯 4 nrt
+布利塔 2 nr
+布利斯 9 nr
+布利达 2 nr
+布制 4 n
+布加勒斯 3 ns
+布加勒斯特 76 nrt
+布加迪 3 nr
+布努艾尔 11 nr
+布努语 3 nr
+布劳威尔 7 nrt
+布劳德 3 nr
+布劳恩 40 nr
+布势 6 n
+布勃诺 4 nr
+布勒 7 nrt
+布勒伊拉 3 nrt
+布勒尼 2 nr
+布勒斯 5 nr
+布包 75 n
+布匹 122 n
+布卡武 3 nr
+布卢嗣 16 nr
+布卢姆 5 nr
+布卢尔 2 nr
+布卢斯 2 nr
+布卢明 2 nr
+布卢瓦 3 nr
+布厂 8 n
+布发源 2 nr
+布可擒 2 nr
+布史馁 2 i
+布吉镇 3 nr
+布吕克 5 nr
+布吕克纳 3 nrt
+布吕宁 8 nr
+布吕尔 8 nr
+布吕恩 5 nr
+布吕歇尔 5 nr
+布吕赫 2 nr
+布吕默尔 2 nrt
+布告 117 n
+布告板 3 n
+布告栏 4 n
+布告牌 2 n
+布告窗 3 n
+布哈尔 2 nr
+布哈拉 53 nrt
+布哈林 26 nr
+布哈河 8 ns
+布哈里 8 nrt
+布商 3 n
+布商麇 3 nr
+布喇顿 8 nr
+布囊 5 n
+布坎南 15 nr
+布坦 9 ns
+布埃尔 3 nr
+布基纳 5 nr
+布基纳法索 85 nrt
+布塞纳 2 nr
+布塞进 2 nr
+布多夫 2 nrt
+布大喜 2 nr
+布大怒 2 nr
+布天盖地 3 n
+布头 16 n
+布套 7 nz
+布姆 2 nrt
+布姆松 16 nr
+布娃娃 8 nr
+布宜若 3 nr
+布宜诺 2 nr
+布宜诺斯 3 nr
+布宜诺斯艾利斯 135 ns
+布宜诺斯艾利斯市 2 ns
+布宜诺斯艾利斯省 6 ns
+布察克 3 nr
+布尊丹 52 nr
+布尔 281 nr
+布尔乔亚 9 nrt
+布尔人 65 nrt
+布尔什维 3 nrt
+布尔什维主义 14 nz
+布尔什维克 177 nrt
+布尔代数 22 nz
+布尔值 3 nr
+布尔加宁 15 ns
+布尔加斯 2 nrt
+布尔加科夫 4 nrt
+布尔吉巴 3 nrt
+布尔吉斯 3 nrt
+布尔塞维克 5 nrt
+布尔干 2 nr
+布尔戈斯 5 nrt
+布尔斯 3 nr
+布尔方法 3 nr
+布尔方程 3 nr
+布尔日 3 nrt
+布尔津 17 nr
+布尔津县 6 ns
+布尔热 4 nrt
+布尔环 3 nr
+布尔萨 14 nr
+布尔规划 3 nz
+布尔诺 15 nr
+布尔运算 3 nr
+布尔金 2 nr
+布尼亚 2 ns
+布尼兹 17 nr
+布尼奥 2 nr
+布尼奥罗 2 nrt
+布尼茨 50 nrt
+布局 2340 n
+布局合理 7 n
+布局调整 4 l
+布局谋篇 2 n
+布居反转 3 l
+布巴 7 nrt
+布市 13 ns
+布帆无恙 3 i
+布希总统 3 nr
+布希曼 10 nr
+布帘 20 n
+布帛 45 nr
+布帛菽粟 3 nr
+布带 23 n
+布帽 3 n
+布干维尔 15 ns
+布干维尔岛 5 ns
+布店 17 ns
+布式 2 n
+布律内尔 5 ns
+布思端 2 nr
+布思麻 2 nr
+布恩地 2 nrt
+布恩坎普 10 nrt
+布恩施德 3 nr
+布手套 3 nz
+布托 93 nrt
+布扣 3 n
+布拉 145 nrt
+布拉什 2 nrt
+布拉克 14 nr
+布拉加 6 nr
+布拉吉 3 nr
+布拉图西 3 nrt
+布拉姆斯 9 nrt
+布拉希 2 nr
+布拉干 2 nr
+布拉德 7 nr
+布拉德利 4 nrt
+布拉戈维申斯克 2 nrt
+布拉托夫 2 nrt
+布拉拉 2 nrt
+布拉斯 15 nr
+布拉杰 4 nr
+布拉柴维 3 ns
+布拉柴维尔 16 ns
+布拉格 309 nrt
+布拉格堡 16 nrt
+布拉格宫 2 ns
+布拉格角 3 nrt
+布拉汗 3 nr
+布拉沃 29 nr
+布拉港 2 ns
+布拉灰 3 nr
+布拉特 5 nrt
+布拉班特 3 ns
+布拉瓦 32 nrt
+布拉瓦约 11 ns
+布拉索夫 6 nrt
+布拉维 7 nr
+布拉茨克 7 nrt
+布拉莫 7 nr
+布拉藻 2 nr
+布拉藻斯卡斯 2 ns
+布拉西 3 ns
+布拉赫 2 nr
+布拉迪 4 nr
+布拉迪斯拉发 23 nrt
+布拉顿 9 nr
+布拉马普特拉河 43 nrt
+布拖 3 nr
+布拖县 6 nr
+布控 6 v
+布撒 9 nrt
+布放 13 v
+布政使 922 nr
+布政分 2 n
+布政史 7 nr
+布政司 74 n
+布敦 3 ns
+布料 81 n
+布斯 8 nrt
+布斯塔尼 2 nrt
+布斯塔曼特 5 nrt
+布施 100 n
+布时明 2 nr
+布景 115 n
+布智儿 2 nr
+布朗 958 nr
+布朗克 7 nr
+布朗利 2 nr
+布朗基 3 nr
+布朗宁 3 nr
+布朗库 3 nr
+布朗族 36 nz
+布朗温 2 nr
+布朗热 12 nrt
+布朗特 2 nrt
+布朗维奇 6 nrt
+布朗运动 34 nz
+布机 17 n
+布条 148 n
+布来乌 2 nr
+布松公 3 nr
+布林克 3 nr
+布林斯 3 nr
+布林耶 2 nr
+布林莫尔 2 nrt
+布林迪西 4 nrt
+布查楠 2 nr
+布样儿 2 nr
+布格 5 n
+布格勒 3 nr
+布格异常 3 nr
+布格校正 3 nr
+布格河 8 nr
+布梏 3 n
+布榖鸟 3 v
+布樐 3 vn
+布歇赫尔 2 nr
+布氏漏斗 3 n
+布氏菌素 3 nz
+布水谷 3 nr
+布江达 3 nr
+布江达县 3 ns
+布法罗 27 nr
+布洛克 7 nr
+布洛姆 6 nr
+布洛姆斯 5 nrt
+布洛斯 3 nr
+布洛涅 5 nr
+布洛芬 9 nr
+布洛西 15 nr
+布洛诺夫 4 nrt
+布洛赫 21 nr
+布洛金 4 nr
+布洛阿 2 nr
+布渣叶 3 nr
+布满 664 nr
+布满星星 3 nr
+布点 28 n
+布热津斯基 4 nz
+布然斯 5 nr
+布片 42 n
+布特 12 nrt
+布特列 2 nr
+布特哈 4 nrt
+布特尔斯卡娅 3 nrt
+布特莱齐 5 nrt
+布率兵 6 nr
+布珠尔 2 nr
+布琼尼 13 nr
+布琼布拉 14 nr
+布瑞特 3 nr
+布瓦 4 nrt
+布瓦兹 3 nr
+布瓦凯 3 nr
+布瓦博 5 nr
+布瓦洛 13 nr
+布瓦耶 6 nr
+布留尔 3 nr
+布留洛 2 nr
+布痕 5 n
+布登勃 6 nr
+布票 21 n
+布科维纳 3 nrt
+布税议 2 n
+布立凯 4 nr
+布篷 16 n
+布素鲁 6 nr
+布索加 3 nr
+布约亚 3 ns
+布纹 4 nr
+布纹纸 3 n
+布线 36 n
+布线图 3 nr
+布线程序 3 n
+布绢 2 nrt
+布罗 3 nrt
+布罗伊尔 8 nrt
+布罗克 11 nr
+布罗克豪 3 nr
+布罗兹 2 nr
+布罗加 8 nr
+布罗卡 3 nr
+布罗卡区 3 ns
+布罗基 7 nr
+布罗德 8 nr
+布罗德赫斯特 2 nrt
+布罗意 33 nr
+布罗沃 2 nr
+布罗沃尔 5 nrt
+布罗肯 4 nr
+布罗迪 3 nr
+布罩 4 n
+布置 2292 n
+布置任务 3 n
+布置图 8 nr
+布署 2 v
+布老虎 6 nr
+布腊斯 2 nr
+布腊瓦 6 nr
+布良斯克 5 nr
+布艺店 3 n
+布艺沙发 3 nr
+布苏 8 ns
+布苏泡 2 nr
+布莱克 64 nr
+布莱克斯 7 nrt
+布莱克本 33 ns
+布莱兹 6 nr
+布莱尔 97 nr
+布莱尔港 5 ns
+布莱布 2 nr
+布莱希 39 nr
+布莱希特 2 nrt
+布莱得 9 nr
+布莱德 4 nr
+布莱德利 3 nrt
+布莱德雷 18 nr
+布莱恩 51 nr
+布莱恩特 3 nrt
+布莱斯 9 nr
+布莱斯坦 2 nrt
+布莱曼 3 nr
+布莱松 4 nr
+布莱格堡 3 nrt
+布莱梅 16 nr
+布莱汉姆 2 nrt
+布莱泽顿 2 nr
+布莱特 5 nr
+布莱科尔 2 nrt
+布莱辛 2 nr
+布莱里 3 nrt
+布莱顿 6 nr
+布菜 3 n
+布蒂尔斯卡娅 3 nrt
+布行 2 v
+布衣 168 n
+布衣之交 3 nr
+布衣卿相 3 nr
+布衣知县 3 nr
+布衣粝食 3 vn
+布衣蔬食 3 nz
+布衣裤 2 n
+布衣雄世 3 nr
+布衣韦带 3 nr
+布衣黔首 3 nr
+布衫 11 nr
+布袋 339 n
+布袋中 23 nrt
+布袋子 2 n
+布袋戏 3 n
+布袋装 3 n
+布袋镇 3 nrt
+布袜青鞋 3 n
+布被瓦器 3 nr
+布裙 3 nr
+布裙荆钗 3 nr
+布褂 3 n
+布西 4 ns
+布西亚 2 ns
+布见卓 2 nr
+布设 133 v
+布谢 3 nrt
+布谷 12 nr
+布谷鸟 28 nr
+布贴 3 n
+布赖 9 v
+布赖恩 21 nr
+布赖斯 3 nr
+布赖特 14 nr
+布赫塔尔 3 nrt
+布赫尔 2 nr
+布赵复 2 nr
+布转印 2 nr
+布达佩斯 130 nr
+布达利 2 nr
+布达尔 3 nr
+布达山 2 nr
+布达式 3 nr
+布达拉 3 nrt
+布达拉宫 89 ns
+布迈丁 10 nr
+布连斯 2 nr
+布迪厄 3 nrt
+布逊湖 3 nr
+布道 74 v
+布道台 3 nr
+布道大会 3 nr
+布道者 3 nr
+布都有 3 nr
+布里 134 nrt
+布里亚 3 nrt
+布里亚特 15 nrt
+布里克 3 nrt
+布里坦 2 nrt
+布里奇 31 nr
+布里奇敦 11 nrt
+布里奇斯 2 nrt
+布里奇曼 14 nrt
+布里奇顿 3 nrt
+布里奥 6 nrt
+布里安 17 nr
+布里尔顿 2 nrt
+布里恩 3 nr
+布里斯 4 nrt
+布里斯托 4 nrt
+布里斯托尔 19 nrt
+布里斯班 38 nrt
+布里昂 6 nr
+布里格 3 nrt
+布里格斯 2 nrt
+布里渊 5 nr
+布里特 4 nrt
+布里索 6 nr
+布里维 2 nr
+布里耶 2 nr
+布里顿 4 nrt
+布金 7 n
+布金寺 10 nr
+布镇集 2 nr
+布防 76 n
+布阵 133 nr
+布阿吉 5 nr
+布阿朗 2 nr
+布隆吉 3 nr
+布隆方丹 8 nr
+布隆迪 109 nr
+布隆迪共和国 2 ns
+布隆迪政府 2 nt
+布雪勒 5 nr
+布雷 313 nr
+布雷克 7 nr
+布雷区 4 nr
+布雷器 5 nr
+布雷德 9 nr
+布雷拉 5 nrt
+布雷斯 47 nr
+布雷斯特 10 nrt
+布雷特 3 nr
+布雷舰 20 nr
+布雷艇 3 nr
+布雷菲 3 nr
+布雷西亚 5 nrt
+布雷西亚诺 11 nrt
+布雷诺 3 nr
+布雷达 6 nr
+布雷队 3 nr
+布雷顿 29 nr
+布雷默 3 nr
+布青举 2 nr
+布青怒 2 nr
+布青见 3 nr
+布面 30 n
+布鞋 116 n
+布韦希 11 nr
+布韦群岛 3 ns
+布须曼 63 nr
+布颿无恙 3 n
+布饶尔 4 nr
+布马尔 3 nr
+布鲁克 39 nr
+布鲁克内尔 2 nrt
+布鲁克斯 67 nrt
+布鲁克林 25 nr
+布鲁克纳 4 nrt
+布鲁内 7 nr
+布鲁图 7 nr
+布鲁塞尔 264 ns
+布鲁塞尔市 6 ns
+布鲁姆 13 nr
+布鲁尼 2 nr
+布鲁库 2 nr
+布鲁提 3 nr
+布鲁斯 100 nr
+布鲁斯南 3 ns
+布鲁日 7 nrt
+布鲁明 2 nr
+布鲁木 3 nr
+布鲁查加 2 nrt
+布鲁根 3 nr
+布鲁格曼 2 nr
+布鲁氏菌 3 nr
+布鲁特 15 nr
+布鲁纳 5 nr
+布鲁西洛夫 2 nrt
+布鲁诺 29 nr
+布鲁赫 8 nr
+布鲁金斯 16 nr
+布鲁顿 2 nr
+布鲁默 5 nr
+布鼓雷门 3 ns
+布齐沙 2 nr
+布龙纳 2 nr
+布龙菲 5 nr
+帅 795 nr
+帅井木 2 nr
+帅位 20 n
+帅佩雷 2 nr
+帅化民 4 nr
+帅印 12 nr
+帅吉姆 2 nr
+帅呆了 3 nr
+帅哥 66 nr
+帅哥哥 3 nr
+帅哥美女 3 nr
+帅字旗 10 nr
+帅守御 2 nr
+帅察罕 3 nr
+帅小伙 3 nr
+帅府园 2 nr
+帅府太 4 nr
+帅徐弘 4 nr
+帅恩典 3 nr
+帅才 10 nr
+帅朝林 2 nr
+帅标营 2 nr
+帅步骑 2 nr
+帅气 66 n
+帅汤和 2 nr
+帅王宗 3 nr
+帅臣亦 2 nr
+帅诸羌 2 nr
+帅高俅 2 nr
+帆 538 n
+帆具 3 n
+帆布 113 n
+帆布包 3 n
+帆布床 3 n
+帆布椅 3 n
+帆布背包 3 n
+帆布袋 3 n
+帆布鞋 3 n
+帆张网 3 n
+帆影 17 n
+帆拱 3 n
+帆杆 3 n
+帆板 39 n
+帆桅 3 n
+帆樯 5 n
+帆篷 3 n
+帆脚索 3 n
+帆船 336 n
+帆船赛 2 n
+帇 178 zg
+师 12194 ng
+师一徒 2 nr
+师一旅 2 nr
+师丁启 7 nr
+师丈 3 n
+师与潇 4 nr
+师专 70 nr
+师专生 3 nr
+师丘师 2 nr
+师东伐 3 nr
+师严道尊 3 nr
+师丹曾 2 nr
+师久无 6 nr
+师之礼 4 nr
+师之议 2 nr
+师事 50 n
+师事儒 3 nr
+师事子 2 n
+师事广 2 nr
+师事玄 2 nr
+师事章 3 nr
+师事荀 2 nr
+师于吉 2 nr
+师亦择 2 nr
+师亦罢 3 nr
+师从 126 n
+师伐楚 2 nr
+师伐魏 4 nr
+师传 5 nr
+师传徒 3 nr
+师传悟 2 nr
+师伯之 3 nr
+师伯们 3 n
+师伯俞 2 nr
+师伯剑 2 nr
+师伯叔 34 nr
+师伯师 24 nr
+师伯教 2 nr
+师伯李 3 nr
+师伯求 2 nr
+师伯言 4 nr
+师侄 3 n
+师保罗 2 nr
+师傅 1976 nr
+师傅领进门 6 nr
+师允可 2 nr
+师兄 1700 nr
+师兄弟 378 nr
+师克陕 2 nr
+师全军 2 nr
+师全师 2 nr
+师八思 2 nr
+师公 44 nr
+师其故智 3 nr
+师出为壮 3 i
+师出无名 5 i
+师出有名 7 n
+师刘军 2 nr
+师刘斌 2 nr
+师刘歆 2 nr
+师勤王 4 nr
+师北征 9 nr
+师半友 3 n
+师南征 4 nr
+师厚恩 2 nr
+师友 36 n
+师双眉 2 nr
+师叔中 2 nr
+师叔之 3 nr
+师叔你 3 nr
+师叔便 2 nr
+师叔同 3 nr
+师叔周 3 nr
+师叔妙 2 nr
+师叔张 2 nr
+师叔戚 2 nr
+师叔授 2 nr
+师叔本 2 nr
+师叔死 2 nr
+师叔申 2 nr
+师叔相 2 nr
+师叔祖之 2 nr
+师叔祖助 2 nr
+师叔莫 2 nr
+师叔见 3 nr
+师叔言 5 nr
+师叙功 2 nr
+师古 8 nr
+师古藏 2 nr
+师叶建 3 nr
+师吉星 2 nr
+师向敏 2 nr
+师吕伯 2 nr
+师周庆 2 nr
+师命 5 n
+师命难违 3 i
+师哥 1443 nr
+师回浦 2 nr
+师团 570 n
+师团职 3 n
+师大 318 j
+师大分部 3 n
+师大路 3 nr
+师大附中 3 nr
+师太举 4 nr
+师太全 2 nr
+师太剑 4 nr
+师太发 2 nr
+师太叹 2 nr
+师太命 2 nr
+师太实 2 nr
+师太微微 9 nr
+师太心 2 nr
+师太怒 10 nr
+师太明 2 nr
+师太朗 2 nr
+师太见 2 nr
+师太言 2 nr
+师太赐 2 nr
+师太连 2 nr
+师夷智 4 nr
+师夷长 13 nr
+师奶 3 n
+师妹 1351 n
+师姊丁 2 nr
+师姊勾 3 nr
+师姊可 2 nr
+师姊如 2 nr
+师姊定 5 nr
+师姊引 2 nr
+师姊心 2 nr
+师姊才 2 nr
+师姊掌 2 nr
+师姊李 3 nr
+师姊洪 2 nr
+师姊薛 3 nr
+师姊赤 2 nr
+师姐 70 nr
+师姚广 2 nr
+师娘 502 nr
+师子 3 n
+师孙承 2 nr
+师学 3 n
+师学艺 8 nr
+师守御 2 nr
+师安永 2 nr
+师宗 3 nr
+师宗县 3 nr
+师定 2 n
+师实 2 n
+师实兵 45 nr
+师尊 71 nr
+师小红 3 nr
+师尚父 2 nr
+师师 271 n
+师师之 2 nr
+师师可 2 nr
+师师如 2 nr
+师师爹 3 nr
+师师长 3 nr
+师弟 1095 n
+师弟妹 9 nr
+师张僧 4 nr
+师张宇 2 nr
+师张琼 2 nr
+师张真人 2 nr
+师张茜 2 nr
+师归周 3 nr
+师彦英 2 nr
+师徒 685 n
+师徒俩 3 n
+师徒关系 3 l
+师徒合同 3 nr
+师微微 6 nr
+师心念 2 n
+师心自是 3 i
+师心自用 3 nr
+师必缺 4 nr
+师忠义 2 nr
+师怪 2 n
+师恩 36 nr
+师战鹰 2 nr
+师才会 16 nr
+师承 177 nr
+师技匠 16 n
+师授 4 n
+师授心 3 nr
+师掌力 2 nr
+师提姆 2 nr
+师援襄 3 nr
+师攻鄂 2 nr
+师政委 4 nr
+师文工 2 nr
+师斯蒂 2 nr
+师旅 3 n
+师旅团 5 n
+师昌绪 3 nr
+师朱岳 2 nr
+师李攀 2 nr
+师李晋 2 nr
+师杜晓 2 nr
+师杨嗣 3 nr
+师杨廷 2 nr
+师杰弗 2 nr
+师查尔 2 nr
+师母 559 nr
+师氏虎 6 nr
+师河区 3 n
+师法 186 n
+师波波 2 nr
+师洪向阳 11 nr
+师淮扬 2 nr
+师渡江 3 nr
+师源型 2 n
+师父 8468 n
+师爷 234 nr
+师玉阳 2 nr
+师玛丽 3 nr
+师生 634 nr
+师生关系 3 n
+师生员工 20 n
+师生恋 3 nr
+师生比 3 j
+师田宏 2 nr
+师由龙 3 nr
+师略 2 n
+师白智 2 nr
+师白法 2 n
+师直为壮 3 i
+师真长老 2 nr
+师祖最 2 nr
+师祖木 2 nr
+师祖林 2 nr
+师祖爷 23 nr
+师祖知 2 nr
+师祖身 2 nr
+师祖金 2 nr
+师秦洪 2 nr
+师级 32 n
+师罗真人 5 nr
+师老兵疲 3 i
+师老兵破 3 nr
+师老北 2 nr
+师者 16 n
+师职 14 n
+师范 981 nr
+师范代 3 n
+师范大学 438 n
+师范学校 231 n
+师范学院 1191 n
+师范教育 3 n
+师范毕业 3 nr
+师范生 11 nr
+师范类 3 n
+师范院校 3 n
+师董晓 4 nr
+师蓝瑛 2 nr
+师蓟辽 8 nr
+师表 3 n
+师袁公 2 nr
+师袁崇 8 nr
+师西归 3 nr
+师西征 2 nr
+师见杨 2 nr
+师觉远 3 nr
+师训 8 n
+师许国 2 nr
+师证 2 j
+师谢伟 2 nr
+师费尔 2 nr
+师资 362 n
+师资格 3 n
+师资队伍 3 n
+师赵季 2 nr
+师辅臣 40 nr
+师迈克 3 nr
+师远征 2 nr
+师逆谋 2 nr
+师道 3 n
+师道尊严 6 nr
+师道遵 2 nr
+师道默 2 nr
+师邓元 5 nr
+师邓太 2 nr
+师邓宏 3 nr
+师部 129 n
+师金轮 2 n
+师长 1172 n
+师门 203 n
+师门亲 2 n
+师阐化 5 nr
+师阿骏 2 nr
+师陈里 2 nr
+师院 138 n
+师院实小 3 n
+师韩永 2 nr
+师颜真 2 nr
+师黄木 3 nr
+帉 62 zg
+希 1458 v
+希丁 2 nrt
+希丁克 3 nr
+希世之宝 3 nz
+希世之才 3 nr
+希世之珍 6 nr
+希亚 48 ns
+希仁 6 nr
+希伯伦 8 nr
+希伯来 23 nr
+希伯来人 24 nz
+希伯来文 15 nz
+希伯来语 32 nz
+希伯莱 15 nr
+希伯莱文 3 nz
+希伯莱语 5 nz
+希俄斯 3 ns
+希克 5 nrt
+希克斯 10 nr
+希克迈特 3 nrt
+希冀 120 nr
+希利 3 ns
+希勒 17 nrt
+希区柯克 3 nz
+希南 2 ns
+希卡 3 ns
+希嘘 3 v
+希图 59 v
+希基 2 nrt
+希夏邦 2 nr
+希夏邦玛 3 nrt
+希夏邦马峰 15 ns
+希夷 5 ns
+希奇 183 nr
+希奇古怪 85 nz
+希姆 11 nrt
+希姆莱 3 nr
+希宁 2 ns
+希安 4 ns
+希少 3 v
+希尔 93 nrt
+希尔伯 12 nr
+希尔伯特 98 nrt
+希尔德 7 nrt
+希尔斯 10 nrt
+希尔特 3 nrt
+希尔顿 36 nrt
+希尔顿酒店 6 ns
+希尔顿饭店 2 ns
+希德 20 nrt
+希思罗 10 nr
+希思黎 3 nr
+希托夫 5 nr
+希拉 21 nrt
+希拉克 77 nrt
+希拉勒 2 nrt
+希拉尔 3 nr
+希拉里 14 nrt
+希摩斯 10 nr
+希斯 7 ns
+希斯洛普 2 nrt
+希斯罗 4 nrt
+希族 3 nz
+希旨承颜 3 nr
+希曼 3 nrt
+希有 7 v
+希望 12597 v
+希望工程 57 l
+希望无穷 3 i
+希望杯 3 nr
+希望綦切 3 z
+希格 2 nrt
+希格玛 3 nr
+希求 64 v
+希法亭 3 nr
+希波 34 ns
+希洪 4 nr
+希海文天 3 nz
+希特 26 nrt
+希特勒 794 nr
+希特勒法西斯 5 ns
+希玛 13 nrt
+希瑟 4 nrt
+希瓦 14 ns
+希盼 3 v
+希米 2 nrt
+希纳 3 ns
+希罕 154 nrt
+希罗 11 nrt
+希罗多德 53 nrt
+希腊 2565 ns
+希腊人 520 nz
+希腊共产党 10 nt
+希腊共和国 2 ns
+希腊化 3 nz
+希腊半岛 3 ns
+希腊字 2 nz
+希腊字母 13 nz
+希腊式 12 nz
+希腊政府 28 nt
+希腊文 97 nz
+希腊族 5 nz
+希腊神话 3 l
+希腊籍 3 nr
+希腊话 3 l
+希腊语 126 nz
+希腊队 2 nt
+希萨诺 4 nr
+希西 2 ns
+希逢 2 v
+希金斯 3 nr
+希钦斯 2 nr
+希门尼斯 8 ns
+帍 11 zg
+帎 9 zg
+帏 45 n
+帏幕 5 n
+帏箔不修 3 n
+帏薄不修 3 n
+帐 3376 q
+帐册 10 n
+帐务 3 n
+帐单 3 n
+帐号 39 n
+帐号密码 3 n
+帐头 3 n
+帐子 154 n
+帐幔 19 n
+帐幕 65 n
+帐户 110 n
+帐户卡 56 n
+帐户名 3 n
+帐房 78 n
+帐房先生 3 n
+帐棚 3 n
+帐檐 3 n
+帐目 84 n
+帐目表 3 n
+帐篷 740 n
+帐簿 3 n
+帐籍 3 n
+帐蓬 6 n
+帐钩 3 n
+帐面 24 n
+帐面价值 3 n
+帐额 3 n
+帑 71 g
+帓 57 zg
+帔 24 g
+帕 669 nr
+帕丽斯 3 nr
+帕伊乃 4 nr
+帕伊雷 8 nr
+帕伦克 2 nr
+帕佩克 2 nr
+帕克中 2 nr
+帕克圈 2 nr
+帕克抢 3 nr
+帕克断 2 nr
+帕克斯 7 nr
+帕克森 2 nr
+帕克第 4 nr
+帕克跳 13 nr
+帕克飞 2 nr
+帕兴承 3 nr
+帕其尼 2 nr
+帕内蒂 3 nr
+帕利基尔 2 nrt
+帕利塞 2 nr
+帕利梅 4 nr
+帕加马 7 ns
+帕努伊 8 nr
+帕努奇 4 nr
+帕劳 9 nr
+帕勒莫 20 nr
+帕博罗 2 nr
+帕卡德 2 nr
+帕卡琳娜 6 nr
+帕吉勒 2 nr
+帕吉特 3 nr
+帕哈尔 3 nr
+帕图斯 7 nr
+帕埃尔 2 nr
+帕埃斯 4 nr
+帕塔亚 12 nr
+帕塔克森 5 nr
+帕塔塞 5 nr
+帕多 5 nrt
+帕多瓦 27 nrt
+帕夫利 2 nr
+帕夫雷 2 nr
+帕夸奇 2 nr
+帕奇克 6 nr
+帕契姆 3 nr
+帕姆帕斯 2 nrt
+帕姆格伦 2 nr
+帕子 49 nr
+帕子卷 2 nr
+帕子抹 2 nr
+帕子揩 3 nr
+帕子放 2 nr
+帕子甚 3 nr
+帕子蒙 3 nr
+帕尔亚马 3 nrt
+帕尔哈 3 nrt
+帕尔多 5 nrt
+帕尔姆岛 2 nrt
+帕尔尼 2 nr
+帕尔巴 2 nr
+帕尔提 2 nr
+帕尔斯 3 nr
+帕尔旺 4 nr
+帕尔曼 3 nr
+帕尔格雷 2 nrt
+帕尔梅 6 nr
+帕尔特 3 nr
+帕尔玛 70 nr
+帕尔玛队 2 nr
+帕尔米 2 nrt
+帕尔纳斯 17 nrt
+帕尔莫 8 nr
+帕尔门 4 nr
+帕尔马 104 nr
+帕尔马斯 2 nrt
+帕尔默 11 nr
+帕尼奥尔 2 nrt
+帕尼巴 3 nr
+帕尼齐 2 nr
+帕巴拉 3 nrt
+帕帕佐普洛斯 4 nrt
+帕帕雷斯 3 nrt
+帕彼曼 6 nr
+帕德方程 3 nr
+帕德湾 2 nr
+帕恰斯 7 nr
+帕托尼 3 nr
+帕拉 40 nrt
+帕拉丁 3 nr
+帕拉伊 3 nr
+帕拉南 2 ns
+帕拉图 3 nr
+帕拉帕 2 nr
+帕拉库 3 nr
+帕拉斯 20 nr
+帕拉河 5 nr
+帕拉瓦 7 nr
+帕拉蒂 2 nr
+帕拉西奥 3 nrt
+帕拉迪 6 nr
+帕拉马 4 nr
+帕拉马里博 6 nrt
+帕提亚 58 nr
+帕提农 3 nr
+帕斯 3 nr
+帕斯卡 99 nr
+帕斯卡尔 3 nrt
+帕斯夸尔 4 nr
+帕斯奎尔 3 nrt
+帕斯捷尔纳克 9 nrt
+帕斯科 9 nr
+帕日格 16 nr
+帕普斯 17 nr
+帕木竹 9 nr
+帕杰罗 3 nr
+帕果帕果 8 nr
+帕格尼尼 17 nrt
+帕梅拉 2 nr
+帕森斯 36 nr
+帕洛斯 17 nr
+帕洛阿尔托 5 nrt
+帕潘德里欧 6 ns
+帕烈格 2 nr
+帕特 10 nrt
+帕特农 3 nr
+帕特利 7 nr
+帕特南 14 ns
+帕特尔 4 nr
+帕特拉 3 nrt
+帕特森 14 nr
+帕特洛 3 nr
+帕特玛 3 nr
+帕特罗 3 nr
+帕特里 3 nrt
+帕特里克 33 nrt
+帕特里斯 2 nrt
+帕特雷 3 nr
+帕特雷塞 4 nrt
+帕特鲁舍夫 4 nrt
+帕玛拉 2 nr
+帕瑞达 4 nr
+帕瓦罗蒂 7 nrt
+帕皮提 7 nr
+帕福斯 3 nr
+帕竹噶 2 nr
+帕竹泽 2 nr
+帕米尔 118 nr
+帕米尔高原 75 ns
+帕米拉 8 nrt
+帕米萨 2 nr
+帕米萨诺 3 nrt
+帕素帕 3 nr
+帕索斯 7 nr
+帕纳勒 2 nr
+帕维亚 7 nr
+帕维尔 13 nr
+帕罗 8 nrt
+帕罗西 3 ns
+帕腊奈 2 nr
+帕莫主 2 nr
+帕莱奥洛 2 nrt
+帕萨卡 2 nr
+帕萨尔加 2 nrt
+帕萨尔格 3 nrt
+帕萨特 10 nr
+帕萨迪纳 7 nrt
+帕西 7 ns
+帕西基 3 nr
+帕西奥 3 nr
+帕西格 2 nr
+帕西法 3 nr
+帕西法尔 2 nrt
+帕西班 2 nr
+帕西诺 3 nr
+帕诺夫斯 2 nrt
+帕连克 2 nr
+帕邢系 3 nr
+帕里 12 nrt
+帕里亚 4 nr
+帕里克 2 nr
+帕里尼 3 nr
+帕里斯 21 nr
+帕里镇 4 nr
+帕金斯 3 nr
+帕金森 64 nr
+帕金森氏 17 nr
+帕金森氏症 16 nz
+帕金森病 3 nr
+帕金森症 3 nz
+帕隆藏布 15 ns
+帕隆藏布江 2 ns
+帕雷德 2 nr
+帕雷托 13 nr
+帕雷托解 3 nr
+帕雷西斯 2 nrt
+帕韦利奇 2 nrt
+帕马菲 2 nr
+帕魈宸 2 nr
+帕鲁帕 4 nr
+帕鲁德 2 nr
+帕麦尔 4 nr
+帕麦斯 3 nr
+帕默斯顿 9 nrt
+帖 1530 q
+帖友 3 n
+帖图 3 n
+帖图区 3 n
+帖子 292 n
+帖服 3 n
+帖来帖去 3 n
+帖近 3 n
+帗 2 zg
+帘 512 n
+帘子 303 n
+帘子布 12 n
+帘子线 3 n
+帘布 9 n
+帘帐 3 n
+帘幕 15 n
+帘窥壁听 3 n
+帙 158 q
+帚 120 ng
+帚子 3 n
+帚柄 3 n
+帛 289 ng
+帛书 58 n
+帛画 24 n
+帜 239 zg
+帝 3756 n
+帝丘 7 n
+帝业 5 n
+帝丞相 3 nr
+帝义 2 n
+帝京 3 nr
+帝亲 2 n
+帝企鹅 3 n
+帝位 255 n
+帝俄 3 ns
+帝俄时代 3 n
+帝俊 10 nr
+帝光 2 n
+帝兵 2 n
+帝刘庄 4 nr
+帝制 441 n
+帝制时代 3 n
+帝力 6 n
+帝原 2 n
+帝号 17 n
+帝君 70 nr
+帝命 2 n
+帝喾 33 nr
+帝国 3655 n
+帝国主义 5674 n
+帝国主义者 71 n
+帝国大厦 3 nr
+帝国时代 3 n
+帝大明 2 nr
+帝女花 3 n
+帝子 9 n
+帝室 9 n
+帝师 57 n
+帝平 2 n
+帝建安 8 nr
+帝异 4 n
+帝心 3 n
+帝星 8 n
+帝服 3 n
+帝权 2 n
+帝永安 2 nr
+帝汶岛 17 nr
+帝父 2 n
+帝爷 3 n
+帝王 1918 nr
+帝王之相 3 nr
+帝王宫苑 3 nr
+帝王将相 38 nr
+帝王行 3 nr
+帝王陵 2 nr
+帝登基 4 nr
+帝皇 34 nr
+帝益 4 n
+帝盟 2 n
+帝素 2 n
+帝纪 18 n
+帝老爷 3 nr
+帝自立 4 nr
+帝行礼 2 nr
+帝西 3 n
+帝赐 4 n
+帝辇之下 3 v
+帝辛 47 nr
+帝道 2 n
+帝都 26 n
+帝释 8 n
+帝镇 4 n
+帝门 3 n
+帝陵 45 n
+帝雉 3 n
+帞 3 zg
+帠 2 zg
+帡 3 zg
+帡天极地 3 v
+帤 27 zg
+带 25733 v
+带上 780 v
+带上去 3 v
+带上来 3 v
+带下 3 v
+带不带 3 v
+带会 3 v
+带伤 40 v
+带你去 3 n
+带信 3 v
+带光盘 3 n
+带入 196 v
+带兵 406 v
+带兵人 15 n
+带兵官 12 n
+带军 3 v
+带减腰围 3 n
+带出 3 v
+带分数 3 n
+带到 854 v
+带刺 26 v
+带刺儿 4 n
+带动 1138 v
+带动力 4 n
+带动型 2 n
+带动性 3 n
+带动风气 3 n
+带劲 12 v
+带劲儿 3 d
+带勤率 3 n
+带化 3 v
+带去 3 v
+带发修行 3 n
+带向 3 v
+带味 3 v
+带善 3 v
+带回 492 v
+带回去 3 n
+带回家 3 n
+带团 3 n
+带团参加 3 n
+带团建 3 v
+带场 3 n
+带坏 3 v
+带够 3 v
+带大 3 v
+带天窗 3 nz
+带头 675 v
+带头人 192 n
+带头作用 3 n
+带头羊 18 n
+带好 3 v
+带好儿 3 n
+带子 153 n
+带孔牙 3 n
+带孝 18 v
+带宽 249 v
+带岭区 3 n
+带工 3 v
+带工头 3 n
+带帽 2 v
+带开 3 v
+带式 28 n
+带式刹车 3 nz
+带引 3 v
+带往 3 v
+带徒弟 3 n
+带我去 3 n
+带挈 18 v
+带操 3 v
+带月披星 3 ns
+带有 1963 v
+带有色调 3 n
+带材 8 n
+带来 6670 v
+带来不利 2 v
+带来带去 3 n
+带枪 3 v
+带枪上场 3 n
+带枪上阵 3 v
+带植 3 v
+带毒 3 v
+带毒者 3 n
+带水拖泥 3 n
+带法 3 v
+带状 224 v
+带状弓 3 nz
+带状桥 3 n
+带状疮疹 3 n
+带状疱疹 3 n
+带状线 3 n
+带状节目 3 n
+带状谱 3 n
+带狗 3 n
+带环 3 n
+带班 13 v
+带球 84 v
+带球上篮 3 n
+带球撞人 3 n
+带电 365 v
+带电体 3 n
+带电作业 3 n
+带电插 4 v
+带电池 3 n
+带电粒子 3 nz
+带病 77 v
+带病上场 3 n
+带病毒 3 n
+带石针 3 n
+带砺河山 3 nz
+带积范畴 3 n
+带笑 73 v
+带笔 3 v
+带符号 6 n
+带答不理 3 v
+带累 34 v
+带线 6 n
+带练 3 v
+带给 449 v
+带绦虫 12 n
+带罪立功 3 n
+带羞 2 v
+带职 3 v
+带背光 3 n
+带脉 36 n
+带至 3 v
+带药 3 v
+带菌 22 v
+带菌者 12 n
+带薪 3 v
+带薪休假 3 n
+带话 3 v
+带调 3 v
+带资 3 v
+带走 830 v
+带起 3 v
+带路 141 v
+带路人 4 n
+带过 3 v
+带进 3 v
+带进去 3 v
+带进来 3 v
+带道 3 v
+带金佩紫 3 ns
+带钢 5 v
+带钱 3 v
+带钱到 3 v
+带钱去 3 v
+带钱来 3 v
+带锯 2 v
+带锯床 3 n
+带锯条 3 n
+带镜粉盒 3 n
+带阁楼 3 n
+带队 191 n
+带队参加 3 n
+带露 7 v
+带领 1893 v
+带饭 3 v
+带馅 3 v
+带鱼 53 v
+带齐 3 v
+帧 303 q
+帧中继 6 nr
+帧内压缩 3 vn
+帧定位 3 nr
+帧封装 3 nr
+帧频 3 nr
+帨 2 zg
+師 126 zg
+帬 7 zg
+席 1570 n
+席上之珍 3 nr
+席上珍 2 nr
+席下 3 n
+席不暇暖 4 i
+席丰履 2 nr
+席丰履厚 3 nr
+席为业 3 nr
+席之娱 2 nr
+席位 364 n
+席位数 3 n
+席勒 63 nr
+席卷 271 n
+席卷一空 3 i
+席卷全国 3 n
+席卷八荒 3 i
+席卷天下 2 i
+席卷而来 16 i
+席卷而逃 3 i
+席地 28 n
+席地履厚 3 i
+席地幕天 3 n
+席地而坐 63 i
+席城 19 n
+席夫碱 3 n
+席子 83 n
+席尔瓦 15 nr
+席履丰厚 3 nr
+席应真 3 nr
+席慕容 3 nr
+席慕蓉 2 nr
+席拉赫 2 nr
+席曼宁 3 nr
+席格蒙 5 nr
+席梦思 8 nr
+席梦思床 3 n
+席棚 39 n
+席棚子 2 nr
+席次 27 n
+席泽宗 4 nr
+席珍待聘 3 nr
+席相迎 3 nr
+席相陪 4 nr
+席篾 3 n
+席纹 4 n
+席维斯 3 nr
+席草 16 n
+席薪枕块 3 i
+席运营 3 nr
+席门穷巷 3 i
+席门蓬巷 3 i
+席间 105 n
+席面 60 n
+帮 6493 v
+帮上 3 v
+帮不上 3 v
+帮不上忙 3 v
+帮不了 52 v
+帮主 1309 v
+帮会 179 v
+帮你忙 3 l
+帮你顶 3 l
+帮佣 7 v
+帮倒忙 14 l
+帮凑 3 v
+帮凶 54 v
+帮别人 3 n
+帮到 3 v
+帮办 77 v
+帮助 9128 v
+帮助后进 3 v
+帮助文件 3 n
+帮助者 5 n
+帮厨 4 v
+帮厨女工 3 v
+帮同 3 v
+帮困 30 v
+帮场 3 n
+帮套 3 n
+帮子 111 n
+帮宝适 3 n
+帮工 28 v
+帮带 13 v
+帮帮 209 v
+帮帮忙 44 l
+帮帮我 3 n
+帮忙 991 v
+帮成 3 v
+帮手 394 v
+帮扶 108 v
+帮拳 3 v
+帮教 17 v
+帮教谈话 3 l
+帮派 105 v
+帮派体系 3 n
+帮派组织 3 n
+帮狗吃食 3 l
+帮腔 64 n
+帮虎吃食 3 l
+帮补 11 v
+帮衬 50 v
+帮规 40 v
+帮贫济困 3 l
+帮闲 20 v
+帮闲钻懒 3 n
+帯 2 zg
+帰 15 zg
+帲 3 zg
+帳 3 zg
+帴 140 zg
+帶 15 zg
+帷 211 n
+帷堂 3 n
+帷子 8 n
+帷帐 14 n
+帷幄 17 n
+帷幔 12 n
+帷幕 328 n
+帷幕不修 3 n
+帷幕墙 3 n
+帷握 3 n
+帷灯匣剑 3 n
+帷灯箧剑 3 vn
+帷箔不修 3 n
+帷薄不修 3 n
+常 13042 d
+常万全 2 nr
+常世琪 4 nr
+常东 2 ns
+常举剑 2 nr
+常乐 7 a
+常书鸿 7 nr
+常事 136 n
+常二侠 2 nr
+常人 520 n
+常以 3 d
+常以东 2 nr
+常以臣 2 nr
+常价 3 n
+常任 208 n
+常任代表 3 n
+常任制 3 n
+常任理事 3 n
+常伏 2 j
+常会 45 n
+常伯志 25 nr
+常住 609 v
+常住人口 3 n
+常佣耕 2 nr
+常例 122 n
+常侍之 3 nr
+常侍郎 4 nr
+常值 8 n
+常光甫 2 nr
+常兴 2 b
+常冠 3 n
+常利 2 ns
+常务 4906 n
+常务主席 3 n
+常务会议 3 n
+常务副 3 n
+常务委员 105 n
+常务委员会 8 n
+常务理事 3 n
+常务监事 3 n
+常务董事 18 n
+常卿韩 2 nr
+常压 69 n
+常压塔 3 n
+常压舱 3 n
+常厥居 3 nr
+常含 2 v
+常含海 2 nr
+常含铁 3 nr
+常含银 2 nr
+常听到 3 l
+常吸 3 v
+常呈柱 2 nr
+常喝 3 nr
+常回去 3 l
+常回家 3 l
+常回来 3 l
+常因 3 n
+常坛主 6 nr
+常城 2 ns
+常备 84 n
+常备不懈 6 l
+常备兵 3 nr
+常备军 89 nr
+常夏 2 ns
+常大哥 2 nr
+常太监 2 nr
+常太镇 3 nr
+常套 3 a
+常委 1113 j
+常委会 7079 j
+常婧夷 3 nr
+常存 3 v
+常宁 6 nr
+常宁县 3 ns
+常宁市 3 ns
+常安 5 ns
+常安慰 2 nr
+常客 55 nr
+常容 2 n
+常寄情 2 nr
+常寺协 2 nr
+常寺卿 23 nr
+常导 2 n
+常小兵 4 nr
+常少卿 15 nr
+常山 108 ns
+常山县 2 ns
+常山股份 3 nz
+常川 3 ns
+常州 245 ns
+常州人 9 nr
+常州城 4 ns
+常州市 35 ns
+常州港 3 ns
+常常 5147 d
+常常见 5 nr
+常平 113 nr
+常平仓 3 nr
+常平镇 3 ns
+常年 633 d
+常年不懈 3 l
+常年性 9 b
+常年累月 9 l
+常异交 2 l
+常式 3 b
+常微分 3 n
+常微服 2 nr
+常德 655 nr
+常德市 26 ns
+常德路 3 nr
+常念 3 n
+常态 188 n
+常态分班 3 n
+常态分配 3 l
+常性 6 n
+常恐秋 2 nr
+常情 37 n
+常惠英 3 nr
+常成 4 nrfg
+常成群 3 nr
+常抓 3 v
+常抓不懈 21 l
+常指 3 j
+常捷军 3 nr
+常播 3 vn
+常敬之 14 nr
+常数 546 n
+常数函子 3 l
+常数层 3 n
+常新 3 d
+常时 23 d
+常昊赢 3 nr
+常春 3 nr
+常春藤 4 nr
+常晓阳 3 nr
+常景 2 n
+常有 1026 b
+常有子 2 nr
+常有林 8 nr
+常有良 2 nr
+常服 54 n
+常服发 2 l
+常朗声 2 nr
+常朝礼 14 nr
+常期性 3 n
+常来 3 d
+常来寨 2 nr
+常来常往 3 l
+常松胜 3 nr
+常林钻石 2 nr
+常模 3 b
+常氏兄弟 7 nr
+常洗 3 b
+常流 3 n
+常流水 2 ns
+常流河 6 ns
+常润 2 n
+常温 162 n
+常温下 3 l
+常温奶 3 nr
+常温层 3 n
+常温状态 3 l
+常澍田 2 nr
+常熟 146 a
+常熟人 27 n
+常熟市 16 ns
+常熟路 3 n
+常燕生 2 nr
+常爱 4 a
+常犯 3 n
+常理 169 n
+常生 3 b
+常用 2258 b
+常用命令 3 n
+常用字 8 n
+常用对数 10 l
+常用工具 3 l
+常用药 27 n
+常用词 13 n
+常用语 5 nr
+常用软件 3 l
+常用量 2 n
+常白山 3 nr
+常盘贵子 3 nr
+常盛 2 a
+常看到 3 l
+常礼 5 nr
+常礼服 3 nr
+常结群 5 nr
+常继发 7 nr
+常绿 722 b
+常绿林 5 nr
+常绿栎 5 nr
+常绿树 19 nr
+常绿植物 6 l
+常绿灌 3 nr
+常绿灌木 3 nr
+常绿绿篱 3 ns
+常绿草 2 nr
+常绿阔 27 nr
+常绿阔叶 3 nr
+常绿雨林 4 nr
+常缀 2 v
+常翠青 2 nr
+常考 19 v
+常聚 2 v
+常胜 120 nr
+常胜军 173 nr
+常胜号 2 n
+常胜将军 14 nr
+常自裕 5 nr
+常自言 4 nrfg
+常艳丽 2 nr
+常若松 3 nr
+常见 2560 a
+常见于 169 d
+常见字 3 l
+常见故障 3 n
+常见疾病 3 n
+常见病 94 nr
+常见问题 3 l
+常规 1198 n
+常规化 4 b
+常规岛 2 nr
+常规性 6 b
+常规战争 36 l
+常规武器 92 l
+常规裁军 3 n
+常规赛 235 vn
+常言 33 n
+常言说 83 l
+常言道 403 l
+常誓继 2 nr
+常讲 3 v
+常设 1039 vn
+常设性 2 n
+常设机构 3 n
+常识 500 n
+常识性 17 n
+常识推理 3 l
+常识课 2 n
+常谈 3 v
+常败 3 v
+常败军 3 nr
+常赫志 33 nr
+常跑 3 v
+常轨 2 b
+常迁延 2 nr
+常返状态 3 l
+常进节 16 nr
+常远 3 d
+常连安 2 nr
+常速 2 d
+常遇春 272 nr
+常郭靖 2 nr
+常采 2 v
+常量 184 n
+常金鹏 3 nr
+常长风 12 nr
+常随楚 4 l
+常青 304 nr
+常青树 21 nr
+常青藤 6 nr
+常须 3 d
+常领 3 n
+常频 2 b
+常额 6 b
+常饮 3 n
+常香玉 7 nr
+常驻 462 v
+常驻性 3 vn
+常驻机构 3 v
+常驻程序 3 v
+常鳞凡介 3 nr
+帹 46 zg
+帺 62 zg
+帻 300 g
+帽 757 zg
+帽儿 31 n
+帽圈 3 n
+帽头 3 n
+帽子 1032 n
+帽子戏法 42 n
+帽峰山 3 n
+帽带 3 n
+帽徽 19 n
+帽扣 3 n
+帽檐 31 n
+帽沿 3 n
+帽沿儿 3 n
+帽状期 3 n
+帽状结构 3 n
+帽盒 3 n
+帽盔 5 n
+帽盔儿 3 z
+帽章 3 n
+帽缨 3 n
+帽耳 3 n
+帽舌 3 n
+帽边 3 n
+帽顶 16 n
+帾 13 zg
+帿 118 zg
+幂 106 n
+幂函数 3 n
+幂幺根 3 vn
+幂律流体 3 n
+幂指数 3 n
+幂等律 3 n
+幂级数 50 n
+幂零算子 3 n
+幃 5 zg
+幄 38 g
+幅 2365 n
+幅员 60 n
+幅员广大 3 n
+幅员辽阔 51 i
+幅宽 10 n
+幅射 3 n
+幅射线 3 n
+幅度 1443 n
+幅度分割 3 n
+幅度检波 3 n
+幅照片 3 n
+幅移键控 3 n
+幅面 28 n
+幅频特性 3 n
+幆 13 zg
+幇 297 zg
+幉 5 zg
+幊 3 zg
+幌 424 zg
+幌动 3 n
+幌子 155 n
+幎 2 zg
+幏 13 zg
+幑 2 zg
+幒 10 zg
+幓 424 zg
+幔 182 n
+幔子 3 n
+幔帐 5 n
+幔源气 3 n
+幕 1520 q
+幕义 3 n
+幕僚 580 n
+幕僚长 3 n
+幕前 3 s
+幕前幕后 3 n
+幕剧 3 n
+幕友 3 n
+幕后 221 s
+幕后人物 3 n
+幕后指挥 3 n
+幕后操纵 3 i
+幕后新闻 3 n
+幕后活动 3 n
+幕后消息 3 n
+幕后策划 3 n
+幕后英雄 3 n
+幕墙 27 n
+幕天席地 6 n
+幕客 15 n
+幕宾 21 n
+幕尼黑 3 ns
+幕布 22 n
+幕帷 3 n
+幕府 321 n
+幕府将军 3 n
+幕府时代 3 n
+幕燕釜鱼 3 i
+幕燕鼎鱼 3 i
+幕间 3 n
+幕间休息 3 n
+幕间曲 3 n
+幕阜山脉 6 ns
+幖 4 zg
+幗 13 zg
+幙 161 zg
+幛 25 n
+幞 38 g
+幡 315 ng
+幡儿 3 d
+幡然 12 d
+幡然悔悟 7 l
+幡然改途 3 l
+幡然醒悟 14 l
+幢 470 q
+幢幢 3 z
+干 19811 v
+干一行 3 j
+干不了 79 l
+干丝 3 n
+干个够 3 v
+干么 3 d
+干之子 2 nr
+干事 398 n
+干事会 8 n
+干事长 24 n
+干云蔽日 3 i
+干亲 9 n
+干亲家 6 n
+干什么 1270 l
+干仗 13 n
+干仙 17 n
+干仙怒 3 nr
+干休 47 v
+干休所 15 n
+干会众 2 n
+干儿子 48 n
+干光豪 45 nr
+干军万 3 nr
+干冰 21 nr
+干冷 38 a
+干净 1860 a
+干净利索 17 n
+干净利落 82 n
+干净核弹 3 n
+干净水 5 n
+干凉 2 a
+干凉季 3 nr
+干凝胶 3 n
+干出 3 v
+干利休 5 nr
+干利体 3 n
+干到底 8 l
+干制 13 v
+干制保藏 3 n
+干劲 86 a
+干劲儿 3 nr
+干劲冲天 3 nr
+干劲十足 3 nr
+干卿何事 3 i
+干卿底事 3 i
+干号 2 n
+干名犯义 3 l
+干名采誉 3 i
+干吗 424 v
+干吼 3 v
+干呕 20 v
+干员 2 n
+干咳 99 v
+干品 8 n
+干品含 2 v
+干哑 3 a
+干哥 2 n
+干哭 3 v
+干啼湿哭 3 l
+干喷射 3 v
+干嗽 3 v
+干嘛 3 n
+干嚎 16 v
+干嚼 3 v
+干国之器 3 l
+干土 3 n
+干坏事 3 n
+干坤 3 n
+干城 24 n
+干城之将 3 i
+干城章嘉峰 9 nr
+干大鹿 2 nr
+干太监 2 nr
+干头 3 n
+干女儿 34 nr
+干好 3 a
+干妈 45 n
+干妹 2 n
+干妹子 10 nr
+干姐 2 n
+干姐姐 3 nr
+干姜 29 n
+干娃 4 n
+干娘 28 n
+干子 2 n
+干季 36 n
+干季之 4 nr
+干完 63 v
+干寒 5 a
+干将 109 n
+干将莫邪 3 nr
+干少津 2 nr
+干尸 203 n
+干尼亚 2 nr
+干山 2 n
+干巴 19 n
+干巴利脆 3 nz
+干巴利落 3 n
+干巴巴 62 z
+干布 2 v
+干干净净 525 z
+干干的 4 z
+干干翼翼 3 i
+干干脆脆 8 z
+干式 22 n
+干得了 3 l
+干急 3 a
+干性 28 n
+干性油 20 n
+干性醇 2 n
+干戈 52 nr
+干戈扰攘 5 i
+干才 21 n
+干打垒 7 n
+干打雷 3 nr
+干扰 1559 v
+干扰信号 9 nz
+干扰力 3 n
+干扰哨声 3 n
+干扰器 3 n
+干扰机 27 n
+干扰沉降 3 i
+干扰测试 3 n
+干扰源 13 n
+干扰理论 3 n
+干扰素 75 n
+干扰能力 4 n
+干挠 3 v
+干掉 111 v
+干支 116 n
+干支沟 2 n
+干支流 81 n
+干政 50 n
+干政之 8 nr
+干教众 2 n
+干散货 3 n
+干旱 1221 a
+干旱区 68 n
+干旱地区 3 n
+干旱期 6 n
+干旱气候 3 n
+干昭侯 3 nr
+干杯 93 n
+干松 3 a
+干极 3 n
+干果 63 n
+干枝 7 n
+干枣儿 2 nr
+干枯 92 v
+干架 3 n
+干柴 88 n
+干柴烈火 10 i
+干栏 32 n
+干校 76 n
+干梆梆 3 z
+干棉球 3 n
+干椒含 257 nr
+干椰枣 4 n
+干槽症 3 n
+干步廊 128 n
+干死你 3 nr
+干气 2 n
+干氧氧化 3 n
+干沟 8 n
+干法 20 n
+干法刻蚀 3 n
+干洗 14 v
+干洗店 10 n
+干洗机 3 n
+干活 743 a
+干活不累 3 l
+干活儿 53 n
+干流 435 n
+干海子 2 nr
+干涉 2029 v
+干涉主义 4 n
+干涉仪 66 nr
+干涉内政 3 n
+干涉技术 2 n
+干涉现象 23 n
+干涉系统 2 l
+干涉级 3 n
+干涉者 3 n
+干涉项 3 n
+干涧 3 n
+干涧村 3 nr
+干涩 72 a
+干涸 196 v
+干涸湖 3 v
+干渠 48 n
+干渴 42 v
+干湿 133 a
+干湿度 3 n
+干湿表 3 n
+干漆 3 n
+干灰化 3 n
+干点 3 n
+干热 103 a
+干热岩 3 n
+干热期 3 n
+干热气候 3 n
+干热风 61 n
+干燥 1286 a
+干燥剂 18 nz
+干燥器 25 nz
+干燥塔 3 nz
+干燥室 3 nz
+干燥度 3 n
+干燥无味 3 i
+干燥机 4 nz
+干燥橱 3 n
+干燥气候 3 n
+干燥率 3 nz
+干燥症 4 nz
+干燥箱 3 nz
+干燥花 3 nz
+干燥设备 2 n
+干爱兵 4 nr
+干爷 5 n
+干爷娘 3 n
+干爸 13 n
+干爹 116 n
+干爽 17 a
+干版 3 v
+干犯 13 n
+干猛 3 a
+干球温度 3 n
+干电池 57 n
+干瘦 42 a
+干瘪 60 a
+干瘪瘪 3 z
+干瘾 3 a
+干白 2 v
+干的事 3 n
+干盐湖 3 nr
+干相容 2 nr
+干眼 3 n
+干眼症 22 n
+干着急 15 i
+干瞪眼 30 i
+干砌石 3 vn
+干砧 3 n
+干碍 3 n
+干禄 16 nr
+干端坤倪 3 nr
+干笑 51 v
+干管 2 n
+干簧管 3 n
+干粉 11 n
+干粮 257 n
+干粮袋 11 n
+干系 365 n
+干红 11 z
+干纺 3 j
+干线 1285 n
+干线网 8 n
+干练 153 a
+干练地 3 n
+干细胞 121 n
+干结 17 v
+干群 74 n
+干群关系 3 l
+干翁 2 n
+干老子 2 nr
+干股 4 n
+干肥 3 n
+干胶 4 n
+干脆 1290 d
+干脆利索 23 z
+干脆利落 22 l
+干腐 3 n
+干腐病 2 n
+干臣 9 n
+干臣循 2 nr
+干舷 3 n
+干花 9 n
+干茶呈 2 nr
+干草 117 n
+干草地 3 n
+干草堆 8 n
+干草粉 3 n
+干菜 17 n
+干薪 4 nr
+干血浆 3 n
+干衣机 8 n
+干裂 32 v
+干警 174 j
+干警宿舍 3 n
+干谒 3 v
+干谷 6 n
+干贝 263 n
+干货 18 n
+干起 88 v
+干路 6 n
+干辣椒 3 nr
+干达 3 a
+干连 3 d
+干透 3 v
+干道 63 v
+干邑 2 nr
+干部 9717 n
+干部人事 3 n
+干部作风 3 n
+干部团 5 n
+干部处 4 n
+干部子女 3 n
+干部子弟 3 n
+干部学校 3 n
+干部家庭 3 n
+干部局 5 n
+干部带头 3 n
+干部战士 3 n
+干部政策 3 n
+干部科 3 n
+干部素质 3 n
+干部群众 3 n
+干部职工 3 n
+干部部 24 n
+干部队伍 3 n
+干酪 40 n
+干酪根 3 n
+干酪素 3 n
+干酵母 3 n
+干重 268 a
+干霄凌云 3 nr
+干霄蔽日 3 i
+干静静 2 z
+干面 262 n
+干预 973 v
+干饭 17 n
+干馏 41 v
+干髓术 3 n
+干鲜果 8 n
+干鲜果品 10 n
+平 12100 n
+平一 3 t
+平一平 2 nr
+平一指 3 nz
+平一赢 6 nr
+平东 4 ns
+平个 3 m
+平丫头 2 nr
+平丽鹃 3 nr
+平乃颜 2 nr
+平之剑 2 nr
+平之叹 4 nr
+平之奇 2 nr
+平之子 2 nr
+平之朗 2 nr
+平乐 9 a
+平乐县 3 ns
+平乡 8 n
+平乡县 3 ns
+平乡镇 4 ns
+平买平 21 nr
+平乱 28 a
+平争胜 5 nr
+平井坚 3 nr
+平交道 3 n
+平产 3 n
+平仄 49 n
+平仄韵 3 nr
+平仓 14 nr
+平代克 2 nz
+平仰 3 n
+平价 190 n
+平价商店 3 n
+平价店 3 n
+平伏 13 q
+平伏下来 3 t
+平作 3 n
+平俗 2 a
+平信 6 nr
+平假名 7 i
+平儿 569 q
+平儿一一 2 t
+平儿依 2 nr
+平儿先 4 nr
+平儿忙 5 nr
+平儿恐 2 nr
+平儿情 2 n
+平儿扶 2 nr
+平儿拿 2 nr
+平儿斟 2 nr
+平儿方 2 n
+平儿来 2 t
+平儿正 3 nr
+平儿理 2 n
+平儿见 3 nr
+平允 3 a
+平元宝 2 nr
+平光 3 n
+平光眼镜 3 nz
+平光镜 3 nr
+平克尔 3 nr
+平八郎 4 nr
+平公主 5 n
+平关陇 3 nr
+平其能 5 nr
+平冈 3 ns
+平准 39 n
+平准基金 3 nz
+平准法 4 n
+平凉 80 a
+平凉县 3 ns
+平凉地区 3 ns
+平凉市 17 ns
+平凉路 3 nr
+平凡 375 a
+平凡人 7 nr
+平凡社 7 nr
+平分 119 n
+平分秋色 26 i
+平分线 3 n
+平列 20 q
+平刨 3 n
+平利 17 a
+平利县 5 ns
+平剧 3 n
+平动 3 a
+平化 5 n
+平北 3 ns
+平南 40 ns
+平南公主 5 n
+平南县 2 ns
+平南夷 2 ns
+平南王 7 nr
+平卢节 2 nr
+平卢镇 2 nr
+平卧 31 nr
+平卧在 3 i
+平卧着 3 v
+平原 7457 ns
+平原区 108 ns
+平原县 11 ns
+平原君 3 nr
+平原地带 3 n
+平原战场 3 n
+平原易野 3 n
+平原沼泽 3 nr
+平原督邮 3 n
+平原郡 3 nr
+平反 445 v
+平反昭雪 76 i
+平叛 92 v
+平口接 3 b
+平口钳 3 n
+平可夫 5 nr
+平台 3601 n
+平台式 9 n
+平台梁 3 nr
+平台车 2 n
+平味甘 2 v
+平和 495 a
+平和县 3 ns
+平哥 2 n
+平喉 3 n
+平喘 27 n
+平喘药 10 n
+平四 63 t
+平四舞 3 nr
+平地 574 n
+平地一声雷 9 i
+平地上 3 ns
+平地人 3 n
+平地机 6 n
+平地楼台 3 nz
+平地登云 3 ns
+平地而起 7 i
+平地起家 3 l
+平地起雷 3 i
+平地青云 3 ns
+平地风波 3 ns
+平地风雷 3 i
+平均 9932 a
+平均主义 128 n
+平均价 10 n
+平均价格 3 n
+平均值 165 n
+平均偏差 3 n
+平均分 40 n
+平均分子 3 n
+平均分配 3 l
+平均利润 110 n
+平均功率 3 n
+平均化 103 n
+平均地权 3 n
+平均天空 3 nr
+平均奖 3 nz
+平均寿命 3 n
+平均工资 3 n
+平均差 3 n
+平均年龄 3 n
+平均指标 3 n
+平均收入 3 n
+平均收敛 3 i
+平均数 109 n
+平均气温 3 n
+平均水平 3 n
+平均法 9 n
+平均海拔 3 n
+平均温度 3 n
+平均码率 3 n
+平均线 5 n
+平均误差 3 l
+平均速度 3 n
+平均额 19 n
+平坐 3 v
+平坝 25 ns
+平坝县 6 ns
+平坝村 3 ns
+平坡 5 ns
+平坦 653 a
+平坦坦 3 nr
+平坦顺畅 3 nr
+平型关 77 n
+平型关大捷 8 l
+平型关战役 6 nz
+平城 93 ns
+平城南 2 ns
+平埔 3 ns
+平埔族 6 nz
+平塘 3 ns
+平塘县 3 ns
+平壤 335 n
+平壤之战 3 i
+平壤城 10 ns
+平壤市 5 n
+平声 31 n
+平复 94 v
+平复起来 3 l
+平夏城 4 ns
+平大哥 2 nr
+平大怒 2 nr
+平天下 3 i
+平天冠 3 nr
+平天成 2 nr
+平夫人 3 nr
+平头 89 n
+平头主义 3 n
+平头并进 3 i
+平头数 3 n
+平头正脸 2 i
+平头百姓 3 i
+平头钉 3 i
+平如镜 5 l
+平妈 22 n
+平妥 2 a
+平姐姐 7 nr
+平婆婆 9 nr
+平媛铁路 3 nr
+平子 3 n
+平宁山 2 ns
+平安 1438 a
+平安保险 24 n
+平安北道 5 ns
+平安南道 2 ns
+平安县 4 ns
+平安地 19 z
+平安夜 3 nr
+平安大街 4 ns
+平安工程 3 n
+平安无事 135 i
+平安无恙 26 i
+平安财 3 nr
+平安里 73 ns
+平安队 3 nt
+平安险 6 n
+平定 756 a
+平定县 8 ns
+平实 64 a
+平家物 2 n
+平射 3 v
+平射炮 9 n
+平尺 9 q
+平尼亚 2 ns
+平尾 29 n
+平局 184 n
+平屋面 3 n
+平屋顶 3 nr
+平展 45 vn
+平展展 11 nt
+平展辽阔 3 nr
+平山 80 ns
+平山区 3 ns
+平山县 104 ns
+平山堂 8 nr
+平山镇 2 ns
+平峒 3 ns
+平嵌天线 3 n
+平川 46 ns
+平川区 2 ns
+平川市 6 ns
+平州 10 ns
+平工头 3 n
+平巷 5 n
+平布 19 v
+平帝元 14 nr
+平常 1337 a
+平常事 11 n
+平常人 35 n
+平常心 69 n
+平平 363 a
+平平凡凡 9 z
+平平加 3 ns
+平平和和 3 ns
+平平妥妥 3 nz
+平平安安 67 ns
+平平定定 3 ns
+平平展展 3 nt
+平平常常 45 i
+平平庸庸 3 n
+平平当当 3 z
+平平整整 29 z
+平平淡淡 33 z
+平平白白 3 z
+平平的 54 z
+平平稳稳 19 z
+平平静静 21 z
+平年 29 t
+平庆永 2 nr
+平底 299 t
+平底船 3 n
+平底锅 6 n
+平底鞋 3 n
+平府 4 n
+平度 35 n
+平度县 2 ns
+平度市 9 ns
+平康 12 a
+平庸 251 a
+平庸之辈 3 l
+平庸者 7 n
+平开窗 3 nr
+平开门 3 nr
+平引兵 3 nr
+平弟 2 n
+平弦 3 n
+平形四边 3 l
+平心 2 a
+平心定气 3 n
+平心易气 3 n
+平心而论 93 i
+平心静气 51 i
+平快 3 a
+平快车 3 n
+平恒星 3 nz
+平息 493 n
+平成 10 v
+平战 3 nz
+平战时 2 n
+平战结合 3 nz
+平房 198 n
+平房区 6 n
+平扁亚 3 nr
+平手 167 n
+平抑 40 v
+平拉 5 q
+平拔刀 18 nr
+平招聚 2 nr
+平接关节 3 n
+平推式 16 n
+平措次登 2 nr
+平摊 19 n
+平摩尔 9 nr
+平改坡 3 nr
+平放 25 v
+平放鱼 4 n
+平整 345 a
+平整土地 3 z
+平整度 6 n
+平整机 2 n
+平斯克 2 nr
+平新乔 2 nr
+平方 269 q
+平方公分 3 q
+平方公尺 3 q
+平方公里 3503 q
+平方分米 3 q
+平方千米 7232 q
+平方厘米 333 q
+平方和 12 nr
+平方寸 2 q
+平方尺 3 q
+平方差 3 n
+平方根 26 nr
+平方根法 3 nz
+平方毫米 21 q
+平方海里 2 q
+平方码 3 n
+平方米 1982 q
+平方英哩 3 nr
+平方英寸 2 q
+平方英尺 8 q
+平方英里 35 q
+平方里 3 q
+平日 1952 t
+平时 3547 t
+平时不烧 3 l
+平时成绩 3 n
+平旷 7 a
+平旺先 13 nr
+平昌 6 nr
+平昌县 6 ns
+平明 33 a
+平易 43 a
+平易近人 60 n
+平易近民 3 n
+平昔 12 t
+平显 6 a
+平曼联 3 ns
+平替丽 2 nr
+平月 3 t
+平服 19 a
+平望 4 a
+平权 4 n
+平权主义 3 n
+平松 6 a
+平板 407 n
+平板仪 10 nr
+平板式 3 n
+平板显示器 17 n
+平板机 3 n
+平板玻璃 3 n
+平板电视 3 n
+平板车 11 n
+平林兵 3 nr
+平林诸 2 nr
+平果 5 n
+平果县 6 ns
+平桓玄 2 nr
+平桥 4 ns
+平桥区 3 ns
+平槽 3 n
+平正 26 nr
+平步登天 4 i
+平步青云 23 nr
+平步青霄 3 nr
+平武 9 nr
+平武县 6 ns
+平毁 19 v
+平民 8135 n
+平民主义 148 n
+平民化 47 n
+平民愤 3 n
+平民百姓 347 n
+平气静 13 nr
+平水 14 n
+平水年 3 t
+平水韵 3 nr
+平汉 4 t
+平汉线 7 nr
+平汉路 8 nr
+平汉铁路 12 nz
+平江 189 ns
+平江区 3 ns
+平江县 19 ns
+平江起义 16 nz
+平沙 16 ns
+平沙无垠 3 i
+平河 3 ns
+平治 3 n
+平治天 5 nr
+平治天下 3 l
+平沼 8 n
+平泉 8 nr
+平泉县 4 ns
+平泉桥 2 nr
+平津 581 ns
+平津战役 79 nz
+平流 20 n
+平流层 43 n
+平流缓进 3 i
+平流雾 2 n
+平流霜冻 3 i
+平浅 3 a
+平浙西 2 nr
+平浪 2 nz
+平海五 3 nr
+平涂 7 a
+平淡 230 a
+平淡无味 3 i
+平淡无奇 45 i
+平淮仓 2 nr
+平添 126 nr
+平清盛 3 nr
+平湖 33 ns
+平湖县 4 ns
+平湖市 5 ns
+平溪 3 nr
+平溪乡 3 nr
+平溪镇 2 nr
+平滑 139 a
+平滑肌 131 n
+平满纳 2 nr
+平潭 29 ns
+平潭厅 2 nr
+平潭县 6 ns
+平潭岛 6 ns
+平澹无奇 3 nz
+平炉 46 n
+平炉钢 3 n
+平煤集团 4 nt
+平版 15 v
+平版印刷 3 n
+平献颖 3 nr
+平王丁 3 nr
+平王敦 3 nr
+平生 656 n
+平生之愿 3 i
+平生大事 3 n
+平畴 3 nr
+平畴沃野 2 nr
+平白 90 a
+平白无故 53 i
+平白无辜 3 i
+平盘 7 n
+平直 165 a
+平直沙 2 nr
+平矫令 3 nr
+平秀吉 2 nr
+平科特 2 nr
+平移 61 v
+平移变换 7 i
+平移因子 3 nr
+平移算符 3 n
+平移门 3 nr
+平稳 839 a
+平稳性 9 n
+平稳过渡 3 nr
+平稳集合 3 n
+平空 24 n
+平竖直 3 nr
+平章军 8 nr
+平章萧 2 nr
+平笑笑 2 nr
+平等 4885 a
+平等主义 9 n
+平等互利 104 l
+平等互惠 3 n
+平等待人 3 n
+平等待遇 3 l
+平等性 6 n
+平等权 10 n
+平等权利 3 l
+平等竞争 3 l
+平等观 6 n
+平箩 2 n
+平米 451 q
+平籴 4 nr
+平素 299 n
+平级 3 a
+平纬仪 3 nr
+平纹 42 n
+平纹布 3 nr
+平经仪 4 nr
+平绒 11 n
+平绥路 2 nr
+平绥铁路 3 nr
+平缓 326 a
+平罗 11 nr
+平罗县 3 ns
+平耶律 2 nr
+平肝 22 n
+平肝潜阳 3 n
+平肝熄风 19 l
+平胃散 3 v
+平胸 3 n
+平舆 4 n
+平舆县 2 ns
+平舌 3 n
+平舌音 3 n
+平英团 3 nr
+平菇 14 n
+平蔡州 2 ns
+平蛮 2 a
+平行 985 n
+平行作业 2 n
+平行光束 3 n
+平行六面 3 n
+平行力 3 n
+平行力系 3 n
+平行四边 3 n
+平行四边形 19 n
+平行坐标 3 n
+平行投影 6 i
+平行极化 3 n
+平行测定 3 n
+平行站位 3 n
+平行线 34 n
+平行结构 3 n
+平行面 2 n
+平衍 3 nr
+平衡 3970 a
+平衡位置 3 n
+平衡侧 3 n
+平衡力 4 n
+平衡台 3 n
+平衡器 4 n
+平衡常数 3 n
+平衡态 3 n
+平衡性 6 n
+平衡感 4 n
+平衡技巧 3 n
+平衡木 38 nr
+平衡术 3 n
+平衡机 3 n
+平衡杆 6 n
+平衡条件 3 n
+平衡流速 3 n
+平衡点 42 n
+平衡理论 3 n
+平衡秤 3 n
+平衡聚合 3 nz
+平衡表 17 n
+平衡装置 3 n
+平衡觉 5 n
+平衡论 3 n
+平衡设计 3 i
+平衡起来 3 l
+平衡阀 3 n
+平装 6 n
+平装书 3 n
+平装本 2 l
+平襄侯 2 nr
+平西 142 ns
+平西亲王 17 nr
+平西伯 79 ns
+平西王 184 nr
+平西王爷 3 nr
+平视 65 n
+平角 4 n
+平议 3 n
+平话 24 n
+平调 28 n
+平谷 23 n
+平谷区 4 n
+平谷县 13 ns
+平贝母 2 nr
+平起 3 v
+平起平坐 322 i
+平越 3 a
+平越府 2 nr
+平足 12 a
+平路 2 n
+平路机 2 n
+平身 46 n
+平躺 56 nr
+平躺在 3 l
+平躺着 3 l
+平车 16 n
+平转桥 2 nr
+平辈 41 n
+平边策 2 n
+平进平 2 nr
+平远 11 a
+平远县 3 ns
+平远号 2 n
+平通 4 a
+平逢山 8 nr
+平道人 4 nr
+平遥 239 a
+平遥县 27 ns
+平邑 2 nr
+平邑县 4 ns
+平邦彦 6 nr
+平邮 3 ns
+平郡王 2 nr
+平野 36 n
+平野阔 2 nr
+平金 5 n
+平铲 3 n
+平铺 27 n
+平铺直叙 11 i
+平铺直序 3 l
+平锅 3 n
+平镇注 2 nr
+平长毛 2 nr
+平闻 2 n
+平阔 2 a
+平阳 167 ns
+平阳侯 7 nr
+平阳公主 25 n
+平阳县 18 ns
+平阳府 9 nr
+平阳路 3 ns
+平阴 10 ns
+平阴县 2 ns
+平阴防 2 nr
+平阿四 15 nr
+平陆 8 n
+平陆北 3 nr
+平陆县 8 nr
+平陈之 2 nr
+平降 3 v
+平陵 10 ns
+平靖 3 t
+平靖关 3 nr
+平静 1946 a
+平静下来 3 i
+平面 2057 n
+平面交叉 2 n
+平面偏振 3 i
+平面几何 4 l
+平面创意 3 n
+平面化 3 n
+平面图 30 n
+平面坐标 3 n
+平面媒体 3 n
+平面导板 3 n
+平面嵌入 3 n
+平面工艺 3 n
+平面布置 3 n
+平面广告 3 i
+平面性 3 n
+平面曲线 3 n
+平面极化 3 n
+平面波 4 n
+平面磨床 3 nz
+平面网络 3 n
+平面角 3 n
+平面设计 3 i
+平面调车 3 n
+平面镜 11 n
+平面阵 3 nr
+平顶 55 n
+平顶天线 3 n
+平顶山 88 ns
+平顶山市 40 ns
+平顶山煤业 3 n
+平顶木 2 nr
+平顶海 7 ns
+平顶海山 3 ns
+平顶降落 3 n
+平顺 28 nr
+平顺县 4 nr
+平风静浪 3 i
+平飞球 3 nr
+平首布 3 nr
+平高球 3 nr
+平高电气 16 n
+平鱼 2 n
+平鲁 2 nr
+平鲁区 3 ns
+平鲁县 3 ns
+平黄经 2 n
+平齐 17 a
+年 248559 m
+年三十 29 t
+年久失修 45 l
+年久日衰 3 l
+年久月深 3 t
+年事已大 3 l
+年事已高 184 l
+年产 884 j
+年产值 73 n
+年产奶 3 n
+年产能力 3 n
+年产量 244 n
+年亨利 2 nr
+年代 14659 t
+年代久远 51 l
+年代学 102 n
+年份 1122 n
+年休假 3 t
+年俸 5 n
+年值 3 n
+年兄 20 n
+年关 57 n
+年关已近 3 l
+年内 395 t
+年刊 45 n
+年初 1715 t
+年初一 19 t
+年初三 2 t
+年初二 9 t
+年利率 27 n
+年利税 3 n
+年前 460 t
+年半 3 t
+年华 142 j
+年华垂暮 3 n
+年华易逝 3 i
+年华虚度 3 n
+年历 51 t
+年历卡 3 n
+年历片 3 n
+年发电量 90 n
+年号 184 n
+年后 317 t
+年君士 3 n
+年均 3972 j
+年均值 4 n
+年均收入 6 n
+年增率 2 n
+年增长率 53 n
+年壮气锐 3 i
+年复一年 73 t
+年夜 3 t
+年夜饭 23 l
+年头 527 n
+年头儿 22 n
+年头月尾 3 i
+年宵 3 t
+年富力强 37 nr
+年少 140 v
+年少无知 3 l
+年少时 3 n
+年少气盛 3 l
+年届花甲 4 l
+年岁 156 n
+年岁久远 3 l
+年岁已久 3 l
+年希尧 8 nr
+年年如此 3 l
+年年岁岁 6 l
+年年月月 6 t
+年年有余 6 l
+年幼 326 j
+年幼无知 35 l
+年底 4750 t
+年庚 3 nr
+年庚尧 4 nr
+年度 3312 n
+年度人物 3 n
+年度性 10 n
+年度报告 3 n
+年度计划 3 n
+年度预算 3 l
+年总产 3 n
+年息 54 n
+年成交额 2 n
+年报 172 n
+年收入 202 n
+年数 73 n
+年时 21 t
+年春夏 2 t
+年景 53 n
+年景预报 3 n
+年月日 32 t
+年月日时 3 t
+年期 73 t
+年末 696 t
+年来 3 t
+年根儿 3 n
+年检 33 j
+年检费 3 n
+年楚河 20 nr
+年深岁久 3 l
+年深日久 45 l
+年深月久 16 i
+年湮世远 3 v
+年溲马勃 3 nz
+年满 349 a
+年率 51 n
+年画 177 n
+年登花甲 3 nr
+年票 23 n
+年秋冬 5 t
+年租金 3 n
+年糕 66 n
+年糕米 3 vn
+年级 657 b
+年级组 3 n
+年纪 3320 t
+年纪轻轻 3 l
+年终 137 t
+年终分配 3 l
+年终奖 58 n
+年终奖金 3 n
+年终总结 3 n
+年终考绩 3 n
+年终考评 3 n
+年终评比 3 i
+年经国纬 3 n
+年维勒 3 nr
+年维泗 2 nr
+年缴 3 v
+年羹尧 12 nr
+年老 296 n
+年老体弱 37 l
+年老体衰 10 l
+年老力衰 3 l
+年老多病 16 l
+年老色衰 3 l
+年节 110 t
+年节律 3 n
+年薪 538 n
+年薪制 6 n
+年表 156 n
+年衰岁暮 3 n
+年该月值 3 i
+年诺曼 2 nr
+年谊世好 3 n
+年谱 28 n
+年谷不登 3 i
+年貌 3 n
+年货 78 n
+年资 30 n
+年轮 73 n
+年轻 4919 a
+年轻一代 3 n
+年轻人 1923 n
+年轻力壮 180 i
+年轻化 62 n
+年轻夫妇 3 n
+年轻夫妻 3 n
+年轻女郎 3 n
+年轻干部 3 n
+年轻有为 37 n
+年轻气盛 35 z
+年轻漂亮 3 z
+年轻美貌 3 n
+年轻貌美 3 i
+年辈 19 n
+年过半百 28 l
+年过花甲 10 l
+年迈 118 a
+年迈体弱 4 l
+年迈力衰 3 l
+年运量 5 n
+年近 3 t
+年近半百 3 i
+年近古稀 3 l
+年近花甲 11 l
+年逾古稀 15 l
+年逾花甲 9 l
+年金 46 n
+年鉴 115 n
+年销售额 3 n
+年销量 3 n
+年长 214 n
+年长者 34 n
+年间 4552 t
+年限 314 n
+年青 115 n
+年青人 54 n
+年青化 3 j
+年饭 35 n
+年高德劭 10 nr
+年高德勋 3 nr
+年高德卲 3 v
+年高德邵 3 nr
+年高望重 3 n
+年龄 3808 n
+年龄层 3 n
+年龄段 119 n
+年龄特征 3 n
+年龄组 29 n
+年龄结构 3 n
+年龄阶段 3 n
+幵 5 zg
+并 93868 c
+并不一定 3 d
+并不为过 3 l
+并不多 3 l
+并不大 3 v
+并不比 3 v
+并不相同 3 i
+并不矛盾 3 l
+并不知道 3 l
+并不等于 3 l
+并不聪明 3 i
+并不认为 3 v
+并不需要 3 l
+并且 8563 c
+并世无两 3 i
+并世无双 3 i
+并为 3 c
+并为一谈 3 i
+并举 195 d
+并举手 3 l
+并于 3 c
+并以 3 c
+并作 131 v
+并先 3 d
+并入 749 v
+并列 434 v
+并列书名 3 n
+并列冠军 3 n
+并列句 6 n
+并列处理 3 v
+并列第一 3 l
+并列结构 3 n
+并列蛋白 3 l
+并列译文 3 n
+并到 3 v
+并力 121 d
+并发 167 v
+并发公理 3 n
+并发模拟 3 i
+并发流 3 n
+并发症 299 l
+并发程序 4 l
+并合 23 v
+并同 3 c
+并吞 79 v
+并吞下 3 i
+并处 45 d
+并威偶势 3 n
+并存 348 v
+并存不悖 3 i
+并存着 3 l
+并容徧覆 3 v
+并州 136 ns
+并建 24 v
+并往 3 d
+并得 3 v
+并成 3 v
+并打印 3 i
+并拢 58 v
+并排 191 v
+并排而坐 3 i
+并提 23 v
+并无不可 3 i
+并无不当 3 l
+并无二致 17 i
+并日而食 3 i
+并是 3 c
+并未 2023 d
+并条机 4 d
+并案办理 3 n
+并案处理 3 l
+并用 378 v
+并疆兼巷 3 i
+并祝 3 v
+并称 331 v
+并立 31 v
+并纱机 3 n
+并经 3 d
+并网发电 9 l
+并置 3 v
+并翼齐飞 3 i
+并联 66 ns
+并联式 3 l
+并联管网 3 n
+并肩 641 d
+并肩作战 50 l
+并肩战斗 3 l
+并肩而立 3 i
+并肩而行 3 l
+并能 3 v
+并苯 3 n
+并茂 11 v
+并蒂 18 v
+并蒂芙蓉 3 i
+并蒂莲 2 ns
+并蒂莲花 3 ns
+并行 475 v
+并行不悖 14 i
+并行任务 2 n
+并行传输 3 l
+并行口 3 n
+并行处理 26 l
+并行处理技术 3 n
+并行复制 3 l
+并行工程 7 l
+并行度 3 n
+并行性 8 n
+并行感染 3 l
+并行执行 5 i
+并行接口 3 l
+并行操作 3 l
+并行机 3 n
+并行程序 2 n
+并行算法 9 n
+并行计算 3 l
+并要 3 c
+并论 3 c
+并说 3 c
+并购 404 v
+并购案 16 n
+并购额 3 n
+并赃拿贼 3 i
+并躺在 3 l
+并轨 20 v
+并辔 40 v
+并过 3 c
+并进 148 v
+并邀 3 v
+并重 165 v
+并非 3812 c
+并非如此 118 l
+并非易事 27 i
+并须 3 d
+并驱争先 3 l
+并驾齐躯 3 i
+并驾齐驱 57 i
+幷 56 zg
+幸 878 ng
+幸万幸 2 nr
+幸不辱命 3 i
+幸之臣 3 nr
+幸事 45 n
+幸亏 582 d
+幸云曲 2 nr
+幸会 58 n
+幸会幸 11 nr
+幸免 166 d
+幸免于难 29 l
+幸勿 3 d
+幸勿见 6 nr
+幸喜 85 a
+幸国丈 2 nr
+幸垂照 2 nr
+幸好 702 a
+幸存 154 v
+幸存者 131 nr
+幸幸 3 a
+幸弘农 2 nr
+幸得 167 d
+幸得众 2 nr
+幸得圣 2 nr
+幸得瞻 3 nr
+幸得胜 2 nr
+幸徽笞 2 nr
+幸恢帧 3 nr
+幸恢挚 2 nr
+幸恢旨 2 nr
+幸恢盅 2 nr
+幸未 2 d
+幸桓鲂 2 nr
+幸桓黾 3 nr
+幸楸 3 n
+幸汉阳 2 nr
+幸淮危 3 nr
+幸灾乐祸 171 i
+幸甚 63 a
+幸福 3342 a
+幸福之路 2 nr
+幸福乡 3 nr
+幸福家庭 3 nr
+幸福快乐 3 nr
+幸福感 57 nr
+幸福戏院 3 l
+幸福村 16 nr
+幸福树 3 nr
+幸福生活 3 i
+幸福美好 3 nr
+幸福美满 3 nr
+幸福花 3 nr
+幸福观 3 nr
+幸禾宓 2 nr
+幸第录 3 nr
+幸而 382 d
+幸能 3 v
+幸臣 6 nr
+幸致 2 a
+幸董贤 2 nr
+幸蒙知 2 nr
+幸蒙赐 2 nr
+幸蒙郭 2 nr
+幸蒙韦 2 nr
+幸许 6 d
+幸诸阁 4 nr
+幸赖 2 v
+幸运 670 a
+幸运之星 3 nr
+幸运之神 3 i
+幸运值 3 l
+幸运儿 48 nr
+幸运券 3 n
+幸运地 3 l
+幸运星 3 nr
+幸运石 3 nr
+幸运者 17 nr
+幸运脸 3 l
+幸运色 3 l
+幸进 3 a
+幸进身 16 nr
+幸遇先 3 nr
+幸长安 2 nr
+幹 12 zg
+幺 3254 nr
+幺幺小丑 3 nr
+幺弦孤韵 3 nr
+幺拟群 3 vn
+幺正算符 3 nr
+幺豚暮鹨 3 n
+幺麽小丑 3 v
+幻 411 n
+幻世录 3 nr
+幻像 3 n
+幻出 3 v
+幻剑 2 n
+幻化 110 n
+幻化成 3 nr
+幻听 22 v
+幻境 41 n
+幻彩 3 n
+幻影 197 n
+幻念 3 n
+幻想 1038 n
+幻想作 3 n
+幻想力 4 n
+幻想国 3 n
+幻想地 3 n
+幻想曲 37 n
+幻想片 2 n
+幻数 3 n
+幻方 11 n
+幻日 4 n
+幻景 14 n
+幻术 36 n
+幻梦 11 n
+幻法 3 n
+幻灭 43 v
+幻灯 30 n
+幻灯机 3 n
+幻灯片 27 n
+幻画 3 n
+幻相 2 n
+幻视 14 n
+幻视作用 3 n
+幻觉 239 n
+幻觉性 3 n
+幻觉症 3 n
+幻象 52 n
+幻阴 3 n
+幻雷者 3 n
+幼 856 n
+幼主 88 n
+幼体 173 n
+幼儿 263 n
+幼儿园 405 nr
+幼儿圆 3 nr
+幼儿学校 3 n
+幼儿所 3 n
+幼儿教师 3 n
+幼儿教育 47 l
+幼儿期 15 t
+幼儿班 2 nr
+幼兽 7 n
+幼功 6 a
+幼发拉底 3 n
+幼发拉底河 78 ns
+幼叶 7 t
+幼名 3 n
+幼君 3 nr
+幼吾幼以 3 nr
+幼吾幼以及人之幼 3 l
+幼女 132 n
+幼妹 2 n
+幼嫩 21 a
+幼子 118 n
+幼学壮行 3 n
+幼小 222 n
+幼小无知 3 l
+幼小班 3 nr
+幼师 6 n
+幼帝 8 n
+幼年 494 t
+幼年人 3 n
+幼年土壤 3 n
+幼年时代 3 t
+幼年时期 3 t
+幼年期 3 t
+幼弟 7 n
+幼弱 3 a
+幼托 3 n
+幼教 31 n
+幼教组 3 n
+幼教网 3 n
+幼时 280 t
+幼有所托 3 n
+幼木 3 n
+幼林 8 nr
+幼林地 3 n
+幼果 3 n
+幼树 29 n
+幼株 3 n
+幼根 3 n
+幼犬 3 n
+幼狮 3 n
+幼狮通讯 3 n
+幼畜 26 n
+幼禽 3 n
+幼稚 362 a
+幼稚可笑 3 n
+幼稚园 12 n
+幼稚地 3 n
+幼稚师范 3 n
+幼稚教育 3 n
+幼稚病 11 n
+幼童 54 n
+幼童军 3 nr
+幼芽 21 n
+幼苗 112 n
+幼茎 5 n
+幼虫 787 n
+幼豹 3 n
+幼雏 21 nr
+幼驹 3 n
+幼鱼 26 n
+幼鸟 7 n
+幼鸽 2 n
+幼鼠 9 n
+幼齿 3 n
+幼龄 21 n
+幼龄林 3 nr
+幼龟 6 n
+幽 725 n
+幽丛 3 n
+幽丽 3 a
+幽人 3 n
+幽会 65 n
+幽僻 12 a
+幽光 15 n
+幽兰 17 n
+幽兰谷 3 n
+幽冥 58 a
+幽助 3 v
+幽咽 7 v
+幽囚 3 n
+幽囚受辱 3 n
+幽女 3 n
+幽婉 4 a
+幽媾 3 v
+幽室 3 n
+幽寂 4 a
+幽居 26 n
+幽州 261 n
+幽幽 283 z
+幽幽咽咽 3 n
+幽幽啜泣 3 vn
+幽幽地 3 z
+幽幽暗暗 3 n
+幽径 5 n
+幽微 13 a
+幽忧 3 v
+幽思 4 n
+幽怨 52 a
+幽恨 3 a
+幽情 20 n
+幽愤 6 a
+幽明 8 a
+幽明异路 3 n
+幽暗 114 a
+幽期 2 n
+幽期密约 3 n
+幽梦 3 n
+幽浮 3 a
+幽深 272 a
+幽游白书 3 n
+幽渺 3 a
+幽灵 332 n
+幽灵公主 3 n
+幽灵式 3 n
+幽灵机 3 n
+幽灵船 3 n
+幽然 7 z
+幽燕 43 n
+幽独 3 a
+幽禁 65 v
+幽篁 4 n
+幽美 17 a
+幽草 19 n
+幽谷 72 n
+幽趣 4 a
+幽远 22 a
+幽邃 12 a
+幽长 4 n
+幽门 69 n
+幽闭 44 v
+幽闲 6 a
+幽雅 113 a
+幽静 144 a
+幽香 109 n
+幽魂 17 n
+幽魂不散 3 n
+幽默 614 a
+幽默家 3 n
+幽默小说 3 n
+幽默感 129 n
+幽默机智 3 n
+幽默滑稽 3 n
+幽默画 3 n
+幽默诙谐 3 v
+幾 14 zg
+广 4658 a
+广丙管 2 nz
+广东 4256 ns
+广东中山大学 3 nt
+广东发展银行 12 nt
+广东台 3 ns
+广东地区 14 ns
+广东外语外贸大学 22 nt
+广东戏 3 nz
+广东政府 13 nt
+广东教育出版社 6 nt
+广东明珠 2 nr
+广东核电集团 256 nt
+广东海关 3 ns
+广东电信 3 nz
+广东画院 3 nt
+广东省 924 ns
+广东省公安厅 10 nt
+广东省妇联 2 nt
+广东省委 40 nt
+广东省政协 2 nt
+广东省政府 26 nt
+广东省教育厅 24 nt
+广东省文联 2 nt
+广东省旅游局 2 nt
+广东省物价局 13 nt
+广东省科技厅 6 nt
+广东省高级人民法院 2 nt
+广东站 3 ns
+广东籍 6 nr
+广东茶 3 nr
+广东菜 3 nr
+广东话 3 l
+广东队 16 nt
+广东音乐 6 ns
+广丰 4 ns
+广丰县 4 ns
+广为 220 ns
+广为人知 13 l
+广为传颂 2 nr
+广为流传 124 l
+广义 856 ns
+广义力 3 nr
+广义动量 3 n
+广义地说 3 l
+广义坐标 3 n
+广义性 3 n
+广义速度 3 n
+广之旅 18 nr
+广五州 3 ns
+广井王子 3 nr
+广交 9 b
+广交会 33 nt
+广交朋友 5 n
+广众 2 n
+广会师 2 n
+广佛华 6 nz
+广信军 4 nt
+广元 42 nz
+广元市 22 ns
+广六州 2 ns
+广兴 8 ns
+广利 7 ns
+广前 3 ns
+广加 3 ns
+广化寺 4 nz
+广医 3 n
+广协济 2 nz
+广南 21 ns
+广南东 9 ns
+广南县 2 ns
+广南西 10 ns
+广南路 3 ns
+广博 133 ns
+广博会 3 nr
+广博性 3 nr
+广厦 14 ns
+广厦万间 3 nz
+广厦千间 3 nz
+广发 90 nz
+广发卡 3 nr
+广发基金 10 nz
+广发行 3 nt
+广合顺 3 nz
+广告 2928 n
+广告业 32 n
+广告业务 3 n
+广告主 52 n
+广告人 21 n
+广告代理 3 n
+广告伞 3 n
+广告位 3 n
+广告公司 3 n
+广告创意 3 l
+广告制品 3 n
+广告单 3 n
+广告员 4 n
+广告商 59 n
+广告处 3 n
+广告媒体 3 n
+广告学 33 n
+广告宣传 4 nz
+广告战 3 nz
+广告投放 2 l
+广告插播 3 l
+广告效应 3 n
+广告曲 3 n
+广告条 3 n
+广告板 3 n
+广告栏 6 n
+广告歌 3 n
+广告法 3 n
+广告片 10 n
+广告牌 79 n
+广告画 5 n
+广告界 2 n
+广告礼品 3 n
+广告社 3 n
+广告笔 3 n
+广告网 3 nz
+广告色 3 n
+广告节 3 n
+广告行业 3 n
+广告衫 3 n
+广告装饰 3 n
+广告设备 3 n
+广告设计 3 n
+广告词 34 n
+广告语 14 nz
+广告费 37 n
+广告费用 3 n
+广告辞 3 nz
+广告部 16 n
+广告链 3 n
+广告页面 2 n
+广商 2 n
+广善寺 2 ns
+广土众民 2 ns
+广场 7424 n
+广场用地 3 n
+广场砖 3 n
+广域 5 ns
+广域网 35 n
+广夏细旃 3 nr
+广外 4 a
+广大 5043 a
+广大党员 3 n
+广大听众 3 i
+广大客户 3 ns
+广大干群 3 ns
+广大干警 3 j
+广大干部 3 ns
+广大无边 3 l
+广大群众 3 nr
+广大职工 3 l
+广大观众 3 nt
+广大读者 3 nz
+广大青年 3 nr
+广学会 6 nt
+广学博采 3 nr
+广学政 5 nr
+广宁 75 ns
+广宁卫 3 nr
+广宁县 4 ns
+广宁子 15 nr
+广宁府 4 nt
+广宁省 3 ns
+广宁镇 2 ns
+广宁门 4 ns
+广安 31 ns
+广安区 3 ns
+广安县 3 ns
+广安市 5 ns
+广安门 29 ns
+广宗 10 nr
+广宗县 2 nr
+广宗城 2 nr
+广宗寺 2 nr
+广官军 2 nr
+广寒 11 b
+广寒仙子 3 nr
+广寒宫 12 nr
+广寒殿 4 nr
+广屯 3 ns
+广岛 143 ns
+广川 5 ns
+广州 5640 ns
+广州东站 2 ns
+广州中山大学 8 nt
+广州体育学院 8 nt
+广州军区 42 nt
+广州军区空军 5 nt
+广州地区 17 ns
+广州大学 3 nt
+广州宾馆 3 ns
+广州市 473 ns
+广州市中级人民法院 3 nt
+广州市公安局 4 nt
+广州市区 3 ns
+广州市卫生局 4 nt
+广州市委 7 nt
+广州市政府 5 nt
+广州抽水蓄能电站 4 nt
+广州日报 3 nz
+广州某 3 nr
+广州港 16 ns
+广州湾 36 ns
+广州火车站 4 nt
+广州白云国际机场 2 ns
+广州白云机场 11 ns
+广州空军 2 nt
+广州美术学院 3 nt
+广州药业 6 nz
+广州话 5 n
+广州起义 98 nz
+广州队 11 nt
+广巡抚 8 nr
+广巡阅 2 nr
+广工大 3 j
+广布 672 ns
+广布政 263 nr
+广师求益 3 nr
+广帮 3 j
+广平 26 ns
+广平县 2 ns
+广平府 8 ns
+广府 2 n
+广度 265 ns
+广度性质 3 nz
+广庭大众 3 nr
+广延性 5 nr
+广延量 3 nr
+广建 2 ns
+广建宫 3 nr
+广开 60 ns
+广开才路 3 ns
+广开言路 14 l
+广开财源 3 nt
+广开财路 3 nt
+广开贤路 3 ns
+广开门路 2 ns
+广弘明 4 nr
+广彩瓷 8 nr
+广征博 4 nr
+广征博采 3 nr
+广征贡 3 nr
+广德 40 ns
+广德军 7 nr
+广德县 3 ns
+广德寺 3 nr
+广德降 2 nr
+广总兵 2 nr
+广惠仓 6 nr
+广惠司 4 nr
+广惠寺 2 nr
+广惠王 2 nr
+广成子 6 nr
+广撒 2 ns
+广播 1920 vn
+广播中心 3 nt
+广播体操 39 n
+广播公司 3 nt
+广播剧 35 n
+广播台 5 nt
+广播员 6 n
+广播室 6 nt
+广播局 14 nt
+广播式 9 n
+广播操 3 n
+广播时间 3 n
+广播楼 3 n
+广播段 3 n
+广播电台 32 nt
+广播电影电视部 15 nt
+广播电视 21 nt
+广播电视局 2 nt
+广播界 3 n
+广播稿 7 n
+广播站 25 nt
+广播系统 5 n
+广播级 3 b
+广播网 12 nt
+广播者 3 n
+广播节目 3 n
+广播讲话 3 n
+广播设备 4 n
+广收博揽 3 nr
+广敞 3 a
+广文先生 3 nr
+广施法 5 nr
+广旺 3 ns
+广昌 65 ns
+广昌县 3 ns
+广明 11 ns
+广晋府 2 nr
+广曰平 2 nr
+广曰征 2 nr
+广木 2 ns
+广末凉子 3 nr
+广本 3 ns
+广本飞度 3 ns
+广林 3 ns
+广林圣手 3 nr
+广柑 10 n
+广梅汕 9 ns
+广水 6 ns
+广水市 258 ns
+广汉 69 ns
+广汉市 11 ns
+广河 2 ns
+广河县 3 ns
+广泉 2 nz
+广泗奏 2 nr
+广泗遂 3 nr
+广泛 8276 a
+广泛传播 3 nr
+广泛应用 3 l
+广泛开展 3 nr
+广泛性 52 nr
+广泛支持 3 nr
+广济 31 n
+广济县 3 ns
+广济寺 10 nr
+广济桥 2 nz
+广济河 24 ns
+广济渠 3 nr
+广海九 2 nr
+广深线 3 nz
+广深铁路 4 nz
+广深高速 3 nz
+广渠门 26 ns
+广温性 2 n
+广源 5 ns
+广源土 2 nz
+广源州 4 ns
+广漠 11 ns
+广漠无边 3 n
+广瀚无边 3 nr
+广灵 6 ns
+广灵县 3 ns
+广玉兰 3 nr
+广琅 7 n
+广生榨 2 b
+广田 13 ns
+广电 115 nz
+广电厅 2 nt
+广电夸带 3 n
+广电局 9 nt
+广电总局 124 nt
+广电报 3 nz
+广电楼 3 n
+广电网 2 nz
+广电部 21 nt
+广电集团 4 nt
+广百 3 nz
+广益 3 n
+广盛 2 nz
+广督师 2 nr
+广示恩 2 nr
+广福寺 3 nr
+广种薄收 23 l
+广积粮 3 n
+广积阴德 3 nr
+广空 4 n
+广空航空兵 2 nt
+广纳 8 ns
+广纳善言 3 nr
+广纳群 2 nr
+广结 3 a
+广结善 2 nr
+广结善缘 3 nr
+广结良缘 3 nr
+广绣 3 nz
+广罗人才 3 nr
+广而告之 5 l
+广而言之 3 l
+广联 2 ns
+广联达 3 nz
+广聘武 2 nr
+广胜寺 4 nr
+广船 5 nz
+广船国际 26 nt
+广艺舟 3 nr
+广蓄 2 a
+广藿香 3 z
+广行 3 j
+广袤 97 a
+广袤千里 3 q
+广袤无际 3 nz
+广西 1727 ns
+广西军区 5 ns
+广西北 3 ns
+广西北海 3 ns
+广西区 9 ns
+广西南宁 3 ns
+广西壮族 3 nr
+广西壮族自治区 205 ns
+广西壮族自治区人民政府 2 l
+广西大学 17 nt
+广西师范大学 20 nt
+广西电影制片厂 3 nt
+广西省 31 ns
+广西艺术学院 3 nt
+广西队 7 nt
+广覆盖 2 l
+广见 3 a
+广见洽闻 3 nr
+广视信 3 nt
+广角 13 ns
+广角端 3 n
+广角透镜 3 nz
+广角镜 3 nz
+广角镜头 2 ns
+广譬曲谕 3 nr
+广论 7 n
+广谱 31 n
+广谱性 2 n
+广谱抗 5 nr
+广谷 3 ns
+广贤文 6 nr
+广货 7 n
+广辟案源 3 l
+广达 33 ns
+广运 10 n
+广运潭 6 ns
+广远 3 a
+广通 3 nz
+广通仓 2 nr
+广通声 2 n
+广通渠 12 nr
+广通站 2 nt
+广道 6 ns
+广道御 3 nr
+广道抚 2 nr
+广采博学 3 nr
+广采博收 3 nr
+广金 4 n
+广金岛 4 ns
+广金钱草 3 n
+广铁 6 n
+广铁集团 2 nt
+广铁集团公司 3 nt
+广闻 3 n
+广阔 1558 a
+广阔天地 3 i
+广阔无垠 11 l
+广防已 3 l
+广阳 13 ns
+广阳区 6 ns
+广阳郡 10 ns
+广陈善 2 nr
+广陵 98 ns
+广陵举 2 nr
+广陵区 3 ns
+广陵城 2 ns
+广陵度 2 ns
+广陵散 21 nr
+广陵散绝 3 nr
+广陵新 2 ns
+广陵派 2 nr
+广陵绝响 3 n
+广陵郡 7 nr
+广隆 4 ns
+广雅 18 ns
+广雅书 2 nr
+广雅书局 2 nt
+广雅疏 5 nr
+广韵 18 nr
+广顺 33 nz
+广饶 9 ns
+广饶区 3 ns
+广饶县 7 ns
+庀 107 g
+庄 1593 nr
+庄一战 2 nr
+庄丁取 2 nr
+庄丁另 2 nr
+庄上 220 n
+庄上来 2 nr
+庄上歇 2 nr
+庄世平 2 nr
+庄严 2070 a
+庄严宝相 3 nr
+庄严宣告 3 nr
+庄严肃穆 3 nr
+庄主 195 nr
+庄主游 2 n
+庄主琴 2 nr
+庄主莫 2 nr
+庄于谐 2 nr
+庄亲王 2 nr
+庄人家 2 n
+庄仁兴 7 nr
+庄众信 2 nr
+庄允城 27 nr
+庄先生 11 nr
+庄公子 6 nr
+庄公惠 257 nr
+庄内庄 2 nr
+庄则栋 4 nr
+庄前庄 6 nr
+庄叔随 2 nr
+庄可隶 2 nr
+庄吴香 2 nr
+庄员 3 n
+庄周 201 nr
+庄周梦蝶 3 nr
+庄周老 3 nr
+庄哥哥 7 nr
+庄园 323 nr
+庄园主 40 nr
+庄士敦 2 nr
+庄外牵 2 nr
+庄大哥 9 nr
+庄大田 2 nr
+庄太后 114 nr
+庄太太 2 nr
+庄夫人 14 nr
+庄头 17 n
+庄头子 2 nr
+庄妇 2 n
+庄嫁 3 n
+庄子 485 nr
+庄宗同 2 nr
+庄宗李 7 nr
+庄客 211 nr
+庄客入 3 nr
+庄客取 2 nr
+庄客备 2 nr
+庄客宰 2 nr
+庄客托 2 nr
+庄客报 4 n
+庄客李 6 nr
+庄客来 2 nr
+庄客牵 2 nr
+庄客王 3 nr
+庄客见 2 nr
+庄客飞 2 nr
+庄客齐 2 nr
+庄宪祖 6 nr
+庄家 442 n
+庄小鱼 3 nr
+庄岳训 3 nr
+庄巧生 2 nr
+庄希泉 6 nr
+庄帝元 3 nr
+庄帮主 27 nr
+庄庄主 2 nr
+庄廷龙 3 nr
+庄思浩 2 nr
+庄户 8 n
+庄户人 13 n
+庄户人家 3 n
+庄户屯 2 nr
+庄敬自强 3 nr
+庄文皇后 10 nr
+庄无因 11 nr
+庄晚芳 10 nr
+庄曹青 3 nr
+庄树旗 2 nr
+庄校长 2 nr
+庄氏史 2 nr
+庄河 24 nr
+庄河县 2 ns
+庄河市 16 ns
+庄浪 17 nr
+庄浪县 7 nr
+庄游氏 4 nr
+庄烈帝 2 nr
+庄王伐 3 nr
+庄王初 2 nr
+庄生晓 2 nr
+庄生梦 2 nr
+庄生梦蝶 3 nr
+庄田地 3 nr
+庄田约 2 nr
+庄田顷 3 nr
+庄留书 2 nr
+庄皇太后 2 nr
+庄盛琪 2 nr
+庄祖勤 2 nr
+庄祥兴 4 nr
+庄票 3 n
+庄离裴 2 nr
+庄禾集村 3 nr
+庄稼 575 n
+庄稼人 251 nrfg
+庄稼地 59 n
+庄稼汉 64 nrfg
+庄稼活 3 n
+庄稼活儿 3 n
+庄稼院 2 n
+庄繁 4 a
+庄红卫 2 nr
+庄老乌 4 nr
+庄老秦 2 nr
+庄老蒋 5 nr
+庄聚贤 41 nr
+庄股 3 n
+庄胜崇光百货 2 nr
+庄舄越吟 3 nr
+庄茶栈 4 nr
+庄襄王 2 nr
+庄西路 3 nr
+庄辉明 2 nr
+庄运口 2 nr
+庄里有 2 nr
+庄重 606 a
+庄重文 2 nr
+庄铭耀 2 nr
+庄铮 3 nrfg
+庄门 9 n
+庄院 62 n
+庄霞琴 2 nr
+庄青翟 3 nr
+庄首建 2 nr
+庅 3 zg
+庆 2279 vg
+庆三八 3 nz
+庆丰 4 nz
+庆云 34 ns
+庆云县 3 ns
+庆云寺 3 ns
+庆亲王 3 nr
+庆元 57 nz
+庆元党禁 5 n
+庆元县 5 ns
+庆元旦 3 nr
+庆典 2000 ns
+庆典公司 3 n
+庆典暨 3 ns
+庆典活动 3 n
+庆典用品 3 n
+庆典礼仪 3 nr
+庆功 124 v
+庆功会 38 n
+庆功宴 14 n
+庆功曲 3 n
+庆功版 3 v
+庆功酒 3 n
+庆历 62 nz
+庆吊 3 v
+庆吊不行 3 l
+庆回归 3 ns
+庆城 3 ns
+庆城县 3 ns
+庆大 5 nz
+庆大霉素 27 nz
+庆安 5 nz
+庆安县 6 ns
+庆家 3 n
+庆寿 3 ns
+庆尚 8 n
+庆尚南道 6 nz
+庆岭 3 ns
+庆州 40 ns
+庆幸 300 v
+庆应 13 v
+庆春 6 ns
+庆春路 3 nz
+庆源 5 nz
+庆熙大学 3 nt
+庆父不死 2 l
+庆生 3 v
+庆生会 3 nz
+庆生日 3 nz
+庆祝 1612 v
+庆祝会 12 nr
+庆祝国庆 3 ns
+庆祝大会 3 nr
+庆祝晚会 3 nr
+庆贺 308 v
+庆贺寺乡 4 nr
+庆铃 3 nz
+庆阳 34 ns
+庆阳县 5 ns
+庆阳地区 2 ns
+庆阳市 3 ns
+庆龄 4 n
+庇 532 vg
+庇佑 26 v
+庇护 376 v
+庇护所 9 n
+庇护权 5 n
+庇荫 23 v
+庉 2 zg
+床 3204 n
+床上 2057 n
+床上叠床 3 n
+床上安床 3 n
+床上戏 3 n
+床上施床 3 n
+床上用品 3 n
+床上运动 3 n
+床上迭床 3 nz
+床下安床 3 n
+床下牛斗 3 n
+床位 94 n
+床位数 3 n
+床位费 3 n
+床具 3 n
+床单 356 n
+床围 2 n
+床垫 25 n
+床头 237 n
+床头人 3 n
+床头柜 48 n
+床头灯 12 n
+床头金尽 3 n
+床子 26 n
+床尾 3 n
+床帐 3 n
+床席 3 n
+床帷 3 n
+床底 3 n
+床板 64 n
+床架 6 n
+床柱 3 n
+床榻 20 n
+床毯 3 n
+床沿 156 n
+床盖 3 n
+床笫之欢 3 v
+床笫之私 3 v
+床第 3 n
+床第之欢 3 n
+床第之间 3 n
+床罩 21 n
+床脚 3 n
+床褥 9 n
+床身 6 n
+床边 331 n
+床边柜 3 n
+床边橱 3 n
+床铺 117 n
+庋 228 g
+序 1102 n
+序位 6 n
+序列 803 n
+序列化 2 n
+序列号 7 n
+序列图 3 n
+序列密码 5 n
+序列帧 3 n
+序列改变 3 n
+序列表 2 n
+序号 131 n
+序域 3 n
+序幕 491 n
+序数 49 n
+序数记号 3 n
+序数词 3 n
+序文 38 n
+序时 3 n
+序时帐 3 n
+序时账 3 n
+序曲 117 n
+序次 3 n
+序盘 2 n
+序目 5 n
+序章 3 n
+序言 141 n
+序论 11 n
+序贯估计 3 n
+序跋 23 n
+序齿 7 n
+庐 310 ns
+庐山 533 ns
+庐山会议 96 nz
+庐山区 15 ns
+庐山真面 2 nz
+庐山真面目 7 i
+庐山管理局 13 nt
+庐山面目 3 i
+庐州 3 ns
+庐江 318 ns
+庐江县 11 ns
+庐舍 14 ns
+庐阳区 3 ns
+庐陵 27 ns
+庑 553 ng
+库 2071 n
+库东 2 ns
+库什 82 nrt
+库仑 94 ns
+库仑场 3 ns
+库仑定律 30 ns
+库仑积分 3 n
+库仑规范 3 n
+库仑计 3 nr
+库伦 30 nr
+库伦旗 5 nr
+库伯瓦 2 nr
+库依尔 3 nr
+库克 162 nrt
+库克山 5 nr
+库克峰 4 nr
+库克群岛 40 ns
+库兰德 3 nr
+库兴氏 15 nr
+库兹娃 2 nr
+库兹巴 4 nr
+库兹涅 7 nr
+库兹涅佐夫 49 nrt
+库兹涅佐娃 58 nrt
+库内 24 nrt
+库内奥 2 nrt
+库函数 8 n
+库利 7 nrt
+库利亚布 2 nrt
+库利科 2 nr
+库券 22 n
+库加尔 2 nr
+库加河 2 ns
+库勒 30 nrt
+库勒湖 5 nr
+库区 66 n
+库卡 2 nrt
+库司坊 5 nr
+库吏 2 n
+库命令 3 n
+库喃喃 4 n
+库图佐夫 14 nrt
+库址 2 n
+库埃卡 2 nrt
+库埃特流 3 ns
+库塔 8 nrt
+库夫 3 nrt
+库夫拉 3 nrt
+库夫曼 68 nr
+库奇 9 nrt
+库奇马 3 nr
+库契普 4 nrt
+库姆 19 nrt
+库姆塔格 2 nrt
+库姆斯 6 nr
+库娃艳 3 nr
+库子 3 n
+库存 364 n
+库存值 3 n
+库存商品 3 n
+库存服装 3 n
+库存模型 3 n
+库存现金 3 n
+库存股票 3 n
+库存量 17 n
+库存鞋 3 nr
+库容 129 n
+库容量 12 n
+库尔 46 nrt
+库尔兰 4 nr
+库尔勒 81 nrt
+库尔勒市 16 ns
+库尔喀 4 nr
+库尔回 3 nr
+库尔坎 6 nr
+库尔奇 2 nr
+库尔察 2 nr
+库尔尼科娃 6 nrt
+库尔干 6 nrt
+库尔干秋别 2 nr
+库尔德 51 nrt
+库尔德人 31 nrt
+库尔德斯坦 5 nrt
+库尔德族 4 nr
+库尔恰 4 nr
+库尔戈 2 nrt
+库尔斯克 44 nrt
+库尔曼 8 nrt
+库尔河 2 nr
+库尔淖 4 nr
+库尔特 8 nrt
+库尔班 7 nrt
+库尔甘 3 nr
+库尔纳 4 nr
+库尔羊 3 nr
+库尔蒂 4 nrt
+库尔诺 5 nr
+库尔贝 15 nr
+库尔迪 2 nr
+库尔黑 2 nrt
+库尼亚 16 ns
+库尼亚尔 2 nrt
+库居积 2 nr
+库岸 2 n
+库巴 14 nrt
+库巴唐 3 nr
+库布 11 nrt
+库布其 3 nr
+库布其沙漠 8 ns
+库布奇 3 nr
+库布齐 32 nr
+库希特 26 nr
+库帕河 2 nr
+库平银 22 nr
+库库塔 3 nrt
+库库尔 2 nr
+库库特 2 nrt
+库式贡 2 nr
+库弗雷 6 nr
+库思老 4 nr
+库房 153 n
+库房重地 3 n
+库托 32 nrt
+库托坎 19 nr
+库拉 48 nrt
+库拉河 5 ns
+库拉索 12 nr
+库拉索岛 3 nrt
+库斯 30 nrt
+库斯塔奈 3 nr
+库斯科 46 nrt
+库斯科省 2 ns
+库斯鲁 3 nr
+库施 2 n
+库施特 5 nr
+库普林 3 nr
+库普里 2 nrt
+库曼 7 nrt
+库朗特 2 nrt
+库木吐 2 nr
+库木吐拉 2 nrt
+库木塔格 3 nrt
+库杜古 2 nr
+库楚克 3 nr
+库楚姆 3 nr
+库欣病 3 nr
+库款 3 n
+库比 5 nrt
+库泰尼 5 nr
+库洛夫 10 nr
+库洛尔 8 nr
+库洛赫 14 nr
+库涅茨克 3 nrt
+库特 34 nrt
+库特森 7 nr
+库玛丽 3 nr
+库珀 28 nrt
+库班 7 nrt
+库班河 4 ns
+库瓦斯 3 nrt
+库福尔 3 nr
+库纳 11 nrt
+库缎 3 n
+库罗耶多夫 8 nrt
+库腊加 2 nr
+库苏泊 3 nr
+库茨 3 nrt
+库莫奚 8 nr
+库莱布 3 nr
+库菲体 4 nr
+库萨 6 nrt
+库萨克 3 nr
+库萨尔 5 nr
+库藏 81 ns
+库藏量 3 n
+库蚊 10 n
+库西 8 ns
+库西宁 3 nr
+库诺尔 4 nr
+库谢维 3 nr
+库财赋 2 nr
+库贷 3 n
+库赛尔 2 nr
+库车 116 n
+库车县 8 ns
+库达 4 nrt
+库迪皮 3 nrt
+库邦戈 2 nr
+库里 48 nrt
+库里亚 11 nrt
+库里南 2 ns
+库里尔 7 nrt
+库里村 3 nr
+库里蒂巴 6 nrt
+库锦 3 nr
+库门 8 n
+库阿语 2 nr
+库雅泰 2 nr
+库页岛 52 nrt
+库马 4 ns
+库马尔 2 nrt
+库马拉通加 4 ns
+库马西 12 nrt
+库鲁伊 2 nr
+库鲁克 4 nr
+库鲁峰 2 nr
+库鲁河 2 nr
+库默尔 21 nrt
+应 25537 v
+应不应该 21 v
+应为 377 v
+应举 23 v
+应予 90 v
+应予以 3 nr
+应予通报 3 i
+应二州 2 nr
+应于 3 v
+应云卫 6 nr
+应交 59 v
+应从 144 v
+应付 1288 vn
+应付得宜 3 i
+应付得当 3 l
+应付款 19 n
+应付自如 12 i
+应付裕如 12 nr
+应付账款 3 n
+应以 3 v
+应以垣 16 nr
+应价 3 v
+应份 3 nz
+应会 3 v
+应佛僧 3 nr
+应作 3 vn
+应供 3 v
+应允 142 v
+应免 3 v
+应兑 3 v
+应入帝 2 nr
+应典 3 ns
+应军国 3 nr
+应刃而解 3 i
+应分 3 v
+应分得 3 v
+应列 3 v
+应列明 2 nr
+应到 3 v
+应到人数 3 l
+应制 25 v
+应力 516 v
+应力场 10 n
+应力致白 3 i
+应办 3 v
+应加 3 v
+应劭注 2 nr
+应募 37 v
+应募者 8 n
+应卯 3 v
+应县 36 ns
+应发 3 v
+应取 3 v
+应受 3 v
+应受谴责 3 vn
+应变 455 v
+应变仪 2 nr
+应变力 3 l
+应变措施 3 nr
+应变方法 3 l
+应变无方 3 i
+应变硬化 3 l
+应变能力 3 l
+应变规 3 nr
+应变计 15 l
+应变计划 3 l
+应召 60 v
+应召东 3 nr
+应召入伍 3 nr
+应召女 3 nr
+应召女郎 3 nr
+应召来 2 nr
+应召者 3 nr
+应名儿 3 nr
+应名点卯 3 i
+应向 3 v
+应否 3 v
+应国公 2 nr
+应城 550 v
+应城市 261 ns
+应增 3 v
+应声 340 v
+应声而倒 3 i
+应声虫 8 nr
+应大 20 v
+应天 127 v
+应天从人 3 i
+应天从民 3 nr
+应天从物 3 i
+应天承运 3 nr
+应天星 3 nr
+应天顺 2 nr
+应天顺人 17 nr
+应天顺时 3 nr
+应天顺民 3 nr
+应如风 3 nr
+应定华 12 nr
+应对 184 v
+应对不穷 3 l
+应对如响 3 l
+应对如流 3 l
+应对得体 3 l
+应对得宜 3 i
+应对进退 3 l
+应尽 3 v
+应届 694 v
+应届生 3 nz
+应属 3 v
+应市 3 v
+应带未带 3 i
+应常念 2 nr
+应廷吉 2 nr
+应弦而倒 3 i
+应弦飞 2 nr
+应归政 2 nr
+应当 6476 v
+应征 140 v
+应征入伍 3 n
+应征税 3 n
+应征者 19 n
+应得 207 v
+应徵者 3 nr
+应急 605 vn
+应急款 3 l
+应急灯 3 i
+应急照明 3 i
+应急行动 3 i
+应急转储 3 nz
+应战 158 v
+应战书 3 nz
+应手 76 v
+应扣 3 v
+应承 139 v
+应报 3 v
+应报未报 3 i
+应招 11 v
+应拨 3 v
+应持 3 v
+应授田 3 nr
+应接 3 v
+应接不暇 47 i
+应援 3 v
+应援者 3 nr
+应摊 3 vn
+应支 3 v
+应收 101 v
+应收帐单 3 n
+应收款 54 n
+应敌 22 v
+应时对景 3 l
+应时当令 3 i
+应时盛 6 nr
+应时而变 3 i
+应时而生 3 i
+应昌一 3 nr
+应昌府 6 nr
+应明 17 v
+应明哲 16 nr
+应明廷 4 nr
+应明辨 3 nr
+应星曜 2 nr
+应景 38 n
+应景诗 3 nr
+应有 1159 v
+应有尽有 113 i
+应机权变 3 nz
+应机立断 3 i
+应权通变 3 i
+应松 10 v
+应标 2 v
+应武举 3 nr
+应氏杯 16 nr
+应永深 13 nr
+应河 3 ns
+应激 64 v
+应激反应 10 l
+应激状态 3 l
+应然 2 v
+应物 3 n
+应玄武 2 nr
+应理雅 3 nr
+应生虫 3 n
+应用 8796 v
+应用光学 3 n
+应用力学 3 l
+应用化学 3 n
+应用卫星 3 nz
+应用型 56 n
+应用层 11 n
+应用性 32 n
+应用文 23 nr
+应用服务 18 n
+应用服务器 10 l
+应用状况 2 l
+应用率 2 n
+应用环境 20 l
+应用科学 42 l
+应用程序 3 n
+应用程式 3 n
+应用软件 124 l
+应用软体 3 l
+应用逻辑 3 l
+应用面 2 n
+应用领域 3 l
+应用题 20 n
+应电流 3 v
+应留 3 v
+应白虎 2 nr
+应真君 3 nr
+应社友 2 n
+应秉赋 16 nr
+应税 7 v
+应税面 3 n
+应立即 3 i
+应章奏 3 nr
+应答 179 v
+应答器 6 nr
+应答如响 3 i
+应答如流 3 i
+应答机 3 nr
+应约 12 v
+应约而到 3 i
+应约而来 3 i
+应约而至 3 i
+应纳 3 v
+应纳税额 6 n
+应纳课 2 nr
+应给 3 v
+应给于 3 l
+应给以 3 i
+应考 202 v
+应考生 3 nr
+应考者 11 n
+应者 3 n
+应聘 868 v
+应聘者 517 n
+应能 3 v
+应节 3 vn
+应节合拍 3 l
+应补 3 v
+应被审判 3 nr
+应规蹈距 3 n
+应计 3 v
+应讨 3 v
+应记 3 v
+应许 15 v
+应设 3 vn
+应诉 25 v
+应诊 4 v
+应译 4 v
+应译成 2 nr
+应试 480 vn
+应试教育 3 l
+应试者 107 n
+应该 21067 v
+应诺 44 v
+应负 3 v
+应贷 3 v
+应身 3 v
+应转 3 v
+应运 14 v
+应运而生 194 i
+应运而起 3 i
+应运龙 4 nz
+应退 3 v
+应适当 3 i
+应选 299 v
+应选人 3 n
+应邀 364 v
+应邀出席 3 nr
+应邀前来 3 nr
+应邀参加 3 nr
+应邀而来 3 nr
+应邀赴会 3 nr
+应邀赴宴 3 nr
+应酬 316 v
+应酬信 3 nz
+应酬话 6 l
+应酬饭 3 v
+应采择 16 nr
+应销 3 v
+应门 3 v
+应际而生 3 i
+应需 3 v
+应青龙 2 nr
+应领 3 v
+应验 84 vn
+应龙之 3 nr
+底 7005 f
+底下 1138 f
+底下人 11 n
+底价 41 n
+底儿 53 n
+底册 2 n
+底卷 3 n
+底向上 2 l
+底图 3 n
+底土 27 n
+底垫 3 n
+底壳 3 n
+底处 5 n
+底子 175 n
+底子薄 3 n
+底孔 10 n
+底定 3 n
+底层 445 n
+底层页 3 n
+底工 3 n
+底布 8 n
+底帐 3 n
+底座 246 n
+底情 3 n
+底托 2 n
+底数 73 n
+底料 2 n
+底朝天 3 ns
+底本 60 n
+底板 67 n
+底架 2 n
+底柱 3 n
+底栖生物 18 l
+底样 3 n
+底格里斯 11 ns
+底格里斯河 46 ns
+底楼 8 n
+底止 4 n
+底死谩生 3 z
+底比斯 51 ns
+底气 96 n
+底气不足 3 l
+底气十足 19 l
+底水 8 n
+底水锥进 3 l
+底水驱动 3 l
+底泥 9 n
+底漆 3 n
+底火 14 n
+底点 3 n
+底片 59 n
+底片夹 3 n
+底版 14 n
+底牌 28 n
+底物 3 n
+底特律 113 n
+底特律河 7 ns
+底盖 2 n
+底盘 241 n
+底码 3 n
+底稿 31 n
+底窑 4 n
+底站 3 n
+底端 3 f
+底粪 3 n
+底纹 3 n
+底线 205 n
+底线传中 3 n
+底细 116 n
+底缝 3 n
+底肥 2 n
+底脚 3 n
+底舱 61 n
+底色 55 n
+底蕴 131 n
+底薪 73 n
+底衬 3 n
+底裤 3 n
+底襟 3 n
+底角 19 f
+底谷 7 n
+底账 3 n
+底货 3 n
+底质 54 n
+底超 3 ns
+底边 20 f
+底迷 3 n
+底部 784 f
+底里 32 f
+底限 8 n
+底集 3 n
+底面 304 f
+庖 195 ng
+庖丁 9 nrt
+庖丁解牛 6 n
+庖代 3 n
+庖厨 20 n
+店 3417 n
+店东 3 n
+店主 259 n
+店主人 92 n
+店伙 95 n
+店伙计 3 n
+店伴 3 n
+店儿 3 n
+店号 3 n
+店名 20 n
+店员 111 n
+店址 11 n
+店堂 100 n
+店大欺客 3 vn
+店子 17 n
+店客 3 n
+店家 148 n
+店小二 313 n
+店底 3 n
+店张镇 2 n
+店方 7 n
+店租 3 n
+店老板 36 n
+店里 408 n
+店钱 6 n
+店铺 672 n
+店铺扒手 3 ns
+店长 19 n
+店门 67 n
+店门口 18 n
+店集 2 n
+店面 113 n
+店面间 3 n
+店风 3 n
+庘 24 zg
+庙 4541 n
+庙主 3 n
+庙会 123 n
+庙儿沟 2 ns
+庙前 72 ns
+庙前街 4 ns
+庙口 3 n
+庙台 3 n
+庙号 58 n
+庙嘴 2 ns
+庙坪 72 ns
+庙堂 113 n
+庙堂之上 3 n
+庙宇 300 n
+庙寺 3 ns
+庙岭 2 ns
+庙殿 3 n
+庙河 3 ns
+庙湾 2 ns
+庙滩镇 2 ns
+庙祝 19 ns
+庙神 3 n
+庙街 263 ns
+庙里 358 ns
+庚 136 nr
+庚丑 3 m
+庚二酸 3 nz
+庚亥 3 m
+庚午 9 m
+庚午元 3 nz
+庚午日 3 nz
+庚卯 3 m
+庚基 3 nz
+庚子 49 nz
+庚子四 2 m
+庚子年 18 m
+庚子日 2 nz
+庚子赔款 17 nz
+庚寅 6 m
+庚巳 3 m
+庚帖 14 m
+庚戌 9 m
+庚戌年 3 m
+庚日 3 m
+庚未 3 nz
+庚款 5 m
+庚澄庆 3 v
+庚炔 3 n
+庚烯 3 nz
+庚烷 3 nz
+庚烷值 3 n
+庚申 21 m
+庚申年 4 m
+庚申日 5 m
+庚申月 5 m
+庚癸频呼 3 z
+庚糖 3 n
+庚辰 4 nz
+庚酉 3 m
+庚酮 3 nz
+庚酸 3 nz
+庚醇 3 nz
+庚醛 3 nz
+庛 40 zg
+府 11760 nr
+府上 326 n
+府兵制 54 n
+府南 13 ns
+府南河 8 ns
+府南河畔 2 ns
+府县 73 ns
+府右街 2 ns
+府君 9 nrt
+府城 121 ns
+府城镇 3 ns
+府学 3 n
+府学胡同 5 n
+府尊 3 n
+府尹 72 n
+府库 3 n
+府河 7 ns
+府治 3 n
+府第 80 nrt
+府绸 40 n
+府舍 3 n
+府茅 3 ns
+府谷 18 n
+府谷县 2 ns
+府邸 125 n
+庝 654 zg
+庞 454 nr
+庞万春 22 nr
+庞丽娜 250 nr
+庞丽琴 25 nr
+庞云大 2 nr
+庞云道 6 nr
+庞令明 2 nr
+庞以女 3 nr
+庞伟良 2 nr
+庞兴雷 2 nr
+庞刘苟 4 nr
+庞加莱 81 nr
+庞加莱球 3 nr
+庞加莱群 3 nr
+庞各庄 7 nr
+庞圆娜 3 nr
+庞培 66 nr
+庞培之 2 nr
+庞培兵 2 nr
+庞士元 9 nr
+庞大 1582 a
+庞学勤 3 nr
+庞家堡 2 nr
+庞将军 2 nr
+庞尚鹏 12 nr
+庞尽揽 2 i
+庞巴度 9 nr
+庞巴维 5 nr
+庞巴迪 6 nr
+庞廷山 4 nr
+庞德 130 nr
+庞德公 259 nr
+庞德引 2 nr
+庞德曾 2 nr
+庞德闻 2 nr
+庞承功 2 nr
+庞文刚 6 nr
+庞文可 4 nr
+庞文大 5 nr
+庞文心 35 nr
+庞文才 3 nr
+庞文文 2 nr
+庞文正 2 nr
+庞文让 6 nr
+庞文道 63 nr
+庞斯富 5 nr
+庞杂 72 a
+庞柔亦 2 nr
+庞毕度 3 nr
+庞氏 9 nr
+庞泉沟 2 nr
+庞海龙 2 nr
+庞然 7 a
+庞然大物 134 i
+庞然巨 6 nr
+庞特勤 2 nr
+庞眉白发 3 i
+庞眉皓发 3 i
+庞眉皓首 3 i
+庞眉鹤发 3 i
+庞眉黄发 3 i
+庞秋雁 3 nr
+庞纳博 2 nr
+庞统之 3 nr
+庞统入 2 nr
+庞统军 2 nr
+庞统谓 2 nr
+庞维仁 3 nr
+庞老公 3 nr
+庞良永 6 nr
+庞葛城 3 nr
+庞蒂亚 9 nr
+庞贝城 4 nr
+庞贝尔 15 nr
+庞迪克 2 nr
+庞道沐 2 nr
+废 2641 v
+废丝 3 n
+废书而叹 3 i
+废井 5 n
+废人 115 n
+废件 3 n
+废品 133 n
+废品库 3 n
+废品收购 3 n
+废品率 7 n
+废品站 2 n
+废土 3 n
+废地 3 n
+废址 3 n
+废城 3 n
+废塑料 11 n
+废墟 476 n
+废声 3 n
+废学 3 n
+废寝忘食 45 i
+废寝忘餐 3 i
+废帝 3 n
+废弃 398 v
+废弃地 3 n
+废弃物 86 n
+废弛 61 vn
+废弛已久 3 nr
+废掉 94 v
+废文任武 3 n
+废料 72 n
+废旧 37 v
+废旧塑料 3 n
+废旧物资 3 n
+废旧电池 3 n
+废旧金属 3 n
+废机油 3 n
+废橡胶 3 n
+废止 198 v
+废气 127 n
+废气污水 3 n
+废气肿 3 n
+废水 209 n
+废水处理 2 n
+废水槽 3 n
+废水池 3 n
+废水管 3 n
+废油 2 n
+废油槽 3 n
+废液 25 n
+废渣 47 n
+废然 3 b
+废然而反 3 i
+废然而返 3 i
+废物 433 n
+废物利用 3 n
+废物箱 3 n
+废物袋 3 n
+废电池 3 n
+废矿 3 n
+废碎料 3 n
+废票 8 n
+废票箱 3 n
+废私立公 3 i
+废立 3 v
+废纸 99 n
+废统论 3 n
+废置 23 v
+废置不用 3 i
+废置不管 3 i
+废耕地 3 n
+废船 3 n
+废词 3 n
+废话 327 n
+废话少说 3 n
+废话连篇 3 n
+废轮胎 3 n
+废酸 3 n
+废醣蜜 3 v
+废金属 3 n
+废钢 10 n
+废钢铁 18 n
+废铁 54 n
+废铜 8 n
+废铜烂铁 3 n
+废除 3551 v
+废革 3 vn
+废驰 3 v
+废黜 155 v
+庠 68 g
+庠序 7 n
+庡 651 zg
+庢 779 zg
+庣 345 zg
+庤 265 zg
+庥 50 zg
+度 4995 zg
+度假 1002 v
+度假区 50 n
+度假地 4 i
+度假型 4 n
+度假村 127 n
+度假者 6 n
+度假胜地 3 i
+度君子之腹 11 i
+度命 3 v
+度夏 14 n
+度外 3 v
+度外之人 3 i
+度己以绳 3 l
+度度 3 n
+度德量力 5 n
+度提高 2 n
+度支使司 3 n
+度数 44 n
+度日 136 n
+度日如岁 3 l
+度日如年 36 i
+度春宵 3 n
+度曲 3 v
+度汛 5 n
+度河香象 3 n
+度牒 97 n
+度盘 11 v
+度空间 8 n
+度荒 4 v
+度蜜月 3 i
+度规张量 3 n
+度角 3 n
+度越 5 v
+度过 930 v
+度过难关 3 l
+度量 237 n
+度量衡 99 v
+度长絜大 3 v
+度长絜短 3 v
+座 9662 q
+座上客 16 n
+座上宾 6 n
+座乙级词 3 n
+座位 947 n
+座位号 2 n
+座位数 3 n
+座位表 3 n
+座便器 3 n
+座充 3 v
+座冲 3 n
+座右铭 54 nr
+座号 4 n
+座圈 7 n
+座垫 15 n
+座头市 3 n
+座套 3 n
+座子 14 n
+座山雕 6 n
+座席 31 n
+座无虚席 44 i
+座机 29 n
+座机费 3 n
+座架 4 n
+座标 20 n
+座标轴 3 n
+座椅 127 n
+座楼 22 n
+座次 35 n
+座疮 3 n
+座票 3 n
+座舱 237 n
+座落 29 n
+座落在 3 i
+座谈 480 n
+座谈会 1114 n
+座车 3 n
+座部 3 n
+座钟 10 n
+座骑 3 n
+庨 202 zg
+庭 533 n
+庭上 3 n
+庭内 3 n
+庭决 3 v
+庭前 3 f
+庭园 113 n
+庭外 12 f
+庭外和解 3 n
+庭子 3 n
+庭审 95 n
+庭芳院 3 vn
+庭荫树 3 n
+庭训 3 n
+庭议 3 n
+庭讯 3 n
+庭长 1063 n
+庭院 368 n
+庭院式 8 n
+庭院灯 3 n
+庭院经济 3 n
+庭院花园 3 n
+庭除 3 v
+庯 245 zg
+庳 5 g
+庵 1435 ng
+庵主 3 n
+庵儿 3 n
+庵堂 274 n
+庵寺 3 n
+庶 635 n
+庶乎 3 c
+庶乎可行 3 v
+庶事 3 n
+庶人 144 n
+庶免误会 3 n
+庶几 47 c
+庶出 23 n
+庶务 18 n
+庶务员 3 n
+庶务组 3 n
+庶士 3 n
+庶子 3 n
+庶母 16 n
+庶民 256 n
+庶物崇拜 3 vn
+庶生 3 n
+庶神 3 n
+康 1077 nr
+康世恩 5 nr
+康为卫 3 nr
+康为帝 4 nr
+康丽厂 3 nr
+康乃尔 4 nr
+康乃狄克 3 nr
+康乃狄格 3 nr
+康乃馨 34 nr
+康之治 8 nr
+康乐 40 nr
+康乐县 4 nr
+康乐园 3 nr
+康乐活动 3 n
+康乐球 3 n
+康亚风 5 nr
+康亲 21 n
+康亲王 164 nr
+康体 10 n
+康佳 112 nr
+康佳集团 7 nt
+康保 7 nr
+康保县 2 nr
+康健 32 nr
+康僧会 4 nr
+康先生 12 nr
+康克令 2 nr
+康克俭 148 nr
+康克明 3 nr
+康克清 17 nr
+康党 4 n
+康公弼 5 nr
+康前临 2 nr
+康力龙 3 nr
+康南 2 ns
+康南海 2 ns
+康县 8 ns
+康县境 2 nr
+康叔封 3 nr
+康哉之歌 3 nr
+康国 2 ns
+康国大 2 nr
+康塔塔 38 nr
+康塞普西翁 10 ns
+康复 1018 nr
+康复中心 3 nt
+康复会 2 nr
+康复科 3 nr
+康复网 3 nr
+康复者 3 nr
+康复训练 3 nr
+康多莉 3 nr
+康天文 2 nr
+康天申 3 nr
+康夫纳 3 nr
+康奈尔 5 nr
+康奈尔大学 43 nt
+康姆州 2 nr
+康威公司 3 nt
+康子妮 3 nr
+康宁 168 nr
+康宁护校 3 nr
+康安府 9 nr
+康定 52 n
+康定县 9 nr
+康定斯基 3 nr
+康定路 3 nr
+康宝忠 2 nr
+康宝莱 3 nr
+康家庄 4 nr
+康居诸 2 nr
+康巴 5 nr
+康巴人 3 nr
+康巴尔 4 nr
+康巴汉子 2 nr
+康巴青 2 nr
+康布伦 13 nr
+康布雷 4 nr
+康师傅 87 nr
+康帕内 8 nr
+康帕内拉 3 nrt
+康平 5 nr
+康平县 3 ns
+康广仁 11 nr
+康广陵 68 nr
+康庄 27 nr
+康庄大道 16 nr
+康府兼 2 nr
+康康舞 3 nr
+康强 3 nr
+康彩花 8 nr
+康待宾 2 nr
+康德 220 nr
+康德尔 2 nr
+康德罗 17 nr
+康德还 2 nr
+康德队 4 nr
+康德黎 16 nr
+康心孚 3 nr
+康必得 3 nr
+康恩贝 5 nr
+康惠太 2 nr
+康才堪 2 nr
+康托尔 83 nr
+康托尔集 3 nr
+康拉德 32 nr
+康拜因 2 nr
+康文涛 48 nr
+康斯博 3 nr
+康斯坦 10 nr
+康斯坦丁 13 nrt
+康斯坦丁内斯库 9 nz
+康斯坦察 16 nr
+康斯坦察县 2 ns
+康斯坦茨 2 nrt
+康斯托 2 nr
+康斯特 11 nr
+康昆仑 4 nr
+康明斯 12 nr
+康明逊 151 nr
+康易网 3 n
+康晋荣 3 nr
+康普顿 61 nr
+康暗沙 3 nr
+康替龙 2 nr
+康有为 1031 nrfg
+康朗英 3 nr
+康朝廷 2 nr
+康格里 4 nr
+康桥 6 nr
+康梁变 2 nr
+康梦君 3 nr
+康模 4 n
+康氏粉 2 nr
+康沃利斯 5 nr
+康沃尔 18 nr
+康沃尔郡 4 nr
+康泰 24 nz
+康泰克 6 nr
+康泰和 2 nr
+康泰著 3 nr
+康洛伊 2 nr
+康洪兴 3 nr
+康涅狄格 19 nr
+康涅狄格州 46 ns
+康涅狄格河 2 ns
+康淞万 4 nr
+康熙 3674 nrfg
+康熙字典 3 i
+康熙帝 3 i
+康熙皇帝 3 i
+康特湾 2 nr
+康王之 2 nr
+康王死 4 nr
+康王爷 9 nr
+康瓦尔 7 nr
+康生 108 nr
+康疯子 2 nr
+康皇后 16 nr
+康祐碩 3 vn
+康福宝 3 nr
+康科德 12 nr
+康立乾 23 nr
+康素爱 2 nr
+康纳利 3 nr
+康纳斯 2 nr
+康纳维 4 nr
+康统 2 n
+康继立 3 nr
+康老三 3 nr
+康能娟 2 nr
+康艳典 2 nr
+康节 5 n
+康节级 4 n
+康茂德 4 nr
+康茂才 7 nr
+康莱特 3 nr
+康蒂妲 2 nr
+康薇尔 4 nr
+康衢 3 n
+康西州 2 ns
+康西瓦 6 nr
+康西草原 2 ns
+康路 2 n
+康辉国 2 nr
+康进之 5 nr
+康那拉 2 nr
+康郡王 4 nr
+康采恩 12 nr
+康里部 2 nr
+康铜 2 nr
+康门 10 n
+康雍乾 3 nr
+康顺光 2 nr
+康马 7 nr
+康马县 3 nr
+康默记 2 nr
+庸 1609 a
+庸中佼佼 3 n
+庸中皦皦 3 v
+庸人 39 n
+庸人自扰 16 i
+庸俗 514 a
+庸俗低级 3 n
+庸俗化 17 n
+庸俗性 3 n
+庸俗进化 3 n
+庸医 34 n
+庸医杀人 3 n
+庸品 3 n
+庸夫 3 n
+庸夫俗子 3 n
+庸容大度 3 i
+庸常 6 a
+庸庸碌碌 18 z
+庸才 49 n
+庸材 3 n
+庸民 3 n
+庸碌 29 a
+庸者 8 n
+庸耳俗目 3 i
+庸见 3 a
+庸言 3 n
+庸言庸行 3 i
+庸识 3 n
+庹 31 nr
+庹宗华 256 nr
+庹宗康 256 nr
+庼 2 zg
+庾 65 zg
+庾亮记 3 nr
+庾信 18 nr
+庾太后 3 nr
+庾子山 2 nr
+庾季才 2 nr
+庾家村 3 nr
+庾开府 2 nr
+庾澄庆 3 nr
+庾肩吾 9 nr
+廁 2 zg
+廂 2 zg
+廄 3 zg
+廆 26 zg
+廉 471 nr
+廉一科 3 nr
+廉三世 8 nr
+廉为荣 3 nr
+廉义自立 2 nr
+廉二世 29 nr
+廉亲王 2 nr
+廉价 443 n
+廉价住所 3 n
+廉价出售 3 l
+廉价品 3 l
+廉价地 3 l
+廉价版 3 l
+廉价部 3 n
+廉剖 3 v
+廉可寄财 3 nr
+廉售 3 v
+廉售价 3 n
+廉售品 3 n
+廉四世 8 nr
+廉大怒 4 nr
+廉姆斯 2 nr
+廉宜 3 a
+廉川堡 8 nr
+廉希宪 5 nr
+廉希尔 38 nr
+廉引领 2 nr
+廉惠山 2 nr
+廉把剑 2 nr
+廉政 346 nr
+廉政公署 3 n
+廉政关 4 nr
+廉政勤政 3 nr
+廉政建设 3 l
+廉政文化 3 l
+廉政网 3 n
+廉政节 2 nr
+廉斯塔 8 nr
+廉斯敦 2 nr
+廉明 24 nr
+廉明公正 3 nr
+廉正 8 nr
+廉江 6 nr
+廉江县 3 nr
+廉江市 2 ns
+廉泉让水 3 nr
+廉洁 211 a
+廉洁从检 3 nr
+廉洁公道 3 l
+廉洁关 3 nr
+廉洁勤政 3 nr
+廉洁可风 3 l
+廉洁奉公 33 nr
+廉洁自律 72 l
+廉海玛 8 nr
+廉王子 2 nr
+廉皇帝 3 nr
+廉直 3 nr
+廉神兵 2 nr
+廉租 5 n
+廉租房 12 n
+廉署 4 v
+廉者 4 n
+廉耻 58 a
+廉耻心 3 l
+廉能 3 v
+廉能之 2 nr
+廉自中 2 nr
+廉节 3 n
+廉节者 2 n
+廉见连 2 nr
+廉让 3 v
+廉访休 3 l
+廉访司 2 n
+廉远堂高 3 nr
+廉隅 3 n
+廉顽立懦 3 nr
+廉颇 3 nr
+廉颇老矣 8 i
+廊 2745 ng
+廊台 3 ns
+廊坊 62 ns
+廊坊市 31 ns
+廊子 32 n
+廊庑 19 n
+廊庙 7 ns
+廊房 21 n
+廊房头条 3 n
+廊柱 34 n
+廊桥 15 ns
+廊桥遗梦 3 n
+廊檐 34 n
+廊道 28 n
+廋 2 zg
+廌 6 zg
+廑 8 g
+廒 17 g
+廓 174 zg
+廓大镜 3 nr
+廓尔喀 72 nr
+廓开大计 3 nr
+廓张 3 nr
+廓清 33 nr
+廓落 3 v
+廓达大度 3 nr
+廕 4 zg
+廖 388 nr
+廖世承 2 nr
+廖京生 3 nr
+廖仲凯 2 nr
+廖仲恺 61 nr
+廖伟雄 3 nr
+廖先旺 4 nr
+廖先生 6 nr
+廖公公 5 nr
+廖公弦 2 nr
+廖冰兄 6 nr
+廖化作先锋 2 nr
+廖化引 3 nr
+廖化欲 2 nr
+廖化至 2 nr
+廖叔安 2 nr
+廖国强 4 nr
+廖士贤 3 nr
+廖大亨 2 nr
+廖大珠 2 nr
+廖夫州 2 nr
+廖学秋 3 nr
+廖山涛 2 nr
+廖师叔 6 nr
+廖师弟 3 nr
+廖律师 3 nr
+廖志仁 3 nr
+廖思源 56 nr
+廖恒毅 3 nr
+廖承志 17 nr
+廖振云 4 nr
+廖文婷 3 nr
+廖昌永 4 nr
+廖晓义 3 nr
+廖晓华 3 nr
+廖有梁 3 nr
+廖本烟 4 nr
+廖永忠 11 nr
+廖永锁 2 nr
+廖汉生 8 nr
+廖浩然 2 nr
+廖淑萍 2 nr
+廖添丁 2 nr
+廖爱玲 5 nr
+廖瑞鸿 15 nr
+廖碧儿 3 nr
+廖礼钜 3 nr
+廖礼锴 3 nr
+廖秀冬 4 nr
+廖耀湘 33 nr
+廖育群 2 nr
+廖自砺 30 nr
+廖若一 2 nr
+廖若晨星 3 nr
+廖萦卫 40 nr
+廖藜壑 2 nr
+廖角嘴 3 nr
+廖锡龙 116 nr
+廖阅鹏 3 nr
+廖雪静 9 nr
+廖静文 2 nr
+廖鸿飞 3 nr
+廗 3 zg
+廙 2 zg
+廚 8 zg
+廛 12 g
+廝 2 zg
+廠 2 zg
+廡 2 zg
+廣 2 zg
+廨 76 g
+廪 77 g
+廬 2 zg
+廭 2 zg
+廱 5 zg
+廲 10 zg
+廴 46 zg
+廵 22 zg
+延 846 j
+延世大学 18 nt
+延世泽 3 nr
+延中 3 ns
+延休 3 v
+延伸 2586 v
+延伸卡环 3 nr
+延伸度 3 nr
+延伸性 6 nr
+延伸段 3 nr
+延伸率 3 nr
+延伸线 3 nr
+延佑 2 v
+延修 3 v
+延兴 5 ns
+延兴门 2 ns
+延到 3 v
+延医 2 v
+延吉 33 nr
+延吉市 16 ns
+延吉街 3 ns
+延后 3 nr
+延大喜 2 nr
+延安 1381 ns
+延安东路 7 ns
+延安地区 16 ns
+延安大学 8 nt
+延安市 24 ns
+延安抗大 2 ns
+延安文艺座谈会 34 nz
+延安窑洞 3 ns
+延安精神 3 nr
+延安自然科学院 3 nt
+延安路 14 ns
+延安鲁迅艺术学院 10 nt
+延宕 18 v
+延宕已久 3 nr
+延宕时日 3 nr
+延寿 70 nr
+延寿县 2 nr
+延展 36 v
+延展性 40 nr
+延川 4 ns
+延川县 3 ns
+延州 2 ns
+延巴克 2 nr
+延布 4 v
+延平 36 ns
+延平北路 3 ns
+延平区 3 ns
+延平南路 3 ns
+延平府 11 nr
+延平津 4 ns
+延平王 2 nr
+延平路 3 ns
+延平郡 7 nr
+延平郡王 22 nr
+延年益寿 44 n
+延庆 279 ns
+延庆县 27 ns
+延庆县政府 2 nt
+延徽寺 3 ns
+延性 12 n
+延恩侯 5 nr
+延报 3 v
+延拓 2 v
+延接 3 v
+延揽 16 v
+延揽人才 3 i
+延搁 11 v
+延日久 2 nr
+延时 49 ns
+延时器 2 nr
+延昌 4 ns
+延春阁 4 nr
+延朗 2 ns
+延期 359 v
+延期付款 3 n
+延水谣 2 nr
+延汉祀 2 nr
+延河 34 ns
+延河水 5 ns
+延津 313 ns
+延津之合 3 i
+延津人 7 nr
+延津剑合 3 nr
+延津北 2 ns
+延津县 9 ns
+延津好 2 nr
+延津姜 2 nr
+延津归 2 nr
+延津新 37 nr
+延津记 25 nr
+延津铁 11 nr
+延滞 11 v
+延炳玉 2 nr
+延烧 3 v
+延烧到 3 i
+延熙 9 nz
+延用 3 v
+延福寺 4 nr
+延秋镇 3 nr
+延秋门 10 nr
+延纳 4 ns
+延绥曰 2 nr
+延续 1369 v
+延续下去 3 i
+延续性 54 n
+延绳钓 2 nr
+延绵 23 nr
+延绵不断 3 i
+延缓 224 v
+延缓执行 3 nr
+延聘 11 v
+延胡索 21 nr
+延胡索酸 4 n
+延脑 3 n
+延臣父 2 nr
+延至 94 v
+延英殿 2 nr
+延营 4 ns
+延误 328 v
+延请 26 v
+延赛 3 ns
+延边 82 ns
+延边州 3 ns
+延边朝鲜族自治州 13 ns
+延边队 47 n
+延迟 197 v
+延迟时间 3 nr
+延迟线 11 nr
+延长 1229 v
+延长县 2 ns
+延长时间 3 n
+延长线 18 nr
+延陵 4 ns
+延陵生 2 nr
+延静里 2 nr
+延颈举踵 3 n
+延颈企踵 3 n
+延颈有企 3 n
+延颈跂踵 3 n
+延颈鹤望 3 n
+延髓 100 n
+廷 1300 g
+廷争面折 3 n
+廷尉 31 n
+廷布 3 nrt
+廷德尔 5 nrt
+廷杖 1129 n
+廷根 2 nrt
+廷素拉暖 2 nr
+廷试 3 n
+廷长 3 n
+廸 3 zg
+建 11608 v
+建三江 3 ns
+建业 117 n
+建业队 60 nt
+建中 56 v
+建中靖国 2 ns
+建义 2 n
+建之底 3 n
+建于 975 v
+建交 493 v
+建交国 32 nt
+建仓 3 v
+建元 93 nz
+建党 143 n
+建入 3 v
+建兰 2 ns
+建兴 49 vn
+建军 170 n
+建军节 12 n
+建出 3 v
+建初 3 t
+建制 1579 v
+建制镇 8 n
+建功 81 n
+建功立业 85 n
+建功立事 3 n
+建勤 2 n
+建华 342 nz
+建华区 3 nt
+建博 2 v
+建卡 7 n
+建厂 55 n
+建台 3 n
+建和 25 nz
+建园 15 n
+建国 3083 ns
+建国中学 3 nt
+建国以来 3 l
+建国初期 3 nz
+建国北路 3 nt
+建国大纲 3 nr
+建国工专 3 nt
+建国方略 3 n
+建国路 3 nz
+建国门 12 n
+建在 3 v
+建地 3 n
+建坪 3 n
+建基 3 nz
+建堤 3 n
+建外 24 vn
+建大 9 nt
+建好 3 v
+建始 11 v
+建始县 260 ns
+建委 31 j
+建威 8 n
+建宁 112 nz
+建宁公主 3 n
+建宁县 2 ns
+建宁路 3 nz
+建宇 3 n
+建安 318 nz
+建安国小 3 nt
+建安风骨 5 n
+建州 3 ns
+建州卫 19 nz
+建巢 3 n
+建工 664 vn
+建帐备查 3 n
+建平 528 n
+建平县 2 ns
+建康 206 nz
+建德 91 nrt
+建德县 2 ns
+建德市 4 ns
+建恒 2 v
+建成 6215 v
+建成区 19 n
+建成投产 3 j
+建户 3 n
+建房 128 n
+建房款 3 n
+建所 3 j
+建政 35 n
+建教合作 3 n
+建文 98 nz
+建文帝 168 nr
+建新 36 v
+建新厂 3 n
+建昌 18 ns
+建昌县 7 ns
+建明 2 v
+建春 3 vn
+建有 2610 v
+建材 831 n
+建材业 8 n
+建材价格 3 n
+建材厂 3 n
+建材城 3 n
+建材局 3 n
+建材工业 3 n
+建材市场 3 n
+建材机械 3 n
+建材网 3 nz
+建材行 3 n
+建材行业 3 n
+建材装饰 3 n
+建材设备 3 n
+建材超市 3 nr
+建构 145 n
+建构主义 3 n
+建树 215 n
+建校 68 n
+建档 7 n
+建档立卡 2 v
+建档费 2 v
+建桥 222 n
+建模 50 n
+建模语言 2 n
+建武 74 n
+建水 17 n
+建水县 3 ns
+建河 3 ns
+建法 3 n
+建湖 5 ns
+建湖县 2 ns
+建漆 2 n
+建炎 67 n
+建物 3 n
+建瓯 29 n
+建瓯县 3 ns
+建瓯市 4 ns
+建瓴高屋 3 v
+建研会 3 nt
+建福宫 2 nr
+建立 23118 v
+建立健全 3 nr
+建立相应 2 i
+建立联系 4 n
+建站 3 n
+建站网 3 n
+建章 26 n
+建章立 3 nr
+建章立制 4 n
+建筑 14397 n
+建筑业 1156 n
+建筑光学 3 n
+建筑创作 3 n
+建筑制图 3 n
+建筑功能 3 n
+建筑勘探 3 n
+建筑受潮 3 n
+建筑史 38 n
+建筑商 4 n
+建筑图 3 n
+建筑壁画 3 n
+建筑声学 3 n
+建筑学 131 n
+建筑学家 9 n
+建筑安全 3 n
+建筑安装 3 n
+建筑家 12 n
+建筑工人 3 n
+建筑工地 3 n
+建筑工程 17 n
+建筑师 337 n
+建筑文脉 3 n
+建筑施工 4 n
+建筑机械 4 n
+建筑材料 14 n
+建筑构造 3 n
+建筑模数 3 n
+建筑物 1147 n
+建筑用 37 n
+建筑界 12 n
+建筑病理 3 n
+建筑立法 3 n
+建筑策划 3 n
+建筑系 34 n
+建筑细部 3 n
+建筑维护 3 n
+建筑缺陷 3 n
+建筑网 3 n
+建筑署 2 n
+建筑群 1756 n
+建筑者 20 n
+建筑节能 3 n
+建筑行业 3 n
+建筑装修 3 n
+建筑设备 3 n
+建筑设施 3 n
+建筑设计 15 n
+建筑评价 3 n
+建筑诊断 3 n
+建筑造型 3 n
+建筑间距 3 n
+建筑队 21 n
+建筑防火 3 n
+建筑隐喻 3 n
+建筑隔热 3 n
+建筑面积 88 n
+建筑风格 3 n
+建管 5 vn
+建管局 3 nt
+建管用 3 n
+建管站 3 nt
+建网 12 nz
+建网站 3 n
+建置 3 v
+建莲 3 n
+建蔽率 3 n
+建行 201 v
+建行就 3 n
+建行河南省分行 2 nt
+建言 60 n
+建言献策 14 n
+建议 9327 n
+建议书 43 n
+建议价 3 n
+建议信 3 nt
+建议性 3 n
+建议您 3 nr
+建议权 7 n
+建议案 9 n
+建议稿 2 n
+建议者 6 n
+建设 26381 vn
+建设厅 18 nt
+建设厅长 3 nr
+建设史 14 n
+建设司 5 nt
+建设周期 3 n
+建设场址 3 n
+建设局 6 nt
+建设工程 21 n
+建设性 241 n
+建设成就 3 i
+建设期 7 n
+建设祖国 3 n
+建设繁荣 3 i
+建设网 3 nt
+建设者 82 n
+建设费 17 n
+建设路 517 nt
+建设部 88 nt
+建设部门 7 n
+建设银行 55 nt
+建设项目 35 n
+建账 3 v
+建起 426 v
+建路 8 n
+建达 5 nz
+建造 3683 v
+建造业 3 n
+建造师 3 n
+建造成 3 n
+建邦 3 n
+建邺区 2 nr
+建部 38 n
+建都 860 n
+建都于 3 n
+建里 3 nrt
+建阳 18 ns
+建阳县 2 ns
+建阳市 2 ns
+建院 3 n
+建除 3 v
+建陵 4 n
+建陶 3 vn
+建隆 28 nz
+建面 3 n
+建馆 3 n
+廽 2 zg
+廾 13 zg
+廿 9 m
+廿一 2 m
+廿一名 3 m
+廿一日 2 m
+廿一枝 2 m
+廿一点 2 m
+廿七 2 m
+廿七日 2 m
+廿万 2 m
+廿三 17 m
+廿三日 5 m
+廿九 6 m
+廿九日 7 m
+廿二 19 m
+廿二号 2 m
+廿二年 2 m
+廿二日 3 m
+廿五 10 m
+廿五年 2 m
+廿五日 2 m
+廿八 29 m
+廿八天 2 m
+廿八年 3 m
+廿八日 3 m
+廿六 3 m
+廿六日 13 m
+廿刀 2 m
+廿四 37 m
+廿四个 6 m
+廿四岁 2 m
+廿四日 6 m
+廿多年 2 m
+廿年 5 m
+开 27900 v
+开一开 3 v
+开上 3 v
+开上去 3 v
+开上来 3 v
+开下 3 v
+开不动 3 v
+开业 629 n
+开业典礼 3 nz
+开业庆典 3 ns
+开业者 3 n
+开个贴 3 n
+开了个 3 n
+开了花 3 i
+开了门 3 l
+开云见天 3 i
+开云见日 3 i
+开交 3 v
+开仗 3 v
+开价 47 v
+开伙 5 v
+开会 1302 v
+开会地点 3 n
+开会时间 3 l
+开会研究 3 n
+开会研讨 3 n
+开会讨论 3 n
+开低 3 v
+开低走高 3 n
+开作 3 v
+开例 3 n
+开俱 3 nz
+开倒车 5 l
+开停 3 v
+开元 379 nz
+开元区 13 n
+开元寺 30 ns
+开先 3 v
+开光 13 v
+开光期 2 n
+开入 3 v
+开关 360 v
+开关厂 3 n
+开关损耗 3 l
+开关插座 3 l
+开关时间 3 l
+开关曲面 3 l
+开关机 3 l
+开关柜 3 n
+开关电流 3 l
+开关电源 3 l
+开关电路 3 l
+开关站 4 n
+开关网络 3 n
+开关设备 3 n
+开关门 3 ns
+开具 80 v
+开冬 3 v
+开冻 8 v
+开出 785 v
+开凿 344 v
+开刀 110 v
+开刀室 3 n
+开刀房 3 v
+开刀手术 3 l
+开刃 3 n
+开列 63 v
+开列于后 3 i
+开创 1741 v
+开创局面 3 n
+开创性 83 n
+开创者 48 n
+开利除害 3 l
+开到 3 v
+开剖 3 v
+开办 674 v
+开办者 3 n
+开办费 6 n
+开动 135 v
+开动机器 3 l
+开动率 3 n
+开动脑筋 3 n
+开包 3 v
+开化 87 v
+开化党 3 n
+开化县 2 ns
+开匙 3 n
+开区间 3 n
+开华结果 3 nz
+开单 26 n
+开单子 3 l
+开印 3 v
+开卷 50 v
+开卷有益 5 l
+开卷考试 3 i
+开厂 3 n
+开原 37 ns
+开原县 3 ns
+开原市 4 ns
+开去 439 v
+开县 39 ns
+开叉 3 v
+开反 3 v
+开发 10022 v
+开发业 4 n
+开发人员 36 n
+开发储量 3 n
+开发利用 3 l
+开发办 4 nz
+开发包 3 n
+开发区 3667 n
+开发区热 17 n
+开发史 4 n
+开发周期 3 n
+开发商 376 n
+开发型 261 n
+开发局 12 nt
+开发层系 3 l
+开发工具 34 l
+开发式 7 n
+开发性 12 n
+开发成本 2 l
+开发技术 7 n
+开发新 20 nz
+开发方式 3 nz
+开发方法 10 nz
+开发智力 2 l
+开发权 20 n
+开发板 3 n
+开发热 3 nz
+开发票 3 n
+开发署 14 n
+开发者 64 n
+开发计划 6 n
+开发计划署 24 nt
+开发设计 2 i
+开发费 2 n
+开发资源 3 n
+开发软件 4 l
+开发进展 3 nz
+开发进度 3 n
+开发部 21 nt
+开发量 11 n
+开发钻井 3 nz
+开发阶段 2 n
+开口 1466 n
+开口印模 3 n
+开口呼 3 v
+开口处 11 n
+开口子 13 n
+开口比 3 ns
+开口笑 3 l
+开口见心 3 i
+开口见胆 3 i
+开口销 3 v
+开口闭口 12 n
+开口饭 3 n
+开叫 3 v
+开台 2 v
+开台锣鼓 3 i
+开号 3 n
+开司米 10 n
+开合 66 v
+开合自如 3 i
+开吊 3 v
+开后门 20 n
+开向 3 v
+开启 399 v
+开唐林 3 nz
+开售 3 v
+开唱 4 v
+开嘴 3 v
+开回 3 v
+开回去 3 l
+开园 3 ns
+开国 2525 ns
+开国元勋 3 n
+开国元老 3 n
+开国功臣 3 n
+开国大典 3 ns
+开国承家 3 l
+开国纪念 3 n
+开在 3 v
+开地 3 n
+开场 212 n
+开场仅 3 l
+开场戏 5 v
+开场白 218 v
+开场锣鼓 3 l
+开坏 3 v
+开坯 3 n
+开垦 262 v
+开垦地 3 n
+开垦费 3 n
+开城 106 ns
+开埠 3 ns
+开基创业 7 nz
+开基立业 3 n
+开堂 3 n
+开堞眼 3 v
+开塞露 3 nz
+开壳 3 n
+开外 81 v
+开夜车 10 l
+开大 3 v
+开天窗 2 nz
+开天辟地 78 i
+开头 594 v
+开头难 3 l
+开契 3 v
+开奖 142 nz
+开奖号码 3 n
+开好 3 v
+开好局 3 n
+开始 38139 v
+开始懂了 3 l
+开始曲 2 n
+开始查找 3 l
+开始符号 3 n
+开始菜单 3 n
+开始运行 6 l
+开始运转 6 l
+开学 229 n
+开学典礼 3 nz
+开学日 3 n
+开完 3 v
+开宗 3 nz
+开宗大师 3 i
+开宗明义 18 i
+开宗立派 3 n
+开宝 45 nz
+开审 21 v
+开家饰 3 n
+开导 153 v
+开封 1696 v
+开封人 17 n
+开封县 13 ns
+开封市 43 ns
+开封府 188 ns
+开封战役 3 nz
+开射 3 v
+开小 3 v
+开小差 49 n
+开小灶 7 l
+开尔文 54 nz
+开局 496 n
+开屏 35 n
+开展 6910 v
+开展业务 3 n
+开展批评 3 l
+开展活动 3 l
+开展调查 3 l
+开展调研 3 n
+开山 164 ns
+开山始祖 3 ns
+开山祖 3 ns
+开山祖师 12 n
+开山老祖 3 i
+开山鼻祖 4 ns
+开工 874 v
+开工典礼 3 nz
+开工日期 3 nz
+开工率 4 n
+开市 24 v
+开市价 3 v
+开席 17 v
+开幕 596 v
+开幕会 3 n
+开幕典礼 3 n
+开幕式 360 n
+开幕礼 3 n
+开幕词 201 n
+开幕辞 4 n
+开平 253 ns
+开平区 3 ns
+开平县 3 ns
+开平市 2 ns
+开平方 3 n
+开平案 3 n
+开年以来 3 l
+开店 166 n
+开府 88 n
+开庭 127 n
+开庭审判 3 n
+开庭审理 3 n
+开庭日 3 n
+开建 32 v
+开开 113 v
+开开停停 3 v
+开开关关 3 l
+开开心 9 l
+开开心心 10 i
+开开眼 3 l
+开式 17 n
+开弓 26 nz
+开张 193 v
+开张大吉 3 i
+开彩 3 n
+开往 200 v
+开征 30 v
+开得 3 v
+开心 487 v
+开心丸儿 3 i
+开心务必 3 i
+开心年 3 n
+开心很难 3 z
+开心果 6 n
+开心玩 3 n
+开心见肠 3 i
+开心见胆 3 i
+开心见诚 3 l
+开心起来 3 l
+开心辞典 3 i
+开心颜 6 i
+开快 3 v
+开快车 2 l
+开怀 64 v
+开怀一笑 3 l
+开怀大笑 36 l
+开怀畅饮 3 i
+开恩 150 v
+开悟 3 v
+开戏 3 v
+开成 48 v
+开戒 2 v
+开战 279 v
+开户 64 n
+开户名 3 n
+开户数 11 n
+开户者 3 n
+开户行 4 n
+开户费 3 n
+开户银行 3 n
+开房 6 n
+开房率 2 n
+开房间 3 n
+开打 57 v
+开抵 3 v
+开拆 14 v
+开拍 23 v
+开拓 1194 v
+开拓创新 3 l
+开拓前进 3 l
+开拓史 3 n
+开拓型 7 n
+开拓市场 3 n
+开拓性 37 n
+开拓精神 3 i
+开拓者 100 n
+开拓者队 3 n
+开拓进取 70 l
+开拔 75 v
+开挖 404 v
+开掌 3 v
+开掘 84 v
+开播 40 v
+开支 1012 v
+开支票 3 n
+开放 8332 v
+开放剂 3 nz
+开放区 65 n
+开放地带 3 nz
+开放型 29 nz
+开放市场 4 n
+开放平台 3 nz
+开放度 9 n
+开放式 219 nz
+开放式系统 2 l
+开放性 90 n
+开放搞活 3 vn
+开放政策 3 n
+开放日 64 nz
+开放注册 3 nz
+开放源码 3 n
+开放电路 3 nz
+开放系统 3 l
+开敞 25 a
+开敞空间 3 l
+开斋 9 v
+开斋节 31 t
+开新服 3 nz
+开新贴 3 n
+开方 64 n
+开方子 7 n
+开方根 3 nz
+开时 299 v
+开旷 3 a
+开明 306 v
+开明人士 3 ns
+开明派 3 n
+开映 3 v
+开映射 3 n
+开春 60 ns
+开春大吉 3 ns
+开普勒 53 nz
+开普敦 129 ns
+开普省 14 ns
+开普顿 3 ns
+开曼 59 ns
+开曼群岛 3 ns
+开有 3 v
+开朗 238 ns
+开本 12 ns
+开机 104 n
+开杀戒 3 n
+开杆 2 n
+开来 1178 v
+开来开去 3 l
+开来继往 3 i
+开枪 377 v
+开架 13 v
+开架式 18 n
+开柙出虎 3 nz
+开标 8 v
+开栏 2 v
+开档 3 v
+开桶 3 n
+开棉机 3 n
+开棺验尸 3 i
+开榫机 2 n
+开槽 4 v
+开槽机 3 n
+开歇业 3 n
+开步 3 v
+开步走 3 l
+开段 3 n
+开水 333 v
+开水器 3 n
+开水壶 2 n
+开水房 3 n
+开水烫 3 l
+开水瓶 3 n
+开江 14 ns
+开江县 11 ns
+开沟 35 ns
+开河 28 ns
+开法 3 v
+开泰 10 nz
+开洋 5 ns
+开洋荤 3 n
+开洞 3 ns
+开浸入 3 n
+开消 3 v
+开涮 30 v
+开港 3 ns
+开源 70 n
+开源节流 19 n
+开溜 23 v
+开满 3 v
+开滦 32 ns
+开滦煤矿 23 nt
+开演 19 v
+开火 99 v
+开灯 14 v
+开炉 7 v
+开炮 129 n
+开点 3 n
+开炼机 3 n
+开牌 3 v
+开物成务 3 n
+开特 3 ns
+开犁 2 ns
+开状 3 nz
+开玩笑 724 v
+开环 31 ns
+开现场会 3 n
+开班 31 v
+开班式 3 nz
+开球 66 n
+开瓶 3 n
+开瓶器 3 nz
+开瓶费 3 n
+开疆 3 ns
+开疆展土 3 n
+开疆拓土 72 i
+开疆拓境 3 n
+开疆拓宇 3 n
+开疆辟土 4 i
+开白 19 v
+开白条 3 n
+开皇 89 nz
+开盘 148 v
+开盘价 9 n
+开直 3 v
+开盾 3 n
+开眉展眼 3 l
+开眉笑眼 3 i
+开眼 54 v
+开眼界 3 n
+开着车 3 l
+开睿 3 nrt
+开矿 47 v
+开示 5 v
+开票 16 n
+开票所 3 n
+开禁 37 v
+开福区 3 ns
+开禧 9 nrt
+开离 3 v
+开科取士 3 l
+开秤 3 n
+开窍 125 v
+开窗 46 n
+开窗口 3 i
+开窗子 3 i
+开立 46 v
+开立方 3 n
+开站 3 n
+开端 470 n
+开笔 3 v
+开笼 3 v
+开筑 3 v
+开筵 3 n
+开管 3 v
+开箱 31 n
+开篇 89 n
+开篇伊始 3 l
+开粥铺 3 l
+开线 3 n
+开组 3 vn
+开结 3 v
+开给 3 v
+开绽 3 n
+开绿灯 14 n
+开编 3 v
+开缺 3 v
+开罐器 3 n
+开网 3 v
+开罗 468 nz
+开罗会议 3 nz
+开罗宣言 3 nz
+开罚单 3 n
+开罪 3 v
+开置 3 v
+开美石 3 ns
+开聊 3 v
+开胃 301 v
+开胃菜 3 n
+开胃酒 3 v
+开胶 3 n
+开脱 123 v
+开脱罪责 3 i
+开脸 3 v
+开腔 26 n
+开腹 12 n
+开膛 65 n
+开膛手 3 n
+开航 39 v
+开船 63 v
+开花 396 n
+开花季 3 l
+开花期 16 n
+开花结实 14 i
+开花结果 41 n
+开苞 3 v
+开荒 99 v
+开荤 3 v
+开药 18 v
+开药方 3 nz
+开营 15 v
+开蒙 3 v
+开行 110 v
+开衩 3 n
+开衩口 3 vn
+开衫 2 n
+开裂 143 v
+开裆 3 n
+开裆裤 19 n
+开襟 15 n
+开襟毛衣 3 i
+开解 10 v
+开言 3 v
+开训 3 v
+开训典礼 3 nz
+开议 3 v
+开记 3 v
+开讲 14 v
+开设 935 v
+开证 3 v
+开诊 13 v
+开诚 4 v
+开诚布公 48 n
+开诚相见 3 i
+开说 3 v
+开课 15 v
+开课日期 3 n
+开课时间 3 n
+开豁 11 a
+开账 3 v
+开赌 3 v
+开赛 185 vn
+开走 72 v
+开赴 243 v
+开起 46 v
+开起炮来 3 l
+开足 3 v
+开足马力 29 i
+开跑 3 v
+开路 97 n
+开路人 3 n
+开路先锋 17 n
+开路机 3 n
+开路神 4 n
+开路线 3 n
+开路终端 3 l
+开踢 3 i
+开车 496 v
+开车法 3 n
+开转 3 v
+开辟 2131 v
+开辟出来 3 l
+开辟记 3 i
+开辟通路 3 l
+开边 3 n
+开达 3 v
+开过 3 v
+开运 32 v
+开近 3 v
+开进 248 v
+开进去 3 v
+开远 25 nz
+开远市 7 ns
+开选 3 v
+开通 1404 v
+开造 3 v
+开遍 3 v
+开道 76 v
+开郎 3 n
+开都河 15 ns
+开采 1416 v
+开采业 15 n
+开采区 7 n
+开采权 17 n
+开采法 3 n
+开采量 40 n
+开释 23 v
+开金 20 n
+开金口 3 n
+开钻 3 nz
+开铺 3 n
+开销 171 v
+开锁 3 v
+开锁匠 3 n
+开锁器 3 l
+开锄 3 v
+开锅 10 v
+开锣 11 v
+开锣喝道 3 l
+开锣戏 3 l
+开镜 2 nz
+开镰 3 v
+开门 970 v
+开门七件 3 nz
+开门七件事 2 l
+开门办学 3 l
+开门受徒 3 n
+开门延盗 3 i
+开门捐盗 3 i
+开门揖盗 4 vn
+开门机 3 n
+开门红 43 l
+开门见喜 3 l
+开门见山 146 i
+开门迎盗 3 i
+开闭 3 v
+开间 17 n
+开闸 74 v
+开闸放水 3 n
+开阔 590 v
+开阔地 27 i
+开阔性 3 n
+开阔眼界 3 i
+开阔视野 3 i
+开阖大气 3 z
+开阳 35 ns
+开阳县 5 ns
+开阶立极 3 n
+开除 486 v
+开除党籍 3 n
+开除公职 3 nz
+开雾睹天 3 l
+开面冠 3 n
+开颅 34 n
+开题 9 n
+开颜 3 nrt
+开颜大笑 3 l
+开饭 61 v
+开馆 90 n
+开馆子 3 n
+开首 3 v
+开驶 3 v
+开骂 3 v
+开高 3 v
+开高走低 3 i
+开鲁 3 nz
+开鲁县 5 ns
+开麦拉 3 ns
+开黑店 8 ns
+弁 207 g
+异 3455 zg
+异丁烯 16 nz
+异丁烷 12 nz
+异丁醇 3 nz
+异丙嗪 10 n
+异丙基 5 nz
+异丙苯 11 nz
+异丙醇 10 nz
+异义 3 n
+异乎寻常 116 i
+异乡 85 n
+异乡人 13 n
+异事 3 n
+异于 3 d
+异交 3 b
+异亮氨酸 4 nz
+异人 3 n
+异人馆 3 n
+异众 3 n
+异位 49 n
+异位涎腺 3 n
+异位症 13 n
+异体 66 n
+异体字 18 n
+异俗 3 a
+异像 3 n
+异养生物 3 n
+异兽 19 n
+异军特起 3 l
+异军突起 75 i
+异动 54 a
+异动股 3 n
+异动表 3 n
+异化 182 n
+异化作用 4 n
+异化理论 3 n
+异卉奇花 3 n
+异变 3 n
+异口同声 101 i
+异口同音 3 n
+异口同韵 3 n
+异同 237 a
+异名 18 a
+异名同实 3 i
+异味 80 n
+异国 158 n
+异国他乡 40 l
+异国恋 3 n
+异国情调 3 l
+异国情趣 3 n
+异国风光 3 nz
+异图 7 n
+异地 184 n
+异地相逢 3 i
+异地而处 3 i
+异型 37 b
+异型件 3 n
+异型材 3 n
+异域 85 n
+异域传奇 3 n
+异士 3 n
+异姓 157 n
+异宝奇珍 3 i
+异客 4 n
+异己 112 n
+异己分子 3 n
+异已 3 d
+异常 3360 d
+异常中断 3 i
+异常低压 3 n
+异常情况 3 n
+异常现象 3 n
+异常者 5 n
+异形 80 n
+异形字 3 n
+异形词 3 i
+异形钢材 3 n
+异形钢管 3 n
+异彩 63 a
+异彩纷呈 22 i
+异径管 3 n
+异心 73 n
+异志 3 n
+异念 3 n
+异态 3 n
+异性 326 n
+异性体 3 n
+异性恋 3 n
+异性相吸 3 l
+异想 3 n
+异想天开 86 i
+异戊二烯 34 nz
+异戊巴比妥 2 nz
+异戊橡胶 7 n
+异或 8 d
+异或门 3 d
+异才 5 n
+异抗坏血酸钠 8 n
+异搏定 3 n
+异教 34 nz
+异教徒 88 n
+异数 3 n
+异文 34 n
+异族 152 n
+异族人 9 n
+异族通婚 3 n
+异日 3 n
+异时空 3 n
+异曲同工 65 n
+异服 3 n
+异木奇花 3 i
+异本 3 a
+异术 3 n
+异极矿 3 n
+异构 117 n
+异构体 161 n
+异构化 3 n
+异构计算 3 n
+异构酶 2 n
+异柄 3 n
+异样 311 d
+异核去偶 3 l
+异核现象 3 n
+异次元 3 nz
+异步 49 d
+异步刷新 3 nz
+异步控制 2 n
+异步电动 3 l
+异步电机 3 n
+异步算法 3 n
+异母 3 n
+异母兄弟 3 n
+异民族 3 nz
+异氰酸 3 nz
+异氰酸酯 7 nz
+异涂同归 3 i
+异烟肼 13 n
+异熟 3 a
+异父 3 n
+异物 191 n
+异物感 25 n
+异状 96 n
+异玉奇珍 3 i
+异界篇 3 b
+异相 25 d
+异禀 3 v
+异种 83 n
+异突触 3 n
+异端 191 n
+异端邪说 12 i
+异类 50 n
+异类相吸 3 l
+异能 26 n
+异能者 3 n
+异腈 3 n
+异花传粉 10 n
+异草奇花 3 i
+异行 3 n
+异裂反应 3 l
+异装癖 3 n
+异见 27 a
+异言 24 n
+异议 462 n
+异议书 3 n
+异议人 3 n
+异议人士 3 n
+异词 3 n
+异说 17 n
+异读 10 v
+异质 31 n
+异质性 8 n
+异趣 23 a
+异趣横生 3 i
+异路同归 3 i
+异辛烷 6 nz
+异途 3 n
+异途同归 3 i
+异邦 20 n
+异重流 2 n
+异闻 3 n
+异闻传说 3 n
+异闻录 3 n
+异面反应 3 l
+异音 3 n
+异香 70 n
+异香扑鼻 3 i
+异黄酮 10 n
+弃 1441 vg
+弃世 3 v
+弃义倍信 3 i
+弃之不顾 3 i
+弃之可惜 7 i
+弃之如敝 3 i
+弃之度外 3 i
+弃之敝屣 3 l
+弃书捐剑 3 i
+弃伪从真 3 i
+弃儿 17 n
+弃公营私 3 n
+弃兵 3 n
+弃其馀鱼 3 v
+弃养 2 v
+弃取 3 v
+弃同即异 3 i
+弃城而逃 3 i
+弃好背盟 3 i
+弃如敝屣 3 l
+弃妇 18 n
+弃妻女于 3 l
+弃婴 23 n
+弃子 3 n
+弃学 3 n
+弃守 3 v
+弃官 3 n
+弃家 3 n
+弃家经商 3 n
+弃家荡产 3 l
+弃市 28 v
+弃恶从善 2 i
+弃恶扬善 3 i
+弃情遗世 3 i
+弃掷 3 v
+弃故揽新 3 l
+弃文从武 3 i
+弃文存质 3 l
+弃文就武 5 i
+弃旧 3 v
+弃旧图新 4 i
+弃旧怜新 3 l
+弃旧投新 3 i
+弃旧迎新 3 l
+弃明投暗 3 i
+弃易求难 3 i
+弃智遗身 3 i
+弃暗投明 21 i
+弃末反本 3 l
+弃末返本 3 l
+弃本求末 3 i
+弃本逐末 3 i
+弃权 722 n
+弃权票 122 n
+弃械投降 3 l
+弃械逃亡 3 n
+弃物 21 n
+弃瑕取用 3 nz
+弃瑕录用 3 v
+弃瑕忘过 3 n
+弃甲 3 n
+弃甲丢盔 3 n
+弃甲倒戈 3 i
+弃甲投戈 3 i
+弃甲曳兵 3 n
+弃甲负弩 3 n
+弃短取长 3 i
+弃短就长 3 l
+弃短用长 3 l
+弃笔从戎 3 i
+弃绝 14 v
+弃置 26 v
+弃置不用 3 l
+弃置不管 3 l
+弃耕 2 v
+弃职潜逃 3 i
+弃船 3 n
+弃艇 3 n
+弃若弊屣 3 n
+弃若敝屣 3 l
+弃车走林 3 i
+弃过图新 3 l
+弃逆归顺 3 i
+弃道任术 3 n
+弃邪从正 3 i
+弃邪归正 5 i
+弄 5784 v
+弄不好 3 v
+弄不清 3 i
+弄乱 3 v
+弄乾 3 ns
+弄份 3 n
+弄伤 3 v
+弄低 3 v
+弄倒 3 v
+弄假 3 v
+弄假成真 15 i
+弄僵 10 v
+弄兵 3 n
+弄兵潢池 3 v
+弄出 3 v
+弄出去 3 i
+弄出来 3 i
+弄到手 3 i
+弄反 3 v
+弄口 3 n
+弄口鸣舌 3 i
+弄嘴弄舌 3 i
+弄回 3 v
+弄坏 3 v
+弄坏了 3 i
+弄垮 10 v
+弄堂 262 n
+弄奸 3 v
+弄姿 3 n
+弄完 3 v
+弄巧反拙 18 i
+弄巧成拙 47 i
+弄平 3 n
+弄弄 3 v
+弄弄坪 3 ns
+弄弯 3 v
+弄影团风 3 i
+弄得好 3 v
+弄得清 3 i
+弄性尚气 3 i
+弄懂 48 v
+弄成 3 v
+弄成一团 3 i
+弄扁 3 n
+弄掉 3 v
+弄散 3 v
+弄斜 3 v
+弄斤操斧 3 i
+弄斧班门 3 n
+弄断 3 v
+弄月吟风 3 i
+弄月嘲风 3 i
+弄权 54 n
+弄来弄去 3 i
+弄棍舞刀 3 i
+弄死 3 v
+弄水 3 n
+弄污 3 v
+弄汤 3 n
+弄法 3 n
+弄法舞文 3 i
+弄混 3 v
+弄清 362 v
+弄清事实 3 i
+弄清原因 3 n
+弄清情况 3 n
+弄清楚 3 i
+弄清问题 3 n
+弄湿 3 v
+弄溼 3 v
+弄潮 7 n
+弄潮儿 22 n
+弄熄 3 n
+弄狮 3 n
+弄玉 3 n
+弄玉吹箫 3 n
+弄璋 3 v
+弄璋之喜 3 v
+弄瓦 3 n
+弄瓦之喜 3 i
+弄皱 3 n
+弄直 3 v
+弄眉挤眼 3 i
+弄短 3 v
+弄硬 3 v
+弄碎 3 v
+弄神弄鬼 3 i
+弄竹弹丝 3 n
+弄笔 3 n
+弄管调弦 3 i
+弄粉调朱 3 n
+弄粗 3 n
+弄糟 3 n
+弄绉 3 n
+弄缺 3 v
+弄翻 3 v
+弄脏 3 n
+弄脏了 3 i
+弄臣 12 n
+弄舌 3 n
+弄虚作假 112 i
+弄虚作假者 12 i
+弄通 3 v
+弄酒 3 v
+弄醒 3 v
+弄钱 3 v
+弄错 118 v
+弄险 3 n
+弄饭 3 v
+弄鬼 46 n
+弄鬼妆幺 3 n
+弄鬼弄神 3 i
+弄鬼掉猴 3 v
+弇 24 zg
+弈 53 vg
+弈具 3 n
+弈棋 29 n
+弉 4 zg
+弊 550 n
+弊多利少 3 n
+弊大于利 3 n
+弊害 9 n
+弊少利多 3 n
+弊帚千金 3 n
+弊帚自珍 3 n
+弊恶 3 n
+弊政 3 n
+弊源 3 n
+弊病 159 n
+弊窦 3 n
+弊端 436 n
+弊绝风清 3 n
+弊衣疏食 3 n
+弊衣箪食 3 vn
+弊衣蔬食 3 vn
+弊车羸马 3 vn
+弊车赢马 3 n
+弋 41 ns
+弋腔 3 n
+弋获 3 n
+弋阳 26 ns
+弋阳县 3 ns
+弋阳腔 29 n
+弌 2 zg
+弍 2 zg
+弎 3 zg
+式 12938 k
+式作业 3 n
+式子 31 n
+式微 49 v
+式打印机 12 n
+式样 274 n
+式样翻新 3 n
+式电流 3 n
+式调度 6 n
+式送 3 v
+弑 130 zg
+弑君 30 v
+弑君大罪 3 v
+弑父 11 v
+弒 7 zg
+弓 1020 v
+弓一箭 2 nr
+弓上射 2 nr
+弓上弦 9 nr
+弓亚纲 3 nr
+弓体 3 n
+弓力 5 n
+弓劲弩 5 nr
+弓发矢 2 nr
+弓取箭 8 nr
+弓和弩 2 nr
+弓和箭 2 nr
+弓在弦 2 nr
+弓太软 2 nr
+弓子 12 nr
+弓小箭 4 nr
+弓开满 2 nr
+弓式 2 n
+弓弦 79 nr
+弓弦乐器 3 n
+弓弦勒 2 nr
+弓弦响 9 nr
+弓弩 101 nr
+弓弩手 72 n
+弓弯 2 n
+弓强弩 3 nr
+弓形 47 n
+弓形虫 3 n
+弓影杯蛇 3 n
+弓影浮杯 3 n
+弓手 3 n
+弓折刀尽 3 nr
+弓折箭尽 3 nr
+弓拉奏 6 nr
+弓月城 2 nr
+弓未拉 2 nr
+弓杆 3 n
+弓杠岭 2 nr
+弓杯蛇影 3 n
+弓步 12 n
+弓法 3 n
+弓注矢 2 nr
+弓激波 2 nr
+弓状 3 n
+弓着腰 3 n
+弓短箭 2 nr
+弓石燕 3 nr
+弓箭 422 n
+弓箭手 82 n
+弓箭步 13 n
+弓纵马 2 nr
+弓羽箭 2 nr
+弓背 3 nr
+弓腰 34 n
+弓调马服 3 nr
+弓起 3 nr
+弓身 26 n
+弓身拔 2 n
+弓锯 2 n
+弓长岭 3 nr
+弓长岭区 3 n
+弓长箭 4 nr
+弓阿帕 13 nr
+弓鞋 9 n
+弓马显 2 nr
+弓马熟 7 nr
+弓鱼 3 n
+弔 3 zg
+引 5550 v
+引上 3 v
+引上去 3 v
+引上来 3 v
+引下 3 v
+引下去 3 v
+引下来 3 v
+引为 3 v
+引为鉴戒 2 i
+引产 26 v
+引人 3 n
+引人入胜 106 i
+引人关注 30 l
+引人注意 19 i
+引人注目 658 i
+引人深思 9 i
+引人瞩目 12 i
+引人遐思 3 l
+引介 2 v
+引以 3 v
+引以为傲 3 i
+引以为憾 3 i
+引以为戒 31 i
+引以为耻 3 i
+引以为自豪 11 l
+引以为荣 17 i
+引以为豪 20 l
+引以为鉴 5 i
+引以自豪 17 l
+引伸 3 v
+引伸义 2 l
+引伸出 3 i
+引伸到 3 l
+引伸触类 3 i
+引体向上 3 l
+引作 3 v
+引例 3 n
+引信 331 v
+引儿 3 n
+引入 1111 v
+引入歧途 11 i
+引出 273 v
+引出去 3 v
+引出来 3 v
+引到 3 v
+引力 420 n
+引力场 71 n
+引力定律 3 l
+引力常量 3 n
+引力模式 3 l
+引力波 24 n
+引力能 4 n
+引力质量 3 n
+引动 50 v
+引去 3 v
+引发 1697 v
+引发出 3 i
+引取 3 v
+引古喻今 3 l
+引古证今 3 l
+引号 57 n
+引向 215 v
+引吭 38 v
+引吭悲歌 3 i
+引吭高唱 3 i
+引吭高声 3 i
+引吭高歌 11 i
+引咎 9 v
+引咎自责 2 i
+引咎责躬 3 i
+引咎辞职 45 i
+引商刻羽 3 n
+引商刻角 3 l
+引喻失义 3 i
+引子 63 n
+引导 2161 v
+引导人 20 n
+引导出 3 n
+引导员 9 n
+引导性 8 n
+引导文件 3 n
+引导盘 3 n
+引导者 5 n
+引射器 4 n
+引度 3 n
+引座员 3 n
+引开 3 v
+引律比附 3 v
+引得 301 v
+引成 3 v
+引手投足 3 i
+引拉 3 v
+引拉出 3 i
+引据 3 v
+引接 3 v
+引擎 160 n
+引擎盖 3 n
+引文 60 v
+引文舛错 3 vn
+引新吐故 3 i
+引日成岁 3 l
+引智 3 v
+引来 318 v
+引来引去 3 l
+引柴 3 v
+引桥 431 v
+引气 6 v
+引水 258 v
+引水上山 3 i
+引水人 2 n
+引水入墙 3 i
+引水员 2 n
+引水渠 13 n
+引水道 5 n
+引河 14 v
+引流 85 v
+引流术 3 n
+引淫入性 3 i
+引渡 97 v
+引渡回国 3 n
+引港 3 n
+引港费 3 n
+引滦入津 16 l
+引潜 3 v
+引潮力 34 l
+引火 46 v
+引火上身 3 i
+引火点 3 n
+引火烧身 41 i
+引火焚身 3 vn
+引火线 3 l
+引火自焚 3 i
+引燃 37 v
+引爆 203 v
+引爆剂 3 n
+引爆器 3 n
+引物 3 n
+引物连类 3 n
+引牵 3 v
+引牵出 3 i
+引狗入寨 3 i
+引狼 3 n
+引狼入室 17 i
+引狼拒虎 3 l
+引狼自卫 3 i
+引玉之砖 3 n
+引理 3 v
+引用 3264 v
+引申 194 v
+引申为 3 n
+引申义 5 n
+引申作 3 n
+引申触类 3 n
+引着 274 v
+引短推长 3 i
+引种 150 v
+引类呼朋 3 i
+引纸绳 3 n
+引线 84 n
+引线人 3 n
+引线穿针 3 n
+引线键合 3 n
+引经据典 32 n
+引经据古 3 n
+引绳切墨 3 n
+引绳批根 3 n
+引绳排根 3 n
+引绳棋布 3 n
+引者 3 n
+引而不发 10 i
+引聘 3 v
+引脚 2 v
+引自 3 v
+引致 179 v
+引航 11 v
+引航员 3 n
+引航船 2 n
+引航道 10 n
+引荐 63 v
+引虎入室 3 i
+引虎拒狼 3 l
+引虎自卫 3 i
+引蛇出洞 10 l
+引见 265 v
+引言 20 v
+引论 30 v
+引证 75 v
+引证者 3 n
+引诗为证 3 i
+引语 8 v
+引诱 275 v
+引诱剂 4 nz
+引资 17 v
+引起 12074 v
+引起争议 3 l
+引起偏见 3 i
+引起共鸣 3 i
+引起反响 3 l
+引起反对 3 l
+引起反感 3 l
+引起惊慌 3 n
+引起瘟疫 3 n
+引起矛盾 3 l
+引起纠纷 3 z
+引起轰动 3 i
+引足救经 3 i
+引路 207 v
+引路人 12 n
+引车买浆 3 n
+引车卖浆 10 n
+引过 3 v
+引过去 3 l
+引过来 3 l
+引过自责 3 l
+引进 2375 v
+引进人才 3 l
+引进人材 3 n
+引进品种 3 l
+引进外资 3 l
+引进技术 3 n
+引进者 3 n
+引进设备 3 i
+引述 101 v
+引退 57 v
+引逗 21 v
+引道 3 v
+引错 3 v
+引锥刺股 3 l
+引鞋 3 v
+引领 525 v
+引领企踵 3 i
+引领到 3 l
+引领者 3 n
+引领而望 3 i
+引颈 43 n
+引风 5 v
+引风吹火 3 i
+引风机 2 l
+引饵 3 n
+引首以望 3 i
+引鬼上门 3 i
+引黄 56 v
+引黄入晋 3 j
+引黄灌区 12 n
+弖 5 zg
+弗 778 nr
+弗之叹 3 nr
+弗之微 4 nr
+弗之笑 4 nr
+弗伦 2 nrt
+弗伦克尔 4 nrt
+弗伦奇 2 nr
+弗伦德 2 nr
+弗兰克 67 nr
+弗兰克尔 7 nrt
+弗兰克斯 13 nrt
+弗兰兹 9 nr
+弗兰加利 2 ns
+弗兰卡 3 nr
+弗兰基 2 nr
+弗兰奇 3 nr
+弗兰妮 3 nrt
+弗兰左 2 nr
+弗兰德 6 nr
+弗兰格尔 6 nrt
+弗兰特 2 nr
+弗兰科 9 nr
+弗兰肯 13 nr
+弗兰茨 21 nrt
+弗兰萨 2 nr
+弗兰西 9 nr
+弗兰西斯 7 nrt
+弗列麦 2 nr
+弗利 4 nrt
+弗利托 2 nrt
+弗利胥 4 nr
+弗劳恩 2 nr
+弗勒吕斯 4 nrt
+弗卢埃 3 nr
+弗吉尼亚 169 ns
+弗吉尼亚州 52 ns
+弗尔 4 nrt
+弗尔德 4 nrt
+弗尔索夫 3 nrt
+弗希特 2 nr
+弗德 8 nrt
+弗所公 3 nr
+弗拉 49 nrt
+弗拉基 6 nrt
+弗拉基米尔 42 nrt
+弗拉姆 3 nrt
+弗拉尼茨基 6 nrt
+弗拉德 3 nrt
+弗拉托 6 nrt
+弗拉斯 3 nrt
+弗拉曼克 4 nrt
+弗拉格 2 nrt
+弗拉海 10 ns
+弗拉特 3 nrt
+弗拉米尼 2 nrt
+弗拉索夫 7 nrt
+弗拉维 7 nr
+弗拉芒 8 nr
+弗拉迪 4 nr
+弗拉迪米尔 2 nrt
+弗拉门 3 ns
+弗斯 9 nrt
+弗斯和 2 nrt
+弗曼 2 nrt
+弗朗丹 7 nr
+弗朗克 17 nrt
+弗朗兹 3 nr
+弗朗哥 7 nr
+弗朗德兹 3 nrt
+弗朗戈 2 nrt
+弗朗斯维尔 2 nrt
+弗朗索 4 nr
+弗朗索斯 3 nrt
+弗朗索瓦 27 nrt
+弗朗茨 10 nrt
+弗朗西 10 nrt
+弗朗西亚 3 nrt
+弗朗西斯 29 nrt
+弗朗西斯敦 2 ns
+弗朗西斯科 53 nrt
+弗朗谢 2 nrt
+弗朗辛 2 nr
+弗林德 2 nr
+弗林德斯 2 nrt
+弗林特 3 nr
+弗格森 172 nr
+弗洛 2 nrt
+弗洛伊 3 nrt
+弗洛伊德 85 nrt
+弗洛伦斯 8 nrt
+弗洛伦蒂 8 nrt
+弗洛依 2 nr
+弗洛勒斯 4 nrt
+弗洛姆 4 nrt
+弗洛姆维 4 nrt
+弗洛尔 2 nr
+弗洛拉 2 nrt
+弗洛里 17 nrt
+弗洛里斯 37 nrt
+弗洛雷斯 13 nrt
+弗爵爷 2 nr
+弗特海 10 nr
+弗瑞德 3 nr
+弗瓦迪斯 2 nrt
+弗留利 2 nr
+弗留尔 4 nr
+弗纳斯 2 nr
+弗罗 3 nrt
+弗罗伦蒂 2 nrt
+弗罗多 3 nrt
+弗罗姆 9 nrt
+弗罗斯 2 nr
+弗罗斯特 5 nrt
+弗罗林 2 nr
+弗罗茨瓦夫 11 nrt
+弗罗霞 4 nr
+弗老大 3 nr
+弗若曼 3 nr
+弗莱 11 nrt
+弗莱克斯 8 nrt
+弗莱切 2 nr
+弗莱堡 5 nr
+弗莱姆 2 nr
+弗莱彻 16 nr
+弗莱德 3 nr
+弗莱明 38 nr
+弗莱河 2 nr
+弗莱舍 112 nrt
+弗莱迪 3 nr
+弗蒂斯 3 nr
+弗赖 8 nrt
+弗赖伊 2 nrt
+弗赖堡 21 nrt
+弗赖堡大学 22 nt
+弗路尔 2 nr
+弗迪格 2 nrt
+弗里 9 nrt
+弗里亚 3 nrt
+弗里克 5 nrt
+弗里兹 6 nr
+弗里吉 2 nrt
+弗里堡 4 nrt
+弗里奇 4 nrt
+弗里尔 3 nrt
+弗里希 6 nrt
+弗里德 5 nrt
+弗里德尔 2 nrt
+弗里德曼 15 nrt
+弗里德里克 11 nrt
+弗里德里希 34 nrt
+弗里敦 17 ns
+弗里斯 20 nrt
+弗里斯兰 3 nrt
+弗里斯特 2 nrt
+弗里施 10 nr
+弗里曼特尔 5 nrt
+弗里波 5 nr
+弗里特 4 nrt
+弗里瑟 2 nrt
+弗里茨 9 nrt
+弗里西亚 5 nrt
+弗雷 6 nr
+弗雷伊卡 2 nrt
+弗雷儒斯 2 nr
+弗雷德 33 nrt
+弗雷德曼 2 nrt
+弗雷德里克 11 nrt
+弗雷斯 4 nr
+弗雷格 26 nrt
+弗雷歇 6 nr
+弗雷泽 14 nr
+弗雷西 5 nr
+弗雷谢特 3 nrt
+弗雷迪 3 nr
+弗雷隆 2 nr
+弗龙堡 2 nr
+弘 163 zg
+弘一 8 t
+弘一大师 2 nr
+弘一法师 19 nr
+弘仁普 2 nr
+弘传位 3 nr
+弘传教 2 nr
+弘佐卒 3 nr
+弘光帝 10 nr
+弘光护专 3 nr
+弘光朝 4 nr
+弘光皇帝 63 nr
+弘农华 11 nr
+弘农湖 3 nr
+弘农王 2 nr
+弘农郡 2 nr
+弘化公主 2 nr
+弘历 23 t
+弘图 45 nr
+弘奖风流 3 n
+弘德殿 2 nr
+弘徽殿 2 nr
+弘愿 3 v
+弘慈广 3 nr
+弘扬 430 nr
+弘教 4 nz
+弘文阁 6 nr
+弘文院 13 nr
+弘文馆 8 nr
+弘时 2 t
+弘明集 5 nr
+弘期 2 t
+弘毅宽厚 3 nr
+弘治 259 nr
+弘法 13 nr
+弘清水 2 nr
+弘福寺 3 nr
+弘道 14 nr
+弘量 3 n
+弛 112 zg
+弛废 3 a
+弛懈 80 a
+弛缓 34 a
+弛豫 31 a
+弛豫力 3 vn
+弛豫时间 3 v
+弛高骛远 3 z
+弛魂宕魄 3 nr
+弝 52 zg
+弟 3217 n
+弟兄 1748 n
+弟兄们 3 n
+弟妇 17 n
+弟妹 134 n
+弟妹们 3 n
+弟媳 47 n
+弟子 6071 n
+弟子规 3 n
+弟弟 1625 n
+弟甫 3 n
+弟男子侄 3 n
+张 23973 q
+张一元 3 nr
+张一光 97 nr
+张一刀 3 nr
+张一氓 8 nr
+张一白 3 nr
+张一鸣 4 nr
+张一麟 6 nr
+张丁华 4 nr
+张万仙 2 nr
+张万年 64 nr
+张三丰 436 nr
+张三之 2 nr
+张三影 2 nr
+张三李四 18 nr
+张三枫 2 nr
+张三爷 61 nr
+张三笑 12 nr
+张丕民 3 nr
+张世刚 5 nr
+张世勋 3 nr
+张世卿 4 nr
+张世平 2 nr
+张世开 9 nr
+张世文 2 nr
+张世杰 28 nr
+张世民 3 nr
+张世爵 9 nr
+张丘建 4 nr
+张业遂 256 nr
+张东健 3 nr
+张东升 2 nr
+张东扬 2 nr
+张东明 2 nr
+张东波 10 nr
+张东涛 2 nr
+张东荪 19 nr
+张中伟 15 nr
+张中华 3 nr
+张中宝 3 nr
+张中行 2 nr
+张丰毅 3 nr
+张丹露 3 nr
+张丽华 5 nr
+张丽宾 3 nr
+张义兰 125 nr
+张义民 343 nr
+张义潮 10 nr
+张之卒 2 nr
+张之平 12 nr
+张之洞 519 nr
+张乐平 3 nr
+张乐行 14 nr
+张乖崖 2 nr
+张乘云 4 nr
+张乘风 3 nr
+张九郎 32 nr
+张九龄 38 nr
+张书叙 2 nr
+张书才 4 nr
+张书政 5 nr
+张书田 3 nr
+张二公 5 nr
+张二叔 2 nr
+张二哥 2 nr
+张二奎 5 nr
+张二弟 4 nr
+张二江 3 nr
+张于湖 2 nr
+张云华 3 nr
+张云川 24 nr
+张云松 7 nr
+张云泉 6 nr
+张云波 3 nr
+张云海 2 nr
+张云翼 2 nr
+张云逸 19 nr
+张云龙 2 nr
+张五侠 93 nr
+张五哥 5 nr
+张五常 3 nr
+张五弟 2 nr
+张五爷 8 nr
+张亚斌 16 nr
+张亦婷 5 nr
+张亦驰 2 nr
+张京津 4 nr
+张亮基 4 nr
+张人杰 4 nr
+张仁愿 2 nr
+张从正 3 nr
+张付民 6 nr
+张令一 2 nr
+张令将军 2 nr
+张令徽 25 nr
+张仪 88 nr
+张仪之 2 nr
+张仪死 3 nr
+张仪相 6 nr
+张仲景 62 nr
+张仲犹 3 nr
+张任学 4 nr
+张伏生 3 nr
+张伟弟 3 nr
+张伟明 3 nr
+张伟达 3 nr
+张伟进 3 nr
+张传满 3 nr
+张伯义 2 nr
+张伯伦 92 nr
+张伯恒 2 nr
+张伯桢 2 nr
+张伯歧 3 nr
+张伯祖 2 nr
+张伯端 7 nr
+张伯苓 42 nr
+张伯行 4 nr
+张伯雅 2 nr
+张伯驹 5 nr
+张伯鲸 4 nr
+张伯麟 2 nr
+张佐华 2 nr
+张佑才 256 vn
+张佑赫 3 z
+张佛泉 2 nr
+张作梅 2 nr
+张作相 2 nr
+张作霖 373 nr
+张佩伦 2 nr
+张佩华 3 nr
+张佩纶 6 nr
+张佳胤 43 nr
+张侍立 4 nr
+张俊以 9 nr
+张俊修 6 nr
+张俊建 3 nr
+张俊成 2 nr
+张俊生 3 nr
+张俊美 2 nr
+张俊芳 2 nr
+张保义 2 nr
+张保庆 9 nr
+张保田 10 nr
+张保皋 6 nr
+张信哲 7 nr
+张健先生 6 nr
+张健忙 2 nr
+张僧繇 12 nr
+张元伯 3 nr
+张元柳 3 nr
+张元济 17 nr
+张元珍 4 nr
+张元端 2 nr
+张元第 9 nr
+张元素 2 nr
+张元红 11 nr
+张兆武 2 nr
+张兆辉 3 nr
+张先国 2 nr
+张光北 3 nr
+张光壁 3 nr
+张光宇 6 nr
+张光斗 7 nr
+张光辅 2 nr
+张克侠 18 nr
+张克俭 6 nr
+张克军 15 nr
+张克帆 3 nr
+张克敏 4 nr
+张克杰 2 nr
+张克瑶 3 nr
+张克辉 6 nr
+张全义 11 nr
+张全德 4 nr
+张全景 6 nr
+张全祥 8 nr
+张八哥 12 nr
+张八岭 3 nr
+张公公 6 nr
+张公子 29 nr
+张公山 3 nr
+张公洞 10 nr
+张公谨 2 nr
+张关保 6 nr
+张关羽 57 nr
+张兴惠 3 nr
+张兵备 2 nr
+张兵败 2 nr
+张其军 3 nr
+张其平 2 nr
+张其昀 3 nr
+张养浩 8 nr
+张养蒙 2 nr
+张冀光 4 nr
+张冠李戴 25 nr
+张冠英 6 nr
+张凤琴 2 nr
+张凤翼 8 nr
+张凤雏 5 nr
+张凯华 2 nr
+张刘陈 2 nr
+张刚龙 2 nr
+张利州 3 nr
+张利民 128 nr
+张利胜 64 nr
+张剑寒 4 nr
+张副将 2 nr
+张力 160 nr
+张力峰 3 nr
+张力维 3 nr
+张力计 3 nr
+张劲夫 4 nr
+张劲松 2 nr
+张勇军 4 nr
+张勇手 3 nr
+张勋入 4 nr
+张勋朝 2 nr
+张勋理 2 nr
+张勋自 3 nr
+张勋遂 3 nr
+张北 93 nr
+张北县 49 ns
+张北川 6 nr
+张匡邺 2 nr
+张十五 3 nr
+张千英 28 nr
+张华 140 nr
+张华便 2 nr
+张华婧 5 nr
+张华康 2 nr
+张华浜 2 ns
+张华海 10 nr
+张华草 2 nr
+张卓元 6 nr
+张博学 8 nr
+张博泉 5 nr
+张卫东 3 nr
+张卫健 3 nr
+张卫勇 2 nr
+张卫国 7 nr
+张卫寨 2 nr
+张卫平 3 nr
+张印相 2 nr
+张厉生 2 nr
+张厚载 2 nr
+张友渔 9 nr
+张友生 3 nr
+张发奎 35 nr
+张发宝 3 nr
+张发强 12 nr
+张叔夜 39 nr
+张口 361 nr
+张口器 3 nr
+张口掉舌 3 v
+张口结舌 89 i
+张召重 649 nr
+张可久 7 nr
+张可旺 72 nr
+张可颐 3 v
+张吉龙 6 nr
+张同铸 12 nr
+张名帖 3 nr
+张名振 7 nr
+张向东 7 nr
+张向荣 2 nr
+张君劢 9 nr
+张君励 6 nr
+张君宝 219 nr
+张君房 5 nr
+张君瑞 4 nr
+张君秋 20 nr
+张含英 3 nr
+张含韵 2 nr
+张启彬 2 nrfg
+张启藻 17 nr
+张员外 9 nr
+张和龄 2 nr
+张唱片 3 n
+张啸林 10 nr
+张善为 3 nr
+张善余 3 nr
+张善耕 2 nr
+张嗣修 4 nr
+张嘴 368 nr
+张嘴巴 3 nr
+张嘴挢舌 3 v
+张嘴说话 3 i
+张四伯 2 nr
+张四侠 7 nr
+张四叔 2 nr
+张团练 11 nr
+张园国会 3 nr
+张国伍 2 nr
+张国伟 15 nr
+张国俊 3 nr
+张国光 258 nr
+张国华 3 nr
+张国宝 3 nr
+张国庆 170 nr
+张国强 7 nr
+张国成 6 nrfg
+张国政 2 nr
+张国文 2 nr
+张国柱 4 nr
+张国栋 133 nr
+张国梁 3 nr
+张国民 3 nr
+张国淦 4 nr
+张国焘 351 nr
+张国祥 5 nr
+张国立 4 nr
+张国纪 11 nr
+张国维 23 nr
+张国老 3 nr
+张国舅 2 nr
+张国良 3 nr
+张国英 2 nr
+张国荣 162 nr
+张土明 2 nr
+张均田 3 nr
+张坚庭 3 nr
+张坚钟 10 nr
+张坤海 5 ns
+张培刚 256 nr
+张培瑜 12 nr
+张墩儿 2 nr
+张士义 2 nr
+张士会 3 nr
+张士信 6 nr
+张士德 5 nr
+张士珩 2 nr
+张士衡 2 nr
+张士诚 189 nr
+张复健 3 nr
+张复建 3 nr
+张复龙 3 nr
+张多福 3 nr
+张大 543 nr
+张大书 4 nr
+张大侠 5 nr
+张大其事 3 i
+张大其词 3 nr
+张大其辞 3 nr
+张大千 33 nr
+张大哥 41 nr
+张大嘴 9 nr
+张大嘴巴 10 nr
+张大圆 3 nr
+张大复 4 nr
+张大妈 2 nr
+张大帅 10 nr
+张大椅 3 nr
+张大民 4 nr
+张大狼 6 nr
+张大白 3 nr
+张大素 2 nr
+张大红 2 nr
+张大经 37 nr
+张大老爷 3 nr
+张大脸 2 nr
+张大镇 3 nr
+张天喜 3 nr
+张天师 4 nr
+张天爱 17 nr
+张天禄 15 nr
+张天罡 6 nr
+张天翼 18 nr
+张天锡 14 nr
+张天霖 3 nr
+张太守 4 nr
+张太监 2 nr
+张太雷 79 nr
+张夫人 25 nr
+张奎杰 2 nr
+张奚若 2 nr
+张女士 3 nr
+张如亮 2 nr
+张如圭 2 nr
+张妍妍 2 nr
+张姓老者 3 nr
+张婕妤 2 nr
+张嫂子 11 nr
+张嬴川 4 nr
+张子勇 2 nr
+张子善 20 nr
+张子布 3 nr
+张子强 3 nr
+张子房 3 nr
+张子明 17 nr
+张子正 5 nr
+张子茜 3 nr
+张子静 2 nr
+张子高 2 nr
+张孔山 2 nr
+张孔目 6 nr
+张存仁 24 nr
+张存孟 3 nr
+张孙振 10 nr
+张孚敬 3 nr
+张孝嵩 3 nr
+张孝杰 2 nr
+张孝林 3 nr
+张孝祥 9 nr
+张孝纯 90 nr
+张孝若 4 nr
+张孝骞 2 nr
+张孟谈 4 nr
+张季元 3 nr
+张季子 4 nr
+张季直 2 nr
+张季鸾 6 nr
+张学东 256 nr
+张学军 3 nr
+张学友 3 nr
+张学忠 12 nr
+张学文 60 nr
+张学斌 2 nr
+张学武 20 nr
+张学津 3 nr
+张学良 536 nr
+张学铭 6 nr
+张学颜 15 nr
+张宁 487 nr
+张宁先 3 nr
+张宁竟 2 nr
+张宁笑 2 nr
+张宁网 11 nr
+张宁赢 2 nr
+张宁越 2 nr
+张宁连 3 nr
+张宅乡 3 nr
+张宇初 2 nr
+张宇寒 2 nr
+张宇清 2 nr
+张守一 2 nr
+张守业 28 nr
+张守刚 2 nr
+张守敬 33 nr
+张守文 5 nr
+张守春 4 nr
+张守直 31 nr
+张安世 7 nr
+张安国 3 ns
+张安官 6 nr
+张安惠 6 nr
+张宏仁 5 nr
+张宏伟 3 nr
+张宏平 4 nr
+张宏昌 12 nr
+张宏梁 7 nr
+张宗卫 3 nr
+张宗子 6 nr
+张宗昌 139 nr
+张宗演 8 nr
+张宗琪 239 nr
+张宗祥 8 nr
+张宗禹 11 nr
+张定发 2 nr
+张定国 33 nr
+张定边 18 nr
+张宜俊 2 nr
+张宝义 3 nr
+张宝军 4 nr
+张宝引 2 nr
+张宝椅 2 nr
+张宝玲 3 nr
+张宝珍 2 nr
+张宝瑞 14 nr
+张宝顺 2 nr
+张宝鼎 2 nr
+张宪文 2 nr
+张家 378 nrfg
+张家口 303 nr
+张家口市 26 ns
+张家坡 4 nr
+张家堡 2 nr
+张家寨 96 nr
+张家山 6 nr
+张家川回族自治县 3 ns
+张家庄 6 nr
+张家店 3 ns
+张家弟弟 2 nr
+张家昌 7 nr
+张家李 2 nr
+张家村 4 nr
+张家松 3 nr
+张家松是 3 nz
+张家树 3 nr
+张家沟 3 nr
+张家治 4 nr
+张家港 69 nr
+张家港市 23 ns
+张家湾 284 nr
+张家界 193 nr
+张家界市 17 ns
+张家辉 3 nr
+张家集镇 3 nr
+张宿堂 11 nr
+张寄谦 4 nr
+张寨主 6 nr
+张寿臣 10 nr
+张将军 5 nr
+张将士 2 nr
+张小侠 3 nr
+张小军 3 nr
+张小冬 3 nr
+张小娴 3 nr
+张小宝 9 nr
+张小小 3 nr
+张小山 3 nr
+张小巧 2 nr
+张小文 7 nr
+张小泉 5 nr
+张小燕 3 nr
+张小红 2 nr
+张小艾 2 nr
+张小轩 3 nr
+张小龙 3 nr
+张少兵 28 nr
+张少华 3 nr
+张少媚 3 nr
+张少帅 2 nr
+张尔公 3 nr
+张尚书 2 nr
+张尚礼 2 nr
+张尧扬 18 nr
+张居正 4564 nrfg
+张居谦 29 nr
+张展南 7 nr
+张履祥 3 nr
+张岂之 2 nrfg
+张岂凡 6 nr
+张岚峰 3 nr
+张岱年 12 nrfg
+张岳琦 2 nr
+张岸涛 2 nr
+张嵩浩 2 nr
+张左己 2 nr
+张师傅 3 nr
+张师叔 5 nr
+张师弟 5 nr
+张希清 3 nr
+张希琛 3 nr
+张希钦 7 nr
+张帷国 3 nr
+张平的 10 nrfg
+张平芳 2 nr
+张广勇 3 nr
+张广厚 3 nr
+张广宁 3 nr
+张广才岭 26 nr
+张广泗 35 nr
+张广瑞 9 nr
+张广达 20 nr
+张庄村 4 nr
+张庆文 11 nr
+张庆黎 3 nr
+张应东 2 nr
+张应元 8 nr
+张应力 3 nr
+张应昌 2 nr
+张应科 6 nr
+张应银 2 nr
+张店区 14 ns
+张庭森 3 nr
+张康二 2 nr
+张康吓 2 nr
+张康年 41 nr
+张延龄 7 nr
+张廷发 9 nr
+张廷玉 22 nr
+张廷翰 5 nr
+张廷范 2 nr
+张廷辅 2 nr
+张建伟 12 nr
+张建军 3 nr
+张建勤 2 nr
+张建华 2 nr
+张建启 3 nr
+张建国 13 nr
+张建平 3 nr
+张建康 2 nr
+张建强 2 nr
+张建新 6 nr
+张建权 2 nrfg
+张建松 5 nr
+张建涛 3 nr
+张建玲 2 nr
+张建良 6 nr
+张开 452 nr
+张开嘴 4 nr
+张开嘴巴 2 nr
+张开巨 2 nr
+张开干 3 nr
+张开着 3 v
+张开血 3 nr
+张弓镇 3 nr
+张引生 7 nr
+张弘范 9 nr
+张张合 2 nr
+张彦泽 2 nr
+张彦远 10 nr
+张彭春 2 nr
+张律师 3 nr
+张得勤 3 nr
+张得象 2 nr
+张御座 2 nr
+张徨失措 3 v
+张微黑 2 nr
+张德伍 4 nr
+张德刚 2 nr
+张德勒 10 nr
+张德厚 2 nr
+张德培 5 nr
+张德广 5 nr
+张德庆 2 nr
+张德彝 2 nr
+张德成 8 nr
+张德江 5 nr
+张德纯 2 nr
+张德耀 6 nr
+张德豪 3 nr
+张德辉 12 nr
+张德邻 3 nr
+张德霖 4 nr
+张心一 4 nr
+张心庆 4 nr
+张必先 2 nr
+张志中 3 nr
+张志仙 2 nr
+张志光 32 nr
+张志军 34 nr
+张志凌 2 nr
+张志刚 8 nr
+张志勇 5 nr
+张志坚 257 nr
+张志学 3 nr
+张志家 3 nrfg
+张志平 4 nr
+张志广 3 nr
+张志强 4 nr
+张志忠 3 nr
+张志敬 4 nr
+张志新 22 nr
+张志民 2 nr
+张志沂 2 nr
+张志澄 2 nr
+张志素 2 nr
+张志让 4 nr
+张志诚 4 nr
+张忠培 2 nr
+张念军 23 nr
+张怀瑾 2 nr
+张怀礼 2 nr
+张怀西 3 nr
+张思之 44 nr
+张思华 3 nr
+张思卿 13 nr
+张思堂 4 nr
+张思宁 2 nr
+张思德 7 nr
+张思正 2 nr
+张思民 2 nr
+张思珍 20 nr
+张思礼 2 nr
+张怡宁 32 nr
+张怡荪 2 nr
+张性荃 3 nr
+张总师 2 nr
+张总管 2 nr
+张恕生 2 nr
+张恨水 5 nr
+张恩华 3 nr
+张恩铭 6 nr
+张恭庆 2 nr
+张恭祖 2 nr
+张悦然 19 nr
+张惟忠 2 nr
+张惟英 3 nr
+张惠妹 13 nr
+张惠新 3 nr
+张惠明 2 nr
+张惠言 10 nr
+张惶失措 6 i
+张愈升 2 nr
+张慌失措 3 i
+张慎言 11 nr
+张慕瑾 7 nr
+张慧仪 3 nr
+张慧琴 13 nr
+张慧英 2 nr
+张慧霞 2 nr
+张成仁 140 nr
+张成伦 2 nr
+张成宣 2 nr
+张成寅 3 nr
+张成聚 6 nr
+张扬 268 nr
+张扬出去 3 i
+张扬出来 3 i
+张扬路 3 nr
+张承志 16 nr
+张抗抗 3 nr
+张押班 4 nr
+张择端 21 nr
+张拴狗 3 nr
+张挂在 3 i
+张挂着 3 v
+张挂起 3 i
+张挂起来 3 i
+张振仕 256 nr
+张振武 3 nr
+张振馨 2 nr
+张掖 165 ns
+张掖地区 2 ns
+张掖市 10 ns
+张提督 8 nr
+张政委 4 nr
+张效瑞 2 nr
+张效祥 2 nr
+张敏杰 3 nr
+张敞画眉 3 nr
+张敬修 13 nr
+张敬安 2 nr
+张敬尧 7 nr
+张敬帅 5 nr
+张敬轩 72 nr
+张文中 3 nr
+张文伯 2 nr
+张文倬 2 nr
+张文奎 15 nr
+张文学 4 nr
+张文宏 2 nr
+张文岳 3 nr
+张文庭 2 nr
+张文康 7 nr
+张文彬 4 nrfg
+张文忠 3 nr
+张文明 72 nr
+张文来 8 nr
+张文根 2 nr
+张文森 3 nr
+张文洲 2 nr
+张文瑾 2 nr
+张文秀 13 nr
+张文芬 2 nr
+张文裕 11 nr
+张文襄 5 nr
+张文谦 6 nr
+张文远 10 nr
+张文钊 6 nr
+张文锦 3 nr
+张文龙 3 nr
+张斯瑜 2 nr
+张新宝 257 nr
+张新彦 5 nr
+张新芳 3 nr
+张新贵 7 nr
+张方佐 2 nr
+张方平 3 nr
+张旗鸣鼓 3 i
+张无忌 1714 nr
+张无邪 2 nr
+张旭 65 nr
+张旭东 3 nr
+张旭光 3 nr
+张旭官 2 nr
+张时钊 3 nr
+张昆生 4 nr
+张昊辰 3 nr
+张昌宗 7 nr
+张昌尔 256 nr
+张昌平 256 nr
+张昌绍 2 nr
+张明俊 12 nr
+张明山 6 nr
+张明弼 83 nr
+张明楷 257 nr
+张明正 2 nr
+张易之 17 nr
+张春九 19 nr
+张春园 3 nr
+张春枝 2 nr
+张春桥 134 nr
+张春江 3 nr
+张春燕 2 nr
+张春生 2 nr
+张春芳 2 nr
+张春蕊 4 nr
+张春贤 3 nr
+张春郎 4 nr
+张春龙 9 nr
+张昭仍 2 nr
+张昭奏 3 nr
+张昭疑 3 nr
+张昭福 2 nr
+张昭谏 3 nr
+张昭远 4 nr
+张显清 9 nr
+张显耀 3 nr
+张显臣 2 nr
+张晋平 7 nr
+张晓东 3 nr
+张晓伟 24 nr
+张晓敏 6 nr
+张晓松 4 nr
+张晓梅 4 nr
+张晓芬 2 nr
+张晓辉 3 nr
+张晓颖 2 nr
+张晓风 3 nr
+张晨光 3 nr
+张晨磊 3 nr
+张景亭 6 nr
+张景利 3 nr
+张景哲 4 nr
+张景岳 6 nr
+张景惠 8 nr
+张景星 3 nr
+张景钺 2 nr
+张智华 256 nrfg
+张智尧 3 nr
+张智成 3 nrfg
+张智澄 3 nr
+张智霖 3 nr
+张曙光 12 nr
+张曜灵 4 nr
+张曼玉 20 nr
+张月鹿 5 nr
+张有德 4 nr
+张有智 123 nr
+张朗峰 3 nr
+张望 249 nr
+张朝唐 140 nr
+张朝祥 2 nr
+张朝阳 27 nr
+张木儿 3 nr
+张本 33 ns
+张本兴 2 nr
+张本渝 3 nr
+张本直 4 nr
+张本继末 3 nr
+张村乡 3 nr
+张来娣 2 nr
+张杨路 5 nr
+张杰庭 3 nr
+张松江 2 nr
+张松涛 9 nr
+张松溪 163 nr
+张林品 4 nr
+张果喜 3 nr
+张果老 4 nr
+张柏林 3 nr
+张柏芝 3 nr
+张柔入 3 nr
+张柔独 3 nr
+张柔献 3 nr
+张柔镇 3 nr
+张柔领 3 nr
+张柬之 9 nr
+张树义 8 nr
+张树兰 2 nr
+张树声 3 nr
+张树新 3 nr
+张树栋 7 nr
+张树田 2 nr
+张树藩 2 nr
+张格尔 37 nr
+张桂兰 15 nr
+张桂华 256 nr
+张桂溪 5 nr
+张桂芳 2 nr
+张桑悦 3 nr
+张桓侯 2 nr
+张楚君 2 nr
+张楚楚 2 nr
+张榜 42 nr
+张榜公布 3 nr
+张次溪 2 nr
+张欣茹 10 nr
+张正明 15 nr
+张正芹 3 nr
+张毓茂 257 nr
+张氏世 2 nr
+张氏医通 3 nz
+张氏家族 4 nr
+张氏续 2 nr
+张民表 31 nr
+张永义 3 nr
+张永兄 2 nr
+张永入 2 nr
+张永兴 3 nr
+张永和 4 nrfg
+张永峰 3 nr
+张永年 4 nr
+张永强 6 nr
+张永斌 2 nr
+张永明 2 nr
+张永棋 3 nr
+张永海 22 nr
+张永琪 11 nr
+张永祥 4 nr
+张永祺 18 nr
+张永福 4 nr
+张永红 222 nr
+张永荐 3 nr
+张汇文 2 nr
+张汉儒 8 nr
+张汉卿 19 nr
+张汉又 3 nr
+张汉微微 2 nr
+张汉杰 3 nr
+张汉笑 3 nr
+张汉臣 10 nr
+张汉那 2 nr
+张汝京 3 nr
+张汝梅 5 nr
+张江陵 5 nr
+张治中 47 nrfg
+张治国 3 ns
+张治平 2 nr
+张治强 5 nrfg
+张治泰 10 nr
+张泽书 2 nr
+张泽咸 5 nr
+张泽田 4 nr
+张洁雯 10 nr
+张洛行 2 nr
+张洪亮 3 nr
+张洪伟 7 nr
+张洪斌 4 nr
+张洪河 2 nr
+张洪量 3 nr
+张洪阁 2 nr
+张济之 2 nr
+张浩宇 4 nr
+张海丽 314 nr
+张海云 4 nr
+张海伦 3 nr
+张海利 6 nr
+张海宁 2 nr
+张海峰 17 nr
+张海涛 11 nr
+张海燕 3 nr
+张海迪 20 nr
+张海鹏 4 nr
+张涤生 2 nr
+张润斌 256 nr
+张淑英 5 nrfg
+张淡月 7 nr
+张淡道人 4 nr
+张清便 5 nr
+张清华 3 nr
+张清回 2 nr
+张清带 2 nr
+张清往 2 nr
+张清秀 2 nr
+张清芳 3 nr
+张清见 6 nr
+张清连 2 nr
+张清领 5 nr
+张清飞 2 nr
+张温入 3 nr
+张湾公园 3 ns
+张湾区 768 ns
+张湾医院 3 nz
+张溥死 2 nr
+张溥辑 25 nr
+张潇艺 6 nr
+张澜 64 nrfg
+张灯结彩 48 i
+张灵甫 9 nr
+张炜兄 2 nr
+张炜先生 2 nr
+张炜卷 2 nr
+张炜李 4 nr
+张煌言 38 nr
+张照云海 2 nr
+张燊悦 3 v
+张燕筑 2 nr
+张燕辉 3 nr
+张燮林 3 nr
+张爱民 6 nr
+张爱玲 147 nr
+张爱萍 17 nr
+张牙舞爪 87 i
+张牛科 11 nr
+张狂 67 nr
+张狼皮 6 nr
+张献忠 1012 nr
+张献金 3 nr
+张玉书 2 nr
+张玉兽 2 nr
+张玉凤 2 nr
+张玉勤 10 nr
+张玉华 3 nr
+张玉卿 4 nr
+张玉宁 31 nr
+张玉新 2 nr
+张玉林 6 nr
+张玉浦 2 nr
+张玉燕 3 nr
+张玉珊 3 nrfg
+张玉道 5 nr
+张玉麟 2 nr
+张王李赵 3 nr
+张王氏 6 nr
+张王赵 2 nr
+张王赵李 3 nr
+张珏任 2 nr
+张理涛 4 nr
+张琪玉 2 nr
+张瑞哲 3 nr
+张瑞图 3 nr
+张瑞姬 3 nr
+张瑞希 3 nr
+张瑞敏 12 nr
+张瑞芳 8 nr
+张璁倡 2 nr
+张璁先生 4 nr
+张璁桂 5 nr
+张生月 2 nr
+张生民 23 nr
+张生记 3 nr
+张申府 8 nr
+张留孙 18 nr
+张登义 2 nr
+张登云 3 nr
+张白圭 10 nr
+张白皙 2 nr
+张百祥 3 nr
+张皇亲 8 nr
+张皇其事 3 i
+张皇后 22 nr
+张皇失措 17 i
+张益肇 3 nr
+张监军 4 nr
+张目一看 3 i
+张相公 10 nr
+张相文 4 nr
+张眉努目 3 nr
+张眉努眼 3 nr
+张眉张眼 3 i
+张真人 32 nr
+张真英 3 nr
+张眼一看 3 i
+张眼露睛 3 i
+张石头 2 nr
+张石川 12 nr
+张石重 2 nr
+张碧玉 2 nr
+张祖德 7 nr
+张祖训 2 nr
+张神剑 2 nr
+张福山 2 nr
+张福森 3 nr
+张福河 2 nr
+张福纯 3 nr
+张福鸿 3 nr
+张秀卿 3 nr
+张秀寅 4 nr
+张秀才 20 nr
+张秀眉 10 nr
+张秉贞 5 nr
+张秉贵 5 nr
+张秋明 2 nr
+张秋芳 3 nr
+张科进 2 nr
+张立东 10 nr
+张立义 4 nr
+张立伟 2 nr
+张立勇 6 nr
+张立嘉 2 nr
+张立基 3 nr
+张立文 6 nr
+张立昌 2 nr
+张立民 2 nr
+张立波 5 nr
+张立群 4 nr
+张笑非 9 nr
+张管家 3 nr
+张管营 8 nr
+张素我 2 nr
+张素颜 2 nr
+张紫阳 3 nr
+张红苗 3 nr
+张纪中 12 nr
+张纪法 10 nr
+张纯如 3 nr
+张纯自 2 nr
+张绍荣 3 nr
+张绍谦 4 nr
+张结义 2 nr
+张绣军 3 nr
+张继化 2 nr
+张继成 4 nr
+张继斌 2 nr
+张继明 2 nr
+张继民 5 nr
+张继波 3 nr
+张继禹 257 nr
+张继诗 3 nr
+张继钢 3 nr
+张绪明 2 nr
+张维佳 2 nr
+张维国 256 nr
+张维庆 12 nr
+张维赤 95 nr
+张维迎 82 nr
+张维邦 3 nr
+张缙彦 17 nr
+张罗 311 nr
+张美人 3 nr
+张美兰 256 nr
+张美瑶 3 nr
+张群任 2 nr
+张翠山 915 nr
+张翠鸾 2 nr
+张翼引 3 nr
+张翼德 17 nr
+张翼解 2 nr
+张耀光 6 nr
+张耀军 3 nr
+张耀坤 10 nrfg
+张耀扬 3 nr
+张耀曾 5 nr
+张耀武 2 nr
+张耀翔 3 nr
+张耀辉 2 nr
+张老师 3 nr
+张老汉 3 nr
+张老爷 25 nr
+张耘培 5 nr
+张聪沛 3 nr
+张肇基 2 nr
+张肯堂 3 nr
+张育林 5 nr
+张胜平 2 nr
+张胜温 3 nr
+张胜雄 2 nr
+张能奇 5 nr
+张脉偾兴 3 z
+张腊谏 2 nr
+张自忠 27 nr
+张自烈 159 nrfg
+张臭嘴 2 nr
+张致玲 6 nr
+张舒媛 256 nr
+张舜民 3 nr
+张良仁 2 nr
+张良借箸 3 n
+张良力 2 nr
+张良劝 3 nr
+张良华 2 nr
+张良基 3 nr
+张良庙 2 nr
+张良弼 8 nr
+张艺谋 46 nr
+张艾嘉 5 nr
+张苍水 4 nr
+张若虚 3 nr
+张若谷 5 nr
+张若锦 2 nr
+张若麟 2 nr
+张英俊 4 nr
+张英姿 3 nr
+张英才 659 nr
+张英杰 4 nr
+张英睿 2 nrfg
+张茂渊 6 nr
+张荣伟 2 nr
+张荣典 12 nr
+张荣发 5 nr
+张荫恒 2 nr
+张荫桓 10 nr
+张荫麟 6 nr
+张莉霞 5 nr
+张莹莹 2 nr
+张葛许 3 nr
+张蓉芳 4 nr
+张蓉蓉 256 nr
+张蓉镜 2 nr
+张蕴华 8 nr
+张蕾吴 2 nr
+张虎心 3 nr
+张虎道 11 nr
+张衡 109 nr
+张衡算 4 nr
+张袂成帷 3 i
+张袂成阴 3 i
+张裕民 2 nr
+张观准 2 nr
+张议潮 20 nr
+张贤亮 9 nr
+张贴 401 nr
+张贴人 3 nr
+张贴於 3 nr
+张贴标语 3 nr
+张贴者 3 nr
+张贵余 2 nr
+张贵兆 2 nr
+张贵入 3 nr
+张贵妃 2 nr
+张贵庄 2 nr
+张赢川 22 nr
+张起岩 2 nr
+张超文 3 nr
+张越男 3 nr
+张路峻 2 nr
+张车伟 2 nr
+张载 37 nrfg
+张辉瓒 14 nr
+张辛昕 31 nr
+张辽威 2 nr
+张辽引 5 nr
+张达明 3 nr
+张迁碑 2 nr
+张运来 2 nr
+张运镒 2 nr
+张近仁 10 nr
+张进忠 6 nr
+张连伟 2 nr
+张连忠 4 nr
+张连文 3 nr
+张选杰 3 nr
+张逸云 2 nr
+张遇贤 2 nr
+张道人 3 nr
+张道健 5 nr
+张道原 4 nr
+张道士 16 nr
+张道源 3 nr
+张道诚 2 nr
+张道陵 12 nr
+张邦基 4 nr
+张邦昌 29 nr
+张邦栋 2 nr
+张邱建 8 nr
+张郁兰 2 nr
+张都监 26 nr
+张释之 2 nr
+张重华 25 nr
+张野塘 2 nr
+张量 37 nr
+张量代数 3 nz
+张量分析 3 i
+张量积 3 nr
+张量阻抗 3 nz
+张金吾 2 nr
+张金定 6 nr
+张金富 2 nr
+张金海 3 nr
+张金牙 7 nr
+张金玉 8 nr
+张金生 2 nr
+张金科 2 nr
+张金称 3 nr
+张金红 2 nr
+张金线 2 nr
+张金莲 2 nr
+张金金 3 nr
+张金铭 6 nr
+张鑫成 24 nr
+张鑫炎 2 nr
+张钟俊 4 nr
+张钟英 3 nr
+张钰哲 8 nr
+张铁嘴 2 nr
+张铁林 5 nr
+张铁柱 2 nr
+张铁生 12 nr
+张铁男 71 nr
+张铭清 4 nr
+张银盘 2 nr
+张锁柱 4 nr
+张锡昌 10 nr
+张锡纯 3 nr
+张锡钧 3 nr
+张锦文 3 nr
+张锦瑟 5 nr
+张锦胜 2 nr
+张锦芯 2 nr
+张锦芳 8 nr
+张锦贵 3 nr
+张锦鸿 2 nr
+张镇芳 5 nr
+张镐哲 3 nr
+张长史 2 nr
+张长寿 2 nr
+张长青 4 nr
+张问仁 2 nr
+张问达 5 nr
+张闻天 172 nr
+张阁老 4 nr
+张阿生 70 nr
+张际春 2 nr
+张陵创 2 nr
+张陵捷 15 nr
+张难先 2 nr
+张雅心 5 nr
+张雅茹 3 nr
+张雅诗 2 nr
+张雨亭 2 nr
+张雨生 2 nr
+张雪杉 7 nr
+张雪梅 43 nr
+张震东 2 nr
+张震岳 3 nr
+张青松 3 nr
+张青莲 2 nr
+张青道 4 nr
+张靓影 3 nr
+张靓颖 8 nr
+张静初 3 nr
+张静双 5 nr
+张静娴 2 nr
+张静江 7 nr
+张非非 4 nr
+张韵涵 3 nr
+张韶涵 2 nr
+张页川 3 nr
+张顺再 2 nr
+张顺只 2 nr
+张顺因 2 nr
+张顺夜 2 nr
+张顺大 2 nr
+张顺引 2 nr
+张顺成 13 nr
+张顺摸 2 nr
+张顺早 2 nr
+张顺脱 2 nr
+张顺自 2 nr
+张顺见 2 nr
+张顺身 2 nr
+张顺进 2 nr
+张顺送 2 nr
+张顺道 6 nr
+张顺钦 2 nr
+张顺魂 2 nr
+张顾行 6 nr
+张飞 420 nr
+张飞庙 3 nr
+张飞引 2 nr
+张飞性 2 nr
+张飞闻 2 nr
+张飞雄 10 nr
+张首春 2 nr
+张首辅 11 nr
+张香帅 8 nr
+张香桐 9 nr
+张驴儿 3 nr
+张驹贤 4 nr
+张骏派 2 nr
+张骏祥 2 nr
+张骞 111 nr
+张骞入 2 nr
+张骞复 3 nr
+张骞所 3 nr
+张骞改 3 nr
+张骞至 3 nr
+张骞西 2 nr
+张骞通 19 nr
+张高丽 3 nr
+张高儿 2 nr
+张鲁之 3 nr
+张鲁大 5 nr
+张鲁欲 2 nr
+张鲸双 2 nr
+张鲸听 2 nr
+张鲸心 3 nr
+张鲸念 3 nr
+张鲸情 2 nr
+张鸿墀 3 nr
+张鸿平 2 nr
+张鸿眉 3 nr
+张鸿禄 2 nr
+张鸿鑫 3 nr
+张鹏翔 3 nr
+张鹏翮 3 nr
+张鹤镛 2 nr
+张鹤鸣 3 nr
+张黎明 3 nr
+张黎曾 2 nr
+张鼎丞 8 nrfg
+张鼎延 4 nr
+张鼐兄弟 2 nr
+张鼐刚 2 nr
+张鼐哥 13 nr
+张鼐奉 3 nr
+张鼐成 2 nr
+张鼐望 2 nr
+张鼐速 2 nr
+张鼓峰 5 nr
+张龙俊 256 nr
+张龙椅 2 nr
+弡 33 zg
+弢 42 zg
+弢迹匿光 3 n
+弤 7 zg
+弥 516 v
+弥久 3 v
+弥勒 144 nz
+弥勒佛 44 nrt
+弥勒县 6 ns
+弥合 41 v
+弥坚 3 n
+弥天 3 nz
+弥天大祸 6 i
+弥天大罪 13 nz
+弥天大谎 6 i
+弥天盖地 3 i
+弥封 3 v
+弥尔顿 3 nrt
+弥山亘野 3 ns
+弥年 3 n
+弥撒 37 v
+弥撒曲 21 ns
+弥散 76 v
+弥日累夜 3 l
+弥月 3 n
+弥望 3 v
+弥渡 2 v
+弥渡县 2 ns
+弥漫 609 v
+弥漫型 3 n
+弥漫性 46 n
+弥漫着 3 l
+弥猴桃 3 n
+弥留 36 v
+弥留之际 18 l
+弥缝 35 n
+弥缝其阙 3 i
+弥蒙 3 v
+弥补 843 v
+弥赛亚 3 nz
+弥足珍贵 30 i
+弥陀 28 nz
+弥雾机 3 l
+弦 4072 n
+弦乐 86 n
+弦乐器 56 n
+弦乐器组 3 n
+弦乐版 3 n
+弦乐队 2 n
+弦切角 3 i
+弦声 3 n
+弦外之响 3 i
+弦外之意 3 i
+弦外之音 52 i
+弦外有音 3 i
+弦子 42 n
+弦无虚发 3 i
+弦月 12 n
+弦歌 14 n
+弦琴 3 nr
+弦线 3 n
+弦重 3 n
+弦重市 3 n
+弦音 3 n
+弦音计 3 n
+弦马 3 n
+弧 532 n
+弧光 21 n
+弧光灯 3 n
+弧圈 8 n
+弧圈球 17 n
+弧度 93 n
+弧形 551 n
+弧形导 11 n
+弧段 2 n
+弧焊 7 n
+弧矢焦线 3 nr
+弧线 121 n
+弧线球 5 n
+弧菌 33 n
+弧间盆地 3 n
+弧面 11 n
+弧顶 11 n
+弨 2 zg
+弩 385 ng
+弩下逃箭 3 n
+弩弓 5 n
+弩张剑拔 3 n
+弩手 10 n
+弩机 22 n
+弩箭 70 n
+弪 2 g
+弬 121 zg
+弭 47 nr
+弭兵之会 3 v
+弯 2025 v
+弯上去 3 v
+弯上来 3 v
+弯下 3 v
+弯下去 3 v
+弯下来 3 v
+弯下身 3 v
+弯儿 52 n
+弯出去 3 v
+弯出来 3 v
+弯刀 86 n
+弯到 3 v
+弯勾 3 z
+弯去 3 v
+弯吧 3 n
+弯回 3 v
+弯回去 3 z
+弯回来 3 n
+弯头 4 v
+弯子 71 n
+弯度 6 n
+弯弓 104 v
+弯弓子 3 n
+弯弓饮羽 3 n
+弯弯 51 v
+弯弯曲曲 111 z
+弯弯的 53 z
+弯弯绕 8 v
+弯形 3 n
+弯成 3 v
+弯手机 3 n
+弯折 3 v
+弯曲 1238 v
+弯曲井眼 3 n
+弯曲处 3 z
+弯曲应力 3 n
+弯曲应变 3 n
+弯曲牙 3 n
+弯曲状 3 n
+弯曲表面 3 n
+弯月形 3 n
+弯来弯去 3 z
+弯着腰 3 v
+弯矩 11 n
+弯管 4 v
+弯管机 3 n
+弯脚 3 v
+弯腰 392 v
+弯腰哈背 3 n
+弯腰捧腹 3 v
+弯腰驼背 3 n
+弯膝礼 3 vn
+弯角 13 n
+弯谷函数 3 n
+弯起 3 v
+弯起来 3 v
+弯路 97 n
+弯身 3 v
+弯道 39 v
+弯部 3 n
+弰 25 zg
+弱 2984 a
+弱不好弄 3 v
+弱不禁风 40 i
+弱不胜衣 2 i
+弱位 3 n
+弱光 13 n
+弱光性 3 n
+弱冠 28 n
+弱冷空气 10 n
+弱势 241 n
+弱势团体 3 n
+弱势群体 3 i
+弱化 78 n
+弱卒 3 n
+弱国 46 n
+弱女子 3 n
+弱守恒型 3 n
+弱小 171 n
+弱小民族 3 n
+弱市中 3 n
+弱徘徊集 3 vn
+弱旅 23 n
+弱智 76 n
+弱智人 3 n
+弱智儿童 3 n
+弱智女 3 n
+弱本强末 3 n
+弱柳扶风 3 i
+弱模格 3 n
+弱水 31 n
+弱水三千 3 i
+弱水之隔 3 i
+弱点 641 n
+弱电 3 n
+弱碱 30 n
+弱者 217 n
+弱肉强食 25 i
+弱苗 3 n
+弱视 14 n
+弱解 3 v
+弱质 15 n
+弱酸 41 n
+弱酸性 3 n
+弱队 3 n
+弱阳性 3 n
+弱音 3 n
+弱音器 6 n
+弱项 54 n
+弳 13 zg
+弴 6 zg
+張 400 zg
+弶 60 zg
+強 49 zg
+弸 31 zg
+弸中彪外 3 nr
+弹 4578 v
+弹上去 3 v
+弹上来 3 l
+弹下 3 n
+弹下去 3 l
+弹下来 3 l
+弹不出 3 v
+弹不来 3 l
+弹不虚发 3 i
+弹丝品竹 3 n
+弹丸 185 n
+弹丸之地 35 i
+弹丸脱手 3 i
+弹丸黑子 3 i
+弹丸黑志 3 i
+弹体 4 n
+弹入 3 n
+弹冠振衣 3 n
+弹冠相庆 15 i
+弹冠结绶 3 i
+弹出 3 v
+弹出去 3 i
+弹出式 3 n
+弹出来 3 l
+弹到 3 v
+弹剑作歌 3 i
+弹力 63 n
+弹力丝 3 n
+弹力呢 3 n
+弹力布 3 n
+弹力袜 2 n
+弹力面料 3 n
+弹动 3 n
+弹劾 615 v
+弹劾权 3 vn
+弹劾案 3 vn
+弹劾法 3 vn
+弹匣 200 n
+弹升 3 v
+弹压 66 n
+弹合 3 v
+弹唱 66 n
+弹回 14 v
+弹回去 3 l
+弹回来 3 l
+弹坑 42 n
+弹塑性 28 n
+弹壳 209 n
+弹头 507 n
+弹夹 43 n
+弹奏 126 n
+弹奏乐器 3 n
+弹奏出 3 n
+弹奏着 3 n
+弹妥 3 v
+弹子 62 n
+弹子房 4 n
+弹子抬 3 v
+弹子枱 3 vn
+弹子锁 3 n
+弹孔 17 n
+弹完 3 v
+弹射 207 v
+弹射器 3 n
+弹尽援绝 4 i
+弹尽粮绝 32 i
+弹带 3 n
+弹幕 3 n
+弹库 9 n
+弹开 3 v
+弹弓 78 n
+弹引 3 v
+弹弹 3 n
+弹弹琴 2 n
+弹性 1125 n
+弹性介质 3 n
+弹性体 50 n
+弹性元件 3 n
+弹性力 3 n
+弹性控制 3 n
+弹性散射 3 n
+弹性模量 34 l
+弹性疲乏 3 i
+弹性硫 3 n
+弹性系数 2 l
+弹拔乐器 3 n
+弹拨 15 v
+弹拨乐 3 n
+弹拨乐器 13 n
+弹指 114 n
+弹指一挥间 8 n
+弹指之间 2 i
+弹指光阴 3 n
+弹指如飞 3 i
+弹指神功 3 i
+弹掉 3 v
+弹斤估两 3 n
+弹无虚发 11 i
+弹来弹去 3 i
+弹棉花 3 n
+弹法 3 n
+弹涂鱼 15 n
+弹炮 3 n
+弹片 64 n
+弹状病毒 3 n
+弹珠 3 n
+弹珠台 3 n
+弹球 11 n
+弹琴 169 n
+弹痕 5 n
+弹痕累累 3 l
+弹着点 25 n
+弹空说嘴 3 l
+弹窗 3 n
+弹筝 3 n
+弹簧 239 n
+弹簧刀 3 n
+弹簧厂 3 n
+弹簧圈 3 n
+弹簧地板 3 n
+弹簧床 4 n
+弹簧机 4 n
+弹簧椅 3 n
+弹簧片 3 n
+弹簧秤 6 n
+弹簧钢 18 n
+弹簧铰链 3 nz
+弹簧锁 3 n
+弹簧门 13 n
+弹腿 3 n
+弹膛 3 n
+弹花机 3 n
+弹药 1121 n
+弹药兵 3 n
+弹药库 52 n
+弹药筒 3 n
+弹药箱 34 n
+弹药罪 3 n
+弹葯 3 vn
+弹词 95 n
+弹起 50 v
+弹起来 3 l
+弹跳 53 v
+弹跳力 3 n
+弹跳板 3 n
+弹过去 3 l
+弹过来 3 l
+弹道 313 n
+弹道学 62 n
+弹道导弹 872 n
+弹道式 10 n
+弹道飞弹 3 n
+弹钢琴 3 n
+弹铗无鱼 3 nz
+弹雨 20 n
+弹雨枪林 3 n
+强 17342 a
+强中更有强中手 8 l
+强中自有强中手 2 l
+强买强卖 8 l
+强于 141 v
+强亦冲 2 nr
+强人 142 n
+强人所难 19 l
+强人政权 3 n
+强令 61 n
+强似 3 a
+强作 3 vn
+强作解人 2 n
+强借 3 v
+强健 133 a
+强光 131 n
+强光照 2 nr
+强克弱 2 nr
+强兵 3 n
+强兵劲 2 nr
+强兵富国 3 nr
+强军 22 n
+强冷空气 3 l
+强凌弱 2 nr
+强凫变鹤 3 nz
+强击 24 v
+强击机 77 n
+强则扬 4 nr
+强到 3 v
+强制 932 v
+强制保险 3 n
+强制力 30 n
+强制处分 3 l
+强制性 198 n
+强制手段 3 n
+强制执行 3 n
+强制排流 3 l
+强制措施 3 n
+强制电流 3 n
+强刺激 4 v
+强力 559 n
+强力性 3 n
+强力攻占 3 nr
+强力胶 3 n
+强加 206 v
+强加于 3 v
+强加于人 15 l
+强加在 3 v
+强劲 786 a
+强劲有力 3 n
+强势 735 n
+强势股 3 n
+强化 1484 v
+强化剂 47 n
+强化措施 3 n
+强化班 32 n
+强化系 3 n
+强化训练 3 n
+强化食品 7 l
+强化骨骼 3 n
+强华 2 a
+强占 416 v
+强占性 3 n
+强卫 3 v
+强压 36 v
+强压怒火 3 l
+强县 8 n
+强取 3 v
+强取勒索 3 nr
+强取民 2 nr
+强取豪夺 8 i
+强台风 14 nr
+强唇劣嘴 3 l
+强啡肽 3 n
+强嘴 8 v
+强嘴拗舌 3 nr
+强嘴硬牙 3 l
+强固 20 a
+强国 358 n
+强国之梦 3 l
+强国之路 3 l
+强国富民 3 nr
+强基增 2 nr
+强壮 263 a
+强壮剂 7 n
+强壮有力 3 l
+强壮起来 3 l
+强大 3837 a
+强夺 20 v
+强夺官 2 n
+强夺民 2 n
+强奏 3 v
+强奸 211 n
+强奸案 3 n
+强奸民意 4 l
+强奸犯 9 n
+强奸罪 26 i
+强好胜 2 nr
+强娶 3 v
+强子 55 n
+强子谱 2 nr
+强存弱 2 l
+强学会 81 n
+强宁斯 2 nr
+强宾 2 n
+强对流 3 n
+强将 37 n
+强将手下 3 i
+强将手下无弱兵 13 i
+强己益 2 n
+强巴阿擦 3 n
+强干弱枝 6 n
+强庄股 3 nr
+强度 1811 n
+强度削弱 3 n
+强度极限 3 n
+强度量 3 n
+强开 3 v
+强弓劲弩 3 nr
+强弓射 5 nr
+强弩之末 50 i
+强弩之极 3 i
+强弩末矢 3 i
+强弱 326 a
+强弱电 3 l
+强强 31 v
+强强合作 2 l
+强强联合 23 l
+强征 34 n
+强征公 2 nr
+强征强 2 nr
+强征来 2 nr
+强徒 25 n
+强得易贫 3 l
+强心 27 n
+强心利 2 nr
+强心剂 14 n
+强心甙 3 n
+强心药 3 n
+强心针 11 n
+强忍 229 a
+强悍 358 a
+强手 51 v
+强手如云 3 l
+强手如林 4 l
+强打者 3 n
+强扭的瓜不甜 10 l
+强抢 3 v
+强拆 7 v
+强拍 3 v
+强推 3 vn
+强擎之末 3 nr
+强攻 123 v
+强效 5 a
+强敌 289 v
+强整欢 2 nr
+强文假醋 3 i
+强文浉醋 3 v
+强暴 222 a
+强暴犯 3 l
+强有力 426 n
+强本弱支 3 n
+强本弱末 3 n
+强本弱枝 3 n
+强本节用 3 n
+强权 112 n
+强权国家 3 l
+强权政治 53 n
+强枝弱本 3 l
+强梁 9 n
+强梢允 3 nr
+强梢缘 2 nr
+强棒 3 n
+强横 82 a
+强横霸道 6 l
+强死强活 3 i
+强死赖活 3 n
+强毅 3 a
+强求 123 v
+强汉者 2 nr
+强派 3 n
+强渡 124 v
+强渡江河 3 nz
+强点 2 n
+强烈 5076 a
+强烈不满 3 i
+强烈反响 3 l
+强烈反应 3 l
+强烈反抗 3 i
+强烈呼吁 3 i
+强烈度 3 l
+强烈建议 3 l
+强烈抗议 3 i
+强烈推荐 3 i
+强烈欲望 3 i
+强烈要求 3 l
+强烈锓 3 nr
+强烈颱风 3 nr
+强热带 3 n
+强爷 2 n
+强生 23 v
+强电解质 3 n
+强留 31 v
+强痛定 3 n
+强的松 11 n
+强的松龙 6 nr
+强益骄 3 nr
+强盗 1015 n
+强盗窝 3 n
+强盛 832 a
+强盛时期 3 n
+强盛起来 3 l
+强直 46 d
+强直性 10 n
+强直自遂 3 nr
+强相抗 2 nr
+强硬 284 a
+强硬态度 3 l
+强硬手段 3 n
+强硬措施 3 n
+强硬派 24 n
+强碱 62 n
+强磁 6 n
+强磁场 3 n
+强租 3 n
+强立鲁 3 nr
+强笑道 2 l
+强筋 6 n
+强筋骨 3 l
+强索 2 v
+强者 306 n
+强而后可 3 l
+强而有力 3 l
+强而有劲 3 l
+强聒不舍 3 v
+强胜 4 v
+强脊炎 3 nr
+强脾气 3 v
+强自取折 3 i
+强自取柱 3 i
+强自忍 19 nr
+强致敏 2 nr
+强舰 2 n
+强藩巨 3 nr
+强行 798 v
+强行军 8 n
+强行性 7 n
+强行摊派 3 n
+强行进入 3 n
+强行通过 3 l
+强袭 3 v
+强要 3 a
+强角 3 n
+强记 12 n
+强记博闻 3 n
+强记洽闻 3 n
+强识博闻 3 n
+强词夺正 3 i
+强词夺理 38 i
+强调 6318 v
+强调指出 3 l
+强身 32 v
+强身健体 37 l
+强身健魄 3 l
+强辩 24 v
+强过 3 v
+强还原剂 3 n
+强迫 1066 a
+强迫式 2 n
+强迫性 37 n
+强迫振荡 3 n
+强迫接受 3 n
+强迫症 37 n
+强迫观念 3 n
+强迫降落 3 n
+强逞暴 16 nr
+强逼 34 v
+强邦 16 n
+强邻 3 v
+强邻相 16 nr
+强酸 57 n
+强间 3 n
+强队 115 n
+强降水 3 n
+强降雨 3 nr
+强隐式法 3 l
+强雄弱 16 l
+强震 25 n
+强韧 24 a
+强音 5 n
+强项 103 n
+强颜 6 nr
+强颜欢笑 18 i
+强风 36 n
+强食弱肉 3 l
+强食自爱 3 l
+强食靡角 3 i
+强龙不压地头蛇 12 i
+弻 43 zg
+弼 115 g
+弽 253 zg
+彀 190 zg
+彁 118 zg
+彂 229 zg
+彃 15 zg
+彅 9 zg
+彇 106 zg
+彈 105 zg
+彉 76 zg
+彊 62 zg
+彌 26 zg
+彍 24 zg
+彎 2 zg
+归 7299 v
+归一化 3 l
+归为此类 3 i
+归丽鹃 2 nr
+归义王 3 nr
+归义羌 2 nr
+归之若水 3 i
+归乡 42 v
+归二侠 11 nr
+归二娘 58 nr
+归于 587 v
+归云庄 64 nr
+归云洞 3 nr
+归亚蕾 2 nr
+归仁 5 nr
+归仁军 2 nr
+归位 43 v
+归位键 3 n
+归依 29 nr
+归依法 3 nr
+归侨 323 n
+归元寺 3 nr
+归入 248 v
+归全反真 3 i
+归公 374 nr
+归到 3 v
+归功 158 v
+归功于 3 v
+归化 36 vn
+归化城 9 nr
+归十归一 3 i
+归卷 3 v
+归去 78 v
+归去来 3 l
+归去来兮 7 i
+归口 64 vn
+归向 8 v
+归周公 3 nr
+归咎 128 v
+归咎于 3 l
+归回 3 v
+归因 17 n
+归因于 69 v
+归因偏向 3 i
+归国 326 ns
+归国华侨 3 n
+归城邦 32 nr
+归墟卦 3 nr
+归墟青 2 nr
+归墟龙 2 nr
+归天 69 v
+归奇顾怪 3 i
+归奴尔 2 nr
+归子炽 2 nr
+归宁 3 nr
+归宗岩 2 nr
+归家 3 nr
+归宿 213 v
+归宿感 5 nr
+归宿点 5 n
+归小明 3 nr
+归尔甫 9 nr
+归属 638 v
+归属于 3 l
+归属其 3 nr
+归属感 52 n
+归属权 3 n
+归州 270 ns
+归州镇 2 ns
+归师伯 5 nr
+归师勿掩 3 i
+归平阳 2 ns
+归并 84 v
+归并到 3 l
+归并在 3 i
+归幽州 2 nr
+归归还 3 i
+归往 3 v
+归往何处 3 i
+归御营 5 nr
+归德侯 3 nr
+归德府 12 nr
+归心 70 v
+归心似箭 19 i
+归心如箭 3 l
+归怀州 2 nr
+归总 10 nr
+归报尔 2 nr
+归拢 16 v
+归拾 3 v
+归政成 3 nr
+归敬 3 v
+归整 3 vn
+归春河 2 nr
+归有光 6 nr
+归期 19 vn
+归本邦 16 nr
+归来 728 v
+归根 9 nr
+归根到底 100 l
+归根究底 3 i
+归根究柢 3 i
+归根结底 177 i
+归根结柢 5 i
+归根结蒂 11 i
+归案 36 v
+归档 169 v
+归档库 3 l
+归档文件 29 l
+归正守丘 3 nr
+归正邱首 3 nr
+归正首丘 3 nr
+归正首邱 3 nr
+归水泊 2 nr
+归法 3 v
+归海 7 ns
+归狱 3 v
+归理藩 2 nr
+归田 14 nr
+归田录 5 nr
+归省 7 ns
+归真 21 nr
+归真反朴 3 i
+归真反璞 3 i
+归真返璞 3 i
+归科布 2 nr
+归程 17 n
+归类 77 vn
+归类法 3 n
+归约 12 v
+归约机 3 n
+归纳 630 v
+归纳公理 3 nr
+归纳到 3 l
+归纳如下 3 i
+归纳定义 3 nr
+归纳推理 23 i
+归纳法 38 nr
+归纳起来 3 l
+归终 3 v
+归结 422 v
+归结为 3 v
+归结到 3 v
+归结点 2 n
+归给 3 v
+归绥 8 nr
+归罪 57 vn
+归罪于 3 l
+归置 9 v
+归而结网 3 i
+归航 16 v
+归葬 15 v
+归藏 10 v
+归虚青 2 nr
+归行率 3 n
+归西 26 ns
+归诸于 3 l
+归谁 3 nr
+归谬法 4 i
+归责 3 v
+归路 102 n
+归辛树 90 nr
+归返 3 v
+归还 584 v
+归还给 3 i
+归还者 4 nr
+归途 56 n
+归通昌 2 nr
+归里包堆 3 l
+归银联 2 nr
+归队 61 n
+归附 260 v
+归降 172 v
+归除 3 v
+归随 3 v
+归随于 3 l
+归隐 82 nr
+归集 23 v
+归集率 2 n
+归集额 3 n
+归零 3 v
+归零道 3 i
+归顺 180 nr
+归顺于 3 nr
+归马放牛 3 nz
+归齐 3 nr
+当 42694 t
+当一回事 3 i
+当一天和尚撞一天钟 3 i
+当一当 3 d
+当上 3 t
+当上去 3 t
+当上来 3 t
+当下 4358 t
+当不上 3 t
+当不了 38 t
+当不成 3 v
+当不来 3 t
+当不起 3 v
+当世 3 t
+当世才度 3 i
+当世无双 3 i
+当个 3 t
+当中 2311 s
+当之无愧 238 i
+当之有愧 3 i
+当了 3 p
+当事 60 n
+当事人 1135 n
+当事国 53 n
+当事方 5 n
+当事者 36 n
+当于 3 p
+当仁不让 80 i
+当今 1855 t
+当今世界 3 i
+当今无辈 3 i
+当今社会 3 l
+当代 1649 t
+当代世界 3 n
+当代世界出版社 3 l
+当代人 31 n
+当代作家 3 n
+当代史 8 n
+当代大师 3 n
+当代小说 3 l
+当代意识 3 i
+当代文学 3 n
+当代艺术 3 n
+当令 17 n
+当众 389 n
+当众出丑 3 i
+当众宣布 3 i
+当众脱 3 v
+当众表明 3 i
+当众表示 3 n
+当作 1859 v
+当值 182 n
+当做 721 v
+当儿 498 t
+当先 542 d
+当兵 431 n
+当刑而王 3 i
+当初 2093 t
+当到 3 v
+当前 2433 t
+当前之计 3 i
+当前任务 3 n
+当前工作 3 l
+当前情况 3 l
+当前状况 3 l
+当前目录 36 i
+当前页 3 n
+当务之争 3 i
+当务之急 307 i
+当务始终 3 i
+当午 3 t
+当即 3126 d
+当口 3 s
+当否 3 v
+当周 4 t
+当啷 102 o
+当回事 3 i
+当国 3 t
+当在 3 t
+当地 7272 s
+当地人 382 n
+当地化 2 ns
+当地政府 3 n
+当场 1223 s
+当场出丑 3 n
+当场出彩 3 i
+当场听到 3 v
+当场抓到 3 l
+当场看到 3 v
+当堂 19 n
+当夜 221 t
+当夜幕 3 n
+当天 1616 t
+当头 311 s
+当头一棒 26 i
+当头对面 3 n
+当头棒喝 27 i
+当头炮 2 n
+当奴才 3 n
+当好 88 d
+当学徒 3 n
+当官 265 n
+当家 214 n
+当家人 24 n
+当家作主 394 i
+当家做主 18 i
+当家理纪 3 n
+当家理财 3 i
+当家的 123 n
+当家立业 3 n
+当家立事 3 i
+当家立纪 3 n
+当家立计 3 i
+当家花旦 3 i
+当家菜 3 n
+当局 2194 n
+当局者 18 n
+当局者迷 18 i
+当差 45 n
+当年 7633 t
+当年度 21 t
+当庭 31 n
+当归 126 v
+当归鸭 3 n
+当当价 3 v
+当当网 3 v
+当得 3 v
+当得上 3 d
+当得来 3 d
+当得起 3 v
+当心 159 n
+当惹雍错 14 ns
+当成 678 v
+当掉 3 v
+当政 164 n
+当政者 9 n
+当文件 3 n
+当断不断 12 i
+当断则断 3 i
+当日 2031 t
+当日份 3 n
+当时 19195 t
+当是 3 d
+当晚 665 t
+当月 88 t
+当月份 3 t
+当朝 3 t
+当机立决 3 i
+当机立断 162 i
+当权 148 n
+当权派 71 n
+当权者 82 n
+当来当去 3 i
+当次 3 t
+当此 3 d
+当涂 25 n
+当涂县 9 ns
+当炮灰 10 n
+当然 12865 d
+当爱已 3 i
+当牛做马 9 i
+当牛马 4 ns
+当班 27 v
+当班人员 3 n
+当用 3 v
+当用则用 3 n
+当真 2426 d
+当着 665 p
+当着不着 3 l
+当票 9 n
+当空 51 s
+当空照 3 n
+当空舞 3 i
+当立之年 3 i
+当紧 3 d
+当红 167 n
+当老板 3 n
+当耳旁风 3 i
+当耳边风 3 i
+当腰 3 d
+当自强 3 i
+当行出色 3 i
+当行本色 3 n
+当街 74 s
+当街卖 3 i
+当起 3 s
+当路 3 n
+当轴处中 3 l
+当过 3 p
+当过兵 3 n
+当选 2919 v
+当选者 20 n
+当道者 3 n
+当量 134 n
+当量浓度 3 n
+当铺 154 n
+当铺老板 3 n
+当门抵户 3 l
+当间 3 t
+当间儿 6 n
+当阳 345 t
+当阳市 263 ns
+当雄 26 n
+当雄县 10 ns
+当面 708 f
+当面交易 3 n
+当面言明 3 i
+当面错过 3 i
+当面锣 3 n
+当风秉烛 3 i
+当鼠标 3 n
+彔 23 zg
+录 1833 zg
+录上去 3 v
+录上来 3 v
+录下 3 v
+录下去 3 v
+录下来 3 v
+录事 3 n
+录供 3 v
+录像 313 v
+录像仪 3 n
+录像厅 2 n
+录像室 2 n
+录像带 69 n
+录像机 91 n
+录像片 22 n
+录像片儿 3 n
+录像盘 3 n
+录入 38 v
+录入员 3 n
+录到 3 v
+录制 162 v
+录取 4370 v
+录取人数 3 n
+录取分数 3 n
+录取名单 3 n
+录取名额 3 n
+录取率 327 n
+录取线 58 n
+录取者 19 n
+录录 3 v
+录录歌 3 n
+录录音 3 n
+录影 2 n
+录影唱片 3 n
+录影带 3 n
+录影机 3 n
+录得 18 v
+录成 3 v
+录播 11 vn
+录放 21 v
+录放像机 4 n
+录放机 16 n
+录放音 3 n
+录歌 3 n
+录点 3 n
+录用 481 v
+录相 3 n
+录相带 3 n
+录相机 3 n
+录相片 3 n
+录象 9 n
+录象带 3 n
+录象机 3 n
+录起 3 v
+录起来 3 v
+录载 3 v
+录过 3 v
+录音 355 n
+录音员 3 n
+录音器 3 n
+录音场 3 n
+录音室 2 n
+录音师 2 n
+录音带 124 n
+录音机 143 n
+录音棚 7 n
+录音电话 3 n
+录音磁带 3 n
+录音笔 2 n
+录音系统 3 n
+彖 21 g
+彗 60 n
+彗发 3 n
+彗尾 3 n
+彗形象差 3 n
+彗星 246 n
+彗核 3 n
+彗汜画涂 3 v
+彗泛画涂 3 n
+彘 97 g
+彙 39 zg
+彛 147 zg
+彜 141 zg
+彝 382 nz
+彝人 3 nz
+彝人制造 3 l
+彝剧 3 nz
+彝山 3 nz
+彝文 5 nz
+彝族 734 nz
+彝海结盟 2 nz
+彝良 2 nz
+彝良县 3 ns
+彝语 28 nz
+彞 30 zg
+彟 63 zg
+形 7698 n
+形不成 11 v
+形义 3 n
+形事 3 n
+形于辞色 2 i
+形似 630 v
+形体 385 n
+形体美 6 n
+形像 3 v
+形具神生 3 l
+形制 734 v
+形劫势禁 3 i
+形势 5510 n
+形势严峻 3 i
+形势危急 3 i
+形势教育 3 l
+形势逼人 4 i
+形单只影 3 i
+形单影双 3 i
+形单影只 18 n
+形变 89 v
+形同 65 v
+形同虚设 68 l
+形同陌路 3 vn
+形声 19 n
+形声字 25 n
+形如 3 v
+形如槁木 3 i
+形孤影只 3 i
+形孤影寡 3 i
+形学 3 n
+形容 870 n
+形容尽致 3 i
+形容憔悴 14 l
+形容枯槁 3 i
+形容消瘦 3 i
+形容词 122 n
+形式 15188 n
+形式主义 148 n
+形式化 57 v
+形式参数 3 l
+形式各异 7 l
+形式多样 41 l
+形式演算 3 l
+形式系统 13 l
+形式美 42 v
+形式语言 3 l
+形式运思 3 l
+形式逻辑 38 l
+形形色色 203 n
+形影 20 n
+形影不离 79 i
+形影相依 3 i
+形影相吊 5 i
+形影相对 3 i
+形影相附 3 i
+形影相随 3 i
+形影自吊 3 i
+形影自守 3 i
+形态 2559 n
+形态各异 38 l
+形态学 97 n
+形态意识 3 n
+形意 6 v
+形意拳 23 n
+形成 25854 v
+形成函数 3 l
+形成层 52 n
+形成期 17 n
+形数 3 n
+形旁 8 n
+形枉影曲 3 n
+形样 3 n
+形格势禁 20 i
+形槁心灰 3 i
+形槽 4 n
+形状 2015 n
+形状知觉 3 l
+形状算子 3 n
+形状美好 3 l
+形状记忆 7 n
+形相 64 n
+形码 3 n
+形码辅助 3 n
+形神 65 n
+形神各异 3 l
+形神妙肖 3 i
+形禁势格 3 n
+形而上 55 l
+形而上学 190 l
+形而上者 8 n
+形而下 21 l
+形而下者 8 n
+形胜 3 v
+形色 3 n
+形色仓皇 3 n
+形诸笔墨 3 i
+形象 4911 n
+形象化 42 n
+形象各异 3 l
+形象大使 3 n
+形象工程 3 n
+形象店 3 n
+形象思维 24 n
+形象性 16 n
+形象气质 3 n
+形象清新 3 l
+形象艺术 3 n
+形象记忆 3 n
+形象设计 3 n
+形貌 183 n
+形质 3 n
+形质学派 3 n
+形踪 3 v
+形输色授 3 n
+形迹 90 n
+形迹可疑 14 i
+形重错觉 3 i
+形销骨立 8 n
+形音 3 n
+形音码 3 n
+形骸 42 n
+彣 4 zg
+彤 89 zg
+彤云 22 n
+彤云密布 3 n
+彥 4 zg
+彦 757 zg
+彦士 3 nrfg
+彦涵 13 nrfg
+彧 403 zg
+彧中 3 vn
+彨 165 zg
+彩 2318 n
+彩云 205 n
+彩云易散 3 n
+彩云追月 3 l
+彩云飞 4 nz
+彩京 3 nz
+彩信 33 nz
+彩信网 3 nz
+彩儿 3 n
+彩光 10 n
+彩光板 3 n
+彩凤随鸦 3 n
+彩券 3 n
+彩印 272 n
+彩印包装 3 n
+彩印厂 4 n
+彩卷 3 n
+彩号 36 n
+彩喷 3 nz
+彩喷纸 3 n
+彩团 2 n
+彩图 185 n
+彩图库 3 nz
+彩图版 3 n
+彩塑 89 n
+彩墨画 4 n
+彩壳 3 n
+彩头 41 n
+彩妆 29 n
+彩妆品 3 n
+彩妆师 3 n
+彩屏 37 n
+彩屏机 3 l
+彩市 3 n
+彩布条 3 n
+彩带 53 n
+彩度 3 n
+彩打 3 n
+彩扩 3 n
+彩扩店 2 n
+彩扩机 3 n
+彩报 3 n
+彩排 103 n
+彩斑 9 n
+彩旗 81 n
+彩旗猎猎 3 n
+彩旦 6 nz
+彩显 12 nz
+彩条 7 n
+彩板 8 n
+彩棉 3 n
+彩棚 16 n
+彩楼 3 n
+彩欣 3 i
+彩民 96 n
+彩泥画 3 n
+彩涂卷 3 n
+彩涂板 3 n
+彩灯 70 n
+彩照 7 n
+彩牌楼 3 n
+彩球 12 n
+彩瓦机 3 n
+彩瓷 37 n
+彩电 369 n
+彩电业 11 n
+彩电价格 3 n
+彩画 449 n
+彩盘 3 n
+彩石 10 n
+彩礼 45 n
+彩票 249 n
+彩票工具 3 n
+彩票案 3 n
+彩票网 3 n
+彩票论坛 3 n
+彩票软件 3 l
+彩福星 3 n
+彩秀网 3 n
+彩笔 7 n
+彩笔生花 3 nz
+彩笺 3 n
+彩管 9 n
+彩粉 3 n
+彩粉画 3 n
+彩纸 10 n
+彩纸带 3 n
+彩线 3 n
+彩练 6 n
+彩绘 1255 n
+彩绘机 3 n
+彩绣 10 n
+彩绸 147 n
+彩舆 3 n
+彩色 730 n
+彩色动画 3 n
+彩色印片 3 n
+彩色合成 3 n
+彩色图像 16 n
+彩色图片 3 n
+彩色带 3 n
+彩色打印机 2 l
+彩色显示 4 n
+彩色显示器 9 n
+彩色棉 3 n
+彩色照片 3 n
+彩色片 10 n
+彩色片儿 3 n
+彩色版 3 n
+彩色玻璃 3 n
+彩色电影 3 n
+彩色电视 45 l
+彩色笔 3 n
+彩色纸 3 n
+彩色缤纷 3 i
+彩色那 3 n
+彩色钢板 3 n
+彩色钥匙 3 n
+彩花 4 n
+彩虹 258 nz
+彩虹仙子 3 n
+彩虹六号 3 n
+彩虹女 3 n
+彩虹桥 8 n
+彩虹门 3 n
+彩蛋 10 n
+彩蝴蝶 3 nr
+彩蝶 24 n
+彩蝶飞舞 3 n
+彩衣 3 n
+彩衣娱亲 3 n
+彩装 2 n
+彩调 3 n
+彩超 10 j
+彩车 30 n
+彩轿 3 n
+彩釉 17 n
+彩釉陶 3 n
+彩钢板 3 n
+彩钢瓦 3 nz
+彩钱 3 n
+彩铃网 3 n
+彩门 12 n
+彩陶 622 n
+彩陶文化 6 nz
+彩霞 78 n
+彩霞满天 3 nz
+彩霸王 3 nz
+彩饰 9 n
+彩饰版 3 n
+彪 437 zg
+彪升 3 v
+彪壮 3 a
+彪形 2 b
+彪形大汉 20 i
+彪悍 35 a
+彪炳 15 v
+彪炳千古 3 i
+彪炳千秋 3 i
+彪炳史册 6 i
+彪炳春秋 3 i
+彪马 3 v
+彫 16 zg
+彫章镂句 3 i
+彫虫小技 3 nz
+彫虫篆刻 3 vn
+彬 714 zg
+彬县 14 ns
+彬彬 5 i
+彬彬有礼 83 i
+彬彬济济 3 i
+彭 1030 nr
+彭三春 39 nr
+彭世洛 2 nr
+彭丽媛 3 nr
+彭久洋 2 nr
+彭义斌 2 nr
+彭云鹤 2 nr
+彭亨 13 nr
+彭亨州 4 nr
+彭亨河 2 nr
+彭人骐 2 nr
+彭代雷 3 nr
+彭仰林 2 nr
+彭伟军 4 nr
+彭佩云 2 nr
+彭佳屿 4 nr
+彭佳慧 3 nr
+彭俐侬 3 nr
+彭修文 4 nr
+彭元瑞 5 nr
+彭兄弟 2 nr
+彭先生 3 nr
+彭光谦 5 nr
+彭克玉 258 nr
+彭公达 4 nr
+彭兴庭 3 nr
+彭兴韵 4 nr
+彭其关 3 nr
+彭其劫 2 nr
+彭其叫 2 nr
+彭其吓 2 nr
+彭其将军 4 nr
+彭其抢 2 nr
+彭其活 2 nr
+彭其跳 2 nr
+彭内塔 3 nr
+彭剑锋 5 nr
+彭加勒 9 nr
+彭加木 3 nr
+彭博社 10 nr
+彭县 3 ns
+彭参将 3 nr
+彭叔夏 6 nr
+彭司令 5 nr
+彭吴至 2 nr
+彭和尚 63 nr
+彭嘉陵 2 nr
+彭四保 14 nr
+彭四娘 3 nr
+彭国彦 8 nr
+彭国桢 6 nr
+彭城王 3 nr
+彭士量 8 nr
+彭大哥 9 nr
+彭大师 5 nr
+彭大雅 2 nr
+彭天锡 3 nr
+彭头山 6 nr
+彭子晴 3 nr
+彭安东 16 nr
+彭宏伟 3 nr
+彭定康 2 nr
+彭定求 3 nr
+彭家煌 4 nr
+彭寨主 13 nr
+彭小姐 2 nr
+彭小平 2 nr
+彭小枫 3 nr
+彭小民 3 nr
+彭山 14 nr
+彭山县 10 ns
+彭岚兰 2 nr
+彭州 13 ns
+彭州市 3 ns
+彭布罗克 2 ns
+彭广京 4 nr
+彭张青 2 nr
+彭德尔 7 nr
+彭德怀 471 nr
+彭志海 40 nr
+彭总停 2 nr
+彭总才 2 nr
+彭总昕 3 nr
+彭总望 3 nr
+彭总眯 2 nr
+彭总端 2 nr
+彭总转 2 nr
+彭振山 5 nr
+彭文晶 5 nr
+彭斐章 2 nr
+彭智勇 5 nr
+彭桓武 258 nr
+彭楚政 86 nr
+彭楚藩 3 nr
+彭水苗族土家族自治县 4 ns
+彭沛谷 2 nr
+彭泽 33 nr
+彭泽令 5 nr
+彭泽县 8 nr
+彭泽成 2 nr
+彭泽民 3 nr
+彭泽益 3 nr
+彭清华 256 nr
+彭湖 3 nr
+彭湖县 3 ns
+彭湘湘 62 nr
+彭爱学 2 nr
+彭爱萍 2 nr
+彭玉麟 5 nr
+彭珮云 13 nr
+彭畈乡 3 vn
+彭登怀 19 nr
+彭真 268 nr
+彭祖 17 nr
+彭禹贤 2 nr
+彭红艳 256 nr
+彭绍荣 6 nr
+彭胜竹 4 nr
+彭茜卢 48 nr
+彭莹玉 114 nr
+彭萨科拉 2 nr
+彭蠡泽 18 nr
+彭裕商 3 nr
+彭赛列 24 nr
+彭越封 2 nr
+彭进士允 2 nr
+彭连虎 222 nr
+彭述之 25 nr
+彭长老 144 nr
+彭阳 3 nr
+彭阳县 2 ns
+彭雪枫 3 nr
+彭齐亚 6 nr
+彮 45 zg
+彯 3 zg
+彰 240 ns
+彰化 31 v
+彰化人 3 ns
+彰化县 17 ns
+彰化市 9 ns
+彰化教育 3 ns
+彰善瘅恶 3 vn
+彰彰 3 v
+彰德 3 ns
+彰扬 3 v
+彰明 3 ns
+彰明较着 3 y
+彰明较著 3 v
+彰显 62 v
+彰武 13 ns
+彰武县 3 ns
+彰武市 3 ns
+彰银 3 v
+影 2202 vn
+影业 99 vn
+影业公司 3 n
+影人 3 n
+影像 335 vn
+影像学 24 n
+影像转换 3 i
+影儿 50 n
+影写 3 vn
+影剧 10 n
+影剧圈 3 n
+影剧界 3 n
+影剧院 58 n
+影区 3 n
+影印 120 vn
+影印件 7 n
+影印本 38 n
+影印机 3 n
+影印版 3 n
+影只形单 3 n
+影只形孤 3 n
+影后 10 n
+影响 24144 vn
+影响力 651 n
+影响度 2 n
+影响面 7 n
+影圈 3 n
+影坛 109 n
+影坛红星 3 n
+影城 14 n
+影壁 323 n
+影子 1061 n
+影子内阁 20 n
+影射 205 vn
+影展 33 vn
+影山 4 vn
+影帝 3 n
+影带 3 n
+影形不离 3 i
+影影绰绰 74 i
+影戏 22 n
+影戏院 3 n
+影星 69 n
+影本 3 n
+影格 2 n
+影楼 5 n
+影武者 3 n
+影片 2519 n
+影片名称 3 n
+影片奖 29 n
+影片格式 3 n
+影片简介 3 i
+影片类型 3 n
+影片资料 3 n
+影片长度 3 n
+影版 3 vn
+影画 4 n
+影碟 20 n
+影碟机 31 n
+影票 3 n
+影网站 3 n
+影舞者 3 n
+影蝶机 3 n
+影视 394 n
+影视业 2 n
+影视作品 3 n
+影视制作 3 vn
+影视剧 64 n
+影视剧场 3 n
+影视剧集 3 n
+影视动画 3 n
+影视吧 3 n
+影视圈 14 n
+影视城 16 n
+影视天堂 3 n
+影视娱乐 3 n
+影视帝国 3 n
+影视广告 3 n
+影视文化 3 n
+影视明星 3 n
+影视歌星 3 n
+影视歌曲 3 n
+影视点播 3 n
+影视片 11 n
+影视界 6 n
+影视网 3 n
+影视节目 3 n
+影视资料 3 n
+影视资讯 3 n
+影视音乐 3 n
+影视频道 3 n
+影讯 3 n
+影评 51 vn
+影评人 16 n
+影评家 3 n
+影调 3 vn
+影调剧 3 n
+影象 18 n
+影象判读 3 n
+影象参数 3 n
+影象地图 3 n
+影象灰度 3 n
+影象质量 3 n
+影质 3 n
+影踪 173 vn
+影迷 30 vn
+影迷会 3 l
+影迷大会 3 l
+影迹 3 n
+影院 109 n
+影集 6 vn
+影雕 2 n
+影雷者 3 n
+影霸 3 vn
+影音 46 n
+影音文件 3 n
+影音王 3 n
+影音精品 3 n
+彲 560 zg
+彳 15 x
+彳亍 2 n
+彴 39 zg
+彵 2 zg
+彶 27 zg
+彷 122 v
+彷佛 3 v
+彷如 3 v
+彷徉 3 v
+彷徨 147 v
+彸 63 zg
+役 2398 ng
+役于外物 3 n
+役使 130 v
+役卒 3 n
+役所 10 n
+役毕 3 v
+役男 3 n
+役畜 48 n
+役种 3 n
+役龄 38 n
+彺 14 zg
+彻 315 ad
+彻上彻下 3 i
+彻体力 3 l
+彻内彻外 3 i
+彻夜 110 d
+彻夜不眠 23 i
+彻夜未眠 8 i
+彻夜苦读 3 i
+彻夜进行 3 i
+彻夜难眠 3 i
+彻头彻尾 68 i
+彻头彻底 3 i
+彻底 4498 ad
+彻底否定 3 l
+彻底性 46 n
+彻底搜查 3 l
+彻底改变 3 i
+彻底消除 3 i
+彻底清除 3 i
+彻底澄清 3 z
+彻底解决 3 i
+彻底诱变 3 z
+彻彻底底 11 i
+彻悟 9 n
+彻查 3 vn
+彻消 3 l
+彻里彻外 3 i
+彻里至外 3 i
+彻首彻尾 3 i
+彻骨 81 z
+彼 1332 r
+彼一时 14 t
+彼众我寡 7 l
+彼倡此和 3 l
+彼唱此和 3 i
+彼尔姆 15 nrt
+彼尔金特 3 nrt
+彼岸 199 nrt
+彼岸花 3 n
+彼弃我取 3 l
+彼得 336 nrt
+彼得一世 3 nrt
+彼得保罗 2 ns
+彼得堡 122 nrt
+彼得大帝 78 nrt
+彼得斯 2 nrt
+彼得松 3 nrt
+彼得松图 3 nrt
+彼得格勒 63 nrt
+彼得森 7 nrt
+彼得洛夫 3 nrt
+彼得罗 13 nrt
+彼得罗夫 4 nrt
+彼得罗夫斯基 4 nrt
+彼得罗维奇 7 nrt
+彼德拉克 3 nrt
+彼德森 3 nrt
+彼方 3 r
+彼时 103 r
+彼时此时 3 l
+彼此 2165 r
+彼此之间 3 l
+彼此彼此 13 l
+彼此间 7 l
+彼比 2 nrt
+彼特 23 nrt
+彼特拉克 3 nrt
+彼竭我盈 3 i
+彼端 3 n
+彼进我退 3 l
+彽 3 zg
+彾 30 zg
+彿 28 zg
+往 16974 zg
+往上 3 t
+往上冲浪 3 n
+往上升 3 v
+往上拉 3 v
+往上提 3 v
+往上爬 3 v
+往上窜 3 v
+往上走 3 v
+往上面 3 n
+往下 3 t
+往下压 3 v
+往下坠 3 v
+往下拉 3 v
+往下掉 3 v
+往下沉 3 v
+往下流 3 n
+往下滴 3 n
+往下读 3 v
+往下走 3 v
+往下跳 3 v
+往下面 3 d
+往世 3 t
+往东方 3 n
+往东部 3 n
+往了局 3 v
+往事 680 v
+往事如梦 3 n
+往事如烟 3 n
+往例 3 d
+往内 3 t
+往前 1057 t
+往前方 3 n
+往前走 3 v
+往前面 3 n
+往北吹 3 n
+往北方 3 n
+往北走 3 t
+往北部 3 n
+往南方 3 n
+往南部 3 n
+往古来今 3 d
+往右 3 n
+往右边 3 n
+往后 652 t
+往后仰 3 n
+往后方 3 n
+往后走 3 v
+往后面 3 n
+往哲 3 n
+往回 343 t
+往圣先贤 3 n
+往复 117 d
+往复式 17 n
+往复泵 3 n
+往复运动 3 n
+往外面 3 n
+往届 70 b
+往届生 3 z
+往左边 3 z
+往常 460 d
+往年 624 t
+往往 7443 t
+往日 719 t
+往日情怀 3 n
+往时 33 t
+往昔 152 t
+往来 1567 t
+往来于 3 d
+往来帐档 3 n
+往来款项 3 n
+往来账 3 v
+往来账户 3 n
+往渚还汀 3 n
+往生咒 3 v
+往西方 3 n
+往西部 3 n
+往访国 16 n
+往蹇来连 3 v
+往返 488 v
+往返奔走 3 vn
+往返徒劳 3 n
+往返机票 3 n
+往返票 6 n
+往返程 3 n
+往返运输 3 n
+往还于 3 n
+往里 3 t
+往里面 3 n
+征 2607 v
+征丁 24 n
+征伐 214 v
+征信 32 v
+征候 17 n
+征借 3 v
+征兆 248 n
+征免 3 v
+征兵 131 v
+征兵制 28 v
+征兵法 3 n
+征兵站 3 n
+征到 3 v
+征募 25 v
+征南将军 15 n
+征友 3 n
+征友启示 3 vn
+征发 3 v
+征召 151 v
+征召入伍 3 n
+征名 3 v
+征名责实 3 n
+征地 70 n
+征夫 10 n
+征婚 42 v
+征婚启事 3 vn
+征婚广告 3 n
+征婚网 3 n
+征婚者 3 n
+征实 3 v
+征尘 31 n
+征帆 3 v
+征引 30 v
+征得 101 v
+征战 321 v
+征战史 2 n
+征收 895 v
+征收率 2 n
+征敛无度 3 nz
+征文 117 n
+征文启事 3 vn
+征文活动 3 n
+征文竞赛 3 n
+征服 1564 v
+征服者 158 n
+征期 3 vn
+征求 1205 v
+征求意见 3 v
+征派 3 v
+征状 13 n
+征用 104 v
+征用土地 3 n
+征程 108 n
+征税 369 v
+征稽 3 v
+征稽处 3 n
+征稿 21 v
+征稿启事 3 vn
+征答 3 v
+征管 83 vn
+征管法 3 n
+征粮 79 j
+征纳 3 v
+征缴 34 v
+征聊 3 v
+征聘 19 v
+征自 3 v
+征衣 3 v
+征解 3 v
+征订 18 v
+征订单 3 n
+征讨 214 v
+征询 149 vn
+征调 99 v
+征象 106 n
+征购 72 v
+征购粮 4 n
+征足 3 v
+征辟 47 v
+征途 156 n
+征集 1359 v
+征集组 3 n
+征集补充 3 n
+征风召雨 3 n
+徂 9 g
+徃 186 zg
+径 1771 n
+径一周三 3 n
+径向 191 n
+径向线 3 n
+径向速度 3 n
+径山寺 6 ns
+径庭 3 n
+径情直行 3 n
+径情直逐 3 n
+径情直遂 3 n
+径流 516 n
+径流变率 3 n
+径流模数 3 n
+径流系数 3 n
+径流量 878 n
+径直 625 d
+径直径自 3 n
+径矢 3 n
+径级 3 n
+径线 3 n
+径自 322 d
+径行 3 n
+径行直遂 3 n
+径赛 13 n
+径赛会 3 n
+径距 3 n
+径路 3 n
+径迹 43 n
+待 10253 v
+待不住 3 v
+待业 78 n
+待业人口 3 n
+待业保险 3 n
+待业率 2 n
+待业者 2 n
+待业证 3 n
+待业青年 33 n
+待产 15 n
+待产妇 3 n
+待产室 3 n
+待产期 3 n
+待人 218 n
+待人之道 3 i
+待人以诚 3 l
+待人处事 3 i
+待人接物 41 n
+待价而沽 12 i
+待优 3 d
+待会 3 n
+待会儿 165 n
+待传 3 v
+待兔守株 3 l
+待制 26 v
+待办 3 v
+待发 49 v
+待发布 3 n
+待命 120 n
+待命状态 4 n
+待命班 3 n
+待哺 3 v
+待售 10 vn
+待在家里 3 i
+待处理 2 n
+待如己出 3 i
+待婚 3 v
+待嫁 12 v
+待字闺中 7 i
+待定 330 v
+待审 3 v
+待客 152 n
+待客之道 3 i
+待岗 20 n
+待工 3 n
+待建 3 v
+待御膳 3 n
+待慢 3 d
+待战 6 v
+待批 5 v
+待承 3 v
+待援 38 v
+待摊费用 3 n
+待时守分 3 l
+待时而动 5 i
+待月西厢 3 n
+待机 66 n
+待机图 3 n
+待机图片 3 n
+待机时间 3 n
+待机王 3 n
+待机而动 11 i
+待查 12 vn
+待毙 3 v
+待沽 3 i
+待物 3 n
+待理不理 5 i
+待用 18 v
+待续 78 v
+待缘 3 n
+待缴 3 v
+待考 34 v
+待聘 3 v
+待补 3 v
+待见 169 v
+待读 3 v
+待贾而沽 3 nr
+待转 3 v
+待遇 1608 n
+徆 16 zg
+徇 46 vg
+徇义 3 v
+徇国忘身 3 i
+徇情 13 v
+徇情枉心 3 i
+徇情枉法 3 i
+徇私 35 v
+徇私作弊 3 i
+徇私情 3 i
+徇私枉法 9 i
+徇私舞弊 50 i
+很 69103 zg
+很下 3 m
+很不简单 3 l
+很丑 3 m
+很严 3 a
+很久 3 m
+很久以前 3 l
+很久很久 3 m
+很久没 3 l
+很乱 3 a
+很亮 3 a
+很傻 3 a
+很僵 3 a
+很凉 3 a
+很厚 3 a
+很困 3 a
+很多 12687 m
+很多双 9 m
+很多圈 2 m
+很多年 122 m
+很多很多 71 m
+很多很多年 4 m
+很多根 2 m
+很多歌 3 m
+很多类 4 m
+很多遍 8 m
+很多面 3 m
+很够 3 a
+很大 8348 a
+很妙 3 a
+很富 3 a
+很小 1035 a
+很少 3268 m
+很弱 3 a
+很忙 3 d
+很快 5033 d
+很怕 3 d
+很急 3 a
+很情形 3 l
+很惨 3 a
+很感兴趣 3 l
+很慢 3 d
+很慢等你 3 l
+很扁 3 n
+很挤 3 a
+很敢 3 d
+很旧 3 d
+很早 223 d
+很早以前 18 l
+很晚 3 d
+很暗 3 a
+很杂 3 a
+很松 3 a
+很棒 3 a
+很毒 3 a
+很气 3 a
+很沉 3 a
+很浓 3 l
+很淡 3 a
+很渴 3 a
+很湿 3 a
+很溼 3 n
+很漂亮 3 n
+很烂 3 a
+很烦 3 a
+很熟 3 a
+很爽 3 a
+很狠 3 d
+很狡猾 3 i
+很甜 3 a
+很瘦 3 a
+很直 3 d
+很着急 3 l
+很矮 3 a
+很硬 3 a
+很穷 3 d
+很窄 3 a
+很粗 3 d
+很精采 3 n
+很糟 3 n
+很紧 3 d
+很纯 3 a
+很细 3 a
+很美 3 m
+很胖 3 a
+很脏 3 a
+很苛 3 a
+很苦 3 a
+很薄 3 a
+很象 3 a
+很贵 3 a
+很轻 3 a
+很远 3 d
+很迟 3 d
+很酷 3 a
+很重 3 a
+很难说 223 l
+很难说服 2 l
+很静 3 a
+很顺 3 a
+很饱 3 l
+徉 13 x
+徊 185 x
+徊肠伤气 3 nz
+律 2073 nr
+律令 143 n
+律仪 3 n
+律例 162 n
+律动 26 n
+律历志 3 n
+律吕 8 n
+律宗 3 n
+律己 32 n
+律己甚严 3 v
+律师 1826 n
+律师业 11 n
+律师事务 3 n
+律师公会 3 n
+律师函 3 n
+律师助理 3 n
+律师协会 3 n
+律师团 8 n
+律师所 3 n
+律师收费 3 n
+律师法 3 n
+律师界 4 n
+律师网 3 n
+律师行 3 n
+律师袍 3 n
+律师论坛 3 n
+律师证 4 n
+律师费 6 n
+律师资格 3 n
+律度 3 n
+律政 3 n
+律政司 5 n
+律条 3 n
+律法 3 n
+律考 15 n
+律诗 81 n
+律调 3 n
+後 1209 nr
+徍 17 zg
+徎 16 zg
+徐 2325 nr
+徐一夔 2 nr
+徐一贯 3 nr
+徐三哥 33 nr
+徐三爷 3 nr
+徐不疾 6 nr
+徐世昌 219 nr
+徐世正 2 nr
+徐世隆 2 nr
+徐东升 2 nr
+徐东号 3 nr
+徐东方 3 nr
+徐东海 2 nr
+徐中玉 40 nr
+徐中舒 16 nr
+徐中行 3 nr
+徐丽贞 4 nr
+徐乃麟 3 nr
+徐义昭 2 nr
+徐义生 4 nr
+徐之明 3 nr
+徐乾学 12 nr
+徐二公子 8 nr
+徐二州 3 nr
+徐二爷 4 nr
+徐二黑 6 nr
+徐云卿 2 nr
+徐云龙 15 nr
+徐京 2 ns
+徐京跃 5 nr
+徐亮拉 2 nr
+徐人仲 2 nr
+徐仁修 3 nr
+徐仁杰 3 nr
+徐仁铸 2 nr
+徐以显 231 nr
+徐会来 18 nr
+徐会沣 2 nr
+徐伯阳 2 nr
+徐侍郎 2 nr
+徐俊 2 nr
+徐俊鸣 47 nr
+徐偃王 11 nrt
+徐元吉 2 nr
+徐元文 82 nr
+徐元瑞 2 nr
+徐元直 6 nr
+徐兄弟 3 nr
+徐兆奎 3 nr
+徐先生 48 nr
+徐光启 89 nr
+徐光宪 2 nr
+徐光春 13 nr
+徐光烈 3 nr
+徐克 55 nr
+徐克俊 256 nr
+徐克洪 2 nr
+徐公子 4 nr
+徐公明 3 nr
+徐公祠 3 nr
+徐六娃 4 nr
+徐兰沅 4 nr
+徐兴业 4 nr
+徐兵河 52 nr
+徐其钧 2 nr
+徐冠华 27 nr
+徐冠巨 2 nr
+徐冰川 3 nr
+徐凤鸣 2 nr
+徐凯一 2 nr
+徐力里 78 nr
+徐匡迪 20 nr
+徐博客 3 nr
+徐卫伟 3 nr
+徐双喜 3 nr
+徐同学 4 nr
+徐同祖 2 nr
+徐名材 2 nr
+徐向前 186 nr
+徐啸力 128 nr
+徐喜辰 2 nr
+徐嘉瑞 2 nr
+徐国 9 ns
+徐国强 82 nr
+徐国栋 3 nr
+徐图 2 nr
+徐图灭 3 nr
+徐坤明 3 ns
+徐增寿 4 nr
+徐士昌 24 nr
+徐士高 2 nr
+徐壮志 5 nr
+徐处仁 8 nr
+徐复祚 5 nr
+徐复观 257 nr
+徐大人 13 nr
+徐大叔 18 nr
+徐大哥 63 nr
+徐大夫 4 nr
+徐大椿 2 nr
+徐大爷 8 nr
+徐天乐 3 nr
+徐天宏 668 nr
+徐天川 260 nr
+徐天红 4 nr
+徐太仆 4 nr
+徐夫人 3 nr
+徐奉召 3 nr
+徐奉洙 3 nr
+徐女之 2 nr
+徐娘半老 11 nr
+徐子平 2 nr
+徐子桐 6 nr
+徐子淇 3 nr
+徐子珊 3 nrfg
+徐子陵 3 nr
+徐孚远 3 nr
+徐学谟 2 nr
+徐宁教 3 nr
+徐宁飞 2 nr
+徐安琪 5 nr
+徐宏亮 2 nr
+徐宏基 2 nr
+徐宏斌 3 nr
+徐宏祖 34 nr
+徐宝康 3 nr
+徐宝琦 2 nr
+徐宝璜 4 nr
+徐宝麟 3 nr
+徐家 287 nrfg
+徐家军 3 nr
+徐家华 3 nr
+徐家大 2 nr
+徐家存 2 nr
+徐家岗 256 nr
+徐家汇 57 nr
+徐寅生 11 nr
+徐寿辉 371 nr
+徐将军 2 nr
+徐小健 3 nr
+徐小农 13 nr
+徐小凤 256 nr
+徐小姐 6 nr
+徐小舍 12 nr
+徐小香 4 nr
+徐少华 3 nr
+徐少强 3 nr
+徐少春 5 nr
+徐尚珍 2 nr
+徐峰丽 3 nr
+徐崇嗣 3 nr
+徐州 765 ns
+徐州人 4 nr
+徐州市 53 ns
+徐州网 3 nr
+徐师傅 10 nr
+徐师爷 2 nr
+徐干军 4 nr
+徐广缙 3 nr
+徐庄村 3 nr
+徐庆海 3 nr
+徐应元 6 nr
+徐府街 6 nr
+徐建中 4 nr
+徐建寅 2 nr
+徐建平 3 nr
+徐建波 5 nr
+徐弘基 4 nr
+徐弘祖 11 nr
+徐徐 310 nr
+徐德宽 2 nr
+徐德志 33 nr
+徐德言 3 nr
+徐志坚 3 nr
+徐志摩 40 nr
+徐志猛 5 nr
+徐志纯 257 nr
+徐忽疾 2 nr
+徐怀丹 4 nr
+徐怀钰 3 nr
+徐怀雯 4 nr
+徐思佳 3 nr
+徐思华 6 nr
+徐总爷 3 nr
+徐悲鸿 60 nr
+徐悲鸿纪念馆 6 nr
+徐惟学 2 nr
+徐惟诚 5 nr
+徐惠滋 2 nr
+徐慢 3 d
+徐成 2 nrfg
+徐成龙 9 nr
+徐才厚 61 nr
+徐扬扬 2 nr
+徐承栋 2 nr
+徐援朝 131 nr
+徐敦信 2 nr
+徐敬业 18 nr
+徐文君 2 nr
+徐文斌 6 nr
+徐文新 2 nr
+徐文长 4 nr
+徐斌州 2 nr
+徐斌忠 3 nr
+徐新玉 3 nr
+徐无鬼 4 nr
+徐日升 5 nr
+徐旭生 4 nr
+徐时行 4 nr
+徐明忠 11 nr
+徐星伯 3 nr
+徐春柳 4 nr
+徐昭珩 3 nr
+徐显明 2 nr
+徐显谟 8 nr
+徐晃二 2 nr
+徐晃兵 2 nr
+徐晃引 4 nr
+徐晃解 2 nr
+徐晃部 2 nr
+徐晃领 3 nr
+徐晃飞 2 nr
+徐晓用 2 nr
+徐晓钟 15 nr
+徐景贤 2 nr
+徐智模 3 nr
+徐曰彪 3 nr
+徐曼玉 5 nr
+徐有禄 2 nr
+徐有芳 5 nr
+徐有贞 160 nr
+徐本禹 3 nr
+徐机玲 4 nr
+徐村之 2 nr
+徐松莫 5 nr
+徐析娣 3 nr
+徐林格 3 nr
+徐柏玉 20 nr
+徐树丕 5 nr
+徐树兰 2 nr
+徐校长 4 nr
+徐根宝 26 nr
+徐桂云 2 nr
+徐梦莘 3 nr
+徐正飞 2 nr
+徐步 4 d
+徐武祥 3 nr
+徐殿龙 3 nr
+徐氏东 7 nr
+徐氏乃 2 nr
+徐氏美 2 nr
+徐水 7 nr
+徐水县 3 ns
+徐永久 2 nr
+徐永光 2 nr
+徐永昌 6 nr
+徐永清 256 nr
+徐永祥 2 nr
+徐永贤 3 nr
+徐汇 22 nr
+徐汇区 18 nr
+徐汇店 3 ns
+徐江善 4 nr
+徐沛东 2 nr
+徐治功 153 nr
+徐泰来 60 nr
+徐泽商 10 nr
+徐泾镇 3 ns
+徐洋 9 ns
+徐洪刚 2 nr
+徐洪铎 2 nr
+徐济成 3 nrfg
+徐海 200 ns
+徐海东 283 nr
+徐海峰 2 nr
+徐海波 3 nr
+徐海率 2 nr
+徐海静 3 nr
+徐淮黄 4 nr
+徐清扬 2 nr
+徐渭 136 nrfg
+徐湛之 16 nr
+徐濠萦 3 nr
+徐炳昶 2 nr
+徐爱云 20 nr
+徐爵刚 2 nr
+徐爵嘴 3 nr
+徐爵嘻 2 nr
+徐爵忙 2 nr
+徐爵朝 2 nr
+徐爵来 3 nr
+徐爵见 5 nr
+徐爵顿 2 nr
+徐特立 15 nr
+徐玉兰 5 nr
+徐玉诺 2 nr
+徐用仪 2 nr
+徐田养 3 nr
+徐盛二 2 nr
+徐盛船 2 nr
+徐直军 7 nr
+徐相国 3 nr
+徐碧云 4 nr
+徐祯卿 6 nr
+徐福 97 nr
+徐福厅 2 nr
+徐福温泉 5 nr
+徐秀才 6 nr
+徐秋斋 560 nr
+徐立凡 3 nr
+徐立华 256 nr
+徐管家 2 nr
+徐绍清 3 nr
+徐经 16 d
+徐继庄 2 nr
+徐继斌 128 nr
+徐继畲 3 nr
+徐维新 9 nr
+徐缓 25 nr
+徐缓而行 3 nr
+徐羡之 3 nr
+徐老儿 3 nr
+徐老半娘 3 nr
+徐老板 3 nr
+徐老爷 20 nr
+徐老爷子 7 nr
+徐老长 2 nr
+徐肖冰 3 nr
+徐自华 2 nrfg
+徐自玲 2 nr
+徐致光 3 nr
+徐致靖 14 nr
+徐良高 6 nr
+徐若瑄 3 v
+徐英杰 2 nr
+徐茂功 5 nr
+徐荣凯 3 nr
+徐荣新 2 nr
+徐薇薇 3 nr
+徐行 27 nr
+徐规林 2 nr
+徐训英 19 nr
+徐记元 2 nr
+徐调孚 2 nr
+徐起祚 4 nr
+徐辉祖 20 nr
+徐达之 4 nr
+徐达军 8 nr
+徐达北 2 ns
+徐达攻 3 nr
+徐达站 2 nr
+徐逢原 4 nr
+徐邦林 5 nr
+徐邦达 3 nr
+徐邦道 3 nr
+徐金波 2 nr
+徐金鹏 2 nr
+徐铉 12 nr
+徐铸成 10 nrfg
+徐锡麒 3 nr
+徐锡麟 23 nr
+徐锦江 3 nr
+徐镜人 13 nr
+徐长卿 3 nr
+徐长安 2 nr
+徐长老 140 nr
+徐闻 14 nr
+徐闻县 7 nr
+徐闻至 2 nr
+徐阶任 3 nr
+徐阶依然 3 nr
+徐阶兄 4 nr
+徐阶如 2 nr
+徐阶性 3 nr
+徐院长 40 nr
+徐震纲 47 nr
+徐霞客 332 nr
+徐青君 104 nr
+徐静蕾 32 nr
+徐韵秋 29 nr
+徐顺全 6 nr
+徐颂陶 2 nr
+徐首辅 9 nr
+徐高文 2 nr
+徐高栋 256 nr
+徐鸣凤 2 nr
+徐鸿儒 30 nr
+徐鸿宝 2 nr
+徐鹏航 3 nr
+徐鹏飞 4 nr
+徑 9 zg
+徒 2138 d
+徒乱人意 3 i
+徒众 42 n
+徒儿 3 n
+徒具 3 n
+徒具形式 3 l
+徒刑 134 n
+徒劳 125 n
+徒劳地 3 l
+徒劳往返 3 i
+徒劳无功 14 i
+徒劳无益 25 l
+徒呼奈何 3 i
+徒呼负负 3 i
+徒唤 3 v
+徒唤奈何 6 i
+徒增 3 v
+徒子 3 n
+徒子徒孙 42 l
+徒孙 76 n
+徒工 7 n
+徒废唇舌 3 i
+徒弟 1169 n
+徒手 200 n
+徒手体操 3 l
+徒手操 8 n
+徒手格斗 3 i
+徒手空拳 3 i
+徒手素描 3 n
+徒托空言 2 n
+徒拥虚名 3 i
+徒有其名 16 i
+徒有其表 3 i
+徒有虚名 47 i
+徒步 220 d
+徒步健行 3 n
+徒步旅行 3 n
+徒步走 10 l
+徒法不行 3 i
+徒涉 4 v
+徒然 175 d
+徒生 3 n
+徒留 3 v
+徒讬空言 3 v
+徒读父书 3 n
+徒负虚名 3 i
+徒费 3 n
+徒费口舌 3 i
+徒费唇舌 3 i
+徒费脣舌 3 v
+徒逞 3 v
+徒长 8 n
+徒长枝 3 n
+徒陈空文 3 i
+徒骇河 4 i
+従 2 zg
+徕 15 x
+得 134479 ud
+得下 3 v
+得不偿丧 3 i
+得不偿失 96 i
+得不到 401 v
+得不补失 3 i
+得不酬失 3 v
+得与失 3 i
+得主 133 v
+得之不易 7 l
+得了吧 6 l
+得于 3 v
+得亏 3 v
+得人心 50 i
+得人惊 3 i
+得人死力 3 i
+得人者昌 3 i
+得令 3 v
+得以 2227 v
+得伟 2 a
+得住 3 v
+得体 277 a
+得便儿 3 l
+得偿夙愿 3 vn
+得克萨斯 53 ns
+得克萨斯大学 11 nz
+得克萨斯州 101 ns
+得免 3 v
+得兔忘蹄 3 i
+得其三昧 3 i
+得其所哉 11 i
+得出 1334 v
+得出结论 3 i
+得分 1027 v
+得分多 3 l
+得分少 3 l
+得分手 22 n
+得分率 23 n
+得分王 8 n
+得利 118 v
+得利于 7 v
+得利卡 3 ns
+得到 18464 v
+得到享受 3 i
+得到许可 3 i
+得力 430 v
+得力于 3 l
+得力助手 3 i
+得劲 4 a
+得势 76 v
+得名 2838 v
+得大于失 3 i
+得大自在 3 i
+得天独厚 377 i
+得失 363 v
+得失参半 3 i
+得失在人 3 i
+得失心 3 i
+得失成败 3 i
+得失相半 3 i
+得失相当 3 i
+得失荣枯 3 i
+得奖 72 v
+得奖人 3 n
+得奖者 3 n
+得婿如龙 3 v
+得宜 16 v
+得宠 52 v
+得寸得尺 3 i
+得寸进尺 173 i
+得尺得寸 3 l
+得州 23 ns
+得当 216 v
+得得 3 v
+得得活活 3 i
+得心应手 143 i
+得志 38 n
+得悉 135 v
+得愈 56 v
+得意 1454 v
+得意之作 30 i
+得意之笔 3 i
+得意之色 3 i
+得意忘形 52 i
+得意忘言 5 i
+得意忘象 2 i
+得意扬扬 6 i
+得意洋洋 158 ns
+得意门生 17 i
+得意非凡 3 l
+得意饿 3 i
+得成 3 v
+得手 339 v
+得手应心 3 i
+得救 104 v
+得数 85 n
+得月较先 3 n
+得有 3 v
+得未尝有 3 i
+得未曾有 2 i
+得来 553 v
+得来不易 3 l
+得标 3 v
+得标人 3 n
+得梅因 3 i
+得款 3 v
+得步进步 3 l
+得民心 3 n
+得气 3 v
+得法 20 v
+得济 3 n
+得理不饶 3 i
+得用 3 v
+得病 57 v
+得的心 3 l
+得益 162 v
+得益于 118 v
+得益匪浅 3 l
+得知 2137 v
+得票 30 v
+得票数 11 n
+得票率 8 n
+得空 38 v
+得空儿 11 n
+得窥门径 3 n
+得罪 1504 v
+得罪人 75 n
+得而复失 13 i
+得胜 371 v
+得胜回朝 6 l
+得胜头回 3 i
+得胜班师 3 n
+得色 3 v
+得荣 2 v
+得荣县 3 ns
+得莫利 3 i
+得薄能鲜 3 i
+得计 3 v
+得该 3 v
+得过且过 31 l
+得逞 245 v
+得逞一时 3 i
+得道 93 v
+得道升天 3 i
+得道多助 4 i
+得道成仙 3 i
+得道者 6 n
+得闲 21 v
+得闲儿 13 l
+得陇忘蜀 3 i
+得陇望蜀 7 i
+得顺 3 v
+得饶人处 3 l
+得饶人处且饶人 20 l
+得马失马 3 i
+得马折足 3 i
+得马生灾 3 i
+得高望重 3 i
+徘 28 v
+徘徊 597 v
+徘徊不前 3 v
+徘徊北 3 v
+徘徊歧路 3 nr
+徘徊者 3 r
+徙 788 vg
+徙倚 3 i
+徙善远罪 3 i
+徙宅忘妻 3 i
+徙居 3 i
+徙木为信 3 i
+徙步 3 i
+徙薪曲突 3 i
+徙边 3 i
+徜 4 v
+徜徉 57 v
+徜徉于 3 vi
+徜徉恣肆 3 i
+徝 2 zg
+從 5 zg
+御 5044 zg
+御上蔽下 3 n
+御书 3 n
+御事 3 n
+御众 3 n
+御使 6 n
+御侮 38 n
+御制 185 n
+御前会议 3 n
+御医 56 n
+御厨 44 n
+御史 686 n
+御史中丞 78 n
+御史台 108 n
+御史大夫 145 n
+御园 6 n
+御夫 3 nrt
+御夫座 3 n
+御夫有术 3 n
+御孙 3 n
+御宅族 3 n
+御宇 3 n
+御家人 5 n
+御寇 3 nrt
+御寒 77 b
+御寒衣 3 n
+御库 3 n
+御庙 3 n
+御府 3 n
+御座 3 n
+御弟 3 n
+御手 15 n
+御敌 3 n
+御敌于国门之外 18 i
+御旨 15 n
+御景园 3 n
+御林军 366 n
+御沟红叶 3 n
+御法度 3 n
+御温泉 3 n
+御玺 9 n
+御用 136 n
+御用专家 3 n
+御用学者 3 n
+御用文人 3 n
+御窑 3 n
+御笔 85 n
+御者 14 n
+御膳 119 nrt
+御膳房 3 vn
+御花园 110 n
+御苑 10 nrt
+御街 18 n
+御览 85 v
+御赐 3 n
+御车 3 n
+御道 1222 n
+御道口 2 n
+御驾 637 v
+御驾亲征 3 i
+徢 8 zg
+徨 59 zg
+復 2 zg
+循 878 vn
+循例 22 n
+循俗 3 n
+循化 20 vn
+循化撒拉族自治县 2 ns
+循古 3 vn
+循名校实 3 n
+循名核实 3 l
+循名督实 3 n
+循名考实 3 i
+循名覈实 3 n
+循名课实 3 n
+循名责实 3 l
+循吏 3 n
+循声 98 d
+循声附会 3 i
+循常 3 d
+循常习故 3 i
+循序 39 vn
+循序渐进 119 i
+循序见进 3 l
+循循善诱 23 i
+循循诱人 3 vn
+循次而进 3 l
+循法 3 vn
+循涂守辙 3 i
+循环 2575 vn
+循环不断 2 l
+循环体 6 l
+循环制 5 l
+循环反复 3 l
+循环器 3 l
+循环器官 3 l
+循环型 2 b
+循环基金 3 l
+循环小数 12 l
+循环展开 3 l
+循环式 11 l
+循环往复 42 l
+循环性 3 l
+循环排列 3 l
+循环无端 3 l
+循环气 3 l
+循环气流 3 l
+循环水 5 l
+循环法 3 l
+循环注气 3 l
+循环泵 3 nz
+循环码 3 l
+循环系统 78 l
+循环群 3 l
+循环论 11 l
+循环论证 4 nz
+循环赛 36 ns
+循环阀 3 l
+循理 3 vn
+循线 3 vn
+循规守旧 3 l
+循规距蹈 3 n
+循规蹈矩 106 i
+循证 3 vn
+循诵习传 3 n
+循迹 3 n
+循途守辙 3 i
+徬 35 zg
+徬徨 3 v
+徬徨失措 3 v
+徭 127 n
+徭役 292 n
+徭役地租 2 l
+微 4852 n
+微不足道 277 i
+微中断 3 l
+微乎其微 77 i
+微乳状液 3 n
+微乳驱 3 n
+微云 18 n
+微亮 3 a
+微伏 3 j
+微光 204 n
+微光技术 3 n
+微光电视 3 l
+微克 68 q
+微内核 6 n
+微冷 3 a
+微冻室 3 n
+微分 307 n
+微分学 31 l
+微分形式 3 l
+微分拓扑 3 n
+微分方程 356 l
+微分电路 3 l
+微创 25 n
+微利 48 n
+微动 73 vn
+微升 28 v
+微卫星 3 n
+微压测高 3 n
+微压计 3 n
+微县 3 ns
+微双曲型 3 n
+微启 3 v
+微咸 8 v
+微咸湖 3 ns
+微囊 5 n
+微型 341 b
+微型化 36 n
+微型文件 3 n
+微型本 3 l
+微型机 31 n
+微型汽车 3 n
+微型电路 3 n
+微型车 3 n
+微填充柱 3 i
+微处理器 146 l
+微处理机 28 l
+微妙 335 a
+微婉 3 a
+微孔 22 n
+微安 4 a
+微寒 3 b
+微察秋毫 3 i
+微封装 3 b
+微小 463 b
+微少 3 d
+微尘 32 n
+微尘学 3 n
+微尘数 3 i
+微居里 3 i
+微山 6 n
+微山县 9 ns
+微山湖 27 ns
+微差 3 n
+微带 3 n
+微带天线 3 b
+微带线 4 n
+微带菜色 3 n
+微带阵 3 n
+微幅 3 d
+微张 3 a
+微弱 577 a
+微录机 3 n
+微循环 51 i
+微微 3182 d
+微微一笑 3 l
+微微克 2 q
+微恙 2 z
+微息 3 n
+微扰理论 3 n
+微扰论 3 n
+微指令 3 n
+微控制器 3 n
+微操作 3 l
+微故细过 3 i
+微明 3 a
+微星 3 n
+微显阐幽 3 z
+微晶 37 n
+微晶片 3 n
+微晶石 3 n
+微晶蜡 3 n
+微服 33 n
+微服私行 3 i
+微服私访 29 i
+微末 65 n
+微机 180 n
+微机化 2 l
+微机四伏 3 l
+微机室 8 n
+微机房 3 n
+微机监测 3 j
+微机联锁 3 n
+微模块 3 n
+微气候 3 l
+微气管 3 vn
+微法 3 n
+微波 650 n
+微波定位 3 n
+微波测距 3 n
+微波激射 3 l
+微波灶 3 i
+微波炉 79 n
+微波网络 3 n
+微波通信 38 i
+微波遥感 3 i
+微涨 3 v
+微漫 3 a
+微澜 6 n
+微灌 2 n
+微火 12 n
+微点 5 n
+微然 3 d
+微现 3 v
+微珠 2 n
+微生 3 n
+微生物 784 l
+微生物学 49 n
+微生物学家 22 l
+微电子 119 n
+微电子学 14 l
+微电机 14 n
+微电极 3 n
+微电脑 40 l
+微电路 3 n
+微白 3 n
+微睡 3 vn
+微码 7 n
+微硬盘 3 n
+微科其微 3 l
+微秒 22 q
+微积分 182 n
+微积分学 3 n
+微程序 3 n
+微笑 3625 vn
+微笑服务 3 l
+微笑起来 3 l
+微管 55 vn
+微米 307 q
+微粉 2 n
+微粒 249 n
+微粒体 3 n
+微粒子 3 n
+微粒显影 3 n
+微粒说 3 l
+微细 73 a
+微绒毛 3 n
+微结构 24 n
+微缩 17 vn
+微缩卡 3 n
+微胖 3 a
+微胶囊 3 n
+微臣 206 n
+微茫 3 z
+微薄 161 a
+微血管 31 n
+微行 3 n
+微观 508 n
+微观世界 38 n
+微观粒子 93 n
+微观经济 3 n
+微观量 3 n
+微视 3 b
+微言 6 n
+微言大义 19 l
+微言大意 3 i
+微言大谊 3 i
+微词 44 n
+微调 50 n
+微贱 35 a
+微距拍摄 3 n
+微软 1757 a
+微软中国公司 7 nt
+微软公司 268 nt
+微软拼音 3 i
+微辞 7 n
+微过细故 3 i
+微酸 3 n
+微醉 8 vn
+微醺 17 z
+微重力 8 l
+微量 218 n
+微量元素 205 n
+微量分析 3 l
+微量天平 3 b
+微闭 38 v
+微阵列 3 m
+微雕 12 n
+微雨 39 n
+微雨燕 3 n
+微震计 3 l
+微露 46 v
+微音器 3 n
+微额 3 n
+微风 186 n
+微风习习 3 n
+微风吹拂 3 i
+微风细雨 3 i
+微黄 22 b
+徯 6 zg
+徯径 3 v
+徰 5 zg
+徳 22 zg
+徵 98 zg
+徵信录 3 nr
+徵信所 3 nr
+徵信社 3 nr
+徵兵 3 nr
+徵兵制 3 nr
+徵兵法 3 nr
+徵兵站 3 nr
+徵友栏 3 nr
+徵召 3 nr
+徵收 3 nr
+徵收额 3 nr
+徵文启事 3 nr
+徵文比赛 3 nr
+徵税额 3 nr
+徵稿栏 3 vn
+徵聘人员 3 nr
+徵集令 3 nr
+徵验出 3 nr
+德 9549 ns
+德业 3 j
+德丰 4 ns
+德之士 68 nr
+德二世 5 nr
+德云社 3 nr
+德令哈 10 nr
+德令哈市 7 ns
+德伍德 3 nr
+德伦 5 ns
+德伯 7 ns
+德伯格 5 nr
+德佐罗 3 nr
+德佩罗 6 nr
+德保 2 j
+德保县 2 ns
+德修斯 7 nr
+德修纪 3 nr
+德元帅 3 nr
+德克 45 ns
+德克勒克 43 nrt
+德克士 3 nr
+德克斯特 4 nrt
+德克碑 2 nr
+德克萨斯 14 ns
+德克萨斯州 21 ns
+德兰 26 ns
+德兰吉 2 nr
+德兰士 13 ns
+德兰意 2 nr
+德兰癸 2 nr
+德兴 23 ns
+德兴市 3 ns
+德兴铜矿 3 ns
+德军 701 nr
+德农 2 nz
+德农厅 3 nt
+德凡特 2 nr
+德凯巴 2 nr
+德列丝 2 nr
+德利 32 ns
+德利布 2 ns
+德利希 2 nr
+德力格尔 3 nr
+德力西 2 nr
+德加 13 ns
+德加拉 3 ns
+德努瓦耶 2 nrt
+德勒 16 nrt
+德勒斯 7 ns
+德勒穆 2 nr
+德勒维尔 3 ns
+德勤华 7 nr
+德化 232 ns
+德化县 2 ns
+德化碑 4 nz
+德华 29 nz
+德华湖 4 ns
+德南 2 ns
+德卡 3 ns
+德卡尔 2 nr
+德卢卡 3 nr
+德卢斯 7 nr
+德厚流光 2 nr
+德双语 2 nr
+德吉 11 ns
+德吕克 5 nr
+德吾弟 2 nr
+德哈斯 5 ns
+德哈特 2 ns
+德哈芬 2 nr
+德善行 16 nr
+德国 9604 ns
+德国人 476 nr
+德国国会 7 nt
+德国外交部 17 nt
+德国大众 4 nt
+德国大众汽车公司 3 nt
+德国大众汽车集团 3 nt
+德国式 7 nz
+德国总理 3 nr
+德国慕尼黑大学 5 nt
+德国政府 52 nt
+德国杯 13 nz
+德国柏林大学 16 nt
+德国汉莎航空公司 10 nt
+德国法 7 nr
+德国电视一台 16 nt
+德国社会民主党 60 nt
+德国科隆 3 nz
+德国籍 2 nr
+德国联邦 25 nt
+德国联邦政府 2 nt
+德国西门子 12 ns
+德国西门子公司 7 nt
+德国议会 4 nt
+德国通讯 3 nt
+德国队 140 nt
+德国马克 17 ns
+德国驻华使馆 2 nt
+德圣君 2 nr
+德城 10 ns
+德城区 3 ns
+德基坝 4 ns
+德基水库 3 nz
+德堡 2 ns
+德堪尼 16 nr
+德塞 2 ns
+德塞利 13 ns
+德境 3 n
+德士古 10 ns
+德大 10 ns
+德天瀑布 3 ns
+德夫力斯 3 nr
+德奇科 3 nr
+德奋然 2 i
+德奎利亚 2 nrt
+德奎利亚尔 13 nrt
+德奥 37 nrt
+德奥军 3 nr
+德奥意 2 nr
+德姆贝 2 nr
+德威 12 ns
+德威克 9 ns
+德威尔 5 nr
+德威并施 3 i
+德威治 6 nr
+德子吓 2 nr
+德子惊 2 nr
+德子托 2 nr
+德子晃 2 nr
+德宁 6 ns
+德宁殿 3 nr
+德安 540 ns
+德安县 3 ns
+德安府 520 nt
+德宏 21 nr
+德宏傣族景颇族自治州 14 ns
+德宏州 7 nr
+德宗 55 nrt
+德宗建 6 nr
+德宗时 2 nr
+德宗朝 2 nr
+德宗贞 5 nr
+德宝斋 2 nr
+德容兼备 3 i
+德容言 2 nr
+德容言功 3 i
+德密尔 3 nr
+德寿 11 ns
+德寿宫 5 nr
+德尊望重 3 i
+德尔 71 ns
+德尔克 13 nrt
+德尔加 2 ns
+德尔博 3 nr
+德尔图 2 nr
+德尔塔 16 nrt
+德尔夫 5 nrt
+德尔惠 31 nr
+德尔斐 54 nr
+德尔智 2 nr
+德尔曼 19 nr
+德尔松 8 nr
+德尔河 4 ns
+德尔海 10 ns
+德尔湖 2 ns
+德尔瓦 2 ns
+德尔福 2 nr
+德尔纳 2 ns
+德尔维 3 nr
+德尔菲 7 nrt
+德尔萨 2 ns
+德尔诺夫舍克 3 nrt
+德尔贝 3 nr
+德尔达 33 nrt
+德尔里 3 nrt
+德尼斯 3 ns
+德尼昭 3 nr
+德尼罗 3 ns
+德山 47 ns
+德岛 14 ns
+德岭 2 ns
+德川 71 ns
+德川氏 4 nr
+德州 146 ns
+德州人 3 nr
+德州仪器 3 nt
+德州市 13 ns
+德巴 3 ns
+德巴赫 7 nr
+德巴迪 2 nr
+德布 23 ns
+德布勒森 2 nrt
+德布林 2 ns
+德布罗 2 nrt
+德布雷 2 nr
+德帕迪 2 nr
+德帝 4 nrt
+德帝姬 2 nr
+德干高原 3 ns
+德庆 4 ns
+德庆县 3 ns
+德庆堂 10 nr
+德彪西 29 nr
+德微理 2 nr
+德德玛 3 nr
+德怀恩 4 nr
+德怀特 4 nr
+德性 127 n
+德惠 3 nr
+德惠县 3 nr
+德惠市 4 ns
+德意军 3 nt
+德意志 577 ns
+德意志帝 3 nr
+德意志民主共和国 25 ns
+德意志联 3 ns
+德意志联邦共和国 28 ns
+德意志银行 146 nt
+德成善 16 nr
+德才 15 nr
+德才兼备 62 i
+德扎格 10 nr
+德拉 87 nrt
+德拉克马 8 ns
+德拉华 3 nr
+德拉古 5 ns
+德拉吉 2 nr
+德拉姆 7 nrt
+德拉斯 3 ns
+德拉河 3 ns
+德拉瓦河 8 ns
+德拉科 32 ns
+德拉诺 8 nr
+德拜 32 ns
+德攻宇 2 nr
+德政 58 nr
+德效骞 2 nr
+德文 132 nz
+德文版 3 nz
+德文系 3 nr
+德文郡 14 nr
+德斯 19 ns
+德斯坦 13 ns
+德斯杜 3 nr
+德斯特 2 nrt
+德斯维尔 2 nrt
+德新社 8 nt
+德施仁 4 nr
+德日意 3 nr
+德昂 20 ns
+德昂族 30 nz
+德昌 8 ns
+德昌县 3 ns
+德明商专 3 j
+德明商业 3 j
+德星君 15 nr
+德晖殿 2 nr
+德普 6 nrt
+德智体 46 nr
+德智体美 28 nr
+德智体群 3 nr
+德曼 9 nrt
+德曼诺 8 nr
+德服众 2 nr
+德朗 5 ns
+德望 29 nr
+德本财末 3 nr
+德松赞 2 nr
+德林 8 ns
+德林堡 2 ns
+德林河 4 ns
+德格 17 nrt
+德格伦 5 nr
+德格县 7 ns
+德格尔 2 nr
+德桑蒂斯 8 ns
+德梅尔 3 nr
+德梅西纳 3 ns
+德梅齐埃 10 ns
+德楞 2 ns
+德比 73 j
+德比尔 2 ns
+德比战 3 nz
+德比斯 3 ns
+德比郡 15 ns
+德永直 2 nr
+德永英明 3 nr
+德汗崇 2 nr
+德江 8 ns
+德江县 3 ns
+德沃夏克 10 nrt
+德沃德 9 nr
+德沃思 2 nr
+德沃拉 2 nr
+德沙尔 4 ns
+德治 26 ns
+德治国 2 ns
+德法字典 3 ns
+德法荷 3 nr
+德法词典 3 nr
+德波 6 ns
+德波林 5 nr
+德泽德 3 nr
+德洋恩普 3 nr
+德洛 6 ns
+德洛夫 12 nr
+德洛尔 2 nr
+德洛斯 5 ns
+德洛舞 2 nr
+德浅行薄 3 nr
+德海姆 3 nr
+德涅斯 2 nrt
+德涅斯特河 17 ns
+德润才 2 nr
+德清 28 nr
+德清县 9 ns
+德清西 2 ns
+德特著 16 nr
+德班 32 ns
+德班港 3 ns
+德理格 2 nr
+德理达 2 nz
+德瓦尔 10 nr
+德生昌 4 nr
+德田球 2 nr
+德甲 108 ns
+德甲球 3 nr
+德甲联赛 3 nz
+德皇威 18 nr
+德相生 2 nr
+德真君 6 nr
+德祖赞 2 nr
+德福 2 ns
+德福雷 2 nr
+德秀镇 3 nr
+德科 11 ns
+德科夫 5 nr
+德科直 2 nr
+德穆兰 2 ns
+德米 12 nrt
+德米凯 5 nr
+德米凯利斯 3 ns
+德米娜 2 nr
+德米特 16 nrt
+德米特里 20 nrt
+德米雷尔 3 nrt
+德索托 2 nr
+德累斯顿 77 ns
+德纳 5 ns
+德纳现 2 nr
+德维佳 2 nr
+德维奇 8 nr
+德维尔 16 nr
+德维峰 5 nr
+德维希 3 nr
+德维德 14 nr
+德维拉 4 nrt
+德维杰 3 nr
+德维湖 2 ns
+德维特 3 nrt
+德维纳 3 ns
+德维雅 2 nr
+德罗 56 nrt
+德罗夫 3 nr
+德罗巴 3 ns
+德罗斯 8 ns
+德罗河 2 ns
+德罗萨斯 2 ns
+德罗西 3 ns
+德美特 3 ns
+德耀哥 2 nr
+德耀开 2 nr
+德育 215 nr
+德育处 2 nt
+德育工作 3 n
+德育护专 3 nr
+德育教育 3 l
+德育论文 3 nz
+德育课 2 nr
+德胜头迴 3 nz
+德胜路 3 ns
+德胜门 203 ns
+德能胜 2 nr
+德臣西 2 nr
+德舰 8 n
+德艺双馨 19 nr
+德芒戎 2 nr
+德芙 5 nrt
+德苏 3 ns
+德茨 2 nrt
+德莫利 4 nrt
+德莫斯 2 nrt
+德莱克 4 nr
+德莱塞 9 nr
+德莱娜 2 nr
+德莱斯 6 nr
+德莱木 3 nr
+德莱格 5 nr
+德莱赫 9 nr
+德莱顿 2 nr
+德菲 3 nrt
+德菲尔 2 nr
+德萨 2 ns
+德萨拉 2 ns
+德萨林 6 ns
+德蒙 3 ns
+德薄才鲜 3 i
+德薄能鲜 3 i
+德薛禅 2 nr
+德行 291 j
+德裔瑞士 3 nr
+德西 2 ns
+德西尔吉 3 ns
+德言容功 3 i
+德言工容 3 n
+德言工貌 3 n
+德语 274 nz
+德语系 3 n
+德诺夫 3 nr
+德谟克利特 30 ns
+德豪润 6 nr
+德资华 2 nz
+德赛 8 ns
+德赛二 3 nr
+德輶如毛 3 nr
+德輶如羽 3 nr
+德达善 16 ns
+德迈尔 10 nrt
+德通宝 2 nr
+德通社 13 nt
+德都 3 ns
+德都县 4 ns
+德鄂 3 j
+德配天地 7 n
+德里 231 ns
+德里亚 3 ns
+德里克 7 nrt
+德里奇 6 nrt
+德里达 3 nrt
+德重宝 2 nr
+德重恩弘 3 nr
+德金 11 n
+德金刚 2 nr
+德钦 28 nr
+德钦党 3 nr
+德钦县 5 nr
+德钦哥 8 nr
+德钦巴 4 nr
+德钦莫 4 nr
+德阳 28 ns
+德阳市 13 ns
+德隆 11 ns
+德隆望尊 3 nr
+德隆望重 3 nr
+德隆系 2 nr
+德雅 3 ns
+德集群 2 nr
+德雷克 37 nr
+德雷克斯勒 3 nrt
+德雷尔 3 nr
+德雷斯 2 nr
+德雷格尔 2 nrt
+德雷森 4 nr
+德雷贝尔 3 nrt
+德音莫违 3 i
+德顺 2 ns
+德顺军 5 nr
+德领兵 2 nr
+德馨远播 3 nr
+德马吉 6 nr
+德高 4 ns
+德高望重 126 i
+德鲁 29 ns
+德鲁伊 3 nr
+德鲁依 3 nr
+德鲁克 8 nr
+德鲁兹 9 nr
+德鲁奇 10 nr
+德鲁奥 2 nr
+德鲁普 5 nr
+德鲁特 3 nr
+德黑兰 209 ns
+德齐 24 ns
+德齐弟 2 nr
+徺 4 zg
+徼 21 g
+徽 405 n
+徽剧 15 n
+徽县 9 ns
+徽号 143 n
+徽商 38 n
+徽墨 16 n
+徽宗 39 n
+徽山 3 ns
+徽州 239 ns
+徽州区 5 ns
+徽州地区 7 ns
+徽帜 3 n
+徽标 4 n
+徽派 21 n
+徽班 27 n
+徽章 72 n
+徽章厂 3 n
+徽菇 3 n
+徽菜 3 n
+徽记 8 n
+徽调 5 n
+忁 3 zg
+心 25236 n
+心上 1008 s
+心上人 103 n
+心上心下 3 i
+心不两用 3 i
+心不变 3 i
+心不在焉 164 i
+心不应口 3 i
+心不死 3 i
+心不烦 21 i
+心不甘 3 v
+心不由主 3 i
+心不由意 3 i
+心不老 3 i
+心不跳 3 i
+心中 14906 s
+心中无数 17 i
+心中有数 157 l
+心中有鬼 3 i
+心丹 11 n
+心乡往之 3 i
+心乱 3 i
+心乱如麻 82 i
+心事 360 n
+心事重重 90 i
+心交社 3 n
+心仪 106 n
+心仪已久 16 i
+心会跟 3 n
+心传 3 n
+心伤 26 n
+心余力竭 3 i
+心余力绌 3 i
+心儿 32 n
+心光 3 n
+心内 3 s
+心内科 10 n
+心内膜 3 n
+心内膜炎 3 n
+心净 3 a
+心凉 11 a
+心凝形释 3 n
+心切 187 a
+心到神知 3 i
+心力 65 n
+心力交瘁 55 i
+心力衰竭 102 i
+心功能 63 n
+心动 255 n
+心动不已 3 i
+心动价 3 n
+心动图 27 n
+心动徐缓 3 i
+心动过速 3 n
+心劲 19 a
+心劲儿 3 nr
+心劳意攘 3 i
+心劳日拙 3 i
+心劳计绌 3 i
+心包 102 n
+心包炎 17 n
+心博过速 3 n
+心去难留 3 i
+心口 155 s
+心口不一 17 i
+心口如一 6 i
+心口相应 3 i
+心同止水 3 i
+心同此理 6 i
+心向 3 n
+心向往之 19 i
+心向祖国 3 n
+心咒 3 n
+心品 2 n
+心善 3 v
+心囊 3 n
+心回意转 3 i
+心土 4 n
+心土犁 3 nr
+心在魏阙 3 nr
+心地 295 s
+心地光明 3 i
+心地善良 3 i
+心地好 3 l
+心地狭窄 3 v
+心地纯洁 3 i
+心坎 62 n
+心坐标 2 n
+心坚石穿 3 i
+心境 384 s
+心境障碍 3 n
+心墙 17 n
+心壁 2 s
+心声 201 n
+心外科 39 n
+心外膜 3 n
+心头 1882 s
+心头撞鹿 3 i
+心头病 3 n
+心头肉 17 n
+心头鹿撞 3 i
+心如刀剉 3 v
+心如刀割 37 i
+心如刀搅 3 nr
+心如刀绞 25 l
+心如刀锉 3 n
+心如刀锯 3 v
+心如古井 4 i
+心如坚石 3 i
+心如寒灰 3 i
+心如悬旌 3 n
+心如木石 3 i
+心如枯井 3 i
+心如槁木 3 i
+心如止水 19 i
+心如死灰 13 i
+心如火焚 3 i
+心如火燎 3 i
+心如金石 3 i
+心如铁石 9 i
+心子 24 n
+心存 2 n
+心存侥幸 3 vn
+心存疑惑 9 l
+心存目想 3 i
+心存芥蒂 7 l
+心存魏阙 3 nr
+心学 3 n
+心安 62 n
+心安理得 107 i
+心安神 3 n
+心室 144 n
+心室扑动 3 i
+心室颤动 3 i
+心宽体胖 4 nr
+心宿 4 n
+心寒 64 n
+心寒胆战 3 i
+心寒胆落 3 i
+心导管 13 n
+心小志大 3 nr
+心尖 23 n
+心巧嘴乖 3 n
+心平气和 86 i
+心平气定 3 i
+心广体胖 3 i
+心底 804 s
+心开目明 3 i
+心弛神往 3 v
+心弦 59 n
+心形 30 n
+心形线 3 s
+心往神驰 3 i
+心律 174 n
+心律不整 3 l
+心律不齐 3 i
+心律失常 3 i
+心得 234 v
+心得体会 3 l
+心得安 7 i
+心心 3 n
+心心念念 7 n
+心心相印 52 i
+心心相应 3 i
+心心相连 3 i
+心志 94 n
+心忙意乱 3 i
+心忙意急 3 i
+心念 481 n
+心怀 385 n
+心怀不善 3 i
+心怀不满 3 i
+心怀不轨 3 i
+心怀叵测 17 i
+心怀忐忑 3 a
+心怀疑忌 3 l
+心怀鬼胎 27 l
+心态 1363 n
+心态学 3 n
+心态平衡 3 i
+心思 1612 n
+心思慎密 3 i
+心思敏捷 3 nr
+心怡神旷 3 nr
+心急 98 a
+心急如火 5 i
+心急如焚 67 i
+心急火燎 60 i
+心性 176 n
+心悦神怡 3 i
+心悦诚服 46 i
+心悬 4 v
+心悲 3 a
+心悸 178 v
+心情 3662 n
+心情坏 3 i
+心情开朗 3 i
+心情愉快 3 z
+心情沉重 3 i
+心情舒畅 3 nr
+心情阴郁 3 n
+心情随笔 3 i
+心情驿站 3 vn
+心惊 394 a
+心惊肉战 3 i
+心惊肉跳 152 i
+心惊胆寒 9 i
+心惊胆战 119 i
+心惊胆落 3 i
+心惊胆裂 3 i
+心惊胆跳 3 i
+心惊胆颤 11 i
+心想 7205 n
+心想事成 7 i
+心想字成 3 l
+心意 908 n
+心意拳 3 i
+心意相投 3 i
+心愿 589 n
+心慈 7 nr
+心慈手软 28 i
+心慈面软 8 i
+心慌 96 a
+心慌意乱 112 i
+心慌意急 3 i
+心慌慌 3 n
+心慌撩乱 3 vn
+心慌方 3 i
+心慕手追 3 nr
+心慧 3 n
+心慵意懒 3 v
+心战 3 n
+心房 125 n
+心房扑动 3 i
+心房颤动 3 i
+心所 3 n
+心扉 61 n
+心手相应 3 i
+心手相忘 3 i
+心折 3 n
+心掌 3 n
+心掏 3 nr
+心搏 5 n
+心摹手追 3 nr
+心数 2 n
+心旌摇摇 3 l
+心旌摇曳 3 l
+心旌摇荡 18 l
+心无二用 7 l
+心无挂碍 3 i
+心无旁骛 17 i
+心无杂念 3 i
+心旷神怡 218 i
+心旷神恬 3 i
+心旷神飞 3 i
+心明如镜 2 l
+心明眼亮 3 l
+心智 158 n
+心智健全 3 nr
+心智机理 3 i
+心曲 18 n
+心有余力 3 l
+心有余悸 67 i
+心有余而力不足 31 i
+心有灵犀 3 nr
+心有灵犀一点通 14 i
+心服 89 n
+心服口服 66 i
+心服情愿 3 i
+心服首肯 3 nr
+心木 8 n
+心术 56 n
+心术不正 30 i
+心术不端 3 l
+心机 87 n
+心材 2 n
+心桥 3 n
+心梗 11 n
+心横 7 v
+心欢 2 v
+心殒胆破 3 nr
+心殒胆落 3 nr
+心毒 3 n
+心毒手辣 3 i
+心比天高 8 i
+心气 66 n
+心气儿 10 n
+心水 3 n
+心沉 3 a
+心泉 3 n
+心法 196 n
+心活面软 3 i
+心浮 16 v
+心浮气动 3 l
+心浮气燥 3 l
+心浮气盛 3 i
+心浮气粗 3 i
+心浮气躁 19 i
+心海 4 s
+心海棠 17 nr
+心淡 3 a
+心源 3 n
+心源性 3 n
+心溪 14 n
+心满原足 3 i
+心满意得 3 i
+心满意足 247 i
+心满愿足 3 i
+心滩沉积 3 nr
+心潮 25 n
+心潮澎湃 45 i
+心潮翻滚 3 l
+心潮起伏 16 i
+心潮难平 7 i
+心澄神净 3 nr
+心火 56 n
+心火如灼 3 a
+心灰 13 n
+心灰意冷 72 i
+心灰意懒 55 i
+心灰意败 3 n
+心灵 1411 n
+心灵史 3 n
+心灵学 3 n
+心灵性巧 3 i
+心灵感应 3 l
+心灵手巧 18 i
+心灵深处 3 i
+心灵美 3 nr
+心灵鸡汤 3 i
+心烦 140 a
+心烦意乱 102 i
+心烦意躁 6 i
+心烦技痒 3 i
+心烦虑乱 3 i
+心焦 95 n
+心焦如火 3 i
+心焦如焚 7 i
+心焦火燎 3 i
+心照 7 n
+心照不宣 73 i
+心照情交 3 i
+心照神交 3 i
+心爱 362 n
+心爱人 3 nr
+心物 3 n
+心狠 22 a
+心狠手毒 2 l
+心狠手辣 104 i
+心狠手黑 3 i
+心猛 2 a
+心猿意马 32 i
+心率 109 n
+心王 3 n
+心理 6715 n
+心理专家 3 l
+心理主义 3 n
+心理作用 3 n
+心理健康 3 n
+心理准备 3 n
+心理剧 3 n
+心理化学 3 n
+心理医生 3 n
+心理卫生 3 n
+心理压力 3 n
+心理反映 3 i
+心理变态 3 l
+心理咨询 3 nz
+心理品质 3 n
+心理因素 3 n
+心理场 3 n
+心理声学 3 l
+心理学 1268 n
+心理学史 3 n
+心理学家 229 n
+心理学系 3 n
+心理定势 3 n
+心理战 3 n
+心理战术 3 n
+心理扫描 3 n
+心理治疗 3 n
+心理活动 3 l
+心理特征 3 n
+心理特点 3 n
+心理现象 3 n
+心理疾病 3 n
+心理相容 3 n
+心理系 9 n
+心理素质 3 n
+心理线 3 n
+心理维度 3 n
+心理网 3 n
+心理群体 3 n
+心理耗竭 3 n
+心理螳螂 3 n
+心理诊所 3 n
+心理负荷 3 n
+心理过程 3 l
+心理量表 3 n
+心理障碍 3 n
+心瓣 3 n
+心甘 29 v
+心甘情原 3 i
+心甘情愿 225 i
+心生 7 n
+心田 53 n
+心电 22 n
+心电图 109 n
+心电图仪 3 nz
+心电感应 2 l
+心电监护 3 n
+心疑 3 v
+心疼 602 a
+心疾 3 n
+心病 137 n
+心病还须心药医 2 i
+心病难医 3 i
+心痒 3 a
+心痒难抓 3 l
+心痒难挠 5 l
+心痛 196 n
+心痛定 3 i
+心痛病 2 n
+心瘾 3 n
+心皮 109 n
+心目 998 n
+心直口快 33 i
+心直嘴快 3 i
+心眼 207 n
+心眼儿 130 n
+心眼小 3 l
+心瞻魏阙 3 nr
+心知 3 n
+心知其意 3 i
+心知肚明 48 i
+心砚 108 n
+心硬 17 a
+心碎 52 v
+心神 406 n
+心神不宁 44 i
+心神不安 18 i
+心神不定 99 i
+心神丧失 3 i
+心神恍惚 32 i
+心神病 3 n
+心神领会 3 l
+心禅 2 n
+心秀 3 nr
+心空 2 s
+心窄 3 a
+心窍 36 n
+心窗 3 n
+心窝 112 n
+心窝儿 2 n
+心窝子 35 n
+心窝窝 3 n
+心算 40 n
+心算能力 3 n
+心粗气浮 3 i
+心粗胆大 3 i
+心系 25 n
+心累 3 v
+心细 28 a
+心细于发 3 i
+心细如发 14 i
+心细胆大 3 i
+心织笔耕 3 n
+心经 3 n
+心结 40 v
+心绞痛 120 n
+心绪 204 n
+心绪不宁 3 i
+心绪如麻 3 i
+心绪恍惚 3 i
+心耳 3 n
+心肌 219 n
+心肌梗塞 57 n
+心肌梗死 83 n
+心肌炎 46 n
+心肌病 30 n
+心肌细胞 3 n
+心肌缺血 3 i
+心肝 171 n
+心肝儿 5 n
+心肝宝贝 30 n
+心肠 403 n
+心肠坏 3 i
+心肠好 3 l
+心肠歹毒 3 i
+心肠硬 3 i
+心肠软 3 i
+心肺 139 n
+心肺机 3 n
+心胆 31 n
+心胆俱寒 3 i
+心胆俱碎 3 i
+心胆俱裂 41 i
+心胸 196 n
+心胸开朗 3 i
+心胸开阔 3 i
+心胸狭小 3 z
+心胸狭窄 3 v
+心胸狭隘 3 n
+心胸脥窄 3 n
+心脉 8 n
+心脏 1338 n
+心脏地区 3 n
+心脏地带 3 n
+心脏外科 3 n
+心脏学 3 n
+心脏疾患 3 i
+心脏病 522 n
+心脏病发 3 i
+心脏病学 5 n
+心脏病科 3 n
+心脏科 3 n
+心脏计 3 i
+心脏起搏器 15 nz
+心脏镜 3 n
+心脏麻痹 3 n
+心脑 9 n
+心脑血管 46 n
+心脑血管病 15 n
+心脾 51 n
+心腑 3 n
+心腹 560 n
+心腹之交 3 i
+心腹之忧 3 i
+心腹之患 42 i
+心腹之疾 3 i
+心腹之病 3 i
+心腹大患 42 i
+心腹爪牙 3 n
+心腹重患 3 i
+心膂股肱 3 n
+心膊率 3 n
+心花 10 n
+心花怒发 3 i
+心花怒放 147 i
+心花放 3 l
+心苑 94 n
+心若死灰 3 i
+心苦 3 a
+心荡神怡 3 i
+心荡神摇 2 i
+心荡神迷 3 i
+心荡神驰 2 i
+心药 3 n
+心虔志诚 3 v
+心虚 153 n
+心血 524 n
+心血来潮 67 i
+心血瘀阻 5 n
+心血白费 3 n
+心血管 309 n
+心血管病 61 n
+心血管科 2 n
+心衡 2 a
+心衰 28 n
+心裁 136 n
+心裂肺炸 3 i
+心要 3 b
+心计 87 v
+心许 2 v
+心诚 13 nr
+心诚则灵 3 i
+心语 12 n
+心谤腹非 3 n
+心象 3 n
+心贯白日 3 i
+心贴心 3 n
+心路 36 n
+心路历程 3 l
+心跳 441 v
+心跳声 16 i
+心跳男孩 3 n
+心身 60 n
+心身关系 3 l
+心身医学 3 l
+心身疾病 3 n
+心软 95 a
+心轴 3 n
+心辣手狠 3 l
+心连心 41 i
+心迷 3 n
+心迹 53 n
+心通 3 n
+心逸日休 3 i
+心道 168 n
+心部 3 n
+心酸 198 n
+心醉 41 nr
+心醉神迷 5 i
+心醉魂迷 3 i
+心里 10571 s
+心里不安 3 i
+心里想法 3 i
+心里打鼓 3 i
+心里有底 3 i
+心里有数 53 i
+心里美 4 nr
+心里话 206 n
+心重 3 n
+心野 2 n
+心钠素 3 nr
+心长力短 3 i
+心长发短 3 i
+心长绠短 3 z
+心门 3 n
+心闲手敏 3 l
+心间 3 n
+心阳 5 n
+心雄万夫 3 nr
+心雨 3 n
+心静 24 a
+心静如水 5 i
+心静气 7 n
+心非巷议 3 i
+心音 73 n
+心领 3 n
+心领意会 3 l
+心领神会 67 l
+心领神悟 3 i
+心香 2 n
+心驰神往 13 i
+心驰魏阙 3 nr
+心髓 3 n
+心高气傲 52 i
+心魂 24 n
+心魄 37 n
+心黑手辣 5 i
+忄 4 zg
+必 9063 d
+必不可免 3 l
+必不可少 450 l
+必不可缺 117 l
+必不得已 3 d
+必不挠北 3 i
+必也正名 3 l
+必争 3 nz
+必争之地 20 l
+必传之作 3 l
+必保 3 v
+必修 68 v
+必修科 3 nz
+必修课 101 n
+必修课程 3 n
+必停 3 d
+必先 3 d
+必先与之 3 i
+必先予之 2 i
+必先利其器 8 l
+必受其乱 3 i
+必可 3 d
+必填 3 v
+必备 1542 v
+必备品 5 n
+必备条件 3 l
+必备良药 3 l
+必备软件 3 l
+必学 3 n
+必定 1706 d
+必定会 3 l
+必将 937 d
+必将会 3 n
+必居其一 3 i
+必应 3 d
+必当 3 d
+必得 3 d
+必必剥剥 3 i
+必恭 3 a
+必恭必敬 4 i
+必成 3 v
+必操胜券 3 l
+必敬 3 a
+必无 3 l
+必无此事 3 l
+必是 3 d
+必有一伤 3 l
+必有一失 6 l
+必有一得 3 l
+必有其子 3 l
+必有其徒 3 i
+必有勇夫 9 i
+必有后福 3 l
+必有我师 4 l
+必有用 3 l
+必有芳草 3 i
+必有路 3 l
+必有近忧 8 l
+必杀 3 v
+必杀令 3 l
+必杀技 3 nz
+必杀计 3 l
+必死 3 d
+必死之心 3 i
+必死无疑 3 i
+必然 4280 d
+必然之事 3 l
+必然之势 3 l
+必然命运 3 l
+必然律 3 l
+必然性 197 l
+必然王国 22 l
+必然结果 3 i
+必然联系 3 l
+必然规律 3 l
+必然趋势 3 l
+必然选择 3 l
+必由之路 76 l
+必究 3 d
+必竟 3 d
+必答 3 v
+必答题 4 n
+必经 197 d
+必经之地 3 l
+必经之路 186 l
+必经之道 3 l
+必经途经 3 l
+必经阶段 3 n
+必罚 3 vn
+必考 33 v
+必考题 3 n
+必胜 275 v
+必胜信心 3 l
+必胜信念 3 l
+必胜客 16 l
+必能 3 d
+必要 5175 d
+必要产品 3 l
+必要劳动 177 l
+必要性 225 l
+必要措施 3 n
+必要条件 276 l
+必读 1107 v
+必读书 9 n
+必败 104 v
+必赏 3 v
+必躬必亲 3 i
+必输无疑 3 n
+必达 12 a
+必选 3 v
+必选课 3 n
+必选课程 3 n
+必里迟离 3 l
+必需 1273 v
+必需元素 3 l
+必需品 160 l
+必须 21884 d
+必须品 3 n
+忆 241 nr
+忆及 26 v
+忆往昔 3 nr
+忆想当年 3 l
+忆想往事 3 l
+忆旧 11 nr
+忆旧游 3 l
+忆江南 2 nr
+忆测 3 vn
+忆秦娥 3 nr
+忆苦 17 v
+忆苦思甜 28 nr
+忆苦饭 3 l
+忆起 24 v
+忆述 3 v
+忇 2 zg
+忈 4 zg
+忊 13 zg
+忋 63 zg
+忌 4236 v
+忌刻 3 v
+忌动 3 v
+忌口 15 vn
+忌嘴 3 v
+忌妒 26 v
+忌妒心 5 n
+忌恨 53 v
+忌惮 308 v
+忌才 5 t
+忌日 28 t
+忌讳 355 v
+忌语 5 v
+忌辰 18 n
+忌酒 3 v
+忌食 54 v
+忍 2129 v
+忍一时 3 d
+忍下 3 v
+忍下去 3 v
+忍下来 3 v
+忍不住 2838 v
+忍住 3 v
+忍俊不住 9 i
+忍俊不禁 40 i
+忍冬 16 v
+忍冬科 7 i
+忍冬花 3 i
+忍冬藤 3 nz
+忍到 3 v
+忍受 851 v
+忍受力 2 i
+忍受得了 3 i
+忍受着 3 v
+忍垢偷生 3 i
+忍尤含垢 3 i
+忍得 3 v
+忍心 334 v
+忍心害理 3 i
+忍忍 3 v
+忍性 3 n
+忍悛不禁 3 v
+忍无可忍 118 i
+忍术 3 v
+忍来忍去 3 i
+忍气 3 v
+忍气吞声 98 i
+忍痛 118 v
+忍痛割爱 25 i
+忍痛牺牲 3 i
+忍者 3 n
+忍者神龟 3 n
+忍者龟 3 n
+忍耐 672 v
+忍耐住 3 i
+忍耐力 34 i
+忍耻偷生 3 i
+忍耻含垢 3 i
+忍耻含羞 3 n
+忍苦耐劳 3 i
+忍让 82 v
+忍贼作父 3 i
+忍辱 3 v
+忍辱偷生 3 i
+忍辱含垢 2 i
+忍辱含羞 3 n
+忍辱念垢 3 i
+忍辱求全 3 i
+忍辱负重 43 i
+忍过 3 v
+忍过去 3 i
+忍过来 3 v
+忍饥受饿 3 i
+忍饥挨饿 16 i
+忍饿 3 v
+忎 347 zg
+忏 60 v
+忏悔 227 v
+忏悔书 3 n
+忏悔录 10 n
+忏悔者 2 n
+忐 18 zg
+忐上忑下 3 i
+忐忑 75 a
+忐忑不安 134 i
+忐忑不定 3 i
+忑 4 x
+忒 602 d
+忒楞楞 3 z
+忓 525 zg
+忔 404 zg
+忕 199 zg
+忖 106 v
+忖度 19 v
+忖道 3 v
+忖量 4 v
+志 3667 n
+志不可满 3 i
+志不在此 3 i
+志业 6 n
+志丹 14 nr
+志丹县 11 ns
+志书 3 n
+志事 3 n
+志军 258 n
+志农 3 n
+志同道合 88 i
+志同道合者 6 n
+志向 159 n
+志哀 20 nr
+志喜 3 nr
+志在 155 t
+志在千里 6 i
+志在四方 6 i
+志在四海 3 i
+志在必得 61 i
+志在比得 3 i
+志坚行苦 3 i
+志士 86 n
+志士仁人 15 nrt
+志大才疏 8 i
+志大量小 3 n
+志子 3 n
+志存高远 7 nr
+志学 5 n
+志室 3 n
+志峰 3 n
+志广才疏 3 i
+志庆 3 t
+志异 3 n
+志强 15 nrfg
+志得意满 62 i
+志得气盈 3 i
+志愿 3801 n
+志愿书 6 n
+志愿人员 3 n
+志愿兵 35 n
+志愿兵制 3 n
+志愿军 500 n
+志愿团 2 n
+志愿者 730 n
+志愿队 6 n
+志成 3 nrfg
+志摩 7 nrt
+志民 3 n
+志气 185 n
+志水 3 n
+志洁行芳 3 nr
+志海 3 ns
+志满意得 3 i
+志满气得 3 i
+志满气骄 3 i
+志琴 2 n
+志留系 25 n
+志留纪 44 t
+志盈心满 3 nr
+志美行厉 3 i
+志节 3 t
+志行 2 n
+志豪 14 n
+志趣 87 n
+志趣相投 3 i
+志足意满 3 i
+志达 5 nrt
+志远 18 nrfg
+志骄意满 3 i
+志高气扬 3 i
+忘 4957 v
+忘不了 164 v
+忘不掉 3 v
+忘乎 3 v
+忘乎其形 3 i
+忘乎所以 52 i
+忘事 3 v
+忘光 3 v
+忘其所以 3 i
+忘却 231 v
+忘啜废枕 3 nr
+忘啦 3 n
+忘天兴叹 3 i
+忘字 3 v
+忘寝废食 3 i
+忘尽 3 v
+忘带 3 v
+忘年之交 10 i
+忘年之契 3 v
+忘年之好 3 l
+忘年交 14 b
+忘年恋 3 v
+忘年情 3 i
+忘形 44 v
+忘形之交 3 i
+忘形之契 3 v
+忘形交 3 i
+忘忧 3 v
+忘忧国 3 i
+忘忧草 3 i
+忘怀 69 v
+忘怀高歌 3 i
+忘性 4 b
+忘恩 25 v
+忘恩失义 3 i
+忘恩背义 3 i
+忘恩负义 136 i
+忘悼 3 v
+忘情 97 v
+忘情所以 3 i
+忘情水 3 i
+忘情负义 3 i
+忘我 91 v
+忘我劳动 3 l
+忘我境界 3 i
+忘我工作 4 l
+忘我精神 3 i
+忘战心危 3 i
+忘战必危 3 i
+忘战者危 3 i
+忘掉 218 v
+忘旧 3 v
+忘本 29 v
+忘杯 3 v
+忘河 3 v
+忘生舍死 3 i
+忘神 3 v
+忘私 3 v
+忘私遏欲 3 i
+忘言 3 v
+忘记 2410 v
+忘记掉 3 v
+忘词 3 v
+忘象得意 3 v
+忘郤 3 v
+忘餐废寝 3 i
+忙 10154 v
+忙不择价 3 i
+忙不过来 3 l
+忙不迭 141 i
+忙东忙西 3 i
+忙中出错 3 i
+忙中有失 3 i
+忙中有错 3 i
+忙乎 31 d
+忙乱 150 a
+忙于 361 v
+忙前忙后 8 i
+忙得不可 3 i
+忙忙 3 d
+忙忙乱乱 3 i
+忙忙叨叨 3 z
+忙忙地 7 z
+忙忙急急 3 z
+忙忙碌碌 78 z
+忙成 3 v
+忙成一团 3 l
+忙昏 3 v
+忙昏了头 3 i
+忙来忙去 3 z
+忙活 378 a
+忙碌 623 a
+忙碌不堪 4 i
+忙而不乱 2 i
+忙这忙那 3 l
+忙迫 3 d
+忙里偷闲 21 i
+忙里忙外 9 i
+忙音 4 v
+忚 215 zg
+忛 139 zg
+忝 89 vg
+忝不知耻 3 nr
+忞 10 zg
+忠 2170 nr
+忠不违君 3 i
+忠不避危 3 i
+忠义 372 n
+忠义千秋 3 i
+忠义堂 3 n
+忠于 384 v
+忠于党 3 i
+忠于国家 3 l
+忠于祖国 3 i
+忠于职守 22 i
+忠仁不二 3 i
+忠仆 3 n
+忠信 3 n
+忠信乐易 3 i
+忠勇 66 a
+忠勇为爱 3 i
+忠勇双全 3 i
+忠厚 122 a
+忠厚老实 46 i
+忠县 45 ns
+忠君 58 n
+忠君报国 3 i
+忠君爱国 29 ns
+忠告 135 n
+忠告善道 3 i
+忠奸 3 n
+忠孝 86 a
+忠孝不并 3 nr
+忠孝不能 3 i
+忠孝不能两全 8 i
+忠孝东路 3 nrt
+忠孝两全 3 i
+忠孝医院 3 l
+忠孝国中 3 l
+忠孝国小 3 l
+忠孝节义 16 l
+忠孝西路 3 nrt
+忠孝路 3 nrt
+忠实 467 a
+忠实函子 3 l
+忠实可靠 3 i
+忠实听众 3 i
+忠实度 3 l
+忠实性 3 n
+忠实模 3 l
+忠实笃行 3 n
+忠实观众 3 i
+忠心 503 n
+忠心耿耿 190 i
+忠心贯日 3 i
+忠心赤胆 6 i
+忠恕 3 v
+忠恳 3 a
+忠武王 2 nrt
+忠清 6 v
+忠清南道 2 l
+忠烈 53 a
+忠烈祠 3 nr
+忠直 3 a
+忠纯 3 a
+忠肝义胆 14 i
+忠臣 316 n
+忠臣孝子 3 nr
+忠良 73 a
+忠言 50 n
+忠言奇谋 3 i
+忠言逆耳 6 i
+忠言逆耳利于行 4 i
+忠诚 609 a
+忠诚可靠 3 i
+忠诚坦白 3 i
+忠诚度 60 i
+忠诚老实 3 i
+忠贞 80 n
+忠贞不二 9 i
+忠贞不屈 3 i
+忠贞不渝 15 i
+忠贯日月 3 i
+忠贯白日 3 i
+忠顺 11 a
+忠驱义感 3 n
+忠骨 7 n
+忠魂 15 n
+忡 11 x
+忡忡 3 i
+忣 2 zg
+忤 111 ag
+忤违 3 v
+忤逆 40 v
+忤逆不孝 11 l
+忥 113 zg
+忦 5 zg
+忧 1783 v
+忧伤 204 v
+忧公如家 3 i
+忧公忘私 3 i
+忧劳 3 a
+忧劳成疾 3 i
+忧困 2 a
+忧国 3 n
+忧国哀民 3 i
+忧国奉公 3 i
+忧国如家 3 i
+忧国忘家 3 n
+忧国忘私 3 i
+忧国忘身 3 i
+忧国忧民 171 i
+忧国恤民 3 n
+忧国爱民 3 i
+忧容 12 n
+忧形于色 3 i
+忧心 119 a
+忧心似焚 3 i
+忧心如捣 3 v
+忧心如焚 45 i
+忧心如醒 3 i
+忧心忡忡 207 i
+忧心悄悄 3 n
+忧怖 3 a
+忧思 48 a
+忧急 3 a
+忧怨 3 v
+忧恤 3 v
+忧悒 3 a
+忧患 159 n
+忧患与共 3 i
+忧患余生 3 i
+忧患意识 3 i
+忧惧 30 a
+忧愁 208 a
+忧愤 49 a
+忧愤成疾 3 i
+忧懑 3 a
+忧戚 12 n
+忧民 3 n
+忧沉 3 a
+忧深思远 3 i
+忧火如焚 3 i
+忧灼 3 a
+忧烦 5 a
+忧疑 3 a
+忧盛危明 3 i
+忧能伤人 3 i
+忧色 75 n
+忧苦 3 a
+忧虑 739 v
+忧虑感 3 i
+忧谗畏讥 4 i
+忧郁 310 a
+忧郁症 47 i
+忧闷 40 a
+忪 4 x
+快 21973 a
+快上 3 d
+快上去 3 i
+快上来 3 l
+快上车 3 n
+快下 3 d
+快下班 3 n
+快中子 17 n
+快为 3 d
+快乐 2516 a
+快乐岛 3 n
+快乐龙 3 nz
+快乾 3 ns
+快于 3 d
+快人一言 3 i
+快人快事 3 i
+快人快性 3 n
+快人快语 16 i
+快件 14 n
+快信 6 nz
+快借 3 v
+快停了 3 v
+快偷 3 d
+快冲 3 z
+快刀 58 n
+快刀斩乱 3 i
+快刀斩乱麻 26 i
+快刀斩麻 3 i
+快删 3 v
+快别 3 d
+快包 3 n
+快升 3 v
+快印店 3 n
+快去快回 3 z
+快又准 3 i
+快又稳 3 l
+快反 22 v
+快咬 3 v
+快嘴 15 d
+快嘴利舌 3 i
+快嘴快舌 3 i
+快回到 3 l
+快回去 3 i
+快奏 3 n
+快好了 3 l
+快如闪电 3 l
+快守 3 a
+快完了 3 l
+快审快结 3 n
+快帆船 3 n
+快干 20 n
+快当 16 d
+快得多 3 d
+快心满志 3 i
+快心满意 3 i
+快心遂意 3 i
+快快 597 d
+快快乐乐 22 i
+快快活活 3 i
+快思聪 3 nz
+快意 102 d
+快意当前 3 a
+快感 197 a
+快慢 137 d
+快慢班 3 n
+快慰 51 a
+快手快脚 14 z
+快打旋风 3 i
+快抓紧 3 l
+快投 3 j
+快抢 3 j
+快报 119 n
+快抱 3 n
+快挤 3 a
+快捷 294 a
+快捷方式 2 n
+快捷酒店 3 n
+快捷键 6 n
+快揍 3 v
+快搞 3 a
+快搬 3 v
+快摇 3 v
+快撑 3 v
+快撕 3 nz
+快撤 3 v
+快擦写 3 i
+快擦写存储器 3 n
+快收 3 n
+快攻 121 vn
+快攻手 2 n
+快易典 3 n
+快易通 3 nz
+快来 3 d
+快板 62 n
+快板书 7 n
+快板儿 3 n
+快枪 3 n
+快枪侠 3 n
+快枪手 3 n
+快棋 9 n
+快棋赛 6 n
+快步 847 d
+快步前进 3 i
+快步流星 3 nz
+快死了 3 l
+快没了 3 l
+快治 3 n
+快泡 3 n
+快活 475 d
+快活人 3 n
+快活地 3 n
+快活林 3 n
+快活起来 3 l
+快滚 3 z
+快满了 3 l
+快点 254 d
+快点儿 29 d
+快热式 2 n
+快煤 3 n
+快照 778 n
+快熟了 3 l
+快爬 3 v
+快犊破车 3 n
+快玩 3 a
+快班 3 n
+快球 6 n
+快生了 3 l
+快痛 3 a
+快盛 3 a
+快相 5 d
+快睡吧 3 n
+快答 3 v
+快组分 3 n
+快给我 3 i
+快翻译 3 l
+快船 304 n
+快船队 3 n
+快艇 157 n
+快节奏 3 n
+快若闪电 3 l
+快要 597 d
+快言快语 6 i
+快讨 3 v
+快让开 3 n
+快讯 38 nz
+快记 3 n
+快译 3 n
+快译通 2 n
+快试 3 vn
+快语 3 nz
+快读网 3 nz
+快赢 3 n
+快赢了 3 n
+快赶 3 v
+快车 129 n
+快车单 3 n
+快车道 17 n
+快轨 3 n
+快迅 2 nz
+快运 8 n
+快进去 3 l
+快进来 3 l
+快追 3 v
+快适 3 a
+快逃 3 v
+快递 100 v
+快递费 3 n
+快速 4491 d
+快速化 3 n
+快速反应 8 n
+快速增长 3 n
+快速性 11 n
+快速机动 3 nz
+快速访问 6 n
+快速路 3 n
+快速通道 3 n
+快速道路 3 n
+快速门 3 n
+快邮日报 3 nz
+快锅 3 n
+快镜头 3 n
+快镜拍摄 3 v
+快门 37 d
+快门儿 3 n
+快门速度 3 n
+快门键 3 n
+快降 3 v
+快餐 99 n
+快餐业 4 n
+快餐厅 2 n
+快餐店 27 n
+快餐盒 3 n
+快餐车 3 n
+快餐部 3 n
+快餐馆 7 n
+快马一鞭 13 i
+快马加鞭 36 i
+快骑 3 n
+忬 7 zg
+忭 10 g
+忮 3 g
+忱 74 ng
+忲 3 zg
+念 3978 v
+念一念 3 n
+念下去 3 v
+念义 2 n
+念书 245 n
+念佛 150 n
+念作 3 v
+念兹在兹 10 nr
+念到 3 v
+念动训练 3 n
+念及 143 v
+念叨 143 v
+念咒 90 v
+念头 1329 n
+念奴娇 16 nr
+念完 3 v
+念念 77 n
+念念不忘 213 i
+念念有词 79 i
+念惜 3 v
+念慈在兹 3 nr
+念成 3 v
+念旧 47 v
+念旧情 3 n
+念曰 3 v
+念来念去 3 i
+念法 3 n
+念点 3 n
+念物 3 n
+念珠 204 n
+念珠菌 3 n
+念珠菌性 2 n
+念白 42 v
+念经 193 n
+念芦 3 n
+念诗 2 n
+念诵 86 v
+念起 3 v
+念起来 3 v
+念道 264 v
+念错 3 v
+念青五笔 3 i
+念青唐古拉山脉 20 ns
+念颂 2 v
+忶 2 zg
+忷 2 zg
+忸 9 a
+忸怩 99 a
+忸怩不安 3 i
+忸怩作态 19 i
+忸怩好 3 i
+忹 2 zg
+忻 58 zg
+忻口 51 ns
+忻口一 2 nr
+忻城 4 ns
+忻城伯 3 ns
+忻城县 3 ns
+忻定 2 ns
+忻州 47 ns
+忻州市 6 ns
+忻州网 3 nr
+忻府区 3 ns
+忼 3 zg
+忽 7683 d
+忽上忽下 3 l
+忽东忽西 3 l
+忽伦三虎 3 nz
+忽伦二虎 3 nz
+忽伦四虎 3 nz
+忽伦大虎 3 nz
+忽冷忽热 22 z
+忽前忽后 3 l
+忽哨 20 o
+忽喇喇 17 o
+忽地 726 d
+忽大忽小 3 z
+忽如一 3 l
+忽左忽右 11 l
+忽强忽弱 3 l
+忽律 16 d
+忽必烈 3 l
+忽快忽慢 3 l
+忽忽 41 d
+忽忽不乐 2 l
+忽忽悠悠 4 z
+忽悠 250 z
+忽悠忽悠 8 z
+忽悠悠 4 z
+忽明 3 d
+忽明忽暗 59 z
+忽明忽灭 3 l
+忽有所感 3 l
+忽来 3 d
+忽灭 3 v
+忽然 7645 d
+忽然间 3 l
+忽略 920 d
+忽略不计 3 l
+忽而 230 d
+忽视 1195 v
+忽起忽落 3 l
+忽逢 3 v
+忽都虎 3 nz
+忽长忽短 3 z
+忽闪 35 z
+忽闪忽闪 9 z
+忽闻 3 v
+忽阴忽晴 2 l
+忽隐忽现 21 z
+忽高忽低 3 z
+忾 35 g
+忿 389 a
+忿不顾身 3 i
+忿世嫉俗 3 i
+忿争 3 n
+忿忿 3 i
+忿忿不平 20 i
+忿忿然 3 i
+忿怒 171 a
+忿怒地 3 i
+忿恨 17 a
+忿懑 3 a
+忿戾 3 a
+忿火中烧 3 i
+忿然 3 a
+忿然作色 3 i
+忿言 3 n
+忿鸷 3 a
+怀 1918 v
+怀上 59 s
+怀中 1236 s
+怀乡 3 ns
+怀乡病 3 nr
+怀了孕 3 v
+怀亚特 2 nr
+怀仁 23 nr
+怀仁县 2 nr
+怀仁可汗 2 nr
+怀仁堂 42 nr
+怀俄明 12 nr
+怀俄明州 12 ns
+怀其德 2 nr
+怀冤抱屈 3 i
+怀刑自爱 3 nr
+怀利 4 ns
+怀化 36 v
+怀化市 10 ns
+怀博纳 3 nr
+怀卡托 3 nr
+怀卵量 5 n
+怀友 3 n
+怀古 55 ns
+怀唐伊 5 nr
+怀土之情 3 i
+怀圣寺 6 nr
+怀塔布 143 nr
+怀壁其罪 3 i
+怀大人 2 nr
+怀孕 797 v
+怀孕期 27 t
+怀宁 28 nr
+怀宁县 5 ns
+怀安 4 nr
+怀安县 2 ns
+怀宝迷邦 3 nr
+怀尔德 6 nr
+怀山襄陵 2 nr
+怀帝永 2 nr
+怀庆 13 ns
+怀庆府 9 nr
+怀废立 2 nr
+怀弥慰 3 nr
+怀德军 3 nr
+怀德县 4 nr
+怀德府 3 nr
+怀德海 3 nr
+怀德畏威 3 nr
+怀心腿 2 nr
+怀念 437 v
+怀恋 12 v
+怀恨 52 v
+怀恨在心 58 l
+怀恨者 3 nr
+怀恩堂 3 nr
+怀恩感 2 nr
+怀想 17 v
+怀成波 2 nr
+怀才不遇 46 i
+怀才抱器 3 nr
+怀才抱德 3 nr
+怀抱 833 v
+怀揣 62 v
+怀敌附远 3 i
+怀旧 102 v
+怀旧感 3 n
+怀昔贤 2 nr
+怀春 16 nr
+怀有 244 v
+怀有孕 2 nr
+怀有异 4 nr
+怀有成 3 nr
+怀有敌意 3 i
+怀朔镇 3 nr
+怀材抱器 3 l
+怀杖 8 n
+怀来 44 v
+怀来县 14 ns
+怀柔 89 nr
+怀柔区 9 nr
+怀柔县 16 nr
+怀柔天下 3 i
+怀柔政策 3 nr
+怀柔水库 2 nr
+怀殷忧 2 nr
+怀沙 3 ns
+怀海 3 ns
+怀炸弹 2 n
+怀牛膝 3 nr
+怀特 81 nr
+怀特兄弟 8 nr
+怀特曼 10 nr
+怀特河 3 nr
+怀特海 9 ns
+怀特海德 2 nr
+怀特霍斯 2 nrt
+怀玉山 17 nr
+怀王 4 nrt
+怀珠抱玉 3 nr
+怀珠韫玉 3 nr
+怀瑾握瑜 3 nr
+怀璧 3 ns
+怀璧其罪 5 i
+怀疑 2525 v
+怀疑对象 2 l
+怀疑心 3 l
+怀疑派 5 n
+怀疑者 14 n
+怀疑论 22 n
+怀疑论者 7 n
+怀疚 3 n
+怀真抱素 3 nr
+怀着 901 v
+怀着鬼胎 13 l
+怀素 24 n
+怀胎 54 n
+怀自免 2 l
+怀自危 2 nr
+怀药 17 n
+怀表 59 v
+怀规复 2 l
+怀质抱真 3 nr
+怀远 32 nr
+怀远县 21 ns
+怀远镇 11 nr
+怀道迷邦 3 nr
+怀里 1546 s
+怀金垂紫 3 nr
+怀金拖紫 3 nr
+怀铁 6 n
+怀银纡紫 3 nr
+怀阿拉 3 nr
+怀隼础 2 nr
+怀集 5 v
+怀集县 3 nr
+怀顺王 2 nr
+怀鬼胎 7 l
+怀麓堂 3 nr
+怀黄佩紫 3 nr
+怀黄握白 3 nr
+态 1666 n
+态函数 3 n
+态势 736 n
+态变量 3 n
+态射的核 3 n
+态度 5033 n
+态度强硬 3 n
+态度恶劣 3 n
+态度改变 3 n
+态度暧昧 3 nr
+态度理论 3 n
+态度生硬 3 n
+态度矜持 3 vn
+态度立场 3 n
+态度端正 3 n
+态度顽固 3 n
+怂 197 vg
+怂恿 188 v
+怃然 14 z
+怄 55 v
+怄气 45 v
+怅 49 a
+怅怅 3 a
+怅怅然 3 d
+怅恨 3 a
+怅惘 82 a
+怅惘若失 3 v
+怅望 3 a
+怅然 39 d
+怅然自失 3 i
+怅然若失 20 i
+怆 49 zg
+怆地呼天 3 z
+怆天呼地 3 z
+怆然泪下 3 n
+怆然涕下 3 i
+怈 15 zg
+怊 2 g
+怍 18 zg
+怎 6736 r
+怎不会 3 l
+怎个 3 r
+怎么 27339 r
+怎么办 117 l
+怎么回事 3 l
+怎么弄 3 l
+怎么得了 45 l
+怎么样 2332 r
+怎么着 216 r
+怎会 3 r
+怎办 3 l
+怎及 3 c
+怎地 1625 r
+怎奈 78 c
+怎好意思 3 l
+怎敢 3 l
+怎末 3 c
+怎样 7294 r
+怎样才能 3 l
+怎样治 3 l
+怎生 3 r
+怎知 3 l
+怎肯 3 c
+怎能不 3 l
+怎能说 3 l
+怎行 3 r
+怎见得 3 l
+怎解 3 l
+怎讲 3 c
+怏 10 z
+怏吓 3 i
+怏怏 79 z
+怏怏不乐 12 i
+怏怏不悦 3 i
+怏然 3 z
+怒 4653 vg
+怒不可遏 245 i
+怒之铁拳 3 i
+怒从心头起 6 i
+怒冰 3 z
+怒冲冲 34 z
+怒发 3 v
+怒发冲冠 25 i
+怒叱 11 v
+怒号 13 n
+怒吼 228 v
+怒吼声 9 n
+怒喝 130 v
+怒容 98 n
+怒容满面 3 i
+怒射 17 v
+怒山 3 ns
+怒形于色 17 i
+怒意 3 n
+怒放 48 v
+怒斥 100 v
+怒族 38 nz
+怒殴 3 v
+怒气 568 n
+怒气冲冲 106 i
+怒气冲天 36 i
+怒气填胸 3 i
+怒江 152 ns
+怒江傈僳族自治州 13 ns
+怒江大峡谷 4 ns
+怒江州 6 ns
+怒海争锋 3 n
+怒涛 188 n
+怒涛汹涌 3 i
+怒涛澎湃 3 i
+怒潮 161 n
+怒潮汹涌 3 i
+怒火 657 n
+怒火万丈 3 i
+怒火中烧 44 i
+怒火冲天 15 i
+怒猊渴骥 3 nr
+怒目 130 n
+怒目切齿 3 i
+怒目圆睁 16 i
+怒目横眉 3 i
+怒目相向 3 i
+怒目而视 88 i
+怒色 112 n
+怒视 38 v
+怒责 3 v
+怒马 3 ns
+怒骂 138 v
+怔 2697 zg
+怔住 142 v
+怔忡 59 n
+怔怔 3 v
+怕 11213 v
+怕不怕 3 a
+怕且 3 v
+怕丢面子 3 v
+怕事 27 a
+怕人 219 a
+怕冷 3 a
+怕只怕 3 v
+怕吃苦 3 n
+怕布哦啊 3 nr
+怕得罪人 3 a
+怕得要命 3 a
+怕怕 3 a
+怕死 171 a
+怕死贪生 3 z
+怕死鬼 11 n
+怕水 15 n
+怕热 3 a
+怕生 13 a
+怕疼 3 a
+怕痒 3 a
+怕痛怕痒 3 z
+怕硬欺软 3 z
+怕累 3 a
+怕羞 38 a
+怕老婆 3 n
+怕臊 3 a
+怕苦 3 a
+怕苦怕累 3 z
+怕错 3 a
+怕难为情 3 n
+怕风怯雨 3 vn
+怕鬼 3 n
+怕鬼有鬼 3 n
+怕麻烦 3 v
+怕黑 3 a
+怖 87 vg
+怗 5 zg
+怘 11 zg
+怙 22 g
+怙恃 3 i
+怙恩恃宠 3 i
+怙恶不悛 11 i
+怙才骄物 3 i
+怙终不悔 3 i
+怙终不悛 3 i
+怙过不悛 3 i
+怙顽不悛 3 i
+怛 60 zg
+怛然失色 3 z
+怜 345 v
+怜伶 3 i
+怜恤 6 v
+怜悯 317 v
+怜悯之心 3 i
+怜惜 291 v
+怜我怜卿 3 i
+怜才 6 v
+怜新厌旧 3 i
+怜新弃旧 3 i
+怜爱 88 v
+怜贫恤老 3 vn
+怜贫惜老 3 i
+怜贫惜贱 3 i
+怜贫敬老 3 i
+怜香惜玉 35 i
+思 2618 n
+思丁 2 n
+思不出位 3 l
+思之千里 3 i
+思乡 50 n
+思乡曲 3 n
+思乡病 3 n
+思亲 9 n
+思凡 4 nr
+思前思后 3 nr
+思前想后 92 l
+思力 3 n
+思华 3 nz
+思南 14 ns
+思南县 6 ns
+思南路 2 n
+思古 3 ns
+思召 2 v
+思园 2 n
+思域 3 n
+思如泉涌 3 i
+思如涌泉 3 nr
+思妇 7 n
+思妇病母 3 n
+思威 3 n
+思密达 3 nr
+思巴 8 n
+思弓 3 nz
+思归 3 v
+思归其雌 3 nr
+思归鸟 3 n
+思忆 3 n
+思忖 165 v
+思念 585 n
+思念亲人 3 n
+思念家乡 3 n
+思思 7 n
+思恋 8 v
+思悟 3 n
+思患预防 3 i
+思情 3 n
+思惑 3 v
+思惟 7 nr
+思想 15387 n
+思想丰富 3 l
+思想体系 3 l
+思想作风 3 l
+思想保守 3 l
+思想倾向 3 n
+思想僵化 3 l
+思想前卫 3 l
+思想动态 3 l
+思想包袱 3 n
+思想单纯 3 nr
+思想史 127 n
+思想品德 3 n
+思想堕落 3 i
+思想境界 3 n
+思想家 550 l
+思想库 17 n
+思想开放 3 l
+思想性 109 n
+思想意识 3 l
+思想感情 3 l
+思想懒汉 3 i
+思想战线 3 l
+思想斗争 3 l
+思想束缚 3 n
+思想汇报 3 n
+思想活跃 3 l
+思想混乱 3 i
+思想界 71 n
+思想素质 3 n
+思想者 20 n
+思想观念 3 n
+思想观点 3 n
+思想觉悟 3 l
+思想解放 138 l
+思想认识 3 l
+思想负担 3 l
+思想路线 3 l
+思想进步 3 l
+思想道德 3 n
+思想顾虑 3 i
+思慕 21 v
+思所逐之 3 i
+思政网 3 n
+思文 4 n
+思断义绝 3 i
+思新求变 3 i
+思无邪 3 i
+思旧 3 n
+思明 8 n
+思明区 3 n
+思春 3 nr
+思春期 3 nr
+思来 3 v
+思来想去 60 l
+思比 2 v
+思涌 4 v
+思润 2 n
+思深忧远 3 i
+思温 2 n
+思湍 2 n
+思源 19 n
+思潮 801 n
+思潮澎湃 3 i
+思潮起伏 80 l
+思献 3 n
+思理 3 n
+思琳 44 nrt
+思甜 7 nr
+思监 4 n
+思盖 3 n
+思科 269 n
+思科公司 22 n
+思科系统公司 17 n
+思索 853 n
+思绪 282 n
+思绪万千 15 i
+思维 2227 n
+思维习惯 3 n
+思维力 3 nr
+思维混乱 3 nz
+思维源 3 nr
+思维科学 3 l
+思维能力 3 n
+思维过程 3 l
+思罗普 22 nr
+思考 2216 v
+思考乐 3 nr
+思考力 5 n
+思考性 3 n
+思考者 8 n
+思考问题 3 n
+思考题 7 n
+思茅 28 n
+思茅县 3 ns
+思茅地区 9 ns
+思茅市 5 n
+思茅松 6 nr
+思虑 303 v
+思虑周详 3 i
+思蜀 2 n
+思议 5 n
+思谋 27 n
+思贝尔 3 nr
+思贤如渴 3 i
+思贤若渴 6 i
+思路 1627 n
+思路不清 3 l
+思路清晰 3 nr
+思路清楚 3 l
+思辨 100 v
+思辨性 14 n
+思辩 14 v
+思达 8 nz
+思迁 3 v
+思过 64 v
+思途 3 n
+思通 2 n
+思量 270 n
+思静 2 n
+思麦早 3 nr
+怞 3 zg
+怟 3 zg
+怠 398 ag
+怠于 3 v
+怠倦 3 a
+怠工 30 v
+怠忽 3 v
+怠忽职守 3 nr
+怠情 3 v
+怠惰 15 a
+怠惰因循 3 v
+怠慢 368 v
+怠慢心理 3 n
+怠散 3 v
+怠职 3 v
+怠驶 3 v
+怡 684 vg
+怡乐 2 nz
+怡保 7 nz
+怡养 2 v
+怡和 140 nz
+怡堂燕雀 3 i
+怡声下气 3 i
+怡志养神 3 nz
+怡性养神 3 nz
+怡悦 274 a
+怡情 9 a
+怡情养性 3 n
+怡情悦性 3 i
+怡情理性 3 n
+怡然 22 a
+怡然自乐 2 i
+怡然自得 25 i
+怡然自若 3 i
+怡目 3 n
+怡神 2 nz
+怡红 34 nz
+怡红院 60 nt
+怡颜悦色 3 i
+怡香院 2 nz
+怢 3 zg
+怣 5 zg
+急 11126 v
+急三火四 3 i
+急不及待 3 i
+急不可待 42 i
+急不可耐 41 i
+急不容缓 3 i
+急不择言 5 i
+急不择路 3 i
+急不择途 3 i
+急不暇择 16 l
+急中生智 50 i
+急事 192 n
+急于 857 d
+急于事功 2 i
+急于星火 3 i
+急于求成 153 i
+急人之困 3 i
+急人之难 15 i
+急人所急 3 i
+急件 24 n
+急你屎 3 n
+急便 3 d
+急促 407 a
+急促性 3 i
+急修 3 v
+急先锋 40 n
+急公好义 4 l
+急公好施 3 n
+急公近利 3 l
+急冲 3 z
+急冲而下 3 i
+急冻 3 v
+急冻鸟 3 n
+急切 422 a
+急切切 2 z
+急切需要 3 l
+急刹车 12 l
+急剧 834 d
+急剧下降 3 l
+急功 3 a
+急功之势 3 i
+急功好利 2 i
+急功近利 98 i
+急务 33 n
+急务在身 3 i
+急动 3 d
+急匆匆 204 z
+急危重症 2 l
+急变 15 v
+急口令 3 n
+急吏缓民 3 nr
+急呀 3 n
+急回特性 3 l
+急地 3 z
+急坏 3 v
+急处从宽 3 i
+急奏 3 n
+急奔 3 v
+急如星火 22 i
+急如风火 3 i
+急就章 15 i
+急巴巴 5 z
+急张拘诸 3 i
+急弯 11 v
+急待 67 v
+急忙 2165 d
+急忙忙 2 z
+急急 9 a
+急急匆匆 4 z
+急急如律令 10 i
+急急巴巴 3 z
+急急忙忙 156 z
+急急慌慌 3 z
+急性 950 n
+急性子 51 n
+急性期 3 n
+急性毒性 3 l
+急性病 35 n
+急性症状 3 i
+急性肾炎 3 n
+急情 3 n
+急惊风 7 i
+急慌慌 19 z
+急慢性 17 b
+急抓 3 v
+急拉 3 z
+急拍繁弦 3 i
+急救 287 v
+急救中心 3 l
+急救包 14 i
+急救员 3 n
+急救室 12 n
+急救法 3 i
+急救站 8 n
+急救箱 8 n
+急救药 4 i
+急救车 9 n
+急救部 2 n
+急敛暴征 3 nr
+急景凋年 3 i
+急景残年 3 i
+急景流年 3 n
+急智 15 a
+急杵捣心 3 i
+急板 3 n
+急案 3 n
+急步 3 d
+急死了 3 l
+急死人 3 n
+急死你 3 l
+急水溪 3 n
+急流 566 n
+急流勇进 5 i
+急流勇退 18 i
+急流险滩 3 n
+急湍 12 n
+急湍湍 3 nr
+急溜溜 3 z
+急滩 3 n
+急火 9 n
+急火功心 3 i
+急火攻心 3 i
+急火火 21 i
+急煎煎 8 z
+急煞 3 v
+急用 41 v
+急电 39 n
+急病 33 n
+急病让夷 3 n
+急症 26 n
+急症室 3 i
+急痛攻心 4 i
+急眼 12 d
+急竹繁丝 3 i
+急管繁弦 3 i
+急聘 3 v
+急脉缓受 3 i
+急脉缓灸 3 n
+急腹症 15 i
+急茬 3 n
+急茬儿 3 n
+急行 3 v
+急行军 41 n
+急袭 7 v
+急要 22 b
+急诊 71 v
+急诊处 3 n
+急诊室 49 n
+急诊病人 3 n
+急诊科 16 n
+急诊费 3 n
+急诊部 3 n
+急语 3 n
+急赤白脸 3 i
+急赶 3 v
+急起直追 10 i
+急躁 227 a
+急躁不安 3 z
+急躁情绪 3 v
+急转 102 v
+急转弯 20 i
+急转直下 46 i
+急运 3 n
+急进 39 v
+急进党 3 n
+急进派 3 n
+急迫 88 d
+急追 3 v
+急退 3 v
+急送 3 v
+急速 532 d
+急速走动 3 i
+急造 3 v
+急遽 45 a
+急降 3 v
+急难 44 d
+急难险重 9 i
+急需 523 n
+急需品 3 n
+急需处理 3 l
+急需解决 3 l
+急需资金 3 n
+急须 3 d
+急风 3 n
+急风暴雨 17 i
+急风骤雨 8 i
+急飞 17 v
+急驰 130 v
+急驰而去 3 i
+急驶 3 v
+急骤 66 n
+急骤层析 3 l
+急骤灭菌 3 l
+怦 62 o
+怦怦 416 o
+怦怦直跳 3 v
+怦然 20 z
+怦然动心 3 l
+怦然心动 67 l
+性 13847 n
+性与爱 3 n
+性丑闻 3 i
+性事 15 n
+性亢奋 3 i
+性交 29 n
+性交关系 3 n
+性交图 3 n
+性交时 3 n
+性交易 3 n
+性交痛 3 n
+性价比 109 n
+性休克 3 n
+性伙伴 9 n
+性传播 3 n
+性伤害 3 n
+性伴侣 3 n
+性体验 3 n
+性侵犯 3 n
+性保健 3 n
+性保健品 3 n
+性偏离 3 n
+性健康 9 n
+性关系 85 n
+性兴奋 23 n
+性具 3 n
+性冲动 3 n
+性冷淡 3 n
+性别 950 n
+性别差异 3 n
+性别歧视 3 l
+性别比 294 n
+性别结构 3 n
+性别角色 3 n
+性刺激 3 n
+性力派 8 n
+性功能 174 n
+性医学 3 n
+性压抑 3 n
+性反应 3 n
+性取向 3 n
+性变态 14 n
+性向 3 n
+性向测验 3 n
+性启蒙 3 l
+性周期 10 n
+性味 26 n
+性命 4207 n
+性命不保 3 n
+性命之忧 3 l
+性命交关 16 n
+性命关天 3 n
+性命攸关 3 i
+性和谐 3 i
+性善 3 n
+性善论 13 n
+性喜剧 3 n
+性器 26 n
+性器具 3 n
+性器官 66 n
+性困惑 3 n
+性地 3 n
+性奴隶 3 n
+性如烈火 3 i
+性姿势 3 n
+性媚 3 a
+性子 666 n
+性子宫 3 n
+性学 4 n
+性学家 3 n
+性尴尬 3 i
+性工作者 3 n
+性常识 3 n
+性幻想 3 n
+性征 3 n
+性心理 3 n
+性快感 3 n
+性态 18 n
+性急 223 a
+性急口快 3 i
+性急的人 3 n
+性恶 3 n
+性恶论 11 n
+性情 755 n
+性情中人 3 n
+性情大变 3 n
+性情平和 3 n
+性情急躁 3 i
+性情柔顺 3 i
+性情浮躁 3 l
+性情温和 3 n
+性情温柔 3 l
+性情温顺 3 i
+性情爽直 3 n
+性情豪放 3 l
+性情豪爽 3 i
+性惩罚 3 n
+性意识 3 n
+性感 240 n
+性感冒 3 n
+性感受 3 l
+性感图 3 n
+性感女 3 n
+性感女郎 3 n
+性感照 3 n
+性感美 3 n
+性成熟 90 n
+性手枪 3 n
+性技巧 3 n
+性挑逗 3 v
+性描写 3 n
+性支出 3 n
+性收费 3 n
+性敏感 3 n
+性教育片 3 n
+性文化节 3 n
+性文学 3 n
+性文物 3 n
+性无能 3 n
+性早熟 3 l
+性智 4 n
+性暴力 3 n
+性本善 3 n
+性本能 3 n
+性格 2521 n
+性格不合 3 n
+性格内向 3 n
+性格化 9 n
+性格外向 3 n
+性格学 3 n
+性格小生 3 n
+性格巨星 3 n
+性格开朗 3 n
+性格演员 3 n
+性格爽直 3 n
+性格特征 3 n
+性格特点 3 n
+性欲 242 n
+性欲强 3 n
+性欲望 3 n
+性比 15 n
+性比率 3 n
+性气 30 n
+性气体 14 n
+性气候 3 n
+性洁癖 3 n
+性派对 3 n
+性渴望 3 i
+性溃疡 3 n
+性满足 3 n
+性激素 144 n
+性灵 63 n
+性烈如火 3 i
+性焦虑 3 n
+性爱 192 n
+性爱图 3 n
+性爱城 3 n
+性爱宝典 3 n
+性爱床 3 n
+性爱抚 3 n
+性爱椅 3 n
+性爱片 3 n
+性爱网 3 n
+性爱观 3 a
+性犯罪 3 n
+性状 399 n
+性玩具 3 n
+性玩笑 3 v
+性理 3 n
+性生活 395 n
+性生理 3 n
+性用具 3 n
+性用品 3 n
+性疲劳 3 i
+性疾病 3 n
+性病 285 n
+性病变 3 n
+性病学 3 n
+性病科 3 n
+性皮炎 3 n
+性相 3 n
+性相近 3 n
+性知识 3 n
+性神经症 3 n
+性福 3 n
+性福网 3 n
+性科学 3 n
+性秘密 3 n
+性经历 3 n
+性经验 3 n
+性网站 3 n
+性肝炎 3 n
+性肺炎 3 n
+性能 3808 n
+性能优越 3 n
+性能参数 3 n
+性能指标 3 n
+性能比 3 n
+性能超群 3 i
+性能需求 3 n
+性腺 178 n
+性自慰 3 i
+性色 3 n
+性药物 3 n
+性虐 3 a
+性虐待 3 n
+性虐待狂 3 l
+性行 12 n
+性行为 141 n
+性衰弱 3 n
+性观念 3 n
+性解放 3 l
+性误区 3 n
+性诱惑 3 vn
+性调查 3 l
+性质 8018 n
+性贫血 3 n
+性贿赂 10 v
+性趣 3 n
+性道德 3 n
+性闻 3 n
+性障碍 3 n
+性需求 3 n
+性饥渴 3 i
+性骚扰 91 l
+性骨折 3 n
+性高潮 46 n
+怨 1394 v
+怨不得 87 i
+怨不得人 4 i
+怨仇 3 v
+怨偶 2 n
+怨入骨髓 3 i
+怨叹 3 v
+怨嗟 3 v
+怨声 12 n
+怨声四起 3 i
+怨声载道 51 i
+怨天 3 n
+怨天尤人 61 i
+怨天忧人 3 i
+怨天怨地 7 i
+怨女 9 n
+怨女旷夫 3 i
+怨妇 3 n
+怨家 15 n
+怨家债主 3 n
+怨尤 3 n
+怨屈 3 v
+怨念 3 n
+怨忿 3 i
+怨怅 3 d
+怨怒 14 v
+怨怪 3 v
+怨怼 20 v
+怨恨 285 v
+怨悔 3 v
+怨愤 66 n
+怨懑 3 n
+怨敌 3 n
+怨曲 2 n
+怨望 3 v
+怨毒 123 n
+怨气 183 n
+怨气冲天 3 i
+怨气满腹 3 i
+怨气连天 3 i
+怨艾 12 n
+怨苍天 3 i
+怨言 180 n
+怨言四起 3 i
+怨谤 3 v
+怨载 3 v
+怨鬼 3 n
+怩 10 x
+怪 6097 v
+怪不得 504 l
+怪不怪 3 l
+怪事 181 n
+怪事儿 3 n
+怪事咄咄 3 i
+怪事连篇 3 n
+怪人 239 n
+怪侠 3 n
+怪僻 45 a
+怪兽 141 n
+怪兽级 3 n
+怪力 3 n
+怪力乱神 9 i
+怪叫 77 v
+怪味 13 n
+怪哉 24 a
+怪圈 126 n
+怪声 50 n
+怪声怪气 19 i
+怪头怪脑 3 i
+怪客 3 n
+怪异 494 a
+怪异性 3 n
+怪形怪状 3 i
+怪念头 6 n
+怪态 5 n
+怪怨 3 n
+怪怪 3 d
+怪怪奇奇 3 i
+怪怪的 38 z
+怪我太 3 n
+怪手 3 n
+怪才 11 n
+怪招 78 n
+怪来怪去 3 l
+怪杰 18 n
+怪样 3 d
+怪模怪样 48 l
+怪气 3 n
+怪物 527 n
+怪现状 3 n
+怪现象 3 n
+怪球面 3 n
+怪病 3 n
+怪癖 24 n
+怪相 18 d
+怪石 101 n
+怪石嶙峋 9 l
+怪笑声 3 i
+怪罪 161 n
+怪胎 38 n
+怪脚 3 n
+怪腔怪调 3 l
+怪腥 3 a
+怪讶 3 a
+怪论 15 n
+怪话 50 n
+怪诞 90 a
+怪诞不经 3 l
+怪诞小说 3 l
+怪诞诡奇 3 i
+怪调 10 n
+怪谈 3 v
+怪谲 3 a
+怪象 11 n
+怪道人 5 n
+怪里怪气 5 z
+怪闻 3 n
+怪难吃 3 l
+怪雨 3 n
+怪雨盲风 3 n
+怪鱼 3 n
+怫 52 g
+怫然不悦 3 v
+怫然作色 3 vn
+怬 4 zg
+怭 2 zg
+怯 617 zg
+怯场 35 n
+怯声怯气 3 z
+怯头怯脑 3 z
+怯弱 29 a
+怯怯 85 z
+怯惧 3 a
+怯意 3 a
+怯懦 124 a
+怯生 3 n
+怯生怯气 3 z
+怯生生 42 z
+怯疑 3 a
+怯薛 41 n
+怯防勇战 3 n
+怯阵 5 n
+怱 7 zg
+怲 3 zg
+怳 3 zg
+怵 108 zg
+怵场 3 i
+怵头 3 i
+怵惕 3 i
+怵然 3 i
+怵目惊心 5 i
+怶 2 zg
+怹 2 zg
+总 23585 b
+总主教 3 n
+总主笔 3 n
+总之 1517 c
+总书记 1104 n
+总产 80 n
+总产值 2452 n
+总产量 1643 n
+总人口 3295 n
+总仓库 3 n
+总代理 38 n
+总以为 3 l
+总价 44 n
+总价值 176 l
+总任务 54 n
+总会 1216 n
+总会屋 5 n
+总会计师 3 n
+总体 2506 n
+总体值 3 n
+总体布局 3 n
+总体开发 3 l
+总体性 26 n
+总体战 14 n
+总体方案 3 n
+总体水平 3 n
+总体目标 3 n
+总体经济 3 n
+总体而言 42 c
+总体规划 3 n
+总体设计 3 n
+总供给 3 n
+总值 363 n
+总储量 3 n
+总公司 506 n
+总共 660 b
+总兵 887 n
+总兵力 3 n
+总册 3 n
+总冠军 3 n
+总决赛 118 n
+总分 349 n
+总分类帐 3 n
+总则 81 n
+总务 50 n
+总务主任 3 n
+总务人员 3 n
+总务厅 6 n
+总务司 3 n
+总务处 147 n
+总务科 3 n
+总务组 3 n
+总务组长 3 n
+总务部 13 n
+总务长 5 n
+总动员 335 n
+总医院 48 n
+总协定 34 n
+总危机 5 l
+总厂 135 n
+总参 197 n
+总参作战部 2 n
+总参谋 3 n
+总参谋部 139 n
+总参谋长 358 n
+总台 18 n
+总司 3 n
+总司令 1647 n
+总司令部 167 n
+总合 4 v
+总后 73 c
+总后勤部 96 j
+总后勤部卫生部 4 nt
+总后方 19 n
+总吨 3 n
+总吨位 51 n
+总和 583 n
+总和校验 3 n
+总商 3 n
+总商会 42 n
+总图 19 n
+总场 8 n
+总坛 3 n
+总堂 3 n
+总孔隙度 3 vn
+总寨 4 n
+总对 3 d
+总导演 3 n
+总局 479 n
+总局局长 3 n
+总工 53 n
+总工会 247 n
+总工期 3 n
+总工程师 383 n
+总师 44 n
+总帐 15 n
+总干事 3 n
+总序 9 n
+总库 9 n
+总应 3 n
+总店 28 n
+总府 5 n
+总府路 3 n
+总开关 3 n
+总开销 3 n
+总归 88 v
+总归一句 3 n
+总得 423 v
+总得分 3 d
+总得来说 3 l
+总怕 3 d
+总总林林 3 n
+总想 3 n
+总想找 3 v
+总成 290 v
+总成交 3 n
+总成本 3 n
+总成绩 143 n
+总户数 9 n
+总批发 3 n
+总投资额 3 n
+总括 39 v
+总括起来 3 n
+总持仓 3 n
+总指挥 386 n
+总指挥室 3 n
+总指挥部 43 n
+总控 3 j
+总揽 70 v
+总揽全局 3 l
+总揽大权 3 l
+总支 22 n
+总支出 21 n
+总支部 11 n
+总收入 171 n
+总攻 140 v
+总攻击 3 n
+总政 82 n
+总政治部 149 n
+总政治部干部部 2 n
+总教习 3 n
+总教头 10 n
+总教官 3 n
+总教练 3 n
+总数 2565 n
+总方针 43 n
+总星系 15 n
+总是 6089 c
+总有一天 3 l
+总服务台 3 n
+总机 20 n
+总枢纽 3 l
+总校 16 n
+总格 3 n
+总死亡率 3 n
+总段 3 n
+总比 3 j
+总比分 3 n
+总汇 42 n
+总流量 14 n
+总燃烧法 3 n
+总版主 3 n
+总状花序 95 l
+总理 8200 n
+总理大臣 3 n
+总理府 46 n
+总理衙门 3 n
+总瓢把子 3 l
+总甙 3 n
+总皂甙 3 n
+总的来看 37 c
+总的来讲 3 c
+总的来说 162 c
+总的看 11 l
+总的看来 20 l
+总的讲 4 c
+总的说 12 c
+总的说来 34 l
+总监 711 n
+总监制 3 j
+总监督 3 n
+总监部 12 j
+总目 71 n
+总目录 3 n
+总督 2447 n
+总督府 95 n
+总督署 4 n
+总社 86 n
+总称 535 n
+总站 70 n
+总章 3 n
+总算 1164 n
+总管 789 c
+总管家 3 n
+总索引 3 n
+总纂 3 v
+总纲 57 n
+总线 181 n
+总线结构 7 n
+总线网 3 n
+总经办 3 n
+总经济师 3 n
+总经理 1895 n
+总经理部 3 n
+总经销 3 n
+总经销商 3 n
+总结 3346 n
+总结会 11 n
+总结性 29 n
+总结报告 3 n
+总结暨 3 ns
+总结经验 3 n
+总统 6679 n
+总统令 13 n
+总统制 100 n
+总统大选 3 n
+总统套房 3 n
+总统客房 3 n
+总统府 408 n
+总编 77 n
+总编室 4 n
+总编辑 232 n
+总罢工 47 v
+总署 106 n
+总而言之 248 c
+总耗 3 n
+总能 244 n
+总舵 3 n
+总舵主 3 n
+总营业额 3 n
+总蒸发 3 n
+总行 102 n
+总表 3 n
+总裁 1812 n
+总裁兼 3 j
+总裁判 3 n
+总裁班 3 n
+总装 86 n
+总装厂 3 n
+总装备部 61 n
+总装机 6 n
+总装线 3 n
+总装配厂 3 n
+总要 3 b
+总览 3 n
+总觉 3 n
+总角 6 n
+总角之交 8 n
+总角之好 3 l
+总计 410 n
+总计有 3 b
+总论 48 n
+总论坛 3 n
+总评 13 n
+总评榜 3 n
+总该 3 v
+总该会 3 vn
+总该在 3 z
+总该是 3 v
+总该有 3 vn
+总该能 3 vn
+总谱 12 n
+总负责人 14 n
+总责 5 n
+总账 3 n
+总账会计 3 n
+总费用 3 n
+总资产 3 n
+总起来讲 3 l
+总起来说 7 l
+总趋势 3 n
+总路线 174 n
+总辖 3 v
+总辞 3 n
+总述 3 b
+总部 2024 n
+总重 3 n
+总重量 3 n
+总量 2510 n
+总金额 3 n
+总长 926 n
+总长度 3 n
+总阀 3 n
+总队 1216 n
+总队长 785 n
+总院 28 n
+总院治 3 n
+总集 118 n
+总需氧量 3 n
+总需求 3 n
+总面积 2679 n
+总预算 10 l
+总领事 162 n
+总领事馆 27 n
+总领队 3 n
+总领馆 32 n
+总额 3282 n
+总额收费 3 n
+总额近 3 n
+总鳍鱼 19 n
+怼 138 g
+怿 13 g
+恁 318 g
+恁地 3 u
+恁般 56 u
+恁长恁大 3 z
+恂 43 g
+恃 363 vg
+恃势欺人 3 i
+恃勇轻敌 3 i
+恃宠而骄 3 i
+恃强凌弱 16 i
+恃强欺弱 3 i
+恃才傲物 15 i
+恃才自傲 3 i
+恄 2 zg
+恅 13 zg
+恆 4 zg
+恇 9 zg
+恈 5 zg
+恉 2 zg
+恊 16 zg
+恋 539 v
+恋上你 3 n
+恋人 314 n
+恋人们 3 n
+恋家 6 n
+恋尸 3 n
+恋尸症 3 i
+恋尸癖 3 n
+恋念 3 n
+恋恋 3 v
+恋恋不舍 103 i
+恋恋难舍 3 i
+恋情 159 n
+恋慕 8 v
+恋战 84 v
+恋故 3 n
+恋新忘旧 3 i
+恋旧 19 v
+恋春 2 n
+恋曲 5 v
+恋栈 3 n
+恋栈不去 3 i
+恋歌 12 n
+恋母 3 n
+恋母情结 3 n
+恋火 3 v
+恋爱 848 v
+恋爱史 3 n
+恋爱婚姻 3 n
+恋爱观 13 i
+恋父 3 n
+恋物癖 3 n
+恋童症 3 n
+恋群 3 n
+恋酒贪杯 3 i
+恋酒贪花 3 i
+恋酒迷花 3 i
+恍 326 vg
+恍如 50 v
+恍如梦境 3 i
+恍如梦寐 3 i
+恍如融世 3 i
+恍如隔世 20 i
+恍忽 17 z
+恍恍忽忽 7 z
+恍恍惚惚 54 z
+恍恍荡荡 3 z
+恍悟 4 v
+恍惚 276 a
+恍惚之间 3 vn
+恍然 243 d
+恍然大悟 345 i
+恍然若失 3 i
+恍若 94 z
+恍若隔世 3 i
+恎 4 zg
+恐 1622 d
+恐为 3 d
+恐兽 3 n
+恐后争先 3 n
+恐后无凭 3 n
+恐吓 163 v
+恐吓信 17 n
+恐吓威胁 3 n
+恐吓性 3 n
+恐吓罪 3 n
+恐嚇 3 v
+恐怕 3355 d
+恐怖 1463 a
+恐怖主义 221 n
+恐怖事件 3 n
+恐怖份子 3 n
+恐怖分子 3 n
+恐怖感 4 n
+恐怖活动 3 n
+恐怖片 34 n
+恐怖电影 3 n
+恐怖症 38 n
+恐怖组织 3 n
+恐怖网 3 n
+恐怖行动 3 n
+恐怖袭击 3 n
+恐怖集团 3 n
+恐惧 1230 an
+恐惧心理 3 n
+恐惧感 48 n
+恐惧症 23 n
+恐惶 3 a
+恐慌 353 an
+恐慌万状 3 n
+恐慌性 3 n
+恐无 3 d
+恐是 3 d
+恐暗素 3 n
+恐水病 3 n
+恐胁 3 n
+恐角兽 3 n
+恐赫 3 a
+恐遭物议 3 nz
+恐防 3 d
+恐防有失 3 n
+恐难 3 an
+恐需 3 n
+恐非 3 d
+恐韩 3 n
+恐韩症 3 v
+恐高症 18 nz
+恐龙 299 nz
+恐龙兄弟 3 n
+恐龙危机 3 n
+恐龙岛 3 n
+恐龙蛋 7 n
+恐龙骨 3 n
+恒 606 nr
+恒业 38 n
+恒丰 2 nz
+恒丰路 3 nz
+恒久 32 a
+恒久不变 3 i
+恒久远 3 n
+恒产 28 j
+恒信 2 nz
+恒利 3 nz
+恒力 3 nz
+恒化器 3 nz
+恒化培养 3 n
+恒升 3 nz
+恒压 3 nz
+恒压器 3 nz
+恒压源 3 nz
+恒口 3 n
+恒同映射 3 n
+恒基 7 nz
+恒基伟业 3 i
+恒基托 3 nz
+恒安 7 nz
+恒定 210 nz
+恒定性 3 n
+恒定电流 3 n
+恒山 792 ns
+恒山区 3 ns
+恒常 3 a
+恒康 5 nz
+恒心 62 n
+恒情 3 n
+恒指 18 nz
+恒星 993 nz
+恒星日 3 nz
+恒星系 2 n
+恒春 20 nz
+恒春镇 2 ns
+恒曲 3 n
+恒曲县 3 ns
+恒毅 3 a
+恒毅中学 3 vn
+恒沙 3 nz
+恒河 244 nz
+恒河一沙 3 nz
+恒河平原 3 ns
+恒河沙 3 ns
+恒河沙数 4 n
+恒流源 3 n
+恒温 36 nz
+恒温动物 16 n
+恒温器 6 nz
+恒温室 3 nz
+恒温层 3 n
+恒温性 3 n
+恒温槽 3 nz
+恒温炉 3 nz
+恒温箱 2 nz
+恒湿器 3 nz
+恒源 28 nz
+恒源祥 2 nz
+恒牙 9 ns
+恒牙列 3 ns
+恒王 6 nz
+恒瑞 2 nz
+恒瑞医药 3 nz
+恒生 34 nz
+恒生指数 11 nz
+恒福路 3 ns
+恒等 3 a
+恒等式 33 n
+恒线速度 3 n
+恒言 3 n
+恒转 3 j
+恒远 3 nz
+恒通 13 nz
+恒速 4 nz
+恒量 14 n
+恒隆 50 nz
+恒齿 2 n
+恓 29 zg
+恔 3 zg
+恕 876 nr
+恕不从命 3 l
+恕不奉陪 11 l
+恕不接待 3 l
+恕不退还 3 v
+恕喝 3 v
+恕已及人 3 l
+恕已及物 3 l
+恕我直言 3 l
+恕罪 252 v
+恕道 3 v
+恕邀 3 v
+恕难 3 v
+恕难从命 3 l
+恕难苟同 3 l
+恙 19 n
+恙虫 9 n
+恚 182 g
+恛 4 zg
+恜 5 zg
+恞 2 zg
+恠 3 zg
+恢 547 zg
+恢复 7600 v
+恢复主权 3 n
+恢复健康 3 n
+恢复元气 3 n
+恢复冲量 3 n
+恢复力 20 n
+恢复原 3 n
+恢复原状 3 n
+恢复名誉 3 n
+恢复器 3 n
+恢复循环 3 n
+恢复性 35 n
+恢复期 26 t
+恢复模式 2 n
+恢复正常 15 b
+恢复电路 3 n
+恢复程序 4 n
+恢复系 3 v
+恢复系数 3 n
+恢复能力 3 n
+恢复蛋白 3 n
+恢复过来 3 v
+恢宏 72 a
+恢宏博大 2 nz
+恢宏壮观 3 v
+恢宏大度 3 vn
+恢宏率意 3 nz
+恢廓 3 n
+恢廓大度 3 vn
+恢弘 35 a
+恢恑憰怪 3 v
+恢恢有余 3 vn
+恢诡谲怪 3 z
+恣 97 zg
+恣凶稔恶 3 vn
+恣心纵欲 3 i
+恣情 3 d
+恣情纵欲 2 i
+恣意 79 d
+恣意妄为 6 i
+恣意妄行 3 i
+恣无忌惮 3 i
+恣横 3 v
+恣睢 4 v
+恣睢无忌 3 nr
+恣纵 3 v
+恣肆 77 d
+恣肆无忌 3 i
+恣肆汪洋 2 i
+恣行无忌 3 i
+恤 211 zg
+恤孤 3 n
+恤民 3 n
+恤老怜贫 3 n
+恤衫 29 n
+恤贫 3 n
+恤迫忽远 3 z
+恤金 2 n
+恥 3 zg
+恦 2 zg
+恧 5 g
+恨 4139 v
+恨不得 619 d
+恨不相逢 3 i
+恨不能 3 d
+恨之入骨 83 i
+恨事 42 n
+恨交织 2 n
+恨人家 2 i
+恨入骨髓 4 i
+恨声 3 d
+恨如头醋 3 i
+恨宝玉 3 nr
+恨少 3 d
+恨怨 11 v
+恨恶 2 nr
+恨意 11 d
+恨意全消 3 nr
+恨意尽消 3 nr
+恨意未消 3 nr
+恨意难消 3 nr
+恨我跑位 3 i
+恨来恨去 3 i
+恨死 57 d
+恨海难填 3 i
+恨相知晚 3 i
+恨相见晚 3 i
+恨起来 3 i
+恨透 3 v
+恨透了 3 i
+恨金莲 2 nr
+恨铁不成钢 18 i
+恩 3475 nr
+恩不放债 3 n
+恩东 6 ns
+恩主 3 n
+恩主公 3 nr
+恩义 54 n
+恩人 249 nrt
+恩仇 57 nr
+恩仇录 3 nr
+恩仇记 3 nr
+恩克 6 nrt
+恩克鲁玛 3 nrt
+恩公 188 nr
+恩典 151 ns
+恩典如山 3 nr
+恩冈代雷 5 nrt
+恩准 58 n
+恩加拉 3 nrt
+恩古巴尼 3 nrt
+恩同再造 2 nr
+恩同山岳 3 nr
+恩同父母 3 nr
+恩哈德 4 nrt
+恩图曼 2 nr
+恩多拉 9 nrt
+恩奎斯特 2 nrt
+恩威并施 3 i
+恩威并用 3 n
+恩威并著 3 nr
+恩威并行 3 i
+恩娟 109 nrt
+恩宠 64 nr
+恩将仇报 50 i
+恩山义海 3 ns
+恩师 428 nr
+恩平 4 nr
+恩平县 3 ns
+恩平市 2 ns
+恩德 188 nrt
+恩德培 9 nr
+恩德如山 3 nr
+恩怨 176 n
+恩怨分明 3 i
+恩怨情天 3 i
+恩恩不 3 i
+恩恩怨怨 31 i
+恩恩爱爱 9 nr
+恩恩相报 3 nr
+恩情 139 n
+恩惠 110 nr
+恩惠深重 3 nr
+恩断义绝 14 i
+恩斯 11 nrt
+恩斯特 13 nrt
+恩施 1861 n
+恩施土家族苗族自治州 772 ns
+恩施州 522 nr
+恩施市 1037 ns
+恩有重报 3 n
+恩来 27 nrt
+恩格 29 nrt
+恩格勒 11 nr
+恩格尔 11 nr
+恩格尔哈德 2 nrt
+恩格尔曼 3 nrt
+恩格尔系数 11 nz
+恩格斯 384 nr
+恩波利 3 nr
+恩波里 3 nrt
+恩泽 57 nr
+恩泽深厚 3 nr
+恩济庄 5 nr
+恩深义重 3 i
+恩爱 139 nr
+恩爱夫妻 3 nr
+恩爱情深 3 nr
+恩爱有加 3 nr
+恩特斯 3 nr
+恩特雷里奥斯省 2 nrt
+恩甚怨生 3 i
+恩米 17 nrt
+恩若再生 3 nr
+恩荣并济 3 i
+恩莱科 3 nr
+恩菲尔德 5 nrt
+恩贾梅纳 12 nr
+恩赐 114 nr
+恩赐者 3 nr
+恩赖特 3 nrt
+恩逾慈母 3 i
+恩里克 9 nrt
+恩里科 3 nrt
+恩重如山 45 i
+恩重泰山 3 nr
+恪 309 v
+恪守 215 v
+恪守不渝 3 l
+恪守成宪 3 l
+恪尽 5 v
+恪尽职守 18 l
+恪尽职责 3 l
+恫 36 vn
+恫吓 73 vn
+恫喝 3 vn
+恫疑虚喝 3 nr
+恫疑虚猲 3 z
+恫瘝 3 vn
+恫瘝在抱 3 v
+恬 61 zg
+恬不为怪 3 i
+恬不为意 3 i
+恬不知怪 3 i
+恬不知愧 3 i
+恬不知羞 3 i
+恬不知耻 24 i
+恬和 3 a
+恬淡 35 a
+恬淡寡欲 3 i
+恬淡无为 3 i
+恬淡无欲 3 i
+恬然 7 a
+恬然自足 3 i
+恬美 6 a
+恬言柔舌 3 i
+恬谧 3 a
+恬适 23 a
+恬静 62 a
+恭 1176 ag
+恭亲王 81 n
+恭从 3 v
+恭候 276 n
+恭候光临 3 n
+恭候大驾 3 n
+恭听 3 v
+恭喜 306 a
+恭喜发财 12 l
+恭城 30 ns
+恭城县 4 ns
+恭城瑶族自治县 4 ns
+恭奉 3 v
+恭恭 3 a
+恭恭敬敬 427 z
+恭敬 600 a
+恭敬不如从命 13 i
+恭敬地 3 z
+恭敬桑梓 3 ns
+恭桶 3 n
+恭王府 35 l
+恭硕良 3 ns
+恭祝 54 v
+恭禧 3 n
+恭维 171 n
+恭维话 15 l
+恭而有礼 3 i
+恭行天罚 3 n
+恭请 95 v
+恭读 3 v
+恭谒 3 v
+恭谨 138 a
+恭贺 64 v
+恭贺新喜 3 l
+恭贺新禧 3 l
+恭迎 94 v
+恭送 3 v
+恭逢其盛 3 i
+恭顺 88 a
+恭默守静 3 i
+息 1538 zg
+息事 3 n
+息事宁人 38 n
+息交绝游 3 i
+息兵 3 n
+息县 12 ns
+息壤 3 n
+息大娘 3 n
+息差 9 n
+息影 22 n
+息怒 143 v
+息怒停瞋 3 n
+息息攸关 3 i
+息息相关 396 i
+息息相通 16 i
+息战 3 n
+息斯敏 5 ns
+息止 3 v
+息火 3 n
+息灯 3 n
+息烽 8 ns
+息烽县 10 ns
+息率 18 n
+息眉 3 n
+息票 5 n
+息肉 102 n
+息肩 3 n
+息讼 3 n
+息诉 3 v
+息谤 3 v
+息迹静处 3 i
+息钱 3 n
+恰 981 d
+恰似 162 a
+恰值 3 v
+恰克 2 ns
+恰克图 37 nr
+恰克玛族 3 nr
+恰切 19 a
+恰到好处 197 i
+恰合时宜 3 i
+恰在此时 3 i
+恰好 1396 d
+恰好相反 3 i
+恰如 126 c
+恰如其分 76 i
+恰州 3 ns
+恰巧 195 d
+恰巧是 3 i
+恰帕斯 4 nrt
+恰帕斯州 17 ns
+恰当 780 d
+恰恰 1023 d
+恰恰好 3 nr
+恰恰相反 249 c
+恰恰舞 3 nr
+恰达耶夫 2 nrt
+恰逢 58 v
+恰遇 3 v
+恲 13 zg
+恳 361 zg
+恳亲会 3 n
+恳切 164 a
+恳切地 3 n
+恳托 3 v
+恳挚 15 a
+恳望 3 v
+恳求 322 v
+恳请 71 v
+恳谈 5 v
+恳谈会 15 n
+恳辞 3 v
+恴 3 zg
+恵 5 zg
+恶 3136 a
+恶不去善 3 i
+恶业 3 n
+恶之花 3 i
+恶习 114 v
+恶习不改 3 i
+恶事 3 n
+恶人 594 n
+恶人先 3 l
+恶人先告状 3 i
+恶人政治 3 l
+恶人谷 3 n
+恶仗 19 n
+恶作剧 134 n
+恶作剧者 3 n
+恶例 3 n
+恶俗 14 a
+恶兆 4 n
+恶劣 1009 a
+恶劣影响 3 l
+恶劣性 3 l
+恶劣手段 3 l
+恶劣状态 3 l
+恶劣行径 3 l
+恶劣表现 3 l
+恶势力 3 i
+恶化 743 v
+恶化趋势 3 l
+恶化顷向 3 vn
+恶叉白赖 3 n
+恶变 39 v
+恶口伤人 3 n
+恶名 97 a
+恶名昭彰 3 i
+恶向胆边生 14 i
+恶因 3 n
+恶声 3 n
+恶声恶气 5 i
+恶妇 38 n
+恶婆 3 n
+恶客 3 n
+恶寒 3 b
+恶小而 3 l
+恶少 25 v
+恶尘无染 3 i
+恶居下流 3 i
+恶形 3 n
+恶形恶状 3 i
+恶徒 56 n
+恶德 33 n
+恶心 696 n
+恶心感 3 n
+恶念 42 n
+恶性 463 n
+恶性不改 3 l
+恶性事件 3 l
+恶性事故 3 l
+恶性倒闭 3 v
+恶性循环 134 i
+恶性案件 3 l
+恶性疟 5 n
+恶性瘤 3 l
+恶性竞争 3 l
+恶性肿瘤 227 l
+恶性膨胀 3 l
+恶性补习 3 v
+恶恶从短 3 i
+恶意 359 v
+恶意中伤 3 l
+恶意代码 3 l
+恶意毁谤 3 n
+恶意程序 3 l
+恶意软件 6 l
+恶意透支 3 n
+恶感 18 a
+恶战 169 v
+恶报 8 n
+恶搞 3 a
+恶政 3 n
+恶斗 254 n
+恶有善报 3 i
+恶有恶报 19 i
+恶极 3 n
+恶果 120 n
+恶根 3 n
+恶梦 72 n
+恶梦初醒 3 i
+恶棍 57 n
+恶棍歹徒 3 i
+恶毒 285 n
+恶毒地 3 l
+恶毒攻击 3 i
+恶气 130 n
+恶汉 3 n
+恶浊 4 a
+恶浪 17 n
+恶湿居下 3 l
+恶煞 4 v
+恶犬 3 n
+恶狗 62 n
+恶狠 3 z
+恶狠狠 256 z
+恶狼 3 n
+恶狼传说 3 l
+恶疮 8 n
+恶疾 22 n
+恶病质 3 n
+恶癖 3 n
+恶直丑正 3 i
+恶相 3 n
+恶神 3 n
+恶积祸盈 3 l
+恶籍盈指 3 n
+恶紫夺朱 3 n
+恶终 3 d
+恶耗 3 n
+恶臭 130 a
+恶臭味 3 i
+恶臭性 3 n
+恶臭物 3 l
+恶虎扑食 3 i
+恶行 183 v
+恶衣恶食 3 i
+恶衣粝食 3 vn
+恶衣菲食 3 i
+恶衣蔬食 3 i
+恶补 9 b
+恶言 81 n
+恶言厉色 3 i
+恶言恶语 3 i
+恶言相向 3 i
+恶言詈辞 3 vn
+恶计 5 v
+恶语 34 n
+恶语中伤 2 l
+恶语伤人 3 n
+恶语相加 3 l
+恶语相向 7 i
+恶质 3 n
+恶质化 3 n
+恶贯已盈 3 i
+恶贯满盈 55 i
+恶贯潢盈 3 l
+恶贼 241 n
+恶趣味 3 i
+恶运 3 n
+恶迹 3 n
+恶迹昭着 3 i
+恶迹昭著 3 i
+恶逆非道 3 i
+恶醉强酒 3 i
+恶露 3 v
+恶霸 115 v
+恶霸地主 11 i
+恶霸成性 3 l
+恶风 3 n
+恶食 3 n
+恶骂 3 v
+恶鬼 259 n
+恶魔 158 n
+恶魔城 3 i
+恶魔岛 3 i
+恶龙 3 n
+恸 185 g
+恸哭 33 v
+恹恹 15 z
+恺 141 g
+恺切 3 nrt
+恺撒 3 nrt
+恺撒大帝 9 nrt
+恻 141 i
+恻怛之心 3 v
+恻然 3 v
+恻隐 10 v
+恻隐之心 200 i
+恼 996 zg
+恼乱 3 a
+恼人 30 a
+恼头 3 v
+恼怒 517 v
+恼恨 141 a
+恼火 237 v
+恼火起来 3 i
+恼羞 3 a
+恼羞变怒 3 i
+恼羞成怒 74 i
+恽 24 nr
+恽代英 43 nr
+恽寿平 6 nr
+恿 94 x
+悀 8 zg
+悁 3 zg
+悂 5 zg
+悃 22 zg
+悃愊无华 3 nz
+悄 415 d
+悄不言声 3 l
+悄声 334 d
+悄悄 1527 z
+悄悄儿 3 z
+悄悄地 577 z
+悄悄的 226 z
+悄悄话 45 n
+悄无声息 126 l
+悄然 334 d
+悄然兴起 3 l
+悄然无声 16 l
+悄然泪下 3 l
+悄然离去 3 l
+悄然而去 3 l
+悄语 3 n
+悅 8 zg
+悆 110 zg
+悇 97 zg
+悈 4 zg
+悉 718 ns
+悉力 3 d
+悉听 3 l
+悉听尊便 18 l
+悉尼 265 ns
+悉尼型 3 nz
+悉尼城 2 ns
+悉尼大学 10 nt
+悉尼奥运会 10 nz
+悉尼市 6 ns
+悉尼机场 5 ns
+悉尼歌剧院 12 nt
+悉尼港 9 ns
+悉尼湾 2 ns
+悉帅敝赋 3 l
+悉心 115 d
+悉心毕力 3 vn
+悉心照料 3 l
+悉心竭力 3 vn
+悉数 102 d
+悉数归公 3 l
+悉由 3 d
+悉皆 3 l
+悉窣 3 nz
+悉索敝赋 3 l
+悉索薄赋 3 l
+悊 215 zg
+悌 58 g
+悍 236 zg
+悍人 3 n
+悍兵 3 n
+悍勇 36 d
+悍匪 6 n
+悍妇 15 n
+悍妻 3 n
+悍将 42 d
+悍戾 3 a
+悍然 97 d
+悍然不顾 3 i
+悍然毁约 3 n
+悍药 3 n
+悍马车 3 n
+悎 87 zg
+悏 12 zg
+悐 12 zg
+悑 4 zg
+悒 7 z
+悒悒 2 z
+悒悒不乐 3 z
+悒悒不然 3 z
+悒然 3 z
+悒郁 8 z
+悒郁寡欢 3 vn
+悓 489 zg
+悔 739 vg
+悔不当初 6 i
+悔之不及 6 i
+悔之已晚 3 i
+悔之无及 13 i
+悔之晚矣 27 i
+悔之莫及 3 i
+悔人不倦 3 i
+悔其少作 3 i
+悔婚 3 v
+悔恨 123 v
+悔恨交加 3 i
+悔悟 42 v
+悔悟之意 3 n
+悔意 3 v
+悔改 62 v
+悔棋 3 v
+悔气 3 v
+悔罪 27 v
+悔罪者 3 n
+悔罪自新 3 i
+悔蔑 3 v
+悔读南华 3 i
+悔过 34 v
+悔过书 12 i
+悔过自新 14 i
+悔过自责 3 i
+悕 123 zg
+悖 307 vg
+悖乱 3 n
+悖入悖出 3 v
+悖晦 3 a
+悖理 3 n
+悖礼 3 n
+悖言乱辞 3 n
+悖论 236 n
+悖谬 9 a
+悖逆 8 n
+悖逆不轨 3 n
+悗 425 zg
+悘 4 zg
+悙 8 zg
+悚 85 g
+悚惧 33 a
+悚然 3 a
+悛 4 g
+悜 219 zg
+悝 4 g
+悟 1095 v
+悟入 3 v
+悟出 105 v
+悟出来 3 v
+悟力 3 n
+悟彻 4 v
+悟性 111 n
+悟空 3 n
+悟道 36 v
+悠 123 a
+悠久 2461 a
+悠哉 3 a
+悠哉悠哉 3 l
+悠哉游哉 10 l
+悠忽 2 z
+悠忽之间 3 l
+悠忽忽 3 z
+悠悠 369 z
+悠悠万事 3 l
+悠悠岁月 3 l
+悠悠忽忽 13 z
+悠悠扬扬 7 z
+悠悠然 4 z
+悠悠的 24 z
+悠悠荡荡 5 z
+悠悠长夜 3 l
+悠悠闲闲 5 z
+悠扬 167 a
+悠明 3 a
+悠游 16 v
+悠游网 3 i
+悠游自在 4 i
+悠游自得 3 i
+悠然 124 z
+悠然自得 30 i
+悠着 3 a
+悠着点 3 l
+悠荡 5 z
+悠荡荡 3 z
+悠谬 3 a
+悠远 55 a
+悠长 100 z
+悠闲 221 z
+悠闲地 3 z
+悠闲自在 10 i
+悠闲自得 5 i
+悡 19 zg
+患 2058 zg
+患上 179 n
+患儿 100 n
+患处 35 n
+患得患失 55 i
+患感冒 3 n
+患有 339 v
+患病 313 n
+患病率 79 n
+患病者 7 n
+患者 3932 n
+患至呼天 3 i
+患苦 3 n
+患部 3 n
+患难 206 n
+患难与共 42 i
+患难之交 33 i
+患难夫妻 3 i
+患难见真情 6 i
+患麻疹 3 n
+患鼻疽病 3 vn
+悥 24 zg
+悦 289 nz
+悦乐 3 nz
+悦人 3 nz
+悦人耳目 3 ns
+悦己者 3 nz
+悦意 3 a
+悦服 3 a
+悦来 17 nz
+悦目 28 a
+悦目娱心 3 z
+悦目赏心 3 z
+悦耳 156 a
+悦达 4 nz
+悦达起亚 3 nz
+悦近来远 3 z
+悧 127 zg
+您 14737 zg
+您们 20 r
+您们好 3 l
+您好 112 l
+您慢 3 l
+您提 3 l
+您瞧 3 l
+您老 142 r
+悪 3 zg
+悫 5 ag
+悬 1868 v
+悬乎 5 v
+悬停 34 v
+悬兵束马 3 n
+悬冰川 3 n
+悬剑 3 n
+悬剑空垄 3 n
+悬厘 3 n
+悬吊 171 v
+悬吊管 3 i
+悬在空中 3 i
+悬垂 32 v
+悬壁 11 n
+悬壶 5 n
+悬壶济世 3 i
+悬壶问世 3 i
+悬头刺股 3 n
+悬岩 3 n
+悬崕峭壁 3 i
+悬崖 423 n
+悬崖勒马 46 i
+悬崖峭壁 75 i
+悬崖撒手 3 i
+悬崖绝壁 29 i
+悬崖转石 3 i
+悬巢鸟 3 n
+悬式 2 n
+悬心 3 n
+悬心吊胆 2 i
+悬念 277 n
+悬悬而望 3 i
+悬想 9 v
+悬拟 3 v
+悬挂 1977 v
+悬挂国旗 3 nz
+悬挂楼梯 3 nz
+悬挑 257 a
+悬揣 3 v
+悬旌万里 3 nz
+悬望 3 v
+悬枢 3 n
+悬架 3 n
+悬案 24 n
+悬梁 56 n
+悬梁刺股 5 n
+悬梁刺骨 3 i
+悬梁自尽 3 i
+悬梯 3 n
+悬棺 3 n
+悬榻留宾 3 n
+悬殊 629 a
+悬河 12 n
+悬河注水 3 i
+悬河注火 3 i
+悬河泻水 3 i
+悬河泻火 3 i
+悬浊液 19 n
+悬浮 215 v
+悬浮剂 3 n
+悬浮固体 3 n
+悬浮式 9 n
+悬浮液 11 n
+悬浮物 13 n
+悬液计 3 i
+悬灯结彩 6 i
+悬狟素飡 3 nz
+悬疑 22 v
+悬疑剧 3 n
+悬疑片 3 n
+悬疣附赘 3 nr
+悬石程书 3 n
+悬移质 9 n
+悬空 120 n
+悬空寺 42 n
+悬突 3 n
+悬索 18 v
+悬索桥 28 n
+悬绳器 3 n
+悬置 7 v
+悬而未决 50 i
+悬肘 3 v
+悬肘法 3 i
+悬肠挂肚 3 i
+悬胆鼻 3 i
+悬腕 7 n
+悬腕法 3 n
+悬臂 105 n
+悬臂桥 3 i
+悬臂梁 2 i
+悬若日月 3 i
+悬虑 3 v
+悬赏 72 v
+悬赏分 3 n
+悬赏缉拿 3 n
+悬车之岁 3 i
+悬车之年 3 i
+悬车告老 3 i
+悬车束马 3 n
+悬车致仕 3 i
+悬重 3 a
+悬钟 3 n
+悬钩子 11 n
+悬铃木 14 n
+悬铃树 3 n
+悬锁卡环 3 n
+悬门抉目 3 vn
+悬隔 3 v
+悬隔两地 3 i
+悬隔多年 3 i
+悬雍垂 2 n
+悬雍垂裂 3 n
+悬鞀建铎 3 n
+悬颅 3 n
+悬首 3 v
+悬驼就石 3 n
+悬鹑百结 3 nz
+悬鼓待椎 3 n
+悬鼗建铎 3 nr
+悬龟系鱼 3 n
+悭 14 a
+悭吝 21 a
+悮 2 zg
+悯 86 g
+悯惜 3 nr
+悯时病俗 3 i
+悰 24 zg
+悱 6 vg
+悱恻 3 a
+悱恻缠绵 3 z
+悲 797 n
+悲不自胜 8 i
+悲从中来 69 l
+悲伤 471 a
+悲伤地 3 n
+悲伤欲绝 2 i
+悲凄 17 a
+悲凉 152 a
+悲切 54 a
+悲切切 5 i
+悲剧 1044 n
+悲剧性 54 n
+悲剧感 2 n
+悲剧片 3 n
+悲剧重演 3 n
+悲号 3 n
+悲叹 35 a
+悲叹者 3 n
+悲呜 3 l
+悲咽 3 v
+悲哀 435 a
+悲哭 3 v
+悲啼 3 z
+悲喜 32 a
+悲喜交加 13 i
+悲喜交集 31 i
+悲喜剧 25 n
+悲嗟 3 v
+悲壮 354 a
+悲声载道 3 i
+悲天怜人 3 n
+悲天悯人 19 i
+悲怀 3 n
+悲怆 76 a
+悲怨 3 a
+悲恨 3 a
+悲恸 35 a
+悲恸不已 3 v
+悲悯 35 z
+悲悲切切 12 i
+悲悼 10 v
+悲情 3 n
+悲惨 566 a
+悲惨世界 3 i
+悲惨境遇 3 i
+悲惨惨 3 z
+悲惨生活 3 i
+悲惨遭遇 3 vn
+悲愁 17 a
+悲愁垂涕 3 i
+悲愤 485 a
+悲愤交加 3 i
+悲愤填膺 4 i
+悲愤填鹰 3 n
+悲愿 3 n
+悲戚 56 n
+悲欢 76 v
+悲欢离合 56 i
+悲歌 36 n
+悲歌击筑 3 l
+悲歌慷慨 6 i
+悲歌易水 3 i
+悲泣 25 v
+悲疚 3 a
+悲痛 552 a
+悲痛欲绝 46 i
+悲秋 9 n
+悲苦 103 an
+悲观 279 a
+悲观主义 11 n
+悲观主意 3 n
+悲观厌世 3 i
+悲观失望 20 i
+悲观派 3 n
+悲观者 9 n
+悲观论调 3 l
+悲诉 3 v
+悲辛 3 a
+悲酸 3 n
+悲风 10 n
+悲鸣 41 v
+悲鸣不已 3 i
+悳 9 zg
+悴 94 zg
+悵 2 zg
+悶 112 zg
+悷 9 zg
+悸 64 vn
+悸人心神 3 v
+悸动 17 vn
+悸慄 3 vn
+悹 4 zg
+悺 10 zg
+悻 19 d
+悻悻 121 d
+悻悻然 38 d
+悻然 3 d
+悼 111 zg
+悼亡 17 v
+悼唁 3 v
+悼心失图 3 n
+悼心疾首 3 n
+悼念 350 n
+悼惜 3 v
+悼文 3 n
+悼歌 3 n
+悼痛 3 n
+悼词 43 n
+悼辞 3 v
+悽 23 zg
+悾 10 zg
+悿 3 zg
+惀 82 zg
+惁 24 zg
+惂 105 zg
+惃 4 zg
+惄 4 zg
+情 8363 n
+情不可却 3 l
+情不自堪 3 i
+情不自已 3 i
+情不自禁 336 i
+情不自胜 3 i
+情丝 22 n
+情为民 3 n
+情义 85 n
+情义深重 3 i
+情之独钟 3 i
+情书 80 n
+情书大全 3 i
+情事 33 n
+情人 451 n
+情人卡 3 n
+情人楼 3 n
+情人眼里 3 l
+情人眼里出西施 9 i
+情人网 3 n
+情人节 95 n
+情人装 3 n
+情仇 10 n
+情份 3 n
+情伪 3 n
+情侣 196 n
+情侣卡 3 n
+情侣号 3 n
+情侣机 3 n
+情侣用品 3 n
+情侣装 2 n
+情信 3 n
+情债 3 n
+情况 32833 n
+情况不明 3 i
+情况严峻 3 i
+情况严重 27 i
+情况危急 3 i
+情况反常 3 i
+情况异常 3 i
+情况有变 3 i
+情况汇报 3 n
+情况紧急 3 l
+情况表 22 n
+情况通报 3 n
+情凄意切 3 i
+情分 85 n
+情势 609 n
+情势升高 3 n
+情势所迫 3 i
+情势所逼 3 i
+情势逆转 3 i
+情变 10 n
+情史 9 n
+情同一家 3 l
+情同手足 26 i
+情同骨肉 9 n
+情味 3 n
+情哥哥 8 n
+情商 56 n
+情圣 3 n
+情场 30 n
+情场失意 11 l
+情场老将 3 n
+情境 184 n
+情境测验 3 n
+情天孽海 3 i
+情夫 12 n
+情妇 65 n
+情孚意合 3 l
+情归何处 3 i
+情形 2621 n
+情志 87 n
+情怀 273 n
+情态 59 n
+情态词 3 n
+情态集 3 n
+情思 72 n
+情急 116 n
+情急之下 161 l
+情急智生 30 i
+情急生智 3 i
+情性 58 n
+情怯 3 a
+情恕理遣 3 vn
+情愁 3 n
+情意 275 n
+情意浓 3 l
+情意深厚 3 i
+情意深重 3 i
+情意相投 3 i
+情意笃深 3 n
+情意绵绵 25 l
+情意重 3 n
+情感 1612 n
+情感世界 3 n
+情感冲动 3 n
+情感化 3 n
+情感天地 3 n
+情感小说 3 l
+情感性 11 n
+情感故事 3 i
+情感日记 3 n
+情感淡漠 3 n
+情感游戏 3 n
+情感生活 3 n
+情感论坛 3 n
+情感话题 3 n
+情感高涨 3 l
+情愫 53 n
+情愿 488 n
+情投契合 3 n
+情投意合 46 i
+情投意忺 3 nz
+情投意洽 3 n
+情投谊合 3 n
+情报 1890 n
+情报中心 3 n
+情报人员 3 n
+情报仅 3 l
+情报体制 3 n
+情报侦察 3 n
+情报信息 3 n
+情报分析 3 l
+情报员 8 n
+情报处 10 n
+情报学 21 n
+情报官 8 n
+情报局 101 n
+情报局长 10 n
+情报工作 3 n
+情报库 3 n
+情报战 3 n
+情报所 8 n
+情报搜集 3 l
+情报服务 3 n
+情报机构 3 n
+情报来源 3 n
+情报检索 11 n
+情报活动 3 n
+情报源 2 n
+情报界 3 n
+情报研究 3 n
+情报站 6 n
+情报系统 3 n
+情报组织 3 n
+情报统计 3 n
+情报网 15 n
+情报网络 3 n
+情报署 8 n
+情报贮存 3 n
+情报资料 3 n
+情报部 9 n
+情报部门 3 n
+情操 314 n
+情敌 48 n
+情文并茂 3 i
+情景 1770 n
+情景交融 21 n
+情景剧 5 n
+情景喜剧 3 n
+情景模式 3 n
+情景记忆 3 n
+情有可原 43 i
+情有可愿 3 i
+情有独钟 60 i
+情未了 3 l
+情杀 7 n
+情欲 320 n
+情欲戏 3 l
+情歌 93 n
+情殇 2 n
+情比金坚 3 n
+情浓 3 nz
+情海 6 n
+情液 3 n
+情深 3 n
+情深一往 6 i
+情深义重 21 i
+情深似海 2 i
+情深友于 3 l
+情深如海 3 i
+情深意切 5 i
+情深意厚 3 i
+情深意浓 3 l
+情深意重 7 i
+情深意长 2 i
+情深潭水 3 i
+情深谊长 3 n
+情深骨肉 3 i
+情渎 3 v
+情爱 141 n
+情牵 3 v
+情状 231 n
+情理 195 n
+情理之中 109 l
+情理法 3 n
+情理难容 6 n
+情由 209 n
+情痴 14 n
+情真 3 n
+情真意切 40 i
+情真意挚 3 a
+情真意长 3 n
+情知 3 n
+情礼 3 n
+情礼兼到 3 l
+情种 16 n
+情窦 3 n
+情窦初开 22 i
+情笃意深 3 n
+情结 238 n
+情绪 3892 n
+情绪低沉 3 n
+情绪低落 3 n
+情绪化 35 n
+情绪反应 3 n
+情绪性 10 n
+情绪稳定 3 n
+情绪高涨 3 l
+情缘 62 n
+情网 14 n
+情至意尽 3 i
+情至意至 3 i
+情致 60 n
+情色 3 n
+情色图 3 n
+情色片 3 n
+情色电影 3 n
+情色网 3 n
+情节 1325 n
+情节严重 3 n
+情节剧 3 n
+情节性 11 n
+情节恶劣 3 n
+情苗 3 n
+情若手足 3 i
+情见乎言 3 i
+情见乎词 3 i
+情见乎辞 3 i
+情见于色 3 i
+情见力屈 3 i
+情见势屈 3 i
+情见埶竭 3 v
+情诗 30 n
+情话 57 n
+情话绵绵 3 l
+情调 332 n
+情谊 236 n
+情质 2 n
+情趣 346 n
+情趣内衣 3 n
+情趣用品 3 n
+情趣笑话 3 l
+情迷 3 n
+情逐事迁 3 i
+情逾骨肉 3 i
+情郎 93 n
+情重姜肱 3 n
+情长纸短 3 i
+情随事迁 3 i
+情非得以 3 i
+情非得已 7 l
+情面 56 n
+情面难却 3 l
+情韵 15 n
+情颠大圣 3 i
+惆 25 a
+惆怅 160 a
+惆然 3 a
+惇 94 zg
+惇厚 3 z
+惇惇 3 z
+惇朴 3 z
+惇睦 3 z
+惇笃 3 z
+惇诲 3 v
+惈 18 zg
+惉 181 zg
+惊 8417 v
+惊世 3 v
+惊世绝俗 3 i
+惊世震俗 3 i
+惊世骇俗 72 i
+惊世骇目 3 i
+惊为天人 6 i
+惊人 1321 a
+惊人之举 5 i
+惊倒 3 v
+惊动 611 a
+惊动大驾 3 n
+惊厥 102 v
+惊受 3 v
+惊变 3 v
+惊叫 483 v
+惊叫声 3 i
+惊叹 306 v
+惊叹不已 3 i
+惊叹号 26 i
+惊叹声 8 i
+惊吓 248 v
+惊吓过度 3 i
+惊呆 207 v
+惊呼 679 v
+惊呼其名 3 i
+惊喜 555 a
+惊喜万分 10 i
+惊喜不已 6 i
+惊喜交加 11 i
+惊喜交集 131 i
+惊喜价 3 i
+惊喜欲狂 3 i
+惊喜若狂 4 i
+惊堂木 21 i
+惊声 3 v
+惊天 39 t
+惊天动地 221 i
+惊天地 13 i
+惊天地泣鬼神 6 i
+惊天大 3 i
+惊奇 792 a
+惊奇不已 3 i
+惊师动众 3 i
+惊异 480 a
+惊异传奇 3 i
+惊弓 3 v
+惊弓之鸟 53 i
+惊弦之鸟 3 i
+惊心 58 a
+惊心丧魄 3 i
+惊心动魄 327 i
+惊心吊胆 3 i
+惊心吊魄 3 i
+惊心夺目 3 i
+惊心怵目 3 vn
+惊心悲魄 3 i
+惊心悼胆 3 n
+惊心惨目 3 i
+惊心掉胆 3 l
+惊心眩目 3 i
+惊心破胆 3 i
+惊心裂胆 3 i
+惊心褫魄 3 nr
+惊心骇目 3 i
+惊心骇瞩 3 i
+惊心骇神 3 i
+惊怕 3 a
+惊怖 33 a
+惊怪 3 a
+惊恐 438 a
+惊恐万分 3 i
+惊恐万状 17 i
+惊恐不安 17 i
+惊恐失色 3 i
+惊悉 25 v
+惊悚 20 a
+惊悚片 3 i
+惊悸 37 v
+惊惑 3 a
+惊惧 243 a
+惊惶 322 a
+惊惶万状 3 i
+惊惶不安 3 i
+惊惶失措 46 i
+惊惶失色 3 i
+惊惶无措 3 i
+惊愕 161 a
+惊愕失色 3 z
+惊愚骇俗 3 i
+惊愣 3 v
+惊慌 620 a
+惊慌失措 182 i
+惊慌失色 3 i
+惊慌无措 3 i
+惊戒 3 v
+惊才绝艳 2 i
+惊才风逸 3 i
+惊扰 100 v
+惊扰到 3 i
+惊服 3 a
+惊格天 3 i
+惊梦 17 v
+惊涛 26 n
+惊涛巨浪 3 i
+惊涛怒浪 3 i
+惊涛拍岸 3 i
+惊涛激越 3 i
+惊涛骇浪 102 i
+惊爆价 3 n
+惊猿脱兔 3 i
+惊疑 289 a
+惊皇失措 3 i
+惊神泣鬼 3 i
+惊神破胆 3 i
+惊羡 8 v
+惊群动众 3 i
+惊耳骇目 3 i
+惊艳 3 a
+惊蛇入草 3 i
+惊蛰 23 t
+惊蛰节 3 z
+惊蜇 3 n
+惊见 3 v
+惊见骇闻 3 i
+惊觉 180 a
+惊觉到 3 l
+惊讶 1197 a
+惊诧 283 a
+惊诧不已 18 l
+惊谎 3 v
+惊赞 3 v
+惊起 58 v
+惊起梁尘 3 i
+惊跑 3 v
+惊跳 12 v
+惊退 3 v
+惊避 3 v
+惊醒 582 a
+惊采绝艳 3 i
+惊闻 3 n
+惊险 183 a
+惊险万状 4 i
+惊险刺激 3 l
+惊险片 5 n
+惊雷 52 v
+惊风 44 v
+惊风怒涛 3 n
+惊风骇浪 3 i
+惊飞 30 v
+惊马 3 v
+惊驾 3 v
+惊骇 250 a
+惊骇不已 3 i
+惊魂 100 a
+惊魂丧魄 3 i
+惊魂动魄 3 i
+惊魂失魄 3 i
+惊魂夺魄 3 i
+惊魂摄魄 3 i
+惊魂未定 87 i
+惊魂落魄 3 i
+惊鸟 3 n
+惊鸿 40 n
+惊鸿一瞥 3 n
+惊鸿艳影 3 i
+惋 21 a
+惋伤 3 a
+惋叹 3 a
+惋惜 258 a
+惋愕 3 a
+惌 32 zg
+惎 3 zg
+惏 2 zg
+惐 3 zg
+惑 187 v
+惑世盗名 3 i
+惑世诬民 3 i
+惑乱 17 v
+惑乱人心 3 i
+惑众 3 v
+惓 5 zg
+惔 22 zg
+惕 83 g
+惕厉 3 nr
+惕惧 3 i
+惖 5 zg
+惘 37 z
+惘然 50 z
+惘然若失 5 i
+惙 3 zg
+惙怛伤悴 3 l
+惚 32 x
+惛 29 zg
+惜 526 nr
+惜乎 4 v
+惜别 32 v
+惜别会 3 nr
+惜力 3 nr
+惜命 2 v
+惜售 23 v
+惜墨如金 3 nr
+惜字 3 v
+惜字如金 4 i
+惜孤念寡 3 i
+惜客好义 3 nr
+惜惜 2 v
+惜指失掌 3 i
+惜物 3 nr
+惜玉怜香 5 nr
+惜福 3 nr
+惜老怜贫 3 nr
+惜薪胡同 3 nr
+惜败 9 v
+惜败于 4 v
+惜阴 3 nr
+惜香怜玉 3 nr
+惝 4 a
+惝恍 3 a
+惝恍迷离 3 nr
+惞 7 zg
+惟 972 b
+惟一 991 b
+惟以 3 c
+惟其 34 c
+惟利是命 3 i
+惟利是图 10 i
+惟利是求 3 i
+惟利是营 3 i
+惟利是视 3 i
+惟利是趋 3 i
+惟利是逐 3 v
+惟力是视 3 i
+惟口起羞 3 v
+惟命是从 9 i
+惟命是听 4 i
+惟妙惟肖 49 i
+惟它独尊 3 i
+惟心 3 v
+惟心论 3 i
+惟恐 303 v
+惟恐天下 3 i
+惟恐落后 3 i
+惟愿 3 v
+惟我独尊 13 i
+惟所欲为 3 i
+惟日不足 3 i
+惟日为岁 3 i
+惟有 562 b
+惟物 3 v
+惟物论 3 i
+惟独 182 d
+惟精惟一 2 i
+惟肖惟妙 3 i
+惠 763 nr
+惠七石 4 nr
+惠东 6 nr
+惠东县 2 ns
+惠临 3 nr
+惠予 3 nr
+惠以功 3 nr
+惠农 8 nr
+惠农区 3 ns
+惠农县 2 ns
+惠刘鲁 2 nr
+惠卖 2 v
+惠及 49 ns
+惠城区 3 ns
+惠大军 2 nr
+惠天赐 3 nr
+惠女神 2 nr
+惠姑娘 4 nr
+惠娟艳 3 z
+惠子 3 nr
+惠子知我 3 nr
+惠存 3 nr
+惠孟臣 2 nr
+惠宁王 2 nr
+惠安 24 nr
+惠安县 10 ns
+惠安女 13 nr
+惠安崇 2 nr
+惠宗图 2 nr
+惠宗至 3 nr
+惠寺华 2 nr
+惠将军 4 nr
+惠山 32 nr
+惠山区 3 ns
+惠岸行 3 nr
+惠州 104 ns
+惠州市 13 ns
+惠康才 3 nr
+惠康昭 2 nr
+惠德贝 2 nr
+惠我忠 16 nr
+惠文君 10 nr
+惠文王 13 nr
+惠斯勒 2 nr
+惠斯特 3 nr
+惠新东街 5 ns
+惠施 21 nr
+惠明寺 10 nr
+惠明茶 6 nr
+惠普 181 nr
+惠普公司 25 nt
+惠更斯 103 nr
+惠更斯源 3 nz
+惠来 8 nr
+惠来县 3 ns
+惠栋之 2 nr
+惠民 105 nr
+惠民县 3 ns
+惠民河 15 ns
+惠民药 3 nz
+惠水 6 nr
+惠水县 3 ns
+惠泉酒 2 nr
+惠济 8 nr
+惠济河 7 nr
+惠浴宇 34 nr
+惠灵顿 38 nr
+惠然之顾 3 i
+惠然肯来 3 nr
+惠特克 4 nr
+惠特妮 3 nr
+惠特尔 5 nr
+惠特尼 25 nr
+惠特尼山 5 ns
+惠特拉姆 2 nrt
+惠特曼 96 nr
+惠特林 14 nr
+惠率军 4 nr
+惠王死 2 nr
+惠生出 3 nr
+惠登相 13 nr
+惠皇后 6 nr
+惠禅师 3 nr
+惠统军 2 nr
+惠而不费 6 i
+惠而浦 3 nr
+惠能禅 2 nr
+惠良马 2 nr
+惠英嫂 57 nr
+惠英红 3 nr
+惠蒂尔 3 nr
+惠赐 3 nr
+惠赐一票 3 nr
+惠远城 5 nr
+惠通桥 4 nr
+惠鉴 3 nr
+惠阳 28 nr
+惠阳区 3 ns
+惠阳县 3 ns
+惠顾 2 nr
+惠风和畅 2 nr
+惠风节 6 nr
+惠骑射 2 nr
+惡 6 zg
+惢 7 zg
+惣 17 zg
+惤 89 zg
+惥 14 zg
+惦 73 v
+惦心 3 v
+惦念 55 v
+惦念着 3 v
+惦怀 3 v
+惦挂 3 v
+惦挂着 3 v
+惦着 3 v
+惦记 271 v
+惦记着 3 v
+惧 1434 v
+惧于 3 v
+惧内 12 n
+惧怕 426 v
+惧怯 19 a
+惧惊 3 v
+惧色 83 n
+惧高 3 v
+惧高症 3 n
+惨 1171 a
+惨不忍睹 67 i
+惨不忍言 3 i
+惨不忍闻 6 i
+惨事 3 n
+惨伤 3 a
+惨兮兮 3 z
+惨况 3 n
+惨剧 77 n
+惨历 3 n
+惨厉 3 a
+惨变 18 v
+惨叫 234 v
+惨叫声 43 n
+惨嗥 3 n
+惨境 2 n
+惨壮 3 a
+惨无人理 3 i
+惨无人道 21 i
+惨无天日 3 i
+惨景 9 n
+惨杀 18 v
+惨案 1004 n
+惨死 159 v
+惨死轮下 3 i
+惨毒 5 n
+惨淡 111 z
+惨淡经营 35 i
+惨澹经营 3 v
+惨烈 215 a
+惨然 136 z
+惨然不乐 3 i
+惨状 130 n
+惨狱 3 n
+惨痛 173 a
+惨痛教训 3 n
+惨白 328 z
+惨相 3 n
+惨祸 41 n
+惨笑 18 v
+惨绝人寡 3 i
+惨绝人寰 49 i
+惨绿少年 3 n
+惨绿年华 3 i
+惨绿愁红 3 i
+惨苦 3 a
+惨象 148 n
+惨败 315 v
+惨跌 3 v
+惨遭 281 v
+惨遭劫难 3 nr
+惨遭杀害 3 v
+惨遭横祸 3 v
+惨遭毒害 3 v
+惨遭毒手 3 v
+惨酷 3 a
+惨重 546 a
+惨雨酸风 3 n
+惩 232 v
+惩一儆百 3 i
+惩一戒百 3 i
+惩一警百 3 l
+惩前 3 v
+惩前毖后 36 i
+惩办 267 v
+惩处 253 v
+惩忿窒欲 3 v
+惩恶 3 v
+惩恶劝善 3 v
+惩恶扬善 8 i
+惩戒 116 vn
+惩治 274 v
+惩治腐败 3 l
+惩罚 1145 vn
+惩罚性 47 n
+惩罚者 3 n
+惩罪 3 v
+惪 2 zg
+惫 64 zg
+惫懒 46 a
+惬 14 zg
+惬当 3 a
+惬心贵当 3 z
+惬怀 3 a
+惬意 298 a
+惭 143 a
+惭凫企鹤 3 nz
+惭愧 682 a
+惭色 3 a
+惮 45 vg
+惮赫千里 3 q
+惯 1168 v
+惯上 3 n
+惯下 3 n
+惯于 80 v
+惯于怀疑 3 z
+惯于欺骗 3 vn
+惯住 3 v
+惯例 630 n
+惯偷 3 d
+惯匪 6 n
+惯唱 3 n
+惯坏 3 v
+惯家 3 n
+惯常 112 d
+惯得 3 v
+惯性 592 n
+惯性作用 3 n
+惯性力 49 n
+惯性定律 3 n
+惯性导航 3 n
+惯性矩 3 n
+惯性群 3 n
+惯性质量 3 n
+惯想 3 n
+惯打 3 n
+惯技 4 n
+惯拍 3 n
+惯排 3 v
+惯摆 3 n
+惯洗 3 v
+惯派 3 n
+惯溺 3 v
+惯点 3 n
+惯犯 7 n
+惯用 127 n
+惯用名 3 n
+惯用手法 3 n
+惯用语 4 n
+惯盗 2 n
+惯称 3 n
+惯窃 3 v
+惯窍 3 n
+惯答 3 v
+惯纵 3 v
+惯罚 3 n
+惯要 3 d
+惯讲 3 v
+惯读 3 v
+惯贼 3 n
+惯跑 3 v
+惯量 34 n
+惯量主轴 3 n
+惯量张量 3 n
+惯量椭球 3 vn
+惯量积 3 n
+惯防 3 n
+惯食 3 n
+惯驶 3 v
+惯骑 3 n
+惯骗 3 v
+惰 283 zg
+惰性 108 n
+惰性元素 2 n
+惰性填料 3 n
+惰性气体 54 n
+惰性电极 3 n
+惲 5 zg
+想 61904 v
+想一想 3 i
+想不出 3 v
+想不到 1148 l
+想不开 32 v
+想不起 3 v
+想不起来 3 l
+想不通 3 l
+想个办法 3 l
+想个方法 3 l
+想为 3 v
+想也不想 3 l
+想也别想 3 l
+想买 3 v
+想了个 3 n
+想了又想 3 l
+想住 3 v
+想做到 3 v
+想像 550 v
+想像中 3 l
+想像出 3 l
+想像出来 3 l
+想像到 3 l
+想像力 48 n
+想像得到 3 l
+想像成 3 l
+想入 3 v
+想入非非 41 i
+想出 3 v
+想到 5735 v
+想前顾后 3 l
+想去 3 v
+想受 3 v
+想变 3 v
+想吸 3 v
+想头 16 v
+想学 3 n
+想定 58 v
+想定作业 3 l
+想将来 3 l
+想尽 118 v
+想尽办法 3 l
+想尽方法 3 l
+想干什么 3 l
+想开 29 v
+想当初 62 l
+想当年 134 l
+想当然 67 l
+想录 3 v
+想得到 189 v
+想得开 17 v
+想得美 3 v
+想得起来 3 l
+想必 857 d
+想念 317 v
+想念起 3 v
+想想 1494 v
+想想也是 39 l
+想想看 3 l
+想成 3 v
+想报 3 v
+想接 3 v
+想方设法 245 i
+想方设计 3 i
+想有 3 v
+想望 31 v
+想望丰采 3 i
+想望风褱 3 n
+想望风采 3 i
+想来 824 v
+想来想去 3 l
+想死 3 v
+想法 2558 v
+想法子 3 l
+想用 3 v
+想瘦 3 n
+想着 2808 v
+想编 3 v
+想装 3 v
+想要 2032 v
+想见 249 v
+想认 3 v
+想说出 3 v
+想说爱 3 l
+想象 2330 n
+想象力 227 n
+想象性 3 n
+想象表象 3 n
+想走到 3 l
+想走去 3 l
+想走来 3 l
+想走过 3 l
+想起 5118 v
+想载 3 v
+想过着 3 l
+想进 3 v
+想送 3 v
+想透 3 v
+想都不想 3 i
+想都别想 3 n
+想错 3 v
+想除 3 v
+想靠 3 v
+惴 90 i
+惴恐 3 i
+惴惴 89 z
+惴惴不安 101 i
+惴惴的 5 z
+惴慄 3 z
+惶 324 a
+惶急 157 a
+惶恐 322 a
+惶恐不安 40 i
+惶恐不已 3 i
+惶恐状 3 i
+惶悚 18 a
+惶悸 3 i
+惶惑 142 a
+惶惧 22 a
+惶惶 42 a
+惶惶不可 3 i
+惶惶不可终日 42 i
+惶惶不安 33 i
+惶惶无主 3 i
+惶惶然 18 z
+惶扰 3 i
+惶然 3 z
+惶遽 3 a
+惸 2 zg
+惹 1607 v
+惹上身 3 i
+惹下 3 v
+惹不起 40 l
+惹乱子 2 l
+惹事 100 v
+惹事招非 3 i
+惹事生非 47 i
+惹人厌 3 i
+惹人嫌 3 l
+惹人注意 3 i
+惹人注目 19 i
+惹人烦 3 l
+惹人爱 3 l
+惹人眼 3 l
+惹人讨厌 3 i
+惹出 3 v
+惹出来 3 l
+惹出祸殃 3 i
+惹怒 3 v
+惹急 3 a
+惹恼 83 a
+惹是招非 3 i
+惹是生非 36 l
+惹是非 8 l
+惹来 3 v
+惹气 13 v
+惹火 21 v
+惹火烧身 7 i
+惹灾招祸 3 i
+惹眼 37 v
+惹祸 84 v
+惹祸上身 3 i
+惹祸招殃 3 i
+惹祸招灾 3 i
+惹草拈花 3 i
+惹草沾花 3 i
+惹起 3 v
+惹起来 3 l
+惹麻烦 51 l
+惺 462 l
+惺忪 20 a
+惺惺 3 z
+惺惺作态 8 l
+惺惺惜惺惺 10 i
+惺惺相惜 38 i
+惺松 6 a
+惽 10 zg
+愀 28 x
+愀然不乐 3 z
+愀然变色 3 v
+愀然无乐 3 nz
+愁 1179 v
+愁云 47 n
+愁云惨淡 3 i
+愁云惨雾 15 i
+愁城 3 n
+愁多夜长 3 i
+愁容 55 n
+愁容满面 6 i
+愁山闷海 3 i
+愁怀 3 n
+愁思 25 n
+愁悒 3 a
+愁感 3 a
+愁楚 3 a
+愁滋味 3 n
+愁潘病沈 3 j
+愁烦 3 a
+愁眉 19 n
+愁眉不展 42 i
+愁眉啼妆 3 i
+愁眉泪眼 3 i
+愁眉苦眼 3 i
+愁眉苦脸 152 i
+愁眉蹙额 3 i
+愁眉锁眼 3 i
+愁红怨绿 3 i
+愁红惨绿 3 i
+愁绪 25 n
+愁绪如麻 3 i
+愁肠 35 n
+愁肠九回 3 i
+愁肠九转 3 i
+愁肠寸断 3 i
+愁肠殢酒 3 n
+愁肠百结 16 i
+愁苦 111 a
+愁长殢酒 3 n
+愁闷 66 a
+愁雾 3 n
+愁颜 3 n
+愃 2 zg
+愅 5 zg
+愆 67 g
+愆尤 3 v
+愆期 3 v
+愆罪 3 v
+愆过 3 v
+愇 2 zg
+愈 2641 d
+愈下 3 d
+愈之迷 3 v
+愈加 354 d
+愈发 399 d
+愈合 609 v
+愈多 3 d
+愈好 3 d
+愈富 2 v
+愈小 3 d
+愈差 3 v
+愈快愈好 3 l
+愈战愈勇 3 l
+愈易 3 d
+愈是 3 d
+愈显 3 v
+愈来 3 d
+愈来愈 659 d
+愈来愈多 3 l
+愈来愈好 3 l
+愈来愈少 3 l
+愈来愈浓 3 l
+愈来愈热 3 l
+愈演愈烈 208 l
+愈甚 3 d
+愈益 147 d
+愈趋繁多 3 l
+愈长 3 v
+愉 257 zg
+愉快 1193 a
+愉悦 249 a
+愉悦感 3 vn
+愉色 3 a
+愌 8 zg
+愍 52 g
+愎 32 g
+意 12995 n
+意下 3 n
+意下如何 3 l
+意与阑珊 3 i
+意中 77 ns
+意中人 83 n
+意为 3 v
+意义 8729 n
+意义学习 3 n
+意义深长 3 i
+意乱心忙 3 i
+意乱心慌 3 n
+意乱心灰 3 i
+意乱情迷 18 i
+意乱神迷 3 i
+意会 34 n
+意会出 3 n
+意兴 37 ns
+意兴盎然 3 l
+意兴索然 13 i
+意兴阑珊 9 i
+意出望外 3 i
+意切 3 a
+意切言尽 3 i
+意切辞尽 3 i
+意到笔随 3 i
+意前笔后 3 l
+意动 3 n
+意匠 4 n
+意合情投 3 nt
+意同 3 a
+意向 372 n
+意向书 49 n
+意向性 11 n
+意向系统 3 l
+意向者 3 n
+意向表 3 n
+意向论 3 n
+意向锁 3 n
+意味 566 n
+意味无穷 3 i
+意味深长 157 i
+意味着 2304 v
+意味著 3 n
+意味隽永 5 i
+意商 3 n
+意图 873 n
+意在 355 v
+意在沛公 9 i
+意在笔先 2 i
+意在笔前 3 i
+意在言外 3 i
+意境 436 n
+意境地图 3 n
+意外 2197 a
+意外事件 3 n
+意外事故 3 n
+意外保险 3 n
+意外开支 3 l
+意外获得 3 i
+意外险 57 n
+意外风波 3 l
+意大利 4556 ns
+意大利人 197 n
+意大利共和国 17 ns
+意大利式 18 n
+意大利政府 13 nt
+意大利文 17 nz
+意大利杯 16 nz
+意大利王国 22 ns
+意大利语 81 nz
+意大利里拉 3 ns
+意大利队 13 nt
+意大利黑手党 2 nz
+意存笔先 3 l
+意广才疏 3 i
+意往神驰 3 i
+意得志满 3 i
+意志 2040 n
+意志力 40 n
+意志受挫 3 i
+意志品质 3 n
+意志坚强 3 nt
+意志相合 3 i
+意志缺失 3 i
+意志薄弱 3 i
+意志薄弱者 2 n
+意志轩昂 3 i
+意志集中 3 nt
+意念 102 n
+意态 3 n
+意思 6089 n
+意思明白 3 i
+意急心忙 3 i
+意想 33 n
+意想不到 415 l
+意想到 3 l
+意惹情牵 3 i
+意愿 654 n
+意慵心懒 3 v
+意懒心灰 3 i
+意扰心烦 3 i
+意指 3 n
+意文 3 n
+意料 297 n
+意料不到 3 l
+意料中 3 l
+意料之中 92 l
+意料之处 3 l
+意料之外 336 l
+意料到 3 l
+意断恩绝 3 i
+意旨 426 n
+意杨 512 n
+意欲 347 n
+意欲何为 3 i
+意气 101 n
+意气扬扬 2 i
+意气昂扬 3 i
+意气洋洋 3 ns
+意气用事 42 n
+意气相得 3 l
+意气相投 24 i
+意气自如 3 i
+意气自得 3 i
+意气自若 3 i
+意气风发 75 i
+意气飞扬 3 i
+意气高昂 3 i
+意涵 3 n
+意淫 3 v
+意满志得 3 i
+意然决然 3 l
+意犹未尽 71 i
+意甲 155 n
+意笔 3 n
+意绪 5 n
+意花丛 3 n
+意荡神摇 3 i
+意蕴 46 n
+意表 3 n
+意见 10329 n
+意见书 142 n
+意见函 17 n
+意见分歧 3 n
+意见反馈 3 n
+意见建议 3 l
+意见栏 2 n
+意见沟通 3 i
+意见箱 12 n
+意见簿 2 n
+意见者 5 n
+意见调查 3 l
+意识 4907 n
+意识形态 497 l
+意识形态化 4 l
+意识流 44 n
+意译 65 n
+意谓 32 v
+意谓着 3 y
+意象 115 n
+意象派 3 n
+意趣 82 n
+意转心回 3 i
+意面 3 n
+意马心猿 7 i
+愒 6 zg
+愒时 3 vn
+愔 16 zg
+愕 332 a
+愕然 431 a
+愕视 3 a
+愖 2 zg
+愘 14 zg
+愙 2 zg
+愚 513 v
+愚不可及 16 i
+愚人 33 n
+愚人篇 3 n
+愚人节 18 n
+愚兄 67 n
+愚公 20 nr
+愚公移山 18 i
+愚公精神 3 i
+愚勇 3 a
+愚味 3 n
+愚夫愚妇 5 nr
+愚夫蠢妇 3 i
+愚妄 3 a
+愚孝 3 a
+愚弄 99 v
+愚弄人民 3 i
+愚弄百姓 3 i
+愚弄群众 3 i
+愚弟 3 n
+愚意 3 a
+愚懦 3 a
+愚拙 8 a
+愚昧 224 a
+愚昧无知 25 i
+愚昧落后 3 i
+愚民 47 n
+愚民政策 7 n
+愚氓 3 n
+愚痴 3 n
+愚直 4 a
+愚眉肉眼 3 i
+愚笨 28 a
+愚者 9 n
+愚者一得 3 i
+愚者千虑 3 i
+愚蒙 5 nr
+愚蠢 543 a
+愚蠢地 3 i
+愚见 94 a
+愚辈 3 n
+愚迷不悟 3 i
+愚钝 33 a
+愚陋 7 a
+愚顽 11 a
+愚鲁 29 a
+愛 19 zg
+愜 6 zg
+愝 2 zg
+愞 10 zg
+感 5722 v
+感于 3 v
+感人 391 n
+感人事迹 3 n
+感人心者 3 n
+感人心脾 3 i
+感人肺肝 3 n
+感人肺腑 12 i
+感人至深 30 i
+感今怀昔 3 i
+感今思昔 3 i
+感今惟昔 3 i
+感伤 144 v
+感佩 28 v
+感光 166 n
+感光剂 3 n
+感光器 3 n
+感光度 12 n
+感光性 6 n
+感光材料 7 n
+感光片 13 n
+感光纸 3 n
+感光计 3 n
+感光鼓 3 i
+感兴 3 v
+感兴起 3 l
+感兴趣 33 n
+感兴趣我 3 i
+感冒 604 v
+感冒药 32 n
+感冒通 2 l
+感到 9561 v
+感到恐惧 3 i
+感到悔恨 3 i
+感到烦闷 3 n
+感到疲倦 3 i
+感到痛心 3 i
+感到痛苦 3 i
+感到遗憾 3 i
+感到高兴 3 l
+感动 1839 v
+感动不已 3 l
+感化 81 v
+感化院 7 n
+感发 3 v
+感受 2620 v
+感受一下 3 l
+感受力 4 n
+感受器 208 n
+感受态 3 n
+感受性 3 n
+感召 62 v
+感召力 30 n
+感召性 3 n
+感叹 729 v
+感叹句 3 n
+感叹号 13 n
+感叹词 2 i
+感同身受 32 l
+感喟 8 vn
+感喟不置 3 v
+感器 7 n
+感夜性 3 n
+感天动地 11 n
+感天泣地 3 i
+感奋 30 v
+感官 172 n
+感官世界 3 n
+感应 511 v
+感应力 3 n
+感应卡 3 n
+感应同步器 3 l
+感应器 17 n
+感应图 3 n
+感应圈 3 n
+感应场 3 n
+感应式 3 n
+感应性 3 n
+感应炉 23 n
+感应电 3 n
+感应电流 31 n
+感应线 3 n
+感应计 3 n
+感应门 3 n
+感念 66 n
+感怀 45 v
+感思 3 n
+感性 257 n
+感性认识 48 l
+感性运动 3 l
+感恩 182 v
+感恩不尽 3 i
+感恩图报 32 n
+感恩怀德 3 i
+感恩戴德 32 i
+感恩节 20 t
+感悟 202 v
+感悟到 3 n
+感悟力 9 n
+感情 3806 n
+感情世界 3 n
+感情丰富 3 l
+感情交流 3 n
+感情作用 3 l
+感情投资 3 l
+感情生活 3 i
+感情用事 102 n
+感情破裂 3 i
+感情纠缠 3 v
+感情纠葛 3 ns
+感情脆弱 3 l
+感想 141 v
+感愤 3 n
+感愧 3 v
+感愧交并 3 v
+感慨 747 v
+感慨万分 10 l
+感慨万千 64 i
+感慨万端 26 i
+感慨不已 24 i
+感慨天地 3 i
+感慨杀身 3 i
+感慨激昂 3 i
+感慨系之 10 l
+感慰 3 v
+感戴 3 v
+感戴二天 3 i
+感抗 3 v
+感旧之哀 3 i
+感旧之衷 3 i
+感极涕零 3 i
+感染 2282 v
+感染力 157 n
+感染性 81 n
+感染期 10 n
+感染率 17 n
+感染者 112 n
+感泣 3 v
+感测器 2 n
+感深肺腑 3 i
+感温 8 n
+感激 1567 v
+感激万分 3 l
+感激不尽 84 l
+感激涕零 54 i
+感热 3 v
+感生 3 v
+感生电流 2 n
+感生电荷 3 n
+感电 3 n
+感病性 3 n
+感知 284 v
+感知力 3 n
+感知器 3 n
+感知机 9 n
+感荷 3 n
+感观 16 n
+感觉 7767 n
+感觉不好 3 l
+感觉主义 3 n
+感觉剥夺 3 l
+感觉器 3 l
+感觉器官 60 l
+感觉属性 3 n
+感觉得到 3 l
+感觉登记 3 n
+感觉神经 22 l
+感觉良好 3 l
+感觉运动 3 l
+感触 193 v
+感触良多 3 i
+感言 62 n
+感谢 1710 v
+感谢上帝 3 n
+感谢信 26 n
+感谢您 3 l
+感谢状 3 n
+感谢电 3 n
+感谢礼 3 n
+感谢词 3 n
+感谢费 3 n
+感遇 5 n
+感遇忘身 3 n
+愠 103 zg
+愠容 3 n
+愠怒 28 v
+愠色 24 n
+愢 3 zg
+愣 1693 v
+愣乎乎 3 z
+愣住 252 v
+愣劲 3 v
+愣头愣脑 7 z
+愣头青 3 z
+愣小子 3 v
+愣怔 52 v
+愣怔怔 5 z
+愣愣 3 v
+愣神 27 v
+愣神儿 6 z
+愤 497 v
+愤不欲生 3 i
+愤不顾身 3 i
+愤世 3 v
+愤世嫉俗 33 i
+愤世疾俗 6 i
+愤发 3 v
+愤忾 3 i
+愤怒 2197 v
+愤怨 3 v
+愤恨 219 v
+愤恨不平 3 i
+愤愤 127 a
+愤愤不平 101 i
+愤愤然 18 i
+愤慨 535 a
+愤懑 130 a
+愤抑 3 v
+愤时疾俗 3 i
+愤概 3 d
+愤气填膺 3 i
+愤激 81 v
+愤激语 3 i
+愤然 102 d
+愤然离去 3 i
+愤然而起 3 i
+愤而行凶 3 n
+愤而辞职 12 i
+愤起 3 v
+愤青 3 a
+愤风惊浪 3 i
+愦 30 zg
+愧 352 vg
+愧不敢当 3 v
+愧为 3 v
+愧于 2 v
+愧作 3 v
+愧受 3 v
+愧天怍人 3 vn
+愧对 67 v
+愧心 3 a
+愧恨 3 a
+愧悔 10 v
+愧悔无地 3 n
+愧无以报 3 n
+愧杀 3 v
+愧歉 3 a
+愧汗 3 v
+愧汗无地 3 n
+愧疚 149 a
+愧痛 3 a
+愧色 45 a
+愧赧 3 a
+愧领 3 v
+愧颜 3 n
+愨 12 zg
+愩 76 zg
+愪 338 zg
+愫 30 g
+愬 521 zg
+愭 398 zg
+愮 203 zg
+愯 140 zg
+愰 137 zg
+愱 8 zg
+愲 2 zg
+愴 3 zg
+愶 249 zg
+愻 3 zg
+愽 3 zg
+愾 4 zg
+愿 6538 v
+愿不愿 3 v
+愿不愿意 55 v
+愿为 3 v
+愿书 3 n
+愿交 3 v
+愿受 3 v
+愿君 3 n
+愿和你 3 n
+愿天下有 3 v
+愿心 12 v
+愿意 5538 v
+愿意哦 3 v
+愿挨 3 i
+愿望 1643 v
+愿者 5 n
+愿者上钩 9 n
+愿谨 3 i
+愿赌服输 3 nr
+愿闻 3 n
+愿闻其详 3 i
+慀 2 zg
+慁 4 zg
+慂 13 zg
+慅 2 zg
+慆 2 zg
+慇 3 zg
+慇勤 3 vn
+慇勤招待 3 nr
+慈 687 nr
+慈乌 3 nrt
+慈乌反哺 3 i
+慈乌返哺 3 i
+慈云寺 15 nr
+慈云桂 2 nr
+慈仁者 2 nr
+慈光阁 3 nr
+慈利 38 nrt
+慈利县 5 ns
+慈力王 2 nr
+慈和 69 nrt
+慈善 559 nr
+慈善事业 3 n
+慈善会 3 nr
+慈善家 19 nr
+慈善机构 3 n
+慈善赛 3 nr
+慈四模 2 nr
+慈圣太后 4 nr
+慈姑 15 nr
+慈子孝 5 nr
+慈宁宫 222 nr
+慈宁慈 3 nr
+慈宁花园 3 ns
+慈宁门 2 nr
+慈安太后 3 nr
+慈幼院 8 nr
+慈庆官 2 nr
+慈庆宫 102 nr
+慈庵蜜 4 nr
+慈心 26 a
+慈恩一 16 nrt
+慈恩举 2 nr
+慈恩去 2 nr
+慈恩又 4 nr
+慈恩双 2 nr
+慈恩可 2 nrt
+慈恩右 2 nr
+慈恩叹 4 nr
+慈恩向 2 nrt
+慈恩听 4 nr
+慈恩和 2 nrt
+慈恩和尚 8 nr
+慈恩大 4 nr
+慈恩大师 10 nr
+慈恩奔 2 nrt
+慈恩宗 4 nrt
+慈恩寺 27 nr
+慈恩左 2 nrt
+慈恩已 2 nr
+慈恩忽 2 nr
+慈恩怒 2 nr
+慈恩惊 2 nr
+慈恩所 2 nr
+慈恩打 2 nr
+慈恩扬 2 nr
+慈恩挺 2 nr
+慈恩掌 4 nr
+慈恩望 2 nr
+慈恩瞿 4 nr
+慈恩站 2 nr
+慈恩耳 3 nr
+慈恩见 2 nr
+慈恩面 2 nr
+慈悲 358 a
+慈悲为怀 3 nr
+慈悲为本 3 nr
+慈悲心 3 nr
+慈慧普 2 nr
+慈明无双 3 nr
+慈母 59 nr
+慈江道 5 nr
+慈济 3 nr
+慈济宫 4 nr
+慈溪 38 nrt
+慈溪人 8 nr
+慈溪县 3 nr
+慈溪市 7 ns
+慈溪网 3 nr
+慈焕抱 2 nr
+慈焕的 3 nr
+慈爱 129 nr
+慈父 16 nrt
+慈父严母 3 nr
+慈眉善目 17 i
+慈眉善眼 3 i
+慈石之 4 nr
+慈石召 9 nr
+慈石能 4 nr
+慈祥 179 nr
+慈禧 2353 nrt
+慈禧一 22 nr
+慈禧停 4 nr
+慈禧冲 2 nr
+慈禧冷 6 nr
+慈禧切 2 nr
+慈禧刚 2 nr
+慈禧又 6 nr
+慈禧叹 2 nr
+慈禧听 4 nr
+慈禧圣母 2 nr
+慈禧天 2 nr
+慈禧太 162 nr
+慈禧太后 226 nr
+慈禧奔 2 nr
+慈禧寝 6 nr
+慈禧尖 2 nr
+慈禧尝 2 nr
+慈禧往 2 nr
+慈禧微微 4 nr
+慈禧戴 2 nr
+慈禧拿 2 nr
+慈禧挥 2 nr
+慈禧搭 6 nr
+慈禧收 2 nr
+慈禧明 2 nr
+慈禧朝 2 nr
+慈禧正 4 nr
+慈禧满 2 nr
+慈禧火 4 nr
+慈禧点 2 nr
+慈禧煦 2 nr
+慈禧皇太 3 nr
+慈禧皱 4 nr
+慈禧眯 2 nr
+慈禧眼 4 nr
+慈禧瞅 4 nr
+慈禧站 4 nr
+慈禧竟 2 nr
+慈禧笑 4 nr
+慈禧膝 2 nr
+慈禧西 4 nr
+慈禧转 8 nr
+慈禧边 2 nr
+慈禧阅 2 nr
+慈禧除 2 nr
+慈禧马 2 nr
+慈胜寺 2 nr
+慈至恕 3 nr
+慈颜 3 nrt
+慊 137 zg
+慌 1905 a
+慌不择路 45 i
+慌乱 501 a
+慌了手脚 3 i
+慌作一团 3 i
+慌促 3 a
+慌做一团 3 i
+慌叫 3 z
+慌四 3 i
+慌张 258 a
+慌张张 3 z
+慌张起来 3 i
+慌忙 672 ad
+慌忙之间 3 i
+慌恐 3 a
+慌慌 3 a
+慌慌张张 120 z
+慌慌忙忙 12 z
+慌成 3 v
+慌成一团 3 i
+慌手忙脚 3 z
+慌手慌脚 8 z
+慌神 16 a
+慌神儿 3 z
+慌称 3 a
+慌里慌张 42 z
+慎 425 nr
+慎之又慎 20 l
+慎于 3 v
+慎于接物 3 l
+慎兴业 3 nr
+慎到 3 v
+慎可推 2 l
+慎夫人 12 nr
+慎始 3 v
+慎始慎终 3 nr
+慎始敬终 3 nr
+慎始而敬终 4 l
+慎审 2 v
+慎密 4 a
+慎小事微 3 l
+慎小谨微 3 nr
+慎微 2 a
+慎思 3 nr
+慎思之 2 nr
+慎思明辨 3 nr
+慎思笃 2 nr
+慎思笃行 3 nr
+慎抗疏 2 nr
+慎择 2 v
+慎海雄 3 nr
+慎独 12 a
+慎用 83 v
+慎终于始 3 i
+慎终如始 3 i
+慎终思远 3 l
+慎终承始 3 l
+慎终追远 3 l
+慎臣属 2 nr
+慎行 26 v
+慎裕 2 a
+慎言 2 nr
+慎言谨 2 nr
+慎谋远虑 3 i
+慎身修永 3 nr
+慎选 8 v
+慎重 600 a
+慎重从事 3 l
+慎重其事 3 l
+慎重处理 3 l
+慎重对待 3 l
+慎重考虑 3 nr
+慎重追远 3 l
+慎防 3 v
+慎防意外 3 l
+慎防杜渐 3 nr
+慑 211 vg
+慑息 3 v
+慑慴 3 v
+慑服 26 v
+慓 21 zg
+慕 390 nr
+慕义侯 2 nr
+慕义来 4 nr
+慕之意 2 nr
+慕光性 3 nr
+慕克吉 4 nr
+慕凌飞 9 nr
+慕利延 5 nr
+慕古薄今 3 l
+慕可舜 9 nr
+慕吉克 3 nr
+慕名 351 nr
+慕名而来 29 l
+慕士塔 2 nr
+慕士塔格 3 nr
+慕士塔格山 15 ns
+慕士塔格峰 5 ns
+慕士山 2 nr
+慕大侠 2 nr
+慕大元 2 nr
+慕大海 2 ns
+慕天颜 44 nr
+慕容 753 nr
+慕容云 3 nr
+慕容令 6 nr
+慕容伏允 2 nr
+慕容兄 4 nr
+慕容先生 30 nr
+慕容公子 214 nr
+慕容冲 7 nr
+慕容博 118 nr
+慕容博微微 3 nr
+慕容垂 50 nr
+慕容垂新 2 nr
+慕容复 685 nr
+慕容复冷 4 nr
+慕容复剑 2 nr
+慕容复叹 3 nr
+慕容复呼 2 l
+慕容复喜 2 nr
+慕容复奔 3 nr
+慕容复微 3 nr
+慕容复微微 3 l
+慕容复心 10 l
+慕容复怒 3 nr
+慕容复掌 2 nr
+慕容复提 2 l
+慕容复朗 2 nr
+慕容复甚 2 nr
+慕容复相 3 nr
+慕容复知 3 l
+慕容复笑 11 l
+慕容复素 2 l
+慕容复舞 2 l
+慕容复见 2 l
+慕容复身 3 l
+慕容复飞 4 nr
+慕容夫人 13 nr
+慕容宝 10 nr
+慕容宝乘 3 nr
+慕容家 2 l
+慕容少侠 4 nr
+慕容居士 2 nr
+慕容师兄 2 nr
+慕容庄 4 nr
+慕容府 3 nr
+慕容德 7 nr
+慕容恒 2 nr
+慕容恽 2 nr
+慕容景岳 76 nr
+慕容氏 168 nr
+慕容永 19 nr
+慕容泓 11 nr
+慕容泓闻 3 nr
+慕容燕 8 nr
+慕容盛 2 nr
+慕容绍宗 2 nr
+慕容老爷 14 nr
+慕容贵妃 2 nr
+慕容超 5 nr
+慕容雪 2 nr
+慕容顺 2 nr
+慕少艾 3 nr
+慕尼黑 485 nr
+慕川 2 ns
+慕师师 2 nr
+慕庆 29 ns
+慕德斯 2 nr
+慕杨公子 2 nr
+慕永国 24 nr
+慕洋 4 ns
+慕煌 7 ns
+慕瑾来 2 nr
+慕瑾道 12 nr
+慕田峪 10 nr
+慕田峪长城 20 ns
+慕经理 2 nr
+慕绥新 8 nr
+慕蠡洞 4 nr
+慕贤良 2 nr
+慕邮 2 ns
+慕雅女 2 nr
+慕雍山 3 nr
+慘 3 zg
+慛 221 zg
+慜 2 zg
+慝 18 zg
+慢 2660 a
+慢一拍 3 l
+慢下 3 d
+慢下去 3 l
+慢下来 3 d
+慢中子 8 l
+慢些 3 d
+慢件 3 n
+慢动作 6 n
+慢化 3 v
+慢化剂 3 nz
+慢半拍 3 l
+慢吃 3 v
+慢吞吞 120 z
+慢坡 35 n
+慢工 3 n
+慢待 8 v
+慢性 969 b
+慢性伤害 3 l
+慢性子 31 l
+慢性感染 3 l
+慢性期 8 n
+慢性病 122 n
+慢性肾炎 3 n
+慢性辐照 3 n
+慢悠悠 78 z
+慢慢 4427 d
+慢慢儿 3 z
+慢慢吞吞 6 z
+慢慢悠悠 9 z
+慢慢来 48 b
+慢慢而行 3 i
+慢慢腾腾 7 z
+慢慢说 65 l
+慢手慢脚 3 z
+慢摇吧 3 l
+慢易生忧 3 i
+慢曲 3 n
+慢条丝礼 3 i
+慢条厮礼 3 i
+慢条斯理 99 nz
+慢条斯礼 3 nz
+慢来 3 d
+慢来慢去 3 z
+慢板 29 n
+慢板情歌 3 i
+慢棋 3 n
+慢步 20 d
+慢死 3 d
+慢殆 3 i
+慢火 12 b
+慢点 3 d
+慢点儿 3 d
+慢班 3 nz
+慢用 3 b
+慢病毒属 3 n
+慢腾 3 z
+慢腾斯礼 3 i
+慢腾腾 45 z
+慢藏诲盗 3 i
+慢行 29 d
+慢说 14 d
+慢走 59 v
+慢走丝 3 n
+慢起来 3 l
+慢足要求 3 l
+慢跑 56 v
+慢跑鞋 3 n
+慢车 8 n
+慢车道 3 n
+慢速 35 d
+慢速度 3 n
+慢速邮递 3 l
+慢钟 3 n
+慢镜头 21 n
+慥 3 zg
+慧 571 nr
+慧业才人 3 nr
+慧业文人 3 nr
+慧剑斩情 3 l
+慧心 23 nr
+慧心妙舌 3 nr
+慧心巧思 3 nr
+慧星 2 nr
+慧根 2 nr
+慧眼 66 nr
+慧眼独具 3 l
+慧眼识 3 nr
+慧眼识人 3 n
+慧眼识才 4 nr
+慧眼识珠 2 nr
+慧眼识英 3 nr
+慧禅师 7 nr
+慧聪网 3 nr
+慧黠 3 a
+慨 68 d
+慨允 3 v
+慨叹 124 v
+慨当以慷 3 l
+慨然 110 d
+慨然允诺 3 i
+慨然应允 3 l
+慨然应诺 3 l
+慨然相助 3 i
+慫 2 zg
+慰 447 v
+慰劳 69 v
+慰劳品 3 n
+慰勉 18 v
+慰唁 2 v
+慰安 2 v
+慰安妇 3 n
+慰安所 3 n
+慰悦 3 v
+慰情胜无 3 n
+慰抚 23 v
+慰留 21 v
+慰缭子 3 v
+慰藉 118 v
+慰解 3 v
+慰问 481 v
+慰问信 25 n
+慰问品 23 n
+慰问团 43 n
+慰问款 3 n
+慰问电 31 n
+慰问组 24 n
+慰问袋 8 n
+慰问金 18 n
+慱 2 zg
+慴 6 zg
+慴伏 3 vn
+慵 71 zg
+慵懒 55 a
+慷 100 i
+慷人之慨 3 i
+慷他人之慨 4 i
+慷慨 620 a
+慷慨仗义 3 i
+慷慨大方 17 i
+慷慨就义 18 i
+慷慨悲歌 15 i
+慷慨捐生 3 i
+慷慨淋漓 3 i
+慷慨激扬 3 i
+慷慨激昂 287 i
+慷慨激烈 3 i
+慷慨给与 3 i
+慷慨解囊 22 i
+慷慨赴义 3 i
+慷慨输将 3 v
+慷慨陈词 67 i
+慷慨陈辞 11 i
+慸 11 zg
+慹 6 zg
+慺 4 zg
+慾 7 zg
+憉 34 zg
+憋 901 zg
+憋不住 3 l
+憋住 3 a
+憋住气 3 l
+憋屈 9 a
+憋死 3 a
+憋气 52 a
+憋着 3 a
+憋脚 3 a
+憋足 3 a
+憋足劲 4 l
+憋闷 43 a
+憍 4 zg
+憍陈如 3 nr
+憎 161 v
+憎厌 3 v
+憎嫉 3 v
+憎嫌 3 v
+憎容 3 v
+憎恨 354 v
+憎恶 150 v
+憎恶分明 3 z
+憎水 3 v
+憎爱分明 3 z
+憎称 3 v
+憐 4 zg
+憔 21 a
+憔悴 385 a
+憔神悴力 3 vn
+憖 20 zg
+憗 7 zg
+憚 12 zg
+憜 62 zg
+憝 7 g
+憞 22 zg
+憟 8 zg
+憡 93 zg
+憦 2 zg
+憧 76 zg
+憧憬 210 v
+憧憬未来 3 nrt
+憨 305 ng
+憨乎乎 3 z
+憨傻 3 a
+憨厚 89 a
+憨厚老实 3 z
+憨头憨脑 3 z
+憨子 2 n
+憨实 3 a
+憨态 5 n
+憨态可掬 16 l
+憨憨的 10 z
+憨状可掬 3 l
+憨痴 3 z
+憨痴痴 3 z
+憨直 9 a
+憨笑 17 a
+憨豆 3 n
+憩 42 vg
+憩息 160 v
+憪 5 zg
+憬 50 v
+憬悟 3 v
+憬然有悟 3 v
+憯 29 zg
+憰 3 zg
+憲 6 zg
+憳 236 zg
+憶 3 zg
+憷 56 g
+憸 7 zg
+憺 8 zg
+憻 2 zg
+憾 111 ng
+憾事 33 n
+憾动 3 n
+憾恨 3 n
+憾悔 3 n
+憿 165 zg
+懂 3998 v
+懂不懂 3 v
+懂事 389 v
+懂人意 3 v
+懂吗 3 v
+懂得 2185 v
+懂法 3 v
+懂行 30 v
+懂道理 3 a
+懅 4 zg
+懆 29 zg
+懇 14 zg
+懈 169 vg
+懈弛 3 a
+懈怠 111 a
+懈惰 3 a
+懈慢 3 a
+懈气 3 a
+懊 79 v
+懊丧 93 v
+懊丧起来 3 v
+懊恨 3 v
+懊恼 160 v
+懊恼不已 3 v
+懊悔 248 v
+懊悔不已 3 v
+懊悔无及 3 nrfg
+懊悔莫及 3 ns
+懋 53 g
+懋功 28 n
+懋勤殿 3 nz
+懋绩 3 n
+懌 45 zg
+懍 8 zg
+懑 16 g
+懒 595 a
+懒于 3 v
+懒人 16 n
+懒妇 3 n
+懒定 3 v
+懒得 324 v
+懒得动 3 v
+懒怠 9 a
+懒惰 141 a
+懒惰成性 3 v
+懒惰虫 3 vn
+懒惰鬼 3 v
+懒懒 3 a
+懒懒散散 3 v
+懒散 102 v
+懒散地 3 z
+懒汉 24 n
+懒洋洋 140 z
+懒猪 3 n
+懒猫 3 n
+懒猴 20 n
+懒腰 70 v
+懒虫 10 n
+懒觉 57 n
+懒骨 3 z
+懒骨头 3 n
+懒鬼 3 n
+懓 3 zg
+懔 59 g
+懗 46 zg
+懗氯 3 nz
+懙 14 zg
+懜 42 zg
+懝 4 zg
+懞 6 zg
+懞懂 3 z
+懟 3 zg
+懠 40 zg
+懡 301 zg
+懦 194 zg
+懦夫 96 n
+懦弱 168 ad
+懦怯 18 a
+懦词怪说 3 vn
+懫 2 zg
+懬谡写 3 nr
+懭 2 zg
+懱 2 zg
+懵 192 l
+懵懂 54 v
+懵懂一时 3 l
+懵懵 3 l
+懵懵懂懂 38 l
+懵懵无知 3 l
+懵懵然 3 z
+懵然 3 z
+懵然无知 3 l
+懵然无觉 3 l
+懵里懵懂 8 l
+懽 18 zg
+懿 509 zg
+懿事 3 n
+懿德 7 n
+懿旨 126 n
+懿范 3 n
+懿行 3 n
+戀 4 zg
+戆 18 zg
+戆头戆脑 3 z
+戆直 6 z
+戈 370 nr
+戈亚尼 3 nr
+戈亚斯 3 nr
+戈亚斯州 7 nrt
+戈什 40 nrt
+戈伊德 3 nr
+戈伊苏 3 nr
+戈伊蒂 2 nr
+戈佐岛 2 nr
+戈公振 4 nr
+戈兰高地 10 nz
+戈列曼 2 nr
+戈利科 3 nr
+戈卡尔 4 nr
+戈埃尔 2 nr
+戈培尔 35 nr
+戈塘镇 3 nr
+戈壁 368 nr
+戈壁大沙 3 nr
+戈壁滩 52 nr
+戈多 12 nrt
+戈多伊 6 nrt
+戈夫岛 2 nr
+戈夫曼 3 nr
+戈宝权 6 nr
+戈家沟村 3 nr
+戈宾德 2 nr
+戈尔 47 nr
+戈尔丁 5 nr
+戈尔什科夫 2 nrt
+戈尔兹 2 nr
+戈尔孔 2 nr
+戈尔巴 4 nr
+戈尔巴乔 3 nrt
+戈尔巴乔夫 123 nrt
+戈尔德 11 nr
+戈尔恰 2 nr
+戈尔斯 13 nr
+戈尔施 2 nr
+戈尔曼 4 nr
+戈尔湾 3 nr
+戈尔茨 2 nrt
+戈尔诺 3 nr
+戈尔达 2 nr
+戈尔迪 4 nr
+戈尔韦 2 nr
+戈巴契夫 3 nrt
+戈康达 3 nr
+戈德亚 4 nr
+戈德温 10 nr
+戈德里 2 nr
+戈德霍普 3 nr
+戈执戟 2 nr
+戈扬盾 2 nr
+戈拉 7 nrt
+戈拉尔 2 nr
+戈拉腊 2 nr
+戈斯卡 21 nr
+戈斯图 2 nr
+戈斯林 3 nr
+戈族 2 nz
+戈本 2 n
+戈林 50 nr
+戈梅兹 2 nr
+戈梅利 4 nr
+戈梅拉 2 nr
+戈梅斯 3 nr
+戈森斯 3 nr
+戈比 21 nrt
+戈洛夫 2 nr
+戈洛文 14 nr
+戈海军 8 nr
+戈特 3 nrt
+戈特利布 6 nrt
+戈特岛 2 nr
+戈特弗 3 nr
+戈特芒 2 nr
+戈特霍 5 nr
+戈珊 82 nrt
+戈矛 9 nr
+戈科夫 2 nr
+戈米纳 2 nr
+戈纳伊夫 4 nrt
+戈纳夫 4 nr
+戈纳尔 4 nr
+戈维岑 2 nr
+戈维诺 18 nr
+戈罗 8 nrt
+戈罗夫 3 nr
+戈罗恩 7 nr
+戈罗维 8 nr
+戈苏亚 2 nr
+戈茨 9 nrt
+戈莱托 4 nr
+戈萨奇 2 nr
+戈蒂耶 8 nr
+戈西河 2 nr
+戈语 4 nz
+戈诺夫 2 nr
+戈谢病 3 nr
+戈贝尔 4 nr
+戈达尔 27 nr
+戈达德 6 nr
+戈达瓦里 10 nrt
+戈迪亚 19 nr
+戈迪吉 2 nr
+戈迪默 5 nr
+戈里 4 nrt
+戈里亚 5 nr
+戈铭文 2 nr
+戈锡克 5 nr
+戈雷岛 8 nr
+戈雷斯 3 nr
+戈雷方程 3 nr
+戈麦兹 3 nr
+戈麦斯 20 nr
+戉 2 zg
+戊 163 l
+戊丑 3 m
+戊二烯 6 nz
+戊二醛 3 nz
+戊亥 3 m
+戊午 14 t
+戊卯 3 m
+戊基 3 nz
+戊子 6 n
+戊寅 17 m
+戊寅年 6 m
+戊巳 3 m
+戊戌 33 m
+戊戌六 8 l
+戊戌变法 129 l
+戊戌年 13 m
+戊戌政变 18 l
+戊戌日 3 l
+戊戌维新 21 nz
+戊戌维新运动 30 nz
+戊未 3 nz
+戊炔 3 n
+戊烯 11 nz
+戊烷 18 nz
+戊申 4 nz
+戊申日 2 m
+戊等 3 m
+戊糖 3 n
+戊级 3 n
+戊辰 13 nz
+戊辰年 2 m
+戊酉 3 m
+戊酮 7 nz
+戊酯 6 nz
+戊酸 3 nz
+戊酸盐 3 nz
+戊醇 2 nz
+戊醛 3 nz
+戋 5 x
+戌 83 t
+戌时 3 t
+戌狗 3 t
+戍 175 vg
+戍区 3 n
+戍卒 13 n
+戍卫 3 v
+戍守 60 v
+戍守边疆 3 n
+戍边 71 n
+戍边人 2 n
+戎 401 nr
+戎举兵 3 nr
+戎事 3 n
+戎兵亦 2 nr
+戎务 5 n
+戎围犬 2 nr
+戎幕 2 n
+戎幕策 2 nr
+戎机 8 n
+戎狄之 3 nr
+戎狄交 3 nr
+戎狄渐 2 nr
+戎狄蛮 3 nr
+戎芦河 2 nr
+戎行 3 nr
+戎行亲 2 n
+戎行粤 3 nr
+戎衣 7 n
+戎装 254 n
+戎金 2 n
+戎马 41 nr
+戎马一生 4 nr
+戎马中 2 nr
+戎马仓皇 3 nr
+戎马余 2 nr
+戎马倥偬 24 i
+戎马倥傯 3 i
+戎马劻勷 3 v
+戎马生涯 16 i
+戎马生郊 3 nr
+戏 3048 n
+戏中人 3 n
+戏中戏 3 n
+戏份 5 n
+戏侮 12 n
+戏剧 2176 n
+戏剧人生 3 n
+戏剧化 34 n
+戏剧团 3 n
+戏剧学院 3 nt
+戏剧学院表演系 2 n
+戏剧实验 3 n
+戏剧家 107 n
+戏剧性 207 n
+戏剧片 3 n
+戏剧界 40 n
+戏剧社 2 n
+戏剧系 12 n
+戏剧节 23 n
+戏单 10 n
+戏友 2 n
+戏叫 3 v
+戏台 202 n
+戏台子 18 n
+戏团 3 n
+戏园 3 n
+戏园子 10 n
+戏场 3 n
+戏子 97 n
+戏弄 174 v
+戏弄着 3 y
+戏彩娱亲 3 n
+戏志才 3 n
+戏报子 3 n
+戏文 73 n
+戏日 3 n
+戏曲 1279 n
+戏曲史 29 n
+戏曲片 7 n
+戏曲片儿 3 n
+戏曲界 6 n
+戏服 3 n
+戏本 6 n
+戏校 43 n
+戏楼 94 n
+戏水 30 n
+戏法 64 n
+戏照 3 n
+戏班 77 n
+戏班子 83 n
+戏瘾 5 n
+戏目 2 n
+戏码 14 n
+戏票 24 n
+戏称 356 n
+戏笑 2 v
+戏管子 3 n
+戏箱 3 n
+戏考 3 v
+戏耍 60 n
+戏蝶游蜂 3 n
+戏衣 9 n
+戏袍 3 n
+戏装 35 n
+戏言 52 n
+戏论 3 n
+戏评 3 n
+戏词 4 n
+戏说 18 n
+戏谈 3 n
+戏谑 60 v
+戏路 22 n
+戏迷 39 n
+戏门 3 n
+戏院 48 n
+戏馆子 3 n
+戏骨 3 n
+成 44880 n
+成一军 2 nr
+成一家言 3 i
+成一统 2 n
+成一艺 3 nr
+成丁 11 nr
+成丁礼 3 nr
+成不了 68 l
+成不忧 3 v
+成不成 3 v
+成丰桥 2 nr
+成串 3 n
+成丹 6 ns
+成为 35966 v
+成为一团 3 i
+成为事实 3 i
+成为僵局 3 l
+成为古董 3 nr
+成为必要 3 l
+成为成员 3 l
+成为明胶 3 n
+成为有声 3 i
+成为杂色 3 i
+成为气泡 3 l
+成为泡影 3 i
+成为波形 3 i
+成为粒状 3 n
+成为网状 3 i
+成之君 3 nr
+成也萧何 3 nr
+成书 411 n
+成事 53 n
+成事不说 3 l
+成事不足 24 i
+成事在人 3 n
+成事在天 20 i
+成云致 2 nr
+成井 6 n
+成交 670 v
+成交价 52 n
+成交总值 3 n
+成交率 9 n
+成交量 259 n
+成交额 77 n
+成亮 9 a
+成亲 279 n
+成亲之日 3 i
+成人 1366 n
+成人之善 3 i
+成人之美 9 i
+成人化 6 n
+成人区 3 n
+成人图 3 n
+成人型 2 n
+成人式 7 n
+成人教育 3 l
+成人文学 3 nt
+成人期 20 n
+成人片 3 n
+成人版 3 n
+成人班 3 n
+成人礼 3 n
+成人站 3 n
+成人级 3 n
+成人网 3 n
+成人节 4 n
+成人话题 3 n
+成人高考 3 ns
+成仁 179 nr
+成仁取义 3 nr
+成仇 3 v
+成仙 45 n
+成仙之 4 nr
+成仙成 2 nr
+成份 199 n
+成份股 9 n
+成仿吾 21 nr
+成众 3 n
+成体 3 n
+成何体统 3 l
+成佛 72 v
+成佛作祖 2 n
+成例 103 n
+成保良 2 nr
+成修吾 3 nr
+成倍 109 m
+成倍增加 3 nr
+成倍增长 3 n
+成像 315 v
+成像仪 7 n
+成像机 6 n
+成元宝 2 nr
+成元生 6 nr
+成兆才 4 nr
+成克巩 6 nr
+成克杰 3 nr
+成全 177 v
+成其为 187 nr
+成册 40 v
+成军 12 n
+成冰作用 3 n
+成冻胶 3 n
+成凤 2 nr
+成分 4165 n
+成分股 11 n
+成分表 4 n
+成分论 2 n
+成则为王 4 nr
+成办 4 v
+成功 10638 a
+成功之路 3 i
+成功人士 3 n
+成功失败 3 v
+成功学 3 n
+成功实践 3 l
+成功岭 3 nr
+成功感 8 n
+成功率 212 n
+成功率高 2 n
+成功经验 3 n
+成功网 3 n
+成功者 78 n
+成化 684 v
+成千 3 n
+成千上万 631 i
+成千上百 6 i
+成千成万 74 i
+成千成万担 2 l
+成千成万条 6 i
+成千成百 3 i
+成千累万 2 i
+成华区 8 ns
+成单 3 a
+成单数 3 n
+成县 26 ns
+成双 3 nr
+成双作对 3 i
+成双成对 22 i
+成反比 3 j
+成合子 2 n
+成合蕊 2 n
+成吉思汗 946 nr
+成名 334 v
+成名作 54 n
+成名成家 7 l
+成名曲 3 nr
+成名立业 3 n
+成君之 2 nr
+成员 4686 n
+成员体 2 n
+成员名单 3 n
+成员国 851 n
+成员数 3 n
+成周公 2 nr
+成命 43 v
+成品 342 n
+成品托盘 3 n
+成品油 58 n
+成品率 9 n
+成品粮 2 n
+成唯识 12 n
+成善德 16 nr
+成器 20 n
+成因 426 n
+成团 65 n
+成团打块 3 n
+成国公 16 nr
+成国渠 5 nr
+成圣王 2 nr
+成块 3 n
+成型 516 n
+成型机 12 n
+成型法 3 n
+成型片 3 n
+成型片夹 3 n
+成城 6 ns
+成城断金 3 n
+成基命 2 nz
+成堆 77 n
+成大 3 a
+成大功 3 nr
+成大器 21 n
+成大林 4 nr
+成大群 6 nr
+成大言 2 nr
+成天 295 t
+成天价 4 n
+成天到晚 3 l
+成奎安 3 nr
+成套 153 a
+成套出售 3 v
+成套率 4 n
+成套用具 3 n
+成套设备 3 n
+成婆 2 n
+成婚 228 v
+成婚之日 3 i
+成孔分子 3 n
+成安 5 ns
+成安县 3 ns
+成宗卒 3 nr
+成宗立 2 nr
+成宗诏 2 nr
+成实德 2 nr
+成实性 4 n
+成宥利 3 vn
+成家 103 n
+成家立业 29 n
+成家立计 3 i
+成对 3 v
+成小丁 2 nr
+成小球 10 n
+成小群 3 nr
+成就 3599 n
+成就动机 3 l
+成就奖 27 n
+成就展 3 l
+成就感 96 l
+成山 48 ns
+成岩 44 n
+成岩成 2 nr
+成岩裂缝 3 n
+成己成物 3 l
+成帝 34 n
+成帝业 5 n
+成帝太 2 nr
+成帝河 5 ns
+成帝绥 4 nr
+成帮结队 3 n
+成平 2 n
+成平陆 5 ns
+成年 465 t
+成年人 371 n
+成年古代 3 t
+成年期 20 t
+成年累月 14 l
+成年组 3 n
+成幼文 6 nr
+成幼鱼 2 nr
+成康 7 a
+成建制 32 nr
+成形 209 n
+成形术 15 n
+成形电路 3 n
+成形钳 3 n
+成德文 3 nr
+成德殿 2 nr
+成德达 16 nr
+成心 66 n
+成志明 2 nr
+成思危 260 nr
+成性 3 n
+成总儿 3 nr
+成才 178 n
+成才之路 3 i
+成才率 14 n
+成才观 2 nr
+成批 80 v
+成批出售 3 l
+成批到达 3 l
+成批处理 3 l
+成批生产 3 n
+成报 7 n
+成招办 15 v
+成招科 2 nr
+成掌东 2 nr
+成排 413 v
+成擒 3 v
+成效 1139 a
+成效卓着 3 i
+成效显著 3 n
+成教 28 n
+成教院 3 n
+成数 60 n
+成文 270 n
+成文宪法 3 n
+成文法 95 nr
+成方 270 n
+成方圆 10 nr
+成日 46 t
+成日成夜 3 l
+成昂 3 a
+成昆线 8 nr
+成昆铁路 20 nz
+成昌 4 ns
+成景 2 n
+成服 3 v
+成本 4289 n
+成本上升 3 l
+成本价 36 n
+成本会计 4 n
+成本低 3 n
+成本增加 2 nr
+成本核算 3 n
+成本法 15 n
+成本计划 3 n
+成本计算 3 n
+成本费 10 n
+成本费用 3 n
+成本额 3 n
+成本高 4 n
+成材 58 n
+成材林 3 n
+成束蛋白 3 n
+成林 23 n
+成果 4800 n
+成果奖 71 n
+成果展 4 nr
+成果辉煌 3 i
+成果鉴定 3 n
+成柔田 2 nr
+成核 10 v
+成根素 3 nr
+成欢 2 v
+成正比 3 nr
+成正觉 2 nr
+成武 7 nr
+成武县 5 ns
+成气侯 3 nr
+成气候 17 n
+成汉 7 ns
+成沙 3 ns
+成法 154 n
+成泽 2 n
+成活 33 a
+成活率 30 n
+成济 3 n
+成海陆 2 ns
+成清波 256 nr
+成渝 5 nr
+成渝线 3 nz
+成灾 57 n
+成炫客 12 nr
+成焉耆 2 nr
+成熟 3742 a
+成熟作用 3 n
+成熟土壤 3 i
+成熟度 37 n
+成熟性 8 n
+成熟技术 3 n
+成熟期 76 n
+成熟林 3 n
+成熟酶 3 n
+成燕粉 2 nr
+成片 148 n
+成特定 3 nr
+成玄英 7 nr
+成王败寇 6 n
+成田 17 n
+成电 13 n
+成瘾 84 v
+成瘾性 22 n
+成瘾症 3 n
+成瘾者 3 n
+成百上千 51 i
+成盐元素 3 n
+成真 3 nr
+成真丹 2 nr
+成眠 3 v
+成矿 3 n
+成矿作用 63 n
+成礼 3 v
+成祖优 2 nr
+成祖初 2 nr
+成祖北 3 nr
+成祖大 128 nr
+成祖朱 4 nr
+成祖皇帝 12 nr
+成祖赐 2 nr
+成福 3 a
+成科 3 n
+成稀汁 2 nr
+成穗状 2 n
+成立 14079 v
+成章 18 n
+成竹 3 n
+成竹在胸 54 i
+成笼蛋白 3 n
+成算 12 v
+成算在心 3 n
+成箱 5 n
+成紫黑 2 nr
+成红细胞 3 n
+成约 29 n
+成纯合 2 nr
+成纳 2 v
+成组 44 n
+成组传送 3 nr
+成组技术 7 n
+成细丝 7 n
+成细粉 6 n
+成绩 6217 n
+成绩优秀 3 nr
+成绩优良 3 nr
+成绩册 5 n
+成绩卓著 3 nr
+成绩单 54 n
+成绩及格 3 n
+成绩排名 3 n
+成绩斐然 3 nr
+成绩显著 3 nr
+成绩突出 3 n
+成绩表 3 n
+成绵绢 4 nr
+成群 346 n
+成群作队 3 n
+成群打伙 3 l
+成群结伙 8 l
+成群结党 2 n
+成群结对 2 i
+成群结队 137 i
+成群连片 3 l
+成群逐队 3 n
+成群集党 3 n
+成耀东 63 nr
+成老鸽 2 nr
+成肌细胞 3 n
+成胶状 3 n
+成膜 21 n
+成膜体 3 n
+成自学 3 n
+成色 342 n
+成花刺激 3 l
+成花素 3 n
+成花诱导 3 nr
+成荫 3 n
+成荫子 2 nr
+成药 30 n
+成菊刚 2 nr
+成虚衔 2 nr
+成虫 430 n
+成蝶 2 n
+成行 249 v
+成衣 53 n
+成衣厂 3 n
+成衣展 3 nr
+成衣店 4 n
+成衣铺 3 n
+成见 64 v
+成见太深 3 nr
+成规 188 n
+成训教 2 nz
+成议 4 n
+成语 129 n
+成语手册 3 n
+成语故事 3 i
+成语词典 3 n
+成语辞典 3 n
+成说 57 v
+成诵 3 v
+成象 4 n
+成败 325 v
+成败不计 3 i
+成败兴废 3 i
+成败利钝 24 i
+成败得失 15 i
+成败论 3 n
+成败论人 3 l
+成赫梯 2 nr
+成达 2 v
+成道节 2 n
+成邦江 2 nr
+成都 2770 ns
+成都五牛 20 ns
+成都军区 109 ns
+成都双流机场 2 ns
+成都地区 9 ns
+成都市 216 ns
+成都市个 3 n
+成都市人民政府 5 nt
+成都市委 10 nt
+成都市政府 10 nt
+成都市旅游局 8 nt
+成都平原 68 ns
+成都房产 3 n
+成都旅游 3 nz
+成都日报 3 nz
+成都机票 3 n
+成都王 3 nr
+成都电子科技大学 11 nt
+成都电视台 2 nt
+成都路 2 ns
+成都酒店 3 ns
+成都队 9 n
+成都飞机工业公司 2 nt
+成都飞机工业集团公司 2 nt
+成釉器 3 n
+成釉细胞 3 n
+成金丹 3 nr
+成钢 11 n
+成铁 2 n
+成铁汁 2 nr
+成链状 2 nr
+成锋 2 n
+成键 19 n
+成键轨道 3 n
+成长 5432 v
+成长史 4 n
+成长型 10 n
+成长性 100 n
+成长期 23 n
+成长率 3 n
+成长篇 3 n
+成问题 158 n
+成阳 8 ns
+成阳掌 2 nr
+成陆 5 n
+成雅 2 a
+成霸业 3 n
+成风 45 n
+成风之斫 3 nr
+成骨细胞 3 n
+成髓 3 n
+成髓细胞 3 n
+成高格 2 nr
+成高道人 3 n
+成鱼 43 n
+成鸟羽 2 nr
+成龙 56 nr
+成龙路 2 ns
+成龙配套 7 n
+我 328841 r
+我一语 29 nz
+我中有你 17 l
+我为人人 3 n
+我为歌狂 3 i
+我为鱼肉 6 i
+我们 98740 r
+我们仨 3 n
+我会 1196 n
+我俩 135 r
+我党 129 r
+我党我军 3 n
+我军 1853 n
+我团 3 n
+我国 22114 r
+我国治 3 n
+我型我秀 3 n
+我处 3 r
+我家 1118 r
+我市 279 r
+我心 293 n
+我心依旧 3 i
+我心如秤 3 n
+我方 194 r
+我村 5 r
+我校 823 r
+我武惟扬 3 i
+我爱你 3 l
+我省 529 r
+我行 593 r
+我行我素 55 n
+我见犹怜 5 i
+我负子戴 3 n
+我辈 246 r
+我醉欲眠 3 i
+我队 3 n
+我院 46 n
+我黼子佩 3 v
+戒 1557 n
+戒严 398 n
+戒严令 17 n
+戒严区 3 n
+戒严地区 3 ns
+戒严时期 3 n
+戒严案 3 n
+戒严法 3 n
+戒具 3 n
+戒刀 147 n
+戒勉 3 v
+戒台寺 2 ns
+戒吃 3 v
+戒坛 8 n
+戒坛院 2 nz
+戒备 366 n
+戒备森严 194 i
+戒备状态 3 n
+戒奢宁俭 3 i
+戒娇戒燥 3 i
+戒定慧 3 n
+戒尺 6 n
+戒律 239 n
+戒律清规 3 n
+戒心 98 n
+戒忌 3 n
+戒急用忍 4 i
+戒情人 3 n
+戒惧 78 v
+戒慎 7 a
+戒护 3 v
+戒指 808 n
+戒掉 3 v
+戒断 19 v
+戒条 17 n
+戒毒 66 n
+戒毒所 16 n
+戒毒者 3 n
+戒烟 133 n
+戒烟法 3 n
+戒瘾 3 n
+戒石铭 10 n
+戒网瘾 3 n
+戒色 3 n
+戒菸 3 vn
+戒规 6 n
+戒赌 5 v
+戒酒 43 n
+戒除 35 v
+戒面 3 n
+戒骄戒躁 15 i
+戔 18 zg
+戕 53 zg
+戕害 43 v
+戕贼 3 v
+戕身伐命 3 z
+或 78942 c
+或为 3 c
+或事物 9 n
+或于 3 c
+或以 3 c
+或传感器 2 n
+或则 32 c
+或多或少 343 d
+或大或小 3 d
+或早或晚 3 d
+或明或暗 3 d
+或是 2882 c
+或曰 21 c
+或有 3 c
+或有或无 3 v
+或然 3 c
+或然性 5 n
+或然率 2 n
+或然论 3 c
+或电子邮件 3 n
+或硬件 2 n
+或缺 34 v
+或者 16633 c
+或者说 753 c
+或许 1849 d
+或非 89 c
+或非门 3 n
+戗 60 v
+战 8864 n
+战七捷 22 nr
+战七胜 2 nr
+战三捷 18 nr
+战三胜 2 nr
+战不旋踵 3 i
+战不胜 4 i
+战为业 2 n
+战为奇 3 nr
+战久斗 2 n
+战久议 2 n
+战之兵 4 nr
+战之士 4 nr
+战九捷 3 nr
+战书 25 n
+战乱 857 n
+战争 14823 n
+战争初期 3 n
+战争博弈 3 nr
+战争史 44 n
+战争场面 3 n
+战争时代 3 n
+战争片 3 n
+战争状态 3 n
+战争狂 3 n
+战争罪犯 3 n
+战争论 3 n
+战争贩子 3 n
+战争赔偿 3 n
+战争险 3 n
+战事 550 n
+战于江 2 nr
+战于野 2 nr
+战云 22 n
+战云密布 3 nr
+战五胜 3 nr
+战伤 29 n
+战例 69 n
+战俘 600 n
+战俘营 20 n
+战兢兢 66 i
+战全胜 17 nr
+战六捷 2 nr
+战关胜 3 nr
+战兵 9 n
+战具 13 n
+战军 2 n
+战况 113 n
+战况危急 3 i
+战刀 33 n
+战列舰 157 n
+战利 2 n
+战利品 234 n
+战到 3 v
+战前 220 t
+战前战后 3 i
+战力 46 n
+战力之 3 nr
+战力帆 7 nr
+战力比 3 n
+战力评 2 n
+战力集 2 n
+战功 378 n
+战功卓著 3 i
+战勤 9 n
+战区 969 n
+战友 996 n
+战友情 2 n
+战可擒 2 nr
+战台军 2 n
+战史 120 n
+战后 1252 t
+战吕布 9 nr
+战四胜 14 nr
+战团 47 n
+战国 2735 n
+战国七雄 3 nr
+战国时代 3 n
+战国时期 3 n
+战国策 122 n
+战地 142 n
+战地英雄 3 nr
+战地记者 3 n
+战地钟声 3 i
+战场 3566 n
+战场老将 3 n
+战坦克 94 nr
+战壕 91 n
+战士 3613 n
+战士基因 3 n
+战备 510 n
+战备值班 3 n
+战备动员 3 n
+战备品 3 n
+战备等级 3 n
+战备训练 3 n
+战大胜 4 nr
+战天斗地 3 n
+战威 3 n
+战孙立 2 nr
+战守之 10 nr
+战守皆 2 nr
+战实 3 n
+战宣泰 2 nr
+战将 141 n
+战小龙 2 nr
+战局 363 n
+战幕 59 n
+战平 91 n
+战弥励 2 nr
+战强敌 2 i
+战役 2785 n
+战役学 19 n
+战得 3 v
+战得胜 5 nr
+战必先 3 nr
+战必危 5 i
+战情 12 n
+战情报告 3 n
+战情报导 3 n
+战愈勇 6 nr
+战意 16 n
+战意成 2 v
+战成 86 v
+战战业业 3 n
+战战兢兢 231 i
+战战惶惶 3 i
+战战栗栗 3 i
+战技 20 n
+战技术 22 n
+战抖 37 v
+战报 70 n
+战数合 2 n
+战斗 6027 vn
+战斗人员 3 n
+战斗任务 3 n
+战斗侦察 3 n
+战斗保障 3 n
+战斗准备 3 n
+战斗出动 3 n
+战斗分队 3 n
+战斗力 1218 n
+战斗化 3 n
+战斗区 3 n
+战斗历程 3 n
+战斗原则 3 n
+战斗员 31 n
+战斗序列 3 n
+战斗性 46 n
+战斗性能 3 n
+战斗意志 3 n
+战斗指挥 3 n
+战斗支援 3 n
+战斗故事 3 n
+战斗教令 3 n
+战斗服 3 n
+战斗机 2525 n
+战斗条令 3 n
+战斗概则 3 i
+战斗活动 3 n
+战斗班 3 n
+战斗疲劳 3 i
+战斗编组 3 n
+战斗群 3 n
+战斗者 10 n
+战斗能力 3 n
+战斗舰 60 n
+战斗舰艇 3 nr
+战斗英雄 3 n
+战斗行为 3 n
+战斗行动 3 n
+战斗详报 3 nr
+战斗转场 3 n
+战斗轰炸 3 i
+战斗运用 3 n
+战斗部 232 n
+战斗部队 3 n
+战斗队 75 n
+战斗队形 3 n
+战斧 108 n
+战方能 2 n
+战旗 15 n
+战无不克 3 i
+战无不胜 72 i
+战无常规 3 i
+战时 23 t
+战明军 7 nr
+战服 3 n
+战术 2753 n
+战术学 23 n
+战术导弹 3 n
+战术思维 3 n
+战术性 15 n
+战术情报 2 n
+战术轰炸 3 i
+战机 2128 n
+战李应 2 n
+战果 358 n
+战果辉煌 3 i
+战栗 134 n
+战棋 3 n
+战歌 25 n
+战止战 2 n
+战死 409 n
+战死沙场 3 n
+战法 302 n
+战洪州 2 nr
+战火 451 n
+战火纷飞 14 i
+战炮 4 n
+战犯 215 n
+战甲 5 n
+战略 10013 n
+战略伙伴 3 n
+战略决策 3 n
+战略区 18 n
+战略地位 3 n
+战略学 21 n
+战略家 62 n
+战略思想 3 n
+战略思维 3 n
+战略性 283 n
+战略情报 8 n
+战略意义 3 n
+战略战术 3 n
+战略方针 3 n
+战略武器 3 n
+战略版 3 n
+战略物资 42 n
+战略目标 3 n
+战略眼光 3 n
+战略空军 3 n
+战略要地 3 n
+战略规划 3 n
+战略转移 3 n
+战略轰炸 3 i
+战略部 5 n
+战略部署 3 n
+战略重点 3 n
+战略防御 3 nr
+战皆墨 3 nr
+战皆捷 7 nr
+战皆胜 4 nr
+战祝彪 2 nr
+战神 69 n
+战神油 3 n
+战神王 3 n
+战祸 55 n
+战秦军 2 nr
+战秦明 4 nr
+战秦琼 4 nr
+战端 3 n
+战策 2 n
+战精兵 2 nr
+战索索 2 nr
+战纹鉴 2 n
+战线 1249 n
+战绩 478 n
+战绩辉煌 3 nr
+战网 3 n
+战罢 46 v
+战而胜 9 i
+战胜 2342 n
+战胜国 325 n
+战胜者 9 n
+战舰 486 n
+战船 339 n
+战艇 3 n
+战苻坚 3 nr
+战衣 3 n
+战表 3 n
+战袍 65 n
+战警 3 n
+战训本 2 n
+战讯 3 n
+战记 3 n
+战评 3 n
+战象 2 n
+战败 645 n
+战败国 35 n
+战败者 29 n
+战费 3 vn
+战赢 3 n
+战车 906 n
+战车团 4 n
+战输 3 vn
+战辽国 4 nr
+战连胜 5 nr
+战速胜 4 n
+战队 3 n
+战阵 168 n
+战雷 2 n
+战雷头 3 n
+战靴 12 n
+战飞羽 3 nr
+战马 630 n
+战鹰 42 n
+战鹰列 3 nr
+战鹰型 2 n
+战黄忠 2 nr
+战鼓 139 n
+戙 73 zg
+戚 335 nr
+戚其章 4 nr
+戚冠军 3 nr
+戚务生 3 nr
+戚县 3 ns
+戚友 3 nr
+戚向东 3 nr
+戚墅堰 6 ns
+戚墅堰区 3 ns
+戚大帅 13 nr
+戚夫人 20 nr
+戚姑娘 2 nr
+戚家军 54 nr
+戚家庄 5 nr
+戚将军 7 nr
+戚小姐 3 nr
+戚属 3 nr
+戚属狄 16 nr
+戚师叔 10 nr
+戚师弟 13 nr
+戚庄田 2 nr
+戚德良 9 nr
+戚总兵 2 nr
+戚戚 10 nr
+戚戚具尔 3 nr
+戚戚君 2 nr
+戚戚焉 3 nr
+戚戚然 2 nr
+戚族 3 nr
+戚明珠 3 nr
+戚晓光 3 nr
+戚景通 6 nr
+戚本禹 26 nr
+戚秀玉职业介绍所 4 nr
+戚继光 471 nr
+戚美珍 3 nr
+戚芳剪 2 nr
+戚芳叹 2 nr
+戚芳奔 2 nr
+戚芳心 3 nr
+戚芳来 2 nr
+戚芳笑 4 nr
+戚芳见 4 nr
+戚谊 4 nr
+戚镖头 2 vn
+戚长发 111 nr
+戛 79 zg
+戛戛独造 3 v
+戛然 3 i
+戛然而止 55 i
+戛玉敲冰 3 i
+戛玉敲金 3 i
+戛玉锵金 3 i
+戛玉鸣金 3 i
+戛纳 138 ns
+戛釜撞瓮 3 i
+戜 664 zg
+戝 832 zg
+戞 480 zg
+戟 1004 ng
+戟指嚼舌 3 n
+戟指怒目 3 nr
+戠 477 zg
+戡 15 vg
+戡乱 11 v
+戡乱时期 3 v
+戡定 3 v
+戢 28 nr
+戢鳞委翼 3 nz
+戢鳞潜翼 3 nz
+戣 418 zg
+戤 3 g
+戥 15 zg
+戦 153 zg
+截 1441 v
+截下 3 v
+截住 277 v
+截儿 2 n
+截击 147 v
+截击机 34 n
+截去 3 v
+截发剉稾 3 v
+截发留客 3 i
+截发留宾 3 i
+截取 35 v
+截口 3 v
+截和补短 3 i
+截回 3 v
+截图 16 v
+截头 3 v
+截夺 3 v
+截子 3 n
+截尾 3 v
+截开 3 v
+截弯取直 3 i
+截拦 3 v
+截拳道 3 i
+截掉 3 v
+截收 16 v
+截断 327 v
+截断众流 3 i
+截断值 3 n
+截断误差 3 i
+截杀 63 v
+截根术 3 n
+截止 2547 v
+截止日 7 i
+截止期 2 n
+截止波导 3 i
+截止波长 3 i
+截止阀 2 n
+截止频率 3 n
+截流 72 v
+截然 193 d
+截然不同 516 i
+截煤机 3 n
+截球 3 n
+截留 67 v
+截留细胞 3 n
+截留酶 3 n
+截瘫 15 v
+截稿 8 v
+截肢 42 n
+截胫剖心 3 z
+截至 1780 v
+截获 124 v
+截趾适履 3 n
+截趾適履 3 n
+截距 3 v
+截辕杜辔 3 i
+截铁斩钉 3 i
+截锥 3 n
+截镫留鞭 3 nr
+截长补短 5 i
+截门 3 v
+截面 167 v
+截面图 2 i
+截面积 5 n
+戬 5 g
+戮 193 zg
+戮伤 3 i
+戮力 3 i
+戮力一心 3 i
+戮力同心 14 i
+戮力回天 3 i
+戮力壹心 3 z
+戮力齐心 3 i
+戮破 3 i
+戯 264 zg
+戰 4 zg
+戳 1285 v
+戳伤 3 v
+戳儿 3 n
+戳入 3 v
+戳力同心 3 n
+戳印 3 v
+戳子 3 n
+戳心 3 v
+戳心灌髓 3 n
+戳戳 3 n
+戳戳看 3 v
+戳无路儿 3 n
+戳破 35 v
+戳穿 36 v
+戳穿脊梁 3 n
+戳脊梁骨 3 n
+戳记 11 v
+戳透 3 v
+戴 4398 v
+戴上去 3 l
+戴上来 3 nr
+戴下去 3 l
+戴下来 3 l
+戴之功 2 nr
+戴之缨 2 nr
+戴于右 2 nr
+戴云山 3 nr
+戴亚耶亚 3 nr
+戴伯特 2 nr
+戴佩妮 3 nr
+戴修亭 3 nr
+戴假发 3 nr
+戴克里 47 nr
+戴冠 3 nr
+戴凤翔 4 nr
+戴出去 3 l
+戴出来 3 l
+戴原礼 2 nr
+戴反 3 v
+戴发含牙 3 nr
+戴发含齿 3 nr
+戴叔伦 5 nr
+戴名世 2 nr
+戴圆履方 3 nr
+戴圣线 2 nr
+戴坏 3 v
+戴士衡 3 nr
+戴复古 3 nr
+戴够 3 v
+戴大夫 4 nr
+戴天子 2 nr
+戴天履地 3 nr
+戴天恩 2 nr
+戴天蹐地 3 v
+戴头识脸 3 l
+戴奥辛 3 nr
+戴姆勒 54 nr
+戴娆 3 i
+戴娇倩 3 nr
+戴孝 21 nr
+戴季陶 11 nr
+戴学稷 2 nr
+戴安娜 56 nr
+戴安澜 12 nr
+戴安芬 2 nr
+戴安邦 2 nr
+戴宗传 2 nr
+戴宗便 9 nr
+戴宗兄弟 2 nr
+戴宗先 4 nr
+戴宗再 3 nr
+戴宗取 2 nr
+戴宗同 2 nr
+戴宗告 2 nr
+戴宗回 5 nr
+戴宗引 5 nr
+戴宗往 2 nr
+戴宗报 2 nr
+戴宗接 2 nr
+戴宗来 4 nr
+戴宗笑 7 nr
+戴宗纳 2 nr
+戴宗自 6 nr
+戴宗见 2 nr
+戴宗道 3 nr
+戴宗遵 4 nr
+戴宗问 2 nr
+戴宗随 2 nr
+戴宗面 2 nr
+戴宝冠 2 nr
+戴家干 4 nr
+戴密微 7 nr
+戴尔 293 nr
+戴尔公司 71 nr
+戴帽 3 nz
+戴帽子 14 nr
+戴平天 2 nr
+戴平巾 2 nr
+戴得牢 2 nr
+戴德迈 5 nr
+戴德金 19 nr
+戴志伟 3 nr
+戴戈考 2 nr
+戴敦邦 8 nr
+戴文赛 3 nr
+戴文郡 3 nr
+戴方巾 3 nr
+戴族 2 nz
+戴日戴斗 3 i
+戴星冠 3 nr
+戴春华 3 nr
+戴春荣 3 nr
+戴晨志 2 nr
+戴月披星 3 nr
+戴月琴 3 nr
+戴月轩 2 nr
+戴望舒 13 nr
+戴本孝 3 nr
+戴村坝 2 nr
+戴来戴去 3 i
+戴松恩 2 nr
+戴柏特 3 nr
+戴校本 8 nr
+戴桃形 2 nr
+戴梦得 3 nr
+戴永明 6 nr
+戴汝为 2 nr
+戴河流 2 nr
+戴法兴 10 nr
+戴清履浊 3 nr
+戴爱玲 3 nr
+戴爱莲 5 nr
+戴牢 3 nr
+戴玄履黄 3 nr
+戴玉衡 3 nr
+戴琳改 2 nr
+戴生昌 2 nr
+戴白 2 nr
+戴皇帝 2 nr
+戴盆望天 3 nr
+戴相龙 34 nr
+戴眉含齿 3 i
+戴眼镜 8 nr
+戴石麟 3 nr
+戴碧蓉 16 nr
+戴礼记 9 nr
+戴禹鸣 4 nr
+戴秉国 13 nr
+戴立狄 16 nr
+戴笠乘车 3 ns
+戴笠故交 3 nr
+戴粹伦 2 nr
+戴素芬 3 nr
+戴紫金 3 nr
+戴红冠 2 nr
+戴红巾 2 nr
+戴纶巾 6 nr
+戴维南 7 nr
+戴维因 4 nr
+戴维孙 6 nr
+戴维季 3 nr
+戴维思 2 nr
+戴维才 2 nr
+戴维斯 94 nr
+戴维斯杯 5 nz
+戴维森 40 nr
+戴维能 4 nr
+戴维营 22 nr
+戴绿帽 2 nz
+戴绿帽子 12 nr
+戴罗格 2 nr
+戴罪立功 29 nr
+戴翔翎 2 nr
+戴胜 3 nr
+戴胜科 2 nr
+戴花翎 5 nr
+戴苏理 3 nr
+戴英禄 2 nr
+戴荆冠 2 nr
+戴莱洛 7 nr
+戴蒙哥 3 nr
+戴表 3 nr
+戴裔煊 3 nr
+戴解平 2 nr
+戴证良 256 nr
+戴起来 3 l
+戴软纱 2 nr
+戴过去 3 l
+戴过来 3 l
+戴进去 3 nr
+戴进来 3 nr
+戴逍遥 2 nr
+戴金冠 2 nr
+戴金凤 2 nr
+戴金花 2 nr
+戴铁罩 3 nr
+戴闯王 2 nr
+戴震尤 2 nr
+戴震著 2 nr
+戴霜履冰 3 nr
+戴青巾 2 nr
+戴静华 2 nr
+戴面具 3 l
+戴面纱 2 nr
+戴顶帽子 3 nr
+戴香叶 2 nr
+戴高乐 150 nr
+戴高冠 7 nr
+戴高帽 3 nz
+戴高帽儿 3 nr
+戴高帽子 20 nr
+戴鸿慈 3 nr
+戴黄巾 2 nr
+户 4053 q
+户下 3 s
+户主 52 n
+户内 20 s
+户内运动 3 nz
+户办 2 j
+户勤区 3 n
+户县 25 ns
+户口 1072 n
+户口册 3 n
+户口卡 3 n
+户口名簿 3 n
+户口普查 3 nr
+户口本 24 n
+户口簿 36 n
+户口誊本 3 vn
+户口调查 3 nr
+户名 8 n
+户告人晓 3 nz
+户均 34 j
+户型 34 n
+户型图 3 n
+户外 262 s
+户外媒体 3 n
+户外工作 3 n
+户外广告 3 n
+户外活动 3 n
+户外用品 3 n
+户外运动 3 nz
+户头 34 n
+户孝允 3 nr
+户庭 3 n
+户愚吕 3 nr
+户户 42 n
+户政 3 n
+户政事务 3 n
+户政科 3 n
+户数 54 n
+户曹参军 3 nr
+户枢不朽 3 n
+户枢不蠹 2 n
+户牖 4 n
+户田 13 n
+户籍 618 n
+户籍制度 3 n
+户籍地 3 n
+户籍管理 3 n
+户籍誊本 3 vn
+户籍警 5 n
+户给人足 3 n
+户调 3 n
+户部 1443 n
+户部司 3 n
+户长 22 n
+户限 3 n
+户限为穿 3 i
+户额 3 n
+户齐民 2 nr
+戽 4 zg
+戾 89 zg
+房 6407 n
+房一厅 2 nr
+房东 129 n
+房东太太 3 nr
+房中 902 s
+房中兵 3 j
+房中冲 2 nr
+房中寻 3 nr
+房中斗 3 nr
+房中术 16 j
+房中柯 2 nr
+房中跃 2 nr
+房主 57 n
+房之宠 4 nr
+房书办 2 n
+房事 108 n
+房交会 6 j
+房产 372 j
+房产业 3 n
+房产主 3 n
+房产交易 3 n
+房产信息 3 n
+房产公司 3 n
+房产商 7 n
+房产局 3 j
+房产科 3 j
+房产税 3 j
+房产纠纷 3 z
+房产网 3 n
+房产证 16 j
+房产资讯 3 n
+房产频道 3 n
+房价 655 n
+房价格 3 n
+房儿 2 n
+房克尔 3 nr
+房全功 4 nr
+房内 5 s
+房内束 2 n
+房凤友 3 nr
+房出租 3 n
+房利美 11 nr
+房前 69 s
+房博会 3 j
+房卡 12 n
+房县 841 ns
+房号 9 n
+房地 17 n
+房地产 1603 j
+房地产业 81 j
+房地产商 62 j
+房地产权 4 j
+房地产权证 3 j
+房地产法 3 j
+房地产热 23 n
+房地产界 4 j
+房地产股 3 j
+房地价 3 n
+房地契 3 nr
+房地局 3 j
+房址 2 n
+房均九 4 nr
+房坡 13 n
+房型 7 n
+房型图 3 n
+房基 536 n
+房塔塔 2 nr
+房太太 3 nr
+房契 13 nr
+房奴 4 n
+房委会 3 j
+房子 3194 n
+房学度 2 n
+房安寝 2 nr
+房客 46 j
+房室 68 n
+房宿 4 n
+房屋 1870 n
+房屋中介 3 nr
+房屋买卖 3 n
+房屋交易 3 n
+房屋产权 3 n
+房屋信息 3 n
+房屋修护 3 nr
+房屋内 3 nr
+房屋出租 3 n
+房屋建筑 3 n
+房屋结构 3 n
+房屋设计 3 n
+房屋贷款 3 n
+房屋里 3 nr
+房展 13 j
+房展会 3 n
+房山 84 n
+房山区 36 ns
+房山寨 2 nr
+房山石 3 nr
+房州 6 ns
+房市 19 j
+房市场 3 n
+房市网 3 n
+房帖 3 n
+房式 3 n
+房式仓 3 nr
+房志起 2 nr
+房性 3 n
+房性早搏 3 nr
+房扑 3 n
+房捐 3 n
+房改 63 j
+房改办 3 j
+房改房 3 j
+房方 3 n
+房日兔 6 nr
+房明明 2 nr
+房易网 3 n
+房月狐 2 nz
+房梁 48 n
+房棘球 4 n
+房楣 3 n
+房檐 79 n
+房款 21 n
+房水 14 n
+房法寿 2 nr
+房游 2 j
+房源 31 n
+房炼成 2 nr
+房玄龄 57 nr
+房盖 2 n
+房祖名 2 n
+房租 164 n
+房租费 4 n
+房立阳 2 nr
+房管 145 j
+房管员 3 n
+房管局 144 j
+房管所 6 j
+房管科 3 j
+房脊 8 n
+房舍 211 n
+房舱 10 n
+房角 6 j
+房谋断新 3 n
+房谋杜断 3 nr
+房贴 3 n
+房贷 159 j
+房贷利率 3 n
+房贷部 2 j
+房贷险 3 j
+房费 13 n
+房车 8 n
+房车赛 3 n
+房辑佚 9 nr
+房遗爱 2 nr
+房里 836 s
+房里兵 2 nr
+房里呆 3 nr
+房钱 24 n
+房门 744 n
+房门口 52 n
+房间 2489 n
+房间内 3 n
+房间常数 3 n
+房间数 3 n
+房间隔 4 n
+房院 3 j
+房陵 3 n
+房顶 126 n
+房颤 3 n
+房鱼贯 2 nr
+房龄 2 n
+所 76462 c
+所为 300 c
+所云 3 n
+所交 3 b
+所付 3 v
+所以 29396 c
+所以然 55 i
+所传 3 b
+所伤 3 v
+所作 3 n
+所作所为 326 i
+所写 3 v
+所出 3 v
+所分 3 n
+所列 3 b
+所创 3 n
+所到 3 v
+所到之处 318 l
+所剩 3 v
+所剩无几 70 i
+所办 3 v
+所加 3 v
+所务 3 b
+所务会 3 n
+所动 3 b
+所及 3 c
+所发 3 v
+所取 3 v
+所受 3 v
+所变 3 v
+所叙 3 v
+所向 79 b
+所向克捷 3 n
+所向披靡 50 i
+所向无前 2 i
+所向无敌 59 i
+所向皆靡 3 i
+所含 3 v
+所售 3 v
+所困 3 b
+所在 2800 b
+所在之处 3 i
+所在位置 3 n
+所在区 3 n
+所在区域 3 n
+所在单位 3 n
+所在国 58 n
+所在地 2962 n
+所在城市 3 n
+所在皆是 3 i
+所填 3 v
+所处 3 n
+所存 3 v
+所学 601 n
+所属 2434 b
+所属单位 3 n
+所帖 3 n
+所干 3 n
+所幸 98 n
+所应 3 v
+所建 3 v
+所当无敌 3 i
+所征 3 n
+所得 1004 v
+所得税 250 n
+所得税法 3 n
+所得税率 8 n
+所得者 8 n
+所得额 16 n
+所思 42 n
+所恶 3 n
+所想 3 n
+所感 58 n
+所愿 3 n
+所托 3 b
+所托非人 3 n
+所扣 3 n
+所持 3 v
+所指 794 n
+所撰 3 v
+所料 3 n
+所无 3 b
+所是 3 c
+所有 17464 b
+所有主 12 n
+所有人 796 n
+所有制 695 n
+所有权 699 n
+所有权状 3 n
+所有权证 13 n
+所有格 5 n
+所有物 109 n
+所有者 957 c
+所服 3 n
+所欠 3 n
+所欲 40 n
+所求 103 n
+所涉 3 v
+所爱 3 b
+所犯 3 n
+所生 3 b
+所用 1131 b
+所画 3 n
+所着 3 c
+所知 1267 v
+所示 3 v
+所称 3 v
+所立 3 b
+所签 3 n
+所管 3 c
+所累 3 v
+所经 3 b
+所罗门 60 ns
+所罗门王 3 nrt
+所罗门美邦 2 ns
+所罗门群岛 64 ns
+所耗 3 n
+所能 3 v
+所至 3 c
+所致 826 c
+所花 3 n
+所要 3 b
+所见 3 c
+所见即 3 d
+所见所闻 80 i
+所见略同 3 i
+所见者 7 n
+所言 3 c
+所言非虚 3 i
+所讲 3 c
+所设 3 v
+所译 3 b
+所误 3 n
+所说 3307 c
+所谓 7657 b
+所谓何来 3 nz
+所购 3 v
+所费 3 n
+所费不赀 2 i
+所载 3 b
+所辖 3 n
+所运 3 n
+所迫 3 v
+所述 3 b
+所选 3 v
+所道 3 n
+所部 281 n
+所里 54 n
+所长 2015 n
+所闻 3 n
+所闻所见 3 i
+所附 3 v
+所限 3 n
+所需 3 n
+扁 1479 a
+扁圆 21 n
+扁圆形 284 n
+扁壶 3 n
+扁头 3 n
+扁字 3 n
+扁帽 3 n
+扁平 329 n
+扁平化 13 nr
+扁平封装 3 b
+扁平电缆 3 n
+扁平疣 7 n
+扁平脚 3 z
+扁平苔藓 3 n
+扁平足 11 z
+扁形 3 b
+扁形动物 23 l
+扁扁的 14 z
+扁担 163 n
+扁柏 9 nr
+扁桃 22 n
+扁桃体 51 n
+扁桃体炎 34 n
+扁桃腺 8 n
+扁桃腺炎 3 n
+扁率 11 n
+扁舟 37 n
+扁蓄 3 n
+扁豆 49 n
+扁豆花 3 n
+扁钢 3 n
+扁铁 3 n
+扁铲 128 n
+扁锉 3 n
+扁长 3 n
+扁额 3 b
+扁食 3 n
+扁骨 7 n
+扁鱼 3 n
+扁鲨 3 n
+扁鹊 39 nr
+扃 7 zg
+扆 28 zg
+扇 2826 q
+扇入 3 n
+扇出限制 3 n
+扇动 35 n
+扇动翅膀 3 n
+扇区 4 n
+扇千 3 n
+扇坠 13 n
+扇坠儿 3 n
+扇子 433 n
+扇子舞 3 n
+扇席温枕 3 n
+扇开 3 v
+扇形 277 n
+扇形理论 3 n
+扇形论 3 n
+扇惑 3 v
+扇扇子 3 n
+扇枕温席 3 i
+扇枕温被 3 i
+扇火 3 n
+扇火止沸 3 i
+扇炉子 3 n
+扇状 3 n
+扇舞 3 n
+扇贝 47 n
+扇起 3 v
+扇起来 3 v
+扇车 7 n
+扇门 3 n
+扇阴风 3 n
+扇面 100 n
+扇面儿 3 n
+扇面墙 3 n
+扇风 3 n
+扇风机 3 n
+扇风点火 3 i
+扇骨 28 n
+扇骨子 3 n
+扈 57 nr
+扈三娘 65 nr
+扈从 66 n
+扈太公 3 nr
+扈家庄 14 nr
+扈成那 2 nr
+扈氏战 2 nr
+扈特人 2 nr
+扈特旗 4 nr
+扈驾亲 3 nr
+扈驾南 2 nr
+扉 28 n
+扉用 3 n
+扉画 3 n
+扉页 38 n
+手 28466 n
+手三里 3 n
+手上 1940 s
+手下 1419 s
+手下人 265 n
+手下无情 3 i
+手下留情 75 n
+手下败将 3 i
+手不停挥 3 v
+手不停毫 3 i
+手不应心 3 i
+手不释书 3 i
+手不释卷 14 i
+手中 6721 s
+手中无权 3 l
+手中有权 3 n
+手串 2 n
+手书 211 n
+手书字 3 n
+手五里 3 i
+手令 3 n
+手信 3 n
+手倒立 3 i
+手儿 3 n
+手册 229 n
+手写 55 n
+手写体 13 n
+手写板 3 n
+手写笔 3 n
+手写输入 3 n
+手刃 3 n
+手刃仇人 3 i
+手则 3 n
+手创 3 n
+手到拈来 3 i
+手到拿来 20 l
+手到擒来 62 l
+手到病除 13 i
+手制 3 n
+手制动 3 n
+手制动器 3 n
+手刹 3 n
+手刻 3 n
+手刻工 3 n
+手力 3 n
+手动 172 n
+手动幕 3 n
+手动式 3 n
+手动挡 3 n
+手动档 3 b
+手动液压 3 n
+手劲 82 n
+手劲儿 2 n
+手势 737 n
+手势语 2 i
+手勤 3 n
+手包 2 n
+手包着 3 l
+手印 121 n
+手卷 17 n
+手压 14 n
+手压式 3 n
+手参 3 n
+手喻 3 n
+手塚治虫 3 v
+手壷纬 3 n
+手外科 15 n
+手头 245 n
+手头上 3 n
+手头不便 3 i
+手头字 3 n
+手头紧 9 l
+手夹 3 n
+手夹着 3 l
+手套 231 n
+手套厂 3 n
+手少阴心经 12 i
+手工 733 n
+手工业 1521 n
+手工业者 220 n
+手工制造 3 n
+手工劳动 3 l
+手工操作 3 n
+手工整理 3 n
+手工艺 74 n
+手工艺品 117 n
+手工艺者 4 n
+手工课 2 n
+手工费 3 n
+手工钱 3 n
+手巧 8 n
+手巾 107 n
+手帕 533 n
+手底下 41 s
+手弹 3 n
+手弹式 3 n
+手心 242 n
+手心儿 2 n
+手忙脚乱 294 i
+手快 26 v
+手急眼快 3 i
+手性 3 n
+手性助剂 3 n
+手性子 3 n
+手性诱导 3 nz
+手感 87 n
+手慌脚忙 3 i
+手慢 3 n
+手戳 4 n
+手扒肉 3 i
+手扒鸡 3 i
+手执 3 v
+手扳 6 n
+手扶 56 b
+手扶拖拉机 81 n
+手技 2 n
+手抄 34 n
+手抄报 3 n
+手抄本 82 n
+手把 92 n
+手把手 36 n
+手抱着 3 l
+手拉 3 n
+手拉式 3 n
+手拉手 52 n
+手拙 3 a
+手拷 3 v
+手拿着 3 l
+手持 913 v
+手持式 15 n
+手持机 3 n
+手持着 3 n
+手指 2516 n
+手指头 269 n
+手指套 3 n
+手指字母 3 n
+手指尖 19 n
+手指支持 3 v
+手指甲 34 n
+手指画 3 n
+手指缝 3 n
+手指语 3 nz
+手挥目送 3 n
+手挽手 3 i
+手挽袋 3 i
+手掌 1470 n
+手掌心 73 n
+手掌机 3 n
+手控 10 b
+手推 27 b
+手推式 3 n
+手推磨 3 n
+手推车 36 n
+手提 237 n
+手提包 35 n
+手提式 21 n
+手提电脑 3 n
+手提皮箱 3 n
+手提箱 15 n
+手提袋 17 n
+手握 3 v
+手握手 3 n
+手握着 3 n
+手握胜券 3 n
+手搭凉棚 9 n
+手携手 6 b
+手摇 100 b
+手摇式 7 b
+手摇泵 3 n
+手摇钻 3 v
+手摇风琴 3 i
+手摸 3 v
+手斧 18 n
+手旗 3 n
+手无寸刃 3 i
+手无寸铁 174 i
+手有余香 3 n
+手本 75 n
+手札 12 n
+手术 3305 n
+手术中间 3 n
+手术刀 25 n
+手术台 40 n
+手术台上 3 n
+手术器 2 n
+手术器械 3 n
+手术学 2 n
+手术室 99 n
+手术床 3 n
+手术房 3 n
+手术灯 7 n
+手术费 14 n
+手术过程 3 n
+手术部 3 n
+手术钳 3 n
+手机 4789 n
+手机信号 3 n
+手机卡 20 n
+手机号 39 n
+手机号码 3 n
+手机城 3 n
+手机套 2 n
+手机带 3 n
+手机店 3 n
+手机操作系统 6 l
+手机擦 3 l
+手机游戏 53 n
+手机玩家 3 n
+手机用户 3 n
+手机电池 3 n
+手机短信 3 nz
+手机网 3 n
+手机芯片 3 n
+手机袋 3 n
+手机费 16 n
+手机软件 3 n
+手机配件 3 n
+手机链 3 n
+手机门户 3 n
+手杖 79 n
+手松 3 n
+手板 21 n
+手枪 517 n
+手枪套 3 n
+手枪弹 3 n
+手枷 3 n
+手柄 52 n
+手植 4 v
+手榴弹 364 n
+手模 3 n
+手段 6991 n
+手段恶劣 3 n
+手段毒辣 3 l
+手民 3 n
+手气 47 n
+手法 1886 n
+手法主义 3 n
+手泽 3 n
+手泽之遗 3 i
+手活 2 n
+手淫 31 v
+手滑心慈 3 nz
+手炉 27 n
+手煞车 3 i
+手熟 3 n
+手爪 3 n
+手版 3 n
+手牵手 3 i
+手牵着 3 l
+手环 3 n
+手球 75 n
+手球员 3 n
+手球场 3 n
+手生 3 n
+手用 3 n
+手用器械 3 n
+手电 111 n
+手电筒 348 n
+手疾眼快 11 i
+手痒 26 v
+手癣 5 n
+手皮包 3 n
+手相 50 n
+手相术 3 n
+手眼 13 n
+手眼通天 9 i
+手示 3 v
+手稿 231 n
+手笔 70 n
+手简 3 n
+手紧 14 v
+手纸 26 n
+手纸盒 3 n
+手纹 3 n
+手织 7 n
+手绘 16 n
+手绘鞋 3 n
+手绢 162 n
+手绣 4 n
+手续 1651 v
+手续费 232 n
+手续费收 3 n
+手肉 3 n
+手肘 129 n
+手背 139 n
+手胼足胝 3 n
+手脘 3 n
+手脚 1010 n
+手脚俐落 3 i
+手脚冰凉 3 i
+手脚利索 3 n
+手脚干净 3 i
+手脚无措 2 i
+手腕 1213 n
+手腕子 13 n
+手腕带 3 n
+手膀 3 n
+手臂 1944 n
+手舞足蹈 117 i
+手艺 481 n
+手艺业 3 n
+手艺人 94 n
+手表 324 n
+手表带 3 n
+手袋 28 n
+手袋厂 3 n
+手订 3 v
+手记 70 n
+手译 3 n
+手语 24 n
+手误 3 n
+手谈 17 v
+手谕 100 n
+手起刀落 3 i
+手足 840 v
+手足之情 31 i
+手足失措 9 i
+手足异处 3 i
+手足情深 3 i
+手足无措 208 i
+手足癣 3 n
+手足胼胝 3 n
+手足重茧 3 n
+手车 3 n
+手轮 6 n
+手软 115 n
+手轻 22 v
+手边 97 s
+手迹 70 n
+手部 49 n
+手里 4583 s
+手里剑 3 n
+手重 3 n
+手钩 5 n
+手钳 3 n
+手钻 2 n
+手铐 168 n
+手链 12 n
+手锣 3 n
+手锯 3 n
+手镜 3 n
+手镯 91 n
+手闸 3 n
+手零脚碎 3 i
+手雷 31 n
+手面 18 n
+手颤 3 n
+手风 3 n
+手风琴 38 n
+手饰匣 3 n
+手骨 3 n
+手高手低 3 i
+手高眼低 3 i
+手鼓 17 n
+扌 21 zg
+才 55415 d
+才仁旺 3 nr
+才会赢 3 n
+才俊 15 nr
+才兼文武 3 nr
+才刚 90 d
+才前貌后 3 i
+才力 18 n
+才勉力 2 nr
+才华 374 nr
+才华出众 3 i
+才华横溢 52 i
+才华洋溢 3 i
+才华盖世 3 i
+才华超众 3 nr
+才占八斗 3 i
+才器 3 n
+才墨之薮 3 n
+才多识寡 3 l
+才大如海 3 i
+才大难用 3 l
+才夸八斗 3 i
+才女 45 n
+才姗姗 2 nr
+才子 193 n
+才子佳人 25 nr
+才学 83 n
+才学兼优 3 i
+才尽其用 4 i
+才干 166 n
+才广妨身 3 vn
+才德 3 nr
+才德兼备 2 nr
+才德胜 16 nr
+才思 12 n
+才思敏捷 16 nr
+才情 85 n
+才挺剑 2 nr
+才旦卓玛 4 nr
+才智 166 nr
+才智儿童 3 l
+才望高雅 3 i
+才欢然 2 i
+才气 25 n
+才气十足 3 i
+才气无双 3 i
+才气横溢 6 i
+才气纵横 3 l
+才气过人 6 l
+才源 3 n
+才略 50 n
+才略过人 3 n
+才疏学浅 15 i
+才疏德薄 3 nr
+才疏志大 3 i
+才疏意广 3 i
+才疏计拙 3 i
+才知丹 2 nr
+才短思涩 3 i
+才短气粗 3 i
+才秀人微 3 i
+才纳 3 v
+才能 1847 v
+才能救 3 v
+才艺 98 n
+才艺卓绝 3 i
+才艺超 2 nr
+才蔽识浅 3 i
+才薄智浅 3 i
+才识 106 n
+才识过人 3 l
+才貌 29 n
+才貌两全 3 i
+才貌俱全 3 i
+才貌兼全 3 i
+才貌出众 3 i
+才貌双全 27 i
+才貌双绝 3 i
+才贯二酉 3 nr
+才轻德薄 3 i
+才过屈宋 3 nr
+才高七步 3 i
+才高八斗 16 i
+才高意广 3 i
+才高气清 3 l
+才高行厚 3 i
+才高行洁 3 nr
+才高识远 3 l
+才高运蹇 3 i
+扎 2928 v
+扎上去 3 v
+扎上来 3 v
+扎下去 3 v
+扎下来 3 v
+扎什伦布 2 nrt
+扎什伦布寺 21 ns
+扎以尔 3 nr
+扎伊尔 259 nrt
+扎伊尔共和国 7 ns
+扎伊德 8 nrt
+扎克 9 nrt
+扎入 3 v
+扎兰屯 8 ns
+扎兰屯市 6 ns
+扎制 13 v
+扎加洛 3 ns
+扎勒 3 nrt
+扎卡 3 nrt
+扎卡维 3 nr
+扎卡里 3 nrt
+扎吉 3 nrt
+扎哏 3 v
+扎啤 3 n
+扎囊县 5 ns
+扎堆 43 ns
+扎堆儿 6 v
+扎好 3 a
+扎姆 2 nrt
+扎娜 2 nrt
+扎实 469 a
+扎寨 3 ns
+扎小辫 3 n
+扎尔 5 nrt
+扎尔科 4 nrt
+扎巴 4 nrt
+扎布 26 v
+扎布机 3 nrt
+扎带子 3 nr
+扎幌 3 ns
+扎德 12 nrt
+扎成 3 v
+扎手 20 v
+扎扎 3 nrt
+扎扎实实 166 z
+扎把机 3 n
+扎拉 15 nrt
+扎挣 25 v
+扎曲 15 ns
+扎染 18 vn
+扎根 160 ns
+扎根串连 2 i
+扎根绳 3 ns
+扎法尔 3 nr
+扎波罗热 9 nrt
+扎煞 6 v
+扎牢 3 v
+扎猛子 3 nr
+扎瓦 2 nrt
+扎瓦赫里 3 nrt
+扎疼 3 a
+扎眼 22 a
+扎破 3 nrt
+扎穿 3 v
+扎糊 2 a
+扎紧 3 a
+扎罗 9 nrt
+扎耳朵 3 ns
+扎耶 4 nrt
+扎耶德 80 nrt
+扎花 3 ns
+扎花女 3 nr
+扎营 247 vn
+扎萨克 4 nrt
+扎襄 3 ns
+扎襄县 3 nrt
+扎西 17 ns
+扎西岗 4 ns
+扎西德勒 2 nrt
+扎赉特旗 4 ns
+扎赉诺尔 9 ns
+扎起 3 v
+扎起来 3 v
+扎辫子 3 n
+扎进 3 v
+扎针 30 nrt
+扎陵湖 18 ns
+扎马 3 ns
+扎鲁特旗 5 ns
+扎龙 33 ns
+扑 4520 v
+扑上去 3 l
+扑上来 3 l
+扑下去 3 l
+扑下来 3 l
+扑倒 3 v
+扑倒在 3 i
+扑克 63 n
+扑克机 3 n
+扑克牌 57 n
+扑入 3 v
+扑减 3 v
+扑出 3 v
+扑出去 3 i
+扑出来 3 l
+扑击 3 v
+扑到 3 v
+扑取 3 v
+扑哧 94 o
+扑嗤 3 o
+扑噜 7 o
+扑地掀天 3 z
+扑天盖地 3 i
+扑尔敏 3 l
+扑扇 12 n
+扑打 68 v
+扑打在 3 l
+扑救 56 v
+扑朔 3 a
+扑朔迷离 72 i
+扑杀 3 v
+扑杀此獠 3 i
+扑来 3 v
+扑来扑去 3 l
+扑棱 5 v
+扑棱棱 17 n
+扑满 5 v
+扑火 16 v
+扑灭 325 v
+扑灭蚊虫 3 n
+扑热息痛 6 n
+扑空 33 n
+扑簌 7 z
+扑簌簌 77 z
+扑粉 3 n
+扑翻 3 v
+扑翼机 9 i
+扑翼飞机 3 i
+扑腾 49 v
+扑落 19 v
+扑虎 3 n
+扑街 3 n
+扑起 3 v
+扑起来 3 l
+扑跌 3 v
+扑进 3 v
+扑进去 3 l
+扑进来 3 l
+扑通 380 o
+扑通一声 3 i
+扑闪 10 z
+扑面 129 n
+扑面而来 121 l
+扑风扫地 3 i
+扑鼻 190 v
+扑鼻而来 3 l
+扒 1131 v
+扒出 3 v
+扒土 3 n
+扒山廊 3 n
+扒山虎 3 n
+扒开 93 v
+扒手 17 v
+扒拉 61 v
+扒本 3 n
+扒灰 13 n
+扒犁 2 n
+扒痒 3 v
+扒皮 9 n
+扒窃 6 v
+扒糕 2 n
+扒耳搔腮 3 n
+扒起 3 v
+扒车 3 n
+扒高踩低 3 z
+扒鸡 14 n
+打 33853 v
+打上 3 v
+打上去 3 v
+打上来 3 v
+打下 653 v
+打下基础 4 l
+打下手 24 v
+打不住 3 v
+打不倒 3 v
+打不垮 3 v
+打不开 3 v
+打不着 3 v
+打个包 3 l
+打个招呼 3 v
+打个比方 18 l
+打中 329 v
+打主意 33 n
+打乒乓球 3 nt
+打乱 230 v
+打了不罚 3 i
+打了个 3 n
+打井 312 v
+打井队 3 n
+打交道 463 v
+打亮 3 v
+打人 338 n
+打人者 3 n
+打人骂狗 3 i
+打仗 1164 v
+打价 2 v
+打伞 30 v
+打伤 295 v
+打住 39 v
+打保票 3 n
+打信号 3 n
+打倒 1735 v
+打假 152 v
+打假者 8 n
+打先锋 3 n
+打光 38 v
+打光机 3 l
+打光棍 12 l
+打光棍儿 3 l
+打入 640 v
+打入冷宫 16 l
+打关照 3 l
+打关节 3 l
+打冲锋 4 n
+打冷嗝 3 v
+打冷战 3 l
+打冷枪 3 l
+打冷颤 3 v
+打凤捞龙 3 i
+打出 804 v
+打出手 4 v
+打击 4262 v
+打击乐 29 n
+打击乐器 54 l
+打击力 3 n
+打击手 3 n
+打击报复 27 l
+打击板 3 n
+打击犯罪 3 l
+打击率 3 n
+打击目标 3 l
+打击者 3 n
+打击面 9 n
+打分 202 v
+打分数 3 l
+打到 3 v
+打制 66 v
+打前站 13 l
+打前锋 3 l
+打动 339 v
+打劫 125 v
+打勾 3 nz
+打包 110 v
+打包带 3 n
+打包机 3 l
+打包票 9 n
+打千 3 v
+打卡 30 v
+打卡机 5 nz
+打卡钟 3 l
+打卤面 14 n
+打卦 3 v
+打印 436 v
+打印信息 3 l
+打印函数 2 l
+打印发票 2 n
+打印口 3 n
+打印台 3 n
+打印头 4 l
+打印文件 4 l
+打印服务 2 l
+打印服务器 2 l
+打印机 153 n
+打印机接口 2 l
+打印消息 9 l
+打印稿 4 n
+打印纸 9 nz
+打印纸张 2 n
+打印质量 3 n
+打印输出 3 n
+打印驱动 2 l
+打压 91 v
+打去 3 v
+打发 855 v
+打发掉 3 v
+打发走 3 l
+打叠 3 v
+打号机 3 n
+打吊瓶 3 i
+打吊针 3 i
+打听 1627 v
+打听一下 3 i
+打听出 3 v
+打呵欠 9 v
+打呼 3 v
+打呼噜 26 l
+打呼声 3 i
+打哆嗦 38 v
+打哈 3 nz
+打哈哈 15 nz
+打哈欠 29 v
+打响 269 vn
+打哑谜 7 v
+打喷嚏 71 v
+打喷滴 3 i
+打嗝 54 v
+打嗝儿 3 v
+打嘴 3 v
+打嘴仗 2 l
+打嘴巴 7 i
+打回 3 v
+打围 3 v
+打圆场 62 n
+打圈 3 n
+打圈子 5 l
+打地铺 11 n
+打场 23 n
+打坏 3 v
+打坐 84 v
+打垮 80 v
+打埋伏 16 i
+打基础 45 l
+打天下 91 l
+打夯 13 vn
+打夯机 2 n
+打头 94 v
+打头炮 3 l
+打头阵 55 i
+打头风 3 l
+打好 3 v
+打孔 20 v
+打孔器 3 n
+打孔机 3 n
+打字 74 v
+打字员 24 l
+打字如飞 3 l
+打字室 3 n
+打字效率 3 n
+打字方法 3 l
+打字机 122 l
+打字王 3 n
+打字纸 3 n
+打字行 3 v
+打字通 3 l
+打字速度 3 n
+打字高手 3 l
+打完 3 v
+打官司 95 l
+打官腔 9 v
+打定 3 v
+打定主意 3 l
+打家劫舍 56 i
+打家截舍 3 i
+打家截道 3 i
+打富济贫 20 l
+打寒噤 3 l
+打小报告 26 n
+打小算盘 4 n
+打尖 126 v
+打屁股 45 v
+打岔 69 v
+打工 850 v
+打工仔 39 n
+打工妹 16 n
+打工族 6 nz
+打工者 66 n
+打差 3 v
+打差差 3 l
+打带跑 3 l
+打平 34 v
+打平手 3 l
+打广告 3 l
+打底 18 v
+打底子 3 n
+打废 3 v
+打开 4137 v
+打开大合 3 i
+打开天窗 3 i
+打开天窗说亮话 14 i
+打开文档 3 i
+打开方式 3 l
+打开门 3 l
+打弯 3 v
+打弹子 3 n
+打得 3 v
+打得火热 28 l
+打得赢 3 v
+打快 3 v
+打怪 3 v
+打恭作揖 7 i
+打情卖俏 3 i
+打情卖笑 3 l
+打情骂俏 31 i
+打情骂趣 3 i
+打惯 3 n
+打成 299 v
+打成一片 49 l
+打成平手 3 l
+打我所想 3 i
+打战 31 v
+打戳 3 v
+打手 78 v
+打手势 35 i
+打手式 3 l
+打扑 3 v
+打扑克 3 n
+打打 110 v
+打打停停 5 v
+打打字 2 l
+打打杀杀 15 i
+打打杂 2 i
+打打气 2 l
+打打牌 3 l
+打打球 2 l
+打打破 3 l
+打打趣 3 l
+打打闹闹 26 l
+打扫 386 v
+打扫卫生 3 nz
+打扫战场 3 l
+打扮 1129 v
+打扮起来 3 l
+打扰 412 v
+打扰到 3 i
+打把势 3 l
+打抖 3 v
+打折 186 v
+打折扣 120 i
+打折票 4 n
+打抱不平 83 i
+打拍 3 v
+打拍子 9 l
+打拐 2 v
+打拐彰 3 l
+打招呼 370 v
+打拱 3 v
+打拱作揖 3 i
+打拳 29 v
+打拳击 3 i
+打拼 85 v
+打持着 3 l
+打挺儿 3 l
+打捆 4 v
+打捆机 3 n
+打捞 213 v
+打捞人员 3 n
+打捞到 3 i
+打捞工具 3 n
+打捞钻柱 3 i
+打掉 3 v
+打探 319 v
+打掩护 6 v
+打援 3 v
+打搅 105 v
+打搅到 3 i
+打摆子 19 l
+打擂 3 v
+打擂台 9 v
+打散 49 v
+打斗 100 v
+打斗声 2 l
+打斗片 3 l
+打斜 3 v
+打断 916 v
+打旗 2 n
+打昏 3 v
+打春 3 v
+打是亲 3 l
+打暗号 3 l
+打更 57 v
+打杀 3 v
+打杂 44 v
+打杈 2 n
+打来 3 v
+打来打去 3 l
+打板 7 n
+打板子 3 n
+打枪 16 v
+打架 579 v
+打架斗殴 3 l
+打柴 31 v
+打标机 3 n
+打栓 3 n
+打样 7 v
+打样机 3 l
+打桩 28 v
+打桩机 2 n
+打桩船 3 n
+打棍子 8 n
+打椿 3 n
+打榖 3 vn
+打榖场 3 vn
+打榧子 3 v
+打槼 3 vn
+打横 3 v
+打歌 3 v
+打歪 3 l
+打死 1643 v
+打死老虎 3 i
+打死虎 3 i
+打歼灭战 3 v
+打比 5 v
+打比方 7 l
+打毛线 3 n
+打毛衣 3 n
+打气 25 v
+打气筒 2 n
+打水 3 v
+打水仗 3 l
+打水漂 3 n
+打江山 41 nz
+打沉 3 v
+打油 8 v
+打油诗 27 n
+打法 321 v
+打泡 3 v
+打波 3 v
+打洞机 3 n
+打流 3 v
+打浆 2 v
+打浆机 2 n
+打消 176 v
+打消念头 3 n
+打混 3 v
+打渔 16 v
+打游击 61 v
+打游戏 3 l
+打湿 3 v
+打溼 3 vn
+打滑 11 v
+打滚 91 v
+打滚儿 3 l
+打滚撒泼 3 n
+打火 57 v
+打火机 98 l
+打火石 9 n
+打灯笼 3 n
+打灯谜 3 n
+打炮 102 v
+打点 199 v
+打点杂交 3 v
+打点滴 3 i
+打烂 3 v
+打烊 10 v
+打照面 9 l
+打照面儿 3 l
+打爆 3 v
+打牌 126 v
+打牙犯嘴 3 i
+打牙祭 13 l
+打牙配嘴 3 i
+打狗棒 3 i
+打狗棒法 232 i
+打狗看主 3 i
+打猎 301 v
+打猎技术 3 n
+打球 100 v
+打理 62 v
+打瓜 3 n
+打电报 3 v
+打电报说 3 l
+打电话 1305 l
+打白条 3 l
+打的好 3 l
+打的费 3 n
+打皱 3 n
+打盐水 3 l
+打直 3 v
+打盹 88 v
+打盹儿 16 v
+打眼 15 v
+打着 1052 v
+打着灯笼 3 n
+打瞌睡 83 v
+打瞎 3 v
+打短儿 3 l
+打短工 17 j
+打码机 3 n
+打破 1979 v
+打破常规 15 i
+打破沙锅问到底 10 i
+打破砂锅问到底 2 i
+打破纪录 3 n
+打破记录 3 n
+打破迷关 3 l
+打砸 3 l
+打砸抢 30 j
+打硬仗 28 l
+打碎 99 v
+打磕睡 3 v
+打磨 87 v
+打磨器 3 l
+打磨机 3 l
+打票 3 v
+打祭 3 v
+打禅 3 v
+打私 7 v
+打秋千 3 i
+打秋风 15 l
+打稿 3 v
+打空 3 v
+打穿 3 v
+打箇照面 3 nz
+打算 3154 v
+打算盘 15 n
+打箭炉 6 n
+打篮球 3 n
+打粥 3 n
+打糕 5 n
+打紧 3 v
+打纬 3 n
+打结 40 v
+打网球 3 n
+打群架 16 v
+打翻 56 v
+打翻掉 3 i
+打翻身仗 6 l
+打者 3 n
+打耳光 11 nz
+打肿 3 v
+打肿脸充 3 l
+打肿脸充胖子 16 i
+打胎 28 v
+打胜 3 v
+打胜仗 3 l
+打舌头 3 v
+打苍蝇 3 i
+打苞 3 v
+打草 3 v
+打草储饲 3 n
+打草惊蛇 54 i
+打草稿 3 n
+打草蛇惊 3 i
+打药 4 v
+打菜 3 v
+打落 101 v
+打落水狗 9 i
+打蓝球 3 n
+打蔫儿 3 n
+打虎牢龙 3 i
+打虫 3 v
+打虫药 3 n
+打蛇打七寸 2 i
+打蛋 3 v
+打蛋器 3 l
+打蜡 21 v
+打蜡机 3 n
+打街骂巷 3 i
+打补丁 3 l
+打裂 3 v
+打诨 10 v
+打诨插科 3 n
+打谱 9 v
+打谷 8 n
+打谷场 8 n
+打谷机 3 n
+打败 1507 v
+打败仗 3 l
+打赌 102 v
+打赢 235 v
+打赤脚 3 i
+打赤膊 2 n
+打起 3 v
+打起精神 3 i
+打趣 100 v
+打趸儿 3 z
+打躬 3 v
+打躬作揖 22 i
+打车 61 v
+打转 25 v
+打转儿 4 l
+打转转 20 i
+打输 3 vn
+打边鼓 3 i
+打过 3 v
+打过仗 3 l
+打过工 3 l
+打过架 3 v
+打进 3 v
+打进去 3 v
+打退 144 v
+打退堂鼓 40 i
+打通 305 v
+打通儿 3 l
+打通关 11 l
+打通经脉 3 l
+打造 661 v
+打造出 3 l
+打造术 3 n
+打遍天下 55 i
+打道 3 v
+打道回府 44 l
+打酒 24 v
+打醒 3 v
+打醮 3 v
+打野 3 v
+打野外 3 l
+打量 914 v
+打量出 3 v
+打针 90 v
+打钟 3 n
+打钩 7 v
+打钻 3 v
+打铁 108 v
+打铁工 3 nz
+打铁趁热 3 z
+打铃 3 nz
+打错 3 v
+打错字 3 l
+打错算盘 3 n
+打门 3 v
+打闪 10 v
+打问 3 v
+打问号 3 l
+打闷棍 3 i
+打闷葫芦 3 i
+打闹 45 v
+打防 8 v
+打防结合 3 l
+打雪仗 6 v
+打零工 16 v
+打雷 54 v
+打非 33 v
+打靶 32 v
+打靶场 3 n
+打预防针 3 l
+打领带 3 n
+打颤 67 v
+打食 3 v
+打饥荒 3 i
+打马虎眼 16 i
+打骂 79 v
+打骂教育 3 n
+打高尔夫 3 nz
+打鬼 20 v
+打鱼 118 v
+打鱼人 14 l
+打鱼郎 3 l
+打鸡骂狗 3 i
+打鸣 4 v
+打鸣儿 3 l
+打鸭惊鸳 3 i
+打麦 3 n
+打麦场 28 n
+打麻将 3 n
+打黑 9 v
+打鼓 324 v
+打鼾 81 v
+扔 2277 v
+扔上去 3 v
+扔上来 3 v
+扔下 255 v
+扔下去 3 v
+扔下来 3 v
+扔出 3 v
+扔出去 3 v
+扔出来 3 v
+扔到 3 v
+扔回 3 v
+扔回去 3 z
+扔回来 3 vn
+扔在脑后 3 v
+扔开 3 v
+扔弃 3 v
+扔掉 216 v
+扔来 3 v
+扔来扔去 3 z
+扔给 3 v
+扔起 3 v
+扔起来 3 v
+扔进 3 v
+扔钱 3 v
+托 3283 v
+托一梦 2 nr
+托之空言 3 l
+托买 3 v
+托事 3 n
+托于空言 3 l
+托亚拉 2 nrt
+托交 3 v
+托人 276 nrt
+托人情 3 n
+托付 167 v
+托付给 3 vn
+托伦斯 14 nr
+托住 3 v
+托偶 3 n
+托儿 8 nr
+托儿所 45 n
+托克 11 nrt
+托克劳 10 nr
+托克峰 2 nr
+托克托 8 nr
+托克托县 10 nrt
+托克玛 3 nr
+托克逊 8 nr
+托克逊县 4 nrt
+托克马克 11 nrt
+托公报私 3 n
+托公行私 3 n
+托兰德 4 nr
+托关系 3 nr
+托凤攀龙 3 nr
+托利 7 nrt
+托利亚 69 nr
+托利党 33 nr
+托利多 3 nrt
+托利尔 17 nr
+托利派 3 nr
+托利诺 2 nr
+托办 3 v
+托勒密 142 nr
+托勒尔 6 nr
+托卖 3 v
+托博尔 5 nr
+托博尔河 3 ns
+托卡 5 nrt
+托卡列夫 2 nrt
+托卡塔 9 nr
+托卡马克 12 nrt
+托古改制 3 nz
+托古讽今 3 v
+托叶 132 nr
+托合齐 3 nr
+托名 3 v
+托君臣 2 nr
+托咎 3 v
+托哥尔 7 nr
+托喻之 3 nr
+托坎廷 5 nr
+托塔 46 nrt
+托塞尼 8 nr
+托多洛夫 3 nrt
+托多罗夫 2 nrt
+托夫勒 3 nr
+托夫斯 17 nr
+托姆 11 nrt
+托姆博 3 nr
+托子 6 nr
+托孤 49 nr
+托孤寄命 3 nr
+托少平 2 nr
+托尔 25 nrt
+托尔任 2 nr
+托尔加 3 nrt
+托尔多 4 nrt
+托尔布 11 nr
+托尔希 12 nr
+托尔德 4 nrt
+托尔托 8 nrt
+托尔斯 25 nrt
+托尔斯泰 83 nrt
+托尔普 3 nr
+托尔曼 3 nr
+托尔湾 5 nr
+托尔特 8 nrt
+托尔福 2 nr
+托尔金 3 nr
+托尔高 3 nrt
+托尘凡 2 nr
+托尼奥 2 nrt
+托帕希 7 nr
+托带 3 n
+托幼 25 nr
+托庇 47 v
+托底 4 nrt
+托德 10 nrt
+托忒文 2 nr
+托托 2 nrt
+托拉 19 nrt
+托拉司 3 nr
+托拉斯 100 nrt
+托拉查 3 nr
+托收 52 v
+托故 18 n
+托斯 19 nrt
+托斯克 4 nrt
+托斯卡 19 nrt
+托斯卡纳 22 nrt
+托斯卡纳区 2 ns
+托斯基 3 nr
+托普 20 nrt
+托普勒泵 3 nz
+托普卡 2 nr
+托普软件 3 n
+托期 3 n
+托木尔 5 nr
+托木尔峰 21 nr
+托木斯克 7 nrt
+托木河 3 nr
+托来山 2 nr
+托板 4 n
+托架 8 n
+托根贝 4 nr
+托格勒 2 nr
+托梁换柱 3 nr
+托梅斯 4 nr
+托梦 44 nr
+托比 2 nrt
+托波尔 2 nr
+托洛茨基 43 nrt
+托派 25 nr
+托炼锌 2 nr
+托熟 3 nr
+托物喻志 3 nr
+托物寓兴 3 nr
+托物寓感 3 n
+托物引类 3 n
+托物感怀 3 n
+托物连类 3 n
+托物陈喻 3 nr
+托特 3 nrt
+托特纳 3 nr
+托特纳姆 18 nrt
+托特纳姆热刺 13 nz
+托玛斯 9 nr
+托玛森 3 nr
+托瓦尔 4 nr
+托瓦尼 3 nr
+托生 26 nr
+托病 34 n
+托皮卡 2 nr
+托盘 139 v
+托盘式 3 n
+托福 282 nr
+托福考 3 nr
+托福考试 3 nr
+托称 3 v
+托管 220 v
+托管人 4 nr
+托管制度 3 n
+托管商 3 nr
+托管国 3 nr
+托管地 48 n
+托管地区 3 n
+托管期 3 n
+托米 4 nrt
+托米奇 2 nr
+托素湖 4 nr
+托绍夫斯基 2 nr
+托维亚 2 nr
+托罗 6 nrt
+托罗亚 3 nr
+托罗斯 13 nr
+托罗普采夫 3 nr
+托老所 2 nr
+托育园 2 nr
+托色尼 6 nr
+托芳心 2 nr
+托莫河 2 nr
+托莱多 18 nrt
+托菲诺 6 nr
+托蒂 8 nrt
+托词 33 n
+托话 3 v
+托诸空言 3 l
+托诺夫 2 nr
+托起 80 v
+托起来 3 nr
+托足无门 3 l
+托身 3 v
+托车 3 n
+托轮 3 n
+托辊 3 nz
+托辞 40 nr
+托辣斯 3 nr
+托运 66 nr
+托运人 7 nr
+托运单 3 nr
+托运费 3 nz
+托运部 3 n
+托里 25 nrt
+托里亚 2 nrt
+托里县 2 ns
+托里奥 4 nrt
+托里尔 2 nrt
+托里霍斯 7 nrt
+托钵 3 nr
+托钵僧 3 nr
+托长 3 v
+托门子 3 nr
+托雷平 2 nr
+托雷斯 26 nr
+托鞋 3 n
+托马 7 nrt
+托马斯 390 nrt
+托马森 5 nr
+托马索 2 nr
+托马西 5 nrt
+托骥之蝇 3 nr
+托鲁瓦 2 nr
+扛 857 zg
+扛上去 3 l
+扛上来 3 l
+扛下 3 v
+扛下去 3 l
+扛下来 3 l
+扛不住 3 l
+扛出 3 v
+扛出去 3 l
+扛出来 3 l
+扛包 3 v
+扛去 3 v
+扛回 2 v
+扛大活 3 l
+扛得住 3 v
+扛来 3 v
+扛来扛去 3 z
+扛枪 3 v
+扛活 3 v
+扛着 3 v
+扛走 3 v
+扛起 3 v
+扛起来 3 l
+扛过 3 v
+扛过去 3 l
+扛过来 3 l
+扛进 3 v
+扛进去 3 l
+扛进来 3 l
+扛长工 6 l
+扛鼎之作 5 l
+扛鼎抃牛 3 l
+扛鼎拔山 3 l
+扜 13 zg
+扞 2 zg
+扞御 3 v
+扞拒 3 v
+扞格 3 v
+扞格不入 3 v
+扠 47 zg
+扢 28 zg
+扣 1515 v
+扣上 3 v
+扣上去 3 v
+扣上来 3 v
+扣下 3 v
+扣下去 3 v
+扣下来 3 v
+扣交 3 v
+扣人心弦 35 i
+扣人心悬 3 i
+扣件 2 n
+扣住 5 v
+扣作 3 v
+扣儿 12 n
+扣光 3 v
+扣减 5 v
+扣减额 3 i
+扣出 3 v
+扣击 6 v
+扣分 26 v
+扣分标准 3 n
+扣分法 3 n
+扣划 4 n
+扣到 3 v
+扣动 35 v
+扣压 15 v
+扣去 3 v
+扣发 141 v
+扣取 3 v
+扣回 3 v
+扣回去 3 i
+扣回来 3 i
+扣壶长吟 3 i
+扣头 3 v
+扣好 3 v
+扣子 122 n
+扣字样 3 n
+扣带回 5 i
+扣帽子 14 n
+扣得 3 v
+扣心泣血 3 i
+扣扣 3 v
+扣抵 3 v
+扣押 227 v
+扣掉 15 v
+扣杀 36 v
+扣杀力 3 n
+扣来扣去 3 n
+扣板机 3 n
+扣楫中流 3 vn
+扣槃扪烛 3 i
+扣槃扪籥 3 i
+扣款 14 v
+扣法 3 v
+扣满 3 v
+扣点 3 n
+扣点分数 3 n
+扣牢 3 v
+扣率 3 n
+扣环 2 n
+扣球 30 n
+扣留 174 v
+扣留住 3 i
+扣盘扪烛 3 i
+扣盘扪钥 3 i
+扣眼 3 v
+扣税 2 v
+扣篮 97 v
+扣篮王 2 n
+扣紧 3 v
+扣绊 3 n
+扣缴 8 v
+扣缴凭单 3 n
+扣缴额 3 n
+扣罚 4 v
+扣肉 8 n
+扣薪 3 v
+扣襻 4 n
+扣货 3 n
+扣起 3 v
+扣起来 3 v
+扣过 3 v
+扣过去 3 v
+扣过来 3 v
+扣针 2 n
+扣钱 3 v
+扣门 3 v
+扣问 3 v
+扣除 329 v
+扣除非 3 i
+扣除额 4 n
+扤 13 zg
+扥 2 zg
+扦 33 zg
+扦子 3 n
+扦插 75 v
+执 2201 v
+执业 113 n
+执业资格 126 n
+执两用中 3 l
+执中 3 v
+执事 211 v
+执事官 3 n
+执住 3 v
+执信 3 v
+执刑 7 v
+执勤 113 vn
+执勤点 3 n
+执友 3 n
+执壶 25 n
+执委 34 n
+执委会 85 j
+执子之手 3 l
+执字 3 n
+执导 173 v
+执径叩问 3 vn
+执径问难 3 i
+执意 320 v
+执意不从 3 i
+执手 24 v
+执拗 140 v
+执持 3 v
+执掌 850 v
+执政 2751 v
+执政为民 3 l
+执政之基 3 n
+执政党 317 n
+执政堂 3 n
+执政官 155 n
+执政府 403 n
+执政权 2 n
+执政纲领 3 n
+执政者 177 n
+执教 325 v
+执文害意 3 n
+执杖 3 n
+执柯作伐 3 i
+执棒 9 n
+执法 1187 v
+执法不严 16 l
+执法不公 3 l
+执法不阿 3 i
+执法为民 3 l
+执法人员 3 n
+执法如山 15 l
+执法官 7 n
+执法局 3 n
+执法必严 7 l
+执法思想 3 i
+执法机关 3 l
+执法权 262 n
+执法检查 3 n
+执法水平 3 n
+执法犯法 4 l
+执法监督 3 n
+执法者 51 n
+执法违法 3 i
+执法长老 3 n
+执泥 3 n
+执照 107 v
+执牛耳 6 i
+执白 22 v
+执着 218 v
+执着性 3 n
+执礼 3 v
+执笔 86 v
+执笔人 3 n
+执笔者 4 n
+执粗井灶 3 i
+执纪 19 n
+执经问难 3 l
+执罚 3 vn
+执而不化 3 l
+执著 149 a
+执行 14504 v
+执行主席 33 n
+执行主管 3 n
+执行公务 3 n
+执行力 3 n
+执行员 4 n
+执行命令 3 n
+执行器 11 n
+执行官 361 n
+执行局 23 n
+执行层 2 n
+执行庭 8 n
+执行数 3 n
+执行期 3 n
+执行机构 61 n
+执行权 6 n
+执行款 2 n
+执行率 2 n
+执行程序 19 n
+执行者 63 n
+执行逮捕 3 vn
+执行部 26 n
+执行长 28 n
+执迷 45 v
+执迷不反 3 i
+执迷不悔 3 l
+执迷不悟 71 i
+执迷不返 3 l
+执迷不醒 3 l
+执锐披坚 3 vn
+执鞭 14 v
+执鞭坠镫 2 i
+执鞭随蹬 3 n
+执鞭随镫 4 i
+执黑 26 v
+扩 1928 v
+扩产 10 v
+扩充 584 v
+扩充卡 3 n
+扩充器 3 l
+扩充性 5 n
+扩充槽 3 v
+扩充码 3 l
+扩军 55 v
+扩军备战 29 l
+扩军计划 3 n
+扩到 3 v
+扩印 7 v
+扩厂 3 v
+扩厂计划 3 n
+扩及 49 v
+扩增 14 v
+扩增到 3 l
+扩增子 3 n
+扩增引物 3 l
+扩声器 3 l
+扩声系统 3 l
+扩大 8594 v
+扩大会 17 v
+扩大其词 3 l
+扩大内需 3 n
+扩大再生 3 l
+扩大出口 3 l
+扩大化 87 v
+扩大器 3 nz
+扩大开放 3 l
+扩大招生 3 v
+扩大机 3 n
+扩大范围 3 n
+扩孔 5 v
+扩容 97 v
+扩宽 6 v
+扩展 2670 v
+扩展卡 3 n
+扩展名 8 l
+扩展器 2 l
+扩展性 12 n
+扩展扩散 3 n
+扩展槽 3 n
+扩展电阻 3 l
+扩布 3 v
+扩延 3 v
+扩延到 3 l
+扩建 1845 v
+扩建工厂 3 n
+扩建工程 3 l
+扩张 2419 v
+扩张主义 46 n
+扩张剂 10 n
+扩张力 5 n
+扩张器 3 n
+扩张型 7 b
+扩张开来 3 l
+扩张性 10 n
+扩张战果 3 n
+扩张政策 3 n
+扩张映射 3 n
+扩张期 4 b
+扩张规则 3 n
+扩征 3 v
+扩戏 3 v
+扩招 131 v
+扩散 982 v
+扩散中心 3 n
+扩散作用 3 n
+扩散出来 3 v
+扩散势 3 n
+扩散器 3 n
+扩散工艺 3 n
+扩散式 4 n
+扩散性 2 n
+扩散控制 3 n
+扩散深度 3 l
+扩散电容 3 n
+扩散系数 3 n
+扩散距离 3 n
+扩散阻力 3 n
+扩散限制 3 n
+扩版 2 v
+扩编 83 v
+扩股 40 v
+扩胸 7 v
+扩胸器 3 n
+扩能 7 v
+扩音 16 v
+扩音器 47 n
+扩音机 3 n
+扩频 5 v
+扩频通信 3 n
+扪 49 i
+扪住 3 i
+扪参历井 3 i
+扪心 3 i
+扪心无愧 3 i
+扪心自省 3 i
+扪心自问 30 i
+扪虱而言 3 z
+扪虱而谈 3 v
+扫 1923 v
+扫乾净 3 i
+扫倒 3 v
+扫光 3 n
+扫兴 143 v
+扫出 3 v
+扫出去 3 v
+扫出来 3 l
+扫刮 3 v
+扫到 3 v
+扫去 3 v
+扫地 348 n
+扫地以尽 3 l
+扫地俱尽 3 i
+扫地出门 24 l
+扫地无余 3 i
+扫地无遗 3 i
+扫地机 3 n
+扫坟 3 n
+扫堂腿 10 l
+扫墓 100 n
+扫墓望丧 3 n
+扫墓节 3 n
+扫射 152 v
+扫尾 19 v
+扫帚 215 n
+扫帚声 3 n
+扫帚星 11 n
+扫帚眉 3 n
+扫帚菜 3 n
+扫平 32 n
+扫房 4 n
+扫把 41 v
+扫掠 3 v
+扫描 489 v
+扫描仪 66 n
+扫描器 20 n
+扫描式 3 n
+扫描扇形 3 i
+扫描时间 3 n
+扫描术 3 n
+扫描机 3 n
+扫描枪 3 n
+扫描模式 2 n
+扫描电镜 3 n
+扫描线 3 n
+扫描角 3 n
+扫描转换 3 i
+扫描输出 3 n
+扫数 3 n
+扫时间 3 n
+扫来 3 v
+扫来扫去 3 l
+扫榻以待 3 n
+扫毒 28 v
+扫清 124 v
+扫灭 3 v
+扫田刮地 3 n
+扫盲 75 v
+扫眉才子 3 i
+扫瞄器 3 v
+扫祭 3 v
+扫穴擒渠 3 i
+扫穴犁庭 3 n
+扫荡 366 v
+扫荡残敌 3 i
+扫视 84 v
+扫赌 3 v
+扫走 3 v
+扫过 3 v
+扫过去 3 l
+扫过来 3 l
+扫进 3 v
+扫进去 3 v
+扫进来 3 l
+扫选 3 v
+扫锅刮灶 3 i
+扫除 259 v
+扫除天下 3 l
+扫雪 25 n
+扫雷 337 v
+扫雷器 71 n
+扫雷战 3 l
+扫雷机 3 n
+扫雷舰 43 n
+扫雷艇 44 n
+扫黄 60 n
+扫黄办 2 n
+扫黄打非 29 i
+扫黑 2 v
+扬 1661 vg
+扬一扬 8 i
+扬一益 3 nr
+扬中 41 ns
+扬中县 3 ns
+扬中市 5 ns
+扬二州 6 nz
+扬克尔 3 nr
+扬刀立 10 nr
+扬剧 3 n
+扬升 9 v
+扬升鱼 2 nr
+扬厉 3 nr
+扬厉铺张 3 i
+扬古 2 ns
+扬名 85 v
+扬名世界 3 i
+扬名后世 3 i
+扬名四海 3 ns
+扬名天下 11 i
+扬名显亲 3 i
+扬名显姓 3 i
+扬名立万 3 i
+扬善 3 ns
+扬善去恶 3 i
+扬善隐恶 3 i
+扬国威 2 nr
+扬场 7 n
+扬城 2 ns
+扬基 3 nz
+扬基级 2 n
+扬声 24 nr
+扬声器 54 nz
+扬声大 5 i
+扬大桥 3 ns
+扬威 60 ns
+扬威曜武 3 nr
+扬威耀武 3 nr
+扬子 127 nr
+扬子晚报 3 nz
+扬子江 401 nr
+扬子鳄 59 n
+扬州 1325 ns
+扬州人 23 nr
+扬州八怪 24 nz
+扬州市 44 ns
+扬州热线 3 nz
+扬己露才 3 i
+扬帆 66 nz
+扬帆远航 3 nr
+扬幡招魂 3 nr
+扬幡擂鼓 3 z
+扬府队 2 n
+扬弃 53 v
+扬微微 2 nr
+扬戈维 94 nr
+扬手 3 v
+扬手敬 2 i
+扬扬 8 v
+扬扬得意 5 i
+扬扬自得 3 i
+扬斯基 5 nz
+扬旗 4 ns
+扬格 4 n
+扬榷 3 v
+扬榷古今 3 t
+扬武耀威 3 nr
+扬水 3 ns
+扬水站 6 nz
+扬汤止沸 3 i
+扬沙 12 ns
+扬河东 2 ns
+扬波 7 ns
+扬清厉俗 3 i
+扬清抑浊 3 nr
+扬清激浊 3 nr
+扬特 2 ns
+扬琴 54 nr
+扬甘杰 3 nr
+扬眉 6 ns
+扬眉剑出鞘 3 l
+扬眉动 2 i
+扬眉吐气 84 i
+扬眉抵掌 3 l
+扬眉捋须 3 i
+扬眉眴目 3 v
+扬眉瞬目 3 i
+扬督师 2 nr
+扬砂走石 3 i
+扬科维 25 nz
+扬程 29 n
+扬花 15 nz
+扬葩振藻 3 ns
+扬言 311 nr
+扬起 274 v
+扬起诚信 3 i
+扬越 3 nz
+扬铃打鼓 3 i
+扬锣捣鼓 3 i
+扬镳分路 3 nr
+扬长 36 v
+扬长而去 137 i
+扬长补短 6 i
+扬长避短 69 i
+扬雄 26 ns
+扬雄著 2 nr
+扬鞭 79 nr
+扬风扢雅 3 nz
+扬马 3 ns
+扬马延 3 nr
+扬黄 3 nz
+扭 1355 v
+扭亏 68 v
+扭亏为盈 65 l
+扭亏增盈 21 l
+扭亏解困 5 i
+扭伤 82 v
+扭伤脚 3 n
+扭住 3 v
+扭倒 3 v
+扭出 3 v
+扭出去 3 l
+扭出来 3 l
+扭到 3 v
+扭力 4 n
+扭力天平 3 l
+扭力计 3 l
+扭动 127 v
+扭压盆地 3 l
+扭大 3 v
+扭头 296 v
+扭开 3 v
+扭弯 3 v
+扭得 3 v
+扭怩 3 a
+扭成 3 v
+扭成一团 3 l
+扭打 54 v
+扭扭 3 v
+扭扭捏捏 35 z
+扭扭舞 3 l
+扭扯 3 v
+扭折 3 v
+扭折位 3 n
+扭捏 31 v
+扭捏作态 3 l
+扭搭 3 v
+扭摆 8 v
+扭摆不停 3 l
+扭斗 3 v
+扭断 65 v
+扭曲 420 v
+扭曲作直 3 i
+扭曲层 3 l
+扭杆 36 n
+扭来 3 v
+扭来扭去 3 l
+扭歪 3 z
+扭直作曲 3 l
+扭矩 25 n
+扭秤 35 n
+扭秧歌 10 n
+扭筋 3 v
+扭紧 3 v
+扭结 25 v
+扭绞 3 l
+扭脸 3 v
+扭腰 3 v
+扭获 3 v
+扭角羚 3 n
+扭起 3 v
+扭起来 3 l
+扭身 3 v
+扭转 646 v
+扭转乾坤 21 i
+扭转局势 3 n
+扭转局面 3 n
+扭转干坤 3 i
+扭转映射 3 i
+扭转身 3 n
+扭转错位 3 l
+扭转颓势 3 l
+扭过 3 v
+扭过去 3 l
+扭过头 3 l
+扭过头去 3 l
+扭过头来 3 l
+扭过来 3 l
+扭送 24 v
+扮 980 v
+扮作 156 v
+扮做 3 v
+扮像 3 v
+扮得 3 v
+扮戏 3 v
+扮成 98 v
+扮扮演 3 vn
+扮演 911 v
+扮演着 3 n
+扮演者 14 n
+扮相 21 v
+扮着 3 v
+扮装 4 v
+扮起 3 v
+扮起来 3 v
+扮酷 3 n
+扮鬼 3 v
+扮鬼脸 4 v
+扯 2860 v
+扯三拉四 3 t
+扯上去 3 v
+扯上来 3 v
+扯下去 3 v
+扯下来 3 v
+扯不上 3 v
+扯东拉西 3 nz
+扯住 3 v
+扯倒 3 v
+扯出去 3 v
+扯出来 3 v
+扯动 34 v
+扯后腿 6 v
+扯嗓子 3 v
+扯帆 3 v
+扯平 16 v
+扯开 3 v
+扯成 3 v
+扯扯 3 v
+扯拉 3 v
+扯掉 3 v
+扯断 3 v
+扯旗 3 v
+扯旗放炮 3 v
+扯来扯去 3 z
+扯淡 70 v
+扯白 3 v
+扯皮 39 v
+扯皮弄筋 3 v
+扯皮拉筋 3 v
+扯直 3 v
+扯破 3 v
+扯碎 3 v
+扯空砑光 3 z
+扯篷拉纤 3 nz
+扯纤拉烟 3 nz
+扯腿 3 v
+扯落 3 v
+扯蛋 3 v
+扯裂 5 v
+扯谈 7 v
+扯谎 38 v
+扯走 3 v
+扯起 3 v
+扯起来 3 v
+扯进 3 v
+扯进去 3 v
+扯进来 3 v
+扯远 3 v
+扯钓 3 v
+扯铃 3 v
+扯闲 3 v
+扯顺风旗 3 v
+扯鼓夺旗 3 nr
+扰 554 v
+扰乱 383 v
+扰乱性 3 n
+扰乱治安 3 n
+扰人 3 n
+扰人清梦 3 n
+扰动 166 vn
+扰动理论 3 n
+扰嚷 3 v
+扰扰 3 v
+扰攘 40 v
+扰民 67 n
+扰流器 2 n
+扰流板 3 n
+扰痒 3 v
+扱 19 zg
+扳 656 v
+扳不倒 3 v
+扳不倒儿 3 n
+扳住 3 v
+扳倒 83 v
+扳倒井 3 n
+扳动 32 v
+扳回 98 v
+扳头 3 n
+扳子 3 n
+扳平 93 n
+扳开 3 v
+扳成 3 v
+扳手 29 n
+扳指 16 n
+扳指儿 3 n
+扳本 3 n
+扳机 128 n
+扳着 3 v
+扳起 3 v
+扳起来 3 v
+扳转 3 v
+扳道 4 v
+扳道员 3 n
+扳道夫 3 n
+扳钳 3 n
+扳闸 3 n
+扳龙附凤 3 n
+扵 5 zg
+扶 3105 v
+扶丁军 2 nr
+扶上马 6 nr
+扶下 3 v
+扶下去 3 v
+扶下来 3 l
+扶不起 3 v
+扶为 3 v
+扶乩 31 v
+扶优扶强 3 nr
+扶优限劣 3 n
+扶住 3 v
+扶住嘉 2 nr
+扶余 42 v
+扶余县 5 ns
+扶倾济弱 3 l
+扶傻姑 2 nr
+扶养 51 v
+扶养费 3 nr
+扶出 3 v
+扶出去 3 i
+扶出来 3 v
+扶助 149 v
+扶助金 3 n
+扶南 10 ns
+扶危 17 nr
+扶危定乱 3 i
+扶危定倾 3 i
+扶危持倾 3 i
+扶危持颠 3 i
+扶危救困 3 i
+扶危济 4 i
+扶危济困 24 i
+扶危济急 3 i
+扶危济贫 3 l
+扶危翼倾 3 i
+扶去 3 v
+扶善惩恶 3 i
+扶善疾恶 3 i
+扶善遏过 3 i
+扶墙摸壁 3 i
+扶壁 3 nr
+扶太子登 2 nr
+扶宝玉 2 nr
+扶小王爷 2 nr
+扶山超海 3 ns
+扶师父 2 nr
+扶幼主 2 nr
+扶弱抑强 3 nr
+扶强 3 v
+扶手 92 v
+扶手椅 15 n
+扶手箱 3 n
+扶持 624 v
+扶持着 3 i
+扶掖 5 ns
+扶摇 5 v
+扶摇万里 3 i
+扶摇子 2 nr
+扶摇直上 30 i
+扶明室 2 nr
+扶杖 2 n
+扶来 3 v
+扶柩 3 n
+扶栏 135 nr
+扶桑 40 nr
+扶梯 33 n
+扶棺 3 v
+扶椅 3 n
+扶植 218 v
+扶植纲常 3 l
+扶正 65 nr
+扶正压邪 3 i
+扶正固 2 nr
+扶正培本 3 nr
+扶正祛邪 15 i
+扶正黜邪 3 i
+扶残助残 3 i
+扶汉室 12 nr
+扶沟 30 ns
+扶沟县 2 ns
+扶海洲 2 ns
+扶清灭 18 nr
+扶灵 3 nr
+扶犁 3 ns
+扶玄德 2 nr
+扶王语 3 nr
+扶疏 22 nr
+扶病 20 v
+扶直 3 v
+扶眉战役 4 i
+扶突 3 vn
+扶立 4 v
+扶策太 2 nr
+扶绥 6 nr
+扶绥县 3 ns
+扶老携幼 56 i
+扶苏 15 ns
+扶苗 3 nr
+扶贫 717 v
+扶贫办 9 i
+扶贫助困 3 i
+扶贫县 13 l
+扶贫团 2 nt
+扶贫帮困 20 j
+扶贫开发 3 i
+扶贫户 3 i
+扶贫济困 21 i
+扶起 2 v
+扶起方 2 nr
+扶起来 3 l
+扶起林 2 nr
+扶起翁 2 nr
+扶轮 4 n
+扶轮社 3 nt
+扶进房 2 nr
+扶远县 3 ns
+扶阳 3 ns
+扶阿炳 3 nr
+扶雪妍 2 nr
+扶颠持危 3 i
+扶风 93 nr
+扶风县 11 ns
+扶鸾 4 nr
+扶黛玉 2 nr
+批 5299 q
+批上 3 v
+批上去 3 v
+批上来 3 v
+批下 3 v
+批下去 3 v
+批下来 3 v
+批亢抵巇 3 z
+批亢捣虚 2 i
+批件 8 n
+批价 2 v
+批作业 2 n
+批假 3 v
+批准 11157 v
+批准下来 3 l
+批准书 21 n
+批准文号 3 n
+批准权 4 n
+批准逮捕 3 vn
+批出 9 v
+批出去 3 v
+批出来 3 v
+批判 2231 v
+批判主义 3 n
+批判力 2 n
+批判性 39 n
+批判者 3 n
+批办 7 v
+批办制 2 n
+批发 397 v
+批发业 3 n
+批发产品 3 n
+批发价 16 n
+批发价格 3 n
+批发商 49 n
+批发商品 3 n
+批发商店 3 n
+批发城 3 n
+批发市场 3 n
+批发店 3 n
+批发点 4 n
+批发网 3 n
+批发部 3 n
+批号 21 n
+批吭捣虚 3 i
+批回 3 v
+批在 3 v
+批处理 12 vn
+批复 474 v
+批好 3 v
+批字 3 n
+批得 3 v
+批成 3 v
+批捕 28 v
+批改 36 v
+批改作业 3 l
+批改文章 3 n
+批文 52 n
+批斗 78 vn
+批斗会 16 n
+批条 2 n
+批条子 4 n
+批林批孔 107 n
+批核 3 v
+批次 543 d
+批毛求疵 3 n
+批注 17 v
+批点 4 n
+批着 3 v
+批砉导窾 3 nz
+批示 316 v
+批示着 3 l
+批离 3 v
+批租 3 v
+批租费 3 n
+批答 3 v
+批红判白 3 n
+批红戴绿 3 i
+批给 3 v
+批覆 3 v
+批评 2972 v
+批评和自 3 n
+批评家 134 n
+批评性 18 n
+批评指正 3 n
+批评权 2 n
+批评界 3 n
+批评稿 3 n
+批评者 24 n
+批语 9 v
+批货 3 n
+批货商 3 n
+批货店 3 n
+批购 3 v
+批起 3 v
+批转 21 v
+批逆龙鳞 3 n
+批郤导窾 3 n
+批量 579 n
+批量生产 3 n
+批量造词 3 n
+批销 3 v
+批阅 81 v
+批隙导窾 3 z
+批零 16 v
+批零兼营 3 l
+批风抹月 3 l
+批驳 143 v
+批验 3 vn
+批鳞请剑 3 n
+扺 4 zg
+扼 249 vg
+扼亢拊背 3 v
+扼住 52 v
+扼制 31 v
+扼吭夺食 3 n
+扼吭拊背 3 v
+扼喉抚背 3 ns
+扼坑拊背 3 v
+扼夺 3 v
+扼守 86 v
+扼杀 147 v
+扼杀者 3 l
+扼止 3 v
+扼死 37 v
+扼流关节 3 l
+扼流圈 3 l
+扼流线圈 3 l
+扼紧 3 v
+扼腕 32 v
+扼腕叹息 8 l
+扼腕抵掌 3 l
+扼腕痛惜 3 l
+扼腕长叹 3 v
+扼襟控咽 3 n
+扼要 70 a
+扼要说明 3 l
+扼阻 3 v
+找 20856 v
+找上去 3 v
+找上来 3 v
+找上门 159 v
+找上门来 3 v
+找不出 3 v
+找不着 3 v
+找不着北 3 l
+找不自在 6 v
+找乐 21 v
+找事 26 v
+找你网 3 n
+找准 3 v
+找出 852 v
+找出路 8 v
+找别扭 3 v
+找到 7607 v
+找到啦 3 nz
+找回 190 v
+找回去 3 l
+找头 3 v
+找女婿 3 n
+找对头 3 n
+找对象 3 n
+找寻 385 v
+找寻出 3 l
+找寻到 3 l
+找岔子 6 v
+找平 4 v
+找平层 3 n
+找开 3 v
+找得着 3 v
+找我聊 3 n
+找房网 3 n
+找找看 3 l
+找来 3 v
+找来找 3 v
+找来找去 3 l
+找歌 3 v
+找死 55 v
+找水 11 v
+找点事干 3 v
+找点活干 3 v
+找牙 3 v
+找病 3 v
+找矿 74 v
+找碴 8 v
+找碴儿 3 n
+找空 3 v
+找窍门 3 vn
+找茬 26 v
+找茬儿 4 v
+找补 10 v
+找觅 3 v
+找词 3 v
+找起 3 v
+找辙 3 v
+找进 3 v
+找进去 3 v
+找进来 3 v
+找遍 3 v
+找钱 18 v
+找门路 3 n
+找零 4 v
+找麻烦 15 v
+找齐 5 v
+承 8308 v
+承上启下 39 i
+承上起下 3 v
+承不承认 4 v
+承业二 2 nr
+承东启 2 nr
+承乏 3 v
+承乾官 4 nr
+承乾宫 132 nr
+承乾门 3 nr
+承付 3 v
+承传 8 v
+承佃 3 v
+承佳惠 2 nr
+承保 31 v
+承保人 3 nr
+承修 19 v
+承债式 3 n
+承值太监 2 n
+承做 3 v
+承先启后 8 nr
+承光殿 5 nr
+承兑 91 v
+承兑人 3 n
+承兑汇票 3 n
+承典人 3 nr
+承制 8 v
+承制方 2 n
+承前启后 41 nr
+承前续后 3 i
+承办 310 v
+承办人 3 n
+承办方 13 n
+承办权 4 n
+承办者 2 n
+承包 627 v
+承包人 17 n
+承包制 18 n
+承包单 3 n
+承包单位 3 n
+承包合同 3 n
+承包商 99 n
+承包地 3 n
+承包工程 3 n
+承包户 3 n
+承包方 2 n
+承包期 4 n
+承包田 3 nr
+承包经营 3 n
+承包者 3 n
+承包责任制 12 n
+承包费 11 n
+承华宫 2 nr
+承华首 2 ns
+承印 8 v
+承压 62 v
+承压区 3 n
+承压水 3 n
+承压水头 3 n
+承发包 2 n
+承受 1458 v
+承受不住 3 i
+承受力 58 n
+承受度 4 n
+承受者 3 n
+承受能力 3 n
+承台 2 v
+承启官 29 nr
+承唐宋 3 nr
+承嗣大 2 nr
+承天之 128 nr
+承天之佑 3 v
+承天之祐 3 v
+承天之祜 3 nr
+承天寺 9 nr
+承天护 2 nr
+承太郎 3 nr
+承奉太监 2 nr
+承嬗离合 3 nz
+承安 13 ns
+承安宝 2 nr
+承宋军师 2 nr
+承审员 3 n
+承尘 2 v
+承山 3 ns
+承帮主 2 n
+承平 10 nr
+承平期 3 n
+承平盛世 3 ns
+承平面 3 n
+承应 3 v
+承建 59 v
+承建商 2 nr
+承建方 3 nr
+承建项目 3 n
+承式桥 6 nr
+承当 78 v
+承德 132 nr
+承德县 6 ns
+承德地区 4 ns
+承德市 24 ns
+承德市政府 2 ns
+承德路 3 nr
+承德避暑山庄 19 ns
+承恩殿 4 nr
+承恩袭 2 nr
+承恩门 2 nr
+承情 8 n
+承想 3 v
+承戴力 3 nr
+承托 16 v
+承扶 3 v
+承担 4063 v
+承担义务 3 n
+承担者 98 n
+承担责任 3 l
+承担费用 3 n
+承担重任 3 l
+承担风险 3 n
+承接 257 v
+承揽 45 v
+承揽人 2 l
+承教 3 v
+承教若 2 nr
+承旨学士 2 nr
+承旨焦 3 nr
+承星履草 3 nr
+承望 3 v
+承欢 134 v
+承欢能 2 v
+承欢膝下 4 i
+承气汤 11 nr
+承泣 3 v
+承泽亲王 5 nr
+承浆 3 n
+承淡安 2 nr
+承满 3 v
+承父业 2 n
+承祖制 3 nr
+承祯为 2 nr
+承租 23 v
+承租人 34 n
+承租方 3 n
+承租权 3 n
+承租者 3 n
+承筋 3 v
+承继 92 nr
+承续 3 v
+承船厢 10 n
+承节郎 2 nr
+承蒙 66 nr
+承蒙夸奖 3 nr
+承蒙指教 3 nz
+承蒙过奖 3 v
+承蓝兄 2 nr
+承袭 300 v
+承袭海 3 nr
+承袭着 3 i
+承认 4242 v
+承认现实 3 l
+承认错误 3 v
+承让 3 v
+承诺 1887 v
+承诺书 17 nr
+承诺书和 3 nz
+承诺函 8 nr
+承诺制 3 nr
+承诺卡 3 nr
+承负 2 v
+承购 6 v
+承贷 3 v
+承贷承还 3 v
+承转 2 v
+承载 224 v
+承载力 27 nr
+承载能力 3 i
+承载轴 3 nr
+承载量 8 n
+承运 197 v
+承运人 44 n
+承运公司 3 n
+承造 3 v
+承造商 3 n
+承郡王 5 nr
+承重 51 v
+承重墙 2 nr
+承重梁 3 nr
+承销 33 v
+承销人 3 n
+承销商 35 n
+承销团 18 n
+承露盘 128 nr
+承领 3 v
+承颜候色 3 nr
+技 1130 n
+技不压身 3 n
+技不如人 9 l
+技专 3 n
+技侦 3 j
+技俩 3 n
+技击 30 n
+技压群芳 2 n
+技压群雄 3 n
+技只此尔 3 v
+技嘉 3 j
+技士 6 n
+技展会 3 n
+技工 449 n
+技工学校 3 n
+技工贸 3 n
+技巧 1563 n
+技巧性 31 n
+技巧运动 9 l
+技师 130 n
+技战术 82 n
+技措 3 n
+技改 351 j
+技术 37664 n
+技术专科 3 n
+技术主管 12 n
+技术交流 3 n
+技术产业 11 n
+技术人员 111 n
+技术作物 3 n
+技术储备 3 n
+技术军士 3 n
+技术创新 21 l
+技术化 10 n
+技术升级 4 n
+技术协作 3 n
+技术厅 3 n
+技术参数 4 n
+技术史 6 n
+技术含量 9 n
+技术员 136 n
+技术咨询 3 vn
+技术园 3 n
+技术圈 3 n
+技术型 27 n
+技术培训 13 n
+技术壁垒 3 n
+技术奖 2 n
+技术学校 44 n
+技术实力 4 n
+技术密集 3 n
+技术局 4 n
+技术展 4 n
+技术工 3 n
+技术工种 3 n
+技术开发 26 n
+技术开发区 604 n
+技术引进 3 l
+技术性 216 n
+技术成果 3 n
+技术手段 12 n
+技术承包 3 n
+技术指标 8 n
+技术推广 3 n
+技术支持 10 n
+技术改造 60 l
+技术权威 3 n
+技术标准 10 n
+技术档案 3 l
+技术水准 3 n
+技术水平 51 n
+技术活 7 n
+技术犯规 3 n
+技术理性 3 n
+技术相结合 4 l
+技术社 3 n
+技术科 6 n
+技术秘密 3 n
+技术移民 3 n
+技术类 28 n
+技术细节 3 n
+技术美学 3 n
+技术职称 3 n
+技术能手 3 n
+技术落后 3 n
+技术装备 106 n
+技术规程 3 n
+技术规范 6 n
+技术讲座 3 n
+技术论坛 3 n
+技术论证 3 n
+技术设备 10 n
+技术课 6 n
+技术谈判 3 n
+技术资格 3 n
+技术转让 3 l
+技术部 50 n
+技术鉴定 3 n
+技术难度 4 n
+技术难题 2 n
+技术革新 3 l
+技术顾问 3 l
+技术馆 3 n
+技术骨干 3 n
+技校 56 n
+技校生 2 n
+技样 3 n
+技正 3 n
+技法 356 n
+技痒 16 n
+技监 3 n
+技监局 3 j
+技穷 3 j
+技能 1384 n
+技能亢进 3 vn
+技能型 21 n
+技能科 3 n
+技艺 1799 n
+技艺高超 3 j
+技贸 3 n
+技防 5 n
+技高一筹 13 j
+抁 6 zg
+抃 2 zg
+抃风舞润 3 nr
+抄 1391 v
+抄上去 3 v
+抄上来 3 v
+抄下 3 v
+抄下去 3 v
+抄下来 3 l
+抄书 13 n
+抄件 23 n
+抄写 116 v
+抄写员 3 n
+抄后路 2 l
+抄家 206 n
+抄小路 3 n
+抄底 3 n
+抄录 110 v
+抄录下来 3 l
+抄录在 3 n
+抄录编目 3 n
+抄手 29 v
+抄抄 3 v
+抄报 13 n
+抄收 20 v
+抄斩 48 v
+抄有 3 v
+抄本 171 n
+抄来 3 v
+抄来抄去 3 n
+抄查 7 v
+抄没 24 v
+抄网 3 n
+抄获 3 v
+抄袭 111 v
+抄袭旧作 3 n
+抄起 3 v
+抄起来 3 l
+抄身 3 v
+抄过 3 v
+抄过去 3 l
+抄过来 3 l
+抄近 3 v
+抄近路 12 l
+抄送 14 v
+抄送单位 3 n
+抄道 3 v
+抄集 3 v
+抅 3 zg
+抆 3 zg
+抆拭 3 v
+抆泪 3 v
+抇 3 zg
+抉 23 zg
+抉奥阐幽 3 nr
+抉择 566 v
+抉摇 3 v
+抉摘 3 v
+抉瑕掩瑜 3 nr
+抉目东门 3 nz
+抉目吴门 3 nz
+抉目悬门 3 nr
+抉目胥门 3 nr
+把 108066 p
+把住 78 v
+把儿 62 n
+把兄弟 17 n
+把关 151 v
+把头 412 v
+把好关 3 n
+把子 120 n
+把它买 3 i
+把守 246 v
+把戏 176 n
+把手 384 v
+把把关 2 v
+把持 259 v
+把持不定 19 n
+把握 2371 v
+把握住 3 n
+把握性 6 n
+把揽 3 v
+把斋 3 v
+把晤 3 v
+把柄 114 n
+把桶 3 n
+把玩 80 v
+把玩无厌 3 i
+把盏 3 n
+把素持斋 3 n
+把脉 33 n
+把臂入林 3 n
+把臂徐去 3 i
+把舵 18 v
+把薪助火 3 n
+把酒 142 v
+把酒言欢 5 n
+把门 188 n
+把门人 3 n
+把风 24 n
+把饭叫饥 3 l
+把马子 3 n
+抍 36 zg
+抎 5 zg
+抑 458 zg
+抑低 3 v
+抑制 1745 v
+抑制作用 3 l
+抑制剂 101 nz
+抑制发芽 3 n
+抑制器 6 n
+抑制型 6 n
+抑制性 32 n
+抑制效应 3 l
+抑制率 3 n
+抑压者 3 n
+抑塞磊落 3 i
+抑强扶弱 15 i
+抑怒不发 3 i
+抑恶扬善 3 i
+抑或 255 c
+抑扬 23 v
+抑扬顿挫 58 i
+抑抑扬格 3 n
+抑是 3 c
+抑止 64 v
+抑爆 22 a
+抑肽酶 3 n
+抑菌 24 v
+抑菌作用 11 l
+抑菌剂 2 nz
+抑郁 305 a
+抑郁寡欢 2 i
+抑郁症 126 i
+抑郁质 3 n
+抒 125 v
+抒写 76 v
+抒发 219 v
+抒发感情 3 n
+抒怀 20 v
+抒情 423 n
+抒情性 35 n
+抒情散文 3 n
+抒情文 3 n
+抒情曲 2 n
+抒情歌 3 n
+抒情歌曲 3 n
+抒情片 3 n
+抒情诗 158 n
+抒意 3 v
+抒解 3 v
+抒难 3 v
+抓 6491 v
+抓丁 19 nz
+抓上 3 v
+抓上去 3 v
+抓上来 3 v
+抓下 3 v
+抓下去 3 v
+抓下来 3 v
+抓不住 3 v
+抓举 34 v
+抓乖卖俏 3 i
+抓乖弄俏 3 i
+抓伤 3 v
+抓住 4069 v
+抓住机会 3 n
+抓住机遇 3 i
+抓准 3 v
+抓出 3 v
+抓出去 3 v
+抓到 3 v
+抓去 3 v
+抓取 28 v
+抓周 5 n
+抓哏 3 v
+抓图 3 v
+抓壮丁 3 i
+抓大头 3 nz
+抓大放小 7 n
+抓好 506 v
+抓小偷 3 i
+抓尖要强 3 l
+抓岩机 3 n
+抓工夫 3 n
+抓差 3 v
+抓得 3 v
+抓总儿 3 n
+抓手 10 v
+抓把紧 3 v
+抓拍 10 v
+抓拿 3 v
+抓拿犯人 3 i
+抓挠 40 v
+抓捕 78 v
+抓捕归案 3 n
+抓握 3 v
+抓斗 5 v
+抓来 3 v
+抓来抓去 3 l
+抓烂 3 v
+抓牢 3 v
+抓狂 3 v
+抓痒 11 v
+抓痕 3 n
+抓着不放 3 v
+抓瞎 11 v
+抓破 3 v
+抓破脸 2 i
+抓破脸子 3 i
+抓破脸皮 3 i
+抓破面皮 3 i
+抓空 3 v
+抓空子 3 n
+抓管机 3 n
+抓紧 612 v
+抓紧抓好 3 l
+抓紧时间 3 l
+抓纲带目 3 i
+抓纲治国 3 n
+抓细 3 v
+抓耳挠腮 42 i
+抓耳搔腮 2 i
+抓苗头 3 i
+抓药 14 v
+抓获 180 v
+抓获归案 3 i
+抓获罪犯 3 i
+抓词 3 v
+抓贼 3 n
+抓赌 8 v
+抓走 61 v
+抓起 572 v
+抓轨 3 v
+抓辫子 3 n
+抓过 3 v
+抓进 3 v
+抓进去 3 v
+抓进来 3 v
+抓钢机 3 nz
+抓钩 18 v
+抓阄 31 v
+抓阄儿 3 v
+抓革命促 3 v
+抓饭 15 v
+抔 6 zg
+投 5530 vn
+投一票 3 n
+投上 3 n
+投上去 3 v
+投上来 3 v
+投下 3 v
+投下去 3 v
+投下来 3 v
+投不准 3 v
+投不出 3 v
+投不到 3 v
+投中 135 v
+投之一桃 3 n
+投之以桃 6 l
+投书 19 n
+投于 3 v
+投井 36 n
+投井下石 3 n
+投井自尽 3 i
+投产 993 vn
+投亲 8 n
+投亲靠友 11 n
+投以 31 v
+投传而去 3 i
+投保 160 vn
+投保人 38 n
+投保单 3 n
+投光灯 3 n
+投入 6776 v
+投入产出 3 n
+投入产品 3 n
+投入使用 3 n
+投入品 10 n
+投入市场 3 n
+投入资本 3 n
+投入量 9 n
+投其所好 57 i
+投军 3 n
+投出 3 v
+投出去 3 v
+投出来 3 vn
+投函 3 n
+投刀 3 n
+投刃皆虚 3 i
+投到 3 v
+投劳 4 n
+投医 8 n
+投卵击石 3 n
+投去 3 v
+投合 28 vn
+投向 465 n
+投回 3 vn
+投壶 9 n
+投壶电笑 3 i
+投契 26 n
+投奔 446 v
+投奔自由 3 l
+投子 3 n
+投宿 92 v
+投宿在 3 n
+投寄 3 vn
+投寄信件 3 n
+投射 238 v
+投射模 3 n
+投射灯 3 n
+投射物 3 n
+投射维数 3 n
+投山窜海 3 l
+投工 5 vn
+投巨资 3 n
+投币 5 n
+投币口 3 vn
+投币孔 3 n
+投币式 3 n
+投师 31 n
+投弃 3 v
+投弹 96 n
+投弹器 2 n
+投弹手 3 n
+投影 207 n
+投影仪 28 n
+投影变换 2 i
+投影图 8 n
+投影射程 3 n
+投影幕 3 n
+投影机 40 n
+投影画 3 n
+投影算符 3 n
+投影设备 3 n
+投影面 3 n
+投得 3 v
+投怀 3 vn
+投怀送抱 3 l
+投戈讲艺 3 n
+投手 43 n
+投技 3 n
+投报 3 vn
+投拍 10 v
+投挤 3 v
+投掷 277 v
+投播 3 vn
+投改 3 v
+投放 477 v
+投放市场 3 n
+投放量 3 n
+投效 32 n
+投敌 95 vn
+投敌卖国 3 n
+投料 9 n
+投映 3 v
+投木报琼 3 nz
+投机 598 n
+投机事业 3 n
+投机份子 3 n
+投机倒把 34 i
+投机分子 3 n
+投机取巧 44 n
+投机商 71 n
+投机家 23 n
+投机性 22 n
+投机者 43 n
+投机钻营者 3 n
+投来 3 v
+投来投去 3 i
+投枪 139 n
+投标 123 n
+投标书 3 n
+投标人 15 n
+投标法 4 n
+投标竞争 3 n
+投桃之报 3 n
+投桃报李 14 n
+投案 49 n
+投案自首 3 i
+投档线 3 l
+投梭 3 v
+投梭折齿 3 n
+投毒 18 vn
+投毒一案 3 n
+投毒案 3 n
+投水 3 n
+投江 3 n
+投河 41 n
+投河奔井 3 i
+投河自尽 3 i
+投河觅井 3 i
+投法 3 vn
+投注 101 v
+投注单 3 n
+投注站 3 n
+投注网 3 n
+投注额 4 n
+投洽会 3 j
+投海 3 n
+投环自尽 3 l
+投球 52 n
+投生 11 n
+投由窜海 3 l
+投畀豺虎 3 nz
+投石 28 n
+投石拔距 3 n
+投石机 3 n
+投石问路 11 n
+投票 4148 n
+投票决定 3 n
+投票制 8 n
+投票数 3 n
+投票权 252 n
+投票率 7 n
+投票站 9 n
+投票箱 4 n
+投票系统 71 n
+投票者 8 n
+投票表决 3 l
+投票选举 3 n
+投稿 48 n
+投稿人 3 n
+投稿箱 3 n
+投竿 3 n
+投笔从戎 20 i
+投篮 232 n
+投篮不中 3 l
+投篮得分 3 n
+投簧 3 n
+投缘 41 n
+投考 22 v
+投股 3 n
+投胎 103 n
+投膏止火 3 n
+投药 4 n
+投融资 23 n
+投袂援戈 3 i
+投袂而起 17 i
+投袂荷戈 3 v
+投诉 2719 v
+投诉信 7 n
+投诉无门 3 n
+投诉率 5 n
+投诉者 3 n
+投诉量 4 n
+投诚 103 v
+投资 13943 vn
+投资业 6 n
+投资人 91 n
+投资体制 3 n
+投资信托 3 n
+投资决策 3 n
+投资区 6 n
+投资司 2 n
+投资品 21 n
+投资商 55 n
+投资国 29 n
+投资性 13 n
+投资总额 3 n
+投资收益 3 n
+投资方 33 n
+投资气氛 3 n
+投资法 21 n
+投资热 7 n
+投资率 14 n
+投资界 5 n
+投资网 3 n
+投资者 2201 n
+投资规模 3 n
+投资选择 3 l
+投资部 7 n
+投资银行 3 n
+投资银行业 2 n
+投资额 141 n
+投走 3 v
+投起 3 v
+投足 3 v
+投身 490 n
+投身于 3 n
+投过 3 v
+投过去 3 v
+投过来 3 v
+投运 11 vn
+投进 3 v
+投进去 3 v
+投进来 3 v
+投送 97 v
+投递 132 vn
+投递员 7 n
+投递局 2 n
+投钱 9 n
+投钱口 3 n
+投钱箱 3 n
+投闲置散 3 i
+投闲置敬 3 i
+投间抵隙 3 l
+投阱下石 3 vn
+投降 3095 v
+投降主义 44 n
+投降书 29 n
+投降派 16 n
+投隙抵巇 3 z
+投靠 300 v
+投鞭断流 4 n
+投食 2 n
+投饵 3 n
+投鼠之忌 3 i
+投鼠忌器 52 n
+抖 1455 zg
+抖下 3 v
+抖下去 3 v
+抖下来 3 l
+抖乱 3 v
+抖了起来 3 l
+抖出 3 v
+抖出去 3 i
+抖出来 3 i
+抖动 368 v
+抖动着 3 l
+抖嘴 3 v
+抖威风 7 i
+抖底 3 v
+抖开 3 v
+抖抖 3 v
+抖抖筛筛 3 i
+抖抖簌簌 3 z
+抖掉 3 v
+抖搂 13 v
+抖搂精神 3 nz
+抖擞 42 v
+抖擞精神 70 i
+抖漏 3 v
+抖索 22 v
+抖翻 3 v
+抖落 46 v
+抖起 3 v
+抖起来 3 l
+抖露 8 v
+抖颤 19 v
+抗 3426 v
+抗争 584 nz
+抗争性 3 n
+抗休克 3 n
+抗体 478 n
+抗体工程 3 l
+抗体文库 3 nz
+抗体谱 3 l
+抗体过量 3 l
+抗体酶 3 l
+抗倒伏 3 l
+抗倒伏性 3 l
+抗倭 57 v
+抗倭斗争 3 v
+抗军 3 n
+抗冲 6 vn
+抗冲击 3 nz
+抗冻 14 vn
+抗冻糖肽 3 nz
+抗冻肽 3 nz
+抗冻蛋白 3 l
+抗凝剂 3 n
+抗凝蛋白 3 n
+抗凝血 3 n
+抗凝血酶 3 n
+抗击 665 vn
+抗利尿素 3 nz
+抗力 30 nz
+抗力形 3 n
+抗力点 3 n
+抗力臂 3 n
+抗压 3 nz
+抗压强度 19 l
+抗压性 3 n
+抗原 508 n
+抗原交联 3 nt
+抗原体 3 n
+抗原刺激 3 l
+抗原加工 3 n
+抗原受体 3 n
+抗原呈递 3 vn
+抗原性 33 n
+抗原识别 3 n
+抗原选择 3 l
+抗变剂 3 nz
+抗告 2 n
+抗命 66 nz
+抗坏血酸 62 nz
+抗基弯曲 3 l
+抗增殖 3 l
+抗大 8 nz
+抗婚 3 v
+抗宣 3 j
+抗宣队 3 nt
+抗寒 34 n
+抗寒力 3 n
+抗寒性 3 n
+抗尘走俗 3 n
+抗属 13 n
+抗干扰 104 l
+抗干扰性 11 n
+抗干扰能力 6 nz
+抗张强度 3 l
+抗弯 13 v
+抗弯强度 3 l
+抗御 144 v
+抗心希古 3 nz
+抗心律 3 l
+抗性 50 n
+抗性机制 3 l
+抗惊厥 3 n
+抗感染 3 l
+抗战 3066 nz
+抗战史 11 nz
+抗战时期 127 nz
+抗打 3 nz
+抗扭劲度 3 vn
+抗抑郁 3 n
+抗抑郁剂 3 nz
+抗抗议 3 n
+抗拉力 2 nz
+抗拉强度 27 l
+抗拒 536 v
+抗拒从严 13 l
+抗拒性 3 l
+抗拒火环 3 l
+抗捐 3 vn
+抗撕裂 3 vn
+抗敌 688 v
+抗敌剧社 3 nt
+抗敌素 3 nz
+抗救灾 2 l
+抗日 5260 nz
+抗日军政大学 42 nt
+抗日战争 2153 nz
+抗日战争纪念馆 2 n
+抗日救亡 493 l
+抗日救亡运动 259 nz
+抗日救国 3 nz
+抗日民族统一战线 291 nz
+抗日红军大学 11 nt
+抗旱 133 vn
+抗旱剂 3 n
+抗旱性 4 n
+抗暴 23 n
+抗毁 7 v
+抗毒 3 nz
+抗毒素 41 nz
+抗毒血清 3 l
+抗氧剂 30 nz
+抗氧化 75 nz
+抗氧化剂 178 nz
+抗氧化性 3 nz
+抗氧化物 3 nz
+抗氰呼吸 3 l
+抗水 4 nz
+抗污染 2 nz
+抗法 20 nz
+抗法战争 14 nz
+抗洪 229 vn
+抗洪抢险 3 l
+抗洪救灾 3 l
+抗涝 6 n
+抗清 165 v
+抗清扶明 3 nz
+抗渗 8 nz
+抗溶剂 3 nz
+抗滑桩 2 n
+抗滑稳性 3 n
+抗灾 67 vn
+抗灾救灾 3 l
+抗炎药 3 n
+抗热 16 nz
+抗热性 2 n
+抗焦虑 3 n
+抗爆 26 nz
+抗爆性 3 nz
+抗生 3 nz
+抗生物肽 3 nz
+抗生素 618 nz
+抗生谱 3 l
+抗电磁 3 nz
+抗疏水剂 3 n
+抗疟 18 n
+抗疟药 9 n
+抗疲劳 3 vn
+抗病 334 n
+抗病力 8 n
+抗病品种 3 n
+抗病性 5 n
+抗病毒 112 n
+抗癌 171 vn
+抗癌剂 3 n
+抗癌基因 3 n
+抗癌性 3 n
+抗癌药 7 n
+抗癫痫 3 n
+抗皱 12 nz
+抗真菌 3 l
+抗真菌剂 3 nz
+抗硷性 3 vn
+抗碱 4 nz
+抗磁位移 3 n
+抗磁性 27 n
+抗磨 3 v
+抗磨剂 4 nz
+抗磨性 3 nz
+抗磨损 3 l
+抗税 46 n
+抗突变剂 3 n
+抗纤 3 nz
+抗纤溶酶 3 l
+抗终止子 3 l
+抗结核 3 n
+抗缴 3 v
+抗美援朝 277 j
+抗美援朝战争 150 nz
+抗美援越 3 nz
+抗老 3 vn
+抗老化 14 j
+抗老性 3 n
+抗联 39 nz
+抗育 3 vn
+抗肿瘤 3 l
+抗腐蚀 22 nz
+抗艾滋 3 z
+抗药 3 nz
+抗药性 35 nz
+抗药蛋白 3 l
+抗荷服 3 nz
+抗菌 128 n
+抗菌剂 2 nz
+抗菌材料 3 nz
+抗菌素 38 nz
+抗菌肽 3 nz
+抗菌药 29 nz
+抗蒸腾剂 3 n
+抗虫性 2 n
+抗虫棉 6 n
+抗虫育种 3 n
+抗蛋白酶 3 l
+抗蠕霉素 3 v
+抗血栓 3 n
+抗血清 3 l
+抗衡 414 nz
+抗衡作用 3 l
+抗衰老 3 n
+抗议 1222 nz
+抗议书 10 n
+抗议信 3 nt
+抗议声 4 n
+抗议性 3 n
+抗议者 3 n
+抗诉 27 v
+抗走 3 v
+抗跌 3 v
+抗跌性 3 l
+抗辐射 271 nz
+抗辩 25 v
+抗辩人 3 n
+抗辩权 3 n
+抗过敏 3 l
+抗逆 7 v
+抗逆性 268 n
+抗酸 3 nz
+抗酸性 3 nz
+抗锯齿 3 n
+抗雪救灾 5 l
+抗震 87 n
+抗震力 3 n
+抗震性 2 n
+抗震救灾 332 l
+抗震歌 4 n
+抗霉素 3 nz
+抗静电 11 nz
+抗非 3 v
+抗非典 3 n
+抗颜为师 3 l
+抗风力 11 nz
+抗风性 3 n
+抗风湿 3 nz
+折 4410 v
+折上 3 v
+折上去 3 v
+折上来 3 v
+折下 3 v
+折下去 3 v
+折下来 3 v
+折不断 3 v
+折中 43 v
+折中主义 3 n
+折为 3 v
+折价 62 n
+折价出售 3 n
+折价券 3 n
+折价率 3 n
+折伞 3 v
+折伤 5 v
+折倒 3 v
+折儿 6 n
+折光 25 n
+折光度 3 n
+折光率 3 n
+折光镜 3 nr
+折兑 3 v
+折兑率 3 n
+折兵 9 n
+折冲 39 nr
+折冲之臣 3 nr
+折冲千里 3 i
+折冲厌难 3 i
+折冲尊俎 3 i
+折冲府 28 nr
+折冲御侮 3 n
+折冲樽俎 3 i
+折凳 3 n
+折出 3 v
+折刀 3 n
+折半 4 v
+折半出售 3 v
+折卖 3 v
+折受 3 v
+折变 38 v
+折叠 241 v
+折叠为 3 nr
+折叠伞 3 nr
+折叠型 2 b
+折叠床 3 nz
+折叠式 56 b
+折叠机 3 b
+折叠桌 3 n
+折叠椅 3 n
+折叠窗 3 n
+折叠车 3 n
+折叠门 3 n
+折叠面 3 b
+折叶 3 n
+折合 467 v
+折合振子 3 n
+折回 211 v
+折回去 3 i
+折回来 3 nr
+折多山 8 nr
+折头 3 v
+折姜 2 n
+折子 638 n
+折子戏 35 n
+折实 3 v
+折寿 8 nr
+折射 404 v
+折射光 3 n
+折射出 3 n
+折射器 3 n
+折射式 2 n
+折射性 3 n
+折射波 3 n
+折射率 162 n
+折射线 3 n
+折射角 11 n
+折射计 2 n
+折尺 3 nr
+折层 3 n
+折帐 3 n
+折床 3 v
+折弯 3 v
+折弯机 3 n
+折征 3 v
+折得 3 v
+折成 3 v
+折戟 6 nr
+折戟沈河 3 nr
+折戟沉沙 11 i
+折扇 289 n
+折扣 273 v
+折扣价 2 n
+折扣店 5 n
+折扣率 3 n
+折扣票 3 n
+折抵 3 v
+折挫 3 v
+折损 3 v
+折损率 3 n
+折文书 3 nr
+折断 451 v
+折旧 111 v
+折旧基金 3 n
+折旧率 12 n
+折旧费 14 n
+折服 93 v
+折本 5 n
+折杀 24 v
+折枝 19 n
+折桂 22 nr
+折椅 3 n
+折槁振落 3 i
+折款 3 n
+折洗 3 v
+折物 3 n
+折现 3 v
+折痕 3 n
+折皱 2 n
+折矛 2 n
+折矩周规 3 nr
+折短 3 v
+折磨 990 v
+折福 3 nr
+折秤 3 n
+折算 92 v
+折算法 3 n
+折算率 3 n
+折箭 8 n
+折箭为盟 3 i
+折箭为誓 3 i
+折纳 15 v
+折纸 9 n
+折纸机 3 n
+折纹 8 n
+折线 13 n
+折线图 3 n
+折而族之 3 nr
+折耗 3 v
+折肉 3 n
+折腰 23 v
+折腰五斗 3 n
+折腾 777 v
+折色 5 n
+折节 2 n
+折节下士 3 n
+折节向学 3 n
+折节读书 3 n
+折衷 118 v
+折衷主义 21 n
+折衷方案 3 n
+折衷法 3 v
+折褶 3 n
+折角 2 n
+折让 6 v
+折账 3 v
+折起 3 v
+折起来 3 v
+折足覆 3 v
+折足覆餗 3 n
+折跟头 3 n
+折转 3 v
+折辩 2 v
+折辱 72 v
+折返 22 v
+折返跑 3 i
+折进 3 v
+折进去 3 v
+折进来 3 nr
+折迭 3 v
+折长补短 3 i
+折页 8 n
+折页机 3 n
+折首不悔 3 i
+折鼎覆餗 3 n
+抚 1444 ns
+抚世酬物 3 nz
+抚今思昔 3 i
+抚今悼昔 3 n
+抚今痛昔 3 i
+抚今追昔 11 i
+抚仙湖 13 ns
+抚养 367 v
+抚养人 5 n
+抚养权 4 n
+抚养费 22 n
+抚剑 3 v
+抚古思今 3 i
+抚媚 3 v
+抚孤 3 v
+抚宁 6 ns
+抚宁县 5 ns
+抚尸痛哭 3 i
+抚州 54 ns
+抚州市 8 ns
+抚平 36 ns
+抚弄 39 v
+抚心 3 v
+抚心自问 5 i
+抚恤 137 v
+抚恤金 60 n
+抚慰 211 v
+抚慰者 3 n
+抚慰金 5 n
+抚掌 11 v
+抚掌击节 3 n
+抚掌大笑 12 i
+抚摩 115 ns
+抚摸 623 v
+抚时感事 3 i
+抚景伤情 3 n
+抚松 7 v
+抚松县 10 ns
+抚柔 3 ns
+抚梁易柱 3 i
+抚河 40 ns
+抚熨 3 n
+抚爱 27 v
+抚琴 57 ns
+抚绥万方 3 ns
+抚育 91 v
+抚育费 2 n
+抚背扼喉 3 v
+抚膺之痛 3 v
+抚膺顿足 3 nt
+抚躬自问 3 i
+抚远 42 ns
+抚远县 9 ns
+抚问 3 v
+抚面 3 n
+抚面痛哭 3 i
+抚顺 173 ns
+抚顺县 3 ns
+抚顺市 20 ns
+抚顺战犯管理所 2 i
+抚顺路 3 ns
+抚髀兴叹 3 nr
+抛 2080 zg
+抛下 3 v
+抛下去 3 v
+抛下来 3 v
+抛丸 2 n
+抛丸机 3 i
+抛乡离井 3 i
+抛体 3 n
+抛体运动 3 l
+抛光 92 v
+抛光剂 8 n
+抛光机 3 n
+抛光液 3 n
+抛光片 7 n
+抛光砖 3 n
+抛光粉 3 i
+抛光蜡 3 i
+抛光轮 3 n
+抛出 3 v
+抛出去 3 v
+抛出来 3 v
+抛到 3 v
+抛却 15 v
+抛去 3 v
+抛向 3 v
+抛售 105 v
+抛在后面 3 i
+抛头露面 48 i
+抛头颅 17 i
+抛妻别子 3 n
+抛媚眼 3 i
+抛射 88 v
+抛射体 3 n
+抛开 165 v
+抛弃 684 v
+抛得 3 v
+抛戈弃甲 3 i
+抛投 3 v
+抛掉 3 v
+抛掷 179 v
+抛撒 59 v
+抛来 3 v
+抛来抛去 3 z
+抛洒 30 v
+抛物 9 n
+抛物子群 3 n
+抛物线 73 n
+抛物面 35 n
+抛物面镜 3 n
+抛球 3 n
+抛盘 14 v
+抛石 14 n
+抛砖 3 n
+抛砖引玉 23 i
+抛离 18 v
+抛秧 4 v
+抛空 37 v
+抛绣球 3 n
+抛绳装置 3 n
+抛舍 3 v
+抛荒 20 v
+抛费 3 vn
+抛起 3 v
+抛起来 3 v
+抛进 3 v
+抛锚 38 v
+抛除 3 v
+抟 46 v
+抟心壹志 3 nr
+抟心揖志 3 nr
+抟沙作饭 3 vn
+抟沙嚼蜡 3 n
+抟空捕影 3 n
+抟香弄粉 3 nr
+抠 308 v
+抠出 3 a
+抠出来 3 l
+抠到 3 v
+抠唆 3 v
+抠字眼 3 l
+抠心挖肚 3 v
+抠心挖胆 3 v
+抠心挖血 3 vn
+抠抠搜搜 2 l
+抠抠索索 3 l
+抠掉 3 v
+抠搂 3 v
+抠搜 3 l
+抠破 3 v
+抠算 3 v
+抠门 20 a
+抠门儿 3 l
+抡 338 v
+抡购风 3 vn
+抢 5785 v
+抢上风 3 v
+抢下 39 v
+抢下去 3 v
+抢下来 3 v
+抢亲 9 v
+抢修 133 v
+抢修工作 3 l
+抢修班 3 nz
+抢修车 6 n
+抢先 417 v
+抢先一步 3 l
+抢先报 3 n
+抢光 55 v
+抢到 3 v
+抢功 3 a
+抢劫 488 v
+抢劫杀人 3 l
+抢劫案 7 n
+抢劫案件 3 l
+抢劫犯 16 l
+抢劫犯罪 3 l
+抢劫罪 7 l
+抢劫者 2 n
+抢占 254 v
+抢占市场 3 n
+抢去 3 v
+抢反弹 3 l
+抢发 16 v
+抢吃 6 v
+抢嘴 3 v
+抢地呼天 3 l
+抢墒 3 v
+抢夺 325 v
+抢夺到 3 l
+抢夺案 3 n
+抢夺罪 3 l
+抢婚 15 v
+抢嫌 3 v
+抢孤 3 v
+抢市 3 v
+抢帽子 3 l
+抢度 3 n
+抢建 6 v
+抢得 3 v
+抢快 3 v
+抢快版 3 l
+抢戏 3 v
+抢手 57 v
+抢手货 34 nz
+抢抓 8 v
+抢护 3 v
+抢拍 4 v
+抢掠 103 v
+抢摘 3 v
+抢收 13 v
+抢攻 151 v
+抢救 851 v
+抢救人质 3 l
+抢救出来 3 l
+抢救室 4 nz
+抢救工作 3 l
+抢救性 7 n
+抢救无效 3 l
+抢救运动 7 nz
+抢断 77 v
+抢断王 5 n
+抢来 3 v
+抢来抢去 3 l
+抢枪 5 v
+抢案 3 v
+抢法 3 v
+抢注 21 v
+抢渡 64 v
+抢滩 49 n
+抢炮 3 v
+抢点 29 n
+抢球 3 v
+抢生意 13 v
+抢白 74 v
+抢白道 5 n
+抢眼 80 v
+抢种 6 v
+抢答 11 v
+抢答器 3 n
+抢红包 3 l
+抢话 3 v
+抢购 63 v
+抢购一空 11 nz
+抢购潮 3 n
+抢购风 3 nz
+抢走 179 v
+抢走了 3 l
+抢跑 8 v
+抢过 3 v
+抢过去 3 v
+抢过来 3 l
+抢运 26 v
+抢道 10 v
+抢钱 3 v
+抢银行 3 n
+抢镜头 5 v
+抢险 233 v
+抢险救灾 3 l
+抢险车 2 n
+抢饭碗 3 n
+抢鲜 3 a
+抢麦 3 n
+护 2810 zg
+护专 3 n
+护专生 3 n
+护丧 3 v
+护产 3 n
+护产士 3 n
+护人 3 n
+护住 3 v
+护佑 179 nz
+护兵 44 n
+护具 19 n
+护养 6 v
+护卫 621 nz
+护卫兵 3 n
+护卫军 3 n
+护卫者 2 n
+护卫舰 579 n
+护卫艇 17 n
+护卫队 56 n
+护厂 3 n
+护发 22 v
+护发乳 3 nz
+护发品 3 n
+护发素 12 n
+护唇膏 3 n
+护喉 3 n
+护园人 5 n
+护国 134 n
+护国佑民 3 vn
+护国军 25 n
+护国寺 3 nz
+护国运动 7 nz
+护坡 34 n
+护坡桩 3 n
+护垫 34 n
+护城 9 n
+护城河 103 nz
+护堤 19 n
+护墙 9 n
+护墙板 3 n
+护墙纸 3 n
+护壁 2 n
+护壁板 3 n
+护士 676 n
+护士学校 3 n
+护士室 3 nz
+护士币 3 n
+护士服 3 nz
+护士网 3 nz
+护士节 3 n
+护士长 61 n
+护套 20 nz
+护好 3 v
+护嫂 2 n
+护守 3 v
+护宪 3 n
+护封 3 v
+护岸 18 n
+护岸林 3 n
+护岸石 3 n
+护工 3 n
+护师 4 n
+护幕 3 n
+护庇 3 v
+护得 3 v
+护心镜 15 n
+护念 3 n
+护戒 3 n
+护手 22 n
+护手霜 3 nz
+护持 63 v
+护教 3 nz
+护旗 5 n
+护旗手 3 n
+护来护去 3 n
+护板 10 n
+护林 17 nz
+护林员 3 n
+护林防火 3 n
+护栏 38 n
+护栏灯 3 n
+护栏网 3 n
+护树 4 n
+护校 11 n
+护棺 3 n
+护民官 3 n
+护法 296 n
+护法神 9 n
+护照 242 n
+护照者 3 n
+护爱 3 v
+护犊子 3 n
+护理 501 n
+护理专科 3 n
+护理产品 3 n
+护理人员 3 n
+护理助产 3 n
+护理员 9 n
+护理学 3 n
+护理液 179 n
+护理系 2 n
+护理职业 3 n
+护理费 9 n
+护理部 5 n
+护田林 2 nz
+护盒 3 n
+护盔 3 n
+护盖物 3 n
+护盘 2 n
+护目 3 n
+护目镜 7 n
+护眼 3 n
+护眼灯 3 n
+护短 38 v
+护秋 3 n
+护税 3 n
+护符 10 nz
+护罩 9 n
+护翼 5 n
+护耳 9 n
+护耳器 3 nz
+护肘 5 v
+护肝片 3 n
+护肤 46 n
+护肤品 52 n
+护肤用品 3 n
+护肤霜 3 nz
+护肩 2 n
+护胸 24 n
+护腕 5 n
+护腿 7 n
+护膝 26 v
+护臂 2 n
+护舒宝 3 nz
+护航 184 v
+护航舰 9 n
+护航舰队 3 nz
+护航船 3 n
+护色剂 8 n
+护花 3 n
+护花使者 3 n
+护起 3 v
+护路 3 n
+护路林 3 nz
+护路队 11 n
+护身 175 v
+护身法 3 n
+护身符 79 n
+护车 3 n
+护过饰非 3 n
+护运 3 n
+护送 551 v
+护送队 3 n
+护院 3 n
+护青 3 n
+护面 3 n
+护面具 3 n
+护驾 96 v
+报 14647 n
+报上 903 v
+报上去 3 v
+报上名来 3 l
+报上来 3 v
+报业 211 n
+报业网 3 n
+报丧 37 v
+报之以 3 v
+报之以李 7 i
+报了名 25 v
+报京 2 v
+报亭 4 n
+报人 3 n
+报仇 1185 v
+报仇血耻 3 i
+报仇雪恨 100 i
+报仇雪耻 16 i
+报以 84 v
+报价 366 n
+报价单 11 n
+报价网 3 n
+报价表 3 n
+报价适宜 3 n
+报低 3 v
+报体 3 n
+报佳音 3 n
+报信 106 v
+报修 8 v
+报值 3 n
+报值挂号 3 n
+报停 3 v
+报偿 36 v
+报关 54 v
+报关单 2 n
+报关员 27 n
+报关行 2 n
+报冤 3 v
+报冤雪恨 3 i
+报冰公事 3 n
+报出 54 v
+报出去 3 v
+报分 3 n
+报分数 3 n
+报刊 776 n
+报刊书籍 3 n
+报刊亭 2 n
+报刊发行 3 n
+报刊杂志 3 n
+报刊社 2 n
+报到 41 v
+报到率 9 n
+报到证 3 n
+报功 3 n
+报务 3 n
+报务员 60 n
+报协 2 v
+报单 8 n
+报号 3 n
+报名 1606 v
+报名单 3 n
+报名处 10 n
+报名条件 3 n
+报名点 64 n
+报名者 30 n
+报名表 48 n
+报名费 22 n
+报呈 3 v
+报告 16715 n
+报告书 191 n
+报告会 146 n
+报告单 22 n
+报告厅 26 n
+报告员 2 n
+报告团 60 n
+报告基因 3 n
+报告文学 113 n
+报告文学集 2 n
+报告期 39 n
+报告稿 4 n
+报告纸 3 n
+报告起草 3 n
+报命 3 n
+报喜 61 v
+报喜贺 3 v
+报喜鸟 3 n
+报国 226 n
+报国寺 25 n
+报国志 4 n
+报国无门 7 l
+报备 3 v
+报复 779 v
+报复主义 3 n
+报复性 39 n
+报复性地 3 l
+报复陷害 3 i
+报失 7 v
+报头 9 n
+报头栏 3 n
+报夹 3 n
+报奖 3 n
+报嫂 3 n
+报安 3 n
+报审 3 v
+报导 91 n
+报导出来 3 l
+报帐 3 n
+报帖 3 n
+报幕 7 n
+报幕员 6 n
+报平安 3 n
+报应 211 v
+报应不爽 11 i
+报废 107 v
+报废井 3 n
+报废车 3 n
+报廊 3 n
+报往跋来 3 i
+报德 3 n
+报忧 13 v
+报怨 47 v
+报怨雪耻 3 i
+报恩 85 v
+报恩寺 3 n
+报批 45 v
+报报 3 n
+报捷 81 n
+报摊 10 n
+报收 98 v
+报效 138 n
+报效万一 3 l
+报效祖国 3 n
+报数 22 n
+报文 22 n
+报文交换 3 v
+报文格式 3 n
+报料 3 n
+报料人 3 n
+报时 34 n
+报时器 3 n
+报时钟 4 n
+报春 15 n
+报春花 20 n
+报晓 37 v
+报本反始 3 n
+报本坊 3 n
+报李投桃 3 n
+报条 3 n
+报板 3 n
+报架 3 n
+报栏 14 n
+报案 88 n
+报案人 5 n
+报检 2 v
+报检员 3 n
+报父仇 3 n
+报界 29 n
+报盘 6 n
+报知 268 v
+报社 321 n
+报社记者 3 n
+报禁 3 v
+报称 63 v
+报税 3 n
+报站 4 n
+报章 26 n
+报章杂志 7 n
+报童 24 n
+报端 36 n
+报竹平安 3 ns
+报答 426 v
+报箱 6 n
+报纸 2719 n
+报纸堆 3 n
+报纸夹 3 n
+报纸广告 3 n
+报纸杂志 3 n
+报经 7 n
+报缴 3 v
+报考 1586 v
+报考者 49 n
+报菜名 3 n
+报表 294 n
+报表纸 3 n
+报装 3 v
+报警 290 n
+报警亭 2 n
+报警仪 3 n
+报警信号 9 n
+报警台 3 n
+报警器 40 n
+报警装置 3 n
+报警阀 3 n
+报话机 31 n
+报请 52 v
+报账 8 v
+报贩 3 n
+报费 3 n
+报载 11 v
+报送 79 v
+报道 9955 v
+报道基因 3 n
+报道失实 3 i
+报道失时 3 i
+报酬 815 n
+报酬分析 3 l
+报酬权 5 n
+报酬率 11 n
+报销 232 v
+报错 3 v
+报雠雪恨 3 v
+报靶员 8 n
+报馆 64 n
+报验 2 n
+报高 3 v
+抨 7 v
+抨击 463 v
+抨弹 3 v
+披 1371 v
+披上 318 v
+披上去 3 v
+披上来 3 v
+披上绿装 3 v
+披卷 3 v
+披发 3 v
+披发入山 3 i
+披发左衽 2 i
+披发文身 3 n
+披发缨冠 3 n
+披古通今 3 l
+披在 3 v
+披坚执锐 11 i
+披头 3 v
+披头士 10 i
+披头士乐队 3 i
+披头散发 82 i
+披头盖脑 3 i
+披屋 3 v
+披巾 7 n
+披开 3 v
+披得 3 v
+披心沥血 3 i
+披心相付 3 n
+披拂 6 v
+披挂 232 v
+披挂上阵 16 i
+披搭 3 v
+披散 61 v
+披星带月 3 i
+披星戴月 20 i
+披林撷秀 3 z
+披枷带锁 2 i
+披枷戴锁 3 i
+披榛采兰 3 nz
+披毛戴角 3 i
+披毛求瑕 3 i
+披毛犀 19 n
+披毛索靥 3 n
+披毛索黡 3 nz
+披沙拣金 3 i
+披沙简金 3 i
+披沥 3 nz
+披沥肝胆 3 i
+披沥肝膈 3 n
+披甲 307 n
+披盖 6 v
+披盖在 3 i
+披盖着 3 i
+披着 3 v
+披红 16 v
+披红戴花 8 i
+披红挂彩 8 i
+披红挂绿 3 i
+披罗戴翠 3 i
+披肝沥胆 14 i
+披肝沥血 3 i
+披肝露胆 3 i
+披肩 71 v
+披肩发 3 i
+披荆 3 v
+披荆执锐 3 i
+披荆斩棘 23 i
+披萨 2 n
+披衣 74 v
+披袍 3 n
+披裘带索 3 i
+披裘负薪 3 i
+披褂 3 n
+披襟 3 n
+披襟解带 3 i
+披覆 3 v
+披覆褶皱 3 n
+披览 3 v
+披起 3 v
+披起来 3 v
+披载 3 v
+披锦 3 n
+披阅 10 v
+披霄决汉 3 i
+披露 1613 v
+披露肝胆 3 i
+披露腹心 3 i
+披靡 28 v
+披风 104 v
+披麻带孝 3 i
+披麻带索 3 i
+披麻戴孝 23 i
+披麻救火 3 i
+抬 4456 v
+抬上 3 v
+抬上去 3 v
+抬上来 3 v
+抬下 3 v
+抬下去 3 v
+抬下来 3 v
+抬不动 3 v
+抬举 121 v
+抬价 16 v
+抬出 3 v
+抬出去 3 v
+抬出来 3 v
+抬升 146 v
+抬去 3 v
+抬回 3 v
+抬回去 3 l
+抬回来 3 l
+抬头 1892 v
+抬头不见低头见 11 l
+抬头挺胸 3 l
+抬头纹 6 n
+抬庄 3 v
+抬得 3 v
+抬手 211 v
+抬抬 3 v
+抬抬看 3 l
+抬捧 3 v
+抬杠 40 v
+抬来 3 v
+抬来抬去 3 l
+抬枪 13 v
+抬棺 24 v
+抬爱 5 v
+抬租 3 v
+抬秤 3 v
+抬筐 3 n
+抬肩 6 v
+抬脚 3 v
+抬脚动手 3 l
+抬脸 3 v
+抬腿 3 v
+抬走 3 v
+抬起 1690 v
+抬起头儿 3 l
+抬起头来 3 l
+抬轿 3 n
+抬轿子 32 l
+抬过 3 v
+抬过去 3 v
+抬过来 3 l
+抬进 3 v
+抬进去 3 v
+抬进来 3 v
+抬阁 3 v
+抬首 3 v
+抬高 528 v
+抬高自己 3 l
+抬高身价 3 l
+抱 6044 v
+抱上去 3 v
+抱上来 3 v
+抱下 3 v
+抱下去 3 v
+抱下来 3 l
+抱不平 15 i
+抱令守律 3 n
+抱住 1133 v
+抱住不放 3 l
+抱佛脚 39 l
+抱关执籥 3 ns
+抱关执钥 3 i
+抱养 9 v
+抱冰公事 3 n
+抱出 3 v
+抱出去 3 v
+抱出来 3 v
+抱厦 16 n
+抱去 3 v
+抱团 12 n
+抱团儿 3 n
+抱头 76 v
+抱头大哭 3 i
+抱头梁 3 i
+抱头痛哭 47 i
+抱头鼠窜 38 i
+抱委屈 3 i
+抱子弄孙 3 i
+抱子甘蓝 3 i
+抱存 3 v
+抱守 3 v
+抱定 51 v
+抱宝怀珍 3 i
+抱屈 15 v
+抱屈衔冤 3 i
+抱布贸丝 3 n
+抱怨 945 v
+抱怨地 3 i
+抱怨声 6 i
+抱怨雪耻 3 i
+抱恙 3 n
+抱恨 11 v
+抱恨终天 4 i
+抱恨终身 3 i
+抱恨黄泉 3 i
+抱愧 19 v
+抱憾 73 a
+抱憾终生 3 n
+抱憾终身 3 n
+抱成 3 v
+抱成一团 15 i
+抱打不平 6 i
+抱抱 73 v
+抱抱熊 3 i
+抱拳 291 v
+抱持 19 v
+抱持着 3 i
+抱有 6 v
+抱有偏见 3 i
+抱有幻想 3 i
+抱有成见 3 i
+抱朴 3 a
+抱朴含真 3 i
+抱朴子 3 i
+抱枝拾叶 3 i
+抱柱 10 n
+抱柱之信 3 i
+抱柱对儿 3 n
+抱框 3 n
+抱椠怀铅 3 nz
+抱歉 270 v
+抱死 3 v
+抱残守缺 12 i
+抱残守阙 3 i
+抱法处势 3 l
+抱火卧薪 3 i
+抱火寝薪 3 i
+抱玉握珠 3 n
+抱璞泣血 3 i
+抱瓮出灌 3 l
+抱由镇 2 n
+抱疚 3 a
+抱病 38 v
+抱病上场 3 n
+抱着书 3 l
+抱着理想 3 i
+抱石 12 n
+抱窝 2 n
+抱粗腿 3 l
+抱紧 3 v
+抱缺守残 3 i
+抱腰 10 v
+抱蔓摘瓜 3 n
+抱薪救火 3 i
+抱薪救焚 3 i
+抱表寝绳 3 i
+抱诚守真 3 i
+抱负 278 v
+抱负不凡 3 l
+抱起 3 v
+抱进 3 v
+抱进去 3 v
+抱进来 3 l
+抱闸 3 v
+抴 6 zg
+抵 2455 zg
+抵上 3 v
+抵不住 3 v
+抵不过 3 v
+抵临 3 v
+抵事 3 v
+抵京 73 v
+抵住 4 v
+抵住下巴 3 n
+抵借 3 v
+抵债 41 vn
+抵偿 103 vn
+抵充 3 v
+抵免 12 v
+抵到 3 v
+抵制 833 v
+抵去 3 v
+抵向 3 v
+抵命 32 vn
+抵埠 3 n
+抵帐 3 v
+抵得 3 v
+抵得住 3 v
+抵得过 3 v
+抵御 857 v
+抵御外侮 3 n
+抵打 3 v
+抵扣 8 v
+抵抗 1866 vn
+抵抗力 223 n
+抵抗力量 3 n
+抵抗得住 3 n
+抵抗性 3 n
+抵抗素 3 n
+抵抗者 3 n
+抵抗能力 2 n
+抵抗运动 3 n
+抵押 373 vn
+抵押借款 3 n
+抵押品 25 n
+抵押房 3 n
+抵押放款 3 n
+抵押权 23 n
+抵押权人 18 n
+抵押物 23 n
+抵押金 11 n
+抵拒 7 v
+抵挡 876 v
+抵挡不住 3 n
+抵换 3 v
+抵掉 3 v
+抵掌而谈 3 n
+抵敌 3 v
+抵数 3 n
+抵来抵去 3 z
+抵死 28 v
+抵死漫生 3 n
+抵死瞒生 3 z
+抵死谩生 3 z
+抵消 195 v
+抵牾 10 v
+抵瑕蹈隙 3 n
+抵瑕陷厄 3 n
+抵留 3 v
+抵罪 15 vn
+抵背扼喉 3 v
+抵补 16 v
+抵触 2601 v
+抵触情绪 3 n
+抵账 3 v
+抵赖 115 v
+抵足 3 v
+抵足而眠 3 v
+抵达 988 v
+抵过 3 v
+抵销 122 vn
+抹 2210 v
+抹一鼻子 3 n
+抹上去 3 v
+抹上来 3 v
+抹下去 3 v
+抹下来 3 v
+抹不开 8 v
+抹不掉 3 v
+抹亮 3 v
+抹刀 3 n
+抹刀形 3 n
+抹嘴 3 v
+抹墙 3 n
+抹头 5 n
+抹子 3 n
+抹布 90 v
+抹成 3 v
+抹抹 3 v
+抹掉 56 v
+抹摋 3 v
+抹擦 3 v
+抹月批风 3 n
+抹月秕风 3 vn
+抹杀 81 v
+抹来抹去 3 v
+抹泪 3 n
+抹灰 8 n
+抹煞 52 v
+抹破 3 v
+抹稀泥 2 v
+抹粉 14 n
+抹粉施脂 3 n
+抹胸 6 n
+抹脖子 20 n
+抹脸 3 v
+抹起 3 v
+抹起来 3 v
+抹除 3 v
+抹额 18 n
+抹香鲸 24 n
+抹黑 46 v
+抹鼻子 2 n
+抺 4 zg
+抻 68 v
+押 1519 zg
+押出 3 v
+押到 3 v
+押加 3 v
+押后 3 n
+押回 3 v
+押回去 3 n
+押回来 3 n
+押头 3 v
+押宝 12 n
+押尾 4 n
+押当 3 v
+押往 3 v
+押抵 3 v
+押柜 3 n
+押款 6 n
+押汇 3 n
+押注 3 v
+押票 3 n
+押禁 3 v
+押租 85 n
+押给 3 v
+押解 135 v
+押解到 3 v
+押账 3 v
+押赴 28 v
+押起来 3 v
+押车 11 n
+押载 3 v
+押运 49 v
+押运员 3 n
+押送 104 v
+押金 92 n
+押队 3 n
+押阵 3 v
+押韵 66 n
+抽 2778 v
+抽丁 3 nz
+抽丁拔楔 3 n
+抽上 3 v
+抽上去 3 v
+抽上来 3 l
+抽不出 3 v
+抽丝 12 v
+抽丝剥茧 5 l
+抽中 3 v
+抽丰 3 nz
+抽光 3 v
+抽冷子 3 l
+抽出 893 v
+抽出去 3 v
+抽出来 3 l
+抽出空 3 vn
+抽刀 3 v
+抽刀断水 3 l
+抽功夫 3 n
+抽动 86 v
+抽动症 3 n
+抽印 3 v
+抽印本 3 l
+抽印论文 3 nz
+抽去 3 v
+抽取 173 v
+抽吸 3 v
+抽咽 44 v
+抽唱 3 v
+抽噎 104 v
+抽回 3 v
+抽壮丁 3 l
+抽头 15 v
+抽奖 44 nz
+抽奖券 3 n
+抽射 69 v
+抽尽 3 v
+抽屉 560 n
+抽屉式 3 b
+抽屉锁 3 nz
+抽工夫 3 n
+抽干 3 v
+抽彩 3 a
+抽得 3 v
+抽成 3 v
+抽成真空 3 l
+抽打 124 v
+抽抽 3 nz
+抽抽噎噎 3 i
+抽抽搭搭 8 z
+抽换 3 v
+抽换法 3 l
+抽掉 3 v
+抽提 14 v
+抽插 3 v
+抽搐 277 v
+抽搐起来 3 v
+抽搭 3 v
+抽斗 13 v
+抽时间 3 l
+抽暇 3 n
+抽机 3 n
+抽条 2 a
+抽枝 2 n
+抽查 206 v
+抽查法 3 n
+抽样 181 v
+抽样合格率 23 l
+抽样学 3 l
+抽样检查 3 n
+抽样法 3 l
+抽样误差 3 l
+抽样调查 85 l
+抽梁换柱 3 i
+抽检 41 v
+抽款 3 v
+抽气 3 n
+抽气机 2 l
+抽水 102 v
+抽水机 35 n
+抽水泵 2 n
+抽水站 19 n
+抽水马桶 22 n
+抽汽 3 n
+抽油机 3 n
+抽油杆钳 3 n
+抽油泵 3 n
+抽油烟机 7 l
+抽泣 135 v
+抽泣声 11 n
+抽泳 3 vn
+抽测 3 v
+抽湿 3 a
+抽湿机 3 l
+抽点 3 n
+抽烟 403 v
+抽烟室 3 n
+抽牌 3 v
+抽球 3 n
+抽皱 3 n
+抽砂 3 n
+抽税 12 v
+抽穗 19 v
+抽穗期 3 t
+抽空 119 v
+抽空到 3 l
+抽空去 3 v
+抽空来 3 l
+抽筋 74 v
+抽筋剥皮 3 l
+抽筋拔骨 3 l
+抽签 258 v
+抽紧 10 v
+抽纱 19 v
+抽纱业 3 n
+抽绎 3 v
+抽绎出 3 i
+抽缩 3 v
+抽考 3 v
+抽肥补瘦 3 l
+抽胎换骨 3 i
+抽芽 7 v
+抽苔 3 n
+抽薪止沸 3 i
+抽血 23 v
+抽调 274 v
+抽象 797 v
+抽象主义 3 n
+抽象代数 18 l
+抽象劳动 9 l
+抽象化 29 v
+抽象名词 3 l
+抽象地 3 n
+抽象层次 2 l
+抽象思维 21 l
+抽象性 20 n
+抽象数据类型 4 n
+抽象机 2 n
+抽象根系 3 l
+抽象概念 3 l
+抽象派 8 n
+抽象画 2 n
+抽象类 11 n
+抽资 3 vn
+抽走 3 v
+抽起 3 v
+抽起来 3 l
+抽身 188 v
+抽身而退 3 l
+抽过 3 v
+抽运 3 v
+抽进 3 v
+抽进去 3 l
+抽进来 3 l
+抽选 3 v
+抽错 3 a
+抽长 3 v
+抽问 3 v
+抽闲 3 a
+抽风 23 v
+抽风机 3 l
+抽验 3 v
+抽黄对白 3 l
+抽鼻子 3 l
+抾 3 zg
+抿 390 zg
+抿住 3 n
+抿嘴 3 n
+抿嘴笑 3 n
+抿子 3 n
+抿着 3 n
+抿着嘴 3 n
+抿着嘴笑 3 n
+拂 867 t
+拂动 3 v
+拂去 3 t
+拂子 3 n
+拂尘 475 n
+拂弦 3 v
+拂意 3 v
+拂拂 3 v
+拂拭 24 v
+拂掉 3 v
+拂晓 109 t
+拂衣 3 n
+拂衣而去 3 i
+拂袖 40 n
+拂袖而去 54 i
+拂袖而归 3 i
+拂逆 28 v
+拂逆众意 3 i
+拂面 32 n
+拂面而来 3 i
+拃 8 zg
+拄 303 v
+拄杖 16 v
+拄着 3 v
+拄稳 3 v
+拄笏看山 3 v
+拄笏西山 3 v
+担 1918 v
+担不是 3 v
+担不起 3 v
+担仔面 3 n
+担任 6409 v
+担保 796 v
+担保书 3 n
+担保人 35 n
+担保方 3 n
+担保法 2 n
+担保物 5 n
+担保责任 3 n
+担保费 3 n
+担保金 28 n
+担子 695 n
+担子菌 3 n
+担当 512 v
+担当不起 3 v
+担当起来 3 v
+担待 60 v
+担心 4839 v
+担心丽莉 3 n
+担心者 4 n
+担忧 781 v
+担惊 3 v
+担惊受怕 63 i
+担惊受恐 3 i
+担惊忍怕 3 i
+担承 3 v
+担担面 4 n
+担挑 3 v
+担搁 9 v
+担搁到 3 vn
+担架 249 v
+担架员 5 n
+担架车 5 n
+担架队 6 n
+担此重任 3 i
+担水 3 v
+担着 3 v
+担纲 168 v
+担误 3 v
+担负 1011 v
+担负起 3 i
+担负起来 3 i
+担责任 3 n
+担起 3 v
+担起来 3 v
+担雪塞井 3 i
+担雪填井 3 i
+担雪填河 3 i
+担风险 16 n
+拆 1759 v
+拆下 3 v
+拆下去 3 v
+拆下来 3 v
+拆东墙 3 n
+拆东墙补西墙 6 l
+拆东补西 3 l
+拆伙 2 v
+拆信 3 v
+拆倒 3 v
+拆借 86 v
+拆出 3 v
+拆出去 3 v
+拆出来 3 v
+拆分 39 v
+拆到 3 v
+拆包机 3 n
+拆卖 3 v
+拆卸 66 v
+拆卸法 3 n
+拆去 3 v
+拆台 19 v
+拆回 3 v
+拆回去 3 l
+拆回来 3 l
+拆墙 3 n
+拆墙脚 3 l
+拆字 16 v
+拆封 37 v
+拆帐 3 v
+拆建 3 v
+拆建比 3 j
+拆开 429 v
+拆开来 3 l
+拆息 7 v
+拆成 3 v
+拆房 3 v
+拆掉 81 v
+拆散 128 v
+拆散开来 3 l
+拆断 3 v
+拆机 3 n
+拆桥 3 v
+拆毁 135 v
+拆法 3 v
+拆洗 35 v
+拆洗法 3 n
+拆烂污 3 v
+拆牌道字 3 l
+拆白党 2 n
+拆白道字 3 l
+拆码 3 n
+拆穿 50 v
+拆穿骗局 3 n
+拆线 13 n
+拆船 4 v
+拆船业 3 n
+拆装 3 v
+拆装机 3 l
+拆西补东 3 l
+拆解 204 v
+拆诸 3 v
+拆迁 242 v
+拆迁人 3 n
+拆迁办 3 n
+拆迁户 27 n
+拆迁房 3 n
+拆过 3 v
+拆阅 11 v
+拆除 1505 v
+拆除费 3 n
+拆除费用 3 l
+拆零 5 v
+拇 290 n
+拇印 3 n
+拇战 3 n
+拇指 439 n
+拇指一族 3 n
+拇指族 3 n
+拇指腕掌 3 n
+拇趾 6 n
+拈 531 v
+拈华摘艳 3 i
+拈度 3 v
+拈弄 3 v
+拈斤拨两 3 i
+拈斤播两 3 i
+拈断 3 v
+拈断髭须 3 v
+拈毫弄管 3 i
+拈线 3 v
+拈花 3 v
+拈花一笑 3 i
+拈花弄月 3 i
+拈花弄柳 3 i
+拈花微笑 4 i
+拈花惹草 29 i
+拈花摘艳 3 i
+拈轻怕重 3 i
+拈轻掇重 3 z
+拈酒 3 v
+拈酸吃醋 2 i
+拈酸泼醋 3 i
+拈量 3 v
+拈阄 581 v
+拈阄儿 3 v
+拈须 3 v
+拈香 38 v
+拉 12817 v
+拉丁 193 nrt
+拉丁人 3 nrt
+拉丁化 3 nz
+拉丁区 4 ns
+拉丁名 3 nr
+拉丁字母 162 nr
+拉丁文 213 nz
+拉丁民族 3 nz
+拉丁美州 3 ns
+拉丁美洲 436 ns
+拉丁舞 9 nr
+拉丁语 163 nz
+拉丁语系 3 nz
+拉万蒂 2 nr
+拉三扯四 3 l
+拉上去 3 v
+拉上来 3 v
+拉下 3 v
+拉下去 3 v
+拉下水 8 nr
+拉下脸 28 l
+拉下脸来 3 l
+拉下马 37 ns
+拉不下 3 l
+拉不下脸 3 l
+拉不动 3 l
+拉丘兹 10 nr
+拉东坡 2 ns
+拉丝 13 nrt
+拉丝性 4 nr
+拉丝料 3 n
+拉丝机 3 nr
+拉丝模 3 nr
+拉丹 20 ns
+拉丹冬 4 nr
+拉丽鹃 2 nr
+拉乌 11 nrt
+拉乌尔 13 nrt
+拉乔夫 2 nr
+拉买卖 3 l
+拉了一把 3 l
+拉亏空 3 l
+拉亚 4 ns
+拉亚提 4 nr
+拉交情 5 n
+拉亨达 3 nr
+拉亮 3 nr
+拉亲戚 3 nr
+拉人 3 nrt
+拉什 19 nrt
+拉什利 3 nrt
+拉什科 5 nrt
+拉什迪 2 nrt
+拉仁波 2 nr
+拉伊 12 nrt
+拉伤 32 v
+拉伯 3 ns
+拉伯蒂特 3 nrt
+拉伯语 2 nz
+拉伯雷 9 nr
+拉伸 50 v
+拉伸应变 3 l
+拉伸粘度 3 n
+拉伸膜 3 n
+拉住 3 v
+拉佐夫 4 nr
+拉佩纳 2 nr
+拉倒 96 v
+拉偏手儿 3 l
+拉偏测试 3 n
+拉克 62 nrt
+拉克丝 3 nr
+拉克仑 2 nr
+拉克利 16 nr
+拉克尔 3 nr
+拉克希 4 nr
+拉克拉 17 nrt
+拉克斯 45 nr
+拉克沙 3 nr
+拉克河 3 nr
+拉克洛 14 nr
+拉克特 3 nrt
+拉克略 19 nr
+拉克齐 2 nr
+拉入 3 v
+拉关系 11 l
+拉兹丹 2 nr
+拉凤姐 2 nr
+拉出 3 v
+拉出去 3 v
+拉切尔 10 nrt
+拉利萨 16 nr
+拉到 3 v
+拉制 8 v
+拉力 82 nz
+拉力器 3 nr
+拉力机 3 nr
+拉力赛 37 nr
+拉加 55 v
+拉动 359 v
+拉动力 7 n
+拉动型 2 n
+拉动性 3 n
+拉勾 3 nr
+拉包尔 4 nr
+拉升 3 v
+拉卜楞寺 11 ns
+拉卡 7 nrt
+拉卡列 7 nr
+拉去 3 v
+拉古 282 ns
+拉各斯 48 nrt
+拉合尔 70 nr
+拉合尔市 6 ns
+拉吉 8 nrt
+拉吉夫 8 nr
+拉吊 7 v
+拉后腿 3 l
+拉呱 12 v
+拉哈 20 nrt
+拉喜特 4 nr
+拉回 3 v
+拉回去 3 l
+拉回来 3 l
+拉图 11 nrt
+拉图尔 6 nr
+拉场子 3 n
+拉圾 3 n
+拉圾箱 3 n
+拉坏 3 v
+拉基 4 nrt
+拉基亚 64 ns
+拉基尔 2 nr
+拉基斯 16 nr
+拉堡 4 nrt
+拉塔 14 nrt
+拉塔基亚 11 ns
+拉塞 2 nrt
+拉塞尔 37 nr
+拉塞龙 2 nr
+拉多 16 nrt
+拉多加湖 18 ns
+拉多姆 2 nrt
+拉多纳 3 nrt
+拉大 108 j
+拉大公 2 nr
+拉大旗 2 nr
+拉大旗作虎皮 8 l
+拉夫 74 nrt
+拉夫峰 2 nr
+拉夫拉 2 nrt
+拉夫斯 3 nrt
+拉夫桑贾尼 9 nr
+拉夫特 3 nrt
+拉夫琴 2 nr
+拉夫罗夫 6 nrt
+拉夫黑 10 nrt
+拉奇 2 nrt
+拉奇奥 3 nrt
+拉奏乐器 3 n
+拉套 3 nz
+拉奥 18 nrt
+拉奥孔 5 nr
+拉奥斯 2 nrt
+拉姆 193 nrt
+拉姆伯爵 4 nr
+拉姆吉 4 nr
+拉姆塔 3 nr
+拉姆斯 22 nr
+拉姆斯菲尔德 18 nrt
+拉姆森 2 nr
+拉姆沙 2 nr
+拉姆语 3 nz
+拉姆赛 21 nr
+拉姆齐 40 nr
+拉威尔 4 nr
+拉子模 55 nr
+拉子米 8 nr
+拉孜 6 nrt
+拉孜县 3 ns
+拉安 2 nrt
+拉完 3 v
+拉宝琴 2 nr
+拉客 27 nr
+拉客仔 3 nr
+拉客户 3 n
+拉家带口 3 n
+拉家常 18 nr
+拉宾 20 ns
+拉封丹 12 ns
+拉小龙 3 nr
+拉尔 16 nrt
+拉尔卡 2 nrt
+拉尔多 5 nrt
+拉尔夫 14 nrt
+拉尔尼 3 nrt
+拉尔山 2 nr
+拉尔德 8 nrt
+拉尔斯 2 nrt
+拉尔松 2 nr
+拉尔森 59 nr
+拉尔沙 4 nr
+拉尔萨 4 nrt
+拉尼 104 nrt
+拉尼亚 11 ns
+拉尼斯 5 nrt
+拉尼西亚 6 ns
+拉尼语 10 nz
+拉尼那 3 ns
+拉尿 3 v
+拉屎 106 v
+拉山头 3 ns
+拉巴 22 nrt
+拉巴尼 5 nrt
+拉巴斯 23 nrt
+拉巴次仁 5 nz
+拉巴特 46 nrt
+拉巴赫 2 nrt
+拉市海 3 ns
+拉布 10 v
+拉布拉他 3 ns
+拉布拉多 37 nrt
+拉希 2 nrt
+拉希姆 38 nr
+拉希德 77 nr
+拉希德港 3 ns
+拉帐 3 n
+拉帕 2 nrt
+拉帕尔马 2 nrt
+拉帮结伙 8 l
+拉帮结派 44 n
+拉幅 4 n
+拉平 36 nr
+拉平溶剂 3 nz
+拉广告 3 nr
+拉床 19 nz
+拉库尔 2 nrt
+拉底 20 nrt
+拉延 3 nr
+拉开 1281 v
+拉开帷幕 3 nr
+拉开序幕 3 nr
+拉开战幕 3 nr
+拉开档次 3 l
+拉开距离 3 l
+拉弓 26 nz
+拉弗 2 nrt
+拉弗兰 4 nr
+拉弗尔 2 nr
+拉弗拉 2 nrt
+拉弗朗 2 nr
+拉弥斯 2 nr
+拉彼鲁兹 16 ns
+拉往 3 v
+拉徒儿 2 nr
+拉得雷 2 nr
+拉德 19 nrt
+拉德利 2 nr
+拉德勃 3 nr
+拉德斯 3 nr
+拉德曼 2 nr
+拉德波 2 nr
+拉德福 5 nr
+拉德纳 8 nr
+拉德雷 6 nr
+拉忒亚 2 nr
+拉惯 3 n
+拉戈 5 nrt
+拉戈斯 2 nrt
+拉成 3 v
+拉手 50 v
+拉扎 9 nrt
+拉扎列夫 6 nrt
+拉扎尔 4 nr
+拉扎诺 4 nr
+拉托 8 nrt
+拉托夫 7 nrt
+拉托尔 2 nrt
+拉托斯 2 nrt
+拉托维亚 3 nrt
+拉扯 308 v
+拉拉 155 nrt
+拉拉山 3 ns
+拉拉扯扯 45 l
+拉拉杂杂 2 l
+拉拉队 10 nz
+拉拉队员 3 n
+拉拉队长 3 n
+拉拔 4 v
+拉拖 3 j
+拉拢 226 v
+拉拢起来 3 l
+拉捭摧藏 3 i
+拉据战 3 n
+拉掉 3 v
+拉提夫 9 nr
+拉提琴 3 nr
+拉摩 10 nrt
+拉撒 39 nrt
+拉文斯布吕克 2 nrt
+拉文纳 14 nr
+拉斐克 2 nr
+拉斐尔 60 nr
+拉斐特 11 nr
+拉断 37 v
+拉斯 77 nrt
+拉斯卡 3 nrt
+拉斯卡拉 6 nrt
+拉斯哈里布 3 nrt
+拉斯坎 9 nr
+拉斯城 2 ns
+拉斯基 15 nrt
+拉斯堡 3 nrt
+拉斯姆森 2 nrt
+拉斯山 14 ns
+拉斯峰 2 nr
+拉斯曼 19 nrt
+拉斯河 7 ns
+拉斯洛 2 nr
+拉斯港 3 ns
+拉斯特 3 nrt
+拉斯科 11 nrt
+拉斯维加 3 nrt
+拉斯维加斯 46 nrt
+拉斯谟 6 nr
+拉斯贵 4 nr
+拉斯金 3 nr
+拉斯韦加斯 11 nrt
+拉斯韦尔 4 nrt
+拉斯顿 3 nrt
+拉施 2 v
+拉日峰 2 nr
+拉昂 5 nrt
+拉普 21 nrt
+拉普人 11 nrt
+拉普兰 5 nr
+拉普拉塔 57 nrt
+拉普拉塔河 50 nrt
+拉普拉斯 118 nrt
+拉普捷夫 84 nrt
+拉普语 2 nz
+拉普钦 3 nr
+拉曳 3 v
+拉曼 61 nrt
+拉曼军 2 nr
+拉曼特 5 nrt
+拉有 3 v
+拉朋齐 5 nr
+拉朗德 16 nrt
+拉木伦 8 nr
+拉木兹 2 nr
+拉木罕 4 nr
+拉朽摧枯 3 i
+拉杂 5 v
+拉杆 39 n
+拉杆箱 3 n
+拉来 3 v
+拉来拉去 3 l
+拉杰布 2 nr
+拉林河 6 nr
+拉枚希 2 nr
+拉枯折朽 3 i
+拉架 5 nz
+拉栖第 512 nr
+拉根 7 nz
+拉根尼 336 nr
+拉格 38 nrt
+拉格尔 3 nr
+拉格斯 3 nr
+拉格朗 86 nr
+拉格湾 4 ns
+拉格诺 3 nr
+拉梅尔 7 nr
+拉梅托 16 nr
+拉模 3 nr
+拉比 41 j
+拉比亚 19 ns
+拉汉姆 8 nr
+拉沃 3 nz
+拉沟 6 ns
+拉油点 2 n
+拉法叶 2 nr
+拉法基 3 nr
+拉法尔 9 nr
+拉法格 12 nr
+拉法耶特 18 nrt
+拉波塔 2 nrt
+拉波娃 2 nr
+拉泽斯 3 nr
+拉洋片 3 nz
+拉浪 2 nz
+拉涅 2 nrt
+拉湾 2 ns
+拉煤车 2 nz
+拉片 3 nz
+拉特 37 nrt
+拉特兰 14 nr
+拉特河 2 ns
+拉特纳 3 nr
+拉特语 2 nz
+拉犁 3 ns
+拉狄云 2 nr
+拉狄克 3 nr
+拉王贵 3 nr
+拉玛 3 nrt
+拉玛一世 5 nrt
+拉玛古猿 3 nr
+拉玛坚 2 nr
+拉玛尔 2 nr
+拉玛山 26 nr
+拉环 9 nr
+拉珈语 2 nr
+拉班 18 nrt
+拉琴 9 nr
+拉瑟 2 nrt
+拉瑟尼 2 nrt
+拉瑟福德 2 nrt
+拉瓦 37 nrt
+拉瓦尔 21 nrt
+拉瓦尔品第 20 nz
+拉瓦河 2 nr
+拉瓦蒂 2 nrt
+拉瓦锡 63 nr
+拉生意 3 nr
+拉痢 3 n
+拉登 58 nrt
+拉皮 10 nrt
+拉皮手术 3 l
+拉皮条 12 nrt
+拉盖丽 3 nr
+拉直 18 nr
+拉磨 3 v
+拉祜 27 nrt
+拉祜族 48 nz
+拉祜纳 2 nr
+拉祜语 3 nz
+拉票 3 n
+拉票会 3 n
+拉科 6 nrt
+拉科娃 2 nr
+拉科尼亚 5 nrt
+拉科律 16 nr
+拉科西 7 nrt
+拉秧 3 v
+拉稀 16 nr
+拉穆湖 3 nr
+拉竟尔 2 nr
+拉管 3 v
+拉簧 3 n
+拉米 25 nrt
+拉米亚 3 nrt
+拉米夫定 13 nz
+拉米尔 2 nrt
+拉米罗 3 nrt
+拉米雷斯 39 nrt
+拉索 37 nrt
+拉索夫 2 nr
+拉紧 5 v
+拉紧器 3 nz
+拉縴 3 z
+拉纤 23 nz
+拉纳 3 nrt
+拉纳克 5 nr
+拉纳卡 6 nr
+拉纳河 2 ns
+拉纳特 2 nrt
+拉纳达 8 nr
+拉线 25 nz
+拉线开关 3 l
+拉练 30 v
+拉绳 3 nz
+拉维亚 5 ns
+拉维叶 2 nr
+拉维尔 3 nrt
+拉维德 6 nrt
+拉维拉 2 nrt
+拉维斯 10 nrt
+拉维河 7 ns
+拉维涅 10 nrt
+拉维赤 3 nr
+拉网 19 nz
+拉网式 13 n
+拉罕 4 nrt
+拉罗 11 nrt
+拉美 519 nz
+拉美一体化协会 2 nz
+拉美国家 3 l
+拉美地区 22 ns
+拉美特利 3 ns
+拉耶夫 7 nrt
+拉肚子 47 n
+拉肯斯 2 nrt
+拉脊山 7 nr
+拉脱维亚 156 ns
+拉脱维亚语 7 nz
+拉腊 3 ns
+拉腊峰 2 nr
+拉腿 3 nz
+拉舍夫 2 nr
+拉芒坦 2 nr
+拉芒语 3 nz
+拉芙 11 nrt
+拉苏荣 5 nr
+拉若斯 3 nr
+拉茨 7 nrt
+拉莫 10 nrt
+拉莫夫 2 nrt
+拉莫尔 2 nrt
+拉莫斯 93 nrt
+拉莱斯 4 nr
+拉菲 8 nrt
+拉菲亚 3 nrt
+拉菲克 2 nrt
+拉菲尔 3 nrt
+拉菲特 5 nrt
+拉萨 568 nrt
+拉萨啤酒 2 nt
+拉萨尔 23 nr
+拉萨市 62 ns
+拉萨河 24 ns
+拉萨河畔 3 ns
+拉萨特 2 nrt
+拉萨贡嘎机场 2 ns
+拉蒂尼 3 nr
+拉蒂洛 5 nr
+拉蒂诺 3 nr
+拉蒂默 3 nr
+拉蒙 36 nrt
+拉蒙德 2 nr
+拉蒙特 4 nrt
+拉裂 3 v
+拉西 8 ns
+拉西乡 3 ns
+拉西亚 8 ns
+拉西奇 2 nr
+拉西斯 4 nrt
+拉西浦 16 ns
+拉西莫夫 9 nrt
+拉诺 71 nrt
+拉诺卡 2 nr
+拉诺尔 2 nr
+拉诺维 2 nr
+拉贝尔 3 nrt
+拉贝河 4 nr
+拉账 3 v
+拉贾斯坦 28 ns
+拉贾斯坦邦 9 ns
+拉赞助 3 nr
+拉赫 25 nrt
+拉赫峰 3 nr
+拉赫曼 15 nr
+拉赫玛 5 nr
+拉赫莫诺夫 9 nrt
+拉赫蒂 3 nr
+拉走 110 v
+拉起 3 v
+拉起萧 2 nr
+拉跑 3 v
+拉车 91 n
+拉辛 31 nrt
+拉达 73 nrt
+拉达克 10 nrt
+拉达泽 2 nr
+拉过康 2 nr
+拉过来 3 l
+拉运 6 v
+拉近 125 v
+拉近乎 3 nr
+拉进 3 v
+拉进去 3 v
+拉进来 3 nr
+拉迪奇 2 nr
+拉迪斯 2 nrt
+拉迪诺 14 nr
+拉选票 3 n
+拉道求积 3 n
+拉那烈 27 nr
+拉郎配 8 nr
+拉采尔 8 nr
+拉里 58 nrt
+拉里亚 5 nrt
+拉里萨 32 nrt
+拉金德拉 5 nrt
+拉钩 5 v
+拉链 67 n
+拉链头 3 nr
+拉链袋 3 nz
+拉锁 7 v
+拉锯 24 v
+拉锯战 32 n
+拉长 127 v
+拉门 28 ns
+拉门托 3 nrt
+拉闲散闷 3 v
+拉闸 4 ns
+拉雅兰 7 nr
+拉雅山 2 nr
+拉雅托 2 nrt
+拉雪兹 8 nr
+拉雪兹神父公墓 11 i
+拉雪巴 25 nr
+拉雷 2 nrt
+拉青青 2 nr
+拉面 29 n
+拉面杯 3 nz
+拉面馆 3 n
+拉马 21 ns
+拉马丹 7 nr
+拉马克 32 nrt
+拉马尔 4 nrt
+拉马拉 3 nrt
+拉马斯 2 nrt
+拉马迪 3 nr
+拉高 25 nrt
+拉鲁斯 14 nr
+拉黄蓉 5 nr
+拉默德 3 nrt
+拉齐 144 nrt
+拉齐卡 2 nr
+拉齐奥 52 nr
+拉齐拉卡 2 nrt
+拉齐斗 2 nr
+拉齐斯 2 nr
+拊 61 g
+拊心泣血 3 n
+拊背扼吭 3 l
+拊背扼喉 3 l
+拊背搤吭 3 v
+拊膺顿足 3 nt
+拋 124 zg
+拌 1194 v
+拌勺 3 v
+拌匀 24 v
+拌合 4 v
+拌和 13 v
+拌和站 3 vn
+拌嘴 66 v
+拌水 3 v
+拌浆机 3 vn
+拌点 3 v
+拌种 7 v
+拌种机 3 v
+拌肥 3 v
+拌蒜 3 v
+拌面 3 v
+拍 6035 v
+拍上 3 v
+拍上去 3 v
+拍上来 3 v
+拍下 3 v
+拍下去 3 v
+拍下来 3 v
+拍了拍 3 v
+拍出 3 v
+拍出去 3 v
+拍出来 3 v
+拍击 87 v
+拍到 3 v
+拍动 3 v
+拍卖 1067 v
+拍卖业 5 n
+拍卖人 9 n
+拍卖价 5 n
+拍卖会 81 n
+拍卖公告 3 n
+拍卖品 5 n
+拍卖商 3 n
+拍卖场 5 n
+拍卖师 9 n
+拍卖成交 3 i
+拍卖拟 3 i
+拍卖无效 3 i
+拍卖时 3 i
+拍卖法 6 n
+拍卖网 3 n
+拍卖行 72 v
+拍卖行非 3 i
+拍去 3 v
+拍发 9 v
+拍合 3 v
+拍品 57 n
+拍回 3 v
+拍外景 3 n
+拍好 3 v
+拍子 60 n
+拍岸 14 v
+拍巴掌 26 i
+拍平 3 v
+拍录 3 v
+拍得 3 v
+拍得丽 3 i
+拍戏 12 v
+拍成 3 v
+拍成电影 3 n
+拍手 451 v
+拍手叫好 39 l
+拍手叫绝 3 i
+拍手歌 3 i
+拍手称快 34 i
+拍打 251 v
+拍打在 3 i
+拍打着 3 l
+拍拍 638 v
+拍拍手 23 i
+拍拍烧 3 v
+拍拍网 3 n
+拍拖 6 v
+拍掉 3 v
+拍掌 50 v
+拍摄 1316 v
+拍摄地 11 i
+拍摄场 3 n
+拍摄者 2 n
+拍摄角度 3 n
+拍散 3 v
+拍景 3 n
+拍景队 3 n
+拍来拍去 3 i
+拍板 107 n
+拍板成交 3 i
+拍柄 10 n
+拍案 65 v
+拍案叫绝 20 i
+拍案惊奇 13 i
+拍案称奇 3 i
+拍案而起 68 i
+拍桌子 105 n
+拍桌打凳 3 n
+拍档 3 v
+拍法 3 v
+拍点 3 n
+拍照 246 v
+拍照存证 3 n
+拍照片 3 n
+拍片 63 n
+拍片人 3 n
+拍片子 3 n
+拍球 3 n
+拍电影 3 n
+拍电报 3 v
+拍砖 3 n
+拍纸簿 3 n
+拍老腔儿 3 l
+拍肩膀 3 n
+拍胸脯 3 n
+拍脱 3 v
+拍节机 3 n
+拍花 3 n
+拍苍蝇 3 i
+拍起 3 v
+拍门 3 v
+拍频 3 v
+拍马 220 v
+拍马奉承 3 i
+拍马屁 252 v
+拍马溜须 3 i
+拎 553 v
+拎下来 3 n
+拎不清 3 n
+拎包 20 n
+拎环 3 n
+拏 11 zg
+拏云握雾 3 nr
+拏云攫石 3 vn
+拏风跃云 3 nz
+拐 1558 zg
+拐上 3 s
+拐上去 3 i
+拐上来 3 v
+拐下 3 n
+拐下去 3 v
+拐下来 3 v
+拐住 3 v
+拐入 3 n
+拐出 3 v
+拐出去 3 i
+拐出来 3 i
+拐卖 34 v
+拐卖人口 3 n
+拐卖儿童 3 n
+拐卖妇女 3 n
+拐回 3 v
+拐回去 3 i
+拐回来 3 i
+拐子 158 n
+拐孩子 3 n
+拐带 23 n
+拐弯 171 n
+拐弯儿 3 n
+拐弯处 3 i
+拐弯抹角 41 i
+拐拐 3 n
+拐杖 394 n
+拐来 3 v
+拐来拐去 3 n
+拐枣 3 n
+拐棍 33 n
+拐棍儿 9 n
+拐棒 7 n
+拐点 62 n
+拐肘 3 n
+拐脖 3 n
+拐脖儿 3 n
+拐脚 3 n
+拐角 48 n
+拐角儿 3 n
+拐角处 33 n
+拐诱 3 v
+拐走 10 v
+拐起 3 s
+拐起来 3 v
+拐跑 3 v
+拐过 3 v
+拐过去 3 i
+拐过来 3 i
+拐进 3 v
+拐进去 3 v
+拐进来 3 v
+拐骗 40 v
+拐骗犯 3 n
+拐骗罪 3 n
+拑 5 zg
+拒 1244 v
+拒不 3 l
+拒不回答 3 l
+拒不履行 3 l
+拒不悔改 3 l
+拒不执行 3 i
+拒不承认 3 l
+拒不接受 3 l
+拒不认付 3 v
+拒之千里 3 i
+拒之门外 67 l
+拒买 3 v
+拒交 5 v
+拒人于千 3 i
+拒人于千里之外 27 i
+拒人千里 137 l
+拒付 13 v
+拒友 3 v
+拒受 3 v
+拒吃 3 v
+拒唱 3 v
+拒在 3 v
+拒客 3 v
+拒开 3 v
+拒弹 3 v
+拒打 3 v
+拒抗 3 v
+拒拿 3 v
+拒拿回扣 3 l
+拒按 3 i
+拒挡 3 v
+拒捕 23 v
+拒接 3 v
+拒接来电 3 l
+拒收 41 v
+拒敌 3 v
+拒斥 8 v
+拒水 6 v
+拒狼进虎 3 l
+拒用 3 v
+拒留 3 v
+拒看 3 v
+拒礼 3 v
+拒答 3 v
+拒签 32 v
+拒绝 3577 v
+拒绝域 3 l
+拒绝往来 3 l
+拒绝执行 3 i
+拒绝接受 11 l
+拒绝服务 2 l
+拒绝给予 3 i
+拒绝者 3 l
+拒绝请求 3 i
+拒绝门限 3 l
+拒缴 3 v
+拒聘 3 v
+拒腐防变 75 l
+拒虎进狼 3 ns
+拒虫剂 3 nz
+拒谈 3 v
+拒谏 3 v
+拒谏饰非 3 i
+拒贿 4 v
+拒赌 3 v
+拒赔 3 v
+拒载 5 v
+拒钓 2 v
+拒食 10 v
+拒马 3 v
+拒马河 23 ns
+拓 261 nr
+拓务省 3 n
+拓印 7 nr
+拓土开疆 3 nr
+拓地 3 n
+拓垦 3 v
+拓垦荒地 3 n
+拓宽 313 nr
+拓宽渠道 3 nr
+拓宽道路 3 nr
+拓展 864 v
+拓展会 3 nr
+拓广 3 nr
+拓开 3 v
+拓扑 146 v
+拓扑图 3 nr
+拓扑学 88 n
+拓扑检索 3 nr
+拓扑矩阵 3 nr
+拓本 34 n
+拓朴 3 nr
+拓朴学 3 nr
+拓殖 126 v
+拓片 69 n
+拓荒 34 v
+拓荒者 14 nr
+拓落 3 v
+拓蓝纸 3 n
+拓补 3 v
+拓跋 401 nr
+拓跋氏 3 nz
+拓跋焘 3 nr
+拓跋贵 3 nrfg
+拓边 3 nr
+拔 2607 v
+拔下 3 v
+拔下去 3 v
+拔下来 3 v
+拔不出 3 v
+拔不到 3 v
+拔丛出类 3 i
+拔丝 5 v
+拔乎其萃 7 i
+拔光驱 3 i
+拔出 796 v
+拔出去 3 i
+拔出来 3 v
+拔刀 3 v
+拔刀斋 3 v
+拔刀相助 33 i
+拔刀相向 3 i
+拔剑 337 v
+拔剑相助 3 i
+拔剑论功 3 i
+拔十失五 3 i
+拔十得五 3 i
+拔去 3 v
+拔取 3 v
+拔回 3 v
+拔回去 3 i
+拔回来 3 i
+拔地倚天 3 i
+拔地参天 3 i
+拔地摇山 3 i
+拔地而起 66 i
+拔城 3 v
+拔宅上升 3 i
+拔宅飞升 3 i
+拔尖 63 v
+拔尖儿 6 n
+拔山 3 v
+拔山扛鼎 3 v
+拔山盖世 3 i
+拔山超海 3 i
+拔帜易帜 3 i
+拔帜树帜 3 i
+拔开 3 v
+拔掉 105 v
+拔擢 61 v
+拔新领异 3 i
+拔本塞原 3 i
+拔本塞源 3 i
+拔来报往 3 i
+拔枪 3 v
+拔染 3 v
+拔树寻根 3 i
+拔树搜根 3 vn
+拔树撼山 3 i
+拔根 3 v
+拔毒 11 v
+拔毛 3 v
+拔毛济世 3 i
+拔毛连茹 3 n
+拔河 50 v
+拔河比赛 3 n
+拔河赛 3 n
+拔海 2 v
+拔火罐 3 n
+拔火罐儿 3 n
+拔牙 301 v
+拔牙学 3 i
+拔牙钳 3 n
+拔犀擢象 3 v
+拔用 3 v
+拔磉 3 vn
+拔秧 2 v
+拔秧机 3 v
+拔管 2 v
+拔类超群 3 i
+拔线 3 v
+拔罐子 3 n
+拔群 3 v
+拔群出萃 3 i
+拔脚 44 v
+拔腿 65 v
+拔腿就跑 3 n
+拔节 19 v
+拔节期 3 n
+拔苗助长 13 i
+拔草 17 v
+拔萃 8 v
+拔萃出类 3 vn
+拔萃出群 3 vn
+拔萝卜 3 n
+拔营 29 v
+拔葵去织 3 nr
+拔葵啖枣 3 ns
+拔赵易汉 3 t
+拔起 3 v
+拔起来 3 v
+拔身 3 v
+拔辖投井 3 n
+拔进 3 v
+拔进去 3 v
+拔进来 3 v
+拔锅卷席 3 i
+拔锚 11 v
+拔除 62 v
+拔髓针 3 n
+拔高 69 v
+拖 3454 v
+拖上去 3 v
+拖上来 3 v
+拖下 3 v
+拖下去 3 v
+拖下来 3 v
+拖下水 3 n
+拖乾净 3 i
+拖人下水 3 n
+拖人落水 3 i
+拖住 119 v
+拖倒 3 v
+拖儿带女 8 n
+拖入 63 v
+拖具 3 n
+拖出 3 v
+拖出去 3 v
+拖出来 3 v
+拖到 3 v
+拖动 32 v
+拖去 3 v
+拖吊 3 v
+拖吊车 3 n
+拖后腿 4 n
+拖回 3 v
+拖回去 3 i
+拖回来 3 l
+拖地 35 n
+拖地板 3 n
+拖垮 36 v
+拖堂 3 n
+拖天扫地 3 i
+拖家带口 9 n
+拖家带眷 3 n
+拖尾因子 3 n
+拖尾峰 3 n
+拖布 3 v
+拖带 32 n
+拖床 3 v
+拖延 419 v
+拖延战术 3 n
+拖延时间 3 i
+拖延者 3 n
+拖开 3 v
+拖式 26 n
+拖引 3 v
+拖得 3 v
+拖把 17 nz
+拖拉 65 nz
+拖拉机 438 n
+拖拉机厂 8 n
+拖拉机手 12 n
+拖拉机站 3 nz
+拖拖 3 v
+拖拖拉拉 27 z
+拖拽 3 l
+拖挂 4 v
+拖捞 3 v
+拖捞网 3 n
+拖捞船 3 n
+拖掉 3 v
+拖放 3 v
+拖斗 5 v
+拖时间 3 n
+拖曳 70 v
+拖曳阵 8 n
+拖来 3 v
+拖来拖去 3 l
+拖板 3 n
+拖架 3 n
+拖橇狗 3 v
+拖欠 253 v
+拖欠工资 3 i
+拖欠款项 3 v
+拖死 3 v
+拖沓 33 a
+拖油瓶 3 n
+拖泥 3 n
+拖泥带水 83 n
+拖洗 3 v
+拖洗把 3 n
+拖湿 3 v
+拖男带女 3 n
+拖累 120 v
+拖缆 3 n
+拖网 26 nz
+拖网渔船 3 n
+拖网船 3 n
+拖腔 14 n
+拖腿 3 n
+拖至岸边 3 i
+拖船 39 n
+拖裙 3 n
+拖走 3 v
+拖起 3 v
+拖起来 3 v
+拖车 85 n
+拖车绳 3 n
+拖轮 18 n
+拖运 5 v
+拖进 3 v
+拖进去 3 v
+拖进来 3 v
+拖金委紫 3 n
+拖锚 4 v
+拖长 43 v
+拖雷 3 n
+拖青纡紫 3 ns
+拖靶 5 v
+拖鞋 121 n
+拖鞋柜 3 n
+拖驳 9 v
+拖麻拽布 3 vn
+拗 265 a
+拗不过 52 v
+拗体 3 n
+拗别 3 n
+拗劲 3 a
+拗口 42 n
+拗口令 3 n
+拗强 3 v
+拗性 3 n
+拗扭 3 a
+拗折 3 n
+拗断 3 v
+拗曲作直 3 n
+拗烂 3 a
+拗陷 76 n
+拘 295 zg
+拘于 21 v
+拘人 3 n
+拘传 14 v
+拘俗守常 3 n
+拘出 3 v
+拘囿 3 n
+拘奇抉异 3 z
+拘守绳墨 3 n
+拘审 3 v
+拘役 60 v
+拘执 14 v
+拘押 34 v
+拘拘缩缩 3 v
+拘拿 3 v
+拘挛 5 vn
+拘挛补衲 3 n
+拘捕 100 v
+拘捕权 3 n
+拘提 3 v
+拘文牵义 3 vn
+拘束 155 v
+拘束力 28 n
+拘板 3 n
+拘泥 121 n
+拘泥于 3 n
+拘泥形式 3 n
+拘牵 3 v
+拘留 248 v
+拘留所 31 n
+拘留证 3 n
+拘礼 30 v
+拘神遣将 3 n
+拘票 9 n
+拘禁 94 v
+拘禁罪 3 n
+拘管 15 v
+拘系 3 v
+拘谨 161 a
+拘限 3 a
+拙 244 ag
+拙于 3 n
+拙于言词 3 n
+拙作 8 ns
+拙劣 84 a
+拙劣手段 3 v
+拙劣表演 3 nz
+拙口钝腮 3 n
+拙口钝辞 3 vn
+拙嘴笨腮 3 n
+拙嘴笨舌 3 v
+拙夫 3 ns
+拙妻 3 n
+拙工 3 n
+拙政园 19 n
+拙朴 6 a
+拙涩 3 a
+拙目 3 n
+拙着 3 a
+拙稿 3 n
+拙笔 3 n
+拙笨 2 a
+拙荆 31 n
+拙著 9 a
+拙行 3 a
+拙见 4 a
+拙计 2 n
+拙讷 3 a
+拙贝罗香 3 ns
+拚 959 zg
+拚命 589 v
+拚搏 17 v
+拚斗 3 v
+拚杀 5 v
+拚死 3 v
+招 5248 v
+招一阳 2 nr
+招之不来 3 l
+招之即来 7 i
+招习练 2 n
+招事 3 v
+招事惹非 3 i
+招亡纳叛 3 i
+招亲 60 n
+招人 3 nt
+招人物议 3 n
+招仙图 4 nr
+招以东 2 nr
+招供 42 v
+招供出来 3 l
+招俊杰 2 nr
+招信军 3 nt
+招做 3 v
+招僧榜 2 nr
+招儿 22 n
+招兵 47 n
+招兵买马 47 i
+招军 2 nt
+招军买马 8 nt
+招出 3 v
+招出来 3 v
+招到 3 v
+招剑法 9 nr
+招办 469 v
+招劲力 3 nr
+招募 352 v
+招募新兵 3 n
+招化劲 2 l
+招华商 2 nt
+招华山 2 nr
+招呼 1653 v
+招呼客人 3 l
+招呼站 3 n
+招咎 3 v
+招唤 3 v
+招商 595 n
+招商会 6 nt
+招商团 3 nt
+招商局 113 nt
+招商市场 3 nt
+招商引店 3 n
+招商引资 73 n
+招商网 3 nt
+招商银行 85 nt
+招商银行深圳宝安支行 3 ns
+招商馆 3 nt
+招回 3 v
+招回去 3 l
+招回来 3 l
+招奇速 11 nr
+招女婿 4 n
+招妓 3 n
+招委 6 j
+招委会 2 nt
+招婿 3 n
+招嫉 3 v
+招子 45 n
+招安 228 nr
+招宝七 2 nr
+招宝山 2 nr
+招宣府 3 nt
+招展 105 vn
+招工 127 vn
+招工桌 3 n
+招工难 3 l
+招干 3 v
+招式 277 n
+招式中 3 nr
+招式之 6 nr
+招式劲 2 nr
+招式又 2 nr
+招式挺 2 nr
+招式来 2 l
+招式甚 2 nr
+招式精 3 nr
+招式颇 2 nr
+招引 51 v
+招弟 50 n
+招录 43 v
+招待 454 v
+招待不周 3 i
+招待会 918 n
+招待券 3 n
+招待员 4 n
+招待室 3 n
+招待所 364 n
+招待费 50 n
+招待饭 3 l
+招徕 94 v
+招怨 3 v
+招惹 172 v
+招惹不起 3 i
+招惹是非 3 i
+招手 406 v
+招投标 34 j
+招抚 171 v
+招招 5 j
+招招制 2 v
+招招势 2 n
+招招均 2 nr
+招招手 72 v
+招招沉 2 v
+招掌力 2 nr
+招揽 122 v
+招揽生意 3 l
+招摇 82 v
+招摇撞骗 34 i
+招摇过市 47 v
+招摇过街 3 v
+招收 1078 v
+招收新生 3 n
+招数 999 n
+招文袋 18 n
+招无礼 2 i
+招星月 2 nr
+招是惹非 3 i
+招是揽非 3 l
+招是搬非 3 i
+招是生非 3 l
+招术 76 n
+招术精 2 n
+招权纳贿 6 i
+招权纳赂 3 i
+招权纳赇 3 nz
+招来 263 v
+招来横祸 3 i
+招杨过 2 nr
+招架 407 n
+招架不住 27 l
+招架之力 3 l
+招标 430 n
+招标书 3 n
+招标人 15 n
+招标会 5 nt
+招标制 2 n
+招标办 2 nt
+招标网 3 n
+招民 3 n
+招法 38 n
+招满 7 v
+招灾 3 n
+招灾惹祸 6 i
+招灾揽祸 3 l
+招牌 293 v
+招牌式 3 n
+招牌戏 3 n
+招牌歌 3 n
+招牌菜 3 n
+招牌饭 3 n
+招瓦岗 3 nr
+招生 5330 v
+招生人数 3 l
+招生办 112 nt
+招生数 28 n
+招生简章 3 i
+招生网 3 nt
+招用 42 v
+招相斗 3 nr
+招眼 3 v
+招祸 7 n
+招租 6 v
+招笑 3 v
+招纳 29 v
+招纳侯 2 nr
+招结南 3 nr
+招罪 3 v
+招群魔 2 nr
+招考 187 v
+招考办 65 j
+招考网 3 n
+招聘 3885 v
+招聘会 556 n
+招聘制 3 n
+招聘启事 3 nr
+招聘员工 3 n
+招聘广告 3 n
+招聘网 3 n
+招聘者 40 n
+招股 64 v
+招股书 3 n
+招股价 3 n
+招胜 2 v
+招自 3 v
+招致 301 v
+招花惹草 3 i
+招英语 2 nr
+招蜂引蝶 4 n
+招蜂忍蝶 3 nr
+招蜂惹蝶 2 nr
+招行 66 v
+招行股 2 n
+招认 51 v
+招议 3 n
+招请 3 v
+招财 3 v
+招财猫 2 nr
+招财进宝 6 nr
+招贤 166 nr
+招贤纳士 16 nr
+招贴 26 v
+招贴栏 3 n
+招贴画 14 n
+招赘 33 v
+招起 3 v
+招轻灵 2 nr
+招进 3 v
+招进去 3 v
+招进来 3 l
+招远 10 nr
+招远县 5 nr
+招远市 2 n
+招连发 2 j
+招降 176 v
+招降纳叛 2 i
+招集 103 v
+招集会议 3 nt
+招领 3 v
+招领处 3 l
+招领失物 3 l
+招风 22 n
+招风惹草 3 i
+招风惹雨 3 i
+招风揽火 3 l
+招风耳 3 nr
+招飞复 4 nr
+招飞局 8 nt
+招飞站 6 nt
+招鬼 3 n
+招魂 100 n
+招魂扬播 3 nr
+招魂旛 3 nz
+招魂铃 3 i
+拜 6338 v
+拜上帝会 29 nt
+拜为 3 v
+拜亚 3 ns
+拜仁慕尼黑队 18 nt
+拜仁队 3 nt
+拜他为师 3 nr
+拜伏 3 v
+拜会 135 v
+拜伦 61 nrt
+拜佛 180 nrt
+拜你为师 3 nr
+拜倒 156 v
+拜倒石榴 3 n
+拜倒辕门 3 nr
+拜候 3 v
+拜偶像 3 n
+拜别 70 v
+拜到 3 v
+拜勒 4 nrt
+拜占庭 104 nr
+拜占庭式 3 n
+拜受 3 v
+拜启 3 v
+拜在门下 3 n
+拜坟 3 v
+拜垫 22 n
+拜城 9 ns
+拜城县 3 ns
+拜堂 125 n
+拜墓 3 v
+拜天地 71 nz
+拜官 4 v
+拜客 22 nrt
+拜寿 85 ns
+拜将封侯 3 nr
+拜少泽 3 nr
+拜尔 8 nrt
+拜尔公司 21 nt
+拜师 138 n
+拜师学艺 3 nt
+拜帖 3 n
+拜年 240 v
+拜年会 3 nt
+拜底 3 v
+拜庙 3 ns
+拜忏 6 v
+拜恩 8 nrt
+拜恩州 3 nrt
+拜恩私室 3 n
+拜我为师 3 nr
+拜房 3 v
+拜托 127 nrt
+拜扫 3 v
+拜把兄弟 7 n
+拜把子 31 n
+拜拉姆 3 nrt
+拜拜 37 ns
+拜揖 3 v
+拜斯 3 nrt
+拜早年 3 nr
+拜服 42 v
+拜望 72 v
+拜来拜去 3 nr
+拜次 3 v
+拜泉 2 nz
+拜泉县 3 ns
+拜火教 16 nz
+拜点 3 n
+拜爵 3 v
+拜物教 46 nz
+拜特 2 nrt
+拜玉凤 2 nr
+拜登 2 nrt
+拜盟 3 v
+拜相封侯 3 nr
+拜码头 3 n
+拜礼 3 v
+拜祝 3 nrt
+拜神 24 v
+拜祭 3 v
+拜祷 3 v
+拜科努尔 8 nrt
+拜老师 3 nr
+拜耳公司 7 nt
+拜节 3 v
+拜袓先 3 v
+拜见 488 v
+拜认 3 v
+拜访 392 v
+拜请 3 v
+拜读 34 v
+拜谒 98 v
+拜谢 255 v
+拜贺 3 v
+拜赐 3 v
+拜赐之师 3 nr
+拜起 3 v
+拜跑 3 v
+拜跪 3 v
+拜辞 90 v
+拜金 12 n
+拜金主义 23 nz
+拜金女 3 n
+拜门 3 v
+拜领 3 v
+拜鬼求神 3 n
+拝 2 zg
+拞 3 zg
+拟 1919 v
+拟为 3 v
+拟于 3 v
+拟于不伦 3 n
+拟于不论 3 n
+拟人 27 n
+拟人化 15 n
+拟人法 3 n
+拟以后 3 n
+拟任 3 v
+拟作 8 v
+拟作为 3 v
+拟具 3 v
+拟写 3 v
+拟凸函数 3 n
+拟凹函数 3 nr
+拟出 52 v
+拟制 36 v
+拟办 3 v
+拟南芥 3 n
+拟压力 3 n
+拟古 3 d
+拟合 43 v
+拟向 3 v
+拟品 3 n
+拟图 3 v
+拟基因型 3 n
+拟声 3 d
+拟声词 3 n
+拟妥 3 v
+拟定 826 v
+拟将 38 d
+拟就 28 d
+拟建 17 v
+拟态 13 n
+拟报 3 v
+拟拨 3 v
+拟提 5 v
+拟提拔 3 n
+拟文 3 v
+拟核 3 v
+拟正则元 3 n
+拟水平 3 n
+拟用 15 v
+拟病毒 3 n
+拟稿 11 v
+拟表型 3 n
+拟规画圆 3 n
+拟订 172 v
+拟议 35 v
+拟议调停 3 n
+拟设 3 v
+拟话本 20 n
+拟语 3 v
+拟请 3 v
+拟请照准 3 n
+拟调 3 v
+拟阵 3 v
+拟非其伦 3 n
+拟音 3 n
+拟音师 3 n
+拟题 8 n
+拠 7 zg
+拡 12 zg
+拢 765 zg
+拢共 3 d
+拢子 3 v
+拢岸 7 v
+拢总 3 v
+拢络 3 v
+拣 808 v
+拣佛烧香 3 ns
+拣出 3 v
+拣到 5 v
+拣去 3 v
+拣开 3 v
+拣择 6 v
+拣拾 7 v
+拣精拣肥 3 nr
+拣精择肥 3 nr
+拣起 3 v
+拣选 27 v
+拤 23 zg
+拥 2257 v
+拥不拥护 3 v
+拥书南面 3 n
+拥书百城 3 n
+拥入 293 v
+拥兵 3 v
+拥兵玩寇 3 i
+拥兵自卫 3 i
+拥兵自固 3 i
+拥兵自重 3 i
+拥军 72 v
+拥军优属 42 l
+拥军爱民 3 l
+拥到 3 v
+拥向 3 v
+拥吻 3 v
+拥吻入梦 3 n
+拥在 3 v
+拥堵 39 v
+拥塞 22 v
+拥彗清道 3 n
+拥彗清驱 3 n
+拥彗迎门 3 n
+拥戴 419 v
+拥戴者 4 n
+拥护 992 v
+拥护者 62 n
+拥抱 377 v
+拥抱着 3 l
+拥挤 549 v
+拥挤不堪 33 i
+拥政爱民 43 l
+拥有 8523 v
+拥有权 5 l
+拥有率 13 n
+拥有者 32 n
+拥有量 29 l
+拥着 3 v
+拥立 3 v
+拥篲救火 3 n
+拥簇 5 v
+拥被而起 3 i
+拥进 38 v
+拥进去 3 v
+拥进来 3 v
+拥金 3 n
+拥雾翻波 3 l
+拦 1159 v
+拦下 3 v
+拦不住 46 v
+拦住 843 v
+拦击 15 v
+拦劫 7 v
+拦截 1054 v
+拦截器 13 n
+拦截导弹 3 n
+拦截机 3 n
+拦截法 3 n
+拦挡 31 v
+拦挡住 3 n
+拦柜 3 n
+拦水 3 v
+拦水坝 3 n
+拦水闸 3 n
+拦污栅 2 n
+拦沙坝 3 n
+拦河坝 269 n
+拦河闸 7 n
+拦洪 3 v
+拦洪坝 3 n
+拦洪水库 3 nz
+拦海大坝 3 nz
+拦网 54 v
+拦腰 155 v
+拦腰截断 3 n
+拦获 3 v
+拦蓄 17 v
+拦路 137 v
+拦路强盗 3 n
+拦路抢劫 3 n
+拦路石 2 n
+拦路虎 37 nz
+拦车 6 v
+拦道木 3 n
+拦防 4 v
+拦阻 228 v
+拧 640 v
+拧上 3 v
+拧下 3 v
+拧下去 3 l
+拧下来 3 l
+拧住 3 v
+拧动 3 v
+拧干 3 v
+拧开 3 v
+拧成 3 v
+拧成一股绳 14 l
+拧折 3 v
+拧断 3 v
+拧松 3 v
+拧笑 3 v
+拧紧 15 v
+拧绳错觉 3 l
+拧起 3 v
+拧起来 3 l
+拨 2149 v
+拨万论千 3 i
+拨万轮千 3 i
+拨乱为治 3 i
+拨乱反正 495 i
+拨乱反治 3 i
+拨乱济危 3 i
+拨乱济时 3 i
+拨乱诛暴 3 i
+拨云撩雨 3 vn
+拨云睹日 3 i
+拨云见日 22 i
+拨交 3 v
+拨付 53 v
+拨作 3 v
+拨冗 3 d
+拨出 3 v
+拨出去 3 v
+拨出来 3 v
+拨到 3 v
+拨动 82 v
+拨千斤 3 n
+拨去 3 v
+拨发 3 v
+拨叫 6 v
+拨号 51 v
+拨号上网 3 i
+拨号器 3 n
+拨号盘 3 n
+拨号网络 3 n
+拨号键 3 n
+拨号音 3 i
+拨嘴撩牙 3 v
+拨回 3 v
+拨回去 3 i
+拨回来 3 i
+拨土 3 v
+拨子 3 n
+拨开 217 v
+拨弄 93 v
+拨弄是非 3 i
+拨弦 12 v
+拨快 3 v
+拨打 338 v
+拨拉 28 v
+拨接 6 v
+拨来 3 v
+拨来拨去 3 i
+拨档 3 v
+拨款 436 v
+拨水 3 v
+拨浪鼓 21 i
+拨火棍 3 n
+拨灯 3 v
+拨用 3 v
+拨电话 2 v
+拨给 117 v
+拨草寻蛇 5 i
+拨草瞻风 3 i
+拨转 3 v
+拨转到 3 v
+拨通 102 v
+拨速台 3 n
+拨雨撩云 3 z
+择 675 v
+择业 226 v
+择业观 8 l
+择主而事 3 l
+择交 3 v
+择人而事 3 i
+择伐 3 v
+择优 266 v
+择优上岗 3 v
+择优取向 3 i
+择优录取 3 v
+择优录用 15 l
+择优选用 3 l
+择偶 121 v
+择偶观 3 l
+择友 6 n
+择取 24 v
+择吉 9 ns
+择吉开张 3 i
+择善 10 v
+择善固执 3 v
+择善而从 37 i
+择善而行 3 i
+择地而蹈 3 i
+择址 4 v
+择婿 11 n
+择席 3 v
+择捉 2 v
+择捉岛 3 ns
+择日 50 d
+择日再死 3 i
+择日子 3 l
+择期 10 d
+择木而处 3 i
+择机 13 d
+择校 52 v
+择校热 11 n
+择校生 29 n
+择校费 33 n
+择校风 2 n
+择焉不精 3 i
+择福宜重 3 i
+择肥而噬 2 i
+择菜 12 v
+择要 12 v
+择选 3 v
+择邻 3 v
+择邻而居 3 i
+择配 3 v
+择食 3 v
+拫 58 zg
+括 429 v
+括发 3 n
+括号 104 n
+括囊守禄 3 n
+括囊拱手 3 n
+括在一起 3 n
+括弧 3 n
+括目相待 3 n
+括约肌 75 n
+括除 3 n
+拭 327 vg
+拭乾 3 i
+拭净 3 v
+拭去 3 v
+拭干 3 v
+拭泪 57 v
+拭目 3 v
+拭目以待 41 i
+拭目倾耳 3 i
+拭目而待 3 i
+拭目而观 3 i
+拭除 3 v
+拭面容言 3 i
+拮 24 n
+拮抗 40 v
+拮抗体 3 n
+拮抗剂 35 n
+拮抗效应 3 n
+拮抗物 3 n
+拮据 85 n
+拯 44 v
+拯弱救焚 3 nr
+拯救 522 v
+拯救队 3 vn
+拯民 3 v
+拯溺扶危 3 nr
+拰 655 zg
+拱 3217 v
+拱出 3 v
+拱券 19 n
+拱北 45 ns
+拱卫 58 v
+拱圈 13 n
+拱坝 50 ns
+拱型 3 n
+拱基 3 n
+拱墅区 3 ns
+拱廊 14 n
+拱开 3 v
+拱式 9 n
+拱弧灯 3 n
+拱形 327 n
+拱形门 3 n
+拱手 1010 v
+拱手听命 3 l
+拱手垂裳 3 n
+拱手相让 3 l
+拱手而降 3 l
+拱手行礼 3 n
+拱手让人 7 n
+拱手让出 3 n
+拱托 3 v
+拱护 3 v
+拱抱 3 v
+拱推 3 v
+拱揖指挥 3 v
+拱撞 3 v
+拱木 3 n
+拱柱 3 n
+拱桥 69 ns
+拱棚 3 n
+拱火 3 v
+拱状 3 n
+拱猪 3 n
+拱璧 3 ns
+拱石 3 n
+拱石桥 7 ns
+拱立 3 v
+拱肩缩背 3 l
+拱背 3 v
+拱花 3 n
+拱让 3 v
+拱起 3 v
+拱起的背 3 l
+拱路 3 n
+拱道 4 v
+拱门 61 n
+拱顶 16 n
+拱顶油罐 3 n
+拲 2 zg
+拳 2147 zg
+拳不离手 3 i
+拳中掿沙 3 v
+拳击 212 v
+拳击台 3 n
+拳击场 3 n
+拳击手 9 n
+拳击赛 3 n
+拳勇 3 n
+拳参 3 n
+拳坛 6 n
+拳头 857 n
+拳头产品 44 n
+拳套 8 n
+拳师 45 n
+拳师狗 3 n
+拳形 3 n
+拳心 3 n
+拳手 12 n
+拳打 103 n
+拳打脚踢 70 i
+拳拳 3 n
+拳拳之心 3 i
+拳拳之枕 3 i
+拳拳在念 3 i
+拳拳情意 3 i
+拳拳服膺 3 i
+拳拳盛意 3 i
+拳曲 3 n
+拳术 143 n
+拳棒 10 n
+拳法 354 n
+拳王 16 n
+拳皇 3 n
+拳脚 384 n
+拳脚交加 3 i
+拳脚相加 3 i
+拳脚相向 3 i
+拳蟹 3 n
+拳谱 22 n
+拳赛 4 n
+拳赛选手 3 n
+拳道 73 n
+拴 677 v
+拴上 3 n
+拴上去 3 v
+拴上来 3 v
+拴住 3 v
+拴着 3 v
+拴紧 3 v
+拴结 3 v
+拴绳 3 n
+拴缚 3 v
+拴锁 3 n
+拴马 3 n
+拴马桩 8 n
+拵 2 zg
+拶 23 g
+拷 222 zg
+拷打 167 v
+拷机 3 n
+拷盘 3 n
+拷纱 3 n
+拷绸 3 n
+拷贝 133 n
+拷贝到 3 nz
+拷贝数 3 nz
+拷贝机 3 nz
+拷问 93 v
+拹 5 zg
+拺 34 zg
+拻 13 zg
+拼 1105 v
+拼上 3 d
+拼上去 3 l
+拼上来 3 l
+拼下 3 v
+拼下去 3 l
+拼下来 3 l
+拼不过 3 l
+拼了命 3 l
+拼争 10 n
+拼会 3 v
+拼光 3 v
+拼写 149 v
+拼写法 9 n
+拼写错误 3 n
+拼凑 154 v
+拼凑出 3 vn
+拼出 3 v
+拼出去 3 l
+拼出来 3 l
+拼列 3 v
+拼列出 3 v
+拼到 3 v
+拼到底 3 l
+拼制 5 v
+拼刺 3 v
+拼刺刀 18 l
+拼力 3 d
+拼劲 19 v
+拼博 3 v
+拼合 30 v
+拼命 1073 v
+拼命三郎 15 l
+拼回 3 v
+拼回去 3 l
+拼回来 3 l
+拼图 14 v
+拼图游戏 3 l
+拼在一起 3 l
+拼型 3 n
+拼字 5 n
+拼字母 3 l
+拼字游戏 3 l
+拼形 3 n
+拼形码 3 l
+拼得 3 v
+拼成 3 v
+拼抢 90 v
+拼拢 3 v
+拼拼 3 v
+拼拼凑凑 3 vn
+拼拼看 3 i
+拼接 46 v
+拼接子 3 l
+拼搏 294 v
+拼搏精神 3 nz
+拼斗 4 v
+拼杀 67 v
+拼来 3 v
+拼来拼去 3 i
+拼板 2 n
+拼板门 3 n
+拼死 209 v
+拼死一搏 6 l
+拼死拼活 20 i
+拼法 5 v
+拼版 5 v
+拼盘 29 v
+拼缀 3 v
+拼缀出 3 vn
+拼缀成 3 vn
+拼花 4 n
+拼花玻璃 3 l
+拼装 155 v
+拼装车 3 l
+拼读 3 v
+拼贴 19 v
+拼过 3 v
+拼过去 3 l
+拼过来 3 l
+拼配 10 v
+拼错 3 v
+拼音 324 n
+拼音串 3 n
+拼音之星 3 l
+拼音佳佳 3 l
+拼音加加 3 l
+拼音化 3 l
+拼音字母 14 l
+拼音打字 3 l
+拼音文字 64 l
+拼音王 3 n
+拼音码 3 l
+拼音输入 3 n
+拽 1143 v
+拽了起来 3 v
+拽巷啰街 3 vn
+拽巷攞街 3 vn
+拽巷逻街 3 n
+拽布披麻 3 ns
+拽布拖麻 3 z
+拽耙扶犁 3 nr
+拽象拖犀 3 nr
+拽起来 3 vn
+拾 1396 v
+拾一 5 mq
+拾不得 3 l
+拾人唾余 3 vn
+拾人唾涕 3 v
+拾人牙慧 3 l
+拾元 3 v
+拾到 3 v
+拾去 3 v
+拾取 19 v
+拾回 3 v
+拾带重还 3 i
+拾得 3 v
+拾振器 3 l
+拾捡 7 v
+拾掇 79 v
+拾掇无遗 3 nr
+拾波线圈 3 n
+拾物 3 l
+拾破烂 3 i
+拾穗 3 v
+拾级 23 v
+拾级而上 20 l
+拾级而下 3 l
+拾荒 773 v
+拾荒老人 3 i
+拾荒者 3 i
+拾获 3 v
+拾贝 3 v
+拾起 3 v
+拾起来 3 l
+拾趣 3 v
+拾遗 81 v
+拾遗补缺 8 l
+拾遗补阙 3 i
+拾金不昧 11 i
+拾陈蹈故 3 i
+拾零 2 v
+拾零打短 3 i
+拾音器 2 l
+拿 19956 v
+拿三搬四 3 i
+拿上去 3 v
+拿上来 3 v
+拿下 862 v
+拿下马来 3 l
+拿不住 3 v
+拿不准 3 v
+拿不出 3 v
+拿不出手 3 l
+拿不好 3 l
+拿不定 3 v
+拿不起来 3 l
+拿主意 31 n
+拿乔 3 nr
+拿云捉月 3 i
+拿云握雾 3 n
+拿云攫石 3 vn
+拿人出气 3 l
+拿住 3 v
+拿准 3 v
+拿出 1935 v
+拿出手 7 v
+拿刀 3 n
+拿刀动杖 3 n
+拿刀弄杖 3 i
+拿到 1464 v
+拿办 8 v
+拿单 2 a
+拿印把儿 3 l
+拿取 3 v
+拿回去 3 l
+拿回扣 3 l
+拿在手上 3 l
+拿大头 3 l
+拿大奖 3 n
+拿大顶 4 n
+拿妖 3 n
+拿定 3 v
+拿定主意 3 n
+拿开 3 v
+拿得走 3 v
+拿得起 3 v
+拿手 170 v
+拿手功夫 3 n
+拿手好戏 52 l
+拿手戏 7 l
+拿手菜 10 n
+拿捏 147 v
+拿掉 3 v
+拿摩温 3 nr
+拿有 3 v
+拿权 3 v
+拿来 792 v
+拿来主义 21 l
+拿来拿去 3 l
+拿架子 8 n
+拿班作势 3 n
+拿班做势 3 l
+拿的出手 3 l
+拿破仑 539 n
+拿破仑帝 3 n
+拿破伦 3 nr
+拿稳 3 v
+拿笔 3 v
+拿粗夹细 3 l
+拿粗挟细 3 z
+拿糖作醋 3 n
+拿给 83 v
+拿腔作势 6 n
+拿腔作调 3 l
+拿腔做势 3 l
+拿腔拿调 17 l
+拿药 23 n
+拿获 17 v
+拿薪水 3 n
+拿货 3 n
+拿贼拿赃 3 i
+拿贼见赃 3 i
+拿走 163 v
+拿起 3 v
+拿顶 3 n
+拿骚 32 v
+持 4025 v
+持久 755 a
+持久之计 3 i
+持久力 8 n
+持久和平 3 n
+持久性 42 n
+持久战 126 v
+持久数据 2 n
+持久稳固 3 i
+持久美 3 i
+持之一恒 3 i
+持之以恒 76 i
+持之有故 3 i
+持人长短 3 i
+持仓 52 v
+持仓量 3 n
+持刀 220 n
+持刀动杖 3 n
+持卡 14 n
+持卡人 153 n
+持危扶颠 3 i
+持存 3 v
+持家 14 n
+持家基因 3 n
+持币待购 3 n
+持币观望 3 n
+持平 147 n
+持平之论 3 i
+持异议 3 v
+持异议者 2 n
+持戈试马 3 i
+持戒 3 v
+持戟 3 n
+持操 3 n
+持效 3 v
+持斋 3 v
+持斋把素 4 l
+持旗人 3 i
+持旗者 2 n
+持有 1623 v
+持有人 73 n
+持有偏见 3 i
+持有异议 3 n
+持有期 2 n
+持有者 46 n
+持权合变 3 n
+持枪 104 n
+持枪者 2 n
+持械 13 n
+持橐簪笔 3 nz
+持正 3 v
+持正不阿 3 i
+持法 3 v
+持满戒盈 3 i
+持球 36 n
+持球者 3 n
+持盈保泰 3 n
+持盈守成 3 n
+持矛 3 n
+持票人 3 n
+持禄养交 3 n
+持笔 3 v
+持筹握算 3 n
+持续 4676 vd
+持续一年 3 i
+持续上升 3 l
+持续保持 2 n
+持续增长 3 n
+持续性 116 n
+持续时间 3 n
+持续订购 3 n
+持续音 3 n
+持续饰变 3 n
+持股 563 v
+持股会 4 n
+持股数 55 n
+持胜 3 v
+持节 84 n
+持螯把酒 3 v
+持蠡测海 3 i
+持衡 3 a
+持许 3 v
+持论 3 v
+持论公允 3 l
+持证 37 v
+持证人 4 n
+持质 3 n
+持身 3 v
+持重 104 v
+持重待机 3 n
+挂 6653 v
+挂一挂 3 v
+挂一漏万 6 i
+挂上去 3 v
+挂上来 3 v
+挂下 3 v
+挂下去 3 v
+挂下来 3 v
+挂不上 3 v
+挂不下 3 v
+挂不住 3 v
+挂件 16 n
+挂住 3 v
+挂入 3 v
+挂冠 12 n
+挂冠归去 3 i
+挂冠求去 3 i
+挂冠而去 3 i
+挂出 56 v
+挂出去 3 v
+挂到 62 v
+挂勾 6 nz
+挂包 10 v
+挂匾 3 n
+挂单 15 n
+挂印 13 v
+挂印悬牌 3 n
+挂历 11 v
+挂号 69 n
+挂号信 8 nz
+挂号处 4 n
+挂号费 25 n
+挂名 39 v
+挂名夫妻 3 n
+挂回 3 v
+挂回去 3 l
+挂回来 3 l
+挂图 28 v
+挂图表 3 n
+挂在口上 3 l
+挂壁 8 n
+挂失 16 v
+挂失手续 3 v
+挂孝 22 v
+挂屏 18 n
+挂帅 102 n
+挂帐 3 n
+挂帘 3 n
+挂带 6 n
+挂席为门 3 l
+挂幌子 3 v
+挂彩 47 n
+挂心 41 v
+挂念 265 v
+挂怀 73 v
+挂意 3 v
+挂成 3 v
+挂拍 3 v
+挂挡 3 v
+挂掉 3 v
+挂接 3 v
+挂搭 3 v
+挂放 3 v
+挂斗 3 v
+挂断 70 v
+挂断键 3 n
+挂旗 3 n
+挂有 3 v
+挂机 14 n
+挂机版 3 n
+挂机网 3 nz
+挂来 3 v
+挂来挂去 3 l
+挂果 13 n
+挂架 106 v
+挂橱 3 n
+挂欠 3 v
+挂毯 38 n
+挂满 3 v
+挂漏 2 v
+挂火 3 v
+挂灯 11 v
+挂灯结彩 3 nz
+挂点 17 n
+挂牌 276 v
+挂牌价 3 n
+挂牌案件 3 n
+挂牵 12 v
+挂瓦条 3 n
+挂甲 9 n
+挂画 4 v
+挂盘 2 v
+挂碍 24 v
+挂空 3 v
+挂篮 3 nz
+挂累 3 v
+挂红 10 v
+挂绳 3 n
+挂绳孔 3 n
+挂绿 3 v
+挂网 3 v
+挂羊头 3 n
+挂羊头卖 3 l
+挂羊头卖狗肉 11 i
+挂职 52 v
+挂职支教 3 n
+挂职锻炼 3 l
+挂肚牵心 3 l
+挂肚牵肠 3 l
+挂花 9 n
+挂虑 14 v
+挂衣 3 v
+挂衣架 3 n
+挂衣钩 3 nz
+挂表 2 v
+挂角 2 n
+挂记 13 v
+挂记着 3 l
+挂账 32 v
+挂起 3 v
+挂起时间 3 l
+挂车 44 v
+挂轴 4 n
+挂载 108 v
+挂过去 3 v
+挂过来 3 v
+挂进 3 v
+挂进去 3 v
+挂进来 3 v
+挂钟 15 n
+挂钩 239 v
+挂链 3 n
+挂锁 4 v
+挂锄 3 v
+挂镜线 3 n
+挂镰 3 v
+挂长 3 v
+挂零 3 v
+挂靠 38 v
+挂面 55 n
+挂靴 3 nz
+挂鞋 3 n
+挂饰 2 v
+挂齿 9 n
+挄 21 zg
+指 13375 n
+指不定 21 v
+指不胜偻 3 n
+指不胜屈 2 i
+指东划西 3 n
+指东画西 3 n
+指东话西 3 n
+指东说西 3 n
+指为 3 v
+指义 3 n
+指书 3 n
+指事 15 n
+指事类情 3 n
+指亲托故 3 n
+指代 23 n
+指令 869 n
+指令区 3 n
+指令和数据 5 n
+指令器 3 n
+指令寄存器 2 n
+指令性 101 n
+指令投 3 i
+指令文件 3 n
+指令流 7 n
+指令码 3 n
+指令系统 24 n
+指令舱 3 n
+指令表 3 n
+指令重试 3 n
+指令集 3 n
+指令预取 3 l
+指位 3 n
+指使 369 v
+指使人 3 n
+指供 3 v
+指关节 25 n
+指出 7847 v
+指到 3 v
+指前 20 v
+指北针 14 n
+指南 962 n
+指南书 3 n
+指南录 11 n
+指南攻北 3 i
+指南极 3 n
+指南车 45 n
+指南针 177 n
+指南鱼 3 n
+指印 62 n
+指压 3 n
+指压法 3 n
+指名 56 v
+指名道姓 38 n
+指向 791 n
+指向性 23 n
+指回 3 v
+指回到 3 l
+指回去 3 l
+指回来 3 l
+指天 3 n
+指天为誓 4 i
+指天划地 3 n
+指天射鱼 3 n
+指天画地 3 n
+指天誓日 3 i
+指头 464 n
+指头肚儿 3 n
+指套 3 n
+指好 3 v
+指完 3 v
+指定 1699 v
+指导 7794 n
+指导书 7 n
+指导价 68 n
+指导作用 3 n
+指导员 592 n
+指导思想 3 n
+指导性 86 n
+指导意义 3 n
+指导教授 3 n
+指导方针 3 n
+指导科 2 n
+指导组 2 n
+指导老师 3 n
+指导者 22 n
+指尖 132 n
+指山卖磨 3 i
+指山说磨 3 i
+指引 533 v
+指引卡 3 n
+指引方向 3 n
+指战员 200 n
+指手划脚 85 i
+指手点脚 3 i
+指手画脚 67 i
+指手顿脚 3 i
+指拨 3 v
+指指 279 n
+指指戳戳 4 v
+指指点点 96 n
+指挥 7805 v
+指挥中心 3 n
+指挥仪 31 n
+指挥刀 7 n
+指挥可定 3 n
+指挥台 36 n
+指挥员 463 n
+指挥塔 63 n
+指挥大师 3 n
+指挥官 452 n
+指挥室 27 n
+指挥家 80 n
+指挥所 473 n
+指挥有方 3 n
+指挥机构 3 n
+指挥权 75 n
+指挥棒 25 n
+指挥系 2 n
+指挥系统 3 n
+指挥组 22 n
+指挥者 36 n
+指挥舰 42 n
+指挥舱 26 n
+指挥船 2 n
+指挥艺术 3 n
+指挥若定 24 i
+指挥车 78 n
+指挥连 3 n
+指挥部 1796 n
+指掌可取 3 i
+指控 312 vn
+指摘 166 v
+指教 243 n
+指数 2311 n
+指数值 4 n
+指数函数 12 n
+指数分布 3 n
+指数化 2 n
+指数线 3 n
+指斥 113 v
+指方画圆 3 n
+指日 3 n
+指日可下 8 i
+指日可待 78 i
+指日可数 3 l
+指日成功 3 i
+指日而待 3 i
+指日高升 3 l
+指旨 3 n
+指明 491 v
+指明方向 3 n
+指望 963 v
+指李推张 3 n
+指来指去 3 i
+指标 2466 n
+指标体系 3 n
+指标值 8 n
+指标化 2 n
+指标图 3 n
+指标性 3 n
+指标股 3 n
+指树为姓 3 i
+指桑说槐 3 i
+指桑骂槐 23 i
+指模 3 n
+指正 64 v
+指法 95 n
+指法训练 3 n
+指派 171 n
+指派法 3 n
+指涉 3 v
+指点 1195 n
+指点江山 3 i
+指点迷津 40 l
+指爪 3 n
+指物 3 n
+指状沙坝 3 n
+指猪骂狗 3 i
+指环 58 vn
+指环王 3 n
+指用 3 v
+指甲 434 n
+指甲刀 3 n
+指甲剪 4 n
+指甲夹 3 n
+指甲心儿 3 n
+指甲油 35 n
+指甲盖 23 n
+指甲花 2 n
+指甲钳 3 n
+指画 20 n
+指痕 3 n
+指皁为白 3 n
+指皂为白 3 l
+指盘 3 n
+指着 2192 v
+指矢天日 3 i
+指破迷团 3 i
+指示 2632 v
+指示仪 4 n
+指示信 40 n
+指示剂 76 n
+指示器 39 n
+指示板 3 n
+指示植物 35 n
+指示灯 33 n
+指示牌 25 n
+指示管 3 n
+指示精神 3 n
+指示群落 3 i
+指示菌 3 n
+指称 58 v
+指空话空 3 n
+指端 15 n
+指簧 3 n
+指纹 100 n
+指纹图 4 n
+指纹学 6 n
+指纹识别 3 n
+指纹锁 3 n
+指给 3 v
+指缝 32 n
+指缝间 3 n
+指肠 3 n
+指腹为婚 13 i
+指节 26 n
+指要 3 v
+指认 27 v
+指证 21 v
+指证历历 3 n
+指说 3 n
+指谪 3 vn
+指责 1160 v
+指责声 3 n
+指责者 3 n
+指起 3 v
+指距 3 n
+指路 290 n
+指路卡 9 n
+指路明灯 3 n
+指路牌 3 n
+指迷 3 v
+指配 2 vn
+指重表 3 n
+指针 247 n
+指针式 3 n
+指错 3 v
+指键 3 n
+指键如飞 3 n
+指间 3 n
+指陈 3 v
+指雁为羹 3 i
+指靠 29 v
+指骨 31 n
+指鸡骂狗 2 i
+指鹿为马 12 i
+指鹿作马 3 i
+指麾可定 3 v
+挈 56 g
+挈瓶之智 3 v
+挈瓶之知 3 v
+挈领 3 i
+按 21008 p
+按下不表 3 l
+按人择岗 3 n
+按件计费 3 n
+按件计酬 3 l
+按住 419 v
+按例 3 n
+按俫 3 vn
+按倒 45 d
+按兵不举 3 i
+按兵不动 111 i
+按兵束甲 3 n
+按动 43 vn
+按劳付酬 3 l
+按劳分配 169 l
+按劳取酬 8 l
+按压 96 v
+按名责实 3 l
+按图为证 3 i
+按图索骥 21 i
+按址 3 n
+按堵如故 3 l
+按察使 81 n
+按岗择人 3 n
+按年计费 3 i
+按年计酬 3 l
+按序 13 n
+按扣 3 v
+按捺 62 v
+按捺不住 274 i
+按排 3 v
+按插 3 v
+按揭 115 vn
+按摩 573 v
+按摩乳 3 n
+按摩器 2 l
+按摩女 3 l
+按摩室 3 n
+按摩师 8 l
+按摩床 3 n
+按摩房 3 n
+按摩棒 3 i
+按摩椅 3 n
+按摩法 3 l
+按摩疗法 3 l
+按摩院 5 l
+按日计费 3 i
+按日计酬 3 i
+按时 721 d
+按期 121 d
+按次 3 d
+按步就班 3 i
+按照 11557 p
+按理 83 vn
+按理出牌 3 l
+按理说 108 l
+按甲休兵 3 n
+按甲寝兵 3 i
+按着 349 p
+按程序 5 l
+按类型 3 n
+按脉 4 n
+按行自抑 3 v
+按规定 53 l
+按计划 79 n
+按语 12 n
+按说 287 v
+按质论价 3 n
+按资排辈 3 l
+按辔徐行 11 i
+按迹循踪 3 i
+按道理讲 3 l
+按道理说 3 l
+按部就班 90 i
+按金 13 n
+按钉 3 n
+按钮 98 n
+按钮图标 3 vn
+按钮开关 3 b
+按钮式 2 b
+按铃 3 n
+按铃申告 3 n
+按键 85 n
+按键式 3 n
+按键精灵 3 n
+按需分配 10 l
+挋 11 zg
+挌 11 zg
+挎 622 n
+挎包 108 n
+挎斗 3 n
+挎枪 3 n
+挎着 3 n
+挏 2 zg
+挑 2835 v
+挑三嫌四 3 t
+挑三拣四 21 i
+挑三拨四 3 i
+挑三检四 3 n
+挑三豁四 3 t
+挑上 3 v
+挑上去 3 v
+挑上来 3 v
+挑下 3 v
+挑下去 3 v
+挑下来 3 l
+挑不出 3 v
+挑不动 3 l
+挑么挑六 3 l
+挑出 91 v
+挑出去 3 v
+挑出来 3 vn
+挑到 3 v
+挑刺 19 vn
+挑刺儿 3 l
+挑剔 236 v
+挑动 69 vn
+挑台 3 v
+挑唆 27 v
+挑唇斗嘴 3 l
+挑唇料嘴 3 l
+挑嘴 3 v
+挑土 3 v
+挑大梁 17 l
+挑夫 25 n
+挑头 16 v
+挑好 3 v
+挑子 52 n
+挑字 3 n
+挑字眼 3 l
+挑字眼儿 3 l
+挑射 11 v
+挑尖梁 3 n
+挑山工 3 n
+挑幺挑六 3 i
+挑开 3 v
+挑弄 3 v
+挑弄是非 3 i
+挑得 3 v
+挑情 3 n
+挑战 2615 vn
+挑战书 2 n
+挑战五笔 3 i
+挑战性 103 n
+挑战权 7 n
+挑战杯 11 n
+挑战王 3 n
+挑战者 104 n
+挑战者杯 3 n
+挑战赛 30 n
+挑手 3 v
+挑担 82 v
+挑拔 3 v
+挑拣 22 v
+挑拣出 3 i
+挑拨 152 v
+挑拨是非 3 i
+挑拨离间 57 i
+挑挑 3 v
+挑挑拣拣 10 z
+挑明 81 v
+挑是非 3 l
+挑梁 2 n
+挑檐石 3 i
+挑毛剔刺 3 i
+挑毛拣刺 3 n
+挑毛病 10 n
+挑水 165 vn
+挑灯 30 v
+挑灯夜战 17 i
+挑灯拨火 3 i
+挑牙料唇 3 n
+挑眼 3 v
+挑精拣肥 3 i
+挑肥拣瘦 16 i
+挑舋 3 z
+挑花 17 n
+挑茶斡刺 3 vn
+挑落 5 v
+挑衅 331 v
+挑衅性 24 l
+挑读 3 v
+挑走 3 v
+挑起 412 v
+挑起来 3 l
+挑达 3 v
+挑运 3 vn
+挑选 908 v
+挑选出 3 l
+挑选到 3 l
+挑逗 70 v
+挑逗性 11 n
+挑逗撩拔 3 v
+挑重担 3 n
+挑错 10 v
+挑雪填井 3 i
+挑食 17 v
+挒 26 zg
+挓 16 zg
+挖 2886 v
+挖上去 3 v
+挖上来 3 v
+挖下 3 v
+挖下去 3 v
+挖下来 3 v
+挖东墙补 3 i
+挖井 3 n
+挖倒 3 v
+挖出 293 v
+挖出去 3 v
+挖出来 3 v
+挖到 3 v
+挖取 3 v
+挖土 59 n
+挖土机 2 n
+挖地 3 n
+挖地洞 3 n
+挖地道 3 i
+挖地雷 3 i
+挖坑 70 n
+挖坑道 3 i
+挖墓 3 n
+挖墙脚 9 i
+挖墙角 3 i
+挖壕机 3 nz
+挖大一点 3 i
+挖山 3 n
+挖开 3 v
+挖得 3 v
+挖掉 24 v
+挖掘 933 v
+挖掘出 3 n
+挖掘效应 3 n
+挖掘机 37 n
+挖掘潜力 3 n
+挖方 3 n
+挖来 3 v
+挖来挖去 3 n
+挖水沟 3 n
+挖沙 6 n
+挖沟 3 n
+挖沟机 3 n
+挖治器 3 n
+挖泥 9 n
+挖泥机 3 n
+挖泥船 20 n
+挖洞 62 n
+挖潜 30 v
+挖潜力 3 n
+挖煤 3 v
+挖电缆沟 3 n
+挖瞎 3 n
+挖矿 3 n
+挖空 3 n
+挖空心思 63 i
+挖穿 3 v
+挖耳勺 5 n
+挖耳当招 3 i
+挖耳朵 3 n
+挖肉补疮 2 i
+挖苦 120 v
+挖苦嘲讽 3 i
+挖苦话 2 i
+挖补 2 v
+挖补到 3 v
+挖角 3 n
+挖走 25 v
+挖起 3 v
+挖起来 3 v
+挖路 3 n
+挖路队 3 n
+挖过去 3 v
+挖过来 3 v
+挖进 3 v
+挖进去 3 v
+挖进来 3 v
+挖通 3 v
+挖除 5 v
+挖雷 3 v
+挗 14 zg
+挙 38 zg
+挚 153 zg
+挚交 3 n
+挚友 71 n
+挚情 3 n
+挚爱 79 n
+挚诚 5 a
+挛 67 v
+挛生 3 v
+挛缩 16 v
+挜 7 zg
+挝 93 x
+挞 47 g
+挞伐 7 v
+挟 700 v
+挟主行令 3 v
+挟书律 3 i
+挟人捉将 3 i
+挟仇 3 v
+挟住 3 v
+挟冰求温 3 i
+挟到 3 v
+挟制 106 v
+挟势弄权 3 i
+挟天子以 3 i
+挟天子以令诸侯 10 i
+挟嫌 10 v
+挟山超海 2 i
+挟带 56 v
+挟怨 3 v
+挟恨 3 v
+挟持 101 v
+挟朋树党 3 i
+挟杀 3 v
+挟权倚势 3 i
+挟着 3 v
+挟细拿粗 3 i
+挟藏 3 v
+挟裹 4 v
+挠 516 v
+挠力河 7 ns
+挠喉捩嗓 3 n
+挠头 42 n
+挠度 4 n
+挠性 17 n
+挠曲 13 n
+挠曲枉直 3 n
+挠痒 6 v
+挠痒痒 3 z
+挠直为曲 3 n
+挠秧 3 v
+挠腮撧耳 3 n
+挠钩 13 v
+挠钩手 3 n
+挡 2950 zg
+挡一挡 3 i
+挡上去 3 v
+挡上来 3 v
+挡下 3 v
+挡下去 3 v
+挡下来 3 v
+挡不住 3 v
+挡位 4 n
+挡住 723 v
+挡光 2 n
+挡到 3 v
+挡回 3 v
+挡回去 3 i
+挡回来 3 i
+挡土墙 5 n
+挡墙 4 n
+挡子 3 n
+挡寒 3 v
+挡开 3 v
+挡得住 3 v
+挡掉 3 v
+挡来挡去 3 n
+挡板 20 n
+挡泥 3 n
+挡泥板 4 n
+挡球 6 n
+挡眼 3 v
+挡箭牌 42 n
+挡路 36 n
+挡车 11 n
+挡车器 3 n
+挡车工 5 n
+挡过去 3 v
+挡过来 3 v
+挡道 3 v
+挡雨 3 n
+挡雨板 3 n
+挡风 47 n
+挡风墙 2 n
+挡风沙 3 n
+挡风玻璃 3 n
+挡风遮雨 3 i
+挡驾 15 v
+挢 18 zg
+挢抂过正 3 v
+挢揉造作 3 nr
+挢枉过正 3 v
+挣 1076 v
+挣不脱 3 v
+挣个 3 v
+挣了钱 3 v
+挣出 3 v
+挣分 3 v
+挣到 3 v
+挣命 25 v
+挣大钱 3 v
+挣开 11 v
+挣得 105 v
+挣扎 1329 v
+挣掉 3 v
+挣揣 3 v
+挣断 17 v
+挣来 3 v
+挣点 3 v
+挣端 3 v
+挣脱 370 v
+挣起 3 v
+挣钱 355 v
+挣饭吃 3 v
+挤 2260 v
+挤上去 3 v
+挤上来 3 v
+挤下 3 v
+挤下去 3 v
+挤下来 3 v
+挤乳 3 nz
+挤作一团 3 i
+挤兑 55 v
+挤兑出来 3 n
+挤入 40 v
+挤出 292 v
+挤出去 3 v
+挤出机 5 vn
+挤出来 3 v
+挤切销 3 i
+挤到 3 v
+挤剩 3 v
+挤占 53 v
+挤压 291 v
+挤压加工 3 nz
+挤压机 2 nz
+挤去 3 v
+挤向 3 v
+挤垮 6 v
+挤塑板 3 nz
+挤奶 27 v
+挤奶器 3 l
+挤奶机 2 l
+挤完 3 v
+挤岔 3 v
+挤开 3 v
+挤弄 3 v
+挤成 3 v
+挤成一团 3 i
+挤扁 3 z
+挤手捏脚 3 i
+挤挤 61 v
+挤挤挨挨 2 z
+挤挤插插 3 i
+挤掉 35 v
+挤推 3 v
+挤撞 3 v
+挤断 3 v
+挤时间 3 l
+挤昏了头 3 i
+挤来 3 v
+挤来挤去 3 i
+挤榨 3 v
+挤死 3 v
+挤水分 3 l
+挤水泥 3 i
+挤沉 3 v
+挤泪 3 v
+挤满 203 v
+挤爆 3 v
+挤牙膏 5 nz
+挤痛 3 v
+挤眉弄眼 47 i
+挤眉溜眼 3 l
+挤眼 3 v
+挤破 3 v
+挤空 3 v
+挤落 3 v
+挤走 3 v
+挤足 3 v
+挤身 3 v
+挤身于 3 l
+挤车 3 v
+挤轧 3 v
+挤过去 3 l
+挤过来 3 l
+挤进 92 v
+挤进去 3 v
+挤进来 3 l
+挤迫 3 v
+挤逼 3 v
+挤错 3 v
+挥 4046 v
+挥之不去 55 l
+挥之即去 12 i
+挥兵 3 v
+挥写 3 v
+挥军 3 v
+挥刀 3 v
+挥刀自宫 3 l
+挥别 3 v
+挥剑 3 v
+挥剑成河 3 i
+挥动 430 v
+挥动者 3 n
+挥发 234 v
+挥发份 3 n
+挥发度计 3 i
+挥发性 77 n
+挥发掉 3 i
+挥发油 33 n
+挥发法 3 n
+挥发物 19 l
+挥发顺序 3 l
+挥师 81 n
+挥戈 14 v
+挥戈反日 3 i
+挥戈回日 3 i
+挥戈返日 3 i
+挥戈退日 3 i
+挥手 1003 v
+挥手告别 3 i
+挥手致意 3 i
+挥打 3 v
+挥拳 85 v
+挥挥手 3 n
+挥斥 3 v
+挥斥八极 3 i
+挥日阳戈 3 l
+挥杆 11 n
+挥棒 3 n
+挥棒落空 3 i
+挥毫 59 v
+挥毫落笔 3 i
+挥毫落纸 3 l
+挥汁如雨 3 i
+挥汗 3 v
+挥汗如雨 17 l
+挥汗成雨 2 l
+挥沐吐餐 3 l
+挥泪 44 v
+挥洒 69 v
+挥洒自如 40 i
+挥涕 3 v
+挥砍 3 v
+挥笔 41 v
+挥翰临池 3 nz
+挥臂 12 n
+挥舞 717 v
+挥起 3 v
+挥金如土 12 i
+挥金璞玉 3 i
+挥霍 190 v
+挥霍一空 3 i
+挥霍无度 18 i
+挥霍者 3 n
+挥鞭 3 v
+挦 24 zg
+挦毛捣鬓 3 i
+挦章撦句 3 n
+挧 25 zg
+挨 1655 v
+挨三顶五 3 i
+挨上去 3 v
+挨个 56 d
+挨个儿 28 d
+挨冻 10 v
+挨冻受饿 3 i
+挨刀 3 v
+挨到 3 v
+挨宰 8 v
+挨家 3 v
+挨家挨户 56 i
+挨家逐户 3 i
+挨山塞海 3 i
+挨户 7 v
+挨打 308 v
+挨打受骂 3 i
+挨批 26 v
+挨挤 3 v
+挨揍 16 v
+挨整 23 v
+挨斗 37 v
+挨时间 3 d
+挨板子 7 i
+挨次 192 d
+挨着 313 v
+挨肩 3 d
+挨肩儿 3 l
+挨肩叠背 3 i
+挨肩并足 3 i
+挨肩搭背 3 l
+挨肩擦背 3 i
+挨肩擦脸 3 i
+挨肩擦膀 3 l
+挨肩迭背 3 l
+挨边 4 d
+挨过 3 v
+挨近 52 v
+挨门 3 d
+挨门挨户 7 i
+挨门逐户 3 i
+挨靠 3 v
+挨风缉缝 3 vn
+挨饿 79 v
+挨饿受冻 5 l
+挨骂 81 v
+挪 688 ns
+挪不动 3 v
+挪不开 3 v
+挪作 3 ns
+挪作他用 3 ns
+挪借 11 v
+挪出 3 v
+挪动 146 v
+挪占 3 v
+挪威 876 ns
+挪威人 35 n
+挪威克朗 2 ns
+挪威克郎 3 ns
+挪威政府 5 nt
+挪威文 3 ns
+挪威海 33 ns
+挪威王国 3 ns
+挪威议会 9 nt
+挪威话 3 n
+挪威语 6 nz
+挪威队 10 nt
+挪开 44 v
+挪支 3 ns
+挪款 3 v
+挪用 195 v
+挪用公款 3 n
+挪用资金 3 n
+挪移 153 v
+挪窝 17 ns
+挪窝儿 3 n
+挪走 3 v
+挫 438 v
+挫伤 91 v
+挫折 763 n
+挫折感 18 n
+挫损 3 v
+挫敌 3 v
+挫敌锐气 3 n
+挫裂伤 2 n
+挫败 342 v
+挫辱 3 v
+挫骨扬灰 2 n
+挬 3 zg
+挮 2 zg
+振 864 v
+振作 173 vn
+振作精神 3 i
+振作起 3 i
+振作起来 3 l
+振兴 659 v
+振兴中华 53 nr
+振兴区 3 ns
+振兴医疗 3 n
+振兴图强 3 nr
+振兴实业 3 l
+振兴老 3 nr
+振兴路 3 nr
+振兵泽旅 3 nr
+振兵释旅 3 n
+振剧 3 v
+振动 993 vn
+振动体 3 n
+振动台 3 n
+振动器 259 n
+振动效应 3 l
+振动模式 3 l
+振动盘 3 n
+振动磨 3 i
+振动筛 2 nz
+振动觉 3 n
+振动计 3 vn
+振华 69 nz
+振华奖 2 nz
+振华港机 3 nz
+振华路 3 nz
+振南 2 ns
+振国 3 ns
+振型 23 n
+振声 3 v
+振奋 464 v
+振奋人心 28 i
+振奋精神 3 i
+振奋起 3 i
+振奋起来 3 i
+振子 10 n
+振安区 3 ns
+振幅 171 n
+振幅分割 3 l
+振扬 3 v
+振拔 3 v
+振振 3 v
+振振有词 63 i
+振振有辞 12 i
+振捣 3 v
+振捣器 3 i
+振敏管 3 nr
+振暴 3 n
+振武学社 3 l
+振源 6 n
+振穷恤寡 3 n
+振穷恤贫 3 n
+振笔 3 v
+振笔疾书 3 n
+振笔直书 3 i
+振翅 3 v
+振翅高飞 3 nr
+振翮高飞 3 v
+振翼 8 n
+振耳发聩 3 i
+振耳欲聋 3 i
+振聋发 3 i
+振聋发嘳 3 i
+振聋发聩 26 i
+振臂 305 n
+振臂一呼 20 i
+振臂高呼 3 i
+振荡 257 v
+振荡下行 3 v
+振荡周期 2 i
+振荡器 49 l
+振荡整理 3 i
+振荡波 3 nr
+振荡电流 3 v
+振荡电路 3 nz
+振荡盘升 3 l
+振衣濯足 3 nr
+振衰起蔽 3 l
+振裘持领 3 i
+振贫济乏 3 i
+振起 3 v
+振铃 3 nz
+振镜 2 nz
+振领提纲 3 nr
+振颤 6 v
+振鹭充庭 3 nr
+挰 21 zg
+挲 19 x
+挳 5 zg
+挴 7 zg
+挶 172 zg
+挷 3 zg
+挸 4 zg
+挹 21 n
+挹娄 14 n
+挹彼注兹 3 nz
+挹彼注此 3 nr
+挹斗扬箕 3 n
+挹注 3 v
+挹盈注虚 3 n
+挺 3742 d
+挺上去 3 v
+挺上来 3 v
+挺下去 3 v
+挺下来 3 v
+挺不住 3 v
+挺不错 3 i
+挺举 48 v
+挺伸 3 v
+挺住 3 v
+挺凶 3 v
+挺出 3 v
+挺出去 3 i
+挺出来 3 i
+挺到 3 v
+挺升 3 v
+挺坚 3 v
+挺好吃 3 a
+挺好玩 3 a
+挺好用 3 a
+挺尸 6 v
+挺得 3 v
+挺快 3 v
+挺拔 170 v
+挺括 19 v
+挺挺 3 a
+挺撞 17 v
+挺来挺去 3 z
+挺棒 3 n
+挺然 3 z
+挺直 187 v
+挺秀 13 a
+挺立 126 v
+挺而走险 10 i
+挺胸 70 v
+挺胸凸肚 9 i
+挺脱 3 v
+挺舒服 3 z
+挺起 150 v
+挺起来 3 v
+挺起胸来 3 i
+挺身 171 v
+挺身凸肚 3 i
+挺身而出 333 i
+挺进 487 v
+挺进去 3 v
+挺进来 3 v
+挺鹿走险 3 i
+挼 16 zg
+挼搓 3 v
+挽 957 v
+挽住 3 v
+挽具 12 v
+挽力 2 n
+挽回 427 v
+挽回影响 3 n
+挽回损失 3 n
+挽幛 14 n
+挽惜 3 v
+挽手 3 v
+挽救 863 v
+挽救不了 3 n
+挽歌 32 v
+挽留 197 v
+挽着 3 v
+挽联 197 v
+挽脚 3 v
+挽袖 3 n
+挽词 10 n
+挽诗 7 v
+挽起 3 v
+挽辞 3 v
+挽额 3 n
+挽髻 3 n
+捀 5 zg
+捂 472 v
+捂住 232 v
+捂捂盖盖 3 ns
+捂盖子 5 v
+捂着 3 v
+捂着脸 3 v
+捃 8 g
+捅 629 v
+捅出 3 v
+捅出来 3 l
+捅咕 3 v
+捅娄子 6 v
+捅射 5 v
+捅漏 3 v
+捅破 3 v
+捅穿 3 v
+捅进 3 v
+捅马蜂窝 2 l
+捅鼓 3 v
+捆 719 v
+捆上 3 v
+捆住 3 v
+捆住手脚 3 v
+捆做 3 v
+捆儿 5 v
+捆到 3 v
+捆包机 3 n
+捆吊 3 v
+捆好 3 v
+捆工 3 v
+捆得 3 v
+捆成 3 v
+捆成一堆 3 n
+捆扎 41 v
+捆扎机 3 n
+捆拢 3 v
+捆来捆去 3 n
+捆牢 3 v
+捆着 3 v
+捆紧 3 v
+捆绑 216 v
+捆绑带 3 b
+捆绑式 10 b
+捆绑机 3 b
+捆缚 32 v
+捆起 3 v
+捆起来 3 v
+捇 19 zg
+捉 2392 v
+捉上去 3 v
+捉上来 3 l
+捉下去 3 l
+捉下来 3 l
+捉不胜捉 3 i
+捉住 338 v
+捉刀 3 v
+捉刀伐笔 3 i
+捉到 3 v
+捉双 3 v
+捉奸 47 v
+捉奸在床 3 i
+捉奸捉双 3 i
+捉妖 3 i
+捉弄 162 v
+捉弄人 3 i
+捉影捕风 3 l
+捉手 3 v
+捉拿 265 v
+捉拿凶手 3 i
+捉拿归案 19 i
+捉拿犯人 3 i
+捉拿逃犯 3 i
+捉捕 3 v
+捉掐 3 l
+捉摸 150 v
+捉摸不出 3 i
+捉摸不定 49 i
+捉摸不透 3 i
+捉牢 3 v
+捉狭鬼 3 v
+捉班做势 3 l
+捉生 3 v
+捉生替死 3 l
+捉禁见肘 3 i
+捉笔 3 v
+捉脉 3 v
+捉虫 3 v
+捉衿肘见 3 i
+捉襟肘见 3 i
+捉襟见肘 62 i
+捉贼 3 v
+捉贼捉脏 3 i
+捉贼捉赃 7 i
+捉贼记 3 i
+捉赃 3 v
+捉起 3 v
+捉起来 3 l
+捉迷藏 75 l
+捉钱 3 v
+捉风捕影 3 l
+捉风捕月 3 l
+捉鼠拿猫 3 i
+捉鼻 3 v
+捊 9 zg
+捋 506 v
+捋奶 3 v
+捋胳膊 3 v
+捋虎须 10 v
+捋袖揎拳 3 v
+捋起 3 v
+捌 63 m
+捍 68 v
+捍卫 450 v
+捍卫战士 3 n
+捍卫者 8 n
+捍御 3 v
+捍拒 3 v
+捍格不入 3 v
+捍然 3 v
+捍疆卫国 3 n
+捍见 3 v
+捎 709 v
+捎信 17 v
+捎信儿 3 z
+捎关打节 3 v
+捎去 3 v
+捎带 75 v
+捎带脚儿 2 d
+捎来 3 v
+捎脚 3 v
+捎话 3 v
+捎马子 3 v
+捏 1687 v
+捏一把汗 23 l
+捏一捏 3 v
+捏了一把汗 16 l
+捏住 3 v
+捏作 3 v
+捏合 14 v
+捏合机 3 l
+捏告 3 v
+捏咕 3 v
+捏坏 3 v
+捏弄 3 v
+捏怪排科 3 l
+捏成 3 v
+捏手捏脚 2 l
+捏把冷汗 3 l
+捏把汗 3 l
+捏控 3 v
+捏揉 3 i
+捏握 3 v
+捏握着 3 y
+捏死 3 v
+捏着鼻子 3 l
+捏碎 3 v
+捏积 3 v
+捏称 3 v
+捏紧 3 v
+捏练 3 v
+捏脚捏手 3 l
+捏腔拿调 3 l
+捏词 3 v
+捏起 3 v
+捏造 167 v
+捏造事实 3 l
+捏造出 3 l
+捏造罪名 3 l
+捏造者 3 l
+捏闸 3 v
+捐 1008 v
+捐书 3 v
+捐入 3 v
+捐出 3 v
+捐助 119 v
+捐助人 5 v
+捐助国 3 v
+捐助款 4 v
+捐助点 2 v
+捐助者 5 n
+捐募 3 v
+捐华务实 3 n
+捐建 9 v
+捐弃 12 v
+捐弃前嫌 9 l
+捐忿弃瑕 3 n
+捐本逐末 3 n
+捐款 483 v
+捐款人 6 n
+捐款捐物 3 n
+捐款箱 3 n
+捐款者 4 n
+捐残去杀 3 l
+捐物 29 n
+捐献 257 v
+捐献箱 3 n
+捐献者 27 n
+捐税 47 v
+捐精 3 v
+捐纳 3 v
+捐给 39 v
+捐血 3 v
+捐血人 3 n
+捐血车 3 n
+捐衣 3 v
+捐资 111 v
+捐资助学 5 l
+捐资助教 3 n
+捐赠 383 v
+捐赠人 4 n
+捐赠电话 3 n
+捐赠者 12 n
+捐身徇义 3 vn
+捐躯 39 n
+捐躯报国 3 nz
+捐躯殉国 3 l
+捐躯赴难 3 nr
+捐钱 5 v
+捐钱箱 3 n
+捒 4 zg
+捕 2111 v
+捕俘 7 v
+捕头 7 v
+捕役 4 v
+捕得 3 v
+捕快 107 v
+捕房 15 n
+捕手 12 v
+捕拿 13 v
+捕捉 581 v
+捕捉到 3 i
+捕捉带 3 i
+捕捞 781 v
+捕捞业 10 n
+捕捞到 3 i
+捕杀 157 v
+捕液器 3 n
+捕猎 65 v
+捕获 296 v
+捕获蛋白 3 i
+捕获量 277 n
+捕虏体 2 nz
+捕虫 3 n
+捕虫叶 3 n
+捕蝇器 3 nz
+捕蝇纸 3 nz
+捕蝇草 5 nz
+捕风 3 v
+捕风弄月 3 i
+捕风捉影 71 i
+捕食 626 v
+捕食者 3 n
+捕鱼 613 v
+捕鱼业 25 n
+捕鱼器 3 n
+捕鱼机 3 n
+捕鱼船 3 n
+捕鱼量 16 n
+捕鲸 73 n
+捕鲸母船 3 n
+捕鲸船 9 n
+捕鳕鱼船 3 nz
+捕鼠 14 n
+捕鼠器 3 n
+捞 970 v
+捞一把 41 l
+捞一票 3 l
+捞什子 2 l
+捞出 3 v
+捞刀河 4 ns
+捞去 3 v
+捞取 35 v
+捞回 23 v
+捞外快 3 l
+捞摸 3 v
+捞月 3 v
+捞月亮 3 l
+捞本 3 ns
+捞油水 5 l
+捞着 3 v
+捞稻草 2 l
+捞获 3 v
+捞虾 3 n
+捞起 3 v
+捞起来 3 l
+捞钱 48 v
+捞锚钩 3 v
+捞饭 7 v
+捞鱼 3 v
+损 1020 n
+损上益下 3 v
+损之又损 3 i
+损亏额 3 i
+损人 3 n
+损人不利 3 i
+损人不利己 2 i
+损人利己 29 i
+损人利已 3 i
+损人害己 3 i
+损人益己 3 i
+损人肥己 3 i
+损伤 1251 v
+损公肥私 6 n
+损兵折将 42 i
+损军折将 3 i
+损友 3 n
+损坏 587 v
+损坏率 3 n
+损失 3510 n
+损失估计 3 n
+损失惨重 3 i
+损失率 18 n
+损失费 16 v
+损失赔偿 3 n
+损失量 4 n
+损失险 3 n
+损害 1957 v
+损害赔偿 3 n
+损己利人 3 n
+损本逐末 3 n
+损毁 103 v
+损灭 3 v
+损益 121 n
+损益相抵 3 n
+损益表 5 n
+损耗 440 n
+损耗模量 3 n
+损耗率 3 n
+损耗费 3 n
+损耗量 3 n
+损血 3 v
+捡 1136 v
+捡了个 3 l
+捡了芝麻 3 z
+捡便宜 9 l
+捡去 3 v
+捡取 3 v
+捡回 3 v
+捡回去 3 l
+捡回来 3 l
+捡开 3 v
+捡拾 46 v
+捡来 3 v
+捡洋落儿 3 l
+捡漏 2 v
+捡球 3 v
+捡球员 3 v
+捡破烂 12 l
+捡破烂儿 3 l
+捡起 3 v
+捡起来 3 l
+捡过 3 v
+捡过去 3 l
+捡过来 3 l
+捡钱 3 v
+换 6483 nz
+换上 576 v
+换上去 3 v
+换上来 3 v
+换下 187 v
+换下去 3 v
+换下来 3 c
+换个儿 3 n
+换为 3 c
+换乘 83 nz
+换交 3 v
+换亲 3 v
+换人 167 nrt
+换代 22 v
+换代产品 3 nz
+换件 3 nz
+换伞 3 nz
+换位 102 v
+换借 3 v
+换停 3 v
+换入 3 v
+换关 3 v
+换兵 3 nz
+换出 7 v
+换出去 3 v
+换到 3 v
+换割 3 v
+换包 3 nz
+换卡 6 nrt
+换厂 3 n
+换去 3 v
+换发 26 nz
+换取 393 v
+换口 3 vn
+换口味 3 nz
+换口气 3 nz
+换句 3 n
+换句话 3 c
+换句话说 335 c
+换台 2 v
+换吊 3 v
+换名 3 v
+换向 18 v
+换向器 3 nz
+换向阀 3 nz
+换吸 3 v
+换唱 3 v
+换喻 3 v
+换回 3 v
+换回去 3 n
+换回来 3 n
+换图 3 nz
+换土 3 nz
+换场 3 n
+换型 3 nz
+换填 3 v
+换壳 3 nz
+换头 7 v
+换姓 3 n
+换季 34 n
+换学 3 nz
+换守 3 v
+换尿布 3 nz
+换届 384 v
+换届会 2 nz
+换届选举 3 nz
+换屋 3 nz
+换岗 37 v
+换工 12 nz
+换帖 3 n
+换幅 3 n
+换张 3 v
+换心 4 v
+换心手术 3 n
+换成 391 v
+换房 9 nz
+换手 19 v
+换手率 20 nz
+换扣 3 nz
+换批 3 v
+换抄 3 v
+换报 3 nz
+换披 3 v
+换抱 3 v
+换拍 3 v
+换挡 3 v
+换换 75 v
+换换气 3 nz
+换掉 3 v
+换排 3 v
+换接 3 v
+换摘 3 v
+换支 3 nz
+换收 3 v
+换教 3 nz
+换文 43 nz
+换斗移星 3 nz
+换料 6 nz
+换新 3 nz
+换新装 3 nz
+换新颜 3 nrt
+换日偷天 3 z
+换景 3 n
+换有 3 v
+换服 3 v
+换机 6 nz
+换来 334 v
+换来换去 3 n
+换板 3 nz
+换枝 3 n
+换枪 3 nz
+换样 3 v
+换格 3 nrt
+换档 3 v
+换歌 3 nz
+换步 3 v
+换毛 9 nrt
+换气 64 nz
+换气扇 4 n
+换气机 3 nz
+换水 3 nz
+换汇 15 nz
+换汤 3 nz
+换汤不换药 21 n
+换油 3 nz
+换法 3 nz
+换洗 42 v
+换派 3 nz
+换流 3 v
+换流器 3 nz
+换流站 5 nz
+换满 3 v
+换灯 3 nz
+换炒 3 v
+换点 3 n
+换热 10 v
+换热器 32 nz
+换热站 3 nz
+换牙 2 nz
+换班 59 nz
+换球 3 nz
+换用 3 v
+换田 3 nz
+换皮 3 nz
+换盆机 3 n
+换碟 3 n
+换租 3 v
+换称 3 v
+换笔 3 v
+换签 3 v
+换算 128 v
+换算器 3 n
+换算表 3 n
+换管 3 c
+换箱 3 nz
+换系 3 v
+换约 3 v
+换纸 3 nz
+换组 3 vn
+换织 3 v
+换编 3 v
+换羽 3 nrt
+换羽移宫 3 n
+换肤 3 n
+换肩 3 nz
+换肾 3 v
+换肾手术 3 n
+换胎 3 nz
+换能器 57 nz
+换脑筋 4 nz
+换航 3 v
+换节 3 vn
+换茬 2 v
+换药 42 nz
+换血 14 v
+换行 32 v
+换行符 14 nz
+换衣 3 nz
+换衣服 3 nz
+换衣间 3 n
+换补 3 v
+换装 241 v
+换装备 3 n
+换角 3 nz
+换言之 128 c
+换证 3 v
+换请 3 v
+换读 3 v
+换调 3 v
+换货 3 nz
+换购 3 v
+换起 3 v
+换车 20 v
+换车票 3 n
+换边 3 nrt
+换过 3 c
+换过去 3 v
+换过来 3 v
+换选 3 v
+换速 3 nz
+换部 3 nz
+换钓 3 v
+换钞 3 n
+换钞机 3 n
+换钱 10 v
+换队 3 nz
+换防 43 v
+换零钱 3 v
+换靶 3 v
+换鞋 3 nz
+换页 3 n
+换项 3 nz
+换飞 3 nz
+换马 31 nz
+换马甲 3 nz
+换骑 3 n
+换骨夺胎 3 n
+换骨脱胎 3 nz
+捣 1222 v
+捣乱 279 v
+捣乱份子 3 n
+捣乱分子 3 n
+捣毁 263 v
+捣烂 3 v
+捣碎 33 v
+捣米 7 n
+捣腾 16 v
+捣药 10 v
+捣蒜 14 n
+捣虚撇抗 3 n
+捣蛋 77 v
+捣蛋鬼 5 n
+捣衣 4 v
+捣鬼 117 v
+捣鼓 19 v
+捧 2920 v
+捧上去 3 l
+捧上天 2 l
+捧上来 3 l
+捧住 3 v
+捧养 3 v
+捧出去 3 l
+捧出来 3 l
+捧吻 3 v
+捧哏 4 v
+捧场 64 v
+捧头鼠窜 3 v
+捧得 83 v
+捧心 3 v
+捧心西子 3 l
+捧成 3 v
+捧杀 3 v
+捧杯 55 v
+捧毂推轮 3 nz
+捧腹 30 v
+捧腹大笑 28 l
+捧茶 3 v
+捧角 3 v
+捧读 3 v
+捧起 3 v
+捨 2 zg
+捩 5 g
+捩手覆羹 3 n
+捭阖 7 i
+捭阖纵横 3 nz
+据 19409 p
+据为己有 73 i
+据义履方 3 i
+据云 3 v
+据介绍 3 n
+据传 110 v
+据传说 3 n
+据估计 3 n
+据图刎首 3 v
+据守 105 v
+据实 70 d
+据实以报 3 i
+据实相告 3 i
+据库 5 n
+据悉 1523 v
+据我所知 3 i
+据查 3 v
+据此 1012 d
+据测定 3 n
+据点 240 d
+据理 14 v
+据理力争 48 n
+据称 298 v
+据统计 3 v
+据说 2890 v
+据调查 3 v
+据载 3 v
+据闻 3 n
+据险固守 3 n
+据鞍读书 3 n
+据预测 3 i
+据高临下 3 i
+捯线 3 vn
+捰袖揎拳 3 v
+捱 163 zg
+捱三顶五 3 nr
+捱三顶四 3 ns
+捱上 3 z
+捱了 3 y
+捱了过去 3 v
+捱了过来 3 v
+捱到 3 vn
+捱打 3 vn
+捱着 3 y
+捱肩擦背 3 n
+捱苦 3 z
+捱过 3 vq
+捱过去 3 v
+捱过来 3 v
+捱近 3 vn
+捱风缉缝 3 n
+捱饿 3 v
+捵面 3 z
+捶 550 v
+捶击 6 v
+捶平 3 v
+捶床拍枕 3 i
+捶床捣枕 3 i
+捶打 50 v
+捶背 25 v
+捶胸 3 v
+捶胸跌脚 3 z
+捶胸跌足 3 z
+捶胸顿脚 3 i
+捶胸顿足 49 i
+捶腿 3 v
+捶骨沥髓 3 i
+捶鼓 3 v
+捷 741 ns
+捷书 3 nz
+捷克 702 ns
+捷克共和国 16 ns
+捷克政府 5 nt
+捷克斯洛 3 ns
+捷克斯洛伐克 301 ns
+捷克斯洛伐克共和国 10 ns
+捷克语 34 nz
+捷克队 5 nz
+捷利 60 ns
+捷安特 3 ns
+捷尔任斯基 5 nr
+捷尔吉 2 ns
+捷径 200 n
+捷报 109 nz
+捷报频传 27 nz
+捷线 3 nz
+捷联 4 ns
+捷足 35 ns
+捷足先得 3 i
+捷足先登 29 i
+捷达 16 nz
+捷达王 3 nz
+捷达车 3 ns
+捷运 5 nz
+捷运局 3 nz
+捷运系统 3 nz
+捷通 2 nz
+捷速 3 nz
+捺 178 v
+捺印 3 i
+捻 602 zg
+捻乱 3 n
+捻军 100 n
+捻匪 3 n
+捻土为香 3 n
+捻土焚香 3 z
+捻子 35 n
+捻度 3 n
+捻指 3 n
+捻指之间 3 n
+捻指间 3 n
+捻捻转儿 3 n
+捻接 3 v
+捻搓 3 v
+捻断 3 v
+捻灭 3 v
+捻熄 2 n
+捻碎 6 v
+捻神捻鬼 3 n
+捻线 3 n
+捻线机 3 n
+捻花微笑 3 n
+捻起 3 v
+捻转 3 v
+捻转补泻 3 n
+捻针 3 n
+捻须 3 n
+捻鼻 3 n
+捽 43 zg
+掀 532 v
+掀乱 3 v
+掀了开来 3 i
+掀住 3 v
+掀倒 3 v
+掀出 3 v
+掀出去 3 v
+掀出来 3 v
+掀到 3 v
+掀动 48 v
+掀天 3 v
+掀天动地 3 i
+掀天揭地 3 i
+掀天斡地 3 z
+掀帘子 3 i
+掀底 3 v
+掀开 591 v
+掀拳裸袖 3 i
+掀掉 16 v
+掀翻 109 v
+掀腾 2 v
+掀被 3 v
+掀起 1187 v
+掀雷决电 3 i
+掀风播浪 3 i
+掀风鼓浪 3 i
+掂 224 v
+掂出 3 v
+掂掇 2 v
+掂斤估两 3 nr
+掂斤抹两 3 i
+掂斤拨两 3 i
+掂斤播两 3 i
+掂梢折本 3 v
+掂琢 3 v
+掂算 3 v
+掂量 81 v
+掂量掂量 10 v
+掆 2 zg
+掇 100 g
+掇刀区 256 z
+掇山五法 3 nz
+掇拾章句 3 n
+掇臀捧屁 3 nr
+掇菁撷华 3 z
+掇青拾紫 3 nr
+授 2848 vg
+授与 85 v
+授业 22 v
+授业解惑 3 v
+授之父母 3 n
+授乳 2 v
+授予 3254 v
+授予权 27 n
+授予点 5 i
+授人以柄 17 i
+授人以渔 3 i
+授人口实 3 i
+授人话柄 3 i
+授以 3 v
+授以全权 3 i
+授信 15 v
+授信额度 3 n
+授勋 6 n
+授勋仪式 3 nr
+授勋典礼 3 nz
+授卡 3 v
+授受 50 v
+授受不亲 2 i
+授命 15 v
+授命组阁 3 n
+授奖 36 v
+授奖仪式 3 n
+授奖典礼 3 nz
+授徒 37 n
+授意 136 v
+授戒 3 v
+授手援溺 3 n
+授旗 3 n
+授旗仪式 3 n
+授旗典礼 3 nz
+授时 29 b
+授权 2785 v
+授权书 16 n
+授权人 22 n
+授权代表 3 nz
+授权点 20 n
+授权证 3 n
+授权量 6 n
+授枪 3 v
+授柄于人 3 nrfg
+授牌 12 v
+授理 3 v
+授田 3 v
+授粉 77 v
+授精 16 v
+授给 3 v
+授职 56 v
+授职唯贤 3 i
+授艺 13 v
+授衔 6 v
+授记 3 v
+授课 230 v
+授阶 3 n
+授阶仪式 3 n
+授阶典礼 3 n
+授首 11 v
+掉 8344 zg
+掉三寸舌 3 i
+掉下去 3 v
+掉下来 3 v
+掉书袋 4 i
+掉以轻心 90 i
+掉价 18 v
+掉价儿 3 l
+掉入 3 v
+掉包 11 v
+掉头 248 v
+掉头发 3 i
+掉头就走 3 i
+掉头就跑 3 i
+掉头鼠窜 3 i
+掉宝率 3 i
+掉岗 3 v
+掉拉来 3 l
+掉换 34 v
+掉掉 3 v
+掉来掉去 3 l
+掉枪花 4 i
+掉格 3 v
+掉泪 41 v
+掉渣饼 3 v
+掉牙 3 v
+掉电 3 v
+掉皮 3 v
+掉秤 3 v
+掉线 3 v
+掉膘 3 v
+掉臂不顾 3 i
+掉臂而去 3 i
+掉舌鼓唇 3 i
+掉色 4 v
+掉落 102 v
+掉落在 3 i
+掉血 3 v
+掉话率 3 l
+掉货 3 v
+掉转 117 v
+掉转头 3 i
+掉转身 3 i
+掉过头去 3 i
+掉过头来 3 i
+掉进去 3 v
+掉进来 3 v
+掉队 51 v
+掉魂 3 v
+掊 6 g
+掊斗折衡 3 v
+掋 37 zg
+掌 8714 v
+掌一剑 3 nr
+掌一扬 5 nr
+掌一掌 10 nr
+掌一立 3 nr
+掌三公 2 nr
+掌上 268 v
+掌上明珠 9 nr
+掌上电脑 3 n
+掌上观文 3 nr
+掌上观纹 3 n
+掌上通 3 nr
+掌与明 2 nr
+掌中 157 v
+掌中含 2 nr
+掌中宝 3 nr
+掌中戏 3 n
+掌中玉 2 nr
+掌中珠 9 nr
+掌之仇 4 nr
+掌之力 15 nr
+掌事太监 5 n
+掌令官 3 n
+掌作剑 2 nr
+掌作礼 3 nr
+掌信通 3 nr
+掌修夏 3 nr
+掌其金 2 nr
+掌军国 3 nr
+掌击 3 v
+掌击法 2 n
+掌刑政 2 nr
+掌力一 10 nr
+掌力中 3 nr
+掌力之 5 nr
+掌力伤 3 n
+掌力似 3 nr
+掌力再 3 nr
+掌力击 13 nr
+掌力刚 4 nr
+掌力化 7 n
+掌力发 3 nr
+掌力吐 3 nr
+掌力含 2 nr
+掌力均 2 nr
+掌力如 3 nr
+掌力实 3 nr
+掌力引 4 nr
+掌力挥 2 nr
+掌力推 3 nr
+掌力撞 5 nr
+掌力未 2 nr
+掌力来 2 nr
+掌力沉 3 nr
+掌力消 2 nr
+掌力渐 2 nr
+掌力猛 2 nr
+掌力甚 5 nr
+掌力甩 2 nr
+掌力疾 5 nr
+掌力直 4 nr
+掌力相 3 nr
+掌力罩 2 n
+掌力道 10 n
+掌力震 37 nr
+掌力齐 2 nr
+掌加劲 4 nr
+掌劲力 9 nr
+掌劲道 2 nr
+掌势 3 n
+掌势奇 2 nr
+掌勺 9 nr
+掌勺儿 3 nr
+掌印 212 v
+掌厨 3 v
+掌发劲 2 nr
+掌可莫 2 nr
+掌叶大黄 3 nr
+掌叶木 2 nr
+掌商网 3 n
+掌嘴 11 v
+掌声 536 n
+掌声不绝 3 i
+掌声如雷 3 i
+掌声雷动 12 i
+掌夏州 2 nr
+掌套铃 2 nr
+掌子 3 n
+掌子面 25 n
+掌宿卫 4 nr
+掌开碑 4 nr
+掌录奏 2 nr
+掌微扬 2 nr
+掌心 380 v
+掌心雷 3 nr
+掌恒山 2 nr
+掌承 3 v
+掌持 3 v
+掌持着 3 n
+掌掌力 9 nr
+掌掌发 2 nr
+掌掌缘 3 nr
+掌控 169 j
+掌握 5342 v
+掌握业务 3 n
+掌握主动 3 n
+掌握住 3 nr
+掌握分寸 3 n
+掌握外语 3 n
+掌握情况 3 n
+掌握本领 3 n
+掌握权力 3 n
+掌握者 5 n
+掌政 3 n
+掌政者 3 n
+掌故 112 n
+掌教 3 n
+掌教真 2 nr
+掌教真人 4 n
+掌斗然 3 nr
+掌旗 3 n
+掌旗官 5 nr
+掌昭阳 4 nr
+掌朝天 2 nr
+掌本府 2 n
+掌权 145 n
+掌权人 2 n
+掌权者 12 n
+掌柜 394 n
+掌柜的 205 n
+掌棒长老 2 nr
+掌棒龙头 23 n
+掌治释 2 nr
+掌法 450 n
+掌渐生 2 nr
+掌火王 2 nr
+掌灯 62 n
+掌灶 3 n
+掌牧官 15 n
+掌状 3 n
+掌状脉 3 n
+掌猛力 4 nr
+掌玄冥 3 nr
+掌王之 2 nr
+掌王命 2 nr
+掌班 11 v
+掌理 3 v
+掌理御 2 nr
+掌瓦赤 2 nr
+掌相合 2 nr
+掌相抗 2 nr
+掌相格 2 nr
+掌相迎 6 nr
+掌真力 2 nr
+掌禁卫 2 nr
+掌禁旅 3 j
+掌竟会 2 nr
+掌管 1078 v
+掌纹 9 n
+掌纹家 3 n
+掌综理 3 n
+掌缘击 3 v
+掌缘如 2 v
+掌缘正 2 nr
+掌自右 2 nr
+掌舵 53 v
+掌舵人 2 n
+掌舵者 3 n
+掌苏秦 3 nr
+掌虚晃 4 nr
+掌诏敕 5 nr
+掌财 3 v
+掌财币 2 n
+掌财赋 2 nr
+掌越斗 2 nr
+掌运劲 3 nr
+掌邦政 2 nr
+掌邦教 2 nr
+掌邦治 2 nr
+掌邦礼 2 nr
+掌邦禁 2 nr
+掌钵龙头 11 nr
+掌铨选 2 nr
+掌门 918 n
+掌门人 755 n
+掌门宋 2 nr
+掌门岳 10 nr
+掌门师 5 n
+掌院学士 6 n
+掌震开 2 nr
+掌震得 2 nr
+掌非正 2 nr
+掌鞭 3 v
+掌风中 2 nr
+掌风发 2 nr
+掌风虎 2 nr
+掌风袭 6 nr
+掌骨 18 n
+掌齐施 10 nr
+掍 144 zg
+掎 3 i
+掎挈伺诈 3 vn
+掎裳连襼 3 z
+掎角之势 12 i
+掏 845 zg
+掏出 1243 v
+掏到 3 v
+掏尽 3 v
+掏底 3 v
+掏心 3 v
+掏心战 3 v
+掏摸 3 v
+掏枪 3 v
+掏槽 3 v
+掏洞 3 v
+掏空 64 v
+掏粪 3 v
+掏给 3 v
+掏耳朵 3 q
+掏腰包 78 v
+掏蚀 3 v
+掏钱 146 v
+掐 465 v
+掐住 3 v
+掐到 3 v
+掐喉咙 3 n
+掐头去尾 6 i
+掐尖儿 3 i
+掐指 3 v
+掐指一算 3 i
+掐掉 3 v
+掐断 23 v
+掐架 3 v
+掐死 49 v
+掐灭 3 v
+掐着 3 v
+掐算 36 v
+掐紧 3 v
+掐花 3 v
+掐表 3 v
+掑 169 zg
+排 3852 v
+排上 3 v
+排上去 3 v
+排上来 3 v
+排下 3 v
+排下去 3 v
+排下来 3 v
+排中律 28 n
+排他性 36 n
+排位 67 n
+排位赛 9 n
+排便 73 v
+排便训练 3 n
+排偶 5 n
+排入 83 v
+排出 617 v
+排出去 3 v
+排出来 3 v
+排击 3 v
+排列 2737 v
+排列三 3 i
+排列五 3 n
+排列图标 3 n
+排列成 3 v
+排列系数 3 n
+排列组合 3 n
+排到 3 v
+排华 7 nz
+排华人士 3 n
+排协 3 v
+排印 64 v
+排卵 118 v
+排卵日 3 t
+排卵期 13 n
+排去 3 v
+排叉儿 3 n
+排号 3 n
+排名 2256 v
+排名分 3 n
+排名榜 8 n
+排名第 3 i
+排名表 3 n
+排名赛 3 n
+排名顺序 3 l
+排围而入 3 l
+排土场 5 n
+排在 3 v
+排场 148 n
+排坛 7 n
+排外 204 v
+排外主义 7 n
+排头 15 v
+排头儿 3 n
+排头兵 26 n
+排好 3 v
+排子 2 n
+排子车 2 n
+排字 31 n
+排字管 3 vn
+排定 58 v
+排尾 3 v
+排尿 154 v
+排尿作用 3 n
+排尿功能 3 n
+排山倒海 84 i
+排山压卵 3 n
+排布 34 v
+排平 3 n
+排序 229 n
+排序功能 3 v
+排序程序 3 n
+排座 3 v
+排座位 3 n
+排座次 3 n
+排开 66 v
+排异 26 n
+排律 21 n
+排得 3 v
+排忧 3 v
+排忧解难 65 i
+排患解纷 3 i
+排戏 14 v
+排成 285 v
+排成一列 3 l
+排成行 3 v
+排房 2 n
+排打 3 v
+排挡 4 v
+排挤 388 v
+排挤掉 3 i
+排换 3 v
+排掉 3 v
+排排 3 v
+排排坐 3 i
+排排站 3 n
+排排长 3 v
+排放 455 v
+排放口 3 n
+排放物 7 n
+排放系统 3 n
+排放罐 3 nz
+排放量 51 n
+排散 3 v
+排料 10 n
+排斥 642 v
+排斥力 11 n
+排斥异己 48 i
+排斥性 3 n
+排替压力 3 nz
+排来排去 3 l
+排枪 11 n
+排架 9 v
+排查 42 vn
+排档 4 v
+排档杆 3 v
+排检 3 v
+排椅 6 n
+排毒 99 v
+排毒仪 3 nz
+排比 59 v
+排比句 3 n
+排气 105 n
+排气口 3 n
+排气扇 3 n
+排气管 6 n
+排气装置 3 n
+排气量 2 n
+排气阀 5 l
+排气阀门 3 vn
+排氮 3 nz
+排水 740 v
+排水口 2 n
+排水器 3 n
+排水工程 3 n
+排水板 3 n
+排水槽 3 n
+排水沟 35 n
+排水泵 3 n
+排水渠 6 n
+排水立管 3 n
+排水管 23 n
+排水管道 3 n
+排水系统 3 l
+排水费 2 n
+排水量 570 n
+排水闸 4 n
+排水阀 3 n
+排汗 3 v
+排汗作用 3 l
+排汗功能 3 n
+排污 86 v
+排污口 3 n
+排污权 3 n
+排污沟 3 n
+排污泵 3 n
+排污管 3 n
+排污者 2 n
+排污费 18 n
+排污阀 3 n
+排沙 11 n
+排沙简金 3 i
+排沙见金 3 n
+排泄 244 v
+排泄器官 3 n
+排泄物 95 n
+排泄系统 3 n
+排泄量 13 n
+排法 3 n
+排洪 14 v
+排浪 4 nz
+排涝 48 v
+排湾 3 n
+排湾族 3 nz
+排满 3 v
+排演 97 v
+排演场 3 n
+排灌 290 v
+排灌站 14 n
+排灰 3 n
+排炮 14 n
+排点 3 n
+排烟 12 v
+排烟口 3 n
+排烟竖井 3 i
+排烟系统 3 l
+排烟道 2 n
+排爆 5 v
+排版 62 v
+排版系统 3 n
+排牙 3 v
+排犹主义 4 l
+排班 26 v
+排球 213 n
+排球场 8 n
+排球比赛 3 nz
+排球网 3 nz
+排球赛 10 vn
+排球队 13 n
+排着 3 v
+排碱 4 n
+排碱渠 6 nz
+排空 42 n
+排笔 5 v
+排筏 2 n
+排箫 17 v
+排粪 3 n
+排粪作用 3 n
+排粪功能 3 n
+排糠障风 3 nz
+排线 3 n
+排练 272 vn
+排练厅 5 n
+排练场 4 n
+排给 3 v
+排联 4 nz
+排萧 3 i
+排行 215 v
+排行榜 225 n
+排行表 2 n
+排表 3 v
+排解 68 v
+排解纠纷 3 z
+排设 3 vn
+排课 3 v
+排走 3 v
+排起 3 v
+排起来 3 v
+排趋性 3 n
+排距 3 v
+排送 3 v
+排遣 64 v
+排酸 9 n
+排量 39 n
+排量车 3 n
+排错 5 v
+排长 632 v
+排长队 3 n
+排长龙 3 nz
+排队 673 n
+排队机 3 n
+排队模型 3 n
+排队进程 3 n
+排阵 7 v
+排阻层析 3 n
+排阻限 3 n
+排除 1313 v
+排除万难 22 i
+排除干挠 3 i
+排除异己 35 i
+排除故障 3 n
+排除法 27 n
+排除阻力 3 nz
+排除障碍 3 n
+排险 6 n
+排难解忧 3 i
+排难解纷 13 i
+排雷 33 v
+排风 7 n
+排风扇 2 n
+排风量 3 n
+排驱 3 v
+排骨 33 n
+排骨汤 5 nz
+排骨面 3 n
+排骨饭 3 n
+排鼓 3 v
+排齐 3 v
+掓 196 zg
+掔 116 zg
+掕 78 zg
+掖 282 v
+掖县 13 ns
+掖进 3 ns
+掗 73 zg
+掘 1325 v
+掘井 3 v
+掘井及泉 3 n
+掘出 3 v
+掘出来 3 v
+掘去 3 v
+掘取 24 v
+掘土 3 v
+掘土机 4 n
+掘坑 3 v
+掘墓 29 v
+掘墓人 20 n
+掘室求鼠 3 n
+掘开 48 v
+掘起 3 v
+掘起来 3 v
+掘进 73 v
+掘进机 5 n
+掘金 62 n
+掘金队 3 n
+掛 2 zg
+掞 97 zg
+掞藻飞声 3 nr
+掠 1197 v
+掠人之美 2 i
+掠入射 3 v
+掠去 3 v
+掠取 80 v
+掠地攻城 3 i
+掠地飞行 3 i
+掠夺 672 v
+掠夺式 17 n
+掠夺性 40 n
+掠夺者 3 n
+掠影 29 v
+掠影浮光 3 n
+掠杀 3 v
+掠美 4 v
+掠美市恩 3 n
+掠视 3 v
+掠走 147 v
+掠过 629 v
+掠面速度 3 n
+採 19 zg
+探 2390 v
+探丧 3 v
+探丸借客 3 i
+探井 11 n
+探亲 218 n
+探亲假 3 nr
+探亲流 3 nr
+探亲访友 13 n
+探伤 26 v
+探伤仪 3 nr
+探伤机 3 n
+探信 3 v
+探入 3 v
+探出 3 v
+探出去 3 v
+探出来 3 v
+探勘 3 v
+探勘者 3 n
+探友 2 n
+探取 3 v
+探口气 3 n
+探口而出 3 i
+探口风 4 nr
+探听 265 v
+探听出 3 v
+探听到 3 v
+探听者 3 n
+探听虚实 3 i
+探员 3 n
+探囊取物 27 i
+探囊胠箧 3 i
+探头 384 v
+探头探脑 69 i
+探头缩脑 3 i
+探奇 3 nr
+探子 127 n
+探家 10 n
+探察 40 v
+探寻 138 v
+探寻出 3 i
+探幽索隐 3 nr
+探幽访胜 3 nr
+探底 13 v
+探悉 3 v
+探戈 33 nr
+探戈舞 9 nr
+探探 3 v
+探摸 3 v
+探明 1246 v
+探明储量 3 n
+探春 438 nr
+探望 270 v
+探望病人 3 n
+探本穷源 3 n
+探杆 6 n
+探来探去 3 i
+探析 2 vn
+探查 85 vn
+探案 5 n
+探案集 3 n
+探求 125 v
+探求民隐 3 i
+探求真理 3 i
+探汤蹈火 3 i
+探测 1222 v
+探测仪 18 n
+探测仪器 24 n
+探测器 383 n
+探测狗 3 n
+探测系统 3 n
+探测船 4 n
+探测车 2 n
+探源 16 n
+探源溯流 3 i
+探溯 3 v
+探照 3 v
+探照灯 186 nr
+探病 32 v
+探监 32 nr
+探看 3 v
+探知 115 v
+探矿 44 n
+探矿权 3 n
+探矿者 3 n
+探秘 24 nr
+探究 313 vn
+探究出 3 n
+探究性 3 n
+探究行为 3 n
+探空 13 n
+探空仪 16 n
+探空火箭 33 n
+探竿影草 3 i
+探索 2653 v
+探索之旅 3 nr
+探索性 21 nr
+探索期 3 nr
+探索者 18 nr
+探索频道 3 nr
+探网 3 v
+探胜 3 v
+探花 549 n
+探花郎 3 nr
+探获 3 v
+探见 3 v
+探观止矣 3 i
+探视 160 v
+探视权 3 n
+探视病人 3 n
+探讨 1368 v
+探讨问题 3 n
+探访 128 v
+探试 3 vn
+探询 60 vn
+探询出 3 n
+探谎器 3 n
+探赜索隐 3 nr
+探赜钩深 3 v
+探起 3 v
+探路 88 n
+探路者 5 n
+探身 3 v
+探身一看 3 i
+探过 3 v
+探针 64 n
+探长 8 v
+探问 69 v
+探险 432 n
+探险家 159 n
+探险网 3 n
+探险者 76 n
+探险队 123 n
+探险队员 3 n
+探雷 6 nr
+探雷器 526 nr
+探风 3 nr
+探马 98 v
+探骊得珠 2 nr
+探鱼仪 2 nr
+掣 468 v
+掣后腿 3 v
+掣电 3 v
+掣肘 110 v
+掣襟露肘 3 v
+掤 4 zg
+接 10515 v
+接三连四 3 i
+接上 273 v
+接上去 3 v
+接上头 11 v
+接上来 3 v
+接下 81 v
+接下去 3 v
+接下来 1010 l
+接下页 3 n
+接二连三 151 nz
+接交 3 v
+接亲 2 v
+接人待物 3 l
+接任 374 v
+接住 3 v
+接入 281 v
+接入服务器 4 l
+接入点 4 n
+接入网 30 nz
+接关 3 v
+接到 1490 v
+接力 197 v
+接力棒 15 i
+接力比赛 3 nz
+接力赛 17 n
+接力赛跑 5 l
+接力跑 12 l
+接办 27 v
+接单 3 c
+接去 3 v
+接发 11 v
+接发球 37 n
+接取 9 v
+接受 10415 v
+接受下来 3 l
+接受任务 3 n
+接受命令 3 n
+接受器 9 l
+接受国 12 n
+接受度 6 l
+接受批评 3 l
+接受投资者 5 n
+接受挑选 3 v
+接受方 9 n
+接受程度 2 n
+接受考验 3 n
+接受者 27 n
+接受语音 2 n
+接口 814 v
+接口函数 5 l
+接口分析 3 l
+接口协议 2 i
+接口卡 4 n
+接口号 2 n
+接口处 3 i
+接口定义 2 l
+接口打开 3 i
+接口技术 8 n
+接口方式 3 l
+接口板 2 n
+接口标准 4 n
+接口界面 3 l
+接口盖 3 v
+接口相连 2 i
+接口类 3 n
+接口类型 4 n
+接口隔离 2 i
+接合 85 v
+接合上 3 l
+接合后体 3 l
+接合因子 3 l
+接合处 3 l
+接合复制 3 l
+接合孢子 3 nz
+接合点 3 n
+接合管 3 n
+接合菌 3 l
+接合起来 3 l
+接合部 22 n
+接合面 3 n
+接听 189 v
+接听电话 3 l
+接吻 87 v
+接吻戏 3 n
+接吻时 3 n
+接吻鱼 3 n
+接唱 3 v
+接嘴 3 v
+接器 3 n
+接回 3 v
+接回去 3 l
+接回来 3 l
+接在 3 v
+接地 170 v
+接地垫 3 n
+接地平面 3 l
+接地系统 3 l
+接地线 6 j
+接地装置 3 n
+接境 3 n
+接壤 332 v
+接壤处 7 i
+接处警 3 j
+接头 121 v
+接头儿 3 l
+接头处 7 l
+接头接耳 3 i
+接头盒 3 n
+接好 3 v
+接字 41 v
+接完 3 v
+接客 44 v
+接应 777 v
+接引 74 v
+接弹 3 v
+接往 3 v
+接征 3 v
+接待 2300 v
+接待厅 3 n
+接待员 6 l
+接待国 2 n
+接待处 20 l
+接待客人 3 l
+接待室 23 n
+接待工作 3 l
+接待户 29 l
+接待所 3 n
+接待方 2 n
+接待日 262 l
+接待点 5 n
+接待社 6 l
+接待站 7 l
+接待组 4 n
+接待费 10 n
+接待量 33 l
+接得 3 v
+接手 124 v
+接报 12 v
+接拍 2 v
+接招 3 v
+接掌 38 v
+接接 3 v
+接接看 3 c
+接插 3 v
+接插件 3 l
+接援 3 v
+接收 1083 v
+接收单位 3 l
+接收器 32 n
+接收国 3 n
+接收数据 2 n
+接收机 147 n
+接收灵敏度 2 l
+接收点 3 n
+接收牢房 3 n
+接收站 56 n
+接收端 5 n
+接收缓冲区 2 i
+接收者 17 n
+接旨 3 v
+接时 4 c
+接显示器 4 l
+接替 475 v
+接有 3 v
+接木 3 v
+接木法 3 l
+接机 17 n
+接杀 3 v
+接来 3 v
+接来接去 3 l
+接枝 3 n
+接案 3 v
+接棒 3 n
+接棒人 3 n
+接植 3 v
+接榫 3 v
+接气 2 v
+接水 3 v
+接法 3 v
+接活 3 v
+接洽 49 v
+接洽人 3 n
+接济 141 n
+接满 3 v
+接演 3 v
+接火 3 v
+接点 26 n
+接片 3 n
+接片机 3 nz
+接物 5 n
+接物镜 3 n
+接班 62 v
+接班人 252 n
+接球 59 n
+接球员 3 n
+接球法 3 n
+接生 92 v
+接生员 3 n
+接生婆 14 n
+接生术 3 l
+接生费 3 v
+接电 3 v
+接电源 2 l
+接电话 8 l
+接界 3 n
+接盘 13 v
+接着 6206 c
+接着就是 3 l
+接短儿 3 l
+接神 3 v
+接种 225 v
+接种员 3 l
+接种物 3 l
+接种率 14 l
+接穗 19 v
+接站 10 n
+接管 541 c
+接管人 3 l
+接纳 455 v
+接纳位点 3 n
+接线 33 n
+接线员 37 n
+接线图 3 n
+接线板 3 n
+接线柱 3 n
+接线片 3 n
+接线生 3 n
+接线盒 3 n
+接线箱 3 n
+接给 3 v
+接续 90 v
+接续而来 3 l
+接续词 3 i
+接续香烟 3 nz
+接缝 17 v
+接缝处 5 v
+接羔 8 v
+接腔 3 v
+接芽 3 v
+接茬 11 v
+接茬儿 4 n
+接获 23 v
+接袂成帷 3 i
+接见 780 v
+接触 3348 v
+接触不良 4 i
+接触传染 3 i
+接触力 3 i
+接触区 3 n
+接触压力 3 i
+接触器 4 nz
+接触因子 3 i
+接触定理 3 i
+接触导向 3 n
+接触应力 3 i
+接触式 27 b
+接触性 24 b
+接触抑制 3 nz
+接触法 3 i
+接触点 3 i
+接触电势 3 n
+接触眼镜 3 i
+接触网 6 nz
+接触胶结 3 i
+接触蛋白 3 l
+接触角 3 i
+接触面 59 i
+接警 2 v
+接设备 2 n
+接访 2 v
+接诊 38 v
+接话 3 v
+接谈 3 v
+接财神 3 i
+接货 4 v
+接走 3 v
+接起 3 v
+接踵 55 v
+接踵比肩 3 i
+接踵而来 227 i
+接踵而至 100 i
+接车 3 v
+接轨 272 v
+接转 4 v
+接过 1850 c
+接迎 3 v
+接运 16 v
+接近 3498 v
+接近区段 3 n
+接近原则 3 n
+接近成年 3 l
+接进 3 v
+接进来 3 l
+接连 1089 v
+接连不断 352 l
+接连起来 3 l
+接送 145 v
+接送车 2 n
+接通 209 v
+接通提示 3 n
+接通率 3 n
+接邻 3 v
+接防 3 v
+接防部队 3 n
+接面 3 c
+接风 114 v
+接风洗尘 9 l
+接风酒 11 l
+接驳 6 v
+接驳端子 3 n
+接驾 108 v
+接骨 60 v
+接骨师 3 n
+接骨木 11 n
+接龙 5 nz
+控 1085 v
+控件 7 n
+控制 11537 v
+控制不了 3 l
+控制中心 19 l
+控制代码 2 n
+控制传输 3 l
+控制元件 3 n
+控制关系 10 l
+控制力 64 n
+控制区 37 n
+控制协议 2 nz
+控制卡 3 n
+控制参数 2 n
+控制变 4 v
+控制变量 3 l
+控制台 51 v
+控制器 156 n
+控制器发送 2 n
+控制器接收 2 l
+控制器驱动 4 l
+控制塔 4 n
+控制字符 6 n
+控制室 27 n
+控制屏 2 n
+控制工程 21 n
+控制应用程序 2 n
+控制性 6 n
+控制情绪 3 n
+控制感情 3 n
+控制技术 57 n
+控制指令 3 n
+控制措施 3 n
+控制数字 2 n
+控制数据 15 n
+控制机 5 n
+控制权 139 n
+控制杆 3 n
+控制板 6 n
+控制柜 3 n
+控制棒 17 n
+控制法 15 n
+控制流 3 n
+控制点 31 n
+控制率 5 n
+控制电路 3 n
+控制目标 3 n
+控制程序 8 n
+控制站 37 n
+控制符 3 v
+控制策略 7 n
+控制算法 2 n
+控制箱 3 n
+控制精度 7 n
+控制系统 600 l
+控制线 109 n
+控制组 3 vn
+控制结构 7 n
+控制者 20 n
+控制联想 3 n
+控制能力 7 n
+控制裕如 3 l
+控制规模 3 l
+控制论 137 v
+控制车 9 n
+控制软件 19 l
+控制部件 3 n
+控制键 3 n
+控制阀 5 n
+控制面板 10 n
+控制顶点 3 n
+控制额 7 n
+控办 3 v
+控名责实 3 n
+控告 414 v
+控告人 5 n
+控告信 2 n
+控告权 5 n
+控告申诉 3 n
+控拆 3 v
+控方 15 n
+控江路 3 nz
+控油 3 v
+控活 3 vn
+控温 15 v
+控温器 3 n
+控球 123 n
+控球技术 3 n
+控申 3 v
+控监 3 n
+控盘 12 v
+控管 20 v
+控系统 4 n
+控罪 3 v
+控股 821 v
+控股公司 3 n
+控股方 3 nz
+控股权 30 n
+控股集团 3 nz
+控计算机 2 n
+控诉 297 v
+控诉书 4 n
+控诉会 3 n
+控诉状 3 n
+控词 3 v
+控购 3 v
+控辩 3 v
+控释 2 v
+推 6324 v
+推三推四 3 i
+推三阻四 43 i
+推上 148 v
+推上去 3 v
+推上来 3 v
+推下 3 v
+推下去 3 v
+推下来 3 v
+推不开 3 v
+推东主西 3 n
+推为 3 v
+推举 549 v
+推事 3 v
+推亡固存 3 n
+推人 3 n
+推人犯规 3 i
+推介 188 v
+推介会 33 n
+推优 3 v
+推估 2 v
+推使 3 v
+推倒 217 v
+推倒重来 3 i
+推入 69 v
+推入契合 3 n
+推出 4028 v
+推刨 3 n
+推到 3 v
+推力 427 v
+推力器 2 n
+推力球 3 n
+推动 4715 v
+推动力 116 n
+推动器 3 n
+推动型 10 n
+推动者 35 n
+推升 8 v
+推却 53 v
+推卸 167 v
+推卸责任 3 n
+推压 3 v
+推及 3 v
+推后 17 v
+推向 897 v
+推向市场 3 n
+推回 7 v
+推回去 3 i
+推回来 3 l
+推土 58 v
+推土机 74 n
+推天抢地 3 i
+推头 3 v
+推委 18 n
+推委会 2 n
+推子 3 n
+推宕 3 v
+推宗明本 3 i
+推定 131 v
+推定出来 3 i
+推导 125 v
+推射 37 v
+推尊 3 v
+推展 11 v
+推展性 3 n
+推峰 3 n
+推崇 379 v
+推崇备至 16 i
+推己及人 10 i
+推己及物 3 i
+推已及人 3 i
+推干就湿 3 l
+推平 7 v
+推广 2801 v
+推广会 10 nz
+推广先进 3 i
+推广员 2 n
+推广应用 3 i
+推广性 3 nz
+推广种子 3 l
+推广站 5 nz
+推广部 8 nz
+推度 3 n
+推延 13 v
+推开 1264 v
+推得 3 v
+推心置腹 84 i
+推恩 29 v
+推想 174 v
+推想出 3 v
+推想到 3 v
+推戴 58 v
+推手 51 v
+推打 5 v
+推托 135 v
+推托之词 3 i
+推拉 14 v
+推拉窗 2 n
+推拉门 5 n
+推拏 3 vn
+推拒 12 v
+推拖 3 v
+推拿 524 v
+推拿学 3 n
+推拿法 3 nz
+推挡 6 v
+推挤 19 v
+推挽 3 i
+推掉 3 v
+推推 3 v
+推推拉拉 3 nz
+推推揉揉 3 i
+推推搡搡 14 v
+推搡 57 v
+推搪 31 v
+推放 3 v
+推故 3 v
+推敲 165 v
+推斥 3 v
+推斥力 3 i
+推断 450 v
+推断出 3 i
+推断力 3 n
+推服 3 v
+推本溯源 4 l
+推杆 10 n
+推来 3 v
+推来推去 3 i
+推板 3 n
+推枯折腐 3 i
+推梨让枣 3 n
+推毂 3 n
+推求 23 v
+推油 3 v
+推波助澜 106 i
+推注 2 v
+推注法 3 i
+推派 3 v
+推派出 3 i
+推测 600 v
+推测储量 3 n
+推涛作浪 3 i
+推演 382 v
+推演出来 3 l
+推燥居湿 3 nz
+推牌九 3 n
+推理 614 v
+推理则 2 n
+推理小说 3 l
+推理性 3 n
+推理方法 7 n
+推理机 9 n
+推理模型 3 n
+推理片 3 n
+推理结点 3 n
+推理题 3 n
+推病 3 v
+推着 3 v
+推知 34 v
+推磨 52 v
+推移 248 v
+推究 26 vn
+推算 487 v
+推算出 3 v
+推算出来 3 v
+推给 3 v
+推翻 1726 v
+推而广之 16 i
+推聋作哑 3 i
+推聋妆哑 3 i
+推背图 3 i
+推脱 38 v
+推舟于陆 3 n
+推荐 3823 v
+推荐书 3 n
+推荐人 26 n
+推荐信 16 n
+推荐值 3 n
+推荐共享 3 n
+推荐函 3 n
+推荐奖 5 n
+推荐性 6 n
+推荐者 13 n
+推荐表 17 n
+推行 1921 v
+推行者 7 n
+推衍 3 v
+推襟送抱 3 i
+推见 3 v
+推让 74 v
+推许 3 v
+推论 200 v
+推论性 3 n
+推论起来 3 l
+推诚 3 v
+推诚布公 3 i
+推诚待物 3 i
+推诚接物 3 i
+推诚相与 3 i
+推诚相见 3 i
+推诚置腹 3 i
+推说 85 v
+推请 3 v
+推诿 82 v
+推诿的人 3 nz
+推谢 3 v
+推贤让能 3 l
+推贤进善 3 i
+推贤进士 3 i
+推走 3 v
+推起 3 v
+推车 58 v
+推车人 3 n
+推车者 3 n
+推轮捧毂 3 i
+推辞 369 v
+推过 3 v
+推过去 3 v
+推过来 3 v
+推进 4932 v
+推进剂 101 n
+推进力 3 n
+推进器 125 n
+推进改革 3 l
+推进机 3 n
+推进物 3 n
+推进者 3 n
+推进舱 3 n
+推进设备 3 n
+推迟 484 v
+推迟势 3 n
+推迟时间 3 l
+推送 1070 v
+推选 270 v
+推重 3 v
+推重比 30 i
+推铅球 3 n
+推销 438 v
+推销产品 3 n
+推销员 91 n
+推销商 4 n
+推销性 3 n
+推销术 3 n
+推门 3 v
+推门而入 3 i
+推问 3 v
+推陈出新 74 i
+推陈致新 3 i
+推食解衣 3 n
+掩 1589 v
+掩上 3 v
+掩不住 3 v
+掩人耳目 47 i
+掩住 3 v
+掩体 115 n
+掩其不备 3 i
+掩其无备 3 i
+掩卷 22 v
+掩口失声 3 i
+掩口而笑 2 i
+掩口胡卢 3 n
+掩口葫芦 3 i
+掩埋 212 v
+掩埋场 3 n
+掩恶扬善 3 i
+掩恶扬美 3 i
+掩恶溢美 3 l
+掩护 772 v
+掩护物 3 n
+掩护着 3 l
+掩旗息鼓 3 i
+掩映 168 v
+掩映生姿 3 i
+掩映着 3 i
+掩杀 3 v
+掩模 3 n
+掩模对准 3 v
+掩没 3 v
+掩理 3 v
+掩瑕藏疾 3 nr
+掩盖 589 v
+掩盖住 3 i
+掩盖物 3 n
+掩盖真相 3 i
+掩盖着 3 l
+掩目捕雀 3 n
+掩眼捕雀 3 n
+掩眼法 3 i
+掩码 2 n
+掩罪饰非 3 i
+掩耳 3 v
+掩耳偷铃 3 i
+掩耳盗钟 3 i
+掩耳盗铃 18 i
+掩耳而走 3 i
+掩膜 2 n
+掩蔽 71 v
+掩蔽体 7 n
+掩蔽扩散 3 n
+掩蔽指数 3 i
+掩蔽物 2 n
+掩蔽部 10 n
+掩藏 51 v
+掩藏不住 3 i
+掩藏着 3 v
+掩袭 3 v
+掩贤护善 3 l
+掩过扬善 3 i
+掩过饰非 3 i
+掩门 14 v
+掩门而去 3 i
+掩闭 3 v
+掩面 3 n
+掩面失色 3 i
+掩面而泣 7 i
+掩面而过 3 i
+掩饰 574 v
+掩骼埋胔 3 n
+掩鼻 15 v
+掩鼻偷香 3 i
+掩鼻而过 2 i
+措 209 n
+措办 3 n
+措勤 4 n
+措勤县 2 n
+措大 4 n
+措心积虑 3 i
+措意 3 n
+措手 3 n
+措手不及 259 i
+措施 8163 n
+措施不力 3 i
+措款 3 n
+措置 176 n
+措置失当 3 i
+措置得当 3 i
+措置裕如 3 i
+措美 3 n
+措美县 2 ns
+措词 86 n
+措词不当 3 i
+措词严厉 3 i
+措辞 183 n
+措辞不当 3 i
+掬 94 v
+掬水 3 nr
+掬诚 3 nr
+掭 7 v
+掮 53 n
+掮客 14 n
+掯 7 zg
+掰 270 v
+掰开 75 v
+掰掰 2 v
+掰断 3 v
+掰腕子 3 v
+掳 462 vg
+掳夺 3 v
+掳掠 202 v
+掳获 3 v
+掳走 21 v
+掴 29 v
+掴耳光 3 z
+掷 2336 v
+掷交 3 v
+掷地有声 23 i
+掷地赋声 3 i
+掷地金声 3 i
+掷弹 3 n
+掷弹筒 26 n
+掷杖成龙 3 v
+掷果潘安 3 z
+掷果潘郎 3 q
+掷标枪 3 n
+掷棒 3 n
+掷瓶 3 n
+掷盏 3 n
+掷远 3 v
+掷铁球 3 n
+掷铁饼 9 n
+掷骰子 3 v
+掷鼠忌器 3 i
+掸 190 v
+掸子 6 n
+掸帚 4 n
+掸邦 18 ns
+掺 209 zg
+掺假 45 v
+掺入 76 v
+掺合 3 v
+掺合料 3 l
+掺和 79 v
+掺杂 97 v
+掺杂使假 8 l
+掺杂剂 3 n
+掺杂晶体 3 n
+掺水 20 v
+掺沙子 3 n
+掺混 9 v
+掺进 3 v
+掼 121 zg
+掼纱帽 3 n
+掼跤 3 vn
+掾 104 g
+揄 18 g
+揆 54 zg
+揆情审势 3 ns
+揆情度理 3 vn
+揆文奋武 3 nz
+揆时度势 3 v
+揆理度势 3 v
+揆理度情 3 vn
+揉 1011 v
+揉作 3 v
+揉合 15 v
+揉成 3 v
+揉成一团 3 v
+揉捏 3 v
+揉揉看 3 v
+揉搓 85 v
+揉擦 3 v
+揉杂 3 v
+揉眵抹泪 3 v
+揉碎 3 v
+揉面 3 v
+揌 8 zg
+揍 226 v
+揎 25 v
+揎拳拢袖 3 v
+揎拳捋袖 3 i
+揎拳捰袖 3 i
+揎拳掳袖 3 v
+揎拳攞袖 3 i
+揎拳舞袖 3 i
+揎拳裸手 3 i
+揎拳裸臂 3 i
+揎拳裸袖 3 i
+揎腕攘臂 3 nr
+描 391 v
+描一描 3 v
+描上 3 v
+描写 1546 v
+描写出 3 v
+描写出来 3 v
+描写画角 3 n
+描出 3 v
+描出来 3 v
+描划 3 v
+描到 3 v
+描叙 8 v
+描图 3 v
+描图员 3 n
+描图纸 3 n
+描地 3 v
+描头画角 3 i
+描好 3 v
+描字 3 v
+描成 3 v
+描抹 3 v
+描描 3 v
+描摹 52 v
+描来描去 3 i
+描涂 3 v
+描淡写 3 i
+描画 52 v
+描眉 14 v
+描眉画眼 6 i
+描着 3 v
+描神画鬼 3 i
+描红 5 v
+描线 3 v
+描绘 1180 v
+描绘下来 3 i
+描绘出 3 i
+描绘出来 3 i
+描绘成 3 i
+描花 3 v
+描记装置 3 n
+描起 3 v
+描起来 3 v
+描述 2288 v
+描述性 25 n
+描述符 58 n
+描述统计 3 n
+描述语言 3 n
+描金 67 n
+描龙绣凤 3 i
+提 10223 v
+提上 3 v
+提上去 3 v
+提上来 3 v
+提下 3 v
+提下去 3 v
+提下来 3 v
+提不 3 v
+提不出 3 v
+提不到 3 v
+提不起 3 v
+提不起来 3 v
+提个醒 33 v
+提交 924 v
+提交单元 3 n
+提交者 3 n
+提亲 54 v
+提价 103 v
+提任 3 v
+提供 16799 v
+提供商 217 n
+提供情报 3 n
+提供援助 3 n
+提供支援 3 n
+提供数据 12 n
+提供方便 3 l
+提供线索 3 n
+提供者 18 n
+提倡 1254 v
+提倡者 13 n
+提克里特 2 nrt
+提兜 7 n
+提出 22139 v
+提出异议 3 v
+提出批评 3 n
+提出抗议 3 i
+提出申请 3 n
+提出诉讼 3 l
+提刑官 3 n
+提到 2552 v
+提制 3 v
+提前 2191 v
+提前准备 3 v
+提前完成 3 i
+提前竣工 3 vn
+提前结束 3 i
+提前退休 3 i
+提前量 11 n
+提包 263 v
+提升 2510 v
+提升机 24 n
+提升间 3 n
+提单 34 v
+提去 3 v
+提及 520 v
+提取 851 v
+提取液 3 n
+提取物 50 n
+提取策略 3 n
+提取罐 3 n
+提名 2957 v
+提名奖 9 n
+提名权 2 n
+提名者 3 n
+提名道姓 3 i
+提向 3 v
+提喻 3 v
+提回 3 v
+提回去 3 i
+提回来 3 l
+提在 3 v
+提在手上 3 i
+提壶 7 n
+提头 3 v
+提奖 3 v
+提好 3 v
+提婚 3 v
+提子 4 n
+提存 2 v
+提审 166 v
+提审犯人 3 n
+提干 56 v
+提得 3 v
+提心 3 v
+提心吊胆 186 i
+提意见 3 v
+提成 173 v
+提成费 3 v
+提手 30 v
+提手旁 3 n
+提报 3 v
+提押 3 v
+提拉 34 v
+提拔 760 v
+提拔任用 3 i
+提拔干部 3 n
+提拨 3 v
+提拿 3 v
+提拿着 3 l
+提挈 9 v
+提捞 3 v
+提掖 3 v
+提提 3 v
+提提神 3 n
+提插 3 v
+提插补泻 3 l
+提携 221 v
+提摩西 5 ns
+提早 198 v
+提早到 3 l
+提早去 3 i
+提早来 3 l
+提条件 3 n
+提来 3 v
+提来提去 3 i
+提枪 3 v
+提格雷 7 nrt
+提案 523 v
+提案人 3 n
+提档线 3 b
+提桶 6 v
+提梁 7 v
+提款 18 v
+提款单 3 n
+提款卡 3 n
+提款机 10 n
+提款权 24 n
+提水 42 v
+提法 141 v
+提洛岛 4 nrt
+提溜 3 v
+提灌 3 v
+提灯 29 v
+提灯会 3 n
+提点 3 v
+提炼 311 v
+提炼出 3 i
+提炼厂 5 n
+提物机 3 n
+提环 3 vn
+提现 16 v
+提琴 46 v
+提琴家 3 n
+提琴手 3 n
+提申 3 v
+提留 38 v
+提留款 3 n
+提盒 5 n
+提着 3 v
+提督 474 vn
+提督署 3 n
+提示 989 v
+提示信息 3 n
+提示卡 7 n
+提示性 69 n
+提示条 3 n
+提示框 3 n
+提示法 3 n
+提示牌 2 n
+提示符 27 n
+提示行 3 n
+提示音 3 n
+提神 88 v
+提神醒脑 3 l
+提租 3 v
+提笔 139 v
+提笔忘字 3 i
+提箱 4 n
+提篮 40 v
+提篮桥 5 n
+提级 3 v
+提纯 125 v
+提纯复壮 3 i
+提纲 195 v
+提纲举领 3 n
+提纲挈领 30 i
+提纲振领 3 n
+提线木偶 6 n
+提练 3 v
+提给 3 v
+提职 3 v
+提职提薪 3 i
+提腕 3 v
+提花 80 v
+提花布 3 n
+提花机 3 n
+提薪 3 v
+提袋 3 n
+提要 83 v
+提要钩玄 3 n
+提议 1748 v
+提议者 3 n
+提讯 3 v
+提论 3 v
+提诉 3 v
+提词 2 v
+提请 976 v
+提请逮捕 3 vn
+提调 55 v
+提货 23 v
+提货人 2 n
+提货单 4 n
+提资 3 v
+提走 3 v
+提起 1647 v
+提起公诉 3 v
+提起抗诉 3 i
+提起过 3 v
+提足 3 v
+提辖 113 v
+提辖官 3 n
+提辞 3 v
+提过 3 v
+提过去 3 v
+提过来 3 v
+提进 3 v
+提进去 3 v
+提进来 3 v
+提退 3 v
+提送 3 v
+提送到 3 l
+提选 3 v
+提速 68 v
+提醒 2601 v
+提醒器 3 n
+提醒您 3 l
+提醒无力 3 l
+提醒物 3 l
+提钻 3 v
+提问 1500 v
+提问者 5 n
+提防 625 v
+提鞋 3 v
+提领 3 v
+提香 21 v
+提高 16882 v
+提高产量 3 n
+提高效率 3 n
+提高效益 3 n
+提高班 8 n
+提高素质 3 n
+提高自学 3 n
+提高觉悟 3 nrt
+提高警惕 3 v
+提高认识 3 v
+提高质量 3 n
+插 3939 v
+插一杠子 3 v
+插一脚 3 i
+插上去 3 v
+插上来 3 v
+插下 3 v
+插下去 3 v
+插下来 3 v
+插于 3 v
+插件 104 n
+插件包 3 n
+插件接口 6 n
+插件机 7 n
+插住 3 v
+插值 56 n
+插值偶 3 n
+插值性质 3 n
+插值法 11 n
+插值逼近 3 l
+插入 650 v
+插入序列 3 l
+插入式 3 n
+插入损耗 3 n
+插入排序 3 l
+插入方式 3 l
+插入方法 3 n
+插入法 3 n
+插入物 3 n
+插入者 3 n
+插入蛋白 3 l
+插入记号 3 n
+插入语 7 i
+插入鞘中 3 n
+插刀 10 n
+插切销 3 i
+插到 3 v
+插卡 10 n
+插卡式 3 n
+插去 3 v
+插叙 8 v
+插口 263 n
+插句 3 n
+插嘴 243 v
+插嚅 3 v
+插回 3 v
+插回去 3 i
+插回来 3 l
+插图 292 v
+插图卷 3 nz
+插图本 3 n
+插图者 3 n
+插圈弄套 3 l
+插头 27 n
+插头线 3 n
+插孔 3 n
+插字 3 n
+插屏 17 n
+插床 3 n
+插座 56 n
+插式 2 n
+插录 3 v
+插手 295 v
+插拔 7 n
+插接 3 v
+插播 14 vn
+插曲 129 n
+插条 13 n
+插板 6 n
+插枝 3 n
+插枝法 3 n
+插架 27 n
+插架万轴 3 nz
+插标 3 n
+插栓 3 n
+插槽 43 n
+插槽数 3 n
+插槽数量 2 n
+插班 3 v
+插班生 9 n
+插画 4 n
+插科使砌 3 l
+插科打诨 29 i
+插秧 34 v
+插秧机 3 n
+插空 3 n
+插管 38 n
+插紧 3 v
+插翅 3 v
+插翅难逃 11 i
+插翅难飞 16 i
+插脚 9 n
+插腰 3 v
+插花 43 n
+插苗 3 n
+插补器 3 l
+插袋 3 n
+插言 52 n
+插话 180 n
+插起 3 v
+插起来 3 v
+插足 39 v
+插足于 3 v
+插身 3 v
+插进 3 v
+插进去 3 v
+插进来 3 v
+插针 9 n
+插铅 3 nz
+插销 9 v
+插错 3 v
+插队 109 n
+插队知青 3 n
+插队落户 8 n
+插页 180 n
+插齿刀 2 n
+插齿机 2 n
+揖 777 vg
+揖别 3 v
+揖拜 3 v
+揖盗开门 3 v
+揖让 10 v
+揖谢 3 v
+換 7 zg
+揝 14 zg
+揞 4 zg
+揠 2 i
+揠苗助长 9 i
+握 2268 v
+握下 3 v
+握下去 3 v
+握云拿雾 3 i
+握住 716 v
+握别 8 v
+握力 3 nz
+握力器 3 nz
+握发吐哺 3 i
+握取 3 v
+握图临宇 3 nz
+握手 381 v
+握手礼 3 nz
+握手言和 33 i
+握手言欢 3 i
+握手道别 3 i
+握把 41 nz
+握拳 45 nz
+握拳透掌 3 i
+握拳透爪 3 i
+握持 3 v
+握有 154 v
+握权 3 v
+握法 3 v
+握炭流汤 3 nz
+握瑜怀玉 3 i
+握笔 3 v
+握笔法 3 nz
+握粟出卜 3 n
+握素怀铅 3 nz
+握素披黄 3 i
+握紧 78 v
+握紧拳头 3 i
+握纲提领 3 i
+握股公司 3 n
+握蛇骑虎 3 i
+握钩伸铁 3 n
+握雨携云 3 i
+握雾拏云 3 nz
+握雾拿云 3 nz
+握风捕影 3 n
+揣 534 v
+揣合逢迎 3 vn
+揣奸把猾 3 i
+揣度 32 v
+揣情 3 v
+揣情度理 3 v
+揣想 3 v
+揣手儿 3 v
+揣摩 208 v
+揣摸 33 v
+揣时度力 3 v
+揣测 75 v
+揣测之词 3 v
+揣琢 3 v
+揣着 3 v
+揣量 3 v
+揣骨听声 3 v
+揩 484 v
+揩净 3 v
+揩去 3 v
+揩布 3 v
+揩手 3 v
+揩抹 12 v
+揩拭 20 v
+揩汗 3 v
+揩油 5 v
+揩泪 3 v
+揩洗 3 v
+揩除 3 v
+揪 1357 v
+揪人心肺 2 i
+揪住 3 v
+揪出 24 v
+揪出去 3 v
+揪出来 3 v
+揪心 69 a
+揪打 3 v
+揪扯 3 v
+揪捏 3 a
+揪斗 46 v
+揪痧 3 v
+揪起来 3 v
+揪辫子 2 v
+揭 1083 zg
+揭下 3 v
+揭不开锅 15 l
+揭丑 3 v
+揭东 3 ns
+揭东县 3 ns
+揭人隐私 3 i
+揭出 3 v
+揭去 3 v
+揭发 428 v
+揭发出 3 i
+揭地掀天 3 z
+揭家丑 2 nr
+揭密 3 v
+揭封 3 v
+揭帖 114 v
+揭幕 129 v
+揭幕仪式 3 n
+揭幕典礼 3 n
+揭幕式 3 n
+揭幕战 12 n
+揭底 6 v
+揭开 974 v
+揭开序幕 3 v
+揭扬 3 v
+揭批 101 v
+揭护法 2 n
+揭换 3 v
+揭掉 3 v
+揭明 3 v
+揭晓 212 v
+揭榜 10 v
+揭牌 16 v
+揭疮疤 3 n
+揭盖 3 v
+揭盖子 3 n
+揭短 8 v
+揭破 71 v
+揭碑 3 n
+揭示 1015 v
+揭示板 3 n
+揭示者 3 n
+揭秘 54 v
+揭穿 118 v
+揭竿 3 n
+揭竿而起 34 i
+揭竿起义 3 i
+揭箧担囊 3 n
+揭箧探囊 3 nr
+揭老底 2 l
+揭西 6 ns
+揭西县 3 ns
+揭起 3 v
+揭锅 3 v
+揭阳 41 ns
+揭阳县 5 ns
+揭阳市 4 ns
+揭露 1408 v
+揭露出 3 i
+揯 2 zg
+揲 13 g
+揳 3 zg
+援 1032 vn
+援交 3 vn
+援例 4 n
+援兵 187 vn
+援军 252 n
+援助 1566 vn
+援助交际 3 n
+援助团 2 n
+援助国 51 n
+援助者 3 n
+援古刺今 3 n
+援古证今 3 n
+援外 24 vn
+援建 43 v
+援引 256 vn
+援手 114 v
+援护 3 vn
+援敌 3 vn
+援救 96 v
+援救者 3 n
+援救队 3 n
+援款 5 n
+援用 25 vn
+援疑质理 3 n
+援笔 3 n
+援笔成章 3 n
+援笔立成 3 n
+援藏 19 v
+援鳖失龟 3 n
+揵 42 zg
+揶揄 58 v
+揸 8 zg
+揹包袱 3 n
+揹负 3 vn
+揽 552 v
+揽住 3 v
+揽入 3 v
+揽名责实 3 nz
+揽头 3 v
+揽客 19 v
+揽工 75 v
+揽权 3 v
+揽权怙势 3 v
+揽权纳贿 3 i
+揽活 9 v
+揽笔 3 v
+揽紧 3 v
+揽胜 12 v
+揽货 3 v
+揽辔中原 3 vn
+揽辔澄清 3 z
+揽辔登车 3 nt
+揾 6 zg
+揾工 3 vn
+揾钱 3 vn
+揿 93 zg
+揿下 3 vn
+揿住 3 vn
+揿扭 3 z
+揿钮 3 nr
+搀 370 zg
+搀住 3 v
+搀假 3 v
+搀兑 3 v
+搀前落后 3 v
+搀和 17 v
+搀扶 321 v
+搀扶着 3 y
+搀杂 9 v
+搀杂在 3 v
+搀杂着 3 v
+搀水 3 v
+搀行夺市 3 vn
+搀起 3 v
+搁 947 v
+搁下 3 v
+搁下来 3 v
+搁不下 3 v
+搁不住 3 v
+搁延 3 v
+搁开 3 v
+搁得住 3 v
+搁放 3 v
+搁板 16 nz
+搁架 3 v
+搁浅 107 v
+搁班 3 v
+搁着 3 v
+搁着不动 3 v
+搁着不管 3 v
+搁笔 23 v
+搁置 139 v
+搁起 3 v
+搁起来 3 v
+搂 1318 v
+搂住 3 v
+搂入 3 v
+搂抱 128 v
+搂搂 3 v
+搂搂抱抱 3 nr
+搂梯 3 n
+搂草机 3 n
+搂钱 3 v
+搅 859 v
+搅乱 95 v
+搅乱器 3 n
+搅乳器 3 n
+搅动 70 v
+搅匀 3 v
+搅合 3 v
+搅和 68 v
+搅嘴 3 v
+搅好 3 v
+搅局 27 n
+搅弄 3 v
+搅打 3 v
+搅扰 47 v
+搅拌 423 v
+搅拌器 10 n
+搅拌机 10 n
+搅拌棒 3 n
+搅拌站 3 n
+搅拌罐 3 n
+搅拌车 3 n
+搅浑 11 n
+搅海翻江 3 n
+搅混 13 v
+搅炒 3 v
+搅碎 3 v
+搅种 3 v
+搅缠 3 v
+搅过 3 v
+搅过去 3 v
+搅过来 3 v
+搅闹 3 v
+搅面 3 n
+搅鬼 3 v
+搅黄 12 v
+搆不着 3 v
+搆怨 3 v
+搆陷 3 vn
+搇 6 zg
+搊 2 zg
+搋 3 v
+搌布 3 vn
+搏 463 v
+搏击 115 v
+搏击操 3 vn
+搏动 63 v
+搏客 3 v
+搏弈 3 v
+搏彩 3 v
+搏战 3 v
+搏手 3 v
+搏手无策 3 vn
+搏斗 672 vn
+搏杀 65 v
+搏杀弄汞 3 nz
+搏浪 9 v
+搏缝版 3 v
+搐 14 g
+搐动 3 v
+搐搦 4 v
+搐缩 3 v
+搓 645 v
+搓到 3 v
+搓弄 3 v
+搓成 3 v
+搓手 3 v
+搓手顿脚 3 i
+搓手顿足 3 i
+搓招 3 v
+搓揉 3 i
+搓板 4 n
+搓洗 28 v
+搓澡 9 v
+搓澡工 3 nz
+搓绳机 3 n
+搓脚 3 v
+搓衣 3 n
+搓衣板 3 n
+搓过 3 v
+搓过去 3 v
+搓过来 3 v
+搓麻 4 n
+搔 323 v
+搔到痒处 3 z
+搔头 103 v
+搔头弄姿 3 i
+搔头抓耳 3 v
+搔头摸耳 3 i
+搔头皮 3 i
+搔手 3 v
+搔扰 3 v
+搔痒 39 v
+搔痒症 3 v
+搔着痒处 3 z
+搔耳捶背 3 i
+搔首 9 v
+搔首弄姿 16 i
+搔首踟蹰 3 v
+搕 2 zg
+搛 18 v
+搜 2131 zg
+搜仪网 3 n
+搜出 3 v
+搜刮 158 v
+搜到 3 v
+搜剿 13 v
+搜奇抉怪 3 z
+搜奇猎艳 3 i
+搜奇访古 3 nz
+搜察 3 v
+搜寻 334 v
+搜寻器 3 i
+搜岩采干 3 i
+搜房帮 3 nz
+搜房网 3 nz
+搜才网 3 i
+搜扬侧陋 3 i
+搜括 44 v
+搜括一空 3 nz
+搜捕 356 v
+搜捕到 3 n
+搜捕网 3 n
+搜掠 2 v
+搜摸 3 v
+搜救 48 v
+搜新网 3 nz
+搜易得 3 nz
+搜查 361 vn
+搜查线 3 nz
+搜查证 3 nz
+搜根剔齿 3 i
+搜根问底 3 i
+搜检 41 v
+搜求 38 v
+搜狐 4777 nz
+搜狐公司 47 n
+搜狐网 3 i
+搜狐网站 3 n
+搜狗 1044 nz
+搜章摘句 3 i
+搜索 2369 v
+搜索前进 3 nz
+搜索器 3 nz
+搜索引擎 204 n
+搜索损失 3 n
+搜索枯肠 4 i
+搜索算法 3 n
+搜索网 3 nz
+搜索肾胃 3 n
+搜索词 3 i
+搜索通 3 nz
+搜索队 3 nz
+搜缴 3 v
+搜罗 115 nz
+搜肠刮肚 18 i
+搜肠润吻 3 n
+搜购 3 v
+搜身 21 v
+搜集 692 v
+搜集情报 3 nz
+搜集整理 3 n
+搜集自 3 nz
+搜集详尽 3 z
+搞 8414 v
+搞上去 3 v
+搞不到 3 v
+搞不好 3 v
+搞不定 3 v
+搞不懂 3 l
+搞不搞 3 v
+搞不清 3 l
+搞不清楚 3 l
+搞乱 70 v
+搞了个 3 n
+搞了半天 3 l
+搞出 3 v
+搞反 3 v
+搞坏 3 v
+搞垮 39 v
+搞头 8 v
+搞好 751 v
+搞好关系 3 l
+搞好团结 3 l
+搞好学习 3 n
+搞好工作 3 l
+搞妥 3 a
+搞完 3 v
+搞定 162 v
+搞对象 3 l
+搞小动作 3 l
+搞差 3 v
+搞平衡 4 v
+搞快 3 v
+搞怪 3 v
+搞懂 3 v
+搞成 3 v
+搞把戏 3 l
+搞掂 3 v
+搞掉 3 v
+搞搞 21 v
+搞杂 3 a
+搞来 3 v
+搞来搞去 3 z
+搞活 135 v
+搞活企业 3 l
+搞活市场 3 l
+搞活流通 3 l
+搞活经济 3 l
+搞混 3 v
+搞清 76 v
+搞清楚 3 l
+搞的定 3 l
+搞破坏 3 v
+搞砸 3 l
+搞笑 1152 v
+搞笑图 3 l
+搞笑片 3 l
+搞笑版 3 v
+搞笑类 3 l
+搞笑网 3 v
+搞糊涂 3 v
+搞糟 3 n
+搞脏 3 a
+搞臭 14 v
+搞起 35 v
+搞过去 3 v
+搞过来 3 l
+搞进去 3 v
+搞进来 3 v
+搞通 3 v
+搞钱 3 v
+搞错 3 v
+搞鬼 15 v
+搠 231 v
+搠笔巡街 3 nr
+搡 65 v
+搢绅 3 nz
+搣 3 zg
+搤臂啮指 3 vn
+搥 14 zg
+搦 137 g
+搦朽磨钝 3 i
+搦管恣肆 3 i
+搧 111 zg
+搧动 3 vn
+搧开 3 v
+搧耳光 3 nz
+搧风 3 vn
+搨 6 zg
+搨本 3 vn
+搨碑 3 v
+搪 49 n
+搪塑 2 n
+搪塞 100 v
+搪帐 3 n
+搪瓷 104 n
+搪瓷制品 3 n
+搪瓷厂 3 n
+搪缸 3 n
+搫 14 zg
+搬 2869 v
+搬上去 3 v
+搬上大 3 v
+搬上来 3 v
+搬下 3 v
+搬下去 3 v
+搬下来 3 v
+搬东西 3 n
+搬书本 3 n
+搬入 46 v
+搬兵 11 v
+搬出 259 v
+搬出去 3 v
+搬出来 3 v
+搬到 3 v
+搬动 55 v
+搬口弄舌 3 i
+搬唇弄舌 3 i
+搬唇递舌 3 n
+搬回 3 v
+搬回去 3 l
+搬回来 3 l
+搬家 242 v
+搬开 3 v
+搬弄 15 v
+搬弄是非 18 i
+搬得 3 v
+搬成 3 v
+搬掉 3 v
+搬救兵 3 i
+搬教条 3 l
+搬斤播两 3 i
+搬来 3 v
+搬来搬去 3 i
+搬用 3 v
+搬石砸脚 3 l
+搬砖砸脚 3 l
+搬离 14 v
+搬移 14 v
+搬移到 3 l
+搬给 3 v
+搬走 115 v
+搬起 3 v
+搬起来 3 v
+搬迁 275 v
+搬迁户 7 n
+搬运 375 v
+搬运员 3 n
+搬运工 36 v
+搬运法 3 v
+搬运组 3 n
+搬运费 3 v
+搬运车 12 v
+搬进 153 v
+搭 3107 v
+搭上 3 v
+搭上去 3 v
+搭上来 3 v
+搭乘 149 v
+搭伙 24 v
+搭伴 12 v
+搭住 3 v
+搭便 3 v
+搭便车 6 l
+搭公车 3 n
+搭出 3 v
+搭勾 3 n
+搭台 20 v
+搭售 6 v
+搭头 3 v
+搭好 3 v
+搭客 11 v
+搭帐篷 3 n
+搭帮 3 v
+搭建 207 v
+搭成 3 v
+搭手 3 v
+搭扣 3 v
+搭拉 3 v
+搭接 12 v
+搭搭撒撒 3 n
+搭撒 3 v
+搭救 187 v
+搭机 3 n
+搭机到 3 l
+搭机去 3 l
+搭机回 3 l
+搭机来 3 l
+搭来搭去 3 l
+搭架 137 v
+搭架子 3 n
+搭档 144 v
+搭桥 56 v
+搭桥术 5 n
+搭桥牵线 3 vn
+搭桥铺路 3 n
+搭棚 13 n
+搭环 3 vn
+搭班 22 v
+搭班子 11 n
+搭理 139 v
+搭界 18 n
+搭盖 18 v
+搭积木 3 n
+搭线 2 n
+搭腔 50 v
+搭腰 3 v
+搭船 3 v
+搭茬儿 3 n
+搭街坊 3 n
+搭补 3 v
+搭裢 3 n
+搭讪 106 v
+搭讪者 3 r
+搭设 11 v
+搭话 61 v
+搭调 8 v
+搭起 3 v
+搭车 24 v
+搭车到 3 l
+搭车去 3 l
+搭车来 3 l
+搭载 235 v
+搭边 3 v
+搭进 3 v
+搭进去 3 v
+搭进来 3 l
+搭造 3 v
+搭配 560 v
+搭配着 3 l
+搭酒店 3 n
+搭钩 5 v
+搭链 3 n
+搭错 3 v
+搭错车 3 v
+搭靠 3 v
+搭靠在 3 v
+搮 7 zg
+搯 4 zg
+搰 14 zg
+搱 80 zg
+搲 6 zg
+搳 3 zg
+搴 727 g
+搴旗取将 3 nr
+搴旗斩将 3 n
+搷 65 zg
+搸 7 zg
+搹 4 zg
+携 1350 v
+携云握雨 3 n
+携伴 3 v
+携伴参加 3 n
+携侣 3 n
+携出 3 v
+携同 3 v
+携备 3 v
+携家带口 8 n
+携家带眷 3 n
+携巨款 3 n
+携带 1920 v
+携带品 2 n
+携带型 3 n
+携带式 3 n
+携带方便 3 l
+携带者 59 n
+携幼 3 n
+携幼扶老 3 n
+携手 421 v
+携手前进 3 l
+携手同心 3 l
+携手并肩 11 l
+携枪 3 v
+携款 3 v
+携物 3 n
+携男挈女 3 i
+携眷 3 n
+携离 3 v
+携程 59 n
+携程网 3 nz
+携老扶弱 3 l
+携起手来 20 l
+携龙握雨 3 n
+搼 3 zg
+搽 148 v
+搽着 3 v
+搽粉 3 v
+搽脂抹粉 4 i
+搽药 3 v
+搾 4 zg
+搿 100 g
+摀住 3 vn
+摀盖 3 vn
+摁 99 v
+摁扣儿 3 z
+摁钉儿 3 z
+摄 1615 vg
+摄于 3 v
+摄人心魄 5 i
+摄人魂魄 3 i
+摄像 102 v
+摄像头 53 n
+摄像师 8 n
+摄像机 249 n
+摄像管 16 n
+摄入 365 v
+摄入量 103 n
+摄制 179 v
+摄制厂 3 n
+摄制成 3 v
+摄制组 36 n
+摄制计划 3 n
+摄动 112 v
+摄卫 3 v
+摄去 3 v
+摄取 233 v
+摄取量 15 n
+摄受 3 v
+摄威擅势 3 v
+摄录 8 v
+摄录像 3 n
+摄录放 3 v
+摄录机 3 n
+摄影 1279 n
+摄影个展 3 n
+摄影包 2 n
+摄影场 5 n
+摄影奖 16 n
+摄影室 3 n
+摄影家 67 n
+摄影展 32 n
+摄影师 106 n
+摄影术 3 n
+摄影机 78 n
+摄影棚 16 n
+摄影留念 3 n
+摄影社 3 n
+摄影网 3 n
+摄影者 6 n
+摄影联展 3 n
+摄影艺术 3 n
+摄影记者 3 n
+摄影课 3 n
+摄影赛 3 n
+摄影部 7 n
+摄影集 3 n
+摄心 3 n
+摄手星 3 n
+摄护腺 3 n
+摄政 215 n
+摄政王 489 n
+摄氏 286 n
+摄氏度 301 n
+摄氏温度 6 n
+摄氏温标 10 n
+摄理 3 n
+摄生 3 v
+摄相头 3 n
+摄相机 3 n
+摄论 3 n
+摄谱仪 8 n
+摄象头 3 n
+摄象机 2 n
+摄食 114 n
+摄食中枢 3 n
+摄食调节 3 n
+摄魂 3 n
+摄魄钩魂 3 v
+摅 4 g
+摅肝沥胆 3 nr
+摆 4413 v
+摆上 3 v
+摆上去 3 v
+摆上来 3 v
+摆下 3 v
+摆下去 3 v
+摆下来 3 v
+摆不下 3 v
+摆乌龙 3 n
+摆事实 3 n
+摆件 8 n
+摆位 3 v
+摆出 3 v
+摆出去 3 v
+摆出来 3 v
+摆列 63 v
+摆列出 3 v
+摆列着 3 v
+摆到 3 v
+摆动 424 v
+摆勺村 10 n
+摆卖 3 v
+摆回 3 v
+摆回去 3 l
+摆回来 3 l
+摆在 727 v
+摆在前面 3 l
+摆在面前 3 l
+摆在首位 3 l
+摆地摊 17 l
+摆头摇尾 3 v
+摆夷 3 v
+摆好 158 v
+摆姿势 3 l
+摆子 3 n
+摆官架子 3 l
+摆尾 3 v
+摆尾摇头 3 v
+摆布 234 v
+摆平 60 v
+摆度 3 n
+摆开 199 v
+摆开阵势 3 l
+摆弄 124 v
+摆式 13 n
+摆得 3 v
+摆成 3 v
+摆手 614 v
+摆排场 3 l
+摆摆 240 v
+摆摆头 3 v
+摆摆手 3 v
+摆摊 57 v
+摆摊儿 5 n
+摆摊头 3 v
+摆摊子 12 n
+摆摊设点 3 n
+摆擂台 4 v
+摆放 261 v
+摆放在 3 v
+摆放着 3 l
+摆明 52 v
+摆来 3 v
+摆来摆去 3 l
+摆架子 8 n
+摆样 3 v
+摆样子 8 l
+摆格 3 n
+摆桌 4 v
+摆款 3 v
+摆正 40 v
+摆正位置 3 n
+摆法 3 v
+摆渡 80 v
+摆渡人 3 n
+摆满 3 v
+摆点 3 n
+摆碗碟 3 n
+摆线 3 n
+摆置 11 v
+摆脱 1889 v
+摆脱困境 3 l
+摆臭架子 3 l
+摆荡 5 v
+摆荡起来 3 l
+摆袖却金 3 n
+摆设 213 v
+摆谱 15 v
+摆谱儿 3 l
+摆起 34 v
+摆起来 3 v
+摆轮 8 n
+摆轴 3 n
+摆进 3 v
+摆进去 3 v
+摆进来 3 v
+摆迷魂阵 2 vn
+摆酒 3 v
+摆酒席 3 n
+摆针 2 n
+摆钟 19 n
+摆锤 3 n
+摆长 3 v
+摆门面 3 n
+摆阔 20 v
+摆阔气 4 l
+摆齐 3 v
+摆龙门阵 10 l
+摇 2706 v
+摇下 3 v
+摇了一下 3 i
+摇出 3 v
+摇到 3 v
+摇动 224 v
+摇动不停 3 l
+摇匀 3 v
+摇吻鼓舌 3 n
+摇唇鼓喙 3 i
+摇唇鼓舌 6 i
+摇嘴掉舌 3 l
+摇头 2864 v
+摇头丸 3 n
+摇头叹息 35 i
+摇头吧 3 n
+摇头摆尾 22 i
+摇头摆脑 9 l
+摇头晃脑 112 i
+摇头稾脑 3 z
+摇头麰尾 3 v
+摇奖 14 v
+摇奖机 3 n
+摇好 3 v
+摇尾 3 v
+摇尾乞怜 13 i
+摇尾巴 3 n
+摇尾求食 3 i
+摇尾涂中 3 i
+摇席破坐 3 i
+摇席破座 3 i
+摇床 3 v
+摇得 3 v
+摇憾 3 v
+摇扇 3 n
+摇手 268 v
+摇手触禁 3 i
+摇手顿足 3 i
+摇把子 2 l
+摇控 3 v
+摇控器 3 nz
+摇摆 157 v
+摇摆不定 31 l
+摇摆人 3 l
+摇摆式 4 l
+摇摆机 3 l
+摇摆舞 2 l
+摇摇 167 v
+摇摇冰 3 z
+摇摇头 1211 v
+摇摇手 3 v
+摇摇摆摆 67 v
+摇摇晃晃 241 z
+摇摇曳曳 4 z
+摇摇欲坠 108 i
+摇摇荡荡 3 z
+摇撼 41 v
+摇旗 3 n
+摇旗呐喊 39 i
+摇晃 645 z
+摇晃不停 3 n
+摇曳 170 v
+摇曳多姿 9 i
+摇曳生姿 3 i
+摇杆 2 n
+摇桨 3 n
+摇椅 4 n
+摇橹 3 n
+摇滚 126 z
+摇滚乐 70 i
+摇滚乐团 3 i
+摇滚乐手 3 i
+摇滚圈 3 n
+摇滚年 3 i
+摇滚歌手 3 i
+摇滚歌曲 3 l
+摇滚秀 3 i
+摇滚音乐 3 i
+摇漾 3 v
+摇点 3 n
+摇琴 3 n
+摇着头 3 l
+摇笔即来 3 i
+摇篮 225 v
+摇篮曲 11 n
+摇篮网 3 nz
+摇粒绒 3 nz
+摇羽毛扇 3 i
+摇脣鼓舌 3 n
+摇臂 7 n
+摇臂钻 3 l
+摇船 20 v
+摇荡 20 v
+摇荡不停 3 v
+摇落 3 v
+摇蚊 11 n
+摇起 3 v
+摇起来 3 l
+摇身 3 v
+摇身一变 138 i
+摇车 3 v
+摇钱树 52 n
+摇钻 3 n
+摇铃 9 nz
+摇铃打鼓 3 i
+摇锤 3 n
+摇镜头 3 v
+摇鹅毛扇 5 i
+摈 75 v
+摈弃 65 v
+摈斥 32 v
+摈而不用 3 v
+摈除 17 v
+摊 857 v
+摊下 3 s
+摊下去 3 v
+摊下来 3 v
+摊主 62 n
+摊付 3 v
+摊位 154 n
+摊位费 4 n
+摊儿 18 n
+摊入 3 v
+摊出 3 v
+摊出去 3 v
+摊出来 3 v
+摊到 3 v
+摊前 22 s
+摊售 3 v
+摊商 2 n
+摊场 3 n
+摊头 2 n
+摊子 303 n
+摊床 2 n
+摊开 402 v
+摊手摊脚 3 n
+摊提 3 n
+摊摊 3 n
+摊摊手 17 n
+摊晒 6 v
+摊晒机 3 n
+摊档 4 n
+摊款 3 n
+摊派 109 n
+摊点 42 n
+摊牌 65 n
+摊着 3 v
+摊贩 36 n
+摊起 3 s
+摊车 3 n
+摊过 3 v
+摊还 3 v
+摊进 3 v
+摊配 3 v
+摊铺 45 n
+摊铺机 3 n
+摊销 3 v
+摊鸡蛋 3 n
+摋 7 zg
+摐 30 zg
+摑 72 zg
+摒 40 v
+摒出 3 v
+摒弃 177 v
+摒弃前嫌 2 l
+摒挡 3 v
+摒绝 3 v
+摒除 15 v
+摓 4 zg
+摔 2440 v
+摔下 3 v
+摔下去 3 v
+摔下来 3 v
+摔不掉 3 v
+摔了一跤 3 v
+摔交 76 v
+摔伤 50 v
+摔倒 637 v
+摔到 3 v
+摔坏 3 v
+摔开 3 v
+摔成 3 v
+摔成两半 3 v
+摔打 75 v
+摔投 3 v
+摔掉 3 v
+摔断 3 v
+摔断了 3 v
+摔断了腿 3 v
+摔死 3 v
+摔痛 3 v
+摔破 3 v
+摔碎 3 v
+摔筋斗 3 n
+摔角 3 v
+摔跌 3 v
+摔跟头 6 v
+摔跟斗 3 v
+摔跤 236 v
+摔跤场地 3 v
+摔跤手 3 vn
+摘 1181 v
+摘下 3 v
+摘下去 3 v
+摘下来 3 l
+摘借 3 v
+摘出 3 v
+摘出去 3 v
+摘出来 3 v
+摘到 3 v
+摘去 3 v
+摘发 2 v
+摘取 88 v
+摘取桂冠 3 n
+摘句 3 n
+摘句寻章 3 l
+摘埴索涂 3 z
+摘帽 21 n
+摘帽子 5 n
+摘引 18 v
+摘录 108 v
+摘录者 3 n
+摘录自 3 v
+摘得 28 v
+摘心 3 v
+摘抄 20 v
+摘报 3 n
+摘掉 103 v
+摘星 3 n
+摘星子 3 n
+摘来 3 v
+摘来摘去 3 n
+摘牌 11 v
+摘瑕指瑜 3 nr
+摘由 3 n
+摘登 5 v
+摘编 55 v
+摘胆剜心 3 z
+摘自 112 v
+摘艳熏香 3 l
+摘艳薰香 3 z
+摘花 3 n
+摘葡萄 6 n
+摘要 558 v
+摘要性 3 n
+摘要重述 3 l
+摘记 2 n
+摘译 6 v
+摘走 3 v
+摘起 3 v
+摘起来 3 l
+摘述 3 v
+摘选 3 v
+摘选自 3 l
+摘金 3 n
+摘除 68 v
+摘除术 6 n
+摘食 3 n
+摙 2 zg
+摜 29 zg
+摝 48 zg
+摞 121 v
+摟 13 zg
+摠 5 zg
+摢 93 zg
+摤 6 zg
+摥 30 zg
+摦 7 zg
+摧 198 v
+摧促 3 v
+摧兰折玉 3 i
+摧刚为柔 3 i
+摧坚获丑 3 i
+摧坚陷阵 3 i
+摧垮 18 v
+摧心剖肝 3 n
+摧心裂胆 3 i
+摧折 14 v
+摧折豪强 3 i
+摧挫 3 v
+摧损 3 v
+摧朽拉枯 3 i
+摧枯折腐 3 i
+摧枯拉朽 34 i
+摧枯拉腐 3 i
+摧枯振朽 3 i
+摧残 367 v
+摧毁 940 v
+摧毁力 3 i
+摧毁性 6 i
+摧眉折腰 5 i
+摧花 3 v
+摧身碎首 3 i
+摧锋陷坚 3 i
+摧锋陷阵 3 i
+摧陷廓清 3 z
+摩 1820 nz
+摩丝 3 nz
+摩伊 13 nrt
+摩利 3 nz
+摩加迪沙 29 ns
+摩卡 3 nz
+摩厉以须 3 i
+摩口膏舌 3 i
+摩天 32 nz
+摩天大厦 5 nz
+摩天大楼 57 nz
+摩天岭 25 nz
+摩天楼 3 nr
+摩天童子 3 nz
+摩天轮 5 nz
+摩尔 232 nz
+摩尔体积 3 n
+摩尔多瓦 94 nrt
+摩尔多瓦共和国 4 ns
+摩尔定律 3 ns
+摩尔曼斯克 14 nrt
+摩尔根 51 nz
+摩尔热容 3 nz
+摩尔维亚 3 nrt
+摩尼教 85 nz
+摩崖 92 ns
+摩弄 3 v
+摩德纳 3 nrt
+摩托 128 nrt
+摩托化 158 nz
+摩托罗拉 196 nrt
+摩托罗拉公司 28 ns
+摩托船 3 nz
+摩托艇 34 n
+摩托赛 3 nz
+摩托车 422 nz
+摩托车厂 3 n
+摩抚 3 n
+摩拉 10 nrt
+摩拉维亚 52 ns
+摩拖车 3 n
+摩拳擦掌 80 i
+摩挲 68 v
+摩搓 3 v
+摩擦 802 vn
+摩擦剂 2 n
+摩擦力 59 n
+摩擦学 17 n
+摩擦性 5 n
+摩擦片 3 n
+摩擦系数 23 n
+摩擦角 3 n
+摩擦阻力 3 n
+摩擦音 7 n
+摩斯 16 nz
+摩斯电码 3 n
+摩机 3 nz
+摩根 121 nz
+摩根士丹利 27 nz
+摩根斯坦利 47 nz
+摩梭 3 nz
+摩梭人 3 n
+摩步旅 19 nz
+摩泽尔 5 nr
+摩泽尔河 4 ns
+摩洛 15 nrt
+摩洛哥 500 ns
+摩洛哥王国 7 ns
+摩洛哥队 2 nt
+摩洛客 3 nrt
+摩牙 3 ns
+摩电架 3 nz
+摩电灯 3 nz
+摩电道 3 nz
+摩登 73 nrt
+摩登女郎 3 nr
+摩登时代 3 i
+摩登舞 3 nr
+摩砺以须 3 nr
+摩纳哥 83 ns
+摩纳哥公国 3 ns
+摩纳哥队 4 nt
+摩罗 16 nrt
+摩羯座 5 nz
+摩肩 3 nz
+摩肩击毂 3 n
+摩肩接毂 3 n
+摩肩接踵 25 i
+摩肩擦踵 3 i
+摩苏尔 20 nrt
+摩萨德 11 nrt
+摩西 100 ns
+摩诃 3 nr
+摩诃巴思 3 nr
+摩诃萨 3 nr
+摩门 6 ns
+摩门教 11 nz
+摩门教会 3 nz
+摩门教徒 3 n
+摩阻损失 3 n
+摩顶 3 n
+摩顶放踵 3 i
+摩顶至足 3 i
+摩顶至踵 3 i
+摬 6 zg
+摭 19 g
+摭拾遗文 3 ns
+摱 14 zg
+摲 2 zg
+摵 15 zg
+摷 26 zg
+摸 4552 v
+摸上去 3 l
+摸上来 3 l
+摸下去 3 l
+摸下来 3 l
+摸不到 3 l
+摸不清 3 l
+摸不着 3 l
+摸不着头脑 158 l
+摸不着边 3 l
+摸不透 3 l
+摸了摸 3 l
+摸入 3 v
+摸准 3 v
+摸出 3 v
+摸出去 3 l
+摸出来 3 l
+摸到 3 v
+摸哨 3 n
+摸回 3 v
+摸头 8 n
+摸头不着 3 l
+摸奖 3 n
+摸底 86 n
+摸底考试 3 n
+摸弄 3 v
+摸彩 3 n
+摸彩品 3 l
+摸得着 22 l
+摸成 3 v
+摸手 3 v
+摸掉 3 v
+摸排 5 v
+摸摸 301 v
+摸摸头 5 l
+摸摸底 4 l
+摸摸索索 13 z
+摸来 3 v
+摸来摸去 3 l
+摸棱 3 n
+摸清 132 v
+摸清底细 3 z
+摸清楚 3 l
+摸熟 3 v
+摸爬滚打 45 l
+摸牌 3 n
+摸着石头过河 15 l
+摸瞎 3 n
+摸破 3 v
+摸索 427 v
+摸索到 3 l
+摸脚 3 n
+摸脸 3 v
+摸营 3 v
+摸触 3 v
+摸起 3 v
+摸起来 3 l
+摸进 3 v
+摸进去 3 l
+摸进来 3 l
+摸透 41 v
+摸金校尉 405 n
+摸错 3 v
+摸门 3 n
+摸门不着 3 l
+摸门儿 3 l
+摸骨 3 n
+摸骨相 3 n
+摸鱼 3 n
+摸黑 54 z
+摸黑儿 3 l
+摹 706 v
+摹仿 32 v
+摹写 14 v
+摹刻 7 n
+摹印 2 v
+摹古 6 n
+摹拟 34 v
+摹本 53 n
+摹状 3 n
+摹画 3 n
+摹绘 3 v
+摺 254 zg
+摺叠 7 v
+摺叠为 3 n
+摺叠扇 3 n
+摺叠起来 3 n
+摺合 3 v
+摺奏 3 v
+摺子 2 n
+摺尺 3 n
+摺扇 3 n
+摺梯 3 n
+摺椅 3 n
+摺痕 3 n
+摺篷 3 n
+摺纸 3 v
+摺纸工 3 n
+摺裙 3 n
+摽 22 zg
+摽梅之年 3 nz
+撂 309 v
+撂下 60 v
+撂下来 3 v
+撂倒 3 v
+撂夺 3 v
+撂手 3 v
+撂挑子 19 v
+撂荒 9 v
+撂荒地 3 z
+撄 24 g
+撅 304 v
+撅天扑地 3 z
+撇 453 zg
+撇下 181 v
+撇乳器 3 v
+撇刀 3 v
+撇去 3 v
+撇呆打堕 3 nr
+撇嘴 126 v
+撇在 3 v
+撇开 409 v
+撇开不谈 3 v
+撇弃 3 v
+撇折 3 v
+撇掉 3 v
+撇撇嘴 3 v
+撇清 15 v
+撑 1406 v
+撑下去 3 v
+撑不下去 3 l
+撑不住 3 v
+撑伞 8 v
+撑住 64 v
+撑到 3 v
+撑反 3 v
+撑场面 2 n
+撑天拄地 3 z
+撑天柱地 3 n
+撑好 3 v
+撑岸就船 3 n
+撑开 56 v
+撑开伞 3 n
+撑得 3 v
+撑得住 11 v
+撑持 85 v
+撑杆 9 n
+撑杆跳 5 l
+撑杆跳高 5 l
+撑死 3 v
+撑满 3 v
+撑眼努目 3 l
+撑破 3 v
+撑竿 3 n
+撑竿跳 3 l
+撑竿跳高 14 l
+撑篙 12 n
+撑肠拄肚 3 v
+撑肠拄腹 3 v
+撑腰 137 v
+撑臂 3 n
+撑船 47 v
+撑起 3 v
+撑起来 3 l
+撑过 3 v
+撑过去 3 l
+撑过来 3 l
+撑门面 7 n
+撑霆裂月 3 nr
+撒 1907 v
+撒丁 42 nrt
+撒丁岛 20 ns
+撒下 3 v
+撒下去 3 l
+撒下来 3 l
+撒丫子 11 nr
+撒克逊 53 nrt
+撒克逊人 3 nrt
+撒刁 3 v
+撒切尔 41 nrt
+撒去 3 v
+撒向 3 v
+撒呓挣 3 v
+撒呓症 3 v
+撒哈拉 206 nrt
+撒哈拉沙漠 146 ns
+撒娇 143 v
+撒娇卖俏 3 i
+撒娇撒痴 10 i
+撒尼族 2 nz
+撒尿 142 v
+撒布 35 v
+撒开 3 v
+撒开来 3 l
+撒手 202 v
+撒手不干 3 l
+撒手不管 48 l
+撒手人寰 6 i
+撒手尘寰 3 i
+撒手归西 2 i
+撒手西归 3 l
+撒手锏 129 n
+撒拉 38 nrt
+撒拉族 297 nz
+撒播 33 nrt
+撒播机 3 n
+撒放 10 v
+撒施 3 v
+撒旦 56 d
+撒来 3 v
+撒来撒去 3 i
+撒欢 8 v
+撒欢儿 3 nr
+撒气 20 n
+撒水 3 ns
+撒水拿鱼 3 nz
+撒沙 3 ns
+撒沙子 3 nr
+撒泼 50 v
+撒泼打滚 3 l
+撒泼放刁 3 nr
+撒泼耍赖 3 l
+撒满 3 v
+撒痴撒娇 3 i
+撒盐 3 nz
+撒种 10 n
+撒科打诨 3 i
+撒粪机 3 n
+撒线 3 nz
+撒网 32 nz
+撒网捕鱼 3 l
+撒肥 3 ns
+撒胡椒面 3 n
+撒腿 65 nz
+撒腿就跑 3 l
+撒花 16 nz
+撒落 17 v
+撒诈捣虚 3 i
+撒谎 321 v
+撒豆成兵 5 nz
+撒赖 17 v
+撒酒疯 3 l
+撒酒风 3 n
+撒野 92 nrt
+撒马尔 3 nrt
+撒马尔罕 79 nrt
+撒骚放屁 3 nr
+撒鸭子 3 n
+撕 912 v
+撕下 350 v
+撕下去 3 l
+撕下来 3 l
+撕剥 3 v
+撕去 3 v
+撕咬 29 v
+撕坏 3 v
+撕开 157 v
+撕得 3 v
+撕心裂肺 45 l
+撕成 3 v
+撕打 3 v
+撕扯 62 v
+撕拉 3 v
+撕掉 3 v
+撕来 3 v
+撕来撕去 3 z
+撕毁 178 v
+撕毁协定 3 l
+撕毁合同 3 l
+撕烂 3 v
+撕破 117 v
+撕破脸 39 l
+撕破脸皮 3 l
+撕碎 58 v
+撕票 11 v
+撕票员 3 l
+撕裂 170 v
+撕走 3 v
+撕起 3 v
+撕起来 3 l
+撕过 3 v
+撕过去 3 l
+撕过来 3 l
+撖 4 g
+撗 3 zg
+撙省 3 v
+撙节 3 v
+撚 3 zg
+撞 3773 v
+撞个满怀 3 n
+撞了人 3 v
+撞人案 3 n
+撞伤 18 v
+撞倒 68 v
+撞入 56 v
+撞出 3 v
+撞出去 3 v
+撞出来 3 v
+撞击 483 v
+撞击中心 3 n
+撞击到 3 n
+撞击力 2 n
+撞击参数 3 n
+撞击器 3 n
+撞击声 28 n
+撞击杀虫 3 n
+撞到 3 v
+撞坏 3 v
+撞墙 26 n
+撞大运 3 v
+撞天屈 3 v
+撞头 3 v
+撞头搕脑 3 v
+撞头磕脑 3 v
+撞客 4 v
+撞府冲州 3 n
+撞开 3 v
+撞成 3 v
+撞打 3 v
+撞机 30 n
+撞楼 3 v
+撞死 85 v
+撞死人 3 n
+撞毁 29 v
+撞沉 16 v
+撞球 3 n
+撞球场 3 n
+撞球杆 3 n
+撞球枱 3 vn
+撞破 3 v
+撞礁 3 n
+撞见 253 v
+撞起 3 v
+撞起来 3 v
+撞车 36 v
+撞车篇 3 n
+撞进 3 v
+撞针 22 n
+撞钟 23 n
+撞锁 3 v
+撞锤 3 n
+撞阵冲军 3 n
+撞骗 3 v
+撞鬼 3 v
+撢子 3 v
+撢灰 3 v
+撤 2173 v
+撤下 3 v
+撤下去 3 v
+撤佃 3 v
+撤免 3 v
+撤兵 119 v
+撤军 387 v
+撤出 400 v
+撤出去 3 v
+撤出来 3 v
+撤到 3 v
+撤单 3 v
+撤单查询 3 vn
+撤去 3 v
+撤回 281 v
+撤回去 3 z
+撤回抗诉 3 nr
+撤回来 3 vn
+撤守 3 v
+撤完 3 v
+撤岗 3 v
+撤差 3 v
+撤席 6 v
+撤并 25 v
+撤成 3 v
+撤换 91 v
+撤掉 53 v
+撤收 21 v
+撤柜 3 v
+撤标 3 v
+撤案 3 v
+撤消 104 v
+撤消原语 3 v
+撤消处分 3 z
+撤离 400 v
+撤编 3 v
+撤职 218 v
+撤职处分 3 z
+撤职查办 3 nz
+撤营 3 vn
+撤诉 19 v
+撤资 10 vn
+撤走 236 v
+撤退 979 v
+撤销 4998 v
+撤销书 3 nz
+撤销原判 3 nz
+撤销权 4 nz
+撤销职务 3 vn
+撤销记录 3 nz
+撤防 4 v
+撤除 185 v
+撧耳挠腮 3 i
+撧耳揉腮 3 i
+撧耳顿足 3 nt
+撩 446 v
+撩上 3 v
+撩上来 3 v
+撩乱 22 v
+撩云拔雨 3 nr
+撩云拨雨 3 n
+撩人 3 v
+撩动 3 v
+撩开 70 v
+撩拨 91 v
+撩望 3 v
+撩来撩去 3 z
+撩火加油 3 v
+撩起 3 v
+撩起来 3 v
+撩逗 4 v
+撬 520 zg
+撬上 3 v
+撬上去 3 v
+撬上来 3 v
+撬下 3 v
+撬下去 3 v
+撬下来 3 v
+撬不开 3 v
+撬出去 3 v
+撬出来 3 v
+撬动 26 v
+撬坏 3 v
+撬开 3 v
+撬杠 2 v
+撬来撬去 3 z
+撬棍 264 n
+撬棒 2 n
+撬着 3 v
+撬窃 3 v
+撬箱 3 n
+撬起 3 v
+撬起来 3 v
+撬锁 3 v
+撬门 3 n
+播 636 v
+播下 46 v
+播出 248 v
+播出去 3 v
+播出来 3 v
+播到 3 v
+播前处理 3 v
+播去 3 v
+播发 30 v
+播客网 3 n
+播州 63 ns
+播幅 2 n
+播弄 15 v
+播弄是非 3 v
+播得 3 v
+播恶遗臭 3 n
+播扬 2 v
+播报 33 v
+播撒 35 ns
+播放 523 v
+播放列表 3 n
+播放器 118 n
+播放工具 3 n
+播放按钮 3 n
+播放机 38 n
+播放权 2 n
+播放歌曲 3 n
+播放页 3 n
+播散 31 v
+播映 12 v
+播映权 3 n
+播来播去 3 n
+播洒 3 v
+播片 3 n
+播种 708 v
+播种期 6 n
+播种机 40 n
+播种法 3 n
+播种盘 3 n
+播种者 2 n
+播种量 7 n
+播种面积 3 n
+播穅眯目 3 vn
+播糠眯目 3 nr
+播讲 2 v
+播迁 3 v
+播进 3 v
+播送 30 v
+播送到 3 n
+播量 3 n
+播音 77 n
+播音剧 3 n
+播音员 87 n
+播音室 4 n
+播音王 3 n
+撮 893 v
+撮到 3 v
+撮口呼 3 n
+撮合 75 v
+撮土 3 n
+撮土焚香 3 z
+撮子 3 n
+撮弄 3 v
+撮盐入水 3 n
+撮盐入火 3 n
+撮科打哄 3 n
+撮科打閧 3 v
+撮箕 7 n
+撮药 3 n
+撮要 9 v
+撯 12 zg
+撰 1180 vg
+撰书 3 v
+撰于 3 v
+撰写 1027 v
+撰写论文 3 n
+撰出来 3 v
+撰序 3 n
+撰拟 3 v
+撰文 209 n
+撰稿 79 v
+撰稿人 86 n
+撰稿员 3 n
+撰著 30 v
+撰述 45 v
+撱 66 zg
+撲 317 zg
+撳 565 zg
+撴 309 zg
+撵 374 zg
+撵出 3 v
+撵出去 3 v
+撵出来 3 v
+撵去 3 v
+撵开 3 v
+撵走 30 v
+撵跑 3 v
+撶 327 zg
+撷 23 vg
+撷取 13 v
+撷拾 3 v
+撸 194 n
+撸子 3 n
+撹 170 zg
+撺 67 v
+撺弄 3 v
+撺掇 91 v
+撺改 3 v
+撺高 3 v
+撻 100 zg
+撼 169 v
+撼人心魄 14 i
+撼动 67 v
+撼地摇天 3 i
+撼天动地 6 i
+撼天震地 3 i
+撼山拔树 3 i
+撼摇 3 v
+撼树蚍蜉 3 n
+擀 121 v
+擀杖 11 n
+擀毡 2 n
+擀面仗 3 n
+擀面杖 27 n
+擂 206 v
+擂主 2 v
+擂台 215 v
+擂台赛 68 ns
+擂响 3 v
+擂天倒地 3 i
+擂打 3 v
+擂棍 3 n
+擂槌 3 n
+擂琴 3 n
+擂肥 3 v
+擂起 3 v
+擂钵 3 n
+擂鼓 205 v
+擂鼓台 3 n
+擂鼓墩 2 n
+擂鼓筛锣 3 i
+擂鼓鸣金 3 n
+擄 187 zg
+擅 1019 vg
+擅于 172 v
+擅作主张 3 v
+擅作威福 3 i
+擅侯王 2 v
+擅入 3 v
+擅场 3 d
+擅壑专丘 3 i
+擅定 3 d
+擅改 4 v
+擅断 3 d
+擅权 3 v
+擅用 3 v
+擅离 27 v
+擅离职守 10 i
+擅自 538 d
+擅自作主 3 i
+擅自决定 3 v
+擅自处理 3 i
+擅自改变 3 i
+擅自行动 3 i
+擅解人衣 3 i
+擅长 1226 v
+擅长于 3 v
+擅闯 29 v
+擊 2 zg
+操 3353 v
+操之过切 3 l
+操之过急 40 i
+操之过激 3 l
+操之过蹙 3 i
+操于卫 16 nr
+操亚非 2 nr
+操亦笑 2 nr
+操令众 3 n
+操令卜 2 nr
+操作 3727 v
+操作前 6 l
+操作台 7 l
+操作员 49 n
+操作命令 3 n
+操作失误 3 l
+操作实务 3 l
+操作室 2 n
+操作对话 3 l
+操作工 5 l
+操作思维 3 l
+操作性 61 n
+操作手 24 l
+操作手册 3 l
+操作技能 3 n
+操作控制 2 n
+操作数 21 l
+操作方法 3 l
+操作机 4 l
+操作步骤 2 l
+操作法 2 n
+操作测验 3 n
+操作温度 3 l
+操作电脑 3 l
+操作界面 3 l
+操作码 7 l
+操作程序 3 l
+操作符 70 nr
+操作系统 757 l
+操作者 42 n
+操作能力 3 l
+操作规程 3 l
+操作证 3 nr
+操作过程 3 l
+操作速度 2 n
+操作间 10 n
+操作题 3 n
+操修者 16 nr
+操克丘 2 nr
+操兵 7 v
+操兵方 2 nr
+操典 15 n
+操刀 36 v
+操刀伤锦 3 i
+操刀制锦 3 i
+操刀必割 3 l
+操切 4 v
+操办 84 v
+操劳 118 v
+操劳过度 3 l
+操厚赏 2 nr
+操召入 3 nr
+操土功 2 nr
+操在 3 v
+操场 284 n
+操场上 3 v
+操大喜 2 nr
+操大怒 10 nr
+操奇计赢 3 nr
+操奇逐赢 3 n
+操守 90 v
+操弄 19 v
+操引兵 5 nr
+操引军 4 nr
+操心 625 v
+操心思 3 nr
+操心费 3 n
+操必胜 4 nr
+操戈 3 nr
+操戈入室 3 nr
+操戈同室 3 nr
+操执其 2 nr
+操持 266 v
+操持家务 3 n
+操控 74 v
+操控性 3 n
+操揉磨治 3 i
+操握 3 v
+操握大权 3 nr
+操教唤 2 nr
+操斧伐柯 3 n
+操枪 3 v
+操桨 3 v
+操检合一 3 n
+操欲立 2 nr
+操江御 2 nr
+操法 3 v
+操演 144 v
+操然 10 v
+操琴 32 nr
+操盘 13 v
+操盘手 3 n
+操矛入室 3 i
+操知布 2 nr
+操神 3 v
+操科伊 2 nr
+操笑 2 v
+操筹益 16 nr
+操素 2 n
+操纵 1201 v
+操纵台 7 l
+操纵员 5 l
+操纵器 3 l
+操纵基因 3 n
+操纵子 3 l
+操纵性 19 l
+操纵杆 25 n
+操纵法 3 l
+操纵箱 3 n
+操纵系 3 l
+操纵索 3 nr
+操纵者 9 n
+操纵自如 10 i
+操练 709 v
+操练法 3 n
+操翰成章 3 nr
+操自勒 2 nr
+操自引 3 nr
+操自领 2 nr
+操舟运 3 nr
+操舵 10 v
+操舵仪 2 nr
+操舵手 3 n
+操船术 3 n
+操营务 3 n
+操蛋 3 v
+操行 112 v
+操行成绩 3 n
+操观 2 v
+操觚染翰 3 nz
+操贱业 16 l
+操赢致奇 3 nr
+操起 3 v
+操身行世 3 l
+操郑克 2 nr
+操闻 6 n
+操领兵 2 nr
+擎 179 v
+擎天 167 n
+擎天之柱 3 n
+擎天大楼 3 n
+擎天架海 3 n
+擎天柱 10 n
+擎开玉柱 3 n
+擎着 3 v
+擐 10 g
+擐甲执兵 3 nt
+擐甲挥戈 3 nz
+擒 1455 v
+擒住 3 v
+擒奸擿伏 3 n
+擒奸讨暴 3 i
+擒拿 445 v
+擒拿格斗 3 nz
+擒拿法 39 nz
+擒捉 3 v
+擒敌 8 v
+擒服 3 v
+擒王 3 nz
+擒纵机构 11 l
+擒纵装置 3 i
+擒获 163 v
+擒贼 3 n
+擒贼先擒王 19 i
+擒贼擒王 14 i
+擔 4 zg
+擗踊拊心 3 z
+擘 27 g
+擘两分星 3 v
+擘画 6 v
+擘肌分理 3 v
+擝 6 zg
+擞 117 x
+擢 235 g
+擢为 3 v
+擢升 60 v
+擢发莫数 3 i
+擢发难数 3 i
+擢用 3 v
+擣 3 zg
+擣衣 3 vn
+擤 43 v
+擦 2833 v
+擦上去 3 l
+擦上来 3 l
+擦下去 3 l
+擦下来 3 l
+擦不掉 3 v
+擦乾 3 i
+擦乾净 3 i
+擦亮 40 v
+擦亮眼睛 3 i
+擦伤 56 v
+擦写 13 v
+擦净 3 v
+擦出 3 v
+擦刮 3 v
+擦剂 2 n
+擦去雾水 3 l
+擦墙而过 3 l
+擦子 3 n
+擦屁股 23 l
+擦布 3 v
+擦干 3 v
+擦手纸 3 nz
+擦抹 3 v
+擦抹着 3 l
+擦拭 135 v
+擦拭布 3 vn
+擦拭法 3 vn
+擦拭纸 3 vn
+擦拳抹掌 3 i
+擦拳磨掌 3 i
+擦掉 30 v
+擦掌 3 v
+擦掌磨拳 3 i
+擦擦 3 v
+擦擦看 3 l
+擦来 3 v
+擦来擦去 3 l
+擦枪 3 n
+擦汗 3 v
+擦油 3 n
+擦洗 99 v
+擦澡 3 v
+擦热 3 v
+擦痕 13 n
+擦皮 3 n
+擦皮鞋 3 l
+擦眼抹泪 3 l
+擦破 3 v
+擦碰 3 v
+擦窗机 3 i
+擦米 3 n
+擦粉 3 n
+擦网 3 v
+擦肩 3 v
+擦肩而过 96 l
+擦背 2 v
+擦脂抹粉 3 i
+擦药 3 n
+擦起 3 v
+擦起来 3 l
+擦身 16 v
+擦身而过 31 l
+擦边 2 n
+擦边撞击 3 i
+擦边球 35 n
+擦过去 3 l
+擦过来 3 l
+擦除 8 v
+擦鞋 3 n
+擦鞋机 3 n
+擦鞋油 3 n
+擦鞋童 2 n
+擦音 10 n
+擦黑 3 v
+擦黑儿 3 l
+擭 54 zg
+擴 2 zg
+擻 2 zg
+擽 70 zg
+擿 24 zg
+擿伏发奸 3 v
+擿伏发隐 3 v
+擿埴索涂 3 z
+擿埴索途 3 nr
+擿奸发伏 3 n
+擿植索涂 3 ns
+攀 839 v
+攀上 2 v
+攀上去 3 v
+攀上来 3 v
+攀不上 3 v
+攀交 3 v
+攀亲 15 v
+攀亲道故 3 i
+攀今吊古 3 i
+攀今揽古 3 l
+攀住 3 v
+攀供 3 v
+攀冰 3 v
+攀到 3 v
+攀升 476 v
+攀山 8 ns
+攀山会 3 nt
+攀岩 37 ns
+攀扯 8 v
+攀折 11 v
+攀援 137 v
+攀枝 3 n
+攀枝花 84 i
+攀枝花市 33 ns
+攀枝花树 2 ns
+攀树 3 ns
+攀比 123 v
+攀沿 3 ns
+攀炎附热 3 i
+攀爬 48 v
+攀登 187 v
+攀登上 3 ns
+攀登架 3 ns
+攀登者 3 n
+攀登高峰 3 ns
+攀着 3 v
+攀索 3 v
+攀缘 42 v
+攀缘植物 3 l
+攀缘茎 3 n
+攀缘运动 3 i
+攀花折柳 3 i
+攀花问柳 3 i
+攀藤揽葛 3 l
+攀藤附葛 3 n
+攀蟾折桂 3 v
+攀西 15 ns
+攀谈 64 v
+攀起 3 v
+攀越 15 v
+攀蹬 3 v
+攀车卧辙 3 i
+攀辕卧辙 3 i
+攀过 3 v
+攀过去 3 v
+攀过来 3 v
+攀钢 24 v
+攀附 36 v
+攀附力 3 i
+攀靠 3 v
+攀靠在 3 v
+攀高 11 v
+攀高接贵 3 i
+攀高枝 3 i
+攀高枝儿 3 i
+攀高结贵 3 i
+攀鳞附翼 3 i
+攀龙讬凤 3 ns
+攀龙附凤 15 i
+攀龙附骥 3 i
+攁 5 zg
+攉 21 v
+攒 489 zg
+攒三聚五 3 n
+攒三集五 3 n
+攒动 160 v
+攒射 3 v
+攒拢 3 v
+攒机 5 n
+攒机商 2 n
+攒盒 7 n
+攒眉 14 v
+攒眉苦脸 3 v
+攒眉蹙额 3 v
+攒着 3 v
+攒竹 3 n
+攒聚 3 v
+攒钱 3 v
+攒钱罐 3 n
+攒锋聚镝 3 n
+攒集 3 v
+攒零合整 3 v
+攒魔法 3 v
+攘 219 vg
+攘人之美 3 l
+攘土 3 v
+攘外 3 l
+攘外安内 3 l
+攘外必先安内 158 l
+攘夷 3 v
+攘夺 7 v
+攘往熙来 3 vn
+攘攘 3 v
+攘攘熙熙 3 nrfg
+攘权夺利 3 l
+攘来熙往 3 vn
+攘灾 3 l
+攘肌及骨 3 l
+攘臂 27 l
+攘臂一呼 3 l
+攘臂而起 3 l
+攘袂 3 v
+攘袂引领 3 nz
+攘除 3 v
+攞袖揎拳 3 v
+攠 2 zg
+攢 3 zg
+攣 9 zg
+攥 334 v
+攦 2 zg
+攧 14 zg
+攧扑不破 3 nr
+攨 4 zg
+攪 6 zg
+攫 71 zg
+攫为己有 3 nz
+攫住 3 v
+攫去 3 v
+攫取 220 v
+攫取财富 3 nz
+攫夺 3 v
+攫戾执猛 3 nr
+攬 2 zg
+攭 2 zg
+攮 18 v
+攮子 5 n
+支 4883 n
+支中甲 2 nr
+支义军 5 nr
+支乐队 3 n
+支书 243 n
+支付 3382 v
+支付卡 4 nr
+支付向量 3 n
+支付宝 3 nr
+支付方 3 n
+支付款 6 n
+支付现金 3 n
+支会 4 n
+支使 71 v
+支修益 3 nr
+支公司 7 n
+支农 48 n
+支出 1424 v
+支出费用 3 n
+支出额 4 n
+支分族解 3 n
+支分节解 3 n
+支前 41 v
+支前工作 3 n
+支助 4 v
+支助周 2 nr
+支努干 11 nr
+支化 4 v
+支化系数 3 n
+支原体 5 n
+支取 131 v
+支吾 124 v
+支吾以对 3 i
+支吾其词 3 i
+支吾其辞 3 nz
+支哈尔 2 nr
+支基利 2 nr
+支墩 12 n
+支墩坝 3 nr
+支大军 2 nr
+支奴干 2 n
+支委 12 n
+支委会 18 n
+支子 3 n
+支字 3 n
+支宗王 2 nr
+支官军阻 2 i
+支宿卫 2 nr
+支小小 3 j
+支局 16 n
+支属 3 n
+支工 3 vn
+支左 24 v
+支差 3 n
+支常年 2 n
+支干 3 n
+支床叠屋 3 n
+支床迭屋 3 nz
+支库 3 n
+支应 28 v
+支店 3 n
+支座 31 n
+支建桥 34 nr
+支开 3 v
+支息 3 n
+支手舞脚 3 i
+支托 3 v
+支托区 3 n
+支承 119 v
+支承桥 2 nr
+支承梁 2 nr
+支承臂 4 n
+支承节 3 nr
+支抗 3 v
+支护 34 v
+支护桩 3 n
+支招 101 n
+支招儿 2 nr
+支拨 3 v
+支持 10928 v
+支持不住 3 i
+支持力 4 n
+支持性 8 n
+支持物 3 n
+支持率 32 n
+支持系统 14 n
+支持者 198 n
+支持软件 4 n
+支援 2000 v
+支援前线 3 n
+支援灾区 3 n
+支撑 1501 v
+支撑不了 3 n
+支撑位 3 n
+支撑住 3 n
+支撑体系 3 n
+支撑剂 3 n
+支撑力 10 n
+支撑危局 3 n
+支撑杆 3 n
+支撑架 3 n
+支撑点 43 n
+支撑物 4 n
+支撑网 3 n
+支支吾吾 54 nr
+支教 88 n
+支教团 2 n
+支数 16 n
+支斗渠 2 n
+支斯坦 4 nr
+支新军 2 nr
+支明 2 v
+支曲儿 3 n
+支杆 3 n
+支条 3 n
+支松烛 2 nr
+支林飞 9 nr
+支枢 3 n
+支枪 4 n
+支架 204 n
+支架幕 3 n
+支柱 1723 n
+支柱产业 3 n
+支柱性 12 n
+支柱蓼 3 nr
+支柱行业 3 n
+支棱 5 nr
+支楞楞 2 n
+支槽 3 n
+支款 3 n
+支正 3 v
+支气管 240 vn
+支气管炎 102 n
+支气管镜 26 n
+支沟 10 n
+支派 89 n
+支流 1381 n
+支渠 6 n
+支炉 3 n
+支点 149 n
+支点线 3 n
+支点网 3 v
+支独秀 2 nr
+支用 3 v
+支着 3 v
+支着儿 3 n
+支神兵 2 n
+支票 182 n
+支票作废 3 n
+支票帐户 3 n
+支票本 3 n
+支票簿 2 n
+支票薄 3 n
+支离 13 v
+支离破碎 89 i
+支策据梧 3 n
+支箭 4 n
+支系 145 n
+支索 3 v
+支索帆 3 nr
+支纷节解 3 i
+支线 240 n
+支绌 3 i
+支给 3 v
+支胜捷 2 nr
+支脉 68 n
+支腿 5 n
+支苏利 2 nr
+支行 290 v
+支解 4 v
+支词 3 n
+支走 3 v
+支路 46 n
+支边 8 n
+支遁 3 v
+支那 108 nr
+支那人 3 n
+支部 403 n
+支部书记 3 n
+支部委员 3 n
+支配 1911 vn
+支配力 3 n
+支配态射 3 n
+支配权 58 n
+支配欲 3 n
+支配者 3 n
+支金钗 4 nr
+支链 52 n
+支链反应 6 l
+支长箭 2 n
+支队 710 n
+支队党委 3 n
+支队长 144 n
+支陈敏 5 nr
+支领 3 v
+攱 16 zg
+攲 17 zg
+攴 2 zg
+攵 21 zg
+收 8235 v
+收上去 3 v
+收上来 3 v
+收下 266 v
+收下去 3 v
+收下来 3 v
+收不到 3 v
+收之桑榆 3 i
+收买 255 v
+收买人心 3 n
+收人 3 n
+收付 28 v
+收付款员 3 n
+收件 5 n
+收件人 14 n
+收件箱 3 n
+收伏 28 v
+收住 96 v
+收信 3 v
+收信人 30 n
+收信机 3 n
+收债 3 n
+收假 3 n
+收健 3 n
+收储 3 v
+收兑 13 v
+收入 10403 v
+收入丰厚 3 i
+收入支出 3 i
+收入水平 3 n
+收入者 8 n
+收入额 7 n
+收兵 195 n
+收养 175 v
+收养人 11 n
+收养法 3 n
+收出 3 v
+收出去 3 v
+收刀检卦 3 n
+收到 1823 v
+收割 161 v
+收割下来 3 l
+收割期 3 n
+收割机 102 n
+收割稻米 3 n
+收去 3 v
+收发 109 v
+收发人 2 n
+收发信机 3 n
+收发员 2 n
+收发器 3 n
+收发室 19 n
+收发报 4 n
+收发报机 3 n
+收发机 2 n
+收发站 3 n
+收取 937 v
+收受 157 v
+收受贿赂 3 v
+收口 28 n
+收听 121 v
+收听到 3 v
+收听广播 3 l
+收听率 3 n
+收听者 3 n
+收启 3 v
+收回 1574 v
+收回成命 39 l
+收因种果 3 n
+收因结果 3 n
+收园结果 3 n
+收在 3 v
+收场 130 n
+收埋 3 v
+收声 3 n
+收复 932 v
+收复失土 3 i
+收复失地 3 i
+收复河山 3 n
+收好 3 v
+收妥 3 v
+收字 3 n
+收存 10 v
+收存着 3 l
+收完 3 v
+收官 18 n
+收官战 15 v
+收审 30 v
+收容 167 n
+收容审查 3 n
+收容所 19 n
+收容港 4 n
+收容遣送 3 n
+收寄 11 v
+收尘 3 n
+收尸 37 n
+收尾 152 n
+收山 3 n
+收山之作 3 i
+收工 47 n
+收市 100 n
+收市价 12 n
+收市报 3 n
+收帆 3 n
+收帐 3 n
+收弓 3 n
+收归 64 v
+收归国有 3 i
+收录 280 v
+收录于 3 v
+收录放 3 v
+收录机 30 n
+收录音机 3 n
+收徒 39 n
+收得 3 v
+收心 16 n
+收心操 3 n
+收悉 8 v
+收惊 3 v
+收成 186 v
+收成弃败 3 n
+收执 9 v
+收报 49 n
+收报人 3 n
+收报机 2 n
+收报费 3 n
+收押 4 v
+收押禁见 3 n
+收拍 3 v
+收招 3 n
+收拢 94 v
+收拾 2274 v
+收拾乾净 3 i
+收拾残局 3 i
+收据 122 n
+收据簿 3 n
+收授 3 n
+收掉 3 v
+收揽 30 v
+收摊 148 n
+收摊儿 3 n
+收摊子 3 n
+收播 3 vn
+收播站 3 n
+收操 9 n
+收支 654 n
+收支处 3 n
+收支平衡 69 i
+收支相抵 3 n
+收支簿 3 n
+收收 3 v
+收放 3 v
+收放机 3 n
+收放自如 3 i
+收效 96 n
+收效甚微 38 l
+收效良好 3 l
+收敛 550 v
+收敛剂 3 v
+收敛压力 3 nz
+收敛性 3 vn
+收文 8 n
+收文簿 3 n
+收方 10 n
+收旗卷伞 3 n
+收有 3 v
+收服 43 n
+收权 3 n
+收杆 2 n
+收束 31 v
+收条 15 n
+收来 3 v
+收来收去 3 i
+收棉 3 n
+收款 55 n
+收款人 27 n
+收款单 3 n
+收款台 2 n
+收款员 3 n
+收款机 12 n
+收歛 3 vn
+收歛性 3 vn
+收殓 35 v
+收毿 3 vn
+收汇 3 n
+收油 2 n
+收治 53 n
+收治病人 3 n
+收活 3 vn
+收清 3 v
+收点 3 n
+收率 5 n
+收生 3 v
+收生婆 3 n
+收用 3 v
+收留 209 v
+收留所 3 n
+收益 1723 n
+收益值 17 n
+收益分配 3 n
+收益权 6 n
+收益率 165 n
+收益税 2 n
+收益金 2 n
+收监 25 n
+收盘 220 n
+收盘价 78 n
+收盘价格 3 n
+收盘报 3 n
+收盘汇率 3 n
+收看 146 v
+收看者 3 i
+收破烂 3 n
+收礼 18 n
+收票 3 n
+收票员 3 n
+收离纠散 3 z
+收离聚散 3 i
+收秋 2 n
+收租 3 n
+收税 68 n
+收税人 6 n
+收税员 3 n
+收税官 3 n
+收稿 3 n
+收稿人 3 n
+收笔 3 n
+收管 3 n
+收管人 3 n
+收紧 106 v
+收纳 71 v
+收纳盒 3 n
+收纳袋 3 n
+收线 3 n
+收给 3 v
+收编 158 v
+收编在 3 n
+收缘结果 3 n
+收缩 882 v
+收缩到 3 v
+收缩压 26 n
+收缩变换 3 l
+收缩期 20 n
+收缩机 3 n
+收缩水 2 n
+收缩率 8 n
+收缩膜 3 n
+收缩自如 3 i
+收缩起来 3 v
+收缰 8 v
+收缴 139 v
+收网 13 n
+收罗 53 v
+收罗人才 3 n
+收脚 3 n
+收腹 22 n
+收自 3 v
+收获 1157 v
+收获期 11 n
+收获机 5 n
+收获量 8 n
+收藏 1246 v
+收藏品 41 n
+收藏夹 3 n
+收藏家 214 n
+收藏版 3 n
+收藏界 19 n
+收藏网 3 n
+收藏者 24 n
+收藏该 3 v
+收藏迷 3 n
+收藏馆 3 n
+收蚁 3 n
+收视 27 v
+收视反听 3 i
+收视率 52 n
+收视费 3 n
+收订 3 v
+收讫 6 v
+收词 3 n
+收词量 3 n
+收话器 3 n
+收话机 3 n
+收账 3 v
+收货 3 n
+收货人 2 n
+收购 2045 v
+收购人 53 n
+收购价 16 n
+收购价格 3 n
+收购员 4 n
+收购方 7 n
+收购案 7 n
+收购点 2 n
+收购站 10 n
+收购者 6 n
+收购计划 3 n
+收购赃物 3 v
+收购部 2 n
+收购量 4 n
+收购额 3 n
+收贮 19 vn
+收费 2553 n
+收费公路 3 n
+收费制 2 n
+收费口 4 n
+收费员 2 n
+收费处 2 n
+收费机 3 n
+收费权 2 n
+收费站 23 n
+收费量 3 n
+收贿 3 v
+收走 20 v
+收起 238 v
+收足 3 v
+收车 3 n
+收转 3 v
+收载 24 v
+收过 3 v
+收过去 3 v
+收过来 3 v
+收运 2 n
+收进 3 v
+收进去 3 v
+收进来 3 v
+收针 3 n
+收钓 3 v
+收钱 3 v
+收银 23 n
+收银台 4 n
+收银员 16 n
+收银机 2 n
+收银纸 3 n
+收错 3 v
+收锣罢鼓 3 i
+收镜 3 n
+收镰 3 n
+收阅 3 v
+收队 3 n
+收集 1603 v
+收集器 13 n
+收集家 3 n
+收集整理 3 n
+收集箱 2 n
+收集者 3 n
+收集量 3 n
+收音 6 n
+收音机 242 n
+收风 3 n
+收麦 9 n
+收齐 3 v
+攸 291 zg
+攸关 48 ns
+攸县 275 ns
+攸戚相关 3 ns
+攸攸之口 3 v
+攸然 3 v
+改 9286 v
+改一改 3 j
+改上 3 v
+改下 3 v
+改不了 3 v
+改业 3 v
+改为 4253 v
+改乘 20 v
+改书 3 v
+改了又改 3 i
+改争 3 vn
+改于 3 v
+改些 3 d
+改产 3 vn
+改以 3 v
+改任 188 v
+改住 3 v
+改作 83 vn
+改使 3 v
+改俗迁风 3 i
+改修 5 vn
+改做 3 v
+改元 239 v
+改写 253 v
+改写本 2 n
+改写记录 3 n
+改出 3 v
+改刊 3 v
+改则县 3 ns
+改删 3 v
+改判 43 vn
+改到 3 v
+改制 796 v
+改办 3 v
+改加 3 v
+改动 263 vn
+改区 3 n
+改印 3 v
+改厕 3 n
+改去 3 v
+改取 3 v
+改变 10142 v
+改变传统 3 n
+改变命运 3 nz
+改变方向 3 i
+改变方式 3 l
+改变方法 3 i
+改变现状 3 n
+改变程序 2 n
+改变面貌 3 nz
+改口 144 vn
+改口沓舌 3 i
+改口说 3 i
+改号 11 v
+改名 2013 v
+改名字 3 i
+改名换姓 13 i
+改名易姓 3 i
+改向 47 v
+改售 3 vn
+改唱 3 v
+改唸 3 vn
+改善 4262 v
+改善服务 3 i
+改善法 3 i
+改善生活 3 i
+改善目前 2 i
+改嘴 3 v
+改回 3 v
+改回去 3 i
+改回来 3 i
+改图 2 v
+改土 3 v
+改在 3 v
+改地 3 v
+改场 3 v
+改型 233 vn
+改填 3 v
+改大 3 v
+改天 53 v
+改天再来 3 i
+改天换地 7 i
+改头换尾 3 i
+改头换面 60 i
+改好 3 v
+改好率 2 n
+改姓 3 v
+改姓易代 3 n
+改姓更名 3 i
+改娶 3 v
+改嫁 106 v
+改学 3 v
+改守 3 v
+改定 3 v
+改宪 3 vn
+改容换貌 3 i
+改容易貌 3 i
+改寄 3 v
+改对 3 v
+改小 3 v
+改属 3 vn
+改山治水 3 nz
+改岁 3 vn
+改帐 3 v
+改帮 3 v
+改建 1860 v
+改建工程 3 n
+改张易调 3 i
+改弦易张 3 n
+改弦易调 3 n
+改弦易辙 36 i
+改弦更张 22 i
+改当 3 v
+改往 3 v
+改往修来 3 v
+改征 3 v
+改得 3 v
+改念 3 v
+改性 56 n
+改性剂 3 n
+改性沥青 3 i
+改性纤维 3 l
+改恶为善 3 i
+改恶从善 8 i
+改恶向善 3 i
+改恶行善 3 i
+改悔 21 v
+改成 557 v
+改战 3 v
+改打 3 v
+改扣 3 v
+改扩建 14 j
+改扮 21 v
+改抄 3 v
+改投 3 v
+改换 144 v
+改换头面 3 i
+改换家门 3 i
+改换法 3 i
+改换门庭 17 i
+改换门楣 3 n
+改换门闾 3 n
+改掉 24 v
+改操易节 3 n
+改收 3 v
+改改 3 v
+改政移风 3 n
+改数 3 n
+改旗易帜 3 i
+改日 107 vn
+改日再来 3 i
+改明儿 3 n
+改易 3 vn
+改是成非 3 i
+改曲易调 3 n
+改朝换代 62 i
+改朝换姓 3 i
+改期 12 vn
+改来 3 v
+改来改去 3 i
+改柯易叶 3 i
+改柯易节 3 i
+改校 3 v
+改样 3 v
+改梁换柱 3 i
+改次 3 d
+改正 355 v
+改正缺点 3 i
+改正过来 3 i
+改正错误 3 i
+改步改玉 3 i
+改歼 3 v
+改段 3 n
+改法 3 vn
+改炒 3 v
+改点 3 vn
+改煮 3 v
+改版 62 v
+改版机 3 n
+改玉改步 3 i
+改玉改行 3 i
+改用 390 v
+改由 256 v
+改短 3 v
+改祭 3 v
+改种 15 v
+改租 3 v
+改称 3210 v
+改程 3 n
+改稿 5 v
+改答 3 v
+改签 23 v
+改算 3 v
+改篇 3 v
+改约 3 v
+改线 10 vn
+改练 5 vn
+改组 835 vn
+改编 1005 v
+改编权 2 n
+改编者 6 n
+改编自 3 nz
+改置 3 v
+改而更张 3 i
+改脾气 3 v
+改自 3 v
+改良 788 v
+改良主义 101 n
+改良剂 19 n
+改良品种 3 n
+改良场 3 n
+改良法 3 n
+改良派 69 n
+改良版 3 n
+改良种 3 n
+改色 11 v
+改节 3 vn
+改节易操 3 n
+改葬 3 v
+改行 121 v
+改行为善 3 i
+改行从善 2 i
+改行换业 3 n
+改行自新 3 i
+改行迁善 3 i
+改补 3 v
+改装 1056 v
+改装成 3 v
+改装法 3 n
+改装车 260 n
+改要 3 v
+改观 256 v
+改订 53 v
+改记 3 v
+改说 3 v
+改说是 3 v
+改调 6 v
+改赐 3 v
+改起 3 v
+改轮 3 n
+改辕易辙 3 i
+改辙 3 v
+改过 50 v
+改过不吝 3 v
+改过从善 3 i
+改过作新 3 i
+改过去 3 v
+改过来 3 v
+改过自新 30 i
+改过迁善 13 i
+改进 3234 v
+改进型 354 n
+改进法 3 v
+改进版 3 v
+改选 107 v
+改途 3 n
+改途易辙 3 i
+改造 3846 v
+改造思想 3 i
+改造法 3 n
+改造社会 3 n
+改造费 2 n
+改道 124 v
+改道行驶 3 v
+改邪归正 33 i
+改量 3 vn
+改铸 3 v
+改销 3 vn
+改错 63 v
+改错题 3 n
+改锥 3 n
+改长 3 v
+改队 3 v
+改革 19018 vn
+改革家 33 nz
+改革开放 3 nz
+改革方案 3 n
+改革派 39 nz
+改革者 44 n
+改革调整 3 v
+改频 3 vn
+改食 3 v
+改饲 3 v
+改驶 3 v
+攺 6 zg
+攻 5612 v
+攻上 3 v
+攻上去 3 v
+攻上来 3 v
+攻下 327 v
+攻下去 3 v
+攻下来 3 v
+攻不上 3 v
+攻不下 3 v
+攻不破 3 v
+攻不破地 3 i
+攻丝 3 n
+攻丝机 2 n
+攻人不备 3 i
+攻人之短 3 i
+攻伐 3 v
+攻倒 3 v
+攻克 890 v
+攻克难关 3 n
+攻入 652 v
+攻关 2213 v
+攻关战 3 l
+攻关组 20 n
+攻关项目 3 l
+攻其一点 6 i
+攻其不备 11 i
+攻其无备 17 i
+攻击 5330 v
+攻击力 139 n
+攻击器 3 n
+攻击型 158 n
+攻击性 84 n
+攻击手 3 n
+攻击方式 3 n
+攻击机 237 n
+攻击点 12 n
+攻击素 3 n
+攻击线 3 n
+攻击者 39 n
+攻击能力 16 n
+攻击行为 3 n
+攻击速度 3 n
+攻击面 3 n
+攻到 3 v
+攻势 829 n
+攻占 1001 v
+攻去 3 v
+攻取 243 v
+攻向 3 v
+攻坚 265 vn
+攻坚克难 3 n
+攻坚年 3 n
+攻坚战 94 i
+攻坚能力 3 n
+攻城 3 v
+攻城战 3 n
+攻城掠地 21 i
+攻城炮 4 n
+攻城略地 27 n
+攻城野战 3 i
+攻夺 3 v
+攻子之盾 3 i
+攻守 200 v
+攻守俱佳 3 i
+攻守同盟 11 i
+攻对 3 v
+攻得 3 v
+攻心 80 v
+攻心为上 8 i
+攻心战 3 i
+攻心扼吭 3 l
+攻扑 3 v
+攻打 695 v
+攻抵 3 v
+攻掠 69 v
+攻擂 3 v
+攻无不克 23 i
+攻无不取 3 i
+攻杀 86 v
+攻来 3 v
+攻来攻去 3 i
+攻歼 3 v
+攻略 248 v
+攻疾防患 3 n
+攻研 3 v
+攻破 710 v
+攻篮 3 v
+攻苦茹酸 3 i
+攻苦食俭 3 i
+攻苦食淡 3 l
+攻袭 14 v
+攻讦 54 vn
+攻读 406 v
+攻起 3 v
+攻过 3 v
+攻过去 3 v
+攻过来 3 v
+攻过箴阙 3 nr
+攻进 107 v
+攻进去 3 v
+攻进来 3 v
+攻速 3 v
+攻错 3 v
+攻队 3 n
+攻防 194 v
+攻防兼备 3 l
+攻防战 9 n
+攻陷 363 v
+攼 13 zg
+攽 12 zg
+放 15161 v
+放上 3 v
+放上去 3 v
+放上来 3 v
+放下 734 v
+放下包袱 3 n
+放下去 3 v
+放下屠刀 21 n
+放下架子 3 l
+放不下 3 v
+放不开 3 v
+放之四海而皆准 9 i
+放于 3 v
+放任 131 v
+放任不管 3 l
+放任主义 3 n
+放任政策 3 n
+放任自流 35 i
+放低 3 v
+放倒 3 v
+放债 41 v
+放债者 3 n
+放假 194 v
+放假日 3 l
+放像 3 v
+放像机 3 n
+放僻淫佚 3 i
+放僻邪侈 3 i
+放光 3 v
+放光芒 3 n
+放免 28 v
+放入 998 v
+放入车库 3 n
+放养 351 v
+放养密度 3 n
+放冷枪 3 l
+放冷箭 18 l
+放冷风 3 l
+放出 805 v
+放出去 3 v
+放出系 3 l
+放刁 15 v
+放刁把滥 3 l
+放刁撒泼 3 n
+放刁撤泼 3 z
+放到 1018 v
+放化疗 36 n
+放卫星 3 n
+放去 3 v
+放反 3 v
+放号 21 n
+放向 3 v
+放哨 86 v
+放唱片 3 n
+放回 3 v
+放在 6549 v
+放在心上 3 l
+放在心里 3 i
+放在眼里 306 l
+放在首位 3 l
+放声 554 v
+放声大哭 3 l
+放声歌唱 3 l
+放声高唱 3 l
+放声高歌 3 i
+放大 740 v
+放大器 215 l
+放大率 3 n
+放大系数 3 l
+放大纸 3 n
+放大镜 67 l
+放好 3 v
+放学 164 n
+放完 3 v
+放定 3 v
+放宝 3 n
+放宽 334 v
+放宽心 3 l
+放宽政策 3 l
+放寒假 3 i
+放对 3 v
+放射 495 v
+放射云 3 n
+放射免疫 3 l
+放射出 3 v
+放射出来 3 l
+放射医学 3 n
+放射学 3 n
+放射形 9 n
+放射性 647 n
+放射性元素 90 l
+放射性同 3 l
+放射性束 3 n
+放射性核素 99 l
+放射性物质 4 n
+放射显影 3 n
+放射治疗 2 n
+放射源 17 n
+放射激光 3 n
+放射状 95 n
+放射电泳 3 n
+放射疗法 3 n
+放射病 15 n
+放射科 19 n
+放射线 52 n
+放射线学 3 n
+放射线状 3 n
+放射计 3 n
+放射路 3 n
+放射部 3 n
+放小 15 v
+放尽 3 v
+放屁 276 v
+放屁添风 3 l
+放工 10 v
+放帐 3 v
+放广 3 v
+放开 1003 v
+放开价格 3 l
+放开手 3 l
+放开手脚 3 i
+放开来 3 l
+放开经营 3 l
+放弃 3181 v
+放归 29 v
+放录像 3 n
+放影 3 v
+放影机 3 n
+放得 3 v
+放心 3856 v
+放心不下 3 l
+放心使用 3 l
+放心大胆 3 i
+放心好了 3 l
+放心店 3 n
+放心房 3 n
+放心托胆 3 i
+放心肉 3 n
+放心解体 3 l
+放心起来 3 l
+放怀 3 v
+放恣 3 i
+放情 3 n
+放情丘壑 3 i
+放意肆志 3 l
+放慢 312 v
+放手 523 v
+放手一搏 12 l
+放手不管 3 l
+放手去做 3 i
+放手大干 3 l
+放手放脚 3 i
+放掉 3 v
+放放 3 v
+放散 9 v
+放映 230 v
+放映厅 7 n
+放映员 32 n
+放映室 5 n
+放映师 150 n
+放映机 19 n
+放映队 14 n
+放晴 28 v
+放暑假 3 l
+放暗箭 4 l
+放有 3 v
+放权 41 v
+放来 3 v
+放来放去 3 l
+放松 1266 v
+放松疗法 3 n
+放松要求 3 n
+放榜 11 v
+放款 77 v
+放歌 8 v
+放歌纵酒 3 l
+放毒 32 v
+放气 3 v
+放气孔 3 n
+放气门 3 n
+放气阀 3 l
+放水 99 v
+放油 3 n
+放泼撒豪 3 n
+放洋 3 nrfg
+放活 8 v
+放流 270 v
+放浪 44 v
+放浪不拘 3 i
+放浪不羁 2 i
+放浪形骸 14 i
+放浪无拘 3 i
+放浪无羁 3 i
+放淤 5 v
+放满 3 v
+放火 472 v
+放火烧 3 l
+放火烧山 8 i
+放火防爆 3 l
+放炮 80 n
+放点 3 n
+放烟 3 v
+放烟幕 3 n
+放烟火 3 l
+放热 33 v
+放热反应 3 l
+放焰口 11 n
+放爆竹 3 n
+放牛 61 v
+放牛仔 3 n
+放牛吃草 3 l
+放牛娃 16 n
+放牛归马 3 i
+放牛班 3 v
+放牛郎 3 n
+放牧 280 v
+放牧区 3 n
+放牧地 3 n
+放狗 3 n
+放狗屁 3 n
+放生 67 v
+放生池 3 n
+放电 385 v
+放电影 14 n
+放电灯 3 n
+放电管 3 v
+放疗 306 v
+放盐 3 n
+放盘 3 v
+放眼 260 v
+放眼世界 12 n
+放眼望去 3 i
+放眼看去 2 l
+放眼量 3 l
+放着不用 3 l
+放着不管 3 l
+放矢 3 n
+放程序 2 n
+放稳 3 v
+放空 21 v
+放空枪 2 l
+放空气 3 n
+放空炮 19 l
+放空车 3 n
+放箭 166 n
+放糖 3 v
+放纵 339 v
+放纵不拘 3 i
+放纵不羁 3 l
+放纵驰荡 3 i
+放线 5 n
+放线菌 67 n
+放线菌素 8 n
+放线菌酮 3 n
+放给 3 v
+放缓 108 v
+放缩 2 v
+放置 446 v
+放置不用 3 l
+放置于下 3 l
+放羊 88 v
+放羊吃草 3 i
+放肆 311 d
+放胆 41 v
+放胆去做 3 i
+放能反应 3 l
+放臭屁 3 n
+放荒 3 v
+放荡 104 v
+放荡不羁 52 i
+放荡形骸 3 i
+放虎归山 11 i
+放虎自卫 3 i
+放虎遗患 3 i
+放血 44 v
+放行 295 v
+放言 18 v
+放言遣辞 3 i
+放言高论 5 i
+放话 3 v
+放诞 10 a
+放诞不拘 3 i
+放诞不羁 3 i
+放诞风流 3 i
+放象 3 v
+放账 3 v
+放贷 34 v
+放贷人 4 n
+放赈 3 l
+放走 141 v
+放起 3 v
+放轻 3 v
+放辟淫侈 3 i
+放辟移邪 3 i
+放辟邪侈 3 i
+放达 3 v
+放达不羁 3 l
+放过 473 v
+放过来 3 l
+放进 270 v
+放进去 3 v
+放进来 3 l
+放送 5 v
+放逐 274 v
+放逸 3 v
+放量 138 v
+放钓 3 v
+放错 3 v
+放长 3 v
+放长假 3 n
+放长线 3 n
+放长线钓 3 n
+放长线钓大鱼 12 l
+放青 4 nrfg
+放鞭 3 v
+放鞭炮 3 n
+放音 3 n
+放音机 3 n
+放领 3 v
+放风 34 v
+放风声 3 i
+放风筝 3 n
+放飞 62 v
+放饭流歠 3 v
+放马 3 v
+放马华阳 3 ns
+放马后炮 3 l
+放马奔腾 3 i
+放马过来 3 l
+放高 3 v
+放高利贷 3 n
+放鱼入海 3 i
+放鸽子 3 nz
+放鹰逐犬 3 n
+放龙入海 3 i
+政 3607 n
+政事 814 n
+政事堂 3 n
+政令 138 n
+政令不一 3 l
+政令畅通 3 l
+政以贿成 3 n
+政企 133 j
+政企不分 13 l
+政企分开 3 n
+政体 19865 n
+政党 2469 n
+政党政治 3 n
+政出多门 8 n
+政制 620 n
+政办发 3 j
+政务 1341 n
+政务会 3 n
+政务信息 3 n
+政务司 15 n
+政务委员 3 n
+政务官 9 n
+政务次官 6 n
+政务网 3 n
+政务院 115 n
+政区 354 n
+政协 2695 j
+政协主席 3 n
+政协会议 3 n
+政协全国委员会 16 nt
+政协委员 3 n
+政协常委会 256 nt
+政协提案 3 n
+政发 3 n
+政变 1236 n
+政变者 3 n
+政史 7 n
+政和 41 n
+政和县 2 ns
+政商 3 n
+政团 3 n
+政坛 127 n
+政坛丑闻 3 l
+政大 3 j
+政委 1207 n
+政委会 3 j
+政委员会 3 nt
+政学系 11 n
+政审 43 n
+政客 250 n
+政局 535 n
+政局演变 3 n
+政局稳定 3 n
+政工 335 n
+政工处 4 n
+政工师 3 n
+政工干校 3 n
+政工干部 3 n
+政工组 6 n
+政府 23452 n
+政府公众 3 n
+政府公告 3 n
+政府军 70 n
+政府办 7 n
+政府奖 7 n
+政府网 3 n
+政府职能 3 n
+政府议案 3 n
+政府部门 378 n
+政府门户 3 n
+政府首脑 3 n
+政庞土裂 3 nt
+政德 2 n
+政情 18 n
+政情报导 3 n
+政战 3 n
+政战学校 3 n
+政战官 3 n
+政战部 3 n
+政改 3 j
+政敌 124 n
+政教 81 n
+政教合一 56 l
+政教处 2 n
+政权 5919 n
+政权制度 3 n
+政权建设 3 l
+政权机关 3 n
+政权机构 3 n
+政柄 11 n
+政治 24866 n
+政治事件 3 n
+政治体制 3 n
+政治信仰 3 n
+政治信念 3 n
+政治决断 3 l
+政治动员 3 n
+政治势力 3 n
+政治化 25 n
+政治协商 3 n
+政治协商会议 502 nt
+政治危机 3 l
+政治史 46 n
+政治处 30 n
+政治头脑 3 n
+政治委员 646 n
+政治威慑 3 n
+政治婚姻 3 n
+政治学 357 n
+政治学家 19 n
+政治学系 7 n
+政治宣传 3 l
+政治家 1456 n
+政治局 801 n
+政治局势 3 n
+政治局面 3 n
+政治工作者 4 n
+政治常识 3 n
+政治形势 3 n
+政治思潮 3 n
+政治性 67 n
+政治情报 3 n
+政治指导 4 n
+政治文明 3 n
+政治权 3 n
+政治权利 874 n
+政治气候 3 n
+政治波动 3 n
+政治派别 3 n
+政治流氓 3 n
+政治犯 104 n
+政治理念 3 n
+政治界 3 n
+政治立场 3 n
+政治系 23 n
+政治素质 3 n
+政治纲领 3 n
+政治经济 254 n
+政治经济学 541 n
+政治经济学界 2 n
+政治结论 3 n
+政治统计 3 n
+政治腐败 3 n
+政治舞台 3 n
+政治觉悟 3 n
+政治论文 3 n
+政治试题 3 n
+政治课 15 n
+政治谋略 3 n
+政治责任 3 n
+政治账 4 n
+政治路线 3 n
+政治逃犯 3 n
+政治避难 8 l
+政治部 1813 n
+政治野心 3 n
+政治阴谋 3 n
+政治面目 21 n
+政治面貌 3 n
+政法 414 n
+政法大 3 j
+政法大学 20 nt
+政法委 32 n
+政法委员会 8 nt
+政法学院 3 nt
+政法干部 3 n
+政法界 3 n
+政法系统 3 l
+政法部 3 n
+政法部门 3 n
+政法队伍 3 n
+政派 2 n
+政清人和 3 n
+政清狱简 3 n
+政潮 3 n
+政由己出 3 n
+政界 190 n
+政界人士 3 n
+政略 3 n
+政研会 3 j
+政研室 4 n
+政策 14792 n
+政策主张 3 n
+政策优惠 3 n
+政策史 3 n
+政策底 3 n
+政策性 123 n
+政策措施 3 n
+政策方针 3 n
+政策法规 35 n
+政策法规司 5 n
+政策界限 3 n
+政简刑清 3 i
+政纪 16 n
+政纪处分 3 n
+政纲 70 n
+政经 39 n
+政绩 341 n
+政绩观 5 n
+政群 3 n
+政者 35 n
+政腐 3 n
+政要 112 n
+政见 149 n
+政见会 3 n
+政见发表 3 n
+政论 87 n
+政论家 52 n
+政论文 8 n
+政财界 3 n
+政资 3 n
+政躬 3 v
+政躬康泰 3 n
+政通 2 n
+政通人和 9 n
+政道 3 n
+政闻社 3 n
+政风 13 n
+敀 2 zg
+敁 4 zg
+敁敪 3 z
+敂 3 zg
+敄 20 zg
+故 9727 n
+故世 3 n
+故为 3 c
+故主 3 n
+故习 3 n
+故乡 1406 n
+故乡人 15 n
+故乡情 3 n
+故书 3 n
+故事 5953 n
+故事书 3 n
+故事会 34 n
+故事分析 3 l
+故事员 3 n
+故事性 17 n
+故事情节 3 n
+故事村 3 n
+故事梗概 3 n
+故事片 215 n
+故事片儿 3 n
+故事类 2 n
+故事网 3 n
+故事语法 3 n
+故事集 42 n
+故于 3 c
+故交 18 n
+故亲 3 n
+故人 237 n
+故人之意 3 i
+故今 3 d
+故伎 7 n
+故伎重演 18 i
+故作 194 n
+故作不知 3 i
+故作多情 3 n
+故作姿态 10 l
+故作玄虚 3 i
+故作神秘 3 n
+故作高深 9 n
+故做神秘 3 n
+故入人罪 3 i
+故典 11 n
+故剑情深 2 i
+故去 33 v
+故又名 3 l
+故又称 3 l
+故友 40 n
+故名 3 n
+故名思义 3 n
+故吏 3 n
+故园 29 n
+故国 94 ns
+故国之思 3 l
+故国风光 3 nz
+故土 134 n
+故土难离 4 i
+故土难移 3 i
+故地 148 n
+故地重游 11 n
+故址 53 n
+故垒 5 n
+故城 633 ns
+故城县 4 ns
+故夫 3 n
+故宅 7 n
+故官 9 n
+故实 3 d
+故宫 1303 n
+故宫博物院 520 ns
+故宫禾黍 3 n
+故家乔木 3 nz
+故居 575 n
+故常 3 d
+故弄 3 n
+故弄弦虚 3 i
+故弄玄虚 48 i
+故弄虚玄 3 i
+故往 3 d
+故得名 3 n
+故态 3 n
+故态复作 3 l
+故态复萌 13 i
+故态复还 3 i
+故意 2271 d
+故意伤害 3 n
+故意伤害罪 2 i
+故意杀人罪 16 i
+故意犯罪 3 i
+故我依然 3 i
+故我在 3 l
+故技 22 n
+故技重施 3 n
+故技重演 16 n
+故旧 86 d
+故旧不弃 3 i
+故时 5 c
+故智 10 n
+故曰 3 c
+故此 10 c
+故步自封 8 ns
+故步自画 3 n
+故犯 3 n
+故甚其词 3 i
+故知 35 n
+故离 2 n
+故纸 4 n
+故纸堆 12 n
+故而 171 c
+故计重施 3 n
+故迹 5 n
+故道 4199 n
+故都 51 d
+故里 1483 n
+故里盼 3 i
+故障 533 n
+故障冻结 3 n
+故障包容 3 n
+故障安全 3 n
+故障模拟 3 i
+故障注入 3 n
+故障测试 3 n
+故障率 31 n
+故障矩阵 3 nz
+故障等效 3 n
+故障诊断 3 n
+敇 12 zg
+效 810 n
+效价 10 n
+效仿 129 n
+效力 753 n
+效劳 126 n
+效命 60 n
+效尤 13 n
+效应 2116 n
+效应器 32 n
+效忠 292 n
+效忠国家 3 vn
+效忠祖国 3 nz
+效成 5 v
+效期 3 n
+效果 4924 n
+效果器 3 n
+效果图 8 n
+效果宏大 3 z
+效果律 3 n
+效果显著 3 n
+效死 31 n
+效死勿去 3 z
+效死疆场 3 n
+效死输忠 3 n
+效法 155 n
+效游 3 n
+效犬马力 3 n
+效率 2443 n
+效率源 3 n
+效率高 3 n
+效用 340 n
+效用函数 3 n
+效益 2186 n
+效益型 11 n
+效益工资 3 n
+效益性 2 n
+效益观 3 n
+效能 325 n
+效能型 3 n
+效颦 11 v
+效颦学步 3 v
+效验 31 n
+敉 27 g
+敉平 3 nr
+敊 79 zg
+敋 64 zg
+敌 6610 ng
+敌不住 3 l
+敌不可假 3 l
+敌不可纵 3 i
+敌不过 3 l
+敌人 10175 n
+敌众我寡 43 l
+敌伪 38 n
+敌伪军 6 n
+敌伪政权 3 n
+敌体 3 n
+敌党 3 n
+敌兵 3 n
+敌军 985 n
+敌击我隐 3 i
+敌分我袭 3 i
+敌前敌后 3 l
+敌力角气 3 n
+敌区 5 n
+敌占区 36 n
+敌友 14 n
+敌友不分 3 l
+敌台 74 n
+敌后 704 n
+敌后工作 3 l
+敌后方 3 s
+敌围我散 3 l
+敌国 234 n
+敌国外患 3 n
+敌国通舟 3 n
+敌害 91 n
+敌害敌后 3 n
+敌寇 15 n
+敌对 462 n
+敌对势力 3 n
+敌对态度 3 n
+敌对状态 3 l
+敌对者 18 n
+敌对行为 3 n
+敌对行动 3 n
+敌巢 3 n
+敌师 3 n
+敌强我弱 59 l
+敌得过 3 l
+敌忾 3 i
+敌忾同仇 30 i
+敌情 179 n
+敌情动态 3 n
+敌情观念 3 n
+敌惠敌怨 3 n
+敌意 240 n
+敌我 356 n
+敌我不分 3 l
+敌我矛盾 42 l
+敌手 486 n
+敌探 3 n
+敌敌畏 25 l
+敌方 686 n
+敌机 366 n
+敌杀死 3 l
+敌楼 71 n
+敌火 3 n
+敌焰 3 n
+敌特 13 a
+敌王所忾 3 i
+敌百虫 18 n
+敌穴 2 n
+敌群 7 n
+敌舰 58 n
+敌船 3 n
+敌营 100 n
+敌视 189 n
+敌进我伏 3 l
+敌酋 31 n
+敌队 3 n
+敌阵 115 n
+敎 5 zg
+敏 1357 ag
+敏于事而 3 n
+敏化 6 n
+敏化剂 4 n
+敏度 4 a
+敏快 3 a
+敏惠 3 a
+敏感 1693 a
+敏感作物 3 n
+敏感元件 13 n
+敏感区 5 n
+敏感区域 3 n
+敏感图案 3 n
+敏感度 24 n
+敏感性 125 n
+敏感数据 3 n
+敏感时期 3 n
+敏感期 3 n
+敏感点 5 n
+敏感话题 3 n
+敏感部位 3 n
+敏慧 8 a
+敏捷 443 a
+敏捷地 3 n
+敏捷性 3 n
+敏捷篇 3 n
+敏捷类 3 n
+敏而好学 3 n
+敏达 3 a
+敏锐 431 a
+敏锐地 3 n
+敏锐度 2 n
+敏锐性 7 n
+救 6268 v
+救上去 3 v
+救上来 3 l
+救下 3 v
+救下去 3 l
+救下来 3 l
+救世 47 v
+救世主 74 n
+救世军 7 n
+救世报 3 n
+救世济民 3 n
+救主 3 v
+救亡 111 v
+救亡图存 149 i
+救亡运动 271 l
+救人 548 n
+救人一命 19 i
+救人如救 3 i
+救人者 3 n
+救偏补弊 3 i
+救兵 191 n
+救出 381 v
+救出去 3 v
+救到 3 v
+救助 527 vn
+救助卡 4 v
+救助款 2 v
+救助点 3 n
+救助站 3 n
+救助者 3 n
+救助金 4 n
+救危排险 3 l
+救去 3 v
+救员 3 n
+救命 474 vn
+救命之恩 135 l
+救命恩人 3 n
+救命稻草 42 l
+救命草 3 n
+救命钱 3 n
+救回 3 v
+救回去 3 l
+救回来 3 l
+救困扶危 3 i
+救国 824 n
+救国会 54 nt
+救国军 16 nt
+救国团 259 nt
+救国救民 36 l
+救场 8 n
+救定 3 v
+救市 3 n
+救应 109 vn
+救度 3 n
+救心丸 3 n
+救必应 3 l
+救急 46 vn
+救急扶伤 3 i
+救护 273 v
+救护所 11 n
+救护机 3 n
+救护站 2 n
+救护船 3 n
+救护车 166 n
+救护队 18 n
+救护队员 2 n
+救捞 3 v
+救援 703 vn
+救援军 3 n
+救援船 4 n
+救援船只 3 n
+救援艇 3 n
+救援车 14 n
+救援车辆 3 n
+救援队 10 n
+救援飞机 3 n
+救救 118 v
+救时厉俗 3 i
+救星 105 n
+救来 3 v
+救死扶伤 36 i
+救死扶危 3 i
+救民 3 n
+救民于水火 4 l
+救民水火 22 n
+救治 326 v
+救法 3 n
+救活 154 vn
+救济 571 n
+救济品 7 n
+救济型 3 n
+救济式 2 n
+救济户 3 n
+救济款 19 n
+救济灾民 3 l
+救济粮 27 n
+救济者 3 n
+救济贫民 3 l
+救济费 3 n
+救济金 56 n
+救济院 7 n
+救济难民 3 n
+救溺 3 v
+救火 162 n
+救火员 3 n
+救火扬沸 3 i
+救火投薪 3 i
+救火拯溺 3 v
+救火车 5 n
+救火队 10 n
+救火队员 13 l
+救灾 440 vn
+救灾总会 3 l
+救灾恤患 3 n
+救灾款 16 l
+救灾物资 3 l
+救灾粮 3 n
+救灾通道 3 l
+救焚投薪 3 nr
+救焚拯弱 3 nr
+救焚益薪 3 v
+救燎助薪 3 l
+救物 5 n
+救球 12 n
+救生 162 v
+救生伞 5 n
+救生员 2 n
+救生圈 24 n
+救生带 3 n
+救生筏 2 n
+救生舱 2 n
+救生船 11 n
+救生艇 70 n
+救生衣 19 n
+救生设备 3 n
+救穷 3 v
+救经引足 3 l
+救绝引足 3 i
+救苦 3 v
+救苦弭灾 3 vn
+救苦救难 49 i
+救荒 11 v
+救荒作物 3 l
+救药 6 n
+救贫济弱 3 l
+救赎 3 i
+救起 60 v
+救过不暇 3 i
+救过不给 3 v
+救过不赡 3 n
+救过去 3 l
+救过来 3 l
+救过补阙 3 i
+救醒 3 v
+救险 9 n
+救险队 3 n
+救难 33 n
+救难船 3 l
+救难解危 3 i
+救饥拯溺 3 v
+救驾 43 v
+敓 245 zg
+敔 6 zg
+敕 862 ng
+敕书 3 n
+敕令 119 n
+敕勒 11 ns
+敕勒川 7 ns
+敕勒歌 9 n
+敕命 3 n
+敕始毖终 3 vn
+敕封 3 ns
+敕授 3 n
+敖 167 nr
+敖不可长 3 nr
+敖世轻物 3 nz
+敖包 43 nr
+敖广 4 nr
+敖德萨 37 nr
+敖汉旗 10 nr
+敖秀才 2 nr
+敖闰 7 nr
+敖闰之 2 nr
+敖陶孙 2 nr
+敖顺 9 nr
+敗 17 zg
+教 12172 v
+教一识百 3 l
+教上 3 n
+教下 3 n
+教下去 3 v
+教与学 3 n
+教主 2396 n
+教义 527 n
+教习 85 vn
+教书 297 n
+教书先生 3 n
+教书匠 10 n
+教书电话 3 n
+教书育人 53 n
+教亦多术 3 l
+教人 3 n
+教代会 3 n
+教令 3 n
+教仪 18 n
+教众 268 n
+教会 1065 n
+教会学校 3 n
+教会法规 3 n
+教体局 3 n
+教你做 3 l
+教你用 3 n
+教儿婴孩 3 n
+教具 23 n
+教具室 3 n
+教养 284 n
+教养员 3 n
+教养所 25 n
+教养有方 3 n
+教养院 3 n
+教出 3 v
+教务 358 n
+教务主任 3 n
+教务会议 3 n
+教务处 32 n
+教务科 3 n
+教务组 3 n
+教务部 3 n
+教务长 68 n
+教化 185 vn
+教区 119 n
+教区牧师 3 n
+教区长 3 n
+教参 3 n
+教友 26 n
+教名 3 n
+教员 289 n
+教唆 49 v
+教唆犯 16 n
+教唆罪 3 n
+教唆者 2 n
+教团 51 n
+教场 42 n
+教坊 110 n
+教坏 3 v
+教坛 7 n
+教堂 1364 n
+教士 275 n
+教头 209 n
+教女 3 n
+教妇初来 3 t
+教委 202 n
+教委会 3 n
+教子 36 n
+教子有方 8 n
+教学 4025 n
+教学不倦 3 i
+教学中心 3 n
+教学仪器 7 n
+教学信息 4 n
+教学光盘 3 n
+教学内容 22 n
+教学区 4 n
+教学大楼 3 n
+教学大纲 3 n
+教学实验 7 n
+教学情况 3 n
+教学提纲 3 n
+教学改革 3 l
+教学效果 8 n
+教学方式 10 n
+教学方法 18 n
+教学服务 4 n
+教学材料 3 n
+教学检查 3 n
+教学楼 97 n
+教学模式 26 n
+教学法 41 n
+教学活动 21 n
+教学点 31 n
+教学片 6 n
+教学版 3 n
+教学特点 3 n
+教学班 41 n
+教学相长 6 n
+教学研究 3 n
+教学科研 8 n
+教学秩序 3 vn
+教学策略 3 n
+教学管理 3 n
+教学系统 5 n
+教学网 9 n
+教学要求 4 n
+教学计划 3 n
+教学设备 10 n
+教学设施 3 n
+教学评估 3 n
+教学质量 102 n
+教学资料 2 n
+教学资源 6 n
+教学赛 3 n
+教学软件 6 n
+教学辅导 3 n
+教学进度 3 n
+教学部 3 n
+教学风格 3 n
+教完 3 v
+教宗 9 n
+教官 221 n
+教官室 3 n
+教室 664 n
+教导 600 n
+教导员 36 n
+教导团 15 n
+教导处 3 n
+教导师 2 n
+教导有方 3 n
+教导法 3 n
+教导队 16 n
+教局 3 n
+教工 20 vn
+教工宿舍 3 n
+教工路 3 n
+教师 6642 n
+教师团 2 n
+教师工资 3 n
+教师应 3 n
+教师报 3 n
+教师法 6 n
+教师爷 7 n
+教师版 3 n
+教师网 3 n
+教师职业 3 n
+教师节 18 n
+教师计算机 2 n
+教师论文 3 n
+教师证 2 j
+教师资格 3 n
+教师队伍 3 n
+教席 3 n
+教廷 150 n
+教徒 628 n
+教惯 3 n
+教成 3 v
+教我如何 3 l
+教战 3 vn
+教授 7419 n
+教授法 3 n
+教授级 2 n
+教改 77 v
+教改措施 3 n
+教改方案 3 n
+教教 3 n
+教无常师 3 n
+教旨 3 n
+教本 34 n
+教权 3 n
+教材 1439 n
+教材内容 2 n
+教材科 3 n
+教材费 3 n
+教条 116 n
+教条主义 188 n
+教条主义者 25 n
+教条化 54 n
+教条式 7 n
+教案 76 n
+教案设计 3 n
+教案集 3 n
+教桌 3 n
+教母 13 n
+教民 129 n
+教法 292 n
+教派 401 n
+教派主义 3 n
+教点 3 n
+教父 92 n
+教猱升木 3 nz
+教理 30 vn
+教画 3 n
+教皇 448 n
+教皇国 29 n
+教皇统治 3 n
+教益 90 n
+教研 83 vn
+教研员 12 n
+教研室 135 n
+教研组 26 n
+教研网 3 n
+教研部 2 nt
+教祖 16 n
+教科 14 n
+教科书 466 n
+教科室 3 n
+教科所 12 j
+教科文 61 n
+教科文卫 2 n
+教科文卫体 2 n
+教科文卫委员会 10 nt
+教科文组织 4 nt
+教科文部 3 nt
+教科研 3 n
+教科网 3 n
+教科院 3 nt
+教程 117 n
+教管 3 vn
+教练 1665 vn
+教练员 177 n
+教练室 3 n
+教练席 18 n
+教练机 316 n
+教练组 142 n
+教练船 3 n
+教练车 3 n
+教给 131 vn
+教统 3 n
+教职 53 n
+教职人员 3 n
+教职员 180 n
+教职员工 46 n
+教职工 189 n
+教育 23961 vn
+教育业 2 n
+教育为本 4 n
+教育会 47 n
+教育体制 3 n
+教育化 3 n
+教育厅 383 n
+教育厅长 3 z
+教育史 41 n
+教育司 11 n
+教育培养 3 n
+教育处 30 n
+教育大业 3 n
+教育奖 3 n
+教育学 143 n
+教育学员 3 n
+教育学家 12 n
+教育室 3 n
+教育家 155 n
+教育局 226 n
+教育局长 3 n
+教育展 5 n
+教育工作者 80 n
+教育引导 3 n
+教育性 8 n
+教育战线 3 n
+教育批评 3 n
+教育挽救 3 i
+教育方针 3 n
+教育权 26 n
+教育法 46 n
+教育片 16 n
+教育班 5 n
+教育界 95 n
+教育疏导 3 n
+教育瘫痪 3 v
+教育社 66 n
+教育科 8 n
+教育科学文化卫生委员会 513 nt
+教育系 11 n
+教育经费 3 n
+教育网 51 n
+教育网络 6 n
+教育者 55 n
+教育观 25 n
+教育规划 3 n
+教育论 9 n
+教育说服 3 n
+教育课 15 n
+教育费 18 n
+教育资源 23 n
+教育转化 3 n
+教育软件 3 n
+教育部 1216 n
+教育部党组 2 n
+教育部学生司 2 n
+教育部考试中心 15 n
+教育部长 27 n
+教育部门 110 n
+教育部高校学生司 11 n
+教育长 31 n
+教育领域 8 n
+教育馆 4 n
+教范 3 vn
+教规 61 n
+教训 2207 vn
+教训法 3 n
+教诫 3 vn
+教诲 275 v
+教课 31 n
+教谕 41 n
+教辅 25 n
+教辅书 3 n
+教过来 3 l
+教运 3 n
+教错 3 n
+教长 39 n
+教门 3 n
+教院 3 n
+教鞭 24 n
+教龄 12 n
+敚 2 zg
+敛 479 zg
+敛后疏前 3 i
+敛声匿迹 3 i
+敛声屏息 3 i
+敛声屏气 9 i
+敛容 3 v
+敛容屏气 3 i
+敛影逃形 3 i
+敛怨求媚 3 i
+敛息屏声 3 i
+敛手屏足 3 i
+敛手待毙 3 i
+敛步 3 v
+敛聚 2 v
+敛色 3 v
+敛色屏气 3 i
+敛衣 3 v
+敛衽 17 v
+敛财 69 v
+敛足 3 v
+敛迹 9 v
+敛钱 2 v
+敛锷韬光 3 nrfg
+敛骨吹魂 3 i
+敜 9 zg
+敝 830 r
+敝友 3 n
+敝国 3 r
+敝塞 3 n
+敝处 39 s
+敝姓 3 n
+敝屣 5 n
+敝履 3 n
+敝帚千金 3 i
+敝帚自享 3 i
+敝帚自珍 3 i
+敝帷不弃 3 i
+敝开 3 n
+敝徙 3 n
+敝旧 3 n
+敝盖不弃 3 i
+敝綈恶粟 3 n
+敝绨恶粟 3 nr
+敝美扬恶 3 i
+敝舍 3 n
+敝衣枵腹 3 v
+敝衣粝食 3 vn
+敝邑 3 n
+敝邦 3 n
+敝鼓丧豚 3 n
+敞 277 v
+敞亮 27 v
+敞口 2 v
+敞开 653 v
+敞开供应 3 n
+敞开大门 3 n
+敞开式 10 b
+敞开思想 3 n
+敞着 3 v
+敞篷 10 b
+敞篷版 3 n
+敞篷车 5 n
+敞胸露怀 3 n
+敞蓬车 3 n
+敞车 3 v
+敞露 3 v
+敟 15 zg
+敠 6 zg
+敢 7965 v
+敢上去 3 v
+敢上来 3 v
+敢不承命 3 l
+敢不敢 3 d
+敢为人 3 i
+敢为人先 6 i
+敢为天下先 8 i
+敢为敢做 3 i
+敢争 3 n
+敢于 942 v
+敢于创新 3 l
+敢于斗争 3 l
+敢于胜利 3 i
+敢付 3 v
+敢作 3 n
+敢作敢为 45 l
+敢作敢当 15 l
+敢保 3 v
+敢借 3 v
+敢做敢为 5 i
+敢做敢当 3 l
+敢写 3 v
+敢出 3 v
+敢出去 3 i
+敢刻 3 n
+敢劝 3 v
+敢动 3 n
+敢勇当先 3 i
+敢吓 3 v
+敢告 3 n
+敢唱 3 v
+敢唸 3 v
+敢喊 3 v
+敢喝 3 v
+敢坐 3 v
+敢奏 3 n
+敢嫌 3 v
+敢守 3 v
+敢射 3 v
+敢干 3 n
+敢弹 3 n
+敢当 66 d
+敢念 3 n
+敢怒不敢 3 i
+敢怒不敢言 10 i
+敢怒敢言 3 i
+敢怒而不 3 l
+敢怒而不敢言 16 i
+敢情 103 n
+敢情是 3 n
+敢想敢干 3 l
+敢想敢说 3 l
+敢打敢拼 3 v
+敢扯 3 v
+敢找 3 v
+敢把皇帝拉下马 5 n
+敢抓 3 v
+敢拆 3 v
+敢拜 3 v
+敢接 3 v
+敢揍 3 v
+敢摆 3 n
+敢撤 3 v
+敢收 3 v
+敢死 31 v
+敢死队 76 n
+敢死队员 3 n
+敢洗 3 v
+敢演 3 n
+敢点 3 n
+敢爱敢恨 3 i
+敢现 3 v
+敢用 3 n
+敢画 3 n
+敢留 3 v
+敢管 3 n
+敢练 3 n
+敢肯定 3 z
+敢背 3 n
+敢花 3 n
+敢言 3 n
+敢讲 3 v
+敢设 3 v
+敢试 3 v
+敢说敢做 3 i
+敢说话 3 l
+敢请 3 v
+敢谈 3 v
+敢躺 3 v
+敢输 3 v
+敢过去 3 l
+敢过来 3 l
+敢问路 3 n
+敢闹 3 v
+敢陪 3 v
+敢骂 3 v
+敢骑 3 n
+散 5634 v
+散乱 212 v
+散了架 3 v
+散仙 6 n
+散件 12 n
+散伙 56 n
+散伙饭 3 n
+散会 67 n
+散伤丑害 3 i
+散体 31 n
+散佚 105 v
+散修 7 v
+散光 32 n
+散光眼镜 3 n
+散光镜 3 n
+散兵 35 n
+散兵坑 3 n
+散兵壕 3 n
+散兵游勇 23 i
+散兵线 4 n
+散养 5 v
+散出 3 v
+散剂 23 n
+散去 3 v
+散发 803 v
+散发传单 3 n
+散发出 3 n
+散发性 7 n
+散土 3 n
+散场 41 n
+散失 115 v
+散失到 3 v
+散套 3 n
+散学 3 n
+散客 106 n
+散射 359 v
+散射体 3 n
+散射光 39 n
+散射截面 3 n
+散射矩阵 3 i
+散射系数 3 n
+散射角 3 n
+散射辐射 3 n
+散射长度 3 n
+散尾葵 3 n
+散居 195 v
+散工 7 n
+散布 585 v
+散布开 3 n
+散布者 3 n
+散帙 3 n
+散带衡门 3 n
+散席 17 n
+散座 8 n
+散开 278 v
+散弹 3 n
+散弹枪 3 n
+散心 62 n
+散慢 3 a
+散戏 3 n
+散户 29 n
+散手 25 v
+散打 40 v
+散掉 3 v
+散摊 3 v
+散摊子 3 n
+散播 96 vn
+散播谣言 3 i
+散放 25 v
+散散 3 v
+散散心 69 n
+散散步 25 n
+散散漫漫 3 n
+散文 887 n
+散文体 11 n
+散文化 10 n
+散文家 62 n
+散文式 3 n
+散文热 2 n
+散文诗 42 n
+散文随笔 3 n
+散文集 89 n
+散曲 98 n
+散朴 3 a
+散杂货 3 n
+散来 3 v
+散来散去 3 i
+散板 10 n
+散架 30 n
+散步 336 n
+散步区 3 n
+散步道 3 n
+散水 267 n
+散沙 5 n
+散淡 21 a
+散漫 105 v
+散灰扃户 3 vn
+散点图 3 v
+散点石 3 n
+散热 156 v
+散热器 51 n
+散热片 9 n
+散热装置 3 n
+散热量 11 n
+散焦 3 v
+散班 3 v
+散瞳 8 v
+散瞳药 3 n
+散碎 44 v
+散结 28 v
+散置 3 v
+散股 3 n
+散花 3 n
+散荡 3 v
+散落 217 v
+散裂产物 3 n
+散装 74 v
+散装白酒 3 n
+散装船 3 n
+散装货 3 n
+散见 19 v
+散见于 45 v
+散言碎语 2 i
+散记 12 n
+散财 3 v
+散货 295 n
+散货船 17 n
+散转 3 v
+散过去 3 v
+散过来 3 v
+散逸 6 v
+散酒 3 n
+散钱 3 v
+散闷 3 v
+散闷消愁 3 i
+散阵投巢 3 i
+散页 3 n
+散马休牛 3 n
+敤 157 zg
+敥 12 zg
+敦 254 ns
+敦世厉俗 3 v
+敦伦 3 ns
+敦促 236 v
+敦促者 3 nt
+敦刻尔克 31 n
+敦劝 8 ns
+敦勉 3 a
+敦化 9 ns
+敦化北路 3 ns
+敦化南路 3 ns
+敦化国中 3 nt
+敦化国小 3 nt
+敦化市 5 ns
+敦厚 68 a
+敦品力学 3 nt
+敦实 14 a
+敦敦 2 ns
+敦敦实实 3 z
+敦本务实 3 n
+敦朴 4 a
+敦煌 774 ns
+敦煌学 67 nt
+敦煌市 26 ns
+敦煌文物研究所 6 nt
+敦煌机场 3 ns
+敦煌火车站 4 nt
+敦煌石窟 40 ns
+敦煌研究院 7 nt
+敦煌艺术研究所 5 nt
+敦睦 3 a
+敦聘 3 v
+敦诗说礼 3 n
+敦请 17 v
+敦豪 13 n
+敦锅 3 n
+敦雷 5 ns
+敦风历俗 3 n
+敦风厉俗 3 v
+敦默寡言 3 n
+敧 9 zg
+敨 2 zg
+敩 10 zg
+敩学相长 3 nz
+敫 34 g
+敬 1408 v
+敬一丹 3 nr
+敬上 3 v
+敬上接下 3 i
+敬上爱下 3 l
+敬业 380 n
+敬业乐群 3 n
+敬业精神 3 n
+敬义皇帝 2 nr
+敬事 3 v
+敬事不暇 3 i
+敬事后食 3 i
+敬亭山 2 nr
+敬亭绿 2 nr
+敬仰 300 nr
+敬体 3 n
+敬佩 257 nr
+敬修堂 2 nr
+敬候 3 n
+敬候佳音 3 nr
+敬其师 2 nr
+敬启 3 nr
+敬启者 3 nr
+敬呈 3 nr
+敬告 4 v
+敬善言 2 nr
+敬天法 10 nr
+敬天爱 2 nr
+敬天爱民 3 nr
+敬天鉴 2 nr
+敬奉 33 nr
+敬奠瀛 2 nr
+敬如上宾 3 i
+敬姜犹绩 3 nr
+敬守良藏 3 nr
+敬小慎微 3 nr
+敬师金 3 nr
+敬德保 2 nr
+敬德夺 2 nr
+敬恭桑梓 3 nr
+敬悉 3 v
+敬意 265 v
+敬慕 33 v
+敬慕者 3 nr
+敬拜 3 v
+敬挽 3 nr
+敬授人时 3 i
+敬授民时 3 l
+敬时爱日 3 nr
+敬服 46 v
+敬来敬去 3 i
+敬烟 2 nr
+敬爱 120 nr
+敬献 187 nr
+敬王修 2 nr
+敬畏 295 nr
+敬皇后 13 nr
+敬礼 175 nr
+敬祈指导 3 nr
+敬祝 14 nr
+敬神 22 nr
+敬神佛 2 nr
+敬称 7 v
+敬终慎始 3 i
+敬老 25 nr
+敬老养老 2 nr
+敬老尊贤 3 nr
+敬老怜贫 3 l
+敬老恤贫 3 n
+敬老慈少 3 l
+敬老慈幼 3 nr
+敬老慈穉 3 nr
+敬老爱幼 3 nr
+敬老院 45 nr
+敬而远之 48 i
+敬致 3 v
+敬苍牵黄 3 i
+敬若天 9 nr
+敬若天神 2 nr
+敬若神明 10 nr
+敬茶 12 nr
+敬视 3 v
+敬诚殿 2 nr
+敬语 5 nr
+敬请 131 v
+敬请光临 3 nr
+敬请函复 3 nr
+敬请原谅 3 nr
+敬请批评 3 n
+敬请指教 3 n
+敬请期待 3 i
+敬请笑纳 3 nr
+敬谢 3 v
+敬谢不敏 5 nr
+敬谢居士 2 nr
+敬谨亲王 2 nr
+敬贤下士 3 nr
+敬贤爱士 3 nr
+敬贤礼 2 nr
+敬贤礼士 3 nr
+敬贤重士 3 nr
+敬贺 4 nr
+敬赠 3 v
+敬轩会 2 nr
+敬轩将军 6 nr
+敬辞 3 v
+敬送 3 v
+敬邢傻 2 nr
+敬酒 211 v
+敬酒不吃吃罚酒 16 i
+敬重 502 v
+敬陈管见 3 nr
+敬陪末座 3 nr
+敬香 26 nr
+敬鬼神而 3 i
+敬鬼神而远之 7 i
+敭 6 zg
+敮 93 zg
+敯 111 zg
+数 10689 n
+数一下 5 m
+数一半 2 m
+数一数 12 m
+数一数二 76 m
+数一点二六倍 2 m
+数一点五四倍 2 m
+数一遍 2 m
+数万 587 m
+数万两 6 m
+数万亩 4 m
+数万人 3 n
+数万亿美元 3 m
+数万件 2 m
+数万份 2 m
+数万余 2 m
+数万元 24 m
+数万匹 2 m
+数万口 8 m
+数万只 8 m
+数万名 16 m
+数万吨 6 m
+数万家 5 m
+数万年 7 m
+数万户 6 m
+数万斤 6 m
+数万条 9 m
+数万道 3 m
+数万里 16 m
+数万顶 3 m
+数万顷 3 m
+数丈 418 m
+数上去 3 l
+数上来 3 l
+数下 72 m
+数不上 3 l
+数不到 3 l
+数不尽 3 l
+数不清 3 l
+数不着 3 l
+数不胜数 73 l
+数不铜 3 n
+数东瓜 3 n
+数两千零七十一万六千零三十七户 2 m
+数个 173 m
+数乍 3 i
+数乙数二 3 n
+数九 18 m
+数九严寒 3 i
+数九天气 3 i
+数九寒冬 2 n
+数九寒天 6 i
+数二 3 m
+数二亿三千二百三十五万余两 2 m
+数亩 6 m
+数人 3 n
+数亿 19 m
+数亿个 2 m
+数亿元 8 m
+数亿次 2 m
+数亿美元 4 m
+数代 37 n
+数以万计 105 l
+数以万订 3 n
+数以亿计 18 l
+数以十万计 9 l
+数以千万计 15 i
+数以千计 91 l
+数以卡计 3 l
+数以百万计 22 i
+数以百计 53 l
+数件 16 n
+数份 4 n
+数伏 3 j
+数众 3 n
+数众多 2 l
+数传 25 n
+数位 54 n
+数位化 3 n
+数位器 3 n
+数位显示 3 n
+数位泛 3 n
+数例 9 n
+数倍 167 m
+数借 3 v
+数值 594 n
+数值串 3 n
+数值孔径 3 n
+数值字 3 n
+数值数据 2 n
+数值码 3 n
+数值积分 15 n
+数值通信 3 n
+数公里 20 m
+数具 4 n
+数典忘祖 15 n
+数出 26 m
+数刀 18 n
+数分 21 m
+数分之差 3 l
+数分钟 41 m
+数列 130 m
+数则 10 n
+数制 17 n
+数匹 6 m
+数十 610 m
+数十万 286 m
+数十万万 128 m
+数十万两 3 m
+数十万个 4 m
+数十万亩 6 m
+数十万件 2 m
+数十万元 14 m
+数十万只 3 m
+数十万名 3 m
+数十万吨 2 m
+数十万头 2 m
+数十万平方公里 2 m
+数十万年 6 m
+数十万户 2 m
+数十万担 2 m
+数十万斤 3 m
+数十万根 2 m
+数十万美元 2 m
+数十万路 2 m
+数十丈 158 m
+数十下 5 m
+数十个 385 m
+数十二倍 2 m
+数十亩 3 m
+数十亿 7 m
+数十亿元 14 m
+数十亿年 3 m
+数十亿美元 23 m
+数十代 3 m
+数十件 10 m
+数十位 24 m
+数十余 3 m
+数十余载 2 m
+数十倍 22 m
+数十公里 12 m
+数十公顷 2 m
+数十具 6 m
+数十册 2 m
+数十刀 2 m
+数十分钟 8 m
+数十匹 18 m
+数十千克 2 m
+数十千米 20 m
+数十卷 2 m
+数十厘米 12 m
+数十口 16 m
+数十句 3 m
+数十只 29 m
+数十台 3 m
+数十名 178 m
+数十吨 8 m
+数十员 9 m
+数十味 3 m
+数十回 3 m
+数十圈 2 m
+数十场 6 m
+数十块 10 m
+数十声 3 m
+数十处 18 m
+数十天 8 m
+数十头 11 m
+数十套 6 m
+数十家 42 m
+数十对 3 m
+数十尊 4 m
+数十尺 7 m
+数十层 2 m
+数十年 622 m
+数十年如一日 6 l
+数十座 19 m
+数十张 7 m
+数十户 6 m
+数十所 2 m
+数十把 4 m
+数十招 95 m
+数十支 9 m
+数十斤 12 m
+数十日 17 m
+数十朵 3 m
+数十条 39 m
+数十枚 37 m
+数十枝 5 m
+数十枪 3 m
+数十架 19 m
+数十株 3 m
+数十根 14 m
+数十次 37 m
+数十款 3 m
+数十步 44 m
+数十毫瓦 2 m
+数十片 3 m
+数十百 3 m
+数十盆 3 m
+数十种 54 m
+数十秒 4 m
+数十篇 27 m
+数十米 54 m
+数十粒 3 m
+数十级 2 m
+数十股 3 m
+数十艘 13 m
+数十行 2 m
+数十起 3 m
+数十载 19 m
+数十辆 12 m
+数十遍 8 m
+数十道 6 m
+数十遭 2 m
+数十部 11 m
+数十里 98 m
+数十门 8 m
+数十间 5 m
+数十面 3 m
+数十页 3 m
+数十项 9 m
+数十颗 12 m
+数十首 2 m
+数千 542 m
+数千万 43 m
+数千万元 6 m
+数千万美元 9 m
+数千丈 2 m
+数千两 4 m
+数千个 12 m
+数千亩 2 m
+数千亿 4 m
+数千亿港元 4 m
+数千亿美元 2 m
+数千件 12 m
+数千伏 2 m
+数千位 8 m
+数千倍 2 m
+数千元 30 m
+数千公里 12 m
+数千匹 4 m
+数千千米 15 m
+数千卷 2 m
+数千口 2 m
+数千只 131 m
+数千台 3 m
+数千名 81 m
+数千吨 6 m
+数千团 2 m
+数千头 6 m
+数千套 2 m
+数千家 18 m
+数千对 8 m
+数千幅 3 m
+数千平方公里 2 m
+数千平方米 2 m
+数千年 288 m
+数千招 2 m
+数千数万 2 m
+数千数万次 2 m
+数千斤 4 m
+数千条 3 m
+数千枚 2 m
+数千架 2 m
+数千株 6 m
+数千根 2 m
+数千毫克 2 m
+数千海里 2 m
+数千片 3 m
+数千百面 2 m
+数千种 10 m
+数千篇 2 m
+数千米 37 m
+数千辆 8 m
+数千道 3 m
+数千里 69 m
+数千顷 4 m
+数千颗 2 m
+数卷 6 m
+数厘米 7 m
+数叉 3 n
+数发 9 n
+数口 22 n
+数句 15 m
+数叨 3 v
+数只 47 m
+数台 9 n
+数叶 4 n
+数名 56 m
+数吨 7 m
+数员 12 n
+数周 48 m
+数周后 3 n
+数品 2 n
+数响 16 n
+数四 4 m
+数回 2 m
+数国 3 n
+数圈 10 m
+数场 13 n
+数块 13 n
+数声 151 m
+数处 45 m
+数多 44 m
+数夜 2 m
+数夜未归 3 i
+数天 87 m
+数头 6 n
+数套 2 m
+数字 4670 n
+数字串 3 n
+数字传输 3 l
+数字信号 3 n
+数字信息 3 n
+数字化 369 n
+数字化仪 2 n
+数字卡 3 n
+数字图书 2 n
+数字图像 7 n
+数字图像处理 5 l
+数字地图 3 n
+数字地球 2 n
+数字型 3 n
+数字家庭 3 n
+数字式 87 n
+数字影像 3 n
+数字手机 3 n
+数字控制 3 n
+数字机 2 n
+数字模型 3 n
+数字模拟 7 i
+数字水印 6 n
+数字滤波 3 n
+数字电 6 n
+数字电视 3 l
+数字电话 3 n
+数字电路 3 n
+数字相机 3 n
+数字签名 2 n
+数字编码 2 n
+数字网 7 n
+数字视频 3 n
+数字计领 3 n
+数字证书 3 n
+数字通信 3 n
+数字通讯 3 n
+数字钟 3 n
+数字键 3 n
+数字键盘 3 n
+数字镶嵌 3 v
+数字音频 3 n
+数学 5993 n
+数学二 3 n
+数学公式 3 n
+数学分俘 3 n
+数学分析 3 l
+数学力学系 3 n
+数学原理 3 n
+数学原透 3 n
+数学史 3 n
+数学四 3 n
+数学家 1006 n
+数学教师 3 n
+数学教案 3 n
+数学方法 3 n
+数学模型 3 n
+数学模垠 3 l
+数学模拟 3 i
+数学界 3 n
+数学知识 3 n
+数学科 4 n
+数学秒 3 n
+数学系 86 n
+数学组 3 n
+数学网 3 n
+数学老师 3 n
+数学考试 3 n
+数学计算 23 n
+数学论文 3 n
+数学试卷 3 n
+数学试题 3 n
+数学课 22 n
+数学课程 3 n
+数学题 37 n
+数完 3 v
+数家 50 n
+数家珍 3 n
+数寸 150 m
+数封 3 m
+数尺 175 m
+数尾 3 n
+数层 33 n
+数岁 9 m
+数峰 5 n
+数席 2 n
+数幅 4 n
+数平方公里 2 m
+数年 636 m
+数年如一 2 l
+数年如一日 2 l
+数度 87 n
+数座 17 m
+数张 8 m
+数往知来 3 l
+数很多 18 m
+数得上 3 l
+数得着 8 l
+数息 3 n
+数成 2 m
+数战 3 n
+数户 2 n
+数所 22 n
+数批 6 m
+数担 2 n
+数招 310 m
+数拳 5 n
+数据 5232 n
+数据业务 3 n
+数据中心 32 n
+数据交换 3 i
+数据交换机 8 n
+数据仓库 9 n
+数据传输 3 l
+数据位 12 n
+数据保护 14 n
+数据信号 8 n
+数据偏斜 3 n
+数据共享 10 i
+数据分布 4 n
+数据分析 68 l
+数据分析系统 2 n
+数据包 29 n
+数据压缩 3 l
+数据处理 117 n
+数据处理系统 17 l
+数据备份 6 n
+数据字 3 n
+数据安全 9 n
+数据完整性 2 l
+数据库 625 n
+数据库安全 4 n
+数据库机 8 n
+数据库管理员 4 n
+数据库系统 19 n
+数据座 3 n
+数据录入 2 n
+数据总线 28 n
+数据恢复 2 l
+数据报表 3 n
+数据抽象 2 i
+数据挖掘 8 n
+数据文件 3 n
+数据服务 3 n
+数据机 3 n
+数据格式 7 n
+数据检索 3 n
+数据模型 3 n
+数据武器 3 n
+数据流 41 n
+数据测试 3 n
+数据源 3 n
+数据王 3 n
+数据管理 16 n
+数据类型 9 n
+数据系统 22 n
+数据线 9 n
+数据组织 5 n
+数据终端 3 n
+数据结构 57 n
+数据编码 3 n
+数据网 14 n
+数据网络 3 n
+数据舱 3 n
+数据表 6 n
+数据表示 6 n
+数据误差 3 n
+数据资料 3 n
+数据通 5 n
+数据通信 44 n
+数据通讯 3 n
+数据通路 3 n
+数据通道 4 n
+数据量 3 n
+数据链 140 n
+数据项 10 n
+数排 4 m
+数控 145 j
+数控技术 3 n
+数控机床 3 n
+数控机械 3 n
+数控系统 9 n
+数控车床 3 n
+数控铣 3 nz
+数摸 3 v
+数支 12 m
+数数 27 n
+数数儿 3 m
+数数兼 3 i
+数数看 3 l
+数斗 9 n
+数斤 3 m
+数方 3 n
+数日 785 m
+数日一次 2 m
+数日之久 3 m
+数日里 2 m
+数易其稿 3 n
+数星星 2 n
+数显 2 v
+数显式 3 n
+数显表 3 n
+数最多 3 z
+数月 408 m
+数本 9 n
+数术 69 n
+数朵 12 n
+数杆 2 n
+数束 2 n
+数条 57 m
+数来宝 20 n
+数来数去 3 l
+数杯 42 m
+数枚 30 m
+数枝 3 n
+数枪 16 n
+数架 27 n
+数株 7 m
+数根 15 m
+数桌 3 n
+数模 3 n
+数模转换 2 i
+数次 629 m
+数次回 2 m
+数次派 3 m
+数次行 2 m
+数步 233 m
+数段 14 n
+数毫米 3 m
+数派 3 n
+数源科技 7 n
+数滴 8 m
+数点 25 n
+数片 9 m
+数珠 18 n
+数班 4 n
+数球 3 n
+数理 345 n
+数理化 29 n
+数理哲学 3 nz
+数理学 5 n
+数理系 7 n
+数理经济 3 n
+数理经济学 27 n
+数理统计 3 n
+数理网 3 n
+数理逻辑 3 n
+数番 10 m
+数白论黄 3 n
+数百 479 m
+数百万 122 m
+数百万两 2 m
+数百万个 2 m
+数百万亩 3 m
+数百万人次 3 m
+数百万元 15 m
+数百万册 3 m
+数百万口 3 m
+数百万台 2 m
+数百万名 2 m
+数百万吨 5 m
+数百万头 2 m
+数百万平方米 3 m
+数百万年 9 m
+数百万美元 26 m
+数百万股 2 m
+数百万项 4 m
+数百丈 13 m
+数百两 7 m
+数百个 53 m
+数百亩 6 m
+数百人 3 n
+数百亿 9 m
+数百亿元 5 m
+数百亿美元 3 m
+数百件 9 m
+数百份 2 m
+数百位 14 m
+数百余 3 m
+数百倍 4 m
+数百元 15 m
+数百公斤 2 m
+数百公里 25 m
+数百具 5 m
+数百分 2 m
+数百匹 3 m
+数百千 2 m
+数百千米 19 m
+数百卷 3 m
+数百双 2 m
+数百口 4 m
+数百只 20 m
+数百台 3 m
+数百名 151 m
+数百吨 3 m
+数百员 3 m
+数百处 4 m
+数百头 5 m
+数百套 2 m
+数百家 19 m
+数百对 4 m
+数百封 2 m
+数百岁 2 m
+数百帐 2 m
+数百幢 2 m
+数百平方米 2 m
+数百年 277 m
+数百座 11 m
+数百张 6 m
+数百户 4 m
+数百招 12 m
+数百支 2 m
+数百斤 21 m
+数百本 2 m
+数百朵 2 m
+数百条 16 m
+数百枚 9 m
+数百枝 4 m
+数百架 13 m
+数百架次 2 m
+数百株 5 m
+数百根 2 m
+数百次 13 m
+数百步 21 m
+数百毫升 2 m
+数百瓦 2 m
+数百盆 2 m
+数百盏 2 m
+数百磅 2 m
+数百种 31 m
+数百篇 3 m
+数百米 49 m
+数百美元 2 m
+数百艘 12 m
+数百英里 2 m
+数百路 2 m
+数百辆 6 m
+数百遍 2 m
+数百道 9 m
+数百部 4 m
+数百里 86 m
+数百门 3 m
+数百间 7 m
+数百面 2 m
+数百顷 4 m
+数百项 4 m
+数百颗 3 m
+数百首 2 m
+数的几何 3 l
+数盆 3 n
+数盏 3 m
+数目 1643 n
+数目字 15 n
+数眼 6 m
+数着 61 m
+数矛字 3 l
+数短论长 3 n
+数码 804 n
+数码产品 3 n
+数码像机 3 n
+数码化 3 n
+数码单反 3 l
+数码听 3 n
+数码味 3 n
+数码商城 3 n
+数码城 3 n
+数码墟 3 n
+数码宝贝 3 n
+数码广场 3 n
+数码彩电 3 n
+数码影像 3 n
+数码技术 3 n
+数码港 3 n
+数码照片 3 n
+数码电视 3 n
+数码相册 3 l
+数码相机 3 n
+数码相片 3 n
+数码科技 3 n
+数码管 3 n
+数码网络 2 n
+数码设备 3 n
+数码音 3 n
+数码频道 3 n
+数碗 3 m
+数种 81 m
+数秒 20 m
+数程 3 n
+数站 3 n
+数章 16 m
+数端 3 n
+数笔 14 m
+数第一 7 m
+数等 40 m
+数算 3 n
+数篇 11 m
+数米 66 m
+数米志炊 3 n
+数米而炊 3 i
+数米量柴 3 n
+数粒 5 n
+数级 9 n
+数线 3 n
+数组 313 n
+数组名 3 n
+数罪并罚 3 n
+数股 11 m
+数艘 14 m
+数节 10 n
+数英里 4 m
+数萱 3 n
+数落 128 n
+数行 23 n
+数表 3 n
+数见不鲜 3 i
+数计 19 n
+数记 6 n
+数论 189 n
+数词 13 n
+数语 3 n
+数起 14 m
+数路 22 n
+数轮 7 m
+数轴 5 n
+数载 34 m
+数辆 9 m
+数辈 2 n
+数过去 3 l
+数过来 3 l
+数透泛 3 n
+数遍 25 m
+数道 34 n
+数遭 7 m
+数部 3 m
+数里 331 m
+数重 12 n
+数量 6927 n
+数量化 33 n
+数量型 12 n
+数量指标 3 n
+数量级 51 n
+数量词 3 n
+数量质量 3 n
+数钠 3 n
+数错 3 n
+数门 9 n
+数间 12 n
+数队 3 n
+数阵 6 m
+数集 28 n
+数面 9 n
+数页 6 m
+数项 8 m
+数颗 6 m
+数额 882 n
+数额较大 3 n
+数风流 3 n
+数首 5 m
+数首次 4 m
+数黄道白 3 n
+数黄道黑 3 l
+数黑论白 3 l
+数黑论黄 3 n
+敱 159 zg
+敲 1935 v
+敲一敲 3 l
+敲上去 3 v
+敲上来 3 l
+敲下 3 v
+敲下去 3 l
+敲下来 3 l
+敲丧钟 3 l
+敲了半天 3 i
+敲住 3 v
+敲冰戛玉 3 n
+敲冰求火 3 i
+敲冰玉屑 3 i
+敲冰索火 3 i
+敲出 3 v
+敲击 173 v
+敲击声 21 n
+敲响 194 v
+敲响丧钟 3 n
+敲响警钟 3 n
+敲定 84 v
+敲山振虎 3 nz
+敲山震虎 16 i
+敲开 3 v
+敲打 197 v
+敲掉 3 v
+敲敲 58 v
+敲敲打打 11 i
+敲更 3 v
+敲来敲去 3 i
+敲榨 3 v
+敲榨勒索 2 i
+敲死 3 v
+敲牛宰马 3 i
+敲破 3 v
+敲碎 3 v
+敲空 3 v
+敲竹杠 16 n
+敲膏吸髓 3 n
+敲警钟 3 l
+敲诈 64 v
+敲诈勒索 57 i
+敲诈勒索罪 5 i
+敲诈嫌疑 3 z
+敲诈性 3 nz
+敲诈案 3 i
+敲诈者 3 n
+敲诈钱财 3 i
+敲诈锹 3 n
+敲起 3 v
+敲起来 3 l
+敲边鼓 8 i
+敲过 3 v
+敲过去 3 l
+敲过来 3 l
+敲进 3 v
+敲金击玉 3 n
+敲金击石 3 n
+敲金戛玉 3 n
+敲钟 3 n
+敲钟人 2 i
+敲锣 3 v
+敲锣打鼓 57 i
+敲锣放炮 3 l
+敲锣放砲 3 l
+敲锭 3 nz
+敲门 308 v
+敲门声 77 i
+敲门砖 46 nz
+敲除 3 v
+敲骨剥髓 3 i
+敲骨取髓 3 i
+敲骨吸髓 7 n
+敲骨榨髓 3 i
+敲髓洒膏 3 nz
+敳 8 zg
+整 1738 v
+整一 4 b
+整一下 7 m
+整一个 8 m
+整一整 28 d
+整世 3 b
+整世纪 3 nz
+整个 11839 b
+整个儿 51 m
+整个来说 3 l
+整二次型 3 nz
+整人 70 n
+整人专家 3 l
+整人法 3 n
+整亿 3 m
+整付 3 v
+整件 13 n
+整件事 3 n
+整份 2 n
+整伍 3 n
+整体 3781 n
+整体优势 3 n
+整体健康 3 l
+整体利益 3 n
+整体化 24 vn
+整体厨房 3 vn
+整体失效 3 l
+整体实力 3 l
+整体式 23 b
+整体性 75 b
+整体感 13 n
+整体收缩 3 l
+整体效益 3 n
+整体橱柜 3 v
+整体科普 3 nz
+整体素质 3 n
+整体而言 24 l
+整体观 8 n
+整体观念 3 n
+整体规划 3 b
+整体论 3 n
+整体铸造 3 l
+整体防护 3 n
+整体面层 3 n
+整修 601 v
+整修费 3 n
+整倍 3 m
+整倍体 3 n
+整党 178 n
+整党工作 3 n
+整具 5 n
+整册 3 v
+整军 60 n
+整军经武 21 n
+整冠纳履 3 i
+整几个 2 m
+整出 16 v
+整出戏 3 n
+整分 2 n
+整列 7 b
+整到 3 v
+整副 9 b
+整匙 3 n
+整区 3 n
+整千 16 m
+整卷 4 m
+整发 2 v
+整取 2 v
+整口 3 n
+整口气 3 n
+整句 4 m
+整句话 3 l
+整句输入 3 n
+整只 17 m
+整台 4 n
+整叶 3 n
+整合 1067 v
+整合型 4 b
+整合式 2 b
+整合性 3 b
+整合法 3 b
+整合系统 3 l
+整合素 3 n
+整合营销 3 n
+整周 3 m
+整团 22 n
+整固 3 v
+整圈 2 n
+整在 3 b
+整地 45 n
+整场 62 n
+整场戏 3 n
+整块 119 n
+整块地 3 d
+整型 3 b
+整型外科 3 n
+整型手术 3 n
+整型术 3 n
+整型费 3 n
+整垮 3 v
+整堂 5 n
+整堆 3 n
+整堵 3 v
+整备 43 b
+整复 15 v
+整夜 146 b
+整夜未归 3 i
+整天 874 m
+整天价 3 n
+整头 6 n
+整套 79 b
+整套书 3 n
+整好 3 d
+整字 3 n
+整存 3 v
+整存整付 3 n
+整存整取 3 l
+整存零付 3 n
+整季 3 b
+整宗 3 b
+整容 98 n
+整容手术 3 l
+整容术 5 n
+整宿 3 v
+整封 3 v
+整封信 3 n
+整尺 2 m
+整局 3 n
+整层 4 b
+整巷 3 n
+整师 3 n
+整幅 13 d
+整幕 3 n
+整幢 6 m
+整平 4 n
+整年 41 m
+整年到头 3 l
+整年累月 3 l
+整座 189 m
+整建 12 v
+整建工程 3 l
+整式 13 b
+整张 26 n
+整形 187 b
+整形医院 3 l
+整形外科 3 l
+整形手术 3 n
+整形术 3 n
+整形电路 3 n
+整形种植 3 l
+整形科 12 n
+整形花坛 3 n
+整形草坪 3 n
+整得 3 v
+整成 5 v
+整截 3 v
+整所 2 n
+整打 3 v
+整托 3 b
+整批 13 m
+整批销售 3 l
+整把 3 m
+整担 2 v
+整捆 2 m
+整排 2 v
+整摞 3 m
+整支 12 m
+整改 188 v
+整改意见 3 l
+整改措施 3 n
+整数 565 n
+整数倍 3 m
+整数关 3 n
+整数型 3 n
+整整 1243 vn
+整整截截 3 m
+整整齐齐 175 z
+整斗 2 vn
+整料 3 n
+整旅厉卒 3 v
+整日 270 b
+整日价 43 nz
+整旧如新 3 l
+整晚 3 d
+整月 5 m
+整月份 3 nz
+整期 3 b
+整本 7 n
+整本书 3 n
+整本大套 3 nz
+整朵 2 n
+整朵花 3 n
+整机 87 b
+整束 13 v
+整条 76 m
+整条路 3 n
+整来整去 3 z
+整杯 5 m
+整杯水 3 n
+整杯茶 3 n
+整杯酒 3 n
+整枚 2 m
+整枝 9 n
+整枪 2 n
+整架 3 n
+整柜 3 n
+整栋 8 m
+整株 13 m
+整根 5 m
+整根烟 3 nz
+整档 3 b
+整桩 3 m
+整桶 3 m
+整梯次 3 b
+整棵 7 m
+整棵树 3 l
+整步迭代 3 l
+整段 15 n
+整段路 3 n
+整治 635 n
+整洁 264 a
+整洁为强 3 l
+整洁地 3 n
+整派 3 b
+整流 100 b
+整流器 20 n
+整流子 3 n
+整流桥 3 n
+整流管 3 n
+整流罩 79 n
+整点 47 n
+整然有序 3 l
+整片 36 n
+整版 21 b
+整班 3 n
+整球 3 n
+整理 1932 n
+整理出来 3 l
+整理剂 6 n
+整理想 3 n
+整理盒 3 n
+整理者 9 n
+整理行装 3 n
+整理表 3 n
+整瓶 3 n
+整百家 2 m
+整盒 3 n
+整盘 6 n
+整着 3 v
+整石墙 3 n
+整碗 3 m
+整碗饭 3 n
+整科 3 n
+整站 2 n
+整章 3 n
+整笔 3 n
+整笼 3 n
+整筒 3 n
+整箱 7 n
+整篇 35 b
+整篇文章 3 n
+整粒 2 n
+整纷剔蠹 3 i
+整线 3 n
+整组 3 vn
+整经 13 d
+整经机 2 n
+整编 188 v
+整编师 8 n
+整缸 3 b
+整缸水 3 n
+整罐 3 n
+整群 7 n
+整联蛋白 3 l
+整肃 109 a
+整脸 2 d
+整艘 6 m
+整节 3 n
+整节课 3 n
+整英里 2 m
+整营 3 b
+整行 2 v
+整行字 3 n
+整衣 3 n
+整衣敛容 3 z
+整补 3 b
+整表示 3 n
+整袋 2 n
+整装 24 b
+整装待发 29 l
+整装待命 3 l
+整襟危坐 3 i
+整角 12 n
+整训 29 vn
+整记 2 n
+整课 3 v
+整财 2 v
+整起 3 v
+整路 3 n
+整身 3 n
+整躬率物 3 n
+整车 307 n
+整车厂 3 n
+整轮 3 n
+整辆 2 m
+整边 3 b
+整过 3 v
+整道 3 v
+整道菜 3 n
+整部 72 n
+整部书 3 n
+整钱 3 n
+整锅 3 n
+整门 3 n
+整闭包 3 n
+整间 6 n
+整队 59 n
+整除 37 v
+整集 3 v
+整面 8 b
+整页 6 m
+整项 3 b
+整顿 2100 m
+整顿作风 3 n
+整顿干坤 3 i
+整顿秩序 3 nz
+整顿纪律 3 n
+整顿者 3 n
+整顿饭 3 n
+整颗 3 m
+整颗心 3 n
+整题 3 n
+整风 286 n
+整风运动 294 l
+整餐 3 n
+整餐饭 3 n
+整饬 118 v
+整饰 8 n
+整首 3 v
+整首歌 3 n
+整骨 3 n
+整齐 1069 d
+整齐乾净 3 i
+整齐划一 40 l
+整齐有序 3 l
+整齐清洁 3 z
+敷 659 v
+敷上 3 v
+敷出 3 v
+敷到 3 v
+敷剂 3 nz
+敷嘴 3 v
+敷好 3 v
+敷布 5 v
+敷张扬厉 3 i
+敷得 3 v
+敷成 3 v
+敷手 3 v
+敷掉 3 v
+敷文 3 nz
+敷料 22 v
+敷旁 3 n
+敷浅 3 v
+敷涂 3 v
+敷着 3 v
+敷粉 3 nz
+敷脚 3 v
+敷脸 3 v
+敷药 41 v
+敷衍 282 v
+敷衍了事 25 i
+敷衍塞责 9 i
+敷衍搪塞 2 vn
+敷衍瑛责 3 vn
+敷设 68 v
+敷贴 15 v
+敷足 3 v
+敷过 3 v
+敷陈 3 v
+敷面 3 v
+數 38 zg
+敹 40 zg
+敺 56 zg
+敻 6 zg
+敼 78 zg
+敾 74 zg
+斀 6 zg
+斁 141 zg
+斂 196 zg
+文 10253 n
+文三街 3 nr
+文三路 3 nz
+文不加点 3 l
+文不对题 8 l
+文不尽意 3 l
+文丑 68 n
+文丘 7 n
+文丘里 2 nr
+文丛 20 n
+文东武 260 nr
+文东茅 3 nr
+文丞相 4 nr
+文中 356 s
+文中子 5 nr
+文中意 3 l
+文中言 2 nr
+文中说 3 l
+文丰 2 nz
+文为程 2 l
+文为诗 2 nr
+文举 4 n
+文义 12 n
+文义通 9 nr
+文之士 3 nr
+文之炳 4 nr
+文之盛 2 nr
+文书 1354 n
+文书处理 3 n
+文书工作 3 n
+文事 3 n
+文事武 2 n
+文二兄 2 nr
+文二弟 3 nr
+文二路 3 nz
+文人 839 n
+文人化 2 n
+文人墨士 3 n
+文人墨客 24 n
+文人学士 41 n
+文人无行 2 l
+文人治国 3 ns
+文人画 3 n
+文人相轻 11 i
+文人统治 3 n
+文人雅士 3 n
+文从字顺 15 nr
+文代会 15 nz
+文以明 7 nr
+文以载道 8 l
+文仪 3 n
+文仲容 19 nr
+文件 4288 n
+文件事件 3 n
+文件传输 3 l
+文件传送 2 nr
+文件共享 3 nr
+文件创建 2 nz
+文件名 106 n
+文件名扩展 8 n
+文件名称 3 n
+文件大小 3 l
+文件夹 29 n
+文件尺寸 2 l
+文件属性 6 n
+文件批量 3 l
+文件柜 8 n
+文件格式 3 l
+文件汇编 3 n
+文件目录 16 n
+文件类型 3 n
+文件精神 3 n
+文件系统 59 l
+文件组织 3 l
+文件维护 3 n
+文件翻译 3 l
+文件袋 3 n
+文会宴 3 n
+文传 40 n
+文伯仁 4 nr
+文似其人 3 i
+文体 431 n
+文体学 2 n
+文体局 3 nt
+文体活动 3 l
+文体用品 3 n
+文体部 3 n
+文佛典 2 nr
+文侩 3 n
+文保 16 j
+文信国 3 nt
+文修武备 3 n
+文儒坊 3 nr
+文儿 24 n
+文光 2 n
+文光镇 3 nr
+文兴宇 3 nr
+文具 77 n
+文具厂 3 n
+文具商 3 n
+文具店 3 n
+文具用品 3 n
+文具盒 4 n
+文具礼品 3 l
+文具网 3 nz
+文具行 3 n
+文典 3 n
+文典册 2 n
+文冠果 10 nr
+文凭 457 n
+文凭主义 3 n
+文凭者 3 n
+文刊 3 n
+文则 3 n
+文制武 7 nr
+文剑尖 2 nr
+文勤公 2 nr
+文化 34860 n
+文化之乡 3 l
+文化交往 3 l
+文化交流 3 n
+文化产业 194 n
+文化传媒 3 n
+文化公园 3 n
+文化冲突 3 nz
+文化区 45 n
+文化厅 56 n
+文化史 394 n
+文化名人 3 n
+文化名城 3 n
+文化周 7 nr
+文化园 2 n
+文化圈 22 nz
+文化场所 3 n
+文化城 18 n
+文化大革命 2586 nz
+文化娱乐 3 n
+文化学术 19 n
+文化宫 43 n
+文化局 201 n
+文化层 291 n
+文化展 2 nz
+文化差异 3 l
+文化底蕴 3 n
+文化快餐 3 l
+文化性 8 n
+文化战线 3 nz
+文化教育 334 l
+文化教育界 10 n
+文化整合 3 n
+文化景观 3 nz
+文化村 29 n
+文化氛围 3 v
+文化水准 3 n
+文化汇合 3 nz
+文化流氓 3 n
+文化版 3 n
+文化用品 3 n
+文化界 110 n
+文化礼品 3 n
+文化站 76 n
+文化素质 3 n
+文化组 3 n
+文化背景 3 n
+文化节 36 n
+文化街 14 n
+文化衫 2 n
+文化观 3 n
+文化论坛 3 n
+文化课 56 n
+文化路 513 nz
+文化边界 3 n
+文化遗产 3 n
+文化部 305 n
+文化部长 9 n
+文化部门 11 n
+文化频道 3 n
+文化馆 127 n
+文升理 2 n
+文华 1074 nz
+文华奖 13 nz
+文华路 3 n
+文协 9 j
+文博会 5 nr
+文博院 2 nr
+文印室 12 n
+文卷 18 n
+文县 26 ns
+文友 3 n
+文句 37 n
+文台 5 n
+文史 295 n
+文史哲 19 nr
+文史界 4 n
+文史类 3 n
+文史系 6 n
+文史资料 3 n
+文史馆 17 n
+文右武 130 nr
+文号 17 n
+文同 3 n
+文名 18 n
+文君司马 3 nr
+文君新寡 3 n
+文君新醮 3 nr
+文告 94 n
+文员 67 n
+文命 2 nz
+文品 3 n
+文品佳 3 nr
+文哥 40 n
+文四叔 4 nr
+文四哥 14 nr
+文园 2 n
+文国庆 4 nr
+文图拉 2 nr
+文圆质方 3 n
+文圣 3 nr
+文圣区 2 nr
+文圣武 2 nr
+文场 11 n
+文坛 308 n
+文坛人士 3 nz
+文坛领袖 3 n
+文垂特 2 nr
+文城 3 n
+文塔 6 n
+文墨 68 n
+文士 95 n
+文士之 2 nr
+文大人 6 nr
+文天祥 187 nr
+文天详 2 nr
+文契 9 nr
+文奸济恶 3 n
+文如其人 6 l
+文妙真人 2 nr
+文委 9 n
+文娱 38 n
+文娱活动 3 n
+文婪武嬉 3 i
+文子同升 3 nr
+文子文孙 3 nr
+文字 4631 n
+文字串 3 n
+文字交 3 n
+文字处理 3 l
+文字大小 3 l
+文字学 34 n
+文字学家 11 n
+文字幕 3 n
+文字广告 3 n
+文字描述 3 n
+文字改革 38 l
+文字效果 3 n
+文字案件 3 n
+文字水平 3 n
+文字游戏 3 n
+文字版 3 n
+文字特效 3 n
+文字狱 56 n
+文字编辑 3 n
+文字说明 3 l
+文字量 3 n
+文存 15 n
+文孝武 9 nr
+文学 6890 n
+文学书库 3 n
+文学事业 3 n
+文学作品 3 n
+文学刊物 3 l
+文学创作 3 n
+文学化 3 n
+文学区 3 n
+文学史 337 n
+文学名著 3 n
+文学名言 3 n
+文学城 3 nr
+文学士 35 n
+文学奖 104 nz
+文学家 280 n
+文学工作者 11 n
+文学思想 3 n
+文学思潮 3 nr
+文学性 24 n
+文学所 13 nt
+文学批评 3 n
+文学报 3 n
+文学教师 3 n
+文学期刊 3 n
+文学梦 3 nz
+文学理论 3 n
+文学界 73 n
+文学知识 3 n
+文学社 39 nt
+文学类 16 n
+文学系 63 n
+文学网 3 n
+文学艺术 3 n
+文学评论 3 n
+文学语言 38 n
+文学路 3 n
+文学运动 3 nz
+文学遗产 3 n
+文学部 10 nt
+文学院 123 nt
+文学青年 3 n
+文学革命 42 nz
+文学革命论 9 nz
+文学频道 3 n
+文学馆 37 n
+文安 23 nz
+文安县 13 ns
+文宗 140 nr
+文宗学府 3 nr
+文官 650 n
+文官考试 3 nr
+文官资格 3 n
+文定 11 n
+文定之喜 3 l
+文宝 2 nz
+文宣帝 12 nr
+文宣王 4 nr
+文宣皇帝 3 nr
+文家 11 n
+文富 2 n
+文小龙 3 nr
+文尚葛 3 nr
+文山 40 n
+文山会海 7 nz
+文山县 3 ns
+文山壮族苗族自治州 10 ns
+文山州 33 ns
+文山斗 2 nr
+文山郡 4 nr
+文峪河 3 nr
+文峰 262 n
+文峰区 3 n
+文峰塔 10 nr
+文崔二 3 nr
+文工团 281 nt
+文工团员 42 n
+文左武 2 nr
+文布 3 n
+文帅 3 n
+文帝 237 n
+文帝初 6 nr
+文帝太子 2 nr
+文帝诏 2 nr
+文帝霸 2 nr
+文广 42 nz
+文广局 3 nt
+文广旗 3 nr
+文广经 2 nz
+文广高 3 nr
+文库 2294 n
+文庙 47 n
+文庙大成殿 3 nr
+文康 9 nr
+文康中心 3 nt
+文康活动 3 n
+文廷 4 n
+文廷式 219 nr
+文建会 3 nt
+文弛武玩 3 v
+文弱 46 n
+文弱书生 21 n
+文录 7 n
+文彦博 34 nr
+文彩 5 n
+文彬彬 3 i
+文征 3 n
+文征明 5 nr
+文待诏 3 nr
+文微明 4 nr
+文徵明 20 nr
+文德之 2 nr
+文德女中 3 nr
+文德尔 3 nr
+文德尔班 3 nrt
+文德斯 7 nr
+文德桥 2 nr
+文德武功 3 nr
+文德殿 16 nr
+文心 6 n
+文心阁 12 nr
+文心雕 34 nr
+文心雕龙 3 i
+文志补 2 nr
+文忠公 2 nr
+文思 39 n
+文思敏捷 3 nr
+文思泉 2 nr
+文思泉涌 3 nr
+文恬武嬉 5 i
+文情 3 n
+文情并茂 3 i
+文意 10 n
+文慕仁 3 nr
+文戏 20 n
+文成 112 nrfg
+文成侯 3 nr
+文成公主 48 n
+文成县 2 nr
+文成帝 12 nr
+文房 14 n
+文房四侯 3 nr
+文房四士 3 n
+文房四宝 78 nz
+文房四物 3 n
+文房四艺 3 n
+文才 99 n
+文才出众 3 i
+文才武略 3 nr
+文抄公 3 n
+文揭密 2 i
+文搜丁甲 3 nr
+文搜网 3 nr
+文摘 108 n
+文摘报 2 n
+文攻武 3 nr
+文攻武卫 3 nr
+文教 513 nz
+文教区 3 n
+文教卫生 279 n
+文教处 3 l
+文教局 7 nt
+文教界 3 n
+文教类 2 n
+文教部 5 nt
+文教部门 3 n
+文文 23 nz
+文文书 2 nr
+文文山 3 nr
+文文静静 3 nr
+文斋文 2 nz
+文斗 11 n
+文料 3 n
+文斯基 14 nr
+文斯敦 10 ns
+文斯通 6 nz
+文斯顿 4 nr
+文无加点 3 l
+文旦 3 nz
+文旦皮 3 n
+文昌 341 nr
+文昌县 6 ns
+文昌宫 5 nr
+文昌市 276 ns
+文昌街 3 nr
+文昌阁 20 nr
+文昌鱼 32 nr
+文昌鸡 3 nr
+文明 6584 nr
+文明冲突论 5 i
+文明办 29 nr
+文明化 3 nr
+文明区 8 n
+文明单位 3 n
+文明卫生 3 nr
+文明古国 105 ns
+文明史 113 nr
+文明城市 3 ns
+文明委 19 nr
+文明小区 3 n
+文明戏 14 n
+文明户 5 n
+文明执法 3 n
+文明村 11 nr
+文明用语 3 nz
+文明礼仪 3 nr
+文明礼貌 29 n
+文明线 3 n
+文明自省论 2 i
+文明诚信 3 nr
+文星 8 n
+文星高照 3 nr
+文昭关 4 nr
+文昭武穆 3 nr
+文昭皇后 2 nr
+文昭阁 7 nr
+文景 15 n
+文景之 2 nr
+文景之治 35 l
+文曲 3 n
+文曲星 4 nz
+文期酒会 3 nt
+文木活 2 nr
+文末 3 n
+文本 352 n
+文本处理 3 n
+文本属性 2 n
+文本库 3 n
+文本文件 28 n
+文本文档 3 n
+文本校对 3 n
+文本格式 3 n
+文本框 2 n
+文本检索 3 n
+文本王 3 n
+文本编辑 3 n
+文札 3 n
+文札则 2 nr
+文林 3 n
+文林街 3 nr
+文根英 3 nr
+文格勒 2 nr
+文案 92 n
+文档 181 n
+文档文件 3 l
+文档等级 3 l
+文档资料 3 l
+文森特 7 nr
+文楼 14 n
+文正公 26 nr
+文正欲 2 nr
+文武 1525 nr
+文武之道 3 l
+文武全才 65 nr
+文武兼备 8 l
+文武双全 57 nr
+文武合一 3 l
+文武场 4 n
+文武学校 3 l
+文武官 26 nr
+文武差事 3 l
+文武庙 2 nr
+文武百官 747 n
+文殊 52 nr
+文殊兰 3 nr
+文殊寺 3 nr
+文殊师 2 n
+文殊殿 4 nr
+文殊院 3 n
+文段 3 n
+文气 3 n
+文水 17 n
+文水县 10 ns
+文求堂 3 nr
+文汇 278 n
+文汇出版社 6 nt
+文汇报 95 nz
+文江学海 3 nz
+文治 54 n
+文治武力 3 n
+文治武功 12 n
+文法 90 n
+文法书 3 n
+文法学 5 nt
+文法学家 3 l
+文波 2 n
+文泰 60 nz
+文泰来 364 nr
+文洛克 2 nr
+文津街 2 nr
+文津阁 20 nr
+文海 18 ns
+文海宝 2 nr
+文海平 2 nr
+文海英 3 nr
+文深网密 3 i
+文渊阁 348 nr
+文渠 4 n
+文源阁 3 nr
+文溯阁 4 nr
+文潞公 3 nr
+文澜 9 nrfg
+文火 33 n
+文灶 3 n
+文炳雕龙 3 i
+文熙俊 3 nrfg
+文爷 10 n
+文版 3 n
+文牍 38 n
+文牍主义 2 n
+文牒 10 n
+文物 4746 n
+文物保护 3 n
+文物保护法 14 n
+文物出版社 18 nt
+文物古迹 3 n
+文物局 48 n
+文物展 3 nz
+文物组 3 n
+文物部门 16 n
+文献 1701 n
+文献之家 3 l
+文献会 3 nr
+文献分类 3 n
+文献号 3 nr
+文献学 48 nr
+文献工作 3 n
+文献性 3 nr
+文献数据库 9 n
+文献标引 3 nr
+文献检索 3 nr
+文献汇编 3 n
+文献片 3 n
+文献考证 3 nr
+文献资料 3 n
+文献选编 3 n
+文王 36 n
+文王演 2 nr
+文王迁 4 nr
+文玩 10 n
+文班 3 n
+文班吏 2 n
+文理 108 n
+文理不通 5 l
+文理学院 1301 nt
+文理科 50 n
+文生 3 n
+文电 26 n
+文痞 3 n
+文登 19 nr
+文登县 3 nr
+文登市 5 ns
+文白 2 n
+文皇 3 n
+文益 2 n
+文盛瑾 3 nr
+文盲 203 n
+文盲率 28 n
+文石 10 n
+文码 3 n
+文社 4 n
+文神武 2 nr
+文祥奏 3 nr
+文秀伏 2 nr
+文秀倚 2 nr
+文秀发 2 nr
+文秀少女 3 nr
+文种 64 n
+文科 533 nz
+文科学生 3 nz
+文科班 2 nz
+文科生 40 nr
+文科类 3 n
+文秘 102 n
+文秘人员 3 n
+文秘网 3 n
+文稿 115 n
+文稿纸 3 n
+文章 6728 n
+文章主题 3 n
+文章内容 3 n
+文章宗匠 3 nr
+文章宗工 3 nr
+文章宿老 3 nr
+文章山斗 3 l
+文章巨公 3 nr
+文章憎命 3 i
+文章星斗 3 l
+文章正文 3 nr
+文章生成 3 l
+文章盖世 3 nr
+文章钜公 3 nr
+文章魁首 3 i
+文童 3 n
+文竹 3 n
+文笔 154 n
+文笔优美 3 l
+文笔流畅 3 i
+文笔简洁 3 nr
+文简 2 n
+文簿 3 n
+文籍 3 n
+文籍先生 3 n
+文类 3 n
+文粹开 2 nr
+文精 2 n
+文素莉 3 nr
+文绉绉 49 z
+文经武略 3 n
+文经武纬 3 n
+文网文 3 n
+文翔凤 2 nr
+文翰 129 nrt
+文职 286 n
+文职人员 3 n
+文职原 3 n
+文职类 3 n
+文联 214 nz
+文肃 2 ns
+文肇求 2 nr
+文胜质 2 n
+文胸 61 n
+文脉 6 n
+文脉性 3 n
+文臣 248 n
+文臣中 2 nr
+文臣吕 4 nr
+文臣夏 3 nr
+文臣武将 3 nr
+文臣班 4 nr
+文艺 2892 n
+文艺事业 3 n
+文艺会演 3 n
+文艺作品 3 n
+文艺兵 4 n
+文艺创作 3 l
+文艺团体 3 n
+文艺圈 3 n
+文艺复兴 404 l
+文艺学 20 n
+文艺家 7 l
+文艺工作者 164 n
+文艺思想 3 n
+文艺性 2 n
+文艺批评 17 l
+文艺报 14 n
+文艺晚会 3 nz
+文艺活动 3 l
+文艺演出 3 l
+文艺片 4 n
+文艺理论 3 n
+文艺界 162 n
+文艺社 2 nt
+文艺类 5 n
+文艺美学 3 nt
+文艺舞台 3 nt
+文艺节目 3 n
+文艺表演 3 n
+文艺观 2 n
+文艺语言 3 l
+文艺部 22 nt
+文艺领域 3 l
+文花枝 10 n
+文苑 71 nr
+文苑路 3 nr
+文茨皮尔斯 2 nrt
+文莱 99 nr
+文莱达鲁萨兰国 5 ns
+文藻 2 n
+文藻语专 3 n
+文虎 12 nz
+文虎克 26 nr
+文蛤 26 n
+文行出处 3 n
+文觉非 3 nr
+文觌武匿 3 v
+文解 22 n
+文言 139 n
+文言文 97 n
+文记 2 n
+文论 65 n
+文词 4 n
+文词儿 3 nr
+文译 6 n
+文说 173 n
+文谕院 13 nr
+文象 2 n
+文豪 31 n
+文豹 2 n
+文责 3 n
+文责自负 592 l
+文质 3 n
+文质彬彬 46 i
+文贵不成 3 l
+文贵武 2 nr
+文贻炜 3 nr
+文赋 17 n
+文足 2 n
+文身 92 n
+文身剪发 3 nz
+文身断发 3 i
+文身翦发 3 vn
+文轻武 16 nr
+文辞 76 n
+文辞优美 3 l
+文达 4 nz
+文过 3 l
+文过其实 3 l
+文过饰非 12 l
+文进士 2 n
+文远忠义 2 nr
+文选 259 n
+文选集 3 n
+文通残锦 3 i
+文道 3 n
+文部 11 n
+文部大臣 8 n
+文部省 9 n
+文醉翁 11 nr
+文采 102 n
+文采出众 3 i
+文采斐然 3 nr
+文采风流 4 n
+文野 3 n
+文钞 7 n
+文钵英 3 nr
+文铭文 2 nr
+文锦渡 6 nr
+文镜秘 2 nr
+文长之 2 nr
+文阁 4 n
+文雅 145 nr
+文雅地 3 n
+文雅气息 3 n
+文集 830 n
+文雪飞 2 nr
+文震孟 15 nr
+文静 74 n
+文革 703 n
+文革时期 3 nz
+文韬武略 9 nr
+文韵 3 n
+文颂娴 3 nr
+文风 142 n
+文风不动 2 l
+文风学习 3 n
+文饰 15 n
+文首 3 n
+文魁 3 n
+文鸟 3 n
+文鸯 5 n
+文鼓 2 n
+文龙 39 nz
+文龙兄 2 nr
+斋 1341 ng
+斋主 3 v
+斋供 3 v
+斋坛 3 n
+斋堂 12 n
+斋堂川 8 nr
+斋宫 139 n
+斋宿 3 v
+斋居蔬食 3 vn
+斋心 3 n
+斋心涤虑 3 n
+斋戒 207 n
+斋戒日 4 t
+斋戒沐浴 3 nr
+斋戒节 3 t
+斋教 3 n
+斋日 3 t
+斋月 27 t
+斋月灯 3 n
+斋期 2 t
+斋果 3 n
+斋舍 3 n
+斋菜 4 n
+斋藤 12 nr
+斋藤真由美 2 nr
+斋醮 36 v
+斋食 3 n
+斋饭 48 v
+斌 585 nr
+斐 377 j
+斐冷翠 3 z
+斐尔 2 ns
+斐洛 3 ns
+斐济 161 ns
+斐济共和国 4 ns
+斐然 64 z
+斐然乡风 3 ns
+斐然向风 3 vn
+斐然成章 3 ns
+斑 1027 n
+斑嘴鸭 2 n
+斑块 56 n
+斑头雁 22 n
+斑岩 48 n
+斑斑 283 z
+斑斑可考 3 n
+斑斑点点 17 n
+斑斑驳驳 12 z
+斑斓 126 z
+斑枯病 2 n
+斑海豹 2 n
+斑点 211 n
+斑点印迹 3 n
+斑点杂交 3 n
+斑点状 10 n
+斑点狗 3 n
+斑疹 53 n
+斑疹伤寒 3 n
+斑痕 19 n
+斑白 52 z
+斑秃 9 z
+斑竹 285 n
+斑纹 168 n
+斑绿 3 z
+斑羚 9 n
+斑联蛋白 3 n
+斑蛋白 3 n
+斑蝥 2 n
+斑蝥素 3 v
+斑衣戏彩 3 n
+斑豹一窥 3 i
+斑迹 2 n
+斑马 70 n
+斑马线 2 n
+斑马鱼 2 n
+斑驳 76 z
+斑驳陆离 4 n
+斑鱼 3 n
+斑鸠 90 n
+斓 227 x
+斗 6215 vn
+斗不过 3 v
+斗了起来 3 i
+斗争 9529 vn
+斗争史 12 n
+斗争大会 3 n
+斗争形式 3 n
+斗争性 19 n
+斗争意志 3 n
+斗争方式 3 n
+斗倒 3 vn
+斗六 7 nz
+斗六市 3 ns
+斗兽 6 n
+斗兽场 7 n
+斗劲 3 v
+斗勇 10 d
+斗升 3 v
+斗升之水 3 i
+斗南 9 ns
+斗南一人 3 nz
+斗口 3 vn
+斗唇合舌 3 i
+斗嘴 37 ns
+斗地主 3 i
+斗士 67 n
+斗子 3 n
+斗室 63 n
+斗山 11 ns
+斗弄 3 vn
+斗式 27 n
+斗心眼 4 i
+斗心眼儿 3 i
+斗志 365 n
+斗志昂扬 28 i
+斗怪争奇 3 i
+斗成 3 v
+斗批改 3 n
+斗技 3 nz
+斗技场 3 n
+斗折蛇行 3 i
+斗拱 398 nz
+斗挹箕扬 3 i
+斗换星移 3 i
+斗斗 3 vn
+斗斗嘴 3 nz
+斗方 12 n
+斗方名士 3 n
+斗智 71 n
+斗智斗力 3 n
+斗智斗勇 44 i
+斗来斗去 3 i
+斗架 3 n
+斗柄 41 n
+斗榫合缝 3 n
+斗殴 132 v
+斗气 45 n
+斗水活鳞 3 n
+斗法 40 vn
+斗渠 3 n
+斗烟丝 3 n
+斗牌 3 n
+斗牙拌齿 3 nz
+斗牛 121 nz
+斗牛场 5 n
+斗牛士 19 n
+斗牛宫 13 ns
+斗牛犬 3 i
+斗牛舞 2 i
+斗狠 3 d
+斗眼 16 n
+斗私批修 3 n
+斗笠 83 n
+斗筲之人 3 v
+斗筲之器 3 v
+斗筲之材 3 v
+斗箕 3 n
+斗篷 175 n
+斗米尺布 3 nz
+斗粟尺布 3 n
+斗绝一隅 3 i
+斗美夸丽 3 i
+斗而铸兵 3 n
+斗而铸锥 3 n
+斗胆 106 n
+斗色争妍 3 v
+斗艳 3 v
+斗艳争芳 3 i
+斗艳争辉 3 i
+斗草 3 n
+斗蓬 3 ns
+斗蟋蟀 3 n
+斗车 6 n
+斗转参横 3 i
+斗转星移 38 i
+斗酒双柑 3 n
+斗酒只鸡 3 i
+斗酒学士 3 n
+斗酒百篇 3 n
+斗量 3 vn
+斗量筲计 3 vn
+斗链器件 3 nz
+斗门 17 n
+斗门区 3 ns
+斗门县 4 ns
+斗门镇 6 ns
+斗霜傲雪 3 i
+斗鱼 3 n
+斗鸡 64 n
+斗鸡养狗 3 i
+斗鸡场 3 n
+斗鸡眼 3 i
+斗鸡走犬 3 i
+斗鸡走狗 8 i
+斗鸡走马 3 i
+斗鹌鹑 3 nr
+料 2747 v
+料事 3 v
+料事如神 80 i
+料仓 2 v
+料件 2 n
+料位计 3 n
+料净 3 v
+料到 1018 v
+料单 3 v
+料及 15 v
+料器 10 n
+料场 6 n
+料子 51 n
+料定 3 v
+料峭 9 z
+料峭春寒 3 i
+料峭轻寒 3 i
+料度 3 n
+料得 3 v
+料想 837 v
+料想不到 3 v
+料想到 3 v
+料想得到 3 v
+料敌制胜 3 i
+料敌如神 3 i
+料敌若神 3 i
+料斗 2 v
+料款 3 v
+料理 569 v
+料理台 3 n
+料理店 3 n
+料石 12 n
+料简 3 v
+料算 3 v
+料耗 3 v
+料豆 3 n
+料豆儿 3 n
+料费 3 v
+料车 3 v
+料酒 11 v
+料量 3 v
+斛 159 q
+斜 2842 v
+斜井 23 n
+斜井钻机 3 nz
+斜交 13 n
+斜体 3 n
+斜体字 4 n
+斜倚 64 v
+斜偏 3 n
+斜入 3 n
+斜切 7 v
+斜压 22 n
+斜吹 3 v
+斜土路 3 n
+斜坡 217 n
+斜坡路 3 n
+斜塔 38 n
+斜墙 6 n
+斜头歪脑 3 i
+斜对角 3 n
+斜对面 45 n
+斜射 32 v
+斜巷 8 n
+斜度 13 n
+斜度标 3 n
+斜成 3 v
+斜投影 3 n
+斜拉 10 n
+斜拉桥 40 n
+斜挎包 3 vn
+斜插 3 v
+斜方形 3 n
+斜晖 6 n
+斜曲 3 n
+斜杆 3 n
+斜杠 2 n
+斜桅 3 n
+斜桥 7 n
+斜楔 2 n
+斜楞 3 n
+斜槽 3 n
+斜水清 3 n
+斜法 3 n
+斜点 3 n
+斜照 32 n
+斜率 22 n
+斜畔 3 n
+斜眼 258 n
+斜眼看人 3 i
+斜睨 83 v
+斜碰 3 v
+斜纤维 3 n
+斜纹 68 n
+斜纹布 19 n
+斜线 65 n
+斜线号 3 n
+斜肩 7 n
+斜著 3 n
+斜行横阵 3 n
+斜襟 6 n
+斜视 54 n
+斜视图 3 n
+斜角 20 n
+斜角规 3 n
+斜谷 3 n
+斜象眼儿 3 n
+斜路 8 n
+斜躺 23 v
+斜轧 3 v
+斜轴 3 n
+斜轴牙 3 n
+斜边 21 f
+斜过去 3 v
+斜过来 3 v
+斜进 3 v
+斜进去 3 v
+斜进来 3 v
+斜长石 57 n
+斜阳 71 n
+斜靠 42 v
+斜面 131 n
+斜面导板 3 n
+斜颈 13 n
+斜风细雨 6 n
+斜高 3 v
+斝 18 zg
+斟 598 v
+斟上 3 v
+斟情 3 v
+斟正 3 v
+斟水 3 v
+斟满 3 v
+斟琢 3 v
+斟茶 23 v
+斟酌 352 v
+斟酌一下 3 v
+斟酒 170 v
+斠 2 zg
+斠然一概 3 nr
+斠若画一 3 v
+斡 899 v
+斡旋 118 v
+斡旋到底 3 nz
+斤 734 m
+斤两 43 n
+斤两不足 3 i
+斤半 3 n
+斤头 2 n
+斤数 3 n
+斤斗 39 n
+斤斤 3 n
+斤斤自守 3 i
+斤斤计较 54 i
+斤斤较量 3 n
+斥 465 zg
+斥之为 19 v
+斥候 11 v
+斥力 18 v
+斥卖 3 v
+斥喝 3 v
+斥言 3 v
+斥责 262 v
+斥责地 3 l
+斥责者 3 n
+斥资 68 v
+斥退 18 v
+斥革 132 v
+斥骂 83 v
+斧 947 zg
+斧凿 25 n
+斧凿刀痕 3 nr
+斧凿痕迹 3 l
+斧削 3 n
+斧劈 32 n
+斧头 182 n
+斧头帮 3 n
+斧子 66 n
+斧斤 23 n
+斧柄 3 n
+斧正 5 n
+斧破斨缺 3 n
+斧钺 32 n
+斧钺之诛 3 v
+斩 2374 v
+斩下 3 v
+斩下去 3 i
+斩下来 3 v
+斩仓 2 v
+斩假石 3 i
+斩六将 3 i
+斩决 3 v
+斩头去尾 3 i
+斩头沥血 3 i
+斩妖 3 i
+斩将刈旗 3 vn
+斩将搴旗 3 vn
+斩尽 3 v
+斩尽杀绝 30 i
+斩断 213 v
+斩断情丝 3 i
+斩木揭竿 3 i
+斩杀 3 v
+斩波器 3 i
+斩立决 3 i
+斩竿揭木 3 i
+斩草 3 v
+斩草除根 71 i
+斩获 53 v
+斩落 52 v
+斩钉切铁 3 i
+斩钉截铁 193 i
+斩钢截铁 3 nz
+斩铁截钉 3 i
+斩除 3 v
+斩首 725 v
+斩首示众 3 i
+斫 190 vg
+斫琱为朴 3 nr
+斫轮老手 3 nr
+斫雕为朴 3 nr
+断 7773 v
+断七 3 n
+断乎 26 d
+断乳 7 n
+断乳期 2 n
+断了线 3 i
+断了腿 3 l
+断事 3 n
+断事如神 3 i
+断井颓垣 5 i
+断交 66 v
+断仇谷 3 i
+断代 364 n
+断代史 58 n
+断决如流 3 i
+断剑 3 n
+断去 3 v
+断发文身 3 n
+断口 53 n
+断句 18 n
+断后 76 d
+断后路 3 i
+断喝 51 v
+断圭碎璧 3 i
+断块山 3 n
+断垄 3 n
+断垣残壁 7 i
+断堤 3 n
+断墙残壁 3 i
+断壁 11 n
+断壁残垣 15 i
+断壁颓垣 4 i
+断头 58 v
+断头台 40 n
+断头将军 6 i
+断头率 3 n
+断头谷 3 n
+断奶 30 n
+断奶期 3 n
+断子嗣 3 n
+断子绝孙 30 i
+断定 579 v
+断尾 4 n
+断层 519 n
+断层山 5 n
+断层崖 3 n
+断层扫描 3 n
+断层湖 18 n
+断层照相 3 n
+断层线崖 3 n
+断层谷 3 n
+断崖 101 n
+断崖绝壁 3 i
+断开 54 v
+断开连接 2 i
+断开颓垣 3 i
+断弦 7 n
+断弦再续 3 i
+断念 2 n
+断怪除妖 3 i
+断想 2 v
+断成 3 v
+断成两截 3 n
+断手 3 v
+断手断脚 3 i
+断手续玉 3 i
+断折 3 v
+断指 23 n
+断掉 29 v
+断掌 6 v
+断断 37 v
+断断不可 3 i
+断断续续 371 i
+断无 3 i
+断无此事 3 i
+断无此理 3 i
+断木 10 n
+断木掘地 3 n
+断机 2 n
+断杼择邻 3 nr
+断枝 3 n
+断根 16 n
+断根绝种 3 i
+断案 57 n
+断案如神 3 i
+断档 17 b
+断桥 42 n
+断梗浮萍 3 n
+断梗飘萍 3 nr
+断梗飘蓬 3 z
+断梗飞蓬 3 n
+断气 64 n
+断水 18 n
+断流 96 n
+断灭 3 v
+断炊 11 v
+断点 8 n
+断点续传 3 i
+断烂朝报 2 i
+断然 383 d
+断然地 3 i
+断然处置 3 i
+断然拒绝 3 l
+断然措施 3 n
+断片 7 n
+断狱 23 v
+断珪缺璧 3 n
+断电 42 n
+断电器 16 n
+断离 3 v
+断种 3 n
+断章取义 41 i
+断章取意 3 i
+断章截句 3 i
+断章摘句 3 i
+断简残篇 3 i
+断简残编 2 i
+断简遗编 3 i
+断管残沈 3 nz
+断管残渖 3 nz
+断箭 3 n
+断篇残简 3 i
+断粮 23 n
+断絃 3 vn
+断纸馀墨 3 v
+断线 44 n
+断线偶戏 3 n
+断线风筝 5 n
+断线鹞子 3 v
+断织之诫 3 i
+断织劝学 3 vn
+断绝 402 v
+断绝关系 3 l
+断绝往来 3 i
+断绝断裂 3 i
+断绝来往 3 i
+断绝邦交 3 i
+断续 133 v
+断编残简 3 i
+断缣寸纸 3 n
+断缣零璧 3 v
+断羽绝鳞 3 n
+断肠 134 n
+断肠人 3 n
+断肠草 75 n
+断肢 46 n
+断背山 3 i
+断脚 3 n
+断脰决腹 3 v
+断腕 7 n
+断腿 75 n
+断臂 103 n
+断臂山 3 i
+断航 3 v
+断落 3 v
+断蛟刺虎 3 nz
+断血流 3 n
+断行 3 v
+断袖 3 n
+断袖之宠 3 i
+断袖之癖 3 n
+断袖余桃 3 n
+断裂 756 v
+断裂剂 3 n
+断裂力学 3 n
+断裂基因 3 n
+断裂处 8 n
+断裂带 124 n
+断裂强度 3 n
+断裂愈合 3 i
+断裂点 3 n
+断裂韧性 3 n
+断见 3 v
+断言 311 n
+断语 12 n
+断路 7 n
+断路器 30 n
+断轨 3 v
+断轨检查 3 n
+断还归宗 3 i
+断送 170 v
+断金 5 n
+断金零粉 3 i
+断钗重合 3 i
+断长续短 3 i
+断长补短 3 i
+断除 3 v
+断雁孤鸿 3 i
+断雨残云 3 i
+断面 147 n
+断面图 4 n
+断顿 6 v
+断香零玉 3 i
+断骨 3 n
+断魂 19 n
+断鸿 3 n
+断齑块粥 3 nz
+断齑画粥 3 v
+断齿 3 n
+斯 4120 nr
+斯丁人 2 nr
+斯万 26 nrt
+斯三世 5 nr
+斯上篮 3 nr
+斯世 3 nrt
+斯世少 4 nr
+斯之妻 2 nr
+斯之威 2 nr
+斯之子 8 nr
+斯之战 2 nr
+斯事 3 n
+斯事体大 3 nt
+斯二世 5 nr
+斯二氏 2 nr
+斯亲王 3 nr
+斯人 55 nrt
+斯人也 3 nr
+斯人赤 2 nr
+斯伍德 2 nr
+斯优哉 2 nr
+斯伯格 2 nr
+斯伯特 3 nr
+斯佩伯爵 4 nr
+斯佩里 3 nr
+斯佩雷 2 nr
+斯佳丽 3 nr
+斯元科 12 nr
+斯克伦 2 nr
+斯克内 3 nr
+斯克利 2 nr
+斯克利夫 3 nrt
+斯克州 5 nr
+斯克市 3 ns
+斯克罗普 4 nrt
+斯克至 2 nr
+斯克航 2 nr
+斯克莱 2 nr
+斯克莱尔 2 nrt
+斯克里 10 nr
+斯克里亚宾 6 nrt
+斯克里普斯 2 nrt
+斯八世 4 nr
+斯公学 2 nt
+斯兰德 14 nr
+斯兰教 7 nz
+斯内克 4 nr
+斯内夫 2 nr
+斯内斯 2 nr
+斯再传 16 nr
+斯冰川 2 nr
+斯凡语 2 nr
+斯凯尔 2 nr
+斯切尔 6 nr
+斯利瓦 3 nr
+斯利那 8 nr
+斯加夫 3 nr
+斯加登 5 nr
+斯加盟 2 ns
+斯劳滕 3 nr
+斯勃罗 4 nr
+斯勒普 4 nr
+斯匹次卑尔根 17 nz
+斯博士 2 nr
+斯博岛 16 nr
+斯博斯岛 3 ns
+斯博特舍 2 nrt
+斯卡亚 3 nr
+斯卡娅 13 nr
+斯卡尔 2 nr
+斯卡尔法罗 6 nrt
+斯卡尔金娜 3 nrt
+斯卡尼 4 nr
+斯卡岛 2 nr
+斯卡帕湾 4 nrt
+斯卡拉 14 nr
+斯卡斯 30 nr
+斯卡格 13 nr
+斯卡比 4 nrt
+斯卡罗 2 nr
+斯发兵 2 nr
+斯发明 5 nr
+斯古德 2 nr
+斯古普 2 nr
+斯可汗 2 nr
+斯台普 2 nr
+斯右路 2 nr
+斯各特 3 nrt
+斯和莉 2 nr
+斯四世 4 nr
+斯图亚 69 nr
+斯图亚特 3 nrt
+斯图加 19 nr
+斯图加特 181 nrt
+斯图加特市 2 ns
+斯图加特芭蕾舞团 5 nt
+斯图塔 3 nr
+斯图姆 7 nr
+斯图尔 2 nr
+斯图尔特 14 nrt
+斯图谟 2 nr
+斯地产 2 nr
+斯坎人 6 nrt
+斯坎德 8 nr
+斯坎纳 2 nr
+斯坦人 2 nrt
+斯坦伯格 5 nrt
+斯坦利 24 nr
+斯坦利港 7 ns
+斯坦努 6 nr
+斯坦因 21 nr
+斯坦尼 54 nr
+斯坦尼斯 5 nrt
+斯坦恩 3 nr
+斯坦拉盖尔 3 ns
+斯坦族 2 nr
+斯坦普 2 nr
+斯坦朗 2 nr
+斯坦福 55 nr
+斯坦福大学 62 nt
+斯坦福桥 2 nr
+斯坦科 9 nr
+斯坦纳 3 nr
+斯坦者 2 nr
+斯坦语 3 nr
+斯坦豪斯 2 nr
+斯坦贝克 13 nrt
+斯坦顿 2 nr
+斯城 2 ns
+斯培西亚 5 ns
+斯基亚 2 nr
+斯基克 6 nr
+斯基克达 2 nrt
+斯基将军 2 nr
+斯基氏 2 nr
+斯基泰 23 nr
+斯基科 2 nr
+斯基著 8 nr
+斯基限 4 nr
+斯堡队 3 nt
+斯堪地那 3 ns
+斯堪尼亚 4 ns
+斯堪的纳 3 ns
+斯堪的纳维亚 112 ns
+斯塔 7 nrt
+斯塔万格 3 nrt
+斯塔克 56 nr
+斯塔克豪 2 nr
+斯塔努 2 nr
+斯塔勒 2 nr
+斯塔夫 78 nr
+斯塔夫罗波尔 13 nrt
+斯塔姆 9 nr
+斯塔尔 14 nr
+斯塔尔克 2 nrt
+斯塔尼 2 nr
+斯塔德 12 nr
+斯塔拉 4 nr
+斯塔斯 4 nr
+斯塔林 7 nr
+斯塔特 6 nr
+斯塔福德 5 nr
+斯塔索夫 2 nrt
+斯塔维斯 4 nrt
+斯塔西 4 nr
+斯塔西娅 2 nrt
+斯塔诺 3 nr
+斯塔贝 3 nr
+斯多亚 2 nrt
+斯多噶 2 nr
+斯多夫 12 nrt
+斯多弗 3 nr
+斯多德 2 nrt
+斯多惠 4 nr
+斯多葛 2 nr
+斯多葛派 12 nr
+斯大林 823 nr
+斯大林格勒 76 nz
+斯太尔 2 nr
+斯夸啉 2 nr
+斯夸尔 3 nr
+斯奇提 5 nr
+斯奈德 2 nr
+斯姆哈纳 3 nrt
+斯威士 10 nr
+斯威士兰 66 ns
+斯威夫特 8 nrt
+斯威尔斯 2 nrt
+斯威特 2 nr
+斯定会 2 nr
+斯定理 18 nr
+斯宾塞 43 nr
+斯宾诺 65 nr
+斯宾诺莎 3 nrt
+斯密 325 nr
+斯密史 2 nr
+斯密司 2 nr
+斯密斯 18 nr
+斯小牛 22 nr
+斯少校 3 nr
+斯尔希 2 nr
+斯尼克 3 nr
+斯尼奇 2 nr
+斯尼德 4 nr
+斯居勒季 16 nr
+斯山 20 ns
+斯山中 2 nr
+斯山南 2 ns
+斯山脉 4 ns
+斯岛 26 ns
+斯岛东 2 nr
+斯岛巨 2 nr
+斯巴亚 3 nr
+斯巴克 5 nr
+斯巴甜 21 nr
+斯巴索夫 2 nrt
+斯巴赫 2 nr
+斯巴达 1475 nr
+斯巴达克 72 nrt
+斯巴达克斯 4 nrt
+斯巴鲁 3 nr
+斯布鲁克 3 nrt
+斯帕克 3 nr
+斯帕克斯 3 nrt
+斯帕兹 5 nr
+斯帕尔 4 nr
+斯帕斯克 2 nrt
+斯帕特 2 nr
+斯帕莱蒂 5 nrt
+斯帕蒂 3 nr
+斯帕达 5 nr
+斯库台 10 nr
+斯库塔 4 nr
+斯库比谢夫斯基 3 nrt
+斯库达 2 nr
+斯康蒂 2 nr
+斯廷罗 3 nr
+斯弗德 3 nr
+斯彭斯 2 nr
+斯得哥尔摩 2 nrt
+斯德丁 2 nr
+斯德哥尔摩 155 nrt
+斯德哥尔摩大学 8 nrt
+斯德哥尔摩市 3 ns
+斯德氏 7 nr
+斯德特 2 nr
+斯必泽 2 nr
+斯忒藩 11 nr
+斯托 45 nrt
+斯托克 17 nr
+斯托克斯 39 nrt
+斯托克顿 9 nrt
+斯托夫 2 nr
+斯托夫人 4 nrt
+斯托尔 3 nr
+斯托帕 2 nr
+斯托弗 3 nr
+斯托斯 15 nr
+斯托林 2 nr
+斯托梅 2 nr
+斯托特 2 nr
+斯托瑟 2 nrt
+斯托芬 34 nr
+斯托诺 2 nr
+斯托雷 4 nr
+斯托默 2 nr
+斯拉 3 nrt
+斯拉夫 378 nr
+斯拉夫主义 8 nz
+斯拉夫人 3 nrt
+斯拉夫斯基 51 nrt
+斯拉姆 6 nr
+斯拉德 3 nr
+斯拉曼 2 nr
+斯拉朗 2 nr
+斯拉法 3 nr
+斯拿波 3 ns
+斯捷潘 5 nr
+斯捷罗 5 nr
+斯提卜 3 nr
+斯摩棱斯克 22 ns
+斯摩第 16 nr
+斯政府 2 nt
+斯敦 5 ns
+斯数域 2 nr
+斯文 220 nr
+斯文人 3 nr
+斯文委地 3 n
+斯文扫地 10 nz
+斯文文 2 nr
+斯文森 3 nr
+斯断层 2 n
+斯斯文 6 nr
+斯斯文文 33 nr
+斯时 3 nr
+斯旺希 2 nr
+斯旺河 3 nr
+斯普京 4 ns
+斯普利特 4 nrt
+斯普拉格 2 nrt
+斯普林 3 nr
+斯普林斯 4 nrt
+斯普林菲尔德 10 nrt
+斯普瑞 12 nr
+斯普雷 3 nr
+斯普马 2 nr
+斯普鲁恩 4 nr
+斯曲蛇 2 nr
+斯曼特 2 nr
+斯杜特 18 nrt
+斯柯别 2 nr
+斯柯达 3 nr
+斯柳江 2 nr
+斯梅尔 2 nr
+斯梅尔塞 3 nrt
+斯梯尼 2 nr
+斯梯芬 4 nr
+斯比克 2 nr
+斯汀 10 nrt
+斯沃普 2 nr
+斯河 8 ns
+斯河中 3 ns
+斯河富 2 nr
+斯法克斯 5 nrt
+斯波利 3 nr
+斯波尔丁 2 nrt
+斯波特 7 nr
+斯波维 4 nr
+斯波莱 3 nr
+斯泰因 7 nr
+斯泰尔 2 nr
+斯泰尔斯 3 nrt
+斯泰尼 3 nr
+斯泰德 2 nr
+斯泰格 9 nr
+斯泰潘 2 nr
+斯泰福 4 nr
+斯泰纳 5 nr
+斯泰诺 2 nr
+斯洋 9 ns
+斯洛伐克 277 ns
+斯洛伐克人 19 nz
+斯洛伐克共和国 8 ns
+斯洛伐克政府 2 ns
+斯洛伐克语 7 nz
+斯洛博 4 nr
+斯洛文尼亚 115 nrt
+斯洛文尼亚人 18 nrt
+斯洛文尼亚共和国 2 ns
+斯洛文尼亚语 8 nz
+斯洛普 3 nr
+斯洛普格 4 nrt
+斯洛沃 2 nr
+斯洛科姆 3 nrt
+斯派克 3 nr
+斯派利 3 nr
+斯海 4 ns
+斯海东 2 nr
+斯海军 3 nr
+斯海姆 7 nr
+斯海尔德河 11 ns
+斯海峡 3 ns
+斯涅耳 10 nr
+斯涅金娜 2 nrt
+斯温群 2 nr
+斯港 4 ns
+斯湖 3 ns
+斯湾 9 ns
+斯滕堡 4 nr
+斯滕曼 3 nr
+斯滕达 3 nr
+斯潘塞 5 nr
+斯潘诺斯 3 nrt
+斯特 110 nrt
+斯特丽 3 nr
+斯特伐 27 nr
+斯特伦 5 nr
+斯特伯爵 4 nr
+斯特克 3 nr
+斯特兰 7 nr
+斯特凡 18 nr
+斯特凡诺 10 nrt
+斯特列 2 nr
+斯特利 22 nr
+斯特劳 5 nr
+斯特劳斯 13 nrt
+斯特勒 4 nr
+斯特化 5 nr
+斯特大 2 nr
+斯特家族 2 nz
+斯特尔 3 nr
+斯特尼 6 nr
+斯特山 3 nr
+斯特峰 7 nr
+斯特恩 33 nr
+斯特拉 170 nrt
+斯特拉斯伯格 4 nrt
+斯特拉斯堡 70 nrt
+斯特拉斯堡队 2 nz
+斯特拉特 3 nrt
+斯特拉特福 4 nrt
+斯特拉瑟 4 nrt
+斯特拉福德 2 nrt
+斯特拉迪瓦里 4 nrt
+斯特斯 2 nr
+斯特曼 4 nr
+斯特朗 15 nr
+斯特来 2 nr
+斯特林 48 nr
+斯特森 4 nr
+斯特水 4 nr
+斯特泉 6 nr
+斯特湖 6 nr
+斯特潘 3 nr
+斯特灵 4 nr
+斯特瑞 2 nr
+斯特瓦尔德 2 nrt
+斯特纳 18 nr
+斯特罗 10 nr
+斯特罗姆 2 nrt
+斯特若 3 nr
+斯特莱克 2 nrt
+斯特蒂 5 nr
+斯特赖克 16 nrt
+斯特郡 2 nr
+斯特里 5 nrt
+斯特里特 2 nrt
+斯特雷 4 nr
+斯特雷奇 4 nrt
+斯特高 2 nr
+斯特鲁普 2 nrt
+斯特默 4 nr
+斯率军 5 nr
+斯王 16 nrt
+斯玛伊 2 nr
+斯理女子 2 nr
+斯琴格 5 nr
+斯琴格勒 5 nr
+斯琴科 2 nr
+斯琴高娃 3 nr
+斯瑞克 63 nr
+斯瓦尔 10 nr
+斯瓦尔德 2 nrt
+斯瓦希 34 nr
+斯瓦希里 3 nrt
+斯瓦帕 2 nr
+斯瓦帕克 4 nrt
+斯瓦德 4 nr
+斯瓦扬 3 nr
+斯瓦拉 4 nrt
+斯瓦特 12 nr
+斯瓦蒂语 2 nr
+斯瓦辛格 4 nrt
+斯甲河 2 nr
+斯登 2 nrt
+斯登堡 3 nr
+斯的明 2 nr
+斯皮克 6 nr
+斯皮克曼 2 nrt
+斯皮奥 2 nr
+斯皮尔 3 nr
+斯皮尔伯格 8 nrt
+斯皮尔斯 2 nrt
+斯皮尔曼 4 nrt
+斯皮恩 2 nr
+斯皮拉 2 nr
+斯皮瓦克 3 nrt
+斯皮纳 2 nr
+斯皮里 3 nrt
+斯盖尔 2 nr
+斯盖鲁 2 nr
+斯盾舰 2 nr
+斯福尔 2 nr
+斯科伊 6 nr
+斯科会 3 nt
+斯科伦壳 3 nr
+斯科城 3 nr
+斯科夫 6 nr
+斯科娃 2 nr
+斯科尔尼 2 nrt
+斯科尔斯 6 nrt
+斯科拉 29 nr
+斯科拉里 3 nrt
+斯科普里 8 nrt
+斯科朗 2 nr
+斯科格 12 nr
+斯科河 4 nr
+斯科湾 2 nr
+斯科特 41 nr
+斯科科 4 nr
+斯科至 2 nr
+斯科舍 4 nr
+斯科菲尔德 6 nrt
+斯科蒂 2 nr
+斯科钦斯基 2 nr
+斯米 3 nrt
+斯米尔诺夫 2 nrt
+斯米德 2 nr
+斯米顿 2 nr
+斯约史 2 nr
+斯约堡 2 nr
+斯纳姆 4 nr
+斯纳布 4 nr
+斯维亚 3 nr
+斯维利 4 nr
+斯维尔 11 nr
+斯维尔德 6 nrt
+斯维尔德洛夫斯克州 3 nrt
+斯维特 10 nr
+斯维至 2 nr
+斯维里 3 nrt
+斯维雅 2 nr
+斯罗 5 nrt
+斯罗普 76 nr
+斯罗达 28 nr
+斯美塔 5 nr
+斯美塔纳 3 nr
+斯美塔那 3 ns
+斯美尔 2 nr
+斯脱 2 nrt
+斯艾利斯 2 ns
+斯芬克 7 nr
+斯芬克司 3 nr
+斯芬克斯 5 nr
+斯莫尔 7 nr
+斯莫尔尼 2 nrt
+斯莫尔尼宫 7 nrt
+斯莫泰 3 nr
+斯莫蒂科 2 nrt
+斯莱特 3 nr
+斯菲尔 5 nr
+斯菲尔德 119 nrt
+斯蒂勒 3 nr
+斯蒂夫 8 nr
+斯蒂奇 9 nr
+斯蒂尔 19 nr
+斯蒂尔杰 18 nr
+斯蒂德 2 nr
+斯蒂文 24 nr
+斯蒂文森 8 nr
+斯蒂普尔 2 nrt
+斯蒂格 5 nr
+斯蒂格利茨 25 nrt
+斯蒂法 6 nr
+斯蒂芬 39 nr
+斯蒂芬尼 2 nr
+斯蒂芬斯 5 nr
+斯蒂芬森 17 nr
+斯蒂贝 2 nr
+斯蒂贝林 7 nrt
+斯蒙德 3 nr
+斯行健 2 nr
+斯诺 101 nr
+斯诺伊 6 nr
+斯诺克 5 nr
+斯诺戈尔 2 nrt
+斯诺普斯 2 nrt
+斯诺沃 11 nr
+斯诺达 2 nr
+斯诺达尔 2 nrt
+斯谟则 16 nr
+斯豪森 3 nr
+斯贝克 3 nr
+斯贝格 5 nr
+斯贵支 6 nr
+斯费尔德 3 nrt
+斯达尔 4 nr
+斯达康 101 nr
+斯达河 3 nr
+斯达舒 4 nr
+斯迪克 3 nr
+斯迪格 2 nr
+斯通勒 2 nr
+斯通格 3 nr
+斯道夫 3 nr
+斯郡团 2 nr
+斯里兰卡 312 nrt
+斯里兰卡人 5 nrt
+斯里兰卡卢比 2 nrt
+斯里兰卡民主社会主义共和国 4 nt
+斯里巴加湾 3 ns
+斯里巴加湾市 4 ns
+斯里拉差 2 nr
+斯里星 2 nr
+斯金斯 62 nr
+斯金纳 15 nr
+斯钦合 3 nr
+斯铁阿 6 nr
+斯霍弗 3 nr
+斯韦尔 17 nr
+斯韦思林杯 4 nr
+斯韦特 7 nrt
+斯须之报 3 nr
+斯顿岛 2 ns
+斯顿笃 16 nr
+斯马 2 ns
+斯马国 2 ns
+斯马特 3 nr
+斯鲁一世 2 nr
+斯鲁茨卡娅 4 nrt
+斯麦任 2 nr
+斯麦号 7 nr
+斯麦式 4 nr
+斯齐亚沃 3 nr
+新 62626 a
+新一代 3 t
+新一任 3 b
+新一佳 3 nz
+新一季 3 t
+新一届 3 b
+新一期 3 b
+新一波 3 nr
+新一轮 3 nz
+新一集 3 nz
+新丁 2 nz
+新三样 3 l
+新不伦瑞克 4 ns
+新不伦瑞克省 3 ns
+新专辑 3 l
+新专集 3 j
+新世界 144 nz
+新世纪 477 nz
+新业 2 n
+新东 3 ns
+新东安 6 ns
+新东安市场 4 ns
+新东家 3 ns
+新东方 79 nz
+新东方学校 21 nt
+新丝路 3 n
+新中国报 3 nt
+新中源 3 ns
+新中街 3 ns
+新丰 9 nz
+新丰县 2 ns
+新丰江 3 ns
+新举措 3 i
+新义安 3 nz
+新义州 27 ns
+新乌 3 ns
+新乐 36 ns
+新乐县 3 ns
+新乐市 3 ns
+新乐府 55 nt
+新乐队 3 nt
+新乡 62 ns
+新乡化纤 2 nz
+新乡县 7 ns
+新乡市 19 ns
+新书 104 n
+新事新办 3 nz
+新井 4 ns
+新井白石 2 n
+新亚 18 ns
+新亚述 5 nr
+新交 3 nt
+新交法 3 n
+新亭 9 nz
+新亭对泣 3 i
+新亮点 3 n
+新人 715 n
+新人口论 6 n
+新人奖 4 nz
+新人新事 11 nz
+新人王 3 nz
+新人生观 3 nz
+新人辈出 3 l
+新仇旧恨 7 i
+新仓 4 ns
+新仙林 3 nr
+新任 350 n
+新会 77 n
+新会区 3 n
+新会县 11 ns
+新会员 3 n
+新会市 4 n
+新传 20 nz
+新低 48 v
+新体 3 n
+新体诗 3 n
+新体验 3 n
+新余 9 b
+新余市 17 ns
+新作 121 n
+新作文 3 n
+新佩特 2 nr
+新保安 19 ns
+新债 3 n
+新元 55 nz
+新元素 3 n
+新光 22 n
+新光人寿 3 nz
+新党 53 n
+新党员 3 n
+新党和平 4 nz
+新党章 3 n
+新兴 1215 b
+新兴事业 3 nt
+新兴产业 3 nt
+新兴力量 3 n
+新兴势力 3 i
+新兴区 3 ns
+新兴县 3 ns
+新兴国家 3 ns
+新兴学科 3 nt
+新兴村 2 ns
+新兴路 3 ns
+新兴里 14 ns
+新兵 285 n
+新兵入伍 3 n
+新兵教育 3 l
+新兵营 4 n
+新兵训练 3 n
+新兵连 8 ns
+新内阁 3 ns
+新内饰 3 n
+新军 223 n
+新农 36 nz
+新冰期 3 n
+新几内亚 3 ns
+新凤霞 2 nr
+新出土 3 n
+新出路 3 nt
+新刊 3 n
+新创 59 n
+新创建 3 nz
+新创意 3 n
+新利 2 ns
+新制 67 n
+新剧 47 n
+新力 5 n
+新力军 3 nt
+新力牌 3 n
+新加坡 1407 ns
+新加坡人 22 n
+新加坡人民行动党 4 nt
+新加坡元 10 ns
+新加坡共和国 7 ns
+新加坡国立大学 6 nt
+新加坡岛 3 ns
+新加坡政府 3 nt
+新加坡海峡 28 ns
+新加坡籍 2 n
+新加坡航空公司 13 nt
+新加坡队 5 nt
+新动力 25 n
+新动向 3 n
+新化 16 n
+新化县 5 ns
+新北仑 3 ns
+新北区 3 ns
+新北界 3 n
+新区 145 ns
+新区带 3 n
+新升 3 v
+新华 549 nz
+新华书店 58 nt
+新华信 3 nz
+新华出版社 11 nt
+新华制药 6 nt
+新华区 3 ns
+新华字典 3 ns
+新华拼音 3 n
+新华日报 3 nz
+新华村 3 ns
+新华码 3 n
+新华社 4854 nt
+新华社摄影部 4 nt
+新华社讯 3 nt
+新华网 1079 nz
+新华联 3 ns
+新华街 3 ns
+新华路 25 ns
+新华通讯社 25 nt
+新华门 774 ns
+新南威尔士 13 ns
+新南威尔士州 33 ns
+新印象派 3 n
+新厂 3 n
+新厂区 3 n
+新历 3 nz
+新去处 3 i
+新县 33 ns
+新发 3 nz
+新发于硎 3 nr
+新发型 3 n
+新发明 3 nz
+新古典主 3 n
+新古典主义 35 nz
+新召 3 ns
+新召苏木 3 ns
+新台币 119 n
+新台阶 3 n
+新叶 20 n
+新叶村 3 n
+新号 3 n
+新名词 23 n
+新周刊 3 n
+新和县 2 ns
+新品 106 n
+新品种 68 n
+新唐书 3 nz
+新唱片 3 n
+新商报 3 nz
+新喀里多尼亚 58 ns
+新四军 536 nt
+新园 8 ns
+新图 12 n
+新土尔 6 ns
+新圩 3 ns
+新圩镇 3 v
+新地产 3 j
+新地岛 12 ns
+新地带 3 n
+新场 2 n
+新址 148 n
+新坝 3 ns
+新坟 3 n
+新型 3591 b
+新型产业 3 n
+新型农村 3 nz
+新型建材 3 n
+新型材料 3 n
+新城 824 ns
+新城区 36 ns
+新城县 5 ns
+新城子区 3 ns
+新城疫 3 n
+新城里 3 ns
+新城镇 5 ns
+新埔 3 ns
+新埔工专 3 nt
+新埔工业 3 nt
+新堡 6 ns
+新堤 518 n
+新堰 3 ns
+新塘 4 ns
+新增 1177 v
+新增新招 3 nr
+新增额 3 n
+新墨西哥 12 ns
+新墨西哥州 44 ns
+新声 20 n
+新声路 2 n
+新大 12 nt
+新大新 2 nz
+新大洲 4 ns
+新大长 3 n
+新大陆 49 nz
+新天地 42 nz
+新天堂 3 nr
+新天骄 3 nr
+新太 4 nz
+新太科技 12 nz
+新奇 268 nrt
+新奇军 3 nr
+新奇感 8 n
+新奇特 3 nrt
+新奥尔良 42 nrt
+新奥尔良市 2 ns
+新奥运 3 nz
+新女装 3 n
+新妆 3 n
+新妇 37 n
+新姑爷 3 n
+新姿 9 n
+新娘 653 n
+新娘妆 3 nr
+新娘子 175 nr
+新娘新郎 3 nr
+新娘装 3 n
+新婚 437 v
+新婚之夜 3 i
+新婚夜 3 n
+新婚夫妇 3 n
+新婚姻法 2 n
+新婚旅行 3 n
+新婚燕尔 279 n
+新媳妇 3 n
+新媳妇儿 3 n
+新嫁娘 18 n
+新嫩葫芦 3 n
+新字 274 nz
+新学 182 n
+新学伪经 15 l
+新学小生 3 n
+新学年 3 n
+新学期 3 n
+新学说 3 n
+新宁 7 ns
+新宁县 4 ns
+新宅村 3 n
+新安 91 ns
+新安县 24 ns
+新安怡 3 nr
+新安江 63 ns
+新安江水库 7 nz
+新安镇 6 ns
+新宋体 3 nr
+新官 3 n
+新官上任 3 l
+新官上任三把火 10 i
+新定 3 b
+新宝来 3 nr
+新实在论 17 l
+新宠 40 a
+新宠儿 3 nr
+新宪公 4 nr
+新家 3 n
+新家具 3 n
+新家园 3 ns
+新宾 19 ns
+新宾满族自治县 3 ns
+新宿 8 n
+新密 3 ns
+新密县 3 ns
+新密市 5 ns
+新密码 3 n
+新富 12 nz
+新寡 3 n
+新居 106 n
+新居落成 3 i
+新屋 19 n
+新屋乡 3 ns
+新山 14 ns
+新岁 17 n
+新岗 3 ns
+新岛 3 ns
+新峰 3 ns
+新峰县 3 ns
+新崭崭 3 z
+新州 30 ns
+新州区 3 ns
+新工艺 3 n
+新巧 8 n
+新巴尔虎 3 nz
+新巴尔虎右旗 4 ns
+新巴尔虎左旗 4 ns
+新币 41 n
+新市 26 ns
+新市乡 3 ns
+新市区 41 nt
+新市村 3 ns
+新市镇 8 ns
+新帖 3 n
+新干县 3 ns
+新干线 59 n
+新平 41 ns
+新平县 2 ns
+新平彝族傣族自治县 3 ns
+新平镇 2 ns
+新年 570 t
+新年伊始 71 nz
+新年好 3 l
+新年快乐 3 l
+新年愉快 3 z
+新年新 3 b
+新年礼品 3 n
+新年礼物 3 l
+新年贺词 3 l
+新庄 7 ns
+新庄市 3 ns
+新庄镇 3 ns
+新店 39 ns
+新店子 2 n
+新店市 3 ns
+新店溪 3 ns
+新康德 8 nr
+新康网 3 nz
+新建 1000 ns
+新建县 4 ns
+新建户 3 n
+新建村 2 ns
+新开业 3 nz
+新开岭 4 ns
+新开工 3 nz
+新开幕 3 n
+新开河 7 ns
+新开河街 3 ns
+新开设 3 l
+新开路 3 nz
+新开通 3 nz
+新开铺 256 nz
+新异 10 n
+新式 540 n
+新张志喜 3 nr
+新形势下 3 i
+新形态 3 n
+新影联 3 nt
+新德利 3 ns
+新德里 173 nrt
+新快报 3 nt
+新思维 18 nr
+新思路 3 n
+新息 3 n
+新愁 3 a
+新愁旧恨 3 i
+新意 176 n
+新感受 3 l
+新房 232 n
+新房子 36 n
+新房网 3 n
+新手 68 n
+新手入门 3 nz
+新手机 17 nz
+新手村 3 nz
+新批评 3 n
+新技能 3 n
+新抚区 3 ns
+新报 77 nz
+新报讯 3 nz
+新招数 3 n
+新拟 3 b
+新拳 3 n
+新探 3 n
+新接 2 b
+新搜索 3 nr
+新撰组 3 n
+新攻势 3 n
+新政 403 n
+新政协 37 nt
+新政府 119 nt
+新政治国民会议 2 nt
+新故代谢 3 i
+新教 451 nz
+新教徒 52 n
+新教材 3 n
+新教派 11 n
+新教练 3 n
+新文 3 nz
+新文化 123 nz
+新文化运 3 nz
+新文化运动 392 nz
+新文学 70 nt
+新文学运动 18 nz
+新文艺 3 n
+新斯科舍 14 nrt
+新斯科舍省 10 ns
+新新人类 9 nz
+新方 4 n
+新方数码 3 n
+新方码 3 n
+新旗云 3 nr
+新旗舰 3 nt
+新日 7 nz
+新旧 211 ns
+新旧交接 3 i
+新旧交替 7 n
+新旧体制 3 n
+新旧社会 3 n
+新旧观念 3 n
+新时尚 3 n
+新时空 3 n
+新旺 3 ns
+新昌 26 ns
+新昌县 6 ns
+新明 3 nz
+新昏宴尔 3 nr
+新星 101 nz
+新春 289 ns
+新春伊始 6 nz
+新春佳节 3 nr
+新春快乐 3 i
+新春愉快 3 z
+新晃 5 nz
+新晚报 3 nz
+新景 20 n
+新景点 22 n
+新景观 14 n
+新曲 3 n
+新曹 3 ns
+新月 1231 t
+新月形 3 nz
+新月状 3 nz
+新月痕 3 n
+新朋 3 n
+新机 49 n
+新机制 38 n
+新机号 3 nz
+新机型 3 b
+新机种 3 b
+新机遇 3 n
+新村 391 ns
+新来乍到 18 i
+新来者 3 n
+新松 8 n
+新林 7 nz
+新枝 15 n
+新格局 3 nt
+新桂网 3 nz
+新桃换旧符 3 n
+新桥 287 ns
+新桥镇 4 ns
+新棉 6 n
+新楼 44 n
+新欠 3 n
+新欢 20 v
+新欢旧爱 3 l
+新款 84 n
+新款手机 3 nz
+新歌 3 n
+新正 8 nz
+新民 125 n
+新民主主 3 n
+新民主主义 611 nz
+新民主主义论 25 n
+新民主主义革命 586 nz
+新民党 5 nt
+新民县 2 ns
+新民学会 140 nt
+新民市 3 ns
+新民晚报 33 nz
+新民路 3 nz
+新气象 53 n
+新江 256 ns
+新江口 3 ns
+新江滩 3 ns
+新汴河 7 ns
+新汶 5 nz
+新沂 10 ns
+新沂县 3 ns
+新沂市 41 ns
+新沂河 24 ns
+新沙 262 ns
+新沙乡镇 2 ns
+新沭河 8 ns
+新河 598 ns
+新河县 5 ns
+新河口 3 ns
+新河镇 3 ns
+新泉城 3 ns
+新法 131 n
+新法案 3 n
+新泰 8 nz
+新泰市 7 ns
+新泽西 65 ns
+新泽西州 69 ns
+新洋 5 ns
+新津 12 ns
+新津县 3 ns
+新津机场 3 ns
+新洲 270 ns
+新洲区 257 ns
+新洲县 3 ns
+新派 58 n
+新浦 9 ns
+新浦区 3 ns
+新浪 653 nz
+新浪博 3 nz
+新浪潮 67 n
+新浪网 52 nz
+新浪网讯 3 nz
+新海 16 ns
+新添 3 v
+新港 828 ns
+新港路 3 nz
+新游戏 3 n
+新游网 3 nz
+新湖 13 ns
+新源 17 n
+新源县 2 ns
+新滩 4 ns
+新潮 125 n
+新潮派 3 nz
+新潮流 3 n
+新潮电子 3 nz
+新火星人 3 n
+新热带界 3 n
+新燕莎 3 nr
+新爱尔兰 2 ns
+新片 21 n
+新片试映 3 nz
+新片预告 3 n
+新版 397 b
+新牌 3 n
+新特 7 nrt
+新特兰 3 ns
+新玉四号 3 nz
+新理念 3 n
+新生 1379 n
+新生事件 3 n
+新生事物 71 nt
+新生代 217 n
+新生儿 248 n
+新生儿期 3 t
+新生党 3 nt
+新生力量 25 n
+新生北路 3 nt
+新生南路 3 nz
+新生大楼 3 nt
+新生报 3 nz
+新生活运 3 n
+新生界 11 n
+新生线 3 n
+新生训练 3 n
+新生路 3 nz
+新生黛 3 nr
+新用 3 n
+新田 28 nz
+新田县 2 ns
+新田村 3 ns
+新界 46 n
+新界埠乡 5 ns
+新界面 3 n
+新疆 2672 ns
+新疆人民出版社 6 nt
+新疆人民广播电台 2 nt
+新疆伊犁哈萨克自治州 3 ns
+新疆伊犁地区 2 ns
+新疆军区 18 nt
+新疆医科大学 3 nt
+新疆吐鲁番地区 6 ns
+新疆地区 42 ns
+新疆塔里木盆地 2 ns
+新疆大学 35 nt
+新疆巴音郭楞蒙古自治州 2 ns
+新疆师范大学 6 nt
+新疆建设兵团 8 nt
+新疆文物考古研究所 2 nt
+新疆棉 2 ns
+新疆班 9 ns
+新疆生产建设兵团 43 nt
+新疆省 44 ns
+新疆维吾尔 7 ns
+新疆维吾尔自治区 226 ns
+新疆维族 3 nz
+新疆自治区 3 ns
+新疆阿勒泰地区 2 ns
+新疗法 3 n
+新病毒 3 n
+新白云 3 ns
+新白娘子 3 n
+新的一页 3 n
+新的篇章 3 n
+新益求新 3 i
+新知 36 n
+新石器 818 n
+新石器时 3 t
+新硎初试 3 nr
+新神雕 3 n
+新禧 3 nrt
+新秀 137 nz
+新秀战 2 nr
+新秀水 3 nr
+新种 37 n
+新科 55 nz
+新科状元 390 nz
+新秦 3 t
+新秦中 3 nz
+新秩序 3 nr
+新税 3 n
+新税法 3 n
+新窗口 3 i
+新立 32 v
+新立屯 8 nr
+新立村 3 nr
+新章 5 n
+新竹 55 ns
+新竹人 3 n
+新竹县 14 ns
+新竹市 12 ns
+新竹师范 3 nr
+新策略 3 n
+新篁 5 ns
+新篇 17 b
+新篇章 31 n
+新约 92 ns
+新约全书 3 n
+新纪元 551 nz
+新纪录 3 n
+新纳粹 3 nr
+新纽泽西 3 nr
+新线 27 n
+新线路 3 n
+新绛 10 ns
+新绛县 3 ns
+新绩 3 n
+新绿 27 b
+新绿洲 2 ns
+新编 238 n
+新网 7 nz
+新网友 3 n
+新网址 3 n
+新网游 3 n
+新罕布什尔 7 nrt
+新罕布什尔州 9 nrt
+新罕布夏 3 nrt
+新罗 106 nz
+新罗区 3 ns
+新罗西斯克 2 ns
+新罗西斯克港 2 ns
+新翼 6 n
+新老交替 45 n
+新老朋友 2 n
+新老用户 3 n
+新联 25 ns
+新股 189 n
+新股申购 3 n
+新胜 3 n
+新能源 3 n
+新膨 3 l
+新舟 5 nz
+新航 36 j
+新艺城 3 ns
+新艺宝 3 nz
+新芜区 3 ns
+新芬党 38 n
+新花 3 n
+新花招 3 n
+新花样 3 l
+新花色 3 n
+新芽 3 n
+新苗 8 n
+新英格兰 59 ns
+新茶 50 n
+新荣区 3 ns
+新药 359 n
+新莱斯 2 ns
+新莽 99 nz
+新营 7 b
+新营市 3 n
+新营销 3 n
+新著 13 n
+新蓝筹 3 nr
+新蔡 24 ns
+新蔡县 3 ns
+新蕾 6 n
+新藏公路 27 nz
+新虎尾溪 3 ns
+新行 22 n
+新行势 3 n
+新街 19 ns
+新街口 17 ns
+新街镇 3 ns
+新衣 93 n
+新装 24 n
+新装修 3 l
+新西伯利亚 37 ns
+新西兰 647 ns
+新西兰人 15 nrt
+新西兰元 6 nz
+新西兰工党 3 nt
+新西兰政府 2 nt
+新西兰队 7 nt
+新视听 3 n
+新视界 3 n
+新视角 3 n
+新视通 3 nt
+新视野 3 n
+新解 7 v
+新警察 3 n
+新训 5 n
+新论 20 n
+新论断 3 l
+新设 3 nt
+新词 47 n
+新词汇 3 n
+新词语 3 i
+新诗 125 n
+新语 36 nz
+新语丝 3 n
+新语文 3 nz
+新诺明 9 nz
+新课改 3 n
+新课标 3 n
+新课程 3 n
+新象 2 n
+新貌 14 nz
+新账 3 n
+新货 3 n
+新购 3 v
+新贵 65 a
+新贷 3 n
+新赛欧 3 ns
+新起点 3 n
+新路 329 nz
+新路子 3 n
+新路海 3 ns
+新车 46 n
+新车型 3 n
+新辽河 3 ns
+新达 3 nz
+新近 322 t
+新进人员 3 n
+新进党 17 nt
+新进展 3 nt
+新途径 3 n
+新造 44 b
+新造型 3 n
+新邮 3 ns
+新邮件 3 n
+新邱区 3 ns
+新邵 3 ns
+新邵县 3 ns
+新郎 450 n
+新郎官 9 n
+新郎新娘 3 n
+新郑 98 ns
+新郑县 19 ns
+新郑市 15 ns
+新都区 3 ns
+新都县 3 ns
+新都市 3 ns
+新都桥 3 ns
+新野 125 n
+新野县 9 ns
+新金县 3 ns
+新金桥 2 nz
+新钞 14 n
+新钢钒 9 nr
+新铺 2 n
+新锐 37 a
+新锦江 3 ns
+新镇 9 ns
+新长征 3 n
+新闸 3 n
+新闻 12562 n
+新闻专科 3 nt
+新闻业 10 n
+新闻事业 3 n
+新闻人物 3 nt
+新闻公报 43 nt
+新闻出版 3 n
+新闻出版局 3 nt
+新闻出版界 3 n
+新闻出版署 6 nt
+新闻分析 3 l
+新闻办 10 nt
+新闻动态 3 n
+新闻台 4 nt
+新闻史 3 n
+新闻司 452 nt
+新闻周刊 3 n
+新闻处 36 nt
+新闻奖 9 nz
+新闻媒介 3 n
+新闻媒体 3 n
+新闻学 99 nt
+新闻官 108 n
+新闻官员 20 n
+新闻宣传 3 nz
+新闻局 38 nt
+新闻广播 3 nz
+新闻性 40 n
+新闻报导 3 n
+新闻报道 3 n
+新闻提要 3 n
+新闻政经 3 n
+新闻晚报 3 nz
+新闻晨报 3 nz
+新闻来源 3 n
+新闻标题 3 n
+新闻检查 3 n
+新闻炒作 3 n
+新闻点 5 n
+新闻热点 3 n
+新闻热线 3 n
+新闻照片 3 n
+新闻片 9 n
+新闻电影 3 n
+新闻界 375 n
+新闻瘾 3 n
+新闻社 117 nt
+新闻稿 185 n
+新闻简报 3 i
+新闻系 33 n
+新闻纵横 3 l
+新闻纸 26 n
+新闻线索 3 n
+新闻组 10 n
+新闻网 348 nz
+新闻联播 3 nz
+新闻自由 3 n
+新闻节目 3 n
+新闻记者 102 n
+新闻调查 3 l
+新闻资料 3 n
+新闻资讯 3 nt
+新闻追踪 3 i
+新闻通讯 3 nt
+新闻部 8 nt
+新闻部长 22 n
+新闻页 3 n
+新闻频道 3 n
+新阳 6 ns
+新阿姆斯特丹 7 ns
+新陈代谢 284 i
+新院 3 n
+新险种 3 n
+新雅 6 ns
+新雅途 3 n
+新雅阁 3 nr
+新集 16 n
+新雪丹 2 ns
+新霉素 14 n
+新青区 3 nt
+新面孔 3 n
+新面貌 3 nz
+新鞋 3 n
+新韵 5 n
+新页 3 n
+新页面 3 n
+新颖 333 a
+新颖别致 3 i
+新颖性 14 n
+新颜 267 nrt
+新风 615 n
+新风尚 3 n
+新风景 3 n
+新风暴 3 n
+新风气 3 n
+新风貌 3 nz
+新风量 3 n
+新飞 37 nz
+新饿乡 3 n
+新馆 50 n
+新马泰 3 nz
+新马路 3 nz
+新高 698 v
+新高峰 3 ns
+新高潮 3 nr
+新鲜 1691 ns
+新鲜事 63 nz
+新鲜事儿 14 nz
+新鲜出炉 3 nz
+新鲜味 3 nz
+新鲜度 6 ns
+新鲜感 52 n
+新鲜期 4 nz
+新鲜空气 3 nt
+新鲜肉 6 nz
+新鲜菜 2 nz
+新鲜血液 3 nz
+新鸿基 3 nr
+新黄浦 3 ns
+新龙 3 nz
+新龙华 2 nz
+新龙县 3 ns
+新龙头 3 ns
+新龙族 3 nz
+新龙门 3 ns
+斲轮老手 3 nz
+斵轮老手 3 nz
+方 13166 n
+方一藻 3 nr
+方丈 840 n
+方丈室 3 n
+方与圆 3 nr
+方且 3 d
+方世玉 3 nr
+方东白 13 nr
+方中信 3 nr
+方为 3 n
+方为人上 3 l
+方义 2 n
+方之国 2 nr
+方书 3 n
+方于鲁 2 nr
+方云伟 2 nr
+方人 3 n
+方人智 52 nr
+方今 5 t
+方今先 2 nr
+方今圣 4 nr
+方今汉 2 nr
+方从义 2 nr
+方从哲 36 nr
+方从洞 2 nr
+方仙道 3 nr
+方代扣 2 n
+方以智 298 nr
+方以类聚 2 i
+方伯平 35 nr
+方伯谦 66 nr
+方位 732 n
+方位图 3 n
+方位感 3 n
+方位投影 3 n
+方位控制 3 n
+方位校正 3 n
+方位知觉 3 n
+方位角 55 n
+方位词 2 n
+方佳翮 2 nr
+方便 3718 a
+方便之门 16 n
+方便使用 3 n
+方便快捷 17 z
+方便性 13 n
+方便筷 3 n
+方便管理 2 n
+方便群众 3 n
+方便袋 3 n
+方便铲 19 n
+方便面 113 n
+方便面碗 2 n
+方信 5 n
+方儿 5 n
+方兄 3 n
+方兆本 2 nr
+方兆祥 3 nr
+方先之 2 nr
+方先觉 5 nr
+方克勤 4 nr
+方公尺 3 nr
+方公里 3 n
+方兴东 8 nr
+方兴未已 3 i
+方兴未艾 86 i
+方内 3 n
+方军 77 n
+方冠三 2 nr
+方准 7 n
+方凳 18 n
+方初逢 2 nr
+方利平 2 nr
+方剂 191 n
+方剂学 5 n
+方剑尖 2 nr
+方力申 3 nr
+方励之 3 nr
+方化 3 n
+方千驹 2 nr
+方卓芬 2 nr
+方口 3 n
+方口阔 2 nr
+方口齐 2 nr
+方可 430 n
+方可开 2 nr
+方可言 3 nr
+方可进 3 nr
+方司 4 n
+方司主 9 n
+方各庄 2 nr
+方合 3 n
+方向 8151 n
+方向不同 4 i
+方向向 11 n
+方向性 81 n
+方向感 20 n
+方向机 7 n
+方向标 3 n
+方向照明 3 nr
+方向盘 66 n
+方向箭头 3 n
+方向线 3 n
+方向舵 29 nr
+方向错觉 3 n
+方向键 3 n
+方员可施 3 n
+方善柱 2 nr
+方国 3 n
+方国安 37 nr
+方国珍 29 nr
+方国瑜 4 nr
+方圆 285 n
+方圆十里 3 n
+方圆可施 3 n
+方均位移 3 n
+方均根 4 nr
+方块 63 n
+方块图 3 n
+方块字 10 nz
+方块酥 3 n
+方型 12 n
+方城 290 n
+方城之战 3 nz
+方城县 9 ns
+方城战 3 nz
+方域 2 n
+方堂 2 n
+方塔 11 n
+方塔园 2 nr
+方塘 5 n
+方士 113 n
+方壮盛 2 nr
+方声洞 2 n
+方壶 10 n
+方外 3 n
+方外之人 7 n
+方外之国 3 n
+方外圆 6 n
+方外纪 4 n
+方夜潭 2 nr
+方大人 3 nr
+方大同 3 nr
+方大林 28 nr
+方大洪 3 nr
+方大雄 4 nr
+方天 2 t
+方天劳 15 nr
+方天定 19 nr
+方天戟 19 nr
+方天画 3 n
+方头 17 n
+方头不劣 3 a
+方头不律 3 l
+方头健 2 nr
+方妙 5 a
+方始 226 a
+方子 106 n
+方子哥 3 nr
+方孔 16 n
+方孔中 10 nr
+方孔圆 4 nr
+方孔昭 14 nr
+方字 3 n
+方孝儒 6 nr
+方孝孺 61 nrfg
+方季惟 3 nr
+方宁考 2 nr
+方宏霞 2 nr
+方家 89 n
+方家栏 2 nr
+方家见笑 3 nr
+方密 8 n
+方密之 9 nr
+方寸 86 n
+方寸万重 3 i
+方寸不乱 3 i
+方寸之地 2 i
+方寸之间 3 i
+方寸地 3 n
+方寸大乱 3 i
+方寸已乱 5 i
+方寸无主 3 i
+方小顿 256 nr
+方尖碑 13 n
+方尺 3 n
+方山 77 n
+方山县 9 ns
+方岩 4 n
+方岳宗 26 nr
+方岳贡 4 nr
+方巡抚 6 nr
+方差 84 n
+方差分析 3 l
+方差齐性 3 i
+方巾 72 n
+方巾气 3 n
+方师姊 6 nr
+方平 24 n
+方广宏 7 nr
+方广寺 8 nr
+方庄 23 n
+方庄店 3 n
+方庆灵 3 nr
+方底圆盖 3 n
+方府 2 n
+方式 16797 n
+方弱冠 2 n
+方形 494 n
+方形丝 3 n
+方形管 3 n
+方彭君 2 nr
+方得通 2 nr
+方志 67 n
+方志学 3 n
+方志敏 44 nr
+方怡叹 4 nr
+方怡奇 2 nr
+方怡抱 2 nr
+方怡方 4 nr
+方怡来 2 nr
+方怡笑 5 nr
+方悟 4 n
+方慢慢 4 n
+方成 25 nrfg
+方成培 2 nr
+方才 1355 n
+方才能 2 nr
+方技 3 n
+方括号 13 n
+方拱乾 3 nr
+方振武 12 nr
+方掬芬 5 nr
+方整 3 a
+方文山 6 nr
+方文琳 3 nr
+方新民 3 nr
+方方 6 n
+方方正正 26 nr
+方方面面 156 n
+方时亨 2 nr
+方明 4 n
+方明东 2 nr
+方春祥 5 nr
+方显 2 a
+方显本 2 n
+方晶 3 n
+方有何 2 nr
+方有利 2 nr
+方有圆 3 nr
+方有备 2 n
+方有德 28 nr
+方有权 2 n
+方有生 4 nr
+方木 17 n
+方术 92 n
+方术之 5 nr
+方李邦 256 nr
+方来剑 3 nr
+方来招 4 nr
+方来未艾 3 i
+方杰见 4 nr
+方枘圆凿 3 v
+方枘圜凿 3 v
+方柱 38 n
+方柱石 2 nr
+方树桥 3 nr
+方根 29 n
+方根值 3 n
+方格 85 n
+方格呢 3 nr
+方格子 3 nr
+方格形 3 n
+方格砖 3 nr
+方格纸 3 nz
+方格花布 3 nr
+方桃譬李 3 ns
+方框 27 n
+方框图 3 n
+方框框 3 n
+方案 7097 n
+方案估算 3 n
+方案设计 3 n
+方桌 114 n
+方歌 2 n
+方正 144 nr
+方正不阿 3 i
+方正县 3 nr
+方正电脑 3 n
+方正科技 15 nz
+方正贤亮 3 nr
+方正集团 3 n
+方步 8 d
+方殿 2 n
+方殿中 2 nr
+方毅 6 nr
+方毓棠 2 nr
+方水 2 n
+方法 18045 n
+方法学 47 n
+方法论 236 n
+方波 10 n
+方洪波 2 nr
+方浅梅 3 nr
+方济 6 n
+方济会 3 n
+方济各 27 nr
+方淑兰 2 nrfg
+方清吏 3 nr
+方渐平 2 nr
+方滋未艾 3 nr
+方焦面 2 n
+方熠 3 z
+方牧 3 n
+方献夫 3 nr
+方率军 2 nr
+方理 7 n
+方琦景 2 nr
+方琴 2 n
+方生 41 n
+方生大师 18 n
+方生方 5 n
+方用丹 5 nr
+方用保 7 nr
+方用宣 2 nr
+方用杏 3 nr
+方用清 6 nr
+方用玉 3 nr
+方用理 2 n
+方用益 3 n
+方用良 2 nr
+方用芩 2 n
+方用香 3 nr
+方田均 4 nr
+方略 445 n
+方略图 3 n
+方皓玟 3 i
+方益波 3 nr
+方盒 3 n
+方相 3 n
+方相氏 10 nr
+方知 35 n
+方知其 2 nr
+方知晓 2 nr
+方知端 4 n
+方石岭 3 nr
+方砖 191 n
+方积 2 n
+方程 1150 n
+方程式 160 n
+方程式赛车 3 n
+方程组 146 n
+方程解 3 n
+方穹顶 3 z
+方章钺 2 nr
+方竹 5 n
+方竹林 6 nr
+方等军 2 n
+方策 24 n
+方策万 2 nr
+方糖 5 n
+方维 2 n
+方老爷 17 nr
+方老爹 3 nr
+方胜 3 nr
+方胜球 2 n
+方能 3 n
+方能保 4 nr
+方能建 2 nr
+方能胜 3 nr
+方脸 4 n
+方腊 62 nr
+方腊加 2 nz
+方腊国 2 n
+方腊御 3 nr
+方腊方 2 n
+方腊正 2 nr
+方腊见 4 n
+方腊起义 3 nz
+方自强 3 nrfg
+方至圣 5 nr
+方舆 3 n
+方舒倾 3 nr
+方舟 67 n
+方舟子 3 nr
+方舟波 3 nr
+方舱 20 n
+方舵主 3 n
+方荣翔 3 nr
+方药 33 n
+方薇 2 n
+方行 2 n
+方西 3 n
+方西传 5 nr
+方西冷 144 nr
+方觉 3 n
+方解石 333 n
+方言 1480 n
+方言俚语 3 v
+方言土语 9 i
+方言学 23 n
+方言版 3 n
+方言矩行 3 i
+方言词 14 n
+方许换 2 nr
+方证 93 n
+方证叹 2 nr
+方证喜 2 n
+方证大师 37 n
+方证微微 3 nr
+方诗铭 9 nr
+方貌 6 n
+方越 53 d
+方足 2 a
+方足圆颅 3 n
+方趾圆颅 3 n
+方迟未 2 nr
+方逢时 3 nr
+方里 3 n
+方量 2 n
+方金星 2 nr
+方针 4251 n
+方针政策 3 n
+方钠石 3 nr
+方铅矿 22 n
+方铢贤 2 n
+方锉 3 n
+方锐 3 a
+方镁石 2 nr
+方镇洛 2 nr
+方长平 2 nr
+方队 57 n
+方阵 156 n
+方阿陶 2 nr
+方青书 2 nr
+方青卓 2 nr
+方靖 2 nr
+方面 26963 n
+方面军 266 n
+方面多么 3 l
+方面大耳 3 n
+方音 7 n
+方顺吉 3 nr
+方顺石 3 nr
+方领 2 n
+方领圆冠 3 n
+方领矩步 3 i
+方驰华 5 nr
+方骖并路 3 nr
+方骨 2 n
+方鸿渐 2 nr
+方黄宏 3 nr
+方龄贵 10 nr
+斺 235 zg
+斻 45 zg
+於 482 nr
+於乎 3 nr
+於刀剑 2 nr
+於制刀 2 nr
+於嘉轩 3 nr
+於天子 10 nr
+於太尉 2 nr
+於安乐 2 nr
+於巳午 3 nr
+於扶罗 3 nr
+於方田 8 nr
+於梨华 2 nr
+於水边 2 nr
+於江浙 2 nr
+於行功 3 nr
+於陈桥 3 nr
+施 2857 nr
+施一礼 3 nr
+施万 6 nrt
+施下礼 3 nr
+施不忘报 3 i
+施与 8 v
+施世纶 3 nr
+施业 2 vn
+施中诚 7 nr
+施临 2 v
+施为 3 v
+施主 472 v
+施之皓 3 i
+施乐 8 nr
+施乐公司 8 nt
+施予 7 v
+施事 3 v
+施事者 3 n
+施京明 3 nr
+施人布泽 3 nr
+施仁义 6 nr
+施仁布德 3 nr
+施今墨 7 nr
+施仕纶 2 nr
+施令威 19 nr
+施以 97 v
+施以可 2 nr
+施以援 4 nr
+施以暴力 3 nr
+施以青 2 nr
+施作用力 3 n
+施佩曲线 3 nr
+施佩曼 7 nr
+施催眠术 3 nr
+施光南 16 nr
+施光耀 4 nr
+施公奇案 3 n
+施公案 3 n
+施关发 4 nr
+施军门 5 nr
+施凤来 2 nr
+施利芬 9 nr
+施剑翘 2 nr
+施力点 3 nr
+施力臂 3 nr
+施加 438 v
+施加压力 3 n
+施加影响 3 n
+施动者 2 n
+施劲 3 v
+施勇峰 3 nr
+施华洛 3 nr
+施卢赫 3 nr
+施压 99 v
+施压力 3 n
+施可汗 3 nr
+施号发令 3 n
+施吕特 2 nr
+施命发号 3 nz
+施国光 2 nr
+施国祁 3 nr
+施坦因 2 nr
+施塔 8 nrt
+施塔姆 5 nr
+施塔斯 3 nr
+施塔特 16 nr
+施复亮 5 nr
+施大宇 3 nr
+施大生 3 nr
+施奈德 15 nr
+施威 33 nr
+施存统 12 nr
+施家礼 2 nr
+施密德 3 nr
+施密特 38 nr
+施封锁 3 nr
+施射 3 v
+施将军 15 nr
+施小策 2 nr
+施小计 16 nr
+施展 897 vn
+施展才华 3 nr
+施展才能 3 nr
+施展抱负 3 nr
+施属 3 vn
+施工 2140 vn
+施工人员 3 n
+施工单位 3 n
+施工员 3 n
+施工图 5 nr
+施工工艺 3 nt
+施工方 5 n
+施工期 7 n
+施工现场 3 n
+施工监督 3 n
+施工纪录 3 n
+施工者 2 n
+施工进度 3 n
+施工队 166 nt
+施平礼 2 nr
+施康强 2 nr
+施开 3 v
+施开轻 2 nr
+施怀谷 5 nr
+施恒新 5 nr
+施恩 195 nr
+施恩不望 3 nr
+施恩布德 3 nrt
+施恩惠 3 nr
+施惠 3 vn
+施惠国 3 nr
+施戴子 26 nr
+施托 3 nrt
+施托克 3 nr
+施托姆 4 nr
+施托尔 3 nr
+施托尔滕贝格 2 nrt
+施拉姆 17 nr
+施拉普纳 3 nrt
+施放 156 v
+施放烟火 3 n
+施政 291 nr
+施政报告 3 n
+施政纲领 3 nr
+施政者 3 nr
+施故法 2 nr
+施救 74 v
+施教 17 v
+施文彬 3 nrfg
+施文绣 2 nr
+施斋 3 nr
+施施 2 v
+施施然 3 nr
+施施而行 3 nr
+施明德 3 nr
+施明慎 15 nr
+施易男 3 nr
+施普林 10 nr
+施普雷 6 nr
+施暗袭 4 nr
+施暴 7 nr
+施暴者 3 nr
+施有政 2 nr
+施本格 2 nr
+施术 3 n
+施术者 10 n
+施朱傅粉 3 nr
+施正柏 3 nr
+施正荣 3 nr
+施毒 12 v
+施毒术 3 n
+施氏鲟 3 n
+施水阁 8 nr
+施永才 2 nr
+施治 35 v
+施治者 4 n
+施法 19 vn
+施泰因 44 nr
+施泰尔 6 nr
+施泰格 9 nr
+施泰特 11 nr
+施泰纳 18 nr
+施泽华 2 nr
+施洗 13 vn
+施洗约翰 3 nr
+施济 32 n
+施海兵 10 nr
+施润玖 3 nr
+施淡彩 5 nr
+施温格 10 nr
+施潘达 3 nr
+施特 9 nrt
+施特劳斯 71 nrt
+施特尔 2 nr
+施特德 2 nr
+施特拉 4 nrt
+施特拉斯堡 4 nrt
+施特莱 2 nr
+施玉主 2 nr
+施琅 313 nrfg
+施瑞伯 2 nr
+施瓦兹 4 nr
+施瓦尔 2 nr
+施瓦布 8 nr
+施瓦斯 2 nr
+施瓦本 13 nr
+施瓦茨 22 nrt
+施瓦茨科普夫 4 nrt
+施瓦辛格 13 nrt
+施生平 2 nr
+施用 148 v
+施用量 278 n
+施甸 6 nrfg
+施甸县 3 ns
+施皮茨 3 nrt
+施礼 253 nr
+施秉 3 nr
+施秉县 3 nr
+施米特 25 nr
+施米登 2 nr
+施粉 2 nr
+施粉黛 8 nr
+施纳贝尔 5 nrt
+施纽特 3 nr
+施给 3 vn
+施绯拖绿 3 z
+施维群 2 nr
+施维茨 7 nrt
+施罗德 19 nr
+施翠玲 3 nr
+施而不费 3 v
+施耐庵 30 nr
+施耐德 35 nr
+施耕伊 2 nr
+施肥 134 v
+施肥位置 3 n
+施肥料 3 n
+施肥机 2 n
+施肥量 8 n
+施胶 2 n
+施舍 166 nrt
+施药 20 v
+施药亭 2 nr
+施莱尔 4 nr
+施莱格尔 5 nrt
+施莱歇 9 nr
+施莱登 16 nr
+施莱谢 5 nr
+施莱辛 5 nr
+施蒂勒 10 nr
+施蒂林 2 nr
+施蒂纳 11 nr
+施蒂里 2 nr
+施虐 3 v
+施虐癖 3 n
+施行 1744 v
+施行细则 3 n
+施衿结褵 3 nr
+施训 12 vn
+施设 7 vn
+施诊 3 v
+施诺巴 3 nr
+施贵宝 11 nr
+施赖尔 8 nr
+施都丁 15 nr
+施里弗 19 nr
+施里芬 2 nr
+施针 3 nrt
+施陶丁 12 nr
+施陶芬贝格 9 nr
+施雅风 4 nr
+施雷廷 3 nr
+施雷格线 3 nr
+施食坛 2 nr
+施马伦塞 2 nrt
+施高塔 2 nr
+施鸿鄂 2 nr
+施鹏翔 5 nr
+斾 298 zg
+斿 460 zg
+旀 284 zg
+旁 5260 f
+旁人 1731 r
+旁侧 21 f
+旁侧序列 3 n
+旁切圆 3 i
+旁午 3 n
+旁压力 3 n
+旁及 24 ns
+旁听 399 v
+旁听席 3 i
+旁听生 8 i
+旁听者 2 n
+旁坐 3 v
+旁岔 3 ns
+旁岔儿 3 l
+旁引曲证 3 n
+旁征博引 23 i
+旁徵博引 3 nz
+旁心 3 n
+旁指曲谕 3 n
+旁推侧引 3 i
+旁搜博采 3 l
+旁支 42 n
+旁收博采 3 i
+旁敲侧击 48 i
+旁文剩义 3 i
+旁枝 3 n
+旁枝末节 3 i
+旁求博考 3 ns
+旁注 8 v
+旁瓣 3 n
+旁生 3 v
+旁白 17 v
+旁礴 3 v
+旁移 3 v
+旁站 26 n
+旁系 3 n
+旁系亲 3 n
+旁系亲属 10 l
+旁系血亲 3 n
+旁若无人 90 i
+旁落 48 v
+旁蒐远绍 3 ns
+旁行斜上 3 l
+旁见侧出 3 i
+旁观 327 n
+旁观者 100 n
+旁观者清 27 i
+旁证 15 v
+旁证博引 3 n
+旁路 11 ns
+旁边 3728 f
+旁边儿 2 n
+旁通 4 ns
+旁通曲畅 3 i
+旁逸斜出 3 vn
+旁逸横出 3 i
+旁遮普 121 ns
+旁遮普省 24 ns
+旁遮普邦 12 ns
+旁门 178 ns
+旁门外道 2 l
+旁门小道 3 i
+旁门左道 86 ns
+旁门邪道 3 i
+旁骛 15 n
+旂 176 zg
+旃 100 g
+旃檀 9 n
+旄 64 g
+旅 2722 n
+旅业 19 n
+旅之星 3 nz
+旅交会 177 j
+旅人 53 n
+旅伴 4 n
+旅俄 3 ns
+旅充 3 v
+旅团长 10 n
+旅外 8 vn
+旅外多年 3 n
+旅大 3 nz
+旅大市 2 ns
+旅客 1554 n
+旅客之家 3 n
+旅客列车 3 n
+旅客席 3 n
+旅客机 12 n
+旅客通道 3 n
+旅客量 4 n
+旅居 92 n
+旅居海外 3 nz
+旅差费 3 n
+旅店 390 n
+旅日 4 vn
+旅检 2 j
+旅次 3 n
+旅欧 27 ns
+旅欧中国少年共产党 8 nt
+旅法 26 n
+旅港 3 ns
+旅游 16124 vn
+旅游业 1203 n
+旅游业界 58 n
+旅游业者 10 n
+旅游事业 3 n
+旅游包 5 n
+旅游区 2039 n
+旅游名县 3 ns
+旅游品 3 n
+旅游团 116 n
+旅游圈 13 n
+旅游地理 3 n
+旅游地质 3 n
+旅游城 18 n
+旅游委 5 n
+旅游客量 3 n
+旅游局 841 n
+旅游局长 7 n
+旅游展 5 nt
+旅游总局 2 nt
+旅游指南 3 ns
+旅游文化节 3 n
+旅游景点 3 n
+旅游点 111 n
+旅游热 11 n
+旅游热线 3 n
+旅游界 66 n
+旅游社 3 n
+旅游线 48 n
+旅游网 3 n
+旅游者 369 n
+旅游胜地 237 n
+旅游船 8 n
+旅游节 88 n
+旅游观光 3 n
+旅游费 6 n
+旅游车 25 n
+旅游部 42 n
+旅游鞋 10 n
+旅社 80 n
+旅程 130 n
+旅美 21 vn
+旅美多年 3 ns
+旅美学人 3 n
+旅者 4 n
+旅舍 110 n
+旅行 1131 vn
+旅行包 28 n
+旅行团 73 n
+旅行家 219 n
+旅行愉快 3 z
+旅行支票 3 n
+旅行社 2232 n
+旅行箱 5 n
+旅行网 3 n
+旅行者 166 n
+旅行袋 19 n
+旅行装 3 n
+旅行证 3 n
+旅行车 7 n
+旅行队 3 n
+旅费 42 vn
+旅资 3 vn
+旅进旅退 3 n
+旅途 283 n
+旅途劳顿 3 n
+旅途愉快 3 z
+旅长 172 n
+旅顺 191 nz
+旅顺口 49 ns
+旅顺口区 5 ns
+旅馆 619 n
+旅馆业 8 n
+旅馆化 3 n
+旅馆老板 3 n
+旅鼠 3 n
+旆 84 g
+旇 232 zg
+旈 82 zg
+旉 4 zg
+旋 1180 n
+旋乾转坤 3 i
+旋儿 21 n
+旋光性 37 n
+旋入 4 v
+旋切 6 v
+旋切机 3 n
+旋动 8 v
+旋即 167 d
+旋压 4 n
+旋回 26 v
+旋塞 3 v
+旋塞阀 2 n
+旋复花 3 n
+旋子 17 n
+旋宫 11 n
+旋干转坤 3 n
+旋床 4 n
+旋开 3 v
+旋影 3 n
+旋律 424 n
+旋律优美 3 v
+旋得旋失 3 n
+旋振筛 3 nz
+旋木雀 3 n
+旋梯 3 n
+旋毛 3 n
+旋毛虫 7 n
+旋流 5 n
+旋流器 3 n
+旋涡 245 n
+旋涡星云 4 l
+旋涡泵 3 n
+旋滚 3 v
+旋生旋灭 3 i
+旋电媒质 3 n
+旋磁器件 3 n
+旋磁媒质 3 n
+旋紧 3 d
+旋纽 3 n
+旋绕 5 v
+旋绕着 3 l
+旋翼 100 n
+旋翼机 3 n
+旋耕 8 v
+旋耕机 7 n
+旋臂 61 n
+旋覆花 2 i
+旋调管 3 n
+旋踵 5 v
+旋踵即逝 3 i
+旋转 1307 v
+旋转乾坤 3 i
+旋转体 10 n
+旋转关节 3 n
+旋转具 3 n
+旋转变换 6 l
+旋转干坤 3 n
+旋转式 39 n
+旋转法 3 n
+旋转泵 3 n
+旋转物 3 n
+旋转知觉 3 n
+旋转磁场 3 n
+旋转翼 2 n
+旋转设计 3 n
+旋转起重 3 l
+旋转轴 20 n
+旋转钻机 3 nz
+旋转门 6 n
+旋进 3 v
+旋进角 3 n
+旋量群 3 n
+旋量范 3 n
+旋量表示 3 n
+旋钮 21 n
+旋铆机 3 vn
+旋风 423 n
+旋风式 2 n
+旋风腿 3 n
+旋风装 3 n
+旌 161 n
+旌德 2 nrt
+旌德县 3 ns
+旌旗 310 n
+旌旗价 3 n
+旌旗卷舒 3 n
+旌旗招展 12 i
+旌旗蔽日 3 i
+旌旗蔽空 3 i
+旌节 3 n
+旌表 10 n
+旌阳 9 ns
+旌阳区 3 ns
+旎 43 x
+族 5215 ng
+族亲 3 n
+族人 455 n
+族人们 7 n
+族兄 3 n
+族姓 3 n
+族弟 3 n
+族杀 3 n
+族权 19 n
+族类 46 n
+族群 99 n
+族裔 36 n
+族规 26 n
+族诛 24 n
+族谱 40 n
+族长 206 n
+旒 39 g
+旓 158 zg
+旖 28 l
+旖旎 35 a
+旖旎风光 11 l
+旗 3704 n
+旗下 577 n
+旗主 50 n
+旗人 170 n
+旗儿 3 n
+旗号 376 n
+旗子 234 n
+旗山 4 n
+旗帜 1360 n
+旗帜性 2 i
+旗帜鲜明 98 i
+旗幡 28 n
+旗开得胜 52 i
+旗手 44 n
+旗杆 339 n
+旗标 3 n
+旗汛口 3 n
+旗穗 3 n
+旗竿 3 n
+旗舰 217 n
+旗舰型 3 vn
+旗舰店 3 v
+旗舰机 3 vn
+旗舰版 3 vn
+旗舰级 3 vn
+旗袍 247 n
+旗袍装 3 n
+旗袍裙 2 n
+旗袍领 3 n
+旗语 7 n
+旗靡辙乱 3 vn
+旗飘扬 3 i
+旗鱼 3 n
+旗鼓 42 n
+旗鼓相当 65 i
+旗鼓相望 3 i
+旛 3 zg
+无 42181 v
+无一不备 3 l
+无一不是 3 c
+无一不知 3 i
+无一不精 3 l
+无一不能 3 l
+无一不通 3 l
+无一例外 102 l
+无一幸免 3 l
+无一物 3 l
+无万大千 3 m
+无上 122 d
+无上光荣 4 i
+无上装 3 l
+无下箸处 3 vn
+无下级 3 l
+无不 2556 d
+无不及 4 c
+无与为比 3 i
+无与伦比 230 i
+无与比伦 3 i
+无业 37 n
+无业人员 3 n
+无业游民 17 n
+无丝有线 3 l
+无中生有 112 b
+无为 227 c
+无为之治 3 l
+无为县 15 nr
+无为而成 3 i
+无为而治 33 l
+无为自化 3 i
+无为自成 3 i
+无主 3 v
+无主儿 2 n
+无主物 3 n
+无义之 5 i
+无乎不可 3 i
+无了无休 3 i
+无了根蒂 3 i
+无事 3 v
+无事不登三宝殿 16 i
+无事忙 5 i
+无事故 3 i
+无事生事 3 l
+无事生非 22 i
+无产 43 v
+无产者 78 n
+无产阶级 2401 l
+无产阶级化 5 l
+无亮点 3 z
+无亲无故 39 i
+无人 2874 n
+无人不晓 28 i
+无人不知 45 i
+无人之地 6 i
+无人之境 9 l
+无人争夺 3 i
+无人保证 3 n
+无人化 4 l
+无人区 75 ns
+无人售票 3 n
+无人居住 3 i
+无人岛 3 ns
+无人性 3 n
+无人惋惜 3 vn
+无人敌 3 i
+无人机 488 l
+无人知晓 3 i
+无人管 3 l
+无人能敌 3 i
+无人认领 3 l
+无人过问 18 l
+无人迹 3 i
+无人问津 31 l
+无人驾驶 3 nr
+无仁无义 2 i
+无从 640 v
+无从下手 41 l
+无从交代 3 i
+无从查证 3 i
+无从着手 3 l
+无从置喙 3 i
+无从说起 3 i
+无从谈起 27 i
+无从选择 3 l
+无以 485 c
+无以为报 3 i
+无以为生 3 i
+无以为继 6 i
+无以伦比 3 i
+无以塞责 3 i
+无以复加 33 l
+无以置答 3 l
+无以至千里 2 i
+无以言状 3 i
+无价 11 v
+无价之宝 57 l
+无价宝 5 l
+无任 3 v
+无任之禄 3 l
+无休 3 v
+无休无止 30 l
+无休止 76 l
+无伤 3 v
+无伤大体 2 nz
+无伤大雅 32 i
+无伤无臭 3 i
+无伸缩性 3 l
+无伺可对 3 v
+无何 3 l
+无何有乡 3 l
+无余 51 b
+无例外 42 l
+无供给 3 n
+无依无靠 68 i
+无保留 3 nr
+无保留地 3 l
+无倚无靠 3 i
+无假货 3 i
+无偏 8 d
+无偏性 4 l
+无偏无倚 3 i
+无偏无党 3 i
+无偏无陂 3 n
+无偏无颇 3 l
+无偏见 3 i
+无偿 662 v
+无偿性 7 n
+无偿援助 3 i
+无偿献血 3 i
+无偿献血者 2 n
+无儿无女 15 l
+无兄盗嫂 3 n
+无先例 3 i
+无光 3 c
+无光泽 3 nr
+无光采 2 i
+无党 3 n
+无党无偏 3 n
+无党无派 3 l
+无党派 61 n
+无党派人士 88 n
+无党籍 3 n
+无公害 16 l
+无关 828 v
+无关大体 3 l
+无关大局 17 l
+无关宏旨 14 i
+无关痛养 3 i
+无关痛痒 24 i
+无关紧要 141 l
+无兴复 2 i
+无兴趣 3 l
+无其伦比 3 i
+无其奈何 3 i
+无冕之王 6 i
+无冤无仇 75 i
+无冬之夜 3 l
+无冬历夏 3 ns
+无冬无夏 3 nr
+无决断 3 l
+无冷凝 3 nr
+无凝结 3 n
+无几 33 c
+无凭无据 3 i
+无出其右 15 i
+无分 3 d
+无分彼此 3 l
+无分轩轾 3 nr
+无则加勉 11 i
+无创伤 3 l
+无判断力 3 n
+无利 3 ns
+无利可图 55 l
+无刷电机 3 n
+无前 15 t
+无前因 3 i
+无前科 3 l
+无剑胜 6 nr
+无剑谱 2 nr
+无剑锋 3 nr
+无副作用 3 l
+无力 1264 n
+无力回天 29 l
+无力感 3 l
+无力招架 3 i
+无力自拔 3 i
+无力解决 3 l
+无力进攻 3 i
+无功 139 a
+无功不受 3 i
+无功不受禄 12 i
+无功功率 3 b
+无功受禄 7 i
+无功而禄 3 i
+无功而返 34 i
+无功而退 3 i
+无功负荷 3 b
+无动为大 3 l
+无动于中 7 l
+无动于衷 178 i
+无助 131 v
+无助于 68 v
+无劲力 2 d
+无千待万 3 i
+无千无万 3 i
+无华 21 nz
+无印痕 3 n
+无印良品 3 l
+无厘头 3 m
+无原则 19 n
+无及 3 c
+无双 149 m
+无双舒 2 nr
+无口才 3 i
+无可 803 v
+无可不可 3 i
+无可争议 37 l
+无可争辩 20 l
+无可厚非 106 i
+无可反驳 3 l
+无可取代 7 i
+无可名状 9 i
+无可否认 12 i
+无可奈何 672 i
+无可奈何花落去 4 i
+无可奉告 9 i
+无可如何 24 l
+无可安慰 3 i
+无可容忍 3 l
+无可指责 11 l
+无可挑剔 47 l
+无可挽回 62 i
+无可救药 27 i
+无可无不可 14 i
+无可替代 17 l
+无可柰何 2 v
+无可比伦 3 l
+无可比拟 41 i
+无可比象 3 l
+无可置喙 3 i
+无可置疑 14 i
+无可置辩 3 i
+无可讳言 3 i
+无可责备 3 l
+无可辩驳 28 l
+无可避免 3 l
+无可限量 3 l
+无可非议 45 i
+无名 276 v
+无名之师 3 i
+无名之朴 3 i
+无名之火 3 i
+无名之璞 3 nr
+无名之辈 20 i
+无名作家 3 l
+无名孽火 3 i
+无名小卒 63 i
+无名小辈 8 l
+无名帖 3 nr
+无名指 91 i
+无名氏 32 nr
+无名火 25 i
+无名火气 3 i
+无名肿毒 5 l
+无名英雄 12 nr
+无名贴 3 n
+无名鼠辈 3 i
+无后 49 c
+无后为大 3 l
+无后嗣 3 nr
+无后座力 3 l
+无后效 3 i
+无向网 3 n
+无君臣 3 nr
+无吸引力 3 l
+无告 3 n
+无味 147 d
+无咎无誉 3 l
+无商不奸 3 i
+无善德 16 nr
+无喜容 3 i
+无嗣子 2 nr
+无嘉许 3 nr
+无噍类矣 3 nr
+无噪音 3 nz
+无国界 3 n
+无国籍 3 n
+无图版 3 nz
+无圈图 3 l
+无土 3 l
+无土栽培 10 l
+无土育秧 3 n
+无地可容 3 i
+无地址 3 n
+无地自厝 3 ns
+无地自处 3 i
+无地自容 85 i
+无坏道 3 l
+无坐力炮 32 l
+无坚不摧 45 i
+无坚不陷 3 i
+无垠 48 a
+无垢 3 n
+无堵塞 3 nr
+无增力 2 i
+无壁犁 3 ns
+无士族 2 nz
+无声 896 d
+无声手枪 4 l
+无声无息 186 i
+无声无臭 2 i
+无声无色 6 i
+无声片 3 l
+无声片儿 3 l
+无声电影 3 l
+无壳蜗牛 3 vn
+无处 639 d
+无处不在 95 l
+无处可去 3 l
+无处可逃 3 i
+无处藏身 3 i
+无夕阳 3 ns
+无外乎 30 l
+无大不大 3 i
+无大修 3 nr
+无大无小 2 l
+无天无日 3 i
+无夫 3 n
+无头 157 v
+无头公案 3 n
+无头告示 2 i
+无头无尾 11 i
+无头无脑 3 i
+无头案 5 n
+无头甘蓝 3 i
+无头表 2 l
+无头鸟 3 i
+无奇 3 a
+无奇不有 38 i
+无奈 1567 d
+无奈何 10 i
+无奈我何 3 i
+无套裤汉 21 n
+无奢望 3 i
+无如 3 l
+无如之何 3 l
+无如之奈 3 i
+无如奈何 3 i
+无妄之忧 3 i
+无妄之灾 14 i
+无妄之祸 3 i
+无妄之福 3 i
+无妨 177 v
+无妻 3 n
+无始以来 3 l
+无始天终 3 i
+无始无终 10 i
+无嫌疑 3 nr
+无子嗣 7 nr
+无子息 5 l
+无孔不入 59 i
+无孔不钻 3 nr
+无字天书 3 l
+无字幕 3 n
+无字碑 3 n
+无存 61 v
+无学 3 n
+无孩 3 n
+无宁 13 ns
+无官一身 3 i
+无官一身轻 6 i
+无定 148 d
+无定形 3 n
+无定形体 3 l
+无定形碳 9 l
+无定期 3 b
+无定河 29 ns
+无定法 3 l
+无害 175 v
+无害化 36 n
+无家可奔 3 nr
+无家可归 111 i
+无家可归者 12 i
+无家无室 3 i
+无容置疑 2 i
+无容身之地 7 i
+无寇暴死 3 i
+无射 10 v
+无小事 3 l
+无尖牙 3 l
+无尖锋 4 n
+无尘 467 n
+无尘剑 4 i
+无尘室 3 i
+无尘布 3 i
+无尘纸 3 nz
+无尘衣 4 i
+无尘道人 7 i
+无尘道长 3 i
+无尚 3 l
+无尚光荣 3 nr
+无尤无怨 3 i
+无尽 268 d
+无尽无休 5 i
+无尽无穷 3 i
+无尽期 3 i
+无尾熊 3 n
+无尾礼服 3 i
+无岔区段 3 l
+无崖子 39 i
+无巧不成 3 i
+无巧不成书 15 i
+无差别 3 i
+无差错 8 i
+无己 3 n
+无已 3 d
+无师自通 21 nz
+无帝 3 n
+无常 301 d
+无常形 3 b
+无常鬼 3 i
+无平不颇 3 l
+无幸 3 v
+无幽不烛 3 n
+无广告 3 i
+无序 180 n
+无序分拆 3 v
+无应答 3 l
+无底 3 d
+无底价 3 n
+无底洞 60 ns
+无底稿 3 n
+无度 98 d
+无座力炮 10 l
+无庸 62 d
+无庸置疑 4 l
+无庸置辩 3 l
+无庸讳言 3 i
+无庸赘述 3 l
+无异 576 a
+无异于 226 l
+无异议 3 l
+无式 3 b
+无弹性 3 n
+无归 3 v
+无形 540 b
+无形中 140 l
+无形之中 13 l
+无形之罪 3 i
+无形化 3 l
+无形压力 3 l
+无形性 4 l
+无形损耗 12 l
+无形无影 4 i
+无形状 3 i
+无形资产 3 l
+无影 3 n
+无影仙 21 i
+无影剑 3 i
+无影手 3 i
+无影无形 23 i
+无影无踪 279 i
+无影灯 8 n
+无影胶 3 n
+无影脚 3 i
+无往不克 3 i
+无往不利 14 i
+无往不复 5 i
+无往不胜 7 i
+无往而不胜 5 i
+无征不信 3 i
+无待 3 v
+无待蓍龟 3 nz
+无微不至 52 i
+无德律 2 nr
+无德无能 3 i
+无德而称 3 n
+无心 362 v
+无心之过 3 l
+无心恋战 55 i
+无心插柳 3 i
+无心插柳柳成荫 6 i
+无忝所生 3 nr
+无忠君 4 nr
+无忧 204 v
+无忧无虑 106 i
+无忧网 3 i
+无思凡 3 nr
+无思无虑 6 i
+无性 133 b
+无性婚姻 3 n
+无性杂交 3 l
+无性生殖 77 l
+无性系 4 l
+无性繁殖 3 l
+无怨 3 v
+无怨尤 3 i
+无怨无德 3 i
+无怨无悔 65 i
+无怪 89 v
+无怪乎 39 d
+无怪无关 3 i
+无恒 3 z
+无恙 134 z
+无息 21 v
+无息贷款 18 n
+无恶不为 3 i
+无恶不作 106 i
+无恶不造 3 i
+无悔 58 v
+无悔无怨 3 i
+无情 436 n
+无情地 3 i
+无情少面 3 l
+无情打击 3 i
+无情无义 71 i
+无情无彩 3 i
+无情无绪 3 i
+无惧 22 v
+无想 3 l
+无意 882 v
+无意之中 3 l
+无意识 96 l
+无意间 126 l
+无感 5 n
+无愧 113 d
+无愧于 90 v
+无愧于心 14 l
+无愧衾影 3 vn
+无憾 54 a
+无懈可击 50 i
+无成 3 v
+无成没就 3 i
+无战事 3 l
+无房户 13 i
+无所 3 c
+无所不为 47 c
+无所不作 3 l
+无所不包 51 i
+无所不及 4 c
+无所不可 2 i
+无所不在 50 l
+无所不备 3 i
+无所不容 3 i
+无所不有 12 i
+无所不用 3 l
+无所不用其极 20 i
+无所不知 35 i
+无所不精 3 i
+无所不能 55 i
+无所不至 23 c
+无所不说 3 l
+无所不谈 3 i
+无所不通 22 i
+无所事事 87 i
+无所作为 88 i
+无所依归 3 i
+无所可否 3 i
+无所回避 3 nr
+无所容心 3 i
+无所忌惮 7 i
+无所忌讳 3 i
+无所措手 3 n
+无所施其技 5 i
+无所用之 3 i
+无所用心 7 l
+无所畏忌 3 i
+无所畏惧 178 i
+无所畏惮 3 i
+无所谓 355 l
+无所适从 106 i
+无所遁形 3 vn
+无所重轻 3 i
+无所顾忌 57 i
+无所顾惮 3 i
+无手 3 v
+无才无华 3 i
+无批判力 3 n
+无技可施 3 i
+无把握 3 l
+无护剑 2 n
+无护航 3 n
+无报答 3 l
+无担保 3 l
+无拘 3 v
+无拘无促 3 i
+无拘无束 62 i
+无拘无碍 2 i
+无拘无缚 3 i
+无拘束 3 i
+无招胜 4 i
+无拳无勇 6 i
+无挂无碍 5 i
+无损 124 v
+无损于 3 v
+无损伤 3 l
+无损压缩 3 l
+无接头 3 l
+无接缝 3 i
+无措 36 v
+无援 3 v
+无支票 3 n
+无放射性 2 n
+无政府 84 l
+无政府主义 220 n
+无故 147 n
+无故人 3 i
+无故呻吟 3 i
+无故缺席 3 i
+无故迟到 3 l
+无故障 7 b
+无效 639 a
+无效假设 3 l
+无效分蘖 3 l
+无效力 3 l
+无效劳动 3 l
+无效地 3 l
+无敌 243 v
+无敌不克 3 i
+无敌于天下 52 i
+无敌军 3 i
+无敌号 5 i
+无敌天下 3 i
+无敌手 88 i
+无敌舰队 3 nz
+无敌龙 3 i
+无数 2408 m
+无数一片片 2 m
+无数个 76 m
+无数代 2 m
+无数具 4 l
+无数双 11 m
+无数句 6 m
+无数只 14 m
+无数回 6 m
+无数场 3 n
+无数寸 2 m
+无数封 2 m
+无数张 3 m
+无数折 2 l
+无数支 5 m
+无数条 24 m
+无数根 4 m
+无数次 316 m
+无数盏 3 m
+无数种 6 m
+无数遍 18 m
+无数道 7 l
+无数里 5 m
+无数面 4 l
+无数颗 5 m
+无文本 3 l
+无方 32 n
+无方之民 3 l
+无施不可 3 i
+无施不效 3 i
+无日 51 t
+无日无夜 3 i
+无旧无新 3 i
+无时 3 c
+无时不刻 3 l
+无时无刻 78 i
+无时无地 3 l
+无明 14 v
+无明业火 3 n
+无明文 2 nr
+无明无夜 3 i
+无明火 3 i
+无昼无夜 3 nz
+无晶格 2 n
+无暇 263 d
+无暇兼顾 3 i
+无暇顾及 3 i
+无暗影 3 i
+无月 3 t
+无有伦比 3 i
+无服之丧 3 l
+无服之殇 3 n
+无望 213 v
+无期 8 b
+无期徒刑 101 l
+无木之本 3 l
+无本万利 5 l
+无本之木 2 i
+无机 313 n
+无机体 3 l
+无机化合 3 l
+无机化合物 26 l
+无机化学 61 l
+无机可乘 5 i
+无机废水 3 l
+无机物 113 l
+无机界 3 n
+无机盐 115 nz
+无机肥料 10 l
+无机酸 35 nz
+无杂质 3 l
+无权 250 n
+无权无势 19 i
+无权过问 3 l
+无材勇 2 l
+无条件 265 l
+无条件投 3 i
+无极 99 ns
+无极分子 3 l
+无极县 3 ns
+无极限 3 n
+无枉无纵 3 i
+无果 83 c
+无果果树 3 n
+无柄叶 3 nr
+无标题 3 n
+无核 20 v
+无核化 6 l
+无核区 29 n
+无核国家 22 l
+无核武器 21 l
+无核白 5 l
+无根 3 nz
+无根之物 3 l
+无根无蒂 3 i
+无根水 3 ns
+无根而固 3 i
+无根萍 4 nr
+无根道人 27 l
+无框画 3 n
+无梁 3 n
+无梁楼盖 3 nz
+无棣 4 ns
+无棣县 7 ns
+无次序 3 l
+无欲则刚 9 i
+无欺 5 v
+无款 3 n
+无止境 98 l
+无止尽 3 i
+无止无休 4 l
+无正文 3 nz
+无此雅兴 3 l
+无死锁性 3 l
+无残留 3 i
+无毁无誉 3 l
+无毒 135 v
+无毒不丈 3 i
+无毒不丈夫 26 l
+无毒品 8 l
+无毒害 3 l
+无毒性 7 l
+无比 1898 v
+无气味 3 i
+无气泡 3 l
+无氟 15 nz
+无氧 31 b
+无水 106 v
+无水乙醇 7 nz
+无水氢氟酸 4 nz
+无水氯化铝 4 nz
+无水石膏 3 i
+无水芒硝 4 nz
+无汉 3 t
+无污染 40 i
+无沉淀 3 l
+无油烟 3 n
+无泄漏 3 i
+无法 9557 n
+无法估量 3 l
+无法可想 3 i
+无法可施 3 l
+无法回答 3 l
+无法平息 3 l
+无法弥补 3 i
+无法形容 3 l
+无法忍受 3 l
+无法挽回 3 i
+无法挽救 3 i
+无法控制 3 nz
+无法无天 152 l
+无法无边 3 l
+无法比拟 3 i
+无法自拔 3 i
+无法解释 3 n
+无法访问 3 l
+无法说明 3 l
+无法追忆 3 l
+无洞掘蟹 3 n
+无派性 3 n
+无济于事 211 l
+无涉 3 v
+无涯 31 n
+无涯之戚 3 l
+无渗漏 3 n
+无源之水 4 i
+无源元件 3 n
+无源单元 3 b
+无源网络 3 n
+无溶剂 3 nz
+无漏 3 v
+无潮海 3 nz
+无灾 3 n
+无烟 22 v
+无烟工业 6 l
+无烟日 3 l
+无烟火药 16 i
+无烟煤 75 n
+无烦无恼 3 l
+无焊缝 3 l
+无照 9 v
+无照经营 3 l
+无照营业 3 n
+无照驾驶 3 nr
+无父 3 n
+无父无君 9 l
+无牙症 3 nz
+无牙颌 3 n
+无物 118 n
+无牵无挂 34 i
+无状 3 l
+无独有偶 64 i
+无猜 2 v
+无玉蜂 2 nr
+无现金 3 n
+无理 285 v
+无理取闹 41 l
+无理式 7 l
+无理强辩 3 l
+无理性 3 n
+无理数 61 l
+无理方程 2 l
+无理根 3 nz
+无理要求 3 l
+无瑕 58 z
+无生气 3 l
+无用 431 v
+无用信息 3 l
+无用功 10 l
+无用武之 3 l
+无用武之地 17 l
+无用论 3 l
+无界 3 nz
+无界空间 3 l
+无畏 237 v
+无畏于 3 v
+无畏地 3 i
+无疆 14 ns
+无疆之休 3 i
+无疆界 3 ns
+无疑 2153 d
+无疗效 3 n
+无疪 3 z
+无疵 3 n
+无疾而终 19 i
+无病 3 v
+无病呻吟 18 i
+无病自炙 3 i
+无症状 3 i
+无痕迹 3 l
+无痛 61 a
+无痛分娩 3 n
+无痛性 3 n
+无痛苦 3 i
+无皂 3 n
+无的放矢 13 i
+无益 300 d
+无益无异 3 i
+无盖 3 v
+无盘站 3 n
+无目地 3 i
+无目的地 3 l
+无相 3 d
+无相庵 2 nr
+无相无作 3 i
+无相禅师 3 nr
+无眼 3 d
+无睹 3 v
+无知 468 v
+无知妄作 3 i
+无知妄说 3 i
+无知己 3 i
+无知者 6 n
+无知觉 3 i
+无石棉 3 n
+无码 3 d
+无码片 3 n
+无碍 153 v
+无碳纸 3 nz
+无磷 2 nz
+无礼 343 v
+无礼地 3 i
+无神 3 l
+无神论 68 i
+无神论者 33 n
+无票 3 n
+无福 3 nz
+无福消受 3 i
+无私 228 b
+无私之光 3 i
+无私奉献 59 i
+无私援助 3 i
+无私无畏 19 i
+无私有弊 3 i
+无私有意 3 i
+无种 3 m
+无税 3 v
+无稽 19 a
+无稽之言 2 i
+无稽之谈 54 i
+无穷 757 d
+无穷乐趣 3 i
+无穷动 3 i
+无穷大 49 i
+无穷小 97 z
+无穷尽 3 i
+无穷无尽 62 i
+无穷的 135 z
+无穷远 3 z
+无空不入 3 l
+无窗式 3 nr
+无立足之 3 i
+无立锥之地 12 i
+无章可循 3 i
+无端 168 n
+无端惹事 3 i
+无端指责 3 l
+无端生事 3 l
+无端闹事 3 l
+无策 3 n
+无米之炊 12 i
+无籽 6 n
+无籽西瓜 8 n
+无粉尘 3 n
+无粮户 3 n
+无精打彩 7 i
+无精打采 76 i
+无约 3 d
+无约在身 3 i
+无约束 3 i
+无级 23 b
+无级变倍 3 l
+无级棍 3 l
+无级缩放 3 l
+无纪律 3 l
+无纸化 9 nz
+无纺布 8 nz
+无纺织布 13 nz
+无线 699 n
+无线台 3 n
+无线市话 3 l
+无线电 1068 b
+无线电厂 4 n
+无线电台 36 l
+无线电定 3 l
+无线电报 14 nz
+无线电接 3 b
+无线电波 92 l
+无线电电 3 l
+无线电管理委员会 2 nt
+无线电视 3 l
+无线电话 9 l
+无线电通 3 nz
+无线电通信 62 l
+无线网 3 n
+无线网络 3 n
+无线耳机 3 n
+无线调度 3 l
+无线连接 3 i
+无线通信 3 l
+无线通讯 3 nz
+无组件 3 l
+无细思 3 l
+无细胞层 3 n
+无终 3 d
+无给职 3 i
+无绝 3 v
+无绝缘 3 i
+无绳 7 n
+无绳机 3 l
+无绳电话 3 l
+无绳电话机 12 l
+无绳话机 3 l
+无缘 338 n
+无缘无故 145 i
+无缘见面 3 i
+无缝 87 n
+无缝壳冠 3 n
+无缝天衣 3 i
+无缝管 3 n
+无缝钢管 7 nz
+无缝钢管厂 19 n
+无缺 33 v
+无罣无碍 3 n
+无罪 216 v
+无罪判决 3 nr
+无罪开释 3 i
+无罪释放 3 l
+无置锥地 3 l
+无羁无束 3 nr
+无翼而飞 3 i
+无翼鸟 3 i
+无耗网络 3 n
+无耻 510 a
+无耻下流 3 i
+无耻之尤 11 i
+无耻之徒 66 i
+无耻之犬 3 i
+无耻吹捧 3 i
+无耻谰言 3 z
+无聊 524 a
+无聊乏味 3 i
+无聊者 3 n
+无职 32 v
+无职无权 3 l
+无肠公子 3 l
+无肠可断 3 l
+无肩带 3 i
+无背无侧 3 i
+无胫而来 3 i
+无胫而至 3 i
+无胫而行 3 i
+无胫而走 3 i
+无能 537 v
+无能不晓 3 i
+无能为力 268 l
+无能为役 3 i
+无能之辈 3 l
+无能无力 3 l
+无能者 6 n
+无脊椎 7 n
+无脑 3 n
+无脑儿 2 l
+无腐蚀 3 nz
+无腔 3 b
+无舌畸形 3 i
+无般不识 3 l
+无良 3 z
+无良婚介 3 n
+无色 822 b
+无色差 3 l
+无色无臭 3 i
+无艺 3 n
+无节制 3 l
+无花果 65 i
+无花果树 3 ns
+无芳草 3 nr
+无荷电酸 3 nz
+无菌 189 n
+无菌室 3 n
+无虑 3 v
+无虑无忧 3 i
+无虑无思 3 l
+无虞 46 ns
+无虞匮乏 3 i
+无行 3 v
+无衣之赋 3 l
+无补 3 v
+无补于世 3 l
+无补于事 3 l
+无补于时 3 l
+无表情 3 n
+无袖 30 n
+无裂纹 3 n
+无规 3 b
+无规则 3 b
+无规噪声 3 l
+无规律 13 l
+无规运动 3 l
+无规降解 3 l
+无视 185 v
+无视于 3 l
+无视国法 3 n
+无角 3 n
+无解 3 v
+无触点 5 i
+无言 303 c
+无言以对 73 i
+无言以答 5 l
+无言可对 29 i
+无言对泣 3 l
+无言对答 3 l
+无言抗议 3 i
+无言歌 3 i
+无计 3 v
+无计其数 3 i
+无计可奈 3 i
+无计可施 152 i
+无计名 3 i
+无计奈何 6 i
+无计所奈 3 i
+无记名 552 l
+无讹 3 n
+无论 4936 c
+无论何地 3 l
+无论如何 1395 l
+无论怎样 3 l
+无论是 353 c
+无论谁 3 i
+无证 3 v
+无证据 3 n
+无证无照 2 l
+无证照 3 l
+无词歌 7 i
+无诚意 3 i
+无话 3 v
+无话不说 13 l
+无话不谈 41 i
+无话可答 3 l
+无话可讲 3 l
+无话可说 188 l
+无话好说 3 l
+无语 3 nz
+无语凝 3 nr
+无误 173 v
+无说服力 3 l
+无调 3 v
+无谓 194 v
+无责 3 v
+无账 3 v
+无货 3 n
+无赀 3 i
+无资格 4 n
+无赖 336 v
+无赖汉 3 nr
+无赘表示 3 l
+无赦 3 v
+无起色 6 l
+无趣 66 n
+无足称道 3 i
+无足轻重 100 i
+无足重轻 2 i
+无路 3 l
+无路可走 66 l
+无路可逃 3 i
+无踪 3 v
+无踪无影 16 i
+无车日 3 i
+无轨 5 b
+无轨可循 3 n
+无轨电车 17 l
+无载体 3 l
+无辐射 3 nz
+无辜 587 n
+无辜者 20 n
+无边 390 d
+无边无垠 3 l
+无边无沿 6 i
+无边无涯 6 i
+无边无碍 3 i
+无边无际 107 l
+无边春色 3 i
+无边苦海 3 i
+无边距 3 n
+无边风月 3 i
+无过 78 c
+无过错 3 i
+无远不届 3 i
+无远弗届 4 b
+无迹可寻 13 i
+无迹可求 3 i
+无适无莫 3 nr
+无道 118 v
+无遗 87 v
+无適无莫 3 nz
+无遮大会 3 l
+无遮挡 3 i
+无遮蔽 3 v
+无邪 39 v
+无配套 3 n
+无量 361 n
+无量山 47 l
+无量数 3 l
+无铅 10 nz
+无铅化 2 l
+无锋剑 6 i
+无错 11 a
+无错版 3 v
+无锡 466 ns
+无锡人 34 nr
+无锡县 32 ns
+无锡小天鹅股份有限公司 5 n
+无锡市 102 ns
+无锡市委 2 n
+无锤 3 n
+无门无派 3 l
+无闪烁 3 z
+无间 43 n
+无间冬夏 3 n
+无间可乘 3 l
+无间可伺 3 v
+无间断 3 l
+无间无隙 3 l
+无间是非 3 l
+无间道 3 l
+无闻 27 n
+无阀 3 n
+无防备 3 n
+无阻 26 v
+无际 52 n
+无际可寻 3 i
+无限 1697 v
+无限公司 4 n
+无限大 17 l
+无限对策 3 l
+无限小 16 l
+无限小数 5 l
+无限忠诚 3 l
+无限性 11 n
+无限感激 3 l
+无限期 109 n
+无限极 3 n
+无限深情 3 l
+无限生长 3 l
+无限花序 4 l
+无限连 3 l
+无限连击 3 l
+无限量 3 l
+无限风光 3 l
+无隆肉 3 n
+无隙可乘 50 i
+无障碍 18 b
+无雨 39 n
+无雨天 3 i
+无雪 3 n
+无需 410 v
+无需多说 3 l
+无霜 3 nz
+无霜期 718 t
+无青子 11 nr
+无非 840 c
+无靠无依 3 i
+无韵体 2 l
+无韵律 3 l
+无韵诗 2 l
+无须 605 d
+无须之祸 3 i
+无须乎 3 i
+无须再 3 i
+无须鳕 3 n
+无颌畸形 3 vn
+无题 7 n
+无题诗 3 l
+无颚鱼 3 v
+无颜 3 nr
+无颜以对 4 i
+无颜落色 3 i
+无颜见人 3 i
+无颜见江 3 i
+无颜见江东父老 2 i
+无颠无倒 3 i
+无风 3 l
+无风三尺浪 11 i
+无风不起 3 i
+无风不起浪 9 l
+无风作浪 3 l
+无风带 3 n
+无风扬波 3 i
+无风生浪 3 l
+无风起浪 3 l
+无风险 3 l
+无马行空 3 i
+无髓牙 3 n
+无齿 3 n
+旡 2 zg
+旡妄之灾 3 l
+既 17016 c
+既为 3 c
+既保证 3 n
+既存 3 n
+既定 325 b
+既定政策 3 n
+既定方针 3 i
+既定目标 3 n
+既当 3 c
+既往 55 t
+既往不咎 62 i
+既往不究 3 l
+既得 68 b
+既得利益 67 i
+既得利益者 24 n
+既成事实 53 i
+既是 84 c
+既有 2115 c
+既有今日 4 i
+既有线 6 b
+既来之 19 c
+既来之则 3 c
+既然 5389 c
+既然如此 318 c
+既然里拉 3 i
+既缺 3 n
+既老且衰 3 i
+既而 3 c
+既能 3 b
+既要 3 b
+既非 3 c
+日 78695 m
+日上三竿 14 i
+日下无双 3 i
+日不我与 3 i
+日不暇给 3 i
+日不移影 3 i
+日不移晷 3 i
+日不落 3 i
+日东 3 ns
+日东月西 3 ns
+日中为市 3 ns
+日中则昃 3 i
+日中则移 3 i
+日中友好七团体 4 nt
+日中将昃 3 i
+日中必彗 3 n
+日中必昃 3 i
+日中必湲 3 v
+日中必移 3 i
+日丰 3 ns
+日丹诺 25 ns
+日丽 3 ns
+日丽风 2 nr
+日丽风和 3 ns
+日丽风清 3 nr
+日久天长 20 i
+日久岁深 3 i
+日久岁长 3 n
+日久年深 3 t
+日久月深 3 t
+日久生 2 t
+日久生情 3 n
+日久见人心 13 i
+日久郁 2 nr
+日义兵 3 nr
+日乾夕惕 3 i
+日亚 3 ns
+日产 65 j
+日产量 44 n
+日以为常 3 i
+日以继夜 22 i
+日伪 94 j
+日侨 3 n
+日俄战争 3 n
+日偏蚀 3 i
+日偏食 4 n
+日元 544 n
+日光 316 n
+日光岩 6 nr
+日光浴 43 nr
+日光浴室 3 nz
+日光温室 3 n
+日光灯 23 n
+日光疗法 3 n
+日光能 3 n
+日入而息 3 i
+日全蚀 3 nz
+日全食 42 n
+日公 8 n
+日共 33 j
+日兴 44 ns
+日内瓦 444 ns
+日内瓦人 3 nrt
+日内瓦大学 25 nt
+日内瓦湖 18 ns
+日冕 37 n
+日冕仪 3 nr
+日军 3377 n
+日出 394 v
+日出三竿 3 i
+日出不穷 3 i
+日出日落 3 i
+日出而作 14 i
+日刊 10 n
+日则沟 3 ns
+日利 3 ns
+日利率 5 n
+日削月割 3 n
+日削月朘 3 nz
+日前 2144 t
+日剧 8 n
+日化 43 j
+日升昌 15 nr
+日升月恒 3 nr
+日华 3 ns
+日华子 4 n
+日南 3 ns
+日历 1125 t
+日历表 3 n
+日右翼 3 i
+日后 1384 t
+日和风暖 3 i
+日咳 3 n
+日商 21 n
+日喀则 67 ns
+日喀则地区 14 ns
+日喀则市 14 ns
+日圆 59 n
+日土县 3 ns
+日场 3 n
+日均 172 j
+日坐愁城 3 i
+日坛 8 n
+日坛公园 2 ns
+日堙月塞 3 v
+日增 67 ns
+日增月益 3 nr
+日增月盛 3 nr
+日复一日 109 t
+日夕 3 t
+日外务省 3 nt
+日外相 3 n
+日夜 871 t
+日夜不停 3 l
+日夜不分 3 l
+日夜兼程 46 l
+日夜奋战 3 i
+日夜操劳 7 i
+日夫 8 ns
+日头 135 n
+日子 5113 n
+日安 3 ns
+日宝钗 2 nr
+日宴庆 16 nr
+日寇 215 n
+日射病 7 n
+日射角 3 n
+日小僧 4 nr
+日小龙 6 nr
+日尔曼 29 ns
+日尔曼民 3 ns
+日尔曼语 3 nz
+日就月将 2 i
+日居月诸 3 nr
+日工 22 n
+日已三竿 3 i
+日币 3 n
+日常 4737 d
+日常事务 3 n
+日常化 4 nt
+日常性 6 b
+日常支出 3 i
+日常生活 3 i
+日常用品 3 n
+日常用语 6 n
+日常行为 3 n
+日异月新 3 i
+日异月更 3 i
+日异月殊 3 i
+日式 35 n
+日引月长 3 n
+日影 62 n
+日影儿 2 n
+日往月来 3 i
+日征月迈 3 nr
+日德兰 13 ns
+日德兰半岛 15 ns
+日德意 2 nr
+日心说 29 n
+日志 1110 ns
+日思夜想 44 i
+日息 3 n
+日惹 14 ns
+日慎一日 3 i
+日戳 18 n
+日托 5 ns
+日托米尔 2 nrt
+日报 1228 n
+日报社 25 nt
+日报表 3 n
+日据时代 3 n
+日数 116 n
+日文 68 n
+日文版 2 n
+日文站 3 nt
+日文系 3 n
+日文课 3 n
+日斑 8 n
+日新月异 125 nz
+日新月盛 3 nz
+日新月著 3 nz
+日方 452 n
+日无暇晷 3 i
+日日 208 t
+日日夜夜 123 i
+日日春 3 ns
+日旰不食 3 i
+日旰忘食 3 i
+日旰忘餐 3 i
+日昃不食 3 v
+日昃忘食 3 n
+日昃旰食 3 i
+日星 11 n
+日晒 61 nrt
+日晒牢度 3 n
+日晒雨淋 10 i
+日晕 5 n
+日晴明 2 nr
+日晷 38 n
+日晷仪 3 v
+日暖 14 b
+日暖风和 3 nz
+日暖风恬 3 i
+日暮 3 t
+日暮路远 3 i
+日暮途穷 6 i
+日暮途远 3 i
+日暮道远 3 i
+日月 1940 t
+日月不居 3 i
+日月丽天 3 nr
+日月争辉 3 nr
+日月交食 3 n
+日月入怀 3 i
+日月其除 3 i
+日月参辰 3 n
+日月合壁 3 nz
+日月合璧 3 ns
+日月同辉 3 nr
+日月如梭 4 i
+日月如流 3 i
+日月山 22 ns
+日月推移 3 i
+日月无光 10 nz
+日月星 3 nz
+日月星辰 71 nz
+日月潭 51 ns
+日月神教 61 nz
+日月经天 2 t
+日月蚀 3 nz
+日月蹉跎 3 v
+日月逾迈 3 l
+日月重光 3 nz
+日月食 18 n
+日有万机 3 i
+日有所思 3 i
+日有起色 3 i
+日朘月减 3 v
+日朘月削 3 v
+日期 3571 t
+日期戳子 3 nr
+日本 25307 ns
+日本东京大学 7 nt
+日本东京证券交易所 2 nt
+日本丰田汽车公司 2 nt
+日本产 3 n
+日本京都大学 4 nt
+日本公司 25 nt
+日本公明党 3 nt
+日本共产党 18 nt
+日本共同社 34 nt
+日本剧 2 n
+日本化 3 ns
+日本参议院 2 nt
+日本国 47 ns
+日本国会 269 nt
+日本国青队 3 nt
+日本外务省 51 nt
+日本大使馆 6 nt
+日本大学 9 nt
+日本天皇 3 n
+日本央行 30 nt
+日本女排 2 nt
+日本妞 3 n
+日本妹 3 n
+日本学 8 nt
+日本帝国 40 ns
+日本广播协会 18 nt
+日本式 9 n
+日本政府 358 nt
+日本文部省 7 nt
+日本料理 3 n
+日本早稻田大学 5 nt
+日本时事社 7 nt
+日本松下公司 2 nt
+日本民主党 2 nt
+日本海 112 ns
+日本海军 3 nt
+日本狗 3 n
+日本电气株式会社 3 nt
+日本社 3 nt
+日本筑波大学 2 nt
+日本籍 5 n
+日本索尼公司 5 nt
+日本联合舰队 30 nt
+日本自卫队 306 nt
+日本自民党 14 nt
+日本自由党 2 nt
+日本航空公司 11 nt
+日本航空自卫队 51 nt
+日本语 5 n
+日本足协 16 nt
+日本银行 12 nt
+日本队 72 nt
+日本防卫厅 137 nt
+日本首相 3 n
+日本驻华使馆 4 nt
+日本驻华大使馆 2 nt
+日本鬼子 3 n
+日杂 7 b
+日杂品 3 n
+日来 3 t
+日来月往 3 i
+日汉 3 t
+日清月结 3 nr
+日渐 661 d
+日渐壮大 3 i
+日渐式微 4 nr
+日渐月染 3 i
+日滋月益 3 n
+日濡月染 3 i
+日灼病 3 n
+日炙风吹 3 i
+日炙风筛 3 i
+日照 621 n
+日照县 4 ns
+日照市 17 ns
+日照时数 3 n
+日照时间 3 n
+日照港 3 ns
+日照计 6 n
+日照计算 3 n
+日照间距 3 n
+日环蚀 3 nz
+日环食 8 n
+日珥 30 n
+日班 8 ns
+日理万机 38 n
+日瓦戈 7 nrt
+日甚一日 19 i
+日用 475 n
+日用五金 3 n
+日用化工 3 n
+日用品 140 n
+日用塑料 3 n
+日用玻璃 3 nt
+日用瓷 12 n
+日用电器 3 n
+日用百货 15 n
+日用陶瓷 3 nz
+日电 17 j
+日界线 7 nz
+日益 3196 n
+日益严重 3 i
+日益减少 3 i
+日益加剧 3 n
+日益增长 3 n
+日益壮大 3 ns
+日益完善 3 i
+日益巩固 3 nr
+日益月滋 3 ns
+日益突出 3 i
+日益频繁 3 nr
+日盛 63 nz
+日省月修 3 nr
+日省月试 3 i
+日省月课 3 n
+日知会 3 nt
+日知录 7 n
+日短心长 3 i
+日祖界 2 n
+日神 40 n
+日科夫 30 nr
+日积月累 58 i
+日积月聚 3 i
+日程 322 n
+日程安排 3 nt
+日程月课 3 n
+日程表 29 n
+日立 88 b
+日立公司 8 nt
+日籍 3 n
+日籍人士 3 n
+日累月积 3 n
+日线图 17 n
+日经 69 d
+日经指数 7 n
+日置益 3 nr
+日美军 6 nt
+日美德 2 ns
+日者君 2 nr
+日耳曼 208 ns
+日耳曼人 106 n
+日耳曼语 17 nz
+日聚贤 2 nr
+日臻 33 nr
+日臻完善 27 i
+日臻成熟 13 i
+日航 13 j
+日航旗 2 n
+日色 3 n
+日苏 3 ns
+日莫途远 3 i
+日莲 3 ns
+日莲宗 6 nr
+日落 268 n
+日落千丈 3 i
+日落时分 3 l
+日落而息 8 i
+日落西山 23 ns
+日落黄 3 z
+日薄崦嵫 3 n
+日薄桑榆 3 i
+日薄虞渊 3 nr
+日薄西山 10 i
+日薪 3 n
+日蚀 33 nz
+日行一善 3 i
+日行千里 16 i
+日裔 3 n
+日西 3 ns
+日见 153 n
+日见增多 3 i
+日见好转 3 i
+日观峰 3 ns
+日规 3 n
+日规仪 3 n
+日角偃月 3 vn
+日角珠庭 3 ns
+日角龙庭 3 ns
+日角龙颜 3 ns
+日计不足 3 i
+日记 639 n
+日记体 6 n
+日记帐 3 n
+日记本 22 n
+日记法 3 n
+日记簿 3 n
+日记账 3 n
+日许多时 3 ns
+日许时间 3 n
+日访问量 3 n
+日试万言 3 i
+日诗云 2 nr
+日语 264 nz
+日语原声 3 n
+日语学校 3 nt
+日语系 3 n
+日语翻译 3 l
+日语课 3 n
+日诵五车 3 n
+日货 28 n
+日贾珍 2 nr
+日资 31 n
+日趋 926 d
+日趋严重 3 l
+日趋完善 3 l
+日趋激烈 3 l
+日趋衰落 3 l
+日趋败坏 3 l
+日转千街 3 n
+日转千阶 3 i
+日较差 3 n
+日辰 2 n
+日迈月征 3 nr
+日进斗金 6 n
+日邮 3 ns
+日里诺夫斯基 2 nrt
+日钞 3 n
+日银 2 nt
+日销 3 n
+日销月铄 3 i
+日锻月炼 3 nz
+日长一线 3 j
+日长似岁 3 n
+日间 143 t
+日间班 3 n
+日间部 3 n
+日阿紫 2 nr
+日陵月替 3 nz
+日隆 155 ns
+日需求量 3 n
+日霜 2 nz
+日韩剧 3 nt
+日韩歌曲 3 ns
+日食 110 n
+日食万钱 3 l
+日食带 3 n
+日饮亡何 3 i
+日饮无何 3 i
+日高三丈 3 i
+日高峰 3 ns
+日龙 4 ns
+旦 384 j
+旦夕 119 t
+旦夕之危 3 n
+旦夕之间 3 n
+旦夕存亡 3 n
+旦夕祸福 3 n
+旦尼尔 4 n
+旦旦 3 t
+旦旦而伐 3 n
+旦暮 3 t
+旦暮入地 3 n
+旦种暮成 3 n
+旦角 45 n
+旦角儿 3 n
+旧 6655 a
+旧业 15 n
+旧主 27 n
+旧习 21 n
+旧习惯 20 n
+旧乡 3 n
+旧书 20 n
+旧书店 3 n
+旧书摊 4 n
+旧事 138 n
+旧事重提 3 n
+旧交 24 b
+旧人 87 n
+旧仇宿怨 3 i
+旧仇窗怨 3 i
+旧伤 3 n
+旧体 6 n
+旧体诗 40 n
+旧作 20 n
+旧例 19 n
+旧俗 41 n
+旧债 3 n
+旧创 3 n
+旧制 326 n
+旧区 3 n
+旧卡 3 n
+旧厂 3 n
+旧历 20 t
+旧历年 8 t
+旧县 12 ns
+旧友 36 n
+旧唐书 3 n
+旧国 12 ns
+旧地 60 n
+旧地重游 14 n
+旧址 1438 n
+旧城 279 ns
+旧城区 43 ns
+旧大陆 27 ns
+旧学 39 n
+旧宅 23 n
+旧宫 10 n
+旧家 3 n
+旧家具 3 n
+旧寨 8 ns
+旧居 68 n
+旧属 3 n
+旧岁 17 n
+旧州 6 ns
+旧币 18 n
+旧年 45 t
+旧庄 3 ns
+旧庄国小 3 n
+旧式 100 n
+旧念复萌 3 i
+旧态复萌 3 i
+旧思想 3 n
+旧怨 3 n
+旧恨 3 n
+旧恨新仇 4 i
+旧恨新愁 3 i
+旧恩 3 n
+旧恶 3 n
+旧情 73 n
+旧情绵绵 3 l
+旧愁新恨 3 i
+旧戏 3 n
+旧房 21 n
+旧损 3 n
+旧故 3 n
+旧教 9 n
+旧教徒 3 n
+旧料 3 n
+旧日 167 t
+旧旧 3 b
+旧时 175 t
+旧时代 3 t
+旧有 129 b
+旧期 3 t
+旧期生 3 t
+旧村 2 n
+旧校 3 n
+旧框框 3 n
+旧案 4 n
+旧梦 21 n
+旧梦重温 3 n
+旧楼 6 n
+旧欠 3 n
+旧欢 3 n
+旧民主主 3 n
+旧法 3 n
+旧游 9 n
+旧热带界 3 n
+旧燕归巢 3 i
+旧爱新欢 3 i
+旧片 3 n
+旧版 3 n
+旧版本 3 ns
+旧物 14 n
+旧班 3 n
+旧瓶新酒 3 n
+旧生 3 n
+旧电影 3 n
+旧电脑 3 n
+旧疾 10 n
+旧疾复发 3 i
+旧病 21 n
+旧病复发 16 i
+旧病难医 3 n
+旧知 3 n
+旧石器 51 n
+旧石器时代 247 t
+旧社会 246 n
+旧称 3 n
+旧站 3 n
+旧章 3 n
+旧约 61 n
+旧约全书 3 n
+旧脑筋 3 n
+旧臣 3 n
+旧船 3 n
+旧药 3 n
+旧街 2 ns
+旧衣 3 n
+旧衣服 3 n
+旧表 3 n
+旧观 10 n
+旧言 3 n
+旧识 19 n
+旧诗 31 n
+旧话重提 3 l
+旧调重弹 3 n
+旧貌 17 n
+旧貌换新颜 4 i
+旧账 13 n
+旧货 142 n
+旧货店 4 n
+旧货摊 6 l
+旧贷 3 n
+旧车 3 n
+旧迎新 3 l
+旧迹 8 n
+旧道德 3 ns
+旧部 136 n
+旧都 31 ns
+旧金山 238 ns
+旧金山市 4 ns
+旧金山湾 3 ns
+旧镇 2 ns
+旧闻 283 n
+旧闻新知 3 i
+旧雨 9 n
+旧雨今雨 3 i
+旧雨新知 3 i
+旧雨楼 3 n
+旧雨重逢 3 i
+旨 2761 ng
+旨义 3 n
+旨在 801 v
+旨归 3 v
+旨意 438 v
+旨趣 29 n
+旨酒佳肴 3 n
+旨酒嘉肴 3 n
+早 14429 a
+早上 1211 t
+早上好 3 l
+早上早下 3 l
+早下 3 t
+早下一步 3 d
+早下早好 3 l
+早中晚 3 t
+早乙女爱 3 n
+早于 3 d
+早些 303 d
+早些时候 3 t
+早产 97 n
+早产儿 13 n
+早产奶 3 n
+早代测验 3 n
+早以 3 d
+早会时间 3 n
+早借 3 v
+早借早还 3 l
+早先 195 d
+早出晚归 29 i
+早出暮归 3 i
+早前 67 t
+早势垒 3 i
+早半天儿 3 n
+早占勿药 3 i
+早去 3 t
+早去早回 3 i
+早在 3 t
+早场 4 n
+早场电影 3 n
+早夭 3 nr
+早奏 3 n
+早婚 53 v
+早婚者 3 n
+早孕 3 v
+早安 27 n
+早安排 3 nt
+早就 3244 d
+早岁 3 t
+早川 11 n
+早已 5070 d
+早已有之 3 i
+早市 56 n
+早年 1137 t
+早年间 61 t
+早床 3 n
+早当家 3 l
+早得很 3 nr
+早恋 29 v
+早慧 4 n
+早报 162 n
+早报网 3 n
+早报讯 3 n
+早拜 3 t
+早接触 3 n
+早搏 13 n
+早操 18 n
+早操时间 3 n
+早教 39 n
+早教机 3 n
+早教网 3 n
+早日 565 t
+早日康复 3 i
+早早 537 t
+早早儿 9 d
+早春 133 t
+早春时节 3 t
+早晚 617 t
+早晚自习 3 i
+早晚都会 3 nz
+早晚都是 3 n
+早晨 1296 t
+早晨时 3 i
+早有所闻 16 i
+早有打算 3 i
+早有计划 3 n
+早朝 3 t
+早朝晏罢 3 nr
+早期 3755 t
+早期教育 3 l
+早期白话 3 l
+早来 3 t
+早来晚走 3 i
+早死早好 3 l
+早泄 43 v
+早潮 4 n
+早点 371 d
+早点儿 33 d
+早熟 121 v
+早熟作物 3 n
+早班 13 n
+早班儿 3 n
+早班车 3 n
+早生 3 t
+早生贵子 3 n
+早睡 3 v
+早睡早起 3 vn
+早知 489 v
+早知今日 13 i
+早知如此 3 l
+早秋 3 t
+早稻 23 n
+早稻田 4 nt
+早稻田大学 26 nt
+早籼稻 3 n
+早粥 3 n
+早育 3 n
+早自习 3 n
+早自习课 3 n
+早茶 14 n
+早获 3 v
+早衰 43 n
+早衰现象 3 n
+早试 3 v
+早读 9 v
+早读课 3 n
+早课 11 n
+早走一步 3 i
+早起 194 v
+早起早睡 3 l
+早踏 3 v
+早踏一步 3 d
+早车 3 n
+早退 30 v
+早逝 49 v
+早间 37 t
+早隔离 3 n
+早霜 4 n
+早韭晚菘 3 nr
+早餐 371 n
+早餐会 7 n
+早餐券 3 n
+早餐时间 3 n
+早饭 359 n
+旬 208 zg
+旬刊 14 n
+旬报 22 n
+旬日 3 n
+旬末 3 n
+旬输月送 3 n
+旬邑 9 ns
+旬邑县 3 ns
+旬阳 3 ns
+旬阳县 2 ns
+旭 228 nr
+旭东 11 nrt
+旭光 5 n
+旭川 4 nrt
+旭日 175 nrt
+旭日东升 12 nrt
+旭日初升 2 l
+旭日升 3 l
+旮 17 n
+旮旮旯旯 3 nr
+旮旯 38 n
+旮旯儿 3 z
+旯 19 x
+旰 28 g
+旰食 3 i
+旰食之劳 3 i
+旰食宵衣 3 i
+旱 749 n
+旱井 3 n
+旱伞 3 n
+旱作 58 vn
+旱作区 7 n
+旱农 3 n
+旱冰 4 n
+旱冰场 5 n
+旱冰鞋 2 n
+旱冰馆 3 n
+旱区 16 n
+旱卫 3 n
+旱地 132 n
+旱地农业 3 j
+旱天 3 t
+旱季 102 t
+旱年 9 t
+旱情 43 n
+旱拔为虚 3 l
+旱柳 4 n
+旱桥 3 n
+旱涝 52 n
+旱涝保收 20 l
+旱潦 3 l
+旱潦之灾 3 l
+旱灾 148 n
+旱灾区 3 n
+旱烟 132 n
+旱烟管 18 n
+旱烟袋 23 n
+旱獭 26 n
+旱生植物 3 l
+旱田 23 n
+旱相 3 n
+旱秧田 3 n
+旱稻 30 n
+旱育稀植 2 l
+旱船 17 n
+旱芹 4 n
+旱苗得雨 3 n
+旱荒 3 n
+旱莲草 3 n
+旱象 8 n
+旱路 39 n
+旱道 3 n
+旱金莲 3 n
+旱魃 64 n
+旱魃为虐 3 i
+旱魔 3 n
+旱鸭 3 n
+旱鸭子 5 n
+旲 5 zg
+旳 3 zg
+旴江 3 nz
+时 103735 n
+时下 178 n
+时不再来 14 l
+时不可失 3 l
+时不常 3 d
+时不待我 3 i
+时不我与 2 i
+时不我予 3 nr
+时不我待 12 i
+时不时 260 d
+时与俱进 3 i
+时世尊 2 nr
+时东进 2 nrfg
+时为燕 4 nr
+时举明 2 n
+时之沙 3 nr
+时乐钟 2 n
+时乖命蹇 3 i
+时乖运乖 3 nr
+时乖运拙 3 i
+时乖运蹇 2 i
+时事 163 n
+时事刊物 3 n
+时事性 3 n
+时事政治 3 n
+时事新闻 3 n
+时事知识 3 n
+时事社 2 n
+时事评论 3 n
+时云长 2 n
+时亨运泰 3 nr
+时人 311 n
+时仁宗 3 nr
+时代 10799 n
+时代光华 3 nz
+时代剧 3 n
+时代化 3 n
+时代华纳 28 nz
+时代华纳公司 9 nt
+时代华纳集团 2 nt
+时代周刊 3 n
+时代广场 8 n
+时代性 26 n
+时代感 42 n
+时代气息 3 n
+时代特征 3 n
+时代特点 3 n
+时代特色 3 n
+时代精神 3 n
+时代美景 3 n
+时代背景 3 n
+时代趋势 3 n
+时代集团 3 nt
+时代风气 3 n
+时代风貌 3 n
+时令 66 n
+时令商品 3 n
+时令性 2 n
+时令病 3 n
+时令节气 3 n
+时令蔬菜 3 i
+时价 21 n
+时任 453 n
+时会 257 n
+时传祥 5 nr
+时伯颜 2 nr
+时侯 10 n
+时俗 3 n
+时信哥 2 n
+时修魏 2 nr
+时候 31521 n
+时候未到 3 nr
+时值 130 n
+时儿 3 n
+时先主 2 n
+时先学 2 n
+时光 797 n
+时光倒流 3 n
+时光流逝 3 i
+时光荏苒 5 i
+时光隧道 3 n
+时兴 71 n
+时兵民 2 n
+时再纳 2 nr
+时冷时热 3 l
+时凯平 2 nr
+时凸显 5 nr
+时分 1303 n
+时分复用 6 l
+时分多址 8 n
+时分秒 3 n
+时刻 3448 n
+时刻表 22 n
+时前凉 2 nr
+时力道 2 n
+时加关 2 n
+时务 89 n
+时劲力 4 n
+时势 82 n
+时势使然 3 i
+时势造 3 n
+时势造英雄 10 n
+时勘 3 v
+时区 34 n
+时卫国 2 n
+时卫尉 2 n
+时发雷 2 n
+时变 25 n
+时变信道 3 l
+时变率 3 n
+时台军 21 n
+时名臣 2 n
+时后梁 3 n
+时君世 2 nr
+时和岁丰 3 nr
+时和岁稔 3 nr
+时和年丰 3 nz
+时域 9 n
+时基电路 3 n
+时好时坏 28 l
+时姿式 2 l
+时宜 29 n
+时宝钗 2 nr
+时宪 2 n
+时宪书 2 n
+时宪历 7 n
+时小福 2 nr
+时尚 1044 n
+时尚化 2 nr
+时尚品牌 3 l
+时尚女性 3 n
+时尚女装 3 l
+时尚家居 3 nr
+时尚性 3 nr
+时尚手机 3 l
+时尚服饰 3 n
+时尚机型 3 n
+时尚杂志 3 n
+时尚生活 3 l
+时尚界 9 nr
+时尚礼品 3 l
+时尚科技 3 nz
+时尚网 3 nr
+时尚资讯 3 n
+时尚频道 3 l
+时尚饰品 3 n
+时局 153 n
+时局动荡 3 n
+时局多变 3 i
+时差 52 n
+时布云 2 nr
+时常 893 d
+时序 42 n
+时序模拟 3 i
+时序电路 3 n
+时康宁 2 nr
+时延 6 n
+时延常数 3 n
+时延春 2 nr
+时建兴 3 nrfg
+时开时停 3 l
+时开田 4 nr
+时异事殊 3 l
+时异势殊 3 l
+时弊 50 n
+时式 2 n
+时御史 11 n
+时快时慢 3 l
+时态 51 n
+时态变化 3 l
+时慎修 2 nr
+时执金 6 n
+时抚琴 2 nr
+时报 989 n
+时报周刊 3 n
+时报杂志 3 n
+时报社 2 n
+时报讯 3 n
+时政 187 n
+时效 94 n
+时效性 65 n
+时数 345 n
+时文 23 n
+时斗然 2 n
+时断时续 32 l
+时方 3 n
+时无再来 3 l
+时无卫 2 nr
+时日 377 n
+时日无多 3 l
+时日曷丧 3 vn
+时时 649 n
+时时事事 5 n
+时时刻刻 138 l
+时时处处 22 l
+时明 4 n
+时明军 2 n
+时易世变 3 n
+时有发生 96 n
+时有所闻 11 i
+时有时无 14 l
+时望所归 3 i
+时期 19421 n
+时机 1771 n
+时机不再 3 i
+时机已到 3 l
+时机成熟 3 l
+时机未到 3 l
+时权臣 2 n
+时来运旋 3 n
+时来运来 3 l
+时来运转 24 l
+时松 2 n
+时果 3 n
+时标 9 n
+时样 4 n
+时框 3 n
+时殊风异 3 n
+时段 160 n
+时段性 2 n
+时气 48 n
+时水 3 n
+时永昌 2 nr
+时浮时现 3 l
+时淮西 3 nr
+时深转换 3 i
+时清海宴 3 nr
+时清清 2 nr
+时湘军 3 nr
+时滞 12 n
+时灵 2 n
+时点 19 n
+时燕国 2 nr
+时狄云 2 nr
+时玄武 2 nr
+时珍堂 2 nr
+时甲科 2 n
+时疫 12 n
+时疾 3 n
+时症 3 n
+时移世变 3 nz
+时移世异 3 i
+时移世易 3 l
+时移俗易 3 l
+时移势异 3 i
+时移势易 2 l
+时移势迁 3 i
+时程 2 n
+时空 419 n
+时空图 3 n
+时空旅行 3 nt
+时空点 3 n
+时空网 3 n
+时空观 22 n
+时立制 3 n
+时立爱 3 nr
+时紧时松 2 l
+时绌举盈 3 v
+时绌举赢 3 v
+时经 3 d
+时缺时剩 3 l
+时羞 3 n
+时而 515 d
+时至今日 212 l
+时至运来 3 l
+时艰 15 n
+时节 494 n
+时荷戈 2 nr
+时菜 3 n
+时蔬 2 n
+时蜀汉 2 nr
+时血勇 3 n
+时行 3 n
+时装 257 n
+时装业 5 n
+时装化 4 n
+时装周 3 n
+时装品牌 3 n
+时装展 7 l
+时装店 20 n
+时装戏 3 n
+时装模特 3 n
+时装片 3 n
+时装画 3 n
+时装界 2 n
+时装秀 11 n
+时装网 3 n
+时装节 3 n
+时装表演 3 n
+时装设计 3 n
+时装鞋 3 n
+时见洪 2 nr
+时计 9 n
+时计商 3 n
+时论 3 n
+时评 30 n
+时诎举赢 3 v
+时说 648 n
+时调 27 n
+时谐光波 3 l
+时谐波 3 l
+时谚 3 n
+时贤 3 n
+时赛科 2 nr
+时起时伏 3 l
+时载淳 3 nr
+时辰 1527 n
+时过境迁 61 i
+时运 66 n
+时运不济 3 l
+时运不齐 3 l
+时运亨通 3 nr
+时运通 3 n
+时速 345 n
+时逢 3 v
+时逸之 2 nr
+时金轮 2 n
+时针 108 n
+时钟 191 n
+时钟日历 3 n
+时钟脉冲 3 i
+时钟花坛 3 n
+时铁木 2 n
+时长 47 n
+时间 33288 n
+时间尺度 3 n
+时间差 31 n
+时间常数 3 n
+时间延缓 3 nr
+时间延迟 3 l
+时间性 17 n
+时间推移 3 n
+时间机器 3 n
+时间槽 3 n
+时间段 83 n
+时间爱你 3 l
+时间知觉 3 n
+时间码 3 n
+时间继电 3 n
+时间表 166 n
+时间误差 3 n
+时间跨度 3 vn
+时间轴 3 n
+时间重叠 3 l
+时间量子 3 n
+时限 118 n
+时隐时现 65 i
+时隐时见 3 l
+时隔 251 n
+时隔不久 3 l
+时隔多年 3 l
+时隙 6 n
+时隶臣 2 n
+时雨 6 n
+时雨春风 3 nr
+时风 5 n
+时风时雨 2 l
+时高时低 3 n
+时髦 301 nr
+时髦女孩 3 nr
+时鲁国 3 n
+时鲜 20 n
+旷 557 nr
+旷世 16 nr
+旷世不羁 3 i
+旷世之才 3 nr
+旷世功勋 3 nr
+旷世奇 8 nr
+旷世奇才 2 nr
+旷世无匹 3 nr
+旷世未 2 nr
+旷世逸才 3 nr
+旷世难 11 nr
+旷代 3 n
+旷古 153 nr
+旷古一人 3 i
+旷古奇闻 3 nr
+旷古未有 3 i
+旷古未闻 3 i
+旷古绝今 3 i
+旷古绝伦 3 i
+旷地 3 n
+旷大之度 3 i
+旷夫 3 nr
+旷夫怨女 3 i
+旷奇逸 2 nr
+旷工 15 nr
+旷废 3 n
+旷废学业 3 n
+旷开田 170 nr
+旷心怡神 3 nr
+旷日 3 n
+旷日引久 3 i
+旷日引月 3 i
+旷日弥久 3 i
+旷日持久 74 i
+旷日离久 3 i
+旷日积晷 3 i
+旷日累时 3 i
+旷日经久 3 i
+旷日经年 3 i
+旷日长久 3 i
+旷时日久 3 i
+旷继勋 2 nr
+旷职 3 n
+旷若发蒙 3 nr
+旷课 21 n
+旷课日数 3 n
+旷课时数 3 n
+旷课记录 3 n
+旷费 3 n
+旷费时间 3 n
+旷达 12 nr
+旷达不羁 3 i
+旷野 487 nr
+旸 79 zg
+旹 3 zg
+旺 878 a
+旺丁 4 nrt
+旺代 3 n
+旺健 3 a
+旺兴头村 3 nr
+旺加 3 v
+旺发 3 v
+旺地 3 n
+旺堆 2 n
+旺夫 3 nrt
+旺季 191 n
+旺市 2 n
+旺旺 14 a
+旺月 3 n
+旺气 3 n
+旺泉 3 nr
+旺火 5 a
+旺盛 604 a
+旺盛期 7 nr
+旺盛起来 3 nr
+旺苍 2 nr
+旺苍县 3 nr
+旺角 8 n
+旺销 8 v
+旻 52 zg
+旼 4 zg
+昀 38 g
+昂 592 nr
+昂仁 3 nr
+昂仁县 3 nr
+昂头 3 v
+昂头天外 3 i
+昂头挺胸 3 l
+昂头阔步 3 i
+昂奋 6 a
+昂山 15 nr
+昂强 3 a
+昂扬 80 v
+昂昂 3 a
+昂昂溪区 3 ns
+昂热 2 a
+昂然 190 a
+昂然屹立 3 i
+昂然挺立 3 l
+昂然直入 3 i
+昂然耸立 3 i
+昂然自得 3 i
+昂然自若 3 i
+昂立 6 v
+昂纳 2 nrt
+昂纳克 12 nr
+昂藏 2 v
+昂藏七尺 3 i
+昂贵 531 a
+昂贵品 3 nr
+昂起 79 v
+昂里奥 3 nrt
+昂霄耸壑 3 i
+昂首 188 v
+昂首云天 3 i
+昂首伸眉 3 nr
+昂首天外 3 i
+昂首挺胸 36 l
+昂首望天 3 i
+昂首阔步 22 i
+昃 12 g
+昃食宵衣 3 nr
+昆 770 ns
+昆仑 634 ns
+昆仑奴 3 n
+昆仑山 379 ns
+昆仑山脉 74 ns
+昆仑镜 3 n
+昆仑饭店 10 ns
+昆仲 21 n
+昆剧 40 n
+昆剧团 2 nt
+昆卡 2 ns
+昆友 3 n
+昆士兰 35 ns
+昆士兰州 46 ns
+昆孙 3 ns
+昆季 3 n
+昆山 148 ns
+昆山之玉 3 nr
+昆山县 3 ns
+昆山工专 3 nt
+昆山市 13 ns
+昆山片玉 3 nz
+昆山石 3 ns
+昆嵛山 9 ns
+昆州 2 ns
+昆巴 2 ns
+昆布 17 ns
+昆布二糖 3 n
+昆布多糖 3 n
+昆布糖 3 n
+昆廷 14 ns
+昆弟 3 n
+昆弟之好 3 n
+昆德拉 3 ns
+昆斯 7 ns
+昆明 1419 ns
+昆明人 21 n
+昆明制药 21 n
+昆明地区 2 ns
+昆明城 3 ns
+昆明巫家坝机场 2 ns
+昆明市 103 ns
+昆明机场 3 n
+昆明池 3 ns
+昆明湖 54 ns
+昆明街 3 ns
+昆曲 184 ns
+昆河 10 ns
+昆泰 48 ns
+昆洛 5 ns
+昆燕 9 n
+昆特 12 ns
+昆腔 30 n
+昆腾 24 n
+昆虫 1321 n
+昆虫学 12 n
+昆虫学家 4 n
+昆虫记 3 n
+昆西 14 ns
+昆达 2 ns
+昆都仑区 3 ns
+昆都士 2 ns
+昆阳 27 ns
+昆阳镇 2 ns
+昇 215 zg
+昈 2 zg
+昉 96 zg
+昊 86 nr
+昊天 24 nz
+昊天罔极 3 v
+昌 499 nr
+昌与昆 3 nr
+昌乐 5 nr
+昌乐县 2 ns
+昌乐西 3 ns
+昌亭之客 3 nr
+昌亭旅食 3 n
+昌化 10 ns
+昌化县 2 ns
+昌化江 9 nr
+昌化石 2 nr
+昌升茶 10 nr
+昌南镇 2 ns
+昌吉 27 nr
+昌吉回族自治州 13 ns
+昌吉州 2 ns
+昌吉市 9 ns
+昌国君 7 nr
+昌图 7 nr
+昌图厅 2 nr
+昌图县 5 ns
+昌城 4 ns
+昌宁 3 nr
+昌宁县 3 ns
+昌安 16 ns
+昌宝顺 2 nr
+昌居官 3 nr
+昌巴 3 ns
+昌平 171 nr
+昌平区 18 ns
+昌平县 40 ns
+昌废佛 11 nr
+昌当岭 3 ns
+昌德拉 7 nr
+昌教贡 2 nr
+昌新制 2 nr
+昌昌 4 ns
+昌明 18 nr
+昌歜羊枣 3 ns
+昌江 18 ns
+昌江区 3 ns
+昌江县 5 ns
+昌江黎族自治县 2 ns
+昌河 18 ns
+昌河集团 2 nt
+昌泰森 3 nr
+昌源河 2 nr
+昌珠寺 2 nr
+昌瑞山 2 nr
+昌皇爷 2 nr
+昌盛 80 nz
+昌被明 3 nr
+昌西 9 ns
+昌言 4 nr
+昌言无忌 3 nr
+昌贤德 2 nr
+昌达成 2 nr
+昌迪加尔 7 ns
+昌迪曼 2 nr
+昌道端 2 nr
+昌邑 13 nr
+昌邑区 3 ns
+昌邑县 3 ns
+昌邑市 3 ns
+昌邑王 3 nr
+昌都 42 ns
+昌都县 6 ns
+昌都地区 24 ns
+昌里 2 ns
+昌阳 6 ns
+昌陵 2 ns
+昌隆丝 4 nr
+昌马 6 ns
+昌马堡 2 nr
+昌马峡 2 ns
+昌黎 25 ns
+昌黎北 2 ns
+昌黎县 14 ns
+昌黎文集 3 nr
+昌黎郡 3 nr
+昌齐笑 2 nr
+明 16120 a
+明万历 3 nr
+明三园 5 nr
+明三沙 2 nr
+明三礼 2 nr
+明世宗 541 nr
+明世记 2 nr
+明东平 2 nr
+明中兴 2 nr
+明中叶 52 nr
+明中期 5 t
+明为 3 v
+明主 14 a
+明丽 51 a
+明之世 2 nr
+明之夕 2 nr
+明之弟 2 nr
+明书辑 12 nr
+明争 3 nz
+明争暗斗 48 i
+明于 3 v
+明于体 5 nr
+明于观人 3 i
+明亏 3 v
+明亮 842 a
+明亮动人 3 n
+明人 142 n
+明人不做 3 i
+明人不做暗事 12 i
+明仁 9 nr
+明仁孝 5 nr
+明仁宗 13 nr
+明代 4686 t
+明代宗 2 nr
+明令 123 n
+明令禁止 42 l
+明会典 8 nr
+明伦国中 3 nr
+明伦国小 3 nr
+明体 3 a
+明体字 3 l
+明体诗 2 nr
+明体达 2 nr
+明佣 3 v
+明使臣 6 nr
+明信片 60 n
+明修栈道 12 i
+明儿 534 t
+明儿个 23 t
+明元帝 11 nr
+明光 18 nr
+明光宗 29 nr
+明光宫 3 nr
+明光市 3 nr
+明光烁亮 3 z
+明光瓦 2 nr
+明光甲 2 nr
+明光铮亮 3 nr
+明光锃亮 3 z
+明党参 3 n
+明公之 4 nr
+明公何 2 nr
+明公先 2 nr
+明公勿 2 nr
+明公宜 3 nr
+明公正义 3 nr
+明公正气 3 n
+明公正道 3 nr
+明公裁 2 nr
+明公详 2 nr
+明兵入 3 nr
+明其主 2 nr
+明其理 12 nr
+明其道 2 nr
+明内府 2 nr
+明军乘 2 nr
+明军依然 3 nr
+明军入 7 nr
+明军分 4 nr
+明军劫 2 nr
+明军北 2 nr
+明军攻 7 nr
+明军望 2 nr
+明军肉 2 nr
+明军阵 4 nr
+明冯梦 3 nr
+明净 78 a
+明刀明 12 nr
+明切 3 ad
+明刊 3 n
+明刑不戮 3 i
+明刑弼教 3 nr
+明刘寅 2 nr
+明初 3 t
+明初复 3 nr
+明初建 3 nr
+明初开 2 nr
+明前茶 3 nr
+明力 3 ad
+明十三陵 3 nr
+明升暗降 5 i
+明午准 2 nr
+明博古 2 nr
+明发不寐 3 i
+明叔你 4 nr
+明叔侃 3 nr
+明叔凑 2 nr
+明叔则 2 nr
+明叔刚 2 nr
+明叔别 3 nr
+明叔去 2 nr
+明叔又 2 nr
+明叔听 10 nr
+明叔喝 2 nr
+明叔大 2 nr
+明叔好 2 nr
+明叔希望 2 nr
+明叔忙 2 nr
+明叔惊 3 nr
+明叔想 4 nr
+明叔才 2 nr
+明叔抱 2 nr
+明叔抹 4 nr
+明叔拖 2 nr
+明叔指 2 nr
+明叔按 2 nr
+明叔正 2 nr
+明叔背 2 nr
+明叔见 18 nr
+明叔让 4 nr
+明叔讲 2 nr
+明叔那 13 nr
+明叔闻 3 nr
+明叔面 3 nr
+明史 363 n
+明史修 2 nr
+明名臣 2 nr
+明后 16 t
+明后天 12 t
+明君圣 3 nr
+明和尚 2 nr
+明哲 134 nr
+明哲保身 32 nr
+明哲端 16 nr
+明哲诸 16 nr
+明唐 3 t
+明唯识 2 n
+明喻 2 nr
+明嘉靖 36 nr
+明器 274 n
+明器青 2 nr
+明四夷 7 nr
+明四家 4 nr
+明四朝 3 t
+明因监 2 nr
+明国皇帝 4 nr
+明城墙 3 nr
+明基光 3 nr
+明基电 3 nz
+明基移动 16 nz
+明堂 42 nr
+明堂正道 3 i
+明处 35 v
+明复 3 v
+明复清 2 nr
+明夕 4 t
+明夜 3 t
+明大 3 a
+明大义 3 nr
+明大哥 6 nr
+明天 3264 t
+明天科技 2 nz
+明太后 2 nr
+明太子 2 nr
+明太子太 256 nr
+明太宗 4 nr
+明太祖 299 nr
+明太鱼 7 nr
+明夷待访 3 i
+明如指掌 3 i
+明如昼 7 nr
+明如镜 3 nr
+明婚正娶 3 i
+明婚正配 3 nz
+明媒正娶 32 i
+明媒正礼 3 i
+明媚 147 a
+明子 8 nr
+明孝宗 9 nr
+明孝陵 25 nr
+明季 4 t
+明季三 2 nr
+明季北 6 nr
+明季滇 2 nr
+明安图 10 nr
+明宗南 3 nr
+明宗命 3 nr
+明宗图 2 nr
+明宗太子 2 nr
+明宗子 3 nr
+明宗李 2 nr
+明宗死 3 nr
+明宗设 2 nr
+明定 4 a
+明定陵 4 nr
+明宝钞 2 nr
+明实录 17 nr
+明宣宗 29 nr
+明宣德 3 nr
+明室 2 n
+明宪宗 139 nr
+明宵 3 t
+明察 27 v
+明察暗访 19 i
+明察秋毫 21 nr
+明寰 2 n
+明封伯 2 nr
+明尉氏 2 nr
+明尊火 2 nr
+明尼苏 3 nr
+明尼苏大 3 ns
+明尼苏达 52 ns
+明尼苏达州 27 ns
+明尼阿波利斯 23 nrt
+明山 6 nr
+明山区 2 ns
+明山镇 2 nr
+明崇祯 64 nr
+明布 2 v
+明布政 2 nr
+明师叔 3 nr
+明师固 2 nr
+明帝东 3 nr
+明帝亲 3 nr
+明帝卒 3 nr
+明帝武 2 nr
+明帝永 37 nr
+明帝神 3 nr
+明年 944 t
+明年初 13 t
+明幼主 2 nr
+明度 6 n
+明度对比 3 n
+明廉暗察 3 nr
+明延平 3 nr
+明廷命 5 nr
+明廷封 3 nr
+明廷应 2 nr
+明廷得 2 nr
+明廷派 3 nr
+明廷特 2 nr
+明廷罢 5 nr
+明廷赐 2 nr
+明建文 4 nr
+明开国 2 nr
+明异典 2 nr
+明弃暗取 3 nr
+明式 13 ad
+明弘光 4 nr
+明张溥 2 nr
+明张燮 2 nr
+明律 14 n
+明德 19 nr
+明德卢 3 nr
+明德国中 3 nr
+明德国小 3 nr
+明德惟馨 3 nr
+明德慎 6 nr
+明德水库 3 nr
+明德门 3 nr
+明心 30 a
+明心和 2 nr
+明心志 4 nr
+明心见性 13 n
+明心道 3 nr
+明志工专 3 nr
+明志工业 3 n
+明志远 2 nr
+明忠君 2 nr
+明快 172 a
+明快生动 3 l
+明思克 109 nr
+明思宗 11 nr
+明性 2 n
+明总兵 6 nr
+明恩义 2 nr
+明情理儿 3 l
+明惠帝 2 nr
+明慧 19 nr
+明慧网 3 nr
+明成化 3 nr
+明成祖 861 nr
+明扣 2 v
+明扬仄陋 3 a
+明扬侧陋 3 i
+明投顺 3 nr
+明抗清 2 nr
+明抢 19 nr
+明抢暗偷 3 i
+明报 40 n
+明拔寨 2 nr
+明振江 2 nr
+明推暗就 3 i
+明摆 3 v
+明摆着 185 l
+明改御 3 nr
+明政 3 nr
+明效大验 3 n
+明敏之 2 nr
+明教 619 nz
+明教不变 3 l
+明教中 16 nr
+明教之 3 nr
+明教五 2 nr
+明教众 5 n
+明教厚 2 nr
+明教同 2 l
+明教教 5 nr
+明教木 5 nr
+明教棚 2 nr
+明教源 2 nr
+明教群 24 nr
+明教锐 6 nr
+明文 285 nr
+明文定 2 nr
+明文庙 2 nr
+明文禁 256 nr
+明文禁止 3 l
+明文规定 126 l
+明断 17 v
+明断是非 3 i
+明斯克 175 nr
+明斯基 5 nr
+明斯特 8 nr
+明新工专 3 j
+明方 5 n
+明日 1915 t
+明日之星 3 nz
+明日帝国 3 ns
+明日香 3 nr
+明日黄花 8 nz
+明旨而 2 nr
+明早 114 t
+明时 3 t
+明明 1305 t
+明明灭灭 12 i
+明明白白 244 z
+明明赫赫 3 nr
+明星 2130 nr
+明星专辑 3 l
+明星像 3 n
+明星写真 3 nr
+明星图库 3 nr
+明星图片 3 nz
+明星壁纸 3 n
+明星广告 3 nr
+明星效应 3 l
+明星档案 3 l
+明星榜 3 nr
+明星照 3 nr
+明星网 3 nr
+明星脸 3 nr
+明星队 5 n
+明星阵容 3 nr
+明春 7 t
+明昭昏蒙 3 nr
+明显 9296 a
+明显化 3 nr
+明显可知 3 i
+明显增加 8 nr
+明显增强 9 nr
+明显好转 3 i
+明显提高 15 nr
+明显改善 16 nr
+明显降低 5 n
+明晃晃 216 z
+明晓 6 t
+明晓得 3 nr
+明晓溪 3 nr
+明晚 74 t
+明晨 25 t
+明景宗 128 nr
+明景帝 2 nr
+明景泰 2 nr
+明晰 134 a
+明晰化 3 l
+明智 330 nr
+明智之举 36 i
+明智健吾 3 nr
+明智光秀 3 nr
+明智地 3 nr
+明暗 16 a
+明暗不定 3 l
+明暸 3 z
+明月 358 t
+明月光 3 nr
+明月入怀 3 nr
+明月刀 3 nr
+明月山 3 nr
+明月店 2 nz
+明月当空 3 i
+明月清风 10 nr
+明月照 3 nr
+明有东 2 nr
+明朗 287 nr
+明朗化 30 nr
+明朗朗 4 nr
+明朝 3845 t
+明末 785 t
+明末农民 3 nr
+明末清初 431 t
+明朱权 4 nr
+明来 3 t
+明来明往 3 i
+明来暗往 2 i
+明枪 3 n
+明枪易躲 9 i
+明枪暗箭 8 i
+明查 3 v
+明查暗访 10 nr
+明正其 2 nr
+明正典刑 20 i
+明正德 14 nr
+明正朔 3 nr
+明正统 8 nr
+明正言 128 nr
+明武 8 t
+明武宗 21 nr
+明武英 256 nr
+明殿学士 4 nr
+明比为奸 3 i
+明水 14 nr
+明水凝 29 nr
+明水县 3 nr
+明水香 4 nr
+明永乐 1449 nr
+明沟 3 nr
+明沟暗渠 3 nr
+明治 141 t
+明治天皇 3 nr
+明治维新 115 nz
+明法审令 3 nr
+明法峻 2 nr
+明洁 2 a
+明洪武 547 nr
+明海缆 3 nr
+明清 3554 t
+明清两代 3 nr
+明清小说 3 l
+明清街 3 nr
+明渠 21 nr
+明湖国中 3 nz
+明湖国小 3 nr
+明溪 6 nr
+明溪县 3 nr
+明澈 21 a
+明澈如镜 3 l
+明澈澈 3 nr
+明火 30 a
+明火执仗 12 i
+明火执杖 5 i
+明火执械 3 n
+明火持杖 3 n
+明灭 19 v
+明灯 41 n
+明灿灿 3 nr
+明爱芬 92 nr
+明爽 2 a
+明牌 3 v
+明独照 2 nr
+明玉格 21 nr
+明玉珍 268 nr
+明王朝 406 nr
+明王远 2 nr
+明珠 686 nr
+明珠城 3 nr
+明珠弹雀 3 n
+明珠投暗 3 i
+明珠暗投 4 i
+明珠线 3 nr
+明理 30 a
+明畅 6 a
+明登州 2 nr
+明白 10875 nr
+明白了当 3 l
+明白事理 3 n
+明白人 101 nr
+明白卡 2 nr
+明白纸 3 n
+明百官 2 nr
+明皇醒 2 nr
+明盘 3 v
+明盟 3 j
+明目 37 n
+明目张胆 76 i
+明目达聪 3 nr
+明眸 16 v
+明眸皓齿 31 i
+明眼 6 a
+明眼人 53 n
+明知 897 v
+明知故犯 11 i
+明知故问 49 i
+明石 3 nr
+明矾 64 n
+明矾石 31 n
+明码 50 n
+明码标价 3 n
+明码电报 3 nz
+明确 5812 ad
+明确任务 3 n
+明确分工 3 n
+明确化 4 n
+明确性 10 n
+明确指出 3 n
+明确提出 3 n
+明确要求 3 l
+明确规定 3 l
+明确责任 3 l
+明示 139 v
+明礼义 2 nr
+明礼部 256 nr
+明社遂 3 nr
+明禅师 9 nr
+明福 2 a
+明秀 3 a
+明秀园 3 nr
+明秀轩 3 nr
+明科皮 2 nr
+明穆宗 6 nr
+明窗净几 4 i
+明索恩 2 nr
+明线 13 n
+明细 41 ad
+明细单 3 z
+明细帐 3 n
+明细表 10 n
+明细账 14 l
+明经略 2 nr
+明经科 2 nr
+明经笑 4 nr
+明罗洪 2 nr
+明罚敕法 3 vn
+明群礁 2 nr
+明者 4 n
+明耻教战 3 l
+明胶 47 n
+明胶液化 3 nz
+明至清 2 nr
+明艳 36 a
+明艳照人 3 nr
+明若观火 3 i
+明英宗 175 nr
+明著 2 a
+明虾 3 nr
+明补 3 v
+明装 2 v
+明襄王 2 nr
+明见万里 20 i
+明见澈 2 nr
+明视 3 v
+明视觉 3 n
+明视距离 3 n
+明角 3 n
+明角灯 5 n
+明解 2 v
+明言 110 nr
+明言非 2 i
+明订 3 v
+明证 112 v
+明识远 2 nr
+明词综 2 nr
+明诗别 2 nr
+明诗综 5 nr
+明说 113 v
+明贾政 3 nr
+明贾母 12 nr
+明赏不费 3 l
+明赏慎罚 3 i
+明赐名 2 nr
+明起 3 v
+明路 3 n
+明路儿 2 nr
+明轮船 2 n
+明辛街 2 nr
+明辨 47 v
+明辨是非 21 i
+明辨真伪 3 n
+明辰敬 2 nr
+明达 19 a
+明远 24 a
+明逊国 4 nr
+明通 2 a
+明通鉴 2 nr
+明道 30 v
+明道藏 2 nr
+明郑晓 2 nr
+明里 37 t
+明里帖 2 nr
+明里暗里 8 nr
+明重辑 2 nr
+明铁盖 3 nr
+明锐 3 a
+明镜 104 n
+明镜止水 3 nr
+明镜高悬 5 nr
+明长城 7 nr
+明长陵 2 nr
+明闪闪 3 z
+明降州 2 nr
+明降暗升 3 nr
+明雄毅 2 nr
+明霞岛 3 nr
+明霞洞 2 nr
+明静 2 a
+明面 2 ad
+明面儿 3 nr
+明顾炎 128 nr
+明驼 3 n
+明验大效 3 n
+明鲁王 2 nr
+明黄缎 2 nr
+昏 845 v
+昏乱 37 a
+昏倒 107 v
+昏到 3 v
+昏厥 86 v
+昏君 98 v
+昏天暗地 3 i
+昏天黑地 56 i
+昏头 3 v
+昏头打脑 3 l
+昏头搭脑 3 l
+昏头昏脑 19 l
+昏头晕脑 3 i
+昏头转向 2 i
+昏官 8 n
+昏定晨省 3 i
+昏庸 136 a
+昏庸无道 3 l
+昏惨惨 5 z
+昏愚 3 a
+昏愦 17 a
+昏明 3 v
+昏昏 3 v
+昏昏悠悠 3 z
+昏昏暗暗 3 i
+昏昏欲睡 52 l
+昏昏沉沉 155 z
+昏昏浩浩 3 i
+昏昏然 8 z
+昏昏迷迷 9 z
+昏昏默默 3 n
+昏星 2 n
+昏昧 9 a
+昏晕 118 v
+昏暗 275 a
+昏暗暗 2 l
+昏暮 3 n
+昏死 43 v
+昏死过去 3 l
+昏沉 32 z
+昏沉沉 15 z
+昏浊 3 a
+昏眩 14 v
+昏睡 129 v
+昏睡不醒 3 n
+昏瞶 3 z
+昏聩 26 a
+昏聩无能 3 nz
+昏花 27 z
+昏蒙蒙 3 z
+昏话 3 v
+昏过去 3 l
+昏迷 554 v
+昏迷不省 3 l
+昏迷不醒 100 l
+昏镜重明 3 l
+昏镜重磨 3 l
+昏鸦 3 n
+昏黄 140 z
+昏黑 61 z
+昐 4 zg
+昑 9 zg
+易 5042 a
+易七世 3 nr
+易三娘 28 nr
+易世金 8 nr
+易中天 9 nr
+易主 10 nr
+易义别 2 nr
+易之义 2 nr
+易之意 6 nr
+易之缘 3 nr
+易九世 10 nr
+易买得 3 nr
+易事 81 n
+易二世 6 nr
+易于 1015 v
+易于反手 3 l
+易于反掌 3 i
+易于拾遗 3 i
+易于控制 3 n
+易于误解 3 l
+易云霆 4 nr
+易京 3 ns
+易传 48 nr
+易位 23 n
+易位牙 3 nr
+易位系 3 n
+易使用 3 nr
+易俗 2 a
+易俗社 9 nr
+易俗移风 3 nr
+易元吉 2 nr
+易其主 2 nr
+易其兵 2 nr
+易其疆 2 nr
+易切削 2 nr
+易创基 2 nr
+易制毒 3 nz
+易势迁 16 nr
+易勿真 2 nr
+易化 2 v
+易化性 2 nr
+易北 6 ns
+易北河 30 nr
+易升华 2 nr
+易卜 3 nr
+易卜拉欣 78 nr
+易卜生 52 nr
+易压碎 3 nz
+易县 68 ns
+易发 30 nz
+易发久 3 nr
+易发牢骚 3 i
+易发胃 3 nr
+易发见 2 nr
+易发难收 3 l
+易受侵犯 3 n
+易受攻击 3 i
+易变 3 v
+易变性 3 nr
+易口以食 3 i
+易合易 2 nr
+易同反掌 3 i
+易名 77 v
+易国梓 3 nrfg
+易国祥 2 nr
+易地 29 n
+易地做官 4 l
+易地而处 5 i
+易域风情 3 n
+易培基 4 nr
+易堂主 3 nr
+易大彪 24 nr
+易天行 3 nr
+易如反掌 106 i
+易如拾芥 3 nr
+易如破竹 3 i
+易如翻掌 3 i
+易姓 3 nrfg
+易威登 3 nr
+易子析骸 3 n
+易子而教 3 nr
+易子而食 8 i
+易学 52 n
+易学难输 3 l
+易守难 14 nr
+易安居士 3 nr
+易宜曲 17 nr
+易宪容 6 nr
+易家湾 7 nr
+易容改 2 nr
+易容术 3 nr
+易尚文 3 nr
+易居网 3 nr
+易州 6 ns
+易州定 3 nr
+易巴德 2 nr
+易师爷 6 nr
+易帜 38 nr
+易度 2 n
+易建联 30 nr
+易开罐 3 nz
+易异构 2 nr
+易弄碎 3 i
+易弓矢 2 nr
+易弯 3 nr
+易得 32 v
+易心莹 2 nr
+易怒 58 nr
+易性 2 n
+易感性 16 n
+易感虫性 3 n
+易懂 99 nr
+易成 2 nr
+易手 40 v
+易才网 3 nr
+易抚慰 3 nr
+易拉宝 3 nr
+易拉罐 10 nz
+易挥发 3 nr
+易损 6 nr
+易损件 12 n
+易损性 2 nr
+易接近 3 nr
+易撕碎 3 z
+易散发 3 nr
+易文网 3 nr
+易斯波 3 nr
+易斯湖 2 nr
+易方达 16 nr
+易早卒 2 nr
+易昌陶 3 nr
+易景茜 2 nr
+易智付 2 nr
+易木云 47 nr
+易水寒 3 nr
+易消化 3 nr
+易清洗 3 nr
+易游网 3 nz
+易溶 146 nr
+易潮解 12 nr
+易激 2 v
+易烨卿 3 nr
+易熔金 3 nr
+易燃 60 nr
+易燃品 3 n
+易燃易爆 10 nz
+易燃物 8 n
+易燃物品 2 n
+易爆 15 nz
+易爆物 4 nz
+易爆物料 3 nz
+易物 6 n
+易犯 3 v
+易王卒 3 nr
+易生 14 nr
+易生成 2 nr
+易生根 2 nr
+易用 25 v
+易用性 7 nr
+易田之 6 nr
+易登网 3 nr
+易破碎 3 i
+易碎 27 v
+易碎品 3 nr
+易碎性 3 nr
+易程序 3 n
+易筋经 92 nz
+易管理性 2 n
+易经 248 nr
+易经学会 3 nt
+易经网 3 nz
+易继发 5 nr
+易维护性 2 nr
+易缘网 3 nr
+易耗 6 v
+易耗品 3 n
+易职 3 v
+易聚易 2 nr
+易胜博 3 nr
+易腐 3 nz
+易腐烂 3 l
+易舟浮 2 nr
+易良田 2 nr
+易荒闲 2 nr
+易行 16 v
+易被忘记 3 i
+易西亚德 2 nr
+易见 3 nr
+易言之 3 nr
+易语言 3 nr
+易读 3 v
+易读性 3 nr
+易读易写 3 n
+易贡藏布 3 ns
+易贤忠 258 nr
+易货 37 n
+易货贸易 7 l
+易购网 3 nz
+易趣 145 a
+易趣网 25 nr
+易车网 3 nz
+易输难学 3 n
+易辙改弦 3 nr
+易遭攻击 3 nr
+易采易 2 nr
+易释文 2 nr
+易错 2 nr
+易门 3 nr
+易门县 3 ns
+易随行 3 nr
+易顺鼎 4 nr
+昔 461 tg
+昔为 3 ns
+昔人 3 t
+昔岁 3 t
+昔年 132 t
+昔手 3 ns
+昔日 1373 t
+昔时 3 t
+昔者 3 ns
+昔阳 4 t
+昔阳县 5 ns
+昕 113 g
+昖 21 zg
+昙 366 zg
+昙花 19 n
+昙花一现 57 i
+昚 7 zg
+昛 2 zg
+昝 11 nr
+昝云龙 3 nr
+昞 71 zg
+星 4424 n
+星主 3 n
+星云 583 n
+星位 3 n
+星体 101 n
+星儿 9 n
+星光 407 n
+星光奖 2 nz
+星光灿烂 3 i
+星光点点 3 n
+星光照耀 3 nr
+星前月下 3 t
+星加坡 3 ns
+星区 5 n
+星占学 3 n
+星占术 3 n
+星历 3 t
+星历表 5 n
+星叶草 6 n
+星号 14 n
+星团 205 n
+星图 65 n
+星土云 3 nr
+星型 5 n
+星外星 3 nz
+星夜 297 t
+星奔川骛 3 i
+星女郎 3 nr
+星妈 3 n
+星子 109 n
+星子县 5 nr
+星孔明 2 nr
+星宿 551 n
+星岛 10 n
+星岛日报 3 nz
+星岩内 2 nr
+星工场 3 n
+星巴克 29 nr
+星币 3 n
+星座 266 n
+星座卡 3 nz
+星座号 3 nz
+星座图 3 nz
+星座网 3 nz
+星形 48 n
+星形曲线 3 n
+星形线 3 n
+星思凡 2 nr
+星战 3 nz
+星报 14 n
+星散 27 n
+星斗 56 n
+星族 57 nz
+星旗 2 n
+星旗电戟 3 i
+星星 398 nz
+星星之火 41 i
+星星峡 10 nr
+星星点点 47 n
+星星落落 3 i
+星月 100 t
+星月交辉 3 nz
+星月光 2 nz
+星月旗 2 nr
+星期 1330 t
+星期一 151 t
+星期三 117 t
+星期二 137 t
+星期五 194 t
+星期假日 3 t
+星期八 3 t
+星期六 218 t
+星期四 105 t
+星期天 304 t
+星期天版 3 n
+星期日 170 t
+星条旗 23 n
+星梦 3 nz
+星梦缘 3 nr
+星槎 15 n
+星欺六 3 i
+星殿前 2 nr
+星毛虫 3 n
+星汉 2 t
+星河 66 n
+星河奖 3 nz
+星河湾 3 ns
+星洲 3 ns
+星流电击 3 l
+星流霆击 3 i
+星海 14 ns
+星湖 7 n
+星源 6 n
+星火 374 n
+星火村 3 n
+星火燎原 7 l
+星火计划 779 n
+星灭光离 3 i
+星点 7 n
+星爸 3 n
+星爸星妈 3 nr
+星牌 5 n
+星状 3 n
+星状体 3 n
+星球 433 n
+星球大战 3 nz
+星盒子 3 n
+星盘 13 n
+星相 50 n
+星离月会 3 nz
+星离雨散 3 i
+星移斗换 3 i
+星移斗转 6 i
+星移漏转 3 i
+星移物换 3 i
+星空 194 n
+星空网 3 n
+星等 191 b
+星系 771 n
+星系团 115 n
+星级 456 n
+星级宾馆 3 n
+星级饭店 3 n
+星罗云布 3 nr
+星罗栱布 3 nz
+星罗棋布 263 i
+星群 10 n
+星联珠 11 n
+星芒状 2 nz
+星萨法 2 nz
+星落云散 12 i
+星虫 10 n
+星行夜归 3 i
+星行电征 3 n
+星言夙驾 3 vn
+星语心愿 3 i
+星象 62 n
+星象学 18 n
+星辰 116 n
+星辰表 3 nr
+星达 3 nz
+星达公司 3 n
+星运 3 n
+星运亨通 3 nr
+星采酥 3 nr
+星野 11 n
+星际 276 n
+星际争霸 3 n
+星际大战 3 nz
+星际飞行 3 n
+星霜屡移 3 vn
+星飞云散 3 i
+星飞电急 3 i
+星马 3 n
+星马地区 3 ns
+星驰 14 nz
+星驰电发 3 nz
+星驰电掣 3 i
+星驰电走 3 i
+星鱼 3 n
+星龙渊 4 nr
+映 634 v
+映体 4 n
+映像 16 v
+映像管 3 n
+映入 48 v
+映入眼帘 65 l
+映出 93 v
+映对 3 v
+映射 168 v
+映射函数 2 l
+映射器 3 l
+映射度 3 n
+映山红 9 nr
+映带 3 v
+映推 3 v
+映月读书 3 nr
+映照 205 v
+映照出来 3 l
+映照在 3 l
+映片 3 n
+映现 16 v
+映眼 3 v
+映着 3 v
+映荡 3 v
+映衬 83 v
+映象 29 v
+映雪囊萤 3 n
+映雪读书 3 nr
+昢 92 zg
+昣 4 zg
+春 4753 tg
+春上 3 t
+春义 259 n
+春之声 3 nr
+春之歌 3 nr
+春事 3 n
+春交会 2 j
+春令 3 n
+春假 15 t
+春假里 3 t
+春儿 4 t
+春元 2 t
+春光 98 n
+春光乍泄 3 i
+春光外泄 3 v
+春光明媚 17 nr
+春光漏泄 3 v
+春兰 37 nr
+春兰杯 10 nz
+春兰秋菊 4 nr
+春军 2 n
+春冰虎尾 3 nr
+春凳 10 n
+春分 61 n
+春分时节 3 n
+春分点 40 n
+春化 4 n
+春化阶段 3 n
+春华 10 nz
+春华秋实 10 nr
+春卷 25 n
+春去秋来 10 nr
+春和景明 2 nr
+春哈旺 3 nr
+春回大地 11 l
+春园 3 n
+春困 12 v
+春地 3 n
+春城 17 n
+春夏 3 t
+春夏季 14 nr
+春夏秋冬 40 nr
+春夜 27 t
+春大麦 4 nr
+春天 1421 t
+春天气息 3 i
+春天里 3 nr
+春姑 9 n
+春姑娘 2 nr
+春婆 4 n
+春子 3 n
+春字头 3 n
+春季 970 t
+春季旅行 3 n
+春季班 3 nr
+春宫 32 n
+春宫图 3 nr
+春宫画 3 nr
+春宵 11 t
+春宵一刻 3 t
+春宵苦短 3 i
+春寒 13 t
+春寒料峭 21 i
+春小麦 52 nr
+春山如笑 3 l
+春心 28 n
+春心荡漾 3 nr
+春忙 3 nr
+春性 3 n
+春情 4 n
+春愁 3 n
+春意 75 n
+春意浓 3 nr
+春意盎然 18 l
+春意闹 3 l
+春意阑珊 3 i
+春播 58 vn
+春播作物 3 n
+春收 3 n
+春日 60 t
+春旱 28 n
+春晓 27 t
+春晖 18 nr
+春晖寸草 3 nr
+春晚 3 t
+春景 14 n
+春暖花开 61 l
+春暖花香 3 nr
+春木 4 n
+春来早 3 l
+春柳 7 nr
+春树暮云 3 nr
+春桃 12 n
+春梦 27 nz
+春梦一场 3 l
+春梦了无 3 l
+春梦无痕 3 nr
+春歌 2 n
+春水 45 n
+春汛 44 n
+春江 6 nr
+春江花 3 nr
+春江花月夜 20 nz
+春泥 5 n
+春深似海 3 i
+春游 265 n
+春满人间 3 l
+春潮 28 n
+春灌 3 nr
+春熙路 9 i
+春牛 6 n
+春生 87 n
+春生夏长 3 n
+春生秋杀 3 i
+春申路 3 nr
+春瘟 3 n
+春神 3 n
+春秋 3226 t
+春秋季 9 t
+春秋左氏 3 nr
+春秋左转 3 nr
+春秋战国 3 nr
+春秋时代 3 t
+春秋时期 3 t
+春秋正富 3 nr
+春秋笔法 3 nr
+春秋繁露 3 nr
+春秋衫 3 nr
+春秋装 3 nr
+春秋鼎盛 4 nr
+春种 14 n
+春笋 27 n
+春笋怒发 3 ns
+春管 3 n
+春绸 3 n
+春耕 35 nr
+春耕夏耘 3 nr
+春耕大忙 2 i
+春耕时节 3 l
+春耕生产 3 l
+春联 94 nz
+春肥 3 n
+春色 74 n
+春色撩人 3 vn
+春色满园 4 nr
+春节 1289 t
+春节假期 3 n
+春节前夕 3 i
+春节快乐 3 n
+春节愉快 3 z
+春节晚会 3 n
+春花 11 n
+春花秋实 3 nr
+春花秋月 12 nr
+春花素 3 n
+春苗 2 n
+春茶 38 n
+春草 26 n
+春草碧色 3 i
+春荒 10 n
+春药 51 n
+春菇 3 n
+春葩丽藻 3 ns
+春蕊 3 n
+春蕾 14 nr
+春蕾班 3 nr
+春蕾计划 4 n
+春蚓秋蛇 3 v
+春蚕 33 n
+春蚕到死丝方尽 4 l
+春蛇秋蚓 3 n
+春蛙秋蝉 3 nr
+春衣 3 n
+春袋 3 n
+春装 31 n
+春装展示 3 l
+春训 3 n
+春讯 3 nz
+春试 3 n
+春诵夏弦 3 nr
+春谷 3 n
+春辉 3 nr
+春运 85 n
+春运期间 3 l
+春酒 20 n
+春闺 3 n
+春闺梦 3 i
+春阳 9 t
+春雨 121 n
+春雨如油 3 i
+春雨弯刀 3 i
+春雨绵绵 3 l
+春雪 14 n
+春雷 48 nr
+春霖 3 nr
+春露 3 t
+春露秋霜 3 nr
+春风 269 n
+春风一度 3 l
+春风化雨 15 l
+春风吹又生 7 i
+春风和气 3 n
+春风和畅 3 nr
+春风夏雨 3 l
+春风得意 39 i
+春风来 3 l
+春风沂水 3 ns
+春风满面 3 l
+春风野火 3 i
+春风雨露 4 i
+春风顺意 3 i
+春风风人 3 i
+春饼 17 n
+春香传 2 nr
+春麦 17 n
+昧 380 v
+昧于事理 3 vn
+昧地瞒天 3 z
+昧地谩天 3 z
+昧己瞒心 3 l
+昧心 29 b
+昧旦晨兴 3 nz
+昧死以闻 3 nrfg
+昧爽 3 b
+昧着良心 3 nz
+昧良心 3 z
+昨 219 t
+昨儿 250 t
+昨儿个 24 t
+昨在 3 t
+昨夜 549 t
+昨夜里 3 t
+昨天 4707 t
+昨天上午 3 t
+昨天下午 3 t
+昨天中午 3 t
+昨天夜里 3 t
+昨天早上 3 nr
+昨天晚上 3 t
+昨日 2229 t
+昨晚 965 t
+昨晨 3 t
+昨非今是 3 n
+昩 17 zg
+昪 38 zg
+昫 22 zg
+昬 6 zg
+昭 889 nrt
+昭信天下 3 i
+昭君 340 nrt
+昭告 22 v
+昭和 29 nz
+昭和年间 3 n
+昭如日星 3 i
+昭宁 17 nrt
+昭宗 24 nrt
+昭帝 77 nrt
+昭平 3 nrt
+昭平县 2 ns
+昭彰 17 v
+昭德塞违 3 i
+昭披耶河 2 ns
+昭明 15 nz
+昭昭 12 z
+昭昭在目 3 i
+昭显 3 a
+昭然 3 z
+昭然若揭 16 i
+昭王 62 nrt
+昭着 3 v
+昭示 117 v
+昭示中外 3 nz
+昭穆 3 nrt
+昭穆伦序 3 nz
+昭苏 11 ns
+昭苏县 6 ns
+昭著 3 a
+昭觉 3 v
+昭觉县 2 nrt
+昭觉寺 2 nrt
+昭通 42 nz
+昭通市 7 ns
+昭阳 4 ns
+昭阳区 3 ns
+昭陵 49 nrt
+昭雪 72 nrt
+是 796991 v
+是不是 5655 l
+是从 4054 v
+是古非今 3 l
+是可忍 3 l
+是否 9996 v
+是否是 165 l
+是因为 798 c
+是夜 166 t
+是我太 3 n
+是是非非 29 l
+是非 1099 v
+是非不分 3 l
+是非之地 3 l
+是非之心 6 l
+是非分明 18 l
+是非功过 3 l
+是非口舌 3 l
+是非只为多开口 2 i
+是非得失 10 l
+是非成败 3 l
+是非曲直 76 i
+是非自有公论 3 l
+是非观 9 l
+是非题 3 l
+是非颠倒 3 i
+昰 26 zg
+昱 36 g
+昴 50 g
+昵 78 vg
+昵交 3 n
+昵友 3 n
+昵爱 3 n
+昵称 38 n
+昶 16 g
+昸 3 zg
+昺 24 zg
+昼 180 n
+昼乾夕惕 3 i
+昼伏夜出 28 i
+昼伏夜动 3 l
+昼伏夜游 3 l
+昼伏夜行 4 l
+昼分 3 n
+昼吟宵哭 3 i
+昼夜 887 t
+昼夜不分 3 l
+昼夜不息 5 l
+昼夜不舍 3 i
+昼夜兼程 8 l
+昼夜兼行 3 l
+昼夜匪懈 3 l
+昼夜摆动 3 l
+昼夜节律 3 l
+昼寝 3 n
+昼干夕惕 3 i
+昼度夜思 3 l
+昼思夜想 3 i
+昼想夜梦 3 l
+昼慨宵悲 3 i
+昼日 3 t
+昼日三接 3 i
+昼日昼夜 3 v
+昼盲 3 n
+昼短夜长 3 l
+昼耕夜诵 3 i
+昼警夕惕 3 n
+昼长夜短 4 i
+昼间 28 n
+昼阴夜阳 3 l
+昼马 3 n
+显 4574 v
+显亮 3 a
+显亲扬名 2 i
+显亲王 3 nr
+显位 3 v
+显体 3 a
+显像 45 v
+显像剂 3 n
+显像液 3 n
+显像管 59 n
+显具 3 v
+显出 635 v
+显化 3 v
+显卡 21 v
+显名 3 v
+显圣 48 a
+显型 3 b
+显士 3 n
+显妣 3 i
+显姓扬名 3 i
+显威 10 v
+显存 8 v
+显学 3 v
+显官 17 v
+显宦 3 n
+显宿 2 v
+显富 3 a
+显属 3 v
+显山 11 v
+显山露水 8 i
+显式算子 3 n
+显形 10 v
+显影 28 v
+显影像 3 n
+显影剂 10 n
+显影力 3 n
+显影机 3 n
+显影液 3 n
+显影纸 3 n
+显得 4888 v
+显得出众 3 i
+显微 88 a
+显微图 3 nr
+显微外科 3 nz
+显微学 3 n
+显微摄影 3 i
+显微摄象 3 n
+显微照片 3 n
+显微照相 3 nr
+显微组分 3 n
+显微结构 3 n
+显微镜 299 nr
+显微阐幽 3 nr
+显性 86 n
+显性化 2 v
+显扬 6 v
+显摆 24 v
+显效 10 a
+显教 3 nz
+显族 2 nz
+显明 68 v
+显易 3 a
+显晶 4 nr
+显植物 3 l
+显水 5 v
+显灵 45 v
+显热负荷 3 n
+显热通量 3 n
+显然 5015 ad
+显爵 2 v
+显现 500 v
+显现出 3 v
+显现出来 3 l
+显生宙 14 n
+显目 3 ad
+显眼 152 v
+显着 3 v
+显着性 3 n
+显硕 2 a
+显示 6872 v
+显示仪 17 nz
+显示信息 4 i
+显示卡 2 n
+显示器 664 n
+显示图 2 n
+显示字符 3 n
+显示屏 176 n
+显示文件 3 n
+显示方式 3 nz
+显示桌面 3 n
+显示牌 4 n
+显示目录 3 n
+显示管 6 n
+显示终端 9 i
+显示装置 3 n
+显祖 3 nr
+显祖扬名 3 i
+显祖扬宗 3 nr
+显祖荣宗 3 nr
+显耀 10 v
+显考 3 v
+显者 3 n
+显而 3 i
+显而易见 322 i
+显职 3 v
+显能 3 v
+显色 23 v
+显色剂 6 n
+显色性 3 n
+显色指数 3 i
+显花 2 v
+显花植物 13 l
+显荣 3 v
+显著 2721 a
+显著地位 3 n
+显著性 3 n
+显著成绩 3 n
+显著效果 3 n
+显著标志 3 n
+显著特点 3 n
+显著者 6 n
+显要 73 v
+显要人物 3 l
+显要位置 3 n
+显见 251 v
+显证 3 v
+显豁 3 a
+显象 3 v
+显象管 2 v
+显财 3 v
+显贵 123 a
+显赫 756 a
+显赫一时 21 i
+显赫家世 3 nr
+显身 3 v
+显身手 3 i
+显身扬名 3 i
+显达 5 v
+显通寺 7 nr
+显露 582 v
+显露出 3 i
+显露出来 3 i
+显露头角 3 i
+昿 2 zg
+晁 262 nr
+晁保正 20 nr
+晁卿辞 2 nr
+晁天王 3 nr
+晁家庄 4 nr
+晁盖之 2 nr
+晁盖便 6 nr
+晁盖听 3 nr
+晁盖宋 4 nr
+晁盖庄 3 nr
+晁盖引 3 nr
+晁盖恐 2 nr
+晁盖见 5 nr
+晁补之 3 nr
+晁错 35 nr
+時 6 zg
+晃 1525 v
+晃动 513 v
+晃动起来 3 v
+晃头晃脑 3 z
+晃悠 43 z
+晃悠悠 6 z
+晃晃 3 z
+晃晃悠悠 34 z
+晃晃荡荡 7 z
+晃朗 3 z
+晃来 3 v
+晃来晃去 3 z
+晃点 3 v
+晃眼 43 v
+晃荡 45 v
+晅 2 zg
+晇 3 zg
+晈 3 zg
+晋 1532 nr
+晋一剑 3 nr
+晋东 3 ns
+晋东南 42 ns
+晋东阁 2 nr
+晋中 47 ns
+晋中地区 3 ns
+晋中市 3 ns
+晋为皇 2 nr
+晋书 76 nr
+晋二王 4 nr
+晋京 25 ns
+晋代 338 t
+晋伐鲜 3 ns
+晋侯墓 10 ns
+晋侯苏 20 nr
+晋元帝 32 nr
+晋公子 2 nr
+晋兴郡 4 nr
+晋冀 2 j
+晋冀豫 51 j
+晋冀鲁豫 182 j
+晋军先 2 nr
+晋军得 2 nr
+晋军撤 2 nr
+晋军渡 3 nr
+晋剧 16 v
+晋北 46 ns
+晋升 566 nr
+晋升为 3 nr
+晋升制度 3 n
+晋华 2 nz
+晋南 133 ns
+晋卿岛 3 ns
+晋厉公 11 nr
+晋县 3 ns
+晋发荣 3 nr
+晋右玉 3 nr
+晋周 2 t
+晋哀帝 4 nr
+晋唐 5 t
+晋唐诸 2 nr
+晋园 5 ns
+晋园杯 3 nr
+晋国 170 ns
+晋城 51 ns
+晋城市 15 ns
+晋大同 3 nr
+晋太康 18 nr
+晋孝武帝 10 nrt
+晋宁 25 nr
+晋宁县 3 ns
+晋宁梅 2 nr
+晋宁石 3 nr
+晋安 2 ns
+晋安区 2 ns
+晋安帝 13 nr
+晋安郡 2 nr
+晋宋 3 t
+晋官加 2 nr
+晋宣帝 2 nr
+晋察冀 155 j
+晋察冀军区 189 nt
+晋察冀边区 38 ns
+晋察冀野战军 26 nt
+晋封 14 ns
+晋封懿 2 nr
+晋小波 14 nr
+晋少詹 2 nr
+晋州 21 ns
+晋州市 3 ns
+晋平公 6 nr
+晋广陵 3 nr
+晋归楚 2 nr
+晋怀帝 22 nr
+晋恭帝 8 nr
+晋悼公 3 nr
+晋惠公 6 nr
+晋惠帝 28 nr
+晋惠王 2 nr
+晋惠闻蛙 3 n
+晋愍帝 7 nr
+晋成帝 9 nr
+晋承魏 3 nr
+晋挚虞 2 nr
+晋文侯 4 nr
+晋文公 54 nr
+晋无公 2 nr
+晋昌军 2 nr
+晋明帝 4 nr
+晋朝 37 t
+晋朝人 3 nr
+晋朝封 3 nr
+晋材楚用 3 nr
+晋杜预 2 nr
+晋林波 3 nr
+晋武公 2 nr
+晋武帝 64 nr
+晋武英 3 nr
+晋水 2 ns
+晋永嘉 3 nr
+晋江 68 ns
+晋江人 3 nr
+晋江县 13 ns
+晋江市 15 ns
+晋源区 3 ns
+晋源镇 4 nr
+晋灵公 3 nr
+晋爵 2 nr
+晋爵魏 2 nr
+晋献侯 11 nr
+晋献公 16 nr
+晋王 91 nrt
+晋王治 2 nr
+晋王甘 2 nr
+晋王镇 2 nr
+晋用 3 v
+晋用楚材 3 nr
+晋益州 2 nr
+晋祠泉 6 nr
+晋穆侯 4 nr
+晋穆帝 2 nr
+晋级 238 nr
+晋绥 62 j
+晋绥边区 8 ns
+晋职 8 v
+晋至唐 5 nr
+晋葛洪 6 nr
+晋西 20 ns
+晋西北 87 ns
+晋见 166 nr
+晋谒 26 nr
+晋赵鞅 4 nr
+晋跃升 2 nr
+晋身 3 v
+晋身之阶 3 nr
+晋身阶 3 nr
+晋辟雍 3 nr
+晋郭璞 3 nr
+晋长治 3 nr
+晋阳 93 ns
+晋阳之甲 3 nr
+晋阳南 2 ns
+晋阳湖 2 ns
+晋静公 3 nr
+晋韩康 2 nr
+晋顷公 2 nr
+晋魏王 2 nr
+晋鲍敬 2 nr
+晌 276 t
+晌午 178 t
+晏 352 nr
+晏叔原 2 nr
+晏婴 22 nr
+晏子 34 nr
+晏子春秋 3 nr
+晏子赋 2 nr
+晏家镇 2 nr
+晏平仲 3 nr
+晏开之警 3 nr
+晏强国 2 nr
+晏果茹 2 nr
+晏海中 2 nr
+晏秋秋 3 nr
+晏阳初 16 nr
+晏驾 9 nr
+晒 1465 v
+晒台 17 n
+晒图 3 v
+晒图员 3 n
+晒图机 3 n
+晒图纸 3 nz
+晒场 6 n
+晒坪 3 n
+晒太阳 386 n
+晒干 3 n
+晒平 3 n
+晒成 3 v
+晒斑 6 n
+晒晒 3 v
+晒烟 19 n
+晒版 3 v
+晒版机 3 n
+晒盐 3 n
+晒种 3 n
+晒衣 3 n
+晒衣服 3 n
+晒衣架 3 n
+晒衣绳 3 n
+晒被子 3 v
+晒谷 3 n
+晒谷场 2 n
+晒过 3 v
+晒饭 3 v
+晒黑 3 v
+晓 507 nr
+晓之以理 24 i
+晓之车 3 nr
+晓事 3 v
+晓以利害 2 i
+晓以大义 3 nr
+晓市 5 v
+晓得 1373 v
+晓悟 2 v
+晓悟晓月 3 nr
+晓月残星 3 nr
+晓畅 18 nr
+晓示 8 v
+晓色 5 nr
+晓芙 7 nrt
+晓行夜住 3 i
+晓行夜宿 19 i
+晓谕 104 nr
+晓雾 2 nr
+晓露 4 v
+晓风残月 12 i
+晔 49 g
+晕 1303 v
+晕乎乎 7 z
+晕倒 245 v
+晕动病 3 i
+晕厥 60 v
+晕呼呼 3 z
+晕场 3 v
+晕头 3 v
+晕头晕脑 3 i
+晕头转向 71 i
+晕昏 3 v
+晕晕乎乎 12 z
+晕晕忽忽 2 z
+晕晕沉沉 3 z
+晕机 11 v
+晕染 13 v
+晕死 3 v
+晕池 3 n
+晕沉沉 3 z
+晕渲法 3 vn
+晕眩 111 v
+晕糊糊 3 z
+晕船 25 v
+晕船药 3 i
+晕菜 4 v
+晕车 34 v
+晕车药 3 i
+晕过去 3 i
+晕针 3 v
+晕高 3 v
+晕高儿 3 z
+晖 145 nr
+晖光日新 3 nz
+晖映 3 nz
+晗 27 g
+晚 5823 tg
+晚一点 3 n
+晚上 5770 t
+晚上十 2 t
+晚世 3 t
+晚些 3 t
+晚些时候 3 t
+晚会 837 n
+晚会节目 3 n
+晚会风 2 n
+晚八点 3 n
+晚十点 3 n
+晚半天 3 t
+晚半天儿 3 n
+晚唐 95 t
+晚唐时期 3 n
+晚场 4 n
+晚境 3 n
+晚娘 3 n
+晚婚 38 n
+晚婚晚育 3 n
+晚婚者 3 n
+晚学 3 n
+晚安 24 n
+晚宴 93 n
+晚岁 3 t
+晚年 1036 t
+晚年时期 3 t
+晚年生活 3 n
+晚归 12 n
+晚恋 3 n
+晚报 312 n
+晚报社 3 n
+晚明 12 t
+晚春 10 t
+晚春时节 3 t
+晚景 24 n
+晚景凄凉 3 z
+晚晴 2 n
+晚暮 3 t
+晚期 1368 t
+晚来 3 t
+晚来一步 3 n
+晚汤 3 n
+晚清 328 t
+晚清时期 3 t
+晚潮 3 n
+晚点 50 n
+晚照 3 n
+晚熟 28 n
+晚熟作物 3 n
+晚熟性 3 n
+晚班 13 n
+晚生 176 n
+晚生代 3 t
+晚生后学 3 n
+晚疫病 9 n
+晚睡 3 v
+晚礼服 21 n
+晚祷 3 v
+晚福 3 n
+晚秋 28 t
+晚秋作物 3 n
+晚秋时节 3 t
+晚稻 21 n
+晚练 4 n
+晚育 13 n
+晚自习 10 n
+晚节 20 t
+晚节不保 3 n
+晚节不终 3 n
+晚节黄花 3 n
+晚装 9 n
+晚课 7 n
+晚起 11 v
+晚车 3 n
+晚辈 783 n
+晚近 3 t
+晚邮报 11 n
+晚醒 3 v
+晚钟 9 n
+晚间 261 t
+晚间新闻 3 n
+晚霜 4 n
+晚霞 129 n
+晚风 43 n
+晚风习习 3 n
+晚食当肉 3 n
+晚餐 271 n
+晚餐会 6 n
+晚餐饭 3 n
+晚饭 831 n
+晚饭时间 3 n
+晚香玉 4 n
+晛 3 zg
+晞 63 zg
+晟 52 g
+晠 42 zg
+晡 18 g
+晢 50 zg
+晣 33 zg
+晤 104 vg
+晤商 3 v
+晤对 3 v
+晤见 3 v
+晤谈 9 v
+晤谈甚欢 3 vn
+晤面 7 v
+晥 19 zg
+晦 269 z
+晦冥 3 a
+晦明 17 a
+晦暗 46 z
+晦朔 4 t
+晦气 240 an
+晦涩 55 a
+晦盲否塞 3 n
+晦聪禅师 3 n
+晦迹 3 n
+晦迹韬光 3 z
+晧 5 zg
+晨 459 zg
+晨会 52 n
+晨光 90 n
+晨光乍现 3 i
+晨光熹微 3 z
+晨兢夕厉 3 i
+晨兴夜寐 3 i
+晨参暮省 3 n
+晨参暮礼 3 i
+晨夕 11 t
+晨报 277 n
+晨报讯 3 n
+晨提夕命 3 i
+晨操 3 n
+晨早 3 t
+晨昏 49 t
+晨昏定省 2 i
+晨昏颠倒 3 i
+晨星 30 n
+晨晖 3 n
+晨曦 65 n
+晨曦社 3 vn
+晨曲 2 n
+晨炊 3 n
+晨炊星饭 3 nr
+晨祷 3 v
+晨秦暮楚 3 i
+晨练 29 n
+晨衣 3 n
+晨读 3 v
+晨课 3 n
+晨运 3 n
+晨钟 5 n
+晨钟暮鼓 3 i
+晨间 3 n
+晨间活动 3 n
+晨雾 37 n
+晨露 7 v
+晨风 44 n
+晨鸣 53 n
+晩 212 zg
+晪 2 zg
+晫 203 zg
+晬 5 zg
+晬面盎背 3 l
+普 1354 ad
+普三世 5 nr
+普世信 2 nz
+普世合 2 nr
+普世性 4 nr
+普中板 3 nr
+普丰德系 3 nr
+普乐 3 a
+普乐寺 3 nr
+普乐斯 6 nr
+普京 171 ns
+普京当 3 nr
+普什图 3 nrt
+普仁特 2 nr
+普代克 4 nz
+普件 3 n
+普伊格 3 nr
+普伐他汀 3 nz
+普伦斯克 3 nrt
+普伦斯克涅 6 nrt
+普光寺 8 nr
+普兰 13 nr
+普兰县 14 ns
+普兰娜 3 nr
+普兰店 4 nz
+普兰店市 6 ns
+普兰德 3 nr
+普兰诺 6 nr
+普列姆 8 nr
+普列托 2 nr
+普列文 2 nr
+普列斯 6 nr
+普列汉诺 3 nr
+普列茨克 3 nrt
+普列谢茨克 3 nrt
+普列高 2 nr
+普利 5 ad
+普利司 7 nr
+普利司通 3 nz
+普利尼 2 nr
+普利尼时 3 ns
+普利斯 8 nr
+普利河 2 ns
+普利瓦尔 4 nrt
+普利策 36 nr
+普利茅斯 17 nrt
+普利谢 3 nr
+普利马 3 ns
+普力奇 15 nr
+普力马 3 nr
+普加乔 12 nr
+普加乔夫 8 nrt
+普勒三 2 nr
+普勒著 12 nr
+普化天 3 nz
+普化尺 2 nr
+普华 4 nz
+普华永 33 nr
+普华永道 3 nr
+普卡普 3 nr
+普卢塔 4 nr
+普卢塔克 3 nrt
+普印本 3 nr
+普及 1282 ns
+普及化 7 nz
+普及型 8 nz
+普及性 11 nr
+普及教育 3 l
+普及本 2 ns
+普及版 3 nz
+普及率 73 nz
+普及读物 3 nz
+普及部 2 nt
+普及面 5 n
+普吉 45 nr
+普吉岛 34 nr
+普吕东 2 nr
+普吕克 9 nr
+普吕克尔 6 nrt
+普吕厄 3 nr
+普吕坦尼 16 nrt
+普告天下 3 i
+普善广 3 nr
+普四世 5 nr
+普图斯 3 nr
+普圣寺 256 nr
+普埃布拉 12 nrt
+普处 3 n
+普外科 14 nz
+普多夫 4 nrt
+普天 25 nz
+普天三洋 3 nz
+普天下 151 nr
+普天之下 188 i
+普天匝地 3 z
+普天同 2 nr
+普天同庆 20 nr
+普天忠 2 nr
+普天率土 3 nr
+普天王芝 3 nz
+普天间基地 6 nz
+普天间机场 7 n
+普契尼 15 nr
+普宁 11 nr
+普宁县 2 ns
+普宁寺 5 nr
+普宁市 3 ns
+普安 9 nz
+普安县 3 ns
+普安特 2 nr
+普定 3 a
+普定县 3 ns
+普定府 2 nr
+普实克 4 nz
+普寂禅 2 nr
+普密蓬 5 nr
+普尔 109 nr
+普尔曼 3 nr
+普尔顿 20 nr
+普布利 3 nr
+普希金 90 nr
+普度 9 n
+普度众生 3 nz
+普度群生 3 ns
+普建 3 a
+普快 2 a
+普恩加莱 4 nrt
+普恩塔 4 nr
+普惠制 15 nr
+普慧辅 3 nr
+普拉 20 nrt
+普拉东 2 nr
+普拉东诺夫 3 nrt
+普拉亚 9 ns
+普拉克 4 nr
+普拉兰 4 nr
+普拉卡什 5 nrt
+普拉固 2 nr
+普拉塔 4 nr
+普拉多 4 nrt
+普拉夫希奇 2 nrt
+普拉姆 2 nr
+普拉德 3 nr
+普拉德霍湾 5 ns
+普拉拉 4 nrt
+普拉提 3 nr
+普拉斯 10 nr
+普拉格 2 nr
+普拉梯 2 nr
+普拉河 3 ns
+普拉特 28 nrt
+普拉萨德 3 nrt
+普拉蒂 14 nr
+普拉蒂尼 3 nrt
+普拉西 8 ns
+普拉达 3 nr
+普拉霍 2 nr
+普拍枋 2 nr
+普救寺 11 nz
+普教 7 nz
+普敦和 2 nr
+普斯卡 3 nr
+普斯海洋 9 ns
+普斯科夫 7 nrt
+普施 2 n
+普施善 2 nr
+普普通通 224 nz
+普朗克 144 nr
+普朗坦 2 nr
+普朗特 18 nr
+普朗雄 5 nr
+普林史泰因 2 nrt
+普林尼 16 nr
+普林斯 80 nr
+普林斯顿 71 nrt
+普林斯顿大学 76 nt
+普林西 7 nr
+普林西普 3 nz
+普林西比 6 nrt
+普林西波 3 ns
+普查 2163 vn
+普查人员 3 n
+普查员 3 n
+普查局 5 nt
+普查表 3 nr
+普格 3 ad
+普格县 2 ns
+普梯洛 3 nr
+普氏 17 nr
+普沃克伦 3 nr
+普沃斯 3 nr
+普法 387 n
+普法尔茨 9 nrt
+普法教育 10 l
+普法网 3 nz
+普泰克 15 nr
+普洛斯 3 nr
+普洛耶什蒂 10 nrt
+普洱 44 ns
+普洱县 4 ns
+普洱哈尼族彝族自治县 2 ns
+普洱茶 45 n
+普测 3 vn
+普济众生 3 nz
+普济寺 9 nr
+普济桥 2 nr
+普济群生 3 nr
+普济院 2 nt
+普渡 18 nr
+普渡众生 19 nz
+普渡大学 3 nz
+普渡寺 2 nr
+普渡村 4 nr
+普渡河 7 nr
+普照 49 nr
+普照大地 3 nz
+普照寺 4 nr
+普特 57 nrt
+普特曼 12 nr
+普瑞尔 3 nr
+普瑞思 2 nr
+普瑞斯 2 nr
+普瓦 6 nrt
+普瓦图 3 nr
+普瓦捷 2 nr
+普瓦提 6 nr
+普瓦蒂埃 2 nrt
+普瓦雷 3 nr
+普科霍夫 2 nrt
+普立兹 3 nr
+普米 17 q
+普米族 29 nz
+普米语 4 nz
+普约尔 12 nr
+普罗 9 nrt
+普罗佩 2 nr
+普罗克 6 nr
+普罗列塔 3 nrt
+普罗塔 4 nr
+普罗塔哥 2 ns
+普罗夫迪夫 7 nrt
+普罗宁 3 nr
+普罗托 2 nr
+普罗提诺 3 nrt
+普罗文 4 nr
+普罗斯 5 nr
+普罗斯旺 5 nrt
+普罗斯特 4 nrt
+普罗旺斯 38 ns
+普罗普 2 nr
+普罗民 5 nr
+普罗泰 2 nr
+普罗泰戈 3 nrt
+普罗特 5 nr
+普罗科 7 nr
+普罗科菲耶夫 12 nrt
+普罗米 3 nr
+普罗米修斯 48 nz
+普罗维 3 nr
+普罗维杰 2 nr
+普罗维湾 3 ns
+普罗维登斯 10 nrt
+普罗维登西亚 2 ns
+普罗罗 2 nr
+普罗迪 17 nr
+普罗霍 2 nr
+普罗霍洛 5 nrt
+普罗霍罗夫 6 nrt
+普考 3 nr
+普考及格 3 nz
+普者黑 23 nr
+普腊亚 3 nz
+普芬多 6 nr
+普若卡 3 nr
+普药化 2 nz
+普莱克斯 3 nrt
+普莱尔 3 nr
+普莱斯 22 nr
+普莱斯利 10 nz
+普莱桑 3 nr
+普莱森 2 nr
+普莱特 3 nr
+普莱西 2 nr
+普莱诗 8 nr
+普莱诺 2 nr
+普莱雅斯 9 nrt
+普设仓 2 nr
+普调 3 nz
+普贤 26 nr
+普贤来 2 nr
+普贤行 4 nr
+普赖尔 5 nr
+普赖斯 6 nr
+普超英 3 nr
+普适常量 3 n
+普适性 8 n
+普选 109 v
+普选权 17 nr
+普通 6768 nz
+普通丝瓜 3 n
+普通中学 3 nt
+普通人 360 n
+普通人家 3 n
+普通住宅 3 n
+普通党员 3 n
+普通农民 3 n
+普通卡 3 nr
+普通发票 3 n
+普通员工 3 nt
+普通商品 3 n
+普通地图 3 nz
+普通型 23 n
+普通外科 3 nt
+普通家庭 3 nt
+普通小麦 3 nr
+普通工人 3 n
+普通干部 3 n
+普通店村 3 ns
+普通攻击 3 i
+普通教育 3 l
+普通本科 3 nt
+普通机 4 n
+普通法 59 n
+普通照会 3 n
+普通班 8 nr
+普通用户 3 n
+普通病 4 n
+普通百姓 3 n
+普通级 2 n
+普通纸 5 n
+普通群众 3 i
+普通考试 3 n
+普通职工 3 n
+普通股 80 n
+普通股本 3 n
+普通舱 4 n
+普通话 310 n
+普通车 3 n
+普通邮票 2 n
+普通高中 3 ns
+普通高校 3 nt
+普遍 5341 ad
+普遍事实 3 i
+普遍化 34 vn
+普遍如此 3 l
+普遍存在 3 i
+普遍性 209 n
+普遍意义 3 i
+普遍推广 3 i
+普遍推行 3 i
+普遍提高 3 i
+普遍深入 3 i
+普遍现象 3 n
+普遍真理 3 i
+普遍裁军 3 n
+普遍规律 3 l
+普遍认为 3 l
+普那草原 3 ns
+普里 57 nrt
+普里东 2 nr
+普里什蒂纳 4 nrt
+普里奇 5 nr
+普里斯 7 nrt
+普里斯特 3 nrt
+普里斯莱 3 nrt
+普里梅 2 nr
+普里特 16 nrt
+普里茜拉 3 nr
+普里茨 2 nrt
+普里莫 6 nrt
+普里莫拉茨 3 nrt
+普里马科夫 22 nrt
+普里高 2 nrt
+普金斯 2 nr
+普钙 2 nz
+普锐斯 3 nr
+普陀 81 nrt
+普陀区 13 ns
+普陀县 3 ns
+普陀山 63 ns
+普降 23 v
+普降喜雨 3 nr
+普降大雨 3 nr
+普降瑞雪 3 nr
+普降甘霖 3 nr
+普雷夫拉卡 2 nrt
+普雷奇 2 nr
+普雷斯 5 nr
+普雷斯利 2 nrt
+普雷斯帕 8 nrt
+普雷斯波 4 nrt
+普雷斯特 2 nrt
+普雷斯科特 3 nrt
+普雷斯顿 29 nrt
+普雷格尔 4 nrt
+普雷萨 3 nr
+普雷西 2 nr
+普顿郡 5 nr
+普颜笃 2 nr
+普高 15 a
+普鲁卡因 12 nrt
+普鲁土 5 nr
+普鲁塔克 2 nrt
+普鲁士 460 nr
+普鲁士人 3 nrt
+普鲁士王 3 nrt
+普鲁斯 9 nr
+普鲁斯特 16 nrt
+普鲁特 6 nr
+普鲁特河 10 ns
+景 1980 ng
+景一物 2 nr
+景东 3 ns
+景东彝族自治县 2 ns
+景两帝 2 nr
+景乃禾 3 nr
+景之世 2 nr
+景亦大 8 nr
+景仁宫 42 nr
+景仰 103 n
+景像 3 n
+景元 7 nz
+景入桑榆 3 nr
+景公死 2 nr
+景冈山 3 ns
+景况 74 n
+景区 1706 n
+景升之 2 nr
+景升豚犬 3 nr
+景华城 3 ns
+景县 22 ns
+景县东 2 nr
+景园 5 n
+景地 2 n
+景天 9 nr
+景天三七 3 nr
+景天科 6 nr
+景天酸 3 nz
+景宁 12 nr
+景宁畲族自治县 6 ns
+景宏岛 3 nr
+景宗乾 3 nr
+景宗建国 2 nr
+景宗新 2 nr
+景宗时 4 nr
+景宗李 22 nr
+景宗皇后 3 nr
+景宗耶 2 nr
+景宗进 2 nr
+景宗遂 2 nr
+景宗陵 2 nr
+景定 2 n
+景山 222 ns
+景山公园 2 ns
+景岗山 2 nr
+景岳全书 3 nr
+景州 3 ns
+景州塔 3 nr
+景州苏 2 ns
+景帝弟 3 nr
+景帝悉 2 nr
+景帝立 3 nr
+景帝遂 2 nr
+景府 2 n
+景延广 3 nr
+景德传 3 nr
+景德清 2 nr
+景德进士 2 nr
+景德镇 134 nr
+景德镇市 14 ns
+景德镇陶瓷学院 3 nr
+景慕 5 nr
+景房 2 n
+景才瑞 2 nr
+景教 8 nz
+景教僧 2 nr
+景教遂 2 nr
+景新城 2 nr
+景昌极 2 nr
+景明中 2 nr
+景星 6 nz
+景星凤皇 3 nr
+景星庆云 3 nr
+景星麟凤 3 nr
+景春之 2 nr
+景气 167 n
+景气停滞 3 n
+景气衰退 3 n
+景泰 88 nz
+景泰县 4 ns
+景泰蓝 39 nr
+景洪 16 nr
+景洪县 5 nr
+景洪市 5 ns
+景海鹏 2 nr
+景深 9 nr
+景炎 12 n
+景点 2436 n
+景片 3 n
+景物 302 n
+景物依旧 3 ns
+景状 3 n
+景献羊 2 nr
+景王死 2 nr
+景田西 3 nr
+景福宫 8 nr
+景美 3 nz
+景美军 2 nr
+景美区 3 ns
+景美溪 3 nr
+景致 299 a
+景色 758 n
+景色宜人 3 nr
+景芝 3 nz
+景行 3 n
+景补子 2 nr
+景观 1818 n
+景观圈 3 n
+景观学 3 n
+景观带 15 n
+景观损害 3 n
+景观灯 3 n
+景观石 3 nr
+景观规划 3 n
+景观设计 3 n
+景谷 4 n
+景谷傣族彝族自治县 3 ns
+景谷林业 2 nz
+景象 1219 n
+景遇 3 n
+景阳 4 ns
+景阳冈 30 ns
+景阳宫 4 nr
+景阳岗 5 nr
+景阳钟 2 nr
+景颇 50 nz
+景颇族 54 nz
+景龙间 2 n
+晰 20 g
+晰毛辨发 3 n
+晱 12 zg
+晳 18 zg
+晴 916 v
+晴云秋月 3 i
+晴儿 3 n
+晴到多云 19 l
+晴到少云 3 l
+晴和 35 nz
+晴天 230 nz
+晴天霹雳 65 i
+晴好 31 a
+晴岚 3 nrt
+晴川 3 nz
+晴日 3 nz
+晴时多云 3 nz
+晴明 15 nz
+晴朗 180 a
+晴朗朗 2 nz
+晴毛 3 n
+晴画 3 n
+晴空 73 nz
+晴空万里 26 i
+晴空如洗 3 i
+晴纶 3 nz
+晴转多云 8 i
+晴转阴 3 l
+晴间多云 9 nz
+晴隆 2 nz
+晴隆县 3 ns
+晴雨伞 3 nz
+晴雨表 36 n
+晴雨计 3 i
+晴雯 333 nz
+晶 590 n
+晶亮 39 a
+晶体 1737 n
+晶体化学 3 n
+晶体学 23 n
+晶体振荡 3 i
+晶体振荡器 6 l
+晶体点阵 5 n
+晶体生长 3 n
+晶体管 312 n
+晶体结构 3 n
+晶体缺陷 3 n
+晶体群 3 n
+晶体蛋白 3 l
+晶光铮亮 3 l
+晶内偏析 3 l
+晶圆厂 2 n
+晶形 49 n
+晶形沉淀 3 l
+晶态 24 n
+晶报 3 n
+晶报讯 3 nz
+晶晶 3 n
+晶晶亮 2 n
+晶核 3 n
+晶格 86 n
+晶格点 3 n
+晶格能 3 n
+晶棱 3 n
+晶洁 3 a
+晶片 31 n
+晶片组 3 n
+晶状 3 n
+晶状体 96 n
+晶珠 3 n
+晶界 8 n
+晶癖 3 n
+晶石 407 n
+晶粒 50 n
+晶粒大小 3 n
+晶系 148 n
+晶美 3 nz
+晶胞 25 n
+晶胞参数 3 n
+晶莹 309 a
+晶莹剔透 38 i
+晶莹雪 3 i
+晶轴 3 n
+晶间腐蚀 3 nz
+晶闸管 61 n
+晶面 3 n
+晶须 11 n
+晷 46 g
+晹 3 zg
+智 3359 ng
+智一桐 3 nr
+智不仁 2 nr
+智亭山 93 nr
+智人 3 n
+智仁亲王 2 nr
+智仁勇 3 nr
+智伯渠 3 nr
+智伯瑶 17 nr
+智光 45 n
+智光之 2 nr
+智光叹 2 nr
+智光大师 25 nr
+智光禅师 3 nr
+智光续 6 nr
+智分舵 3 n
+智利 570 ns
+智利人 7 n
+智利共和国 4 ns
+智利政府 9 nt
+智利硝 3 n
+智利草莓 3 n
+智利队 35 n
+智力 931 n
+智力因素 3 nr
+智力型 3 n
+智力年龄 3 n
+智力库 3 nr
+智力开发 3 nr
+智力技能 3 n
+智力投资 3 n
+智力活动 3 n
+智力测验 3 n
+智力竞赛 3 nr
+智力题 3 n
+智勇 23 nr
+智勇之 4 nr
+智勇兼全 2 i
+智勇兼备 3 nr
+智勇双全 44 nr
+智勇足 7 nr
+智化寺 12 nr
+智取 89 v
+智名勇功 3 nr
+智周万物 3 n
+智和禅师 5 nr
+智商 316 n
+智商测验 3 n
+智善寺 2 nr
+智囊 57 n
+智囊团 21 n
+智圆行方 3 n
+智士 4 n
+智多星 25 nr
+智威汤逊 4 nr
+智子 3 n
+智子疑邻 3 n
+智字密 2 n
+智寺 13 ns
+智尊宝 3 nr
+智小言大 3 i
+智小谋大 3 nr
+智尽能索 3 nr
+智岛南 2 ns
+智巧 3 n
+智库 7 n
+智库凯 2 nr
+智微微 9 nr
+智性 3 n
+智愚 5 nr
+智愚贤 2 nr
+智慧 1581 nr
+智慧之门 3 nr
+智慧型 3 nr
+智慧板 3 nr
+智慧棒 3 nr
+智慧结晶 3 nr
+智慧网 3 nr
+智慧财产 3 nr
+智摇摇 3 nr
+智擒鳌 3 nr
+智斗 6 n
+智昏菽麦 3 nr
+智有勇 6 nr
+智有谋 2 nr
+智术 4 n
+智残人 2 n
+智深勇 4 nr
+智深正 3 nr
+智深笑 2 nr
+智深见 3 nr
+智深醉 2 nr
+智清禅师 3 nr
+智渊寺 7 nr
+智灌顶 2 nr
+智点点 3 n
+智牙 3 ns
+智珠 4 n
+智略 8 n
+智相斗 2 nr
+智真长老 23 nr
+智社 2 n
+智神星 2 nr
+智禅师 23 nr
+智穷力 3 n
+智穷才尽 3 i
+智者 142 n
+智者乐水 3 n
+智者千虑 6 i
+智者见智 24 nr
+智联 39 ns
+智育 39 n
+智胜 4 nr
+智能 778 n
+智能不足 3 i
+智能五笔 3 n
+智能仪表 3 n
+智能化 119 nr
+智能卡 15 nr
+智能圈 3 n
+智能型 13 n
+智能家居 3 nr
+智能工具 3 n
+智能建筑 3 n
+智能性 4 n
+智能手机 3 n
+智能拼音 3 n
+智能整句 3 n
+智能机 16 n
+智能武器 5 n
+智能水表 3 n
+智能流行 3 n
+智能狂拼 3 nr
+智能科学 3 nt
+智能算法 3 n
+智能网 22 n
+智能陈桥 3 nr
+智藏 3 ns
+智藏瘝在 3 v
+智虑 83 v
+智计 5 n
+智计绝 2 i
+智识 26 n
+智识份子 3 n
+智识分子 3 n
+智识阶级 3 n
+智谋 123 n
+智贵免祸 3 i
+智软选 7 nr
+智通 2 n
+智障 5 n
+智障女 3 n
+智障者 3 n
+智顺王 3 nr
+智齿 12 n
+智龄 2 n
+晻 2 zg
+晽 16 zg
+晾 272 zg
+晾凉 3 v
+晾台 3 v
+晾完 3 v
+晾干 44 v
+晾晒 43 v
+晾晾看 3 v
+晾着 3 v
+晾衣 3 v
+晾衣服 3 n
+晾衣杆 2 n
+晾衣架 3 n
+晾衣绳 3 n
+晿 2 zg
+暀 107 zg
+暁 7 zg
+暂 1406 d
+暂不 3 d
+暂且 517 d
+暂且不说 3 v
+暂为 3 d
+暂予 3 v
+暂于 3 d
+暂付 3 v
+暂代 3 v
+暂以 3 d
+暂任 3 b
+暂住 56 v
+暂住地 5 n
+暂住证 26 v
+暂作 3 v
+暂依 3 v
+暂候 3 d
+暂借 3 v
+暂停 569 d
+暂停比赛 3 n
+暂停状态 3 n
+暂停营业 3 n
+暂停钮 3 n
+暂免 3 d
+暂减 3 v
+暂别 3 d
+暂劳永逸 3 z
+暂升 3 v
+暂名 3 v
+暂告 3 v
+暂垫 3 n
+暂基托 3 n
+暂存 3 v
+暂存体 3 b
+暂存区 3 n
+暂存器 3 n
+暂存处 2 n
+暂定 42 d
+暂定为 3 d
+暂定名 8 n
+暂封材料 3 n
+暂居 3 v
+暂延 3 v
+暂开 3 v
+暂得 3 d
+暂态 3 n
+暂态过程 3 n
+暂态运动 3 n
+暂扣 3 v
+暂按 3 n
+暂收 3 v
+暂收条 3 n
+暂收款 3 n
+暂放 3 v
+暂无 3 v
+暂时 2763 d
+暂时中止 3 n
+暂时充填 3 v
+暂时性 78 b
+暂时电话 3 n
+暂星 3 d
+暂欠 3 v
+暂歇 3 v
+暂测 3 v
+暂用 8 b
+暂由 3 d
+暂留 3 v
+暂睡 3 v
+暂短 3 v
+暂离 3 v
+暂约 3 d
+暂缓 139 d
+暂缓实行 3 n
+暂缓执行 3 n
+暂缺 2 v
+暂行 307 v
+暂行办法 3 n
+暂行条例 3 n
+暂行规定 3 b
+暂订 3 v
+暂记 3 v
+暂调 3 v
+暂赢 3 v
+暂跑 3 v
+暂降 3 v
+暂领 3 v
+暃 4 zg
+暄 40 zg
+暅 52 zg
+暆 4 zg
+暇 305 g
+暇接 3 l
+暇日 3 l
+暇时 3 l
+暋 2 zg
+暌 31 vg
+暌违 12 v
+暍 91 zg
+暎 22 zg
+暐 60 zg
+暑 141 t
+暑修 3 n
+暑修班 3 n
+暑假 237 t
+暑假作业 3 n
+暑天 12 t
+暑往寒来 3 nz
+暑期 136 t
+暑期班 3 n
+暑期社会 3 n
+暑期部 3 n
+暑气 29 n
+暑气逼人 3 vn
+暑湿痹 3 n
+暑热 35 n
+暑瘟 3 n
+暑训 3 n
+暑训班 3 n
+暑运 2 n
+暑雨祁寒 3 vn
+暒 41 zg
+暖 5727 a
+暖乎乎 3 z
+暖人心房 3 n
+暖冬 19 n
+暖呼呼 3 z
+暖和 307 a
+暖壶 20 n
+暖壼 3 z
+暖室 3 n
+暖寿 3 n
+暖峰 3 n
+暖帽 10 n
+暖情 3 n
+暖意 79 n
+暖房 16 n
+暖手 3 n
+暖暖和和 15 nz
+暖暖地 5 z
+暖暖的 206 z
+暖棚 7 n
+暖棚栽培 3 vn
+暖气 127 n
+暖气包 3 n
+暖气团 23 n
+暖气机 3 n
+暖气片 5 n
+暖气罩 3 n
+暖气费 2 n
+暖水 23 n
+暖水壶 3 n
+暖水瓶 9 n
+暖水袋 3 n
+暖洋洋 59 z
+暖流 311 n
+暖温带 3 n
+暖湿 32 a
+暖湿气流 40 n
+暖溶溶 3 nz
+暖火 3 n
+暖炉 9 n
+暖烘烘 49 z
+暖煦煦 3 z
+暖瓶 32 n
+暖种 3 n
+暖空气 5 n
+暖肚 3 n
+暖脚器 3 n
+暖色 13 n
+暖色调 5 n
+暖融融 22 n
+暖衣饱食 3 n
+暖袖 3 n
+暖通 2 n
+暖通设计 3 n
+暖酒 3 n
+暖锅 3 n
+暖锋 12 n
+暖阁 197 n
+暖风 21 n
+暖风机 3 n
+暗 3348 d
+暗中 1565 d
+暗中作怪 3 i
+暗中帮助 3 n
+暗中摸索 4 i
+暗中相助 3 i
+暗中行事 3 n
+暗事 3 n
+暗亏 3 d
+暗伤 7 v
+暗光 11 n
+暗函 3 n
+暗匣 3 n
+暗反应 3 n
+暗叫 3 v
+暗叫一声 3 i
+暗号 115 n
+暗号灯 3 n
+暗合 58 v
+暗含 32 v
+暗哨 10 n
+暗喜 167 v
+暗喻 14 n
+暗器 1031 n
+暗地 94 n
+暗地里 157 s
+暗场 3 n
+暗坝 3 n
+暗堡 11 n
+暗处 121 d
+暗夜精灵 3 i
+暗夜里 3 i
+暗娼 17 v
+暗室 41 n
+暗室不欺 3 i
+暗室亏心 3 i
+暗室屋漏 3 i
+暗室欺心 3 i
+暗室求物 3 i
+暗室私心 3 i
+暗室逢灯 3 i
+暗害 39 v
+暗射地图 3 n
+暗屋 3 n
+暗巷 3 n
+暗底下 3 s
+暗度金针 3 n
+暗度陈仓 5 i
+暗弱 22 a
+暗弱无断 3 i
+暗影 74 n
+暗得 3 v
+暗念 3 n
+暗恋 39 v
+暗恋着 3 v
+暗想 533 n
+暗房 12 n
+暗扣 15 n
+暗抓 3 v
+暗指 3 n
+暗挖 7 v
+暗探 27 v
+暗操贱业 3 i
+暗斗 3 vn
+暗斗明争 3 n
+暗无天日 37 i
+暗星云 15 n
+暗昧 2 a
+暗昧之事 3 i
+暗暗 2156 d
+暗暗淡淡 3 n
+暗机关 3 n
+暗杀 239 v
+暗杀党 3 n
+暗查 2 vn
+暗格 10 n
+暗殿 3 n
+暗沈沈 3 ns
+暗沉沉 16 z
+暗沟 7 n
+暗河 81 n
+暗泣 3 v
+暗流 69 n
+暗淡 238 a
+暗淡无光 15 i
+暗淡淡 3 z
+暗渠 6 n
+暗渡陈仓 19 i
+暗滩 13 n
+暗潮 5 n
+暗潮汹涌 3 i
+暗火 6 n
+暗灰 12 n
+暗点 3 d
+暗然 3 d
+暗然失色 3 i
+暗然销魂 3 n
+暗物质 20 n
+暗电流 3 n
+暗疮 14 n
+暗疮印 3 i
+暗疾 5 n
+暗病 3 n
+暗盒 3 n
+暗盘 3 n
+暗盼 3 v
+暗码 3 d
+暗礁 70 n
+暗礁险滩 3 nz
+暗示 808 v
+暗示性 22 n
+暗示疗法 5 n
+暗示着 3 n
+暗移 3 v
+暗笑 135 v
+暗笑一声 3 i
+暗算 341 v
+暗算着 3 v
+暗管 3 n
+暗箭 40 n
+暗箭中人 3 n
+暗箭伤人 21 n
+暗箭明枪 3 n
+暗箭难防 3 i
+暗箱 28 n
+暗紫色 15 n
+暗红 70 b
+暗红色 115 n
+暗线 28 n
+暗练 3 vn
+暗细菌 3 n
+暗绿 14 b
+暗绿稀红 3 z
+暗绿色 29 n
+暗股 3 n
+暗自 650 d
+暗自流泪 3 i
+暗自神伤 3 i
+暗舱 3 n
+暗色 89 n
+暗色彩 3 n
+暗花 7 n
+暗蓝色 6 n
+暗藏 237 v
+暗藏春色 3 i
+暗藏杀机 3 n
+暗藏玄机 3 i
+暗藏鬼胎 3 n
+暗补 3 v
+暗袋 2 n
+暗褐 3 n
+暗褐色 3 n
+暗视场 3 n
+暗视蛋白 3 n
+暗视野 3 n
+暗计 3 v
+暗记 17 n
+暗记在心 3 n
+暗许 3 d
+暗讽 3 v
+暗访 40 v
+暗话 3 n
+暗语 70 n
+暗转 2 v
+暗边 3 d
+暗送 3 v
+暗送秋波 9 i
+暗适应 3 n
+暗通 3 n
+暗通款曲 3 n
+暗道 312 v
+暗里 56 s
+暗销 3 v
+暗锁 3 v
+暗锤打人 3 i
+暗门 39 d
+暗问 3 v
+暗香 26 n
+暗香疏影 7 i
+暗骂 3 v
+暗黑 43 v
+暗黝 3 z
+暘 22 zg
+暚 24 zg
+暝 23 zg
+暟 45 zg
+暠 38 zg
+暡 20 zg
+暢 2 zg
+暣 54 zg
+暧 26 zg
+暧昧 163 a
+暧昧不明 3 i
+暧昧之情 3 i
+暧昧关系 13 n
+暧昧行为 3 i
+暨 462 nt
+暨世界 3 nr
+暨南 6 ns
+暨南大学 60 nt
+暨大 9 j
+暨徽 2 ns
+暨首届 3 nt
+暩 4 zg
+暬 3 zg
+暭 5 zg
+暮 822 tg
+暮云 4 n
+暮云春树 3 i
+暮住 3 l
+暮去朝来 3 l
+暮四朝三 3 i
+暮境 3 n
+暮夜先容 3 i
+暮夜怀金 3 l
+暮夜无知 3 i
+暮存 3 n
+暮岁 3 n
+暮年 49 t
+暮想朝思 3 l
+暮日 3 t
+暮春 37 t
+暮景 3 n
+暮景桑榆 3 i
+暮景残光 3 n
+暮楚朝秦 3 i
+暮气 25 n
+暮气沉沉 8 i
+暮氧沉沉 3 z
+暮爨朝舂 3 nr
+暮生 3 n
+暮生儿 3 n
+暮礼晨参 3 i
+暮秋 6 t
+暮翠朝红 3 l
+暮色 242 n
+暮色四合 7 i
+暮色朦胧 3 z
+暮色苍茫 35 l
+暮艾 3 n
+暮节 3 t
+暮虢朝虞 3 ns
+暮量化 3 n
+暮雨朝云 3 i
+暮霭 47 n
+暮鸦 3 n
+暮鼓 3 n
+暮鼓晨钟 9 i
+暮鼓朝钟 3 i
+暮龄 3 n
+暱 679 zg
+暲 92 zg
+暴 742 n
+暴举 3 v
+暴乱 149 v
+暴光 10 n
+暴内陵外 3 n
+暴利 115 n
+暴利税 3 n
+暴利行业 3 n
+暴制暴 3 n
+暴力 1005 n
+暴力事件 3 n
+暴力化 2 n
+暴力团 21 n
+暴力性 4 n
+暴力手段 3 n
+暴力片 2 n
+暴力犯罪 3 i
+暴力破解 3 i
+暴力行为 3 n
+暴力行动 3 n
+暴力革命 3 l
+暴动 638 v
+暴卒 10 n
+暴厉 2 a
+暴发 101 v
+暴发出来 3 l
+暴发力 3 n
+暴发型 4 n
+暴发性 10 n
+暴发户 99 n
+暴发洪水 3 nr
+暴取豪夺 3 i
+暴吏 3 n
+暴君 147 nr
+暴土 4 n
+暴增 5 v
+暴安民 2 nr
+暴客 5 n
+暴富 64 a
+暴尸 3 n
+暴库 3 n
+暴弃 16 v
+暴徒 242 n
+暴徙 3 n
+暴怒 102 v
+暴怒之下 3 i
+暴慢 3 a
+暴成性 2 n
+暴戾 123 a
+暴戾之气 3 v
+暴戾成性 3 v
+暴打 3 v
+暴投 3 v
+暴收 3 v
+暴政 116 n
+暴救民 3 nr
+暴敛 23 v
+暴敛横征 3 nr
+暴晒 53 v
+暴横 2 v
+暴死 2 v
+暴殄天物 12 i
+暴毙 23 v
+暴民 13 n
+暴沸 3 v
+暴洪 3 nr
+暴流 2 n
+暴涨 164 v
+暴涨暴跌 3 l
+暴溢 2 v
+暴烈 50 a
+暴热 3 v
+暴燥 4 a
+暴燥如雷 3 i
+暴牙 3 nr
+暴率 3 n
+暴珍天 5 nr
+暴疾 3 n
+暴病 31 n
+暴盲 5 n
+暴禁非 2 nr
+暴突 3 vn
+暴笑 3 v
+暴纱亭 12 nr
+暴胀 13 v
+暴脾气 3 v
+暴腮龙门 3 nr
+暴落 13 v
+暴虎冯河 3 nr
+暴虎凭河 3 nr
+暴虐 156 v
+暴虐无道 4 l
+暴行 438 v
+暴衣露冠 3 i
+暴衣露盖 3 nr
+暴走 3 v
+暴走族 3 n
+暴走鞋 3 n
+暴起 4 v
+暴起伤 4 v
+暴起发 3 v
+暴跌 69 v
+暴跳 26 v
+暴跳如雷 95 i
+暴躁 241 a
+暴躁如雷 3 nr
+暴过度 2 n
+暴雨 558 n
+暴雨如注 6 i
+暴雨径流 3 i
+暴雨成灾 3 i
+暴雪 21 n
+暴雷 21 nr
+暴雷价 3 n
+暴露 1281 v
+暴露出 3 i
+暴露文学 3 l
+暴露无遗 87 i
+暴露狂 3 i
+暴露目标 3 l
+暴风 81 n
+暴风半径 3 i
+暴风圈 3 n
+暴风城 3 nr
+暴风疾雨 3 i
+暴风雨 177 nr
+暴风雪 93 nr
+暴风骤雨 74 i
+暴食 2 n
+暴食暴饮 3 i
+暴饮暴食 35 i
+暴马子 3 nr
+暴骨 3 n
+暵 2 zg
+暸 7 zg
+暸解 3 vn
+暹 57 ns
+暹粒 21 ns
+暹罗 89 ns
+暹罗人 3 ns
+暹罗湾 5 ns
+暻 6 zg
+暾 28 g
+暿 3 zg
+曁 2 zg
+曂 6 zg
+曆 8 zg
+曌 10 zg
+曌明空 3 z
+曍 3 zg
+曎 2 zg
+曓 3 zg
+曖 4 zg
+曗 11 zg
+曘 58 zg
+曙 337 n
+曙光 456 nz
+曙光乍现 3 z
+曙光初上 3 n
+曙光路 3 nz
+曙后星孤 3 n
+曙暮光 3 n
+曙曦 3 n
+曙目 3 n
+曙色 29 n
+曚 148 zg
+曚曚曨曨 3 z
+曚曨 3 z
+曛 36 g
+曜 97 zg
+曝 70 zg
+曝书见竹 3 n
+曝光 423 nz
+曝光栏 3 n
+曝光率 15 nz
+曝光表 3 nz
+曝光计 3 nz
+曝晒 42 v
+曝气 2 v
+曝气器 3 nz
+曝气池 3 n
+曝献 3 v
+曝背食芹 3 n
+曝衣 3 v
+曝露 9 v
+曝露出 3 v
+曝骨履肠 3 n
+曞 225 zg
+曟 158 zg
+曠 144 zg
+曡 110 zg
+曢 52 zg
+曤 2 zg
+曦 169 nr
+曧 6 zg
+曨 3 zg
+曩 20 g
+曪 106 zg
+曫 2 zg
+曮 2 zg
+曯 10 zg
+曰 10675 zg
+曱甴 3 z
+曲 2857 q
+曲不离口 2 i
+曲世聪 3 nr
+曲东 3 ns
+曲为直说 3 l
+曲乐恒 3 nr
+曲体 3 n
+曲傻姑 3 nr
+曲儿忒 2 nr
+曲凤来 108 nr
+曲利 4 ns
+曲别针 3 n
+曲剧 6 n
+曲北林 11 nr
+曲南男 2 nr
+曲发深 2 nr
+曲台殿 2 nr
+曲名 3 a
+曲周 4 nr
+曲周县 2 nr
+曲国强 3 nr
+曲圣卿 4 nr
+曲坛 7 n
+曲声 2 n
+曲大哥 10 nr
+曲奇 3 nr
+曲奇饼 3 nr
+曲女城 10 nr
+曲子 333 n
+曲学 3 n
+曲学诐行 3 v
+曲学阿世 3 nr
+曲室 3 n
+曲射炮 2 n
+曲小宅 2 nr
+曲小管 11 nr
+曲尺 15 nr
+曲尺形 9 n
+曲尺楼梯 3 n
+曲尽人意 3 i
+曲尽其妙 10 i
+曲差 3 n
+曲府 42 n
+曲度 10 n
+曲式 28 n
+曲张 14 a
+曲形木 2 nr
+曲径 20 n
+曲径通幽 23 i
+曲律 14 n
+曲志红 3 nr
+曲忠东 2 nr
+曲意 8 n
+曲意奉 2 nr
+曲意奉承 6 i
+曲意奉迎 3 i
+曲意承迎 3 nr
+曲意迎合 3 nr
+曲意逢迎 5 i
+曲成义 5 nr
+曲成团 2 n
+曲扭 3 a
+曲折 1393 a
+曲折前进 3 i
+曲折性 4 n
+曲折离奇 3 i
+曲折重重 3 z
+曲文勇 2 nr
+曲文宝玉 2 nr
+曲新久 2 nr
+曲日东 3 ns
+曲星君 2 nr
+曲晓东 4 nr
+曲曲 31 n
+曲曲弯弯 10 z
+曲曲弯弯的 8 z
+曲曲折 3 z
+曲曲折折 59 z
+曲本 3 ns
+曲松 4 a
+曲松县 3 ns
+曲松钠 3 nr
+曲柄 33 n
+曲校录 2 nr
+曲桑寺 3 nr
+曲桑拉 3 nr
+曲棍 2 n
+曲棍球 64 n
+曲棍球员 3 n
+曲棍球赛 3 n
+曲楠男 2 nr
+曲榭 2 ns
+曲歌辞 3 nr
+曲比 3 n
+曲水 17 n
+曲水县 8 ns
+曲水流觞 3 n
+曲江 49 ns
+曲江县 9 ns
+曲池 31 n
+曲池合 2 nr
+曲沃 14 a
+曲沃县 4 ns
+曲河 7 ns
+曲洋 52 ns
+曲洋叹 2 nr
+曲洋曲 3 n
+曲洋笑 2 nr
+曲流 2 n
+曲流馆 20 n
+曲温雅 2 nr
+曲灵风 20 nr
+曲牌 132 n
+曲率 116 n
+曲目 257 n
+曲直 65 nr
+曲眉丰颊 3 n
+曲种 3 n
+曲突徙薪 2 i
+曲突移薪 3 i
+曲端 4 n
+曲笔 5 n
+曲笛 6 nr
+曲红楼 2 nr
+曲纹 3 n
+曲线 970 n
+曲线图 14 n
+曲线形 3 n
+曲线拟合 11 n
+曲线救国 3 n
+曲线板 3 n
+曲线网格 3 n
+曲线美 130 nr
+曲线运动 3 l
+曲细精 5 n
+曲终 11 nr
+曲终人散 8 i
+曲终奏雅 3 n
+曲绕 3 nr
+曲羽衣 3 nr
+曲者 4 n
+曲肱为枕 3 n
+曲肱而枕 3 n
+曲背 3 n
+曲膝礼 3 i
+曲膝者 3 i
+曲臂 3 n
+曲艺 264 n
+曲艺团 25 n
+曲艺家 2 n
+曲艺界 6 n
+曲苑杂谈 3 n
+曲菌 4 n
+曲解 52 n
+曲警芳 2 nr
+曲词儿 2 nr
+曲词宾 2 nr
+曲调 420 n
+曲谱 83 n
+曲贝藏 2 nr
+曲轴 26 n
+曲轴箱 4 n
+曲辞 2 n
+曲逆侯 2 nr
+曲酒 278 n
+曲里拐弯 5 nr
+曲长老 8 nr
+曲长鸣 2 nr
+曲阜 129 ns
+曲阜县 3 ns
+曲阜市 20 ns
+曲阜师范大学 3 l
+曲阳 44 ns
+曲阳县 14 ns
+曲阳路 3 ns
+曲陆武 2 nr
+曲院风 5 nr
+曲集 15 n
+曲霉 52 a
+曲霉菌 4 n
+曲靖 58 nr
+曲靖市 12 ns
+曲非 3 ns
+曲非烟 66 nr
+曲面 268 n
+曲面光顺 3 nr
+曲面插值 3 l
+曲面模型 3 n
+曲颈 3 n
+曲颈瓶 3 n
+曲风 13 n
+曲风来 2 nr
+曲风道 3 nr
+曲香 3 nr
+曲骨 3 n
+曲高和寡 15 n
+曲鬓 3 n
+曲鸣丽 2 nr
+曲麻莱 2 nr
+曲麻莱县 10 ns
+曳 174 n
+曳光 9 n
+曳光弹 43 n
+曳兵之计 3 nz
+曳兵弃甲 3 n
+曳尾泥涂 3 n
+曳尾涂中 3 n
+曳引效应 3 n
+曳引机 3 n
+曳影 3 n
+曳裾王门 3 nz
+更 56478 d
+更上一层 3 l
+更上一层楼 63 i
+更上层楼 11 i
+更丑 3 v
+更为 2922 d
+更为严重 3 i
+更为理想 3 i
+更为重要 3 l
+更事 3 v
+更仆难尽 3 i
+更仆难数 3 i
+更仆难终 3 i
+更令明号 3 n
+更以 3 d
+更优 3 d
+更优越 3 v
+更何况 433 l
+更佳 3 v
+更便 3 d
+更其 19 d
+更具 213 v
+更再 3 d
+更凉 3 a
+更加 8824 d
+更动 16 d
+更动表 3 l
+更合 3 v
+更名 1996 v
+更名改姓 4 l
+更唱叠和 3 i
+更唱迭和 3 l
+更声 3 d
+更多 2 d
+更多更好 3 l
+更夫 12 n
+更好 2461 d
+更妙 3 a
+更始 61 v
+更始帝 16 nr
+更姓改物 3 i
+更定 3 d
+更少 3 d
+更已 3 d
+更年期 153 t
+更弦改辙 3 i
+更弦易辙 3 i
+更弱 3 v
+更当 3 d
+更待何时 3 l
+更待干罢 3 nr
+更很好 3 nr
+更忙 3 d
+更快 3 d
+更怕 3 d
+更惨 3 a
+更慢 3 d
+更戛乡 3 n
+更换 845 v
+更换器 3 l
+更换理论 3 l
+更换费用 3 l
+更改 433 v
+更改者 3 l
+更新 3789 d
+更新世 3 l
+更新包 3 l
+更新快 3 l
+更新换代 83 l
+更新改造 3 l
+更新期 3 n
+更新版 3 l
+更新过程 3 l
+更早 3 d
+更易 3 d
+更是 5290 d
+更是如此 3 l
+更晚 3 d
+更替 295 v
+更有意义 3 l
+更有甚者 81 c
+更次 3 d
+更正 98 d
+更深 304 d
+更深一层 3 l
+更深人静 5 l
+更深夜静 3 l
+更添 3 v
+更漏 3 v
+更灵 3 v
+更爽 3 a
+更生 30 v
+更番 3 d
+更直 3 d
+更移 3 v
+更稳 3 a
+更糟 3 n
+更紧 3 d
+更累 3 v
+更者 3 c
+更胜一筹 36 i
+更臻 3 v
+更衣 81 v
+更衣室 48 n
+更衣柜 3 i
+更衣间 3 n
+更让人 3 n
+更该 3 v
+更说是 3 l
+更豉 3 n
+更趋 3 d
+更轻 3 d
+更进一步 186 l
+更进一竿 3 i
+更远 3 d
+更迭 369 d
+更适宜 3 i
+更酷 3 a
+更长梦短 3 i
+更阑 3 v
+更阑人静 3 i
+更难仆数 3 i
+更须 3 d
+更鼓 29 v
+曶 22 zg
+曷 51 g
+書 55 zg
+曹 2167 nr
+曹丕 226 nr
+曹丕之 4 nr
+曹丕代 13 nr
+曹丕听 2 nr
+曹丕大 4 nr
+曹丕封 6 nr
+曹丕才 2 nr
+曹丕时 2 nr
+曹丕献 2 nr
+曹丕自 2 nr
+曹丕问 2 nr
+曹丕闻 3 nr
+曹世表 2 nr
+曹世雄 2 nr
+曹东哲 2 nr
+曹丞相 19 nr
+曹两营 11 nr
+曹义勇 2 nr
+曹之策 3 nr
+曹之计 2 nr
+曹书佐 2 nr
+曹二营 5 nr
+曹云奇 225 nr
+曹仁令 2 nr
+曹仁先 2 nr
+曹仁军 2 nr
+曹仁大 5 nr
+曹仁守 4 nr
+曹仁引 9 nr
+曹仁必 3 nr
+曹仁知 2 nr
+曹仁自 4 nr
+曹仁行 2 nr
+曹仁部 2 nr
+曹仁领 4 nr
+曹代英 6 nr
+曹仲达 2 nr
+曹任西 2 nr
+曹休寨 2 nr
+曹会渠 3 nr
+曹传信 2 nr
+曹伯纯 3 nr
+曹伴伴 4 nr
+曹侍郎 2 nr
+曹俊臣 2 nr
+曹元锦 3 nr
+曹光哲 3 nr
+曹光彪 2 nr
+曹克明 3 nr
+曹全碑 3 nr
+曹公公 11 nr
+曹公兵 3 nr
+曹公知 2 nr
+曹兵势 5 nr
+曹兵围 2 nr
+曹兵败 2 nr
+曹兵远 2 nr
+曹兵齐 2 nr
+曹其军 2 nr
+曹典奇 2 nr
+曹军入 2 nr
+曹军势 2 nr
+曹军寨 2 nr
+曹军新 2 nr
+曹军水 3 nr
+曹军皆 3 nr
+曹军远 2 nr
+曹军遂 4 nr
+曹军飞 2 nr
+曹冲 4 nr
+曹冲称象 3 nr
+曹刚川 75 nr
+曹前前 10 nr
+曹剑杰 2 nr
+曹化淳 262 nr
+曹卫宇 3 nr
+曹卫萍 2 nr
+曹参军 2 nr
+曹又尹 8 nr
+曹变蚊 3 nr
+曹变蛟 93 nr
+曹可凡 3 nr
+曹司兵 2 nr
+曹司朋 33 nr
+曹吉祥 65 nr
+曹国伟 77 nr
+曹国俊 3 nr
+曹国公 3 nr
+曹国王 2 nr
+曹国舅 4 nr
+曹培昌 3 nr
+曹大人 6 nr
+曹大元 4 nr
+曹大军 25 nr
+曹大哥 2 nr
+曹大夫 3 nr
+曹天钦 2 nr
+曹天风 2 nr
+曹太公 15 nr
+曹太监 13 nr
+曹妃甸 3 nrfg
+曹娥江 18 ns
+曹子丹 4 nr
+曹子孝 3 nr
+曹子建 11 nr
+曹子正 14 nr
+曹孟君 8 nr
+曹孟德 16 nr
+曹安民 2 nr
+曹官魏 5 nr
+曹家岭 3 nr
+曹寨中 2 nr
+曹将军 6 nr
+曹少钦 2 nr
+曹尚书 2 nr
+曹巡抚 2 nr
+曹帅来 2 nr
+曹帅派 2 nr
+曹师兄 4 nr
+曹广亮 2 nr
+曹庆泽 3 nr
+曹康泰 3 nr
+曹延磊 2 nr
+曹建明 3 nr
+曹志和 2 nr
+曹思正 4 nr
+曹思诚 3 nr
+曹总兵 11 nr
+曹成佑 3 nrfg
+曹掊冒 3 vn
+曹操 2410 nr
+曹操传 3 nr
+曹操就到 6 i
+曹敏修 2 nr
+曹文化 2 nr
+曹文叔 2 nr
+曹文宣 6 nr
+曹文庄 3 nr
+曹文芳 5 nr
+曹文诏 142 nr
+曹文轩 10 nr
+曹斯哈恩 3 nr
+曹新丽 2 nr
+曹新宇 24 nr
+曹日昌 2 nr
+曹明济 10 nr
+曹明生 2 nr
+曹景宗 3 nr
+曹查理 3 nr
+曹树厚 3 nr
+曹桂凤 2 nr
+曹梦炎 2 nr
+曹植 57 nr
+曹植入 2 nr
+曹永祥 35 nr
+曹汝霖 1066 nr
+曹洞宗 7 nr
+曹洞禅 2 nr
+曹津燕 3 nr
+曹洪分 2 nr
+曹洪字 2 nr
+曹洪引 4 nr
+曹洪战 2 nr
+曹洪领 3 nr
+曹涤非 54 nr
+曹添堡 10 nr
+曹溪宗 4 nr
+曹溪寺 6 nr
+曹满仓 44 nr
+曹漫之 2 nr
+曹熏铉 2 nr
+曹熙 3 nrfg
+曹燕珍 257 nr
+曹爽心 2 nr
+曹率军 2 nr
+曹瑞林 2 nr
+曹甸镇 3 ns
+曹真兵 2 nr
+曹真寨 2 nr
+曹知白 2 nr
+曹社之谋 3 nr
+曹福田 5 nr
+曹禺 587 nr
+曹禺戏剧文学奖 2 nz
+曹秋生 3 nr
+曹美成 2 nr
+曹翠芬 3 nr
+曹翠霞 5 nr
+曹老大 9 nr
+曹聚仁 3 nr
+曹能命 2 nr
+曹芳芳 3 nr
+曹营分 3 nr
+曹营诸 2 nr
+曹萧诗 128 nr
+曹薰铉 11 nr
+曹议金 3 nr
+曹起志 2 nr
+曹邦辅 6 nr
+曹金昌 5 nr
+曹锟 141 nr
+曹锟瞅 4 nr
+曹锟部 3 nr
+曹长老 2 nr
+曹门坊 7 nr
+曹雄杰 25 nr
+曹雪芹 114 nr
+曹霁阳 2 nr
+曹靖华 8 nr
+曹高峰 2 nr
+曹魏 155 nr
+曹魏代 3 nr
+曹魏初 8 nr
+曹魏文 2 nr
+曹魏时 2 nr
+曹魏正 2 nr
+曹魏立 3 nr
+曹魏设 6 nr
+曹魏诸 2 nr
+曹魏邺 3 nr
+曹魏黄 3 nr
+曹鹏程 2 nr
+曺 4 zg
+曻 4 zg
+曼 690 nr
+曼丁哥 3 nr
+曼丁戈 3 nr
+曼伯 2 ns
+曼佗罗 3 nz
+曼光谱 13 nr
+曼兴 2 ns
+曼切斯特 2 nrt
+曼利 7 ns
+曼加 4 ns
+曼努埃尔 10 nrt
+曼哈顿 92 ns
+曼哈顿区 11 ns
+曼哈顿岛 7 ns
+曼城 55 ns
+曼城队 18 nt
+曼声 3 nr
+曼奇尼 3 nr
+曼妙 30 nr
+曼妮芬 3 nr
+曼尼斯 2 nr
+曼尼普尔 4 nrt
+曼延 3 nr
+曼彻斯特 149 nrt
+曼彻斯特大学 16 nt
+曼得拉 3 nr
+曼德勒 20 nr
+曼德尔 4 nr
+曼德拉 107 nr
+曼德琳 3 nr
+曼敦 2 ns
+曼斯 6 ns
+曼斯菲尔德 7 nrt
+曼族 6 nz
+曼格拉普斯 5 nrt
+曼梏 3 n
+曼海 31 ns
+曼海姆 22 nr
+曼璐道 57 nr
+曼秀雷敦 3 nr
+曼纽尔 2 nr
+曼联 260 ns
+曼联队 9 nt
+曼苏尔 16 nr
+曼苏里 2 ns
+曼荼罗 5 n
+曼萨 18 ns
+曼衍鱼龙 3 nr
+曼谷 385 ns
+曼谷人 3 nr
+曼谷市 3 ns
+曼陀林 9 ns
+曼陀罗 22 ns
+曼陀罗花 9 ns
+曼陀铃 3 n
+曼飞龙 7 nr
+曼齐 5 ns
+曼齐尼 3 nr
+曾 29107 d
+曾一夕 2 nr
+曾一度 3 d
+曾三异 3 nr
+曾不惨然 3 i
+曾世英 9 nr
+曾业英 35 nr
+曾中生 3 nr
+曾为楚 256 nr
+曾之乔 3 nr
+曾之宁 6 nr
+曾云高 3 nr
+曾五典 3 nr
+曾亲耳 2 nr
+曾仕强 3 nr
+曾令木 2 nr
+曾令良 256 nr
+曾以彰 2 nr
+曾仰丰 2 nr
+曾仲鸣 6 nr
+曾任兰 2 nr
+曾任州 2 nr
+曾任礼 2 nr
+曾任红 2 nr
+曾任青 2 nr
+曾伟权 3 nr
+曾侯乙 39 nr
+曾修习 2 nr
+曾元裕 3 nr
+曾兆强 3 nr
+曾克林 2 nr
+曾公亮 18 nr
+曾几何时 60 nr
+曾凡军 2 nr
+曾利明 9 nr
+曾剑秋 8 nr
+曾助金刚 2 nr
+曾华锋 6 nr
+曾南侵 2 nr
+曾参杀人 3 nr
+曾同严 2 nr
+曾向东 2 nr
+曾向铜 2 nr
+曾听洪 2 nr
+曾听蓉 2 nr
+曾启亮 12 nr
+曾呈奎 3 nr
+曾命方 2 nr
+曾国荃 23 nr
+曾国藩 204 nr
+曾图南 17 nr
+曾在武 2 nr
+曾坚欲 2 nr
+曾培炎 33 nr
+曾士华 2 nr
+曾士楚 7 nr
+曾外祖父 3 nr
+曾多次 3 d
+曾奉召 2 nr
+曾奉旨 2 nr
+曾奉诏 4 nr
+曾子亲 2 nr
+曾子墨 256 nr
+曾孙 76 nr
+曾孙女 3 nr
+曾孙子 2 nr
+曾孝谷 3 nr
+曾学书 2 nr
+曾学于 2 nr
+曾学得 2 nr
+曾宝仪 3 nr
+曾宪九 2 nr
+曾宪林 5 nr
+曾宪梓 265 nrfg
+曾家岩 2 nr
+曾家庄 13 nr
+曾家府 2 nr
+曾尊固 12 nr
+曾少侠 20 nr
+曾巩 23 nr
+曾布任 2 nr
+曾希圣 3 nr
+曾庆云 11 nr
+曾庆存 3 nr
+曾庆瑞 4 nr
+曾庆红 50 nr
+曾建天 2 nr
+曾建徽 2 nr
+曾开名 3 nr
+曾开铸 2 nr
+曾当过 3 i
+曾征其 2 nr
+曾得异 2 nr
+曾得明 5 nr
+曾志伟 3 nr
+曾志坚 2 nr
+曾志远 26 nr
+曾思玉 512 nr
+曾惠敏 3 nr
+曾护育 2 nr
+曾放言 3 nr
+曾效力 3 nr
+曾敏之 4 nr
+曾文坝 2 nr
+曾文正公 3 nr
+曾文水库 3 nr
+曾文溪 12 nr
+曾文雄 2 nr
+曾无与二 3 i
+曾昭斌 2 nr
+曾昭璇 2 nr
+曾景忠 2 nr
+曾有信 2 nr
+曾有恩 4 nr
+曾有文 2 nr
+曾有杨 2 nr
+曾朴 10 nr
+曾柔笑 2 nr
+曾柔见 2 nr
+曾格格 3 nr
+曾欲兴 2 nr
+曾欲删 3 nr
+曾毅公 2 nr
+曾母投杼 3 nr
+曾母暗沙 3 nr
+曾浚修 4 nr
+曾游憩 2 nr
+曾率兵 2 nr
+曾率军 8 nr
+曾玉良 2 nr
+曾用名 18 nr
+曾登宝 3 nr
+曾省吾 5 nr
+曾碧漪 2 nr
+曾祖 57 nr
+曾祖母 10 nr
+曾祖父 39 nr
+曾立志 2 nr
+曾立重 2 nr
+曾答允 7 nr
+曾繁旭 2 nr
+曾红生 3 nr
+曾纪泽 21 nr
+曾纪鸿 8 nr
+曾细加 2 nr
+曾经 6371 d
+曾经沧海 14 ns
+曾统兵 3 nr
+曾绥抚 2 nr
+曾置行 2 nr
+曾聘吴 2 nr
+曾致书 2 nr
+曾航生 3 nr
+曾若虹 2 nr
+曾荫权 14 nr
+曾见神 2 nr
+曾谏阻 4 nr
+曾起兵 2 nr
+曾辛元 7 nr
+曾近荣 3 nr
+曾远 4 d
+曾述及 16 nr
+曾遇异 2 nr
+曾道人 3 nr
+曾都区 256 ns
+曾醉心 3 nr
+曾金陵 2 nr
+曾铁鸥 44 nr
+曾阿牛 4 nr
+曾雄霸 2 nr
+曾领兵 4 nr
+曾食邑 2 nr
+曾鹏宇 2 nr
+曾黎 4 ns
+替 5281 p
+替人 80 n
+替人家 3 n
+替人着想 3 i
+替代 1227 n
+替代品 49 n
+替代国 3 n
+替代密码 6 n
+替代强化 3 i
+替代性 21 n
+替代攻击 3 i
+替代法 2 n
+替代物 5 n
+替代环 3 vn
+替代疗法 3 n
+替代者 8 n
+替代选择 4 n
+替位扩散 3 n
+替天行道 75 i
+替夫 3 n
+替岗 3 v
+替工 3 v
+替手 3 v
+替换 587 v
+替换品 3 n
+替换成 3 i
+替换法 3 i
+替换算法 2 n
+替死 3 v
+替死鬼 64 i
+替父 3 n
+替班 5 v
+替用 3 v
+替用品 3 n
+替硝唑 3 nz
+替续器 3 n
+替罪 4 v
+替罪人 3 n
+替罪羊 40 n
+替考 4 v
+替补 337 v
+替补名单 3 n
+替补席 36 n
+替补队员 7 n
+替角 3 n
+替身 164 v
+替身使者 3 n
+替身演员 6 n
+替载电阻 3 i
+替过 3 v
+最 60450 d
+最上 3 f
+最上层 3 f
+最下 3 f
+最下策 3 n
+最不开心 3 l
+最丑 3 t
+最为 2942 d
+最久 3 a
+最亮 3 a
+最优 3 d
+最优化 79 v
+最优性 3 n
+最优控制 3 n
+最优设计 3 n
+最优逼近 3 l
+最低 2431 a
+最低价 42 n
+最低保护 3 n
+最低值 10 n
+最低工资 3 n
+最低标准 3 n
+最低气温 3 n
+最低水平 3 n
+最低温 3 n
+最低温度 3 n
+最低点 171 n
+最低谷 6 n
+最低限 5 n
+最低音 3 n
+最佳 3297 z
+最佳人选 3 n
+最佳值 3 l
+最佳化 3 l
+最佳奖 2 n
+最佳影片 3 n
+最佳时期 3 n
+最佳时机 3 l
+最佳期 2 n
+最佳答案 3 n
+最佳解 3 l
+最佳阵容 3 l
+最佳雇主 3 n
+最先 595 d
+最全 27 a
+最冷 3 a
+最出色 3 a
+最初 2996 t
+最前 3 t
+最前沿 33 s
+最劲爆 3 a
+最南端 3 f
+最叫人 3 n
+最合适 3 a
+最后 19355 f
+最后通牒 303 l
+最后通谍 2 n
+最圆 3 z
+最多 3 d
+最够 3 a
+最大 16299 a
+最大亏格 3 l
+最大值 41 l
+最大公约数 14 n
+最大功 3 n
+最大化 129 nt
+最大数 3 l
+最大树 3 n
+最大者 44 n
+最好 721 a
+最妙 3 a
+最富 3 a
+最小 1364 a
+最小值 3 l
+最小分词 3 l
+最小化 13 j
+最小链 3 n
+最小限度 3 l
+最少 482 d
+最巧 3 a
+最差 93 a
+最常 3 d
+最底层 67 n
+最弱 3 a
+最强 464 a
+最强者 3 n
+最强音 12 n
+最忙 3 d
+最快 567 d
+最怕 3 d
+最恨 3 a
+最惠国 128 n
+最惨 3 a
+最想嫁 3 n
+最慢 3 a
+最新 2862 d
+最新动向 3 n
+最新型 78 b
+最新报导 3 n
+最新更新 3 l
+最新款 3 n
+最新消息 3 n
+最新版 3 b
+最新进展 3 nt
+最旧 3 z
+最早 4124 d
+最旺 3 a
+最晚 3 t
+最最 151 d
+最末 39 t
+最末端 3 n
+最松 3 a
+最次 3 d
+最毒 3 a
+最浅 3 a
+最深 582 d
+最深处 3 d
+最渴 3 a
+最游记 3 n
+最激 3 a
+最灵 3 a
+最烦 3 a
+最热 3 a
+最热帖 3 z
+最爱 3 a
+最爽 3 a
+最甜 3 a
+最省 3 nt
+最矮 3 a
+最硬 3 a
+最穷 3 d
+最笨 3 a
+最糟 3 z
+最紧 3 d
+最终 6028 d
+最终幻想 3 l
+最终版 3 n
+最终用户 3 l
+最终目标 3 l
+最美 199 a
+最肯 3 d
+最能体现 3 l
+最舒服 3 z
+最薄 3 a
+最让人 3 n
+最贵 3 a
+最起码 128 l
+最轻 3 a
+最轻量级 2 n
+最近 5355 f
+最还怕 3 l
+最远 166 a
+最远到 3 l
+最迟 3 d
+最迟在 3 z
+最适 3 a
+最速 3 d
+最速上升 3 l
+最酷 3 a
+最重 278 a
+最长 808 a
+最难 3 a
+最靠近 3 n
+最须 3 d
+最高 12430 a
+最高人民检察院 2369 nt
+最高人民法院 2498 nt
+最高价 20 n
+最高值 23 l
+最高分 40 l
+最高处 99 z
+最高奖 3 n
+最高层 51 z
+最高峰 633 n
+最高检 3 j
+最高法院 150 nt
+最高潮 21 nt
+最高点 288 n
+最高级 136 b
+最高级别 3 n
+最高者 27 n
+最高院 6 nt
+最高额 8 b
+最鲜 3 a
+朂 4 zg
+會 9 zg
+朄 6 zg
+月 110207 m
+月下老人 9 n
+月下老儿 3 n
+月下花前 3 i
+月中折桂 3 nr
+月之女神 3 i
+月之海 3 nr
+月亮 1037 n
+月亮代表 3 n
+月亮山 3 nr
+月亮泡 6 n
+月亮神 10 nr
+月亮门儿 3 n
+月令 23 n
+月份 1754 n
+月份牌 7 n
+月余 81 n
+月俸 3 n
+月值年灾 3 n
+月偏食 4 n
+月儿 67 n
+月儿圆 3 n
+月光 1003 n
+月光光 2 n
+月光如水 19 i
+月光宝盒 3 n
+月光族 3 n
+月光曲 3 n
+月光花 3 n
+月光计划 3 n
+月入 39 n
+月入数万 3 i
+月全食 13 n
+月刊 263 n
+月初 504 t
+月利率 9 n
+月前 3 t
+月华 117 j
+月历 5 t
+月台 62 n
+月台票 2 n
+月圆夜 3 t
+月圆月缺 3 n
+月圆花好 3 n
+月地云阶 3 n
+月均 275 j
+月坛 15 n
+月坠花折 3 n
+月复一月 3 t
+月夕 3 t
+月夕花晨 3 nr
+月夕花朝 3 n
+月夜 71 t
+月夜花朝 3 n
+月头儿 3 n
+月子 34 n
+月子病 3 n
+月季 234 t
+月季花 23 n
+月季苗 3 n
+月宫 39 n
+月宫宝盒 3 n
+月宫魔盒 3 nr
+月容 8 n
+月岩 17 n
+月峰 4 n
+月工资 63 n
+月底 533 t
+月度 18 n
+月度付款 3 n
+月异日新 3 i
+月影 41 n
+月息 16 n
+月攘一鸡 3 i
+月旦春秋 3 t
+月旦评 3 n
+月明千里 3 i
+月明如镜 2 nr
+月明星稀 8 i
+月明楼 2 n
+月明风清 4 nr
+月晕 5 n
+月晕础润 3 n
+月晕而风 3 i
+月曜日 3 nr
+月月年年 2 t
+月月红 3 nr
+月朗星稀 3 nr
+月朗风清 3 nr
+月末 85 t
+月桂 9 j
+月桂冠 3 nr
+月桂树 7 nr
+月桂花 3 nr
+月氏 76 n
+月池 3 n
+月没参横 3 l
+月洞门 24 n
+月浦 3 j
+月湖 263 n
+月湖区 3 n
+月满则亏 7 l
+月牙 74 n
+月牙儿 3 n
+月牙岛 3 n
+月牙形 21 n
+月牙泉 35 nz
+月牙湖 9 ns
+月环食 3 n
+月球 783 n
+月球仪 3 n
+月球车 6 n
+月琴 34 n
+月白 31 n
+月白色 22 n
+月白风清 12 n
+月盈 2 nr
+月盈则食 3 n
+月盈月缺 3 n
+月相 47 n
+月眉 3 n
+月票 24 n
+月租 27 n
+月租费 68 n
+月租金 16 n
+月章星句 3 n
+月终 6 t
+月经 742 n
+月经不调 3 n
+月经周期 3 n
+月经带 5 n
+月经期 3 n
+月经血 3 n
+月经过多 3 l
+月缺花残 3 n
+月缺难圆 3 i
+月色 203 n
+月色微茫 3 i
+月色迷濛 3 nr
+月落乌啼 3 n
+月落参横 3 l
+月落星沉 3 i
+月薪 491 n
+月蚀 40 n
+月见草 7 n
+月话费 9 n
+月貌花容 3 n
+月里嫦娥 3 nr
+月销量 3 n
+月镜 4 n
+月露之体 3 i
+月露风云 3 i
+月食 54 n
+月饼 123 n
+月饼盒 3 n
+月香 21 n
+月魂灵波 3 n
+月黑杀人 3 n
+月黑风高 23 n
+月龄 11 n
+有 423765 v
+有一得一 3 l
+有一无二 3 i
+有三有俩 3 i
+有丝分裂 3 i
+有两下子 20 l
+有为有守 3 l
+有为者 3 nr
+有了钱 3 l
+有事 458 r
+有事之秋 3 i
+有事吗 3 v
+有事没事 3 l
+有事相求 3 l
+有亏职守 3 l
+有云贵 2 nr
+有亚尔 2 nr
+有些 15584 r
+有产 3 vn
+有产者 121 n
+有产阶级 47 l
+有人 15007 r
+有仇必报 3 i
+有令不行 8 l
+有令即行 3 i
+有以善处 3 l
+有件事 3 l
+有价无市 3 l
+有价证券 178 l
+有份 3 n
+有伤 209 v
+有伤和气 3 n
+有伤风化 10 i
+有何不可 63 l
+有何不妥 3 nr
+有何意义 3 l
+有何感想 3 l
+有何指教 3 l
+有何特长 3 l
+有何见教 3 l
+有何贵干 3 l
+有何面目 66 l
+有何高见 3 l
+有余 551 r
+有余味 2 l
+有例可循 3 n
+有例可援 3 l
+有例在先 3 l
+有借无还 3 l
+有借有还 3 l
+有假 120 a
+有偿 93 vn
+有偿性 2 n
+有偿转让 13 i
+有先帝 2 nr
+有先有后 3 l
+有光纸 3 n
+有关 20573 vn
+有兴庆 3 nr
+有兵勇 3 nr
+有其师 3 nr
+有其父必有其子 6 l
+有典有则 3 n
+有准备地 3 l
+有几下子 6 l
+有凤来仪 3 nr
+有凭有据 4 l
+有分寸 52 n
+有分有合 3 l
+有则改之 12 l
+有创造力 3 l
+有利 2291 a
+有利于 3074 v
+有利可图 100 l
+有利措施 3 n
+有利於 3 nr
+有利有弊 11 i
+有利条件 3 l
+有别 309 d
+有别于 154 v
+有力 2579 n
+有功 448 a
+有功之臣 3 i
+有功在身 3 i
+有功者 14 n
+有加 230 v
+有加利 3 nr
+有加无减 3 i
+有加无已 3 i
+有助 87 vn
+有助于 1286 v
+有劲 33 a
+有劳 98 a
+有勇无谋 25 i
+有勇有谋 12 i
+有勇知方 3 i
+有去无回 46 i
+有去无来 3 l
+有双凤 128 nr
+有变 162 v
+有口无心 7 i
+有口无行 3 i
+有口皆碑 33 i
+有口难分 3 l
+有口难言 8 i
+有口难辩 9 l
+有句名言 3 i
+有史以来 292 l
+有司 3 n
+有吃有喝 3 l
+有吃有穿 3 i
+有名 1255 a
+有名亡实 3 i
+有名无实 48 i
+有名有姓 20 i
+有名有实 3 i
+有名气 3 l
+有向图 6 nr
+有君臣 20 nr
+有否 37 v
+有吸收力 3 l
+有味 30 n
+有命 3 vn
+有售 7 vn
+有善德 48 nr
+有喜 69 a
+有喜有忧 4 l
+有嘉乔 3 nr
+有嘴无心 2 i
+有嘴没心 3 l
+有嘴没舌 3 i
+有国难投 3 i
+有增无减 65 i
+有增无已 5 i
+有增无损 3 i
+有声 117 d
+有声书 3 l
+有声力量 3 l
+有声无实 3 i
+有声无气 3 l
+有声有色 114 l
+有声没气 3 l
+有声片 12 l
+有声版 3 l
+有声电影 3 l
+有备 3 v
+有备无患 29 i
+有备而来 47 l
+有多强 3 nr
+有多深 3 d
+有多黑 3 l
+有大有小 3 l
+有天无日 5 i
+有天没日 3 l
+有夫之妇 3 i
+有失 379 v
+有失体统 3 l
+有失公允 8 l
+有失诚信 3 i
+有失身份 3 n
+有失远迎 18 i
+有头无尾 2 i
+有头无脑 3 l
+有头有尾 9 i
+有头有脑 3 l
+有头有脸 28 l
+有头没尾 3 i
+有头没脑 3 l
+有奖 28 vn
+有奖销售 2 l
+有女怀春 3 l
+有奶便是娘 4 l
+有好有坏 3 i
+有如 860 v
+有如神助 3 i
+有妇之夫 3 l
+有始无终 10 l
+有始有卒 3 i
+有始有终 18 l
+有姿有色 3 l
+有孔虫 29 nr
+有孕 3 v
+有完没完 3 nr
+有宝衣 3 nr
+有审判权 3 n
+有害 1047 a
+有害信息 3 n
+有害无利 3 i
+有害无益 3 i
+有害物 8 n
+有害物质 3 n
+有害生物 3 l
+有家可归 3 l
+有家有口 3 l
+有家难奔 3 nr
+有容乃大 10 l
+有寒玉 3 nr
+有尖锋 2 nr
+有屈无伸 3 i
+有山有水 3 l
+有崇宗 2 nr
+有巢氏 3 nr
+有己无人 3 i
+有年无月 3 l
+有幸 273 a
+有序 523 n
+有序化 9 l
+有序性 12 l
+有底 23 d
+有度 3 n
+有建昌 2 nr
+有异 3 a
+有弊有利 3 n
+有张有弛 9 l
+有形 168 n
+有形损耗 3 l
+有形资产 3 l
+有影儿 2 l
+有往有来 3 l
+有征无战 4 i
+有待 481 v
+有待于 3 l
+有得卖 3 v
+有得有失 2 l
+有得赚 3 l
+有微子 2 n
+有德者 23 nr
+有德航 3 nr
+有心 362 a
+有心为善 3 i
+有心人 82 n
+有心人士 3 i
+有心力 22 l
+有心力场 3 l
+有心无力 16 i
+有心有意 3 i
+有志 110 n
+有志一同 3 i
+有志不在年高 3 i
+有志之士 14 nr
+有志于 160 nr
+有志于此 3 i
+有志无时 3 i
+有志气 3 n
+有志竟成 3 nr
+有志者 10 n
+有志者事 3 i
+有志者事竟成 12 i
+有志雄酬 3 n
+有忠君 2 nr
+有忠爱 2 nr
+有快有慢 3 l
+有怡刚 3 nr
+有性 102 n
+有性杂交 4 l
+有性生殖 149 l
+有恃无恐 121 i
+有恃毋恐 3 i
+有恋童 2 l
+有恒 5 nr
+有恒山 6 nr
+有恒心 3 l
+有恩义 5 nr
+有恩利 3 nr
+有悔 16 v
+有悖 32 v
+有悖于 46 v
+有情 199 n
+有情人 24 l
+有情人终 3 i
+有情人终成眷属 13 i
+有情可原 4 i
+有情有义 3 l
+有惊无险 55 i
+有意 1274 v
+有意思 448 l
+有意无意 137 i
+有意者 3 n
+有意识 270 l
+有意识记 3 n
+有感 46 a
+有感于 51 l
+有感而发 24 l
+有愧 80 a
+有慈石 4 nr
+有慧根 5 nr
+有慧英 4 nr
+有懒于 3 v
+有懿旨 5 nr
+有戏 28 n
+有成 90 v
+有我无人 3 l
+有我无敌 3 i
+有房住 3 i
+有所 5013 n
+有所不为 13 l
+有所不同 533 l
+有所不知 3 l
+有所为 31 l
+有所为有所不为 5 i
+有所作为 273 l
+有所准备 3 l
+有所创造 3 l
+有所前进 3 l
+有所区别 3 n
+有所增加 3 i
+有所思 3 l
+有所提高 3 l
+有所改善 3 l
+有所改进 3 l
+有所突破 3 i
+有所致力 3 l
+有所长 14 l
+有才干 3 l
+有才无命 2 i
+有把握 128 l
+有拖无欠 3 n
+有损 182 vn
+有损于 57 v
+有损压缩 2 l
+有损无益 15 l
+有据可依 2 l
+有据可查 7 l
+有接缝 3 l
+有效 7151 a
+有效位数 3 l
+有效值 20 l
+有效分蘖 3 l
+有效势 3 n
+有效字 3 l
+有效射程 114 n
+有效性 232 n
+有效成分 3 l
+有效数字 4 l
+有效期 157 n
+有效期限 3 n
+有效氯 3 n
+有效温度 12 l
+有效率 85 n
+有效票 5 n
+有效积温 3 n
+有效证件 3 n
+有效载荷 3 n
+有效途径 3 l
+有效项 3 n
+有敌无我 3 i
+有救 115 v
+有教无类 12 l
+有教益 3 l
+有数 350 n
+有文无行 3 l
+有料 3 n
+有新有旧 3 l
+有方 119 r
+有旋电场 3 n
+有旗昌 2 nr
+有无 624 v
+有无必要 3 l
+有无相通 3 i
+有时 6917 r
+有时候 1236 l
+有明谕 2 nr
+有昭武 6 nr
+有暇 3 d
+有暴风雨 3 l
+有曜仪 2 nr
+有曼伯 2 nr
+有朋自远方来 12 l
+有望 802 v
+有朝一日 180 i
+有朝彦 2 nr
+有期 7 b
+有期徒刑 233 l
+有本有原 3 n
+有本有源 3 l
+有机 2352 n
+有机体 102 l
+有机化合 3 l
+有机化学 133 l
+有机化学家 6 l
+有机化工 3 l
+有机可乘 55 l
+有机合成 92 l
+有机染料 4 l
+有机氯 19 n
+有机溶剂 3 n
+有机物 297 l
+有机玻璃 24 l
+有机界 3 n
+有机硅 3 n
+有机磷 45 n
+有机磷类 3 n
+有机肥 24 n
+有机肥料 20 l
+有机质 178 l
+有机酸 62 n
+有机颜料 3 l
+有权 2343 n
+有权有势 33 l
+有条不紊 145 i
+有条有理 11 l
+有条理 3 l
+有条纹 3 n
+有来无回 8 l
+有来有往 10 l
+有板有眼 44 l
+有林地 22 n
+有枝有叶 3 i
+有枝添叶 3 i
+有染 13 vn
+有样 3 r
+有样学样 3 l
+有根有底 3 l
+有根有据 14 l
+有根有苗 3 n
+有案 3 r
+有案不办 3 i
+有案不立 3 i
+有案可查 4 l
+有案可稽 3 l
+有案必办 3 i
+有案必查 3 l
+有棱有角 6 i
+有模有样 19 l
+有欢容 2 nr
+有此 3 r
+有此一说 3 l
+有步骤 191 l
+有死无二 3 i
+有毒 535 v
+有毒气体 3 l
+有气无力 103 l
+有气无烟 3 i
+有气没力 26 l
+有氧 95 vn
+有求 32 v
+有求于 49 l
+有求于人 3 i
+有求必应 34 l
+有汉儿 4 nr
+有没有 2360 v
+有治 3 l
+有法不依 12 l
+有法可依 22 l
+有法必依 6 l
+有泽麻子 2 nr
+有浓味 3 n
+有海子 2 nr
+有湘桂 2 nr
+有源 73 n
+有源元件 3 n
+有源减噪 3 i
+有源网络 3 n
+有源阵 3 nr
+有源音箱 3 n
+有溶解力 3 l
+有滋有味 43 l
+有潮河口 3 l
+有点 3706 n
+有点像 3 v
+有点儿 481 r
+有点咸 3 nr
+有点烦 3 l
+有点痛 3 v
+有点累 3 v
+有物有则 3 n
+有牵有挂 3 i
+有犯无隐 3 i
+有猫儿 2 l
+有献忠 3 nr
+有理 457 vn
+有理函数 14 l
+有理分式 3 l
+有理式 9 l
+有理数 58 l
+有理方程 2 l
+有理无情 3 l
+有理有据 28 l
+有理有节 21 l
+有理根 3 n
+有理等价 3 n
+有瑞利 2 nr
+有瑶琳 2 nr
+有瓦霞 2 nr
+有生 360 v
+有生之年 52 l
+有生以来 70 l
+有生力量 150 l
+有用 731 v
+有用之才 12 l
+有用功 3 n
+有用吗 3 v
+有甲叶 2 n
+有界 3 n
+有界性 2 b
+有病乱投医 6 i
+有病找 3 l
+有瘾 3 a
+有登仙 2 nr
+有百利而无一害 8 l
+有百害而无一利 5 i
+有的放矢 101 i
+有的放箭 3 l
+有的是 803 l
+有益 1470 n
+有益于 530 v
+有益健康 3 l
+有益无害 3 l
+有益菌 3 n
+有目共睹 88 l
+有目共见 3 l
+有目共赏 3 l
+有目无睹 3 i
+有眉目 15 i
+有眼不识 3 l
+有眼不识泰山 31 i
+有眼力 3 l
+有眼如盲 3 v
+有眼无珠 34 i
+有眼无瞳 3 n
+有着 3345 v
+有着落 3 l
+有码 3 n
+有研 23 vn
+有破有立 2 i
+有碍 3 v
+有碍于 24 v
+有碍观瞻 7 i
+有碍通行 3 n
+有礼有节 3 l
+有神 112 n
+有神论 15 l
+有神论者 6 n
+有祥云 5 nr
+有祥光 2 nr
+有票 3 n
+有禁不止 13 l
+有福同享 30 i
+有福气 3 nr
+有种 175 r
+有种乎 3 l
+有种人 3 l
+有秩序地 3 nr
+有穷性 3 n
+有空 144 vn
+有空时 3 l
+有章不循 3 i
+有章可循 17 i
+有笔 3 r
+有管腺 3 l
+有篇 3 l
+有素 3 n
+有红儿 2 nr
+有约在先 22 l
+有纬宇 2 nr
+有线 172 n
+有线广播 23 l
+有线电 14 b
+有线电视 124 l
+有线电话 4 l
+有线网 2 n
+有线通 3 l
+有缘 175 n
+有缘人 3 n
+有缘分 9 l
+有缘千里 3 i
+有缘无份 3 n
+有罪 349 vn
+有罪不究 3 l
+有罪之身 3 l
+有罪必究 3 l
+有翅蚜 3 n
+有翅难飞 3 i
+有老有少 3 l
+有耻且格 3 l
+有职无权 3 l
+有职有权 3 l
+有聚君 2 nr
+有胆有实 3 l
+有胆有识 15 l
+有胖有瘦 3 i
+有脚书厨 3 n
+有脚书橱 3 n
+有脚阳春 3 l
+有致 3 a
+有致敏 3 nr
+有良渚 2 nr
+有良玉 2 nr
+有良言 3 l
+有色 291 n
+有色人种 27 l
+有色玻璃 3 l
+有色眼光 3 l
+有色眼睛 3 i
+有色眼镜 7 l
+有色金属 508 n
+有节有度 3 l
+有若渊 2 nr
+有苦难言 16 i
+有薇薇 4 nr
+有蠙可乘 3 v
+有血有泪 3 l
+有血有肉 44 l
+有行无市 3 i
+有言在先 31 l
+有识之士 109 l
+有识者 3 n
+有诈 3 a
+有词打词 3 i
+有话好说 3 l
+有话直说 3 l
+有话要说 3 l
+有话请讲 3 l
+有误 226 vn
+有说有笑 96 l
+有豪士 2 nr
+有负众望 3 l
+有财有势 3 l
+有责 29 v
+有贤妻 6 nr
+有货 3 l
+有赏有罚 3 n
+有赖 3 v
+有赖于 241 v
+有赚就好 3 l
+有起色 5 l
+有趣 1471 a
+有趣儿 6 l
+有路可走 3 l
+有蹄类 40 n
+有身 3 r
+有车族 2 n
+有车有房 3 n
+有轨 58 b
+有轨电车 3 l
+有输有赢 3 n
+有辙 3 n
+有辱 3 v
+有辱斯文 3 nz
+有边 3 r
+有边读边 3 n
+有过之 28 l
+有过之无不及 9 i
+有过之而无不及 69 i
+有过则改 3 l
+有进无退 3 l
+有进有出 3 l
+有远见 3 l
+有违 190 v
+有违常情 3 i
+有迹可循 3 i
+有道明 2 nr
+有道是 95 l
+有酸味 3 n
+有鉴于 42 v
+有鉴于此 28 l
+有钱 581 v
+有钱人 97 n
+有钱出钱 3 n
+有钱有势 301 n
+有钱有闲 3 i
+有钱能使鬼推磨 15 i
+有钱赚 3 nr
+有铁粉 8 n
+有销路 3 n
+有错 3 a
+有错则改 3 l
+有错就改 3 l
+有错必纠 3 l
+有锡尔 2 nr
+有长有短 16 i
+有门儿 7 l
+有门道 4 l
+有问必答 31 l
+有问有答 3 l
+有闲 3 l
+有间 3 n
+有闻必录 3 n
+有阀门 3 vn
+有阳明 2 nr
+有阴有晴 3 l
+有附文 3 n
+有限 2828 a
+有限元 3 n
+有限元法 29 n
+有限公司 6278 n
+有限小数 3 l
+有限性 20 n
+有限目标 4 l
+有限网 3 n
+有限花序 5 l
+有限责任 605 l
+有隙 3 n
+有隙可乘 14 i
+有难同当 47 l
+有雅虎 2 nr
+有雪雁 2 nr
+有青龙 3 nr
+有风有化 3 l
+有风有雨 3 l
+有骨头 12 n
+有高有低 26 l
+有高有矮 3 n
+有鬼 85 n
+有鱼有肉 3 l
+有鼻子有眼 17 l
+有鼻子有眼儿 2 l
+朊 32 g
+朊病毒 3 vn
+朋 278 n
+朋侪 3 n
+朋克 3 n
+朋党 61 n
+朋党为奸 3 n
+朋党政治 3 n
+朋党比周 3 n
+朋党论 2 n
+朋分花用 3 n
+朋友 9200 n
+朋友圈 3 n
+朋友妻 3 n
+朋友家 34 n
+朋友有通 3 n
+朋友网 3 n
+朋比为奸 9 i
+朋比作奸 3 n
+朋辈 3 n
+朋驰 3 nz
+服 1095 v
+服下 3 v
+服下去 3 v
+服不服 3 v
+服丧 30 vn
+服丧期 2 n
+服人 3 n
+服从 2104 v
+服从为负 3 i
+服从分配 3 n
+服从命令 3 n
+服从安排 3 n
+服从性 3 n
+服从组织 3 n
+服从需要 3 v
+服低做小 3 n
+服侍 782 v
+服兵役 118 n
+服冕乘轩 3 nr
+服刑 107 n
+服刑人员 3 n
+服刑犯 4 n
+服到 3 v
+服务 13036 vn
+服务上门 3 n
+服务业 535 n
+服务中心 52 n
+服务体系 2 n
+服务例程 3 n
+服务供应商 4 n
+服务公司 21 n
+服务到位 3 n
+服务化 5 n
+服务区 11 n
+服务半径 3 n
+服务卡 8 n
+服务厅 2 n
+服务台 48 n
+服务员 321 n
+服务周到 3 i
+服务商 89 n
+服务器 644 n
+服务器上安装 2 n
+服务器上进行 4 n
+服务器之间 2 n
+服务器发送 2 n
+服务器应用程序 2 n
+服务器时 2 n
+服务器版 3 n
+服务器程序 4 n
+服务器端 20 n
+服务器资源 2 n
+服务器软件 6 n
+服务器返回 2 n
+服务器进行 2 n
+服务团 11 n
+服务型 27 n
+服务处 20 n
+服务大局 3 n
+服务奖 7 n
+服务室 2 n
+服务导报 3 n
+服务小组 3 n
+服务局 11 n
+服务平台 3 n
+服务态度 3 n
+服务性 94 n
+服务指南 3 n
+服务措施 3 n
+服务提供商 2 n
+服务提供者 4 n
+服务收入 3 n
+服务文明 3 n
+服务期 31 n
+服务水平 7 n
+服务满意 3 n
+服务牌 6 n
+服务生 55 n
+服务电梯 3 n
+服务社 36 n
+服务程序 8 n
+服务站 30 n
+服务端 25 n
+服务类型 5 n
+服务组 2 n
+服务网 10 n
+服务网络 4 n
+服务者 8 n
+服务育人 3 n
+服务舱 22 n
+服务行业 20 n
+服务设施 6 n
+服务质量 18 n
+服务费 89 n
+服务车 5 n
+服务部 45 n
+服务队 53 n
+服务项目 4 n
+服劳役 3 n
+服勤 3 vn
+服博会 3 n
+服好 3 v
+服帖 26 n
+服式 9 n
+服役 1379 n
+服役期 30 n
+服得 3 v
+服掉 3 v
+服服帖帖 38 z
+服服贴贴 3 n
+服毒 77 vn
+服毒自尽 3 i
+服毒自杀 3 v
+服气 185 n
+服气餐霞 3 n
+服法 11 vn
+服满 6 v
+服牛乘马 3 n
+服玩 3 v
+服玩东马 3 n
+服现役 3 n
+服用 960 vn
+服用甚俭 3 nr
+服用者 9 n
+服用药 3 n
+服用量 4 n
+服田力穑 3 n
+服罪 8 vn
+服老 3 vn
+服膺 19 v
+服色 167 n
+服药 207 n
+服药者 4 n
+服装 1876 vn
+服装业 16 n
+服装出口 3 n
+服装协会 3 n
+服装厂 17 n
+服装品牌 3 n
+服装商 3 n
+服装城 6 n
+服装学院 3 n
+服装市场 3 n
+服装店 33 n
+服装服饰 3 n
+服装模特 3 n
+服装界 2 n
+服装研究 3 n
+服装秀 3 n
+服装类 2 n
+服装网 3 n
+服装节 3 n
+服装行业 3 n
+服装袋 3 n
+服装设计 3 n
+服装贸易 3 n
+服装费 3 n
+服装辅料 3 n
+服装道具 3 n
+服装集团 3 n
+服装面料 3 n
+服装革 3 n
+服装鞋帽 3 n
+服贴 3 n
+服起 3 v
+服软 21 n
+服输 133 vn
+服过 3 v
+服部 12 n
+服镇静剂 3 n
+服食 3 n
+服饰 624 n
+服饰品 3 n
+服饰品牌 3 n
+服饰店 4 n
+服饰文化 3 n
+服饰网 3 n
+服饰配件 3 n
+朏 5 zg
+朐 43 g
+朒 4 zg
+朓 15 zg
+朔 433 j
+朔县 3 ns
+朔城区 3 ns
+朔州 38 ns
+朔州市 8 ns
+朔方 73 n
+朔日 15 t
+朔月 3 t
+朔望 56 t
+朔望月 3 n
+朔气 3 n
+朔漠 11 ns
+朔边 3 ns
+朔风 79 n
+朔风凛冽 3 nr
+朔风怒号 3 n
+朕 2412 g
+朕兆 29 n
+朗 1547 nr
+朗伊尔城 2 nrt
+朗伯 3 nrt
+朗克 2 nrt
+朗切斯科 2 nrt
+朗加纳斯 3 nrt
+朗县 4 ns
+朗吉努斯 3 nrt
+朗咏 3 v
+朗咸平 3 ns
+朗声 3 v
+朗德 10 nrt
+朗扇 3 n
+朗文 3 nrt
+朗斯 27 nrt
+朗斯大教 3 nz
+朗曼 22 nrt
+朗月清风 3 i
+朗朗 120 nrt
+朗朗上口 8 nrt
+朗朗乾坤 3 i
+朗松 4 nrt
+朗格 13 nrt
+朗氏细胞 3 n
+朗润园 2 n
+朗爽 3 z
+朗生 3 v
+朗登 3 nrt
+朗目疏眉 3 i
+朗福德 7 nrt
+朗科 3 nrt
+朗穷 2 z
+朗讯 138 nz
+朗讯科技 24 nz
+朗诵 228 v
+朗诵会 9 n
+朗诵技巧 3 n
+朗诵者 2 n
+朗诵诗 3 n
+朗读 77 v
+朗读比赛 3 nz
+朗读版 3 nz
+朗读课文 3 n
+朗贝尔 28 nrt
+朗达 4 nrt
+朗达军 4 nrt
+朘 8 zg
+朙 6 zg
+朚 2 zg
+望 11746 v
+望一望 17 nr
+望七星 2 nr
+望东方 6 nr
+望东门 2 nr
+望丞相 3 nr
+望中堂 2 nr
+望乡 3 ns
+望乡台 2 ns
+望了望 3 i
+望云之情 3 i
+望京 17 ns
+望仙桥 4 nr
+望众 3 n
+望你早归 3 l
+望公子 2 nr
+望其肩项 3 nr
+望其项背 28 l
+望出去 3 i
+望到 3 v
+望加锡 13 nr
+望南 2 ns
+望厦 34 n
+望厦村 3 nr
+望去 889 v
+望台 50 n
+望君侯 3 nr
+望唐僧 3 nr
+望垂慈 2 nr
+望城 53 ns
+望城乡 3 ns
+望城县 6 ns
+望多多 2 l
+望大圣 10 nr
+望天慈 3 nr
+望天收 3 nr
+望天树 13 nr
+望天水 2 nr
+望太尉 4 nr
+望夫云 4 nr
+望夫石 4 nr
+望奎 4 nr
+望奎县 3 nr
+望女成 2 nr
+望女成凤 3 nr
+望子 3 nr
+望子成才 3 nr
+望子成材 3 nr
+望子成龙 31 nr
+望子敬 3 nr
+望安 15 nr
+望宋江 2 nr
+望定军 2 nr
+望宛州 2 nr
+望宣赞 2 nr
+望尊者 2 nr
+望小路 2 nr
+望小龙 6 nr
+望尘不及 3 i
+望尘僄声 3 nz
+望尘奔北 3 i
+望尘奔溃 3 i
+望尘拜伏 3 i
+望尘比步 3 i
+望尘而拜 3 i
+望尘莫及 71 i
+望尘追迹 3 i
+望尘靡及 3 i
+望屋以食 3 i
+望屋而食 3 i
+望岫息心 3 nr
+望峰息心 2 i
+望帝啼鹃 3 l
+望平野 5 nr
+望建河 5 nr
+望式昼 2 nr
+望引兵 2 nr
+望弥撒 3 nr
+望彝陵 2 nr
+望影揣情 3 vn
+望志路 3 nr
+望恩相 5 nr
+望慈悯 2 nr
+望文生义 26 nr
+望文生训 3 nr
+望断 11 v
+望断白云 3 ns
+望族 23 nz
+望明公 4 nr
+望明月 4 nr
+望星空 3 nr
+望春花 2 nr
+望昭德 2 nr
+望月 27 nr
+望月怀 2 nr
+望月楼 3 nr
+望月湖 3 nr
+望望 605 v
+望本寨 2 nr
+望本营 2 nr
+望板 3 n
+望林纳 6 nr
+望果节 6 nr
+望柱头 3 nr
+望梅止渴 14 i
+望梅阁老 3 nr
+望楼 21 nr
+望楼台 3 nr
+望汉中 3 nr
+望江 23 ns
+望江亭 3 nr
+望江南 3 ns
+望江厂 4 nr
+望江县 3 ns
+望江州 2 ns
+望江楼 6 nr
+望洋 3 ns
+望洋兴叹 23 i
+望洋惊叹 3 i
+望洋而叹 3 i
+望海 32 ns
+望海埚 2 nr
+望海寺 2 nr
+望海山 2 nr
+望海楼 21 nr
+望海涵 5 nr
+望演武 2 nr
+望玄寂 2 nr
+望王庆 2 nr
+望环宇 2 nr
+望眼 6 n
+望眼将穿 3 i
+望眼欲穿 38 i
+望眼镜 3 nr
+望着慧 3 nr
+望秋先零 3 nr
+望秦明 3 nr
+望空捉影 3 i
+望穿 8 v
+望穿秋水 11 i
+望紫石 2 nr
+望红娘子 2 nr
+望经楼 2 nr
+望网兴叹 3 i
+望翠华 2 nr
+望老爷 3 nr
+望而却步 55 i
+望而止步 4 i
+望而生畏 54 i
+望花区 10 ns
+望若火 2 nr
+望葭萌 2 nr
+望虞河 4 nr
+望行者 4 n
+望衡对宇 3 nr
+望表知里 3 i
+望襄垣 3 nr
+望西川 2 ns
+望见 617 v
+望诊 24 v
+望谟 3 nr
+望谟县 4 nr
+望贤妹 4 nr
+望赵敏 2 nr
+望远 11 nr
+望远式 2 nr
+望远镜 664 nr
+望郑克 2 nr
+望郭襄 2 nr
+望都县 2 ns
+望长安 4 nr
+望门 3 ns
+望门寡 3 i
+望门投止 4 i
+望闻达 4 nr
+望闻问切 13 i
+望陇西 3 nr
+望陈桥 2 nr
+望霞峰 3 nr
+望顾荣 6 nr
+望风 95 nr
+望风响应 3 n
+望风希指 3 nz
+望风希旨 3 nr
+望风扑影 3 i
+望风承旨 3 nr
+望风披靡 19 i
+望风捕影 3 n
+望风破胆 3 i
+望风而逃 15 i
+望风而遁 3 nr
+望风而降 3 i
+望风而靡 3 i
+望风逃窜 3 i
+望首辅 3 nr
+朝 14885 ns
+朝三暮二 3 i
+朝三暮四 20 i
+朝不保夕 34 i
+朝不保暮 3 i
+朝不及夕 3 i
+朝不虑夕 2 i
+朝不谋夕 3 i
+朝东 3 ns
+朝东北 3 ns
+朝东南 3 ns
+朝东边 3 ns
+朝东面 3 n
+朝中社 26 nt
+朝九晚五 3 nz
+朝乾夕惕 8 i
+朝乾夕愓 3 nr
+朝云暮雨 2 i
+朝代 737 n
+朝令夕改 10 i
+朝令暮改 3 i
+朝仪 3 nz
+朝会 3 n
+朝会时间 3 n
+朝克图 6 nz
+朝内 44 nz
+朝前夕惕 3 i
+朝北 3 ns
+朝北边 3 ns
+朝北面 3 n
+朝升暮合 3 i
+朝华 3 nz
+朝华夕秀 3 i
+朝华网 3 nz
+朝南 56 ns
+朝南边 3 ns
+朝南面 3 n
+朝发夕至 2 ns
+朝发暮至 3 i
+朝右 3 n
+朝右边 3 ns
+朝向 135 n
+朝圣 101 ns
+朝圣团 3 nt
+朝圣地 2 ns
+朝圣者 20 n
+朝墨游踪 3 i
+朝夕 129 n
+朝夕相处 74 i
+朝外 111 ns
+朝天区 3 ns
+朝天宫 3 ns
+朝天椒 516 n
+朝天罐 3 nz
+朝天门 50 ns
+朝天门码头 6 ns
+朝天鼻 3 i
+朝夷暮跖 3 nr
+朝奉 22 v
+朝奉郎 2 nr
+朝奏夕召 3 nr
+朝奏暮召 3 nr
+朝宗 3 nz
+朝山 17 ns
+朝左边 3 ns
+朝庭 3 n
+朝廷 5174 ns
+朝思夕计 3 i
+朝思暮想 26 i
+朝成夕毁 3 nr
+朝成暮徧 3 nr
+朝成暮毁 3 nr
+朝成暮遍 3 i
+朝折暮折 3 i
+朝报 3 n
+朝拜 124 ns
+朝攀暮折 3 nr
+朝政 687 n
+朝文 3 nz
+朝斯夕斯 3 ns
+朝方 4 n
+朝日 105 n
+朝日新闻 3 nz
+朝日新闻社 3 nt
+朝晖 8 n
+朝晖路 3 nz
+朝暮 3 n
+朝曦 3 n
+朝更暮改 3 i
+朝服 232 n
+朝朝夕夕 3 i
+朝朝暮暮 11 i
+朝核问题 3 n
+朝梁暮周 3 i
+朝梁暮晋 3 nr
+朝梁暮陈 3 nr
+朝欢暮乐 3 i
+朝歌 14 n
+朝歌夜弦 3 i
+朝歌暮弦 3 i
+朝正 3 nz
+朝气 71 n
+朝气蓬勃 55 i
+朝海 3 ns
+朝献 3 n
+朝珠 29 n
+朝生夕死 3 i
+朝生夕灭 3 i
+朝生暮死 2 i
+朝着 797 p
+朝种暮获 3 i
+朝秦暮楚 7 i
+朝穿暮塞 3 i
+朝章国典 3 ns
+朝章国故 3 n
+朝纲 56 n
+朝经暮史 3 n
+朝聘 3 v
+朝臣 270 n
+朝花夕拾 3 i
+朝衣东市 3 ns
+朝西 3 ns
+朝西北 3 ns
+朝西南 3 ns
+朝西边 3 ns
+朝西面 3 n
+朝见 188 n
+朝觐 149 v
+朝觐者 13 n
+朝语 34 nz
+朝贡 104 ns
+朝贵 3 n
+朝贺 3 ns
+朝趁暮食 3 nr
+朝迁市变 3 n
+朝过夕改 3 i
+朝邑 2 ns
+朝里 99 ns
+朝野 341 ns
+朝野上下 3 i
+朝野两党 3 nt
+朝钟暮鼓 3 i
+朝锺暮鼓 3 nr
+朝闻 10 n
+朝闻夕改 3 i
+朝闻夕死 3 i
+朝闻道夕 3 i
+朝阳 767 ns
+朝阳丹凤 3 nz
+朝阳产业 3 n
+朝阳区 206 ns
+朝阳区教委 4 nt
+朝阳医院 8 nt
+朝阳县 5 ns
+朝阳市 19 ns
+朝阳花 3 ns
+朝阳路 4 ns
+朝阳镇 3 ns
+朝阳门 61 ns
+朝阳门外 16 ns
+朝阳鸣凤 3 ns
+朝陆地 3 n
+朝霞 203 ns
+朝露 17 v
+朝露溘至 3 z
+朝鲜 4488 ns
+朝鲜中央通讯社 5 nt
+朝鲜人 278 nz
+朝鲜人民军 107 nt
+朝鲜人民武装力量部 2 nt
+朝鲜劳动党 19 nt
+朝鲜劳动党中央 9 nt
+朝鲜劳动党中央委员会 4 nt
+朝鲜半岛 277 ns
+朝鲜外交部 3 nt
+朝鲜外务省 5 nt
+朝鲜战争 280 nz
+朝鲜政府 27 nt
+朝鲜文 10 nz
+朝鲜族 643 nz
+朝鲜民主主义人民共和国 63 nt
+朝鲜民主主义人民共和国政府 2 nt
+朝鲜泡菜 2 nz
+朝鲜语 36 nz
+朝鲜队 8 nt
+朝齑暮盐 3 nr
+期 6681 n
+期中 48 f
+期中考 3 j
+期中考试 3 j
+期于 3 v
+期交所 5 j
+期价 26 n
+期会 3 n
+期冀 6 j
+期内 161 f
+期刊 331 n
+期刊奖 3 n
+期刊室 3 n
+期刊杂志 3 n
+期刊流通 3 n
+期刊目录 3 n
+期刊管理 3 n
+期刊索引 3 n
+期刊网 3 n
+期刊论文 3 n
+期初 12 t
+期初余额 3 n
+期初存货 3 n
+期初数 3 n
+期压 3 n
+期市 2 n
+期待 1218 v
+期待值 7 n
+期待已久 3 i
+期房 26 n
+期指 14 n
+期收 3 v
+期数 5 n
+期日 3 t
+期望 1325 v
+期望值 158 n
+期望均方 3 n
+期期 3 f
+期期艾艾 19 i
+期末 179 t
+期末余额 3 n
+期末存货 3 n
+期末数 3 n
+期末考 3 n
+期末考试 3 n
+期末试卷 3 n
+期权 100 n
+期求 3 n
+期汇 3 n
+期满 276 v
+期特码 3 n
+期生 2 n
+期盼 254 v
+期票 24 n
+期约 3 n
+期终 8 t
+期终考 3 n
+期考 4 v
+期考成绩 3 n
+期许 31 v
+期评 3 v
+期货 421 n
+期货业 9 n
+期货交易 3 n
+期货价 3 n
+期货价格 3 n
+期货市场 3 n
+期货经纪 3 n
+期货网 3 n
+期门 3 n
+期间 14656 f
+期限 1389 n
+期限内 3 n
+期限表 3 n
+期颐 3 v
+期颐之寿 3 v
+朠 69 zg
+朡 6 zg
+朣 4 zg
+朦 30 a
+朦朦 16 z
+朦朦胧胧 105 z
+朦混 3 a
+朦胧 567 a
+朦胧派 3 n
+朦胧诗 12 n
+朦蔽 3 a
+朦骗 3 n
+木 6114 n
+木下 17 n
+木下惠 2 nr
+木下顺 5 nr
+木业 260 n
+木丛 2 n
+木主 3 n
+木乃伊 157 nr
+木之本 3 nr
+木之津 2 nr
+木乎乎 2 z
+木乐 3 n
+木亚科 2 nr
+木人 3 n
+木人儿 3 nr
+木人石心 3 n
+木仙庵 3 nr
+木伦河 33 nr
+木作 3 n
+木俑 3 n
+木偶 157 n
+木偶人 3 nr
+木偶剧 6 n
+木偶戏 27 n
+木偶戏扎 3 n
+木偶片 8 n
+木偶片儿 3 n
+木像 3 n
+木僵 18 n
+木儿亦 2 nr
+木儿代 2 n
+木儿入 2 nr
+木儿军 4 nr
+木儿拥 2 nr
+木儿朝 5 nr
+木儿继 2 nr
+木儿领 2 nr
+木兄弟 14 nr
+木克土 4 nr
+木克楞 3 n
+木公金母 3 n
+木兰 176 nr
+木兰军 3 nr
+木兰县 3 nr
+木兰拳 2 nr
+木兰科 26 nr
+木兰花 12 nr
+木冰川 2 nr
+木凤衔 128 nr
+木凳 15 n
+木制 230 n
+木制品 20 n
+木制器具 3 n
+木制大槌 3 n
+木制家具 3 n
+木刻 149 n
+木刻本 2 n
+木刻术 3 n
+木刻水印 3 n
+木刻画 5 n
+木剌夷 7 nr
+木剑 96 nr
+木剑击 4 nr
+木剑可 2 nr
+木剑如 2 nr
+木剑方 2 nr
+木剑正 2 nr
+木剑破 2 nr
+木剑胜 2 nr
+木剑递 2 nr
+木化石 3 nr
+木匠 415 n
+木匠活 11 n
+木匣 44 n
+木匾 3 n
+木华黎 55 nr
+木卓伦 157 nr
+木卡姆 32 nr
+木卫三 2 nr
+木卫二 20 nr
+木卫四 2 nr
+木卫影 2 nr
+木厂 3 n
+木原 6 n
+木变石 2 nr
+木古鲁 2 nr
+木叶 20 n
+木叶蝶 3 nr
+木合 16 n
+木合安 2 nr
+木吉他 2 ns
+木吒 4 nrt
+木呆呆 9 z
+木呐 3 n
+木器 75 n
+木器厂 3 n
+木器店 3 n
+木器漆 3 n
+木土 4 n
+木地板 14 n
+木坏山颓 3 l
+木块 25 n
+木型 2 b
+木垒 7 n
+木垒哈萨克自治县 2 ns
+木城涧 3 nr
+木域 3 n
+木塑 3 n
+木塞 23 nr
+木塞塞 2 nr
+木塞子 3 nr
+木墙 3 n
+木大侠 2 nr
+木夯 3 nr
+木头 748 n
+木头人 31 n
+木头人儿 5 n
+木头木脑 3 i
+木头疙瘩 3 l
+木姊姊 6 nr
+木姜子 6 nr
+木婉清 643 nr
+木子 7 n
+木子李 3 nr
+木子版 3 n
+木子美 6 nr
+木字旁 2 nr
+木家具 3 n
+木尔图 2 nr
+木尔坦 11 nr
+木尼河 3 nr
+木屋 198 n
+木屐 42 n
+木屑 75 n
+木屑板 3 n
+木展声 2 nr
+木履 2 nr
+木岛主 18 nr
+木工 1551 n
+木工机械 3 n
+木工板 3 n
+木工活 3 n
+木工车间 3 n
+木已成舟 26 i
+木帆船 19 nr
+木希典 6 nr
+木干鸟栖 3 nr
+木床 17 n
+木库莲 27 nr
+木底鞋 4 n
+木庭 3 n
+木式 2 n
+木弓弩 2 nr
+木征 3 n
+木德星 3 nr
+木心 3 n
+木心石腹 3 n
+木成堰 2 nr
+木户 3 n
+木户孝 3 nr
+木房 3 n
+木扎勒 3 nr
+木扎尔 3 nr
+木扎特 2 nr
+木托盘 3 n
+木拉山 2 nr
+木拖鞋 3 n
+木排 51 n
+木文察 8 nr
+木斗 2 n
+木料 197 n
+木料行 3 n
+木旋 2 n
+木星 229 n
+木木地 2 n
+木木的 8 nr
+木本 89 n
+木本植物 42 n
+木本水源 3 n
+木本油料 3 n
+木札勒 4 nr
+木札尔 4 nr
+木机 2 n
+木朽蛀生 3 n
+木杆 56 n
+木材 2435 n
+木材业 3 n
+木材加工业 13 n
+木材厂 135 n
+木材干馏 3 n
+木材行 3 n
+木村 9 n
+木村佳乃 3 nr
+木村兵 3 nr
+木村拓哉 3 nr
+木杖 5 n
+木杠 5 n
+木条 76 n
+木板 653 n
+木板凳 3 n
+木板地 3 n
+木板墙 6 n
+木板床 14 n
+木板房 18 n
+木板桥 2 nr
+木板门 9 n
+木构 168 n
+木林 4 nr
+木架 61 n
+木柄 25 n
+木柜 13 n
+木柱 221 nr
+木柴 83 n
+木栅 37 n
+木栅区 3 n
+木栅国中 3 nr
+木栅国小 3 n
+木栅门 5 n
+木栏 11 n
+木栓 18 n
+木栓层 8 n
+木核 3 n
+木根如 2 nr
+木栺 3 z
+木格 13 n
+木格儿 2 nr
+木框 19 n
+木桌 36 n
+木桑喜 2 nr
+木桑师 3 nr
+木桑怒 2 nr
+木桑摇 2 nr
+木桑道 16 nr
+木桑道人 44 nr
+木桑道长 3 nr
+木桥 51 nr
+木桨 43 n
+木桩 124 n
+木桶 94 n
+木梁均 128 nr
+木梁柱 2 nr
+木梆声 4 n
+木梗之患 3 n
+木梯 23 n
+木梯摇 2 nr
+木梳 26 b
+木棉 82 n
+木棉树 12 nr
+木棉花 18 n
+木棍 313 n
+木棍子 11 n
+木棒 361 n
+木棚 13 n
+木棚顶 2 nr
+木棺 3 n
+木椅 48 n
+木椎 3 n
+木楔 6 n
+木楼 12 n
+木榄 2 n
+木槌 19 n
+木槽 5 n
+木槿 14 nr
+木槿花 22 nr
+木模 13 n
+木樨 7 nr
+木樨园 3 vn
+木樨地 2 z
+木母 2 n
+木波罗 2 nr
+木浆 26 n
+木渎镇 2 ns
+木灵星 2 nr
+木炕木 2 nr
+木炭 168 n
+木炭机 3 n
+木炭画 3 n
+木焦油 3 n
+木然 123 b
+木煤气 3 n
+木片 47 n
+木版 64 n
+木版印画 3 n
+木版画 26 n
+木牌 374 n
+木牛流马 40 ns
+木犀 11 nr
+木犀科 14 nr
+木犀肉 3 n
+木王鼎 28 nr
+木琴 17 nr
+木瓜 104 n
+木瓜树 3 nr
+木瓜溪 3 nr
+木瓜粉 3 nr
+木瓢 2 n
+木瓦 3 nr
+木留克 4 nr
+木皮 4 n
+木盆 6 n
+木盒 332 n
+木盘 3 n
+木盘托 3 n
+木知木 6 nr
+木石 33 n
+木石塞 2 nr
+木石心肠 3 n
+木砖地面 3 n
+木碗 15 n
+木神决 3 nr
+木禅师 3 nr
+木秀石 2 nr
+木窗 11 n
+木立 2 nr
+木竹石 2 nr
+木笔 9 n
+木笼 20 n
+木筏 194 n
+木筏子 3 nr
+木筒 3 n
+木筷 3 n
+木简 23 nr
+木管 11 n
+木管乐器 18 n
+木箭 3 n
+木箱 154 n
+木粉 3 n
+木粱 3 n
+木精 4 n
+木糖 17 n
+木糖醇 107 n
+木系 3 n
+木素尔 2 nr
+木纹 13 n
+木线条 3 n
+木结构 507 n
+木结绳 3 n
+木绵树 3 nr
+木罗汉 3 nr
+木耙 3 n
+木耳 199 nr
+木耳菜 3 n
+木胎 2 n
+木腐菌 2 n
+木腰子 3 n
+木舟 2 nr
+木船 152 n
+木色 2 n
+木节 3 n
+木芙蓉 10 nr
+木花 3 n
+木荷 20 n
+木莲 12 nr
+木菠萝 5 n
+木落归本 3 n
+木薄壁 4 nr
+木薯 132 n
+木蚂蚁 3 l
+木蝴蝶 3 nr
+木螺钉 2 nr
+木表法 3 n
+木讷 52 z
+木讷寡言 3 z
+木谷实 2 nr
+木豆 3 n
+木贝司 2 nr
+木质 381 n
+木质制品 3 n
+木质素 32 n
+木质茎 3 n
+木质部 105 n
+木贼 20 n
+木车 2 n
+木轮 22 n
+木运 4 n
+木迭儿 5 nr
+木通 8 nr
+木通科 5 nr
+木造 3 n
+木部 3 n
+木里 8 n
+木里苔 2 nr
+木里藏族自治县 2 ns
+木金土 2 n
+木钉 11 n
+木锉 3 n
+木锤 3 nr
+木锥 3 n
+木锨 17 n
+木锹 3 n
+木门 66 n
+木雕 461 n
+木雕像 3 n
+木雕工 3 n
+木雕泥塑 12 i
+木霉菌属 3 n
+木霉菌素 3 n
+木鞋 4 n
+木须肉 3 n
+木香 29 nr
+木马 76 n
+木马病毒 3 n
+木马程序 3 n
+木马计 2 nr
+木驴 3 n
+木骨 2 n
+木髓 3 n
+木高峰 79 nr
+木鱼 109 n
+木鱼石 3 nr
+木鲁克 2 nr
+木鳖子 2 n
+木鸡 5 n
+木鸡养到 3 l
+木麻黄 25 nr
+木鼓 5 n
+木龙骨 3 nr
+未 16803 d
+未上 3 t
+未上市 3 v
+未上栓 3 n
+未下 3 t
+未为不可 9 i
+未久 3 t
+未之有焉 3 i
+未乱 3 d
+未了 275 t
+未了公案 3 i
+未了心愿 3 i
+未了情 3 i
+未了缘 3 i
+未予 3 v
+未亏 3 d
+未亡 3 v
+未亡人 3 n
+未交 3 v
+未付 3 v
+未供认 3 l
+未便 35 d
+未修改 3 v
+未免 993 d
+未免太 3 n
+未免太不 3 l
+未免太有 3 v
+未免太没 3 i
+未兑 3 v
+未入帐 3 i
+未公开 3 i
+未再 3 d
+未决 82 v
+未决犯 5 v
+未准 3 v
+未几 43 d
+未出 3 v
+未出去 3 v
+未分 3 d
+未分离 3 i
+未分类 3 n
+未分裂 3 i
+未分选 3 n
+未切割 3 i
+未列 3 v
+未列计划 3 n
+未判 3 v
+未到人数 3 l
+未剃须 3 n
+未办 3 v
+未办理 3 n
+未加 3 d
+未加工 3 n
+未动 3 v
+未卖 3 v
+未卜 46 v
+未卜先知 25 i
+未占领 3 n
+未卸下 3 i
+未去 3 t
+未及 325 v
+未发表过 3 l
+未取 3 v
+未受惩罚 3 i
+未受抑制 3 n
+未受指导 3 n
+未受损伤 3 i
+未受控制 3 n
+未受教育 3 l
+未受理 3 i
+未受警告 3 n
+未受质疑 3 i
+未受邀请 3 v
+未受阻 3 i
+未变 3 v
+未可厚非 5 i
+未可知 3 i
+未同 3 d
+未名 6 v
+未名湖 27 ns
+未名湖畔 12 ns
+未名社 2 l
+未名站 3 n
+未含 3 v
+未含税 3 n
+未命名 3 n
+未和解 3 i
+未在 3 t
+未填写 3 i
+未声明 3 i
+未处理 3 v
+未备案 3 n
+未央 24 n
+未央区 3 n
+未央宫 32 n
+未央路 3 n
+未夸张 3 i
+未妥 3 v
+未始 57 v
+未始不可 3 i
+未娶 3 v
+未婚 210 v
+未婚先孕 3 n
+未婚同居 3 i
+未婚夫 50 n
+未婚妻 83 n
+未婚者 3 n
+未嫁 3 v
+未嫁新娘 3 n
+未完再续 3 i
+未完待续 3 i
+未完结 3 l
+未定 227 d
+未定义 3 n
+未定之天 3 i
+未定数 3 n
+未定稿 5 n
+未定角 3 n
+未定论 5 n
+未审核 3 n
+未尝 405 d
+未尝不可 3 i
+未尽 3 d
+未尽事宜 3 i
+未建造 3 l
+未开化 3 v
+未开发区 3 n
+未开垦 3 v
+未归 3 v
+未归人 3 i
+未归类 3 i
+未形之患 3 i
+未征 3 v
+未得缓和 3 i
+未必 2872 d
+未必尽然 3 i
+未愈 79 d
+未意之志 3 i
+未感染 3 i
+未成 3 v
+未成一篑 3 i
+未成交 3 i
+未成年 146 l
+未成年人 192 l
+未成年工 5 l
+未成形 3 n
+未成熟 3 i
+未战 3 v
+未战先衰 3 i
+未战先败 3 i
+未战先退 3 i
+未戴 3 v
+未扣 3 v
+未扫清 3 i
+未批准 3 n
+未找到 3 l
+未抄 3 v
+未抵 3 d
+未指定 3 l
+未损坏 3 v
+未换 3 v
+未接 3 v
+未推动 3 i
+未掩蔽 3 v
+未揭露 3 i
+未收 3 v
+未收割 3 i
+未改 3 v
+未敢 3 d
+未敢苟同 3 i
+未整理 3 n
+未时 3 t
+未明 3 t
+未明求衣 3 i
+未曾 822 d
+未有 460 v
+未本着 3 d
+未来 6069 t
+未来主义 42 n
+未来型 3 n
+未来学 14 l
+未来式 3 d
+未来战士 3 nz
+未来派 7 n
+未果 109 n
+未查 3 v
+未标明 3 n
+未武装 3 n
+未注册 3 i
+未注册版 3 n
+未注明 3 i
+未泯 3 l
+未消化 3 n
+未涨 3 v
+未涨反跌 3 l
+未深 3 t
+未清算 3 l
+未满 3 v
+未演 3 v
+未演出 3 l
+未激活 3 i
+未灭 3 v
+未炒 3 v
+未点燃 3 v
+未烙 3 n
+未焚徙薪 3 i
+未然 4 d
+未煮过 3 i
+未熟 3 v
+未熟期 3 n
+未用 3 v
+未用尽 3 i
+未用过 3 v
+未留 3 v
+未留下 3 t
+未登记 3 i
+未登陆 3 ns
+未盼 3 v
+未眠 156 v
+未眠夜 3 t
+未知 565 v
+未知万一 3 i
+未知事件 3 n
+未知数 130 i
+未知量 18 n
+未知领域 3 l
+未破解 3 i
+未确定 3 d
+未确证 3 n
+未税 3 v
+未竟 31 d
+未竟之业 3 i
+未竟之志 5 i
+未竟事业 3 i
+未算 3 v
+未粘牢 3 n
+未精炼 3 i
+未纯化 3 i
+未纳 3 v
+未经 679 d
+未经审查 3 n
+未经宣布 3 nz
+未经思考 3 l
+未经承认 3 l
+未经检验 3 n
+未经耕作 3 i
+未经要求 3 l
+未经许可 3 i
+未经请求 3 n
+未结 3 v
+未结算 3 v
+未缓和 3 i
+未置 3 v
+未置可否 3 i
+未羊 2 t
+未翻转 3 i
+未老先衰 13 i
+未考好 3 l
+未联合 3 n
+未能 1455 v
+未能免俗 11 i
+未能如愿 3 i
+未能幸免 3 i
+未能得逞 3 i
+未能忘怀 3 i
+未腐败 3 v
+未艾方兴 3 ns
+未获 3 v
+未获奖 3 nz
+未补 3 v
+未被发现 3 i
+未被告知 3 i
+未被打过 3 i
+未被承认 3 i
+未被拦阻 3 vn
+未被觉察 3 vn
+未被证明 3 i
+未裂开 3 l
+未见其人 3 i
+未见分晓 3 i
+未见好转 3 i
+未见异常 3 i
+未见得 26 d
+未见有人 3 i
+未见行 3 v
+未觅 3 v
+未觉 3 d
+未解释 3 n
+未记录 3 n
+未识一丁 3 i
+未试过 3 v
+未详 13 v
+未说明 3 v
+未贴 3 v
+未足为道 3 i
+未足轻重 3 i
+未跌 3 v
+未跌反涨 3 l
+未达标 3 l
+未退 3 v
+未退反进 3 i
+未递 3 v
+未通 3 v
+未遂 113 v
+未遂政变 3 l
+未遂案 2 n
+未遂犯 6 i
+未遭 30 v
+未配对 3 i
+未错 3 v
+未长成 3 i
+未闻 3 n
+未附 3 v
+未陈旧 3 i
+未降 3 v
+未降反升 3 l
+未雨绸缪 91 i
+未预料到 3 l
+未预见到 3 l
+未领 3 v
+未风先雨 3 i
+未驯服 3 z
+末 5409 f
+末世 29 n
+末世论 3 n
+末了 191 t
+末代 98 t
+末代皇帝 3 n
+末伏 3 t
+末位 14 n
+末儿 5 n
+末叶 15 t
+末后 29 f
+末声 3 n
+末大不掉 3 l
+末大必折 3 l
+末如之何 3 l
+末始 3 n
+末子 10 n
+末学 3 n
+末学肤受 3 n
+末尾 72 n
+末尾数 3 n
+末席 5 n
+末年 906 t
+末座 19 n
+末技 3 n
+末日 173 t
+末日审判 3 n
+末日来临 3 l
+末日浩劫 3 l
+末期 590 f
+末末尾儿 3 n
+末枝 3 n
+末梢 93 n
+末梢神经 8 l
+末段 53 n
+末流 18 n
+末班 5 n
+末班车 27 n
+末离时 3 n
+末稍 3 d
+末端 516 f
+末端标记 3 n
+末端补平 3 l
+末端距 3 n
+末端酶 3 l
+末端阀 3 l
+末笔 3 n
+末节 33 t
+末节细行 3 n
+末药 3 n
+末行 3 n
+末路 14 n
+末路之难 3 l
+末路穷途 3 n
+末速度 3 n
+本 42207 r
+本专科 44 nr
+本专科生 7 l
+本专题 3 n
+本世纪 553 t
+本世纪内 3 t
+本世纪初 3 t
+本世纪末 3 t
+本业 123 n
+本丛书 3 n
+本主 10 n
+本主儿 3 n
+本义 40 n
+本乎 3 d
+本乡 51 r
+本乡本土 18 n
+本书 1225 r
+本事 1566 r
+本亚科 4 nz
+本人 4096 r
+本人成分 3 l
+本件 3 n
+本价 3 n
+本位 165 r
+本位主义 12 n
+本位币 3 n
+本位货币 11 n
+本体 258 n
+本体感 4 n
+本体论 66 n
+本例 3 n
+本俸 3 n
+本儿 5 r
+本元 3 t
+本光盘 3 n
+本党 3 r
+本册 2 n
+本分 285 d
+本分人 9 n
+本刊 99 r
+本初 29 t
+本初子午线 28 nz
+本利 32 n
+本利和 3 nz
+本剑谱 6 nr
+本剧 10 r
+本力远 2 nr
+本务 3 n
+本区 208 n
+本协定 3 nz
+本卡 3 n
+本厂 8 n
+本厅 3 n
+本原 148 n
+本原演绎 3 nr
+本县 147 r
+本参 3 n
+本发明 3 nz
+本台消息 3 n
+本台记者 3 n
+本合同 3 n
+本吉本 2 ns
+本同末异 3 i
+本同末离 3 i
+本名 168 n
+本周 210 t
+本周一 54 n
+本命 9 nz
+本命年 11 n
+本品 3 n
+本商店 3 n
+本商行 3 j
+本嗓 3 n
+本器具 3 n
+本团 3 n
+本园 5 n
+本固枝荣 3 nr
+本固邦宁 3 nr
+本国 1428 r
+本国产 3 n
+本国语 3 nz
+本国货币 3 n
+本土 952 n
+本土化 74 n
+本土型 3 n
+本地 1918 r
+本地下载 3 i
+本地产 3 j
+本地人 124 n
+本地加电 3 nz
+本地化 73 j
+本地性 3 n
+本地播放 3 nz
+本地用户 3 n
+本地网 3 nz
+本地网络 3 n
+本地股 3 n
+本地连接 3 i
+本地通 3 nz
+本地风光 3 nz
+本场 378 n
+本垒 8 n
+本垒打 11 nz
+本城 34 r
+本埠 5 n
+本堂 18 n
+本堂香 9 nr
+本处 3 r
+本外币 4 n
+本套 3 r
+本奥鲁 3 nr
+本子 219 n
+本字 4 n
+本季 12 t
+本季度 3 n
+本学年 3 n
+本学期 3 n
+本学科 3 nz
+本宁堡 4 ns
+本官 3 n
+本室 3 n
+本宫 3 n
+本宫广志 3 nr
+本家 93 r
+本家儿 3 r
+本寺僧 2 nr
+本小利大 3 nr
+本小利微 2 nr
+本少爷 3 nr
+本尼 2 nrt
+本尼迪克 10 nrt
+本局 4 n
+本届 755 r
+本山 29 ns
+本岗 3 n
+本岛 105 n
+本岛人 3 n
+本岛居民 3 nr
+本州 178 r
+本州岛 20 ns
+本巴 3 n
+本巷 3 n
+本币 10 n
+本市 1489 n
+本帅 14 n
+本师 3 n
+本帖 3 n
+本席 3 n
+本年 86 t
+本年度 3 n
+本底 5 t
+本底计数 3 n
+本底辐射 3 nz
+本店 6 n
+本府 3 n
+本庭 3 n
+本廷克 2 nr
+本异译 2 nr
+本强基 2 nr
+本当 43 d
+本影 32 n
+本征函数 3 n
+本征振动 3 i
+本征矢量 3 i
+本征频率 3 n
+本律师 3 nr
+本德 5 t
+本心 31 n
+本性 808 n
+本性难移 21 i
+本息 77 n
+本惑 3 v
+本意 431 d
+本愿经 3 n
+本戏 7 n
+本户 3 n
+本房源 3 n
+本所同仁 3 i
+本手册 3 n
+本报 5675 r
+本报讯 3 nz
+本报记者 3 n
+本拉登 3 nrt
+本招股 3 n
+本支百世 3 i
+本数 3 n
+本文 506 r
+本方 28 r
+本族 3 nz
+本族语 12 nz
+本无树 3 nr
+本日 43 t
+本旨 3 n
+本明和尚 2 n
+本月 1510 t
+本月份 3 t
+本月底 27 t
+本期 310 t
+本期发生 3 n
+本期损益 3 n
+本期累计 3 l
+本未倒置 3 i
+本末 78 t
+本末倒置 27 i
+本末源流 3 n
+本末相顺 3 i
+本末终始 3 i
+本本 84 n
+本本主义 24 n
+本本分分 2 n
+本本水源 3 n
+本机 3 n
+本机振荡 3 i
+本村 124 r
+本条 23 r
+本来 7161 t
+本来面目 143 i
+本杰明 11 nr
+本枝百世 3 i
+本栏 35 r
+本校 288 r
+本校生 3 n
+本格拉 21 nrt
+本案 91 r
+本次 3039 r
+本款 3 n
+本段 3 t
+本民 3 n
+本法 153 n
+本洋 7 n
+本洲 3 ns
+本深末茂 3 i
+本港 31 r
+本港台 3 n
+本源 58 n
+本溪 90 nz
+本溪县 3 ns
+本溪市 49 ns
+本溪满族自治县 4 ns
+本然 3 d
+本片 25 n
+本版 635 r
+本版区 3 n
+本物 3 n
+本特 20 nrt
+本特利 5 nz
+本特松 3 nr
+本班 8 n
+本生 3 n
+本生灯 10 n
+本田 43 nz
+本田四明 3 nz
+本田技研 4 n
+本田雅阁 3 nr
+本留言 3 n
+本病 157 r
+本益比 3 n
+本相 123 d
+本相毕露 3 i
+本省 717 r
+本真 20 nz
+本着 350 p
+本督帅 11 n
+本硕博 8 nr
+本硕连 27 nr
+本社 50 n
+本社讯 3 n
+本神 3 n
+本票 24 n
+本种 3 r
+本科 2853 r
+本科专业 3 j
+本科学历 3 nz
+本科文凭 3 nr
+本科文化 3 nz
+本科段 244 n
+本科毕业 3 n
+本科班 2 nz
+本科生 460 nz
+本科课程 3 n
+本站 24 n
+本章 799 r
+本笃会 7 n
+本篇 23 r
+本籍 3 n
+本类 3 r
+本系 3 n
+本级 10813 r
+本纪 176 t
+本线 3 n
+本组 9 r
+本细则 3 n
+本网将 3 n
+本网页 3 n
+本署 3 n
+本职 51 n
+本职工作 136 n
+本联 3 nz
+本能 571 n
+本能寺 3 nr
+本能行为 3 n
+本舰 3 n
+本船 3 n
+本色 265 n
+本节 3 t
+本苗圃 3 nr
+本茨 12 nrt
+本草 92 n
+本草纲目 56 n
+本草经 3 n
+本菲卡 2 nr
+本薪 3 n
+本行 56 r
+本行业 11 n
+本行政区域 3850 n
+本表 11 n
+本西德 9 nr
+本观 3 n
+本规程 3 n
+本论 3 n
+本论坛 3 n
+本词典 3 n
+本该 209 d
+本该如此 3 i
+本课 3 n
+本质 2064 n
+本质区别 3 n
+本质属性 3 n
+本质性 9 n
+本质特征 3 n
+本质论 7 n
+本贯州 2 nr
+本赛 6 n
+本赛季 3 nr
+本身 5446 r
+本轮 365 r
+本轻利厚 3 i
+本辞典 3 n
+本迪克斯 2 nrt
+本部 477 r
+本里 3 r
+本金 109 n
+本钢 33 n
+本钱 235 n
+本钱雄厚 3 i
+本键 3 n
+本镇 115 r
+本门武 2 nr
+本队 63 n
+本阵 3 n
+本院 44 n
+本院认为 3 n
+本雅明 11 nr
+本项 12 r
+本顿 2 nrt
+本领 1374 n
+本频道 3 n
+本题 81 n
+本馆 10 n
+札 524 zg
+札实 3 n
+札幌 12 ns
+札幌市 4 ns
+札手舞脚 3 n
+札木合 3 ns
+札记 96 n
+札达 4 nrt
+札达县 3 ns
+朮 8 zg
+术 3122 v
+术业 3 n
+术前 3 t
+术前模型 3 n
+术后 333 t
+术士 28 n
+术学 2 n
+术家 5 n
+术小 3 n
+术数 3 n
+术科 37 n
+术者 16 n
+术语 451 n
+术语空间 3 n
+术语表 3 n
+术赤 3 n
+朱 7218 nr
+朱七七 3 nr
+朱三太 3 nr
+朱三太子 54 nr
+朱三弟 2 nr
+朱三松 3 nr
+朱世杰 26 nr
+朱世赫 3 nr
+朱东润 4 nr
+朱两军 2 nr
+朱丹溪 4 nr
+朱丹臣 193 nr
+朱丽亚 3 nr
+朱丽倩 3 nr
+朱丽兰 261 nr
+朱丽叶 71 nr
+朱丽娅 3 nr
+朱乃正 10 nr
+朱之瑜 2 nr
+朱之鑫 3 nr
+朱乐平 2 nr
+朱九真 126 nr
+朱书麟 3 nr
+朱买臣 7 nr
+朱二人 4 nr
+朱二侠 2 nr
+朱二哥 4 nr
+朱云龙 9 nr
+朱五太子 4 nr
+朱亚男 3 nr
+朱亦松 2 nr
+朱京津 4 nr
+朱亮祖 24 nr
+朱今明 6 nr
+朱从玖 2 nr
+朱仙庄 7 nr
+朱仙镇 216 nr
+朱仝心 2 nr
+朱仝怒 2 nr
+朱仝正 2 nr
+朱以海 3 nr
+朱佑兰 3 nz
+朱作霖 2 nr
+朱保国 2 nr
+朱信泉 15 nr
+朱元彰 3 nr
+朱元津 4 nr
+朱元漳 3 nr
+朱元琮 2 nr
+朱元璋 2494 nr
+朱元章 2 nr
+朱先生 176 nr
+朱光亚 279 nr
+朱光卿 2 nr
+朱光庭 3 nr
+朱光沐 7 nr
+朱光潜 15 nr
+朱克川 12 nr
+朱克曼 2 nr
+朱克柔 7 nr
+朱克潜 5 nr
+朱全忠 27 nr
+朱全水 7 nr
+朱公子 3 nr
+朱军冯 2 nr
+朱冬菊 2 nr
+朱凯生 38 nr
+朱利亚 8 nr
+朱利叶 10 nr
+朱利奥 2 nr
+朱利安 11 nr
+朱利宏 6 nr
+朱利诺 2 nr
+朱剑慧 2 nr
+朱剑红 6 nr
+朱力亚 50 nr
+朱勒迪 2 nr
+朱化麟 3 nr
+朱华奎 2 nr
+朱华荣 5 nr
+朱厚照 331 nr
+朱厚磐 128 nr
+朱友贞 7 nr
+朱友麟 2 nr
+朱发兰 2 nr
+朱古力 10 nr
+朱古力糖 3 nr
+朱古律糖 3 nr
+朱古达 3 nr
+朱可夫 48 nr
+朱可娃 2 nr
+朱右曾 5 nr
+朱右选 2 nr
+朱名子 2 nr
+朱启桢 6 nr
+朱启祯 8 nr
+朱启钤 13 nr
+朱启铃 2 nr
+朱呈祥 12 nr
+朱员外 3 nr
+朱哲琴 3 nr
+朱唇微 2 nr
+朱唇榴齿 3 n
+朱唇玉面 3 nr
+朱唇皓齿 3 i
+朱唇粉面 3 n
+朱善卿 2 nr
+朱四哥 9 nr
+朱国伟 8 nr
+朱国军 2 nr
+朱国桢 5 nr
+朱国治 4 nr
+朱国祯 2 nr
+朱国荣 6 nr
+朱圣华 5 nr
+朱培德 11 nr
+朱培纯 3 nr
+朱塔玛 3 nr
+朱增泉 2 nr
+朱墨 6 nr
+朱大人 9 nr
+朱大典 19 nr
+朱大叔 9 nr
+朱大可 2 nr
+朱大哥 20 nr
+朱大娘 36 nr
+朱大定 2 nr
+朱大昀 2 nr
+朱天光 5 nr
+朱天部 5 nr
+朱太尉 7 nr
+朱夫人 9 nr
+朱夫子 2 nr
+朱姊姊 21 nr
+朱姓藩 2 nr
+朱姨娘 6 nr
+朱威廉 3 nr
+朱娟 4 nrfg
+朱媚筠 13 nr
+朱媛媛 3 nr
+朱子 17 nr
+朱子之 6 nr
+朱子学 2 nr
+朱子新 3 nr
+朱子柳 417 nr
+朱子语 17 nr
+朱子道 2 nr
+朱孝天 3 nr
+朱孟昌 2 nr
+朱孟春 42 nr
+朱学勤 4 nr
+朱学范 7 nr
+朱安国 28 nr
+朱安璋 2 nr
+朱宏嘉 3 nr
+朱官屯 2 nr
+朱宝意 3 nr
+朱宪火 2 nr
+朱家 93 nrfg
+朱家军 2 nr
+朱家华 2 nr
+朱家印 4 nr
+朱家宝 2 nr
+朱家寨 36 nr
+朱家尖 4 nr
+朱家庄 4 nr
+朱家村 3 nr
+朱家江山 2 nr
+朱家渡 256 nr
+朱家班 4 nr
+朱家纬 2 nr
+朱家角 3 nr
+朱家骅 8 nr
+朱宸濠 145 nr
+朱容基 8 nr
+朱富贤 2 nr
+朱小元 3 nr
+朱小兰 2 nr
+朱少连 2 nr
+朱尔典 3 nr
+朱尔朱 3 nr
+朱屺瞻 5 nr
+朱崇君 3 nr
+朱巴河 14 nr
+朱师傅 9 nr
+朱师叔 6 nr
+朱师弟 8 nr
+朱希孝 30 nr
+朱希彩 5 nr
+朱希忠 4 nr
+朱希祖 7 nr
+朱常棣 2 n
+朱常洛 59 nr
+朱常洵 18 nr
+朱常浩 3 nr
+朱常瀛 2 nr
+朱常询 9 nr
+朱干玉威 3 nr
+朱干玉戚 3 nr
+朱幼棣 15 n
+朱幼麟 2 nr
+朱广沪 12 nr
+朱庄坝 2 nr
+朱庆永 2 nr
+朱庆道 10 nr
+朱庇特 6 nr
+朱延寿 8 nr
+朱延平 3 nr
+朱延清 37 nr
+朱建华 6 nr
+朱建国 5 nr
+朱建安 3 nr
+朱建嵩 2 nr
+朱建锋 4 nr
+朱开轩 7 nr
+朱异来 2 nr
+朱弦三叹 3 nr
+朱弦疏越 3 nr
+朱彝尊 23 nr
+朱彤 2 nrfg
+朱彦军 5 nr
+朱微微 3 nr
+朱德 902 nr
+朱德峰 2 nr
+朱德庸 3 nrfg
+朱德承 3 nr
+朱德润 2 nr
+朱德熙 3 nr
+朱志刚 5 nr
+朱志怡 2 nr
+朱怀冰 2 nr
+朱思本 14 nr
+朱总司令 2 nr
+朱总理 3 nr
+朱恩涛 12 nr
+朱恺琳 2 nr
+朱慈娘 2 nr
+朱慈焕 3 nr
+朱慧敏 3 nr
+朱慧松 2 nr
+朱慧谦 3 nr
+朱成矩 74 nr
+朱成虎 3 nr
+朱才威 5 nr
+朱执信 16 nr
+朱批 19 b
+朱拉侯 3 nr
+朱拉湾 5 nr
+朱拉隆功 4 nr
+朱拉隆功大学 4 nt
+朱拉霍 9 nr
+朱拜勒 3 nr
+朱拜尔 2 nr
+朱拱之 7 nr
+朱振中 2 nr
+朱敬则 2 nr
+朱文 42 nr
+朱文公 4 nr
+朱文正 33 nr
+朱文玉 3 nr
+朱文臣 7 nr
+朱旭东 3 nr
+朱旭锦 2 nr
+朱时茂 2 nr
+朱昌祚 5 nr
+朱昌骏 8 nr
+朱明江山 3 nr
+朱明瑛 2 nr
+朱明荣 2 nr
+朱明门 2 nr
+朱春全 4 nr
+朱晨日 5 nr
+朱智勋 3 nr
+朱智堂 2 nr
+朱智贤 2 nr
+朱月仪 2 nr
+朱木匠 6 nr
+朱木纳 2 nr
+朱松邻 4 nr
+朱柳桥 2 nr
+朱栏玉 2 nr
+朱栏白 2 nr
+朱校长 3 nr
+朱格朱 4 nr
+朱桂全 2 nr
+朱桓引 2 nr
+朱梦魁 25 n
+朱棣 3 ns
+朱棣文 6 nrfg
+朱森林 5 nr
+朱楹青 2 nr
+朱楼碧瓦 3 nr
+朱楼绮户 3 vn
+朱榛 3 nrfg
+朱槃玉敦 3 ns
+朱槿 3 nr
+朱武二 3 nr
+朱武祥 3 nr
+朱永新 4 nr
+朱求桂 6 nr
+朱汉东 10 nr
+朱治宏 2 nr
+朱泰祺 6 nr
+朱洛筠 3 nr
+朱洪武 32 nr
+朱海森 3 nr
+朱淇兄 4 nr
+朱淇吓 2 nr
+朱清时 12 nr
+朱温 99 nr
+朱温代 2 nr
+朱温和 3 nr
+朱温建 3 nr
+朱温灭 8 nr
+朱温部 2 nr
+朱温降 3 nr
+朱滔留 3 nr
+朱满庭 2 nr
+朱漆 248 n
+朱然引 2 nr
+朱煜 10 nrfg
+朱熔基 6 nr
+朱熹 367 nr
+朱玉霞双 2 nr
+朱现平 2 nr
+朱玲玲 3 nr
+朱瑞巷 2 nr
+朱甍碧瓦 3 nr
+朱生豪 4 nr
+朱由俭 2 nr
+朱由校 52 nr
+朱由检 30 nr
+朱白氏 81 nr
+朱皇后 3 nr
+朱皇帝 3 nr
+朱盘玉敦 3 nr
+朱相远 257 nr
+朱睛冰 10 nr
+朱瞻基 106 nr
+朱石麟 3 nr
+朱砂 369 nr
+朱砂七 3 nr
+朱砂根 3 nr
+朱砂莲 3 nr
+朱碧二 8 nr
+朱碧双 7 nr
+朱碧山 3 nr
+朱祁钰 216 nr
+朱祁镇 382 nr
+朱祖荫 20 nr
+朱祖谋 2 nr
+朱祝荣 2 nr
+朱穆之 4 nr
+朱窝儿 2 nr
+朱立元 3 nr
+朱竞若 2 nr
+朱章义 17 nr
+朱端钧 2 nr
+朱笔 218 nr
+朱素甫 4 nr
+朱紫国 13 nr
+朱紫难别 3 nr
+朱红 618 nr
+朱红灯 3 nr
+朱红色 3 nr
+朱纯臣 3 nr
+朱绍文 4 nr
+朱统缬 7 nr
+朱绣入 2 nr
+朱维京 2 nr
+朱罗纪 3 nr
+朱翊钧 1029 nr
+朱翊铭 5 nr
+朱老四 2 nr
+朱老总 2 nr
+朱老板 2 nr
+朱聪叹 2 nr
+朱聪心 2 nr
+朱聪教 2 nr
+朱聪笑 17 nr
+朱聪见 5 nr
+朱聪轻 2 nr
+朱育理 2 nr
+朱胖子 3 nr
+朱胜非 3 nr
+朱自清 21 nrfg
+朱至珍 3 nr
+朱舜水 4 nr
+朱色 7 nr
+朱芳雨 20 nr
+朱荣之 2 nr
+朱荣先 2 nr
+朱荣部 3 nr
+朱莉亚 3 nr
+朱莲芬 3 nr
+朱葆三 6 nr
+朱蕴山 2 nr
+朱虚侯 9 nr
+朱衡劝 2 nr
+朱衡听 2 nr
+朱衡才 2 nr
+朱衡本 2 nr
+朱衡薄 3 nr
+朱衣使者 3 nr
+朱衣太监 2 nr
+朱衣点头 3 nr
+朱襄氏 2 nr
+朱见济 5 nr
+朱见深 118 nr
+朱诺 4 nr
+朱质冰 2 nr
+朱贵便 4 nr
+朱贵儿 2 nr
+朱贵全 2 nr
+朱贵引 2 nr
+朱贵笑 2 nr
+朱越莉 2 nr
+朱践耳 6 nr
+朱轓皁盖 3 nz
+朱轓皂盖 3 n
+朱轮华毂 3 n
+朱辛庄 3 nr
+朱迪丝 3 nr
+朱迪斯 13 nr
+朱逖先 2 nr
+朱邦复 256 nr
+朱邦造 276 nr
+朱里亚 2 nr
+朱里斯 3 nr
+朱重八 54 nr
+朱金甫 2 nr
+朱铁峰 2 nr
+朱锐锦 2 nr
+朱锡龄 2 nr
+朱镕基 144 nr
+朱镜我 3 nr
+朱长浩 9 nr
+朱长龄 193 nr
+朱门 19 nr
+朱门绣户 3 nr
+朱门酒肉臭 4 i
+朱阁青楼 3 nr
+朱阳湖 256 nr
+朱阿姊 4 nr
+朱陈之好 3 nr
+朱雀 176 nr
+朱雀玄武 3 nr
+朱雅琼 256 nr
+朱震亨 7 nr
+朱震达 2 nr
+朱顶 4 nr
+朱颜 11 nr
+朱颜改 2 nr
+朱颜未 2 nr
+朱颜绿发 3 nr
+朱颜绿鬓 3 nr
+朱颜翠发 3 nr
+朱颜鹤发 3 nr
+朱骏声 5 nr
+朱高炽 126 nr
+朱高煦 175 nr
+朱鹭 4 nr
+朱鹮 3 nz
+朱龙广 3 nr
+朲 2 zg
+朴 270 zg
+朴不花 2 i
+朴东木 7 nr
+朴东浩 3 nr
+朴修斯 3 nr
+朴光洙 3 nr
+朴兰英 2 nr
+朴刀 187 n
+朴刀倚 4 nr
+朴刀杆 2 nr
+朴刀来 5 nr
+朴利茅 10 nr
+朴厚 3 a
+朴善英 3 nr
+朴夏苓 3 nr
+朴子 29 nr
+朴子内 5 nr
+朴子溪 3 nr
+朴子蛮 2 nr
+朴学 3 n
+朴学大师 3 nr
+朴定洙 8 nr
+朴实 534 a
+朴实作风 3 i
+朴实无华 56 i
+朴志胤 3 nr
+朴恩惠 3 nr
+朴成哲 8 nr
+朴拙 20 a
+朴散 3 a
+朴斫之材 3 nr
+朴新阳 3 nr
+朴无胜 3 i
+朴智星 5 nr
+朴朴 2 a
+朴朴实实 3 z
+朴柱奉 3 nr
+朴树 9 nr
+朴次茅斯 30 nr
+朴正熙 3 nrfg
+朴永宇 3 nr
+朴永训 6 nr
+朴泰俊 3 nr
+朴瑶道 2 nr
+朴直 5 nr
+朴相民 3 nr
+朴硝 3 n
+朴素 445 nr
+朴素唯物 3 n
+朴素大方 3 nr
+朴素无华 11 nr
+朴者和尚 5 nr
+朴茂 5 nr
+朴茨 39 nrt
+朴茨茅斯 57 nrt
+朴裕渊 4 nr
+朴讷诚笃 3 nr
+朴贊郁 3 z
+朴质 4 n
+朴资茅斯 3 nr
+朴达摩 96 nr
+朴野无文 3 i
+朴陋 3 a
+朵 1454 m
+朵云轩 3 nz
+朵儿 20 q
+朵夫 11 nrt
+朵朵 44 q
+朵朵开 3 n
+朵玫瑰 3 nr
+朵花 3 n
+朵颐 2 v
+朵颐大嚼 3 v
+朷 16 zg
+朸 4 zg
+机 6937 n
+机上 329 n
+机上安装 2 n
+机不可失 60 l
+机不容发 3 l
+机不旋踵 3 i
+机主 257 n
+机事不密 3 n
+机井 15 n
+机件 43 n
+机会 9875 n
+机会主义 207 n
+机会均等 3 n
+机会成本 3 l
+机会难得 3 l
+机伶 3 n
+机位 29 n
+机体 998 n
+机信息 3 n
+机修 24 vn
+机修厂 3 n
+机修工 3 n
+机修车间 3 n
+机修钳工 5 n
+机兆 3 n
+机先 3 n
+机关 24504 n
+机关作风 3 n
+机关党委 3 n
+机关刊物 14 l
+机关化 3 n
+机关团体 3 n
+机关大院 3 nt
+机关小学 3 l
+机关干部 133 n
+机关报 132 n
+机关效能 3 n
+机关文书 3 n
+机关枪 45 n
+机关炮 3 n
+机关用尽 3 l
+机关算尽 4 l
+机关算尽太聪明 9 i
+机兵 3 n
+机具 45 n
+机兽 3 n
+机内 3 s
+机内码 4 n
+机制 4138 n
+机制化 38 n
+机制纸 11 n
+机加工 6 n
+机务 132 n
+机务人员 3 n
+机务员 3 n
+机务段 34 n
+机务连 3 n
+机动 1405 n
+机动力 41 n
+机动小组 3 n
+机动性 418 n
+机动权 2 n
+机动灵活 3 n
+机动科 3 n
+机动粮 3 n
+机动船 35 n
+机动费 3 n
+机动车 413 n
+机动车行驶 14 n
+机动车辆 5 n
+机动车道 8 n
+机动队 3 n
+机化 3 n
+机匠 3 n
+机匣 2 n
+机卡分离 3 n
+机卡复制 3 n
+机压 3 n
+机友 3 n
+机友会 3 n
+机变 54 n
+机变如神 3 l
+机台 4 n
+机号码 3 n
+机名 3 n
+机员 4 n
+机器 3932 n
+机器人 384 n
+机器人学 3 n
+机器厂 29 n
+机器声 16 n
+机器字 3 n
+机器指令 10 n
+机器油 3 n
+机器猫 3 n
+机器码 3 n
+机器翻译 8 l
+机器脚踏 3 n
+机器设备 3 n
+机器语言 3 n
+机器误差 3 n
+机器运行 3 n
+机器配置 3 n
+机器间 2 n
+机场 7741 n
+机场主楼 3 n
+机场灯标 3 n
+机场跑道 3 n
+机场路 5 n
+机坛 3 n
+机型 366 n
+机壳 8 n
+机处理 4 n
+机头 189 n
+机套 3 n
+机子 35 n
+机宜 59 n
+机密 826 n
+机密信息 2 n
+机密性 3 n
+机密文件 3 n
+机密消息 3 n
+机尾 3 n
+机工 12 n
+机工程 3 n
+机巧 65 n
+机帆船 12 n
+机师 4 n
+机床 476 n
+机床厂 36 n
+机床模具 3 l
+机床设备 3 n
+机床配件 3 n
+机床附件 3 n
+机库 49 n
+机座 8 n
+机徽 3 n
+机心 34 n
+机心械肠 3 n
+机战 3 n
+机房 126 n
+机房设备 3 n
+机手 7 n
+机播 3 vn
+机收 6 n
+机敏 168 a
+机敏过人 3 n
+机数 44 n
+机数量 4 n
+机施 3 n
+机时 11 n
+机智 281 n
+机智勇敢 3 i
+机智幽默 3 n
+机智性 3 n
+机智果断 3 l
+机智问答 3 l
+机杼 12 n
+机杼一家 3 v
+机板 3 n
+机构 19209 n
+机构名称 3 n
+机构编制 3 n
+机构调整 3 n
+机枪 1003 n
+机枪兵 3 n
+机枪手 27 n
+机架 26 n
+机架式 3 n
+机柜 2 n
+机框 2 n
+机械 7077 n
+机械业 2 n
+机械主义 3 n
+机械传动 3 n
+机械公敌 3 n
+机械刀片 3 n
+机械制图 3 n
+机械制造 3 b
+机械功 24 n
+机械加工 4 n
+机械动力 3 n
+机械化 841 n
+机械厂 356 n
+机械厅 2 n
+机械唯物 3 n
+机械唯物主义 19 n
+机械堵水 3 n
+机械士 3 n
+机械学 17 n
+机械学习 3 n
+机械学系 3 n
+机械室 3 n
+机械局 3 n
+机械展 3 vn
+机械工业 3 n
+机械工业部 33 nt
+机械工人 3 n
+机械工程 3 n
+机械师 36 n
+机械式 86 n
+机械性 48 n
+机械性能 33 n
+机械战警 3 n
+机械手 35 n
+机械扫描 3 n
+机械抛光 3 z
+机械振动 3 n
+机械故障 3 n
+机械效率 12 n
+机械油 3 n
+机械波 10 n
+机械泵 3 n
+机械率 3 n
+机械画 3 n
+机械类 3 n
+机械系 28 n
+机械系统 3 n
+机械网 3 n
+机械能 115 n
+机械舞 3 n
+机械行业 5 n
+机械表 11 n
+机械装备 3 n
+机械论 23 n
+机械论者 3 n
+机械设备 8 n
+机械设计 2 n
+机械迁移 3 n
+机械运动 47 l
+机械部 5 n
+机械配件 3 n
+机械钻速 3 n
+机械锁 3 n
+机械防治 3 n
+机械零件 3 l
+机油 32 n
+机油泵 3 n
+机油箱 3 n
+机滤 3 n
+机灌 3 n
+机灵 215 n
+机灵鬼 7 n
+机炮 146 n
+机炮舱 3 n
+机状态 2 n
+机率 93 n
+机率论 3 n
+机现象 2 n
+机理 462 n
+机用户 2 n
+机甲 3 n
+机电 828 n
+机电井 4 n
+机电产品 3 n
+机电厂 3 n
+机电处长 3 n
+机电工程 3 n
+机电式 33 n
+机电票 3 n
+机电类 3 n
+机电网 3 n
+机电设备 3 n
+机电调向 3 n
+机电部 3 n
+机界面 3 n
+机盲 3 n
+机票 646 n
+机票代理 3 n
+机票价 9 n
+机票价格 3 n
+机票信息 3 n
+机票网 3 n
+机种 108 n
+机秘 3 n
+机窗 3 n
+机筒 3 n
+机箱 73 n
+机箱电源 3 n
+机米 3 n
+机系统 6 n
+机组 405 n
+机组人员 3 n
+机织 14 n
+机绣 3 n
+机缘 218 n
+机缘巧合 3 i
+机群 130 n
+机群文件 2 n
+机群系统 13 l
+机翼 486 n
+机考 3 n
+机耕 13 n
+机能 767 n
+机能主义 3 n
+机能减退 3 i
+机能性 3 n
+机腹 3 n
+机舍 3 n
+机舱 190 n
+机舱人员 3 ns
+机舱门 2 ns
+机色带 3 n
+机芯 22 n
+机螺钉 3 n
+机要 100 b
+机要员 18 n
+机要处 19 n
+机要室 3 n
+机要局 3 n
+机要文件 3 n
+机要科 6 n
+机要秘书 3 n
+机警 171 n
+机警地 3 n
+机警过人 3 n
+机设 3 vn
+机设备 2 n
+机诈 3 a
+机译 3 n
+机读目录 3 n
+机谋 34 n
+机身 477 n
+机身号 3 n
+机车 301 n
+机车信号 3 n
+机车厂 8 n
+机车处 3 n
+机车头 3 n
+机车组 3 n
+机车行 3 n
+机车赛 3 n
+机车车辆 4 n
+机轮 3 n
+机软件 2 n
+机轴 3 n
+机载 379 b
+机载设备 3 n
+机载雷达 2 n
+机运 3 n
+机遇 1182 n
+机遇期 3 n
+机针 3 n
+机锋 29 n
+机长 103 n
+机门 3 n
+机队 79 n
+机防 3 n
+机降 18 n
+机难轻失 3 n
+机顶 2 n
+机顶盒 59 n
+机首 3 n
+朻 3 zg
+朽 127 nr
+朽坏 6 v
+朽戈钝甲 3 v
+朽木 50 nr
+朽木不可 3 i
+朽木不可雕 2 i
+朽木不雕 3 i
+朽木之才 3 nr
+朽木死灰 3 i
+朽木生花 3 nr
+朽木粪土 3 nr
+朽木粪墙 3 nr
+朽木难彫 3 nr
+朽木难雕 3 i
+朽条腐索 3 i
+朽株枯木 3 i
+朽棘不彫 3 nr
+朽棘不雕 3 nr
+朽烂 48 v
+朽竹篙舟 3 v
+朽索驭马 3 i
+朽败 3 v
+朽迈 3 nr
+朽骨重肉 3 i
+朾 15 zg
+杀 17552 v
+杀一儆百 21 i
+杀一利百 3 nz
+杀一盘 3 i
+杀一砺百 3 nz
+杀了人 3 i
+杀人 1797 n
+杀人一万 3 i
+杀人不眨 3 i
+杀人不眨眼 93 i
+杀人不见 3 i
+杀人不见血 6 i
+杀人偿命 3 i
+杀人如草 3 i
+杀人如蒿 3 n
+杀人如蓺 3 v
+杀人如麻 42 i
+杀人成性 3 l
+杀人放火 125 i
+杀人案 25 n
+杀人案件 3 n
+杀人灭口 77 i
+杀人犯 59 i
+杀人狂 13 i
+杀人盈野 3 n
+杀人罪 40 i
+杀人者 54 n
+杀人者死 3 i
+杀人蜂 3 l
+杀人越货 32 n
+杀价 14 v
+杀伐 37 v
+杀伤 796 v
+杀伤力 184 n
+杀伤性 163 n
+杀低 3 v
+杀光 104 n
+杀入 248 v
+杀出 276 v
+杀出去 3 i
+杀出重围 32 l
+杀回马枪 3 l
+杀场 16 n
+杀头 217 v
+杀妻案 3 n
+杀妻求将 2 i
+杀威棒 10 n
+杀婴 3 n
+杀害 1111 v
+杀富济贫 8 i
+杀幼虫剂 3 n
+杀彘教子 3 nz
+杀怪 3 v
+杀戒 63 n
+杀戮 312 v
+杀戮战场 3 i
+杀手 645 v
+杀手锏 96 n
+杀招 3 v
+杀掉 392 v
+杀掠 3 v
+杀敌 233 v
+杀敌致果 3 i
+杀无赦 3 i
+杀木马 3 i
+杀机 112 n
+杀杀 3 v
+杀死 1588 v
+杀死比尔 3 i
+杀母 3 n
+杀毒 285 v
+杀毒王 3 nz
+杀毒软件 76 l
+杀气 216 n
+杀气腾腾 189 i
+杀灭 120 v
+杀熟 3 v
+杀猪 3 v
+杀猪刀 3 n
+杀猪匠 3 n
+杀球 3 n
+杀生 71 v
+杀生丸 3 n
+杀生之权 3 l
+杀病毒 3 n
+杀病毒剂 3 n
+杀绝 3 v
+杀草丹 3 ns
+杀草剂 3 nz
+杀菌 144 n
+杀菌作用 3 l
+杀菌剂 44 nz
+杀菌器 3 nz
+杀菌机 3 n
+杀菌灯 3 n
+杀菌锅 3 n
+杀虎口 3 i
+杀虫 56 n
+杀虫剂 132 n
+杀虫药 7 n
+杀虫药剂 2 nz
+杀蚊剂 3 n
+杀螨剂 11 n
+杀衣缩食 3 i
+杀跌 7 v
+杀身 38 v
+杀身之祸 88 i
+杀身成义 3 l
+杀身成仁 27 i
+杀身报国 3 i
+杀过来 3 l
+杀进 3 v
+杀进去 3 v
+杀进来 3 l
+杀退 3 v
+杀陆 3 v
+杀青 22 n
+杀风景 11 n
+杀马毁车 3 nz
+杀鸡 3 n
+杀鸡为黍 3 n
+杀鸡儆猴 7 i
+杀鸡取卵 10 i
+杀鸡取蛋 3 n
+杀鸡吓猴 6 i
+杀鸡哧猴 3 v
+杀鸡抹脖 3 l
+杀鸡焉用 3 i
+杀鸡焉用牛刀 4 i
+杀鸡骇猴 3 i
+杀鸭 3 n
+杀鼠剂 10 n
+杀鼠药 3 i
+杁 5 zg
+杂 2159 v
+杂七杂八 50 i
+杂业 3 n
+杂书 3 n
+杂乱 181 n
+杂乱一团 3 i
+杂乱不堪 3 i
+杂乱无序 2 l
+杂乱无章 74 i
+杂事 60 n
+杂事缠身 3 i
+杂交 368 n
+杂交亲本 3 n
+杂交可育 3 l
+杂交瘤 9 n
+杂交种 25 n
+杂交稻 14 n
+杂交育种 29 n
+杂交高粱 3 n
+杂件 3 n
+杂兵 3 n
+杂凑 3 a
+杂剧 388 n
+杂务 51 n
+杂务缠身 3 i
+杂史 31 n
+杂合 3 vn
+杂合性 2 n
+杂和菜 3 n
+杂和面 3 n
+杂和面儿 3 n
+杂品 9 n
+杂填土 3 i
+杂声 3 n
+杂处 3 n
+杂多县 2 ns
+杂婚 3 n
+杂学旁收 3 l
+杂家 39 n
+杂居 103 n
+杂工 9 n
+杂差 6 n
+杂录 29 n
+杂役 112 n
+杂志 2451 n
+杂志夹 3 n
+杂志架 3 n
+杂志社 193 n
+杂念 53 n
+杂感 8 n
+杂技 234 n
+杂技厅 3 n
+杂技团 54 n
+杂技场 3 n
+杂技演员 3 n
+杂技界 3 n
+杂技节 8 n
+杂技表演 3 n
+杂拌 5 v
+杂拌儿 8 n
+杂支 3 n
+杂数 3 n
+杂文 139 n
+杂文家 4 n
+杂文集 15 n
+杂木 18 n
+杂树林 3 n
+杂样 3 n
+杂款 3 n
+杂沓 77 a
+杂波 3 n
+杂活 14 vn
+杂活儿 3 n
+杂点 3 n
+杂烩 14 n
+杂然相许 3 n
+杂牌 37 n
+杂牌军 21 n
+杂牌货 3 n
+杂物 139 n
+杂物箱 3 n
+杂物间 2 n
+杂环 76 n
+杂用 7 n
+杂用品 3 n
+杂症 3 n
+杂碎 44 a
+杂种 438 n
+杂种人 3 n
+杂种优势 3 n
+杂种后代 3 l
+杂种性 3 n
+杂种狗 3 n
+杂税 15 n
+杂类 3 n
+杂粮 112 n
+杂糅 19 v
+杂絮 3 n
+杂耍 76 n
+杂耍戏院 3 l
+杂肥 3 n
+杂色 42 n
+杂色蛤 2 n
+杂花生树 3 n
+杂草 244 n
+杂草丛生 289 n
+杂草多 3 l
+杂菌 3 n
+杂著 27 n
+杂言 3 n
+杂言杂语 3 i
+杂讯 3 n
+杂记 76 n
+杂论 10 n
+杂话 3 n
+杂说 22 n
+杂谈 30 vn
+杂豆 3 n
+杂货 112 n
+杂货商 3 n
+杂货商店 3 n
+杂货店 46 n
+杂货船 16 n
+杂货铺 93 n
+杂质 424 n
+杂质扩散 3 n
+杂质浓度 3 n
+杂贷 3 n
+杂费 83 n
+杂铝 3 n
+杂错 3 a
+杂锦 3 n
+杂陈 40 n
+杂院 2 n
+杂院儿 3 n
+杂集 3 n
+杂面 19 n
+杂音 55 n
+杂项 20 n
+杂项收入 3 n
+杂项费用 3 n
+杂食 80 n
+杂食兽 3 n
+杂食店 3 n
+杂食性 3 n
+杂鱼 5 n
+权 7482 n
+权且 94 d
+权丙铉 2 nr
+权为民 7 nr
+权之争 2 nr
+权之战 4 nr
+权之治 2 nr
+权仗 2 n
+权位 138 n
+权作 3 n
+权倾中外 3 i
+权倾天下 21 n
+权充 7 nr
+权其轻重 3 i
+权函数 3 n
+权分立 289 nr
+权利 7829 n
+权利义务 3 n
+权利能力 47 n
+权利要求 3 n
+权利金 2 n
+权制 6 n
+权力 14581 n
+权力下放 3 l
+权力巅峰 3 v
+权力斗争 3 n
+权力电 3 n
+权力者 20 n
+权力观 2 n
+权势 443 n
+权势煊赫 3 nr
+权势电 2 n
+权势者 8 n
+权变 19 n
+权变锋出 3 i
+权召入 4 nr
+权吏 2 n
+权在兵 3 nr
+权均力敌 3 n
+权均力齐 3 nr
+权大喜 2 nr
+权大惊 2 nr
+权奸 59 n
+权威 2073 nr
+权威专家 3 n
+权威人士 3 n
+权威人物 3 n
+权威型 3 n
+权威性 260 n
+权威机构 3 n
+权威认证 3 n
+权威说法 3 n
+权威部门 3 n
+权宜 31 n
+权宜之策 3 nr
+权宜之计 64 i
+权宜心计 3 i
+权实 3 n
+权宿 3 n
+权尚宇 3 nr
+权属 50 n
+权幸 3 n
+权弄威 2 nr
+权强莫 2 nr
+权当 76 n
+权悉归 2 nr
+权教阶 2 nr
+权数 4 n
+权时制宜 3 n
+权有权 3 n
+权术 42 n
+权杖 29 n
+权柄 24 n
+权标 4 n
+权欲 3 n
+权欲熏心 2 l
+权永兴 3 nr
+权渐移 3 nr
+权状 3 n
+权略 3 n
+权益 1751 n
+权益保护法 10 n
+权益日 5 n
+权益法 13 n
+权益部 4 n
+权相 8 n
+权相佑 3 nz
+权相宇 3 nr
+权相贾 5 nr
+权相黄 2 nr
+权知真 2 nr
+权称 3 n
+权移马鹿 3 nr
+权继立 2 nr
+权能 90 n
+权能划分 3 n
+权能区分 3 n
+权臣 106 n
+权臣伯 5 nr
+权臣杨 5 nr
+权臣王 2 nr
+权臣袁 2 nr
+权臣贾 2 nr
+权臣铁 3 nr
+权臣间 2 nr
+权臣阿 2 nr
+权舆 3 n
+权衡 214 nr
+权衡再三 12 nr
+权衡利弊 32 n
+权衡得失 3 n
+权衡轻重 3 n
+权证 155 n
+权证和 3 n
+权证行 5 n
+权诈 3 nr
+权诉 2 v
+权谋 94 n
+权豪 2 n
+权豪势要 3 l
+权责 46 n
+权贵 259 nr
+权道识 2 n
+权重 127 n
+权重望崇 3 nr
+权重秩卑 3 nr
+权重股 3 nr
+权钧力齐 3 nr
+权钱交易 3 n
+权门 83 n
+权闻言 3 n
+权限 586 n
+杄 16 zg
+杅 27 zg
+杅穿皮蠹 3 n
+杆 1441 q
+杆件 92 n
+杆儿 22 n
+杆关节 3 n
+杆刀 3 n
+杆单元 3 n
+杆塔 19 n
+杆头 7 n
+杆子 312 n
+杆式 27 n
+杆形卡环 3 nz
+杆棒 3 n
+杆状 36 n
+杆状图 3 n
+杆状病毒 3 n
+杆直 3 nz
+杆秤 7 n
+杆线 2 n
+杆织机 3 n
+杆茵 3 n
+杆菌 398 n
+杆菌属 3 n
+杆菌类 3 n
+杇 3 zg
+杈 1328 n
+杉 706 nz
+杉叶藻 6 nr
+杉山爱 2 nr
+杉川英哲 2 nr
+杉晋作 4 nr
+杉木 651 nz
+杉杉 7 nz
+杉材 3 n
+杉村俊 6 nr
+杉村春 2 nr
+杉村春子 2 nr
+杉板 3 n
+杉林 2 nz
+杉林溪 3 nr
+杉树 19 n
+杉树林 2 nr
+杉篙 3 n
+杉谷义 11 nr
+杉谷先生 2 nr
+杋 2 zg
+杌 58 zg
+李 9566 nr
+李一氓 8 nr
+李七长 2 nr
+李万山 4 nr
+李万庆 5 nr
+李万燮 2 nr
+李万禄 2 nr
+李三举 2 nr
+李三娃 24 nr
+李三娘 2 nr
+李三才 53 nr
+李三春 256 nr
+李三景 3 nr
+李三爷 3 nr
+李三郎 2 nr
+李三长 2 nr
+李上善 8 nr
+李下瓜田 3 nr
+李世南 3 nr
+李世民 194 nr
+李世济 4 nr
+李世灰 3 nr
+李世石 17 nr
+李世芳 5 nr
+李世豪 2 nr
+李世贤 7 nr
+李世鹤 12 nr
+李东健 3 nr
+李东垣 8 nr
+李东旭 3 nr
+李东波 2 nr
+李东生 13 nr
+李东阳 110 nr
+李中华 6 nr
+李中堂 248 nr
+李中文 3 nr
+李丹丹 3 nr
+李为昌 6 nr
+李为民 293 nr
+李丽丽 3 nr
+李丽凤 3 nr
+李丽珍 3 nr
+李丽芬 3 nr
+李丽莉 3 nr
+李丽辉 2 nr
+李丽静 10 nr
+李乃蔚 2 nr
+李乃适 3 nr
+李义山 9 nr
+李义府 8 nr
+李义河 146 nr
+李义表 2 nr
+李之徒 3 nr
+李之薇 6 nr
+李之藻 19 nr
+李之龙 18 nr
+李书华 3 nr
+李书宏 2 nr
+李书路 3 nr
+李乾顺 2 nr
+李争艳 2 nr
+李二人 2 nr
+李二先生 5 nr
+李二哥 12 nr
+李二姐 2 nr
+李二嫂 11 nr
+李二寺 2 nr
+李二帅 2 nr
+李二相 3 nr
+李云亭 2 nr
+李云冲 10 nr
+李云在 3 nr
+李云娟 3 nrfg
+李云监 2 nr
+李云迪 7 nr
+李云造 2 nr
+李云风 351 nr
+李云飞 11 nr
+李云鹏 2 nr
+李云龙 3 nr
+李井泉 6 nr
+李亚仙 6 nr
+李亚农 2 nr
+李亚凡 2 nr
+李亚南 2 nr
+李亚平 49 nr
+李亚彪 3 nr
+李亚捷 3 nr
+李亚文 2 nr
+李亚普 18 nr
+李亚普诺 2 nr
+李亚杰 2 nr
+李亚林 3 nr
+李亚莉 5 nr
+李亚鹏 19 nr
+李京文 9 nr
+李仁堂 3 nr
+李仁孝 21 nr
+李仁福 4 nr
+李仁臣 2 nr
+李从军 256 nr
+李从吉 6 nr
+李从镒 2 nr
+李仕尧 3 nr
+李他娘 2 nr
+李付一 2 nr
+李仙姑 2 nr
+李仙江 3 nr
+李仙蕙 3 nr
+李仙风 43 nr
+李代桃僵 3 i
+李令晰 4 nr
+李仪祉 3 nr
+李仲彬 3 nrfg
+李伟峰 7 nr
+李伟心 2 nr
+李伟民 4 nr
+李伟眯 2 nr
+李传俊 3 nr
+李传韵 3 nr
+李伯元 4 nrfg
+李伯勇 3 nr
+李伯升 5 nr
+李伯安 4 nr
+李伯江 3 nr
+李伯清 30 nr
+李伯纪 7 nr
+李伯芬 3 nr
+李伯谦 12 nr
+李伯钊 2 nr
+李佐贤 2 nr
+李体林 2 nr
+李作同 2 nr
+李作荣 256 nr
+李作见 2 nr
+李作鹏 39 nr
+李佩成 5 nr
+李佩玲 3 nr
+李佩甫 4 nr
+李佳军 2 nr
+李佳明 48 nr
+李佳白 4 nr
+李佳薇 25 nr
+李侃任 4 nr
+李侍尧 2 nr
+李俊 550 nr
+李俊入 2 nr
+李俊兴 2 nr
+李俊同 5 nr
+李俊唯 2 nr
+李俊基 3 nr
+李俊引 4 nr
+李俊梅 2 nr
+李俊民 4 nr
+李俊见 5 nr
+李保中 2 nr
+李保定 3 nr
+李保田 2 nr
+李信停 2 nr
+李信兄弟 26 nr
+李信军 2 nr
+李信叫 2 nr
+李信叹 2 nr
+李信听 4 nr
+李信命 2 nr
+李信忙 2 nr
+李信来 2 nr
+李信略 2 nr
+李信笑 2 nr
+李信见 3 nr
+李信连 2 nr
+李信问 2 nr
+李修贤 3 nr
+李健华 10 nr
+李健吾 7 nr
+李健超 35 nr
+李傀儡 18 nr
+李儒劝 2 nr
+李儒雄 256 nr
+李元伟 6 nr
+李元儒 2 nr
+李元吉 15 nr
+李元平 2 nr
+李元文 2 nr
+李元昊 21 nr
+李元春 3 nr
+李元景 2 nr
+李元正 257 nr
+李元田 12 nr
+李元礼 2 nr
+李元霸 3 nr
+李兄弟 3 nr
+李兆基 8 nr
+李兆洛 3 nr
+李兆焯 2 nr
+李兆麟 4 nr
+李先念 961 nr
+李先生 69 nr
+李光地 5 nr
+李光头 3 nr
+李光弼 30 nr
+李光昭 166 nr
+李光珍 3 nr
+李光羲 2 nr
+李光耀 24 nr
+李光辉 7 nr
+李光里 2 nr
+李克俭 3 nr
+李克农 4 nr
+李克勤 3 nr
+李克因 2 nr
+李克尔 16 nr
+李克强 6 nr
+李克智 120 nr
+李克杰 2 nr
+李克用 33 nr
+李克纯 3 nr
+李全兴 4 nrfg
+李全明 8 nrfg
+李全林 3 nrfg
+李全生 2 nr
+李公佐 7 nr
+李公公 13 nr
+李公子 194 nr
+李公朴 33 nr
+李公麟 22 nr
+李兰云 2 nr
+李兰芳 2 nr
+李兰香 2 nr
+李兴华 2 nr
+李兴叶 2 nr
+李兴桂 2 nr
+李兴浩 3 nr
+李兴海 2 nr
+李兴芳 3 nr
+李兴顺 3 nr
+李兵团 2 nr
+李兵道 6 nr
+李其炎 3 nr
+李典之 2 nr
+李典领 4 nr
+李再雯 4 nr
+李军门 20 nr
+李冬梅 2 nr
+李冬野 3 nr
+李冰 48 nr
+李冰之 2 nr
+李冰修 2 nr
+李冰冰 3 nr
+李冰心 3 nr
+李冶著 8 nr
+李凌松 4 nr
+李凝眉 2 nr
+李凡秀 3 nr
+李凤姐 3 nr
+李凤彪 3 nr
+李凤林 4 nr
+李凤鸣 37 nr
+李凯先生 2 nr
+李凯尔 3 nr
+李凯尔特 3 nr
+李凯文 3 nr
+李刚则 2 nr
+李初梨 2 nr
+李剑农 4 nr
+李剑华 3 nr
+李剑寒 3 nr
+李剑茹 3 nr
+李剑阁 2 nr
+李力世 62 nr
+李力士 2 nr
+李功英 2 nr
+李加靓 3 nr
+李劫夫 2 nr
+李劲源 31 nr
+李势兵 2 nr
+李勃玲 51 nr
+李勇勇 3 nr
+李勒勒 3 nr
+李勤勤 3 nr
+李化龙 3 nr
+李北海 3 nr
+李医生 3 nr
+李十儿 26 nr
+李十娘 104 nr
+李华梅 3 nr
+李华英 2 nr
+李卓吾 9 nr
+李南屏 12 nr
+李南玲 2 nr
+李博士 6 nr
+李卜克 28 nr
+李卜克内 3 nr
+李占奇 23 nr
+李卫公 12 nr
+李卫新 2 nr
+李卿映 3 nr
+李厚义 21 nr
+李厚基 2 nr
+李厚霖 3 nr
+李厝山 3 ns
+李友听 2 nr
+李友灿 3 nr
+李双亭 3 nr
+李双双 11 nrfg
+李双喜 164 nr
+李叔同 24 nr
+李叔明 2 nr
+李古壁 10 nr
+李可夫 9 nr
+李可妮 3 nr
+李可文 3 nr
+李可染 16 nr
+李可灼 13 nr
+李可秀 148 nr
+李司令 4 nr
+李司棋 3 nr
+李吉甫 28 nr
+李名莫 2 nr
+李名逵 2 nr
+李后主 18 nr
+李向东 2 nr
+李向前 110 nrfg
+李向阳 4 nr
+李君如 17 nr
+李含光 4 nr
+李启旺 3 nr
+李启明 8 nr
+李启汉 2 nr
+李启祯 2 nr
+李启胜 3 nr
+李呈祥 5 nr
+李员外 2 nr
+李和儿 2 nr
+李商隐 60 nr
+李善兰 40 nr
+李善友 3 nr
+李善邦 2 nr
+李善长 73 nr
+李喜喜 5 nr
+李嗣兴 2 nr
+李嗣本 5 nr
+李嗣涔 2 nr
+李嗣源 14 nr
+李嘉乐 2 nr
+李嘉固 2 nr
+李嘉图 191 nr
+李嘉城 2 nr
+李嘉存 3 nr
+李嘉廷 3 nr
+李嘉强 3 nr
+李嘉成 2 nr
+李嘉欣 8 nr
+李嘉诚 65 nr
+李嘉诚基金会 3 nr
+李四 106 nr
+李四光 330 nr
+李四喜 2 nr
+李四太 2 nr
+李四摧 7 nr
+李四相 2 nr
+李园妹 2 nr
+李固渡 3 nr
+李国兴 80 nr
+李国华 41 nr
+李国君 2 nr
+李国奇 31 nr
+李国安 7 nr
+李国强 3 nr
+李国文 8 nr
+李国旭 3 nr
+李国杰 4 nr
+李国柱 18 nr
+李国栋 2 nr
+李国桢 3 nr
+李国瑞 114 nr
+李国盛 3 nr
+李国祥 3 nr
+李国翰 3 nr
+李国能 3 nr
+李国臣 3 nr
+李国英 3 nr
+李国豪 43 nr
+李国邦 4 nr
+李国锋 3 nr
+李国雄 2 nr
+李国香 181 nr
+李国麟 3 nr
+李国鼎 3 nr
+李圣天 4 nr
+李圣宰 4 nr
+李圣杰 3 nr
+李培智 2 nr
+李培林 3 nr
+李基永 33 nr
+李基灿 3 nr
+李堂主 13 nr
+李堂右 3 nr
+李士俊 3 nr
+李士实 16 nr
+李士忠 2 nr
+李士春 5 nr
+李士美 3 nr
+李士群 15 nr
+李士菊 3 nr
+李士豪 3 nr
+李壮飞 8 nr
+李处巽 2 nr
+李处温 107 nr
+李外父 2 nr
+李多奎 4 nr
+李多海 3 nr
+李多祚 5 nr
+李大亮 2 nr
+李大人 56 nr
+李大伟 2 nr
+李大使 4 nr
+李大元 3 nr
+李大光 3 nr
+李大公子 3 nr
+李大利 2 nr
+李大双 256 nr
+李大同 3 nr
+李大哥 57 nr
+李大嘴 3 nr
+李大壮 2 nr
+李大夫 3 nr
+李大妈 3 nr
+李大官人 5 nr
+李大宽 3 nr
+李大帅 2 nr
+李大强 3 nr
+李大现 2 nr
+李大社 7 nr
+李大郎 5 nr
+李大金 3 nr
+李大钊 1338 nr
+李大齐 3 nr
+李天华 13 nr
+李天可 2 nr
+李天和 2 nrfg
+李天垣 21 nr
+李天宠 8 nr
+李天心 4 nr
+李天恒 3 nr
+李天扬 2 nr
+李天歌 3 nr
+李天王 4 nr
+李天策 3 nr
+李天羽 19 nr
+李天道 4 nr
+李天锡 3 nr
+李天霞 7 nr
+李太医 20 nr
+李太后 1111 nr
+李太太 26 nr
+李太宰 3 nr
+李太常 2 nr
+李太提 2 nr
+李太白 21 nr
+李夫人 26 nr
+李奇微 8 nr
+李奥文 3 nr
+李奥纳多 3 nr
+李女士 2 nr
+李好义 5 nr
+李如月 9 nr
+李如松 277 nr
+李如柏 25 nr
+李如桢 4 nr
+李如梅 8 nr
+李妈妈 3 nr
+李妮娜 3 nr
+李姊姊 8 nr
+李姑娘 4 nr
+李姥姥 2 nrfg
+李娘娘 8 nr
+李娜 438 nr
+李娜英 3 nr
+李婉华 3 nr
+李婶娘 13 nr
+李婷婷 3 nr
+李婷宜 3 nr
+李媚姐 8 nr
+李媛媛 3 nr
+李嫂子 5 nr
+李嬷嬷 36 nr
+李子 348 nr
+李子奈 2 nr
+李子忠 4 nr
+李子树 43 nr
+李子泉 5 nr
+李子花 2 nr
+李子雄 3 nr
+李存义 9 nr
+李存勖 41 nr
+李存孝 11 nr
+李存根 2 nr
+李孝伯 2 nr
+李孝忠 63 nr
+李孝恭 7 nr
+李孝聪 4 nr
+李孝莉 3 nr
+李孝逸 8 nr
+李孟坚 2 nr
+李学举 3 nr
+李学仁 2 nr
+李学军 3 nr
+李学凌 3 nr
+李学勇 4 nr
+李学勤 72 nr
+李学文 3 nr
+李学智 2 nr
+李学梅 2 nr
+李学江 6 nr
+李学道 3 nr
+李宁 60 nr
+李宁杯 3 nr
+李宁牌 16 nr
+李宇明 34 nr
+李宇春 15 nr
+李宇皓 3 nrfg
+李宇鸿 2 nr
+李守中 2 nr
+李守孔 3 nr
+李守常 2 nr
+李守礼 2 nr
+李守耕 10 nr
+李安世 2 nr
+李安东 5 nr
+李安宅 4 nr
+李安民 5 nr
+李安纳 4 nr
+李宏伟 3 nr
+李宏飞 3 nr
+李宗一 3 nrfg
+李宗仁 145 nr
+李宗伟 6 nr
+李宗吾 2 nr
+李宗振 15 nr
+李宗琦 3 nr
+李宗盛 2 nr
+李宗翰 256 nr
+李宗闵 11 nr
+李官桥 3 nr
+李定保 3 nr
+李定国 62 nr
+李宜贞 3 nr
+李宝吓 2 nr
+李宝君 3 nr
+李宝和 3 nrfg
+李宝嘉 4 nr
+李宝库 4 nr
+李宝田 3 nr
+李宝章 2 nr
+李宝臣 3 nr
+李宝花 6 nr
+李宣良 20 nr
+李宪生 3 nr
+李宫裁 17 nr
+李宰完 3 nr
+李家 443 nrfg
+李家兄弟 3 nr
+李家和 4 nr
+李家坪 5 nr
+李家墩 256 nr
+李家声 2 nr
+李家大 2 nr
+李家妹妹 2 nr
+李家姐妹 2 nr
+李家寨 49 nr
+李家山 7 nr
+李家峡 4 nr
+李家峡水电站 3 nt
+李家庄 21 nr
+李家店 2 ns
+李家忠 5 nr
+李家杰 3 nr
+李家永 2 nr
+李家沟 4 nr
+李家泉 3 nr
+李家湾 2 nr
+李家芬 4 nr
+李家都 2 nr
+李家钰 3 nr
+李家集 6 nr
+李家顺 5 nr
+李密势 3 nr
+李密成 2 nr
+李密败 3 nr
+李富春 35 nr
+李富林 3 nr
+李富荣 18 nr
+李富贵 3 nr
+李寡妇 2 nr
+李寻欢 2 nr
+李将军 32 nr
+李将爷 5 nr
+李小二 16 nr
+李小冉 3 nr
+李小双 259 nr
+李小姐 14 nr
+李小峰 10 nr
+李小平 2 nr
+李小明 6 nr
+李小燕 3 nr
+李小璐 4 nr
+李小芽 60 nr
+李小萌 3 nr
+李小锋 3 nr
+李小霞 6 nr
+李小飞 3 nr
+李小龙 15 nr
+李少光 3 nr
+李少华 4 nr
+李少君 2 nr
+李少春 8 nr
+李少英 2 nr
+李尔本 10 nr
+李尔王 22 nr
+李尚书 4 nr
+李尚仁 3 nr
+李尚白 2 nr
+李尚真 2 nr
+李尽忠 2 nr
+李岗村 3 nr
+李岗霖 3 nr
+李岚清 311 nr
+李岩之 4 nr
+李岩停 2 nr
+李岩兄弟 19 nr
+李岩刚 4 nr
+李岩召 2 nr
+李岩叹 3 nr
+李岩命 2 nr
+李岩喜 2 nr
+李岩因 2 nr
+李岩微微 2 nr
+李岩心 11 nr
+李岩惊 2 nr
+李岩李 2 nr
+李岩正 3 nr
+李岩派 2 nr
+李岩笑 5 nr
+李岩营 3 nr
+李岩见 8 nr
+李岩谏 2 nr
+李岩速 2 nr
+李峰双剑 3 nr
+李峰道 6 nr
+李崇伟 3 nr
+李巡抚 3 nr
+李巧奴 4 nr
+李布衣 3 nr
+李师伯 39 nr
+李师傅 6 nr
+李师兄 6 nr
+李师叔 3 nr
+李师姊 2 nr
+李师师 189 nr
+李师道 10 nr
+李希光 11 nr
+李希凡 3 nr
+李希圣 2 nr
+李希烈 20 nr
+李常杰 12 nr
+李平水 102 nr
+李幼斌 3 nr
+李幼滋 9 nr
+李广 43 nr
+李广不侯 3 nr
+李广为 2 nr
+李广之 2 nr
+李广利 19 nr
+李广射 2 nr
+李广廉 4 nr
+李广未封 3 nr
+李广田 5 nr
+李广花 24 nr
+李广难封 3 nr
+李庆华 15 nr
+李庆荣 3 nr
+李庆逵 2 nr
+李庆霖 14 nr
+李应升 3 nr
+李应发 11 nr
+李应听 2 nr
+李应道 8 nr
+李应领 2 nr
+李府中 2 nr
+李康生 3 nr
+李延一 6 nr
+李延吃 2 nr
+李延听 2 nr
+李延宗 47 nr
+李延寿 8 nr
+李延年 8 nr
+李延想 3 nr
+李延龄 2 nr
+李廷军 4 nr
+李廷机 3 nr
+李廷松 2 nr
+李廷栋 2 nr
+李廷豹 17 nr
+李建中 4 nrfg
+李建伟 5 nr
+李建光 2 nr
+李建兴 9 nr
+李建军 3 nr
+李建华 20 nr
+李建同 2 nr
+李建国 9 nr
+李建平 3 nr
+李建成 33 nrfg
+李建明 261 nrfg
+李建本 3 nr
+李建民 3 nr
+李建波 43 nr
+李建生 3 nr
+李建章 3 nr
+李建群 256 nr
+李建英 48 nr
+李开先 13 nr
+李开复 38 nr
+李开弟 3 nr
+李开芳 6 nr
+李式开 3 nr
+李弥昌 12 nr
+李强 159 nrfg
+李归伯 2 nr
+李当之 3 nr
+李当泰 2 nr
+李彝殷 6 nr
+李彝超 8 nr
+李彦主 2 nr
+李彦升 2 nr
+李彦宏 24 nr
+李彦赐 2 nr
+李彩凤 12 nr
+李彩华 3 nr
+李彩桦 3 nr
+李德 70 nr
+李德任 4 nr
+李德伦 8 nr
+李德全 127 nr
+李德才 4 nr
+李德旺 2 nr
+李德明 37 nr
+李德明子 3 nr
+李德林 3 nr
+李德水 3 nr
+李德洙 3 nr
+李德生 32 nr
+李德立 2 nr
+李德裕 31 nr
+李心善 9 nr
+李心洁 2 nr
+李心草 2 nr
+李必达 11 nr
+李志军 3 nr
+李志刚 3 nr
+李志勇 2 nr
+李志国 3 nr
+李志坚 4 nr
+李志希 3 nr
+李志常 99 nr
+李志敏 11 nr
+李志新 3 nr
+李志明 3 nr
+李志松 3 nr
+李志武 3 nr
+李志毅 3 nr
+李志民 3 nr
+李志浦 2 nr
+李志甫 2 nr
+李志诚 3 nr
+李志起 4 nrfg
+李志高 259 nr
+李忠杰 3 nr
+李忠梅 2 nr
+李忠直 3 nr
+李忠笑 2 nr
+李怀仙 9 nr
+李怀光 12 nr
+李怀林 3 nr
+李怀甫 4 nr
+李思亚 3 nr
+李思恭 4 nr
+李思摩 2 nr
+李思浩 2 nr
+李思纯 3 nr
+李思训 16 nr
+李思谏 4 nr
+李思齐 22 nr
+李怡青 2 nr
+李总兵 5 nr
+李总管 15 nr
+李总统 3 nr
+李恒嵩 3 nr
+李恕权 3 nr
+李恩宙 3 nr
+李恩珠 3 nr
+李悝 45 nr
+李惟淼 6 i
+李慈铭 5 nr
+李慎明 256 nr
+李慕良 6 nr
+李慧娘 5 nr
+李慧明 3 nr
+李慧珍 2 nr
+李慧颖 3 nr
+李成 80 nrfg
+李成俊 3 nr
+李成儒 3 nr
+李成军 3 nrfg
+李成宰 3 nr
+李成彬 3 nrfg
+李成昌 3 nrfg
+李成松 14 nr
+李成桂 13 nr
+李成梁 147 nr
+李成浩 3 nr
+李成玉 3 nr
+李战吉 4 nr
+李才旺 2 nr
+李托塔 3 nr
+李承乾 2 nr
+李承晚 80 nr
+李承祖 2 nr
+李承鹏 3 nr
+李抱枕 3 nr
+李抱玉 2 nr
+李择红 3 nr
+李振东 2 nr
+李振声 3 nr
+李振宇 2 nr
+李振春 3 nr
+李振福 7 nr
+李振邺 122 nr
+李掌柜 8 nr
+李探花 3 nr
+李提摩太 4 nr
+李提督 2 nr
+李攀龙 15 nr
+李政委 6 nr
+李政宰 3 nr
+李政道 65 nr
+李敏宽 2 nr
+李教授 2 nr
+李敞致 2 nr
+李敬伟 2 nr
+李敬泽 8 nr
+李敬臣 6 nr
+李文书 2 nr
+李文云 2 nr
+李文公 2 nr
+李文凯 4 nr
+李文华 3 nr
+李文博 7 nr
+李文和 24 nrfg
+李文娟 3 nrfg
+李文学 3 nr
+李文忠 90 nr
+李文成 2 nrfg
+李文政 3 nr
+李文斯 6 nr
+李文杰 4 nr
+李文根 4 nr
+李文正 2 nrfg
+李文武 3 nr
+李文治 7 nr
+李文波 2 nr
+李文海 3 nr
+李文涛 3 nr
+李文田 2 nr
+李文秀 876 nr
+李文良 2 nr
+李文蔚 2 nr
+李文颖 2 nr
+李斯 72 nr
+李斯德 8 nr
+李斯特 41 nr
+李新彦 10 nr
+李新德 2 nr
+李新烽 23 nrfg
+李新科 4 nr
+李新良 257 nr
+李新觉 256 nr
+李方华 2 nr
+李方敬 2 nr
+李方桂 5 nr
+李方膺 5 nr
+李方训 2 nr
+李日公 8 nr
+李旭旦 3 nr
+李时勉 10 nr
+李时珍 349 nr
+李时英 2 nr
+李时雨 3 nr
+李昆离 2 nr
+李昌动 3 nr
+李昌勋 3 nr
+李昌平 8 nr
+李昌言 6 nr
+李昌谷 2 nr
+李昌钰 3 nr
+李昌镐 33 nr
+李明依 3 nr
+李明军 2 nr
+李明勋 4 nr
+李明华 3 nr
+李明博 2 nr
+李明后 3 nr
+李明启 3 nr
+李明德 2 nr
+李明心 81 nr
+李明放 2 nr
+李明文 6 nr
+李明月 2 nr
+李明杰 3 nr
+李明森 15 nr
+李明瑞 7 nr
+李明臣 3 nr
+李明豫 256 nr
+李昕亮 3 nr
+李星华 4 nr
+李春久 7 nr
+李春亭 256 nr
+李春兰 4 nr
+李春城 3 nr
+李春平 3 nr
+李春年 3 nr
+李春明 3 nr
+李春来 52 nr
+李春江 3 nr
+李春波 3 nr
+李春润 4 nr
+李春芳 37 nr
+李春阳 2 nr
+李春香 3 nr
+李昭楠 5 nr
+李显刚 3 nr
+李显忠 6 nr
+李显斌 5 nr
+李显甫 4 nr
+李显龙 20 nr
+李晋伟 3 nr
+李晓光 16 nr
+李晓勇 2 nr
+李晓华 3 nr
+李晓南 2 nr
+李晓岗 16 nr
+李晓峰 2 nr
+李晓建 2 nr
+李晓明 5 nrfg
+李晓杰 3 nr
+李晓玲 4 nr
+李晓璐 3 nr
+李晓艳 2 nr
+李晓钰 3 nr
+李晓霞 25 nr
+李晓颖 12 nr
+李普希 9 nr
+李普曼 8 nr
+李景俭 3 nr
+李景忠 2 nr
+李景林 128 nr
+李景汉 6 nr
+李景波 3 nr
+李景隆 142 nr
+李晴扬 3 nr
+李晴祺 3 nr
+李智楠 3 nr
+李曦光 6 nr
+李曼丽 4 nr
+李曾伯 3 nr
+李月久 3 nr
+李月儿 3 nr
+李月明 2 nr
+李有毅 3 nr
+李有邻 5 nr
+李朝威 3 nr
+李朝钦 6 nr
+李木易 2 nr
+李本涛 3 nr
+李本深 4 nrfg
+李本舰 6 nr
+李术峰 6 nr
+李李仁 5 nr
+李来亨 139 nr
+李来群 2 nr
+李杨梅 2 nr
+李杰任 2 nr
+李杰指 2 nr
+李松海 2 nr
+李林塔 5 nr
+李林塔尔 3 nr
+李林甫 101 nr
+李林盛 5 nr
+李柏拴 2 nr
+李树德 22 nr
+李树文 259 nr
+李树有 3 nr
+李树清 3 nr
+李树青 3 nr
+李校书 5 nr
+李校长 2 nr
+李根源 4 nr
+李根相 3 nr
+李桐轩 2 nr
+李梅亭 145 nr
+李梦华 3 nr
+李梦彪 4 nr
+李梦男 3 nr
+李梦阳 26 nr
+李梦龙 6 nr
+李森智 2 nr
+李森科 2 nr
+李椿年 2 nr
+李次九 6 nr
+李欣欣 2 nr
+李正元 2 nrfg
+李正华 2 nr
+李正己 2 nr
+李正敏 3 nr
+李正茂 4 nr
+李殿仁 2 nr
+李殿朗 3 nr
+李毅中 5 nrfg
+李毅男 37 nr
+李毅背 2 nr
+李毅道 5 nr
+李毓芳 30 nr
+李比希 24 nr
+李氏 145 nr
+李氏世 2 nr
+李氏原 2 nr
+李氏家族 3 nr
+李氏房 2 nr
+李民欣 2 nr
+李水清 2 nr
+李永乐 18 nr
+李永健 2 nr
+李永军 11 nr
+李永安 3 nr
+李永宏 2 nr
+李永展 4 nr
+李永文 2 nr
+李永明 2 nr
+李永波 292 nr
+李永田 3 nr
+李永芳 25 nr
+李永萍 2 nr
+李永贞 7 nr
+李永金 2 nr
+李永革 12 nr
+李永飞 2 nr
+李汉俊 314 nr
+李汝昌 2 nr
+李汝珍 5 nr
+李沃夫 4 nr
+李沅芷 521 nr
+李沛瑶 2 nr
+李沟村 2 nr
+李沧东 3 nr
+李沧区 2 ns
+李治讳 2 nr
+李泓冰 8 nr
+李法曾 3 nr
+李泰祥 3 nr
+李泽厚 7 nr
+李泽楷 3 nr
+李泽民 3 nr
+李洁思 12 nr
+李洪志 3 nr
+李洪洋 20 nr
+李济国 3 nrfg
+李济深 99 nrfg
+李济琛 8 nr
+李济贤 3 nr
+李浩培 2 nr
+李浩天 3 nr
+李海婴 2 nr
+李海峰 3 nr
+李海忠 4 nr
+李海林 4 nr
+李海洋 2 nrfg
+李海浪 3 nr
+李海涛 3 nr
+李海淑 3 n
+李海燕 3 nr
+李海道 5 nr
+李润五 4 nr
+李润权 2 nr
+李润田 47 nr
+李润祺 3 nr
+李涵辰 3 nr
+李淑一 3 nrfg
+李淑彬 2 nrfg
+李淑菊 2 nrfg
+李淳风 49 nr
+李清华 2 nr
+李清国 3 nr
+李清平 4 nr
+李清林 6 nr
+李清照 65 nr
+李渊 120 nr
+李渊入 2 nr
+李渊晋 2 nr
+李渊立 3 nr
+李渭清 2 ns
+李湘柱 6 nr
+李源潮 11 nr
+李满住 2 nr
+李滨声 2 nr
+李潜虞 2 nr
+李潭镇 3 nr
+李瀚章 2 nr
+李火昆 2 nr
+李灿森 3 nr
+李炫一 2 nr
+李炳坤 2 nrfg
+李炳钦 6 nr
+李烈苍 3 nr
+李烈钧 23 nr
+李焕之 10 nr
+李煜 71 nrfg
+李燕燕 3 nr
+李燕玲 11 nr
+李燮龙 2 nr
+李爱春 3 nr
+李特尔 13 nr
+李狗儿 93 nr
+李狗皮 7 nr
+李献可 7 nr
+李率泰 3 nr
+李玉书 3 nr
+李玉光 4 nr
+李玉和 4 nrfg
+李玉堂 9 nr
+李玉峰 3 nr
+李玉明 2 nr
+李玉春 3 nr
+李玉洞 2 nr
+李玉玲 18 nr
+李玉琴 4 nr
+李玉英 2 nr
+李玉茹 3 nr
+李玉著 3 nr
+李玉金 2 nr
+李王亲 2 nr
+李王德 2 nr
+李王拜 2 nr
+李王渠 2 nr
+李玮峰 29 nr
+李玮锋 3 nr
+李玲蔚 16 nr
+李珉宇 3 nz
+李珉英 3 nz
+李珊 258 nrfg
+李珊珊 3 nrt
+李琼梅 2 nr
+李瑞环 244 nr
+李瑞英 6 nr
+李瑞镇 3 nr
+李璟荣 3 nz
+李瓶儿 9 nr
+李生民 7 nr
+李留恩 4 nr
+李登云 115 nr
+李登柱 2 nr
+李登辉 82 nr
+李白 374 nr
+李白成 6 nr
+李白杜甫 3 nr
+李白桃红 3 nr
+李白诗 2 nr
+李百万 3 nr
+李百药 7 nr
+李皇亲 2 nr
+李盛铎 17 nr
+李盛霖 3 nr
+李直夫 4 nr
+李相王 2 nr
+李眉君 5 nr
+李瞎子 10 nr
+李石曾 6 nr
+李硕勋 2 nr
+李碧华 2 nr
+李碧炎 5 nr
+李示田 3 nr
+李祖伦 19 nr
+李祖可 2 nr
+李祖法 2 nr
+李祖陶 2 nr
+李福全 5 nr
+李福基 2 nr
+李福守 2 nr
+李福忙 3 nr
+李福林 2 nr
+李福正 3 nr
+李福清 3 nr
+李福祥 4 nr
+李福领 2 nr
+李秀成 41 nrfg
+李秀明 3 nr
+李秀春 11 nr
+李秀英 3 nr
+李秉宪 3 nr
+李秉常 3 nr
+李秉衡 10 nr
+李秋水 184 nr
+李立三 66 nr
+李立则 2 nr
+李立群 3 nr
+李章洙 3 nr
+李章达 3 nr
+李管家 28 nr
+李粉姬 6 nr
+李精白 10 nr
+李素丽 15 nr
+李素文 2 nr
+李素芬 2 nr
+李红兵 24 nr
+李红利 3 nr
+李红旗 2 nr
+李红英 2 nr
+李红雨 3 nr
+李约瑟 28 nr
+李约翰 2 nr
+李纪周 3 nr
+李纪恒 2 nr
+李纯恩 3 nr
+李纲告 2 nr
+李纹李 5 nr
+李绍唐 3 nr
+李绍远 3 nr
+李经方 2 nr
+李经理 3 nr
+李经纬 3 nr
+李给谏 2 nr
+李继捧 19 nr
+李继朱 9 nr
+李继筠 2 nr
+李继耐 4 nr
+李继迁 61 nr
+李继隆 3 nr
+李继鸿 3 nr
+李绩原 2 nr
+李绪鄂 256 nr
+李续宜 3 nr
+李续宾 11 nr
+李绮红 3 nrfg
+李维业 7 nr
+李维嘉 3 nr
+李维平 3 nr
+李维康 3 nr
+李维斯 3 nr
+李维榕 5 nr
+李维汉 32 nr
+李维良 2 nr
+李维诺夫 2 nr
+李美凤 3 nr
+李美妍 3 nr
+李美洁 7 nr
+李美淑 3 n
+李群玉 2 nr
+李翊君 256 nr
+李翠英 2 nr
+李翠莲 12 nr
+李翰林 3 nr
+李翰祥 2 nr
+李耀文 2 nr
+李老九 6 nr
+李老儿 4 nr
+李老君 5 nr
+李老师 3 nr
+李老板 5 nr
+李老汉 19 nr
+李老爷 11 nr
+李联芳 2 nr
+李肇星 553 nr
+李育贤 4 nr
+李胜馗 3 nr
+李能满 2 nr
+李腾芳 3 nr
+李腾跃 2 nr
+李自成 5577 nrfg
+李自成起义 18 nrfg
+李至伦 3 nr
+李舒章 4 nr
+李舜佶 25 nr
+李舜臣 108 nr
+李良嗣 2 nr
+李艳春 3 nr
+李艳秋 3 nr
+李芳亭 7 nr
+李芳园 2 nr
+李芳芳 3 nr
+李芳远 2 nr
+李若凡 3 nr
+李若琳 3 nr
+李苦禅 14 nr
+李英杰 3 nr
+李英民 12 nr
+李英淑 4 n
+李英爱 3 nr
+李英辉 4 nr
+李英雄 2 nr
+李茂山 3 nr
+李茂贞 19 nr
+李茏怡 3 nr
+李荣兴 3 nrfg
+李荣娟 2 nrfg
+李荣杓 6 nr
+李荣著 2 nr
+李荣融 9 nrfg
+李莉莉 3 nr
+李莞春 2 nr
+李莫愁 1953 nr
+李莲英 613 nr
+李菊花 2 nr
+李萍倩 2 nr
+李萍叹 2 nr
+李萍大 2 nr
+李萍见 2 nr
+李葆明 3 nr
+李蔚先生 2 nr
+李蕾蕾 3 nr
+李薇薇 2 nr
+李虎儿 6 nr
+李虎城 3 nr
+李虞候 16 nr
+李行亮 256 nr
+李行首 2 nr
+李补之 3 nr
+李西华 67 nr
+李西涯 4 nr
+李观承 2 nr
+李誉鸿 4 nr
+李调元 2 nr
+李谅祚 8 nr
+李谷一 14 nrfg
+李象益 2 nr
+李象群 4 nr
+李贞贤 3 nr
+李贤注 3 nr
+李贵人 3 nr
+李贵妃 409 nr
+李贵忙 5 nr
+李贵鲜 28 nr
+李贺普 19 nr
+李贺诗 4 nr
+李贽 30 nr
+李赛凤 3 nr
+李赛普 2 nr
+李赞画 5 nr
+李赣骝 5 nr
+李超前 4 nr
+李超士 2 nr
+李辅国 7 nr
+李达任 6 nr
+李达便 2 nr
+李达昌 3 nr
+李过刚 4 nr
+李过命 2 nr
+李过笑 2 nr
+李过营 2 nr
+李过见 3 nr
+李迎新 2 nr
+李进军 4 nr
+李进忠 10 nr
+李进良 2 nr
+李进荣 3 nr
+李远哲 3 nr
+李远方 3 nr
+李连元 3 nr
+李连塔 4 nr
+李连宁 256 nr
+李连捷 2 nr
+李连新 34 nr
+李连杰 9 nr
+李适之 8 nr
+李逍遥 3 nr
+李逢吉 5 nr
+李逵 1151 nr
+李道友 6 nr
+李道宗 10 nr
+李道豫 14 nr
+李道长 8 nrfg
+李遵顼 3 nr
+李邦华 36 nr
+李邦彦 87 nr
+李郭仙舟 3 nr
+李郭同舟 3 nr
+李郭同船 3 nr
+李都司 3 nr
+李重俊 5 nr
+李重庵 257 nr
+李重润 6 nr
+李重茂 6 nr
+李金保 3 nr
+李金兰 4 nr
+李金华 54 nr
+李金发 5 nr
+李金吾 16 nr
+李金培 2 nr
+李金山 2 nr
+李金早 256 nr
+李金生 10 nr
+李金章 4 nr
+李金羽 157 nr
+李金鹤 5 nr
+李金龙 28 nr
+李钟原 3 nr
+李钟玉 12 nr
+李钟郁 4 nr
+李钧德 2 nr
+李铁 177 nr
+李铁嘴 100 nr
+李铁夫 2 nr
+李铁拐 2 nr
+李铁映 342 nr
+李铁续 2 nr
+李银河 14 nr
+李锁爷 9 nr
+李锐吴 2 nr
+李锡尼 10 nr
+李锡铭 12 nr
+李镇中 10 nr
+李镇西 3 nr
+李长久 2 nr
+李长云 16 nr
+李长华 3 nrfg
+李长吉 4 nr
+李长庚 6 nr
+李长春 7 nrfg
+李长水 19 nr
+李长白 5 nr
+李长荣 2 nr
+李长顺 2 nrfg
+李闯攻 2 nr
+李闯王 301 nr
+李阎王 46 nr
+李阳冰 10 nr
+李陵碑 7 nr
+李隆基 50 nr
+李雄死 2 nr
+李雄继 2 nr
+李雅勋 3 nr
+李雅普 6 nr
+李雅芳 2 nr
+李雅轩 4 nr
+李雨寰 3 i
+李雨桐 5 nr
+李雪健 3 nr
+李雪峰 2 nr
+李雪梅 19 nr
+李雪琳 3 nr
+李雷道 6 nr
+李雷雷 15 nr
+李青山 9 nr
+李青松 2 nr
+李靖 77 nr
+李靖飞 3 nr
+李顺听 3 nr
+李顺心 4 nr
+李顺答 2 nr
+李顺达 21 nr
+李风念 2 nr
+李飞黄 165 nr
+李香主 5 nr
+李香兰 5 nr
+李香君 14 nr
+李香琴 3 nr
+李香香 10 nr
+李骧之 2 nr
+李高听 2 nr
+李高成 2407 nrfg
+李高瞅 2 nr
+李鱼川 4 nr
+李鸿基 4 nr
+李鸿忠 1025 nr
+李鸿恩 9 nr
+李鸿章 2617 nr
+李鸿藻 7 nr
+李鹏 675 nr
+李鹤善 2 nr
+李麦先 2 nr
+李麦劝 7 nr
+李麦又 2 nr
+李麦叹 5 nr
+李麦听 12 nr
+李麦喊 6 nr
+李麦忙 9 nr
+李麦才 3 nr
+李麦指 2 nr
+李麦用 2 nr
+李麦问 3 nr
+李麦麦 2 nr
+李默庵 12 nr
+李默然 8 nr
+李齐物 3 nr
+李齐贤 4 nr
+李龙城 2 nr
+李龙斌 3 nr
+李龙眠 4 nr
+李龟寿 7 nr
+杏 432 n
+杏仁 141 n
+杏仁奶粉 3 n
+杏仁核 3 n
+杏仁油 3 n
+杏仁眼 3 n
+杏仁茶 5 ns
+杏仁豆腐 3 n
+杏仁酥 6 n
+杏仁露 2 ns
+杏儿 3 n
+杏元屯 3 ns
+杏园 3 ns
+杏坛 6 n
+杏子 70 n
+杏山 41 ns
+杏干 3 n
+杏李 3 n
+杏林 31 ns
+杏林区 3 ns
+杏林春暖 3 n
+杏树 38 n
+杏核 12 n
+杏核眼 4 n
+杏梅 2 n
+杏眼 3 n
+杏眼圆瞪 3 n
+杏红 3 b
+杏脯 6 n
+杏脸桃腮 3 n
+杏腮桃脸 3 l
+杏花 88 n
+杏花岭区 2 ns
+杏花春雨 4 l
+杏花村 26 ns
+杏花村镇 3 ns
+杏花楼 2 ns
+杏范 2 n
+杏雨梨云 3 n
+杏鲍菇 3 v
+杏黄 70 b
+杏黄色 21 n
+材 871 zg
+材优干济 3 n
+材剧志大 3 n
+材士练兵 3 n
+材大难用 3 n
+材学 3 n
+材德兼备 3 vn
+材料 9137 n
+材料价格 3 n
+材料力学 35 n
+材料厂 6 n
+材料库 3 n
+材料科 3 n
+材料科学 92 n
+材料费 7 n
+材料部 3 n
+材智 3 n
+材望 3 n
+材朽行秽 3 n
+材略 3 n
+材疏志大 3 n
+材种 3 n
+材积 7 n
+材积表 3 n
+材能 3 n
+材能兼备 3 vn
+材茂行洁 3 n
+材茂行絜 3 nz
+材薄质衰 3 n
+材质 171 n
+材质库 3 n
+材轻德薄 3 n
+材雄德茂 3 nz
+材高知深 3 n
+村 8299 zg
+村上 50 s
+村上春树 10 n
+村东 13 n
+村两委 3 j
+村主任 50 n
+村井 5 n
+村人 3 n
+村俗 3 n
+村党委 3 n
+村公所 9 n
+村内 11 s
+村冈 3 ns
+村农民 6 n
+村前村后 3 l
+村办 27 j
+村务 10 n
+村务公开 10 n
+村口 108 n
+村史 4 n
+村哥里妇 3 n
+村坊 157 n
+村坞 3 n
+村塾 5 n
+村墟 3 n
+村壮 3 j
+村外 84 s
+村夫 28 n
+村夫俗子 3 n
+村夫野老 3 n
+村头 87 n
+村女 3 n
+村妇 10 n
+村姑 67 n
+村委 15 n
+村委会 4129 j
+村子 905 n
+村学 5 n
+村学究语 3 n
+村宅 2 n
+村守 3 n
+村官 21 n
+村容 8 n
+村容村貌 6 n
+村寨 113 n
+村小 18 n
+村居 3 n
+村屯 11 n
+村山 13 n
+村山富市 9 ns
+村干部 184 n
+村庄 976 n
+村店 3 n
+村户 2 n
+村提留 3 nr
+村支书 35 n
+村支部 4 j
+村村 59 n
+村村寨寨 4 ns
+村村户户 3 n
+村村落落 7 n
+村村通 3 n
+村校 2 n
+村歌社舞 3 l
+村歌社鼓 3 l
+村民 1213 n
+村民代表 3 n
+村生泊长 3 n
+村社 84 n
+村童 3 n
+村箫社鼓 3 nr
+村级 51 n
+村组 9 n
+村舍 44 n
+村落 390 n
+村规民约 3 n
+村话 3 n
+村边 58 s
+村酒野蔬 3 n
+村里 1377 s
+村里人 255 n
+村野 32 n
+村野匹夫 3 n
+村镇 157 n
+村长 523 n
+村队 3 n
+村雨 3 n
+村霸 3 n
+村风 3 n
+杓 146 zg
+杓子 3 nr
+杔 3 zg
+杖 1923 ng
+杖刑 3 l
+杖头木偶 2 l
+杖履相从 3 l
+杖履纵横 3 l
+杘 4 zg
+杙 8 zg
+杚 14 zg
+杛 14 zg
+杜 835 nr
+杜一力 21 nr
+杜主管 2 n
+杜丽丽 25 nr
+杜丽娘 13 nr
+杜之秩 2 nr
+杜书伍 7 nr
+杜云生 10 nr
+杜五安 2 nr
+杜亚泉 14 nr
+杜亚莉 17 nr
+杜仲 370 nr
+杜仲茶 3 nr
+杜伊勒 5 nr
+杜伊斯 20 nr
+杜伊斯堡 25 nrt
+杜伊诺 2 nr
+杜伏威 19 nr
+杜会斌 8 nr
+杜伦尼 2 nr
+杜伯秋 4 nr
+杜俊梅 16 nr
+杜修贤 2 nr
+杜倍雷 3 nr
+杜兆津 3 nr
+杜光庭 17 nr
+杜光廷 6 nr
+杜克大学 3 nt
+杜公祠 2 nr
+杜兰尼 17 nr
+杜兰朵 3 nr
+杜兰特 6 nr
+杜兴道 7 nr
+杜冶秋 3 nr
+杜冷丁 10 nr
+杜利特 6 nr
+杜剑锋 2 nr
+杜勃留 2 nr
+杜勃罗 3 nr
+杜勋入 2 nr
+杜勋原 2 nr
+杜勋必 2 nr
+杜勋进 6 nr
+杜勒克 4 nr
+杜勒斯 23 nr
+杜勒西 7 nr
+杜化中 4 nr
+杜十娘 13 nr
+杜华举 2 nr
+杜卡斯 5 nr
+杜卡特 2 nr
+杜口 3 nr
+杜口吞声 3 i
+杜口无言 3 i
+杜口结舌 3 i
+杜口绝言 3 i
+杜口裹足 3 i
+杜回沪 2 nr
+杜国威 3 nr
+杜国庠 6 nr
+杜国强 2 nr
+杜培武 3 nr
+杜塞 4 nr
+杜塞尔 3 nr
+杜塞尔多夫 32 nrt
+杜塞尔多夫市 2 nrt
+杜大桤 3 nr
+杜太后 3 nr
+杜夫海纳 3 nr
+杜奇华 5 nr
+杜奥蒙 2 nr
+杜威 86 nr
+杜子春 2 nr
+杜宁林 3 nr
+杜宇 15 nr
+杜宏域 4 nr
+杜宗国 3 nr
+杜宗文 18 nr
+杜定友 5 nr
+杜宜瑾 258 nr
+杜审言 263 nr
+杜家 3 n
+杜家台 7 nr
+杜家寨 19 nr
+杜家庄 3 nr
+杜家滨 3 nr
+杜宾根 5 nr
+杜宾犬 3 nr
+杜富尔 2 nr
+杜将军 8 nr
+杜少府 3 nr
+杜少津 3 nr
+杜少陵 4 nr
+杜尔伯特 33 nrt
+杜尔伯特蒙古族自治县 8 ns
+杜尔克 7 nr
+杜尔加 3 nr
+杜尔卡 2 nr
+杜尔哥 9 nr
+杜尔玛 2 nr
+杜尔科 21 nr
+杜尔菲 2 nr
+杜尔迦 6 nr
+杜尚别 30 nr
+杜尚在 2 nr
+杜岭方 3 nr
+杜工部 10 nt
+杜布切 13 nr
+杜布吕 4 nr
+杜布瓦 7 nr
+杜布罗 5 nr
+杜布罗夫尼克 9 nrt
+杜布雷 2 nr
+杜希孟 32 nr
+杜庄主 14 nr
+杜库雷 10 nr
+杜康 15 nr
+杜康酒 7 nr
+杜建君 2 nr
+杜弊 3 n
+杜弊清源 3 n
+杜微慎防 3 nr
+杜德伟 3 nr
+杜德克 3 nr
+杜德夫 3 nr
+杜德美 2 nr
+杜心武 7 nr
+杜心解 3 nr
+杜志国 3 nr
+杜志民 3 nr
+杜总兵 8 nr
+杜拉丝 3 nr
+杜拉克 2 nr
+杜拉斯 8 nr
+杜拉特 2 nr
+杜振清 3 nr
+杜撰 74 nr
+杜敬臣 3 nr
+杜文亮 2 nr
+杜文才 2 nr
+杜文秀 22 nr
+杜断房谋 3 n
+杜斯坎 2 nr
+杜斯堡 3 nr
+杜旭东 3 nr
+杜明新 3 nr
+杜普伊 2 nr
+杜普勒 2 nr
+杜曼卡斯 3 nr
+杜月笙 23 nr
+杜杲任 2 nr
+杜松 21 nr
+杜松子 4 nr
+杜松子酒 3 nr
+杜林论 18 nr
+杜柏钧 4 nr
+杜梨 12 nr
+杜正贤 15 nr
+杜武库 2 nr
+杜比 10 nrt
+杜比宁 3 nr
+杜比系统 3 l
+杜氏藻 2 nr
+杜求仁 2 nr
+杜江凌 2 nr
+杜汶泽 3 nr
+杜波伊 2 nr
+杜波依斯 16 nr
+杜洛克 5 nr
+杜洛周 4 nr
+杜渐防微 3 nr
+杜渐防荫 3 nr
+杜渐防萌 3 nr
+杜渐除微 3 i
+杜满生 3 nr
+杜熊文 3 nr
+杜父鱼 5 nr
+杜牧 61 nr
+杜牧之 3 nr
+杜牧诗 3 nr
+杜特隆 3 nr
+杜琪峰 6 nr
+杜瓦利 15 nr
+杜瓦尔 2 nr
+杜瓦苯 3 nz
+杜甫 1304 nr
+杜甫仁科 2 nr
+杜百当 19 nr
+杜福宝 3 nr
+杜立德 11 nr
+杜米亚特 2 nrt
+杜米埃 8 nr
+杜纳马 2 nr
+杜绝 593 nr
+杜绝人事 3 i
+杜绝后患 3 i
+杜绝言路 3 l
+杜绝防微 3 l
+杜继昌 2 nr
+杜继祖 2 nr
+杜维明 8 nr
+杜罗河 7 nr
+杜耳恶闻 3 nr
+杜聿明 36 nrfg
+杜能模式 3 nr
+杜能环 3 nr
+杜舍维 2 nr
+杜若原 4 nr
+杜英姿 3 nr
+杜英科 5 nr
+杜英豪 3 nr
+杜荀鹤 12 nr
+杜莉莉 6 nr
+杜菜园 3 nr
+杜蕾斯 2 nr
+杜蘅 3 nr
+杜衡 3 nr
+杜袭引 2 nr
+杜诗中 2 nr
+杜诗名 2 nr
+杜诗学 2 nr
+杜诗镜 2 nr
+杜语 2 nz
+杜赫德 2 nr
+杜近芳 5 nr
+杜遵道 8 nr
+杜邦 13 nr
+杜邦公司 14 nt
+杜里调 128 nr
+杜钟瀛 2 nr
+杜钰洲 2 nr
+杜铁环 259 nr
+杜锋朝 2 nr
+杜长大 3 nr
+杜长老 10 nr
+杜门 4 nr
+杜门不出 2 i
+杜门却扫 3 nz
+杜门屏迹 3 nr
+杜门晦迹 3 i
+杜门绝客 3 i
+杜门绝迹 3 i
+杜门自守 3 nr
+杜门自绝 3 ns
+杜门谢客 3 nr
+杜门面壁 3 nz
+杜阿尔 3 nr
+杜阿尔特 7 nrt
+杜阿拉 19 nr
+杜阿雷 3 nr
+杜隙防微 3 i
+杜集 2 nr
+杜集区 3 nt
+杜雨露 3 nr
+杜雪平 2 nr
+杜震宇 67 nr
+杜青林 8 nr
+杜青海 88 nr
+杜预注 5 nr
+杜预镇 2 nr
+杜马 87 nr
+杜马斯 2 nr
+杜马舍夫 2 nr
+杜鲁人 2 nr
+杜鲁门 168 nr
+杜鸣心 9 nr
+杜鹃 406 nr
+杜鹃啼血 3 l
+杜鹃山 3 nr
+杜鹃花 863 nr
+杜鹃花叶 3 n
+杜鹃花城 3 n
+杜鹃花节 5 n
+杜鹃鸟 3 nr
+杜麟征 2 nr
+杜麦特 2 nr
+杜默为诗 3 nr
+杞 482 ns
+杞人之忧 3 i
+杞人忧天 57 i
+杞县 224 ns
+杞国 2 ns
+杞国之忧 3 i
+杞国忧天 3 i
+杞天之虑 3 i
+杞宋无征 3 n
+杞柳 4 ns
+杞梓之林 3 ns
+束 973 nr
+束上起下 3 i
+束之高屋 3 i
+束之高阁 17 nr
+束修自好 3 i
+束光明 2 nr
+束兵秣马 3 i
+束发 2 v
+束发冠 3 nr
+束发封帛 3 nr
+束在高阁 3 i
+束带 23 n
+束带结发 3 i
+束干茅 2 i
+束戈卷甲 3 nr
+束成 3 v
+束手 69 v
+束手受缚 3 i
+束手听命 3 i
+束手坐视 3 i
+束手就困 3 i
+束手就擒 35 i
+束手就毙 3 i
+束手就缚 3 i
+束手待援 3 i
+束手待死 3 i
+束手待毙 68 i
+束手旁观 3 i
+束手无措 3 i
+束手无术 3 i
+束手无策 228 i
+束手无计 3 i
+束手束脚 5 n
+束手束足 3 n
+束手缚脚 3 i
+束手自毙 3 i
+束教管闻 3 l
+束星北 6 nr
+束景南 2 nr
+束杖理民 3 nr
+束椽为柱 3 nr
+束毛藻 10 nr
+束流 9 vn
+束流线 3 n
+束状骨 3 nr
+束窈窕 2 nr
+束类域 3 n
+束紧 3 v
+束绊 3 n
+束缊举火 3 v
+束缊请火 3 nz
+束缊还妇 3 nr
+束缚 832 vn
+束缚态 3 i
+束缚水 3 i
+束缚电子 3 n
+束缚电荷 3 n
+束置高阁 3 nr
+束肩敛息 3 nr
+束胸 3 v
+束脩 2 n
+束腰 22 v
+束腰带 7 n
+束蒲为脯 3 nr
+束蕴乞火 3 z
+束蕴请火 3 nr
+束衣甲 2 nr
+束装 3 v
+束装就道 3 l
+束装盗金 3 i
+束贝含犀 3 nr
+束身 11 v
+束身修行 3 i
+束身受命 3 i
+束身就缚 3 i
+束身自修 3 nr
+束身自好 3 i
+束身自爱 3 i
+束革 2 vn
+束马县车 3 nr
+束马悬车 3 i
+束龙女 2 nr
+杠 159 n
+杠包 3 n
+杠夫 3 n
+杠头 2 n
+杠子 64 n
+杠房 3 n
+杠杆 322 n
+杠杆作用 3 n
+杠杆原理 3 n
+杠杠 20 n
+杠板归 3 n
+杠着 3 n
+杠起 3 n
+杠铃 22 n
+杠龟 3 n
+条 12583 n
+条三窝四 3 n
+条令 194 n
+条件 17290 n
+条件优惠 3 n
+条件刺激 11 l
+条件反射 119 l
+条件句 3 n
+条件同步 3 l
+条件性 8 n
+条件成熟 3 l
+条件收敛 3 i
+条件期望 3 l
+条件极值 3 l
+条件者 19 n
+条件逻辑 3 l
+条例 5288 n
+条修叶贯 3 n
+条入叶贯 3 n
+条几 12 n
+条凳 43 n
+条分缕析 27 l
+条分节解 3 l
+条列 3 n
+条块 24 n
+条块分割 26 l
+条块结合 2 n
+条型 3 n
+条头 3 n
+条子 244 n
+条屏 4 n
+条山 7 n
+条岛 3 n
+条带 36 n
+条带加宽 3 n
+条幅 50 n
+条幅机 3 l
+条干 3 n
+条形 35 n
+条形图 3 n
+条形码 29 n
+条播 23 n
+条支 3 n
+条数 3 n
+条文 243 n
+条文主义 3 n
+条斑 4 n
+条施 3 n
+条条 68 n
+条条块块 3 n
+条条大路通罗马 10 ns
+条条框框 37 n
+条案 7 n
+条桌 18 n
+条款 830 n
+条状 39 n
+条理 141 n
+条理井然 3 n
+条理分明 3 n
+条理化 6 n
+条理性 9 n
+条理清晰 3 l
+条理清楚 3 l
+条理素 3 n
+条田 5 n
+条畅 3 v
+条痕 3 n
+条目 149 n
+条石 158 n
+条码 123 n
+条码卡 3 n
+条码机 3 n
+条约 5111 n
+条约国 3 n
+条约法 16 n
+条纹 192 n
+条纹布 2 n
+条纹木材 3 n
+条纹病 3 n
+条纹纸 3 n
+条绒 3 n
+条规 35 n
+条解支劈 3 n
+条贯 2 n
+条贯部分 3 n
+条达 3 n
+条钢 9 n
+条锈病 3 n
+条陈 103 n
+条项 3 n
+条顿人 7 n
+条顿族 3 n
+条鱼 3 n
+条鳎 3 n
+杢 3 zg
+来 161501 v
+来不及 1178 v
+来不得 24 v
+来世 62 v
+来临 816 v
+来丹湖 3 nr
+来之不易 137 i
+来乾清 2 nr
+来亨鸡 3 nr
+来京 282 ns
+来人支票 3 n
+来人来函 3 n
+来件 3 n
+来传旨 6 nr
+来体 3 n
+来作 3 v
+来俊臣 10 nr
+来信 829 v
+来信来电 3 n
+来信版 6 n
+来信者 3 n
+来信请寄 3 nr
+来健妇 2 n
+来元廷 2 nr
+来兴府 3 nr
+来养 3 v
+来凤 40 nr
+来凤县 257 nr
+来函 21 n
+来函来电 3 l
+来到 8779 v
+来到如今 3 l
+来劲 47 v
+来劲儿 7 nr
+来势 265 n
+来势凶猛 3 i
+来势汹汹 40 i
+来勤修 4 nr
+来华 369 v
+来华访问 3 n
+来历 744 v
+来历不明 41 i
+来去分明 3 i
+来去匆匆 3 z
+来去无踪 3 i
+来去自如 3 i
+来去自由 3 l
+来参禅 2 nr
+来发发 3 n
+来变 3 v
+来台访问 3 n
+来启奏 2 nr
+来回 1115 v
+来回来去 3 i
+来回票 3 n
+来因去果 3 i
+来士敬悉 3 nr
+来处不易 2 l
+来复 3 v
+来复枪 20 l
+来复线 3 n
+来头 86 v
+来头不小 3 l
+来好息师 3 n
+来学琴 2 n
+来安县 3 ns
+来宝寨 2 nr
+来宝庄 2 nr
+来客 109 n
+来宾 166 n
+来宾县 2 nr
+来宾市 3 n
+来宾席 3 n
+来宾致词 3 i
+来小僧 2 nr
+来年 99 t
+来延津 4 nr
+来往 942 v
+来往关系 3 l
+来往如梭 3 i
+来往港口 3 nr
+来徒儿 2 nr
+来得 729 v
+来得及 802 v
+来得快 3 v
+来得早 3 v
+来恭领 2 nr
+来情去意 3 i
+来意 156 v
+来意不明 3 i
+来成龙 2 nr
+来攻 3 v
+来料 10 n
+来料加工 29 n
+来日 171 t
+来日大难 12 i
+来日方长 20 n
+来日无多 4 l
+来日正长 3 i
+来时 699 t
+来时路 3 n
+来旺儿 2 nr
+来昭宁 2 nr
+来晚 3 t
+来智胜 2 nr
+来朝贺 6 nr
+来来 3 v
+来来去去 78 i
+来来回回 49 i
+来来往往 98 i
+来来来 3 v
+来校 13 n
+来样 3 u
+来样加工 3 n
+来格仕 3 nr
+来檬 3 n
+来殿帅 2 nr
+来气 3 n
+来水量 15 n
+来永寿 2 nr
+来永平 2 nr
+来江州 2 ns
+来源 4434 n
+来源不明 3 v
+来源于 965 v
+来源国 11 ns
+来滋扰 2 l
+来潮 40 n
+来火器 3 n
+来点 3 n
+来犯 95 v
+来犯之敌 3 i
+来献忠 3 nr
+来理杨 2 nr
+来生 58 v
+来用 3 v
+来电 138 v
+来电显示 3 v
+来电来函 3 n
+来界岭 13 n
+来相士 2 nr
+来看 4619 u
+来看我好 3 l
+来看爱我 3 i
+来福儿 11 nr
+来福士 3 nr
+来福抢 3 nr
+来福枪 3 nr
+来福线 3 nr
+来积香 2 nr
+来稿 57 v
+来者 196 n
+来者不善 3 i
+来者不拒 27 i
+来者勿拒 3 i
+来者可追 3 i
+来者居上 3 i
+来而不往非礼也 23 i
+来聊天 3 i
+来自 6801 v
+来自体内 3 nr
+来苏 10 v
+来苏水 3 nr
+来苏糖 3 nr
+来襄汉 2 nr
+来见 3 v
+来言 3 u
+来讲 817 v
+来访 867 v
+来访者 31 n
+来试 3 v
+来话 8 u
+来说 10451 u
+来路 119 n
+来路不明 12 i
+来路货 3 n
+来踪去路 3 i
+来踪去迹 4 i
+来车 3 n
+来迎去送 3 nr
+来颁赐 2 nr
+来风 65 n
+来鸿 2 nr
+来鸿去燕 3 nr
+来龙去脉 118 i
+杧 17 zg
+杨 16649 nr
+杨一指 2 nr
+杨一民 28 nr
+杨一清 119 nr
+杨一鸣 4 nr
+杨七郎 11 nr
+杨万里 3 nr
+杨三人 7 nr
+杨三哥 2 nr
+杨三姐 4 nr
+杨三己 2 nr
+杨不悔 79 nr
+杨世光 75 nr
+杨世驹 4 nr
+杨业 37 nr
+杨业之 3 nr
+杨业兵 2 nr
+杨业功 257 nr
+杨业勇 2 nr
+杨业归 2 nr
+杨业随 2 nr
+杨业领 2 nr
+杨东平 11 nr
+杨东文 2 nr
+杨两军 7 nr
+杨两营 2 nr
+杨中慧 8 nr
+杨中时 6 nr
+杨丽华 10 nr
+杨丽坤 3 nr
+杨丽菁 3 nr
+杨丽萍 11 nr
+杨丽青 3 nr
+杨举起 4 nr
+杨乃文 3 nr
+杨乃武 2 nr
+杨义臣 2 nr
+杨义贞 7 nr
+杨乐乐 3 nr
+杨乔良 2 nr
+杨书兴 14 nr
+杨二人 140 nr
+杨二太 4 nr
+杨二牛 3 nr
+杨五郎 2 nr
+杨井竹 14 nr
+杨亚楠 2 nr
+杨亿 3 nr
+杨仁和 3 nr
+杨仁恺 6 nr
+杨从疆 9 nr
+杨令公 4 nr
+杨以增 3 nr
+杨仪东 2 nr
+杨仪入 2 nr
+杨仲华 3 nr
+杨伙盘 3 nr
+杨伟光 5 nr
+杨传堂 3 nr
+杨传广 3 nr
+杨伯冲 2 nr
+杨伯峻 6 nr
+杨伯恺 2 nr
+杨伯涛 2 nr
+杨伯祥 5 nr
+杨伯翰 2 nr
+杨伯起 2 nr
+杨伯达 5 nr
+杨伯镛 2 nr
+杨佑宁 3 v
+杨侍郎 2 nr
+杨侗召 3 nr
+杨俊 6 nr
+杨俊卿 2 nr
+杨俊平 2 nr
+杨俊毅 3 nr
+杨俊生 2 nr
+杨俊转 2 nr
+杨元元 3 nr
+杨元勇 3 nr
+杨元庆 25 nr
+杨元珍 87 nr
+杨元琰 2 nr
+杨兄弟 37 nr
+杨先华 3 nr
+杨先生 27 nr
+杨先用 2 nr
+杨光辉 7 nr
+杨全仁 2 nr
+杨八姐 2 nr
+杨公子 28 nr
+杨六郎 5 nr
+杨兴富 256 nr
+杨兴民 4 nr
+杨再兴 21 nr
+杨凌农业高新技术产业示范区 2 l
+杨凌区 3 nr
+杨凝式 3 nr
+杨凤城 5 nr
+杨凤安 17 nr
+杨分任 3 nr
+杨刚刚 2 nr
+杨利伟 7 nr
+杨利普 48 nr
+杨副将 8 nr
+杨力劝 3 nr
+杨力平 6 nr
+杨匆匆 2 nr
+杨匏安 4 nr
+杨医生 4 nr
+杨千嬅 3 nz
+杨千桦 3 nr
+杨升南 2 nr
+杨华云 2 nr
+杨华升 2 nr
+杨卓然 5 nr
+杨卓舒 13 nr
+杨博乘 2 nr
+杨博兄 2 nr
+杨占芳 3 nr
+杨却先 2 nr
+杨友祥 3 nr
+杨双旦 13 nr
+杨可世 257 nr
+杨可发 5 nr
+杨可弼 2 nr
+杨可胜 29 nr
+杨叶湖 256 nr
+杨叶甲 2 nr
+杨同嘴 256 nr
+杨同学 5 nr
+杨同永 2 nr
+杨同科 4 nr
+杨听罢 3 nr
+杨启堂 2 nr
+杨启鹏 13 nr
+杨和古 4 nr
+杨和孙 5 nr
+杨和明 3 nr
+杨和阿 2 nr
+杨和陈 2 nr
+杨咏桔 2 n
+杨哥哥 2 nr
+杨善先生 3 nr
+杨善平 26 nr
+杨善深 2 nr
+杨嗣昌 846 nr
+杨嘉墀 5 nr
+杨四郎 5 nr
+杨国屏 257 nr
+杨国平 2 nr
+杨国庆 259 nr
+杨国强 20 nr
+杨国忠 59 nr
+杨国柱 14 nr
+杨国栋 2 nr
+杨国桢 6 nr
+杨国梁 256 nr
+杨在冰 2 nr
+杨在葆 3 nr
+杨坚 54 nr
+杨坚之 2 nr
+杨坚代 4 nr
+杨坚建 2 nr
+杨坚灭 5 nr
+杨坚谋 2 nr
+杨坚辅 5 nr
+杨坤 3 nrfg
+杨培芳 2 nr
+杨塞新 2 nr
+杨士奇 165 nr
+杨士文 13 nr
+杨士琦 18 nr
+杨士聪 6 nr
+杨士龙 5 nr
+杨复光 3 nr
+杨夏道 5 nr
+杨大人 13 nr
+杨大侠 14 nr
+杨大哥 273 nr
+杨大夫 3 nr
+杨大妈 35 nr
+杨大娘 54 nr
+杨大洪 4 nr
+杨大爷 19 nr
+杨大章 2 nr
+杨天乐 2 nr
+杨天啸 5 nr
+杨天石 3 nr
+杨天行 3 nr
+杨太尉 17 nr
+杨太监 4 nr
+杨太真 6 nr
+杨夫人 22 nr
+杨奉营 2 nr
+杨姊姊 8 nr
+杨姐姐 6 nr
+杨姓 7 nrfg
+杨威利 3 nr
+杨婉仪 3 nr
+杨子华 3 nr
+杨子江 2 nr
+杨子荣 6 nr
+杨子迪 11 nr
+杨孝文 9 nr
+杨学军 2 nr
+杨宇占 2 nr
+杨宇霆 9 nr
+杨宇飞 69 nr
+杨守敬 262 nr
+杨守素 2 nr
+杨守绩 2 nr
+杨安儿 3 nr
+杨宋镇 2 nr
+杨宗保 6 nr
+杨宝东 2 nr
+杨宝忠 4 nr
+杨宝森 6 nr
+杨宝玲 3 nr
+杨宣伐 2 nr
+杨宣初 2 nr
+杨宣进 2 nr
+杨宪益 3 nr
+杨家 84 nrfg
+杨家乡 3 nr
+杨家传 3 nr
+杨家兄弟 2 nr
+杨家台 256 nr
+杨家和 2 nr
+杨家坪 5 nr
+杨家埠 28 ns
+杨家娘子 2 nr
+杨家实 2 nr
+杨家将 32 nr
+杨家山 4 nr
+杨家岭 9 nr
+杨家庄 66 nr
+杨家府 9 nr
+杨家明 4 nr
+杨家村 3 nr
+杨家枪 4 nr
+杨家沟 3 nr
+杨家湾 2 nr
+杨家潭 256 nr
+杨寅秋 2 nr
+杨寅立 5 nr
+杨富强 2 nr
+杨对望 4 nr
+杨对陈 2 nr
+杨将军 6 nr
+杨尉屏 3 nr
+杨小凯 9 nr
+杨小勇 2 nr
+杨小奇 3 nr
+杨小姐 18 nr
+杨小平 2 nr
+杨小楼 14 nr
+杨小纲 18 nr
+杨小邪 2 nr
+杨少侠 8 nr
+杨少华 3 nr
+杨尚昆 244 nr
+杨居士 26 nr
+杨山一 2 nr
+杨山松 23 nr
+杨峻荣 3 nr
+杨崇伊 7 nr
+杨崇南 2 nr
+杨崇瑞 5 nr
+杨左使 11 nr
+杨巨源 2 nr
+杨师傅 4 nr
+杨师兄 2 nr
+杨师弟 5 nr
+杨希闵 11 nr
+杨帮主 8 nr
+杨干贞 4 nr
+杨广为 3 nr
+杨广乘 2 nr
+杨庄镇 3 nr
+杨庆善 2 nr
+杨应龙 13 nr
+杨府君 2 nr
+杨康之 7 nr
+杨康兄弟 3 nr
+杨康强 2 nr
+杨康心 2 nr
+杨康忙 2 nr
+杨康忽 2 nr
+杨康怒 2 nr
+杨康正 2 nr
+杨康死 2 nr
+杨康笑 8 nr
+杨康落 2 nr
+杨康见 9 nr
+杨康递 2 nr
+杨延昭 3 nr
+杨延朗 2 nr
+杨延辉 3 nr
+杨廷和 59 nr
+杨廷宝 3 nr
+杨廷相 3 nr
+杨廷福 34 nr
+杨廷筠 5 nr
+杨廷麟 79 nr
+杨建中 6 nr
+杨建伟 3 nr
+杨建军 27 nr
+杨建华 273 nr
+杨建华笑笑 3 nr
+杨建文 2 nr
+杨建明 2 nr
+杨开乔 2 nr
+杨开慧 18 nr
+杨开然 7 nr
+杨得志 12 nr
+杨德中 2 nr
+杨德和 2 nr
+杨德泉 2 nr
+杨德清 256 nr
+杨德炳 8 nr
+杨德琪 3 nr
+杨德祖 3 nr
+杨心赤 2 nr
+杨志一 2 nr
+杨志便 5 nr
+杨志刚 2 nr
+杨志国 2 nr
+杨志大 5 nr
+杨志强 2 nr
+杨志戴 2 nr
+杨志提 3 nr
+杨志明 3 nr
+杨志望 3 nr
+杨志毅 45 nr
+杨志玖 10 nr
+杨志翔 29 nr
+杨志谢 2 nr
+杨志领 5 nr
+杨忠烈 3 nr
+杨念如 7 nr
+杨思泽 2 nr
+杨总管 5 nr
+杨恩寿 3 nr
+杨恭如 3 nr
+杨惟中 9 nr
+杨惟忠 3 nr
+杨惠珊 3 ns
+杨慎之 2 nr
+杨慎兄 2 nr
+杨慎幼 2 nr
+杨慎矜 10 nr
+杨慧霞 2 nr
+杨懋春 2 nr
+杨成 15 nrfg
+杨成协 102 nr
+杨成志 5 nr
+杨成武 42 nr
+杨戬主 2 nr
+杨所修 24 nr
+杨所知 2 nr
+杨承琳 3 nr
+杨承祖 25 nr
+杨拯陆 2 nr
+杨振亚 6 nr
+杨振华 3 nr
+杨振声 3 nr
+杨振宁 87 nr
+杨振杰 2 nr
+杨振鹏 4 nr
+杨挺伟 22 nr
+杨摇摇 2 nr
+杨摩西 257 nr
+杨文会 6 nr
+杨文学 2 nr
+杨文岳 148 nr
+杨文广 5 nr
+杨文意 4 nr
+杨文敏 4 nr
+杨文道 5 nr
+杨文骢 100 nr
+杨斌 6 nr
+杨斯岑 2 nr
+杨新华 2 nr
+杨新民 10 nr
+杨新海 3 nr
+杨方亨 8 nr
+杨时乔 3 nr
+杨昌济 6 nr
+杨明义 5 nr
+杨明儿 2 nr
+杨明山 8 nr
+杨明德 14 nr
+杨明方 8 nr
+杨明杰 2 nr
+杨明琴 3 nr
+杨明福 11 nr
+杨明训 2 nr
+杨明轩 3 nr
+杨明龙 3 nr
+杨易道 2 nr
+杨春光 2 nr
+杨春南 4 nr
+杨春喜 21 nr
+杨春心 2 nr
+杨春指 2 nr
+杨春敏 4 nr
+杨春贵 2 nr
+杨春长 7 nr
+杨春霞 2 nr
+杨显之 3 nr
+杨显惠 23 nr
+杨晓民 2 nr
+杨晓波 257 nr
+杨晓霞 2 nr
+杨晨晖 256 nr
+杨普雄 2 nr
+杨景亭 6 nr
+杨景宇 259 nr
+杨晴川 13 nr
+杨月楼 2 nr
+杨朝明 3 nr
+杨朝栋 5 nr
+杨朝英 2 nr
+杨木 7 nr
+杨本庵 48 nr
+杨杏佛 9 nr
+杨杏忙 2 nr
+杨杏才 2 nr
+杨杏接 2 nr
+杨林引 2 nr
+杨林道 2 nr
+杨枝鱼 3 nr
+杨柏龄 256 nr
+杨柳 411 nr
+杨柳依依 4 nr
+杨柳儿 3 nr
+杨柳宫眉 3 nr
+杨柳岸 7 nr
+杨柳枝 19 nr
+杨柳树 3 nr
+杨柳池 3 nr
+杨柳湖 2 nr
+杨柳科 6 nr
+杨柳镇 3 nr
+杨柳青 22 nr
+杨柳风 2 nr
+杨树 127 nr
+杨树叶子 2 nr
+杨树房 3 nr
+杨树林 5 nr
+杨树江 8 nr
+杨树泉 3 nr
+杨树浦 8 nr
+杨树皮 3 nr
+杨树花 3 nr
+杨根思 25 nr
+杨桂林 4 nr
+杨桃 22 nr
+杨桃岭 3 nr
+杨桃汁 3 nr
+杨桥湖 768 nr
+杨桦林 2 nr
+杨梅 67 nr
+杨梅汁 3 nr
+杨梅疮 2 n
+杨梅镇 3 nr
+杨森 27 nr
+杨椒山 3 nr
+杨楼乡 3 nr
+杨槐璋 2 nr
+杨正午 2 nr
+杨正在 3 nr
+杨正泉 2 nr
+杨正超 22 nr
+杨步月 2 nrfg
+杨武陵 6 nr
+杨氏双 2 nr
+杨氏姊妹 3 nr
+杨氏实验 3 nr
+杨氏模 3 nr
+杨氏模量 3 nr
+杨民高 32 nr
+杨永泰 4 nr
+杨永良 3 nr
+杨永裕 2 nr
+杨汉中 3 nr
+杨汝岱 15 nrfg
+杨波坦 256 nr
+杨洁篪 94 nr
+杨洪明 4 nr
+杨洪胜 2 nr
+杨浦 26 nr
+杨浦区 9 nr
+杨浦大桥 11 nr
+杨海成 3 nrfg
+杨海潮 3 nr
+杨海韬 2 nrfg
+杨淑 2 n
+杨深秀 10 nr
+杨清漪 14 nr
+杨溢之 60 nr
+杨潮观 6 nr
+杨澜 5 nrfg
+杨炎入 2 nr
+杨炎升 2 nr
+杨炎官 2 nr
+杨炳珍 2 nr
+杨炳章 7 nr
+杨点点 4 nr
+杨燕华 2 nr
+杨献珍 259 nr
+杨玄威 8 nr
+杨玄感 21 nr
+杨玄石 3 nr
+杨玉峰 2 nr
+杨玉敏 2 nr
+杨玉梅 3 nr
+杨玉环 10 nr
+杨玉莹 3 nr
+杨班侯 2 nr
+杨琏真 2 nr
+杨瑞敏 2 nr
+杨生黄雀 3 nr
+杨用成 20 nrfg
+杨用霖 4 nr
+杨白冰 11 nr
+杨白劳 7 nr
+杨白泉 33 nr
+杨百业 52 nr
+杨百利 148 nr
+杨百顺 482 nr
+杨的飞 2 nr
+杨皇后 2 nr
+杨相公 8 nr
+杨盼盼 3 nr
+杨真先生 7 nr
+杨石先 3 nr
+杨磊横 2 nr
+杨祖云 2 nr
+杨祖希 5 nr
+杨福同 2 nr
+杨福家 2 nr
+杨福山 2 nr
+杨福昌 4 nr
+杨福生 16 nr
+杨秀各 2 nr
+杨秀峰 6 nr
+杨秀敏 2 nr
+杨秀梅 3 nr
+杨秀武 2 nr
+杨秀清 49 nr
+杨秀珠 8 nr
+杨秀眉 2 nr
+杨秀雯 2 nr
+杨秋玲 2 nr
+杨积余 4 nr
+杨程陆 2 nr
+杨稷横 3 nr
+杨穿三叶 3 n
+杨立孝 11 nr
+杨立新 3 nr
+杨立民 2 nr
+杨章跃 3 nr
+杨童舒 3 nr
+杨素工 3 nr
+杨紫琼 3 nr
+杨红卫 10 nr
+杨红樱 3 nr
+杨红英 45 nr
+杨经理 11 nr
+杨经纬 2 nr
+杨继业 4 nr
+杨继盛 149 nr
+杨维 269 nr
+杨维垣 13 nr
+杨维桢 4 nr
+杨绵绵 3 nr
+杨羚 3 n
+杨翠喜 5 nr
+杨翰林 2 nr
+杨老儿 2 nr
+杨老爷 10 nr
+杨育才 2 nr
+杨胖子 2 nr
+杨胜利 4 nr
+杨胜群 2 nr
+杨臣刚 256 nr
+杨舍镇 2 nr
+杨舰队 3 nr
+杨花台村 4 ns
+杨花心性 3 nr
+杨花水性 3 nr
+杨苗洲 256 ns
+杨若兮 3 nr
+杨若有 2 nr
+杨若薇 4 nr
+杨英华 2 nr
+杨英雄 2 nr
+杨茂儒 2 nr
+杨荔 3 nrfg
+杨荣明 3 nr
+杨荫庆 2 nr
+杨莲亭 104 nr
+杨萱庭 5 v
+杨蓉娅 2 nr
+杨虎围匡 3 nr
+杨虎城 107 nr
+杨虞候 4 nr
+杨行密 67 nr
+杨衍银 2 nr
+杨衙内 2 nr
+杨许强 3 nr
+杨证执 2 nr
+杨诚会 12 nr
+杨诚伸 4 nr
+杨诚你 4 nr
+杨诚依然 2 nr
+杨诚便 2 nr
+杨诚刚 4 nr
+杨诚告 2 nr
+杨诚才 6 nr
+杨诚斋 2 nr
+杨诚直 2 nr
+杨诚真 2 nr
+杨诚确 2 nr
+杨诚竟 4 nr
+杨诚话 4 nr
+杨诚调 4 nr
+杨诚谈 4 nr
+杨诚顿 2 nr
+杨诚马 2 nr
+杨诺夫 6 nr
+杨谱生 2 nr
+杨贤江 2 nr
+杨贤足 13 nr
+杨贵兰 4 nr
+杨贵妃 81 nr
+杨贵媚 3 nr
+杨贵珍 17 nr
+杨赛因 7 nr
+杨赞画 3 nr
+杨起隆 3 nr
+杨跃华 5 nr
+杨轻叹 2 nr
+杨载福 3 nr
+杨辅清 4 nr
+杨辉三角 3 nr
+杨达波 3 nr
+杨过东 3 nr
+杨过举 8 nr
+杨过之 7 nr
+杨过乘 2 nr
+杨过亦 2 nr
+杨过仗 2 nr
+杨过仰 4 nr
+杨过伏 6 nr
+杨过伸 10 nr
+杨过依 13 nr
+杨过修 4 nr
+杨过先 2 nr
+杨过全 4 nr
+杨过冲 4 nr
+杨过凝 6 nr
+杨过刚 3 nr
+杨过初 2 nr
+杨过削 2 nr
+杨过剑 12 nr
+杨过势 2 nr
+杨过勒 2 nr
+杨过千 2 nr
+杨过单 2 nr
+杨过原 2 nr
+杨过双 15 nr
+杨过右 8 nr
+杨过叹 18 nr
+杨过吓 12 nr
+杨过吟 2 nr
+杨过呆 2 nr
+杨过告 2 nr
+杨过哀 2 nr
+杨过喜 30 nr
+杨过嘻 2 nr
+杨过固 4 nr
+杨过均 4 nr
+杨过奇 27 nr
+杨过奔 10 nr
+杨过如 4 nr
+杨过姿 2 nr
+杨过存 2 nr
+杨过定 6 nr
+杨过实 5 nr
+杨过尚 2 nr
+杨过岂 2 nr
+杨过径 2 nr
+杨过微 12 nr
+杨过微微 33 nr
+杨过心 87 nr
+杨过念 6 nr
+杨过怒 21 nr
+杨过情 2 nr
+杨过愈 2 nr
+杨过才 3 nr
+杨过执 3 nr
+杨过抄 2 nr
+杨过折 6 nr
+杨过抚 6 nr
+杨过抡 2 nr
+杨过拉 4 nr
+杨过拔 2 nr
+杨过招 2 nr
+杨过拳 2 nr
+杨过拾 2 nr
+杨过挺 6 nr
+杨过提 4 nr
+杨过揽 2 nr
+杨过摇 2 nr
+杨过擒 2 nr
+杨过攻 6 nr
+杨过放 3 nr
+杨过斗 5 nr
+杨过料 6 nr
+杨过新 2 nr
+杨过方 2 nr
+杨过智 4 nr
+杨过服 6 nr
+杨过朗 15 nr
+杨过望 14 nr
+杨过本 7 nr
+杨过机 2 nr
+杨过杨 2 nr
+杨过松 2 nr
+杨过极 2 nr
+杨过果 2 nr
+杨过柔 4 nr
+杨过棒 4 nr
+杨过横 4 nr
+杨过欲 2 nr
+杨过正 23 nr
+杨过武 3 nr
+杨过毫 2 nr
+杨过求 2 nr
+杨过泼 2 nr
+杨过浑 2 nr
+杨过深 2 nr
+杨过混 2 nr
+杨过游 4 nr
+杨过满 2 nr
+杨过焉 2 nr
+杨过爱 6 nr
+杨过牵 7 nr
+杨过猜 4 nr
+杨过现 2 nr
+杨过疾 3 nr
+杨过相 7 nr
+杨过真 3 nr
+杨过知 28 nr
+杨过稳 2 nr
+杨过究 2 nr
+杨过空 2 nr
+杨过突 3 nr
+杨过立 4 nr
+杨过竟 7 nr
+杨过竹 2 nr
+杨过笑 139 nr
+杨过箫 2 nr
+杨过素 2 nr
+杨过絮 4 nr
+杨过练 8 nr
+杨过结 3 nr
+杨过绕 2 nr
+杨过续 3 nr
+杨过耳 4 nr
+杨过臀 2 nr
+杨过若 7 nr
+杨过衣 2 nr
+杨过见 52 nr
+杨过觉 2 nr
+杨过誓 2 nr
+杨过记 4 nr
+杨过识 2 nr
+杨过诚 2 nr
+杨过谦 2 nr
+杨过谨 2 nr
+杨过赞 2 nr
+杨过越 12 nr
+杨过跃 8 nr
+杨过转 6 nr
+杨过进 3 nr
+杨过远 2 nr
+杨过连 25 nr
+杨过迭 2 nr
+杨过逊 2 nr
+杨过递 7 nr
+杨过逗 3 nr
+杨过钻 2 nr
+杨过长 3 nr
+杨过闻 2 nr
+杨过防 2 nr
+杨过震 2 nr
+杨过顿 2 nr
+杨过额 2 nr
+杨过飞 7 nr
+杨过驱 2 nr
+杨过骑 2 nr
+杨过默 2 nr
+杨远群 3 nr
+杨连弟 6 nr
+杨连真 8 nr
+杨逢华 4 nr
+杨遇春 6 nr
+杨邦宪 5 nr
+杨采妮 3 nr
+杨金林 6 nr
+杨金欉 3 nz
+杨金英 11 nr
+杨金莲 2 nr
+杨钟健 7 nr
+杨钫涵 3 nr
+杨钰莹 3 nr
+杨铁嘴 12 nr
+杨铁崖 2 nr
+杨铁心 256 nr
+杨铁虎 2 nr
+杨铭泉 2 nr
+杨铿内 3 nr
+杨锋引 2 nr
+杨锐 94 nr
+杨锐兄 2 nr
+杨锐密 3 nr
+杨锐朗 2 nr
+杨锡兰 3 nr
+杨锡金 7 nr
+杨锦麟 8 nr
+杨镐之 3 nr
+杨镐兄 2 nr
+杨镖头 2 vn
+杨长得 2 nr
+杨长槐 256 nr
+杨问孙 2 nr
+杨闻孙 256 nr
+杨闻言 3 nr
+杨阁老 4 nr
+杨阁部 15 nr
+杨陆凯 15 nr
+杨院长 2 nr
+杨陵 17 nr
+杨陵区 3 nr
+杨隆寿 2 nr
+杨隆演 6 nr
+杨雀衔环 3 nr
+杨雄便 2 nr
+杨雄道 5 nr
+杨雄醉 3 nr
+杨雄里 3 nr
+杨雪一 2 nr
+杨雪义 3 nr
+杨雪仪 3 nr
+杨雪仰 3 nr
+杨雪听 2 nr
+杨雪揉 2 nr
+杨雪暾 3 nr
+杨雪正 2 nr
+杨霞清 2 nr
+杨露蝉 5 nr
+杨霹雳 2 nr
+杨靖宇 71 nr
+杨静仁 4 nr
+杨韵谱 2 nr
+杨顶建 3 nr
+杨骏夷 2 nr
+杨高中 2 nrfg
+杨高虎 15 nr
+杨魁孚 2 nr
+杨鸣健 3 nr
+杨鹏举 96 nr
+杨麻胡 3 nr
+杨齐宣 2 nr
+杨龙友 8 nr
+杩 3505 x
+杪 15 zg
+杫 2 zg
+杬 283 zg
+杭 1279 nr
+杭七 2 ns
+杭世骏 8 nr
+杭丝联 2 nr
+杭九斋 90 nr
+杭二州 3 nr
+杭保尔 3 nr
+杭先生 2 nr
+杭剧 3 n
+杭嘉乔 104 nr
+杭嘉和 40 nr
+杭嘉平 114 nr
+杭嘉湖 57 nr
+杭嘉草 5 nr
+杭城 50 ns
+杭埠河 9 ns
+杭天琪 3 nr
+杭天醉 871 nr
+杭夫人 13 nr
+杭子和 2 nr
+杭家五 2 nr
+杭家人 26 nr
+杭家兄弟 3 nr
+杭家和 2 nr
+杭家大 5 nr
+杭家茶 2 nr
+杭寄草 32 nr
+杭少爷 31 nr
+杭州 2806 ns
+杭州人 117 nr
+杭州大学 13 nt
+杭州市 156 ns
+杭州市中级人民法院 3 nt
+杭州市区 3 ns
+杭州市委 3 nt
+杭州市政府 2 nt
+杭州府 20 nr
+杭州湾 103 ns
+杭州网 3 nr
+杭州话 3 nr
+杭州路 9 ns
+杭布朗 16 nr
+杭师院 3 nr
+杭帮菜 3 nr
+杭廷登 3 nr
+杭得放 73 nr
+杭得茶 174 nr
+杭忆便 2 nr
+杭忆哥 2 nr
+杭忆才 3 nr
+杭忆杭 7 nr
+杭忆站 2 nr
+杭方越 17 nr
+杭氏家族 18 nr
+杭汉 562 ns
+杭汉便 4 nr
+杭汉先 2 nr
+杭汉叹 2 nr
+杭汉吓 2 nr
+杭汉听 3 nr
+杭汉打 2 nr
+杭汉正 3 nr
+杭汉站 2 nr
+杭汉笑笑 2 nr
+杭汉见 4 nr
+杭汉边 2 nr
+杭海 2 ns
+杭海岭 2 ns
+杭爱山 26 nr
+杭爱省 3 ns
+杭甬运河 5 ns
+杭白菊 6 nr
+杭盼养 2 nr
+杭立武 10 nr
+杭纺 10 nr
+杭老二 2 nr
+杭老板 8 nr
+杭育 2 nr
+杭迎霜 24 nr
+杭运道 2 nr
+杭逸杭 2 nr
+杭铁头 2 nr
+杭锦 4 nr
+杭锦后旗 6 nr
+杭锦旗 30 nr
+杮 2 zg
+杯 2695 q
+杯中 81 s
+杯中之物 3 i
+杯中物 3 n
+杯中蛇影 3 i
+杯中酒 3 n
+杯内 3 s
+杯口 24 n
+杯子 428 n
+杯底 3 n
+杯座 3 n
+杯弓市虎 3 i
+杯弓蛇影 8 i
+杯影蛇弓 3 i
+杯杯 5 n
+杯水 46 n
+杯水之敬 3 i
+杯水之谢 3 i
+杯水粒粟 3 n
+杯水舆薪 3 v
+杯水车薪 36 i
+杯状病毒 3 n
+杯盏交错 3 n
+杯盖 5 n
+杯盘 3 n
+杯盘狼籍 3 n
+杯盘狼藉 11 i
+杯羹之让 3 i
+杯茗之敬 3 v
+杯葛 3 n
+杯蛇幻影 3 i
+杯蛇鬼车 3 i
+杯觥交错 3 v
+杯赛 64 n
+杯酒 155 n
+杯酒戈矛 3 i
+杯酒解怨 3 i
+杯酒言欢 3 i
+杯酒释兵权 5 n
+杰 649 nr
+杰亨斯 2 nr
+杰伊 10 nrt
+杰伊汉 2 nr
+杰佛逊 2 nr
+杰作 300 n
+杰克 67 nrt
+杰克森 2 nr
+杰克逊 141 nr
+杰克韦尔 5 nrt
+杰兹卡兹甘 3 nrt
+杰内 2 nrt
+杰出 1318 a
+杰出人才 3 n
+杰出人材 3 n
+杰出人物 3 n
+杰出代表 3 n
+杰出成就 3 n
+杰出贡献 3 nr
+杰出青年 3 nr
+杰加尼 2 nr
+杰勒德 3 nr
+杰卡尔 7 nr
+杰卢姆 3 nr
+杰吉尔 3 nr
+杰哈德 3 nr
+杰塞普 2 nr
+杰士卡 4 nr
+杰士邦 3 nr
+杰夫 24 nrt
+杰奈塔 2 nr
+杰奎斯 3 nr
+杰奎琳 44 nr
+杰奥吉奥斯 2 nrt
+杰姆 3 nrt
+杰姆代 9 nr
+杰姆斯 4 nr
+杰姆逊 3 nr
+杰安特 2 nr
+杰尔宾 3 nr
+杰尔巴岛 2 nrt
+杰尔查 2 nr
+杰尔达 4 nr
+杰尼亚 10 nr
+杰尼克 3 nr
+杰尼斯 3 nr
+杰尼索夫 3 nrt
+杰布塘 2 nrt
+杰帕德 8 nr
+杰弗森 48 nr
+杰弗逊 40 nr
+杰弗里 17 nrt
+杰弗里斯 15 nrt
+杰弗雷 3 nr
+杰拉 17 nrt
+杰拉尔 9 nr
+杰拉德 24 nrt
+杰文斯 11 nr
+杰斐逊 45 nr
+杰斯 10 nrt
+杰斯特 2 nrt
+杰斯纳河 2 nrt
+杰日尼 2 nr
+杰日尼奥夫角 4 nrt
+杰明街 4 nr
+杰构 3 n
+杰格佳 2 nr
+杰洛士 3 nr
+杰济拉 2 nr
+杰琳 18 nrt
+杰琼斯 3 nr
+杰瑞 11 nr
+杰瑞库 2 nr
+杰瑞米 3 nr
+杰科布 4 nr
+杰米 4 nrt
+杰索尔 3 nr
+杰纳布 2 nr
+杰纳布河 5 nrt
+杰纳斯 4 nr
+杰维斯 2 nr
+杰罗姆 7 nr
+杰苏阿 2 nr
+杰裴逊 2 nr
+杰西 11 nrt
+杰西卡 4 nr
+杰贝勒 4 nr
+杰赤城 8 nr
+杰赫勒 3 nr
+杰赫勒姆河 5 nrt
+杰达姆 3 nr
+杰里 7 nrt
+杰里梅 2 nr
+杰里科 17 nrt
+杰里米 3 nrt
+東 6 zg
+杲 50 nr
+杲杲 3 nr
+杳 52 zg
+杳不可闻 3 i
+杳如黄鹤 4 i
+杳无 3 v
+杳无人烟 2 i
+杳无人迹 6 i
+杳无信息 3 i
+杳无影响 3 i
+杳无消息 3 i
+杳无踪影 3 i
+杳无踪迹 3 i
+杳无音信 27 i
+杳无音耗 3 l
+杳无音讯 10 i
+杳无黄鹤 3 i
+杳渺 3 i
+杳然 3 i
+杳茫 3 l
+杴 2 zg
+杵 370 zg
+杵臼 5 n
+杵臼之交 3 n
+杵臼交 3 n
+杷 20 x
+杷子 3 ns
+杸 11 zg
+杹 4 zg
+杻 5 zg
+杼 24 g
+杼柚之空 3 nr
+杼柚其空 3 nr
+杼柚空虚 3 nr
+杼轴 3 nr
+杽 106 zg
+松 3715 v
+松一松 4 nr
+松下 167 n
+松下公司 4 n
+松下幸之助 17 nr
+松下电器 3 n
+松下电器产业公司 2 nt
+松下电器公司 10 nt
+松下电机 3 n
+松不松 2 a
+松中昭 2 nr
+松义郎 5 nr
+松乔之寿 3 nr
+松井 2 ns
+松井石根 15 ns
+松亭关 7 nr
+松仁 24 nr
+松兰 2 ns
+松冈 6 ns
+松动 168 a
+松劲 16 a
+松北区 3 ns
+松原 3 ns
+松原市 6 ns
+松口 13 ns
+松口气 3 n
+松口鞋 3 n
+松叶 2 nr
+松叶清 2 nr
+松嘴 3 ns
+松土 26 n
+松土机 2 n
+松坪山 3 ns
+松垮 7 v
+松城 2 ns
+松墙子 3 n
+松声竹韵 3 nr
+松姆河 2 nr
+松嫩 3 ns
+松嫩平原 65 ns
+松子 55 n
+松子糖 9 nr
+松宫亲王 4 nr
+松宽红 3 nr
+松寿兰 2 nr
+松尾 9 ns
+松山 212 ns
+松山一 11 nr
+松山之 2 nr
+松山兵 5 nr
+松山区 4 ns
+松山堡 29 ns
+松山机场 3 ns
+松山湖 3 ns
+松岗 8 ns
+松岗镇 3 nr
+松岛 18 ns
+松岛枫 3 nr
+松岭 11 ns
+松峦峰 2 nr
+松川 3 ns
+松巴 22 ns
+松师伯 9 nr
+松开 303 v
+松弛 371 a
+松弛下来 3 vn
+松弛到 3 vn
+松弛法 2 vn
+松形鹤骨 3 nr
+松德桥 3 nr
+松德赞 2 nr
+松心 3 n
+松快 14 a
+松懈 189 a
+松懈下 3 vn
+松懈下来 3 vn
+松手 217 n
+松扣 2 n
+松散 291 v
+松散地 3 n
+松散型 5 n
+松散层 4 n
+松方 2 n
+松日 30 n
+松明 11 nr
+松明子 2 nr
+松有柏 2 nr
+松木 47 nr
+松木板 3 nr
+松本 16 ns
+松本润 3 n
+松材 7 n
+松松 19 a
+松松地 2 z
+松松垮垮 26 z
+松松散散 3 nr
+松松束 2 nr
+松松脆脆 3 z
+松松软软 3 nr
+松林 230 ns
+松林山 256 ns
+松果 26 n
+松果体 21 n
+松果体素 3 n
+松果腺 22 n
+松枝挂剑 3 n
+松柏 144 nr
+松柏之寿 3 nr
+松柏之志 3 nr
+松柏之茂 3 nr
+松柏乡 3 ns
+松柏园 3 nr
+松柏寒盟 3 nr
+松柏常青 3 nr
+松柏植物 3 nr
+松柏生 3 nr
+松柏类 3 nr
+松柏长青 3 nr
+松柔 3 a
+松柴 6 n
+松树 550 nr
+松树枝 3 nr
+松桃 6 nr
+松桃苗族自治县 5 ns
+松毛狗 2 nr
+松毛虫 32 nr
+松毬 3 z
+松气 4 n
+松水桥 256 nr
+松江 256 ns
+松江区 5 ns
+松江县 15 ns
+松江省 8 ns
+松江镇 2 ns
+松江鲈 2 nr
+松油 10 n
+松油烯 6 n
+松波特 2 nr
+松浦郡 2 nr
+松浮 3 ns
+松涛 46 nr
+松涧火 7 nr
+松溪 12 ns
+松溪县 3 ns
+松滋 283 ns
+松滋县 3 nr
+松滋市 260 n
+松潘 24 nr
+松潘北 2 ns
+松潘县 9 ns
+松潘镇 2 nr
+松火轻 2 nr
+松烛 10 n
+松烟 5 n
+松焦油 3 n
+松狮犬 3 nr
+松球 36 n
+松田 3 nr
+松田圣子 3 nr
+松皮 2 n
+松石 3 nr
+松石图 2 nr
+松科 13 ns
+松科常 2 nr
+松立 3 v
+松竹斋 2 nr
+松竹梅 3 nr
+松筠之节 3 nr
+松筠庵 6 nr
+松篁 2 ns
+松类 3 n
+松籽 3 n
+松糕 11 a
+松糕鞋 3 v
+松紧 38 a
+松紧带 14 nr
+松紧度 4 n
+松绑 25 v
+松缓 3 a
+松胶 3 n
+松脂 75 ns
+松脆 13 a
+松脱 3 v
+松自思 3 nr
+松节 3 n
+松节油 34 n
+松节油精 3 n
+松花 281 n
+松花江 276 ns
+松花江平 3 ns
+松花江流域 18 ns
+松花江畔 5 ns
+松花湖 17 ns
+松花粉 3 nr
+松花蛋 15 nr
+松茂竹苞 3 nr
+松茸 15 n
+松菌 3 n
+松萝 10 n
+松萝共倚 3 nr
+松蕈 3 n
+松蘑 3 n
+松虎 3 nr
+松见丰 2 nr
+松解 2 v
+松解术 2 n
+松谷庵 3 nr
+松貂鼠 3 nr
+松质骨 3 n
+松赞干布 82 nr
+松起 3 v
+松起来 3 nr
+松软 423 a
+松软适口 3 nr
+松辽 81 ns
+松辽平原 3 ns
+松辽盆地 8 ns
+松迪亚 11 ns
+松道兄 8 nr
+松针 37 n
+松钦巴 7 nr
+松门 2 ns
+松门山 2 ns
+松门岭 3 ns
+松闲 3 a
+松阳 4 ns
+松阳县 3 ns
+松阳师范 3 nr
+松阴 2 ns
+松阴溪 2 nr
+松阿察 8 nr
+松陵 4 ns
+松隆子 3 nr
+松雪斋 5 nr
+松雪道人 2 nr
+松静 5 a
+松风剑 5 nr
+松风观 19 nr
+松风里 5 nr
+松饶 2 ns
+松饼 3 n
+松香 66 nr
+松香水 3 nr
+松香油 3 nr
+松香脂 3 ns
+松香酸 9 nz
+松驰 17 nr
+松鱼 3 n
+松鸡 14 ns
+松鹤图 4 nr
+松鹤楼 2 nr
+松鹤轩 7 nr
+松鼠 158 n
+松鼠猴 3 n
+松鼠鱼 3 n
+板 5049 ng
+板上砸钉 3 nz
+板上钉钉 16 i
+板书 9 n
+板书设计 3 n
+板仓 2 n
+板儿 45 n
+板凳 284 n
+板刷 8 n
+板升 9 nz
+板卡 3 n
+板卷 3 n
+板块 1274 n
+板坯 9 n
+板垣 43 n
+板墙 4 n
+板壁 124 n
+板子 130 n
+板实 3 n
+板寸头 14 n
+板层 2 n
+板屋 9 n
+板岩 72 n
+板带 5 n
+板床 20 n
+板式 97 n
+板式家具 3 n
+板房 2 n
+板房沟 2 n
+板手 3 n
+板报 7 n
+板接口 2 n
+板擦 2 n
+板擦儿 3 n
+板料 8 n
+板斧 66 n
+板本 3 n
+板机 3 n
+板材 58 n
+板条 3 n
+板条箱 3 n
+板极 3 n
+板栗 682 n
+板栗树 6 n
+板根 5 n
+板框 2 n
+板桌 3 n
+板桥 63 n
+板桥中学 3 n
+板桥国中 3 nz
+板桥国小 3 n
+板桥市 3 ns
+板桥镇 6 ns
+板正 10 n
+板油 5 n
+板滞 7 n
+板烟 3 n
+板牙 14 n
+板状 86 n
+板猪 3 n
+板球 12 n
+板画 3 n
+板皮 15 n
+板眼 21 n
+板着脸 3 n
+板石 4 n
+板砖 17 n
+板筋 3 n
+板簧 4 n
+板粟 3 n
+板系统 3 n
+板纸 3 n
+板结 48 n
+板结构 5 n
+板羽球 3 n
+板胡 37 n
+板脸 3 n
+板芙 3 nrt
+板芯片组 5 n
+板荡 8 n
+板蓝根 54 n
+板起面孔 3 n
+板车 37 n
+板载 2 b
+板载显卡 3 n
+板载集成 3 n
+板边 3 n
+板金工 3 n
+板锉 3 n
+板锯 3 n
+板门 97 n
+板门店 40 n
+板阁 3 n
+板障 3 n
+板面 22 n
+板鸭 20 n
+板鼓 3 n
+极 15314 d
+极不 3 d
+极个别 3 d
+极为 3287 d
+极为重要 3 i
+极乐 77 a
+极乐世界 38 n
+极乐寺 3 n
+极乐舞 3 n
+极乐鸟 28 n
+极了 1309 d
+极佳 3 a
+极值 55 n
+极值场 3 n
+极光 112 n
+极其 2001 d
+极其丰富 3 i
+极其可怕 3 d
+极其拥挤 3 v
+极其负责 3 i
+极其重要 3 i
+极具 3 n
+极冠 7 n
+极冷 3 a
+极刑 42 n
+极则必反 3 i
+极力 905 n
+极力争取 3 i
+极力回避 3 i
+极力寻求 3 i
+极力推荐 3 i
+极化 184 n
+极化函数 3 n
+极化处理 3 n
+极化效应 3 n
+极化曲线 3 n
+极化电荷 3 n
+极化转移 3 i
+极化过程 3 n
+极北 25 ns
+极压 4 n
+极反转 3 i
+极口 3 n
+极口项斯 3 n
+极古穷今 3 n
+极右 58 m
+极右份子 3 n
+极右派 9 n
+极右翼 11 i
+极品 136 n
+极品飞车 3 n
+极圈 3 n
+极地 287 n
+极地冰川 3 ns
+极地气候 3 n
+极地气象 3 n
+极地馆 3 n
+极坏 3 v
+极坐标 16 n
+极处 3 d
+极多 3 d
+极夜 3 d
+极大 3796 a
+极大丰富 3 nz
+极大值 32 n
+极大元 3 m
+极大地提高 6 i
+极天罔地 3 i
+极天蟠地 3 i
+极天际地 3 d
+极好 600 d
+极好地 3 n
+极容易 3 d
+极富 303 a
+极寿无疆 3 i
+极小 305 d
+极小值 3 n
+极小对 3 i
+极小解 3 n
+极小量 3 n
+极少 1040 d
+极少数 385 m
+极少数人 3 n
+极少量 3 n
+极尽 3 d
+极左 184 b
+极左份子 3 i
+极左派 3 m
+极差 3 n
+极带地区 3 n
+极广 3 a
+极度 651 d
+极度地 3 n
+极式分解 3 n
+极往知来 3 i
+极微 3 d
+极微小 3 n
+极快 16 d
+极性 169 n
+极性单体 3 n
+极性相反 2 i
+极性逆转 3 i
+极性键 3 n
+极恶 3 a
+极恶不赦 3 i
+极恶穷凶 3 n
+极情尽致 3 i
+极情纵欲 3 i
+极意 9 d
+极愿 3 d
+极慢 3 d
+极早 3 d
+极易 3 a
+极昼 22 n
+极智穷思 3 i
+极本穷源 3 n
+极权 18 n
+极权主义 21 n
+极权国家 3 n
+极板 37 n
+极武穷兵 3 n
+极泉 3 n
+极深研几 3 n
+极深研幾 3 nz
+极漂亮 3 n
+极点 295 d
+极点五笔 3 m
+极热 3 a
+极盛 3 a
+极盛时期 3 n
+极目 286 n
+极目四望 3 i
+极目望去 3 i
+极目眺望 3 vn
+极目远望 4 i
+极目远眺 19 i
+极目迥望 3 vn
+极矢量 3 i
+极短 3 a
+极神圣 3 n
+极移 3 v
+极窄 3 a
+极端 1535 n
+极端主义 19 n
+极端分子 11 n
+极端化 25 n
+极端困难 3 i
+极端愚蠢 3 i
+极端派 3 n
+极端负责 3 n
+极端重要 3 n
+极缺 3 a
+极而言之 3 i
+极至 22 d
+极致 431 d
+极苦 3 d
+极表同情 3 n
+极谱极大 3 n
+极贵 3 a
+极轴 3 n
+极轻 3 d
+极远 3 d
+极速 3 d
+极速网 3 n
+极酷 3 a
+极重不反 3 i
+极重难返 3 i
+极量 5 n
+极间电容 3 n
+极限 624 a
+极限下载 3 n
+极限产量 3 n
+极限值 12 n
+极限法 3 n
+极限流 3 n
+极限点 3 n
+极限熔点 3 n
+极限运动 16 n
+极限速度 3 n
+极难 8 d
+极面 3 d
+极顶 7 n
+极高点 3 n
+枂 37 zg
+枃 331 zg
+构 770 v
+构乱 3 v
+构件 642 n
+构件之间 2 l
+构件分子 3 l
+构件厂 3 n
+构件块 3 n
+构件实现 2 l
+构件技术 3 n
+构伺 3 v
+构句 3 n
+构句法 3 l
+构图 246 v
+构图法 3 n
+构型 22 n
+构建 550 v
+构形 3 n
+构思 358 v
+构思新颖 2 n
+构思法 3 n
+构怨 3 v
+构怨连兵 3 l
+构想 383 v
+构想效度 3 l
+构成 6416 v
+构成主义 3 l
+构成基础 3 l
+构成威胁 3 n
+构成犯罪 3 l
+构成部份 3 n
+构架 141 n
+构树 5 n
+构模 3 n
+构法 4 n
+构画 3 n
+构祸 3 n
+构筑 430 n
+构筑工事 3 n
+构筑物 49 n
+构设 3 v
+构词 3 n
+构词法 17 n
+构象 3 n
+构象传递 3 l
+构象分析 3 l
+构象反转 3 l
+构象变化 3 l
+构象效应 3 n
+构象无序 3 l
+构象转换 3 v
+构造 2506 v
+构造作用 3 l
+构造函数 2 l
+构造地震 5 n
+构造型 3 n
+构造性 3 n
+构造方法 6 n
+构造旋回 3 n
+构造湖 3 n
+构造物 3 n
+构造程序 3 n
+构造类型 3 n
+构造论 3 n
+构造运动 152 l
+构造阶地 3 n
+构造高原 3 n
+构配件 3 n
+构陷 8 v
+枅 6 zg
+枆 8 zg
+枇 60 zg
+枇杷 102 n
+枇杷叶 3 n
+枇杷树 2 n
+枇杷膏 5 n
+枇杷门巷 3 ns
+枈 60 zg
+枉 667 vg
+枉勘虚招 3 nr
+枉口嚼舌 3 i
+枉口拔舌 3 i
+枉口诳舌 3 v
+枉墨矫绳 3 v
+枉尺直寻 3 i
+枉己正人 3 i
+枉曲直凑 3 i
+枉杀 3 v
+枉杀无辜 3 i
+枉此 3 i
+枉死 19 v
+枉死鬼 3 i
+枉法 17 v
+枉法从私 3 i
+枉法徇私 3 i
+枉法追诉 3 i
+枉然 88 z
+枉物难消 3 i
+枉用心机 3 i
+枉直同贯 3 i
+枉直随形 3 i
+枉矢哨壶 3 v
+枉矫过激 3 v
+枉突徙薪 3 i
+枉自 3 v
+枉费 24 v
+枉费唇舌 3 i
+枉费工夫 3 i
+枉费心力 3 i
+枉费心思 3 i
+枉费心机 11 i
+枉费心计 3 i
+枉费日月 3 i
+枉辔学步 3 i
+枉道事人 3 i
+枉顾 17 v
+枉驾 3 v
+枋 81 g
+枋头 3 ns
+枋寮 3 ns
+枋山 3 ns
+枋心 3 ns
+枋湖 3 ns
+枌 162 zg
+枏 10 zg
+析 845 vg
+析义 3 v
+析交离亲 3 vn
+析产 3 v
+析出 165 v
+析取 7 v
+析取概念 3 l
+析取范式 3 nr
+析因实验 3 vn
+析圭儋爵 3 v
+析圭分组 3 v
+析圭担爵 3 n
+析居 3 v
+析律舞文 3 vn
+析律贰端 3 z
+析微察异 3 nz
+析木 3 v
+析毫剖厘 3 n
+析毫剖芒 3 nr
+析珪判野 3 vn
+析珪胙土 3 vn
+析疑 2 v
+析疑匡谬 3 nr
+析精剖微 3 nr
+析缕分条 3 z
+析肝吐胆 3 nr
+析蜡点 3 z
+析言破律 3 v
+析辨诡词 3 nr
+析辨诡辞 3 nr
+析辩 3 v
+析辩诡辞 3 nr
+析骨而炊 3 v
+析骸以爨 3 nr
+析骸易子 3 t
+枒 67 zg
+枓 5 zg
+枕 869 n
+枕上 106 s
+枕中书 3 n
+枕中鸿宝 3 nz
+枕典席文 3 n
+枕冷衾寒 3 vn
+枕叶 9 n
+枕善而居 3 i
+枕垫 3 n
+枕头 598 n
+枕头套 3 n
+枕头箱 3 n
+枕头风 11 n
+枕套 32 n
+枕山栖谷 3 n
+枕山臂江 3 nz
+枕山襟海 3 i
+枕山负海 3 i
+枕岩漱流 3 n
+枕巾 18 n
+枕席 11 n
+枕席漱流 3 n
+枕席过师 3 n
+枕席还师 3 i
+枕席难安 3 i
+枕式 3 n
+枕形畸变 3 i
+枕心 3 n
+枕戈以待 3 i
+枕戈击楫 3 n
+枕戈剚刃 3 n
+枕戈坐甲 3 i
+枕戈寝甲 3 i
+枕戈尝胆 3 i
+枕戈待命 3 i
+枕戈待敌 3 i
+枕戈待旦 14 i
+枕戈披甲 3 i
+枕戈汗马 3 i
+枕戈泣血 3 i
+枕戈达旦 3 nz
+枕戈饮胆 3 i
+枕戈饮血 3 i
+枕支抗 3 i
+枕方寝绳 3 i
+枕曲藉糟 3 z
+枕木 58 n
+枕木条 3 n
+枕流漱石 3 n
+枕畔 5 n
+枕盒天线 3 n
+枕着 3 v
+枕石嗽流 3 n
+枕石寝绳 3 i
+枕石漱流 3 n
+枕稳衾温 3 v
+枕箱 3 n
+枕芯 30 n
+枕藉 18 nz
+枕资 3 n
+枕边 47 s
+枕边书 3 n
+枕边人 3 n
+枕边细语 3 i
+枕边言 3 n
+枕边风 3 n
+枕骨 19 n
+枕麹藉糟 3 z
+枖 2 zg
+林 8581 ng
+林一峰 3 nr
+林三官 3 nr
+林上林 3 nr
+林下 61 s
+林下植物 3 l
+林下清风 3 nr
+林下种植 3 l
+林下风度 3 n
+林下风气 3 n
+林下风致 3 l
+林下风范 3 nr
+林下风韵 3 nr
+林下高风 3 nr
+林下鸣 2 nr
+林业 1032 n
+林业厅 7 n
+林业大学 3 nt
+林业局 45 n
+林业机械 3 n
+林业站 7 n
+林业网 3 n
+林业道路 3 n
+林业部 42 n
+林业部门 2 n
+林东海 2 nr
+林丫头 15 nr
+林中 587 s
+林中倚 2 nr
+林中围 2 nr
+林中奔 3 nr
+林中寻 2 nr
+林中居民 3 nr
+林中放 2 nr
+林中疾 2 nr
+林中跃 3 nr
+林中采 2 nr
+林中飞 3 nr
+林中鸟 3 nr
+林丰草 3 nr
+林丹则 2 nr
+林丹发 2 nr
+林丹回 5 nr
+林丹太太 3 nr
+林丹妈妈 2 nr
+林丹汗 8 nr
+林丹网 8 nz
+林丹能 5 nr
+林丹赢 12 nr
+林丽韫 6 nr
+林久克 4 nr
+林久实 2 nr
+林义军 2 nr
+林之北 2 nr
+林之孝 141 nr
+林之韵 2 nr
+林乐丰 157 nr
+林乐培 2 nr
+林乐峰 4 nr
+林乐知 3 nr
+林乐风 2 nr
+林书豪 8 nr
+林产 43 n
+林产品 77 n
+林产物 3 n
+林京来 3 nr
+林亭口 2 nr
+林人林 2 nr
+林从龙 8 nr
+林代昭 2 nr
+林以真 3 nr
+林任 22 n
+林伟民 9 nr
+林伟贤 3 nr
+林传鼎 2 nr
+林伯渠 222 nr
+林佑威 3 vn
+林佳楣 4 nr
+林佳蓉 2 nr
+林依晨 2 nr
+林依轮 3 nr
+林俊杰 4 nr
+林俊沛 3 nr
+林俊贤 3 nr
+林保怡 3 nr
+林儒耕 36 nr
+林兄弟 8 nr
+林兆枢 256 n
+林先生 8 nr
+林光进 3 nr
+林克语 2 nr
+林公子 7 nr
+林兰芷 3 nr
+林兴珠 79 nr
+林其欣 3 nr
+林内 27 s
+林农 12 nr
+林冠 11 nr
+林冠碧 2 nr
+林冲 543 nr
+林冲别 2 nr
+林冲勒 3 nr
+林冲叹 2 nr
+林冲告 3 nr
+林冲大 3 nrfg
+林冲奔 2 nr
+林冲娘子 5 nr
+林冲引 3 nr
+林冲心 3 nr
+林冲来 4 nr
+林冲正 2 nrfg
+林冲笑 2 nr
+林冲见 5 nr
+林冲误 2 nr
+林冲谢 2 nr
+林冲领 2 nr
+林凤娇 4 nr
+林凤池 4 nr
+林凤祥 4 nr
+林凤鸣 2 nr
+林分 3 n
+林分改造 3 l
+林则徐 108 nr
+林剑冲 4 nr
+林副产品 17 n
+林加拉 4 nr
+林加耶 2 nr
+林务 2 n
+林务员 3 n
+林务官 3 n
+林务局 3 nt
+林区 2149 n
+林千树 2 nr
+林华卿 38 nr
+林南汪 3 nr
+林博士 5 nr
+林卡 3 nr
+林卫国 2 nr
+林卫平 4 nr
+林县 50 ns
+林又立 3 nr
+林友信 2 nr
+林口 18 n
+林口县 15 ns
+林古乔 3 nr
+林可霉素 3 n
+林吉特 11 nr
+林同炎 6 nr
+林后转 2 nr
+林周 2 nr
+林周县 2 nr
+林和西 4 nr
+林和靖 5 nr
+林哈德 2 nr
+林哥直 2 nr
+林嘉华 3 nr
+林嘉欣 3 nr
+林四娘 10 nr
+林园 21 nr
+林国祥 2 nr
+林在培 3 nr
+林地 196 n
+林地沼泽 3 nr
+林场 168 n
+林垦 3 nr
+林垦局 3 n
+林培杰 52 nr
+林培雷 4 nr
+林基路 2 nr
+林堡 4 nr
+林增平 4 nr
+林壑 2 nr
+林复恒 2 nr
+林夕编 3 n
+林大人 5 nr
+林大勇 2 nr
+林大可 44 nr
+林大哥 6 nr
+林大娘 8 nr
+林大椿 2 nr
+林天星 4 nr
+林天爱 3 nr
+林太太 3 nr
+林夫人 3 nr
+林奈 19 nr
+林奈学 3 nr
+林女侠 2 nr
+林如是 3 l
+林如海 10 nr
+林妹妹 95 nr
+林姐儿 2 nr
+林姐姐 9 nr
+林姑娘 32 nr
+林姑娘房 2 nr
+林姓 8 nrfg
+林子 420 nr
+林子亮 2 nr
+林子娟 3 nrfg
+林子祥 3 nr
+林子里 50 nr
+林学 4 n
+林学家 17 n
+林学院 11 nr
+林宇中 3 nr
+林安乾 2 nr
+林宏敏 2 nr
+林宗先生 2 nr
+林宗棠 5 nrfg
+林宝仁 2 nr
+林宝修 3 nr
+林家 99 n
+林家保 4 nr
+林家栋 3 nr
+林家福 2 nr
+林家翘 15 nr
+林家花园 3 nr
+林家那 2 nr
+林密草 2 nr
+林寒洞肃 3 nr
+林寒涧肃 3 nr
+林寨镇 2 nr
+林寺觉 2 nr
+林将军 2 nr
+林小姐 6 nr
+林小楼 3 nr
+林小芳 175 nr
+林少侠 2 nr
+林少华 3 nr
+林少猫 4 nr
+林少镖 6 nr
+林尚武 3 nr
+林屋洞 2 nr
+林山胜 2 nr
+林山脉 4 nr
+林崇德 3 nr
+林州 11 nr
+林州市 9 ns
+林左旗 2 nr
+林左鸣 10 nr
+林巧稚 8 nrfg
+林师弟 104 nr
+林希建 2 nr
+林带 118 n
+林平之 305 nr
+林庆新 3 nr
+林庆春 4 nr
+林延涛 5 nr
+林建华 2 nr
+林建宁 4 nr
+林建岳 3 nr
+林建斌 5 nr
+林建明 3 nr
+林彪 1381 nr
+林彪任 5 nr
+林御史 2 nr
+林德伯格 2 nr
+林德布 3 nr
+林德曼 13 nr
+林德碑 8 nr
+林德罗 7 nr
+林徽因 3 nr
+林徽音 3 nr
+林心如 3 nr
+林忆莲 3 nr
+林志成 2 nrfg
+林志炫 3 nr
+林志玲 17 nr
+林志颖 3 nr
+林志鸿 2 nr
+林念祖 2 nr
+林怀民 2 nr
+林总镖 11 nr
+林惠祥 3 nr
+林意映 3 nr
+林承光 3 nr
+林护士 2 nr
+林护驾 2 nr
+林振强 3 nr
+林改名 2 nr
+林政志 6 nr
+林教头 3 n
+林散之 15 nr
+林敦奎 3 nr
+林文漪 259 nr
+林文龙 3 nr
+林斤澜 5 nrfg
+林斯克 3 nr
+林斯基 12 nr
+林斯高 2 nr
+林旭 22 nr
+林昌彝 7 nr
+林映辉 3 nr
+林春曾 2 nr
+林春生 3 nr
+林昭亮 2 nr
+林显郎 3 nr
+林晓培 3 nr
+林晓峰 3 nr
+林曾泰 2 nr
+林月如 3 nr
+林月琴 2 nr
+林月英 23 nr
+林朝英 103 nr
+林木 413 nr
+林木业 2 nr
+林木分化 3 n
+林木参天 3 nr
+林木森森 3 nr
+林权助 6 nr
+林权泽 3 nr
+林权证 3 nr
+林林兴 3 nr
+林林总总 34 nr
+林果 20 n
+林果业 20 nr
+林树森 9 nr
+林栖谷隐 3 nr
+林校 2 n
+林根州 9 nr
+林格伦 5 nr
+林格勒 2 nr
+林格殷 9 nr
+林桐榆 2 nr
+林森 26 nr
+林森为 3 nr
+林森北路 3 ns
+林森南路 3 ns
+林森桥 3 nr
+林榛 3 nrfg
+林檎 4 nr
+林欣禾 4 nr
+林款 4 n
+林正刚 3 nr
+林正英 3 nr
+林毅夫 12 nr
+林毓生 18 nr
+林民忠 2 nr
+林水镜 2 nr
+林永健 3 nr
+林永升 6 nr
+林永超 7 nr
+林永霞 10 nr
+林汀 8 nrfg
+林汉雄 2 nr
+林汝昌 3 nr
+林江涛 8 nr
+林沛渠 23 nr
+林河中 2 nr
+林泉之 5 nr
+林泉兄 9 nr
+林泉兄弟 3 nr
+林泉高 5 nr
+林波波 5 nr
+林波波河 25 nr
+林泰曾 4 nr
+林洁贻 2 nr
+林洋港 2 ns
+林浆 3 n
+林海 51 nr
+林海峰 5 nr
+林海雪原 8 ns
+林海音 6 nr
+林涛 7 nr
+林深竹 2 nr
+林清云 3 nr
+林清源 8 nr
+林清玄 3 nr
+林湖越 3 nr
+林潇湘 3 nr
+林灌丛 3 nr
+林火 12 nr
+林炳尧 2 nr
+林炳昌 25 nr
+林熙蕾 3 nt
+林爽文 22 nr
+林牧业 6 n
+林玉紫 3 nr
+林玉英 3 nr
+林玉露 3 nr
+林玉龙 104 nr
+林理工 2 n
+林琴南 6 nr
+林瑞康 2 nr
+林瑞阳 3 nr
+林甘泉 10 nr
+林甫之 2 nr
+林甸 2 nrfg
+林甸县 2 ns
+林登曼 2 nr
+林皎明 9 z
+林盛中 2 nr
+林相 3 nr
+林相斗 2 nr
+林石渠 6 nr
+林碧川 2 nr
+林祖涵 8 nr
+林祥才 11 nr
+林祥谦 10 nr
+林福久 3 nr
+林秀才 5 nr
+林秀晶 3 nr
+林秀珍 13 nr
+林种 8 n
+林科夫 23 nr
+林科院 10 nr
+林立 695 nr
+林立果 6 nr
+林立衡 2 nr
+林立雯 3 nr
+林管局 3 n
+林箭雨 2 nr
+林籁泉韵 3 nr
+林粮间作 3 n
+林索登 3 nr
+林红梅 3 nr
+林纾 15 nr
+林纾译 3 nr
+林维均 2 nr
+林维尔 2 nr
+林维钧 5 nr
+林网 7 n
+林网化 5 nr
+林美贞 3 nr
+林耀华 3 nr
+林耶意 2 nr
+林肯 216 nr
+林肯中心 4 nr
+林肯公园 3 nr
+林肯纪念堂 10 nr
+林肯车 3 nr
+林肯郡 8 nr
+林芝 33 nrt
+林芝县 10 ns
+林芝地区 12 ns
+林芳兵 3 nr
+林苑 13 nr
+林苑习 2 nr
+林苑内 2 nr
+林苑派 2 nr
+林英海 2 nr
+林茨 16 nrt
+林荫 69 nr
+林荫大道 3 nr
+林荫夹道 3 l
+林荫道 18 nr
+林莽 14 nrfg
+林蓄量 2 n
+林蕙青 3 nr
+林藕初 194 nr
+林虎贲 2 nr
+林虑山 3 nr
+林蛙 11 n
+林行省 3 ns
+林衣兰 9 nr
+林表 3 n
+林西 5 nr
+林西县 3 ns
+林觉民 5 nr
+林言椒 4 nr
+林诗铨 2 nr
+林语堂 18 nr
+林豆豆 34 nr
+林贤治 6 nr
+林跃前 7 nr
+林路 2 n
+林辰夫 3 nr
+林边 30 s
+林边草 2 nr
+林达信 3 nr
+林进屿 4 nr
+林远图 23 nr
+林连昆 3 nr
+林道静 2 nr
+林郁方 11 nr
+林郭勒 2 nr
+林里 66 s
+林金树 4 nr
+林金水 2 nr
+林铭球 65 nr
+林锦吾 4 nr
+林镇夷 7 nr
+林镇抚 3 nr
+林长兴 4 nr
+林长老 7 nr
+林间 92 n
+林间小道 3 nr
+林间空地 3 n
+林间隙地 3 z
+林际 3 n
+林隆旋 3 nr
+林隆璇 3 nr
+林雅诗 3 nr
+林雨婷 3 nr
+林雪平 2 nr
+林雪文 3 nr
+林震南 234 nr
+林青霞 14 nr
+林韦君 3 nr
+林韦辰 3 nr
+林颖启 2 nr
+林风眠 37 nr
+林鸟朝嘲 3 l
+林默娘 2 nr
+林默涵 4 nr
+林黛玉 339 nr
+枘 15 zg
+枘凿冰炭 3 n
+枘凿方圆 3 z
+枘圆凿方 3 l
+枚 2954 m
+枚举 15 nz
+枚举法 2 nz
+枚速马工 3 nz
+果 4482 ng
+果不其然 51 i
+果业 3 n
+果丹皮 3 n
+果乡 3 n
+果于 3 d
+果于自信 3 i
+果仁 42 nr
+果仁儿 3 nr
+果位 3 n
+果儿 32 n
+果农 28 n
+果决 94 ad
+果冻 49 n
+果刑信赏 3 i
+果名 3 n
+果味 15 n
+果品 220 n
+果品市场 3 n
+果因 3 n
+果园 343 n
+果园乡 4 n
+果园镇 4 nr
+果在 3 d
+果地 3 n
+果场 3 n
+果壳 20 n
+果壳箱 3 n
+果如其言 3 i
+果如所料 3 i
+果子 371 n
+果子冻 3 n
+果子吃 3 n
+果子汁 3 n
+果子沟 3 n
+果子狸 38 n
+果子盐 3 n
+果子酒 3 n
+果子酱 2 n
+果子露 3 nr
+果宝乐 3 nr
+果实 856 d
+果实直感 3 i
+果实累累 3 i
+果屑 3 n
+果岭 3 nrt
+果市 3 n
+果干 6 n
+果心 3 n
+果性 3 n
+果戈理 58 nr
+果戈里 2 nrt
+果报 16 n
+果敢 67 d
+果料 4 n
+果料儿 3 n
+果断 587 d
+果断性 3 n
+果无 3 d
+果有所见 3 i
+果木 48 n
+果木园 3 nr
+果木林 3 nr
+果松 3 a
+果林 21 n
+果枝 5 n
+果柄 3 n
+果树 735 n
+果树园 2 nr
+果树林 2 nr
+果核 37 n
+果毅 3 nr
+果永毅 9 nr
+果汁 188 n
+果汁厂 2 n
+果汁机 2 n
+果汁瓶 3 i
+果洛 15 nr
+果洛藏族自治州 10 ns
+果焰糕点 3 z
+果然 4909 d
+果然如此 41 c
+果熟蒂落 3 i
+果物 3 n
+果王 3 nrt
+果皮 97 n
+果皮筒 3 n
+果皮箱 4 n
+果皮网 3 n
+果盒 3 n
+果盘 23 n
+果真 478 d
+果真会 3 n
+果真如此 3 i
+果碟 3 n
+果穗 16 n
+果类 3 n
+果粉 3 n
+果糖 61 n
+果糖苷 3 n
+果糖苷酶 3 n
+果绿 3 n
+果绿色 2 n
+果聚糖 3 n
+果肉 67 n
+果肉饮料 3 i
+果胶 79 n
+果胶酶 3 n
+果能如此 3 i
+果脯 47 n
+果腹 21 n
+果苗 3 n
+果茶 22 n
+果菜 25 n
+果菜汁 3 n
+果蔓 3 n
+果蔬 279 n
+果蔬汁 2 nz
+果蝇 54 n
+果蝇属 3 nz
+果行育德 3 n
+果酒 63 n
+果酒瓶 3 n
+果酱 84 n
+果酱瓶 3 i
+果酸 9 n
+果静林 3 nr
+果饵 3 n
+果香 17 n
+枝 1453 q
+枝丫 16 n
+枝分叶散 3 i
+枝别条异 3 i
+枝叶 277 n
+枝叶扶疏 6 n
+枝叶扶苏 3 n
+枝叶相持 3 i
+枝叶茂盛 3 ns
+枝城 47 ns
+枝城市 8 ns
+枝外生枝 3 n
+枝大于本 3 i
+枝头 104 n
+枝子 13 n
+枝对叶比 3 n
+枝布叶分 3 n
+枝干 93 n
+枝干相持 3 i
+枝形吊灯 3 i
+枝接 3 n
+枝末生根 3 i
+枝杈 42 n
+枝条 188 n
+枝条编制 3 n
+枝枝叶叶 5 n
+枝枝节节 3 n
+枝枝蔓蔓 5 n
+枝柯 7 n
+枝栽 3 n
+枝桠 74 n
+枝梗 3 n
+枝梢 13 n
+枝梧 3 ns
+枝江 266 ns
+枝江县 5 ns
+枝江市 257 ns
+枝流叶布 3 n
+枝源派本 3 n
+枝生节外 3 i
+枝繁叶茂 40 i
+枝节 95 n
+枝节性 3 n
+枝节问题 3 n
+枝芽 3 n
+枝蔓 26 n
+枝角类 3 n
+枝词蔓语 3 n
+枝词蔓说 3 n
+枝辞蔓语 3 n
+枝附叶从 3 i
+枝附叶着 3 n
+枝附叶著 3 n
+枝附叶连 3 i
+枝附影从 3 i
+枝附影随 3 i
+枞 11 ns
+枞木 3 ns
+枞树 17 ns
+枞阳 4 ns
+枞阳县 10 ns
+枟 147 zg
+枠 10 zg
+枡 102 zg
+枢 647 n
+枢密使 187 n
+枢密院 336 n
+枢机 23 n
+枢机主教 19 nz
+枢纽 1496 n
+枢纽区 3 nz
+枢纽港 3 nz
+枢纽站 11 nz
+枢要 10 n
+枢轴 12 n
+枣 446 n
+枣仁 3 n
+枣儿 24 n
+枣农 3 n
+枣园 10 ns
+枣子 110 n
+枣岭乡 3 ns
+枣庄 21 ns
+枣庄市 15 ns
+枣强 19 b
+枣强县 3 ns
+枣林 15 ns
+枣树 121 n
+枣树林 3 ns
+枣核 146 n
+枣椰 10 n
+枣椰树 3 n
+枣泥 21 n
+枣类 3 n
+枣类植物 3 n
+枣糕 9 n
+枣红 51 b
+枣红色 3 n
+枣红马 3 n
+枣花 3 n
+枣茶 5 n
+枣阳 281 ns
+枣阳市 263 ns
+枥 19 g
+枥木县 6 ns
+枦 2 zg
+枧 8 g
+枨 11 g
+枩 74 zg
+枪 5382 n
+枪乌贼 8 n
+枪伤 19 n
+枪兵 3 n
+枪决 52 v
+枪击 55 v
+枪击案 10 n
+枪击要犯 3 n
+枪刺 48 n
+枪口 244 n
+枪口上 3 n
+枪响 228 vn
+枪响靶落 3 n
+枪垛儿 3 n
+枪声 454 n
+枪声刀影 3 i
+枪声四起 3 i
+枪头 80 n
+枪套 5 n
+枪子 23 n
+枪子儿 39 n
+枪尖 65 n
+枪崩 3 n
+枪式 3 n
+枪弹 335 n
+枪战 25 n
+枪手 162 n
+枪打出头鸟 5 i
+枪托 155 n
+枪支 215 n
+枪支弹药 3 n
+枪支罪 3 n
+枪术 3 n
+枪机 3 n
+枪杀 292 v
+枪杀无辜 3 i
+枪杀案 2 n
+枪杆 66 n
+枪杆子 57 n
+枪林 3 n
+枪林刀树 3 n
+枪林弹雨 34 n
+枪林恋曲 3 n
+枪枝 10 n
+枪枝弹药 3 n
+枪架 3 n
+枪柄 3 n
+枪栓 38 n
+枪案 3 n
+枪械 195 n
+枪械弹药 3 n
+枪榴弹 49 n
+枪毙 147 v
+枪油 3 n
+枪法 200 n
+枪炮 204 n
+枪炮声 3 n
+枪炮齐鸣 3 i
+枪烟炮雨 3 n
+枪烟砲雨 3 nz
+枪爻弹雨 3 v
+枪片 3 n
+枪版 3 n
+枪眼 28 n
+枪神 3 n
+枪管 188 n
+枪管下 3 n
+枪膛 41 n
+枪身 46 n
+枪靶 3 n
+枪靶子 3 n
+枫 220 nr
+枫丹白露 27 ns
+枫之舞 3 n
+枫叶 46 n
+枫叶卡 3 n
+枫叶林 3 n
+枫叶牌 3 n
+枫城 3 ns
+枫木 3 ns
+枫杨 6 nz
+枫林 12 ns
+枫林晚 3 nz
+枫林路 3 nz
+枫树 30 n
+枫桥 12 ns
+枫桥镇 2 ns
+枫油 3 n
+枫港 3 ns
+枫溪 4 ns
+枫糖 3 n
+枫糖浆 3 n
+枫红 3 n
+枫红季节 3 n
+枫红时节 3 n
+枫色 3 n
+枫露 3 nz
+枫香 13 n
+枫香树 2 ns
+枬 72 zg
+枭 585 n
+枭俊禽敌 3 i
+枭匪 3 n
+枭将 3 n
+枭心鹤貌 3 i
+枭蛇鬼怪 3 i
+枭视狼顾 3 i
+枭雄 47 n
+枭首 23 v
+枭首示众 11 i
+枯 1024 n
+枯乾 3 i
+枯井 64 n
+枯井颓巢 3 i
+枯体灰心 3 n
+枯叶 35 t
+枯叶蛾 9 n
+枯坐 43 v
+枯季 4 t
+枯寂 10 v
+枯干 22 n
+枯干朽株 3 l
+枯形灰心 3 n
+枯心 3 n
+枯斑 3 n
+枯木 53 n
+枯木再生 3 i
+枯木发荣 3 i
+枯木朽株 3 l
+枯木死灰 3 i
+枯木生花 3 n
+枯木逢春 12 i
+枯本竭源 3 i
+枯朽 3 z
+枯朽之余 3 l
+枯杉 11 n
+枯杨生稊 3 n
+枯枝 126 n
+枯枝再春 3 i
+枯枝败叶 11 i
+枯枿朽株 3 n
+枯树 75 n
+枯树开花 3 i
+枯树枝 6 n
+枯树生华 3 i
+枯树生活 3 i
+枯树生花 3 n
+枯树逢春 3 i
+枯株 3 n
+枯株朽木 3 i
+枯槁 43 a
+枯死 78 v
+枯氏细胞 3 n
+枯水 74 n
+枯水位 6 n
+枯水年 10 t
+枯水期 355 t
+枯涩 12 a
+枯涸 4 v
+枯焦 13 v
+枯燥 193 a
+枯燥乏味 3 i
+枯燥无味 24 i
+枯瘦 49 z
+枯立木 2 n
+枯竭 187 v
+枯耘伤岁 3 n
+枯肠 2 n
+枯脑焦心 3 n
+枯苗望雨 3 i
+枯茎朽骨 3 l
+枯茗 3 v
+枯草 99 n
+枯草杆菌 3 l
+枯草热 2 i
+枯荣 99 v
+枯荣长老 3 i
+枯萎 103 v
+枯萎病 3 n
+枯蓬断草 3 i
+枯藤 3 n
+枯饼 3 n
+枯骨 29 n
+枯骨生肉 3 n
+枯鱼之肆 3 i
+枯鱼涸辙 3 v
+枯鱼病鹤 3 i
+枯鱼衔索 3 i
+枯黄 54 z
+枯黑 3 z
+枰 175 zg
+枱子 3 v
+枱布 3 vn
+枱灯 3 vn
+枱球 3 vn
+枱面 3 z
+枲 8 zg
+枳 40 zg
+枳壳 5 n
+枳实 12 n
+枳机草 3 n
+枴 3 zg
+枴子 3 v
+枴杖 3 v
+枵 10 g
+枵腹从公 3 v
+架 7352 q
+架上 308 s
+架上去 3 v
+架上来 3 v
+架下去 3 v
+架下来 3 v
+架不住 83 v
+架入 3 v
+架出去 3 v
+架势 123 n
+架卡 2 n
+架回 3 v
+架回去 3 n
+架回来 3 ns
+架子 848 n
+架子工 128 n
+架子床 3 n
+架子猪 3 n
+架子花 9 n
+架子车 60 n
+架子鼓 3 n
+架完 3 v
+架屋 3 n
+架屋叠床 3 n
+架式 79 n
+架得住 3 v
+架成 3 v
+架持 3 v
+架接 3 v
+架杆 2 n
+架来架去 3 v
+架构 315 n
+架构图 3 n
+架构师 3 n
+架构设计 2 n
+架桥 325 n
+架桥机 3 n
+架桥铺路 3 nz
+架梁 3 n
+架次 113 m
+架步 3 n
+架海擎天 3 n
+架海金梁 3 n
+架满 3 v
+架环 3 vn
+架着 3 v
+架空 112 s
+架空层 3 n
+架空电缆 3 n
+架空线 2 n
+架站 3 n
+架线 3 n
+架结构 7 n
+架肩击毂 3 n
+架肩接踵 3 n
+架设 430 vn
+架谎凿空 3 z
+架豆 3 n
+架起 382 s
+架车 6 n
+架过 3 v
+架锅 3 n
+架错 3 v
+架飞机 12 n
+枷 405 n
+枷脰械手 3 n
+枷锁 132 n
+枸 11 n
+枸杞 226 n
+枸杞子 27 n
+枸杞茶 3 n
+枸橘 3 n
+枸橼 5 n
+枸橼酸 7 nz
+枸酱 4 n
+枸骨 3 n
+枹 27 zg
+枺 2 zg
+枻 4 zg
+枼 13 zg
+枾 25 zg
+枿 2 zg
+柀 2 zg
+柁 4 zg
+柄 3239 n
+柄政 3 n
+柄竹 3 n
+柇 83 zg
+柉 81 zg
+柊 135 zg
+柋 2 zg
+柌 3 zg
+柍 3 zg
+柏 316 nr
+柏乡 3 ns
+柏乡县 3 ns
+柏元里 2 nr
+柏克莱 4 nr
+柏卫华 28 nr
+柏原崇 3 nr
+柏吉尤 4 nr
+柏吉尤斯 2 nr
+柏城 3 ns
+柏培拉 4 nr
+柏子仁 6 nr
+柏宁队 2 nr
+柏安妮 3 nr
+柏师叔 2 nr
+柏广新 2 nr
+柏建锁 3 nr
+柏抱槐 2 nr
+柏拉 2 ns
+柏拉图 524 nr
+柏文蔚 12 nr
+柏斯 19 ns
+柏景湾 2 nr
+柏木 31 nr
+柏木杆 2 ns
+柏条河 3 ns
+柏林 1260 nr
+柏林围墙 3 nr
+柏林墙 64 nr
+柏林市 8 ns
+柏林洪堡大学 2 nt
+柏林站 4 nr
+柏柏尔 118 nr
+柏树 215 nr
+柏树下 3 nr
+柏树林 4 nr
+柏格森 21 nr
+柏梁台 4 ns
+柏森森 2 nr
+柏油 52 n
+柏油纸 3 n
+柏油路 50 n
+柏灌丛 2 nr
+柏科 10 ns
+柏纳李 4 nr
+柏罗米修 3 nr
+柏耀平 4 nr
+柏舟之节 3 nr
+柏舟之誓 3 nr
+柏诺兹 4 nr
+柏辽兹 17 nr
+柏道人 3 nr
+柏道长 2 nr
+某 8444 r
+某一地方 3 z
+某一方面 3 z
+某一时间 3 r
+某个 1346 r
+某事 63 r
+某些 7518 r
+某人 416 r
+某件事 3 vn
+某位 114 r
+某区 6 r
+某县 13 r
+某君 3 r
+某团 41 r
+某国 40 r
+某地 146 r
+某城 3 r
+某处 92 r
+某大学 3 vn
+某天 3 r
+某家 3 r
+某市 28 r
+某师 35 r
+某年 68 r
+某年某月 3 nrt
+某报 6 r
+某支 3 r
+某方 3 r
+某日 81 r
+某时 3 r
+某时某分 3 z
+某月 46 r
+某月某日 3 nrt
+某村 3 r
+某某 416 r
+某某人 3 vn
+某某某 3 r
+某校 8 r
+某样 3 r
+某次 51 r
+某物 29 r
+某班 3 r
+某省 55 r
+某种 3355 r
+某种事物 3 v
+某种原因 3 v
+某种意义 3 v
+某种理由 3 v
+某种程度 3 v
+某类 28 r
+某行 3 r
+某部 194 r
+某队 3 r
+某项 3 r
+柑 360 n
+柑园 3 n
+柑子 7 n
+柑果 3 n
+柑树 3 n
+柑桔 46 n
+柑桔锈螨 3 n
+柑橘 433 n
+柑橘园 3 vn
+柑橘类 3 vn
+柑汁 3 n
+柑皮 3 n
+柒 2 m
+染 1182 v
+染上 197 n
+染上去 3 v
+染上来 3 v
+染上瘟疫 3 n
+染丝 3 n
+染丝之变 3 nz
+染化厂 3 n
+染印 3 n
+染印法 3 n
+染发 337 v
+染发剂 242 n
+染坊 114 n
+染工 3 n
+染布 15 v
+染得 3 v
+染患 3 n
+染成 3 v
+染房 4 n
+染指 67 n
+染指于鼎 3 n
+染指垂涎 3 n
+染整 22 vn
+染料 859 n
+染料厂 2 n
+染料植物 3 n
+染旧作新 3 n
+染有 3 v
+染毒 27 n
+染汙 3 vn
+染污 3 v
+染液 3 n
+染疾 3 n
+染病 76 n
+染神乱志 3 n
+染神刻骨 3 n
+染红 3 n
+染纺厂 3 n
+染织 18 n
+染织厂 3 n
+染缸 15 n
+染翰 3 nz
+染翰成章 3 nz
+染翰操纸 3 vn
+染色 343 n
+染色体 820 n
+染色剂 17 n
+染色布 3 n
+染色性 3 n
+染色机 3 n
+染色法 5 n
+染色牢度 3 n
+染色质 3 n
+染艾滋 3 z
+染苍染黄 3 n
+染蓝涅皂 3 n
+染起 3 v
+染起来 3 v
+染须种齿 3 n
+染风习俗 3 n
+染黑 3 v
+柔 1569 v
+柔丝 28 n
+柔中带刚 3 n
+柔中有刚 3 i
+柔以制钢 3 i
+柔佛 30 nrt
+柔佛州 2 nrt
+柔儿 3 n
+柔光 2 n
+柔化 3 n
+柔和 414 a
+柔善 3 a
+柔嘉 169 a
+柔声下气 3 l
+柔声细语 10 l
+柔声道 3 l
+柔姿纱 3 n
+柔婉 9 a
+柔媚 48 a
+柔嫩 40 a
+柔巾机 3 l
+柔弱 158 a
+柔弱不堪 3 l
+柔心弱骨 3 i
+柔性 74 n
+柔性制造系统 13 l
+柔性化 3 l
+柔性版 3 n
+柔情 210 a
+柔情万种 3 l
+柔情似水 10 i
+柔情侠骨 3 n
+柔情媚态 3 i
+柔情密意 13 i
+柔情版 3 n
+柔情绰态 3 l
+柔情蜜意 34 i
+柔懦寡断 3 nr
+柔技 3 n
+柔曼 11 nrt
+柔术 10 n
+柔术演员 3 n
+柔板 2 n
+柔枝嫩叶 3 n
+柔枝嫩条 3 z
+柔柔 3 a
+柔柔和和 3 i
+柔柔的 9 z
+柔柔顺顺 3 i
+柔毛 3 n
+柔波 7 n
+柔润 14 n
+柔滑 20 a
+柔然 91 a
+柔筋脆骨 3 l
+柔细 9 a
+柔美 60 a
+柔翰 3 nrt
+柔而不犯 3 l
+柔肠 20 n
+柔肠寸断 6 l
+柔肠百结 5 l
+柔肠百转 16 l
+柔肤弱体 3 n
+柔肤水 3 n
+柔能克刚 3 n
+柔能制刚 3 n
+柔色 3 n
+柔茹刚吐 3 i
+柔茹寡断 3 i
+柔软 686 a
+柔软体操 3 l
+柔软光滑 3 l
+柔软剂 3 n
+柔软度 3 l
+柔软性 3 l
+柔软操 3 l
+柔远怀来 3 l
+柔远怀迩 3 l
+柔远绥怀 3 z
+柔远能迩 3 l
+柔远镇迩 3 n
+柔道 142 n
+柔道服 2 n
+柔道队 3 n
+柔韧 61 a
+柔韧度 3 n
+柔韧性 13 n
+柔顺 52 a
+柔顺剂 3 n
+柔风 3 n
+柕 9 zg
+柗 7 zg
+柘 51 ns
+柘城 8 ns
+柘城县 3 ns
+柘塘镇 2 ns
+柘林 10 ns
+柘荣 3 ns
+柘荣县 3 ns
+柙 34 zg
+柙虎樊熊 3 nr
+柚 81 n
+柚子 33 n
+柚子茶 3 n
+柚木 55 n
+柚木树 3 n
+柜 664 n
+柜上 3 s
+柜内 10 s
+柜台 373 n
+柜台出租 3 n
+柜员 3 n
+柜员机 5 n
+柜外 3 s
+柜头 3 n
+柜子 205 n
+柜式 2 n
+柜房 3 n
+柜机 2 n
+柜枱 3 s
+柜架 2 n
+柜橱 3 n
+柜组长 2 n
+柜门 41 n
+柜面 7 n
+柝 12 zg
+柞 42 n
+柞丝 3 n
+柞丝绸 8 n
+柞木 5 n
+柞栎 3 n
+柞树 19 n
+柞水 3 n
+柞水县 6 n
+柞绢 3 n
+柞绸 3 n
+柞蚕 96 n
+柞蚕丝 27 n
+柟 505 zg
+柠 8 zg
+柠条 3 n
+柠檬 145 n
+柠檬原汁 3 n
+柠檬树 3 n
+柠檬桉 3 n
+柠檬水 6 n
+柠檬汁 17 n
+柠檬油 5 n
+柠檬皮 3 n
+柠檬精 3 n
+柠檬糖 3 n
+柠檬素 3 n
+柠檬色 3 n
+柠檬茶 2 n
+柠檬草 3 n
+柠檬酸 119 n
+柠檬酸钠 24 nz
+柠檬霜 3 nz
+柠檬黄 28 n
+柢 67 g
+柣 8 zg
+柤 14 zg
+查 3443 v
+查不出 3 v
+查不到 3 v
+查不清 2 v
+查严阵 2 nr
+查丽华 4 nr
+查亚峰 5 nr
+查价 3 v
+查伊拉 2 nrt
+查伊璜 81 nr
+查传谊 2 nr
+查克 4 nrt
+查克维 5 nr
+查全率 3 nr
+查兹贝 2 nr
+查内尔 3 nr
+查冯保 2 nr
+查准率 3 nr
+查出 472 v
+查出来 3 v
+查分 3 v
+查列兹 3 nr
+查到 3 v
+查剌阿 2 nr
+查办 125 v
+查勒斯 2 nr
+查勘 60 v
+查卷 16 v
+查号台 3 nr
+查哈尔 3 nr
+查哨 12 v
+查嗣庭 9 nr
+查回 3 v
+查回去 3 l
+查回来 3 nr
+查土丁 2 nr
+查堵 2 v
+查塔姆 9 nr
+查士丁 112 nr
+查士标 2 nr
+查处 619 v
+查夜 10 nr
+查太莱 3 nr
+查婴儿 2 nr
+查字 3 v
+查字典 3 nr
+查字法 3 nr
+查完 3 v
+查实 65 v
+查审 3 v
+查察 42 v
+查对 14 v
+查对者 3 nr
+查寻 6 v
+查封 117 v
+查封没收 3 l
+查小欣 3 nr
+查尔包 2 nr
+查尔斯 169 nr
+查尔斯顿 7 nrt
+查尔朱 4 nr
+查尔查尼 7 nrt
+查尔迪 2 nr
+查尔顿 89 nr
+查希尔 4 nr
+查帐 3 v
+查帐员 3 n
+查干伊 2 nr
+查干诺尔 2 nrt
+查应奎 4 nr
+查当乡 3 v
+查得 3 v
+查得东 2 nr
+查得严 2 nr
+查德 3 nrt
+查德威 27 nr
+查德森 36 nr
+查志隆 17 nr
+查慎行 19 nr
+查戈斯 6 nr
+查户口 3 nr
+查房 14 v
+查扣 14 v
+查找 204 v
+查找周期 3 l
+查找文件 3 l
+查找时间 3 l
+查找服务 3 l
+查抄 75 v
+查报 3 v
+查报表 3 nr
+查拉 10 nrt
+查探 3 v
+查探西 2 nr
+查探鹿 2 nr
+查控 2 v
+查摆 3 v
+查收 9 v
+查斯 8 nrt
+查斯丁 2 nr
+查无 3 v
+查无实据 11 l
+查无此人 3 l
+查明 409 nr
+查明哲 3 nr
+查明真相 3 nr
+查普曼 50 nr
+查普特佩 2 nr
+查木马 3 nr
+查杀 7 v
+查架 3 v
+查查 85 v
+查核 16 v
+查核员 3 nr
+查根项 3 nr
+查格雷 3 nr
+查案 15 v
+查档 2 v
+查档案 3 v
+查梅莱 2 nr
+查检 10 v
+查毒 3 v
+查波罗 2 nr
+查泰莱 8 nr
+查济民 2 nr
+查浦诗 128 nr
+查清 144 nr
+查点 69 v
+查照 3 v
+查爱珍 2 nr
+查特 4 nrt
+查特兹 4 nr
+查特吉 4 nr
+查特豪 3 nr
+查理 273 v
+查理一世 53 nr
+查理三世 3 nr
+查理之 5 nr
+查理二世 3 nr
+查理五世 3 nr
+查理六 9 nr
+查理十 7 nr
+查理四世 3 nr
+查理士 4 nr
+查理大帝 27 nr
+查理定律 3 l
+查理斯 10 nr
+查理曼 37 nr
+查田运动 3 l
+查盖 2 v
+查看 1789 v
+查看器 4 l
+查知 5 v
+查知其 2 nr
+查破 3 v
+查票 4 v
+查票员 3 n
+查禁 100 v
+查私 3 v
+查税 3 v
+查究 55 v
+查第格 3 nr
+查索 3 v
+查结 3 v
+查结率 3 nr
+查继佐 51 nr
+查继左 3 nr
+查维斯 3 nr
+查缉 23 v
+查缴 6 v
+查罕杰 3 nrt
+查考 87 v
+查耳酮 2 nz
+查耶卡 3 nr
+查耶纳 2 nr
+查良镛 3 nr
+查莫罗 15 nrt
+查获 164 v
+查血 6 v
+查补 4 v
+查表 3 v
+查觉 4 v
+查觉到 3 l
+查讫 3 v
+查讯 3 v
+查访 51 v
+查证 85 v
+查证法 3 nr
+查话费 3 nr
+查询 933 v
+查询卡 4 nr
+查询台 3 nr
+查询号 3 nr
+查询器 3 nr
+查询处理 5 nr
+查询数据库 4 n
+查询方法 3 nr
+查询电话 3 n
+查询留言 3 nr
+查询语言 5 nr
+查询费 20 nr
+查询键 3 nr
+查课 3 v
+查账 23 v
+查资料 3 l
+查起 3 v
+查起来 3 v
+查达河 2 nr
+查过 3 v
+查遍 3 v
+查里 3 nrt
+查里斯 3 nrt
+查铺 2 v
+查错 2 v
+查错程序 3 l
+查问 188 v
+查问出 3 v
+查阅 286 v
+查韦斯 42 nr
+查顿 2 nrt
+查验 97 v
+查默斯 6 nrt
+柦 21 zg
+柧 7 zg
+柨 15 zg
+柩 182 n
+柬 599 ns
+柬国 3 ns
+柬埔塞 3 ns
+柬埔寨 634 ns
+柬埔寨人 5 nz
+柬埔寨政府 2 nt
+柬埔寨王国 7 ns
+柬埔寨王国政府 8 nt
+柬埔寨语 3 nz
+柬帖 12 n
+柬政府 2 nt
+柬请 3 n
+柭 14 zg
+柮 3 zg
+柯 281 nr
+柯万钧 34 nr
+柯世康 2 nr
+柯九思 4 nr
+柯云路 3 nr
+柯以敏 3 nr
+柯以柔 2 nr
+柯伊伯 4 nr
+柯伊城 2 nr
+柯伊诺 4 nr
+柯俊雄 2 nr
+柯克斯 3 nr
+柯克曼 2 nr
+柯克里 3 nr
+柯公公 10 nr
+柯兴平 3 nr
+柯兹洛 2 nr
+柯切布 2 nr
+柯切托 3 nr
+柯勒律治 3 nr
+柯华松 3 nr
+柯南道 7 nr
+柯受良 2 nr
+柯名引 2 nr
+柯坪 3 nr
+柯坪县 3 nr
+柯城区 2 nr
+柯大侠 18 nr
+柯大哥 9 nr
+柯大爷 3 nr
+柯太守 5 nr
+柯太守陈 4 nr
+柯如龙 2 nr
+柯姆文 2 nr
+柯子容 32 nr
+柯家坪 11 nr
+柯察金 9 nr
+柯尔克孜 69 nz
+柯尔克孜族 58 nz
+柯尔劳 4 nr
+柯尔培 3 nr
+柯尔律 17 nr
+柯尔特 10 nr
+柯尔莫 12 nr
+柯尔贝尔 11 nrt
+柯尔金斯 3 nr
+柯尼卡 4 nr
+柯尼希 10 nr
+柯尼斯堡 56 nrt
+柯布林 3 nr
+柯布西 13 nr
+柯师兄 3 nr
+柯师弟 2 nr
+柯庆施 7 nr
+柯志雄 2 nr
+柯承亨 20 nr
+柯拉斯 2 nr
+柯拉果 3 nr
+柯文 9 nz
+柯斧 5 nz
+柯斯加 4 nr
+柯朗数 3 nr
+柯林 2 nr
+柯林伍德 3 nr
+柯林斯 37 nr
+柯林顿 2 nr
+柯棣华 9 nrfg
+柯正腾 19 nr
+柯正飞 23 nr
+柯比 2 nrt
+柯沙里 7 nr
+柯洛克 4 nr
+柯涅楚 4 nr
+柯清辉 7 nr
+柯特兰 3 nr
+柯玉仙 2 nr
+柯瓦列 4 nr
+柯瞎子 14 nr
+柯策布 2 nr
+柯约瑟 256 nr
+柯罗拉多 3 nrt
+柯老侠 4 nr
+柯老爷子 2 nr
+柯莫道 4 nr
+柯莱瑞 11 nr
+柯菲德 6 nr
+柯萨可 2 nr
+柯萨科夫 3 nr
+柯蒂斯 16 nr
+柯西 98 nr
+柯西之 2 nr
+柯西金 13 nr
+柯象峰 3 nr
+柯贝林 4 nr
+柯贝特 5 nr
+柯达 215 nr
+柯达伊 3 nr
+柯达公司 35 nt
+柯钦南 5 nr
+柯镇恶 713 nr
+柰 12 g
+柱 1767 n
+柱体 13 n
+柱型胶束 3 n
+柱基 6 nz
+柱塞 3 n
+柱塞泵 3 nz
+柱塞阀 3 nz
+柱天踏地 3 n
+柱头 345 n
+柱头铺作 3 n
+柱子 790 n
+柱小倾大 3 n
+柱层析 3 n
+柱廊 22 n
+柱形 3 n
+柱形代数 3 n
+柱形图 3 n
+柱洞 256 n
+柱状 144 nz
+柱状体 2 n
+柱状图 3 n
+柱状晶 3 n
+柱石 69 n
+柱石之坚 3 n
+柱础 7 n
+柱脚 3 n
+柱花草 3 nz
+柱身 15 n
+柱间区 3 n
+柱面 39 n
+柱面波 3 n
+柱面透镜 3 nz
+柱面阵 3 n
+柲 5 zg
+柳 2495 n
+柳丁 3 nr
+柳下借阴 3 l
+柳下惠 16 nr
+柳世权 3 nr
+柳东寅 2 nr
+柳丝 18 nr
+柳丰道 4 nr
+柳之姿 2 nr
+柳二人 2 nr
+柳二哥 2 nr
+柳二爷 6 nr
+柳云龙 2 nr
+柳五儿 3 nr
+柳亚子 91 nr
+柳亸花娇 3 nr
+柳亸莺娇 3 nr
+柳以东 2 nr
+柳传志 18 nr
+柳传明 3 nr
+柳传译 2 nr
+柳体 6 n
+柳侯祠 3 nr
+柳元景 6 nr
+柳先生 3 nr
+柳克明 4 nr
+柳公权 13 nr
+柳军飞 2 nr
+柳劳军 2 nr
+柳北区 3 ns
+柳南区 3 ns
+柳叶似 2 nr
+柳叶儿 2 nr
+柳叶刀 54 nr
+柳叶可 2 nr
+柳叶形 4 n
+柳叶渚 3 nr
+柳叶状 2 nr
+柳叶眉 11 nr
+柳叶菜 3 nr
+柳叶雅彦 3 nr
+柳叶黄 2 nr
+柳同春 10 nr
+柳啼花怨 3 i
+柳园 2 nr
+柳园渡 21 nr
+柳圣花神 3 nr
+柳垂金 2 nr
+柳城 37 ns
+柳城县 3 ns
+柳城郡 3 nr
+柳堂集 2 nr
+柳塘里 2 nr
+柳大华 276 nr
+柳大洪 35 nr
+柳大纲 2 nr
+柳大郎 5 nr
+柳太太 15 nr
+柳夫人 4 nr
+柳夭桃艳 3 nr
+柳如是 3 l
+柳如玉 314 nr
+柳如眉 2 nr
+柳妹怪 2 nr
+柳妹才 2 nr
+柳姑娘正 2 nr
+柳娇花媚 3 nr
+柳嫂子 6 nr
+柳子厚 3 nr
+柳子戏 2 n
+柳宗元 84 nr
+柳宗镇 3 nr
+柳宠花迷 3 i
+柳家 49 n
+柳家媳妇 4 nr
+柳宿增 2 nr
+柳寅东 5 nr
+柳小芳 2 nr
+柳局 3 n
+柳州 151 ns
+柳州地区 4 ns
+柳州市 26 ns
+柳州铁路局 5 nt
+柳巷花街 3 ns
+柳市 4 ns
+柳市花街 3 ns
+柳师父 7 nr
+柳帝王 3 nr
+柳平桥 2 nr
+柳庄相 2 nr
+柳建伟 3 nr
+柳弱花娇 3 i
+柳影花阴 3 ns
+柳德米拉 5 nrt
+柳忠云 2 nr
+柳忠长 32 nr
+柳成龙 19 nr
+柳户花门 3 ns
+柳承敏 9 nr
+柳折花残 3 i
+柳摇金 2 nr
+柳敬亭 167 nr
+柳文杨 3 nr
+柳斯金 2 nr
+柳无忌 3 i
+柳时元 3 nr
+柳时熏 4 nr
+柳昏花螟 3 n
+柳暖花春 3 nr
+柳暗花明 31 nr
+柳暗花明又一村 14 l
+柳暗花遮 3 l
+柳木 34 nr
+柳杉 21 nr
+柳条 95 n
+柳条制品 3 n
+柳条包 2 n
+柳条帽 3 n
+柳条湖 10 nr
+柳条筐 6 nr
+柳条箱 7 n
+柳条编 3 n
+柳杨堡 5 nr
+柳林 32 nr
+柳林中 3 nr
+柳林县 6 ns
+柳林坡 4 nr
+柳林沟 3 nr
+柳林里 2 nr
+柳林镇 11 nr
+柳枝 113 nr
+柳树 248 nr
+柳树下 42 nr
+柳树丛 3 nr
+柳树镇 3 nr
+柳梢青 2 nr
+柳梦梅 8 nr
+柳橙 5 nr
+柳橙汁 3 nr
+柳残阳 3 nr
+柳毅传 7 nr
+柳比 2 j
+柳比西 5 ns
+柳永 34 nr
+柳江 60 ns
+柳江人 12 nr
+柳江县 4 ns
+柳河 25 ns
+柳河县 3 ns
+柳泣花啼 3 n
+柳浪闻 3 nr
+柳浪闻莺 4 nr
+柳海光 2 nr
+柳海龙 3 nr
+柳湖坝 256 nr
+柳湘兰 91 nr
+柳湘莲 27 nr
+柳湾 10 ns
+柳潭里 8 nr
+柳烟花雾 3 i
+柳燕笑 6 nr
+柳琴 8 nr
+柳生芽 2 nr
+柳直荀 5 nr
+柳眉 22 nr
+柳眉倒竖 9 i
+柳眉剔竖 3 i
+柳眉星眼 3 i
+柳硫汞 3 nz
+柳笛儿 5 nr
+柳笛声 2 nr
+柳素素 31 nr
+柳絮 35 nr
+柳絮才高 3 nr
+柳絮飞 3 nr
+柳绿桃红 3 nr
+柳绿花红 4 nr
+柳编 16 n
+柳老爷子 12 nr
+柳腰 6 n
+柳腰花态 3 n
+柳腰莲脸 3 n
+柳色 3 n
+柳若明 9 nr
+柳若晨 197 nr
+柳若菲 54 nr
+柳荫街 3 nr
+柳莺 7 nr
+柳莺花燕 3 nr
+柳营 11 nr
+柳营花市 3 ns
+柳营花阵 3 nr
+柳行镇 3 nr
+柳街花巷 3 i
+柳衢花市 3 ns
+柳西 3 ns
+柳诒徵 2 nr
+柳诚俊 3 nr
+柳贻徵 2 nr
+柳辛庄 3 nr
+柳门竹巷 3 ns
+柳阴 4 ns
+柳阴树 5 nr
+柳陂 3 ns
+柳陌花丛 3 nr
+柳陌花街 3 nr
+柳随风 3 nr
+柳青 3 nr
+柳青娘 3 nr
+柳骨颜筋 3 nr
+柳麻子 10 nr
+柴 1622 nr
+柴三郎 3 nr
+柴世宗 6 nr
+柴云振 74 nr
+柴伐蒂 5 nr
+柴佩尔 2 nr
+柴元君 5 nr
+柴刀 38 n
+柴发利 5 nr
+柴可夫斯 3 nr
+柴可夫斯基 18 nrt
+柴堆 33 n
+柴多火旺 3 nr
+柴大官 2 nr
+柴大官人 73 nr
+柴天改物 3 l
+柴天改玉 3 nr
+柴夺路 2 n
+柴宗训 4 nr
+柴宝成 2 nr
+柴家 2 n
+柴尔德 16 nr
+柴屋 3 n
+柴店 3 n
+柴意新 6 nr
+柴房 21 n
+柴房中 5 nr
+柴扉 27 n
+柴把 3 n
+柴拉琴 16 nr
+柴旦湖 5 nr
+柴旦镇 8 nr
+柴明达 10 nr
+柴春霖 2 nr
+柴智屏 3 nr
+柴松岳 3 nr
+柴根 2 ns
+柴桑口 2 ns
+柴桑郡 6 nr
+柴毁灭性 3 n
+柴毁骨立 3 i
+柴河 6 ns
+柴油 470 n
+柴油发动机 2 n
+柴油机 432 n
+柴油机厂 28 n
+柴油机油 3 n
+柴油车 8 n
+柴湾 2 ns
+柴火 165 n
+柴火垛 9 nr
+柴烂草 2 nr
+柴田胜家 3 l
+柴皇城 10 nr
+柴禾 600 nr
+柴秀吉 2 nr
+柴科夫 2 nr
+柴科夫斯基 38 nrt
+柴窝堡 3 nr
+柴立不阿 3 i
+柴米 19 nr
+柴米夫妻 3 nr
+柴米油盐 33 n
+柴米油盐酱醋茶 7 n
+柴胡 81 nr
+柴胡皂苷 3 n
+柴草 173 n
+柴草堆 19 nr
+柴荣乘 2 nr
+柴荣疏 2 nr
+柴荣病 6 nr
+柴薪 16 nr
+柴诚明 3 nr
+柴达木 72 nr
+柴达木河 3 ns
+柴达木盆地 97 ns
+柴进东 2 nr
+柴进分 2 nr
+柴进奏 2 nr
+柴进庄 4 nr
+柴进教 3 nr
+柴进欧 2 nr
+柴进笑 6 nr
+柴门 42 n
+柴高夫斯 3 nr
+柴鸡 3 n
+柴鸡蛋 3 nr
+柷 11 zg
+柸 2 zg
+査 18 zg
+柼 7 zg
+柽 11 n
+柽柳 35 n
+柽麻 3 n
+柿 246 n
+柿叶 4 n
+柿园 2 n
+柿子 153 n
+柿子树 3 n
+柿子椒 5 n
+柿子皮 2 n
+柿树 23 n
+柿椒 3 n
+柿糕 3 n
+柿蒂 3 n
+柿霜 5 n
+柿饼 36 n
+栀 18 n
+栀子 40 n
+栀子花 14 n
+栀角 2 n
+栄 3 zg
+栅 249 n
+栅口 3 n
+栅子 3 n
+栅条 2 n
+栅板 2 n
+栅极 12 n
+栅栏 128 n
+栅栏门 14 n
+栅格 7 n
+栅格数据 3 n
+栅瓣 3 n
+栅网 2 n
+栅门 26 n
+栅顶 3 n
+标 1971 n
+标一晚 3 l
+标上 3 n
+标上去 3 v
+标上来 3 l
+标下 3 n
+标下去 3 l
+标下来 3 l
+标举 3 n
+标书 17 n
+标价 132 n
+标价牌 2 n
+标价签 3 n
+标会 3 n
+标值 4 n
+标兵 110 n
+标兵处 3 n
+标准 10012 n
+标准九分 3 n
+标准件 11 n
+标准价 4 n
+标准值 14 n
+标准偏差 3 n
+标准分 17 n
+标准分数 3 n
+标准分项 3 n
+标准制 3 n
+标准刺激 3 l
+标准化 401 vn
+标准协议 3 nz
+标准单位 3 n
+标准单元 2 n
+标准厂房 3 n
+标准台 3 n
+标准号码 3 n
+标准图 5 n
+标准型 32 n
+标准大气 3 nz
+标准大气压 17 nz
+标准局 21 n
+标准工资 3 n
+标准差 3 n
+标准接口 3 n
+标准文件 3 n
+标准时区 3 n
+标准普尔公司 3 nt
+标准木 3 n
+标准杆 6 n
+标准气压 3 n
+标准源 2 n
+标准溶液 3 n
+标准煤 25 n
+标准版 4 n
+标准状况 3 n
+标准状态 3 n
+标准电池 3 n
+标准答案 3 n
+标准箱 25 n
+标准粉 3 n
+标准级 3 n
+标准纬线 3 n
+标准线 3 n
+标准网 3 n
+标准群体 3 n
+标准舞 6 n
+标准表 3 n
+标准规 3 n
+标准规定 5 l
+标准规范 3 n
+标准计 256 vn
+标准设计 2 n
+标准语 14 nz
+标准误差 3 n
+标准配备 2 n
+标准配置 4 n
+标准钟 3 n
+标准间 8 n
+标准集 6 n
+标准音 11 n
+标准题名 3 n
+标出 77 v
+标出去 3 v
+标出名字 3 n
+标出来 3 l
+标单 3 n
+标号 28 n
+标号图 3 n
+标同伐异 3 n
+标名 3 n
+标售 3 vn
+标商 3 n
+标图 3 n
+标图器 3 n
+标型元素 3 n
+标型离子 3 n
+标定 52 n
+标定罐 3 n
+标尺 93 n
+标帜 3 n
+标帜物 3 i
+标底 3 n
+标度 19 n
+标度因子 3 n
+标度盘 3 n
+标引 53 n
+标引文字 3 n
+标引服务 3 n
+标引深度 3 n
+标引词 2 n
+标引语 3 n
+标志 3624 n
+标志型 2 n
+标志性 89 n
+标志旗 2 n
+标志服 3 n
+标志灯 3 n
+标志点 3 n
+标志牌 21 n
+标志物 21 n
+标志符 3 n
+标志著 3 n
+标情夺趣 3 n
+标新创异 3 n
+标新立异 48 n
+标新竖异 3 i
+标新竞异 3 l
+标新领异 3 n
+标明 236 n
+标显 3 a
+标有 63 v
+标期 3 n
+标本 484 n
+标本兼治 37 l
+标本室 23 n
+标本虫 3 n
+标杆 41 n
+标枝野鹿 3 n
+标枪 134 n
+标格 2 n
+标桩 3 n
+标榜 135 n
+标榜着 3 l
+标段 3 n
+标注 141 v
+标灯 3 n
+标点 106 n
+标点符号 35 n
+标煤 4 n
+标牌 43 n
+标牌厂 3 n
+标牌机 3 n
+标王 5 n
+标界 3 n
+标疽 3 n
+标的 270 n
+标的物 20 n
+标的额 6 n
+标目 3 n
+标示 95 v
+标示出 3 n
+标示牌 3 n
+标称 9 n
+标竿 6 n
+标签 271 n
+标签机 3 n
+标签集 3 n
+标线 19 n
+标绘 8 n
+标统 3 n
+标致 105 n
+标记 485 n
+标记分子 3 n
+标记原子 3 n
+标记变量 3 n
+标记技术 3 n
+标记昆虫 3 nz
+标记牌 2 n
+标记符号 3 n
+标记识别 3 n
+标记页码 3 n
+标识 309 n
+标识号 3 n
+标识器 3 n
+标识牌 3 n
+标识物 5 n
+标识码 3 n
+标识符 22 n
+标识语 3 n
+标识语言 2 n
+标语 1709 n
+标语传单 3 n
+标语牌 144 n
+标调 4 n
+标购 3 v
+标贴 2 n
+标达 3 n
+标配 3 vn
+标量 43 n
+标金 3 n
+标靶 3 n
+标题 465 n
+标题新闻 3 n
+标题栏 3 n
+标题音乐 9 n
+标高 37 n
+标齐 3 a
+栈 169 n
+栈下推 3 n
+栈单 3 n
+栈向量 3 n
+栈字母表 3 n
+栈容量 3 n
+栈山航海 3 n
+栈恋 3 n
+栈房 14 n
+栈桥 37 n
+栈道 155 n
+栉 117 g
+栉垢爬痒 3 z
+栉比 13 v
+栉比鳞差 3 i
+栉比鳞次 3 i
+栉比鳞臻 3 i
+栉沐 2 v
+栉沐风雨 3 i
+栉霜沐露 3 i
+栉风沐雨 4 i
+栉风酾雨 3 vn
+栊 62 g
+栋 292 zg
+栋宇 3 n
+栋折榱坏 3 z
+栋折榱崩 3 v
+栋朽榱崩 3 v
+栋梁 45 n
+栋梁之才 6 i
+栋梁之材 17 i
+栋梁材 5 i
+栌 20 x
+栎 470 ng
+栎木 3 n
+栎树 13 n
+栎阳 5 ns
+栎阳雨金 3 n
+栏 734 n
+栏位 3 n
+栏内 3 n
+栏外 3 n
+栏干 3 n
+栏式 3 n
+栏数 3 n
+栏杆 776 n
+栏板 148 n
+栏架 16 n
+栏柜 3 n
+栏栅 2 n
+栏次 3 n
+栏目 450 n
+栏目主持 3 n
+栏目类 3 n
+栏目组 3 n
+栏网 3 n
+树 5516 v
+树上 931 s
+树上开花 3 i
+树下 3 s
+树世界 3 n
+树丛 271 n
+树丫 6 n
+树之风声 3 i
+树人 27 n
+树俗立化 3 n
+树倒根摧 3 i
+树倒猢狲散 18 l
+树冠 149 n
+树冠反射 3 l
+树冠线 3 n
+树凉儿 3 n
+树前 3 s
+树功扬名 3 i
+树功立业 3 n
+树势 9 n
+树叶 402 n
+树叶儿 3 n
+树叶子 26 n
+树叶茂盛 3 nz
+树同拔异 3 i
+树名 3 n
+树园 3 n
+树坑 2 n
+树墩 8 n
+树墩子 2 n
+树大招风 34 i
+树大根深 8 i
+树妖 3 n
+树孔 3 n
+树干 566 n
+树底下 37 s
+树形 41 n
+树形图 3 n
+树形象 3 n
+树影 69 n
+树德 7 n
+树德务滋 3 nz
+树德工专 3 n
+树心 3 n
+树怨 3 n
+树懒 22 n
+树挂 10 n
+树敌 43 n
+树文 3 n
+树新风 3 n
+树木 1028 n
+树木园 8 n
+树杈 67 n
+树林 669 n
+树林子 47 n
+树林镇 3 ns
+树枝 759 n
+树枝状 37 n
+树根 164 n
+树根头 3 n
+树桠 3 n
+树桩 43 n
+树梢 156 n
+树棚 3 n
+树榦 3 v
+树欲静而 3 i
+树欲静而风不止 10 i
+树正气 3 n
+树正沟 3 n
+树汁 3 n
+树洞 3 n
+树海 3 n
+树液 3 n
+树熊 3 n
+树状 13 n
+树獭 3 n
+树王 4 n
+树皮 469 n
+树皮画 4 n
+树碑 3 n
+树碑立传 10 i
+树神 3 n
+树种 876 n
+树种规划 3 l
+树突 24 n
+树立 1799 v
+树立典型 3 n
+树立权威 3 n
+树立理想 3 n
+树篱 3 n
+树精 3 n
+树线 3 n
+树组工 3 n
+树结构 3 n
+树胶 53 n
+树胶鞋 3 n
+树脂 422 n
+树脂剂 3 n
+树脂塑胶 3 n
+树脂层 3 n
+树脂植物 3 n
+树脂漆 4 n
+树脂砂 3 n
+树脂酸 8 n
+树节 3 n
+树花 4 n
+树苗 51 n
+树荫 67 n
+树荫下 3 n
+树莓 3 n
+树萌 3 i
+树葬 5 n
+树薯 2 n
+树藤 3 n
+树蛙 11 n
+树蜂 10 n
+树行子 3 n
+树袋熊 11 n
+树起 77 s
+树身 69 n
+树轮 3 n
+树酯 20 n
+树阴 32 n
+树阴凉 3 ns
+树阴凉儿 3 n
+树顶 79 n
+树顶上 3 n
+树高千丈 2 i
+树高招风 3 i
+树龄 172 n
+栒 2 zg
+栓 158 n
+栓剂 26 n
+栓塞 103 n
+栓塞物 3 n
+栓子 25 n
+栓牢 3 n
+栓皮 7 n
+栓皮栎 40 n
+栔 2 zg
+栕 2 zg
+栖 684 v
+栖丘饮谷 3 n
+栖于 3 v
+栖冲业简 3 n
+栖宿 3 v
+栖居 51 v
+栖息 894 v
+栖息地 83 n
+栖息处 3 v
+栖息谷 3 n
+栖所 3 v
+栖木 3 ns
+栖栖皇皇 3 ns
+栖止 3 v
+栖身 65 v
+栖身之地 3 n
+栖身之处 3 n
+栖霞 28 ns
+栖霞区 3 ns
+栖霞县 2 ns
+栖霞寺 6 ns
+栖霞山 10 ns
+栖霞市 3 ns
+栖风宿雨 3 n
+栗 235 nr
+栗占国 3 nr
+栗子 128 nr
+栗子园 3 nr
+栗成之 2 nr
+栗暴 5 n
+栗林嘴 256 nr
+栗树 18 nr
+栗树推 2 nr
+栗栗危惧 21 i
+栗栗自危 3 nr
+栗然 3 nr
+栗粒状 3 nr
+栗色 35 n
+栗花节 4 nr
+栗钙土 62 n
+栗鼠 3 n
+栘 3 zg
+栛 2 zg
+栝 6 n
+栝楼 12 n
+栟 7 zg
+栟柑 3 n
+校 2749 ng
+校中校 3 n
+校企 21 n
+校会 3 n
+校党委 12 n
+校内 115 s
+校内外 7 s
+校准 22 n
+校准器 3 n
+校刊 28 n
+校办 23 v
+校办工厂 3 n
+校务 54 n
+校勘 145 v
+校勘学 17 n
+校区 989 n
+校区内 3 n
+校区外 3 n
+校医 13 n
+校医院 3 n
+校友 98 n
+校友会 3 n
+校友录 3 n
+校友网 3 n
+校史 6 n
+校史馆 3 n
+校名 4391 n
+校团委 3 n
+校园 2714 n
+校园内 3 n
+校园剧 3 n
+校园卡 3 n
+校园文化 3 n
+校园文学 3 n
+校园歌手 3 n
+校园爱情 3 n
+校园环境 3 n
+校园生活 3 n
+校园社区 3 n
+校园笑话 3 n
+校园篮球 3 n
+校园网 37 n
+校园行 3 n
+校园论坛 3 n
+校场 70 n
+校场口 5 n
+校址 98 n
+校外 412 s
+校外活动 3 n
+校委会 2 n
+校官 55 n
+校定 3 n
+校对 89 v
+校对员 3 n
+校对室 3 n
+校对机 3 n
+校对者 3 n
+校对软件 3 n
+校射 21 v
+校尉 157 n
+校尉营 3 vn
+校属 3 n
+校工 10 n
+校巴 3 n
+校庆 102 n
+校微 3 v
+校徽 15 n
+校报 9 n
+校改 2 v
+校政 3 n
+校方 134 n
+校旗 2 n
+校时钟 3 n
+校景 3 n
+校服 38 n
+校本 49 n
+校本部 3 n
+校校通 3 n
+校样 24 n
+校核 12 n
+校歌 14 n
+校正 191 n
+校正器 4 n
+校正数 3 n
+校正曲线 3 n
+校正网络 3 n
+校注 76 v
+校点 77 n
+校牌 4 n
+校监 3 n
+校直 3 v
+校直试验 3 n
+校短推长 3 n
+校短量长 3 n
+校秤 3 n
+校稿 3 n
+校稿员 3 n
+校级 15 n
+校纪 3 n
+校编 3 n
+校舍 182 n
+校花 11 n
+校董 7 n
+校规 13 n
+校誉 3 n
+校警 3 n
+校订 96 v
+校订本 3 n
+校订者 3 n
+校训 27 n
+校译 3 n
+校车 53 n
+校运会 3 n
+校释 19 v
+校长 3791 n
+校长助理 3 n
+校长室 3 n
+校门 131 n
+校门口 14 n
+校阅 16 v
+校阅者 3 n
+校队 3 n
+校际 25 n
+校际比赛 3 n
+校院 2 n
+校雠学 3 vn
+校领导 51 n
+校风 58 n
+校风建设 3 n
+校验 62 n
+校验仪 3 n
+校验位 3 n
+校验数位 3 n
+校验文件 3 n
+校验码 3 n
+栤 8 zg
+栥 45 zg
+栦 420 zg
+栧 481 zg
+栨 295 zg
+栩 27 i
+栩栩 3 i
+栩栩如生 145 i
+栩栩如绘 3 i
+栩栩欲活 3 i
+栩栩然 2 i
+株 790 q
+株型 5 n
+株守 3 v
+株州 4 ns
+株式会社 90 nt
+株数 11 n
+株洲 85 ns
+株洲县 2 ns
+株洲市 26 ns
+株洲市中级人民法院 2 nt
+株系 4 n
+株蔓 3 n
+株行试验 3 n
+株距 2 n
+株连 100 ns
+株连九族 8 n
+株连蔓引 3 n
+株选 3 v
+栫 389 zg
+栬 212 zg
+栭 165 zg
+栰 3 zg
+栱 31 zg
+栲 64 n
+栲栳 8 n
+栲胶 65 n
+栳 2 x
+栴 2 zg
+栵 130 zg
+栶 2 zg
+样 2320 n
+样书 9 n
+样件 5 n
+样儿 190 n
+样册 3 n
+样分布 2 n
+样刊 2 n
+样品 445 n
+样品屋 3 n
+样品费 3 n
+样子 5676 n
+样子捣鬼 3 v
+样子沟 3 n
+样带 3 n
+样式 866 n
+样式表 3 n
+样张 5 n
+样态 3 n
+样本 276 n
+样本书 3 n
+样本偏差 3 n
+样本分布 8 n
+样本均值 8 n
+样本容量 3 n
+样本数 2 n
+样本空间 3 n
+样本股 3 n
+样本量 3 n
+样机 76 n
+样条 15 n
+样条回归 3 n
+样板 79 n
+样板工程 3 n
+样板戏 31 n
+样板房 4 n
+样板间 3 n
+样样 206 n
+样样精通 3 n
+样款 3 n
+样片 7 n
+样稿 3 n
+样窗 3 n
+样貌 3 n
+样车 161 n
+核 4229 n
+核下 3 n
+核不扩散 3 j
+核乳胶 3 n
+核事故 3 n
+核二院 7 n
+核仁 49 n
+核仁线 3 n
+核仁蛋白 3 l
+核价 3 n
+核优势 17 n
+核体 3 n
+核儿 14 n
+核入 3 n
+核军备 59 n
+核准 221 n
+核准制 3 n
+核准权 4 n
+核减 9 v
+核分裂 3 n
+核力 3 n
+核力量 153 n
+核办 3 v
+核动力 323 n
+核化 4 n
+核区 3 n
+核医学 3 n
+核危机 3 l
+核反击 3 l
+核反应 213 l
+核反应堆 139 l
+核发 44 v
+核发电 3 n
+核固缩 3 l
+核国家 42 n
+核垄断 27 n
+核型 46 n
+核基地 4 n
+核外电子 26 n
+核大国 3 n
+核威慑 86 n
+核威胁 50 n
+核子 84 n
+核子力 3 n
+核子动力 3 n
+核子反应 4 l
+核子学 3 n
+核子弹 3 n
+核子弹头 3 n
+核子战争 3 n
+核子武器 5 n
+核子潜艇 3 n
+核子能 3 n
+核孔 3 n
+核定 128 n
+核定表 3 n
+核实 318 n
+核实验 3 n
+核审 3 n
+核对 174 v
+核对表 3 n
+核导弹 92 n
+核岛 6 n
+核工业 102 n
+核工业城 3 n
+核工业部 7 n
+核工程 6 n
+核废料 26 n
+核引力 3 n
+核弹 225 n
+核弹头 292 n
+核心 4919 n
+核心人物 3 l
+核心作用 3 n
+核心内容 5 n
+核心区 53 n
+核心家庭 3 n
+核心层 3 n
+核心思想 5 n
+核心成员 3 n
+核心技术 6 n
+核心点 2 n
+核心理念 3 n
+核心网 3 n
+核心部件 3 n
+核战 3 n
+核战争 92 n
+核战略 3 n
+核打出 3 l
+核打击 3 l
+核扩散 87 j
+核批 3 v
+核技术 127 n
+核拨 2 v
+核收 4 n
+核政策 35 n
+核数师 5 n
+核果 127 n
+核查 317 vn
+核查员 2 n
+核查组 3 n
+核桃 850 n
+核桃仁 28 n
+核桃壳 2 n
+核桃木 3 n
+核桃林 5 n
+核桃树 17 n
+核桃油 3 n
+核桃烧 3 n
+核桃糕 3 n
+核桃肉 6 n
+核桃虫 3 n
+核桃酪 3 n
+核桩冠 3 n
+核武 113 n
+核武器 1551 n
+核武器化 3 n
+核武器库 6 n
+核武库 35 n
+核污染 3 n
+核泄漏 3 n
+核测井 3 n
+核液 3 n
+核清 3 n
+核溶解 3 n
+核潜艇 937 n
+核火箭 3 l
+核燃料 133 n
+核爆 13 v
+核爆炸 151 n
+核物理 134 n
+核物理学家 5 n
+核状 3 n
+核球 3 n
+核生化 3 n
+核电 406 n
+核电厂 16 n
+核电机组 7 n
+核电界 3 n
+核电站 493 n
+核磁 17 n
+核磁共振 102 l
+核磁测井 3 n
+核示 3 v
+核禁试 48 n
+核科学 11 n
+核科学家 6 l
+核移植 3 l
+核突 3 vn
+核竞赛 8 n
+核签 3 n
+核算 330 n
+核算单位 3 n
+核算员 2 n
+核算成本 3 n
+核糖 59 n
+核糖体 45 n
+核糖核酸 65 n
+核素 116 n
+核素图 3 n
+核网 3 n
+核聚变 101 n
+核能 249 n
+核能力 59 n
+核能源 13 n
+核能级 3 n
+核膜 3 n
+核苷 3 n
+核苷酸 147 n
+核菌 3 n
+核蛋白 5 l
+核裁军 37 n
+核裂变 65 n
+核装置 17 n
+核覆 3 v
+核计 9 v
+核计划 78 n
+核讹诈 56 n
+核设施 2 n
+核试 228 vn
+核试爆 3 l
+核试验 557 n
+核试验场 3 n
+核质 3 n
+核质互作 3 l
+核质蛋白 3 n
+核资 3 vn
+核辐射 57 n
+核选择 2 l
+核配 3 vn
+核酪 3 n
+核酶 3 n
+核酸 162 n
+核酸酶 3 n
+核销 15 n
+核销单 3 n
+核飞弹 3 n
+核验 3 n
+核黄素 21 n
+根 5413 p
+根丝体 3 n
+根儿 22 n
+根冠 14 n
+根区 3 n
+根号 5 n
+根哥布 3 nrt
+根固位体 3 n
+根基 364 n
+根基深厚 3 i
+根堆群培 3 ns
+根壮叶茂 3 i
+根子 130 n
+根孤伎薄 3 i
+根尖 3 a
+根尖周炎 3 n
+根尖片 3 n
+根尖纤维 3 n
+根尼 48 nrt
+根底 46 n
+根廷 4 n
+根式 49 n
+根性 16 n
+根拔 3 n
+根指数 3 n
+根据 24221 p
+根据上述 4 n
+根据地 2932 n
+根据槃互 3 v
+根据盘互 3 n
+根插 3 v
+根斯坦 2 nrt
+根本 9780 a
+根本人物 3 n
+根本任务 3 n
+根本保证 3 n
+根本利益 3 n
+根本原因 3 n
+根本变化 3 n
+根本大法 3 n
+根本好转 3 i
+根本宗旨 3 i
+根本就是 3 n
+根本性 279 n
+根本措施 3 n
+根本无法 23 i
+根本法 17 n
+根本点 9 n
+根本矛盾 3 i
+根本途径 3 n
+根机 3 n
+根朽枝枯 3 i
+根杰 2 n
+根柢 3 i
+根株牵连 3 i
+根株结盘 3 i
+根株附丽 3 i
+根样 3 n
+根植 30 v
+根椽片瓦 3 v
+根正苗红 3 i
+根毛 73 n
+根河 18 n
+根河市 3 ns
+根治 183 n
+根治性 8 n
+根治术 33 n
+根深叶茂 11 i
+根深本固 3 i
+根深枝茂 3 i
+根深柢固 2 vn
+根深蒂固 156 i
+根深蒂结 3 i
+根源 783 n
+根源地 3 n
+根牙盘错 3 i
+根牢蒂固 3 i
+根特 17 a
+根状 3 n
+根状茎 92 n
+根环 3 n
+根生土长 3 n
+根由 61 p
+根瘤 42 n
+根瘤细菌 3 n
+根瘤菌 42 n
+根瘤菌剂 3 n
+根盘蒂结 3 i
+根目录 4 n
+根究 3 n
+根竖 3 i
+根竹 3 n
+根管口 3 n
+根管封闭 3 n
+根管钻 3 n
+根管锉 3 n
+根管闭塞 3 n
+根系 211 n
+根红 3 n
+根红苗正 3 i
+根纳季 6 n
+根线 2 n
+根线虫病 3 n
+根结 3 a
+根结盘固 3 i
+根结盘据 3 n
+根绝 26 a
+根肋骨 3 z
+根肿病 3 n
+根脚 4 n
+根腐病 4 n
+根舍 13 n
+根艺 7 n
+根芽 2 n
+根苗 33 n
+根茎 109 n
+根茎叶 3 t
+根茨 5 nrt
+根蒂 2 nrt
+根蟠节错 3 i
+根连株拔 3 i
+根部 145 n
+根部焊道 3 n
+根键 3 n
+根长 2 n
+根间纤维 3 n
+根除 86 v
+根除祸患 3 i
+根雕 32 n
+根霉蝶呤 3 n
+根音 3 n
+根须 66 n
+栻 19 zg
+格 4237 n
+格丁尼 4 nr
+格丁根 89 nz
+格万杜 2 nr
+格不相入 3 i
+格中飞 2 nr
+格之格 3 nr
+格于成例 3 i
+格什姆岛 3 nrt
+格什文 3 nz
+格什温 3 nrt
+格伦斯 3 nr
+格伦瓦尔 2 nrt
+格但斯克 37 ns
+格位 3 n
+格儿 5 nr
+格克伦 2 nr
+格兰仕 13 nr
+格兰函数 3 n
+格兰富 3 nz
+格兰德 20 nr
+格兰德河 35 ns
+格兰扁 6 nr
+格兰杰 2 nr
+格兰格 2 nr
+格兰特 54 nr
+格兰菲 19 nr
+格兰菲迪 10 nrt
+格兰蒂亚 3 nrt
+格兰迪 2 nz
+格列佛 5 nr
+格列卫 4 nr
+格列朗 2 nr
+格列柯 2 nr
+格列科 2 nr
+格则勒 5 nr
+格利 11 nz
+格利哈 2 nrt
+格利维 2 nr
+格利雅 12 nr
+格力 73 n
+格力电器 6 nz
+格力空调 3 n
+格努姆 2 nr
+格劳宾 2 nr
+格劳斯 2 nr
+格劳秀 2 nr
+格劳秀斯 3 nr
+格勒 7 nrt
+格勒兹 2 nr
+格勒山 2 nr
+格勒诺 3 nr
+格勒诺布尔 12 nrt
+格化处理 3 n
+格卡农 2 nr
+格卢克 2 nr
+格卢勒 8 nr
+格卢斯曼 8 nrt
+格古通今 3 n
+格吕内瓦尔德 3 nrt
+格吕恩 2 nr
+格吕菲 2 nr
+格哈德 2 nr
+格哈斯 2 nr
+格坎普 2 nr
+格坚皇帝 2 nr
+格堡 2 nrt
+格塞尔 7 nr
+格外 1290 d
+格外开恩 3 nr
+格天阁 3 nr
+格奈森诺 2 nr
+格套 3 nz
+格奥尔 3 nr
+格奥尔基 7 nrt
+格威尔 3 nr
+格威特 8 nr
+格子 162 n
+格子呢 3 nr
+格子布 5 nr
+格子状 3 nr
+格子窗 3 nr
+格子纸 3 nz
+格子花 3 nr
+格子裙 3 nr
+格尔兹 12 nr
+格尔利 2 nr
+格尔塔纳 5 nrt
+格尔塞 5 nr
+格尔尼卡 7 nrt
+格尔峰 2 nr
+格尔必 3 nr
+格尔曼 4 nr
+格尔木 80 nr
+格尔木市 23 ns
+格尔木机场 2 ns
+格尔森 3 nr
+格尔毕 2 nr
+格尔语 2 nz
+格局 1666 n
+格岛 2 ns
+格巴 3 nrt
+格巴恩 2 nr
+格布哈 2 nrt
+格廷根 6 nr
+格开钢 2 nr
+格式 683 n
+格式化 54 nr
+格式安排 3 nr
+格式文件 3 n
+格形管 3 n
+格律 167 n
+格律学 3 nr
+格律诗 3 nr
+格德 4 nrt
+格德林 7 nr
+格德森 2 nr
+格思里 5 nr
+格恩莱 3 nr
+格拉 68 nrt
+格拉兹 2 nr
+格拉古 11 ns
+格拉塞 7 nr
+格拉夫 16 nr
+格拉姆 6 nr
+格拉德 5 nrt
+格拉斯 12 nr
+格拉斯哥 75 ns
+格拉斯曼 13 nrt
+格拉泽 5 nr
+格拉玛 54 nr
+格拉纳 35 nr
+格拉肖 4 nr
+格拉芙 3 nrt
+格拉茨 38 nrt
+格拉萨 2 nr
+格拉西 5 ns
+格拉西莫夫 2 nrt
+格拉诺 9 nr
+格拉赫 5 nr
+格措夫 2 nr
+格斗 210 nr
+格斗之王 3 nz
+格斗天书 3 nz
+格斗游戏 3 n
+格斗王 3 nz
+格斗类 3 n
+格斗者 3 n
+格斯 14 nrt
+格斯克 2 nr
+格斯图 2 nr
+格斯坦 8 nr
+格斯尔 7 nr
+格斯特 4 nrt
+格斯纳 2 nr
+格日寺 2 nz
+格曲 5 n
+格朗德 6 nr
+格朗日 30 nrt
+格木 20 nr
+格杀 144 nz
+格杀不论 6 i
+格杀勿论 40 i
+格杀弗论 3 nr
+格杀无论 3 i
+格林 61 nr
+格林兄弟 10 nr
+格林卡 13 nr
+格林奈尔 6 nr
+格林威治 16 nr
+格林尼治 64 nz
+格林斯 3 nr
+格林斯潘 22 nrt
+格林柯尔 19 nz
+格林格 2 nr
+格林氏 2 nr
+格林河 4 nr
+格林湾 2 nr
+格林童话 3 n
+格林纳 4 nr
+格林纳丁斯 22 ns
+格林纳达 52 nrt
+格林维尔 7 nrt
+格林著 8 nr
+格林诺 2 nr
+格林诺克 2 nrt
+格林豪 5 nr
+格查尔 3 nr
+格栅灯 3 n
+格格 160 n
+格格不入 89 i
+格格不吐 3 i
+格格不纳 3 ns
+格格儿 7 nr
+格格先 2 nr
+格格娇 47 nr
+格格格 16 nr
+格格直 7 nr
+格格福 2 nr
+格格笑 6 nr
+格格轻 3 nr
+格框架 2 n
+格桑曲杰 4 nr
+格桑梅朵 2 nr
+格氏试剂 3 nz
+格沃兹 2 nr
+格河 2 ns
+格法 18 n
+格泰姆 9 nr
+格洛克 3 nr
+格洛夫 3 nr
+格洛弗 2 nr
+格洛斯 2 nr
+格洛斯特 12 nrt
+格洛斯特郡 2 ns
+格浦尔 6 nr
+格涅辛 2 nr
+格清奇 2 nr
+格温妮 3 nr
+格片 3 n
+格物 40 n
+格物穷理 6 n
+格物致知 27 i
+格特 3 nrt
+格特鲁德 5 nrt
+格状 24 nz
+格玛先 2 nr
+格瑞斯 3 nr
+格瑞特 3 nr
+格瓦拉 8 nrt
+格登 22 nrt
+格登山 3 nr
+格登碑 3 nr
+格纳库 20 nr
+格纳特 4 nr
+格网 3 nz
+格罗 30 nrt
+格罗兹尼 16 nrt
+格罗史 2 nr
+格罗夫 12 nr
+格罗夫山 2 nrt
+格罗夫斯 3 nrt
+格罗姆 2 nr
+格罗宁根 13 ns
+格罗弗 2 nr
+格罗德诺 4 nrt
+格罗恩 3 nr
+格罗斯 55 nr
+格罗斯曼 4 nrt
+格罗查 2 nr
+格罗理 2 nr
+格罗皮 4 nr
+格罗索 3 nr
+格罗纳斯 14 nrt
+格罗莫夫 3 nrt
+格罗蓬 13 nr
+格罗诗 2 nr
+格罗顿 5 nr
+格翰 5 nrt
+格老子 2 nr
+格老村 2 nr
+格致 11 d
+格致中学 3 nt
+格致余 3 nr
+格致余论 3 i
+格致公 2 nr
+格致国中 3 nr
+格茨 3 nrt
+格莱尔 2 nr
+格莱布 3 nr
+格莱斯 11 nr
+格莱斯顿 23 nrt
+格莱格 2 nr
+格莱特 2 nr
+格莱美 3 nr
+格莱美奖 3 nz
+格莱达 3 nr
+格莹莹 2 nr
+格萨尔 63 nr
+格萨拉 2 nr
+格萨飞 3 nr
+格蒙迪 6 nr
+格蕾丝 3 nr
+格蕾斯 4 nr
+格西 6 ns
+格言 148 n
+格言派 3 nr
+格语 3 nz
+格调 202 n
+格调高雅 3 nr
+格贝克 3 nz
+格达 8 nz
+格达丽 2 nr
+格达莱 3 nr
+格迪托 2 nr
+格迪斯 5 nr
+格里 88 nrt
+格里丰 3 nr
+格里利 2 nrt
+格里历 13 nr
+格里夫 3 nrt
+格里夫尼亚 2 nrt
+格里夫斯 15 nrt
+格里奥 14 nrt
+格里姆斯 3 nrt
+格里宁 3 nr
+格里尔 4 nrt
+格里弗 5 nr
+格里戈里耶夫 4 nrt
+格里斯 4 nrt
+格里格 11 nrt
+格里森 3 nr
+格里沙 3 nr
+格里河 3 nr
+格里特 2 nrt
+格里科 7 nrt
+格里耶 5 nr
+格里芬 30 nr
+格里芬湖 3 ns
+格里茨 2 nrt
+格里菲 2 nrt
+格里菲斯 22 nrt
+格陵兰 129 nr
+格陵兰岛 43 ns
+格隆济 2 nr
+格雷 46 nr
+格雷伯爵 2 nr
+格雷博 3 nr
+格雷厄姆 33 nrt
+格雷哥尔 2 nrt
+格雷多 2 nrt
+格雷夫 17 nr
+格雷夫斯 2 nrt
+格雷夫森 2 nrt
+格雷姆 2 nr
+格雷布纳 5 nrt
+格雷戈 3 nr
+格雷戈尔 2 nrt
+格雷戈里 17 nrt
+格雷拉 18 nrt
+格雷斯 3 nr
+格雷族 2 nr
+格雷果 4 nr
+格雷格 6 nr
+格雷欣 4 nr
+格雷泽 3 nr
+格雷特 3 nr
+格雷省 2 ns
+格雷米 3 nrt
+格雷米奥 3 nrt
+格雷维 2 nr
+格雷罗 8 nr
+格雷罗州 2 ns
+格雷茅斯 3 nrt
+格雷茨 2 nrt
+格雷菲 2 nr
+格非 15 ns
+格马林 2 nr
+格高意远 3 nz
+格鲁乌 2 nr
+格鲁伯 2 nr
+格鲁克 14 nr
+格鲁吉亚 202 ns
+格鲁吉亚人 10 nrt
+格鲁吉亚共和国 5 ns
+格鲁吉亚语 4 nz
+格鲁塞 2 nr
+格鲁夫 4 nr
+格鲁宁 2 nr
+格鲁尔 4 nr
+格鲁巴 3 nr
+格鲁斯 2 nr
+格鲁曼 45 nr
+格鲁森 2 nr
+格鲁派 82 nr
+格鲁申 2 nr
+格鲁西 2 nr
+格鲁贝尔 3 nrt
+格鲁门 52 nr
+格鲍尔 8 nr
+栽 841 v
+栽下 3 v
+栽下去 3 l
+栽下来 3 l
+栽倒 111 v
+栽入 3 v
+栽到 3 v
+栽培 1205 vn
+栽培业 3 l
+栽培品种 3 l
+栽培技术 3 l
+栽培植物 46 l
+栽培法 4 l
+栽子 3 n
+栽排 3 vn
+栽插 3 v
+栽斤头 3 l
+栽树 8 n
+栽桑 3 n
+栽植 147 v
+栽植机 3 l
+栽植法 3 l
+栽种 125 vn
+栽种法 3 l
+栽秧 5 vn
+栽绒 24 n
+栽花 3 vn
+栽苗 3 v
+栽诬 3 v
+栽赃 53 vn
+栽跟头 13 l
+栽跟斗 3 l
+栽进 3 v
+栽进去 3 l
+栽进来 3 l
+栾 15 nr
+栾为夫 2 nr
+栾南 3 ns
+栾城 19 ns
+栾城县 6 ns
+栾川 8 nr
+栾川县 2 ns
+栾布击 3 nr
+栾廷玉 19 nr
+栾晓娜 2 nr
+栾树属 3 nr
+栾老寨 4 nr
+栾菊杰 2 nr
+栿 2 zg
+桀 89 nr
+桀傲不恭 3 i
+桀傲不驯 9 i
+桀敖不驯 3 nr
+桀桀 3 i
+桀桀狂笑 3 i
+桀犬吠尧 3 i
+桀纣 10 n
+桀贪骜诈 3 i
+桀骜 13 a
+桀骜不恭 3 i
+桀骜不逊 3 i
+桀骜不驯 42 i
+桀骜自恃 3 i
+桀骜难驯 3 i
+桀黠 3 a
+桁 84 zg
+桁架 104 n
+桁桷 3 n
+桁梁 112 n
+桂 1126 nr
+桂世镛 18 nr
+桂东 22 ns
+桂东县 5 ns
+桂中 6 ns
+桂儿娘 2 nr
+桂元清 8 nr
+桂兄弟 2 nr
+桂公公 50 nr
+桂六省 2 ns
+桂兰 7 ns
+桂冠 144 nr
+桂冠诗人 3 nr
+桂剧 6 n
+桂勤王 2 nr
+桂北 14 ns
+桂南 22 ns
+桂发祥 2 nr
+桂合兵 3 nr
+桂园 2 ns
+桂图旗 2 nr
+桂圆 40 nr
+桂圆乾 3 nr
+桂圆汤 3 nr
+桂圆肉 6 n
+桂大哥 6 nr
+桂奉崇 2 nr
+桂奉旨 3 nr
+桂子兰孙 3 nr
+桂子飘香 3 nr
+桂容柏寝 3 nr
+桂小宝 5 nr
+桂山 5 ns
+桂山脉 2 ns
+桂山镇 3 ns
+桂州 3 ns
+桂希恩 20 nr
+桂平 18 nr
+桂平县 12 ns
+桂平市 8 ns
+桂平汇 2 ns
+桂平西 3 ns
+桂平路 3 ns
+桂庙 2 ns
+桂忠阳 2 nr
+桂慧樵 3 ns
+桂折一枝 3 nr
+桂折兰摧 3 nr
+桂拥立 2 nr
+桂晓风 4 nr
+桂林 1270 nr
+桂林一枝 3 nr
+桂林人 8 nr
+桂林地区 7 ns
+桂林山水 3 ns
+桂林市 59 ns
+桂林市政府 2 nt
+桂林杏苑 3 nr
+桂枝 23 nr
+桂枝汤 3 nr
+桂枝片玉 3 nr
+桂树 19 nr
+桂正和 3 nr
+桂殿兰宫 3 nr
+桂永清 4 nr
+桂江 10 ns
+桂河 9 ns
+桂河大桥 3 ns
+桂玉之地 3 nr
+桂王朱 5 nr
+桂珍姐 4 nr
+桂生高 2 nr
+桂皮 30 n
+桂皮树 3 nr
+桂相公 14 nr
+桂离宫 8 nr
+桂系 14 n
+桂花 479 nr
+桂花城 3 ns
+桂花树 29 nr
+桂花路 3 ns
+桂花酒 3 nr
+桂花香 3 nr
+桂薪玉粒 3 nr
+桂西 25 ns
+桂贝勒 9 nr
+桂质廷 256 nr
+桂起兵 2 nr
+桂酒椒浆 3 n
+桂金 3 n
+桂阳 36 ns
+桂阳县 3 ns
+桂陵 10 ns
+桂香阁 2 nr
+桂馥兰香 3 nr
+桂馥著 2 nr
+桂鱼 258 nr
+桃 1494 ns
+桃之夭夭 7 i
+桃仁 23 n
+桃仙 4 n
+桃僵李代 3 n
+桃儿 3 n
+桃儿七 3 ns
+桃叶仙 3 n
+桃园 377 ns
+桃园人 3 n
+桃园县 12 ns
+桃园市 4 ns
+桃园路 3 ns
+桃城区 3 ns
+桃太郎 3 n
+桃夭李艳 3 i
+桃夭柳媚 3 i
+桃子 93 n
+桃实仙 3 n
+桃山 16 ns
+桃山区 3 ns
+桃干仙 3 n
+桃弧棘矢 3 n
+桃木 18 n
+桃木疙瘩村 2 n
+桃李 60 n
+桃李不言 3 i
+桃李之教 3 i
+桃李之馈 3 n
+桃李争辉 3 n
+桃李园 3 n
+桃李成蹊 3 i
+桃李无言 3 i
+桃李春风 2 i
+桃李杯 2 n
+桃李满天 3 i
+桃李满天下 15 i
+桃李精神 3 i
+桃李荫翳 3 n
+桃李门墙 3 n
+桃来李答 3 ns
+桃林 11 ns
+桃枝仙 3 n
+桃树 61 n
+桃核 19 n
+桃根 160 ns
+桃根仙 3 ns
+桃汛 3 n
+桃江 11 ns
+桃江县 2 ns
+桃源 353 n
+桃源县 15 ns
+桃源居 3 ns
+桃源村 3 ns
+桃源洞 3 ns
+桃源街 3 ns
+桃源路 3 ns
+桃溪 5 ns
+桃皮绒 3 n
+桃符 13 n
+桃红 83 n
+桃红柳绿 12 i
+桃红色 5 n
+桃羞李让 3 i
+桃羞杏让 3 i
+桃胶 2 n
+桃脯 3 n
+桃腮杏脸 3 n
+桃腮柳眼 3 n
+桃腮粉脸 3 n
+桃色 18 n
+桃色新闻 3 n
+桃色纠纷 3 z
+桃芝 3 n
+桃花 4047 n
+桃花人面 4 n
+桃花仙 3 n
+桃花园 5 ns
+桃花坞 35 ns
+桃花垠 3 i
+桃花尖 3 n
+桃花岛 3 ns
+桃花庵 3 ns
+桃花开 3 ns
+桃花心木 3 i
+桃花扇 3 n
+桃花村 12 ns
+桃花汛 5 n
+桃花江 3 ns
+桃花流水 3 ns
+桃花源 64 n
+桃花源地 3 ns
+桃花源记 3 n
+桃花潭水 3 ns
+桃花脸 3 i
+桃花节 23 n
+桃花薄命 3 i
+桃花讯 3 n
+桃花运 30 n
+桃花铺 21 ns
+桃花雪 3 n
+桃花鱼 2 n
+桃谷 3 n
+桃谷六仙 3 ns
+桃蹊柳曲 3 i
+桃酥 2 n
+桃金娘根 3 ns
+桄 2 n
+桄榔 2 n
+桅 173 n
+桅上斜杆 3 n
+桅帆 3 n
+桅座 3 n
+桅杆 184 n
+桅杠 3 n
+桅楼 3 n
+桅樯 4 n
+桅灯 18 n
+桅竿 3 n
+桅顶 6 n
+框 299 v
+框上 3 n
+框下 3 n
+框下去 3 v
+框下来 3 v
+框住 3 v
+框体 3 n
+框内 3 n
+框出 3 n
+框出来 3 v
+框图 14 n
+框子 17 n
+框定 7 n
+框架 821 n
+框架图 2 n
+框架结构 2 n
+框格 3 n
+框框 132 n
+框槛 3 n
+框死 3 n
+框着 3 n
+框起 3 v
+框起来 3 v
+框选 3 n
+案 2916 n
+案一审 3 n
+案中案 3 n
+案二审 3 n
+案件 3305 n
+案件材料 3 n
+案件线索 3 n
+案例 745 n
+案例库 3 n
+案侦破 3 n
+案值 15 n
+案兵束甲 3 n
+案内 3 n
+案册 3 n
+案几 3 n
+案剑瞋目 3 n
+案卷 179 n
+案发 61 n
+案发前 3 n
+案发后 3 n
+案发地点 3 n
+案发时 3 n
+案发现场 3 n
+案外 3 n
+案外人 3 n
+案外案 3 n
+案头 67 n
+案头工作 3 n
+案头柜 3 n
+案子 501 n
+案宗 3 n
+案底 2 n
+案庭审 3 n
+案开审 3 n
+案开庭 3 n
+案情 490 n
+案情大白 3 n
+案无留牍 3 i
+案板 82 n
+案桌 3 n
+案源 3 n
+案牍 16 n
+案牍之劳 3 i
+案牍劳形 3 n
+案犯 14 n
+案由 11 n
+案甲休兵 3 n
+案目 3 n
+案秤 4 n
+案语 3 n
+案首 3 n
+桉 38 n
+桉叶油 4 n
+桉树 46 n
+桉树林 2 n
+桉油 3 n
+桌 966 n
+桌上 2279 s
+桌上型 3 n
+桌上排版 3 n
+桌下 3 s
+桌儿 3 n
+桌前 204 s
+桌子 2047 n
+桌子山 13 n
+桌子板凳 3 n
+桌巾 3 n
+桌布 48 n
+桌斗 3 n
+桌旁 129 s
+桌架 3 n
+桌案 56 n
+桌椅 260 n
+桌椅板凳 18 n
+桌灯 2 n
+桌球 3 n
+桌球台 3 n
+桌球室 3 n
+桌球队 3 n
+桌脚 3 n
+桌腿 17 n
+桌边 195 s
+桌面 377 n
+桌面上 3 n
+桌面主题 3 n
+桌面儿上 3 n
+桌面图 3 n
+桌面图标 3 n
+桌面图片 3 n
+桌面墙纸 3 n
+桌面壁纸 3 n
+桌面处理器 7 n
+桌面开发 3 nz
+桌面式 3 n
+桌面操作系统 3 n
+桌面版 3 n
+桌面环境 2 n
+桌面秀 3 nz
+桌面背景 3 n
+桌面规 3 n
+桎 3 n
+桎梏 50 n
+桐 178 ns
+桐乡 35 ns
+桐乡县 6 ns
+桐乡市 4 ns
+桐叶知秋 3 n
+桐君阁 3 nr
+桐城 94 ns
+桐城人 3 n
+桐城县 6 ns
+桐城市 3 ns
+桐城派 3 nr
+桐子 8 n
+桐庐 29 ns
+桐庐县 17 ns
+桐木 11 ns
+桐林 6 ns
+桐果 3 n
+桐柏 31 ns
+桐柏县 13 ns
+桐柏山 293 ns
+桐柏路 3 ns
+桐树 8 ns
+桐梓 5 ns
+桐梓县 2 ns
+桐油 119 n
+桐油树 3 n
+桐籽 2 n
+桑 774 nr
+桑三娘 18 nr
+桑中之喜 3 nr
+桑中之约 3 nr
+桑书手 2 n
+桑乾水 2 nr
+桑二世 5 nr
+桑代克 8 nr
+桑体诗 3 nr
+桑佩尔 2 nr
+桑兰西党 13 ns
+桑兹德 2 nr
+桑养蚕 12 nr
+桑冬平 2 nr
+桑切尔 5 nr
+桑切斯 26 nr
+桑利斯 2 nr
+桑加尔 2 nr
+桑加河 6 ns
+桑占东 2 nr
+桑原 3 ns
+桑叶 43 nr
+桑吉卓 69 nr
+桑吉嘉 3 nr
+桑吉坚 3 nr
+桑吉涅 2 nr
+桑呵呵 2 nr
+桑哥专 3 nr
+桑嘉措 5 nr
+桑园 30 nr
+桑国卫 257 nr
+桑土之谋 3 nr
+桑土之防 3 nr
+桑土公 52 nr
+桑土绸缪 3 nr
+桑地 3 n
+桑地诺 27 nr
+桑坦德 31 nr
+桑堤酥 3 nr
+桑塔尔 5 nr
+桑塔格 4 nr
+桑塔纳 29 nr
+桑塔那 3 nr
+桑塔雅 6 nr
+桑塔露 2 nr
+桑夏恩 2 nr
+桑天牛 3 nr
+桑奎内 2 nr
+桑姑娘 2 nr
+桑孙二 2 nr
+桑宁翁 2 nr
+桑家口 3 nr
+桑家瓦 2 nr
+桑寄生 8 nr
+桑岛 3 ns
+桑巴 19 nr
+桑巴特 7 nr
+桑巴舞 6 nr
+桑布尔 2 nr
+桑干河 38 ns
+桑库鲁 4 nr
+桑弘羊 77 nr
+桑弧蒿矢 3 nr
+桑弧蓬矢 3 n
+桑德丽 2 nr
+桑德伊 3 nr
+桑德兰 33 nr
+桑德勒 3 nr
+桑德奇 2 nr
+桑德尔 4 nr
+桑德岛 2 nr
+桑德拉 4 nr
+桑德斯 13 nr
+桑德森 14 nr
+桑德罗 5 nr
+桑德菲 3 nr
+桑德贝 5 nr
+桑德逊 3 nr
+桑德雷 2 nr
+桑戈尔 7 nr
+桑戈语 4 nr
+桑户桊枢 3 n
+桑户棬枢 3 n
+桑户蓬枢 3 n
+桑托斯 66 nr
+桑托索 3 nr
+桑拉巴 20 nr
+桑拿 44 nr
+桑拿天 3 ns
+桑拿室 3 nr
+桑拿房 3 ns
+桑拿浴 36 nr
+桑斯儿 42 nr
+桑日 3 nrt
+桑日县 3 ns
+桑昆义 2 nr
+桑普多 3 nr
+桑普多利亚 10 ns
+桑普多利亚队 2 nz
+桑普多里亚 7 nrt
+桑普拉斯 15 nrt
+桑普森 11 nr
+桑普顿 2 nr
+桑曲丹 3 nr
+桑木张 2 nr
+桑木虱 3 n
+桑杏汤 5 nr
+桑果 3 n
+桑枝村 2 nr
+桑枢甕牖 3 n
+桑枢韦带 3 vn
+桑柘满 2 nr
+桑树 78 nr
+桑格拉 2 nr
+桑桑丁 3 nr
+桑梓 42 nrfg
+桑植 38 nr
+桑植县 8 nr
+桑椹 28 nr
+桑椹子 3 nz
+桑榆 4 nr
+桑榆之景 3 nr
+桑榆晚景 3 nr
+桑榆暮景 3 nr
+桑榆末景 3 nr
+桑榆非晚 3 nr
+桑樟 3 ns
+桑次仁 6 nz
+桑毛虫 3 nr
+桑河 2 ns
+桑泊一 2 nr
+桑洞主 2 nr
+桑海 37 ns
+桑海人 2 nr
+桑海语 3 nr
+桑玉柱 2 nr
+桑田 12 nr
+桑田之 2 nr
+桑田沧海 3 ns
+桑田碧海 3 nr
+桑白皮 2 nr
+桑皮纸 9 n
+桑相会 3 nr
+桑科 21 nr
+桑科尔 2 nr
+桑结加 3 nr
+桑结嘉 13 nr
+桑结笑 2 nr
+桑结见 2 nr
+桑给巴尔 94 ns
+桑给巴尔革命政府 2 nt
+桑维翰 3 nr
+桑耶寺 5 nr
+桑荫不徙 3 n
+桑荫未移 3 nr
+桑菊饮 7 nr
+桑落瓦解 3 nr
+桑葚 13 nr
+桑蒂尼 2 nr
+桑蒂斯 5 nr
+桑蚕 48 nr
+桑蚕丝 15 nr
+桑螵蛸 3 n
+桑诸羌 2 nr
+桑象虫 3 nr
+桑贝丸 2 nr
+桑贾伊 3 nr
+桑贾尔 2 nr
+桑贾尼 9 nr
+桑赫斯 5 nr
+桑达克 7 nr
+桑迪亚 2 nr
+桑迪福德 9 nr
+桑那 3 nr
+桑那州 3 ns
+桑那浴 2 nr
+桑针 3 n
+桑间之咏 3 n
+桑间之约 3 n
+桑间之音 3 nz
+桑间濮上 4 nr
+桑飞虹 70 nr
+桑默斯 3 nr
+桓 493 nr
+桓之族 2 nr
+桓之曲 2 nr
+桓仁 10 nr
+桓仁县 2 nr
+桓仁满族自治县 6 ns
+桓公之 2 nr
+桓公友 2 nr
+桓公台 2 nr
+桓公沟 4 nr
+桓冲卒 3 nr
+桓叔之 3 nr
+桓台 4 nr
+桓台县 4 ns
+桓宗天 2 nr
+桓宗纯 3 nr
+桓帝延 4 nr
+桓帝建 4 nr
+桓帝永 5 nr
+桓彦范 13 nr
+桓温专 3 nr
+桓温举 2 nr
+桓温之 3 nr
+桓温伐 2 nr
+桓温死 4 nr
+桓温灭 4 nr
+桓玄 47 nr
+桓石民 4 nr
+桓胱印 2 nr
+桓銮庠 2 nr
+桓鑫蘩 2 nr
+桓鑫锾 3 nr
+桔 141 nr
+桔井 5 n
+桔农 3 n
+桔味 3 n
+桔园 3 n
+桔子 35 n
+桔子原汁 3 n
+桔子水 3 n
+桔子皮 3 n
+桔子红了 3 n
+桔子酱 3 n
+桔柑 3 n
+桔树 2 n
+桔梗 70 n
+桔梗花 3 n
+桔汁 3 n
+桔皮 3 n
+桔红 17 b
+桔红色 14 n
+桔饼 3 n
+桔黄 7 b
+桔黄色 12 n
+桕 14 g
+桕脂 3 n
+桚 6 zg
+桜 14 zg
+桟 3 zg
+桠 69 n
+桠杈 3 n
+桠枝 3 n
+桠枫 3 n
+桡 115 n
+桡动脉 2 n
+桡骨 12 n
+桢 24 g
+档 2035 n
+档位 3 n
+档儿 3 n
+档册 3 n
+档卷 3 n
+档名 3 n
+档子 46 n
+档期 142 n
+档板 3 n
+档案 1172 n
+档案夹 3 n
+档案学 66 n
+档案室 6 n
+档案局 13 n
+档案库 14 n
+档案文件 3 n
+档案柜 3 n
+档案法 4 n
+档案盒 3 n
+档案管理 3 n
+档案袋 11 n
+档案资料 2 n
+档案馆 119 n
+档次 419 n
+档级 3 n
+桤 62 g
+桤木 7 n
+桥 8499 n
+桥上 3 s
+桥下 332 s
+桥东 4 ns
+桥东区 3 ns
+桥儿沟 4 n
+桥党 5 n
+桥口 2 n
+桥口区 3 n
+桥台 15 n
+桥名 5 n
+桥固位体 3 n
+桥型 6 n
+桥基 5 n
+桥基牙 3 ns
+桥堍 3 s
+桥墩 373 n
+桥墩下 3 n
+桥头 156 n
+桥头取代 3 n
+桥头堡 1022 ns
+桥头绿化 3 n
+桥头镇 2 n
+桥孔 81 n
+桥宽 3 n
+桥山 12 ns
+桥岩山 3 nr
+桥底 3 s
+桥底下 3 s
+桥式 21 n
+桥式起重 3 l
+桥归桥 4 n
+桥形 3 n
+桥拱 3 nz
+桥接 2 n
+桥接器 3 n
+桥本 131 n
+桥本龙 3 n
+桥本龙太郎 42 n
+桥板 13 n
+桥架 7 n
+桥栏 11 n
+桥栏杆 73 n
+桥桩 7 n
+桥梁 1751 n
+桥梁厂 7 n
+桥梁工事 3 n
+桥梁工程 3 n
+桥梓 3 n
+桥段 17 n
+桥殿飞虹 2 nr
+桥洞 49 n
+桥涵 12 n
+桥牌 105 n
+桥牌赛 9 n
+桥环体系 3 l
+桥瑁 3 n
+桥粒 3 n
+桥脚 3 n
+桥膝枕峰 3 v
+桥艺 3 n
+桥西 10 ns
+桥西区 2 ns
+桥费 3 n
+桥赛 3 n
+桥身 234 n
+桥轴 3 n
+桥边 54 s
+桥连基 3 nr
+桥长 3 n
+桥隧 6 n
+桥面 744 n
+桥顶 3 n
+桦 424 zg
+桦南 2 ns
+桦南县 3 ns
+桦叶 3 n
+桦川 4 ns
+桦川县 4 ns
+桦木 43 n
+桦林 8 nz
+桦树 61 n
+桦树皮 30 n
+桦树街 3 ns
+桦甸 10 ns
+桦甸县 3 ns
+桦甸市 2 ns
+桧 52 g
+桧仓郡 3 n
+桧木 3 n
+桧柏 7 n
+桨 517 n
+桨叉架船 3 n
+桨叶 31 n
+桨声 17 n
+桨手 3 n
+桨板 3 n
+桨架 3 n
+桨橹 3 n
+桨片 3 n
+桩 754 q
+桩体 3 n
+桩冠 3 n
+桩基 3 n
+桩基础 3 n
+桩头 3 n
+桩子 3 n
+桩帽 3 n
+桩木 3 n
+桩脚 3 n
+桫椤 26 n
+桫椤树 3 vn
+桯 2 zg
+桰 2 zg
+桱 4 zg
+桲 5 zg
+桴 29 g
+桴鼓相应 3 nz
+桵 56 zg
+桶 720 zg
+桶口 2 nrt
+桶子 3 nrt
+桶状 3 b
+桶狭间 3 vn
+桶盖 3 nrt
+桶装 5 b
+桶装水 3 b
+桷 11 g
+桸 5 zg
+桹 3 zg
+桺 12 zg
+桼 2 zg
+桽 2 zg
+桾 13 zg
+梁 2062 nr
+梁万俊 80 nr
+梁三州 2 nr
+梁三长老 6 nr
+梁上 7 nr
+梁上君子 5 nr
+梁上少女 2 nr
+梁上悬 3 nr
+梁上燕 2 nr
+梁上跳 4 nr
+梁下垂 3 nr
+梁与晋 2 nr
+梁丘氏 4 nr
+梁丘贺 2 nr
+梁丘赐 2 nr
+梁中书 129 nr
+梁丹妮 3 nr
+梁为仆 2 nr
+梁书 3 nr
+梁买茶 2 nr
+梁乾化 5 nr
+梁二人 4 nr
+梁二州 3 nr
+梁二长老 5 nr
+梁云构 6 nr
+梁亦清 163 nr
+梁从诫 4 i
+梁代刘 2 nr
+梁代陶 2 nr
+梁代顾 2 nr
+梁令瓒 10 nr
+梁任公 3 nr
+梁份 3 n
+梁伟棠 11 nrfg
+梁佩玲 3 nr
+梁保华 3 nr
+梁修治 3 nr
+梁元帝 33 nr
+梁兆明 4 nr
+梁先生 46 nr
+梁光烈 9 nr
+梁八景 2 nr
+梁六州 4 nr
+梁再平 2 nr
+梁军见 2 nr
+梁冠华 3 nr
+梁冰冰 2 nr
+梁冰玉 166 nr
+梁凤仪 3 nr
+梁凯蒂 3 nr
+梁刘勰 5 nr
+梁化凤 3 nr
+梁厚民 2 nr
+梁又封 3 nr
+梁同裕 3 nr
+梁君壁 7 nr
+梁启超 636 nr
+梁启雄 2 nr
+梁咏琪 3 nrfg
+梁唐晋 2 nr
+梁四人 3 nr
+梁四村 2 nr
+梁园 5 nr
+梁园区 3 ns
+梁园镇 2 nr
+梁国 14 ns
+梁国之 3 nr
+梁国正 2 nr
+梁城 8 ns
+梁城破 2 nr
+梁培炽 2 nr
+梁士诒 18 nr
+梁大同 5 nr
+梁大娘 7 nr
+梁大将 3 nr
+梁天来 3 nr
+梁天柱 54 nr
+梁天监 12 nr
+梁太仆 2 nr
+梁太后 11 nr
+梁太太 4 nr
+梁太济 15 nr
+梁太清 2 nr
+梁太监 2 nr
+梁太祖 10 nr
+梁妈妈 26 nr
+梁子湖 279 nr
+梁子湖区 256 ns
+梁子湖畔 3 nr
+梁子翁 236 nr
+梁孝宣 256 nr
+梁孝王 8 nr
+梁孟相敬 3 nr
+梁季阳 2 nr
+梁安僖 2 nr
+梁宝亮 2 nr
+梁实秋 13 nr
+梁宣帝 3 nr
+梁家 37 nrfg
+梁家仁 3 nr
+梁家俊 4 nr
+梁家楼 2 nr
+梁家渡 2 nr
+梁家辉 3 nr
+梁寒冰 4 nr
+梁封季 2 nr
+梁封钱 3 nr
+梁小冰 3 nr
+梁小姐 7 nr
+梁小武 3 nr
+梁小民 13 nr
+梁小琴 2 nr
+梁小青 2 nr
+梁小龙 3 nr
+梁尚贤 2 nr
+梁山 738 nr
+梁山伯 47 nr
+梁山县 10 ns
+梁山泊 3 nr
+梁州 25 ns
+梁师傅 3 nr
+梁师弟 3 nr
+梁师成 20 nr
+梁师爷 14 nr
+梁希仪 4 nr
+梁带村 2 nr
+梁平 2 nr
+梁平县 2 ns
+梁庆松 2 nr
+梁序昭 2 nr
+梁廷栋 13 nr
+梁廷芬 3 nr
+梁廷芳 3 nr
+梁建国 6 ns
+梁建增 2 nr
+梁建方 2 nr
+梁开平 19 nr
+梁弄镇 2 nr
+梁式引线 3 nr
+梁式桥 3 nr
+梁式楼梯 3 nr
+梁御史 2 nr
+梁德妍 2 nr
+梁必业 2 nr
+梁念丹 2 nr
+梁思成 144 nr
+梁思敏 3 nr
+梁思永 11 nr
+梁惠王 8 nr
+梁惠珍 14 nr
+梁慧星 2 nr
+梁懿刚 2 nr
+梁折柱 2 nr
+梁折瓦 2 nr
+梁振宇 3 nr
+梁振鹏 3 nr
+梁换柱 5 nr
+梁掌柜 7 nr
+梁掌门 5 nr
+梁政委 4 nr
+梁敏仪 3 nr
+梁敬帝 7 nr
+梁敬淳 2 nr
+梁文昌 25 nr
+梁文楠 2 nr
+梁方仲 10 nr
+梁方平 16 nr
+梁时赐 2 nr
+梁明时 7 nr
+梁春尽 2 nr
+梁昭明 6 nr
+梁晓华 3 nr
+梁晓声 11 nr
+梁晓天 2 nr
+梁晓峰 4 nr
+梁晓春 4 nr
+梁晓涛 2 nr
+梁晴喊 2 nr
+梁晴忙 4 nr
+梁晴抱 2 nr
+梁晴拉 2 nr
+梁晴梳 2 nr
+梁晴站 2 nr
+梁曙光 350 nr
+梁曙光刚 2 nr
+梁曙光转 2 nr
+梁月云 5 nr
+梁有誉 4 nr
+梁朝 26 nr
+梁朝伟 13 nr
+梁朝时 2 nr
+梁朝部 2 nr
+梁木 8 nr
+梁末侯 3 nr
+梁末帝 9 nr
+梁朱温 4 nr
+梁松窦 2 nr
+梁柱 160 nr
+梁栋材 2 nr
+梁树年 2 nr
+梁梁端 34 nr
+梁梦龙 16 nr
+梁植文 2 nr
+梁武帝 85 nr
+梁武陵 3 nr
+梁氏告 3 nr
+梁永大 2 nr
+梁永安 2 nr
+梁永强 5 nr
+梁汉文 3 nr
+梁汝堂 4 nr
+梁沟 5 ns
+梁沟村 2 nr
+梁河 10 ns
+梁河县 3 ns
+梁河境 2 nr
+梁波罗 3 nr
+梁洼镇 3 nr
+梁浩贤 3 nr
+梁海 17 ns
+梁清标 3 nr
+梁漱溟 41 nr
+梁爱诗 3 nr
+梁父吟 6 nr
+梁玉庆 5 nr
+梁王刘 2 nr
+梁王彭 3 nr
+梁画柱 5 nr
+梁皇寺 2 nr
+梁皇山 12 nr
+梁皇帝 2 nr
+梁石鱼 2 nr
+梁祝 26 nr
+梁窝状 2 nr
+梁简文 2 nr
+梁红玉 30 nr
+梁经理 4 nr
+梁经略 4 nr
+梁美京 3 ns
+梁美人 2 nr
+梁羽生 2 nr
+梁耀霖 2 nr
+梁老怪 6 nr
+梁老板 11 nr
+梁肃 2 ns
+梁自号 3 nr
+梁自进 20 nrfg
+梁芙蓉 4 nr
+梁若英 2 nr
+梁英奇 6 nr
+梁萧统 7 nr
+梁裕宁 2 nr
+梁诗正 3 nr
+梁诸州 3 nr
+梁贞明 13 nr
+梁赞 8 nr
+梁赞州 3 nr
+梁赞诺 3 nr
+梁赤民 2 nr
+梁超然 2 nr
+梁辰鱼 9 nr
+梁金堂 3 nr
+梁金泉 2 nr
+梁金雄 52 nr
+梁银龙 2 nr
+梁锦松 2 nr
+梁长老 91 nr
+梁门 3 ns
+梁陈间 2 nr
+梁陶弘 3 nr
+梁静茹 3 nr
+梁韵蕊 3 nr
+梁鸿志 4 nr
+梁黄河 2 nr
+梃 39 n
+梃击案 10 n
+梃子 3 n
+梅 1462 nr
+梅东益 2 nr
+梅丽尔 3 nr
+梅丽桑 12 nr
+梅丽莎 3 nr
+梅之思 2 nr
+梅之焕 8 nr
+梅乾菜 3 nr
+梅二军 7 nr
+梅亚林 2 nr
+梅亚纲 13 nr
+梅亦龙 2 nr
+梅什科 3 nrt
+梅伊曼 2 nr
+梅伦网 4 nr
+梅伦迪 23 nr
+梅兆荣 3 nr
+梅光迪 31 nr
+梅克伦堡 5 ns
+梅克伦堡州 2 ns
+梅克内斯 2 nrt
+梅克夫人 2 nrt
+梅克尔 11 nr
+梅克斯 3 nr
+梅克林格 3 nrt
+梅兰 2 nr
+梅兰日兰 3 nz
+梅兰竹 14 nr
+梅兰竹菊 3 nr
+梅兰芳 103 nr
+梅兰菊 10 nr
+梅关 2 ns
+梅养正 2 nr
+梅内 9 nrt
+梅内克 10 nr
+梅内塞 2 nr
+梅内姆 21 nr
+梅内斯 9 nr
+梅冠三 11 nr
+梅列区 3 ns
+梅列日科夫斯基 2 nrt
+梅利利 4 nr
+梅利埃 3 nr
+梅利基 2 nr
+梅利基扬 2 nr
+梅利尼科夫 3 nrt
+梅利特 2 nr
+梅利莎 33 nrt
+梅剑和 12 nr
+梅加拉 81 nr
+梅加瓦蒂 3 nrt
+梅勒章 8 nr
+梅卡瓦 32 nr
+梅县 48 ns
+梅因 6 n
+梅园 13 nr
+梅园新村 5 nr
+梅园路 3 nr
+梅圃溪 2 nr
+梅圣俞 4 nr
+梅地亚 4 ns
+梅坎博 2 nr
+梅坡村 3 ns
+梅城镇 3 nr
+梅塔斯 3 nr
+梅塔河 4 nr
+梅塞塔 7 nr
+梅塞德斯 18 nr
+梅塞施 8 nr
+梅多斯 2 nr
+梅大哥 4 nr
+梅奇克 2 nr
+梅契尼 9 nr
+梅女侠 15 nr
+梅女子 2 nr
+梅妻鹤子 3 n
+梅嫩德斯 2 nr
+梅嫩蕊 2 nr
+梅子 410 nr
+梅宁华 8 nr
+梅宁迪 4 nr
+梅安徒 16 nr
+梅家坞 20 ns
+梅小惠 3 nr
+梅尔克特 2 nrt
+梅尔卡 2 nr
+梅尔夫 2 nr
+梅尔夫人 2 nrt
+梅尔希 2 nr
+梅尔斯 3 nr
+梅尔泽 7 nr
+梅尔特 4 nr
+梅尔策 2 nr
+梅尔胜 6 nr
+梅尔色多 3 ns
+梅尔辛 4 nr
+梅尧臣 20 nr
+梅尼埃 6 nr
+梅尼格 3 nr
+梅屋 2 n
+梅山 27 nr
+梅山水库 4 nz
+梅山镇 3 nr
+梅岭山 3 nr
+梅州 36 ns
+梅州市 23 ns
+梅州日报 3 nz
+梅州网 3 nz
+梅州金柚 3 n
+梅巧玲 2 nr
+梅帅元 2 nr
+梅师伯 2 nr
+梅师姊 25 nr
+梅帮主 7 nr
+梅干菜 3 nr
+梅平原 2 ns
+梅庄中 8 nr
+梅开二度 3 nr
+梅开江 2 nr
+梅念笙 11 nr
+梅思平 3 nr
+梅拉 4 nrt
+梅拉伦湖 3 ns
+梅拉拉 14 nr
+梅拉腊 6 ns
+梅敏仪 3 nr
+梅文馨 12 nr
+梅文鼎 19 nr
+梅斯 19 nr
+梅斯基 2 nr
+梅斯托 3 nr
+梅斯蒂 4 nr
+梅新育 257 nr
+梅明根 2 nr
+梅曾亮 4 nr
+梅朗中 12 nr
+梅杜萨 3 nr
+梅林 383 nr
+梅林变换 3 nr
+梅林路 3 nr
+梅林达 3 nr
+梅树 47 nr
+梅树姿 2 nr
+梅树村 5 nr
+梅核气 6 n
+梅格纳 2 nr
+梅梅似 2 nr
+梅梅依然 2 nr
+梅梅划 2 nr
+梅梅尔 3 nr
+梅梅止 2 nr
+梅梅正 2 nr
+梅森 10 nr
+梅森数 2 nr
+梅毒 151 n
+梅氏 10 nr
+梅氏犀 2 nr
+梅永红 2 nr
+梅江 23 nr
+梅江区 3 ns
+梅江河 2 nr
+梅江镇 2 nr
+梅沟营 4 nr
+梅河口 8 ns
+梅河口市 5 ns
+梅洛 20 nr
+梅津美 136 nr
+梅派 16 nr
+梅济耶 3 nr
+梅涅斯 3 nr
+梅港 3 ns
+梅特勒 3 nr
+梅特卡夫 5 nrt
+梅特林 10 nr
+梅特涅 12 nr
+梅特罗 2 nr
+梅狄儿 3 nr
+梅献珍 34 nr
+梅琳克 2 nr
+梅瑞狄 2 nr
+梅甘娜 3 nr
+梅百器 2 nr
+梅百玉 2 nr
+梅益论 2 n
+梅窗院 3 nr
+梅童鱼 3 nr
+梅竹图 3 nr
+梅索沃 3 nr
+梅纳德 2 nr
+梅纳特 2 nr
+梅纽因 10 nr
+梅翰林 4 nr
+梅耶尔 3 nr
+梅耶荷 14 nr
+梅良鸣 4 nr
+梅艳芳 5 nr
+梅花 959 nr
+梅花三弄 3 ns
+梅花奖 19 nz
+梅花山 18 nr
+梅花拳 11 nr
+梅花桩 25 nr
+梅花节 3 nr
+梅花诗 3 nr
+梅花针 3 nr
+梅花餐 3 n
+梅花香 3 nr
+梅花鹿 94 nr
+梅芳姑 31 nr
+梅苏 3 ns
+梅苏拉 2 nr
+梅若华 4 nr
+梅茨 5 nrt
+梅莱拉 5 nr
+梅莱斯 3 nr
+梅萨维 3 nr
+梅葆玖 2 nr
+梅蒂卡尔 3 nrt
+梅蕴新 2 nr
+梅西亚 9 ns
+梅西昂 3 nr
+梅西村 2 nr
+梅西格 2 nr
+梅西纳 80 nr
+梅西耶 4 nr
+梅诺卡 3 nr
+梅诺蒂 3 nr
+梅贝尔 3 nr
+梅贻琦 6 nr
+梅赛德 7 nr
+梅赛德斯 3 nrt
+梅赫伦 2 nr
+梅赫曼 17 nr
+梅超风 455 nr
+梅辉立 2 nr
+梅迪契 2 nr
+梅迪纳 2 nr
+梅迪西 2 nr
+梅里 33 nrt
+梅里威 2 nr
+梅里爱 3 nr
+梅里特 9 nr
+梅里纳 12 nr
+梅里美 4 nr
+梅里达 13 nr
+梅里雪山 6 nr
+梅阡 2 nrfg
+梅陇站 2 nr
+梅陇路 2 nr
+梅隆国民 2 nr
+梅雨 109 nr
+梅雨季 3 nr
+梅雨季节 3 nr
+梅雨期 265 nr
+梅雨潭 3 nr
+梅雪争 7 nr
+梅雪逢 5 nr
+梅顺才 2 nr
+梅饰 2 n
+梅香帮 2 nr
+梅香菊 2 nr
+梅鲁山 2 nr
+梅鲁洛 2 nr
+梅龙镇 3 nr
+梆 103 n
+梆子 143 n
+梆子腔 29 n
+梆敌 3 n
+梆梆 3 z
+梆梆响 3 n
+梆硬 5 z
+梆铃 3 n
+梇 6 zg
+梈 6 zg
+梉 6 zg
+梊 3 zg
+梌 21 zg
+梍 847 zg
+梎 2 zg
+梏 4 g
+梑 10 zg
+梓 448 nrt
+梓匠 3 n
+梓官 3 n
+梓树 259 nrt
+梓潼 20 nrt
+梓潼县 5 ns
+梓里 2 nrt
+梕 48 zg
+梖 36 zg
+梗 575 v
+梗住 3 v
+梗到 3 v
+梗化 3 v
+梗塞 43 v
+梗概 41 n
+梗死 34 v
+梗泛萍漂 3 nr
+梗泛萍飘 3 z
+梗直 4 v
+梗着 3 v
+梗节 3 n
+梗迹萍踪 3 vn
+梗通草 3 n
+梗阻 115 v
+梗阻性 5 n
+梗顽不化 3 n
+梘 17 zg
+梙 2 zg
+梜 2 zg
+條 2 zg
+梠 2 zg
+梡 9 zg
+梢 1059 ng
+梢公 59 n
+梢头 22 n
+梢子 24 n
+梢枝 3 n
+梢门 3 n
+梣 7 zg
+梤 4 zg
+梦 3719 n
+梦中人 22 nr
+梦中见 3 nr
+梦中说梦 3 i
+梦之翼 3 i
+梦之队 31 i
+梦乡 61 n
+梦作坊 3 n
+梦兆 2 nz
+梦剧场 2 n
+梦华 18 nz
+梦呓 23 n
+梦呓者 3 r
+梦回 3 v
+梦园 3 n
+梦境 243 n
+梦姑 105 n
+梦娃娃 3 nr
+梦寐 20 v
+梦寐以求 124 i
+梦寐萦怀 3 z
+梦寐难忘 3 i
+梦工厂 3 n
+梦工场 3 n
+梦幻 227 n
+梦幻仙境 3 n
+梦幻体 3 n
+梦幻天使 3 i
+梦幻岛 3 nr
+梦幻泡影 8 i
+梦幻组合 3 l
+梦幻般 3 i
+梦幻论坛 3 n
+梦得 6 v
+梦态 3 n
+梦想 1194 n
+梦想家 3 l
+梦想成真 11 i
+梦想破灭 3 i
+梦想颠倒 3 i
+梦撒寮丁 3 v
+梦撒撩丁 3 v
+梦断魂劳 3 i
+梦梦 3 nz
+梦欢 3 v
+梦江南 3 nr
+梦游 68 n
+梦游症 9 n
+梦游美国 3 n
+梦游者 3 n
+梦溪笔谈 53 nz
+梦熊之喜 3 i
+梦牵魂绕 7 i
+梦特娇 3 nr
+梦献 3 n
+梦码 3 n
+梦笔生花 3 nz
+梦粱 3 n
+梦精记 3 nr
+梦美 3 nz
+梦蝶 3 n
+梦行症 3 n
+梦行者 3 n
+梦见 367 v
+梦见周公 3 nr
+梦言梦语 3 i
+梦话 35 n
+梦语 2 nz
+梦象 2 n
+梦过 3 v
+梦遗 4 n
+梦醒 9 v
+梦里南轲 3 nr
+梦露 18 v
+梦飞船 3 nr
+梦魂颠倒 3 i
+梦魇 60 n
+梦魔 11 n
+梦鸽 256 n
+梧 94 zg
+梧凤之鸣 3 n
+梧州 90 ns
+梧州市 38 ns
+梧栖 3 ns
+梧栖港 3 ns
+梧桐 103 n
+梧桐叶 3 n
+梧桐子 6 n
+梧桐山 3 ns
+梧桐断角 3 ns
+梧桐树 64 n
+梧桐镇 2 ns
+梧桐雨 3 n
+梧鼠之技 3 n
+梧鼠五技 3 n
+梧鼠技穷 3 n
+梨 1110 n
+梨乾 3 ns
+梨园 85 n
+梨园子弟 2 n
+梨园屯 3 ns
+梨园弟子 3 n
+梨园戏 4 n
+梨园春 3 ns
+梨园蚧 3 n
+梨子 33 n
+梨山 7 ns
+梨山宾馆 3 ns
+梨形 3 n
+梨木 24 n
+梨果 3 n
+梨枣 2 n
+梨树 43 n
+梨树区 3 ns
+梨树县 5 ns
+梨汁 5 n
+梨涡 4 n
+梨狗 3 n
+梨眉艾发 3 i
+梨膏 3 n
+梨花 123 n
+梨花大鼓 3 i
+梨花带雨 6 i
+梨花枪 3 n
+梨酒 3 n
+梨颊微涡 3 n
+梩 71 zg
+梪 3 zg
+梫 2 zg
+梭 532 n
+梭哈 3 nrt
+梭天摸地 3 nz
+梭子 73 n
+梭子蟹 38 n
+梭子鱼 59 n
+梭巡 3 nz
+梭曼 3 nrt
+梭标 6 n
+梭梭 32 nrt
+梭梭林 3 n
+梭织 21 n
+梭织机 6 n
+梭罗 24 nrt
+梭罗树 2 nrt
+梭罗河 3 ns
+梭落坪村 2 ns
+梭镖 40 n
+梭鱼 17 n
+梭鱼类 3 n
+梮 19 zg
+梯 710 n
+梯也尔 24 nr
+梯云 8 n
+梯型网络 3 n
+梯子 267 n
+梯山架壑 3 n
+梯山栈谷 3 v
+梯山航海 3 n
+梯度 276 n
+梯度寻优 3 nr
+梯度方向 3 n
+梯形 84 n
+梯形图 3 n
+梯形波 3 n
+梯形钳 3 n
+梯思梯 3 nr
+梯恩梯 48 nr
+梯愚入圣 3 nr
+梯架 3 n
+梯格图 3 nr
+梯次 27 n
+梯段 3 n
+梯河 3 n
+梯状 3 n
+梯田 132 n
+梯田农业 3 n
+梯矩阵 3 nr
+梯级 107 n
+梯级开发 3 n
+梯绳 3 n
+梯队 106 n
+梯队式 3 n
+梯阶 6 n
+械 776 v
+械器 3 v
+械弹 3 v
+械斗 31 vn
+械材 3 v
+梲 11 zg
+梳 496 v
+梳云掠月 3 i
+梳匣 3 n
+梳发 3 v
+梳头 169 v
+梳头发 3 i
+梳妆 75 v
+梳妆台 57 n
+梳妆打扮 19 i
+梳妆盒 3 n
+梳妆镜 5 n
+梳子 85 n
+梳成 3 v
+梳拢 3 v
+梳文栉字 3 i
+梳棉 7 n
+梳棉机 4 n
+梳毛机 2 n
+梳洗 171 v
+梳洗打扮 3 i
+梳理 255 v
+梳理机 3 n
+梳着 3 v
+梳篦 10 n
+梳起 3 v
+梳起来 3 v
+梳辫子 4 n
+梳过 3 v
+梳过去 3 v
+梳过来 3 v
+梳齿 5 n
+梴 105 zg
+梵 245 nz
+梵册贝叶 3 n
+梵净山 27 nz
+梵刹 3 nrt
+梵呗 8 o
+梵哑铃 3 n
+梵唱 3 n
+梵地冈 3 ns
+梵天 28 nz
+梵学 3 nz
+梵宇 3 nz
+梵宫 2 ns
+梵思诺 3 nz
+梵文 194 nz
+梵蒂冈 118 ns
+梵蒂冈城 3 ns
+梵蒂冈教廷 2 ns
+梵语 128 nz
+梵谛冈 3 nz
+梵谷 3 ns
+梵音 3 nz
+梵高 36 nz
+梶 24 zg
+梷 41 zg
+梺 40 zg
+梼 3 zg
+梽 55 zg
+梽木山 3 nz
+梾 163 zg
+梿 17 zg
+检 651 vn
+检举 416 v
+检举人 4 n
+检举信 6 n
+检举箱 3 n
+检修 119 vn
+检修孔 3 n
+检偏器 3 n
+检出 77 v
+检出率 19 n
+检出限 3 n
+检务 3 vn
+检印 3 v
+检发 3 v
+检场 13 n
+检字 3 n
+检字法 6 vn
+检字表 2 n
+检定 17 v
+检定所 3 n
+检定考试 3 n
+检察 2542 vn
+检察业务 3 n
+检察事业 3 n
+检察人员 3 n
+检察信息 3 n
+检察厅 14 n
+检察员 263 n
+检察处 3 n
+检察官 180 n
+检察官法 3 n
+检察室 2 n
+检察局 4 n
+检察工作 3 n
+检察干警 3 n
+检察干部 3 n
+检察机关 3 n
+检察法 3 n
+检察系统 3 n
+检察署 9 n
+检察调研 3 n
+检察长 4735 n
+检察队伍 3 n
+检察院 7469 n
+检录 4 v
+检拾 3 v
+检控 5 vn
+检控官 5 n
+检收 3 v
+检方 12 n
+检束 3 vn
+检查 5464 vn
+检查一下 3 n
+检查井 3 n
+检查人员 3 n
+检查仪 5 n
+检查单 10 n
+检查员 21 n
+检查和 110 n
+检查哨 4 n
+检查团 34 n
+检查官 12 n
+检查室 7 n
+检查报告 2 n
+检查指导 3 n
+检查教学 3 n
+检查教育 3 n
+检查数据 2 n
+检查样片 3 n
+检查法 34 n
+检查点 5 n
+检查片 3 n
+检查用户 4 n
+检查督促 3 n
+检查程序 5 n
+检查站 41 n
+检查组 66 n
+检查署 3 n
+检查者 16 n
+检查表 4 n
+检查费 7 n
+检查部 7 n
+检核 3 vn
+检正 3 v
+检波 15 n
+检波器 21 n
+检流器 3 n
+检流计 4 n
+检测 1423 vn
+检测仪 8 n
+检测仪表 3 n
+检测值 2 n
+检测器 58 n
+检测工具 3 n
+检测时间 2 n
+检测法 11 n
+检测点 2 n
+检测站 5 n
+检测线 3 n
+检测费 4 n
+检测车 2 n
+检漏 3 v
+检漏仪 3 n
+检点 99 n
+检玻器 3 n
+检电器 3 n
+检疫 210 vn
+检疫员 3 n
+检疫局 18 n
+检疫所 3 n
+检疫站 6 n
+检相 3 n
+检相器 3 n
+检票 19 n
+检票口 2 n
+检票员 3 n
+检索 247 vn
+检索服务 2 n
+检索系统 3 n
+检肃 3 v
+检胃镜 3 n
+检覆 3 v
+检视 73 v
+检讨 290 v
+检讨书 5 n
+检讨会 9 n
+检证 2 vn
+检错 4 v
+检错码 3 n
+检阅 372 v
+检阅台 11 n
+检附 3 v
+检验 1590 vn
+检验位 3 n
+检验关 3 n
+检验函数 3 n
+检验单 5 n
+检验台 2 n
+检验号码 3 n
+检验员 13 n
+检验图 3 n
+检验字母 3 n
+检验室 4 n
+检验局 3 n
+检验所 10 n
+检验机 3 n
+检验法 15 n
+检验电路 3 n
+检验码 3 n
+检验科 11 n
+检验站 3 n
+检验能力 3 n
+检验证 3 n
+检验证书 3 n
+检验费 2 n
+棁 32 zg
+棂 467 g
+棄 3 zg
+棅 6 zg
+棆 14 zg
+棇 12 zg
+棉 1749 n
+棉丝 3 n
+棉产区 8 n
+棉价 10 n
+棉兰 9 ns
+棉兰老 6 n
+棉兰老岛 24 ns
+棉农 7 nz
+棉制 7 n
+棉制品 5 n
+棉区 3 n
+棉华 3 nz
+棉卷 3 n
+棉卷口炎 3 n
+棉厂 3 n
+棉叶蝉 3 n
+棉垫 5 n
+棉堆 3 n
+棉外套 3 n
+棉大衣 32 nz
+棉套 9 n
+棉婚 3 n
+棉子油 3 n
+棉布 206 n
+棉布城 3 ns
+棉帐篷 4 n
+棉帽 11 n
+棉服 2 n
+棉条 2 n
+棉桃 5 n
+棉毛 10 n
+棉毛衣 3 n
+棉毛衫 4 n
+棉毛裤 6 n
+棉毯 4 n
+棉珠 3 n
+棉球 17 n
+棉田 65 n
+棉的确良 3 n
+棉皮鞋 3 n
+棉短绒 3 n
+棉秆 5 n
+棉种 10 n
+棉签 15 n
+棉籽 19 n
+棉籽壳 8 n
+棉籽油 13 n
+棉籽饼 3 n
+棉絮 97 n
+棉红蜘蛛 3 n
+棉红铃虫 2 n
+棉纤维 27 n
+棉纱 348 n
+棉纱锭 2 n
+棉纸 15 n
+棉纺 345 b
+棉纺业 21 n
+棉纺厂 24 n
+棉纺织 609 n
+棉纺织业 94 n
+棉纺织厂 34 n
+棉纺织品 3 n
+棉纺锭 5 nz
+棉线 22 n
+棉织 46 n
+棉织业 3 n
+棉织厂 8 n
+棉织品 57 n
+棉织物 21 n
+棉绒 8 n
+棉羊 3 n
+棉胎 3 n
+棉花 3619 n
+棉花价格 3 n
+棉花包 12 n
+棉花团 3 n
+棉花套子 3 n
+棉花子 3 n
+棉花布 3 n
+棉花根 3 nz
+棉花火药 3 n
+棉花球 3 n
+棉花田 3 n
+棉花胎 2 n
+棉薄之力 3 nz
+棉蚜 7 n
+棉衣 234 n
+棉衣裤 3 n
+棉袄 245 n
+棉袍 41 n
+棉袍子 2 n
+棉被 172 n
+棉被套 3 v
+棉被褥 2 nz
+棉裤 69 n
+棉褥 2 n
+棉质 4 n
+棉贩子 2 n
+棉铃 4 n
+棉铃虫 15 n
+棉鞋 42 n
+棉麻 12 n
+棊 3 zg
+棋 1181 n
+棋力 3 n
+棋友 7 n
+棋后 9 n
+棋品 3 n
+棋圣 30 ns
+棋圣战 3 n
+棋坛 13 n
+棋坛新秀 3 i
+棋士 3 n
+棋子 334 n
+棋室 3 n
+棋局 159 n
+棋布 13 n
+棋布星罗 3 ns
+棋布星陈 3 n
+棋布错峙 3 ns
+棋师 3 n
+棋战 3 n
+棋手 325 n
+棋术 3 n
+棋灵王 3 n
+棋牌 36 n
+棋牌乐 3 n
+棋牌室 12 n
+棋牌类 3 n
+棋王 15 n
+棋王战 8 n
+棋王赛 12 n
+棋瘾 3 n
+棋盘 2090 n
+棋盘坨 14 ns
+棋盘山 5 n
+棋盘式 3 n
+棋盘形 3 n
+棋社 3 n
+棋类 30 n
+棋联 14 ns
+棋艺 52 n
+棋苑 3 n
+棋论 3 n
+棋谱 15 n
+棋赛 3 n
+棋路 14 n
+棋输先着 3 n
+棋输先著 3 n
+棋迷 16 n
+棋逢对手 12 i
+棋逢敌手 5 i
+棋道 3 n
+棋锋 2 n
+棋错一着 2 i
+棋院 36 n
+棋风 3 n
+棋高一着 3 i
+棋魂 3 n
+棌 28 zg
+棍 1180 zg
+棍儿 43 n
+棍儿茶 3 n
+棍子 444 n
+棍徒 3 n
+棍术 5 n
+棍棒 316 n
+棍棒教育 3 n
+棍球 3 n
+棍道 3 n
+棏 2 zg
+棐 17 zg
+棑 3 zg
+棒 2439 zg
+棒儿香 3 n
+棒冰 13 n
+棒呆 3 z
+棒喝 10 v
+棒坛 3 n
+棒头 31 n
+棒委会 3 n
+棒子 90 n
+棒子面 2 n
+棒子面粥 4 n
+棒打 3 n
+棒打鸳鸯 6 n
+棒控制 2 n
+棒操 3 n
+棒料 3 n
+棒曲霉素 3 n
+棒杀 8 v
+棒材 15 n
+棒极了 3 n
+棒棒 3 n
+棒棒糖 6 n
+棒棒鸡 3 n
+棒棰 2 n
+棒槌 76 n
+棒法 3 n
+棒状 77 n
+棒球 77 n
+棒球员 3 n
+棒球场 4 n
+棒球帽 3 n
+棒球棒 3 n
+棒球赛 3 n
+棒球队 15 n
+棒疮 11 n
+棒硬 2 z
+棒磨机 3 n
+棒针 23 n
+棒针衫 3 n
+棓 23 zg
+棔 38 zg
+棕 447 n
+棕丝 3 n
+棕刚玉 3 n
+棕刷 3 n
+棕叶 3 n
+棕壤 3 n
+棕壳蛋 3 n
+棕树 5 n
+棕榄 2 n
+棕榈 154 n
+棕榈园 3 n
+棕榈岛 4 ns
+棕榈林 3 n
+棕榈树 23 n
+棕榈油 24 n
+棕榈泉 3 n
+棕榈科 21 n
+棕毛 8 n
+棕毯 3 n
+棕油 36 n
+棕漠土 3 n
+棕熊 22 n
+棕竹 3 n
+棕箱 5 n
+棕红 12 b
+棕红色 38 n
+棕绳 2 n
+棕绷 3 n
+棕编 2 n
+棕色 341 n
+棕衣 3 n
+棕钙土 3 n
+棕黄 23 b
+棕黄色 294 n
+棕黑 31 ns
+棖 5 zg
+棗 84 zg
+棘 500 ng
+棘刺 40 n
+棘地荆天 3 n
+棘手 291 n
+棘爪 6 n
+棘皮 2 n
+棘皮动物 40 l
+棘突 20 n
+棘轮 8 n
+棘霉素 3 n
+棙 21 zg
+棚 768 n
+棚代客 3 n
+棚代客车 2 n
+棚内 11 s
+棚圈 7 n
+棚外 14 s
+棚子 104 n
+棚屋 22 n
+棚布 3 n
+棚户 15 n
+棚户区 13 n
+棚架 9 n
+棚舍 2 n
+棚菜 3 n
+棚车 2 n
+棚里 290 s
+棚铺 3 n
+棚顶 8 n
+棛 3 zg
+棜 10 zg
+棝 50 zg
+棠 271 n
+棠梨 3 n
+棠棣 7 ns
+棠湖 14 ns
+棡 3 zg
+棣 3115 n
+棣棠 2 n
+棤 341 zg
+棥 6 zg
+棦 68 zg
+棧 6 zg
+棨 12 zg
+棩 330 zg
+棪 11 zg
+棫 22 zg
+棬 102 zg
+棭 61 zg
+森 742 n
+森严 373 n
+森严壁垒 2 nr
+森克虏 2 nr
+森冈 3 nrt
+森博格 3 nr
+森吉米尔 4 nrt
+森喜 2 n
+森喜郎 2 nr
+森尼维尔 3 nrt
+森山 9 n
+森岛 4 n
+森川 3 n
+森工 551 n
+森巴旺 2 nr
+森巴迪 3 nr
+森布罗 4 nr
+森彼得 2 nr
+森房吉 3 nr
+森斯坦 12 nr
+森普尔 5 nr
+森木塞姆 2 nr
+森本薰 4 nr
+森村诚 6 nr
+森林 5024 n
+森林上限 3 n
+森林保护 3 nr
+森林公园 3 n
+森林区 24 n
+森林土壤 3 n
+森林地带 3 j
+森林学 5 n
+森林学系 3 n
+森林工业 3 n
+森林抚育 3 nr
+森林更新 3 nr
+森林气候 3 n
+森林法 12 nr
+森林浴 3 nr
+森林狼 3 nr
+森林狼队 3 n
+森林王国 8 nr
+森林经理 3 n
+森林草原 3 n
+森林资源 3 n
+森格尔 4 nr
+森格藏 8 nr
+森梅尔 2 nr
+森森 13 nr
+森森凉 2 nr
+森森鬼 4 nr
+森森黄 2 nr
+森沉 3 a
+森海塞尔 3 nr
+森然 105 z
+森田疗法 3 n
+森科 7 n
+森纳尔 2 nr
+森纳赫 12 nr
+森罗万象 3 nr
+森罗宝 3 nr
+森罗殿 21 nr
+森美 3 a
+森美兰 3 nr
+森警 6 n
+森那美 2 nr
+森郁 3 a
+森隆弘 8 nr
+森鸥外 3 nr
+棯 21 zg
+棰 595 v
+棱 905 ng
+棱儿 3 n
+棱台 2 n
+棱形 296 n
+棱柱 6 n
+棱柱体 3 n
+棱棱睁睁 3 i
+棱椎 3 n
+棱线 6 n
+棱缝 3 n
+棱角 83 nz
+棱角分明 18 n
+棱锥 14 nz
+棱锥台 3 n
+棱镜 80 nz
+棲 2 zg
+棳 4 zg
+棴 11 zg
+棵 826 q
+棵儿 2 n
+棵子 15 n
+棶 314 zg
+棷 5 zg
+棸 3 zg
+棹 68 g
+棺 1824 n
+棺木 278 n
+棺材 1593 n
+棺材子 3 n
+棺材店 2 n
+棺材板 3 n
+棺材瓤子 6 n
+棺板 3 n
+棺柩 3 n
+棺椁 351 n
+棺盖 3 n
+棺罩 3 n
+棻 36 zg
+棼 5 zg
+棽 13 zg
+棿 164 zg
+椀 5 zg
+椁 421 g
+椂 544 zg
+椃 23 zg
+椄 2 zg
+椅 791 ng
+椅凳 2 n
+椅垫 12 n
+椅套 4 n
+椅子 1509 n
+椅披 8 n
+椅背 137 n
+椆 37 zg
+椇 12 zg
+椈 191 zg
+椊 2 zg
+椋 414 x
+椋鸟 10 n
+植 560 n
+植丛 2 n
+植保 27 nr
+植保站 3 n
+植党自私 3 n
+植党营私 3 n
+植入 114 n
+植入体 2 n
+植入式 6 n
+植入性 2 n
+植入术 5 n
+植入物 3 n
+植原敬之 3 nr
+植发冲冠 3 n
+植发穿冠 3 n
+植善倾恶 3 n
+植木 5 n
+植木枝 2 nr
+植村秀 3 nr
+植柳 2 n
+植树 379 n
+植树日 3 n
+植树节 11 n
+植树造林 45 n
+植株 481 n
+植根 27 n
+植根于 31 l
+植桃柳 2 n
+植桑 2 n
+植桑养 2 n
+植棉 64 n
+植榆柳 2 nr
+植物 7735 n
+植物体 258 n
+植物保护 11 n
+植物区系 3 n
+植物园 174 n
+植物图片 3 n
+植物学 129 n
+植物学家 70 n
+植物引种 3 n
+植物性 3 n
+植物性神经 13 l
+植物所 24 n
+植物检疫 3 n
+植物毒素 3 n
+植物油 104 n
+植物界 3 n
+植物病害 3 n
+植物病理 3 n
+植物神经 3 n
+植物种 19 n
+植物种子 3 n
+植物纤维 34 l
+植物群落 39 l
+植物药 52 n
+植物蛋白 3 l
+植物配植 3 nr
+植皮 10 n
+植胶 7 n
+植花木 4 n
+植苗 23 n
+植茶 2 n
+植茶公 2 nr
+植草 3 n
+植被 1357 n
+植被型 3 nr
+植被指数 3 nr
+植被状况 3 nr
+植醇 2 n
+植食 3 n
+植食性 3 n
+椎 437 n
+椎体 45 n
+椎动脉 3 n
+椎埋屠狗 3 n
+椎埋狗窃 3 n
+椎天抢地 3 n
+椎布 3 n
+椎度 3 n
+椎弓 3 n
+椎心呕血 3 vn
+椎心泣血 3 n
+椎心顿足 3 n
+椎心饮泣 3 n
+椎打 3 n
+椎牛发冢 3 n
+椎牛歃血 3 vn
+椎牛飨士 3 v
+椎管 25 n
+椎肤剥体 3 vn
+椎肤剥髓 3 v
+椎胸跌足 3 n
+椎胸顿足 3 n
+椎膺顿足 3 nt
+椎车 3 n
+椎轮 3 n
+椎锋陷阵 3 n
+椎锋陷陈 3 n
+椎间盘 63 n
+椎间隙 3 n
+椎骨 37 n
+椎髻 3 n
+椎髻布衣 3 nz
+椎鼓 3 n
+椐 21 g
+椒 870 ng
+椒料 3 n
+椒江 17 ns
+椒江区 5 ns
+椒江县 3 ns
+椒江市 5 ns
+椒焚桂折 3 v
+椒盐 11 n
+椓 17 zg
+椔 3 zg
+椖 2 zg
+椗 2 zg
+椙 3 zg
+椚 4 zg
+椛 3 zg
+検 3 zg
+椝 2 zg
+椞 3 zg
+椟 141 zg
+椡 2 zg
+椤 363 x
+椥 2 zg
+椦 11 zg
+椧 2 zg
+椩 4 zg
+椫 2 zg
+椭 104 n
+椭偏仪法 3 n
+椭圆 323 n
+椭圆体 3 n
+椭圆偏振 3 n
+椭圆函数 3 n
+椭圆型 3 n
+椭圆型域 3 n
+椭圆形 483 n
+椭圆极化 3 n
+椭圆柱 3 n
+椭圆波导 3 n
+椭圆状 16 n
+椭圆球 3 n
+椭圆锥 3 n
+椭圆面 3 n
+椭球 96 n
+椭球面 3 n
+椭面 3 n
+椯 7 zg
+椰 68 n
+椰城 3 n
+椰奶 3 n
+椰子 282 n
+椰子壳 3 n
+椰子树 50 n
+椰子汁 4 n
+椰子油 5 n
+椰子类 3 n
+椰岛 60 n
+椰干 59 n
+椰林 22 n
+椰林湾 34 ns
+椰果 2 n
+椰枣 62 n
+椰树 26 n
+椰汁 7 n
+椰油 26 n
+椰瓢 3 n
+椰肉 7 n
+椰胡 6 n
+椰菜 3 n
+椰蓉 3 n
+椰雕 6 n
+椰风 3 n
+椰风寨 3 n
+椴 81 n
+椴属 3 n
+椴木 3 n
+椴树 30 n
+椸 3 zg
+椹 277 x
+椹果 3 nz
+椺 2 zg
+椻 20 zg
+椼 75 zg
+椽 98 zg
+椽子 39 n
+椾 391 zg
+椿 234 g
+椿庭萱室 3 v
+椿树 31 n
+椿皮 3 n
+椿萱 6 n
+椿萱并茂 3 nr
+楀 571 zg
+楁 483 zg
+楂 365 x
+楃 272 zg
+楄 241 zg
+楅 128 zg
+楆 3 zg
+楇 2 zg
+楊 4 zg
+楋 227 zg
+楏 2 zg
+楐 4 zg
+楒 4 zg
+楔 92 n
+楔住 3 l
+楔入 3 n
+楔子 38 n
+楔形 69 n
+楔形文字 82 l
+楔焊 3 n
+楔状相 3 l
+楔状绿地 3 l
+楔状缺损 3 l
+楔状隙 3 n
+楖 9 zg
+楗 127 g
+楘 36 zg
+楙 67 zg
+楚 4713 nr
+楚争容 2 nr
+楚云湘雨 3 nr
+楚云飞 3 nr
+楚亚 2 ns
+楚亲晋 2 nr
+楚令尹 2 nr
+楚伐吴 2 nr
+楚伐陆 2 nr
+楚保平 2 nr
+楚倾襄 2 nr
+楚健萨 2 nr
+楚元王 2 nr
+楚克迈 2 nr
+楚共王 2 nr
+楚军战 2 nr
+楚军渡 3 nr
+楚军营 3 nr
+楚军见 2 nr
+楚剧 3 n
+楚势益 2 nr
+楚南 2 ns
+楚呼楚 2 nr
+楚和晋 2 nr
+楚器 2 n
+楚囊之情 3 i
+楚囚 3 n
+楚囚对泣 3 n
+楚囚相对 3 n
+楚国 437 ns
+楚图南 7 nr
+楚地居 81 nr
+楚城 2 ns
+楚墓 29 n
+楚大刀 3 nr
+楚天云雨 3 nr
+楚天舒 2 nr
+楚天金 25 nr
+楚天钟 2 nr
+楚威王 8 nr
+楚宗人 2 nr
+楚将庄 2 nr
+楚州 39 ns
+楚州区 3 ns
+楚州南 5 ns
+楚州山 2 ns
+楚布寺 2 nr
+楚平王 4 nr
+楚幽王 2 nr
+楚庄王 281 nr
+楚康王 2 nr
+楚弓复得 3 i
+楚弓楚得 3 nr
+楚弓遗影 3 i
+楚归晋 2 nr
+楚归汉 7 nr
+楚彦威 3 nr
+楚得复 3 nr
+楚得楚弓 3 nr
+楚德拉 2 nr
+楚德湖 2 nr
+楚怀王 53 nr
+楚恭王 2 nr
+楚恭王子 2 nr
+楚悼王 10 nr
+楚惠王 4 nr
+楚成王 13 nr
+楚才晋用 3 nr
+楚投汉 4 nr
+楚拔郢 2 nr
+楚攻秦 3 nr
+楚文化 295 nr
+楚文王 11 nr
+楚明玉 13 nr
+楚春申 8 nr
+楚昭王 8 nr
+楚暖暖 19 nr
+楚有兵 2 nr
+楚材世 3 nr
+楚材公 2 nr
+楚材晋用 2 nr
+楚材祠 2 nr
+楚格峰 2 nr
+楚梅布 4 nr
+楚梦云雨 3 nr
+楚棺秦楼 3 nr
+楚楚 146 nr
+楚楚不凡 3 nr
+楚楚作态 3 i
+楚楚动人 39 i
+楚楚可人 3 nr
+楚楚可怜 46 nr
+楚楚可爱 3 nr
+楚楚可观 3 nr
+楚楚有致 3 nr
+楚楚谡谡 3 nr
+楚楚静立 3 nr
+楚歌 18 nr
+楚歌之计 3 i
+楚歌四合 3 nr
+楚歌四起 3 nr
+楚歌四面 3 i
+楚武王 5 nr
+楚水吴山 3 nr
+楚汉之争 2 nr
+楚汉争 3 nr
+楚汉便 2 nr
+楚汉成 2 nr
+楚汉相争 18 nr
+楚江 3 ns
+楚江亭 2 nr
+楚江情 2 nr
+楚河 15 ns
+楚河汉界 4 ns
+楚浦 2 ns
+楚源牌 256 nr
+楚滨 11 ns
+楚灵王 9 nr
+楚王 505 nr
+楚王陵 4 nr
+楚玛尔 8 nr
+楚璧隋珍 3 nz
+楚瓦什 3 nr
+楚界汉河 3 nz
+楚留香 5 nr
+楚盟 5 ns
+楚相孙 3 nr
+楚相春 2 nr
+楚科奇 19 nr
+楚穆王 4 nr
+楚管蛮弦 3 n
+楚米扬 5 nr
+楚纪南 256 nr
+楚考烈 8 nr
+楚腰卫鬓 3 n
+楚腰纤细 3 n
+楚腰蛴领 3 v
+楚舞吴歌 3 nr
+楚襄王 2 nr
+楚语支 2 nr
+楚越之急 3 i
+楚辞 139 nr
+楚长城 56 nr
+楚长顺 11 nr
+楚雁潮 530 nr
+楚雄 33 nr
+楚雄州 3 nr
+楚雄市 6 ns
+楚雄彝族自治州 11 ns
+楚雨巫云 3 nr
+楚雨连 2 nr
+楚霸王 46 nr
+楚顷襄 10 nr
+楚风馆 4 nr
+楚馆秦楼 3 n
+楚鲁松杰 3 nr
+楛耘伤岁 3 nr
+楜 5 zg
+楝 222 n
+楝树 7 n
+楞 722 zg
+楞严经 3 n
+楞乎乎 3 z
+楞了 3 n
+楞了楞 3 n
+楞伽 3 n
+楞住 3 n
+楞场 3 n
+楞头呆脑 3 n
+楞头楞脑 2 n
+楞头磕脑 3 z
+楞怔怔 3 z
+楞手楞脚 3 n
+楞枷经 3 z
+楞楞 3 n
+楞楞地 3 n
+楞次 17 n
+楞次定律 24 n
+楞眉横眼 3 n
+楟 2 zg
+楠 271 n
+楠木 486 n
+楠梓 3 n
+楠溪江 3 ns
+楠竹 282 n
+楡 6 zg
+楢 5 zg
+楣 58 g
+楣运当头 3 nr
+楦 60 ng
+楦头 4 n
+楦子 3 n
+楦样 3 n
+楩 3 zg
+楪 5 zg
+楫 39 ng
+楬 2 zg
+楮 18 zg
+楮实子 3 v
+楯 28 zg
+楰 3 zg
+楱 2 zg
+楷 102 n
+楷书 251 n
+楷书体 3 n
+楷体 8 n
+楷体字 3 n
+楷则 3 n
+楷字 3 n
+楷式 3 n
+楷模 177 n
+楷法 3 n
+楷范 3 n
+楸 80 g
+楸子 3 n
+楸树 7 n
+楹 372 q
+楹联 30 n
+楼 6245 n
+楼上 1082 s
+楼上住户 3 n
+楼上楼 3 n
+楼上楼下 3 n
+楼下 737 s
+楼下住户 3 n
+楼中楼 3 nr
+楼主 21 n
+楼丽英 9 nr
+楼九楹 129 nr
+楼亭 3 nr
+楼价 78 n
+楼传旨 2 nr
+楼体 3 n
+楼倚山 2 nr
+楼兰 128 ns
+楼兰王国 3 ns
+楼兰遗址 5 n
+楼内 3 s
+楼凤阁 2 nr
+楼前 132 s
+楼区 2 n
+楼南光 3 nr
+楼台 105 n
+楼台亭阁 4 nr
+楼号 3 n
+楼名宝 2 nr
+楼嘉军 5 nr
+楼址 2 n
+楼堂 4 n
+楼堂馆所 3 n
+楼墨师 14 nr
+楼夏玉 2 nr
+楼外 3 s
+楼头 70 n
+楼子 2 n
+楼宇 46 nr
+楼宇烈 2 nr
+楼宝殿 9 nr
+楼宴聚 3 nr
+楼层 51 n
+楼山 2 ns
+楼山乡 4 ns
+楼市 114 n
+楼底 3 s
+楼底下 3 s
+楼府 16 n
+楼座 7 n
+楼廊 3 n
+楼式木 256 nr
+楼惟一 2 nr
+楼房 367 n
+楼房楼投 3 ns
+楼新苑 2 nr
+楼板 93 n
+楼林立 2 nr
+楼梯 678 n
+楼梯口 76 n
+楼梯平台 3 n
+楼梯扶手 3 n
+楼梯间 4 n
+楼橹 3 nr
+楼残基 2 nr
+楼盖 10 n
+楼盘 169 n
+楼空 3 s
+楼窗 3 n
+楼窗口 2 nr
+楼继伟 3 nr
+楼群 28 n
+楼脚 3 n
+楼船 26 n
+楼船箫鼓 3 nr
+楼花 3 n
+楼花厅 2 n
+楼薄幸 2 nr
+楼观 4 n
+楼诗钞 2 nr
+楼财神 3 nr
+楼适夷 5 nr
+楼道 100 n
+楼道口 3 n
+楼采凝 3 nr
+楼里 3 s
+楼镇美 2 nr
+楼门 53 n
+楼门口 11 s
+楼间距 3 n
+楼阁 273 n
+楼阁亭台 3 nr
+楼阁台榭 3 n
+楼阳生 256 nr
+楼面 34 n
+楼面地价 3 n
+楼面层 3 n
+楼顶 253 n
+楼顶上 3 n
+楼高阁 3 nr
+楼龄 3 n
+楽 3 zg
+楽林 3 v
+楿 6 zg
+榀 4 q
+概 434 n
+概不 3 l
+概不考虑 3 i
+概不负责 6 l
+概不赊欠 3 v
+概不追究 3 l
+概予 3 v
+概况 2038 n
+概化理论 3 n
+概叙 3 n
+概叹 3 v
+概形同构 3 n
+概念 4435 n
+概念习得 3 n
+概念储存 3 n
+概念分析 3 n
+概念化 27 n
+概念图 3 n
+概念学习 3 n
+概念性 21 n
+概念模型 4 n
+概念模式 2 n
+概念股 31 n
+概念设计 3 n
+概念车 3 n
+概括 1358 v
+概括地说 3 n
+概括性 40 n
+概数 4 n
+概日凌云 3 i
+概然误差 3 n
+概率 589 n
+概率函数 3 n
+概率分布 24 n
+概率分析 2 l
+概率密度 3 n
+概率密度函数 7 n
+概率幅 3 n
+概率模型 7 n
+概率法 3 n
+概率论 155 n
+概率译码 3 n
+概率距离 3 n
+概略 26 n
+概略性 3 n
+概称 3 n
+概算 22 n
+概算书 3 n
+概算法 3 n
+概而不论 3 i
+概而言之 2 i
+概莫能外 12 l
+概要 91 v
+概观 14 n
+概览 1572 n
+概论 526 n
+概诉 3 v
+概说 9 n
+概貌 295 n
+概述 508 v
+概预算 3 n
+榄 122 g
+榅 3 zg
+榆 202 ns
+榆中 24 ns
+榆中县 5 ns
+榆叶 3 n
+榆叶梅 5 n
+榆暝豆重 3 v
+榆木 15 ns
+榆木圪垯 3 z
+榆木树 3 ns
+榆木疙瘩 6 n
+榆木脑壳 3 n
+榆木脑袋 4 n
+榆枋之见 3 v
+榆林 165 ns
+榆林人 4 n
+榆林地区 2 ns
+榆林市 8 ns
+榆林港 7 ns
+榆枝 3 n
+榆树 89 ns
+榆树县 3 ns
+榆树市 6 ns
+榆树林子 5 ns
+榆次 45 ns
+榆次之辱 3 i
+榆次人 2 n
+榆次区 3 ns
+榆次县 3 ns
+榆次市 13 ns
+榆皮 3 n
+榆瞑豆重 3 i
+榆社 14 ns
+榆社县 6 ns
+榆荚 4 n
+榆钱 15 n
+榆钱儿 4 n
+榆阳区 3 ns
+榇 34 g
+榈 67 x
+榉 28 x
+榉木 3 n
+榉树 5 n
+榌 6 zg
+榍 15 x
+榑 3 zg
+榔 47 n
+榔头 20 n
+榔榆 2 n
+榕 55 n
+榕城 10 ns
+榕城区 3 ns
+榕树 84 n
+榕树下 2 n
+榕江 11 ns
+榕江县 3 ns
+榖 40 zg
+榗 2 zg
+榘 302 zg
+榛 245 zg
+榛奔 3 nz
+榛子 52 n
+榛属 3 n
+榛林 3 nz
+榛树 3 n
+榛莽 6 nz
+榛蘑 4 nz
+榛鸡 12 n
+榜 1888 n
+榜上无名 7 l
+榜上有名 38 l
+榜中榜 3 n
+榜人 3 n
+榜前列 3 l
+榜单 3 n
+榜尾 2 n
+榜文 72 n
+榜样 440 n
+榜眼 537 n
+榜示 3 n
+榜贴 3 n
+榜额 3 n
+榜首 137 n
+榣 2 zg
+榤 4 zg
+榧 95 n
+榧子 12 n
+榨 371 n
+榨出 3 v
+榨取 152 v
+榨汁 14 n
+榨汁机 4 n
+榨油 206 n
+榨油厂 5 n
+榨油机 6 n
+榨渣 3 n
+榨甘蔗 3 n
+榨糖 3 n
+榨肉 3 n
+榨菜 544 n
+榫 120 n
+榫卯 13 n
+榫头 11 n
+榫子 3 n
+榫槽机 2 n
+榫眼 3 n
+榬 2 zg
+榭 261 g
+榱 12 g
+榱崩栋折 3 nr
+榱栋崩折 3 nr
+榳 2 zg
+榴 169 n
+榴弹 247 n
+榴弹炮 335 n
+榴散弹 3 n
+榴梿 3 n
+榴火 3 n
+榴花 13 n
+榴莲 25 n
+榴莲果 3 n
+榴辉岩 10 n
+榴霰弹 6 n
+榷 310 g
+榷酒征茶 3 nz
+榸 12 zg
+榻 679 n
+榻板 3 n
+榻榻米 11 n
+榼 3 zg
+榾 19 zg
+榾柮 3 z
+榿 7 zg
+槀 6 zg
+槁 28 g
+槁形灰心 3 i
+槁木 6 n
+槁木死灰 4 i
+槁项没齿 3 n
+槃 189 zg
+槃木朽株 3 n
+槃根错节 3 v
+槅 12 zg
+槈 112 zg
+槊 89 g
+槊血满袖 3 nr
+構 3 zg
+槌 289 ng
+槌仁提义 3 i
+槌子 3 i
+槌棒 3 i
+槌牛酾酒 3 vn
+槌胸蹋地 3 z
+槍 2 zg
+槎 564 ng
+槐 272 nr
+槐南一梦 3 n
+槐叶 13 n
+槐木 3 n
+槐林 4 n
+槐树 463 n
+槐树下 3 n
+槐米 2 n
+槐花 61 n
+槐荫区 23 n
+槐蚕 3 n
+槐角 3 n
+槐豆 3 n
+槐黄 3 n
+槑 201 zg
+槒 18 zg
+槔 33 x
+槗 30 zg
+様 14 zg
+槙 6 zg
+槚 3 zg
+槛 178 zg
+槛墙 3 n
+槛花笼鹤 3 n
+槛车 3 n
+槜 6 zg
+槝 155 zg
+槞 2 zg
+槟 24 n
+槟城 31 n
+槟子 3 n
+槟榔 166 n
+槟榔汁 3 v
+槠 17 g
+槢 34 zg
+槥 2 zg
+槦 621 zg
+槧 5 zg
+槨 5 zg
+槩 2 zg
+槬 29 zg
+槭 140 zg
+槮 12 zg
+槯 10 zg
+槰 12 zg
+槱 7 zg
+槲 44 n
+槲寄生 13 n
+槲栎 9 n
+槴 3 zg
+槶 3 zg
+槷 2 zg
+槸 3667 zg
+槹 2 zg
+槺 7 zg
+槻 57 zg
+槼 62 zg
+槽 1660 ng
+槽体 3 n
+槽内 3 nz
+槽升子 3 n
+槽口 3 n
+槽坊 3 n
+槽头 3 n
+槽子 12 n
+槽孔 4 n
+槽床 3 nz
+槽式 6 n
+槽式缘 3 n
+槽沟 5 n
+槽灌 3 n
+槽牙 6 n
+槽粕 3 n
+槽糕 3 n
+槽罐车 3 n
+槽谷 27 n
+槽车 4 n
+槽轮 3 n
+槽钢 3 n
+槾 143 zg
+槿 48 x
+樀 56 zg
+樁 33 zg
+樂 3 zg
+樃 11 zg
+樄 2 zg
+樆 33 zg
+樇 3 zg
+樉 60 zg
+樊 299 nr
+樊一翁 296 nr
+樊三哥 3 nr
+樊亦敏 3 nr
+樊南 2 ns
+樊口 9 ns
+樊启鹏 256 nr
+樊城 165 ns
+樊城区 256 ns
+樊增祥 3 nr
+樊大哥 4 nr
+樊天林 4 nr
+樊如钧 5 nr
+樊家岗 2 nr
+樊少皇 3 nr
+樊川 5 ns
+樊建 5 ns
+樊建川 14 nr
+樊志启 3 nr
+樊志起 3 nr
+樊文建 6 nr
+樊春晖 6 nr
+樊春雷 4 nr
+樊晓霞 2 nr
+樊朝美 37 nr
+樊本奎 3 nr
+樊树志 8 nr
+樊梁湖 4 nr
+樊梨花 8 nr
+樊楼前 2 nr
+樊爱能 2 nr
+樊玉明 4 nr
+樊瑞引 4 nr
+樊知古 2 nr
+樊笼 20 nr
+樊篱 11 ns
+樊粹庭 3 nr
+樊维华 2 nr
+樊英利 3 nr
+樊马 2 ns
+樋 62 zg
+樏 3 zg
+樐 8 zg
+樑 2 zg
+樓 2 zg
+樗 61 g
+樗栎庸材 3 nr
+樗蒲 2 n
+樘 68 q
+標 6 zg
+樚 4 zg
+樟 227 n
+樟子 2 n
+樟子松 13 n
+樟木 47 n
+樟木箱 3 n
+樟林村 3 ns
+樟柳碱 4 n
+樟树 54 n
+樟树下 6 n
+樟树市 10 ns
+樟树镇 4 ns
+樟油 3 n
+樟脑 70 n
+樟脑丸 12 n
+樟脑油 3 n
+樟蚕 4 n
+模 1046 n
+模上复形 3 l
+模件 3 n
+模仿 969 v
+模仿性 5 n
+模仿秀 14 n
+模仿者 10 n
+模体符 3 n
+模具 149 n
+模具公司 3 n
+模具厂 3 n
+模具网 3 n
+模具设备 3 n
+模具设计 3 i
+模具通 3 l
+模具钢 12 n
+模具钢材 3 n
+模写 8 v
+模切机 3 n
+模制 3 n
+模制品 3 n
+模印 5 n
+模压 21 n
+模压机 3 n
+模压门 3 n
+模同态 3 n
+模块 457 n
+模块化 136 n
+模块号 3 n
+模块性 3 n
+模块接口 2 n
+模块电源 3 n
+模型 2890 n
+模型外科 3 n
+模型室 3 n
+模型库 2 n
+模型材料 3 n
+模型板 3 n
+模型模拟 3 v
+模型简化 2 l
+模型船 3 n
+模型表示 6 n
+模型试验 3 n
+模型车 3 n
+模型预演 3 n
+模型飞机 3 n
+模塑 15 n
+模塑科技 8 nz
+模天 3 n
+模子 56 n
+模山范水 3 n
+模式 3809 n
+模式分析 9 l
+模式化 19 n
+模式匹配 14 nz
+模式图 6 n
+模式定义 3 l
+模式识别 3 n
+模式语言 3 l
+模式驱动程序 2 l
+模态 71 n
+模态逻辑 3 l
+模拟 1724 v
+模拟信号 2 n
+模拟出 6 n
+模拟化 18 n
+模拟器 26 n
+模拟城市 3 n
+模拟天下 3 b
+模拟实验 3 n
+模拟式 16 b
+模拟战 8 nz
+模拟手机 3 n
+模拟机 5 n
+模拟法 6 n
+模拟游戏 3 n
+模拟程序 3 n
+模拟系统 32 n
+模拟网 2 n
+模拟考 3 n
+模拟考试 3 n
+模拟能力 3 n
+模拟计算 3 n
+模拟训练 3 n
+模拟输出 3 n
+模拟退火 3 n
+模拟量 3 n
+模拟题 3 n
+模数 13 n
+模数转换 5 l
+模数转换器 3 l
+模本 4 n
+模李代数 3 n
+模板 113 n
+模板合成 3 n
+模板天下 3 n
+模板研究 3 n
+模板聚合 3 n
+模架 2 n
+模样 2155 n
+模样儿 93 n
+模棱 3 b
+模棱两可 64 i
+模棱两端 3 i
+模模糊糊 133 z
+模温机 3 n
+模版 23 v
+模特 284 a
+模特儿 51 n
+模特公司 3 n
+模特大赛 3 nz
+模特学校 3 n
+模特网 3 n
+模的直和 3 n
+模糊 1095 a
+模糊不清 86 l
+模糊化 3 n
+模糊地 3 z
+模糊声 3 n
+模糊学 3 n
+模糊性 30 n
+模糊控制 14 n
+模糊推理 8 l
+模糊数学 4 l
+模糊认识 3 l
+模糊论 3 n
+模糊起来 3 l
+模糊集 22 n
+模糊音 3 n
+模组 13 n
+模组化 3 n
+模范 1604 n
+模范丈夫 3 n
+模范人物 3 n
+模范作用 3 n
+模范县 515 n
+模范城 3 n
+模范带头 3 n
+模范村 3 n
+模范生 3 n
+模范省 3 n
+模范章 3 n
+模范行动 3 n
+模进 3 v
+模造 3 v
+模造品 3 n
+模造纸 3 n
+模量 30 n
+模铸 2 n
+模锻 10 n
+横 4321 v
+横七竖八 92 i
+横三竖四 3 i
+横三顺四 3 i
+横下 3 v
+横下心来 3 l
+横事 4 n
+横井 4 ns
+横亘 224 v
+横从穿贯 3 i
+横传 25 v
+横倒竖卧 3 i
+横倒竖歪 3 i
+横僿不文 3 v
+横写 3 v
+横冲 3 ns
+横冲直撞 212 i
+横冲直闯 2 i
+横出 3 v
+横刀 3 n
+横刀夺爱 3 i
+横刀揭斧 3 i
+横刀立马 3 i
+横刀跃马 3 i
+横切 34 v
+横切面 20 i
+横列 3 ns
+横列式 2 n
+横到 3 v
+横剖面 18 n
+横加 40 v
+横加干涉 6 i
+横加指责 7 i
+横加阻拦 3 nz
+横加阻梗 3 i
+横匾 8 n
+横卧 136 v
+横印 3 v
+横压 3 v
+横县 8 ns
+横向 411 v
+横向发展 3 i
+横向扫描 2 n
+横向检验 3 n
+横向沙丘 3 n
+横向联合 3 n
+横向联系 3 n
+横向速度 3 n
+横向预测 3 l
+横吹 19 v
+横坐标 14 n
+横坐标轴 3 n
+横坑 3 ns
+横头 10 n
+横尸 23 n
+横尸遍野 2 i
+横山 99 ns
+横山光辉 3 i
+横山勇见 3 i
+横山县 5 ns
+横岗 3 ns
+横峰 5 ns
+横峰侧岭 3 i
+横峰县 3 ns
+横巷 2 ns
+横帆 3 nz
+横幅 239 n
+横幅标语 3 l
+横店 3 ns
+横店集团 5 n
+横度 3 ns
+横座标 3 n
+横征暴 3 n
+横征暴敛 48 i
+横征暴歛 3 nr
+横征暴赋 3 n
+横征苛役 3 vn
+横征苛敛 3 vn
+横得 3 v
+横徵暴敛 3 nr
+横心 3 n
+横恣 3 i
+横恩滥赏 3 i
+横戈盘马 3 ns
+横戈跃马 3 nz
+横截面 33 i
+横扫 462 v
+横扫千军 44 i
+横扫天下 3 i
+横批 10 v
+横折 3 v
+横折勾 3 nr
+横抢武夺 3 i
+横抢硬夺 3 i
+横披 7 v
+横拍 7 v
+横拖倒扯 3 l
+横拖倒拽 3 l
+横拖竖拉 3 i
+横挑鼻子竖挑眼 15 i
+横振动 3 i
+横排 20 v
+横接 3 v
+横提 3 n
+横握 3 v
+横摆 3 v
+横放 21 v
+横数 3 n
+横斜 29 v
+横断 24 v
+横断山 46 ns
+横断山脉 86 ns
+横断面 51 n
+横无忌惮 3 i
+横暴 38 n
+横木 28 ns
+横杆 21 n
+横杠 18 n
+横条 3 n
+横枪跃马 3 i
+横标 131 n
+横栏 4 n
+横栏镇 6 ns
+横桅索 3 nr
+横档 3 b
+横梁 154 ns
+横槊赋诗 2 nr
+横槛 3 n
+横槟 3 n
+横模 3 n
+横死 3 v
+横殃飞祸 3 i
+横水 8 ns
+横江 34 ns
+横沟 272 ns
+横波 45 ns
+横流 88 n
+横渡 89 v
+横溢 35 v
+横滚 11 v
+横滨 77 ns
+横滨人 3 nz
+横滨市 3 ns
+横灾飞祸 3 i
+横版 3 v
+横琴 5 n
+横琴岛 6 ns
+横生 67 v
+横生技节 3 n
+横生枝节 8 i
+横生节枝 3 n
+横田 19 ns
+横电模 3 n
+横电波 3 n
+横电磁模 3 n
+横盘 3 n
+横目 3 n
+横直 14 d
+横眉 9 ns
+横眉冷对 7 i
+横眉冷对千夫指 2 i
+横眉冷目 3 i
+横眉冷眼 3 i
+横眉努目 3 ns
+横眉吐气 3 i
+横眉怒目 23 i
+横眉怒视 3 i
+横眉瞪目 3 i
+横眉瞪眼 3 i
+横眉立目 3 i
+横眉立眼 3 i
+横眉竖目 3 i
+横眉竖眼 7 i
+横看成 3 v
+横磁模 3 n
+横祸 28 n
+横祸非灾 3 i
+横祸飞灾 3 i
+横科暴敛 3 i
+横移动 3 i
+横空 41 n
+横空出世 36 i
+横穿 391 v
+横穿过 2 l
+横穿马路 3 i
+横竖 182 d
+横竖横 3 i
+横笔 3 n
+横笛 20 n
+横管 3 n
+横纤维 3 l
+横纲 2 n
+横纹 41 n
+横纹肌 25 n
+横线 49 n
+横结肠 6 i
+横翔捷出 3 n
+横翻 3 v
+横肉 36 n
+横膈膜 2 n
+横草之功 3 i
+横蛮 78 n
+横蛮无理 5 i
+横行 327 v
+横行一时 3 i
+横行不法 13 i
+横行乡里 3 ns
+横行天下 3 i
+横行无忌 18 i
+横行直撞 3 i
+横行直走 3 i
+横行逆施 3 i
+横行霸道 55 n
+横街 26 ns
+横见侧出 3 i
+横议 3 n
+横话 3 v
+横说竖说 3 i
+横谷 3 n
+横贡呢 3 n
+横贡缎 4 nr
+横财 60 v
+横贯 1168 v
+横贯东西 3 i
+横贯公路 3 i
+横贯铁路 3 i
+横赋暴敛 3 i
+横起 3 v
+横越 48 d
+横跨 411 v
+横路山 3 ns
+横踢 3 i
+横蹬 3 n
+横身竖卧 3 i
+横躺 12 v
+横躺竖卧 4 l
+横轴 3 n
+横过 75 v
+横运 3 n
+横逆 5 v
+横遭 3 v
+横遮竖挡 3 i
+横金拖玉 3 n
+横针竖线 3 i
+横队 33 n
+横陈 12 v
+横隔 8 v
+横隔膜 6 n
+横面 3 n
+横须贺 45 ns
+横须贺港 4 ns
+横题 3 n
+横额 142 n
+横飞 99 v
+横驱别骛 3 i
+横骑 3 n
+横骨 3 n
+樫 4 zg
+樯 54 ng
+樯倾楫摧 3 nr
+樯橹 2 n
+樱 336 nr
+樱之花 3 nr
+樱内 6 n
+樱内义雄 7 ns
+樱口微 3 nr
+樱唇 3 n
+樱唇微 3 nr
+樱大战 3 nz
+樱木花道 3 ns
+樱桃 353 n
+樱桃园 18 n
+樱桃小口 3 n
+樱桃小嘴 3 nr
+樱桃木 3 n
+樱桃树 3 n
+樱桃核 3 n
+樱桃汁 3 n
+樱桃沟 7 ns
+樱桃派 3 n
+樱桃红 3 nr
+樱桃花 3 n
+樱桃酒 3 n
+樱花 178 n
+樱花园 3 n
+樱花大战 3 nz
+樱花季 3 n
+樱花恋 3 nr
+樱花树 18 n
+樱花节 11 n
+樱花雨 3 n
+樱苏鲁 2 ns
+樱草 3 n
+樱雪 3 n
+樵 287 n
+樵夫 65 n
+樵姑 3 n
+樵子 3 n
+樵采 6 n
+樷 51 zg
+樸 93 zg
+樹 383 zg
+樺 670 zg
+樻 916 zg
+樼 440 zg
+樽 81 ng
+樽俎 5 n
+樽俎折冲 3 z
+樽前月下 3 n
+樾 42 g
+樿 255 zg
+橀 137 zg
+橁 3 zg
+橄 29 n
+橄榄 180 n
+橄榄坝 4 n
+橄榄型 2 n
+橄榄岩 24 n
+橄榄形 3 n
+橄榄枝 37 n
+橄榄树 20 n
+橄榄油 68 n
+橄榄球 64 n
+橄榄球场 3 n
+橄榄球赛 12 n
+橄榄球队 4 n
+橄榄石 59 n
+橄榄绿 19 n
+橄榄绿色 13 n
+橄榄色 16 n
+橆 3 zg
+橇 108 g
+橈 237 zg
+橏 4 zg
+橐 153 o
+橐驼 3 nrfg
+橐驼之技 3 v
+橑 4 zg
+橓 24 zg
+橔 3 zg
+橘 127 n
+橘子 87 n
+橘子水 3 n
+橘子汁 8 n
+橘子洲 2 ns
+橘子酱 3 n
+橘柑 2 n
+橘树 3 n
+橘核 3 n
+橘汁 7 n
+橘皮 3 n
+橘红 16 b
+橘红色 39 n
+橘络 2 n
+橘色 3 n
+橘黄 15 b
+橘黄色 15 n
+橙 489 n
+橙子 41 n
+橙木 3 n
+橙树 3 n
+橙汁 26 n
+橙皮 3 n
+橙红 7 b
+橙红色 32 n
+橙色 80 n
+橙黄 29 b
+橙黄桔绿 3 z
+橙黄橘绿 3 z
+橙黄色 48 n
+橚 7 zg
+橛 52 n
+橛子 10 n
+橛守成规 3 n
+橜 4 zg
+橞 3 zg
+橡 49 n
+橡塑厂 3 n
+橡子 25 n
+橡实 5 n
+橡木 27 n
+橡木叶 3 n
+橡树 278 n
+橡树叶 7 n
+橡树果 3 n
+橡皮 120 n
+橡皮图章 5 n
+橡皮圈 3 n
+橡皮塞 3 n
+橡皮布 2 n
+橡皮擦 6 l
+橡皮树 3 n
+橡皮泥 4 n
+橡皮球 5 n
+橡皮筋 15 n
+橡皮筏 3 n
+橡皮管 4 n
+橡皮糖 2 n
+橡皮线 3 n
+橡皮膏 12 n
+橡皮船 3 n
+橡皮艇 27 n
+橡皮钉子 3 n
+橡皮障 3 n
+橡皮障夹 3 n
+橡皮障架 3 n
+橡票 3 n
+橡筋 5 n
+橡胶 949 n
+橡胶件 3 n
+橡胶作物 3 n
+橡胶制品 3 n
+橡胶厂 6 n
+橡胶园 13 n
+橡胶圈 3 n
+橡胶地板 3 n
+橡胶坝 3 n
+橡胶垫 3 n
+橡胶套 3 n
+橡胶木 3 n
+橡胶机械 3 n
+橡胶材料 3 n
+橡胶板 3 n
+橡胶林 3 n
+橡胶树 45 n
+橡胶模具 3 n
+橡胶球 4 n
+橡胶磁 3 n
+橡胶管 3 n
+橡胶粉 3 n
+橡胶草 3 n
+橡胶轮胎 3 n
+橡胶配件 3 n
+橡胶配合 3 n
+橡胶雨衣 3 n
+橡胶鞋 3 n
+橡茹藿歠 3 z
+橡饭菁羹 3 nz
+橥 9 g
+橦 26 zg
+橪 4 zg
+橫 3 zg
+橮 2 zg
+橯 37 zg
+橱 391 n
+橱子 3 n
+橱师 3 n
+橱柜 22 n
+橱柜门 3 n
+橱窗 126 n
+橳 3 zg
+橷 17 zg
+橸 20 zg
+橹 256 ng
+橼 12 x
+橾 2 zg
+檀 607 nr
+檀岛 3 ns
+檀木 79 nr
+檀板 33 n
+檀石槐 31 nr
+檀称凉 2 nr
+檀道济 10 nr
+檀道鸾 3 nr
+檀那 3 ns
+檀郎谢女 3 n
+檀香 62 nr
+檀香山 67 nr
+檀香扇 16 n
+檀香木 24 nr
+檀香树 3 nr
+檀香油 3 nr
+檀香皂 3 n
+檄 203 zg
+檄书 3 n
+檄文 140 n
+檅 2 zg
+檇 8 zg
+檈 23 zg
+檎 8 x
+檐 1465 ng
+檐下 3 n
+檐前 3 n
+檐口 2 n
+檐墙 3 n
+檐头 3 n
+檐子 3 n
+檐宇 3 n
+檐枋 3 n
+檐柱 3 n
+檐楣 3 n
+檐槽 3 n
+檐沟 3 n
+檐瓦 4 n
+檐角 3 n
+檐部 3 n
+檑木 3 n
+檒 11 zg
+檗 5 zg
+檘 3 zg
+檜 14 zg
+檝 2 zg
+檞 19 zg
+檠 19 zg
+檢 2 zg
+檩 6 zg
+檩子 3 n
+檩木 3 n
+檩条 11 n
+檪 8 zg
+檫 21 g
+檬 115 x
+檬树 3 nz
+檭 23 zg
+檮 28 zg
+檯 43 zg
+檰 14 zg
+檲 465 zg
+檵 8 zg
+檵木叶 3 nz
+檶 19 zg
+檷 24 zg
+檸 58 zg
+檹 7 zg
+檺 17 zg
+檻 56 zg
+檼 5 zg
+檽 12 zg
+檾 2 zg
+檿 13 zg
+櫀 4 zg
+櫁 9 zg
+櫃 45 zg
+櫄 80 zg
+櫅 2 zg
+櫆 15 zg
+櫈 9 zg
+櫉 179 zg
+櫋 5 zg
+櫌 52 zg
+櫎 58 zg
+櫐 3 zg
+櫒 28 zg
+櫓 41 zg
+櫔 8 zg
+櫕 12 zg
+櫖 3 zg
+櫘 389 zg
+櫙 276 zg
+櫚 7 zg
+櫜弓卧鼓 3 n
+櫜弓戢戈 3 v
+櫜弓戢矢 3 nr
+櫜甲束兵 3 nr
+櫟 2 zg
+櫠 26 zg
+櫡 14 zg
+櫤 23 zg
+櫥 8 zg
+櫦 8 zg
+櫧 274 zg
+櫨 93 zg
+櫶 4 zg
+櫹 2 zg
+欄 5 zg
+欆 2 zg
+欉 4 zg
+權 3 zg
+欋 3 zg
+欌 38 zg
+欍 62 zg
+欎 1019 zg
+欏 720 zg
+欐 700 zg
+欑 366 zg
+欒 378 zg
+欓 237 zg
+欔 4 zg
+欙 346 zg
+欠 1566 v
+欠下 3 v
+欠交 3 v
+欠产 3 v
+欠付 3 v
+欠伸 3 v
+欠佳 114 v
+欠债 71 v
+欠债人 2 n
+欠债未还 3 l
+欠债还钱 10 l
+欠发达 3 n
+欠发达国家 2 l
+欠妥 16 v
+欠安 26 v
+欠帐 5 n
+欠帐未还 3 n
+欠当 3 v
+欠息 3 v
+欠情 3 n
+欠扁 3 n
+欠拨 3 v
+欠据 3 n
+欠揍 13 v
+欠收 3 v
+欠收自补 3 i
+欠条 15 n
+欠款 65 n
+欠款人 3 n
+欠火 3 v
+欠火候 3 l
+欠租 3 v
+欠税 21 v
+欠税款 3 n
+欠缴 23 v
+欠缺 282 v
+欠缺着 3 l
+欠考虑 3 n
+欠薪 3 v
+欠账 31 v
+欠费 6 v
+欠资 3 v
+欠资邮件 3 n
+欠资邮票 3 n
+欠身 244 v
+欠钱 3 v
+欠钱未还 3 i
+欠阻尼 3 n
+次 17947 q
+次一等 3 b
+次世代 3 t
+次之 438 t
+次于 195 v
+次仁多吉 3 nrt
+次优 3 b
+次位 3 n
+次内阁级 3 n
+次分面 3 n
+次列车 3 n
+次印刷 4 n
+次呼叫 5 v
+次品 21 n
+次声 27 n
+次声武器 8 l
+次声波 42 n
+次大陆 48 n
+次女 12 n
+次子 251 n
+次官 42 n
+次帅 8 n
+次席 42 n
+次常式 3 b
+次干路 3 n
+次平面 3 n
+次年 1482 t
+次序 276 n
+次序公理 3 n
+次数 2795 n
+次数法 3 n
+次新股 3 n
+次方 18 n
+次日 1719 t
+次晶 3 n
+次月 3 t
+次极大 3 n
+次桥基 3 nz
+次梯度 3 n
+次次 18 t
+次正规列 3 b
+次殖民地 3 n
+次氯酸 4 n
+次氯酸盐 2 nz
+次氯酸钙 3 nz
+次氯酸钠 3 nz
+次测试 5 n
+次生 226 b
+次生林 59 n
+次生矿物 5 n
+次甲霉素 3 n
+次男 3 n
+次登 2 v
+次直积 3 n
+次石墨 3 n
+次第 139 n
+次等货 3 n
+次级 101 b
+次级债 3 n
+次级品 3 n
+次级子波 3 n
+次级控制 3 n
+次级线圈 3 n
+次级绕组 3 n
+次级记忆 3 n
+次要 297 b
+次要性 3 n
+次要情节 3 n
+次要方面 3 n
+次要矛盾 3 l
+次访问 24 n
+次货 3 n
+次贫 3 b
+次连续 2 n
+次连续性 3 n
+次递归性 3 n
+次郎 3 n
+次重音 3 n
+次长 85 n
+次韵 10 n
+次页 3 n
+次髎 3 v
+次黄嘌呤 3 n
+欢 1261 v
+欢乐 1082 a
+欢乐今宵 3 n
+欢乐地 3 i
+欢乐城 3 ns
+欢乐气氛 3 n
+欢乐祥和 3 i
+欢乐谷 120 n
+欢乐颂 4 l
+欢叫 48 v
+欢叫声 4 i
+欢呼 776 v
+欢呼声 380 i
+欢呼雀跃 39 l
+欢呼鼓舞 3 i
+欢唱 19 v
+欢喜 1410 v
+欢喜佛 3 i
+欢喜冤家 4 l
+欢喜岭 34 ns
+欢喜欲狂 3 i
+欢喜若狂 3 i
+欢场 3 n
+欢声 57 v
+欢声笑语 49 i
+欢声雷动 197 i
+欢天喜地 112 i
+欢好 3 a
+欢娱 143 v
+欢实 3 a
+欢宴 34 v
+欢庆 249 ns
+欢度 61 ns
+欢度国庆 3 ns
+欢度春节 3 ns
+欢心 191 v
+欢心鼓舞 3 i
+欢快 257 a
+欢忭鼓舞 3 nr
+欢息 3 v
+欢悦 67 a
+欢情 3 a
+欢愉 91 a
+欢欢 2 v
+欢欢乐乐 3 i
+欢欢喜喜 56 i
+欢欣 66 a
+欢欣若狂 3 i
+欢欣鼓舞 79 i
+欢歌 34 v
+欢歌笑语 15 i
+欢洽 3 v
+欢渡 3 v
+欢渡佳节 3 i
+欢爱 3 v
+欢畅 51 a
+欢眉喜眼 3 i
+欢笑 135 v
+欢笑声 17 i
+欢聚 61 v
+欢聚一堂 53 i
+欢腾 117 v
+欢舞 2 v
+欢若平生 3 i
+欢谈 2 v
+欢跃 13 v
+欢跳 3 v
+欢蹦乱跳 14 i
+欢迎 5132 v
+欢迎仪式 3 l
+欢迎会 12 l
+欢迎信 3 i
+欢迎光临 3 l
+欢迎宴会 3 l
+欢迎您 3 l
+欢迎惠顾 3 l
+欢迎批评 3 l
+欢迎晚会 3 l
+欢迎词 5 i
+欢迎辞 2 i
+欢迸乱跳 3 v
+欢送 57 v
+欢送会 6 n
+欢送晚会 3 i
+欢闹 3 a
+欢音 3 n
+欢颜 12 n
+欢风 3 v
+欣 350 nr
+欣勤 3 a
+欣喜 338 a
+欣喜万分 3 i
+欣喜欲狂 3 i
+欣喜若狂 61 i
+欣喜逾常 3 i
+欣幸 3 a
+欣德 2 nrt
+欣快 11 d
+欣怡 2 i
+欣悉 2 v
+欣悦 34 a
+欣慕 3 v
+欣慰 441 v
+欣欣 3 a
+欣欣向荣 86 i
+欣欣客运 3 i
+欣欣然 6 d
+欣欣自得 3 i
+欣然 286 d
+欣然前往 3 i
+欣然同意 3 i
+欣然命笔 3 nz
+欣然接受 3 i
+欣然自喜 3 i
+欣然自得 2 i
+欣生恶死 3 i
+欣羡 26 v
+欣荣 3 a
+欣赏 1827 v
+欣赏力 3 nz
+欣赏性 5 nz
+欣赏者 19 n
+欣赏课 3 n
+欣辛 3 a
+欣逢 21 v
+欣逢佳节 3 i
+欣逢国庆 3 i
+欣闻 2 nz
+欤 163 y
+欧 2338 ns
+欧三洲 4 ns
+欧亚 284 ns
+欧亚大陆 433 ns
+欧亚大陆桥 6 ns
+欧亚非 3 ns
+欧亨尼 4 nr
+欧人 3 ns
+欧仁 3 nr
+欧伦施 6 nr
+欧体 3 n
+欧佩克 156 nr
+欧侯氏 2 nr
+欧俄 3 ns
+欧修克拉 16 nr
+欧倍德 4 nr
+欧元 1237 nz
+欧元区 27 ns
+欧克拉蒂 6 nrt
+欧兰德 3 nr
+欧共体 275 nt
+欧内斯特 4 ns
+欧冠杯 4 nr
+欧冶子 21 nr
+欧几 4 n
+欧几里得 251 ns
+欧几里德 32 ns
+欧力重 4 nr
+欧加农 3 nr
+欧加登 4 ns
+欧化 47 j
+欧化倾向 3 n
+欧化趋势 3 n
+欧华 6 nz
+欧南喜 4 nr
+欧司朗 5 nr
+欧后亚 2 nr
+欧吐密 2 nr
+欧吕丰 16 nr
+欧吕第 16 nr
+欧塞尔 4 ns
+欧大哥 7 ns
+欧姆 34 nr
+欧姆定律 42 nr
+欧姆电阻 3 n
+欧姆表 3 nr
+欧姆计 3 nr
+欧姆龙 3 nr
+欧委会 17 nt
+欧威 3 ns
+欧安 2 ns
+欧安会 41 nt
+欧安组织 19 nt
+欧宝 7 nr
+欧家碧 2 nr
+欧尔 4 ns
+欧尼修 16 nr
+欧尼尔 3 ns
+欧州 4 ns
+欧巴桑 3 nr
+欧市 3 ns
+欧市各国 3 ns
+欧广源 3 nr
+欧广联 2 ns
+欧式 68 n
+欧式建筑 3 l
+欧律狄 3 nr
+欧德 4 ns
+欧德宁 34 nr
+欧德尼 7 nr
+欧战 3 nz
+欧战前 3 nr
+欧战后 3 nr
+欧战时 3 n
+欧打 3 nz
+欧拉 277 ns
+欧拉变换 3 nr
+欧拉角 3 ns
+欧提德 2 nr
+欧文 105 nz
+欧文堡 4 nr
+欧文斯 10 nr
+欧文肖 2 nr
+欧新民 2 nr
+欧时力 3 nr
+欧普祥 2 nr
+欧智华 3 nrfg
+欧本海默 3 nr
+欧某陵 13 nr
+欧查果 3 n
+欧根 4 ns
+欧格 38 n
+欧欣宁 4 nr
+欧氏 7 nr
+欧汉伦 2 nr
+欧泊 11 ns
+欧洲 9256 ns
+欧洲中央银行 4 nt
+欧洲人 611 n
+欧洲共同 3 ns
+欧洲共同体 127 nt
+欧洲区 6 ns
+欧洲原子能共同体 4 nt
+欧洲各国 3 ns
+欧洲地区 38 ns
+欧洲央行 13 nt
+欧洲委员会 31 nt
+欧洲山梨 3 ns
+欧洲式 13 n
+欧洲李 3 ns
+欧洲杯 14 nz
+欧洲核子研究中心 9 nt
+欧洲法院 2 nt
+欧洲游 3 ns
+欧洲理事会 8 nt
+欧洲盟军 3 nt
+欧洲经济共同体 23 nt
+欧洲联盟 48 nt
+欧洲航天局 12 nt
+欧洲议会 26 nt
+欧洲足联 2 nt
+欧洲防风 3 n
+欧洲集团 3 nt
+欧洲鳗 3 n
+欧海 3 ns
+欧游 3 j
+欧游之行 3 l
+欧游记趣 3 n
+欧燕萍 3 nr
+欧版 3 n
+欧玛尔 4 nr
+欧盟 1518 j
+欧盟委员会 85 nt
+欧空局 26 nt
+欧米加 5 ns
+欧米珈 2 nrt
+欧米茄 25 n
+欧罗塔 2 ns
+欧罗巴 38 ns
+欧罗巴人种 167 n
+欧罗巴洲 19 ns
+欧罗港 2 ns
+欧美 183 ns
+欧美人 7 nr
+欧美先进 3 nr
+欧美军 2 nr
+欧美列 2 ns
+欧美化 3 j
+欧美各国 3 ns
+欧美国家 3 ns
+欧美地区 3 ns
+欧美均 2 j
+欧美歌手 3 nt
+欧美歌曲 3 ns
+欧美片 3 nz
+欧美版 3 nz
+欧美男 3 nr
+欧美经典 3 ns
+欧美音乐 3 ns
+欧耶伊 2 nr
+欧胡岛 3 ns
+欧舒丹 3 nr
+欧芹 4 nr
+欧莱雅 49 nr
+欧莱雅集团 5 nt
+欧蓝德 3 nr
+欧裔 4 n
+欧西 4 ns
+欧西亚 3 ns
+欧贝德 8 nr
+欧足联 3 ns
+欧迪芬 3 nr
+欧里 102 ns
+欧锦棠 3 nrfg
+欧锦赛 7 nr
+欧闲网 3 nr
+欧防风 3 n
+欧阳 257 ns
+欧阳一敬 9 nr
+欧阳世伯 2 nz
+欧阳世兄 5 nr
+欧阳东凤 4 ns
+欧阳予倩 31 nr
+欧阳侍郎 30 nr
+欧阳修 162 nr
+欧阳修另 2 nr
+欧阳修成 2 nr
+欧阳兄 5 nr
+欧阳先生 4 nr
+欧阳克 437 ns
+欧阳克之 2 nr
+欧阳克亦 2 nr
+欧阳克双 3 ns
+欧阳克口 2 ns
+欧阳克听 2 nr
+欧阳克大 3 ns
+欧阳克心 6 ns
+欧阳克忽 2 nr
+欧阳克怒 2 nr
+欧阳克惊 4 nr
+欧阳克打 2 nz
+欧阳克挥 2 nr
+欧阳克正 2 nr
+欧阳克猛 2 nr
+欧阳克甚 2 nr
+欧阳克笑 38 nr
+欧阳克耳 2 nr
+欧阳克见 17 nr
+欧阳克解 2 nr
+欧阳克跃 2 nr
+欧阳克转 2 nr
+欧阳克连 3 ns
+欧阳克面 2 nz
+欧阳公子 8 n
+欧阳公政 12 nr
+欧阳华 5 nr
+欧阳大哥 3 ns
+欧阳天 100 ns
+欧阳天叹 2 nr
+欧阳天都 3 ns
+欧阳夫人 4 nz
+欧阳奋强 3 nr
+欧阳小子 3 nr
+欧阳山 10 ns
+欧阳山尊 2 nr
+欧阳峰 2 ns
+欧阳应霁 6 nr
+欧阳建 2 ns
+欧阳文忠 3 nr
+欧阳明 3 nr
+欧阳晖 7 nr
+欧阳氏 3 nr
+欧阳永叔 2 nr
+欧阳洛 10 ns
+欧阳海 2 ns
+欧阳清 3 nr
+欧阳溥存 2 nr
+欧阳牧 2 nr
+欧阳牧之 3 nr
+欧阳玄 7 nr
+欧阳祥 256 nr
+欧阳艳平 3 nr
+欧阳询 17 nr
+欧阳谦叔 2 nr
+欧阳贤 3 nr
+欧阳铎 4 nr
+欧阳锋 1511 nr
+欧阳锋万 3 nr
+欧阳锋仇 2 nr
+欧阳锋先 2 nr
+欧阳锋全 2 nr
+欧阳锋冷 9 ns
+欧阳锋凝 2 nr
+欧阳锋刚 2 nr
+欧阳锋劲 3 nr
+欧阳锋右 5 nr
+欧阳锋叹 4 nr
+欧阳锋命 2 n
+欧阳锋喜 2 nr
+欧阳锋喝 4 nr
+欧阳锋复 2 nr
+欧阳锋奇 4 nr
+欧阳锋害 2 n
+欧阳锋尚 2 n
+欧阳锋微微 4 nr
+欧阳锋心 4 nt
+欧阳锋忽 7 nr
+欧阳锋怒 6 nr
+欧阳锋怪 3 n
+欧阳锋抢 3 nr
+欧阳锋授 6 n
+欧阳锋掌 5 n
+欧阳锋收 2 n
+欧阳锋攻 4 nr
+欧阳锋教 2 n
+欧阳锋斗 7 nr
+欧阳锋料 3 n
+欧阳锋旧 2 ns
+欧阳锋本 2 ns
+欧阳锋横 4 nr
+欧阳锋现 2 nr
+欧阳锋甚 2 nr
+欧阳锋相 2 n
+欧阳锋知 3 n
+欧阳锋竟 5 nr
+欧阳锋素 2 n
+欧阳锋罩 2 n
+欧阳锋自 2 ns
+欧阳锋若 2 nr
+欧阳锋蛇 5 n
+欧阳锋行 2 nt
+欧阳锋赞 2 nr
+欧阳锋跃 4 nr
+欧阳锋轻 2 nr
+欧阳锋远 2 ns
+欧阳锋连 2 ns
+欧阳锋闪 2 nr
+欧阳锋震 2 nr
+欧阳震华 3 nr
+欧阳靖 3 ns
+欧陆 17 ns
+欧震将军 2 nr
+欧非 3 ns
+欧非混 4 nr
+欧风东渐 3 nr
+欧风美雨 3 nr
+欧风西渐 3 nr
+欧马可 5 nr
+欧麦尔 21 nr
+欲 5942 d
+欲了解 3 l
+欲仙欲死 3 i
+欲令智昏 3 i
+欲加之罪 20 i
+欲取姑与 3 i
+欲取姑予 3 l
+欲哭无泪 32 i
+欲售 3 v
+欲喷 3 v
+欲壑难填 4 i
+欲女 3 n
+欲当从速 3 i
+欲念 34 n
+欲扬先抑 2 l
+欲擒故纵 15 i
+欲晓 2 v
+欲望 918 v
+欲望都市 3 n
+欲死欲仙 3 i
+欲求 71 n
+欲海 3 n
+欲海难填 3 i
+欲火 34 n
+欲火焚身 3 vn
+欲益反弊 3 i
+欲益反损 3 i
+欲盖尔彰 3 i
+欲盖弥彰 26 i
+欲盖而彰 3 i
+欲穷千里 3 i
+欲穷千里目 4 i
+欲绝 80 v
+欲罢不能 42 i
+欲裂 3 v
+欲言又止 123 l
+欲言还止 3 l
+欲设 3 v
+欲语还休 3 l
+欲说还休 7 l
+欲谁归罪 3 i
+欲购从速 3 n
+欲跳楼 3 i
+欲速不达 6 i
+欲速则不 3 l
+欲速则不达 29 i
+欲速反迟 3 l
+欲醉欲仙 3 i
+欲障 3 n
+欷 19 x
+欸 3 zg
+欸乃 3 v
+欹 27 e
+欹嵚历落 3 ns
+欺 990 vn
+欺三瞒四 3 i
+欺上压下 3 i
+欺上瞒下 11 l
+欺上罔下 3 i
+欺下瞒上 4 l
+欺世 3 v
+欺世惑众 3 i
+欺世盗名 30 i
+欺世钓誉 3 i
+欺人之谈 10 i
+欺人太甚 58 i
+欺人自欺 3 i
+欺侮 589 v
+欺公罔法 3 i
+欺凌 281 v
+欺压 185 v
+欺压百姓 3 i
+欺压群众 3 i
+欺君 58 v
+欺君之罪 3 i
+欺君罔上 11 i
+欺君误国 3 i
+欺哄 9 v
+欺善怕恶 5 i
+欺大压小 3 l
+欺天罔人 3 i
+欺天罔地 3 i
+欺天诳地 3 z
+欺客 12 v
+欺心 3 v
+欺敌 3 v
+欺敌战术 3 l
+欺生 13 v
+欺男霸女 3 i
+欺瞒 42 v
+欺硬怕软 3 i
+欺罔 3 i
+欺蒙 74 v
+欺行霸市 11 n
+欺要 3 v
+欺诈 267 vn
+欺诈性 5 n
+欺诈案 3 i
+欺诞 3 a
+欺负 577 v
+欺负人 3 i
+欺贫爱富 3 l
+欺蹒 3 l
+欺软怕硬 18 i
+欺辱 64 v
+欺霜傲雪 3 i
+欺骗 753 v
+欺骗性 35 n
+欺骗者 3 n
+欻 4 zg
+欻忽 3 z
+欻拉 3 z
+款 1642 m
+款冬 2 n
+款冬花 3 n
+款启寡闻 3 l
+款型 2 n
+款姐 3 n
+款子 68 n
+款学寡闻 3 n
+款实 3 n
+款客 3 n
+款宴 3 n
+款式 177 n
+款待 299 v
+款数 3 n
+款曲 3 n
+款曲周至 3 n
+款款 97 n
+款款动人 3 n
+款款深情 4 n
+款款深深 3 n
+款款而行 3 n
+款款而谈 3 n
+款步 3 n
+款洽 3 v
+款源 3 n
+款爷 3 n
+款物 10 n
+款留 12 v
+款目 3 n
+款级 3 n
+款识 26 n
+款诚 3 a
+款语温言 3 n
+款项 336 n
+款额 24 n
+歀 4 zg
+歂 4 zg
+歃 3 v
+歃血 13 v
+歃血为盟 23 i
+歃血结盟 3 i
+歆 76 g
+歆羡 3 a
+歇 2562 v
+歇一会 3 n
+歇一宿 3 v
+歇下 3 v
+歇业 23 n
+歇乏 3 v
+歇伏 3 v
+歇会儿 3 n
+歇假 3 v
+歇凉 11 v
+歇到 3 v
+歇后语 26 n
+歇夏 3 ns
+歇夜 3 v
+歇宿 82 v
+歇山 3 ns
+歇工 2 v
+歇息 311 v
+歇手 10 v
+歇斯底里 119 ns
+歇晌 9 v
+歇枝 3 n
+歇歇 221 v
+歇歇脚 10 ns
+歇气 3 n
+歇班 3 v
+歇肩 3 v
+歇脚 51 v
+歇腿 3 v
+歇菜 3 n
+歇阴 3 ns
+歇顶 3 n
+歇马 27 ns
+歉 325 n
+歉仄 3 n
+歉岁 3 n
+歉年 4 n
+歉意 180 n
+歉收 68 n
+歉然 3 a
+歉疚 86 a
+歉着 3 v
+歉虚 3 a
+歉过 3 v
+歋 39 zg
+歌 3039 n
+歌乐 7 n
+歌乐山 4 n
+歌乐山烈士陵园 3 ns
+歌仔 13 n
+歌仔戏 13 n
+歌伎 11 n
+歌会 14 n
+歌伴舞 3 n
+歌儿 74 n
+歌决 3 v
+歌剧 740 n
+歌剧团 35 n
+歌剧舞剧院 9 n
+歌剧院 192 n
+歌功颂德 212 i
+歌华 2 nz
+歌华有线 2 n
+歌单 4 n
+歌厅 96 n
+歌友 3 n
+歌友会 3 n
+歌台 3 n
+歌台舞榭 3 n
+歌名 4 n
+歌吟 2 v
+歌吟哭呼 3 i
+歌咏 98 n
+歌咏会 3 n
+歌咏队 3 n
+歌唱 410 n
+歌唱剧 3 n
+歌唱功臣 3 n
+歌唱家 126 n
+歌唱性 12 n
+歌唱演员 3 n
+歌唱祖国 3 n
+歌唱者 5 n
+歌喉 70 n
+歌坛 26 n
+歌坛上 3 n
+歌坛新秀 3 nz
+歌声 541 n
+歌声嘹亮 3 z
+歌声绕梁 3 i
+歌声缭绕 3 i
+歌女 62 n
+歌妓 3 n
+歌姬 8 n
+歌子 18 n
+歌宴 3 n
+歌山 2 n
+歌德 157 nrt
+歌德尔 3 nrt
+歌德巴赫 8 nrt
+歌德巴赫猜想 3 nz
+歌手 258 n
+歌手名 3 n
+歌星 96 n
+歌曲 1079 n
+歌曲仅 3 nr
+歌曲体裁 3 n
+歌曲名 3 n
+歌曲名称 3 n
+歌曲多多 3 i
+歌曲排行 3 n
+歌曲歌词 3 i
+歌曲网 3 n
+歌曲视听 3 i
+歌曲集 18 n
+歌本 2 n
+歌楼舞榭 3 i
+歌王 19 nrt
+歌者 37 n
+歌舞 609 n
+歌舞伎 25 n
+歌舞会 3 n
+歌舞剧 75 n
+歌舞升平 40 n
+歌舞厅 20 n
+歌舞团 169 n
+歌舞晚会 3 n
+歌舞杂耍 3 n
+歌舞片 7 n
+歌艺 3 n
+歌莺舞燕 3 n
+歌行 37 n
+歌西卡 3 nrt
+歌诀 58 n
+歌词 332 n
+歌词库 3 n
+歌词秀 3 i
+歌词网 3 n
+歌诵 3 v
+歌调 3 n
+歌谣 211 n
+歌谱 6 n
+歌赋 35 n
+歌路 3 n
+歌迷 27 n
+歌迷会 3 i
+歌集 3 n
+歌颂 474 v
+歌风台 2 n
+歌龄 3 n
+歍 9 zg
+歔 186 zg
+歘 2 zg
+歙 62 ns
+歙县 61 ns
+歙漆阿胶 3 n
+歙砚 16 n
+歛出来 3 vn
+歜 11 zg
+歠 3 zg
+歠菽饮水 3 nr
+止 3196 zg
+止不住 234 v
+止乎礼 3 nr
+止于 3 v
+止于至善 5 l
+止付 3 v
+止住 324 v
+止动杆 3 n
+止吐 8 v
+止吐药 4 n
+止咳 141 v
+止咳剂 3 n
+止咳水 3 n
+止咳药 3 n
+止回阀 4 l
+止境 116 n
+止怒 3 v
+止息 36 v
+止戈为武 3 nr
+止戈兴仁 3 nr
+止戈散马 3 nr
+止损 12 v
+止暴禁非 3 l
+止步 117 d
+止步不前 17 l
+止水 25 v
+止水带 2 n
+止水条 3 n
+止水栓 3 nr
+止沸益薪 3 i
+止泻 27 v
+止泻剂 3 n
+止泻药 12 l
+止涨 3 v
+止涨回跌 3 l
+止清 12 v
+止渴 23 v
+止渴思梅 3 nr
+止渴望梅 3 nr
+止疼 3 v
+止疼片 10 n
+止疼药 5 n
+止痒 43 v
+止痛 178 v
+止痛剂 6 n
+止痛片 23 n
+止痛药 71 n
+止痛针 2 n
+止臭 3 v
+止蚀 17 v
+止血 317 v
+止血剂 13 n
+止血器 3 n
+止血带 8 n
+止血敏 3 nr
+止血棉 3 n
+止血药 30 n
+止血钳 3 n
+止观 24 n
+止谈风月 3 i
+止谤 3 v
+止足之分 3 l
+止跌 24 v
+止跌企稳 3 l
+止跌回升 3 l
+止退器 3 nr
+止遏 3 v
+止饥 3 v
+正 37763 d
+正一道 25 d
+正丁醇 9 nz
+正三角形 13 n
+正上 3 d
+正上方 3 f
+正下方 14 n
+正丙醇 3 nz
+正业 8 n
+正东 42 ns
+正东方 3 f
+正中 1750 d
+正中下怀 17 l
+正中书局 3 nt
+正中关系 3 l
+正中己怀 3 i
+正中平衡 3 nz
+正中挡 3 i
+正中要害 2 l
+正中锁 3 nr
+正中间 176 n
+正义 2965 n
+正义事业 3 n
+正义党 16 n
+正义凛然 3 i
+正义北路 3 ns
+正义南路 3 nz
+正义国小 3 n
+正义性 17 n
+正义感 55 n
+正义战争 3 nz
+正义斗争 3 nz
+正义网 3 nz
+正义者 16 n
+正义路 4 n
+正九品 3 n
+正书 9 n
+正事 137 n
+正事儿 16 n
+正于 3 v
+正五角形 3 n
+正五边形 3 i
+正交 117 v
+正交值 3 n
+正交关系 3 n
+正交变换 3 i
+正交和 3 nz
+正交投影 3 i
+正交极化 3 n
+正交系 3 n
+正交调制 3 n
+正人 3 n
+正人君子 122 n
+正仓院 9 n
+正仪镇 5 nr
+正价 2 n
+正传 45 v
+正位 31 n
+正佐 2 v
+正体 40 n
+正体字 3 n
+正修工专 3 n
+正值 548 n
+正像 171 v
+正儿八经 40 nz
+正儿巴经 3 nz
+正元 12 t
+正光 11 n
+正兴 3 a
+正兵 2 n
+正典 4 b
+正册 6 v
+正冠李下 3 i
+正冠纳履 3 nr
+正凶 10 n
+正出 3 v
+正切 23 ad
+正切圆 3 z
+正则 79 n
+正则变换 3 l
+正则变量 3 l
+正则基数 3 l
+正则奇点 3 n
+正则序 3 l
+正则方程 3 l
+正则概形 3 i
+正则系综 3 nr
+正则表达式 56 l
+正前 3 t
+正前方 31 f
+正剧 19 d
+正副 296 b
+正割 2 v
+正北 62 ns
+正北方 3 f
+正午 293 t
+正南 344 ns
+正南方 3 f
+正厅 64 n
+正厅级 14 b
+正压 35 v
+正反 106 v
+正反两方 3 i
+正反两面 3 i
+正反交 3 i
+正反器 3 n
+正反手 2 n
+正反方 2 n
+正反面 11 n
+正反馈 3 v
+正取 3 v
+正取生 3 i
+正变 7 v
+正史 116 n
+正右方 3 n
+正号 3 n
+正合 3 v
+正合对 3 a
+正合我意 3 l
+正合适 3 a
+正名 53 a
+正名定分 3 l
+正后 3 t
+正后方 3 f
+正向 252 d
+正向反应 3 l
+正听得 3 i
+正吻 3 n
+正告 9 n
+正品 20 n
+正四面体 11 nz
+正回购 3 n
+正因如此 3 l
+正圆 3 z
+正圆形 3 n
+正在 5041 t
+正在流行 3 i
+正在连接 3 i
+正地貌 3 nz
+正坐 25 v
+正域 2 n
+正堂 37 z
+正声 3 d
+正声雅音 3 n
+正处 24 d
+正处级 10 b
+正多角形 3 ns
+正多边形 9 i
+正多面体 2 l
+正大 94 a
+正大光明 68 nz
+正大堂煌 3 i
+正大堂皇 3 i
+正大高明 3 nz
+正天丸 2 nr
+正太 25 nz
+正太路 2 nz
+正奥 3 a
+正好 2661 a
+正好高 3 a
+正如 187 v
+正始 23 v
+正始之音 4 i
+正姿 2 a
+正字 23 n
+正字标记 3 n
+正字法 6 n
+正学 3 n
+正宁 3 ns
+正宁县 3 ns
+正安 5 a
+正安县 3 ns
+正宗 513 nz
+正定 83 d
+正定县 13 ns
+正室 39 n
+正宫 18 n
+正容亢色 3 i
+正对着 3 l
+正对面 3 n
+正射 3 v
+正局级 3 b
+正屋 8 n
+正左方 3 nr
+正巧 72 a
+正巧会 3 n
+正巧在 3 i
+正巧是 3 i
+正巧有 3 i
+正己烷 3 nz
+正席 3 n
+正常 5860 d
+正常人 231 n
+正常值 51 n
+正常化 154 vn
+正常式 3 b
+正常性 3 b
+正常率 2 n
+正常者 6 n
+正平 10 a
+正座 6 n
+正开 3 ad
+正开着 3 l
+正式 9212 ad
+正式化 3 v
+正式工 6 n
+正式照会 3 l
+正式版 3 v
+正弦 117 n
+正弦曲线 2 n
+正弦波 3 n
+正弦规 3 n
+正当 2182 a
+正当中 15 v
+正当关系 3 l
+正当合理 3 a
+正当年 9 t
+正当性 22 n
+正当权利 3 nz
+正当权益 3 l
+正当理由 3 l
+正当程序 3 l
+正当竞争 3 l
+正当行为 3 v
+正当要求 3 l
+正当防卫 33 l
+正待 3 v
+正律 2 n
+正德 355 t
+正心 3 a
+正心拱 3 nr
+正心诚意 7 i
+正忙 3 d
+正忙着 3 l
+正念 3 n
+正态分布 54 n
+正态曲线 3 n
+正思 3 a
+正急 3 a
+正愁 3 a
+正房 47 n
+正手 41 d
+正扭 3 a
+正投影 6 i
+正指数 3 n
+正据 3 n
+正排 3 v
+正教 123 nz
+正数 37 n
+正整数 3 n
+正文 1435 nz
+正断层 3 n
+正方 168 n
+正方体 5 n
+正方形 81 n
+正日 21 t
+正旦 65 d
+正时 3 t
+正旺 10 a
+正明 3 a
+正明公道 3 n
+正是 9307 d
+正是如此 3 l
+正智 2 a
+正月 681 t
+正月初 10 t
+正月初一 46 t
+正月初七 9 t
+正月初三 3 t
+正月初二 13 t
+正月初五 9 t
+正月初十 4 t
+正月十五 5 nz
+正有此意 3 i
+正朔 6 ns
+正期 3 t
+正期班 3 n
+正期生 3 n
+正本 48 a
+正本求源 3 n
+正本清源 25 n
+正本澄源 3 nr
+正来 3 t
+正极 49 ad
+正果 32 n
+正柱 2 n
+正根 3 nz
+正根系 3 nz
+正格 3 ad
+正桥 962 n
+正梁 4 n
+正梳妆 3 nr
+正楷 18 n
+正欢 3 v
+正正 3 d
+正正之旗 3 nr
+正正堂堂 3 z
+正正好好 3 z
+正正当当 2 z
+正正气气 3 i
+正正确确 3 d
+正正经经 20 nz
+正步 10 d
+正步走 3 l
+正殿 379 n
+正比 366 z
+正比例 8 n
+正气 319 n
+正气凛然 16 i
+正气歌 13 n
+正气水 3 n
+正氢 3 n
+正治 3 v
+正沿 7 n
+正法 31 n
+正法直度 3 l
+正法眼藏 3 l
+正注 3 v
+正洗 3 v
+正派 242 n
+正派人 15 n
+正浓 3 z
+正源 6 n
+正火 13 a
+正点 28 n
+正点率 3 n
+正热 3 a
+正然 2 ad
+正燃法 3 n
+正片 5 n
+正版 253 v
+正版书 3 n
+正版率 4 n
+正版碟 3 n
+正版软件 3 n
+正牌 17 n
+正犯 3 v
+正班 3 v
+正理 61 a
+正理平治 3 n
+正琢磨 3 v
+正生 3 v
+正用 3 v
+正田 3 nz
+正电 86 n
+正电子 70 n
+正电极 3 n
+正电流 3 n
+正电荷 76 n
+正畸 3 v
+正畸力 3 i
+正盐 6 n
+正盛 2 a
+正直 535 d
+正直无私 3 i
+正直无邪 3 i
+正直者 2 n
+正相反 3 i
+正眼 3 d
+正着 97 v
+正确 6167 ad
+正确区分 3 n
+正确处理 3 n
+正确对待 3 n
+正确度 3 n
+正确引导 3 n
+正确态度 3 n
+正确性 120 n
+正确方向 3 n
+正确率 38 n
+正确理解 3 n
+正确看待 3 v
+正确认识 3 l
+正确路线 3 n
+正确轨道 3 n
+正碰 3 v
+正碳酸盐 3 nz
+正离子 79 n
+正科 3 nz
+正科级 3 l
+正税 3 n
+正章 3 n
+正等待 3 i
+正紧 3 d
+正线 16 n
+正经 432 d
+正经事 65 n
+正经事儿 3 n
+正经人 24 n
+正经八百 14 nz
+正经话 25 n
+正经货 2 n
+正经起来 3 l
+正统 765 n
+正统主义 3 n
+正统思想 3 n
+正统性 3 n
+正统派 51 n
+正统观念 3 n
+正编 13 v
+正考父 4 n
+正而八经 3 i
+正职 42 v
+正联 3 ns
+正脊 3 n
+正色 260 n
+正色危言 3 l
+正色厉声 3 i
+正色敢言 3 l
+正色片 3 n
+正色直绳 3 n
+正色直言 3 i
+正色立朝 3 n
+正茬 3 n
+正营 3 b
+正蓝旗 165 nr
+正行 3 v
+正街 8 n
+正襟危坐 60 i
+正西 29 ns
+正要 2033 a
+正规 759 a
+正规交叉 3 n
+正规军 168 n
+正规军队 3 nt
+正规化 164 b
+正规化子 3 l
+正规变换 3 l
+正规战 7 b
+正规方法 3 b
+正规渠道 3 i
+正规部队 3 n
+正规锥 3 n
+正视 326 v
+正视图 3 n
+正视绳行 3 n
+正觉 34 d
+正角儿 2 n
+正解 3 v
+正言 3 n
+正言不讳 3 i
+正言厉色 10 i
+正言厉颜 3 i
+正言直谏 3 i
+正论 7 n
+正词法 11 n
+正试图 3 n
+正话 22 n
+正该 3 v
+正误 16 n
+正误法 3 n
+正误表 3 n
+正误题 3 n
+正诱因 3 nz
+正说 577 v
+正课 3 v
+正象 3 n
+正负 57 v
+正负号 3 n
+正负得负 3 l
+正负数 3 n
+正负极 3 n
+正负电子 45 n
+正赶上 3 i
+正路 27 n
+正身 26 v
+正身明法 3 i
+正身清心 3 i
+正身率下 3 l
+正轨 26 b
+正轴 3 n
+正选赛 4 n
+正途 46 d
+正逢 42 v
+正道 154 v
+正邪 57 a
+正酣 72 z
+正键 3 n
+正镶白旗 2 nr
+正长岩 27 nr
+正长石 16 nr
+正门 2470 d
+正门口 3 n
+正间房 3 n
+正阳 49 ns
+正阳县 5 ns
+正阳门 2258 ns
+正隆 15 t
+正雄 15 n
+正面 1678 ad
+正面交锋 3 n
+正面人物 17 l
+正面图 3 n
+正面战场 3 n
+正面攻击 3 i
+正面教育 3 l
+正音 14 n
+正音法 3 n
+正音班 3 n
+正项 3 b
+正颌学 3 n
+正题 78 n
+正颜厉色 6 i
+正餐 27 n
+正验证 3 n
+正骨 34 n
+正骨科 3 nz
+正黄旗 48 n
+正黑 3 z
+正默 2 a
+正龙 3 nz
+此 41979 zg
+此一时 10 c
+此一时彼 3 i
+此一时彼一时 15 i
+此中三昧 3 i
+此为 3 c
+此举 1015 r
+此之谓 3 l
+此书 434 r
+此事 3171 r
+此事体大 3 i
+此人 2424 r
+此伏彼起 34 i
+此例 22 mq
+此信 39 r
+此公 22 r
+此刻 3271 r
+此前 1242 t
+此剧 45 r
+此动彼应 3 l
+此卡 2 r
+此参数 2 l
+此发彼应 3 i
+此后 4276 c
+此君 3 r
+此呼彼应 3 i
+此唱彼和 3 i
+此地 913 r
+此地无银三百两 19 i
+此地此时 3 c
+此基础 17 l
+此处 1727 r
+此外 9832 c
+此对应 2 l
+此岸 3 s
+此帖 3 v
+此役 152 r
+此恨 3 v
+此恨绵绵 3 l
+此情 95 r
+此情可待 3 i
+此情此景 52 i
+此战 121 r
+此文 112 r
+此时 8381 c
+此时此刻 206 l
+此时此地 3 l
+此景 3 nz
+此曲 3 v
+此条 12 r
+此案 233 r
+此次 3529 r
+此款 3 r
+此段 3 t
+此法 321 r
+此消彼长 23 i
+此片 7 r
+此物 207 r
+此物彼志 3 i
+此理 138 r
+此生 146 t
+此界彼疆 3 l
+此番 3 t
+此疆尔界 3 nz
+此病 78 r
+此种 321 r
+此笔 3 r
+此等 158 r
+此类 788 r
+此类情况 3 l
+此致 9 c
+此致敬礼 3 i
+此节 3 t
+此行 274 r
+此言 538 c
+此言差矣 3 i
+此话 260 r
+此谓 3 l
+此谙 3 v
+此起彼伏 295 i
+此起彼落 52 i
+此路 3 r
+此路不通 11 l
+此辈 3 r
+此邮 3 v
+此钟 3 mq
+此键 3 nz
+此问彼难 3 i
+此间 1076 t
+此间人士 3 l
+此际 33 nz
+此项 282 r
+此项工作 3 l
+此风 26 r
+步 4285 n
+步于庭 2 nr
+步云履 5 nr
+步云山 4 nr
+步人后尘 2 i
+步伐 1163 n
+步入 507 n
+步入正轨 3 i
+步兵 1966 n
+步兵团 85 n
+步兵师 239 n
+步兵排 3 n
+步兵旅 100 n
+步兵营 94 nr
+步兵连 3 nr
+步兵队 3 n
+步其后尘 3 i
+步军 33 n
+步军先 3 nr
+步军司 6 n
+步军太 2 nr
+步军统领 3 n
+步军饶 2 nr
+步出 67 v
+步向前 2 nr
+步哨 2 n
+步唯艰 2 l
+步天地 6 n
+步奏官 2 n
+步奔 6 v
+步子 261 n
+步寻声 2 i
+步履 145 nr
+步履维艰 24 l
+步履艰难 21 i
+步履蹒跚 12 l
+步师 9 n
+步幅 9 n
+步度根 12 nz
+步廊 3 n
+步弓 11 nz
+步态 43 n
+步惊云 3 nr
+步战车 33 n
+步数 8 n
+步斗踏罡 3 n
+步日耶 3 nr
+步月登云 3 nr
+步枪 1009 n
+步枪兵 3 n
+步枪团 3 n
+步枪射击 3 n
+步桥 3 n
+步棋 9 n
+步榴 2 n
+步步 236 n
+步步为营 47 l
+步步小心 3 l
+步步惊魂 3 i
+步步登高 3 nr
+步步莲花 3 n
+步步进逼 3 v
+步步通 3 nz
+步步高 34 nr
+步步高升 3 nr
+步武林 2 nr
+步法 108 n
+步测 3 v
+步测法 3 n
+步炮 10 n
+步犁 3 nr
+步田地 9 nz
+步甲 2 n
+步甲科 5 nz
+步石 3 n
+步程计 3 n
+步童贯 2 nr
+步线行针 3 n
+步罡踏斗 3 i
+步营 6 n
+步行 651 n
+步行机 6 n
+步行者 64 n
+步行者队 3 n
+步行虫 3 n
+步行街 37 n
+步诗行 3 nr
+步话机 13 n
+步调 49 n
+步调一致 15 i
+步谈机 17 n
+步足 3 v
+步跃 2 v
+步辇 3 n
+步辇图 16 nz
+步达生 3 nr
+步进 41 v
+步进庄 2 nr
+步进式 2 n
+步速 3 n
+步道 10 n
+步长 29 n
+步队 3 n
+步险棋 2 n
+步雪履穿 3 i
+步非烟 3 nr
+步鞋 3 n
+步韵 3 n
+步频 3 n
+步骑军 2 nr
+步骑舟 2 nr
+步骤 854 n
+步鲁霉素 3 n
+武 5241 n
+武丁 160 nr
+武丁之 2 nr
+武丁元 3 nr
+武丁至 7 nr
+武三信 19 nr
+武三叔 2 nr
+武三娘 61 nr
+武三娘子 2 nr
+武三思 4 nr
+武三爷 8 nr
+武三通 135 nr
+武不善作 3 l
+武不武 3 nr
+武丑 11 nr
+武东 2 ns
+武东和 2 nr
+武中元 3 nr
+武举 24 nr
+武乃文 3 nr
+武义 30 n
+武义县 7 ns
+武之人 3 nr
+武之围 2 nr
+武之士 7 nr
+武之望 3 nr
+武之期 2 nr
+武之迹 2 nr
+武乙赐 2 nr
+武九姓 12 nr
+武习艺 3 n
+武乡 16 ns
+武乡侯 11 nr
+武乡县 18 ns
+武二哥 4 nr
+武二花 2 nr
+武二郎 4 nr
+武人 122 n
+武仁盈 3 nr
+武仙座 28 nr
+武代李 2 nr
+武会 22 n
+武会友 10 n
+武侠 81 nr
+武侠书 3 n
+武侠剧 3 n
+武侠小说 135 l
+武侠屋 3 n
+武侠片 13 n
+武侯 52 nr
+武侯区 4 nr
+武侯新书 3 nr
+武侯曾 2 nr
+武侯祠 38 nr
+武侯织 2 nr
+武侯藏 2 nr
+武信侯 2 nr
+武信君 3 nr
+武修和尚 2 nr
+武修文 440 nr
+武候祠 2 nr
+武偃文修 3 nrt
+武元恒 2 nr
+武元甲 4 nr
+武元英 3 nr
+武元衡 12 nr
+武兄弟 3 nr
+武公初 3 nr
+武公子 2 nr
+武关 45 ns
+武关之 2 nr
+武关寨 2 nr
+武关往 4 l
+武兴 7 ns
+武冈 16 ns
+武冈县 3 ns
+武冈市 3 ns
+武再世 2 nr
+武则天 249 nr
+武剧 3 n
+武力 1263 n
+武力威胁 3 n
+武功 7887 nr
+武功国小 3 l
+武功山 20 nr
+武卫 42 nr
+武卫军 15 nr
+武卫前 15 nr
+武卫右 17 nr
+武卫将军 4 nr
+武卫左 4 nr
+武卫政 5 nr
+武厅前 2 nr
+武口 5 ns
+武古城 2 ns
+武后光 2 nr
+武周山 2 nr
+武周时 2 n
+武和平 3 nr
+武和鹿 2 nr
+武哥哥 9 nr
+武商 2 n
+武器 8812 n
+武器专家 3 l
+武器化 2 l
+武器展 2 nt
+武器库 69 n
+武器店 3 n
+武器弹药 3 n
+武器精良 3 nr
+武器系统 3 l
+武器装备 3 l
+武圣 4 ns
+武圣真 3 nr
+武场 15 n
+武坛 13 n
+武垣 2 ns
+武城 13 ns
+武城县 3 ns
+武城尹 2 nr
+武城山 4 ns
+武城西 2 ns
+武培真 2 nr
+武士 1453 n
+武士刀 10 nr
+武士村 3 nr
+武士道 45 nr
+武备 312 n
+武备学堂 3 n
+武大 336 j
+武大伟 5 nr
+武大帝 2 nr
+武大郎 3 nr
+武天子 3 nr
+武天敏 2 nr
+武天皇 7 nr
+武太后 3 nr
+武夫 72 nr
+武夷 57 ns
+武夷山 175 ns
+武夷山市 24 ns
+武夷山脉 49 ns
+武夷工贸 3 nt
+武夷明珠 3 nr
+武夷茶 3 nr
+武夷路 3 ns
+武威 188 nr
+武威市 8 ns
+武娘子 53 nr
+武媚娘 3 nr
+武孝义 14 nr
+武学 192 n
+武学上 2 l
+武学中 34 nr
+武学之 57 nr
+武学修 22 nr
+武学名 7 n
+武学图 2 nr
+武学大 8 nr
+武学大师 5 nt
+武学奇 8 nr
+武学家 6 n
+武学无 6 nr
+武学本 2 l
+武学正 17 nr
+武学深 8 nr
+武学甚 2 nr
+武学界 2 n
+武学秘 20 nr
+武学竟 2 nr
+武学精 9 nr
+武学绝 2 l
+武学而 2 nr
+武学自 2 nr
+武学至 3 nr
+武学谕 3 nr
+武学谱 2 nr
+武学越 2 nr
+武学门 2 n
+武学高 4 nr
+武宁 26 nr
+武宁县 5 ns
+武宁路 3 ns
+武安 40 ns
+武安县 3 ns
+武安市 3 ns
+武宏全 2 nr
+武宗元 2 nr
+武宗卒 5 nr
+武宗命 2 nr
+武宗因 2 nr
+武宗子 9 nr
+武宗微 2 nr
+武宗才 2 nr
+武宗旧 2 nr
+武宗时 11 nr
+武宗朝 3 nr
+武宗朱 2 nr
+武宗权 2 nr
+武宗皇帝 23 nr
+武宗自 2 nr
+武宗至 4 nr
+武宗藩 2 nr
+武官 634 n
+武官处 3 l
+武定 18 n
+武定之 3 nr
+武定县 6 ns
+武定桥 5 nr
+武定远 16 nr
+武定门 3 n
+武宝智 2 nr
+武宣 3 nr
+武宣县 3 nr
+武宫正树 3 nr
+武家 9 n
+武家兄弟 16 nr
+武家坡 4 nr
+武家诸 2 nr
+武家那 2 nr
+武将 509 n
+武小武 2 nr
+武小锋 3 nr
+武少爷 2 nr
+武尔泽 3 nr
+武山 16 ns
+武山县 3 ns
+武岭 10 ns
+武崇训 11 nr
+武川 42 ns
+武川县 4 ns
+武川活 2 nr
+武川甩 2 nr
+武川西 13 ns
+武川镇 2 ns
+武州 2 ns
+武工 3 n
+武工队 25 nt
+武师 93 n
+武帝乃 5 nr
+武帝元 23 nr
+武帝初 9 nr
+武帝升 3 nr
+武帝厚 2 nr
+武帝命 2 nr
+武帝天 4 nr
+武帝太 15 nr
+武帝妻 2 nr
+武帝官 2 nr
+武帝封 2 nr
+武帝平 2 nr
+武帝建 34 nr
+武帝开 5 nr
+武帝征 2 nr
+武帝想 2 nr
+武帝授 3 nr
+武帝时 3 nr
+武帝欲 5 nr
+武帝永 2 nr
+武帝禁 2 nr
+武帝纪 4 nr
+武帝西 2 ns
+武帝言 2 nr
+武帝遂 2 nr
+武帝闻 5 nr
+武平 12 nr
+武平侯 2 nr
+武平县 3 ns
+武庄主 3 nr
+武库 49 n
+武库司 5 nr
+武库舰 6 nr
+武庙 19 ns
+武庚北 2 nr
+武延基 4 nr
+武建 3 ns
+武建武 4 nr
+武强 14 nr
+武强县 3 ns
+武当 222 n
+武当七侠 3 nr
+武当剑 6 nr
+武当山 3316 ns
+武当山风景区 515 ns
+武当掌 7 nr
+武当派 3 nr
+武当长 2 v
+武当鼎 2 nr
+武得全 2 nr
+武德修养 3 nr
+武惠良 64 nr
+武愈斗 2 nr
+武戏 32 n
+武成帝 5 nr
+武打 48 v
+武打戏 2 l
+武打片 9 l
+武承嗣 5 nr
+武技 23 n
+武拒统 8 l
+武指 3 n
+武政权 2 n
+武敦 2 ns
+武敦儒 256 nr
+武斗 130 nr
+武断 63 v
+武断专横 3 l
+武断乡曲 3 ns
+武旦 7 ns
+武早喝 2 l
+武昌 5077 ns
+武昌剩竹 3 nr
+武昌区 2573 ns
+武昌县 8 ns
+武昌站 256 nr
+武昌起义 499 l
+武昌路 3 nr
+武昌鱼 291 nr
+武昭仪 8 nr
+武曌 3 vn
+武曲星 2 nr
+武术 577 n
+武术协会 2 nt
+武术场地 3 n
+武术学校 3 nt
+武术家 6 n
+武术指导 3 n
+武术比赛 3 ns
+武术用品 3 n
+武术界 4 n
+武术竞赛 3 nr
+武术赛 2 nr
+武术队 13 nt
+武术院 3 nt
+武术馆 5 nt
+武松 1157 nr
+武松打虎 3 nr
+武林 2204 nr
+武林中 221 nr
+武林大会 3 nt
+武林高手 3 nr
+武校 4 n
+武校尉 2 nr
+武梁祠 4 nr
+武毅伯 3 nr
+武毅军 3 nr
+武毅谋 3 nr
+武比 5 j
+武氏兄弟 62 nr
+武氏宗 3 nr
+武氏家族 4 nr
+武氏昆 2 nr
+武氏石 3 nr
+武氏非 2 nr
+武水 2 ns
+武汉 24302 ns
+武汉三镇 3 ns
+武汉东湖开发区 2 nt
+武汉东湖新技术开发区 256 nt
+武汉东湖高新技术开发区 256 nt
+武汉中院 3 nt
+武汉关 3 ns
+武汉出版社 2 nt
+武汉协和医院 2 nt
+武汉大学 691 nt
+武汉大学商学院 3 nt
+武汉市 22783 ns
+武汉市公安局 4 nt
+武汉市委 2 nt
+武汉热线 3 nz
+武汉理工 3 n
+武汉理工大学 527 nt
+武汉白沙洲长江大桥 34 ns
+武汉站 256 nr
+武汉经济技术开发区 256 nt
+武汉职业技术学院 257 l
+武汉邮科院 2 nt
+武汉钢铁公司 5 nt
+武汉长江大桥 94 ns
+武汉队 272 nt
+武江区 3 ns
+武海波 8 nr
+武清 39 nr
+武清伯 167 nr
+武清侯 30 nr
+武清区 3 ns
+武清县 21 ns
+武溪 2 ns
+武满彻 2 nr
+武潘安 3 nr
+武火 10 n
+武灵王 6 nr
+武烈河 6 nr
+武烈皇帝 3 nr
+武爵武任 3 nr
+武状元 2 nr
+武王伐 49 nr
+武王伐纣 3 n
+武王克 18 nr
+武王命 3 nr
+武王弟 2 nr
+武王时 4 nr
+武王死 12 nr
+武王灭 18 nr
+武王素 3 nr
+武珞路 3 vn
+武生 53 nr
+武田家 3 l
+武田铁矢 3 nr
+武界 3 n
+武略 23 n
+武當 3 vn
+武疆氏 2 nr
+武皇帝 14 nr
+武相争 2 nr
+武相斗 2 nr
+武破楚 2 nr
+武神 2 n
+武科举 2 nr
+武穴 22 n
+武穴市 264 ns
+武立天 3 nr
+武系 8 n
+武纪 4 n
+武经 22 n
+武经七 27 nr
+武经总要 3 l
+武统 7 n
+武耀威 2 nr
+武老二 2 nr
+武老大 16 nr
+武者 18 n
+武职 223 n
+武胜 7 nr
+武胜关 7 nr
+武胜军 5 nr
+武胜县 3 ns
+武胜路 3 n
+武胜门 2 nr
+武能安 2 nr
+武脸如 2 nr
+武腾兰 3 nr
+武臣常 2 nr
+武舞 5 n
+武艺 1019 n
+武艺超群 3 nr
+武艺高强 3 nr
+武若不 2 l
+武英殿 286 nr
+武英门 34 nr
+武荣州 3 nr
+武蒂维 2 nr
+武藏 2 ns
+武藏野 3 ns
+武藤兰 3 nr
+武藤敏郎 3 nr
+武行 75 j
+武装 4577 n
+武装人员 3 l
+武装侵略 3 n
+武装入侵 3 nr
+武装冲突 3 n
+武装到牙齿 17 l
+武装力量 1830 l
+武装头脑 3 l
+武装带 21 n
+武装战斗 3 l
+武装挑衅 3 v
+武装斗争 3 l
+武装泅渡 3 vn
+武装突击 3 n
+武装警察 3 l
+武装起义 478 l
+武装部 28 nt
+武装部长 11 l
+武装部队 323 n
+武装集团 3 nt
+武装革命 3 l
+武见敬 4 nr
+武观 4 n
+武警 720 j
+武警北京总队 5 nt
+武警官兵 3 nr
+武警宿舍 3 n
+武警总部 20 nt
+武警战士 3 n
+武警新疆总队 3 nt
+武警部队 332 nt
+武论剑 3 l
+武论艺 2 n
+武诚明 2 nr
+武谋独 3 nr
+武财神 3 nr
+武贲郎 3 nr
+武轻文 2 nr
+武进 45 nr
+武进区 3 nr
+武进县 22 nr
+武进士 133 nr
+武进士徐 128 nr
+武进士梅 128 nr
+武进市 3 ns
+武连元 257 nr
+武连生 4 nr
+武选主 3 n
+武选司 10 n
+武道家 3 l
+武道进 3 nr
+武邑 10 nr
+武邑县 2 ns
+武部 5 n
+武都 56 ns
+武都东 7 ns
+武都县 10 ns
+武都郡 12 nr
+武里府 4 nr
+武里河 2 ns
+武钢股份 5 nz
+武铭夫 16 nr
+武长剑 2 nr
+武门 3 ns
+武阳 20 ns
+武阳郡 3 nr
+武阳镇 3 ns
+武陟 11 nr
+武陟县 13 ns
+武陟至 2 nr
+武陟西 2 ns
+武陵 593 ns
+武陵农场 3 n
+武陵区 3 ns
+武陵山 540 ns
+武陵春 3 nr
+武陵源 24 nr
+武陵源区 2 ns
+武隆 2 nr
+武隆县 6 ns
+武雪龙 3 nr
+武青婴 50 nr
+武韬 2 nrfg
+武馆 6 n
+武魂 3 n
+武鸣 8 nr
+武鸣县 13 ns
+武麦拉 3 nr
+武麻 256 n
+武鼓 2 n
+歧 129 v
+歧义 24 n
+歧出 3 v
+歧化 3 v
+歧化终止 3 n
+歧化选择 3 n
+歧化酶 5 nz
+歧口 2 n
+歧山 3 n
+歧山县 3 n
+歧异 48 n
+歧管 3 v
+歧见 7 v
+歧视 495 v
+歧视性 24 n
+歧议 3 n
+歧路 33 n
+歧路之羊 3 n
+歧路亡羊 3 n
+歧路徘徊 3 v
+歧途 50 n
+歧道 3 v
+歧黄 6 n
+歩 3 zg
+歪 1253 v
+歪七扭八 3 i
+歪不横楞 3 v
+歪主意 6 n
+歪倒 3 v
+歪偏 3 v
+歪八竖八 3 i
+歪写 3 v
+歪到 3 v
+歪向 3 v
+歪嘴 3 v
+歪嘴和尚 3 n
+歪处 3 v
+歪头 25 v
+歪带 3 n
+歪心邪意 3 i
+歪念头 3 n
+歪成 3 v
+歪戴 3 v
+歪才 3 n
+歪打 3 v
+歪打正着 22 i
+歪掉 3 v
+歪斜 75 v
+歪曲 198 z
+歪曲事实 3 i
+歪歪 3 z
+歪歪地 3 z
+歪歪扭扭 39 z
+歪歪斜斜 85 z
+歪点子 7 n
+歪理 37 v
+歪理邪说 3 i
+歪眼 3 v
+歪着头 3 v
+歪缠 3 v
+歪脑筋 3 n
+歪诗 10 n
+歪谈乱道 3 i
+歪路 11 n
+歪过 3 v
+歪过去 3 i
+歪过来 3 i
+歪道 6 v
+歪门 3 n
+歪门邪道 19 i
+歪风 32 n
+歪风邪气 15 i
+歪鼻 3 v
+歭 3 zg
+歰 3 zg
+歲 5 zg
+歳 2 zg
+歷 4 zg
+歸 3 zg
+歹 95 n
+歹事 3 n
+歹人 101 n
+歹命 3 n
+歹命人 3 n
+歹徒 156 n
+歹心 25 n
+歹念 10 n
+歹意 55 n
+歹毒 157 n
+歹话 3 n
+歹路 3 n
+死 29983 v
+死不了 107 l
+死不休 3 i
+死不带去 3 i
+死不悔改 5 i
+死不承认 3 i
+死不改悔 3 l
+死不旋踵 3 i
+死不明 3 i
+死不瞑目 74 i
+死不要脸 3 l
+死不认账 5 l
+死不认错 3 i
+死不足惜 23 i
+死不降 3 v
+死且不朽 3 i
+死丫头 3 n
+死中求活 14 i
+死中求生 8 i
+死乞白赖 12 i
+死乞百赖 3 i
+死也不放 6 l
+死也瞑目 3 i
+死了心 3 i
+死于 3 v
+死于安乐 3 i
+死于非命 139 i
+死亡 3335 v
+死亡之屋 3 i
+死亡事故 3 i
+死亡威胁 3 n
+死亡数 7 n
+死亡无日 3 i
+死亡枕藉 3 i
+死亡棺材 3 i
+死亡率 516 n
+死亡线 43 n
+死亡者 15 n
+死亡证 3 n
+死亡证书 3 n
+死产 3 n
+死人城 4 n
+死人头 3 n
+死仗 3 v
+死会 3 n
+死伤 578 v
+死伤不计 3 i
+死伤无数 3 i
+死伤枕藉 3 i
+死伤者 11 n
+死体 11 n
+死信 6 v
+死光 62 n
+死光光 4 n
+死光抢 3 j
+死党 88 n
+死刑 1333 v
+死刑犯 22 i
+死别 3 d
+死别生离 3 i
+死制动 3 l
+死前遗言 3 i
+死力 35 n
+死劲 3 v
+死劲儿 2 d
+死区 5 n
+死去 1154 v
+死去活来 133 l
+死友 3 n
+死变迁 3 i
+死后多年 3 i
+死告活央 3 n
+死命 163 n
+死命挣扎 3 i
+死咸 3 v
+死哦 3 v
+死啃 3 l
+死囚 308 n
+死囚牢 13 n
+死因 137 n
+死地 196 n
+死地求生 3 i
+死城 21 n
+死士 3 n
+死声咷气 3 z
+死声活气 3 i
+死声淘气 3 l
+死契 2 n
+死字 3 n
+死守 260 v
+死守江山 3 i
+死守阵地 3 i
+死定了 3 l
+死寂 61 v
+死对头 74 n
+死就死 3 l
+死尸 406 n
+死局 3 n
+死工夫 3 n
+死巷 3 n
+死得其所 32 i
+死循环 3 i
+死心 99 n
+死心塌地 130 i
+死心搭地 3 i
+死心眼 21 i
+死心眼儿 11 l
+死心落地 3 i
+死心踏地 2 i
+死忠 3 v
+死怕 3 v
+死性 3 n
+死性不改 3 v
+死慢 3 d
+死或生 3 l
+死战 199 v
+死战到底 3 l
+死扣 11 n
+死扣儿 3 n
+死抠 3 l
+死拉活拽 3 l
+死拼 3 v
+死挨 3 z
+死挺挺 3 z
+死掉 3 v
+死撑 3 v
+死敌 100 v
+死文字 3 n
+死於非命 2 i
+死无全尸 3 i
+死无对证 33 i
+死无葬身 3 i
+死无葬身之地 84 i
+死有余僇 3 n
+死有余罪 3 l
+死有余诛 3 i
+死有余责 3 l
+死有余辜 63 l
+死期 163 n
+死期临近 3 l
+死机 13 n
+死板 43 n
+死板板 7 n
+死标白缠 3 n
+死样活气 3 l
+死棋 16 n
+死模活样 3 l
+死欲速朽 3 i
+死死 164 v
+死死地 113 z
+死死的 50 z
+死气沈沈 3 ns
+死气沉沉 64 z
+死水 45 n
+死水一潭 4 i
+死求白赖 3 i
+死求百赖 3 i
+死沉 13 z
+死法 78 n
+死活 455 v
+死海 78 n
+死火山 56 i
+死灭 3 v
+死灰 86 n
+死灰复然 3 i
+死灰复燃 39 i
+死灰复燎 3 i
+死灰槁木 3 i
+死灵 3 n
+死点 3 n
+死牢 3 v
+死物 19 n
+死狐狸 3 n
+死猪不怕开水烫 5 l
+死球 3 n
+死理 36 n
+死生 3 v
+死生存亡 3 i
+死生有命 3 i
+死生荣辱 3 i
+死症 2 n
+死的死 3 l
+死皮赖脸 16 i
+死眉瞪眼 3 i
+死硬 21 a
+死硬派 4 n
+死磨硬泡 3 l
+死神 168 n
+死穴 3 n
+死结 53 v
+死缓 41 v
+死缠 3 v
+死缠不放 3 i
+死缠烂打 3 i
+死罪 187 v
+死罪可免 3 l
+死罪虽免 3 l
+死翘翘 3 n
+死老虎 9 i
+死者 1070 n
+死者家属 3 l
+死而不僵 10 i
+死而不悔 3 i
+死而不朽 3 i
+死而后已 41 i
+死而复活 3 i
+死而复生 12 i
+死而复苏 3 v
+死而无怨 33 i
+死而无悔 3 i
+死而无憾 3 i
+死耗 3 v
+死耗子 3 n
+死背 8 n
+死胎 53 n
+死胡同 52 l
+死脑筋 15 n
+死节 27 n
+死苗 3 n
+死行 3 v
+死衚衕 3 z
+死要面子 3 n
+死规矩 3 z
+死角 129 n
+死讯 99 n
+死记 12 n
+死记硬背 75 l
+死词 3 n
+死话活说 3 l
+死说活说 3 l
+死读书 3 n
+死谷 3 n
+死败涂地 3 i
+死账 3 v
+死路 18 n
+死路一条 83 l
+死里求生 4 i
+死里逃生 298 i
+死重泰山 3 i
+死链接 3 l
+死锁 3 v
+死门 3 n
+死难 182 n
+死难同胞 3 l
+死难者 27 n
+死面 2 n
+死顽固 3 i
+死马当作 3 i
+死马当活 3 i
+死马当活马医 11 i
+死骨更肉 3 i
+死鬼 75 n
+死魂灵 15 i
+死鸟 21 n
+死鸡 3 n
+歼 748 v
+歼一警百 3 n
+歼击 97 v
+歼击机 296 n
+歼商 3 n
+歼戮 3 v
+歼敌 499 v
+歼灭 747 v
+歼灭战 46 v
+殁 103 zg
+殁世不忘 3 v
+殂 12 g
+殃 61 vg
+殃及 54 v
+殃及无辜 3 i
+殃及池鱼 5 i
+殃咎 3 v
+殃国祸家 3 i
+殃国祸民 3 i
+殃毒 3 v
+殃民 3 v
+殄 22 g
+殄灭 3 i
+殆 59 v
+殆及 3 v
+殆尽 269 v
+殆无孑遗 3 v
+殆无虚日 3 ns
+殇 35 vg
+殉 303 v
+殉义忘生 3 n
+殉义忘身 3 n
+殉公忘己 3 n
+殉公灭私 3 n
+殉名 3 v
+殉国 214 n
+殉国忘家 3 n
+殉国忘己 3 n
+殉情 43 n
+殉情记 3 n
+殉教 3 v
+殉教者 3 n
+殉职 34 v
+殉职人员 3 n
+殉节 38 n
+殉葬 194 v
+殉葬品 26 n
+殉财 3 v
+殉身 3 v
+殉道 18 v
+殉道精神 3 n
+殉道者 25 n
+殉难 84 v
+殉难人员 3 n
+殉难者 10 n
+殊 566 d
+殊不知 195 i
+殊功 3 a
+殊功劲节 3 i
+殊勋 3 n
+殊勋异绩 3 v
+殊宠 3 v
+殊属 3 n
+殊属不当 3 l
+殊属不易 3 l
+殊异 3 a
+殊异于世 3 i
+殊形妙状 3 i
+殊形诡状 3 i
+殊技 3 n
+殊文 3 n
+殊方同致 3 i
+殊方异域 3 l
+殊方绝域 3 l
+殊死 440 v
+殊死战 4 i
+殊死搏斗 12 l
+殊涂同会 3 i
+殊涂同归 3 i
+殊涂同致 3 i
+殊深轸念 3 vn
+殊相 3 n
+殊礼 3 n
+殊胜 3 v
+殊致同归 3 i
+殊荣 200 v
+殊觉歉然 3 z
+殊言别语 3 i
+殊路同归 3 i
+殊途 3 n
+殊途同归 56 i
+殊遇 3 n
+殊难 3 n
+残 1391 n
+残丘 3 n
+残余 480 a
+残余分子 3 l
+残余囊肿 3 n
+残余物 11 l
+残余者 3 n
+残值 17 n
+残党 3 n
+残兵 69 n
+残兵败将 22 i
+残军败将 3 i
+残冬 12 v
+残冬腊月 3 l
+残剑 3 n
+残剩 3 v
+残匪 7 n
+残卷 3 n
+残品 3 n
+残喘 10 n
+残圭断璧 3 i
+残垒 3 n
+残垣断壁 7 i
+残垣破壁 3 i
+残垣败壁 3 i
+残基 3 n
+残墙断壁 3 i
+残夜 3 n
+残奥会 3 j
+残存 261 v
+残存本 3 l
+残存者 3 n
+残害 193 a
+残局 61 n
+残屑 5 n
+残山剩水 3 i
+残差 17 n
+残席 3 n
+残年 7 t
+残年余力 3 l
+残年晚景 3 n
+残年暮景 3 i
+残废 277 v
+残废人 16 n
+残废军人 3 n
+残废者 3 n
+残废证 2 n
+残弱 3 a
+残忍 432 a
+残忍度 3 l
+残念 3 n
+残损 15 v
+残效 3 a
+残敌 33 n
+残星明灭 3 i
+残春 3 n
+残晖 3 n
+残暑 3 v
+残暴 342 a
+残暴不仁 3 i
+残暴凶狠 3 i
+残更 3 v
+残月 40 t
+残本 3 a
+残杀 154 v
+残枝 3 n
+残株 3 n
+残根 3 n
+残梦 3 n
+残次 3 n
+残次品 3 n
+残次林 3 nz
+残毒 5 n
+残民以逞 3 i
+残民害物 3 n
+残民害理 3 n
+残汤剩菜 3 i
+残汤剩饭 3 i
+残油 3 n
+残渣 87 n
+残渣余孽 3 n
+残灯 3 n
+残灯末庙 3 n
+残炭 3 n
+残照 6 n
+残片 76 n
+残瓦 3 n
+残生 29 n
+残留 394 v
+残留因素 3 l
+残留影象 3 n
+残留物 35 n
+残留边带 3 n
+残留量 18 n
+残疾 662 n
+残疾人 922 n
+残疾人运动会 2 l
+残疾儿童 3 n
+残疾女 3 n
+残疾者 7 n
+残疾证 4 n
+残砖断瓦 3 i
+残砖碎瓦 3 i
+残破 248 v
+残积土 3 n
+残积层 3 n
+残积景观 3 n
+残积物 3 n
+残稿 3 n
+残章断简 3 i
+残篇 11 n
+残篇断简 3 i
+残红 3 n
+残编断简 3 n
+残编裂简 3 n
+残缺 153 a
+残缺不全 69 i
+残羹 6 n
+残羹冷炙 3 i
+残羹冷饭 7 l
+残羹剩汁 3 i
+残羹剩饭 13 i
+残而不废 3 i
+残联 47 n
+残肢 14 n
+残肴 3 n
+残花 8 n
+残花败柳 3 i
+残茬 3 n
+残茶剩饭 3 i
+残虐 8 v
+残败 11 v
+残货 3 n
+残贼 3 n
+残躯 3 n
+残运会 3 n
+残迹 42 n
+残遗种区 3 n
+残部 131 n
+残酒 3 n
+残酷 1382 a
+残酷性 22 n
+残酷无情 25 l
+残阳 23 n
+残障 4 v
+残障儿童 3 n
+残雪 24 n
+残页 3 n
+残饯 3 n
+残骇 3 a
+残骸 166 n
+残髓 3 n
+残髓炎 3 n
+殌 28 zg
+殏 29 zg
+殑 6399 zg
+殒 42 v
+殒命 36 v
+殒星 3 v
+殒没 3 v
+殒灭 4 v
+殒石 3 v
+殒落 3 v
+殒身 3 v
+殒身不恤 3 v
+殒身碎首 3 v
+殓 115 vg
+殔 3 zg
+殕 15 zg
+殖 471 n
+殖产 3 n
+殖吸虫 8 n
+殖民 1002 n
+殖民主义 307 n
+殖民主义者 226 n
+殖民军 73 n
+殖民化 8 n
+殖民地 1600 n
+殖民地化 9 n
+殖民政策 3 n
+殖民统治 3 n
+殖民者 642 n
+殗 27 zg
+殚 17 zg
+殚力 3 i
+殚心 3 i
+殚心竭力 3 i
+殚思极虑 3 i
+殚思竭虑 3 i
+殚智竭力 3 i
+殚精极虑 3 i
+殚精毕力 3 i
+殚精竭力 3 i
+殚精竭虑 59 i
+殚见洽闻 3 v
+殚诚毕虑 3 i
+殚谋戮力 3 i
+殚财竭力 3 i
+殛 23 g
+殝 2 zg
+殠 3 zg
+殡 40 n
+殡仪 4 n
+殡仪馆 47 n
+殡殓 10 v
+殡葬 589 v
+殡车 3 n
+殢 46 zg
+殢云尤雨 3 nr
+殢雨尤云 3 nr
+殣 39 zg
+殤 2 zg
+殦 5 zg
+殧 16 zg
+殨 3 zg
+殩 10 zg
+殪 4 g
+殫 78 zg
+殬 4 zg
+殭 11 zg
+殮 6 zg
+殰 11 zg
+殳 48 nr
+殴 159 v
+殴伤 5 v
+殴击 3 v
+殴打 150 v
+殴打成伤 3 v
+殴斗 21 v
+殴气 3 v
+殴辱 10 v
+段 23395 q
+段三娘 12 nr
+段世杰 3 nr
+段世玉 4 nr
+段业 7 n
+段业入 2 n
+段会宗 2 nr
+段位 20 n
+段位制 2 n
+段位赛 3 nr
+段儿书 2 nr
+段公子 70 nr
+段兴智 7 nr
+段冠华 3 nr
+段北坡 7 nr
+段南坡 5 nr
+段博格 2 nr
+段君毅 4 nr
+段大功 2 nr
+段大哥 5 nr
+段天德 103 nr
+段太公 5 nr
+段太尉 2 nr
+段子 132 nr
+段家 51 n
+段家剑 4 nr
+段家庄 2 nr
+段家生 14 nr
+段寿辉 4 nr
+段小子 2 nr
+段小楼 2 nr
+段干木 7 nr
+段廉义 5 nr
+段延庆 147 nr
+段建勋 7 nr
+段式 3 nr
+段录定 2 nr
+段德昌 3 nr
+段志敏 5 nr
+段志贤 3 nr
+段思平 10 nr
+段思思 256 nr
+段成式 2 nr
+段成荣 2 nr
+段振华 16 nr
+段接枝 2 nr
+段文昌 3 nr
+段时间 154 nr
+段春来 3 nr
+段景住 17 nr
+段智兴 10 nr
+段正坤 6 nr
+段正明 36 nr
+段正淳 739 nr
+段氏 69 nr
+段氏复 2 nr
+段氏威 2 nr
+段永基 29 nr
+段浩然 2 nr
+段玉芬 99 nr
+段玉裁 20 nr
+段王爷 6 nr
+段琪瑞 2 nr
+段皇爷 111 nr
+段相公 3 nr
+段祀谱 2 nr
+段祺瑞 831 nr
+段程序 3 n
+段绍伯 15 nr
+段网恋 2 nr
+段羡菊 2 nr
+段老大 2 nr
+段聚醚 2 nr
+段自北 2 nr
+段落 193 n
+段落分明 3 nr
+段落标记 3 n
+段观华 3 nr
+段誉东 2 nr
+段誉举 3 nr
+段誉之 5 nr
+段誉伸 7 nr
+段誉依 3 nr
+段誉便 3 nr
+段誉全 5 nr
+段誉原 2 nr
+段誉右 2 nr
+段誉叹 20 nr
+段誉吁 2 nr
+段誉吓 5 nr
+段誉听 18 nr
+段誉呆 2 nr
+段誉喜 11 nr
+段誉喝 3 nr
+段誉嘻 2 nr
+段誉大 20 nr
+段誉奇 12 nr
+段誉奔 2 nr
+段誉学 2 n
+段誉微微 5 nr
+段誉心 54 nr
+段誉忍 2 nr
+段誉忙 6 nr
+段誉忽 3 nr
+段誉怒 10 nr
+段誉情 3 n
+段誉惊 6 nr
+段誉想 2 nr
+段誉才 2 nr
+段誉扶 3 nr
+段誉抢 2 nr
+段誉抱 5 nr
+段誉拉 2 nr
+段誉招 4 nr
+段誉摇 7 nr
+段誉摸 2 nr
+段誉早 2 nr
+段誉服 4 nr
+段誉未 2 nr
+段誉本 4 nr
+段誉柔 3 nr
+段誉欲 2 nr
+段誉正 4 nr
+段誉漫 2 nr
+段誉登 2 nr
+段誉相 2 nr
+段誉知 2 nr
+段誉站 4 nr
+段誉笑 54 nr
+段誉素 2 nr
+段誉耳 4 nr
+段誉自 5 nr
+段誉若 3 nr
+段誉行 2 nr
+段誉见 56 nr
+段誉觉 3 nr
+段誉记 2 nr
+段誉赞 3 nr
+段誉越 2 nr
+段誉身 15 n
+段誉转 7 nr
+段誉轻 4 nr
+段誉连 7 nr
+段誉那 3 nr
+段誉面 5 n
+段誉飞 2 nr
+段距离 5 n
+段迎原 2 nr
+段长 20 n
+段长度 2 nr
+段飞离 4 nr
+段高源 2 nr
+段鹏举 5 nr
+殷 643 nr
+殷东方 5 nr
+殷丞相 5 nr
+殷之光 2 nr
+殷之常 2 nr
+殷二哥 5 nr
+殷代 19 t
+殷代甲 2 nr
+殷仲堪 6 nr
+殷仲翔 52 nr
+殷八师 9 nr
+殷六侠 29 nr
+殷六叔 29 nr
+殷兴良 2 nr
+殷切 99 a
+殷切希望 3 nr
+殷切期望 3 nr
+殷利亨 2 nr
+殷勤 332 nr
+殷吉与 3 nr
+殷吉微微 2 nr
+殷吉笑 2 nr
+殷吉见 2 nr
+殷周金 3 nr
+殷商 124 nr
+殷商余 3 nr
+殷商本 2 nr
+殷堂主 2 nr
+殷墟 194 n
+殷士儋 39 nr
+殷士瞻 6 nr
+殷大哥 9 nr
+殷大士 39 nr
+殷大炳 6 nr
+殷大爷 2 nr
+殷天 17 t
+殷天正 164 nr
+殷天蔽日 3 i
+殷天赐 3 nr
+殷天锡 37 nr
+殷太白 14 nr
+殷夫人 2 nr
+殷姑娘 18 nr
+殷宏章 2 nr
+殷实 89 nr
+殷家 6 n
+殷家洲 512 nr
+殷富 11 nr
+殷富者 3 nr
+殷小龙 5 nr
+殷少军 3 nr
+殷师兄 10 nr
+殷师叔 2 nr
+殷开山 5 nr
+殷德布 2 nr
+殷忧 8 nr
+殷忧启圣 3 i
+殷情 3 n
+殷承宗 3 nr
+殷无寿 12 nr
+殷无禄 22 nr
+殷无福 21 nr
+殷明略 2 nr
+殷望 3 nr
+殷末周 5 nr
+殷末帝 2 nr
+殷根福 2 nr
+殷梨亭 300 nr
+殷正茂 302 nr
+殷殷 62 nr
+殷殷勤勤 3 nr
+殷殷屯屯 3 nr
+殷殷期望 3 nr
+殷殷田田 3 nr
+殷民阜财 3 v
+殷汝耕 7 nr
+殷浩书空 3 nr
+殷海光 258 nr
+殷渐归 2 nr
+殷白眉 2 nr
+殷直阁 4 nr
+殷离怒 4 nr
+殷秀梅 2 nr
+殷素素 536 nr
+殷红 124 nr
+殷红博 2 nr
+殷纣王 6 nrt
+殷老儿 2 nr
+殷虚书 5 nr
+殷都区 3 nr
+殷野王 51 nr
+殷鉴 8 nr
+殷鉴不远 8 i
+殷钢 3 nr
+殷铁生 40 nr
+殷雪梅 3 nr
+殷馗善 2 nr
+殻 3 zg
+殽 5 zg
+殿 6506 n
+殿下 414 s
+殿内 404 s
+殿军 7 n
+殿后 136 s
+殿堂 236 n
+殿堂楼阁 3 n
+殿外 3 s
+殿宇 97 n
+殿试 1092 v
+殿阁 54 n
+毀 5 zg
+毁 3036 v
+毁不危身 3 i
+毁不灭性 3 i
+毁于 3 v
+毁于一旦 62 i
+毁于蚁穴 2 i
+毁伤 180 v
+毁冠裂裳 3 n
+毁减 3 v
+毁坏 268 v
+毁宗夷族 3 i
+毁害 3 v
+毁家纾国 3 i
+毁家纾难 8 i
+毁容 27 v
+毁尸灭迹 3 i
+毁弃 63 v
+毁形 3 v
+毁形灭性 3 n
+毁损 56 v
+毁损率 3 n
+毁掉 209 v
+毁方投圆 3 i
+毁方瓦合 3 i
+毁林 4 n
+毁灭 796 v
+毁灭公爵 3 n
+毁灭性 280 n
+毁灭者 3 n
+毁版 4 v
+毁约 56 v
+毁舟为杕 3 n
+毁言 3 v
+毁誉 22 n
+毁誉不一 3 i
+毁誉参半 6 i
+毁谤 20 v
+毁谤罪 3 n
+毁车杀马 3 i
+毁迹 3 n
+毁钟为铎 3 n
+毁风败俗 3 i
+毂 81 x
+毂交蹄劘 3 n
+毂击肩摩 3 n
+毂辘 20 n
+毅 512 nr
+毅力 224 n
+毅勇 5 d
+毅然 466 d
+毅然决定 3 n
+毅然决然 31 i
+毅然决裂 3 i
+毅然投入 3 i
+毊 97 zg
+毋 228 nr
+毋丘俭 22 nr
+毋为牛后 3 l
+毋乃太 2 nr
+毋务 4 l
+毋宁 316 nr
+毋宁死 3 nr
+毋庸 15 d
+毋庸置疑 66 l
+毋庸置言 3 l
+毋庸讳言 32 i
+毋庸赘述 3 l
+毋得违 2 nr
+毋忘 3 nr
+毋昭裔 2 nr
+毋望之祸 3 i
+毋望之福 3 i
+毋翼而飞 3 i
+毋负朕 2 nr
+毋需 3 nr
+毋须 4 d
+毋须乎 3 nr
+毌 4 zg
+母 2975 n
+母丁香 3 nr
+母与子 4 nr
+母丑 2 n
+母丘倹 3 nr
+母丛 2 n
+母丝杠 2 n
+母之仇 6 nr
+母乳 85 n
+母乳喂养 3 vn
+母亲 8010 n
+母亲河 14 nr
+母亲网 3 nr
+母亲节 20 nr
+母以子贵 14 nr
+母仪之 2 nr
+母仪天 7 nr
+母仪天下 3 n
+母体 273 n
+母儿 8 n
+母兄 5 n
+母兄弟 3 nr
+母兔 2 n
+母党 3 n
+母公司 91 n
+母兽 10 n
+母创制 2 n
+母卞氏 2 nr
+母口 2 n
+母后 3 nr
+母后明 2 nr
+母吴太 2 nr
+母国 36 n
+母城 3 n
+母夜叉 25 nr
+母大虫 20 nr
+母女 364 n
+母女之情 3 n
+母女俩 3 n
+母女均安 3 n
+母女情 3 n
+母女间 3 n
+母奶 3 n
+母姊会 3 nr
+母婴 40 n
+母子 539 n
+母子之情 3 n
+母子俩 3 n
+母子公司 8 n
+母子均安 3 nr
+母子情 3 n
+母子连心 3 n
+母子间 3 n
+母宋氏 2 nr
+母宣仁 2 nr
+母岩 6 n
+母异父 10 n
+母弘吉 4 nr
+母弟 3 n
+母弟旭 2 nr
+母弟爱 2 nr
+母弱弟 2 n
+母弹 6 n
+母忧 3 n
+母性 52 n
+母性爱 3 nr
+母慈子 6 nr
+母慈子孝 3 nr
+母懿旨 2 nr
+母戊鼎 13 nr
+母所生 4 nr
+母改子 5 nr
+母教 5 n
+母暗沙 22 nr
+母曰简 2 nr
+母曹氏 2 nr
+母本 403 n
+母本印记 3 n
+母机 6 n
+母权 3 n
+母权制 13 n
+母杨氏 2 nr
+母板 3 n
+母树 16 n
+母树林 5 nr
+母校 75 n
+母株 12 n
+母核 5 n
+母梁太后 3 nr
+母梁氏 4 nr
+母泉村 2 nr
+母法 3 n
+母海中 3 nr
+母液 13 n
+母港 10 n
+母灯 3 n
+母熊 3 n
+母爱 120 nr
+母片 3 n
+母版 3 n
+母牛 66 n
+母牛生 2 nr
+母狗 16 n
+母狮 3 n
+母狼 14 n
+母猪 49 n
+母猫 3 n
+母猴 2 n
+母珠 5 n
+母珠贾 2 nr
+母田氏 2 nr
+母畜 18 n
+母盘 3 n
+母系 161 n
+母系亲属 3 n
+母系制度 3 n
+母系社会 3 n
+母线 22 n
+母线槽 8 n
+母细胞 3 n
+母羊 14 n
+母老虎 19 nr
+母育 2 n
+母腹 4 n
+母至孝 7 nr
+母舅 3 n
+母航 2 n
+母舰 32 n
+母芯 2 n
+母范翻 2 nr
+母草 3 n
+母蜂 3 n
+母蝎子 2 nr
+母训 2 n
+母语 88 n
+母象 3 n
+母豹 14 n
+母贝 19 n
+母质 11 n
+母质层 2 n
+母邦 5 n
+母野利 2 nr
+母钟 2 n
+母钱 3 n
+母阔阔 3 nr
+母难之日 3 i
+母音 3 n
+母音表 3 n
+母题 3 n
+母马 25 n
+母马母 2 nr
+母马氏 2 nr
+母驴 3 n
+母髦智 2 nr
+母鱼 3 n
+母鱼科 3 nr
+母鸟 3 n
+母鸡 162 n
+母鸭 3 n
+母鹿 29 n
+母鹿产 2 nr
+母鹿停 2 nr
+母鹿寻 2 nr
+母鼠 3 n
+母龟 3 n
+毎 7 zg
+每 26048 zg
+每一件 3 l
+每一分 3 d
+每一刻 3 r
+每一处 3 r
+每一寸 3 l
+每一朵 3 l
+每一款 3 r
+每一秒 3 r
+每一集 3 i
+每一项 3 r
+每下愈况 3 l
+每个 6618 r
+每串 3 v
+每于 3 p
+每亩 69 r
+每人 1441 r
+每人每天 3 l
+每人每年 3 l
+每付 3 v
+每件 3 d
+每件事 3 l
+每份 44 r
+每位 196 r
+每克 3 nz
+每公尺 3 l
+每公斤 3 n
+每具 3 v
+每册 3 v
+每况愈下 57 l
+每况欲下 3 i
+每分钟 9 l
+每到一地 24 l
+每刻 3 r
+每加仑 3 nz
+每包 3 v
+每匹 3 n
+每区 3 r
+每十年 3 l
+每千人 3 i
+每千克 3 nz
+每千字 3 l
+每半年 3 l
+每双 3 r
+每句 3 d
+每句话 3 l
+每吨 3 n
+每周 984 r
+每周三 3 i
+每周五 9 l
+每周六 12 l
+每周日 7 i
+每圈 3 nz
+每场 182 r
+每块 225 r
+每坪 3 nz
+每堆 3 v
+每声道 3 l
+每夜 3 d
+每天 6612 r
+每天晚上 3 i
+每天花 3 i
+每套 54 r
+每季 26 r
+每季度 3 l
+每学年 3 l
+每学期 3 n
+每宗 3 nz
+每客 3 v
+每家 204 r
+每家店 3 r
+每家每户 3 l
+每封 3 v
+每封信 3 l
+每局 32 r
+每层 3 n
+每届 3 r
+每幅 3 r
+每平方 3 i
+每平方米 3 l
+每平米 3 l
+每年 10986 r
+每年数 3 l
+每店 2 r
+每张 77 r
+每当 1521 p
+每战必殆 3 i
+每户 106 r
+每批 3 v
+每担 3 v
+每排 3 v
+每支 34 r
+每斤 3 n
+每日 1941 r
+每日新报 2 nz
+每日电讯 3 nz
+每时 3 r
+每时每刻 66 l
+每星期 3 i
+每晚 192 r
+每月 1307 r
+每期 79 r
+每杯 3 nz
+每枚 3 v
+每枝 3 n
+每栋 4 r
+每株 8 r
+每样 3 r
+每格 3 v
+每桶 85 r
+每棵 3 l
+每次 3011 r
+每步 3 d
+每段 3 r
+每每 334 d
+每每如此 3 l
+每毫升 3 l
+每片 3 r
+每版 3 r
+每班 17 r
+每瓶 9 r
+每百 3 nz
+每百人 3 i
+每盎司 3 l
+每盏 3 nz
+每盒 32 r
+每碗 3 n
+每磅 3 v
+每票 3 v
+每种 198 r
+每科 3 r
+每秒 326 r
+每秒钟 3 i
+每窑 3 nz
+每立方 3 i
+每章 19 r
+每端 3 d
+每笔 3 r
+每箱 3 nz
+每篇 32 r
+每类 3 r
+每粒 3 n
+每组 3 r
+每罐 3 nz
+每股 683 r
+每节 3 v
+每节课 3 n
+每行 37 r
+每试必中 3 l
+每课 3 v
+每车 3 r
+每辆 3 n
+每辆车 3 n
+每边 3 r
+每过 3 p
+每逢 842 v
+每逢佳节倍思亲 5 i
+每道菜 3 l
+每部 45 r
+每锅 3 v
+每镇 17 r
+每间 43 r
+每间房 3 l
+每队 62 r
+每隔 3 v
+每集 3 v
+每页 3 n
+每页行数 3 l
+每顷 3 d
+每项 3 r
+每顿 3 v
+每顿饭 3 i
+每颗 3 n
+每题 3 n
+每餐 36 r
+每饭不忘 3 i
+每首歌 3 i
+毐 44 zg
+毐性 3 vn
+毐液 3 vn
+毐虫 3 vn
+毐蛇 3 v
+毐辣 3 z
+毒 4357 zg
+毒丸 9 n
+毒刑 15 n
+毒刑拷打 3 vn
+毒刺 73 n
+毒剂 135 n
+毒副 6 n
+毒副作用 56 n
+毒力 3 n
+毒化 28 n
+毒华儿 3 n
+毒叶 3 n
+毒品 566 n
+毒品学 3 n
+毒品案 3 n
+毒品源 3 n
+毒品走私 3 n
+毒囊 3 n
+毒大米 3 n
+毒奶粉 3 n
+毒如蛇蝎 3 n
+毒妇 3 n
+毒娘子 3 n
+毒害 162 n
+毒害性 3 n
+毒弹 3 n
+毒性 842 n
+毒扁豆碱 5 n
+毒手 498 n
+毒手尊前 3 i
+毒手尊拳 3 n
+毒打 74 n
+毒日头 14 n
+毒杀 52 v
+毒枭 8 n
+毒树之果 3 n
+毒株 5 n
+毒植物素 3 n
+毒死 186 n
+毒气 278 n
+毒气卡 3 n
+毒气室 7 n
+毒气弹 6 n
+毒气镖 3 n
+毒水 47 n
+毒汁 36 n
+毒油 3 n
+毒泷恶雾 3 nr
+毒液 139 n
+毒焰 3 n
+毒燎虐焰 3 l
+毒牙 16 n
+毒物 475 n
+毒物学 3 n
+毒犯 4 n
+毒狗草 3 n
+毒理 24 n
+毒理学 29 n
+毒瓦斯 2 n
+毒疮 8 n
+毒症 3 n
+毒瘤 27 n
+毒瘴 3 n
+毒瘾 18 n
+毒砂 40 n
+毒箭 84 n
+毒米 3 n
+毒粉 3 n
+毒素 443 n
+毒腺 27 n
+毒花 3 n
+毒花花 3 n
+毒芹 3 n
+毒草 43 n
+毒药 554 n
+毒菌 15 n
+毒菜 3 n
+毒蕈 23 n
+毒蕈碱 3 vn
+毒蘑菇 3 v
+毒虫 188 n
+毒蛇 570 n
+毒蛇猛兽 7 i
+毒蛾 29 n
+毒蜘蛛 14 n
+毒蝇碱 3 nz
+毒蝎 3 n
+毒蝎子 3 n
+毒血 3 n
+毒血症 11 n
+毒计 115 n
+毒词 3 n
+毒谋 3 n
+毒质 3 n
+毒贩 12 n
+毒贩子 2 n
+毒赋剩敛 3 i
+毒软件 16 n
+毒辣 207 a
+毒辣辣 4 z
+毒酒 73 n
+毒针 3 n
+毒雾 60 n
+毒霸 7 n
+毒饭 3 n
+毒饵 3 n
+毒魔 6 n
+毒魔狠怪 6 i
+毒鱼 3 n
+毒麦 10 n
+毒鼠强 3 n
+毒龙 3 n
+毓 145 nz
+毓婷 3 nz
+毓璜顶 3 z
+毓秀 3 nz
+比 35305 p
+比一比 3 nr
+比上不足 13 i
+比下有余 14 l
+比不上 510 l
+比丘 60 ns
+比丘国 3 ns
+比丘尼 34 nr
+比丘王 2 nr
+比个高下 3 l
+比为 3 d
+比丽春 2 nr
+比久 2 d
+比乔峰 2 nr
+比亚 51 ns
+比亚尔 2 nr
+比亚山 3 ns
+比亚斯 3 nr
+比亚河 2 ns
+比亚瓦 4 nr
+比亚语 3 nr
+比亚诺 90 nr
+比亚迪 4 nr
+比亚里茨 2 nrt
+比亚韦斯托克 6 nrt
+比京 3 ns
+比人 3 n
+比人强 3 nr
+比什 12 nrt
+比什凯克 22 nrt
+比价 138 n
+比众不同 3 l
+比体积 3 n
+比作 570 vn
+比你早 3 l
+比例 5973 n
+比例中项 3 n
+比例内项 3 n
+比例变换 2 l
+比例图 3 l
+比例增强 3 l
+比例失调 3 l
+比例尺 109 l
+比例式 3 l
+比例扩张 3 n
+比例控制 13 n
+比例税制 3 n
+比例表 3 l
+比例规 11 n
+比例阀 3 l
+比值 168 n
+比做 59 v
+比克 5 nrt
+比兰尼 3 nr
+比兰德拉 7 nrt
+比兴 37 ns
+比况 3 n
+比凤姐 2 nr
+比出 3 v
+比分 1095 d
+比分数 3 n
+比划 256 n
+比利 104 n
+比利亚 38 ns
+比利亚雷 54 nrt
+比利时 1049 ns
+比利时人 35 l
+比利时外交部 16 nt
+比利时政府 12 l
+比利时法郎 3 l
+比利时王国 10 ns
+比利时队 6 n
+比利牛斯 66 ns
+比到 3 v
+比剑夺 4 nr
+比勒 20 nrt
+比勒菲 6 nr
+比勒菲尔德 5 nrt
+比勒陀利亚 33 ns
+比卡丘 3 nr
+比卢普斯 3 nrt
+比及 76 v
+比古 4 ns
+比吉 5 nrt
+比吉河 6 nr
+比君亭 4 nr
+比哈尔 28 nrt
+比哈尔邦 26 ns
+比善德 16 nr
+比喻 383 n
+比喻句 3 i
+比喻失当 3 i
+比嘉平 2 nr
+比嘉草 2 nr
+比国 3 ns
+比基 3 nrt
+比基尼 37 nr
+比堤 3 n
+比塞大 7 ns
+比增 3 v
+比夫 4 nrt
+比奇 5 nrt
+比奇省 3 nr
+比奈智 6 nr
+比奥 13 nrt
+比奥科 16 nrt
+比奥莱塔 2 nrt
+比如 5621 v
+比如县 3 nr
+比如说 904 l
+比姆 3 nrt
+比威尔 5 nr
+比孙文 2 nr
+比孝文 2 nr
+比学 2 n
+比学赶帮 3 n
+比安奇 3 nr
+比安娜 3 nr
+比宙斯 2 nr
+比宝柱 2 nr
+比实德 4 nr
+比容 7 n
+比对 88 d
+比对法 3 n
+比小孔 2 nr
+比小龙 3 nr
+比少 3 d
+比少平 2 nr
+比尔 233 nrt
+比尔斯 3 nrt
+比尔格 2 nrt
+比尔森 8 nr
+比尔特 3 nrt
+比尔盖茨 3 nr
+比尼 8 nrt
+比屋可封 3 nr
+比屋而封 3 i
+比岁不登 3 i
+比帕夏 2 nr
+比常儿 2 nr
+比常蜂 2 nr
+比年不登 3 i
+比弗 4 nrt
+比彻姆 2 nrt
+比徐爵 2 nr
+比得 3 d
+比得上 3 d
+比得哥什 3 nrt
+比得过 3 d
+比德 16 nrt
+比德尔 9 nr
+比德曼 2 nr
+比思敏 7 nr
+比慈恩 2 nr
+比慧英 4 nr
+比我强 3 l
+比户可封 3 i
+比手划脚 3 l
+比手画脚 2 i
+比才 16 d
+比托 8 nrt
+比拉 16 nrt
+比拉尔 5 nrt
+比拉尔多 13 nrt
+比拟 397 v
+比拼 53 v
+比数 11 n
+比斯 21 nrt
+比斯克拉 2 nrt
+比斯开 5 nr
+比斯开湾 20 ns
+比斯拉 2 nrt
+比斯查 3 nr
+比斯特 4 nrt
+比方 248 n
+比方说 3 l
+比旋光 3 n
+比昂松 6 nr
+比昂迪 3 nr
+比明军 3 nr
+比晓维 2 nr
+比晴雯 2 nr
+比本 12 n
+比权量力 3 n
+比来 3 d
+比来比去 3 l
+比林 7 n
+比林斯 3 nr
+比格 8 n
+比格尔 4 nr
+比格尼斯 2 nrt
+比武 811 nr
+比武场 2 n
+比武招亲 3 n
+比比 90 nrt
+比比划划 15 l
+比比皆是 625 l
+比比皆然 3 l
+比比看 7 l
+比洛 9 nrt
+比洛夫 3 nr
+比活度 12 n
+比浓粘度 3 n
+比海鹰 2 nr
+比湿 3 n
+比溼 3 vn
+比满桂 2 nr
+比热 108 v
+比热容 3 n
+比热戈斯 5 nrt
+比热法 3 n
+比照 114 p
+比照办理 3 n
+比熊犬 3 nr
+比物丑类 3 l
+比物假事 3 l
+比物属事 3 n
+比物此志 3 l
+比物连类 3 n
+比特 95 nrt
+比特流 3 nr
+比特率 2 n
+比特精灵 3 nr
+比特铃 3 nr
+比献忠 2 nr
+比玄贞 2 nr
+比率 494 n
+比率智商 3 nr
+比率量表 3 n
+比画 23 n
+比登 38 nrt
+比白帆 2 nr
+比目 4 n
+比目连枝 3 i
+比目鱼 41 l
+比着 3 p
+比科尔 7 nr
+比程英 2 nr
+比类从事 3 l
+比索 91 n
+比约克 3 nr
+比绍 36 v
+比罗 2 nrt
+比美 15 ns
+比翼 10 n
+比翼双飞 3 nr
+比翼而行 3 i
+比翼连枝 3 i
+比翼鸟 5 nr
+比翼齐飞 5 i
+比而不党 3 i
+比而不周 3 i
+比肩 52 d
+比肩叠踵 3 i
+比肩叠迹 3 i
+比肩并起 3 l
+比肩接踵 3 i
+比肩接迹 3 i
+比肩皆是 3 l
+比肩系踵 3 i
+比肩继踵 3 i
+比肩而立 3 l
+比肩而邻 3 l
+比肩连袂 3 i
+比肩迭迹 3 l
+比肩随踵 3 i
+比肩齐声 3 l
+比色 28 n
+比色法 3 n
+比色皿 3 n
+比色计 4 l
+比荷 3 n
+比萨 123 nrt
+比萨扬 3 nr
+比萨斜塔 3 nr
+比萨饼 92 n
+比蒙 4 nrt
+比薇薇 2 nr
+比表面 3 n
+比西 19 ns
+比西军 2 nr
+比西奇 8 nr
+比西子 5 nr
+比试 276 vn
+比试一下 3 l
+比诺特 2 nrt
+比费 5 vn
+比赛 11336 vn
+比赛场 12 n
+比赛场地 3 n
+比赛服 8 nr
+比赛结果 3 n
+比赛规则 3 n
+比赛项目 3 n
+比赛馆 3 nr
+比起 558 v
+比较 15910 d
+比较严重 3 n
+比较丰富 3 l
+比较仪 3 n
+比较价格 3 n
+比较关心 3 l
+比较发达 3 n
+比较复杂 3 l
+比较完善 3 l
+比较定理 3 n
+比较忙 3 l
+比较慢 3 l
+比较支持 3 n
+比较文学 25 n
+比较显著 3 n
+比较法 39 n
+比较清楚 3 l
+比较满意 3 l
+比较烦 3 l
+比较稳定 3 n
+比较突出 3 n
+比较简单 3 l
+比较繁荣 3 l
+比较级 5 n
+比较而言 3 l
+比较落后 3 l
+比较认知 3 l
+比较语言学 23 l
+比较顺利 3 l
+比达 260 nrt
+比达尔 4 nr
+比过 3 p
+比邻 14 v
+比邻星 11 nr
+比邻而居 3 l
+比配 3 vn
+比里亚 4 ns
+比重 1814 n
+比重瓶 3 nr
+比重计 2 l
+比量 9 n
+比量齐观 3 l
+比金 7 n
+比金秀 2 nr
+比长仪 2 nr
+比阔气 2 l
+比阿炳 2 nr
+比附 16 v
+比降 155 v
+比隶臣 2 nr
+比雪夫 29 nr
+比雷埃夫斯 6 nrt
+比顿 2 nrt
+比额 3 n
+比高 50 v
+比高下 3 l
+比鲁尼 4 nr
+比黛玉 2 nr
+毕 3209 v
+毕业 5988 n
+毕业会考 3 n
+毕业典礼 3 n
+毕业分配 3 n
+毕业文凭 3 n
+毕业班 39 n
+毕业生 3323 n
+毕业考 3 v
+毕业考试 3 n
+毕业论文 3 n
+毕业设计 3 n
+毕业证 62 n
+毕业证书 3 n
+毕业钱 3 n
+毕了业 2 nr
+毕众敬 2 nr
+毕克官 2 nr
+毕全忠 17 nr
+毕公高 6 nr
+毕其功于一役 27 i
+毕力 3 d
+毕力同心 3 i
+毕功之 2 nr
+毕加索 117 nr
+毕勒哥 2 nr
+毕勒尔 2 nr
+毕升 270 v
+毕卡索 3 nr
+毕吸虫 2 n
+毕命 11 v
+毕命之 3 nr
+毕大爷 6 nr
+毕天 40 d
+毕天都 2 nr
+毕宗远 2 nr
+毕家塘 256 nr
+毕家荡 256 nr
+毕宿 11 v
+毕宿五 3 nr
+毕尔巴 6 nr
+毕尔巴鄂 15 nr
+毕尔腾 2 nr
+毕巡抚 2 nr
+毕师铎 7 nr
+毕希纳 8 nr
+毕彦君 3 nr
+毕德显 2 nr
+毕恭毕敬 112 i
+毕拉勒 3 nr
+毕摩 2 v
+毕政委 8 nr
+毕方济 2 nr
+毕明明 4 nr
+毕春丽 2 nr
+毕晓普 2 nr
+毕景星 4 nr
+毕月鸟 2 nr
+毕桂芳 2 nr
+毕比 52 v
+毕氏定理 3 nr
+毕沙罗 5 nr
+毕波罗 2 nr
+毕淑敏 3 nrfg
+毕玉玺 8 nr
+毕现 2 v
+毕生 353 v
+毕生精力 3 i
+毕直 3 d
+毕石湖 23 nr
+毕福剑 3 nr
+毕竟 4492 d
+毕竟空 3 nr
+毕纳依 2 nr
+毕绍普 2 nr
+毕联会 3 nr
+毕肖 2 nr
+毕自严 4 nr
+毕自肃 7 nr
+毕节 21 n
+毕节县 3 nr
+毕节地区 8 ns
+毕节市 3 n
+毕苏斯 8 nr
+毕诗成 7 nr
+毕贺 2 v
+毕轨 2 v
+毕达哥 4 nr
+毕达哥拉 3 nr
+毕达哥拉斯 110 ns
+毕达库 48 nr
+毕重远 14 nr
+毕鉴昌 3 nr
+毕雨箕风 3 i
+毕露 23 v
+毕飞宇 12 nr
+毕马威 28 nr
+毖 40 g
+毗 368 zg
+毗卢寺 2 nrt
+毗湿奴 62 nrt
+毗连 95 v
+毗连区 23 n
+毗邻 362 v
+毘 3 zg
+毙 509 v
+毙伤 73 v
+毙命 285 v
+毙掉 3 v
+毙明白 3 v
+毙而后已 3 v
+毚 23 zg
+毛 7753 nr
+毛一鹭 12 nr
+毛世来 4 nr
+毛丛 2 nr
+毛东珠 37 nr
+毛丫头 11 nr
+毛主席 32 n
+毛主席纪念堂 918 n
+毛举细务 3 n
+毛举细故 3 i
+毛举缕析 3 i
+毛义 9 n
+毛乌素 29 nr
+毛乌素沙漠 5 ns
+毛乎乎 3 z
+毛人凤 4 nr
+毛仲义 7 nr
+毛众役 4 nz
+毛伯温 3 nr
+毛估 3 nr
+毛估估 3 nr
+毛佩琦 4 nr
+毛依罕 3 nr
+毛值 3 n
+毛儿盖 2 nr
+毛光如 2 nr
+毛全白 2 nr
+毛公鼎 10 nr
+毛共 3 b
+毛兴村 3 nr
+毛冠鹿 293 nr
+毛冬青 3 nr
+毛利 75 nr
+毛利人 83 nr
+毛利兰 3 nr
+毛利族 2 nr
+毛利族人 2 n
+毛利润 4 nr
+毛利率 164 n
+毛利语 3 nr
+毛利辉 7 nr
+毛刷 4 z
+毛刺 14 n
+毛剑卿 37 nr
+毛匪 3 n
+毛半仙 5 nr
+毛南 21 ns
+毛南族 40 nr
+毛南语 4 nr
+毛卷 3 n
+毛发 258 nr
+毛发不爽 3 i
+毛发丝粟 3 i
+毛发之功 3 nr
+毛发倒竖 3 i
+毛发悚然 2 i
+毛发耸然 3 i
+毛呢 6 n
+毛和丝 2 nr
+毛喉素 3 n
+毛囊 77 n
+毛囊炎 12 n
+毛地黄 2 nr
+毛坑 3 n
+毛坯 17 n
+毛坯房 3 n
+毛大狗 2 nr
+毛太公 12 nr
+毛太守揆 3 nr
+毛头 46 n
+毛头小子 3 nr
+毛头毛脑 3 i
+毛奇龄 137 nr
+毛如柏 256 nr
+毛妹妹 2 nr
+毛委员 3 n
+毛子 31 n
+毛子水 2 nr
+毛子牌 2 n
+毛孔 84 n
+毛孩 7 n
+毛孩子 23 n
+毛守白 3 nr
+毛宗岗 5 nr
+毛家湾 9 nr
+毛将焉附 7 i
+毛小妹 13 nr
+毛小狗 2 nr
+毛尔布 2 nr
+毛尖 549 n
+毛尖茶 3 nr
+毛履军 3 nr
+毛岛主 11 nr
+毛岸红 3 nr
+毛岸英 78 nr
+毛岸龙 2 nr
+毛峰茶 7 nr
+毛巾 466 nr
+毛巾厂 3 nr
+毛巾布 6 nr
+毛巾架 3 nr
+毛巾衫 3 nr
+毛巾被 11 n
+毛布 6 nr
+毛希丁 2 nr
+毛庆国 24 ns
+毛延寿 2 nr
+毛德皇后 2 nr
+毛总兵 19 nr
+毛惟正 3 nr
+毛戈平 3 nr
+毛手毛脚 33 i
+毛承禄 8 nr
+毛拉 8 nr
+毛损 3 nr
+毛收入 7 n
+毛敏仲 2 nr
+毛敬雄 3 nr
+毛文珠 3 nr
+毛文龙 216 nr
+毛料 22 n
+毛新宇 3 nr
+毛昱衡 28 nr
+毛晋刻 2 nr
+毛月亮 2 nr
+毛朱诗 3 nr
+毛条 14 n
+毛松友 2 nr
+毛果 7 n
+毛果苔 3 nr
+毛枝藻 2 nr
+毛栗子 6 nr
+毛样 2 nr
+毛根 5 nr
+毛根根 2 nr
+毛桃 3 n
+毛森骨立 3 nr
+毛楂楂 3 n
+毛概 2 n
+毛樱桃 3 nr
+毛毛 43 nr
+毛毛可 2 nr
+毛毛娘 4 nr
+毛毛山 2 nr
+毛毛熊 3 nr
+毛毛糙糙 4 z
+毛毛细雨 3 n
+毛毛腾腾 3 z
+毛毛茸茸 3 z
+毛毛著 2 nr
+毛毛虫 22 nr
+毛毛躁躁 3 z
+毛毛道 3 nr
+毛毛雨 14 nr
+毛毡 56 n
+毛毡厂 3 n
+毛毡垫 3 n
+毛毡苔 3 n
+毛毡轮 3 n
+毛毯 113 n
+毛毯厂 6 n
+毛永明 3 nr
+毛汉礼 2 nr
+毛汉英 2 nr
+毛泽东 8994 nr
+毛泽东思想 1075 nr
+毛泽东故居 9 ns
+毛泽民 15 nr
+毛泽覃 54 nr
+毛活儿 2 nr
+毛海峰 48 nr
+毛涛涛 3 nr
+毛涤薄 2 nr
+毛润 4 n
+毛润之 15 nr
+毛淡棉 15 nr
+毛混纺 3 nz
+毛渠 3 nr
+毛滴虫 18 n
+毛炳文 3 nr
+毛烘烘 3 z
+毛焦火燎 3 i
+毛燮均 4 nr
+毛片 15 n
+毛状 2 n
+毛状白斑 3 n
+毛狼王 2 nr
+毛猪 4 n
+毛猫 2 n
+毛猴 2 n
+毛猴子 3 nr
+毛玉萍 3 nr
+毛玲萍 3 nr
+毛玻璃 7 n
+毛瑞斯 20 nr
+毛瑟式 2 nr
+毛瑟枪 10 nr
+毛病 807 n
+毛白杨 11 nr
+毛皇后 5 nr
+毛皮 224 n
+毛皮围脖 3 nr
+毛皮衣 3 nr
+毛盖儿 3 nr
+毛石墙 3 nr
+毛票 3 n
+毛福民 3 nr
+毛穆之 2 nr
+毛竹 113 nr
+毛竹林 8 nr
+毛笋 3 nr
+毛笔 359 n
+毛笔套 3 nz
+毛笔字 24 nz
+毛笔画 3 n
+毛管上限 3 n
+毛管势 3 n
+毛管水 3 nr
+毛类 3 n
+毛糙 3 nr
+毛索洛 9 nr
+毛纤 3 n
+毛约尔 2 nr
+毛纪 2 n
+毛纱 16 n
+毛纱织 8 n
+毛纲海 2 nr
+毛纺 99 j
+毛纺业 2 n
+毛纺厂 24 n
+毛纺织 78 n
+毛纺织厂 8 n
+毛线 92 n
+毛线帽 2 n
+毛线衣 11 n
+毛线袜 3 n
+毛线针 3 n
+毛细 40 n
+毛细孔 4 n
+毛细波 5 nr
+毛细现象 8 n
+毛细移 2 nr
+毛细管 54 n
+毛细管柱 3 n
+毛细胞 13 n
+毛细血管 220 n
+毛织 16 n
+毛织业 4 n
+毛织厂 3 n
+毛织品 34 n
+毛织布 3 n
+毛织物 3 n
+毛绒 10 nr
+毛绒玩具 3 n
+毛绒绒 9 nr
+毛群安 20 nr
+毛羽未丰 3 nr
+毛羽贲 2 nr
+毛羽零落 3 i
+毛翅目 5 nr
+毛翼虫 2 nr
+毛肉兼 3 nr
+毛肚 3 n
+毛背心 6 nr
+毛脚女婿 3 n
+毛脸 5 n
+毛臊 3 a
+毛致用 3 nr
+毛舜筠 3 nr
+毛色 137 n
+毛茛 39 n
+毛茛科 3 v
+毛茶 13 nr
+毛茸茸 108 z
+毛草 3 n
+毛莨 3 n
+毛莨科 5 nr
+毛菌 2 n
+毛蓝 3 nr
+毛藻科 4 nr
+毛虎燕 4 nr
+毛虫 42 n
+毛虾 20 nr
+毛蚴 3 n
+毛蚶 11 n
+毛蛋 10 n
+毛蟹 3 n
+毛血旺 3 nr
+毛衣 112 n
+毛衣装 3 n
+毛袜 3 n
+毛装 3 n
+毛裤 3 n
+毛译东 2 nr
+毛诗 7 nr
+毛诗传 3 nr
+毛诗序 3 nr
+毛语录 3 nr
+毛豆 10 n
+毛豆油 3 n
+毛货 3 n
+毛质 2 n
+毛贵军 2 nr
+毛贵原 2 nr
+毛贵部 2 nr
+毛贼 3 n
+毛赤兔 4 nr
+毛躁 9 a
+毛边 17 n
+毛边纸 3 n
+毛远新 5 nr
+毛遂 3 nr
+毛遂堕井 3 i
+毛遂自荐 19 nr
+毛邃自荐 3 v
+毛酋 3 ns
+毛里 7 nr
+毛里坦 4 nr
+毛里塔尼亚 111 ns
+毛里塔尼亚伊斯兰共和国 4 ns
+毛里求斯 129 ns
+毛里求斯共和国 2 ns
+毛里求疵 3 i
+毛重 3 n
+毛金花 2 nr
+毛钱 111 n
+毛长达 2 nr
+毛阿敏 3 nr
+毛难 3 n
+毛难族 3 nr
+毛集镇 3 nr
+毛霉 3 n
+毛霉菌属 3 n
+毛青布 3 nr
+毛领 3 nr
+毛额 3 n
+毛驴 148 nr
+毛驴车 15 n
+毛骨悚然 175 i
+毛骨惊 2 nr
+毛骨竦然 3 z
+毛骨耸然 7 i
+毛鳞鱼 5 nr
+毛鼠 2 n
+毝 2 zg
+毞 7 zg
+毡 507 ng
+毡上拖毛 3 n
+毡包 9 n
+毡呢 3 n
+毡垫 5 n
+毡子 18 n
+毡帐 29 n
+毡帽 72 n
+毡房 12 n
+毡毯 3 n
+毡笠 37 n
+毡衣 3 n
+毡衬 3 n
+毡袜 3 n
+毡靴 6 n
+毡鞋 3 n
+毤 2 zg
+毦 117 zg
+毪 4 g
+毫 408 m
+毫不 1724 d
+毫不介意 8 l
+毫不关心 3 l
+毫不利己 5 l
+毫不动摇 56 l
+毫不含糊 3 l
+毫不在乎 53 l
+毫不在意 3 l
+毫不妥协 3 n
+毫不客气 67 l
+毫不容情 3 l
+毫不手软 3 i
+毫不掩饰 3 v
+毫不放松 3 l
+毫不服输 3 l
+毫不犹豫 304 l
+毫不理会 3 l
+毫不畏缩 3 v
+毫不留情 73 l
+毫不留意 3 l
+毫不相关 3 l
+毫不相干 106 l
+毫不考虑 3 l
+毫不讳言 9 i
+毫不费力 91 l
+毫不迟延 3 n
+毫不迟疑 51 l
+毫不退却 3 l
+毫不退缩 3 l
+毫不退让 3 l
+毫不逊色 3 l
+毫亨 3 n
+毫伏 16 q
+毫克 644 q
+毫分 3 m
+毫分缕析 3 l
+毫升 319 q
+毫厘 16 q
+毫厘不差 3 i
+毫厘不爽 3 i
+毫厘丝忽 3 m
+毫厘千里 3 q
+毫发 59 v
+毫发不差 3 l
+毫发不损 3 l
+毫发不爽 3 i
+毫发不遇 3 l
+毫发丝粟 3 i
+毫发之差 3 l
+毫发无损 3 l
+毫发未伤 3 l
+毫安 20 q
+毫安培 3 l
+毫安表 3 l
+毫居里 3 l
+毫州 24 n
+毫州市 3 n
+毫巴 7 q
+毫当量 3 l
+毫微秒 3 q
+毫微米 2 q
+毫无 2482 v
+毫无二致 13 l
+毫无价值 3 l
+毫无余地 3 l
+毫无作用 3 l
+毫无例外 18 l
+毫无保留 3 i
+毫无信用 3 l
+毫无关系 3 l
+毫无准备 3 l
+毫无办法 77 l
+毫无动静 3 l
+毫无区别 3 l
+毫无原则 2 l
+毫无可取 3 l
+毫无希望 3 l
+毫无忌惮 3 i
+毫无悔意 3 l
+毫无惧色 3 n
+毫无意义 3 l
+毫无所惧 3 i
+毫无把握 3 l
+毫无效果 3 l
+毫无来由 4 l
+毫无根据 3 l
+毫无瓜葛 3 n
+毫无用处 63 l
+毫无用途 3 i
+毫无疑义 17 l
+毫无疑问 481 l
+毫无目标 3 l
+毫无知觉 3 l
+毫无结果 3 l
+毫无警觉 3 l
+毫无诚意 3 i
+毫无逊色 4 l
+毫无道理 24 l
+毫无音信 3 l
+毫无顾忌 56 l
+毫无顾虑 5 i
+毫末 3 n
+毫末之利 3 l
+毫毛 178 n
+毫毛不犯 3 i
+毫法 3 v
+毫渗透压 3 n
+毫瓦 16 q
+毫秒 47 q
+毫秒炉 3 n
+毫笔 3 m
+毫管 3 v
+毫米 6548 q
+毫米数 2 l
+毫米汞柱 12 q
+毫米波 56 l
+毫针 27 n
+毬 35 zg
+毬果 3 v
+毬花 3 z
+毯 154 n
+毯子 110 n
+毳 7 g
+毵 23 x
+毹 3 x
+毽 10 n
+毽子 12 n
+氂 3 zg
+氂牛 3 vn
+氅 48 g
+氅衣 3 nr
+氆氇 66 n
+氆氌 3 n
+氇 2 x
+氈 3 zg
+氍 4 n
+氍毹 29 n
+氏 2573 ng
+氏家谱 3 n
+氏族 1012 n
+氏族公社 3 n
+氏族社会 3 n
+氏族聚落 3 n
+氏族谱 3 n
+氏杆菌 3 n
+氏症 3 n
+氏硬度 3 n
+氏谱 3 n
+氐 420 g
+民 6640 ng
+民不堪命 4 i
+民不畏死 3 i
+民不聊生 77 i
+民丰 24 nz
+民丰县 4 ns
+民为 3 n
+民为贵 3 l
+民为贵君 3 l
+民为邦本 3 l
+民主 8513 n
+民主专政 3 n
+民主主义 652 n
+民主人士 309 n
+民主作风 3 n
+民主党 376 nt
+民主党人 24 n
+民主党员 3 n
+民主党派 582 n
+民主决策 3 n
+民主制 60 n
+民主制度 3 n
+民主化 158 n
+民主协商 3 n
+民主型 10 n
+民主建议 3 n
+民主德国 87 ns
+民主思想 3 n
+民主性 10 n
+民主推选 3 n
+民主改革 117 l
+民主政体 3 n
+民主权 3 n
+民主权利 3 n
+民主权力 3 n
+民主法制 3 n
+民主派 200 n
+民主测评 3 n
+民主潮流 3 n
+民主监督 3 n
+民主联盟 76 nt
+民主自由 3 n
+民主评议 3 n
+民主运动 3 nz
+民主选举 3 n
+民主集中 3 nt
+民主集中制 941 n
+民主革命 519 nz
+民主革命家 10 nz
+民乐 72 n
+民乐县 3 ns
+民事 1384 n
+民事判决 3 n
+民事或 3 l
+民事权利 39 n
+民事案件 3 n
+民事法庭 4 n
+民事法律 3 n
+民事犯 3 n
+民事纠纷 3 z
+民事行为 3 n
+民事行政 3 n
+民事裁定 3 n
+民事诉状 3 n
+民事诉讼 3 l
+民事责任 3 n
+民享 3 v
+民以食为天 23 l
+民企 48 j
+民众 1793 n
+民众乐园 3 n
+民众代表 3 nz
+民众党 4 nt
+民众团体 3 nt
+民众服务 3 l
+民俗 521 n
+民俗学 64 n
+民俗学家 4 n
+民俗文化 3 n
+民俗旅游 3 n
+民俗村 26 n
+民俗论 3 n
+民俗风情 3 n
+民俗馆 3 n
+民保于信 3 l
+民债 3 n
+民党 21 n
+民兵 999 n
+民兵组织 3 nt
+民初 65 b
+民利 3 n
+民力 30 n
+民办 520 n
+民办公助 3 n
+民办大学 3 nt
+民办学校 3 nt
+民办小学 3 n
+民办教师 279 n
+民办教育 3 l
+民办活动 3 l
+民办科技 3 nt
+民办非 3 n
+民办高校 3 nt
+民勤 19 n
+民勤县 4 n
+民医院 3 nt
+民友联 5 nt
+民变 3 n
+民告官 3 n
+民命 7 n
+民和 102 n
+民和县 3 ns
+民和委 5 nt
+民和年丰 3 nz
+民品 16 n
+民商 3 n
+民商事 9 n
+民商法 8 n
+民团 49 n
+民园 2 n
+民困国贫 3 l
+民国 1570 n
+民国初年 3 nz
+民国日报 3 nz
+民国时期 3 b
+民垸 3 n
+民声 6 n
+民夫 75 n
+民女 88 n
+民妇 3 n
+民妻 3 n
+民委 30 n
+民宅 61 n
+民安 26 n
+民安国泰 3 nz
+民安物阜 3 ns
+民害 3 n
+民家 3 n
+民家妇女 3 n
+民宿 4 n
+民富 3 a
+民富国强 2 nt
+民居 163 n
+民工 558 n
+民工潮 5 n
+民工荒 3 n
+民巷 2 n
+民庭 3 n
+民康物阜 3 ns
+民建 306 a
+民建中央 6 nt
+民建联 3 nt
+民德 21 n
+民心 384 n
+民心向背 4 n
+民心工程 3 l
+民心所向 7 i
+民心者 5 n
+民忠 3 n
+民性 3 n
+民怨 30 n
+民怨沸腾 29 i
+民情 130 n
+民情土俗 3 i
+民惟邦本 3 i
+民意 379 n
+民意代表 3 n
+民意基础 3 n
+民意机关 3 l
+民意机构 3 n
+民意沸腾 3 i
+民意测验 72 n
+民意调查 3 l
+民愤 59 a
+民户 3 n
+民房 98 n
+民报 3 n
+民政 2298 n
+民政党 6 nt
+民政厅 24 nt
+民政厅长 3 b
+民政局 52 nt
+民政局长 5 n
+民政工作 3 n
+民政部 91 nt
+民政部门 87 n
+民教馆 3 nt
+民族 20524 n
+民族东路 3 ns
+民族主义 575 n
+民族主义党 3 nt
+民族主义者 83 n
+民族之林 44 nz
+民族乐器 3 n
+民族乐派 3 n
+民族乡 3357 n
+民族事务 3 n
+民族党 22 nt
+民族共同语 19 nz
+民族出版社 2 nt
+民族利益 3 n
+民族化 52 n
+民族区域 3 n
+民族压迫 3 n
+民族史 22 n
+民族和解 3 n
+民族团结 3 n
+民族大义 3 nz
+民族委员会 12 nt
+民族学 124 nt
+民族学家 26 n
+民族宗教 3 nt
+民族尊严 3 n
+民族平等 3 l
+民族形式 7 l
+民族志 3 n
+民族性 47 n
+民族情 3 n
+民族情绪 12 n
+民族意识 3 n
+民族所 73 nt
+民族文化宫 2 n
+民族服装 3 n
+民族服饰 3 n
+民族村 6 n
+民族民主 3 n
+民族民间 3 n
+民族气节 3 n
+民族特点 3 n
+民族特色 3 n
+民族班 10 n
+民族矛盾 3 l
+民族精英 3 nz
+民族素质 3 n
+民族纠纷 3 z
+民族自决 18 l
+民族自决权 18 l
+民族自治 1348 nz
+民族至上 3 l
+民族舞 8 n
+民族色彩 3 n
+民族英雄 98 n
+民族融合 3 n
+民族街 3 ns
+民族西路 3 ns
+民族解放 3 l
+民族语 3 nz
+民族语言 3 n
+民族败类 3 n
+民族资产 3 n
+民族运动 35 nz
+民族音乐 3 n
+民族风情 3 n
+民族风格 3 n
+民族魂 3 n
+民昌 2 ns
+民智 26 n
+民智未开 3 i
+民有 3 b
+民有菜色 3 n
+民望 7 n
+民本 3 n
+民本主义 2 n
+民机 26 n
+民权 213 n
+民权东路 3 nz
+民权主义 40 n
+民权初步 3 l
+民权县 3 n
+民权思想 3 n
+民权西路 3 n
+民权路 3 n
+民权运动 3 l
+民校 7 n
+民歌 418 n
+民歌情 3 n
+民歌手 3 l
+民歌节 3 l
+民殷国富 3 v
+民殷财阜 3 ns
+民气 27 n
+民治 3 n
+民法 325 n
+民法典 50 n
+民法学 30 nt
+民法通则 3 n
+民淳俗厚 3 z
+民熙物阜 3 ns
+民爆 13 a
+民生 452 n
+民生东路 3 nt
+民生主义 63 n
+民生乐刊 3 n
+民生凋敝 8 i
+民生国计 3 l
+民生在勤 3 n
+民生报 3 n
+民生涂炭 3 n
+民生渠 3 n
+民生西路 3 n
+民生路 2 n
+民生银行 29 nt
+民生问题 3 n
+民用 1372 n
+民用产品 3 n
+民用化 3 n
+民用型 12 n
+民用工业 3 n
+民用建筑 3 l
+民用机 10 n
+民用机场 3 n
+民用气 3 n
+民用航空 3 nt
+民用船 3 n
+民用飞机 3 n
+民田 3 n
+民百 10 nz
+民盟 288 n
+民盟中央 23 nt
+民盟会 3 nt
+民盟重庆市委 6 nt
+民社 3 n
+民社党 16 nt
+民穷财匮 3 i
+民穷财尽 12 i
+民窑 9 n
+民粹 3 b
+民粹主义 15 n
+民粹派 31 n
+民约论 3 n
+民胞物与 3 n
+民脂民膏 40 n
+民膏民脂 3 n
+民舍 7 n
+民航 548 j
+民航业 2 n
+民航史 2 n
+民航局 11 nt
+民航总局 110 nt
+民航机 9 n
+民航机场 3 n
+民船 23 n
+民营 540 b
+民营事业 3 n
+民营企业 3 n
+民营公司 3 n
+民营公车 3 n
+民营化 10 n
+民行 6 n
+民警 393 n
+民计 3 n
+民诉 3 v
+民诉法 3 n
+民调 18 n
+民谚 44 n
+民谣 90 n
+民谣吉他 3 i
+民谣歌手 3 i
+民负 3 n
+民贵君轻 3 i
+民贼 8 n
+民贼独夫 3 i
+民运 19 n
+民运人士 3 n
+民运会 3 j
+民运部 2 nt
+民进 75 a
+民进中央 8 nt
+民进党 61 nt
+民选 171 n
+民选总统 3 n
+民都洛 8 ns
+民间 3867 n
+民间中央 3 nt
+民间传说 3 l
+民间团体 3 n
+民间工艺 3 n
+民间性 3 n
+民间故事 3 n
+民间文化 3 n
+民间文学 198 n
+民间文艺 3 n
+民间组织 3 nt
+民间舞 69 n
+民间舞团 7 n
+民间舞蹈 3 n
+民间艺人 3 n
+民间艺术 108 n
+民间艺术团 2 nt
+民间语 4 nz
+民防 37 n
+民防体制 3 n
+民防建设 3 l
+民阵 11 n
+民院路 256 n
+民隐 3 ns
+民需 3 n
+民革 78 n
+民革中央 8 nt
+民风 85 n
+民风纯朴 3 i
+民食 15 n
+氓 27 x
+氓流 3 n
+气 17826 n
+气不公 3 i
+气不忿儿 3 i
+气不打 3 i
+气不气 3 i
+气不过 59 l
+气举 3 n
+气举管柱 3 n
+气举阀 3 n
+气义相投 3 i
+气乎乎 2 z
+气井 6 n
+气井产能 3 n
+气人 48 n
+气传病害 3 n
+气体 2609 n
+气体云 5 n
+气体净化 3 n
+气体动力 3 n
+气体性 3 n
+气体燃料 3 n
+气体设备 3 n
+气侯 3 n
+气促 20 a
+气候 6832 n
+气候分类 3 n
+气候区 3 n
+气候区划 3 n
+气候变化 3 n
+气候变迁 3 n
+气候因子 3 n
+气候图 3 n
+气候型 3 n
+气候学 50 n
+气候宜人 3 n
+气候带 84 n
+气候异常 3 n
+气候志 3 n
+气候灾害 3 n
+气候系统 3 n
+气候调节 3 n
+气候资源 3 n
+气儿 67 n
+气充志骄 3 i
+气克斗牛 3 n
+气冲 3 n
+气冲冲 37 z
+气冲斗牛 2 n
+气冲牛斗 3 i
+气冲霄汉 3 i
+气决泉达 3 n
+气冷 19 z
+气割 8 n
+气力 302 n
+气力用尽 3 i
+气力输送 3 n
+气功 184 n
+气功师 7 n
+气功波 3 n
+气动 187 n
+气动元件 3 n
+气动力 35 n
+气动工具 3 n
+气动平衡 3 i
+气动式 3 n
+气动弹性 3 n
+气动液压 3 n
+气动阀 2 n
+气势 1221 n
+气势不凡 3 i
+气势凌人 3 i
+气势如虹 20 i
+气势恢宏 149 l
+气势汹汹 119 i
+气势浩大 3 i
+气势磅礴 81 i
+气势雄伟 3 l
+气化 154 n
+气化室 3 n
+气化炉 3 n
+气压 338 n
+气压层 3 n
+气压机 3 n
+气压表 13 n
+气压计 29 n
+气口 3 n
+气吁吁 3 i
+气吞山河 11 i
+气吞河山 3 i
+气吞湖海 3 i
+气吞牛斗 3 i
+气吞虹蜺 3 n
+气味 1024 n
+气味儿 4 n
+气味相投 12 i
+气呼呼 102 z
+气咻咻 21 z
+气哼哼 48 z
+气喘 143 n
+气喘吁吁 237 i
+气喘咻咻 3 z
+气喘喘 16 i
+气喘嘘嘘 15 z
+气喘如牛 5 i
+气喘病 7 n
+气嘘嘘 3 z
+气嘟嘟 3 z
+气囊 341 n
+气团 111 n
+气圈 4 n
+气在心里 3 i
+气场 5 n
+气块 3 n
+气垫 57 n
+气垫导轨 3 n
+气垫床 3 n
+气垫桌 3 n
+气垫船 49 n
+气壮如牛 3 i
+气壮山河 18 i
+气壮河山 3 i
+气壮理直 3 i
+气壮胆粗 3 i
+气壳 3 n
+气头 3 n
+气头上 34 n
+气孔 209 n
+气孔率 3 n
+气学 3 n
+气宇 17 n
+气宇不凡 3 i
+气宇昂昂 3 i
+气宇轩昂 38 i
+气宗 3 n
+气定神闲 28 i
+气室 13 n
+气密 42 n
+气密性 26 n
+气层 3 n
+气平 3 n
+气度 184 n
+气度不凡 12 i
+气弹簧 3 n
+气得志满 3 i
+气忍声吞 3 i
+气忿 3 i
+气态 87 n
+气急 79 a
+气急攻心 3 i
+气急败丧 3 i
+气急败坏 191 i
+气性 58 n
+气息 1376 n
+气息奄奄 39 i
+气恼 287 a
+气愤 649 n
+气愤填膺 3 i
+气愤愤 49 n
+气慨 8 a
+气户 3 n
+气手枪 3 n
+气数 70 n
+气数已尽 37 l
+气断声吞 3 i
+气旋 259 n
+气旋雨 3 n
+气昂 3 a
+气昂昂 54 z
+气昏 3 v
+气机 47 n
+气极 3 n
+气极败坏 3 i
+气枪 9 n
+气枪打靶 3 n
+气枪震源 3 n
+气柜 3 n
+气根 3 n
+气楼 3 n
+气概 562 n
+气概不凡 3 i
+气概激昂 3 i
+气模厂 3 n
+气步枪 6 n
+气死 202 n
+气死人 3 n
+气死我 3 n
+气死我了 3 l
+气气 3 n
+气氛 2619 n
+气汹汹 9 i
+气沼 3 n
+气泡 177 n
+气泡室 3 n
+气泡比 3 i
+气泡病 3 n
+气泡膜 3 n
+气泵 9 n
+气派 580 n
+气派豪华 3 n
+气派非凡 3 l
+气流 621 n
+气流磨 3 n
+气流组织 3 n
+气测井 3 n
+气浪 31 n
+气浮 4 v
+气海 3 n
+气海穴 3 n
+气消 3 v
+气消胆夺 3 i
+气涌如山 3 i
+气涡轮 3 n
+气涡轮机 3 n
+气温 2830 n
+气温计 3 n
+气源 4 n
+气溶胶 45 n
+气滞 73 n
+气满志得 3 i
+气满志骄 3 i
+气滤 3 n
+气炉 3 n
+气炸 3 n
+气焊 7 n
+气焰 152 n
+气焰万丈 3 i
+气焰嚣张 53 i
+气焰熏天 3 z
+气煞 3 n
+气煤 12 n
+气球 266 n
+气瓶 109 n
+气田 65 n
+气疯 3 v
+气盛 51 a
+气相 85 n
+气相反应 4 i
+气相色谱仪 4 n
+气眼 3 n
+气短 107 n
+气砂锚 3 n
+气穴 3 n
+气窗 7 n
+气站 9 n
+气竭声嘶 3 i
+气筒 48 n
+气管 233 n
+气管炎 55 n
+气粗 20 n
+气结 3 n
+气绝 113 v
+气绝身亡 17 i
+气缸 41 n
+气缸套 3 n
+气缸数 3 n
+气缸盖 3 n
+气罐 5 n
+气署 3 n
+气肿 3 n
+气胞 3 n
+气胸 33 n
+气脉 13 n
+气腔 3 n
+气腹 3 n
+气舍 3 n
+气艇 3 n
+气色 139 n
+气节 264 n
+气苗 3 n
+气若游丝 3 i
+气藏气 3 n
+气虚 136 n
+气蚀 5 n
+气血 439 n
+气血方刚 3 n
+气街 3 n
+气袋 2 n
+气话 79 n
+气调 11 n
+气谊相投 3 n
+气象 1512 n
+气象一新 3 i
+气象万千 27 i
+气象专家 3 n
+气象仪 2 n
+气象卫星 69 n
+气象厅 3 n
+气象台 70 n
+气象台站 8 n
+气象图 3 n
+气象学 176 n
+气象学家 51 n
+气象学校 3 n
+气象官 3 n
+气象局 33 n
+气象情报 3 n
+气象报告 3 n
+气象日 3 n
+气象景观 3 n
+气象条件 3 n
+气象法 3 n
+气象火箭 3 n
+气象界 3 n
+气象站 50 n
+气象网 3 n
+气象要素 3 n
+气象观测 3 i
+气象计 3 n
+气象部门 3 n
+气象预报 3 n
+气质 650 n
+气质佳 3 nz
+气质端庄 3 n
+气质类型 3 n
+气质高雅 3 n
+气贯长虹 6 i
+气轮机 3 n
+气运 89 n
+气逾霄汉 3 i
+气道 81 n
+气量 73 n
+气钻 3 n
+气锁 3 n
+气锁水泥 3 n
+气锅 3 n
+气锅鸡 3 n
+气锤 3 n
+气门 32 n
+气门嘴 3 n
+气门心 2 n
+气门数 3 n
+气门芯 3 n
+气闷 123 a
+气闸 7 n
+气阀 13 n
+气阻 6 n
+气隙 12 n
+气雾 5 n
+气雾剂 8 n
+气韵 66 n
+气顶驱动 3 i
+气馁 142 a
+气骄志满 3 i
+气魄 207 n
+气鼓鼓 44 i
+氕 6 g
+氖 538 n
+氖气 3 n
+氖灯 3 n
+氖管 9 n
+氘 69 g
+氘交换 3 n
+氘代溶剂 3 n
+氘化 3 n
+氘核 3 n
+氙 46 n
+氙弧灯 2 n
+氙气 7 n
+氙气灯 3 n
+氙灯 17 n
+氚 52 g
+氚化物 3 v
+氛 91 n
+氛云 3 n
+氛围 689 n
+氛雾 3 n
+氛雾冥冥 3 v
+氛霾 3 n
+氜 3 zg
+氟 483 nz
+氟乙 3 nz
+氟乙酸 3 nz
+氟利昂 29 nz
+氟化 35 nz
+氟化合物 13 n
+氟化氢 34 nz
+氟化氨 3 n
+氟化物 63 n
+氟化钙 5 nz
+氟化钠 3 nz
+氟化钡 3 nz
+氟化钾 3 nz
+氟化铀 3 n
+氟化银 3 nz
+氟化锂 2 nz
+氟化镁 3 nz
+氟哌酸 8 nz
+氟嗪酸 2 n
+氟塑料 3 nz
+氟尿嘧啶 3 n
+氟康唑 8 nz
+氟橡胶 9 n
+氟气 3 n
+氟氯烷 2 nz
+氟烷 2 nz
+氟牙症 3 nz
+氟石 8 nz
+氟硅酸 2 nz
+氟碳 18 nz
+氟碳漆 3 nz
+氟碳铈矿 2 n
+氟磷灰石 3 nz
+氟脲嘧啶 4 n
+氟里昂 9 nz
+氟骨病 3 n
+氟骨症 6 nz
+氡 74 g
+氢 1011 n
+氢化 99 n
+氢化氧 3 n
+氢化油 3 n
+氢化物 24 n
+氢化硫 3 nz
+氢化钠 3 nz
+氢化钾 2 nz
+氢原子 177 n
+氢原素 3 n
+氢同位素 3 n
+氢弹 170 n
+氢气 206 n
+氢气球 6 n
+氢氟酸 41 nz
+氢氧 3 n
+氢氧化 7 n
+氢氧化汞 3 nz
+氢氧化物 46 n
+氢氧化钙 24 nz
+氢氧化钠 118 nz
+氢氧化钡 2 nz
+氢氧化钾 32 nz
+氢氧化铁 27 n
+氢氧化铋 3 n
+氢氧化铜 3 n
+氢氧化铝 15 nz
+氢氧化铯 3 n
+氢氧化铵 3 nz
+氢氧化锂 3 nz
+氢氧化锌 3 nz
+氢氧化锰 3 nz
+氢氧化镁 4 nz
+氢氧化镍 2 n
+氢氧基 3 n
+氢氧根 13 nz
+氢氧焰 3 n
+氢氯酸 3 nz
+氢氰弹 3 n
+氢氰酸 31 nz
+氢溴酸 8 nz
+氢硫酸 3 nz
+氢碘酸 7 n
+氢离子 3 n
+氢羧基化 3 n
+氢能 14 n
+氢脆 4 n
+氢酸 6 n
+氢键 46 n
+氢镍 2 n
+氣 942 zg
+氤 34 n
+氤氲 62 n
+氥 56 zg
+氦 355 n
+氦族 3 n
+氦气 27 n
+氦氖 3 n
+氦氖激光器 2 n
+氦灯 3 n
+氧 1319 n
+氧乙炔 3 n
+氧分压 22 n
+氧分子 16 n
+氧割 3 v
+氧化 1260 v
+氧化亚 3 nz
+氧化亚氮 3 nz
+氧化亚砷 3 n
+氧化亚铜 4 n
+氧化作用 3 n
+氧化剂 98 n
+氧化去胶 3 n
+氧化塔 3 n
+氧化应激 3 n
+氧化式 3 n
+氧化掩模 3 nz
+氧化氢 3 n
+氧化氮 2 n
+氧化汞 19 n
+氧化焰 3 n
+氧化物 343 n
+氧化电位 3 n
+氧化硅 7 n
+氧化硫 18 n
+氧化硫硫 3 nz
+氧化碳 3 n
+氧化磷 3 n
+氧化筒 3 n
+氧化聚合 3 n
+氧化胺 3 n
+氧化酶 19 n
+氧化钇 3 nz
+氧化钙 30 n
+氧化钛 3 n
+氧化钠 11 n
+氧化钡 3 n
+氧化钨 2 n
+氧化钴 5 n
+氧化钼 3 nz
+氧化钾 10 n
+氧化铀 3 n
+氧化铁 25 n
+氧化铁红 3 nz
+氧化铅 11 nz
+氧化铍 9 n
+氧化铜 52 n
+氧化铝 130 n
+氧化铬 11 n
+氧化银 15 n
+氧化锂 3 nz
+氧化锆 6 n
+氧化锌 30 n
+氧化锗 2 n
+氧化锰 30 n
+氧化锶 4 n
+氧化镁 30 n
+氧化镉 4 n
+氧化镍 2 n
+氧原子 50 n
+氧合作用 3 n
+氧吧 265 n
+氧基 3 n
+氧指数 3 n
+氧效应 3 n
+氧气 513 n
+氧气瓶 39 n
+氧气站 3 n
+氧气筒 3 n
+氧气管 3 n
+氧气罐 3 n
+氧气袋 3 n
+氧氟沙星 9 n
+氧水 3 n
+氧炔吹管 3 vn
+氧舱 2 n
+氧连作用 3 n
+氧酸盐 3 n
+氧量 24 n
+氨 2769 n
+氨乙基 3 nz
+氨化 262 n
+氨化池 3 n
+氨化泥炭 3 n
+氨基 435 n
+氨基丁酸 3 nz
+氨基化 3 nz
+氨基咪唑 3 nz
+氨基嘌呤 3 nz
+氨基塑料 3 nz
+氨基树脂 3 n
+氨基氮 3 nz
+氨基甲酸酯 10 nz
+氨基硫脲 3 nz
+氨基糖 6 n
+氨基脲 4 nz
+氨基蝶呤 3 n
+氨基酸 548 nz
+氨气 32 n
+氨氮 8 nz
+氨氯地平 10 nz
+氨水 63 n
+氨甲喋呤 3 n
+氨甲蝶呤 3 n
+氨甲酰化 3 nz
+氨甲酰基 3 nz
+氨硫脲 2 nz
+氨碱法 3 n
+氨磺胺 3 nz
+氨纶 11 n
+氨羰基化 3 v
+氨肽酶 3 n
+氨苄 11 nz
+氨苄西林 3 nz
+氨苯喋啶 6 n
+氨苯砜 3 nz
+氨茴霉素 3 n
+氨茶碱 7 n
+氨解 3 n
+氨酰基 3 nz
+氨酰基位 3 n
+氨酸 3 n
+氩 112 n
+氩弧焊 3 nz
+氩气 7 nz
+氪 84 g
+氫 319 zg
+氬 626 zg
+氭 337 zg
+氮 671 n
+氮化 15 n
+氮化合物 60 n
+氮化物 17 n
+氮化硅 3 n
+氮化硼 10 nz
+氮化钛 3 nz
+氮周转 3 n
+氮固持 3 n
+氮宾 3 n
+氮尿嘧啶 3 n
+氮尿苷 3 n
+氮尿苷酸 3 n
+氮损失 3 n
+氮气 82 n
+氮氧化合物 5 n
+氮氧化物 34 n
+氮氧化硅 3 nz
+氮源 3 n
+氮矿化 3 n
+氮磷 2 n
+氮素 33 n
+氮肥 88 n
+氮肥厂 17 n
+氮胸苷 3 n
+氮芥 12 n
+氮苯 3 n
+氮蓝四唑 3 n
+氮鸟嘌呤 3 n
+氯 503 n
+氯丁二烯 9 nz
+氯丁橡胶 16 n
+氯丁胶 3 nz
+氯丙嗪 19 nz
+氯乙烯 36 nz
+氯乙烷 34 nz
+氯乙酸 3 nz
+氯乙酸钠 2 nz
+氯仿 102 v
+氯仿沥青 3 n
+氯仿牙胶 3 n
+氯化 155 nz
+氯化亚砜 4 nz
+氯化亚砷 3 n
+氯化亚铜 2 nz
+氯化亚锡 2 nz
+氯化作用 3 n
+氯化氢 67 nz
+氯化氨 3 n
+氯化氰 3 nz
+氯化汞 11 nz
+氯化物 54 n
+氯化石蜡 3 nz
+氯化碘 3 nz
+氯化苄 13 nz
+氯化苦 3 n
+氯化金 3 nz
+氯化钙 24 nz
+氯化钠 117 nz
+氯化钡 3 nz
+氯化钯 4 nz
+氯化钾 18 nz
+氯化铁 3 nz
+氯化铅 3 nz
+氯化铜 4 nz
+氯化铝 3 nz
+氯化铯 3 n
+氯化铵 34 nz
+氯化银 7 nz
+氯化锂 3 nz
+氯化锌 9 nz
+氯化镁 12 nz
+氯喹 11 n
+氯四环素 3 nz
+氯地孕酮 2 nz
+氯气 138 n
+氯氟烃 7 n
+氯氨酮 3 nz
+氯水 3 n
+氯沙坦 5 nz
+氯甲基化 3 nz
+氯硅烷 2 nz
+氯硝柳胺 4 nz
+氯碱 17 n
+氯磺 3 n
+氯离子 3 n
+氯纶 8 nz
+氯纸 3 nz
+氯羰基化 3 v
+氯胺酮 3 nz
+氯苯 27 nz
+氯酚红 3 nz
+氯酸 3 nz
+氯酸盐 3 nz
+氯酸钙 3 nz
+氯酸钠 3 nz
+氯酸钾 23 nz
+氯霉素 39 n
+氯霉素乙 3 n
+氰 58 nz
+氰化 20 nz
+氰化氢 8 nz
+氰化法 3 nz
+氰化物 31 n
+氰化钠 10 nz
+氰化钾 11 nz
+氰尿酸 3 nz
+氰戊菊酯 4 nz
+氰氨化钙 3 nz
+氰甲基化 3 nz
+氰酸 10 nz
+氰酸盐 3 nz
+氰酸酯 3 nz
+氱 261 zg
+氲 170 x
+氳 278 zg
+水 24314 n
+水上 727 s
+水上人家 3 l
+水上保险 3 n
+水上公园 7 n
+水上居民 2 nr
+水上景观 3 n
+水上机动 3 l
+水上漂 12 nr
+水上职业 3 l
+水上警察 3 n
+水上运动 3 l
+水上飞机 48 l
+水上飞行 3 i
+水下 1093 s
+水下安装 3 n
+水下景观 3 n
+水下粘合 3 n
+水下试验 3 n
+水东 31 n
+水东乡 3 ns
+水东岸 2 nr
+水中 2184 s
+水中捉月 3 i
+水中捞月 5 i
+水中毒 3 l
+水中著盐 3 n
+水丸 5 n
+水之秀 2 nr
+水之阳 3 nr
+水乐维 6 n
+水乡 447 n
+水乡泽国 3 ns
+水乳之契 3 n
+水乳交融 23 n
+水云 53 n
+水云天 3 nr
+水云道 2 nr
+水云道人 10 nr
+水云间 3 n
+水井 186 n
+水井坊 3 n
+水井街 2 nr
+水产 3249 n
+水产业 284 n
+水产丰富 3 l
+水产品 917 n
+水产学校 3 n
+水产局 261 n
+水产网 3 n
+水产资源 3 n
+水产部 2 n
+水产饲料 3 n
+水亮 3 nr
+水仗 3 n
+水仙 143 n
+水仙簪 2 n
+水仙花 38 nr
+水仙花头 2 n
+水代兵 6 n
+水以东 3 nr
+水价 68 n
+水份 33 n
+水伊紫 7 nr
+水伯 5 n
+水位 732 n
+水位图 3 n
+水位站 3 n
+水位计 3 n
+水体 312 n
+水作渠 2 n
+水佩风裳 3 nr
+水侵 3 v
+水侵系数 3 l
+水俣湾 10 nr
+水俣病 14 n
+水俱病 3 l
+水候病 3 n
+水儿 11 n
+水光 2 n
+水光山色 3 n
+水克火 3 nr
+水关 28 n
+水兴 4 b
+水兵 198 n
+水具 3 n
+水兽 3 n
+水军 334 n
+水冰 2 nr
+水冰冷 2 nr
+水冲 11 n
+水冲式 3 n
+水冲港 3 nr
+水冷 3 nr
+水冷却 7 l
+水冷壁 2 n
+水冷式 6 n
+水冻凝 4 nr
+水净化 3 n
+水净鹅飞 3 nz
+水准 571 n
+水准仪 21 nz
+水准器 14 n
+水准图 3 n
+水准测量 3 n
+水准面 40 n
+水凌凌 3 nr
+水分 912 n
+水分亏缺 3 l
+水分子 3 n
+水分平衡 3 i
+水分补偿 3 i
+水分调节 3 n
+水刘洪 2 nr
+水利 1504 n
+水利业 2 n
+水利会 3 n
+水利制 3 n
+水利化 9 n
+水利厅 7 n
+水利学 9 n
+水利学家 3 n
+水利局 13 n
+水利工程 264 n
+水利建设 3 l
+水利枢纽 156 l
+水利水电 3 n
+水利电力 3 n
+水利科学 7 l
+水利站 2 n
+水利系 3 n
+水利网 3 n
+水利资源 3 n
+水利部 67 n
+水利部长 2 n
+水利部门 9 n
+水到渠成 62 i
+水到鱼行 3 l
+水刷石 2 n
+水剂 15 n
+水剩山残 3 i
+水力 1951 n
+水力发电 80 n
+水力发电站 11 n
+水力发电量 4 n
+水力学 65 n
+水力效率 3 n
+水力模拟 3 i
+水力资源 3 n
+水力部 3 n
+水功率 3 n
+水务 72 n
+水务局 9 n
+水务龙头 2 n
+水势 134 n
+水势汹涌 3 i
+水化 36 n
+水化学 3 n
+水化物 3 n
+水北 9 s
+水区 28 n
+水华鱼 2 n
+水协 4 j
+水南 8 s
+水南岸 4 n
+水印 29 n
+水危机 3 l
+水厂 39 n
+水压 75 n
+水压机 40 n
+水压计 3 n
+水压试验 3 n
+水压驱动 3 n
+水原 8 n
+水口 37 n
+水口山 10 n
+水口料 3 n
+水口镇 5 n
+水古 3 n
+水叮当 3 l
+水可载舟 2 i
+水右坝 5 nr
+水合 41 n
+水合氯醛 9 nz
+水合物 24 n
+水合电子 3 n
+水合肼 3 n
+水吉镇 2 nr
+水吧 16 n
+水听器 3 n
+水咀 3 ns
+水嘴 3 n
+水器 4 n
+水囊 3 n
+水团 2 n
+水圈 69 n
+水土 708 n
+水土不服 33 l
+水土保持 3 nr
+水土流失 3 i
+水土资源 3 n
+水地 70 n
+水圹 3 n
+水均益 2 n
+水坑 12 n
+水坝 85 n
+水坡集 56 n
+水垢 16 n
+水城 119 n
+水城县 4 ns
+水城路 3 n
+水域 1089 n
+水基 13 n
+水堰 2 n
+水塔 36 n
+水塘 121 n
+水墨 164 n
+水墨画 72 n
+水声 220 n
+水声学 9 l
+水壶 202 n
+水壶盖 3 ns
+水大侠 5 nr
+水天一色 12 i
+水太凉 2 nr
+水太浅 2 nr
+水夫 2 n
+水夫谣 3 nr
+水头 54 n
+水头乡 3 n
+水头镇 3 n
+水如烟 3 i
+水妖 7 n
+水妖精 3 n
+水委 4 n
+水孔 4 n
+水宜清 2 nr
+水客 2 n
+水害 17 n
+水家电 3 n
+水宿山行 3 n
+水宿风餐 3 n
+水密 3 n
+水密型 4 n
+水密门 2 n
+水富 3 n
+水富县 3 ns
+水寨 85 n
+水封 3 n
+水射流 3 n
+水尺 5 n
+水尽山穷 3 i
+水尽节 2 l
+水尽鹅飞 3 i
+水层 97 n
+水岩 6 n
+水岱 3 ns
+水岸 3 s
+水川 3 n
+水川道 5 nr
+水工 88 n
+水巷 2 n
+水市乡 3 n
+水师 239 n
+水师营 3 nr
+水帘 29 n
+水帘洞 73 n
+水带 21 n
+水幕 13 n
+水平 13880 n
+水平井 3 n
+水平仪 4 nr
+水平地带 3 n
+水平如镜 3 l
+水平尾翼 3 n
+水平度 2 n
+水平式 6 n
+水平弦 3 nr
+水平抗性 3 n
+水平极化 3 n
+水平极性 3 n
+水平沟 2 ns
+水平线 13 n
+水平线上 3 l
+水平舵 3 n
+水平衡 3 nr
+水平裂缝 3 n
+水平角 3 n
+水平阻生 3 n
+水平降水 3 n
+水平面 35 n
+水床 3 n
+水库 1186 n
+水库养鱼 3 n
+水底 615 n
+水底捞月 3 i
+水底捞针 3 n
+水底摸月 3 i
+水底灯 3 n
+水底纳瓜 3 ns
+水府庙 3 nr
+水廊 3 n
+水引擎 3 nr
+水彩 23 n
+水彩渲染 3 nr
+水彩画 61 n
+水彩画家 3 n
+水彩笔 3 n
+水彩颜料 3 i
+水影 10 n
+水影山 2 n
+水循环 6 n
+水德代 2 nr
+水德尚 2 nr
+水德应 4 nr
+水德王 6 nr
+水心亭 2 nr
+水性 339 n
+水性扬花 3 i
+水性杨花 18 n
+水性油墨 3 n
+水性漆 3 n
+水性胶 2 n
+水怪 21 n
+水患 58 n
+水情 35 n
+水感 3 n
+水成土 3 n
+水成岩 5 nr
+水成景观 3 l
+水战 52 n
+水户 4 n
+水房 17 n
+水手 460 n
+水手服 3 n
+水手版 3 n
+水手衫 3 n
+水手长 2 n
+水手队 3 n
+水抱山环 3 i
+水政 4 n
+水敬洪 83 nr
+水文 660 n
+水文地质 3 n
+水文学 81 n
+水文学家 3 n
+水文局 2 n
+水文情势 3 n
+水文气象 3 n
+水文测验 3 n
+水文科学 3 l
+水文站 40 n
+水文过程 3 l
+水斗 2 n
+水断陆绝 3 i
+水族 345 n
+水族箱 10 n
+水族馆 30 n
+水无影 3 i
+水旱 71 n
+水旱灾 4 n
+水旱灾害 17 l
+水旱轮作 3 n
+水旺旺 3 nr
+水明山秀 3 nr
+水明楼 2 nr
+水星 131 n
+水星号 6 n
+水景 12 n
+水晶 1235 n
+水晶之恋 3 nr
+水晶体 12 n
+水晶像 3 n
+水晶制品 3 n
+水晶土 3 n
+水晶城 2 n
+水晶头 3 n
+水晶宫 78 n
+水晶板 3 n
+水晶棺 140 n
+水晶泥 3 n
+水晶灯 3 n
+水晶灯笼 3 n
+水晶照片 3 n
+水晶玻璃 3 n
+水晶球 12 n
+水晶男孩 3 n
+水晶石 68 n
+水晶礼品 3 n
+水晶般 3 z
+水晶节 3 n
+水晶花 3 n
+水晶鞋 2 n
+水晶项链 3 n
+水晶饰品 3 n
+水暖 10 n
+水暖器材 3 n
+水暖工 4 nr
+水暖配件 3 n
+水暖鸭 3 nz
+水曲柳 28 n
+水月庵 28 nr
+水月庵村 3 nr
+水月观音 7 n
+水月镜像 3 n
+水月镜花 3 n
+水木 6 n
+水木博 2 nr
+水木年华 3 nz
+水木清华 10 nr
+水木行 3 n
+水术 3 n
+水机 6 n
+水权 2 n
+水杉 48 n
+水村田 3 nr
+水来伸手 3 l
+水来土掩 22 i
+水杨树 3 nr
+水杨梅 3 nr
+水杨酸 34 n
+水杨酸甲酯 7 nz
+水杨酸钠 3 nz
+水杨醛 2 n
+水杯 15 n
+水杯子 3 n
+水松 13 n
+水松村 3 nr
+水果 1510 n
+水果刀 12 n
+水果市场 3 n
+水果店 3 n
+水果摊 6 n
+水果机 3 n
+水果汁 3 n
+水果渣 3 n
+水果湖 256 nr
+水果皮 3 n
+水果盘 2 n
+水果篮 3 n
+水果篮子 3 n
+水果糖 21 n
+水果罐头 3 n
+水果醋 3 n
+水果香精 3 n
+水枪 28 n
+水枯石烂 3 i
+水柜 14 n
+水柱 81 n
+水栅 3 n
+水标 3 n
+水栓 3 n
+水栖 8 b
+水校尉 11 nr
+水样 46 n
+水栽 3 n
+水桶 164 n
+水桶盖 3 n
+水桶腰 3 n
+水桷 3 n
+水楔不通 3 z
+水榭 51 n
+水槽 35 n
+水橇 16 n
+水殿 9 n
+水毁 3 v
+水母 136 n
+水母牛 3 n
+水母目虾 3 n
+水母网 3 n
+水毛花 2 n
+水气 152 n
+水气存 2 n
+水水生 2 n
+水汀 2 nrt
+水江 3 ns
+水池 188 n
+水池子 6 n
+水污染 126 b
+水污染源 3 n
+水汪汪 32 z
+水汽 134 n
+水汽氧化 3 n
+水沙 2 n
+水沟 80 n
+水沫 3 n
+水河 33 n
+水河川 2 ns
+水沸 3 v
+水沼 3 n
+水泄 3 v
+水泄不漏 3 i
+水泄不透 3 i
+水泄不通 105 i
+水泄银 2 nr
+水泉 12 n
+水泊 30 n
+水泊中 3 ns
+水泊梁山 20 ns
+水泊里 2 ns
+水法 40 n
+水泡 375 n
+水波 100 n
+水波不兴 3 l
+水波槽 3 nr
+水波纹 3 nr
+水波荡漾 3 nr
+水泥 1627 n
+水泥公司 3 n
+水泥制品 3 n
+水泥厂 68 n
+水泥地 21 n
+水泥块 7 n
+水泥墙 14 n
+水泥工 3 n
+水泥机械 3 n
+水泥板 16 n
+水泥柱 3 n
+水泥池 3 n
+水泥沙 3 n
+水泥浆 4 n
+水泥瓦 3 nr
+水泥石 3 n
+水泥砂浆 3 n
+水泥砖 3 n
+水泥管 3 n
+水泥网 3 n
+水泥船 13 n
+水泥袋 3 n
+水泥路 9 n
+水泥钉 3 n
+水注 3 n
+水泵 580 n
+水泵房 3 b
+水泻 4 n
+水泻剂 3 n
+水泼不进 26 l
+水泽 9 n
+水洁冰清 3 nr
+水洗 81 b
+水洗布 3 n
+水洗机 3 n
+水洗标 3 n
+水洛城 2 nr
+水洞 306 n
+水洩不通 3 z
+水洼 36 n
+水洼子 2 n
+水流 1241 n
+水流云散 3 i
+水流声 8 n
+水流花落 3 l
+水流花谢 3 i
+水流计 3 n
+水流量 40 n
+水浅 3 n
+水浇地 42 n
+水浒 126 n
+水浒传 174 nz
+水浜 2 n
+水浦 3 nz
+水浪 10 n
+水浮莲 2 nr
+水浴 75 n
+水浴加 8 nz
+水浴锅 3 n
+水浸 49 n
+水浸泡 2 nr
+水消毒 3 n
+水涌 2 n
+水涝 11 n
+水涡 5 n
+水涨船高 68 i
+水涯 3 n
+水液 8 n
+水淀 3 n
+水淀粉 3 n
+水淋淋 38 z
+水深 1313 n
+水深火热 76 i
+水淹 58 nr
+水淹七军 10 l
+水淹气井 3 l
+水清可鉴 3 i
+水清如 3 nr
+水清影 4 nr
+水清无鱼 3 l
+水清木 3 nr
+水清沙 3 nr
+水渌渌 2 z
+水渍 16 n
+水渍货 3 n
+水渍险 5 n
+水渔隐 13 nr
+水渠 52 n
+水温 470 n
+水温表 3 n
+水湾 2 n
+水湿 4 n
+水溏 3 l
+水源 678 n
+水源地 272 n
+水源林 5 nr
+水源路 3 n
+水源选择 3 nr
+水溜 3 n
+水溶 23 nr
+水溶性 93 n
+水溶液 205 n
+水溶溶 3 nr
+水滑梯 3 n
+水满为患 3 i
+水满金山 3 nr
+水滨 3 n
+水滴 165 n
+水滴形 6 n
+水滴成穿 3 i
+水滴石穿 5 i
+水漂 51 n
+水漂儿 3 nr
+水漉漉 3 z
+水漫 3 n
+水漫金山 9 n
+水潜夫 3 n
+水潭 123 n
+水潮 3 n
+水灌 2 n
+水灌城 3 nr
+水火 124 n
+水火不容 11 l
+水火不相 3 i
+水火不相容 13 i
+水火不辞 3 i
+水火不避 3 nr
+水火之中 19 l
+水火兵虫 3 n
+水火土 3 n
+水火无交 3 i
+水火无情 3 i
+水火棍 40 n
+水火相济 4 n
+水灯 6 n
+水灰比 3 n
+水灵 27 n
+水灵儿 3 nr
+水灵灵 32 nr
+水灶 3 n
+水灾 166 n
+水炮 11 n
+水烟 17 n
+水烟斗 3 n
+水烟筒 4 n
+水烟袋 100 n
+水煎包 2 n
+水煤气 8 n
+水煤浆 4 n
+水煮开 3 nr
+水煮蛋 3 nr
+水煮鱼 3 nr
+水牌 4 n
+水牛 123 n
+水牛儿 3 nr
+水牛城 3 nr
+水牛群 3 nr
+水牛角 4 n
+水牢 12 n
+水狗 3 n
+水獭 73 n
+水獭皮 3 n
+水玲珑 3 i
+水玻璃 9 n
+水珠 142 n
+水珠子 2 n
+水球 49 n
+水球场 3 n
+水球赛 3 n
+水球队 2 n
+水琉璃 3 n
+水瓢 14 n
+水瓮 11 n
+水瓶 20 n
+水瓶子 3 n
+水瓶座 3 n
+水生 629 n
+水生动物 3 n
+水生成 8 nr
+水生植物 89 l
+水生物 7 n
+水田 199 n
+水田芥 3 nr
+水电 775 n
+水电供应 3 l
+水电厂 2 n
+水电器 3 n
+水电局 4 n
+水电工 3 n
+水电工程 3 n
+水电段 3 n
+水电瓦斯 3 nz
+水电站 815 n
+水电费 11 n
+水电部 5 n
+水电部门 3 n
+水界 7 n
+水疗 35 n
+水疗医生 3 n
+水疗法 3 n
+水疱 51 n
+水痘 18 n
+水百龙 3 nr
+水皮 4 n
+水皮儿 3 nr
+水皰 3 z
+水盆 51 n
+水监 3 n
+水盟 3 n
+水相抗 2 nr
+水相望 2 nr
+水真腊 4 nr
+水石清华 3 nr
+水石盆景 3 ns
+水砂纸 3 n
+水硬性 6 n
+水碓 7 n
+水碓子 3 nr
+水碧山青 3 nr
+水碱 2 n
+水碾 3 nr
+水磨 59 n
+水磨功夫 3 n
+水磨坊 2 n
+水磨工夫 3 n
+水磨年糕 3 n
+水磨沟 3 n
+水磨沟区 3 n
+水磨石 10 n
+水磨粉 3 n
+水礼 3 n
+水神 38 n
+水禽 43 n
+水禾 2 n
+水秀山明 3 nr
+水程 7 n
+水稻 1109 n
+水稻所 3 n
+水稻田 15 nr
+水稻种子 2 l
+水穷山尽 3 i
+水突 3 n
+水窖 5 n
+水立方 3 n
+水端 5 n
+水竹 16 n
+水笔 4 n
+水笔仔 3 nr
+水笙伏 2 nr
+水笙吓 3 nr
+水笙喜 2 nr
+水笙怒 2 nr
+水笙望 2 nr
+水笙连 3 nr
+水笼头 2 n
+水筏 3 n
+水筒 3 n
+水管 84 n
+水管员 3 n
+水管系 3 n
+水管车 3 n
+水箱 45 n
+水米 3 n
+水米无交 2 i
+水米无干 3 i
+水米未沾 3 i
+水粉 22 n
+水粉画 14 n
+水精 11 n
+水精灵 3 nr
+水精盐 3 n
+水系 1860 n
+水系格局 3 n
+水红 10 n
+水红花子 3 n
+水纹 7 n
+水线 52 n
+水经 3 n
+水经注 66 n
+水绕城 2 nr
+水绘园 2 nr
+水绵 2 n
+水绿 9 b
+水绿色 3 n
+水缸 143 n
+水罐 23 n
+水网 108 n
+水网纵横 3 l
+水翼 23 n
+水翼船 24 n
+水肥 10 n
+水肺 3 n
+水肿 273 n
+水肿病 3 n
+水胶 3 n
+水能 523 n
+水能载舟 3 i
+水脚 3 n
+水至清则无鱼 7 l
+水舀子 3 v
+水舞 3 n
+水良兽 2 nr
+水色 59 n
+水色山光 3 n
+水芋 3 n
+水芙蓉 2 nr
+水芝澳 3 ns
+水花 130 n
+水花四溅 3 nr
+水花生 3 n
+水芹 4 nr
+水苏 3 ns
+水茜溪 2 nr
+水草 274 n
+水草田 3 nr
+水荒 6 n
+水荡 2 v
+水荡子 4 n
+水菖蒲 3 n
+水菜不交 3 l
+水萍 3 nr
+水萝卜 11 n
+水营 3 n
+水落 3 n
+水落归槽 3 n
+水落归漕 3 ns
+水落斗 3 i
+水落石出 113 i
+水落管 3 n
+水葫芦 36 n
+水葬 3 n
+水葱 8 b
+水蒙蒙 3 nr
+水蒸 5 nz
+水蒸气 140 n
+水蒸汽 22 n
+水蓄 3 n
+水蔓青 3 n
+水藻 21 n
+水虫 2 n
+水虱 7 n
+水虿 3 n
+水蚀 3 n
+水蚤 30 n
+水蛇 49 n
+水蛇腰 12 l
+水蛭 52 n
+水蜂子 3 n
+水蜈蚣 3 nr
+水蜜丸 2 n
+水蜜桃 36 n
+水蝨 3 z
+水螅 69 n
+水行州 3 n
+水街 25 n
+水表 8 n
+水袋 3 n
+水袖 25 n
+水西 6 n
+水西流 5 n
+水见式 3 n
+水解 318 n
+水解作用 3 n
+水解反应 3 l
+水解蛋白 8 l
+水解酶 3 n
+水警 5 n
+水警区 15 n
+水语 14 nz
+水调歌头 15 l
+水谷 35 n
+水谷之 2 nr
+水豆腐 5 n
+水貂 31 n
+水负载 3 b
+水货 83 n
+水货手机 3 l
+水质 1437 n
+水质标准 3 n
+水质评价 3 n
+水贴 3 n
+水费 44 n
+水资源 379 n
+水资源量 7 n
+水趟 3 v
+水跃消 2 l
+水路 601 n
+水路运输 3 l
+水车 49 n
+水车前 3 i
+水转印 3 n
+水轮 61 n
+水轮发动 3 n
+水轮发电 3 n
+水轮机 63 n
+水轮泵 3 n
+水软山温 3 nr
+水边 183 s
+水达达 3 nz
+水迁移 3 nr
+水过鸭背 3 n
+水运 1415 n
+水远山遥 3 ns
+水远山长 3 n
+水迹 14 n
+水送山迎 3 l
+水选 3 n
+水通灯亮 3 n
+水速 3 n
+水遁 3 nr
+水道 359 n
+水道网 3 n
+水道设备 3 n
+水部 3 n
+水酒 12 n
+水采珠 2 nr
+水里 3 s
+水里去 3 l
+水里游 3 nr
+水里纳瓜 3 ns
+水野清 2 nr
+水量 739 n
+水量交换 3 i
+水量计 3 n
+水金 3 n
+水金睛 6 n
+水金鉴 2 nr
+水鉴 3 n
+水针 8 n
+水针剂 2 n
+水钻 5 n
+水铅 3 nz
+水铝石 3 nr
+水银 206 n
+水银中毒 3 n
+水银压力 3 n
+水银柱 28 nr
+水银槽 3 nr
+水银灯 5 n
+水银计 3 n
+水锅 3 n
+水锈 3 b
+水锤 5 n
+水镁石 8 n
+水镜 23 n
+水镜笑 2 nr
+水长船高 3 n
+水门 88 n
+水门事件 3 n
+水门案 3 n
+水门汀 13 nz
+水闸 57 n
+水阀 3 n
+水阁 35 n
+水阔山高 3 i
+水际 3 n
+水陆 1156 n
+水陆两用 3 n
+水陆两用车 2 n
+水陆交通 3 n
+水陆俱陈 3 l
+水陆坦克 37 nr
+水陆并进 3 i
+水陆杂陈 3 n
+水陆毕陈 3 nr
+水陆空 5 n
+水陆联用 3 n
+水陆联运 3 n
+水险 2 n
+水集 3 n
+水雷 314 n
+水雷艇 3 n
+水雾 41 n
+水霤 3 z
+水青冈 3 nr
+水青树 24 nr
+水面 2137 n
+水面舰艇 3 nr
+水面蒸发 3 nz
+水靴 3 n
+水鞋 3 n
+水风波 2 nr
+水饭 3 n
+水饺 41 n
+水驱比 3 n
+水驱气藏 3 n
+水鬼 4 n
+水魔 3 n
+水鱼 3 n
+水鳖子 3 n
+水鸟 68 n
+水鸡 2 n
+水鸪鸪 3 n
+水鸭 3 n
+水鹤 3 n
+水鹿 14 n
+水鼓 4 n
+水鼠 3 n
+水龙 99 n
+水龙卷 14 nr
+水龙吟 10 nr
+水龙头 51 n
+水龙带 5 n
+水龙软管 3 l
+水龟虫 2 n
+氵 22 zg
+氵去 3 z
+氵干 3 z
+氶 105 zg
+永 1763 ns
+永不 681 d
+永不倒 3 d
+永不分离 3 i
+永不变心 3 l
+永不相见 3 l
+永不磨灭 3 i
+永不背叛 3 i
+永不自满 3 i
+永不言弃 3 i
+永不言败 3 l
+永世 86 nrt
+永世无穷 3 i
+永世留芳 3 nr
+永世长存 4 nr
+永世难忘 3 i
+永中 18 ns
+永丰 43 nz
+永丰乡 3 ns
+永丰县 3 ns
+永丰舰 3 nr
+永丰路 3 ns
+永丰镇 4 ns
+永久 586 d
+永久中立 3 nr
+永久充填 3 nr
+永久化 12 nr
+永久性 263 nr
+永久磁铁 9 l
+永乐 3114 ns
+永乐乡 3 ns
+永乐宫 3 ns
+永乐镇 2 ns
+永享 3 v
+永仁 3 nr
+永仁县 2 ns
+永住 3 d
+永保太平 3 nr
+永保青春 3 nr
+永修 2 nr
+永修县 6 ns
+永停终点 3 i
+永元 26 nz
+永光 8 nz
+永兴 64 ns
+永兴县 10 ns
+永兴岛 58 ns
+永兴路 3 ns
+永冻土 9 nr
+永利 16 ns
+永别 69 d
+永动机 35 nz
+永劫沉沦 3 l
+永劫沉轮 3 nr
+永华 10 nz
+永南 2 ns
+永历 14 nz
+永历帝 36 nrt
+永发 3 nz
+永合 15 ns
+永吉 8 ns
+永吉县 12 ns
+永和 317 nz
+永和县 3 ns
+永和国中 3 ns
+永和国小 3 nr
+永和市 3 ns
+永和镇 3 ns
+永善 5 ns
+永善县 3 ns
+永嘉 116 nr
+永嘉县 6 ns
+永固 294 ns
+永在 3 d
+永垂不朽 27 i
+永垂竹帛 3 nr
+永垂青史 4 nr
+永城 36 ns
+永城县 3 ns
+永城市 3 ns
+永备 22 nrfg
+永字八法 3 nz
+永存 46 nr
+永宁 86 ns
+永宁县 14 ns
+永宁寺 13 ns
+永宁镇 3 ns
+永安 645 ns
+永安乡 2 ns
+永安寺 2 ns
+永安市 5 ns
+永安村 3 ns
+永安街 2 ns
+永安路 3 ns
+永安镇 5 ns
+永定 34 d
+永定区 4 ns
+永定县 5 ns
+永定河 114 ns
+永定路 2 ns
+永定门 22 ns
+永定门外 4 l
+永寿 19 ns
+永寿县 2 ns
+永川 13 ns
+永川市 4 ns
+永州 59 ns
+永州市 9 ns
+永巷 2 ns
+永常村 3 nr
+永平 144 ns
+永平县 5 ns
+永平镇 3 ns
+永年 36 t
+永年县 3 ns
+永庆 4 ns
+永康 38 ns
+永康县 3 ns
+永康市 3 ns
+永康方岩 2 nr
+永建 10 ns
+永往直前 3 i
+永德 8 ns
+永德县 2 ns
+永徽 40 ns
+永志 3 ns
+永志不忘 5 i
+永恒 424 z
+永恒不变 27 nz
+永恒传说 3 l
+永恒性 12 nz
+永新 278 d
+永新区 3 ns
+永新县 10 ns
+永无 3 b
+永无休止 3 l
+永无宁日 6 nz
+永无止境 19 l
+永昌 92 ns
+永昌县 9 ns
+永明 16 nz
+永明体 8 nr
+永春 12 ns
+永春县 7 ns
+永春堂 3 nr
+永暑礁 2 ns
+永永无穷 3 i
+永永远远 3 nr
+永泰 42 nz
+永泰县 3 ns
+永济 35 n
+永济县 11 ns
+永济市 5 ns
+永济渠 47 nr
+永浴爱河 3 nr
+永清 14 nr
+永清县 13 ns
+永生 93 b
+永生永世 27 nr
+永田 3 nz
+永田环 3 nr
+永登 17 ns
+永登县 3 ns
+永眠 3 ns
+永磁 39 nz
+永磁体 3 n
+永磁性 3 n
+永福 278 nz
+永福县 2 ns
+永福路 3 nr
+永立 2 b
+永红区 3 nr
+永结同心 3 l
+永续 20 d
+永胜 24 nr
+永胜县 9 ns
+永葆青春 8 nr
+永裕 4 nz
+永记 5 nz
+永诀 18 n
+永贝里 12 nrt
+永载史册 3 l
+永辞 3 nz
+永达工专 3 l
+永远 4554 d
+永远快乐 3 z
+永远的痛 3 l
+永远都是 3 nz
+永通 8 nz
+永逝 3 v
+永遇乐 3 nr
+永道 4 d
+永邦 2 ns
+永锡 2 ns
+永镇 11 ns
+永陵 4 ns
+永隆 9 ns
+永隆乡 2 ns
+永靖 13 nz
+永靖县 9 ns
+永顺 22 nz
+永顺县 5 ns
+永驻 3 v
+氹 3 zg
+氼 2 zg
+氽 262 zg
+氾 204 zg
+氿 3 zg
+汀 332 ns
+汀九桥 2 ns
+汀娜 2 nrt
+汀州 3 ns
+汀江 32 ns
+汀泗桥 24 ns
+汀洲 3 ns
+汀线 3 n
+汁 819 ng
+汁儿 3 n
+汁水 36 n
+汁液 101 n
+求 6465 v
+求三拜四 3 i
+求下联 3 v
+求业 2 v
+求之不得 143 i
+求之过急 3 i
+求乞 15 v
+求亲 68 v
+求亲告友 3 l
+求亲靠友 3 i
+求人 93 v
+求仁得仁 7 i
+求仙 28 n
+求伯君 3 nz
+求借 3 v
+求值 3 v
+求偶 75 v
+求偶者 3 n
+求偿 3 v
+求全 26 v
+求全之毁 3 i
+求全责备 7 l
+求其友声 3 i
+求凰 3 n
+求出 3 v
+求函数 12 l
+求助 882 v
+求助于 3 v
+求助信 5 v
+求助无门 3 i
+求助者 13 n
+求医 92 v
+求医者 2 n
+求医问药 6 i
+求去 3 v
+求反 3 v
+求取 3 v
+求变 27 v
+求合租 3 l
+求同 26 v
+求同存异 46 i
+求名 3 v
+求名利 3 l
+求名夺利 3 i
+求名求利 3 i
+求告 52 v
+求告无门 3 i
+求和 281 v
+求售 2 v
+求商 3 v
+求善 3 v
+求备一人 3 i
+求大同 2 i
+求好 3 v
+求好心切 3 i
+求婚 131 v
+求婚者 13 n
+求子 3 n
+求学 248 v
+求学精神 3 nz
+求学者 2 n
+求学路 3 nz
+求实 90 v
+求实效 3 l
+求实精神 3 i
+求容取媚 3 i
+求导 3 v
+求差 3 v
+求帖 3 v
+求异 27 v
+求得 687 v
+求志达道 3 nz
+求忠出孝 3 i
+求快 3 v
+求情 292 v
+求成 3 v
+求成过急 3 i
+求战 36 v
+求才若渴 3 i
+求援 183 v
+求援信 3 nz
+求援信号 3 nz
+求援者 3 n
+求摇 3 v
+求效益 3 n
+求救 287 v
+求救信 3 nz
+求救信号 3 nz
+求教 117 nz
+求教于 3 l
+求数 3 n
+求新 61 v
+求新立异 3 i
+求是潮 3 i
+求根 3 nz
+求档 3 v
+求欢 3 v
+求欢被拒 3 i
+求死不能 3 i
+求求 3 v
+求治 76 v
+求治者 2 n
+求法 3 v
+求洋 3 nz
+求活 3 vn
+求浆得酒 3 i
+求爱 43 v
+求爱信 3 nz
+求爱者 3 nz
+求爱记 3 nz
+求片 3 n
+求片免谈 3 i
+求生 188 v
+求生不得 3 v
+求生存 3 v
+求生害义 3 nz
+求生害仁 3 i
+求生欲 3 i
+求田问舍 4 i
+求益反损 3 i
+求真 26 nz
+求真务实 53 i
+求知 1107 v
+求知欲 35 i
+求知者 3 n
+求知若渴 4 i
+求神 29 v
+求神拜佛 13 i
+求神问卜 4 l
+求福禳灾 3 vn
+求租房 3 n
+求积 3 v
+求稳 3 v
+求稳怕乱 3 i
+求签 23 v
+求签问卜 3 n
+求索 64 v
+求职 1304 v
+求职信 3 i
+求职意向 3 i
+求职网 3 i
+求职者 568 n
+求职难 3 l
+求胜 58 v
+求胜心切 12 i
+求艺 3 v
+求补 3 v
+求见 316 v
+求觅 3 v
+求解 402 v
+求证 73 v
+求证法 3 nz
+求诊 18 v
+求诊者 3 n
+求贤 19 v
+求贤下士 3 i
+求贤如渴 3 i
+求贤若渴 26 i
+求败 3 v
+求质 2 n
+求购 8 v
+求过于供 3 i
+求进 9 v
+求道于盲 3 n
+求降 3 v
+求雨 34 v
+求靠 3 v
+求饶 192 v
+求马唐肆 3 n
+求鱼缘木 3 i
+汆 16 v
+汇 1235 n
+汇业 2 n
+汇东 3 n
+汇丰 48 nz
+汇丰银行 93 nt
+汇为 3 v
+汇交 7 v
+汇仁 6 nz
+汇付 3 v
+汇价 109 n
+汇众 2 n
+汇倒 3 v
+汇兑 235 v
+汇入 328 v
+汇出 15 v
+汇划 12 n
+汇到 3 v
+汇单 3 n
+汇合 776 v
+汇合口 2 n
+汇合处 85 nt
+汇合点 13 n
+汇寄 3 v
+汇展 4 vn
+汇川 3 n
+汇川区 3 nt
+汇差 3 n
+汇市 85 n
+汇总 173 n
+汇总表 21 n
+汇成 223 v
+汇报 1563 nz
+汇报会 40 nt
+汇报工作 3 n
+汇报思想 3 n
+汇报情况 3 n
+汇报提纲 3 n
+汇拢 4 v
+汇文 136 nz
+汇映 3 v
+汇款 98 n
+汇款人 3 n
+汇款单 14 n
+汇款地址 3 n
+汇水 3 n
+汇水区 3 n
+汇流 66 n
+汇流处 29 n
+汇流排 3 n
+汇流点 3 n
+汇源 10 n
+汇演 81 vn
+汇率 1220 n
+汇率制 7 n
+汇率变动 3 l
+汇率差额 3 n
+汇率问题 3 n
+汇电 3 nz
+汇票 527 n
+汇算 6 v
+汇纂 3 v
+汇编 286 v
+汇编器 12 n
+汇编程序 4 n
+汇编语言 87 n
+汇美舍 3 n
+汇聚 232 v
+汇聚一堂 5 nz
+汇至 3 v
+汇费 2 vn
+汇辑 3 n
+汇进 3 v
+汇通 15 nz
+汇钱 3 n
+汇隆 2 nz
+汇集 905 v
+汇集合成 3 nz
+汇集点 3 n
+汇鸿 3 n
+汈 3 zg
+汉 8921 j
+汉三公 2 nr
+汉中 995 ns
+汉中市 13 ns
+汉中盆地 26 ns
+汉中路 3 nz
+汉中门 4 nr
+汉丹 4 ns
+汉丹线 256 nz
+汉丹铁路 4 nz
+汉丽宝 3 nr
+汉举叔 5 nr
+汉举哥 4 nr
+汉乃封 2 nr
+汉乐 2 nz
+汉乐府 3 nr
+汉书 360 nz
+汉人 1629 n
+汉代 972 t
+汉以东 2 nr
+汉伏波 3 nr
+汉传 3 nz
+汉佩尔 3 nr
+汉俗汉 2 nr
+汉元帝 19 nr
+汉元朔 2 nr
+汉元鼎 14 nr
+汉光 48 nz
+汉光军 5 nr
+汉光武 22 nr
+汉光武帝 51 nr
+汉克尔 3 nr
+汉克斯 2 nr
+汉克森 3 nr
+汉兴 2 nz
+汉兵亦 2 nr
+汉兵汉将 3 nr
+汉内斯 5 nz
+汉军佐 4 nr
+汉军内 2 nr
+汉军击 2 nr
+汉军奥 3 nr
+汉军屯 3 nr
+汉军旗 14 nr
+汉军正 8 nr
+汉军牛 2 nr
+汉军福地 2 nr
+汉军虏 2 nr
+汉军详 2 nr
+汉军镶 11 nr
+汉冶萍 11 nr
+汉击平 2 n
+汉刘曜 3 nr
+汉刘歆 4 nr
+汉制汉 4 nz
+汉剧 32 n
+汉化 95 nz
+汉化包 3 nz
+汉化版 3 nz
+汉北河 2 ns
+汉医 2 nr
+汉十 3 t
+汉南 5 ns
+汉南区 513 ns
+汉卡 19 nz
+汉卡拉 3 nr
+汉印 9 nz
+汉发兵 2 nr
+汉口 2005 ns
+汉口市 3 ns
+汉口站 261 n
+汉口路 3 nz
+汉台区 2 ns
+汉员 2 n
+汉和帝 2 nr
+汉哀帝 3 nr
+汉唐 221 nz
+汉唐两代 3 nr
+汉嘉郡 2 nr
+汉嘻嘻 2 nr
+汉园集 2 nr
+汉图楚 2 nr
+汉土 3 n
+汉地 2 nz
+汉坦病毒 3 n
+汉城 373 ns
+汉城人 3 nrt
+汉城地方法院 4 nz
+汉城大学 5 nt
+汉城奥运会 7 nz
+汉城市 4 ns
+汉堡 439 ns
+汉堡包 21 nz
+汉堡大学 12 nt
+汉堡市 4 ns
+汉堡港 32 ns
+汉堡队 5 nt
+汉墓 177 n
+汉墓群 3 n
+汉士族 5 nz
+汉声 3 n
+汉天子 2 nr
+汉太尉 2 nr
+汉奸 1441 n
+汉奸总部 3 n
+汉奸走狗 3 n
+汉姆生 2 nr
+汉姓 24 n
+汉委奴 3 n
+汉子 2142 n
+汉字 912 nz
+汉字信息处理 3 n
+汉字学 3 n
+汉字库 3 nz
+汉字手写 7 n
+汉字改革 3 nz
+汉字数 8 n
+汉字系统 4 n
+汉字终端 3 n
+汉字结构 5 n
+汉字编码 3 n
+汉字输入 3 n
+汉字部件 3 n
+汉字键盘 6 n
+汉学 168 n
+汉学家 72 n
+汉学界 6 n
+汉学系 3 n
+汉学者 3 n
+汉宁王 4 nr
+汉安帝 3 nr
+汉官 18 n
+汉官仪 2 nr
+汉官士 4 nr
+汉官威仪 3 nr
+汉宝德 3 nr
+汉宣帝 47 nr
+汉室 69 nz
+汉宫 3 nr
+汉宫传 2 nr
+汉宫春 4 nr
+汉宫秋 6 nr
+汉家女 3 nr
+汉家山 4 nr
+汉家郎 3 nr
+汉密尔 87 nr
+汉密尔顿 3 nrt
+汉寿 30 nr
+汉寿县 6 nr
+汉尼巴 2 ns
+汉尼拔 35 nr
+汉川 540 ns
+汉川县 3 ns
+汉川市 257 ns
+汉左校 2 nr
+汉帝禅 3 nr
+汉平帝 8 nr
+汉廷悬 2 nr
+汉建兴 5 nr
+汉建魏 8 nr
+汉开鸿 2 nr
+汉弗莱 16 nr
+汉弥尔 2 nr
+汉弥登钟 3 nr
+汉律 7 n
+汉得朔 2 nr
+汉德字典 3 ns
+汉德词典 3 nr
+汉德逊 2 nr
+汉志和 2 nr
+汉志省 2 ns
+汉惠帝 3 nr
+汉成帝 20 nr
+汉承秦 10 nr
+汉文 659 nz
+汉文帝 87 nr
+汉文武 4 nr
+汉斯 83 nz
+汉斯想 2 nz
+汉斯正 3 nr
+汉方 3 nz
+汉施路 256 nr
+汉族 2029 nz
+汉族人 53 nz
+汉昌 2 ns
+汉明 7 nz
+汉明帝 37 nr
+汉明德 3 nr
+汉明码 3 n
+汉星 4 nz
+汉昭帝 22 nr
+汉昭烈 9 nr
+汉晋 8 t
+汉晋唐 2 nr
+汉晋竹 2 nr
+汉普夏 4 nr
+汉普郡 10 nr
+汉普顿 9 nr
+汉景帝 60 nr
+汉景耀 2 nr
+汉服 9 nz
+汉朝 271 t
+汉朝人 3 nr
+汉末 100 t
+汉末魏 2 t
+汉桃叶 3 nr
+汉桓帝 6 nr
+汉桥 2 nz
+汉森 36 nr
+汉正街 23 nr
+汉武大帝 3 nr
+汉武帝 517 nr
+汉民 40 n
+汉水 739 nz
+汉水流域 8 ns
+汉汉初 2 nr
+汉江 1537 ns
+汉江全 257 nr
+汉江月 3 nz
+汉江杜 2 nr
+汉沽 9 ns
+汉沽区 2 ns
+汉法字典 3 n
+汉法词典 3 nr
+汉洋 3 ns
+汉源 9 nz
+汉源县 4 ns
+汉满蒙 4 nr
+汉滨区 3 ns
+汉滩江 2 nr
+汉灏辨 4 nr
+汉灵帝 19 nr
+汉特 17 nz
+汉特克 2 nr
+汉献帝 58 nr
+汉王 228 nz
+汉王笔 3 nr
+汉王简 3 nr
+汉璇存 2 nr
+汉璇翠 3 nr
+汉璇达 3 nr
+汉留侯 2 nr
+汉白玉 2665 nr
+汉白玉石 3 nr
+汉碑 3 nz
+汉碑群 2 nr
+汉礼 6 nz
+汉祖唐 2 nr
+汉科 13 nz
+汉科港 2 nz
+汉穆夫 2 nr
+汉穆拉 34 nr
+汉章帝 16 nr
+汉简 77 nr
+汉籍 6 n
+汉粤川 2 nr
+汉纪 3 t
+汉网 4 nz
+汉置云 2 nr
+汉置平 2 nr
+汉置汉 2 nr
+汉考克 4 nz
+汉联 3 ns
+汉胜楚 2 nr
+汉臣之 2 nr
+汉至唐 3 nr
+汉良乡 3 nr
+汉苏武 2 nr
+汉英 278 nr
+汉英字典 3 nr
+汉英词典 3 nr
+汉莎 11 nz
+汉萨德 12 nr
+汉藏 5 ns
+汉藏语系 114 nz
+汉西 3 ns
+汉言崇 2 nr
+汉言延 2 nr
+汉言弘 2 nr
+汉言彰 2 nr
+汉言永 4 nr
+汉译 52 nr
+汉译中 3 nr
+汉译华 2 nr
+汉译英 5 nr
+汉语 1611 nz
+汉语拼音 72 n
+汉语热 3 nz
+汉语生成 3 nz
+汉语系 3 n
+汉语言 80 nr
+汉诸军 2 nr
+汉诺 18 nz
+汉诺坝 3 nr
+汉诺塔 4 nr
+汉诺夫 15 nr
+汉诺威 143 nr
+汉诺威市 4 ns
+汉谟拉 3 nr
+汉贼不两立 4 l
+汉路权 3 nr
+汉道陵 2 nr
+汉邦 3 nz
+汉铭信 3 nr
+汉长安 2 nr
+汉阳 1176 ns
+汉阳军 258 nr
+汉阳劳 4 nz
+汉阳区 514 ns
+汉阳县 13 ns
+汉阳峰 2 nr
+汉阳府 527 nr
+汉阳造 2 nr
+汉阳郡 5 nr
+汉阳郭 2 nr
+汉阳铁 114 nz
+汉阳镇 3 ns
+汉阳陵 5 ns
+汉阴 2 ns
+汉阴县 3 ns
+汉陵 2 ns
+汉隶 3 ns
+汉顺帝 10 nr
+汉风论坛 3 nz
+汉高帝 8 nr
+汉高祖 181 nr
+汉魏 148 t
+汉魏南 2 nr
+汉魏至 2 nr
+汉鲁恭 2 nr
+汉鼎之 2 nr
+汊 390 n
+汊流 34 n
+汊涧镇 3 v
+汊港 4 n
+汋 3 zg
+汎 2 zg
+汐 5 g
+汐止 2 n
+汐止镇 3 n
+汔 5 g
+汕 70 ns
+汕大 3 ns
+汕头 230 ns
+汕头人 2 n
+汕头大学 10 nt
+汕头市 55 ns
+汕头市公安局 4 nt
+汕头经济特区 2 ns
+汕尾 10 ns
+汕尾市 12 ns
+汗 4274 zg
+汗不敢出 3 i
+汗出洽背 3 n
+汗出浃背 3 i
+汗味 3 n
+汗垢 3 n
+汗如雨下 25 i
+汗孔 3 n
+汗巾 61 n
+汗斑 2 n
+汗毛 85 n
+汗毛孔 8 n
+汗水 494 n
+汗水淋漓 9 i
+汗洋 3 n
+汗津津 16 i
+汗洽股栗 3 n
+汗洽股票 3 n
+汗流 3 n
+汗流如雨 3 i
+汗流接踵 3 i
+汗流洽背 3 n
+汗流洽衣 3 n
+汗流浃体 3 i
+汗流浃肤 3 i
+汗流浃背 51 i
+汗流浃踵 3 i
+汗流满面 9 i
+汗流至踵 3 i
+汗浸浸 3 z
+汗涔涔 3 z
+汗液 52 n
+汗淋淋 9 z
+汗渍 18 n
+汗湿 23 n
+汗溼 3 z
+汗滴 6 n
+汗滴禾下土 3 l
+汗漫 3 n
+汗漫之言 3 l
+汗牛充屋 3 n
+汗牛充栋 12 i
+汗牛塞栋 3 i
+汗王 2 n
+汗珠 194 n
+汗珠儿 3 n
+汗珠子 17 n
+汗疹 3 n
+汗碱 3 n
+汗背心 4 i
+汗脚 3 n
+汗腥 3 n
+汗腺 76 n
+汗腺炎 3 n
+汗臭 12 n
+汗臭味 3 i
+汗血 3 n
+汗血盐车 3 n
+汗衣 3 n
+汗衫 40 n
+汗褂 5 n
+汗褂儿 3 z
+汗迹 3 n
+汗酸 3 n
+汗青 12 n
+汗青头白 3 i
+汗颜 44 n
+汗颜天地 3 i
+汗颜无地 7 i
+汗马 4 n
+汗马之功 3 i
+汗马之劳 3 i
+汗马功劳 95 i
+汙 7 zg
+汙名 3 vn
+汙吏 3 nz
+汙垢 3 v
+汙染 3 vn
+汙水 3 vn
+汙泥 3 v
+汙浊 3 v
+汙点 3 z
+汙衊 3 z
+汙辱 3 vn
+汛 91 t
+汛前 6 t
+汛情 22 n
+汛期 420 t
+汜 87 zg
+汜水镇 2 ns
+汝 1189 nr
+汝三人 3 nr
+汝之力 2 nr
+汝之能 3 nr
+汝之过 2 nr
+汝二人 27 nr
+汝何敢 7 nr
+汝侯刘 19 nr
+汝候刘 2 nr
+汝兄弟 2 nr
+汝勿多 2 nr
+汝南 107 ns
+汝南县 9 ns
+汝南孟 2 nr
+汝南晨鸡 3 nz
+汝南汝 7 nr
+汝南王 3 nr
+汝南袁 2 nr
+汝南郡 2 nr
+汝原 3 ns
+汝可乘 2 nr
+汝可先 5 nr
+汝可回 2 nr
+汝可引 10 nr
+汝可念 2 nr
+汝城 6 nr
+汝城县 3 ns
+汝宁州 6 ns
+汝宁府 6 nr
+汝宁沙 2 nr
+汝宁王 3 nr
+汝安敢 12 nr
+汝定兄 7 nr
+汝小早 4 nr
+汝岂知 2 nr
+汝州 74 ns
+汝州市 3 ns
+汝师兄 10 nr
+汝康有为 2 nr
+汝情 2 n
+汝成人耶 3 nr
+汝才哥 6 nr
+汝才笑 3 nr
+汝拉山 2 nr
+汝昌之 2 nr
+汝昌统 2 nr
+汝昌而 2 nr
+汝有何 6 nr
+汝求哀 2 nr
+汝河上 2 ns
+汝焉敢 4 nr
+汝矣岛 3 nz
+汝知之 2 nr
+汝知吾 2 nr
+汝等亦 2 nr
+汝等远 2 nr
+汝若早 2 nr
+汝若有 2 nr
+汝观兄 15 nr
+汝言正 3 nr
+汝识吾 2 nr
+汝请吾 2 nr
+汝辈 3 n
+汝阳 45 nr
+汝阳县 7 ns
+汝阳王 43 nr
+汝非 3 ns
+汞 849 n
+汞化物 3 n
+汞合金 3 n
+汞合金匙 3 n
+汞柱 81 n
+汞气灯 3 n
+汞液 3 n
+汞溴红 3 z
+汞灯 22 n
+汞量法 3 n
+汞齐电极 3 v
+江 6083 nr
+江一平 2 nr
+江三公子 2 nr
+江上 3 s
+江世杰 10 nr
+江丙 24 nrfg
+江丙坤 3 nz
+江东 374 ns
+江东区 2 ns
+江东父老 6 nr
+江东门 7 ns
+江中 651 ns
+江中亮 2 nr
+江中沙 2 ns
+江丰 7 ns
+江主席 58 n
+江义 3 ns
+江之固 2 nr
+江云 4 ns
+江云渭树 3 ns
+江亚平 4 nr
+江亢虎 2 nr
+江亦曼 4 nr
+江伐楚 2 nr
+江依安 2 nr
+江充 3 ns
+江兆民 3 nr
+江兆申 2 nr
+江克村 3 nr
+江八景 2 nr
+江八点 3 n
+江冷杉 2 nr
+江凤仪 3 nr
+江凯文 3 nr
+江北 1405 ns
+江北区 13 ns
+江北地区 3 ns
+江北岸 21 s
+江千佛 2 nr
+江华 37 nz
+江华县 2 ns
+江华瑶族自治县 7 ns
+江南 4986 ns
+江南一带 3 nz
+江南七怪 3 nz
+江南区 2 ns
+江南地区 73 ns
+江南春 3 ns
+江南水乡 3 ns
+江南海北 3 ns
+江南西 265 ns
+江南运河 40 ns
+江南造船厂 9 nt
+江南镇 2 ns
+江卢 3 ns
+江卫级 5 n
+江原 8 ns
+江原道 14 ns
+江厦 9 ns
+江县凤 2 nr
+江县境 3 nr
+江发源 2 nr
+江口 109 ns
+江口县 3 ns
+江口地区 3 ns
+江口洋介 3 n
+江可通 2 nr
+江右 3 nr
+江右军 5 nr
+江右湖 2 ns
+江名 3 ns
+江和义 2 ns
+江和锡 2 ns
+江国成 4 nrfg
+江坝 4 ns
+江城 297 ns
+江城区 3 ns
+江城哈尼族彝族自治县 2 ns
+江城子 3 nr
+江堤 31 ns
+江声 5 n
+江夏 1874 ns
+江夏区 3852 ns
+江夏治 256 nr
+江夏派 2 nr
+江夏王 6 nr
+江夏郡 777 nr
+江大津 2 ns
+江天 44 ns
+江天一色 3 i
+江天道 4 nr
+江头 3 ns
+江奈生 2 nr
+江孜 38 ns
+江孜县 6 ns
+江宁 98 ns
+江宁区 4 ns
+江宁县 7 ns
+江宁府 32 nr
+江宁监 2 nr
+江宁路 3 ns
+江安 48 ns
+江安县 2 ns
+江宋军 2 nr
+江定仙 2 nr
+江宝章 2 nr
+江家姊 3 nr
+江家岔 256 ns
+江家福 2 nr
+江宽水 34 nr
+江小鱼 3 nr
+江山 1224 ns
+江山县 3 ns
+江山好改 3 i
+江山如故 3 i
+江山如画 10 i
+江山市 5 ns
+江山易改 19 nr
+江山易移 3 i
+江山美人 3 nz
+江山股份 2 nz
+江岛 3 ns
+江岸 155 s
+江岸区 514 ns
+江峡 3 ns
+江川 9 ns
+江川县 2 ns
+江州 196 ns
+江州州 2 ns
+江州牢 2 nr
+江州牧 3 nr
+江州蔡 2 ns
+江左 32 ns
+江左军 2 nr
+江左夷吾 3 ns
+江巴吉才 2 nr
+江布尔 12 nr
+江干 5 ns
+江干区 2 ns
+江平 2 ns
+江平原 2 ns
+江底 277 ns
+江建国 5 ns
+江御史 6 nr
+江心 114 n
+江心屿 7 nr
+江心洲 15 ns
+江心补漏 3 i
+江必新 2 nr
+江忠源 2 nr
+江总书记 10 n
+江恩慈 3 nr
+江户 120 ns
+江户城 5 ns
+江敬灼 5 nr
+江文书 3 nr
+江斯登 2 nr
+江昂 9 ns
+江春水 3 nr
+江显扬 3 nr
+江晓原 2 nr
+江景 5 n
+江景则 2 nr
+江村 21 ns
+江格尔 25 nr
+江桥 16 ns
+江楚会 2 nr
+江楼 4 ns
+江楼儿 2 nr
+江欣燕 3 nr
+江段 297 n
+江水 833 ns
+江永 15 nr
+江永县 3 nr
+江汉 1652 ns
+江汉关 8 ns
+江汉分局 3 nt
+江汉区 261 ns
+江汉平原 2162 ns
+江汉朝宗 3 nr
+江汉法院 3 nt
+江汉路 3 ns
+江河 601 ns
+江河日下 21 ns
+江河水 20 ns
+江河湖泊 3 ns
+江河湖海 24 ns
+江河源 3 ns
+江河行地 2 ns
+江油 22 n
+江油市 13 ns
+江泉 3 ns
+江泉实业 3 n
+江波 3 ns
+江波渡 256 nr
+江泰新 4 nr
+江泽 2 ns
+江泽慧 8 nr
+江泽民 2415 nr
+江泽涵 10 nr
+江泽飞 25 nr
+江洋 3 ns
+江洋大盗 39 i
+江津 65 ns
+江津县 3 ns
+江津市 4 ns
+江洲 6 ns
+江洲区 3 ns
+江洲车儿 3 n
+江流 319 ns
+江流日下 3 ns
+江浙 289 j
+江浙沪 6 nr
+江浦 11 ns
+江浦县 3 ns
+江浦路 3 ns
+江浪 3 nz
+江海 270 ns
+江海区 3 ns
+江海堤防 7 nr
+江海湖 2 ns
+江淑娜 3 i
+江淮 901 j
+江淮地区 22 ns
+江淮戏 3 j
+江淮晨报 7 nz
+江淹才尽 3 l
+江淹梦笔 3 l
+江渭清 25 ns
+江湖 2750 ns
+江湖义气 22 nz
+江湖人称 3 n
+江湖医生 3 nz
+江湖味 3 nz
+江湖情 3 n
+江湖救急 3 i
+江湖术士 20 ns
+江湖梦 3 nr
+江湖气 3 nz
+江湖气概 3 n
+江湖网 3 nz
+江湖险恶 3 n
+江湖骗子 17 n
+江湾 27 ns
+江湾镇 3 ns
+江源 8 ns
+江源县 3 ns
+江滨 4 ns
+江滨公园 2 ns
+江滩 6 ns
+江潮 2 nr
+江猪 259 n
+江珊 3 ns
+江珧柱 3 nr
+江珧科 2 nr
+江瑶柱 2 nr
+江瑶贝 3 nr
+江畔 27 ns
+江百胜 4 nr
+江相望 4 nr
+江督袁 3 nr
+江研英 3 nr
+江祖平 3 nr
+江竹筠 5 nr
+江米 10 nr
+江米纸 3 nz
+江米酒 3 nr
+江纳苗 512 nr
+江绍贞 6 nr
+江美琪 2 nr
+江翔 2 ns
+江翠国中 3 nr
+江翠国小 3 nr
+江翻海倒 3 i
+江翻海扰 3 nr
+江翻海搅 3 nr
+江翻海沸 3 i
+江自西 4 ns
+江致礼 2 nr
+江花韵 2 nr
+江苏 3337 ns
+江苏人民出版社 8 nt
+江苏教育出版社 2 nt
+江苏文艺出版社 2 nt
+江苏新科电子集团公司 2 nt
+江苏电视台 2 nt
+江苏省 953 ns
+江苏省人民政府 6 nt
+江苏省农科院 4 nt
+江苏省国画院 5 nt
+江苏省委 9 nt
+江苏省委宣传部 2 nt
+江苏省政协 3 nt
+江苏省政府 12 nt
+江苏省社会科学院 2 nt
+江苏籍 2 nr
+江苏网 3 nz
+江苏舜天 38 nr
+江苏舜天队 10 nt
+江苏队 35 nt
+江茂哥 2 nr
+江营入 3 n
+江蓠 13 n
+江裕泰 3 nr
+江西 2594 ns
+江西人 16 nr
+江西农业大学 3 nt
+江西师大 2 ns
+江西师范大学 2 nt
+江西省 664 ns
+江西省上饶地区 4 ns
+江西省人民政府 2 nt
+江西省公安厅 2 nt
+江西省委 6 nt
+江西省政府 6 nt
+江西籍 3 nr
+江西网 3 nz
+江西腊 3 ns
+江西财经大学 8 nt
+江诗丹 6 nr
+江豚 524 n
+江轮 16 n
+江边 218 s
+江达 3 ns
+江达县 4 ns
+江通 3 ns
+江通公司 3 nt
+江道 264 ns
+江郎才尽 10 i
+江郎才掩 3 i
+江都 142 ns
+江都县 14 ns
+江都市 8 ns
+江醉章 317 nr
+江里湖 2 ns
+江钱峰 5 nr
+江铁鹗 2 nr
+江锡兴 7 nr
+江长岐 2 nr
+江门 36 ns
+江门市 22 ns
+江防 3 n
+江防军 19 nt
+江阳 9 ns
+江阳区 3 ns
+江阴 210 ns
+江阴人 10 nr
+江阴县 3 ns
+江阴市 38 ns
+江阴长江大桥 35 ns
+江陵 3756 ns
+江陵县 540 ns
+江雪晴 3 nr
+江雪琴 2 nr
+江青 838 nr
+江青之 2 nr
+江青任 2 nr
+江青害 2 nr
+江青懂 2 nr
+江面 791 n
+江风吹 2 nr
+江风峭 2 nr
+江鱼江 2 ns
+江黄水 2 ns
+江龙 16 ns
+池 1284 nr
+池上 8 s
+池中之物 3 nr
+池中物 5 nr
+池中筑 2 nr
+池中载 2 nr
+池内 11 s
+池北偶 3 nr
+池华琼 3 nr
+池南岸 2 nr
+池口 2 n
+池塘 529 ns
+池壁 2 n
+池子 83 n
+池宇峰 256 nr
+池岸 2 n
+池峰城 2 nr
+池州 28 ns
+池州市 3 ns
+池底 13 n
+池座 3 n
+池座前排 3 n
+池心 3 n
+池春水 2 nr
+池月堤 256 nr
+池榭 3 nrt
+池水 82 n
+池河 1286 ns
+池沼 27 n
+池沿 4 s
+池潢 3 n
+池玉清 2 nr
+池田勇人 3 nr
+池田大作 7 ns
+池畔 8 n
+池盐 8 n
+池美芬 2 nr
+池袋 3 n
+池边 37 s
+池酒林胾 3 ns
+池里 3 s
+池里洗 2 nr
+池阳 7 ns
+池际尚 256 n
+池雄标 3 nr
+池鱼 2 n
+池鱼之殃 6 n
+池鱼之祸 3 n
+池鱼之虑 3 nr
+池鱼堂燕 3 nr
+池鱼幕燕 3 nr
+池鱼林木 3 ns
+池鱼笼鸟 3 n
+污 414 vn
+污七八糟 2 i
+污七糟八 3 n
+污乱 3 vn
+污名 6 n
+污吏 5 n
+污垢 86 n
+污手垢面 3 i
+污损 14 vn
+污染 2692 vn
+污染区 13 n
+污染带 4 n
+污染性 3 n
+污染源 107 n
+污染物 388 n
+污染环境 3 n
+污染监测 3 n
+污染空气 3 n
+污染系数 3 n
+污染者 7 n
+污毒 3 vn
+污气 3 n
+污水 458 n
+污水净化 3 n
+污水口 3 n
+污水处理 3 n
+污水排放 3 i
+污水槽 3 n
+污水池 3 n
+污水沟 3 n
+污水泵 3 n
+污油 3 n
+污泥 132 n
+污泥浊水 10 n
+污浊 71 a
+污渍 22 n
+污点 41 n
+污物 35 n
+污痕 6 n
+污秽 145 n
+污秽不堪 3 i
+污蔑 57 vn
+污血 31 vn
+污衊 3 vn
+污言秽语 46 i
+污辱 71 n
+污迹 17 n
+污闪 4 v
+污陷 3 n
+汤 4099 n
+汤业国 3 n
+汤东野 3 nr
+汤云为 2 nr
+汤仙虎 3 nr
+汤佩松 4 nr
+汤先居 2 nr
+汤先生 4 nr
+汤克宽 2 nr
+汤公公 11 nr
+汤兰花 3 nr
+汤剂 28 nz
+汤加 189 nr
+汤加减 3 nz
+汤加王国 7 ns
+汤勺 7 nr
+汤包 12 n
+汤化裁 4 nr
+汤化达 3 nr
+汤化龙 269 nr
+汤匙 51 n
+汤原 2 ns
+汤原县 3 ns
+汤去三面 3 nr
+汤嘉惠 6 nr
+汤团 25 n
+汤团儿 3 nr
+汤国梨 2 nr
+汤圆 79 nr
+汤壶 3 nr
+汤大侠 19 nr
+汤太夫人 2 nr
+汤夫人 74 nr
+汤头 10 nr
+汤头镇 3 nr
+汤姆 88 nr
+汤姆孙 68 nr
+汤姆斯 17 nr
+汤姆斯杯 247 nz
+汤姆斯杯赛 13 nz
+汤姆森 26 nr
+汤姆生 13 nr
+汤姆贾诺维奇 2 nr
+汤姆逊 50 nr
+汤婆子 2 nr
+汤子博 2 nr
+汤子外 3 nr
+汤家军 10 nr
+汤家明 6 nr
+汤寿潜 33 nr
+汤小泉 3 nr
+汤尤杯 69 nr
+汤尤杯赛 9 n
+汤山一 2 nr
+汤山温泉 2 nz
+汤峪温泉 2 nr
+汤川秀树 19 nr
+汤庭芬 2 nr
+汤德乔 4 nr
+汤志伟 3 nr
+汤志钧 8 nr
+汤恩伯 28 nr
+汤恩比 3 nr
+汤所盟 2 nr
+汤文武 3 nr
+汤料 11 n
+汤斯维尔 2 nrt
+汤日波 3 nr
+汤旺河 4 nr
+汤旺河区 3 ns
+汤明奇 3 nr
+汤显明 2 nr
+汤显祖 57 nr
+汤晓丹 4 nr
+汤普森 38 nr
+汤普逊 8 nr
+汤曜明 13 nr
+汤李梁 4 nr
+汤杯 198 nz
+汤杯赛 22 nz
+汤林森 4 nr
+汤正琪 14 nr
+汤武革命 3 n
+汤民仁 2 nr
+汤水 60 nr
+汤水镇 4 nr
+汤汁 13 nr
+汤池 12 nr
+汤池铁城 3 ns
+汤汤 3 nr
+汤汤水 7 nr
+汤汤水水 3 nr
+汤沐邑 2 nr
+汤沛大 3 nr
+汤沛汤 4 nr
+汤沛笑 4 nr
+汤沛见 3 nr
+汤泉 21 nr
+汤洁莹 7 nr
+汤洪高 256 nr
+汤炳权 3 nr
+汤烧火热 3 n
+汤爱斌 2 nr
+汤玉麟 3 nr
+汤玛斯 2 nr
+汤玛法 14 nr
+汤生多 2 nr
+汤用彤 266 nrfg
+汤盈盈 3 nr
+汤盘 3 nr
+汤碗 13 n
+汤祖德 13 nr
+汤罐 2 n
+汤耀明 2 nr
+汤老爷 9 nr
+汤色橙 2 nr
+汤若望 307 nr
+汤英鹗 5 nr
+汤药 81 n
+汤象龙 4 nr
+汤豪泽 2 nr
+汤逢士 3 nr
+汤都西 4 nr
+汤里来 3 nr
+汤钵式 2 nr
+汤锅 14 n
+汤镇业 3 nr
+汤镇宗 3 nr
+汤阴 16 nr
+汤阴县 10 ns
+汤面 29 n
+汤飞凡 4 nr
+汤饭 3 n
+汤饺 3 n
+汧 12 zg
+汨 24 zg
+汨罗 19 ns
+汨罗市 5 ns
+汨罗江 25 ns
+汩 6 o
+汩汩 92 o
+汩汩淙淙 3 o
+汩罗市 3 vn
+汪 1317 nr
+汪一鸣 22 nr
+汪丁丁 4 nr
+汪万翼 7 nr
+汪东兴 39 nr
+汪东城 3 nr
+汪中求 3 nr
+汪之斌 10 nr
+汪乔年 16 nr
+汪习根 256 nr
+汪云凤 11 nr
+汪云风 3 nr
+汪云鹏 2 nr
+汪亚卫 2 nr
+汪伪政权 28 nr
+汪伯彦 10 nr
+汪元量 4 nr
+汪兆龄 2 nr
+汪先生 5 nr
+汪光焘 2 nr
+汪克尔 3 nr
+汪兴祖 2 nr
+汪凤藻 2 nr
+汪剑通 9 nr
+汪卫斌 6 nr
+汪古惕 2 nr
+汪古部 5 nr
+汪品先 4 nr
+汪啸风 104 nr
+汪嘉伟 5 nr
+汪国真 4 nr
+汪士慎 4 nr
+汪士贤 2 nr
+汪士铎 3 nr
+汪处厚 32 nr
+汪大人 5 nr
+汪大哥 13 nr
+汪大昭 7 nr
+汪大渊 18 nr
+汪太太 2 nr
+汪子 3 nr
+汪宇明 2 nr
+汪宏声 2 nr
+汪宏生 2 nr
+汪家 4 nrfg
+汪家山 2 nr
+汪寿华 19 nr
+汪小姐 2 nr
+汪少侠 4 nr
+汪帮主 76 nr
+汪幼读 2 nr
+汪广洋 6 nr
+汪庄茶 2 nr
+汪康懋 2 nr
+汪延相 2 nr
+汪建国 2 nr
+汪御史 3 nr
+汪德昭 3 nr
+汪德臣 5 nr
+汪忠镐 2 nr
+汪恕诚 2 nr
+汪惟效 4 nr
+汪敬虞 5 nr
+汪文斌 7 nr
+汪文言 77 nr
+汪明荃 2 nr
+汪春元 12 nr
+汪昭义 6 nr
+汪昱庭 2 nr
+汪曾祺 16 nr
+汪有富 4 nr
+汪朝光 22 nr
+汪某深 2 nr
+汪校长 6 nr
+汪桂芬 8 nr
+汪梦川 2 nr
+汪氏振 2 nr
+汪氏茶 2 nr
+汪汉臣 9 nr
+汪汪 84 nr
+汪汪叫 3 z
+汪洋 275 nr
+汪洋大海 87 nr
+汪洋大肆 3 i
+汪洋恣肆 9 i
+汪洋浩博 3 nr
+汪洋自肆 3 i
+汪洋闳肆 3 nr
+汪洪洋 3 nr
+汪流 3 nr
+汪浩天 6 nr
+汪海洋 3 nr
+汪清 3 nr
+汪清县 2 nr
+汪潮涌 256 nr
+汪爱群 256 nr
+汪玉凯 11 nr
+汪瑞仁 2 nr
+汪盐商 4 nr
+汪直皆 2 nr
+汪直领 2 nr
+汪笑侬 5 nr
+汪精卫 451 nr
+汪老板 12 nr
+汪联合 3 nr
+汪胡桢 3 nr
+汪自力 4 nr
+汪自新 3 nrfg
+汪良臣 2 nr
+汪芒氏 2 nr
+汪苍县 3 nr
+汪若海 10 nr
+汪荣华 4 nr
+汪荣宝 2 nr
+汪菊潜 2 nr
+汪萌芽 3 nr
+汪被举 9 nr
+汪裕泰 2 nr
+汪见虹 4 nr
+汪辟疆 3 nr
+汪达尔 45 nr
+汪道昆 16 nr
+汪道涵 25 nr
+汪道渊 2 nr
+汪金福 6 nr
+汪钱唐 3 nr
+汪铁鹗 82 nr
+汪铭珊 3 i
+汪静之 3 nr
+汭 10 zg
+汰 54 vg
+汰劣 4 v
+汰劣留良 3 ns
+汰去 3 v
+汰旧换新 3 nz
+汰沙 3 v
+汰菜 3 v
+汰衣裳 3 nr
+汲 117 nr
+汲冢书 4 nr
+汲冢周 7 nr
+汲冢所 2 nr
+汲取 313 v
+汲古阁 16 nr
+汲古阁本 2 nr
+汲引 2 nr
+汲引忘疲 3 i
+汲水 28 nr
+汲水机 3 nr
+汲水桶 3 v
+汲汲 9 nr
+汲汲于 3 nr
+汲汲忙忙 3 nr
+汲汲皇皇 3 nr
+汲汲营营 3 nr
+汲汲顾影 3 nr
+汲深绠短 3 z
+汲长之 2 nr
+汳 3 zg
+汴 300 ns
+汴京 106 ns
+汴州 72 ns
+汴梁 110 ns
+汴河 92 ns
+汵 378 zg
+汶 78 ns
+汶上 6 ns
+汶上县 7 ns
+汶山 10 ns
+汶川 275 ns
+汶川县 12 ns
+汶水 8 ns
+汷 24 zg
+汸 2 zg
+汹 11 v
+汹汹 76 z
+汹涌 330 v
+汹涌淜湃 3 i
+汹涌澎湃 161 i
+決 10 zg
+汻 111 zg
+汽 166 n
+汽体 3 n
+汽修 3 j
+汽修业 3 n
+汽修厂 10 n
+汽力 3 n
+汽包 3 n
+汽化 67 n
+汽化器 4 n
+汽化热 13 n
+汽化计 3 n
+汽博会 3 n
+汽压 3 n
+汽提塔 3 n
+汽摩 7 nz
+汽摩配 3 nz
+汽暖 3 n
+汽机 10 n
+汽枪 3 n
+汽柴油 3 n
+汽水 1085 n
+汽水瓶 3 n
+汽油 318 n
+汽油价格 3 n
+汽油味 7 n
+汽油弹 24 n
+汽油机 73 n
+汽油机油 3 n
+汽油桶 17 n
+汽油税 2 n
+汽油费 2 n
+汽油车 3 n
+汽泡 3 n
+汽泵 3 n
+汽渡 3 n
+汽灯 32 n
+汽点 3 n
+汽球 3 n
+汽电车 3 n
+汽碾 3 n
+汽笛 76 n
+汽笛声 25 n
+汽筒 3 n
+汽缸 30 n
+汽缸数 3 n
+汽联 3 n
+汽船 51 n
+汽艇 53 n
+汽蚀 3 n
+汽表 3 n
+汽贸 3 n
+汽车 10193 n
+汽车业 40 n
+汽车交易 3 n
+汽车产业 3 n
+汽车产量 3 n
+汽车人才 3 n
+汽车保险 3 n
+汽车信息 3 n
+汽车修理 3 n
+汽车兵 12 n
+汽车出口 3 n
+汽车厂 30 n
+汽车厂家 3 n
+汽车吊 3 n
+汽车品牌 3 n
+汽车团 4 n
+汽车图片 3 n
+汽车地磅 3 n
+汽车坐垫 3 n
+汽车城 25 n
+汽车塑料 3 n
+汽车尾气 3 n
+汽车展 3 n
+汽车工人 3 n
+汽车库 3 n
+汽车底盘 3 n
+汽车座椅 3 n
+汽车影院 3 n
+汽车报价 3 n
+汽车新闻 3 n
+汽车旅社 3 n
+汽车旅馆 3 n
+汽车族 3 n
+汽车模具 3 n
+汽车模型 3 n
+汽车涂料 3 n
+汽车漆 3 n
+汽车灯 3 n
+汽车玻璃 3 n
+汽车用品 3 n
+汽车电器 3 n
+汽车电机 3 n
+汽车票 10 n
+汽车空调 3 n
+汽车站 107 n
+汽车精品 3 n
+汽车网 3 n
+汽车行业 3 n
+汽车衡 3 n
+汽车装饰 3 n
+汽车论坛 3 n
+汽车贷款 3 n
+汽车贸易 3 n
+汽车资讯 3 n
+汽车轮胎 3 n
+汽车连 4 n
+汽车部件 3 n
+汽车配件 3 n
+汽车销量 3 n
+汽车附件 3 n
+汽车集团 3 n
+汽车零件 3 n
+汽车音响 3 n
+汽车饰品 3 n
+汽轮 52 n
+汽轮发电 3 n
+汽轮机 140 n
+汽轮机油 3 n
+汽配 528 n
+汽配城 3 n
+汽配网 3 n
+汽酒 5 n
+汽锅 16 n
+汽锤 9 n
+汽门 3 n
+汽院 3 n
+汾 106 ns
+汾水 15 ns
+汾河 93 ns
+汾河湾 3 ns
+汾西 4 ns
+汾西县 2 ns
+汾酒 79 n
+汾阳 60 ns
+汾阳县 9 ns
+汾阳市 3 ns
+汿 2 zg
+沁 332 ns
+沁人心肺 2 i
+沁人心脾 31 i
+沁人心腑 3 i
+沁人肺腑 3 i
+沁入 17 v
+沁县 8 ns
+沁园春 13 ns
+沁水 35 ns
+沁水县 5 ns
+沁河 23 ns
+沁源 138 ns
+沁源县 72 ns
+沁阳 29 ns
+沁阳市 6 ns
+沂 153 ns
+沂南 10 ns
+沂南县 2 ns
+沂山 5 ns
+沂水 15 ns
+沂水县 14 ns
+沂水弦歌 3 n
+沂水春风 3 ns
+沂河 29 ns
+沂源 12 ns
+沂源县 5 ns
+沂蒙 21 ns
+沂蒙九章 3 ns
+沂蒙山 7 ns
+沂蒙山区 14 ns
+沃 174 nr
+沃什 3 nrt
+沃伊卢科夫 3 nrt
+沃伦 16 nr
+沃克兰 5 nr
+沃克利 4 nr
+沃克抢 2 nr
+沃克林 2 nr
+沃克湖 4 nr
+沃克组 2 nr
+沃兹涅 15 nr
+沃兹登 4 nr
+沃利斯 12 nr
+沃勒尔 3 nr
+沃勒贝克 6 nrt
+沃台公司 3 nt
+沃吕维 3 nr
+沃土 54 nr
+沃地 3 nz
+沃塞列 2 nr
+沃壤 2 ns
+沃夫假设 3 nr
+沃夫克 2 nr
+沃姆斯 2 nr
+沃娜列 2 nr
+沃尔佩 3 nr
+沃尔克 7 nr
+沃尔克斯 2 nrt
+沃尔加 2 nr
+沃尔卡 17 nr
+沃尔塔 5 nr
+沃尔夫 126 nr
+沃尔夫冈 4 nrt
+沃尔夫斯堡 29 nrt
+沃尔姆 9 nr
+沃尔弗 18 nr
+沃尔德 2 nr
+沃尔斯 6 nr
+沃尔格林 11 nrt
+沃尔森 3 nr
+沃尔沃 25 nr
+沃尔沃公司 2 nr
+沃尔泰 8 nz
+沃尔特 90 nr
+沃尔特斯 2 nrt
+沃尔特河 20 nrt
+沃尔玛 66 nr
+沃尔福 36 nr
+沃尔科 3 nr
+沃尔科特 49 nrt
+沃尔维 7 nr
+沃尔西 5 nr
+沃尔霍 4 nr
+沃尔顿 12 nr
+沃尔马 10 nr
+沃尼亚 3 nr
+沃州 3 ns
+沃库 4 nz
+沃库勒 2 nr
+沃德姆 2 nr
+沃德金 2 nr
+沃思堡 6 nr
+沃恩斯 2 nr
+沃拉 9 nrt
+沃拉斯 5 nr
+沃提尼 9 nr
+沃斯佩 2 nr
+沃斯堡 9 nr
+沃斯托 3 nr
+沃斯特 3 nr
+沃斯科 2 nz
+沃林岛 2 nr
+沃林格 3 nr
+沃格勒 3 nr
+沃格尔 2 nr
+沃格岛 2 nr
+沃格恩 6 nr
+沃格拉 2 nr
+沃格特 3 nr
+沃森特 2 nr
+沃沃 3 nz
+沃波尔 10 nr
+沃洛吉 2 nr
+沃洛夫 8 nr
+沃洛夫人 3 nrt
+沃洛布 2 nr
+沃洛斯 2 nr
+沃洛格 3 nr
+沃洛涅 2 nr
+沃洛金 3 nr
+沃洲 2 ns
+沃海姆 2 nr
+沃特斯 2 nr
+沃特曼 3 nr
+沃特森 3 nr
+沃特福德 5 nr
+沃田 3 nr
+沃祖全 2 nr
+沃罗夫斯基 3 nrt
+沃罗格 10 nr
+沃罗比约夫 2 nrt
+沃罗涅日 25 nrt
+沃罗西 3 nr
+沃罗诺 4 nr
+沃耶伊 3 nr
+沃腴 3 n
+沃茨 2 nrt
+沃达丰 30 nz
+沃达丰公司 19 nt
+沃里克 15 nr
+沃里克郡 3 nr
+沃里戈 2 nr
+沃野 31 nr
+沃野千里 13 nr
+沃野平畴 3 nr
+沃雷金 6 nr
+沃霍尔 2 nr
+沃顿 57 nr
+沃饶 3 nr
+沅 331 zg
+沅水 28 ns
+沅江 83 ns
+沅江市 4 ns
+沅芷湘兰 3 nz
+沅芷澧兰 3 nr
+沅茝醴兰 3 nz
+沅茞澧兰 3 nz
+沅陵 32 ns
+沅陵县 6 ns
+沆瀣 2 n
+沆瀣一气 22 i
+沈 1358 nr
+沈一珠 2 nr
+沈一贯 39 nr
+沈丁立 7 nr
+沈万三 3 nr
+沈万山 6 nr
+沈下 3 ns
+沈不住气 3 n
+沈世钧 12 nr
+沈丘 29 ns
+沈丘县 2 ns
+沈丹线 4 nz
+沈丹萍 3 nr
+沈丹铁路 6 nz
+沈二人 2 nr
+沈云英 3 nr
+沈云龙 3 nr
+沈亚之 3 nr
+沈仁道 2 nr
+沈从文 21 nr
+沈从龙 2 nr
+沈佃佃 3 nr
+沈住气 3 nr
+沈傲君 3 nr
+沈儿峪 2 nr
+沈允武 15 nr
+沈允生 3 nr
+沈兆霖 3 nr
+沈先生 5 nr
+沈光玄 3 nr
+沈克非 2 nr
+沈兼士 8 nr
+沈再惠 3 nr
+沈农 3 nz
+沈冤 3 n
+沈刘曦 2 nr
+沈剑虹 3 nr
+沈半路 3 ns
+沈南山 2 ns
+沈博绝丽 3 n
+沈卫平 2 nr
+沈吉线 2 nr
+沈同衡 7 nr
+沈向洋 7 nr
+沈君玉 2 nr
+沈周繁星 3 nr
+沈啸桐 2 nr
+沈喜明 10 nr
+沈园 8 ns
+沈国俊 2 nr
+沈国放 283 nr
+沈国桢 3 nr
+沈国祯 4 nr
+沈城 50 ns
+沈增植 2 nr
+沈士充 2 nr
+沈士柱 177 nr
+沈士远 2 nr
+沈复 3 nr
+沈大与 2 nr
+沈大人 2 nr
+沈奕奕 2 z
+沈姑娘 4 nr
+沈姑娘香 2 nr
+沈威峰 19 nr
+沈子信 8 nr
+沈子培 2 nr
+沈子木 3 nr
+沈孝泉 2 nr
+沈学明 2 nr
+沈安 9 ns
+沈宝钧 2 nr
+沈家 2 ns
+沈家平 2 nr
+沈家本 9 ns
+沈家松 11 nr
+沈家河 2 nr
+沈家门 3 nr
+沈容圃 2 nr
+沈寂 3 nr
+沈寒阳 3 nr
+沈尧伊 6 nr
+沈尹默 4 nr
+沈山 10 ns
+沈岭 2 ns
+沈州 2 ns
+沈年兄 2 nr
+沈庆 3 ns
+沈庆丰 2 nr
+沈庆之 2 nr
+沈度 14 ns
+沈建峰 2 nr
+沈建明 4 nr
+沈彩莲 7 nr
+沈得住气 3 n
+沈德宝莉 3 nr
+沈德昌 2 nr
+沈德潜 25 nr
+沈德符 6 nr
+沈德鸿 2 nr
+沈心友 2 nr
+沈心工 16 nr
+沈忠平 6 nr
+沈思 257 nr
+沈思孝 36 nr
+沈思往事 3 nr
+沈惟敬 97 nr
+沈慧勇 2 nr
+沈慧芬 3 nr
+沈拂影 7 nr
+沈敬瞻 2 nr
+沈文凯 21 nr
+沈文程 3 nr
+沈既济 4 nr
+沈昆铜 10 nr
+沈明仁 2 nr
+沈春耀 256 nr
+沈晓海 3 nr
+沈暗恋 2 nr
+沈曾华 2 nr
+沈曾植 8 nr
+沈月泉 2 nr
+沈有鼎 2 nr
+沈本良 21 nr
+沈殿霞 3 nr
+沈永年 4 nr
+沈沈叫 6 nr
+沈沦 3 nz
+沈河区 3 ns
+沈泉庄 3 nr
+沈泉庄村 3 ns
+沈泽民 5 nr
+沈浸 3 n
+沈淀 3 ns
+沈淀出来 3 n
+沈淀法 3 ns
+沈淀物 3 nt
+沈溺 3 n
+沈滞 3 n
+沈滞性 3 n
+沈灶镇 3 nr
+沈烈风 2 nr
+沈燮均 2 nr
+沈献章 4 nr
+沈玄庐 2 nr
+沈玉英 128 nr
+沈田子 4 nr
+沈甸甸 3 ns
+沈疔 3 n
+沈痾 3 nz
+沈相公 5 nr
+沈睡不醒 3 n
+沈知方 3 nr
+沈祖荣 3 nr
+沈祥福 48 nr
+沈福儒 2 nr
+沈福文 3 nr
+沈福民 2 nr
+沈福馨 2 nr
+沈秋雪 3 nr
+沈积岩 3 nr
+沈积石 3 nr
+沈端先 4 nr
+沈约 9 ns
+沈绍功 2 nr
+沈绍安 3 nr
+沈继业 5 nr
+沈继祖 9 nr
+沈维宇 2 nr
+沈绿村 111 nr
+沈绿爱 211 nr
+沈缅酒色 3 v
+沈老师 2 nr
+沈腰潘鬃 3 n
+沈腰潘鬓 3 nr
+沈船 3 nz
+沈莹 3 nr
+沈萍冷 2 nr
+沈萍连 2 nr
+沈葆桢 11 nr
+沈葆祯 3 nr
+沈虹冰 3 nr
+沈西苓 3 nr
+沈西蒙 4 nr
+沈诗任笔 3 nr
+沈起炜 10 nr
+沈辛荪 256 nr
+沈达人 2 nr
+沈迷不醒 3 nr
+沈通 2 nz
+沈钦裴 8 nr
+沈钧儒 71 nr
+沈银河 3 nr
+沈长卿 3 nr
+沈闷 3 n
+沈阳 1487 ns
+沈阳人 18 nr
+沈阳体育学院 2 nt
+沈阳军区 100 ns
+沈阳军区空军 2 nt
+沈阳北站 2 ns
+沈阳城 26 ns
+沈阳大学 2 nt
+沈阳局 3 nr
+沈阳市 129 ns
+沈阳市政府 3 nt
+沈阳房产 3 nr
+沈阳机床 2 nz
+沈阳站 3 ns
+沈阳药科大学 2 nt
+沈阳部队 2 nt
+沈阳铁路局 8 nt
+沈阳队 15 nt
+沈阳飞机制造公司 2 nt
+沈阿姨 3 nr
+沈陷 3 n
+沈雁冰 11 nr
+沈雯 13 nz
+沈青刚 9 nr
+沈静 3 nr
+沈静下来 3 nr
+沈顺招 2 nr
+沈高速 2 nr
+沈鱼落雁 3 nr
+沈鸿英 8 nr
+沈黎 2 ns
+沈黎郡 6 nr
+沈默 3 nr
+沈默不语 3 nr
+沈默寡言 3 nr
+沈龙元 5 nr
+沉 2396 v
+沉下 3 v
+沉下去 3 v
+沉下来 3 v
+沉不住气 3 i
+沉井 383 n
+沉伦 3 z
+沉住气 45 n
+沉入 170 v
+沉冤 16 v
+沉冤已白 3 l
+沉冤莫白 3 i
+沉冤莫雪 3 i
+沉凝 7 vn
+沉勇 3 a
+沉博绝丽 3 i
+沉厚寡言 3 i
+沉吟 1344 v
+沉吟不决 3 i
+沉吟未决 3 i
+沉吟章句 3 i
+沉垫 3 n
+沉声 3 n
+沉声静气 3 z
+沉实 14 a
+沉寂 285 a
+沉寂多年 3 i
+沉寂已久 3 i
+沉密寡言 3 i
+沉床 3 v
+沉底 18 v
+沉得 3 v
+沉得住 3 v
+沉得住气 3 n
+沉心静气 3 i
+沉思 739 a
+沉思熟虑 3 i
+沉思默想 3 i
+沉思默虑 3 i
+沉掉 3 v
+沉李浮瓜 3 n
+沉椿 3 n
+沉毅 11 a
+沉毅寡言 3 l
+沉水植物 7 n
+沉沉 251 a
+沉沉入睡 3 l
+沉沉的 80 z
+沉沙池 15 n
+沉没 228 v
+沉沦 92 v
+沉浮 99 v
+沉浮俯仰 3 l
+沉浸 416 v
+沉浸于 3 l
+沉淀 525 v
+沉淀剂 10 n
+沉淀池 4 n
+沉淀法 3 n
+沉淀物 37 n
+沉淀素 3 n
+沉淀素原 3 n
+沉淀聚合 3 n
+沉渣 19 n
+沉渣泛起 3 n
+沉湎 95 v
+沉湎淫逸 3 i
+沉湎酒色 16 i
+沉溺 95 v
+沉溺于 3 vi
+沉溺在 3 z
+沉滓 3 n
+沉滓泛起 3 nr
+沉滞 3 v
+沉潜 4 vn
+沉潜刚克 3 n
+沉灶产蛙 3 n
+沉灶生蛙 3 n
+沉甸甸 151 z
+沉甸甸地 4 z
+沉疴 28 n
+沉疴宿疾 3 nr
+沉疴难起 3 ns
+沉痛 196 a
+沉痼自若 3 v
+沉着 715 v
+沉着应战 3 i
+沉着痛快 3 z
+沉着脸 3 l
+沉睡 193 v
+沉睡不醒 3 n
+沉积 1260 n
+沉积作用 3 n
+沉积层 42 n
+沉积岩 155 n
+沉积物 304 n
+沉积环境 3 n
+沉积相 3 n
+沉稳 206 a
+沉箱 8 n
+沉绵 3 z
+沉缅于 3 vi
+沉舟 3 n
+沉舟破釜 3 n
+沉船 259 n
+沉落 3 v
+沉著痛快 3 n
+沉谋研虑 3 n
+沉谋重虑 3 i
+沉迷 111 v
+沉迷不悟 3 i
+沉迷于 3 l
+沉迷在 3 z
+沉郁 94 a
+沉郁顿挫 5 i
+沉酣 3 z
+沉醉 152 v
+沉醉于 3 l
+沉醉在 3 i
+沉重 2440 a
+沉重寡言 3 i
+沉重少言 3 i
+沉重感 9 n
+沉重打击 3 i
+沉重负担 3 n
+沉闷 190 a
+沉闷闷 3 a
+沉降 216 v
+沉降系数 3 n
+沉降缝 3 n
+沉降罐 3 n
+沉降速度 3 n
+沉陷 41 v
+沉陷于 3 n
+沉陷在 3 i
+沉隆 3 a
+沉雄 49 n
+沉雷 11 v
+沉静 325 a
+沉静寡言 3 i
+沉香 326 v
+沉香亭 4 n
+沉香木 3 n
+沉鱼落雁 20 i
+沉默 2313 a
+沉默不语 3 i
+沉默基因 3 n
+沉默子 3 n
+沉默寡言 90 i
+沉默无语 3 i
+沉默是金 3 l
+沉默权 3 n
+沉默者 5 n
+沋 2 zg
+沌 8 x
+沏 159 v
+沏茶 69 v
+沐 893 nz
+沐仁浴义 3 nz
+沐剑声 3 i
+沐剑屏 3 i
+沐川 2 nz
+沐日浴月 3 nz
+沐浴 316 v
+沐浴乳 3 nz
+沐浴液 4 nz
+沐浴精 3 nz
+沐浴露 3 nz
+沐猴而冠 4 i
+沐猴衣冠 3 i
+沐阳 3 nz
+沐雨栉风 3 i
+沐雨梳风 3 vn
+沐雨经霜 3 nz
+沐露梳风 3 vn
+沐露沾霜 3 i
+沑 3 zg
+沒 4 zg
+沓 177 zg
+沓冈复岭 3 v
+沓杂 3 i
+沓来踵至 3 i
+沓来麕至 3 i
+沓至 3 i
+沔 1584 nrt
+沔阳 1061 nrt
+沔阳县 3 ns
+沖 15 zg
+沘 3 zg
+沘源 3 vn
+沙 2932 nr
+沙丁鱼 117 nr
+沙丘 590 nr
+沙丘魔堡 3 nr
+沙东 2 ns
+沙为平 2 nr
+沙乌地阿 3 ns
+沙二世 3 nr
+沙井 5 n
+沙井子 3 nr
+沙井镇 3 nr
+沙他蓬甲 3 ns
+沙以城 2 nr
+沙伊卜 2 nr
+沙伊斯 2 nr
+沙伐 8 n
+沙佩勒 3 nr
+沙佩尔 5 nr
+沙俄 338 ns
+沙僧 695 nr
+沙僧亦 2 nr
+沙僧依 2 nr
+沙僧取 2 nr
+沙僧宝 2 nr
+沙僧寻 2 nr
+沙僧拢 2 nr
+沙僧放 2 nr
+沙僧歇 5 nr
+沙僧正 4 nr
+沙僧牵 5 nr
+沙僧笑 21 nr
+沙僧见 5 nr
+沙僧辞 2 nr
+沙僧闪 2 nr
+沙僧闻 9 nr
+沙僧领 2 nr
+沙僧驾 2 nr
+沙兄弟 7 nr
+沙克沙伊瓦曼 2 nrt
+沙公园 2 nr
+沙兹里 4 nr
+沙内尔 6 nr
+沙利文 11 nr
+沙剌班 2 nr
+沙力 2 n
+沙加 3 ns
+沙加家 2 n
+沙努丁 2 nr
+沙劳越 3 nr
+沙勒罗 3 nr
+沙包 302 n
+沙化 90 n
+沙区 27 ns
+沙千里 3 nr
+沙南 2 ns
+沙县 27 ns
+沙参 17 nr
+沙发 862 nz
+沙发厂 3 n
+沙发垫 3 n
+沙发床 7 nz
+沙发椅 12 n
+沙变金 2 nr
+沙口 262 n
+沙可夫 4 nr
+沙司 2 n
+沙咀 258 ns
+沙和尚 23 nr
+沙哈鲁 15 nr
+沙哑 122 n
+沙喉 3 n
+沙嘴 56 nr
+沙囊 3 n
+沙图克 3 nr
+沙土 213 n
+沙土地 7 ns
+沙土路 4 ns
+沙地 153 n
+沙场 184 n
+沙场老兵 3 n
+沙场老将 3 n
+沙坑 41 n
+沙坝 25 nr
+沙坡 9 ns
+沙坡头 13 n
+沙坡头区 3 ns
+沙坦 2 ns
+沙坨地 3 n
+沙坪 6 ns
+沙坪坝 13 nr
+沙坪坝区 6 ns
+沙坪霸 3 nr
+沙垅 3 vn
+沙城 10 ns
+沙堆 3 n
+沙堡 2 ns
+沙堤 28 n
+沙堰 3 ns
+沙塘川 2 ns
+沙墙 2 n
+沙士 3 n
+沙士比 2 nr
+沙士菲 3 nr
+沙声 3 n
+沙复明 517 nr
+沙大环 9 nr
+沙天广 101 nr
+沙天江 4 nr
+沙太路 3 nr
+沙夫纳 2 nr
+沙夫豪森 2 nr
+沙头 8 n
+沙头角 9 n
+沙头角镇 2 ns
+沙奉泰 2 nr
+沙奎尔 3 nr
+沙奶奶 4 nr
+沙姆哈尼 2 nr
+沙姆山 2 nr
+沙姆斯 2 nr
+沙姆沙伊赫 6 nrt
+沙子 271 n
+沙子口 3 nr
+沙孟海 9 nr
+沙宗琪 41 nr
+沙宝亮 3 nr
+沙害 3 n
+沙家店 20 ns
+沙家浜 14 ns
+沙宾达 5 nr
+沙寨主 23 nr
+沙尔克 52 nr
+沙尔河 3 nr
+沙尘 141 nr
+沙尘暴 150 nr
+沙尼亚 2 ns
+沙层 4 n
+沙山 45 ns
+沙岗 50 nr
+沙岛 8 ns
+沙岛群 2 nr
+沙岩 8 nr
+沙岭 10 ns
+沙岭子 2 nr
+沙岸 6 n
+沙川 2 ns
+沙州 25 ns
+沙州县 3 ns
+沙州建 2 ns
+沙巴 49 nr
+沙巴克 3 nr
+沙巴区 2 ns
+沙巴尔 7 nr
+沙巴岛 3 ns
+沙巴州 5 ns
+沙巴铜 2 nr
+沙市 1138 ns
+沙市区 518 ns
+沙市市 258 ns
+沙布尔 2 nr
+沙布洛 5 nr
+沙希德 10 nr
+沙广天 3 nr
+沙弥 91 nr
+沙律 4 n
+沙德利 13 nr
+沙德尔 2 nr
+沙德韦 2 nr
+沙性母 4 nr
+沙恩霍 7 nr
+沙恭达罗 24 nz
+沙悟净 8 nr
+沙打旺 3 nr
+沙拉 49 nr
+沙拉拉 3 nr
+沙拉油 3 nz
+沙拉酱 2 nz
+沙拐枣 14 n
+沙拜尔 2 nr
+沙捞越 39 ns
+沙捞越州 2 ns
+沙排 3 n
+沙摩柯 8 nr
+沙放洋 2 nz
+沙文 3 nr
+沙文主义 55 n
+沙斐仪 17 nr
+沙普利 13 nr
+沙普尔 7 nr
+沙晶兰 2 nr
+沙暗 3 n
+沙暴 71 n
+沙木罕 3 nr
+沙杰汗 3 nr
+沙林 18 nr
+沙果 14 n
+沙枣 15 n
+沙枣叶 3 nr
+沙枣树 3 nr
+沙柱 4 nr
+沙柳 3 nr
+沙梅岛 2 nr
+沙梨 4 nr
+沙棘 34 n
+沙模数 2 n
+沙正治 7 nr
+沙比 6 nrt
+沙比亚 2 ns
+沙比利 3 ns
+沙沙 154 ns
+沙沙作响 3 n
+沙沙声 3 nr
+沙沙沙 3 ns
+沙沟 7 ns
+沙沟村 3 nr
+沙沱 34 ns
+沙河 385 ns
+沙河县 3 ns
+沙河口 3 ns
+沙河口区 3 ns
+沙河市 5 ns
+沙河店 2 ns
+沙河粉 4 nr
+沙河镇 3 ns
+沙治 2 n
+沙泥 3 n
+沙洋 3 ns
+沙洋县 256 ns
+沙洲 221 ns
+沙浆 3 n
+沙海 26 ns
+沙海中 5 nr
+沙海魔 21 nr
+沙涧渡 2 nr
+沙渚 3 ns
+沙湖 532 ns
+沙湾 287 ns
+沙湾区 3 ns
+沙湾县 3 ns
+沙湾镇 5 ns
+沙源 3 n
+沙溪庙 2 nr
+沙溪桥 3 nr
+沙溪镇 3 nr
+沙滩 993 nr
+沙滩排球 3 n
+沙滩椅 3 nr
+沙滩装 3 nr
+沙滩裤 3 nr
+沙滩车 3 n
+沙滩鞋 3 nr
+沙漏 8 n
+沙漠 2193 n
+沙漠之狐 3 n
+沙漠之舟 3 n
+沙漠化 101 n
+沙漠地 24 n
+沙漠相 3 n
+沙漠研究 3 n
+沙漠高地 3 n
+沙灾 3 n
+沙煲 3 nz
+沙燕儿 6 nr
+沙特 221 nr
+沙特尔 6 nr
+沙特政府 7 nt
+沙特队 26 n
+沙特阿拉伯 270 ns
+沙特阿拉伯王国 12 ns
+沙狐 2 nz
+沙獾 3 n
+沙珠玉 2 nr
+沙理士 3 n
+沙瓤 5 n
+沙生针 8 n
+沙田 32 nr
+沙田区 2 ns
+沙田柚 16 n
+沙皇 506 nr
+沙皇统治 3 nr
+沙皮狗 3 nr
+沙盘 59 n
+沙盘推演 3 n
+沙盘演练 3 n
+沙眼 37 n
+沙石 64 nr
+沙石路 3 nr
+沙矶头村 4 ns
+沙砾 39 n
+沙祖康 3 nr
+沙科保 4 nr
+沙窗 3 n
+沙窝 9 n
+沙窝子 4 nr
+沙箱 8 n
+沙米尔 9 nr
+沙米索 2 nr
+沙米隐 2 nr
+沙粒 51 n
+沙粒疾 4 nr
+沙糖 3 n
+沙糖桔 3 nr
+沙维尔 3 nr
+沙罗奔 9 nr
+沙罗曼蛇 3 nr
+沙罗树 2 nr
+沙罗王 6 nr
+沙罗铁 3 nr
+沙老大 8 nr
+沙耶武 2 nr
+沙脊 2 n
+沙船 22 n
+沙色乡 3 ns
+沙苑子 3 nr
+沙茨 3 nrt
+沙茶 3 nr
+沙草 2 n
+沙荒 3 n
+沙荒地 2 n
+沙菲尔 2 nr
+沙落雁 22 nr
+沙虫 3 n
+沙蚕 20 nr
+沙蚕科 5 nr
+沙蟹 3 n
+沙衮 11 nrt
+沙袋 35 n
+沙角 18 n
+沙谷 2 n
+沙质 59 n
+沙质土 5 n
+沙贾汗 7 nr
+沙赫尔 4 nr
+沙赫拉 2 nr
+沙赫特 4 nr
+沙赫里 2 nr
+沙路尔 2 nr
+沙达特 3 nr
+沙通天 100 nr
+沙里 49 ns
+沙里夫 3 nr
+沙里河 11 ns
+沙里淘金 4 nr
+沙里湾 3 ns
+沙量 6 n
+沙金 19 n
+沙钵略 2 nr
+沙钵罗 3 nr
+沙钻蟹 3 nz
+沙钻鱼 3 nr
+沙锅 28 n
+沙锅浅儿 3 nr
+沙镇宇 2 nr
+沙门 98 n
+沙门氏菌 30 nr
+沙阿斯 2 nr
+沙陀 85 ns
+沙隆达 3 nr
+沙雅 4 nr
+沙雅县 4 ns
+沙雕 8 n
+沙雕节 3 n
+沙雷氏 5 nr
+沙面 3 n
+沙颍河 4 nr
+沙马 10 ns
+沙鱼 262 n
+沙鲁里山 13 ns
+沙鸡 30 n
+沙鸥 8 nr
+沙鸥翔集 3 nr
+沙鹿 3 nr
+沙黄色 3 n
+沙鼠 5 n
+沙龙 160 nr
+沚 11 zg
+沛 116 ns
+沛县 67 ns
+沛雨甘霖 3 nr
+沜 2 zg
+沞 2 zg
+沟 2382 n
+沟仔 3 n
+沟口 38 n
+沟回 6 v
+沟坎 6 nrt
+沟坑 3 n
+沟堑 3 n
+沟壑 99 n
+沟壑区 8 n
+沟壑纵横 3 n
+沟壕 10 n
+沟女 3 n
+沟子 3 n
+沟帮子 4 n
+沟床 3 v
+沟底 26 s
+沟施 3 v
+沟槽 45 n
+沟池 3 n
+沟沟坎坎 10 n
+沟沟壑壑 5 n
+沟沿 3 s
+沟沿儿 3 n
+沟洫 18 n
+沟涧 3 nrt
+沟渠 379 n
+沟满壕平 3 z
+沟满濠平 3 z
+沟灌 3 v
+沟纹 6 n
+沟谷 137 n
+沟边 13 s
+沟边组装 3 n
+沟通 2572 v
+沟通了解 3 n
+沟通交流 3 n
+沟通思想 3 n
+沟通感情 3 n
+沟通模式 3 n
+沟通网络 3 n
+沟造 3 v
+沟道 30 v
+沟道效应 3 n
+沟里 121 s
+沟门 4 n
+沟鼠 3 n
+没 52407 v
+没一搭 3 v
+没上 3 v
+没上去 3 v
+没上没下 29 l
+没下 3 v
+没世 3 v
+没世不忘 3 l
+没世不渝 3 l
+没世无称 3 n
+没世无闻 3 i
+没世穷年 3 i
+没世难忘 3 i
+没中 3 v
+没主意 3 l
+没书 3 v
+没了 3 v
+没事 516 v
+没事人 26 l
+没事儿 121 l
+没事干 3 l
+没事找事 24 l
+没交 3 v
+没亮 3 v
+没亲 3 v
+没亲没故 3 l
+没人 3 l
+没人怜悯 3 v
+没人接 3 v
+没人管 3 l
+没什么 2111 l
+没付 3 v
+没份 3 l
+没传 3 v
+没使 3 v
+没借 3 v
+没像 3 v
+没光 3 v
+没入 138 v
+没关 3 v
+没关系 237 l
+没养 3 v
+没写 3 v
+没准 165 v
+没准儿 40 l
+没准头 3 l
+没出 3 v
+没出息 107 l
+没分 3 l
+没分开 3 l
+没到 3 v
+没刺 3 v
+没前途 3 i
+没剩 3 v
+没劝 3 v
+没办 3 v
+没动 3 v
+没动静 3 l
+没劲 53 v
+没劲儿 10 d
+没升 3 v
+没卫饮羽 3 n
+没去 3 v
+没取 3 v
+没受 3 v
+没受教育 3 l
+没变 3 v
+没可奈何 3 l
+没吃没穿 3 l
+没吃过 3 l
+没向 3 v
+没听到过 3 l
+没听说过 3 l
+没吵 3 v
+没吸 3 v
+没味 3 v
+没味儿 7 v
+没命 147 v
+没唱 3 v
+没唸 3 vn
+没商量 3 l
+没回 3 v
+没填 3 v
+没声 3 l
+没声没息 3 l
+没多久 3 l
+没多远 3 l
+没大 3 v
+没大没小 14 l
+没头 3 v
+没头没尾 11 l
+没头没脑 100 l
+没头没脸 14 l
+没头脑 6 l
+没头苍蝇 28 i
+没奈何 104 l
+没套 3 v
+没好气 3 l
+没好气儿 3 l
+没学 3 l
+没守 3 v
+没完 25 v
+没完没了 201 l
+没屋架梁 3 i
+没工夫 3 l
+没底 208 v
+没开 3 v
+没弄脏 3 i
+没当 3 v
+没当回事 3 l
+没影 3 v
+没影儿 9 l
+没征 3 v
+没得 3 v
+没得说 3 l
+没得说的 19 l
+没心 3 v
+没心没肝 3 l
+没心没肺 24 l
+没心肝 11 l
+没志气 3 v
+没念 3 v
+没想 3 l
+没想到 2783 l
+没意思 122 l
+没慢 3 v
+没戏 39 v
+没戏可拍 3 l
+没成想 8 l
+没抄 3 v
+没把握 3 l
+没拿到 3 l
+没指望 3 l
+没挤 3 v
+没排 3 v
+没接 3 v
+没搬 3 v
+没收 892 v
+没收物 3 l
+没放 3 v
+没效 3 v
+没救 3 v
+没教养 3 l
+没数 3 l
+没敲 3 v
+没日没夜 34 l
+没日没月 3 l
+没有 87597 v
+没有冬天 3 l
+没有冲淡 3 v
+没有勇气 3 l
+没有印象 3 l
+没有受害 3 l
+没有同伴 3 n
+没有响应 3 n
+没有学问 3 l
+没有成见 3 l
+没有支撑 3 v
+没有数过 3 l
+没有止境 3 l
+没有污点 3 i
+没有特权 3 l
+没有用完 3 v
+没有碰过 3 l
+没有磨损 3 l
+没有经费 3 l
+没有规矩 13 l
+没有话说 3 l
+没有负荷 3 l
+没有铺路 3 l
+没有防卫 3 l
+没有防备 3 l
+没本事 3 l
+没权 3 v
+没权没势 3 l
+没来 3 v
+没来头 3 l
+没来由 119 l
+没染 3 v
+没查没利 3 l
+没歉 3 v
+没死 3 v
+没毒 3 v
+没比 3 v
+没毛大虫 3 nz
+没气 3 l
+没求 3 v
+没没无闻 5 l
+没油 3 v
+没治 11 v
+没治了 3 l
+没沿 3 n
+没法 980 v
+没法儿 93 l
+没法奈何 3 l
+没法子 133 l
+没法没天 3 l
+没法用 3 l
+没洗 3 v
+没测 3 v
+没消 3 v
+没深没浅 3 l
+没满 3 v
+没演 3 v
+没炒 3 v
+没烧 3 v
+没热情 3 l
+没爹 3 n
+没爹没娘 3 v
+没牵 3 v
+没玩 3 v
+没球 3 v
+没理由 3 l
+没生 3 v
+没生气 3 l
+没用 463 v
+没用到 3 l
+没用过 3 l
+没电 3 l
+没画 3 v
+没病 3 v
+没皮没脸 3 l
+没省 3 v
+没眉没眼 3 l
+没看 3 v
+没着没落 20 l
+没石饮羽 3 n
+没破 3 v
+没神 3 l
+没种 3 l
+没空 79 v
+没穿 3 v
+没笑 3 v
+没笔 3 v
+没等我 3 i
+没签 3 v
+没精塌彩 3 i
+没精打彩 6 i
+没精打采 42 i
+没精没彩 3 i
+没经 3 l
+没给 3 v
+没缘 3 v
+没羞 2 v
+没羞没臊 3 n
+没羽 3 v
+没考上 3 l
+没而不朽 3 i
+没聊 3 v
+没能 3 v
+没脑子 3 l
+没脸 107 v
+没脸没皮 10 l
+没脸见人 3 l
+没舍得 3 l
+没船 3 v
+没良心 86 l
+没花 3 l
+没药 29 v
+没落 187 v
+没落阶级 3 l
+没藏 3 v
+没衷一是 3 i
+没被冒犯 3 i
+没要 3 v
+没见 3 v
+没见识 3 l
+没规矩 3 l
+没计奈何 6 i
+没讨 3 v
+没让 3 v
+没记 3 v
+没设 3 v
+没词 3 v
+没词儿 2 l
+没试 3 v
+没话说 3 l
+没说出 3 v
+没说到 3 l
+没说的 14 l
+没请 3 v
+没谱 12 v
+没谱儿 3 l
+没赏 3 v
+没赚 3 v
+没赶 3 v
+没趣 106 v
+没趣儿 8 l
+没路 3 l
+没路可走 3 l
+没跷 3 v
+没轻没重 11 l
+没输 3 v
+没辙 47 v
+没边儿 3 l
+没过 3 v
+没过几天 3 l
+没过多久 3 l
+没运 3 l
+没这回事 3 l
+没进 3 v
+没通 3 v
+没造化 3 l
+没道理 3 l
+没那回事 3 l
+没酒 3 v
+没醉 3 v
+没醒 3 v
+没里没外 3 l
+没量 3 v
+没金铩羽 3 v
+没金饮羽 3 n
+没钱 3 v
+没钱买 3 v
+没销 3 v
+没错 70 v
+没错儿 15 l
+没门 35 v
+没门儿 6 l
+没附 3 v
+没面子 3 l
+没顶 10 v
+没颠没倒 3 v
+没飞 3 v
+没食子酸 25 l
+没饭 3 v
+没骨头 3 l
+没骨山水 3 l
+没骨气 3 l
+没齿 3 v
+没齿不忘 10 i
+没齿无怨 3 i
+没齿难忘 11 i
+沣 133 zg
+沣河 15 ns
+沤 96 v
+沤心沥血 3 vn
+沤沫槿艳 3 nr
+沤浮泡影 3 nr
+沤珠槿艳 3 nr
+沤肥 13 vn
+沥 105 n
+沥城 3 n
+沥城县 3 n
+沥水 4 n
+沥沥 3 nz
+沥沥拉拉 3 n
+沥涝 3 n
+沥胆 3 n
+沥胆堕肝 3 v
+沥胆披肝 3 v
+沥胆抽肠 3 vn
+沥胆濯肝 3 v
+沥胆隳肝 3 v
+沥血 3 n
+沥血叩心 3 z
+沥血披心 3 z
+沥血披肝 3 v
+沥酒 3 n
+沥青 243 n
+沥青厂 2 n
+沥青泵 3 n
+沥青测量 3 n
+沥青脉 3 n
+沥青路 35 n
+沥青路面 3 n
+沦 143 zg
+沦丧 171 v
+沦为 719 v
+沦亡 147 v
+沦亡史 3 n
+沦入 3 v
+沦入敌手 3 l
+沦入风尘 3 l
+沦没 3 v
+沦浃肌髓 3 n
+沦灭 3 v
+沦肌夹髓 3 n
+沦肌浃髓 3 v
+沦落 154 v
+沦落人 3 l
+沦落街头 2 l
+沦落风尘 9 l
+沦陷 345 v
+沦陷区 88 n
+沧 173 ns
+沧县 20 ns
+沧州 285 ns
+沧州市 13 ns
+沧桑 203 ns
+沧桑之变 3 i
+沧桑感 4 ns
+沧桑陵谷 3 ns
+沧江 3 ns
+沧浪 3 ns
+沧浪亭 3 ns
+沧浪区 3 ns
+沧浪老人 3 i
+沧海 441 ns
+沧海一粟 8 i
+沧海一鳞 3 n
+沧海桑田 33 ns
+沧海横流 14 i
+沧海笑 3 i
+沧海遗珠 3 ns
+沧源 8 ns
+沧源佤族自治县 3 ns
+沧茫 3 i
+沨 4 zg
+沩 6 g
+沩仰宗 2 n
+沩山 4 ns
+沪 2340 j
+沪东 13 ns
+沪军 3 j
+沪剧 20 n
+沪宁 40 j
+沪宁线 12 j
+沪宁铁路 29 nz
+沪市 119 j
+沪杭甬 3 ns
+沪江 26 j
+沪深股市 3 n
+沪绸 3 n
+沪综指 13 n
+沪菜 3 n
+沪西 12 j
+沪读 3 j
+沪货 3 j
+沪闵路 3 vn
+沫 253 n
+沫儿 17 n
+沫子 12 n
+沬 6 zg
+沭 34 ns
+沭河 32 ns
+沭阳 13 ns
+沭阳县 17 ns
+沮 196 zg
+沮丧 535 a
+沮泄 3 n
+沮洳 3 n
+沮索 3 a
+沰 2 zg
+沱 96 ns
+沱江 48 ns
+沱江镇 3 ns
+沱沱河 23 ns
+沱湖 2 ns
+沱牌 21 nz
+沱茶 14 nz
+河 12374 ns
+河上 3 s
+河上源 6 n
+河下 21 s
+河不出图 3 l
+河东 318 ns
+河东三箧 3 i
+河东军 7 nt
+河东区 20 ns
+河东君 15 ns
+河东宣 4 nr
+河东岸 3 ns
+河东平阳 9 ns
+河东慰 2 nr
+河东村 4 ns
+河东柳 4 nr
+河东流 2 ns
+河东源 2 ns
+河东狮 2 ns
+河东狮吼 2 nr
+河东狮子 3 ns
+河东王 4 nr
+河东节 2 ns
+河东路 9 ns
+河东郡 8 ns
+河中 3 ns
+河中府 3 nt
+河之洲 3 nr
+河之滨 2 nr
+河云北 2 ns
+河以东 2 nr
+河伯 5 ns
+河伯为患 3 n
+河修寨 3 nr
+河修运 2 nr
+河倾月落 3 n
+河入海 2 nr
+河兰湟 2 nr
+河内 248 s
+河决鱼烂 3 l
+河出伏流 3 n
+河务 6 n
+河务局 2 nt
+河势 264 n
+河北 3194 ns
+河北乡 3 ns
+河北人 18 n
+河北人民出版社 4 nt
+河北农业大学 2 nt
+河北区 12 ns
+河北地区 25 ns
+河北大学 9 nt
+河北宣工 14 nt
+河北师范大学 6 nt
+河北平原 75 ns
+河北教育出版社 4 nt
+河北杨 3 ns
+河北梆子 40 n
+河北省 826 ns
+河北省人民政府 2 nt
+河北省委 3 nt
+河北省政府 4 nt
+河北籍 3 n
+河北镇 2 ns
+河区 2 ns
+河升镇 3 n
+河南 5044 ns
+河南人 127 n
+河南人民出版社 10 nt
+河南坠子 20 n
+河南大学 35 nt
+河南大学队 2 nt
+河南岸 3 ns
+河南师范大学 3 nt
+河南建业 17 nt
+河南建业队 23 nt
+河南日报 3 nz
+河南梆子 22 n
+河南省 1262 ns
+河南省委 8 nt
+河南省政府 8 nt
+河南省旅游局 2 nt
+河南省纪委 4 nt
+河南省高级人民法院 3 nt
+河南站 3 ns
+河南蒙古族自治县 6 ns
+河南队 17 nt
+河卡 2 ns
+河卵石 2 n
+河口 1566 ns
+河口区 19 ns
+河口县 3 ns
+河口湾 18 ns
+河口瑶族自治县 8 ns
+河口镇 19 ns
+河右岸 12 nr
+河合 3 ns
+河合水 4 n
+河合浩 2 nr
+河同水密 3 ns
+河唇 2 n
+河图 24 ns
+河图洛 5 ns
+河图洛书 3 nr
+河均发源 3 n
+河坝 7 ns
+河堤 199 n
+河塘 6 ns
+河外星系 39 nt
+河大 4 ns
+河大桥 3 ns
+河头 262 n
+河奔海聚 3 nr
+河套 201 n
+河姆渡 55 ns
+河子 257 n
+河宣省 2 nt
+河宽谷 2 nr
+河山 61 ns
+河山之德 3 nr
+河山带砺 3 nr
+河岸 328 s
+河川 154 ns
+河州 43 ns
+河州卫 3 ns
+河工 48 n
+河巴尔 2 ns
+河床 1284 n
+河床变形 3 l
+河床队 3 n
+河底 38 ns
+河底下 3 s
+河开成 2 nr
+河心 3 n
+河斜月落 3 n
+河晏水清 3 ns
+河智苑 3 nr
+河曲 58 ns
+河曲县 9 ns
+河朔 3 ns
+河村 9 ns
+河柳 2 n
+河桥 24 ns
+河桥东 2 ns
+河梁之谊 3 nr
+河梁携手 3 i
+河梏 3 n
+河槽 45 n
+河殇 3 n
+河段 610 n
+河水 917 ns
+河水不犯 3 l
+河水不犯井水 19 i
+河水库 3 n
+河汇注 2 nz
+河汉 12 ns
+河汉无极 3 nr
+河汉江淮 3 ns
+河汊子 3 ns
+河池 33 ns
+河池地区 7 ns
+河池市 9 ns
+河汾门下 3 ns
+河沙 9 ns
+河沙世界 3 n
+河沙堆 3 ns
+河沟 295 ns
+河沿 25 s
+河泥 5 n
+河泰权 2 nr
+河泽亦 2 nr
+河洄游 5 nr
+河洛 35 ns
+河洛之 2 nr
+河洛凡 2 ns
+河洛图 2 ns
+河洛镇 3 ns
+河津 14 ns
+河津南 3 ns
+河津县 2 ns
+河津市 8 ns
+河洲 3 ns
+河流 5249 n
+河流偏移 3 i
+河流学 3 n
+河流补给 3 n
+河流袭夺 3 i
+河流错位 3 n
+河流镇 3 ns
+河流阶地 3 n
+河浜 3 ns
+河海 24 ns
+河海大学 13 nt
+河海清宴 3 ns
+河涸海干 3 nz
+河清 8 ns
+河清三日 3 ns
+河清云庆 3 ns
+河清人寿 3 ns
+河清海宴 3 ns
+河清海晏 4 nr
+河清海竭 3 nr
+河清社鸣 3 l
+河清难俟 3 nr
+河渠 65 ns
+河渡 3 ns
+河港 128 ns
+河湖 372 ns
+河湖相 3 nr
+河湾 325 ns
+河源 208 n
+河源市 9 ns
+河溓海夷 3 nz
+河溓海晏 3 nrt
+河满子 3 nr
+河滨 13 ns
+河滨公园 3 ns
+河滩 216 ns
+河滩地 16 ns
+河漂流 3 n
+河漫滩 63 n
+河灯 3 n
+河狸 58 n
+河田鸡 5 ns
+河界 8 n
+河畔 304 ns
+河目海口 3 ns
+河直进 2 nr
+河砂 4 n
+河神 32 n
+河窄水浅 3 v
+河系 34 n
+河网 411 n
+河网化 3 n
+河网密度 3 n
+河肥 3 ns
+河自东 4 ns
+河自北 2 ns
+河船 3 n
+河色钦 2 ns
+河药 3 n
+河落海干 3 ns
+河虾 3 n
+河蚌 26 n
+河蟹 526 n
+河街 4 ns
+河西 467 ns
+河西乡 3 ns
+河西务 11 n
+河西区 19 ns
+河西村 3 ns
+河西走廊 240 ns
+河西镇 3 ns
+河谷 1128 ns
+河豚 88 n
+河豚毒素 3 v
+河豚鱼 3 v
+河趟 3 v
+河身 19 n
+河边 551 s
+河边北街 3 ns
+河边北路 3 ns
+河边南街 3 ns
+河边南路 3 ns
+河运 54 n
+河道 2042 n
+河道坡降 3 n
+河道等级 3 n
+河里 324 ns
+河野 2 ns
+河锋 3 n
+河门海口 3 ns
+河间 225 n
+河间县 3 ns
+河间市 6 ns
+河间王 3 n
+河防 3 n
+河阳 34 ns
+河阳仓 2 ns
+河阳温 2 nr
+河阴仓 4 ns
+河隄 3 vn
+河障 3 n
+河面 165 n
+河面上 3 n
+河风光 4 n
+河马 56 ns
+河鱼 266 n
+河鱼之患 3 i
+河鱼之疾 3 nr
+河鱼天雁 3 nr
+河鱼腹疾 3 n
+河鲜 3 ns
+河鳗 3 n
+河鳟 3 n
+河麂 3 n
+河鼓 3 n
+沴气 3 z
+沵 4 zg
+沸 233 zg
+沸反盈天 4 n
+沸反连天 3 i
+沸天震地 3 i
+沸水 104 n
+沸汤 3 n
+沸沸 3 v
+沸沸扬扬 156 i
+沸沸汤汤 3 i
+沸泉 15 n
+沸点 439 n
+沸点升高 3 i
+沸热 3 v
+沸煮 4 v
+沸石 73 n
+沸腾 357 v
+沸腾床 3 n
+沸腾钢 3 i
+油 5665 n
+油乎乎 2 z
+油井 74 n
+油亮 46 n
+油亮亮 3 z
+油价 328 n
+油价格 3 n
+油位表 3 n
+油光 70 n
+油光光 8 n
+油光可鉴 3 i
+油光晶亮 3 z
+油光水滑 6 n
+油光满面 3 l
+油公司 8 n
+油剂 8 n
+油加利树 3 n
+油势分析 3 l
+油匠 3 n
+油区 71 n
+油印 26 n
+油印机 4 n
+油厂 2 n
+油压 12 n
+油压式 3 n
+油压机 2 n
+油压表 3 n
+油品 55 n
+油品店 2 n
+油品调合 3 n
+油嘴 21 n
+油嘴油舌 2 i
+油嘴滑舌 35 i
+油嘴花唇 3 n
+油地毡 3 i
+油坊 58 n
+油垢 6 n
+油城 3 n
+油墨 98 n
+油墨厂 3 n
+油墨味 3 n
+油壁香车 3 n
+油壶 8 n
+油头光棍 3 n
+油头滑脑 2 n
+油头滑脸 3 i
+油头滑面 3 n
+油头粉面 13 n
+油子 8 n
+油孔 3 n
+油封 3 n
+油尺 3 n
+油层 56 n
+油工 129 n
+油布 97 n
+油布伞 3 n
+油干火尽 3 i
+油干灯尽 3 i
+油库 66 n
+油底霜 3 n
+油当量 7 l
+油彩 47 n
+油性 51 n
+油性地 3 n
+油性皮肤 3 n
+油房 3 n
+油斑 3 n
+油料 1039 n
+油料作物 75 l
+油料勤务 3 n
+油料器材 3 n
+油料库 3 n
+油料植物 3 l
+油料管理 3 n
+油料脱皮 3 i
+油料输送 3 n
+油晃晃 3 z
+油机 5 n
+油杉 6 n
+油条 100 n
+油松 64 n
+油松林 7 n
+油松节 3 n
+油枪 3 n
+油枯 3 z
+油柑 3 n
+油柿 3 n
+油桃 6 n
+油桐 410 n
+油桐树 2 n
+油桶 17 n
+油梨 5 n
+油棕 97 n
+油棕榈树 3 n
+油椰子 3 n
+油榨 256 v
+油槽 3 n
+油樟 3 n
+油橄榄 38 n
+油橄榄树 3 n
+油款 3 n
+油母页岩 8 n
+油毛毡 8 i
+油毡 7 n
+油毡纸 3 n
+油气 301 n
+油气井 3 n
+油气分离 3 n
+油气区 9 n
+油气显示 3 n
+油气流 5 n
+油气田 93 n
+油气藏 82 n
+油水 122 n
+油汀 3 nz
+油池 3 n
+油污 46 n
+油汪汪 8 z
+油汽炉 3 n
+油油 3 n
+油油的 2 z
+油泥 13 n
+油泵 18 n
+油流 12 n
+油浆 3 n
+油浇火燎 3 i
+油液 4 n
+油渍 16 n
+油渍麻花 3 n
+油渣 7 n
+油渣果 4 n
+油温 4 n
+油港 17 n
+油源层系 3 n
+油溶性 3 n
+油滑 26 n
+油漆 510 n
+油漆刷 3 z
+油漆匠 5 n
+油漆厂 2 n
+油漆味 6 n
+油漆工 2 n
+油漆房 3 n
+油漆未乾 3 i
+油灯 247 n
+油灰 10 n
+油炒 3 n
+油炸 160 n
+油炸机 3 n
+油炸物 3 n
+油炸锅 3 n
+油炸饼 3 n
+油炸鬼 3 n
+油烟 44 n
+油烟味 4 n
+油烟机 3 n
+油然 40 z
+油然作云 3 n
+油然而生 113 i
+油煎 3 z
+油煎火燎 3 z
+油煎饼 3 n
+油状 43 n
+油瓜 4 n
+油瓶 26 n
+油田 663 n
+油田区 3 n
+油田设备 3 n
+油画 671 n
+油画家 33 n
+油画展 5 n
+油画布 3 n
+油画笔 5 n
+油画院 3 n
+油皮 3 n
+油盏 3 n
+油盐 64 n
+油盐酱醋 33 i
+油盘 3 n
+油石 22 n
+油矿 19 n
+油砂 263 n
+油票 3 n
+油税 3 n
+油笔 2 n
+油管 37 n
+油管压力 3 n
+油管柱 3 n
+油管线 3 n
+油管锚 3 n
+油箱 155 n
+油箱盖 3 n
+油类 25 n
+油粕 6 n
+油纸 60 n
+油纸伞 17 n
+油绿 3 z
+油缸 29 n
+油罐 31 n
+油罐车 6 n
+油耗 37 n
+油耗子 3 n
+油脂 602 n
+油脂厂 3 n
+油脂粒 3 n
+油脂精炼 3 i
+油脂麻花 3 n
+油脚 3 n
+油腔 3 n
+油腔滑调 43 n
+油腻 112 n
+油腻感 3 l
+油腻腻 19 z
+油膏 48 n
+油膏盒 3 n
+油膜 25 n
+油舱 3 n
+油船 66 n
+油花 8 n
+油花花 3 n
+油苗 3 n
+油茶 434 n
+油茶树 4 n
+油茶籽 7 n
+油茶面 3 n
+油茶面儿 3 n
+油菜 286 n
+油菜地 2 n
+油菜子 3 n
+油菜籽 160 n
+油菜花 46 n
+油葫芦 2 n
+油藏 22 n
+油藏描述 3 n
+油藏模型 3 n
+油藏油 3 n
+油裙 3 n
+油豆腐 8 n
+油质 11 n
+油费 3 n
+油路 8 n
+油车 3 n
+油轮 117 n
+油运 7 n
+油迹 8 n
+油郭乡 3 n
+油酥 6 n
+油酸 32 n
+油酸盐 3 n
+油量 3 n
+油钱 7 n
+油锅 136 n
+油锯 4 n
+油门 72 n
+油阀 3 n
+油雕院 3 n
+油面 3 n
+油面筋 2 n
+油鞋 3 n
+油页岩 117 n
+油饭 3 n
+油饰 260 n
+油饼 29 n
+油香 11 n
+油驳 3 z
+油鸡 3 n
+油麦 3 n
+油麻 3 n
+油麻菜籽 3 n
+油黑 13 z
+油龙 2 n
+治 7500 v
+治不好 3 v
+治世 3 v
+治丧 31 v
+治丧委员 3 l
+治乱 39 v
+治乱减负 3 i
+治乱存亡 3 i
+治事 3 v
+治产 3 v
+治保 11 v
+治保主任 3 n
+治保会 3 n
+治党 3 n
+治兵 3 v
+治兵振旅 3 nz
+治军 131 n
+治军之道 3 l
+治则 19 n
+治劣 3 n
+治印 8 v
+治印艺术 3 n
+治厂 3 n
+治口臭 3 n
+治史者 6 n
+治咳嗽 3 n
+治国 571 ns
+治国安民 7 n
+治国安邦 14 nz
+治国者 7 n
+治外法权 36 l
+治多县 3 ns
+治好 3 v
+治好病 3 n
+治学 130 n
+治学严谨 3 i
+治安 1761 ns
+治安人员 3 n
+治安员 25 n
+治安处罚 3 n
+治安工作 3 n
+治安拘留 3 i
+治安机关 3 ns
+治安案件 3 n
+治安状况 3 n
+治安科 2 ns
+治安管理 3 n
+治安警 3 n
+治安费 2 n
+治安部门 3 n
+治家 50 n
+治家格言 3 nz
+治山 3 ns
+治平 62 v
+治愈 327 v
+治愈术 3 l
+治愈率 53 l
+治愚 3 n
+治愚治穷 3 i
+治感冒 3 v
+治所 896 v
+治教 17 nz
+治本 82 ns
+治权 666 v
+治标 34 v
+治标不治本 6 l
+治校 21 n
+治民 3 n
+治民官 3 n
+治水 186 v
+治水改土 3 n
+治污 38 v
+治沙 45 ns
+治河 3 ns
+治治 19 v
+治法 135 v
+治理 2766 v
+治理整顿 3 l
+治理环境 3 l
+治理者 3 n
+治疗 7678 v
+治疗仪 17 n
+治疗剂 2 n
+治疗学 12 n
+治疗室 6 n
+治疗师 24 n
+治疗机 4 n
+治疗法 4 n
+治疗率 5 n
+治疗者 3 n
+治疗费 18 n
+治病 529 v
+治病救人 64 n
+治療 3 vn
+治监 4 n
+治礼 3 v
+治税 6 v
+治穷 3 v
+治绩 3 n
+治罪 110 v
+治肿瘤 3 l
+治脱发 3 i
+治荒 3 v
+治装 3 v
+治装费 3 n
+治警 3 v
+治道 3 v
+治郭安邦 3 ns
+治黄 7 v
+沼 179 n
+沼地 3 n
+沼地热 3 n
+沼气 100 n
+沼气式 3 n
+沼气池 23 n
+沼池 3 n
+沼泽 1077 n
+沼泽化 3 n
+沼泽地 225 n
+沼泽地带 3 n
+沼泽学 3 n
+沼泽植物 3 n
+沼泽水文 3 n
+沼泽率 3 n
+沼液 3 n
+沼田 2 n
+沽 461 j
+沽名 14 v
+沽名卖直 3 i
+沽名吊誉 3 i
+沽名干誉 3 i
+沽名要誉 3 i
+沽名钓誉 37 i
+沽名钩誉 3 vn
+沽清 3 v
+沽源 11 nrt
+沽源县 4 ns
+沽誉买直 3 i
+沽誉钓名 3 i
+沽酒 3 v
+沾 1023 zg
+沾不上边 3 i
+沾亲 8 v
+沾亲带友 3 i
+沾亲带故 19 i
+沾体涂足 3 i
+沾光 26 v
+沾化 3 v
+沾化县 2 ns
+沾恩 3 v
+沾惠 3 v
+沾惹 11 v
+沾手 5 v
+沾有 3 v
+沾染 124 v
+沾染上 3 l
+沾染习气 3 z
+沾染到 3 l
+沾水 3 v
+沾汙 3 v
+沾污 9 v
+沾油 3 v
+沾沾自喜 69 i
+沾沾自好 3 i
+沾沾自满 3 i
+沾沾自衒 3 i
+沾泥 3 v
+沾泥带水 3 i
+沾润 3 v
+沾湿 20 v
+沾溼 3 v
+沾满 123 v
+沾濡 3 i
+沾用 3 v
+沾益 4 v
+沾益县 4 ns
+沾腥 3 i
+沾花惹草 2 i
+沾衣 3 v
+沾被 3 v
+沾襟 3 l
+沾边 51 ns
+沾边儿 4 l
+沾酒 3 v
+沾风惹草 3 i
+沿 3356 f
+沿上 3 f
+沿业 3 n
+沿习 3 v
+沿伸 3 v
+沿例 3 n
+沿儿 9 n
+沿南乡 3 ns
+沿层切片 3 n
+沿岸 1892 f
+沿岸国 21 n
+沿岸地区 3 n
+沿崖 3 n
+沿条 2 n
+沿条儿 3 n
+沿江 537 f
+沿江路 2 ns
+沿沟 2 ns
+沿河 462 ns
+沿河路 3 ns
+沿波讨源 3 n
+沿流渊源 3 ns
+沿流讨源 3 n
+沿海 3527 f
+沿海各县 3 ns
+沿海各省 3 ns
+沿海地区 94 ns
+沿海地带 3 n
+沿海居民 3 n
+沿海工业 3 n
+沿海港口 3 ns
+沿海经济 3 n
+沿湖 39 f
+沿溪 12 ns
+沿滩区 3 n
+沿用 1419 v
+沿用至今 3 n
+沿着 1699 p
+沿线 553 f
+沿行 3 v
+沿街 95 f
+沿街乞讨 3 vn
+沿街叫卖 3 n
+沿街道 3 n
+沿袭 360 v
+沿路 155 n
+沿路上 3 s
+沿边 64 f
+沿边儿 3 n
+沿途 711 b
+沿途上 3 s
+沿途见闻 3 n
+沿门 3 n
+沿门乞讨 3 vn
+沿门托钵 2 n
+沿门持钵 3 n
+沿门挂钵 3 n
+沿门讬钵 3 ns
+沿阶草 3 n
+沿革 2023 n
+沿革地理 3 n
+泃 10 zg
+泄 1021 zg
+泄下 3 v
+泄下去 3 v
+泄下来 3 v
+泄停封 3 v
+泄入 3 v
+泄出 3 v
+泄出去 3 v
+泄出来 3 v
+泄到 3 v
+泄劲 2 v
+泄去 3 v
+泄天机 3 n
+泄好 3 v
+泄完 3 v
+泄密 95 v
+泄密者 3 n
+泄底 3 v
+泄得 3 v
+泄忿 3 i
+泄恨 6 v
+泄愤 47 v
+泄成 3 v
+泄掉 3 v
+泄殖腔 17 n
+泄气 148 v
+泄气话 4 l
+泄水 3 v
+泄水道 4 n
+泄水闸 6 n
+泄沓 3 i
+泄油半径 3 n
+泄泄沓沓 3 i
+泄法 3 v
+泄泻 41 v
+泄洪 73 v
+泄洪区 3 n
+泄洪洞 2 n
+泄洪道 3 l
+泄洪闸 6 n
+泄漏 473 v
+泄漏天机 3 i
+泄火 3 v
+泄私愤 9 l
+泄给 3 v
+泄肚 3 v
+泄露 495 v
+泄露天机 9 i
+泄露机密 3 i
+泄露秘密 3 n
+泄题 3 n
+泄题案 3 n
+泅 18 v
+泅水 20 v
+泅水而过 3 v
+泅泳 2 v
+泅渡 20 v
+泇 3 zg
+泉 1607 ns
+泉下 3 n
+泉华沉积 3 vn
+泉台 3 ns
+泉城 30 ns
+泉城路 2 ns
+泉塘二区 3 ns
+泉头 3 n
+泉山区 3 ns
+泉山庄 3 ns
+泉州 404 ns
+泉州人 10 n
+泉州市 60 ns
+泉州网 3 n
+泉州街 3 ns
+泉建男 3 n
+泉林 5 ns
+泉水 593 ns
+泉水幽咽 3 n
+泉池 8 ns
+泉河 5 ns
+泉流 8 n
+泉涌 58 n
+泉港区 3 ns
+泉源 9 n
+泉眼 37 n
+泉石 3 n
+泉石膏盲 3 n
+泉石膏肓 3 n
+泊 969 ng
+泊位 1232 n
+泊地 3 n
+泊头 43 n
+泊头市 5 n
+泊岸 3 n
+泊来 3 v
+泊松括号 3 n
+泊松核 3 n
+泊松比 3 n
+泊秦淮 3 ns
+泊船 3 n
+泊车 3 n
+泋 2 zg
+泌 143 nz
+泌乳 110 nz
+泌乳期 6 n
+泌乳素 3 n
+泌乳素瘤 3 n
+泌出 3 v
+泌尿 157 n
+泌尿器 3 nz
+泌尿器官 3 n
+泌尿外科 3 nz
+泌尿学 3 n
+泌尿疾病 3 n
+泌尿科 3 nz
+泌尿管 3 n
+泌尿系 34 n
+泌尿系统 3 n
+泌尿道 3 n
+泌尿量 3 n
+泌阳 8 ns
+泌阳县 3 ns
+泐 7 g
+泑 2 zg
+泒 11 zg
+泓 86 q
+泓峥萧瑟 3 nr
+泔 11 n
+泔水 31 n
+泔水桶 5 n
+法 23361 j
+法不徇情 3 i
+法不治众 3 n
+法不绚情 3 vn
+法不责众 10 n
+法不阿贵 3 nr
+法义 3 n
+法乌尔 3 nr
+法乐 3 ns
+法乐通 2 nz
+法书 37 n
+法事 29 n
+法亚尔 5 nr
+法亦仿 2 nr
+法人 690 n
+法人代表 53 n
+法人地位 3 n
+法人股 177 n
+法人资格 3 n
+法仁功 3 nr
+法令 1112 n
+法伊 3 nrt
+法会 57 n
+法传进 2 nr
+法伦 41 ns
+法伦州 3 ns
+法体 3 n
+法体恒 3 nr
+法例 17 n
+法修习 3 nr
+法儿 118 n
+法儿引 2 nr
+法儿真 2 nr
+法克尔 2 nr
+法克斯 2 ns
+法兰 11 ns
+法兰克 154 ns
+法兰克福 460 nz
+法兰克福市 7 ns
+法兰克福机场 19 ns
+法兰城 3 ns
+法兰士 6 ns
+法兰式 3 nz
+法兰盘 3 n
+法兰福 3 nz
+法兰绒 8 nz
+法兰西 503 ns
+法兰西共 3 nr
+法兰西共和国 25 ns
+法兰西岛 4 ns
+法兰西斯 12 ns
+法兰西第五共和国 7 ns
+法兰西银行 17 nt
+法共 45 b
+法典 554 ns
+法军 50 n
+法军任 2 nr
+法出一门 3 n
+法出多门 3 n
+法分析 8 n
+法则 522 n
+法利 2 ns
+法利亚 8 ns
+法利赛 4 ns
+法制 1917 n
+法制办 11 n
+法制化 64 n
+法制史 56 n
+法制宣传 3 nz
+法制局 8 nt
+法制工作委员会 2 nt
+法制建设 3 l
+法制性 3 n
+法制报 3 n
+法制教育 3 l
+法制日报 8 nz
+法制晚报 3 nz
+法制环境 3 n
+法制科 3 n
+法制网 3 n
+法制观念 3 n
+法制轨道 3 n
+法剑招 2 nr
+法力 59 n
+法力无边 13 n
+法办 28 n
+法加斯 3 ns
+法务 25 n
+法务局 3 nt
+法务部 7 nt
+法勒 131 ns
+法勒亚 64 ns
+法医 61 n
+法医学 33 nt
+法医鉴定 3 n
+法华 6 nz
+法华寺 31 ns
+法华玄 5 nr
+法华省 2 ns
+法印 3 n
+法厄 3 ns
+法号 33 n
+法吉尔 3 nr
+法同郡 2 nr
+法名 212 n
+法向入射 3 n
+法向应力 3 n
+法商 152 n
+法商学院 3 nt
+法器 50 n
+法因 5 n
+法国 11361 ns
+法国人 473 n
+法国共产党 23 nt
+法国农业部 2 nt
+法国参议院 2 nt
+法国史 6 n
+法国号就 3 n
+法国国家队 8 nt
+法国国民议会 13 nt
+法国外交部 23 nt
+法国巴黎 3 ns
+法国巴黎大学 21 nt
+法国式 18 n
+法国总理 3 n
+法国政府 114 nt
+法国文化部 3 nt
+法国旅游 3 nz
+法国梧桐 24 ns
+法国法郎 12 n
+法国电信 16 nt
+法国电影 3 n
+法国电视台 2 nt
+法国社会党 24 nt
+法国航空公司 10 nt
+法国菜 3 n
+法国菜豆 3 n
+法国议会 18 nt
+法国队 218 nt
+法场 60 n
+法坛 2 n
+法域 3 n
+法堂 19 n
+法塔赫 29 nr
+法外情 3 n
+法外施仁 6 nr
+法外施恩 3 nr
+法奥 2 nrt
+法威震 2 nr
+法子 1160 n
+法孝直 3 nr
+法学 1244 n
+法学专业 3 nt
+法学会 8 nt
+法学博士 3 n
+法学士 3 n
+法学家 136 n
+法学所 5 nt
+法学界 16 n
+法学硕士 3 nr
+法学类 3 n
+法学系 2 n
+法学部 6 nt
+法学院 124 nt
+法官 813 n
+法官大人 3 nr
+法官法 3 nr
+法官袍 3 n
+法定 1305 n
+法定人数 6 n
+法定代理 3 n
+法定代表 3 n
+法定公积 3 n
+法定化 3 n
+法定年龄 3 n
+法定性 2 n
+法定时限 3 n
+法定期限 3 n
+法定条件 3 n
+法定标准 3 n
+法定程序 3 n
+法定继承 4 nr
+法宝 245 nz
+法家 160 n
+法家拂士 3 nr
+法尔 12 ns
+法尔克 6 ns
+法尔加 29 ns
+法尔孔 4 nr
+法尔思 5 nr
+法尔斯 10 ns
+法尔斯省 3 ns
+法尔曼 7 nr
+法尔松 2 nr
+法尔河 4 ns
+法尔科 4 ns
+法尔科内 3 nrt
+法尔考 3 ns
+法尔肯 3 nr
+法尔萨 34 ns
+法尔西尼 4 ns
+法尤姆 5 nr
+法尧禅 2 nr
+法尼醇 3 nz
+法属 3 n
+法属圣 2 ns
+法属圭亚 3 ns
+法属圭亚那 38 ns
+法属波利尼西亚 11 ns
+法工委 5 nt
+法币 65 n
+法布尔 3 ns
+法布里 15 ns
+法布雷 9 nr
+法师 202 n
+法师村 3 nr
+法帖 41 n
+法平面 3 n
+法库 9 n
+法库县 5 ns
+法度 216 ns
+法庭 1914 n
+法庭调查 3 nr
+法式 48 n
+法律 24213 n
+法律义务 3 n
+法律事务 3 n
+法律依据 3 l
+法律出版社 11 nt
+法律制裁 3 n
+法律化 32 ns
+法律合同 3 ns
+法律咨询 3 nt
+法律图书 3 nr
+法律委员会 274 nt
+法律学家 3 n
+法律学系 3 n
+法律宣传 3 nr
+法律常识 3 n
+法律意识 3 n
+法律手段 3 n
+法律承认 3 nr
+法律援助 3 nr
+法律效力 3 n
+法律文书 3 nr
+法律条文 3 ns
+法律案 8 n
+法律汇编 3 n
+法律法规 17 n
+法律界 21 n
+法律硕士 3 nr
+法律系 62 n
+法律纠纷 3 z
+法律网 3 n
+法律规避 3 nr
+法律认可 3 n
+法律论文 3 n
+法律责任 3 n
+法律顾问 3 nr
+法德勒 2 nr
+法德意 2 nr
+法恩佐 3 nr
+法恩莎 3 nrt
+法愈强 2 nr
+法意 66 n
+法成令修 3 nr
+法托斯 2 nr
+法扬斯 2 ns
+法拉 96 ns
+法拉利 44 ns
+法拉力 3 n
+法拉奇 4 nr
+法拉本多 5 ns
+法拉盛 3 nr
+法拉第 397 nr
+法拉美穗 3 nz
+法捷耶夫 7 nrt
+法政 178 n
+法数 3 n
+法文 162 nz
+法文版 21 n
+法文系 3 n
+法斯 3 ns
+法斯宾 6 ns
+法斯莱 2 ns
+法斯莱恩 3 nrt
+法新社 189 nt
+法方 45 n
+法施 3 n
+法无二门 3 nz
+法无可贷 3 i
+法旨 56 n
+法明长老 4 nr
+法晋唐 2 nr
+法服 3 n
+法朗 7 ns
+法朗士 6 ns
+法朗西一 3 nrt
+法术 79 n
+法权 134 n
+法杖 3 n
+法果 4 n
+法柜奇兵 3 n
+法案 507 n
+法桐 6 n
+法槌 3 n
+法比亚 3 ns
+法比奥 3 nr
+法比尤斯 2 ns
+法氏囊 3 nr
+法氏囊肽 3 n
+法沃尔斯 2 ns
+法治 529 n
+法治化 6 ns
+法洛斯 13 ns
+法洛氏 3 nr
+法测定 3 n
+法海 7 ns
+法海和尚 2 nr
+法海无边 3 nr
+法海鉴 2 nr
+法涵诗 3 nr
+法源寺 3 ns
+法灸神针 3 n
+法炼锌 4 nr
+法物 14 n
+法特 8 ns
+法王 789 nrt
+法王塔 3 nr
+法理 98 n
+法理学 75 nt
+法理情 3 n
+法琳 3 nrt
+法瑞尔 3 nr
+法瓦 5 ns
+法甲 5 ns
+法界 3 n
+法皇 4 n
+法皇之绿 3 nr
+法盲 7 n
+法相 41 n
+法相宗 22 nr
+法眼 34 n
+法眼宗 2 nr
+法祖 14 n
+法神 2 n
+法禁 3 n
+法科 3 ns
+法科大学 3 nt
+法穆索夫 3 ns
+法端 2 n
+法简政 2 nr
+法籍 10 n
+法系 3 n
+法约尔 6 ns
+法纪 51 n
+法线 45 n
+法绍达 7 nr
+法经义 2 n
+法统 62 n
+法网 48 n
+法网恢恢 3 nr
+法罗 11 ns
+法罗斯 8 ns
+法罗海 3 ns
+法罗群岛 20 ns
+法罗语 2 nz
+法老 123 n
+法老王 3 nr
+法考福 2 nr
+法者 15 n
+法联军 7 nt
+法脉准绳 3 nz
+法航 17 j
+法色 3 n
+法苑珠 3 nr
+法范畴 2 nr
+法莫替丁 3 nz
+法萨卢 2 ns
+法萨卢斯 2 ns
+法董源 2 nr
+法蒂玛 38 nr
+法螺 21 n
+法衣 9 n
+法袍 3 n
+法裔 6 n
+法裔瑞士 3 nr
+法西 11 ns
+法西斯 955 ns
+法西斯主 3 ns
+法西斯主义 82 nz
+法西斯党 3 ns
+法西斯化 5 ns
+法西斯蒂 3 nrt
+法规 9539 n
+法规处 5 b
+法规大典 3 b
+法规性 6 b
+法言 2 n
+法警 9 n
+法警队 3 nt
+法论功 3 n
+法语 522 nz
+法语区 3 n
+法语歌 3 n
+法语系 3 n
+法诺 2 ns
+法象 3 n
+法赫德 3 nr
+法赫萨 2 nr
+法赫鲁 5 nr
+法身 27 n
+法轮 15 n
+法轮关系 3 n
+法轮功 61 n
+法轮大法 3 nz
+法轮常转 3 n
+法达维 8 nr
+法郎 180 n
+法部 3 n
+法里斯 2 ns
+法金汉 7 nr
+法锰 3 nz
+法门 215 ns
+法门寺 19 ns
+法院 2312 n
+法院系统 3 n
+法院网 3 n
+法院院长 3 n
+法隆寺 4 ns
+法雅 12 ns
+法雅节 5 nr
+法雨 2 n
+法雷奥 3 nr
+法雷尔 8 nr
+法马古斯塔 2 nrt
+法魔 3 n
+法鲁克 16 ns
+法鼓山 3 ns
+法齐 3 ns
+泖 10 g
+泗 178 ns
+泗县 18 ns
+泗州 23 ns
+泗州城 5 ns
+泗州戏 3 n
+泗水 72 ns
+泗水县 2 ns
+泗河 16 ns
+泗洪 10 ns
+泗洪县 4 ns
+泗洲 3 ns
+泗阳 12 ns
+泗阳县 5 ns
+泚 66 zg
+泛 1131 v
+泛亚 4 ns
+泛光 3 v
+泛光灯 68 n
+泛光照明 3 nz
+泛关系 3 n
+泛出 3 v
+泛出来 3 v
+泛化 11 v
+泛北极 3 ns
+泛区 3 n
+泛同态 3 n
+泛太平洋 4 ns
+泛宅浮家 3 n
+泛应曲当 3 i
+泛心论 3 i
+泛性质 3 n
+泛指 179 j
+泛水 3 v
+泛池 3 n
+泛泛 111 d
+泛泛之交 12 l
+泛泛之人 3 l
+泛泛之谈 3 l
+泛泛之辈 3 l
+泛泛而谈 6 l
+泛洪 2 v
+泛浩摩苍 3 ns
+泛海 3 ns
+泛游 3 j
+泛湖 3 ns
+泛滥 492 v
+泛滥平原 3 i
+泛滥成灾 43 i
+泛灵论 3 i
+泛爱 3 v
+泛现 3 v
+泛珠三角 3 nz
+泛白 3 v
+泛神论 22 i
+泛称 89 v
+泛素 3 n
+泛红 3 v
+泛美 68 j
+泛美主义 4 nz
+泛美航空 3 j
+泛舟 56 nz
+泛萍浮梗 3 n
+泛覆叠群 3 i
+泛览 3 v
+泛论 3 v
+泛语虚辞 3 i
+泛读 19 v
+泛谈 3 v
+泛起 170 v
+泛酸 16 n
+泛阅 3 v
+泛非主义 3 nz
+泛音 30 n
+泛黄 23 j
+泝 3 zg
+泞 2 g
+泟 39 zg
+泠 60 zg
+泠嘲热讽 3 vn
+泠然 3 z
+泡 2347 v
+泡上 3 n
+泡分 3 n
+泡利方程 3 n
+泡制 7 n
+泡吧 3 n
+泡坛子 3 nz
+泡夫 3 n
+泡妞 18 n
+泡子 25 n
+泡帽塔 3 n
+泡开 3 v
+泡影 57 n
+泡打粉 3 n
+泡杯茶 3 n
+泡桐 59 n
+泡桐树 15 n
+泡水 3 n
+泡汤 54 n
+泡沫 616 n
+泡沫剂 3 n
+泡沫化 7 n
+泡沫塑料 28 nz
+泡沫式 2 n
+泡沫板 3 n
+泡沫水泥 3 n
+泡沫状 14 nz
+泡沫痰 7 v
+泡沫站 3 n
+泡沫红茶 3 n
+泡沫经济 23 n
+泡泡 74 n
+泡泡吧 3 n
+泡泡堂 3 n
+泡泡浴 3 n
+泡泡糖 3 n
+泡泡纱 2 n
+泡泡网 3 nz
+泡泡鱼 3 nz
+泡泡龙 3 nz
+泡洋塑胶 3 nz
+泡海 3 n
+泡浸 3 n
+泡温泉 3 nz
+泡澡 13 v
+泡点 3 n
+泡点曲线 3 n
+泡状 3 n
+泡疹 3 n
+泡病号 2 n
+泡绵 3 n
+泡网 4 n
+泡网吧 3 n
+泡罩塔 3 nz
+泡美眉 3 n
+泡腾片 3 n
+泡茶 85 n
+泡菜 34 n
+泡菜坛 3 n
+泡蘑菇 3 v
+泡货 3 n
+泡起 3 v
+泡起来 3 l
+泡透 3 nz
+泡那里 3 n
+泡酒 3 n
+泡酒吧 3 n
+泡钉 4 n
+泡面 3 n
+泡饭 23 n
+泡馍 37 nz
+泡马子 3 n
+波 3739 j
+波一波 10 nr
+波丁顿 3 ns
+波丝菊 3 nr
+波丽宝 3 nr
+波义耳 4 nr
+波亚尼 2 nr
+波亨斯 2 nr
+波仑亚 2 ns
+波伊尔 2 nr
+波伏娃 3 nr
+波伏瓦 30 nr
+波伦 2 ns
+波伦亚 9 ns
+波你尼 5 nr
+波依定 6 nr
+波光 55 nz
+波光潋滟 9 l
+波光粼粼 15 l
+波光荡漾 3 nr
+波光鳞鳞 3 nr
+波克堡 4 ns
+波克罗 3 nr
+波兰 1573 ns
+波兰人 49 nz
+波兰共和国 11 ns
+波兰政府 16 nt
+波兰文 2 nz
+波兰议会 4 nt
+波兰语 26 nz
+波兰队 3 nt
+波兹南 32 ns
+波凯尔 2 nr
+波函数 3 l
+波分 17 n
+波列夫 26 nr
+波列西 3 ns
+波利 87 ns
+波利亚 3 ns
+波利克 2 ns
+波利克拉 16 ns
+波利坎 8 nr
+波利尼 9 nr
+波利尼西亚 97 ns
+波利尼西亚人 61 nrt
+波利斯 18 ns
+波利普 2 nr
+波利格拉菲奇 6 nrt
+波利特 2 ns
+波利瓦 2 ns
+波利维亚 3 ns
+波利耶 6 nr
+波利萨 2 ns
+波利那 3 ns
+波前法 3 nr
+波力 9 n
+波动 999 vn
+波动力学 3 l
+波动声学 3 l
+波动性 55 n
+波勒 2 nz
+波包 3 n
+波卡尔 3 nr
+波卡拉 6 nrt
+波参数 3 n
+波及 282 ns
+波及面 7 n
+波司登 6 nr
+波吉欧 2 ns
+波吕斐 3 nr
+波吕葛 16 nr
+波呈峰 4 nr
+波哥大 27 ns
+波嘉尼 2 nr
+波因特 2 nr
+波国 3 ns
+波图利 2 ns
+波城 3 ns
+波塔斯 8 nr
+波塔陶 2 nr
+波塞 15 ns
+波塞东 6 ns
+波塞冬 13 nr
+波塞特 3 ns
+波士 3 ns
+波士顿 188 nr
+波士顿咨询公司 3 nt
+波士顿大学 17 nt
+波士顿市 2 ns
+波多 3 ns
+波多尔 4 nrt
+波多诺伏 18 nr
+波多黎各 92 ns
+波密 14 ns
+波密县 9 ns
+波导 71 vn
+波导开关 3 n
+波导波长 3 n
+波导窗 3 n
+波导管 11 n
+波导膜片 3 n
+波尔 48 ns
+波尔克 21 nr
+波尔兹曼 3 nrt
+波尔加 3 ns
+波尔半径 3 n
+波尔卡 25 ns
+波尔原子 3 ns
+波尔吉 2 nr
+波尔图 19 nr
+波尔塔 5 nrt
+波尔塔夫 2 nrt
+波尔塔瓦 8 nrt
+波尔塞 2 nr
+波尔多 102 ns
+波尔多市 12 ns
+波尔多液 3 nz
+波尔布 4 nr
+波尔效应 3 nz
+波尔查 8 nr
+波尔查诺 18 nrt
+波尔特 2 nrt
+波尔约 6 ns
+波尔舍 9 nrt
+波尔蒂 3 nr
+波尔金诺 2 nz
+波尔顿 2 ns
+波尔马 3 ns
+波尼拉 2 ns
+波属云委 3 nr
+波峰 42 ns
+波峰浪谷 4 ns
+波峰焊 3 nz
+波布兰 3 ns
+波希米亚 50 ns
+波希霞 3 nr
+波带片 5 n
+波幅 89 n
+波库斯 3 ns
+波弗特 6 nr
+波形 108 n
+波形发生器 2 l
+波形图 3 nr
+波形板 3 n
+波形瓦 3 ns
+波形蛋白 3 l
+波德 12 ns
+波德拉 3 nr
+波德曼 2 nr
+波德河 3 ns
+波德申 2 nr
+波德莱尔 21 nrt
+波德里亚 3 ns
+波心荡 2 i
+波恩 177 nr
+波恩大学 35 nt
+波恩市 4 ns
+波意耳 4 l
+波戈廷 4 nr
+波成东 2 nr
+波托 7 nrt
+波托西 5 ns
+波托马克河 8 ns
+波折 117 vn
+波折号 3 n
+波拉 5 ns
+波拉克 3 ns
+波拉尔 10 ns
+波拉尼 2 nr
+波拉斯 5 ns
+波拿巴 65 ns
+波拿文 5 nz
+波数 3 n
+波斯 1717 ns
+波斯基 2 nr
+波斯尼亚 90 ns
+波斯文 3 nz
+波斯湾 337 ns
+波斯湾地区 24 ns
+波斯特 2 nrt
+波斯猫 12 nz
+波斯王子 3 nr
+波斯纳 3 ns
+波斯菊 3 nr
+波斯语 100 nz
+波斯邸 3 nr
+波斯顿 3 ns
+波旁 65 nr
+波旁王朝 3 l
+波昂 3 ns
+波普尔 10 nr
+波普拉 3 nrt
+波月洞 4 nr
+波束 72 vn
+波束天线 3 n
+波束宽度 3 nr
+波束波导 3 n
+波束角 3 n
+波束调向 3 n
+波林 10 ns
+波模 3 n
+波段 386 n
+波比 5 ns
+波江座 4 nz
+波河 30 ns
+波河平原 3 ns
+波波 3 ns
+波波卡 2 nr
+波波卡特佩特 4 nrt
+波波夫 63 nr
+波波尔 3 nr
+波波波 6 nr
+波波碌碌 3 i
+波波维奇 21 nrt
+波洛克 10 ns
+波洛兹 3 nr
+波洛夫人 2 nrt
+波洛奈兹 6 ns
+波洛涅斯 2 nrt
+波流 2 vn
+波流茅靡 3 i
+波浪 337 nz
+波浪侵蚀 3 nz
+波浪发 3 nz
+波浪发电 3 nz
+波浪式 18 nz
+波浪形 21 n
+波浪滔天 3 i
+波浪滔滔 3 nr
+波浪状 8 nz
+波浪理论 3 n
+波浪翻滚 6 l
+波浪鼓 2 l
+波浴景 2 nr
+波海 21 ns
+波涛 227 nr
+波涛汹涌 61 i
+波涛滚滚 3 l
+波涛起伏 3 l
+波湾 3 ns
+波湾战争 3 nz
+波源 12 n
+波澜 134 nz
+波澜万丈 3 i
+波澜不惊 27 l
+波澜壮阔 93 i
+波澜老成 3 l
+波澜起伏 3 l
+波爱修 2 nr
+波特 59 ns
+波特兰 32 ns
+波特利 2 ns
+波特尔 11 nr
+波特曼 7 nr
+波特率 2 nz
+波特锡 3 ns
+波状 3 nz
+波状云 4 nr
+波状热 3 l
+波状纹 2 nr
+波状钢 3 nr
+波瓣 3 n
+波瓦 2 ns
+波痕 7 n
+波矢量 3 i
+波碧草 6 nr
+波福尔 2 nr
+波立特 2 nr
+波立维 2 nr
+波箱 3 n
+波粒二象性 42 nz
+波级 3 vn
+波纳 2 ns
+波纳佩 7 nr
+波纳契 2 nr
+波纳尔 4 nr
+波纳尼夫 3 ns
+波纹 63 n
+波纹喇叭 3 n
+波纹塔板 3 nz
+波纹管 2 n
+波纹纸 3 n
+波罗 390 ns
+波罗僧 4 nr
+波罗地 4 ns
+波罗地海 3 ns
+波罗塞戏 3 nz
+波罗奈 5 nr
+波罗奖 4 nz
+波罗奢花 3 i
+波罗尼 8 nr
+波罗星 84 nr
+波罗的海 491 ns
+波罗的海地区 10 ns
+波罗维 4 nr
+波罗芬 6 nr
+波罗花 2 ns
+波罗蜜 47 nr
+波美 10 ns
+波美拉 4 ns
+波耶娃 2 nr
+波腹 3 n
+波节 3 vn
+波苏瓦柳克 4 ns
+波茨 3 nrt
+波茨坦 137 ns
+波茨坦广场 23 ns
+波荡 3 vn
+波莫瑞 5 nr
+波莱尔 9 nr
+波莱罗 2 nr
+波菲利 2 nr
+波萝 3 n
+波萨里 2 ns
+波蕾若 2 nr
+波西 17 ns
+波西奥 2 nr
+波诡云 6 nr
+波诺夫 2 nr
+波谱 36 n
+波谷 14 ns
+波赛东 2 nr
+波跃浪 2 nz
+波路壮阔 3 nr
+波轮 7 nz
+波轮式 3 n
+波通社 2 nt
+波速 56 n
+波里 43 ns
+波里德 16 nrt
+波长 661 n
+波阳 13 ns
+波阳县 5 ns
+波阵面 3 l
+波阻抗 3 nz
+波阿斯 5 nr
+波隆纳 2 nr
+波雅尔 7 nr
+波霸女 3 nr
+波面 3 n
+波鞋 3 n
+波音 363 n
+波音公司 182 nt
+波音喷射 3 l
+波顿 3 ns
+波香露 4 nr
+波马雷 2 nr
+波骇云属 3 i
+波黑 152 ns
+波黑共和国 3 ns
+波黑塞尔维亚共和国 2 ns
+波齐 4 ns
+泣 342 ng
+泣下如雨 3 i
+泣下沾襟 3 i
+泣不可仰 3 v
+泣不成声 108 i
+泣别 3 v
+泣数行下 3 i
+泣涕 3 v
+泣涕如雨 3 i
+泣然 3 v
+泣红亭 3 n
+泣血 32 v
+泣血捶膺 3 i
+泣血枕戈 3 i
+泣血椎心 3 n
+泣诉 6 v
+泣鬼神 11 i
+泣麟悲凤 3 i
+泤 10 zg
+泥 4354 n
+泥中隐刺 3 l
+泥丸 22 n
+泥人 97 n
+泥人儿 21 n
+泥人张 3 n
+泥俑 3 n
+泥像 3 n
+泥匠 3 n
+泥古 3 t
+泥古不化 4 l
+泥古拘方 3 i
+泥古非今 3 l
+泥名失实 3 i
+泥土 587 n
+泥土墙 3 n
+泥土路 3 n
+泥土面 3 n
+泥坑 26 n
+泥块 23 n
+泥坨子 3 n
+泥坯 3 n
+泥垢 14 n
+泥城 3 n
+泥塑 135 n
+泥塑像 3 n
+泥塑木雕 23 n
+泥塘 26 n
+泥墙 20 n
+泥壁 3 n
+泥多佛大 3 ns
+泥娃娃 3 n
+泥子 3 n
+泥封 11 n
+泥屋 3 n
+泥岩 51 n
+泥工 3 n
+泥巴 105 n
+泥巴库 3 n
+泥巴路 3 n
+泥板 46 n
+泥桨 3 n
+泥水 101 n
+泥水匠 19 n
+泥水工 3 n
+泥水师 3 n
+泥污 52 n
+泥沙 658 n
+泥沙俱下 14 i
+泥沙运动 3 n
+泥河 5 n
+泥河镇 2 ns
+泥沼 58 n
+泥泞 182 n
+泥泞不堪 3 v
+泥流 3 n
+泥浆 143 n
+泥浆味 3 n
+泥浆池 4 n
+泥浆波 3 n
+泥浆泵 3 n
+泥浆流 3 n
+泥浆罐 3 n
+泥淖 36 n
+泥湿 3 n
+泥滓 3 n
+泥滩 19 n
+泥漠 3 n
+泥潦 3 i
+泥潭 67 n
+泥火山 8 n
+泥火山气 3 n
+泥灰 3 n
+泥灰岩 275 n
+泥炭 170 n
+泥炭全肥 3 n
+泥炭土 6 n
+泥点 2 n
+泥煤 14 n
+泥牛 3 n
+泥牛入海 10 i
+泥猪瓦狗 3 n
+泥猪疥狗 3 i
+泥猪癞狗 3 v
+泥猴 3 n
+泥玩么 3 v
+泥球 3 n
+泥瓦 2 n
+泥瓦匠 22 n
+泥瓦浆 3 n
+泥疗 3 n
+泥疗法 3 n
+泥盆纪 75 t
+泥石 15 n
+泥石流 173 n
+泥砂 3 n
+泥砖 3 n
+泥而不滓 3 n
+泥肥 3 n
+泥胎 17 n
+泥脚 3 n
+泥腿 3 n
+泥腿子 16 n
+泥船渡河 3 n
+泥菩萨 16 n
+泥菩萨过江 5 n
+泥螺 13 n
+泥质指示 3 n
+泥足巨人 2 n
+泥路 4 n
+泥车瓦马 3 n
+泥醉 2 v
+泥金 39 n
+泥金万点 3 n
+泥雕 2 n
+泥雨 3 n
+泥面膜 3 n
+泥饭碗 5 n
+泥鳅 354 n
+泥龟 3 n
+泦 112 zg
+泧 32 zg
+注 2820 v
+注上 3 v
+注会 3 v
+注入 1564 v
+注入式 10 n
+注入流体 3 n
+注册 1431 v
+注册主任 3 n
+注册人数 3 n
+注册号 13 n
+注册名 2 n
+注册商标 3 n
+注册器 3 n
+注册地 15 n
+注册处 3 n
+注册手续 3 n
+注册机 3 n
+注册机构 6 n
+注册版 3 n
+注册码 3 n
+注册组 3 n
+注册表 33 n
+注册证 15 n
+注册费 8 n
+注册资本 3 n
+注册资金 3 n
+注册软件 3 n
+注册量 3 n
+注册项 3 n
+注到 3 v
+注发 3 v
+注塑 13 v
+注塑件 3 n
+注塑机 3 n
+注塑模 3 n
+注塑级 3 n
+注失 3 v
+注子 3 n
+注定 691 v
+注射 725 v
+注射剂 70 n
+注射器 43 n
+注射机 6 n
+注射法 3 n
+注射液 56 n
+注射用 3 n
+注射筒 3 n
+注射费 2 n
+注射针 3 n
+注心 3 v
+注意 9876 v
+注意事项 3 n
+注意分配 3 v
+注意力 678 n
+注意安全 3 nz
+注意广度 3 n
+注意转移 3 v
+注意障碍 3 n
+注慕 3 v
+注文 79 v
+注明 331 v
+注有 3 v
+注标 3 v
+注气剖面 3 n
+注气模块 3 n
+注水 118 v
+注水压差 3 n
+注水周期 3 n
+注水巷道 3 n
+注水方式 3 n
+注水泵 3 n
+注水肉 3 n
+注油 3 n
+注油孔 3 n
+注浆 8 n
+注消 3 v
+注满 3 v
+注玄尚白 3 n
+注生娘娘 3 n
+注疏 55 n
+注目 222 n
+注目礼 15 n
+注脚 37 v
+注色 3 n
+注视 1051 v
+注视点 3 n
+注视者 3 n
+注解 183 v
+注译 3 v
+注资 39 v
+注采比 3 n
+注释 551 v
+注重 2916 v
+注重事实 3 n
+注重实效 3 n
+注重质量 3 n
+注销 80 v
+注音 42 n
+注音字母 20 n
+注音版 3 n
+注音符号 3 n
+泩 3 zg
+泪 1970 n
+泪下沾襟 3 i
+泪人 22 n
+泪人儿 13 n
+泪光 91 n
+泪千行 3 i
+泪器 3 n
+泪如泉涌 42 i
+泪如泉滴 3 i
+泪如雨下 67 l
+泪容满面 3 l
+泪干肠断 3 l
+泪桥 3 n
+泪水 1335 n
+泪水汪汪 3 i
+泪水直流 3 i
+泪汪汪 87 z
+泪泉 7 n
+泪流 3 n
+泪流满面 158 l
+泪浸 3 n
+泪涔涔 5 z
+泪涟涟 4 z
+泪液 35 n
+泪滴 14 n
+泪珠 240 n
+泪珠儿 24 n
+泪珠子 21 n
+泪痕 172 n
+泪痕斑斑 3 l
+泪盈盈 6 l
+泪眼 130 n
+泪眼愁眉 3 l
+泪眼汪汪 3 i
+泪管 3 n
+泪腺 26 n
+泪腺炎 3 n
+泪膜 2 n
+泪色 3 n
+泪花 207 n
+泪迸肠绝 3 nr
+泪道 3 n
+泪雨 3 n
+泫 27 zg
+泫然欲泪 3 nr
+泫然泪下 3 n
+泬 2 zg
+泭 21 zg
+泮 14 nr
+泮林革音 3 nz
+泮汤温泉 3 nr
+泯 89 vg
+泯没 3 v
+泯灭 56 v
+泰 1317 ns
+泰亦赤 9 nr
+泰伦斯 3 nr
+泰伯 12 ns
+泰克 4 nz
+泰克毕 3 nr
+泰兴 31 ns
+泰兴县 6 ns
+泰兴市 7 ns
+泰利 3 ns
+泰利必 2 nr
+泰利思 8 nr
+泰利斯 139 ns
+泰利特 4 nr
+泰加 4 ns
+泰加林 8 ns
+泰勒 197 nr
+泰勒展 3 nr
+泰勒斯 35 nr
+泰勒柱 4 nr
+泰勒阿 4 nr
+泰北 5 ns
+泰半 3 nr
+泰华 13 nz
+泰博华 2 nr
+泰卡鸡 3 ns
+泰卢固 13 nr
+泰县 11 ns
+泰和 79 nz
+泰和县 3 ns
+泰国 1492 ns
+泰国人 10 nr
+泰国人妖 3 n
+泰国拳 3 nr
+泰国政府 12 nt
+泰国武装部队 4 nt
+泰国浴 3 nr
+泰国游 3 nr
+泰国菜 3 nr
+泰国话 3 nr
+泰国铢 2 nr
+泰国队 2 nt
+泰坦 3 ns
+泰坦尼克 13 ns
+泰坦尼克号 39 nz
+泰坦战衣 3 nz
+泰夏安 6 nz
+泰夫姆 5 nr
+泰奥弗 6 nr
+泰奥蒂 8 nr
+泰姆奈 6 nr
+泰始 39 nz
+泰姬陵 17 nr
+泰宁 22 ns
+泰宁县 2 ns
+泰安 103 ns
+泰安县 3 ns
+泰安市 26 ns
+泰安市委 2 nt
+泰定 20 ns
+泰定帝 34 nr
+泰富 10 nz
+泰尔 5 nr
+泰尼奥 5 nr
+泰山 776 ns
+泰山乡 3 ns
+泰山其颓 3 nr
+泰山北斗 28 nr
+泰山区 10 ns
+泰山压卵 3 n
+泰山压顶 13 n
+泰山庙 3 ns
+泰山梁木 3 ns
+泰山盘石 3 ns
+泰山移 3 nr
+泰山路 2 ns
+泰山队 176 nz
+泰山鸿毛 3 nr
+泰州 268 ns
+泰州市 59 ns
+泰币 18 n
+泰康人寿 3 ns
+泰康路 3 nz
+泰康镇 2 nr
+泰式 20 nz
+泰得 3 nrt
+泰德峰 2 nr
+泰戈尔 46 nr
+泰拉 5 nrt
+泰拉斯 2 ns
+泰拳 7 nz
+泰文 6 nz
+泰斗 35 nr
+泰斯 5 ns
+泰族 3 nz
+泰昌 7 ns
+泰晤士 9 ns
+泰晤士报 140 nt
+泰晤士河 54 ns
+泰晤士河畔 2 ns
+泰来 390 ns
+泰来县 2 ns
+泰来否往 3 i
+泰来否极 3 i
+泰极而否 3 i
+泰格斯 3 nr
+泰梅尔 18 nr
+泰比 6 nrt
+泰水 3 ns
+泰洛其 2 ns
+泰然 32 z
+泰然处之 25 i
+泰然族 3 nz
+泰然自若 50 i
+泰然若定 3 i
+泰特 16 nrt
+泰王 3 nrt
+泰王国 11 ns
+泰穆尔 2 nr
+泰米尔 33 nr
+泰米尔伊拉姆 2 nrt
+泰米尔猛虎组织 2 l
+泰米尔纳德邦 14 ns
+泰米尔语 12 nz
+泰纳 14 ns
+泰纳尔 2 nr
+泰纳线 3 nr
+泰维安 2 nr
+泰罗 4 nrt
+泰罗斯 4 ns
+泰耶尔 2 nr
+泰莱达 2 nr
+泰西 8 ns
+泰西封 15 ns
+泰语 113 nz
+泰达 107 nz
+泰达开发区 4 nz
+泰达队 17 nz
+泰迪熊 40 nr
+泰迪罗宾 3 ns
+泰铢 49 nr
+泰镇抚 3 nr
+泰阳 4 ns
+泰阿 4 ns
+泰阿剑 10 nr
+泰陵 11 ns
+泰雅 3 ns
+泰雅族 2 nz
+泰顺 5 nz
+泰顺县 3 ns
+泰顺街 3 nr
+泱 10 i
+泱泱 13 z
+泱泱大国 18 i
+泱泱大风 3 i
+泲 28 zg
+泳 130 vg
+泳动电势 3 n
+泳协 2 n
+泳员 3 n
+泳场 2 n
+泳坛 16 n
+泳将 3 n
+泳帽 3 n
+泳池 24 n
+泳程 3 n
+泳联 31 n
+泳衣 13 n
+泳衣秀 3 n
+泳装 69 n
+泳装秀 3 n
+泳裤 3 n
+泳道 7 n
+泴 3 zg
+泵 311 zg
+泵业 3 n
+泵体 3 n
+泵入 3 n
+泵冲速 3 n
+泵房 6 n
+泵油 3 n
+泵站 41 n
+泵管 3 n
+泵车 2 n
+泵送 3 nz
+泵送性 3 n
+泵阀网 3 vn
+泶 27 zg
+泷 27 zg
+泷泽秀明 3 ns
+泸 36 ns
+泸县 7 ns
+泸天化 12 ns
+泸定 22 ns
+泸定县 3 ns
+泸定桥 22 ns
+泸州 165 ns
+泸州大曲 3 ns
+泸州市 16 ns
+泸水 37 ns
+泸水县 7 ns
+泸沟桥 3 ns
+泸沽湖 17 ns
+泸溪 6 ns
+泸溪县 3 ns
+泸西 4 ns
+泸西县 2 ns
+泺 33 zg
+泻 476 v
+泻下 42 n
+泻下剂 7 n
+泻下去 3 v
+泻下来 3 v
+泻出 3 v
+泻出去 3 v
+泻出来 3 v
+泻到 3 v
+泻剂 3 n
+泻劲 3 v
+泻地 3 n
+泻得 3 v
+泻心汤 4 n
+泻气 3 n
+泻法 3 n
+泻流 3 n
+泻湖 16 n
+泻火 20 n
+泻珠溅玉 3 nz
+泻盐 3 n
+泻究 3 v
+泻肚 5 n
+泻肚子 3 n
+泻药 40 n
+泼 923 v
+泼上去 3 t
+泼上来 3 t
+泼下 3 t
+泼下去 3 t
+泼下来 3 t
+泼冷水 23 n
+泼出 3 v
+泼出去 3 v
+泼出来 3 v
+泼到 3 v
+泼剌 8 o
+泼去 3 t
+泼墨 58 n
+泼墨山水 3 i
+泼墨画 3 n
+泼大粪 3 n
+泼天大祸 3 i
+泼妇 73 n
+泼妇骂街 3 n
+泼尼松 3 n
+泼成 3 v
+泼掉 3 v
+泼水 3 n
+泼水节 50 t
+泼水难收 3 i
+泼油救火 3 n
+泼洒 29 a
+泼皮 93 n
+泼粪 3 n
+泼辣 128 a
+泼辣辣 3 n
+泼进 3 v
+泼进去 3 v
+泼进来 3 v
+泼陂河镇 3 ns
+泽 645 nr
+泽之谊 2 nr
+泽仁桑珠 4 nr
+泽侯田 7 nr
+泽侯金 2 nr
+泽克特 2 nr
+泽兰 11 nr
+泽列诺 3 nr
+泽及 3 ns
+泽及后人 3 nr
+泽及枯骨 3 n
+泽吻磨牙 3 n
+泽国 25 ns
+泽地 3 n
+泽塔 6 nrt
+泽尔士 2 nr
+泽尔斯基 5 nrt
+泽州 30 ns
+泽州县 4 ns
+泽库 3 nr
+泽库县 9 ns
+泽当 16 nrt
+泽当镇 3 nrt
+泽思巴 7 nr
+泽拉夫 9 nr
+泽斯 23 nrt
+泽旺子 2 nr
+泽普 3 nr
+泽普县 3 nr
+泽望兄 2 nr
+泽比纳 2 nr
+泽泻 28 n
+泽深恩重 3 nr
+泽漆 2 n
+泽特贝尔 2 nrt
+泽登巴尔 3 nrt
+泽祖鲁 2 nr
+泽纳维 3 nr
+泽维尔 2 nr
+泽罗伯 3 nr
+泽罗斯 4 nr
+泽被 3 n
+泽被后世 3 nr
+泽西 3 nrt
+泽西岛 2 ns
+泽金从 2 nr
+泽镇开 2 nr
+泽鲁阿勒 11 nrt
+泾 198 zg
+泾县 37 ns
+泾川 10 ns
+泾川县 2 ns
+泾水 12 ns
+泾河 58 ns
+泾河乡 3 ns
+泾浊渭清 3 i
+泾清渭浊 3 i
+泾清溩 3 ns
+泾渭 3 ns
+泾渭不分 3 i
+泾渭分明 32 i
+泾渭自分 3 i
+泾渭自明 3 i
+泾源 6 ns
+泾源县 4 ns
+泾阳 14 ns
+泾阳县 4 ns
+洀 15 zg
+洁 361 ag
+洁具 5 n
+洁具厂 3 n
+洁净 260 z
+洁净台 3 nz
+洁净室 3 nz
+洁净度 6 n
+洁净煤 3 nz
+洁净车间 3 n
+洁利 3 nz
+洁厕剂 3 n
+洁尔阴 3 nz
+洁己从公 3 i
+洁己奉公 3 i
+洁己爱人 3 i
+洁操 3 n
+洁柔 3 a
+洁治器 3 nz
+洁治术 3 n
+洁浊扬清 3 i
+洁清自矢 3 i
+洁牙 3 nz
+洁癖 23 n
+洁白 401 z
+洁白如玉 3 i
+洁白无暇 3 i
+洁白无瑕 3 i
+洁白无疵 3 i
+洁肤 13 n
+洁肤乳 3 nz
+洁肤水 3 nz
+洁身 17 n
+洁身累行 3 i
+洁身自好 45 i
+洁身自守 3 i
+洁身自律 3 i
+洁身自爱 10 i
+洁霉素 3 n
+洁静 2 a
+洁面乳 2 nz
+洁面霜 3 nz
+洂 2 zg
+洃 15 zg
+洄 274 g
+洄游 115 v
+洅 4 zg
+洇 13 v
+洇湿 3 nr
+洈 10 zg
+洈水 3 vn
+洉 3 zg
+洊 23 zg
+洋 1634 ag
+洋专家 3 n
+洋中 24 s
+洋中前村 3 ns
+洋中里 3 s
+洋为中用 6 l
+洋井 3 n
+洋人 657 n
+洋人街 3 ns
+洋伞 3 n
+洋八股 3 n
+洋兰 3 ns
+洋兵 3 n
+洋务 262 n
+洋务局 3 n
+洋务派 94 n
+洋务运动 3 n
+洋化 2 n
+洋华堂 3 n
+洋县 16 ns
+洋参 6 n
+洋参丸 3 n
+洋味 3 n
+洋品牌 3 n
+洋商 3 n
+洋嗓子 3 n
+洋囡囡 3 n
+洋地黄 20 j
+洋地黄叶 3 n
+洋场 3 n
+洋垃圾 3 n
+洋基 3 n
+洋基队 3 n
+洋墨水 3 n
+洋头口 3 n
+洋头尾 3 i
+洋女婿 3 n
+洋奴 6 n
+洋奴哲学 3 vn
+洋妞 3 n
+洋姜 2 n
+洋娃娃 27 n
+洋媳妇 2 n
+洋山港 3 ns
+洋山芋 3 n
+洋布 29 n
+洋帅 6 n
+洋庄 12 ns
+洋底 109 n
+洋式 3 n
+洋快餐 7 n
+洋思 6 n
+洋房 84 n
+洋教 27 n
+洋文 22 n
+洋文书 3 n
+洋文凭 3 n
+洋服 4 n
+洋李 3 n
+洋枪 180 n
+洋枪洋炮 3 n
+洋枪队 12 n
+洋柿子 3 v
+洋桃 3 n
+洋桥 7 n
+洋楼 167 n
+洋槐 19 n
+洋模特 3 n
+洋橄榄 3 n
+洋毫 3 n
+洋气 21 n
+洋气十足 3 i
+洋水 3 n
+洋水果 3 n
+洋河 20 ns
+洋油 12 n
+洋法生产 3 n
+洋泾浜 13 ns
+洋泾滨 3 ns
+洋洋 54 ns
+洋洋万言 2 i
+洋洋不睬 3 i
+洋洋大观 12 n
+洋洋得意 62 i
+洋洋洒洒 32 z
+洋洋盈耳 3 n
+洋洋纚纚 3 z
+洋洋自得 41 i
+洋流 150 n
+洋浦 13 ns
+洋浦港 6 ns
+洋海啸 3 n
+洋溢 263 v
+洋溢着 3 l
+洋火 14 n
+洋灰 16 n
+洋炮 3 n
+洋烟 12 n
+洋片 11 n
+洋琴 6 n
+洋瓷 3 n
+洋甘菊 3 n
+洋白菜 5 n
+洋盆 3 n
+洋盘 3 n
+洋相 32 n
+洋相尽出 3 i
+洋相百出 3 i
+洋码子 3 n
+洋碱 3 n
+洋粉 2 n
+洋红 8 n
+洋红色 2 n
+洋纱 6 n
+洋绣球 4 n
+洋缎 3 n
+洋罪 3 n
+洋腔 5 n
+洋船 3 n
+洋芋 799 n
+洋芋片 3 z
+洋荤 4 n
+洋药 3 n
+洋莓 3 n
+洋菇 3 n
+洋菇菌 3 n
+洋菜 3 n
+洋菜胶 3 n
+洋菸 3 z
+洋葱 95 n
+洋葱味 3 i
+洋葱头 4 i
+洋蓟 3 n
+洋行 381 n
+洋裁 3 n
+洋装 13 n
+洋话 11 n
+洋财 4 n
+洋货 108 n
+洋车 41 n
+洋车夫 2 n
+洋迷 3 n
+洋酒 46 n
+洋里洋气 3 n
+洋金花 3 n
+洋钉 3 n
+洋钱 47 n
+洋铁 25 n
+洋银 3 n
+洋镐 3 n
+洋面 87 n
+洋风 3 n
+洋香瓜 3 n
+洋鬼子 79 n
+洋麻 3 n
+洌 130 g
+洍 2 zg
+洎 3 g
+洏 32 zg
+洑 15 zg
+洒 1030 v
+洒下 3 v
+洒下去 3 l
+洒下来 3 l
+洒出 3 v
+洒向 3 v
+洒家 56 r
+洒得 3 v
+洒心更始 3 l
+洒扫 29 v
+洒扫应对 3 l
+洒水 8 v
+洒水扫地 3 l
+洒水机 3 l
+洒水礼 3 l
+洒水车 3 l
+洒泪 52 v
+洒洒 3 a
+洒洒潇潇 3 z
+洒满 26 a
+洒热血 13 l
+洒狗血 3 l
+洒瓮 3 n
+洒红节 21 l
+洒脱 148 v
+洒脱不拘 3 v
+洒药 3 v
+洒落 39 v
+洒透 3 v
+洒遍 4 a
+洓 171 zg
+洖 216 zg
+洗 3202 v
+洗三 3 nz
+洗上 3 v
+洗上去 3 v
+洗上来 3 v
+洗下 3 v
+洗下去 3 v
+洗下来 3 l
+洗不掉 3 v
+洗不清 3 l
+洗了睡 3 l
+洗井 3 n
+洗光 3 nz
+洗兵牧马 3 nz
+洗冤 14 v
+洗冤录 3 i
+洗净 227 v
+洗净度 3 n
+洗出 3 v
+洗出去 3 v
+洗出来 3 v
+洗到 3 v
+洗刷 118 v
+洗刷耻辱 3 n
+洗剂 10 nz
+洗削更革 3 nz
+洗前 3 v
+洗劫 238 v
+洗劫一空 18 i
+洗印 13 v
+洗去 3 v
+洗反 3 v
+洗发 3 v
+洗发剂 5 nz
+洗发水 28 nz
+洗发液 3 nz
+洗发精 6 nz
+洗发膏 3 nz
+洗发露 3 nz
+洗口 3 n
+洗地 3 n
+洗地机 3 nz
+洗地板 3 nz
+洗垢匿暇 3 i
+洗垢匿瑕 3 i
+洗垢求瑕 3 i
+洗城 3 n
+洗头 91 v
+洗头发 3 i
+洗头妹 3 n
+洗头房 3 n
+洗头水 3 n
+洗头膏 2 i
+洗好 3 v
+洗完 3 v
+洗尘 39 n
+洗尽铅华 3 l
+洗底 3 v
+洗得 3 v
+洗心 3 v
+洗心回面 3 l
+洗心换骨 3 i
+洗心涤虑 3 i
+洗心自新 3 i
+洗心革意 3 l
+洗心革面 20 n
+洗成 3 v
+洗手 238 v
+洗手不干 19 l
+洗手台 2 nz
+洗手奉公 3 i
+洗手奉职 3 i
+洗手池 2 nz
+洗手液 3 nz
+洗手盆 2 nz
+洗手袋 3 nz
+洗手间 105 n
+洗掉 3 v
+洗擦 3 v
+洗断 3 v
+洗来 3 v
+洗来洗去 3 l
+洗染 3 v
+洗染店 2 n
+洗池 3 n
+洗池台 3 n
+洗法 3 n
+洗洁 4 a
+洗洁精 11 nz
+洗洗 80 v
+洗洗弄弄 3 i
+洗洗涮涮 6 v
+洗洗澡 2 v
+洗洗脚 3 n
+洗流 3 n
+洗浴 88 v
+洗浴城 3 nz
+洗消 30 v
+洗消剂 3 n
+洗涤 183 v
+洗涤剂 68 nz
+洗涤器 3 n
+洗涤液 4 n
+洗涤灵 3 n
+洗涤碱 3 n
+洗涮 10 v
+洗液 29 n
+洗清 3 v
+洗漱 103 v
+洗漱间 5 n
+洗澡 414 v
+洗澡图 3 nz
+洗澡房 3 n
+洗澡时 3 n
+洗澡水 13 nz
+洗澡盆 5 nz
+洗澡间 13 n
+洗濯 12 v
+洗炼 11 v
+洗烫 4 v
+洗煤 7 v
+洗煤厂 3 n
+洗照片 3 n
+洗熨 3 n
+洗版 3 v
+洗牌 61 v
+洗物槽 3 n
+洗理费 3 n
+洗盘 13 v
+洗眉刷目 3 n
+洗眼 3 v
+洗眼器 3 l
+洗碗 3 n
+洗碗工 2 n
+洗碗机 4 nz
+洗碗池 3 n
+洗碗盘 3 n
+洗礼 428 nz
+洗米 3 n
+洗米水 3 nz
+洗精煤 6 n
+洗练 46 v
+洗罪 3 v
+洗耳 3 n
+洗耳恭听 39 i
+洗耳拱听 3 i
+洗耳静听 3 i
+洗肠 8 n
+洗肠涤胃 3 n
+洗胃 70 v
+洗脑 3 n
+洗脑术 3 n
+洗脚 3 v
+洗脚上船 3 l
+洗脚城 3 n
+洗脚水 3 n
+洗脱 17 v
+洗脱序 3 i
+洗脸 262 v
+洗脸水 3 n
+洗脸池 2 l
+洗脸盆 14 l
+洗脸间 3 n
+洗舱 2 n
+洗舱机 3 vn
+洗荡 12 v
+洗菜 3 n
+洗衣 202 n
+洗衣匠 3 n
+洗衣商 3 n
+洗衣女工 3 n
+洗衣室 3 n
+洗衣工 3 n
+洗衣店 8 n
+洗衣房 9 n
+洗衣所 3 n
+洗衣日 3 n
+洗衣服 3 n
+洗衣机 203 n
+洗衣板 6 n
+洗衣歌 3 n
+洗衣盆 3 n
+洗衣社 2 n
+洗衣粉 77 n
+洗衣粉厂 3 n
+洗衣袋 3 n
+洗衣费 3 n
+洗起 3 v
+洗起来 3 v
+洗身 3 v
+洗车 3 n
+洗车场 3 n
+洗车机 3 n
+洗车液 3 n
+洗车点 3 n
+洗车行 3 n
+洗过 3 v
+洗过去 3 l
+洗过来 3 l
+洗过澡 3 v
+洗选 4 v
+洗透 3 nz
+洗钱 121 v
+洗钱罪 3 i
+洗锅刷碗 3 n
+洗雪 42 n
+洗雪逋负 3 vn
+洗面 3 n
+洗面乳 31 nz
+洗面器 3 nz
+洗面奶 15 nz
+洗面盆 3 n
+洗髓伐毛 3 n
+洗麦 3 n
+洘 3 zg
+洙 10 g
+洛 1059 ns
+洛东 4 ns
+洛丽塔 3 nr
+洛亚蒂 3 nr
+洛仑兹 25 ns
+洛伊 3 nrt
+洛伊卡 2 nrt
+洛伊城 4 ns
+洛伊特 2 nrt
+洛伊罗 4 nrt
+洛伐他汀 2 ns
+洛伦 2 ns
+洛伦佐 14 nr
+洛伦兹 110 ns
+洛伦索 7 ns
+洛伦茨 15 nrt
+洛佩兹 3 nr
+洛佩斯 31 nr
+洛依卡 3 nr
+洛依言 2 nr
+洛修斯 2 nr
+洛克 93 ns
+洛克人 3 nrt
+洛克先生 5 nr
+洛克希 2 nr
+洛克希德 215 nrt
+洛克斐勒 3 nrt
+洛克比 24 nrt
+洛克纳 2 nr
+洛克耶 2 nr
+洛克色 16 nr
+洛克菲勒 70 nrt
+洛克里 64 nrt
+洛克齐 2 nr
+洛入河 2 nr
+洛兰 9 ns
+洛兹 2 ns
+洛加尼斯 6 ns
+洛加文 3 nr
+洛劳斯 96 nrt
+洛勒斯 2 ns
+洛南 17 ns
+洛南县 5 ns
+洛博夫 13 nr
+洛博斯 4 ns
+洛卡泰 2 nr
+洛厄尔 5 nrt
+洛双掌 3 nr
+洛口仓 4 ns
+洛古河 4 ns
+洛可可 3 nr
+洛可可式 3 nr
+洛喜密 2 nr
+洛图科 2 nr
+洛城 3 ns
+洛基 5 nrt
+洛基尔 3 nr
+洛塔 4 nrt
+洛墨达 2 nr
+洛夫 52 nrt
+洛夫娜 3 nr
+洛夫斯 10 nrt
+洛夫斯基 5 nrt
+洛夫格 3 nrt
+洛夫蒂 2 nr
+洛奇 7 nrt
+洛威尔 10 nr
+洛子峰 4 nr
+洛学 3 nrt
+洛宁 61 ns
+洛宁县 9 ns
+洛宁用 2 ns
+洛客班 3 nr
+洛尔 21 ns
+洛尔卡 2 nrt
+洛尔科 2 nrt
+洛尼 4 nrt
+洛山基 3 ns
+洛川 70 ns
+洛川县 9 ns
+洛布 5 nrt
+洛希 16 nrt
+洛希尔 3 nr
+洛带镇 3 nr
+洛德 7 nrt
+洛必达 14 nr
+洛惠渠 7 nr
+洛扎 3 nrt
+洛扎县 3 ns
+洛扎诺 4 nr
+洛拉尔 8 ns
+洛提尔 2 nr
+洛斯 15 ns
+洛斯特 2 nrt
+洛斯阿 2 ns
+洛斯阿拉莫斯 4 nrt
+洛朗 5 ns
+洛朗级数 3 nz
+洛本古 4 ns
+洛杉机 3 nr
+洛杉矶 488 ns
+洛杉矶国际机场 2 nt
+洛杉矶市 11 ns
+洛林 105 ns
+洛根 2 ns
+洛格伦 3 nr
+洛桑 314 nrt
+洛桑久美 2 ns
+洛桑图旦 3 ns
+洛桑达瓦 9 ns
+洛水 61 ns
+洛水之 3 nr
+洛水北 2 ns
+洛水村 3 ns
+洛汀新 3 ns
+洛江区 3 ns
+洛河 49 ns
+洛法河 2 ns
+洛波 3 ns
+洛泰尔 3 nr
+洛泽 2 ns
+洛泽尔 2 nr
+洛泽河 2 ns
+洛浦 4 ns
+洛浦之 2 nr
+洛浦县 2 ns
+洛清汴 2 nr
+洛溪 4 ns
+洛特 4 nrt
+洛特雷 2 nr
+洛瓦 3 ns
+洛矶 3 ns
+洛矶山 3 ns
+洛社镇 3 ns
+洛神 22 nr
+洛神凌 2 nr
+洛神微 2 nr
+洛神赋 21 nr
+洛秀眉 2 nr
+洛科贾 2 nr
+洛继统 16 nr
+洛维夫人 2 nrt
+洛维奇 15 nr
+洛美 30 ns
+洛美协定 6 nz
+洛美沙星 3 ns
+洛色林 3 ns
+洛花 3 ns
+洛茨 5 nrt
+洛茨基 3 nrt
+洛莫诺 6 nrt
+洛莱斯 2 nr
+洛蒂 3 nrt
+洛衫矶 2 nr
+洛豪德 5 nr
+洛贝林 2 nr
+洛贡河 7 ns
+洛赛克 2 nrt
+洛赫 2 nrt
+洛赫之 2 nr
+洛赫逊 3 nr
+洛辛堡 4 ns
+洛迦诺 33 nr
+洛迪诺 4 nr
+洛邑曾 3 nr
+洛邦特 2 nr
+洛里 6 ns
+洛里亚 59 ns
+洛里埃 3 ns
+洛里拉德 4 nrt
+洛里昂 9 ns
+洛钟东应 2 ns
+洛钟宫 4 nr
+洛镇石 2 nr
+洛阳 2331 ns
+洛阳人 28 nr
+洛阳城 211 ns
+洛阳宫 3 ns
+洛阳市 52 ns
+洛阳才子 3 ns
+洛阳桥 6 ns
+洛阳玻璃 3 nt
+洛阳纸贵 5 i
+洛阳花 3 ns
+洛阳镇 3 ns
+洛阳龙门石窟 10 ns
+洛隆 3 ns
+洛隆县 3 ns
+洛龙区 3 ns
+洜 96 zg
+洞 6944 n
+洞井乡 3 n
+洞儿 3 n
+洞口 736 n
+洞口依子 3 i
+洞口县 4 ns
+洞名 3 n
+洞后 18 n
+洞天 39 n
+洞天福地 16 i
+洞头 5 n
+洞头县 3 ns
+洞如观火 3 i
+洞子 3 n
+洞室 3 n
+洞察 101 n
+洞察一切 10 i
+洞察其奸 3 i
+洞察力 67 n
+洞察秋毫 4 i
+洞幽察微 3 n
+洞幽烛微 3 z
+洞幽烛远 3 z
+洞库 13 n
+洞府 46 n
+洞庭 366 n
+洞庭湖 2593 ns
+洞庭湖区 21 ns
+洞庭湖畔 12 ns
+洞开 212 v
+洞彻 3 v
+洞彻事理 3 i
+洞心骇目 3 i
+洞心骇耳 3 i
+洞悉 95 v
+洞房 125 n
+洞房花烛 67 n
+洞斜面 3 n
+洞晓 3 v
+洞洞 3 n
+洞洞装 3 n
+洞烛 6 n
+洞烛其奸 3 i
+洞燕 3 n
+洞玄 3 n
+洞穴 681 n
+洞穴堆积 3 ns
+洞穴学 3 n
+洞穿 48 v
+洞窑 3 n
+洞窟 272 n
+洞箫 42 n
+洞纺 3 j
+洞经 8 n
+洞若观火 8 i
+洞萧 3 i
+洞蛆 3 n
+洞衬剂 3 v
+洞见 22 n
+洞见症结 3 i
+洞视 3 n
+洞里萨湖 20 ns
+洞鉴 3 n
+洞鉴古今 3 i
+洞鉴废兴 3 n
+洞门 128 n
+洞隐烛微 3 i
+洞面角 3 n
+洞顶 3 n
+洟 299 zg
+洡 2 zg
+洣 6 zg
+洤 2 zg
+津 1960 j
+津亭 3 nz
+津关险塞 3 n
+津南 256 ns
+津南区 3 ns
+津城 19 ns
+津巴 2 ns
+津巴布韦 215 ns
+津巴布韦共和国 4 ns
+津巴布韦非洲民族联盟 2 ns
+津市 32 ns
+津市市 5 ns
+津德尔 3 ns
+津梁 6 ns
+津江 3 ns
+津津 3 ns
+津津乐道 97 nz
+津津有味 144 i
+津浦 126 ns
+津浦路 3 nz
+津浦铁路 41 nz
+津液 105 nz
+津渡 3 ns
+津港 4 ns
+津滨发展 9 nt
+津田 3 nz
+津田康 7 nz
+津贴 732 n
+津贴费 2 n
+津轻海峡 12 ns
+津野 3 ns
+津门 44 ns
+津门虎 3 nz
+洦 36 zg
+洧 15 g
+洨 8 zg
+洩 103 zg
+洪 1853 nr
+洪七公 1129 nr
+洪七公正 3 nr
+洪世伯 3 nr
+洪业 2 n
+洪乔捎书 3 vn
+洪九老 2 nr
+洪亨九 18 nr
+洪亮 216 nr
+洪人雄 25 nr
+洪仁柑 3 n
+洪伟烈 2 nr
+洪兴祖 3 nr
+洪其德 3 nr
+洪凌波 274 nr
+洪制台 3 n
+洪制府 3 nr
+洪剑涛 3 nr
+洪加威 6 nr
+洪劲 2 a
+洪博里 2 nr
+洪口 6 n
+洪古尔 3 nr
+洪名金 2 nr
+洪向阳 36 nr
+洪君彦 4 nr
+洪堡 61 nr
+洪堡大学 6 nt
+洪大 56 a
+洪大尉 13 nr
+洪天明 3 nr
+洪太尉 5 nr
+洪夫人 180 nr
+洪奇沥 5 nr
+洪学智 20 nr
+洪宇宙 3 nr
+洪守备 2 nr
+洪安涧 2 nr
+洪安通 31 nr
+洪宣娇 2 nr
+洪宪元 2 nr
+洪宪皇帝 2 nr
+洪家 9 n
+洪家拳 3 nr
+洪山 1120 nr
+洪山区 4872 ns
+洪峰 145 nr
+洪峰流量 3 n
+洪州 31 ns
+洪师姊 8 nr
+洪帮 3 nr
+洪帮主 56 nr
+洪应明 2 nr
+洪延姬 2 nr
+洪性志 4 nr
+洪恩 34 nr
+洪成南 3 nr
+洪战辉 3 nr
+洪承畴 1405 nr
+洪文山 4 nr
+洪易 2 n
+洪春桥 2 nr
+洪昭光 5 nr
+洪晓蕾 3 nr
+洪普洲 3 nr
+洪朝 28 t
+洪朝生 2 nr
+洪杨事 2 nr
+洪校本 2 nr
+洪森 29 nr
+洪椿坪 4 nr
+洪武 686 nr
+洪水 1383 nr
+洪水为患 3 i
+洪水位 16 n
+洪水期 82 t
+洪水横流 3 i
+洪水泛滥 43 l
+洪水猛兽 35 nr
+洪汝河 2 nr
+洪江 16 nr
+洪江市 7 ns
+洪池岭 2 nr
+洪河 17 ns
+洪河入 2 nr
+洪泛 12 a
+洪泛区 10 nr
+洪波曲 3 nr
+洪泽 6 nr
+洪泽县 9 nr
+洪泽境 3 nr
+洪泽浦 2 nr
+洪泽渠 2 nr
+洪泽湖 84 nr
+洪泽镇 2 nr
+洪洞 20 nr
+洪洞县 27 nr
+洪流 350 n
+洪流滚滚 3 l
+洪涛 13 nr
+洪涝 370 n
+洪涝灾害 3 l
+洪淤灌 4 nr
+洪渡河 2 nr
+洪湖 1337 nr
+洪湖市 259 ns
+洪湖赤卫队 5 nz
+洪灵菲 2 nr
+洪灾 53 n
+洪炉 8 n
+洪炉点雪 3 nr
+洪炉燎发 3 nr
+洪炉燎毛 3 nr
+洪熙 46 nz
+洪熙官 3 ns
+洪福 71 nr
+洪福齐天 35 nr
+洪秀全 197 nr
+洪秉明 10 nr
+洪积 40 n
+洪积层 3 n
+洪积扇 3 n
+洪积物 4 n
+洪经略 5 nr
+洪老儿 2 nr
+洪老帮 60 nr
+洪老爷 3 nr
+洪胜海 186 nr
+洪脉 2 ns
+洪若翰 2 nr
+洪英植 5 nr
+洪范九畴 3 nr
+洪荒 39 ns
+洪荒世界 3 nr
+洪荒时代 3 nr
+洪荒时期 3 n
+洪荣宏 3 nr
+洪葭管 14 nr
+洪融 3 n
+洪述祖 3 nr
+洪道 2 nr
+洪都 135 ns
+洪都拉斯 116 ns
+洪都拉斯人 8 nz
+洪都新 2 nr
+洪都航空 15 nz
+洪量 6 n
+洪金宝 3 nr
+洪钟 35 nr
+洪门 21 ns
+洪雅 4 nr
+洪雅县 3 ns
+洪顺堂 17 nr
+洫 4 g
+洭 2 zg
+洮 74 ns
+洮儿河 12 ns
+洮北区 2 ns
+洮南 9 ns
+洮南县 3 ns
+洮南市 6 ns
+洮州 17 ns
+洮河 30 ns
+洮砚 5 n
+洯 3 zg
+洰 107 zg
+洱 20 ns
+洱海 76 ns
+洱源 6 ns
+洱源县 4 ns
+洲 3128 ng
+洲头 3 b
+洲界 3 b
+洲际 174 b
+洲际导弹 48 n
+洲际性 2 b
+洲际杯 3 n
+洲际飞弹 3 n
+洳 48 x
+洴 9 zg
+洵 23 g
+洶 12 zg
+洸 58 zg
+洹 167 g
+洺 533 zg
+活 8000 vn
+活下去 3 l
+活不下去 3 l
+活不了 3 l
+活不成 3 v
+活产 3 vn
+活人 488 n
+活人无数 3 l
+活人无算 3 l
+活会 3 n
+活似 3 v
+活体 78 n
+活体解剖 3 i
+活佛 307 d
+活像 105 vn
+活儿 465 n
+活儿干 3 l
+活出 3 v
+活分 3 n
+活到 3 v
+活到老 12 l
+活剥生吞 3 i
+活剧 29 n
+活力 1102 n
+活力充沛 3 l
+活力门 3 n
+活动 27526 vn
+活动中心 29 l
+活动主体 5 n
+活动份子 3 n
+活动分子 21 n
+活动力 6 n
+活动区 26 n
+活动场所 3 n
+活动室 27 n
+活动家 99 n
+活动度 16 n
+活动性 46 n
+活动房 3 n
+活动房屋 3 n
+活动期 30 vn
+活动木偶 3 n
+活动桌面 3 n
+活动桥 8 n
+活动温度 3 n
+活动状态 5 l
+活动硬盘 3 n
+活动舞台 3 n
+活动花坛 3 n
+活动课 12 n
+活动量 18 n
+活动靶 3 vn
+活劳动 86 l
+活化 166 vn
+活化分析 3 l
+活化剂 9 n
+活化因子 3 l
+活化基团 3 n
+活化液 3 n
+活化石 56 n
+活化素 3 n
+活化能 3 j
+活化资本 3 l
+活受罪 39 l
+活口 27 vn
+活命 167 vn
+活命之恩 16 l
+活命恩人 3 n
+活命要紧 3 l
+活命钱 6 n
+活土层 3 n
+活地图 7 j
+活地狱 4 n
+活埋 149 vn
+活塞 651 vn
+活塞式 3 n
+活塞杆 3 n
+活塞环 2 n
+活塞队 3 n
+活多久 3 l
+活天冤枉 3 i
+活契 3 a
+活套 6 n
+活字 56 n
+活字典 5 n
+活字印刷 32 l
+活字印刷术 14 n
+活字版 15 vn
+活字盘 3 n
+活存 3 v
+活学活用 3 l
+活宝 27 n
+活度 45 n
+活形活现 3 l
+活得 3 v
+活性 559 n
+活性中心 3 l
+活性剂 58 n
+活性区 7 n
+活性染料 258 n
+活性氧 6 vn
+活性污泥 3 n
+活性炭 48 n
+活性白土 2 n
+活性碳 12 n
+活性种 3 l
+活性部位 3 n
+活性钙 3 n
+活愚公 3 i
+活扣 3 n
+活扳子 3 v
+活报剧 8 n
+活捉 358 v
+活期 50 vn
+活期储蓄 3 n
+活期存款 2 l
+活来 3 v
+活树 3 n
+活树亭 3 n
+活栓 3 n
+活检 58 v
+活棋 3 n
+活死人 81 n
+活气 24 n
+活氧机 3 n
+活水 41 vn
+活泉 3 n
+活法 33 vn
+活法儿 3 l
+活泛 3 a
+活泼 740 a
+活泼可爱 3 l
+活泼地 3 z
+活泼大方 3 z
+活泼开朗 3 z
+活泼泼 15 z
+活泼生动 3 l
+活活 405 vn
+活活泼泼 2 l
+活火 2 n
+活火山 101 n
+活灵活现 39 i
+活版 6 v
+活版印刷 3 l
+活物 44 n
+活猪 8 n
+活现 5 v
+活瓣 3 n
+活生 3 v
+活生物质 3 n
+活生生 287 n
+活用 3 vn
+活畜 6 n
+活疫苗 23 n
+活眼活现 3 v
+活眼现报 3 n
+活着 1400 v
+活石灰 3 n
+活神仙 3 n
+活神活现 3 i
+活祭 4 v
+活立木 14 n
+活结 11 v
+活络 47 vn
+活罪 14 vn
+活罪难逃 3 i
+活脱 36 v
+活脱脱 37 z
+活腻了 3 l
+活色 3 n
+活色生香 6 n
+活茬 3 n
+活荷载 3 n
+活菩萨 14 n
+活血 105 vn
+活血化淤 5 l
+活血化瘀 45 l
+活见鬼 21 n
+活计 101 vn
+活记 3 n
+活词 3 n
+活话 3 vn
+活该 160 v
+活读 3 v
+活读书 3 n
+活象 3 n
+活质 3 n
+活起 3 v
+活跃 1628 vn
+活跃分子 3 l
+活跃度 3 l
+活跃性 2 b
+活跃期 7 b
+活跃股 3 n
+活路 91 n
+活蹦 3 z
+活蹦乱跳 52 l
+活蹦活跳 3 l
+活蹦蹦 3 z
+活蹦鲜跳 3 i
+活过 3 v
+活过来 3 l
+活里子 3 n
+活釦 3 z
+活钱 3 v
+活钱儿 3 n
+活门 16 n
+活阎王 11 n
+活雷锋 3 n
+活靶 9 vn
+活靶子 3 n
+活页 22 n
+活页夹 3 n
+活页文选 3 n
+活页目录 3 n
+活页簿 3 n
+活页纸 3 n
+活领 3 v
+活食 3 n
+活饵料 3 n
+活鱼 3 n
+活鲜 3 vn
+活鲜鲜 3 i
+活鸡 21 n
+活龙活现 9 i
+活龙鲜健 3 nz
+洼 153 n
+洼地 613 n
+洼田 3 n
+洼里 12 n
+洼陷 3 n
+洽 114 zg
+洽办 3 v
+洽博多闻 3 n
+洽商 6 n
+洽询 3 v
+洽谈 167 v
+洽谈会 92 n
+洽谈室 3 n
+洽购 7 v
+洽闻 3 n
+洽闻博见 3 n
+洽闻强见 3 n
+洽闻强记 3 n
+派 21853 v
+派上用场 3 n
+派人参加 3 n
+派位 23 n
+派克 32 nrt
+派克笔 3 n
+派兵 579 n
+派兵助阵 3 v
+派兵攻打 3 n
+派军 3 n
+派出 2022 v
+派出国 19 n
+派出所 375 n
+派出所长 4 n
+派出机构 3 n
+派利 2 n
+派利是 3 v
+派别 452 v
+派到 3 v
+派力司 7 n
+派力奥 3 nz
+派发 51 v
+派司 3 n
+派员 107 n
+派员参加 3 n
+派团 3 n
+派团参加 3 n
+派场 3 n
+派头 124 v
+派定 3 v
+派对 109 v
+派尔 5 nrt
+派差 3 n
+派性 42 n
+派恩 2 v
+派息 73 n
+派息日 11 nz
+派拉 2 nrt
+派拉蒙 3 nrt
+派捐 3 v
+派斯 7 nrt
+派来 3 v
+派款 3 n
+派洛宁 3 nrt
+派活 3 v
+派活儿 3 n
+派珀 2 nrt
+派生 199 v
+派生地图 3 nz
+派生物 3 n
+派生类 3 n
+派生词 5 n
+派神 51 n
+派系 202 n
+派翠西亚 3 ns
+派诺宁 3 nrt
+派调 3 v
+派购 3 v
+派车 3 n
+派车去 3 n
+派车来 3 n
+派送 28 v
+派遣 1657 v
+派遣军 57 n
+派遣证 5 n
+派销 3 v
+派队 3 n
+派驻 183 v
+派驻在 3 z
+派驻所 3 v
+洿 252 zg
+流 9559 n
+流上 3 v
+流上去 3 v
+流上来 3 l
+流下 513 v
+流下去 3 l
+流下来 3 l
+流下泪来 3 l
+流丽 3 a
+流了泪 3 l
+流了血 3 l
+流于 3 v
+流于形式 28 l
+流云 61 n
+流云使 3 n
+流亡 557 v
+流亡国外 3 l
+流亡政府 3 n
+流亡海外 3 l
+流亡者 37 n
+流产 258 vn
+流产政变 3 l
+流产素 3 n
+流人 3 n
+流会 3 n
+流传 1650 vn
+流传下去 3 l
+流传于世 15 l
+流传力学 3 n
+流传千古 14 l
+流传后世 3 l
+流传开来 3 l
+流体 923 n
+流体冶金 3 l
+流体力学 232 l
+流体动力 3 n
+流体参数 3 l
+流体密度 3 n
+流体性 3 n
+流体管 3 vn
+流体静力 3 n
+流俗 18 n
+流光 33 n
+流光易逝 3 i
+流光溢彩 168 l
+流光瞬息 3 l
+流入 1258 v
+流入地 9 n
+流入量 7 n
+流出 749 v
+流出入 2 v
+流出去 3 v
+流出地 7 n
+流出物 3 l
+流出量 3 vn
+流利 215 n
+流利地 3 n
+流别 3 n
+流到 3 v
+流刺网 3 n
+流动 2788 vn
+流动人口 3 n
+流动债务 3 n
+流动力学 3 l
+流动势 3 n
+流动基金 3 n
+流动岗 2 n
+流动性 269 n
+流动户口 3 n
+流动比率 3 n
+流动池 3 n
+流动沙丘 3 n
+流动率 24 n
+流动站 18 n
+流动红旗 3 n
+流动资产 3 l
+流动资本 3 l
+流动资金 108 n
+流动车 2 n
+流动量 4 n
+流化 3 vn
+流化床 8 n
+流去 3 v
+流变 84 v
+流变图 3 l
+流变学 3 l
+流变性 5 l
+流口 7 vn
+流口常谈 3 i
+流口水 36 n
+流向 467 n
+流向地 2 n
+流嘢 3 z
+流回 3 v
+流回去 3 l
+流回来 3 l
+流场 3 n
+流型 3 n
+流域 2825 n
+流域形态 3 n
+流域性 5 n
+流域规划 3 n
+流域面积 3 n
+流天澈地 3 l
+流失 702 v
+流失率 52 n
+流失量 3 l
+流好 3 v
+流娼 3 v
+流媒体 3 n
+流完 3 v
+流寇 138 n
+流寓 21 n
+流尽 3 v
+流川枫 3 n
+流布 39 v
+流年 35 n
+流年不利 3 l
+流年似水 4 l
+流弊 14 n
+流式 19 n
+流式细胞 3 l
+流弹 16 n
+流当 3 v
+流形 69 n
+流彩飞霞 3 l
+流往 3 vn
+流得 3 v
+流徙 3 n
+流态化 6 n
+流感 119 n
+流感疫苗 3 n
+流感病毒 2 n
+流掉 3 v
+流控制 3 n
+流播 3 vn
+流放 318 v
+流放地 24 n
+流散 65 v
+流料 3 n
+流时 9 n
+流明 5 v
+流星 390 n
+流星体 3 n
+流星学 3 n
+流星掣电 3 l
+流星焰火 3 n
+流星群 3 n
+流星花园 3 n
+流星街 3 n
+流星赶月 20 i
+流星锤 56 n
+流星雨 36 n
+流星飞电 3 l
+流来 3 v
+流来流去 3 l
+流槽 2 n
+流毒 80 n
+流民 178 n
+流氓 620 n
+流氓兔 3 n
+流氓团伙 3 n
+流氓头 3 n
+流氓婆 3 n
+流氓学生 3 n
+流氓无产者 9 n
+流氓气 2 n
+流氓燕 3 n
+流氓猪 3 n
+流氓罪 3 n
+流氓行为 3 n
+流氓软件 3 n
+流氓阿飞 3 n
+流氓集团 3 n
+流气 6 n
+流水 662 n
+流水不腐 2 l
+流水作业 7 n
+流水号 5 n
+流水地貌 3 n
+流水声 3 n
+流水帐 3 n
+流水席 3 n
+流水无情 7 l
+流水朝宗 3 i
+流水桃花 3 n
+流水游龙 3 n
+流水线 98 n
+流水线结构 3 n
+流水落花 2 n
+流水行云 2 n
+流水账 7 n
+流水赈 3 l
+流水过程 3 l
+流水高山 3 ns
+流汁 3 n
+流汗 54 n
+流汗浃背 3 i
+流沙 178 n
+流沙河 28 ns
+流河 17 n
+流泄 3 v
+流泄出来 3 i
+流泉 38 n
+流注 43 v
+流泪 560 n
+流泻 29 v
+流派 946 n
+流派风格 3 n
+流流 3 n
+流流行性 3 n
+流浆箱 2 n
+流浪 251 n
+流浪人 4 n
+流浪儿 9 n
+流浪女 3 n
+流浪歌 3 n
+流浪汉 116 n
+流浪狗 3 n
+流浪生活 3 l
+流浪者 96 n
+流浪记 12 n
+流浸膏 4 n
+流涎 28 v
+流涕 64 n
+流淌 260 v
+流溢 13 v
+流溪河 3 ns
+流溺忘反 3 l
+流满 3 v
+流火 24 n
+流点 3 n
+流片 3 n
+流用 3 v
+流电 3 vn
+流电刺激 3 l
+流电学 3 n
+流电病变 3 n
+流畅 424 a
+流畅地 3 i
+流畅性 3 l
+流盼 3 v
+流眼泪 3 n
+流着泪 3 l
+流矢 20 n
+流石 2 n
+流石滩 3 n
+流砂 3 n
+流离 52 v
+流离失所 67 n
+流离播越 3 n
+流离播迁 3 i
+流离琐尾 3 vn
+流离转徙 3 n
+流离颠沛 3 i
+流离颠疐 3 i
+流离颠顿 3 i
+流移失所 3 i
+流程 523 n
+流程化 4 n
+流程图 18 n
+流窜 56 v
+流窜作案 3 l
+流窜到 3 l
+流窜犯 2 l
+流管 3 vn
+流纹岩 23 n
+流线 34 n
+流线圈 3 n
+流线型 61 b
+流线形 3 n
+流经 968 n
+流网 5 n
+流网渔船 3 n
+流胶病 3 n
+流脍人口 3 v
+流脑 43 n
+流脓 23 v
+流花 3 n
+流花湖 3 n
+流花路 3 n
+流芳 545 n
+流芳千古 11 i
+流芳后世 3 i
+流芳百世 538 i
+流苏 48 v
+流苏花边 3 ns
+流荡 15 v
+流莺 3 n
+流萤 10 n
+流落 249 v
+流落他乡 3 l
+流落外乡 3 l
+流落天涯 3 i
+流落失所 3 i
+流落异乡 3 l
+流落江湖 28 l
+流落风尘 3 l
+流血 788 v
+流血事件 3 n
+流血冲突 3 n
+流血千里 3 l
+流血政变 3 n
+流血流汗 3 l
+流血漂卤 3 n
+流血牺牲 3 l
+流行 3049 v
+流行乐 2 n
+流行坎止 3 n
+流行性 101 n
+流行性感 3 n
+流行时尚 3 n
+流行时装 3 n
+流行曲 3 n
+流行榜 3 n
+流行歌 17 n
+流行歌曲 60 n
+流行病 52 n
+流行病学 82 n
+流行色 3 n
+流行语 9 n
+流行起来 3 l
+流行音乐 3 n
+流行风 3 n
+流觞 5 n
+流言 346 n
+流言惑众 3 i
+流言混话 3 l
+流言蜚语 47 i
+流言风语 3 i
+流言飞文 3 n
+流言飞语 3 i
+流质 31 n
+流质性 3 n
+流质食物 3 l
+流贼 719 n
+流走 15 v
+流起 3 v
+流路 17 n
+流转 170 v
+流转税 7 n
+流转额 2 n
+流辖 3 v
+流过 39 v
+流过去 3 l
+流过时间 3 l
+流过来 3 l
+流过泪 3 n
+流进 3 v
+流进去 3 l
+流进来 3 l
+流连 67 v
+流连忘反 3 i
+流连忘返 181 l
+流通 4082 vn
+流通业 5 n
+流通两 3 n
+流通出来 3 l
+流通分 3 n
+流通券 6 n
+流通性 4 n
+流通手段 3 n
+流通池 3 n
+流通渠道 3 n
+流通电泳 3 l
+流通盘 3 n
+流通股 2294 n
+流通股东 3 n
+流通证券 3 n
+流通费用 3 n
+流通量 13 n
+流通领域 238 l
+流逝 155 v
+流速 334 n
+流速计 3 n
+流遍 3 v
+流遍全身 3 n
+流道 3 v
+流配 3 vn
+流里流气 9 n
+流量 1499 n
+流量仪表 3 n
+流量表 15 n
+流量计 12 v
+流金 9 n
+流金岁月 3 n
+流金溢彩 2 n
+流金铄石 3 i
+流长 9 n
+流露 767 v
+流露出 3 i
+流露出来 3 l
+流音 3 n
+流风 10 n
+流风余俗 3 l
+流风余韵 3 n
+流风回雪 3 l
+流风所及 3 i
+流风遗迹 3 i
+流食 7 n
+流驶 3 v
+流鼻涕 3 n
+流鼻血 3 n
+浂 8 zg
+浃 272 g
+浃沦肌髓 3 n
+浃背汗流 3 nr
+浃髓沦肌 3 l
+浄 17 zg
+浅 2850 a
+浅丘 12 n
+浅井 15 n
+浅内饰 3 n
+浅化 3 n
+浅叶凌奈 3 nr
+浅吟低唱 3 i
+浅呻吟 3 i
+浅学 3 n
+浅尝 8 v
+浅尝辄止 18 i
+浅层 306 n
+浅希近求 3 nr
+浅成岩 13 nr
+浅斟低唱 3 i
+浅斟低酌 3 i
+浅易 8 n
+浅显 64 a
+浅显易懂 3 i
+浅普庵 3 nr
+浅析 7 vn
+浅根性 2 n
+浅棕 18 b
+浅棕色 3 n
+浅水 442 n
+浅水区 36 n
+浅水池 3 n
+浅水湾 5 nr
+浅水滩 4 n
+浅沟 11 n
+浅沼 2 n
+浅浅 3 a
+浅浅的 61 z
+浅浮雕 3 n
+浅海 215 ns
+浅海养殖 3 n
+浅海渔业 3 n
+浅淡 25 z
+浅滩 162 n
+浅灰 3 n
+浅白 6 z
+浅白色 2 n
+浅盘 3 n
+浅碟 3 n
+浅笑 37 nr
+浅箱 3 n
+浅粉红色 3 n
+浅粉色 3 n
+浅紫色 7 nr
+浅紫衫 2 nr
+浅红 22 b
+浅结工艺 3 n
+浅绿 42 b
+浅绿色 29 n
+浅而易见 3 i
+浅耕 8 nr
+浅色 203 n
+浅色系 3 n
+浅莫测 2 nrt
+浅蓝 28 b
+浅蓝色 41 n
+浅蓝衫 2 nr
+浅薄 159 a
+浅表 25 n
+浅表性 7 n
+浅褐色 16 n
+浅见 29 n
+浅见寡识 3 i
+浅见寡闻 3 i
+浅见薄识 3 i
+浅解 3 n
+浅议 3 n
+浅论 3 n
+浅谈 3 n
+浅近 25 a
+浅部微 2 nr
+浅释 3 n
+浅闻 3 n
+浅陋 29 a
+浅露 5 v
+浅青色 3 n
+浅黄 41 b
+浅黄色 62 n
+浆 1192 n
+浆料 25 n
+浆果 155 n
+浆染 23 nz
+浆水 35 n
+浆水不交 3 n
+浆汁 23 nz
+浆洗 31 nz
+浆液 56 n
+浆湖 3 ns
+浆状 3 nz
+浆硬 3 v
+浆粕 2 nz
+浆糊 41 n
+浆纱 15 n
+浆纱机 3 n
+浆纸 4 nz
+浆细胞 3 n
+浆膜 25 n
+浆衣服 3 n
+浆酒藿肉 3 v
+浆酒霍肉 3 n
+浇 605 v
+浇下 3 v
+浇冷水 2 v
+浇制 3 v
+浇口 3 v
+浇地 4 v
+浇头 5 v
+浇底乡 2 n
+浇愁 3 v
+浇捣 3 v
+浇水 90 v
+浇注 267 v
+浇注料 3 l
+浇洒 3 v
+浇淳散朴 3 z
+浇湿 9 v
+浇灌 81 v
+浇灭 28 v
+浇熄 3 v
+浇瓜之惠 3 n
+浇筑 24 v
+浇花 3 v
+浇薄 3 v
+浇过 3 v
+浇醇散朴 3 n
+浇铸 49 v
+浇铸法 2 l
+浇风薄俗 3 l
+浈 14 g
+浈江区 3 nr
+浉 142 zg
+浊 341 n
+浊世 6 n
+浊声 3 n
+浊度 4 n
+浊度法 3 n
+浊度计 3 n
+浊气 24 n
+浊水 20 n
+浊水溪 44 n
+浊泾清渭 3 ns
+浊流 59 n
+浊浪 23 n
+浊漳河 3 ns
+浊物 3 n
+浊者自浊 3 n
+浊质凡姿 3 n
+浊辅音 2 nz
+浊酒 9 n
+浊音 22 n
+浊骨凡胎 3 n
+测 2083 vn
+测云仪 3 nz
+测井 7 nz
+测井技术 3 n
+测井速度 3 n
+测仪 3 nz
+测位 3 vn
+测位器 3 n
+测体温 3 nz
+测侦所 3 nz
+测候 3 v
+测光 18 nz
+测出 156 v
+测到 3 v
+测力 8 nz
+测力器 3 nz
+测力计 3 nz
+测功机 3 n
+测压管 2 nz
+测压面 3 n
+测厚仪 3 n
+测反 3 v
+测台 2 v
+测向 20 v
+测向仪 2 nz
+测器 6 nz
+测回 15 v
+测地流 3 n
+测声器 3 nz
+测字 65 nz
+测定 1768 v
+测定仪 7 nz
+测定器 5 n
+测定方法 20 nz
+测定机 3 n
+测定法 3 n
+测定目标 2 n
+测定限 3 n
+测平器 3 nz
+测年技术 15 n
+测序 3 vn
+测度 51 n
+测度卷积 3 n
+测度器 3 nz
+测度法 3 nz
+测度计 3 nz
+测度论 3 nz
+测录到 3 v
+测得 3 v
+测微器 5 nz
+测微术 3 n
+测微目镜 3 n
+测微表 3 n
+测微计 3 nz
+测性 8 n
+测扫描器 3 n
+测报 7 vn
+测振仪 3 nz
+测探 2 vn
+测控 63 vn
+测控站 21 nz
+测控网 12 nz
+测数据 3 n
+测时 7 v
+测景 2 n
+测智商 3 n
+测查 19 vn
+测树学 3 n
+测流 3 vn
+测海 3 nz
+测深 22 v
+测深管 3 nz
+测温 37 nz
+测温仪 3 nz
+测温器 3 nz
+测温学 3 n
+测温性质 3 n
+测温表 3 nz
+测湿法 3 nz
+测点 9 vn
+测电笔 7 nz
+测知 3 v
+测程 6 n
+测站 3 nz
+测算 226 vn
+测系统 2 n
+测绘 291 vn
+测绘中心 3 nz
+测绘兵 3 nz
+测绘员 3 n
+测绘学 3 n
+测绘局 13 n
+测绘板 3 nz
+测绘法 8 nz
+测绘队 3 nz
+测航 3 v
+测节器 3 n
+测血压 3 nz
+测角仪 4 nz
+测角器 2 nz
+测评 283 v
+测评师 3 n
+测试 2444 vn
+测试中心 3 nz
+测试主机 2 nz
+测试人员 6 n
+测试代码 7 n
+测试仪 26 nz
+测试函数 3 n
+测试卷 3 nz
+测试可用 3 v
+测试台 4 v
+测试工具 20 n
+测试报告 3 n
+测试数据 3 n
+测试方法 7 nz
+测试日志 3 nz
+测试期 3 n
+测试步骤 2 n
+测试法 3 nz
+测试点 2 n
+测试版 22 v
+测试状态 2 n
+测试环境 4 n
+测试用例 14 n
+测试程序 3 n
+测试综合 3 n
+测试者 2 n
+测试表明 4 nz
+测试规约 3 n
+测试计划 2 nz
+测试评述 3 n
+测试语言 3 n
+测试软件 2 n
+测试运行 3 nz
+测试通过 3 n
+测试阀 3 nz
+测试阶段 2 n
+测试项目 2 n
+测试题 19 n
+测谎 5 v
+测谎仪 10 n
+测谎器 3 n
+测距 185 nz
+测距仪 106 nz
+测距器 7 nz
+测距法 3 nz
+测速 29 v
+测速仪 6 nz
+测速器 3 nz
+测速雷达 3 nz
+测量 2589 vn
+测量仪 15 nz
+测量体温 2 nz
+测量剂 3 nz
+测量员 22 n
+测量器 2 nz
+测量学 89 n
+测量学家 6 n
+测量师 3 n
+测量方法 3 nz
+测量术 3 n
+测量机 2 nz
+测量杆 3 nz
+测量法 3 nz
+测量深度 3 nz
+测量点 2 n
+测量船 55 nz
+测量范围 2 n
+测量计 3 v
+测量误差 3 n
+测量队 4 n
+测锤 3 n
+测长仪 4 nz
+测隐 3 v
+测震 3 vn
+测震仪 3 n
+测震学 8 n
+测音 3 nz
+测音器 3 n
+测音计 3 n
+测验 418 vn
+测验分数 3 n
+测验卷 3 nz
+测验法 3 n
+测验纸 3 nz
+测验题 3 n
+测高 3 v
+测高仪 7 nz
+测高度 3 n
+测高法 3 nz
+测高计 3 nz
+浍 25 zg
+济 2043 j
+济世 64 nrt
+济世之才 4 nr
+济世匡时 3 nr
+济世安人 3 nz
+济世安民 3 nz
+济世安邦 3 nz
+济世救人 3 nz
+济中 2 ns
+济事 3 v
+济人利物 3 nt
+济公 17 nr
+济公活佛 3 ns
+济兹 3 ns
+济助 48 v
+济南 1417 ns
+济南人 12 nrt
+济南军区 25 ns
+济南市 257 ns
+济南市委 2 nt
+济南战役 26 nz
+济南房产 3 n
+济南路 3 ns
+济南铁路局 4 nt
+济困 12 v
+济困扶危 4 i
+济困扶贫 3 i
+济学 4 n
+济宁 91 ns
+济宁市 39 ns
+济寒赈贫 3 vn
+济州 183 ns
+济州岛 54 ns
+济州道 9 ns
+济度 3 ns
+济弱扶倾 3 i
+济弱锄强 3 nr
+济急 3 v
+济慈 14 nrt
+济时行道 3 i
+济水 3 ns
+济河焚舟 3 nr
+济济 3 ns
+济济一堂 17 nz
+济济多士 3 ns
+济济彬彬 3 i
+济源 35 ns
+济源市 4 ns
+济燃眉之 3 nr
+济私 3 v
+济科 13 ns
+济窍飘风 3 i
+济胜之具 3 i
+济苦怜贫 3 i
+济贫 77 v
+济贫所 3 nt
+济贫拔苦 3 i
+济钢 11 nz
+济阳 13 ns
+济阳县 18 ns
+浏 46 ns
+浏河 19 ns
+浏河镇 7 ns
+浏海 3 ns
+浏览 1469 v
+浏览器 159 n
+浏览者 2 n
+浏览量 11 n
+浏阳 80 ns
+浏阳县 8 ns
+浏阳市 4 ns
+浏阳河 15 ns
+浐 239 zg
+浑 832 n
+浑人 3 n
+浑仪 46 n
+浑似 3 a
+浑体 3 n
+浑俗和光 3 n
+浑厚 504 a
+浑古 3 ns
+浑号 3 n
+浑名 3 n
+浑善达克沙地 3 ns
+浑噩 7 z
+浑圆 95 n
+浑天仪 31 n
+浑如 3 a
+浑家 3 n
+浑抡吞枣 3 ns
+浑朴 14 a
+浑水 3 n
+浑水摸鱼 15 i
+浑江 20 ns
+浑江市 9 ns
+浑沌 18 a
+浑沌一片 3 i
+浑沦 6 a
+浑沦吞枣 3 ns
+浑河 105 ns
+浑浊 191 a
+浑浊度 3 n
+浑浑 3 z
+浑浑噩噩 64 z
+浑浑沌沌 6 z
+浑浑洒洒 3 z
+浑源 15 n
+浑源县 11 ns
+浑然 48 z
+浑然一体 48 l
+浑然一色 3 i
+浑然不知 13 l
+浑然不觉 43 i
+浑然天成 20 i
+浑然无垠 3 l
+浑然无知 3 i
+浑然自成 3 i
+浑球 3 n
+浑球儿 3 n
+浑蛋 14 n
+浑话 3 n
+浑象 30 n
+浑身 1496 n
+浑身上下 3 l
+浑身发抖 3 i
+浑身是劲 3 l
+浑身是汗 3 l
+浑身是胆 2 i
+浑身解数 38 l
+浑金璞玉 3 i
+浑金白玉 3 n
+浑铁 3 n
+浑黄 4 z
+浒 31 ns
+浒墅关 6 ns
+浒山 3 ns
+浓 1887 a
+浓于 3 v
+浓云 3 n
+浓云密布 3 i
+浓厚 1369 a
+浓厚兴趣 3 i
+浓发 3 v
+浓味 3 n
+浓咖啡 3 nr
+浓墨 3 n
+浓墨重彩 20 l
+浓妆 26 n
+浓妆淡抹 3 i
+浓妆艳抹 40 i
+浓妆艳服 3 i
+浓妆艳裹 3 n
+浓妆艳饰 3 n
+浓密 161 a
+浓密度 3 n
+浓度 1043 n
+浓度梯度 3 n
+浓度计 3 n
+浓情密意 3 i
+浓情蜜意 3 i
+浓抹 3 v
+浓抹淡妆 3 i
+浓暗 3 a
+浓核病毒 3 n
+浓桃艳李 3 i
+浓汁 9 n
+浓汤 6 n
+浓浆 3 n
+浓浓 48 z
+浓浓的 119 z
+浓液 3 n
+浓淡 52 a
+浓淡适中 3 i
+浓烈 247 a
+浓烟 216 n
+浓烟滚滚 14 l
+浓痰 3 v
+浓相 3 n
+浓眉 72 n
+浓眉大眼 65 i
+浓眉毛 3 i
+浓睡 3 v
+浓硫酸 3 n
+浓积云 6 n
+浓紫 3 a
+浓绿 26 z
+浓缩 692 v
+浓缩剂 3 n
+浓缩品 3 n
+浓缩器 3 n
+浓缩料 3 n
+浓缩机 3 n
+浓缩汁 2 n
+浓缩液 4 n
+浓缩物 3 n
+浓缩铀 47 n
+浓而不烈 3 i
+浓腻 3 a
+浓色 3 n
+浓艳 33 a
+浓茶 75 n
+浓荫 46 n
+浓荫蔽天 3 i
+浓荫蔽日 3 i
+浓荫蔽空 3 i
+浓血症 3 n
+浓装 3 n
+浓装艳抹 3 i
+浓郁 1227 a
+浓酒 3 n
+浓重 259 a
+浓雾 125 n
+浓雾密布 3 n
+浓雾迷蒙 3 l
+浓香 49 n
+浓香型 2 n
+浓黑 43 z
+浔 93 j
+浔江 22 ns
+浔阳区 3 ns
+浗 209 zg
+浘 89 zg
+浙 725 ns
+浙东 320 ns
+浙东运河 13 ns
+浙中 15 ns
+浙北 13 ns
+浙南 51 ns
+浙商 3 nz
+浙商网 3 nz
+浙嘉兴 3 ns
+浙大 44 ns
+浙工大 3 nt
+浙师大 4 ns
+浙教版 3 nz
+浙昆 3 ns
+浙江 3022 ns
+浙江人 26 nz
+浙江人民出版社 4 nt
+浙江农业大学 3 nt
+浙江医科大学 2 nt
+浙江医药 2 nt
+浙江大学 157 nt
+浙江女排 3 nt
+浙江工业大学 5 nt
+浙江师范大学 5 nt
+浙江广厦 8 ns
+浙江文艺出版社 2 nt
+浙江日报 3 nz
+浙江村 2 ns
+浙江电信 3 nz
+浙江省 722 ns
+浙江省人民政府 7 nt
+浙江省博物馆 4 ns
+浙江省图书馆 3 nt
+浙江省委 5 nt
+浙江省工商局 4 nt
+浙江省政协 4 nt
+浙江省政府 8 nt
+浙江籍 4 n
+浙江绿城队 3 nz
+浙江美术学院 8 nt
+浙江队 35 nt
+浙洽会 3 j
+浙省 3 ns
+浙西 113 ns
+浙西平原 3 ns
+浙贝母 11 nz
+浙赣 3 j
+浙赣线 26 nz
+浙赣铁路 21 nz
+浚 265 ns
+浚县 41 ns
+浛 11 zg
+浜 7066 nz
+浜松 2 nz
+浜田省吾 3 nz
+浞 88 v
+浞訾栗斯 3 ns
+浠 4587 g
+浠水 524 ns
+浠水县 256 ns
+浡 62 zg
+浣 2516 vg
+浣洗 3 n
+浣涤 3 n
+浣溪沙 7 n
+浣溪纱 2 n
+浣熊 16 n
+浣纱 3 n
+浣衣 3 n
+浥 3 zg
+浦 341 zg
+浦东 267 ns
+浦东南路 2 ns
+浦东发展银行 4 nt
+浦东国际机场 4 nt
+浦东店 3 ns
+浦东新区 36 ns
+浦东新区公安局 3 nt
+浦二世 2 nr
+浦今存 2 nr
+浦仓栈 2 nr
+浦克 3 ns
+浦北 4 ns
+浦北县 8 ns
+浦南 7 ns
+浦发 8 j
+浦发银行 33 nt
+浦口 87 ns
+浦口区 36 ns
+浦和 4 ns
+浦圃斓 3 nr
+浦城 10 ns
+浦城县 5 ns
+浦城路 3 ns
+浦太守孟 2 nr
+浦安修 3 nr
+浦归帆 3 nr
+浦彩质 2 nr
+浦志强 6 nr
+浦文英 5 nr
+浦斯 2 ns
+浦江 34 ns
+浦江两岸 3 nr
+浦江县 2 ns
+浦江镇 3 ns
+浦洛河 3 ns
+浦洞 10 ns
+浦熙修 4 nrfg
+浦珍珠 2 nr
+浦知良 2 nr
+浦肯野 6 nr
+浦西 17 ns
+浦诺菲 17 nr
+浦起龙 3 nr
+浦路 4 ns
+浦那 7 ns
+浦里 2 ns
+浦项 11 ns
+浦饭幽助 3 vn
+浩 951 nr
+浩劫 232 v
+浩华 2 nz
+浩博 4 ns
+浩叹 3 v
+浩大 158 a
+浩如 3 v
+浩如烟气 3 i
+浩如烟海 23 i
+浩平 3 ns
+浩方 3 n
+浩歌 5 n
+浩气 16 a
+浩气凛然 3 i
+浩气长存 4 i
+浩浩 3 nz
+浩浩汤汤 3 i
+浩浩荡荡 698 i
+浩淼 15 a
+浩渺 16 a
+浩瀚 94 a
+浩瀚无垠 9 i
+浩瀚无涯 3 i
+浩然 38 a
+浩然之气 6 i
+浩然正气 17 i
+浩特 3 a
+浩繁 47 a
+浩罕 54 ns
+浩翰 3 ns
+浩茫 3 z
+浩荡 98 v
+浩齿 3 n
+浪 1165 n
+浪人 43 n
+浪卡子 3 n
+浪卡子县 3 ns
+浪基面 3 n
+浪声浪气 3 l
+浪头 58 n
+浪奇 3 a
+浪子 125 n
+浪子回头 15 l
+浪子回头金不换 4 l
+浪子宰相 3 n
+浪客 3 n
+浪客剑心 3 i
+浪尖 19 n
+浪峰 3 n
+浪平 4 n
+浪得虚名 3 i
+浪打浪 3 l
+浪木 3 n
+浪板 3 n
+浪桥 3 n
+浪涌 34 nz
+浪涛 76 n
+浪涛花 3 i
+浪淘沙 9 nz
+浪游 5 n
+浪漫 754 a
+浪漫主义 397 n
+浪漫主义者 7 n
+浪漫史 4 n
+浪漫性 2 n
+浪漫情怀 3 n
+浪漫插曲 3 n
+浪漫曲 12 n
+浪漫气息 3 n
+浪漫气质 3 n
+浪漫派 39 n
+浪漫爱情 3 l
+浪漫生活 3 n
+浪潮 461 n
+浪潮汹涌 3 i
+浪潮集团 2 nt
+浪澜壮阔 3 i
+浪琴 3 n
+浪琴表 3 n
+浪翻云 3 l
+浪者 3 n
+浪船 2 n
+浪花 154 n
+浪荡 64 v
+浪荡子 10 n
+浪荡子式 3 l
+浪蕊浮花 3 n
+浪蝶游蜂 3 n
+浪蝶狂蜂 3 n
+浪谷 3 n
+浪费 1134 n
+浪费地 3 n
+浪费成性 3 n
+浪费时间 3 n
+浪费者 3 n
+浪费资源 3 n
+浪迹 18 n
+浪迹天下 3 i
+浪迹天涯 23 i
+浪迹江湖 22 l
+浪迹浮踪 3 i
+浪迹萍踪 3 vn
+浪酒闲茶 3 n
+浪里白条 28 n
+浪鼓 3 n
+浬 2 zg
+浮 1394 v
+浮一大白 10 l
+浮上去 3 l
+浮上来 3 l
+浮世 3 v
+浮世绘 19 nr
+浮于 3 v
+浮云 114 n
+浮云富贵 3 i
+浮云朝露 3 nr
+浮云翳日 3 vn
+浮云蔽日 3 i
+浮价款 2 l
+浮价烟 4 n
+浮体 3 n
+浮光 3 n
+浮光掠影 16 n
+浮光跃金 3 l
+浮冰 81 nr
+浮出 182 v
+浮力 128 n
+浮力密度 3 n
+浮力秤 3 n
+浮力计 3 l
+浮动 297 vn
+浮动价 3 n
+浮动价格 3 l
+浮动块 3 n
+浮动工资 4 l
+浮动式 7 n
+浮动汇率 25 n
+浮动汇率制 8 l
+浮升 3 v
+浮华 68 nz
+浮华不实 3 i
+浮华世界 3 nz
+浮台 3 n
+浮吊 2 v
+浮名 11 v
+浮名薄利 3 l
+浮名虚利 3 l
+浮名虚誉 3 l
+浮图 15 n
+浮图经 3 l
+浮土 17 n
+浮士德 43 nr
+浮声切响 3 l
+浮多 3 v
+浮头 4 n
+浮头滑脑 3 n
+浮夸 112 v
+浮夸风 64 nr
+浮子 12 n
+浮家泛宅 3 n
+浮寄孤悬 3 nr
+浮小麦 3 nr
+浮尘 37 n
+浮尘子 3 n
+浮尸 50 n
+浮屠 21 nr
+浮山 19 ns
+浮山县 3 ns
+浮岚暖翠 3 nr
+浮岛 3 n
+浮岩 4 n
+浮式 162 n
+浮影 3 n
+浮思翩翩 3 l
+浮想 4 n
+浮想联翩 24 l
+浮报 3 n
+浮掠 3 v
+浮收勒折 3 i
+浮收勒索 3 i
+浮文巧语 3 i
+浮日 3 n
+浮来 3 v
+浮来山 2 ns
+浮来暂去 3 nr
+浮来浮去 3 l
+浮标 96 n
+浮桥 181 n
+浮梁 11 n
+浮梁县 4 ns
+浮水 29 n
+浮水印 3 n
+浮沉 68 a
+浮沉不定 3 l
+浮沙 3 n
+浮油 12 n
+浮法 5 n
+浮法玻璃 3 l
+浮泛 14 a
+浮泥 3 n
+浮浅 19 n
+浮海石 3 nr
+浮渣 2 n
+浮游 186 vn
+浮游动物 3 l
+浮游城 3 n
+浮游植物 3 l
+浮游生物 142 l
+浮游选矿 3 n
+浮湛连蹇 3 nr
+浮滑 20 v
+浮滥 3 v
+浮漂 9 n
+浮灰 2 n
+浮点 100 n
+浮点数 5 n
+浮点运算 8 l
+浮燥 3 a
+浮环实验 3 l
+浮现 276 v
+浮球 2 n
+浮球阀 3 n
+浮瓜沈李 3 nr
+浮瓜沉李 3 i
+浮生 28 v
+浮生六记 3 n
+浮生若梦 5 i
+浮白 3 v
+浮白载笔 3 n
+浮皮 3 n
+浮皮潦草 3 l
+浮石 33 n
+浮石沉木 3 i
+浮石粉 3 n
+浮空 3 n
+浮空器 39 n
+浮笔浪墨 3 i
+浮筒 36 n
+浮签 3 v
+浮繁 3 a
+浮翠流丹 3 ns
+浮而不实 3 l
+浮肿 415 n
+浮舟 3 n
+浮船 3 n
+浮船坞 9 n
+浮艳 11 a
+浮花浪蕊 3 n
+浮荡 28 v
+浮萍 51 nr
+浮萍浪梗 3 nr
+浮薄 3 a
+浮言 3 n
+浮记 3 n
+浮词 3 n
+浮语虚辞 3 i
+浮财 17 v
+浮起 3 v
+浮踪浪迹 3 i
+浮躁 186 a
+浮躁不安 3 nr
+浮辞 3 v
+浮迹浪踪 3 i
+浮选 3 v
+浮选机 3 n
+浮钓 3 v
+浮雕 1205 n
+浮雕像 2 n
+浮靡 3 a
+浮面 4 n
+浮鱼 3 n
+浯 38 g
+浯屿 2 ns
+浰 3 zg
+浴 367 n
+浴佛 10 n
+浴佛节 3 n
+浴具 3 n
+浴场 118 n
+浴堂 3 n
+浴宝 3 n
+浴室 154 n
+浴室柜 3 i
+浴室用品 3 n
+浴室镜 3 n
+浴巾 19 n
+浴帽 3 n
+浴池 54 n
+浴液 11 n
+浴火重生 3 i
+浴疗学 3 n
+浴盆 19 n
+浴缸 41 n
+浴罩 3 n
+浴血 170 n
+浴血奋战 78 i
+浴血战 3 n
+浴血战斗 3 i
+浴血苦战 3 i
+浴衣 7 n
+浴袍 3 n
+海 9676 n
+海丁 2 nz
+海上 3213 s
+海上保险 3 n
+海上基地 3 n
+海上巡逻 3 nz
+海上生明月 5 i
+海上结构 3 n
+海上花 2 n
+海上花列 3 ns
+海上运输 3 l
+海不扬波 3 i
+海不波溢 3 i
+海丘 6 ns
+海东 9 ns
+海东地区 3 ns
+海东征 2 nr
+海东盛 2 nr
+海东青 29 nr
+海中 3 s
+海中捞月 3 i
+海中珍 2 nr
+海中跃 3 nr
+海中青 2 nr
+海丰 32 nz
+海丰县 9 ns
+海丰屯 3 nr
+海临风 2 nr
+海丽塔 2 nr
+海之渊 2 nr
+海之滨 4 nr
+海事 125 n
+海事专科 3 nt
+海事仲裁 3 nr
+海事处 3 n
+海事局 6 nt
+海事水产 3 n
+海事法 3 n
+海事法庭 3 nt
+海事职业 3 n
+海亚姆 15 nr
+海交会 3 nt
+海产 396 n
+海产品 52 n
+海人一号 3 nz
+海人藻酸 3 nz
+海伊 2 nrt
+海伍德 13 nr
+海会 3 n
+海伦 57 nr
+海伦凯勒 3 nr
+海伦县 3 ns
+海伦娜 4 nr
+海伦市 3 ns
+海俊杰 3 nr
+海信 193 nz
+海信集团 14 nt
+海光 7 n
+海光寺 6 nr
+海克 2 nz
+海克尔 11 nr
+海兔 4 n
+海公公 3 nr
+海兰察 17 nr
+海兰弼 31 nr
+海兰德 2 nr
+海兰氏 3 nr
+海兰泡 8 nr
+海关 813 ns
+海关人员 3 n
+海关总署 37 nt
+海关检查 3 nr
+海关法 10 n
+海关监管 3 n
+海关税 11 n
+海关署 3 nt
+海兴 2 ns
+海兴县 2 ns
+海兴波 2 nr
+海兽 64 n
+海内 129 s
+海内外 599 s
+海内存知 3 n
+海内存知己 4 i
+海内无双 3 nz
+海内海外 3 s
+海内澹然 3 z
+海内鼎沸 3 i
+海军 7228 n
+海军上将 3 n
+海军上尉 3 nr
+海军东海舰队 2 nt
+海军军官 3 nr
+海军医院 3 nt
+海军南海舰队 14 nt
+海军后勤部 2 nt
+海军基地 3 nz
+海军官校 3 nt
+海军工程大学 261 nt
+海军工程学院 2 nt
+海军航空 3 nt
+海军航空工程学院 3 nt
+海军蓝 3 nr
+海军部 40 nt
+海军陆战 3 nz
+海军陆战队 606 nt
+海冠 3 n
+海冬青 3 nr
+海况 25 n
+海切尔 3 nr
+海刚峰 6 nr
+海利 22 ns
+海利丰 3 ns
+海剌儿 2 nr
+海力士 3 n
+海力布 3 nr
+海勃湾 6 nr
+海勃湾区 3 ns
+海勒 11 nz
+海勒水 4 ns
+海化 11 n
+海北 57 s
+海北天南 3 ns
+海北藏族自治州 16 ns
+海区 403 n
+海协 11 j
+海协会 6 nt
+海南 1008 ns
+海南出版社 5 nt
+海南区 3 ns
+海南大学 14 nt
+海南岛 496 ns
+海南州 3 ns
+海南师范学院 5 nt
+海南戏 3 n
+海南日报 3 nz
+海南游 3 nr
+海南特别 3 ns
+海南特区 4 ns
+海南省 548 ns
+海南省政府 2 nt
+海南省旅游局 19 nt
+海南经济特区 5 nt
+海南网 3 nz
+海南航空公司 13 nt
+海南藏族自治州 7 ns
+海卡尔 3 nr
+海印 104 n
+海厄特 3 nrt
+海原 22 ns
+海原县 13 ns
+海参 351 n
+海参威 3 nr
+海参崴 40 nr
+海口 474 s
+海口市 122 ns
+海口机场 5 n
+海员 106 n
+海味 30 n
+海味山珍 3 nz
+海和会 3 nt
+海哩 3 nr
+海商 5 n
+海商法 26 n
+海商王 3 nz
+海啸 187 n
+海啸山崩 3 nr
+海喷火 4 nr
+海因 10 n
+海因斯 4 nr
+海因策 10 nr
+海因茨 5 nrt
+海因里希 65 nrt
+海国 9 ns
+海图 77 n
+海地 225 s
+海地人 6 n
+海地共和 3 ns
+海埂 6 ns
+海城 100 ns
+海城人 7 nrt
+海城区 3 ns
+海城市 12 ns
+海城镇 3 ns
+海埔 3 ns
+海域 1521 n
+海域偶 3 n
+海基 72 nz
+海基会 21 nt
+海基型 4 nz
+海基导弹 11 n
+海基核 5 nr
+海堤 34 n
+海塘 54 ns
+海塞 2 n
+海塞尔 3 nr
+海墁天花 3 v
+海外 2672 s
+海外侨胞 3 n
+海外关系 3 l
+海外剧场 3 n
+海外华人 3 n
+海外基金 3 nz
+海外奇谈 5 nz
+海外学人 3 n
+海外投资 3 j
+海外版 25 n
+海外经营 3 n
+海外部 5 nt
+海大 117 nz
+海大富 3 nz
+海天 38 nz
+海天一色 3 i
+海天亮 5 nr
+海夫纳 3 nr
+海奎特 2 nr
+海奠峡 2 nr
+海姆 25 nrt
+海子 107 n
+海子卦 2 nr
+海子湖 3 nr
+海子石 3 nr
+海子边 2 nr
+海宁 216 ns
+海宁县 3 ns
+海宁市 9 ns
+海宁路 3 ns
+海安 49 nz
+海安县 8 ns
+海客 65 n
+海宴 5 n
+海寇 9 n
+海富 12 nz
+海富通 3 nr
+海将士 2 nr
+海尔 230 nrt
+海尔斯 2 nrt
+海尔曼 4 nr
+海尔波普 3 nrt
+海尔集团 21 nt
+海尾添筹 3 i
+海屋添筹 3 i
+海屋筹添 3 nr
+海山 48 ns
+海山国中 3 nz
+海岛 313 ns
+海岛县 3 ns
+海岛型 3 n
+海岛棉 3 ns
+海岩 5 n
+海岭 174 ns
+海岱 4 nrfg
+海岸 1622 s
+海岸公路 3 n
+海岸带 50 n
+海岸线 600 n
+海岸边 15 n
+海岸阶地 3 n
+海峡 1629 ns
+海峡两岸 3 n
+海峡两岸关系协会 8 nt
+海峡交流基金会 6 nt
+海峡西岸 3 ns
+海峰 11 n
+海州 51 ns
+海州区 3 ns
+海州卫 2 nr
+海州弘 2 nr
+海州湾 29 ns
+海巡 16 nr
+海市 19 ns
+海市蜃楼 95 i
+海布 65 n
+海布利 33 ns
+海布里 3 nrt
+海带 133 n
+海带丝 3 n
+海平线 8 nz
+海平面 196 n
+海庄村 3 nr
+海床 28 nz
+海底 1658 s
+海底城 3 ns
+海底捞月 4 n
+海底捞针 3 n
+海底隧道 3 n
+海康 2 nz
+海康县 3 ns
+海廷加 2 nr
+海弯 3 n
+海归 3 ns
+海归派 3 n
+海得尔 2 nr
+海得拉巴 20 ns
+海德 26 nrt
+海德公园 10 nr
+海德堡 145 nr
+海德堡大 3 ns
+海德尔 14 nr
+海德拉巴 6 nrt
+海德格尔 22 nrt
+海德里希 9 nrt
+海志 3 n
+海志强 39 nr
+海怀霞想 3 nr
+海怪 3 n
+海恩豪森 2 nr
+海慈航 2 nr
+海成阶 3 nr
+海战 394 nz
+海扁 3 nr
+海扇 5 n
+海扬托 5 nr
+海报 229 n
+海报设计 3 n
+海拉姆 2 nrt
+海拉尔 52 nr
+海拉尔区 3 ns
+海拉尔市 13 ns
+海拉尔河 28 ns
+海拔 5345 n
+海拔高度 3 nr
+海捕 3 n
+海损 43 vn
+海损保险 3 n
+海损鉴定 3 n
+海政 2 n
+海文 5 nz
+海斯 57 ns
+海斯凯 3 nr
+海斯法 2 nz
+海昌 3 ns
+海明威 55 nr
+海星 58 nz
+海晏 3 nr
+海晏县 6 ns
+海晏堂 2 nr
+海晏河清 5 ns
+海景 40 n
+海景房 3 n
+海景画 3 n
+海曙区 2 nr
+海曲 3 n
+海月 9 nz
+海月水母 5 nz
+海权 10 n
+海杆 3 n
+海松 2 n
+海林 3 nz
+海林县 3 ns
+海林市 3 ns
+海林檎 2 nr
+海林镇 2 nr
+海枣 3 n
+海枯石烂 15 i
+海枯见底 3 i
+海柯尔 7 nr
+海柳 17 n
+海柳船 12 nr
+海柿树 2 nr
+海标 2 n
+海格 4 n
+海格特 4 nr
+海格立 12 nr
+海格立斯 7 nr
+海桐 3 n
+海桐皮 3 n
+海桐花 3 nr
+海桑陵谷 3 ns
+海棉 3 n
+海棠 167 n
+海棠树 10 n
+海棠花 24 n
+海森伯 42 nr
+海森堡 17 nr
+海椒 3 n
+海槽 4 n
+海樽纲 2 nr
+海正药业 2 nz
+海氏电桥 3 nz
+海民 26 n
+海民哥 2 n
+海气 106 n
+海水 1590 n
+海水不可 3 i
+海水桑田 3 ns
+海水泥浆 3 n
+海水浴 8 nr
+海水浴场 3 n
+海水群飞 3 nr
+海水蓝 3 nr
+海水难量 3 n
+海水面 8 n
+海水鱼 3 n
+海沙 70 ns
+海沟 201 ns
+海沧 12 ns
+海沧区 3 ns
+海河 242 ns
+海河平原 12 ns
+海河湾村 3 ns
+海沸山崩 3 i
+海沸山摇 3 i
+海沸山裂 3 i
+海沸江翻 3 i
+海沸河翻 3 i
+海沸波翻 3 i
+海油 2 n
+海泉湾 4 ns
+海法 16 n
+海法吉 2 nr
+海泡石 13 nr
+海波 28 n
+海洋 4068 ns
+海洋公园 3 n
+海洋卫星 3 nz
+海洋大学 3 nt
+海洋学 87 nt
+海洋学家 29 n
+海洋学院 3 nt
+海洋局 2 nt
+海洋工程 3 n
+海洋性 107 n
+海洋性气 3 n
+海洋性气候 176 l
+海洋所 8 nt
+海洋权 3 n
+海洋权益 3 n
+海洋气候 3 n
+海洋污染 3 nz
+海洋法 71 n
+海洋渔业 3 nt
+海洋环境 3 l
+海洋生物 157 nt
+海洋能 20 n
+海洋资源 3 n
+海洋间 3 n
+海洋预报 3 nt
+海洋馆 3 nt
+海洛因 124 nrt
+海洛夫 3 nr
+海洛夫斯 3 nrt
+海洛英 3 nr
+海洞 9 n
+海洲 2 ns
+海派 55 n
+海流 170 n
+海流图 5 n
+海流图乡 8 ns
+海测船 2 n
+海浪 229 nz
+海浪声 3 n
+海浪滔天 3 i
+海浪般 3 l
+海浬 3 vn
+海浮石 3 nr
+海海 3 ns
+海涂 29 n
+海涅 41 nrt
+海涅曼 5 nr
+海涌 20 nz
+海涛 32 nr
+海涯天角 3 nz
+海涵 29 n
+海涵地负 3 n
+海涸石烂 3 nr
+海淀 103 ns
+海淀区 207 ns
+海淀区政府 3 nt
+海淀园 3 ns
+海淀法院 24 nt
+海淀走读大学 3 n
+海淀队 3 nt
+海深 3 n
+海温 5 n
+海港 420 ns
+海港区 2 nt
+海湾 859 ns
+海湾合作委员会 3 nt
+海湾地区 66 ns
+海湾大桥 2 ns
+海湾战争 239 nz
+海源阁 8 nr
+海滋 10 ns
+海滨 488 ns
+海滨公园 3 ns
+海滨公路 3 nt
+海滨城 3 ns
+海滨晨曦 3 nr
+海滨沼泽 3 nr
+海滨浴场 3 nz
+海滩 460 ns
+海滩装 3 nz
+海滩鞋 3 nz
+海漫 2 n
+海潮 157 n
+海潮路 3 nz
+海澄公 6 nr
+海炮 2 n
+海熊 2 n
+海燕 87 nr
+海爱琴 3 nr
+海牙 151 ns
+海牙公约 3 ns
+海牙国际法庭 6 nt
+海牛 61 nz
+海特 3 nrt
+海特勒 7 nr
+海狗 15 n
+海狗肾 3 n
+海狮 69 nz
+海狸 17 n
+海狸鼠 6 n
+海狼 59 n
+海猪 2 n
+海猿 3 n
+海獭 33 n
+海王 55 nrt
+海王星 82 nr
+海王星辰 4 nr
+海珍品 13 n
+海珠 11 n
+海珠区 10 ns
+海珠屿 2 n
+海瑞 403 nz
+海瑞之 3 nr
+海瑞兄 3 nr
+海瑞公园 2 nr
+海瑞斯 2 nr
+海瑞罢官 3 nz
+海瓜子 3 n
+海生 91 n
+海生植物 3 l
+海田 4 nz
+海畔练 2 nr
+海疆 45 ns
+海登 2 nrt
+海登斯 2 nr
+海登海 2 nr
+海百合 24 nr
+海皇 2 n
+海盆 253 n
+海盐 128 n
+海盐县 19 ns
+海盗 445 n
+海盗号 7 n
+海盗旗 3 n
+海盗版 3 n
+海盗王 3 nz
+海盗船 15 n
+海盗行为 3 n
+海盘车 3 n
+海盛 9 nz
+海盟山咒 3 n
+海相 63 n
+海相沉积 33 l
+海石 4 n
+海石花 17 n
+海砂 2 n
+海碗 31 n
+海神 118 n
+海神号 3 n
+海神庙 19 nr
+海神节 7 n
+海禁 69 n
+海福元 6 nr
+海秀路 3 nr
+海科 4 nz
+海程 3 n
+海空 97 s
+海空军 59 nt
+海空运 3 n
+海立云垂 3 nr
+海立云重 3 nr
+海端 3 n
+海笋 2 n
+海米 9 q
+海红 6 nz
+海约 7 n
+海约山盟 3 nt
+海纳 15 ns
+海纳百川 10 nr
+海纳通 6 nr
+海线 3 n
+海绵 173 n
+海绵体 25 n
+海绵垫 3 n
+海绵状 27 n
+海绵田 3 nr
+海绵铁 2 nr
+海绿石 15 nr
+海缆 49 n
+海群生 6 nr
+海翻江 2 nr
+海老公 65 nr
+海老清 118 nr
+海耶克 3 nr
+海耶斯 3 nr
+海联 2 ns
+海胆 80 n
+海脊 2 n
+海舟 3 nz
+海航 90 j
+海舶 3 n
+海船 129 n
+海芋 2 n
+海苔 3 n
+海茨 2 nrt
+海草 19 n
+海药 6 n
+海菊蛤 4 nr
+海菜 3 n
+海菲棕 2 nr
+海萍叹 2 nr
+海萍吓 2 nr
+海萍妈 19 nr
+海萍怒 2 nr
+海萍摇 2 nr
+海萍白 2 nr
+海萍笑笑 2 nr
+海萍蹬 2 nr
+海萍连 2 nr
+海葬 7 n
+海葵 44 n
+海蓝色 7 n
+海蕾 2 n
+海藻 2007 n
+海藻类 3 n
+海虎绒 2 nr
+海虹 20 nz
+海虾 8 n
+海蚀 82 nz
+海蚀作用 3 n
+海蚀台 3 n
+海蚀崖 3 n
+海蚀柱 3 n
+海蚀洞 3 n
+海蚀龛 3 n
+海蛆 3 n
+海蛇 75 n
+海蛎 2 n
+海蛎子 3 nr
+海蛤壳 3 n
+海蜇 45 n
+海蜇头 3 n
+海蜇皮 11 n
+海蜒 3 n
+海蝶 3 n
+海螵蛸 4 n
+海螺 68 n
+海螺沟 6 ns
+海螺集团 2 n
+海蟹 8 n
+海西 41 ns
+海西侯 2 nr
+海西州 3 ns
+海西征 2 nr
+海西期 2 n
+海西蒙古族藏族自治州 18 ns
+海角 77 n
+海角天涯 7 n
+海角天隅 3 n
+海誓 3 n
+海誓山盟 17 i
+海警 11 n
+海训 3 n
+海豆芽 6 nr
+海豚 162 n
+海豚泳 3 vn
+海豚音 3 vn
+海象 78 n
+海豹 217 nz
+海貍 3 vn
+海贝 20 n
+海贝形 3 nz
+海贝格 10 nz
+海货 3 n
+海费茨 2 nrt
+海贼 8 n
+海贼团 3 n
+海贼王 3 n
+海赛木 3 nr
+海路 104 n
+海轮 170 n
+海边 564 s
+海达 5 nz
+海达尔 3 nr
+海运 443 n
+海运业 12 nz
+海运仓 3 nz
+海运公司 3 nt
+海运局 3 nt
+海运界 3 nz
+海运费 3 nz
+海连义 12 nr
+海迷失 8 l
+海迹湖 2 nr
+海选 59 n
+海通 38 nz
+海造陆 5 n
+海道 62 n
+海道南 2 ns
+海部 39 n
+海部俊树 11 nr
+海里 856 s
+海量 48 n
+海金 2 n
+海金伯 6 nr
+海金刚 6 nr
+海金沙 5 nr
+海金砂 3 n
+海鑫铝 6 nz
+海错江瑶 3 ns
+海锚 3 n
+海长松 14 nr
+海门 51 n
+海门县 7 ns
+海门市 3 ns
+海门镇 4 ns
+海闻 4 n
+海阎王 3 nr
+海阔云舒 3 nr
+海阔凭鱼跃 6 i
+海阔天空 28 i
+海阔天高 3 nr
+海防 350 n
+海防区 3 n
+海防林 3 n
+海防港 3 n
+海防线 2 n
+海防部队 3 nt
+海阳 8 ns
+海阳县 2 ns
+海阳市 3 ns
+海陆 178 s
+海陆丰 3 nz
+海陆交 10 n
+海陆军 4 nt
+海陆珍 16 nr
+海陆空 60 n
+海陆风 5 n
+海陵 31 ns
+海陵区 16 ns
+海陵王 28 nr
+海陵郡 2 nr
+海隅 3 nrt
+海难 69 n
+海雀 2 n
+海雕 5 n
+海雷达 3 nr
+海雾 3 n
+海震 4 nr
+海霸王 3 nr
+海青圆 2 nr
+海靖 2 nz
+海面 961 n
+海鞘 38 n
+海韵 4 n
+海顺 4 nz
+海顿 46 ns
+海风 150 n
+海风藤 3 nr
+海飞丝 3 nr
+海香亭 110 nr
+海马 90 ns
+海马牌 2 nz
+海马结构 3 n
+海驴 3 n
+海鬼 3 n
+海魂 2 n
+海魂衫 3 n
+海鱼 48 n
+海鲁 7 nz
+海鲁拉耶夫 6 nrt
+海鲁洛耶夫 2 nrt
+海鲜 174 ns
+海鲜城 3 ns
+海鲜大餐 3 n
+海鲜店 3 nz
+海鲜楼 3 ns
+海鲜类 3 nz
+海鲜酒楼 3 n
+海鲷 3 n
+海鳃 3 n
+海鳅 3 n
+海鳗 10 n
+海鸟 60 n
+海鸠 2 nrt
+海鸥 91 n
+海鸥大 3 nr
+海鸥飞处 3 nr
+海鹞 28 n
+海鹫 3 n
+海鹰 108 nz
+海黎 2 ns
+海默氏 7 nr
+海默病 5 nr
+海龙 80 nz
+海龙王 24 nr
+海龟 123 n
+浸 569 v
+浸于 3 v
+浸会 6 v
+浸信会 3 nz
+浸信教 3 nz
+浸入 106 v
+浸出 41 v
+浸出法 4 vn
+浸出液 3 n
+浸出物 12 n
+浸到 3 v
+浸剂 3 nz
+浸厚 3 v
+浸取 18 v
+浸完 3 v
+浸微浸天 3 n
+浸提 4 v
+浸染 160 v
+浸染法 3 n
+浸水 29 v
+浸沉 3 v
+浸没 25 v
+浸没物镜 3 n
+浸泡 299 v
+浸泡液 2 nz
+浸洗 3 v
+浸浴 3 v
+浸润 176 v
+浸润性 3 n
+浸液 3 n
+浸淫 26 v
+浸渍 26 v
+浸渍者 3 n
+浸湎 3 v
+浸湿 93 v
+浸溢 3 v
+浸溶 3 v
+浸礼 16 v
+浸礼会 4 n
+浸种 9 v
+浸膏 6 nz
+浸蚀 8 v
+浸融 3 n
+浸软 3 v
+浸过 3 v
+浸透 229 v
+浸遍 3 v
+浸酒 3 v
+浼 949 zg
+涂 1449 v
+涂上一层 3 n
+涂上润 2 nr
+涂乙 3 nr
+涂九轨 2 nr
+涂写 6 v
+涂到 3 v
+涂刷 16 v
+涂勇则 2 nr
+涂华芬 2 nr
+涂去 3 v
+涂善妮 3 nr
+涂填 2 v
+涂好 3 v
+涂尔干 2 nr
+涂层 63 n
+涂山 26 nr
+涂山之 2 nr
+涂山氏 7 nr
+涂布 12 v
+涂布机 3 nr
+涂布纸 3 n
+涂得红 2 nr
+涂志刚 2 nr
+涂成 3 v
+涂抹 236 nr
+涂抹剂 3 v
+涂掉 3 v
+涂改 60 v
+涂改无效 3 i
+涂改液 4 nr
+涂敷 10 nr
+涂敷法 2 nr
+涂文辅 2 nr
+涂料 559 n
+涂料厂 3 n
+涂料网 3 n
+涂有 3 v
+涂有防 2 nr
+涂机 2 n
+涂来涂去 3 i
+涂染 3 v
+涂梢允 5 nr
+涂梢员 3 nr
+涂梢宰 2 nr
+涂梢悦 2 nr
+涂梢栽 3 nr
+涂梢源 2 nr
+涂梢粤 4 nr
+涂梢苑 4 nr
+涂梢蕴 3 nr
+涂梢韵 3 nr
+涂歌巷舞 3 i
+涂歌邑诵 3 nr
+涂歌里咏 3 n
+涂污 5 v
+涂油 3 n
+涂油膏 3 n
+涂泥 2 n
+涂泽 3 nr
+涂涂改改 3 i
+涂消 3 v
+涂满涂 3 nr
+涂漆 20 n
+涂潭 3 nr
+涂炭 33 n
+涂炭生灵 3 n
+涂片 55 n
+涂画 3 n
+涂眼影 2 nr
+涂祯刊 2 nr
+涂窜 3 v
+涂粉 3 n
+涂绘 3 v
+涂胶 3 n
+涂胶机 3 n
+涂脂 3 n
+涂脂抹粉 24 i
+涂膜 6 n
+涂色 5 n
+涂色板 3 n
+涂节 2 n
+涂药 3 n
+涂蛋白 3 nr
+涂蜡 3 n
+涂装 28 v
+涂装线 3 n
+涂覆 6 nr
+涂过 3 v
+涂过去 3 v
+涂过来 3 nr
+涂销 3 v
+涂长望 258 nr
+涂门 3 n
+涂饰 18 v
+涂鸦 25 n
+涂鸦板 3 nz
+涂鸭 3 n
+涂黎曼 256 nr
+涂黑 8 nr
+涅 649 ng
+涅夫斯基 9 nrt
+涅姆佐夫 5 nrt
+涅斯捷鲁什金 2 nrt
+涅斯特河 3 ns
+涅曼河 13 ns
+涅槃 3 ns
+涅波 6 ns
+涅涅茨 3 nrt
+涅瓦 5 nrt
+涅瓦河 13 ns
+涅白 3 ns
+涅盘 3 ns
+涅米 2 nrt
+涅米宁 17 nrt
+消 1673 v
+消业 10 n
+消亡 276 v
+消停 126 v
+消像 3 n
+消光 24 n
+消光系数 3 l
+消减 64 v
+消力池 6 n
+消化 1444 vn
+消化不良 3 l
+消化力 5 n
+消化吸收 3 l
+消化器 3 n
+消化器官 3 n
+消化性 16 n
+消化液 3 n
+消化率 18 n
+消化科 19 n
+消化管 3 n
+消化系 9 n
+消化系统 108 l
+消化腺 32 n
+消化道 231 n
+消化酶 22 n
+消协 28 v
+消却 3 vn
+消卸 3 vn
+消去 3 v
+消去法 3 n
+消受 55 v
+消声 31 n
+消声匿影 3 n
+消声匿迹 4 n
+消声器 34 l
+消声坑 3 n
+消声室 3 n
+消声灭迹 3 n
+消夏 41 n
+消夜 21 n
+消失 3067 n
+消失下去 3 l
+消失掉 3 v
+消失模 3 l
+消委 3 n
+消委会 2 n
+消导药 4 n
+消弥 3 n
+消弭 57 v
+消得 3 v
+消得人 3 n
+消心痛 3 n
+消息 9926 n
+消息中间件 3 l
+消息人士 3 n
+消息传递 5 l
+消息儿 7 n
+消息压缩 3 l
+消息报 57 vn
+消息日志 3 n
+消息来源 3 n
+消息灵通 50 n
+消息盈冲 3 n
+消息盈虚 3 n
+消息闭塞 3 n
+消息面 3 n
+消愁 9 v
+消损 3 vn
+消掉 3 v
+消散 198 v
+消旋 66 n
+消旋天线 3 n
+消晕作用 3 l
+消暑 23 v
+消极 795 n
+消极因素 3 n
+消极影响 3 n
+消极态度 3 n
+消极思想 3 n
+消极怠工 33 l
+消极性 5 n
+消极悲观 3 l
+消极情绪 3 n
+消极隔振 3 l
+消极面 10 n
+消歇 3 v
+消毁 3 v
+消毒 543 vn
+消毒剂 48 n
+消毒器 3 n
+消毒学 2 n
+消毒室 3 n
+消毒机 3 n
+消毒柜 18 n
+消毒水 5 n
+消毒液 21 n
+消毒片 3 n
+消毒碗柜 3 n
+消毒药 5 n
+消毒药水 3 n
+消气 39 n
+消水肿 3 n
+消沈 3 j
+消沉 131 v
+消法 22 n
+消泡剂 15 n
+消泯 3 l
+消消 3 v
+消消气 3 n
+消渴 19 v
+消溶 6 n
+消火栓 6 n
+消火栓箱 3 n
+消灭 2189 v
+消灭定理 3 n
+消灾 3 vn
+消炎 114 n
+消炎剂 3 n
+消炎片 3 n
+消炎痛 3 n
+消炎类 3 n
+消炎药 12 n
+消烟 2 n
+消痛贴 3 n
+消痰 11 v
+消瘦 208 a
+消着 3 v
+消石灰 3 n
+消磁 5 n
+消磁器 3 n
+消磨 146 v
+消磨岁月 3 n
+消磨时光 3 n
+消禁 3 v
+消纳 3 v
+消耗 1311 n
+消耗品 3 n
+消耗型 2 n
+消耗性 17 n
+消耗战 32 n
+消耗掉 3 l
+消耗标准 3 n
+消耗热 2 n
+消耗率 13 n
+消耗量 58 n
+消肿 114 n
+消肿剂 3 n
+消肿止痛 3 l
+消肿药 3 l
+消色差 3 n
+消蚀 4 v
+消融 111 n
+消融区 3 n
+消融术 4 n
+消解 154 v
+消费 5133 vn
+消费主义 33 n
+消费信贷 3 n
+消费力 17 n
+消费合作 3 n
+消费品 1158 n
+消费国 23 n
+消费型 7 n
+消费基金 3 n
+消费层 2 n
+消费市场 3 n
+消费性 11 n
+消费机 3 n
+消费水平 3 n
+消费点 2 n
+消费率 4 n
+消费税 39 n
+消费类 20 n
+消费结构 3 n
+消费群 19 n
+消费者 3140 n
+消费行为 3 n
+消费观 7 n
+消费观念 3 n
+消费资料 190 n
+消费量 93 n
+消费额 13 n
+消退 192 v
+消逝 158 vn
+消遣 223 v
+消遣性 2 n
+消遥 3 a
+消遥自在 3 l
+消释 54 v
+消长 90 n
+消闲 35 vn
+消防 259 n
+消防产品 3 n
+消防人 3 n
+消防人员 3 n
+消防员 4 n
+消防器材 3 n
+消防处 2 n
+消防大队 3 n
+消防安全 3 l
+消防官兵 3 n
+消防局 9 n
+消防工作 3 n
+消防工程 3 n
+消防支队 3 n
+消防栓 4 n
+消防梯 3 n
+消防水带 3 n
+消防法 3 n
+消防泵 3 n
+消防演习 3 n
+消防炮 3 n
+消防用水 3 n
+消防电梯 3 n
+消防立管 3 n
+消防站 3 n
+消防系统 3 l
+消防网 3 n
+消防船 3 n
+消防艇 2 n
+消防设备 3 n
+消防设施 3 n
+消防车 18 n
+消防车库 3 n
+消防通道 3 n
+消防队 24 n
+消防队员 8 n
+消防龙头 3 n
+消除 2306 v
+消除器 2 n
+消除矛盾 3 l
+消除隐患 3 l
+消除隔阂 3 n
+消隐 15 v
+消雾 4 n
+消音 11 n
+消音器 9 n
+消食 40 n
+消食片 3 n
+消食甜酒 3 vn
+消魂 14 n
+涉 806 v
+涉世 22 v
+涉世不深 3 i
+涉世未深 3 i
+涉事 3 v
+涉企 2 n
+涉农 14 v
+涉危履险 3 i
+涉县 13 ns
+涉及 3734 v
+涉及面 77 n
+涉外 285 v
+涉外企业 3 n
+涉外单位 3 v
+涉外婚姻 3 n
+涉外工作 3 n
+涉外活动 3 v
+涉外经济 3 n
+涉嫌 269 v
+涉嫌人 3 vn
+涉嫌犯罪 3 n
+涉嫌者 3 r
+涉密 23 v
+涉枪 3 v
+涉案 101 v
+涉案人 4 n
+涉案人员 18 n
+涉案者 3 n
+涉毒 3 v
+涉水 142 v
+涉水而行 3 i
+涉水而过 3 i
+涉水过河 3 n
+涉海 3 ns
+涉海登山 3 ns
+涉猎 105 v
+涉禽 15 n
+涉税 5 v
+涉税案 3 n
+涉笔 3 v
+涉笔成趣 2 n
+涉累 3 v
+涉网 3 v
+涉览 3 v
+涉讼 12 vn
+涉赌 3 v
+涉足 340 v
+涉足于 3 v
+涉足其间 3 i
+涉足花丛 3 n
+涉过 3 v
+涉险 52 v
+涉黄案 3 n
+涌 2219 v
+涌上 3 v
+涌上去 3 v
+涌上心来 3 v
+涌上来 3 v
+涌入 260 v
+涌出 461 v
+涌出去 3 v
+涌出来 3 v
+涌动 196 v
+涌去 3 v
+涌向 3 v
+涌塞 3 v
+涌往 3 v
+涌来 3 v
+涌水量 32 n
+涌泉 66 n
+涌泉寺 9 ns
+涌泉相报 3 n
+涌泉穴 3 n
+涌流 46 v
+涌浪 33 v
+涌溪 2 ns
+涌潮 20 v
+涌现 1514 v
+涌现出 3 v
+涌袭 3 v
+涌起 118 v
+涌进 94 v
+涌进去 3 v
+涌进来 3 v
+涌霞 3 n
+涎 172 n
+涎水 29 n
+涎沫 6 n
+涎液 3 n
+涎玉沫珠 3 n
+涎皮涎脸 3 i
+涎皮赖脸 3 n
+涎眉邓眼 3 v
+涎着脸 17 i
+涎石 3 n
+涎石病 3 n
+涎管 3 n
+涎管炎 3 n
+涎管狭窄 3 v
+涎脸涎皮 3 i
+涎脸饧眼 3 v
+涎腺化生 3 n
+涎腺囊肿 3 n
+涎腺增生 3 n
+涎腺炎 3 n
+涎腺瘘 3 n
+涎腺融合 3 n
+涎言涎语 3 i
+涑 155 g
+涑水 11 ns
+涑水河 8 ns
+涒 16 zg
+涓 12958 z
+涓埃 3 n
+涓埃之力 3 i
+涓子 3 n
+涓流 3 n
+涓涓 43 z
+涓涓细流 3 v
+涓滴 26 z
+涓滴不漏 3 i
+涓滴不遗 3 i
+涓滴之劳 3 i
+涓滴归公 2 i
+涓滴微利 3 n
+涓滴成河 3 i
+涔 3116 g
+涔涔 3 z
+涔涔然 3 z
+涕 88 zg
+涕泗 3 n
+涕泗交下 3 n
+涕泗交流 3 n
+涕泗横流 3 n
+涕泗流涟 3 n
+涕泗滂沱 3 ns
+涕泗滂沲 3 z
+涕泗纵横 3 i
+涕泣 27 v
+涕泪 53 n
+涕泪交下 3 i
+涕泪交加 3 i
+涕泪交垂 3 n
+涕泪交流 3 i
+涕泪交集 3 i
+涕泪交零 3 i
+涕泪滂沱 3 ns
+涕零 4 v
+涕零如雨 3 i
+涖 83 zg
+涗 318 zg
+涘 695 zg
+涙 276 zg
+涚 224 zg
+涛 480 nr
+涛声 45 n
+涛澜 2 n
+涜 168 zg
+涝 166 v
+涝地 3 n
+涝坝 3 n
+涝害 8 n
+涝患 3 n
+涝情 3 n
+涝池 24 n
+涝河桥 3 n
+涝洼 2 n
+涝洼塘 3 n
+涝灾 11 n
+涞 270 g
+涞水 14 ns
+涞水县 9 ns
+涞源 5 ns
+涞源县 10 ns
+涟 383 ns
+涟水 29 ns
+涟水县 5 ns
+涟波 3 ns
+涟涟 22 z
+涟源 10 n
+涟源市 4 ns
+涟漪 56 n
+涠 60 g
+涡 209 n
+涡扇 63 n
+涡旋 55 n
+涡旋式 3 n
+涡旋形 3 n
+涡桨 37 n
+涡河 19 ns
+涡流 78 n
+涡流损耗 3 n
+涡线 3 n
+涡虫 14 n
+涡街 2 n
+涡轮 491 n
+涡轮发动 3 n
+涡轮喷气 3 n
+涡轮引擎 3 n
+涡轮机 44 n
+涡轮轴发 3 n
+涡轮钻具 3 n
+涡阳 8 ns
+涡阳县 3 ns
+涢 267 zg
+涢水 3 vn
+涣 168 v
+涣发大号 3 i
+涣如冰释 3 i
+涣尔冰开 3 i
+涣散 140 v
+涣汗大号 3 i
+涣然 3 v
+涣然一新 3 i
+涣然冰释 3 i
+涣若冰消 3 i
+涣若冰释 3 i
+涤 120 ng
+涤卡 10 n
+涤地无类 3 n
+涤故更新 3 n
+涤棉 16 n
+涤棉布 3 n
+涤棉纱 3 n
+涤浊扬清 3 n
+涤瑕蹈隙 3 n
+涤私愧贪 3 vn
+涤秽布新 3 nz
+涤秽荡瑕 3 z
+涤纶 75 n
+涤纶丝 3 n
+涤纶厂 2 n
+涤纶布 3 n
+涤纶纱 3 n
+涤荡 10 v
+涤除 3 v
+润 1690 v
+润丝 3 nz
+润五 2 n
+润化 3 vn
+润唇膏 3 n
+润喉 21 n
+润喉片 3 nz
+润嗓 3 n
+润屋润身 3 n
+润州 80 ns
+润州区 3 ns
+润扬 34 v
+润格 3 n
+润泽 60 n
+润泽有光 3 n
+润湿 35 nz
+润湿剂 8 nz
+润湿力 3 n
+润湿器 3 nz
+润湿性 17 n
+润滑 142 v
+润滑剂 70 nz
+润滑性 8 n
+润滑油 117 n
+润滑油脂 3 n
+润滑润色 3 n
+润滑液 3 n
+润滑脂 11 n
+润燥 27 n
+润物无声 6 nz
+润物细无声 8 n
+润笔 4 n
+润笔费 3 nz
+润肠 3 n
+润肤 33 n
+润肤乳 3 nz
+润肤油 3 nz
+润肤霜 10 nz
+润肤露 3 nz
+润肺 51 n
+润色 48 n
+润资 3 vn
+润身 3 n
+润迅 3 nz
+润饰 7 n
+涧 326 ng
+涧口 3 ns
+涧头 3 ns
+涧水 3 ns
+涧沟 3 ns
+涧流 3 ns
+涧溪 3 ns
+涧磁村 2 ns
+涧西区 2 ns
+涨 2090 v
+涨价 251 n
+涨价归公 3 n
+涨停 490 v
+涨停板 44 n
+涨出 3 v
+涨到 3 v
+涨势 67 n
+涨升 3 v
+涨回 3 v
+涨回去 3 n
+涨回来 3 n
+涨大 3 j
+涨大起来 3 v
+涨工资 3 n
+涨幅 954 n
+涨成 3 v
+涨水 36 n
+涨法 3 n
+涨涨 3 v
+涨涨跌跌 3 n
+涨满 3 v
+涨潮 78 n
+涨潮水位 3 n
+涨率 3 n
+涨红 3 n
+涨红了脸 3 n
+涨落 101 v
+涨落起伏 3 v
+涨起 3 v
+涨起来 3 v
+涨跌 58 v
+涨跌互现 3 j
+涨跌互见 3 n
+涨跌幅 39 j
+涨过了头 3 v
+涨钱 2 n
+涨风 3 n
+涩 321 a
+涩于言论 3 n
+涩味 9 n
+涩女郎 3 n
+涩滞 10 v
+涩缩 3 v
+涩谷 3 nrt
+涪 68 ns
+涪城 18 ns
+涪城区 3 ns
+涪江 30 ns
+涪陵 150 ns
+涪陵区 5 ns
+涪陵市 6 ns
+涫 65 g
+涮 115 v
+涮洗 3 v
+涮涮锅 3 v
+涮羊肉 23 n
+涮锅 3 n
+涮锅子 3 n
+涯 124 ng
+涯子 3 nz
+涯际 3 nz
+液 1669 ng
+液下泵 3 n
+液位计 3 n
+液体 1487 n
+液体动力 3 n
+液体化工 3 n
+液体燃料 3 n
+液体状态 3 n
+液体石蜡 10 n
+液体蛇 3 n
+液体钙 3 n
+液冷 11 n
+液剂 3 n
+液力 38 n
+液力传动 3 n
+液化 202 vn
+液化器 3 n
+液化气 22 n
+液化气罐 3 n
+液化气船 5 n
+液化点 3 n
+液压 397 n
+液压件 3 n
+液压工具 3 n
+液压式 3 n
+液压机 14 n
+液压油 9 n
+液压泵 14 n
+液压站 3 n
+液压管线 3 n
+液压缸 3 n
+液压表 3 n
+液压阀 3 n
+液囊 3 n
+液态 241 n
+液态奶 3 n
+液态智力 3 n
+液态氢 13 n
+液态氧 3 n
+液态水 23 n
+液态空气 3 n
+液态窗 3 n
+液晶 434 n
+液晶体 3 n
+液晶屏 3 n
+液晶屏幕 3 v
+液晶彩电 3 n
+液晶显示 34 n
+液晶板 3 n
+液晶模块 3 n
+液晶片 3 n
+液晶电脑 3 n
+液晶电视 3 n
+液晶表 3 n
+液晶面板 3 n
+液果 3 n
+液氢 25 n
+液氦 50 n
+液氧 34 n
+液氧箱 3 n
+液氨 22 n
+液氮 24 n
+液氯 2 nz
+液汁 23 n
+液泡 39 n
+液流 3 n
+液滴 114 n
+液状 10 n
+液相 83 n
+液相色谱仪 4 n
+液硫脱气 3 nz
+液碱 2 n
+液肥 3 n
+液胞膜 3 n
+液膜电极 3 n
+液门 3 n
+液面 65 n
+涳 170 zg
+涵 325 v
+涵义 142 n
+涵养 118 v
+涵养林 8 nr
+涵容 3 n
+涵意 3 v
+涵括 3 v
+涵木 3 n
+涵江 2 nr
+涵江区 3 nr
+涵洞 37 n
+涵盖 642 v
+涵盖面 5 n
+涵管 3 v
+涵育 3 v
+涵蓄 3 n
+涵蕴 2 n
+涵闸 10 n
+涸 93 zg
+涸乾 3 i
+涸思干虑 3 i
+涸泽而渔 5 i
+涸辙之鲋 3 nr
+涸辙枯鱼 3 n
+涸鱼得水 3 i
+涸鲋得水 3 v
+涽 2 zg
+涿 107 ns
+涿县 44 ns
+涿州 139 ns
+涿州市 22 ns
+涿鹿 32 ns
+涿鹿县 13 ns
+淀 118 zg
+淀区 4 n
+淀山湖 23 ns
+淀帚 3 n
+淀积率 3 n
+淀粉 431 n
+淀粉厂 3 n
+淀粉样变 3 n
+淀粉核 3 n
+淀粉类 3 n
+淀粉糖 3 n
+淀粉质 3 n
+淀粉质环 3 n
+淀粉酶 25 n
+淄 60 ns
+淄博 133 ns
+淄博市 99 ns
+淄川 43 ns
+淄川区 6 ns
+淅 60 ns
+淅川 33 ns
+淅川县 2 ns
+淅沥 16 o
+淅沥沥 3 z
+淅淅 3 z
+淅淅沥沥 26 z
+淅飒 3 z
+淆 12 zg
+淆乱 8 v
+淆乱视听 3 vn
+淆惑 3 v
+淆杂 3 v
+淇 432 g
+淇县 20 ns
+淇滨区 3 ns
+淇澳 5 ns
+淉 4 zg
+淋 471 n
+淋冲 3 n
+淋头 3 n
+淋巴 255 n
+淋巴因子 3 n
+淋巴毒素 3 n
+淋巴液 22 n
+淋巴球 3 n
+淋巴瘤 86 n
+淋巴癌 6 n
+淋巴管 73 n
+淋巴细胞 170 n
+淋巴结 223 n
+淋巴结核 3 n
+淋巴结炎 10 n
+淋巴肉 3 n
+淋巴腺 10 n
+淋得 3 v
+淋洒 3 v
+淋洗 23 v
+淋浴 65 n
+淋浴器 7 nz
+淋浴室 6 nz
+淋浴屏 3 nz
+淋浴房 3 n
+淋浴间 3 n
+淋淋 3 n
+淋湿 45 n
+淋溼 3 vn
+淋滤 5 v
+淋漓 195 v
+淋漓尽致 145 i
+淋球菌 3 n
+淋病 41 n
+淋病菌 3 n
+淋菌 3 n
+淋菌性 3 n
+淋证 3 n
+淋过 3 v
+淋透 3 v
+淋雨 18 n
+淌 396 v
+淌凌 3 ns
+淌出 3 nr
+淌口水 3 ns
+淌水 3 ns
+淌汗 3 ns
+淌泪 3 nr
+淌混水 3 nr
+淏 3 zg
+淑 1313 n
+淑人君子 3 n
+淑女 164 n
+淑女型 3 n
+淑女屋 3 n
+淑女装 3 n
+淑女风格 3 n
+淑媛 3 nrt
+淑德 3 nrt
+淑慎 3 n
+淑珍 4 nrt
+淑芳 3 n
+淑英 8 nrt
+淑范 3 n
+淑质英才 3 n
+淑阳镇 2 n
+淑静 3 n
+淒 2 zg
+淖 388 g
+淖尔 3 n
+淘 450 v
+淘井 3 v
+淘宝 3 nz
+淘宝网 3 nz
+淘换 8 v
+淘析 3 v
+淘析转头 3 n
+淘气 136 v
+淘气包 2 n
+淘气堡 3 n
+淘气鬼 4 n
+淘汰 1053 v
+淘汰制 9 n
+淘汰式 5 n
+淘汰法 3 n
+淘汰率 40 n
+淘汰赛 45 n
+淘汰赛制 8 n
+淘沙 3 n
+淘沙取金 3 n
+淘沙得金 3 n
+淘洗 24 v
+淘淘 3 nz
+淘神 3 v
+淘空 3 v
+淘箩 4 n
+淘米 31 n
+淘米水 9 nz
+淘米箩 3 n
+淘选 3 v
+淘选技术 3 n
+淘金 72 n
+淘金汉 3 nz
+淘金热 10 n
+淘金网 3 nz
+淘金者 7 n
+淘金路 3 n
+淙 115 o
+淙淙 311 o
+淙淙流水 3 v
+淛 4 zg
+淝 128 g
+淝河 18 ns
+淞 217 g
+淞沪 3 nr
+淠 59 ns
+淠史杭 14 ns
+淡 1451 a
+淡不上 3 l
+淡入 3 v
+淡入淡出 3 i
+淡兰色 3 n
+淡写轻描 3 n
+淡出 56 v
+淡出淡入 3 i
+淡化 218 n
+淡化处理 3 n
+淡去 7 v
+淡味 3 n
+淡大学生 3 n
+淡如水 3 i
+淡如逝水 3 vn
+淡妆 30 n
+淡妆浓抹 6 i
+淡妆轻抹 3 i
+淡季 112 n
+淡巴巴 3 z
+淡忘 81 v
+淡扫蛾眉 3 i
+淡旺季 4 l
+淡月 15 t
+淡朱 3 n
+淡水 1007 n
+淡水交情 3 n
+淡水区 3 n
+淡水工商 3 n
+淡水河 22 n
+淡水湖 140 n
+淡水镇 4 n
+淡水鱼 1646 n
+淡汝浓抹 3 l
+淡江 3 ns
+淡江大学 3 l
+淡泊 78 n
+淡泊名利 13 ns
+淡泊宁静 3 n
+淡泊寡味 3 l
+淡泊明志 2 ns
+淡淡 536 z
+淡淡地 206 z
+淡淡无味 3 i
+淡淡的 418 z
+淡漠 131 n
+淡灰 6 n
+淡灰色 3 n
+淡然 125 z
+淡然处之 9 i
+淡然置之 3 i
+淡盐水 3 n
+淡竹 5 n
+淡竹叶 3 n
+淡紫 25 b
+淡紫色 34 n
+淡红 73 z
+淡红色 47 n
+淡绿 47 z
+淡绿色 34 n
+淡而不厌 3 i
+淡而无味 3 i
+淡色 28 n
+淡茶 6 n
+淡菜 4 n
+淡蓝 70 z
+淡蓝色 3 n
+淡薄 100 a
+淡装 3 n
+淡褐 3 n
+淡褐色 18 n
+淡豆豉 3 n
+淡酒 13 n
+淡雅 86 z
+淡青 17 z
+淡青色 26 n
+淡食 3 n
+淡饭 3 n
+淡马锡 3 ns
+淡黄 133 z
+淡黄色 3 n
+淤 405 v
+淤地坝 2 n
+淤塞 76 v
+淤斑 2 n
+淤沙 5 n
+淤泥 450 n
+淤浅 3 v
+淤滞 9 v
+淤灌 3 v
+淤积 482 n
+淤血 27 v
+淥 4 zg
+淦 86 zg
+淨 152 zg
+淫 519 ag
+淫业 3 n
+淫乐 33 a
+淫书 3 n
+淫乱 64 a
+淫亵 6 v
+淫佚 3 v
+淫妇 134 n
+淫妹妹 3 n
+淫威 31 n
+淫媒 3 n
+淫巧 3 a
+淫心 15 a
+淫心匿行 3 n
+淫戏 3 n
+淫戒 3 n
+淫暴 3 a
+淫朋密友 3 n
+淫朋狎友 3 vn
+淫棍 3 n
+淫欲 8 n
+淫民 3 n
+淫猥 4 a
+淫画 3 n
+淫秽 85 a
+淫秽内容 3 nz
+淫秽物品 3 nz
+淫秽网 3 vn
+淫笑 3 a
+淫糜 3 n
+淫荡 39 v
+淫荡女 3 n
+淫荡小 3 n
+淫虐 2 a
+淫行 3 v
+淫言媟语 3 n
+淫言狎语 3 v
+淫言诐行 3 n
+淫词 3 n
+淫词亵语 3 v
+淫词秽语 3 v
+淫词艳曲 3 n
+淫词艳语 3 n
+淫语 3 n
+淫贱 3 a
+淫贼 97 n
+淫辞 3 n
+淫辞秽语 3 v
+淫辞邪说 3 vn
+淫辱 4 n
+淫逸 16 a
+淫邪 34 a
+淫雨 9 n
+淫雨成灾 3 n
+淫靡 10 a
+淫风 3 n
+淬 134 zg
+淬勉 3 v
+淬火 103 vn
+淬火炉 3 nz
+淬火装置 3 nz
+淬炼 7 nz
+淬砺 3 vn
+淬透性 10 nz
+淮 1305 ns
+淮剧 4 nz
+淮北 166 ns
+淮北地区 7 ns
+淮北市 12 ns
+淮北新村 3 ns
+淮南 959 ns
+淮南子 76 ns
+淮南市 23 ns
+淮南鸡犬 3 n
+淮城镇 2 ns
+淮夷 3 ns
+淮安 192 ns
+淮安县 3 ns
+淮安市 19 ns
+淮山 4 ns
+淮扬 60 ns
+淮扬菜 3 n
+淮水 3 ns
+淮沭河 10 ns
+淮河 612 ns
+淮河水利委员会 2 nt
+淮河流域 53 ns
+淮河路 3 ns
+淮海 119 ns
+淮海中路 4 ns
+淮海公园 6 ns
+淮海店 3 ns
+淮海戏 3 nz
+淮海战役 133 nz
+淮海路 60 ns
+淮滨 6 ns
+淮滨县 4 ns
+淮王鸡狗 3 nz
+淮阳 88 ns
+淮阳县 5 ns
+淮阴 131 ns
+淮阴区 3 ns
+淮阴县 12 ns
+淮阴市 39 ns
+淯 59 zg
+深 10646 a
+深一步 3 d
+深一脚浅一脚 17 i
+深万科 3 nz
+深不可测 152 i
+深不见底 3 i
+深中冠 2 j
+深中笃行 3 n
+深中隐厚 3 i
+深为 3 v
+深于 3 v
+深井 38 ns
+深井泵 3 nz
+深交 25 v
+深交会 3 j
+深交所 39 j
+深仁厚泽 7 i
+深仇 3 v
+深仇大恨 44 i
+深仇宿怨 3 i
+深仇重怨 3 i
+深信 209 nz
+深信不疑 104 i
+深入 4933 v
+深入人心 127 i
+深入分析 3 l
+深入基层 3 l
+深入实际 3 l
+深入开展 3 i
+深入报导 3 n
+深入探讨 3 i
+深入敌后 3 i
+深入时机 3 l
+深入显出 3 i
+深入浅出 50 i
+深入生活 3 i
+深入研究 3 n
+深入细致 3 i
+深入群众 3 i
+深入膏肓 3 i
+深入虎穴 16 i
+深入调查 3 l
+深入骨髓 3 i
+深兰 3 ns
+深兰色 3 ns
+深冬 14 t
+深冷 5 ns
+深冷分离 3 i
+深凹 3 a
+深切 415 a
+深切体会 3 l
+深切体认 3 i
+深切关怀 3 i
+深切着明 3 i
+深切着白 3 l
+深切著明 3 n
+深切著白 3 n
+深到 3 v
+深刺腧髓 3 v
+深刻 3029 d
+深刻印象 3 n
+深刻反思 3 l
+深刻含义 3 l
+深刻影响 3 i
+深刻思想 3 i
+深刻性 18 n
+深刻理解 3 l
+深刻领会 3 l
+深加 3 v
+深加工 42 nt
+深化 1425 j
+深化改革 3 j
+深南 6 ns
+深南光 2 nz
+深南电 4 j
+深南路 3 ns
+深厉浅揭 3 i
+深厚 1138 a
+深厚感情 3 i
+深县 3 ns
+深发展 52 nt
+深受 1564 v
+深受其害 22 i
+深受感动 3 l
+深受感染 3 i
+深受教育 3 l
+深受苦难 3 i
+深受鼓舞 3 i
+深吸气 3 n
+深吻 6 v
+深呼 3 v
+深呼吸 83 l
+深固 3 a
+深国商 5 nt
+深国投 3 nt
+深图远算 3 i
+深圳 2801 ns
+深圳华侨城 16 ns
+深圳华强 5 nt
+深圳厂 3 nt
+深圳发展银行 24 nt
+深圳四通 3 nt
+深圳大学 6 nt
+深圳市 553 ns
+深圳市中级人民法院 125 nt
+深圳市人大 5 nt
+深圳市人大常委会 2 nt
+深圳市人民政府 2 nt
+深圳市公安局 2 nt
+深圳市投资管理公司 5 nt
+深圳市政府 5 nt
+深圳康佳 5 nt
+深圳指数 3 n
+深圳晚报 3 n
+深圳机场 3 ns
+深圳河 10 ns
+深圳湾 3 ns
+深圳特区 14 ns
+深圳石化化纤有限公司 35 nt
+深圳经济特区 11 nt
+深圳网 3 nt
+深圳股市 3 n
+深圳证券交易所 140 nt
+深圳队 162 nt
+深坑 39 ns
+深坑乡 3 l
+深埋 3 v
+深埋在 3 i
+深基坑 3 ns
+深壁固垒 3 n
+深壑 3 n
+深处 2195 s
+深夜 712 t
+深夜里 3 t
+深奥 154 nz
+深奥莫测 3 nrt
+深奥难懂 3 n
+深奸巨猾 3 i
+深妙 3 a
+深孚众望 4 nz
+深宅大院 25 n
+深室 3 n
+深宫 3 ns
+深宵 15 n
+深层 293 n
+深层格 3 n
+深层次 183 b
+深居 3 v
+深居简出 33 i
+深山 610 ns
+深山中 3 ns
+深山区 11 ns
+深山大泽 3 ns
+深山密林 18 ns
+深山幽谷 4 n
+深山穷林 3 i
+深山穷谷 2 i
+深山老林 65 ns
+深山野墺 3 nz
+深山长谷 3 ns
+深州 16 ns
+深州市 3 ns
+深巨 3 a
+深巷 11 ns
+深市 43 ns
+深幽 3 a
+深广 20 j
+深度 1930 ns
+深度分布 3 nz
+深度加工 3 nz
+深度图 3 nz
+深度基准 3 n
+深度广度 3 ns
+深度知觉 3 i
+深度计 3 nz
+深得人心 9 i
+深得我心 3 i
+深得民心 2 l
+深忧 3 nz
+深念 3 n
+深怀不满 3 i
+深怕 3 a
+深思 225 n
+深思熟虑 128 i
+深思者 3 n
+深思苦索 3 i
+深思远虑 4 i
+深恐 79 a
+深恨 3 v
+深恩 3 ns
+深恶 3 a
+深恶痛嫉 3 i
+深恶痛疾 3 i
+深恶痛绝 123 i
+深恶痛觉 3 i
+深悉 3 v
+深情 449 n
+深情厚意 15 i
+深情厚谊 24 i
+深情底理 3 i
+深情故剑 3 i
+深情款款 3 n
+深惟重虑 3 i
+深意 124 v
+深感 495 a
+深感不便 3 l
+深感不安 3 l
+深感忧虑 3 i
+深憾 3 a
+深成岩 12 nz
+深成指 16 j
+深扃固钥 3 nr
+深挖 21 v
+深挚 29 a
+深振业 2 nz
+深文傅会 3 l
+深文周内 3 n
+深文周纳 2 ns
+深文大义 3 nz
+深文峻法 3 i
+深文曲折 3 i
+深文附会 3 nt
+深施 3 v
+深明 3 nz
+深明大义 47 nz
+深暗 3 a
+深更半夜 75 i
+深有体会 3 nt
+深有同感 3 i
+深有感触 74 l
+深有研究 3 n
+深望 3 v
+深根固本 3 ns
+深根固柢 3 i
+深根固蒂 3 ns
+深根宁极 3 ns
+深根性 10 nz
+深根蟠结 3 i
+深栽 3 v
+深棕色 19 n
+深槽 13 nz
+深橙色 3 nz
+深水 331 ns
+深水港 83 ns
+深水港区 7 ns
+深水炸弹 59 n
+深水稻 3 n
+深水顶超 3 ns
+深沈 3 j
+深沈不露 3 nz
+深沉 463 a
+深沉不露 3 i
+深沟 79 ns
+深沟固垒 3 nz
+深沟墩台 3 n
+深沟壁垒 3 i
+深沟高垒 24 nz
+深沪湾 3 ns
+深泽 3 ns
+深泽县 3 ns
+深浅 167 a
+深浅不同 3 i
+深浓 3 nz
+深海 354 ns
+深海蓝 3 nz
+深海鱼 7 nz
+深涧 102 ns
+深涩 3 a
+深深 1995 b
+深深刻刻 3 i
+深深地 35 i
+深深宝 11 nz
+深深感到 3 l
+深深感动 3 l
+深深房 4 nz
+深深浅浅 13 i
+深渊 307 ns
+深渊峡谷 3 ns
+深港 3 ns
+深湛 132 a
+深潜 19 v
+深潭 3 ns
+深灰 24 n
+深灰色 10 n
+深点 3 n
+深爱 3 a
+深爱着 3 l
+深猷远计 3 nz
+深田恭子 3 nz
+深痕 8 n
+深痛 3 a
+深省 5 ns
+深知 480 v
+深知灼见 3 i
+深秋 114 t
+深究 87 v
+深空 8 s
+深紫 15 a
+深紫色 3 i
+深红 44 b
+深红色 3 n
+深纺织 4 nz
+深综指 3 i
+深绿 26 b
+深绿色 44 n
+深羡 3 v
+深翻 5 v
+深耕 27 v
+深耕细作 3 i
+深能源 5 n
+深致谢意 3 i
+深色 76 n
+深色系列 3 l
+深获 3 v
+深获好评 3 n
+深葬法 3 n
+深蓝 49 b
+深蓝色 70 n
+深蕴 3 ns
+深藏 181 ns
+深藏不露 3 i
+深藏若虚 7 i
+深藏身 3 nz
+深虑 3 v
+深表 92 n
+深表同情 3 n
+深表歉意 3 vn
+深表谢意 3 i
+深表遗憾 3 i
+深褐 3 n
+深褐色 46 n
+深见远虑 3 i
+深觉 3 n
+深言 3 n
+深计远虑 3 i
+深证 25 j
+深识 3 v
+深谈 64 v
+深谋远略 3 i
+深谋远虑 64 i
+深谙 58 v
+深谙此道 3 l
+深谷 341 ns
+深谷为陵 3 ns
+深赛格 6 nz
+深赤湾 8 ns
+深趣 3 a
+深达 121 nz
+深远 1142 a
+深远影响 3 i
+深迷 3 v
+深透 11 nz
+深通 3 nz
+深造 262 v
+深邃 227 a
+深部 102 j
+深醒 3 v
+深重 259 a
+深铭肺腑 3 i
+深长 78 v
+深闭固拒 3 i
+深闭固距 3 n
+深闺 22 n
+深院 3 j
+深陷 209 v
+深雠大恨 3 vn
+深黄 3 j
+深黄色 10 n
+深黑色 3 i
+淳 302 zg
+淳于 39 nrt
+淳于丹 5 nr
+淳于云 5 nr
+淳于意 8 nr
+淳于琼 9 nr
+淳于衍 24 nr
+淳于赏 2 nr
+淳于越 10 nr
+淳于髡 8 nr
+淳佑 3 nz
+淳化 40 nz
+淳化县 3 ns
+淳化史 2 nz
+淳化阁 9 nr
+淳厚 35 a
+淳安 20 nz
+淳安县 10 ns
+淳朴 129 a
+淳熙 54 nz
+淳美 3 nz
+混 2882 v
+混一 3 b
+混上 3 v
+混上去 3 v
+混上来 3 l
+混下 3 v
+混下去 3 l
+混下来 3 l
+混不下去 3 l
+混不开 3 v
+混世 3 n
+混世魔王 31 i
+混为 3 v
+混为一体 3 l
+混为一谈 116 i
+混乱 2004 a
+混乱杂交 3 i
+混乱状态 3 l
+混事 9 n
+混交 31 b
+混交林 240 n
+混住 2 v
+混作 3 vn
+混作一谈 3 i
+混俗和光 3 n
+混倍体 3 n
+混倍性 3 b
+混充 3 v
+混入 249 v
+混全 3 a
+混养 15 v
+混凝剂 3 n
+混凝土 1121 n
+混凝土块 3 n
+混凝土泵 3 n
+混出 3 v
+混出去 3 i
+混出来 3 vn
+混到 3 v
+混匀 9 a
+混双 18 v
+混口饭 3 n
+混口饭吃 3 i
+混吃喝 3 l
+混合 2286 vn
+混合体 25 n
+混合农业 3 b
+混合列车 3 n
+混合制 9 b
+混合区 2 n
+混合双打 3 i
+混合器 3 n
+混合型 56 b
+混合常数 3 n
+混合式 41 b
+混合态 3 n
+混合性 16 b
+混合接头 3 n
+混合机 4 b
+混合材料 3 n
+混合条件 3 n
+混合气 11 n
+混合气体 3 n
+混合油 2 n
+混合法 3 b
+混合泳 46 n
+混合泵 3 n
+混合液 53 n
+混合牙列 3 n
+混合物 320 n
+混合环 3 b
+混合税 2 n
+混合策略 3 n
+混合粉 3 n
+混合系统 2 l
+混合纤维 3 l
+混合经济 3 n
+混合结构 6 n
+混合色 6 b
+混合血清 3 l
+混合输入 3 n
+混合选择 3 l
+混合遗传 3 i
+混合阀 3 l
+混合面 2 b
+混合面儿 3 n
+混同 87 a
+混同于 3 l
+混名 3 a
+混和 3 a
+混响 62 vn
+混响器 6 n
+混响室 3 n
+混响时间 3 n
+混声 3 n
+混委会 3 n
+混子 9 n
+混居 12 v
+混帐 108 n
+混应滥应 3 i
+混录 3 n
+混得 3 v
+混成 71 v
+混成团 18 n
+混成旅 53 n
+混战 551 vn
+混打 3 v
+混拼 3 v
+混排 3 vn
+混放 3 v
+混日子 45 nz
+混有 3 b
+混杂 326 a
+混杂物 3 n
+混杂着 3 v
+混杂起来 3 l
+混来 3 v
+混来混去 3 i
+混棉 3 n
+混水 3 n
+混水捞鱼 3 i
+混水摸鱼 31 i
+混沌 253 a
+混沌不分 3 i
+混沌军团 3 i
+混沌初开 3 i
+混油界面 3 n
+混洗 2 vn
+混洗交换 3 v
+混流 3 n
+混流式 4 n
+混浊 150 a
+混淆 345 v
+混淆不清 6 l
+混淆是非 5 i
+混淆视听 21 i
+混淆黑白 5 i
+混混 3 a
+混混儿 6 l
+混混噩噩 2 z
+混混沄沄 3 z
+混混沌沌 5 i
+混炼 18 v
+混烧 2 v
+混然天成 3 i
+混球 3 n
+混球儿 3 n
+混用 76 vn
+混相驱 3 i
+混系品种 3 l
+混纺 47 b
+混纺布 3 n
+混纺纱 3 n
+混编 23 v
+混莽 3 a
+混蛋 282 n
+混血 69 v
+混血人 26 n
+混血儿 42 n
+混血王子 3 n
+混血种 7 n
+混血种人 155 n
+混血美女 3 n
+混装 8 b
+混账 123 v
+混起 3 v
+混起来 3 l
+混身解数 3 l
+混过 3 v
+混过去 3 l
+混过来 3 l
+混进 145 v
+混进去 3 l
+混进来 3 l
+混迹 72 n
+混迹江湖 3 i
+混铁炉 3 nz
+混音 3 n
+混音器 3 n
+混音版 3 n
+混频 3 b
+混频器 4 n
+混饭 4 v
+混饭吃 57 l
+淸 16 zg
+淹 266 v
+淹会贯通 3 n
+淹到 3 v
+淹博 3 v
+淹埋 3 v
+淹城 3 v
+淹旬旷月 3 nr
+淹死 228 v
+淹水 3 v
+淹没 524 v
+淹没区 4 v
+淹淹一息 3 v
+淹溺 3 v
+淹灌 3 v
+淹留 3 v
+添 1397 v
+添丁 3 n
+添上去 3 v
+添上来 3 l
+添个 3 n
+添乱 65 v
+添仓 3 v
+添作 3 v
+添入 3 v
+添兵减灶 3 i
+添到 3 v
+添加 1748 v
+添加剂 659 n
+添加物 51 n
+添加程序 3 n
+添堵 3 v
+添增 3 v
+添建 3 v
+添彩 4 n
+添得 3 v
+添成 3 v
+添房 3 n
+添有 3 v
+添来添去 3 i
+添枝加叶 10 i
+添枝增叶 3 i
+添枝接叶 3 i
+添水 3 n
+添油加醋 35 i
+添油炽薪 3 n
+添注 3 v
+添满 3 v
+添点 3 n
+添盐着醋 3 i
+添砖加瓦 18 i
+添箱 3 n
+添置 127 v
+添置衣服 3 i
+添菜 3 n
+添补 12 v
+添补反应 3 l
+添设 23 vn
+添购 3 v
+添足 3 v
+添酒 3 v
+添醋加油 3 n
+添附 3 v
+添饭 3 v
+添马舰 2 n
+添麻烦 43 l
+淼 147 nrfg
+淾 3 zg
+清 17519 t
+清一色 99 i
+清世宗 11 nr
+清世祖 12 nr
+清东陵 18 ns
+清丰 8 nz
+清丰县 3 ns
+清丽 123 a
+清丽俊逸 3 nr
+清乐 3 a
+清乡 69 n
+清乾隆 3 nr
+清了清 3 l
+清亚圣 2 nr
+清产 3 n
+清产核资 19 l
+清亮 403 a
+清人 245 n
+清仁宗 7 nr
+清仓 16 nr
+清仓价 3 n
+清仓挖潜 3 n
+清仓查库 3 n
+清代 3969 t
+清佳努 4 nr
+清俊 3 a
+清修 3 v
+清健如 2 nr
+清偿 150 vn
+清偿债务 3 n
+清光 3 n
+清光祖 3 nr
+清光绪 3 n
+清党 3 n
+清党行动 3 n
+清兵 1376 n
+清册 5 n
+清军 1293 n
+清冷 134 a
+清冷渊 3 nr
+清冽 27 a
+清净 202 a
+清净剂 3 n
+清净器 3 n
+清净寂灭 3 i
+清净寺 5 nz
+清净无为 7 i
+清净机 3 n
+清凄寂冷 3 i
+清凉 288 a
+清凉世界 3 nr
+清凉凉 3 z
+清凉剂 3 n
+清凉寺 149 nr
+清凉山 26 ns
+清凉有劲 3 l
+清凉江 2 ns
+清凉油 14 n
+清凌凌 3 nr
+清减 3 v
+清出 3 a
+清分 8 n
+清切 3 a
+清创 13 n
+清创术 2 n
+清初 436 t
+清刷 7 vn
+清剑尖 2 nr
+清剿 42 v
+清劲 3 a
+清化 25 vn
+清华 1057 nz
+清华北大 3 nt
+清华同方 33 n
+清华园 13 ns
+清华大学 922 nt
+清华大学出版社 2 nt
+清华大学化学系 6 nt
+清华大学土木工程系 2 nt
+清华大学建筑学院 2 nt
+清华大学水利系 2 nt
+清华大学生物系 2 nt
+清华大学电子工程系 2 nt
+清华大学电机系 3 nt
+清华大学经济管理学院 4 nt
+清华大学美术学院 5 nt
+清华紫光 8 nr
+清华药业 3 nt
+清华阳光 3 ns
+清单 321 a
+清原 6 ns
+清原县 3 ns
+清原满族自治县 2 ns
+清口 19 n
+清史 227 n
+清史稿 28 n
+清同治 3 n
+清后宫 3 nr
+清吏司 3 nr
+清君侧 42 i
+清君刀瓮 3 i
+清咸丰 3 nr
+清咸茶 2 nr
+清唱 47 v
+清唱剧 50 n
+清商乐 9 nz
+清啸 3 n
+清啸亭 2 nr
+清嗓子 3 n
+清嗓润肺 3 n
+清嘉庆 3 nr
+清圣祖 7 nr
+清圣象 2 nr
+清场 12 n
+清城 8 ns
+清城区 3 ns
+清塘 3 ns
+清士子 2 nr
+清声 3 n
+清夜 8 t
+清夜扪心 3 i
+清大 14 a
+清大学生 3 nz
+清天 3 t
+清天白日 3 i
+清太宗 13 nr
+清太祖 55 nr
+清好 3 a
+清孝堂 2 nr
+清宁 18 ns
+清宁宫 33 nr
+清官 112 n
+清官难断 3 i
+清客 59 n
+清宣宗 2 nr
+清宣统 3 nr
+清室 3 n
+清宫 957 n
+清宫除道 3 n
+清宽屏 3 nr
+清寂 8 a
+清寒 16 a
+清寒奖学 3 n
+清寒情操 3 nr
+清尘浊水 3 i
+清屏 3 n
+清山秀水 3 nr
+清崇德 8 nr
+清川 3 ns
+清川江 30 ns
+清州 18 ns
+清帐 3 n
+清帝逊 130 nr
+清平 35 n
+清平世界 12 nz
+清平乐 7 ns
+清平南 2 ns
+清平调 2 n
+清幽 191 z
+清幽幽 3 z
+清库 3 n
+清废帝 13 nr
+清康熙 3 nz
+清廉 103 a
+清廉正直 3 nr
+清廷 519 n
+清开灵 3 nr
+清异录 2 n
+清影 3 n
+清律 3 n
+清律典 128 ns
+清徐 5 nr
+清徐县 3 nr
+清微天 2 z
+清微淡远 3 z
+清德宗 9 nr
+清心 88 a
+清心似玉 3 i
+清心寡欢 3 i
+清心寡欲 31 i
+清心少欲 3 i
+清心悦耳 3 i
+清心省事 3 i
+清忠谱 7 nr
+清悠悠 3 z
+清慧妹 2 nr
+清慧姐 2 nr
+清房办 3 n
+清扫 157 v
+清扫口 3 i
+清扫夫 3 n
+清扫工 5 i
+清扫机 3 n
+清扫车 3 n
+清扫马路 3 nz
+清扬 107 v
+清承明 3 nr
+清掉 3 v
+清收 6 v
+清政府 1647 nt
+清教 3 nz
+清教徒 36 n
+清整 4 a
+清文鉴 10 nr
+清新 774 a
+清新俊逸 5 nr
+清新剂 7 nz
+清新县 3 ns
+清新自然 3 i
+清早 259 t
+清时 3 t
+清旷 3 a
+清明 318 a
+清明上河图 75 i
+清明坊 3 nr
+清明节 135 t
+清明菜 3 n
+清星 3 n
+清晓师 2 nr
+清晖园 3 nr
+清晨 1008 t
+清晰 1603 a
+清晰化 4 l
+清晰发言 3 l
+清晰可见 58 l
+清晰度 106 n
+清晰性 5 n
+清晰明确 3 l
+清晰版 3 n
+清暑益 2 nr
+清暑益气汤 6 n
+清曹峻府 3 nr
+清朗 61 a
+清朝 1896 t
+清末 966 t
+清查 248 vn
+清查人数 3 n
+清查工作 3 n
+清栏 3 n
+清样 4 n
+清棉机 3 n
+清楚 8451 a
+清楚说出 3 i
+清欠 21 n
+清欠办 3 i
+清歌 7 n
+清歌妙舞 3 i
+清歌曼舞 3 nr
+清正 85 a
+清正廉洁 24 nr
+清毒 3 n
+清水 812 n
+清水冲净 2 i
+清水县 7 ns
+清水塘 2 ns
+清水墙 3 n
+清水江 23 ns
+清水池 3 n
+清水河 41 ns
+清水河县 3 ns
+清水泵 3 n
+清水湾 2 ns
+清水溪 4 nr
+清水衙门 8 n
+清汁 3 n
+清江 856 ns
+清江国小 3 nt
+清江浦 20 ns
+清污 2 v
+清汤 21 n
+清汤寡水 6 i
+清汤挂面 3 i
+清河 173 ns
+清河区 2 ns
+清河县 29 ns
+清河镇 4 ns
+清河门 2 ns
+清河门区 3 ns
+清油 10 n
+清沿明 7 nr
+清泉 142 nz
+清泉岗 3 ns
+清泉石 3 nr
+清泠 3 nz
+清波 22 n
+清泪 3 n
+清泰 17 nz
+清洁 1098 a
+清洁刷 3 l
+清洁剂 59 n
+清洁卫生 3 n
+清洁员 5 n
+清洁器 2 n
+清洁工 56 n
+清洁度 5 n
+清洁机 2 n
+清洁液 2 n
+清洁球 3 n
+清洁用品 3 n
+清洁费 3 n
+清洁队 3 n
+清洌 2 a
+清洌可鉴 3 nr
+清洌洌 3 nr
+清洗 433 v
+清洗剂 9 n
+清洗器 3 n
+清洗带 3 n
+清洗机 3 n
+清洗液 3 n
+清津 9 ns
+清流 120 n
+清流县 4 ns
+清浅 3 a
+清浊 3 a
+清浊同流 3 i
+清浑皁白 3 z
+清浦区 3 ns
+清涟 4 z
+清涤 3 v
+清润 14 n
+清涧 5 n
+清涧县 3 ns
+清涧起义 3 nr
+清淡 169 a
+清淤 23 n
+清清 7 t
+清清亮亮 5 z
+清清楚楚 818 z
+清清洁洁 3 nr
+清清爽爽 14 z
+清清白白 53 z
+清清的 16 z
+清清静静 4 z
+清湖 2 ns
+清源 15 n
+清源山 10 ns
+清源正本 3 n
+清溪 90 ns
+清溪镇 3 nr
+清漆 14 n
+清漪 17 n
+清漪园 30 nr
+清潭 3 ns
+清澄 5 nr
+清澈 568 a
+清澈见底 23 l
+清灰 3 n
+清灰冷火 3 l
+清灰冷灶 3 l
+清灵 9 a
+清灵宝 4 nr
+清炒 6 v
+清炒虾仁 3 nr
+清炖 533 v
+清炖鱼 3 v
+清炖鸡 3 vn
+清点 132 n
+清点人数 3 n
+清热 210 a
+清热泻火 15 l
+清热解暑 5 n
+清热解毒 91 l
+清焦 3 a
+清煌煌 2 ns
+清燥救肺汤 2 i
+清爽 162 a
+清爽型 3 b
+清爽爽 6 nr
+清版 3 v
+清王朝 3 nr
+清玩 3 a
+清理 1037 a
+清理机 3 n
+清理门户 3 n
+清甜 18 a
+清痩 3 z
+清瘦 34 a
+清癯 37 a
+清白 264 a
+清盘 18 n
+清盛 3 a
+清真 109 a
+清真寺 368 nr
+清真教 8 nz
+清真馆 3 n
+清碧如 2 nr
+清福 13 a
+清秀 210 a
+清秀佳人 3 nr
+清秀文静 3 nr
+清秋 19 t
+清秋节 3 t
+清科 3 n
+清税 3 n
+清稿 3 n
+清空 21 n
+清算 357 v
+清算人 3 n
+清算帐目 3 n
+清算斗争 3 n
+清算组 21 n
+清纯 51 a
+清纯如一 3 i
+清纯玉女 3 nr
+清结 3 a
+清缴 9 v
+清者自清 3 l
+清耳悦心 3 i
+清肺 22 n
+清脂素 3 n
+清脆 405 a
+清脆悦耳 3 i
+清色 3 n
+清芬 7 nr
+清花机 3 n
+清苑 8 ns
+清苑县 4 ns
+清苦 47 a
+清茶 63 n
+清茶淡饭 3 i
+清莹 3 a
+清莹秀澈 3 nr
+清营凉 3 nr
+清营汤 2 n
+清蒸 557 vn
+清蒸鱼 4 n
+清蒸鸡 3 n
+清虚 3 a
+清虚洞府 3 l
+清虚观 6 nr
+清虚道人 3 i
+清西陵 11 ns
+清观剑 4 nr
+清规 41 a
+清规戒律 47 l
+清誉 39 n
+清议 66 n
+清议不容 3 n
+清议堂 8 nt
+清词丽句 2 i
+清谈 44 v
+清谈家 3 n
+清账 7 n
+清贫 74 a
+清贫人家 3 l
+清贫如洗 3 l
+清贫寡欲 3 i
+清贵 15 a
+清费 3 vn
+清越 24 a
+清跸传道 3 nz
+清身洁己 3 l
+清车 3 n
+清软英 2 nr
+清辉如 2 nr
+清辉照 2 nr
+清辞丽句 3 i
+清辞丽曲 3 nr
+清过来 3 l
+清迈 76 a
+清迈府 3 nr
+清运 8 n
+清运费 3 n
+清远 44 a
+清远市 10 ns
+清退 66 v
+清选 6 v
+清逸 9 a
+清道 64 n
+清道光 3 nr
+清道夫 15 nr
+清都紫府 3 nt
+清都紫微 3 nr
+清都绛阙 3 nr
+清酒 28 n
+清醇 9 n
+清醒 1445 a
+清醒剂 3 nr
+清醒认识 3 l
+清醒过来 3 l
+清野 3 n
+清锅冷灶 3 l
+清镇 9 ns
+清镇县 3 ns
+清镇市 3 v
+清闲 81 a
+清闲自在 3 l
+清阳 2 ns
+清除 866 v
+清除出党 3 n
+清除剂 3 nz
+清除器 3 n
+清除率 6 n
+清障 3 n
+清障车 5 n
+清雅 86 a
+清雅绝尘 3 l
+清雍正 3 nr
+清零 3 z
+清雾 3 n
+清静 296 a
+清静无为 22 i
+清静风雅 3 i
+清音 55 n
+清音幽韵 3 nr
+清音阁 3 nr
+清韵 9 a
+清顺治 3 nr
+清风 901 n
+清风两袖 2 n
+清风亮节 3 i
+清风劲节 3 n
+清风峻节 3 i
+清风店 5 n
+清风店战役 3 nz
+清风徐来 3 l
+清风明月 8 i
+清风朗月 3 nz
+清风阁 3 nr
+清风高节 3 l
+清香 217 nr
+清香味 5 nr
+清香型酒 3 n
+清馨 5 a
+清高 127 a
+清高宗 15 nr
+清龙兴 2 ns
+渆 13 zg
+済 61 zg
+渊 412 n
+渊亭山立 3 nr
+渊停山立 3 i
+渊博 164 nr
+渊图远算 3 n
+渊壑 3 n
+渊明 3 a
+渊泉 3 n
+渊海 2 n
+渊涌风厉 3 i
+渊涓蠖濩 3 z
+渊深 34 n
+渊清玉絜 3 nr
+渊渟岳峙 3 nr
+渊渟岳立 3 nr
+渊渟泽汇 3 nr
+渊源 509 n
+渊源有自 3 nr
+渊腋 3 n
+渊薮 16 n
+渊蜎蠖伏 3 n
+渊谋远略 3 n
+渊谷 3 n
+渊远 3 a
+渊远流长 4 n
+渊鱼丛爵 3 n
+渊鱼丛雀 3 n
+渊默 3 a
+渌 174 g
+渍 147 v
+渍染 3 n
+渍水 8 n
+渍涝 2 n
+渎 245 vn
+渎职 91 vn
+渎职侵权 3 n
+渎职犯罪 3 n
+渎职罪 9 n
+渐 4325 d
+渐不可长 3 i
+渐低 3 v
+渐佳 3 v
+渐入 3 v
+渐入佳境 21 i
+渐凉 3 v
+渐减 3 v
+渐化 3 v
+渐升 3 v
+渐变 95 v
+渐变性 2 n
+渐变色 3 n
+渐地 3 d
+渐增 3 v
+渐小 3 d
+渐少 3 d
+渐开 3 v
+渐开线 4 n
+渐弱 3 v
+渐弱音 3 n
+渐强音 3 n
+渐得 3 d
+渐忘 3 v
+渐悟 3 v
+渐愈 3 d
+渐慢 3 d
+渐暗 3 d
+渐染 3 v
+渐次 183 d
+渐渐 3555 d
+渐现 3 v
+渐生 3 d
+渐硬 3 v
+渐至佳境 3 i
+渐臻佳境 3 i
+渐衰 3 n
+渐趋 3 d
+渐轻 3 d
+渐近 269 d
+渐近收敛 3 i
+渐近曲线 3 n
+渐近线 5 n
+渐进 118 v
+渐进主义 3 n
+渐进式 20 n
+渐进性 8 n
+渐进法 3 n
+渐退 3 v
+渐阶 3 n
+渐降 3 v
+渐隐 3 v
+渐黑 3 v
+渑 23 ns
+渑池 27 ns
+渑池之功 3 ns
+渑池县 18 ns
+渔 796 n
+渔业 1898 n
+渔业局 2 n
+渔业法 2 n
+渔业生产 3 n
+渔业资源 3 n
+渔业部 5 n
+渔乡 3 n
+渔产 20 n
+渔产品 15 n
+渔产量 3 n
+渔人 211 n
+渔人之利 11 i
+渔人得利 5 n
+渔会 3 n
+渔光曲 15 n
+渔具 47 n
+渔农处 3 n
+渔利 5 n
+渔区 25 n
+渔叉 5 n
+渔友 3 n
+渔叟 3 n
+渔场 487 n
+渔塭 3 v
+渔夫 52 n
+渔夫帽 3 n
+渔夺侵年 3 n
+渔夺侵牟 3 n
+渔女 7 n
+渔妇 3 n
+渔婆 6 n
+渔家 52 n
+渔家傲 3 i
+渔山 5 n
+渔工 3 n
+渔市 3 n
+渔户 3 n
+渔捞 52 n
+渔捞业 3 n
+渔政 7 n
+渔期 3 n
+渔权 3 n
+渔村 155 n
+渔樵 29 n
+渔歌 15 n
+渔歌子 2 n
+渔民 614 n
+渔汛 8 n
+渔池 3 n
+渔海樵山 3 ns
+渔港 124 n
+渔港村 3 n
+渔火 13 n
+渔灯 2 n
+渔父 17 n
+渔猎 168 n
+渔码头 3 n
+渔经猎史 3 n
+渔网 321 n
+渔翁 59 n
+渔翁之利 8 i
+渔翁得利 16 i
+渔舟 30 n
+渔舟唱晚 3 i
+渔船 267 n
+渔色 3 n
+渔获 3 n
+渔获量 42 n
+渔轮 13 n
+渔郎 3 n
+渔钩 3 n
+渔阳鞞鼓 3 n
+渔阳鼙鼓 3 z
+渔霸 3 n
+渔鼓 23 n
+渔鼓道情 3 n
+渖 40 zg
+渖海 3 vn
+渖阳市 3 ns
+渗 388 v
+渗入 303 v
+渗入测试 3 n
+渗出 313 v
+渗出性 19 n
+渗出来 3 v
+渗出物 3 n
+渗出量 3 n
+渗到 3 v
+渗坑 4 n
+渗得 3 v
+渗析 17 v
+渗析作用 3 n
+渗氮 3 n
+渗水 177 v
+渗水量 2 n
+渗沟 3 n
+渗流 97 n
+渗滤 2 v
+渗滤器 3 n
+渗漏 59 v
+渗漏到 3 v
+渗漏地层 3 j
+渗漏水 3 v
+渗灌 4 v
+渗碳 17 n
+渗碳体 10 n
+渗穴 3 n
+渗过 3 v
+渗过去 3 v
+渗过来 3 v
+渗进 3 v
+渗进去 3 v
+渗进来 3 v
+渗透 834 v
+渗透到 3 n
+渗透剂 2 n
+渗透力 10 n
+渗透压 155 n
+渗透天平 3 n
+渗透性 33 n
+渗透战 2 n
+渗透法 6 n
+渗透活动 3 n
+渗透深度 3 n
+渗透率 44 n
+渗透系数 3 n
+渗透者 3 n
+渗透颠覆 3 vn
+渗量 3 n
+渘 24 zg
+渙 5 zg
+渚 340 zg
+渝 976 j
+渝中区 8 nt
+渝北 3 ns
+渝北区 3 ns
+渝州 11 ns
+渝水 2 ns
+渝水区 4 ns
+渞 2 zg
+渟 3 zg
+渠 934 n
+渠东侵 2 nr
+渠以东 2 nr
+渠化 16 n
+渠县 8 ns
+渠口 3 n
+渠导荥 2 nr
+渠帅移 2 nr
+渠帅罗 2 nr
+渠引沁 2 nr
+渠引洛 2 nr
+渠水 3 n
+渠江 14 ns
+渠沟 3 n
+渠灌 3 n
+渠灌田 2 nr
+渠系 21 n
+渠罗仇 3 nr
+渠自浚 2 nr
+渠蒙逊 34 nr
+渠道 1855 n
+渠道商 3 n
+渠首 13 n
+渠魁 3 n
+渡 2090 v
+渡假 10 n
+渡假村 3 n
+渡到 3 v
+渡劫 3 v
+渡厄 3 ns
+渡口 311 n
+渡头 18 n
+渡排 3 v
+渡桥 3 ns
+渡槽 23 n
+渡江 592 ns
+渡江战役 62 nz
+渡河 325 ns
+渡海 113 ns
+渡船 91 n
+渡船口 3 n
+渡船头 3 n
+渡蜜月 3 nz
+渡赤水 3 nz
+渡轮 17 n
+渡边 24 n
+渡边淳 2 nr
+渡过 634 v
+渡过难关 3 n
+渡运 3 n
+渡难 3 n
+渡鸦 7 n
+渣 411 nt
+渣华 3 nz
+渣土 3 nz
+渣子 30 n
+渣打 10 nz
+渣打券 3 nt
+渣打银行 20 nt
+渣油 23 nz
+渣油路 3 nt
+渣浆泵 3 n
+渣滓 37 n
+渣滓洞 20 ns
+渤 233 zg
+渤海 635 ns
+渤海地区 3 ns
+渤海海峡 23 ns
+渤海湾 100 ns
+渤澥桑田 3 ns
+渤西 4 ns
+渥 214 ns
+渥丹 3 ns
+渥堆 3 ns
+渥太华 105 ns
+渥太华市 3 ns
+渥恩 3 ns
+渥惠 3 ns
+温 2797 nr
+温一词 2 nr
+温三兄 2 nr
+温不火 4 i
+温业湛 2 nr
+温中健 4 nr
+温中散 3 nr
+温乎 3 nr
+温习 55 n
+温习功课 3 n
+温书 10 n
+温书假 3 n
+温仁厚 10 nr
+温仪叹 4 nr
+温仪续 2 nr
+温伯格 9 nr
+温体 3 n
+温体仁 139 nr
+温体猪肉 3 n
+温体肉 3 n
+温侯吕 4 nr
+温儒敏 4 nr
+温元帅 2 nr
+温兄 5 n
+温兆伦 3 nr
+温光春 2 nr
+温克勒 5 nr
+温克尔曼 3 nrt
+温克让 3 nr
+温兹洛 2 nr
+温内特 4 nr
+温冰川 2 nr
+温凉之 4 nr
+温凊定省 3 v
+温切斯特 7 nrt
+温利 5 ns
+温别尔 3 nr
+温加礼 2 nr
+温化寒 6 nr
+温化水 3 n
+温升高 4 nr
+温南扬 50 nr
+温厚 66 a
+温县 43 ns
+温可礼 3 nr
+温台 2 n
+温吞 3 z
+温吞水 4 i
+温和 1352 a
+温和性 3 n
+温和派 55 nr
+温哥华 91 nr
+温唇 3 n
+温喜按 6 nr
+温器 4 n
+温四杰 2 nr
+温国公 2 nr
+温型 2 n
+温塘 4 ns
+温塘峡 5 ns
+温塞特 3 nr
+温夏凉 13 nr
+温夏热 2 nr
+温大侠 2 nr
+温大雅 2 nr
+温如玉 3 nr
+温妮 2 nrt
+温婉 41 a
+温存 110 n
+温宗尧 3 nr
+温宗禹 4 nr
+温室 270 n
+温室效应 3 n
+温室植物 3 n
+温室管理 3 n
+温室群 3 nr
+温室花朵 3 nr
+温室设备 3 nr
+温室通风 3 nr
+温家 56 n
+温家保 3 nr
+温家兄弟 4 nr
+温家哥 3 nr
+温家大 5 nr
+温家宝 276 nr
+温家庄 43 nr
+温宿 11 nr
+温宿县 6 ns
+温宿直 2 nr
+温富州 2 ns
+温寒 4 an
+温小龙 4 nr
+温尼伯 24 nr
+温尼克 3 nr
+温居 3 n
+温岭 9 ns
+温岭县 3 ns
+温岭市 5 ns
+温州 456 ns
+温州人 3 nr
+温州城 3 ns
+温州市 40 ns
+温州话 3 n
+温差 509 n
+温差值 3 l
+温差电堆 3 l
+温巴尔格 2 nrt
+温布利 3 nr
+温布尔 17 nr
+温布尔登 3 nrt
+温带 1075 n
+温带林 3 nr
+温带植物 3 n
+温带气候 3 n
+温席扇枕 3 i
+温床 45 n
+温床栽培 3 l
+温度 3953 n
+温度仪表 3 n
+温度传感器 6 n
+温度保护 3 n
+温度场 3 n
+温度差 19 n
+温度开关 3 ns
+温度振辐 3 nr
+温度控制 23 n
+温度梯度 3 n
+温度表 20 n
+温度计 174 n
+温庭 71 n
+温庭叹 2 nr
+温庭和 7 nr
+温庭筠 27 nr
+温庭道 14 nr
+温开水 5 nr
+温弗瑞 2 nr
+温彦博 2 nr
+温彻斯 24 nr
+温彻斯特 3 nrt
+温得和克 17 ns
+温德殿 2 nr
+温思罗 2 nr
+温性 7 n
+温总理 3 n
+温总管 2 n
+温情 120 n
+温情密意 3 i
+温情脉脉 22 i
+温情蜜意 3 i
+温成形 2 n
+温掌教 2 nr
+温控 5 n
+温控仪 3 n
+温控器 3 n
+温控表 3 n
+温控阀 3 n
+温摇摇 2 nr
+温故 3 n
+温故知新 9 i
+温故而知新 11 i
+温文 21 nr
+温文儒雅 6 nr
+温文守 2 nr
+温文宝 4 nr
+温文尔雅 88 nr
+温斯坦 9 nr
+温斯顿 11 nr
+温方 6 n
+温方义 59 nr
+温方山 46 nr
+温方悟 41 nr
+温方施 24 nr
+温方禄 3 nr
+温方达 86 nr
+温旧知新 3 i
+温旨 2 n
+温旨慰 2 nr
+温晓云 2 nr
+温景春 51 nr
+温暖 1606 an
+温暖人间 3 n
+温暖如春 146 nr
+温暾 3 nr
+温有方 27 nr
+温有道 14 nr
+温服 3 n
+温枕扇席 3 i
+温柔 1029 a
+温柔一刀 3 i
+温柔乡 18 nr
+温柔体贴 3 n
+温柔敦厚 19 nr
+温标 33 n
+温格 71 n
+温格汉 4 nr
+温棚 3 n
+温榆河 8 nr
+温正也 2 nr
+温氏兄弟 5 nr
+温气乃 4 nr
+温水 183 n
+温水浴 3 nr
+温江 24 ns
+温江区 5 ns
+温江县 3 ns
+温汤 5 nr
+温油炸 2 n
+温泉 680 nr
+温泉乡 3 ns
+温泉县 2 ns
+温泉市 6 ns
+温泉水 10 nr
+温泉浴 6 nr
+温泉镇 2 nr
+温济泽 2 nr
+温浴 2 nr
+温海涛 3 nr
+温润 78 n
+温润而泽 3 nr
+温温 2 n
+温温和 2 nr
+温温和和 3 ns
+温温的 6 z
+温湿 55 a
+温湿度 11 n
+温溜 3 a
+温溼 3 z
+温火 5 n
+温灸 6 n
+温炕 3 n
+温点 3 n
+温热 282 a
+温热度 3 n
+温煦 26 nr
+温煦地 2 z
+温燥 16 a
+温特图 3 nr
+温特斯 3 nr
+温瑞安 3 nr
+温生绝裾 3 n
+温病 66 n
+温病条辨 3 l
+温碧霞 3 nr
+温禺 2 ns
+温红彦 14 nr
+温经 6 n
+温经散 9 nr
+温经散寒 3 n
+温经汤 3 nr
+温经通 6 nr
+温网 3 n
+温美 3 a
+温翠苹 3 nr
+温老二 2 nr
+温老爷子 3 n
+温良 18 nr
+温良恭 3 nr
+温良恭俭 3 nr
+温良恭俭让 13 i
+温良郡 2 nr
+温莎 52 nrt
+温莎公爵 3 nr
+温莎堡 3 nr
+温莱特 7 nr
+温菲尔德 3 nrt
+温血动物 10 n
+温补治 2 nr
+温表 3 n
+温衾扇枕 3 nr
+温觉 10 n
+温言 50 n
+温言嘉 2 nr
+温言慰 4 nr
+温计 2 n
+温记 4 n
+温词 2 n
+温语 3 n
+温课 3 n
+温跃层 6 nr
+温软 52 a
+温连英 2 nr
+温迪亚 4 nr
+温都尔 3 nr
+温都尔汗 29 ns
+温酒 3 n
+温里药 3 nr
+温铁军 6 nr
+温阳 3 ns
+温阳利 5 nr
+温阳化 2 nr
+温阳通 2 nr
+温雅 35 nr
+温雅秀美 2 nr
+温青冲 2 nr
+温青冷 3 nr
+温青怒 3 nr
+温青抢 2 nr
+温青笑 4 nr
+温青青 7 nr
+温静 3 a
+温顺 107 nr
+温顺性 3 nr
+温领兵 2 nr
+温飞卿 4 nr
+温食 3 n
+温饮 3 n
+温饱 275 n
+温饱型 7 nz
+温饱工程 3 l
+温饱线 7 nz
+温首辅 2 nr
+温香艳玉 3 nr
+温香软玉 3 nr
+温馨 335 nr
+温马 3 ns
+温驯 30 nr
+温龙平 2 nr
+渫 21 g
+測 4 zg
+渭 204 ns
+渭北 44 ns
+渭南 78 ns
+渭南市 13 ns
+渭城 9 ns
+渭城区 3 ns
+渭干河 7 ns
+渭桥 12 ns
+渭水 108 ns
+渭河 193 ns
+渭河平原 25 ns
+渭河流域 3 ns
+渭浊泾清 3 ns
+渭源 9 ns
+渭源县 14 ns
+渭滨 9 ns
+渭滨区 3 ns
+渮 4 zg
+港 5353 j
+港上镇 3 n
+港中旅 3 j
+港九 3 m
+港交所 13 j
+港产 3 j
+港人 173 n
+港人治港 34 ns
+港元 255 m
+港制 3 n
+港制品 3 n
+港剧 3 n
+港务 64 n
+港务局 10 n
+港务监督 3 n
+港务费 3 n
+港北区 3 ns
+港区 177 n
+港协 5 j
+港南区 3 ns
+港口 2904 n
+港口区 8 n
+港口型 3 n
+港口城市 3 ns
+港口机械 3 n
+港口法 3 n
+港口溪 3 n
+港口税 3 n
+港台 19 n
+港台剧 3 n
+港台地区 3 ns
+港台明星 3 n
+港台歌手 3 n
+港台歌星 3 n
+港台歌曲 3 n
+港台片 3 n
+港台腔 3 n
+港商 56 n
+港城 8 n
+港埠 107 n
+港墘 3 nz
+港外 3 j
+港大道 3 n
+港姐 3 n
+港子 3 n
+港客 8 n
+港岛 17 n
+港岸 3 n
+港币 154 n
+港市 3 n
+港府 18 n
+港式 2 n
+港星 3 n
+港汊 48 n
+港池 23 n
+港海 3 ns
+港海地区 3 ns
+港湾 290 ns
+港澳 659 j
+港澳办 15 j
+港澳台 111 m
+港澳台侨 5 j
+港澳台地区 20 j
+港澳同胞 3 ns
+港澳地区 96 j
+港澳游 3 j
+港片 3 n
+港版 3 n
+港田 3 n
+港界 3 n
+港监 2 n
+港督 6 n
+港股 44 n
+港胞 6 n
+港航 8 j
+港英政府 3 n
+港警 3 j
+港警所 3 n
+港译 3 n
+港资 9 n
+港都夜雨 3 n
+港闸区 3 n
+港鱼粉 3 n
+港龙 18 n
+渰 16 zg
+渲 139 v
+渲染 289 v
+渲染器 3 v
+渲染法 3 vn
+渲泄 16 v
+渳 2 zg
+渴 506 a
+渴到 3 v
+渴尘万斛 3 nr
+渴得 3 v
+渴念 19 v
+渴想 3 v
+渴慕 7 v
+渴望 1122 v
+渴望工程 3 v
+渴死 34 v
+渴求 114 v
+渴渴 3 v
+渴爱 3 v
+渴盼 12 v
+渴盼着 3 y
+渴着 3 v
+渴睡 3 v
+渴者易饮 3 nz
+渴而掘井 3 v
+渴而穿井 3 v
+渴骥奔泉 3 ns
+渶 195 zg
+渷 13 zg
+游 7272 v
+游七领 3 nr
+游三辅 2 nr
+游上 3 n
+游上去 3 v
+游上来 3 v
+游下 3 n
+游下去 3 v
+游下来 3 l
+游业 2 n
+游丝 114 n
+游丝飞絮 3 n
+游乐 129 n
+游乐业 6 n
+游乐区 3 n
+游乐器 3 n
+游乐园 48 n
+游乐场 55 n
+游乐城 2 n
+游乡 3 n
+游于堂 2 nr
+游云惊龙 3 i
+游云西 4 nr
+游云道 4 nr
+游五洋 3 nr
+游人 508 n
+游人分析 3 l
+游人如织 40 l
+游人规则 3 n
+游人调查 3 l
+游仙 4 n
+游仙乡 2 nr
+游仙区 3 n
+游仙诗 3 nr
+游仪 2 n
+游会稽 2 l
+游伴 17 n
+游侠 33 nr
+游侠网 3 n
+游光扬声 3 i
+游兴 12 b
+游兴正浓 3 nr
+游兵 4 n
+游军 2 n
+游出 3 v
+游击 377 vn
+游击区 28 n
+游击战 265 n
+游击战争 440 n
+游击战术 3 n
+游击手 3 n
+游击队 822 n
+游击队员 84 n
+游刃 6 n
+游刃有余 100 i
+游到 3 v
+游动 213 vn
+游动哨 3 n
+游动阀 3 n
+游勇 6 nr
+游北园 2 nr
+游医 11 n
+游南岸 2 nr
+游历 269 n
+游去 3 v
+游向 3 n
+游吟 3 v
+游响停云 3 n
+游商 4 n
+游回 3 v
+游回去 3 l
+游回来 3 l
+游回磨转 3 i
+游园 51 n
+游园会 6 n
+游园活动 3 n
+游地带 6 n
+游坦之 186 nr
+游士 17 n
+游天涯 2 nr
+游如梦 4 nr
+游嬉恰 16 nr
+游子 326 n
+游子吟 3 nr
+游子天涯 3 n
+游学 54 n
+游学之 2 nr
+游宁丰 3 nr
+游客 4650 n
+游客止步 3 l
+游客量 28 n
+游宦 3 n
+游宴 3 n
+游山 7 n
+游山玩景 3 i
+游山玩水 56 i
+游幸 4 n
+游廊 46 n
+游开 3 v
+游弋 83 nr
+游德馨 3 nr
+游心太 2 nr
+游心寓目 3 n
+游心影 2 n
+游心聘目 3 n
+游心骇耳 3 i
+游必有方 3 i
+游思妄想 3 i
+游性 9 n
+游息 33 n
+游憩 25 v
+游憩中心 3 vn
+游憩地理 3 vn
+游戈有余 3 i
+游戏 2917 n
+游戏三昧 3 i
+游戏人世 3 i
+游戏人间 7 n
+游戏光盘 3 n
+游戏卡 3 n
+游戏厅 19 n
+游戏吧 3 n
+游戏场 3 n
+游戏场地 3 n
+游戏城 3 n
+游戏基地 3 n
+游戏尘寰 3 i
+游戏币 3 n
+游戏影音 3 n
+游戏性 6 n
+游戏机 301 n
+游戏猪 3 n
+游戏王 3 n
+游戏笔墨 3 n
+游戏类 3 n
+游戏网 3 n
+游戏翰墨 3 v
+游戏补丁 3 i
+游戏装 3 n
+游戏规则 3 n
+游戏软件 3 l
+游戏迷 6 v
+游戏音乐 3 n
+游戏马 3 n
+游成主 2 nr
+游手 3 n
+游手偷闲 3 i
+游手好闲 48 i
+游手好闲者 3 n
+游斗 30 vn
+游方 28 n
+游易 2 n
+游易网 2 n
+游星 3 n
+游春 8 nr
+游春图 11 nr
+游本昌 2 nr
+游来 3 v
+游来游 3 nr
+游来游去 3 l
+游林 9 n
+游林泉 4 nr
+游标 7 n
+游标位置 3 n
+游标卡尺 17 nr
+游氏双 3 nr
+游民 25 n
+游水 41 n
+游法 5 n
+游泳 964 vn
+游泳圈 3 n
+游泳场 11 n
+游泳帽 3 n
+游泳池 161 n
+游泳衣 11 n
+游泳裤 3 n
+游泳赛 21 n
+游泳队 27 n
+游泳馆 44 n
+游洋山 3 nr
+游洞 2 n
+游湖 19 n
+游湖群 2 nr
+游牧 682 n
+游牧人 10 n
+游牧区 3 n
+游牧民 132 n
+游牧民族 3 n
+游牧部落 3 n
+游猎 43 n
+游猎赋 2 nr
+游玩 316 n
+游皇城 3 nr
+游目骋怀 3 nr
+游目骋观 3 l
+游神 2 n
+游离 440 n
+游离份子 3 n
+游离态 6 n
+游离票 3 n
+游离钙 4 n
+游离龈 3 n
+游离龈沟 3 n
+游禽 5 n
+游移 38 v
+游移不定 13 i
+游移湖 3 nr
+游程 20 n
+游素兰 3 nr
+游者 15 n
+游舫 3 n
+游船 154 n
+游艇 179 n
+游艇业 3 n
+游艇业者 3 n
+游艺 174 n
+游艺会 3 n
+游艺厅 3 n
+游艺场 7 n
+游艺室 6 n
+游艺机 10 n
+游节 6 n
+游荡 299 v
+游荡不归 3 i
+游荡不羁 3 i
+游蚊 3 n
+游蛇科 7 nr
+游蜂戏蝶 3 n
+游蜂浪 2 nr
+游蜂浪蝶 3 n
+游行 3983 v
+游行示众 3 n
+游行示威 3 n
+游行者 2 n
+游街 216 n
+游街示众 3 i
+游览 873 vn
+游览区 98 n
+游览器 3 n
+游览图 3 n
+游览点 10 n
+游览者 6 n
+游览胜地 3 n
+游览车 10 n
+游记 370 n
+游说 165 n
+游谈 3 v
+游谈无根 3 i
+游资 53 vn
+游资泛滥 3 l
+游赏 11 v
+游走 129 v
+游走不定 6 i
+游走四方 3 n
+游踪 3 v
+游转 3 v
+游轮 83 n
+游辞巧饰 3 n
+游辞浮说 3 l
+游迅笑 10 nr
+游过去 3 l
+游过来 3 l
+游进 3 v
+游进去 3 v
+游进来 3 nr
+游进游 2 nr
+游逛 15 v
+游遍 26 v
+游错 3 v
+游长安 2 nr
+游闲公子 3 n
+游隙 3 n
+游驹 8 n
+游骑兵 3 nr
+游骑无归 3 i
+游骑聘怀 3 nr
+游骥圆 2 nr
+游魂 20 n
+游魂野 2 i
+游鱼 53 n
+游鱼出听 3 i
+游鸿明 3 nr
+游龙剑 3 nr
+游龙嬉 2 nr
+游龙戏凤 4 i
+游龙掌 9 nr
+游龙飞 3 nr
+游龟山 2 nr
+渹 2 zg
+渺 100 ag
+渺不足道 3 i
+渺小 112 a
+渺无 3 l
+渺无人烟 4 i
+渺无人踪 3 i
+渺无人迹 4 i
+渺无声息 3 i
+渺无希望 3 l
+渺无影踪 3 i
+渺无踪影 3 i
+渺无踪迹 2 i
+渺无音信 3 i
+渺无音息 3 i
+渺无音讯 3 i
+渺渺 3 a
+渺渺茫茫 11 i
+渺然 3 a
+渺若烟云 3 i
+渺茫 201 a
+渺茫无望 3 i
+渺视 3 a
+渺远 3 a
+渼 7 zg
+渾 20 zg
+渿 14 zg
+湀 120 zg
+湁 1647 zg
+湃 58 x
+湄 26 zg
+湄公河 123 ns
+湄南河 34 ns
+湄州 26 ns
+湄洲岛 3 ns
+湄洲湾 3 ns
+湄潭 2 ns
+湄潭县 3 ns
+湅 547 zg
+湇 68 zg
+湈 2 zg
+湉 37 zg
+湍 202 ag
+湍急 191 a
+湍流 194 n
+湍流阻力 3 n
+湎 66 x
+湐 2 zg
+湑 3 zg
+湓 45 g
+湔 25 g
+湔雪前耻 3 v
+湕 14 zg
+湖 12466 ns
+湖上 198 s
+湖东 73 ns
+湖东乡 2 ns
+湖东路 3 ns
+湖中 330 s
+湖人队 3 nt
+湖光 21 nz
+湖光塔影 3 n
+湖光山色 58 n
+湖内 25 s
+湖冰水 3 ns
+湖剧 3 n
+湖北 32652 ns
+湖北人民出版社 5 nt
+湖北佬 3 nz
+湖北大鼓 3 nz
+湖北日报 3 nz
+湖北烟草 3 n
+湖北省 18868 ns
+湖北省人民医院 3 nt
+湖北省人民政府 1538 nt
+湖北省公安厅 3 nt
+湖北省博物馆 2 ns
+湖北省委 272 nt
+湖北省总工会 2 nt
+湖北省政府 522 nt
+湖北省物价局 259 nt
+湖北省财政厅 258 nt
+湖北美术学院 259 nt
+湖北队 29 nt
+湖北高院 3 nt
+湖区 468 ns
+湖南 3637 ns
+湖南人 29 n
+湖南人民出版社 6 nt
+湖南医科大学 3 nt
+湖南华 3 nz
+湖南卫视 19 nt
+湖南台 3 ns
+湖南大学 47 nt
+湖南师大 7 ns
+湖南师范大学 10 nt
+湖南投资 3 nz
+湖南日报 3 nz
+湖南永州 3 ns
+湖南电信 3 nz
+湖南省 1877 ns
+湖南省人民政府 2 nt
+湖南省委 39 nt
+湖南省委宣传部 2 nt
+湖南省政府 5 nt
+湖南籍 3 n
+湖南菜 3 n
+湖南话 2 n
+湖南路 11 ns
+湖南镇 6 ns
+湖南长沙市 5 ns
+湖南队 16 nt
+湖口 110 ns
+湖口县 3 ns
+湖名 3 n
+湖塘 13 ns
+湖塘镇 2 ns
+湖外 3 s
+湖头 2 ns
+湖山庄 3 ns
+湖岛 3 ns
+湖岸 156 s
+湖州 216 ns
+湖州人 18 nz
+湖州市 29 ns
+湖州府 3 nt
+湖广 1371 nz
+湖底 134 ns
+湖底扇 3 n
+湖心 99 n
+湖心亭 21 ns
+湖心岛 15 ns
+湖景区 4 ns
+湖水 856 ns
+湖水环流 3 ns
+湖沼 110 n
+湖沼学 3 vn
+湖泊 3482 ns
+湖泊相 3 nz
+湖泽 7 ns
+湖流 3 n
+湖海 3 ns
+湖海之士 3 nz
+湖淀 3 ns
+湖湘 14 ns
+湖湘光 3 nz
+湖湾 23 ns
+湖滨 118 ns
+湖滨公路 3 ns
+湖滨北路 3 ns
+湖滨区 3 ns
+湖滨南路 3 ns
+湖滨路 4 ns
+湖滩 3 ns
+湖田 4 ns
+湖畔 203 ns
+湖盆 135 ns
+湖笔 20 n
+湖绉 6 n
+湖绿 8 n
+湖羊 13 ns
+湖色 10 n
+湖蓝 5 nz
+湖西 557 ns
+湖西村 3 ns
+湖边 395 s
+湖里 139 s
+湖里区 3 ns
+湖面 612 n
+湗 389 zg
+湘 3778 ns
+湘东 25 ns
+湘东区 3 ns
+湘东王 2 ns
+湘中 42 ns
+湘乡 60 ns
+湘乡人 10 nz
+湘乡市 13 ns
+湘云 345 ns
+湘军 275 j
+湘剧 22 n
+湘剧院 3 nt
+湘北 284 ns
+湘南 114 ns
+湘南地区 2 ns
+湘南特委 2 nt
+湘夫人 3 nz
+湘妃 16 n
+湘妃竹 10 n
+湘妹子 3 n
+湘帘 5 n
+湘教版 3 n
+湘桂 76 j
+湘桂铁路 18 nz
+湘桂黔 3 nz
+湘桥区 3 ns
+湘水 3 ns
+湘江 166 ns
+湘泉 3 ns
+湘潭 118 ns
+湘潭人 7 nz
+湘潭县 14 ns
+湘潭工学院 2 nt
+湘潭市 22 ns
+湘灵 3 ns
+湘竹 3 ns
+湘籍 3 j
+湘绣 18 nz
+湘莲 66 ns
+湘菜 7 n
+湘菜馆 3 n
+湘西 451 ns
+湘西土家族苗族自治州 18 ns
+湘西自治州 3 ns
+湘计算机 2 n
+湘语 3 nz
+湘财 81 j
+湘赣 182 j
+湘鄂 526 j
+湘鄂川黔 56 nz
+湘鄂西 3 j
+湘鄂赣 57 j
+湘酒鬼 3 n
+湘阴 43 ns
+湘阴县 6 ns
+湘雅 4 ns
+湘雅医学院 2 nt
+湘雅医院 2 nt
+湛 63 ns
+湛之士 3 nr
+湛卢 7 ns
+湛山 6 ns
+湛恩汪濊 3 z
+湛江 141 ns
+湛江市 28 ns
+湛江港 25 ns
+湛江舰 3 nr
+湛河区 3 ns
+湛湛青天 3 z
+湛然 4 z
+湛然居士 3 nr
+湛蓝 75 z
+湛蓝湛蓝 3 z
+湜 106 zg
+湝 23 zg
+湞 26 zg
+湟 92 ns
+湟中 15 ns
+湟中县 9 ns
+湟水 79 ns
+湟源 8 ns
+湟源县 4 ns
+湟鱼 3 ns
+湠 2 zg
+湡 406 zg
+湢 2 zg
+湣 21 zg
+湥 2 zg
+湦 4 zg
+湨 11 zg
+湪 1618 zg
+湫 82 g
+湬 3 zg
+湭 49 zg
+湮 68 v
+湮没 108 v
+湮没无闻 14 i
+湮灭 29 v
+湮灭证据 3 i
+湮远 3 v
+湯 7 zg
+湰 203 zg
+湲 6 zg
+湳 34 zg
+湴 1211 zg
+湵 243 zg
+湶 52 zg
+湸 2 zg
+湹 27 zg
+湻 6 zg
+湼 9 zg
+湾 2030 zg
+湾仔 9 ns
+湾仔区 3 ns
+湾区 6 ns
+湾头 9 ns
+湾子 9 n
+湾沟 2 ns
+湾泊 3 ns
+湾流 36 n
+湾潭 3 ns
+湾畔 8 ns
+湾里 19 ns
+湾里区 3 ns
+湿 2030 a
+湿两用 3 n
+湿乎乎 8 z
+湿冷 12 z
+湿地 1194 z
+湿地松 2 n
+湿婆 109 n
+湿婆大神 2 n
+湿季 3 n
+湿害 3 v
+湿寒 8 a
+湿巾 2 n
+湿布 3 v
+湿度 321 n
+湿度器 3 n
+湿度学 3 n
+湿度表 9 n
+湿度计 4 v
+湿式 2 n
+湿气 64 n
+湿气流 5 n
+湿氧氧化 3 n
+湿法 40 n
+湿润 1327 n
+湿润剂 3 n
+湿润型 5 n
+湿润指数 3 n
+湿润气候 3 n
+湿淀粉 3 n
+湿淋淋 88 z
+湿渌渌 9 z
+湿湿的 18 z
+湿漉漉 176 z
+湿热 281 z
+湿热型 6 n
+湿球温度 3 n
+湿生植物 3 n
+湿疣 3 n
+湿疹 63 n
+湿病 4 n
+湿空气 3 n
+湿答答 3 z
+湿纸巾 3 n
+湿货 3 n
+湿软 3 a
+湿透 142 v
+満 253 zg
+溂 312 zg
+溃 481 v
+溃不成军 55 i
+溃乱 3 v
+溃于蚁穴 2 i
+溃于蝼蚁 3 n
+溃兵 3 n
+溃兵游勇 3 i
+溃军 3 n
+溃决 32 v
+溃口 5 n
+溃围 3 n
+溃坝 2 n
+溃堤 3 n
+溃敌 3 v
+溃散 156 v
+溃灭 21 v
+溃烂 66 v
+溃疡 318 n
+溃疡性 3 n
+溃疡病 33 n
+溃疡面 3 n
+溃脓 3 v
+溃裂 3 v
+溃败 234 v
+溃退 79 v
+溃逃 69 v
+溄 8 zg
+溅 611 v
+溅出 3 v
+溅射 3 v
+溅得 3 v
+溅水 3 v
+溅污 3 v
+溅泼 3 v
+溅洒 3 v
+溅湿 13 v
+溅溢 3 v
+溅落 8 v
+溅酒 3 v
+溆 60 g
+溆浦 6 ns
+溆浦县 2 ns
+溇 7 zg
+溉 40 vg
+溍 56 zg
+溎 2 zg
+溏 58 g
+源 4016 ng
+源于 1149 v
+源产地 3 n
+源代码 68 n
+源兴 4 v
+源地 67 n
+源地址 3 n
+源城区 3 n
+源头 413 n
+源头活水 9 i
+源始 3 v
+源委 3 n
+源安堂 3 n
+源文件 16 n
+源本 3 n
+源氏 38 n
+源氏物语 28 nz
+源水流长 3 n
+源汇区 3 n
+源江 3 ns
+源泉 454 nz
+源泉万斛 3 n
+源流 163 n
+源深 6 n
+源清流洁 3 i
+源清流清 3 i
+源源 104 n
+源源不断 222 i
+源源不绝 41 i
+源源本本 12 n
+源源而来 13 i
+源点 3 n
+源热泵 3 n
+源目录 2 n
+源码 10 n
+源码库 3 n
+源码站 3 n
+源程序 33 n
+源自 238 v
+源范例库 3 n
+源语言 3 n
+源远流长 145 i
+準 14 zg
+溘 6 i
+溘先朝露 3 i
+溘然 3 i
+溘然而逝 3 i
+溘然长往 3 i
+溘然长逝 4 i
+溘谢 3 i
+溘逝 3 i
+溜 1757 v
+溜上去 3 v
+溜上来 3 v
+溜下 3 v
+溜下去 3 v
+溜下来 3 v
+溜之乎也 4 i
+溜之大吉 55 i
+溜井 3 v
+溜光 14 z
+溜冰 12 z
+溜冰场 3 n
+溜冰鞋 2 i
+溜出 3 v
+溜出去 3 i
+溜出来 3 i
+溜口 3 v
+溜号 14 v
+溜嘴 3 v
+溜回 3 v
+溜回去 3 i
+溜回来 3 i
+溜圆 17 z
+溜坍 3 v
+溜好 3 z
+溜子 3 n
+溜完 3 v
+溜岗 3 v
+溜平 3 z
+溜开 3 v
+溜掉 18 v
+溜放 3 v
+溜来 3 v
+溜来溜去 3 z
+溜槽 2 v
+溜溜 3 z
+溜溜严 3 i
+溜溜光 3 z
+溜溜平 3 z
+溜溜球 3 n
+溜溜转 3 i
+溜溜达达 3 i
+溜滑 30 v
+溜滑梯 3 n
+溜秋 3 z
+溜肩膀 3 n
+溜走 137 v
+溜边 4 z
+溜达 70 v
+溜过 3 v
+溜过去 3 i
+溜过来 3 i
+溜进 3 v
+溜进去 3 v
+溜进来 3 v
+溜遍 3 v
+溜门撬锁 3 vn
+溜须拍马 20 i
+溞 17 zg
+溟 27 g
+溢 287 n
+溢于言外 3 l
+溢于言表 65 l
+溢人 3 n
+溢价 82 n
+溢余 3 n
+溢值 3 n
+溢出 143 v
+溢出检查 3 n
+溢利 3 n
+溢彩 4 n
+溢收 3 v
+溢油 3 n
+溢洒 3 v
+溢洪 3 n
+溢洪坝 3 n
+溢洪道 40 n
+溢洪闸 3 n
+溢流 35 n
+溢流坝 16 n
+溢流坝段 2 n
+溢流孔 3 n
+溢流式 3 n
+溢流阀 3 l
+溢满 3 v
+溢目 3 n
+溢美 6 n
+溢美之言 3 l
+溢美之词 10 l
+溢美之语 3 l
+溢美之辞 5 l
+溢美溢恶 3 l
+溢血 3 n
+溢言虚美 3 l
+溢量 3 n
+溥 53 nr
+溥仁寺 2 nr
+溥仪 305 nr
+溥仪之 4 nr
+溥仪亲 2 nr
+溥仪充 3 nr
+溥仪先 2 nr
+溥仪朝 2 nr
+溥仪登 3 nr
+溥天同庆 3 nr
+溥天率土 3 nr
+溧 24 ns
+溧水 18 ns
+溧水县 9 ns
+溧阳 29 ns
+溧阳县 3 ns
+溧阳市 5 ns
+溪 1335 n
+溪乾村 3 vn
+溪北 3 ns
+溪口 68 n
+溪口国小 3 n
+溪口镇 11 ns
+溪壑无厌 3 n
+溪头 6 n
+溪尾 3 ns
+溪州 3 ns
+溪底 12 n
+溪水 236 n
+溪沟 12 ns
+溪河 24 ns
+溪流 215 n
+溪涧 39 n
+溪渠 3 ns
+溪湖 3 ns
+溪湖区 3 ns
+溪源 4 n
+溪畔 18 n
+溪谷 40 n
+溪边 110 s
+溪钓 3 n
+溫 3 zg
+溯 315 vg
+溯本求源 3 v
+溯水行舟 3 v
+溯江而上 3 v
+溯流 3 v
+溯流从源 3 v
+溯流徂源 3 vn
+溯流求源 3 v
+溯流穷源 3 vn
+溯流而上 3 v
+溯流追源 3 vn
+溯源 61 v
+溯源侵蚀 3 vn
+溯源堆积 3 v
+溯源穷流 3 vn
+溯端竟委 3 v
+溱 3 g
+溲 40 zg
+溴 317 ng
+溴化乙啶 3 nz
+溴化乙锭 3 nz
+溴化氢 3 nz
+溴化氨 3 n
+溴化氰 3 nz
+溴化汞 3 nz
+溴化物 10 n
+溴化碘 3 nz
+溴化磷 3 nz
+溴化钙 3 nz
+溴化钠 10 nz
+溴化钡 3 nz
+溴化钾 6 nz
+溴化铅 3 nz
+溴化铜 3 nz
+溴化银 13 nz
+溴化锂 3 nz
+溴化镁 3 nz
+溴尿嘧啶 3 n
+溴指数 3 nz
+溴氰菊酯 5 nz
+溴水 3 n
+溴甲烷 3 nz
+溴甲酚绿 3 nz
+溴磺酚酞 3 n
+溴素 2 n
+溴苯 41 nz
+溴酚蓝 3 nz
+溴酸 3 nz
+溴酸盐 3 nz
+溵溜 3 z
+溶 867 n
+溶为 3 v
+溶于 680 v
+溶体 3 n
+溶入 25 v
+溶剂 789 n
+溶剂化物 3 n
+溶剂回收 3 n
+溶剂型 4 n
+溶剂油 3 n
+溶剂胶 3 n
+溶剂脱蜡 3 n
+溶剂萃取 3 vn
+溶剂解 3 n
+溶化 80 v
+溶合 16 v
+溶媒 10 n
+溶孔 3 n
+溶岩 14 n
+溶度 3 n
+溶度积 4 n
+溶性 3 n
+溶斗 3 n
+溶有 3 v
+溶栓 11 n
+溶水 3 n
+溶沟 3 n
+溶洞 191 n
+溶洞群 3 n
+溶液 1556 n
+溶液剂 3 n
+溶液聚合 3 n
+溶溶 27 n
+溶点 3 n
+溶胀 8 v
+溶胶 29 n
+溶菌斑 3 n
+溶菌素 3 n
+溶菌酶 11 n
+溶蚀 72 v
+溶蚀盆 3 n
+溶蚀谷 3 n
+溶血 67 v
+溶血性 3 n
+溶解 536 v
+溶解度 188 n
+溶解性 3 n
+溶解氧 10 n
+溶解油 3 n
+溶解烃 3 n
+溶解热 18 n
+溶解物 3 n
+溶解能力 3 n
+溶质 133 n
+溶酶体 28 n
+溷 11 zg
+溷浊 3 a
+溺 183 vg
+溺于旧闻 3 n
+溺婴 4 v
+溺婴罪 3 n
+溺床 3 v
+溺心灭质 3 n
+溺死 53 v
+溺毙 3 v
+溺水 66 v
+溺水者 12 n
+溺爱 81 v
+溺爱型 2 n
+溺职 3 v
+溺谷 3 n
+溼地 3 z
+溼度 3 vn
+溼度器 3 v
+溼度计 3 vn
+溼气 3 z
+溼润 3 z
+溼淋淋 3 z
+溼漉漉 3 z
+溼热 3 z
+溼疹 3 n
+溼透 3 z
+溽 5 n
+溽暑 9 n
+溽热 4 a
+溾 21 zg
+溿 68 zg
+滀 595 zg
+滁 30 ns
+滁县 12 ns
+滁州 77 ns
+滁州市 9 ns
+滂 100 a
+滂沛 3 a
+滂沱 19 a
+滂沱大雨 6 n
+滂泽 3 n
+滂湃 3 a
+滂胱 3 n
+滃 924 zg
+滄 1241 zg
+滅 385 zg
+滆 571 zg
+滇 763 j
+滇东 37 ns
+滇东南 14 ns
+滇剧 10 n
+滇北 8 ns
+滇南 48 ns
+滇池 117 ns
+滇红 30 nz
+滇缅 3 nrt
+滇缅公路 3 vn
+滇茶 3 n
+滇西 85 ns
+滇西北 26 ns
+滇西南 12 ns
+滇西纵谷 3 n
+滇越铁路 3 ns
+滇黔桂 3 nz
+滈 254 zg
+滉 8 zg
+滋 661 n
+滋事 43 n
+滋事份子 3 n
+滋事罪 3 n
+滋养 132 v
+滋养品 2 n
+滋养层 3 n
+滋养核 3 n
+滋味 852 n
+滋味儿 30 n
+滋扰 46 v
+滋水 3 n
+滋润 527 n
+滋润霜 3 n
+滋滋 2 nz
+滋生 327 v
+滋生事端 3 n
+滋生腐败 3 n
+滋益 3 n
+滋育 3 v
+滋芽 3 v
+滋蔓 4 n
+滋蔓难图 3 n
+滋补 110 v
+滋补剂 3 n
+滋补品 280 n
+滋补药 3 n
+滋补药品 3 n
+滋补食品 3 l
+滋贺 2 v
+滋长 134 v
+滋阴 79 n
+滋阴壮阳 9 n
+滏 28 ns
+滏临庄 2 ns
+滏阳 28 ns
+滏阳新河 5 ns
+滐 114 zg
+滑 2933 v
+滑上 3 v
+滑上去 3 v
+滑上来 3 l
+滑下 3 v
+滑下去 3 l
+滑下来 3 l
+滑不唧溜 3 z
+滑了一跤 3 v
+滑倒 3 v
+滑入 30 v
+滑入潭 2 nr
+滑冰 190 nr
+滑冰场 3 n
+滑冰者 3 nr
+滑冰鞋 3 nr
+滑冰馆 2 nr
+滑出 3 v
+滑利 2 ns
+滑到 3 v
+滑力 3 n
+滑动 149 vn
+滑动书架 3 n
+滑动式 2 n
+滑动摩擦 8 l
+滑动模型 3 n
+滑动负载 3 n
+滑动轴承 22 l
+滑动门 3 n
+滑去 3 v
+滑县 81 ns
+滑吏 2 n
+滑向 27 v
+滑向深渊 3 nr
+滑囊 2 n
+滑块 3 n
+滑坡 195 ns
+滑坡体 9 n
+滑垒 3 n
+滑塌 12 v
+滑塌相 3 i
+滑天下之大稽 4 l
+滑头 83 n
+滑头滑脑 3 n
+滑如游 3 nr
+滑子菇 2 n
+滑寿善 2 nr
+滑州 7 ns
+滑幼 3 n
+滑座 3 n
+滑开 3 v
+滑得 3 v
+滑掉 3 v
+滑旱冰 3 nr
+滑杆 3 n
+滑来滑去 3 l
+滑板 48 n
+滑板车 3 n
+滑板鞋 3 n
+滑梯 18 n
+滑槽 2 n
+滑橇 3 n
+滑步 16 vn
+滑步推 2 l
+滑水 22 n
+滑水场 3 n
+滑水板 6 n
+滑水梯 2 nr
+滑泥扬波 3 nr
+滑润 20 n
+滑润剂 3 n
+滑润油 3 n
+滑溜 117 z
+滑溜溜 20 z
+滑灏界 2 nr
+滑灏辨 2 nr
+滑爽 9 a
+滑环 3 vn
+滑盖 2 v
+滑盖式 2 n
+滑着走 3 l
+滑石 78 nr
+滑石片 3 n
+滑石粉 21 nr
+滑移 34 v
+滑移矢量 3 i
+滑稽 423 a
+滑稽剧 12 n
+滑稽剧团 6 n
+滑稽可笑 3 nr
+滑稽地 3 ns
+滑稽戏 21 n
+滑稽角色 3 n
+滑竿 26 n
+滑粉 3 n
+滑精 3 n
+滑线 3 n
+滑结 3 v
+滑翔 130 nr
+滑翔伞 3 nr
+滑翔机 78 n
+滑翔翼 2 nr
+滑联 10 ns
+滑肉门 3 n
+滑脉 4 ns
+滑脱 33 v
+滑脱效应 3 l
+滑腻 61 a
+滑膛 59 n
+滑膛式 3 nr
+滑膛枪 19 nr
+滑膛枪手 3 n
+滑膛炮 82 nr
+滑膜 5 n
+滑膜炎 3 n
+滑落 126 v
+滑落溜掉 3 i
+滑行 168 v
+滑行跑道 3 n
+滑行道 13 n
+滑西闪 2 nr
+滑走 3 v
+滑起 3 v
+滑起来 3 l
+滑跑 66 v
+滑跤 3 v
+滑车 33 n
+滑车神经 3 n
+滑轨 8 n
+滑轮 60 n
+滑轮组 11 n
+滑轴窗 3 nz
+滑辣 2 a
+滑过去 3 l
+滑过来 3 l
+滑进 3 v
+滑进去 3 l
+滑进来 3 nr
+滑道 35 v
+滑铁卢 63 nr
+滑铁卢战役 10 nz
+滑阀 4 n
+滑降 18 v
+滑雪 269 nr
+滑雪场 35 n
+滑雪屐 3 n
+滑雪服 3 nr
+滑雪板 33 nr
+滑雪者 10 nr
+滑雪衫 2 nr
+滑雪赛 3 nr
+滑雪运动 3 l
+滑雪鞋 3 nr
+滑面 3 n
+滑面粉 3 n
+滑音 8 n
+滑鼠 2 n
+滑齿 3 n
+滓 23 g
+滔 56 z
+滔天 51 z
+滔天之势 3 i
+滔天之罪 3 i
+滔天大祸 3 i
+滔天大罪 9 i
+滔天罪行 31 i
+滔滔 232 z
+滔滔不尽 3 i
+滔滔不断 3 i
+滔滔不竭 3 i
+滔滔不绝 188 i
+滔滔地 3 i
+滔滔汩汩 3 o
+滔滔滚滚 3 l
+滕 174 nr
+滕一雷 201 nr
+滕万翠 3 nr
+滕丽名 3 nr
+滕云汉 11 nr
+滕云设 4 nr
+滕代远 41 nr
+滕县 3 nr
+滕县大石 2 nr
+滕国玺 3 nr
+滕大哥 3 nr
+滕子京 3 nr
+滕尼斯 10 nr
+滕州 10 nr
+滕州市 6 ns
+滕文公 20 nr
+滕文生 19 nr
+滕文骥 3 nr
+滕斯坦 2 nr
+滕普拉 3 nr
+滕王阁 23 nr
+滕胤入 2 nr
+滕进贤 3 nr
+滗 5 v
+滘 8 zg
+滙 2 zg
+滚 2737 v
+滚上去 3 v
+滚上来 3 l
+滚下 3 v
+滚下去 3 l
+滚下来 3 l
+滚乱 3 v
+滚倒 3 v
+滚出 3 v
+滚出去 3 l
+滚出来 3 l
+滚刀 10 n
+滚刀肉 11 i
+滚利 3 nz
+滚到 3 v
+滚动 444 v
+滚动删除 3 vn
+滚动制 3 n
+滚动式 3 l
+滚动摩擦 15 l
+滚动条 3 l
+滚动轴承 24 l
+滚压 13 z
+滚去 3 v
+滚回 3 v
+滚回去 3 l
+滚回来 3 l
+滚园 3 n
+滚圆 26 z
+滚圈 3 n
+滚地 3 z
+滚地球 3 n
+滚地皮 3 l
+滚子 8 n
+滚存 19 v
+滚屏 3 n
+滚开 136 v
+滚成 3 v
+滚成一团 3 l
+滚打 3 v
+滚木 26 n
+滚杠 3 n
+滚来 3 v
+滚来滚去 3 z
+滚杯 3 nz
+滚柱 3 n
+滚柱轴承 3 n
+滚槽法 3 n
+滚水 29 n
+滚水坝 2 n
+滚汤 12 nz
+滚沸 10 v
+滚油浇心 3 n
+滚涂 3 z
+滚涕 3 n
+滚滚 772 z
+滚滚向前 3 l
+滚滚红尘 3 l
+滚滚而来 3 l
+滚烫 161 z
+滚热 32 z
+滚珠 8 n
+滚珠承轴 3 n
+滚珠轴承 8 nz
+滚球 11 n
+滚瓜流水 3 i
+滚瓜溜圆 3 l
+滚瓜烂熟 47 i
+滚石 18 n
+滚筒 32 n
+滚筒式 14 b
+滚筒轴 3 nz
+滚翻 23 v
+滚落 125 v
+滚蛋 102 n
+滚装 10 v
+滚装船 20 l
+滚走 3 v
+滚起 3 v
+滚起来 3 l
+滚轧 3 v
+滚转 15 v
+滚轮 66 n
+滚轴 6 n
+滚边 22 z
+滚进 3 v
+滚道 3 v
+滚针轴承 3 l
+滚雪 3 n
+滚雪球 146 n
+滚雷 17 n
+滚齿机 4 n
+滚龙王 3 nz
+滞 446 vg
+滞产 3 v
+滞压 3 v
+滞后 253 v
+滞后性 12 n
+滞后效应 3 n
+滞头 3 v
+滞存 3 v
+滞差 3 v
+滞延 3 v
+滞愤 3 v
+滞油区 3 n
+滞泥 3 n
+滞洪 28 v
+滞洪区 3 n
+滞涩 10 v
+滞留 193 v
+滞留不归 3 n
+滞留到 3 n
+滞留锋 3 n
+滞碍 3 v
+滞碍难行 3 n
+滞积 3 v
+滞纳 3 v
+滞纳金 10 n
+滞缓 28 v
+滞育 53 v
+滞胀 30 v
+滞货 3 n
+滞针 3 n
+滞销 45 v
+滞销产品 3 n
+滞销品 3 n
+滞销货 3 n
+滞闷 3 v
+滟 8 x
+滠 7 g
+满 9603 a
+满不在乎 132 i
+满不在意 3 i
+满东燕 2 nr
+满严嵩 3 nr
+满于 3 v
+满井风 2 nr
+满仓 22 v
+满仓哥 2 nr
+满以为 3 nr
+满体壮 2 nr
+满值 3 n
+满兴汉 2 nr
+满兵刃 2 nr
+满出 3 v
+满分 154 d
+满分者 3 n
+满则招损 3 i
+满到 3 v
+满匙 3 n
+满双弦 2 nr
+满口 260 ns
+满口生 4 nr
+满口答应 3 ns
+满口胡 5 nr
+满口胡扯 3 l
+满口胡说 3 l
+满口脏话 3 n
+满向东 2 nr
+满含 43 v
+满含热泪 3 l
+满吴佩 3 nr
+满员 31 n
+满嘴 152 ns
+满嘴胡话 3 l
+满嘴都是 3 i
+满园 24 ns
+满园春色 13 ns
+满地 405 n
+满地找牙 3 l
+满地瞅 2 nr
+满地跑 3 ns
+满场 27 n
+满场子 3 n
+满坐风生 3 i
+满坑 3 ns
+满坑满谷 6 i
+满坡 7 ns
+满垒 3 n
+满城 197 ns
+满城县 12 ns
+满城风雨 23 i
+满堂 82 nr
+满堂喝彩 7 i
+满堂彩 9 i
+满堂灌 3 nr
+满堂红 21 nr
+满壁 4 ns
+满壁风 2 nr
+满复汉 3 nr
+满够 3 v
+满大人 2 nr
+满大街 2 ns
+满天 161 t
+满天下 3 l
+满天世界 3 nz
+满天星 33 nr
+满天星斗 3 i
+满天飞 70 nr
+满头 302 v
+满头包 3 i
+满头大汗 157 ns
+满头白发 3 i
+满子范畴 3 nr
+满孝 3 nr
+满官 4 n
+满宝石 2 nr
+满宠谏 2 nr
+满室 2 n
+满室生 6 nr
+满室生辉 3 nr
+满就送 3 nr
+满屋 3 ns
+满屋子 3 nr
+满屋飘香 3 i
+满屏 3 nr
+满山 23 ns
+满山满 3 nr
+满山满谷 3 ns
+满山红 9 nr
+满山遍野 25 i
+满岁 3 n
+满州 3 ns
+满州人 3 nr
+满州国 3 ns
+满州话 3 n
+满州里 3 ns
+满巷 2 ns
+满布 49 v
+满布红 4 nr
+满帆 3 nr
+满师 2 n
+满席 3 n
+满庆堂 4 nr
+满庚哥 43 nr
+满座 42 nz
+满座风生 3 nz
+满庭芳 7 nr
+满延津 2 nr
+满当当 4 v
+满心 304 v
+满心欢喜 3 i
+满怀 491 nr
+满怀信心 83 i
+满怀希望 3 nr
+满怀深情 11 i
+满怀激情 3 l
+满怀豪情 3 l
+满意 3417 v
+满意哦 3 v
+满意度 126 ns
+满意率 17 nz
+满手 3 v
+满手是汗 3 l
+满手是血 3 l
+满打满算 17 l
+满拉 3 ns
+满招损 3 v
+满拧 3 nr
+满文 234 nz
+满文军 3 nr
+满斗 3 v
+满族 1499 nz
+满春宫 2 nr
+满月 143 t
+满月酒 3 nz
+满有 3 v
+满朝 18 t
+满朝公 4 nr
+满朝官 3 nr
+满朝忠义 2 nr
+满朝文 3 nr
+满朝臣 2 nr
+满期 15 d
+满桂之 2 nr
+满桂守 2 nr
+满桂调 2 nr
+满桂身 2 nr
+满桌 3 n
+满档 3 b
+满水银 2 nz
+满汉 158 ns
+满汉全席 31 l
+满汉各 2 nr
+满汉合 2 nr
+满汉席 3 nr
+满汉文 9 nr
+满江 9 ns
+满江湖 2 ns
+满江红 40 nr
+满池 3 ns
+满洞群 3 nr
+满洲 1543 ns
+满洲国 57 ns
+满洲里 38 ns
+满洲里市 15 ns
+满洲问题 3 n
+满流承 2 nr
+满清 513 nr
+满清帝国 3 ns
+满清时代 3 t
+满清末年 3 t
+满清水 2 nr
+满湖 3 ns
+满溢 3 v
+满满 193 v
+满满地 3 z
+满满当当 42 z
+满满登登 3 nr
+满满的 163 z
+满潮 3 nr
+满火焰 2 l
+满灰尘 4 n
+满点 3 n
+满珍珠 2 nr
+满电 3 nz
+满登登 3 nr
+满白雪 2 nr
+满百 3 nz
+满盈 3 nr
+满盘 7 v
+满盘皆输 10 i
+满目 71 n
+满目凄凉 4 i
+满目潇然 3 nr
+满目生辉 3 i
+满目疮痍 14 i
+满目苍凉 3 i
+满目荒凉 5 i
+满眶 3 n
+满眼 143 d
+满石湖 2 ns
+满篇 5 b
+满级 3 b
+满纸空言 3 i
+满绿毛 3 nr
+满者伯 3 nr
+满而不溢 3 l
+满肚子 3 l
+满肚子火 3 l
+满脑子 3 l
+满脑袋 3 l
+满脸 1980 d
+满脸堆笑 3 vn
+满脸春色 3 i
+满脸春风 4 nr
+满脸横肉 3 i
+满脸稚气 3 n
+满脸风霜 3 i
+满腔 457 n
+满腔仇恨 3 i
+满腔悲愤 3 l
+满腔热忱 8 i
+满腔热情 43 n
+满腔热枕 3 i
+满腔热血 3 i
+满腹 202 n
+满腹心事 3 i
+满腹心酸 3 n
+满腹文章 3 i
+满腹牢骚 21 i
+满腹狐疑 30 i
+满腹珠玑 3 nz
+满腹疑云 3 l
+满腹疑团 21 l
+满腹经纶 33 i
+满舌生花 3 i
+满舵 6 v
+满船 3 nz
+满荡荡 2 z
+满蒙汉 10 ns
+满血 3 v
+满街 114 ns
+满街跑 3 ns
+满袁世 5 nr
+满袖春风 3 i
+满观道士 4 ns
+满觉陇 4 nr
+满语 33 nz
+满谷满坑 3 ns
+满负荷 18 nr
+满贯 35 nr
+满足 4725 v
+满足感 36 n
+满足条件 3 l
+满足用户 6 n
+满足用户要求 2 i
+满足私欲 3 i
+满足要求 5 l
+满足需要 3 l
+满身 341 v
+满身是汗 3 l
+满身是血 3 l
+满车 3 n
+满载 351 v
+满载而归 24 i
+满达尔 8 nr
+满配齐 2 nr
+满野 3 ns
+满量程 3 l
+满钻石 2 nr
+满铁 16 n
+满银 8 nz
+满门 111 ns
+满门抄斩 3 n
+满院 3 nz
+满青藤 3 nr
+满面 307 n
+满面怒容 3 i
+满面春风 54 nz
+满面杀气 3 i
+满面笑容 35 i
+满面红光 22 nz
+满颖之 2 nr
+满额 40 n
+满饮 2 v
+满鲜花 3 nz
+满黑毛 2 nr
+滢 7 g
+滤 274 zg
+滤光 3 nz
+滤光片 32 nz
+滤光镜 3 nz
+滤出 3 v
+滤出去 3 v
+滤出来 3 v
+滤到 3 v
+滤去 3 v
+滤嘴 3 nz
+滤器 5 nz
+滤头 3 n
+滤布 6 v
+滤掉 3 v
+滤斗 3 n
+滤机 2 n
+滤水器 3 nz
+滤水池 3 n
+滤池 2 n
+滤油机 3 n
+滤泡 3 n
+滤波 63 n
+滤波器 106 nz
+滤液 16 nz
+滤清 3 v
+滤清器 13 nz
+滤渣 2 n
+滤球 3 n
+滤管 3 n
+滤纸 42 nz
+滤网 6 nz
+滤膜 3 nz
+滤膜杂交 3 n
+滤色片 3 n
+滤色镜 3 nz
+滤芯 3 nz
+滤菌器 3 nz
+滤过 3 v
+滤过代数 3 nz
+滤过性 3 n
+滤过性毒 3 nz
+滤过性病 3 n
+滤镜 3 nz
+滤除 3 v
+滤陳允 3 v
+滤饼 3 n
+滤饼厚度 3 n
+滥 462 v
+滥交 5 v
+滥伐 22 v
+滥伐林木 3 n
+滥减 3 v
+滥占 3 v
+滥印 3 v
+滥发 37 v
+滥取 3 v
+滥垦 3 v
+滥增 3 v
+滥套 3 v
+滥套子 3 n
+滥好人 3 l
+滥官污吏 7 i
+滥射 3 v
+滥情 3 v
+滥捕 3 v
+滥摊 3 v
+滥收 3 v
+滥施 3 v
+滥杀 31 v
+滥杀无辜 54 l
+滥用 541 v
+滥用权力 3 l
+滥用特权 3 l
+滥用职权 3 l
+滥砍 3 v
+滥砍滥伐 3 i
+滥竽 2 n
+滥竽充数 10 i
+滥花 3 v
+滥觞 29 v
+滥词 3 n
+滥调 6 v
+滥调陈腔 3 n
+滥贴 3 v
+滥赌 3 v
+滥造 3 v
+滥配 3 v
+滦 100 ns
+滦南 3 ns
+滦南县 2 ns
+滦县 22 ns
+滦州 3 ns
+滦平 12 ns
+滦平县 7 ns
+滦水 3 ns
+滦水县 3 ns
+滦河 85 ns
+滦洲 3 ns
+滨 835 ns
+滨临 3 ns
+滨临大海 3 ns
+滨县 3 ns
+滨城区 3 ns
+滨外坝 3 n
+滨崎步 3 ns
+滨州 25 ns
+滨州市 14 ns
+滨松 9 n
+滨江 26 ns
+滨江区 3 ns
+滨江街 3 ns
+滨江路 6 ns
+滨江道 2 ns
+滨河 17 ns
+滨河公园 3 ns
+滨河路 6 ns
+滨洲 25 ns
+滨海 441 ns
+滨海公路 3 ns
+滨海区 6 ns
+滨海县 2 ns
+滨海学院 3 n
+滨海新区 3 ns
+滨海省 2 ns
+滨湖 54 ns
+滨湖公路 3 ns
+滨湖区 10 ns
+滨草 3 n
+滩 1332 ng
+滩区 2 n
+滩地 65 n
+滩地沼泽 3 v
+滩声 3 n
+滩头 72 n
+滩头堡 3 n
+滩头阵地 3 n
+滩海 3 n
+滩涂 134 n
+滩涂地 2 n
+滩涂式 3 n
+滩簧 7 n
+滩羊 23 n
+滩羊皮 7 n
+滩脊 3 n
+滱 7 zg
+滲 2 zg
+滴 1475 v
+滴下 3 n
+滴下去 3 v
+滴下来 3 l
+滴丸 10 n
+滴入 7 v
+滴出 3 v
+滴出来 3 i
+滴到 3 v
+滴剂 3 n
+滴向 3 n
+滴哒 47 o
+滴哩答拉 3 z
+滴定 241 v
+滴定仪 3 n
+滴定剂 3 n
+滴定法 3 n
+滴定率 3 n
+滴定管 28 n
+滴水 152 n
+滴水不漏 84 i
+滴水之恩 3 l
+滴水兽 3 n
+滴水岩 3 n
+滴水成冰 19 i
+滴水成河 3 nz
+滴水檐 11 n
+滴水洞 3 n
+滴水瓦 3 n
+滴水石穿 3 i
+滴水穿石 3 i
+滴水难消 3 l
+滴汗 3 n
+滴汞电极 3 v
+滴沥 6 o
+滴油 3 n
+滴注 3 v
+滴泪 3 n
+滴流 10 n
+滴溜 3 o
+滴溜儿 3 z
+滴溜溜 80 z
+滴溜溜转 10 l
+滴溜滚圆 3 z
+滴滤池 3 n
+滴滴 3 n
+滴滴嗒嗒 3 o
+滴滴涕 25 i
+滴滴答答 26 o
+滴漏 14 v
+滴漏式 3 n
+滴灌 27 v
+滴点 3 n
+滴状 3 n
+滴状油罐 3 n
+滴眼剂 3 n
+滴眼液 10 n
+滴眼药 9 n
+滴答 40 o
+滴答作响 3 i
+滴答响 3 i
+滴答声 3 i
+滴管 32 n
+滴粉搓酥 3 z
+滴翠 17 z
+滴耳液 5 n
+滴落 54 v
+滴虫 34 n
+滴虫性 3 n
+滴虫病 6 n
+滴血 3 n
+滴血钻石 3 i
+滴道区 3 n
+滴里嘟噜 3 o
+滴雨 3 n
+滴雨未下 3 i
+滴露 4 v
+滴露研朱 3 n
+滴露研珠 3 nz
+滴鼻 7 v
+滴鼻剂 7 n
+滹 8 ns
+滹沱 11 ns
+滹沱河 94 ns
+滺 7 zg
+漁 66 zg
+漂 424 v
+漂亮 1921 a
+漂亮仗 3 n
+漂亮女孩 3 n
+漂亮妹妹 3 n
+漂亮潇洒 3 z
+漂亮衣服 3 i
+漂亮话 9 n
+漂亮起来 3 i
+漂儿 3 n
+漂出 3 v
+漂到 3 v
+漂动 3 a
+漂卤 3 n
+漂去 3 v
+漂向 3 v
+漂回 3 v
+漂好 3 a
+漂往 3 v
+漂摆 3 v
+漂散 3 v
+漂来 3 v
+漂来漂去 3 z
+漂染 9 v
+漂母进饭 3 n
+漂泊 136 v
+漂泊异乡 3 i
+漂泊无定 3 nz
+漂泊游荡 3 i
+漂泊者 5 n
+漂洋 3 n
+漂洋过海 14 i
+漂洗 27 v
+漂流 231 a
+漂流不定 3 i
+漂流到 3 v
+漂流瓶 3 i
+漂流船 3 n
+漂流记 11 n
+漂浮 307 v
+漂浮物 8 n
+漂浮软管 3 i
+漂海 3 v
+漂游 12 v
+漂渺 3 a
+漂漂亮亮 21 z
+漂白 64 v
+漂白剂 26 n
+漂白布 4 n
+漂白液 3 n
+漂白粉 40 n
+漂着 3 v
+漂砾 8 n
+漂移 180 v
+漂移区 3 n
+漂移失效 3 i
+漂荡 3 v
+漂落 3 v
+漂蓬断梗 3 i
+漂行 3 v
+漂走 3 v
+漂起 3 v
+漂过 3 v
+漂过去 3 v
+漂过来 3 v
+漂零 3 v
+漂零蓬断 3 i
+漂香 3 a
+漅 12 zg
+漆 1163 v
+漆上去 3 i
+漆上来 3 nr
+漆亮 4 z
+漆作 3 n
+漆出 3 n
+漆刷 3 z
+漆包线 5 n
+漆匠 5 n
+漆吴茶 2 nr
+漆员外 8 nr
+漆器 280 n
+漆园 3 n
+漆园吏 2 nr
+漆大柱 2 nr
+漆好 3 z
+漆家河 3 nr
+漆川岛 2 nr
+漆工 11 n
+漆巨柱 128 nr
+漆布 4 nr
+漆帚 3 n
+漆座屏 4 nr
+漆成 3 nr
+漆料 3 n
+漆树 316 n
+漆桶 3 n
+漆棺石 3 nr
+漆汁 3 n
+漆液 2 n
+漆片 3 n
+漆画 11 n
+漆皮 14 n
+漆盘托 3 nr
+漆膜 4 n
+漆艺 4 n
+漆身吞炭 3 i
+漆过 3 n
+漆过去 3 i
+漆过来 3 nr
+漆门 3 n
+漆雕 7 n
+漆高柱 2 nr
+漆黑 617 z
+漆黑一团 67 i
+漆黑一片 3 i
+漈 11 zg
+漉 21 v
+漊 20 zg
+漏 1057 v
+漏下 3 v
+漏借 3 v
+漏光 6 n
+漏兜 3 n
+漏减 3 v
+漏出 3 v
+漏出去 3 v
+漏出来 3 l
+漏刊 3 n
+漏划 3 n
+漏列 3 v
+漏判 3 v
+漏刻 3 n
+漏办 3 v
+漏加 3 v
+漏勺 6 n
+漏卮难满 3 ns
+漏嘴 3 v
+漏填 3 v
+漏壶 27 n
+漏处 3 n
+漏夜 6 t
+漏失 3 v
+漏失掉 3 v
+漏子 29 n
+漏孔 3 n
+漏字 3 nz
+漏尽 3 v
+漏尽更阑 3 i
+漏尽钟鸣 3 i
+漏尽锺鸣 3 vn
+漏屋 3 n
+漏底 3 t
+漏征 3 n
+漏扣 3 n
+漏报 10 nz
+漏掉 74 v
+漏排 3 v
+漏接 3 v
+漏接电话 3 l
+漏收 3 v
+漏放 3 v
+漏斗 186 v
+漏斗子 3 n
+漏斗状 52 nz
+漏景 3 n
+漏极电导 3 n
+漏查 3 vn
+漏检 3 v
+漏气 24 n
+漏水 71 n
+漏池 3 n
+漏油 14 n
+漏泄 15 v
+漏泄天机 3 i
+漏泄春光 3 i
+漏波天线 3 nz
+漏洞 492 n
+漏洞百出 23 i
+漏洞补丁 3 i
+漏洩春光 3 t
+漏点 17 n
+漏焊 3 nz
+漏电 36 nz
+漏疮 3 n
+漏看 3 v
+漏磁通 3 n
+漏税 76 n
+漏空 3 n
+漏窗 3 n
+漏纳 3 nz
+漏结 3 v
+漏缝 2 n
+漏缴 3 v
+漏网 63 nz
+漏网之鱼 45 i
+漏罪 3 nz
+漏脉冲 3 i
+漏脱 3 v
+漏芦 3 n
+漏花墙 3 n
+漏行 3 v
+漏计 3 v
+漏记 3 n
+漏诉 3 v
+漏诊 8 v
+漏误 3 n
+漏谷 3 n
+漏财之源 3 l
+漏转 3 v
+漏进 3 v
+漏进去 3 l
+漏进来 3 l
+漏针 3 n
+漏隙 3 n
+漏雨 3 n
+漏面 3 n
+漏页 3 n
+漏风 24 n
+漏风声 2 i
+漏馅 3 nz
+漑 4 zg
+漓 150 zg
+漓水 3 ns
+漓江 127 ns
+演 2790 v
+演不下 3 v
+演丰镇 3 n
+演义 96 n
+演习 3808 v
+演习场 33 n
+演兵场 51 n
+演出 4125 v
+演出团 12 n
+演出季 11 n
+演出成功 3 n
+演出服 3 vn
+演出票 3 n
+演出者 10 n
+演出证 3 vn
+演出队 18 n
+演到 3 v
+演剧 64 n
+演剧队 27 n
+演化 795 v
+演化出 3 n
+演化史 11 n
+演化成 3 n
+演化算符 3 n
+演化论 3 n
+演化过程 3 n
+演双簧 3 n
+演变 1797 v
+演变史 20 n
+演变成 3 v
+演古劝今 3 v
+演员 2938 n
+演员表 3 n
+演员阵容 3 n
+演唱 579 v
+演唱会 154 n
+演唱家 3 n
+演唱组 10 n
+演唱者 24 n
+演唱艺术 3 n
+演唱风格 3 n
+演坛 3 n
+演奏 1122 v
+演奏会 8 n
+演奏厅 3 n
+演奏台 9 n
+演奏员 16 n
+演奏室 3 n
+演奏家 84 n
+演奏师 3 n
+演奏曲 3 n
+演奏法 5 n
+演奏者 57 n
+演好 3 v
+演对 3 v
+演对戏路 3 n
+演得 3 v
+演惯 3 n
+演戏 203 n
+演成 3 v
+演技 55 n
+演技派 3 n
+演播 14 vn
+演播厅 15 n
+演播室 42 n
+演替 28 v
+演歌 3 n
+演武 10 n
+演武修文 3 n
+演武厅 13 n
+演活 3 vn
+演演 3 v
+演演看 3 n
+演着 3 v
+演示 299 v
+演示会 4 n
+演示版 3 n
+演秘 3 v
+演算 159 v
+演算出 3 v
+演算法 3 n
+演算题 3 n
+演练 869 vn
+演练法 3 n
+演绎 292 v
+演绎出 3 n
+演绎则 2 n
+演绎推理 40 n
+演绎数学 9 n
+演绎模拟 3 n
+演绎法 16 n
+演职人员 8 n
+演职员 11 n
+演艺 95 n
+演艺事业 3 n
+演艺人 3 n
+演艺圈 14 n
+演艺场所 3 n
+演艺界 34 n
+演讲 748 v
+演讲人 15 n
+演讲会 18 n
+演讲台 2 n
+演讲学 3 n
+演讲时 3 n
+演讲术 3 n
+演讲比赛 3 n
+演讲稿 5 n
+演讲者 8 n
+演讲词 3 n
+演讲赛 3 n
+演讲辞 3 n
+演讲集 3 n
+演证 3 v
+演词 2 n
+演译 3 v
+演说 481 v
+演说家 3 n
+演说稿 3 v
+演说者 3 n
+演说词 3 n
+演说辞 3 v
+演起 3 v
+演起来 3 v
+演过 3 v
+演进 171 v
+演进到 3 v
+漕 346 v
+漕宝路 3 n
+漕木 3 n
+漕河 36 ns
+漕河泾 15 ns
+漕泾 4 ns
+漕溪 5 ns
+漕溪路 3 ns
+漕粮 88 n
+漕运 756 v
+漠 343 ns
+漠不关心 50 l
+漠不相关 2 i
+漠北 251 ns
+漠南 3 ns
+漠地 3 z
+漠河 46 ns
+漠河县 9 ns
+漠漆 3 z
+漠漠 48 ns
+漠然 115 z
+漠然处之 3 i
+漠然置之 2 i
+漠然视之 2 i
+漠盖层 3 n
+漠视 123 n
+漠阳江 16 ns
+漡 14 zg
+漤 2 v
+漩 525 n
+漩流 2 n
+漩涡 181 n
+漩起 3 n
+漩风 3 n
+漪 37 g
+漪涟 6 n
+漪澜 4 n
+漫 841 a
+漫不加意 3 i
+漫不经心 145 i
+漫不经意 11 i
+漫出 3 a
+漫出来 3 i
+漫卷 9 n
+漫友币 3 n
+漫反射 3 l
+漫反射光 5 n
+漫地漫天 3 n
+漫天 203 z
+漫天匝地 3 z
+漫天叫价 3 i
+漫天大谎 6 i
+漫天大雪 3 i
+漫天开价 3 i
+漫天掩地 3 i
+漫天盖地 3 i
+漫天蔽野 3 i
+漫天要价 17 i
+漫天讨价 3 i
+漫天过海 3 i
+漫天遍地 3 i
+漫天遍野 2 i
+漫射 3 v
+漫射光 3 n
+漫山 13 ns
+漫山塞野 3 ns
+漫山遍野 68 i
+漫延 6 v
+漫录 6 n
+漫无 3 v
+漫无止境 19 i
+漫无目的 3 i
+漫无边际 47 i
+漫无际涯 3 i
+漫无限制 3 l
+漫条斯理 3 ns
+漫步 327 vn
+漫步者 3 n
+漫水 3 n
+漫水桥 2 n
+漫流 3 n
+漫游 308 vn
+漫游四方 3 n
+漫游生物 3 l
+漫游者 3 n
+漫游费 35 n
+漫湾 3 ns
+漫溢 9 v
+漫漫 164 a
+漫漫长夜 3 n
+漫漶 5 v
+漫灌 13 v
+漫画 313 n
+漫画书 5 n
+漫画作品 3 n
+漫画化 3 i
+漫画吧 3 n
+漫画图 3 i
+漫画图片 3 i
+漫画家 36 n
+漫画展 2 i
+漫画店 3 n
+漫画式 7 n
+漫画版 3 n
+漫画网 3 i
+漫画馆 3 n
+漫空杖 3 n
+漫笔 4 n
+漫藏诲盗 3 i
+漫衍 3 v
+漫言 3 n
+漫议 3 n
+漫记 3 n
+漫话 6 n
+漫说 3 n
+漫谈 20 vn
+漫过 34 v
+漫道 3 v
+漫长 1151 n
+漫长岁月 3 i
+漫骂 3 v
+漭 2 x
+漮 3 zg
+漯 24 ns
+漯河 79 ns
+漯河市 24 ns
+漱 131 v
+漱口 109 v
+漱口剂 3 n
+漱口杯 3 n
+漱口水 3 n
+漱口液 3 n
+漱口药水 3 n
+漱洗 3 v
+漱流枕石 3 vn
+漱石枕流 3 vn
+漱过 3 v
+漳 175 ns
+漳县 3 ns
+漳州 206 ns
+漳州人 3 nz
+漳州市 36 ns
+漳州战役 2 nz
+漳平 7 ns
+漳平市 6 ns
+漳河 57 ns
+漳河水库 2 ns
+漳泽 2 ns
+漳浦 10 ns
+漳浦县 10 ns
+漴 4 zg
+漶 2 x
+漷 6 zg
+漸 3 zg
+漼 2 zg
+漽 18 zg
+漾 106 zg
+漾濞 11 ns
+漾濞县 2 v
+潃 735 zg
+潄 26 zg
+潅 28 zg
+潆 4 x
+潇 79 ns
+潇水 8 ns
+潇洒 483 a
+潇洒不羁 3 i
+潇洒自如 3 i
+潇洒走 3 i
+潇洒风流 3 i
+潇湘 634 ns
+潇湘书院 3 nt
+潇湘子 3 ns
+潇湘晨报 3 nt
+潇湘电影制片厂 3 nt
+潇潇 27 z
+潇潇洒洒 5 z
+潈 56 zg
+潋 2 z
+潋滟 9 z
+潌 18 zg
+潍 41 ns
+潍县 30 ns
+潍坊 117 ns
+潍坊市 32 ns
+潍城区 3 ns
+潍河 3 ns
+潎 15 zg
+潏 4 zg
+潑 4 zg
+潕 210 zg
+潖 43 zg
+潗 105 zg
+潘 573 nr
+潘一鹤 33 nr
+潘三保 3 nr
+潘与林 4 nr
+潘世征 11 nr
+潘东周 2 nr
+潘丽娜 25 nr
+潘义务 3 nr
+潘云召 12 nr
+潘任美 4 nr
+潘作良 2 nr
+潘佩珠 5 nr
+潘先生 4 nr
+潘光旦 8 nr
+潘克拉托夫 3 nrt
+潘公凯 18 nr
+潘公央 2 nr
+潘公自 2 nr
+潘冬子 2 nr
+潘凤霞 3 nr
+潘加尼 3 nr
+潘卡罗 3 nr
+潘又安 2 nr
+潘及丹 3 nr
+潘叔嗣 2 nr
+潘古城 2 nr
+潘哈德 45 nr
+潘国定 2 nr
+潘地亚 3 ns
+潘坤龙 3 ns
+潘基文 3 nr
+潘塔雷 2 nr
+潘复生 3 nr
+潘多拉 43 nr
+潘大人 2 nr
+潘天寿 33 nr
+潘天耕 27 nr
+潘孟二 2 nr
+潘季训 12 nr
+潘季驯 53 nr
+潘安 18 nr
+潘安再世 3 nr
+潘家口 6 nr
+潘家口水库 4 nz
+潘家园 102 nr
+潘家洵 3 nr
+潘家珉 2 nr
+潘家蕃 3 ns
+潘家铮 4 nr
+潘小光 3 nr
+潘尼兹 2 nr
+潘尼塔 2 nr
+潘岳 11 nr
+潘巧云 9 nr
+潘师正 4 nr
+潘帕斯 34 nr
+潘庆新 28 nr
+潘德夫 3 nr
+潘德尔 2 nr
+潘德里奇 2 nr
+潘必正 2 nr
+潘志义 8 nr
+潘志文 3 nr
+潘志明 5 nr
+潘念之 3 nr
+潘承洞 9 nr
+潘振平 2 nr
+潘振涛 9 nr
+潘敏立 42 nr
+潘文乐旨 3 nr
+潘文凯 7 nr
+潘文华 3 nr
+潘文堂 3 nr
+潘文得 4 nr
+潘昂霄 2 nr
+潘晓婷 3 nr
+潘晓明 2 nr
+潘普洛纳 2 nr
+潘景华 2 nr
+潘朵拉 7 nr
+潘梓年 2 ns
+潘永源 2 nr
+潘汉年 77 nr
+潘江陆海 3 nr
+潘浩翰 4 nr
+潘灵飞 3 nr
+潘爱玲 3 nr
+潘爱珠 3 nr
+潘特里 4 nr
+潘独鳌 63 nr
+潘玉珍 10 nr
+潘玮伯 2 nr
+潘玮柏 13 nr
+潘玲玲 3 nr
+潘璋部 2 nr
+潘璋领 2 nr
+潘生丁 10 nr
+潘知恒 2 nr
+潘石屹 12 nr
+潘磊华 7 nr
+潘祖尧 2 nr
+潘祖彝 2 nr
+潘秀达 14 nr
+潘秉衡 8 nr
+潘立文 5 nr
+潘粤明 256 nr
+潘素梅 2 nr
+潘索运动 3 nz
+潘红胺 8 nr
+潘维刚 2 nr
+潘罗支 3 nr
+潘美削 2 nr
+潘美前 2 nr
+潘美辰 3 nr
+潘耀武 3 nr
+潘育杰 3 nr
+潘艳丽 3 nr
+潘英伯 3 nr
+潘蜀健 2 nr
+潘裕昆 2 nr
+潘西境 2 nr
+潘西平 2 nr
+潘诺尼 9 nr
+潘谷墨 3 nr
+潘赛菊 3 nr
+潘越云 3 nr
+潘达雷 2 nr
+潘迎紫 3 nr
+潘连生 3 nr
+潘迪亚 10 nr
+潘金培 2 nr
+潘金莲 123 nr
+潘长江 5 nr
+潘阿祥 2 nr
+潘集区 2 nr
+潘集阳 2 nr
+潘雨晨 3 nr
+潘震宙 9 nr
+潘革平 2 nr
+潘韵民 2 nr
+潘顺玉 3 nr
+潘频模 2 nr
+潘鹏凯 22 nr
+潘鼎新 4 nr
+潙 26 zg
+潚 43 zg
+潜 1733 v
+潜上 3 n
+潜上去 3 v
+潜上来 3 v
+潜下 3 n
+潜下去 3 t
+潜下来 3 t
+潜亏 3 v
+潜伏 299 v
+潜伏学习 3 n
+潜伏性 8 n
+潜伏期 90 t
+潜伏着 3 v
+潜休隐德 3 ns
+潜修 10 v
+潜光隐德 3 i
+潜光隐耀 3 n
+潜入 316 v
+潜入夜 3 b
+潜入者 3 n
+潜出 3 v
+潜出去 3 v
+潜出来 3 v
+潜到 3 v
+潜力 1274 n
+潜力股 3 n
+潜势 2 n
+潜势力 3 n
+潜匿 3 v
+潜去 3 t
+潜口 2 n
+潜台词 43 n
+潜回 43 v
+潜图问鼎 3 i
+潜在 533 t
+潜在力量 3 n
+潜在地 3 n
+潜在性 2 n
+潜在状态 3 n
+潜在用户 3 n
+潜在胶质 3 n
+潜在蒸散 3 i
+潜在酸 3 n
+潜居 3 v
+潜山 32 ns
+潜山县 7 ns
+潜山隐市 3 ns
+潜形匿影 3 i
+潜形匿迹 3 i
+潜形谲迹 3 v
+潜得 3 v
+潜德秘行 3 n
+潜德隐行 3 ns
+潜心 333 n
+潜心于 3 n
+潜心斋 3 n
+潜心涤虑 3 i
+潜心研究 3 n
+潜心笃志 3 n
+潜意识 165 n
+潜无穷 3 i
+潜望 39 v
+潜望镜 185 n
+潜来 3 v
+潜水 609 n
+潜水员 47 n
+潜水器 66 n
+潜水夫 3 n
+潜水服 11 n
+潜水泵 2 n
+潜水艇 78 n
+潜水衣 2 n
+潜水表 4 n
+潜水装 3 n
+潜水镜 3 n
+潜水面 3 n
+潜江 798 ns
+潜江县 7 ns
+潜江市 1031 ns
+潜泳 24 n
+潜流 91 n
+潜消默化 3 n
+潜游 3 n
+潜滋暗长 3 n
+潜濡默化 3 i
+潜濡默被 3 i
+潜热 47 n
+潜留 3 v
+潜研堂 3 n
+潜神嘿规 3 vn
+潜神默思 3 i
+潜神默记 3 n
+潜科学 3 n
+潜移 3 v
+潜移嘿夺 3 vn
+潜移暗化 3 i
+潜移阴夺 3 i
+潜移默化 88 i
+潜移默夺 3 i
+潜移默转 3 i
+潜移默运 3 i
+潜精研思 3 n
+潜精积思 3 n
+潜育化 3 n
+潜育期 3 n
+潜能 217 v
+潜能模式 3 n
+潜航 26 v
+潜航力 3 n
+潜艇 2884 n
+潜艇队 3 n
+潜藏 76 n
+潜藏在 3 n
+潜藏着 3 n
+潜蚀作用 3 n
+潜蛟困凤 3 nr
+潜血 9 n
+潜行 43 v
+潜行性龋 3 v
+潜行者 3 n
+潜规则 3 n
+潜质 79 n
+潜踪 3 v
+潜踪匿影 3 i
+潜踪蹑迹 3 v
+潜踪隐迹 3 i
+潜身远祸 3 i
+潜身远迹 3 i
+潜近 3 t
+潜进 3 v
+潜进去 3 v
+潜进来 3 v
+潜逃 87 v
+潜阳 8 ns
+潜隐 7 v
+潜鳞戢羽 3 v
+潜鸟 3 n
+潜龙 3 n
+潜龙伏虎 3 i
+潜龙勿用 3 i
+潜龙谍影 3 n
+潞 168 nz
+潞城 30 ns
+潞城县 3 ns
+潞城市 3 ns
+潞安 9 nz
+潞河 9 ns
+潞西 8 ns
+潞西县 5 ns
+潞西市 2 ns
+潟 155 zg
+潟湖 3 v
+潟肚子 3 v
+潠 2 zg
+潡 32 zg
+潢 70 ns
+潢川 21 ns
+潢川县 8 ns
+潢池弄兵 3 ns
+潢池盗弄 3 vn
+潣 12 zg
+潤 49 zg
+潥 69 zg
+潦 67 a
+潦倒 54 a
+潦原浸天 3 z
+潦潦草草 3 nz
+潦草 77 a
+潧 74 zg
+潨 8 zg
+潩 13 zg
+潪 54 zg
+潫 29 zg
+潬 38 zg
+潭 896 n
+潭头 2 n
+潭头镇 3 ns
+潭子 2 n
+潭州 3 ns
+潭底 3 n
+潭影 3 n
+潭心 3 n
+潭柘寺 7 ns
+潭水 59 n
+潭石 3 n
+潭第 3 n
+潭边 40 n
+潭里 3 ns
+潭静 3 n
+潮 1645 n
+潮上带 3 n
+潮乎乎 5 z
+潮位 17 n
+潮信 3 n
+潮剧 138 n
+潮南区 3 ns
+潮卷浪涌 3 l
+潮向 3 n
+潮呼呼 3 z
+潮土 3 n
+潮声 3 n
+潮头 53 n
+潮安 12 ns
+潮安县 6 ns
+潮州 128 ns
+潮州人 2 n
+潮州市 27 ns
+潮州菜 3 n
+潮差 65 n
+潮平两岸阔 3 n
+潮时 4 n
+潮气 32 n
+潮气量 3 n
+潮水 447 n
+潮水般 3 l
+潮汐 298 n
+潮汐发电 3 n
+潮汐能 26 n
+潮汐通道 3 n
+潮汕 69 ns
+潮汕人 3 ns
+潮汕地区 20 ns
+潮汕方言 3 ns
+潮汛 5 n
+潮沟 3 ns
+潮河 27 ns
+潮流 998 n
+潮涌 43 n
+潮润 14 n
+潮润润 3 n
+潮涨潮 3 n
+潮涨潮落 8 l
+潮湿 611 a
+潮溼 3 z
+潮滩 3 ns
+潮热 49 a
+潮田乡 3 ns
+潮白河 45 ns
+潮红 69 n
+潮落 3 n
+潮解 9 v
+潮讯 3 n
+潮起 3 v
+潮起潮落 13 l
+潮间带 76 n
+潮阳 15 ns
+潮阳区 3 ns
+潮阳县 3 ns
+潮阳市 5 ns
+潮霉素 3 n
+潮音 3 n
+潮鸣电掣 3 l
+潯 137 zg
+潰 354 zg
+潱 4 zg
+潲 10 v
+潲水 3 n
+潲雨 3 n
+潳 2 zg
+潴 29 v
+潴泡 3 v
+潴留 46 v
+潴龙河 6 ns
+潵 1038 zg
+潶 26 zg
+潸 6 i
+潸潸 9 z
+潸然 6 z
+潸然泪下 47 i
+潹 256 zg
+潺 13 z
+潺潺 84 z
+潺潺流水 8 i
+潻 225 zg
+潼 23 ns
+潼关 598 ns
+潼关县 8 ns
+潼南 5 ns
+潼南县 7 ns
+潿 8 zg
+澂 41 zg
+澃 7 zg
+澄 623 ns
+澄光 3 nz
+澄净 15 z
+澄城 9 ns
+澄城县 3 ns
+澄心 3 v
+澄思渺虑 3 vn
+澄明 18 v
+澄江 19 ns
+澄江县 2 ns
+澄江如练 3 v
+澄江镇 2 ns
+澄沙 3 ns
+澄沙汰砾 3 v
+澄浆泥 3 v
+澄海 37 ns
+澄海区 3 ns
+澄海县 3 ns
+澄海市 2 ns
+澄清 407 v
+澄清事实 3 nz
+澄清器 3 nz
+澄清天下 3 ns
+澄清湖 3 ns
+澄源正本 3 ns
+澄澈 49 a
+澄碧 11 a
+澄神离形 3 nz
+澄莹 3 z
+澄观 3 nz
+澄识 3 v
+澄迈 5 z
+澄迈县 2 ns
+澄通 3 nz
+澇 2 zg
+澈 59 g
+澈底 3 nr
+澈底澄清 3 nr
+澉 6 ns
+澉浦 26 ns
+澉浦镇 4 ns
+澊 4 zg
+澌 7 g
+澍 17 g
+澎 61 ns
+澎县 3 ns
+澎湃 117 v
+澎湃汹涌 3 l
+澎湖 117 ns
+澎湖人 3 n
+澎湖列岛 63 ns
+澎湖县 8 ns
+澎湖湾 4 ns
+澎湖群岛 2 ns
+澏 2 zg
+澒 9 zg
+澖 2 zg
+澗 28 zg
+澘 30 zg
+澛 2 zg
+澜 368 ns
+澜倒波随 3 ns
+澜沧 17 ns
+澜沧拉祜族自治县 9 ns
+澜沧江 162 ns
+澡 190 n
+澡垢索疵 3 n
+澡堂 53 n
+澡堂子 28 n
+澡塘 8 n
+澡房 3 n
+澡池 3 n
+澡盆 24 n
+澡票 3 n
+澡身浴德 3 n
+澣 3 zg
+澥 2 zg
+澧 705 ns
+澧兰沅芷 3 nr
+澧县 38 ns
+澧水 66 ns
+澳 678 ns
+澳人治澳 2 ns
+澳众院 3 nt
+澳元 67 q
+澳元兑 3 n
+澳华 6 nz
+澳地利 3 ns
+澳大利 3 ns
+澳大利亚 2052 ns
+澳大利亚人 113 nz
+澳大利亚元 4 ns
+澳大利亚国防军 3 nt
+澳大利亚奥委会 2 nt
+澳大利亚广播公司 16 nt
+澳大利亚政府 15 nt
+澳大利亚联邦 24 nt
+澳大利亚联邦政府 3 nt
+澳大利亚西悉尼大学 4 ns
+澳大利亚队 21 nt
+澳头 2 ns
+澳州 2 ns
+澳抗 14 nz
+澳新 13 ns
+澳柯玛 64 nz
+澳毛 3 n
+澳洲 263 ns
+澳洲人 6 n
+澳洲界 3 ns
+澳洲籍 3 n
+澳瑞特 3 ns
+澳网 17 nz
+澳门 1912 ns
+澳门中华总商会 2 nt
+澳门元 3 ns
+澳门半岛 17 ns
+澳门国际机场 3 nt
+澳门地区 10 ns
+澳门基本法 2 ns
+澳门大学 12 nt
+澳门币 4 n
+澳门日报 3 nz
+澳门特别行政区 336 ns
+澳门特别行政区基本法 22 nz
+澳门特别行政区政府 10 nt
+澳门特区 6 ns
+澳门特区政府 10 nt
+澳门站 2 ns
+澳门航空公司 4 nt
+澳门街 3 ns
+澳门路 2 ns
+澴 2 zg
+澶 3462 ns
+澶渊 42 ns
+澹 620 zg
+澹台 34 nr
+澹台勉 4 nr
+澹台姊弟 3 nr
+澹台小姐 5 nr
+澹台玮 22 nr
+澹泊寡欲 3 nr
+澹泊明志 3 nr
+澹然处之 3 nr
+激 1242 n
+激于 3 v
+激于义愤 3 l
+激光 1336 n
+激光交联 3 nz
+激光制导 3 n
+激光医疗 2 n
+激光唱片 3 n
+激光器 258 n
+激光头 6 n
+激光打印机 3 l
+激光指示器 3 n
+激光散斑 3 n
+激光机 3 n
+激光束 78 n
+激光枪 3 n
+激光治疗 3 n
+激光测距 3 n
+激光测距仪 2 n
+激光灯 2 n
+激光炮 3 n
+激光照排 4 n
+激光照明 2 n
+激光管 3 n
+激光视盘 3 n
+激光退火 3 i
+激光遥感 3 l
+激光键合 3 n
+激光雕刻 3 i
+激光雷达 3 nz
+激出 3 v
+激切 18 a
+激剧 3 n
+激动 2700 a
+激动不已 54 l
+激动井 3 n
+激动人心 113 n
+激动剂 13 n
+激励 1075 v
+激励函数 3 n
+激励单元 3 n
+激励性 5 n
+激励机制 3 n
+激化 355 v
+激化矛盾 3 l
+激发 1195 v
+激发光源 3 n
+激发光谱 3 n
+激发子 3 n
+激发态 122 n
+激发极化 3 n
+激发标记 3 n
+激发起 3 l
+激发起来 3 l
+激变 24 v
+激变模型 3 n
+激增 158 v
+激增人数 3 n
+激增量 3 n
+激奋 20 v
+激子 3 n
+激射 4 v
+激将 29 n
+激将法 19 n
+激忿填膺 3 i
+激怒 416 a
+激情 1276 n
+激情化 3 n
+激情图 3 n
+激情戏 3 n
+激情放肆 3 n
+激情时刻 3 l
+激情片 3 n
+激情犯罪 3 l
+激情电影 3 n
+激情男女 3 l
+激情秀 3 i
+激情网 3 n
+激惹 15 v
+激愤 93 a
+激战 680 v
+激打 3 v
+激扬 31 v
+激扬清浊 3 n
+激振器 3 n
+激昂 535 a
+激昂慷慨 10 i
+激波 3 n
+激活 246 a
+激活剂 22 n
+激活子 3 n
+激活扩散 3 n
+激活物 3 n
+激活状态 3 l
+激活码 3 n
+激活能 3 n
+激活蛋白 3 l
+激流 480 n
+激流勇进 2 l
+激流勇退 3 l
+激流汹涌 3 l
+激浊扬清 9 i
+激浪 3 n
+激溅 3 v
+激灵 53 n
+激烈 2907 a
+激烈性 4 n
+激磁 6 n
+激素 1605 n
+激素原 3 n
+激素水平 3 n
+激素类 39 n
+激肽原 3 n
+激肽酶 3 n
+激肽酶原 3 n
+激荡 300 v
+激荡不已 3 l
+激薄停浇 3 i
+激论 3 n
+激贪厉俗 3 i
+激赏 13 v
+激起 1145 v
+激起公愤 3 l
+激越 132 a
+激辩 9 v
+激进 249 v
+激进主义 12 n
+激进份子 3 n
+激进党 17 n
+激进分子 3 n
+激进派 47 n
+激酶 52 n
+濂 1301 g
+濃 16 zg
+濄 86 zg
+濅 230 zg
+濆 408 zg
+濇 354 zg
+濈 216 zg
+濉 166 g
+濉溪 7 ns
+濉溪县 6 ns
+濊 192 zg
+濋 154 zg
+濑 17 ns
+濑户 13 ns
+濑户内海 23 ns
+濑户朝香 3 nr
+濑田 3 ns
+濒 329 v
+濒临 386 v
+濒临灭绝 3 n
+濒临破产 3 n
+濒临绝境 3 n
+濒临绝种 3 n
+濒于 126 v
+濒于绝境 3 n
+濒于绝种 3 n
+濒危 83 v
+濒危动物 3 n
+濒危种 2 n
+濒死 16 v
+濒河 3 v
+濒海 98 v
+濒湖脉学 3 n
+濒行 3 v
+濓 228 zg
+濙 66 zg
+濛 88 zg
+濛濛 3 z
+濛濛细雨 3 v
+濛濛谷 3 v
+濛雾 3 v
+濞 208 x
+濠 192 g
+濠头 3 ns
+濠梁之上 3 ns
+濠江 3 ns
+濠江区 3 ns
+濠沟 3 ns
+濡 547 zg
+濡养 17 v
+濡染 9 v
+濡湿 6 v
+濡溼 3 v
+濩 12 zg
+濬 59 zg
+濬哲 3 nrfg
+濬智 3 v
+濬深 3 v
+濮 618 ns
+濮之战 13 nr
+濮哥 19 ns
+濮存昕 36 nr
+濮州 7 ns
+濮州临 3 ns
+濮州司 2 nr
+濮水 3 ns
+濮阳 70 ns
+濮阳兴 2 ns
+濮阳县 3 ns
+濮阳市 10 ns
+濮阳维 3 nr
+濮阳西水 2 ns
+濯 64 vg
+濯污扬清 3 v
+濯濯 3 v
+濯缨 2 nz
+濯足 3 v
+濯足濯缨 3 v
+濯身 3 v
+濯锦 3 nz
+濸 2 zg
+濺 107 zg
+瀀 11 zg
+瀃 234 zg
+瀍 6 zg
+瀑 131 n
+瀑布 1236 n
+瀑布区 3 n
+瀑布群 3 n
+瀑布错觉 3 n
+瀑河 3 n
+瀑流 3 n
+瀘 2 zg
+瀚 86 n
+瀚海 30 n
+瀛 1332 ns
+瀛台 58 ns
+瀛寰 3 n
+瀛州 8 ns
+瀛州镇 3 ns
+瀛洲 3 ns
+瀛海 5 ns
+瀛海威 8 ns
+瀛湖 3 ns
+瀝 2 zg
+瀣 3 i
+瀬 78 zg
+瀭 3 zg
+瀯 25 zg
+瀰 51 zg
+瀴 7 zg
+瀵 740 g
+瀷 25 zg
+瀹 1733 g
+瀺 13 zg
+瀻 14 zg
+瀼 14 zg
+瀽 8 zg
+瀿 9 zg
+灂 2 zg
+灄 52 zg
+灉 85 zg
+灊 15 zg
+灌 1692 v
+灌上 3 n
+灌下 3 n
+灌丛 219 n
+灌于 3 v
+灌云 7 n
+灌云县 5 ns
+灌入 54 v
+灌出 3 v
+灌出去 3 v
+灌出来 3 vn
+灌到 3 v
+灌制 7 n
+灌区 150 n
+灌南 3 ns
+灌南县 3 ns
+灌县 3 ns
+灌反 3 v
+灌口 8 vn
+灌向 3 n
+灌唱片 3 n
+灌回 3 vn
+灌回去 3 l
+灌夫骂坐 3 n
+灌夫骂座 3 n
+灌好 3 v
+灌婴 3 n
+灌录 3 n
+灌排 11 vn
+灌救 3 v
+灌木 577 n
+灌木丛 129 n
+灌木林 42 ns
+灌木状 3 n
+灌木花坛 3 ns
+灌木花境 3 n
+灌来灌去 3 l
+灌死 3 v
+灌气 3 n
+灌水 75 n
+灌水区 3 n
+灌水版 3 n
+灌水王 3 n
+灌河 12 ns
+灌油 3 n
+灌油栓 3 n
+灌法 3 n
+灌注 76 v
+灌注桩 3 n
+灌洗 3 vn
+灌流 3 n
+灌浆 65 n
+灌浆儿 3 n
+灌渠 17 n
+灌溉 1205 vn
+灌溉区 9 n
+灌溉工程 3 n
+灌溉水 8 n
+灌溉渠 11 n
+灌溉渠道 3 n
+灌溉站 3 n
+灌溉系统 3 n
+灌溉网 7 n
+灌溉面积 3 n
+灌满 3 v
+灌灌 3 n
+灌点 3 n
+灌瓜之义 3 n
+灌篮 3 n
+灌篮高手 3 n
+灌米汤 5 n
+灌肠 61 n
+灌胃 3 n
+灌药 3 n
+灌装 16 n
+灌装机 3 n
+灌装线 3 n
+灌起 3 v
+灌起来 3 l
+灌输 184 vn
+灌输式 5 n
+灌输知识 3 n
+灌过 3 v
+灌进 3 v
+灌进去 3 v
+灌进来 3 l
+灌迷汤 3 l
+灌酒 3 n
+灌醉 34 vn
+灌阳 2 ns
+灌阳县 3 ns
+灌音 3 n
+灌顶 51 n
+灍 2 zg
+灎 2 zg
+灏 2196 g
+灒 7 zg
+灔 3 zg
+灖 15 zg
+灘 4 zg
+灙 204 zg
+灚 4 zg
+灛 3 zg
+灜 8 zg
+灝 6 zg
+灞 1209 x
+灞桥 3 ns
+灞桥区 3 ns
+灞河 7 ns
+灞陵 3 ns
+灟 2 zg
+灠 4 zg
+灥 3 zg
+灦 34 zg
+灨江 3 nz
+灪 6 zg
+火 8518 n
+火上加油 16 n
+火上弄冰 3 i
+火上浇油 47 n
+火上添油 2 i
+火中取栗 5 i
+火事 3 n
+火井 5 n
+火亮 15 a
+火伞 3 n
+火伞高张 3 l
+火伤 9 n
+火伴 4 n
+火候 408 n
+火候未到 3 nr
+火儿 21 n
+火光 1016 n
+火光冲天 3 z
+火光烛天 18 i
+火光熊熊 3 n
+火具 18 n
+火兼 3 d
+火冒三丈 58 i
+火冒三尺 3 i
+火凤凰 8 n
+火刑 13 n
+火剪 3 n
+火力 1199 n
+火力发电 58 n
+火力发电厂 25 n
+火力圈 21 n
+火力点 62 n
+火力线 3 n
+火力网 11 n
+火功 3 a
+火势 134 n
+火化 98 n
+火化场 2 n
+火化塞 3 n
+火卫一 5 n
+火印 2 n
+火口 31 n
+火器 555 n
+火圈 72 n
+火地岛 52 ns
+火场 54 n
+火坑 66 n
+火堆 291 n
+火塘 89 n
+火墙 22 n
+火大 3 a
+火夫 2 n
+火头 118 n
+火头上 5 l
+火头军 12 n
+火奴鲁鲁 20 ns
+火妻灰子 3 n
+火字旁 3 n
+火宅 3 n
+火尽灰冷 3 i
+火尽薪传 3 i
+火居 2 n
+火居道士 3 n
+火山 1753 n
+火山作用 3 n
+火山区 20 n
+火山口 202 n
+火山地震 22 n
+火山学 2 n
+火山岛 122 ns
+火山岩 136 n
+火山性 3 n
+火山汤海 3 ns
+火山湖 3 ns
+火山灰 79 n
+火山爆发 3 nz
+火山石 3 n
+火山砾 3 n
+火山锥 3 n
+火工 42 n
+火工品 22 n
+火工器材 3 n
+火巷 3 n
+火并 58 v
+火影 3 n
+火影忍者 3 n
+火急 63 a
+火急火燎 7 i
+火性 36 n
+火情 7 n
+火成岩 101 n
+火把 836 n
+火把节 25 n
+火拼 10 v
+火捻 3 n
+火控 378 j
+火控系统 12 n
+火攻 127 v
+火旋风 3 n
+火旺 3 a
+火星 497 n
+火星人 6 n
+火星儿 3 n
+火星塞 3 n
+火星子 8 n
+火星时代 3 n
+火星车 2 n
+火暴 55 n
+火曜日 3 nr
+火机 4 n
+火枪 230 n
+火枪手 3 n
+火柱 56 n
+火柴 332 n
+火柴厂 19 n
+火柴杆 3 n
+火柴盒 13 n
+火树 6 n
+火树琪花 3 n
+火树金花 3 n
+火树银花 18 n
+火树银花不夜天 5 i
+火棉胶 3 n
+火棍 2 n
+火棒 10 n
+火毒 21 n
+火气 183 n
+火油 3 n
+火油炉 3 n
+火法 24 n
+火洲 4 ns
+火流星 3 n
+火浣布 3 n
+火海 109 ns
+火海刀山 3 ns
+火海战术 3 n
+火温 2 n
+火源 33 n
+火漆 37 n
+火灭烟消 3 l
+火灾 526 n
+火灾事故 3 n
+火灾保险 3 n
+火灾分类 3 n
+火灾杯 3 n
+火灾死 3 l
+火灾现场 3 n
+火灾险 3 n
+火炉 136 n
+火炉子 3 n
+火炎 2 n
+火炎山 3 n
+火炕 42 n
+火炬 606 n
+火炬手 4 n
+火炬松 2 nz
+火炬计划 1030 nz
+火炭 47 n
+火炭母 3 n
+火炮 1635 n
+火点 8 n
+火炼 3 v
+火炽 21 a
+火烈 3 a
+火烈鸟 8 i
+火烛 28 n
+火烛小心 3 i
+火烛银花 3 i
+火烟 3 n
+火烤 3 v
+火烧 944 n
+火烧云 9 n
+火烧山 12 n
+火烧岛 3 n
+火烧店 41 n
+火烧沟 3 n
+火烧火燎 23 i
+火烧眉毛 26 i
+火烫 34 z
+火热 376 n
+火热水深 3 n
+火热热 3 z
+火焊 3 n
+火焚 3 v
+火焰 926 n
+火焰刀 33 n
+火焰喷射器 22 n
+火焰山 68 n
+火焰杯 3 n
+火然泉达 3 n
+火煤 3 n
+火爆 369 a
+火爆场面 3 n
+火爆爆 6 nz
+火版 3 n
+火牛 3 n
+火牛阵 3 n
+火物 5 n
+火犁 3 ns
+火狐 9 n
+火狐狸 3 n
+火狼 3 n
+火猴 3 n
+火王 3 n
+火球 137 n
+火电 44 n
+火电厂 83 n
+火电站 288 n
+火盆 114 n
+火眼 25 n
+火眼金睛 54 n
+火石 108 n
+火石岗村 2 n
+火石玻璃 3 n
+火砖 2 n
+火硝 5 n
+火硝纸 3 n
+火碱 3 n
+火神 66 n
+火神决 3 i
+火神庙 4 n
+火祭 3 n
+火禁 3 d
+火种 148 n
+火窑 3 n
+火窟 3 n
+火童 3 n
+火符 3 n
+火笼 3 n
+火筷子 4 n
+火管 3 n
+火箭 1876 n
+火箭专家 3 l
+火箭发动 3 n
+火箭学 3 n
+火箭干部 3 n
+火箭式 3 n
+火箭弹 270 n
+火箭炮 284 n
+火箭筒 99 n
+火箭队 81 n
+火箱 3 n
+火粒 3 n
+火系 3 n
+火红 111 z
+火红色 10 n
+火纸 23 n
+火纸媒儿 3 n
+火线 139 n
+火绒 3 n
+火绳 27 n
+火绳杆 3 n
+火绵 3 z
+火罐 28 n
+火网 22 n
+火耕水种 3 n
+火耕流种 3 n
+火耗 16 n
+火耨刀耕 3 v
+火腿 152 n
+火腿三明 3 n
+火腿汉堡 3 nz
+火腿肉 8 n
+火腿肠 328 n
+火腿蛋 3 n
+火膛 2 n
+火舌 46 n
+火色 12 n
+火花 312 n
+火花塞 6 n
+火花室 3 n
+火花放电 3 n
+火花机 3 n
+火苗 118 n
+火苗儿 6 n
+火药 781 n
+火药厂 3 n
+火药味 68 n
+火药库 18 n
+火药枪 2 n
+火药桶 16 n
+火葬 108 n
+火葬区 3 n
+火葬场 32 n
+火葬炉 3 n
+火警 33 n
+火车 1471 n
+火车头 102 n
+火车撞 3 i
+火车时刻 3 n
+火车热轴 3 n
+火车皮 3 n
+火车票 85 n
+火车站 1117 n
+火车车厢 3 n
+火轮 36 n
+火轮船 10 n
+火辣 12 z
+火辣辣 122 z
+火速 325 n
+火酒 3 n
+火里 3 n
+火钳 15 n
+火铳 96 n
+火锅 459 n
+火锅城 3 n
+火锅子 3 n
+火锅店 15 n
+火镜 4 n
+火镰 18 n
+火险 8 n
+火青 2 n
+火魔 4 n
+火鸟 3 n
+火鸡 74 n
+火鸡肉 3 n
+火鹤 3 n
+火麒麟 3 nr
+火麻仁 2 n
+火龙 246 n
+火龙果 4 n
+火龙王 3 n
+灭 3504 v
+灭亡 1156 v
+灭口 98 v
+灭国 3 v
+灭失 15 v
+灭寂 3 v
+灭尸 3 v
+灭尽 3 v
+灭弧 5 n
+灭掉 3 v
+灭族 43 n
+灭景追风 3 i
+灭杀 3 v
+灭此朝食 2 i
+灭火 215 v
+灭火剂 15 n
+灭火器 24 n
+灭火弹 3 i
+灭火机 4 i
+灭火枪 3 i
+灭火栓 3 n
+灭火队 4 i
+灭灯 3 v
+灭灾 3 v
+灭熄 3 v
+灭种 9 v
+灭绝 782 v
+灭绝人性 14 i
+灭绝师太 3 n
+灭绝性 2 i
+灭绝种族 3 i
+灭茬 10 v
+灭菌 189 v
+灭菌器 6 n
+灭菌奶 9 n
+灭虢取虞 3 ns
+灭虫 12 n
+灭虫剂 3 n
+灭蚊 7 n
+灭蚊器 3 n
+灭蚊灯 3 n
+灭蝇 3 n
+灭蝗 6 v
+灭蟑螂 3 n
+灭资兴无 3 n
+灭迹 33 v
+灭锈 3 v
+灭门 32 v
+灭门之祸 15 i
+灭门案 3 n
+灭门绝户 3 i
+灭门血案 3 n
+灭音 3 v
+灭音器 3 n
+灭顶 14 v
+灭顶之灾 54 i
+灭鼠 19 n
+灭鼠药 4 i
+灮 8 zg
+灯 3427 n
+灯不亮 3 n
+灯丝 15 n
+灯亮了 3 i
+灯会 63 n
+灯伞 3 n
+灯儿 4 n
+灯光 1315 n
+灯光如昼 3 n
+灯光师 8 n
+灯光效果 3 n
+灯光渡桥 3 n
+灯光灿烂 3 i
+灯光装置 4 n
+灯光设备 3 n
+灯光设计 3 i
+灯光音响 3 n
+灯具 74 n
+灯具厂 3 n
+灯具城 3 n
+灯台 35 n
+灯台叶 3 n
+灯台细辛 3 ns
+灯号 3 n
+灯塔 179 n
+灯塔县 3 ns
+灯塔市 3 ns
+灯壳 3 n
+灯壶 3 n
+灯头 16 n
+灯尽油干 3 i
+灯展 12 n
+灯市 43 n
+灯市口 147 n
+灯座 3 n
+灯彩 14 n
+灯影 89 n
+灯影峡 4 n
+灯影摇曳 3 i
+灯心 3 n
+灯心绒 3 n
+灯心草 15 n
+灯捻 3 n
+灯捻儿 3 n
+灯期 3 n
+灯枯油尽 3 i
+灯架 6 n
+灯柱 34 n
+灯标 9 n
+灯桩 3 n
+灯油 54 n
+灯泡 117 n
+灯泡儿 3 n
+灯泡厂 2 n
+灯火 572 n
+灯火万家 3 i
+灯火管制 3 n
+灯火辉煌 38 i
+灯火通明 3 n
+灯火阑珊 3 i
+灯灭了 3 i
+灯烛 3 n
+灯烛辉煌 3 i
+灯焰 3 n
+灯用煤油 3 n
+灯盏 88 n
+灯穗 3 n
+灯笼 881 n
+灯笼椒 7 n
+灯笼花 3 n
+灯笼裤 4 n
+灯管 14 n
+灯箱 14 n
+灯红酒绿 37 n
+灯绳 5 n
+灯罩 27 n
+灯节 52 n
+灯芯 35 n
+灯芯绒 18 n
+灯花 18 n
+灯苗 3 n
+灯草 24 n
+灯蕊 3 n
+灯虎 3 n
+灯蛾 3 n
+灯蛾扑火 3 i
+灯语 3 n
+灯谜 39 n
+灯饰 23 n
+灯饰厂 3 n
+灯黑 3 n
+灰 2873 n
+灰不及及 3 i
+灰不溜秋 2 z
+灰份 3 n
+灰冷 3 z
+灰分 49 n
+灰化 7 n
+灰化土 17 n
+灰原哀 3 v
+灰发 3 n
+灰发飘飘 3 v
+灰口铁 3 n
+灰叶猴 4 n
+灰名 3 n
+灰喜鹊 15 n
+灰土 87 n
+灰土地面 3 n
+灰坑 13 n
+灰垢 3 n
+灰塌塌 3 z
+灰墙 3 n
+灰复 3 v
+灰头土脸 52 i
+灰头土面 3 i
+灰姑娘 25 n
+灰容土貌 3 i
+灰尘 443 n
+灰尘肺 3 i
+灰山鹑 2 n
+灰岩 138 n
+灰市 11 n
+灰布 35 n
+灰度 10 n
+灰度变换 3 i
+灰度级 3 n
+灰心 120 n
+灰心丧意 3 i
+灰心丧气 36 i
+灰心槁形 3 i
+灰心短气 3 i
+灰扑扑 26 z
+灰指甲 3 n
+灰暗 113 z
+灰朦朦 3 z
+灰沉沉 2 z
+灰沙 10 n
+灰泥 3 n
+灰浆 10 n
+灰浆桶 3 n
+灰渌渌 3 z
+灰渣 8 n
+灰溜溜 49 z
+灰漠土 3 n
+灰濛 3 z
+灰濛濛 3 z
+灰灭 3 v
+灰灰 3 n
+灰灰暗暗 3 i
+灰灰濛濛 3 nz
+灰炉头村 3 n
+灰烟瘴气 3 i
+灰烬 171 n
+灰熊队 3 n
+灰狐 3 nz
+灰狗 3 n
+灰狼 31 n
+灰玉 3 n
+灰瓦 9 n
+灰白 182 z
+灰白色 166 n
+灰白质 3 n
+灰石 3 n
+灰石粉 3 n
+灰砂石土 3 n
+灰砂砖 2 n
+灰碌碌 3 z
+灰糊糊 3 z
+灰绿 12 z
+灰绿色 41 n
+灰肥 3 n
+灰色 994 n
+灰色收入 3 n
+灰苍苍 2 z
+灰茫茫 3 z
+灰蒙蒙 58 z
+灰蓬蓬 2 z
+灰褐 46 n
+灰褐色 338 n
+灰质 45 n
+灰质炎 3 n
+灰身泯智 3 v
+灰身灭智 3 i
+灰身粉骨 3 i
+灰躯糜骨 3 z
+灰铁 3 n
+灰铸铁 4 n
+灰锰氧 2 n
+灰阶 3 n
+灰陶 259 n
+灰雀 2 n
+灰雾 6 n
+灰霉 2 n
+灰霉病 3 n
+灰霉素 3 n
+灰顶 3 n
+灰领 37 n
+灰飞烟灭 58 i
+灰鲸 7 n
+灰鸭 3 n
+灰鸽 3 n
+灰鸽子 3 nz
+灰鹅 3 n
+灰鹤 14 n
+灰黄 18 z
+灰黄色 18 n
+灰黄霉素 6 n
+灰黑 33 z
+灰黑色 69 n
+灰鼠 80 n
+灰鼠皮 23 n
+灵 3339 nr
+灵丘 17 ns
+灵丘县 6 ns
+灵丹 34 ns
+灵丹圣药 5 nr
+灵丹妙药 89 i
+灵伍 2 n
+灵位 107 n
+灵便 120 a
+灵光 86 nr
+灵兽 7 n
+灵冰雨 3 nr
+灵前 3 nr
+灵力 3 n
+灵动 185 a
+灵县 3 ns
+灵台 122 n
+灵台县 2 ns
+灵器 27 n
+灵囿 3 n
+灵圣 3 ns
+灵均 3 a
+灵坛 3 n
+灵堂 194 nr
+灵塔 27 nr
+灵境 10 n
+灵墟 3 n
+灵壁 3 n
+灵壁县 3 ns
+灵壁石 3 nr
+灵太后 11 nr
+灵妙 3 a
+灵媒 3 n
+灵子 3 n
+灵学 3 n
+灵官 10 n
+灵官庙 2 nr
+灵官殿 8 nr
+灵宝 97 nr
+灵宝县 6 nr
+灵宝市 5 ns
+灵寝 3 n
+灵寿 33 nr
+灵寿县 10 nr
+灵山 121 ns
+灵山县 3 ns
+灵山寺 3 nr
+灵山岛 2 ns
+灵岩寺 11 nr
+灵岩山 3 nr
+灵岩涧 2 nr
+灵川 5 ns
+灵川县 5 ns
+灵州 32 ns
+灵巧 181 a
+灵巧型 2 nr
+灵巧性 3 nr
+灵幡 3 n
+灵幻 3 n
+灵床 21 n
+灵应 3 n
+灵府 3 n
+灵座 3 n
+灵异 29 a
+灵异传奇 3 nr
+灵心慧性 3 nr
+灵心慧齿 3 nr
+灵性 144 n
+灵怪 8 a
+灵感 316 a
+灵感一来 3 i
+灵效 9 a
+灵敏 330 nr
+灵敏度 198 n
+灵敏性 9 nr
+灵旛 3 vn
+灵智上人 3 nr
+灵机 9 n
+灵机一动 227 i
+灵杰 3 nr
+灵枢 3 n
+灵枢经 3 n
+灵柩 504 n
+灵格风 3 nr
+灵棚 18 n
+灵榇 3 nr
+灵歌 5 n
+灵武 59 nr
+灵武县 19 ns
+灵武市 3 ns
+灵气 193 n
+灵气儿 3 nr
+灵江 2 ns
+灵活 1444 a
+灵活化 3 n
+灵活处理 3 n
+灵活多样 5 i
+灵活应变 3 i
+灵活性 305 n
+灵活机动 3 n
+灵活经营 3 n
+灵活运用 3 n
+灵渠 46 nr
+灵牌 47 n
+灵牙利齿 3 i
+灵犀 30 nr
+灵狮 2 ns
+灵猫 105 n
+灵猫科 3 nr
+灵王 5 nrt
+灵璧 14 ns
+灵璧县 3 ns
+灵界 3 n
+灵石 11 nr
+灵石县 6 ns
+灵禽 2 n
+灵童 9 n
+灵符 3 nr
+灵精 3 n
+灵肉 3 n
+灵芝 132 nrt
+灵芝茶 3 n
+灵芝草 12 n
+灵药 110 n
+灵菌毒素 3 n
+灵菌红素 3 n
+灵葯 3 vn
+灵虚 22 a
+灵蛇 36 n
+灵蛇之珠 3 i
+灵谷 8 n
+灵谷洞 3 nr
+灵车 21 n
+灵透 3 a
+灵通 102 a
+灵通人士 3 n
+灵通卡 3 nr
+灵通网 3 n
+灵道 3 n
+灵醒 6 a
+灵长 3 n
+灵长目 41 n
+灵长类 77 n
+灵隐寺 81 nr
+灵风 3 n
+灵验 112 n
+灵魂 2420 n
+灵魂深处 3 i
+灵魂火符 3 n
+灶 953 n
+灶具 19 n
+灶匠 3 n
+灶口 7 n
+灶台 296 n
+灶君 23 n
+灶坑 3 n
+灶头 20 n
+灶底 3 n
+灶房 32 n
+灶火 3 n
+灶王爷 28 n
+灶神 38 n
+灶膛 20 n
+灶门 3 n
+灶间 45 n
+灶马 3 n
+灶鸡 3 n
+灸 431 g
+灸师 3 n
+灸术 3 n
+灸法 3 n
+灸艾分痛 3 v
+灼 477 vg
+灼伤 58 v
+灼圃 3 n
+灼圃乡 3 n
+灼灼 84 z
+灼烂 3 z
+灼烧 42 v
+灼烫 3 z
+灼热 143 z
+灼热感 7 n
+灼焦 3 v
+灼熟 3 z
+灼痛 31 n
+灼背烧顶 3 n
+灼艾分痛 3 v
+灼见 16 v
+灼见真知 3 n
+灼趟 3 v
+灾 1043 n
+灾区 694 n
+灾厄 9 n
+灾变 48 n
+灾变论 3 n
+灾害 817 n
+灾害性 41 n
+灾害救济 3 n
+灾害源 3 n
+灾年 15 n
+灾异 3 n
+灾患 2 n
+灾情 142 n
+灾情惨重 3 z
+灾星 13 n
+灾梨祸枣 3 n
+灾殃 7 n
+灾民 331 n
+灾祸 176 n
+灾胞 3 n
+灾荒 171 n
+灾难 1027 n
+灾难性 95 n
+灾难深重 31 l
+灾难片 3 n
+灿 164 a
+灿坤 124 nz
+灿烂 948 a
+灿烂夺目 7 i
+灿烂微笑 3 i
+灿烂辉煌 16 i
+灿然 40 a
+灿然一新 3 l
+灿若云霞 2 i
+灿若明霞 3 i
+灿若星河 4 i
+灿若繁星 3 i
+灿若群星 3 i
+炀 35 nrt
+炀帝 111 nrt
+炁 2 zg
+炅 25 g
+炆 165 zg
+炈 4 zg
+炉 1583 zg
+炉丝 3 n
+炉体 11 n
+炉具 2 n
+炉前 9 s
+炉前工 3 n
+炉台 7 n
+炉坑 3 n
+炉壁 3 n
+炉头 72 n
+炉子 424 n
+炉床 3 nz
+炉排 12 n
+炉料 15 n
+炉条 3 n
+炉架 3 n
+炉渣 27 n
+炉渣砖 3 n
+炉温 13 n
+炉火 334 n
+炉火纯青 189 i
+炉灰 16 n
+炉灶 48 n
+炉炭 3 n
+炉瓦 3 nz
+炉甘石 3 nz
+炉盘 3 n
+炉窑 3 nz
+炉箅子 3 nz
+炉管 3 n
+炉腔 3 n
+炉膛 37 n
+炉衬 6 nz
+炉边 25 s
+炉门 28 n
+炉霍 3 ns
+炉霍县 3 ns
+炉顶 15 n
+炊 198 n
+炊事 44 n
+炊事兵 4 n
+炊事员 96 n
+炊事班 31 n
+炊事班长 7 n
+炊具 47 n
+炊妇 3 n
+炊帚 3 n
+炊沙作糜 3 n
+炊沙作饭 3 n
+炊沙成饭 3 n
+炊沙镂冰 3 z
+炊火 3 n
+炊烟 112 n
+炊烟袅袅 12 l
+炊琼爇桂 3 n
+炊砂作饭 3 n
+炊粱跨卫 3 vn
+炊臼之戚 3 n
+炊臼之痛 3 n
+炊金馔玉 3 nz
+炊饭 3 n
+炊鲜漉清 3 z
+炎 738 n
+炎凉 7 a
+炎凉世态 2 n
+炎加炎 3 n
+炎土 3 n
+炎夏 21 n
+炎天 3 n
+炎帝 609 nrt
+炎帝陵 11 ns
+炎日 5 nrt
+炎日当空 3 nz
+炎日高照 3 n
+炎暑 11 n
+炎海 3 ns
+炎炎 71 n
+炎炎夏日 3 n
+炎炽 3 a
+炎热 498 a
+炎热夏日 3 nrt
+炎熇 3 z
+炎琥宁 3 v
+炎症 493 n
+炎症性 3 nz
+炎酷 3 a
+炎阳 2 nrt
+炎陵 2 nrt
+炎陵县 7 ns
+炎风 3 n
+炎黄 41 z
+炎黄子孙 38 n
+炎黄艺术馆 3 n
+炎黄魂 3 n
+炎龙 3 nrt
+炒 4473 v
+炒上 3 v
+炒上去 3 v
+炒上来 3 v
+炒下 3 v
+炒下去 3 v
+炒下来 3 v
+炒买 3 v
+炒买炒卖 3 n
+炒作 430 v
+炒作者 5 n
+炒作股票 3 n
+炒冰机 3 n
+炒冷饭 2 v
+炒制 265 v
+炒勺 5 n
+炒卖 19 v
+炒地皮 3 n
+炒家 20 n
+炒年糕 3 n
+炒房团 3 n
+炒房客 3 n
+炒房者 3 n
+炒来炒去 3 n
+炒栗子 3 n
+炒楼 3 v
+炒汇 7 v
+炒炒 3 v
+炒热 3 v
+炒熟 3 v
+炒米 530 n
+炒粉 3 n
+炒肝 4 n
+炒股 65 v
+炒股法 3 n
+炒股票 3 n
+炒腰花 3 n
+炒花生 3 n
+炒花饭 3 n
+炒菜 613 n
+炒菜锅 3 n
+炒蛋 3 v
+炒豆子 2 n
+炒货 5 v
+炒起 3 v
+炒起来 3 v
+炒过 3 v
+炒过去 3 v
+炒过来 3 v
+炒金 3 n
+炒钢 12 n
+炒锅 269 v
+炒青 3 v
+炒青菜 3 n
+炒面 300 n
+炒饭 8 v
+炒鱿鱼 29 v
+炒鸡蛋 46 n
+炒黄豆 5 n
+炔 84 n
+炔化物 3 n
+炔诺酮 8 n
+炔雌醇 6 n
+炔雌醚 2 n
+炕 1327 n
+炕上 3 s
+炕下 3 s
+炕几 3 n
+炕单 3 n
+炕去 3 n
+炕头 108 n
+炕头儿 3 n
+炕席 32 n
+炕床 21 n
+炕柜 3 n
+炕桌 65 n
+炕桌儿 3 n
+炕梢 3 n
+炕毡 3 n
+炕沿 80 s
+炕洞 15 n
+炖 262 v
+炖上 3 n
+炖品 4 n
+炖排骨 3 n
+炖汤 3 nz
+炖炖 3 v
+炖烂 3 n
+炖煮 5 v
+炖牛肉 6 n
+炖着 3 v
+炖肉 9 n
+炖药 3 n
+炖菜 6 n
+炖锅 2 n
+炖鱼 3 n
+炖鸡 3 n
+炖鸡汤 3 nz
+炙 252 zg
+炙冰使燥 3 i
+炙手可得 3 i
+炙手可热 77 i
+炙烤 13 v
+炙热 42 a
+炙肤皲足 3 z
+炙鸡渍酒 3 v
+炜 43 nr
+炝 87 v
+炟 15 zg
+炢 5 zg
+炤 41 zg
+炩 7 zg
+炪 49 zg
+炫 166 v
+炫乱 3 a
+炫奇争胜 3 n
+炫奇无巧 3 n
+炫异争奇 3 n
+炫弄 3 v
+炫惑 3 v
+炫技 9 nz
+炫昼缟夜 3 v
+炫材扬己 3 n
+炫燿 3 v
+炫玉贾石 3 vn
+炫目 29 v
+炫石为玉 3 n
+炫示 12 v
+炫耀 340 v
+炫耀性 3 n
+炫耀着 3 n
+炬 274 g
+炬火 3 nz
+炭 374 n
+炭刷 3 n
+炭化 19 n
+炭化作用 3 n
+炭化物 3 n
+炭坑 3 n
+炭块 7 n
+炭子冲 2 n
+炭棒 4 n
+炭气 3 n
+炭油 3 n
+炭渣 3 n
+炭火 366 n
+炭灰 10 n
+炭灰色 3 n
+炭炉 14 n
+炭烧 3 n
+炭画 3 n
+炭疽 71 n
+炭疽热 3 z
+炭疽病 3 vn
+炭疽菌 3 v
+炭盆 9 n
+炭窑 2 n
+炭笔 6 n
+炭粉 3 n
+炭精 3 n
+炭精棒 3 n
+炭素 27 n
+炭纤维 3 n
+炭菌热 3 n
+炭质 3 n
+炭酐 3 nz
+炭酸 3 n
+炭酸盐 3 nz
+炭黑 21 ns
+炮 3599 n
+炮井 3 n
+炮仗 72 n
+炮位 53 n
+炮兵 798 n
+炮兵团 83 n
+炮兵师 37 n
+炮兵群 12 n
+炮兵营 54 n
+炮兵连 30 n
+炮兵部队 3 n
+炮兵阵地 3 n
+炮凤烹龙 3 i
+炮击 362 v
+炮制 126 n
+炮口 108 n
+炮台 330 n
+炮台镇 20 ns
+炮响 157 n
+炮团 10 n
+炮塔 738 n
+炮声 794 n
+炮声隆隆 3 ns
+炮子儿 3 n
+炮座 9 n
+炮弹 1909 n
+炮弹箱 18 n
+炮战 3 n
+炮手 116 n
+炮楼 79 n
+炮火 464 n
+炮火连天 19 i
+炮灰 17 n
+炮烙 12 n
+炮烙之刑 3 n
+炮眼 14 n
+炮眼充填 3 i
+炮竹 4 n
+炮筒 30 n
+炮筒子 9 n
+炮管 3 n
+炮群 4 n
+炮膛 3 n
+炮舰 64 n
+炮舰外交 3 v
+炮舰政策 3 v
+炮艇 26 n
+炮衣 5 n
+炮身 3 n
+炮车 36 n
+炮轰 305 v
+炮门 3 n
+炮队 3 n
+炮队镜 8 n
+炮食 3 n
+炮龙烹凤 3 i
+炯 594 z
+炯介 3 i
+炯炯 94 z
+炯炯有神 76 i
+炯然 3 z
+炰 206 zg
+炰鳖脍鲤 3 nr
+炱 37 g
+炲 385 zg
+炳 216 ns
+炳发 20 ns
+炳如日星 3 v
+炳如观火 3 nz
+炳灵 18 ns
+炳炳烺烺 3 z
+炳烛夜游 3 nr
+炳燿 3 ns
+炳若日星 3 ns
+炳若观火 3 ns
+炴 247 zg
+炵 221 zg
+炶 141 zg
+炷 158 q
+炷头香 3 z
+炸 2119 n
+炸丸子 3 n
+炸伤 30 n
+炸出 3 v
+炸到 3 v
+炸土豆片 3 n
+炸坏 3 v
+炸子鸡 4 n
+炸市 3 n
+炸平 3 n
+炸开 3 v
+炸弹 1240 n
+炸弹开花 3 n
+炸成 3 v
+炸掉 75 v
+炸断 3 v
+炸死 88 v
+炸毁 295 v
+炸油条 3 n
+炸油饼 3 n
+炸炸 3 v
+炸烂 3 n
+炸熟 3 n
+炸破 3 v
+炸碎 3 v
+炸礁 4 n
+炸窝 3 n
+炸糕 14 n
+炸肉 3 n
+炸肉丸 3 n
+炸肉块 3 n
+炸药 634 n
+炸药包 63 n
+炸药箱 3 n
+炸葯 3 v
+炸薯条 14 n
+炸虾球 3 n
+炸裂 44 v
+炸豆腐 3 n
+炸起 3 v
+炸起来 3 v
+炸酱 3 n
+炸酱面 17 n
+炸锅 4 n
+炸雷 66 n
+炸飞 3 v
+炸鱼 11 n
+炸鱼排 3 n
+炸鸡 14 n
+炸鸡块 3 n
+炸鸡翅 3 n
+炸鸡肉 3 n
+炸鸡腿 3 n
+炸麻花 3 n
+点 24685 m
+点不着 3 v
+点中 241 v
+点交 3 v
+点亮 3266 v
+点估计 3 l
+点位 63 n
+点值图 3 n
+点儿 745 n
+点光源 10 n
+点军区 256 n
+点出 3 v
+点击 382 v
+点击数 2 n
+点击率 42 n
+点击设备 3 n
+点函数 3 n
+点分散 2 l
+点到为止 17 l
+点到点 11 l
+点到面 3 l
+点券 3 n
+点刹 2 n
+点勘 3 v
+点化 45 v
+点卡 3 n
+点卯 157 v
+点召 3 v
+点名 162 v
+点名册 3 n
+点名单 3 n
+点名簿 3 n
+点唱 3 v
+点唱机 3 n
+点回去 3 l
+点多面广 2 nz
+点头 3864 v
+点头之交 5 i
+点头会意 3 l
+点头咂嘴 3 n
+点头哈腰 41 l
+点头应允 3 l
+点头称是 3 l
+点妆 3 v
+点子 364 n
+点定 3 v
+点对点 3 n
+点射 38 v
+点将 66 n
+点将台 9 n
+点式 9 n
+点式住宅 3 n
+点得 3 v
+点心 339 v
+点心吃 3 l
+点心店 4 n
+点心虚 3 i
+点心费 3 n
+点戏 3 v
+点手划脚 3 l
+点手莋脚 3 v
+点拨 114 v
+点指划脚 3 l
+点指画字 3 n
+点指莋脚 3 v
+点捺 3 v
+点接触 9 l
+点播 61 v
+点播器 3 n
+点播曲 3 n
+点播机 3 n
+点播歌 3 n
+点收 8 v
+点数 52 n
+点数卡 3 n
+点整 3 v
+点明 56 v
+点来点去 3 v
+点染 38 v
+点校 9 n
+点样 3 n
+点检 3 v
+点歌 5 n
+点歌单 3 n
+点歌台 3 l
+点歌机 3 l
+点歌给 3 i
+点水不漏 3 i
+点汤 3 n
+点源 7 n
+点滴 1171 n
+点滴器 3 n
+点滴归公 3 n
+点滴法 3 n
+点火 285 v
+点火台 2 n
+点火器 260 n
+点火装置 3 n
+点灯 92 n
+点点 316 n
+点点头 1807 v
+点点滴滴 52 m
+点点通 3 v
+点烟 25 v
+点烟器 3 n
+点焊 5 n
+点焊机 3 n
+点燃 868 v
+点状 28 n
+点状绿地 3 n
+点玩 3 v
+点球 160 n
+点电荷 29 n
+点画 11 n
+点的拉开 3 l
+点眼药 3 n
+点着 578 v
+点着头 3 v
+点睛 28 n
+点睛之笔 3 l
+点石为金 3 n
+点石成金 21 n
+点破 72 v
+点秋香 3 v
+点种 10 n
+点秒 3 q
+点穴 256 n
+点窜 3 v
+点算 6 v
+点纸画字 3 n
+点线 3 n
+点线面 3 n
+点缀 517 v
+点缀着 3 y
+点缺陷 3 n
+点胶机 3 n
+点胸洗眼 3 n
+点脚 3 v
+点脚尖儿 3 n
+点苍渔隐 3 i
+点菜 40 n
+点角 3 n
+点解 3 v
+点评 614 v
+点读机 3 n
+点货 3 n
+点过 3 v
+点选 3 v
+点醒 3 v
+点金 22 n
+点金乏术 3 n
+点金作铁 3 n
+点金成铁 3 n
+点金无术 3 l
+点金术 4 n
+点钞 3 n
+点钞机 3 n
+点钟 9 q
+点铁成金 8 nz
+点错 3 v
+点阅 3 v
+点阅召集 3 n
+点阵 101 v
+点阵图 3 l
+点阵字库 3 l
+点隙 3 n
+点面结合 23 i
+点题 16 n
+点验 4 v
+点高潮 3 n
+点鬼火 3 i
+為 105 zg
+炻 18 x
+炻器 3 n
+炼 1100 v
+炼丹 327 n
+炼丹房 3 n
+炼丹术 36 n
+炼乳 13 nz
+炼制 349 v
+炼制厂 3 n
+炼化 40 vn
+炼厂 24 n
+炼句 3 n
+炼字 3 n
+炼就 13 v
+炼成 3 v
+炼拳 3 n
+炼气 3 n
+炼油 338 n
+炼油厂 165 n
+炼焦 88 vn
+炼焦厂 3 n
+炼焦炉 4 n
+炼焦煤 3 n
+炼狱 41 v
+炼石补天 4 i
+炼矿 3 n
+炼糖 3 n
+炼糖厂 3 n
+炼胶机 6 n
+炼药 3 n
+炼金 3 n
+炼金术 16 n
+炼金术士 7 n
+炼金术师 3 n
+炼钢 185 n
+炼钢业 3 n
+炼钢厂 16 n
+炼钢炉 16 nz
+炼铁 151 n
+炼铁厂 12 n
+炼铁炉 15 nz
+炼铜 3 n
+炼铜厂 3 n
+炼铝 3 n
+炼锌厂 2 n
+炽 191 ag
+炽天使 3 v
+炽灼 3 a
+炽烈 85 a
+炽热 142 a
+炽热体 3 vn
+炽燃 3 a
+炽燥 3 a
+炽盛 15 a
+烀 12 v
+烁 102 zg
+烁烁 3 z
+烁玉流金 3 nr
+烁石流金 3 nr
+烂 1495 v
+烂乎乎 3 z
+烂仔 7 n
+烂好人 3 n
+烂如指掌 3 i
+烂尾 3 n
+烂尾楼 13 n
+烂尾词 3 n
+烂帐 3 n
+烂成 3 v
+烂掉 34 v
+烂摊子 69 n
+烂料 3 n
+烂柯山 4 nz
+烂死 3 v
+烂污 8 v
+烂污货 3 n
+烂泥 105 n
+烂泥塘 14 n
+烂泥巴 3 n
+烂漫 49 z
+烂漫天真 3 nz
+烂烂 3 z
+烂熟 83 z
+烂熳 4 a
+烂熳天真 3 v
+烂片 3 n
+烂秧 2 n
+烂糊 4 z
+烂纸 3 n
+烂肠瘟 3 n
+烂舌头 4 n
+烂若披掌 3 i
+烂若披锦 3 i
+烂若舒锦 3 v
+烂词 3 n
+烂账 7 n
+烂货 3 n
+烂透 3 nz
+烂醉 18 v
+烂醉如泥 20 i
+烂额焦头 3 n
+烂鬼 3 n
+烃 228 n
+烃相 3 n
+烃类 56 n
+烇 100 zg
+烈 2019 a
+烈军属 6 n
+烈士 563 n
+烈士墓 39 n
+烈士徇名 3 i
+烈士旅 3 n
+烈士暮年 3 n
+烈士碑 3 n
+烈士陵园 97 n
+烈女 37 n
+烈女传 3 n
+烈妇 3 n
+烈属 32 n
+烈山区 3 n
+烈度 41 n
+烈性 79 n
+烈性酒 25 n
+烈日 118 n
+烈日当空 10 nz
+烈日炎炎 3 n
+烈暑 3 n
+烈火 405 n
+烈火剑法 3 i
+烈火干柴 3 n
+烈火烹油 3 l
+烈火版 3 n
+烈火真金 3 n
+烈火轰雷 3 i
+烈火辨日 3 n
+烈火金钢 6 n
+烈烈 26 n
+烈烈轰轰 3 i
+烈焰 131 n
+烈焰红唇 3 n
+烈焰腾空 3 i
+烈节 3 n
+烈酒 64 n
+烈阳 3 n
+烈风 25 n
+烈马 26 n
+烊 78 x
+烏 2 zg
+烖 3 zg
+烗 3 zg
+烘 843 zg
+烘丝机 3 n
+烘乾 3 i
+烘乾机 3 i
+烘云托月 6 i
+烘云讬月 3 n
+烘到 3 v
+烘制 4 v
+烘培 3 vn
+烘干 92 v
+烘干器 3 n
+烘干机 2 n
+烘干炉 3 n
+烘得 3 v
+烘成 3 v
+烘手 3 v
+烘托 109 v
+烘托出 3 v
+烘托渲染 3 vn
+烘来烘去 3 z
+烘板 3 n
+烘染 3 v
+烘漆 3 n
+烘炉 5 v
+烘烘手 3 vn
+烘烤 314 v
+烘焙 26 v
+烘焦 3 v
+烘熏 3 v
+烘笼 3 v
+烘箱 3 n
+烘篮 3 v
+烘缸 3 n
+烘衬 3 v
+烘起来 3 v
+烘过 3 v
+烘过去 3 v
+烘过来 3 v
+烘青 3 v
+烙 322 n
+烙制 3 n
+烙印 157 n
+烙成 3 n
+烙画 10 n
+烙痕 2 n
+烙花 5 n
+烙铁 25 n
+烙铁头 3 n
+烙饼 74 n
+烛 524 n
+烛光 363 n
+烛光晚会 3 n
+烛光舞会 3 n
+烛剪 3 n
+烛台 196 n
+烛夜 3 n
+烛影 26 n
+烛影摇红 3 v
+烛心 3 n
+烛泪 13 n
+烛火 187 n
+烛照 35 n
+烛照数计 3 n
+烛笼 3 n
+烛罐 3 n
+烛芯 3 n
+烛花 9 n
+烛蕊 3 n
+烛龙 3 n
+烜 24 zg
+烜赫一时 3 ns
+烝 8 zg
+烟 3894 n
+烟丝 65 n
+烟云 68 n
+烟云缭绕 3 i
+烟云过眼 3 i
+烟价 3 n
+烟具 16 n
+烟农 14 nz
+烟卷 25 n
+烟卷儿 3 n
+烟厂 18 n
+烟台 479 n
+烟台万华 14 nz
+烟台山 3 ns
+烟台市 45 ns
+烟台港 2 ns
+烟台网 3 nz
+烟叶 242 n
+烟味 31 n
+烟味儿 3 n
+烟商 3 n
+烟嘴 15 ns
+烟嘴儿 3 n
+烟囱 201 n
+烟圈 17 n
+烟圈儿 3 n
+烟土 36 n
+烟场 3 n
+烟垢 3 n
+烟墩 7 n
+烟墩乡 3 n
+烟壶 31 n
+烟夜蛾 3 n
+烟大 4 ns
+烟头 107 n
+烟头烫 3 l
+烟子 4 n
+烟客 19 n
+烟尘 174 n
+烟屁股 6 n
+烟岚 2 ns
+烟岸 3 n
+烟幕 72 n
+烟幕弹 105 n
+烟感 3 n
+烟摊 3 n
+烟斑 3 n
+烟斗 117 n
+烟斗丝 3 n
+烟斗架 3 n
+烟断火绝 3 i
+烟机 5 n
+烟杆 3 n
+烟枪 33 n
+烟枪洞 3 n
+烟柱 28 n
+烟柳 8 n
+烟标 3 n
+烟树 3 n
+烟棍 3 n
+烟毒 3 n
+烟毒犯 3 n
+烟民 38 n
+烟气 78 n
+烟水 10 n
+烟油 3 n
+烟泡 3 n
+烟波 43 n
+烟波浩淼 8 i
+烟波浩渺 20 i
+烟波浩瀚 3 i
+烟波钓徒 3 i
+烟海 2 ns
+烟消云散 95 i
+烟消火灭 3 i
+烟消雾散 2 i
+烟火 299 n
+烟火剂 3 n
+烟火器材 3 n
+烟火食 3 n
+烟灰 75 n
+烟灰缸 31 n
+烟灰色 2 n
+烟点 8 n
+烟焰 13 n
+烟煤 43 n
+烟熅 3 z
+烟熏 44 nz
+烟熏保藏 3 l
+烟熏火燎 22 l
+烟瘴 5 n
+烟瘾 74 n
+烟癖 3 n
+烟盒 68 n
+烟硝 3 n
+烟碱 27 n
+烟税 3 n
+烟笼雾罩 3 n
+烟筒 40 n
+烟筒山 3 n
+烟管 66 n
+烟簑雨笠 3 n
+烟类 3 n
+烟粉 3 n
+烟缕 3 z
+烟缸 26 n
+烟聚波属 3 n
+烟腾腾 4 i
+烟膏 3 n
+烟臭 3 n
+烟臭味 3 i
+烟色 3 n
+烟花 121 n
+烟花巷 3 i
+烟花弹 3 n
+烟花爆竹 3 n
+烟花节 3 n
+烟花风月 3 i
+烟草 688 n
+烟草专卖 3 l
+烟草专卖局 3 nt
+烟草业 7 n
+烟草味 4 n
+烟草市场 3 n
+烟草行业 3 n
+烟蒂 36 n
+烟蒂成堆 3 ns
+烟蓑雨笠 3 i
+烟蚜 3 n
+烟袋 143 n
+烟袋嘴 3 n
+烟袋杆儿 2 n
+烟袋锅 21 n
+烟袋锅子 3 n
+烟视媚行 3 i
+烟贩 3 n
+烟退云敛 3 i
+烟道 123 n
+烟酒 83 n
+烟酒不沾 3 i
+烟酰胺 4 nz
+烟酸 33 n
+烟销灰灭 3 i
+烟锅 41 n
+烟雨 112 n
+烟雨任 3 n
+烟雨梦 3 i
+烟雨楼 3 n
+烟雨红尘 3 n
+烟雨遥 3 l
+烟雾 599 n
+烟雾弥漫 21 l
+烟雾弹 3 n
+烟雾迷漫 3 l
+烟霏 3 z
+烟霏雨散 3 nr
+烟霏雾集 3 nz
+烟霏露洁 3 v
+烟霞 56 n
+烟霞痼疾 3 z
+烟霭 4 n
+烟霾 3 n
+烟青 3 n
+烟青虫 3 n
+烟飞星散 3 i
+烟馆 8 n
+烟鬼 22 n
+烤 3606 v
+烤串 2 n
+烤乳猪 4 n
+烤全羊 3 n
+烤制 34 n
+烤化 2 n
+烤完 3 v
+烤干 3 n
+烤成 3 v
+烤晒 3 v
+烤朗 3 n
+烤来烤去 3 n
+烤杯机 3 n
+烤架 2 n
+烤漆房 3 n
+烤火 89 n
+烤炉 18 n
+烤炙 12 v
+烤烟 155 n
+烤烤 3 v
+烤烤肉 3 n
+烤焦 3 n
+烤熟 3 n
+烤牛肉 3 n
+烤瓷 3 n
+烤瓷牙 3 n
+烤电 3 n
+烤盘机 3 n
+烤箱 12 n
+烤红 3 n
+烤红薯 14 n
+烤羊 18 n
+烤羊肉 10 n
+烤羊肉串 7 n
+烤肉 85 n
+烤肉串 3 n
+烤肉店 3 n
+烤肉酱 3 n
+烤花瓶 3 n
+烤起来 3 v
+烤过去 3 v
+烤过来 3 v
+烤钵 3 n
+烤错 3 n
+烤面包 3 n
+烤面包机 3 n
+烤面包片 2 n
+烤饼 5 n
+烤鱼 273 n
+烤鳗鱼 3 v
+烤鸡 272 n
+烤鸡肉 3 n
+烤鸭 63 n
+烤鸭店 18 n
+烤鸭肉 3 n
+烤麸 3 n
+烤黑 3 v
+烦 1221 v
+烦乱 79 a
+烦事 3 a
+烦交 3 v
+烦人 48 a
+烦优 3 v
+烦冗 3 a
+烦劳 41 a
+烦厌 7 a
+烦噪 3 a
+烦嚣 4 a
+烦天恼地 3 z
+烦得 3 a
+烦心 55 a
+烦心事 31 n
+烦心倦目 3 vn
+烦忙 3 a
+烦忧 14 v
+烦恶 3 a
+烦恼 1026 a
+烦扰 54 v
+烦文 3 a
+烦文缛礼 3 vn
+烦杂 7 a
+烦死 3 a
+烦死人 3 n
+烦渎 3 v
+烦热 3 a
+烦燥 23 a
+烦琐 57 a
+烦琐哲学 3 nz
+烦碎 3 a
+烦神 3 a
+烦絮 3 n
+烦细 3 a
+烦腻 12 a
+烦言 3 n
+烦言碎语 3 n
+烦言碎辞 3 n
+烦请 18 v
+烦躁 418 a
+烦躁不安 3 z
+烦透了 3 n
+烦闷 116 a
+烦难 17 an
+烦音 3 n
+烧 4867 v
+烧上去 3 v
+烧上来 3 v
+烧不死 3 v
+烧伤 188 v
+烧伤科 3 n
+烧光 74 n
+烧出 3 v
+烧出去 3 v
+烧出来 3 v
+烧刀子 3 n
+烧制 375 v
+烧制车间 3 n
+烧包 10 n
+烧化 55 v
+烧卖 8 v
+烧卖店 3 n
+烧去 3 v
+烧友 3 n
+烧咖啡 3 nr
+烧坏 32 v
+烧埋 11 v
+烧塌 2 v
+烧夷弹 3 vn
+烧尽 3 v
+烧山火 3 n
+烧干 5 n
+烧开 38 v
+烧弃 3 v
+烧录 3 v
+烧录卡 3 n
+烧录器 3 n
+烧录机 3 n
+烧得 3 v
+烧心 16 v
+烧成 215 v
+烧成制品 3 l
+烧成灰 3 l
+烧损 3 v
+烧掉 139 v
+烧料 3 n
+烧昏 3 v
+烧杀 243 v
+烧杀抢掠 31 l
+烧来烧去 3 l
+烧杯 121 n
+烧杯架 3 n
+烧柴 21 n
+烧死 207 v
+烧毁 570 v
+烧毛 3 n
+烧水 80 n
+烧沸 3 v
+烧油 3 n
+烧火 171 v
+烧火棍 13 n
+烧灰 3 n
+烧灼 46 v
+烧灼感 27 n
+烧炭 64 n
+烧点 3 n
+烧炼 3 v
+烧烤 883 v
+烧烤店 3 n
+烧烤机 3 n
+烧烤炉 3 n
+烧烤网 3 n
+烧烧 3 v
+烧烧水 3 n
+烧烧看 3 l
+烧烫伤 3 vn
+烧热 3 v
+烧焊 3 n
+烧焦 78 v
+烧焦试验 3 n
+烧煤 3 n
+烧煮 3 v
+烧熔 3 v
+烧熟 3 v
+烧犀观火 3 n
+烧猪 3 n
+烧琴煮鹤 3 nz
+烧瓦 3 n
+烧瓶 112 n
+烧瓶架 3 n
+烧用 3 v
+烧眉之急 3 l
+烧着 135 v
+烧石膏 3 n
+烧砖 23 n
+烧碱 54 n
+烧磁 3 n
+烧窑 42 n
+烧纸 67 n
+烧结 67 v
+烧结机 3 n
+烧结炉 3 n
+烧结焙烧 3 vn
+烧结砖 3 n
+烧肉 16 n
+烧腊 3 n
+烧茄子 3 n
+烧茶 3 v
+烧荒 24 v
+烧菜 3 n
+烧蚀 19 v
+烧蚀体 3 n
+烧起 3 v
+烧造 144 v
+烧酒 150 v
+烧酒鸡 3 n
+烧钱 3 v
+烧锅 28 n
+烧饭 76 v
+烧饼 588 n
+烧饼油条 3 n
+烧香 249 n
+烧香拜佛 3 n
+烧香拜拜 3 n
+烧香求神 3 n
+烧香磕头 3 l
+烧高香 6 n
+烧鸡 30 n
+烧鸭 7 n
+烧鹅 11 n
+烧麦 6 n
+烨 29 nr
+烩 841 n
+烩虾仁 3 n
+烩面 35 n
+烩饭 3 n
+烫 1024 v
+烫个 3 b
+烫伤 86 v
+烫出 3 v
+烫印机 3 n
+烫发 19 v
+烫发师 3 n
+烫头 9 v
+烫头发 3 v
+烫平 3 a
+烫平机 3 n
+烫得 3 v
+烫手 61 v
+烫手山芋 3 n
+烫来烫去 3 z
+烫死 3 v
+烫水 3 v
+烫洗 3 v
+烫洗店 3 n
+烫烫 3 v
+烫画机 3 b
+烫画纸 3 n
+烫直 3 a
+烫脚 3 v
+烫花 3 v
+烫蜡 3 v
+烫衣 3 v
+烫过 3 v
+烫过去 3 v
+烫过来 3 v
+烫酒 3 v
+烫金 16 n
+烫金机 3 n
+烫金纸 3 n
+烫面 5 b
+烬 29 g
+热 11755 n
+热丝 2 n
+热丧 3 a
+热中名利 3 l
+热中子 29 n
+热乎 67 z
+热乎乎 86 z
+热乎劲 3 l
+热交换 9 v
+热交换器 13 n
+热传导 62 n
+热传导液 3 n
+热体 3 n
+热值 47 n
+热像仪 3 n
+热内 23 n
+热内卢 3 ns
+热农大 4 nz
+热出病来 3 i
+热击穿 3 l
+热分解 24 l
+热切 179 a
+热切地 3 z
+热切期望 3 l
+热制导 3 n
+热刺刺 3 n
+热刺队 3 n
+热力 139 n
+热力四射 3 l
+热力学 401 n
+热力学势 3 n
+热力学流 3 n
+热力学温度 25 n
+热力学温标 6 n
+热力循环 3 i
+热力设备 3 n
+热力过程 3 l
+热功当量 33 l
+热加 3 v
+热加工 19 n
+热动力 9 n
+热劲 3 a
+热化 25 n
+热化学 3 n
+热区 8 n
+热升华 3 n
+热卖 15 v
+热卖中 3 n
+热卖价 3 n
+热卡 3 n
+热压 14 n
+热压机 3 n
+热压焊 3 n
+热压釜 3 n
+热压铸 3 n
+热反应 2 l
+热反应堆 3 l
+热可炙手 3 i
+热合 2 v
+热合机 3 n
+热合金 3 n
+热启动 3 l
+热吻 3 n
+热呼 3 v
+热呼呼 278 z
+热咖啡 3 nr
+热哄哄 3 z
+热喀斯特 3 ns
+热喝 3 v
+热喷涂 3 z
+热噪声 3 l
+热固性 24 n
+热土 34 n
+热地 6 n
+热塑 8 n
+热塑性 46 n
+热处理 124 n
+热处理炉 3 n
+热天 24 n
+热天气 3 n
+热头上 3 l
+热媒 3 n
+热季 3 n
+热学 88 n
+热定型 3 n
+热害 3 a
+热容 3 n
+热容量 3 n
+热寂 3 a
+热寂论 5 i
+热对流 14 n
+热导率 34 n
+热导管 3 n
+热尼亚 3 ns
+热岛 17 n
+热工 15 n
+热工学 5 n
+热工设计 3 n
+热巴 3 n
+热带 2584 n
+热带丛林 3 n
+热带作物 3 l
+热带地区 3 n
+热带性 3 n
+热带植物 3 l
+热带气候 3 n
+热带海洋 3 n
+热带病 8 n
+热带雨林 335 n
+热带风暴 3 n
+热带鱼 36 n
+热干面 3 n
+热平衡 3 i
+热库 3 n
+热应力 3 n
+热度 82 n
+热开水 3 n
+热式 3 n
+热当量 3 l
+热得得 3 v
+热得快 3 a
+热循环 3 n
+热心 645 n
+热心人 21 n
+热心快肠 3 i
+热心用户 3 n
+热心肠 14 n
+热心苦口 3 i
+热忱 321 n
+热忱地 3 nr
+热忱心 3 nr
+热忱服务 3 nr
+热性 3 n
+热恋 96 v
+热恼 3 a
+热情 2818 n
+热情关心 3 l
+热情关怀 3 l
+热情关注 3 l
+热情周到 3 l
+热情奔放 30 l
+热情好客 3 i
+热情帮助 3 l
+热情接待 3 i
+热情服务 3 l
+热情欢迎 3 i
+热情洋溢 51 l
+热情高涨 3 l
+热惰性 3 vn
+热意 3 n
+热感 14 n
+热成像仪 14 nz
+热成层 3 l
+热战 11 n
+热扩散 3 n
+热拉尔 7 nrt
+热挤压 3 z
+热控制 3 n
+热插拔 3 n
+热播 40 vn
+热收缩 3 l
+热效应 60 n
+热效率 46 n
+热敏 31 a
+热敏性 2 n
+热敏电阻 3 n
+热敏纸 3 n
+热敷 44 v
+热敷法 3 n
+热昏 3 v
+热望 34 a
+热望人 3 n
+热望者 3 n
+热机 38 n
+热机效率 3 n
+热板 3 n
+热柱 3 n
+热核 3 n
+热核反应 31 l
+热核武器 20 l
+热梯度 3 n
+热毒素 3 n
+热毛子马 3 n
+热气 386 n
+热气球 47 n
+热气腾腾 110 z
+热氧化 3 n
+热水 482 n
+热水器 68 n
+热水塘 5 n
+热水平衡 3 i
+热水机组 3 n
+热水澡 22 n
+热水炉 3 n
+热水瓶 58 n
+热水管 3 n
+热水袋 29 n
+热水锅炉 3 n
+热污染 7 i
+热汤 39 n
+热汤面 2 n
+热汽 3 n
+热河 174 ns
+热河人 3 n
+热河省 3 ns
+热河高原 3 ns
+热油 3 n
+热油循环 3 n
+热油泵 3 n
+热泉 38 n
+热泪 508 n
+热泪夺眶 10 l
+热泪潸潸 3 z
+热泪盈眶 280 l
+热泵 17 n
+热流 86 n
+热流计 3 l
+热流量 25 n
+热浪 93 n
+热浪滚滚 3 l
+热浪袭来 3 i
+热海 10 ns
+热涨冷缩 3 l
+热液 3 n
+热湖 3 ns
+热源 108 n
+热溶胶 3 n
+热滚滚 3 z
+热滴定法 3 n
+热潮 403 n
+热灌装 3 l
+热火 191 n
+热火朝天 103 i
+热火队 3 n
+热炒 10 v
+热炕 9 n
+热点 1226 n
+热点新闻 3 n
+热点话题 3 n
+热点问题 3 n
+热烈 1963 a
+热烈响应 3 n
+热烈奔放 3 i
+热烈庆祝 3 ns
+热烈欢迎 3 i
+热烈祝贺 3 ns
+热烈鼓掌 3 i
+热烘烘 86 z
+热烫 3 z
+热热 3 a
+热热烈烈 3 i
+热热身 4 n
+热热闹闹 81 z
+热熔 7 n
+热熔胶 3 n
+热熬翻饼 3 nr
+热爆炸 3 n
+热爱 869 a
+热爱人民 3 l
+热爱劳动 3 l
+热爱工作 3 l
+热爱生活 3 l
+热爱祖国 3 ns
+热爱集体 3 l
+热物 3 n
+热狂 3 a
+热狗 5 n
+热猝灭 3 vn
+热瓦甫 16 nr
+热田 12 n
+热电 39 n
+热电体 3 n
+热电偶 14 n
+热电厂 23 n
+热电器件 3 n
+热电子 18 n
+热电学 3 n
+热电效应 9 n
+热电站 31 n
+热电阻 3 n
+热病 85 n
+热症 10 n
+热痛觉 3 i
+热盼 4 v
+热科院 4 l
+热稳定性 28 n
+热空气 3 n
+热管 23 n
+热线 479 n
+热线服务 3 n
+热线电话 3 n
+热线联系 3 n
+热络 26 n
+热缩 4 v
+热缩管 3 n
+热网 2 n
+热罗姆 3 nrt
+热罨法 3 vn
+热聚合 3 n
+热肠 17 n
+热肠人 3 n
+热肠古道 3 l
+热胀 4 v
+热胀冷缩 32 l
+热胶 3 n
+热能 259 n
+热能设备 3 n
+热腾腾 71 z
+热膨胀 28 l
+热致发光 3 n
+热舞 3 n
+热茶 98 n
+热药 3 n
+热菜 38 n
+热血 353 n
+热血传奇 3 n
+热血动物 3 n
+热血沸腾 226 i
+热血男儿 3 l
+热血青年 3 n
+热补 3 v
+热补偿器 3 l
+热表 3 n
+热衷 215 n
+热衷于 211 v
+热衷功名 3 i
+热衷者 2 n
+热裤 3 n
+热裤装 3 n
+热觉 3 n
+热解 22 v
+热解光谱 3 n
+热解消除 3 i
+热计量 3 n
+热讯 3 nz
+热诚 70 a
+热诚感人 3 n
+热豆腐 3 n
+热货 3 n
+热质说 3 n
+热贴榜 3 n
+热超声焊 3 nr
+热身 73 n
+热身赛 86 n
+热身运动 3 l
+热轧 19 v
+热轧卷 3 nz
+热轧板 3 n
+热转印 3 n
+热载体 3 n
+热辐射 74 nz
+热辐射法 3 n
+热辣 13 a
+热辣辣 97 z
+热运转 3 l
+热连轧 4 j
+热那亚 89 ns
+热酸处理 3 n
+热采方法 3 n
+热释光 11 n
+热重法 3 n
+热量 1121 n
+热量表 3 n
+热量计 3 n
+热量资源 3 n
+热销 62 v
+热销货 3 n
+热锅 3 n
+热锅上的蚂蚁 38 l
+热锅蚂蚁 3 l
+热键 3 n
+热锻 3 n
+热镀锌 3 n
+热门 677 n
+热门股 3 n
+热门话题 3 n
+热门货 5 n
+热门资源 3 n
+热门音乐 3 n
+热闹 2022 a
+热闹滚滚 3 z
+热闹非凡 198 l
+热阴极 3 ns
+热阻 7 n
+热障 2 n
+热靴 3 n
+热风 44 n
+热风幕 3 n
+热风机 3 n
+热风枪 3 l
+热风炉 3 n
+热食 3 n
+热饭 3 n
+热饮 8 n
+烯 161 x
+烯丙基 7 nz
+烯丙基氯 2 nz
+烯炔 3 n
+烯烃 103 n
+烯类 3 n
+烯酮 4 nz
+烯酸 8 n
+烯醇 17 n
+烯醇酯 3 nz
+烱 3 zg
+烴 3 zg
+烶 25 zg
+烷 177 n
+烷基 106 n
+烷基化 33 n
+烷基苯 10 nz
+烷基酚 2 nz
+烷氧基 6 n
+烷烃 82 n
+烹 209 v
+烹制 571 v
+烹宰 3 v
+烹煮 3 v
+烹煮法 3 nz
+烹犬藏弓 3 n
+烹狗藏弓 3 nz
+烹茗 3 v
+烹茶 44 v
+烹调 514 v
+烹调学 3 n
+烹调学家 3 n
+烹调师 4 n
+烹调油 3 n
+烹调法 11 n
+烹饪 464 v
+烹饪器 3 v
+烹饪法 3 vn
+烹龙庖凤 3 nz
+烹龙炮凤 3 n
+烹龙煮凤 3 nz
+烹龙砲凤 3 nz
+烺 39 zg
+烻 118 zg
+烼 4 zg
+烽 88 n
+烽火 127 n
+烽火台 47 n
+烽火四起 3 i
+烽火山 3 n
+烽火相连 3 i
+烽火连三 3 i
+烽火连天 8 i
+烽火连年 3 n
+烽烟 36 n
+烽烟四起 3 i
+烽燧 39 n
+烽鼓不息 3 i
+焃 8 zg
+焄 8 zg
+焇 5 zg
+焉 827 v
+焉博 3 ns
+焉得 3 ns
+焉得虎子 13 i
+焉敢 3 i
+焉用 3 ns
+焉知 3 ns
+焉知非福 6 i
+焉耆 260 ns
+焉耆回族 3 ns
+焉耆回族自治县 12 ns
+焉能 3 ns
+焊 170 v
+焊上 3 v
+焊上去 3 v
+焊丝 2 n
+焊了 3 v
+焊入 3 v
+焊出 3 v
+焊到 3 v
+焊剂 2 n
+焊割 3 v
+焊头 3 v
+焊工 5 v
+焊得 3 v
+焊成 3 v
+焊把 3 nz
+焊接 268 v
+焊接件 4 n
+焊接工 3 n
+焊接式 2 n
+焊接机 3 n
+焊接设备 3 n
+焊接车间 3 n
+焊料 4 n
+焊机 3 n
+焊条 7 n
+焊枪 6 n
+焊点 3 n
+焊烧 3 v
+焊痕 3 n
+焊着 3 v
+焊管 3 v
+焊缝 6 n
+焊芯 3 n
+焊花 7 n
+焊药 3 n
+焊过 3 v
+焊道 3 v
+焊钳 3 n
+焊锡 8 nz
+焊锡丝 3 nz
+焊锡条 3 n
+焊锡膏 3 nz
+焋 4 zg
+焌 4 zg
+焐 105 v
+焑 4 zg
+焓 79 zg
+焕 210 vg
+焕发 166 v
+焕发起来 3 i
+焕彩 2 v
+焕烂 3 v
+焕然 5 z
+焕然一新 622 i
+焕然如新 3 i
+焖 1137 v
+焖牛肉 3 n
+焖饭 2 n
+焗 12 zg
+焗油 3 z
+焘 81 nr
+焙 179 v
+焙制 2 v
+焙干 12 v
+焙烤 35 v
+焙烧 43 v
+焙烧炉 3 n
+焙粉 3 nz
+焙茶 3 v
+焚 584 v
+焚书 30 v
+焚书坑儒 24 i
+焚典坑儒 3 i
+焚化 115 v
+焚化炉 12 n
+焚如之祸 3 i
+焚尸 3 n
+焚尸扬灰 3 i
+焚尸案 3 n
+焚尸炉 51 n
+焚巢捣穴 3 i
+焚巢荡穴 3 i
+焚心 3 v
+焚心以火 3 i
+焚掠 3 v
+焚林竭泽 3 i
+焚林而猎 3 n
+焚林而田 3 i
+焚枯食淡 3 n
+焚毁 336 v
+焚烧 395 v
+焚烧厂 2 n
+焚烧处理 2 i
+焚烧法 3 n
+焚烧炉 10 n
+焚琴煮鹤 2 i
+焚琴鬻鹤 3 i
+焚稿 4 v
+焚符破玺 3 n
+焚膏继晷 3 i
+焚舟 3 v
+焚舟破釜 3 n
+焚芝锄蕙 3 nr
+焚薮而田 3 v
+焚起 3 v
+焚身 3 v
+焚风 30 v
+焚香 177 v
+焚香扫地 3 i
+焚香烧炉 3 n
+焚香礼拜 12 i
+焚香膜拜 3 i
+焚香顶礼 3 i
+焚骨扬灰 3 i
+焜 19 zg
+焞 9 zg
+無 2 zg
+焣 52 zg
+焤 5 zg
+焦 1295 a
+焦三爷 14 nr
+焦仲卿 3 nr
+焦体怡 3 nr
+焦作 82 n
+焦作人 3 n
+焦作市 35 n
+焦先生 2 nr
+焦克敏 2 nr
+焦公礼 135 nr
+焦兽目 2 i
+焦凤波 4 nr
+焦切 3 a
+焦利 2 ns
+焦利蒂 3 nr
+焦化 29 n
+焦化厂 8 n
+焦卫平 9 nr
+焦味 3 n
+焦唇干肺 3 i
+焦唇干舌 3 i
+焦唇敝舌 3 i
+焦善民 2 nr
+焦土 40 n
+焦土政策 3 n
+焦墨 12 n
+焦墨勾 2 nr
+焦头 3 n
+焦头烂额 88 i
+焦头额烂 3 n
+焦姑娘 6 nr
+焦孔达 2 nr
+焦宛儿 196 nr
+焦宝石 6 nr
+焦尔达 2 nr
+焦山 16 ns
+焦山寺 2 ns
+焦山河 768 ns
+焦岭 2 ns
+焦师兄 2 nr
+焦帮主 19 n
+焦干 3 n
+焦庄户 3 ns
+焦得布 2 nr
+焦德海 3 nr
+焦心 7 n
+焦心劳思 3 i
+焦心热中 3 n
+焦思苦虑 3 i
+焦急 902 a
+焦急万分 3 i
+焦急状态 3 n
+焦性 2 n
+焦恩俊 3 nr
+焦愁 3 a
+焦振国 26 nr
+焦散线 3 n
+焦文期 51 nr
+焦易 14 a
+焦景颜 2 nr
+焦曲菌素 3 n
+焦木 37 nr
+焦木和尚 7 nr
+焦木大师 12 nr
+焦木怒 2 nr
+焦木禅师 3 nr
+焦枝 7 n
+焦枝线 259 nr
+焦枯 5 nr
+焦柳线 256 nr
+焦树阁 3 nr
+焦比 3 ns
+焦沙烂石 3 nr
+焦油 27 n
+焦渴 24 a
+焦灼 121 a
+焦灼灼 3 nr
+焦炉 19 n
+焦炉煤气 3 n
+焦炙 3 v
+焦炭 141 n
+焦点 962 n
+焦点人物 3 n
+焦点新闻 3 nr
+焦点网 3 n
+焦点访谈 3 n
+焦烂 6 a
+焦烧 3 n
+焦热 3 a
+焦焕成 3 nr
+焦煤 26 n
+焦熬投石 3 nz
+焦燥 6 a
+焦玉峰 2 nr
+焦瑾璞 5 nr
+焦痕 11 n
+焦皮 3 n
+焦益 4 n
+焦眉愁眼 3 i
+焦眉皱眼 3 i
+焦眉苦脸 3 i
+焦碳 3 n
+焦磷酸 5 n
+焦糊 11 a
+焦糊糊 2 z
+焦糖 43 n
+焦老儿 3 nr
+焦耳 216 nr
+焦耳定律 3 n
+焦耳实验 3 n
+焦脆 2 a
+焦臭 8 n
+焦若愚 2 nr
+焦菊隐 11 nr
+焦虑 676 a
+焦虑不安 43 i
+焦虑症 41 n
+焦虚寒 2 nr
+焦裂 3 v
+焦裕禄 51 nr
+焦触 5 n
+焦距 64 n
+焦躁 371 a
+焦躁感 3 nr
+焦辣辣 3 z
+焦达峰 2 nr
+焦里嫩 3 ns
+焦金流石 3 n
+焦金烁石 3 nr
+焦阎王 5 nr
+焦雷 24 nr
+焦风波 2 nr
+焦饭 2 n
+焦黄 341 nr
+焦黑 28 ns
+焦黑色 3 n
+焧 3 zg
+焪 12 zg
+焫 2 zg
+焮 6 zg
+焮天铄地 3 i
+焯 80 v
+焰 274 n
+焰口 19 n
+焰彩 3 n
+焰心 9 n
+焰火 62 n
+焰火晚会 3 n
+焰硝 3 n
+焱 58 g
+焴 7 zg
+然 3720 c
+然乌湖 3 v
+然则 127 c
+然后 16239 c
+然后背 3 v
+然糠照薪 3 nr
+然糠自照 3 v
+然而 8350 c
+然荻读书 3 nz
+焸 2 zg
+焹 2 zg
+焺 17 zg
+焻 5 zg
+焼 14 zg
+煀 4 zg
+煁 16 zg
+煂 5 zg
+煃 6 zg
+煄 38 zg
+煅 51 v
+煅烧 28 v
+煅烧炉 3 v
+煅石灰 3 v
+煆 5 zg
+煇 156 zg
+煊 61 x
+煊赫 55 a
+煋 8 zg
+煌 680 g
+煌煌 3 ns
+煌熠 3 nr
+煍 33 zg
+煎 2503 v
+煎作 3 vn
+煎出 3 v
+煎到 3 v
+煎反 3 v
+煎成 3 v
+煎水作冰 3 n
+煎法 3 n
+煎炒 3 v
+煎炸 3 v
+煎点 3 n
+煎煎 3 v
+煎煮 3 v
+煎熬 239 v
+煎肉 3 n
+煎肉饼 3 n
+煎胶续弦 3 n
+煎药 40 n
+煎药法 3 nz
+煎蛋 3 n
+煎蛋卷 3 n
+煎豆摘瓜 3 n
+煎起 3 v
+煎起来 3 v
+煎过去 3 v
+煎过来 3 v
+煎迫 3 v
+煎锅 3 n
+煎饼 42 n
+煎饼果子 3 n
+煎鱼 4 n
+煏 2 zg
+煕 8 zg
+煖 12 zg
+煖和 3 z
+煖房 3 vn
+煖炉 3 v
+煖玉 3 nz
+煖衣饱食 3 nz
+煙 10 zg
+煚 160 zg
+煜 115 zg
+煞 588 v
+煞住 23 v
+煞尾 3 n
+煞星 3 n
+煞是好看 3 l
+煞有介事 87 l
+煞有其事 50 i
+煞气 64 n
+煞白 128 z
+煞神 35 n
+煞神鬼 3 l
+煞笔 3 n
+煞费 3 n
+煞费心机 3 l
+煞费苦心 59 l
+煞车 14 n
+煞车不灵 3 i
+煞车失灵 3 i
+煞车灯 3 n
+煞风景 13 l
+煟 3 zg
+煠 5 zg
+煡 289 zg
+煤 2553 n
+煤业 4 n
+煤井 4 n
+煤仓 3 n
+煤价 17 n
+煤制气 2 n
+煤制油 3 n
+煤化 17 n
+煤化工 36 n
+煤区 3 n
+煤厂 5 n
+煤变油 3 n
+煤场 23 n
+煤坑 2 n
+煤块 26 n
+煤城 7 n
+煤堆 20 n
+煤尘 12 n
+煤层 149 n
+煤层气 22 n
+煤屑 15 n
+煤山 66 n
+煤带 3 n
+煤库 3 n
+煤店 3 n
+煤成气 3 n
+煤成烃 3 n
+煤斗 3 n
+煤斗车 3 n
+煤末 3 n
+煤末子 2 n
+煤核 3 n
+煤核儿 3 n
+煤桶 3 n
+煤棚 3 n
+煤毒 3 n
+煤气 285 n
+煤气中毒 3 n
+煤气公司 3 n
+煤气化 10 n
+煤气厂 8 n
+煤气工厂 3 n
+煤气灯 18 n
+煤气灶 20 n
+煤气炉 3 n
+煤气站 3 n
+煤气筒 3 n
+煤气管 3 n
+煤气管道 3 n
+煤气罐 13 n
+煤气表 3 n
+煤气费 2 n
+煤油 145 n
+煤油灯 58 n
+煤油炉 8 n
+煤泥 3 n
+煤海 9 n
+煤渣 12 n
+煤渣路 3 n
+煤火 8 n
+煤灰 51 n
+煤炉 22 n
+煤炉子 7 n
+煤炭 1617 n
+煤炭企业 3 n
+煤炭厅 2 n
+煤炭工 3 n
+煤炭工业 3 n
+煤炭工业局 3 nt
+煤炭工人 3 n
+煤炭市场 3 n
+煤炭法 4 n
+煤炭网 3 n
+煤炭行业 3 n
+煤炭资源 3 n
+煤炭部 4 n
+煤烟 29 n
+煤焦 7 n
+煤焦油 55 n
+煤球 51 n
+煤田 264 n
+煤电 134 j
+煤矸石 9 n
+煤矿 933 n
+煤矿主 3 n
+煤矿安全 3 n
+煤矿工 3 n
+煤矿工人 3 n
+煤砖 2 n
+煤碳 2 n
+煤碳工业 3 n
+煤窑 44 n
+煤粉 9 n
+煤精 7 n
+煤系 3 n
+煤老板 3 n
+煤耗 3 n
+煤质 33 n
+煤车 11 n
+煤运 7 n
+煤都 10 n
+煤铁 3 n
+煤铁矿 3 nz
+煤饼 10 n
+煤黑 3 n
+煤黑子 7 n
+煥 2 zg
+煦 52 nr
+煦仁孑义 3 vn
+煦和 3 a
+煦煦 3 a
+煦色韶光 3 nr
+照 5076 n
+照上 3 d
+照上去 3 v
+照上来 3 v
+照下 3 v
+照下去 3 v
+照下来 3 v
+照不到 3 v
+照临 3 v
+照临大地 3 i
+照些 3 d
+照亮 264 v
+照人 3 n
+照人肝胆 3 i
+照付 3 v
+照价 3 n
+照价收买 3 l
+照价收购 3 n
+照价赔偿 3 n
+照会 107 n
+照住 3 v
+照例 780 n
+照像 24 v
+照像机 3 n
+照像馆 3 n
+照关不误 3 l
+照写 3 v
+照写不误 3 v
+照准 32 n
+照减 3 v
+照出 3 v
+照出去 3 v
+照出来 3 v
+照到 3 v
+照办 116 v
+照办不误 3 n
+照功行赏 3 n
+照单全收 3 n
+照占 3 v
+照印 3 v
+照发 19 v
+照叶林 3 n
+照后镜 3 n
+照唱 3 v
+照喝 3 v
+照墙 3 n
+照壁 73 n
+照妖镜 14 n
+照学 3 n
+照完 3 v
+照实 89 d
+照射 689 v
+照射到 3 v
+照射率 3 n
+照尖 3 n
+照常 183 d
+照常上班 3 n
+照常上课 3 n
+照常营业 3 n
+照常进行 3 n
+照应 256 v
+照度 24 n
+照度计 2 v
+照开 3 v
+照录 3 v
+照征 3 n
+照得 3 v
+照得人 3 n
+照抄 59 v
+照抄一次 3 n
+照抄一遍 3 n
+照抄不误 3 n
+照护 12 v
+照拂 28 v
+照换 3 v
+照排 13 v
+照排机 2 n
+照提 3 n
+照插 3 v
+照插不误 3 i
+照搬 171 v
+照搬照套 3 i
+照数 3 n
+照料 547 n
+照旧 253 d
+照明 632 v
+照明弹 112 n
+照明效应 3 n
+照明灯 27 n
+照明用 15 n
+照明电 3 n
+照明者 3 n
+照明设备 3 n
+照明设计 3 i
+照明负荷 3 n
+照映 29 v
+照曝光 3 i
+照本宣科 50 nz
+照来 3 v
+照来照去 3 i
+照查 3 v
+照查不误 3 n
+照样 657 d
+照样做 3 v
+照样写 3 v
+照样读 3 v
+照此 3 d
+照此办理 3 l
+照此类推 3 l
+照此进行 3 l
+照派 3 n
+照海 3 n
+照炒 3 v
+照炒不误 3 n
+照片 2305 n
+照片判读 3 n
+照片集 3 n
+照猫画虎 11 i
+照玩 3 v
+照玩不误 3 v
+照理 80 n
+照理说 3 n
+照生 3 v
+照生不误 3 v
+照用 3 v
+照用不误 3 v
+照登 3 v
+照直 17 d
+照直说 3 n
+照相 379 d
+照相乾片 3 i
+照相仪 6 n
+照相侦察 3 n
+照相制版 3 n
+照相录制 3 n
+照相术 21 n
+照相机 275 n
+照相架 3 n
+照相法 3 n
+照相版 3 n
+照相簿 4 n
+照相纸 2 n
+照相馆 85 n
+照看 246 v
+照看不误 3 v
+照眼 3 d
+照着 42 v
+照码 3 n
+照稿 3 n
+照稿录入 3 n
+照站 3 n
+照章 8 n
+照章办事 5 n
+照章办理 3 n
+照章行事 3 n
+照签 3 v
+照签不误 3 n
+照算 3 v
+照算不误 3 n
+照管 110 n
+照纳 3 v
+照缴 3 v
+照耀 503 v
+照考 3 v
+照自 3 d
+照萤映雪 3 nr
+照葫芦画瓢 9 n
+照虚 3 v
+照表 3 n
+照见 44 v
+照记 3 n
+照设 3 v
+照说 30 v
+照说不误 3 v
+照请 3 v
+照请不误 3 n
+照读 3 v
+照起 3 v
+照过 3 v
+照过去 3 v
+照过来 3 d
+照这么说 3 l
+照进 3 v
+照进去 3 v
+照进来 3 v
+照道理讲 3 l
+照道理说 3 n
+照镜 3 n
+照镜子 93 n
+照面 102 n
+照顾 2157 v
+照顾性 3 d
+照领 3 v
+煨 874 v
+煨干就湿 3 nr
+煨干避湿 3 v
+煩 141 zg
+煬 8 zg
+煭 26 zg
+煮 2268 v
+煮出 3 v
+煮开 3 v
+煮弩为粮 3 ns
+煮成 3 v
+煮掉 3 v
+煮水 3 v
+煮汁 3 v
+煮汤 3 v
+煮沸 115 v
+煮沸法 3 vn
+煮沸裂解 3 nr
+煮法 3 v
+煮烂 3 v
+煮热 3 v
+煮熟 3 v
+煮粥 3 v
+煮粥焚须 3 nr
+煮练 3 v
+煮肉 3 v
+煮茗 3 v
+煮茶 3 v
+煮菜 3 v
+煮蛋 3 v
+煮豆燃箕 3 n
+煮豆燃萁 3 nr
+煮起来 3 v
+煮食 3 v
+煮饭 96 v
+煮鹤烧琴 3 ns
+煮鹤焚琴 3 nr
+煯 3 zg
+煲 140 v
+煲仔饭 3 n
+煲机 3 n
+煲汤 16 n
+煳 121 a
+煴 7 zg
+煶 460 zg
+煸 24 v
+煸动 3 n
+煸炒 3 n
+煹 7 zg
+煺 31 v
+煻 3 zg
+煼 6 zg
+煽 189 v
+煽乱 3 v
+煽动 344 v
+煽动力 3 l
+煽动性 22 n
+煽动案件 3 l
+煽动者 3 n
+煽客 3 v
+煽情 22 v
+煽情主义 3 l
+煽惑 63 v
+煽火 3 v
+煽炉子 3 n
+煽诱 3 v
+煽起 3 v
+煽起来 3 l
+煽风点火 54 l
+煾 2 zg
+煿 26 zg
+熀 35 zg
+熄 292 v
+熄减 3 v
+熄掉 3 v
+熄火 59 v
+熄火装置 3 n
+熄灭 371 v
+熄灯 52 v
+熄灯号 9 n
+熄风 42 v
+熊 1517 nr
+熊一新 2 nr
+熊丙奇 6 nr
+熊争艳 2 nr
+熊井启 2 nr
+熊任 2 n
+熊佛西 7 nr
+熊俊峰 3 nr
+熊元献 47 nr
+熊光楷 12 nr
+熊克武 4 nr
+熊出没 3 i
+熊包 3 n
+熊十力 260 nr
+熊友兰 2 nr
+熊召政 261 nr
+熊可模 3 nr
+熊启放 5 nr
+熊启生 2 nr
+熊国宝 5 nr
+熊国鸣 6 nr
+熊坛 2 n
+熊备加 2 nr
+熊大人 15 nr
+熊大闰 3 nr
+熊天平 3 nr
+熊孝义 2 nr
+熊宝宝 7 nr
+熊宦途 3 nr
+熊小镭 3 nr
+熊尚厚 19 nr
+熊山君 3 nr
+熊岭义 8 nr
+熊岭瓶 2 nr
+熊岳河 2 nr
+熊岳镇 3 nr
+熊市 48 n
+熊师兄弟 2 nr
+熊希龄 20 nr
+熊庆来 16 nr
+熊庆胄 2 nr
+熊廷弼 627 nr
+熊开元 4 nr
+熊式机 2 nr
+熊式辉 5 nr
+熊彼特 6 nr
+熊德基 6 nr
+熊德明 2 nr
+熊心虎 2 nr
+熊心豹子 3 nr
+熊心豹胆 3 i
+熊性蠢 2 nr
+熊成基 3 nr
+熊据虎跱 3 ns
+熊掌 348 nr
+熊文灿 116 nr
+熊明遇 52 nr
+熊有伦 257 nr
+熊本 14 n
+熊本县 9 nr
+熊柳慧子 3 nr
+熊树梅 33 nr
+熊样儿 2 nr
+熊梦飞 6 nr
+熊欣欣 3 nr
+熊汝霖 11 nr
+熊洞里 3 nr
+熊润频 2 nr
+熊熊 193 nr
+熊熊大火 3 nr
+熊熊烈火 22 nr
+熊熊燃烧 3 n
+熊猫 286 nr
+熊猫儿 3 nr
+熊猫手机 3 n
+熊猫电子集团 6 nt
+熊猫眼 3 nr
+熊猫馆 5 nr
+熊猴 3 nr
+熊由奉 2 nr
+熊皮 9 n
+熊皮熊 3 nr
+熊眼 2 n
+熊瞎子 2 nr
+熊类 4 n
+熊经鸟伸 3 nr
+熊经鸟引 3 nr
+熊经鸟曳 3 n
+熊经鸟申 3 nr
+熊经鸱顾 3 vn
+熊维尼 4 nr
+熊罴之士 3 v
+熊罴入梦 3 v
+熊罴百万 3 ns
+熊老爷 3 nr
+熊耳山 20 nr
+熊胆 39 nr
+熊胆丸 10 nr
+熊腰虎背 3 n
+熊虎之士 3 nr
+熊蛇丸 11 nr
+熊蜂 12 nr
+熊赐履 181 nr
+熊金超 3 nr
+熊队 3 n
+熊雨殷 7 nr
+熊韬豹略 3 nr
+熊颖颖 3 nr
+熊飞豹 3 nr
+熋 2 zg
+熌 12 zg
+熏 500 v
+熏制 13 vn
+熏制厂 3 n
+熏天 3 nz
+熏天吓地 3 n
+熏天赫地 3 nz
+熏得 3 v
+熏杀 3 vn
+熏染 59 vn
+熏火腿 3 nz
+熏烟 11 nz
+熏烤 13 nz
+熏烧 3 v
+熏熏 3 nz
+熏笼 3 vn
+熏箱 3 nz
+熏肉 21 n
+熏腐之余 3 n
+熏莸同器 3 v
+熏蒸 37 vn
+熏蒸剂 13 nz
+熏衣草 5 n
+熏陶 203 vn
+熏陶成性 3 nz
+熏风 8 n
+熏香 7 nz
+熏鱼 12 nz
+熏鸡 3 n
+熏黑 3 nz
+熏黑了 3 v
+熒 2 zg
+熔 463 n
+熔于 3 v
+熔于一炉 8 l
+熔今铸古 3 l
+熔体 31 n
+熔剂 39 n
+熔化 147 v
+熔化为 3 n
+熔化成 3 n
+熔化期 3 n
+熔化炉 3 n
+熔化热 3 n
+熔古铄今 3 v
+熔古铸今 3 l
+熔合 6 v
+熔岩 332 n
+熔岩流 3 n
+熔度 3 n
+熔接 3 v
+熔接机 3 n
+熔断 9 v
+熔断器 22 n
+熔模 2 n
+熔模铸造 3 l
+熔池 3 n
+熔渣 4 n
+熔炉 51 n
+熔点 566 n
+熔炼 96 v
+熔炼炉 11 n
+熔焊 3 n
+熔盐 15 n
+熔矿炉 3 n
+熔窑 3 n
+熔蜡 3 n
+熔融 147 n
+熔融指数 3 n
+熔融缩聚 3 nz
+熔解 24 v
+熔解热 5 n
+熔铸 320 v
+熔铸工 3 n
+熔锡 3 n
+熖 3 zg
+熘 38 v
+熘肝尖 3 v
+熘鱼片 3 nr
+熙 918 nz
+熙和 3 nz
+熙和恬静 3 i
+熙宁 162 nz
+熙德 22 nz
+熙攘 40 z
+熙日 3 nz
+熙春 3 nz
+熙来攘往 32 i
+熙熙攘攘 103 i
+熙熙融融 3 i
+熚 2 zg
+熜 348 zg
+熟 4974 a
+熟不拘礼 3 i
+熟丝 4 n
+熟习 111 v
+熟人 506 n
+熟到 3 v
+熟化 28 v
+熟土 3 n
+熟地 29 n
+熟地黄 4 n
+熟女 3 n
+熟妙 3 a
+熟字 3 n
+熟客 12 n
+熟巧 3 a
+熟归熟 3 i
+熟得 3 v
+熟念 3 v
+熟思 3 v
+熟思审处 3 n
+熟悉 3053 v
+熟悉业务 3 vn
+熟悉起来 3 v
+熟悉路途 3 s
+熟手 12 v
+熟料 2 n
+熟橡胶 3 n
+熟母 3 n
+熟火腿 3 n
+熟炭 3 n
+熟点 3 n
+熟烂 3 v
+熟熟手 3 n
+熟猪油 3 n
+熟皮 3 n
+熟眠 3 v
+熟睡 108 v
+熟睡中 3 n
+熟知 293 v
+熟石灰 6 n
+熟石膏 4 n
+熟稔 31 a
+熟稔起来 3 v
+熟练 650 a
+熟练地 3 n
+熟练工 7 n
+熟练工人 3 n
+熟练度 3 n
+熟练掌握 3 i
+熟练程度 3 n
+熟练者 3 n
+熟络 3 n
+熟肉 26 n
+熟肉制品 6 n
+熟能生巧 32 n
+熟苗 3 n
+熟荒 3 v
+熟荒地 3 i
+熟菜 8 n
+熟落 3 v
+熟虑 51 v
+熟视 3 v
+熟视无睹 42 i
+熟视着 3 n
+熟认 3 v
+熟记 43 v
+熟识 141 v
+熟语 4 n
+熟读 91 v
+熟读成诵 3 i
+熟读深思 3 i
+熟读课文 3 n
+熟谙 62 v
+熟路 5 n
+熟路轻车 3 n
+熟路轻辙 3 i
+熟透 56 v
+熟道 2 v
+熟铁 47 n
+熟铜 29 n
+熟门熟路 21 n
+熟面孔 3 n
+熟食 67 v
+熟食品 3 n
+熟食店 3 n
+熟饪 3 v
+熟饭 3 v
+熟魏生张 3 i
+熟鲜 3 a
+熠 3 z
+熠烁 3 z
+熠熠 310 z
+熠熠升起 3 i
+熠熠生辉 32 i
+熠熠闪闪 3 i
+熠燿 3 z
+熠耀 3 i
+熥 4 zg
+熧 2 zg
+熨 87 v
+熨帖 11 n
+熨平 6 n
+熨整 3 a
+熨斗 30 v
+熨烫 22 v
+熨熨贴贴 3 n
+熨衣工 3 n
+熬 1237 v
+熬不住 3 v
+熬不过 3 v
+熬出 3 v
+熬出头 3 v
+熬出来 3 v
+熬到 3 v
+熬夜 161 v
+熬夜苦读 3 v
+熬姜呷醋 3 v
+熬心 3 v
+熬心费力 3 v
+熬恼 3 v
+熬日子 3 v
+熬更守夜 3 nr
+熬枯受淡 3 v
+熬汤 7 v
+熬油费火 3 v
+熬清受淡 3 v
+熬清守淡 3 nr
+熬清守谈 3 vn
+熬炼 3 v
+熬煎 91 v
+熬磨 3 v
+熬粥 3 v
+熬肠刮肚 3 n
+熬药 3 v
+熬药汤 3 v
+熬起 3 v
+熬起来 3 v
+熬过 3 v
+熬过去 3 v
+熬过来 3 v
+熬透 3 v
+熯 9 zg
+熯天炽地 3 nr
+熱 2 zg
+熲 104 zg
+熳 27 x
+熴 62 zg
+熵 189 g
+熵增加 3 vn
+熶 584 zg
+熷 1039 zg
+熸 795 zg
+熹 76 nz
+熹宗 40 nrt
+熹平 29 nz
+熹微 31 nz
+熺 474 zg
+熻 331 zg
+熼 304 zg
+熽 3 zg
+燁 5 zg
+燂 211 zg
+燃 571 n
+燃亮 3 n
+燃尽 32 v
+燃放 47 v
+燃放烟花 3 n
+燃放鞭炮 3 n
+燃料 1241 n
+燃料工业 3 n
+燃料库 3 n
+燃料油 35 n
+燃料电池 3 n
+燃料箱 42 n
+燃料舱 3 n
+燃料费 2 n
+燃机 6 n
+燃松读书 3 n
+燃气 221 n
+燃气公司 3 n
+燃气具 23 n
+燃气灶 2 n
+燃气灶具 3 v
+燃气炉 3 n
+燃气管 3 n
+燃气表 3 n
+燃气设备 3 n
+燃气轮机 129 n
+燃气锅炉 3 n
+燃油 264 n
+燃油泵 3 n
+燃油税 3 n
+燃油箱 8 n
+燃油费 7 n
+燃油锅炉 3 n
+燃灯 3 n
+燃点 14 n
+燃炽起来 3 n
+燃烧 1553 v
+燃烧值 3 n
+燃烧剂 3 n
+燃烧半岛 3 n
+燃烧器 7 n
+燃烧室 53 n
+燃烧弹 70 n
+燃烧性 3 n
+燃烧机 3 n
+燃烧武器 3 n
+燃烧热 3 n
+燃烧物 8 n
+燃烧瓶 6 n
+燃煤 41 n
+燃爆 3 v
+燃用价值 3 n
+燃眉 3 n
+燃眉之急 78 i
+燃糠自照 3 i
+燃素 3 n
+燃素说 20 n
+燃耗 3 n
+燃萁之敏 3 v
+燃萁煎豆 3 nr
+燃萁煮豆 3 nz
+燃起 220 v
+燃香 3 n
+燈 3 zg
+燉 21 zg
+燊 16 zg
+燋头烂额 3 v
+燋金烁石 3 nr
+燎 90 zg
+燎原 76 n
+燎原之势 21 l
+燎原之火 3 l
+燎原烈火 3 l
+燎发 3 v
+燎发摧枯 3 z
+燎如观火 3 l
+燎泡 9 v
+燎炬 3 n
+燎若观火 3 l
+燏 10 zg
+燐光 3 z
+燐火 3 z
+燐灰石 3 nz
+燐肥 3 vn
+燔 12 g
+燔书坑儒 3 n
+燔书阬儒 3 nrfg
+燕 1537 nr
+燕下都 32 ns
+燕与齐 3 nr
+燕世子 2 nr
+燕世家 2 nz
+燕东园 3 nr
+燕丹子 2 nr
+燕为国 2 nr
+燕之议 4 nr
+燕乘胜 3 nr
+燕云诸 2 nr
+燕交飞 2 nr
+燕京 1399 ns
+燕京啤酒 5 nt
+燕京大学 277 nt
+燕侯赏 2 nr
+燕俦莺侣 3 n
+燕儿 12 nr
+燕公子 3 nr
+燕军乘 3 nr
+燕化 5 nz
+燕北 8 ns
+燕南 6 ns
+燕南园 3 ns
+燕南天 3 nr
+燕南路 3 ns
+燕又战 2 nz
+燕和北 2 ns
+燕啼燕语 3 i
+燕四儿 3 nr
+燕园 47 ns
+燕国 124 ns
+燕国下 2 nr
+燕国为 4 nr
+燕国于 3 nr
+燕国人 3 nr
+燕国公 2 nr
+燕国复 3 nr
+燕国殷 3 nr
+燕国皇帝 2 nr
+燕地 3 ns
+燕塞湖 6 ns
+燕处危巢 3 nr
+燕处焚巢 3 nr
+燕大侠 9 nr
+燕天王 2 nr
+燕太子丹 6 nr
+燕头镇 6 ns
+燕好 3 nr
+燕妒莺惭 3 i
+燕婉之欢 3 nr
+燕子 426 nr
+燕子垭 3 nr
+燕子岩 3 nr
+燕子衔食 3 n
+燕安酖毒 3 nz
+燕安鸩毒 3 i
+燕射歌 3 nz
+燕小乙 3 nr
+燕尔新婚 5 n
+燕尾 3 ns
+燕尾形 2 n
+燕尾旗 3 nr
+燕尾服 14 nr
+燕尾港 2 nr
+燕山 476 ns
+燕山大学 17 nt
+燕山山脉 41 ns
+燕山街 2 ns
+燕岱之石 3 ns
+燕州 2 ns
+燕巢 3 nr
+燕巢于幕 3 nr
+燕巢卫幕 3 nr
+燕巢危幕 3 nr
+燕巢幕上 3 n
+燕巢幙上 3 ns
+燕巢飞幕 3 nr
+燕师弟 5 nr
+燕师渡 2 nr
+燕幕自安 3 nr
+燕平凉 2 nr
+燕引兵 3 nr
+燕归魏 3 nr
+燕征发 2 nr
+燕悉起 2 nr
+燕惠王 11 nr
+燕慕容 20 nr
+燕投林 4 nz
+燕损兵 2 nr
+燕捷圣 2 nr
+燕文贵 3 nr
+燕无心 3 nr
+燕易王 5 nr
+燕昭好马 3 nr
+燕昭市骏 3 nr
+燕昭王 34 nr
+燕桓侯 3 nr
+燕歌赵舞 3 nr
+燕沙 2 ns
+燕派栗 2 nr
+燕然勒 2 nz
+燕然山 9 nr
+燕燕于归 3 nr
+燕燕莺莺 3 nr
+燕瘦环肥 3 nr
+燕的武 2 nr
+燕皇帝 13 nr
+燕皇裔 2 nr
+燕目雨 2 nr
+燕知草 2 nr
+燕石妄珍 3 i
+燕破军 3 nr
+燕破齐 3 nr
+燕禁卫 2 nr
+燕科 3 nz
+燕窝 108 n
+燕窝汤 21 nr
+燕窝瓶 3 nr
+燕窝镇 3 nr
+燕约莺期 3 nr
+燕翼围 3 nr
+燕翼贻谋 3 nr
+燕肃 4 ns
+燕肃造 5 nr
+燕舞莺啼 3 nr
+燕舞莺歌 3 nr
+燕莎 12 nz
+燕菜 3 n
+燕菜席 2 n
+燕西凉 6 nr
+燕誉堂 2 nr
+燕语 4 nz
+燕语呢喃 3 vn
+燕语莺呼 3 nr
+燕语莺啼 3 nr
+燕语莺声 3 nr
+燕赵 37 nr
+燕赵新 3 nr
+燕郊 73 ns
+燕都 143 ns
+燕金募秀 3 n
+燕铁木 56 nr
+燕银梭 3 nr
+燕雀 18 n
+燕雀之居 3 nr
+燕雀之见 3 nr
+燕雀处堂 2 nr
+燕雀处屋 3 nr
+燕雀安知 3 nr
+燕雀安知鸿鹄之志 4 i
+燕雀相贺 3 nr
+燕雁代飞 3 nr
+燕青亦 2 nr
+燕青便 3 nr
+燕青入 3 nr
+燕青博 2 nr
+燕青唱 3 nr
+燕青大 2 nr
+燕青奏 4 nr
+燕青射 2 nr
+燕青微微 2 nr
+燕青拖 2 nr
+燕青拜 2 nr
+燕青拳 7 nr
+燕青拿 2 nr
+燕青换 2 nr
+燕青来 2 nr
+燕青歇 2 nr
+燕青离 2 nr
+燕青笑 4 nr
+燕青纳 2 nr
+燕青转 3 nr
+燕青辞 3 nr
+燕青领 2 nr
+燕顺 56 nz
+燕顺道 3 nr
+燕颔书生 3 nz
+燕颔儒生 3 nrfg
+燕颔虎头 3 v
+燕颔虎须 3 v
+燕颔虎颈 3 v
+燕颔虬须 3 v
+燕额虎头 3 nr
+燕食 3 n
+燕驾越毂 3 nr
+燕骏千金 3 nz
+燕鱼 3 nz
+燕鸿甲 2 nr
+燕麦 154 nr
+燕麦片 7 nz
+燕麦粥 2 nz
+燕麦草 2 nr
+燝 3 zg
+燠 9 ag
+燠热 12 a
+燥 379 ag
+燥动 3 a
+燥湿 39 a
+燥热 96 a
+燥裂 3 n
+燥音 3 n
+燥风 3 n
+燧 130 n
+燧人氏 4 n
+燧石 46 n
+燧道 3 n
+燪 2 zg
+燫 95 zg
+燭 5 zg
+燮 38 g
+燮理 3 nr
+燮理阴阳 3 nr
+燺 2 zg
+燻 6 zg
+燾 7 zg
+爆 1593 v
+爆冷 18 v
+爆冷门 4 v
+爆出 103 v
+爆发 4227 v
+爆发力 50 n
+爆发变星 3 n
+爆发式 12 n
+爆发性 23 n
+爆发星 3 n
+爆发集落 3 n
+爆发音 3 n
+爆响 3 vn
+爆啃 3 l
+爆头 3 v
+爆料 3 n
+爆机 3 n
+爆棚 9 n
+爆满 91 v
+爆炒 32 v
+爆炸 1998 v
+爆炸事业 3 n
+爆炸事件 3 n
+爆炸力 29 n
+爆炸品 3 n
+爆炸声 109 n
+爆炸式 10 n
+爆炸性 113 n
+爆炸机 3 n
+爆炸松扣 3 n
+爆炸案 7 n
+爆炸案件 3 n
+爆炸波 4 n
+爆炸点 7 n
+爆炸物 24 n
+爆燃 5 v
+爆燃过程 3 l
+爆率 3 n
+爆玉米花 3 n
+爆破 366 v
+爆破作业 3 n
+爆破声 5 n
+爆破小组 3 n
+爆破手 2 n
+爆破术 3 n
+爆破筒 20 n
+爆破组 13 n
+爆破音 5 n
+爆竹 107 n
+爆竹声 24 n
+爆笑 3 v
+爆笑起来 3 l
+爆管 7 v
+爆米花 1057 n
+爆粒玉米 3 n
+爆粗 3 n
+爆肚 3 v
+爆肚儿 3 n
+爆裂 94 v
+爆裂声 10 n
+爆裂性 3 n
+爆裂火焰 3 n
+爆跳如雷 3 l
+爆震 7 n
+爇 2 zg
+爊 2 zg
+爌 3 zg
+爛 19 zg
+爜 5 zg
+爞 36 zg
+爢 7 zg
+爣 24 zg
+爧 2 zg
+爨 42 zg
+爨桂炊玉 3 nz
+爪 1287 ns
+爪儿 2 n
+爪印 3 n
+爪哇 210 ns
+爪哇人 20 n
+爪哇岛 71 ns
+爪哇海 24 ns
+爪哇虎 3 ns
+爪哇语 7 n
+爪子 154 n
+爪尖 4 n
+爪尖儿 3 n
+爪斗 3 n
+爪牙 80 ns
+爪甲 3 ns
+爪痕 3 n
+爪蟾肽 3 nz
+爪部 3 n
+爪钩 6 n
+爫 14 zg
+爬 4046 v
+爬上去 3 v
+爬上来 3 v
+爬上爬下 3 l
+爬下去 3 v
+爬下来 3 l
+爬不动 3 l
+爬不起来 3 l
+爬入 3 v
+爬出 3 v
+爬出去 3 v
+爬出来 3 v
+爬到 3 v
+爬升 65 v
+爬坡 3 n
+爬坡度 105 n
+爬墙 3 n
+爬墙梅 3 n
+爬墙而过 3 l
+爬墙虎 13 n
+爬山 117 n
+爬山涉水 3 n
+爬山虎 16 n
+爬山赛 3 n
+爬山越岭 6 n
+爬山靴 3 n
+爬开 3 v
+爬来 3 v
+爬来爬去 3 l
+爬树 38 n
+爬格子 16 n
+爬梯 5 n
+爬梳 3 n
+爬楼 3 n
+爬楼梯 3 n
+爬泳 4 n
+爬满 3 v
+爬满了 3 l
+爬灰 5 n
+爬犁 7 n
+爬竿 7 n
+爬竿取物 3 l
+爬绳 3 n
+爬耳搔腮 3 n
+爬虫 42 n
+爬虫类 3 n
+爬行 304 v
+爬行动物 111 n
+爬行拍板 3 n
+爬行榜 3 n
+爬行纲 3 n
+爬起 3 v
+爬起来 3 l
+爬越 3 v
+爬高 22 v
+爭 27 zg
+爰 136 g
+爱 14878 v
+爱丁堡 87 ns
+爱丁堡大学 37 nt
+爱丁顿 20 nr
+爱上你 3 nr
+爱上爱 3 nr
+爱上猫 3 nr
+爱不忍释 3 i
+爱不爱 3 l
+爱不释 3 v
+爱不释手 48 i
+爱与恨 3 i
+爱与梦 3 nr
+爱业 3 n
+爱丽丝 70 nr
+爱丽丝宝 3 nr
+爱丽思 12 nr
+爱丽斯 3 nr
+爱丽舍 2 nr
+爱丽舍宫 13 nr
+爱之梦 3 nr
+爱之深 3 nr
+爱之船 3 nr
+爱之香 3 nr
+爱乐 21 nr
+爱乐乐团 22 nt
+爱乐社 3 nt
+爱乐维 7 nr
+爱乡 3 ns
+爱乡如家 3 l
+爱乡精神 3 nz
+爱书 3 n
+爱书人 3 n
+爱书吧 3 n
+爱书狂 3 nr
+爱书癖 3 n
+爱书迷 3 nr
+爱人 145 n
+爱人以德 6 nr
+爱人儿 3 nr
+爱人利物 3 n
+爱人好士 3 n
+爱人如己 3 i
+爱仕达 3 nr
+爱伦 18 nr
+爱伦堡 7 ns
+爱侣 44 n
+爱侣情深 3 nz
+爱信 2 nz
+爱儿心切 3 i
+爱光闪 2 nr
+爱克卒 2 nr
+爱克发 4 nr
+爱克哈 2 nr
+爱克斯 3 nr
+爱克斯光 3 nz
+爱克赛 3 nr
+爱党 3 n
+爱内里菜 3 n
+爱农网 3 nz
+爱出风头 6 i
+爱利亚 12 ns
+爱别离苦 3 i
+爱到深处 3 l
+爱剑如 2 nr
+爱力 3 n
+爱动 3 n
+爱动肝火 3 n
+爱劳动 3 l
+爱勒特 32 nr
+爱华 3 nz
+爱华顿 3 ns
+爱卡币 3 n
+爱卫会 6 nt
+爱卫办 3 nr
+爱卿 5 nr
+爱厂如家 4 l
+爱发牢骚 3 i
+爱古斯河 2 ns
+爱可欣 3 nr
+爱吃鬼 3 i
+爱吃鱼 3 i
+爱吸 3 v
+爱哭 3 v
+爱哭鬼 3 i
+爱喝 3 nr
+爱因斯坦 605 nrt
+爱国 6444 ns
+爱国东路 3 nz
+爱国主义 513 nz
+爱国主义者 8 n
+爱国人士 282 n
+爱国侨胞 3 n
+爱国华侨 25 n
+爱国卫士 3 nz
+爱国卫生 3 nz
+爱国同胞 2 n
+爱国奖券 3 n
+爱国如家 3 l
+爱国心 25 nt
+爱国志士 18 nr
+爱国情 3 n
+爱国活动 3 l
+爱国热情 3 n
+爱国爱家 3 nr
+爱国精神 3 nz
+爱国统一战线 46 nz
+爱国者 306 n
+爱国西路 3 nz
+爱国路 3 nz
+爱国运动 3 nz
+爱国阵线 3 nz
+爱多 76 ns
+爱多杯 2 nz
+爱奏 3 n
+爱奥尼 36 nr
+爱女 90 n
+爱女人 3 n
+爱女心切 3 i
+爱奴 3 n
+爱好 810 a
+爱好体育 3 l
+爱好和平 3 nr
+爱好文学 3 nt
+爱好文艺 3 nr
+爱好者 445 n
+爱好音乐 3 n
+爱如己出 3 i
+爱如珍宝 4 nr
+爱妻 61 n
+爱妻子 3 n
+爱妻心切 3 i
+爱妾 69 n
+爱委会 3 nt
+爱子 121 n
+爱子心切 3 i
+爱子教子 3 n
+爱安 2 ns
+爱家 17 n
+爱家乡 3 ns
+爱富嫌贫 3 nr
+爱将 83 n
+爱小 3 nr
+爱小贝 6 nr
+爱尔兰 669 nr
+爱尔兰人 51 nrt
+爱尔兰共 3 nr
+爱尔兰共和军 11 nt
+爱尔兰共和国 13 ns
+爱尔兰岛 22 ns
+爱尔兰语 3 nz
+爱尔兰队 4 nz
+爱尔巴桑 3 nrt
+爱尔特 2 nr
+爱尔福特 3 nrt
+爱尔纳 2 nr
+爱尔维修 3 nrt
+爱屋及乌 28 ns
+爱岗 7 ns
+爱岗敬业 19 nr
+爱巢 5 nr
+爱师 3 n
+爱师心切 3 i
+爱带 3 n
+爱幼 3 n
+爱庇丹 64 nr
+爱建 9 ns
+爱建园 3 nr
+爱弥儿 4 nr
+爱弥尔 5 nr
+爱徒 20 n
+爱徒心切 3 l
+爱得乐 3 nr
+爱得华 3 nr
+爱德 5 nr
+爱德华 140 nr
+爱德华兹 30 ns
+爱德华多 8 ns
+爱德蒙 3 nr
+爱心 646 n
+爱心卡 7 nr
+爱心彩券 3 n
+爱怜 130 a
+爱恋 69 nr
+爱恋着 3 v
+爱恨 3 a
+爱恨交加 3 nz
+爱恨交织 3 nz
+爱恨分明 3 nz
+爱恶分明 3 i
+爱悦 3 a
+爱情 2606 n
+爱情专一 3 l
+爱情价更高 3 i
+爱情史 3 n
+爱情喜剧 3 n
+爱情字典 3 n
+爱情小说 3 l
+爱情故事 3 i
+爱情森林 3 nr
+爱情海 3 nr
+爱情灵药 3 i
+爱情片 3 n
+爱情真 3 nr
+爱情网 3 nz
+爱情观 4 n
+爱情证书 3 n
+爱情诗 3 nr
+爱情路 3 n
+爱情鸟 3 n
+爱惜 253 v
+爱惜人才 3 i
+爱惜羽毛 5 nr
+爱意 45 n
+爱慕 149 nr
+爱慕者 3 nr
+爱慧梅 3 nr
+爱憎 96 a
+爱憎不分 3 i
+爱憎分明 26 i
+爱成仇 2 nr
+爱我吗 3 n
+爱我所爱 3 i
+爱戴 185 nr
+爱才 3 nr
+爱才如命 3 i
+爱才如渴 3 i
+爱才若渴 3 i
+爱抚 75 nr
+爱护 436 v
+爱护你 3 nr
+爱护公物 3 n
+爱护动物 3 n
+爱抽 3 nz
+爱抽烟 3 i
+爱探听 3 nr
+爱教 7 nz
+爱斯基摩 60 nz
+爱新觉罗 76 nrt
+爱日惜力 3 i
+爱是个 3 n
+爱昵 3 a
+爱普泰克 3 nrt
+爱普生 8 nr
+爱权爱势 3 nr
+爱染 3 v
+爱校 3 n
+爱校如家 3 nr
+爱校精神 3 nr
+爱楚卿 2 nr
+爱毛反裘 3 i
+爱民 107 n
+爱民区 3 ns
+爱民如子 13 l
+爱民模范 3 n
+爱沙尼亚 178 ns
+爱沙尼亚人 10 nrt
+爱沙尼亚共和国 5 ns
+爱河 49 ns
+爱波网 3 nz
+爱泼斯坦 7 nr
+爱泽成 2 nr
+爱洛伊 2 nr
+爱涛漪 2 nr
+爱液 3 n
+爱滋 3 nr
+爱滋病 14 n
+爱滋病患 3 n
+爱演 3 n
+爱火 3 n
+爱爱仰 2 nr
+爱爱医 3 nr
+爱爱太 2 nr
+爱爱姑 3 nr
+爱牙日 3 nz
+爱物 3 n
+爱犬 6 nr
+爱猷识 3 nr
+爱玉冰 3 nr
+爱玉冻 3 nr
+爱玛 17 nr
+爱玩 3 n
+爱玩耍 3 v
+爱现 3 v
+爱现鬼 3 n
+爱理不理 34 l
+爱琳娜 4 nr
+爱琴 41 nr
+爱琴海 160 ns
+爱生恨 3 n
+爱生恶死 3 i
+爱生气 3 n
+爱用 3 n
+爱用者 3 n
+爱畜 3 n
+爱登堡 3 nr
+爱相随 3 nr
+爱看 84 v
+爱看不看 3 l
+爱眼日 2 nz
+爱知 6 v
+爱知世 3 nr
+爱知县 11 nr
+爱礼存羊 3 nr
+爱祖国 3 nr
+爱神 48 n
+爱福临 2 nr
+爱称 7 n
+爱窝窝 8 n
+爱立信 141 nr
+爱立信公司 16 nt
+爱立生 4 nr
+爱笑鬼 3 nr
+爱答不理 3 i
+爱管闲事 3 l
+爱素好古 3 nr
+爱红妆 3 nr
+爱网 3 nz
+爱美 137 ns
+爱美丽 3 nr
+爱老慈幼 3 nr
+爱耳日 3 nz
+爱臣知 2 nr
+爱苏普 2 nr
+爱苗 3 n
+爱荷华 13 nz
+爱荷华州 4 ns
+爱莫之助 3 i
+爱莫能助 31 i
+爱莲说 3 n
+爱虫 3 n
+爱语 3 nz
+爱语慰 2 nr
+爱说笑 3 l
+爱财 3 v
+爱财如命 3 i
+爱车 8 n
+爱车人 3 n
+爱车狂 3 i
+爱车迷 3 n
+爱辉 13 nr
+爱辉区 3 ns
+爱辉镇 5 nr
+爱达 5 nz
+爱达荷 3 nr
+爱达荷州 11 ns
+爱远恶近 3 n
+爱迪尔 3 nr
+爱迪生 65 nr
+爱重 3 a
+爱重邦 16 nr
+爱金莲 2 nr
+爱钱如命 3 i
+爱钱鬼 3 nr
+爱错 3 a
+爱闲聊 3 a
+爱闹着玩 3 v
+爱阿华州 3 ns
+爱静 3 a
+爱非斯 2 nr
+爱面子 11 n
+爱顶嘴 3 ns
+爱顾 3 v
+爱马 19 ns
+爱马仕 13 nr
+爱鸟 11 n
+爱鸟周 3 nr
+爱鹤失众 3 i
+爱默森 4 nr
+爱默生 6 nr
+爲 100 zg
+爵 579 n
+爵位 209 n
+爵号 3 n
+爵士 263 n
+爵士乐 46 n
+爵士乐团 3 n
+爵士乐队 12 n
+爵士舞 2 n
+爵士队 3 n
+爵士音乐 3 n
+爵士鼓 2 n
+爵床 2 n
+爵床科 3 n
+爵爷 30 n
+爵王 3 n
+爵禄 27 n
+父 2991 n
+父业 21 n
+父严子孝 3 n
+父严母慈 3 l
+父为子隐 3 i
+父之过 3 l
+父亲 9846 n
+父亲节 9 n
+父代 3 n
+父债子还 3 l
+父兄 155 n
+父党 3 n
+父兼母职 3 l
+父命 3 n
+父命难从 3 n
+父命难违 3 i
+父女 276 n
+父女之情 3 n
+父女俩 3 n
+父女关系 3 n
+父女情 3 n
+父子 1639 n
+父子之情 3 n
+父子俩 3 n
+父子关系 3 n
+父子兵 3 n
+父子天性 3 n
+父子情 3 n
+父子情深 3 n
+父子相传 3 l
+父志 3 n
+父慈子孝 3 l
+父执 3 n
+父执辈 3 n
+父本 15 n
+父权 61 n
+父权制 18 n
+父析子荷 3 n
+父母 5593 n
+父母之命 3 n
+父母之邦 3 n
+父母亲 125 n
+父母双亡 3 l
+父母双全 3 l
+父母官 27 n
+父母心 3 n
+父母恩勤 3 n
+父母辈 6 n
+父爱 41 n
+父王 152 n
+父系 180 n
+父系亲属 3 l
+父系社会 3 n
+父老 179 n
+父老乡亲 56 n
+父老兄弟 27 n
+父职 3 n
+父荫 3 n
+父辈 115 n
+爷 3172 ng
+爷们 136 r
+爷们儿 16 n
+爷俩 8 n
+爷儿 20 n
+爷儿仨 2 n
+爷儿们 17 n
+爷儿俩 74 n
+爷娘 3 n
+爷孙 3 n
+爷爷 2077 n
+爷爷奶奶 3 n
+爷羹娘饭 3 nrt
+爷饭娘羹 3 n
+爸 1670 n
+爸妈 3 n
+爸爸 2456 n
+爸爸妈妈 3 nr
+爹 3182 n
+爹妈 141 n
+爹娘 321 n
+爹爹 2952 n
+爺 20 zg
+爻 85 g
+爻象 3 n
+爻辞 31 n
+爼 2 zg
+爽 630 nr
+爽净 2 a
+爽利 61 nz
+爽口 310 vn
+爽口糖 3 n
+爽呆了 3 i
+爽安康 3 nz
+爽心 3 a
+爽心悦目 3 i
+爽心豁目 3 vn
+爽快 293 a
+爽性 5 nz
+爽朗 164 a
+爽歪歪 3 i
+爽死 3 a
+爽死我了 3 i
+爽气 15 a
+爽滑 3 a
+爽然 7 a
+爽然自失 3 i
+爽然若失 4 i
+爽爽 3 a
+爽爽快快 56 a
+爽爽爽 3 a
+爽目 3 a
+爽直 26 a
+爽约 49 a
+爽肤水 4 nz
+爽脆 16 a
+爽荡 3 a
+爽言 3 nz
+爽身 3 nz
+爽身粉 3 nz
+爾 15 zg
+爿 140 q
+牀 5 zg
+牁 11 zg
+牂 30 zg
+片 6168 q
+片中 104 s
+片云遮顶 3 i
+片仔癀 9 nz
+片价 3 n
+片假名 8 i
+片儿 32 m
+片儿汤 2 nz
+片儿警 3 n
+片儿长 3 n
+片光零羽 3 m
+片冈 3 nz
+片冈聪 2 n
+片刀 2 m
+片刻 2801 m
+片刻之间 3 m
+片刻间 298 m
+片剂 59 n
+片区 17 n
+片名 217 m
+片商 7 n
+片场 11 n
+片基 4 nz
+片头 9 m
+片头曲 3 n
+片子 186 n
+片审 3 n
+片尾 2 m
+片尾曲 3 n
+片层 15 m
+片山 34 n
+片式 32 b
+片接寸附 3 i
+片文只事 3 i
+片断 195 d
+片时 35 b
+片晶 3 n
+片材 4 n
+片段 108 m
+片源 3 n
+片片 75 m
+片状 158 nz
+片状材料 3 n
+片瓦不留 3 i
+片瓦无存 3 i
+片甲 7 b
+片甲不回 15 i
+片甲不存 3 i
+片甲不留 17 i
+片甲不还 3 i
+片甲无存 3 i
+片盘 3 n
+片目 3 n
+片石 8 n
+片种 5 m
+片租 3 n
+片约 5 n
+片纸只字 5 i
+片花 7 n
+片蚀 3 nz
+片言 24 n
+片言一字 3 i
+片言只字 10 i
+片言只语 14 i
+片言折狱 2 i
+片警 4 n
+片词只句 3 i
+片语 3 nz
+片语只辞 3 i
+片语手册 3 n
+片酬 7 n
+片锁 3 n
+片长 137 n
+片长末技 3 n
+片长薄技 3 nz
+片门 3 m
+片面 510 n
+片面之词 3 i
+片面化 3 nz
+片面强调 3 nz
+片面性 68 n
+片面追求 3 i
+片鳞半爪 3 i
+片鳞只甲 3 i
+片鳞残甲 3 i
+片鳞碎甲 3 i
+片麻岩 93 nr
+版 4626 n
+版主 3 n
+版主们 3 n
+版二 3 n
+版刻 7 n
+版务 3 n
+版区 3 n
+版压缩 3 n
+版友 3 n
+版口 3 n
+版图 683 n
+版块 34 n
+版型 3 n
+版式 27 n
+版心 3 n
+版报 3 n
+版本 3743 n
+版本信息 2 n
+版本升级 5 n
+版本号 21 n
+版本学 3 n
+版本控制 3 n
+版权 406 n
+版权保护 2 n
+版权局 6 n
+版权所有 3 n
+版权法 9 n
+版权页 3 n
+版模 3 n
+版次 5 n
+版次说明 3 n
+版画 193 n
+版画家 22 n
+版画集 3 n
+版税 21 n
+版筑 9 n
+版筑饭牛 3 n
+版籍 3 n
+版纳 17 ns
+版聊 3 n
+版补丁 3 n
+版规 3 n
+版设 3 n
+版费 3 n
+版边 3 n
+版间 3 n
+版面 165 n
+版面设计 3 n
+版面费 3 n
+牌 3184 n
+牌九 44 n
+牌价 25 n
+牌位 375 n
+牌匾 43 n
+牌友 7 n
+牌号 42 n
+牌名 7 n
+牌品 3 n
+牌坊 1091 n
+牌坊下 4 n
+牌坊店 2 n
+牌坊店村 6 ns
+牌坊群 2 n
+牌子 734 n
+牌子曲 9 n
+牌局 9 n
+牌技 3 n
+牌板 3 n
+牌桌 7 n
+牌楼 580 n
+牌点 3 n
+牌照 319 n
+牌照税 3 n
+牌照费 3 n
+牌示 3 n
+牌迷 3 n
+牌风 3 n
+牍 96 zg
+牎 28 zg
+牏 5 zg
+牐 6 zg
+牒 276 g
+牖 40 zg
+牖中窥日 3 n
+牘 3 zg
+牙 2746 n
+牙下沉 3 n
+牙中牙 3 ns
+牙买加 197 ns
+牙买加政府 6 nt
+牙乳头 3 n
+牙侵蚀症 3 n
+牙克石 8 n
+牙克石市 6 ns
+牙克西 2 ns
+牙关 134 ns
+牙关紧闭 3 n
+牙具 7 n
+牙内吸收 3 n
+牙内钉 3 n
+牙内陷 3 n
+牙冠 12 n
+牙刷 76 vn
+牙刷套 3 n
+牙刷毛 3 n
+牙医 30 n
+牙医公会 3 nt
+牙医师 3 n
+牙卖加 3 n
+牙印 3 n
+牙发生 3 n
+牙发育 3 n
+牙口 273 n
+牙周 35 n
+牙周创伤 3 n
+牙周变性 3 n
+牙周指数 3 n
+牙周炎 10 n
+牙周病 37 n
+牙周病学 3 n
+牙周组织 3 n
+牙周脓肿 3 n
+牙周膜 3 n
+牙周萎缩 3 n
+牙周袋 3 n
+牙周锉 3 n
+牙哈 2 ns
+牙囊 3 n
+牙垢 8 n
+牙城 5 ns
+牙始基 3 n
+牙婆 3 n
+牙子 30 n
+牙小皮 3 n
+牙尖 3 n
+牙尖斜度 3 n
+牙尖高度 3 n
+牙山 16 ns
+牙床 32 n
+牙式 3 n
+牙弓 3 n
+牙慧 7 n
+牙挺 3 v
+牙排列 3 n
+牙支持 3 n
+牙支持式 3 n
+牙旁囊肿 3 n
+牙本质 3 n
+牙本质瘤 3 n
+牙板 6 n
+牙根 42 ns
+牙根尖孔 3 n
+牙根挺 3 i
+牙根管 3 n
+牙根融合 3 nz
+牙槽基骨 3 n
+牙槽嵴顶 3 z
+牙槽炎 3 n
+牙槽粘膜 3 n
+牙槽脓肿 3 n
+牙槽骨 8 n
+牙模型 3 n
+牙滤泡 3 n
+牙片 3 n
+牙牌 40 n
+牙牙 3 ns
+牙牙学语 3 nz
+牙疳 3 n
+牙疼 3 v
+牙病 19 n
+牙痒痒 3 l
+牙痕舌 3 l
+牙痛 28 n
+牙瘤 3 n
+牙白口清 3 ns
+牙石 3 n
+牙石指数 3 n
+牙碜 6 v
+牙祭 2 n
+牙种植术 3 n
+牙科 46 n
+牙科凿子 3 l
+牙科医生 3 nz
+牙科医院 3 nt
+牙科探针 3 n
+牙科诊所 3 n
+牙移植术 3 n
+牙筷 3 n
+牙签 30 n
+牙签万轴 3 n
+牙签犀轴 3 n
+牙签玉轴 3 n
+牙签盒 3 n
+牙签筒 2 n
+牙签锦轴 3 n
+牙粉 15 n
+牙线 3 n
+牙线夹 3 n
+牙结石 3 n
+牙缝 72 n
+牙缝里 3 n
+牙缸 3 n
+牙胚 3 n
+牙胶尖 3 n
+牙胶锥 3 n
+牙膏 364 n
+牙膏盒 3 n
+牙膏管 3 n
+牙色 3 n
+牙花 3 n
+牙菌斑 3 n
+牙萌出 3 vn
+牙蕾 3 n
+牙虫 3 n
+牙质 3 n
+牙轮 3 n
+牙釉质 5 n
+牙钻 3 n
+牙长轴 3 n
+牙间交错 3 n
+牙间隙 3 n
+牙隐裂 3 i
+牙雕 40 n
+牙面 3 n
+牙音 3 n
+牙颈线 3 n
+牙颈部 3 n
+牙骨质 3 n
+牙骨质棘 3 n
+牙骨质瘤 3 n
+牙髓 22 n
+牙髓充血 3 n
+牙髓化生 3 n
+牙髓变性 3 n
+牙髓坏死 3 n
+牙髓坏疽 3 n
+牙髓失活 3 n
+牙髓息肉 3 n
+牙髓探针 3 n
+牙髓炎 6 n
+牙髓病学 3 n
+牙髓脓肿 3 n
+牙髓腔 3 n
+牙髓钙化 3 n
+牙鲆 2 n
+牙齿 1188 n
+牙齿拥挤 3 i
+牙齿痛 3 n
+牙龈 108 n
+牙龈上皮 3 n
+牙龈刀 3 n
+牙龈囊肿 3 n
+牙龈增生 3 n
+牙龈按摩 3 n
+牙龈炎 9 n
+牙龈点彩 3 n
+牙龈瘤 3 n
+牙龈裂 3 n
+牙龈退缩 3 n
+牚 30 zg
+牛 6339 n
+牛万才 34 nr
+牛丞相 43 nr
+牛之一毛 3 nr
+牛书道 72 nr
+牛乳 42 nr
+牛亚科 5 nr
+牛人 3 n
+牛仔 94 nr
+牛仔布 9 nr
+牛仔服 5 nr
+牛仔服装 3 n
+牛仔衣 3 nr
+牛仔衫 3 nr
+牛仔装 3 n
+牛仔裙 3 nr
+牛仔裤 95 n
+牛仔面料 3 n
+牛仙客 3 nr
+牛作马 12 nr
+牛倌 3 n
+牛僧孺 3 n
+牛儿帮 2 nr
+牛儿苗 6 nr
+牛允鹏 5 nr
+牛兰俊 2 nr
+牛农对泣 3 l
+牛刀 3 n
+牛刀割鸡 3 i
+牛刀小试 8 i
+牛初乳 3 nr
+牛剑锋 3 nr
+牛力 2 n
+牛力尽 2 nr
+牛劲 11 nr
+牛县长 3 nr
+牛口之下 3 i
+牛口峪 2 nr
+牛听弹琴 3 n
+牛启东 33 nr
+牛哇 3 ns
+牛哥哥 2 nr
+牛嘎陪 2 nr
+牛国兴 52 nr
+牛圈 3 n
+牛天德 2 nr
+牛头 93 n
+牛头不对 3 i
+牛头不对马嘴 16 i
+牛头人 3 n
+牛头刨 3 n
+牛头刨床 3 n
+牛头山 278 nr
+牛头怪 3 i
+牛头梗 3 i
+牛头马面 11 n
+牛奶 801 n
+牛奶房 3 nr
+牛奶瓶 3 nr
+牛奶甜酒 3 nr
+牛奶箱 3 n
+牛奶糖 3 nr
+牛子厚 4 nr
+牛宇辉 8 nr
+牛宇闳 2 nr
+牛宝军 3 nr
+牛宰马 17 nr
+牛家 34 n
+牛家屯 2 nr
+牛家庄 75 nr
+牛家村 34 nr
+牛家沟 8 nr
+牛尾 15 n
+牛尾巴 2 nr
+牛尾汤 3 nr
+牛屄 3 t
+牛山岛 2 nr
+牛山湖 2 nr
+牛市 248 n
+牛年 21 t
+牛年马月 2 i
+牛庄区 3 nr
+牛庄设 2 nr
+牛录意 2 nr
+牛录章 10 nr
+牛录额 9 n
+牛得草 3 nr
+牛心 14 n
+牛心山 20 nr
+牛心湾 2 nr
+牛性 4 n
+牛扒 6 nr
+牛拉犁 4 nr
+牛拦军 7 nr
+牛振华 3 nr
+牛排 49 n
+牛排肉 3 n
+牛排餐 3 n
+牛排馆 3 nt
+牛文海 8 nr
+牛斗虎 2 nr
+牛星织女 3 n
+牛有成 2 nr
+牛木马 3 nr
+牛朱特 4 nr
+牛杂 3 a
+牛李党 7 nr
+牛柳 3 nr
+牛栏 27 nr
+牛栏山 3 nr
+牛根生 8 nr
+牛棚 80 n
+牛正乾 7 nr
+牛步 3 n
+牛步化 2 nr
+牛毛 33 nr
+牛毛细雨 3 n
+牛毛雨 3 nr
+牛气 29 n
+牛河梁 14 nr
+牛油 42 n
+牛油果 8 n
+牛津 162 nr
+牛津大学 185 nt
+牛津布 3 nr
+牛津纺 5 nr
+牛津郡 8 nr
+牛海龙 3 nr
+牛清峰 3 nr
+牛溲马勃 3 nz
+牛爱国 507 nr
+牛爱江 44 nr
+牛爱香 129 nr
+牛犇 3 t
+牛犊 65 n
+牛犊子 13 n
+牛玉亮 2 nr
+牛玉儒 3 nr
+牛王庙 3 nr
+牛王笑 2 nr
+牛王闻 5 nr
+牛疫 3 n
+牛疯子 10 nr
+牛痘 10 n
+牛痘苗 3 n
+牛瘟 4 n
+牛皮 256 n
+牛皮带 3 n
+牛皮癣 23 n
+牛皮糖 15 nr
+牛皮纸 26 n
+牛皮菜 3 n
+牛皮鞋 6 nr
+牛相斗 2 nr
+牛磺酸 22 n
+牛神拳 4 nr
+牛童马走 3 nr
+牛筋 300 n
+牛粪 58 n
+牛纹铜 2 nr
+牛羊 51 nr
+牛羊勿践 3 nr
+牛羊或 2 nr
+牛羊来 2 nr
+牛羊猪 2 nr
+牛羊畜 16 n
+牛羊肉 36 nr
+牛羊金 3 nr
+牛羊马 2 nr
+牛羊鱼 2 nr
+牛群 59 nr
+牛耕田 4 nr
+牛耳 24 nr
+牛肉 1183 n
+牛肉丸 3 nr
+牛肉乾 3 nr
+牛肉场 3 n
+牛肉干 14 nr
+牛肉店 3 n
+牛肉排 3 nr
+牛肉汤 3 nr
+牛肉汤面 3 i
+牛肉糕 3 n
+牛肉面 48 n
+牛肉饼 3 n
+牛肚 3 n
+牛肝菌 8 n
+牛股 61 n
+牛胁里 2 nr
+牛背上 3 i
+牛背梁 3 nr
+牛脊肉 3 n
+牛脖子 3 n
+牛脚 3 n
+牛脾气 14 n
+牛腩 3 nr
+牛腩饭 3 vn
+牛腰 3 n
+牛腰肉 3 n
+牛腱 3 n
+牛腹 11 n
+牛腿 12 n
+牛腿琴 6 nr
+牛膝 10 nr
+牛至 3 nr
+牛舌 3 n
+牛舌饼 3 n
+牛舍 3 nr
+牛节 2 n
+牛蒙蒙 3 nr
+牛蒡 5 n
+牛蒡子 3 nz
+牛虻 28 n
+牛蛙 62 n
+牛蝇 3 nr
+牛行 3 n
+牛衣夜哭 3 i
+牛衣对泣 3 i
+牛衣岁月 3 i
+牛衣病卧 3 n
+牛角 102 n
+牛角之歌 3 nr
+牛角书生 3 n
+牛角刀 3 n
+牛角尖 12 n
+牛角挂书 3 n
+牛角杯 2 n
+牛贺洲 11 nr
+牛蹄 5 n
+牛蹄中鱼 3 n
+牛蹄之涔 3 ns
+牛蹄之鱼 3 n
+牛车 399 n
+牛车上 8 n
+牛车水 4 n
+牛轧糖 3 nr
+牛轭 3 n
+牛轭湖 20 n
+牛迹岭 7 nr
+牛邦喜 4 nr
+牛郎 44 nr
+牛郎星 20 nr
+牛郎织女 40 n
+牛酪 3 n
+牛金 6 n
+牛金引 3 nr
+牛金星 841 nr
+牛金牛 2 nr
+牛雨田 2 nr
+牛雨辰 2 nr
+牛鞅 3 nr
+牛鞭 6 nr
+牛顿 600 nr
+牛顿位势 3 n
+牛顿定律 3 n
+牛顿斜率 3 n
+牛顿流体 3 n
+牛饮 3 n
+牛首山 7 nr
+牛马 302 nr
+牛马不如 3 i
+牛马生活 3 i
+牛骥共牢 3 nr
+牛骥同槽 3 nr
+牛骥同皁 3 nr
+牛骥同皂 3 i
+牛高马大 3 ns
+牛鬼 2 nr
+牛鬼蛇神 79 i
+牛魔王 3 nr
+牛鸣马 2 nr
+牛黄 73 nr
+牛黄丸 3 nr
+牛黄狗宝 3 nr
+牛鼎烹鸡 3 i
+牛鼻 2 nr
+牛鼻子 124 nr
+牝 27 n
+牝咮鸣辰 3 n
+牝牛 16 n
+牝牡骊黄 3 nr
+牝马 33 n
+牝鸡 3 n
+牝鸡司旦 3 n
+牝鸡晨鸣 3 vn
+牝鸡牡鸣 3 vn
+牝鹿 3 n
+牞 4 zg
+牟 221 nr
+牟丰京 3 nr
+牟其中 5 nr
+牟利 128 nr
+牟取 75 v
+牟取暴利 46 l
+牟合方 2 nr
+牟子理 2 nr
+牟安世 2 nr
+牟宗三 3 nr
+牟定 3 v
+牟定县 2 nr
+牟尼佛 3 nr
+牟尼合 4 nr
+牟尼堂 13 nr
+牟平 15 nr
+牟平区 2 ns
+牟平县 3 ns
+牟平城 3 nr
+牟建明 3 nr
+牟新生 3 nr
+牟春光 193 nr
+牟晓阳 3 nr
+牟爱牧 4 nr
+牟牧希 6 nr
+牟玄甫 3 nr
+牟田口 2 nr
+牟财 16 v
+牟钟麟 2 nr
+牟雁翎 2 nr
+牠 40 zg
+牡 611 zg
+牡丹 457 ns
+牡丹乡 4 ns
+牡丹亭 52 ns
+牡丹区 3 ns
+牡丹卡 4 ns
+牡丹园 10 ns
+牡丹峰 10 ns
+牡丹江 109 ns
+牡丹江市 31 ns
+牡丹皮 4 n
+牡丹花 52 nz
+牡丹虽好 4 l
+牡康 3 ns
+牡牛 42 n
+牡羊座 3 n
+牡荆 3 n
+牡荆叶 3 ns
+牡蛎 97 n
+牡马 3 ns
+牡鹿 3 n
+牢 1215 a
+牢不可破 22 i
+牢什古子 3 n
+牢固 695 a
+牢固地 3 n
+牢固确立 3 n
+牢头 3 n
+牢头狱霸 3 i
+牢实 3 d
+牢底 3 d
+牢度 13 d
+牢房 311 n
+牢牢 927 d
+牢牢地 3 n
+牢牢记 32 n
+牢狱 88 n
+牢狱之灾 3 i
+牢甲利兵 3 n
+牢稳 3 a
+牢笼 46 n
+牢系 3 n
+牢记 262 n
+牢记于心 3 n
+牢记在心 3 n
+牢门 3 d
+牢靠 71 a
+牢骚 175 n
+牢骚满腹 3 v
+牤 6 zg
+牥 7 zg
+牦 2 n
+牦牛 244 n
+牦牛肉 7 n
+牧 835 n
+牧业 489 n
+牧业区 3 n
+牧业网 3 n
+牧主 7 n
+牧之制 2 nr
+牧于喀 2 nr
+牧于汉 2 nr
+牧人 128 n
+牧养 15 n
+牧刘表 260 nr
+牧区 315 n
+牧博罗 2 nr
+牧发兵 2 nr
+牧司 2 n
+牧地 88 n
+牧场 448 n
+牧场主 11 n
+牧场草坪 3 n
+牧夫座 14 nr
+牧奎村 6 nr
+牧女 10 n
+牧奴 2 n
+牧子 4 n
+牧守治 2 nr
+牧安骥 3 nr
+牧尾良晴 2 nr
+牧工 3 n
+牧工商 2 n
+牧师 281 n
+牧师住宅 3 n
+牧性 2 n
+牧放 9 nr
+牧时铸 2 nr
+牧暇 2 n
+牧月号 3 n
+牧村 4 n
+牧村香 3 nr
+牧歌 48 n
+牧民 338 n
+牧牛 58 n
+牧牛业 3 n
+牧牛区 3 n
+牧犬 2 nr
+牧猎 3 n
+牧猪奴戏 3 n
+牧畜 17 n
+牧礁 3 n
+牧神 6 n
+牧神节 4 n
+牧童 98 n
+牧笛 6 nr
+牧羊 123 n
+牧羊人 21 nr
+牧羊女 2 nr
+牧羊座 3 nr
+牧羊曲 3 nr
+牧羊犬 21 nr
+牧群 5 n
+牧老可 2 nr
+牧者 7 n
+牧草 210 n
+牧草地 2 n
+牧蛇 2 n
+牧袁绍 2 nr
+牧豕听经 3 v
+牧郎 3 nr
+牧野 26 n
+牧野义晴 2 nr
+牧野区 3 n
+牧韩馥 5 nr
+牧额济 2 n
+牧首 19 n
+牧首制 3 nr
+牧首区 2 nr
+牧马 52 n
+牧马中原 3 nr
+牧马人 10 nr
+牧马图 3 nr
+物 8620 zg
+物业 239 n
+物业公司 3 n
+物业税 3 n
+物业管理 3 n
+物业费 11 n
+物主 26 n
+物主代词 3 n
+物事 338 n
+物产 481 n
+物产丰富 3 l
+物以稀为贵 23 l
+物以稀贵 3 l
+物以类聚 26 i
+物以群分 3 l
+物件 395 n
+物价 1064 n
+物价上涨 3 l
+物价员 3 n
+物价局 99 n
+物价工作 3 l
+物价指数 27 l
+物价指数上 2 l
+物价改革 3 l
+物价政策 3 n
+物价检查 3 n
+物价水平 3 n
+物价管制 3 l
+物价管理 3 l
+物价补贴 3 n
+物价表 3 n
+物价部门 3 l
+物价飞涨 3 l
+物伤其类 14 n
+物位计 3 n
+物体 1768 n
+物侯 3 n
+物候 43 n
+物候学 9 n
+物候观测 3 n
+物候谱 3 n
+物像 9 n
+物力 403 n
+物力维艰 3 l
+物勒工名 3 n
+物化 180 n
+物化劳动 41 l
+物华 4 nz
+物华天宝 4 nz
+物各有主 3 l
+物品 1532 n
+物品代码 3 n
+物在人亡 3 i
+物外 3 l
+物宝天华 3 nz
+物尽其用 16 l
+物归原主 32 n
+物归天宝 3 i
+物态 36 n
+物态参量 3 l
+物态方程 3 l
+物性 64 n
+物情 3 n
+物我两忘 3 i
+物换星移 10 i
+物排放 3 l
+物探 24 n
+物故 3 n
+物救必反 3 l
+物料 171 n
+物是人非 24 l
+物景 3 n
+物有所 3 n
+物有所值 20 l
+物权 119 n
+物权法 5 n
+物极则反 3 l
+物极则衰 3 l
+物极将返 3 l
+物极必反 34 l
+物极必返 3 l
+物欲 34 n
+物欲横流 19 i
+物流 610 n
+物流业 14 n
+物流园 3 n
+物流园区 3 n
+物流师 3 n
+物流网 3 n
+物流配送 3 n
+物理 2709 n
+物理介质 2 n
+物理光学 3 n
+物理化学 212 n
+物理反映 3 i
+物理变化 13 l
+物理地址 12 n
+物理天平 3 n
+物理奖 16 n
+物理学 1181 n
+物理学奖 5 n
+物理学家 648 n
+物理学界 17 n
+物理家 3 n
+物理层 19 n
+物理布局 3 n
+物理性能 3 n
+物理性质 142 n
+物理所 10 n
+物理攻击 3 i
+物理教案 3 n
+物理检查 3 n
+物理模式 3 l
+物理现象 3 n
+物理疗法 3 n
+物理盘 3 n
+物理科 3 n
+物理符号系统 2 n
+物理系 107 n
+物理素质 3 n
+物理组 4 n
+物理诊断 2 n
+物理试题 3 n
+物理课 3 n
+物理量 217 n
+物理题 3 n
+物离乡贵 3 i
+物种 511 n
+物种学 3 l
+物种来由 3 l
+物稀为贵 3 l
+物竞天择 24 l
+物管费 3 n
+物类 23 n
+物美 75 nz
+物美价廉 41 l
+物耗 13 n
+物腐虫生 3 n
+物自体 3 n
+物至则反 3 l
+物色 159 n
+物色人才 3 n
+物色人选 3 n
+物色到 3 l
+物议 36 n
+物议沸腾 3 z
+物论 3 n
+物证 78 n
+物语 68 n
+物象 99 n
+物质 8354 n
+物质不灭 3 l
+物质交流 3 n
+物质享受 3 l
+物质利益 3 n
+物质刺激 3 l
+物质力量 3 n
+物质化 9 n
+物质基础 3 n
+物质奖励 3 l
+物质待遇 3 n
+物质性 34 n
+物质总局 3 n
+物质损耗 3 n
+物质文明 192 n
+物质条件 3 n
+物质欲望 3 l
+物质波 3 n
+物质流通 3 n
+物质财富 3 l
+物质量 12 n
+物质鼓励 3 l
+物贸 5 n
+物资 2183 n
+物资交流 3 n
+物资供应 3 l
+物资公司 3 n
+物资局 10 n
+物资总局 3 n
+物资流 2 n
+物资流通 3 n
+物资贸易 3 l
+物资部 10 n
+物超所值 3 i
+物镜 47 n
+物阜民丰 6 l
+物阜民安 3 l
+物阜民康 3 l
+牬 57 zg
+牭 5 zg
+牮 2 g
+牯 77 n
+牯岭 3 n
+牯牛 101 n
+牱 320 zg
+牲 137 n
+牲口 479 n
+牲口棚 17 n
+牲犊 3 n
+牲畜 717 n
+牲畜头数 17 n
+牲礼 3 n
+牲粉 3 n
+牳 19 zg
+牴 100 zg
+牴触 3 vn
+牵 1969 v
+牵一发而 3 i
+牵一发而动全身 18 i
+牵上 3 v
+牵上去 3 v
+牵上来 3 v
+牵下 3 v
+牵下去 3 v
+牵下来 3 v
+牵丝攀藤 3 l
+牵五挂四 3 i
+牵伸 8 v
+牵住 41 v
+牵入 3 v
+牵出 3 v
+牵出去 3 v
+牵出来 3 v
+牵到 3 v
+牵制 523 v
+牵制性 3 n
+牵制行动 3 i
+牵动 248 vn
+牵动人心 3 i
+牵去 3 v
+牵及 3 v
+牵合 3 v
+牵合傅会 3 l
+牵合附会 3 nz
+牵回 3 v
+牵回去 3 i
+牵回来 3 l
+牵头 208 v
+牵好 3 v
+牵完 3 v
+牵带 3 n
+牵开 3 v
+牵引 680 v
+牵引力 28 nz
+牵引发电 3 nz
+牵引器 3 nz
+牵引带 3 n
+牵引床 3 nz
+牵引式 78 nz
+牵引性 2 n
+牵引机 17 n
+牵引电动 3 nz
+牵引绳 3 nz
+牵引车 88 n
+牵引钩 3 nz
+牵引附会 3 nz
+牵张 10 v
+牵强 43 v
+牵强附会 29 nz
+牵强附合 3 i
+牵得 3 v
+牵念 4 v
+牵手 3 v
+牵扯 478 v
+牵扯不清 3 l
+牵拉 39 nz
+牵拉着 3 l
+牵拌 3 v
+牵挂 232 v
+牵挂着 3 l
+牵掣 3 v
+牵来 3 v
+牵正 3 nz
+牵涉 287 v
+牵涉到 3 l
+牵涉痛 3 n
+牵涉面 12 n
+牵牛 68 nz
+牵牛下井 3 i
+牵牛子 3 nz
+牵牛星 4 nz
+牵牛织女 3 n
+牵牛花 15 nz
+牵物引类 3 n
+牵着手 3 v
+牵着鼻子 3 l
+牵系 14 v
+牵索 3 v
+牵累 48 v
+牵累到 3 l
+牵红线 3 nz
+牵线 45 nz
+牵线人 3 n
+牵线搭桥 42 n
+牵绊 12 n
+牵经引礼 3 nz
+牵缚 3 v
+牵缠 27 v
+牵羊担酒 3 n
+牵肠割肚 3 i
+牵肠挂肚 31 i
+牵肠萦心 3 z
+牵萝莫补 3 n
+牵萝补屋 3 n
+牵衣投辖 3 n
+牵衣肘见 3 i
+牵记 3 v
+牵走 3 v
+牵起 3 v
+牵起来 3 v
+牵车 3 n
+牵过 3 v
+牵过去 3 v
+牵过来 3 l
+牵进 3 v
+牵进去 3 v
+牵进来 3 v
+牵连 394 v
+牵连到 3 l
+牵连运动 3 nz
+牵连速度 3 n
+牵须 3 v
+牵鬼上剑 3 i
+牸 59 zg
+特 7898 d
+特丁基 8 nr
+特为 96 d
+特丽丝 5 nr
+特丽洁 2 nr
+特丽珑 3 nr
+特丽龙 2 nr
+特事 14 n
+特于 3 d
+特亦然 16 nr
+特产 2328 n
+特产品 20 n
+特产店 3 n
+特产税 7 n
+特令 3 n
+特以 3 d
+特价 81 n
+特价书 3 n
+特价品 3 n
+特价机票 3 n
+特价网 3 n
+特任 3 n
+特任官 3 n
+特伍德 3 nr
+特优 3 b
+特优奖 3 n
+特伦 8 nrt
+特伦斯 3 nr
+特伦特 4 nr
+特伦顿 4 nr
+特体 3 n
+特作 3 n
+特佩特 3 nr
+特佳 3 z
+特使 213 n
+特使团 5 n
+特例 60 n
+特供 3 v
+特克 33 nrt
+特克人 2 nrt
+特克国 2 ns
+特克尔 2 nr
+特克斯 56 nr
+特克斯县 2 nrt
+特克斯河 16 nrt
+特免 3 d
+特兰城 8 nr
+特兰宫 4 nr
+特兰德 2 nr
+特兰斯 2 nr
+特兰斯梅塔 2 nrt
+特兰湖 2 nr
+特兰西 13 nr
+特典 3 b
+特内 2 nrt
+特内里弗 3 nrt
+特内里费岛 5 nrt
+特写 102 n
+特写镜头 3 n
+特准 3 n
+特出 45 a
+特刊 38 n
+特列库 2 nr
+特列斯 3 nrt
+特列洛 3 nr
+特利 5 n
+特利亚 10 ns
+特利尔 3 nr
+特利尼 13 nr
+特利布 3 nr
+特利萨 3 nr
+特别 19119 d
+特别之处 3 i
+特别公积 3 n
+特别区 20 n
+特别喜爱 3 nr
+特别奖 67 nz
+特别客串 3 n
+特别座 3 n
+特别强调 3 n
+特别快车 3 n
+特别感谢 3 i
+特别报道 3 n
+特别是在 3 l
+特别法 11 n
+特别法庭 3 n
+特别注意 3 i
+特别版 3 n
+特别税 4 n
+特别篇 3 n
+特别节目 3 n
+特制 243 n
+特制品 3 n
+特制订 3 v
+特力 43 n
+特力屋 3 n
+特加特 4 nr
+特务 1191 n
+特务组织 3 nt
+特务连 7 n
+特务间谍 3 n
+特劳斯 4 nrt
+特勒 10 nrt
+特勒克 16 nr
+特勒基 3 nr
+特勒姆 9 nr
+特勒斯 8 nr
+特勒根 3 nr
+特勤 43 n
+特勤团 17 n
+特勤旅 4 j
+特勤队 41 n
+特化 3 n
+特化成 5 nr
+特区 946 n
+特区建设 3 n
+特区报 3 n
+特区政府 3 nt
+特卖 6 v
+特卖会 3 n
+特卖品 3 n
+特卖场 3 n
+特卡蒙 5 nr
+特发 13 d
+特发性 23 n
+特变 21 n
+特古米亚 3 nrt
+特古西加尔巴 10 nrt
+特号 7 n
+特向 3 d
+特吕弗 2 nr
+特吕德 2 nr
+特告 3 n
+特命 130 n
+特哈旗 2 nr
+特困 227 a
+特困乡 3 n
+特困县 3 n
+特困户 42 n
+特困村 8 n
+特困生 38 n
+特在 3 d
+特地 565 n
+特地到 3 l
+特地去 3 l
+特地回 3 nr
+特地来 3 d
+特型 5 b
+特塞德 2 nr
+特夏赫 2 nr
+特多 46 d
+特大 326 a
+特大事故 3 n
+特大号 12 n
+特大型 68 b
+特大城市 3 ns
+特大奖 3 nz
+特大新闻 3 nr
+特大案件 3 n
+特奈斯 8 nr
+特奖 3 n
+特奥会 3 nr
+特奥尔 2 nrt
+特奥蒂 4 nrt
+特好 3 d
+特姆 4 nrt
+特姆尔 2 nr
+特委 358 n
+特委会 75 j
+特孤峰 2 nr
+特官 3 n
+特定 2066 d
+特定人物 3 n
+特定场合 3 n
+特定条件 3 n
+特定物 3 n
+特富龙 3 nr
+特对 3 d
+特寻芳 3 nr
+特将 3 d
+特尔 10 nrt
+特尔克 3 nrt
+特尔古 3 nr
+特尔夫 2 nrt
+特尔恩 2 nr
+特尔斯 57 nrt
+特尔福德 2 nrt
+特尔科 3 nrt
+特尔纳 3 nrt
+特尼 3 nrt
+特尼尔 13 nr
+特尼河 2 nr
+特尼特 3 nrt
+特尼芬 2 nr
+特展 6 vn
+特工 145 n
+特工门 3 n
+特工队 3 n
+特差 3 n
+特已 3 d
+特希尔 5 nr
+特帕夏 2 nr
+特库蒂 2 nr
+特异 244 a
+特异功能 45 b
+特异性 230 n
+特异说 3 l
+特异质 3 n
+特弥斯 3 nr
+特强 3 nr
+特征 5767 n
+特征值 45 n
+特征函数 13 n
+特征分析 6 n
+特征参数 3 n
+特征向量 3 n
+特征性 45 n
+特征描述 3 n
+特征提取 3 nr
+特征方程 10 n
+特征曲面 3 n
+特征词 3 n
+特征选择 2 nr
+特征频率 3 n
+特律昂 2 nr
+特律翁 3 nr
+特微渺 4 nr
+特德 12 nrt
+特德尔 7 nr
+特德斯 2 nr
+特快 46 d
+特快专递 19 l
+特快号 3 n
+特快车 5 n
+特快邮递 3 nt
+特怀特 4 nr
+特急 9 a
+特急件 3 n
+特性 1946 n
+特性阻抗 2 n
+特怪 3 d
+特惠 35 nr
+特惠价 3 n
+特惠关税 2 n
+特惠国 3 nr
+特意 786 d
+特战超 3 nr
+特批 38 d
+特技 284 n
+特技团 3 n
+特技师 3 n
+特技表演 3 n
+特技飞行 3 n
+特护 9 v
+特报 3 n
+特拉 91 nrt
+特拉克 14 nrt
+特拉华 10 nr
+特拉华州 16 ns
+特拉华河 6 ns
+特拉卡 3 nrt
+特拉夫 2 nrt
+特拉奇 3 nr
+特拉奥雷 5 nrt
+特拉姆 2 nrt
+特拉尔 7 nrt
+特拉布宗 2 nrt
+特拉弗斯 3 nrt
+特拉斯 67 nrt
+特拉普 5 nrt
+特拉法 4 nr
+特拉法加 5 nrt
+特拉波 3 nr
+特拉特 3 nrt
+特拉福德 31 nrt
+特拉纳 3 nrt
+特拉维夫 58 nrt
+特拉西 6 nrt
+特拉西梅诺湖 4 ns
+特拉赫 21 nr
+特招 11 n
+特指 60 n
+特提斯 13 nr
+特搜部 3 nr
+特摩斯 15 nr
+特支 3 n
+特支费 2 n
+特攻队 3 n
+特政制 32 n
+特效 68 a
+特效代码 3 n
+特效字 3 n
+特效药 31 n
+特效葯 3 v
+特教 23 n
+特教组 3 n
+特文格 4 nr
+特文特 3 nr
+特斯 19 nrt
+特斯拉 31 nrt
+特斯河 3 nr
+特斯洛 2 nr
+特斯科 3 nrt
+特早 3 d
+特明体 3 n
+特曲 7 n
+特曼 11 nrt
+特曼亲 2 nr
+特有 1487 b
+特有种 71 n
+特服 2 n
+特服号 3 n
+特朗普 14 nr
+特权 1205 n
+特权分子 3 n
+特权思想 3 n
+特权车 3 n
+特权阶层 3 n
+特权阶级 3 n
+特来 3 d
+特林 4 n
+特林克 4 nr
+特林堡 9 nr
+特柳斯 2 nr
+特根斯 4 nr
+特格斯 6 nr
+特案 3 n
+特案处理 3 n
+特此 246 d
+特此函复 3 l
+特此证明 3 l
+特此说明 3 l
+特此通知 3 l
+特殊 7015 a
+特殊人群 3 n
+特殊任务 3 n
+特殊份子 3 n
+特殊作用 3 n
+特殊使命 3 n
+特殊化 26 n
+特殊字符 17 n
+特殊性 205 n
+特殊技 3 n
+特殊政策 3 n
+特殊效果 3 n
+特殊教育 302 l
+特殊气味 3 n
+特殊津贴 3 n
+特殊照顾 3 n
+特殊用地 3 n
+特殊符号 3 n
+特殊系 3 n
+特殊网论 3 n
+特殊要求 3 n
+特殊迁移 3 n
+特殊钢 21 n
+特殊音 3 n
+特氟龙 3 nz
+特沃思 6 nr
+特沃杰雷 3 nr
+特沛彝 2 nr
+特法伦 3 nr
+特洛 2 nrt
+特洛伊 85 nrt
+特洛伊木马 7 nrt
+特洛依 2 nr
+特洛克 4 nrt
+特洛夫 30 nr
+特洛姆 5 nrt
+特洛娃 3 nr
+特洛尔 4 nr
+特洛甫 13 nr
+特派 195 n
+特派办 3 n
+特派员 277 n
+特派团 3 n
+特派记者 3 n
+特海润 2 nr
+特海默 3 nr
+特混 16 b
+特混舰队 30 nz
+特灵 8 n
+特点 9047 n
+特烈大帝 13 nrt
+特烈斯 2 nrt
+特烦 3 a
+特爽 3 a
+特琳娜 3 nr
+特瑞尔 2 nr
+特瑞维 10 nr
+特瑟斯 3 nrt
+特瓦尔 4 nr
+特瓦族 2 nr
+特由 3 a
+特电 3 n
+特瘦 3 a
+特百惠 3 nr
+特码王 3 n
+特码诗 3 n
+特福郡 2 nr
+特福镇 2 nr
+特种 1356 n
+特种兵 74 n
+特种工艺 3 n
+特种橡胶 3 n
+特种水泥 3 n
+特种泵 3 n
+特种玻璃 3 l
+特种纸 3 n
+特种行业 3 n
+特种设备 3 n
+特种车 4 n
+特种邮票 3 n
+特种部队 477 n
+特科 64 n
+特科夫 4 nr
+特科雷 2 nr
+特称 3 n
+特稿 23 n
+特稿部 3 n
+特穆尔 21 nr
+特立 3 b
+特立尼达 54 nr
+特立尼达和多巴哥 5 ns
+特立尼达岛 32 ns
+特立御 2 nr
+特立独行 49 nr
+特立邮 3 nr
+特等 162 b
+特等功 11 n
+特等奖 72 n
+特等病房 3 n
+特等舱 3 n
+特米 4 nrt
+特米尔 2 nrt
+特索 3 n
+特约 365 d
+特约医生 3 n
+特约医院 3 nt
+特约商店 3 nt
+特约服务 3 n
+特约稿 3 n
+特约经销 3 n
+特约记者 3 n
+特约诊所 3 n
+特级 517 b
+特级上将 3 n
+特级品 3 n
+特级教师 3 n
+特纳 44 nrt
+特纳普 3 nr
+特纳氏 2 nr
+特纳牙 3 nr
+特纳雄 4 nr
+特纽斯 2 nr
+特维克 3 nrt
+特维尔 14 nr
+特维斯 12 nr
+特罗 8 nrt
+特罗伊 2 nrt
+特罗夫 2 nr
+特罗姆 8 nrt
+特罗姆瑟 2 nrt
+特罗容 2 nr
+特罗尔 3 nr
+特罗斯 17 nr
+特罗素 2 nr
+特考 2 v
+特聘 31 nr
+特腊山 2 nr
+特色 8092 n
+特色产业 3 n
+特色化 5 n
+特色学校 3 n
+特色小吃 3 n
+特色店 3 n
+特色旅游 3 n
+特色牌 3 n
+特色美食 3 n
+特色菜 7 n
+特艾萨 6 nr
+特艾达 2 nr
+特茹河 7 nr
+特药 3 n
+特莫尔 3 nrt
+特莱尔 2 nr
+特莱尼 3 nr
+特莱斯 3 nr
+特莱杰 4 nr
+特莱特 7 nr
+特菲尔 10 nr
+特蒙特 3 nr
+特蕾西 5 nr
+特蕾西亚 20 nr
+特藏 8 n
+特西斯 3 nr
+特要 3 b
+特解 3 v
+特言道 2 n
+特警 19 n
+特警组 3 n
+特警队 3 n
+特订 3 v
+特训 3 n
+特训班 6 n
+特训营 7 nr
+特许 197 d
+特许加盟 3 n
+特许权 20 nr
+特许状 3 n
+特许者 2 n
+特许证 4 nr
+特许费 2 n
+特设 73 n
+特诺奇 19 nr
+特豪斯 2 nr
+特质 189 n
+特质焦虑 3 n
+特赐 3 n
+特赦 298 v
+特赦令 9 n
+特赦权 2 n
+特超音速 3 nr
+特辑 24 n
+特迪贝尔 2 nrt
+特选 3 b
+特逗 3 nr
+特造 3 b
+特道夫 2 nr
+特遣 44 b
+特遣舰队 3 vn
+特遣部队 46 n
+特遣队 36 n
+特邀 123 nr
+特邀主持 3 nr
+特邀代表 3 nr
+特邀嘉宾 3 nr
+特邀顾问 3 nr
+特酷 3 a
+特里 138 nrt
+特里亚 19 nrt
+特里凡 3 nrt
+特里奥 18 nrt
+特里娜 9 nrt
+特里尔 20 nrt
+特里斯 2 nrt
+特里斯坦 14 nrt
+特里普 2 nrt
+特里格 2 nrt
+特里波 4 nr
+特里舒尔 3 nr
+特里萨 4 nrt
+特里谢 8 nrt
+特里飞 2 nr
+特重 27 a
+特钢 11 n
+特长 480 n
+特长班 12 nr
+特长生 162 nr
+特陆子 2 n
+特隆布墙 3 nr
+特隆赫姆 8 nrt
+特集 3 n
+特雷斯 4 nr
+特雷泽 2 nr
+特雷纳 2 nr
+特雷维 30 nr
+特雷维索 22 nrt
+特雷莎 7 nrt
+特需 18 n
+特需品 3 n
+特韦雷 2 nr
+特项经费 3 n
+特餐 3 n
+特首 16 n
+特马 36 n
+特高 129 a
+特高压 3 n
+特高特 36 nr
+特高频 6 b
+特鲁伊 2 nr
+特鲁克 8 nr
+特鲁多 2 nrt
+特鲁奇 2 nr
+特鲁姆 2 nr
+特鲁威 6 nr
+特鲁希略 16 nr
+特鲁斯 5 nr
+特鲁瓦 5 nr
+特鲁维 4 nr
+特鲁莱 3 nr
+特鲁西 3 nr
+特鲁西埃 203 ns
+特默思 2 nrt
+牺 37 v
+牺牲 2298 v
+牺牲剂 3 n
+牺牲品 118 n
+牺牲生命 3 n
+牺牲者 44 n
+牺盟 2 v
+牺羊 3 v
+牻 18 zg
+牾 10 vg
+犀 133 n
+犀中望月 3 i
+犀利 166 a
+犀浦镇 3 v
+犀燃烛照 3 vn
+犀牛 159 n
+犀牛望月 4 i
+犀牛皮 3 n
+犀牛角 3 n
+犀甲 3 n
+犀甲利兵 3 n
+犀角 52 n
+犀角烛怪 3 i
+犀谷 3 n
+犀顶龟文 3 n
+犀颅玉颊 3 n
+犀鸟 40 n
+犁 518 n
+犁刀 3 n
+犁土 3 n
+犁地 39 n
+犁头 290 n
+犁市镇 3 n
+犁庭扫穴 4 i
+犁庭扫闾 3 n
+犁式 11 n
+犁杖 23 n
+犁板 3 n
+犁柄 3 n
+犁沟 20 n
+犁牛 2 nz
+犁牛之子 3 i
+犁牛骍角 3 v
+犁生骍角 3 v
+犁田 9 nz
+犁耕 11 v
+犁耙 3 n
+犁铧 24 n
+犁锄 3 n
+犁镜 3 nz
+犄 3 n
+犄角 76 n
+犄角之势 3 n
+犊 116 ng
+犊子 13 n
+犊牛 6 n
+犊牛舍 3 n
+犊牧采薪 3 n
+犊车 3 n
+犊鼻 3 n
+犊鼻褌 3 n
+犋 9 q
+犍 105 zg
+犍为 33 ns
+犍为县 5 ns
+犍牛 13 ns
+犎 2 zg
+犏 11 x
+犒 99 v
+犒军 3 n
+犒劳 63 v
+犒赏 60 v
+犒赏三军 3 n
+犒赏法 3 n
+犛 2 zg
+犛牛 3 vn
+犟 95 a
+犟劲 4 v
+犟嘴 14 v
+犟脾气 9 v
+犨 3 zg
+犫 11 zg
+犬 597 ng
+犬不夜吠 3 i
+犬儒 6 n
+犬儒主义 3 n
+犬儒学派 3 n
+犬儒政策 3 n
+犬兔俱毙 3 i
+犬吠 45 n
+犬吠之盗 3 i
+犬夜叉 3 n
+犬子 32 n
+犬戎 3 n
+犬牙 15 n
+犬牙交错 19 i
+犬牙盘石 3 n
+犬牙相制 3 i
+犬牙相错 3 i
+犬牙鹰爪 3 n
+犬瘟热 3 n
+犬科 16 n
+犬迹狐踪 3 i
+犬马 27 n
+犬马之养 3 i
+犬马之决 3 i
+犬马之力 3 i
+犬马之劳 44 i
+犬马之命 3 i
+犬马之年 3 i
+犬马之恋 3 n
+犬马之报 3 i
+犬马之疾 3 i
+犬马之诚 3 n
+犬马恋主 3 i
+犬马盘石 3 n
+犬马齿穷 3 i
+犬马齿索 3 i
+犬齿 74 n
+犭 6 zg
+犮 40 zg
+犯 3742 v
+犯上 78 v
+犯上作乱 84 l
+犯下 139 v
+犯不上 35 l
+犯不着 113 l
+犯了罪 3 i
+犯了错 3 i
+犯了难 3 l
+犯事 23 n
+犯事儿 3 n
+犯人 1760 n
+犯傻 15 v
+犯台 3 n
+犯嘀咕 46 l
+犯嘴 3 v
+犯困 34 v
+犯土 3 n
+犯境 16 n
+犯得上 5 l
+犯得着 15 v
+犯忌 36 n
+犯急 3 vn
+犯愁 74 v
+犯意 3 v
+犯憷 3 v
+犯戒 17 vn
+犯有 55 v
+犯有罪行 3 n
+犯案 27 n
+犯法 169 vn
+犯法者 7 n
+犯浑 3 n
+犯渎 3 v
+犯潮 3 n
+犯界 3 n
+犯疑 22 v
+犯病 60 n
+犯禁 36 vn
+犯科 3 n
+犯纪 3 n
+犯罪 3002 vn
+犯罪事实 3 n
+犯罪人 61 n
+犯罪人格 3 n
+犯罪分子 213 n
+犯罪团伙 3 n
+犯罪地理 3 n
+犯罪学 36 n
+犯罪心理 3 n
+犯罪感 6 n
+犯罪构成 3 n
+犯罪案 2 n
+犯罪案件 3 n
+犯罪活动 3 l
+犯罪率 58 n
+犯罪现场 3 n
+犯罪理论 3 n
+犯罪者 28 n
+犯罪行为 3 n
+犯罪集团 3 n
+犯罪预测 3 l
+犯罪预防 3 n
+犯而不校 3 l
+犯而勿校 3 l
+犯节气 3 n
+犯规 604 vn
+犯规者 2 n
+犯言直谏 3 i
+犯讳 3 vn
+犯贱 9 n
+犯错 66 v
+犯错误 3 n
+犯难 44 n
+犯颜 2 n
+犯颜极谏 3 l
+犯颜直谏 16 i
+犯颜苦谏 3 i
+犰狳 12 n
+犱 629 zg
+犲 839 zg
+犳 837 zg
+犴 16 x
+犵 371 zg
+状 6316 ng
+状元 1046 n
+状元坊 3 n
+状元秀 3 n
+状元红 10 n
+状元郎 12 n
+状况 5444 n
+状况不佳 3 n
+状况码 3 n
+状况良好 3 n
+状告 46 n
+状头 3 n
+状子 80 n
+状态 7715 n
+状态值 3 n
+状态副词 3 n
+状态参数 3 n
+状态变量 3 n
+状态图 3 n
+状态字 3 n
+状态方程 47 n
+状态机 3 n
+状态栏 3 n
+状态表 3 n
+状态词 3 n
+状物 97 n
+状物质 3 n
+状纸 8 n
+状胶 3 n
+状胶物质 3 n
+状词 3 n
+状语 40 n
+状貌 23 n
+犷 7 a
+犷悍 7 a
+犹 1389 d
+犹为未晚 3 l
+犹之乎 3 i
+犹他 26 ns
+犹他州 28 ns
+犹可 3 v
+犹大 23 a
+犹太 355 nz
+犹太主义 9 nz
+犹太人 708 nz
+犹太国 14 ns
+犹太复国 3 nz
+犹太妇女 3 nz
+犹太教 165 nz
+犹太教徒 30 n
+犹太民族 3 nz
+犹太裔 3 n
+犹如 1415 v
+犹存 76 v
+犹恐失之 3 i
+犹抱琵琶半遮面 10 l
+犹新 3 nz
+犹有 3 v
+犹有可为 3 i
+犹然 3 a
+犹犹豫豫 30 l
+犹生之年 3 l
+犹疑 103 a
+犹疑不决 3 l
+犹能 3 v
+犹自 3 v
+犹若 3 nz
+犹解倒悬 3 i
+犹豫 1190 a
+犹豫不决 137 i
+犹豫不前 8 i
+犹豫不定 24 l
+犹豫动摇 3 i
+犹豫未决 3 i
+犹豫起来 3 l
+犹鱼得水 3 ns
+犺 363 zg
+犻 128 zg
+犼 6 zg
+狁 54 x
+狂 1757 zg
+狂三诈四 3 i
+狂为乱道 3 i
+狂乱 33 a
+狂人 92 n
+狂人日记 3 n
+狂傲 34 a
+狂升 5 v
+狂叫 3 v
+狂吠 28 n
+狂吠狴犴 3 nr
+狂吹 3 v
+狂吻 3 n
+狂吼 3 v
+狂呼 71 v
+狂啸 18 n
+狂喊 3 v
+狂喜 144 a
+狂噪 3 a
+狂士 3 n
+狂天说地 3 i
+狂奔 300 v
+狂奴故态 3 n
+狂妄 254 a
+狂妄之谈 3 i
+狂妄自大 42 i
+狂嫖滥赌 3 l
+狂客 3 n
+狂徒 39 n
+狂态 3 n
+狂怒 112 v
+狂恋 3 v
+狂恣 3 i
+狂悖 3 v
+狂想 10 n
+狂想曲 37 n
+狂拼 3 v
+狂放 32 v
+狂放不羁 9 i
+狂暴 75 a
+狂暴地 3 i
+狂朋怪友 3 i
+狂朋恠友 3 v
+狂欢 210 v
+狂欢作乐 3 i
+狂欢夜 6 i
+狂欢庆祝 3 n
+狂欢节 75 n
+狂欢起来 3 l
+狂欲 3 n
+狂歌 3 n
+狂歌醉舞 3 i
+狂气 6 n
+狂汉 3 n
+狂泻 3 v
+狂涛 20 n
+狂涛巨浪 3 i
+狂涛骇浪 3 i
+狂涨 10 v
+狂满 3 a
+狂潮 89 n
+狂澜 53 n
+狂灌 3 v
+狂烈 5 a
+狂热 424 a
+狂热性 3 n
+狂热者 3 n
+狂热行为 3 n
+狂燥 3 a
+狂犬 6 n
+狂犬吠日 2 i
+狂犬病 43 n
+狂犬病毒 3 n
+狂猛 3 a
+狂生 23 n
+狂瞽之言 3 v
+狂笑 91 v
+狂笑声 3 i
+狂练 3 a
+狂舞 3 n
+狂花 3 n
+狂草 21 n
+狂蜂浪蝶 2 n
+狂言 73 n
+狂诗 3 n
+狂话 3 n
+狂语 3 n
+狂跌 12 v
+狂跑 3 v
+狂躁 38 a
+狂转 3 v
+狂轰滥炸 33 i
+狂野 19 n
+狂闹 3 a
+狂雨 3 n
+狂风 390 n
+狂风巨浪 3 i
+狂风怒号 3 i
+狂风怒吼 3 i
+狂风恶浪 3 i
+狂风戒指 3 i
+狂风暴雨 75 i
+狂风暴雪 3 i
+狂风骤雨 3 i
+狂飙 66 n
+狂飙运动 2 l
+狂飚 13 v
+狂飚如潮 3 v
+狂饮 20 n
+狃于成见 3 v
+狃儿习俗 3 nr
+狄 422 zg
+狄之俗 2 nr
+狄之君 4 nr
+狄之计 2 nr
+狄之邦 6 nr
+狄云伸 3 nr
+狄云便 3 nr
+狄云先 2 nr
+狄云口 2 nr
+狄云只 5 nr
+狄云右 2 nr
+狄云叹 3 nr
+狄云吃 2 nr
+狄云吓 2 nr
+狄云听 21 nr
+狄云大 11 nr
+狄云奇 7 nr
+狄云奔 2 nr
+狄云左 2 nr
+狄云微微 2 nr
+狄云心 16 nr
+狄云忙 3 nr
+狄云忽 2 nr
+狄云怒 14 nr
+狄云惊 2 nr
+狄云拿 2 nr
+狄云推 2 nr
+狄云摇 3 nr
+狄云料 2 nr
+狄云横 2 nr
+狄云正 5 nr
+狄云甚 3 nr
+狄云疾 2 nr
+狄云笑 2 nr
+狄云练 3 nr
+狄云耳 5 nr
+狄云背 2 nr
+狄云若 2 nr
+狄云见 19 nr
+狄云越 2 nr
+狄云身 5 nr
+狄云转 4 nr
+狄云轻 2 nr
+狄云连 6 nr
+狄交侵 2 nr
+狄仁杰 14 nr
+狄伯支 2 nr
+狄俄尼 19 nr
+狄修应 2 nr
+狄修道 3 nr
+狄克型 2 nr
+狄克提 2 nr
+狄克试验 3 vn
+狄克逊 10 nr
+狄利克 39 nr
+狄利娅 4 nr
+狄剑青 3 nr
+狄厄尼 4 nr
+狄国庆 3 nr
+狄塞尔 10 nr
+狄塞耳机 3 nr
+狄大侠 5 nr
+狄大哥 7 nr
+狄奥倪 2 nr
+狄奥克 48 nr
+狄奥多 5 nr
+狄奥尼 10 nr
+狄奥提 2 nr
+狄奥芳 16 nr
+狄安娜 7 nr
+狄尔斯 10 nr
+狄尔泰 8 nr
+狄师兄 8 nr
+狄德罗 70 nr
+狄德金 8 nr
+狄慈根 10 nr
+狄拉克 78 nr
+狄摩西 2 nr
+狄斯可 3 nr
+狄斯奈 3 nr
+狄斯奈乐 3 nr
+狄斯耐乐 3 nr
+狄无君 2 nr
+狄更斯 40 nr
+狄更生 3 nr
+狄杰斯 4 nr
+狄森先生 2 nr
+狄欧尼 160 nr
+狄波拉 3 nr
+狄波普维拉 2 nrt
+狄浦斯 27 nr
+狄立克 4 nr
+狄纳莫 2 nr
+狄蒙娜 4 nr
+狄道城 4 nr
+狄镖头 2 vn
+狄青夜 2 nr
+狄青降 6 nr
+狅 114 zg
+狈 72 x
+狉狉 3 z
+狉獉 3 z
+狍 77 n
+狍子 54 n
+狎 65 zg
+狎亵 3 v
+狎侮 3 v
+狎妓 25 v
+狎客 3 v
+狎弄 3 v
+狎昵 5 v
+狎玩 3 v
+狎翫 3 v
+狎近 3 v
+狎邪 3 v
+狎雉驯童 3 nz
+狐 542 nr
+狐不二雄 3 i
+狐仙 16 n
+狐假虎威 36 i
+狐假鸱张 3 z
+狐兔之悲 3 i
+狐凭鼠伏 3 i
+狐听之声 3 i
+狐唱枭和 3 z
+狐埋狐扬 3 i
+狐埋狐搰 3 n
+狐奔鼠窜 3 i
+狐媚 34 v
+狐媚猿攀 3 i
+狐媚魇道 3 z
+狐朋狗党 3 i
+狐朋狗友 15 i
+狐步 10 n
+狐死兔泣 3 i
+狐死首丘 3 i
+狐死首兵 3 i
+狐潜鼠伏 3 i
+狐火 3 n
+狐狸 325 n
+狐狸尾巴 16 n
+狐狸狗 3 i
+狐狸皮 12 n
+狐狸精 66 n
+狐猩精 3 n
+狐猴 3 n
+狐疑 169 v
+狐疑不决 3 i
+狐皮 40 n
+狐精 3 n
+狐群狗党 23 i
+狐臊 2 n
+狐臭 9 n
+狐臭味 3 i
+狐藉虎威 3 v
+狐虎之威 3 i
+狐蝠 25 n
+狐裘 11 n
+狐裘羔袖 3 v
+狐裘蒙戎 3 v
+狐裘蒙茸 3 z
+狐闹闹 3 v
+狐骚 3 n
+狐鸣枭噪 3 vn
+狐鸣狗盗 3 i
+狐鸣篝中 3 vn
+狐鸣篝火 3 z
+狐鸣鱼书 3 n
+狐鼠之徒 3 i
+狒 2 n
+狒狒 32 n
+狓 8 zg
+狔 3 zg
+狖 86 zg
+狗 3801 n
+狗不理 14 i
+狗东西 59 nr
+狗书 3 n
+狗仔队 13 n
+狗仗人势 8 n
+狗仗官势 3 i
+狗偷鼠窃 3 i
+狗傍人势 3 i
+狗儿爷 7 nr
+狗党狐朋 3 n
+狗党狐群 3 n
+狗刨 3 n
+狗占马坑 3 n
+狗叫 3 v
+狗叫声 3 n
+狗吃屎 18 n
+狗吠 27 n
+狗吠不惊 3 i
+狗吠之惊 3 i
+狗吠之警 3 l
+狗吠声 3 i
+狗吠非主 3 i
+狗命 3 n
+狗咬吕洞 3 nr
+狗咬吕洞宾 10 i
+狗咬狗 9 i
+狗嘴吐不 3 l
+狗嘴里 3 i
+狗声 3 n
+狗头 80 n
+狗头军师 8 i
+狗头陀 3 n
+狗头鼠脑 3 i
+狗奴才 9 nr
+狗娃 8 n
+狗子 3 n
+狗官 71 n
+狗宝 3 nz
+狗宝宝 3 nr
+狗尾巴 3 n
+狗尾巴草 8 n
+狗尾续貂 2 n
+狗尾草 6 n
+狗尾貂续 3 n
+狗屁 152 n
+狗屁不通 19 l
+狗屎 3 n
+狗屎堆 4 n
+狗屎运 3 n
+狗岛 3 n
+狗崽 3 n
+狗崽子 30 n
+狗崽队 3 n
+狗店 3 n
+狗彘不如 3 v
+狗彘不若 3 z
+狗彘不食 3 v
+狗心狗行 3 i
+狗急跳墙 27 i
+狗恶酒酸 3 n
+狗拉雪橇 3 n
+狗拿耗子 2 n
+狗日 162 n
+狗模狗样 3 i
+狗橇 3 n
+狗洞 25 n
+狗熊 101 n
+狗爬 3 v
+狗爬式 3 l
+狗牌 3 n
+狗牙 10 n
+狗牙草 3 nz
+狗牯脑 2 n
+狗狗 3 n
+狗狗网 3 i
+狗猛酒酸 3 l
+狗獾 9 n
+狗王 12 n
+狗男女 3 l
+狗皮 13 n
+狗皮膏药 8 n
+狗盗鸡啼 3 n
+狗盗鸡鸣 3 i
+狗盗鼠窃 3 n
+狗眼 3 n
+狗眼看人 27 l
+狗窝 17 n
+狗窦 3 n
+狗续侯冠 3 n
+狗续貂尾 3 n
+狗续金貂 3 n
+狗肉 151 n
+狗肉汤 3 nz
+狗肝草 3 n
+狗肺狼心 3 i
+狗胆 3 n
+狗胆包天 9 i
+狗脊 3 n
+狗脚 3 n
+狗腿 3 n
+狗腿子 26 n
+狗苟蝇营 3 vn
+狗蚤 3 n
+狗蛋 3 n
+狗蝇 3 n
+狗蝨 3 v
+狗血 3 n
+狗血喷头 15 i
+狗血淋头 31 i
+狗行狼心 3 i
+狗贩子 2 n
+狗贼 129 n
+狗走狐淫 3 i
+狗辈 3 n
+狗追耗子 3 l
+狗逮老鼠 3 v
+狗颠屁股 3 i
+狗食 3 n
+狗马声色 3 i
+狗鱼 21 n
+狙 17 v
+狙公 3 n
+狙击 176 v
+狙击之狼 3 n
+狙击兵 3 n
+狙击战 5 n
+狙击手 114 n
+狙击枪 3 n
+狙击步枪 3 n
+狙击波 3 n
+狙杀 2 v
+狙诈 3 v
+狝 11 zg
+狞 12 v
+狞恶 10 a
+狞笑 102 v
+狞髯张目 3 nz
+狞鬼 3 v
+狠 1611 d
+狠下 3 d
+狠下功夫 3 v
+狠下心来 3 v
+狠亲切 3 z
+狠刹 3 v
+狠劲 60 a
+狠命 69 d
+狠将 3 d
+狠巴巴 3 z
+狠得 3 d
+狠心 217 d
+狠心肠 3 v
+狠心辣手 3 z
+狠戾 3 a
+狠抓 192 v
+狠抓办案 3 nr
+狠抓落实 3 z
+狠招 3 v
+狠揍 6 v
+狠斗 3 v
+狠毒 246 an
+狠狠 981 d
+狠狠多半 3 d
+狠狠心 20 d
+狠起来 3 v
+狠辣 3 a
+狡 140 a
+狡兔 3 n
+狡兔三穴 3 i
+狡兔三窟 10 i
+狡徒 3 n
+狡滑 2 a
+狡焉思启 3 i
+狡焉思肆 3 i
+狡焉思逞 3 i
+狡狯 91 a
+狡猾 374 a
+狡猾地 3 z
+狡猾性 3 vn
+狡童 3 n
+狡脱 3 a
+狡计 24 v
+狡诈 117 a
+狡谲 3 a
+狡赖 5 a
+狡辩 56 vd
+狡饰 3 n
+狡黠 89 a
+狢 10 zg
+狤 3 zg
+狧穅及米 3 v
+狨 13 zg
+狩 78 n
+狩岳巡方 3 nz
+狩猎 632 n
+狩猎场 18 n
+狩猎法 3 n
+狩猎者 17 n
+狩野 18 n
+独 2859 v
+独一 29 b
+独一无二 207 i
+独个 3 b
+独个儿 85 d
+独享 3 v
+独享其成 3 i
+独人 3 n
+独体 3 n
+独体字 3 l
+独具 657 n
+独具一格 286 l
+独具匠心 34 i
+独具只眼 3 i
+独具慧眼 8 l
+独具特色 368 l
+独出 3 v
+独出己见 3 i
+独出心裁 12 i
+独出新裁 3 i
+独出机杼 3 i
+独创 148 v
+独创一格 3 nz
+独创性 103 n
+独到 221 v
+独到之处 66 l
+独到之见 3 i
+独到见解 3 i
+独力 55 n
+独力经营 3 l
+独力自主 3 i
+独占 185 v
+独占事业 3 n
+独占市场 3 n
+独占性 3 n
+独占权 3 n
+独占鳌头 37 i
+独占鼇头 3 nz
+独吞 40 v
+独唱 109 v
+独唱会 3 n
+独唱曲 9 n
+独善 6 v
+独善一身 3 i
+独善其养 3 i
+独善其身 39 i
+独善吾身 3 i
+独坐 3 v
+独坐愁城 3 i
+独处 87 d
+独大 3 a
+独夫 7 n
+独夫民贼 8 n
+独奏 155 v
+独奏会 3 n
+独奏家 7 n
+独奏曲 40 n
+独奏者 3 n
+独女 3 n
+独女户 3 i
+独子 36 n
+独孤 171 v
+独孤九剑 3 i
+独孤求败 40 i
+独孤红 3 i
+独学寡闻 3 i
+独守 3 v
+独守空闺 3 n
+独家 413 n
+独家代理 3 i
+独家报导 3 n
+独家报道 3 i
+独家新闻 3 i
+独家王朝 3 nr
+独家生产 3 l
+独家经营 3 l
+独尊 184 v
+独居 86 v
+独居石 551 nr
+独山 42 ns
+独山县 11 ns
+独山子 15 n
+独山子区 3 ns
+独岛 75 ns
+独幕 29 v
+独幕剧 34 n
+独异于人 3 i
+独弦哀歌 3 i
+独弦琴 3 n
+独当 3 a
+独当一面 58 i
+独往独来 24 i
+独得 3 v
+独得丰收 3 i
+独得之见 3 i
+独户住宅 3 n
+独担 3 v
+独持异议 3 i
+独挑 3 a
+独挑大梁 3 i
+独掌 3 v
+独掌大权 3 l
+独排众议 3 i
+独揽 86 v
+独揽大权 3 l
+独擅胜场 3 nz
+独断 91 d
+独断专行 41 i
+独断独行 3 i
+独断论 8 i
+独无 3 v
+独是独非 3 i
+独有 444 v
+独有千古 3 i
+独有千秋 3 i
+独有情钟 3 i
+独木 14 n
+独木不成 3 i
+独木不成林 3 l
+独木不林 3 i
+独木桥 97 ns
+独木舟 62 i
+独木船 3 n
+独木赤烈 3 i
+独木难支 9 i
+独木非林 3 ns
+独来独往 56 i
+独栋 3 nr
+独树 8 n
+独树一帜 362 i
+独树一格 3 i
+独桅 3 n
+独桅艇 3 nr
+独此一家 8 l
+独步 44 d
+独步一时 3 i
+独步天下 21 i
+独步当世 3 i
+独步当时 3 i
+独步清流 2 i
+独活 38 vn
+独流 11 n
+独流镇 7 ns
+独清独醒 3 i
+独照 3 v
+独特 3638 a
+独特型 3 b
+独特性 50 b
+独独 49 d
+独生 78 v
+独生女 30 n
+独生子 34 n
+独生子女 175 n
+独生子女户 2 i
+独生子女证 2 n
+独用 3 v
+独白 58 v
+独眼 3 d
+独眼龙 70 nz
+独石 7 n
+独秀 21 a
+独秀一枝 3 i
+独秀峰 4 nr
+独立 9907 v
+独立产额 3 n
+独立偏度 3 i
+独立党 22 n
+独立化 24 i
+独立厅 3 n
+独立团 58 n
+独立国 19 ns
+独立国家 208 l
+独立型 4 b
+独立宣言 3 i
+独立宫 2 nr
+独立师 11 nr
+独立式 9 n
+独立思想 3 i
+独立思考 3 nr
+独立性 301 n
+独立战争 3 nz
+独立报 27 n
+独立本科 3 n
+独立核算 3 l
+独立王国 6 ns
+独立电源 2 n
+独立程序 3 n
+独立精神 3 i
+独立自主 617 i
+独立营 8 nr
+独立行使 3 i
+独立设置 4 i
+独立词 3 i
+独立试验 3 n
+独立运动 3 i
+独竖一帜 3 i
+独粒宝石 3 nz
+独缺 3 v
+独联体 315 j
+独胆英雄 3 i
+独脚 27 v
+独脚戏 12 i
+独脚龙 3 i
+独臂 3 n
+独臂人 3 i
+独臂刀 3 i
+独自 1091 d
+独自一人 3 i
+独自个 20 b
+独舞 51 v
+独苗 12 n
+独茧抽丝 3 i
+独行 76 v
+独行侠 10 nr
+独行其是 8 i
+独行其要 3 l
+独行其道 3 i
+独行独断 3 i
+独行者 3 n
+独行踽踽 3 i
+独裁 588 v
+独裁政权 3 n
+独裁政治 3 n
+独裁统治 3 n
+独裁者 210 n
+独角 27 n
+独角兽 4 n
+独角戏 20 n
+独角龙 3 ns
+独词句 3 i
+独语 6 nz
+独资 189 vn
+独资企业 3 n
+独资经营 3 l
+独走 3 v
+独走江湖 3 ns
+独身 99 v
+独身主义 3 n
+独身汉 3 i
+独身生活 3 i
+独轮 3 n
+独轮手车 3 n
+独轮车 22 n
+独辟蹊径 28 i
+独辫 2 n
+独运匠心 3 i
+独酌 3 v
+独钟 3 n
+独门 98 n
+独门儿 3 l
+独门功夫 3 i
+独门独户 7 i
+独门独院 9 l
+独门绝活 3 i
+独间 3 n
+独院 12 n
+独院儿 3 n
+独霸 83 v
+独霸一方 9 i
+独霸全球 3 n
+独领风骚 36 i
+独食 4 v
+独饮 3 v
+独鹤鸡群 3 i
+独龙 31 nz
+独龙族 34 nz
+独龙江 6 ns
+狭 743 a
+狭义 413 b
+狭义地说 3 i
+狭促 3 a
+狭口 3 a
+狭叶青蒿 3 n
+狭小 415 b
+狭山 3 n
+狭巷 3 n
+狭带 3 n
+狭心症 3 i
+狭涧 3 n
+狭窄 1050 a
+狭缝 24 b
+狭航道 3 n
+狭谷 9 n
+狭路 3 n
+狭路相逢 57 i
+狭路相遇 2 i
+狭长 323 z
+狭长地带 3 n
+狭长的 104 z
+狭陋 3 a
+狭隘 228 a
+狭隘性 5 n
+狭鳕 7 n
+狮 754 n
+狮吼 17 n
+狮城 9 ns
+狮头 11 n
+狮头山 3 ns
+狮头鹅 3 n
+狮威 4 ns
+狮子 1192 n
+狮子会 3 n
+狮子口 3 n
+狮子吼 3 n
+狮子大张口 3 n
+狮子头 25 n
+狮子山 540 ns
+狮子山区 3 ns
+狮子岩 11 n
+狮子座 39 n
+狮子搏兔 4 n
+狮子林 3 n
+狮子狗 3 n
+狮子王 8 n
+狮子舞 15 n
+狮子般 3 l
+狮子鼻 2 n
+狮心王 3 n
+狮梁 3 n
+狮泉 2 n
+狮泉河 20 ns
+狮泉河镇 4 ns
+狮王 14 n
+狮球 4 n
+狮虎兽 3 n
+狮身人面像 29 n
+狮门 3 n
+狮鼻子 3 n
+狯 2 zg
+狰 6 a
+狰狞 197 a
+狰狞面目 7 l
+狱 849 zg
+狱中 437 s
+狱具 3 n
+狱卒 159 n
+狱友 2 n
+狱史 3 n
+狱司 3 n
+狱吏 66 n
+狱囚 3 n
+狱官 3 n
+狱政 5 n
+狱警 4 n
+狱讼 3 n
+狱货非宝 3 n
+狱长 12 n
+狱门 3 n
+狲 117 x
+狴 3 n
+狴犴 9 n
+狷 6 x
+狷介之士 3 v
+狸 75 n
+狸子 82 n
+狸猫 20 n
+狸猫换 3 n
+狸藻 7 n
+狺 11 x
+狺狺狂吠 3 n
+狻 178 x
+狻猊 33 n
+狼 2679 n
+狼前虎后 3 i
+狼号鬼哭 3 i
+狼吃幞头 3 vn
+狼吞 3 n
+狼吞虎咽 66 i
+狼吞虎噬 3 i
+狼吞虎餐 3 i
+狼嗥 49 n
+狼嗥狗叫 3 nr
+狼嗥鬼叫 3 v
+狼嚎 12 n
+狼嚎鬼叫 3 v
+狼图腾 3 i
+狼外婆 3 n
+狼多肉少 3 i
+狼头 23 n
+狼奔兔脱 3 i
+狼奔豕突 3 i
+狼奔鼠偷 3 i
+狼奔鼠窜 3 i
+狼子兽心 3 i
+狼子野心 24 i
+狼孩 13 n
+狼尾草 3 n
+狼山 43 ns
+狼山鸡 6 ns
+狼崽子 7 n
+狼心 3 n
+狼心狗肺 57 i
+狼心狗行 3 i
+狼把草 3 n
+狼来了 3 i
+狼毒 8 n
+狼毫 24 n
+狼毫笔 3 i
+狼烟 24 n
+狼烟四起 6 i
+狼烟大话 3 i
+狼牙山 89 ns
+狼牙棒 3 i
+狼犬 3 n
+狼犺 3 ns
+狼狈 579 an
+狼狈万状 3 i
+狼狈不堪 96 i
+狼狈为奸 27 i
+狼狈周章 3 i
+狼狈相 3 i
+狼狈逃窜 3 i
+狼狗 71 n
+狼猛蜂毒 3 i
+狼獾 36 n
+狼疮 5 n
+狼疮性 2 i
+狼皮 3 n
+狼眼鼠眉 3 i
+狼突豕窜 3 i
+狼突鸱张 3 z
+狼窝 20 n
+狼窝虎穴 3 i
+狼籍 16 n
+狼组 3 n
+狼羊同饲 3 n
+狼羔 3 n
+狼群 225 n
+狼艰狈蹶 3 i
+狼藉 51 a
+狼虫虎豹 3 i
+狼贪 3 n
+狼贪虎视 3 i
+狼贪鼠窃 3 i
+狼顾狐疑 3 i
+狼顾虎视 3 i
+狼顾鸢视 3 vn
+狼顾鸱张 3 z
+狼顾鸱跱 3 z
+狼顾麕惊 3 i
+狼飡虎咽 3 n
+狼飡虎食 3 n
+狼飧虎咽 3 v
+狼餐虎咽 3 i
+狼餐虎噬 3 i
+猁 5 x
+猂 15 zg
+猃 5 g
+猄 2 zg
+猇 280 zg
+猉 5 zg
+猊 10 x
+猎 603 vg
+猎人 324 n
+猎兔犬 3 n
+猎具 2 n
+猎刀 18 n
+猎到 3 v
+猎取 86 v
+猎场 15 n
+猎头 262 n
+猎头公司 155 n
+猎奇 36 n
+猎户 145 n
+猎户座 54 n
+猎户星座 3 n
+猎手 63 n
+猎捕 20 v
+猎杀 36 v
+猎杀者 3 n
+猎枪 129 n
+猎潜艇 31 n
+猎物 291 n
+猎犬 113 n
+猎狐犬 3 n
+猎狗 71 n
+猎狮 3 n
+猎狼者 3 n
+猎猎 3 n
+猎者 4 n
+猎艳 2 v
+猎获 43 v
+猎获物 3 n
+猎装 6 n
+猎豹 100 n
+猎队 3 n
+猎食 3 n
+猎马 3 n
+猎魔 3 n
+猎鸟 3 n
+猎鹰 167 n
+猎鹰杯 2 n
+猎鹿 3 n
+猎鹿人 3 vn
+猓 214 zg
+猕 7 n
+猕猴 112 n
+猕猴桃 141 n
+猖 30 a
+猖狂 143 a
+猖狂进攻 3 v
+猖獗 313 a
+猖獗一时 3 v
+猖獗龋 3 v
+猗 58 e
+猗顿 2 nrt
+猚 7 zg
+猛 3459 d
+猛丁哥 3 ns
+猛不丁 3 d
+猛不防 11 v
+猛兽 177 n
+猛冲 96 v
+猛减 3 v
+猛击 147 v
+猛击一掌 3 n
+猛刺 3 v
+猛力 3 d
+猛力一击 3 n
+猛功 3 a
+猛加 3 d
+猛劲 3 a
+猛劲儿 3 d
+猛勇 3 a
+猛升 3 v
+猛吃 3 a
+猛咬 3 v
+猛回头 3 n
+猛地 1192 d
+猛增 115 v
+猛士 12 n
+猛夺 3 v
+猛子 18 n
+猛将 120 d
+猛将传 3 n
+猛小蛇 3 n
+猛建 3 a
+猛志常在 3 n
+猛扑 243 v
+猛打 73 v
+猛打猛冲 3 v
+猛扭 3 a
+猛抓 3 v
+猛投 3 v
+猛抽 3 nt
+猛拉 3 ns
+猛拍 3 v
+猛挤 3 a
+猛推 3 v
+猛掷 3 v
+猛揍 3 v
+猛摔 3 n
+猛撞 33 v
+猛撞声 3 n
+猛攻 320 v
+猛政 3 n
+猛料 3 n
+猛汉 3 t
+猛洞河 3 ns
+猛涨 42 v
+猛火 3 n
+猛炸 3 v
+猛烈 1069 a
+猛烈地 3 n
+猛烈起来 3 n
+猛然 941 d
+猛然间 97 n
+猛犬 3 n
+猛犸 17 n
+猛犸象 26 n
+猛猛然 3 v
+猛男 3 n
+猛盖 3 v
+猛省 3 ns
+猛禽 271 n
+猛练 3 a
+猛虎 251 n
+猛虎下山 3 ns
+猛虎出山 3 n
+猛虎帮 3 n
+猛虎插翅 3 n
+猛虎深山 3 ns
+猛虎添翼 3 v
+猛袭 3 v
+猛跌 10 v
+猛跳 3 v
+猛载 3 v
+猛进 15 v
+猛追 32 v
+猛酒 3 v
+猛醒 19 a
+猛降 3 v
+猛龙 3 n
+猛龙过江 3 n
+猛龙队 3 n
+猜 2365 v
+猜不着 3 v
+猜不透 3 v
+猜中 79 v
+猜出 3 v
+猜出来 3 vn
+猜到 3 v
+猜嫌 3 v
+猜字谜 3 v
+猜度 43 vn
+猜得 3 v
+猜得出 3 v
+猜得到 3 v
+猜忌 129 v
+猜惧 3 v
+猜想 728 v
+猜想到 3 l
+猜拳 32 v
+猜拳行令 4 l
+猜来猜去 3 z
+猜枚 3 v
+猜枚行令 3 v
+猜法 3 vn
+猜测 844 vn
+猜测出 3 l
+猜测到 3 l
+猜测法 3 l
+猜猜 89 v
+猜猜猜 3 vn
+猜猜看 3 v
+猜疑 265 v
+猜疑地 3 l
+猜疑心 3 l
+猜谜 31 v
+猜谜儿 4 v
+猜谜底 3 v
+猜谜语 3 v
+猜谜题 3 v
+猜起 3 v
+猜起来 3 v
+猜迷手 3 l
+猜透 3 v
+猜透打开 3 l
+猜量 3 vn
+猝 34 i
+猝不及防 142 i
+猝倒 6 d
+猝倒病 5 i
+猝发 5 v
+猝死 64 v
+猝然 66 d
+猞猁 51 n
+猡 3 zg
+猢 10 n
+猢狲 97 n
+猢狲儿 3 l
+猢猴儿 3 n
+猥 44 zg
+猥亵 39 v
+猥亵妇女 3 nz
+猥亵罪 2 vn
+猥亵行为 3 vn
+猥琐 53 an
+猥琐男 3 nr
+猥词 3 v
+猥贱 3 v
+猥辞 3 v
+猩 95 n
+猩猩 108 n
+猩猩草 3 n
+猩红 50 z
+猩红热 22 z
+猩红色 5 n
+猪 3108 n
+猪下水 6 n
+猪丹毒 3 nz
+猪之歌 3 n
+猪产房 3 n
+猪仔 10 n
+猪倌 2 n
+猪儿 3 n
+猪八戒 172 n
+猪八戒照镜子 4 n
+猪公 3 n
+猪卑狗险 3 n
+猪只 9 n
+猪叫 3 n
+猪哥 3 n
+猪嘴 3 n
+猪圈 54 n
+猪场 11 n
+猪大肠 3 n
+猪头 83 n
+猪头皮 3 n
+猪头肉 29 n
+猪如此累 3 l
+猪娃 9 n
+猪婆龙 3 n
+猪尾 3 n
+猪崽 14 n
+猪心 3 n
+猪手 2 n
+猪扒 3 n
+猪排 11 n
+猪朋狗友 6 n
+猪杂 3 nz
+猪栏 15 n
+猪殃殃 2 v
+猪母 3 n
+猪毛 12 n
+猪毛菜 6 n
+猪油 70 n
+猪油果 2 n
+猪洞 3 n
+猪湾 4 n
+猪牙皂 3 n
+猪狗 3 n
+猪狗不如 3 l
+猪猪 3 n
+猪猫 3 n
+猪獾 3 n
+猪瘟 14 n
+猪瘦肉 3 v
+猪皮 14 n
+猪突豨勇 3 v
+猪笼 3 n
+猪笼草 12 n
+猪粪 7 n
+猪繁殖 3 l
+猪繁育 3 n
+猪红 3 n
+猪肉 777 n
+猪肉饼 3 n
+猪肚 18 n
+猪肝 60 n
+猪肝色 3 n
+猪肠 4 n
+猪背脊 3 n
+猪脑 8 n
+猪脑子 3 n
+猪脚 5 n
+猪脚面线 3 n
+猪腰 3 n
+猪舍 2 n
+猪苓 7 n
+猪苗 3 n
+猪草 17 n
+猪血 24 n
+猪蹄 26 n
+猪蹄甲 3 n
+猪蹄膀 3 n
+猪链球菌 3 nz
+猪霍乱 3 n
+猪革 3 n
+猪食 15 n
+猪饲料 3 n
+猪鬃 23 n
+猪鬃草 3 vn
+猪鬓 3 n
+猪鼻 3 n
+猫 1908 n
+猫仔队 3 n
+猫儿 76 n
+猫儿山 18 ns
+猫儿眼 13 n
+猫儿腻 3 n
+猫叫 3 v
+猫叫声 3 n
+猫和老鼠 3 n
+猫咪 2 n
+猫哭老鼠 3 i
+猫哭耗子 7 l
+猫噬鹦鹉 3 nr
+猫头 3 n
+猫头鹰 123 n
+猫子 3 n
+猫扑 3 n
+猫扑网 3 n
+猫步 5 n
+猫熊 4 n
+猫爪 3 n
+猫爪草 2 n
+猫猫 3 n
+猫王 18 n
+猫王迷 3 n
+猫眼 57 n
+猫眼儿 3 n
+猫眼石 17 n
+猫眼草 3 n
+猫眼道钉 3 l
+猫科 25 n
+猫科动物 3 l
+猫精 3 n
+猫耳洞 19 ns
+猫肉 3 n
+猫腰 12 n
+猫腻 67 n
+猫跳河 6 ns
+猫鱼 3 n
+猫鼠同乳 3 n
+猫鼠同处 3 n
+猫鼠同眠 2 i
+猬 120 g
+献 3934 v
+献上 159 v
+献丑 45 v
+献俘 3 v
+献出 230 v
+献县 39 ns
+献可替否 3 n
+献媚 87 v
+献宝 11 nrt
+献帝 345 nrt
+献技 29 n
+献拙 3 v
+献旗 3 ns
+献映 3 v
+献曝之忱 3 nr
+献曲之誉 3 l
+献替可否 3 n
+献歌 3 v
+献殷勤 57 v
+献殿 6 ns
+献演 3 v
+献爱心 3 nrt
+献物 3 n
+献瑞 2 nrt
+献疑 3 v
+献礼 128 v
+献礼片 128 n
+献祭 113 v
+献策 589 v
+献纳 21 nrt
+献给 407 v
+献给党 3 n
+献美 3 ns
+献艺 46 v
+献花 26 v
+献血 164 v
+献血法 4 n
+献血者 11 n
+献血车 3 n
+献言 3 v
+献计 49 v
+献计献策 36 n
+献词 27 v
+献诗 3 v
+献身 294 v
+献身四化 3 l
+献身精神 3 n
+献身者 3 n
+献辞 20 v
+献酒 3 v
+献金 3 nrt
+猱 66 g
+猲 35 zg
+猴 1302 ng
+猴儿 228 n
+猴儿精 2 nz
+猴囡仔 3 ns
+猴头 350 n
+猴头猴脑 3 n
+猴头菇 260 n
+猴头菌 5 n
+猴娃儿 3 n
+猴子 549 n
+猴年马月 10 nz
+猴急 3 n
+猴戏 6 n
+猴拳 17 nz
+猴枣 3 n
+猴狲 3 n
+猴王 215 nz
+猴瘊子 3 v
+猴皮 3 n
+猴皮筋 2 n
+猴皮筋儿 3 l
+猴票 3 n
+猴筋 3 nz
+猴类 3 n
+猴精 3 nz
+猴群 24 n
+猴脑 8 n
+猴面包树 3 n
+猷 35 zg
+猺 8 zg
+猾 17 zg
+猿 559 ng
+猿人 73 n
+猿叶虫 3 n
+猿啸 3 n
+猿啼 3 n
+猿啼鹤唳 3 i
+猿啼鹤怨 3 n
+猿声 2 n
+猿悲鹤怨 3 n
+猿惊鹤怨 3 n
+猿猴 118 n
+猿猴取月 3 n
+猿穴坏山 3 n
+猿类 3 n
+猿臂 3 n
+猿门 3 n
+猿马 3 n
+猿鹤沙虫 3 n
+猿鹤虫沙 3 n
+獁 16 zg
+獂 6 zg
+獃住 3 vn
+獃头獃脑 3 z
+獃子 3 v
+獃气 3 z
+獆 4 zg
+獈 19 zg
+獊 40 zg
+獋 28 zg
+獌 8 zg
+獍 19 zg
+獎 6 zg
+獏 26 zg
+獐 164 n
+獐头鼠目 9 i
+獐子 63 n
+獐麇马鹿 3 v
+獒 53 g
+獓 8 zg
+獕 3 zg
+獗 76 x
+獘 7 zg
+獙 35 zg
+獚 2 zg
+獜 2 zg
+獝 4 zg
+獞 17 zg
+獠 90 n
+獠牙 76 n
+獠面 3 n
+獡 4 zg
+獥 15 zg
+獦 4 zg
+獨 24 zg
+獪 4 zg
+獫 18 zg
+獬 95 x
+獬豸 12 n
+獭 117 g
+獭兔 3 n
+獭皮 3 n
+獭祭 3 n
+獯 51 x
+獰 2 zg
+獴 15 zg
+獾 632 g
+獾油 3 n
+獾猪 2 n
+玁 13 zg
+玄 1220 zg
+玄中寺 5 nr
+玄之又玄 7 nr
+玄乎 21 nr
+玄依样 2 nr
+玄元混 2 nr
+玄元皇帝 2 nr
+玄关 6 ns
+玄冥子 8 nr
+玄冥寒 4 nr
+玄冥神 38 nr
+玄冰碧 9 nr
+玄冷冷 2 nr
+玄功拳 9 nr
+玄功未 2 nr
+玄功竟 2 nr
+玄功通 2 nr
+玄化潜 2 nr
+玄参 26 nr
+玄参科 12 nr
+玄圃积玉 3 nr
+玄大怒 3 nr
+玄大惊 2 nr
+玄天指 3 nr
+玄天洞 2 nr
+玄天部 5 nr
+玄奘 176 nr
+玄奘亦 3 nr
+玄奘大师 2 nr
+玄奘寺 2 nr
+玄奘新 2 nr
+玄奘死 2 nr
+玄奘法师 5 nr
+玄奘自 3 nr
+玄奘西 3 nr
+玄奘译 15 nr
+玄奘闻 2 nr
+玄奥 9 nr
+玄奥晦涩 3 v
+玄妙 82 nr
+玄妙入神 3 nr
+玄妙莫测 3 nr
+玄子大 3 nr
+玄子笑 4 nr
+玄字 4 n
+玄字班 2 nr
+玄孙 36 nr
+玄学 195 n
+玄学家 3 nr
+玄学者 3 nr
+玄宏仁 2 nr
+玄宗一 2 nr
+玄宗令 4 nr
+玄宗倚 2 nr
+玄宗入 3 nr
+玄宗召 9 nr
+玄宗命 2 nr
+玄宗天 3 nr
+玄宗奔 6 nr
+玄宗改 3 nr
+玄宗敕 2 nr
+玄宗时 19 nr
+玄宗朝 3 nr
+玄宗欲 3 nr
+玄宗自 2 nr
+玄宗遂 4 nr
+玄寂续 2 nr
+玄岳门 514 nr
+玄师弟 6 nr
+玄帮主 3 nr
+玄幻书 3 nr
+玄幻情 59 nr
+玄幻类 8 nr
+玄德举 2 nr
+玄德乃 20 nr
+玄德久 3 nr
+玄德之 5 nr
+玄德乘 2 nr
+玄德书 3 nr
+玄德亦 7 nr
+玄德亲 2 nr
+玄德仍 2 nr
+玄德令 6 nr
+玄德依 2 nr
+玄德便 8 nr
+玄德修 2 nr
+玄德先 4 nr
+玄德入 12 nr
+玄德公 5 nr
+玄德兵 5 nr
+玄德具 3 nr
+玄德再 12 nr
+玄德写 2 nr
+玄德军 4 nr
+玄德分 3 nr
+玄德前 3 nr
+玄德力 2 nr
+玄德匹 3 nr
+玄德取 3 nr
+玄德召 4 nr
+玄德叹 6 nr
+玄德合 2 nr
+玄德同 4 nr
+玄德听 4 nr
+玄德告 2 nr
+玄德命 3 nr
+玄德唤 4 nr
+玄德喜 3 nr
+玄德喝 3 nr
+玄德回 4 nr
+玄德备 2 nr
+玄德大 56 nr
+玄德学 2 nr
+玄德安民 2 nr
+玄德寨 5 nr
+玄德屏 2 nr
+玄德差 3 nr
+玄德引 17 nr
+玄德归 3 nr
+玄德当 2 nr
+玄德往 2 nr
+玄德忙 3 nr
+玄德怒 2 nr
+玄德恐 5 nr
+玄德惊 8 nr
+玄德感 2 nr
+玄德打 2 nr
+玄德拜 2 nr
+玄德接 2 nr
+玄德教 7 nr
+玄德方 3 nr
+玄德无 2 nr
+玄德既 2 nr
+玄德早 2 nr
+玄德曰 2 nr
+玄德来 3 nr
+玄德欲 3 nr
+玄德正 8 nr
+玄德求 2 nr
+玄德甚 4 nr
+玄德留 5 nr
+玄德疑 2 nr
+玄德知 3 nr
+玄德离 3 nr
+玄德笑 2 nr
+玄德答 3 nr
+玄德终 2 nr
+玄德背 8 nr
+玄德自 20 nr
+玄德至 2 nr
+玄德若 2 nr
+玄德见 17 nr
+玄德视 7 nr
+玄德请 2 nr
+玄德谓 4 nr
+玄德谢 4 nr
+玄德跃 2 nr
+玄德转 2 nr
+玄德辞 4 nr
+玄德遂 10 nr
+玄德问 20 nr
+玄德闻 26 nr
+玄德随 2 nr
+玄德领 8 nr
+玄德驱 2 nr
+玄心念 2 nr
+玄悲 27 a
+玄悲和尚 3 nr
+玄悲大师 9 nr
+玄想 88 nr
+玄慈大师 4 nr
+玄慈朗 6 nr
+玄教 3 nr
+玄明宫 2 nr
+玄明粉 3 nr
+玄机 161 n
+玄机妙算 3 i
+玄机暗藏 3 nr
+玄武 213 nr
+玄武区 3 nr
+玄武土 3 nr
+玄武岩 233 nr
+玄武峰 2 nr
+玄武巨 2 nr
+玄武殿 2 nr
+玄武池 3 nr
+玄武湖 28 nr
+玄武湖畔 2 ns
+玄武真 2 nr
+玄武石 2 nr
+玄武门 69 nr
+玄水堂 3 nr
+玄洋社 4 nr
+玄澄大师 3 nr
+玄灵宝 4 nr
+玄照经 2 nr
+玄狐 2 nr
+玄理 9 nr
+玄甲军 2 nr
+玄疑 3 nr
+玄痛 24 n
+玄真子 2 nr
+玄真观 4 nr
+玄真道人 2 nr
+玄石 11 nr
+玄秘 3 nr
+玄稽沉 2 nr
+玄素双 4 nr
+玄素学 3 nr
+玄素庄 37 nr
+玄而又玄 3 nr
+玄自广 2 nr
+玄色布 2 nr
+玄色衫 2 nr
+玄苦 30 a
+玄苦大师 13 nr
+玄英洞 10 nr
+玄菟 28 n
+玄虚 66 nr
+玄览堂 4 nr
+玄言解 2 nr
+玄言诗 12 nr
+玄论 3 n
+玄贞怒 2 nr
+玄贞道 14 nr
+玄贞道人 64 nr
+玄辞冷语 3 nr
+玄远 9 nr
+玄远之 2 nr
+玄远旷 2 nr
+玄道人 9 nr
+玄酒瓠脯 3 nr
+玄铁令 45 nr
+玄铁剑 72 nr
+玄铁重 21 nr
+玄镇广 2 nr
+玄门掌 2 nr
+玄门练 3 nr
+玄难叹 2 nr
+玄难大师 7 nr
+玄难微 2 nr
+玄难微微 3 nr
+玄难心 3 nr
+玄青 3 nr
+玄鹤子 6 nr
+玄鹤洞 2 nr
+玄黄翻覆 3 nr
+玆 3 zg
+率 8539 v
+率以为常 3 i
+率众 210 d
+率先 944 d
+率先垂范 21 l
+率兵 3 v
+率兽食人 3 i
+率同 3 d
+率团 3 d
+率团参加 3 l
+率土之滨 3 n
+率土同庆 3 i
+率土宅心 3 i
+率土归心 3 i
+率尔 3 d
+率尔成章 3 i
+率师 3 v
+率性 27 d
+率性任意 3 l
+率意 3 v
+率控制 2 n
+率然 2 d
+率由旧则 3 i
+率由旧章 3 i
+率直 30 d
+率真 20 d
+率而成章 3 i
+率谷 3 v
+率部 3 v
+率队 3 v
+率队参加 3 l
+率领 4373 v
+率马以骥 3 i
+玈 3 zg
+玉 5140 nr
+玉三踅 2 nr
+玉不琢 6 i
+玉业 3 n
+玉为容 2 nr
+玉井 4 nr
+玉京金 2 nr
+玉亭刚 2 nr
+玉亭叔 7 nr
+玉亭哩 2 nr
+玉亭才 2 nr
+玉亭柱 2 nr
+玉亭级 3 nr
+玉人 3 n
+玉人儿 2 nr
+玉人纤 2 n
+玉件儿 6 nr
+玉伦徒 2 nr
+玉体 11 n
+玉体横 3 nr
+玉体横陈 3 nr
+玉体违 2 nr
+玉佛 6 nr
+玉佛寺 3 nr
+玉佩 59 nr
+玉佩琼琚 3 nr
+玉儿妹妹 2 nr
+玉兔 43 nr
+玉兰 229 nr
+玉兰树 29 nr
+玉兰油 3 nz
+玉兰片 9 nz
+玉兰花 23 nr
+玉兰香 4 nr
+玉关人老 3 n
+玉关金 2 nr
+玉兴兵 3 nr
+玉具剑 7 nr
+玉净瓶 2 nr
+玉减香消 3 n
+玉凤凰 4 nr
+玉凤拿 2 nr
+玉凤瞅 2 nr
+玉凤花 2 nr
+玉函山 9 nr
+玉函方 2 nr
+玉刀玉 2 nr
+玉制 3 n
+玉努斯 2 nr
+玉化 4 n
+玉匠 3 n
+玉华宫 2 nr
+玉华州 9 ns
+玉华王 2 nr
+玉华阁 2 nr
+玉卮无当 3 nr
+玉卿嫂 3 nr
+玉厄无当 3 nr
+玉厚哥 5 nr
+玉厚问 2 nr
+玉友金昆 3 nr
+玉台新 5 nr
+玉叶 3 nr
+玉叶溪 8 nr
+玉叶金枝 2 nr
+玉吹箫 7 nr
+玉和尚 2 nr
+玉哀册 3 nr
+玉喜姐 7 nr
+玉喜洗 2 nr
+玉器 655 n
+玉圣宫 2 nr
+玉圭金臬 3 i
+玉坊中 3 nr
+玉块 3 n
+玉垒 9 n
+玉垒山 3 nr
+玉堂人物 3 i
+玉堂富贵 3 nr
+玉堂春 7 nr
+玉堂金马 3 nr
+玉墙 3 n
+玉壁仙 2 nr
+玉壁城 2 nr
+玉壶 25 nr
+玉女 268 n
+玉女峰 3 nr
+玉女心经 207 i
+玉女怀春 3 nr
+玉女明星 3 nr
+玉女派 3 nr
+玉女煎 2 n
+玉如命 2 nr
+玉如意 49 nr
+玉娇枝 3 nr
+玉娇梨 3 nr
+玉娇龙 3 nr
+玉宇 7 nr
+玉宇琼楼 3 nr
+玉宝儿 3 nr
+玉宝钗 2 nr
+玉容 16 n
+玉尺量才 3 n
+玉屏 20 nr
+玉屏侗族自治县 8 ns
+玉屏楼 4 nr
+玉屏箫 2 nr
+玉屏风散 3 i
+玉屑 3 n
+玉山 226 ns
+玉山一 3 nr
+玉山兵 7 nr
+玉山军 6 nr
+玉山北 2 ns
+玉山县 2 ns
+玉山寨 3 nr
+玉山行 2 nr
+玉山闯 2 nr
+玉山闸 3 ns
+玉峰山 6 nr
+玉川 2 ns
+玉川学 2 nr
+玉州区 3 ns
+玉工 4 n
+玉帛 34 nr
+玉帝 181 nr
+玉帝传 7 nr
+玉帝准 2 nr
+玉帝差 2 nr
+玉帝敕 5 nr
+玉帝礼 2 nr
+玉帝见 4 nr
+玉帝赐 2 nr
+玉帝金 3 nr
+玉帝闻 15 nr
+玉带 253 n
+玉带桥 4 nr
+玉带海雕 2 nr
+玉带路 2 n
+玉庆满 5 nr
+玉康级 4 nr
+玉律金科 3 nr
+玉微微 6 nr
+玉德殿 2 nr
+玉怜香 2 nr
+玉性 2 n
+玉恭肃 2 nr
+玉惨花愁 3 i
+玉成 14 nr
+玉成其事 3 i
+玉成其美 3 nz
+玉成美 2 nr
+玉戚 2 n
+玉手 3 n
+玉振金声 3 nr
+玉掌功 4 nr
+玉探春 3 nr
+玉斗骄 2 nr
+玉料 3 n
+玉无道 4 nr
+玉旺昆 5 nr
+玉昆部 2 nr
+玉昆金友 3 nr
+玉昔帖 22 nr
+玉春院 14 nr
+玉材 2 n
+玉杯 57 nz
+玉林 170 nr
+玉林市 12 ns
+玉柄马 3 nr
+玉柱擎天 3 nr
+玉柴 3 n
+玉树 37 nr
+玉树临风 15 nr
+玉树县 16 nr
+玉树州 2 nr
+玉树琼枝 3 nr
+玉树琼花 3 nz
+玉树芝兰 3 ns
+玉树藏族自治州 14 ns
+玉梨魂 2 nr
+玉棺 3 n
+玉棺中 17 nr
+玉楼春 2 nr
+玉楼赴召 3 nr
+玉楼金 2 nr
+玉檀努 2 nr
+玉檀帮 2 nr
+玉檀忙 12 nr
+玉檀惊 2 nr
+玉檀扶 3 nr
+玉檀拿 2 nr
+玉檀正 2 nr
+玉檀端 8 nr
+玉檀笑 12 nr
+玉檀能 2 nr
+玉檀静 2 nr
+玉殒香消 3 nr
+玉毁椟中 3 vn
+玉汝于成 3 nr
+玉河 6 ns
+玉泉 78 nr
+玉泉区 4 ns
+玉泉寺 14 nr
+玉泉山 29 nr
+玉泉营 9 nr
+玉泉路 258 nr
+玉洁冰清 6 nr
+玉洁松贞 3 nr
+玉浆 3 n
+玉浦海 2 ns
+玉海级 2 nr
+玉海集 4 nr
+玉润 3 n
+玉润冰清 3 nr
+玉润珠圆 3 nr
+玉液 18 n
+玉液琼浆 8 nz
+玉液金波 3 n
+玉液金浆 3 n
+玉清元 2 nr
+玉清冰洁 3 nr
+玉清境 2 nr
+玉清昭 2 nr
+玉清池 4 nr
+玉清观 2 nr
+玉渊潭 24 nr
+玉渊潭公园 5 ns
+玉湘云 5 nr
+玉溅珠 2 nr
+玉源 5 n
+玉溪 66 nr
+玉溪市 9 ns
+玉灵散 3 nr
+玉灵道 2 nr
+玉灵道人 26 nr
+玉炉寒 2 nr
+玉照 8 nr
+玉燕投怀 3 nr
+玉燕投环 3 nr
+玉片 3 n
+玉版 12 n
+玉版宣 3 l
+玉版纸 3 n
+玉狮子 2 nr
+玉狻猊 28 nr
+玉玑子 69 nr
+玉玑道 3 nr
+玉玑道人 3 nr
+玉玩器 5 nz
+玉环 56 nr
+玉环县 7 ns
+玉玲珑 3 nr
+玉玺 69 nr
+玉珠峰 35 nr
+玉琢礁 2 nr
+玉琢金 2 nr
+玉璧 42 ns
+玉瓶 14 n
+玉瓶果 2 n
+玉生烟 3 nr
+玉生香 2 nr
+玉田 25 nr
+玉田伯 2 nr
+玉田县 21 ns
+玉田圭 2 nr
+玉田寺 256 nr
+玉皇 50 nr
+玉皇传 2 nr
+玉皇信仰 2 nr
+玉皇剑 256 nr
+玉皇大帝 87 nr
+玉皇山 12 nr
+玉皇庙 5 nr
+玉皇殿 6 nr
+玉皇阁 4 nr
+玉皇顶 8 nr
+玉盘 43 n
+玉真子 125 nr
+玉真散 3 nr
+玉真观 13 nr
+玉真道 2 nr
+玉石 1322 nr
+玉石不分 3 l
+玉石俱摧 3 i
+玉石俱焚 55 i
+玉石俱碎 3 i
+玉石同沉 3 nr
+玉石同碎 3 i
+玉石景天 3 nr
+玉石混淆 3 i
+玉石珠沉 3 nr
+玉石皆碎 3 i
+玉石相揉 3 nr
+玉石眼 3 nr
+玉砌 3 v
+玉碎 9 nz
+玉碎昆 4 nr
+玉碎珠沉 3 nr
+玉碎香残 3 i
+玉碎香消 3 nr
+玉磬子 27 nr
+玉礼器 3 nr
+玉禅师 2 nr
+玉立 27 nr
+玉立之 2 nr
+玉立亭 3 nr
+玉竹 21 nr
+玉笔峰 10 nr
+玉箫中 2 nr
+玉箫剑 37 nr
+玉箫吹 3 nr
+玉箫金琯 3 nr
+玉箫金管 3 nr
+玉簪 67 n
+玉簪记 8 nz
+玉米 1722 nr
+玉米价格 3 n
+玉米地 28 nr
+玉米塘村 3 ns
+玉米棒 259 nr
+玉米棒子 18 nr
+玉米汤 3 nr
+玉米油 5 nz
+玉米浓汤 3 nr
+玉米片 3 nz
+玉米田 3 nr
+玉米秆 2 nr
+玉米种 3 n
+玉米种子 3 n
+玉米秸 4 n
+玉米粉 12 nr
+玉米粒 9 nr
+玉米粥 4 nz
+玉米糊 12 n
+玉米芯 3 nr
+玉米花 7 nr
+玉米花儿 3 nr
+玉米螟 11 n
+玉米象 3 nr
+玉米面 45 n
+玉米须 7 nr
+玉米饼 13 nr
+玉粒桂薪 3 nr
+玉精中 2 nr
+玉素普 2 nr
+玉素甫 3 nr
+玉缘阁 3 nr
+玉置浩二 3 nr
+玉美人 2 nr
+玉翠儿 2 nr
+玉肌 3 n
+玉胎 4 n
+玉腿 3 n
+玉臂 3 n
+玉臂匠 7 nr
+玉良马 2 nr
+玉色 26 n
+玉艺人 2 nr
+玉花 2 n
+玉花骢 39 nr
+玉茗堂 5 nr
+玉茭皮 3 vn
+玉蒲团 3 nr
+玉蕊科 3 nr
+玉虚宫 514 nr
+玉虚散 55 nr
+玉虚洞 39 nr
+玉虚观 6 nr
+玉蛄琼浆 3 nz
+玉蜀黍 8 n
+玉蜂之 3 nr
+玉蜂双 2 nr
+玉蜂右 2 nr
+玉蜂尾 2 nr
+玉蜂惯 2 n
+玉蜂有 2 nr
+玉蜂翅 3 nr
+玉蜂螯 3 nr
+玉蜂赠 2 nr
+玉蜂针 87 nr
+玉蜂闻 6 nr
+玉蜂飞 2 nr
+玉蝶梅 3 nr
+玉蟾 21 nrt
+玉衡 21 nr
+玉衣 8 n
+玉见宝玉 2 nr
+玉观音 3 nr
+玉貌 3 n
+玉貌花 2 nr
+玉貌花容 3 n
+玉质 31 n
+玉质金相 3 n
+玉走金飞 3 i
+玉趾 3 n
+玉轩藏 2 nr
+玉软花柔 3 nr
+玉迟临风 3 nr
+玉速帖 2 nr
+玉里 2 nr
+玉金帛 2 nr
+玉钏儿 41 nr
+玉钏姐姐 2 nr
+玉钗 3 nr
+玉钟子 7 nr
+玉铃卫 2 nr
+玉锋针 2 n
+玉镜展 2 nr
+玉镯 81 n
+玉镯子 8 nz
+玉门 83 n
+玉门关 60 ns
+玉门市 12 ns
+玉门镇 4 ns
+玉阳子 19 nr
+玉阳真人 6 nr
+玉阳镇 2 nr
+玉隆万 2 nr
+玉雕 94 nr
+玉露 10 nr
+玉露生 2 nr
+玉面 3 n
+玉音 486 n
+玉音子 3 nr
+玉顶赤 2 nr
+玉颜娇 2 nr
+玉食 3 n
+玉食锦衣 3 nr
+玉饰 8 n
+玉马 6 ns
+玉骨冰肌 3 n
+玉髓 3 n
+玉麒麟 16 nr
+玉麦 3 nr
+玉齿 3 n
+玉龙 107 nr
+玉龙杯 53 nz
+玉龙雪山 31 ns
+王 19704 nr
+王一亭 2 nr
+王一品 3 nr
+王一惊 3 nr
+王一晤 5 nr
+王一波 5 nr
+王一莉 17 nr
+王一见 2 nr
+王一贴 5 nr
+王一进 3 nr
+王丁棉 5 nr
+王七人 3 nr
+王万仞 65 nr
+王万勿 2 nr
+王三哥 19 nr
+王三槐 2 nr
+王三王 3 nr
+王三运 6 nr
+王上膺 3 nr
+王下令 3 nr
+王不操 16 nr
+王不留行 3 l
+王与潇 6 nr
+王与马 3 nr
+王与高 3 nr
+王丕平 3 nr
+王世充 49 nr
+王世光 7 nr
+王世子 29 nr
+王世才 40 nr
+王世春 3 nr
+王世杰 15 nr
+王世泰 2 nr
+王世襄 4 nr
+王世谱 3 nr
+王世贞 74 nr
+王世隆 3 nr
+王丙乾 24 nr
+王东伐 3 nr
+王东升 3 nr
+王东征 2 nr
+王东明 11 nr
+王东超 3 nr
+王东迁 25 nr
+王两氏 2 nr
+王中书 2 nr
+王中军 12 nr
+王中堂 3 nr
+王中平 2 nr
+王中王 4 nr
+王中秘 5 nr
+王中箭 2 nr
+王临藩 2 nr
+王丹凤 3 nr
+王丹林 2 nr
+王丹蒂 3 nr
+王为义 3 nr
+王为侯 3 nr
+王为君 2 nr
+王为姬 3 nr
+王为帝 8 nr
+王为民 5 nr
+王为治 16 nr
+王丽丽 36 nr
+王丽华 3 nr
+王丽娜 3 nr
+王丽敏 4 nr
+王丽萍 18 nr
+王乃颜 7 nr
+王义仁 29 nr
+王义军 8 nr
+王义夫 9 nr
+王义良 14 nr
+王之世 4 nr
+王之乐 3 nr
+王之争 3 nr
+王之仁 61 nr
+王之光 3 nr
+王之兵 3 nr
+王之制 4 nr
+王之助 2 nr
+王之卓 3 nr
+王之印 3 nr
+王之命 11 nr
+王之善 2 nr
+王之国 2 nr
+王之垣 2 nr
+王之女 2 nr
+王之子 34 nr
+王之孙 2 nr
+王之学 3 nr
+王之师 16 nr
+王之弟 21 nr
+王之心 4 nr
+王之明 4 nr
+王之栋 4 nr
+王之治 18 nr
+王之涣 2 i
+王之燕 2 nr
+王之爵 2 nr
+王之王 5 nr
+王之相 2 nr
+王之胜 2 nr
+王之臣 15 nr
+王之语 2 nr
+王之辞 2 nr
+王之道 3 nr
+王乐恺 2 nr
+王乐泉 6 nr
+王乔治 13 nr
+王乔洞 3 nr
+王九岛 2 nr
+王九思 223 nr
+王九蛋 2 nr
+王也先 3 nr
+王也尊 2 nr
+王习三 2 nr
+王书田 3 nr
+王乾娘 8 nr
+王予以 2 nr
+王事者 2 n
+王二人 7 nr
+王二叔 7 nr
+王二夫人 4 nr
+王二小 3 nr
+王二帅 2 nr
+王二平 10 nr
+王二爷 2 nr
+王二麻子 6 nr
+王于克 16 nr
+王于恶 2 nr
+王于朕 2 nr
+王云五 20 nr
+王云坤 2 nr
+王云浩 7 nr
+王云辉 2 nr
+王云飞 2 nr
+王云龙 256 nr
+王五伯 2 nr
+王五权 26 nr
+王亚东 4 nr
+王亚南 264 nr
+王亚志 4 nr
+王亚斌 2 nr
+王亦君 2 nr
+王亨利 14 nr
+王京烈 4 nr
+王亮亮 4 nr
+王亲国 2 nr
+王亲贵族 3 nr
+王人美 2 nr
+王仁义 2 nr
+王仁便 3 nr
+王仁俊 3 nr
+王仁忠 16 nr
+王仁美 117 nr
+王仁裕 2 nr
+王介儒 28 nr
+王从吾 2 nr
+王从周 42 nr
+王从希 3 nr
+王从道 2 nr
+王仕海 12 nr
+王仕贵 2 nr
+王仕鹏 5 nr
+王令尹 3 nr
+王以哲 10 nr
+王以土 8 nr
+王以铭 256 nr
+王仲丁 2 nr
+王仲强 18 nr
+王仲荦 27 nr
+王仲闻 2 nr
+王任直 53 nr
+王任重 273 nr
+王伊锋 256 nr
+王伐商 6 nr
+王伐崇 2 nr
+王会师 2 nr
+王会悟 15 nr
+王会生 4 nr
+王伟军 3 nr
+王伟林 5 nr
+王伟民 12 nr
+王传一 3 nr
+王传令 2 nr
+王传志 87 nr
+王传旨 2 nr
+王传淞 3 nr
+王传福 2 nr
+王传谕 3 nr
+王伤目 3 n
+王伦笑 2 nr
+王伦遂 2 nr
+王伯奋 19 nrfg
+王伯安 2 nr
+王伯祥 2 nr
+王伯道 2 nr
+王伯龙 3 nr
+王位 732 n
+王位宝座 3 nr
+王位继承 3 nr
+王佐之 11 nr
+王佐之才 3 nr
+王佐书 258 nr
+王佑民 2 vn
+王体乾 22 nr
+王作良 2 nr
+王作荣 256 nr
+王佩玲 10 nr
+王佳琳 4 nr
+王佳芬 5 nr
+王侍中 2 nr
+王侍郎 12 nr
+王侗继 3 nr
+王侧福 4 nr
+王侯 254 nr
+王侯后 3 nr
+王侯将相 3 nr
+王俊武 2 nr
+王俊璞 2 nr
+王俊生 12 nr
+王俊秀 10 nr
+王保保 156 nr
+王保平 3 nr
+王保春 4 nr
+王修植 3 nr
+王修龄 7 nr
+王健林 3 nr
+王健民 29 nr
+王傅府 4 nr
+王储 67 nr
+王催马 2 nr
+王僧辩 27 nr
+王儒信 2 nr
+王兀堂 2 nr
+王允坚 11 nr
+王允大 2 nr
+王允常 3 nr
+王允济 3 nr
+王元如 3 nr
+王元年 14 nr
+王元琰 3 nr
+王元直 5 nr
+王元章 171 nr
+王元英 2 nr
+王元霸 58 nr
+王元顺 2 nr
+王兄弟 3 nr
+王充 77 nr
+王充亦 2 nr
+王兆兰 10 nr
+王兆国 303 nr
+王兆平 2 nr
+王兆明 29 nr
+王兆民 2 nr
+王兆鹏 3 nr
+王兆龄 5 nr
+王先生 37 nr
+王先谦 11 nr
+王光亚 15 nr
+王光兴 18 nr
+王光恩 33 nr
+王光祈 3 nr
+王光美 9 nr
+王光英 22 nr
+王克利 16 nr
+王克勤 2 nr
+王克商 38 nr
+王克安 7 nr
+王克敏 11 nr
+王克殷 3 nr
+王克莱 2 nr
+王入临 3 nr
+王入朝 3 nr
+王全书 3 nr
+王八 494 nr
+王八乌龟 3 nr
+王八羔子 3 n
+王八蛋 3 nr
+王八衰 3 nr
+王公 1578 nr
+王公公 17 nr
+王公大人 2 nr
+王公子 2 nr
+王公贵人 3 nr
+王公贵戚 3 nr
+王公贵族 3 nr
+王兴亚 2 nr
+王兴兵 3 nr
+王兴媳妇 3 nr
+王兴居 2 nr
+王兴志 3 nr
+王兴步 3 nr
+王兵临 2 nr
+王兵败 3 nr
+王典吏 12 nr
+王兼理 5 nr
+王冀耕 4 nr
+王册命 3 nr
+王军华 3 nr
+王军霞 5 nr
+王冠 81 nr
+王冠博 3 nr
+王冬梅 3 nr
+王冬生 256 nr
+王冶秋 129 nr
+王凤兴 12 nr
+王凤卿 4 nr
+王凤姐 5 nr
+王凤恩 4 nr
+王凤池 16 nr
+王凤清 2 nr
+王凯旋 12 nr
+王出宫 2 nr
+王出寨 3 nr
+王刘友 2 nr
+王刘安 10 nr
+王刘建 5 nr
+王刘恒 12 nr
+王刘扬 2 nr
+王刘武 12 nr
+王刘永 2 nr
+王刘渊 3 nr
+王刘焉 3 nr
+王刘肥 5 nr
+王刘胜 14 nr
+王刘襄 2 nr
+王刘谌 2 nr
+王刘贺 5 nr
+王刘越 2 nr
+王刘非 4 nr
+王刘骏 4 nr
+王则尧 2 nr
+王初年 2 nr
+王初立 3 nr
+王利发 2 nr
+王利器 9 nr
+王利明 256 nr
+王利民 3 nr
+王利芬 257 nr
+王到穆 2 nr
+王剑杰 81 nr
+王剑民 2 nr
+王剑英 143 nr
+王副将 9 nr
+王力军 2 nr
+王力劲 7 nr
+王力嘉 2 nr
+王力宏 4 nr
+王加佩 13 nr
+王励勤 39 nr
+王劲哉 2 nr
+王势力 3 nr
+王勃 34 nr
+王勇平 3 nr
+王勇钢 2 nr
+王勒尔 7 nr
+王化澄 2 nr
+王化贞 76 nr
+王十三 3 nr
+王十朋 2 nr
+王千总 4 nr
+王半仙 5 nr
+王华庆 7 nr
+王华碧 3 nr
+王卒武 3 nr
+王卖婆 4 nr
+王南侵 2 nr
+王南庚 2 nr
+王南征 7 nr
+王占元 5 nr
+王占军 3 nr
+王占奎 7 nr
+王卫东 2 nr
+王卫国 2 nr
+王卫朋 2 nr
+王印川 3 nr
+王历纪 2 nr
+王厚德 3 nr
+王厚恩 4 nr
+王原祁 10 nr
+王又天 18 nr
+王又宸 2 nr
+王又惊 3 nr
+王又笑 3 nr
+王又问 2 nr
+王及列 2 nr
+王友贞 2 nr
+王双柏 2 nr
+王双眉 3 nr
+王双礼 2 nr
+王双腿 2 nr
+王发掌 2 nr
+王发清 2 nr
+王叔和 5 nr
+王叔文 22 nr
+王叔英 2 nr
+王叔铭 2 nr
+王口温 2 nr
+王古尸 3 nr
+王召燕 3 nr
+王可儿 15 nr
+王可成 3 nr
+王史叔 2 nr
+王右军 9 nr
+王司令 17 nr
+王司徒 2 nr
+王司马 6 nr
+王司马亮 5 nr
+王司马伦 8 nr
+王司马昱 3 nr
+王司马歆 2 nr
+王司马炎 2 nr
+王司马越 26 nr
+王司马颖 5 nr
+王合丹 4 nr
+王吉元 165 nr
+王吉瑛 2 nr
+王同享 2 nr
+王同军师 4 nr
+王同惠 2 nr
+王后 240 nr
+王后卢前 3 nr
+王君超 2 nr
+王含守 2 nr
+王含笑 2 nr
+王听得 2 nr
+王启人 5 nr
+王启敏 2 nr
+王启民 15 nr
+王吴监 2 nr
+王吴芮 5 nr
+王周士 5 nr
+王命东 3 nr
+王命卫 3 nr
+王命召 3 nr
+王命楚 2 nr
+王命申 2 nr
+王命穆 2 nr
+王命虢 6 nr
+王命询 2 nr
+王和众 2 nr
+王和军师 2 nr
+王和夫人 7 nr
+王和定 2 nr
+王和李 3 nr
+王和汝 2 nr
+王和高 44 nr
+王咏梅 2 nrfg
+王哈丹 3 nr
+王哈哈 3 nr
+王善保 28 nr
+王善谋 2 nr
+王喜回 3 nr
+王喜带 2 nr
+王喜忙 6 nr
+王喜快 2 nr
+王嘉庆 2 nr
+王嘉廉 10 nr
+王嘉胤 38 nr
+王四同 2 nr
+王回王 2 nr
+王国 2631 ns
+王国光 228 nr
+王国光大 2 nr
+王国势力 5 nr
+王国华 4 nr
+王国宁 3 nr
+王国宝 5 nr
+王国峰 2 nr
+王国平 3 nr
+王国建 2 nr
+王国强 9 nr
+王国成 10 nrfg
+王国林 3 nr
+王国栋 37 nr
+王国瑞 3 nr
+王国生 769 nr
+王国福 2 nr
+王国纳 2 nr
+王国维 87 nr
+王国维和 2 nr
+王国臣 2 nr
+王国良 7 nr
+王国萨 2 nr
+王国藩 2 nr
+王国遂 2 nr
+王国里 6 nr
+王图帖 2 nr
+王圆箓 3 nrfg
+王在世 2 nr
+王在寨 3 nr
+王在晋 38 nr
+王地宫 5 nr
+王均居 2 nr
+王均瑶 3 nr
+王坚入 2 nr
+王坚卒 3 nr
+王坚执 4 nr
+王坚督 2 nr
+王坚领 2 nr
+王坦克 2 nr
+王城分 2 nr
+王城岗 29 nr
+王基引 2 nr
+王塔察 4 nr
+王士俊 3 nr
+王士昌 3 nr
+王士桢 2 nr
+王士洪 3 nr
+王士珍 22 nr
+王士诚 12 nr
+王士龙 3 nr
+王处一 68 nr
+王备御 2 nr
+王多尔 5 nr
+王多尼 5 nr
+王多铎 17 nr
+王大亮 2 nr
+王大人 55 nr
+王大令 2 nr
+王大兵 3 nr
+王大军 26 nr
+王大勇 2 nr
+王大卫 2 nr
+王大发 33 nr
+王大叔 5 nr
+王大哥 13 nr
+王大夫 448 nr
+王大妈 3 nr
+王大宽 30 nr
+王大年 2 nr
+王大庆 2 nr
+王大怒 7 nr
+王大惊 5 nr
+王大旗 3 nr
+王大明 3 nr
+王大流 4 nr
+王大爷 9 nr
+王大牛 16 nr
+王大珩 33 nr
+王大真 5 nr
+王大雷 45 nr
+王大霖 2 nr
+王大顺 2 nr
+王天凌 6 nr
+王天德 2 nr
+王天成 4 nrfg
+王天杰 2 nr
+王天林 3 nr
+王天民 3 nr
+王天逸 3 nr
+王太傅 5 nr
+王太医 22 nr
+王太华 3 nr
+王太后 29 nr
+王太和 9 nr
+王太太 3 nr
+王太子 2 nr
+王太子晋 2 nr
+王太守 7 nr
+王太宰 11 nr
+王太岚 256 nr
+王太监 9 nr
+王太祖 2 nr
+王夫之 53 nr
+王夫人 796 nr
+王夫棠 2 nr
+王夷甫 3 nr
+王奇峰 2 nr
+王奉光 8 nr
+王奉戴 2 nr
+王奎庆 2 nr
+王奥鲁 2 nr
+王女士 3 nr
+王奶奶 11 nr
+王奶妈 2 nr
+王好古 4 nr
+王如一 62 nr
+王如坚 2 nr
+王如晨 8 nr
+王如松 3 nr
+王如言 2 nr
+王妃 242 nr
+王妈妈 7 nr
+王姑娘 54 nr
+王威廉 2 nr
+王娜梅 6 nr
+王婆卖瓜 3 nr
+王婆房 5 nr
+王婆笑 10 nr
+王婆计 2 nr
+王婉婷 2 nr
+王婷婷 3 nr
+王媛媛 2 nr
+王嬷嬷 3 nr
+王子 685 nr
+王子么 3 nr
+王子云 4 nr
+王子博 2 nr
+王子婴 3 nr
+王子安 5 nr
+王子安阳 2 nr
+王子帕 2 nr
+王子平 3 nr
+王子幺 2 nr
+王子斐 2 nr
+王子服 9 nr
+王子朗 2 nr
+王子朝 6 nr
+王子杰 3 nr
+王子江 3 nr
+王子渊 2 nr
+王子生平 2 nr
+王子真 3 nr
+王子笑 2 nr
+王子腾 27 nr
+王子英 2 nr
+王子葛 2 nr
+王孔有 2 nr
+王孔甲 4 nr
+王孔目 3 nr
+王存才 2 nr
+王孙 54 nr
+王孙公子 14 nr
+王孙贵戚 3 nr
+王孝杰 6 nr
+王孝迪 31 nr
+王孝通 28 nr
+王孟奇 6 nr
+王孟斌 4 nr
+王孟英 7 nr
+王孟获 9 nr
+王孟韦 4 nr
+王季之 2 nr
+王季思 2 nr
+王季烈 2 nr
+王学书 2 nr
+王学军 3 nr
+王学大 2 nr
+王学庆 4 nr
+王学文 7 nr
+王学权 2 nr
+王学泰 2 nr
+王学的 4 nr
+王学萍 257 nr
+王学贤 8 nr
+王学门 4 nr
+王宁嫔 5 nr
+王宁生 257 nr
+王宇景 4 nr
+王守业 3 nr
+王守义 55 nr
+王守仁 611 nr
+王守履 6 nr
+王守志 2 nr
+王守武 3 nr
+王守海 4 nr
+王守澄 2 nr
+王安中 5 nr
+王安华 2 nr
+王安娜 2 nr
+王安定 3 nr
+王安忆 8 nr
+王安智 3 nr
+王安治 6 nr
+王安琪 2 nr
+王安石 372 nr
+王安顺 3 nr
+王宋大 256 nr
+王完颜 16 nr
+王宏伟 24 nr
+王宏信 2 nr
+王宏剑 2 nr
+王宏友 2 nr
+王宏宇 3 nr
+王宏志 7 nr
+王宏明 2 nr
+王宗仁 4 nr
+王宗岳 2 nr
+王宗沐 2 nr
+王宗系 2 nr
+王宙斯 3 nr
+王定保 4 nr
+王定六 28 nr
+王定国 3 nr
+王定庆 3 nr
+王定昶 2 nr
+王定标 23 nr
+王宜明 4 nr
+王宝山 58 nr
+王宝森 11 nr
+王宝泉 13 nr
+王宝钏 11 nr
+王实味 2 nr
+王实实 2 nr
+王实甫 25 nr
+王宠幸 2 nr
+王宠惠 23 nr
+王审琦 7 nr
+王审知 12 nr
+王室 1029 n
+王室贵族 3 nr
+王宪章 2 nr
+王宪钧 2 nr
+王宫 374 nr
+王家 979 n
+王家乙 2 nr
+王家二 7 nr
+王家卫 7 nr
+王家坝 4 nr
+王家坪 7 nr
+王家堡村 3 nr
+王家墩 256 nr
+王家大 4 nr
+王家嫂子 2 nr
+王家屏 34 nr
+王家岗 256 nr
+王家岛 3 nr
+王家岭 14 nr
+王家庄 26 nr
+王家彦 26 nr
+王家桢 5 nr
+王家沙 2 nr
+王家河 11 nr
+王家瑞 3 nr
+王家田 3 nr
+王家畈 5 nr
+王家耀 257 nr
+王家老 2 nr
+王家舅 3 nr
+王家驹 22 nr
+王家骏 23 nr
+王宽诚 2 nr
+王富强 4 nr
+王富洲 7 nr
+王察罕 4 nr
+王导 72 n
+王导之 3 nr
+王导卒 3 nr
+王寿伟 2 nr
+王寿昌 2 nr
+王封公 2 nr
+王封鲁 2 nr
+王将军 20 nr
+王将明 8 nr
+王将闾 2 nr
+王尊三 3 nr
+王尊其 3 nr
+王小三 2 nr
+王小丫 22 nr
+王小义 12 nr
+王小二 11 nr
+王小倜 53 nr
+王小兰 251 nr
+王小博 4 nr
+王小大 2 nr
+王小女 2 nr
+王小姐 19 nr
+王小山 2 nr
+王小峰 3 nr
+王小帅 13 nr
+王小平 2 nr
+王小强 3 nr
+王小明 3 nr
+王小梅 16 nr
+王小波 161 nr
+王小皤 2 nr
+王小石 2 nr
+王小章 2 nr
+王小芹 8 nr
+王小虎 2 nr
+王小诗 24 nr
+王小雯 12 nr
+王小鹰 2 nr
+王小龙 2 nr
+王少堂 5 nr
+王少康 3 nr
+王少弟 3 nr
+王少舫 2 nr
+王尔德 29 nr
+王尔恺 6 nr
+王尔调 3 nr
+王尚义 2 nr
+王尚书 8 nr
+王尚仪 3 nr
+王尚可 2 nr
+王尚荣 257 nr
+王尽美 5 nr
+王居正 2 nrfg
+王屋 32 n
+王屋山 48 nr
+王屋派 23 nr
+王屏藩 2 nr
+王山生 10 nr
+王岐山 23 nr
+王岩叟 2 nr
+王岭期 2 nr
+王岳乐 6 nr
+王岳川 2 nr
+王岳龙 2 nr
+王峰赢 8 nr
+王崇伦 19 nr
+王崇古 93 nr
+王崇简 31 nr
+王巡抚 17 nr
+王左桂 18 nr
+王巨禄 2 nr
+王师伯 3 nr
+王师傅 18 nr
+王师北 6 nr
+王师叔 3 nr
+王师子 2 nr
+王师弟 19 nr
+王希孟 4 nr
+王希烈 225 nr
+王希玲 2 nr
+王帝辛 2 nr
+王常常 32 nr
+王常月 2 nr
+王常洵 3 nr
+王常遇 2 nr
+王平 352 nr
+王平令 2 nr
+王平安 2 nr
+王平引 6 nr
+王平殷 3 nr
+王平章 5 nr
+王平见 2 nr
+王平陵 3 nr
+王年祀 3 nr
+王并立 16 nr
+王广平 4 nr
+王广廉 2 nr
+王广福 3 nr
+王庄划 2 nr
+王庄村 3 nr
+王庄那 3 nr
+王庆一 4 nr
+王庆令 2 nr
+王庆便 2 nr
+王庆兄弟 2 nr
+王庆勇 6 nr
+王庆只 2 nr
+王庆同 2 nr
+王庆听 5 nr
+王庆喝 2 nr
+王庆因 4 nr
+王庆大 2 nr
+王庆封 2 nr
+王庆差 3 nr
+王庆录 2 nr
+王庆成 7 nr
+王庆手 2 nr
+王庆新 6 nr
+王庆生 2 nr
+王庆看 2 nr
+王庆见 4 nr
+王庆越 3 nr
+王庆那 3 nr
+王庆闻 2 nr
+王应权 3 nr
+王应杰 2 nr
+王应睐 3 nr
+王应麟 6 nr
+王应龙 2 nr
+王府 1251 nr
+王府井 183 nr
+王府井书店 3 n
+王府井大街 140 nr
+王府镇 2 nr
+王度庐 2 nr
+王座 49 nr
+王座战 3 nr
+王庭筠 7 nr
+王廉州 2 nr
+王延德 2 nr
+王延政 6 nr
+王廷彦 2 nr
+王廷江 9 nr
+王廷相 16 nr
+王廷臣 23 nr
+王廷诏 3 nr
+王建东 3 nr
+王建亚 2 nr
+王建军 5 nr
+王建功 5 nr
+王建华 4 nr
+王建国 12 nr
+王建安 257 nr
+王建宙 3 nr
+王建害 2 nr
+王建峰 2 nr
+王建平 2 nr
+王建新 2 nr
+王建明 6 nr
+王建民 4 nr
+王建满 3 nr
+王建硕 14 nr
+王建祖 2 nr
+王建芳 3 nr
+王建英 6 nr
+王廿祀 2 v
+王开儒 15 nr
+王开恩 3 nr
+王开明 3 nr
+王开玉 3 nr
+王开金 3 nr
+王开阳 7 nr
+王弄喧 2 nr
+王引之 8 nr
+王弘祚 2 nr
+王弟叔 2 nr
+王弼之 2 nrfg
+王弼好 2 nrfg
+王弼注 9 nr
+王弼集 4 nr
+王彦田 9 nr
+王彦祖 2 nr
+王彦章 8 nr
+王彦超 2 nr
+王彭越 3 nr
+王徐卢 2 nr
+王徐达 5 nr
+王得禄 2 nr
+王御史 2 nr
+王御弟 4 nr
+王微微 15 nr
+王徵绘 2 nr
+王德刚 2 nr
+王德勇 2 nr
+王德勋 3 nr
+王德勤 65 nr
+王德威 2 nr
+王德学 4 nr
+王德完 3 nr
+王德宝 5 nr
+王德富 4 nr
+王德山 2 nr
+王德明 7 nr
+王德槟 5 n
+王德浦 2 nr
+王徽之 4 nr
+王心念 6 nr
+王必会 2 nr
+王必得 3 nr
+王必成 259 nr
+王必有 2 nr
+王必甚 2 nr
+王忍之 3 nr
+王志东 21 nr
+王志乐 8 nr
+王志军 5 nr
+王志刚 3 nr
+王志勇 3 nr
+王志发 3 nr
+王志国 14 nr
+王志坚 2 nr
+王志坦 76 nr
+王志宝 3 nr
+王志平 2 nr
+王志强 3 nr
+王志文 7 nr
+王志明 3 nr
+王志灵 2 nr
+王志纲 2 nr
+王志良 13 nr
+王志谨 5 nr
+王志铮 2 nr
+王志飞 3 nr
+王忙哥 5 nr
+王忠嗣 6 nr
+王忠奇 7 nr
+王忠家 4 nr
+王忠平 4 nr
+王忠引 2 nr
+王忠悫 2 nr
+王忠瑜 2 nr
+王忠祥 2 nr
+王忠禹 20 nr
+王忠肃 2 nr
+王念孙 28 nr
+王念起 2 nr
+王忽察 2 nr
+王忽必 4 nr
+王怀德 2 nr
+王怀忠 3 nr
+王怀臣 10 nr
+王怀远 258 nr
+王思亮 2 nr
+王思政 4 nr
+王思潮 3 nr
+王思齐 3 nr
+王怡仁 3 nr
+王怡珩 3 nr
+王总兵 10 nr
+王总管 14 nr
+王总见 3 nr
+王总镖 20 nr
+王恒外 2 nr
+王恩琦 3 nr
+王恩茂 5 nr
+王恭举 2 nr
+王恭厂 5 nr
+王恭自 2 nr
+王恺争 2 nr
+王悦之 2 nr
+王惟一 6 nr
+王惟忠 10 nr
+王惠平 89 nr
+王惠民 9 nr
+王慎中 2 nr
+王慧卿 2 nr
+王慧敏 3 nr
+王慧炯 4 i
+王懿荣 6 nr
+王戎好 2 nr
+王戎相 2 nr
+王成国 4 nr
+王成德 2 nr
+王成标 11 nr
+王成章 17 nr
+王战荣 5 nr
+王所传 2 nr
+王才人 3 nr
+王扬祖 2 nr
+王承华 5 nr
+王承宗 4 nr
+王承恩 263 nr
+王承胤 2 nr
+王护驾 2 nr
+王押司 3 nr
+王拔都 3 nr
+王招宣 3 nr
+王拥立 2 nr
+王挥兵 2 nr
+王振亚 3 nr
+王振华 4 nr
+王振南 8 nr
+王振堂 11 nr
+王振宇 50 nr
+王振宏 2 nr
+王振昌 13 nr
+王振杰 3 nr
+王振林 7 nr
+王振立 3 nr
+王振良 2 nr
+王振铎 4 nr
+王振鹏 3 nr
+王掌力 3 nr
+王掌柜 4 nr
+王揖唐 13 nr
+王摇摇 4 nr
+王摩诃 2 nr
+王攘夷 35 nr
+王改信 2 nr
+王改封 3 nr
+王政君 18 nr
+王政委 11 nr
+王政权 8 nr
+王敦 76 nr
+王敦攻 3 nr
+王敬久 14 nr
+王敬堂 18 nr
+王敬宏 9 nr
+王敬武 2 nr
+王敬继 2 nr
+王敬轩 7 nr
+王敬驻 2 nr
+王文丁 4 nr
+王文举 2 nr
+王文京 8 nr
+王文俊 6 nr
+王文元 3 nr
+王文公 8 nr
+王文华 35 nr
+王文天 2 nr
+王文娟 2 nrfg
+王文德 12 nr
+王文成 6 nrfg
+王文操 2 nr
+王文斌 16 nr
+王文杰 3 nr
+王文治 2 nr
+王文燮 2 nr
+王文生 5 nr
+王文简 2 nr
+王文素 8 nr
+王文统 27 nr
+王文耀 8 nr
+王文金 2 nr
+王文韶 26 nr
+王斌余 3 nr
+王新亭 257 nr
+王新佳 2 nr
+王新俊 4 nr
+王新命 4 nr
+王新庆 2 nr
+王新录 2 nr
+王新德 2 nr
+王新欣 23 nr
+王新民 2 nr
+王新胜 6 nr
+王方天 2 nr
+王方宇 2 nr
+王方翼 4 nr
+王族 165 nr
+王旗城 3 nr
+王旗来 2 nr
+王旗藏 6 nr
+王旗进 2 nr
+王无一 2 nr
+王无子 3 nr
+王无诸 3 nr
+王无道 2 nr
+王早定 3 nr
+王旭东 2 nr
+王旭明 61 nr
+王旭烈 2 nr
+王时建 3 nr
+王时敏 20 nr
+王时楚 3 nr
+王时臣 2 nr
+王时雍 46 nr
+王昆松 2 nr
+王昌龄 30 nr
+王明 368 nr
+王明业 2 nr
+王明义 4 nr
+王明友 2 nr
+王明山 2 nr
+王明明 2 nr
+王明清 6 nr
+王明礼 4 nr
+王明芳 16 nr
+王明达 2 nr
+王明里 2 nr
+王星记 2 nr
+王春光 6 nr
+王春华 6 nr
+王春正 2 nr
+王春瑜 7 nr
+王春芝 2 nr
+王春露 2 nr
+王昭君 302 nr
+王是崇 2 nr
+王是懿 3 nr
+王晋卿 2 nr
+王晋堂 3 nr
+王晓东 518 nr
+王晓军 5 nr
+王晓初 2 nr
+王晓宁 2 nr
+王晓平 5 nr
+王晓明 7 nr
+王晓棠 3 nrfg
+王晓籁 3 nr
+王晓红 5 nr
+王晓鸥 6 nr
+王晓鹰 2 nr
+王晓龙 2 nr
+王晔彪 2 nr
+王景弘 4 nr
+王景治 3 nr
+王景略 3 nr
+王景超 4 nr
+王暗摇 2 nr
+王曙光 5 nr
+王曰乾 5 nr
+王曰俞 3 nr
+王更广 16 nr
+王曹丕 7 nr
+王曾灭 2 nr
+王曾瑜 16 nr
+王月萍 7 nr
+王有严 2 nr
+王有何 3 nr
+王有子 2 nr
+王有年 2 nr
+王有龄 2 nr
+王朗奏 2 nr
+王望望 2 nr
+王朝 3792 nr
+王朝佐 6 nr
+王朝刚 2 nr
+王朝夏 2 nr
+王朝廷 2 nr
+王朝建都 4 nr
+王朝改换 2 nr
+王朝末 2 nr
+王朝玛 2 nr
+王朝辅 3 nr
+王朝闻 7 nr
+王本固 7 nr
+王本来 18 nr
+王本欲 2 nr
+王札阑 2 nr
+王朱权 5 nr
+王朱柏 2 nr
+王朱桂 3 nr
+王朱英 2 nr
+王朱谊 3 nr
+王朱鼎 4 nr
+王朴奉 6 nr
+王朴知 3 nr
+王杀休 4 nr
+王权 223 nr
+王权之 2 nr
+王权仗 2 nr
+王权神 4 nr
+王李克 3 nr
+王李冲 2 nr
+王李存 4 nr
+王李旦 5 nr
+王李显 3 nr
+王李氏 2 nr
+王李治 3 nr
+王李泰 2 nr
+王李秀 3 nr
+王李自 3 nr
+王李贞 4 nr
+王杨溥 4 nr
+王杨秀 2 nr
+王杨雄 2 nr
+王杰书 4 nr
+王松奇 2 nr
+王松苗 2 nr
+王极盛 3 nr
+王林峰 2 nr
+王林昌 12 nr
+王查理 12 nr
+王柳貌 4 nr
+王树人 2 nr
+王树国 14 nr
+王树增 2 nr
+王树声 275 nr
+王树文 3 nr
+王树斌 9 nr
+王树森 4 nr
+王栖曜 3 nr
+王根宝 4 nr
+王格格 11 nr
+王格鲁 2 nr
+王桂松 2 nr
+王桐龄 2 nr
+王桢著 2 nr
+王桥镇 3 nr
+王梅祥 256 nr
+王梦云 2 nr
+王梦奎 258 nr
+王森浩 2 nr
+王植时 2 nr
+王楠 32 nr
+王欣然 2 nr
+王正中 4 nr
+王正华 2 nr
+王正廷 12 nr
+王正自 2 nr
+王正鹏 2 nr
+王武丁 9 nr
+王武俊 2 nr
+王武通 16 nr
+王歧山 3 nr
+王殷天 9 nr
+王殿甫 45 nr
+王母 34 nr
+王母娘娘 40 nr
+王母宫 2 nr
+王母桃 3 nr
+王母正 2 nr
+王母池 4 nr
+王母洞 5 nr
+王母灵芝 2 nr
+王毓国 9 nr
+王毓瑚 4 nr
+王毓秀 2 nr
+王毓铨 13 nr
+王比学 4 nr
+王毕勒 2 nr
+王氏乃 2 nr
+王氏之 4 nr
+王氏兄弟 16 nr
+王氏勤 3 nr
+王氏家族 2 nr
+王氏改 2 nr
+王氏翼 2 nr
+王水 34 nr
+王水溶 3 nr
+王永住 3 nr
+王永光 14 nr
+王永军 2 nr
+王永华 2 nr
+王永吉 85 nr
+王永在 2 nr
+王永孝 8 nr
+王永干 3 nr
+王永平 2 nr
+王永庆 3 nr
+王永志 3 nr
+王永昌 2 nr
+王永梭 2 nr
+王永武 2 nr
+王永民 6 nr
+王永治 14 nr
+王永炎 257 nr
+王永珀 3 ns
+王永祥 11 nr
+王永祺 2 nr
+王永谦 2 nr
+王永锡 2 nr
+王求仁 2 nr
+王汉文 7 nr
+王汉斌 17 nr
+王汗牙 2 nr
+王汗联 4 nr
+王汗见 3 nr
+王汝丰 2 nr
+王汝刚 2 nr
+王汝南 19 nr
+王汝林 2 nr
+王汝翼 2 nr
+王汝鹏 2 nr
+王江州 2 nr
+王江泾 8 ns
+王汪古 2 nr
+王沛林 7 nr
+王沪宁 17 nr
+王治国 3 ns
+王治岐 2 nr
+王治朝 2 nr
+王治郅 194 nr
+王法 91 nr
+王法鲁 4 nr
+王泰吉 5 nr
+王泽浚 2 nr
+王洁凤 27 nr
+王洛宾 7 nr
+王洪亮 6 nr
+王洪俊 39 nr
+王洪文 142 nr
+王洪波 2 nr
+王派军 2 nr
+王派田 3 nr
+王流摇 2 nr
+王济仁 2 nr
+王浑愧 3 nr
+王浑爵 3 nr
+王浚联 2 nr
+王海军 23 nr
+王海将军 2 nr
+王海山 2 nr
+王海波 3 nr
+王海涛 3 nr
+王海燕 3 nr
+王海都 3 nr
+王海鸣 3 nr
+王海鹰 6 nr
+王润培 2 nr
+王淦昌 32 nr
+王清任 6 nr
+王清惠 8 nr
+王渝生 3 nr
+王渡江 2 nr
+王温禺 2 nr
+王湘浩 12 nr
+王湛生 2 nr
+王溥仕 2 nr
+王满银 146 nr
+王滩港 2 nr
+王演卦 2 nr
+王潮卒 2 nr
+王灵官 6 nr
+王炎午 12 nr
+王炜中 3 nr
+王炳南 13 nr
+王炳章 16 nr
+王点点 23 nr
+王焕武 2 nr
+王煦华 14 nr
+王照华 3 nr
+王照环 3 nr
+王熊通 2 nr
+王熙凤 3 i
+王燕谋 6 nr
+王燕雯 3 nr
+王燮先 2 nr
+王爱卿 2 nr
+王爱德 14 nr
+王爱民 3 nr
+王爱玛 2 nr
+王爱财 2 nr
+王爵 37 nr
+王爵封 2 nr
+王爵授 2 nr
+王爷 1624 nr
+王爷庙 2 nr
+王爷府 3 nr
+王牌 194 n
+王牌军 14 n
+王猛 60 nr
+王献之 22 nr
+王献斋 2 nr
+王猷定 2 nr
+王玄甫 4 nr
+王玄策 17 nr
+王玄谟 2 nr
+王率兵 2 nr
+王率师 4 nr
+王玉发 5 nr
+王玉峰 2 nr
+王玉振 2 nr
+王玉晶 5 nr
+王玉柱 2 nr
+王玉梅 7 nr
+王玉珍 257 nr
+王玉璞 2 nr
+王玉真 2 nr
+王玉蓉 2 nr
+王玺绶 4 nr
+王珍如 46 nr
+王班直 9 nr
+王理查 6 nr
+王琦瑶 1997 nr
+王琳娜 6 nr
+王瑞兰 3 nr
+王瑞其 4 nr
+王瑞文 20 nr
+王瑞林 7 nr
+王瑞璞 3 nr
+王瑞祥 5 nr
+王瑞芬 236 nr
+王瑞芳 3 nr
+王瑞道 4 nr
+王瑞领 128 nr
+王瑶卿 16 nr
+王璐娜 3 nr
+王璐瑶 3 nr
+王瓒绪 19 nr
+王瓦伊 2 nr
+王甘麻 6 nr
+王生下 2 n
+王生斌 3 nr
+王生甲 2 nr
+王生良 3 nr
+王生铁 2 nr
+王用修 12 nr
+王用汲 3 nr
+王用畏 2 nr
+王田私 10 nr
+王甲本 4 nr
+王申贵 2 nr
+王畿内 4 nr
+王疯子 4 nr
+王登基 4 nr
+王登天 2 nr
+王登极 2 nr
+王登殿 2 nr
+王白山 2 nr
+王百合 2 nr
+王的姬 3 nr
+王皇后 41 nr
+王益明 8 nr
+王监军 2 nr
+王盘山 44 nr
+王盘庚 5 nr
+王直站 2 nr
+王相公 11 nr
+王相尧 2 nr
+王相府 4 nr
+王真人 33 nr
+王真君 2 nr
+王督师 2 nr
+王瞎子 2 nr
+王石川 2 nr
+王石虎 3 nr
+王石谷 2 nr
+王石达 4 nr
+王码汉卡 3 ns
+王码电脑 3 n
+王码网 3 n
+王砾 62 n
+王祖乙 2 nr
+王祖训 256 nr
+王祝三 2 nr
+王祝翔 4 nr
+王神箭 2 nr
+王神韩 6 nr
+王祥云 3 nr
+王祥卧冰 3 i
+王祥喜 256 nr
+王祥弟 2 nr
+王祯农 4 nr
+王禅兵 2 nr
+王福山 2 nr
+王福晋 37 nr
+王福英 2 nr
+王禹九 3 nr
+王秀佳 4 nr
+王秀全 2 nr
+王秀兰 6 nr
+王秀才 2 nr
+王秀珍 2 nr
+王秉岐 2 nr
+王秉真 36 nr
+王秉诚 3 nr
+王秋杨 6 nr
+王秋萍 2 nr
+王秋蛇 5 nr
+王积薪 2 nr
+王称君 3 nr
+王称王 4 nr
+王移兵 3 nr
+王稼祥 83 nrfg
+王立东 3 nr
+王立健 7 nr
+王立军 3 nr
+王立司南 4 nr
+王立国 3 nr
+王立在 3 nr
+王立太子 3 nr
+王立平 259 nr
+王立志 3 nr
+王立武 9 nr
+王立申 2 nr
+王立芳 4 nr
+王立莉 8 nr
+王立降 2 nr
+王章死 3 nr
+王端臣 6 nr
+王竹斋 6 nr
+王竹溪 2 nr
+王筱麟 3 nr
+王箭法 2 nr
+王素莉 17 nr
+王紫升 3 nr
+王红霞 5 nr
+王约翰 6 nr
+王纬宇 640 nr
+王纲敏 3 nr
+王纳文 3 nr
+王绍伟 3 nr
+王绍光 2 nr
+王绍华 10 nr
+王绍君 2 nr
+王绍禹 24 nr
+王经之 2 nr
+王经宇 90 nr
+王经引 2 nr
+王经理 10 nr
+王统照 13 nr
+王继光 15 nr
+王继全 2 nr
+王继军 2 nr
+王继恩 20 nr
+王维 60 nr
+王维勇 3 nr
+王维嘉 3 nr
+王维城 257 nr
+王维山 27 nr
+王维扬 146 nr
+王维澄 3 nr
+王维玲 2 nr
+王维虎 23 nr
+王维银 2 nr
+王缵绪 4 v
+王罕兵 2 nr
+王罕笑 3 nr
+王置府 2 nr
+王美人 4 nr
+王美娘 2 nr
+王美珍 5 nr
+王羲之 110 nr
+王翊铭 2 nr
+王翠翘 27 nr
+王翰林 10 nr
+王耀华 2 nr
+王耀平 2 nr
+王耀武 34 nr
+王耀铭 11 nr
+王老九 13 nr
+王老五 31 nr
+王老儿 4 nr
+王老六 2 nr
+王老吉 3 nr
+王老太 3 nr
+王老头 2 nr
+王老好 8 nr
+王老师 3 nr
+王老板 9 nr
+王老汉 10 nr
+王老爷 34 nr
+王老爷子 5 nr
+王老营 2 nr
+王老镖 8 nr
+王者 281 n
+王者兴 3 nr
+王者师 4 nr
+王而立 3 nr
+王耶律 2 nr
+王耿仲 2 nr
+王聪儿 260 nr
+王肇轩 3 nr
+王肥献 2 nr
+王肯堂 2 nr
+王育民 10 nr
+王胆咬 2 nr
+王胆死 3 nr
+王胖子 29 nr
+王胜今 2 nr
+王胡立 3 nr
+王胡逸 2 nr
+王胤昌 11 nr
+王脱欢 3 nr
+王臣公 3 nr
+王臣史 2 nr
+王臣磐 3 nr
+王自立 3 nrfg
+王至成 2 nr
+王致和 4 nr
+王致诚 2 nr
+王舍人镇 2 nr
+王舍城 13 nr
+王舍村 4 nr
+王般若 2 nr
+王舵主 2 nr
+王船山 2 nr
+王良俊 2 nr
+王艳青 5 nr
+王花园 3 nr
+王芳正 2 nr
+王芸生 3 nr
+王苏芬 2 nr
+王若平 2 nr
+王若涵 256 nr
+王若溪 16 nr
+王若虚 12 nr
+王若飞 31 nr
+王英 76 nr
+王英凡 263 nr
+王英布 8 nr
+王苻纂 2 nr
+王茂林 259 nr
+王茂润 256 nr
+王茂章 2 nr
+王茂荫 2 nr
+王荆公 6 nr
+王荣生 3 nr
+王药木 2 nr
+王荷波 5 nr
+王荷生 2 nr
+王莲香 11 nr
+王莽 285 nr
+王莽代 5 nr
+王莽军 4 nr
+王莽加 3 nr
+王莽复 3 nr
+王莽托 2 nr
+王莽新 8 nr
+王莽派 2 nr
+王莽秉 2 nr
+王莽篡汉 3 v
+王莽自立 2 nr
+王莽遂 2 nr
+王莽闻 2 nr
+王菁华 3 nr
+王菊珍 8 nr
+王菲 44 nr
+王萧子 2 nr
+王萧嶷 2 nr
+王萧纪 3 nr
+王萧绎 6 nr
+王萧誉 4 nr
+王萧霞 2 nr
+王萨迦 4 nr
+王葆仁 2 nr
+王葆真 2 nr
+王蔚然 2 nr
+王虹蔚 3 nr
+王蛤蟆 40 nr
+王蜀宫 2 nr
+王行瑶 2 nr
+王衍之 3 nr
+王衍亦 2 nr
+王衍用 4 nr
+王衍荐 3 nr
+王被杨 2 nr
+王裕民 2 nr
+王西征 4 nr
+王西麟 2 nr
+王见人 2 nr
+王见晋 2 nr
+王见杨 2 nr
+王观堂 2 nr
+王觉斯 11 nr
+王言彬 6 i
+王誉封 3 nr
+王训告 2 nr
+王论者 3 n
+王识贤 2 nr
+王诗序 2 nr
+王诚吉 2 nr
+王诚汉 256 nr
+王语嫣 3 nr
+王诸子 3 nr
+王诸樊 2 nr
+王谢堂前燕 4 nr
+王谢法 2 nr
+王谢逊 41 nr
+王象之 2 nr
+王象晋 4 nr
+王豪格 4 nr
+王贝勒 41 nr
+王贞治 3 nr
+王贞鹏 11 nr
+王贡弹冠 3 n
+王贤选 3 nr
+王贲引 3 nr
+王贲攻 3 nr
+王贵伏 2 nr
+王贵便 2 nr
+王贵喊 3 nr
+王贵太 2 nr
+王贵带 4 nr
+王贵想 2 nr
+王贵戚 4 nr
+王贵曾 2 nr
+王贵正 2 nr
+王贵满 2 nr
+王贵真 2 nr
+王贵系 2 nr
+王贵若 4 nr
+王贵躺 2 nr
+王贵都 3 nr
+王贵问 3 nr
+王贺锦 3 nr
+王赐示 2 nr
+王赣骏 4 nr
+王赤绶 2 nr
+王赵俣 2 nr
+王赵构 16 nr
+王赵楷 2 nr
+王起兵 4 nr
+王超平 10 nr
+王超心 2 nr
+王越迎 2 nr
+王跃堂 4 nr
+王跃文 3 nr
+王跃起 2 nr
+王路易 20 nr
+王轻功 3 nr
+王载漪 9 nr
+王辅仁 13 nr
+王辅臣 2 nr
+王辟光 6 nr
+王辟方 2 nr
+王达夫 2 nr
+王迁丰 3 nr
+王迎儿 3 nr
+王进京 7 nr
+王进人 5 nr
+王进告 2 nr
+王进喜 30 nr
+王进城 4 nr
+王进宝 84 nr
+王进寨 2 nr
+王进笑 2 nr
+王进谢 2 nr
+王进财 4 nr
+王进逵 4 nr
+王远知 9 nr
+王连城 3 nr
+王连年 3 nr
+王连彪 2 nr
+王连志 8 nr
+王连洲 3 nr
+王述曾 9 nr
+王选谈 2 nr
+王通治 7 nr
+王速回 2 nr
+王造时 2 n
+王逸涛 2 nr
+王道 251 nr
+王道乐土 3 nr
+王道乾 5 nr
+王道士 7 nr
+王道成 5 nrfg
+王邀聘 2 nr
+王邑发 3 nr
+王那木 2 nr
+王那根 2 nr
+王邦瑞 3 nr
+王郑经 2 nr
+王郝孙 2 nr
+王部堂 3 nr
+王部金 2 n
+王都尉 7 nr
+王里奥 3 nr
+王里姆 2 nr
+王重民 8 nr
+王重润 2 nr
+王重荣 2 nr
+王重阳 254 nr
+王金万 34 nr
+王金山 14 nr
+王金平 26 nr
+王金战 33 nr
+王金旭 2 nr
+王金春 2 nr
+王金涛 5 nr
+王金轮 5 nr
+王金龙 2 nr
+王钟印 8 nr
+王钟声 3 nr
+王钟翰 6 nr
+王钦卢 3 nr
+王钦若 13 nr
+王钱元 2 nr
+王铁匠 17 nr
+王铁口 117 nr
+王铁崖 5 nr
+王铁成 4 nr
+王铁枪 23 nr
+王铁汉 3 nr
+王铁牛 3 nr
+王铁轮 6 nr
+王铅轮 2 nr
+王铨忠 2 nr
+王铭章 6 nr
+王银满 14 nr
+王银轮 2 nr
+王铸剑 2 nr
+王锡朋 3 nr
+王锡林 6 nr
+王锡爵 178 nr
+王锡祺 4 nr
+王锡阐 21 nr
+王锦霞 3 nr
+王锦鹄 3 nr
+王镇恶 12 nr
+王镇邺 2 nr
+王镇长 6 nr
+王镜宇 6 nr
+王长史 2 nr
+王长喜 3 nr
+王长山 4 nr
+王长林 5 nr
+王长顺 319 nr
+王闻言 2 nr
+王闽中 2 nr
+王阁序 2 nr
+王队长 6 n
+王阳明 61 nr
+王阿只 2 nr
+王阿尔 4 nr
+王阿提 5 nr
+王阿毛 7 nr
+王阿济 5 nr
+王阿罗 4 nr
+王阿达 4 nr
+王际凯 2 nr
+王陇德 7 nr
+王降汉 11 nr
+王险城 2 nr
+王陵之 6 nr
+王陵免 2 nr
+王陵区 11 nr
+王陵变 2 nr
+王陵寝 3 nr
+王陵碑 4 nr
+王难姑 38 nr
+王雄渠 6 nr
+王雅兹 2 nr
+王雪冰 4 nr
+王雪原 3 nr
+王雪涛 9 nr
+王雪瑾 3 nr
+王雷雷 2 nr
+王雷鸣 5 nr
+王震 38 nr
+王震先生 2 nr
+王震宇 3 nr
+王震将军 2 nr
+王霞光 13 nr
+王霞斐 48 nr
+王霸业 4 nr
+王霸之 4 nr
+王静安 4 nr
+王静斋 2 nr
+王非王 2 nr
+王韩信 3 nr
+王韵笙 5 nr
+王顺友 3 nr
+王顾左右而言他 22 l
+王颁胡 2 nr
+王领兵 4 nr
+王颖入 2 nr
+王颖合 2 nr
+王飞利 3 nr
+王首辅 2 nr
+王首道 3 nr
+王香如 12 nr
+王馥荔 3 nrfg
+王骥主 2 nr
+王骥德 12 nr
+王高迎 2 nr
+王鲁彦 4 nr
+王鸣媛 2 nr
+王鸣盛 5 nr
+王鸣谦 2 nr
+王鸿光 2 nr
+王鸿生 2 nr
+王鸿祯 2 nr
+王鸿绪 16 nr
+王鹏庆 2 nr
+王鹏飞 9 nr
+王鹤龄 2 nr
+王麻子 5 nr
+王黎娜 2 nr
+王鼎一 2 nr
+王鼎昌 2 nr
+王鼎足 2 nr
+王齐宣 2 nr
+王齐翰 2 nr
+王龙兴 2 nr
+王龙安 2 nr
+王龙阳 10 nr
+玎 90 zg
+玎玎玲玲 3 nr
+玑 61 g
+玕 26 zg
+玖 98 m
+玖艘 3 m
+玗 2 zg
+玘 53 zg
+玙 4 zg
+玚 2 zg
+玛 550 nr
+玛丽 113 nr
+玛丽亚 91 nr
+玛丽仙 43 nr
+玛丽和 2 nr
+玛丽埃 2 nr
+玛丽奥 2 nr
+玛丽娅 14 nr
+玛丽娜 11 nr
+玛丽安 4 nr
+玛丽岛 5 nr
+玛丽恩 6 nr
+玛丽欧 2 nr
+玛丽莲 8 nr
+玛丽莲梦 3 nr
+玛丽雅 3 nr
+玛乔丽 2 nr
+玛仁卡 3 nr
+玛佐夫 4 nr
+玛依力 3 nr
+玛依拉 5 nr
+玛依莎 3 nr
+玛克辛 44 nr
+玛兰厅 2 nr
+玛兹达 12 nr
+玛利 2 nrt
+玛利亚 185 ns
+玛利奥 3 nr
+玛哈尔 4 nr
+玛四世 3 nr
+玛塔 6 nrt
+玛塔玛 4 nr
+玛多 6 nrt
+玛多县 11 ns
+玛姆 4 nrt
+玛尔巴 2 nrt
+玛尔斯 2 nr
+玛尔河 2 nr
+玛尔浑 2 nr
+玛尔盖 5 nr
+玛尼 11 nr
+玛巴尔 6 nr
+玛建寺 2 nr
+玛戈塔 3 nr
+玛托夫 2 nr
+玛拉 3 nrt
+玛拉沁夫 5 ns
+玛旁雍错 20 ns
+玛曲 10 nr
+玛曲县 3 ns
+玛格 3 nrt
+玛格丽 2 nr
+玛格丽塔 9 nrt
+玛格丽娜 3 nrt
+玛格丽特 44 nrt
+玛格利 7 nr
+玛格坦 2 nr
+玛格达 3 nr
+玛格雷 2 nr
+玛沁 3 nr
+玛沁县 5 ns
+玛沙 3 ns
+玛法木 3 nr
+玛洛特 3 nr
+玛湖 3 ns
+玛特卡 2 nr
+玛特拉 2 nrt
+玛玛依 3 nr
+玛琳娜 3 nr
+玛瑙 263 nrt
+玛瑙石 4 ns
+玛申卡 3 nr
+玛祖卡 7 nr
+玛神山 3 nr
+玛米亚 3 ns
+玛米儿 10 nr
+玛米尔 3 nr
+玛索林 6 nr
+玛纳斯 61 nr
+玛纳斯县 3 ns
+玛纳斯湖 16 ns
+玛苏丽 2 nr
+玛莉亚 3 nr
+玛莉莲 3 nr
+玛莎 11 nrt
+玛莎拉蒂 3 nrt
+玛萨盖 2 nr
+玛蒂 3 nrt
+玛蒂尔 10 nr
+玛西亚普 2 nrt
+玛西特 4 nr
+玛赫杜 2 nr
+玛雅 134 nr
+玛雅人 92 nrt
+玛雅文 5 nr
+玛雅潘 4 nr
+玛雅语 2 nr
+玛鲁王 16 nr
+玛鲁神 17 nr
+玝 11 zg
+玞 2 zg
+玟 3 zg
+玠 106 zg
+玡 19 zg
+玢 10 x
+玥 9 zg
+玦 15 zg
+玩 4207 v
+玩不转 3 i
+玩不过来 3 l
+玩世 3 n
+玩世不恭 46 i
+玩乐 47 n
+玩人丧德 3 i
+玩伴 3 n
+玩偶 69 n
+玩儿 220 n
+玩儿不转 5 i
+玩儿命 3 n
+玩儿完 3 v
+玩儿票 3 n
+玩儿闹 3 l
+玩元 3 n
+玩兴 3 v
+玩兵黩武 3 i
+玩具 768 n
+玩具兵 3 n
+玩具厂 6 n
+玩具商 4 n
+玩具娃娃 3 n
+玩具店 5 n
+玩具枪 3 l
+玩具狗 3 i
+玩具箱 3 n
+玩具车 3 n
+玩出 3 v
+玩出去 3 i
+玩出来 3 i
+玩到 3 v
+玩剑 3 n
+玩厌 3 v
+玩友 3 n
+玩吧 21 n
+玩味 53 n
+玩命 102 n
+玩命之徒 3 i
+玩嘢 3 vn
+玩器 17 n
+玩坏 3 v
+玩完 3 v
+玩家 265 n
+玩岁愒日 3 v
+玩岁愒时 3 v
+玩岁愒月 3 v
+玩弄 218 v
+玩弄到 3 i
+玩弄女性 3 i
+玩弄权术 3 i
+玩弄着 3 i
+玩得转 3 v
+玩心 3 n
+玩心很重 3 z
+玩忽 3 v
+玩忽职守 49 i
+玩性 3 n
+玩惯 3 n
+玩意 249 n
+玩意儿 278 n
+玩手 3 n
+玩手段 2 n
+玩故习常 3 i
+玩日愒时 3 v
+玩时愒日 3 v
+玩时贪日 3 i
+玩机 3 n
+玩枪 3 n
+玩棋 3 n
+玩死 3 v
+玩水 3 n
+玩法 88 n
+玩游 3 n
+玩游戏 3 n
+玩火 18 n
+玩火者 2 n
+玩火自焚 3 i
+玩熟 3 v
+玩牌 7 n
+玩物 79 n
+玩物丧志 32 i
+玩玩 192 n
+玩玩儿 9 n
+玩球 3 n
+玩电脑 3 n
+玩皮 3 n
+玩票 3 n
+玩票性质 3 n
+玩笑 543 v
+玩笑话 41 l
+玩者 4 n
+玩耍 266 v
+玩腻 3 n
+玩艺 41 n
+玩艺儿 114 n
+玩花招 4 n
+玩花样 19 l
+玩角 3 n
+玩赏 27 v
+玩赏着 3 l
+玩起 3 v
+玩起来 3 l
+玩转 3 v
+玩过去 3 i
+玩过来 3 l
+玩过界 3 n
+玩遍 3 v
+玩钱 3 n
+玩闹 33 v
+玪 2 zg
+玫 464 n
+玫琳凯 5 nz
+玫瑰 540 n
+玫瑰园 13 n
+玫瑰油 9 n
+玫瑰紫 5 n
+玫瑰红 16 n
+玫瑰红色 15 n
+玫瑰色 37 n
+玫瑰花 104 n
+玫瑰露 12 n
+玫红毒素 3 n
+玮 382 nr
+环 4066 v
+环丁砜 3 nz
+环丙沙星 2 nz
+环丝氨酸 3 n
+环中 3 j
+环京津 3 ns
+环以外 3 l
+环伺 3 v
+环佩 19 n
+环保 1045 j
+环保主义者 2 n
+环保型 9 n
+环保局 66 j
+环保总局 2 n
+环保法 3 n
+环保网 3 n
+环保署 4 n
+环保车 3 n
+环保部 3 n
+环保部门 3 n
+环列 3 n
+环加氧酶 3 n
+环化 3 j
+环化酶 3 n
+环区 3 n
+环卫 90 j
+环卫处 3 n
+环卫局 2 n
+环卫工 3 n
+环卫工人 3 n
+环卫所 3 n
+环卫设备 3 n
+环卫队 3 n
+环县 9 ns
+环发 9 j
+环合 3 j
+环坐 3 v
+环型 8 n
+环城 52 n
+环城公路 3 n
+环城路 18 n
+环堵 3 j
+环堵萧然 3 z
+环境 16811 n
+环境与资源保护委员会 256 nt
+环境中工作 2 n
+环境中运行 2 nt
+环境优美 3 n
+环境保护 369 n
+环境保护局 11 n
+环境保护部 257 n
+环境保育 3 n
+环境光 4 n
+环境准则 3 n
+环境分析 3 n
+环境区划 3 n
+环境卫生 3 n
+环境危害 3 n
+环境压力 3 n
+环境参数 3 n
+环境友好 3 n
+环境变 7 n
+环境变量 3 n
+环境噪声 6 n
+环境因素 3 n
+环境容量 3 n
+环境宽松 3 nt
+环境工程 8 n
+环境异常 3 n
+环境影响 50 n
+环境恶劣 3 n
+环境效应 3 n
+环境效益 3 n
+环境映射 3 n
+环境景观 3 n
+环境标准 3 n
+环境模拟 3 v
+环境毒性 3 n
+环境污染 150 n
+环境污染问题 2 n
+环境治理 3 n
+环境法 26 n
+环境温度 49 n
+环境湿度 2 n
+环境演化 3 n
+环境监测 10 n
+环境空气 5 n
+环境署 24 n
+环境自净 3 n
+环境要素 10 n
+环境规划 3 n
+环境设备 3 n
+环境质量 3 n
+环境退化 3 n
+环境遥感 3 n
+环境部 7 n
+环外氨基 3 nz
+环天线 3 n
+环子 2 n
+环孔 3 n
+环孔片层 3 n
+环孢素 3 nz
+环孢菌素 3 nz
+环宇 7 n
+环层带 3 n
+环山 97 n
+环山公路 3 n
+环岛 347 n
+环岛旅行 3 nt
+环岛游 3 n
+环岛路 3 n
+环己基 3 nz
+环己烷 21 nz
+环己酮 19 nz
+环己醇 4 nz
+环市路 3 n
+环带 3 n
+环幕 5 n
+环形 227 n
+环形交叉 3 n
+环形卡环 3 n
+环形展开 3 l
+环形山 51 n
+环形阵 3 n
+环形限制 3 n
+环志 8 n
+环戊二烯 13 nz
+环扣 2 n
+环抱 185 n
+环控制 4 n
+环斑 3 n
+环星 3 n
+环晕效应 3 n
+环木脂体 3 n
+环核苷酸 3 n
+环比 22 j
+环氧 19 n
+环氧丙烷 12 nz
+环氧乙烷 26 nz
+环氧化物 2 n
+环氧树脂 23 n
+环氧氯丙烷 2 nz
+环水 3 n
+环江 12 ns
+环江毛南族自治县 7 ns
+环河 3 n
+环河北路 3 ns
+环河南路 3 ns
+环法赛 3 j
+环流 333 n
+环流器 3 n
+环流量 3 n
+环海 3 ns
+环渤海 17 ns
+环渤海地区 20 ns
+环游 30 j
+环游世界 3 n
+环湖 24 n
+环湖公路 3 n
+环湖赛 3 j
+环烷 3 n
+环烷烃 3 n
+环烷酸 3 nz
+环状 190 n
+环状注水 3 n
+环状管网 3 n
+环状绿型 3 n
+环状软骨 2 l
+环环 11 n
+环环相扣 23 l
+环球 504 n
+环球军事 3 n
+环球小姐 3 n
+环球旅行 3 nt
+环球时报 3 n
+环球网 17 n
+环球航空公司 2 nt
+环球通 3 n
+环生 3 n
+环磷酰胺 24 nz
+环礁 85 n
+环秀山庄 3 ns
+环空压力 3 n
+环空闸板 3 n
+环糊精 3 n
+环纹 33 n
+环线 132 n
+环线法 3 n
+环绕 929 v
+环绕声 3 n
+环绕盘旋 3 n
+环绕着 3 l
+环绕速度 3 n
+环网柜 3 n
+环翠区 3 n
+环肥燕瘦 3 n
+环肽 3 n
+环腺苷酸 3 n
+环节 1626 n
+环节动物 34 n
+环节税 3 n
+环蚀 3 n
+环行 39 j
+环行交叉 3 n
+环行器 2 n
+环行纤维 3 l
+环行线 3 n
+环衬 3 n
+环视 77 j
+环评 5 j
+环路 66 n
+环跳 28 v
+环道 3 n
+环链 3 n
+环锭 11 n
+环锯 2 n
+环阻 3 n
+环面 3 n
+环靶 3 n
+环顾 233 v
+环顾四周 3 j
+环颈雉 8 n
+环食 5 n
+环鸟苷酸 3 n
+现 8541 tg
+现下 3 t
+现丑 6 t
+现世 194 t
+现世宝 3 n
+现世报 3 n
+现世现报 3 n
+现买 3 v
+现买现卖 5 n
+现予 3 v
+现今 947 t
+现代 9035 t
+现代主义 130 n
+现代五项 11 n
+现代人 309 n
+现代修正 3 n
+现代农业 3 n
+现代出版社 5 nt
+现代化 6157 vn
+现代医学 3 nt
+现代史 51 n
+现代性 54 n
+现代感 5 n
+现代戏 68 n
+现代战争 3 n
+现代文 3 n
+现代文学 3 n
+现代文明 3 n
+现代汉 13 n
+现代汉语 3 n
+现代派 91 n
+现代版 3 vn
+现代科学 3 nt
+现代科技 3 n
+现代级 3 vn
+现代舞 65 n
+现代舞团 3 n
+现代诗 3 n
+现代诗歌 3 n
+现代资本 3 n
+现代集团 7 nt
+现价 12 n
+现任 719 n
+现值 15 n
+现像 3 n
+现况 32 n
+现况报导 3 n
+现出 483 v
+现出原形 3 n
+现制性 3 n
+现券 3 n
+现势 3 n
+现卖 3 v
+现原形 3 n
+现名 162 n
+现因 3 n
+现在 34145 t
+现在押 3 v
+现地 16 n
+现场 4077 n
+现场会 54 n
+现场会议 3 n
+现场办公 3 n
+现场图 3 n
+现场实验 3 n
+现场感 5 n
+现场报导 3 n
+现场报道 3 n
+现场测定 3 n
+现场版 3 v
+现场直播 3 n
+现场表演 3 n
+现场转播 3 n
+现场采访 3 n
+现址 21 n
+现大洋 5 n
+现如今 45 t
+现存 1543 n
+现学 3 n
+现学现卖 3 n
+现学现教 3 n
+现学现用 3 n
+现实 5080 n
+现实主义 559 n
+现实主义者 26 n
+现实存在 3 l
+现实性 115 n
+现实情况 3 n
+现实意义 3 n
+现实感 11 n
+现实斗争 3 n
+现实派 3 n
+现实状况 3 n
+现实生活 3 n
+现实表现 3 i
+现寄 3 v
+现就职 3 n
+现就读 3 l
+现局 3 n
+现居 3 n
+现已 1053 d
+现已查明 3 n
+现已证实 3 n
+现年 124 t
+现当代 36 t
+现形 26 n
+现形记 3 n
+现役 784 n
+现役军人 3 n
+现役军官 3 n
+现成 423 v
+现成活 3 n
+现成话 3 n
+现成饭 2 n
+现我司 3 n
+现房 17 n
+现政府 12 nt
+现政权 11 n
+现时 210 t
+现时代 6 t
+现有 2679 b
+现有人口 3 n
+现有企业 3 n
+现期 3 t
+现期杂志 3 n
+现查 3 vn
+现查明 3 n
+现楼 3 n
+现款 44 n
+现款结存 3 n
+现汇 10 n
+现法 3 n
+现洋 15 n
+现洋钱 3 n
+现浇 3 n
+现浇板 3 n
+现炒现卖 3 n
+现照 3 n
+现状 1241 n
+现状及 3 n
+现用 3 n
+现眼 7 n
+现磨 3 v
+现经 3 d
+现经审查 3 n
+现而今 2 n
+现职 25 n
+现蕾期 3 n
+现行 1583 n
+现行制度 3 n
+现行政策 3 n
+现行标准 3 n
+现行案件 3 n
+现行法 5 n
+现行法令 3 n
+现行犯 9 n
+现话 3 n
+现调机 34 n
+现象 9054 n
+现象学 66 n
+现象界 3 n
+现货 102 n
+现货交易 3 n
+现货价 3 n
+现货供应 3 n
+现贷价格 3 n
+现身 262 n
+现身说法 53 n
+现进现出 3 n
+现量 3 n
+现金 1029 n
+现金买卖 3 n
+现金交易 3 n
+现金价格 3 n
+现金会计 3 n
+现金余额 3 n
+现金帐 3 n
+现金支付 3 n
+现金支票 3 n
+现金流 3 n
+现金流量 3 n
+现金管理 3 n
+现金结算 3 n
+现金账 3 n
+现金配股 3 n
+现金额 10 n
+现钞 27 n
+现钟不打 3 i
+现钟弗打 3 i
+现钱 63 n
+现钱交易 3 n
+现阶段 243 t
+现露 3 t
+现饭 3 n
+玲 162 nr
+玲日 4 i
+玲星 13 a
+玲月 3 i
+玲玲 3 i
+玲珑 384 a
+玲珑剔透 42 i
+玲珑塔 3 i
+玲珑透漏 3 i
+玳 27 n
+玳玳花 4 n
+玳瑁 75 n
+玷 11 zg
+玷汙 3 v
+玷污 84 v
+玷点 3 v
+玷辱 31 v
+玹 301 zg
+玺 230 ng
+玺印 23 n
+玻 377 n
+玻利瓦 2 ns
+玻利瓦尔 80 nrt
+玻利瓦尔城 5 nrt
+玻利维亚 210 ns
+玻利维亚共和国 5 ns
+玻利维亚政府 2 nt
+玻化砖 3 n
+玻壳 31 n
+玻尔 171 nrt
+玻尔兹曼 3 nrt
+玻尔磁子 3 n
+玻恩近似 3 l
+玻片 12 n
+玻特喇叭 3 n
+玻璃 1985 n
+玻璃丝 5 n
+玻璃丝袜 3 n
+玻璃产品 3 n
+玻璃仪器 3 n
+玻璃体 40 n
+玻璃制品 3 n
+玻璃包装 3 n
+玻璃化 3 n
+玻璃匠 3 n
+玻璃厂 20 n
+玻璃器皿 3 n
+玻璃垫 3 n
+玻璃墙 6 n
+玻璃封装 3 n
+玻璃屋 3 n
+玻璃工艺 3 n
+玻璃市 3 n
+玻璃幕墙 3 n
+玻璃弹珠 3 n
+玻璃心 3 n
+玻璃房 3 n
+玻璃机械 3 n
+玻璃杯 51 n
+玻璃板 38 n
+玻璃柜 2 n
+玻璃框 3 n
+玻璃棉 3 n
+玻璃棒 15 n
+玻璃水 3 n
+玻璃沫 3 n
+玻璃灯 3 n
+玻璃片 18 n
+玻璃状 3 n
+玻璃珠 2 n
+玻璃球 24 n
+玻璃瓦 3 ns
+玻璃瓶 107 n
+玻璃盆 3 n
+玻璃砖 4 n
+玻璃碗 3 n
+玻璃碳 3 n
+玻璃碴 8 l
+玻璃窗 134 n
+玻璃筒 3 n
+玻璃管 3 n
+玻璃粉 3 n
+玻璃纤维 71 l
+玻璃纱 3 n
+玻璃纸 15 n
+玻璃缸 7 n
+玻璃罐 3 n
+玻璃网 3 n
+玻璃罩 15 n
+玻璃胶 3 n
+玻璃花 3 n
+玻璃茶几 3 n
+玻璃设备 3 n
+玻璃试管 3 n
+玻璃质 3 n
+玻璃钢 44 n
+玻璃镜 12 n
+玻璃门 45 n
+玻纤布 3 n
+玻色子 46 n
+玻里尼西 3 nrt
+珀 146 nrt
+珀塞尔 10 nrt
+珀尔 15 nrt
+珀尔曼 2 nrt
+珀思 3 nrt
+珀斯 87 nrt
+珀蒂 11 nrt
+珀西 2 nrt
+珀西瓦尔 2 nrt
+珀迪 2 nz
+珀金 13 nrt
+珀金斯 13 nrt
+珂 1043 nrfg
+珂罗版 2 vn
+珅 189 zg
+珈 273 g
+珉 2 nr
+珊 1892 n
+珊德 32 nrt
+珊湖 3 n
+珊珊来迟 3 i
+珊瑚 758 n
+珊瑚公园 2 n
+珊瑚在网 3 n
+珊瑚岛 83 n
+珊瑚树 53 n
+珊瑚滩 2 n
+珊瑚潭 3 n
+珊瑚石 3 n
+珊瑚礁 293 n
+珊瑚虫 56 n
+珊瑚鱼 2 n
+珊蝴礁 3 v
+珊蝴虫 3 vn
+珌 9 zg
+珍 1183 zg
+珍产淫货 3 nz
+珍味 3 n
+珍品 1054 n
+珍品展 2 n
+珍奇 97 a
+珍奥 3 nrt
+珍妮 20 nrt
+珍妮佛 3 nrt
+珍妮弗 3 nrt
+珍妮特 2 nrt
+珍妮花 3 n
+珍存 3 v
+珍宝 315 nz
+珍宝岛 26 ns
+珍宝馆 3 n
+珍异 69 a
+珍惜 511 a
+珍摄 3 v
+珍本 27 a
+珍楼宝屋 3 nz
+珍爱 108 a
+珍物 3 n
+珍玩 24 a
+珍珠 862 n
+珍珠云母 3 nz
+珍珠园 3 n
+珍珠奶茶 3 n
+珍珠岩 31 n
+珍珠店 3 n
+珍珠梅 2 nz
+珍珠棉 3 n
+珍珠母 3 n
+珍珠泉 15 nz
+珍珠港 140 ns
+珍珠港事件 28 nz
+珍珠白 3 nz
+珍珠米 4 n
+珍珠粉 53 nz
+珍珠粟 3 n
+珍珠草 3 nz
+珍珠贝 33 nz
+珍珠项链 3 nz
+珍珠首饰 3 n
+珍珠鸟 3 n
+珍珠鸡 11 n
+珍禽 49 n
+珍禽奇兽 3 i
+珍禽异兽 34 i
+珍秘 3 a
+珍稀 1282 a
+珍稀动物 3 i
+珍羞 4 a
+珍肴异馔 3 n
+珍膳 3 nrt
+珍藏 231 ns
+珍藏册 3 n
+珍藏品 5 n
+珍藏密敛 3 i
+珍藏本 3 ns
+珍藏版 3 n
+珍藏集 3 ns
+珍视 75 v
+珍贵 1394 a
+珍贵性 3 n
+珍贵文物 3 i
+珍赏 3 v
+珍重 86 a
+珍重再见 3 i
+珍闻 5 n
+珍馐 40 n
+珍馐美味 3 nz
+珍馐美馔 3 n
+珎 4 zg
+珏 3 g
+珐 59 n
+珐琅 65 n
+珐琅质 20 n
+珐瑯 3 n
+珐瑯琏 3 n
+珐瑯质 3 n
+珑 110 x
+珒 41 zg
+珓 4 zg
+珗 150 zg
+珘 4 zg
+珙 15 n
+珙县 8 ns
+珙桐 66 n
+珛 123 zg
+珜 11 zg
+珞 1569 nz
+珞巴 14 nz
+珞巴族 37 nz
+珞狮 768 nz
+珞珈 256 nrt
+珞珈山 3 ns
+珟 224 zg
+珠 2668 ng
+珠三角 107 nz
+珠儿 31 n
+珠光 32 nz
+珠光体 8 n
+珠光宝气 46 nz
+珠光灯 3 nz
+珠光粉 3 nz
+珠兰 7 ns
+珠围翠拥 3 i
+珠围翠绕 5 i
+珠圆玉洁 3 i
+珠圆玉润 6 n
+珠子 239 n
+珠子参 3 n
+珠孔 3 n
+珠孔受精 3 nz
+珠宝 773 nz
+珠宝商 16 nz
+珠宝展 3 nz
+珠宝市 4 ns
+珠宝店 32 ns
+珠宝箱 3 nz
+珠宝网 3 nz
+珠宝翠钻 3 n
+珠宝行 3 j
+珠宝饰品 3 n
+珠宝首饰 3 nz
+珠宫贝阙 3 n
+珠山 3 ns
+珠山区 3 ns
+珠峰 135 ns
+珠帘 84 n
+珠影 3 n
+珠心 7 n
+珠心算 3 i
+珠托 3 ns
+珠晖区 3 nz
+珠林 6 nz
+珠枣 3 n
+珠槃玉敦 3 ns
+珠歌 3 n
+珠歌翠舞 3 i
+珠母 61 n
+珠江 801 ns
+珠江三角 3 nz
+珠江三角洲 154 ns
+珠江口 67 ns
+珠江口盆地 2 ns
+珠江流域 64 ns
+珠江电影制片厂 3 nt
+珠江网 3 nz
+珠江路 3 ns
+珠沉沧海 3 i
+珠沉玉碎 3 i
+珠沉玉磒 3 i
+珠沉璧碎 3 i
+珠泪 39 n
+珠泪盈眶 4 n
+珠流璧转 3 i
+珠海 366 ns
+珠海国际赛车场 2 ns
+珠海市 42 ns
+珠海站 5 ns
+珠海航展 3 nz
+珠玉 68 nz
+珠玉在侧 3 i
+珠玉在前 3 i
+珠玑 16 nz
+珠珠 2 nz
+珠琴 4 nz
+珠璧交辉 3 i
+珠璧联辉 3 ns
+珠盘玉敦 3 ns
+珠研磨机 3 nz
+珠穆 3 ns
+珠穆朗玛 37 nz
+珠穆朗玛峰 179 ns
+珠窗网户 3 i
+珠箔银屏 3 n
+珠算 37 n
+珠算课 3 n
+珠纹 3 nz
+珠翠 31 n
+珠翠之珍 3 i
+珠联玉映 3 i
+珠联璧合 21 ns
+珠联譬合 3 z
+珠胎 3 n
+珠胎暗结 3 i
+珠芽 3 n
+珠落玉盘 2 i
+珠蚌 8 n
+珠蛋白 3 n
+珠规玉矩 3 i
+珠贝 5 nz
+珠辉玉映 3 i
+珠连璧合 3 i
+珠链 9 n
+珠零玉落 3 i
+珠饰 3 n
+珠饰品 3 n
+珠黄 3 nz
+珡 3 zg
+珣 20 zg
+珥 15 zg
+珥陵镇 3 v
+珦 9 zg
+珧 2 g
+珩 267 g
+珩磨 8 v
+珪 336 zg
+珪璋特达 3 nr
+珫 20 zg
+班 4674 n
+班上 189 s
+班为帝 3 nr
+班主 55 n
+班主任 526 n
+班举兵 3 nr
+班乃岛 2 nr
+班代 3 n
+班代表 3 n
+班会 25 n
+班会课 3 n
+班作势 2 n
+班克斯 10 nr
+班公湖 8 nr
+班公错 14 nr
+班刊 3 n
+班列 13 n
+班别 3 n
+班前会 3 nr
+班副将 2 n
+班功行赏 3 n
+班加拉 4 nr
+班加罗尔 39 ns
+班加苏 2 ns
+班加西 19 nr
+班务 3 n
+班务会 2 n
+班勇发 2 nr
+班勇攻 2 nr
+班卓琴 2 nr
+班厦 3 n
+班古拉 7 nrt
+班吉 43 nr
+班启奏 6 nr
+班固 28 nr
+班固积 2 n
+班固著 2 nr
+班图人 39 nr
+班图尼 2 nr
+班图恩 2 nr
+班图斯 5 nr
+班塞尔 2 nr
+班士子 3 nr
+班大太监 2 nr
+班失仪 2 nr
+班头 46 n
+班委 8 n
+班委会 6 n
+班婕妤 9 nr
+班子 553 n
+班子成员 3 n
+班定姓 2 n
+班宿卫 9 nr
+班封疆 3 ns
+班尼亚 3 nr
+班尼克 2 nr
+班尼汗 5 nr
+班尼路 3 nz
+班巴拉 4 nrt
+班巴河 2 nr
+班布戈 2 nr
+班师 126 n
+班师北 4 nr
+班师回 3 nr
+班师回俯 3 nr
+班师回朝 13 nr
+班师得胜 3 nr
+班师振旅 3 nr
+班干部 15 n
+班底 20 n
+班廷 8 n
+班张迪 10 nr
+班彪续 2 nr
+班役 6 n
+班徐宁 2 nr
+班得瑞 3 nr
+班戈 19 nr
+班戈县 6 nr
+班房 37 n
+班承开 2 nr
+班招生 3 nr
+班数 3 n
+班文臣 4 nr
+班智达 3 nr
+班有钱 2 n
+班朝贺 2 nr
+班期 3 n
+班本杜 4 nr
+班机 130 n
+班杜拉 2 nrt
+班查尔 2 nr
+班格拉 5 nr
+班次 96 n
+班点 3 n
+班玛 3 nr
+班玛县 3 nr
+班珠尔 14 nr
+班班 3 n
+班班可考 3 l
+班禅 100 nr
+班禅额尔 3 nr
+班禅额尔德尼 19 nr
+班科 3 nz
+班第兵 2 nr
+班第参 2 nr
+班级 238 n
+班线 7 n
+班组 41 n
+班组长 8 n
+班结业 3 n
+班联入 2 n
+班船 3 n
+班花 3 n
+班荆道故 3 i
+班荆道旧 3 nr
+班荆馆 3 nr
+班行礼 3 nr
+班行章 3 nr
+班衣戏采 3 n
+班规 3 n
+班言官 2 nr
+班详稳 2 nr
+班贝格 3 nr
+班费 3 n
+班超 84 nr
+班超之 2 nr
+班超复 2 nr
+班超欲 2 nr
+班车 93 n
+班轮 90 n
+班辈 3 n
+班达亚齐 2 nr
+班达尔 2 nr
+班达拉奈克 10 ns
+班达海 7 nr
+班迪安 43 nr
+班迪教 4 nz
+班都斯山 3 ns
+班里 122 s
+班长 556 n
+班门弄斧 32 i
+班队 3 n
+班集体 11 n
+班香宋艳 3 nr
+班马文章 3 nr
+班驳 3 nr
+班驳陆离 3 n
+班鸠 3 nrt
+珮 332 nr
+珯 86 zg
+珰 523 zg
+珲 96 ns
+珲春 34 ns
+珲春县 3 ns
+珲春市 9 ns
+珴 3 zg
+珵 39 zg
+珶 60 zg
+珷 32 zg
+珹 3 zg
+珺 7 zg
+珽 10 zg
+現 9 zg
+球 5650 n
+球会 7 n
+球体 115 n
+球僮 3 n
+球儿 3 n
+球化剂 3 n
+球半径 3 n
+球友 3 n
+球台 21 n
+球员 1771 n
+球囊 12 n
+球团 5 n
+球团矿 3 n
+球场 601 n
+球场上 3 n
+球坛 2 n
+球坛上 3 l
+球型 12 n
+球墨铸铁 14 l
+球季 3 n
+球局 3 n
+球差 10 n
+球市 30 n
+球形 382 n
+球形牙 3 n
+球形物 3 n
+球径 3 n
+球径计 3 l
+球心 15 n
+球手 34 n
+球技 35 n
+球报杯 3 n
+球拍 47 n
+球探网 3 n
+球接头 3 n
+球星 201 n
+球杆 9 n
+球果 53 n
+球架 3 n
+球根 24 n
+球根植物 3 l
+球根海棠 3 n
+球棍 3 n
+球棒 4 n
+球焊 3 n
+球状 168 n
+球状体 3 n
+球状物 3 n
+球状鼻 3 l
+球王 17 n
+球瘾 3 n
+球磨机 5 n
+球票 35 n
+球童 11 n
+球竿 3 n
+球籍 2 n
+球类 58 n
+球类室 2 n
+球类运动 3 l
+球粒 33 n
+球罐 3 n
+球网 38 n
+球胆 3 n
+球艺 14 n
+球花 39 n
+球芽 3 n
+球茎 66 n
+球茎甘蓝 3 l
+球菌 89 n
+球藻 3 n
+球虫 6 n
+球虫病 3 n
+球蛋白 125 l
+球衣 81 n
+球衫 3 n
+球裤 5 n
+球证 3 n
+球赛 48 n
+球越过 3 l
+球路 3 n
+球轴承 4 l
+球运 3 n
+球迷 1174 n
+球速 7 n
+球道 37 n
+球部 4 n
+球钻 3 n
+球门 211 n
+球门区 4 n
+球门发球 3 n
+球门员 3 n
+球门柱 3 n
+球门线 16 n
+球阀 7 n
+球队 2238 n
+球面 150 n
+球面三角 3 n
+球面丛 3 n
+球面体 3 n
+球面几何 3 l
+球面摆 3 n
+球面波 3 n
+球面表示 3 n
+球面角 3 n
+球面象差 3 n
+球面镜 8 n
+球面阵 3 n
+球鞋 62 n
+球风 17 n
+球馆 40 n
+球龄 3 n
+琅 300 ns
+琅勃拉邦 16 ns
+琅嬛福地 3 ns
+琅孉 3 z
+琅玕 3 z
+琅琅 2 i
+琅琅上口 16 i
+琅琅的 3 z
+琅琊区 3 z
+琅琊山 3 vn
+琅璫入狱 3 i
+理 6890 n
+理上 3 n
+理不忘乱 3 i
+理不胜辞 3 i
+理之当然 3 i
+理事 451 n
+理事会 498 n
+理事单位 3 n
+理事国 148 n
+理事长 471 n
+理亏 62 v
+理亏心虚 3 i
+理会 1349 n
+理光 5 n
+理光头 3 n
+理入 2 v
+理冤摘伏 3 i
+理出 3 v
+理则 3 n
+理则学 3 n
+理到 3 v
+理化 108 v
+理化生 3 n
+理去 3 v
+理县 11 n
+理发 94 v
+理发业 3 n
+理发匠 5 n
+理发厅 3 n
+理发员 3 n
+理发器 3 n
+理发室 2 n
+理发师 120 n
+理发店 85 n
+理发院 3 n
+理发馆 7 n
+理合 17 v
+理喻 15 n
+理器 4 n
+理塘 15 n
+理塘县 3 ns
+理头 3 n
+理头发 3 i
+理好 3 v
+理学 531 n
+理学博士 3 n
+理学士 31 n
+理学家 3 n
+理学院 58 n
+理完 3 v
+理宗 3 n
+理定 3 v
+理家 3 n
+理容 3 n
+理容中心 3 l
+理容师 3 n
+理容院 3 n
+理屈 8 v
+理屈心虚 3 i
+理屈词穷 8 i
+理屈辞穷 3 i
+理工 490 n
+理工农 3 n
+理工大 2 n
+理工大学 112 nt
+理工学 3 n
+理工学院 1214 nt
+理工科 85 n
+理工类 3 n
+理平头 3 n
+理应 617 v
+理式 3 n
+理当 66 v
+理当如此 4 l
+理得 3 v
+理念 1204 n
+理性 1949 n
+理性主义 64 n
+理性分析 3 l
+理性化 25 n
+理性认识 51 l
+理想 3988 n
+理想主义 63 n
+理想主义者 23 n
+理想信念 3 n
+理想化 81 n
+理想国 218 n
+理想城市 3 n
+理想境界 3 n
+理想媒质 3 n
+理想实验 3 l
+理想家 17 n
+理想弓 3 i
+理想气体 3 n
+理想流体 3 n
+理想的积 3 l
+理想约束 3 i
+理想钟 3 l
+理成 3 v
+理所不容 3 i
+理所应当 63 i
+理所当然 358 i
+理所必然 3 i
+理无常是 3 i
+理智 1007 n
+理智型 2 n
+理智感 3 n
+理曲 3 n
+理查 3 v
+理查兹 10 nr
+理查得 3 n
+理查德 81 n
+理查德森 3 nrt
+理查森 24 nr
+理正词直 3 i
+理毛行为 3 n
+理气 73 n
+理气止痛 3 n
+理法 3 n
+理清 62 v
+理理 3 n
+理由 3333 n
+理疗 78 n
+理疗仪 3 n
+理疗科 3 n
+理疗部 3 n
+理监事 3 n
+理直气壮 212 i
+理睬 451 v
+理短 3 v
+理科 391 n
+理科大学 3 nt
+理科状元 3 n
+理科班 4 n
+理科生 31 n
+理算 3 v
+理肤泉 3 n
+理舱 3 n
+理解 5620 v
+理解万岁 3 n
+理解内容 3 n
+理解力 16 n
+理解消化 3 n
+理解能力 3 n
+理解课文 3 n
+理论 15973 n
+理论体系 3 n
+理论依据 3 i
+理论修养 3 n
+理论值 10 n
+理论化 24 n
+理论家 217 n
+理论工作者 28 n
+理论思考 3 l
+理论性 36 n
+理论意义 3 l
+理论战线 3 n
+理论指导 3 n
+理论物理 47 n
+理论物理学 20 n
+理论物理研究所 12 nt
+理论界 60 n
+理论知识 3 i
+理论研究室 7 n
+理论素养 3 n
+理论误差 3 l
+理论课 17 n
+理该 3 v
+理财 662 v
+理财专家 3 l
+理财产品 3 n
+理财师 3 n
+理财网 3 i
+理财金 3 n
+理货 2 n
+理货单 3 n
+理货员 3 n
+理赔 60 v
+理赔金 3 n
+理起 3 v
+理趣 9 n
+理路 15 n
+理过 3 v
+理过其辞 3 i
+理过去 3 v
+理过来 3 l
+理顺 146 v
+琇 51 zg
+琉 226 ns
+琉善 3 ns
+琉特琴 16 nz
+琉球 63 n
+琉球人 3 n
+琉球屿 3 n
+琉球王国 7 ns
+琉球群岛 47 ns
+琉璃 454 n
+琉璃仙 3 n
+琉璃厂 73 n
+琉璃塔 3 nz
+琉璃寺 3 ns
+琉璃河 50 ns
+琉璃灯 3 n
+琉璃球 2 n
+琉璃瓦 1377 ns
+琊 53 g
+琍 17 zg
+琎 56 zg
+琏 167 g
+琐 247 ag
+琐事 97 n
+琐务 3 n
+琐呐 3 n
+琐尾流离 3 n
+琐屑 30 n
+琐物 3 n
+琐琐 3 a
+琐琐碎碎 3 z
+琐碎 153 a
+琐细 39 a
+琐言 3 n
+琐闻 7 n
+琓 29 zg
+琗 2 zg
+琘 4 zg
+琚 307 nr
+琛 583 g
+琛航岛 3 ns
+琡 3 zg
+琢 194 v
+琢成 3 v
+琢玉 3 l
+琢玉成器 3 l
+琢磨 900 v
+琢磨不透 15 l
+琣 3 zg
+琤 47 zg
+琥 11 zg
+琥珀 180 n
+琥珀抑制 3 n
+琥珀突变 3 n
+琥珀色 12 n
+琥珀酸 11 n
+琦 93 nr
+琦玉县 3 nr
+琨 9 g
+琨玉秋霜 3 nr
+琪 80 g
+琪琪 3 i
+琪花 3 i
+琪花玉树 3 i
+琪花瑶草 5 i
+琫 10 zg
+琬 14 g
+琮 48 g
+琯 37 zg
+琯溪 3 nz
+琰 22 g
+琲 3 zg
+琳 695 nrt
+琳娜 144 nrt
+琳琅 8 n
+琳琅满目 99 i
+琳琅触目 3 i
+琳瑯 3 nrt
+琳瑯满目 3 n
+琴 1718 n
+琴书 37 n
+琴健 3 n
+琴儿 3 n
+琴剑飘零 3 i
+琴台 519 n
+琴声 184 n
+琴家 9 n
+琴师 26 n
+琴弓 5 n
+琴弦 125 n
+琴心 3 n
+琴心剑胆 3 i
+琴房 7 n
+琴技 3 n
+琴挑文君 3 i
+琴断朱弦 3 i
+琴曲 46 n
+琴杆 3 n
+琴架 3 n
+琴柱 3 n
+琴棋书画 46 n
+琴槌 3 n
+琴歌酒赋 3 n
+琴瑟 27 nrt
+琴瑟不调 3 n
+琴瑟之好 3 n
+琴瑟和好 3 n
+琴瑟和鸣 3 n
+琴瑟失调 3 n
+琴瑟调和 3 n
+琴科 3 nrt
+琴童 3 n
+琴筒 3 n
+琴箫 3 n
+琴絃 3 ns
+琴纳 16 nrt
+琴艺 3 n
+琴行 13 n
+琴调 3 n
+琴谱 69 n
+琴趣 3 n
+琴酒 3 n
+琴钟 3 n
+琴键 31 n
+琴音 52 n
+琴韵 29 n
+琴颈 3 n
+琴马 3 n
+琴鸟 21 n
+琵 91 n
+琵琶 540 n
+琵琶别弄 3 ns
+琵琶别抱 3 n
+琵琶半 3 n
+琵琶旧语 3 n
+琵琶曲 12 n
+琵琶湖 7 ns
+琵琶胡语 3 n
+琵琶行 3 n
+琵琶骨 42 n
+琵琶鱼 3 n
+琵音 3 n
+琶 64 zg
+琺 4 zg
+琼 464 ns
+琼中 11 nrt
+琼中黎族苗族自治县 2 ns
+琼剧 4 n
+琼华 3 nz
+琼厨金穴 3 ns
+琼尼 16 nrt
+琼山 28 ns
+琼山区 3 ns
+琼山县 8 ns
+琼山市 11 ns
+琼岛 9 ns
+琼岛春云 3 ns
+琼崖 68 ns
+琼州 21 ns
+琼州海峡 35 ns
+琼斯 251 nrt
+琼林 3 nz
+琼林玉树 3 nr
+琼林玉质 3 nr
+琼枝玉叶 3 nr
+琼枝玉树 3 nr
+琼森 10 nrt
+琼楼 3 ns
+琼楼玉宇 135 nr
+琼楼玉立 3 nr
+琼楼金阙 3 nr
+琼浆 13 n
+琼浆玉液 7 i
+琼浆玉露 3 i
+琼浆金液 3 n
+琼海 18 ns
+琼海县 3 ns
+琼海市 5 ns
+琼瑶 30 nr
+琼筵 3 n
+琼结 8 nrt
+琼结县 5 ns
+琼胶 14 nz
+琼脂 23 ns
+琼脂凝胶 3 n
+琼脂糖 3 n
+琼花 18 nz
+琼英 3 nrt
+琼麻 3 nz
+琿 7 zg
+瑀 30 zg
+瑁 208 x
+瑄 34 zg
+瑆 7 zg
+瑇 6 zg
+瑍 2 zg
+瑑 2 zg
+瑔 3 zg
+瑕 943 n
+瑕不掩瑜 4 i
+瑕不揜瑜 3 i
+瑕垢 3 n
+瑕点 3 n
+瑕瑜 3 i
+瑕瑜互见 2 i
+瑕疵 59 n
+瑕疵品 3 v
+瑕隙 3 n
+瑗 154 g
+瑙 812 nrt
+瑙姆堡 5 nrt
+瑙曼 10 nrt
+瑙鲁 47 nrt
+瑚 16 x
+瑚琏之器 3 v
+瑚礁 3 n
+瑛 403 g
+瑜 1671 nr
+瑜不掩瑕 3 z
+瑜不揜瑕 3 n
+瑜伽 175 n
+瑜伽功 3 n
+瑜珈 23 n
+瑜珈术 3 v
+瑜百瑕一 3 vn
+瑝 3 zg
+瑞 766 ns
+瑞丽 21 nr
+瑞丽县 3 ns
+瑞丽市 12 ns
+瑞云 2 ns
+瑞兆 3 nz
+瑞克 2 ns
+瑞克斯 3 nr
+瑞典 1343 ns
+瑞典人 48 nr
+瑞典克朗 4 ns
+瑞典公司 2 nt
+瑞典政府 5 nt
+瑞典文 3 nr
+瑞典文学院 4 nt
+瑞典王国 3 ns
+瑞典皇家科学院 12 nt
+瑞典议会 2 nt
+瑞典话 3 n
+瑞典语 34 nz
+瑞典队 54 nt
+瑞兽 5 nr
+瑞切尔 3 nr
+瑞利 27 ns
+瑞利散射 3 nz
+瑞卡 2 ns
+瑞士 1585 ns
+瑞士人 32 nrt
+瑞士军刀 3 nr
+瑞士刀 3 nr
+瑞士制 2 nr
+瑞士政府 3 nt
+瑞士法郎 19 nr
+瑞士籍 4 nr
+瑞士联合银行 3 nt
+瑞士联邦 16 nt
+瑞士航空公司 5 nt
+瑞士银行 6 nt
+瑞士队 5 nt
+瑞大林 3 nr
+瑞婆婆 16 nr
+瑞宁 2 ns
+瑞安 35 ns
+瑞安县 3 ns
+瑞安市 6 ns
+瑞宾 7 ns
+瑞尔 7 ns
+瑞岩 2 ns
+瑞康 3 ns
+瑞德 10 nrt
+瑞恰兹 3 nr
+瑞拉 8 nrt
+瑞文 3 nz
+瑞斯 8 ns
+瑞昌 21 ns
+瑞昌市 2 ns
+瑞星 45 nz
+瑞星杀毒软件 2 n
+瑞格 4 nrt
+瑞气 45 n
+瑞气盈门 3 n
+瑞气祥云 3 nr
+瑞波 2 ns
+瑞琪儿 3 nr
+瑞穗 3 nr
+瑞穗乡 2 ns
+瑞签 3 nr
+瑞索 3 ns
+瑞芳 19 nr
+瑞蚨祥 7 nz
+瑞贝卡 14 nr
+瑞金 134 ns
+瑞金医院 5 nt
+瑞金县 4 ns
+瑞金市 9 ns
+瑞金路 3 nr
+瑞银 38 j
+瑞隆 2 ns
+瑞雪 30 nr
+瑞雪兆 3 nr
+瑞雪兆丰年 4 nr
+瑞雪飘飘 3 nr
+瑞顿 7 ns
+瑞香 12 nr
+瑟 305 ng
+瑟夫 8 nrt
+瑟斯 2 nrt
+瑟瑟 144 z
+瑟瑟发料 3 ns
+瑟瑟秋风 3 ns
+瑟缩 37 v
+瑟缩着 3 v
+瑟罗 3 nrt
+瑟调琴弄 3 vn
+瑧 234 zg
+瑩 4 zg
+瑪 20 zg
+瑭 24 g
+瑮 8 zg
+瑯 8 zg
+瑰 917 n
+瑰丽 96 z
+瑰伟 3 a
+瑰奇 3 n
+瑰姿 3 n
+瑰宝 88 n
+瑰异 3 z
+瑰意奇行 3 n
+瑰意琦行 3 vn
+瑰玮 2 a
+瑱 3 zg
+瑴 16 zg
+瑶 466 j
+瑶乡 2 nz
+瑶华 3 nz
+瑶台 22 n
+瑶台琼室 3 nz
+瑶台银阙 3 n
+瑶吃饭 3 i
+瑶家 40 n
+瑶寨 3 nz
+瑶山 35 ns
+瑶族 646 nz
+瑶族乡 3 ns
+瑶族自治县 6 ns
+瑶林玉树 3 ns
+瑶林琼树 3 nz
+瑶民 8 n
+瑶池 59 n
+瑶池女使 3 n
+瑶池玉液 3 nz
+瑶海区 3 ns
+瑶琳 5 ns
+瑶草 3 nz
+瑶草奇花 2 nz
+瑶草琪花 2 n
+瑶草琪葩 3 n
+瑷 150 x
+瑺 2 zg
+瑾 111 nr
+璀 69 z
+璀灿 3 z
+璀璨 112 z
+璀璨夺目 11 l
+璁 1141 g
+璃 17 x
+璆 10 zg
+璇 2251 g
+璇宫 3 n
+璇玑 23 n
+璇霄丹台 3 nz
+璇霄丹阙 3 nr
+璈 59 zg
+璊 4 zg
+璋 583 g
+璎 3 n
+璎珞 19 n
+璐 322 nr
+璘 379 zg
+璜 64 nr
+璜塘镇 2 nr
+璝 36 zg
+璞 192 nr
+璞玉 3 n
+璞玉浑金 3 vn
+璞鼎查 14 n
+璟 104 zg
+璠 33 zg
+璡 3 zg
+璣 36 zg
+璥 4 zg
+璧 1537 zg
+璧人 3 ns
+璧合 3 ns
+璧合珠联 3 ns
+璧合珠连 3 ns
+璧坐玑驰 3 nr
+璧山 2 ns
+璧山县 3 ns
+璧月 3 ns
+璧炉台 3 v
+璧玉 3 ns
+璧谢 3 ns
+璨 18 g
+璨美 3 l
+璩 15 nr
+璩美凤 3 nr
+璪 8 zg
+璬 8 zg
+璭 56 zg
+璮 36 zg
+環 198 zg
+璵 4 zg
+璺 729 zg
+璿 8 zg
+瓄 2 zg
+瓉 4 zg
+瓊 16 zg
+瓌 5 zg
+瓍 5 zg
+瓏 4 zg
+瓐 4 zg
+瓑 159 zg
+瓒 247 nr
+瓔 24 zg
+瓕 12 zg
+瓖 41 zg
+瓘 37 zg
+瓙 1030 zg
+瓚 3 zg
+瓛 2 zg
+瓜 877 n
+瓜亚基尔 24 nrt
+瓜仁 9 n
+瓜代 3 n
+瓜农 7 nrt
+瓜分 493 n
+瓜分豆剖 3 i
+瓜剖豆分 3 n
+瓜区豆分 3 n
+瓜园 3 n
+瓜圃 3 n
+瓜地马拉 3 ns
+瓜子 428 n
+瓜子仁 4 n
+瓜子儿 6 n
+瓜子壳 10 n
+瓜子皮 3 n
+瓜子脸 44 n
+瓜子金 3 n
+瓜字初分 3 n
+瓜尔 12 nrt
+瓜岛 9 ns
+瓜州 35 ns
+瓜市 3 ns
+瓜干 21 n
+瓜德罗普 22 nrt
+瓜德罗普岛 12 nrt
+瓜拉尼 11 nrt
+瓜拱 3 nz
+瓜挠 3 v
+瓜时 3 n
+瓜期 3 n
+瓜李之嫌 3 n
+瓜果 186 n
+瓜架 3 n
+瓜核 3 n
+瓜棚 13 n
+瓜氨酸 3 n
+瓜洲镇 3 ns
+瓜熟蒂落 28 i
+瓜片 15 n
+瓜瓜 3 n
+瓜瓞绵绵 3 z
+瓜瓣 3 n
+瓜瓤 6 n
+瓜田 11 n
+瓜田之嫌 3 n
+瓜田李下 8 n
+瓜皮 33 n
+瓜皮帽 29 n
+瓜秧 12 v
+瓜类 3 n
+瓜籽 25 n
+瓜纳华托 2 ns
+瓜纳华托州 2 ns
+瓜维亚雷 3 nrt
+瓜肉 3 n
+瓜苗 3 n
+瓜葛 138 n
+瓜葛相连 3 ns
+瓜蒂 4 nrt
+瓜蒌子 3 v
+瓜蒌皮 3 vn
+瓜蔓 18 n
+瓜藤 3 nrt
+瓜豆 3 n
+瓜达尔 2 nrt
+瓜达尔卡纳尔 5 nrt
+瓜达尔卡纳尔岛 9 nrt
+瓜达尔基维尔河 4 nrt
+瓜达拉哈拉 13 nrt
+瓜连蔓引 3 n
+瓟 57 zg
+瓠 43 g
+瓠子 6 n
+瓢 183 n
+瓢儿 3 n
+瓢子 3 n
+瓢把子 3 n
+瓢泼 12 v
+瓢泼大雨 26 i
+瓢泼瓦灌 3 n
+瓢虫 73 n
+瓣 466 q
+瓣膜 95 n
+瓣膜病 3 n
+瓤 87 ng
+瓤子 15 n
+瓥 34 zg
+瓦 3228 nr
+瓦伊 4 nrt
+瓦伊纳 3 nr
+瓦伊莱 7 nr
+瓦伊迪 2 nr
+瓦伦丁 6 nr
+瓦伦斯 3 nr
+瓦伦纽 2 nr
+瓦伦西 3 nr
+瓦伦西亚 37 ns
+瓦克 31 nrt
+瓦克夫 6 nr
+瓦克斯 3 nr
+瓦克港 3 nr
+瓦克湾 2 nr
+瓦克语 2 nr
+瓦克达 2 nr
+瓦克锤 2 nr
+瓦全 5 nr
+瓦刀 4 nr
+瓦列利 2 nr
+瓦列莉 6 nr
+瓦列里 7 nrt
+瓦利 9 nrt
+瓦利德 3 nr
+瓦利拉 2 nrt
+瓦利斯 23 nr
+瓦剌兵 3 nr
+瓦剌军 30 nr
+瓦力 4 n
+瓦加 7 nrt
+瓦加斯 7 nr
+瓦加杜古 23 nrt
+瓦加诺 3 nr
+瓦努阿 3 nr
+瓦努阿图 72 nrt
+瓦努阿图共和国 4 ns
+瓦勒 4 nrt
+瓦勒伦 3 nr
+瓦勒拉 9 nrt
+瓦勒海 11 nr
+瓦匠 9 n
+瓦卡 2 nrt
+瓦卡罗尼 2 nrt
+瓦卢娃 3 nr
+瓦卢瓦 20 nr
+瓦合之卒 3 nr
+瓦哈卜 4 nr
+瓦哈卡 5 nr
+瓦器 9 n
+瓦器蚌盘 3 ns
+瓦圈 3 n
+瓦块 146 n
+瓦垄 3 nr
+瓦埠湖 6 nr
+瓦基亚 3 nr
+瓦塔 3 nrt
+瓦塔娜 4 nr
+瓦塔纳 2 nr
+瓦塞尔 5 nr
+瓦夫一世 3 nrt
+瓦头 3 n
+瓦子街 2 nr
+瓦官寺 2 nr
+瓦室 3 n
+瓦尔 24 nrt
+瓦尔代 9 nr
+瓦尔兰 5 nr
+瓦尔卡 3 nrt
+瓦尔基 8 nr
+瓦尔堡 4 nrt
+瓦尔塔 3 nrt
+瓦尔多 3 nrt
+瓦尔密 6 nr
+瓦尔帕莱索 12 nrt
+瓦尔德 34 nrt
+瓦尔德内尔 3 nrt
+瓦尔德海姆 6 nrt
+瓦尔德纳 3 nrt
+瓦尔托 2 nrt
+瓦尔拉 9 nrt
+瓦尔拉齐 3 nrt
+瓦尔斯 8 nrt
+瓦尔河 3 nr
+瓦尔泽 2 nr
+瓦尔派 2 nr
+瓦尔港 3 nr
+瓦尔特 39 nrt
+瓦尔瓦 2 nrt
+瓦尔登 23 nrt
+瓦尔登湖 7 nr
+瓦尔米 2 nrt
+瓦尔纳 20 nr
+瓦尔莱 5 nr
+瓦尔蒙 3 nr
+瓦尔达 11 nr
+瓦尔迪 5 nr
+瓦尼亚 15 nr
+瓦屋 532 n
+瓦岗军 53 nr
+瓦岗寨 4 nr
+瓦工 264 n
+瓦希德 3 nr
+瓦帮主 2 nr
+瓦店镇 3 ns
+瓦当 80 nrt
+瓦德 2 nrt
+瓦德一世 3 nrt
+瓦德希 2 nr
+瓦德森 2 nr
+瓦德西 74 nr
+瓦戈庄镇 3 nrt
+瓦房 69 n
+瓦房店 3 n
+瓦房店市 15 ns
+瓦托 7 nrt
+瓦拉 56 nrt
+瓦拉格 2 nrt
+瓦拉纳西 11 nrt
+瓦文萨 18 nr
+瓦斯 132 nrt
+瓦斯体 3 nr
+瓦斯卡兰山 2 nrt
+瓦斯卡尔 6 nrt
+瓦斯弹 3 nr
+瓦斯炉 3 nr
+瓦斯科 13 nr
+瓦斯筒 3 nr
+瓦斯行 3 nr
+瓦时计 3 nr
+瓦朗吉 2 nr
+瓦朗谢 9 nrt
+瓦杜兹 5 nr
+瓦杰帕伊 6 nr
+瓦杰拉 2 nr
+瓦林卡 2 nr
+瓦查尿溺 3 n
+瓦格宁 2 nr
+瓦格纳 44 nr
+瓦桥关 2 nr
+瓦楞 13 n
+瓦楞子 3 n
+瓦楞屋顶 3 ns
+瓦楞纸 4 n
+瓦楞纸板 3 n
+瓦楞纸箱 3 n
+瓦檐 4 n
+瓦沃岛 2 nr
+瓦沟 3 ns
+瓦烈斯 2 nrt
+瓦片 119 n
+瓦特 110 nrt
+瓦特计 3 nr
+瓦环礁 2 nr
+瓦瓦乌 2 nr
+瓦盆 38 n
+瓦砾 98 n
+瓦窑堡 33 ns
+瓦窑堡会议 69 nz
+瓦米 4 nrt
+瓦米尔 2 nr
+瓦索尔 8 nr
+瓦纳人 2 nrt
+瓦纳古 7 nr
+瓦纳语 4 nr
+瓦维洛 5 nr
+瓦罐 379 n
+瓦罗 7 nrt
+瓦罗加 159 nr
+瓦耶勒 2 nr
+瓦耶夫 3 nr
+瓦胡岛 19 nr
+瓦舍 28 nrt
+瓦良格 81 nr
+瓦茨 18 nrt
+瓦茨拉夫 4 nrt
+瓦莱 6 nrt
+瓦莱丽 3 nr
+瓦莱乔 32 nr
+瓦莱塔 17 nr
+瓦莱里 6 nrt
+瓦萨拉 3 nrt
+瓦萨里 3 nrt
+瓦萨雷 2 nr
+瓦西 5 nrt
+瓦西列夫 2 nrt
+瓦西姆 2 nr
+瓦西特 2 nr
+瓦西里 30 nrt
+瓦西里耶夫 6 nrt
+瓦西镇 3 nr
+瓦解 524 v
+瓦解云散 3 nr
+瓦解冰泮 3 nr
+瓦解冰消 4 nr
+瓦解冰销 3 n
+瓦解土崩 3 n
+瓦解星散 3 nr
+瓦赤喇 3 nr
+瓦赤掌 3 nr
+瓦赫什 12 nrt
+瓦赫兰 7 nr
+瓦赫坦 13 nr
+瓦赫曼 10 nr
+瓦赫河 4 nr
+瓦达克 2 nr
+瓦达尔 4 nr
+瓦迪斯 3 nr
+瓦里 26 nrt
+瓦里乔 3 nr
+瓦里亚 3 nrt
+瓦里奥 3 nrt
+瓦里安 12 nrt
+瓦里斯 2 nrt
+瓦里诺 3 nr
+瓦釜之鸣 3 i
+瓦釜雷鸣 3 i
+瓦锅 3 n
+瓦隆 4 nr
+瓦隆人 9 nr
+瓦雷里 3 nrt
+瓦面 9 n
+瓦鲁纳 5 nr
+瓦齐尔 6 nr
+瓧 111 zg
+瓨 35 zg
+瓩 12 zg
+瓪 2 zg
+瓫 2 zg
+瓭 3 zg
+瓮 539 ns
+瓮中 3 ns
+瓮中之鳖 15 i
+瓮中捉鳖 14 i
+瓮中鳖 3 i
+瓮城 87 ns
+瓮声瓮气 29 l
+瓮天之见 3 i
+瓮天蠡海 3 i
+瓮安 3 ns
+瓮安县 3 ns
+瓮尽杯干 3 l
+瓮牖桑枢 3 n
+瓮牖绳枢 3 n
+瓮里醯鸡 3 vn
+瓮音 3 ns
+瓮鼻 3 ns
+瓯 83 ns
+瓯江 33 ns
+瓯海 3 ns
+瓯海区 3 ns
+瓯海县 3 ns
+瓯绣 3 n
+瓯越 3 ns
+瓴 18 g
+瓶 1808 n
+瓶中沙 3 n
+瓶内 3 n
+瓶口 59 n
+瓶坠簪折 3 z
+瓶塞 74 n
+瓶塞儿 3 n
+瓶子 309 n
+瓶底 3 n
+瓶沉簪折 3 z
+瓶瓶罐罐 25 n
+瓶盂 3 n
+瓶盖 34 n
+瓶盖厂 3 n
+瓶罄罍耻 3 v
+瓶罐 8 n
+瓶胆 3 n
+瓶脖 3 n
+瓶装 41 n
+瓶装水 3 n
+瓶身 5 n
+瓶钵 3 n
+瓶颈 381 n
+瓷 758 n
+瓷业 33 n
+瓷具 3 n
+瓷厂 15 n
+瓷器 586 n
+瓷器店 6 n
+瓷器活 3 n
+瓷土 56 n
+瓷壶 13 n
+瓷娃娃 6 n
+瓷实 13 n
+瓷杯 19 n
+瓷板 5 n
+瓷板画 3 n
+瓷漆 3 n
+瓷片 41 n
+瓷牙 3 n
+瓷球 4 n
+瓷瓶 162 n
+瓷甲冠 3 n
+瓷画 3 n
+瓷盒 3 n
+瓷盘 17 n
+瓷砖 32 n
+瓷碗 55 n
+瓷碟 3 n
+瓷窑 36 n
+瓷粉 3 n
+瓷缸 11 n
+瓷罐 25 n
+瓷胎 3 n
+瓷质 10 n
+瓷都 14 n
+瓷釉 14 n
+瓷雕 12 n
+瓿 66 g
+甃 2 zg
+甄 98 nr
+甄五臣 23 nr
+甄克思 3 nr
+甄六臣 10 nr
+甄别 94 v
+甄士隐 17 nr
+甄夫人 6 nr
+甄奇录异 3 nr
+甄子丹 3 nr
+甄宏戈 2 nr
+甄宝玉 36 nr
+甄审 3 v
+甄家仆 2 nr
+甄家娘子 3 nr
+甄家荐 2 nr
+甄少爷 2 nr
+甄师兄 4 nr
+甄师弟 5 nr
+甄应嘉 10 nr
+甄府里 2 nr
+甄录 3 nr
+甄心动惧 3 v
+甄志丙 270 nr
+甄志强 3 nr
+甄拔 2 nr
+甄洛之 7 nr
+甄用 3 v
+甄的香 2 nr
+甄真人 3 nr
+甄秀姝 2 nr
+甄老爷 7 nr
+甄试 3 v
+甄选 23 v
+甄选人才 3 nr
+甄道兄 3 nr
+甄道爷 2 nr
+甆 73 zg
+甇 3 zg
+甍 8 zg
+甏 21 ng
+甑 126 zg
+甑子 2 n
+甑尘釜鱼 3 v
+甒 4 zg
+甓 27 g
+甕 3 zg
+甗 16 zg
+甘 823 nr
+甘不察 6 v
+甘丙肽 3 nz
+甘丹 2 ns
+甘丹寺 18 ns
+甘乃光 3 nr
+甘之吠饴 3 i
+甘之如荠 3 n
+甘之如饴 21 i
+甘之若素 3 nr
+甘于 76 v
+甘井先竭 3 i
+甘井子 7 nr
+甘井子区 5 ns
+甘亭镇 4 nr
+甘休 154 nr
+甘似蜜 2 nr
+甘作 3 ns
+甘倍尔 2 nr
+甘做 3 v
+甘兴霸 3 nr
+甘冈 3 ns
+甘冒 3 v
+甘冒虎口 3 i
+甘凉直 2 nr
+甘凉道 17 nr
+甘分随时 3 n
+甘南 55 ns
+甘南县 3 ns
+甘南州 3 ns
+甘南藏区 2 ns
+甘南藏族自治州 11 ns
+甘博耳 2 nr
+甘博阿 2 nr
+甘卫二 2 nr
+甘受 3 v
+甘受宗 2 nr
+甘味 3 n
+甘国 3 ns
+甘地 172 n
+甘地纳 2 ns
+甘处下流 3 n
+甘夫人 43 nrt
+甘如养 4 nr
+甘子 3 n
+甘孜 44 ns
+甘孜县 3 ns
+甘孜州 3 ns
+甘孜藏族自治州 12 ns
+甘宁 63 ns
+甘宁引 4 nr
+甘宁百 2 nr
+甘宁见 2 nr
+甘宁领 3 nr
+甘宝宝 48 nr
+甘家口 3 ns
+甘居 4 nrt
+甘居下流 3 nr
+甘居下游 3 nr
+甘居中游 3 nr
+甘居人 4 nr
+甘居人后 3 nr
+甘川 5 ns
+甘州 73 ns
+甘州区 3 ns
+甘州卫 3 nr
+甘州行 2 ns
+甘巴拉 2 nrt
+甘巴里 3 nrt
+甘布尔 8 nr
+甘布林 2 nr
+甘平 8 ns
+甘延寿 4 nr
+甘当 35 v
+甘德 7 nrt
+甘德县 2 ns
+甘德尔 3 nr
+甘心 649 n
+甘心如养 3 i
+甘心如荠 3 n
+甘心情原 3 i
+甘心情愿 23 i
+甘心瞑目 3 i
+甘心首疾 3 i
+甘必大 7 nr
+甘思宣 3 nr
+甘性平 3 nr
+甘性温 3 nr
+甘愿 247 n
+甘托克 7 nr
+甘拜下风 62 ns
+甘斯文特 27 nrt
+甘新 4 ns
+甘旨肥浓 3 nr
+甘暴弃 16 i
+甘服 2 n
+甘末林 2 nr
+甘来 3 v
+甘棠之惠 3 n
+甘棠之爱 3 n
+甘棠遗爱 3 n
+甘死如饴 3 i
+甘比亚共 3 nr
+甘比尔 6 ns
+甘氨胆酸 3 n
+甘氨酸 11 nz
+甘汁 3 n
+甘汞 7 nz
+甘河 6 ns
+甘河子 2 nr
+甘河镇 2 ns
+甘油 111 n
+甘油三脂 5 ns
+甘油三酯 24 nz
+甘油二酯 3 nz
+甘油休克 3 ns
+甘油单酯 3 n
+甘油酯 16 n
+甘油酸 3 n
+甘油醚 3 n
+甘油醛 3 n
+甘泉 1100 ns
+甘泉县 3 ns
+甘泉必竭 3 i
+甘泽谣 5 nr
+甘洛 2 nr
+甘洛乡 3 ns
+甘洛县 3 ns
+甘海子 3 nr
+甘润 2 n
+甘淡渗 2 nr
+甘温之 2 nr
+甘溪坪 5 nr
+甘溪港 2 ns
+甘特图 3 nr
+甘珠尔 9 nr
+甘瓜苦蒂 3 nr
+甘甜 55 nr
+甘皇后 2 nr
+甘盘为 3 n
+甘石星 2 nr
+甘石洗 4 nr
+甘破蔗 2 n
+甘祖里 2 nr
+甘立忍受 3 i
+甘篮菜 3 n
+甘紫菜 3 nr
+甘结 6 v
+甘罗格 2 nr
+甘美 38 ns
+甘美多汁 3 nr
+甘聚糖 2 nr
+甘肃 1528 ns
+甘肃兰州 3 ns
+甘肃农业大学 2 nt
+甘肃工业大学 7 nt
+甘肃河西走廊 6 ns
+甘肃省 422 ns
+甘肃省委 3 nt
+甘肃省甘南藏族自治州 3 ns
+甘胃虎口 3 n
+甘脆 3 a
+甘苦 43 v
+甘苦与共 7 i
+甘苦谈 3 i
+甘英西 2 nr
+甘茂德 2 nr
+甘草 160 n
+甘草片 3 n
+甘草粉 3 nr
+甘草酸 5 n
+甘荫塘 2 nr
+甘菊 4 nr
+甘菊花 4 nr
+甘菜 3 n
+甘蓝 29 nr
+甘蓝型 6 n
+甘蓝菜 3 n
+甘蔗 692 n
+甘蔗园 4 ns
+甘蔗林 2 ns
+甘蔗汁 3 n
+甘蔗渣 20 n
+甘蔗田 3 ns
+甘蕉 3 n
+甘薯 217 n
+甘薯饼 3 n
+甘藷 3 v
+甘西 2 ns
+甘西迪 2 nr
+甘言 2 n
+甘言厚礼 3 i
+甘言媚词 3 i
+甘言美语 3 i
+甘诸州 2 ns
+甘谷 5 ns
+甘谷县 2 ns
+甘贝里 2 nrt
+甘败下风 3 i
+甘贫乐道 3 i
+甘贫守分 3 l
+甘贫守志 3 i
+甘边宁 2 ns
+甘达提 2 nr
+甘迺迪 3 v
+甘迺迪角 3 nz
+甘道夫 3 nr
+甘醇 4 n
+甘镜 2 n
+甘陵 2 ns
+甘雨 22 nr
+甘雨洲 3 nr
+甘雨随东 3 nr
+甘雨随车 3 n
+甘霖 38 nr
+甘露 147 v
+甘露园 3 nr
+甘露寺 15 nr
+甘露水 3 nr
+甘露醇 18 nr
+甘青宁 7 nr
+甘馨之费 3 nr
+甙 94 g
+甚 13115 zg
+甚且 3 c
+甚为 576 d
+甚为不解 3 i
+甚么 11717 r
+甚于 3 d
+甚于防川 6 i
+甚低频 9 b
+甚佳 24 z
+甚嚣尘上 25 i
+甚多 3 d
+甚好 3 d
+甚妙 3 b
+甚密 3 b
+甚少 3 d
+甚广 110 v
+甚微 60 d
+甚急 3 z
+甚感 3 v
+甚或 80 d
+甚早 3 d
+甚是 3 d
+甚殷 3 z
+甚浓 3 z
+甚深 3 d
+甚笃 23 z
+甚者 25 r
+甚而 49 d
+甚至 15239 d
+甚至于 182 d
+甚获 3 v
+甚获好评 3 n
+甚解 3 v
+甚轻 3 d
+甚远 3 d
+甚高频 31 b
+甜 2001 a
+甜不辣 3 i
+甜丝丝 19 z
+甜叶菊 3 n
+甜味 108 n
+甜味剂 209 n
+甜味素 8 n
+甜咖啡 3 nr
+甜品 20 n
+甜品店 3 n
+甜嘴蜜舌 3 i
+甜地丁 3 nz
+甜头 99 n
+甜度 35 n
+甜心 12 n
+甜性涩爱 3 n
+甜情密意 3 i
+甜枣 2 n
+甜柑 3 n
+甜柔 3 a
+甜柿 2 n
+甜梦 3 n
+甜梨 3 n
+甜椒 10 n
+甜槠 9 n
+甜橘 3 n
+甜橙 25 n
+甜水 8 n
+甜津津 6 z
+甜润 12 n
+甜滋滋 10 z
+甜点 34 n
+甜点心 3 n
+甜爽 3 a
+甜玉米 3 n
+甜瓜 59 n
+甜瓜子 3 n
+甜甜 3 a
+甜甜地 29 z
+甜甜的 53 z
+甜甜蜜蜜 10 z
+甜睡 3 n
+甜筒 3 n
+甜糕 2 a
+甜糕点 3 z
+甜糯 4 b
+甜美 135 a
+甜而不 3 i
+甜而不腻 3 z
+甜腻 3 a
+甜腻腻 8 z
+甜菊糖 3 n
+甜菜 273 n
+甜菜碱 3 n
+甜菜糖 8 n
+甜菜象虫 3 n
+甜薯 3 n
+甜蜜 403 a
+甜蜜蜜 13 z
+甜言 3 n
+甜言媚语 3 i
+甜言美语 3 i
+甜言蜜语 62 i
+甜言软语 3 i
+甜辣 3 z
+甜适 3 a
+甜酒 566 n
+甜酒酿 3 n
+甜酱 9 n
+甜酸 3 n
+甜酸苦辣 8 z
+甜面酱 7 n
+甜音 3 n
+甜食 89 n
+甜饼 2 n
+甜香 54 n
+生 22579 vn
+生一子 7 l
+生一男 2 nr
+生丁 7 n
+生三男 3 nr
+生下 3 n
+生不如死 3 l
+生不带来 3 l
+生不逢时 25 i
+生不逢辰 4 i
+生不遇时 3 l
+生与死 3 l
+生业 15 n
+生丝 60 n
+生为 3 v
+生之子 13 l
+生之幸 3 nr
+生乳 3 n
+生了病 3 l
+生了锈 3 v
+生事 84 n
+生事扰民 3 n
+生二子 9 nr
+生二歧 2 nr
+生二胎 3 l
+生于 4690 v
+生于忧患 5 i
+生云 2 n
+生亦何 2 l
+生产 32898 vn
+生产业 4 n
+生产井 3 n
+生产例会 3 l
+生产关系 393 l
+生产力 2033 n
+生产区 27 n
+生产厂 48 n
+生产厂家 3 n
+生产商 159 n
+生产国 159 n
+生产型 105 n
+生产基金 4 n
+生产大队 27 n
+生产定额 3 n
+生产实践 3 l
+生产工具 98 l
+生产工艺 3 n
+生产布局 3 n
+生产废水 3 n
+生产性 32 n
+生产总值 1937 n
+生产成本 3 l
+生产战线 3 n
+生产指数 3 l
+生产指标 3 n
+生产操 3 l
+生产方式 778 l
+生产日期 3 n
+生产流程 3 l
+生产测井 3 n
+生产潜力 3 n
+生产率 446 n
+生产甲板 3 n
+生产秩序 3 nr
+生产管柱 3 n
+生产管汇 3 n
+生产线 521 n
+生产组 3 n
+生产经营性 2 n
+生产经营者 7 n
+生产者 629 n
+生产能力 672 n
+生产自救 3 n
+生产观 3 n
+生产规划 3 l
+生产费 3 n
+生产资料 1486 l
+生产过剩 84 l
+生产量 302 n
+生产链 9 n
+生产队 170 n
+生产队长 24 n
+生产额 3 n
+生人 199 n
+生仔 3 n
+生代寒 2 vn
+生众食寡 3 l
+生俘 18 vn
+生僻 16 a
+生僻字 5 n
+生儿 7 n
+生儿育女 88 n
+生兄 7 n
+生光 100 n
+生克 13 n
+生克之 8 nr
+生克乘 7 nr
+生公说法 3 n
+生关死劫 3 l
+生具异 2 l
+生具慧 2 l
+生养 77 n
+生冷 43 vn
+生冷食物 3 l
+生凑 3 a
+生出 849 v
+生分 73 n
+生利 7 vn
+生利息 3 n
+生刺 2 vn
+生前 856 t
+生前友好 3 l
+生力 25 n
+生力兵 2 n
+生力军 102 n
+生力面 3 n
+生动 1266 vn
+生动如昔 3 i
+生动性 12 n
+生动有趣 3 l
+生动活泼 94 l
+生势 3 n
+生化 358 vn
+生化一号 3 n
+生化三号 3 n
+生化二号 3 nz
+生化危机 3 l
+生化学 3 n
+生化学家 3 l
+生化武器 3 l
+生化汤 3 n
+生卒 3 n
+生厌 42 v
+生双翅 2 nr
+生双靥 3 nr
+生发 85 v
+生发剂 3 n
+生发未燥 3 l
+生发水 3 n
+生发油 3 n
+生变 40 v
+生变熟 2 l
+生可旦 2 i
+生叶 2 n
+生吞 3 v
+生吞活剥 16 i
+生员 44 n
+生周康 2 nr
+生命 6986 vn
+生命不息 4 l
+生命主义 2 n
+生命令 3 n
+生命体 33 n
+生命保险 3 n
+生命力 407 n
+生命危险 3 l
+生命史 14 n
+生命周期 3 n
+生命垂危 3 i
+生命学 3 n
+生命安全 3 nz
+生命家园 3 n
+生命感 2 n
+生命指数 3 n
+生命攸关 3 l
+生命期 9 n
+生命权 12 n
+生命现象 3 n
+生命科学 91 l
+生命线 72 n
+生命统计 3 l
+生命表 3 n
+生命诚可贵 3 i
+生命财产 3 l
+生唐 2 t
+生啤酒 3 n
+生四子 3 nr
+生土 17 n
+生在 3 t
+生在地上 3 l
+生地 87 n
+生地黄 3 j
+生均 7 j
+生坯 2 n
+生堂溪 2 nr
+生境 87 n
+生壶 4 n
+生夏雪 3 nr
+生大士 4 nr
+生夺硬抢 3 l
+生契阔 2 nr
+生女生 2 n
+生好 3 v
+生如 3 l
+生如夏 2 nr
+生妙悟 2 i
+生姜 113 n
+生姿 2 n
+生威 27 n
+生娃娃 4 nr
+生婴儿 21 nr
+生子 143 n
+生子儿 2 nr
+生子名 3 n
+生子启 4 nr
+生子宁 2 nr
+生子常 4 nr
+生子而 2 nr
+生子谅 2 nr
+生子钱 16 n
+生字 10 n
+生字簿 3 n
+生字表 3 n
+生存 3476 v
+生存主义 3 n
+生存之道 3 l
+生存保险 3 n
+生存力 3 l
+生存型 2 n
+生存大计 3 l
+生存性 6 n
+生存斗争 10 l
+生存期 58 n
+生存权 25 n
+生存条件 3 l
+生存率 68 n
+生存环境 3 l
+生存空间 3 n
+生存竞争 3 l
+生存者 7 n
+生存背景 3 n
+生存能力 3 l
+生存链 2 n
+生守誓 2 nr
+生宋关头 3 n
+生客 12 n
+生寄死归 3 n
+生小孩 3 n
+生小枝 2 nr
+生小穗 3 nr
+生少子 2 nr
+生就 124 n
+生师弟 2 nr
+生平 1079 n
+生平事迹 3 n
+生平厅 3 n
+生年 3 t
+生幼仔 4 nr
+生广陵 2 nr
+生康有为 4 nr
+生异卉 2 n
+生张汉 2 nr
+生张熟魏 2 l
+生当做人杰 3 l
+生律法 2 n
+生徒 2 n
+生得 3 v
+生得俊 5 nr
+生得明 2 nr
+生得美 5 nr
+生得闻 2 n
+生忌 2 n
+生态 4260 n
+生态乡 2 l
+生态农业 3 n
+生态化 9 n
+生态区 3 n
+生态区域 3 n
+生态危机 3 l
+生态县 3 n
+生态园 7 n
+生态园林 3 n
+生态圈 11 n
+生态地段 3 n
+生态型 31 n
+生态学 269 l
+生态学家 17 l
+生态小区 3 n
+生态平衡 3 i
+生态建设 3 l
+生态效益 3 n
+生态旅游 3 n
+生态景观 3 l
+生态村 9 n
+生态条件 3 l
+生态灭绝 3 i
+生态灾难 3 l
+生态点 3 n
+生态环境 3 l
+生态系 3 n
+生态系统 3 l
+生态群 3 n
+生态艺术 3 l
+生态裤 3 n
+生态难民 3 l
+生怕 1081 v
+生怖畏 7 nr
+生性 447 n
+生性固执 3 n
+生怯怯 3 z
+生恐 56 v
+生息 500 n
+生息繁衍 14 i
+生悲 3 n
+生情 3 n
+生惧 3 v
+生意 1719 v
+生意人 120 n
+生意兴隆 36 l
+生意场 7 n
+生意盎然 2 l
+生意眼 3 l
+生意经 20 l
+生意萧条 3 i
+生意通 3 l
+生成 2337 v
+生成元 3 nr
+生成器 3 l
+生成式 14 l
+生成物 43 l
+生成素 27 l
+生成量 3 l
+生或死 3 l
+生手 14 n
+生抽 4 nz
+生拉硬扯 3 l
+生拉硬拽 5 l
+生拖死拽 3 l
+生搬硬套 19 i
+生擒 164 v
+生擒活拿 3 nr
+生擒活捉 3 i
+生效 1693 n
+生效日 3 n
+生料 5 n
+生日 1028 t
+生日会 2 l
+生日卡 4 nr
+生日号 3 n
+生日快乐 3 l
+生日报 3 nz
+生日歌 3 n
+生日派对 3 l
+生日礼品 3 l
+生日礼物 3 l
+生日舞会 3 l
+生日花 3 n
+生日蛋糕 3 n
+生旦 4 t
+生旦净 7 i
+生旦净末 3 i
+生有幸 2 n
+生有羽 2 nr
+生朗声 2 nr
+生术赤 2 nr
+生机 398 n
+生机勃勃 101 i
+生机勃发 6 i
+生机盎然 23 l
+生机蓬勃 4 i
+生杀 3 vn
+生杀与夺 3 i
+生杀之权 17 l
+生杀予夺 19 i
+生杀大权 3 l
+生材 3 n
+生来 285 v
+生来死去 3 l
+生来生去 3 l
+生林 3 n
+生柔毛 2 nr
+生栋覆屋 3 i
+生根 127 n
+生桑之梦 3 i
+生橡胶 3 n
+生死 1414 v
+生死不渝 13 i
+生死与共 39 i
+生死之交 47 i
+生死予夺 3 i
+生死关 3 n
+生死关头 99 l
+生死别离 3 i
+生死劫 3 i
+生死场 2 n
+生死存亡 325 i
+生死恋 3 n
+生死战 3 n
+生死搏斗 3 l
+生死攸关 72 i
+生死时速 3 n
+生死有命 18 i
+生死未卜 3 l
+生死牌 3 n
+生死状 3 n
+生死相伴 3 n
+生死相依 5 l
+生死相许 3 n
+生死离别 3 n
+生死簿 3 n
+生死线 12 n
+生死考验 3 n
+生死肉骨 3 i
+生死荣辱 10 i
+生死观 3 n
+生殖 815 vn
+生殖力 6 n
+生殖器 157 n
+生殖器官 3 n
+生殖孔 3 n
+生殖崇拜 3 l
+生殖洄游 11 l
+生殖系统 3 n
+生殖细胞 87 n
+生殖腺 38 n
+生殖道 39 n
+生殖隔离 3 n
+生母 470 n
+生毛毛 2 n
+生民 4 n
+生民涂炭 3 n
+生气 2416 n
+生气勃勃 118 i
+生气蓬勃 3 i
+生水 59 n
+生沙 2 n
+生油 25 n
+生油层 7 n
+生油指标 3 n
+生油率 3 n
+生津思 3 nr
+生津止渴 12 i
+生津润 4 nr
+生津解渴 3 i
+生活 31550 vn
+生活习惯 3 n
+生活作风 3 l
+生活化 23 vn
+生活区 45 n
+生活史 112 n
+生活品质 3 l
+生活圈 4 n
+生活型 17 n
+生活型谱 3 l
+生活奢靡 3 i
+生活学家 3 l
+生活安定 3 l
+生活实践 3 l
+生活富裕 3 nr
+生活待遇 3 l
+生活必需 3 l
+生活必需品 129 l
+生活态度 3 l
+生活报 23 n
+生活时报 3 n
+生活来源 3 l
+生活气息 3 l
+生活水准 3 n
+生活源泉 3 n
+生活照 5 n
+生活版 3 n
+生活状况 3 l
+生活理想 3 n
+生活用品 3 n
+生活秀 3 i
+生活空间 3 n
+生活糜烂 3 z
+生活素 3 n
+生活美满 3 i
+生活舱 2 n
+生活节奏 3 n
+生活观 7 l
+生活观念 3 n
+生活费 217 vn
+生活费用 3 l
+生活资料 275 l
+生活道路 3 l
+生活馆 3 n
+生涩 26 a
+生涯 1608 n
+生涯规划 3 l
+生源 679 n
+生源景观 3 n
+生源论 3 n
+生滚 3 v
+生满地衣 3 i
+生漆 79 n
+生灌丛 8 nr
+生火 106 n
+生灭 3 v
+生灵 134 n
+生灵涂地 3 i
+生灵涂炭 28 n
+生点 3 n
+生烛 5 n
+生热 3 n
+生煤 3 n
+生熟 3 a
+生爱儿 4 nr
+生爱女萧 2 nr
+生父 364 n
+生父母 8 nr
+生物 7238 n
+生物主义 3 n
+生物之星 3 l
+生物体 448 n
+生物入侵 3 nr
+生物农药 3 n
+生物分布 3 n
+生物制剂 3 n
+生物制品 56 n
+生物制药 3 n
+生物力学 3 l
+生物力能学 3 l
+生物化学 3 n
+生物化学系 3 n
+生物化工 3 n
+生物医学 3 n
+生物医药 3 n
+生物卫星 3 n
+生物反馈 3 n
+生物固氮 3 n
+生物圈 256 n
+生物学 677 n
+生物学家 375 n
+生物学科 3 n
+生物学系 3 n
+生物学部 3 n
+生物导弹 3 n
+生物工程 3 l
+生物引擎 3 n
+生物态 3 n
+生物性 19 n
+生物战 14 n
+生物战剂 36 n
+生物所 16 n
+生物武器 78 n
+生物污染 7 n
+生物测定 7 n
+生物浓缩 3 l
+生物灾害 3 l
+生物物理 8 n
+生物电 3 n
+生物电流 5 n
+生物界 144 n
+生物碱 130 n
+生物科学 3 l
+生物科技 3 n
+生物系 40 n
+生物素 3 n
+生物网 3 n
+生物群 3 n
+生物群落 3 l
+生物肥 3 n
+生物肥料 3 l
+生物能 16 n
+生物膜 3 n
+生物芯片 4 n
+生物苑 3 n
+生物课 9 n
+生物谷 3 n
+生物质 11 n
+生物质能 26 n
+生物资源 3 n
+生物转化 3 n
+生物迁移 3 n
+生物进化 3 n
+生物通 3 n
+生物酶 3 n
+生物量 22 n
+生物钟 87 n
+生物链 3 n
+生物防治 31 n
+生物降解 3 l
+生物陶瓷 3 l
+生猛 39 a
+生猛海鲜 5 i
+生猪 486 n
+生猪肉 3 n
+生理 1792 vn
+生理功能 3 n
+生理卫生 3 n
+生理反应 3 l
+生理学 356 n
+生理学家 85 n
+生理性 85 n
+生理期 3 n
+生理机制 3 n
+生理特点 3 n
+生理用品 3 n
+生理病害 3 n
+生理盐水 28 n
+生理零度 3 l
+生理需求 3 n
+生理需要 3 l
+生瑞霭 2 nr
+生甘草 3 l
+生生 3 n
+生生不佑 3 v
+生生不已 6 l
+生生不息 39 l
+生生世世 15 l
+生生凝 2 nr
+生生撑 2 v
+生生死死 12 l
+生生永 2 nr
+生生的 82 l
+生生转 2 l
+生田川 2 nr
+生男生 4 l
+生男生女 3 l
+生男育女 3 l
+生畏 8 vn
+生番 3 t
+生疏 141 n
+生疑 52 v
+生疮 3 n
+生疼 97 v
+生病 469 n
+生瘤子 6 n
+生皮 3 n
+生相 3 n
+生着气 3 l
+生知 3 v
+生石 6 n
+生石灰 30 n
+生石膏 2 n
+生硬 127 a
+生硬死板 3 n
+生祭 2 v
+生离 3 vn
+生离宋别 3 n
+生离死别 63 n
+生科院 3 l
+生端 3 n
+生米 3 n
+生米煮成 3 nr
+生米煮成熟饭 12 i
+生粉 6 n
+生编 3 vn
+生老病死 35 i
+生者 3 n
+生而平等 3 l
+生而知之 10 i
+生而自由 3 l
+生聚教训 3 n
+生肉 28 n
+生肌散 5 i
+生肖 27 n
+生肖印 3 nr
+生育 958 vn
+生育力 12 n
+生育期 57 n
+生育权 8 n
+生育率 15 n
+生育能力 3 n
+生胡斐 2 nr
+生胶 32 n
+生脉散 8 l
+生脓 3 v
+生臃活虎 3 ns
+生自怜 2 i
+生色 20 n
+生花之笔 3 i
+生花妙笔 3 i
+生花笔 3 n
+生苗 3 n
+生苗高 2 nr
+生茎 4 n
+生茧 2 n
+生茶 2 n
+生荒 8 n
+生荣死哀 3 nr
+生荣死衰 3 l
+生药 8 n
+生药学 3 n
+生菜 21 n
+生菜沙拉 3 n
+生蛋 3 n
+生蛋鸡 3 n
+生角 4 n
+生计 375 vn
+生词 46 n
+生词表 3 n
+生话 3 vn
+生谢绍 128 nr
+生财 22 v
+生财之道 17 l
+生财器具 3 l
+生财有道 4 l
+生贵子 19 nr
+生起 3 v
+生趣 16 n
+生趣盎然 3 l
+生路 57 n
+生蹼 3 n
+生身 3 n
+生身母亲 3 n
+生身父亲 3 l
+生身父母 3 l
+生辉 62 nr
+生辰 143 n
+生辰八字 3 l
+生达 3 l
+生达县 3 nr
+生达命 16 l
+生过 3 v
+生还 108 v
+生还者 11 n
+生迭水准 3 nr
+生造 9 vn
+生造词 3 n
+生逢其 2 nr
+生逢圣 2 nr
+生金蛋 4 n
+生铁 183 n
+生铁皮 3 n
+生铜 3 n
+生银 2 n
+生锈 76 v
+生长 6940 n
+生长习性 3 n
+生长发育 3 l
+生长因子 3 nr
+生长抑素 3 n
+生长期 70 j
+生长激素 109 n
+生长点 22 n
+生长率 2 n
+生长素 72 n
+生长量 263 n
+生长锥 3 n
+生闲气 8 l
+生闷气 10 i
+生隐宫 3 nr
+生霉 2 n
+生面 3 n
+生面包 3 n
+生面孔 3 n
+生颍川 2 nr
+生风 2 n
+生食 3 n
+生饭 3 n
+生饮 3 n
+生香 3 n
+生骄 2 n
+生鱼片 12 n
+生鲜 7 vn
+生鲜食品 3 n
+生鸟羽 2 nr
+生齿日繁 3 l
+生龙子 2 nr
+生龙活虎 40 i
+甠 40 zg
+甡 3 zg
+產 3 zg
+産 14 zg
+甥 87 n
+甥儿 3 n
+甥女 12 n
+甥舅 3 n
+甦 8 zg
+用 76586 p
+用一当十 3 i
+用不上 3 l
+用不乏 3 v
+用不完 6 v
+用不惯 3 i
+用不着 746 l
+用不闻 3 l
+用为 3 v
+用之不竭 21 i
+用之于 3 v
+用之于民 3 l
+用书 57 n
+用于 8181 v
+用人 1480 n
+用人不当 3 l
+用人不疑 14 l
+用人之道 3 l
+用人之长 2 l
+用人勿疑 3 i
+用人单位 3 n
+用人权 6 n
+用人观 16 n
+用以 1389 v
+用作 1534 v
+用做 68 v
+用光 77 n
+用兵 405 n
+用兵一时 5 i
+用兵之道 13 i
+用兵如神 33 i
+用其所长 7 i
+用具 262 n
+用典 38 n
+用刑 45 v
+用到 334 v
+用力 1664 n
+用力一打 3 l
+用力一拍 3 l
+用力吸气 3 l
+用力插 3 n
+用力过度 3 l
+用功 292 n
+用功读书 3 n
+用功起来 3 l
+用功过度 3 l
+用劲 43 v
+用劲儿 2 d
+用印 12 v
+用去 3 v
+用友 83 n
+用只夫 3 n
+用后感 3 n
+用品 825 n
+用品厂 3 n
+用品商店 3 n
+用品店 3 n
+用器 3 n
+用图表 3 n
+用在一时 3 l
+用在一朝 3 l
+用地 329 n
+用地平衡 3 i
+用场 69 n
+用坏 3 v
+用墨 3 n
+用处 150 n
+用夏变夷 3 nz
+用天因地 3 l
+用头巾包 3 l
+用奴用 3 n
+用字 29 n
+用字不当 3 l
+用学 10 n
+用家 3 n
+用尽 110 v
+用尽心机 3 l
+用尽方法 3 l
+用工 117 n
+用工夫 5 n
+用布 241 v
+用度 49 n
+用当其用 3 l
+用得 3 v
+用得上 51 l
+用得着 3 v
+用心 802 n
+用心听 3 i
+用心听讲 3 l
+用心用意 3 l
+用心看 3 l
+用心竭力 3 i
+用心良苦 34 l
+用心读 3 l
+用心险恶 17 n
+用惯 3 n
+用意 553 v
+用意何在 3 l
+用户 7103 n
+用户加密 3 n
+用户区 3 n
+用户名 29 n
+用户库 3 n
+用户意见 3 i
+用户手册 3 n
+用户数 52 n
+用户数量 3 n
+用户文档 3 n
+用户服务 3 n
+用户注册 7 n
+用户电报 3 n
+用户界面 28 n
+用户程序 13 n
+用户端 3 n
+用户线 6 n
+用户组 3 n
+用户群 3 n
+用户至上 3 i
+用户量 7 n
+用房 24 n
+用手挤 3 v
+用手掌 3 i
+用掉 3 v
+用料 69 n
+用方风险 3 l
+用智铺谋 3 l
+用权 7 n
+用材 123 n
+用材林 332 n
+用来 3037 v
+用来用去 3 l
+用款 3 n
+用武 39 n
+用武之地 75 l
+用水 542 n
+用水量 21 n
+用汇 4 n
+用油 301 n
+用法 197 n
+用法指南 3 l
+用法说明 3 l
+用活 20 vn
+用率 26 n
+用用 3 v
+用电 200 n
+用电器 4 n
+用电户 2 n
+用电量 286 n
+用石蜡涂 3 n
+用硫酸烧 3 n
+用票 3 n
+用稿 3 n
+用笔 157 n
+用管窥天 3 n
+用粮 5 n
+用纸 83 n
+用者 27 n
+用脑 44 n
+用膳 104 v
+用舍行藏 3 n
+用色 3 n
+用药 660 n
+用药治疗 3 n
+用药者 4 n
+用药量 15 n
+用血 176 v
+用行舍藏 3 n
+用计 3 v
+用计铺谋 3 l
+用词 86 n
+用词不当 3 l
+用语 213 n
+用财 3 v
+用费 38 n
+用足 3 v
+用车 76 n
+用途 1375 n
+用途林 2 l
+用逸待劳 3 i
+用量 197 n
+用钓钩 3 l
+用钱 126 v
+用钱如水 3 i
+用铜心机 3 n
+用非其人 3 l
+用非所学 2 l
+用非所长 3 l
+用餐 167 n
+用鸭 3 n
+用鼻音讲 3 l
+甩 1105 v
+甩不开 3 v
+甩不掉 3 v
+甩出 3 v
+甩出去 3 v
+甩出来 3 l
+甩到 3 v
+甩动 3 v
+甩包袱 3 n
+甩卖 12 v
+甩头 22 v
+甩尾 3 v
+甩干 3 v
+甩开 248 v
+甩开膀子 3 l
+甩手 105 v
+甩手掌柜 7 n
+甩掉 136 v
+甩站 3 n
+甩胶 3 n
+甩脂机 3 n
+甩脱 3 v
+甩袖子 8 l
+甩走 3 v
+甪 6 zg
+甫 559 d
+甫士 3 nrt
+甫志高 2 z
+甫琴 3 nrt
+甬 56 n
+甬剧 3 n
+甬台温 6 n
+甬江 19 ns
+甬路 23 n
+甬道 233 n
+甬钟 135 n
+甭 540 c
+甭想 3 v
+甭提 23 v
+甭管 74 c
+甭说 3 c
+甯 546 zg
+田 6010 n
+田一听 3 nr
+田一郎 2 nr
+田七 45 nr
+田万太 2 nr
+田万有 7 nr
+田万江 14 nr
+田不礼 2 nr
+田业 2 n
+田东 3 nr
+田东县 4 nr
+田中 104 nr
+田中丰 3 nr
+田中义 12 nr
+田中健 2 nr
+田中先 2 nr
+田中绢 5 nr
+田中耕 2 nr
+田中裕子 3 nr
+田中角荣 9 nr
+田中谦 2 nr
+田中隆 2 nr
+田中雅美 3 nr
+田丰之 3 nr
+田丰劝 4 nr
+田丰朋 3 nr
+田主 47 nr
+田义庄 33 nr
+田之水 2 nr
+田买土 2 nr
+田五田 2 nr
+田亚华 3 nr
+田产 127 n
+田亩 164 n
+田亮 20 nr
+田人隆 27 nr
+田仁琬 2 nr
+田价 2 n
+田伯光 628 nr
+田伯涛 17 nr
+田余庆 3 nr
+田作 3 n
+田作定 2 nr
+田俊荣 10 nr
+田信桥 2 nr
+田信秀 2 nr
+田信长 16 nr
+田兆运 6 nr
+田兰坡 7 nr
+田再易 2 nr
+田凤山 3 nr
+田分 4 n
+田切秀 2 nr
+田刚一 2 nr
+田初依 2 nr
+田制 15 n
+田力普 9 nr
+田劝农 2 nr
+田千秋 2 nr
+田单 20 n
+田单举 3 nr
+田县 2 ns
+田友军 8 nr
+田可真 2 nr
+田同耕 3 nr
+田听罢 2 nr
+田启文 3 nr
+田和莱 2 nr
+田四田 5 nr
+田园 389 nr
+田园之乐 3 nr
+田园城市 3 ns
+田园曲 3 nr
+田园派 3 nr
+田园生活 3 nr
+田园诗 51 nr
+田园诗人 3 nr
+田园诗以 3 nr
+田园风光 3 nr
+田国丈 2 nr
+田土 22 n
+田土顷 2 nr
+田地 576 n
+田块 8 n
+田坛 7 n
+田垄 10 nr
+田垅 3 vn
+田埂 38 nr
+田塍 6 nr
+田多主 4 nr
+田多达 2 nr
+田大伟 2 nr
+田大哥 29 nr
+田大爷 2 nr
+田夫野老 3 nr
+田头 27 n
+田头乡 3 nr
+田契 26 nr
+田契根 2 nr
+田娘娘 13 nr
+田子方 6 nr
+田字草 3 nr
+田宅 10 nr
+田安然 3 nr
+田安豹 4 nr
+田宏其 2 nr
+田宏遇 10 nr
+田家 109 nrfg
+田家庄 2 nr
+田家庵区 3 nr
+田家炳 3 nr
+田家英 6 nr
+田家词 2 nr
+田家镇 4 nr
+田寮 3 ns
+田少军 3 nr
+田尔耕 14 nr
+田尾 3 nr
+田川氏 2 nr
+田师兄 9 nr
+田平娃 8 nr
+田广俊 10 nr
+田庄 74 nr
+田弘正 2 nr
+田弘遇 19 nr
+田归农 233 nr
+田径 416 n
+田径场 8 n
+田径比赛 3 nr
+田径赛 25 nr
+田径运动 60 l
+田径队 3 n
+田径项目 3 l
+田径馆 5 nr
+田德重 2 nr
+田心 3 n
+田忌赛马 3 n
+田成 4 nrfg
+田成仁 3 nr
+田成平 3 nr
+田户 3 n
+田承嗣 7 nr
+田承忠 256 nr
+田授田 3 nr
+田敬仲 2 nr
+田文昌 15 nr
+田文果 2 nr
+田文镜 8 nr
+田方昊 3 nr
+田旋花 2 nr
+田旺营 2 nr
+田易居 4 nr
+田晓东 2 nr
+田晓萌 18 nr
+田晓霞 100 nr
+田曾佩 7 nr
+田月桑时 3 nr
+田有功 2 nrfg
+田有露 2 nr
+田村正和 3 nr
+田松庆 4 nr
+田林 5 nr
+田林县 3 nr
+田树华 6 nr
+田桂丹 3 nr
+田桂花 59 nr
+田桂营 3 nr
+田欣欣 6 nr
+田氏代 3 nr
+田氏灭 2 nr
+田永圻 6 nr
+田汉 69 nr
+田汉写 2 nr
+田汉村 3 nr
+田汝成 2 nr
+田沛发 7 nr
+田洛合 2 nr
+田流 5 n
+田海民 60 nr
+田海蓉 3 nr
+田润叶 45 nr
+田润生 27 nr
+田溯宁 5 nr
+田父之功 3 nr
+田父献曝 3 nr
+田猎 33 nr
+田玉峰 15 nr
+田玉科 256 nr
+田珠光 3 nr
+田珲生活 3 v
+田珲风光 3 v
+田球 2 n
+田畴 91 nr
+田皇亲 29 nr
+田直典 2 nr
+田相公 34 nr
+田砝场 3 vn
+田砝楔 3 nz
+田砝赛 3 vn
+田福军 391 nr
+田福堂 563 nr
+田福贤 338 nr
+田福顺 2 nr
+田福高 26 nr
+田秀才 10 nr
+田秉毅 266 nr
+田种玉 3 n
+田租 66 n
+田积粟 2 nr
+田税银 2 nr
+田笑笑 3 nr
+田笑道 3 nr
+田粮 2 nr
+田纪云 9 nr
+田纳西 17 nr
+田纳西威 3 nr
+田纳西州 24 ns
+田纳西河 9 ns
+田组合 2 nr
+田老掌 2 nr
+田耕棋 3 nr
+田耕莘 2 nr
+田联 12 nr
+田聪明 3 nr
+田肚 3 n
+田自然 2 nrfg
+田舍 146 nr
+田舍翁 3 nr
+田艺蘅 3 nr
+田艺衡 3 nr
+田茂忠 2 nr
+田范江 16 nr
+田菁属 2 nr
+田蕊妮 3 nr
+田薯 3 n
+田虎族 3 nr
+田虎闻 2 nr
+田螺 40 nr
+田见暖 3 nr
+田见秀 427 nr
+田贵妃 12 nr
+田赋 197 nr
+田赛 14 nr
+田边 28 s
+田边地头 3 ns
+田连元 3 nr
+田连连 12 nr
+田里 148 s
+田野 360 nr
+田野工作 3 l
+田长焯 256 nr
+田长霖 256 nr
+田间 392 n
+田间去杂 3 l
+田间管理 12 n
+田间试验 3 n
+田间释放 3 l
+田闻声 5 nr
+田闻言 3 nr
+田阳 3 nr
+田阳县 3 nr
+田际云 5 nr
+田震英 384 nr
+田霜月 2 nr
+田青廉 30 nr
+田青文 99 nr
+田面 2 n
+田面权 5 n
+田额 6 n
+田骨田 2 nr
+田鳖 3 n
+田鸡 18 nr
+田鹨 3 n
+田黄王 2 nr
+田黄石 6 nr
+田鼠 43 n
+由 78203 p
+由一星 2 nr
+由丁男 3 nr
+由三军 2 nr
+由上向下 3 l
+由上而下 3 l
+由上至下 9 l
+由下向上 3 l
+由下而上 24 l
+由不得 131 l
+由不得你 3 l
+由东向西 3 nr
+由乃衍 2 nr
+由于 30181 c
+由云山 2 nr
+由云杉 3 nr
+由亨利 3 nr
+由人操纵 3 i
+由他去 3 l
+由众缘 2 nr
+由你定 3 l
+由你由我 3 nr
+由佳卓 5 nr
+由俭入奢 3 nr
+由儿臣 2 nr
+由克劳 2 nr
+由六卿 3 nr
+由其子 9 nr
+由其弟 2 nr
+由内而外 10 l
+由刘军 2 nr
+由利津 2 nr
+由北向南 3 nr
+由医保 5 nr
+由协修 2 nr
+由单兵 2 nr
+由南向北 3 nr
+由博古 34 nr
+由博返约 3 l
+由厄尔 2 nr
+由厘金 3 nr
+由双儿 2 nr
+由双汇 2 nr
+由召公 7 nr
+由右向左 3 nr
+由合子 2 l
+由君士 2 nr
+由喀斯 4 nr
+由喜峰 2 nr
+由喜贵 3 nr
+由嘉轩 2 nr
+由圣克 2 nr
+由圣姑 2 nr
+由城邦 48 nr
+由大鸿 5 nr
+由天而降 3 l
+由奇兰 2 nr
+由奢入俭 3 i
+由始至终 17 l
+由威廉 4 nr
+由子懋 2 nr
+由孝文 5 nr
+由孝武 2 nr
+由学政 2 nr
+由宁远 2 nr
+由安拉 3 nr
+由安西 5 nr
+由宋祁 2 nr
+由宝钛 6 nr
+由密钥 2 nr
+由寒武 5 nr
+由小僧 3 nr
+由小到大 26 l
+由小静 2 nr
+由少府 3 nr
+由崇明 2 nr
+由左向右 3 l
+由布政 3 nr
+由帅筹 2 nr
+由师师 3 nr
+由希尔 2 nr
+由帝师 2 nr
+由广利 2 nr
+由庆亲王 3 nr
+由异戊 2 nr
+由弱到强 4 l
+由彰义 2 nr
+由御史 5 nr
+由德华 2 nr
+由德胜 4 nr
+由怜生 3 nr
+由恩格 2 nr
+由恪志远 3 v
+由情志 3 nr
+由慧梅 4 nr
+由慧英 3 nr
+由承已久 3 l
+由摩尔 3 nr
+由旬 3 nr
+由易到难 3 l
+由易卜 2 nr
+由易而难 3 l
+由是 124 c
+由智联 2 nr
+由曼联 2 nr
+由朕主 2 nr
+由朕亲 2 nr
+由朝庭 2 nr
+由朝臣 2 nr
+由朱允 2 nr
+由李强 2 nr
+由李鸿 2 nr
+由来 188 c
+由来已久 116 l
+由枕芯 3 nr
+由果毅 2 nr
+由檐而繁 3 l
+由此 3692 c
+由此及彼 11 i
+由此可知 95 l
+由此可见 373 c
+由此可证 3 i
+由此来看 3 c
+由此看来 83 c
+由此而来 3 c
+由此观之 6 l
+由此证明 3 l
+由此进 3 l
+由武通 2 nr
+由法德 2 nr
+由法英 2 nr
+由洛尔 2 nr
+由洛州 2 nr
+由洪积 2 nr
+由浅入深 24 l
+由浙川 2 nr
+由海道 3 nr
+由满桂 3 nr
+由点到面 2 l
+由然而生 3 l
+由爱生 9 nr
+由父祖 16 nr
+由献忠 2 nr
+由玄冥 2 nr
+由玉儿 2 nr
+由理藩 2 nr
+由瑞利 2 nr
+由皇史 2 nr
+由监生 3 nr
+由盛京 2 nr
+由盛宣 2 nr
+由盛而衰 3 l
+由相邦 3 nr
+由硝基 2 nr
+由礼亲王 2 nr
+由福王 3 nr
+由秦晖 2 nr
+由窦尚书 3 nr
+由立克 2 nr
+由简而繁 3 l
+由素体 4 nr
+由红儿 2 nr
+由红情 2 nr
+由红转 2 nr
+由约翰 2 nr
+由纪夫 9 nr
+由统军 3 nr
+由维尔 2 nr
+由维恩 2 nr
+由维管 3 nr
+由美参 2 nr
+由英王 8 nr
+由荷语 2 nr
+由莞尔 2 nr
+由藕池 256 nr
+由蚯仔深 3 nz
+由表及里 16 l
+由衷 224 d
+由衷之言 4 i
+由衷感谢 3 i
+由衷赞佩 3 v
+由裕盛 2 nr
+由西向东 3 nr
+由诺卡 2 nr
+由谁来 3 l
+由谷英 3 nr
+由豫鄂 2 nr
+由财智 2 nr
+由贺龙 17 nr
+由赞礼 3 nr
+由辉格 2 nr
+由近及远 48 l
+由近而远 3 l
+由迪志 2 nr
+由道兄 2 nr
+由金蝶 2 nr
+由钦天 3 nr
+由钦生 2 nr
+由锦兴 3 nr
+由镇升 2 nr
+由阳爻 5 nr
+由难到易 3 l
+由雄鸟 4 nr
+由雅科 2 nr
+由震旦 7 nr
+由额垫板 3 n
+由飞拓 2 nr
+由马钰 3 nr
+甲 4733 n
+甲丁 2 nz
+甲不离身 3 l
+甲丑 3 n
+甲乙 3 n
+甲乙丙丁 3 nz
+甲乙双方 3 nz
+甲乙级 2 n
+甲亢 39 n
+甲亢病 3 vn
+甲亥 3 m
+甲仙 3 n
+甲兵 54 n
+甲冠 3 n
+甲冠天下 3 l
+甲午 138 t
+甲午一 6 nz
+甲午年 8 nz
+甲午战 3 nz
+甲午战争 287 nz
+甲午海战 13 nz
+甲卯 3 m
+甲吡酮 3 nz
+甲吾拉 3 nz
+甲地 13 n
+甲地孕酮 5 nz
+甲坝 2 n
+甲型 36 b
+甲型肝炎 3 n
+甲基 216 nz
+甲基丙烯酸 2 nz
+甲基丙烯酸甲酯 20 nz
+甲基丙烯酸酯 5 nz
+甲基化 3 nz
+甲基化酶 3 nz
+甲基对硫磷 2 nz
+甲基橙试 3 nz
+甲基汞 3 nz
+甲基苯丙胺 4 nz
+甲基营养 3 n
+甲士 3 n
+甲壳 127 n
+甲壳动物 77 l
+甲壳类 3 n
+甲壳素 9 n
+甲壳虫 28 n
+甲壳虫乐队 4 n
+甲壳质 3 n
+甲天下 37 l
+甲子 90 n
+甲子年 8 n
+甲子日 21 n
+甲子水 3 n
+甲孕酮 2 n
+甲存 3 n
+甲寅 10 m
+甲寅年 3 m
+甲寅派 2 nrfg
+甲山 2 n
+甲巳 3 m
+甲府 3 n
+甲戌 8 m
+甲方 59 n
+甲方乙方 3 nz
+甲晕 3 n
+甲未 3 nz
+甲板 641 n
+甲案 3 n
+甲氧基 12 nz
+甲氨蝶呤 2 n
+甲沟炎 8 nz
+甲烷 209 nz
+甲片 21 n
+甲状旁腺 71 l
+甲状腺 337 l
+甲状腺炎 16 n
+甲状腺癌 3 n
+甲状腺素 34 l
+甲状腺肿 51 l
+甲状软骨 4 l
+甲班 3 n
+甲申 30 nz
+甲申岁 2 m
+甲申年 13 m
+甲癣 5 n
+甲盾 3 n
+甲硝唑 17 nz
+甲硫氨酸 3 nz
+甲磺酸 2 nz
+甲种 3 m
+甲种体位 3 l
+甲种射线 3 l
+甲种粒子 3 l
+甲种维生 3 l
+甲第 6 nz
+甲第星罗 3 nz
+甲第连云 3 nz
+甲第连天 3 nz
+甲等 75 b
+甲等医院 3 l
+甲类 13 n
+甲紫 3 b
+甲级 209 b
+甲级战犯 3 l
+甲级联赛 3 n
+甲级词 3 n
+甲级队 8 n
+甲线 3 n
+甲组 5 n
+甲缩醛 2 nz
+甲羟戊酸 3 nz
+甲肝 23 n
+甲肝见鬼 3 l
+甲胄 70 n
+甲胄鱼类 3 nz
+甲胎蛋白 3 n
+甲胺 15 nz
+甲胺磷 9 nz
+甲苯 76 nz
+甲苯氧化 3 nz
+甲萘醌 3 nz
+甲藻 3 n
+甲藻黄素 3 n
+甲虫 102 n
+甲虫类 3 n
+甲辰 8 n
+甲道 6 n
+甲酉 3 m
+甲酚 19 nz
+甲酚紫 3 n
+甲酯 10 nz
+甲酰 10 n
+甲酰胺 3 nz
+甲酸 64 nz
+甲酸钠 6 nz
+甲醇 131 nz
+甲醇溶液 6 nz
+甲醇钠 3 nz
+甲醚 278 nz
+甲醛 236 nz
+甲醛煤酚 3 nz
+甲锭 3 nz
+甲队 3 n
+甲项 3 n
+甲骨 137 n
+甲骨文 343 nz
+甲骨文公司 12 n
+甲鱼 627 n
+申 715 v
+申不害 19 v
+申为 2 v
+申人俊 12 nr
+申令 3 v
+申仪 9 nz
+申先生 6 nr
+申光 7 nz
+申军谊 3 nr
+申冤 22 v
+申冤吐气 3 nt
+申冤雪恨 3 v
+申凯夫 8 nr
+申刻 3 v
+申办 125 v
+申办人 4 n
+申包胥 272 nr
+申化强 13 nr
+申呈中 2 nr
+申呈宿 3 nr
+申呈本 2 nr
+申呈陈 2 nr
+申告 3 v
+申在孝 2 nr
+申城 29 nr
+申复 3 v
+申大人 3 nr
+申大爷 2 nr
+申奏军 2 nr
+申奏魏 4 nr
+申奶奶 14 nr
+申宿令 128 nr
+申屠 3 nz
+申屠建 4 nr
+申屠氏 2 nr
+申州 3 nz
+申师叔 18 nr
+申建 2 v
+申张 2 v
+申张正义 3 nr
+申彗星 3 nr
+申彦华 6 nr
+申德勒 2 nr
+申志凡 40 nr
+申戒 3 v
+申扎 5 v
+申扎县 3 nr
+申批 3 v
+申承勋 3 nr
+申报 1101 nz
+申报单 2 n
+申报材料 3 n
+申报者 3 n
+申报表 7 n
+申敏儿 3 nr
+申文 9 nz
+申文书 2 nr
+申斥 68 v
+申斯克 3 nz
+申新 9 v
+申新各 2 nr
+申旦达夕 3 nr
+申时 6 v
+申时前 2 t
+申时攻 2 nr
+申时行 148 nr
+申明 136 v
+申明立场 3 n
+申易 3 nz
+申曲 3 v
+申朝廷 2 nr
+申根 8 nz
+申根协定 8 nz
+申正焕 3 nr
+申河 2 nz
+申河均 3 nr
+申海明 2 nr
+申渐高 2 nr
+申爱罗 3 nr
+申状 4 nz
+申猴 3 nr
+申生 8 v
+申申 8 v
+申祸无良 3 n
+申纪兰 11 nr
+申绍芳 3 nr
+申维 7 nz
+申联彬 2 nz
+申能 82 v
+申脉 3 nz
+申花 570 nz
+申花俱乐部 31 nt
+申花队 226 n
+申覆 3 v
+申言 2 v
+申讨 3 v
+申论 37 v
+申论题 3 n
+申诉 885 v
+申诉书 2 nz
+申诉人 6 nz
+申诉信 6 nz
+申诉权 8 n
+申诉状 3 nz
+申诉电话 3 n
+申诉者 3 n
+申诫 3 v
+申说 41 v
+申请 2869 v
+申请专利 3 nr
+申请书 83 nr
+申请事项 3 nz
+申请人 128 nr
+申请入党 3 n
+申请入团 3 n
+申请加入 3 n
+申请单 21 n
+申请号 3 nz
+申请回避 3 nr
+申请报告 3 n
+申请材料 3 n
+申请理由 3 n
+申请经费 3 nz
+申请者 60 n
+申请表 51 n
+申请费 3 n
+申请量 20 n
+申谢 4 v
+申贤俊 3 nr
+申购 103 v
+申购人 3 nz
+申购者 3 nz
+申购量 3 nz
+申贺 2 v
+申跃 3 v
+申辅时 2 nr
+申辩 108 v
+申辩权 3 n
+申达 9 nz
+申达表 2 nz
+申述 117 v
+申述人 3 nr
+申述立场 3 n
+申述者 3 nr
+申遗 13 v
+申鉴 2 v
+申铉俊 3 nr
+申银 27 nz
+申银万国 3 nr
+申长虹 3 nr
+申雪 21 nr
+申非 2 v
+申韩之 2 nr
+申音 4 nz
+申领 12 v
+申饬 7 v
+申首辅 5 nr
+申鲜虞 2 nr
+电 12701 n
+电三轮 3 n
+电业 36 n
+电业局 2 n
+电中性 3 n
+电主轴 3 n
+电介质 139 n
+电令 111 n
+电仪 3 n
+电价 155 n
+电传 70 n
+电传机 3 n
+电传视讯 3 n
+电传递 3 l
+电位 155 n
+电位器 4 n
+电位差 28 n
+电位移 3 n
+电位能 3 n
+电促流动 3 i
+电信 1387 n
+电信业 104 n
+电信业务 3 n
+电信公司 26 n
+电信卡 2 n
+电信号 95 n
+电信宽带 3 i
+电信局 29 n
+电信展 2 nt
+电信技术 3 n
+电信服务 2 n
+电信条例 3 n
+电信楼 3 n
+电信法 8 n
+电信网 20 n
+电偶合 3 n
+电偶层 3 n
+电偶极子 3 n
+电催化 3 vn
+电僵尸 3 n
+电光 147 n
+电光朝露 3 nz
+电光源 3 n
+电光石火 45 n
+电内渗 3 nz
+电冰柜 3 n
+电冰箱 59 n
+电冲 3 n
+电冶 3 j
+电击 78 vn
+电击穴 3 n
+电函 3 n
+电刀 3 n
+电刑 9 n
+电刷 8 vn
+电刺激器 3 n
+电剪 3 n
+电力 3225 n
+电力企业 3 n
+电力供应 3 l
+电力公司 22 n
+电力厂 3 n
+电力大学 3 l
+电力学 3 n
+电力局 21 n
+电力工业 3 n
+电力工业部 4 n
+电力工程 3 n
+电力机械 3 n
+电力机车 2 n
+电力法 4 n
+电力电缆 3 n
+电力站 3 n
+电力系统 2 l
+电力线 32 n
+电力网 12 n
+电力行业 2 n
+电力设备 3 n
+电力设施 3 n
+电力通信 3 n
+电力部 27 n
+电力部门 5 n
+电力集团 19 n
+电功率 22 n
+电加工 3 n
+电加热 8 n
+电务 3 n
+电务处 3 n
+电务段 3 n
+电动 234 n
+电动力学 102 n
+电动势 141 n
+电动叉车 3 n
+电动吊杆 3 n
+电动学 3 n
+电动工具 3 n
+电动幕 3 n
+电动式 4 n
+电动打字 3 l
+电动机 301 n
+电动汽车 10 n
+电动泵 3 n
+电动滚筒 3 n
+电动牙刷 3 l
+电动玩具 3 n
+电动窗 3 n
+电动绞盘 3 n
+电动船 3 n
+电动葫芦 3 n
+电动走道 3 n
+电动车 24 n
+电动车窗 3 n
+电动门 3 n
+电动阀 3 n
+电势 97 n
+电势差 24 n
+电势差计 3 l
+电化 25 n
+电化学 102 n
+电化教学 6 n
+电化教育 24 l
+电化铝 3 n
+电匠 3 n
+电单车 3 n
+电博会 3 n
+电印 3 n
+电厂 213 n
+电压 942 n
+电压互感 3 n
+电压可调 4 n
+电压表 22 n
+电压计 3 n
+电压钳 3 n
+电压阶跃 3 l
+电去离子 3 n
+电双层 3 l
+电双折射 3 l
+电台 1188 n
+电台节目 3 n
+电吉他 2 n
+电吉它 3 n
+电吹风 19 n
+电告 28 n
+电唁 3 vn
+电唱 3 n
+电唱头 3 n
+电唱机 4 n
+电唱针 3 n
+电商 5 n
+电喇叭 3 n
+电喷 3 nz
+电喷射 3 l
+电器 1086 n
+电器产品 2 n
+电器元件 3 n
+电器化 3 n
+电器厂 4 n
+电器城 3 n
+电器店 3 n
+电器维修 3 l
+电器网 3 n
+电器行 2 n
+电器设备 3 n
+电器配件 3 n
+电器附件 3 n
+电器集团 3 n
+电四极矩 3 n
+电围栏 3 n
+电图 2 n
+电场 424 n
+电场力 8 n
+电场线 3 n
+电声 40 n
+电声乐 3 n
+电声设备 3 n
+电壶 3 n
+电复 3 n
+电多极矩 3 l
+电大 30 b
+电子 8154 n
+电子业 7 n
+电子乐器 2 n
+电子书 741 n
+电子书库 3 n
+电子书籍 3 n
+电子云 19 n
+电子产品 28 n
+电子仪器 3 n
+电子伏特 3 n
+电子传递 3 l
+电子信函 3 n
+电子信息 6 n
+电子信箱 3 n
+电子元件 61 n
+电子光学 19 n
+电子光谱 3 n
+电子公告 2 n
+电子出版 13 n
+电子函件 2 n
+电子刊物 3 n
+电子制品 3 n
+电子化 45 n
+电子卡 4 n
+电子厂 3 n
+电子原件 3 n
+电子名片 3 n
+电子商务 451 n
+电子商务系统 2 l
+电子商城 3 n
+电子商店 2 n
+电子器件 116 n
+电子器材 3 n
+电子图书 18 n
+电子地图 3 n
+电子型 2 n
+电子城 6 n
+电子天平 3 n
+电子媒体 8 n
+电子字典 3 n
+电子学 161 n
+电子客票 3 n
+电子密度 3 n
+电子对 42 l
+电子对抗 9 n
+电子尺 3 n
+电子层 15 n
+电子屏 3 n
+电子展 2 vn
+电子工具 3 n
+电子市场 9 n
+电子干扰 3 l
+电子广告 5 n
+电子式 17 n
+电子情报 24 n
+电子战 285 n
+电子手表 8 n
+电子扫描 2 n
+电子技术 5 n
+电子报 3 n
+电子振动 3 n
+电子探针 3 n
+电子政务 47 n
+电子效应 3 n
+电子教室 3 n
+电子散射 3 n
+电子数据交换 2 l
+电子文本 3 n
+电子显微 3 l
+电子显微镜 102 n
+电子服务 3 n
+电子机械 3 n
+电子机票 3 n
+电子杂志 3 n
+电子束 93 n
+电子枪 12 n
+电子染色 3 n
+电子标签 3 n
+电子注册 3 n
+电子流 10 n
+电子游戏 30 n
+电子游戏室 4 n
+电子游戏机 33 n
+电子炉 3 n
+电子版 20 n
+电子狗 3 n
+电子玩具 3 n
+电子琴 28 n
+电子电器 3 n
+电子电工 3 n
+电子电离 3 n
+电子电路 49 n
+电子白板 3 n
+电子盘 3 n
+电子相关 3 l
+电子相册 3 l
+电子眼 11 n
+电子磅 3 n
+电子礼品 3 n
+电子礼炮 3 n
+电子科 3 n
+电子科技 3 n
+电子秤 7 n
+电子称 4 n
+电子竞技 3 n
+电子签名 36 n
+电子管 138 n
+电子管厂 6 n
+电子系 2 n
+电子系统 5 l
+电子纳体 3 n
+电子线 3 n
+电子线路 2 n
+电子组态 3 n
+电子网 3 n
+电子网络 2 n
+电子能级 3 n
+电子自旋 3 n
+电子行业 3 n
+电子衍射 3 nz
+电子衡器 3 n
+电子表 13 n
+电子表格 5 n
+电子装置 2 n
+电子警察 3 n
+电子计算 3 n
+电子计算机 10 n
+电子论 27 n
+电子设备 10 n
+电子设计 3 n
+电子词典 3 n
+电子负载 3 n
+电子货币 4 n
+电子辞典 3 n
+电子邮件 301 n
+电子邮件发送 3 nz
+电子邮件时 2 l
+电子邮件系统 2 l
+电子邮局 3 n
+电子邮箱 3 n
+电子部 22 n
+电子钟 3 n
+电子锁 3 n
+电子陶瓷 3 l
+电子零件 3 l
+电子音乐 23 n
+电子鼻 6 n
+电孕乡 3 n
+电学 109 n
+电宰 3 nrt
+电宰肉 3 n
+电容 148 n
+电容器 105 n
+电容式 3 n
+电容量 4 n
+电导 52 n
+电导体 3 n
+电导分析 3 n
+电导水 3 n
+电导滴定 3 n
+电导率 42 n
+电导计 3 n
+电导飞弹 3 n
+电工 296 n
+电工仪表 3 n
+电工器材 3 n
+电工学 6 n
+电工机械 3 n
+电工材料 3 n
+电工设备 3 n
+电工证 3 n
+电工钢 3 n
+电平 14 n
+电广 6 nz
+电广传媒 2 l
+电度 3 n
+电度表 17 n
+电建 3 n
+电弧 119 n
+电弧炉 3 n
+电弧焊 3 n
+电弧焊接 3 n
+电弧钻井 3 nz
+电影 4918 n
+电影业 13 n
+电影分级 3 n
+电影剧本 70 n
+电影协会 3 nt
+电影厂 6 n
+电影厅 133 n
+电影台 3 n
+电影史 62 n
+电影吧 3 n
+电影周 3 n
+电影圈 3 n
+电影城 5 n
+电影学 3 n
+电影学院 3 n
+电影室 3 n
+电影局 19 n
+电影展 3 n
+电影工业 3 n
+电影库 3 n
+电影摄影机 7 n
+电影明星 3 n
+电影机 6 n
+电影海报 3 n
+电影演员 3 n
+电影片 6 n
+电影版 3 n
+电影界 77 n
+电影票 12 n
+电影票房 3 n
+电影站 3 n
+电影网 3 n
+电影胶片 3 n
+电影节 364 n
+电影资讯 3 n
+电影迷 3 n
+电影队 5 n
+电影院 411 n
+电影院线 3 n
+电影频道 3 n
+电性 36 n
+电性能 17 n
+电感 39 n
+电感器 10 n
+电感应 14 n
+电感式 3 n
+电感线圈 3 n
+电慰 3 v
+电扇 53 n
+电扇厂 2 n
+电抗 4 vn
+电抗器 18 n
+电抗定理 3 n
+电抗网络 3 n
+电抛光 3 z
+电报 764 n
+电报告知 3 n
+电报局 27 n
+电报挂号 3 n
+电报机 15 n
+电报码 3 n
+电报费 3 n
+电挂 3 n
+电控 14 vn
+电控柜 3 n
+电控箱 3 n
+电控锁 3 n
+电推子 3 n
+电插头 3 n
+电插座 3 n
+电教 35 n
+电教室 3 n
+电教片 3 n
+电教馆 3 n
+电文 63 n
+电料 3 n
+电料行 3 n
+电新 3 n
+电显 3 nz
+电晕 49 n
+电晶体 3 n
+电暖 3 n
+电暖器 3 n
+电暖气 3 n
+电暖锅 3 n
+电木 3 n
+电机 554 n
+电机厂 23 n
+电机学 3 n
+电机工程 3 n
+电机科 3 n
+电机系 24 n
+电机车 3 n
+电机配件 3 n
+电杆 26 n
+电板 7 n
+电极 466 n
+电极化 3 n
+电极排列 3 n
+电极电势 3 n
+电极过程 3 l
+电枢 37 n
+电枪 3 n
+电格 3 n
+电桥 6 n
+电梯 524 n
+电梯公司 3 n
+电梯配件 3 n
+电梯门 8 n
+电梯间 6 n
+电检 3 j
+电棍 3 n
+电棒 32 n
+电椅 4 n
+电母 3 n
+电毯 3 n
+电气 506 n
+电气专业 3 l
+电气传动 3 n
+电气化 443 n
+电气化铁路 4 nz
+电气工程 3 n
+电气工程师 18 n
+电气控制 3 n
+电气焊 2 n
+电气用品 3 n
+电气石 32 n
+电气竖井 3 i
+电气系统 3 l
+电气设备 3 n
+电气设计 3 n
+电水壶 3 n
+电汇 9 n
+电汇单 3 n
+电池 693 n
+电池厂 2 n
+电池容量 3 n
+电池板 12 n
+电池电量 3 n
+电池组 30 n
+电池芯 3 n
+电法勘探 3 n
+电波 184 n
+电泳 64 n
+电泳介质 3 n
+电泳仪 3 n
+电泳分析 3 n
+电泳分离 3 n
+电泳图 3 n
+电泳图谱 3 n
+电泳型 3 n
+电泳性质 3 n
+电泳技术 3 n
+电泳条带 3 n
+电泳槽 2 n
+电泳漆 3 n
+电泳装置 3 n
+电泳转移 3 n
+电泳迁移 3 n
+电泵 3 n
+电洗脱 3 l
+电洗脱物 3 n
+电洽 3 v
+电流 1047 n
+电流值 6 n
+电流元 3 n
+电流密度 3 n
+电流强度 35 n
+电流扫描 3 n
+电流效率 3 n
+电流星散 3 l
+电流线 3 n
+电流继电 3 n
+电流表 32 n
+电流计 11 n
+电液 17 n
+电渗 3 nz
+电渗析 25 n
+电渗流 3 n
+电渣炉 3 n
+电渣焊 2 n
+电源 594 n
+电源层 2 n
+电源屏 3 n
+电源开关 3 n
+电源接口 3 n
+电源插头 3 n
+电源插座 3 n
+电源板 3 n
+电源模块 3 n
+电源线 12 n
+电源网 3 n
+电源适配器 4 n
+电源风扇 2 n
+电滚子 3 n
+电滞效应 3 n
+电灌 3 n
+电灌站 5 n
+电火花 50 n
+电火锅 3 n
+电灯 236 n
+电灯光 8 n
+电灯架 3 n
+电灯柱 3 n
+电灯泡 156 n
+电灯炮 3 n
+电灶 10 n
+电炉 51 n
+电炉厂 3 n
+电炊具 3 v
+电炒锅 3 n
+电烙铁 3 n
+电烤炉 3 n
+电烤箱 9 n
+电烫 3 n
+电热 66 n
+电热丝 3 n
+电热器 3 n
+电热器材 3 n
+电热壶 3 n
+电热杯 2 n
+电热板 3 n
+电热梳 3 n
+电热毯 12 n
+电热水器 13 n
+电热水壶 3 n
+电热法 3 n
+电热清蜡 3 n
+电热炉 3 n
+电热管 3 n
+电热膜 3 n
+电热锅 3 n
+电热风炉 3 n
+电焊 19 n
+电焊工 6 n
+电焊机 3 n
+电焊条 3 n
+电焊网 3 n
+电照风行 3 n
+电熔 2 n
+电熨斗 33 n
+电玩 16 n
+电玩展 3 nz
+电珠 3 n
+电瓶 13 n
+电瓶车 9 n
+电瓶车库 3 n
+电瓷 10 n
+电疗 27 n
+电疗仪 3 n
+电疗法 4 n
+电白 3 n
+电白县 2 n
+电监会 3 j
+电眼 4 n
+电石 38 n
+电石气 3 n
+电码 51 n
+电码本 2 n
+电磁 640 n
+电磁兼容 4 l
+电磁刹车 3 l
+电磁力 37 n
+电磁动量 3 n
+电磁场 242 n
+电磁学 110 n
+电磁干扰 2 l
+电磁式 9 n
+电磁感应 94 n
+电磁振荡 13 n
+电磁波 400 n
+电磁灶 3 n
+电磁炉 7 n
+电磁炮 12 n
+电磁线 3 n
+电磁能 12 n
+电磁脉冲 4 n
+电磁谱 3 n
+电磁质量 3 n
+电磁辐射 102 n
+电磁透镜 3 n
+电磁铁 58 n
+电磁锁 3 n
+电磁阀 2 n
+电磨 3 n
+电祝 3 n
+电离 256 n
+电离作用 3 n
+电离子 3 n
+电离室 3 n
+电离层 214 n
+电离径迹 3 n
+电离气 3 n
+电离电位 3 n
+电离能 6 n
+电离辐射 3 nz
+电稿 3 n
+电穿孔 3 n
+电穿孔仪 3 n
+电突触 3 n
+电站 282 n
+电站设备 3 n
+电童 3 n
+电笔 3 n
+电筒 43 n
+电算 6 n
+电算中心 3 n
+电算化 13 n
+电管员 3 n
+电管局 8 n
+电管站 8 n
+电精 3 n
+电纳 3 n
+电线 133 n
+电线厂 3 n
+电线杆 78 n
+电线电缆 3 n
+电线管 3 n
+电线走火 3 n
+电绝缘 3 l
+电缆 352 n
+电缆厂 7 n
+电缆头 3 n
+电缆料 3 n
+电缆沟 3 n
+电缆线 6 n
+电缆设备 3 n
+电缆附件 3 n
+电网 266 n
+电老虎 3 n
+电耗 7 n
+电联 19 n
+电联车 3 n
+电育雏伞 3 v
+电能 338 n
+电能表 14 n
+电脉冲 21 n
+电脑 3427 n
+电脑业 8 n
+电脑中心 3 l
+电脑主机 2 n
+电脑主板 3 n
+电脑书 3 n
+电脑产品 2 n
+电脑公司 3 n
+电脑内存 3 n
+电脑前 4 l
+电脑前面 2 l
+电脑包 3 n
+电脑化 4 n
+电脑厂 3 n
+电脑台 3 n
+电脑商 3 n
+电脑城 3 n
+电脑培训 3 n
+电脑媒介 3 n
+电脑室 3 n
+电脑屏幕 4 l
+电脑店 3 n
+电脑房 2 n
+电脑打字 3 l
+电脑报 4 n
+电脑报价 3 n
+电脑操作 2 l
+电脑教室 3 n
+电脑板 2 n
+电脑桌 9 n
+电脑桌面 2 n
+电脑游戏 4 n
+电脑灯 2 n
+电脑班 2 n
+电脑病 5 n
+电脑病毒 33 n
+电脑知识 3 l
+电脑硬件 6 l
+电脑科技 2 n
+电脑程式 3 n
+电脑管理 5 l
+电脑系统 7 l
+电脑线 3 n
+电脑网 3 n
+电脑网络 18 n
+电脑老师 3 n
+电脑自动 2 l
+电脑芯片 2 n
+电脑街 3 n
+电脑袋 3 n
+电脑设备 4 n
+电脑设计 2 n
+电脑诊所 3 n
+电脑课 3 n
+电脑软件 5 l
+电脑辞典 3 n
+电脑迷 3 n
+电脑部 3 n
+电脑配件 12 n
+电脑配置 2 n
+电脑锣 3 n
+电脑音乐 2 n
+电脑高手 3 n
+电脱水 3 n
+电脱离子 3 n
+电致发光 3 n
+电船 4 n
+电花 3 n
+电荷 468 n
+电荷中和 3 nz
+电荷分布 3 n
+电荷平衡 3 nz
+电荷泵 3 n
+电荷转移 3 n
+电融合 3 n
+电表 49 n
+电表厂 4 n
+电表箱 3 n
+电褥子 3 n
+电覆 3 n
+电视 4833 n
+电视业 4 n
+电视书刊 3 n
+电视书场 3 n
+电视会议 3 n
+电视信号 3 n
+电视公害 3 n
+电视剧 583 n
+电视剧场 3 n
+电视剧集 3 n
+电视医疗 3 n
+电视卡 3 n
+电视发射塔 3 n
+电视台 1275 n
+电视塔 38 n
+电视墙 3 n
+电视大学 14 n
+电视大赛 3 n
+电视局 4 n
+电视屏 5 n
+电视屏幕 2 l
+电视广告 3 n
+电视广播 3 nz
+电视总局 3 n
+电视报 9 n
+电视接收 3 n
+电视播送 3 n
+电视教学 3 n
+电视教育 3 n
+电视新闻 3 n
+电视机 456 n
+电视机厂 4 n
+电视柜 3 n
+电视栏目 3 n
+电视片 38 n
+电视王 3 n
+电视电台 3 n
+电视电话 28 n
+电视电话会议 10 n
+电视界 34 n
+电视病 3 n
+电视监控系统 2 n
+电视盒 3 n
+电视直播 3 n
+电视线 3 n
+电视网 46 n
+电视艺术家协会 2 nt
+电视节 2 n
+电视节目 28 n
+电视观众 3 n
+电视记者 3 n
+电视讲话 3 n
+电视转播 3 n
+电视辩论 3 n
+电视迷 3 n
+电视频道 2 n
+电解 201 n
+电解厂 3 n
+电解损伤 3 n
+电解提取 3 l
+电解槽 9 n
+电解水 5 n
+电解池 12 n
+电解法 33 n
+电解液 42 n
+电解炉 3 n
+电解电容 3 n
+电解质 254 n
+电解车间 3 n
+电解铜 6 n
+电解铝 13 n
+电解锰 3 n
+电触头 2 n
+电警棍 3 n
+电讯 243 n
+电讯器材 3 n
+电讯局 2 n
+电讯报 54 n
+电讯电影 3 n
+电讯社 21 n
+电讯稿 13 n
+电设备 2 n
+电话 8354 n
+电话亭 27 n
+电话会 22 n
+电话会议 73 n
+电话传真 3 l
+电话公司 9 n
+电话单 3 n
+电话卡 29 n
+电话号码 17 n
+电话员 11 n
+电话响 21 l
+电话声 5 n
+电话委托 3 n
+电话局 23 n
+电话录音 3 n
+电话拨号 3 n
+电话本 10 l
+电话机 166 n
+电话筒 3 n
+电话簿 8 n
+电话线 50 n
+电话网 36 n
+电话薄 3 l
+电话设备 3 n
+电话费 41 n
+电话铃 91 n
+电话间 5 n
+电谢 3 vn
+电谱法 3 n
+电贝司 3 n
+电负性 36 n
+电费 111 n
+电贺 4 v
+电路 636 n
+电路仿真 3 n
+电路图 8 n
+电路提取 3 l
+电路板 70 n
+电路状态 3 l
+电路系统 3 l
+电路设计 3 n
+电车 134 n
+电车之狼 3 n
+电车男 3 n
+电车站 16 n
+电轧刀 3 n
+电转化 3 n
+电转染 3 n
+电转移 3 n
+电转运 3 n
+电软 3 n
+电轴 3 n
+电迁徙 3 n
+电透析 3 l
+电通 14 n
+电邀 3 v
+电邮 3 vn
+电采暖 3 n
+电量 79 n
+电量计 3 n
+电銲 3 vn
+电针 15 n
+电针疗法 4 n
+电钟 4 n
+电钢琴 3 n
+电钮 32 n
+电钻 10 n
+电铃 16 n
+电铲 3 n
+电铸 3 n
+电锅 3 n
+电锅炉 3 n
+电锤 3 n
+电键 10 n
+电锯 31 n
+电镀 54 n
+电镀厂 3 n
+电镀法 3 n
+电镐 4 n
+电镜 20 n
+电门 6 n
+电闪 45 n
+电闪雷呜 3 l
+电闪雷鸣 24 l
+电闸 2 n
+电阻 303 n
+电阻丝 3 n
+电阻值 3 n
+电阻加热 3 n
+电阻器 21 n
+电阻损耗 2 n
+电阻炉 3 n
+电阻率 84 n
+电阻箱 3 n
+电阻表 3 n
+电除尘 3 n
+电除尘器 3 n
+电霸 3 n
+电须刀 3 n
+电风扇 39 n
+电饭煲 274 n
+电饭锅 14 n
+电驴 5 n
+电骡 3 n
+电鱼 11 n
+电鳗 22 n
+男 7434 n
+男一号 3 n
+男丁 25 n
+男上位 3 n
+男中音 6 n
+男主人 3 n
+男主角 3 n
+男乒 14 j
+男亲女爱 3 l
+男亲属 3 n
+男人 7291 n
+男人味 7 n
+男人婆 3 n
+男人家 34 n
+男人帮 3 n
+男人篇 3 n
+男人网 3 n
+男人装 3 n
+男仆 64 n
+男仔 3 n
+男仕 3 n
+男伴 8 n
+男低音 9 n
+男体盛 3 l
+男佣 3 n
+男佣人 3 n
+男保姆 3 n
+男傧相 2 vn
+男儿 216 n
+男儿有泪不轻弹 8 l
+男儿本色 3 n
+男儿泪 3 n
+男儿身 3 n
+男公关 3 n
+男医生 3 n
+男单 120 n
+男厕 3 n
+男厕所 3 n
+男友 228 n
+男双 100 j
+男变女 3 l
+男同事 3 n
+男同学 3 n
+男同志 3 n
+男同性恋 3 n
+男同胞 3 n
+男员工 3 n
+男唱女随 3 i
+男团 17 n
+男士 237 n
+男士们 3 n
+男士内衣 3 n
+男士品牌 3 n
+男士服装 3 n
+男声 24 n
+男声版 3 n
+男外衣 3 n
+男大女小 3 l
+男大当娶 3 i
+男大当婚 18 l
+男大须婚 3 i
+男女 446 n
+男女之间 3 l
+男女关系 3 l
+男女双方 3 i
+男女声 2 n
+男女平等 47 l
+男女性 16 n
+男女授受 3 l
+男女授受不亲 15 i
+男女排 3 n
+男女搭配 3 l
+男女有别 3 n
+男女朋友 3 n
+男女比例 3 n
+男女生 3 n
+男女皆可 3 i
+男女私情 3 n
+男女老小 3 l
+男女老少 130 l
+男女老幼 75 l
+男女老弱 3 l
+男女队 7 n
+男妓 3 n
+男娃 25 n
+男娃子 3 n
+男娼 3 n
+男婚女嫁 10 n
+男婚女聘 3 n
+男婴 28 n
+男婴儿 3 n
+男子 3274 n
+男子化 3 n
+男子单打 3 l
+男子双打 3 l
+男子气 11 n
+男子汉 403 n
+男子篮球 3 n
+男子组 4 n
+男孩 956 n
+男孩儿 30 n
+男孩子 229 n
+男孩子爱 3 n
+男客 18 n
+男客人 3 n
+男室女家 3 n
+男家 30 n
+男宾 12 n
+男宾止步 3 n
+男尊女卑 31 n
+男尸 3 n
+男工 46 n
+男左女右 3 l
+男巫 3 n
+男式 23 n
+男式大衣 3 n
+男性 2562 n
+男性化 42 n
+男性用品 3 n
+男性疾病 3 n
+男性病 3 n
+男才女貌 3 i
+男扮女装 3 l
+男护士 3 n
+男排 131 n
+男方 181 n
+男明星 3 n
+男星 3 n
+男朋友 326 n
+男服务员 3 n
+男权 38 n
+男杉 3 n
+男校 4 n
+男根 3 n
+男模 4 n
+男模特 3 n
+男欢女爱 30 i
+男歌手 3 l
+男歌星 3 n
+男歌迷 3 i
+男滴 3 n
+男演员 3 n
+男爵 49 n
+男爵夫人 3 nz
+男生 433 n
+男生女生 3 n
+男生宿舍 3 n
+男生追 3 i
+男用 3 n
+男用表 3 n
+男用香水 3 n
+男男女女 87 l
+男盗女娼 13 i
+男科 12 n
+男童 31 n
+男童军 3 n
+男篮 170 n
+男篮赛 3 n
+男耕女织 10 l
+男舞者 2 n
+男色 3 n
+男艺人 3 n
+男蓝 3 n
+男衣 3 n
+男装 96 n
+男贼女娼 3 i
+男足 21 n
+男足离 3 n
+男配角 3 n
+男队 66 n
+男队员 4 n
+男青年 3 n
+男靴 3 n
+男风 3 n
+男高音 38 n
+甸 311 n
+甸子 14 n
+甸马田 3 ns
+町 153 nr
+画 7559 n
+画一之法 3 i
+画下 3 n
+画下去 3 l
+画中人 24 n
+画中有画 3 n
+画中有诗 5 n
+画中游 3 n
+画中画 7 n
+画人 3 n
+画会 3 n
+画传 10 n
+画作 64 n
+画供 3 v
+画像 1625 n
+画像石 52 n
+画像砖 28 n
+画儿 3 n
+画具 6 n
+画册 194 n
+画册设计 3 n
+画分 3 n
+画分为 3 n
+画刊 17 n
+画匠 21 n
+画十字 3 n
+画卵雕薪 3 n
+画卷 144 n
+画史 3 n
+画名 8 n
+画品 3 n
+画商 3 n
+画图 57 n
+画图板 3 n
+画图笔 3 n
+画图纸 3 n
+画圆 3 n
+画圈 3 n
+画土分疆 3 i
+画圣 3 n
+画地为牢 7 i
+画地为狱 3 i
+画地作狱 3 n
+画地刻木 3 i
+画地力牢 3 i
+画地成图 3 i
+画地成牢 3 i
+画地而趋 3 i
+画地自限 3 n
+画坛 62 n
+画堂 5 n
+画境 2 n
+画外音 13 n
+画夹 4 n
+画字 2 n
+画室 68 n
+画家 1920 n
+画家村 2 n
+画尺 3 n
+画屏 9 n
+画展 198 n
+画工 18 n
+画布 44 n
+画布绷架 3 vn
+画师 64 n
+画帖 3 n
+画幅 46 n
+画店 20 n
+画廊 235 n
+画影图形 9 n
+画意 10 n
+画意诗情 3 n
+画技 8 n
+画报 116 n
+画报社 14 n
+画押 37 v
+画时代 3 n
+画景 3 n
+画本 2 n
+画来画去 3 i
+画板 17 n
+画架 11 n
+画栋雕梁 13 i
+画框 8 n
+画楼 3 n
+画水镂冰 3 i
+画沙印泥 3 n
+画沙聚米 3 n
+画法 125 n
+画法几何 3 l
+画派 250 n
+画点 3 n
+画片 13 n
+画王 3 n
+画画 146 n
+画画看 3 i
+画界 3 n
+画疆墨守 3 i
+画皮 8 n
+画眉 97 n
+画眉举案 3 i
+画眉鸟 3 i
+画眼线 3 n
+画稿 22 n
+画笔 57 n
+画符 18 n
+画符念咒 3 n
+画纸 7 n
+画线 3 n
+画绢 3 n
+画脂镂冰 3 i
+画脸 3 n
+画航 3 n
+画舫 23 n
+画船 8 n
+画苑 2 n
+画苑冠冕 3 n
+画若鸿沟 3 i
+画荻丸熊 3 nr
+画荻和丸 3 nz
+画荻教子 3 nz
+画虎 3 n
+画虎不成 3 i
+画虎不成反类犬 4 i
+画虎刻鹄 3 n
+画虎成狗 3 i
+画虎类犬 3 i
+画虎类狗 3 i
+画虎雕栋 3 i
+画蚓涂鸦 3 n
+画蛇填足 3 i
+画蛇添足 31 i
+画蛇著足 3 n
+画蛋 2 n
+画行 3 n
+画表 3 n
+画表格 3 n
+画角 26 n
+画论 24 n
+画评家 3 n
+画语 2 n
+画语录 6 n
+画谜 3 n
+画谱 9 n
+画象 3 n
+画质 25 n
+画贴 3 n
+画轴 18 n
+画野分疆 3 n
+画镜线 3 n
+画院 106 n
+画集 113 n
+画集赏 3 n
+画面 967 n
+画面感 2 n
+画面质量 3 n
+画页 2 n
+画题 3 n
+画风 158 n
+画饼 10 n
+画饼充饥 6 i
+画龙 3 n
+画龙刻鹄 3 n
+画龙点晴 3 i
+画龙点睛 26 n
+甾 94 g
+甾类 3 n
+甾醇 54 n
+畀 24 g
+畅 743 a
+畅予怀 2 nr
+畅叙 18 v
+畅叫扬疾 3 i
+畅心 3 a
+畅快 177 a
+畅怀 19 nr
+畅想 16 v
+畅想曲 6 l
+畅所欲为 3 i
+畅所欲言 52 i
+畅旺 3 a
+畅春园 28 nr
+畅流 4 v
+畅游 180 v
+畅游人 3 n
+畅盛 3 a
+畅行 134 v
+畅行无碍 3 i
+畅行无阻 8 i
+畅言 3 v
+畅谈 99 v
+畅达 272 a
+畅通 332 a
+畅通无阻 78 i
+畅酣 3 z
+畅销 1266 v
+畅销书 72 n
+畅销品 7 n
+畅销商品 3 n
+畅销小说 3 l
+畅销货 3 n
+畅销车 3 n
+畅音阁 3 nr
+畅饮 76 v
+畈 28 q
+畊 2 zg
+畋 18 g
+畋猎 9 v
+界 5931 n
+界内 82 nrt
+界内球 3 n
+界别 15 n
+界址 15 n
+界域 3 n
+界外 26 s
+界外球 47 n
+界定 276 n
+界尺 2 n
+界山 42 nrt
+界岭 488 nrt
+界最受 3 vn
+界标 14 n
+界桩 4 n
+界江 10 nz
+界沟 3 n
+界河 130 nz
+界湖 16 n
+界牌 3 n
+界石 13 n
+界碑 39 n
+界约 3 n
+界线 387 n
+界绝 3 v
+界限 895 n
+界限量规 3 n
+界面 389 n
+界面区 3 n
+界面显示 3 n
+界面缩聚 3 nz
+界面脂 3 n
+界面设计 3 n
+界面风格 3 nz
+界首 18 n
+界首县 3 ns
+界首市 3 ns
+界龙 6 nz
+畍 38 zg
+畎 16 g
+畏 611 vg
+畏光 9 v
+畏光性 3 n
+畏冷 3 a
+畏友 3 n
+畏天知命 3 i
+畏威怀德 3 i
+畏寒 3 v
+畏影恶迹 3 i
+畏影而走 3 i
+畏影避迹 3 i
+畏忌 4 v
+畏怯 181 a
+畏怯不前 3 v
+畏惧 531 v
+畏惧感 5 n
+畏惮 3 v
+畏敌如虎 3 i
+畏无知命 3 i
+畏服 3 v
+畏死 3 v
+畏水 3 v
+畏畏缩缩 41 v
+畏缩 100 v
+畏缩不前 22 i
+畏罪 53 v
+畏罪潜逃 3 i
+畏罪自杀 3 i
+畏葸 18 v
+畏葸不前 3 v
+畏途 15 n
+畏避 3 v
+畏难 17 v
+畏难情绪 3 i
+畏难苟安 3 i
+畏首畏尾 32 i
+畑 27 zg
+畔 940 ng
+畖 53 zg
+留 6648 v
+留一手 12 v
+留下 5578 v
+留下来 577 v
+留下烙印 3 n
+留不住 3 v
+留个心眼 3 l
+留人 47 n
+留任 68 v
+留传 3 v
+留住 244 v
+留余地 3 l
+留作 2 v
+留俄 3 ns
+留党察看 11 i
+留党查看 3 l
+留兰香 7 n
+留冈 3 ns
+留出 210 v
+留利 3 v
+留别 11 v
+留到 3 v
+留办 3 v
+留厂察看 3 l
+留去 3 v
+留发 3 v
+留取 18 v
+留史 2 n
+留名 47 v
+留后手 3 v
+留后路 9 l
+留园 11 n
+留在 2466 v
+留坝 3 ns
+留坝县 3 ns
+留城 3 v
+留声机 49 l
+留够 3 v
+留头发 3 i
+留好 3 v
+留字 3 v
+留存 151 v
+留存现金 3 n
+留学 1026 v
+留学人员 31 n
+留学生 494 n
+留学签证 3 n
+留学网 3 n
+留守 452 v
+留守人员 3 n
+留守处 20 n
+留完 3 v
+留客 18 v
+留宾 4 ns
+留宿 57 v
+留尼旺岛 3 ns
+留尼汪 20 ns
+留尼汪岛 13 ns
+留尾巴 3 n
+留居 3 v
+留底 4 v
+留底总额 3 n
+留底稿 3 n
+留归 3 v
+留影 36 v
+留待 185 v
+留得 3 v
+留得青山 3 ns
+留得青山在 24 l
+留德 3 nrt
+留心 496 v
+留心看着 3 l
+留念 139 v
+留思思 3 n
+留恋 211 v
+留恋不舍 3 i
+留恋忘返 3 i
+留情 271 v
+留情面 3 n
+留意 543 v
+留意到 3 v
+留成 5 v
+留所服刑 3 l
+留日学生 3 l
+留有 339 v
+留有余地 8 l
+留村 3 n
+留条 3 n
+留校 140 v
+留校察看 3 n
+留校查看 3 n
+留根 6 v
+留步 33 v
+留水 3 v
+留法 3 v
+留洋 37 ns
+留滞 3 v
+留点 3 n
+留点神 3 v
+留用 53 v
+留电话 3 v
+留留 3 v
+留痕 4 n
+留白 2 v
+留神 304 v
+留种 7 v
+留种地 3 l
+留空 31 v
+留笔 3 v
+留索 2 v
+留级 17 v
+留级包 3 n
+留级生 3 v
+留给 778 v
+留置 21 v
+留置权 9 n
+留置送达 3 i
+留美 3 v
+留美学生 3 l
+留职 3 v
+留职停薪 3 i
+留胡子 3 n
+留胡须 3 v
+留芳 6 v
+留芳后世 3 i
+留苏 3 v
+留英 3 n
+留落 3 v
+留解 3 v
+留言 158 v
+留言本 3 l
+留言条 3 l
+留言板 6 n
+留言栏 3 n
+留言版 3 n
+留言簿 10 n
+留言薄 3 l
+留话 5 v
+留话机 3 l
+留起 3 v
+留足 6 v
+留过 3 v
+留连 27 v
+留连不舍 3 i
+留连忘返 8 i
+留退步 3 vn
+留退路 5 i
+留钱 3 v
+留门 3 v
+留队 3 n
+留难 23 v
+留面子 3 n
+留香 3 v
+留驻 67 v
+留鸟 13 n
+畚 49 n
+畚斗 3 n
+畚箕 3 n
+畛 36 g
+畛域 11 n
+畜 658 zg
+畜产 57 n
+畜产品 157 n
+畜养 25 n
+畜力 46 n
+畜力车 3 n
+畜妻养子 3 n
+畜栏 3 n
+畜牧 579 n
+畜牧业 868 n
+畜牧厅 3 n
+畜牧场 14 n
+畜牧学 3 n
+畜牧局 2 n
+畜牧师 2 n
+畜牧时代 3 n
+畜牧法 3 n
+畜牧病 3 n
+畜牧网 3 n
+畜牧群 3 n
+畜牲 67 n
+畜生 459 n
+畜疫 3 n
+畜禽 350 n
+畜禽肉 4 n
+畜类 17 n
+畜群 49 n
+畜肉 6 n
+畜肥 3 n
+畜舍 12 n
+畝 39 zg
+畞 11 zg
+畠 99 zg
+畢 2 zg
+畤 22 zg
+略 4740 d
+略为 91 v
+略为好转 3 i
+略传 3 v
+略低 3 v
+略低于 3 l
+略作 60 v
+略修 3 v
+略偏 3 d
+略具 3 v
+略具雏形 3 vn
+略写 3 v
+略加 3 v
+略加修改 2 i
+略加修饰 3 n
+略加点缀 3 v
+略去 35 v
+略去不提 2 i
+略取 3 v
+略同 3 d
+略图 56 v
+略多于 3 d
+略大于 3 v
+略夺 3 v
+略嫌 3 v
+略宽 3 v
+略带 214 v
+略带酸味 3 n
+略微 277 d
+略懂 3 v
+略施 3 v
+略无忌惮 3 i
+略显 3 v
+略有 644 v
+略有不同 3 i
+略有出入 3 i
+略有所闻 6 i
+略有结余 3 i
+略注 3 v
+略略 170 v
+略知 3 v
+略知一二 31 i
+略知皮毛 3 i
+略称 9 v
+略窥一斑 3 i
+略胜 3 v
+略胜一筹 15 i
+略萨 3 ns
+略表 10 v
+略表寸心 2 i
+略表心意 3 i
+略见一斑 4 l
+略言之 3 i
+略记 3 v
+略论 26 v
+略识之无 3 l
+略识之见 3 i
+略语 2 v
+略语表 3 n
+略读 3 v
+略谈 3 v
+略轻 3 d
+略过 21 v
+略述 3 v
+略述大意 3 n
+略迹原心 3 i
+略迹原情 3 i
+略迹论心 3 i
+略逊 3 nrt
+略逊一筹 6 l
+略长 3 v
+略阳 21 ns
+略阳县 2 ns
+略高一筹 3 i
+略高于 3 l
+畦 95 q
+畦灌 3 n
+畦田 3 n
+畧 33 zg
+畨 148 zg
+畩 21 zg
+番 2751 q
+番仔 3 ns
+番代 3 n
+番休 3 ns
+番号 124 n
+番国 3 ns
+番地 3 ns
+番外篇 3 n
+番族 3 nz
+番族人 3 n
+番服 3 n
+番木瓜 8 ns
+番杏 3 n
+番杏科 2 n
+番来覆去 3 n
+番椒 3 n
+番泻 9 n
+番泻叶 3 n
+番瓜 5 ns
+番石榴 16 n
+番社 3 n
+番禺 89 ns
+番禺区 12 ns
+番禺县 13 ns
+番禺市 14 ns
+番窠倒臼 3 v
+番红 3 n
+番红花 3 n
+番红花色 3 n
+番茄 117 n
+番茄汁 4 nz
+番茄红素 12 n
+番茄花园 3 n
+番茄苷 3 nz
+番茄酱 14 n
+番荔枝 17 n
+番菜 3 n
+番薯 30 n
+番薯藤 3 n
+番藷 3 nz
+番话 3 n
+番语 3 nz
+番邦 55 ns
+番鬼 3 n
+畫 149 zg
+畬 120 zg
+畭 4 zg
+畯 5 zg
+異 5 zg
+畲 207 j
+畲族 319 nz
+畴 155 g
+畴咨之忧 3 v
+畴咨博采 3 nrt
+畴昔 5 t
+當 4 zg
+畷 3 zg
+畸 66 n
+畸人 3 n
+畸变 81 n
+畸型 3 n
+畸峰 3 n
+畸开发展 3 n
+畸形 653 n
+畸形体 3 n
+畸形儿 22 n
+畸形发展 3 n
+畸形学 3 n
+畸形物 3 n
+畸恋 3 n
+畸流洽客 3 n
+畸流逸客 3 i
+畸胎 16 n
+畸胎瘤 3 n
+畸胎癌 3 n
+畸轻畸重 3 i
+畸重 3 n
+畸重畸轻 3 i
+畸零 23 n
+畹 168 ns
+畹町 20 ns
+畹町市 6 ns
+畹町桥 9 ns
+畻 150 zg
+畼 205 zg
+畾 120 zg
+畿 133 n
+畿内 3 n
+畿辅 113 n
+疀 2 zg
+疁 17 zg
+疂 6 zg
+疃 101 g
+疄 275 zg
+疆 453 n
+疆吏 3 n
+疆土 156 n
+疆场 61 n
+疆域 402 n
+疆界 127 n
+疆隅 3 n
+疇 3 zg
+疋 58 g
+疍 63 zg
+疎 2 zg
+疏 1753 v
+疏不间亲 11 l
+疏于 70 v
+疏于防备 3 l
+疏于防范 3 l
+疏伐 3 v
+疏剪 3 v
+疏勒 132 nrt
+疏勒县 2 ns
+疏勒河 24 ns
+疏堵 3 v
+疏失 55 v
+疏密 63 a
+疏密不一 3 l
+疏密度 3 n
+疏导 140 v
+疏导化解 3 l
+疏导岗 3 n
+疏开 5 v
+疏影 3 n
+疏忽 385 v
+疏忽大意 163 l
+疏慵愚钝 3 i
+疏懒 15 v
+疏放 3 v
+疏散 215 v
+疏散人员 3 n
+疏散出口 3 i
+疏散楼梯 3 n
+疏散法 3 n
+疏散用地 3 n
+疏朗 37 a
+疏松 294 a
+疏果 3 n
+疏水 3 v
+疏水器 3 n
+疏水键 3 n
+疏水阀 3 l
+疏泄 30 v
+疏浅 3 a
+疏浚 165 v
+疏浚机 3 vn
+疏淤 3 v
+疏漏 106 v
+疏濬 3 z
+疏狂 3 a
+疏理 5 v
+疏疏密密 3 i
+疏疏拉拉 3 z
+疏疏落落 24 z
+疏离 37 v
+疏而不漏 13 i
+疏肝 38 n
+疏肝理气 3 n
+疏肝解郁 3 n
+疏苗 3 n
+疏菜 2 n
+疏落 11 v
+疏虞 35 v
+疏解 34 v
+疏财仗义 3 l
+疏财重义 3 l
+疏运 7 v
+疏远 223 a
+疏通 227 v
+疏钞 3 n
+疏阔 3 a
+疏附 3 v
+疏附县 6 ns
+疏露 3 v
+疑 1144 vg
+疑为 44 v
+疑义 26 n
+疑事无功 3 i
+疑云 52 n
+疑云重重 3 i
+疑云难消 3 l
+疑人不用 3 l
+疑人勿用 3 i
+疑似 36 v
+疑似之间 3 i
+疑似病例 3 n
+疑信参半 3 i
+疑兵 42 n
+疑凶 3 n
+疑则勿用 3 i
+疑匪 3 n
+疑团 138 n
+疑团满腹 3 i
+疑团莫释 3 i
+疑天徙日 3 i
+疑心 747 n
+疑心生暗 3 i
+疑心生暗鬼 12 i
+疑心病 16 n
+疑忌 110 n
+疑念 3 n
+疑惑 873 v
+疑惧 87 v
+疑意 3 v
+疑无路 3 i
+疑案 30 n
+疑点 102 n
+疑点重重 3 i
+疑犯 5 n
+疑猜 3 v
+疑神疑鬼 64 l
+疑神见鬼 3 i
+疑窦 56 n
+疑窦丛生 3 n
+疑端 3 n
+疑罪从无 3 l
+疑罪从有 3 i
+疑虑 385 v
+疑行无成 3 i
+疑讶 3 v
+疑诧不信 3 l
+疑误天下 3 l
+疑问 881 v
+疑问句 6 i
+疑问号 3 n
+疑问词 3 i
+疑问请 3 v
+疑阵 21 n
+疑难 671 n
+疑难杂症 16 i
+疑难案件 3 n
+疑难病 6 n
+疑难病症 7 i
+疑难解答 3 l
+疑难重症 2 i
+疑难问题 3 l
+疑鬼疑神 3 i
+疔 47 n
+疖 32 zg
+疖子 10 n
+疗 299 n
+疗伤 164 n
+疗伤止痛 3 n
+疗养 154 n
+疗养公园 3 n
+疗养区 9 n
+疗养地 21 n
+疗养所 3 n
+疗养院 82 n
+疗效 692 n
+疗效显著 3 n
+疗毒 3 n
+疗治 43 n
+疗法 702 n
+疗疮剜肉 3 v
+疗病 3 n
+疗程 148 n
+疗程短 3 n
+疙 5 n
+疙疙瘩瘩 15 z
+疙疤 3 n
+疙疤儿 3 z
+疙疸 3 n
+疙瘩 479 n
+疙瘩汤 5 n
+疙里疙瘩 8 z
+疚 43 g
+疚心疾首 3 n
+疝 62 zg
+疝气 12 n
+疟 58 n
+疟原虫 64 n
+疟原虫属 3 n
+疟子 3 n
+疟疾 172 n
+疟疾疫苗 3 n
+疟虫 3 n
+疟蚊 5 n
+疠 9 g
+疡 23 g
+疣 140 g
+疣孢菌素 3 n
+疣状增生 3 n
+疣状白斑 3 n
+疣状黄瘤 3 n
+疣鼻天鹅 7 n
+疤 206 n
+疤印 3 n
+疤斑 3 n
+疤痕 163 n
+疤痕疙瘩 3 z
+疤瘌 6 n
+疤瘌眼 4 n
+疤瘌眼儿 3 n
+疤脸 3 n
+疥 29 n
+疥疮 17 n
+疥癣 12 n
+疥癣之疾 3 nr
+疥虫 2 n
+疥螨病 3 n
+疫 122 n
+疫区 34 n
+疫情 204 n
+疫情报告 3 n
+疫源地 17 n
+疫点 4 n
+疫疠 15 n
+疫疹 3 n
+疫病 53 n
+疫苗 373 n
+疬 3 x
+疭 3 zg
+疮 293 n
+疮口 28 n
+疮疡 26 n
+疮疤 34 n
+疮痂 3 n
+疮痍 8 n
+疮痍满目 10 i
+疯 1300 v
+疯丫头 3 n
+疯了呱几 3 r
+疯人 7 n
+疯人院 11 n
+疯到 3 v
+疯女 3 n
+疯女人 3 n
+疯婆子 3 n
+疯子 437 n
+疯得 3 a
+疯杈 3 n
+疯枝 3 n
+疯涨 16 a
+疯牛 6 n
+疯牛病 45 n
+疯犬病 3 n
+疯狂 1399 a
+疯狂性 2 n
+疯狂般 3 n
+疯狂钻石 3 n
+疯狗 49 n
+疯狗式 3 n
+疯疯 3 v
+疯疯狂狂 3 n
+疯疯癫癫 92 z
+疯疯颠颠 3 z
+疯病 42 n
+疯瘫 5 n
+疯癫 34 z
+疯药 3 n
+疯言疯语 3 n
+疯话 47 n
+疯语 3 n
+疯起来 3 v
+疯长 20 n
+疯颠颠 41 z
+疯马 3 n
+疯魔 17 n
+疰夏 6 n
+疱 51 n
+疱疹 101 n
+疱疹病毒 3 n
+疲 395 zg
+疲乏 184 a
+疲于 34 v
+疲于奔命 83 i
+疲倦 387 a
+疲倦不堪 3 v
+疲倦起来 3 v
+疲劳 1148 a
+疲劳度 2 l
+疲劳强度 3 l
+疲劳感 12 l
+疲劳战 3 l
+疲劳曲线 3 l
+疲劳极限 3 l
+疲劳轰炸 3 i
+疲劳过度 3 l
+疲匮 3 i
+疲困 27 a
+疲塌 4 v
+疲弊 3 v
+疲弱 24 a
+疲态 22 n
+疲惫 478 a
+疲惫不堪 105 l
+疲惫感 4 l
+疲懒 3 a
+疲敝 9 a
+疲沓 9 a
+疲痨 3 n
+疲睏 3 v
+疲累 111 a
+疲累不堪 3 l
+疲软 219 a
+疲顿 3 a
+疳 12 n
+疳疮 3 n
+疳积 16 n
+疴 9 g
+疵 65 n
+疵品 3 n
+疵点 10 n
+疵瑕 3 n
+疵议 3 n
+疶 3 zg
+疸 4 x
+疹 92 zg
+疹块 3 n
+疹子 10 n
+疼 1860 v
+疼人 3 n
+疼心泣血 3 n
+疼怜 3 v
+疼惜 23 v
+疼爱 163 n
+疼疼 3 a
+疼痛 1834 n
+疼痛感 3 n
+疼苦 3 a
+疽 71 g
+疾 1743 n
+疾不可为 3 i
+疾书 17 n
+疾光电影 3 n
+疾呼 15 n
+疾声厉色 3 i
+疾奔 3 v
+疾如旋踵 3 i
+疾如雷电 3 n
+疾如风 3 i
+疾寥 3 i
+疾忙 78 d
+疾恶 3 n
+疾恶如仇 9 i
+疾恶如风 3 i
+疾患 205 n
+疾控中心 3 n
+疾步 40 n
+疾疫 11 n
+疾病 4194 n
+疾病基因 3 n
+疾病机理 3 n
+疾病症状 2 i
+疾病相关 3 i
+疾病相扶 3 i
+疾病诊断 3 n
+疾病谱 4 n
+疾病防治 3 n
+疾苦 240 n
+疾行 51 n
+疾视 3 n
+疾言倨色 3 i
+疾言厉气 3 i
+疾言厉色 33 i
+疾言怒色 3 i
+疾言遽色 3 z
+疾走 51 v
+疾走先得 3 i
+疾趋而过 3 n
+疾足先得 3 i
+疾跑 6 n
+疾进 3 v
+疾退 3 v
+疾速 22 n
+疾雨暴风 3 i
+疾雷 3 n
+疾风 162 n
+疾风之狼 3 n
+疾风劲草 3 n
+疾风暴雨 12 i
+疾风甚雨 3 i
+疾风知劲 3 i
+疾风知劲草 7 i
+疾风迅雷 3 vn
+疾风骤雨 3 i
+疾首痛心 3 i
+疾首蹙额 2 i
+疾驰 331 v
+疾驱 3 n
+疾驶 39 v
+痀偻 3 v
+痀偻病 3 n
+痂 52 n
+痄腮 7 n
+病 9053 n
+病事假 3 n
+病亡 3 v
+病人 3916 n
+病人数 2 n
+病从口入 18 i
+病休 13 v
+病体 69 n
+病体违和 3 i
+病例 394 n
+病倒 165 v
+病假 43 n
+病假单 3 n
+病假条 10 n
+病儿 3 n
+病入膏肓 31 i
+病入骨隨 3 v
+病入骨髓 3 n
+病况 30 n
+病况危急 3 i
+病出 3 v
+病势 86 n
+病势危殆 3 i
+病包儿 2 n
+病区 34 n
+病卒 3 n
+病危 101 n
+病历 121 n
+病历卡 3 n
+病历室 3 n
+病历本 2 n
+病历表 3 n
+病原 112 n
+病原体 130 n
+病原学 17 n
+病原菌 63 n
+病原虫 4 n
+病友 20 n
+病变 776 v
+病句 5 n
+病史 123 n
+病号 30 n
+病号服 7 n
+病号饭 2 n
+病名 3 n
+病后初愈 3 l
+病员 18 n
+病因 611 n
+病因学 3 n
+病国殃民 3 i
+病在膏肓 3 i
+病塌 3 v
+病夫 31 n
+病媒 3 n
+病媒体 3 n
+病字旁 3 n
+病学 3 n
+病孩 3 n
+病室 20 n
+病害 154 n
+病害循环 3 n
+病家 18 n
+病容 22 n
+病容满面 3 l
+病床 239 n
+病弱 35 n
+病征 9 n
+病得 3 v
+病态 170 n
+病态人格 3 n
+病态心理 3 n
+病怏怏 3 z
+病急 3 n
+病急乱投医 26 i
+病恹恹 9 z
+病患 57 n
+病患者 61 n
+病情 1029 n
+病情严重 3 i
+病情恶化 3 i
+病愈 38 v
+病成 3 v
+病房 420 n
+病故 165 n
+病有所医 2 n
+病枝 3 n
+病染膏肓 3 n
+病树 3 n
+病株 2 n
+病根 54 n
+病根儿 7 n
+病根未除 3 i
+病案 9 n
+病榻 60 n
+病歪歪 3 z
+病死 423 v
+病死他乡 3 n
+病死异乡 3 n
+病死猪 3 n
+病死率 37 n
+病殃殃 3 i
+病残 13 v
+病残率 3 n
+病毒 2340 n
+病毒传播 3 n
+病毒体 3 n
+病毒信息 5 n
+病毒唑 6 n
+病毒因子 3 n
+病毒基因 3 n
+病毒学 29 n
+病毒学家 3 n
+病毒库 3 n
+病毒性 84 n
+病毒感染 8 n
+病毒感染者 38 n
+病毒杀 3 n
+病毒检测 4 n
+病毒源 2 n
+病毒灵 3 n
+病毒疣 3 n
+病毒疫情监测 4 n
+病毒码 3 n
+病毒破坏 2 n
+病毒科 3 n
+病毒程序 7 n
+病毒粒体 3 n
+病毒组 3 n
+病毒菌素 3 n
+病毒血症 3 n
+病毒质 3 n
+病毒软件 3 n
+病毒邮件 3 n
+病毒颗 3 n
+病民害国 3 n
+病民蛊国 3 vn
+病源 36 n
+病灶 95 n
+病灾 3 n
+病牙 3 n
+病犬 3 n
+病状 15 n
+病狂 3 a
+病猪 3 n
+病猫 3 n
+病理 498 n
+病理切片 3 n
+病理变化 3 n
+病理学 110 n
+病理学家 3 n
+病理性 82 n
+病理科 3 n
+病理移位 3 n
+病理解剖 3 i
+病由口入 3 n
+病疫 3 n
+病疫情 3 n
+病疫苗 3 n
+病病歪歪 9 z
+病病殃殃 3 i
+病症 175 n
+病症状 3 i
+病痛 78 n
+病着 3 v
+病种 55 n
+病秧子 3 n
+病程 169 n
+病童 3 n
+病笃 3 z
+病粒 3 n
+病者 39 n
+病苦 6 n
+病菌 177 n
+病虫 24 n
+病虫害 378 n
+病虫草害 2 n
+病象 4 n
+病退 13 v
+病逝 208 v
+病重 174 n
+病防治 3 n
+病院 3 n
+病险 2 n
+病骨支离 3 n
+病魔 88 n
+病魔缠身 4 i
+症 1351 zg
+症侯 3 n
+症候 60 n
+症候群 3 n
+症变 3 n
+症状 2547 n
+症结 146 n
+症结所在 3 n
+痈 147 n
+痈疮 3 n
+痈疽 39 n
+痈肿 3 n
+痉 102 vn
+痉挛 301 vn
+痉挛性 17 n
+痉证 3 vn
+痊 111 v
+痊愈 278 v
+痋 179 zg
+痌瘝在抱 3 v
+痍 5 g
+痎 16 zg
+痐 2 zg
+痒 632 a
+痒斯斯 3 nz
+痒生 3 a
+痒痒 162 a
+痒觉 3 a
+痒酥酥 3 z
+痔 129 n
+痔漏 2 n
+痔疮 106 n
+痔疮膏 2 nz
+痕 441 n
+痕垢 3 n
+痕记 3 n
+痕迹 909 n
+痕迹理论 3 n
+痕量 54 n
+痕量级 3 n
+痖 6 g
+痘 156 n
+痘子 3 n
+痘浆 3 n
+痘疮 3 n
+痘疱 2 n
+痘疱试验 3 n
+痘疹 9 n
+痘病毒 3 n
+痘痘 3 n
+痘苗 3 n
+痚 2 zg
+痛 3680 a
+痛下决心 27 l
+痛下针砭 3 v
+痛不可忍 5 i
+痛不欲生 62 i
+痛不痛 3 i
+痛之入骨 3 i
+痛入心脾 3 i
+痛入骨髓 17 i
+痛决 3 v
+痛击 34 v
+痛切 34 a
+痛剿穷迫 3 i
+痛哭 666 v
+痛哭失声 3 i
+痛哭流涕 67 i
+痛处 76 v
+痛失 24 v
+痛失良机 3 i
+痛定思痛 53 i
+痛宰 3 v
+痛彻 28 v
+痛彻心腑 3 i
+痛彻心骨 3 i
+痛彻骨髓 3 i
+痛心 305 v
+痛心伤臆 3 i
+痛心入骨 3 i
+痛心切骨 3 i
+痛心拔脑 3 i
+痛心疾首 106 i
+痛心病首 3 i
+痛心绝气 3 i
+痛快 802 a
+痛快淋漓 33 i
+痛恨 375 v
+痛恶 3 a
+痛悔 26 v
+痛悔前非 3 i
+痛悼 14 v
+痛惜 91 v
+痛惩 3 v
+痛感 88 a
+痛打 188 v
+痛打一顿 3 i
+痛打落水狗 14 i
+痛揍 3 v
+痛揍一顿 3 v
+痛改前非 37 i
+痛斥 121 v
+痛断肝肠 3 i
+痛楚 297 a
+痛死 3 v
+痛歼 3 v
+痛殴 5 v
+痛深恶绝 3 i
+痛湔宿垢 3 nr
+痛点 6 n
+痛爱 3 a
+痛狠 3 z
+痛痒 37 a
+痛痒相关 3 l
+痛痛 3 a
+痛痛快快 113 z
+痛痛病 3 i
+痛痹 3 v
+痛经 117 d
+痛自创艾 3 i
+痛自悔改 3 i
+痛苦 3520 an
+痛苦万分 3 i
+痛苦万状 3 i
+痛苦不堪 3 i
+痛苦失声 3 i
+痛苦状 4 i
+痛觉 46 a
+痛责 25 v
+痛起来 3 l
+痛陈 20 v
+痛风 47 n
+痛风性 3 n
+痛风病 3 n
+痛饮 88 v
+痛饮黄龙 3 i
+痛骂 169 v
+痛骂一顿 3 i
+痝 11 zg
+痞 34 n
+痞块 8 n
+痞子 49 n
+痞子男 3 n
+痞棍 3 n
+痞满 8 n
+痞积 3 n
+痞里痞气 3 n
+痟 6 zg
+痠 9 zg
+痠疼 3 z
+痠痛 3 vn
+痠软 3 z
+痢 166 n
+痢特灵 3 n
+痢疾 106 n
+痢疾杆菌 3 n
+痣 165 n
+痤 4 n
+痤疮 41 n
+痤疮炎 3 n
+痦子 9 n
+痧 69 vn
+痨 32 n
+痨病 68 n
+痪 101 x
+痫 25 x
+痫症 3 nz
+痫证 3 nz
+痫速康 2 nz
+痬 2 zg
+痭 5 zg
+痰 899 n
+痰厥 5 n
+痰喘 3 nz
+痰桶 3 n
+痰气 3 n
+痰盂 33 n
+痰罐 3 n
+痰迷心窍 7 i
+痰迹 3 n
+痰饮 3 n
+痱 6 n
+痱子 17 n
+痱子粉 2 n
+痱粉 3 n
+痲子 3 v
+痲疯病 3 nr
+痲疯院 3 nr
+痲痹不了 3 n
+痲类 3 vn
+痲脸 3 vn
+痲衣 3 vn
+痳 13 zg
+痳病 3 vn
+痴 528 a
+痴丫头 5 nr
+痴人 3 n
+痴人说梦 29 i
+痴傻 3 v
+痴儿呆女 3 n
+痴公子 2 n
+痴呆 149 z
+痴呆呆 13 z
+痴呆症 5 n
+痴婆 2 n
+痴子 2 n
+痴学不悟 3 i
+痴心 106 n
+痴心人 3 i
+痴心妄想 62 i
+痴心汉 3 nr
+痴恋 20 v
+痴情 115 n
+痴情女 3 i
+痴想 16 n
+痴意 2 v
+痴狂 5 a
+痴男怨女 3 i
+痴痴 91 z
+痴痴傻傻 3 i
+痴痴呆呆 33 z
+痴痴地 43 z
+痴笑 4 nr
+痴肥 3 n
+痴肥臃肿 3 v
+痴迷 125 v
+痴迷不悟 3 i
+痴迷者 3 nr
+痴醉 3 nr
+痴钝 3 a
+痵 18 zg
+痷 6 zg
+痹 138 ng
+痹症 11 n
+痹证 10 n
+痼 3 n
+痼习 3 n
+痼疾 42 n
+痼癖 3 n
+痿 27 zg
+痿证 9 n
+瘀 249 g
+瘀伤 3 n
+瘀斑 22 n
+瘀泥 3 n
+瘀积 3 n
+瘀脓 3 n
+瘀血 3 n
+瘁 10 vg
+瘅 3 x
+瘆 7 zg
+瘇 33 zg
+瘈 27 zg
+瘈脉 3 z
+瘉 73 zg
+瘊子 5 n
+瘋 8 zg
+瘌痢 3 n
+瘌痢头 2 n
+瘎 28 zg
+瘏 6 zg
+瘏口哓音 3 v
+瘐 8 x
+瘑 123 zg
+瘒 10 zg
+瘓 3 zg
+瘔 27 zg
+瘕 15 zg
+瘖 13 zg
+瘗 9 g
+瘗玉埋香 3 v
+瘘 75 g
+瘘管 17 n
+瘙 4 zg
+瘙痒 133 a
+瘙痒症 3 v
+瘚 4 zg
+瘛 96 x
+瘜 16 zg
+瘝 34 zg
+瘞 4 zg
+瘟 130 n
+瘟到死 3 n
+瘟疫 247 n
+瘟疫区 3 n
+瘟疫论 3 n
+瘟疹 3 n
+瘟病 9 n
+瘟神 56 n
+瘟酒巴 3 n
+瘟鸡 3 n
+瘠 50 zg
+瘠义肥辞 3 nz
+瘠人肥己 3 v
+瘠己肥人 3 nz
+瘠牛羸豚 3 n
+瘠瘦 3 a
+瘠薄 41 a
+瘡 51 zg
+瘢 90 zg
+瘢儿 3 n
+瘢点 3 n
+瘢痕 123 n
+瘤 615 n
+瘤子 53 n
+瘤牛 3 n
+瘤胃 12 n
+瘦 1821 a
+瘦下去 3 l
+瘦下来 3 l
+瘦丐 3 n
+瘦削 198 a
+瘦商人 3 n
+瘦大腿 3 nz
+瘦头陀 3 ns
+瘦子 229 n
+瘦小 152 z
+瘦干 11 n
+瘦弱 157 a
+瘦弱不堪 3 l
+瘦成 3 nz
+瘦果 37 n
+瘦棱棱 3 n
+瘦溜 3 z
+瘦点 3 n
+瘦煤 9 n
+瘦猪肉 3 n
+瘦田 3 nz
+瘦瘠 4 a
+瘦瘦 3 z
+瘦瘦小小 3 z
+瘦瘦怯怯 3 z
+瘦瘦的 46 z
+瘦瘦长长 3 z
+瘦瘦高高 3 z
+瘦瘪 3 a
+瘦羊博士 3 ns
+瘦肉 61 n
+瘦肉型 17 b
+瘦肉汤 3 nz
+瘦肉率 21 nz
+瘦肉粥 3 nz
+瘦肉精 178 nz
+瘦西湖 23 ns
+瘦身 3 n
+瘦身操 3 l
+瘦身汤 3 l
+瘦身法 3 l
+瘦金体 7 n
+瘦长 116 n
+瘦长子 3 n
+瘦马 3 nz
+瘦骨伶仃 3 ns
+瘦骨如柴 3 n
+瘦骨嶙峋 36 l
+瘦骨嶙嶙 3 l
+瘦骨梭棱 3 n
+瘦高 37 a
+瘦高挑儿 3 z
+瘧 5 zg
+瘨 28 zg
+瘩 3 x
+瘪 117 a
+瘪三 16 n
+瘪三儿 3 n
+瘪嘴 3 n
+瘪嘴子 3 n
+瘪屑 3 n
+瘪瘪的 3 z
+瘪着嘴 3 v
+瘪谷 3 n
+瘪陷 3 n
+瘫 259 v
+瘫下来 3 v
+瘫坐 3 v
+瘫子 2 v
+瘫废 3 v
+瘫痪 463 v
+瘫痪病人 3 n
+瘫软 81 v
+瘬 45 zg
+瘮 123 zg
+瘯 52 zg
+瘰 16 n
+瘰疬 20 n
+瘲 10 zg
+瘳 4 nr
+瘴 94 n
+瘴乡恶土 3 n
+瘴气 60 n
+瘴疠 12 n
+瘴疠之气 3 v
+瘴雨蛮烟 3 n
+瘵 2 g
+瘷 32 zg
+瘸 168 v
+瘸子 32 n
+瘸脚 3 n
+瘸腿 37 n
+瘹 22 zg
+瘺 56 zg
+瘼 8 g
+瘽 337 zg
+瘾 267 n
+瘾君子 10 n
+瘾头 14 n
+瘿 81 g
+瘿病 3 n
+瘿瘤 3 n
+癀 3 x
+癁 4 zg
+療 20 zg
+癃 5 n
+癃闭 17 n
+癇 7 zg
+癈 6 zg
+癉 3 zg
+癊 3 zg
+癋 23 zg
+癌 622 zg
+癌变 83 n
+癌基因 3 n
+癌学 3 n
+癌病 2 n
+癌症 730 n
+癌症前期 3 v
+癌症口才 3 v
+癌症病人 3 n
+癌症病患 3 n
+癌症肿瘤 3 n
+癌瘤 16 n
+癌细胞 137 n
+癌肿 19 n
+癌胚抗原 3 n
+癌调蛋白 3 n
+癌魔 2 n
+癍 39 n
+癎 9 zg
+癑 2 zg
+癔 4 n
+癔病 25 n
+癔症 9 nz
+癕 6 zg
+癖 126 ng
+癖习 3 n
+癖亨 3 n
+癖好 33 n
+癖性 9 n
+癗 2 zg
+癙 3 zg
+癚 15 zg
+癜 9 g
+癝 4 zg
+癞 78 n
+癞头 3 n
+癞子 7 n
+癞瓜 3 n
+癞疮 3 n
+癞病 3 n
+癞痢 26 n
+癞癣 3 n
+癞皮狗 19 l
+癞虾蟆 3 n
+癞蛤蟆 52 n
+癞蛤蟆想吃天鹅肉 8 l
+癡 3 zg
+癣 54 n
+癣疥 3 i
+癣疥之疾 7 i
+癥 9 zg
+癧 2 zg
+癨 2 zg
+癫 79 n
+癫子 17 n
+癫狂 53 a
+癫疯 3 n
+癫痫 134 n
+癫痫病 18 n
+癮 2 zg
+癯 16 zg
+癱 4 zg
+癳 114 zg
+癶 2 zg
+癸 285 zg
+癸丑 12 m
+癸二酸 5 nz
+癸亥 8 m
+癸亥年 2 nz
+癸午 3 m
+癸卯 19 m
+癸基 3 nz
+癸子 3 m
+癸寅 3 m
+癸巳 12 m
+癸巳类 3 m
+癸戌 3 m
+癸未 9 m
+癸炔 3 nz
+癸烯 3 nz
+癸烷 3 nz
+癸申 3 m
+癸辰 3 nz
+癸酉 7 m
+癸酉日 2 m
+癸酮 3 nz
+癸酸 3 nz
+癸醇 3 nz
+癸醛 3 nz
+癹 2 zg
+登 3055 v
+登上 1558 v
+登临 53 v
+登临意 2 i
+登位 3 v
+登入后 3 l
+登入器 3 nz
+登出 50 v
+登出去 3 v
+登出来 3 v
+登到 3 v
+登台 429 v
+登台拜将 3 n
+登台演唱 3 l
+登喜路 3 l
+登在 3 v
+登场 329 n
+登坛拜将 2 i
+登基 1492 nrt
+登堂 3 nz
+登堂入室 25 i
+登堡 51 ns
+登天 3 nz
+登字头 3 n
+登封 81 v
+登封县 13 ns
+登封市 7 ns
+登山 517 ns
+登山临水 3 nz
+登山包 6 nz
+登山协会 3 nz
+登山家 5 nz
+登山小鲁 3 nz
+登山扣 3 nz
+登山服 2 nz
+登山涉岭 3 l
+登山涉水 3 i
+登山绳 27 nz
+登山者 3 nz
+登山节 18 ns
+登山越岭 3 ns
+登山运动 22 nz
+登山队 132 nz
+登山队员 16 l
+登山陟岭 3 ns
+登山鞋 7 nz
+登岸 75 n
+登峰 3 nz
+登峰造极 87 n
+登崖 3 ns
+登州 3 ns
+登市 3 ns
+登帐 3 v
+登广告 4 n
+登录 462 v
+登录号 3 nz
+登录名 3 n
+登录器 3 nz
+登徒子 3 l
+登报 27 nz
+登报作废 3 i
+登报声明 3 i
+登攀 9 v
+登时 3150 d
+登月 169 nz
+登月小艇 3 n
+登月舱 28 n
+登木求鱼 3 i
+登机 93 n
+登机口 15 n
+登机牌 17 nz
+登极 371 ns
+登楼 3 v
+登海 6 ns
+登珠峰 3 nz
+登用 3 v
+登界游方 3 nz
+登科 16 nz
+登程 24 n
+登空 3 v
+登第 3 nz
+登舟 3 nz
+登船 3 v
+登记 1810 v
+登记册 16 nz
+登记制 2 nz
+登记单 3 n
+登记卡 5 nz
+登记号 3 nz
+登记员 2 n
+登记器 3 nz
+登记在册 201 l
+登记处 4 nz
+登记手续 3 l
+登记日 347 nz
+登记本 6 l
+登记法 2 nz
+登记注册 4 nz
+登记牌 2 nz
+登记税 3 nz
+登记簿 16 n
+登记薄 3 l
+登记表 71 nz
+登记证 19 nz
+登记费 7 nz
+登记量 3 n
+登账 3 v
+登起 3 v
+登起来 3 v
+登车 3 v
+登车桥 3 ns
+登载 62 v
+登过 3 v
+登进士 3 n
+登锋履刃 3 i
+登锋陷阵 3 i
+登门 177 ns
+登门拜访 3 i
+登陆 1513 v
+登陆作战 3 n
+登陆器 3 n
+登陆场 3 n
+登陆密码 3 n
+登陆战 115 nz
+登陆点 13 n
+登陆舰 297 n
+登陆艇 140 n
+登霄 9 n
+登革热 20 nz
+登革热病 3 n
+登革病毒 3 l
+登顶 64 n
+登顿 5 nrt
+登高 114 v
+登高一呼 12 i
+登高去梯 3 n
+登高履危 3 i
+登高必赋 3 l
+登高望远 6 i
+登高自卑 3 i
+登龙 3 nz
+發 3 zg
+白 12266 a
+白丁 19 nr
+白丁俗客 3 nr
+白万剑 445 nr
+白三叶 5 nr
+白三烯 3 nr
+白三色 3 nr
+白下区 4 n
+白不呲咧 3 z
+白不拉几 3 i
+白专 5 nr
+白专道路 3 nr
+白世镜 125 nr
+白丽娜 214 nr
+白乃庙 2 nr
+白乃心 5 nr
+白乎乎 4 z
+白乐天 8 nr
+白乙丙 2 nr
+白乳胶 3 n
+白事 3 n
+白二侠 33 nr
+白二弟 8 nr
+白于山 4 nr
+白云 389 nr
+白云亲舍 3 nr
+白云区 22 nr
+白云孤飞 3 nr
+白云宗 6 nr
+白云宫 2 nr
+白云寺 12 nr
+白云山 102 nr
+白云岩 76 nr
+白云岭 16 nr
+白云峡 2 nr
+白云峰 9 nr
+白云庵 25 nr
+白云悠悠 2 nr
+白云机场 34 n
+白云村 256 nr
+白云母 3 nr
+白云洞 5 nr
+白云片片 3 nz
+白云石 99 nr
+白云矿区 2 n
+白云聚 2 nr
+白云花根 3 ns
+白云苍狗 7 nr
+白云观 87 nr
+白云质 2 nr
+白云路 3 nr
+白云鄂 9 nr
+白云飞 3 nr
+白云鹏 8 nr
+白亮亮 3 nr
+白人 442 n
+白介 3 n
+白介素 2 nr
+白令 71 n
+白令海 47 nr
+白令海峡 3 ns
+白令陆 3 nr
+白体 3 n
+白俄 3 ns
+白俄罗斯 311 ns
+白俄罗斯共和国 3 ns
+白保罗 2 nr
+白僵菌 4 nr
+白僵菌素 3 n
+白僵蚕 3 nr
+白先勇 10 nr
+白光 105 nr
+白光伏 14 nr
+白光光 5 nr
+白光微 2 nr
+白光恩 7 nr
+白光连 4 nr
+白光闪 9 nr
+白克明 19 nr
+白兔 62 nr
+白兔赤乌 3 nr
+白公胜 3 nr
+白公馆 15 n
+白兰 26 nr
+白兰地 36 nz
+白兰地酒 8 nz
+白兰度 8 ns
+白兰恩 3 nr
+白兰瓜 17 nr
+白兰花 23 nr
+白关镇 2 nr
+白兴儿 44 nr
+白其斗 2 nr
+白养 3 n
+白内障 102 n
+白军 39 nr
+白冠长 7 nr
+白冰冰 2 nr
+白净 100 nr
+白净净 3 z
+白凤丸 6 nr
+白凤双 2 nr
+白凤心 2 nr
+白凤忙 2 nr
+白凤怒 2 nr
+白凤见 2 nr
+白凤鸣 5 nr
+白刃 85 nr
+白刃之 3 nr
+白刃如 4 nr
+白刃战 11 nr
+白刚玉 3 nr
+白刷刷 3 z
+白刺 4 n
+白刺属 2 n
+白前 3 t
+白剑峰 7 nr
+白努力 3 nr
+白劳德 5 nr
+白匀唤 2 nr
+白匀环 2 nr
+白包 3 n
+白化 3 n
+白化病 2 n
+白化鹿 2 nr
+白匪 7 n
+白区 66 n
+白千石 3 nr
+白半黑 2 ns
+白华之怨 3 i
+白卡纸 20 nz
+白卫军 7 nr
+白卷 28 n
+白厂丝 2 nr
+白厅 8 n
+白厉厉 4 nr
+白又光 2 nr
+白及 3 ns
+白友善 2 nr
+白发 423 nr
+白发丹心 3 nz
+白发人 9 n
+白发千丈 3 i
+白发斑白 3 n
+白发朱颜 3 nr
+白发皤然 3 z
+白发红颜 2 nr
+白发苍 3 nr
+白发苍苍 49 i
+白发苍颜 3 nr
+白发青衫 3 nr
+白变红 3 nr
+白叟黄童 3 nr
+白口 10 n
+白口铁 3 n
+白吃 67 nr
+白吃白喝 3 l
+白吊谎 2 nr
+白名单 3 nr
+白吕纳 5 nr
+白吴氏 4 nr
+白哈巴 4 nr
+白唇鹿 32 nr
+白喉 49 n
+白喉毒素 3 n
+白喜林 3 nr
+白喝 3 nr
+白嘉倩 3 nr
+白嘉措 2 nr
+白嘉轩 1152 nr
+白国豪 2 nr
+白土 12 n
+白土关 5 ns
+白土岗 14 nr
+白土精制 3 n
+白圭 136 ns
+白圭司 2 nr
+白地 76 n
+白坚木 2 nr
+白坛主 10 nr
+白垢 3 n
+白垣白 2 nr
+白垩 142 n
+白垩纪 176 n
+白垩质 3 n
+白城 65 ns
+白城地区 6 ns
+白城市 22 ns
+白堤 12 nr
+白堤路 3 nr
+白塔 62 nr
+白塔区 3 ns
+白塔寺 30 nr
+白塔山 8 nr
+白塔村 2 nr
+白塔路 2 nr
+白塞尔 2 nr
+白塞氏 2 nr
+白塞病 3 nr
+白墙 2 n
+白壁 3 nr
+白士弘 2 nr
+白壳蛋 3 n
+白夜 260 t
+白大侠 5 nr
+白大夫 3 nr
+白大弟 4 nr
+白大褂 43 n
+白大钧 3 nr
+白天 1456 t
+白天明 6 nr
+白天见鬼 3 nr
+白天鹅 20 nr
+白天黑夜 3 i
+白头 72 n
+白头不终 3 i
+白头之叹 3 i
+白头仙 3 nr
+白头偕老 36 i
+白头到老 9 i
+白头发 15 i
+白头如新 2 i
+白头山 20 ns
+白头山天池 23 ns
+白头峰 2 nr
+白头相守 3 i
+白头相并 3 n
+白头翁 12 nr
+白头而新 3 i
+白头鸟 3 n
+白头鹤 8 nr
+白奴 2 nr
+白如玉 35 nr
+白如银 2 nr
+白如霜 4 nr
+白姐姐 6 nr
+白娘子 20 nr
+白娜娜 8 nr
+白嫩 336 ns
+白子 36 n
+白子正 2 nr
+白字 5 n
+白孝布 2 nr
+白孝德 2 nr
+白孝文 181 nr
+白孝武 62 nr
+白守礼 3 nr
+白室 2 n
+白宫 678 nr
+白家 376 n
+白家巷 2 nr
+白家庄 21 nr
+白家湾 2 nr
+白家疃 2 nr
+白寒松 18 nr
+白寒枫 127 nr
+白对虾 3 n
+白寿彝 14 nr
+白小姐 3 nr
+白尔纯 3 nr
+白尚显 2 nr
+白尚相 2 nr
+白尼罗河 25 ns
+白尼马 2 nr
+白尾海 5 nr
+白尾鹿 3 nr
+白居寺 4 nr
+白居易 155 nr
+白居谢 3 nr
+白屈菜 2 nr
+白屋 3 n
+白屋之士 3 nr
+白屋寒门 3 nr
+白山 47 ns
+白山市 26 ns
+白山派 5 nr
+白山黑水 33 ns
+白岩山 6 nr
+白岩松 21 nr
+白崇禧 125 nr
+白巧克力 3 nr
+白布 453 nr
+白布条 5 nr
+白帆太 2 nr
+白帆真 2 nr
+白帆离 2 nr
+白帆那 2 nr
+白师伯 6 nr
+白师兄 8 nr
+白师嫂 4 nr
+白希瑛 2 nr
+白希瑜 4 nr
+白帝城 54 nr
+白帢青衫 3 nz
+白带 281 n
+白带鱼 3 n
+白帽 25 n
+白干 9 nr
+白干儿 3 nr
+白平衡 3 nr
+白广恩 20 nr
+白底 37 t
+白底黑字 3 n
+白庙乡 13 nr
+白庙子 2 nr
+白度 8 n
+白度母 2 nr
+白开水 31 nr
+白彦花 2 nr
+白彦虎 6 nr
+白影 45 n
+白影微 2 nr
+白影闪 2 nr
+白往黑来 3 i
+白德尔 8 nr
+白德彰 3 nr
+白志迪 3 nr
+白忙 3 nr
+白念 4 n
+白恩培 3 nr
+白恩杰 47 nr
+白扁豆 3 nr
+白手 15 n
+白手兴家 3 n
+白手成家 3 nz
+白手空拳 3 i
+白手起家 33 nz
+白扯 3 v
+白报纸 3 n
+白拿 3 ns
+白振双 2 nr
+白振忙 2 nr
+白振见 8 nr
+白捡 3 v
+白描 68 n
+白搭 56 nr
+白攀郑 2 nr
+白敦尔 12 nr
+白文 27 nr
+白文建 2 nr
+白文杰 50 nr
+白文选 13 nr
+白斑 67 n
+白斑病 2 n
+白斑症 3 n
+白斩 2 nz
+白斩鸡 2 i
+白方 3 n
+白旄黄钺 4 i
+白族 628 nz
+白旗 304 nr
+白无常 2 i
+白日 192 t
+白日上升 3 nr
+白日作梦 3 nz
+白日做梦 18 i
+白日升天 3 nz
+白日撞 3 nr
+白日梦 24 nz
+白日绣衣 3 nz
+白日翁 3 nr
+白日衣绣 3 nz
+白日见鬼 3 i
+白日门 3 nr
+白日青天 3 nz
+白日飞升 3 nr
+白旬 3 t
+白旺见 2 nr
+白明川 64 nr
+白春礼 7 nr
+白昼 257 nr
+白昼黑夜 3 v
+白晃晃 17 z
+白晋 17 t
+白晋进 3 nr
+白晓燕 3 nr
+白景富 2 nr
+白晶晶 3 nr
+白暨豚 4 n
+白月光 3 nr
+白朗 25 nr
+白朗县 2 ns
+白朗峰 3 nr
+白木 8 nr
+白木兰 3 nr
+白木耳 6 nr
+白木行久 3 nr
+白术 33 n
+白术散 5 nr
+白朴 9 nr
+白杆兵 11 nr
+白村江 9 nr
+白条 37 n
+白条子 15 nr
+白条猪 3 n
+白条鸡 3 n
+白条鸭 3 n
+白杨 134 nr
+白杨木 3 nr
+白杨林 3 nr
+白杨树 40 nr
+白杨河 5 nr
+白板 34 n
+白板笔 3 n
+白板纸 3 n
+白板说 3 nrfg
+白枕鹤 5 nr
+白果 299 n
+白果树 28 nr
+白格生 3 nr
+白案 3 n
+白桦 93 nr
+白桦林 8 nr
+白桦树 21 nr
+白梨 6 nr
+白棉 12 n
+白森森 40 nr
+白楼 9 n
+白榴石 4 n
+白歆惠 3 nr
+白毛 15 nr
+白毛女 49 nr
+白毛狗 2 nr
+白毛男 2 nr
+白毛舌 3 nr
+白毛蒙 3 nr
+白毛风 7 nr
+白氏双 4 nr
+白气 3 n
+白水 46 nr
+白水县 4 ns
+白水台 3 nr
+白水城 3 nr
+白水塘 3 nr
+白水晶 3 nr
+白水江 16 nr
+白水河 9 nr
+白水泥 3 nr
+白水滩 2 nr
+白水鉴心 3 i
+白水镇 2 nr
+白永权 5 nr
+白求恩 89 nr
+白求恩医科大学 3 nt
+白求恩国际和平医院 3 nt
+白江 3 ns
+白江之 2 nr
+白池 2 n
+白汤 4 nr
+白汪汪 2 z
+白沙 81 nr
+白沙县 3 ns
+白沙屿 2 nr
+白沙岛 3 ns
+白沙岭 2 ns
+白沙州 3 ns
+白沙洲 1024 ns
+白沙湾 3 ns
+白沙滩 13 nr
+白沙瓦 23 nr
+白沙糖 3 nr
+白沙镇 15 nr
+白沙黎族自治县 2 ns
+白沟 87 ns
+白沟镇 2 nr
+白沫 79 n
+白沫子 3 nr
+白河 106 ns
+白河县 31 ns
+白河愁 3 nr
+白油 2 n
+白波帅 2 nr
+白泥 5 n
+白泽 3 nr
+白洋 269 ns
+白洋淀 87 ns
+白活 21 n
+白流 2 n
+白流苏 3 ns
+白浆 2 n
+白浆土 20 n
+白浊 3 nr
+白浪 105 nz
+白浪伸 2 nr
+白浪掀天 3 z
+白浪河 3 nr
+白浪滔天 8 i
+白浮村 2 nr
+白海 43 ns
+白海棠 7 nrfg
+白海豚 3 n
+白消安 2 nr
+白润 5 n
+白渣 2 n
+白湖 2 ns
+白湖乡 5 ns
+白湖亭 3 nr
+白湖子 2 nr
+白满仓 2 nr
+白滨 6 ns
+白漆 3 n
+白澳政策 3 nr
+白濛濛 3 z
+白灰 34 n
+白灵头 2 nr
+白灵笑 3 nr
+白灵羞 2 nr
+白灵菇 3 nr
+白灿灿 3 nr
+白炭黑 3 ns
+白点 25 n
+白炽 5 nr
+白炽灯 51 n
+白炽灯光 2 nr
+白炽电灯 3 n
+白烟 30 n
+白烟喷 2 nr
+白热 3 n
+白热化 103 n
+白煤 2 n
+白熊 58 nr
+白燕升 2 nr
+白版 3 n
+白牙 11 ns
+白牡丹 5 nr
+白狄族 2 nr
+白狐 7 nz
+白狗子 3 nr
+白狗精 4 nr
+白狗蛋 4 nr
+白狼山 2 nr
+白狼王 5 nr
+白猪 7 n
+白猫 39 n
+白猴 3 n
+白率兵 2 nr
+白玉 179 nr
+白玉乔 11 nr
+白玉兰 270 nr
+白玉县 3 nr
+白玉圭 12 nr
+白玉堂 2 nr
+白玉山峰 2 nr
+白玉峰 3 nr
+白玉微瑕 3 i
+白玉无瑕 2 i
+白玉桥 2 nr
+白玉椅 2 nr
+白玉琢 2 nr
+白玉瓶 2 nr
+白玉生 3 nr
+白玉盒子 2 nr
+白玉石 132 nr
+白玉钏 2 nr
+白玉阶 13 nr
+白玉雕 8 nr
+白玉霜 9 nr
+白玉龙 3 nr
+白玩 3 n
+白玫瑰 10 nr
+白环俞 3 nr
+白珊 3 ns
+白珍珠 2 nr
+白班 2 nr
+白球放 2 nr
+白琳镇 3 nr
+白瑞德 2 nr
+白璧三献 3 i
+白璧微瑕 2 i
+白璧无瑕 2 i
+白璧青蝇 3 i
+白瓜子 8 nr
+白瓷 64 n
+白瓷缸 2 nr
+白生生 22 nr
+白用 3 n
+白申庭 5 nr
+白疼 3 z
+白痢 3 n
+白痴 242 nr
+白痴仔 3 nr
+白痴梦 3 nr
+白痴般 3 z
+白癜风 20 n
+白癣 3 n
+白癫疯 3 n
+白癫风 3 n
+白登之围 4 nr
+白登云 2 nr
+白白 510 nr
+白白净净 16 z
+白白地 85 z
+白白嫩 3 nr
+白白朱朱 3 nr
+白白浪费 3 n
+白白的 63 z
+白白胖胖 27 z
+白皑皑 7 z
+白皙 83 nr
+白皮 9 n
+白皮书 95 nr
+白皮松 15 nr
+白盔 3 n
+白相 9 nr
+白眉僧 38 nr
+白眉如 2 nr
+白眉白 3 nr
+白眉赤眼 3 i
+白眉长 3 nr
+白眉鹰 31 nr
+白眼 170 n
+白眼儿 3 nr
+白眼狼 3 nr
+白眼珠 3 nr
+白眼相看 3 i
+白睛 4 n
+白睛多 2 nr
+白睛红 4 nr
+白矮星 68 n
+白石 556 nr
+白石头 5 nr
+白石山 2 nr
+白石桥 7 nr
+白石洲 3 ns
+白石灰 2 nr
+白石英 2 nr
+白石道人 14 n
+白矾 10 n
+白砂 3 n
+白砂糖 22 n
+白碑子 2 nr
+白碱滩区 3 n
+白碳黑 3 nz
+白磷 34 nr
+白礼文 45 nr
+白祁政 5 nr
+白票 3 n
+白秀英 17 nr
+白秉德 14 nr
+白种 13 n
+白种人 74 n
+白立忱 3 nr
+白笔 3 n
+白箭翎 3 nr
+白箱 2 n
+白籍 2 n
+白米 79 nr
+白米分级 3 n
+白米饭 33 nr
+白粉 86 n
+白粉墙 3 nr
+白粉病 20 n
+白粉笔 3 n
+白粥 3 n
+白糊糊 3 z
+白糖 69 n
+白素贞 11 nr
+白素道 3 nr
+白纱 4 n
+白纱宫 2 nr
+白纱帘 3 nr
+白纱裙 3 nr
+白纸 292 n
+白纸坊 3 nz
+白纸黑字 37 nz
+白纹羽 2 nr
+白线 9 n
+白细胞 248 n
+白绡戴 2 nr
+白绸 36 n
+白罗衫 2 nr
+白羊 165 nr
+白羊儿 3 nr
+白羊寨 20 nr
+白羊山 4 nr
+白羊座 10 nr
+白羊村 2 nr
+白羊王 3 nr
+白翳 3 nr
+白老健 3 nr
+白老儿 2 nr
+白老爷子 9 nr
+白而青 2 nr
+白耗 2 n
+白肉 33 n
+白肩雕 6 nr
+白背飞虱 3 n
+白胜呐 2 nr
+白胜雪 2 nr
+白胡子 3 nr
+白胡椒 3 nr
+白脉 2 ns
+白脉弦 2 nr
+白脸 120 n
+白脸人 3 nr
+白脸汉子 2 nr
+白腹 3 n
+白腿子 3 nr
+白臂傍 2 nr
+白自在 3 nr
+白色 2756 n
+白色体 3 n
+白色恐怖 206 i
+白色据点 3 n
+白色棉 3 n
+白色水肿 3 n
+白色污染 3 i
+白芍 35 n
+白芒芒 2 nr
+白芙蓉 3 nr
+白芝麻 3 n
+白芥子 3 nr
+白芦笋 3 nr
+白芨 3 n
+白花 136 n
+白花油 3 n
+白花花 158 nr
+白花蛇 23 nr
+白花钱 3 n
+白花青 2 nr
+白芳礼 3 nr
+白芷 19 nr
+白芸豆 3 nr
+白苍苍 3 z
+白苏 4 ns
+白苔主 2 nr
+白英子 19 nr
+白英宽 3 nr
+白范阳 5 nr
+白茅 14 nr
+白茅根 4 nr
+白茆 3 ns
+白茆镇 5 v
+白茉莉 3 n
+白茫茫 107 z
+白茯苓 3 n
+白茸茸 2 z
+白草 9 n
+白草科 4 nr
+白草黄云 3 nr
+白药 10 n
+白药子 3 nr
+白莲 581 nr
+白莲教 142 nr
+白莲社 3 nr
+白莲花 5 nr
+白菊 8 nr
+白菊花 9 nr
+白菜 221 n
+白菜价 3 n
+白菜叶 3 nr
+白菜心 13 n
+白菜汤 2 nr
+白菜碑 3 nr
+白萝卜 22 n
+白葡萄酒 29 n
+白蒙蒙 12 nr
+白蔹 3 nr
+白薯 32 n
+白藋同心 3 v
+白藜芦醇 3 nr
+白藤 21 nr
+白虎 91 nr
+白虎团 4 nr
+白虎堂 31 nr
+白虎山 6 nr
+白虎岭 3 nr
+白虎星 4 nr
+白虎殿 3 nr
+白虎观 18 nr
+白虎通 23 nr
+白虹剑 6 nr
+白虹贯日 42 i
+白蚁 141 n
+白蚁争穴 3 n
+白蚂蚁 3 l
+白蛇 44 n
+白蛇传 25 nr
+白蛇纹石 3 nr
+白蛉 15 nr
+白蛋白 68 nr
+白蛟帮 18 nr
+白蛾 2 n
+白蜡 73 n
+白蜡明经 3 n
+白蜡树 16 n
+白蜡虫 9 n
+白蝴蝶 2 nr
+白血 3 n
+白血球 22 n
+白血病 248 n
+白行简 9 nr
+白衣 842 n
+白衣公卿 3 nr
+白衣卿相 3 nr
+白衣大士 3 nr
+白衣天使 14 nr
+白衣宰相 3 nr
+白衣庵 2 nr
+白衣战士 6 n
+白衣秀士 24 nr
+白衫儿 2 nr
+白衫子 11 nr
+白衬衣 3 nr
+白衬衫 3 nr
+白袍 92 n
+白袜子 3 n
+白袷蓝衫 3 nr
+白裙 3 n
+白话 127 n
+白话八股 3 n
+白话文 79 nr
+白话文学 12 n
+白话诗 29 nr
+白语 3 nz
+白谷兄 9 nr
+白豆 3 n
+白豆杉 14 nr
+白豆蔻 3 nr
+白象 23 n
+白贝利 2 nr
+白贝罗 7 nr
+白质 31 n
+白费 96 n
+白费力气 7 n
+白费口舌 3 n
+白费唇舌 3 n
+白费心机 3 n
+白费蜡 3 n
+白赵氏 77 nr
+白起 46 nr
+白跑 3 ns
+白跑一趟 3 v
+白转红 2 nr
+白转青 2 nr
+白辛树 2 nr
+白辛苦 3 z
+白边 9 n
+白送 55 nr
+白道 10 nr
+白道川 2 nr
+白道面 3 n
+白酒 248 n
+白酒业 3 n
+白醋 26 n
+白醣 3 z
+白里安 13 nr
+白里泛 2 nr
+白里透红 3 z
+白金 117 n
+白金之星 3 nr
+白金卡 3 nr
+白金汉 8 nr
+白金汉宫 21 nr
+白金版 3 n
+白钢 5 nr
+白钨矿 16 n
+白铁 11 n
+白铁皮 5 nr
+白铁矿 3 nz
+白铅矿 3 nr
+白铜 56 nr
+白银 334 nr
+白银区 2 nr
+白银市 9 ns
+白银时代 3 nr
+白长老 23 nr
+白门楼 6 nr
+白闪闪 2 z
+白间色 2 n
+白阳 5 ns
+白阿绣 3 nr
+白附子 3 nr
+白降丹 3 nr
+白陶 6 nr
+白雄尊 4 nr
+白雨斋 3 nr
+白雪 1572 nr
+白雪公主 38 nr
+白雪冲 2 nr
+白雪娘 33 nr
+白雪松 3 nr
+白雪皑皑 20 i
+白雪石 7 nr
+白雪红梅 4 nr
+白雪阳春 3 nr
+白雪难和 3 i
+白雾 3 n
+白雾罩 2 nr
+白霜 16 nr
+白面 155 n
+白面书生 18 n
+白面书郎 3 n
+白面儒冠 3 nr
+白面儒生 3 nr
+白面儿 3 nr
+白面馒头 3 nr
+白音 6 n
+白须 109 d
+白须道人 2 nr
+白须青 3 nr
+白须飘 2 nr
+白领 1071 nr
+白领丽人 3 nr
+白领阶层 29 n
+白领阶级 3 n
+白颐路 3 vn
+白颖苔 2 nr
+白颜树 3 nr
+白额山 6 nr
+白飞飞 3 nr
+白食 10 n
+白饭 21 n
+白饭青刍 3 n
+白馒头 2 nr
+白首 3 n
+白首一节 3 i
+白首不渝 3 i
+白首为功名 2 i
+白首为郎 3 nr
+白首之心 3 i
+白首乌 3 nr
+白首北面 3 n
+白首同归 3 i
+白首如新 3 i
+白首相庄 3 nr
+白首相知 3 i
+白首穷经 3 i
+白首空归 3 i
+白首空望 3 i
+白首齐眉 3 nr
+白马 706 ns
+白马井 6 nr
+白马寺 59 nr
+白马山 58 nr
+白马庙 4 nr
+白马河 3 nr
+白马湖 4 nr
+白马王子 35 nr
+白马股 3 nr
+白马路 3 nr
+白马非马 6 ns
+白驹空谷 3 nr
+白驹荣 3 nr
+白驹过隙 3 n
+白骆驼 3 n
+白骨 208 n
+白骨再肉 3 i
+白骨精 52 nr
+白骨露野 3 i
+白髯老者 4 nr
+白鱼 28 n
+白鱼入舟 3 i
+白鱼登舟 3 nr
+白鱼赤乌 3 nr
+白鲑 7 n
+白鲜 2 ns
+白鲜皮 3 nz
+白鲟 12 n
+白鲢 8 n
+白鲢鱼 3 v
+白鲨 16 nz
+白鲫 3 i
+白鲸 14 nr
+白鳍豚 529 n
+白鳗 3 n
+白鳝 3 n
+白鳞鱼 3 nr
+白鸟 6 n
+白鸡 6 n
+白鸣鹤 14 nr
+白鸥来 2 nr
+白鹄 3 nr
+白鹅 29 nz
+白鹇 30 n
+白鹤 120 nr
+白鹤梁 2 nr
+白鹦鹉 6 nr
+白鹭 39 nr
+白鹭洲 3 nr
+白鹭飞 3 nr
+白鹳 21 nr
+白鹿书院 53 nz
+白鹿仓 75 nr
+白鹿原 231 nr
+白鹿村 133 nr
+白鹿泉乡 3 ns
+白鹿洞 17 nr
+白鹿潭 2 nr
+白鹿矶 3 nr
+白鹿联 5 ns
+白鹿镇 80 nr
+白鹿飘 2 nr
+白麝香 3 z
+白黎芦 2 nr
+白黑不分 3 l
+白黑分明 3 nr
+白黑颠倒 3 i
+白鼠 26 n
+白鼬 3 n
+白鼻子 4 n
+白齐文 3 nr
+白齿 2 n
+白齿青眉 3 n
+白龙剑 16 nr
+白龙南 2 ns
+白龙堆 2 nr
+白龙庙 5 nr
+白龙水 2 nr
+白龙江 26 nr
+白龙潭 3 nr
+白龙门 2 ns
+白龙马 5 nr
+白龙驹 2 nr
+白龙鱼服 3 nr
+白龟寿 3 nr
+白龟池 3 nr
+百 3336 n
+百一 6 m
+百一十万 2 m
+百一方 2 m
+百万 1184 m
+百万两 8 m
+百万买宅 3 n
+百万亩 5 m
+百万人次 3 m
+百万件 3 m
+百万份 6 m
+百万倍 4 m
+百万元 49 m
+百万册 5 m
+百万分之一 21 m
+百万千瓦 9 m
+百万发 4 m
+百万只 3 m
+百万名 2 m
+百万吨 21 m
+百万吨级 3 m
+百万头 2 m
+百万富婆 2 i
+百万富翁 65 ns
+百万年 25 m
+百万庄 3 nz
+百万户 2 m
+百万担 2 m
+百万斤 3 m
+百万条 5 m
+百万石 3 i
+百万种 4 m
+百万秒 15 m
+百万立方米 6 m
+百万美元 59 m
+百万英镑 6 m
+百万计 3 i
+百万锭 2 m
+百万雄兵 3 i
+百万雄师 63 i
+百丈 65 m
+百丈竿头 3 i
+百三 7 m
+百三家 31 m
+百下 4 m
+百下百全 3 i
+百下百着 3 m
+百不一存 3 i
+百不一贷 3 i
+百不一遇 3 i
+百不失一 12 i
+百不当一 3 i
+百不随一 3 l
+百丑图 3 nz
+百世 30 n
+百世一人 3 nz
+百世不易 3 l
+百世不磨 3 i
+百世之利 3 nz
+百世之师 3 i
+百世流芬 3 nz
+百世流芳 3 nz
+百业 17 n
+百业兴旺 4 l
+百业凋敝 3 i
+百业待兴 2 l
+百业振兴 3 nz
+百业网 3 n
+百业萧条 3 i
+百两 20 m
+百两烂盈 3 i
+百个 178 m
+百中百发 3 i
+百举百全 3 i
+百举百捷 3 i
+百乐 3 n
+百乐百福 3 nz
+百乐门 11 n
+百乘 3 nz
+百了千当 3 i
+百事 66 n
+百事公司 6 n
+百事可乐 53 i
+百事大吉 3 i
+百事无成 3 i
+百事灵 3 n
+百事通 4 nz
+百二 11 m
+百二八十 3 m
+百二关河 3 nz
+百二十二厘米 2 m
+百二十千 2 m
+百二十卷 2 m
+百二山川 3 nz
+百二山河 3 nz
+百二河山 3 nz
+百二金瓯 3 n
+百五 4 m
+百五十 4 m
+百五十亩 2 m
+百亩 73 m
+百人 3 n
+百人斩 3 nz
+百亿 30 m
+百亿元 274 m
+百亿年 2 m
+百亿立方米 2 m
+百亿美元 10 m
+百仕达 3 nr
+百代 39 n
+百代文宗 3 nz
+百代过客 3 i
+百件 9 m
+百份 2 n
+百会 3 n
+百会穴 35 n
+百伶百俐 5 i
+百位 37 m
+百位数 3 n
+百余 185 m
+百余万 25 m
+百余万口 3 m
+百余万头 3 m
+百余丈 19 m
+百余个 13 m
+百余人 3 l
+百余件 6 m
+百余位 8 m
+百余公里 12 m
+百余具 4 m
+百余匹 8 m
+百余千米 3 m
+百余华里 2 m
+百余卷 4 m
+百余只 9 m
+百余台 3 m
+百余号 2 m
+百余名 55 m
+百余处 10 m
+百余头 2 m
+百余家 15 m
+百余幅 2 m
+百余平方公里 2 m
+百余年 92 m
+百余座 14 m
+百余户 6 m
+百余所 6 m
+百余招 21 m
+百余斤 6 m
+百余日 9 m
+百余条 18 m
+百余枚 2 m
+百余架 5 m
+百余次 4 m
+百余步 10 m
+百余片 2 m
+百余种 40 m
+百余篇 15 m
+百余米 18 m
+百余艘 3 m
+百余辆 5 m
+百余部 5 m
+百余里 35 m
+百余间 3 m
+百余首 3 m
+百佳 9 nz
+百例 2 n
+百依百从 3 i
+百依百顺 32 nz
+百倍 377 m
+百倍千倍 5 m
+百儿八十 4 m
+百元 55 m
+百元大钞 3 n
+百兆 3 nz
+百克 10 nz
+百八十 3 m
+百八十块 2 m
+百公斤 2 m
+百公里 20 m
+百六 4 m
+百兵斋 3 nz
+百具 5 n
+百兽 28 n
+百兽之王 3 i
+百兽率舞 3 i
+百凡待举 3 i
+百出 107 m
+百分 86 m
+百分之 51 i
+百分之一 17 m
+百分之一点 8 m
+百分之一百 3 m
+百分之一百二十 2 m
+百分之一秒 3 m
+百分之一里 2 m
+百分之七 41 m
+百分之七八十 2 m
+百分之七十 16 m
+百分之七十三点 3 m
+百分之七十五 3 m
+百分之七点 10 m
+百分之三 63 m
+百分之三十 29 m
+百分之三十五 3 m
+百分之三十六 3 m
+百分之三十几 2 m
+百分之三四十 3 m
+百分之三左右 3 m
+百分之三点 12 m
+百分之九 61 m
+百分之九十 35 m
+百分之九十九 12 m
+百分之九十五 14 m
+百分之九十八 3 m
+百分之九十几 3 m
+百分之九点 11 m
+百分之二 65 m
+百分之二三 4 m
+百分之二十 29 m
+百分之二十一点八 2 m
+百分之二十九 2 m
+百分之二十二 2 m
+百分之二十二点 2 m
+百分之二十五 3 m
+百分之二十几 2 m
+百分之二十点 2 m
+百分之二左右 2 m
+百分之二点 11 m
+百分之二百 5 m
+百分之五 63 m
+百分之五十 34 m
+百分之五十一 2 m
+百分之五十六点 2 m
+百分之五十左右 3 m
+百分之五点 10 m
+百分之八 52 m
+百分之八九十 9 m
+百分之八十 93 m
+百分之八十五 3 m
+百分之八十五点 2 m
+百分之八十八点 2 m
+百分之八十点 2 m
+百分之八点 14 m
+百分之六 35 m
+百分之六七 2 m
+百分之六十 13 m
+百分之六十五 2 m
+百分之六十六 2 m
+百分之六点 16 m
+百分之几 12 i
+百分之几十 2 m
+百分之十 51 m
+百分之十一 4 m
+百分之十一点九 3 m
+百分之十七 6 m
+百分之十七点三 2 m
+百分之十三 4 m
+百分之十三点 3 m
+百分之十三点三 2 m
+百分之十九 2 m
+百分之十九点八 2 m
+百分之十二 9 m
+百分之十五 13 m
+百分之十八 13 m
+百分之十六 5 m
+百分之十六点八 2 m
+百分之十几 9 m
+百分之十四 11 m
+百分之十左右 2 m
+百分之十点 2 m
+百分之四 38 m
+百分之四五十 3 m
+百分之四五十左右 2 m
+百分之四十 19 m
+百分之四十九 2 m
+百分之四十八 2 m
+百分之四十四 2 m
+百分之四点 20 m
+百分之百 138 m
+百分之零点 12 m
+百分位 5 m
+百分制 18 n
+百分号 3 m
+百分尺 3 m
+百分数 35 m
+百分比 202 n
+百分法 3 n
+百分点 720 m
+百分率 26 n
+百分百 20 m
+百分表 14 n
+百列 2 m
+百利 19 nz
+百利威 3 ns
+百刻图 3 n
+百劫红颜 3 i
+百匹 6 m
+百十 179 m
+百十万 5 m
+百十丈 4 m
+百十两 3 m
+百十个 26 m
+百十亩 2 m
+百十位 2 m
+百十余 8 m
+百十元 3 m
+百十匹 3 m
+百十口 3 m
+百十号 8 m
+百十名 4 m
+百十块 2 m
+百十处 2 m
+百十年 7 m
+百十户 3 m
+百十斤 7 m
+百十条 3 m
+百十步 8 m
+百十米 2 m
+百十粒 2 m
+百十辆 3 m
+百十遍 2 m
+百十道 2 m
+百十里 18 m
+百十间 2 m
+百十首 2 m
+百千 9 m
+百千万 6 m
+百千万亿 4 m
+百千克 2 m
+百千米 14 m
+百升 3 m
+百卉千葩 3 n
+百卉吐艳 3 nr
+百卉含英 3 nr
+百卷 7 m
+百发 4 nz
+百发百中 62 nz
+百变龙 3 nz
+百口 23 n
+百口同声 3 i
+百口泉 2 nz
+百口莫辩 6 i
+百口难分 3 l
+百句 4 m
+百只 35 m
+百台 3 n
+百叶 7 n
+百叶窗 28 n
+百叶箱 7 n
+百号 4 n
+百合 182 n
+百合折 3 n
+百合科 32 nz
+百合花 44 n
+百名 117 m
+百吨 18 m
+百听不厌 2 i
+百员 3 n
+百周年 4 m
+百味 25 n
+百品千条 3 l
+百啭千声 3 q
+百善孝为 3 i
+百喙一词 3 v
+百喙如一 3 v
+百喙莫辩 3 nr
+百喙难辞 3 nr
+百喙难辩 3 nr
+百四十六 128 m
+百回 4 m
+百团大战 54 nz
+百场 6 n
+百块 6 m
+百城 3 ns
+百城之富 3 nz
+百堕俱举 3 i
+百堵皆作 3 l
+百处 7 m
+百多 6 m
+百多万项 4 m
+百多两 2 m
+百多个 4 m
+百多吨 3 m
+百多年 10 m
+百多斤 2 m
+百多米 2 m
+百夜 5 m
+百大 10 nz
+百天 5 m
+百夫决拾 3 i
+百夫长 3 n
+百头 265 n
+百套 3 m
+百姓 4176 n
+百姓家 42 n
+百姓生活 3 i
+百姓网 3 n
+百姓遭殃 3 v
+百威 4 n
+百媚生 3 i
+百子 25 n
+百孔千创 3 nz
+百孔千疮 5 i
+百字 3 n
+百安居 3 n
+百官 529 n
+百宝 35 nz
+百宝万货 3 nz
+百宝箱 6 n
+百家 136 m
+百家乐 3 nz
+百家争呜 3 nr
+百家争鸣 144 i
+百家公司 4 nt
+百家姓 22 n
+百家衣 2 n
+百家讲坛 3 n
+百家饭 8 n
+百密一疏 12 i
+百富勤 18 ns
+百富榜 3 i
+百对 2 m
+百寿图 3 n
+百封 5 m
+百尊 2 m
+百尺 27 m
+百尺无枝 3 i
+百尺竿头 10 i
+百尺竿头更进一步 2 i
+百岁 190 m
+百岁之后 3 i
+百岁之好 3 l
+百岁之盟 3 l
+百岁千秋 3 i
+百岁堂 3 n
+百岁老人 3 n
+百岁诞辰 3 n
+百川 3 ns
+百川归海 3 ns
+百川朝海 3 ns
+百川赴海 3 i
+百工 3 n
+百左右 2 m
+百巧千穷 3 i
+百巧成穷 3 i
+百帮 3 m
+百幅 4 n
+百幕 2 m
+百平方公里 5 m
+百平方米 3 m
+百年 1542 m
+百年一遇 5 l
+百年不遇 32 l
+百年之业 3 l
+百年之后 27 l
+百年之好 2 l
+百年之柄 3 i
+百年之约 3 l
+百年偕老 3 i
+百年史 3 n
+百年大业 3 l
+百年大计 17 l
+百年好事 3 l
+百年好合 3 i
+百年孤独 3 i
+百年战争 3 nz
+百年树人 6 n
+百年歌 3 n
+百年纪念 3 n
+百年老 3 n
+百年诞辰 3 n
+百年谐老 3 l
+百年难遇 2 l
+百床 2 n
+百废俱举 3 i
+百废俱兴 3 l
+百废具举 3 l
+百废具作 3 l
+百废具兴 3 l
+百废咸举 3 l
+百废待举 3 i
+百废待兴 24 l
+百度 11008 n
+百度搜 3 l
+百度网 3 nz
+百度表 3 n
+百座 10 m
+百弊丛生 3 n
+百张 8 m
+百强 47 n
+百强县 18 ns
+百忍成金 3 l
+百忙 92 d
+百忙中 3 l
+百忙之中 35 i
+百忙当中 3 i
+百忧解 3 i
+百念皆灰 3 i
+百态 13 n
+百态横生 3 i
+百态纷呈 3 i
+百思 3 n
+百思不得其解 71 i
+百思不解 14 i
+百思买 3 l
+百思莫解 3 i
+百怪千奇 3 i
+百感 3 n
+百感丛生 2 l
+百感交加 3 nz
+百感交集 93 n
+百慕大 70 nz
+百慕大杯 4 nz
+百慕大群岛 25 ns
+百慕达 3 nz
+百戏 196 n
+百成 2 m
+百战 3 nz
+百战不殆 27 i
+百战天虫 3 nz
+百战天龙 3 nz
+百战百胜 62 nz
+百战百败 3 nz
+百户 66 n
+百所 9 n
+百手 2 m
+百把 15 m
+百折 11 m
+百折不回 10 i
+百折不屈 3 i
+百折不挠 31 i
+百折不移 3 i
+百折千回 3 i
+百担 2 m
+百拙千丑 3 i
+百招 13 m
+百挑不厌 3 i
+百摺裙 3 nz
+百支 3 m
+百数 7 m
+百数十里 3 m
+百文 4 nz
+百斤 35 m
+百斯笃 3 nr
+百方 5 n
+百无一事 3 i
+百无一堪 3 i
+百无一失 4 i
+百无一成 3 i
+百无一是 3 i
+百无一漏 3 i
+百无一用 14 l
+百无一能 3 i
+百无一见 3 i
+百无一长 3 i
+百无所成 3 i
+百无是处 3 l
+百无禁忌 16 i
+百无聊赖 60 i
+百日 137 m
+百日咳 27 n
+百日红 3 nz
+百日维新 26 nz
+百晓生 3 nr
+百景 3 n
+百曲 2 n
+百服 5 n
+百本 2 n
+百条 21 m
+百枚 15 m
+百果 3 n
+百果山 3 ns
+百枝 2 m
+百架 8 m
+百柱 4 n
+百栋 2 m
+百株 2 m
+百样 12 m
+百根 5 m
+百桌 5 m
+百次 45 m
+百款 2 n
+百步 87 m
+百步亭 3 nz
+百步穿场 3 n
+百步穿扬 3 i
+百步穿杨 17 i
+百死一生 3 i
+百毒不侵 3 l
+百泉 13 nz
+百洁布 2 n
+百济 79 n
+百灵 46 n
+百灵庙 15 ns
+百灵网 3 nz
+百灵花 3 n
+百灵达 3 nz
+百灵鸟 12 n
+百点 3 m
+百炼千锤 3 nz
+百炼成刚 3 i
+百炼成钢 13 nz
+百炼钢 11 n
+百物 3 n
+百犬吠声 3 i
+百病 3 n
+百病丛生 3 n
+百白破 4 i
+百盏 2 m
+百盛 5 nz
+百看不厌 6 i
+百眼 151 m
+百着 3 m
+百福具臻 3 nr
+百种 95 m
+百科 16728 nz
+百科全书 221 nz
+百科全书式 15 nz
+百科知识 3 l
+百科词典 3 n
+百科辞典 3 n
+百端 34 n
+百端交集 3 n
+百端待举 3 i
+百等 4 m
+百篇 20 m
+百米 131 m
+百米桩 3 n
+百米赛跑 3 ns
+百粒 2 m
+百紫千红 3 i
+百级 130 n
+百纵千随 3 i
+百结 3 n
+百结悬鹑 3 n
+百结愁肠 3 i
+百美图 3 nz
+百老 3 n
+百老汇 65 n
+百胜 58 nz
+百胜刀王 5 i
+百脉泉 3 nz
+百脑汇 3 n
+百舌之声 3 i
+百舌鸟 6 n
+百舍重茧 3 n
+百舍重趼 3 nr
+百般 229 d
+百般为难 3 l
+百般刁难 4 l
+百般奉承 3 l
+百般折磨 3 i
+百般抚慰 3 i
+百般挑剔 3 l
+百般无奈 12 i
+百般狡辩 3 vn
+百般花样 3 l
+百般阻挠 3 i
+百舸争流 7 i
+百艘 4 m
+百色 66 n
+百色地区 4 ns
+百色市 14 ns
+百色起义 9 l
+百艺 6 n
+百节 4 n
+百花 687 n
+百花丛 3 n
+百花争妍 3 nr
+百花争艳 6 l
+百花凋零 3 i
+百花园 266 n
+百花奖 46 nz
+百花宫 3 n
+百花山 5 ns
+百花怒放 3 i
+百花文艺出版社 6 nt
+百花洲 5 ns
+百花洲文艺出版社 3 nt
+百花生日 2 i
+百花盛开 3 l
+百花莲 2 n
+百花齐放 149 i
+百草 54 n
+百草仙 3 n
+百草园 4 n
+百草堂 3 n
+百草霜 3 i
+百莲凯 3 nr
+百蕊草 3 l
+百虑一致 3 i
+百虑攒心 3 l
+百虫窝 3 n
+百行 6 n
+百衣百随 3 i
+百衲本 19 n
+百衲衣 10 n
+百褶 6 n
+百褶裙 14 n
+百计 3 n
+百计千心 3 i
+百计千方 3 i
+百计千谋 3 i
+百论 3 n
+百读不厌 2 i
+百谋千计 3 i
+百货 335 n
+百货业 2 n
+百货公司 62 n
+百货商场 3 n
+百货商店 52 nt
+百货大厦 3 nt
+百货大楼 34 n
+百货店 19 n
+百货类 3 n
+百起 7 m
+百越 82 nz
+百越族 6 n
+百足 3 n
+百足不僵 3 i
+百足之虫 9 i
+百身何赎 3 i
+百身莫赎 3 i
+百车 4 n
+百转千回 7 i
+百载 5 m
+百载树人 3 i
+百辆 45 m
+百辞莫辩 3 i
+百遍 11 m
+百道 7 n
+百部 27 m
+百部碱 3 n
+百里 211 m
+百里之才 3 i
+百里挑一 20 l
+百里洲 11 ns
+百里洲镇 2 ns
+百里酚 3 nz
+百里酚蓝 3 nz
+百里酚酞 3 n
+百里香 3 n
+百重 4 n
+百链成钢 3 nz
+百门 8 n
+百问不厌 3 i
+百问不烦 3 i
+百间 9 n
+百闻 3 n
+百闻不如 3 i
+百闻不如一见 9 i
+百隆 3 ns
+百集 3 n
+百页 5 m
+百页窗 3 n
+百顷 7 m
+百项 13 m
+百顺 3 nz
+百顺千随 3 i
+百顺百依 3 nz
+百颗 3 m
+百首 10 m
+百香 3 n
+百香果 3 n
+百香果汁 3 nz
+百骸 3 n
+百鬼众魅 3 l
+百鸟 29 n
+百鸟之王 3 i
+百鸟争鸣 3 i
+百鸟园 5 n
+百鸟朝凤 9 i
+百龄眉寿 3 ns
+癿 2 zg
+皁 2 zg
+皁荚 3 v
+皂 285 n
+皂丝麻线 3 n
+皂化 25 n
+皂化剂 3 n
+皂君庙 3 ns
+皂河 4 ns
+皂洗 3 v
+皂片 3 n
+皂甙 3 nz
+皂白 8 n
+皂白不分 3 n
+皂白分明 3 n
+皂白须分 3 n
+皂盒 3 n
+皂石 3 n
+皂矾 3 n
+皂粉 3 n
+皂素 3 n
+皂索 3 n
+皂荚 16 n
+皂角刺 3 n
+皂隶 96 n
+皂靴 10 n
+皂鞋 3 n
+的 318825 uj
+的一确二 3 l
+的哥 63 n
+的士 20 n
+的士高 3 n
+的的确确 64 d
+的确 2135 d
+的确如此 31 l
+的确良 12 n
+的花海 3 ns
+的话 5054 u
+的里雅斯特 23 ns
+的里雅斯特市 3 ns
+的黎波里 62 ns
+皆 7511 d
+皆佳 3 nrt
+皆准 3 i
+皆大欢喜 85 i
+皆宜 3 nrt
+皆惊 3 i
+皆成文章 3 i
+皆曰 3 i
+皆然 3 nrt
+皆知 3 i
+皆空 3 nrt
+皇 3844 n
+皇上 10776 n
+皇亲 3 n
+皇亲国戚 97 n
+皇位 844 n
+皇储 24 n
+皇军 63 n
+皇冠 111 n
+皇历 12 n
+皇叔 91 n
+皇后 3146 n
+皇后区 2 n
+皇国 2 ns
+皇土 3 n
+皇城 4127 n
+皇城根 3 ns
+皇城根儿 6 n
+皇天 102 n
+皇天后土 22 n
+皇太后 1056 nr
+皇太子 276 n
+皇太极 792 n
+皇妃 12 n
+皇姑 8 n
+皇姑区 5 n
+皇姑屯 40 nr
+皇嫂 8 n
+皇子 352 n
+皇子皇孙 3 nr
+皇室 927 n
+皇宫 1440 n
+皇家 1795 n
+皇家学院 3 n
+皇家宫苑 3 ns
+皇家田 2 nr
+皇家礼炮 3 n
+皇家马德里队 25 nz
+皇岗 270 n
+皇帝 22050 n
+皇庄 36 n
+皇庙 2 n
+皇弟 3 n
+皇恩 119 n
+皇恩浩荡 3 i
+皇族 480 n
+皇族内阁 3 ns
+皇朝 213 n
+皇权 961 n
+皇村 3 n
+皇榜 3 n
+皇民 3 n
+皇民化 27 n
+皇爷 478 n
+皇甫 64 nr
+皇甫先鹏 33 nr
+皇甫少华 2 nr
+皇甫嵩 16 nr
+皇甫平 3 nr
+皇甫惟明 3 nr
+皇甫端 6 nr
+皇甫谧 15 nr
+皇甫郦 3 nr
+皇甫阁 47 nr
+皇皇 25 n
+皇皇巨着 3 n
+皇粮 34 n
+皇紫风 3 nr
+皇统 28 n
+皇考 3 n
+皇袍 3 n
+皇贵妃 3 nr
+皇路店 3 n
+皇道 4 n
+皇阿玛 3 nr
+皇陵 362 n
+皇马 243 n
+皈 47 v
+皈依 257 v
+皊 203 zg
+皋 107 g
+皋兰 10 ns
+皋兰县 4 ns
+皋兰山 5 ns
+皋落 2 ns
+皎 225 zg
+皎如日星 3 v
+皎洁 74 z
+皎然 47 z
+皎白 3 z
+皎阳似火 3 v
+皑 11 z
+皑皑 39 z
+皒 30 zg
+皓 297 nz
+皓发 3 nz
+皓月 34 nz
+皓月千里 3 nz
+皓月当空 11 nz
+皓洁 3 nz
+皓然 3 a
+皓白 9 nz
+皓皓 3 i
+皓矾 3 n
+皓首 3 n
+皓首穷经 7 i
+皓首苍颜 3 i
+皓齿 8 nz
+皓齿明眸 3 n
+皓齿蛾眉 3 i
+皕 5 zg
+皖 708 j
+皖东 34 ns
+皖北 81 ns
+皖南 145 ns
+皖南事变 106 nz
+皖江 2 ns
+皖西 28 ns
+皖赣 17 j
+皖赣铁路 8 nz
+皘 19 zg
+皙 32 g
+皝 150 zg
+皞 18 zg
+皟 90 zg
+皠 24 zg
+皡 8 zg
+皢 180 zg
+皣 7 zg
+皤 8 g
+皥 75 zg
+皦 30 zg
+皧 19 zg
+皨 192 zg
+皩 3 zg
+皪 7 zg
+皬 328 zg
+皮 7184 n
+皮上衣 3 n
+皮下 202 n
+皮下注射 3 l
+皮下组织 33 n
+皮下脂肪 3 n
+皮中萃 2 nr
+皮之不存 10 l
+皮乌斯 11 nr
+皮书 3 n
+皮云杉 3 nr
+皮亚季 7 nr
+皮亚拉 14 nr
+皮亚斯 5 nr
+皮亚杰 16 nr
+皮亚特 3 nr
+皮亚琴察 3 nr
+皮亚西 2 nr
+皮亚诺 20 nr
+皮件 11 n
+皮件厂 3 n
+皮传示 2 nr
+皮傅 3 n
+皮儿 21 n
+皮光毛 3 nr
+皮光肉 2 n
+皮克斯 23 nr
+皮克林 51 nr
+皮克氏 3 nr
+皮克河 5 nr
+皮克特 8 nr
+皮克萨 16 nr
+皮兰德 10 nr
+皮具 17 n
+皮具厂 3 n
+皮兹利 2 nr
+皮内达 2 nr
+皮冷杉 3 nr
+皮凌迟 2 nr
+皮切夫 2 nr
+皮切成 3 nr
+皮划艇 26 n
+皮制 13 n
+皮制品 3 n
+皮包 143 n
+皮包公司 8 n
+皮包商 3 n
+皮包骨 2 n
+皮包骨头 29 n
+皮化生 3 n
+皮匠 79 n
+皮博迪 4 nr
+皮卡丘 3 nr
+皮卡尔 4 nr
+皮卡序列 3 nr
+皮卡概形 3 l
+皮卡秋 3 nr
+皮卡第 6 nr
+皮卡车 3 n
+皮卡迪 3 nr
+皮厚 4 nr
+皮厚肉 2 n
+皮厚馅少 3 v
+皮合生 3 n
+皮吉特 2 nr
+皮嘴皮脸 3 l
+皮囊 111 n
+皮圈 3 n
+皮坚厚 2 nr
+皮垫 3 n
+皮垫圈 3 n
+皮埃尔 36 nr
+皮埃罗 5 nr
+皮埃蒙特 3 nrt
+皮基氏 4 nr
+皮塔尔 2 nr
+皮增厚 2 nr
+皮壳 3 n
+皮大衣 20 nr
+皮夹 22 n
+皮夹克 12 n
+皮夹子 8 n
+皮奈罗 3 nr
+皮套 5 n
+皮奥 4 nrt
+皮奥拉 4 nrt
+皮姆贝 2 nr
+皮嫩肉 5 n
+皮子 652 n
+皮孔 3 n
+皮安基 2 nr
+皮实 11 n
+皮实草 2 n
+皮尔卡丹 3 nr
+皮尔士 8 nr
+皮尔孙 2 nr
+皮尔巴 2 nr
+皮尔斯 24 nr
+皮尔本 3 nr
+皮尔森 8 nr
+皮尔洛 14 nr
+皮尔萨 3 nr
+皮尔逊 23 nr
+皮尖 3 n
+皮尤河 4 nr
+皮尺 4 nr
+皮尼洛 2 nr
+皮层 232 n
+皮屑 19 n
+皮山 14 nr
+皮山县 3 nr
+皮岛 19 n
+皮岛之 2 nr
+皮岛毛 2 nr
+皮希科 2 nr
+皮帕德 4 nr
+皮带 189 n
+皮带传动 3 n
+皮带扣 3 n
+皮带机 3 n
+皮带秤 3 n
+皮带轮 2 n
+皮帽 50 n
+皮帽子 20 n
+皮库 2 n
+皮店 3 n
+皮开肉绽 174 i
+皮张 32 n
+皮影 32 n
+皮影戏 41 n
+皮得很 3 nr
+皮德蒙 3 nr
+皮戈列 2 nr
+皮手套 3 n
+皮手筒 3 n
+皮拉 2 nrt
+皮拉斯 2 nr
+皮拉波 3 nr
+皮损 41 n
+皮掌 3 n
+皮斯卡 5 nr
+皮斯托亚 3 nrt
+皮斯河 5 nr
+皮日休 275 nr
+皮明庥 2 nr
+皮服 2 n
+皮木柜 2 nr
+皮杜鲁 2 nr
+皮条 22 n
+皮条客 3 n
+皮板 9 n
+皮板儿 3 n
+皮柿花 4 nr
+皮格 6 n
+皮格尔 3 nr
+皮桶子 3 n
+皮棉 23 n
+皮毛 317 n
+皮毛之见 3 i
+皮毛衣 3 n
+皮沙发 5 nr
+皮泡夫 2 nr
+皮泽蒂 3 nr
+皮洛士 5 nr
+皮洛夫 2 nr
+皮洛斯 5 nr
+皮浪 3 n
+皮清云 3 nr
+皮清玄 40 nr
+皮炎 148 n
+皮炎平 3 nr
+皮特什蒂市 3 nrt
+皮特兰 3 nr
+皮特凯恩群岛 2 ns
+皮特尔 2 nr
+皮特曼 2 nr
+皮特森 2 nr
+皮特泰 2 nr
+皮特里 7 nrt
+皮猴 2 n
+皮猴儿 3 nr
+皮球 237 n
+皮瓣 7 n
+皮由兹 2 nr
+皮甲坚 2 nr
+皮疹 111 n
+皮痒 3 n
+皮皮 3 n
+皮皮尔 3 nr
+皮皮狗 2 nr
+皮皮虾 3 nr
+皮皮鲁 3 nr
+皮相 7 n
+皮相之 2 nr
+皮相之士 3 nr
+皮相之见 3 i
+皮相之谈 3 i
+皮破血流 3 n
+皮碗 3 n
+皮科 11 n
+皮科克 9 nr
+皮科拉 3 nr
+皮秒 8 nr
+皮秒超 2 nr
+皮笑 3 nr
+皮笑肉不 3 l
+皮笑肉不笑 23 i
+皮筋 9 n
+皮筋儿 3 l
+皮筏 11 n
+皮筏子 7 n
+皮策张力 3 n
+皮管 7 n
+皮管子 3 n
+皮箱 95 n
+皮箱子 3 nr
+皮糖 2 n
+皮糙肉厚 3 n
+皮纳尔 2 nr
+皮纳斯 4 nr
+皮纸 21 n
+皮纹 2 n
+皮线 3 n
+皮绳 8 n
+皮维斯 2 nr
+皮罗阁 5 nr
+皮翼目 3 i
+皮耶克 12 nr
+皮耶罗 13 nr
+皮肉 321 n
+皮肉之伤 3 i
+皮肉伤 3 n
+皮肉生涯 3 i
+皮肌炎 5 n
+皮肤 2763 n
+皮肤性病 3 n
+皮肤感染 3 n
+皮肤毒性 3 n
+皮肤病 125 n
+皮肤痒 3 n
+皮肤癌 32 n
+皮肤癣 3 n
+皮肤科 54 n
+皮肤过敏 3 nz
+皮胶 3 n
+皮脂 27 n
+皮脂腺 43 n
+皮脸 2 n
+皮腔 7 n
+皮膜 3 n
+皮艇 28 n
+皮色 39 n
+皮节 2 n
+皮花 3 n
+皮茄克 3 n
+皮茨 12 nrt
+皮草 3 n
+皮萨列夫 2 nrt
+皮萨罗 48 nr
+皮萨至 2 nr
+皮萨诺 2 nr
+皮薄馅多 3 z
+皮蛋 22 n
+皮蝇 3 n
+皮衣 38 n
+皮袄 69 n
+皮袋 55 n
+皮袋子 2 n
+皮袍 28 n
+皮褥子 20 n
+皮褶 6 n
+皮试 4 n
+皮诺切特 4 nrt
+皮货 52 n
+皮货商 3 n
+皮货店 3 n
+皮质 344 n
+皮质激素 3 n
+皮质素 4 n
+皮质醇 29 n
+皮赖娃 6 nr
+皮辊 3 n
+皮辊棉 3 v
+皮里 10 nrt
+皮里抽肉 3 i
+皮里春秋 3 nr
+皮里阳秋 4 nr
+皮重 5 n
+皮金语 5 nr
+皮钦尼 2 nr
+皮钦查 2 nr
+皮钦语 4 nr
+皮锡瑞 2 nr
+皮阿齐 2 nr
+皮陆 2 n
+皮雷斯 2 nr
+皮面 32 n
+皮革 495 n
+皮革业 3 n
+皮革制品 3 n
+皮革化工 3 n
+皮革厂 9 n
+皮革商 3 n
+皮革机械 3 n
+皮靴 111 n
+皮靴子 3 i
+皮鞋 479 n
+皮鞋厂 3 n
+皮鞋油 3 n
+皮鞭 78 nr
+皮鞭子 3 n
+皮领 3 n
+皮鱼纲 5 nr
+皮黄 4 nr
+皮鼓 3 n
+皮龟 2 n
+皯 197 zg
+皰疹 3 n
+皱 1256 v
+皱叶甘蓝 3 n
+皱巴巴 28 z
+皱折 3 n
+皱痕 2 n
+皱皱巴巴 10 z
+皱眉 488 n
+皱眉头 187 v
+皱眉蹙眼 3 v
+皱着眉头 3 v
+皱纹 411 n
+皱纹纸 3 n
+皱缩 15 v
+皱胃 3 n
+皱褶 59 n
+皱襞 13 n
+皱起 3 v
+皱边 3 n
+皲手茧足 3 z
+皲裂 30 v
+皳 5 zg
+皴 82 n
+皴擦 10 v
+皴法 12 n
+皴裂 4 v
+皵 304 zg
+皷 12 zg
+皹 4 zg
+皻 30 zg
+皼 8 zg
+皽 2 zg
+皾 6 zg
+皿 28 x
+盂 188 g
+盂兰盆会 3 ns
+盂县 9 ns
+盂方水方 3 ns
+盅 233 q
+盅子 5 n
+盆 1064 n
+盆中 47 n
+盆儿 3 n
+盆地 2664 n
+盆地分析 3 n
+盆塘 2 n
+盆子 119 n
+盆底 33 n
+盆底扇 3 n
+盆景 144 n
+盆景园 4 n
+盆景土 3 n
+盆景花卉 3 n
+盆景配件 3 n
+盆栽 46 n
+盆植 3 v
+盆汤 2 n
+盆浴 9 n
+盆盆罐罐 3 n
+盆腔 73 n
+盆腔炎 23 n
+盆花 50 n
+盆菜 4 n
+盈 390 n
+盈亏 69 n
+盈亏自负 3 v
+盈余 164 n
+盈则必亏 3 n
+盈利 896 n
+盈利性 8 n
+盈利模式 3 n
+盈利率 2 n
+盈动 3 n
+盈千累万 3 ns
+盈尺 10 n
+盈尺之地 3 n
+盈怀 2 n
+盈月 3 n
+盈江 16 ns
+盈江县 2 ns
+盈溢 3 v
+盈满 17 v
+盈满之咎 3 v
+盈盈 1197 z
+盈盈一水 3 n
+盈盈在目 3 n
+盈盈秋水 3 n
+盈眶 22 n
+盈科 9 n
+盈科后进 3 nz
+盈篇累牍 3 n
+盈缺 3 n
+盈虚 3 n
+盈贯 3 n
+盈门 13 n
+盉 18 zg
+益 514 nr
+益三州 2 nr
+益上损下 3 l
+益世 2 nrt
+益之尤 2 nr
+益二州 5 nr
+益于 5 d
+益信 2 nz
+益值 5 n
+益兰州 6 ns
+益切钦 128 nr
+益加 3 nr
+益华 5 nz
+益友 11 nr
+益发 63 nz
+益国利民 3 nr
+益处 101 nz
+益寿 6 nr
+益寿之 4 nr
+益寿堂 5 nr
+益寿延年 5 nr
+益封凡 2 nr
+益州 168 ns
+益州刘 9 nr
+益州治 3 nr
+益州牧 24 nr
+益州知 2 nr
+益州诸 5 nr
+益州道 3 nr
+益州郡 31 nr
+益干启 2 nr
+益广 4 nz
+益微微 6 nr
+益性 3 n
+益智 35 nr
+益智仁 3 nr
+益智养成 3 nr
+益智图 3 nr
+益智篇 3 nr
+益智类 3 nr
+益次郎 2 nr
+益母草 19 nr
+益民 4 nr
+益气 72 n
+益气健 6 nr
+益气养血 9 l
+益气养阴 6 l
+益气固 6 nr
+益气汤 3 nr
+益气生 3 nr
+益津 6 ns
+益点点 2 d
+益物权 13 nr
+益王赵 2 nr
+益生菌 4 nr
+益田路 4 nr
+益盛 5 nz
+益精 7 nz
+益虫 21 nr
+益西丹 6 nr
+益西多 3 ns
+益谦亏盈 3 i
+益都 54 ns
+益鑫泰 3 nr
+益阳 39 ns
+益阳县 4 ns
+益阳市 12 ns
+益颇 2 nz
+益高 3 nr
+益鸟 22 nr
+益鸟益虫 3 nr
+盌 13 zg
+盍 26 g
+盎 215 q
+盎司 113 q
+盎斯 3 nz
+盎格鲁 51 nz
+盎格鲁萨 3 nz
+盎然 136 z
+盎盂相击 3 nz
+盎盂相敲 3 l
+盏 1008 q
+盏灯 3 nr
+盐 4433 n
+盐业 121 n
+盐井 44 n
+盐井县 3 ns
+盐亭 5 n
+盐亭县 3 ns
+盐价 3 n
+盐份 3 n
+盐分 88 n
+盐务 96 n
+盐务局 4 n
+盐包 3 n
+盐化 47 j
+盐化工业 7 n
+盐区 3 n
+盐卤 22 n
+盐味 3 n
+盐商 3 n
+盐土 83 n
+盐场 99 n
+盐坨子 3 n
+盐城 53 ns
+盐城人 5 nrt
+盐城市 20 ns
+盐埔 3 ns
+盐埕区 3 z
+盐基度 3 n
+盐基性 3 n
+盐官 42 n
+盐官镇 4 ns
+盐寮 3 ns
+盐层 3 n
+盐山 9 ns
+盐山县 2 ns
+盐川 3 ns
+盐工 3 n
+盐巴 24 n
+盐市 3 ns
+盐市口 2 n
+盐帮 2 j
+盐店 3 n
+盐度 269 n
+盐度计 9 n
+盐户 3 n
+盐政 3 n
+盐效应 3 n
+盐析 3 vn
+盐枭 47 n
+盐梅之寄 3 n
+盐梅相成 3 ns
+盐梅舟楫 3 n
+盐民 3 n
+盐水 138 n
+盐水镇 3 ns
+盐水顶替 3 n
+盐水鸭 4 n
+盐汁 3 n
+盐池 68 n
+盐池县 13 ns
+盐汽水 3 n
+盐河 21 ns
+盐沼 34 n
+盐泉 5 nz
+盐法 3 n
+盐泽 13 n
+盐津 3 ns
+盐津县 3 ns
+盐浓度 3 n
+盐渍 31 n
+盐渍化 28 n
+盐湖 162 ns
+盐湖区 3 ns
+盐湖城 16 ns
+盐源 6 n
+盐源县 5 ns
+盐溶 3 n
+盐溶液 52 n
+盐滩 3 n
+盐漠 3 n
+盐焗鸡 3 vn
+盐熂 3 vn
+盐环定 3 n
+盐瓶 3 n
+盐田 26 n
+盐田区 2 ns
+盐田港 11 ns
+盐矿 60 n
+盐硷化 3 vn
+盐硷土 3 vn
+盐硷地 3 z
+盐硷滩 3 v
+盐碱 81 n
+盐碱化 19 n
+盐碱土 16 n
+盐碱地 75 n
+盐碱滩 6 n
+盐种 3 n
+盐税 91 n
+盐类 143 n
+盐粉 3 n
+盐粒 14 n
+盐缸 3 n
+盐罐 5 n
+盐肤木 5 n
+盐花 3 n
+盐茶 10 n
+盐贩 11 n
+盐贩子 20 n
+盐赋 3 n
+盐赛 3 n
+盐边 4 n
+盐边县 2 ns
+盐运使 3 n
+盐适量 3 n
+盐都 30 ns
+盐都区 3 ns
+盐都县 3 ns
+盐酸 276 n
+盐酸环丙沙星 3 nz
+盐酸盐 24 n
+盐量计 3 n
+盐铁 143 n
+盐铁使 79 n
+盐铁论 30 n
+盐铁部 3 n
+盐铺 4 n
+盐阜 4 ns
+盐雾箱 3 n
+盐霜 38 nz
+监 2444 vn
+监临自盗 3 i
+监主自盗 3 n
+监事 292 n
+监事会 350 n
+监事长 2 n
+监交 3 vn
+监修 3 vn
+监军 3 n
+监刑官 4 n
+监利 1046 vn
+监利县 522 ns
+监制 43 vn
+监劳 3 n
+监卖 3 v
+监印 3 vn
+监听 121 vn
+监听器 2 n
+监听室 3 n
+监听站 76 n
+监听系统 3 n
+监国 3 ns
+监场 4 n
+监外 24 vn
+监外执行 3 nt
+监头 3 n
+监委 3 n
+监守 104 vn
+监守自盗 7 i
+监宫 3 n
+监察 1339 vn
+监察厅 2 n
+监察员 31 n
+监察处 18 n
+监察委员 3 n
+监察官 130 n
+监察室 10 n
+监察局 11 n
+监察所 3 n
+监察机关 3 n
+监察权 20 n
+监察科 3 n
+监察组 4 n
+监察部 64 n
+监察部门 46 n
+监察院 146 n
+监察院长 3 n
+监工 71 vn
+监市履狶 3 n
+监房 3 vn
+监所 31 n
+监所检察 3 n
+监护 488 vn
+监护人 164 n
+监护人员 3 n
+监护仪 4 n
+监护室 21 n
+监护权 12 n
+监押 30 vn
+监控 540 vn
+监控卡 3 n
+监控台 3 n
+监控器 2 n
+监控室 3 n
+监控点 2 n
+监摹 3 v
+监收 3 vn
+监查 3 vn
+监测 1002 vn
+监测中心 7 n
+监测仪 4 n
+监测仪器 3 n
+监测员 2 n
+监测器 5 n
+监测技术 3 n
+监测数据 2 n
+监测点 9 n
+监测站 25 n
+监测网 15 n
+监测船 4 n
+监澧 3 ns
+监澧县 3 v
+监牢 42 n
+监犯 2 n
+监狱 980 n
+监狱检察 3 n
+监狱法 3 n
+监狱看守 3 i
+监狱长 8 n
+监理 77 vn
+监理人 3 n
+监理员 3 n
+监理所 3 n
+监理部 2 n
+监生 27 n
+监用 3 vn
+监盆 3 n
+监督 7969 vn
+监督制 2 n
+监督制度 3 n
+监督制约 3 n
+监督卡 2 nz
+监督员 38 n
+监督哨 3 n
+监督局 13 n
+监督岗 3 n
+监督控制 2 nz
+监督有力 3 n
+监督机制 3 n
+监督机构 3 n
+监督权 551 n
+监督科 2 nz
+监督程序 3 n
+监督站 4 n
+监督管理 31 n
+监督网 3 nz
+监督者 11 n
+监票 10 n
+监票人 3 n
+监禁 444 vn
+监管 1144 vn
+监管不周 3 n
+监管区 2 n
+监管司 2 n
+监管场所 3 n
+监管局 3 n
+监管网 3 n
+监管者 19 n
+监管部 2 n
+监管部门 144 n
+监终 3 v
+监缴 3 v
+监考 70 vn
+监考人 3 n
+监考员 2 n
+监考官 3 n
+监舍 3 n
+监装 3 vn
+监视 1025 v
+监视仪 3 n
+监视哨 3 n
+监视器 60 n
+监视居住 3 i
+监视系统 3 n
+监视记录 3 n
+监试 3 vn
+监课 3 n
+监课所 3 n
+监造 45 vn
+监销 3 vn
+监门之养 3 n
+监院 6 n
+监靶手 3 n
+监频器 3 n
+盒 1086 q
+盒内 3 n
+盒子 443 n
+盒子枪 10 n
+盒子炮 6 n
+盒带 6 n
+盒式 25 n
+盒式带 3 n
+盒式磁带 3 n
+盒式磁盘 3 n
+盒式诱变 3 z
+盒形天线 3 n
+盒盖 70 n
+盒装 6 n
+盒里 3 n
+盒饭 56 n
+盔 501 n
+盔子 3 n
+盔帽 7 n
+盔甲 202 n
+盔胄 3 n
+盖 4175 v
+盖一盖 3 nr
+盖一鸣 84 nr
+盖不由己 3 i
+盖世 106 nrt
+盖世之 2 nr
+盖世之才 3 nr
+盖世太保 19 nr
+盖世无匹 3 nr
+盖世无双 4 i
+盖世英雄 2 nr
+盖世豪侠 3 nr
+盖丽丽 3 nr
+盖乌斯 4 nr
+盖了又盖 3 nr
+盖亚 3 nrt
+盖亚盖亚 3 nr
+盖亚纳 3 nr
+盖亚那 3 nr
+盖以文 2 nr
+盖伊 13 nrt
+盖住 3 v
+盖保德 2 nr
+盖儿 17 nr
+盖克 2 nrt
+盖写 3 v
+盖勒 3 nrt
+盖印 3 nr
+盖印处 3 n
+盖县 13 ns
+盖叫天 10 nr
+盖吕萨 2 nr
+盖吴通 2 nr
+盖嘉运 2 nr
+盖土机 3 nr
+盖埃斯 3 nr
+盖增君 3 nr
+盖增圣 3 nr
+盖增臣 5 nr
+盖增贤 5 nr
+盖天军 3 nr
+盖天力 2 nr
+盖天说 30 nrfg
+盖头 50 n
+盖头换面 3 i
+盖奕 3 i
+盖奥克 4 nr
+盖好锦 2 nr
+盖子 264 nr
+盖孟尝 3 nr
+盖宝罗 2 nr
+盖小铃 3 nr
+盖尔 55 nrt
+盖尔人 5 nrt
+盖尔化 2 nr
+盖尔德 8 nrt
+盖尔曼 4 nr
+盖尔森 17 nr
+盖尔特 3 nrt
+盖尔范 5 nr
+盖尔语 8 nr
+盖尤斯 4 nr
+盖尼耶 2 nr
+盖层 3 n
+盖州 50 ns
+盖州市 9 ns
+盖帘 3 n
+盖帽 66 n
+盖帽儿 3 nr
+盖弹 2 n
+盖德 204 nrt
+盖德回 6 nr
+盖德尔 7 nr
+盖德正 2 nr
+盖德派 3 nr
+盖德网 4 nr
+盖成 3 nrfg
+盖戳 2 n
+盖房 78 n
+盖房子 14 nr
+盖拉 22 nrt
+盖拉河 2 nr
+盖拉特 2 nrt
+盖拉赫 5 nr
+盖掉 3 v
+盖摄 3 v
+盖斯 8 nrt
+盖斯凯 9 nr
+盖新房 3 nr
+盖板 26 n
+盖格 3 nrt
+盖棺 3 n
+盖棺事定 3 nr
+盖棺定论 3 nr
+盖棺论定 13 i
+盖楼 9 nr
+盖比 2 nrt
+盖毕尔 4 nr
+盖泽尔 2 nr
+盖洛德 2 nr
+盖洛普 11 nr
+盖浇饭 4 n
+盖济尔 2 nr
+盖满 3 nr
+盖然性 3 n
+盖特 3 nrt
+盖特威 3 nr
+盖玛雅 2 nr
+盖玻片 3 n
+盖瑟斯 4 nrt
+盖瓦 3 nrt
+盖瓦尔 6 nr
+盖盅儿 3 z
+盖盖儿 2 nr
+盖碗 41 n
+盖碗儿 2 nr
+盖碗茶 37 nr
+盖碗香 3 nr
+盖章 164 nr
+盖章处 3 nr
+盖罗 2 nrt
+盖耳曼 8 nr
+盖茨 265 nrt
+盖茨堡镇 2 ns
+盖莱克 4 nr
+盖菜 3 n
+盖蒂 2 nrt
+盖詹姆 3 nr
+盖起 68 v
+盖起来 3 nr
+盖达尔 6 nr
+盖运聪 8 nr
+盖造 3 v
+盖里 3 nrt
+盖里克 4 nrt
+盖金东 2 nr
+盖雷姆 2 nr
+盖顿 16 nrt
+盖饭 3 n
+盖髓 3 n
+盖鸣晖 3 nr
+盗 2199 zg
+盗世欺名 3 i
+盗亦有道 11 l
+盗伐 5 n
+盗伐林木 3 n
+盗佛线 3 n
+盗劫 3 v
+盗匪 59 n
+盗卖 43 v
+盗卖公物 3 n
+盗卖案 3 n
+盗卖者 3 n
+盗印 9 v
+盗去 3 v
+盗取 71 v
+盗号 3 n
+盗号者 3 n
+盗名 3 v
+盗名暗世 3 l
+盗名欺世 2 i
+盗国大盗 3 n
+盗垒 3 n
+盗垒成功 3 n
+盗墓 413 n
+盗墓者 76 n
+盗墓贼 149 n
+盗墓迷城 3 vn
+盗嫂受金 3 n
+盗宝 18 n
+盗寇 3 n
+盗尸 3 n
+盗尸者 3 n
+盗怨主人 3 n
+盗憎主人 3 i
+盗打 3 v
+盗抢 3 v
+盗抢险 2 n
+盗掘 59 v
+盗林 3 n
+盗案 3 n
+盗款 3 n
+盗汗 68 v
+盗泉 3 n
+盗火线 3 n
+盗版 430 v
+盗版书 18 n
+盗版率 30 n
+盗版碟 3 n
+盗版者 5 n
+盗版软件 3 n
+盗犯 3 v
+盗玉窃钩 3 i
+盗用 38 v
+盗用公款 3 n
+盗码者 3 n
+盗窃 259 v
+盗窃案 10 n
+盗窃犯 5 n
+盗窃罪 11 n
+盗窃者 7 n
+盗贼 265 n
+盗贼团 3 n
+盗贼王 3 n
+盗走 24 v
+盗跖之物 3 n
+盗车 3 n
+盗车人 3 n
+盗车贼 3 n
+盗运 7 n
+盗采 2 v
+盗钟掩耳 3 i
+盗铃掩耳 3 i
+盗链 3 n
+盗领 3 v
+盗食致饱 3 l
+盗首 3 v
+盗骗 3 v
+盗魁 98 n
+盘 3846 q
+盘上 3 s
+盘丝岭 2 nr
+盘丝洞 9 nr
+盘丫吉 43 nr
+盘中 279 s
+盘中盛 2 nr
+盘中餐 6 n
+盘亏 3 v
+盘亘 3 v
+盘亚纲 2 nr
+盘仓 3 v
+盘估 3 v
+盘住 3 v
+盘元 3 n
+盘内 16 s
+盘内盛 5 nr
+盘划 3 n
+盘剥 114 v
+盘升 15 v
+盘县 9 ns
+盘县特区 3 ns
+盘发 3 v
+盘古 135 ns
+盘古开天 3 nr
+盘古开天地 6 i
+盘回 3 v
+盘地 3 s
+盘坐 11 v
+盘坐在 3 n
+盘坐着 3 n
+盘头 3 s
+盘子 427 n
+盘存 17 v
+盘尼西林 21 ns
+盘山 60 ns
+盘山公路 11 n
+盘山县 7 ns
+盘山路 3 ns
+盘山道 3 nr
+盘川 3 ns
+盘帐 3 n
+盘带 7 n
+盘库 2 n
+盘底 3 s
+盘店 3 n
+盘庚弟 3 nr
+盘庚至 2 nr
+盘庚迁 21 nr
+盘庚遂 2 nr
+盘弄 5 v
+盘式 26 n
+盘成 3 v
+盘据 11 n
+盘整 26 vn
+盘旋 501 v
+盘旋曲折 3 n
+盘星石 2 nr
+盘星藻 2 nr
+盘曲 16 n
+盘木朽株 3 n
+盘杠子 3 nr
+盘条 3 n
+盘查 107 vn
+盘根 3 ns
+盘根究底 3 n
+盘根错节 55 i
+盘根问地 3 i
+盘根问底 3 i
+盘桓 137 nr
+盘桓着 3 nr
+盘梯 3 n
+盘水加剑 3 nr
+盘江 4 ns
+盘沽 3 ns
+盘活 77 vn
+盘淮夷 2 nr
+盘游无度 3 n
+盘满钵满 3 nr
+盘灶 3 n
+盘点 73 n
+盘点机 3 n
+盘片 10 n
+盘片组 3 n
+盘特区 3 ns
+盘状石 2 nr
+盘王 3 nrt
+盘王节 3 nr
+盘球 5 n
+盘盏 3 n
+盘石 15 n
+盘石桑苞 3 nr
+盘碟 6 n
+盘福路 3 nr
+盘秤 3 n
+盘究 3 vn
+盘符 3 n
+盘算 471 v
+盘算着 3 v
+盘管 2 n
+盘簧 3 n
+盘纸 4 n
+盘结 3 v
+盘绕 32 v
+盘绕在 3 nr
+盘绕着 3 n
+盘缠 191 v
+盘脚坐 3 i
+盘腿 94 n
+盘膝 181 v
+盘膝而坐 3 i
+盘舵石 2 nr
+盘菌 3 n
+盘蛇坡 7 nr
+盘蛇谷 5 nr
+盘诘 19 v
+盘谷 3 n
+盘账 3 v
+盘货 3 n
+盘费 20 n
+盘起 3 s
+盘踞 187 v
+盘身 3 v
+盘车科 2 n
+盘运 3 n
+盘道 9 v
+盘里 3 s
+盘金彩 2 nr
+盘错 3 v
+盘锥天线 3 n
+盘锦 25 nr
+盘锦县 3 nr
+盘锦市 8 ns
+盘门 3 n
+盘问 198 v
+盘陀 12 nrt
+盘陀路 3 n
+盘面 126 n
+盘香 6 nr
+盘马弯弓 6 i
+盘鼓 7 n
+盘龙 153 nr
+盘龙之癖 3 n
+盘龙区 2 ns
+盘龙卧虎 3 i
+盘龙城 3 ns
+盘龙江 8 ns
+盘龙目 3 nr
+盘龙镇 7 nr
+盛 3260 v
+盛世 211 nr
+盛世才 16 nr
+盛世良 4 nr
+盛业 7 n
+盛丹菁 2 nr
+盛举 15 v
+盛之象 2 nr
+盛乐城 3 nr
+盛乐迁 3 nr
+盛事 96 n
+盛于唐 3 nr
+盛于宋 5 nr
+盛于明 3 nr
+盛云龙 26 nr
+盛产 1323 n
+盛京 204 ns
+盛京时 2 nr
+盛仲文 3 nr
+盛会 298 n
+盛传 64 v
+盛佛宝 2 nr
+盛倡 16 v
+盛储器 2 n
+盛元宝 4 nr
+盛先生 3 nr
+盛典 73 b
+盛冈 3 ns
+盛况 126 n
+盛况空前 36 i
+盛到 3 v
+盛剑秋 3 nr
+盛华仁 516 nr
+盛华杰 3 nr
+盛反 3 v
+盛发期 3 n
+盛古 10 ns
+盛名 299 v
+盛名之下 9 i
+盛名之累 3 l
+盛名难副 3 i
+盛名难负 3 i
+盛和帮 2 nr
+盛唐 115 t
+盛唐时 5 nr
+盛器 2 n
+盛国兰 2 nr
+盛国庆 6 nr
+盛在 3 t
+盛夏 106 nr
+盛大 616 b
+盛大举行 3 i
+盛大传奇 3 nr
+盛大勇 4 nr
+盛大宴会 3 nr
+盛大网络 3 n
+盛好 3 v
+盛孝章 6 nr
+盛季 3 t
+盛宣怀 521 nr
+盛宴 103 n
+盛宴难再 3 nr
+盛寒 2 b
+盛年 36 t
+盛开 609 v
+盛开着 3 l
+盛得 3 v
+盛德 26 nr
+盛德之 4 nr
+盛德遗范 3 nr
+盛必虑衰 3 l
+盛怒 132 nr
+盛怒之下 3 i
+盛情 150 n
+盛情接待 3 i
+盛情款待 3 n
+盛情难却 15 l
+盛意 24 v
+盛意拳拳 3 i
+盛意难却 3 l
+盛收 3 v
+盛放 36 v
+盛放彩 2 n
+盛文郁 5 nr
+盛时 3 t
+盛时西 3 nr
+盛明 3 nr
+盛景 16 n
+盛暑 31 v
+盛有浓 8 nr
+盛有生 8 nr
+盛服 3 v
+盛期 46 b
+盛杏荪 2 nr
+盛极一时 61 i
+盛极必衰 3 l
+盛极而衰 7 i
+盛果期 5 n
+盛气 7 n
+盛气临人 3 i
+盛气凌人 53 i
+盛水不漏 3 i
+盛水期 2 t
+盛水铜 4 nr
+盛泽名 3 nr
+盛泽归 4 nr
+盛泽镇 19 nr
+盛润 84 n
+盛演 5 v
+盛田昭 4 nr
+盛甲 3 b
+盛称尧 2 nr
+盛筵 3 n
+盛筵必散 3 v
+盛筵难再 3 nr
+盛者 2 n
+盛花期 10 n
+盛菜 3 n
+盛行 1207 v
+盛行一时 3 b
+盛行于 3 nr
+盛衰 113 nr
+盛衰兴废 3 i
+盛衰荣辱 2 l
+盛装 108 v
+盛观 3 n
+盛誉 81 n
+盛赞 68 nr
+盛起 3 v
+盛过 3 v
+盛过去 3 l
+盛过来 3 l
+盛酒 3 v
+盛销 3 v
+盛锡福 7 nr
+盛频 2 b
+盛食厉兵 3 i
+盛饭 38 v
+盛馔 3 n
+盛鱼 3 n
+盝 5 zg
+盟 807 n
+盟主 526 n
+盟书 3 n
+盟兄 3 n
+盟兄弟 9 n
+盟军 385 n
+盟军部队 3 n
+盟友 253 n
+盟员 24 n
+盟国 379 n
+盟委 3 n
+盟山誓海 3 n
+盟弟 3 n
+盟敢 3 v
+盟旗 3 n
+盟机 3 n
+盟约 119 n
+盟誓 106 n
+盟邦 33 n
+盟重 3 n
+盟重土城 3 n
+盟长 12 n
+盡 2 zg
+監 2 zg
+盥 24 b
+盥洗 29 b
+盥洗台 3 n
+盥洗室 16 n
+盥洗间 2 n
+盥漱 9 v
+盦 12 zg
+盧 3 zg
+盨 3 zg
+盩 8 zg
+盪 2 zg
+盫 2 zg
+盬 3 zg
+目 5518 t
+目下 130 t
+目下十行 3 n
+目不交睫 4 i
+目不别视 3 i
+目不忍睹 4 i
+目不忍见 3 i
+目不忍视 3 i
+目不斜视 32 l
+目不旁视 3 i
+目不暇接 53 i
+目不暇给 6 i
+目不知书 3 i
+目不窥园 3 n
+目不给赏 3 i
+目不苟视 3 i
+目不见睫 3 i
+目不识丁 22 i
+目不识书 3 i
+目不转睛 240 i
+目不邪视 3 i
+目中 3 t
+目中无人 44 i
+目乱睛迷 3 l
+目乱精迷 3 i
+目交心通 3 i
+目今 3 t
+目使颐令 3 v
+目光 3368 n
+目光如炬 16 i
+目光如豆 2 i
+目光如鼠 3 i
+目光灼灼 3 i
+目光炯炯 52 i
+目光犀利 3 i
+目光短浅 23 i
+目光远大 3 i
+目兔顾犬 3 i
+目击 80 v
+目击者 61 n
+目击耳闻 3 n
+目击记 3 n
+目击道存 3 n
+目别汇分 3 n
+目前 18396 t
+目前为止 3 i
+目力 36 n
+目力表 3 n
+目动言肆 3 i
+目地 11 n
+目录 2256 n
+目录卡片 3 n
+目录名 7 n
+目录学 84 n
+目录室 3 n
+目录改编 3 n
+目录柜 3 n
+目录索引 3 n
+目怔口呆 3 v
+目成心许 3 n
+目指气使 3 n
+目挑心悦 3 v
+目挑心招 3 i
+目挑眉语 3 i
+目擩耳染 3 n
+目断魂销 3 i
+目断鳞鸿 3 i
+目无 3 i
+目无三尺 3 i
+目无下尘 3 i
+目无余子 3 l
+目无全牛 3 i
+目无国法 2 i
+目无尊长 8 i
+目无法纪 8 i
+目无王法 2 i
+目标 11527 n
+目标价 46 n
+目标伪装 3 n
+目标侦察 3 n
+目标值 10 n
+目标区 31 n
+目标性 3 n
+目标目录 6 n
+目标程序 21 n
+目标线 3 n
+目标群体 3 n
+目标语言 3 n
+目标软件 3 n
+目次 3 t
+目步转睛 3 n
+目治手营 3 n
+目注心凝 3 n
+目注心营 3 i
+目测 27 v
+目测点 3 n
+目濡耳染 3 i
+目牛无全 3 i
+目的 9440 n
+目的地 1471 n
+目的性 44 n
+目的意义 3 n
+目的旨在 3 n
+目的港 3 n
+目的物 3 n
+目的论 37 n
+目目相觑 3 i
+目眐心骇 3 n
+目眢心忳 3 z
+目眦尽裂 3 i
+目眩 58 v
+目眩头昏 3 i
+目眩头晕 3 i
+目眩神摇 2 i
+目眩神迷 3 i
+目眩神驰 11 i
+目眶 3 n
+目睁口呆 3 i
+目睫之论 3 n
+目睹 884 v
+目睹者 2 n
+目睹耳闻 3 i
+目瞪口僵 3 i
+目瞪口呆 444 i
+目瞪口张 3 i
+目瞪口歪 3 i
+目瞪口结 3 i
+目瞪心骇 3 n
+目瞪舌强 3 i
+目瞪舌彊 3 v
+目知眼见 3 i
+目空一世 3 i
+目空一切 30 i
+目空余子 3 n
+目窕心与 3 i
+目窗 3 n
+目脑 12 n
+目色 3 n
+目若悬珠 3 i
+目莲救母 3 n
+目见 4 n
+目见耳闻 3 i
+目视 195 n
+目视判读 3 n
+目论 3 n
+目语 3 n
+目语额瞬 3 l
+目达耳通 3 i
+目迎 3 v
+目迎目送 3 n
+目连 3 n
+目迷五色 2 i
+目送 174 v
+目送手挥 3 i
+目逆而送 3 n
+目部 3 n
+目酣神醉 2 i
+目量意营 3 n
+目镜 64 n
+目露凶光 3 i
+目露悸容 3 z
+目食耳视 3 i
+目鱼 10 n
+盯 1977 v
+盯上 105 v
+盯人 24 v
+盯住 289 v
+盯守 2 v
+盯屏 3 v
+盯梢 21 v
+盯死 3 v
+盯紧 3 v
+盯视 15 v
+盯问 3 v
+盯防 41 v
+盱 6 ns
+盱眙 68 ns
+盱眙县 5 ns
+盱衡厉色 3 nr
+盲 403 n
+盲人 352 n
+盲人得意 3 i
+盲人扪烛 3 i
+盲人把烛 3 n
+盲人摸象 11 n
+盲人瞎马 3 i
+盲人花园 3 n
+盲人说象 3 n
+盲从 58 n
+盲从者 2 n
+盲传 3 n
+盲侠 3 n
+盲动 97 ad
+盲动主义 3 n
+盲区 31 n
+盲哑 3 a
+盲哑学校 3 n
+盲哑教育 3 n
+盲女 4 n
+盲字 2 n
+盲干 16 n
+盲打 2 n
+盲文 14 n
+盲校 4 n
+盲棋 4 n
+盲流 24 n
+盲点 48 n
+盲生 3 n
+盲目 852 n
+盲目乐观 3 n
+盲目发展 3 i
+盲目崇拜 3 i
+盲目引进 3 i
+盲目性 69 n
+盲目投资 3 i
+盲目攀比 3 z
+盲目服从 3 i
+盲目生产 3 n
+盲目行动 3 i
+盲童 23 n
+盲翁扪籥 3 i
+盲翁扪钥 3 i
+盲者 3 n
+盲者得镜 3 n
+盲聋哑 6 i
+盲聋学校 3 j
+盲肠 28 n
+盲肠炎 4 n
+盲试 3 n
+盲谷 3 n
+盲障 3 n
+盲风妒雨 3 i
+盲风怪云 3 i
+盲风怪雨 3 i
+盲风晦雨 3 i
+盲风暴雨 3 i
+盲风涩雨 3 n
+直 15928 d
+直上云霄 2 i
+直上直下 52 i
+直上青云 3 i
+直下 3 v
+直不笼统 3 n
+直中 3 ns
+直书 3 n
+直交 3 v
+直传 34 v
+直传球 4 n
+直体 10 n
+直供 3 v
+直僵僵 2 z
+直入公堂 3 n
+直内方外 3 l
+直冲 3 v
+直冲横撞 3 i
+直出直进 3 i
+直列 44 b
+直到 1131 v
+直到现在 3 l
+直刺 142 v
+直动手机 3 n
+直勾勾 51 z
+直升 29 v
+直升机 1946 n
+直升机场 4 n
+直升飞机 100 n
+直发抖 3 v
+直发毛 3 n
+直取 172 v
+直口无言 3 i
+直叫人 3 n
+直号 3 n
+直呆呆 3 z
+直呼 3 v
+直呼其名 3 i
+直哭 3 v
+直喊 3 v
+直喷 29 v
+直喷式 4 b
+直喻 3 n
+直嚷嚷 3 z
+直壮曲老 3 i
+直奔 507 v
+直孔 4 n
+直射 186 v
+直射光 3 n
+直尺 22 n
+直属 742 n
+直属单位 3 n
+直属机关 36 ns
+直属机构 3 n
+直属长官 3 n
+直岗拉卡 3 ns
+直布罗陀 70 ns
+直布罗陀海峡 55 ns
+直开 3 ad
+直往 3 v
+直径 1683 n
+直径研磨 3 n
+直径约 3 n
+直待 3 v
+直得 3 v
+直心 3 ad
+直心眼 3 i
+直心眼儿 3 l
+直快 19 v
+直性 3 n
+直性子 24 n
+直情径行 3 i
+直愕愕 3 v
+直感 11 n
+直愣愣 23 z
+直截 11 v
+直截了当 157 i
+直手机 3 n
+直扑 3 n
+直扑无华 3 i
+直抒 3 i
+直抒己见 3 i
+直抒胸臆 20 i
+直抵 190 v
+直拉 15 ns
+直拍 20 v
+直拔电话 3 l
+直拨 19 v
+直拳 3 n
+直挂 11 v
+直指 263 n
+直挺 3 z
+直挺挺 115 z
+直捣 53 v
+直捣黄龙 15 i
+直捷 9 z
+直捷了当 3 l
+直排式 3 l
+直接 14906 ad
+直接了当 6 i
+直接判断 3 n
+直接原因 3 n
+直接参与 3 i
+直接受理 3 i
+直接固位 3 n
+直接存取 3 l
+直接对话 3 l
+直接推理 6 i
+直接插入 3 i
+直接支援 3 i
+直接染料 3 n
+直接照明 3 i
+直接税 10 n
+直接经验 6 n
+直接证明 3 nz
+直接贸易 3 l
+直接费用 3 n
+直摆 3 v
+直撅撅 3 z
+直撞 3 v
+直撞横冲 3 i
+直播 3572 vn
+直播员 3 n
+直播室 4 n
+直播站 3 n
+直播表 3 n
+直播间 13 n
+直放站 3 n
+直教人 3 n
+直方图 3 n
+直望 3 v
+直木先伐 3 i
+直木必伐 3 i
+直权无华 3 nz
+直杆 4 n
+直条 3 n
+直来直去 50 i
+直来直往 3 i
+直板 2 n
+直板机 3 n
+直柄 4 n
+直柄钻 3 v
+直根 4 ns
+直根系 6 l
+直流 219 n
+直流发电 3 n
+直流溅射 3 vn
+直流电 189 n
+直流电动 3 l
+直流电机 3 n
+直流电桥 3 n
+直流电源 3 n
+直溜 6 z
+直溜溜 2 z
+直爬梯 3 n
+直爽 74 a
+直率 108 n
+直球 3 n
+直理 3 n
+直登 3 v
+直白 87 v
+直盯 3 z
+直盯盯 11 z
+直直地 75 z
+直直的 28 z
+直眉怒目 3 i
+直眉楞眼 3 n
+直眉睖眼 3 v
+直眉瞪眼 3 i
+直着 3 v
+直瞪瞪 12 z
+直积集 3 n
+直立 424 v
+直立人 76 n
+直立压条 3 n
+直立式 3 n
+直立茎 6 n
+直立起来 3 i
+直竖 3 d
+直笔 4 n
+直筒子 3 n
+直管 271 n
+直系 356 n
+直系亲属 38 l
+直系家庭 3 l
+直纹曲面 3 n
+直线 871 n
+直线传播 3 l
+直线发展 3 nt
+直线型 3 b
+直线导轨 3 n
+直线度 3 n
+直线式 2 b
+直线筛 3 n
+直线轴承 3 l
+直线运动 3 l
+直线阵 3 n
+直经 3 n
+直统统 2 n
+直罗镇 14 ns
+直罗镇战役 9 nz
+直美 3 ns
+直翅目 18 n
+直而不挺 3 i
+直肠 153 n
+直肠子 13 n
+直肠炎 3 n
+直肠癌 128 n
+直肠直肚 3 i
+直肠镜 6 n
+直脾气 3 v
+直至 1657 v
+直航 78 v
+直航机 2 n
+直营 7 b
+直营店 11 n
+直落 90 v
+直落到 3 l
+直落在 3 z
+直行 39 v
+直裰 114 n
+直观 332 n
+直观图 3 n
+直观性 13 n
+直观教具 3 l
+直观教学 3 l
+直视 111 v
+直觉 345 n
+直觉主义 23 n
+直觉反应 3 l
+直觉学习 3 n
+直觉性 3 n
+直角 107 n
+直角三角 3 ns
+直角三角形 40 ns
+直角坐标 45 n
+直角尺 3 n
+直言 792 n
+直言不讳 104 i
+直言切谏 3 i
+直言勿讳 3 i
+直言危行 3 i
+直言取祸 3 i
+直言尽意 3 i
+直言无讳 3 i
+直言无隐 3 i
+直言极谏 7 l
+直言正色 3 i
+直言正论 3 i
+直言正谏 3 i
+直言进谏 14 l
+直认不讳 5 l
+直译 166 v
+直译器 3 n
+直译式 3 n
+直译码 3 n
+直话 5 n
+直话直说 3 l
+直说 188 v
+直读 3 v
+直谅多闻 3 l
+直谏 3 v
+直贡呢 2 n
+直起 3 v
+直趋 3 d
+直路 8 n
+直跳 3 v
+直跳脚 3 i
+直躺 3 v
+直转 3 v
+直轰 3 v
+直辖 707 v
+直辖市 8933 n
+直边衍射 3 nz
+直达 973 v
+直达声 3 l
+直达快车 4 l
+直达车 7 l
+直运 3 n
+直进 3 v
+直连线 3 n
+直述 3 b
+直追 3 v
+直退 3 v
+直选 5 v
+直通 463 n
+直通式 3 n
+直通车 22 n
+直通通 3 n
+直逼 3 v
+直道 26 v
+直道而行 2 i
+直铺 3 n
+直链 36 n
+直链反应 3 l
+直销 123 v
+直销业 3 n
+直销价 3 n
+直销员 13 n
+直销店 3 n
+直销法 3 n
+直销网 3 n
+直镇 3 ns
+直闯 3 v
+直陈 37 v
+直隶 1078 ns
+直隶省 27 n
+直露 4 v
+直面 111 ad
+直面人生 3 i
+直面磨难 3 i
+直音 3 n
+直须 3 n
+直飞 3 v
+直飞上升 3 l
+直饮 3 n
+直饮机 3 n
+直饮水 3 n
+直馏 4 v
+直馏汽油 3 n
+相 21292 v
+相一致 3 d
+相丁谓 2 nr
+相与 71 v
+相与为一 3 l
+相严嵩 5 nr
+相中 72 v
+相为表里 3 l
+相之臣 2 nr
+相乘 34 v
+相乙儿 4 nr
+相习 3 v
+相习成风 3 n
+相书 8 v
+相争 3 v
+相争斗 2 l
+相于秦 3 nr
+相互 5664 d
+相互之间 171 l
+相互了解 3 l
+相互交换 3 l
+相互交织 3 l
+相互作用 860 l
+相互依存 3 l
+相互依赖 3 l
+相互促进 3 i
+相互信任 3 l
+相互关系 3 l
+相互协作 3 l
+相互合作 3 l
+相互尊重 3 l
+相互影响 3 l
+相互指责 3 l
+相互支持 3 i
+相互毗连 3 vn
+相互理解 3 l
+相互竞争 3 l
+相互讨论 3 l
+相互辉映 3 i
+相互连接 3 l
+相互配合 3 l
+相互间 3 l
+相交 740 v
+相交处 5 l
+相交多年 3 l
+相亲 64 v
+相亲会 3 l
+相亲相爱 37 l
+相亲相聚 3 i
+相人 3 n
+相仿 142 v
+相仿蛇大 3 nr
+相会 560 v
+相传 826 v
+相传多年 3 l
+相传已久 3 l
+相伴 222 v
+相似 3295 v
+相似乃尔 3 nr
+相似之处 3 l
+相似形 3 l
+相似性 74 n
+相似矩阵 3 i
+相位 157 v
+相位差 31 l
+相位抖动 3 i
+相位滞后 3 i
+相位角 3 n
+相位跃变 3 l
+相位阶跃 3 l
+相依 66 nr
+相依为命 103 i
+相依相偎 3 nr
+相依相克 3 nr
+相保奏 2 nr
+相信 6789 v
+相信组织 3 l
+相信群众 3 i
+相偎 3 v
+相像 148 v
+相克 50 nr
+相克相济 3 nr
+相公 923 nr
+相关 12463 v
+相关信源 3 l
+相关器 3 l
+相关度 4 l
+相关式 3 l
+相关性 87 l
+相关掩模 3 nr
+相关检查 6 nr
+相关沉积 3 l
+相关矩阵 3 i
+相关系数 3 l
+相关者 11 n
+相关联 3 l
+相关虚象 3 l
+相关驱动 3 l
+相册 26 v
+相冲 3 v
+相冲突 3 nr
+相凌 2 v
+相凌迟 3 nr
+相减 3 v
+相分 3 d
+相切 8 a
+相切相磋 3 i
+相别 3 d
+相别多年 3 l
+相副 3 l
+相劝 138 v
+相加 198 v
+相助 913 v
+相勾结 3 i
+相匹敌 3 i
+相匹配 3 nz
+相印亭 3 nr
+相即 3 d
+相去 88 v
+相去不远 3 l
+相去几何 3 l
+相去悬殊 3 l
+相去无几 3 i
+相去甚远 62 l
+相反 3895 v
+相反数 8 l
+相反相成 15 l
+相反词 3 l
+相变 102 v
+相变碟 3 n
+相合 150 v
+相同 9364 d
+相同之处 3 l
+相同点 11 n
+相向 99 v
+相吕嘉 2 nr
+相吸 3 v
+相吻 3 v
+相吻合 3 n
+相告 3 v
+相呴以湿 3 nr
+相呴相济 3 nz
+相命 3 v
+相品 2 n
+相唯识 3 l
+相商 30 v
+相善 3 v
+相嘱 3 v
+相器 2 n
+相因相生 3 i
+相因而生 3 i
+相国 85 ns
+相国之 2 nr
+相国印 3 nr
+相国吕 2 nr
+相国夫人 3 nr
+相国子 2 l
+相国寺 65 nr
+相国掌 2 nr
+相国霜 2 nr
+相图 20 v
+相地而衰征 3 l
+相均衡 16 nr
+相城区 3 ns
+相基体 3 l
+相士 19 n
+相士刘良 2 nr
+相士姚 2 nr
+相士袁 4 nr
+相声 191 d
+相声小品 3 l
+相声界 3 l
+相处 777 d
+相处更好 3 l
+相太师 3 nr
+相夫 4 nr
+相夫教子 9 l
+相失交臂 3 i
+相契 3 a
+相女配夫 3 n
+相好 103 d
+相如功 2 l
+相威胁 3 n
+相媲美 3 z
+相存相辅 3 nr
+相学 3 n
+相宇中 4 nr
+相守 4 v
+相安 5 a
+相安无事 65 i
+相安相受 3 i
+相宜 343 v
+相容 226 v
+相容性 50 l
+相容於 3 nr
+相对 6532 d
+相对主义 34 l
+相对值 5 l
+相对偏差 3 l
+相对孔径 3 n
+相对式 3 l
+相对性 83 l
+相对性状 3 l
+相对效率 3 n
+相对数 3 l
+相对无言 30 l
+相对来说 3 l
+相对极值 3 l
+相对活度 3 l
+相对湿度 71 l
+相对溼度 3 v
+相对真理 20 l
+相对而坐 3 i
+相对而言 78 l
+相对补 3 v
+相对论 475 l
+相对论性 13 l
+相对误差 3 l
+相对说来 3 l
+相对路径 3 l
+相对运动 3 l
+相对速度 3 l
+相对闭链 3 n
+相对高度 65 l
+相属律 3 l
+相山区 3 ns
+相峙 2 v
+相州 4 ns
+相州民 2 nr
+相州魏 2 nr
+相左 46 v
+相差 1052 v
+相差不多 3 l
+相差不远 3 l
+相差太多 3 l
+相差太大 3 i
+相差悬殊 3 l
+相差无几 92 i
+相差近 3 l
+相帅成风 3 nr
+相帮 80 v
+相干 224 v
+相干光 3 nr
+相干噪声 3 l
+相干性 3 n
+相干条件 3 l
+相干激发 3 l
+相干长度 3 l
+相平 2 a
+相平衡 3 nr
+相并 3 v
+相庄如宾 3 i
+相应 5312 v
+相应不理 3 l
+相应措施 3 n
+相府 25 n
+相建强 12 nr
+相异 285 a
+相张纯 2 nr
+相当 6568 d
+相当严重 3 i
+相当于 1906 v
+相当可观 3 l
+相当程度 3 l
+相当规模 3 l
+相形 3 v
+相形之下 73 l
+相形失色 3 l
+相形见绌 52 i
+相影相随 3 i
+相待 391 v
+相待如宾 3 i
+相律 3 d
+相得 3 v
+相得甚欢 3 l
+相得益彰 66 v
+相忍为国 3 l
+相忘 3 v
+相忘形骸 3 i
+相态 3 n
+相怜 3 v
+相思 160 v
+相思子 6 nr
+相思树 13 nr
+相思病 22 nr
+相思苦 3 i
+相思豆 4 nr
+相思鸟 27 nr
+相恋 19 v
+相悖 65 v
+相悦 23 a
+相惊伯有 3 nr
+相惜 3 v
+相成 15 v
+相扑 85 v
+相打 3 v
+相托 3 v
+相扣 2 v
+相扰 2 v
+相扶 3 v
+相扶而行 3 i
+相承 57 v
+相承之 2 nr
+相投 124 v
+相护 9 v
+相抵 111 d
+相拥 9 v
+相持 357 v
+相持上下 3 i
+相持不下 31 i
+相挺 2 a
+相捋 3 i
+相接 740 v
+相接处 10 l
+相控阵 108 n
+相提并论 178 i
+相搏 11 v
+相撞 149 v
+相攀 2 v
+相救 789 v
+相救岳 2 nr
+相救文 5 nr
+相救杨 3 nr
+相救钦 2 nr
+相敬 7 v
+相敬之 2 nr
+相敬如宾 28 nr
+相敬殊 2 nr
+相敬相 3 nr
+相斗 42 v
+相斥 26 v
+相时延 3 nr
+相时而动 3 l
+相映 55 v
+相映成趣 32 i
+相映成辉 3 nr
+相映红 7 nr
+相望 463 v
+相术 6 n
+相朴 3 a
+相机 418 d
+相机包 3 l
+相机而动 5 l
+相机行事 33 l
+相机观变 3 l
+相权 3 v
+相架 5 v
+相框 12 n
+相模式 3 l
+相模湾 3 nr
+相殊 16 a
+相残 22 v
+相比 4125 v
+相比之下 311 l
+相比而言 45 l
+相毕露 2 nr
+相求 3 v
+相汇 4 v
+相治 3 v
+相沿 3 n
+相沿成 3 nr
+相沿成习 3 nr
+相沿成俗 3 nr
+相济 3 n
+相消 3 v
+相混 3 v
+相溶合 2 l
+相溶性 2 n
+相激 3 v
+相濡以沫 40 i
+相炫耀 16 nr
+相烦 3 a
+相烦瑛 2 nr
+相煎何急 17 l
+相煎太急 3 n
+相熟 82 a
+相爱 124 v
+相爱多年 3 l
+相爱已久 3 l
+相父 3 n
+相片 116 n
+相片儿 3 l
+相片判读 3 n
+相片纸 3 nz
+相犯者 5 n
+相率 26 n
+相王之 2 nr
+相生 6 v
+相生律 4 l
+相生相 2 nr
+相生相克 38 nr
+相生相成 3 l
+相电压 7 v
+相电流 3 n
+相畏 2 v
+相相如生 3 i
+相看 54 v
+相着 3 v
+相瞒 3 v
+相知 75 v
+相知恨晚 3 l
+相知有素 3 l
+相知相惜 3 i
+相砥励 3 nr
+相碰 121 v
+相碰撞 3 v
+相神骏 2 nr
+相禄东 3 nr
+相禅师 4 nr
+相离 3 v
+相称 234 v
+相移 10 v
+相移常数 3 l
+相移网络 3 l
+相移键控 3 n
+相空间 3 n
+相竞 16 v
+相符 404 v
+相符合 3 nr
+相等 1541 v
+相等于 3 l
+相等值 3 l
+相簿 3 n
+相类 3 n
+相约 156 d
+相纸 4 v
+相线 3 n
+相结合 3 v
+相结纳 4 nr
+相统属 4 l
+相继 2443 d
+相继问世 3 i
+相续 3 v
+相联 166 v
+相联接 3 nr
+相聚 408 v
+相聚一刻 3 l
+相聚一堂 4 l
+相股 3 v
+相臣常 2 nr
+相良 6 a
+相色谱 8 l
+相若 61 c
+相若之 2 nr
+相范蠡 2 nr
+相草美人 3 l
+相蓝欣 2 nr
+相融 6 n
+相衔接 3 nr
+相衡 20 a
+相补 3 v
+相衬 3 v
+相袭 3 v
+相见 1238 v
+相见恨晚 26 l
+相视 172 v
+相视而笑 3 i
+相视莫逆 3 n
+相角 3 n
+相触 2 v
+相认 79 v
+相让 131 v
+相许 3 d
+相识 640 v
+相识已久 3 l
+相诉 3 v
+相诗而成 3 l
+相诸禅师 2 nr
+相谈 3 v
+相谈甚欢 3 l
+相谢方 2 nr
+相谢杨 2 nr
+相象 5 v
+相貌 976 n
+相貌堂堂 3 i
+相貌端正 3 nr
+相责 3 v
+相贴 3 v
+相贾似 2 nr
+相赖 3 v
+相赠 61 v
+相距 1093 v
+相距仅 3 d
+相距千里 3 l
+相距甚远 74 l
+相较 3 d
+相辅 3 v
+相辅相成 137 i
+相辅而行 10 i
+相辞 5 v
+相达峰 2 nr
+相迎 3 v
+相近 745 v
+相违 2 v
+相连 2009 d
+相连成 7 nr
+相连接 3 nr
+相送 3 v
+相适 2 a
+相适应 3 n
+相逆 3 v
+相通 936 v
+相速 3 d
+相逢 256 v
+相逢恨晚 3 l
+相逢狭路 3 vn
+相遇 651 v
+相邀 3 v
+相邦之 2 nr
+相邦仪 4 nr
+相邦冉 2 nr
+相邦吕 2 nr
+相邦外 2 nr
+相邦子 3 nr
+相邦建 2 nr
+相邦春 2 nr
+相邻 480 v
+相配 98 v
+相配合 3 nr
+相配套 3 n
+相里 3 nr
+相量 3 v
+相门出相 3 l
+相门有相 3 l
+相间 282 n
+相间交错 3 i
+相闻 2 n
+相际传 2 v
+相除 11 v
+相陪 3 v
+相随 133 v
+相隔 390 v
+相隔万里 3 l
+相隔不久 3 l
+相隔多年 3 l
+相靠 3 v
+相面 37 d
+相顾 2 v
+相顾失色 35 i
+相顾莞 2 nr
+相频特性 3 l
+相风使帆 3 nr
+相饶 3 v
+相馆 3 n
+相马 11 v
+相骂 3 v
+相鲍信 2 nr
+相鼠有皮 3 i
+盹 103 zg
+盹儿 20 n
+盻 2 zg
+盼 1691 v
+盼到 3 v
+盼复 3 v
+盼头 37 v
+盼婚 3 v
+盼归 4 v
+盼星星 3 nr
+盼望 698 v
+盼望已久 3 nr
+盼望着 3 n
+盼盼队 3 nr
+盼顾 3 v
+盾 677 q
+盾板 3 n
+盾构 7 n
+盾片 19 n
+盾牌 177 n
+盾状 3 n
+盾状腺 3 n
+盾皮鱼类 3 n
+眀 43 zg
+省 29951 n
+省个 3 b
+省事 117 n
+省产 3 j
+省产水果 3 n
+省亲 34 n
+省亲会友 3 n
+省人大 75 j
+省价 3 n
+省份 1212 n
+省优 7 b
+省会 1515 n
+省会市 13 n
+省体工队 3 n
+省俭 5 a
+省党部 3 n
+省公安厅 3 n
+省内 2795 s
+省内外 320 s
+省内游 3 n
+省军区 60 n
+省军级 3 b
+省农业厅 3 n
+省农办 3 j
+省农科院 3 j
+省减 3 v
+省分 3 n
+省力 73 n
+省力化 3 n
+省劲 3 a
+省区 1204 n
+省区市 22 n
+省却 35 v
+省厅 3 n
+省去 120 v
+省县市 3 n
+省吃俭用 45 l
+省名 3 n
+省图书馆 3 n
+省地 27 n
+省城 604 n
+省墓 3 n
+省外 617 s
+省委 1863 j
+省委书记 3 n
+省委党校 3 n
+省委常委 3 j
+省察 10 b
+省局 2 n
+省属 64 n
+省工商局 3 j
+省市 441 n
+省市区 16 n
+省市级 4 b
+省库 3 n
+省府 51 n
+省得 246 v
+省心 44 n
+省思 3 n
+省悟 208 n
+省情 5 n
+省报 22 n
+省掉 8 v
+省政信箱 3 n
+省政协 64 j
+省政府 662 n
+省教委 3 j
+省文 3 n
+省料 3 n
+省方观俗 3 n
+省方观民 3 n
+省时省力 5 n
+省来省去 3 i
+省林业厅 3 n
+省柴节煤灶 3 n
+省民 3 n
+省民同胞 3 n
+省油 3 n
+省油灯 7 n
+省油的灯 3 n
+省治 3 n
+省港 3 n
+省港大罢工 78 nz
+省港杯 5 nz
+省点 3 n
+省烦从简 3 i
+省煤器 3 n
+省用 3 n
+省用足财 3 n
+省电 3 j
+省界 14 n
+省略 129 n
+省略不提 3 n
+省略值 3 n
+省略到 3 l
+省略句 7 n
+省略号 6 n
+省直 1895 j
+省直机关 3 n
+省直管 3 j
+省省 3 n
+省督 9 n
+省科委 3 j
+省立 34 v
+省立医院 3 n
+省籍 275 n
+省繁从简 3 i
+省级 5563 b
+省级机关 3 n
+省级机构 3 n
+省级重点 3 n
+省纪委 37 j
+省营 3 b
+省行 3 j
+省视 14 j
+省议会 3 n
+省议员 3 n
+省辖 3 n
+省辖市 1049 n
+省运会 8 j
+省道 25 n
+省部级 75 n
+省里 249 s
+省钱 89 n
+省长 3936 n
+省际 24 n
+省院 62 n
+省高院 5 n
+眄 7 zg
+眄视指使 3 v
+眇 28 g
+眈 24 x
+眈眈 3 i
+眉 1168 n
+眉冲 3 n
+眉县 25 ns
+眉头 934 n
+眉头一皱 111 i
+眉头不伸 3 i
+眉头眼尾 3 i
+眉宇 80 n
+眉宇之间 3 i
+眉尖 20 n
+眉山 26 ns
+眉山县 3 ns
+眉山市 6 ns
+眉峰 11 n
+眉开眼笑 73 i
+眉形 3 n
+眉心 98 n
+眉急 3 n
+眉批 13 n
+眉月 3 n
+眉来眼去 23 i
+眉梢 111 n
+眉棱 3 n
+眉棱骨 4 i
+眉欢眼笑 3 i
+眉毛 612 n
+眉毛胡子一把抓 4 i
+眉清目秀 66 i
+眉目 217 n
+眉目不清 3 i
+眉目之间 3 i
+眉目传情 17 i
+眉目全非 3 i
+眉目如画 13 i
+眉目清秀 3 i
+眉眼 107 n
+眉眼高低 4 i
+眉睫 11 n
+眉睫之内 3 n
+眉睫之祸 3 n
+眉端 3 n
+眉笔 7 n
+眉纹 9 n
+眉脸 3 n
+眉花笑眼 3 i
+眉语目笑 3 i
+眉间 77 n
+眉题 3 n
+眉额 3 n
+眉飞眼笑 3 i
+眉飞色舞 99 i
+眉骨 9 n
+眉高眼低 3 i
+眉黛 6 n
+眊 5 zg
+看 66641 v
+看一看 3 v
+看一遍 3 v
+看上 185 v
+看上去 1359 v
+看上眼 2 v
+看下 3 v
+看不上 3 v
+看不上眼 24 l
+看不下去 3 v
+看不出 3 v
+看不出来 3 v
+看不到 723 v
+看不完 3 v
+看不得 22 v
+看不惯 93 v
+看不懂 3 v
+看不清 3 v
+看不清楚 3 l
+看不看 3 v
+看不见 3 v
+看不起 153 v
+看不起人 3 l
+看不过去 19 l
+看不过眼 22 l
+看不透 3 v
+看不顺眼 24 l
+看个够 3 v
+看中 376 v
+看么 3 v
+看也不看 3 l
+看书 399 v
+看了又看 3 l
+看事做事 3 v
+看人下菜 4 n
+看人嘴脸 3 l
+看人眉眼 3 l
+看人眉睫 3 i
+看人眼色 3 l
+看人而定 3 l
+看人脸色 3 l
+看人行事 3 n
+看似 568 v
+看低 3 v
+看住 3 v
+看作 1369 v
+看做 181 v
+看准 220 v
+看出 1645 v
+看到 13411 v
+看到追后 3 l
+看去 3 v
+看台 195 v
+看向 3 v
+看吧 180 n
+看图 3 v
+看图识字 3 l
+看在眼里 3 l
+看场 10 n
+看坏 3 v
+看大图 3 v
+看天田 3 n
+看头 37 v
+看好 614 v
+看守 467 v
+看守内阁 13 n
+看守型 3 n
+看守室 3 n
+看守所 173 n
+看守者 2 n
+看完 3 v
+看官 47 v
+看定 3 v
+看客 62 v
+看家 65 v
+看家戏 3 n
+看家本事 3 n
+看家本领 48 n
+看家狗 7 n
+看屏 3 n
+看帖 3 n
+看开 25 v
+看开一点 3 l
+看待 855 v
+看得 3 v
+看得人 3 v
+看得出 225 v
+看得出来 3 v
+看得惯 3 v
+看得懂 3 v
+看得清 3 v
+看得见 179 v
+看得起 24 v
+看得远 3 v
+看情形 3 n
+看惯 3 n
+看戏 3 v
+看成 768 v
+看扁 3 n
+看手相 3 n
+看手相者 3 n
+看护 108 v
+看护人 3 n
+看护兵 3 n
+看护法 3 n
+看报 58 v
+看押 12 v
+看景生情 3 n
+看有 3 v
+看望 627 v
+看朱成碧 3 n
+看杀卫玠 3 v
+看来 6636 v
+看来看去 3 l
+看板 3 n
+看板同 3 n
+看样 3 v
+看样子 253 l
+看死 3 v
+看法 2491 v
+看涨 40 v
+看淡 25 v
+看清 640 v
+看清楚 33 l
+看漏 3 v
+看点 93 n
+看热闹 35 v
+看片会 3 n
+看牢 3 v
+看球 3 n
+看球赛 3 vn
+看电视 16 v
+看病 556 v
+看病票 3 n
+看病贵 3 n
+看病难 3 n
+看的上眼 3 l
+看相 55 v
+看看 6297 v
+看看书 13 v
+看眼色 3 l
+看着 6766 v
+看着办 3 v
+看破 52 v
+看破红尘 25 n
+看碟 3 n
+看稿 3 v
+看穿 29 v
+看笑话 10 l
+看管 164 v
+看置顶 3 n
+看腻 3 n
+看花了 3 l
+看菜吃饭 3 n
+看血 3 v
+看表 3 v
+看见 10022 v
+看视 3 v
+看财奴 3 n
+看货 3 v
+看走了眼 3 l
+看走眼 20 v
+看起 3 v
+看起来 569 v
+看跌 5 v
+看轻 31 v
+看过 1060 v
+看运气 3 n
+看透 159 v
+看重 570 v
+看错 3 v
+看门 69 v
+看门人 23 n
+看门狗 3 n
+看顾 29 v
+看风使帆 3 l
+看风使舵 3 i
+看风使船 3 l
+看风水 3 n
+看风转舵 3 i
+看风驶船 3 n
+看齐 72 v
+眍 6 v
+眑 5 zg
+眓 2 zg
+眔 4 zg
+眘 16 zg
+眚 8 ng
+眛 3 zg
+眜 5 zg
+眝 11 zg
+真 19988 d
+真七子 31 nr
+真三国 3 nr
+真不 3 d
+真不容易 3 l
+真不少 3 d
+真不愧是 3 l
+真不知道 3 i
+真不简单 3 z
+真不该 3 d
+真不错 3 i
+真丝 23 n
+真丝绸 2 n
+真丝面料 3 n
+真个 505 d
+真中 3 d
+真为 3 d
+真主 387 n
+真主党 19 n
+真义 2 n
+真乖 3 d
+真书 10 n
+真事 3 n
+真五子 8 nr
+真人 502 n
+真人不露 3 i
+真人不露相 14 i
+真人版 3 n
+真人真事 18 i
+真人秀 3 nr
+真人铃声 3 n
+真他妈 3 n
+真仙岩 2 nr
+真令人 3 n
+真会 3 n
+真会是 3 d
+真传 81 n
+真伪 187 a
+真伪莫辨 9 l
+真似 3 a
+真侍魂 3 nr
+真俗 3 a
+真信实意 3 l
+真值 57 n
+真值函 2 n
+真值表 14 n
+真假 285 n
+真假参半 3 i
+真假莫辨 3 l
+真假难分 3 l
+真假难辨 14 l
+真傻 3 a
+真儿 9 d
+真六子 6 nr
+真凭实据 25 l
+真凶 39 n
+真凶实犯 3 i
+真刀 3 n
+真刀真枪 42 l
+真分式 3 n
+真分数 3 n
+真切 295 a
+真切感 8 n
+真力 4 d
+真力相 2 nr
+真功夫 3 nr
+真动知觉 3 i
+真受不了 3 l
+真叫人 3 n
+真可怜 3 i
+真可敦 3 nr
+真可笑 3 l
+真叶 3 n
+真名 56 a
+真名实姓 4 l
+真名真姓 3 i
+真君子 2 nr
+真君笑 2 nr
+真味 263 d
+真命 11 d
+真命天女 3 n
+真命天子 29 n
+真品 33 n
+真响 3 n
+真善忍 3 nr
+真善美 55 nr
+真器 4 n
+真因子 3 nr
+真圆 3 n
+真地 3 d
+真坏 3 n
+真多 3 d
+真够 3 a
+真够傻 3 nr
+真够玄 2 nr
+真够甜 2 nr
+真大 3 a
+真天子 2 nr
+真太后 3 nr
+真太阳 2 nr
+真奇 27 a
+真好 3 d
+真好汉 3 nr
+真好玩 3 a
+真如慧 3 nr
+真妙 3 a
+真姓实名 3 i
+真子谭 2 nr
+真宗咸 7 nr
+真宗朝 2 nr
+真定军 4 nr
+真定城 2 nr
+真定府 55 n
+真实 3212 d
+真实世界 13 nz
+真实之影 3 l
+真实写照 3 n
+真实可信 3 l
+真实度 2 l
+真实性 226 n
+真实情况 3 l
+真实感 32 n
+真实感图形 3 l
+真实有效 3 l
+真实气体 3 l
+真实自我 3 i
+真家伙 3 n
+真容 20 n
+真寒假热 3 i
+真对 3 d
+真对不起 3 l
+真工夫 3 n
+真巧 3 d
+真巧极 2 nr
+真差 3 n
+真巴儿 2 nr
+真常 3 d
+真平 3 n
+真幸福 3 nr
+真度 2 d
+真彩 4 n
+真彩屏 3 nr
+真彩色 3 i
+真影 3 n
+真得 3 d
+真心 507 d
+真心实意 84 l
+真心恶 3 i
+真心真意 9 i
+真心诚意 44 i
+真心话 66 l
+真快 3 d
+真怕 3 d
+真性 45 n
+真性情 3 n
+真怪 18 d
+真情 385 n
+真情实意 11 l
+真情实感 21 l
+真情流露 3 i
+真情难觅 3 l
+真想念 3 n
+真意 58 d
+真慢 3 d
+真成了 3 l
+真成仙 2 nr
+真所 3 n
+真才实学 73 l
+真抓实干 21 l
+真挚 211 a
+真接触角 3 i
+真效 2 a
+真效性 2 n
+真敢 3 d
+真数 3 n
+真新 3 d
+真无此事 3 i
+真旧 3 d
+真早 3 d
+真是 7219 d
+真是假 3 l
+真是太 3 nr
+真有仙 2 nr
+真有假 3 n
+真有此事 3 l
+真服了 3 l
+真本事 3 n
+真材实 3 n
+真材实料 3 l
+真果 2 n
+真枪 3 n
+真枪实弹 10 l
+真核细胞 3 n
+真格 18 n
+真格的 18 nz
+真棒 3 n
+真正 9540 d
+真武 13 nr
+真武剑 5 nr
+真武大帝 13 nr
+真武帝 4 nr
+真武庙 3 nr
+真武汤 7 nr
+真武观 3 nr
+真武阁 10 nr
+真死 3 d
+真气 4 n
+真没想到 3 l
+真溶液 10 n
+真烈 3 a
+真熟 3 a
+真爱 3 nr
+真犀亚 2 nr
+真独简贵 3 i
+真率 3 n
+真珠 15 n
+真理 1269 n
+真理必胜 3 l
+真理性 25 n
+真理报 45 n
+真理教 3 nz
+真理观 2 n
+真田 3 n
+真田广 2 nr
+真田广之 3 nr
+真由 4 d
+真瘦 3 a
+真的 6277 d
+真的假 3 l
+真皇后 3 nr
+真皮 75 n
+真皮包 3 n
+真皮层 3 n
+真皮沙发 3 n
+真皮组织 3 l
+真直 3 d
+真相 981 d
+真相大白 51 l
+真相毕露 3 i
+真真 104 d
+真真假 3 n
+真真假假 33 l
+真真切切 54 i
+真真实实 4 l
+真真是 14 d
+真真正正 3 nr
+真知 24 n
+真知卓见 3 i
+真知灼见 35 i
+真石漆 3 n
+真确 3 d
+真神 5 n
+真神安 2 nr
+真神阿拉 3 nrt
+真稀 3 d
+真空 555 n
+真空包装 3 n
+真空地带 3 n
+真空室 6 n
+真空封脂 3 l
+真空度 10 n
+真空开关 3 l
+真空成型 3 n
+真空技术 3 n
+真空机 3 n
+真空机组 3 n
+真空泵 24 n
+真空泵油 3 z
+真空炉 3 n
+真空管 29 n
+真空蒸发 3 i
+真空袋 3 n
+真空计 9 n
+真空设备 3 n
+真空镀膜 3 n
+真章儿 6 nr
+真章鱼 3 nr
+真笨 3 a
+真箇 3 z
+真糟 3 n
+真糟糕 3 n
+真紧 3 d
+真累 3 a
+真纳 24 nr
+真经 301 d
+真维斯 36 nr
+真美 3 a
+真羽士 2 nr
+真能干 3 nr
+真脏实犯 3 n
+真腊 76 nr
+真草 3 n
+真草隶篆 3 n
+真菌 428 n
+真菌孢子 3 nz
+真菌学 7 n
+真菌性 60 n
+真菌病 3 n
+真菌类 3 n
+真菜 3 n
+真行 3 d
+真衰 3 n
+真要 3 d
+真要命 3 l
+真言 157 n
+真言真语 3 i
+真让人 3 n
+真诚 751 a
+真诚地 3 i
+真诚待人 3 i
+真诚相待 3 i
+真诚相见 3 i
+真话 291 n
+真谈 3 n
+真谛 178 n
+真象 39 n
+真象科 2 nr
+真豪杰 2 nr
+真貌 3 n
+真货 21 n
+真贫 3 a
+真贵 3 a
+真赃实犯 3 i
+真赃真贼 3 i
+真身 50 d
+真轻 3 d
+真近 3 d
+真远 3 d
+真迹 79 n
+真速度 3 n
+真遗憾 3 i
+真酷 3 a
+真释 3 n
+真重 3 a
+真金 94 n
+真金不怕 3 l
+真金不怕火炼 3 i
+真金不镀 3 n
+真金先 2 nr
+真金太 2 nr
+真金烈火 3 nrt
+真金白 2 nr
+真金第 3 nr
+真钦可 2 nr
+真长老 4 nr
+真险 3 n
+真难 3 d
+真面目 47 n
+真驹 2 n
+真骨鱼 2 n
+真髓 3 n
+真鲜 3 a
+真鲷 7 n
+真龙天子 14 nr
+真龙活现 3 i
+眠 614 vg
+眠云卧石 3 i
+眠尔通 3 ns
+眠山 9 ns
+眠思梦想 3 i
+眠花卧柳 3 i
+眠花宿柳 3 ns
+眠花藉柳 3 ns
+眠花醉柳 3 i
+眠药 3 n
+眠酮 3 n
+眠霜卧雪 3 i
+眢 10 g
+眥 2 zg
+眦 56 g
+眦裂 3 i
+眦裂发指 3 i
+眨 841 zg
+眨动 3 v
+眨巴 127 v
+眨巴眼 13 l
+眨眼 137 v
+眨眼睛 3 l
+眩 143 v
+眩丽 3 v
+眩乱 3 v
+眩人 3 n
+眩光 5 v
+眩惑 2 v
+眩晕 205 v
+眩目 21 v
+眩目惊心 3 n
+眩眼 3 v
+眩矾 3 n
+眩碧成朱 3 nr
+眩视惑听 3 n
+眬 60 v
+眭 12 nr
+眮 55 zg
+眯 461 v
+眯上 3 v
+眯住 3 v
+眯来眯去 3 z
+眯盹儿 3 v
+眯眯眼 3 v
+眯眼 3 v
+眯着 3 v
+眯着眼 3 v
+眯缝 81 v
+眯起 3 v
+眯起来 3 v
+眰 270 zg
+眳 52 zg
+眴 12 zg
+眵 10 g
+眶 133 ng
+眶下间隙 3 i
+眶点 3 i
+眷 319 n
+眷区 3 n
+眷口 3 n
+眷属 245 n
+眷念 14 n
+眷怀 3 v
+眷恋 98 v
+眷恋着 3 v
+眷村 3 n
+眷注 3 v
+眷爱 3 v
+眷眷 3 n
+眷眷不忘 3 v
+眷眷之心 3 v
+眷眷之情 3 v
+眷粮 3 n
+眷红偎翠 3 z
+眷顾 87 v
+眸 28 n
+眸子 123 n
+眹 12 zg
+眺 30 v
+眺望 225 v
+眺望台 3 v
+眺望塔 3 nz
+眺望楼 3 v
+眺览 3 v
+眻 44 zg
+眼 8863 n
+眼下 1924 t
+眼不旁视 3 l
+眼不见 36 l
+眼不见为净 15 i
+眼中 1511 s
+眼中刺 3 n
+眼中拔钉 3 l
+眼中有铁 3 n
+眼中钉 49 l
+眼亮 3 n
+眼仁 10 n
+眼保健操 3 n
+眼儿 79 n
+眼光 2009 n
+眼光缭乱 3 i
+眼关四路 3 l
+眼内 3 s
+眼内无珠 3 nz
+眼冒金星 25 n
+眼到 3 v
+眼前 4518 t
+眼前一亮 3 l
+眼前亏 33 l
+眼前利益 3 n
+眼力 174 n
+眼力健 3 n
+眼压 22 n
+眼压计 3 n
+眼去眉来 3 i
+眼图 8 n
+眼圈 241 n
+眼圈儿 82 n
+眼外伤 12 n
+眼孔 3 n
+眼宽人熟 3 i
+眼尖 58 n
+眼尖手快 3 l
+眼屎 14 n
+眼岔 3 n
+眼巴巴 136 n
+眼帘 88 n
+眼库 3 n
+眼底 83 t
+眼底下 3 s
+眼底病 3 n
+眼开眉展 3 i
+眼影 17 n
+眼影粉 3 n
+眼快 3 d
+眼急手快 3 i
+眼手并用 3 l
+眼拙 19 a
+眼时 3 t
+眼明人 3 n
+眼明心亮 3 n
+眼明手快 45 i
+眼明手捷 3 nz
+眼晕 20 n
+眼柄 3 n
+眼根 3 n
+眼梢 3 n
+眼泡 30 n
+眼泡皮 3 n
+眼波 77 n
+眼泪 2627 n
+眼泪无珠 3 i
+眼泪汪汪 3 i
+眼浅 3 n
+眼浅皮薄 3 l
+眼炎 3 n
+眼点 32 n
+眼热 27 n
+眼熟 50 a
+眼犄角儿 3 v
+眼珠 378 n
+眼珠儿 8 n
+眼珠子 160 n
+眼球 559 n
+眼生 18 n
+眼界 288 n
+眼疾 36 n
+眼疾手快 44 i
+眼病 75 n
+眼白 25 n
+眼皮 465 n
+眼皮儿 17 n
+眼皮子 58 n
+眼皮子浅 3 l
+眼皮底下 3 l
+眼皮跳 3 l
+眼目 85 n
+眼眉 10 n
+眼看 1485 v
+眼看四方 3 i
+眼看四面 3 l
+眼眍落袋 3 ns
+眼眵 3 n
+眼眶 484 n
+眼眶里 3 i
+眼眸 11 n
+眼睁睁 330 d
+眼睑 152 n
+眼睛 11190 n
+眼睛猴 3 l
+眼睫毛 56 n
+眼瞅 3 i
+眼瞎 3 n
+眼瞓 3 v
+眼瞪瞪 3 i
+眼瞳 3 v
+眼神 1030 n
+眼神儿 6 n
+眼福 18 nz
+眼福不浅 3 i
+眼离 3 n
+眼科 158 n
+眼科医生 3 nz
+眼科医院 3 nz
+眼科学 5 n
+眼空四海 3 n
+眼空无物 3 l
+眼穿心死 3 i
+眼穿肠断 3 i
+眼窝 156 n
+眼笑眉飞 3 i
+眼红 140 n
+眼红红 3 n
+眼线 44 n
+眼线液 3 n
+眼线笔 2 n
+眼结膜 3 n
+眼罩 27 n
+眼耳鼻 3 i
+眼肌 17 n
+眼脸 3 n
+眼膜 7 n
+眼色 813 n
+眼花 131 n
+眼花心乱 3 i
+眼花撩乱 3 vn
+眼花缭乱 167 i
+眼花耳热 3 i
+眼花身热 3 i
+眼花雀乱 3 i
+眼药 33 n
+眼药水 26 n
+眼药膏 3 n
+眼虫 3 n
+眼袋 27 n
+眼见 3240 n
+眼见为实 29 i
+眼见得 78 v
+眼观为实 3 i
+眼观六路 29 i
+眼观四方 3 n
+眼观四路 3 n
+眼观四面 3 n
+眼观鼻鼻 3 i
+眼角 383 n
+眼角膜 21 n
+眼识 3 n
+眼谗 3 i
+眼跳 15 v
+眼部 107 n
+眼里 1697 s
+眼量 3 n
+眼针 3 n
+眼镜 731 n
+眼镜厂 3 n
+眼镜套 3 n
+眼镜店 18 n
+眼镜架 4 n
+眼镜框 4 n
+眼镜片 5 n
+眼镜盒 7 n
+眼镜蛇 73 n
+眼霜 18 n
+眼面前 3 l
+眼音距 3 n
+眼饧耳热 3 nz
+眼馋 33 v
+眼馋肚饱 3 v
+眼高于顶 3 i
+眼高手低 29 n
+眼高手生 3 nz
+眽 341 zg
+眿 24 zg
+着 188584 uz
+着上 3 v
+着丝基因 3 n
+着丝点 4 n
+着丝粒 3 n
+着书立说 3 n
+着人先鞭 3 n
+着作 3 v
+着作人 3 n
+着作权 3 n
+着作等身 3 n
+着凉 44 a
+着力 449 n
+着力点 27 n
+着劲儿 3 d
+着名 3 v
+着名人物 3 n
+着地 498 n
+着墨 23 v
+着实 1020 d
+着床 47 v
+着录 3 v
+着忙 3 d
+着急 1068 a
+着急起来 3 n
+着恼 3 a
+着想 448 v
+着意 109 v
+着慌 7 a
+着手 1241 v
+着手于 3 v
+着手从事 3 n
+着手成春 8 n
+着数 81 n
+着法 36 v
+着火 98 v
+着火点 3 n
+着眼 572 d
+着眼于 221 v
+着眼点 83 n
+着着 3 v
+着着实实 6 z
+着称 3 v
+着紧 3 d
+着绩 3 n
+着者 3 n
+着色 122 n
+着色剂 77 n
+着色器 3 n
+着色法 3 n
+着落 150 v
+着装 159 v
+着边 3 d
+着述 3 v
+着迷 82 v
+着重 1078 a
+着重于 3 n
+着重号 2 n
+着重地 3 z
+着重强调 3 n
+着重指出 3 n
+着重描写 3 n
+着重点 59 n
+着陆 429 v
+着陆器 12 n
+着陆场 2 n
+着陆时 3 d
+着陆架 3 n
+着陆点 11 n
+着魔 36 n
+睁 2657 v
+睁一只眼 3 n
+睁一眼 3 n
+睁不开 3 n
+睁只眼 3 n
+睁大眼睛 3 n
+睁开 3 n
+睁开眼 3 n
+睁开眼睛 3 n
+睁目 3 n
+睁眼 3 n
+睁眼瞎 14 n
+睁眼瞎子 2 n
+睁起 3 n
+睃 65 v
+睃川县 3 v
+睄 4 zg
+睅 8 zg
+睆 19 zg
+睇 12 vg
+睉 5 zg
+睌 83 zg
+睍 28 zg
+睏 15 zg
+睏乏 3 v
+睐 15 g
+睑 77 g
+睑下垂 4 n
+睑缘炎 2 n
+睑腺炎 2 n
+睖 3 zg
+睘 27 zg
+睙 288 zg
+睚 3 i
+睚眦 6 v
+睚眦之怨 3 i
+睚眦必报 7 i
+睛 289 zg
+睛天 3 n
+睛天霹雳 3 nr
+睛明 3 n
+睛明穴 3 n
+睛隆 3 n
+睛隆县 3 n
+睜 3 zg
+睟面盎背 3 l
+睡 7171 v
+睡一觉 3 i
+睡上去 3 v
+睡上来 3 v
+睡下 3 v
+睡下去 3 v
+睡下来 3 v
+睡不到 3 v
+睡不着 3 v
+睡不醒 3 v
+睡个够 3 v
+睡个痛快 3 n
+睡乡 12 v
+睡到 3 v
+睡前服 3 n
+睡前用 3 v
+睡午觉 3 n
+睡卧不宁 3 i
+睡卧不安 3 i
+睡去 3 v
+睡大觉 3 n
+睡姿 21 n
+睡帽 3 n
+睡床 8 v
+睡得正甜 3 i
+睡得正香 3 i
+睡态 3 n
+睡意 122 v
+睡意全消 3 n
+睡意正浓 3 nz
+睡懒觉 3 v
+睡房 11 n
+睡来 3 v
+睡来睡去 3 n
+睡梦 296 v
+睡梦中 3 n
+睡梦之中 3 i
+睡椅 13 n
+睡毡 3 n
+睡法 3 v
+睡满 3 v
+睡熟 132 v
+睡狮 9 nz
+睡相 6 v
+睡眠 1067 v
+睡眠不足 3 n
+睡眠中枢 3 n
+睡眠曲 3 n
+睡眠期 4 n
+睡眠疗法 3 n
+睡眠症 3 n
+睡眼 28 v
+睡眼惺忪 28 i
+睡眼蒙胧 3 n
+睡着 1057 v
+睡着觉 3 v
+睡睡 3 v
+睡睡觉 3 n
+睡美人 33 n
+睡荷 3 n
+睡莲 45 n
+睡莲叶 3 n
+睡莲科 5 nz
+睡行症 3 n
+睡衣 72 n
+睡衣裤 3 n
+睡袋 54 n
+睡袍 13 n
+睡裙 4 n
+睡裤 8 n
+睡觉 1730 v
+睡觉时 3 n
+睡觉时间 3 n
+睡觉觉 3 n
+睡起 3 v
+睡足 3 v
+睡车 3 n
+睡过了头 3 i
+睡过去 3 v
+睡过来 3 v
+睡醒 63 v
+睡饱 3 v
+睡魔 4 n
+睡鼠 3 n
+睢 202 zg
+睢县 12 ns
+睢宁 12 ns
+睢宁县 5 ns
+睢阳区 3 ns
+督 1467 vg
+督令 3 n
+督促 347 v
+督促检查 3 nr
+督军 177 n
+督办 199 v
+督学 20 n
+督察 879 v
+督察室 7 n
+督察组 6 n
+督察队 3 n
+督导 104 n
+督导员 5 n
+督导室 3 n
+督导组 5 n
+督工 3 n
+督师 3 n
+督府 9 n
+督战 197 v
+督托 3 v
+督抚 118 v
+督捕 10 v
+督查 284 vn
+督查组 2 n
+督率 91 n
+督理 3 v
+督署 3 v
+督考 3 v
+督脉 52 n
+督课 3 v
+督责 3 v
+督造 3 v
+督阵 23 v
+督饬 3 v
+睥 4 l
+睥睨 5 i
+睥睨一切 3 i
+睥睨群雄 2 i
+睦 583 ag
+睦亲 3 n
+睦邻 144 n
+睦邻关系 3 l
+睦邻友好 102 l
+睦邻政策 3 l
+睨 92 vg
+睨视 3 l
+睪 14 zg
+睫 37 n
+睫毛 214 n
+睫毛刷 3 n
+睫毛夹 3 n
+睫毛油 3 n
+睫毛液 3 n
+睫毛膏 11 n
+睫状体 16 n
+睫状肌 12 n
+睬 251 v
+睮 10 zg
+睱 2 zg
+睳 178 zg
+睵 7 zg
+睶 22 zg
+睷 33 zg
+睹 155 v
+睹始知终 3 i
+睹微知著 3 i
+睹景伤情 3 i
+睹物伤情 3 i
+睹物兴情 3 i
+睹物思人 15 i
+睹物思情 3 i
+睹着知微 3 i
+睹著知微 3 v
+睺 10 zg
+睽 21 g
+睽合 3 i
+睽疑 3 i
+睽睽 3 i
+睽离 3 i
+睽违 3 i
+睽隔多年 3 i
+睾 121 n
+睾丸 237 n
+睾丸炎 3 n
+睾丸癌 3 n
+睾丸素 3 n
+睾丸酮 3 n
+睾囊 3 n
+睾酮 3 n
+睿 1061 nrt
+睿哲 3 a
+睿宗 30 nrt
+睿明 3 a
+睿智 97 a
+睿智者 3 r
+睿知 3 a
+睿达 3 nrt
+瞀 7 g
+瞄 366 zg
+瞄中 3 nz
+瞄准 858 v
+瞄准具 3 nz
+瞄准到 3 v
+瞄准器 17 nz
+瞄准镜 190 nz
+瞄出 3 v
+瞄到 3 v
+瞄向 13 v
+瞄好 3 v
+瞄来瞄去 3 z
+瞄着 3 v
+瞄紧 3 v
+瞅 1541 v
+瞅筹 3 v
+瞅见 89 v
+瞆 2 zg
+瞇 2 zg
+瞈 5 zg
+瞋 9 zg
+瞋怒 3 v
+瞋怪 3 z
+瞋目 3 vn
+瞋目切齿 3 nr
+瞋目扼腕 3 l
+瞋视 3 vn
+瞌 5 v
+瞌睡 152 v
+瞌睡虫 10 n
+瞍 3 g
+瞎 2831 v
+瞎三话四 6 n
+瞎乱 3 v
+瞎了眼 3 l
+瞎了眼睛 3 n
+瞎到 3 v
+瞎吵 3 v
+瞎吹 16 v
+瞎奶 3 n
+瞎子 712 n
+瞎子摸象 3 n
+瞎子摸鱼 3 n
+瞎干 3 n
+瞎心 3 n
+瞎忙 3 v
+瞎忙活 3 l
+瞎成 3 v
+瞎扯 38 v
+瞎抓 3 v
+瞎折腾 3 v
+瞎指挥 3 v
+瞎掉 3 v
+瞎掰 3 v
+瞎搞 4 v
+瞎摸 3 v
+瞎操心 3 n
+瞎火 3 n
+瞎炮 3 n
+瞎猜 35 v
+瞎猫捉到 3 vn
+瞎琢磨 3 v
+瞎目 3 n
+瞎眼 51 n
+瞎编 3 v
+瞎聊 3 v
+瞎胡闹 3 l
+瞎蒙 3 v
+瞎诌 3 v
+瞎话 35 n
+瞎说 203 n
+瞎说八道 3 l
+瞎调 3 v
+瞎转 3 v
+瞎逛 3 v
+瞎闯 9 v
+瞎闹 12 v
+瞎马临池 3 n
+瞏 28 zg
+瞑 29 zg
+瞑思苦想 3 v
+瞑想 3 v
+瞑目 97 v
+瞒 1555 v
+瞒上欺下 3 i
+瞒下欺上 3 i
+瞒不住 3 i
+瞒不过 3 v
+瞒人耳目 3 i
+瞒住 3 v
+瞒准 3 v
+瞒哄 13 v
+瞒天大谎 3 i
+瞒天昧地 3 i
+瞒天瞒地 3 i
+瞒天要价 3 i
+瞒天讨价 3 i
+瞒天过海 25 i
+瞒得过 3 v
+瞒心昧己 9 i
+瞒报 23 v
+瞒来瞒去 3 i
+瞒神弄鬼 3 i
+瞒过 3 v
+瞒骗 18 v
+瞓觉 3 vn
+瞟 331 v
+瞟一眼 23 v
+瞟向 3 v
+瞟见 3 v
+瞠 30 l
+瞠乎其后 3 l
+瞠乎后矣 3 i
+瞠呼其后 3 l
+瞠目 46 l
+瞠目结舌 113 i
+瞠目而视 3 l
+瞡 3 zg
+瞢 3 g
+瞥 534 v
+瞥一眼 26 v
+瞥然 3 v
+瞥见 164 v
+瞥视 3 v
+瞥闪 3 v
+瞦 2 zg
+瞧 9467 v
+瞧一瞧 3 v
+瞧不上眼 3 v
+瞧不起 384 v
+瞧不起人 3 v
+瞧出 3 v
+瞧宁 3 v
+瞧得起 99 v
+瞧来瞧去 3 z
+瞧热闹 3 v
+瞧着办 3 v
+瞧瞧 2034 v
+瞧见 515 v
+瞩 31 v
+瞩托 3 v
+瞩望 9 v
+瞩目 792 v
+瞪 1748 v
+瞪住 3 v
+瞪目 3 v
+瞪目哆口 3 v
+瞪目结舌 3 v
+瞪眼 150 v
+瞪眼咋舌 3 v
+瞪眼歪脖 3 nr
+瞪瞪 3 v
+瞪视 159 v
+瞪起 3 v
+瞪起来 3 v
+瞬 269 t
+瞬刻 15 t
+瞬即 20 d
+瞬变码型 3 n
+瞬变磁场 3 l
+瞬康 3 l
+瞬态 3 n
+瞬息 117 t
+瞬息万变 78 i
+瞬息之间 3 i
+瞬息千变 3 i
+瞬息间 50 t
+瞬时 178 t
+瞬时值 3 l
+瞬时冒险 3 l
+瞬时功率 3 l
+瞬时属性 3 l
+瞬时性 3 l
+瞬时现象 3 l
+瞬时电流 3 l
+瞬时速度 9 l
+瞬时间 3 t
+瞬目 2 n
+瞬移 3 n
+瞬间 1374 t
+瞬间即逝 3 i
+瞬间反应 3 l
+瞬间胶 3 l
+瞬霎 3 t
+瞭 41 v
+瞭望 192 v
+瞭望台 42 n
+瞭望哨 2 n
+瞮 9 zg
+瞰 22 g
+瞰瑕伺隙 3 n
+瞳 142 n
+瞳人 8 n
+瞳仁 24 n
+瞳子 4 n
+瞳子髎 3 n
+瞳孔 217 n
+瞳孔放大 3 n
+瞵 2 vg
+瞺 9 zg
+瞻 453 vg
+瞻云就日 3 i
+瞻仰 625 v
+瞻仰厅 4 i
+瞻仰者 2 i
+瞻仰遗容 3 i
+瞻养 3 v
+瞻前顾后 45 i
+瞻念 3 v
+瞻情顾意 3 i
+瞻拜 6 v
+瞻望 13 v
+瞻望咨嗟 3 v
+瞻礼 7 v
+瞻视 3 v
+瞻顾 3 v
+瞼 15 zg
+瞽 34 g
+瞽言妄举 3 l
+瞽言萏议 3 vn
+瞾 57 zg
+瞿 194 nr
+瞿世健 2 nr
+瞿北杨 2 nr
+瞿塘峡 18 nr
+瞿大人 2 nr
+瞿安德 2 nr
+瞿家湖 256 nr
+瞿希贤 4 nr
+瞿式耜 43 nr
+瞿弦和 2 nr
+瞿振元 3 nr
+瞿政宏 3 nr
+瞿文超 2 nr
+瞿河乡 3 nr
+瞿秋白 158 nr
+瞿绍基 2 nr
+瞿霆发 2 nr
+矀 28 zg
+矁 2 zg
+矇 78 v
+矇眬 37 v
+矉 47 zg
+矊 13 zg
+矌 12 zg
+矍 40 a
+矍铄 43 a
+矑 2 zg
+矓 5 zg
+矖 62 zg
+矗 470 v
+矗力 3 v
+矗立 359 v
+矗起 2 v
+矘 3 zg
+矙 18 zg
+矛 496 an
+矛头 394 n
+矛尖 3 n
+矛尾鱼 17 n
+矛柄 3 n
+矛盾 5456 an
+矛盾体 6 n
+矛盾加剧 3 n
+矛盾加深 3 n
+矛盾尖锐 3 n
+矛盾律 28 n
+矛盾性 32 n
+矛盾恶化 3 n
+矛盾激化 3 n
+矛盾百出 3 n
+矛盾的普 3 n
+矛盾的特 3 n
+矛盾论 33 n
+矛盾转化 3 n
+矛盾重重 3 n
+矜 180 a
+矜功 3 a
+矜功不立 3 v
+矜功伐善 3 v
+矜功伐能 3 vn
+矜功恃宠 3 vn
+矜功自伐 3 v
+矜功负气 3 z
+矜名妒能 3 vn
+矜名嫉能 3 vn
+矜大 3 a
+矜夸 3 v
+矜寡 3 v
+矜己自饰 3 v
+矜平躁释 3 vn
+矜怜 3 a
+矜恤 3 v
+矜惜 3 a
+矜愚饰智 3 nz
+矜才使气 3 v
+矜持 141 v
+矜智负能 3 nz
+矜纠收缭 3 nr
+矜肆 3 a
+矜能负才 3 vn
+矜贫救厄 3 ns
+矜贵 4 a
+矜重 3 a
+矜饰 3 v
+矝 13 zg
+矞 31 zg
+矟 3 zg
+矡 7 zg
+矢 439 ng
+矢不虚发 3 i
+矢列式 3 n
+矢口 3 n
+矢口否认 43 i
+矢口抵赖 3 v
+矢口狡赖 3 v
+矢吹真吾 3 i
+矢在弦上 3 i
+矢如雨下 3 i
+矢如雨集 3 i
+矢尽兵穷 3 i
+矢志 40 n
+矢志不屈 3 i
+矢志不渝 15 i
+矢志不移 10 i
+矢志捐躯 3 i
+矢志难移 3 i
+矢忠 3 v
+矢忠不二 3 i
+矢无虚发 3 i
+矢泽爱 3 n
+矢状轴 3 n
+矢石 71 n
+矢石不二 3 i
+矢石之间 3 i
+矢石之难 3 i
+矢石如雨 3 i
+矢簇 3 n
+矢言 3 n
+矢车菊 14 n
+矢量 191 n
+矢量化 3 n
+矢量图 3 n
+矢量字库 3 n
+矢量模型 3 n
+矢量积 2 n
+矣 2284 zg
+矣哉 9 u
+知 14870 v
+知一万毕 3 n
+知不知道 138 i
+知义多情 3 i
+知之为知 3 i
+知之为知之 5 i
+知之甚少 45 l
+知之者 8 n
+知书明理 3 n
+知书识理 3 n
+知书识礼 8 n
+知书达理 16 n
+知书达礼 8 n
+知事 79 v
+知交 65 v
+知产 3 v
+知人 38 n
+知人下士 3 n
+知人之明 13 i
+知人善任 35 l
+知人知面 3 i
+知人知面不知心 12 i
+知人论世 10 l
+知会 135 v
+知其一 3 l
+知其一不 3 l
+知其下落 3 i
+知其不可 3 i
+知其所以然 18 i
+知其然 22 i
+知冷知热 6 l
+知县 543 n
+知友 3 n
+知取 5 v
+知名 1495 v
+知名之士 3 i
+知名人士 147 n
+知名企业 3 n
+知名品牌 3 n
+知名商标 3 n
+知名度 311 n
+知名当世 3 i
+知名演员 8 l
+知命 3 v
+知命不忧 3 l
+知命之年 3 l
+知命乐天 3 n
+知地知天 3 i
+知多少 3 l
+知天命 21 i
+知天命之年 2 l
+知子莫若 3 i
+知子莫若父 3 i
+知客 3 n
+知小谋大 3 i
+知尽能索 3 i
+知州 3 n
+知己 266 n
+知己之遇 3 i
+知己知彼 83 i
+知底 44 v
+知府 805 n
+知彼知己 19 i
+知彼知已 3 i
+知往鉴今 3 i
+知微知彰 3 i
+知心 116 v
+知心人 10 n
+知心朋友 3 n
+知心话 29 l
+知性 40 n
+知性美 3 v
+知恩 3 v
+知恩图报 10 n
+知恩必报 3 i
+知恩报德 3 i
+知恩报恩 3 l
+知悉 61 v
+知情 300 n
+知情不举 3 i
+知情不报 3 i
+知情人 52 n
+知情权 107 n
+知情者 36 n
+知情达理 2 l
+知我罪我 3 i
+知我者 3 n
+知新报 3 n
+知方 3 n
+知无不尽 3 i
+知无不言 23 i
+知无不谈 3 i
+知明 3 v
+知易 3 n
+知易行难 6 n
+知春路 3 n
+知春里 3 n
+知晓 585 v
+知晓率 11 n
+知更鸟 5 i
+知本 3 n
+知本家 4 n
+知本温泉 3 n
+知机 4 n
+知来藏往 3 i
+知根知底 28 i
+知止不殆 3 i
+知母 32 n
+知法 17 n
+知法犯法 3 l
+知照 3 v
+知疼 3 v
+知疼着热 2 i
+知疼着痒 3 i
+知疼知热 3 i
+知白守黑 3 l
+知礼 3 v
+知羞识廉 3 i
+知者 3 n
+知而故犯 3 i
+知耻 3 a
+知耻为勇 3 i
+知耻知病 3 i
+知耻而后勇 8 i
+知耻近乎 3 i
+知能 3 v
+知荣守辱 3 i
+知荣辱 3 n
+知行 3 v
+知行合一 3 l
+知觉 599 v
+知觉力 3 n
+知觉性 3 n
+知言 3 v
+知识 8254 v
+知识产业 3 n
+知识产权 716 n
+知识产权局 10 n
+知识出版社 6 nt
+知识分子 1946 n
+知识化 16 n
+知识型 33 n
+知识库 34 n
+知识性 51 n
+知识点 356 n
+知识界 90 n
+知识经济 58 n
+知识结构 3 n
+知识者 17 n
+知识讲座 3 n
+知识论 3 n
+知识青年 112 n
+知识面 61 n
+知趣 98 n
+知足 419 v
+知足不辱 3 i
+知足常乐 13 i
+知足知止 3 i
+知足者 3 n
+知足长乐 3 n
+知过 3 v
+知过必改 4 l
+知过能改 3 l
+知遇 27 v
+知遇之恩 57 l
+知道 42780 v
+知错 63 v
+知错不改 3 v
+知错就改 3 l
+知错必改 3 v
+知难而上 3 l
+知难而进 16 i
+知难而退 64 l
+知难行易 3 l
+知雄守雌 3 l
+知青 353 n
+知青点 10 n
+知音 371 n
+知音卡 3 n
+知音者 3 n
+知音西村 3 n
+知音难寻 3 i
+知音难求 3 l
+知音难觅 3 l
+矧 11 zg
+矩 188 ng
+矩尺 2 n
+矩形 234 n
+矩形框 3 n
+矩形波导 3 n
+矩形管 3 n
+矩形网格 3 n
+矩形脉冲 3 n
+矩步方行 3 n
+矩矱 3 n
+矩矱绳尺 3 n
+矩阵 257 n
+矩阵式 3 n
+矩阵收缩 3 n
+矩阵的元 3 n
+矩阵的迹 3 n
+矫 273 nr
+矫不群 3 i
+矫世励俗 3 nr
+矫世厉俗 3 i
+矫世变俗 3 i
+矫健 112 nr
+矫健敏捷 3 nr
+矫哲在 5 nr
+矫国更俗 3 i
+矫国革俗 3 n
+矫尾厉角 3 i
+矫形 27 n
+矫形力 3 i
+矫形医生 3 i
+矫形器 3 n
+矫形外科 3 i
+矫形术 3 n
+矫性 3 n
+矫情 48 a
+矫情干誉 3 i
+矫情自饰 3 nz
+矫情镇物 3 n
+矫情饰行 3 i
+矫情饰诈 3 i
+矫情饰貌 3 i
+矫捷 84 a
+矫揉造作 32 i
+矫时慢物 3 i
+矫枉 3 v
+矫枉过中 3 i
+矫枉过当 3 i
+矫枉过正 18 i
+矫枉过直 3 i
+矫正 175 nr
+矫正器 9 nr
+矫正术 3 nr
+矫正法 3 nr
+矫正视力 3 i
+矫治 36 v
+矫治器 3 nz
+矫直 2 v
+矫直机 3 i
+矫矫不群 3 nr
+矫矫英 4 nr
+矫若惊龙 3 i
+矫若游龙 3 nr
+矫言伪行 3 i
+矫诏 27 nr
+矫诏之 2 nr
+矫诏召 2 nr
+矫诏立 2 nr
+矫邪归正 3 i
+矫顽力 26 nr
+矫饰 18 v
+矬 19 n
+矬子 11 n
+短 6662 a
+短不了 7 v
+短中取长 3 i
+短中线 3 b
+短传 8 b
+短促 213 a
+短信 767 n
+短信内容 2 n
+短信回执 3 n
+短信息 3 b
+短信王 3 n
+短信网 3 n
+短信联盟 3 j
+短信通 3 nz
+短信铃声 3 n
+短元音 9 n
+短兵接战 3 nz
+短兵相接 47 i
+短内裤 3 n
+短出出 3 i
+短刀 238 n
+短刀直入 3 i
+短剑 341 n
+短剧 19 n
+短发 108 b
+短句 18 n
+短号 5 b
+短叹长吁 3 i
+短吃少穿 3 i
+短吻鳄 3 n
+短命 253 b
+短垣自逾 3 i
+短处 66 n
+短外套 2 n
+短大衣 6 n
+短寿 3 n
+短寿促命 3 i
+短小 233 b
+短小精干 3 z
+短小精悍 38 i
+短少 24 v
+短尾 3 n
+短尾猴 23 n
+短尾病毒 3 n
+短局 3 n
+短工 47 n
+短巴巴 3 z
+短平快 17 z
+短式 3 b
+短截线 3 n
+短手 3 b
+短手短脚 3 z
+短打 27 v
+短按 3 n
+短撅撅 3 z
+短收 3 v
+短效 16 b
+短文 156 n
+短斤少两 4 i
+短斤欠两 3 i
+短斤缺两 3 i
+短日照植物 7 n
+短时 49 b
+短时期 67 b
+短时记忆 3 n
+短时间 21 n
+短晨衣 3 nz
+短暂 675 a
+短暂性 3 vn
+短期 1556 b
+短期信贷 3 n
+短期内 3 n
+短期化 6 n
+短期培训 3 n
+短期投资 3 n
+短期聚落 3 n
+短期行为 3 n
+短期计划 3 n
+短期贷款 3 n
+短期预付 3 n
+短杆菌素 3 n
+短杆菌肽 3 n
+短板 3 n
+短枪 82 n
+短柄 51 n
+短棒 25 n
+短欠 3 n
+短款 3 b
+短歌 15 n
+短歌行 3 n
+短毛绒 3 n
+短气 3 n
+短池 12 n
+短沟效应 3 n
+短波 88 n
+短泳 3 n
+短泳选手 3 n
+短浅 41 a
+短消息 5 n
+短源距 3 n
+短片 69 n
+短片奖 3 nz
+短片类 3 b
+短电位 3 n
+短短 554 z
+短短几天 3 i
+短短的 436 z
+短矮 3 a
+短秤 3 n
+短程 154 b
+短空 3 n
+短笛 22 n
+短笺 3 n
+短简 11 n
+短篇 116 b
+短篇小说 399 n
+短粗 36 z
+短索 3 n
+短纤 5 n
+短纤维 3 n
+短线 341 b
+短线专业 3 b
+短线交易 3 n
+短线产品 3 n
+短绌 3 i
+短绒 2 n
+短统 3 n
+短统袜 3 n
+短统靴 3 nz
+短统鞋 3 n
+短绠汲深 3 nrfg
+短绳 3 n
+短缺 438 a
+短缺商品 3 n
+短缺经济 8 n
+短网 3 n
+短耳 3 n
+短肥 3 n
+短脚 3 z
+短腿 11 n
+短舱 10 n
+短衣 53 n
+短衣匹马 3 nz
+短衫 31 n
+短袖 48 b
+短袖衫 13 n
+短袜 7 n
+短装 16 b
+短裙 69 n
+短裤 118 n
+短裤装 3 n
+短褂 3 n
+短褐穿结 3 n
+短见 21 a
+短见薄识 3 i
+短视 21 b
+短视症 3 n
+短训 2 n
+短训班 8 n
+短讯 3 nz
+短讯息 3 n
+短论 7 n
+短评 17 v
+短评作者 3 n
+短诗 31 n
+短语 99 nz
+短跑 62 v
+短跑健将 3 n
+短跑选手 3 n
+短跑道 3 n
+短距 4 n
+短距离 65 n
+短路 69 n
+短路器 4 n
+短路线 3 n
+短路终端 3 i
+短途 86 b
+短途旅行 3 n
+短途游 5 n
+短途游览 3 n
+短途运输 3 i
+短重 3 b
+短针 3 b
+短锯 3 n
+短长 92 n
+短门 3 n
+短靴 3 n
+短音 5 n
+短音符 3 n
+短韵 3 n
+短须 3 n
+短骨 7 z
+矮 1310 a
+矮一截 3 v
+矮个 3 b
+矮个儿 3 n
+矮个子 27 n
+矮了一截 3 v
+矮人一截 3 n
+矮人一等 3 b
+矮人族 3 n
+矮人村 3 n
+矮人看场 3 v
+矮人看戏 3 v
+矮人祭 3 n
+矮人观场 3 n
+矮冬瓜 3 n
+矮凳 25 n
+矮刀豆 3 n
+矮化 27 n
+矮化栽培 3 vn
+矮化植物 3 n
+矮化砧 3 n
+矮半截 3 n
+矮地茶 3 n
+矮墙 152 n
+矮墩墩 3 z
+矮壮素 2 n
+矮子 327 n
+矮子乐 3 n
+矮子看戏 3 v
+矮子观场 3 n
+矮孟牛 3 n
+矮小 327 z
+矮屋 3 n
+矮得 3 v
+矮星 3 n
+矮杆 3 n
+矮林 16 n
+矮树 3 n
+矮树丛 3 n
+矮牵牛 3 vn
+矮短 3 z
+矮矮 3 a
+矮矮墩墩 3 z
+矮矮实实 3 z
+矮矮的 28 z
+矮矮肥肥 3 n
+矮矮胖胖 3 z
+矮秆 7 n
+矮秆作物 3 n
+矮篱 3 n
+矮老者 3 n
+矮胖 239 a
+矮脚 3 z
+矮雪轮 3 n
+石 11067 n
+石万嗔 3 i
+石万鹏 7 nr
+石三鸟 12 nr
+石上书 2 nr
+石丘 2 ns
+石东俊 3 nr
+石中含 2 nr
+石中玉 157 nr
+石为金 2 nr
+石之声 2 nr
+石之弓 2 nr
+石于兹 2 nr
+石云星 4 nr
+石井 3 n
+石井乡 2 nr
+石井四 2 nr
+石亨见 2 nr
+石亭江 4 nr
+石人 105 n
+石人俑 7 n
+石人沟 2 ns
+石人石 9 nr
+石介 9 n
+石仲泉 17 nr
+石似玉 2 nr
+石佛寺 15 nr
+石佛镇 2 nr
+石像 179 n
+石像鬼 3 n
+石元雅 2 nr
+石兄 3 n
+石兆琪 3 nr
+石光荣 3 nr
+石兰 2 ns
+石关 3 ns
+石关村 4 nr
+石兽 402 n
+石冈 2 ns
+石冢拜 2 nr
+石冰川 2 nr
+石决明 4 nr
+石凌鹤 2 nr
+石凳 73 n
+石函 5 n
+石刀 34 n
+石刁柏 3 n
+石制 54 n
+石制品 27 n
+石刻 417 n
+石刻像 3 n
+石刻群 3 n
+石前盟 2 nr
+石勇引 2 nr
+石勒 76 nr
+石勒喀河 4 ns
+石勒建国 4 ns
+石勒病 2 nr
+石勒石 2 nr
+石勒苏 13 ns
+石化 737 j
+石化作用 3 n
+石化工业 3 n
+石化总公司 2 nt
+石化气 3 n
+石化集团 54 nt
+石匠 201 n
+石匣 80 ns
+石匾 3 n
+石升华 2 nr
+石华堰 256 ns
+石南 6 ns
+石印 46 nr
+石原 4 ns
+石原慎太郎 7 nr
+石及茂 2 nr
+石友 3 n
+石友三 2 nr
+石双英 89 nr
+石叔诚 2 nr
+石台 57 n
+石台县 3 ns
+石叶 15 n
+石吊兰 3 nr
+石向 10 n
+石含草 6 nr
+石呆子 3 nr
+石嘴山 9 ns
+石嘴山区 3 ns
+石嘴山市 11 ns
+石器 624 n
+石器时代 3 t
+石四皓 2 i
+石围 2 n
+石圭 2 ns
+石圭平 4 nr
+石场 8 n
+石坊 25 n
+石坎 3 nr
+石坑 3 n
+石块 455 n
+石坛 3 n
+石坝 33 ns
+石坡 13 ns
+石垒 2 n
+石城 30 ns
+石城县 2 ns
+石城汤池 3 ns
+石城郡 2 nr
+石城镇 2 ns
+石基 9 nr
+石堆 86 n
+石堡 2 ns
+石堡城 4 nr
+石堤 10 n
+石堰 3 ns
+石塔 46 nr
+石塔寺 3 nr
+石塘 17 ns
+石墓 3 n
+石墓阵 3 n
+石墙 135 n
+石增至 2 nr
+石墨 516 n
+石墨制品 3 n
+石墨棒 3 nr
+石墨电极 3 n
+石墨粉 3 nr
+石壁 599 n
+石壕吏 3 nz
+石声汉 3 nr
+石大哥 7 nr
+石太铁路 3 nz
+石夫人 32 nr
+石头 1953 n
+石头块 4 n
+石头城 45 ns
+石头堆 5 n
+石头子儿 6 n
+石头寨 5 nr
+石头山 8 ns
+石头河 2 ns
+石头火锅 3 n
+石头皮山 3 ns
+石头砸 3 l
+石头缝 16 n
+石头记 3 n
+石头路 3 n
+石女 2 n
+石如意 2 nr
+石如泥 2 nr
+石子 501 n
+石子儿 12 nr
+石子路 13 nr
+石孔 2 n
+石孔里 2 nr
+石存 6 n
+石存山 174 nr
+石学海 14 nr
+石守信 12 nr
+石安 256 ns
+石宏图 2 nr
+石宗源 3 nr
+石定 2 n
+石宝寨 2 nr
+石宝良 2 nr
+石宝那 4 nr
+石室 231 n
+石室东 2 nr
+石室中 22 nr
+石室之 2 nr
+石室传 2 nr
+石室奇 2 nr
+石室密 2 nr
+石室或 2 nr
+石室里 2 nr
+石室金匮 3 i
+石室金鐀 3 nt
+石室铭 2 nr
+石室顶 12 nr
+石家 11 n
+石家庄 440 nr
+石家庄市 83 ns
+石家庄战役 5 nz
+石家庄铁道学院 3 nt
+石家庄陆军指挥学院 4 nt
+石家河 9 nr
+石寨山 6 ns
+石寿永 256 nr
+石将军 2 nr
+石小满 3 nr
+石小群 3 nr
+石小雨 2 nr
+石少华 2 nr
+石尤风 3 nr
+石屋 170 n
+石屋中 3 nr
+石屏 50 nr
+石屏县 3 ns
+石屑 35 n
+石山 109 ns
+石岗 2 nr
+石岛 35 ns
+石岛湾 2 ns
+石岩山 3 nr
+石岭 8 ns
+石岭关 9 ns
+石峡 5 ns
+石峰区 3 ns
+石峰堡 3 nr
+石崖 53 n
+石崖磷 2 nr
+石川 6 ns
+石川县 4 ns
+石川岛 3 ns
+石巢园 14 nr
+石工 8 n
+石工术 3 n
+石师弟 3 nr
+石帮主 106 n
+石幢 2 n
+石广 2 j
+石广元 2 nr
+石广布 2 nr
+石广生 258 nr
+石庄主 125 nr
+石床 25 n
+石库 2 n
+石库门 18 ns
+石庙 2 n
+石座 2 n
+石廪书 2 nr
+石异 2 n
+石式 2 n
+石弹 10 n
+石径 16 n
+石心木肠 3 n
+石志仁 2 nr
+石志坚 6 nr
+石志成 2 nr
+石忠信 2 nr
+石扬沙 3 nr
+石投大海 3 ns
+石担 3 n
+石拱 12 nr
+石拱桥 14 nr
+石敬塘 2 nr
+石敬瑭 62 nr
+石文义 3 nr
+石斌欣 4 nr
+石斑 7 n
+石斑鱼 29 n
+石料 209 n
+石料厂 3 n
+石料场 2 n
+石斛 22 nr
+石斧 33 nr
+石新荣 6 nr
+石方 11 n
+石日馨 4 nr
+石星 35 n
+石星光 3 nr
+石春来 3 nr
+石春生 2 nr
+石春祯 2 nr
+石晋 3 j
+石晓群 18 nr
+石景 3 n
+石景宜 6 nr
+石景山 41 nr
+石景山区 27 ns
+石景山游乐园 2 ns
+石景山路 2 ns
+石曼子 5 nr
+石木 7 n
+石机 3 n
+石材 97 n
+石材制品 3 n
+石材厂 3 n
+石材网 3 n
+石村湖 4 nr
+石杵舂 2 nr
+石松 37 nr
+石松粉 3 nr
+石板 482 n
+石板房 2 n
+石板材 3 n
+石板桥 4 nr
+石板沟 34 n
+石板笔 3 n
+石板路 3 n
+石板道 3 n
+石极 2 n
+石构 6 n
+石林 432 nr
+石林中 2 nr
+石枯松老 3 n
+石柜 3 n
+石柱 407 nr
+石柱县 2 nr
+石柱土家族自治县 3 ns
+石标 3 n
+石栏 147 n
+石栏杆 7 n
+石栏石料 3 n
+石栗 3 nr
+石核 6 n
+石桌尖 2 nr
+石桥 779 ns
+石桥铺 2 ns
+石桥镇 4 nr
+石桩 3 n
+石梁奔 4 nr
+石梁宽 2 nr
+石梁彼 4 nr
+石梁河水库 3 ns
+石梁派 21 nr
+石梁温 4 nr
+石梁石 2 nr
+石梁镇 2 nr
+石梓 8 n
+石梯 3 n
+石棉 283 n
+石棉制品 3 n
+石棉县 12 ns
+石棉布 3 nr
+石棉带 3 n
+石棉板 3 n
+石棉瓦 3 nr
+石棉管 3 n
+石棉网 3 n
+石棚 2 n
+石棚山 2 nr
+石棱棱 3 nr
+石棺 197 n
+石椁里 2 nr
+石椅 8 n
+石椒草 3 nr
+石楠 7 nr
+石楠叶 3 nr
+石楠藤 3 nr
+石楼 9 n
+石楼县 3 nr
+石榴 192 n
+石榴园 2 n
+石榴树 15 n
+石榴皮 3 n
+石榴石 270 n
+石榴花 19 n
+石榴裙 27 n
+石槽 31 n
+石槽里 3 nr
+石武为 2 nr
+石殿中 2 nr
+石氏星 6 nr
+石汉基 2 nr
+石沈大海 3 nz
+石沉大海 49 nr
+石沟 7 ns
+石没羽 7 nr
+石河 125 ns
+石河子 13 nr
+石河子大学 2 nt
+石河子市 13 ns
+石油 4930 n
+石油业 11 n
+石油价格 3 n
+石油制品 3 n
+石油勘探 3 n
+石油化学 3 nt
+石油化工 3 n
+石油危机 3 n
+石油商 3 n
+石油地理 3 n
+石油城 10 n
+石油大学 12 nt
+石油大臣 2 n
+石油学院 3 nt
+石油工业 3 n
+石油工业部 9 nt
+石油市场 3 n
+石油换 3 nr
+石油机械 3 n
+石油树脂 3 n
+石油气 39 n
+石油焦 7 n
+石油界 3 n
+石油管 3 n
+石油网 3 n
+石油荒 3 n
+石油设备 3 n
+石油资源 3 n
+石油输出 3 n
+石油输出国组织 15 nt
+石油部 11 nt
+石油部长 5 n
+石油部门 5 n
+石油酸类 3 n
+石油醚 9 n
+石沼 8 n
+石泉 9 nr
+石泉县 3 ns
+石泉西 3 ns
+石泐海枯 3 nr
+石泓寺 3 nr
+石洞 91 nr
+石洞口 5 nr
+石洞壁画 3 n
+石洞里 3 nr
+石津渠 2 nr
+石洲 2 ns
+石流 3 n
+石浦 7 ns
+石浦港 3 ns
+石海 23 ns
+石涛 32 nr
+石涛合 2 nr
+石清一 2 nr
+石清便 2 nr
+石清叹 7 nr
+石清奇 2 nr
+石清心 5 nr
+石清惊 2 nr
+石清掌 2 nr
+石清摇 2 nr
+石清笑 7 nr
+石清见 6 nr
+石清陪 2 nr
+石清露 4 nr
+石渠 12 nr
+石渠县 4 ns
+石渠宝 3 nr
+石渠阁 10 nr
+石渣 3 n
+石湖 521 ns
+石湖县 6 ns
+石湖居士 2 nr
+石湖戴 2 nr
+石湖来 2 nr
+石湖见 2 nr
+石湖里 10 ns
+石湾 17 ns
+石湾窑 3 ns
+石湾镇 4 ns
+石湾陶 2 nr
+石滚子 4 nr
+石滩 9 n
+石滩村 2 nr
+石漠化 3 n
+石漫滩 8 nr
+石瀑 2 n
+石瀑泉 2 ns
+石火光阴 3 nr
+石火电光 3 n
+石火般 4 i
+石火风灯 3 n
+石火风烛 3 n
+石灰 419 n
+石灰乳 3 n
+石灰华 3 nz
+石灰岩 393 n
+石灰水 69 n
+石灰浆 2 n
+石灰石 317 n
+石灰矿 3 n
+石灰窑 16 n
+石灰粉 6 n
+石灰质 35 n
+石炭 62 n
+石炭世 40 n
+石炭井区 3 n
+石炭系 21 n
+石炭纪 79 n
+石炭酸 4 n
+石炮 16 n
+石炼化 4 n
+石烂江枯 3 nr
+石烂海枯 3 nr
+石烈居 2 nr
+石烈执 4 nr
+石烟 6 n
+石煤 38 j
+石燕 4 nr
+石燕贝 3 nr
+石燕鸣 2 nr
+石片 59 n
+石片岩 2 nr
+石版 17 n
+石版术 3 n
+石版画 12 n
+石牌 19 n
+石牌国中 3 nt
+石牌国小 3 n
+石牌坊 3 n
+石牌岭 257 ns
+石牌西 3 n
+石牌路 3 n
+石牛 7 n
+石牛山 3 ns
+石牛溪 2 nr
+石牢中 2 nr
+石状 3 n
+石狮 565 nr
+石狮子 176 nr
+石狮市 20 ns
+石玉山 6 nr
+石玉昆 7 nr
+石玉珍 2 nr
+石珊瑚 4 nz
+石珍珠 2 nr
+石球 3 n
+石瑞先生 3 nr
+石生 3 n
+石田东四郎 9 nr
+石由海 2 nr
+石画 3 n
+石百合 3 nr
+石盐 19 n
+石盘 6 n
+石相击 4 nr
+石眼 2 n
+石矶 3 ns
+石矿 8 n
+石砂 8 n
+石砌 69 b
+石砖 3 n
+石破云 2 nr
+石破天 1124 nr
+石破天惊 66 i
+石破茂 7 nr
+石砾儿 3 n
+石础 11 n
+石碇 3 n
+石碇乡 3 vn
+石碑 601 n
+石碓 3 n
+石碣 45 nr
+石碣镇 3 ns
+石碳层 3 n
+石碳酸 3 n
+石碴 2 n
+石碾子 4 n
+石磙 22 n
+石磨 52 n
+石磨盘 9 n
+石磷磷 4 nr
+石礁 2 n
+石示 3 n
+石祗 4 n
+石神奴 2 nr
+石秀二 2 nr
+石秀便 12 nr
+石秀兄弟 2 nr
+石秀只 2 nr
+石秀听 2 nr
+石秀大 2 nr
+石秀守 2 nr
+石秀推 2 nr
+石秀看 2 nr
+石秀笑 5 nr
+石秀自 10 nr
+石秀见 6 nr
+石秀诗 5 nr
+石秀道 10 nr
+石秀都 2 nr
+石穴 3 n
+石窑 20 n
+石窟 649 n
+石窟寺 3 n
+石窟群 3 n
+石窟门 3 n
+石立界 3 n
+石竖木 2 nr
+石章鱼 3 nr
+石竹 26 nr
+石竹科 7 nr
+石竹花 2 nr
+石笋 44 n
+石笔 3 n
+石笼 3 n
+石筑 5 n
+石粉 8 n
+石精 2 n
+石纤 2 n
+石级 55 n
+石纪 3 n
+石纹 3 n
+石经 142 n
+石经寺 3 nr
+石继芳 2 nr
+石维坚 2 nr
+石维礼 4 nr
+石绵 3 nr
+石绵板 3 n
+石绵瓦 3 nr
+石绿 7 nr
+石缄金匮 3 i
+石缝 56 n
+石缸 6 n
+石羊 11 nr
+石羊河 17 nr
+石羊镇 2 nr
+石群 4 n
+石翠芝 9 nr
+石老人 3 nr
+石联星 3 nr
+石脉 3 n
+石脑油 13 n
+石膏 645 n
+石膏像 15 n
+石膏板 2 n
+石膏矿 267 n
+石膏粉 3 n
+石膏线 3 n
+石臼 52 ns
+石舫 7 nr
+石色 3 n
+石花 9 n
+石花洞 4 nr
+石花胶 3 n
+石花菜 16 n
+石花街 13 ns
+石苇 3 n
+石英 1519 nr
+石英岩 3 nr
+石英沙 3 nr
+石英玻璃 3 n
+石英石 3 nr
+石英砂 311 nr
+石英管 3 nr
+石英粉 3 nr
+石英表 3 nr
+石英钟 10 nr
+石茂良 2 nr
+石茎天 2 nr
+石药 13 n
+石药集团 7 nt
+石莲柱 2 nr
+石莲花 3 nr
+石菖蒲 3 n
+石蒜 11 n
+石蓓莘 2 nr
+石蕊 14 n
+石蕊试纸 10 n
+石虎 19 nr
+石虎养 2 nr
+石虎领 2 nr
+石蚕 3 n
+石蜡 87 n
+石蜡像 3 n
+石蜡油 3 n
+石蝇 2 n
+石螺 3 n
+石西 5 ns
+石见穿 3 i
+石角 4 n
+石设羽 2 nr
+石象 2 n
+石象生 259 nr
+石质 92 n
+石赤不夺 3 i
+石车 2 n
+石轮 3 n
+石达开 42 nr
+石远凯 4 nr
+石造 3 n
+石道 2 n
+石道尽 2 nr
+石邑县 2 ns
+石里克 10 nr
+石重贵 8 nr
+石钟乳 13 nr
+石钟健 2 nr
+石钟寺 2 nr
+石钟山 14 nr
+石钻子 3 nr
+石铁 9 n
+石铭鼎 4 nr
+石铲 18 n
+石锁 6 nr
+石锺乳 3 nr
+石镇 2 ns
+石镇鬼 3 nr
+石镜 4 n
+石镜古 6 nr
+石镜镇 3 nr
+石门 672 n
+石门乡 3 ns
+石门县 9 ns
+石门口 3 ns
+石门山 6 ns
+石门水库 3 n
+石门洞 2 nr
+石门镇 5 ns
+石门集 2 nr
+石阡 3 nrfg
+石阡县 3 ns
+石阵极 2 nr
+石阶 208 nr
+石阶道 3 n
+石雕 327 n
+石雕像 3 n
+石雷 3 nr
+石青 32 nr
+石静宜 256 nr
+石非石 2 nr
+石面化 2 n
+石顶 4 n
+石风科 2 nr
+石飞沙 6 nr
+石首 30746 n
+石首市 6148 ns
+石马 16 ns
+石马村 2 nr
+石鱼 4 n
+石鸡 10 n
+石鸣琴 2 nr
+石麦子 3 nr
+石黄涂 2 nr
+石鼓 52 n
+石鼓区 3 ns
+石鼓文 15 nr
+石鼓路 3 n
+石龙 273 nr
+石龙乡 3 ns
+石龙区 3 ns
+石龙坝 2 nr
+石龙子 10 nr
+石龙镇 4 nr
+石龟 16 n
+矴 2 zg
+矶 323 g
+矸 51 n
+矸石 35 n
+矻 2 zg
+矼 2 zg
+矽 29 nz
+矽利康 3 nz
+矽卡岩 10 nz
+矽土 3 n
+矽岩 3 nz
+矽晶体 3 n
+矽晶片 3 nz
+矽电晶体 3 nz
+矽石 3 nz
+矽矿 3 nz
+矽砂 3 n
+矽线石 7 n
+矽肺 12 n
+矽肺病 2 n
+矽藻 3 n
+矽谷 3 n
+矽质 3 n
+矽酸 3 nz
+矽酸钠 3 nz
+矽钢 4 nz
+矽钢片 3 nz
+矾 373 ns
+矾土 3 n
+矾石 3 n
+矿 2295 n
+矿业 372 n
+矿业城市 3 n
+矿业大学 3 n
+矿业权 5 n
+矿业法 3 n
+矿业界 3 n
+矿业经济 3 n
+矿业聚落 3 n
+矿业集团 3 n
+矿主 27 n
+矿井 234 n
+矿井口 3 n
+矿产 4364 n
+矿产区 3 n
+矿产品 90 n
+矿产地 278 n
+矿产资源 3 n
+矿体 161 n
+矿体厚度 3 n
+矿内 3 n
+矿冶 612 j
+矿务 32 n
+矿务局 102 n
+矿化 57 n
+矿化度 120 n
+矿区 372 n
+矿厂 3 n
+矿场 27 n
+矿坑 22 n
+矿城 3 n
+矿容 2 n
+矿尘 3 n
+矿局 3 n
+矿层 23 n
+矿山 1250 n
+矿山企业 3 n
+矿山压力 3 n
+矿山机械 3 n
+矿山设备 3 n
+矿工 234 n
+矿床 883 n
+矿房 3 n
+矿柱 11 n
+矿样 3 n
+矿棉 3 n
+矿油 3 n
+矿泉 53 n
+矿泉壶 3 n
+矿泉水 130 n
+矿泉水瓶 12 n
+矿泥 8 n
+矿洞 3 n
+矿浆 3 n
+矿渣 27 n
+矿源 3 n
+矿灯 33 n
+矿点 18 n
+矿热炉 3 n
+矿物 1368 n
+矿物学 63 n
+矿物学家 3 n
+矿物局 3 n
+矿物油 7 n
+矿物泥 3 n
+矿物界 3 n
+矿物纤维 5 n
+矿物质 292 n
+矿物质饲 3 n
+矿用 7 n
+矿用车 3 n
+矿盐 8 n
+矿石 533 n
+矿石场 3 n
+矿砂 20 n
+矿种 51 n
+矿管办 3 j
+矿粉厂 3 n
+矿脂 3 n
+矿脉 49 n
+矿苗 3 n
+矿藏 596 n
+矿藏分布 3 n
+矿藏量 3 n
+矿警 3 n
+矿质 3 n
+矿质氮 3 n
+矿质肥料 3 n
+矿车 8 n
+矿长 32 n
+砀 30 ns
+砀山 47 ns
+砀山县 16 ns
+码 1535 n
+码位 3 n
+码元 2 n
+码元表 3 n
+码元集 3 n
+码分多址 5 n
+码卡子 3 n
+码器 2 n
+码型 5 n
+码垛 3 n
+码头 2508 n
+码头区 11 n
+码头工 3 n
+码头工人 3 n
+码头费 3 n
+码头镇 3 n
+码子 17 n
+码字 11 n
+码容量 3 n
+码尺 3 n
+码式 3 n
+码放 35 v
+码数 3 n
+码本 2 n
+码洋 8 n
+码率 3 n
+码表 3 n
+码长 3 n
+砂 966 n
+砂仁 19 n
+砂光机 2 n
+砂器 3 n
+砂囊 3 n
+砂土 563 n
+砂坑 3 n
+砂块儿 3 n
+砂型 6 n
+砂壶 3 n
+砂姜 3 n
+砂子 23 n
+砂层 3 n
+砂岩 277 n
+砂布 4 n
+砂带 4 n
+砂心 3 n
+砂枪 3 n
+砂样 3 n
+砂桥卡钻 3 nz
+砂洗厂 3 n
+砂浆 18 n
+砂滤器 3 n
+砂滤装置 3 n
+砂烬 3 n
+砂田 15 n
+砂皮 3 n
+砂盘 3 n
+砂眼 2 n
+砂石 83 n
+砂石路 3 n
+砂石车 3 n
+砂矿 66 n
+砂砾 73 n
+砂磨 3 n
+砂磨机 3 n
+砂礁 3 n
+砂礓 4 n
+砂箱 3 n
+砂米束薪 3 n
+砂粒 26 n
+砂糖 54 n
+砂纸 7 n
+砂纸条 3 n
+砂纸片 3 n
+砂质 3 n
+砂轮 41 n
+砂轮厂 3 n
+砂轮机 3 n
+砂里淘金 3 n
+砂金 35 n
+砂金石 3 n
+砂铁 3 n
+砂锅 52 n
+砂锅菜 3 n
+砂锅赛 3 n
+砂锅问 3 n
+砅 5 zg
+砆 92 zg
+砇 69 zg
+砉 38 o
+砊 13 zg
+砋 8 zg
+砌 1552 zg
+砌体 8 n
+砌块 4 n
+砌块机 3 n
+砌墙 57 n
+砌成 3 v
+砌末 16 n
+砌炕 3 n
+砌石 14 n
+砌砖 12 n
+砌筑 46 n
+砌红堆绿 3 z
+砌缝 3 n
+砌词捏控 3 vn
+砌路 3 n
+砍 3318 v
+砍上去 3 v
+砍上来 3 v
+砍下去 3 v
+砍下来 3 v
+砍价 18 v
+砍伐 154 v
+砍伐森林 3 i
+砍伤 47 v
+砍倒 3 v
+砍光 3 n
+砍出 3 v
+砍出去 3 v
+砍出来 3 v
+砍凿 3 v
+砍刀 56 n
+砍到 3 v
+砍削 14 v
+砍坏 3 v
+砍头 86 v
+砍头疮 3 n
+砍头痈 3 i
+砍成 3 v
+砍手 3 v
+砍手砍脚 3 i
+砍掉 136 v
+砍断 3 v
+砍杀 3 v
+砍来砍去 3 i
+砍柴 89 n
+砍树 3 n
+砍死 3 v
+砍瓜切菜 9 n
+砍砍 3 v
+砍破 3 v
+砍翻 3 v
+砍走 3 v
+砍起 3 v
+砍起来 3 v
+砍过去 3 v
+砍过来 3 v
+砍进 3 v
+砍进去 3 v
+砍进来 3 v
+砍铁如泥 3 i
+砍错 3 v
+砍除 3 v
+砑 42 g
+砒 24 zg
+砒石 3 n
+砒酸 3 n
+砒霜 111 n
+研 668 vn
+研习 217 vn
+研习会 3 n
+研习班 3 n
+研习营 3 n
+研京练都 3 n
+研修 44 vn
+研修班 14 n
+研修生 3 n
+研修费 3 n
+研判 21 vn
+研判出 3 n
+研制 5567 vn
+研制中心 3 n
+研制开发 3 nz
+研制成功 3 n
+研制组 2 vn
+研制者 7 n
+研发 1976 j
+研发部 21 n
+研发部门 3 n
+研商对策 3 n
+研定 3 vn
+研成 3 v
+研招办 3 v
+研拟 10 vn
+研机综微 3 nz
+研杵 3 n
+研析 3 vn
+研查 3 vn
+研桑心计 3 n
+研求 3 n
+研深覃精 3 vn
+研碎 3 v
+研磨 98 vn
+研磨剂 3 n
+研磨成粉 3 nz
+研磨机 3 n
+研磨用 3 n
+研究 35029 vn
+研究会 410 n
+研究员 1111 n
+研究员级 3 n
+研究商量 3 n
+研究型 66 n
+研究室 308 n
+研究家 27 n
+研究局 8 n
+研究性 19 n
+研究成果 3 n
+研究所 3162 n
+研究所里 15 n
+研究案情 3 n
+研究法 45 n
+研究班 21 n
+研究生 1816 n
+研究生班 26 n
+研究生部 17 n
+研究生院 135 n
+研究社 6 n
+研究科 9 n
+研究组 40 n
+研究者 187 n
+研究课题 3 n
+研究费 3 n
+研究进展 3 n
+研究部 77 n
+研究部署 3 n
+研究院 881 n
+研究院所 6 j
+研究馆员 4 n
+研精殚力 3 vn
+研精殚思 3 vn
+研精毕智 3 n
+研精究微 3 b
+研精竭虑 3 n
+研精致思 3 n
+研精苦思 3 n
+研精覃奥 3 nz
+研精覃思 3 vn
+研精钩深 3 n
+研精阐微 3 z
+研经铸史 3 n
+研考会 3 j
+研订 3 v
+研讨 588 vn
+研讨会 678 n
+研讨班 270 n
+研评 3 vn
+研读 104 v
+研钵 7 n
+砕 8 zg
+砖 1975 n
+砖匠 3 n
+砖厂 37 n
+砖场 146 n
+砖块 74 n
+砖坯 16 n
+砖塔 29 n
+砖墙 120 n
+砖壁 8 n
+砖头 390 n
+砖头文 3 n
+砖室墓 13 n
+砖房 11 n
+砖木 17 n
+砖木结构 3 n
+砖模 3 n
+砖混 131 n
+砖片 3 n
+砖瓦 262 n
+砖瓦厂 29 n
+砖瓦房 9 n
+砖瓦窑 10 nz
+砖石 254 n
+砖石工 3 n
+砖窑 83 n
+砖窖 3 n
+砖红壤 49 n
+砖茶 23 n
+砖造 3 n
+砖雕 37 n
+砖面 3 n
+砗 42 n
+砗磲 33 n
+砘 30 v
+砙 52 zg
+砚 315 ng
+砚兄 3 n
+砚友 3 n
+砚台 58 n
+砚堂 2 n
+砚山 3 n
+砚山县 3 n
+砚席 3 n
+砚弟 3 n
+砚池 4 n
+砚田 5 n
+砚石 3 n
+砜 42 g
+砝 28 n
+砝码 121 n
+砟 13 zg
+砟子 3 n
+砣 50 v
+砣子 3 n
+砥 427 ng
+砥兵砺伍 3 v
+砥厉名号 3 i
+砥厉廉隅 3 i
+砥廉峻隅 3 i
+砥志研思 3 vn
+砥柱 13 vn
+砥柱中流 3 i
+砥石 3 v
+砥砺 19 v
+砥砺名号 3 nr
+砥砺名节 3 t
+砥砺廉隅 3 nrt
+砥砺琢磨 3 v
+砥砺风节 3 v
+砥节 3 vn
+砥节励行 3 vn
+砥节厉行 3 i
+砥节奉公 3 i
+砥节砺行 3 vn
+砥行磨名 3 i
+砥行立名 3 i
+砥身砺行 3 vn
+砦 52 g
+砧 66 n
+砧墩 3 n
+砧子 15 n
+砧木 38 n
+砧杵 3 n
+砧板 30 n
+砧骨 3 n
+砩 56 g
+砪 3 zg
+砫 43 zg
+砬 11 n
+砬子 10 n
+砭 47 zg
+砭庸针俗 3 n
+砭灸 3 n
+砭灸术 3 n
+砭石 14 n
+砭骨 3 n
+砮 3 zg
+砰 1250 o
+砰然 3 nr
+砰砰 9 nr
+砲 10 zg
+砲凤烹龙 3 l
+砲龙烹凤 3 i
+破 9250 v
+破五 15 n
+破亡 3 v
+破产 994 v
+破产倒闭 3 n
+破产案 18 n
+破产法 23 n
+破产者 3 n
+破产荡业 3 l
+破伤风 67 i
+破体字 3 l
+破例 157 n
+破关 3 v
+破关斩将 3 i
+破军杀将 2 i
+破冠器 3 n
+破冰 57 v
+破冰船 51 n
+破减 3 v
+破击 16 v
+破击战 9 n
+破勺 3 n
+破卵倾巢 3 n
+破口 67 n
+破口大骂 247 i
+破啼 3 z
+破啼为笑 3 l
+破四 3 t
+破国亡家 3 l
+破土 41 v
+破土典礼 3 i
+破土动工 297 l
+破土而出 18 i
+破坏 4991 v
+破坏分子 3 n
+破坏力 50 n
+破坏型 2 n
+破坏性 202 n
+破坏活动 3 l
+破坏神 3 n
+破坏者 20 n
+破坚摧刚 3 i
+破壁 17 n
+破壁飞去 3 i
+破壳 20 n
+破处 4 v
+破天一剑 3 i
+破天荒 91 i
+破头烂额 3 i
+破奸发伏 3 i
+破家 3 n
+破家丧产 3 l
+破家为国 3 i
+破家亡国 3 n
+破家县令 3 n
+破家竭产 3 i
+破家荡业 3 i
+破家荡产 2 l
+破家败产 3 l
+破密 3 v
+破屋 3 n
+破崖绝角 3 i
+破巢余卵 3 i
+破巢完卵 3 i
+破布 3 v
+破帽 3 v
+破庙 3 n
+破开 3 v
+破得 3 v
+破愁为笑 3 i
+破成 3 v
+破戒 19 v
+破折 3 v
+破折号 9 n
+破损 234 v
+破损处 5 v
+破损稳性 3 n
+破斥 3 v
+破斧缺斨 3 n
+破旧 497 z
+破旧不堪 3 l
+破旧地 3 l
+破旧立新 2 i
+破晓 43 v
+破晓时分 3 l
+破柱求奸 3 i
+破格 145 n
+破格录取 3 v
+破格录用 3 n
+破格提拔 3 n
+破格晋升 3 l
+破案 50 v
+破案率 3 n
+破桐之叶 3 n
+破死忘生 3 i
+破泡剂 3 n
+破洞 3 n
+破浪 35 v
+破浪乘风 3 i
+破浪前进 7 i
+破浪神 3 i
+破涕 3 v
+破涕为笑 76 i
+破涕成笑 3 i
+破溃 3 v
+破漏 3 v
+破灭 381 v
+破烂 299 v
+破烂不堪 47 i
+破烂儿 2 l
+破烂王 4 i
+破烂货 3 i
+破片 84 n
+破牙细胞 3 n
+破琴绝弦 3 i
+破璧毁珪 3 i
+破瓜 3 n
+破瓜之年 3 i
+破瓦寒窑 3 n
+破瓦颓垣 3 i
+破甑不顾 3 v
+破甲弹 62 n
+破百 3 l
+破皮 3 n
+破矩为圆 3 i
+破破烂烂 70 z
+破碎 402 v
+破碎机 15 i
+破碎率 3 n
+破碗 30 n
+破禁 3 v
+破私立公 3 i
+破空 74 v
+破窑 26 n
+破竹 3 n
+破竹之势 7 i
+破竹建瓴 3 i
+破约 3 v
+破纪录 3 v
+破绽 281 n
+破绽百出 19 i
+破罐 3 n
+破罐子破摔 26 l
+破罐破摔 5 l
+破者 2 n
+破肝糜胃 3 v
+破胆 3 v
+破胆寒心 3 i
+破脑刳心 3 z
+破脸 20 v
+破船 30 v
+破获 102 v
+破获案件 3 n
+破落 64 v
+破落户 29 i
+破蛋 3 v
+破衣烂衫 3 n
+破衲疏羹 3 n
+破袭 49 v
+破袭战 36 i
+破裂 680 v
+破裂声 3 n
+破裂音 3 n
+破觚为圜 3 nr
+破觚斫雕 3 nr
+破解 334 v
+破解器 3 n
+破解版 3 n
+破解补丁 3 i
+破记录 4 n
+破译 664 v
+破读 3 v
+破财 12 v
+破财消灾 3 i
+破败 387 v
+破费 62 v
+破路战 3 l
+破身 3 v
+破车 3 v
+破釜沈舟 3 v
+破釜沉舟 59 i
+破釜沉舟式 2 i
+破釜焚舟 3 v
+破钞 3 n
+破铜烂铁 17 i
+破镜 4 n
+破镜分钗 3 i
+破镜重合 3 i
+破镜重圆 18 i
+破镜难圆 3 i
+破门 247 v
+破门而入 8 i
+破门而出 6 i
+破防 3 v
+破阵 3 v
+破阵子 3 l
+破陋 3 a
+破除 172 v
+破除迷信 42 i
+破隙 3 n
+破面 3 n
+破鞋 77 n
+破音字 3 n
+破题 36 n
+破题儿第一遭 6 i
+破颜一笑 3 i
+破颜微笑 2 i
+砵 2 zg
+砷 236 n
+砷中毒 3 l
+砷化氢 3 n
+砷化物 4 n
+砷化镓 49 n
+砷酸盐 2 n
+砷黄铁矿 2 n
+砸 2292 v
+砸伤 13 v
+砸出 3 v
+砸嘴 3 v
+砸坏 3 v
+砸开 43 v
+砸掉 3 v
+砸摸 3 v
+砸死 3 v
+砸毁 6 v
+砸烂 86 v
+砸牌子 3 v
+砸破 3 v
+砸破饭碗 3 v
+砸碎 57 v
+砸脚 3 v
+砸车 3 v
+砸过去 3 i
+砸过来 3 v
+砸锅 14 v
+砸锅卖铁 9 i
+砸门 3 v
+砸饭碗 2 v
+砹 55 g
+砺 115 zg
+砺山带河 3 n
+砺岳盟河 3 vn
+砺带河山 3 n
+砺戈秣马 3 vn
+砺石 3 n
+砻 102 v
+砻市 2 ns
+砻糠 3 nz
+砻谷 5 nz
+砼 8 n
+砼薄壁 3 v
+砽 96 zg
+砾 119 n
+砾土 3 n
+砾岩 114 n
+砾漠 3 n
+砾石 143 n
+砾石路 3 n
+砾金流石 3 n
+础 307 ng
+础泣而雨 3 n
+础润知雨 3 n
+础润而雨 3 n
+础石 3 n
+硁 9 zg
+硁硁之愚 3 nr
+硃 18 zg
+硃批 3 vn
+硃砂 3 v
+硃砂痣 3 n
+硃砂红 3 nz
+硃笔 3 v
+硅 1024 nz
+硅化木 3 nz
+硅化物 3 n
+硅单晶 29 n
+硅圆片 2 n
+硅尾 3 n
+硅微粉 3 nz
+硅整流器 3 n
+硅栅 3 n
+硅树脂 3 n
+硅橡胶 25 n
+硅氧烷 6 nz
+硅油 15 n
+硅溶胶 3 n
+硅灰石 276 n
+硅烷 20 nz
+硅片 29 n
+硅石 46 n
+硅砖 6 nz
+硅硅 3 nz
+硅碳棒 3 nz
+硅编译器 3 n
+硅肺 25 n
+硅胶 20 n
+硅胶套 3 nz
+硅胶管 3 nz
+硅胶胸罩 3 n
+硅藻 59 n
+硅藻土 38 n
+硅藻多糖 3 n
+硅藻门 3 n
+硅谷 336 n
+硅谷动力 3 nz
+硅质 76 n
+硅酮 2 nz
+硅酸 13 nz
+硅酸根 5 nz
+硅酸盐 190 nz
+硅酸钙 3 nz
+硅酸钠 21 nz
+硅酸铝 2 nz
+硅钙 2 nz
+硅钢 9 n
+硅钢片 16 nz
+硅铁 6 n
+硅铁合金 3 nz
+硇 30 ns
+硇洲 6 ns
+硇砂 4 n
+硋 3 zg
+硌 170 v
+硎 139 g
+硐 96 g
+硒 166 n
+硒整流器 3 n
+硒片 3 n
+硒矿 3 n
+硒鼓 3 n
+硔 3 zg
+硕 434 zg
+硕健 3 a
+硕儒 6 n
+硕士 1346 n
+硕士学位 3 n
+硕士文凭 3 n
+硕士点 31 n
+硕士班 5 n
+硕士生 119 n
+硕士论文 3 n
+硕壮 3 a
+硕大 149 a
+硕大无朋 9 i
+硕大无比 15 i
+硕学耆老 3 vn
+硕学鸿儒 3 i
+硕彦 3 n
+硕望 3 n
+硕望宿德 3 i
+硕果 47 n
+硕果仅存 13 l
+硕果累累 26 l
+硕泰克 3 n
+硕老 3 a
+硕言 3 n
+硕鼠 16 n
+硖 47 g
+硖石 3 ns
+硗 52 x
+硙 26 zg
+硚 6 zg
+硚口区 256 v
+硝 187 n
+硝云弹雨 3 l
+硝化 50 n
+硝化作用 3 l
+硝化棉 8 n
+硝化甘油 29 nz
+硝化细菌 4 l
+硝唑 3 nz
+硝基 70 n
+硝基漆 3 nz
+硝基苯 81 nz
+硝烟 382 n
+硝烟味 3 l
+硝烟弥漫 53 l
+硝烟弹雨 3 n
+硝烟滚滚 5 l
+硝盐 3 n
+硝石 62 n
+硝碱 3 n
+硝磺 3 n
+硝苯地平 3 nz
+硝酮 3 nz
+硝酸 284 n
+硝酸氨 3 n
+硝酸汞 3 nz
+硝酸甘油 28 nz
+硝酸盐 68 nz
+硝酸钙 3 nz
+硝酸钠 40 nz
+硝酸钡 2 nz
+硝酸钾 9 nz
+硝酸铁 3 n
+硝酸铅 3 nz
+硝酸铜 3 n
+硝酸铯 3 n
+硝酸铵 22 nz
+硝酸银 58 nz
+硝酸锂 3 nz
+硝酸锰 3 nz
+硝酸锶 2 nz
+硝铵 3 n
+硝锵水 3 vn
+硝镪水 3 v
+硞 2 zg
+硠 4 zg
+硥 172 zg
+硦 47 zg
+硧 2 zg
+硩 22 zg
+硪 124 g
+硫 731 n
+硫代硫酸钠 12 nz
+硫代磷酸 3 nz
+硫代酸酯 3 nz
+硫分 3 n
+硫化 138 n
+硫化亚砷 3 n
+硫化亚铁 7 nz
+硫化剂 6 nz
+硫化机 3 n
+硫化染料 3 n
+硫化橡胶 6 n
+硫化氢 91 n
+硫化汞 17 nz
+硫化物 137 n
+硫化碳 3 nz
+硫化钠 13 nz
+硫化钡 3 nz
+硫化铁 3 n
+硫化铅 3 nz
+硫化铜 3 n
+硫化银 3 nz
+硫化锌 10 nz
+硫化锑 3 nz
+硫化镉 8 nz
+硫化黑 3 nz
+硫华 3 nz
+硫叶立德 3 n
+硫含量 6 n
+硫唑嘌呤 4 nz
+硫基 5 n
+硫堇 3 n
+硫容量 3 n
+硫尿嘧啶 3 n
+硫属元素 3 n
+硫氢基 3 nz
+硫氧嘧啶 4 n
+硫氮 3 nz
+硫氰酸 2 nz
+硫氰酸酶 3 nz
+硫特琴 3 nz
+硫矿 3 n
+硫磺 170 n
+硫磺味 3 n
+硫磺岛 3 n
+硫磺泉 2 nz
+硫磺粉 3 n
+硫粉 3 n
+硫糖铝 2 nz
+硫素 3 n
+硫胺素 11 n
+硫脂 3 n
+硫脲 4 n
+硫藤黄素 3 n
+硫解酶 3 n
+硫辛 3 n
+硫辛酸 3 nz
+硫酯酶 3 nz
+硫酸 460 n
+硫酸亚铁 31 nz
+硫酸厂 8 n
+硫酸根 10 nz
+硫酸氢盐 3 nz
+硫酸氨 3 n
+硫酸汞 3 nz
+硫酸液 3 n
+硫酸盐 86 nz
+硫酸纸 3 nz
+硫酸酯酶 3 nz
+硫酸钙 14 nz
+硫酸钠 14 nz
+硫酸钡 15 nz
+硫酸钾 10 nz
+硫酸铁 3 n
+硫酸铅 6 nz
+硫酸铜 58 n
+硫酸铝 11 nz
+硫酸铝钾 17 nz
+硫酸铝铵 8 nz
+硫酸铯 3 n
+硫酸铵 16 nz
+硫酸银 3 nz
+硫酸锂 3 nz
+硫酸锌 3 nz
+硫酸锰 3 nz
+硫酸镁 32 nz
+硫酸镍 3 n
+硫醇 17 n
+硫醚 7 n
+硫铁 19 n
+硫铁矿 3 nz
+硫黄 87 n
+硫黄岛 24 n
+硫黄硫化 3 nz
+硬 5193 a
+硬了起来 3 l
+硬仗 52 n
+硬件 824 n
+硬件加速 3 n
+硬件安全 3 l
+硬件平台 8 l
+硬件报价 3 n
+硬件检验 3 n
+硬件行情 3 n
+硬件资源 4 l
+硬件资讯 3 n
+硬任务 3 n
+硬伤 3 n
+硬伸 3 v
+硬体 3 n
+硬停机 3 n
+硬充 3 v
+硬冲 3 n
+硬副本 3 l
+硬功 30 a
+硬功夫 12 n
+硬包装 3 n
+硬化 229 n
+硬化剂 10 n
+硬化性 3 n
+硬化症 14 n
+硬卡 3 n
+硬卧 24 v
+硬取 3 v
+硬变 3 v
+硬口盖 3 n
+硬叶林 3 n
+硬回车 3 l
+硬地 29 n
+硬块 3 n
+硬壳 68 n
+硬套 5 n
+硬实 10 d
+硬密封 3 n
+硬山 3 n
+硬币 185 n
+硬席 3 n
+硬帮帮 3 n
+硬干 14 n
+硬底化 3 n
+硬度 451 n
+硬度计 2 n
+硬座 30 n
+硬座票 2 n
+硬式 10 n
+硬式磁碟 3 n
+硬弓 47 nz
+硬性 117 n
+硬性摊派 3 n
+硬性规定 3 l
+硬战 3 nz
+硬手 21 n
+硬打 3 v
+硬把子 3 l
+硬抗 3 v
+硬抠 3 l
+硬抢 3 v
+硬拖 3 l
+硬拷贝 7 v
+硬拼 55 v
+硬指标 11 n
+硬挣 3 v
+硬挨 3 a
+硬挺 51 z
+硬接 3 v
+硬推 3 v
+硬搭 3 z
+硬撅撅 3 z
+硬撑 60 v
+硬撑下去 3 n
+硬撑下来 3 n
+硬是 454 d
+硬朗 104 a
+硬朗结实 3 z
+硬木 81 n
+硬板 7 n
+硬核 3 n
+硬梆梆 12 z
+硬棒 3 n
+硬模 3 n
+硬橡皮 3 n
+硬气 45 n
+硬气功 3 l
+硬水 30 n
+硬汉 61 n
+硬汉子 25 l
+硬沥青 3 z
+硬派 3 n
+硬煤 3 n
+硬物 36 n
+硬玉 21 n
+硬环境 10 l
+硬生生 92 n
+硬皮 9 n
+硬皮病 7 n
+硬盘 354 n
+硬盘共享 3 l
+硬盘分区 3 n
+硬盘坏道 3 n
+硬盘容量 3 n
+硬盘式 3 n
+硬盘数据 3 n
+硬盘机 3 n
+硬盘版 3 n
+硬盘盒 3 n
+硬盘空间 3 n
+硬盘还原 3 n
+硬盘驱动器 9 n
+硬着头皮 242 l
+硬着陆 14 l
+硬石膏 14 n
+硬硬 3 a
+硬碟 3 n
+硬碟内 3 n
+硬碟机 3 n
+硬碰硬 72 v
+硬磁材料 3 n
+硬磁盘 7 n
+硬科学 3 l
+硬笔 4 n
+硬笔书法 3 n
+硬粒玉米 3 n
+硬糖 2 n
+硬纸 3 n
+硬纸板 7 n
+硬结 32 v
+硬羽 3 n
+硬翻领 3 l
+硬脂 3 n
+硬脂酸 33 n
+硬腭 7 n
+硬膏 2 n
+硬膜外 3 n
+硬节 3 n
+硬花甘蓝 3 l
+硬茧 3 n
+硬衬 3 n
+硬设备 3 n
+硬语盘空 3 n
+硬说是 3 l
+硬货 4 n
+硬质 57 n
+硬质合金 32 n
+硬质小麦 3 n
+硬通货 15 n
+硬逼 3 v
+硬道理 3 n
+硬邦邦 49 nt
+硬邦邦的 3 z
+硬铝 3 n
+硬错误 3 n
+硬闯 3 v
+硬面 19 n
+硬顶 3 n
+硬驱 3 n
+硬骨 3 n
+硬骨头 69 n
+硬骨头六连 4 l
+硬骨板 3 n
+硬骨鱼 103 n
+硬骨鱼类 3 n
+硭 15 x
+确 3623 d
+确乎 21 v
+确乎不拔 3 l
+确保 1965 v
+确保全 3 l
+确保安全 3 ns
+确保您 3 l
+确保操作 3 l
+确保重点 3 n
+确信 316 v
+确信无疑 3 l
+确凿 119 v
+确凿不移 3 l
+确凿无疑 3 l
+确凿证据 3 l
+确切 785 ad
+确切不变 3 l
+确切不移 3 l
+确切性 3 n
+确切的说 3 l
+确因 3 n
+确固不拔 3 v
+确守 3 v
+确守信义 3 n
+确守合同 3 l
+确定 6779 v
+确定型图灵机 2 l
+确定性 77 n
+确定无疑 24 l
+确实 5767 ad
+确实可靠 3 n
+确实性 3 n
+确属 3 v
+确山 18 ns
+确山县 7 ns
+确应 3 v
+确当 3 v
+确无 3 v
+确有 538 v
+确有其事 3 l
+确有其人 3 l
+确有此事 3 l
+确权 3 v
+确然 3 ad
+确然不群 3 l
+确知 3 v
+确确实实 92 ad
+确立 2450 v
+确系 3 v
+确认 1568 v
+确认书 19 v
+确认信 3 v
+确认函 2 v
+确认码 3 l
+确论 3 v
+确证 39 v
+确诊 322 v
+确需 3 v
+确非 3 v
+确非易事 3 l
+硶 98 zg
+硷 141 zg
+硷土金属 3 vn
+硷性反应 3 v
+硷性平炉 3 v
+硷性氧化 3 nz
+硷石灰 3 v
+硷纤维素 3 v
+硷金属 3 vn
+硸 7 zg
+硻 5 zg
+硼 263 n
+硼化物 6 n
+硼氢化 3 nz
+硼氢化钠 3 nz
+硼玻璃 3 n
+硼砂 37 n
+硼肥 3 n
+硼酸 46 n
+硼酸盐 11 nz
+硼钢 6 n
+硼铁 3 n
+硼镁石 2 n
+硾 6 zg
+硿 3 zg
+碁 89 zg
+碂 9 zg
+碇 54 g
+碇元渡 3 vn
+碇泊费 3 vn
+碇真治 3 vn
+碉 133 n
+碉堡 158 n
+碉楼 38 n
+碉群 3 n
+碌 307 n
+碌曲 4 n
+碌曲县 2 ns
+碌碌 3 i
+碌碌寡合 3 i
+碌碌庸才 3 i
+碌碌无为 17 i
+碌碌无奇 3 i
+碌碌无能 6 i
+碌碌无闻 3 i
+碌碡 32 n
+碍 518 v
+碍事 186 v
+碍于 72 v
+碍于情面 6 i
+碍于面子 3 l
+碍口 3 a
+碍口识羞 3 v
+碍手 3 v
+碍手碍脚 60 i
+碍滞 3 a
+碍目 3 a
+碍眼 15 a
+碍脚 3 v
+碍足碍手 3 i
+碍难 10 a
+碍难从命 3 i
+碍难照准 3 i
+碍面子 3 l
+碎 2164 a
+碎了心 3 i
+碎冰 17 n
+碎冰机 3 n
+碎务 3 n
+碎叶 31 n
+碎嘴子 3 n
+碎块 51 n
+碎小 3 n
+碎尸万段 59 i
+碎尸案 3 n
+碎屑 231 n
+碎屑岩 102 n
+碎工 3 n
+碎布 3 v
+碎布条 3 n
+碎影 6 n
+碎心裂胆 3 i
+碎成 3 v
+碎料 3 n
+碎末 16 n
+碎步 39 n
+碎污机 3 n
+碎波 3 n
+碎烂 3 n
+碎煤 3 n
+碎片 397 n
+碎玉 3 n
+碎玉零玑 3 i
+碎玻璃 3 n
+碎琼乱玉 3 i
+碎瓦颓垣 3 i
+碎皮 3 n
+碎石 167 n
+碎石块 5 n
+碎石子 3 n
+碎石机 3 n
+碎石路 3 n
+碎砖 18 n
+碎碎的 2 z
+碎米 30 n
+碎粉 3 n
+碎纸 3 n
+碎纸机 4 n
+碎肉 3 n
+碎花 11 n
+碎裂 182 v
+碎裂声 3 n
+碎语 3 nz
+碎身粉骨 3 i
+碎身糜躯 3 v
+碎金 3 n
+碎银 51 n
+碎雪 3 n
+碎首糜躯 3 v
+碎首縻躯 3 v
+碎骨粉尸 3 n
+碎骨粉身 3 n
+碏 8 zg
+碑 1757 n
+碑亭 305 n
+碑刻 117 n
+碑名 3 n
+碑学 3 n
+碑帖 36 n
+碑座 135 n
+碑廊 4 n
+碑志 33 n
+碑拓 3 n
+碑文 142 n
+碑林 40 n
+碑林区 4 n
+碑版 3 n
+碑石 40 n
+碑碣 22 n
+碑记 22 n
+碑贴 3 n
+碑身 3 n
+碑铭 39 n
+碑阴 2 n
+碑额 8 n
+碓 38 g
+碓房 3 nr
+碔 11 zg
+碔砆混玉 3 nz
+碕 38 zg
+碗 3174 q
+碗儿 10 n
+碗公 3 n
+碗口 72 n
+碗底 3 n
+碗柜 3 n
+碗橱 13 n
+碗盆 3 n
+碗盏 37 n
+碗盘 3 n
+碗碗腔 2 n
+碗碟 67 n
+碗筷 166 n
+碗篮 3 n
+碗装 8 n
+碗豆 3 n
+碗锅 3 n
+碗面 25 n
+碗饭 3 n
+碘 542 n
+碘仿 3 n
+碘值 3 n
+碘剂 3 nz
+碘化 2 nz
+碘化氢 3 nz
+碘化氨 3 n
+碘化汞 3 nz
+碘化物 3 n
+碘化钙 3 nz
+碘化钠 6 nz
+碘化钾 20 nz
+碘化银 18 nz
+碘化镁 3 nz
+碘尿嘧啶 3 n
+碘片 3 n
+碘瓶 3 n
+碘甘油 2 nz
+碘甲烷 7 nz
+碘盐 61 nz
+碘缺乏病 71 n
+碘质 3 n
+碘酊 3 n
+碘酒 22 n
+碘酸 5 nz
+碘酸钾 8 nz
+碘钨灯 7 n
+碚 29 g
+碛 95 g
+碜 33 x
+碞 2 zg
+碟 692 ng
+碟中碟 3 n
+碟中谍 3 n
+碟仓 3 n
+碟仙 3 n
+碟友 3 n
+碟友会 3 n
+碟型 3 n
+碟子 122 n
+碟市 3 n
+碟店 3 n
+碟形 3 n
+碟机 26 n
+碟片 28 n
+碟片数 3 n
+碟版 3 n
+碡 4 x
+碣 49 n
+碣石 28 n
+碧 1402 nr
+碧云 9 nr
+碧云天 6 nr
+碧云寺 3 nr
+碧冷冷 3 z
+碧华国中 3 ns
+碧华国小 3 nr
+碧土 3 n
+碧土县 3 ns
+碧塔海 2 nr
+碧姬芭杜 3 nrt
+碧影 3 n
+碧昂丝 3 nr
+碧桂园 3 nr
+碧桃 34 nr
+碧梧 3 n
+碧欧泉 3 nr
+碧水 88 nr
+碧水湾 3 nr
+碧水潭 2 nr
+碧水青山 3 nr
+碧池 3 n
+碧油油 14 n
+碧波 128 nr
+碧波万顷 17 nr
+碧波荡漾 3 nr
+碧流河 3 ns
+碧海 64 ns
+碧海晴空 3 nr
+碧海银沙 3 nr
+碧海青天 3 nr
+碧湖国中 3 nr
+碧潭 7 nr
+碧澄澄 4 z
+碧澈 2 z
+碧灵草 6 nr
+碧烟 5 n
+碧玉 119 nr
+碧玉簪 3 n
+碧玺 19 nr
+碧琉璃 2 nr
+碧瑶 9 nr
+碧瓦 15 nr
+碧痕 4 n
+碧眼 70 n
+碧空 29 n
+碧空如洗 3 l
+碧粼粼 3 l
+碧纱 11 n
+碧纱橱 4 n
+碧绿 226 z
+碧绿色 3 nr
+碧色 5 n
+碧草 8 n
+碧草如茵 3 nr
+碧荧荧 2 nr
+碧莹莹 2 z
+碧萧 2 z
+碧落 7 n
+碧落黄泉 3 nr
+碧蓝 54 z
+碧蓝色 3 nr
+碧螺 23 n
+碧螺春 30 nr
+碧血 37 n
+碧血丹心 3 n
+碧血剑 3 nr
+碧血黄花 3 n
+碧蹄 4 n
+碧雪丹心 3 nr
+碧霞珠 39 nr
+碧霞祠 4 nr
+碧鬟红袖 3 nr
+碰 1888 v
+碰一鼻子 3 l
+碰一鼻子灰 3 l
+碰上 785 v
+碰下 3 v
+碰伤 3 v
+碰倒 3 v
+碰击 3 v
+碰击声 3 l
+碰到 1547 v
+碰到困难 3 l
+碰到矛盾 3 l
+碰到问题 3 l
+碰压接箍 3 n
+碰固定口 3 l
+碰坏 3 v
+碰壁 90 v
+碰头 67 v
+碰头会 44 l
+碰巧 127 d
+碰巧在 3 l
+碰巧是 3 l
+碰得 3 v
+碰掉 3 v
+碰撞 634 v
+碰撞参量 3 n
+碰撞检测 3 n
+碰撞活化 3 n
+碰撞猝灭 3 vn
+碰撞频率 3 n
+碰杯 34 v
+碰破 3 vn
+碰硬 5 v
+碰碎 3 v
+碰碰 59 v
+碰碰球 3 v
+碰碰船 3 l
+碰碰车 4 v
+碰碰运气 35 l
+碰簧锁 3 n
+碰翻 3 v
+碰见 310 v
+碰触 3 v
+碰过 3 v
+碰运气 30 l
+碰钉 3 n
+碰钉子 18 l
+碰铃 3 n
+碰锁 3 v
+碰面 53 v
+碱 975 n
+碱业 2 n
+碱中毒 3 l
+碱值 3 n
+碱储备 3 n
+碱化 24 n
+碱厂 21 n
+碱变性法 3 l
+碱土 28 n
+碱土金属 38 n
+碱地 7 n
+碱场 3 n
+碱基 63 n
+碱基催化 3 vn
+碱基堆积 3 v
+碱基对 27 l
+碱基比 3 n
+碱基组成 3 l
+碱基置换 3 l
+碱基配对 3 n
+碱度 2 n
+碱式 6 n
+碱式盐 10 n
+碱式碳酸铜 2 n
+碱式碳酸锌 2 n
+碱性 452 n
+碱性品红 3 l
+碱性土 3 n
+碱性岩 20 n
+碱性平炉 3 n
+碱性溶剂 3 n
+碱木质素 3 n
+碱水 20 n
+碱洗 3 v
+碱洗塔 3 n
+碱液 36 n
+碱渣 3 n
+碱滩 3 n
+碱熔 3 n
+碱石灰 3 n
+碱类 3 n
+碱草 7 n
+碱荒 3 n
+碱裂解 3 l
+碱金属 80 n
+碱集料 3 n
+碱面 5 n
+碲 74 g
+碲化镉 4 n
+碳 1732 n
+碳丝灯 3 n
+碳刷 3 n
+碳化 39 n
+碳化物 51 n
+碳化硅 23 nz
+碳化硼 5 nz
+碳化钙 11 nz
+碳化钛 6 nz
+碳化钨 9 nz
+碳化钨钻 3 nz
+碳化铁 2 n
+碳原子 3 n
+碳塑 3 n
+碳循环 3 n
+碳棒 9 n
+碳氢 3 n
+碳氢化合 3 nz
+碳氢化合物 44 n
+碳氢化物 3 n
+碳氮比 7 n
+碳水 3 n
+碳水化合物 190 n
+碳源 10 n
+碳炔 3 n
+碳种植体 3 n
+碳笔 3 n
+碳粉 2 n
+碳糊电极 3 n
+碳素 39 n
+碳素墨水 3 n
+碳素纤维 2 n
+碳素钢 24 n
+碳纤维 38 n
+碳纳米管 3 nz
+碳质沥青 3 n
+碳酐 3 nz
+碳酰基 3 nz
+碳酸 119 n
+碳酸岩 13 n
+碳酸气 6 n
+碳酸氢 3 nz
+碳酸氢氨 3 n
+碳酸氢盐 13 nz
+碳酸氢纳 3 nz
+碳酸氢钙 8 nz
+碳酸氢钠 83 nz
+碳酸氢钾 3 nz
+碳酸氢铵 36 nz
+碳酸氨 3 n
+碳酸水 3 n
+碳酸盐 159 nz
+碳酸盐岩 80 n
+碳酸酐酶 7 n
+碳酸钙 95 nz
+碳酸钠 63 nz
+碳酸钡 3 nz
+碳酸钾 24 nz
+碳酸铯 3 n
+碳酸铵 4 nz
+碳酸银 3 nz
+碳酸锂 131 nz
+碳酸锌 2 nz
+碳酸锶 3 nz
+碳酸镁 4 nz
+碳钢 17 n
+碳铵 2 nz
+碳黑 2 nz
+碴 78 n
+碴儿 8 n
+碹 2 g
+碻 9 zg
+碾 529 v
+碾下去 3 v
+碾伯镇 2 ns
+碾到 3 v
+碾压 36 n
+碾去 3 v
+碾场 3 n
+碾坊 29 n
+碾子 282 n
+碾子山区 3 ns
+碾平 3 n
+碾得 3 v
+碾成 3 v
+碾断 3 v
+碾来碾去 3 n
+碾盘 72 n
+碾砣 3 n
+碾碎 34 v
+碾磨 15 v
+碾米 64 n
+碾米厂 6 n
+碾米机 3 n
+碾轧 3 v
+碾过 3 v
+磁 1526 n
+磁介质 3 n
+磁体 119 n
+磁倾角 15 n
+磁倾计 3 v
+磁偏角 29 n
+磁偏计 3 n
+磁偏转 3 n
+磁偶极子 3 n
+磁偶极矩 3 n
+磁光效应 3 n
+磁共振 65 n
+磁制 3 n
+磁力 87 n
+磁力仪 30 n
+磁力低 3 n
+磁力泵 3 n
+磁力线 66 n
+磁力计 2 n
+磁力锁 3 n
+磁势 3 n
+磁化 220 n
+磁化干扰 3 n
+磁化强度 3 n
+磁化水 3 n
+磁化率 3 n
+磁区 3 n
+磁单极子 3 n
+磁卡 27 n
+磁卡电话 3 n
+磁压 3 n
+磁县 26 ns
+磁合金 21 n
+磁器 19 n
+磁场 1157 n
+磁场强度 60 n
+磁场扫描 3 n
+磁壳 3 n
+磁头 80 n
+磁头数 3 n
+磁头臂 3 n
+磁存储器 3 n
+磁存贮器 3 n
+磁学 54 n
+磁学家 3 n
+磁导率 53 n
+磁导计 3 n
+磁层 112 n
+磁山 46 ns
+磁峰 3 n
+磁峰镇 3 ns
+磁州窑 3 ns
+磁带 324 n
+磁带头标 3 n
+磁带库 3 n
+磁带控制器 2 n
+磁带机 17 n
+磁带盒 4 n
+磁带设备 3 n
+磁带驱动器 5 n
+磁强计 14 n
+磁心 15 n
+磁性 466 n
+磁性固位 3 n
+磁性天线 3 n
+磁性材料 3 n
+磁性瓷 2 n
+磁性衔铁 3 n
+磁悬浮 108 n
+磁悬浮列车 12 n
+磁感应 47 n
+磁感应强 3 n
+磁探仪 4 n
+磁控 3 n
+磁控溅射 3 vn
+磁控管 3 n
+磁放大器 3 nz
+磁效应 38 n
+磁方位 3 n
+磁旋比 3 n
+磁暴 35 n
+磁条 10 n
+磁条卡 3 n
+磁极 55 n
+磁标势 3 n
+磁棒 4 n
+磁法勘探 3 n
+磁泡 17 n
+磁流体 3 n
+磁浮 36 v
+磁滞 39 v
+磁滞回线 3 n
+磁漆 3 n
+磁灶 2 n
+磁片 8 n
+磁片套 3 nz
+磁片盒 3 nz
+磁珠 4 n
+磁瓶 7 n
+磁生物学 3 n
+磁电 12 n
+磁电式 3 n
+磁电机 4 n
+磁画 3 n
+磁疗 26 n
+磁盘 150 n
+磁盘分区 3 n
+磁盘工具 3 n
+磁盘控制器 4 n
+磁盘操作 3 n
+磁盘机 8 n
+磁盘格式 3 n
+磁盘清理 3 n
+磁盘盒 3 n
+磁盘碎片 3 n
+磁盘空间 3 n
+磁盘镜像 3 n
+磁盘阵列 7 n
+磁盘驱动器 16 n
+磁矩 200 n
+磁石 128 n
+磁砖 5 n
+磁砖壁画 3 n
+磁碟 3 n
+磁碟机 2 n
+磁碟档 3 n
+磁碟片 3 n
+磁碟组 3 n
+磁粉 15 n
+磁能 6 n
+磁能积 3 n
+磁芯 39 n
+磁荷 3 n
+磁记录 3 n
+磁记录器 3 n
+磁谱仪 5 n
+磁路 31 n
+磁轨 3 n
+磁轴 11 n
+磁选 6 n
+磁选机 5 n
+磁选法 3 n
+磁透镜 3 n
+磁通 69 n
+磁通量 41 n
+磁道 4 n
+磁道宽度 3 vn
+磁道格式 3 n
+磁量子数 3 n
+磁针 64 n
+磁钢 9 n
+磁铁 144 n
+磁铁矿 80 nz
+磁镜 3 n
+磁阻 11 n
+磁驴 3 n
+磁鼓 18 n
+磃 7 zg
+磅 644 m
+磅房 3 n
+磅湛 4 nrt
+磅湛省 2 ns
+磅礴 45 v
+磅秤 7 n
+磅称 3 v
+磅逊 10 nrt
+磅重 3 v
+磊 78 nr
+磊块 3 i
+磊浪不羁 3 i
+磊瑰不羁 3 v
+磊磊 3 i
+磊磊落落 3 i
+磊落 31 a
+磊落不凡 3 i
+磊落不羁 3 i
+磊落光明 3 i
+磊落大方 3 i
+磊落豪横 3 i
+磊落轶荡 3 z
+磊落飒爽 3 i
+磋 401 vn
+磋商 464 vn
+磋磨 3 vn
+磋谈 3 vn
+磐 256 ng
+磐安 4 nrt
+磐安县 3 ns
+磐田 3 n
+磐石 55 n
+磐石之固 3 n
+磐石之安 3 n
+磐石市 3 ns
+磐英 3 nrt
+磔 44 g
+磕 1003 v
+磕个响头 3 n
+磕个头 3 v
+磕头 1212 v
+磕头如捣 3 v
+磕头如捣蒜 14 v
+磕头碰脑 3 v
+磕头礼拜 3 v
+磕头虫 2 n
+磕巴 2 z
+磕打 9 v
+磕牙 3 v
+磕牙料嘴 3 n
+磕睡 3 v
+磕破 3 v
+磕碰 23 v
+磕磕巴巴 6 z
+磕磕撞撞 3 z
+磕磕碰碰 25 v
+磕磕绊绊 22 z
+磖 4 zg
+磙 5 n
+磙子 4 n
+磝 4 zg
+磠砂 3 v
+磡 5 zg
+磥 20 zg
+磨 2105 v
+磨一剑 3 nz
+磨不开 2 v
+磨亮 3 v
+磨人 3 n
+磨光 56 n
+磨光器 3 nz
+磨光机 3 n
+磨光条 3 n
+磨光钻 3 nz
+磨光面 3 n
+磨具 36 n
+磨出 3 v
+磨刀 41 n
+磨刀不误砍柴工 5 i
+磨刀擦枪 3 i
+磨刀机 3 n
+磨刀石 13 n
+磨刀霍霍 18 i
+磨到 3 v
+磨制 316 v
+磨削 31 v
+磨勘 3 v
+磨厉以须 3 i
+磨去 3 v
+磨叨 3 v
+磨叽 7 n
+磨合 104 v
+磨合期 11 n
+磨嘴 3 v
+磨嘴皮 3 n
+磨圆 3 n
+磨坊 68 n
+磨坊主 3 n
+磨墨 26 n
+磨头 20 n
+磨子 16 n
+磨子桥 3 n
+磨工 9 n
+磨工夫 3 n
+磨工期 3 n
+磨平 3 n
+磨床 50 n
+磨形炼性 3 n
+磨快 3 v
+磨成 3 v
+磨房 21 n
+磨折 6 n
+磨拳擦掌 20 i
+磨损 291 vn
+磨损失效 3 v
+磨损性 2 n
+磨损率 3 n
+磨损症 3 n
+磨损量 3 n
+磨掉 3 v
+磨搓 3 v
+磨擦 67 v
+磨擦力 3 n
+磨料 63 n
+磨断 3 v
+磨时间 3 n
+磨昬抉聩 3 i
+磨机 12 n
+磨来磨去 3 i
+磨杵 3 n
+磨杵作针 3 i
+磨杵成针 3 i
+磨棱刓角 3 nz
+磨歌 3 n
+磨毛 2 n
+磨洋工 7 n
+磨洗 5 v
+磨漆画 3 n
+磨灭 44 v
+磨炼 82 v
+磨烂 3 v
+磨烦 3 v
+磨煤机 6 nz
+磨片 3 n
+磨牙 86 n
+磨牙凿齿 3 i
+磨牙后腺 3 l
+磨牙吮血 3 vn
+磨牙癖 3 n
+磨牙齿 3 i
+磨球面 3 n
+磨电灯 3 n
+磨盘 62 n
+磨盘两圆 3 n
+磨盾之暇 3 n
+磨短 3 v
+磨石 15 n
+磨石子地 3 n
+磨石子面 3 n
+磨矿 3 n
+磨砂 4 n
+磨砂灯泡 3 n
+磨砂玻璃 4 n
+磨砂膏 2 n
+磨砖对缝 4 n
+磨砖成镜 3 n
+磨砥刻厉 3 i
+磨破 3 v
+磨砺 85 v
+磨砺以须 3 nr
+磨砻底厉 3 nr
+磨砻浸灌 3 nr
+磨砻砥砺 3 nr
+磨砻镌切 3 nr
+磨碎 41 v
+磨磋 3 v
+磨磐 3 i
+磨磨 3 v
+磨磨练 3 n
+磨磨蹭蹭 35 z
+磨礲浸灌 3 n
+磨礲淬励 3 vn
+磨穿 3 v
+磨穿铁砚 3 n
+磨穿铁鞋 3 n
+磨粉 18 n
+磨粉厂 3 n
+磨粉机 3 n
+磨粒 3 n
+磨练 173 vn
+磨练意志 3 n
+磨细 18 n
+磨而不磷 3 n
+磨耗 7 v
+磨肩接踵 3 i
+磨肩擦踵 3 i
+磨芋 3 n
+磨菇 3 n
+磨蚀 19 v
+磨豆腐 17 nz
+磨起 3 v
+磨起来 3 v
+磨踵灭顶 3 i
+磨蹭 75 z
+磨边 2 n
+磨边机 3 n
+磨铣工具 3 v
+磨链 3 n
+磨错 3 v
+磨难 198 n
+磨面 3 n
+磨齿机 2 n
+磬 76 ng
+磬安县 3 nr
+磬石之固 3 nr
+磬石县 3 nr
+磬竹难书 3 nr
+磬笔难书 3 nr
+磭 7 zg
+磱 71 zg
+磲 2 x
+磴 461 q
+磴口 3 ns
+磴口县 6 ns
+磴道 3 ns
+磶 13 zg
+磷 1372 n
+磷光 51 nz
+磷光体 3 n
+磷光分析 3 nz
+磷光计 3 nz
+磷化 8 n
+磷化合物 9 n
+磷化处理 3 n
+磷化氢 5 nz
+磷化液 3 nz
+磷化钙 3 nz
+磷化铟 7 nz
+磷化锌 2 nz
+磷化镓 14 nz
+磷块岩 13 nz
+磷氧比 3 nz
+磷火 25 n
+磷灰石 90 n
+磷灰石矿 3 n
+磷灰石糖 3 n
+磷矿 354 n
+磷矿石 26 n
+磷矿粉 3 n
+磷硅玻璃 3 nz
+磷磷 3 nz
+磷肥 327 n
+磷肥厂 259 n
+磷脂 89 n
+磷脂酶 3 n
+磷脂酸 3 n
+磷虾 33 n
+磷蛋白 3 n
+磷酰 2 n
+磷酰化 2 nz
+磷酸 200 nz
+磷酸三酯 3 nz
+磷酸二氢钙 2 nz
+磷酸二氢钠 2 nz
+磷酸二氢钾 5 nz
+磷酸二氢铵 3 nz
+磷酸二酯 3 nz
+磷酸化 42 nz
+磷酸化酶 3 nz
+磷酸原 3 n
+磷酸氢二钠 2 nz
+磷酸氢钙 8 nz
+磷酸激酶 3 nz
+磷酸甘油 3 nz
+磷酸盐 206 nz
+磷酸肌酸 3 n
+磷酸肌醇 3 n
+磷酸肽 3 nz
+磷酸解 3 n
+磷酸酯 27 nz
+磷酸酶 16 nz
+磷酸钙 18 nz
+磷酸钠 4 nz
+磷酸铵 3 nz
+磷酸锌 5 nz
+磷钇矿 5 nz
+磷钙石 3 n
+磷钨酸 3 n
+磷铵 3 nz
+磷霉素 3 n
+磹 2 zg
+磺 165 nz
+磺乙基 3 nz
+磺化 3 nz
+磺化煤 3 nz
+磺溪 3 nz
+磺田 3 nz
+磺窟 3 n
+磺胺 90 nz
+磺胺噻唑 3 n
+磺胺类 3 nz
+磺胺脒 3 nz
+磺脲 3 nz
+磺酸 40 nz
+磺酸盐 7 nz
+磺酸钠 3 nz
+磻溪 4 ns
+磼 8 zg
+磾 74 zg
+礁 500 n
+礁堡 3 ns
+礁屿 3 n
+礁岩 3 n
+礁棚 3 n
+礁湖 3 ns
+礁溪 2 ns
+礁溪温泉 3 ns
+礁璨魂 3 v
+礁盘 17 n
+礁石 122 n
+礁长 3 n
+礂 13 zg
+礅 12 g
+礇 47 zg
+礊 20 zg
+礋 40 zg
+礌 37 zg
+礓 4 x
+礙 2 zg
+礝 2 zg
+礞 6 x
+礠 28 zg
+礤床儿 3 z
+礩 70 zg
+礮 29 zg
+礲 4 zg
+礴 2 x
+示 968 v
+示人 74 n
+示众 159 n
+示例 83 n
+示值 3 n
+示功图 3 n
+示好 3 v
+示威 2256 n
+示威性 4 n
+示威抗议 3 n
+示威游行 3 n
+示威者 31 n
+示威运动 3 l
+示寂 3 v
+示差谱 3 l
+示巴 2 n
+示弱 158 v
+示性 5 n
+示性类 9 n
+示意 900 v
+示意图 115 n
+示意性 3 n
+示数器 3 n
+示波 9 n
+示波器 47 n
+示波图 3 n
+示波管 17 n
+示波镜 3 n
+示爱 7 v
+示现 3 v
+示范 981 v
+示范乡 3 n
+示范作用 3 n
+示范动作 3 vn
+示范区 2096 n
+示范县 1028 n
+示范园 15 n
+示范园区 3 n
+示范场 4 n
+示范岗 4 vn
+示范带 2 n
+示范带头 3 n
+示范店 4 n
+示范性 60 n
+示范户 5 n
+示范村 6 n
+示范校 30 n
+示范棚 3 n
+示范点 58 n
+示范片 3 n
+示范田 3 n
+示范者 4 n
+示范街 4 n
+示范表演 3 n
+示范课 6 n
+示覆 3 v
+示警 52 vn
+示贬于褒 3 nr
+示踪 18 v
+示踪剂 3 n
+示踪原子 3 n
+示踪物 2 n
+示零器 3 l
+礻 23 zg
+礼 5605 n
+礼为情貌 3 i
+礼义 54 n
+礼义廉耻 16 i
+礼乐 213 n
+礼乐之邦 3 i
+礼乐射御 3 v
+礼仪 1092 n
+礼仪之邦 18 i
+礼仪公司 3 n
+礼仪庆典 3 ns
+礼仪模特 3 n
+礼佛 87 n
+礼俗 52 n
+礼先一饭 3 i
+礼先壹饭 3 vn
+礼冠 3 n
+礼制 97 n
+礼券 21 n
+礼包 3 n
+礼单 41 n
+礼县 5 ns
+礼台 3 n
+礼品 303 n
+礼品公司 3 n
+礼品券 3 n
+礼品包装 3 n
+礼品厂 3 n
+礼品店 2 n
+礼品玩具 3 n
+礼品盒 9 n
+礼品网 3 n
+礼品表 3 n
+礼品袋 3 n
+礼品设计 3 n
+礼品部 3 n
+礼器 107 n
+礼坏乐崩 3 n
+礼堂 577 n
+礼士 3 n
+礼士路 3 n
+礼多人不 3 i
+礼多必诈 3 i
+礼奢宁俭 3 i
+礼宾 22 n
+礼宾司 17 n
+礼宾官 2 n
+礼宾府 3 n
+礼尚往来 16 i
+礼崩乐坏 10 i
+礼帖 3 n
+礼帽 107 n
+礼忏 3 v
+礼所当然 3 i
+礼拜 358 ns
+礼拜一 13 t
+礼拜一一 2 t
+礼拜三 3 t
+礼拜二 3 t
+礼拜五 6 t
+礼拜六 19 t
+礼拜六派 3 n
+礼拜四 3 t
+礼拜堂 46 n
+礼拜天 31 t
+礼拜寺 3 ns
+礼拜式 3 n
+礼拜日 8 t
+礼教 86 n
+礼敬 65 v
+礼数 155 n
+礼无不答 3 nz
+礼智信 3 n
+礼服 291 n
+礼服制服 3 n
+礼服呢 7 n
+礼服店 3 n
+礼毕 3 v
+礼治 23 n
+礼泉 8 n
+礼泉县 3 ns
+礼法 389 n
+礼炮 185 n
+礼炮声 7 n
+礼物 1113 n
+礼盒 54 n
+礼盒装 3 n
+礼聘 25 v
+礼节 257 n
+礼节为治 3 n
+礼节性 18 n
+礼花 40 n
+礼花弹 3 n
+礼葬 3 n
+礼袍 3 n
+礼让 43 v
+礼让为国 3 n
+礼让性 3 n
+礼记 137 n
+礼貌 516 n
+礼貌待客 3 i
+礼貌性 3 n
+礼贤下士 40 i
+礼赞 19 n
+礼赠品 3 n
+礼车 3 n
+礼轻情意 3 i
+礼运篇 3 n
+礼遇 132 n
+礼部 2937 n
+礼金 45 n
+礼门 7 n
+礼门义路 3 n
+礼顺人情 3 i
+礼饼 3 n
+礽 13 zg
+社 3573 n
+社中 3 l
+社主任 4 n
+社交 283 n
+社交互动 3 l
+社交图 3 n
+社交圈 11 n
+社交圈子 9 n
+社交性 3 n
+社交晚会 3 j
+社交活动 3 n
+社交生活 3 n
+社交界 3 n
+社交能力 3 n
+社交艺术 3 n
+社会 43401 n
+社会主义 13995 n
+社会主义者 105 n
+社会习俗 3 n
+社会交往 3 l
+社会保险 131 n
+社会保险费 4 n
+社会保险金 3 n
+社会保障 262 n
+社会保障部 6 nt
+社会党 409 nt
+社会党人 61 n
+社会公众 3 n
+社会公害 3 l
+社会公德 3 n
+社会关系 201 l
+社会分工 83 n
+社会制度 358 n
+社会动态 3 n
+社会动机 3 n
+社会化 368 n
+社会医学 3 nt
+社会变迁 3 l
+社会变革 3 l
+社会史 78 n
+社会各届 3 n
+社会各界 3 l
+社会名流 24 n
+社会处长 3 n
+社会契约论 29 n
+社会存在 27 l
+社会学 1266 n
+社会学家 247 n
+社会学所 7 nt
+社会学界 20 n
+社会学科 3 n
+社会学系 68 n
+社会安定 3 n
+社会定型 3 n
+社会局 3 nt
+社会工作 50 l
+社会工作者 12 n
+社会帝国 3 n
+社会底层 3 n
+社会强化 3 l
+社会形态 39 l
+社会心理学 71 l
+社会心理学家 13 l
+社会性 125 n
+社会意识 28 l
+社会感染 3 l
+社会愿望 3 n
+社会效益 145 n
+社会教育 23 l
+社会昆虫 3 nz
+社会民主主义 67 n
+社会民主党 227 nt
+社会民主工党 59 nt
+社会污染 3 n
+社会沙文 3 n
+社会治安 3 l
+社会活动 90 l
+社会活动家 65 l
+社会现状 3 n
+社会知觉 3 l
+社会福利 3 n
+社会科学 522 nt
+社会科学家 51 l
+社会科学文献出版社 5 nt
+社会科学界 10 n
+社会科学院 64 nt
+社会秩序 3 nz
+社会纵横 3 l
+社会群体 3 l
+社会自我 3 n
+社会舆论 3 l
+社会蛀虫 3 n
+社会观 3 n
+社会规范 3 l
+社会议论 3 n
+社会财富 3 l
+社会贤达 11 l
+社会转型 3 n
+社会部 14 nt
+社会阶层 3 n
+社会青年 11 n
+社会风尚 3 n
+社会风气 3 l
+社会骤 3 l
+社保 119 j
+社保卡 3 n
+社保局 3 n
+社保费 3 n
+社党 3 n
+社刊 3 n
+社刊主编 3 n
+社办 4 n
+社办企业 3 j
+社务 3 n
+社区 6115 n
+社区化 5 n
+社区卫生 3 n
+社区性 3 n
+社区意识 3 n
+社区服务 3 n
+社区活动 3 n
+社区网 3 n
+社区规划 3 n
+社区论坛 3 n
+社区设施 3 n
+社区资源 3 n
+社友 3 n
+社名 3 n
+社员 251 n
+社团 420 n
+社团活动 3 l
+社团组织 3 nt
+社址 3 n
+社头 3 n
+社委 3 n
+社委会 3 nt
+社威 2 n
+社威擅势 3 v
+社子 3 n
+社子岛 3 n
+社学 23 n
+社寮 3 ns
+社工 14 n
+社情民意 12 l
+社戏 10 n
+社教 10 n
+社教司 3 n
+社教系 3 n
+社教组 3 n
+社教馆 3 n
+社旗 3 n
+社旗县 2 n
+社日 3 n
+社民党 64 nt
+社火 124 n
+社燕秋鸿 3 n
+社科 40 n
+社科文献出版社 2 nt
+社科界 3 n
+社科类 2 n
+社科联 2 nt
+社科部 3 nt
+社科院 75 nt
+社稷 2962 n
+社稷生民 3 v
+社群 38 n
+社联 10 n
+社花 3 n
+社论 244 n
+社论主笔 3 n
+社评 15 n
+社运 3 n
+社运人士 3 n
+社里 36 n
+社长 585 n
+社长兼 3 l
+社队 18 n
+社风 3 n
+社鼠 3 n
+社鼠城狐 3 n
+祀 1389 g
+祀事 3 n
+祀人忧天 3 n
+祀奉 3 n
+祀物 3 n
+祀祖 3 n
+祀神 3 n
+祁 76 ns
+祁三哥 2 nr
+祁东 4 ns
+祁东县 3 ns
+祁六三 3 nr
+祁六和 2 nr
+祁剧 5 n
+祁县 33 ns
+祁天彪 29 nr
+祁奚举午 3 nr
+祁奚之举 3 nr
+祁奚之荐 3 nr
+祁山 91 ns
+祁山乃 3 nr
+祁山之 6 nr
+祁山伐 2 nr
+祁山兵 2 nr
+祁山寨 15 ns
+祁州 8 ns
+祁彪佳 4 nr
+祁彪清 14 nr
+祁志诚 41 nr
+祁总镖 2 nr
+祁清彪 13 nr
+祁漫塔 4 nr
+祁秉忠 3 nr
+祁红 8 nr
+祁老三 7 nr
+祁老六 2 nr
+祁连 50 ns
+祁连县 3 ns
+祁连山 191 ns
+祁连山脉 33 ns
+祁门 18 ns
+祁门县 8 ns
+祁门红 3 nr
+祁阳 9 ns
+祁阳县 2 ns
+祂 21 zg
+祃 5 zg
+祅 10 zg
+祆 96 x
+祆教徒 3 v
+祇 71 zg
+祈 155 v
+祈使 2 v
+祈使句 2 v
+祈年 3 v
+祈年殿 25 nz
+祈愿 32 v
+祈愿板 3 v
+祈愿牌 3 v
+祈晴祷雨 3 nr
+祈望 9 v
+祈求 321 v
+祈盼 4 v
+祈祝 3 v
+祈祷 428 v
+祈祷之刃 3 v
+祈祷团 3 v
+祈祷文 3 vn
+祈福 118 nz
+祈福迎祥 3 z
+祈请 9 v
+祈连山 3 nz
+祈雨 29 v
+祉 14 ng
+祋 2 zg
+祎 391 zg
+祏 24 zg
+祐 665 zg
+祒 2 zg
+祓 36 g
+祔 4 zg
+祖 1588 nr
+祖丁之 2 nr
+祖上 228 n
+祖上有德 3 nr
+祖业 38 n
+祖丞相 5 nr
+祖之言 3 nr
+祖乙胜 2 nr
+祖产 3 n
+祖代 3 n
+祖传 148 nr
+祖传秘方 19 n
+祖兄 4 n
+祖先 1526 nr
+祖先崇拜 3 nr
+祖先生 2 nr
+祖公公 2 nr
+祖典 7 n
+祖军 3 n
+祖冲之 170 nrfg
+祖列宗 16 nr
+祖初年 2 nr
+祖制 17 n
+祖功宗德 3 nr
+祖北征 5 nr
+祖千秋 150 nr
+祖博夫 2 nr
+祖厉河 9 nr
+祖右社 387 nr
+祖司麻 3 nr
+祖名为 2 nr
+祖启慧 3 nr
+祖围 8 n
+祖国 3452 n
+祖国各地 3 l
+祖国大陆 3 nr
+祖国统一 3 l
+祖国颂 3 nr
+祖坛 5 n
+祖坟 218 n
+祖埃拉 2 nr
+祖堂寺 2 nr
+祖堂山 3 nr
+祖士远 10 nr
+祖大乐 10 nr
+祖大典 5 nr
+祖大寿 212 nr
+祖大弼 21 nr
+祖姑 3 n
+祖孙 105 nr
+祖孙三代 3 nr
+祖孙二人 3 nr
+祖孝孙 2 nr
+祖孟嘉 2 nr
+祖安国 2 nr
+祖安童 2 nr
+祖宗 1097 nr
+祖宗家法 14 nr
+祖宗成法 11 nr
+祖宗法度 5 nr
+祖家 3 n
+祖尔肯 2 nr
+祖尚浮 2 nr
+祖居 43 n
+祖居地 8 nr
+祖屋 3 n
+祖师 516 n
+祖师庙 2 nr
+祖师爷 207 nr
+祖庙 161 n
+祖庚之 2 nr
+祖庭 14 n
+祖康熙 2 nr
+祖弘忍 5 nr
+祖征 5 n
+祖德赞 2 nr
+祖忽必 2 nr
+祖总兵 3 nr
+祖总栈 2 nr
+祖恒之 4 nr
+祖慧能 5 nr
+祖承训 37 nr
+祖拜尔 17 nr
+祖斯达 3 nr
+祖日桓 8 nr
+祖本 11 n
+祖李耳 2 nr
+祖武宗文 3 nr
+祖母 252 nr
+祖母绿 68 nr
+祖永乐 3 nr
+祖法儿 2 nr
+祖泽远 5 nr
+祖湛然 2 nr
+祖父 521 n
+祖父母 190 nr
+祖玄烨 5 nr
+祖率 12 n
+祖班纳 3 nr
+祖生之鞭 3 i
+祖界内 2 n
+祖白圭 2 nr
+祖皇帝 9 nr
+祖祖辈辈 48 l
+祖福临 135 nr
+祖离 2 n
+祖籍 204 n
+祖约 3 n
+祖纳桑 3 nr
+祖细胞 3 n
+祖罗夫 3 nr
+祖耶夫 18 nr
+祖脉 2 n
+祖至孙 3 nr
+祖茔 7 n
+祖藏 2 n
+祖规 3 n
+祖训 32 n
+祖训严 2 nr
+祖诺夫 6 nr
+祖辈 135 n
+祖述 7 n
+祖逖之誓 3 nr
+祖逖数 2 nr
+祖道 2 n
+祖阿里 2 nr
+祖韦尼 2 nr
+祖韦提 2 nr
+祖饯 3 n
+祖马 6 n
+祖鲁 23 nr
+祖鲁人 5 nr
+祖鲁军 2 nr
+祖鲁族 2 nr
+祖鲁语 7 nr
+祖鲁那 4 nr
+祖龙一炬 3 i
+祖龙之虐 3 i
+祖龙的 2 nr
+祗 74 g
+祚 86 g
+祛 122 v
+祛斑 27 n
+祛斑霜 3 nz
+祛暑 7 v
+祛淤 3 v
+祛灾 3 n
+祛疑 3 v
+祛病 12 v
+祛病健身 3 n
+祛病延年 3 n
+祛痰 52 v
+祛痰剂 3 n
+祛瘀 23 v
+祛蠹除奸 3 n
+祛邪 28 v
+祛除 37 v
+祛除风寒 3 n
+祛风 60 v
+祛风胜湿 3 nz
+祛风除湿 3 nz
+祜 67 g
+祝 1878 v
+祝万庆 4 nr
+祝余鱼 3 nr
+祝你们 3 nr
+祝你好运 3 nr
+祝你平安 3 nr
+祝你幸福 3 nr
+祝你开心 3 nr
+祝你快乐 3 nr
+祝你愉快 3 z
+祝你成功 3 nr
+祝僇祝鲠 3 n
+祝允明 5 nr
+祝列克 3 nr
+祝匡善 3 nr
+祝华新 6 nr
+祝发文身 3 nr
+祝发空门 3 n
+祝君 3 nr
+祝告 3 v
+祝圣寺 3 nr
+祝奈德 2 nr
+祝妳们 3 ns
+祝姑娘芳 2 nr
+祝宗卜 2 nr
+祝宝树 2 nr
+祝家山村 3 nr
+祝家庄 78 nr
+祝家来 2 nr
+祝寿 123 nr
+祝寿延年 3 nr
+祝小龙 3 nr
+祝希娟 3 nr
+祝建华 2 nr
+祝彪道 2 nr
+祝志军 7 nr
+祝总斌 23 nr
+祝您 3 nr
+祝您健康 3 z
+祝您长寿 3 v
+祝愿 277 v
+祝捷 30 nr
+祝捷大会 3 nr
+祝新运 3 nr
+祝有容 5 nr
+祝朝奉 15 nr
+祝枝山 6 nr
+祝正宇 2 nr
+祝法王 2 nr
+祝温青 2 nr
+祝潇湘 2 nr
+祝由科 2 nr
+祝祷 49 v
+祝祷重 4 nr
+祝福 327 nr
+祝福声 6 nr
+祝福歌 5 nr
+祝福油 3 nr
+祝福网 3 nr
+祝福语 3 nr
+祝胡斐 3 nr
+祝苦头陀 2 ns
+祝英台 43 nr
+祝虚竹 2 nr
+祝融 21 nr
+祝融为虐 3 n
+祝融峰 13 nr
+祝融殿 5 nr
+祝融氏 3 nr
+祝词 24 nr
+祝贺 560 nr
+祝贺信 3 nr
+祝辞 15 nr
+祝郭襄 2 nr
+祝郭靖 3 nr
+祝酒 17 v
+祝酒歌 8 nr
+祝酒词 10 nr
+祝酒辞 9 nr
+祝金轮 2 nr
+祝钒刚 3 ns
+祝铭山 257 nr
+祝镖头 5 vn
+祝颂 6 nr
+祝香香 2 nr
+祝鮀之佞 3 n
+祝鲠祝饐 3 ns
+祝鸿才 19 nr
+祝鹤笔 2 nr
+祝黄蓉 7 nr
+神 12550 n
+神不守舍 51 i
+神不收舍 3 i
+神不知 26 l
+神不知鬼 3 i
+神不知鬼不觉 66 i
+神不附体 3 i
+神丐洪 17 nr
+神丧胆落 3 l
+神丹 4 ns
+神丹妙药 3 i
+神主 3 n
+神乎 5 a
+神乎其技 20 i
+神乎其神 47 i
+神乎科技 3 l
+神交 70 n
+神京 31 ns
+神人 124 n
+神人共悦 3 nr
+神人共愤 3 l
+神仓颉 2 nr
+神仙 1138 n
+神仙下凡 6 l
+神仙中人 5 nr
+神仙会 2 nr
+神仙姐姐 3 nr
+神仙池 3 nr
+神仙般 3 l
+神仙鬼怪 3 i
+神会 3 n
+神会心契 3 n
+神会心融 3 n
+神伤 34 n
+神似 29 a
+神位 437 n
+神佑 3 nz
+神佛 28 n
+神使鬼差 3 i
+神侃 6 nr
+神侠倚 2 nr
+神俊最 2 nr
+神偷 3 n
+神像 351 n
+神僧孙 2 nr
+神僧空 2 nr
+神兆时 16 nr
+神光 25 n
+神光大师 2 nr
+神光湛 4 nr
+神兵 90 n
+神兵天将 3 i
+神兵天降 7 i
+神兵神 2 n
+神其妙 2 i
+神兽 3 n
+神冈 3 ns
+神军列 2 nr
+神农 688 nz
+神农庙 2 n
+神农本草经 18 n
+神农架 2114 n
+神农架林区 535 ns
+神农氏 7 nr
+神农溪 259 nz
+神农阁 2 nr
+神农顶 3 n
+神出鬼入 3 i
+神出鬼没 101 i
+神刀骆 3 nr
+神创论 8 n
+神到之笔 3 i
+神剑 168 n
+神剑中 4 nr
+神剑仙 10 nr
+神剑剑 12 nr
+神剑奇 2 nr
+神剑掌 16 nr
+神剑方 3 nr
+神剑经 12 nr
+神剧 3 n
+神力 173 n
+神功 628 a
+神功圣化 3 l
+神助 31 v
+神勇 81 nr
+神化 101 n
+神区鬼奥 3 n
+神医 221 n
+神医华陀 3 nz
+神华 12 nz
+神华集团 2 nt
+神台 12 n
+神号鬼哭 3 i
+神号鬼泣 3 i
+神名 3 a
+神后赫 4 nr
+神和子 2 n
+神品 20 n
+神哗鬼叫 3 i
+神喻 3 n
+神器 70 n
+神器谱 2 l
+神嚎鬼哭 3 v
+神圣 1051 ns
+神圣不可 3 l
+神圣化 50 nr
+神圣同盟 22 l
+神圣工巧 3 n
+神圣感 9 nr
+神圣罗马 3 ns
+神圣职责 3 l
+神坛 131 n
+神堂 17 n
+神境妙 2 i
+神头 13 n
+神头岭 3 l
+神头鬼脸 3 i
+神头鬼面 3 l
+神奇 695 a
+神奇四侠 3 nr
+神奇荒怪 3 i
+神奇莫测 3 i
+神奈川 6 nr
+神奈川县 15 ns
+神奥 3 nr
+神奥丁 2 nr
+神奥西 2 nr
+神女 42 n
+神女峰 11 nr
+神奸巨猾 3 i
+神奸巨蠹 3 i
+神妙 144 a
+神妙莫测 11 i
+神姿 3 n
+神威 182 n
+神婆 6 n
+神学 462 n
+神学家 102 n
+神学目的论 7 l
+神学院 55 nt
+神宇 3 nr
+神安气定 3 l
+神安气集 3 n
+神完气足 11 i
+神宗 128 nr
+神宗之 2 nr
+神宗亦 3 nr
+神宗元 7 nr
+神宗命 3 nr
+神宗朱 2 nr
+神宗皇帝 14 nr
+神宗见 4 nr
+神宗赐 3 nr
+神官 3 n
+神宙斯 8 nr
+神宫 30 n
+神宫监 3 nr
+神密 3 a
+神封 3 ns
+神射手 6 n
+神尾光臣 2 n
+神山 85 ns
+神山上人 3 l
+神山圣 2 ns
+神岩壑 3 nr
+神岳琼 2 nr
+神崎 3 ns
+神崎武法 3 nr
+神州 422 ns
+神州六 3 nr
+神州六号 3 nz
+神州大地 3 nz
+神州大陆 3 ns
+神州数码 3 n
+神州行 125 nt
+神州赤县 3 ns
+神州陆沉 3 nr
+神工 2 n
+神工天巧 3 n
+神工意匠 3 n
+神工鬼力 3 l
+神工鬼斧 3 i
+神巫 13 n
+神差 3 n
+神差鬼使 11 i
+神差鬼遣 3 i
+神师计 2 nr
+神帛堂 2 nr
+神庙 486 n
+神府 19 n
+神府煤田 4 nz
+神庭 3 n
+神异 32 n
+神往 523 v
+神往神来 3 l
+神志 184 n
+神志不清 3 i
+神志昏迷 3 i
+神态 731 n
+神态悠闲 3 n
+神态自若 14 i
+神怒人怨 3 i
+神思 67 n
+神思不定 3 l
+神思恍惚 9 i
+神思者 3 n
+神怡心旷 3 nr
+神性 3 n
+神怪 58 a
+神怪片 3 l
+神恩利 3 nr
+神悟 3 n
+神情 1963 n
+神情不属 3 l
+神情开朗 3 i
+神情异样 3 l
+神情恍惚 3 i
+神情愉快 3 z
+神情毕肖 3 i
+神情沮丧 3 vn
+神情自若 2 i
+神愁鬼哭 3 i
+神意 3 n
+神意自若 3 i
+神户 70 n
+神户港 13 ns
+神技 3 n
+神投手 2 i
+神抶电击 3 vn
+神拼 3 v
+神掌沾 2 nr
+神探 2 n
+神援 3 n
+神摇意夺 3 i
+神摇目夺 3 i
+神效 28 a
+神教 31 nz
+神教文 5 n
+神斗士 3 n
+神施鬼设 3 l
+神族 3 nz
+神无 7 l
+神明 212 n
+神明不衰 3 l
+神昏 35 v
+神智 320 nr
+神智不清 3 l
+神智清醒 3 l
+神曲 46 n
+神木 93 n
+神木北 3 ns
+神木医 3 nr
+神木县 4 ns
+神术 3 n
+神术妙计 3 l
+神术金 2 n
+神机 62 n
+神机妙算 76 l
+神机莫测 3 l
+神机营 20 l
+神机鬼械 3 l
+神权 91 n
+神权时代 3 l
+神来之笔 527 i
+神来气旺 3 l
+神果 16 n
+神枢鬼藏 3 l
+神枪 23 n
+神枪手 27 n
+神树 9 n
+神格 3 n
+神格化 3 nr
+神棍 3 n
+神武 27 nr
+神武帝 2 nr
+神武挂冠 3 i
+神武门 25 n
+神殿 155 n
+神气 627 n
+神气十足 10 i
+神气怡然 3 nr
+神气扬扬 3 i
+神气活现 35 i
+神水 3 n
+神汉 22 n
+神池 7 n
+神池县 5 ns
+神油 3 n
+神法 3 n
+神泪 3 n
+神洲 3 ns
+神洲傲 7 nr
+神洲海 2 ns
+神流气鬯 3 nr
+神浦元 2 nz
+神清意 2 l
+神清气朗 3 z
+神清气爽 28 i
+神清气茂 3 l
+神清目爽 3 i
+神清骨秀 3 i
+神游 41 n
+神湛骨寒 3 nr
+神湾 3 ns
+神火 36 n
+神火飞 3 nr
+神灭形消 3 l
+神灭论 9 n
+神灯 14 n
+神灵 301 n
+神炮手 4 n
+神烈山 2 nr
+神焦鬼烂 3 l
+神照上人 3 l
+神照功 19 nr
+神照经 6 l
+神爱世人 3 nr
+神父 222 n
+神物 46 n
+神牵鬼制 3 l
+神狄奥 3 nr
+神珍铁 3 nr
+神瑛侍者 4 nr
+神甫 58 nr
+神田 2 nz
+神界 8 n
+神皇洲 256 ns
+神眉鬼眼 3 i
+神眉鬼道 3 i
+神知不清 3 l
+神短气浮 3 i
+神社 30 n
+神祇 3 z
+神祈雨 2 nr
+神祖主 128 n
+神祗 117 n
+神神秘秘 22 n
+神神经经 3 l
+神神道道 4 l
+神祠 17 nr
+神禾村 3 nr
+神秀 8 a
+神秘 2108 a
+神秘主义 92 n
+神秘兮兮 17 z
+神秘化 48 n
+神秘园 3 n
+神秘学 3 l
+神秘岛 3 nr
+神秘性 16 n
+神秘恐怖 3 l
+神秘感 47 n
+神秘果 10 n
+神秘物质 3 n
+神秘电话 3 l
+神秘色彩 3 l
+神秘莫测 60 l
+神童 66 n
+神竦心惕 3 v
+神笔 50 n
+神策军 39 n
+神策门 2 n
+神算 20 n
+神箭手 3 n
+神经 1997 n
+神经中枢 51 l
+神经元 281 nz
+神经元网络 3 n
+神经兮兮 3 l
+神经内科 3 nz
+神经再生 3 i
+神经功能 3 n
+神经原 10 n
+神经因子 3 l
+神经外科 70 nz
+神经失常 3 l
+神经学 3 n
+神经学家 3 l
+神经官能症 24 l
+神经性 82 n
+神经战 3 nz
+神经战术 3 n
+神经末梢 33 l
+神经核 3 n
+神经毒素 3 l
+神经毡 3 n
+神经炎 26 n
+神经病 160 n
+神经症 51 n
+神经痛 21 n
+神经科 21 nz
+神经科学 7 l
+神经管 52 n
+神经类型 3 n
+神经系 3 n
+神经系统 407 l
+神经纤维 99 l
+神经线 6 n
+神经细胞 122 n
+神经网 5 nz
+神经网络 3 n
+神经肽 18 n
+神经节 3 n
+神经衰弱 80 l
+神经褶 3 n
+神经计算 3 n
+神经质 85 n
+神经过敏 22 l
+神经递质 3 n
+神经酰胺 3 nz
+神经错乱 20 i
+神而明之 3 i
+神聊 5 a
+神职 30 n
+神职人员 34 l
+神至之笔 3 i
+神舟 131 nz
+神舟五号 3 i
+神舟号 3 nr
+神色 2277 n
+神色不动 3 l
+神色不惊 3 i
+神色仓皇 3 n
+神色异常 3 l
+神色张皇 3 i
+神色自得 3 i
+神色自若 39 i
+神荼郁垒 3 n
+神藏鬼伏 3 i
+神蛇阁 4 nr
+神融气泰 3 nz
+神螺沟 4 n
+神行太保 43 nr
+神行法 7 n
+神论 39 n
+神论者 7 n
+神识 3 n
+神话 1378 n
+神话传说 3 l
+神话剧 7 n
+神话学家 2 l
+神话故事 3 i
+神话般 3 l
+神谋魔道 3 i
+神谕 11 n
+神谟庙算 3 nr
+神谟远算 3 nr
+神谷 3 n
+神貌 3 n
+神赫菲 4 nr
+神超形越 3 nr
+神路街 2 n
+神输鬼运 3 n
+神运石 2 nz
+神运鬼输 3 l
+神迷意夺 3 i
+神迹 30 n
+神通 354 nz
+神通广大 174 nz
+神逝魄夺 3 nr
+神速 123 n
+神道 464 n
+神道碑 11 n
+神道设教 3 n
+神郁保 2 nr
+神郁气悴 3 l
+神醉心往 3 i
+神采 110 n
+神采奕奕 61 i
+神采奕然 3 i
+神采焕发 18 i
+神采英拔 3 nr
+神采飘逸 3 i
+神采飞扬 82 i
+神针 18 n
+神閒气定 3 z
+神门 3 n
+神闲气定 2 l
+神闲气静 3 l
+神阙穴 3 nr
+神降仙 2 nr
+神雕侠侣 3 n
+神霄宫 2 nr
+神霄殿 2 nr
+神霄绛阙 3 nr
+神韩宝 3 nr
+神音 3 n
+神韵 355 n
+神领 2 n
+神领意会 3 l
+神领意得 3 l
+神领意造 3 l
+神风 3 n
+神风特 16 nr
+神飞气扬 3 i
+神飞色舞 3 i
+神马 8 n
+神驰 3 nz
+神驰久 2 i
+神驰力困 3 i
+神髓 3 n
+神鬼 78 n
+神鬼不测 3 i
+神鬼出没 3 i
+神鬼莫测 10 i
+神鬼难测 3 i
+神魂 58 n
+神魂不定 3 i
+神魂摇荡 3 i
+神魂荡飏 3 nz
+神魂颠倒 73 i
+神魂飘荡 13 i
+神魂飞越 3 i
+神魄 8 n
+神魔 3 n
+神鸟 27 n
+神鹰 3 nz
+神鹿 6 n
+神麴茶 3 vn
+神龙 1197 nz
+神龙失埶 3 nr
+神龙富康 3 ns
+神龙教 3 nz
+神龙见首 3 i
+神龙见首不见尾 16 i
+神龙马壮 3 i
+神龛 47 n
+神龟 6 n
+祟 49 g
+祟高 3 i
+祠 584 n
+祠堂 425 n
+祠墓 3 n
+祠庙 3 n
+祢 28 g
+祢衡 21 n
+祣 2 zg
+祥 632 nr
+祥云 80 ns
+祥云县 3 ns
+祥云瑞气 3 nz
+祥光 3 nz
+祥兴 10 ns
+祥和 287 nrfg
+祥和气氛 3 n
+祥尽 3 a
+祥春 3 nrfg
+祥林 14 ns
+祥林嫂 3 nr
+祥瑞 58 nz
+祥瑞之气 3 nz
+祥瑞网 3 nz
+祥符 16 nz
+祥符调 2 nr
+祥细 3 a
+祥风时雨 3 l
+祥麟威凤 3 nr
+祦 65 zg
+祧 133 g
+票 2353 n
+票价 590 n
+票价表 3 n
+票传 3 n
+票体 3 n
+票值 3 n
+票决 3 v
+票券 3 n
+票务 28 n
+票务网 3 n
+票务通 3 n
+票单 3 n
+票友 47 n
+票友会 3 n
+票口 3 n
+票台 6 n
+票号 66 n
+票头 3 n
+票夹 3 n
+票子 160 n
+票庄 3 n
+票式 3 n
+票戏 3 n
+票房 106 n
+票房价值 11 n
+票房榜 3 n
+票房毒药 3 n
+票房记录 3 n
+票据 321 n
+票据交换 3 v
+票据打印 3 n
+票据法 22 n
+票据通 3 n
+票数 59 n
+票暴 3 n
+票样 3 n
+票根 3 n
+票款 13 n
+票汇 3 n
+票源 10 n
+票然 3 n
+票箱 13 n
+票证 41 n
+票贩 3 n
+票贩儿 3 n
+票贩子 25 n
+票贴 3 n
+票选 24 n
+票选办法 3 n
+票面 57 n
+票面价值 3 n
+票面价格 3 n
+票面值 6 n
+票面额 9 n
+票额 12 n
+票骑 3 n
+祩 6 zg
+祪 2 zg
+祫 23 zg
+祬 9 zg
+祭 4139 v
+祭上 3 v
+祭主 3 v
+祭仙 3 n
+祭仪 43 n
+祭典 3 n
+祭出 3 v
+祭台 36 n
+祭司 293 n
+祭吊 3 v
+祭告 3 n
+祭品 108 n
+祭器 194 n
+祭地 3 n
+祭坛 187 n
+祭坛装饰 3 n
+祭堂 13 n
+祭墓 3 n
+祭天 611 n
+祭天大典 3 n
+祭奠 165 v
+祭奠仪式 3 nr
+祭好 3 v
+祭孔 3 n
+祭孔大典 3 n
+祭完 3 v
+祭师 3 n
+祭幛 3 n
+祭悼 3 v
+祭扫 31 v
+祭扫者 3 n
+祭拜 69 v
+祭文 176 n
+祭服 3 v
+祭满 3 v
+祭灵 3 n
+祭灶 25 n
+祭物 3 n
+祭献 16 n
+祭礼 169 n
+祭祀 2014 v
+祭祀坑 21 n
+祭祖 384 n
+祭祖大典 3 n
+祭神 3 n
+祭神大典 3 n
+祭酒 3 v
+祭酒岭 3 n
+祭错 3 v
+祯 66 g
+祰 3 zg
+祲威盛容 3 nz
+祳 3 zg
+祴 13 zg
+祵 7 zg
+祷 150 vg
+祷告 142 v
+祷告词 3 n
+祷念 3 v
+祷文 3 v
+祷祝 70 v
+祷词 7 n
+祸 1186 n
+祸不单行 29 i
+祸不旋踵 3 i
+祸中有福 3 i
+祸为福先 3 i
+祸乱 64 n
+祸乱滔天 3 i
+祸事 135 n
+祸从口出 17 i
+祸从口生 3 i
+祸从天降 12 i
+祸兮福所倚 4 l
+祸及 18 v
+祸及池鱼 3 i
+祸因恶积 3 n
+祸国 3 n
+祸国殃民 69 i
+祸在旦夕 3 i
+祸害 229 n
+祸心 12 n
+祸必重来 3 i
+祸患 152 n
+祸患无穷 3 i
+祸枣灾梨 3 n
+祸根 97 n
+祸殃 11 n
+祸水 37 n
+祸生肘腋 3 i
+祸祟 4 n
+祸福 109 n
+祸福与共 3 i
+祸福之门 3 i
+祸福倚伏 3 i
+祸福同门 3 i
+祸福惟人 3 i
+祸福无常 3 i
+祸福无门 3 i
+祸福有命 3 i
+祸福由人 3 i
+祸福由己 3 i
+祸福相依 3 i
+祸福相倚 2 i
+祸福相生 3 i
+祸种 3 n
+祸稔恶积 3 nr
+祸端 25 n
+祸结兵连 3 i
+祸绝福连 3 i
+祸胎 43 n
+祸起萧墙 9 i
+祸近池鱼 3 i
+祸迫眉睫 3 n
+祸首 44 n
+祸首罪魁 3 n
+祹 7 zg
+祺 149 g
+祻 16 zg
+祼 7 zg
+祼体 3 vn
+祽 26 zg
+祾 12 zg
+祿 12 zg
+禀 1460 v
+禀受 3 v
+禀告 406 v
+禀奏 3 v
+禀帖 21 n
+禀性 49 n
+禀性忠厚 3 z
+禀性难移 3 n
+禀承 5 v
+禀报 1156 v
+禀明 165 v
+禀白 3 v
+禀着 3 v
+禀覆 3 v
+禀赋 81 n
+禀赋奇厚 3 nr
+禀陈 3 v
+禁 1737 v
+禁不住 598 v
+禁不起 30 v
+禁中颇牧 3 ns
+禁书 20 n
+禁令 364 n
+禁住 3 v
+禁例 7 n
+禁兵 3 n
+禁内 3 n
+禁军 344 n
+禁制 23 v
+禁制令 3 n
+禁制品 16 n
+禁办 3 v
+禁区 855 n
+禁卫 40 v
+禁卫军 3 n
+禁受 3 v
+禁受住 3 v
+禁口 3 n
+禁吸 2 v
+禁吸戒毒 5 n
+禁品 3 n
+禁售 19 v
+禁唱 3 v
+禁地 744 n
+禁城 21 n
+禁娼 3 v
+禁子 3 n
+禁完 3 v
+禁屠 3 n
+禁律 5 n
+禁得住 9 v
+禁得起 22 v
+禁忌 414 v
+禁忌症 35 n
+禁忌证 3 n
+禁情割欲 3 n
+禁戒 3 n
+禁戒跃迁 3 n
+禁捕 257 v
+禁攻寝兵 3 vn
+禁放 6 v
+禁放令 3 n
+禁放区 2 n
+禁映影片 3 n
+禁暴正乱 3 l
+禁暴珠乱 3 n
+禁暴诛乱 3 vn
+禁条 3 n
+禁果 26 n
+禁核 3 v
+禁核试 16 v
+禁核试条约 16 n
+禁欲 50 v
+禁欲主义 38 n
+禁止 2582 v
+禁止令 4 n
+禁止令行 3 n
+禁止停车 3 n
+禁止入 2 n
+禁止喧哗 3 v
+禁止性 4 n
+禁止显示 3 n
+禁止状态 3 n
+禁止电路 3 n
+禁止者 3 n
+禁止脉冲 3 n
+禁止通行 3 n
+禁止门 3 n
+禁毁 27 v
+禁毒 211 v
+禁毒日 3 n
+禁毒署 10 v
+禁治产 3 n
+禁治产人 3 n
+禁渔 2 v
+禁渔区 4 n
+禁渔期 3 n
+禁演 23 v
+禁火 3 v
+禁烟 73 v
+禁烟令 3 n
+禁烟节 3 n
+禁片 3 n
+禁牧 3 v
+禁物 7 n
+禁猎 7 v
+禁猎区 9 n
+禁用 141 v
+禁用字符 3 n
+禁约 3 v
+禁绝 69 v
+禁网疏阔 3 n
+禁而不止 2 l
+禁脔 2 n
+禁舍开塞 3 n
+禁航区 2 n
+禁药 8 n
+禁葯 3 vn
+禁行 3 v
+禁言 3 n
+禁购 3 v
+禁赌 14 v
+禁赛 49 vn
+禁赛期 5 n
+禁足 3 v
+禁足处分 3 n
+禁运 195 v
+禁运令 3 n
+禁运品 3 n
+禁遏 3 v
+禁酒 15 v
+禁酒令 3 n
+禁锢 171 v
+禁闭 44 v
+禁闭室 16 n
+禁阻 3 v
+禁风 3 n
+禁飞 4 v
+禁飞令 5 n
+禁飞区 11 n
+禁食 74 n
+禁食疗法 3 n
+禁鼎一脔 3 n
+禂 6 zg
+禄 404 nr
+禄东赞 3 nr
+禄丰 22 nr
+禄丰县 12 ns
+禄享千 2 nr
+禄位 19 n
+禄俸 3 nr
+禄俸散 3 nr
+禄劝 5 nr
+禄劝县 3 ns
+禄劝彝族苗族自治县 4 ns
+禄千钟 2 nr
+禄命 3 nr
+禄宏仁 2 nr
+禄官统 3 nr
+禄官自 3 nr
+禄寺卿 8 nr
+禄寺官 2 nr
+禄寺少 4 nr
+禄寿祥 4 nr
+禄忠臣 2 nr
+禄星 4 nr
+禄未详 2 nr
+禄永终 3 nr
+禄秩 11 nr
+禄食 3 n
+禄高登 2 nr
+禅 868 n
+禅世雕龙 3 n
+禅义 3 n
+禅乐社 2 n
+禅位 3 n
+禅僧 3 n
+禅功 3 n
+禅味 3 n
+禅和子 3 n
+禅地 3 n
+禅城 3 n
+禅城区 3 n
+禅堂 48 n
+禅境 3 n
+禅学 16 n
+禅宗 177 n
+禅定 28 n
+禅家 3 n
+禅寂 3 v
+禅寺 59 n
+禅师 237 n
+禅心 17 n
+禅思 3 n
+禅悟 3 n
+禅意 8 n
+禅房 105 n
+禅族 3 n
+禅机 26 n
+禅杖 250 n
+禅林 9 n
+禅林寺 4 nz
+禅理 3 n
+禅絮沾泥 3 nr
+禅让 59 v
+禅让制 7 n
+禅语 5 nz
+禅趣 3 n
+禅门 15 n
+禅院 35 n
+禆 16 zg
+禊 4 g
+禋 9 zg
+禌 4 zg
+福 2920 ns
+福不盈眦 3 i
+福不重至 3 i
+福与天齐 3 nr
+福世子 2 nr
+福业 3 n
+福严寺 25 nr
+福中 5 ns
+福临 1341 ns
+福临刚 4 nr
+福临勃 2 nr
+福临发 2 nz
+福临召 2 nr
+福临扬 2 nr
+福临皱 2 nr
+福临笑 8 nr
+福临象 2 nr
+福临越 2 nr
+福临门 3 nr
+福为祸先 3 i
+福为祸始 3 i
+福乐 3 ns
+福井 29 ns
+福井县 4 ns
+福人 9 ns
+福份 3 nz
+福伯 5 ns
+福佑 9 nz
+福体 3 n
+福余卫 4 nr
+福作威 3 nr
+福佬话 2 nz
+福倚祸伏 3 i
+福元宝 2 nr
+福克 25 ns
+福克兰 17 ns
+福克兰岛 3 ns
+福克兰群 3 nr
+福克兰群岛 28 ns
+福克斯 34 nr
+福克斯公司 5 nt
+福克纳 31 nr
+福公司 3 nt
+福公子 21 nr
+福兮祸所伏 6 l
+福兰克 3 nz
+福兴 6 ns
+福冈 48 ns
+福冈市 3 ns
+福分 55 n
+福利 1112 ns
+福利主义 3 nz
+福利事业 3 nz
+福利制 3 nr
+福利制度 3 n
+福利厂 3 ns
+福利品 3 n
+福利地理 3 ns
+福利型 2 nz
+福利彩票 3 n
+福利待遇 3 n
+福利性 9 nr
+福利楼 3 ns
+福利社 3 nt
+福利费 25 nr
+福利部 2 nt
+福利金 4 nr
+福利院 66 nt
+福华 2 nz
+福卡 2 ns
+福卡斯 6 nr
+福厦 2 ns
+福和 9 ns
+福善祸淫 3 i
+福圣宝 2 nr
+福圣承 3 nr
+福地 79 ns
+福地洞天 3 ns
+福坦莫 3 nr
+福基斯 32 nr
+福堂哥 5 nr
+福塔莱萨 4 ns
+福塔贾 2 nr
+福塞利 2 ns
+福塞特 13 nr
+福士 2 ns
+福士贞 2 nr
+福大 41 ns
+福大帅 86 nr
+福如东海 6 nr
+福威 41 ns
+福威扬 4 nr
+福娃 3 nr
+福字 23 nz
+福孙荫子 3 nr
+福宁州 2 ns
+福宁府 3 nt
+福宁殿 6 nr
+福安 7 ns
+福安市 4 ns
+福安殿 2 nr
+福宝 3 nz
+福宫 2 ns
+福宫太后 3 nr
+福宫庄 3 nr
+福寿 27 ns
+福寿之 2 nr
+福寿仙 15 nr
+福寿全 3 nr
+福寿双全 7 nr
+福寿园 3 nr
+福寿天成 3 nr
+福寿山 3 nr
+福寿年高 3 nr
+福寿康宁 3 nr
+福寿无疆 4 nr
+福寿绵绵 3 nr
+福寿绵长 3 nr
+福寿螺 3 nr
+福寿酒 3 nr
+福寿镜 2 nr
+福寿齐天 3 nr
+福将 27 n
+福尔 7 ns
+福尔克 7 nr
+福尔克尔 2 nrt
+福尔图 3 nr
+福尔土 2 nr
+福尔摩斯 12 ns
+福尔摩沙 8 ns
+福尔斯 15 nr
+福尔曼 3 nr
+福尔杜纳 2 nrt
+福尔班 2 nr
+福尔聂 6 nr
+福尔蒂 8 nr
+福尔赛 4 nr
+福尔马林 60 ns
+福尼亚 6 ns
+福尼赫 2 nr
+福山 10 ns
+福山区 3 ns
+福山雅治 3 nz
+福岛 30 ns
+福州 897 ns
+福州人 13 nr
+福州军区 4 nt
+福州大学 31 nt
+福州市 140 ns
+福州市人 2 nz
+福州师专 3 nt
+福州广场 3 ns
+福州戏 3 nz
+福州春天 3 ns
+福州话 3 nr
+福州路 10 ns
+福布斯 58 ns
+福府 4 n
+福康安 328 nr
+福建 2179 ns
+福建人 29 nr
+福建人民出版社 4 nt
+福建南纸 4 nz
+福建厅 2 nt
+福建厦门 3 nz
+福建师范大学 17 nt
+福建日报 3 nz
+福建林学院 13 nt
+福建柏 18 nr
+福建省 520 ns
+福建省人民政府 3 nt
+福建省委 2 nt
+福建省宁德地区 4 ns
+福建籍 8 nr
+福建网 3 nz
+福建路 11 nr
+福建队 6 nt
+福建高速 4 nz
+福彩 2 nz
+福彩网 3 nr
+福德国小 3 nr
+福德正神 3 nr
+福德路 3 nr
+福态 3 n
+福慧双修 3 nr
+福报 145 nz
+福拉多 152 ns
+福摩萨 2 nr
+福斯 50 ns
+福斯基 3 nr
+福斯塔 4 nr
+福斯塔夫 3 nrt
+福斯式 2 nz
+福斯湾 3 ns
+福斯特 34 nr
+福无双至 3 i
+福日 3 nz
+福昌 7 ns
+福星 277 nz
+福星国小 3 nt
+福星高照 7 nr
+福晋 421 nr
+福晋中 2 nr
+福晋乌 2 nr
+福晋格 5 nr
+福晋笑 8 nr
+福晋陪 3 nr
+福机 3 n
+福林 2 ns
+福柑 3 n
+福柯 5 nr
+福格勒 3 nr
+福格尔 2 nr
+福格森 3 nr
+福格特 2 nr
+福格茨 3 nrt
+福楼拜 27 ns
+福橘 6 n
+福武直 5 nr
+福气 272 n
+福永享 27 nr
+福河 2 ns
+福泉 8 nz
+福泉县 3 ns
+福泉山 2 ns
+福泉市 3 ns
+福法民 4 nr
+福泽 87 nr
+福泽喻 42 nr
+福泽谕吉 10 nr
+福海 11 ns
+福海县 2 ns
+福清 33 nr
+福清人 3 nr
+福清县 3 ns
+福清市 6 ns
+福源 4 ns
+福烈帝 2 nr
+福煦 7 nr
+福特 145 ns
+福特公司 5 nt
+福特基金 3 nz
+福特基金会 3 nt
+福特宝 3 nr
+福特汽车公司 19 nt
+福特车 2 ns
+福王 3 nrt
+福瑞克 3 nr
+福瑞天 5 nr
+福田 108 ns
+福田区 24 ns
+福电 3 nz
+福相 16 nr
+福知山 2 nr
+福礼 3 nr
+福祇 3 v
+福祉 38 nr
+福神 6 nr
+福祸 8 n
+福禄克 3 nr
+福禄双全 3 nr
+福禄堂 2 nr
+福禄寿 15 nr
+福禄考 3 nr
+福禄诺 5 nr
+福禄贝尔 5 nr
+福禧 3 nrt
+福禧临门 3 nr
+福科 3 nz
+福美来 3 ns
+福至心灵 7 nr
+福舍尔 4 nr
+福船 2 nz
+福英格 3 nr
+福莫萨 2 nr
+福莱尔 3 nr
+福莱斯 9 nr
+福蒂斯 2 nr
+福藩告 2 nr
+福衢寿车 3 nt
+福西 3 ns
+福见义 2 nr
+福诺斯 2 nr
+福贡 5 ns
+福贡县 2 ns
+福费廷 2 n
+福赛思 2 nr
+福辛普 2 nr
+福过灾生 3 l
+福迪奥 5 nr
+福通弟 2 nr
+福金 15 n
+福银 256 nz
+福陵 2 ns
+福陵山 4 ns
+福隆 3 ns
+福隆安 2 ns
+福隆德 9 nr
+福雷尔 3 nr
+福雷斯 7 nr
+福音 114 n
+福音书 20 nr
+福音战士 3 nz
+福马 2 ns
+福马林 3 nr
+福鼎 3 nr
+福鼎县 2 nr
+福鼎市 3 ns
+福鼎茶 2 nr
+福龙 2 ns
+禐 10 zg
+禖 7 zg
+禛 136 zg
+禠夺 3 vn
+禥 8 zg
+禦 4 zg
+禧 23 g
+禨 84 zg
+禩 8 zg
+禮 3 zg
+禰 657 zg
+禳 69 a
+禵 7 zg
+禹 603 nr
+禹为前 2 nr
+禹为平 2 nr
+禹之鼎 2 nr
+禹余粮 3 nr
+禹作敏 4 nr
+禹南均 2 nr
+禹县 4 ns
+禹受禅 2 nr
+禹和尧 3 nr
+禹城 6 ns
+禹城县 3 ns
+禹城市 3 ns
+禹山 3 ns
+禹州 30 ns
+禹州市 6 ns
+禹惜寸阴 3 nr
+禹敷布 2 nr
+禹死启 2 nr
+禹治水 12 nr
+禹治理 2 nr
+禹王台 25 nr
+禹王宫 3 nr
+禹王庙 2 nr
+禹等超 2 nr
+禹藏花 2 nr
+禹行舜趋 3 nr
+禹门 4 ns
+禹门口 10 ns
+禹陵村 2 nr
+禺 10 g
+离 9736 v
+离不了 3 v
+离不开 392 v
+离不开手 3 i
+离世 44 v
+离世异俗 3 i
+离世绝俗 3 i
+离世遁上 3 z
+离久情疏 3 i
+离乡 51 v
+离乡别井 3 ns
+离乡别土 3 i
+离乡背井 23 i
+离乡背土 3 i
+离乡背景 3 i
+离乱 21 v
+离了婚 3 v
+离京 139 ns
+离人 11 n
+离任 95 v
+离任期间 3 n
+离休 156 v
+离休干部 3 n
+离休金 3 n
+离体保存 3 n
+离别 200 v
+离别多年 3 i
+离别已久 3 i
+离到任 2 l
+离削自守 3 n
+离华 3 v
+离去 909 v
+离去基团 3 n
+离去角 3 i
+离合 42 v
+离合体诗 3 n
+离合器 79 n
+离合悲欢 4 i
+离向 2 v
+离团 3 n
+离地 3 n
+离场 65 n
+离型纸 3 n
+离垢 3 n
+离域键 3 n
+离堆山 3 ns
+离境 17 n
+离境手续 3 i
+离奇 106 a
+离奇古怪 12 i
+离奇命案 3 n
+离奇失踪 3 i
+离婚 886 v
+离婚案 15 n
+离婚率 36 n
+离婚网 3 n
+离婚者 2 n
+离婚证 8 n
+离子 1478 n
+离子交换 3 v
+离子化 6 n
+离子半径 3 n
+离子反应 3 l
+离子型 33 n
+离子束 12 v
+离子束镀 3 n
+离子棒 3 n
+离子水 5 n
+离子注入 3 n
+离子流 3 n
+离子浮选 3 n
+离子源 3 n
+离子烫 3 v
+离子电渗 3 nz
+离子芯 3 n
+离子计 3 v
+离子轰击 3 i
+离子载体 3 n
+离子通道 3 n
+离子铣 3 nz
+离子键 31 n
+离子镀 3 v
+离子霉素 3 n
+离宫 55 n
+离家 181 n
+离家出走 3 i
+离家近 3 v
+离尘 3 n
+离层 3 n
+离山调虎 3 i
+离岗 21 v
+离岛 66 ns
+离岸 87 n
+离岸价 3 n
+离差 3 v
+离己而去 3 i
+离市 3 v
+离席 70 n
+离座 3 v
+离开 7600 v
+离开收到 3 l
+离异 97 v
+离异之心 3 i
+离弃 15 v
+离弦 3 v
+离弦走板 3 n
+离得开 3 v
+离心 120 v
+离心作用 3 n
+离心分离 3 i
+离心力 65 n
+离心套管 3 n
+离心式 16 n
+离心机 49 n
+离心法 3 n
+离心泵 9 n
+离心离德 20 i
+离心管 3 n
+离恨 3 v
+离您 3 l
+离情 14 n
+离情别绪 4 i
+离愁 21 v
+离愁别绪 10 i
+离散 230 v
+离散卷积 3 n
+离散性 5 n
+离散数学 3 n
+离散系统 3 n
+离散谱 3 n
+离散赋值 3 l
+离散集 3 v
+离本依末 3 i
+离本徼末 3 t
+离本趣末 3 i
+离析 10 vn
+离析分崩 3 n
+离析涣奔 3 i
+离校 39 n
+离格 3 n
+离格儿 3 n
+离河 3 ns
+离海 3 ns
+离狱 3 v
+离瓣花冠 3 n
+离石 65 n
+离石区 3 n
+离石县 16 ns
+离石市 2 ns
+离离拉拉 3 nz
+离离矗矗 3 v
+离索 3 v
+离线 34 n
+离经叛道 22 i
+离经畔道 3 z
+离经辨志 3 n
+离群 17 n
+离群不居 3 i
+离群索居 18 ns
+离职 233 v
+离聚 3 v
+离蔬释屩 3 i
+离蔬释蹻 3 i
+离解 72 v
+离解热 3 n
+离谱 51 n
+离谱儿 7 n
+离质体 3 n
+离身 3 v
+离轨 3 v
+离辙 3 n
+离过婚 3 v
+离退 4 v
+离退休 203 i
+离退休金 11 n
+离间 89 n
+离间计 7 n
+离队 50 n
+离题 11 n
+离题万里 7 i
+离骚 72 v
+离魂倩女 3 i
+离鸾别凤 3 i
+离鸾别鹄 3 i
+离鸾别鹤 3 i
+禽 334 n
+禽产品 2 n
+禽兽 225 n
+禽兽不如 3 n
+禽兽行为 3 n
+禽困覆车 3 n
+禽市 3 n
+禽息鸟视 3 n
+禽流感 298 n
+禽犊之爱 3 n
+禽畜 23 n
+禽类 38 n
+禽肉 14 n
+禽肥 3 n
+禽舍 2 n
+禽蛋 34 n
+禽饲 3 n
+禽鸟 38 n
+禾 1106 n
+禾嘉 4 nz
+禾场 3 n
+禾木旁 3 n
+禾本科 127 nz
+禾田 3 nz
+禾秆 9 n
+禾稻 3 n
+禾稼 3 n
+禾花雀 3 n
+禾苗 16 n
+禾草 53 n
+禾虫 3 n
+禾黍故宫 3 ns
+秀 1678 ag
+秀丽 910 a
+秀丽挺拔 3 nr
+秀出班行 3 n
+秀发 109 n
+秀城区 3 ns
+秀外慧中 9 nr
+秀女 11 n
+秀姑峦溪 3 nr
+秀媚 7 a
+秀安 3 a
+秀山 21 ns
+秀山土家族苗族自治县 2 ns
+秀屿 2 n
+秀屿区 3 ns
+秀屿港 3 ns
+秀屿镇 3 ns
+秀峰 7 n
+秀峰区 3 ns
+秀异分子 3 n
+秀才 594 n
+秀才人情 2 i
+秀才造反 3 i
+秀拔 3 n
+秀挺 4 a
+秀朗 3 a
+秀林 3 n
+秀气 65 n
+秀水 21 n
+秀水坪村 2 ns
+秀水明山 3 ns
+秀水杯 3 n
+秀水街 7 ns
+秀洲区 3 ns
+秀润 21 n
+秀眉 3 nr
+秀美 139 a
+秀而不实 3 i
+秀色 28 n
+秀色可餐 7 i
+秀英 18 nr
+秀英区 3 nr
+秀逸 27 a
+秀里秀气 3 n
+秀雅 38 a
+私 1908 ag
+私下 443 n
+私下交易 3 n
+私下地 3 n
+私下里 158 n
+私买 3 v
+私事 221 n
+私交 48 b
+私产 158 n
+私人 2443 n
+私人交情 3 n
+私人企业 3 j
+私人侦探 3 n
+私人关系 3 n
+私人化 10 n
+私人占有制 3 n
+私人天地 3 n
+私人帐户 3 n
+私人性 3 n
+私人教师 3 n
+私人机关 3 n
+私人机构 3 n
+私人物品 3 n
+私人生活 3 n
+私人秘书 3 n
+私人访问 3 n
+私人资本 3 n
+私仇 42 n
+私价 3 n
+私企 43 j
+私会 3 n
+私信 1061 n
+私债 3 n
+私允 3 a
+私党 17 n
+私养 3 n
+私函 3 n
+私分 33 n
+私刑 7 n
+私利 286 a
+私刻 5 d
+私务 3 n
+私募 33 a
+私卖 19 v
+私占 3 v
+私印 3 n
+私名号 3 n
+私吞 11 v
+私吞公款 3 n
+私售 3 vn
+私商 22 n
+私囊 10 n
+私图 16 n
+私地 3 n
+私塾 177 n
+私增 3 v
+私处 3 n
+私大 3 a
+私奔 71 v
+私娼 5 n
+私字当头 3 l
+私学 3 n
+私宅 38 n
+私定终身 3 n
+私宰 3 v
+私家 201 n
+私家侦探 3 n
+私家园林 3 n
+私家花园 3 n
+私家菜 3 n
+私家车 18 n
+私家轿车 3 n
+私密 31 a
+私密性 18 n
+私带 3 n
+私库 3 n
+私底下 43 n
+私弊 2 n
+私德 4 n
+私心 208 n
+私心杂念 16 n
+私念 7 n
+私怨 33 n
+私恩小惠 3 i
+私情 147 n
+私惠 3 vn
+私意 3 n
+私愤 4 a
+私愿 3 n
+私房 60 n
+私房照 3 n
+私房话 15 n
+私房钱 90 n
+私拿 3 v
+私放罪犯 3 n
+私斗 3 vn
+私方 3 n
+私有 466 b
+私有制 338 n
+私有化 140 n
+私有土地 3 n
+私有地 3 n
+私有权 29 n
+私有财产 3 l
+私服 3 n
+私服地址 3 n
+私服网 3 n
+私枭 6 n
+私欲 45 n
+私欲膨胀 3 l
+私法 21 n
+私活 8 vn
+私淑 11 a
+私淑弟子 3 i
+私生 3 n
+私生女 8 n
+私生子 149 n
+私生活 79 n
+私用 18 n
+私用词 3 n
+私益 3 n
+私盐 57 n
+私相 3 n
+私相传授 3 n
+私相授受 9 l
+私立 193 b
+私立中学 3 n
+私立学校 3 n
+私立高中 3 n
+私章 2 n
+私线 3 n
+私罚 3 vn
+私聊 3 a
+私股 5 n
+私自 290 d
+私自同意 3 i
+私自答应 3 i
+私船 3 n
+私营 752 b
+私营企业 3 n
+私营化 3 n
+私营成分 3 n
+私营经济 3 n
+私营部门 3 n
+私蓄 23 n
+私藏 54 n
+私藏枪支 3 n
+私见 9 a
+私言切语 3 i
+私议 13 n
+私设 26 vn
+私设公堂 3 n
+私访 10 v
+私访记 3 n
+私话 18 n
+私语 49 n
+私财 41 n
+私货 20 n
+私贩 3 n
+私费 3 vn
+私车 10 n
+私运 3 n
+私逃 17 v
+私通 87 a
+私邸 15 n
+私酒 3 n
+私酿 3 v
+私钥 3 n
+私销 3 vn
+私隐 3 v
+私隐权 3 n
+秃 780 a
+秃光光 3 n
+秃发 3 v
+秃发症 3 n
+秃头 164 n
+秃子 74 n
+秃宝盖 3 n
+秃尾 3 n
+秃山 4 n
+秃岭 10 n
+秃杉 10 n
+秃树 3 n
+秃毛 3 n
+秃疮 20 n
+秃石 3 n
+秃秃 3 z
+秃笔 3 n
+秃笔翁 3 n
+秃落 3 n
+秃顶 53 n
+秃驴 3 n
+秃鹫 28 n
+秃鹰 22 n
+秃鹳 3 n
+秅 20 zg
+秆 159 ng
+秆子 16 n
+秆黑粉病 3 n
+秉 306 v
+秉借 3 v
+秉公 68 n
+秉公任直 3 n
+秉公办事 3 n
+秉公办理 3 n
+秉公处理 3 n
+秉公执法 13 n
+秉公无私 3 i
+秉公灭私 3 i
+秉公而断 3 i
+秉性 150 n
+秉性难移 4 i
+秉承 127 v
+秉承旨意 3 n
+秉持 27 v
+秉持着 3 n
+秉政 17 n
+秉政劳民 3 n
+秉文兼武 3 i
+秉文经武 3 n
+秉正 3 d
+秉正无私 3 i
+秉烛 53 n
+秉烛夜游 3 i
+秉烛夜行 3 i
+秉烛夜读 3 i
+秉烛夜谈 3 i
+秉烛待旦 3 i
+秉直 3 d
+秉着 3 v
+秉笔 120 v
+秉笔直书 2 i
+秉节持重 3 n
+秉要执本 3 n
+秉赋 54 n
+秉钧 3 i
+秉钧当轴 3 i
+秉钧持轴 3 i
+秉风 3 n
+秋 2855 t
+秋之菊 2 nr
+秋事 3 n
+秋交会 3 n
+秋令 3 n
+秋儿 41 t
+秋兰 2 nr
+秋兰姆 2 nr
+秋冬 39 t
+秋冬之交 4 l
+秋冬养 2 nr
+秋冬季 19 t
+秋冬少 2 nr
+秋冬尤 2 nr
+秋冬种 3 t
+秋冬装 3 nr
+秋决 4 v
+秋凉 13 nr
+秋凉时节 3 nr
+秋刀鱼 2 nr
+秋分 29 n
+秋分点 5 n
+秋初 2 t
+秋千 105 nr
+秋千架 16 nr
+秋去冬 3 nr
+秋去秋来 3 nr
+秋叶 13 t
+秋叶原 3 nr
+秋叶呀 3 nr
+秋后 73 t
+秋后算帐 9 n
+秋后算账 19 l
+秋味 3 n
+秋四官 2 nr
+秋地 3 n
+秋声 3 nr
+秋声赋 5 nr
+秋处露 2 nr
+秋夜 50 t
+秋大梦 3 nr
+秋天 713 t
+秋天里 3 nr
+秋子姐 3 nr
+秋子梨 2 nr
+秋季 457 t
+秋季旅行 3 n
+秋实春华 3 nz
+秋审 256 n
+秋尽冬 5 nr
+秋山萧寺 2 nr
+秋山行旅 3 nz
+秋庄稼 31 n
+秋征 3 nr
+秋思 3 nr
+秋意 6 n
+秋意已浓 3 l
+秋意浓 3 nr
+秋成 3 nr
+秋扇 3 n
+秋扇见捐 3 i
+秋播 21 nr
+秋播作物 3 n
+秋收 137 nr
+秋收东藏 3 nr
+秋收作物 3 l
+秋收冬藏 3 nr
+秋收季节 3 n
+秋收起义 103 l
+秋日 39 t
+秋晨 3 t
+秋景 13 n
+秋暮 2 t
+秋月 22 t
+秋月寒江 3 nr
+秋月明 2 nr
+秋月春花 3 nr
+秋月春风 2 nr
+秋月白 2 nr
+秋末 32 t
+秋末冬 12 t
+秋梦痕 3 nr
+秋残 3 v
+秋毫 16 nr
+秋毫不犯 3 i
+秋毫之末 2 i
+秋毫勿犯 3 i
+秋毫无犯 63 i
+秋毫见捐 3 i
+秋气 3 n
+秋水 205 nr
+秋水仙碱 13 n
+秋水仙素 3 nr
+秋水伊人 3 nr
+秋水共长天一色 5 i
+秋水盈盈 3 nr
+秋汛 54 nr
+秋江渔 4 nr
+秋波 50 nr
+秋波横溢 3 i
+秋波盈盈 3 nr
+秋津洲 2 nr
+秋海棠 22 nr
+秋游 13 n
+秋灌 3 nr
+秋点兵 3 nr
+秋熟 2 nr
+秋燥 15 nr
+秋爽斋 9 nr
+秋玫瑰 3 nr
+秋瑾 33 nr
+秋田 39 nr
+秋田县 7 nr
+秋白梨 2 nr
+秋种 7 n
+秋窗秋 2 nr
+秋粮 28 n
+秋纹笑 6 nr
+秋老虎 6 nr
+秋耕 2 nr
+秋色 49 n
+秋色宜人 3 l
+秋色平分 3 l
+秋节 3 t
+秋花艳 2 nr
+秋苗 2 n
+秋荼密网 3 n
+秋菜 3 n
+秋葵 3 n
+秋虫 3 n
+秋蝉 3 nr
+秋行夏令 3 nr
+秋衣 5 n
+秋装 2 n
+秋裤 3 n
+秋试 3 n
+秋里 11 t
+秋闱 8 nr
+秋闱榜 2 nr
+秋雨 75 nr
+秋雨绵绵 3 nr
+秋霜 19 nr
+秋露 4 t
+秋露白 4 nr
+秋风 184 nr
+秋风团扇 3 i
+秋风扫叶 3 i
+秋风扫落叶 25 i
+秋风纨扇 3 v
+秋风落叶 3 i
+秋风过耳 2 l
+秋香 4 nr
+秋香绿 2 nr
+秋香色 5 nr
+秋高气和 3 nz
+秋高气爽 18 i
+秋高气肃 3 nr
+秋高马肥 3 nr
+种 20538 m
+种下祸根 3 i
+种业 22 n
+种仁 25 nr
+种俊德 4 nr
+种元素 5 nr
+种兔 3 n
+种公鹿 2 nr
+种养 31 n
+种养业 3 n
+种养加 3 nr
+种军阵 2 nr
+种别 17 n
+种勋贵 3 nr
+种因 3 n
+种地 182 n
+种城邦 32 nr
+种域 3 n
+种天然 2 nr
+种姓 358 n
+种子 2039 n
+种子仓库 3 n
+种子休眠 3 nr
+种子公司 6 n
+种子园 3 nr
+种子容重 3 l
+种子岛 7 nr
+种子数 3 n
+种子检验 3 n
+种子法 7 n
+种子活力 3 n
+种子消毒 3 n
+种子田 3 nr
+种子粮 3 n
+种子选手 37 n
+种子鉴定 3 n
+种子队 3 n
+种宣抚 6 nr
+种富豪 2 nr
+种尼格 6 nr
+种属 254 n
+种差 3 n
+种帅 14 n
+种师 3 n
+种师道 220 nr
+种广布 2 nr
+种庄田 4 nr
+种建制 2 nr
+种得 3 v
+种德堂 2 nr
+种性 3 n
+种户 3 n
+种数 43 n
+种族 1136 n
+种族主义 101 n
+种族主义者 5 n
+种族政策 3 n
+种族歧视 92 l
+种族灭绝 3 l
+种族问题 3 n
+种族隔离 3 n
+种果 8 n
+种树 42 n
+种桑养 5 nr
+种桑养蚕 3 nr
+种棉 9 n
+种植 3084 v
+种植业 284 n
+种植义齿 3 n
+种植体 3 n
+种植制度 3 n
+种植区 14 n
+种植园 188 n
+种植园主 36 n
+种植场 3 n
+种植桩 3 n
+种植者 4 n
+种植设计 3 n
+种概念 3 l
+种榆仙 3 nr
+种泳湍 2 nr
+种源 2 n
+种牛 11 n
+种牛痘 9 n
+种猪 20 n
+种猪场 7 n
+种玉蜂 2 nr
+种球 3 n
+种瓜 3 n
+种瓜得瓜 17 n
+种田 130 n
+种田人 9 nr
+种田人家 3 l
+种甲胺 2 n
+种畜 8 n
+种畜场 5 n
+种痘 3 n
+种皮 46 n
+种祸 3 n
+种禽 4 n
+种种 3344 q
+种种原因 3 n
+种稻 23 n
+种类 4950 n
+种类物 3 n
+种类表 3 n
+种籽 23 n
+种籽之 2 nr
+种粮 16 n
+种系 3 n
+种系发生 3 n
+种羊 2 n
+种群 291 n
+种肥 3 n
+种花 27 n
+种花人 3 n
+种花草 3 n
+种苗 25 n
+种草 17 n
+种菜 184 n
+种蛋 5 n
+种蝇 2 n
+种豆 3 n
+种豆得豆 14 n
+种质 354 n
+种过 3 v
+种颜色 3 nr
+种马 12 n
+种马场 3 n
+种鳞均 2 nr
+种鸟 2 n
+种鸡 7 n
+种鸽 3 n
+种麦 2 n
+种麦子 3 nr
+种麻 10 n
+种龟 3 n
+秏 3 zg
+科 7098 n
+科一科 3 nr
+科三友 2 nr
+科主任 3 n
+科丽蝇 2 nr
+科举 1019 n
+科举制 41 n
+科举制度 3 n
+科举考试 3 n
+科乐美 3 nr
+科亚 4 ns
+科什 7 nrt
+科介 2 n
+科以 3 nr
+科仪 6 n
+科任 3 n
+科伊 8 nrt
+科伊桑 22 nrt
+科伦坡 56 nr
+科伦泰 2 nr
+科伯恩 5 nr
+科佩尔 2 nr
+科佩特 4 nr
+科依桑 4 nr
+科克 31 nrt
+科克伦 2 nr
+科克托 4 nr
+科克斯 2 nr
+科克湾 2 nr
+科克罗 4 nr
+科克群岛 3 ns
+科克莱 2 nr
+科克郡 2 nr
+科克雷尔 2 nrt
+科兰太 3 nr
+科兴 3 ns
+科兹洛夫 4 nrt
+科内 34 nrt
+科内塞 3 nr
+科内泽 4 nr
+科刑 3 n
+科利 40 n
+科利华 4 nr
+科利奥 2 nrt
+科利姆 6 nr
+科利尼 5 nr
+科利纳 5 nr
+科别 3 n
+科力海 4 nr
+科勒曼 2 nr
+科协 49 j
+科协工作 3 n
+科南 4 ns
+科南特 2 nr
+科博会 3 nr
+科取士 21 n
+科名 3 n
+科员 109 n
+科因 4 n
+科场 73 n
+科坛 2 n
+科堡 6 ns
+科塔 8 nrt
+科塔萨尔 2 nrt
+科士达 3 nr
+科多韦斯 8 nrt
+科大 37 j
+科夫 71 nrt
+科夫卡 7 nr
+科夫斯 2 nr
+科夫斯基 31 nrt
+科头箕踞 3 i
+科头跣足 3 i
+科奇曼 3 nr
+科姆 8 nrt
+科委 74 n
+科威尔 3 nr
+科威特 265 nr
+科威特人 4 nrt
+科威特国 3 ns
+科威特尔 3 nrt
+科威特政府 3 nt
+科威特队 3 n
+科孚岛 5 nr
+科学 13460 n
+科学万能 3 n
+科学主义 11 n
+科学事业 3 n
+科学仪器 3 n
+科学依据 4 l
+科学共产主义 12 n
+科学内涵 3 n
+科学决策 3 n
+科学出版社 12 nt
+科学分析 3 l
+科学化 115 n
+科学发明 3 n
+科学史 58 n
+科学合理 6 n
+科学园区 3 n
+科学园地 3 n
+科学城 17 nr
+科学基金 3 n
+科学奖 46 n
+科学子析 3 n
+科学学 13 n
+科学安排 3 n
+科学实践 3 l
+科学实验 4 n
+科学宫 3 nr
+科学家 2789 n
+科学幻想 3 n
+科学态度 3 n
+科学性 169 n
+科学技术 2324 n
+科学技术委员会 3 nt
+科学技术部 18 nt
+科学报 5 n
+科学教案 3 n
+科学时代 3 n
+科学普及 3 nr
+科学杂志 3 n
+科学楼 3 n
+科学界 114 n
+科学知识 3 n
+科学研究 49 n
+科学研究部 2 nt
+科学种田 3 n
+科学管理 26 n
+科学系 8 n
+科学素养 3 n
+科学网 3 n
+科学考察 3 n
+科学著作 3 n
+科学规范 3 n
+科学计算 15 n
+科学认识 3 n
+科学论坛 3 n
+科学论文 3 n
+科学论断 3 l
+科学论证 3 n
+科学试验 3 n
+科学课 3 n
+科学运作 3 n
+科学部 13 n
+科学院 986 n
+科学馆 10 n
+科宁汉姆 4 nr
+科室 175 n
+科察举 2 n
+科尔 124 nrt
+科尔内 4 nrt
+科尔努 2 nr
+科尔劳 2 nrt
+科尔多凡 73 nrt
+科尔多瓦 35 nrt
+科尔多瓦省 3 nrt
+科尔察 6 nr
+科尔尼 4 nr
+科尔尼洛 5 nrt
+科尔居 2 nrt
+科尔希 6 nr
+科尔帕 3 nr
+科尔帕科 2 nrt
+科尔库 2 nr
+科尔德 2 nrt
+科尔托 4 nrt
+科尔曼 16 nr
+科尔武 2 nr
+科尔沁 40 nr
+科尔沁区 3 ns
+科尔沁右翼中旗 3 ns
+科尔沁右翼前旗 6 ns
+科尔沁左翼中旗 3 ns
+科尔沁左翼后旗 5 ns
+科尔沁沙地 6 ns
+科尔沁草原 22 ns
+科尔特 12 nrt
+科尔特斯 41 nrt
+科尔瓦 3 nrt
+科尔盖 6 nr
+科尔维勒 3 nrt
+科尔萨科 2 nrt
+科尔诺峰 2 nrt
+科尔贝 3 nr
+科尔顿 2 nrt
+科尼亚 11 ns
+科尼奇 2 nr
+科尼斯 3 nr
+科局 3 n
+科局级 2 b
+科层制 5 n
+科峰 2 n
+科工 9 n
+科工委 8 n
+科工贸 10 n
+科巴 18 n
+科布 10 n
+科布伦茨 5 nrt
+科布多 27 nrt
+科布顿 3 nrt
+科布鲁斯 5 nrt
+科希斯 4 nr
+科希策 3 nr
+科帕 5 n
+科平原 2 ns
+科幻 80 n
+科幻世界 3 n
+科幻小说 3 l
+科幻影片 3 n
+科幻性 3 n
+科幻片 8 n
+科幻电影 3 n
+科广布 2 nr
+科廊 24 n
+科影 2 n
+科德 18 nrt
+科德利 6 nr
+科德尔 6 nr
+科思 2 n
+科性 2 n
+科恩 68 nr
+科恰班巴 4 ns
+科扎 2 nrt
+科托 2 nrt
+科托努 25 nr
+科技 15691 n
+科技事业 3 n
+科技交流 3 n
+科技产业 3 n
+科技人员 60 n
+科技人才 3 n
+科技体制 3 n
+科技兴农 3 n
+科技兴邦 3 nt
+科技前沿 3 n
+科技动态 3 n
+科技化 2 n
+科技厅 8 n
+科技史 37 n
+科技司 8 n
+科技含量 3 n
+科技咨询 3 nt
+科技园 25 n
+科技园区 260 n
+科技图书 3 n
+科技型 17 n
+科技处 13 n
+科技大楼 3 n
+科技奖 7 n
+科技委 9 n
+科技实业 3 n
+科技局 15 n
+科技展 3 nt
+科技开发 3 nt
+科技强检 3 n
+科技情报 3 n
+科技成就 3 n
+科技成果 3 n
+科技战线 3 n
+科技报 8 n
+科技推广 3 nz
+科技支农 3 j
+科技攻关 3 n
+科技教育界 2 n
+科技日报 3 nz
+科技时代 3 n
+科技期刊 3 n
+科技热 3 n
+科技版 3 n
+科技界 55 n
+科技知识 3 n
+科技类 9 n
+科技网 3 n
+科技股 3 n
+科技股份 3 n
+科技节 3 n
+科技苑 3 n
+科技进步 3 n
+科技部 95 n
+科技部长 2 n
+科技队伍 3 n
+科技领域 3 n
+科技频道 3 n
+科技馆 31 n
+科报网 3 n
+科拉 29 nrt
+科拉东 2 ns
+科拉才 2 nr
+科拉斯 2 nrt
+科拉松 4 nr
+科拉水 4 nr
+科拉湾 2 ns
+科拉迪 48 nr
+科拿 2 ns
+科摩 7 nrt
+科摩罗 61 nr
+科教 302 n
+科教兴农 7 nr
+科教兴国 82 ns
+科教兴市 257 ns
+科教兴林 3 nr
+科教卫 3 nr
+科教司 3 n
+科教园 3 n
+科教处 4 n
+科教性 3 n
+科教文 9 nr
+科教文卫 18 nr
+科教文卫体 3 n
+科教片 11 n
+科教片儿 3 n
+科教组 3 n
+科教部 3 n
+科文 5 n
+科文特 5 nr
+科斯 54 nrt
+科斯塔 25 nrt
+科斯岛 17 ns
+科斯托夫 3 nrt
+科斯明斯 2 nrt
+科斯特 5 nrt
+科斯米 3 nrt
+科斯纳 5 nr
+科斯蒂 16 nr
+科斯雷 3 nr
+科昆虫 33 nr
+科明科 12 nr
+科春闱 2 nr
+科普 297 nrt
+科普兰 2 nr
+科普利 19 nr
+科普性 2 n
+科普活动 3 n
+科普特 13 nr
+科普特人 10 nrt
+科普知识 3 n
+科普网 3 nz
+科普读物 3 n
+科普部 4 n
+科普馆 2 nr
+科曼 4 nrt
+科曼奇 3 nr
+科曼德 2 nr
+科林 4 n
+科林伍德 3 nrt
+科林巴 5 nr
+科林托 2 nr
+科林斯 258 nr
+科林斯式 3 nz
+科林蒂安 6 nrt
+科林蒂安队 2 nz
+科柯施 2 nr
+科格斯 2 nr
+科比 464 j
+科比案 3 n
+科比福 2 nr
+科氏力 2 nr
+科沃 10 nrt
+科波 13 n
+科波菲 8 nr
+科泰 5 nz
+科泽科 11 nr
+科洛奇 2 nr
+科洛封 48 nr
+科洛尔 42 nr
+科洛尼亚 2 ns
+科洛斯 8 nr
+科洛诺斯 2 nrt
+科海 5 ns
+科涅夫 2 nr
+科特 17 nrt
+科特兰 2 nr
+科特勒 6 nr
+科特尼 3 nr
+科特布斯队 2 n
+科特曼 4 nr
+科特迪瓦 156 nrt
+科王 3 nrt
+科珀 2 nrt
+科班 56 n
+科班出身 25 n
+科瑟尔 4 nrt
+科瓦奇 8 nr
+科瓦尔 2 nr
+科瓦尼 2 nr
+科瓦鲁 2 nr
+科甲 4 n
+科登第 3 nr
+科益 12 n
+科盟 2 n
+科目 921 n
+科目组 3 n
+科目表 3 n
+科盲 3 n
+科眩倡识 3 vn
+科睿 3 nrt
+科研 3204 n
+科研专家 3 n
+科研人员 16 n
+科研任务 3 n
+科研区 2 n
+科研单位 5 n
+科研型 9 n
+科研处 4 nt
+科研室 3 n
+科研工作 6 n
+科研开发 3 nt
+科研成果 3 n
+科研所 30 nt
+科研机构 3 n
+科研活动 3 n
+科研社 3 nt
+科研经费 3 n
+科研课题 3 n
+科研部 3 nt
+科研部门 3 n
+科研院所 42 nt
+科研项目 3 n
+科科斯 3 nr
+科科斯岛 3 nrt
+科科河 2 nr
+科科申 13 nr
+科科长 3 n
+科穆宁 10 nr
+科第 5 nr
+科米 9 nrt
+科米诺 2 nr
+科系 3 n
+科索沃 428 nr
+科索沃省 3 ns
+科级 38 n
+科纳克西 3 nrt
+科纳克里 25 nrt
+科纳布 2 nr
+科组 3 n
+科维利 2 nr
+科维奇 14 nr
+科维尔 5 nr
+科罗 2 nrt
+科罗娜 2 nr
+科罗尔 3 nr
+科罗拉多 61 nrt
+科罗拉多州 30 ns
+科罗拉多河 39 ns
+科罗斯 2 nr
+科罗曼 2 nr
+科罗曼德尔 2 nrt
+科罗纳 3 nr
+科罗纳多 5 nrt
+科罚 3 n
+科考 74 nr
+科考船 3 n
+科考队 17 n
+科联 8 ns
+科股 3 n
+科臣 5 n
+科臼 3 ns
+科良基 3 nr
+科苏特 6 nr
+科英布 3 nr
+科英布拉 2 nrt
+科茨 3 nrt
+科莫 9 nrt
+科莫湖 5 nr
+科莱 5 nrt
+科莱克 2 nr
+科莱克斯 4 nrt
+科菲 2 nrt
+科萨 7 nrt
+科萨人 10 nrt
+科萨切夫 3 nrt
+科萨尔 4 nr
+科萨科 5 nr
+科萨科夫 6 nrt
+科蒂 2 nrt
+科蛙属 6 nr
+科西 6 ns
+科西加 4 ns
+科西嘉 44 nr
+科西嘉人 8 nr
+科西嘉岛 3 ns
+科西莫 6 nr
+科言官 7 n
+科讯网 3 n
+科贝特 3 nrt
+科贸 5 n
+科赫尔斯 2 nrt
+科达 25 nrt
+科达伊 5 nrt
+科达里 2 nrt
+科连特斯 8 nrt
+科迪亚 3 nr
+科迪亚克 3 nrt
+科迪亚克岛 9 nrt
+科迪勒拉 55 nrt
+科道官 4 nr
+科道言 4 nr
+科里 48 nrt
+科里亚 12 nrt
+科里纳 3 nrt
+科长 1082 n
+科阿韦 2 nr
+科际 3 n
+科院基 2 nr
+科隆 256 nr
+科隆大教堂 14 nt
+科隆市 2 ns
+科隆队 3 n
+科雅罗 6 nr
+科雷乔 8 nr
+科雷亚 2 nr
+科雷利 2 nr
+科雷希 4 nr
+科雷马 3 nr
+科顺天 2 nr
+科顿 3 nrt
+科马罗夫 4 nrt
+科鲁尼 6 nr
+科鲁巴尔 2 nrt
+科鹰属 2 nr
+科龙电器 74 nz
+秒 3981 m
+秒左右 3 v
+秒数 3 n
+秒杀 3 n
+秒表 15 n
+秒针 16 n
+秒钟 280 n
+秕 11 n
+秕子 3 n
+秕政 3 n
+秕糠 3 n
+秕言谬说 3 n
+秕谷 2 n
+秗 7 zg
+秘 1016 n
+秘不示人 9 n
+秘书 2921 n
+秘书党 3 n
+秘书台 3 n
+秘书处 176 n
+秘书学 3 n
+秘书官 3 n
+秘书室 33 n
+秘书局 2 n
+秘书科 4 n
+秘书组 3 n
+秘书网 3 n
+秘书长 5821 n
+秘事 16 n
+秘传 58 n
+秘使 3 n
+秘史 91 n
+秘商 3 n
+秘奥 3 ns
+秘宗 3 n
+秘宝 9 n
+秘室 9 n
+秘密 3833 n
+秘密会晤 3 v
+秘密会议 3 n
+秘密性 3 n
+秘密情感 3 n
+秘密文件 3 n
+秘密武器 3 n
+秘密活动 3 n
+秘密社会 3 n
+秘密组织 3 nt
+秘密行动 3 n
+秘密警察 3 n
+秘府 4 n
+秘技 13 n
+秘方 121 n
+秘旨 3 n
+秘本 20 n
+秘洞 3 n
+秘窗 3 n
+秘笈 174 n
+秘籍 66 n
+秘约 3 n
+秘而不宣 26 i
+秘而不言 3 i
+秘而不露 3 i
+秘药 30 n
+秘藏 14 ns
+秘要 3 n
+秘诀 326 n
+秘闻 29 n
+秘鲁 563 ns
+秘鲁人 10 n
+秘鲁共和国 2 ns
+秘鲁政府 5 nt
+秘鲁队 4 n
+秙 24 zg
+租 2067 v
+租下 25 v
+租下来 3 v
+租与 25 v
+租书 3 n
+租价 8 n
+租佃 178 v
+租佃关系 3 n
+租佃制 16 n
+租住 24 v
+租借 155 v
+租借人 3 n
+租借地 161 n
+租借费 3 n
+租入 3 v
+租凭 3 v
+租出 3 v
+租出去 3 v
+租厂房 3 n
+租去 3 v
+租售 4 v
+租售店 3 n
+租售网 3 n
+租地 371 n
+租契 3 n
+租子 3 n
+租客 3 n
+租屋 3 n
+租屋人 3 n
+租庸调 3 n
+租息 3 n
+租成 3 v
+租户 8 n
+租房 120 n
+租房子 3 n
+租房网 3 n
+租放 3 v
+租方 3 n
+租期 26 n
+租片 3 n
+租用 175 v
+租用者 3 n
+租用费 3 n
+租界 610 n
+租税 122 n
+租税转嫁 3 n
+租籍 3 n
+租米 3 n
+租约 40 n
+租给 55 v
+租船 18 n
+租船费 3 n
+租让 21 v
+租贷 3 n
+租贷人 3 n
+租费 11 n
+租赁 361 v
+租赁业 3 n
+租赁制 3 n
+租赁契约 3 n
+租赁承包 3 n
+租赁期 3 n
+租赁经营 3 n
+租赁者 3 n
+租赁费 5 n
+租起 3 v
+租起来 3 v
+租车 47 n
+租车费 3 n
+租过 3 v
+租金 270 n
+租钱 3 v
+租额 3 n
+秣 51 g
+秣料 3 i
+秣马 3 i
+秣马厉兵 4 i
+秤 329 n
+秤不离砣 3 n
+秤坨 3 n
+秤平斗满 3 n
+秤斤注两 3 n
+秤星 3 n
+秤杆 29 n
+秤毫 3 n
+秤盘 9 n
+秤盘子 3 n
+秤砣 22 n
+秤纽 3 n
+秤量 3 n
+秤钩 13 n
+秤锤 20 n
+秤锤落井 3 n
+秦 2837 nr
+秦三国 3 ns
+秦业 5 n
+秦东 3 ns
+秦东向 2 nr
+秦东颖 2 nr
+秦丞相 3 nr
+秦丰农业 4 nt
+秦之机 3 nr
+秦乘燕 3 nr
+秦九韶 29 nr
+秦书田 192 nr
+秦二世 75 nr
+秦二叔 2 nr
+秦二学士 2 nr
+秦二州 3 nr
+秦云飞 115 nr
+秦云龙 11 nr
+秦五哥 3 nr
+秦五城 2 nr
+秦仁昌 3 nr
+秦从孝 2 nr
+秦从雍 4 nr
+秦代 172 t
+秦仲子 2 nr
+秦仲文 2 nr
+秦伟帮 3 nr
+秦伟邦 29 nr
+秦伯未 2 nr
+秦伯益 5 nr
+秦侃滢 2 nr
+秦俑学 2 n
+秦先儿 9 nr
+秦克湖 256 nr
+秦入晋 2 nr
+秦入豫 2 nr
+秦兵马俑 3 nr
+秦军 126 nr
+秦军乘 2 nr
+秦军交 2 nr
+秦军军 2 nr
+秦军射 2 nr
+秦军弩 2 nr
+秦军略 2 nr
+秦军进 2 nr
+秦凤军 16 nr
+秦凤路 4 nr
+秦剑含 2 nr
+秦力山 8 nr
+秦华卿 10 nr
+秦华孙 24 nr
+秦占有 3 nr
+秦去尘 2 nr
+秦又南 3 nr
+秦及汉 9 nr
+秦叔宝 17 nr
+秦可卿 27 nr
+秦司令 2 nr
+秦司马错 2 nr
+秦后来 4 nr
+秦和赵 3 nr
+秦商鞅 9 nr
+秦国 257 ns
+秦国国君 2 nr
+秦国富强 3 nr
+秦城 3 ns
+秦城区 3 ns
+秦城监狱 4 nt
+秦基伟 283 nr
+秦大人 8 nr
+秦大哥 7 nr
+秦大河 3 nr
+秦天 2 t
+秦太学 2 nr
+秦太虚 2 nr
+秦夫人 2 nr
+秦失其鹿 3 nr
+秦妇吟 4 nr
+秦始皇 668 nr
+秦始皇帝 10 nr
+秦始皇陵 62 nr
+秦娟 3 nrfg
+秦孝公 23 nr
+秦学正 8 nr
+秦安 328 nr
+秦安北 6 ns
+秦安县 8 ns
+秦安媳妇 18 nr
+秦安心 2 nr
+秦安拉 2 nr
+秦安背 3 nr
+秦安能 2 nr
+秦宗权 8 nr
+秦宝宝 3 nr
+秦家寨 31 nr
+秦家庄 6 nr
+秦家或 2 nr
+秦家洲 256 ns
+秦富功 17 nr
+秦寡妇 2 nr
+秦将王 3 nr
+秦小官 5 nr
+秦少游 8 nr
+秦属南 256 ns
+秦属闽 2 nr
+秦山 39 ns
+秦山核电站 18 nt
+秦岭 687 nr
+秦岭山脉 19 ns
+秦岭隧道 3 n
+秦川 26 ns
+秦川发展 5 nt
+秦川牛 4 nr
+秦州 34 ns
+秦巴山区 2 ns
+秦巽衡 19 nr
+秦广王 2 nr
+秦庄公 6 nr
+秦庄襄 3 nr
+秦庄襄王 5 nr
+秦庆武 3 nr
+秦庆童 2 nr
+秦庭之 3 nr
+秦庭之哭 3 nr
+秦建 2 ns
+秦开破 3 nr
+秦开袭 3 nr
+秦律中 2 nr
+秦德公 2 nr
+秦德文 2 nr
+秦德润 6 nr
+秦德纯 2 nr
+秦德让 2 nr
+秦必楚 4 nr
+秦思民 40 nr
+秦恩复 2 nr
+秦惠文 20 nr
+秦惠王 14 nr
+秦成勇 2 nr
+秦攻魏 3 nr
+秦文君 3 nr
+秦日纲 11 nr
+秦明力 2 nr
+秦明勒 2 nr
+秦明回 3 nr
+秦明带 2 nr
+秦明引 6 nr
+秦明得 2 nr
+秦明怒 4 nr
+秦明战 3 nr
+秦明放 2 nr
+秦明见 5 nr
+秦明领 2 nr
+秦昭王 50 nr
+秦昭襄 7 nr
+秦晋 30 t
+秦晋之好 6 nr
+秦晋之缘 3 nr
+秦晋二 6 nr
+秦晋冀 2 nr
+秦晋滇 2 nr
+秦晋豫 2 nr
+秦景教 9 nr
+秦曼卿 40 nr
+秦朗引 2 nr
+秦朝 100 t
+秦朝人 3 nr
+秦末 12 t
+秦末楚 3 nr
+秦末汉 7 nr
+秦末英 2 nr
+秦校长 9 nr
+秦桂兰 3 nr
+秦桢凯 2 nr
+秦桧 215 nr
+秦桧制造 5 nr
+秦桧害 3 nr
+秦桧死 5 nr
+秦椒 2 nr
+秦楼娃 3 nr
+秦楼楚馆 4 nr
+秦欢晋爱 3 nr
+秦武公 4 nr
+秦武王 15 nr
+秦氏恭 3 nr
+秦氏笑 4 nr
+秦汉 596 nr
+秦汉唐 2 nr
+秦池 3 nr
+秦沈专线 3 nr
+秦河 101 ns
+秦海璐 3 nr
+秦淮 49 nr
+秦淮书 4 nr
+秦淮区 11 ns
+秦淮惊 3 nr
+秦淮河 116 ns
+秦牧 7 nr
+秦牧散 2 nr
+秦玉兰 2 nr
+秦玉琴 3 nr
+秦王 381 nr
+秦界至 2 nr
+秦皇 13 nr
+秦皇岛 153 nr
+秦皇岛市 36 ns
+秦皇岛港 16 ns
+秦皇帝 3 nr
+秦皇汉 10 nr
+秦直道 2 nr
+秦相公 6 nr
+秦相吕 4 nr
+秦相邦 2 nr
+秦督郑 3 nr
+秦砖汉 7 nr
+秦破燕 3 nr
+秦祁昆 2 nr
+秦祥林 3 nr
+秦秀英 5 nr
+秦穆公 16 nr
+秦简公 2 nr
+秦简夫 4 nr
+秦篆 6 n
+秦红棉 78 nr
+秦纪 2 t
+秦经理 4 nr
+秦置南 256 nr
+秦置吴 2 nr
+秦置山 2 nr
+秦置延 2 nr
+秦置阳 2 nr
+秦老五 8 nr
+秦耐之 39 nr
+秦腔 328 n
+秦腔戏 9 n
+秦自献 3 nr
+秦至唐 4 nr
+秦至楚 2 nr
+秦舟船 2 nr
+秦良引 2 nr
+秦良玉 119 nr
+秦艺源 5 nr
+秦艽 9 nr
+秦艽汤 2 nr
+秦蜀行 2 nr
+秦蜀郡 3 nr
+秦行音 2 nr
+秦裕伯 3 nr
+秦襄公 6 nr
+秦观诗 2 nr
+秦论 2 n
+秦诸州 2 ns
+秦逸生 3 nr
+秦邦宪 12 nr
+秦都 10 ns
+秦都区 4 ns
+秦钟一一 2 nr
+秦钟笑 5 nr
+秦钟英 256 nr
+秦钟趁 2 nr
+秦镜高悬 3 nr
+秦长吏 2 nr
+秦长城 2 nr
+秦长老 3 nr
+秦长脚 2 nr
+秦长贵 3 nr
+秦阿姨 9 nr
+秦降卒 3 nr
+秦陵 11 nr
+秦隶 3 ns
+秦雍西 90 nr
+秦雪梅 5 nr
+秦震乐 2 nr
+秦震刚 4 nr
+秦震喊 2 nr
+秦震坐 2 nr
+秦震微微 3 nr
+秦震心 4 nr
+秦震忙 2 nr
+秦震想 5 nr
+秦震挥 2 nr
+秦震望 3 nr
+秦震朝 2 nr
+秦震派 2 nr
+秦震猛 2 nr
+秦震略 2 nr
+秦震转 3 nr
+秦震连 2 nr
+秦霸西 2 nr
+秦香莲 16 nr
+秦高平 3 nr
+秦鲸卿 4 nr
+秧 46 n
+秧子 10 n
+秧歌 149 n
+秧歌剧 5 n
+秧歌队 34 n
+秧田 4 n
+秧脚 3 n
+秧苗 28 n
+秧角 3 n
+秧鸡 2 n
+秧龄 3 n
+秩 340 zg
+秩和 3 n
+秩序 2935 n
+秩序井然 58 i
+秩序性 2 n
+秩边 3 n
+秫 16 n
+秫秸 29 n
+秫米 3 n
+秭 4 ns
+秭归 560 ns
+秭归县 269 ns
+秮 8 zg
+积 2440 v
+积不相能 3 i
+积为 3 v
+积久 3 ad
+积久弊生 3 n
+积习 94 v
+积习已久 3 i
+积习成俗 3 n
+积习生常 3 n
+积习难改 2 i
+积习难返 3 i
+积习难除 3 i
+积云 19 n
+积以为常 3 i
+积体 3 n
+积体电路 3 n
+积储 109 v
+积冰 9 v
+积分 742 ad
+积分下限 3 n
+积分冷风 3 l
+积分器 5 n
+积分学 24 n
+积分换 3 v
+积分控制 3 n
+积分榜 128 n
+积分法 3 n
+积分球 3 n
+积分电路 3 n
+积分算子 3 n
+积到 3 v
+积功兴业 3 n
+积劳 3 ad
+积劳成疾 27 i
+积劳成病 3 l
+积压 151 n
+积压产品 3 n
+积压品 3 n
+积压物资 3 n
+积厚成器 3 l
+积厚流光 3 n
+积善 13 ad
+积善余庆 3 i
+积善成德 3 i
+积土为山 3 i
+积土成山 3 i
+积垢 12 n
+积基树本 3 l
+积威 13 n
+积存 75 v
+积存多年 3 l
+积存已久 3 l
+积小成大 3 l
+积少成多 8 l
+积层云 3 n
+积岁累月 3 i
+积差相关 3 i
+积带 3 n
+积年 3 n
+积年累岁 3 l
+积年累月 4 l
+积弊 86 n
+积弊已久 3 n
+积弊已深 3 n
+积弊难返 3 n
+积弱 15 ad
+积弱不振 3 l
+积弱积贫 19 l
+积微成著 3 n
+积德 59 n
+积德累仁 3 ns
+积德累功 3 i
+积德累善 3 ns
+积德裕后 3 i
+积忧成疾 3 i
+积思广益 3 i
+积怨 43 v
+积恶余殃 3 n
+积愤 27 ad
+积攒 131 v
+积效 3 n
+积数 3 n
+积日累久 3 l
+积日累岁 3 l
+积日累月 3 i
+积时累日 3 l
+积木 53 n
+积本求原 3 n
+积极 8844 ad
+积极主动 3 n
+积极争取 3 l
+积极关注 3 l
+积极分子 51 n
+积极参与 3 i
+积极合作 3 n
+积极向上 32 l
+积极响应 3 n
+积极因素 3 n
+积极开展 3 l
+积极态度 3 n
+积极思考 3 l
+积极性 1476 n
+积极情绪 3 n
+积极意义 3 l
+积极探索 3 n
+积极支持 3 v
+积极约束 3 n
+积极行动 3 n
+积极论 3 n
+积极进取 3 l
+积案 8 n
+积案如山 3 i
+积案盈箱 3 n
+积欠 52 v
+积欠已久 3 i
+积毁销金 3 n
+积毁销骨 3 n
+积水 322 n
+积水为海 3 i
+积水成渊 3 l
+积水潭 10 n
+积沙成塔 2 n
+积沙成滩 3 n
+积液 3 n
+积淀 119 v
+积渐 3 l
+积温 653 n
+积满 29 v
+积满灰尘 3 i
+积灰 3 n
+积炭 5 n
+积犯 3 v
+积玉堆金 3 ns
+积甲如山 3 i
+积甲山齐 3 ns
+积痾 3 vn
+积石 29 n
+积石山 14 ns
+积石山保安族东乡族撒拉族自治县 4 ns
+积福 3 n
+积简充栋 3 i
+积粮 3 n
+积素累旧 3 i
+积累 2791 v
+积累区 3 ns
+积累基金 28 n
+积累性 14 n
+积累率 32 n
+积累资金 3 n
+积羞成怒 3 i
+积羽沉舟 3 i
+积聚 320 v
+积肥 4 n
+积草屯粮 9 i
+积蓄 542 n
+积薪厝火 3 z
+积血 9 v
+积讹成蠹 3 i
+积谗磨骨 3 i
+积谗糜骨 3 z
+积谷防饥 3 i
+积财千万 3 i
+积贫积弱 22 l
+积贮 3 v
+积郁 27 v
+积重不反 3 i
+积重不返 3 l
+积重难反 3 i
+积重难返 30 l
+积金 3 n
+积金累玉 3 i
+积铢累寸 3 n
+积雨 3 n
+积雨云 32 n
+积雪 607 n
+积雪囊萤 3 n
+积雪场 3 n
+积雪封霜 3 i
+积雪已深 3 i
+积雪草 3 n
+积露为波 3 i
+积非习贯 3 n
+积非成是 3 l
+积食 3 n
+称 26275 v
+称不上 3 v
+称不离锤 3 n
+称为 14328 v
+称之为 1685 v
+称体裁衣 3 n
+称体载衣 3 n
+称作 807 v
+称做 184 v
+称兄道弟 53 n
+称兵 3 v
+称出 3 v
+称功颂德 3 i
+称号 2930 n
+称叹 3 v
+称呼 1087 v
+称善 3 v
+称多县 3 nrt
+称奇 123 n
+称奇道绝 3 i
+称孤道寡 5 i
+称家有无 3 l
+称帝 846 n
+称庆 3 v
+称引 3 v
+称得上 249 v
+称得起 8 v
+称德度功 3 n
+称心 56 v
+称心如意 43 i
+称心快意 3 i
+称心满意 7 i
+称心遂愿 3 i
+称快 4 v
+称快一时 3 i
+称念 3 v
+称意 2 v
+称愿 3 v
+称手 3 v
+称扬 24 v
+称法 11 v
+称王 203 nrt
+称王称霸 20 i
+称病 59 v
+称称 5 v
+称羡 22 v
+称职 175 v
+称臣 140 n
+称臣纳贡 3 ns
+称觞 3 v
+称誉 55 n
+称许 35 v
+称谓 416 v
+称谓语 3 v
+称谢 103 v
+称贤荐能 3 vn
+称贷 3 v
+称赏 35 v
+称赏不已 3 l
+称赞 1123 v
+称身 5 v
+称述 3 v
+称道 253 v
+称重 15 v
+称重量 3 n
+称量 92 v
+称量瓶 3 n
+称钩风 3 n
+称雄 131 n
+称雨道晴 3 i
+称霸 196 v
+称霸一方 3 i
+称霸世界 3 n
+称霸全球 3 n
+称颂 200 v
+称颂一时 3 i
+秱 10 zg
+秴 9 zg
+秷 47 zg
+秸 101 n
+秸杆 5 n
+秸秆 131 n
+秸茎 3 n
+秹 9 zg
+秺 79 zg
+移 3331 v
+移上去 3 v
+移上来 3 v
+移下 3 v
+移下去 3 v
+移下来 3 v
+移东就西 3 n
+移东补西 3 n
+移交 411 v
+移位 112 n
+移位取代 3 n
+移位指令 3 n
+移位网 3 n
+移作 3 vn
+移入 93 v
+移出 19 v
+移出去 3 v
+移出来 3 vn
+移到 3 v
+移动 3838 vn
+移动主体 3 n
+移动信息 3 n
+移动力 3 n
+移动吊车 3 n
+移动式 26 n
+移动性 19 n
+移动机器人 4 n
+移动梦网 3 n
+移动游戏 10 n
+移动率 3 n
+移动用户 3 n
+移动电话 3 n
+移动硬盘 3 n
+移动网 7 n
+移动臂 3 n
+移动装置 3 n
+移动镜头 3 n
+移动靶 10 n
+移印机 3 n
+移去 3 v
+移向 3 v
+移商换羽 3 n
+移国动众 3 n
+移天徙日 3 i
+移天换日 3 i
+移天易日 3 i
+移孝为忠 3 n
+移孝作忠 3 n
+移审 3 vn
+移宫换羽 3 n
+移局 3 n
+移居 588 v
+移居入境 3 i
+移居国外 3 i
+移居某国 3 vn
+移居者 3 n
+移山 3 n
+移山倒海 7 i
+移山回海 3 i
+移山填海 2 i
+移山拔海 3 i
+移山竭海 3 i
+移山跨海 3 vn
+移山造海 3 n
+移师 43 n
+移开 3 v
+移开学 3 n
+移归 3 v
+移形换步 3 i
+移往 15 vn
+移徙 8 n
+移心移意 3 i
+移情 61 n
+移情别恋 3 v
+移情遣意 3 i
+移成 3 v
+移挪 3 v
+移掉 3 v
+移数 3 n
+移日卜夜 3 i
+移易 3 vn
+移易迁变 3 n
+移星换斗 3 i
+移有足无 3 i
+移来 3 v
+移栖 3 b
+移根换叶 3 i
+移根接叶 3 i
+移栽 36 v
+移植 999 v
+移植性 2 n
+移植手术 3 n
+移植术 12 n
+移植版 3 n
+移植物 10 n
+移樽 3 i
+移樽就教 3 i
+移步 81 vn
+移步换形 3 n
+移民 1231 n
+移民区 19 n
+移民城市 3 n
+移民局 13 n
+移民法 3 n
+移民部 3 n
+移气养体 3 n
+移注 3 v
+移液器 3 n
+移液管 7 n
+移灵 3 n
+移牧 3 vn
+移用 3 vn
+移的就箭 3 i
+移相器 5 n
+移码 3 n
+移种 3 n
+移缓就急 3 i
+移置 3 vn
+移至 3 v
+移船就岸 3 n
+移节 3 vn
+移花宫 3 n
+移花接木 21 i
+移苗 2 n
+移行 18 v
+移解 3 v
+移译 3 v
+移调 3 v
+移走 3 v
+移转 48 vn
+移转到 3 v
+移过去 3 v
+移过来 3 v
+移送 172 v
+移送起诉 3 i
+移送逮捕 3 vn
+移通 3 vn
+移错 3 v
+移锭 3 n
+移防 18 v
+移防部队 3 n
+移除 3 v
+移项 3 n
+移风崇教 3 i
+移风平俗 3 i
+移风振俗 3 i
+移风改俗 3 i
+移风易俗 23 n
+移风易尚 3 n
+移风革俗 3 n
+秼 5 zg
+秽 251 n
+秽乱 3 a
+秽史 3 n
+秽名 3 n
+秽土 5 n
+秽德垢行 3 vn
+秽德彰闻 3 n
+秽气 21 n
+秽浊 5 a
+秽物 3 n
+秽行 12 n
+秽言污语 3 n
+秽语 12 n
+秽迹 4 n
+秽闻 3 n
+秾 47 zg
+秾纤 3 v
+稀 1441 a
+稀世 84 n
+稀世之宝 3 nz
+稀世珍宝 3 i
+稀哩哗啦 3 z
+稀土 162 n
+稀土元素 58 l
+稀土矿 11 n
+稀土金属 23 n
+稀土钴 3 nz
+稀土钻 3 l
+稀奇 147 a
+稀奇事 3 n
+稀奇元素 3 l
+稀奇古怪 52 i
+稀客 19 n
+稀少 493 a
+稀巴烂 36 z
+稀性 3 n
+稀拉 3 ns
+稀拉拉 3 ns
+稀料 2 n
+稀有 530 v
+稀有元素 31 l
+稀有动物 3 l
+稀有性 5 n
+稀有气体 44 l
+稀有金属 91 n
+稀朗 3 a
+稀松 87 a
+稀树 14 n
+稀树草原 41 ns
+稀泥 23 n
+稀溜溜 3 z
+稀烂 121 a
+稀疏 353 a
+稀疏地 3 z
+稀盐酸 3 n
+稀硫酸 3 nz
+稀稀 3 a
+稀稀拉拉 35 z
+稀稀疏疏 14 z
+稀稀落落 46 z
+稀粥 30 n
+稀糟 3 z
+稀缺 168 a
+稀缺性 20 n
+稀缺资源 3 l
+稀罕 225 a
+稀罕物 8 n
+稀落 15 v
+稀薄 182 a
+稀释 222 v
+稀释剂 15 n
+稀释液 3 n
+稀释溶液 3 n
+稀释热 3 l
+稀里光当 3 z
+稀里呼噜 3 z
+稀里哗啦 31 z
+稀里糊涂 65 z
+稀里马虎 3 nz
+稀饭 396 n
+稂 13 g
+稂莠 3 i
+稂莠不齐 3 i
+稃 16 g
+稊 3 zg
+程 2087 n
+程三昌 3 nr
+程不识 3 n
+程仪 12 nr
+程伯休 5 nr
+程伯嘉 3 nr
+程俊俊 10 nr
+程元振 4 nr
+程先生 190 nr
+程光奎 2 nr
+程典 2 n
+程务挺 4 nr
+程君房 4 nr
+程咬金 16 n
+程哥 2 n
+程喜霖 5 nr
+程国平 8 nr
+程国祥 13 nr
+程坛主 8 nr
+程培源 2 nr
+程增强 2 nr
+程墨 2 n
+程壁光 2 nr
+程大位 12 n
+程大哥 3 nr
+程太 2 n
+程太太 3 nr
+程太守 7 nr
+程姑娘 8 nr
+程委会 5 n
+程子 3 n
+程子华 19 nr
+程子巾 3 nr
+程学军 3 nr
+程安东 2 nr
+程宝群 6 nr
+程家 5 n
+程家大 3 nr
+程小姐 4 nr
+程小蝶 3 nr
+程巨夫 4 nr
+程师兄 3 nr
+程师姊 3 nr
+程帮主 7 n
+程序 5610 n
+程序中间 2 n
+程序代码 10 n
+程序修改 3 nr
+程序包 8 n
+程序化 47 n
+程序变换 3 nr
+程序变流 3 n
+程序员 170 n
+程序处理 4 n
+程序安装 4 n
+程序定义 2 n
+程序实施 6 n
+程序实现 3 i
+程序库 3 n
+程序开发 17 nr
+程序性 44 n
+程序执行 3 n
+程序接口 4 n
+程序控制 36 n
+程序框图 3 n
+程序模块 3 n
+程序正确性 3 n
+程序段 8 n
+程序法 24 n
+程序流程 2 n
+程序清单 4 n
+程序界面 2 n
+程序管理 3 n
+程序结构 3 n
+程序综合 3 n
+程序编制 3 n
+程序设计 28 n
+程序语言 3 n
+程序调试 2 n
+程序转换 4 i
+程序运行 8 n
+程序逻辑 2 n
+程序验证 3 n
+程度 9953 n
+程度较 5 v
+程度较高 4 n
+程庭桂 2 nr
+程建勋 2 nr
+程异 6 n
+程式 197 n
+程式化 36 nr
+程式库 3 nr
+程式码 3 n
+程式组 3 n
+程式设计 3 n
+程式馆 3 nr
+程弹 14 n
+程德全 2 nr
+程德谋 2 nr
+程志 261 n
+程怀龙 5 nr
+程思远 18 nr
+程控 60 n
+程控化 3 n
+程控电话 18 n
+程敏政 17 nr
+程文 38 n
+程文书 2 nr
+程文华 2 nr
+程文欣 4 nr
+程文襄 2 nr
+程新广 3 nr
+程日兴 5 nr
+程昌寓 2 nr
+程昱 34 nr
+程昱谏 2 nr
+程晋舜 4 nr
+程晓农 2 nr
+程晓霞 3 nr
+程普保 2 nr
+程普分 2 n
+程普引 5 nr
+程普收 2 nr
+程本直 12 nr
+程朱之 3 nr
+程朱传 3 nr
+程朱陆 3 nr
+程松圆 4 nr
+程极 3 n
+程正揆 2 nr
+程步高 4 nr
+程毅中 2 nrfg
+程氏易 3 nr
+程派 6 n
+程海乡 2 nr
+程演生 2 nr
+程潜 23 nr
+程灵素 753 nr
+程灵胡 8 nr
+程煜 3 nrfg
+程爷 2 n
+程玉兰 2 nr
+程瑶田 3 nr
+程瑶迦 146 nr
+程番府 3 n
+程知节 5 nr
+程砚秋 28 nr
+程程 7 n
+程红根 3 nr
+程继先 7 nr
+程维藩 8 nr
+程维高 6 nr
+程网 2 n
+程老 2 n
+程老爷子 2 n
+程胜祖 3 nr
+程英举 4 nr
+程英之 4 nr
+程英使 2 nr
+程英便 2 nr
+程英双 2 nr
+程英只 2 nr
+程英叫 2 nr
+程英奔 4 nr
+程英微微 2 nr
+程英忽 4 nr
+程英戴 2 nr
+程英抱 2 nr
+程英抹 2 nr
+程英招 2 nr
+程英拨 2 nr
+程英斗 2 nr
+程英料 2 n
+程英早 2 nr
+程英未 2 nr
+程英柔 4 nr
+程英毅然 2 nr
+程英温 2 nr
+程英琴 2 nr
+程英眼 2 nr
+程英知 2 nr
+程英站 2 nr
+程英膝 2 nr
+程英见 17 nr
+程蝶衣 2 n
+程衍方 3 nr
+程裕淇 4 nr
+程诸子 2 nr
+程谋义 6 n
+程贻举 259 nr
+程远志 5 nr
+程连昌 2 nr
+程途 14 n
+程逝寒 3 vn
+程遥迦 3 nr
+程邈 3 nr
+程长庚 14 nr
+程门立雪 2 n
+程陆 32 n
+程陆姊妹 6 nr
+程限 3 n
+程青竹 142 nr
+程青霜 3 nr
+程颐 3 nrfg
+程颢 47 nr
+程鹏辉 3 nr
+程麟荪 2 nr
+稌 2 zg
+稍 4540 zg
+稍不留神 3 i
+稍为 49 d
+稍事 90 d
+稍低 3 v
+稍作 3 v
+稍侯 3 l
+稍候 68 d
+稍候一下 3 v
+稍候片刻 3 v
+稍倾 3 i
+稍停 3 d
+稍减 3 v
+稍加 171 d
+稍右 3 l
+稍后 167 d
+稍多 3 d
+稍好 3 d
+稍嫌 3 v
+稍安 3 v
+稍安勿燥 3 i
+稍安毋躁 3 i
+稍宽 3 v
+稍左 3 v
+稍差 3 v
+稍带 3 d
+稍微 719 d
+稍息 25 v
+稍感 3 v
+稍感不便 3 l
+稍感不适 3 l
+稍慢 3 d
+稍懈 3 l
+稍早 3 d
+稍晚 3 d
+稍有不慎 39 l
+稍来 3 d
+稍点 3 d
+稍热 3 v
+稍睡 3 v
+稍瞬即逝 3 i
+稍知 3 v
+稍短 3 v
+稍稍 610 d
+稍等一下 3 l
+稍等片刻 3 l
+稍纵即逝 55 i
+稍缓 3 d
+稍胜一筹 5 i
+稍觉 3 d
+稍许 36 d
+稍远 3 d
+稍迟 3 d
+稍退 3 v
+稍逊 3 i
+稍逊一筹 23 l
+稍逊风骚 3 l
+稍顷 10 d
+稍高于 3 l
+税 2494 n
+税付 3 n
+税关 3 n
+税则 47 n
+税利 20 n
+税制 102 n
+税前 50 t
+税务 543 n
+税务代理 3 n
+税务关 3 n
+税务司 3 n
+税务员 6 n
+税务处 3 n
+税务官 8 n
+税务局 43 nt
+税务师 3 n
+税务总局 6 nt
+税务所 14 nt
+税务所长 16 n
+税务报 3 n
+税务机关 3 n
+税务系统 3 n
+税务网 3 n
+税单 5 n
+税卡 2 n
+税史 3 n
+税号 3 n
+税名 3 n
+税后 73 t
+税后还贷 3 n
+税吏 3 n
+税基 2 n
+税契 3 n
+税官 14 n
+税局 3 n
+税式 3 n
+税户 3 n
+税捐 10 n
+税捐处 3 n
+税捐稽征 3 n
+税控 19 j
+税控机 3 n
+税收 1336 n
+税收制度 3 n
+税收收入 14 n
+税收政策 3 n
+税收法律 3 n
+税收法规 3 n
+税收理论 3 n
+税收管理 3 n
+税改 3 j
+税政 3 n
+税权 3 n
+税校 3 n
+税案 2 n
+税款 146 n
+税法 149 n
+税源 40 n
+税率 210 n
+税目 21 n
+税盲 3 n
+税票 3 n
+税种 39 n
+税稽 3 j
+税管 3 n
+税类 3 n
+税纪 3 n
+税警 3 n
+税课 3 n
+税负 23 n
+税费 99 n
+税赋 35 n
+税金 94 n
+税项 9 n
+税额 76 n
+税风 3 n
+稒 3 zg
+稔 32 zg
+稔恶不悛 3 i
+稔恶盈贯 3 nr
+稔恶藏奸 3 v
+稗 58 ng
+稗史 3 n
+稗子 12 n
+稗官 3 n
+稗官小说 3 i
+稗官野史 3 i
+稚 222 n
+稚女 3 n
+稚嫩 92 a
+稚子 12 n
+稚小 3 a
+稚年 3 n
+稚弱 3 a
+稚拙 32 a
+稚晖 3 n
+稚气 87 n
+稚气未脱 7 l
+稚童 2 n
+稚虫 3 n
+稚蚕 3 n
+稚语 3 n
+稚音 3 n
+稚鱼 6 n
+稚齿 3 n
+稚齿婑媠 3 n
+稚龄 3 n
+稛 5 zg
+稜 4 zg
+稞 3 n
+稞麦 3 n
+稠 245 a
+稠乎乎 3 i
+稠人广众 8 i
+稠人广坐 3 i
+稠人广座 3 i
+稠化剂 3 n
+稠化水驱 3 i
+稠化酸 3 n
+稠子 3 n
+稠密 365 a
+稠密性 2 n
+稠度 3 a
+稠油 5 n
+稠粥 3 n
+稠糊 3 a
+稠缎 3 n
+稣 47 g
+稧 2 zg
+稱 90 zg
+稳 1908 a
+稳中有 3 b
+稳中有升 20 l
+稳中有进 3 l
+稳中有降 2 l
+稳中求进 26 l
+稳产 50 n
+稳产高产 3 l
+稳住 243 v
+稳住阵脚 3 l
+稳便 31 a
+稳健 339 a
+稳健作风 3 l
+稳健性 2 n
+稳健派 3 n
+稳准狠 3 d
+稳压 12 n
+稳压器 14 n
+稳压电源 17 n
+稳压管 3 n
+稳吃三注 3 l
+稳固 308 a
+稳坐钓鱼台 10 l
+稳坐钓鱼船 3 l
+稳如 3 a
+稳如泰山 46 i
+稳妥 246 a
+稳婆 7 n
+稳定 8439 a
+稳定上升 3 l
+稳定下来 3 l
+稳定人心 3 l
+稳定传热 3 l
+稳定剂 38 n
+稳定化 5 l
+稳定区 5 n
+稳定器 35 n
+稳定型 23 n
+稳定增长 3 n
+稳定局势 3 n
+稳定平衡 7 l
+稳定度 18 n
+稳定性 857 n
+稳定情绪 3 n
+稳定感 9 n
+稳定期 4 n
+稳定杆 3 n
+稳定流 3 n
+稳定渗流 3 n
+稳定版 3 n
+稳定物价 3 n
+稳定率 3 n
+稳定电位 3 n
+稳定等价 3 n
+稳定臂 3 n
+稳实 3 a
+稳居 35 v
+稳度 3 d
+稳当 55 a
+稳当性 3 l
+稳心 3 a
+稳态 88 n
+稳扎 3 v
+稳扎稳打 54 i
+稳打稳扎 3 i
+稳拿 7 v
+稳拿到 3 l
+稳操 3 n
+稳操左券 3 l
+稳操胜券 35 n
+稳操胜算 10 l
+稳步 1233 d
+稳步前进 41 l
+稳步发展 3 l
+稳步增长 3 i
+稳步迈进 3 l
+稳流 3 n
+稳稳 3 a
+稳稳固固 3 i
+稳稳地 56 z
+稳稳定定 3 n
+稳稳当当 27 a
+稳稳重重 3 z
+稳练 3 a
+稳获 12 v
+稳赚 3 v
+稳赢 9 n
+稳轴 3 n
+稳输 3 v
+稳重 202 a
+稳重性 3 n
+稶 17 zg
+稷 273 g
+稷下 3 ns
+稷山 20 ns
+稷山县 7 ns
+稷米 3 ns
+稷蜂社鼠 3 v
+稸 9 zg
+稹 121 nr
+稻 470 n
+稻作 3 n
+稻叶 2 n
+稻地 3 n
+稻场 5 n
+稻垣 2 n
+稻垣吾郎 3 ns
+稻城 10 n
+稻城县 3 ns
+稻壳 29 n
+稻子 34 n
+稻岭 2 n
+稻本 3 n
+稻本润一 3 n
+稻树 3 n
+稻株 3 n
+稻森泉 3 nz
+稻民四 3 nz
+稻浪 3 nz
+稻热病 3 n
+稻田 206 n
+稻田热 3 nz
+稻瘟病 9 n
+稻瘿蚊 3 n
+稻神 4 n
+稻秆 4 n
+稻种 10 n
+稻秧 2 n
+稻穗 5 n
+稻米 236 n
+稻粒 3 n
+稻糠 2 n
+稻芽 3 n
+稻苗 2 n
+稻苞虫 3 n
+稻草 193 n
+稻草人 20 n
+稻草堆 16 n
+稻蓟马 3 n
+稻谷 505 n
+稻霉素 3 n
+稻飞虱 6 n
+稻香 3 n
+稻香村 23 n
+稻麦 30 n
+稼 84 nr
+稼穑 19 nr
+稼穑艰难 3 l
+稽 334 nr
+稽古振今 3 n
+稽古揆今 3 v
+稽审 3 v
+稽察 12 v
+稽察员 3 n
+稽延 4 v
+稽征 3 v
+稽徵处 3 z
+稽查 135 vn
+稽查人员 3 n
+稽查员 3 n
+稽查局 3 n
+稽查队 3 n
+稽核 80 v
+稽留 9 v
+稽留热 3 n
+稽疑送难 3 n
+稽管 3 v
+稽考 3 v
+稽覈 3 vn
+稽首 36 v
+稿 1438 ng
+稿件 168 n
+稿作 3 n
+稿子 354 n
+稿底 3 n
+稿本 15 n
+稿源 5 n
+稿约 3 n
+稿纸 72 n
+稿茬 3 n
+稿荐 2 n
+稿费 82 n
+稿酬 41 n
+穀 2 zg
+穄 9 zg
+穅 6 zg
+穆 404 nz
+穆世妹 3 nr
+穆世姊 6 nr
+穆丽燕 3 nr
+穆人 3 nrt
+穆人清 160 nr
+穆伊纳 2 nr
+穆光宗 2 nr
+穆克 27 nz
+穆克联邦 4 nz
+穆公虎 8 nr
+穆兰 5 nz
+穆列什 5 nrt
+穆利诺 3 nr
+穆加贝 9 nr
+穆勒 84 nz
+穆勒先生 2 nr
+穆勒尔 2 nr
+穆卢耶 2 nr
+穆厝 3 nrt
+穆合热 2 nz
+穆吉木 2 nr
+穆哈 4 nrt
+穆哈卡 2 nrt
+穆哈拉 3 nrt
+穆图 2 nz
+穆圣 11 nz
+穆垒 4 nz
+穆塔利 3 nr
+穆塔基 5 nr
+穆塔瓦 3 nr
+穆塔里 4 nrt
+穆塞韦尼 4 nrt
+穆大侠 4 nr
+穆天子 27 nr
+穆太公 10 nr
+穆太奈 5 nr
+穆夫提 10 nr
+穆如清风 3 nr
+穆姊姊 19 nr
+穆姑娘 4 nr
+穆宗 54 nrt
+穆宗皇帝 10 nr
+穆宗立 3 nr
+穆宗耶 3 nr
+穆家哥 2 nr
+穆家姊 3 nr
+穆尔 24 nrt
+穆尔克 2 nrt
+穆尔加 4 nz
+穆尔卡 16 nrt
+穆尔吉 2 nr
+穆尔图 2 nr
+穆尔太 15 nz
+穆尔希 32 nr
+穆尔德河 2 nrt
+穆尔河 4 nr
+穆尔特 12 nrt
+穆尔西 12 nrt
+穆尔西亚 2 nrt
+穆尼埃 2 nr
+穆巴 3 nrt
+穆巴拉克 142 nrt
+穆布里 2 nrt
+穆帕塔 2 nrt
+穆帝永 6 nr
+穆建新 2 nr
+穆弘守 2 nr
+穆弘庄 4 nr
+穆彰阿 3 nr
+穆德 4 nrt
+穆德吉 2 nr
+穆念慈 339 nr
+穆扎法 2 nr
+穆扎法尔 3 nrt
+穆托姆 8 nrt
+穆托姆博 3 nr
+穆拉 11 nrt
+穆拉夫 3 nrt
+穆拉德 15 nrt
+穆拉托 3 nrt
+穆拉梅 3 nr
+穆拉特 3 nrt
+穆拉维 12 nr
+穆拉诺 2 nr
+穆斯 8 nrt
+穆斯利 4 nz
+穆斯堡 43 nrt
+穆斯塔法 15 nz
+穆斯杯 4 nz
+穆斯林 1280 nz
+穆斯林族 6 nz
+穆斯林联盟 37 nz
+穆斯赫 2 nr
+穆易 73 nz
+穆易怒 5 nr
+穆智台 2 nr
+穆木天 3 nr
+穆林 2 nz
+穆林斯 2 nr
+穆柯寨 2 nr
+穆格尔 2 nr
+穆格法 4 nr
+穆桂英 30 nr
+穆桑代 6 nr
+穆棱 11 nr
+穆棱县 3 nr
+穆棱市 3 nr
+穆棱河 9 nr
+穆沙拉夫 18 nrt
+穆河 4 nz
+穆泽尼 2 nr
+穆然 4 nr
+穆然城 2 nr
+穆特 2 nrt
+穆特萨 2 nr
+穆献皇帝 3 nr
+穆王 29 nrt
+穆王好 3 nr
+穆王居 2 nr
+穆王时 2 nr
+穆瓦桑 8 nr
+穆瓦罗 3 nrt
+穆皇后 2 nr
+穆眯兄 2 nr
+穆砜 2 nz
+穆祥雄 2 nr
+穆素尔 5 nr
+穆索夫 2 nr
+穆索尔 9 nr
+穆索里 3 nrt
+穆纳伊克 3 nrt
+穆纳里 2 nrt
+穆罕 4 nrt
+穆罕默 9 nrt
+穆罕默德 443 nrt
+穆艾津 8 nr
+穆荫 9 nrt
+穆萨 39 nrt
+穆萨帕 2 nr
+穆萨拉 4 nrt
+穆萨维 2 nr
+穆萨维安 4 nz
+穆蒂 2 nrt
+穆蒙德 2 nr
+穆藕初 4 nr
+穆虎 4 nz
+穆西 2 nrt
+穆西河 5 nr
+穆谢特 5 nrt
+穆贵妃 23 nr
+穆贾迪 2 nr
+穆赞穆 4 nr
+穆赫塔 2 nr
+穆赫塔尔 10 nrt
+穆达拉勒 2 nrt
+穆迪 20 nz
+穆迪奥诺 4 nrt
+穆通 2 nz
+穆郎玛 2 nr
+穆里亚 2 nrt
+穆里埃 2 nr
+穆里尼 46 nrt
+穆里尼奥 3 nrt
+穆钦加 2 nr
+穆阿维 15 nr
+穆阿莱 2 nr
+穆雷换 3 nr
+穆顺 4 nz
+穆顿 2 nrt
+穆鲁克 2 nr
+穆鲁特 2 nr
+穇 13 zg
+穉 4 zg
+穋 2 zg
+穑 97 x
+穗 395 n
+穗串 3 n
+穗儿 7 n
+穗城 3 n
+穗子 27 n
+穗宝 3 nz
+穗状 3 nz
+穗状花序 53 l
+穗肥 3 n
+穗花杉 13 nz
+穗行法 3 n
+穗轴 7 nz
+穗选 2 nz
+穗醋栗 3 n
+穜 2 zg
+穨 32 zg
+穬 23 zg
+穭 2 zg
+穰 49 g
+穰穰满家 3 nr
+穴 3068 ng
+穴位 216 n
+穴处 3 n
+穴处之徒 3 i
+穴处知雨 3 i
+穴头 2 n
+穴居 73 v
+穴居人 3 n
+穴居野处 2 n
+穴居野外 3 i
+穴播 3 v
+穴施 5 n
+穴窟 3 n
+穴距 3 n
+穴道 1500 n
+究 985 d
+究份 3 v
+究其 3 d
+究其原因 3 v
+究其根源 3 d
+究办 5 v
+究根 3 d
+究根儿 3 d
+究洁 3 v
+究理 3 d
+究竟 3981 d
+究结盘底 3 z
+究诘 3 v
+究问 3 v
+穷 2298 a
+穷不失义 3 i
+穷举 5 n
+穷举法 3 i
+穷乏 16 a
+穷乡僻壤 48 i
+穷书生 3 n
+穷亲 5 n
+穷人 1693 n
+穷人家 3 n
+穷人的孩子早当家 3 nz
+穷作潦倒 3 i
+穷光 3 n
+穷光光 3 n
+穷光蛋 66 n
+穷兵 3 n
+穷兵黩武 17 i
+穷冬 3 n
+穷凶 3 n
+穷凶恶极 3 i
+穷凶极恶 78 i
+穷则变 3 i
+穷则思变 6 i
+穷厄 3 n
+穷原竟委 3 i
+穷嘴恶舌 3 i
+穷困 126 a
+穷困人家 3 i
+穷困户 3 i
+穷困潦倒 28 i
+穷国 39 n
+穷境 3 n
+穷大失居 3 i
+穷大方 3 i
+穷天极地 3 i
+穷奢极侈 7 i
+穷奢极多 3 i
+穷奢极欲 27 i
+穷学生 3 n
+穷孩子 3 n
+穷家富路 3 i
+穷寇 23 n
+穷寇勿追 2 i
+穷寇莫追 3 i
+穷小子 3 n
+穷尽 82 a
+穷山僻壤 3 i
+穷山恶水 15 i
+穷山沟 3 n
+穷巷 3 n
+穷巷陋室 3 i
+穷年累世 3 i
+穷年累月 13 i
+穷幽极微 3 n
+穷开心 4 i
+穷当益坚 3 i
+穷形尽相 3 i
+穷忙 3 a
+穷愁 3 a
+穷愁潦倒 2 i
+穷折腾 3 i
+穷日 3 n
+穷日之力 3 i
+穷日子 3 n
+穷期 3 n
+穷本 3 n
+穷极 3 n
+穷极思变 3 i
+穷极无聊 9 i
+穷极要妙 3 i
+穷根 3 n
+穷根究底 3 i
+穷棒子 3 n
+穷横 3 a
+穷欢乐 3 i
+穷死 3 v
+穷民 3 n
+穷气 3 n
+穷汉 53 n
+穷泉朽壤 3 n
+穷源意委 3 n
+穷源朔流 3 i
+穷源溯流 3 i
+穷源竟委 3 i
+穷爸爸 3 nr
+穷猿奔林 3 i
+穷猿投林 3 i
+穷理 3 n
+穷理尽性 3 l
+穷目 3 n
+穷相 3 n
+穷究 3 v
+穷究原委 3 n
+穷窘 3 a
+穷竭 14 n
+穷而后工 3 i
+穷苦 145 a
+穷苦人家 3 i
+穷读 3 v
+穷达 3 a
+穷迫 3 a
+穷追 53 v
+穷追不舍 55 i
+穷追猛打 24 i
+穷途 7 n
+穷途之哭 3 i
+穷途末路 32 i
+穷途潦倒 3 i
+穷通 3 n
+穷酸 41 n
+穷酸气 2 n
+穷酸相 3 n
+穷里 3 n
+穷阎漏屋 3 n
+穷队 3 n
+穷骨头 2 n
+穷鬼 24 n
+穷鸟入怀 3 i
+穷鼠啮狸 3 nr
+穸 58 x
+穹 96 n
+穹天 3 n
+穹宇 5 n
+穹幕 4 n
+穹庐 43 n
+穹窿 53 n
+穹苍 4 n
+穹隆 17 n
+穹隆式 3 n
+穹顶 47 n
+空 7470 n
+空三军 10 nr
+空上 3 s
+空下 3 s
+空下去 3 l
+空下来 3 l
+空个 3 b
+空中 4608 s
+空中交通 3 nt
+空中加油 3 n
+空中商专 3 j
+空中大学 3 nt
+空中客车 42 n
+空中客车公司 20 nt
+空中客车工业公司 7 nt
+空中小姐 19 nr
+空中少爷 3 nr
+空中巡逻 3 nz
+空中巴士 3 n
+空中广告 3 nr
+空中摄影 3 n
+空中楼阁 23 nr
+空中爆炸 3 n
+空中缆车 3 n
+空中网 3 n
+空中课堂 3 n
+空中走廊 3 n
+空中飞人 3 n
+空串 2 n
+空串列 3 n
+空义 2 n
+空之声 7 nr
+空乏 6 v
+空乘 30 nz
+空仓未 2 nr
+空仔 3 n
+空位 87 n
+空位元素 3 n
+空位流 3 n
+空余 41 n
+空余恨 3 n
+空信 3 n
+空候 3 n
+空值 11 n
+空儿 119 n
+空元运算 3 l
+空军 5522 n
+空军一号 58 n
+空军军官 3 nr
+空军医院 3 nt
+空军司令 3 n
+空军基地 3 n
+空军官校 3 l
+空军指挥学院 54 nt
+空军政治部 3 nt
+空军机校 3 l
+空军机械 3 n
+空军航空兵 24 nt
+空军节 3 n
+空军通信 3 nt
+空军通校 3 nt
+空军部队 3 nt
+空军队 4 nt
+空出 3 v
+空函 3 n
+空前 1315 s
+空前团结 3 n
+空前未有 13 i
+空前绝后 37 l
+空劫 3 v
+空勤 24 n
+空勤人员 3 n
+空勤团 5 n
+空包 3 n
+空包弹 25 n
+空化 55 n
+空匮 3 i
+空印 6 n
+空即是色 3 i
+空压机 4 n
+空参训 3 n
+空口 21 n
+空口无凭 15 i
+空口说白话 3 l
+空古绝今 3 l
+空号 3 n
+空名 3 n
+空名额 3 n
+空吸 4 v
+空和尚 9 n
+空哥 6 n
+空啸傲 2 nr
+空喊 14 v
+空喊一声 3 i
+空喜 3 n
+空地 360 n
+空地导弹 80 n
+空地战 3 j
+空场 19 n
+空城 37 n
+空城计 38 n
+空域 198 n
+空基 18 n
+空基核 2 n
+空增 3 v
+空壳 46 n
+空壳子 3 n
+空处 3 s
+空大 3 a
+空天飞机 24 n
+空头 96 n
+空头支票 15 n
+空头政治 3 n
+空姐 290 n
+空委 3 n
+空嫂 3 n
+空子 98 n
+空字符 6 n
+空官 3 n
+空客 52 n
+空室清野 3 nr
+空室蓬户 3 i
+空家窘 16 nr
+空寂 39 a
+空寂超 2 nr
+空对地 62 n
+空对地飞 3 l
+空对空 92 n
+空射 3 v
+空射一枪 3 l
+空屁 3 n
+空屋 3 n
+空山 47 n
+空山鸟 2 n
+空岗 3 n
+空巢 6 n
+空幻 9 n
+空床 3 n
+空座 3 n
+空座位 2 n
+空廓 7 n
+空张郡 2 nr
+空弹 3 n
+空当 53 a
+空当儿 3 nr
+空当接龙 3 nz
+空心 166 n
+空心化 5 n
+空心坝 3 nr
+空心汤圆 3 i
+空心球 3 n
+空心砖 10 n
+空心菜 114 n
+空忙 3 d
+空忙一场 3 l
+空怀 9 nr
+空性 31 n
+空性大师 3 n
+空性怒 2 nr
+空性神 3 n
+空情 23 n
+空想 164 n
+空想家 3 l
+空想社会 3 l
+空成 3 v
+空战 363 n
+空户 3 n
+空房 38 n
+空房子 3 n
+空房间 6 n
+空手 222 n
+空手而回 3 i
+空手而归 3 i
+空手而来 3 l
+空手道 20 n
+空投 269 j
+空投物资 3 n
+空拳 9 n
+空挡 19 n
+空掌 7 n
+空控制 2 n
+空搜索 3 nr
+空摄地图 3 n
+空政 8 n
+空文 10 n
+空方 12 s
+空无一人 72 i
+空无一物 3 l
+空无所有 12 i
+空旷 251 nr
+空旷地 3 z
+空旷旷 8 nr
+空明 33 n
+空明拳 45 nr
+空晶石 3 n
+空智 107 n
+空智冷 2 nr
+空智大师 25 nr
+空智神 6 nr
+空智禅师 5 nr
+空暇 8 n
+空有形式 3 l
+空权 5 n
+空条 3 n
+空条徐伦 3 nr
+空枕 3 n
+空枪 2 n
+空架子 7 n
+空某师 2 nr
+空柜子 3 n
+空栏 3 n
+空校 3 n
+空格 107 n
+空格符 3 nr
+空格键 3 nr
+空桐树 3 nr
+空桑 3 n
+空档 35 b
+空桶 3 n
+空棘 3 n
+空棺盖 2 nr
+空椅 2 n
+空楼 3 n
+空欢喜 4 nr
+空气 3732 n
+空气冷却 3 l
+空气净化 3 n
+空气压缩 3 l
+空气压缩机 15 n
+空气喷气 3 z
+空气囊 3 n
+空气型 3 b
+空气垫 3 n
+空气密度 3 n
+空气层 16 n
+空气峰 3 n
+空气幕 3 n
+空气氧化 3 n
+空气污染 22 i
+空气流 4 n
+空气流通 3 n
+空气流速 2 n
+空气浴 5 n
+空气清新 3 z
+空气滤器 3 n
+空气滤清 3 n
+空气监测 3 nr
+空气稀薄 3 l
+空气调节 3 n
+空气质量 10 n
+空气轴承 3 l
+空气量 3 n
+空气钻井 3 i
+空气锤 2 n
+空气阻力 3 n
+空气除菌 3 l
+空泛 36 a
+空泡 3 n
+空洞 267 n
+空洞化 3 n
+空洞地 3 z
+空洞无物 10 l
+空洞无聊 3 i
+空洞洞 7 z
+空洞说教 3 n
+空测 3 v
+空海 15 n
+空海权 2 nr
+空港 25 n
+空滤 3 v
+空灵 37 n
+空炮 22 n
+空炮弹 3 n
+空照 2 n
+空球藻 2 n
+空瓶 3 n
+空疏 8 n
+空瘪 3 a
+空白 920 n
+空白一片 3 n
+空白处 18 n
+空白对照 3 n
+空白支票 3 n
+空白点 6 n
+空白符 5 n
+空白行 2 n
+空白试验 3 n
+空白键 3 n
+空白页 3 n
+空盒 9 n
+空盒子 3 n
+空盘 3 n
+空目录 3 n
+空相 4 n
+空磨子 2 n
+空秆 3 n
+空穴 89 n
+空穴来凤 3 i
+空穴来风 46 i
+空空 179 n
+空空儿 5 n
+空空如也 73 i
+空空导弹 237 n
+空空洞洞 22 z
+空空空 2 n
+空空荡荡 83 z
+空空落落 2 i
+空空落落的 3 z
+空窖 3 n
+空竹 23 n
+空等一场 3 l
+空管 18 n
+空管员 2 n
+空箱 7 n
+空箱子 3 n
+空类 2 n
+空缺 220 a
+空置 33 n
+空置房 10 n
+空置率 10 n
+空群之选 3 nr
+空翻 28 v
+空翻多 3 l
+空耗 2 n
+空肚 3 n
+空肚子 3 n
+空肠 16 n
+空肺 3 n
+空腔 63 n
+空腔化 3 n
+空腔子 2 n
+空腹 90 n
+空腹便便 3 l
+空腹吃 3 i
+空腹服 3 n
+空腹高心 3 i
+空自怜 2 i
+空舍清野 3 nr
+空航 3 j
+空舰 4 n
+空船 3 n
+空茫 3 z
+空荡 3 v
+空荡荡 243 z
+空营 2 n
+空落 2 n
+空落落 58 z
+空蒙雨 2 nr
+空虑 3 v
+空虚 490 n
+空虚感 3 nr
+空血 3 n
+空行 45 n
+空袖 2 n
+空袭 365 v
+空袭警报 3 n
+空见 3 n
+空见和尚 2 n
+空见神 8 nr
+空言 6 n
+空认 3 v
+空论 17 n
+空话 152 n
+空话连篇 3 n
+空语句 3 n
+空调 614 n
+空调主机 3 n
+空调器 61 n
+空调机 6 n
+空调管 3 n
+空调网 3 n
+空调设备 3 n
+空调车 4 n
+空谈 85 v
+空谈家 3 n
+空谈快意 3 i
+空谈者 3 n
+空谷 28 n
+空谷传声 3 n
+空谷回音 3 n
+空谷幽兰 3 nr
+空谷白驹 3 n
+空谷足音 2 n
+空费 3 n
+空费词说 3 n
+空走一趟 3 v
+空起 3 s
+空跃 5 v
+空跑 3 v
+空跑一趟 3 v
+空身 3 n
+空车 58 n
+空车子 3 n
+空转 12 v
+空载 46 v
+空载反应 3 l
+空运 615 n
+空运公司 3 n
+空运单 3 n
+空速 26 n
+空速表 5 n
+空道 3 n
+空邮 3 n
+空酒瓶 3 n
+空钟 8 n
+空门 80 n
+空闲 133 n
+空闲地 2 l
+空间 5511 n
+空间主权 3 n
+空间体系 3 n
+空间信息 6 n
+空间反演 3 n
+空间和时 3 n
+空间图形 3 n
+空间差距 3 n
+空间布局 3 n
+空间常数 3 n
+空间性 3 n
+空间感 14 n
+空间数据 4 n
+空间构图 3 n
+空间概念 3 l
+空间波 3 n
+空间点阵 2 n
+空间电荷 3 n
+空间科学 32 l
+空间站 71 n
+空间组成 3 l
+空间组织 3 n
+空间结构 38 n
+空间规划 3 n
+空间设计 6 n
+空间误差 3 l
+空间轨道 3 l
+空间转动 3 l
+空间通信 5 n
+空间隔离 3 l
+空间频率 3 n
+空闺 3 n
+空闺独守 3 i
+空闻 45 n
+空闻大师 13 n
+空闻神 4 n
+空闻禅师 2 n
+空闻续 2 n
+空阔 35 a
+空阔无垠 3 i
+空防 40 n
+空防区 3 n
+空阶 2 n
+空际 3 n
+空降 560 v
+空降兵 310 n
+空降师 3 n
+空降部队 3 n
+空隐 2 z
+空隙 370 n
+空难 45 n
+空难事件 3 n
+空集 3 n
+空集东 2 n
+空集合 3 n
+空页 3 n
+空额 28 n
+空飘 3 z
+空首布 2 nr
+空驶 4 v
+空高开 2 nr
+穻 7 zg
+穼 9 zg
+穽 5 zg
+穿 11359 zg
+穿上便鞋 3 l
+穿上去 3 v
+穿上来 3 v
+穿下 3 v
+穿下去 3 v
+穿下来 3 v
+穿不下 3 v
+穿不出 3 v
+穿云破雾 13 i
+穿云裂石 3 n
+穿井 3 n
+穿井得人 3 i
+穿住 3 v
+穿便衣 3 n
+穿入 3 v
+穿出 3 v
+穿出去 3 v
+穿凿 22 v
+穿凿附会 8 i
+穿到 3 v
+穿刺 143 v
+穿刺术 21 n
+穿刺针 5 n
+穿厚 3 v
+穿去 3 v
+穿坏 3 v
+穿堂 24 n
+穿堂入室 3 i
+穿堂门 3 n
+穿堂风 4 i
+穿墙 7 n
+穿墙术 3 n
+穿壁引光 3 n
+穿孔 195 n
+穿孔卡 3 n
+穿孔卡片 3 n
+穿孔员 3 n
+穿孔器 3 n
+穿孔机 2 n
+穿孔素 3 n
+穿孔纸带 3 n
+穿孔蛋白 3 n
+穿孝 3 v
+穿小鞋 16 n
+穿山甲 110 n
+穿山而过 3 l
+穿山越岭 3 i
+穿山龙 3 nz
+穿巡 3 v
+穿帮 12 v
+穿弦 3 v
+穿得单薄 3 l
+穿心 3 v
+穿心莲 13 n
+穿戴 366 v
+穿戴整齐 3 i
+穿插 192 v
+穿插在 3 l
+穿插着 3 l
+穿旧 3 v
+穿来 3 v
+穿来穿去 3 i
+穿杨射柳 3 n
+穿梭 241 v
+穿梭外交 3 n
+穿梭往返 3 v
+穿梭机 3 n
+穿梭箱 3 n
+穿梭轰炸 3 vn
+穿法 3 n
+穿洞 3 n
+穿点 3 n
+穿用 3 v
+穿甲 74 b
+穿甲弹 145 n
+穿着 110 v
+穿着入时 3 l
+穿着打扮 3 i
+穿着新潮 3 n
+穿着者 3 n
+穿破 3 v
+穿空 3 n
+穿穿 3 v
+穿穿看 3 i
+穿窬 4 v
+穿窬之盗 3 v
+穿红带绿 3 b
+穿红戴绿 3 i
+穿红着绿 3 l
+穿线 4 n
+穿线管 3 n
+穿耳 3 n
+穿耳洞 3 n
+穿花纳锦 3 i
+穿著 3 n
+穿行 266 v
+穿街过巷 3 i
+穿衣 166 n
+穿衣吃饭 3 i
+穿衣戴帽 3 n
+穿衣服 3 n
+穿衣柜 3 n
+穿衣镜 36 n
+穿起 3 v
+穿越 621 v
+穿越时空 3 b
+穿越道 3 n
+穿身而过 3 l
+穿过 1437 v
+穿连裆裤 3 n
+穿透 299 v
+穿透力 81 n
+穿透性 3 n
+穿透效应 3 n
+穿透明 3 n
+穿透率 3 n
+穿透电流 3 n
+穿通 3 v
+穿通纤维 3 l
+穿金戴银 3 n
+穿针 3 n
+穿针引线 27 n
+穿门而过 3 l
+穿靴 3 n
+穿鞋 3 n
+穿鼻 3 v
+窀 16 x
+窀穸 3 n
+突 1960 ad
+突兀 193 v
+突入 140 v
+突减 3 v
+突出 5289 v
+突出主题 3 n
+突出位置 3 n
+突出成绩 3 n
+突出点 3 vn
+突出端 3 i
+突出者 7 n
+突出表现 3 i
+突出贡献 3 n
+突出重围 3 n
+突出重点 3 i
+突击 1328 vn
+突击力 26 n
+突击师 3 n
+突击性 11 n
+突击手 16 n
+突击检查 3 n
+突击组 3 n
+突击队 255 n
+突击队员 48 n
+突刺 3 vn
+突升 3 v
+突厥 899 n
+突厥语 64 nz
+突发 892 v
+突发事件 3 n
+突发噪声 3 nz
+突发奇想 3 i
+突发性 73 n
+突发状况 3 n
+突变 456 v
+突变体 3 n
+突变压力 3 n
+突变型 3 n
+突变子 3 n
+突变学 3 n
+突变性 3 n
+突变测验 3 n
+突变热点 3 n
+突变率 7 n
+突变纯系 3 n
+突变论 29 i
+突变谱 3 n
+突变频率 3 nz
+突嘴 3 v
+突围 625 n
+突围而出 3 i
+突地 39 n
+突堤 10 n
+突增 20 v
+突如其来 263 i
+突如其然 3 i
+突审 8 vn
+突射 3 v
+突射入门 3 n
+突尼斯 436 ns
+突尼斯人 10 nz
+突尼斯共和国 11 ns
+突尼斯政府 3 ns
+突尼斯队 3 nz
+突尼西亚 3 ns
+突感 3 a
+突施 3 v
+突施冷箭 3 i
+突显 49 a
+突显出 3 i
+突泉 3 nz
+突泉县 2 ns
+突然 14998 ad
+突然性 40 n
+突然折断 3 i
+突然行动 3 i
+突然袭击 187 i
+突然转向 3 i
+突现 15 v
+突着 3 v
+突破 3699 vn
+突破口 265 n
+突破性 188 n
+突破点 30 n
+突破现状 3 n
+突破者 3 n
+突破防线 3 n
+突破难关 3 i
+突突 3 vn
+突突突 3 i
+突袭 246 vn
+突袭战术 3 i
+突见 3 v
+突触 125 v
+突触发生 3 i
+突触囊泡 3 n
+突触小体 3 i
+突触效能 3 i
+突触蛋白 3 i
+突贯 3 v
+突起 334 v
+突起来 3 v
+突起物 3 i
+突越 3 a
+突进 62 v
+突遇 3 n
+突防 116 v
+突降 3 v
+突降滑道 3 n
+突飞 3 v
+突飞猛进 107 i
+窃 683 vg
+窃以为 3 i
+窃位 3 n
+窃位素餐 3 l
+窃取 112 v
+窃名 3 v
+窃听 154 v
+窃听器 15 i
+窃喜 3 v
+窃国 3 n
+窃国大盗 131 i
+窃国者侯 3 l
+窃国贼 3 n
+窃夺 3 v
+窃嫌 3 v
+窃密 5 n
+窃居高位 3 n
+窃得 3 v
+窃据 30 n
+窃据要津 3 l
+窃案 3 n
+窃犯 3 v
+窃玉偷香 3 i
+窃用 3 v
+窃盗 3 n
+窃盗罪 3 i
+窃窃 3 v
+窃窃私议 25 i
+窃窃私语 80 i
+窃笑 24 v
+窃贼 20 n
+窃走 3 v
+窃车团伙 3 n
+窃钩窃国 3 n
+窃钩者诛 3 l
+窄 1277 a
+窄小 93 d
+窄巴 3 z
+窄巴巴 3 z
+窄巷 3 n
+窄带 18 n
+窄幅 10 d
+窄得 3 d
+窄条 3 a
+窄板 3 n
+窄沟效应 3 n
+窄狭 3 a
+窄窄 12 a
+窄窄的 55 z
+窄网 3 n
+窄路 3 n
+窄道 3 d
+窄门 3 d
+窄门窄户 3 vn
+窆 24 g
+窇 63 zg
+窈 47 a
+窈窕 42 a
+窈窕淑女 11 i
+窋 5 zg
+窍 416 zg
+窍取 3 n
+窍门 240 n
+窎 3 zg
+窑 1393 n
+窑主 9 n
+窑具 2 n
+窑内 3 n
+窑厂 6 n
+窑变 3 n
+窑口 21 n
+窑器 3 n
+窑址 30 n
+窑坑 3 n
+窑头 4 n
+窑姐 3 n
+窑姐儿 3 n
+窑子 109 n
+窑居 3 n
+窑工 3 n
+窑洞 505 n
+窑湾 2 ns
+窑灶 3 n
+窑炉 6 n
+窒 301 v
+窒塞 3 v
+窒息 345 v
+窒息而死 3 v
+窒欲 3 v
+窒碍 3 v
+窒碍难行 3 vn
+窒闷 14 v
+窓 5 zg
+窕 51 x
+窖 805 n
+窖变 3 v
+窖子 3 v
+窖洞 3 v
+窖菜 3 v
+窖藏 64 v
+窖酒 3 v
+窗 1647 s
+窗上 121 s
+窗体 2 n
+窗创伤 3 n
+窗前 237 s
+窗口 1174 s
+窗口化 3 n
+窗口单位 3 n
+窗口地区 3 n
+窗口期 3 n
+窗口边框 3 n
+窗台 98 n
+窗台上 3 n
+窗台绿化 3 n
+窗园 3 n
+窗外 1151 s
+窗外事 3 n
+窗子 334 n
+窗帘 217 n
+窗帘布 3 n
+窗帘杆 3 n
+窗帘盒 3 n
+窗帘轨道 3 n
+窗帷 3 n
+窗幔 3 n
+窗座 3 n
+窗式 8 n
+窗式空调 3 n
+窗户 707 n
+窗户上 3 n
+窗户纸 48 n
+窗扇 14 n
+窗扉 3 n
+窗插销 3 n
+窗撑头 3 n
+窗明几净 25 i
+窗机 3 n
+窗板 3 n
+窗枱 3 s
+窗栏 4 n
+窗格 78 n
+窗格子 25 n
+窗框 23 n
+窗棂 89 n
+窗棱 3 n
+窗楣 3 n
+窗橱 3 n
+窗沿 7 s
+窗洞 35 n
+窗牖 13 n
+窗玻璃 42 n
+窗纱 16 n
+窗纸 115 n
+窗缝 70 n
+窗花 14 n
+窗销 3 n
+窗门 20 n
+窗间过马 3 n
+窗饰 3 n
+窘 193 zg
+窘乏 3 a
+窘促 3 a
+窘况 11 n
+窘厄 3 n
+窘困 13 a
+窘境 79 n
+窘局 3 n
+窘得 3 a
+窘态 29 n
+窘态毕露 3 n
+窘急 3 a
+窘惶 3 a
+窘状 3 n
+窘相 3 n
+窘色 3 n
+窘败 3 n
+窘迫 136 a
+窛 27 zg
+窜 1119 zg
+窜入 50 v
+窜出 3 v
+窜升 2 v
+窜扰 5 v
+窜改 29 v
+窜犯 3 v
+窜端匿迹 3 v
+窜网 3 v
+窜谋 3 v
+窜跑 3 v
+窜进 3 v
+窜逃 10 v
+窝 2084 v
+窝主 19 n
+窝停主人 3 n
+窝内 3 n
+窝囊 137 n
+窝囊废 27 n
+窝囊气 18 n
+窝头 28 n
+窝子 55 n
+窝家 2 n
+窝巢 21 n
+窝工 2 n
+窝心 16 n
+窝棚 151 n
+窝气 3 n
+窝沟龋 3 v
+窝洞 3 n
+窝洞涂剂 3 n
+窝洞预备 3 l
+窝火 39 n
+窝火憋气 3 z
+窝点 27 n
+窝瓜 3 n
+窝瓦河 3 n
+窝窝 35 n
+窝窝头 34 n
+窝藏 71 n
+窝藏祸心 3 l
+窝藏罪 3 n
+窝藏罪犯 3 n
+窝贼 3 n
+窝赃 5 v
+窝赃罪 3 vn
+窝轮 56 n
+窝边草 3 n
+窝逃 3 v
+窝里 3 n
+窝里反 3 l
+窝里斗 25 n
+窝里横 3 l
+窝里窝囊 3 n
+窝铺 34 n
+窝阔台 3 n
+窝风 3 n
+窞 55 zg
+窟 998 ng
+窟宅 5 n
+窟室 3 n
+窟穴 3 n
+窟窖 3 n
+窟窿 383 n
+窟窿眼 9 n
+窟窿眼儿 3 n
+窠 114 n
+窠巢 3 n
+窠穴 3 n
+窠臼 36 n
+窡 235 zg
+窢 2 zg
+窣 75 zg
+窣窣 3 z
+窥 436 v
+窥伺 75 v
+窥孔 3 v
+窥察 3 v
+窥寻 3 v
+窥度 3 n
+窥探 158 v
+窥探究竟 3 i
+窥探者 3 n
+窥望 17 v
+窥求 3 v
+窥测 43 v
+窥测孔 3 n
+窥牖小儿 3 z
+窥看 3 v
+窥知 3 v
+窥破 14 v
+窥见 56 v
+窥见一斑 3 i
+窥觅 3 v
+窥视 106 v
+窥视镜 3 n
+窥觎 3 v
+窥觑 2 v
+窥豹一斑 2 i
+窥镜 2 n
+窥闲伺隙 3 n
+窥间伺隙 3 n
+窦 503 zg
+窦丛生 6 nr
+窦入路 9 nr
+窦叔蒙 2 nr
+窦天章 2 nr
+窦太主 2 nr
+窦太后 80 nr
+窦娘娘 13 nr
+窦娥冤 3 v
+窦婴驻 3 nr
+窦宪兄弟 2 nr
+窦宪大 3 nr
+窦宪奉 2 nr
+窦家庄 2 nr
+窦少君 8 nr
+窦尔墩 2 nr
+窦尔泰 16 nr
+窦师伦 4 nr
+窦广国 2 nr
+窦建德 41 nr
+窦开远 66 nr
+窦性停搏 3 nr
+窦性心 2 nr
+窦总管 2 nr
+窦房结 33 nr
+窦房阻滞 3 n
+窦文娴 5 nr
+窦文涛 3 nr
+窦智孔 3 nr
+窦朝荣 2 nr
+窦桂梅 3 nr
+窦状 6 nr
+窦猗房 3 nr
+窦玉沛 6 nr
+窦皇后 38 nr
+窦纳乐 4 nr
+窦美仪 162 nr
+窦老太 2 nr
+窦融奉 2 nr
+窦融归 2 nr
+窦连东 11 nr
+窦道 12 nr
+窦长君 3 nr
+窦靖童 3 nr
+窨 58 v
+窨井 3 n
+窨井盖 3 n
+窬 82 zg
+窭 45 g
+窳 37 zg
+窸 43 zg
+窻 2 zg
+窿 7 n
+窿缘桉 3 n
+竃 2 zg
+竆 13 zg
+竈 5 zg
+竊 2 zg
+立 8334 v
+立三 7 d
+立上 3 d
+立下 542 d
+立世子 5 nr
+立业 33 n
+立业安邦 3 n
+立为 3 d
+立义海 2 nr
+立于 257 d
+立于不败 3 l
+立于不败之地 110 i
+立井 10 n
+立交 12 b
+立交化 2 j
+立交桥 119 n
+立交点 3 n
+立人 3 n
+立人达人 3 l
+立传 31 vn
+立位 3 n
+立住 3 d
+立体 839 n
+立体主义 3 n
+立体交叉 3 n
+立体仓库 3 n
+立体几何 18 l
+立体化 54 vn
+立体化学 3 l
+立体匹配 3 nz
+立体图 5 nr
+立体地图 3 i
+立体声 59 d
+立体广告 3 nr
+立体式 8 b
+立体影片 3 n
+立体性 3 b
+立体感 55 n
+立体战 3 vn
+立体技术 3 n
+立体挤压 3 i
+立体派 6 nr
+立体照片 3 n
+立体片 3 n
+立体电影 16 n
+立体电视 3 l
+立体画 3 n
+立体眼镜 3 l
+立体观察 3 nr
+立体角 10 n
+立体象对 3 l
+立体车库 3 n
+立体银幕 3 n
+立体镜 3 nr
+立体音响 3 l
+立候 3 d
+立储君 4 nr
+立像 22 v
+立元 6 q
+立元修 3 nr
+立元嗣 3 nr
+立元恭 5 nr
+立克 39 q
+立克式 2 nr
+立克次体 4 nz
+立党为公 6 i
+立党之本 3 l
+立其子 3 nr
+立冬 13 t
+立决 3 v
+立刘协 2 nr
+立刘崇 3 nr
+立刘恒 2 nr
+立刘盈 3 nr
+立刘言 2 nr
+立刘询 2 nr
+立刘豫 2 nr
+立刻 5871 d
+立功 340 nr
+立功受奖 3 n
+立功喜报 3 i
+立功援奖 3 n
+立功赎罪 22 i
+立升 3 v
+立卫王 2 nr
+立即 6937 d
+立即地址 3 nr
+立即行动 3 i
+立卷 3 m
+立原山 2 nr
+立叶尔 2 nr
+立号 3 n
+立司马昱 3 nr
+立名 3 v
+立命 3 vn
+立命召 2 nr
+立命安身 3 nz
+立和林 2 nr
+立嗣 3 nr
+立嗣君 2 nr
+立国 240 ns
+立国之本 3 l
+立国安邦 3 nz
+立地 53 d
+立地书厨 3 nz
+立地书橱 3 n
+立地成佛 17 i
+立地条件 3 n
+立场 3407 n
+立场坚定 3 n
+立场态度 3 n
+立场问题 3 n
+立大功 3 nr
+立太子 18 nr
+立太宗 2 nr
+立夷男 2 nr
+立契 3 nr
+立好 3 d
+立委 114 j
+立姿 3 n
+立姿射击 3 l
+立子亮 3 nr
+立安敦 2 ns
+立宋徽 3 nr
+立定 122 d
+立宣帝 7 nr
+立宪 243 j
+立宪之 3 nr
+立宪保 2 nr
+立宪国 3 nr
+立宪密 2 nr
+立宪政体 3 n
+立宪期 3 nr
+立宪民主 3 n
+立宪派 81 nr
+立宪诸 16 nr
+立宪运动 3 nz
+立射 3 v
+立少子 2 nr
+立山区 3 ns
+立崇祯 2 nr
+立常洛 3 nr
+立幼君 2 nr
+立庐陵 2 nr
+立建子 2 nr
+立异 3 n
+立式 94 b
+立得 23 d
+立御史 2 nr
+立德 23 nr
+立志 203 n
+立志传 3 nr
+立息 3 n
+立意 156 d
+立成 3 v
+立成仪 3 nr
+立户 7 n
+立抚军 2 nr
+立据 3 n
+立敬瑭 2 nr
+立文帝 3 nr
+立新 51 d
+立新功 3 nr
+立新君 37 nr
+立新帝 2 nr
+立方 959 q
+立方体 50 nr
+立方公分 3 q
+立方公寸 3 q
+立方公尺 3 q
+立方公里 15 q
+立方分米 3 q
+立方厘米 28 q
+立方形 3 n
+立方根 5 nr
+立方毫米 9 q
+立方码 3 n
+立方米 516 q
+立方英寸 3 q
+立方英尺 11 q
+立时 1805 d
+立时三刻 3 i
+立昌邑 2 nr
+立明宗 7 nr
+立晋王 2 nr
+立普斯 3 nr
+立曼科 2 nr
+立有 3 v
+立朝纲 2 nr
+立木 12 nr
+立木南门 3 ns
+立本 3 d
+立朱祁 5 nr
+立杨勇 3 nr
+立杨隆 3 nr
+立板 3 n
+立枯病 3 n
+立柜 30 n
+立柱 97 nr
+立柱式 4 nr
+立桂王 5 nr
+立桂藩 7 nr
+立案 266 n
+立案侦察 3 n
+立案侦查 3 n
+立案查处 3 n
+立案率 3 n
+立案监督 3 j
+立楚公子 2 nr
+立楚怀 3 nr
+立止血 3 i
+立正 104 d
+立正口令 3 i
+立此存照 6 i
+立武氏 4 nr
+立武王 3 nr
+立江夏 2 nr
+立法 2801 d
+立法会 116 j
+立法委员 26 n
+立法局 3 n
+立法机关 3 l
+立法机构 3 n
+立法权 1406 nr
+立法法 12 nr
+立法者 257 n
+立法院 3 l
+立派 12 n
+立消 3 v
+立渠帅 2 nr
+立潞王 9 nr
+立灵帝 2 nr
+立炀帝 5 nr
+立特勤 3 nr
+立状 3 n
+立现 3 v
+立甘宗 2 nr
+立生 3 v
+立白 3 v
+立眉瞪眼 3 i
+立真金 2 nr
+立石敬 7 nr
+立石梁 2 nr
+立破义 2 nr
+立碑 3 n
+立碑纪 3 nr
+立福临 4 nr
+立福晋 2 nr
+立福王 14 nr
+立福藩 8 nr
+立窝尼 3 nr
+立端王 4 nr
+立竿 3 n
+立竿见影 60 i
+立等 24 b
+立等可取 3 l
+立约 23 d
+立统军 2 nr
+立耶律 2 nr
+立耶律淳 5 nr
+立耶律齐 4 nr
+立脚 3 n
+立脚点 6 n
+立英宗 4 nr
+立萧绎 3 nr
+立蒙哥 2 nr
+立行泉 2 nr
+立见 3 v
+立见好转 3 i
+立视图 3 n
+立言 24 n
+立誓 125 v
+立论 135 n
+立诸吕 2 nr
+立谈之间 3 i
+立账 3 v
+立起 3 v
+立足 719 d
+立足之地 82 i
+立足于 3 v
+立足未稳 34 i
+立足本职 3 n
+立足点 111 n
+立身 120 d
+立身处世 15 i
+立身扬名 4 i
+立身行事 7 i
+立身行己 3 i
+立转窗 3 n
+立轴 31 n
+立载漪 3 nr
+立达 2 nr
+立遗嘱 3 n
+立邦漆 3 n
+立钦察 2 nr
+立铣刀 3 nr
+立锥之地 6 l
+立镜 3 n
+立院 3 n
+立陶夫 5 nr
+立陶宛 269 nr
+立陶宛人 10 nr
+立陶宛共和国 4 ns
+立陶宛语 12 nz
+立集东 3 nr
+立雾溪 3 nr
+立面 19 d
+立面图 3 n
+立项 419 b
+立顿 4 q
+立领 9 v
+立马 491 ns
+立马万言 3 i
+立马儿 11 nr
+立鹤方 5 nr
+立麻力 18 nr
+竑 43 zg
+竖 1185 v
+竖井 84 n
+竖写 3 v
+竖列 3 v
+竖勾 3 n
+竖向 7 v
+竖吹 7 v
+竖子 13 n
+竖子成名 3 n
+竖干 3 n
+竖弯勾 3 n
+竖心旁 3 n
+竖排 10 v
+竖旗 5 n
+竖条 6 n
+竖炉 10 n
+竖琴 88 n
+竖直 32 v
+竖眉瞪眼 3 v
+竖眼 3 n
+竖穴墓 16 n
+竖立 282 v
+竖立起来 3 v
+竖笛 15 n
+竖线 12 n
+竖蜻蜓 8 n
+竖行 3 v
+竖调 3 v
+竖起 388 v
+竖起脊梁 3 n
+竘 2 zg
+站 23194 v
+站上 116 s
+站上去 3 v
+站上来 3 l
+站下 3 s
+站不住 3 v
+站不住脚 63 l
+站不稳 3 l
+站不起来 3 l
+站位 31 n
+站住 625 v
+站住脚 55 n
+站内 3 s
+站内搜索 3 l
+站出 3 v
+站前区 3 s
+站务 3 n
+站务员 3 n
+站务管理 3 n
+站区 8 n
+站友 3 n
+站口 3 s
+站台 359 n
+站台票 8 n
+站台雨棚 3 n
+站名 24 v
+站哨 3 n
+站场 22 n
+站址 6 n
+站定 3 v
+站岗 97 v
+站岗放哨 3 n
+站得住 3 v
+站得住脚 10 l
+站房 13 n
+站拢 3 v
+站柜台 7 n
+站段 5 n
+站法 3 n
+站点 210 n
+站牌 32 n
+站着不动 3 l
+站票 5 n
+站稳 209 v
+站稳立场 3 n
+站稳脚步 3 n
+站稳脚跟 3 n
+站立 943 v
+站立起来 3 l
+站端 3 n
+站级 3 n
+站网 3 n
+站脚助威 3 n
+站街女 3 l
+站起 3 s
+站进去 3 l
+站进来 3 l
+站里 4 s
+站长 778 v
+站长站 3 n
+站长网 3 n
+站间试压 3 n
+站队 46 n
+竝 2 zg
+竞 1130 vn
+竞业禁止 3 l
+竞买 26 v
+竞买人 3 n
+竞买价 3 n
+竞买者 4 n
+竞争 5985 vn
+竞争上岗 3 n
+竞争剂 3 n
+竞争力 1310 n
+竞争变迁 3 v
+竞争对手 3 n
+竞争心 3 n
+竞争性 79 n
+竞争手段 3 n
+竞争机制 3 n
+竞争法 20 n
+竞争者 148 n
+竞争能力 14 n
+竞今疏古 3 n
+竞价 42 vn
+竞价排名 3 l
+竞公疏古 3 n
+竞合 3 vn
+竞向 3 n
+竞夺 3 v
+竞岗 2 vn
+竞开 4 v
+竞得 6 v
+竞技 430 n
+竞技体操 17 n
+竞技场 61 n
+竞技性 6 n
+竞技扬 3 n
+竞技状态 3 n
+竞技队 5 n
+竞技风暴 3 n
+竞投 3 v
+竞投人 3 n
+竞折腰 4 n
+竞拍 29 v
+竞拍者 3 n
+竞斗 3 vn
+竞日 3 vn
+竞春 3 vn
+竞标 97 n
+竞标者 3 n
+竞渡 70 v
+竞猜 52 v
+竞猜活动 3 vn
+竞用 3 vn
+竞相 347 n
+竞相压价 3 n
+竞相奔走 3 l
+竞短争长 3 n
+竞秀 9 n
+竞聘 24 v
+竞聘上岗 3 n
+竞聚率 2 n
+竞自 3 v
+竞艳 3 v
+竞试 3 vn
+竞购 39 vn
+竞赛 1213 vn
+竞赛奖 6 n
+竞赛心理 3 n
+竞赛活动 3 l
+竞赛者 3 n
+竞赛部 4 n
+竞赛题 3 n
+竞走 64 v
+竞走比赛 3 n
+竞走运动 3 l
+竞跑 3 v
+竞选 778 vn
+竞选人 5 n
+竞选活动 3 l
+竞逐 13 v
+竞速 8 n
+竞速赛 2 n
+竞销 2 vn
+竞驰 2 v
+竟 10875 d
+竟为 3 d
+竟争力 3 v
+竟于 3 d
+竟址 3 v
+竟夕 3 ns
+竟夜 3 d
+竟敢 401 d
+竟日 3 d
+竟日来 3 ns
+竟是 2299 d
+竟未 3 d
+竟来 3 d
+竟然 6640 d
+竟猜 3 v
+竟用 3 v
+竟而 3 d
+竟自 155 d
+竟至 3 d
+竟要 3 d
+竟购 3 v
+竟陵 298 ns
+竟需 3 v
+竟须 3 d
+章 6128 q
+章三爷 2 nr
+章与章 2 nr
+章丘 23 nr
+章丘县 5 nr
+章丘市 30 ns
+章乃器 34 nr
+章亚若 11 nr
+章京 23 ns
+章京中 2 nr
+章京吼 2 nr
+章京统 2 nr
+章以功 3 nr
+章会客 2 nr
+章伯钧 9 nr
+章伯颜 2 nr
+章佳氏 2 nr
+章允儒 9 nr
+章公公 5 nr
+章典制 3 nr
+章则 26 n
+章前冠 2 nr
+章动 3 n
+章动角 3 n
+章十爷 3 nr
+章华寺 2 nr
+章句 41 n
+章句之徒 3 n
+章句小儒 3 n
+章可循 2 nr
+章可查 2 nr
+章台杨柳 3 nr
+章台柳 3 nr
+章名涛 2 nr
+章含之 22 nr
+章启月 224 nr
+章哈麻 4 nr
+章嘉呼 11 nr
+章回 5 nr
+章回体 2 nr
+章回小说 22 n
+章坪镇 7 nr
+章士钊 29 nr
+章大郎 173 nr
+章太炎 75 nr
+章子 6 nr
+章子仪 3 nr
+章子峰 2 nr
+章子怡 11 nr
+章子曾 2 nr
+章孝严 15 nr
+章孝慈 11 nr
+章学诚 29 nr
+章完纳 3 nr
+章宗祥 533 nr
+章帝建 16 nr
+章开沅 9 nr
+章微露 2 nr
+章德皇后 2 nr
+章念生 3 nr
+章怀太子 8 nr
+章恭迎 2 nr
+章攻杨 3 nr
+章明基 3 nr
+章有法 2 nr
+章服 7 n
+章札委 2 nr
+章楚红 121 nr
+章正宸 4 nr
+章汉夫 3 nr
+章沁生 4 nr
+章法 168 n
+章海贤 3 nr
+章炳麟 44 nr
+章率兵 3 nr
+章甫荐履 3 nr
+章目 2 n
+章程 1318 n
+章立凡 2 nr
+章素存 2 nr
+章老三 11 nr
+章节 198 n
+章节数 3 n
+章草 21 nr
+章虚道人 4 nr
+章行严 2 nr
+章衣萍 2 nr
+章贡区 3 nr
+章进举 2 nr
+章进怒 2 nr
+章进笑 2 nr
+章钦臣 14 nr
+章锡琛 2 nr
+章门 3 n
+章闻言 2 nr
+章鱼 37 nr
+章鱼村 3 nr
+章鱼烧 3 n
+章鸿钊 3 nr
+竣 13 v
+竣事 3 v
+竣工 687 v
+童 1797 nr
+童一剑 3 nr
+童书业 2 n
+童仆 25 nr
+童从社 4 nr
+童从稷 3 nr
+童以备 2 nr
+童便 2 nr
+童儿 48 nr
+童儿忽 2 nr
+童儿睡 2 nr
+童兆和 14 nr
+童先生 4 nr
+童养媳 25 nr
+童军 3 nr
+童军鹏 4 nr
+童化金 3 n
+童叟无欺 18 i
+童合立 2 nr
+童吴升 3 nr
+童坦君 3 nr
+童声 13 nr
+童声版 3 n
+童大人 4 nr
+童大哥 12 nr
+童大海 29 nr
+童大焕 2 nr
+童大爷 2 nr
+童太尉 10 nr
+童夫人 2 nr
+童夫尧 6 nr
+童女 17 n
+童妓 3 n
+童子 562 nr
+童子军 34 nr
+童子功 3 nr
+童子痨 3 n
+童子试 6 nr
+童子鸡 3 nr
+童安格 3 nr
+童宣抚 28 nr
+童尊礼 2 nr
+童山 13 nr
+童山濯濯 3 nr
+童工 86 nr
+童席 3 n
+童年 461 t
+童年无忌 3 l
+童年时代 3 t
+童年时期 3 t
+童年期 3 t
+童年阴影 3 n
+童庆炳 2 nr
+童庆禧 256 nr
+童心 91 n
+童心未泯 7 l
+童志成 50 nr
+童怀道 27 nr
+童时入 2 nr
+童星 5 nr
+童晓渝 3 nr
+童正维 3 nr
+童气 2 n
+童渊铭 4 nr
+童炳强 3 nr
+童爱玲 3 nr
+童牛角马 3 nr
+童球溪 2 nr
+童生 20 nr
+童男 54 nr
+童男童女 49 nr
+童百熊 57 nr
+童相斗 2 nr
+童真 15 nr
+童稚 18 n
+童立本 121 nr
+童自荣 3 nr
+童蒙 5 nr
+童袜 2 n
+童装 278 n
+童装店 3 n
+童裤 3 n
+童言戏语 3 i
+童言无忌 6 i
+童话 388 n
+童话世界 3 n
+童话剧 9 n
+童话国 3 nr
+童话故事 3 i
+童话般 3 l
+童话集 16 nr
+童谣 61 nr
+童贞 25 nr
+童贯之 6 nr
+童贯令 2 nr
+童贯入 2 nr
+童贯再 2 nr
+童贯军 2 nr
+童贯则 2 nr
+童贯只 3 nr
+童贯启 2 nr
+童贯幕 2 nr
+童贯才 2 nr
+童贯早 2 nr
+童贯明 3 nr
+童贯来 3 nr
+童贯派 3 nr
+童贯真 2 nr
+童贯而 3 nr
+童贯见 2 nr
+童趣 17 n
+童跟著 2 nr
+童身 3 n
+童车 16 n
+童进来 2 nr
+童长剑 3 nr
+童鞋 3 nr
+童音 10 n
+童颜 11 nr
+童颜鹤发 9 nr
+竦 219 g
+竫 11 zg
+竭 261 d
+竭之不用 3 l
+竭力 1044 d
+竭力反对 3 i
+竭力支持 3 i
+竭力虔心 3 z
+竭尽 91 d
+竭尽全力 164 i
+竭尽力量 3 l
+竭尽心力 3 i
+竭尽忠诚 3 l
+竭尽所能 23 i
+竭尽棉薄 3 v
+竭心 3 d
+竭忠尽智 3 i
+竭智尽力 3 i
+竭智尽忠 3 i
+竭智尽虑 3 i
+竭泽焚薮 3 n
+竭泽而渔 21 i
+竭泽而鱼 3 i
+竭能 3 d
+竭虑 3 v
+竭诚 52 d
+竭诚尽节 3 i
+竭诚拥护 3 i
+竭诚服务 3 i
+竭诚欢迎 3 i
+竭诚相待 3 i
+端 5639 v
+端上 3 t
+端上去 3 t
+端上来 3 t
+端下 3 t
+端下去 3 t
+端下来 3 t
+端丽 28 a
+端举 3 v
+端人正士 3 nz
+端佯 3 v
+端倪 220 n
+端倪可察 3 nr
+端公 6 n
+端出 3 v
+端出去 3 v
+端出来 3 v
+端午 60 t
+端午节 123 t
+端去 3 t
+端口 174 n
+端口号 10 n
+端口地址 3 n
+端口扫描 3 n
+端口数 4 n
+端口映射 3 n
+端口配置 2 n
+端向配位 3 n
+端坐 264 v
+端头 5 n
+端子 15 n
+端子台 3 n
+端子板 3 n
+端尖 3 n
+端居 3 v
+端州 12 ns
+端州区 3 ns
+端平 21 n
+端庄 231 ns
+端拱 10 nz
+端掉 11 v
+端接 3 v
+端整 3 a
+端方 23 n
+端木 46 n
+端木元 3 nr
+端木蕻良 2 nr
+端本正源 3 n
+端本澄源 3 nr
+端机 3 n
+端来 3 t
+端来端去 3 z
+端架子 3 n
+端正 385 nz
+端正党风 3 nz
+端水 3 n
+端点 36 n
+端王 24 nrt
+端电压 16 n
+端的 520 z
+端的正士 3 n
+端盖 4 v
+端盘子 3 n
+端直 3 v
+端相 4 n
+端砚 19 n
+端碗 3 n
+端端正正 59 z
+端粒 3 n
+端粒酶 3 nz
+端系统 3 n
+端纳 2 v
+端线 41 n
+端绪 16 n
+端网络 2 n
+端肽 3 n
+端节 3 t
+端茶 3 n
+端茶递水 3 n
+端菜 3 n
+端视 3 v
+端详 249 v
+端赖 3 v
+端过去 3 v
+端过来 3 v
+端部联会 3 n
+端酒 3 n
+端量 51 n
+端门 549 n
+端阳 35 ns
+端阳节 58 t
+端雅 3 a
+端面 18 n
+竳 27 zg
+竴 3048 zg
+竵 131 zg
+競 8 zg
+竷 227 zg
+竸 2 zg
+竹 3911 ng
+竹下 9 n
+竹下登 4 nr
+竹东 3 n
+竹东镇 2 ns
+竹丝 4 n
+竹乡 260 n
+竹书 3 n
+竹书纪年 97 n
+竹亭 13 nz
+竹入 3 n
+竹内 5 nz
+竹凳 3 n
+竹制 31 n
+竹制品 10 n
+竹刻 19 n
+竹剑 3 n
+竹北 3 ns
+竹南 3 ns
+竹叶 53 n
+竹叶山 3 n
+竹叶青 19 nr
+竹君 3 n
+竹器 41 n
+竹园 279 n
+竹园村 3 n
+竹园镇 2 ns
+竹围 3 n
+竹地板 3 n
+竹头 3 n
+竹头木屑 3 n
+竹子 241 n
+竹子林 3 n
+竹子湖 3 nr
+竹屋 15 n
+竹山 279 ns
+竹山县 263 ns
+竹岐 4 nrt
+竹岛 18 n
+竹工 3 n
+竹工业 3 n
+竹布 16 n
+竹帘 44 n
+竹帘子 3 n
+竹帘画 2 n
+竹帛 12 n
+竹帛之功 3 nr
+竹席 13 n
+竹床 3 n
+竹影 6 n
+竹扉 3 n
+竹报 3 n
+竹报平安 3 nz
+竹排 25 n
+竹木 77 n
+竹木简 5 nr
+竹杆 3 n
+竹材 31 n
+竹杠 18 n
+竹条 12 n
+竹板 25 n
+竹板书 2 n
+竹林 316 nz
+竹林七贤 3 nz
+竹林中 18 nz
+竹林寺 3 nz
+竹林精舍 3 n
+竹林路 3 nz
+竹林镇 13 ns
+竹枝 45 n
+竹枝词 7 n
+竹架 3 n
+竹柏异心 3 nr
+竹栅 3 n
+竹栏 3 n
+竹根 12 nz
+竹桃霉素 3 n
+竹桥 36 n
+竹棍 12 n
+竹棒 3 n
+竹椅 46 n
+竹楼 24 n
+竹榄里 3 n
+竹榻 16 n
+竹歧 3 n
+竹沥 3 nz
+竹浆 3 n
+竹海 10 ns
+竹溪 525 nz
+竹溪县 260 ns
+竹炭 3 n
+竹片 38 n
+竹牌 15 n
+竹琴 3 n
+竹盒 2 n
+竹竿 201 n
+竹笋 73 n
+竹笋乾 3 ns
+竹笋汤 3 v
+竹笛 12 n
+竹笠 11 n
+竹笼 17 n
+竹筏 153 n
+竹筐 22 n
+竹筒 187 n
+竹筒倒豆子 16 nz
+竹筒子 2 n
+竹筒饭 5 n
+竹筷 25 n
+竹签 55 n
+竹签子 2 n
+竹简 136 n
+竹箍 3 nz
+竹管 27 n
+竹箩 3 n
+竹箫 2 n
+竹箫斋 4 nr
+竹箱 3 n
+竹箱子 3 n
+竹篓 58 n
+竹篓子 2 n
+竹篙 71 n
+竹篮 67 nz
+竹篮打水 2 l
+竹篮打水一场空 12 l
+竹篱 27 n
+竹篱笆 3 n
+竹篱茅舍 3 ns
+竹篾 42 n
+竹簧 3 n
+竹纤维 3 l
+竹纸 5 n
+竹编 60 n
+竹胶板 3 n
+竹膜 3 n
+竹节 39 n
+竹节参 3 n
+竹节状 2 n
+竹节石 14 n
+竹节纱 3 n
+竹节虫 15 n
+竹芋 3 n
+竹花 3 n
+竹苇 3 n
+竹苞松茂 3 n
+竹茹 6 nr
+竹荪 14 nz
+竹蔗 3 n
+竹藤 10 nz
+竹野内丰 3 nz
+竹钉 3 n
+竹雕 15 n
+竹鞭 2 n
+竹韵 3 n
+竹马 8 nz
+竹马之交 3 l
+竹马之友 3 nz
+竹鸡 5 n
+竹黄 10 n
+竺 67 nr
+竺叔兰 2 nr
+竺可桢 30 nr
+竺娲颍 2 nr
+竺法护 5 nr
+竺监藏 2 nr
+竻 144 zg
+竼 2 zg
+竽 82 g
+竾 45 zg
+竿 281 ng
+竿头 3 n
+竿头一步 3 n
+竿头日上 3 n
+竿头日进 3 n
+竿头直上 3 n
+竿子 31 n
+笀 82 zg
+笁 238 zg
+笂 994 zg
+笃 550 ag
+笃信 68 v
+笃信好学 3 v
+笃厚 3 a
+笃学 3 v
+笃学不倦 3 v
+笃学好古 3 v
+笃守 3 v
+笃定 52 v
+笃定泰山 3 vn
+笃实 9 z
+笃志 4 v
+笃志好学 3 v
+笃敬 3 z
+笃新怠旧 3 l
+笃深 3 v
+笃爱 3 v
+笃疾 3 z
+笃直 3 z
+笃笃 3 z
+笃而论之 3 v
+笃行 3 v
+笃行不倦 3 v
+笃论高言 3 v
+笃诚 3 a
+笃近举远 3 v
+笄 57 g
+笅 1390 zg
+笆 158 n
+笆斗 5 n
+笆篓 3 n
+笆篱 3 n
+笇 21 zg
+笈 190 g
+笉 2798 zg
+笊 29 n
+笊篱 21 n
+笋 157 n
+笋丝 7 n
+笋乾 3 ns
+笋壳 11 n
+笋头 3 n
+笋子 8 n
+笋尖 4 n
+笋干 41 n
+笋瓜 11 n
+笋竹 3 n
+笋芽 3 n
+笋衣 3 n
+笋鸡 3 n
+笌 43 zg
+笍 9 zg
+笎 18 zg
+笏 69 zg
+笐 11 zg
+笑 32256 v
+笑一笑 3 l
+笑不可仰 3 l
+笑不笑 3 l
+笑个痛快 3 l
+笑乐 3 n
+笑了笑 3 l
+笑了起来 3 l
+笑傲 59 nr
+笑傲江湖 3 nr
+笑傲群芳 3 nr
+笑傲风月 3 i
+笑儿 8 n
+笑出眼泪 3 i
+笑剧 18 n
+笑口 6 n
+笑口常开 7 i
+笑可藏刀 3 i
+笑吟吟 344 z
+笑呵呵 40 z
+笑咧咧 3 z
+笑咪咪 14 n
+笑哈哈 10 z
+笑嗲 3 l
+笑嘻嘻 556 z
+笑地 3 n
+笑场 3 n
+笑声 1011 n
+笑嫣然 3 i
+笑容 1456 n
+笑容可掬 72 i
+笑容满面 49 l
+笑对人生 3 n
+笑开颜 3 nr
+笑影 5 n
+笑微微 2 z
+笑意 332 n
+笑掉大牙 2 l
+笑料 25 n
+笑星 20 n
+笑来笑去 3 i
+笑林 5 n
+笑柄 41 n
+笑止万千 3 i
+笑死人 3 n
+笑比河清 3 l
+笑气 3 n
+笑江湖 3 nr
+笑琴 2 n
+笑盈盈 42 z
+笑看人生 3 i
+笑眯眯 227 z
+笑破肚皮 3 n
+笑窝 2 n
+笑笑 423 v
+笑笑生 3 i
+笑答 3 v
+笑红尘 3 n
+笑纳 47 v
+笑纹 8 n
+笑翻天 3 i
+笑而不答 41 l
+笑脸 1419 n
+笑脸攻势 3 n
+笑脸相迎 30 i
+笑脸迎人 3 l
+笑脸鬼 3 l
+笑蒙 3 z
+笑言 3 n
+笑话 1087 n
+笑话书 3 n
+笑话百出 2 i
+笑话站 3 n
+笑话网 3 n
+笑语 112 n
+笑谈 66 v
+笑貌 4 n
+笑贫不笑娼 5 i
+笑逐频开 3 i
+笑逐颜开 66 i
+笑醒 3 v
+笑里藏刀 21 n
+笑闹 3 z
+笑非 14 v
+笑面 3 n
+笑面外交 3 i
+笑面夜叉 3 l
+笑面虎 15 n
+笑靥 57 n
+笑颜 33 n
+笑骂 86 v
+笓 17 zg
+笔 3249 n
+笔下 199 n
+笔下有铁 3 n
+笔下生花 2 n
+笔下生辉 3 n
+笔下留情 3 n
+笔下超生 3 i
+笔伐 3 n
+笔伐口诛 3 n
+笔会 56 n
+笔体 3 n
+笔供 3 v
+笔债 3 n
+笔冢研穿 3 nz
+笔刀砚城 3 ns
+笔划 77 n
+笔削 3 v
+笔削褒贬 3 v
+笔力 54 n
+笔力扛鼎 3 v
+笔势 26 n
+笔参造化 3 n
+笔友 3 n
+笔受 3 v
+笔名 180 n
+笔名着作 3 l
+笔墨 362 n
+笔墨之林 3 l
+笔墨官司 9 n
+笔墨横姿 3 i
+笔墨生涯 3 n
+笔墨纸砚 23 n
+笔头 44 n
+笔头儿 3 n
+笔头生花 3 n
+笔套 4 n
+笔字 4 n
+笔尖 65 n
+笔帽 18 n
+笔底下 3 n
+笔底春风 3 n
+笔底生花 3 n
+笔底超生 3 ns
+笔底龙蛇 3 n
+笔座 3 n
+笔式 3 n
+笔录 103 n
+笔形 3 n
+笔心 3 n
+笔意 55 n
+笔战 3 n
+笔手 2 n
+笔扫千军 3 i
+笔挺 68 z
+笔数 10 n
+笔断意连 3 ns
+笔札 3 n
+笔杆 37 n
+笔杆儿 4 n
+笔杆子 33 n
+笔架 2855 n
+笔架山 1306 n
+笔格 3 n
+笔歌墨舞 3 l
+笔法 218 n
+笔洗 13 n
+笔润 3 n
+笔画 173 n
+笔画数 3 n
+笔盒 3 n
+笔直 429 z
+笔砚 60 n
+笔立 3 v
+笔端 21 n
+笔笔 4 n
+笔筒 29 n
+笔答 4 v
+笔简意深 3 i
+笔算 4 n
+笔管 12 n
+笔管条直 3 n
+笔翰如流 3 vn
+笔老墨秀 3 i
+笔者 1150 n
+笔耕 17 n
+笔耕不辍 12 l
+笔耕墨来 3 l
+笔耕墨耘 3 n
+笔耕砚田 3 v
+笔致 47 n
+笔舌 3 n
+笔芯 6 n
+笔袋 3 n
+笔触 114 n
+笔记 515 n
+笔记型 3 n
+笔记型电脑 8 n
+笔记本 930 n
+笔记本型 3 n
+笔记本电脑 100 n
+笔记簿 3 n
+笔译 19 n
+笔试 338 n
+笔诛墨伐 3 i
+笔误 15 n
+笔调 57 n
+笔谈 20 n
+笔谭 3 i
+笔贴式 3 n
+笔资 3 n
+笔走龙蛇 6 n
+笔路 8 n
+笔述 3 n
+笔迹 139 n
+笔迹特征 3 n
+笔道 3 n
+笔酣墨饱 3 i
+笔铅 3 n
+笔锋 40 n
+笔门造车 3 n
+笔阵 3 n
+笔顺 2 ns
+笔食瓢饮 3 l
+笔饱墨酣 3 i
+笕 53 g
+笕济学家 3 nr
+笖 208 zg
+笘 63 zg
+笙 488 n
+笙歌 170 n
+笙磬同音 3 v
+笙箫 3 n
+笙簧 3 n
+笚 9 zg
+笛 981 nr
+笛卡儿 3 nr
+笛卡尔 93 nr
+笛声 170 n
+笛子 196 n
+笛子曲 3 nr
+笛手 3 n
+笛管 3 n
+笛膜 3 n
+笛音 7 n
+笜 2 zg
+笞 134 vg
+笞击 3 nr
+笞杖 3 nr
+笞责 3 nr
+笞辱 3 nr
+笟 42 zg
+笠 179 nr
+笡 6 zg
+笢 332 zg
+笣 30 zg
+笤 79 n
+笤帚 52 n
+笥 91 zg
+符 798 v
+符一镜 4 nr
+符一音 2 nr
+符五世 2 nr
+符兵 8 n
+符兹堡 8 nr
+符卫建 5 nr
+符取 2 v
+符召 3 v
+符号 1235 n
+符号串 4 n
+符号分析 3 n
+符号化 11 n
+符号学 10 n
+符号差 3 n
+符号库 3 n
+符号执行 3 n
+符号智能 3 n
+符号检验 3 n
+符号表 3 n
+符号计算 3 n
+符号论 3 n
+符号语言 3 n
+符号逻辑 3 n
+符号长 4 n
+符合 4421 v
+符合中国 10 ns
+符合事实 3 n
+符合人体 2 n
+符合卫生 3 n
+符合国家 7 n
+符合国情 3 n
+符合国际 5 n
+符合实际 3 n
+符合条件 5 n
+符合条件者 6 n
+符合标准 2 n
+符合率 3 n
+符合要求 5 n
+符合规定 6 n
+符合规律 3 n
+符合规范 8 n
+符合门 3 n
+符命 3 v
+符咒 53 v
+符圣使 7 nr
+符在王 3 nr
+符坚令 2 nr
+符坚载 2 nr
+符头 3 v
+符字景 2 n
+符宝郎 3 nr
+符尾 3 n
+符山石 9 nr
+符应 3 v
+符拉基 2 nr
+符拉迪 3 nr
+符拉迪沃斯托克 28 ns
+符敏仪 11 nr
+符标 2 n
+符水 9 n
+符水驱 2 nr
+符泉生 9 nr
+符滕堡 7 nr
+符玉晶 3 nr
+符玺郎 2 nr
+符瑞 9 nr
+符登 3 v
+符码 2 n
+符破玺 2 nr
+符福渊 20 nr
+符离 3 v
+符签 3 v
+符箓 38 n
+符籙 3 vn
+符腾堡 25 nr
+符节 25 n
+符阴 2 n
+符验 3 v
+笧 3 zg
+笨 491 zg
+笨人 18 n
+笨伯 4 n
+笨办法 3 n
+笨口拙舌 3 i
+笨嘴 3 n
+笨嘴拙腮 3 i
+笨嘴拙舌 4 i
+笨嘴笨舌 7 l
+笨头笨脑 10 l
+笨家伙 6 l
+笨小孩 3 n
+笨手笨脚 37 l
+笨拙 165 a
+笨桶 3 n
+笨死 3 a
+笨死了 3 l
+笨活 2 a
+笨牛 3 n
+笨猪 3 n
+笨瓜 3 n
+笨笨 3 a
+笨笨呆呆 3 z
+笨笨熊 3 l
+笨笨猪 3 l
+笨蛋 77 n
+笨货 3 n
+笨贼 3 n
+笨重 191 a
+笨鸟 3 n
+笨鸟先飞 5 i
+笩 13 zg
+笪 54 nr
+笫 92 g
+第 23112 m
+第一 17725 m
+第一一七回 2 m
+第一一三回 2 m
+第一一九回 3 m
+第一一二回 2 m
+第一一五 18 m
+第一一五回 2 m
+第一一八回 2 m
+第一一六回 2 m
+第一一四回 2 m
+第一一零回 2 m
+第一七 4 m
+第一三一 5 m
+第一三五 2 m
+第一世界 10 nz
+第一个 4092 m
+第一义 3 nz
+第一书记 3 nz
+第一二 23 m
+第一二九 18 m
+第一二二 2 m
+第一二零回 2 m
+第一产业 527 l
+第一人称 3 n
+第一代 385 m
+第一件 436 m
+第一任 198 m
+第一份 121 m
+第一位 650 m
+第一例 28 m
+第一信使 3 nz
+第一信号 3 nz
+第一八 3 m
+第一八八 2 m
+第一六三 2 m
+第一关 3 l
+第一具 4 m
+第一册 16 m
+第一军医大学 5 nt
+第一击 3 l
+第一刀 8 m
+第一分 290 m
+第一分钟 2 m
+第一列 45 m
+第一副 146 m
+第一劝业银行 5 nt
+第一匹 2 m
+第一千 2 m
+第一千九百三十七年 2 m
+第一印象 3 l
+第一卷 352 m
+第一双 3 m
+第一发 8 m
+第一口 36 m
+第一句 186 m
+第一台 343 m
+第一号 95 m
+第一名 543 m
+第一员 2 m
+第一周 49 m
+第一品 5 m
+第一响 2 m
+第一四八 2 m
+第一回 57 m
+第一团 5 m
+第一国际 61 l
+第一圈 9 m
+第一场 141 m
+第一场次 2 m
+第一块 33 m
+第一堂 8 m
+第一堵 4 m
+第一声 38 m
+第一处 12 m
+第一夜 15 m
+第一天 603 m
+第一夫人 20 nz
+第一套 37 m
+第一季 28 m
+第一季度 3 l
+第一审 3 b
+第一家 299 m
+第一封 20 m
+第一尊 3 m
+第一局 46 m
+第一层 104 m
+第一届 875 m
+第一峰 269 m
+第一席 5 m
+第一幅 28 m
+第一幕 11 m
+第一幢 3 m
+第一年 181 m
+第一座 277 m
+第一张 92 m
+第一弦 3 nr
+第一性 28 nz
+第一战 3 nz
+第一户 2 m
+第一所 70 m
+第一手 105 m
+第一批 1068 m
+第一把 42 m
+第一把手 15 m
+第一抹 2 m
+第一拖拉机 4 l
+第一招 73 m
+第一拳 8 m
+第一排 23 m
+第一支 77 m
+第一斜桅 3 nr
+第一晚 3 t
+第一曲 2 m
+第一期 414 m
+第一本 104 m
+第一朵 2 m
+第一村 10 nz
+第一束 5 m
+第一条 269 m
+第一杯 21 m
+第一枚 48 m
+第一枝 6 m
+第一枪 60 m
+第一架 165 m
+第一根 27 m
+第一案 9 m
+第一桌 3 m
+第一桩 7 m
+第一桶 32 m
+第一桶金 3 n
+第一次 6509 m
+第一次世 3 nz
+第一次世界大战 1151 nz
+第一次国内革命战争 40 nz
+第一次鸦片战争 27 nz
+第一款 55 m
+第一步 540 m
+第一段 48 m
+第一波 3 nz
+第一流 185 l
+第一滴 3 m
+第一炮 3 l
+第一点 69 m
+第一片 8 m
+第一版 32 nz
+第一班 4 m
+第一瓶 3 m
+第一百 3 m
+第一百七 2 m
+第一百七十条 2 m
+第一百三十四条 3 m
+第一百个 2 m
+第一百九十一条 2 m
+第一百九十七条 2 m
+第一百九十六条 2 m
+第一百五 4 m
+第一百五十 3 m
+第一百五十二条 2 m
+第一百五十四条 2 m
+第一百八 3 m
+第一百八十三条 2 m
+第一百八十四条 2 m
+第一百六十一条 2 m
+第一百六十三条 2 m
+第一百六十四 2 m
+第一百六十四条 2 m
+第一百回 3 m
+第一百张 2 m
+第一百零一个 2 m
+第一百零七条 2 m
+第一百零九条 2 m
+第一百零六回 2 m
+第一盆 2 m
+第一盏 3 m
+第一盘 62 m
+第一目 7 m
+第一眼 78 m
+第一碗 6 m
+第一票 7 m
+第一种 542 m
+第一积分 3 l
+第一站 43 m
+第一章 330 m
+第一笔 37 m
+第一第二 3 m
+第一第二第三第四 2 m
+第一等 59 m
+第一篇 160 m
+第一类 158 m
+第一粒 12 m
+第一级 105 m
+第一纺织 7 nz
+第一线 283 m
+第一组 34 m
+第一缕 12 m
+第一罐 257 m
+第一网 3 nz
+第一股 5 m
+第一胎 8 m
+第一艘 165 m
+第一节 273 m
+第一范畴 3 nr
+第一茬 2 m
+第一行 35 m
+第一角 3 m
+第一记 3 m
+第一课 3 n
+第一贴 3 nz
+第一趟 3 m
+第一路 48 m
+第一轮 183 m
+第一辆 99 m
+第一辑 9 m
+第一通 7 nz
+第一遍 29 m
+第一道 253 m
+第一遭 15 m
+第一部 941 m
+第一重 135 m
+第一门 150 m
+第一间 20 m
+第一队 31 m
+第一阵 12 m
+第一阶段 3 t
+第一集 19 m
+第一零一回 2 m
+第一零七回 2 m
+第一零三回 2 m
+第一零九回 2 m
+第一零二回 2 m
+第一零五回 2 m
+第一零八回 2 m
+第一零六回 2 m
+第一零四回 2 m
+第一零零回 2 m
+第一面 274 m
+第一页 110 m
+第一项 88 m
+第一顿 9 m
+第一颗 241 m
+第一餐 5 m
+第一首 18 m
+第一首歌 2 m
+第七 781 m
+第七三一 4 m
+第七个 40 m
+第七代 12 m
+第七件 2 m
+第七任 6 m
+第七位 38 m
+第七八五 2 m
+第七册 3 m
+第七十 3 m
+第七十一 2 m
+第七十一回 4 m
+第七十七 2 m
+第七十七回 5 m
+第七十七条 3 m
+第七十三 4 m
+第七十三卷 2 m
+第七十三回 5 m
+第七十三招 2 m
+第七十九 2 m
+第七十九回 6 m
+第七十二回 5 m
+第七十五回 5 m
+第七十八名 3 m
+第七十八回 5 m
+第七十八条 2 m
+第七十六个 2 m
+第七十六回 5 m
+第七十六条 2 m
+第七十四 28 m
+第七十四回 5 m
+第七十四届 2 m
+第七十四条 2 m
+第七十回 5 m
+第七十届 2 m
+第七十章 2 m
+第七卷 37 m
+第七句 2 m
+第七号 2 m
+第七名 18 m
+第七品 5 m
+第七回 14 m
+第七场 55 m
+第七天 20 m
+第七家 3 m
+第七封 3 m
+第七层 30 m
+第七届 110 m
+第七年 5 m
+第七批 2 m
+第七把 3 m
+第七招 7 m
+第七日 25 m
+第七期 3 m
+第七条 61 m
+第七根 2 m
+第七次 106 m
+第七款 7 m
+第七步 7 m
+第七段 2 m
+第七版 3 nz
+第七种 9 m
+第七站 7 m
+第七章 252 m
+第七篇 17 m
+第七级 2 m
+第七缕 2 m
+第七节 31 m
+第七课 3 n
+第七路 2 m
+第七轮 6 m
+第七辑 3 m
+第七道 2 m
+第七部 2 m
+第七集 5 m
+第七项 6 m
+第三 4818 m
+第三世界 244 nz
+第三世界科学院 29 nz
+第三两个 16 m
+第三个 671 m
+第三产业 424 nz
+第三人称 3 n
+第三代 499 m
+第三件 79 m
+第三任 23 m
+第三份 12 m
+第三位 220 m
+第三例 19 m
+第三关 3 l
+第三具 4 m
+第三册 4 m
+第三军 3 nr
+第三军医大学 2 nt
+第三刀 5 m
+第三分 13 m
+第三列 4 m
+第三匹 5 m
+第三十 44 m
+第三十一 34 m
+第三十一回 10 m
+第三十一条 13 m
+第三十一次 256 m
+第三十一章 33 m
+第三十七 16 m
+第三十七代 2 m
+第三十七回 9 m
+第三十七届 4 m
+第三十七招 2 m
+第三十七条 6 m
+第三十七章 19 m
+第三十七轮 17 m
+第三十三 23 m
+第三十三代 3 m
+第三十三回 9 m
+第三十三届 8 m
+第三十三条 9 m
+第三十三章 19 m
+第三十三篇 2 m
+第三十九 17 m
+第三十九回 8 m
+第三十九届 2 m
+第三十九条 4 m
+第三十九章 18 m
+第三十二 19 m
+第三十二代 2 m
+第三十二册 2 m
+第三十二回 10 m
+第三十二届 3 m
+第三十二招 4 m
+第三十二条 8 m
+第三十二章 20 m
+第三十二篇 2 m
+第三十五 15 m
+第三十五回 10 m
+第三十五届 3 m
+第三十五条 5 m
+第三十五章 17 m
+第三十八 19 m
+第三十八回 10 m
+第三十八届 4 m
+第三十八招 2 m
+第三十八条 5 m
+第三十八章 17 m
+第三十六 17 m
+第三十六回 10 m
+第三十六届 8 m
+第三十六条 5 m
+第三十六章 16 m
+第三十六路 2 m
+第三十四 16 m
+第三十四代 4 m
+第三十四回 9 m
+第三十四届 3 m
+第三十四条 9 m
+第三十四章 17 m
+第三十回 11 m
+第三十届 2 m
+第三十条 21 m
+第三十次 3 m
+第三十章 24 m
+第三卷 406 m
+第三发 2 m
+第三口 6 m
+第三句 23 m
+第三只 47 m
+第三台 3 m
+第三号 15 m
+第三名 372 m
+第三周 6 m
+第三品 5 m
+第三四代 6 m
+第三四位 2 m
+第三回 17 m
+第三团 3 m
+第三国 3 ns
+第三国际 92 nz
+第三圈 2 m
+第三场 52 m
+第三块 7 m
+第三声 3 m
+第三天 268 m
+第三套 2 m
+第三季 3 m
+第三季度 3 mq
+第三家 13 m
+第三封 13 m
+第三尊 2 m
+第三局 53 m
+第三层 80 m
+第三届 264 m
+第三峰 3 m
+第三师 3 nr
+第三席 2 m
+第三幅 6 m
+第三幕 5 m
+第三年 67 m
+第三度 3 m
+第三座 49 m
+第三张 11 m
+第三性 3 nz
+第三扇 2 m
+第三手 4 m
+第三批 740 m
+第三把手 3 m
+第三折 3 m
+第三招 57 m
+第三拳 11 m
+第三排 8 m
+第三支 10 m
+第三文明 3 nz
+第三方 134 m
+第三日 92 m
+第三期 9 m
+第三本 8 m
+第三条 144 m
+第三杯 17 m
+第三极 3 ns
+第三枚 18 m
+第三枝 6 m
+第三架 6 m
+第三株 2 m
+第三样 2 m
+第三根 8 m
+第三桌 2 m
+第三桩 6 m
+第三梯队 3 nz
+第三次 891 m
+第三款 5 m
+第三步 122 m
+第三段 21 m
+第三派 2 m
+第三点 30 m
+第三版 3 nz
+第三番 3 m
+第三百一十二条 3 m
+第三百三十六条 3 m
+第三盏 2 m
+第三盘 16 m
+第三眼 2 m
+第三碗 5 m
+第三磨牙 3 nz
+第三票 9 m
+第三种 339 m
+第三站 8 m
+第三章 330 m
+第三笔 2 m
+第三第四 19 m
+第三等级 3 l
+第三篇 31 m
+第三类 25 m
+第三系 58 nz
+第三级 3 m
+第三纪 321 nz
+第三线 3 m
+第三组 13 m
+第三罐 2 m
+第三者 196 nz
+第三股 3 m
+第三胎 2 m
+第三艘 19 m
+第三节 17 m
+第三行 4 m
+第三课 3 n
+第三路 15 m
+第三轮 3 m
+第三辆 10 m
+第三辈 2 m
+第三辑 5 m
+第三遍 21 m
+第三道 47 m
+第三道路党 2 nt
+第三部 67 m
+第三重 6 m
+第三间 10 m
+第三队 18 m
+第三阶段 3 t
+第三集 7 m
+第三面 2 m
+第三页 14 m
+第三项 54 m
+第三颗 9 m
+第三首 7 m
+第九 444 m
+第九个 38 m
+第九人 3 nz
+第九代 8 m
+第九位 34 m
+第九册 3 m
+第九十 3 m
+第九十一回 5 m
+第九十七 2 m
+第九十七回 4 m
+第九十七条 3 m
+第九十三回 5 m
+第九十九 6 m
+第九十九回 5 m
+第九十九条 4 m
+第九十二 2 m
+第九十二回 5 m
+第九十五回 5 m
+第九十五条 3 m
+第九十八回 5 m
+第九十八条 2 m
+第九十六 7 m
+第九十六回 5 m
+第九十六条 5 m
+第九十四回 5 m
+第九十回 5 m
+第九卷 104 m
+第九句 2 m
+第九号 2 m
+第九名 16 m
+第九品 12 m
+第九回 14 m
+第九城市 3 ns
+第九天 6 m
+第九对 2 m
+第九局 5 m
+第九层 10 m
+第九届 331 m
+第九届全国人大 2 nz
+第九届全国人民代表大会常务委员会 2 nt
+第九届全国政协 18 nt
+第九年 5 m
+第九座 2 m
+第九招 8 m
+第九日 6 m
+第九期 2 m
+第九条 48 m
+第九次 75 m
+第九款 2 m
+第九步 5 m
+第九段 2 m
+第九版 3 nz
+第九种 5 m
+第九章 99 m
+第九篇 3 m
+第九节 3 m
+第九街 3 nr
+第九课 3 nr
+第九路 4 m
+第九轮 3 m
+第九部 3 m
+第九重 2 m
+第九集 3 m
+第二 9146 m
+第二三场 2 m
+第二世界 10 nz
+第二两把 2 m
+第二两次 2 m
+第二个 1509 m
+第二产业 538 nz
+第二人称 3 n
+第二代 354 m
+第二件 156 m
+第二任 38 m
+第二份 43 m
+第二位 387 m
+第二例 10 m
+第二信使 3 nz
+第二信号 3 nz
+第二具 3 m
+第二册 7 m
+第二军医大学 2 nt
+第二刀 19 m
+第二分 14 m
+第二列 3 m
+第二则 5 m
+第二副 15 m
+第二匹 3 m
+第二十 63 m
+第二十一 37 m
+第二十一回 12 m
+第二十一条 50 m
+第二十一次 21 m
+第二十一章 55 m
+第二十七 39 m
+第二十七位 2 m
+第二十七回 11 m
+第二十七届 4 m
+第二十七条 22 m
+第二十七次 2 m
+第二十七章 29 m
+第二十三 39 m
+第二十三回 12 m
+第二十三届 32 m
+第二十三条 35 m
+第二十三章 39 m
+第二十九 44 m
+第二十九回 10 m
+第二十九届 9 m
+第二十九条 20 m
+第二十九次 2 m
+第二十九章 24 m
+第二十二 35 m
+第二十二位 3 m
+第二十二回 11 m
+第二十二届 16 m
+第二十二条 41 m
+第二十二次 5 m
+第二十二章 45 m
+第二十二路 2 m
+第二十二轮 2 m
+第二十五 42 m
+第二十五回 13 m
+第二十五届 30 m
+第二十五条 27 m
+第二十五次 3 m
+第二十五章 34 m
+第二十位 2 m
+第二十八 33 m
+第二十八个 2 m
+第二十八回 11 m
+第二十八届 3 m
+第二十八条 24 m
+第二十八款 2 m
+第二十八章 40 m
+第二十六 33 m
+第二十六位 2 m
+第二十六回 12 m
+第二十六届 11 m
+第二十六条 23 m
+第二十六次 4 m
+第二十六章 28 m
+第二十六路 18 m
+第二十卷 3 m
+第二十四 36 m
+第二十四卷 2 m
+第二十四回 12 m
+第二十四届 31 m
+第二十四条 32 m
+第二十四章 31 m
+第二十四集 12 m
+第二十回 14 m
+第二十届 19 m
+第二十条 39 m
+第二十次 34 m
+第二十章 60 m
+第二千 2 m
+第二半 10 m
+第二卷 294 m
+第二发 5 nz
+第二口 9 m
+第二句 61 m
+第二只 19 m
+第二台 3 m
+第二号 38 m
+第二名 252 m
+第二周 2 m
+第二回 33 m
+第二团 6 m
+第二国际 103 nz
+第二圈 4 m
+第二场 121 m
+第二块 12 m
+第二声 12 m
+第二处 5 m
+第二夜 2 m
+第二天 2578 m
+第二套 20 m
+第二季 8 m
+第二季度 3 mq
+第二宇宙 3 nr
+第二宗 2 m
+第二审 3 n
+第二家 41 m
+第二封 17 m
+第二局 96 m
+第二层 134 m
+第二届 238 m
+第二峰 2 m
+第二席 2 m
+第二幅 3 m
+第二幕 13 m
+第二年 682 m
+第二度 2 m
+第二座 18 m
+第二张 41 m
+第二性 65 nz
+第二性征 3 nz
+第二所 14 m
+第二手 19 m
+第二批 469 m
+第二把 22 m
+第二把手 8 m
+第二折 2 m
+第二招 94 m
+第二拳 12 m
+第二排 15 m
+第二支 18 m
+第二日 117 m
+第二期 84 m
+第二本 18 m
+第二杆 2 m
+第二束 5 m
+第二条 251 m
+第二杯 18 m
+第二松花江 12 nz
+第二枚 21 m
+第二枝 13 m
+第二枪 5 m
+第二架 18 m
+第二株 2 m
+第二样 2 m
+第二根 8 m
+第二档 2 m
+第二桩 5 m
+第二桶 2 m
+第二次 3031 m
+第二次世 3 nz
+第二次世界大战 1743 nz
+第二次国内革命战争 45 nz
+第二款 14 m
+第二步 241 m
+第二段 38 m
+第二汽车制造厂 7 nt
+第二炮兵 347 nt
+第二点 56 m
+第二片 3 m
+第二番 2 m
+第二百 2 m
+第二百三十六条 3 m
+第二百六十三条 2 m
+第二百廿一节 2 m
+第二盏 2 m
+第二盘 71 m
+第二眼 12 m
+第二碗 17 m
+第二票 9 m
+第二种 328 m
+第二站 20 m
+第二章 302 m
+第二笔 2 m
+第二第三 8 m
+第二篇 31 m
+第二类 187 m
+第二粒 6 m
+第二级 321 m
+第二线 30 m
+第二组 29 m
+第二股 5 m
+第二胎 8 m
+第二艘 26 m
+第二节 309 m
+第二行 11 m
+第二袋 3 m
+第二记 2 m
+第二语言 3 nz
+第二课 3 n
+第二课堂 3 n
+第二趟 2 m
+第二路 24 m
+第二轮 243 m
+第二辆 26 m
+第二辈 2 m
+第二辑 5 m
+第二通 4 nz
+第二遍 40 m
+第二道 228 m
+第二部 131 m
+第二重 135 m
+第二间 13 m
+第二队 28 m
+第二阵 9 m
+第二阶段 3 t
+第二集 9 m
+第二面 4 m
+第二页 87 m
+第二项 71 m
+第二顿 4 m
+第二颗 25 m
+第二首 6 m
+第五 1391 m
+第五个 66 m
+第五代 121 m
+第五件 4 m
+第五任 12 m
+第五位 82 m
+第五元 2 m
+第五册 3 m
+第五十 13 m
+第五十一 9 m
+第五十一回 5 m
+第五十一条 2 m
+第五十一章 13 m
+第五十一篇 2 m
+第五十七 6 m
+第五十七回 5 m
+第五十七届 2 m
+第五十七条 2 m
+第五十七章 2 m
+第五十三 3 m
+第五十三回 4 m
+第五十三条 5 m
+第五十三章 13 m
+第五十九 13 m
+第五十九回 5 m
+第五十九章 3 m
+第五十九篇 2 m
+第五十二 14 m
+第五十二回 5 m
+第五十二章 13 m
+第五十二篇 2 m
+第五十五 4 m
+第五十五回 6 m
+第五十五章 6 m
+第五十八 5 m
+第五十八回 5 m
+第五十八章 3 m
+第五十八篇 2 m
+第五十六 5 m
+第五十六回 5 m
+第五十六团 2 m
+第五十六条 2 m
+第五十六章 21 m
+第五十四 6 m
+第五十四回 5 m
+第五十四届 2 m
+第五十四条 3 m
+第五十四章 10 m
+第五十四篇 2 m
+第五十回 6 m
+第五十日 2 m
+第五十章 14 m
+第五卷 99 m
+第五句 4 m
+第五号 3 m
+第五名 33 m
+第五品 5 m
+第五回 14 m
+第五场 24 m
+第五块 7 m
+第五天 47 m
+第五套 3 m
+第五家 3 m
+第五局 4 m
+第五层 30 m
+第五届 505 m
+第五幅 3 m
+第五年 14 m
+第五批 2 m
+第五招 18 m
+第五拳 2 m
+第五日 18 m
+第五期 11 m
+第五条 65 m
+第五枚 4 m
+第五架 4 m
+第五根 3 m
+第五次 893 m
+第五款 4 m
+第五步 12 m
+第五段 5 m
+第五版 3 nz
+第五盘 4 m
+第五种 48 m
+第五站 5 m
+第五章 218 m
+第五第六 2 m
+第五等 11 m
+第五篇 10 m
+第五类 8 m
+第五粒 3 m
+第五纵队 20 nt
+第五组 2 m
+第五艘 3 m
+第五节 36 m
+第五课 3 n
+第五路 9 m
+第五轮 13 m
+第五辆 4 m
+第五辑 3 m
+第五遍 4 m
+第五道 6 m
+第五部 20 m
+第五重 3 m
+第五队 3 m
+第五集 2 m
+第五项 23 m
+第代 2 m
+第伍 2 m
+第八 436 m
+第八个 19 m
+第八人 3 nz
+第八代 23 m
+第八任 2 m
+第八份 3 m
+第八位 26 m
+第八册 3 m
+第八十 3 m
+第八十一回 6 m
+第八十七 2 m
+第八十七回 4 m
+第八十三 8 m
+第八十三回 5 m
+第八十九 4 m
+第八十九回 6 m
+第八十二回 5 m
+第八十二条 2 m
+第八十五回 4 m
+第八十八 3 m
+第八十八回 5 m
+第八十六回 4 m
+第八十四回 5 m
+第八十回 6 m
+第八卷 64 m
+第八句 4 m
+第八号 5 m
+第八名 16 m
+第八品 5 m
+第八回 15 m
+第八天 23 m
+第八局 3 m
+第八层 17 m
+第八届 157 m
+第八届全国人民代表大会 7 nz
+第八届全国政协 4 nt
+第八年 20 m
+第八把 2 m
+第八招 7 m
+第八支 26 m
+第八日 8 m
+第八期 3 m
+第八条 54 m
+第八次 95 m
+第八步 4 m
+第八段 3 m
+第八版 3 nz
+第八种 20 m
+第八章 185 m
+第八篇 3 m
+第八粒 3 m
+第八节 3 m
+第八课 3 n
+第八轮 6 m
+第八道 2 m
+第八部 5 m
+第八队 6 m
+第八集 4 m
+第八项 4 m
+第六 697 m
+第六下 2 m
+第六个 41 m
+第六代 28 m
+第六件 2 m
+第六任 4 m
+第六位 43 m
+第六册 3 m
+第六十 5 m
+第六十一 5 m
+第六十一回 5 m
+第六十一条 2 m
+第六十一章 2 m
+第六十七回 5 m
+第六十七条 3 m
+第六十七章 2 m
+第六十七篇 2 m
+第六十三 6 m
+第六十三回 7 m
+第六十三条 2 m
+第六十三章 2 m
+第六十三篇 2 m
+第六十九 4 m
+第六十九回 5 m
+第六十九条 3 m
+第六十九章 2 m
+第六十二 3 m
+第六十二回 6 m
+第六十二章 2 m
+第六十二篇 2 m
+第六十五 6 m
+第六十五回 5 m
+第六十五条 2 m
+第六十五章 2 m
+第六十八回 5 m
+第六十八条 4 m
+第六十八篇 2 m
+第六十六 5 m
+第六十六回 5 m
+第六十六章 2 m
+第六十四 3 m
+第六十四回 5 m
+第六十四章 2 m
+第六十四篇 2 m
+第六十回 5 m
+第六十条 4 m
+第六十章 3 m
+第六十篇 2 m
+第六卷 47 m
+第六句 3 m
+第六号 5 m
+第六名 20 m
+第六周 2 m
+第六品 10 m
+第六回 14 m
+第六团 3 m
+第六场 53 m
+第六块 3 m
+第六天 27 m
+第六家 3 m
+第六局 4 m
+第六层 25 m
+第六届 166 m
+第六席 2 m
+第六幕 4 m
+第六年 8 m
+第六度 3 m
+第六感 3 nz
+第六批 3 m
+第六招 8 m
+第六日 18 m
+第六期 11 m
+第六条 67 m
+第六根 2 m
+第六次 945 m
+第六款 4 m
+第六步 8 m
+第六段 5 m
+第六版 3 nz
+第六种 7 m
+第六站 16 m
+第六章 237 m
+第六篇 7 m
+第六类 2 m
+第六艘 2 m
+第六节 32 m
+第六课 3 nr
+第六路 3 m
+第六轮 3 m
+第六道 3 m
+第六部 35 m
+第六集 2 m
+第六项 16 m
+第几 25 m
+第几个 8 m
+第几代 7 m
+第几册 3 m
+第几名 3 m
+第几品 2 m
+第几回 3 m
+第几处 2 m
+第几天 4 m
+第几层 2 m
+第几招 2 m
+第几条 2 m
+第几次 6 m
+第几百次 2 m
+第几章 3 m
+第几节 3 m
+第几课 3 nr
+第几轮 2 m
+第几页 2 m
+第十 213 m
+第十一 220 m
+第十一个 10 m
+第十一个五年 13 m
+第十一位 5 m
+第十一卷 65 m
+第十一名 5 m
+第十一回 12 m
+第十一天 4 m
+第十一层 7 m
+第十一届 3 m
+第十一年 2 m
+第十一招 4 m
+第十一拳 3 m
+第十一条 50 m
+第十一次 51 m
+第十一段 2 m
+第十一章 78 m
+第十一篇 4 m
+第十一轮 16 m
+第十一部分 2 m
+第十七 46 m
+第十七个 3 m
+第十七回 14 m
+第十七届 50 m
+第十七招 3 m
+第十七期 257 m
+第十七条 44 m
+第十七次 5 m
+第十七章 58 m
+第十七路 56 m
+第十七集 2 m
+第十三 79 m
+第十三个 5 m
+第十三代 8 m
+第十三位 2 m
+第十三分钟 2 m
+第十三卷 55 m
+第十三名 2 m
+第十三回 14 m
+第十三天 2 m
+第十三层 8 m
+第十三届 36 m
+第十三招 4 m
+第十三条 46 m
+第十三次 36 m
+第十三章 66 m
+第十个 61 m
+第十九 45 m
+第十九代 4 m
+第十九卷 26 m
+第十九回 14 m
+第十九届 13 m
+第十九招 2 m
+第十九条 39 m
+第十九次 21 m
+第十九章 51 m
+第十九路 60 m
+第十二 109 m
+第十二个 3 m
+第十二代 3 m
+第十二任 2 m
+第十二位 2 m
+第十二卷 37 m
+第十二号 2 m
+第十二名 3 m
+第十二回 14 m
+第十二夜 5 m
+第十二天 3 m
+第十二层 6 m
+第十二届 71 m
+第十二招 5 m
+第十二条 45 m
+第十二次 51 m
+第十二章 79 m
+第十五 95 m
+第十五位 2 m
+第十五卷 25 m
+第十五名 2 m
+第十五回 14 m
+第十五天 2 m
+第十五届 29 m
+第十五条 46 m
+第十五次 30 m
+第十五章 65 m
+第十五集 2 m
+第十代 9 m
+第十位 17 m
+第十八 122 m
+第十八个 2 m
+第十八代 3 m
+第十八卷 7 m
+第十八回 15 m
+第十八天 2 m
+第十八家 3 m
+第十八层 2 m
+第十八届 16 m
+第十八条 39 m
+第十八次 18 m
+第十八章 55 m
+第十八轮 3 m
+第十六 54 m
+第十六个 2 m
+第十六位 3 m
+第十六回 14 m
+第十六届 34 m
+第十六年 2 m
+第十六条 45 m
+第十六次 13 m
+第十六章 64 m
+第十六集 2 m
+第十具 8 m
+第十册 3 m
+第十卷 36 m
+第十名 13 m
+第十四 97 m
+第十四代 4 m
+第十四位 4 m
+第十四卷 31 m
+第十四名 4 m
+第十四回 13 m
+第十四天 2 m
+第十四届 42 m
+第十四把 3 m
+第十四招 3 m
+第十四条 46 m
+第十四次 41 m
+第十四章 71 m
+第十回 14 m
+第十天 18 m
+第十局 2 m
+第十层 18 m
+第十届 330 m
+第十年 5 m
+第十招 8 m
+第十拳 2 m
+第十期 2 m
+第十条 47 m
+第十次 125 m
+第十段 2 m
+第十版 3 nz
+第十种 4 m
+第十章 90 m
+第十篇 3 m
+第十节 2 m
+第十课 3 n
+第十轮 2 m
+第十部 3 m
+第十集 3 m
+第十颗 7 m
+第叁 2 m
+第口 13 m
+第只 2 m
+第号 3 m
+第周 6 m
+第四 3092 m
+第四个 190 m
+第四五 2 m
+第四产业 3 nz
+第四代 180 m
+第四件 5 m
+第四任 12 m
+第四位 126 m
+第四例 16 m
+第四册 7 m
+第四军医大学 6 nt
+第四军医大学西京医院 5 nt
+第四刀 2 m
+第四十 24 m
+第四十一 12 m
+第四十一回 11 m
+第四十一条 8 m
+第四十一章 17 m
+第四十七 10 m
+第四十七回 6 m
+第四十七届 2 m
+第四十七条 4 m
+第四十七章 14 m
+第四十三 11 m
+第四十三回 5 m
+第四十三届 2 m
+第四十三条 4 m
+第四十三章 15 m
+第四十九 17 m
+第四十九回 6 m
+第四十九届 2 m
+第四十九条 2 m
+第四十九章 29 m
+第四十二 10 m
+第四十二回 5 m
+第四十二届 4 m
+第四十二条 20 m
+第四十二章 18 m
+第四十五 7 m
+第四十五回 6 m
+第四十五章 15 m
+第四十八 5 m
+第四十八回 7 m
+第四十八届 10 m
+第四十八章 13 m
+第四十六 6 m
+第四十六回 6 m
+第四十六届 4 m
+第四十六章 13 m
+第四十名 2 m
+第四十四 14 m
+第四十四回 6 m
+第四十四条 4 m
+第四十四章 14 m
+第四十回 8 m
+第四十届 3 m
+第四十日 2 m
+第四十条 4 m
+第四十章 17 m
+第四卷 205 m
+第四句 14 m
+第四号 3 m
+第四名 69 m
+第四品 6 m
+第四回 18 m
+第四团 2 m
+第四场 26 m
+第四块 2 m
+第四堵 8 m
+第四声 4 m
+第四天 89 m
+第四套 3 m
+第四季 3 m
+第四季度 3 l
+第四家 3 m
+第四尊 2 m
+第四局 10 m
+第四层 53 m
+第四届 202 m
+第四席 2 m
+第四幅 5 m
+第四年 31 m
+第四座 4 m
+第四张 3 m
+第四批 33 m
+第四招 30 m
+第四拳 3 m
+第四支 5 m
+第四方 3 m
+第四日 64 m
+第四期 23 m
+第四条 69 m
+第四杯 2 m
+第四枚 2 m
+第四架 5 m
+第四根 3 m
+第四桩 4 m
+第四次 381 m
+第四款 5 m
+第四步 25 m
+第四段 8 m
+第四点 15 m
+第四版 3 nz
+第四碗 3 m
+第四种 122 m
+第四站 9 m
+第四章 278 m
+第四第五 3 m
+第四等 11 m
+第四篇 14 m
+第四类 12 m
+第四粒 3 m
+第四系 26 nz
+第四纪 298 t
+第四组 5 m
+第四维 6 m
+第四群 4 m
+第四股 2 m
+第四胎 3 m
+第四艘 8 m
+第四节 239 m
+第四行 2 m
+第四课 3 n
+第四路 5 m
+第四轮 14 m
+第四辆 5 m
+第四辑 2 m
+第四遍 3 m
+第四道 12 m
+第四部 53 m
+第四重 3 m
+第四间 3 m
+第四队 13 m
+第四阶段 3 t
+第四集 9 m
+第四页 3 m
+第四项 13 m
+第四颗 9 m
+第壹号 3 m
+第宅 3 n
+第对 6 m
+第廿三节 2 m
+第戎 10 nrt
+第所 12 m
+第把 5 m
+第无名 3 l
+第日 3 m
+第根 2 m
+第次 3 m
+第欧根尼 3 ns
+第比利斯 24 ns
+第派 2 m
+第点点 2 m
+第第第 2 nz
+第等 29 m
+第纳尔 41 nz
+第维 2 m
+第群 2 m
+第聂伯 21 ns
+第聂伯河 60 ns
+第聂伯罗 5 nrt
+第聂伯罗彼得罗夫斯克 11 nrt
+第谷 21 nz
+第部 26 m
+第零 4 m
+笭 4 zg
+笮 106 g
+笱 94 zg
+笳 48 g
+笸 54 zg
+笸箩 23 n
+笸篮 3 n
+笺 350 v
+笺注 21 n
+笺纸 52 n
+笺言 3 n
+笺谱 3 n
+笼 943 n
+笼中之鸟 3 i
+笼中鸟 3 i
+笼养 4 v
+笼嘴 3 v
+笼头 32 v
+笼子 178 n
+笼屉 8 n
+笼形天线 3 i
+笼状重排 3 n
+笼盖 3 v
+笼笼统统 3 n
+笼络 432 n
+笼络人心 36 i
+笼统 130 n
+笼统性 3 n
+笼罩 946 v
+笼罩着 3 y
+笼而统之 2 i
+笼鸟槛猿 3 n
+笼鸟池鱼 3 i
+笾 44 g
+筅 24 x
+筆 2 zg
+筇 42 g
+筇竹 6 n
+筈 3 zg
+等 195934 u
+等一等 3 b
+等不及 84 v
+等于 3258 v
+等于号 3 n
+等于零 3 i
+等价 304 n
+等价交换 46 i
+等价关系 15 l
+等价物 298 l
+等价连城 3 n
+等份 2 n
+等会儿 3 n
+等位 82 n
+等位基因 3 n
+等体积线 3 n
+等你你 3 b
+等你拿 3 n
+等你来了 3 l
+等候 1737 n
+等候多时 3 n
+等值 60 n
+等值复本 3 l
+等值线 25 n
+等值线图 5 n
+等倾条纹 3 n
+等偏角 3 i
+等分比 3 n
+等分线 3 n
+等分部分 3 l
+等到 1083 v
+等刷 3 v
+等加速度 3 n
+等势线 3 n
+等势面 12 n
+等化 3 v
+等压 26 v
+等压线 17 n
+等压过程 3 l
+等压面 29 n
+等厚条纹 3 n
+等同 197 v
+等同于 195 vi
+等同周期 3 n
+等同性 3 n
+等周问题 3 n
+等品 3 n
+等因奉此 7 l
+等地温线 3 n
+等外品 3 n
+等奖品 3 n
+等奖项 3 n
+等子 3 n
+等差数列 31 l
+等差级数 7 l
+等幅面 3 l
+等式 67 n
+等式逻辑 3 l
+等待 2998 v
+等待时间 3 n
+等得 3 v
+等效 74 v
+等效于 3 v
+等效值 3 n
+等效力系 3 n
+等效电路 3 n
+等效网络 3 n
+等方性 3 n
+等时摆 3 i
+等时线 4 n
+等比数列 12 l
+等比级数 3 l
+等深线 12 l
+等温 51 n
+等温线 39 n
+等温过程 3 l
+等温退火 3 i
+等焓过程 3 v
+等电子序 3 n
+等电点 6 n
+等相面 3 n
+等着瞧 3 l
+等礼相亢 3 i
+等离子 148 n
+等离子体 490 n
+等离子态 2 n
+等积形 3 n
+等积投影 3 i
+等等 6063 u
+等等等等 3 b
+等米下锅 10 n
+等级 2010 b
+等级分 34 l
+等级分类 3 n
+等级制 163 n
+等级制度 3 n
+等级扩散 3 n
+等级森严 3 l
+等级法 3 n
+等级观 2 n
+等级证书 3 n
+等级赛 3 n
+等而上之 3 i
+等而下之 6 i
+等能光谱 3 n
+等腰 13 v
+等腰三角 3 n
+等臂天平 3 i
+等角投影 3 i
+等角线 3 n
+等距 24 n
+等距原则 3 n
+等距变量 3 l
+等距同构 3 n
+等距投影 3 n
+等边三角 3 i
+等过 3 v
+等速 16 v
+等速电泳 3 n
+等速运动 3 n
+等量 139 n
+等量级 3 b
+等量置换 3 i
+等量齐观 25 l
+等长 29 v
+等闲 129 v
+等闲之辈 52 l
+等闲置之 3 i
+等闲视之 26 i
+等雨线 3 n
+等雨量线 3 n
+等音线 3 n
+等额 32 n
+等额选举 257 n
+等高曲线 3 n
+等高线 29 n
+等高线图 3 n
+筊 2 zg
+筋 1770 n
+筋斗 446 n
+筋斗云 3 n
+筋疲力倦 3 i
+筋疲力尽 106 i
+筋疲力竭 18 i
+筋皮力竭 3 i
+筋络 15 n
+筋缩 3 nz
+筋肉 35 n
+筋脉 70 n
+筋腱 2 n
+筋膜 3 n
+筋节 7 n
+筋豆 3 n
+筋道 5 n
+筋骨 260 n
+筋骨草 3 n
+筌 7 g
+筎 3 zg
+筏 207 ng
+筏基 2 n
+筏头 3 n
+筏子 106 n
+筏运 3 n
+筐 210 n
+筐头子 3 n
+筐子 34 n
+筐笼 3 n
+筐箧中物 3 v
+筑 2195 v
+筑坝 33 v
+筑城 573 v
+筑基 2 nz
+筑堡 3 nz
+筑堤 62 v
+筑墙 18 nz
+筑室 3 nz
+筑室反耕 3 vn
+筑室道谋 3 nt
+筑宾 3 v
+筑屋 3 v
+筑巢 91 nz
+筑巢引凤 3 nz
+筑成 512 v
+筑有 3 v
+筑栏 3 v
+筑桥 3 nz
+筑水 3 v
+筑波 14 v
+筑波大学 6 nt
+筑舍道傍 3 v
+筑起 3 v
+筑路 70 nz
+筑路工程 3 nz
+筑造 7 v
+筑造学 3 nt
+筑龙网 3 nz
+筒 1229 q
+筒井 3 n
+筒仓 16 n
+筒光 3 n
+筒夹 3 n
+筒子 62 n
+筒子楼 45 n
+筒子河 4 n
+筒子院 3 n
+筒式 24 b
+筒拱 3 n
+筒灯 3 n
+筒状 3 n
+筒状花 3 n
+筒瓦 8 n
+筒管 2 n
+筒箭毒 3 n
+筒裙 8 n
+筒裤 3 n
+筒车 4 n
+答 5137 v
+答不答应 9 v
+答允 3 v
+答出 3 v
+答出来 3 v
+答卷 115 v
+答复 1410 v
+答好 3 v
+答对 23 v
+答应 4126 v
+答应下来 3 l
+答录机 2 n
+答拜 3 v
+答数 3 n
+答来答去 3 v
+答案 1756 n
+答理 48 v
+答疑 54 v
+答疑热线 3 n
+答睬 3 v
+答礼 87 v
+答答 3 v
+答聘 3 v
+答腔 30 n
+答茬 3 v
+答茬儿 3 n
+答言 3 n
+答记者问 3 l
+答词 13 n
+答话 459 v
+答话机 3 n
+答语 3 n
+答谢 68 v
+答谢会 3 n
+答谢宴会 3 l
+答谢词 3 n
+答谢辞 3 n
+答辞 3 v
+答辩 167 v
+答辩书 3 n
+答辩会 3 n
+答辩期 3 n
+答辩状 4 n
+答辩考试 3 n
+答道 1272 v
+答错 3 v
+答问 426 v
+答非所问 122 l
+答题 405 n
+答题卡 61 n
+策 1710 n
+策划 1110 n
+策划书 3 n
+策划人 25 n
+策划人员 8 n
+策划师 18 n
+策划案 3 n
+策划者 41 n
+策划部 11 n
+策动 316 n
+策动者 2 n
+策励 3 v
+策勒 6 n
+策勒县 2 ns
+策反 38 v
+策发 3 v
+策名委质 3 n
+策名就列 3 n
+策士 7 n
+策布勒 2 nrt
+策应 182 n
+策无遗算 3 n
+策杖 3 n
+策源地 51 n
+策画 3 n
+策略 2170 n
+策略信息 4 n
+策略决策 2 n
+策略师 9 n
+策略性 16 n
+策略服务器 3 n
+策略管理 4 n
+策论 32 n
+策试 3 vn
+策谋 3 n
+策马 180 n
+策马前进 3 n
+策马扬鞭 3 n
+策马飞舆 3 n
+筘 8 zg
+筚 4 n
+筚篥 10 n
+筚路蓝缕 7 i
+筚路褴褛 3 z
+筚门圭窦 3 n
+筚门闺窦 3 n
+筛 331 v
+筛下 3 v
+筛分 35 n
+筛分析法 3 n
+筛号 3 n
+筛子 70 n
+筛孔 3 n
+筛撒 3 v
+筛板 5 n
+筛析 3 vn
+筛查 27 vn
+筛法 25 n
+筛洗 3 v
+筛滤 3 v
+筛状 3 n
+筛状板 3 n
+筛理 3 vn
+筛眼 3 v
+筛管 25 vn
+筛粉机 3 n
+筛糠 56 v
+筛网 3 n
+筛网厂 3 n
+筛选 352 v
+筛选制度 3 n
+筛选机 2 n
+筛酒 3 v
+筛锣擂鼓 3 v
+筛除 3 v
+筛面倾角 3 n
+筛骨 2 n
+筜 128 zg
+筝 203 n
+筟 58 zg
+筠 9 ns
+筠连 2 ns
+筠连县 3 ns
+筢子 3 v
+筦 43 zg
+筨 25 zg
+筩 6 zg
+筫 166 zg
+筮 43 g
+筰 20 zg
+筱 26 g
+筲 10 g
+筲箕 2 n
+筳 2 zg
+筴 6 zg
+筵 327 n
+筵上 3 n
+筵会 3 n
+筵几 3 n
+筵宴 116 n
+筵席 355 n
+筵席捐 3 n
+筶 77 zg
+筷 212 n
+筷子 814 n
+筷子巷 2 n
+筷盒 3 n
+筹 821 v
+筹借 9 v
+筹划 408 n
+筹到 3 v
+筹办 139 v
+筹办处 3 n
+筹募 7 v
+筹募到 3 n
+筹商 3 v
+筹备 837 v
+筹备会 186 n
+筹备会议 3 n
+筹备处 24 n
+筹备工作 3 n
+筹备文 3 n
+筹备组 10 n
+筹委 3 n
+筹委会 169 n
+筹安会 3 n
+筹建 414 v
+筹建处 3 n
+筹拍 4 v
+筹拨 3 v
+筹措 282 v
+筹款 75 n
+筹略 3 n
+筹码 176 n
+筹策 3 n
+筹算 40 v
+筹组 37 n
+筹融资 3 n
+筹议 3 n
+筹设 3 v
+筹谋 23 v
+筹资 110 vn
+筹资额 2 n
+筹躇 3 v
+筹集 302 v
+筹集法 3 n
+筹集资金 3 n
+筻 7 g
+筼 4 zg
+筽 333 zg
+签 1174 v
+签上 3 v
+签上去 3 v
+签上来 3 v
+签下 3 v
+签下去 3 v
+签下来 3 v
+签为 3 v
+签写 3 v
+签准 3 v
+签出 3 v
+签到 27 v
+签到处 3 n
+签到帖 3 n
+签到簿 3 n
+签到贴 3 n
+签单 6 v
+签印 3 v
+签发 192 v
+签合同 3 n
+签名 585 v
+签名人 3 n
+签名会 3 n
+签名册 3 n
+签名图 3 n
+签名文件 3 n
+签名档 3 n
+签名版 3 n
+签名簿 3 n
+签名者 3 n
+签名运动 3 n
+签呈 3 v
+签售会 3 n
+签在 3 v
+签好 3 v
+签妥 3 v
+签子 19 n
+签字 1237 v
+签字仪式 3 n
+签字国 13 n
+签字权 3 n
+签字笔 26 n
+签完 3 v
+签定 147 v
+签得 3 v
+签批 4 v
+签报 3 v
+签押 38 v
+签收 19 v
+签有 3 v
+签条 8 n
+签注 133 v
+签着 3 v
+签章 11 n
+签筒 19 n
+签约 440 v
+签约人 3 n
+签约国 23 n
+签约率 8 n
+签署 2276 v
+签署国 3 n
+签署日 11 n
+签订 3272 v
+签订协议 3 n
+签订合同 3 n
+签订契约 3 n
+签证 444 v
+签证处 6 n
+签证官 3 n
+签证费 8 n
+签诗 3 v
+签过 3 v
+签退 3 v
+简 988 a
+简世辉 10 nr
+简丝数米 3 n
+简亲王 40 nr
+简介 2671 v
+简介性 3 nr
+简仪 24 nr
+简任 3 v
+简体 13 a
+简体中文 9 nr
+简体中文版 3 l
+简体字 268 l
+简体版 3 v
+简作佛 2 nr
+简作兴 2 l
+简便 287 a
+简便性 5 l
+简便易学 3 l
+简便易行 21 n
+简俊东 2 nr
+简傲绝俗 3 v
+简册 2 v
+简写 25 v
+简写本 3 n
+简写法 3 n
+简况 24 n
+简分数 3 l
+简切了当 3 l
+简则 3 a
+简到繁 3 l
+简化 867 v
+简化字 21 l
+简化汉字 6 nz
+简化法 3 n
+简化版 3 n
+简化迹 3 n
+简单 6935 a
+简单劳动 3 l
+简单化 81 v
+简单句 11 l
+简单商品 16 l
+简单扼要 5 l
+简单明了 3 l
+简单易行 35 n
+简单机械 30 l
+简单游 3 nr
+简单网络 2 l
+简历 1520 v
+简历表 2 nr
+简又文 7 nr
+简古 3 d
+简史 296 n
+简图 19 v
+简在帝心 3 l
+简复 3 v
+简大狮 6 nr
+简奥 3 a
+简字 3 n
+简字表 3 n
+简寂 2 a
+简帖 21 a
+简并 24 v
+简并度 3 l
+简并模式 3 l
+简意 2 v
+简慈真 3 nr
+简慢 24 a
+简慧真 3 nr
+简截了当 3 nr
+简报 46 v
+简报室 3 n
+简拔 3 n
+简括 56 v
+简拼 3 v
+简捷 93 a
+简捷了当 3 l
+简接 3 v
+简擢 3 v
+简支梁桥 3 nr
+简支钢 34 nr
+简政 3 n
+简政放权 5 n
+简文帝 18 nr
+简文敏 4 nr
+简明 325 a
+简明性 4 nr
+简明扼要 85 l
+简明新闻 3 nr
+简明版 17 v
+简易 416 a
+简易型 4 n
+简易师范 3 nr
+简易房 16 n
+简易楼 2 n
+简易法 3 n
+简易版 3 n
+简易程序 3 n
+简本 45 a
+简札 3 n
+简朴 160 a
+简板 2 n
+简析 9 v
+简正 3 d
+简正坐标 3 l
+简正振动 3 l
+简正模式 3 l
+简正波 2 nr
+简正频率 3 n
+简毓瑾 4 nr
+简注 2 v
+简洁 326 a
+简洁性 6 n
+简洁明了 23 l
+简派 3 a
+简炼 3 v
+简照南 3 nr
+简爱 10 a
+简牍 71 n
+简狄生 2 nr
+简玉阶 2 nr
+简王爷 3 nr
+简瑞超 3 nr
+简略 216 n
+简略法 3 n
+简直 2356 d
+简省 3 n
+简短 271 v
+简短地 3 z
+简短扼要 3 l
+简码 3 d
+简示 2 v
+简称 3534 v
+简章 101 nr
+简章备索 3 nr
+简笔 8 v
+简笔字 3 l
+简笔画 3 n
+简答 3 v
+简答题 27 n
+简策 5 n
+简简单单 45 z
+简管家 31 l
+简繁 3 a
+简繁体 3 nr
+简繁转换 3 nr
+简繁通 3 nr
+简约 55 d
+简约型 3 n
+简约论坛 3 n
+简约详核 3 nr
+简练 136 a
+简编 39 v
+简缩 4 v
+简缩本 3 l
+简而繁 4 l
+简而言之 63 l
+简肃得 3 nr
+简能而任 3 l
+简落狐狸 3 n
+简表 2 v
+简装 2 v
+简装修 3 l
+简装版 3 l
+简要 183 a
+简要不烦 3 l
+简要地 3 l
+简要清通 3 l
+简言 2 v
+简言之 36 nr
+简讯 41 n
+简记 17 v
+简论 3 v
+简评 9 v
+简谐 3 a
+简谐波 3 l
+简谐运动 8 l
+简谱 32 a
+简贤任能 3 nr
+简贤能 3 nr
+简贤附势 3 nr
+简述 57 v
+简逸 5 a
+简释 3 v
+简野 3 a
+简长老 83 nr
+简阅民 2 nr
+简阳 7 nr
+简阳县 3 nr
+简阳市 3 n
+简陋 363 a
+简验 4 v
+箁 13 zg
+箅 15 zg
+箅子 3 v
+箇 2 zg
+箇中 3 vn
+箇中三昧 3 nr
+箇中人 3 vn
+箍 505 v
+箍匠 3 n
+箍头 3 v
+箍桶 16 n
+箍桶匠 2 n
+箍紧 3 v
+箎 9 zg
+箏 5 zg
+箐 262 g
+箑 8 zg
+箒 5 zg
+箓 47 zg
+箔 73 n
+箔条 23 n
+箔片 5 n
+箕 363 g
+箕宿 3 n
+箕山之志 3 n
+箕山之操 3 n
+箕山之节 3 n
+箕山之风 3 n
+箕山挂瓢 3 n
+箕帚 3 n
+箕帚之使 3 n
+箕引裘随 3 v
+箕斗 4 n
+箕裘 3 n
+箕裘相继 3 nz
+箕门 3 n
+箕风毕雨 3 n
+箖 24 zg
+算 8888 v
+算一天 3 l
+算上去 3 v
+算上来 3 l
+算下 3 v
+算下去 3 l
+算下来 3 l
+算不上 171 l
+算不了 111 l
+算不了什 3 n
+算不得 191 v
+算不清 3 l
+算不算 3 v
+算了 1142 v
+算了又算 3 l
+算了吧 3 l
+算了算 3 l
+算井子 6 n
+算作 258 v
+算你狠 3 l
+算入 3 v
+算出 3 v
+算出去 3 v
+算到 3 v
+算卦 126 v
+算号 3 n
+算号器 3 n
+算命 216 v
+算命人 2 n
+算命先生 3 n
+算命师 3 n
+算命网 3 n
+算命者 3 n
+算啦 3 n
+算器 2 n
+算在内 3 l
+算在里面 3 l
+算子 77 n
+算学 104 n
+算定 3 v
+算尺 3 n
+算度 3 n
+算式 12 n
+算得 3 v
+算得了 3 l
+算得了什 3 n
+算得什么 3 l
+算总账 9 n
+算数 167 n
+算无疑策 3 l
+算无遗策 11 l
+算旧账 4 l
+算是 3540 v
+算术 585 n
+算术上溢 3 l
+算术函数 3 l
+算术子群 3 n
+算术家 3 n
+算术平均 3 l
+算术操作符 3 l
+算术码 3 n
+算术级数 6 l
+算术课 3 n
+算术谓词 3 v
+算术题 4 n
+算机 10 n
+算来 3 v
+算来算去 3 l
+算死草 3 n
+算求 3 v
+算法 455 n
+算法语言 3 l
+算清 16 v
+算清楚 3 l
+算牌器 3 n
+算珠 3 n
+算盘 300 v
+算盘子 3 n
+算盘子儿 3 n
+算符 12 v
+算筹 3 v
+算算 114 v
+算算看 3 v
+算草 3 n
+算计 200 v
+算话 3 v
+算账 144 v
+算起 3 v
+算进 3 v
+算进去 3 l
+算进来 3 l
+算钱 3 v
+算错 3 v
+算题 3 n
+算高 3 v
+箘 10 zg
+箙 84 zg
+箜篌 34 n
+箝 15 n
+箝位 3 n
+箝位器 3 n
+箝制 6 n
+箝口 3 n
+箝口结舌 3 n
+箝子 3 n
+箝形攻势 3 n
+箞 396 zg
+箟 97 zg
+箠 8 zg
+箠楚 3 z
+管 11444 vn
+管一星 3 nr
+管下 3 n
+管不了 3 l
+管不了那 3 nr
+管不住 3 v
+管不着 3 v
+管业 5 n
+管中窃豹 3 n
+管中窥天 3 n
+管中窥物 3 n
+管中窥豹 10 n
+管乐 22 vn
+管乐器 19 n
+管乐队 11 n
+管事 332 n
+管事人 3 n
+管井 3 n
+管亥 3 nz
+管京察 2 nr
+管人 3 n
+管他什么 3 l
+管仲 56 nr
+管仲相 6 nr
+管件 13 n
+管件厂 3 n
+管件网 3 n
+管伟立 8 nr
+管住 72 v
+管体 4 n
+管保 19 vn
+管兀者 2 nr
+管养 3 n
+管养权 4 n
+管养马 2 nr
+管内 98 n
+管内充 2 nr
+管内廷 2 n
+管军 5 n
+管军政 2 nr
+管凤头 2 nr
+管到 3 v
+管制 704 vn
+管制中心 2 l
+管制区 11 n
+管制员 3 n
+管制权 3 n
+管制法 11 n
+管制系统 2 l
+管制经济 3 n
+管区 64 n
+管卡压 3 n
+管原谦次 3 nr
+管及 3 v
+管叔监 2 nr
+管叔鲜 3 nr
+管口 3 vn
+管吃管住 3 l
+管同文 2 nr
+管名 3 n
+管员 9 n
+管嚼 3 v
+管嚼侄 3 n
+管园子 4 nr
+管型 20 vn
+管城 10 n
+管城毛颖 3 nr
+管培俊 3 nr
+管壁 61 n
+管壁增 2 nr
+管壳 3 n
+管外 3 vn
+管头 2 n
+管套 2 n
+管好 94 v
+管姊弟 2 nr
+管委 129 n
+管委会 57 j
+管子 210 n
+管孔 3 n
+管宁割席 3 n
+管宗祥 3 nr
+管家 733 n
+管家人 17 nr
+管家基因 3 n
+管家婆 50 nr
+管寿义 3 nr
+管工 9 vn
+管帐 3 n
+管带 145 n
+管式 38 n
+管式泵 3 nr
+管弦 36 n
+管弦乐 122 nr
+管弦乐器 7 n
+管弦乐团 26 n
+管弦乐曲 34 n
+管弦乐队 65 n
+管弦繁奏 3 nr
+管形牙 3 ns
+管彦忠 9 nr
+管彭其 2 nr
+管径 39 n
+管待 127 v
+管得茶 2 nr
+管恩琦 29 nr
+管惟炎 2 nr
+管扳子 3 v
+管护 11 vn
+管押 7 vn
+管接头 3 n
+管控 13 vn
+管教 283 nz
+管教好 3 l
+管教所 9 n
+管文案 2 n
+管显示器 5 n
+管有 3 vn
+管朝珠 3 nr
+管材 19 n
+管束 106 vn
+管来管去 3 l
+管枪 2 n
+管柱状 2 n
+管标 3 n
+管梅谷 2 nr
+管楚地 2 nr
+管段 2 n
+管民官 5 n
+管河务 2 n
+管治 9 vn
+管治河 3 ns
+管法 3 vn
+管涌 7 v
+管涔山 13 nr
+管炎 2 n
+管炮 3 n
+管点 3 n
+管片 5 n
+管牧放 2 nr
+管状 93 n
+管状腺瘤 3 l
+管状花 10 n
+管玉箫 3 nr
+管理 27191 vn
+管理中心 70 n
+管理人员 33 n
+管理体制 3 n
+管理体系 14 n
+管理信息系统 38 l
+管理决策 3 n
+管理制 8 n
+管理制度 27 n
+管理区 22 n
+管理卡 4 n
+管理厅 2 n
+管理司 23 n
+管理员 205 n
+管理器 26 n
+管理型 9 n
+管理处 151 n
+管理子系统 3 l
+管理学 104 n
+管理学家 14 n
+管理室 3 n
+管理家务 3 n
+管理对象 2 n
+管理局 500 n
+管理局长 3 n
+管理层 376 n
+管理工作 50 n
+管理工具 3 n
+管理应用程序 2 n
+管理性 11 n
+管理所 42 n
+管理手段 4 n
+管理控制 8 n
+管理效率 4 n
+管理文件 3 n
+管理方 50 n
+管理方格 3 n
+管理方面 12 n
+管理机制 7 n
+管理机构 13 n
+管理权 540 n
+管理权限 3 n
+管理条例 48 n
+管理模式 9 l
+管理水平 23 n
+管理法 70 n
+管理混乱 3 l
+管理状况 3 n
+管理社 3 n
+管理科 15 n
+管理科学 92 n
+管理程序 16 n
+管理站 26 n
+管理策略 4 n
+管理系 24 n
+管理系统 198 n
+管理网络 7 n
+管理者 707 n
+管理课 6 n
+管理负担 4 n
+管理费 63 vn
+管理费用 3 n
+管理软件 5 n
+管理部 48 n
+管用 198 vn
+管界 3 n
+管瘤 3 n
+管盐务 3 n
+管祥麟 3 nr
+管科 5 n
+管程 3 n
+管窥 8 nr
+管窥之见 3 i
+管窥筐举 3 vn
+管窥蠡测 5 i
+管管 42 vn
+管籥 3 vn
+管紫文 2 nr
+管絃 3 vn
+管絃乐 3 vn
+管絃乐队 3 v
+管纱 3 n
+管线 224 n
+管网 32 n
+管胞 3 n
+管脚 3 n
+管芯 3 n
+管花目 2 n
+管英代 2 nr
+管茶 2 n
+管营 31 vn
+管营相公 10 nr
+管蔡之 2 nr
+管襄儿 2 nr
+管见 26 v
+管见所及 3 i
+管账 17 vn
+管足 2 v
+管足孔 2 n
+管路 32 n
+管辖 1846 v
+管辖区 13 n
+管辖异议 3 n
+管辖权 169 n
+管连发 2 nr
+管通情 3 n
+管道 1005 n
+管道化 2 nr
+管道口 3 n
+管道局 3 n
+管道工 2 nr
+管道工程 3 n
+管道泵 3 n
+管道消声 3 n
+管道炸裂 3 n
+管道穿越 3 i
+管道结蜡 3 n
+管道网 7 n
+管道配件 3 n
+管钟形 2 nr
+管钳子 3 n
+管铁笛 3 nr
+管键琴 24 nr
+管长 31 n
+管长径 2 n
+管长达 2 nr
+管闲事 104 n
+管顾 3 v
+管领 25 n
+管领清 2 nr
+管风琴 66 nr
+管饱 3 n
+管香积 6 nr
+管鲍之交 3 nr
+管鲍分金 3 nr
+管齐射 2 nr
+箢 792 x
+箣 539 zg
+箤 23 zg
+箥 9 zg
+箦 4 g
+箧 50 zg
+箨 22 g
+箩 104 n
+箩北 3 n
+箩北县 3 n
+箩卜 4 n
+箩筐 71 n
+箪 15 zg
+箪瓢屡空 3 l
+箪豆见色 3 i
+箪食壶浆 9 i
+箪食壶酒 3 i
+箪食瓢饮 3 v
+箫 366 ng
+箫声 131 n
+箫笙 3 n
+箫管 3 n
+箫芳芳 3 v
+箫韶九成 3 nz
+箬 26 n
+箬帽 3 n
+箬竹 3 n
+箬笠 3 n
+箭 3504 n
+箭不虚发 3 i
+箭号 3 n
+箭在弦上 30 i
+箭垛 5 n
+箭垛子 2 n
+箭头 196 n
+箭头键 3 n
+箭如雨下 3 i
+箭尖 3 n
+箭尾 3 n
+箭拔弩张 3 i
+箭无虚发 3 i
+箭杆 51 n
+箭楼 159 n
+箭步 82 n
+箭毒 3 n
+箭法 3 n
+箭猪 3 n
+箭矢 3 n
+箭石 64 n
+箭程 3 n
+箭穿雁嘴 3 i
+箭竹 36 n
+箭筒 13 n
+箭簇 5 n
+箭舌豌豆 3 n
+箭袋 3 n
+箭镞 33 n
+箭靶 3 n
+箭靶子 2 n
+箭鱼 3 n
+箮 105 zg
+箯 161 zg
+箰 29 zg
+箱 1196 q
+箱体 41 n
+箱内 63 s
+箱包 17 n
+箱包厂 3 n
+箱匣 3 n
+箱子 721 n
+箱底 56 n
+箱式 13 n
+箱式显示 3 n
+箱式装置 3 n
+箱形梁 3 n
+箱形舞台 3 n
+箱柜 20 n
+箱根 14 nz
+箱梁 4 n
+箱法扩散 3 j
+箱笼 66 n
+箱管 3 n
+箱纸板 3 n
+箱门 3 n
+箲 2 zg
+箴 86 zg
+箴石 3 n
+箴规 3 n
+箴言 60 n
+箶 48 zg
+箷 5 zg
+箸 129 zg
+箸长碗短 3 nz
+箹 43 zg
+箻 13 zg
+箼 8 zg
+箾 4 zg
+節 117 zg
+篁 28 g
+篂 2 zg
+篃 841 zg
+範 52 zg
+篆 505 ng
+篆书 77 n
+篆体 12 n
+篆刻 107 n
+篆刻家 27 n
+篆刻展 3 n
+篆刻网 3 n
+篆字 25 n
+篆文 28 n
+篆章 3 n
+篆隶 3 n
+篇 3750 q
+篇什 9 n
+篇名 26 n
+篇子 3 n
+篇幅 277 n
+篇数 3 n
+篇文章 3 n
+篇次 3 n
+篇牍 3 n
+篇目 38 n
+篇章 267 n
+篇简 3 n
+篇篇 137 n
+篇籍 3 n
+篇页 3 n
+篇首 6 n
+篌 3 x
+篓 73 zg
+篓子 64 n
+篓筐 3 n
+篔 2 zg
+篘 1320 zg
+篙 99 ng
+篙头 3 ns
+篙子 3 ns
+篚 5 g
+篝 3 zg
+篝火 164 n
+篝火狐鸣 3 i
+篡 165 zg
+篡位 94 v
+篡位夺权 3 nr
+篡党 45 v
+篡党夺权 3 nr
+篡动 3 v
+篡国 3 v
+篡夺 147 v
+篡夺者 3 r
+篡改 101 v
+篡权 61 v
+篡窃 3 v
+篡逆 20 v
+篥 2 x
+篦 37 n
+篦子 12 n
+篦笈 3 n
+篦麻 3 n
+篦麻子 3 n
+篦麻油 3 n
+篪 5 g
+篮 684 n
+篮下 45 n
+篮儿 3 n
+篮协 10 j
+篮协会 3 n
+篮圈 3 n
+篮坛 10 n
+篮头 3 n
+篮委会 3 n
+篮子 310 n
+篮板 537 n
+篮板王 2 n
+篮板球 152 n
+篮架 3 n
+篮框 3 n
+篮状 3 n
+篮球 634 n
+篮球员 3 n
+篮球场 135 n
+篮球服 3 n
+篮球架 8 n
+篮球梦 3 n
+篮球比赛 3 n
+篮球联赛 3 n
+篮球赛 20 n
+篮球运动 3 nz
+篮球迷 6 n
+篮球队 62 n
+篮球鞋 3 n
+篮球风云 3 n
+篮球飞人 3 n
+篮球馆 2 n
+篮筐 24 n
+篮网 3 n
+篮装 3 n
+篮赛 3 n
+篮运 3 n
+篮队 3 n
+篯 6 zg
+篱 72 zg
+篱下 3 n
+篱墙 2 n
+篱壁间物 3 n
+篱子 3 n
+篱栅 3 n
+篱竹 3 n
+篱笆 222 n
+篱笆墙 3 n
+篱落 10 n
+篱障 3 n
+篲 2 zg
+篴 2 zg
+篷 183 zg
+篷却 3 n
+篷子 3 n
+篷布 7 n
+篷帆 3 n
+篷帐 13 n
+篷车 9 n
+篷马车 3 n
+篼 21 zg
+篾 51 n
+篾丝 3 n
+篾匠 10 n
+篾工 3 n
+篾席 6 n
+篾条 3 n
+篾片 11 n
+篾竹 3 n
+篾笆 3 n
+篾签 3 n
+篾青 2 n
+篾黄 3 n
+簃 13 zg
+簇 394 zg
+簇叶 3 nz
+簇团 3 v
+簇定义域 3 n
+簇居 3 v
+簇拥 652 v
+簇拥着 3 v
+簇拥而上 3 v
+簇新 44 v
+簇生 3 v
+簇簇 42 q
+簇绒 3 nz
+簇锦团花 3 n
+簋 71 zg
+簌 14 z
+簌地 3 z
+簌簌 178 z
+簌簌泪下 3 vn
+簏 7 g
+簑笠翁 3 ns
+簑衣 3 vn
+簖 3 g
+簙 3 zg
+簚 2 zg
+簛 8 zg
+簝 6 zg
+簞 23 zg
+簟 68 g
+簟纹如水 3 v
+簠 25 zg
+簠簋不饬 3 v
+簡 3221 zg
+簢 9 zg
+簣 13 zg
+簤 170 zg
+簥 14 zg
+簦 67 zg
+簧 293 n
+簧乐器 3 n
+簧片 18 n
+簧管 6 n
+簧风琴 3 n
+簨 556 zg
+簩 412 zg
+簪 126 zg
+簪子 75 n
+簪缨 22 n
+簪缨世族 3 n
+簪缨世胄 3 n
+簪花 25 n
+簬 397 zg
+簭 22 zg
+簮 18 zg
+簯 266 zg
+簰 6 ns
+簰洲镇 11 ns
+簱 6 zg
+簲 182 zg
+簳 89 zg
+簵 30 zg
+簷 11 zg
+簸 12 n
+簸动 3 n
+簸土扬沙 3 n
+簸弄 3 n
+簸箕 79 n
+簸箩 7 n
+簸荡 3 n
+簸谷 3 n
+簹 6 zg
+簺 213 zg
+簻 40 zg
+簽 6 zg
+簾 15 zg
+簿 726 ng
+簿册 20 n
+簿子 29 n
+簿本 3 n
+簿本费 3 n
+簿籍 22 n
+簿记 50 n
+簿记员 2 n
+簿记师 3 n
+籀 37 g
+籁 52 ng
+籂 15 zg
+籆 2 zg
+籇 2 zg
+籍 1401 ng
+籍为兵 2 nr
+籍为民 3 nr
+籍主 2 n
+籍京师 3 nr
+籍占田 2 nr
+籍口 3 n
+籍守制 2 nr
+籍定样 2 nr
+籍归田 2 nr
+籍授 16 n
+籍教习 2 nr
+籍无名 2 nr
+籍没 52 v
+籍河东 2 nr
+籍海楼 2 nr
+籍记充 2 nr
+籍译成 2 nr
+籍贯 132 nr
+籍贯地 3 nr
+籓 7 zg
+籔 10 zg
+籕 3 zg
+籗 843 zg
+籚笋 3 nz
+籚笋汁 3 v
+籝 27 zg
+籤 7 zg
+籰 25 zg
+籲 3 zg
+米 35136 q
+米一升 2 nr
+米万钟 4 nr
+米丘林 3 nr
+米业 256 n
+米为义 12 nr
+米为亚 3 nr
+米丽雅 3 nr
+米乐继 3 nr
+米乔德 3 nr
+米亚 22 ns
+米亚尔 4 nr
+米亚康 8 nr
+米亚汗 4 nr
+米亚特 2 nr
+米亚罗 3 nr
+米什科尔茨 4 nrt
+米仓 10 nr
+米仓加奈子 2 nr
+米仓山 10 nr
+米价 17 n
+米佐塔基斯 4 nrt
+米修斯 6 nr
+米元章 5 nr
+米克 7 nrt
+米克尔 8 nr
+米克斯 4 nr
+米克洛什 8 nrt
+米公祠 257 nr
+米兰 607 ns
+米兰妮 3 nrt
+米兰望台 2 nrt
+米兰达 25 nr
+米兰达州 2 ns
+米兰银行 3 nt
+米兰队 5 nz
+米其林 41 nr
+米内利 9 ns
+米凯利斯 3 nrt
+米凯尔 4 nr
+米凯莱 5 nr
+米切尔 15 nr
+米利 3 nrt
+米利亚 2 ns
+米利托 4 nr
+米利机器 3 nz
+米利都 82 ns
+米制 12 n
+米力农 3 nr
+米加 13 nrt
+米勒 86 nrt
+米勒兰 8 nr
+米勒德 2 nr
+米勒指数 3 nz
+米勒教官 3 nr
+米勒特 4 nr
+米千石 2 nr
+米南加 3 ns
+米南卡 2 nr
+米南卡保 3 nr
+米南德 6 nr
+米博华 2 nr
+米卡 12 nrt
+米卢斯 3 nr
+米厂 11 n
+米原器 2 nr
+米友仁 12 nr
+米吐尔 3 nr
+米启尔 2 nr
+米哈 5 nrt
+米哈伊 16 nrt
+米哈伊尔 15 nrt
+米哈伊洛夫 52 nrt
+米哈伊洛维奇 8 nrt
+米喜子 3 nr
+米坦尼 8 nr
+米坦科 2 nr
+米坪镇 3 nr
+米堡赢 2 nr
+米塔 5 nrt
+米塔尔 22 nr
+米塞斯 3 nr
+米塞特 2 nr
+米壳 3 n
+米处 35 n
+米夫 39 nrt
+米奇 15 nr
+米奇尼 2 nr
+米奇湖 2 nr
+米奥 10 nrt
+米妮 4 nrt
+米姆 15 nrt
+米娅 6 nrt
+米字旗 3 nr
+米季奇 2 nr
+米学东 3 nr
+米安 4 nrt
+米安钠 2 nz
+米家沟 3 nr
+米家沟村 3 ns
+米家镇 37 nr
+米尔 86 nrt
+米尔一世 4 nrt
+米尔佛 3 nr
+米尔克 2 nrt
+米尔城 2 nr
+米尔奇 4 nr
+米尔尼 3 nr
+米尔岛 17 nrt
+米尔峰 5 nr
+米尔德 3 nrt
+米尔扎 7 nrt
+米尔斯 12 nrt
+米尔本 7 ns
+米尔森 5 nr
+米尔登 5 nrt
+米尔福德 3 nrt
+米尔科 2 nrt
+米尔纳 6 nr
+米尔维 3 nr
+米尔豪 5 nr
+米尔顿 32 nrt
+米尺 6 nr
+米尼斯 3 nr
+米尼汉 4 nr
+米尼特 16 nrt
+米山 6 ns
+米左右 9 nr
+米已成炊 3 i
+米希亚 3 nr
+米希依 4 nr
+米希尔 2 nr
+米常仰 2 nr
+米店 8 ns
+米廖夫 2 nr
+米建国 5 ns
+米建威 10 nr
+米开兰基 3 nr
+米开朗 3 nr
+米开朗基罗 14 nrt
+米开朗琪罗 55 nr
+米德 25 nrt
+米德公理 2 nr
+米德兰 11 nr
+米德勒 3 nr
+米德哈 9 nr
+米德堡 3 nr
+米德尔 18 nr
+米德尔斯堡 68 nrt
+米德尔斯堡队 8 nz
+米德求 8 nr
+米德湖 2 nr
+米思翰 3 nr
+米恩杰 3 nr
+米托斯 3 nrt
+米拉 44 nrt
+米拉波 10 nr
+米提利 32 nr
+米文平 2 nr
+米斯 13 nrt
+米斯之 16 nr
+米斯特拉尔 2 nrt
+米易 4 nrt
+米易县 3 ns
+米林 6 nr
+米林县 2 ns
+米林湖 6 nr
+米果 3 n
+米查林 2 nr
+米格 722 nrt
+米格尔 10 nr
+米格机 3 nr
+米横野 7 nr
+米歇尔 45 nr
+米汤 31 nr
+米沙坦 4 ns
+米沙鄢 15 nr
+米泉 4 nr
+米泉县 3 ns
+米泉市 3 ns
+米泔水 3 n
+米波 3 nr
+米泽斯 5 nr
+米洛斯 2 nr
+米洛斯岛 2 nrt
+米洛舍 3 nrt
+米洛舍维奇 7 nrt
+米浆 4 n
+米海尔 2 nr
+米海洛 2 nr
+米涅 4 nrt
+米涅夫 19 nrt
+米烂成仓 3 nr
+米特 67 nrt
+米特准 3 nr
+米特含 5 nr
+米特尼克 2 nrt
+米特拉 2 nrt
+米特族 3 nz
+米特雷 3 nr
+米珠薪桂 4 nr
+米盐博辩 3 nr
+米盖尔 3 nr
+米票 3 n
+米科利 3 nr
+米突 3 nr
+米第亚 32 ns
+米粉 1336 nr
+米粉店 3 n
+米粉条 3 n
+米粉肉 3 n
+米粒 94 n
+米粒之珠 3 nr
+米粒儿 3 nr
+米粥 61 n
+米粮 17 n
+米粮川 8 nr
+米糕 4 n
+米糠 11 nr
+米糠油 7 nz
+米纳 8 nrt
+米纳姆 2 nr
+米纳尔 3 nr
+米纳斯 10 nr
+米纳斯吉拉斯 5 nrt
+米纳斯吉拉斯州 16 nrt
+米纽斯 2 nr
+米线 28 n
+米缸 15 nz
+米罗 4 nrt
+米罗西 9 ns
+米老鼠 38 nr
+米耶勒 2 nr
+米脂 93 n
+米脂县 34 ns
+米色 25 n
+米花岭 2 ns
+米芾 294 nr
+米苏 18 ns
+米苏斯 4 nr
+米苏里 3 nrt
+米苏里州 3 ns
+米茨 2 nrt
+米莱 5 nrt
+米萨尔 3 nr
+米萨德 2 nr
+米萨格 4 nr
+米萨诺 2 nr
+米蒂南 3 nr
+米虫 3 n
+米蛀虫 3 n
+米袋 10 n
+米袋子 8 n
+米西 2 ns
+米诺夫 2 nr
+米诺斯 147 nr
+米诺蒂 2 nr
+米质 5 n
+米贱伤农 3 nr
+米贵伤民 3 nr
+米输纳 2 nr
+米达斯 18 nr
+米达麦亚 3 ns
+米迦勒 3 nr
+米酒 35 n
+米醋 11 nz
+米里 8 nrt
+米铺 8 n
+米阳坡 4 nr
+米阴坡 7 nr
+米雪儿 5 nr
+米雷兹 3 nr
+米青彡采 3 nr
+米青采彡 3 nz
+米面 56 n
+米饭 400 n
+米香主 31 nr
+米高扬 24 nr
+米高梅 19 nr
+米麦 14 nrt
+米黄色 23 nr
+籴 89 v
+籹 6 zg
+类 14536 q
+类义词 3 n
+类乌齐 2 ns
+类乌齐县 3 ns
+类乎 3 v
+类书 68 n
+类书籍 3 n
+类产品 7 n
+类人 162 n
+类人猿 15 n
+类似 5527 v
+类似之处 3 l
+类似性 3 n
+类似物 3 n
+类光事件 3 n
+类光矢量 3 vn
+类别 1016 n
+类别转换 3 v
+类动物 3 n
+类化 3 v
+类化合物 3 n
+类同 55 n
+类同相召 3 ns
+类喀斯特 3 ns
+类囊体 3 n
+类固醇 77 n
+类图书 3 n
+类地行星 6 n
+类型 5899 n
+类型信息 3 n
+类型化 5 n
+类型区 8 n
+类型图 3 n
+类型学 23 n
+类型定义 2 n
+类型接口 2 n
+类型论 3 n
+类型转换 6 v
+类属 3 n
+类库 2 n
+类抗生素 3 n
+类推 54 v
+类推法 3 n
+类推说明 3 n
+类新星 3 n
+类时事件 3 n
+类时矢量 3 vn
+类星体 34 n
+类是而非 3 l
+类木行星 4 n
+类杂志 3 n
+类染色体 3 n
+类毒素 19 n
+类比 111 v
+类比性 5 n
+类比推理 13 n
+类池 3 n
+类牙骨质 3 n
+类物质 3 n
+类物资 3 n
+类病毒 3 n
+类目 3 n
+类空 3 n
+类空截面 3 n
+类空线 3 n
+类空间隔 3 n
+类算子 3 n
+类粘蛋白 3 n
+类网络 2 n
+类群 164 n
+类聚 3 v
+类聚效应 3 n
+类聚群分 3 n
+类肝素 3 n
+类股票 3 n
+类脂 3 n
+类节目 3 n
+类药物 16 n
+类菌体 3 n
+类萜 3 n
+类蛋白质 3 n
+类证治裁 3 n
+类质同晶 3 n
+类项 3 n
+类风湿 19 n
+类风湿性 18 n
+类风湿病 3 n
+类食品 3 n
+类鬼笔 3 n
+类鬼笔素 3 n
+类黄酮 3 n
+籼 43 n
+籼稻 21 n
+籼米 9 n
+籽 146 ng
+籽儿 9 n
+籽实 18 n
+籽实体 3 n
+籽晶 3 n
+籽棉 4 n
+籽种 11 n
+籽粒 20 n
+粂 105 zg
+粈 360 zg
+粉 2351 n
+粉丝 120 n
+粉丝团 3 n
+粉丝汤 3 i
+粉丝状 3 n
+粉丝网 3 n
+粉乎乎 3 z
+粉体 6 n
+粉刷 165 v
+粉刺 76 v
+粉剂 19 n
+粉化 5 v
+粉喷桩 3 i
+粉嘟嘟 3 z
+粉坊 3 n
+粉墙 36 n
+粉墙黛瓦 2 v
+粉墨 3 n
+粉墨登场 31 i
+粉壁 3 n
+粉妆 3 v
+粉妆玉琢 6 i
+粉嫩 34 z
+粉尘 108 n
+粉屑 3 n
+粉底 39 n
+粉底液 2 n
+粉底霜 3 i
+粉店 3 n
+粉彩 22 n
+粉扑 4 n
+粉扑扑 3 z
+粉拳 3 n
+粉拳绣腿 3 n
+粉料 4 n
+粉未 3 nz
+粉末 437 n
+粉末冶金 3 vn
+粉末涂料 3 i
+粉末状 38 i
+粉条 53 n
+粉条儿菜 3 n
+粉板 3 n
+粉沙 10 n
+粉沫 3 n
+粉浆 3 n
+粉煤 2 n
+粉煤灰 11 n
+粉煤灰砖 2 n
+粉牌 7 n
+粉状 186 n
+粉瘤 9 n
+粉白 15 v
+粉白墨黑 3 i
+粉白色 4 n
+粉白黛绿 3 z
+粉白黛黑 3 z
+粉皮 9 n
+粉盒 6 n
+粉砂 3 n
+粉碎 1215 v
+粉碎器 3 n
+粉碎性 14 n
+粉碎机 19 i
+粉笔 85 n
+粉笔灰 3 i
+粉笔画 3 n
+粉粒 3 n
+粉糕 3 n
+粉红 200 b
+粉红噪声 3 nz
+粉红色 505 n
+粉纹夜蛾 3 n
+粉线 3 n
+粉细砂 4 n
+粉肠 3 n
+粉脸 3 n
+粉腊 3 n
+粉腊笔 3 n
+粉膏 3 n
+粉色 62 n
+粉艳 2 z
+粉芡 3 v
+粉萆薢 3 z
+粉葛 3 n
+粉蒸 257 nz
+粉蒸肉 4 n
+粉蓝 3 b
+粉蛾 3 n
+粉蝶 9 n
+粉蝶儿 3 n
+粉蝶霉素 3 n
+粉装玉琢 3 i
+粉身灰骨 3 i
+粉身碎骨 236 i
+粉针 6 n
+粉针剂 4 n
+粉霉素 3 n
+粉霜 3 n
+粉面 3 n
+粉面朱唇 3 n
+粉面油头 3 n
+粉领 3 n
+粉饰 51 n
+粉饰太平 11 n
+粉饰门面 3 n
+粉饼 8 n
+粉骨捐躯 3 i
+粉骨碎身 3 i
+粉骨糜身 3 vn
+粉骨糜躯 3 v
+粉黛 14 n
+粊 10 zg
+粌 53 zg
+粍 150 zg
+粎 86 zg
+粏 52 zg
+粐 109 zg
+粑 1491 g
+粒 1142 q
+粒儿 9 n
+粒子 1503 n
+粒子学说 3 n
+粒子束 56 n
+粒子流 28 n
+粒子电泳 3 n
+粒子系统 11 n
+粒屑 3 n
+粒度 68 n
+粒径 32 n
+粒料 7 n
+粒状 114 n
+粒病 3 n
+粒米 3 n
+粒米束薪 3 n
+粒粒 3 n
+粒粒皆辛 3 l
+粒粒皆辛苦 6 l
+粒级 3 n
+粒细胞 134 n
+粒经 3 n
+粒肥 3 n
+粒腺体 3 n
+粒选 3 n
+粒重 3 n
+粒铁 3 n
+粒雪 3 n
+粒雪盆 3 n
+粓 60 zg
+粔 2 zg
+粕 43 g
+粖 114 zg
+粗 2598 a
+粗中带细 3 i
+粗中有细 6 i
+粗乳状液 3 n
+粗人 102 n
+粗估 2 v
+粗体 3 a
+粗俗 103 a
+粗俗的人 3 l
+粗具 3 n
+粗具规模 3 l
+粗制 3 n
+粗制品 2 n
+粗制滥造 32 i
+粗加工 3 n
+粗劣 16 a
+粗劣品 3 l
+粗厚 25 a
+粗口 15 n
+粗哑 7 a
+粗喉大嗓 3 n
+粗嗓子 4 n
+粗坑 3 n
+粗墩墩 3 z
+粗壮 339 a
+粗声 3 n
+粗声厉气 3 i
+粗声大气 3 i
+粗声暴气 3 i
+粗声粗气 26 l
+粗大 562 a
+粗天鹅绒 3 n
+粗定位 3 n
+粗实 2 a
+粗工 3 n
+粗布 102 v
+粗布条 3 n
+粗帆布 3 i
+粗度 3 n
+粗心 77 a
+粗心地 3 i
+粗心大意 60 i
+粗心浮气 3 i
+粗感觉 3 n
+粗手笨脚 3 l
+粗手粗脚 3 i
+粗拉 3 n
+粗提物 3 n
+粗放 113 v
+粗放型 52 n
+粗放式 9 n
+粗放经营 19 n
+粗旷 2 a
+粗暴 241 a
+粗服乱头 3 i
+粗杆 3 n
+粗杠 3 n
+粗枝大叶 8 i
+粗样 3 d
+粗榧碱 3 vn
+粗毛 3 n
+粗毛布 3 n
+粗毛皮 3 n
+粗毛羊 2 n
+粗气 82 n
+粗沙 7 n
+粗活 37 a
+粗浅 105 a
+粗涩 3 a
+粗滤器 3 n
+粗灯丝 3 n
+粗犷 168 a
+粗率 26 n
+粗略 172 n
+粗略叙述 3 n
+粗略地 3 n
+粗疏 71 a
+粗盐 3 n
+粗眉大眼 3 i
+粗知一二 3 i
+粗短 3 a
+粗石 3 n
+粗硬 3 a
+粗磨谷粉 3 n
+粗笨 30 a
+粗筋 3 n
+粗米 3 n
+粗粒度 2 n
+粗粗 61 a
+粗粗细细 3 i
+粗粝 11 n
+粗粮 62 n
+粗糖 6 n
+粗糙 489 a
+粗糙度 25 n
+粗糙集 3 n
+粗糠 3 n
+粗糲 3 z
+粗纤维 3 l
+粗纱 6 n
+粗纱机 4 n
+粗纸板 3 n
+粗纺 17 b
+粗线 3 n
+粗线期 3 b
+粗线条 22 n
+粗细 278 a
+粗细兼揉 3 i
+粗绒 3 n
+粗绳 3 n
+粗肥 3 n
+粗脂肪 7 n
+粗腔横调 3 i
+粗腿病 3 n
+粗花呢 3 n
+粗茶淡饭 21 i
+粗莽 8 a
+粗蛋白质 3 n
+粗蛮 2 a
+粗衣恶食 3 i
+粗衣淡食 3 i
+粗衣淡饭 3 i
+粗衣粝食 3 vn
+粗袍粝食 3 vn
+粗视纤维 3 l
+粗言 3 n
+粗言烂语 3 i
+粗言秽语 6 i
+粗话 104 n
+粗读 3 v
+粗调 3 n
+粗豪 64 a
+粗货 3 n
+粗质 3 n
+粗选 3 v
+粗通 3 a
+粗通文墨 3 n
+粗通文字 3 n
+粗鄙 50 a
+粗里粗气 3 l
+粗重 115 a
+粗野 83 n
+粗野主义 3 n
+粗铜 8 n
+粗陋 35 a
+粗面岩 17 n
+粗颈 3 n
+粗风暴雨 3 i
+粗饲料 8 n
+粗鲁 193 a
+粗鲁无礼 3 n
+粗麻布 7 n
+粘 1360 v
+粘上 3 n
+粘上去 3 v
+粘丝体 3 n
+粘乎乎 9 z
+粘住 3 v
+粘剂 3 n
+粘合 73 v
+粘合剂 50 n
+粘合力 5 n
+粘合斑 3 n
+粘合衬 3 n
+粘固 3 v
+粘固剂 3 n
+粘土 377 n
+粘土侵 3 v
+粘土矿 65 n
+粘土砖 7 n
+粘土膨胀 3 n
+粘堵 3 v
+粘多糖 5 n
+粘度 109 n
+粘度系数 3 n
+粘度计 7 n
+粘弹性 55 n
+粘性 237 n
+粘性力 3 n
+粘性流体 3 n
+粘扣带 3 n
+粘接 23 v
+粘接剂 2 n
+粘液 218 n
+粘液囊肿 3 n
+粘液性 3 n
+粘液腺癌 3 n
+粘温系数 3 n
+粘滞 41 v
+粘滞性 23 n
+粘牢 3 n
+粘皮带骨 3 n
+粘着 74 v
+粘着剂 2 n
+粘稠 104 a
+粘稠度 7 n
+粘粘巴巴 3 z
+粘粘搭搭 3 z
+粘粘渍渍 3 n
+粘粘糊糊 2 z
+粘糊 2 a
+粘糊糊 5 z
+粘糕 2 n
+粘紧 3 v
+粘结 62 v
+粘结剂 9 n
+粘结力 10 n
+粘结性 3 n
+粘胶 64 n
+粘胶纤维 3 n
+粘胶蛋白 3 n
+粘膜 404 n
+粘膜免疫 3 n
+粘膜支持 3 n
+粘膜炎 3 n
+粘膜瓣 3 n
+粘膜骨膜 3 n
+粘花惹草 3 vn
+粘菌 13 n
+粘虫 13 n
+粘蜡 3 n
+粘质 3 n
+粘贴 59 n
+粘贴板 3 n
+粘连 114 v
+粘附 69 v
+粘附分子 3 n
+粙 32 zg
+粛 67 zg
+粜 78 v
+粜风卖雨 3 v
+粝 48 g
+粝食粗衣 3 i
+粞 26 g
+粟 300 nr
+粟一石 2 nr
+粟三石 2 nr
+粟丘疹 3 n
+粟二石 4 nr
+粟子 2 nr
+粟子树 2 nr
+粟宗华 2 nr
+粟帛皆 2 nr
+粟戎生 18 nr
+粟拜爵 3 nr
+粟收息 2 nr
+粟末水 2 nr
+粟特人 2 nr
+粟特文 9 nr
+粟特语 3 nr
+粟田湖 256 nr
+粟米 34 nr
+粟类 3 n
+粟粒状 3 nr
+粟红贯朽 3 n
+粟芒蝇 3 nr
+粟裕 193 nr
+粟裕任 2 nr
+粟裕将军 2 nr
+粟谷 3 nr
+粟都尉 2 nr
+粟陈贯朽 3 n
+粟饭 2 n
+粠 340 zg
+粡 280 zg
+粢 24 g
+粣 11 zg
+粤 917 j
+粤东 54 ns
+粤伶 3 n
+粤军 3 n
+粤剧 58 n
+粤剧团 5 nt
+粤北 35 ns
+粤北山 3 ns
+粤式 3 n
+粤方言 10 n
+粤曲 8 ns
+粤桂 8 j
+粤歌 3 n
+粤汉铁路 3 nz
+粤江 3 ns
+粤江三角 3 ns
+粤江流域 3 ns
+粤海 10 ns
+粤海铁 3 nz
+粤港 6 ns
+粤港澳 4 ns
+粤犬吠雪 3 vn
+粤省 3 ns
+粤籍 3 n
+粤绣 6 nz
+粤若稽古 3 ns
+粤菜 26 n
+粤菜馆 3 n
+粤西 43 ns
+粤语 43 nz
+粤语歌 3 n
+粤语片 3 n
+粤语版 3 n
+粤音 3 n
+粤高速 3 nz
+粥 1117 n
+粥少僧多 2 i
+粥样 57 b
+粥粥无能 3 i
+粥饭 3 b
+粦 75 zg
+粧 17 zg
+粨 101 zg
+粩 28 zg
+粪 665 n
+粪便 279 n
+粪便污水 3 n
+粪卟啉 3 nr
+粪卟啉原 3 vn
+粪口途径 3 n
+粪固醇 3 n
+粪土 46 n
+粪土不如 3 n
+粪土之墙 3 n
+粪坑 21 n
+粪堆 24 n
+粪壤 3 n
+粪桶 24 n
+粪池 7 n
+粪污 3 n
+粪球 10 n
+粪甾烷 3 n
+粪筐 3 n
+粪箕 3 n
+粪箕子 3 v
+粪篓 4 n
+粪肥 16 n
+粪胆素 3 n
+粪胆素原 3 n
+粪臭素 3 n
+粪车 3 n
+粪门 3 n
+粪青 3 n
+粫 16 zg
+粬 1457 zg
+粭 53 zg
+粮 3454 n
+粮人 3 n
+粮仓 147 n
+粮价 76 n
+粮作 3 n
+粮倌 3 n
+粮农 17 n
+粮农组织 12 nt
+粮商 39 n
+粮囤 3 n
+粮垛 3 n
+粮堆 3 n
+粮多草广 3 nz
+粮季 3 n
+粮尽援绝 3 i
+粮库 40 n
+粮店 15 n
+粮所 3 n
+粮改 3 j
+粮栈 7 n
+粮棉 55 n
+粮棉油 4 n
+粮款 8 n
+粮油 107 n
+粮油机械 3 n
+粮油食品 3 n
+粮源 8 n
+粮田 17 n
+粮票 70 n
+粮种 3 n
+粮秣 50 n
+粮税 3 n
+粮站 66 n
+粮管所 3 j
+粮管站 3 n
+粮舱 3 n
+粮船 3 n
+粮草 376 n
+粮草先行 8 n
+粮荒 9 n
+粮行 3 j
+粮袋 7 n
+粮谷 3 n
+粮道 3 n
+粮食 5923 n
+粮食产量 3 l
+粮食价格 3 l
+粮食作物 584 l
+粮食供应 3 l
+粮食加工 3 l
+粮食安全 3 l
+粮食局 39 n
+粮食市场 3 n
+粮食部 6 n
+粮食部门 2 l
+粮饷 159 n
+粯 65 zg
+粰 299 zg
+粱 92 nr
+粱书文 3 nz
+粱山 3 nz
+粱肉 3 nz
+粲 127 a
+粲然 16 a
+粲然一笑 3 v
+粲然可观 3 v
+粲花之论 3 v
+粳 19 n
+粳稻 275 n
+粳米 34 n
+粴 32 zg
+粵 3 zg
+粶 10 zg
+粷 70 zg
+粸 33 zg
+粹 31 ng
+粺 45 zg
+粻 3 zg
+粼 41 z
+粼粼 23 z
+粼粼碧波 3 nr
+粽 76 zg
+粽子 322 n
+粽粑 4 n
+精 4066 n
+精专 3 n
+精义 44 n
+精义入神 3 i
+精于 356 v
+精于心 3 i
+精修 8 v
+精光 221 n
+精兵 458 n
+精兵制 3 n
+精兵强将 150 i
+精兵政策 3 n
+精兵简政 30 i
+精典 12 n
+精准 99 n
+精准度 3 n
+精减 12 v
+精到 33 v
+精制 369 n
+精制品 5 n
+精力 1496 n
+精力不济 3 i
+精力交瘁 3 i
+精力充沛 37 l
+精力旺盛 3 l
+精力有限 3 n
+精力枯竭 3 i
+精力过人 3 n
+精力过剩 3 l
+精加工 11 n
+精包蛋白 3 l
+精化 8 n
+精华 1717 nz
+精华区 3 ns
+精华帖 3 n
+精华液 3 n
+精华游 3 n
+精华版 3 n
+精华素 11 n
+精华贴 3 n
+精卫 3 n
+精卫填海 3 n
+精卵结合 3 n
+精卵融合 3 n
+精原细胞 3 n
+精原质 3 n
+精品 1959 n
+精品下载 3 n
+精品化 3 n
+精品小说 3 l
+精品屋 6 n
+精品展 4 n
+精品工程 3 n
+精品店 9 n
+精品廊 3 n
+精品房 3 n
+精品电影 3 n
+精品网 3 n
+精品课 3 n
+精品课程 3 n
+精品软件 3 n
+精囊 31 n
+精囊炎 2 n
+精壮 93 a
+精奇 3 a
+精奥 3 a
+精妙 352 a
+精妙绝伦 3 i
+精子 492 n
+精子包囊 3 n
+精子发生 3 n
+精子库 2 n
+精子形成 3 i
+精子细胞 3 n
+精孢子 3 nz
+精审 3 n
+精密 559 a
+精密仪器 2 n
+精密化 4 n
+精密型 2 n
+精密度 20 n
+精密性 2 n
+精密支托 3 n
+精密机器 3 n
+精密机械 3 n
+精尽人亡 3 i
+精巢 12 n
+精工 40 n
+精工细作 3 n
+精巧 936 a
+精干 163 n
+精度 943 n
+精度高 6 n
+精强力壮 3 i
+精当 47 a
+精彩 2048 n
+精彩内容 3 n
+精彩剧照 3 n
+精彩图片 3 n
+精彩文章 3 i
+精彩演出 3 l
+精彩电影 3 n
+精彩画面 3 i
+精彩纷呈 26 i
+精彩绝伦 12 i
+精彩节目 3 i
+精彩表演 3 n
+精彩视频 3 n
+精彩逼人 3 i
+精彩镜头 3 n
+精彩音乐 3 n
+精微 164 a
+精心 1217 n
+精心制作 3 i
+精心制造 3 n
+精心培养 3 n
+精心安排 3 n
+精心施工 3 i
+精心杰作 3 i
+精心照料 3 i
+精心策划 3 n
+精心组织 3 n
+精心设计 3 i
+精忠 26 a
+精忠报国 14 i
+精怪 32 a
+精悍 30 a
+精打细算 60 i
+精挑细选 3 v
+精改 3 v
+精敏 3 a
+精敏度 3 n
+精整 7 a
+精料 8 n
+精料入炉 3 n
+精明 474 a
+精明世故 3 i
+精明强干 68 i
+精明眼 3 n
+精明能干 54 n
+精本 3 a
+精梳 35 n
+精梳机 3 n
+精梳棉 3 n
+精梳纱 3 n
+精武 11 n
+精武门 3 n
+精母细胞 3 n
+精气 85 n
+精气神 23 n
+精气神儿 6 n
+精氨酸 3 n
+精氨酸酶 3 nz
+精汁 3 n
+精河 7 ns
+精河县 5 ns
+精油 87 n
+精油瓶 3 n
+精液 129 n
+精液蛋白 3 n
+精液量 3 n
+精深 137 a
+精湛 397 a
+精满自溢 3 i
+精灵 163 n
+精灵鬼怪 3 i
+精炼 125 v
+精炼厂 2 n
+精炼油 3 n
+精炼炉 3 n
+精煤 4 n
+精熟 100 a
+精琢 3 v
+精疲力倦 3 i
+精疲力尽 63 i
+精疲力竭 98 i
+精瘦 38 a
+精白 6 n
+精白米 6 n
+精益 6 n
+精益求精 51 n
+精盐 13 n
+精短 3 n
+精矿 36 n
+精研 79 n
+精研细磨 3 n
+精确 1315 a
+精确化 16 n
+精确定位 2 n
+精确定层 3 n
+精确度 100 n
+精确性 32 n
+精确测量 2 n
+精磨 7 a
+精神 12961 n
+精神不振 23 i
+精神分析 3 l
+精神分析学家 6 n
+精神分裂 3 i
+精神分裂症 44 n
+精神创伤 3 n
+精神力 3 n
+精神力量 3 n
+精神压力 3 n
+精神可嘉 3 nz
+精神境界 3 n
+精神外科 3 n
+精神失常 3 i
+精神头儿 3 n
+精神实质 3 l
+精神家园 3 n
+精神异常 3 i
+精神性 35 n
+精神恍忽 3 z
+精神恍惚 23 i
+精神感召 3 ns
+精神抖擞 88 i
+精神振奋 3 i
+精神损失 3 n
+精神损失费 10 i
+精神损耗 3 n
+精神支柱 3 i
+精神文明 1118 i
+精神枷锁 3 i
+精神桎梏 3 v
+精神污染 3 i
+精神涣散 3 i
+精神满腹 3 i
+精神焕发 32 i
+精神爽 3 i
+精神状态 5 n
+精神界 2 n
+精神疾病 3 n
+精神病 241 n
+精神病人 3 n
+精神病学 40 n
+精神病科 3 n
+精神病院 48 n
+精神痛苦 3 i
+精神百倍 20 i
+精神科 3 n
+精神紧张 3 l
+精神药品 3 n
+精神药物 3 n
+精神衰弱 3 l
+精神论 3 n
+精神论者 3 n
+精神负担 3 n
+精神财富 3 l
+精神贯注 3 i
+精神赔偿 3 nz
+精神障碍 3 n
+精神面貌 3 i
+精神领袖 3 n
+精神风貌 3 i
+精神食粮 3 i
+精神饱满 44 i
+精神鼓励 3 l
+精神鼓舞 3 i
+精简 237 n
+精简人事 3 i
+精简人员 3 i
+精简指令 8 i
+精简整编 3 i
+精简机构 3 l
+精简版 2 l
+精算 16 v
+精算学 5 n
+精算师 61 n
+精米 6 n
+精粹 35 a
+精精致致 3 i
+精索 22 n
+精纯 49 a
+精纺 69 n
+精练 87 a
+精细 1616 a
+精细化 9 n
+精细化工 3 n
+精细微妙 3 i
+精细管 3 n
+精细结构 3 n
+精绝 242 v
+精编 7 n
+精缩 3 v
+精美 1515 a
+精美图片 3 nz
+精美型 3 n
+精美壁纸 3 n
+精美画册 3 i
+精美绝伦 18 i
+精耕 3 v
+精耕细作 38 n
+精肉 11 n
+精胺 3 n
+精致 630 a
+精舍 36 n
+精良 238 a
+精英 781 n
+精英奖 3 nz
+精英教育 3 l
+精英赛 21 n
+精萃 5 v
+精蕴 3 n
+精虫 3 n
+精血 23 n
+精血亏虚 3 i
+精装 24 n
+精装书 5 n
+精装修 3 l
+精装本 2 n
+精装版 3 n
+精要 71 a
+精覈 3 z
+精讲 8 v
+精诚 24 a
+精诚合作 6 i
+精诚团结 10 i
+精诚所至 7 i
+精读 41 v
+精贯白日 3 i
+精赤 3 n
+精辟 145 v
+精进 64 a
+精进勇猛 3 n
+精选 497 v
+精选品 3 n
+精选本 2 n
+精选者 3 n
+精选辑 3 n
+精选集 3 n
+精通 643 a
+精通业务 3 n
+精通于 3 n
+精通法律 3 n
+精邃 3 a
+精采 42 v
+精采秀发 3 i
+精采绝伦 3 i
+精量 3 n
+精金 3 n
+精金百炼 3 nz
+精金美玉 3 nz
+精金良玉 3 n
+精铸 2 n
+精链 3 n
+精锐 569 a
+精锐之师 3 n
+精锐部队 3 n
+精锻 3 n
+精陶 6 n
+精雕 9 n
+精雕细刻 31 i
+精雕细琢 20 i
+精雕细镂 2 i
+精饲料 15 n
+精馏 25 v
+精馏塔 3 n
+精髓 186 n
+精魂 269 n
+糁 63 zg
+糅 11 v
+糅合 48 v
+糅杂 3 v
+糇 17 g
+糈 4 g
+糊 565 a
+糊住 3 v
+糊刷 3 z
+糊剂 4 n
+糊化 7 v
+糊口 95 n
+糊口度日 3 i
+糊味 7 n
+糊墙 3 n
+糊墙纸 3 n
+糊弄 117 v
+糊弄人 3 i
+糊成 3 v
+糊料 5 n
+糊条带 3 n
+糊涂 946 a
+糊涂一时 18 i
+糊涂人 30 n
+糊涂帐 3 n
+糊涂思想 3 i
+糊涂虫 33 n
+糊涂蛋 10 n
+糊涂认识 3 i
+糊涂账 23 i
+糊状 43 n
+糊状物 2 n
+糊盒机 3 n
+糊着 3 v
+糊粉 3 n
+糊粉层 3 n
+糊粘 3 n
+糊精 14 n
+糊糊 59 a
+糊糊涂涂 15 z
+糊纸 3 n
+糊里糊涂 101 z
+糊鲁巴涂 3 n
+糌 3 n
+糌粑 27 n
+糍 5 n
+糍粑 786 n
+糕 2846 ng
+糕干 3 n
+糕点 148 n
+糕点店 2 n
+糕饼 56 n
+糕饼店 3 n
+糕饼类 3 n
+糖 3550 zg
+糖业 37 n
+糖丸 7 n
+糖人 8 n
+糖人儿 12 n
+糖价 7 n
+糖份 9 n
+糖作图 3 n
+糖元 7 n
+糖分 70 n
+糖包 2 n
+糖化 17 n
+糖化物 3 n
+糖化酶 3 n
+糖厂 44 n
+糖原 49 n
+糖原分解 3 n
+糖原生成 3 n
+糖商 3 n
+糖块 13 n
+糖基 3 n
+糖基化 3 n
+糖基磷脂 3 n
+糖尿 7 n
+糖尿病 571 n
+糖尿病人 26 n
+糖尿病足 3 n
+糖度 3 n
+糖异生 3 n
+糖弹 3 n
+糖房 3 n
+糖料 17 n
+糖果 276 n
+糖果厂 3 n
+糖果屋 3 n
+糖果店 18 n
+糖果盒 3 n
+糖果花生 3 n
+糖果费 3 n
+糖水 33 n
+糖汁 11 n
+糖浆 94 n
+糖浆剂 3 n
+糖测序 3 n
+糖渍 3 n
+糖烟酒 3 n
+糖瓜 4 n
+糖生成 3 n
+糖生物学 3 n
+糖用甜菜 3 v
+糖皮质 3 n
+糖盒 3 n
+糖稀 5 n
+糖税 3 n
+糖类 172 n
+糖粉 18 n
+糖精 58 n
+糖精钠 74 nz
+糖糕 3 n
+糖糖 3 n
+糖纸 7 n
+糖缀合物 3 v
+糖耐量 3 n
+糖肽 2 n
+糖肽酶 3 n
+糖肽键 3 n
+糖胺聚糖 3 n
+糖脂 3 n
+糖脉康 2 l
+糖腺苷 3 n
+糖膏 2 n
+糖舌蜜口 3 n
+糖色 257 n
+糖苷 39 n
+糖苷酶 3 n
+糖苷键 3 n
+糖茶 7 n
+糖萝卜 3 n
+糖萼 3 n
+糖葫芦 33 n
+糖蒜 3 n
+糖蛋白 3 n
+糖蜜 16 n
+糖衣 16 n
+糖衣宣传 3 nz
+糖衣机 3 n
+糖衣炮弹 32 n
+糖豆 18 n
+糖质酸盐 3 n
+糖酒 4 n
+糖酒会 3 n
+糖酒网 3 n
+糖酵解 3 n
+糖酶 2 n
+糖酸 3 n
+糖酸钙 2 nz
+糖醇 18 n
+糖醋 11 n
+糖醋排骨 3 l
+糖醋鱼 5 n
+糖醛 3 n
+糖醛酸 5 n
+糖锅 3 n
+糖霜 2 n
+糖食 7 n
+糖饴 3 n
+糖馅 6 n
+糗 11 zg
+糙 79 zg
+糙米 27 n
+糙米饭 11 n
+糙粮 3 n
+糙纸 3 n
+糜 156 zg
+糜二夫人 2 nr
+糜国币 2 nr
+糜夫人 22 nr
+糜子 31 nr
+糜棱岩 11 nr
+糜烂 178 v
+糜烂不堪 3 nr
+糜烂性 3 nr
+糜烂面 3 nr
+糜竺来 2 nr
+糜竺至 2 nr
+糜糜之音 3 v
+糜芳守 3 nr
+糜芳引 3 nr
+糜蛋白酶 2 nr
+糜费 16 v
+糜躯碎首 3 nr
+糜鹿 6 nr
+糟 807 v
+糟塌 3 v
+糟害 3 a
+糟得 3 v
+糟心 2 a
+糟改 3 v
+糟油 2 n
+糟渍 3 v
+糟渣 2 n
+糟烂 3 a
+糟粕 69 n
+糟糕 755 a
+糟糕透顶 3 z
+糟糠 4 v
+糟糠之妻 7 i
+糟老头子 3 n
+糟肉 3 n
+糟蛋 13 n
+糟行 3 v
+糟践 41 v
+糟踏 47 v
+糟蹋 222 v
+糟运 3 a
+糟透 3 v
+糟透了 3 n
+糟鄙 3 a
+糟鱼 6 n
+糠 259 n
+糠油 3 n
+糠疹 6 n
+糠皮 2 n
+糠秕 4 n
+糠花 3 n
+糠菜 6 n
+糠虾 3 n
+糠豆不赡 3 n
+糠醛 27 n
+糠醛树脂 3 n
+糠麸 4 n
+糣 5 zg
+糨 4 n
+糨子 3 n
+糨糊 25 n
+糯 236 n
+糯玉米 2 n
+糯稻 11 n
+糯稻根 3 n
+糯米 695 n
+糯米粉 271 n
+糯米糕 3 n
+糯米纸 3 n
+糯米酒 3 n
+糯米饭 535 n
+糯米鸡 3 n
+糲饭 3 vn
+糵 2 zg
+糸 13 zg
+糺 6 zg
+系 10196 v
+系上 3 n
+系主任 396 n
+系出名门 3 n
+系刊 3 n
+系列 3199 q
+系列丛书 3 n
+系列产品 3 n
+系列剧 8 n
+系列加工 3 n
+系列化 65 n
+系列台 3 n
+系列号 3 n
+系列号码 3 n
+系列地图 3 n
+系列学习 3 n
+系列小说 3 n
+系列性 4 n
+系列报道 3 n
+系列搜索 3 l
+系列机 8 n
+系列片 22 n
+系列讲座 3 n
+系列谈 3 n
+系列赛 112 n
+系囚 3 n
+系带 19 n
+系带分子 3 n
+系心 3 n
+系念 6 n
+系怀 3 n
+系恋 3 n
+系指 3 n
+系数 649 n
+系族 3 n
+系民 9 n
+系泊 11 n
+系泊刚臂 3 n
+系泊缆绳 3 n
+系泊羊角 3 nz
+系牢 3 n
+系由 3 n
+系留 13 v
+系紧 5 n
+系统 20602 n
+系统优化 4 n
+系统分析 70 l
+系统分析员 2 n
+系统分类 3 n
+系统化 120 n
+系统升级 20 n
+系统发育 3 l
+系统可靠性 4 n
+系统启动 4 l
+系统命令 12 n
+系统地 474 n
+系统学 31 n
+系统安全 11 nz
+系统实施 19 l
+系统对 77 l
+系统工程 224 n
+系统形 3 n
+系统性 140 n
+系统总线 3 n
+系统托盘 3 n
+系统抽样 3 vn
+系统控制 35 n
+系统故障 3 n
+系统文件 4 n
+系统日志 2 n
+系统核心 4 n
+系统模拟 3 v
+系统活动 10 l
+系统漏洞 3 n
+系统生成 3 n
+系统疾病 3 n
+系统监控 2 n
+系统盘 3 n
+系统目录 2 n
+系统管理 37 n
+系统管理员 13 n
+系统结构 38 n
+系统维护 12 n
+系统脱敏 3 nz
+系统论 63 n
+系统诊断 3 n
+系统试井 3 n
+系统误差 3 n
+系统调度 2 n
+系统调查 4 l
+系统资源 14 n
+系统软件 52 l
+系统还原 3 n
+系统部 27 n
+系统配 2 l
+系统配置 9 n
+系统重装 3 n
+系统阐述 3 vn
+系统集成 3 n
+系统页表 3 n
+系统验证 3 n
+系绳 3 n
+系综 3 n
+系综理论 3 n
+系缆 3 n
+系缚 2 v
+系而不食 3 l
+系舶 3 n
+系花 3 n
+系词 7 n
+系谱 21 n
+系谱学 3 n
+系谱法 3 n
+系辞 37 n
+系里 49 q
+系铃解铃 3 n
+系链 3 n
+系鞋带 3 n
+系风捕影 3 n
+系风捕景 3 n
+系馆 3 n
+系马埋轮 3 n
+紀 3 zg
+紁 2 zg
+紅 4 zg
+紆 2 zg
+紊 51 a
+紊乱 707 a
+紊乱如麻 3 v
+紊流 3 a
+納 2 zg
+紑 295 zg
+紒 47 zg
+紓 43 zg
+純 19 zg
+紕 76 zg
+紗 2 zg
+紙 6 zg
+級 8 zg
+紛 4 zg
+紜 3 zg
+紝 11651 zg
+紞 62 zg
+紟 590 zg
+素 4533 n
+素不来往 3 d
+素不相能 3 i
+素不相识 201 i
+素丝 3 n
+素丝羔羊 3 n
+素丝良马 3 i
+素交 3 v
+素什锦 3 ns
+素以 102 v
+素仰 3 n
+素体 29 n
+素养 354 n
+素净 26 a
+素博塔 4 n
+素口骂人 3 i
+素可泰 24 i
+素士 3 n
+素处理 2 n
+素女 3 n
+素女经 3 n
+素子 3 n
+素尔 3 nrt
+素席 7 n
+素常 9 d
+素引 3 v
+素心 93 n
+素志 43 n
+素性 27 n
+素愿 4 n
+素描 188 n
+素描法 3 n
+素描画 3 n
+素数 149 n
+素族 6 n
+素日 188 n
+素昧平生 15 i
+素昧生平 3 i
+素有 753 v
+素有人望 3 i
+素服 24 n
+素未谋面 3 i
+素朴 92 a
+素材 261 n
+素材库 3 n
+素材网 3 n
+素材资料 3 n
+素来 441 v
+素油 3 n
+素洁 4 a
+素淡 14 a
+素爱 3 v
+素白 21 n
+素称 114 n
+素端 3 n
+素笺 12 n
+素绢 9 n
+素缎 3 n
+素臣 5 n
+素色 31 n
+素菜 59 n
+素菜馆 3 n
+素行 3 n
+素衣 3 n
+素装 5 n
+素裹 3 n
+素负盛名 3 i
+素质 4263 n
+素质教育 3 n
+素车白马 3 n
+素还真 3 i
+素酒 16 n
+素门风流 3 n
+素问 57 n
+素闻 3 n
+素除子 3 n
+素隐行怪 3 i
+素雅 27 a
+素面 3 n
+素面朝天 3 i
+素食 62 n
+素食主义者 5 n
+素食店 3 n
+素食者 6 n
+素食面 3 n
+素餐 6 n
+素餐尸位 3 n
+素馨花 2 n
+素髎 3 v
+素鸡 5 n
+紡 69 zg
+索 1494 nr
+索下谷 2 nr
+索丙契 2 nr
+索中节 2 nr
+索乔海辰 2 nr
+索乙契 2 nr
+索书单 3 nr
+索书号 3 nr
+索二水 2 nr
+索亚 7 ns
+索价 7 n
+索价过高 3 l
+索伦伯爵 2 nr
+索伦兵 2 nr
+索伦托 2 nr
+索伦斯 3 nr
+索伦斯坦 6 ns
+索伦森 2 nr
+索佩朗 3 nr
+索债 9 n
+索债过高 3 n
+索偿 9 d
+索元礼 4 nr
+索公田 2 nr
+索六世 2 nr
+索具 6 n
+索内斯 3 nr
+索利斯 2 nr
+索利蒙 2 nr
+索十世 4 nr
+索南嘉 11 nr
+索南扎西 2 ns
+索县 7 ns
+索取 225 v
+索取到 3 l
+索取权 30 nr
+索古 2 ns
+索古一世 2 nrt
+索命 12 nz
+索回 12 nr
+索因卡 6 nr
+索图巴 2 nr
+索垂尽 2 nr
+索垢寻疵 3 i
+索多玛 3 nr
+索大人 4 nr
+索大哥 2 nr
+索夫斯 4 nr
+索夫雷 2 nr
+索奈特 2 nr
+索契 3 nr
+索姆库 2 nr
+索姆河 22 nr
+索子 50 nr
+索子结 2 nr
+索宁克 11 nr
+索尔 55 nr
+索尔仁 5 nr
+索尔克 2 nr
+索尔兹伯 3 ns
+索尔兹伯里 18 nrt
+索尔坦 2 nr
+索尔塔 3 nr
+索尔威 4 nr
+索尔斯 15 nr
+索尔海姆 2 nr
+索尔特 3 nr
+索尔福德 2 nr
+索尔纳 14 nr
+索尔维 19 nr
+索尔莫沃 5 nrt
+索尔蒂 2 nr
+索尔薇 4 nr
+索尔达 4 nr
+索尔邦 3 nr
+索尼 711 nr
+索尼亚 15 ns
+索尼克 3 nr
+索尼公司 87 nt
+索尼埃 2 nr
+索尼娅 6 nr
+索巴特 3 nr
+索布扎 2 nr
+索引 205 nr
+索弗里 2 nr
+索性 809 n
+索恩河 6 nr
+索战 6 nz
+索拉斯 6 nr
+索拉纳 16 nr
+索拉诺 7 nr
+索拉里 3 nr
+索拿 3 nr
+索挥进 2 nr
+索摩查 23 nr
+索斯比 6 nrt
+索斯盖 3 nr
+索斯纳 2 nr
+索日河 4 nr
+索朗罗布 3 nrt
+索木碧 2 nr
+索末菲 23 nr
+索格底 2 nr
+索格狄 8 nr
+索桥 6 nr
+索梅尔 4 nr
+索氏体 3 nr
+索求 5 v
+索波特 2 nr
+索洛夫 4 nr
+索洛拉 2 nr
+索洛维 2 nr
+索洛莫 15 nr
+索溪峪 8 nr
+索激飞 2 nr
+索然 39 d
+索然乏味 3 i
+索然寡味 2 i
+索然无味 34 i
+索特尔 2 nr
+索状 4 nz
+索状伸 2 nr
+索瑞姆 8 nr
+索福克 18 nr
+索福瑞 3 nr
+索秀丽 2 nr
+索科托 14 nr
+索科洛 3 nr
+索科洛夫 8 nrt
+索科特 3 nr
+索科特拉岛 8 nrt
+索索 40 nr
+索索地 18 nr
+索约河 2 nr
+索约特 2 nr
+索纳塔 3 nr
+索绕 2 v
+索绪尔 22 nr
+索维林 4 nr
+索罗斯 12 nr
+索罗河 3 nr
+索罗莫 5 nr
+索罗金 10 nr
+索罗门 2 ns
+索美塞 3 nr
+索莱达 6 nr
+索菲亚 20 nr
+索菲娅 11 nr
+索菲特 28 nr
+索薪团 2 nr
+索要 148 d
+索解 10 v
+索讨 7 v
+索诸水 2 nr
+索诺拉 2 nr
+索诺拉州 3 ns
+索诺木 11 nr
+索貌阅 2 nr
+索购 3 v
+索贿 40 v
+索贿受贿 3 v
+索赔 94 v
+索赔人 3 nz
+索赔时限 3 n
+索赔权 2 nz
+索赔案 2 n
+索超挥 3 nr
+索超箭 2 nr
+索超领 3 nr
+索还 9 v
+索还债款 3 n
+索迷离 2 nr
+索道 97 nr
+索郎泽 118 nr
+索酬 3 n
+索里亚 2 nr
+索金帛 2 nr
+索长林 12 nr
+索隐派 2 nr
+索隐行怪 3 i
+索雷克 2 nr
+索非亚 49 nr
+索韦托 4 nr
+索额 4 n
+索额图 190 nr
+索马利亚 3 ns
+索马里 229 nr
+索马里人 11 nrt
+紣 4 zg
+紤 20 zg
+紦 57 zg
+紧 5672 a
+紧促 3 a
+紧俏 61 a
+紧俏商品 3 n
+紧俏货 2 n
+紧元 3 n
+紧凑 183 a
+紧凑型 13 b
+紧压 3 v
+紧压茶 12 n
+紧咬 3 v
+紧固 12 a
+紧固件 14 n
+紧固带 3 n
+紧密 1591 a
+紧密团结 3 n
+紧密层 3 n
+紧密度 3 n
+紧密性 3 n
+紧密相联 3 l
+紧密结合 18 i
+紧密联系 3 n
+紧密距 3 n
+紧密连接 3 i
+紧密配合 3 i
+紧巴 6 a
+紧巴巴 9 z
+紧张 4790 a
+紧张不安 3 i
+紧张局势 3 i
+紧张度 22 n
+紧张性 29 n
+紧张感 3 n
+紧张状况 3 l
+紧张状态 3 l
+紧张症 8 i
+紧忙 3 d
+紧急 2600 a
+紧急事件 3 l
+紧急令 2 l
+紧急任务 3 l
+紧急会议 3 l
+紧急停车 5 i
+紧急制动 3 l
+紧急召开 3 n
+紧急启事 3 i
+紧急命令 3 l
+紧急处分 3 l
+紧急情况 6 l
+紧急情报 3 i
+紧急措施 3 n
+紧急断电 3 l
+紧急灯 3 l
+紧急状况 3 l
+紧急状态 608 l
+紧急状态法 2 l
+紧急行动 3 l
+紧急警报 3 l
+紧急通知 3 i
+紧急闸 3 n
+紧急集合 3 l
+紧打慢敲 3 l
+紧扣 39 v
+紧扼 3 l
+紧抓 18 v
+紧抱 16 v
+紧持 3 v
+紧挟 3 v
+紧挨 3 a
+紧接 50 ad
+紧接在 3 l
+紧接着 699 c
+紧接著 3 i
+紧握 104 v
+紧握住 3 n
+紧握拳头 3 n
+紧握着 3 n
+紧日子 2 l
+紧映射 3 i
+紧梆梆 3 z
+紧盯 3 z
+紧着 3 c
+紧箍咒 38 n
+紧紧 2190 d
+紧紧包裹 3 l
+紧紧围绕 3 l
+紧紧张张 4 l
+紧紧抓住 3 l
+紧绑 3 v
+紧绷 3 z
+紧绷着 3 z
+紧绷绷 14 z
+紧缚 3 vn
+紧缩 295 v
+紧缩性 12 n
+紧缩着 3 l
+紧缩节省 3 n
+紧缺 236 a
+紧肤水 2 n
+紧要 167 a
+紧要关头 243 l
+紧要地 3 l
+紧贴 191 a
+紧贴住 3 i
+紧贴在 3 l
+紧贴着 3 l
+紧跟 183 v
+紧跟形势 3 d
+紧跟着 136 l
+紧蹙 3 i
+紧身 81 v
+紧身女衫 3 n
+紧身服 3 l
+紧身胸衣 3 i
+紧身衣 14 i
+紧身衣裤 3 n
+紧身裤 3 n
+紧迫 550 d
+紧迫性 99 n
+紧迫感 134 n
+紧迫逼人 3 vn
+紧迫钉人 3 n
+紧追 42 v
+紧追不舍 39 i
+紧追权 8 l
+紧逼 81 v
+紧逼之下 3 i
+紧逼盯人 3 vn
+紧逼着 3 l
+紧邻 42 v
+紧邻在 3 l
+紧邻着 3 l
+紧锁 67 vn
+紧锣密鼓 110 i
+紧闭 1049 v
+紧随 176 v
+紧随其后 3 i
+紧靠 129 a
+紧靠在 3 v
+紧靠着 3 v
+紨 12 zg
+紩 42 zg
+紪 35 zg
+紫 5847 n
+紫丁花 3 nr
+紫丁香 20 nr
+紫乌乌 3 nr
+紫云 65 nr
+紫云山 2 nr
+紫云苗族布依族自治县 3 ns
+紫云英 17 nr
+紫云道 8 nr
+紫光 49 nr
+紫光拼音 3 n
+紫光阁 20 nr
+紫兰 3 ns
+紫喉 3 n
+紫堇 5 n
+紫外 143 b
+紫外光 28 nr
+紫外光线 3 n
+紫外线 291 n
+紫外遥感 3 l
+紫宸殿 3 nr
+紫尿酸胺 3 nz
+紫巍巍 3 nr
+紫川宁 3 nr
+紫川秀 3 nr
+紫府 2 n
+紫式 17 n
+紫式部 3 nr
+紫微斗数 3 n
+紫微星 3 nr
+紫文先 3 nr
+紫文冲 6 nr
+紫文刚 23 nr
+紫文初 2 nr
+紫文双 5 nr
+紫文可 25 nr
+紫文叹 13 nr
+紫文大 43 nr
+紫文定 6 nr
+紫文微 2 nr
+紫文心 45 nr
+紫文才 22 nr
+紫文显 2 nr
+紫文松 2 nr
+紫文正 8 nr
+紫文满 2 nr
+紫文灵 2 nr
+紫文真 3 nr
+紫文胜 3 nr
+紫文觉 5 nr
+紫文道 301 nr
+紫文长 13 nr
+紫文震 2 nr
+紫文飞 5 nr
+紫斑 3 n
+紫斑病 2 n
+紫星刚 2 nr
+紫星剑 2 nr
+紫晶 14 nr
+紫杉 25 nr
+紫杉醇 50 nr
+紫椴 10 n
+紫檀 63 nr
+紫檀木 37 nr
+紫檀碱 3 n
+紫毫 2 n
+紫气 37 n
+紫气东来 16 l
+紫水晶 13 nr
+紫江企业 2 nz
+紫河车 4 n
+紫灰 3 n
+紫灰色 2 n
+紫烟 12 n
+紫煌 25 ns
+紫玉兰 3 nr
+紫玉石 15 nr
+紫玉米 3 nr
+紫电清霜 3 nz
+紫癜 45 n
+紫百合 3 nr
+紫皮 2 n
+紫皮柳树 3 nr
+紫石英 3 nr
+紫砂 57 n
+紫砂壶 43 n
+紫砂陶 5 nr
+紫禁城 1758 nr
+紫穗槐 9 nr
+紫竹 37 nr
+紫竹园 3 nr
+紫竹林 3 nr
+紫竹桥 3 nr
+紫竹调 3 nr
+紫竹院 9 nr
+紫红 101 nr
+紫红色 131 nr
+紫纹 3 n
+紫绀 54 n
+紫绀型 5 nr
+紫绶金章 3 nr
+紫罗 10 nr
+紫罗兰 39 ns
+紫罗兰色 4 ns
+紫罗兰花 3 nz
+紫罗酮 3 nz
+紫胶 86 n
+紫胶虫 46 n
+紫色 621 n
+紫色土 3 n
+紫色花 3 n
+紫芒 4 n
+紫芝 12 nrt
+紫芝眉宇 3 n
+紫花 16 n
+紫花地丁 3 nz
+紫花苜蓿 6 l
+紫苏 30 ns
+紫苏叶 3 nr
+紫苏子 3 nr
+紫苏梗 3 n
+紫苏霉素 3 n
+紫茉莉 8 n
+紫茎 3 n
+紫荆 78 nr
+紫荆关 23 ns
+紫荆山 2 ns
+紫荆花 14 nr
+紫草 21 n
+紫草茸 3 nr
+紫药水 13 nr
+紫菀 6 nr
+紫菊花 4 nr
+紫菜 84 n
+紫菜汤 3 nr
+紫菜苔 3 nr
+紫萁贯众 3 nr
+紫萍 2 nr
+紫葡萄 3 n
+紫葳 4 nr
+紫葳科 3 n
+紫葳类 3 n
+紫蓝 3 nr
+紫蓝蓝 3 nr
+紫薇 33 nr
+紫薇星 3 nr
+紫藤 39 nr
+紫藤花 3 nr
+紫藤萝 3 nr
+紫蝴蝶 3 nr
+紫衣 9 n
+紫衫 19 n
+紫袍玉带 3 n
+紫褐色 7 n
+紫貂 37 n
+紫貂皮 8 nr
+紫贝齿 3 nr
+紫道友 6 nr
+紫酱 3 n
+紫金 116 n
+紫金县 2 nr
+紫金山 35 nr
+紫金山天文台 39 nt
+紫金港 3 nr
+紫金牛 8 nr
+紫金花 3 nr
+紫铜 13 nr
+紫铜管 3 n
+紫铜色 6 n
+紫阳 20 ns
+紫阳县 3 ns
+紫陌红尘 3 nr
+紫雨轩 3 nr
+紫雪 5 nr
+紫霉素 3 n
+紫风道 3 nr
+紫黑色 36 nr
+紬 43 zg
+紭 29 zg
+紮 54 zg
+累 2878 a
+累不累 3 v
+累世 3 v
+累事 3 v
+累人 22 v
+累代 3 v
+累倒 3 v
+累减 3 v
+累加 43 v
+累加器 4 n
+累加法 3 v
+累卵 16 v
+累卵之危 3 l
+累及 104 v
+累及他人 3 l
+累及无辜 3 l
+累土聚沙 3 ns
+累土至山 3 l
+累坏 3 v
+累块积苏 3 n
+累垮 12 v
+累增 3 v
+累增法 3 n
+累屋重架 3 n
+累岁 3 v
+累年 13 v
+累得 3 v
+累教不改 3 l
+累日经年 3 l
+累月经年 3 n
+累次 37 d
+累次三番 3 ns
+累次积分 3 l
+累死 115 v
+累死累活 11 l
+累活 22 vn
+累牍连篇 3 n
+累犯 24 v
+累瓦结绳 3 l
+累病 3 v
+累着 3 v
+累积 303 v
+累积下来 3 l
+累积产额 3 n
+累积到 3 l
+累积折耗 3 n
+累积盈亏 3 l
+累累 164 v
+累累如珠 3 l
+累累屡屡 3 l
+累累的 24 z
+累累硕果 3 ns
+累苏积块 3 n
+累西腓 7 ns
+累西腓市 3 vn
+累见不鲜 3 l
+累计 3457 v
+累计数 2 n
+累计法 3 n
+累计额 3 n
+累诫不戒 3 v
+累赘 111 an
+累足成步 3 l
+累进 29 v
+累进法 3 v
+累进税 14 v
+累退 3 v
+細 1194 zg
+紱 35 zg
+紲 3 zg
+紳 12 zg
+紴 3 zg
+紵 387 zg
+紶 581 zg
+絀 2 zg
+絁 5 zg
+絃 3 zg
+絃乐 3 z
+絃乐器 3 v
+絃声 3 z
+絃外之音 3 v
+絃柱 3 vn
+絃歌不辍 3 l
+絈 6 zg
+絋 3 zg
+絍 3 zg
+絏 2 zg
+結 7 zg
+絒 20 zg
+絕 2 zg
+絙 27 zg
+絛 9 zg
+絜 12 zg
+給 3 zg
+絧 3 zg
+絩 2 zg
+絪 2 zg
+絮 246 zg
+絮凝 4 v
+絮凝剂 4 n
+絮叨 26 z
+絮叨叨 3 z
+絮果兰因 3 n
+絮棉 3 n
+絮烦 3 v
+絮状 34 n
+絮状物 4 n
+絮球 3 n
+絮絮 3 n
+絮絮叨叨 42 z
+絮聒 9 v
+絮语 19 n
+絮说 3 v
+絯 2 zg
+統 3 zg
+絲 2 zg
+絶 2 zg
+絷 7 g
+絺 5 zg
+絾 391 zg
+綃 2 zg
+綅 81 zg
+綆 37 zg
+綇 151 zg
+綈 47 zg
+綉 5 zg
+綊 22 zg
+綋 642 zg
+綍 99 zg
+綎 64 zg
+綏 11 zg
+綑 62 zg
+綒 4 zg
+經 8 zg
+綔 331 zg
+綖 16 zg
+綘 1408 zg
+綝 73 zg
+綦 15 nr
+綦毋怀 2 nr
+綦母怀 2 nr
+綦江 19 ns
+綦江县 6 ns
+綦溪利跂 3 ns
+維 2 zg
+綮 5 zg
+綱 2 zg
+網 14 zg
+綵 7 zg
+綷菜 3 v
+緐 3 zg
+緗 63 zg
+線 173 zg
+緛 16 zg
+緜 3 zg
+緝 23 zg
+緞 27 zg
+緟 69 zg
+緡 12 zg
+緢 276 zg
+緣 197 zg
+緤 8 zg
+緥 57 zg
+緦 3 zg
+編 63 zg
+緩 12 zg
+緪 3 zg
+緫 6 zg
+緬 15 zg
+緭 9 zg
+緰 215 zg
+緱 677 zg
+緲 5 zg
+緳 34 zg
+練 3 zg
+緵 21 zg
+緶 7 zg
+緷 43 zg
+緸 19 zg
+緹 18 zg
+縉 2 zg
+縊 130 zg
+縌 3 zg
+縍 22 zg
+縎 43 zg
+縕袍 3 n
+縖 7 zg
+縗墨 3 v
+縠 6 zg
+縢 5 zg
+縦 8 zg
+縧 27 zg
+縯 30 zg
+縴 3 zg
+縴夫 3 v
+縹 51 zg
+縺 44 zg
+縺衣机 3 nz
+縻 59 g
+縼 17 zg
+總 5 zg
+績 457 zg
+縿 6 zg
+繀 758 zg
+繁 1193 v
+繁中 3 v
+繁丽 3 a
+繁乱 3 a
+繁体 20 a
+繁体中文 3 n
+繁体包 3 n
+繁体字 395 n
+繁体版 3 v
+繁冗 9 a
+繁分数 3 n
+繁刑重赋 3 n
+繁剧 3 v
+繁剧纷扰 3 l
+繁化 3 v
+繁华 828 a
+繁华世界 3 n
+繁华似锦 5 i
+繁华区 2 ns
+繁华损枝 3 n
+繁华胜地 3 n
+繁华都市 3 ns
+繁博 3 a
+繁复 228 v
+繁多 637 a
+繁密 32 a
+繁峙 10 v
+繁峙县 14 ns
+繁峰 3 n
+繁峰县 3 ns
+繁弦急管 3 i
+繁征博引 3 i
+繁忙 782 a
+繁忙时节 3 i
+繁文 3 n
+繁文末节 3 i
+繁文缛礼 3 i
+繁文缛节 29 i
+繁昌 4 ns
+繁昌县 3 ns
+繁星 89 n
+繁星点点 3 n
+繁杂 130 a
+繁杂性 3 n
+繁枝细节 3 i
+繁枝茂叶 3 n
+繁殖 3026 v
+繁殖关 3 n
+繁殖力 295 n
+繁殖地 14 n
+繁殖场 4 n
+繁殖期 62 n
+繁殖温室 3 n
+繁殖率 25 n
+繁殖系数 3 n
+繁殖行为 3 n
+繁琐 561 a
+繁琐哲学 3 nz
+繁盛 321 a
+繁碎 3 v
+繁礼多仪 3 i
+繁简 3 v
+繁简体 3 i
+繁简共容 3 i
+繁简通 3 i
+繁细 3 a
+繁缛 28 a
+繁育 153 v
+繁育场 3 n
+繁芜 2 a
+繁花 43 n
+繁花似锦 31 i
+繁苛 3 a
+繁茂 399 a
+繁荣 2081 a
+繁荣党 9 n
+繁荣兴旺 6 i
+繁荣富强 94 i
+繁荣市场 3 n
+繁荣昌盛 55 l
+繁荣景象 3 n
+繁荣期 21 n
+繁荣经济 3 n
+繁衍 562 v
+繁衍生息 3 i
+繁重 568 a
+繁难 15 a
+繁露 14 v
+繁饰 3 v
+繂 9 zg
+繃 597 zg
+繄 5 zg
+繆 7 zg
+繇 64 p
+繇役繁兴 3 nr
+繈 9 zg
+繉 7 zg
+繊 26 zg
+繋 18 zg
+繌 14 zg
+繍 84 zg
+繎 60 zg
+繐 3 zg
+繑 8 zg
+繓 6 zg
+織 256 zg
+繕 787 zg
+繖 1574 zg
+繘 268 zg
+繙 104 zg
+繚 110 zg
+繛 192 zg
+繜 4 zg
+繝 23 zg
+繬 401 zg
+繯 34 zg
+繲 11 zg
+繸 2 zg
+繼 4 zg
+纂 207 g
+纂修 75 v
+纂夺 3 v
+纂辑 3 v
+纇 21 zg
+續 3 zg
+纍囚 3 v
+纍纍 3 z
+纎 38 zg
+纔 10 zg
+纘 134 zg
+纛 104 zg
+纟 5 zg
+纠 311 zg
+纠举 3 v
+纠众 3 n
+纠偏 11 v
+纠劾 3 v
+纠合 48 v
+纠合之众 3 n
+纠察 58 v
+纠察人员 3 n
+纠察员 3 n
+纠察队 72 n
+纠弹 3 n
+纠扯 3 v
+纠正 1509 v
+纠正法 3 n
+纠正错误 3 n
+纠章 2 n
+纠纠武夫 3 v
+纠纷 1191 n
+纠纷个 3 n
+纠纷案 10 n
+纠纷案件 3 n
+纠结 74 v
+纠缠 637 v
+纠缠不清 3 z
+纠葛 242 n
+纠错 48 v
+纠错码 11 n
+纠集 198 v
+纠风 37 n
+纠风办 8 v
+纡 55 g
+纡佩金紫 3 ns
+纡回 3 i
+纡子 3 i
+纡尊降贵 3 i
+纡朱怀金 3 i
+纡朱拖紫 3 i
+纡朱曳紫 3 i
+纡金曳紫 3 i
+纡青佩紫 3 ns
+纡青拖紫 3 i
+红 14915 a
+红一团 2 nz
+红一方面军 128 nt
+红一白 2 nr
+红七军 6 nr
+红三兵 2 nr
+红三军 33 nr
+红三军团 24 nt
+红三叶 6 nr
+红三色 3 nr
+红三连 15 nr
+红不棱登 3 i
+红与黑 20 nr
+红专 3 nr
+红专村 3 nr
+红丝 43 n
+红丝巾 3 nr
+红丝暗系 3 n
+红丝满 2 nr
+红丝石 2 nr
+红中白板 3 n
+红丸 3 n
+红丸投 3 i
+红丹 2 nr
+红丹丹 3 nr
+红丹漆 3 nz
+红乎乎 2 z
+红了眼 3 l
+红了脸 3 l
+红二军团 31 nt
+红二十五军 26 nt
+红二方面军 43 nt
+红云蓝 3 nr
+红云飞 2 nr
+红五军 24 nr
+红五军团 2 nt
+红五星 6 nr
+红五月 3 nr
+红人 68 n
+红俏鬼 5 nr
+红儿你 2 nr
+红儿扶 4 nr
+红儿真 2 nr
+红儿端 2 nr
+红光 258 nr
+红光光 3 nr
+红光满面 28 l
+红光照 4 nr
+红克伦 2 nr
+红党 11 n
+红八军 6 nr
+红六军 7 nr
+红六军团 79 nt
+红其拉甫 5 nr
+红军 2819 n
+红军前敌总指挥部 7 nt
+红军团 3 nt
+红军大学 9 nt
+红军总政治部 6 nt
+红冠 3 n
+红净 3 nr
+红利 204 nz
+红包 171 n
+红包儿 3 nr
+红十一团 3 nz
+红十字 83 nz
+红十字会 133 nz
+红十字国际委员会 4 nt
+红单子 3 nr
+红卫兵 285 nr
+红卫河 2 nr
+红卫片 3 n
+红原 4 ns
+红原县 5 ns
+红叉叉 2 nr
+红双喜 19 nr
+红双子 2 nr
+红发 3 nz
+红发女郎 3 n
+红变紫 2 nr
+红口白牙 8 ns
+红古区 3 ns
+红史 2 n
+红叶 90 n
+红叶村 3 nr
+红叶树 3 nr
+红叶桃 3 nr
+红叶谷 3 nr
+红叶题诗 3 n
+红名村 3 nr
+红和翠 3 nr
+红唇 16 n
+红啤酒 3 nt
+红喷喷 4 z
+红嘴鸥 2 nr
+红四军 114 nr
+红四方面军 161 nt
+红园 2 n
+红土 522 n
+红土地 19 n
+红土场 2 n
+红地毯 3 nz
+红场 33 n
+红基会 3 nt
+红堡 3 nr
+红塔 72 nr
+红塔区 3 ns
+红塔山 18 nr
+红塔队 3 nr
+红塔集团 5 nt
+红墙 1001 n
+红墨水 7 nr
+红壤 133 n
+红壹佰 3 nr
+红外 669 nr
+红外信号 2 nz
+红外光 73 nr
+红外光谱仪 6 nz
+红外制导 3 n
+红外扫描 3 n
+红外技术 10 n
+红外接口 3 n
+红外摄像机 2 n
+红外灯 3 n
+红外热 2 l
+红外线 176 n
+红外线灯 3 n
+红外键合 3 n
+红大戟 3 nr
+红太阳 77 nr
+红太阳集团 7 nt
+红头 34 n
+红头丽 2 nr
+红头发 3 nz
+红头文件 35 n
+红头绳 3 n
+红头草 3 n
+红头蝇 3 n
+红契 3 nr
+红女 3 n
+红妆 53 n
+红妆素 3 n
+红姐姐 9 nr
+红姑 3 n
+红姿娇 3 nr
+红娇艳 2 nr
+红娘 182 n
+红娘子 665 nr
+红媒 3 n
+红子鸡 3 nr
+红字 3 nz
+红学 59 n
+红学会 3 nt
+红学家 8 n
+红学界 4 n
+红孩儿 4 n
+红安 273 nz
+红安县 265 ns
+红宝 2 nz
+红宝书 32 nr
+红宝石 403 nr
+红富士 17 nr
+红寺堡 2 nr
+红封子 2 nr
+红小兵 10 nr
+红小豆 15 nr
+红小鬼 3 nr
+红少津 4 nr
+红少苔 22 nr
+红尖椒 3 n
+红尘 101 n
+红层 2 n
+红山 44 ns
+红山区 3 ns
+红山口 3 ns
+红岗区 3 n
+红岩村 7 nr
+红岩革命纪念馆 3 nt
+红崖 2 n
+红崖子 3 nr
+红崖山 2 nr
+红巨星 14 nr
+红巾 22 n
+红巾军 90 nr
+红布 89 nr
+红布条 2 n
+红帅贤 2 nr
+红带 3 n
+红带子 3 n
+红帽 17 n
+红帽子 8 nr
+红底 3 n
+红底白字 3 n
+红庙子 3 nr
+红庙李村 6 nr
+红开光 2 nr
+红弹子 3 n
+红形素 3 n
+红彤彤 38 z
+红影 5 n
+红影闪 2 nr
+红得发紫 26 nr
+红心 41 n
+红心十三 3 nr
+红心靶 3 nr
+红情 23 n
+红情绿意 3 n
+红愁绿惨 3 nr
+红房子 3 n
+红扑扑 51 z
+红拂女 2 nr
+红掌 3 n
+红教 4 nz
+红斑 107 n
+红斑毒素 3 n
+红斑狼疮 38 n
+红新月 2 nr
+红新月会 18 nz
+红方 10 n
+红旗 1052 nr
+红旗区 3 nt
+红旗手 26 nr
+红旗报捷 3 nz
+红旗招展 15 nr
+红旗渠 8 nr
+红旗竞赛 3 nr
+红旗街 3 nr
+红旗谱 14 nr
+红旗路 3 nr
+红旗车 3 nt
+红旗轿车 3 n
+红旗飘飘 3 nr
+红日 94 n
+红日三竿 3 nr
+红日平 3 nz
+红日西 5 nr
+红明红 2 nr
+红星 144 nz
+红星区 3 n
+红星御杯 2 n
+红星村 2 nr
+红星路 3 nr
+红星集团 4 nt
+红晕 233 n
+红景天 4 nr
+红暴 2 n
+红曲 24 n
+红曲米 32 nr
+红曲红 48 z
+红木 161 n
+红木家具 3 l
+红权 4 n
+红杉 72 nr
+红杉树 3 nr
+红杏出墙 16 n
+红杠 3 n
+红松 67 nr
+红松林 2 nr
+红松洼 3 nr
+红极一时 26 l
+红果 16 n
+红枣 138 n
+红枣汤 3 nr
+红枫湖 4 nr
+红柱石 4 nr
+红柱红 3 nr
+红柳 60 nr
+红柳滩 2 nr
+红栀果 2 nr
+红树 56 n
+红树林 140 nr
+红树湾 3 nr
+红样 3 n
+红根草 3 nz
+红格 4 n
+红格尔 4 nr
+红格温泉 2 nz
+红桃 26 n
+红框 3 n
+红案 3 n
+红桥 9 nr
+红桥区 8 nt
+红桧林 2 nr
+红梅 189 nr
+红梅赞 3 nr
+红梦楼 2 nr
+红棉 58 n
+红棕色 3 nr
+红椒 3 n
+红楼 491 n
+红楼梦 334 nz
+红榜 3 n
+红模子 3 nr
+红樱枪 4 nr
+红樱桃 3 nr
+红橙 3 nr
+红殷殷 3 nr
+红毒 3 nz
+红比霉素 3 n
+红毛 2 n
+红毛七 3 nr
+红毛丹 3 nr
+红毛儿 2 nr
+红毛兵 13 nr
+红毛国 3 nr
+红毛城 3 nr
+红毛尸 15 nr
+红毛绿 2 nr
+红毛鬼 25 nr
+红水河 45 nr
+红汞 3 nz
+红河 76 ns
+红河三角 3 nz
+红河县 3 ns
+红河口 3 ns
+红河哈尼族彝族自治州 16 ns
+红河岸 3 nr
+红河州 8 ns
+红河谷 7 nr
+红油 12 n
+红泥 2 n
+红泥巴 3 nr
+红海 310 ns
+红海岸 2 nr
+红海洋 5 ns
+红海湾 3 ns
+红润 193 n
+红渠生 2 nr
+红潮 32 nr
+红澄澄 6 nr
+红火 309 n
+红火蚁 3 n
+红灯 193 n
+红灯区 60 n
+红灯户 3 n
+红灯笼 22 n
+红灯记 22 nz
+红灯高照 3 nr
+红灵丹 2 nr
+红灶鸟 6 nr
+红灿灿 4 nr
+红点 3 n
+红点颏 3 n
+红烛 117 n
+红烟 2 n
+红烧 848 n
+红烧肉 58 n
+红烧鱼 3 n
+红热 3 n
+红焖鸡 3 vn
+红煤 3 n
+红燐 3 z
+红片 3 n
+红牌 150 n
+红牛 32 nz
+红牛杯 3 nz
+红牡丹 3 nr
+红狐 6 nz
+红狐狸 3 nr
+红狮 2 nz
+红玉笑 5 nr
+红玛瑙 9 n
+红玫瑰 13 nr
+红珊瑚 14 nz
+红班 3 n
+红球 9 n
+红瓦店 75 ns
+红瓦白 2 nr
+红瓶 3 n
+红生 8 n
+红男绿女 8 n
+红番 3 ns
+红番区 3 n
+红疹 3 n
+红痢 3 n
+红白 5 nr
+红白事 6 n
+红白分明 3 n
+红白喜 4 nr
+红白喜事 20 n
+红白机 3 n
+红的铁 3 n
+红皮 25 n
+红皮书 3 nr
+红皮云 2 nr
+红盖头 3 n
+红盘 4 n
+红盟 2 n
+红相公 2 nr
+红盾网 3 nz
+红眼 313 n
+红眼病 10 n
+红着眼睛 3 n
+红着脸 3 l
+红矾 3 n
+红砂 5 n
+红砂岩 12 n
+红砖 33 n
+红砖墙 3 nr
+红碎茶 6 nr
+红磨坊 3 nz
+红磷 16 nz
+红票 2 n
+红种人 3 n
+红移量 3 nr
+红笔 3 n
+红筹 7 j
+红筹股 4 nr
+红管 3 n
+红管药 3 n
+红箭 3 n
+红粉 45 nz
+红粉佳人 3 nr
+红粉知己 3 i
+红粉青楼 3 nr
+红糖 300 n
+红素 3 n
+红紫乱末 3 i
+红紫乱朱 3 n
+红红 15 nr
+红红亮 2 nr
+红红毛 4 nr
+红红火火 62 l
+红红白 8 nr
+红红的 113 z
+红红绿绿 7 z
+红红绿绿的 22 z
+红纱 7 n
+红纸 3 nz
+红线 150 n
+红线女 4 n
+红细胞 384 n
+红绳不足 3 l
+红绳拴 2 nr
+红绳系足 3 nr
+红绸 243 n
+红绸舞 3 l
+红绿 23 nr
+红绿灯 22 nr
+红绿色盲 3 n
+红绿蓝 3 nr
+红绿锦 6 nr
+红缨 14 nr
+红缨枪 25 nr
+红缨长 2 nr
+红罗伞 2 nr
+红罗宝 2 nr
+红肖梨 2 nr
+红肿 209 n
+红胡子 3 nr
+红脉弦 2 nr
+红脸 134 n
+红腐贯朽 3 i
+红腹锦鸡 13 i
+红腾腾 3 nr
+红船 3 n
+红色 4243 n
+红色中华 3 nz
+红色光 8 nr
+红色弱 3 l
+红色摇滚 3 l
+红色政权 3 n
+红色旅游 3 nz
+红色盲 3 n
+红色素 13 n
+红色警戒 3 n
+红色警报 3 n
+红色风暴 3 n
+红色高棉 23 ns
+红艳 14 nr
+红艳艳 45 nr
+红芒 2 n
+红花 708 n
+红花岗区 3 n
+红花村 2 nr
+红花油 2 n
+红花籽油 3 n
+红花绿叶 8 n
+红花草 2 nr
+红花菜豆 3 n
+红苔薄 2 nr
+红苔黄 7 nr
+红苕 25 n
+红苗正 129 nr
+红茵兰 2 ns
+红茶 119 nr
+红茶菌 3 nr
+红茶馆 3 nr
+红药 13 n
+红药子 3 nr
+红药子即 3 i
+红药水 21 nr
+红莓 3 n
+红莲 267 nr
+红莲寺 4 nr
+红莲白 2 nr
+红菱 4 nz
+红萍 4 nr
+红萝卜 18 n
+红营子 2 n
+红葡萄 2 n
+红葡萄藤 3 n
+红葡萄酒 27 n
+红蒙蒙 2 nr
+红蓝 5 nr
+红蓝宝石 3 nr
+红蓝白 2 nr
+红蓝铅笔 6 n
+红薯 473 n
+红薯面 3 n
+红藤 2 nr
+红藻 48 nr
+红虫 3 n
+红蚂蚁 3 l
+红蛋 7 n
+红蜘蛛 12 n
+红蜻蜓 3 n
+红螺 14 n
+红螺寺 3 nr
+红血 3 n
+红血丝 3 n
+红血球 10 n
+红衣 169 n
+红衣主教 49 nz
+红衣坊 3 n
+红衣教 3 nz
+红衣服 3 n
+红衣裳 3 n
+红衫 10 n
+红衫儿 90 nr
+红衰翠减 3 l
+红袍 116 n
+红袖 141 n
+红袖招 3 nr
+红袖添香 3 i
+红袖章 9 nr
+红袜子 3 n
+红装 8 n
+红装素裹 3 n
+红裙 6 n
+红褐 19 n
+红褐色 76 n
+红角 17 n
+红警 3 n
+红豆 63 n
+红豆冰 3 nr
+红豆女 3 n
+红豆杉 71 nz
+红豆杉醇 3 n
+红豆汤 3 nz
+红豆相思 3 nr
+红豆蔻 3 n
+红豆词 3 n
+红豆越桔 3 nr
+红豆集团 5 nt
+红豆饼 3 n
+红货 3 n
+红赤赤 3 nr
+红转青 2 nr
+红辣椒 4 nr
+红边 3 n
+红边儿 3 nr
+红运 2 n
+红运当头 3 nz
+红透 3 nz
+红通通 15 nt
+红遍 12 a
+红酒 75 n
+红酥手 3 n
+红醋栗 3 n
+红金龙 3 nr
+红铃虫 5 n
+红铅 3 nz
+红铅笔画 3 n
+红铜 24 n
+红铜矿 3 nz
+红锌矿 3 n
+红门 3 n
+红队 6 n
+红阳 3 ns
+红雀 3 n
+红霉素 46 n
+红霞 178 nr
+红霞呵 2 nr
+红霞姐 6 nr
+红鞋 3 n
+红鞋子 3 n
+红顶 12 n
+红顶商人 3 n
+红领巾 60 nr
+红领章 3 nr
+红颜 116 nr
+红颜色 3 nr
+红颜薄命 8 i
+红飞翠舞 3 nr
+红餐 3 n
+红香圃 7 nr
+红香绿 3 nr
+红马奔 3 nr
+红马牵 2 nr
+红马甲 3 nr
+红马远 2 nr
+红骨髓 5 n
+红高梁 3 nr
+红高粱 14 nr
+红魔 13 n
+红鱼 11 n
+红鸡 3 n
+红鸾星动 3 nr
+红鹳 7 n
+红麻 28 n
+红黄牌 4 n
+红黄紫 3 nr
+红黄绿 3 nr
+红黄色 7 n
+红黄蓝 8 nr
+红黄青 2 nr
+红黑榜 3 nr
+红鼓 3 n
+红鼻子 3 n
+红龙 3 nz
+纣 224 nrt
+纣王 73 nrt
+纤 403 n
+纤丝 3 n
+纤丝鸟 3 n
+纤人 3 n
+纤介 3 n
+纤介之失 3 l
+纤夫 296 n
+纤妍 3 a
+纤密 3 n
+纤小 15 n
+纤尘 7 n
+纤尘不染 16 i
+纤巧 21 n
+纤度 9 n
+纤弱 33 a
+纤微 3 a
+纤悉 3 v
+纤悉不遗 3 v
+纤悉无遗 3 nr
+纤手 32 n
+纤指 3 n
+纤柔 7 a
+纤毛 95 n
+纤毛虫 12 n
+纤毫 12 n
+纤毫毕见 3 i
+纤瘦 9 a
+纤秀 3 a
+纤纤 3 n
+纤纤玉手 3 l
+纤细 196 a
+纤绳 10 n
+纤维 1879 n
+纤维光学 3 l
+纤维制品 3 n
+纤维化 87 n
+纤维工业 3 n
+纤维支数 3 n
+纤维材料 3 n
+纤维板 558 n
+纤维植物 12 l
+纤维状 3 n
+纤维瘤 3 l
+纤维管 3 n
+纤维素 564 n
+纤维素酯 3 n
+纤维素酶 4 l
+纤维组织 3 l
+纤维细胞 3 n
+纤维结构 3 n
+纤维网 6 n
+纤维蛋原 3 n
+纤维蛋白 36 l
+纤维长度 3 n
+纤腰 3 n
+纤芥之疾 3 l
+纤软 3 a
+纤长 15 n
+纥 32 x
+约 27535 d
+约一亿 3 nr
+约一斤肉 3 i
+约一约 3 d
+约书亚 2 nz
+约人 3 nrt
+约什 3 nrt
+约会 329 n
+约伯 3 ns
+约值 3 n
+约克 97 nrt
+约克城 3 nrt
+约克夏 4 nrt
+约克敦 2 ns
+约克角 9 nrt
+约克郡 34 nr
+约分法 3 n
+约化中心 3 nz
+约化概形 3 i
+约化纬垂 3 n
+约化质量 3 n
+约合 186 vn
+约吉 7 nrt
+约基 2 nrt
+约堡 4 nrt
+约夫 14 nrt
+约定 820 v
+约定俗成 49 i
+约定成俗 3 i
+约尔 12 nrt
+约尔丹斯 3 nz
+约己爱民 3 nr
+约摸 120 v
+约数 27 n
+约斯特 6 nrt
+约旦 303 d
+约旦人 5 i
+约旦哈希姆王国 6 ns
+约旦河 130 ns
+约旦河西岸 19 ns
+约旦空军 3 nt
+约晤 3 v
+约期 23 vn
+约束 1132 vn
+约束则 2 n
+约束力 138 n
+约束性 11 n
+约束推理 3 n
+约束方程 6 n
+约束条件 37 n
+约束矩阵 3 nr
+约束运动 3 n
+约法 147 vn
+约法三章 48 i
+约瑟 23 nrt
+约瑟夫 144 nrt
+约瑟夫效应 4 n
+约瑟夫森 3 nrt
+约瑟芬 3 nrt
+约略 117 n
+约略为 3 n
+约略是 3 n
+约稿 21 n
+约稿函 3 n
+约等于 3 v
+约简 3 n
+约简成 3 nr
+约维奇 9 nrt
+约翰 503 nrt
+约翰内斯堡 105 nrt
+约翰尼 3 nrt
+约翰尼斯 3 nrt
+约翰斯 18 nrt
+约翰斯顿 10 nrt
+约翰松 5 nrt
+约翰森 7 nrt
+约翰生 3 nrt
+约翰福音 3 nz
+约翰逊 252 nrt
+约翰霍普金斯 2 nrt
+约莫 296 nrt
+约见 55 v
+约言 6 n
+约计 13 vn
+约请 41 v
+约谈 3 vn
+约阿希姆 5 nrt
+约集 3 v
+约鲁巴 3 nrt
+约鲁巴人 11 nrt
+级 9853 q
+级任 3 n
+级任务 10 n
+级任导师 3 n
+级任老师 3 n
+级会 3 n
+级低 3 n
+级别 1161 n
+级别管辖 3 n
+级差 447 n
+级差地租 3 n
+级数 267 n
+级数解 3 n
+级新生 3 n
+级服务器 5 n
+级格 3 n
+级次 7 n
+级用户 5 n
+级联 21 n
+级薄分浅 3 n
+级计算机 2 n
+级距 3 n
+级进杂交 3 n
+级长 3 n
+纨 506 n
+纨扇 8 n
+纨绔 16 n
+纨绔子弟 30 i
+纨袴子弟 4 l
+纨袴膏粱 3 l
+纨裤 3 n
+纨裤子弟 4 n
+纩 9 g
+纪 806 nr
+纪上新 4 nr
+纪上起 2 v
+纪中新 6 nr
+纪事 209 n
+纪事报 3 n
+纪云卿 16 nr
+纪传体 98 nr
+纪传志 2 nr
+纪伯伦 7 nr
+纪僧真 3 nr
+纪元 77 n
+纪元前 3 nr
+纪元后 3 nr
+纪全新 2 j
+纪冰川 42 nr
+纪分 2 n
+纪前 2 v
+纪功坊 2 n
+纪功碑 5 n
+纪功铁 2 n
+纪千千 3 nr
+纪历 3 n
+纪及 93 v
+纪及马 2 nr
+纪古新 2 nr
+纪可观 2 nr
+纪君祥 3 nr
+纪和志 3 nr
+纪和泥 4 nr
+纪嘉伦 2 nr
+纪国 2 n
+纪大 4 j
+纪大椿 8 nr
+纪大海 2 nr
+纪大论 2 nr
+纪太后 5 nr
+纪女侠 6 nr
+纪始新 4 nr
+纪姑娘 17 nr
+纪委 282 j
+纪委书记 3 n
+纪嫣然 3 nr
+纪子 14 n
+纪实 170 n
+纪实小说 3 l
+纪实性 7 n
+纪实文学 3 l
+纪尧姆 4 nr
+纪尽善 2 nr
+纪山之 2 nr
+纪山北 2 nr
+纪工委 3 j
+纪师叔 2 nr
+纪年 281 n
+纪录 1232 n
+纪录下来 3 l
+纪录片 205 n
+纪录片儿 3 n
+纪律 1223 n
+纪律严明 3 nr
+纪律作风 3 nr
+纪律处分 3 n
+纪律性 40 nr
+纪律检查 3 nr
+纪德舰 12 nr
+纪念 2681 n
+纪念亭 9 nr
+纪念会 12 n
+纪念册 6 n
+纪念刊 3 n
+纪念卡 3 nr
+纪念周 3 nr
+纪念品 424 n
+纪念地 80 n
+纪念堂 70 nr
+纪念塔 46 nr
+纪念大会 3 n
+纪念奖 11 n
+纪念室 130 n
+纪念封 4 nr
+纪念展 130 nr
+纪念币 34 n
+纪念性 28 n
+纪念日 266 n
+纪念林 3 nr
+纪念柱 12 nr
+纪念活动 3 n
+纪念照 8 n
+纪念版 3 n
+纪念牌 2 n
+纪念物 15 n
+纪念碑 238 n
+纪念碑式 8 b
+纪念祠 3 nr
+纪念章 37 nr
+纪念表 3 n
+纪念词 3 n
+纪念邮票 23 n
+纪念馆 604 n
+纪思道 2 nr
+纪政 4 n
+纪效 5 n
+纪效新 15 nr
+纪敏佳 7 nr
+纪日 5 n
+纪日法 3 nr
+纪时 10 n
+纪时制 5 nr
+纪昀 11 nr
+纪晓岚 24 nr
+纪晓芙 3 nr
+纪更新 4 nr
+纪末至 2 nr
+纪极盛 2 nr
+纪检 150 j
+纪检员 3 n
+纪检委 57 j
+纪检监察 3 nr
+纪检组 144 j
+纪泰山 2 nr
+纪海相 2 nr
+纪渐新 3 nr
+纪游 10 n
+纪生物 2 n
+纪用 3 n
+纪略 8 n
+纪登奎 5 nr
+纪监委 3 j
+纪程 12 n
+纪空手 3 n
+纪红层 5 n
+纪纲 38 nr
+纪纲人伦 3 nr
+纪纲人论 3 n
+纪群之交 3 l
+纪者劾 2 nr
+纪育沣 2 nr
+纪行 21 j
+纪要 391 v
+纪述其 2 nr
+纪遗 2 n
+纪闻 19 n
+纪陆生 2 nr
+纪限仪 5 n
+纪风成 2 nr
+纫 74 g
+纫针 3 nz
+纬 580 n
+纬书 12 n
+纬地经天 3 n
+纬密 3 n
+纬度 403 n
+纬武经文 3 n
+纬纱 61 n
+纬线 74 n
+纭 239 zg
+纮 21 zg
+纯 2375 a
+纯一 43 b
+纯一不杂 3 i
+纯中文 3 nz
+纯中药 7 n
+纯亚麻 3 n
+纯仔 3 n
+纯净 271 a
+纯净度 3 n
+纯净水 22 n
+纯净界 3 n
+纯利 45 a
+纯利润 52 n
+纯化 50 v
+纯厚 3 a
+纯合子 3 n
+纯天然 28 b
+纯如 3 v
+纯小数 3 n
+纯属 824 n
+纯属偶然 3 n
+纯属巧合 3 n
+纯属捏造 3 vn
+纯属虚构 3 n
+纯属骗局 3 n
+纯平 10 n
+纯度 130 n
+纯律 3 n
+纯情 25 n
+纯情房东 3 n
+纯手工 3 n
+纯收入 926 n
+纯收益 3 n
+纯数学 10 n
+纯文字 3 nz
+纯文学 16 n
+纯朴 127 a
+纯林 3 n
+纯棉 13 n
+纯棉布 3 n
+纯棉纱 3 n
+纯正 407 d
+纯正无邪 3 i
+纯毛 8 n
+纯氧 10 b
+纯水 29 n
+纯水机 3 n
+纯洁 358 a
+纯洁性 76 n
+纯洁恶 3 n
+纯洁高尚 3 n
+纯清 3 b
+纯然 3 d
+纯熟 231 a
+纯爱 3 a
+纯牛奶 3 n
+纯理论 3 n
+纯白 296 a
+纯白色 3 n
+纯益 3 n
+纯益率 3 n
+纯直 3 d
+纯真 120 a
+纯真无邪 2 i
+纯真版 3 n
+纯碱 832 n
+纯碱厂 5 n
+纯种 34 n
+纯种牛 3 n
+纯种马 3 n
+纯笃 3 a
+纯粹 990 a
+纯系 54 n
+纯红 2 b
+纯纯 3 a
+纯绵 3 a
+纯羊毛 3 n
+纯美 16 a
+纯育 3 v
+纯良 3 a
+纯色 17 n
+纯血马 3 n
+纯诚 3 a
+纯贞 3 a
+纯赚 3 v
+纯酒 3 n
+纯酒精 3 n
+纯金 80 n
+纯钢 31 n
+纯铁 11 n
+纯铜 11 n
+纯银 11 nz
+纯阳 21 n
+纯革装 3 nz
+纯音 23 n
+纯音乐 3 n
+纯风 3 n
+纯麻 2 n
+纰 206 n
+纰漏 71 n
+纰缪 17 n
+纱 788 zg
+纱丽 21 n
+纱包线 3 n
+纱卡 2 n
+纱厂 92 n
+纱巾 36 n
+纱布 120 n
+纱布绷带 3 vn
+纱帐 41 n
+纱帘 10 n
+纱帽 58 n
+纱幕 4 n
+纱橱 2 n
+纱灯 43 n
+纱窗 40 n
+纱笼 22 n
+纱筒 3 n
+纱管 3 n
+纱线 75 n
+纱绽 3 n
+纱罗 3 n
+纱罩 11 n
+纱罩灯 3 vn
+纱衣 4 n
+纱裙 6 n
+纱锭 124 n
+纱门 3 n
+纲 2163 n
+纲举目张 6 i
+纲举网疏 3 i
+纲常 128 n
+纲常扫地 3 i
+纲挈目张 3 i
+纲提领挈 3 i
+纲目 34 n
+纲目不疏 3 i
+纲纪 44 n
+纲维 3 n
+纲要 385 n
+纲领 1480 n
+纲领性 127 n
+纳 1968 nr
+纳丁银 2 nz
+纳万基 3 nr
+纳不纳 2 nr
+纳世通 2 nz
+纳丝料 2 n
+纳什 509 nrt
+纳什维尔 5 nrt
+纳代伊 2 nr
+纳代尔 4 nz
+纳伊夫 2 nr
+纳余庆 2 nr
+纳佛莱 2 nr
+纳克 13 nz
+纳克会 2 nr
+纳克斯 2 nr
+纳克索 17 nr
+纳入 1491 v
+纳入计划 3 nz
+纳兰容若 3 nr
+纳兰性 7 nz
+纳兹尔 2 nr
+纳冰架 2 nr
+纳凉 38 nr
+纳加 2 v
+纳加尔 11 nr
+纳努克 3 nr
+纳努契 3 nr
+纳博科 4 nr
+纳卡州 3 nr
+纳古陆 5 nz
+纳右旗 5 nr
+纳吉堡 3 nr
+纳吉宾 2 nr
+纳吉巴 4 nr
+纳吉布 21 nr
+纳吉布拉 4 nrt
+纳同知 3 nr
+纳吐夫 4 nr
+纳哈 22 nz
+纳哈尔 2 nr
+纳哈扬 2 nr
+纳唐 3 nz
+纳善言 2 nr
+纳喇氏 6 nr
+纳坦兹 15 nr
+纳垢藏污 3 v
+纳塔尔 32 nr
+纳塔尔省 11 ns
+纳塔拉 7 nr
+纳塔雷 2 nr
+纳士招贤 3 nr
+纳复 3 v
+纳多尼 2 nr
+纳太罗 6 nr
+纳奥米 3 nr
+纳妾 46 n
+纳子法 2 nr
+纳孙夫人 256 nr
+纳季耶 4 nr
+纳尔多 2 nrt
+纳尔德 2 nr
+纳尔瓦 16 nr
+纳尔维 10 nr
+纳尔逊 36 nr
+纳尼亚 3 nr
+纳履决踵 3 n
+纳履踵决 3 vn
+纳屦踵决 3 i
+纳州 3 ns
+纳州格 2 nr
+纳差 12 n
+纳巴岛 4 nr
+纳巴德 4 nr
+纳巴拉 2 nrt
+纳布 4 v
+纳布勒 3 nr
+纳布卢斯 2 nrt
+纳布科 2 nr
+纳希切 2 nr
+纳希切万 4 nrt
+纳希莫 5 nr
+纳帕塔 5 nr
+纳帕海 2 nr
+纳库鲁 3 nr
+纳形炼 4 nr
+纳彩 2 nz
+纳役钱 2 nr
+纳戈尔 3 nr
+纳扎尔巴耶夫 13 nrt
+纳托利 5 nr
+纳托夫 3 nr
+纳托尔 2 nr
+纳折布 2 nr
+纳拉亚南 2 ns
+纳拉姆 4 nr
+纳拉扬 3 nr
+纳指 2 nz
+纳斯单 3 nr
+纳斯卡 9 nr
+纳斯塔 2 nr
+纳斯尔 8 nr
+纳斯尔丁 4 nrt
+纳斯州 2 nr
+纳斯才 2 nr
+纳斯拉拉赫 2 nrt
+纳斯河 2 nr
+纳斯达克 105 nz
+纳斯达克交易所 2 nz
+纳新 3 nz
+纳新吐故 3 n
+纳旦 5 nz
+纳曼加 2 nr
+纳曼干 2 nr
+纳月 2 nz
+纳木措 5 nr
+纳木湖 5 nr
+纳木那尼 3 nr
+纳木那尼峰 5 ns
+纳木错 26 nr
+纳杰夫 5 nr
+纳林 3 nz
+纳林河 5 nr
+纳格 6 n
+纳格尔 13 nr
+纳格拉 2 nr
+纳桃登 2 nr
+纳梁氏 2 nr
+纳楚克 2 nr
+纳款 3 n
+纳比 8 j
+纳沙泰尔 7 nr
+纳河 9 nz
+纳波卡 2 nr
+纳泽尔 7 nr
+纳洛酮 3 nz
+纳浦尔 2 nr
+纳溪 4 nr
+纳溪区 3 nr
+纳溪县 3 nr
+纳爱斯 3 nr
+纳牙 3 ns
+纳物 2 n
+纳玛象 4 nr
+纳瑞曼 2 nr
+纳璞福 2 nr
+纳瓦依 2 nr
+纳瓦兹 3 nr
+纳瓦尔 26 nr
+纳瓦布 2 nr
+纳瓦拉 8 nrt
+纳瓦斯 6 nr
+纳瓦洛 2 nr
+纳瓦里 3 nrt
+纳瓦霍 40 nr
+纳甲法 2 nz
+纳百川 3 nr
+纳皮尔 28 nr
+纳盐 2 nz
+纳省 7 ns
+纳石矢 2 nr
+纳礼 4 nz
+纳福 18 nz
+纳秒 17 nr
+纳税 352 n
+纳税人 177 n
+纳税户 7 n
+纳税者 6 n
+纳税钱 4 n
+纳米 231 nrt
+纳米布 12 nr
+纳米技术 3 n
+纳米材料 6 nz
+纳米比亚 134 ns
+纳米比亚共和国 3 ns
+纳米管 3 nz
+纳米粉体 4 nz
+纳米级 3 nr
+纳米线 19 nz
+纳米银 3 nz
+纳粮 84 j
+纳粹 505 nr
+纳粹主义 22 n
+纳粹党 126 nr
+纳粹德国 3 nr
+纳素斯 2 nr
+纳绥尔 2 nr
+纳维亚 3 nr
+纳维尔 3 nr
+纳绸绢 2 nr
+纳罕 97 nrt
+纳罗拉 2 nr
+纳罗达 2 nr
+纳耶夫 2 nr
+纳聘 3 v
+纳肯 5 v
+纳舶 2 n
+纳苏斯 3 nr
+纳莫埃 2 nr
+纳蒂维 4 nr
+纳西 139 nr
+纳西尔 3 nr
+纳西斯 10 nr
+纳西族 357 nz
+纳西里 3 nr
+纳西里耶 3 nrt
+纳言 11 nr
+纳言物 2 n
+纳许布 10 nr
+纳谏 184 nr
+纳谏如流 3 nr
+纳豆菌 2 nr
+纳貂蝉 2 nr
+纳贡 82 nr
+纳贡称臣 3 nr
+纳贤豪 2 nr
+纳费珍 2 nr
+纳贾尔 3 nr
+纳贿 32 v
+纳资代 3 n
+纳资纳 2 nr
+纳赛尔 43 nr
+纳赛尔湖 2 nr
+纳达尔 34 nr
+纳过 3 v
+纳迪 2 nz
+纳迪尔 17 nr
+纳速 2 nz
+纳采 3 v
+纳采问 2 nr
+纳金花 3 nr
+纳银 5 nz
+纳银占 2 nr
+纳闷 436 v
+纳闷儿 11 v
+纳降 22 v
+纳雍 3 nr
+纳雍县 3 nr
+纳雷王 2 nr
+纳鞋 3 nz
+纳顺 2 nz
+纳马 4 nz
+纳马人 3 nrt
+纳马拉 3 nrt
+纳马柳 4 nr
+纳黎宣 8 nr
+纳黛特 40 nr
+纵 4220 n
+纵令 16 n
+纵任 3 v
+纵使 160 c
+纵倾 3 i
+纵切 3 v
+纵切面 5 n
+纵列 3 v
+纵剖面 25 n
+纵合 3 v
+纵向 303 v
+纵向弛豫 3 z
+纵向沙丘 3 n
+纵向设计 3 i
+纵场 3 n
+纵坐标 27 n
+纵声 3 d
+纵容 200 n
+纵帆船 3 n
+纵座标 3 n
+纵情 89 n
+纵情声色 3 i
+纵情歌唱 3 l
+纵情遂欲 3 i
+纵惯 3 n
+纵意 3 v
+纵断面 3 n
+纵曲枉直 3 i
+纵有 3 v
+纵梁 6 n
+纵横 1009 v
+纵横交织 11 n
+纵横交贯 3 i
+纵横交错 135 i
+纵横天下 3 i
+纵横家 42 n
+纵横币 3 n
+纵横开合 3 i
+纵横开阖 3 i
+纵横捭阖 29 i
+纵横有序 2 i
+纵横自如 3 i
+纵横谈 5 i
+纵横跤错 3 vn
+纵横驰骋 35 i
+纵欲 66 n
+纵歌 5 n
+纵步 9 d
+纵步前进 3 i
+纵波 26 n
+纵深 510 d
+纵深处 7 i
+纵深感 8 i
+纵深行 7 i
+纵火 128 v
+纵火案 21 n
+纵火烧 3 i
+纵火犯 7 i
+纵火狂 3 i
+纵火罪 3 i
+纵火者 2 n
+纵然 1197 c
+纵然会 3 n
+纵然能 3 n
+纵目 39 n
+纵目四望 3 i
+纵目远望 3 i
+纵穿 8 v
+纵纹 38 n
+纵线 11 n
+纵膈 3 n
+纵荡 3 v
+纵虎归山 4 i
+纵行 3 v
+纵裂 17 v
+纵观 180 n
+纵视图 3 n
+纵览 26 v
+纵览群书 3 n
+纵览群籍 3 n
+纵论 15 c
+纵谈 38 v
+纵谷 3 n
+纵谷区 3 n
+纵质量 3 n
+纵贯 644 v
+纵贯公路 3 n
+纵贯线 3 n
+纵贯道 3 i
+纵贯铁路 3 i
+纵身 1025 v
+纵轴 28 n
+纵过道 3 d
+纵酒 22 v
+纵长 18 v
+纵队 391 n
+纵队队形 3 n
+纵隔 29 v
+纵风止燎 3 i
+纵饮 3 v
+纶 61 x
+纶巾 7 n
+纶巾羽扇 8 i
+纶音佛语 3 i
+纷 317 d
+纷乱 158 d
+纷乱不宁 3 i
+纷乱如麻 5 i
+纷争 270 n
+纷华 3 a
+纷呈 55 v
+纷坠 3 v
+纷扰 139 v
+纷披 3 v
+纷杂 17 a
+纷歧 3 n
+纷沓 3 a
+纷浊 3 a
+纷繁 163 a
+纷繁复杂 3 i
+纷红骇绿 3 i
+纷纭 82 z
+纷纭复杂 3 l
+纷纶 3 n
+纷纷 4973 d
+纷纷不一 3 i
+纷纷扬扬 35 i
+纷纷扰扰 3 i
+纷纷拥拥 3 i
+纷纷攘攘 3 i
+纷纷洋洋 3 z
+纷纷籍籍 3 n
+纷纷表示 3 i
+纷纷议论 3 n
+纷至沓来 89 i
+纷至踏来 2 d
+纷落 3 v
+纷论 3 n
+纷论络绎 3 v
+纷起 3 v
+纷飞 122 v
+纸 3727 n
+纸上作业 3 n
+纸上谈兵 55 n
+纸业 71 n
+纸业公司 3 n
+纸业网 3 n
+纸人 51 n
+纸介 6 n
+纸伞 8 n
+纸作 3 n
+纸刀 3 n
+纸制 13 n
+纸制品 16 n
+纸包 87 n
+纸包不住 3 i
+纸包不住火 9 i
+纸包儿 5 n
+纸包装 3 n
+纸匣 3 n
+纸卡 8 n
+纸卷 3 n
+纸卷子 3 n
+纸厂 21 n
+纸口袋 3 n
+纸品 15 n
+纸品厂 3 n
+纸坊 776 n
+纸型 3 n
+纸垫 3 n
+纸堆 3 n
+纸头 12 n
+纸夹 3 n
+纸套 3 n
+纸婚 4 n
+纸孔 2 n
+纸尿片 3 n
+纸尿裤 3 n
+纸屑 37 n
+纸工 3 n
+纸巾 41 n
+纸巾盒 3 n
+纸币 364 n
+纸带 22 n
+纸带机 3 n
+纸张 270 n
+纸弹 3 n
+纸扇 14 n
+纸托盘 3 n
+纸护角 3 n
+纸捻 6 n
+纸本 7 n
+纸条 319 n
+纸杯 13 n
+纸杯机 3 n
+纸板 62 n
+纸板厂 2 n
+纸板桶 3 n
+纸板盒 3 n
+纸板箱 3 n
+纸样 4 n
+纸框 3 n
+纸模型 3 n
+纸浆 117 n
+纸浆厂 4 n
+纸浆模 3 n
+纸灯 3 n
+纸灰 32 n
+纸烟 244 n
+纸煤 8 n
+纸煤儿 3 n
+纸片 139 n
+纸片儿 5 n
+纸版 3 n
+纸版画 3 n
+纸牌 58 n
+纸牌儿 3 n
+纸牌局 3 n
+纸牌戏 3 n
+纸状 3 n
+纸电泳 3 n
+纸画 3 n
+纸盒 53 n
+纸盒包装 3 n
+纸盒子 4 n
+纸盒式 3 n
+纸盒装 3 n
+纸盘 3 n
+纸短情长 3 i
+纸砚 3 n
+纸票 11 n
+纸稿 3 n
+纸笔 3 n
+纸笔迷津 3 i
+纸笺 44 n
+纸筒 8 n
+纸管 3 n
+纸箱 46 n
+纸箱包装 3 n
+纸箱厂 3 n
+纸箱机械 3 n
+纸箱装 3 n
+纸篓 35 n
+纸类 3 n
+纸糊老虎 3 i
+纸绳 3 n
+纸缝 3 n
+纸老虎 46 n
+纸背 3 n
+纸船 5 n
+纸色 3 n
+纸花 13 n
+纸菸 3 nz
+纸落云烟 3 i
+纸行 3 n
+纸衣 3 n
+纸袋 49 n
+纸袋子 6 n
+纸装 3 n
+纸质 67 n
+纸贵洛阳 3 n
+纸费 3 n
+纸边 3 n
+纸醉金迷 25 n
+纸钞 2 n
+纸钱 89 n
+纸镇 3 n
+纸面 23 n
+纸页 32 n
+纸飞机 3 n
+纸餐巾 3 n
+纸马 31 n
+纸鸢 8 n
+纸鹞 8 n
+纸鹤 4 n
+纸黄金 3 n
+纹 1861 ng
+纹丝 3 n
+纹丝不动 160 i
+纹儿 3 n
+纹光针 3 n
+纹孔 4 n
+纹板 3 n
+纹枯病 3 n
+纹样 92 n
+纹沟 3 n
+纹波 3 n
+纹泥 3 n
+纹状体 19 n
+纹理 135 n
+纹理分明 3 n
+纹理梯度 3 n
+纹理状 3 n
+纹眉 3 n
+纹章 5 n
+纹线 7 n
+纹路 82 n
+纹身 16 n
+纹银 77 n
+纹风 3 n
+纹风不动 3 i
+纹饰 418 n
+纺 519 n
+纺丝 25 n
+纺丝头 3 n
+纺丝机 3 n
+纺垂体 3 n
+纺垂形 3 n
+纺嫂 3 n
+纺成 3 v
+纺机 37 n
+纺染厂 3 n
+纺纱 301 n
+纺纱厂 29 n
+纺纱工 3 n
+纺纱机 59 n
+纺纱车 3 n
+纺线 34 n
+纺织 4914 n
+纺织业 131 n
+纺织印染 3 n
+纺织厂 263 n
+纺织品 693 n
+纺织器材 3 n
+纺织城 5 n
+纺织娘 3 n
+纺织工业 3 n
+纺织工人 3 n
+纺织机 11 n
+纺织机械 3 n
+纺织物 11 n
+纺织用 6 n
+纺织界 2 n
+纺织系统 3 n
+纺织网 3 n
+纺织设备 3 n
+纺织部 5 n
+纺绩 3 n
+纺绸 19 n
+纺车 84 n
+纺锤 55 n
+纺锤体 3 n
+纺锤形 87 n
+纺锭 23 n
+纺麻 3 n
+纻 32 zg
+纽 379 ns
+纽伦堡 128 ns
+纽伯瑞 10 nrt
+纽伯瑞奖 4 n
+纽卡斯尔 56 nrt
+纽国 3 ns
+纽埃 31 ns
+纽子 4 n
+纽崔莱 3 nz
+纽带 233 n
+纽扣 119 n
+纽扣儿 3 n
+纽新 3 ns
+纽曼 32 ns
+纽汉浦 2 ns
+纽波特 8 nrt
+纽澳 3 ns
+纽澳地区 3 ns
+纽瓦克 5 ns
+纽约 1758 ns
+纽约卡内基音乐厅 2 nt
+纽约商品交易所 9 nt
+纽约城 8 ns
+纽约大学 17 nt
+纽约州 87 ns
+纽约市 51 ns
+纽约市场 3 nt
+纽约市政府 3 nt
+纽约日报 3 nt
+纽约时代广场 4 nt
+纽约时报 3 nt
+纽约林肯中心 2 nt
+纽约河 3 ns
+纽约派 3 nt
+纽约港 12 ns
+纽约爱乐乐团 7 nt
+纽约联合国总部 4 nt
+纽约联邦储备银行 3 nt
+纽约股票交易所 7 nt
+纽约证交所 7 nt
+纽约证券交易所 8 nt
+纽约银行 2 nt
+纽结 3 n
+纽芬兰 82 ns
+纽芬兰省 2 ns
+纽芬堡 3 ns
+纽襻 3 n
+纽西兰 3 ns
+纽西兰人 3 nrt
+纾 165 g
+纾忧 3 v
+纾解 3 v
+线 7688 n
+线上作业 3 l
+线下 64 n
+线人 7 n
+线偏振 3 l
+线光源 2 n
+线入 2 n
+线冲 3 n
+线分辨率 3 n
+线切割 2 l
+线列 6 n
+线卡 3 n
+线号机 3 n
+线呢 7 n
+线团 10 n
+线图 26 n
+线圈 181 n
+线圈图 3 n
+线圈系 3 n
+线坯子 3 n
+线型 52 n
+线天线 3 n
+线头 29 n
+线头儿 3 n
+线宽 3 n
+线带 3 n
+线序 3 n
+线形 64 n
+线形动物 8 l
+线性 562 n
+线性代数 3 l
+线性元件 3 n
+线性关系 3 l
+线性化 11 n
+线性变换 3 l
+线性型 3 n
+线性失真 3 l
+线性探查 3 l
+线性插值 3 l
+线性方程 19 l
+线性方程组 40 n
+线性无缘 3 l
+线性检波 3 n
+线性检测 3 n
+线性现象 3 n
+线性电路 3 l
+线性相关 3 l
+线性系统 44 l
+线性组合 3 l
+线性组织 4 l
+线性网络 3 n
+线性表 3 n
+线性规划 56 l
+线性调制 3 l
+线或 35 l
+线手套 3 n
+线抽傀儡 3 nr
+线控 3 n
+线控器 3 n
+线描 22 n
+线插 3 n
+线断风筝 3 n
+线春 6 n
+线材 22 n
+线材厂 2 n
+线束 3 n
+线条 389 n
+线条图 3 n
+线条美 3 n
+线条透视 3 l
+线板 3 n
+线极化 3 n
+线桄子 3 v
+线框 2 n
+线桥 10 n
+线槽 3 n
+线段 48 n
+线毯 2 n
+线民 3 n
+线汇 3 n
+线源 3 n
+线状 87 n
+线电压 8 n
+线程 3 n
+线程技术 2 n
+线管 3 n
+线粉 3 n
+线粒体 98 n
+线索 730 n
+线绳 18 n
+线缆 6 n
+线缕 3 n
+线网 3 n
+线胀系数 3 l
+线脚 3 n
+线膛炮 3 n
+线膨胀 4 l
+线膨胀率 3 l
+线虫 112 n
+线虫病 3 n
+线行动物 3 n
+线衣 8 n
+线衫 3 n
+线袜 3 n
+线装 23 n
+线装书 18 n
+线装本 6 l
+线西 4 n
+线规 2 n
+线角 3 n
+线谱 3 n
+线质量 3 n
+线路 2050 n
+线路图 8 n
+线路工 2 n
+线路板 15 n
+线轴 10 n
+线速度 10 n
+线道 3 n
+线长 3 n
+线间 3 n
+线闸 3 n
+线面 3 n
+线香 21 n
+线麻 2 n
+绀 106 g
+绀青 3 nr
+绁 188 g
+绂 116 g
+练 4197 v
+练一练 5 nr
+练三军 2 nr
+练下 3 v
+练下去 3 v
+练下来 3 v
+练之士 2 nr
+练之法 2 nr
+练习 1029 v
+练习册 6 nr
+练习器 3 n
+练习场 9 n
+练习手册 3 n
+练习曲 36 nr
+练习曲线 3 n
+练习本 6 n
+练习模式 3 n
+练习生 9 nr
+练习簿 2 n
+练习者 5 n
+练习薄 3 nr
+练习赛 3 nr
+练习题 35 n
+练全真 5 nr
+练兵 423 nr
+练兵场 9 n
+练兵秣马 3 nr
+练内功 3 nr
+练写 3 v
+练出 36 v
+练到 3 v
+练剑时 2 nr
+练剑法 4 nr
+练剑神 2 nr
+练功 391 nr
+练功区 3 n
+练功夫 3 nr
+练功师 3 nr
+练功房 11 n
+练功者 5 n
+练华山 2 nr
+练单剑 2 nr
+练历练 2 nr
+练唱 3 v
+练嗓子 3 n
+练塘镇 2 nr
+练好 3 v
+练子宁 3 nr
+练子锤 2 nr
+练字 26 n
+练家子 3 nr
+练就 140 v
+练市 2 v
+练得 3 v
+练得厚 2 nr
+练得心 2 v
+练成 3 v
+练成军 4 nr
+练成经 2 nr
+练手 6 v
+练拳 25 v
+练摊 5 v
+练摊儿 3 n
+练新军 8 nr
+练来练去 3 nr
+练欧阳锋 2 nr
+练歌房 3 nr
+练武 218 nr
+练武功 3 nr
+练武场 12 n
+练武术 3 nr
+练武艺 3 nr
+练气 4 n
+练法 28 v
+练洋操 4 nr
+练淮军 3 nr
+练玉箫 2 nr
+练球 3 n
+练瑜珈 3 nr
+练神掌 8 nr
+练神照 3 nr
+练笔 6 v
+练级 6 v
+练级狂 3 n
+练练 3 v
+练练剑 2 nr
+练练手 5 n
+练练看 3 nr
+练见功 2 nr
+练起 3 v
+练起来 3 v
+练跑 3 v
+练跳 3 v
+练轻功 3 nr
+练达 41 nr
+练达老成 3 nr
+练过去 3 v
+练过来 3 v
+练过武 2 nr
+练队 3 n
+练鹊 3 nr
+组 4621 zg
+组人 3 n
+组件 179 n
+组党 3 n
+组内方差 3 n
+组内设计 3 n
+组分 406 n
+组分分析 3 l
+组分模型 3 n
+组别 11 v
+组办 3 v
+组合 2609 v
+组合体 13 n
+组合分析 3 l
+组合原理 3 n
+组合型 6 n
+组合式 26 l
+组合成 3 l
+组合拳 7 n
+组合曲线 3 l
+组合柜 3 n
+组合概率 3 l
+组合法 3 n
+组合测井 3 n
+组合港 2 n
+组合磁头 3 n
+组合而成 3 l
+组合装 3 l
+组合键 3 n
+组合音响 9 l
+组员 27 n
+组团 133 n
+组团式 3 n
+组团社 48 l
+组块 3 n
+组塑 3 n
+组头 3 v
+组委 7 n
+组委会 382 n
+组工 4 v
+组建 1453 v
+组异肽 3 n
+组态 12 n
+组态王 3 n
+组成 20572 v
+组成员 61 l
+组成部分 2299 l
+组成酶 3 l
+组接 20 v
+组方 31 n
+组曲 73 v
+组构 3 n
+组歌 17 n
+组氨酸 10 n
+组派 2 n
+组画 44 n
+组稿 10 v
+组策略 3 n
+组组 77 n
+组组长 3 n
+组织 26922 v
+组织体制 3 n
+组织关系 22 l
+组织化 18 n
+组织化学 3 n
+组织协调 3 n
+组织变形 3 l
+组织变革 3 l
+组织名义 3 l
+组织后卫 3 l
+组织培养 3 l
+组织奖 27 n
+组织学 38 n
+组织性 37 n
+组织沿革 3 n
+组织法 1083 n
+组织液 17 n
+组织生活 59 n
+组织科 7 n
+组织系统 40 l
+组织纪律 3 n
+组织纪律性 9 n
+组织细胞 3 n
+组织罪 2 n
+组织者 219 n
+组织胺 7 n
+组织观念 3 n
+组织路线 3 n
+组织转化 3 n
+组织部 213 n
+组织部长 95 n
+组织部门 49 n
+组网 16 v
+组群 3 n
+组胺 54 n
+组蛋白 3 l
+组装 246 v
+组装厂 3 n
+组装机 2 l
+组装线 3 l
+组装车 6 l
+组训 35 n
+组识 3 v
+组词 3 n
+组诗 27 n
+组诛 3 v
+组起 3 v
+组起来 3 l
+组过 3 v
+组配 13 v
+组里 3 q
+组长 853 v
+组阁 150 n
+组队 43 n
+组队参加 3 l
+组限 3 v
+组项 3 n
+绅 144 n
+绅商 3 n
+绅士 296 n
+绅士协定 3 nz
+绅士派 3 nz
+绅士风度 3 n
+绅宦 3 n
+细 4388 a
+细不容发 3 i
+细丝 37 n
+细丝钳 3 n
+细事 3 n
+细伢子 3 v
+细作 281 n
+细分 183 n
+细分化 4 n
+细则 185 n
+细别 3 d
+细刻精雕 3 i
+细动脉 3 n
+细化 123 n
+细发 4 n
+细口 3 n
+细叶 8 n
+细叶芹 3 nr
+细君 17 n
+细咬 3 v
+细嗓子 3 n
+细嚼 3 v
+细嚼慢咽 12 l
+细声 3 n
+细声细气 38 n
+细大不捐 3 i
+细大不逾 3 nr
+细姨 3 n
+细嫩 344 a
+细嫩皮肤 3 n
+细孔 3 n
+细字 3 n
+细字笔 3 n
+细审 3 n
+细密 185 a
+细密画 56 n
+细察 51 n
+细小 441 n
+细川 6 n
+细川护熙 5 n
+细川直美 3 ns
+细工 16 n
+细巧 13 a
+细布 10 v
+细帐 3 n
+细带 2 n
+细度 7 n
+细弱 75 a
+细微 278 a
+细微处 16 n
+细微差别 3 i
+细微末节 5 n
+细心 511 n
+细心人 3 n
+细心地 3 n
+细心请教 3 n
+细怨 3 n
+细情 3 n
+细想 3 n
+细挑 3 a
+细故 28 n
+细数 3 n
+细木工 18 n
+细木工板 3 n
+细条 19 n
+细条条 3 z
+细条纹 3 n
+细枝 3 n
+细枝末节 22 i
+细枝状 3 n
+细查 3 vn
+细柳 10 n
+细棋 3 n
+细毛 31 n
+细毛羊 40 n
+细民 3 n
+细水 3 n
+细水长流 24 n
+细沙 52 n
+细河区 3 n
+细活 7 a
+细流 34 n
+细浪 3 n
+细润 8 n
+细溜溜 3 z
+细濛濛 3 z
+细点 24 n
+细片 3 n
+细牙 3 n
+细琐 3 a
+细琢 3 v
+细瓷 29 n
+细瘦 13 z
+细白 18 z
+细皮 3 n
+细皮嫩肉 3 n
+细盐 5 n
+细目 13 n
+细看 499 v
+细看之下 3 l
+细石器 24 n
+细砂 22 n
+细砂糖 2 n
+细砂纸 3 n
+细砖 3 n
+细砾 3 n
+细碎 127 a
+细磁 3 n
+细究 13 vn
+细算 3 n
+细管 3 n
+细粉 15 n
+细粒 51 n
+细粒度 4 n
+细粮 52 n
+细索 3 n
+细纱 33 n
+细纱机 6 n
+细纹 3 n
+细纺 2 n
+细线 3 n
+细细 628 a
+细细品味 3 n
+细细地 71 z
+细细的 213 z
+细细长长 3 z
+细绳 3 n
+细缝 3 n
+细网 3 n
+细羊毛 3 n
+细胞 5517 n
+细胞体 15 n
+细胞保护 3 n
+细胞信号 3 n
+细胞分裂 3 n
+细胞周期 3 n
+细胞器 78 n
+细胞因子 3 n
+细胞培养 3 n
+细胞壁 157 n
+细胞学 72 n
+细胞学说 3 n
+细胞层 3 n
+细胞工程 3 n
+细胞株 11 n
+细胞样本 3 n
+细胞核 184 n
+细胞毒 3 n
+细胞液 5 n
+细胞状 3 n
+细胞系 29 n
+细胞组织 3 n
+细胞膜 149 n
+细胞融合 3 n
+细胞质 149 n
+细胞骨架 3 n
+细腰 3 n
+细腻 498 a
+细腻入微 2 l
+细致 695 a
+细致入微 28 i
+细节 1339 n
+细节决定 3 n
+细节性 3 n
+细菌 1297 n
+细菌学 39 n
+细菌学家 19 n
+细菌性 59 n
+细菌性痢疾 15 n
+细菌战 37 n
+细菌武器 46 n
+细菌肥料 3 n
+细菜 5 n
+细行 3 n
+细观 46 n
+细览 3 n
+细论 3 n
+细语 57 n
+细说 131 n
+细读 46 v
+细读者 3 n
+细谈 3 v
+细账 10 n
+细质 3 n
+细路 3 n
+细软 102 a
+细辛 26 a
+细述 3 v
+细部 41 n
+细部分解 3 l
+细量 3 n
+细针密线 3 n
+细针密缕 2 i
+细铁丝 6 n
+细长 484 n
+细长型人 3 n
+细问 117 n
+细雨 109 n
+细雨楼 3 n
+细雨濛濛 3 nz
+细雨绵绵 3 l
+细面条 4 n
+细颈 3 n
+细高 13 a
+细高挑 4 z
+细高挑儿 3 z
+细鳞鱼 8 n
+织 1133 v
+织云 3 n
+织体 3 n
+织出 3 v
+织制 22 v
+织品 28 n
+织地 3 n
+织女 66 n
+织女星 47 n
+织女星座 3 n
+织就 20 n
+织工 113 n
+织布 267 v
+织布厂 7 n
+织布机 86 n
+织布鸟 14 n
+织带 7 n
+织带厂 3 n
+织带机 3 n
+织当访婢 3 n
+织成 124 v
+织机 170 n
+织梭 2 v
+织楚成门 3 n
+织毛衣 3 n
+织法 3 n
+织物 368 n
+织物组织 3 n
+织田 12 n
+织田信长 3 n
+织田家 3 n
+织田裕二 3 ns
+织画 3 n
+织白守黑 3 n
+织纹 8 n
+织绢 3 n
+织绣 12 n
+织绵 3 n
+织绵回文 3 n
+织网 5 n
+织花 3 n
+织衣 3 n
+织补 11 v
+织袜 3 n
+织袜机 4 n
+织轴 3 n
+织边 3 n
+织造 241 v
+织造厂 3 n
+织造布 3 n
+织金 20 n
+织金县 2 ns
+织锦 92 n
+织锦缎 6 n
+终 2357 d
+终不然 5 d
+终丝 2 n
+终为江河 3 nr
+终久 51 d
+终了 65 d
+终于 10542 d
+终产物 3 n
+终会 3 n
+终使 3 v
+终值 3 n
+终元之 2 nr
+终免 3 d
+终其一生 3 d
+终其天 3 nr
+终其天年 3 nr
+终其身 16 d
+终养 3 v
+终养天年 3 n
+终到 12 v
+终南 14 ns
+终南山 226 ns
+终南捷径 4 nr
+终印模 3 n
+终又延 2 nr
+终变期 3 n
+终古 3 d
+终古常青 3 nr
+终告 3 n
+终唐之 3 nr
+终因 3 n
+终场 111 n
+终场哨 2 n
+终夕 4 n
+终夜 13 d
+终夜未眠 3 i
+终天 18 m
+终天之恨 3 i
+终天之慕 3 nr
+终天之根 3 nr
+终奉其 2 nr
+终始 4 v
+终始一贯 3 nr
+终始不渝 3 i
+终始如一 3 nr
+终始若一 3 nr
+终审 65 v
+终审判决 3 nr
+终审权 9 n
+终宵 3 n
+终对象 3 n
+终将 108 d
+终局 21 n
+终岁 3 m
+终席 2 n
+终年 655 m
+终弟 20 n
+终归 124 d
+终归一句 3 i
+终归于 3 nr
+终归无效 3 i
+终归是 3 n
+终得复 2 d
+终必 3 d
+终必会 3 nr
+终必在 3 v
+终必是 3 n
+终成 7 v
+终成泡影 3 n
+终成眷属 3 i
+终成空 3 nr
+终战 5 v
+终战国 2 n
+终扣 3 n
+终日 259 d
+终日只 4 m
+终明之 2 nr
+终是 3 d
+终有 3 v
+终朝 4 n
+终末 20 n
+终末期 13 n
+终板 3 n
+终板电位 3 n
+终极 325 n
+终极命运 3 n
+终极无间 3 n
+终极版 3 n
+终极目标 3 n
+终极速度 3 n
+终模型 3 n
+终止 693 v
+终止剂 3 n
+终止子 3 n
+终止符 3 nr
+终济 2 n
+终清之 6 nr
+终清未 3 nr
+终澈霞 3 nr
+终点 508 d
+终点港 3 nr
+终点滴定 3 n
+终点监测 3 nr
+终点站 52 m
+终点线 3 m
+终点误差 3 v
+终焉之志 3 nr
+终生 433 n
+终生事业 3 n
+终生教育 3 n
+终生服 2 n
+终盘 7 n
+终究 1351 d
+终究会 3 n
+终站 3 n
+终竟 2 d
+终端 770 n
+终端产品 3 n
+终端区 3 nr
+终端台 3 nr
+终端服务器 2 n
+终端机 12 nr
+终端用户 25 n
+终端盒 3 n
+终端装置 3 n
+终端设备 3 nr
+终篇 3 m
+终结 412 v
+终结句 3 n
+终结版 3 v
+终结状态 2 n
+终结符 10 nr
+终结者 15 n
+终统 8 n
+终统论 3 n
+终老 51 n
+终老林 2 nr
+终考 3 v
+终能 3 v
+终至 3 d
+终虚所望 3 i
+终裁 6 n
+终觉 4 d
+终言 3 n
+终评 3 v
+终身 1488 d
+终身不忘 3 i
+终身不渝 3 i
+终身之丑 3 i
+终身之忧 3 i
+终身之恶 3 i
+终身伴侣 9 n
+终身免疫 3 n
+终身制 99 n
+终身化 2 n
+终身大事 81 n
+终身性 4 n
+终身教育 3 n
+终身职 3 n
+终身难忘 3 i
+终难胜 2 nr
+终霜 3 n
+终非 5 d
+终非池 4 nr
+终须 11 d
+绉 758 n
+绉丝 3 n
+绉布 3 n
+绉纱 5 n
+绉纹 4 n
+绉缩 3 n
+绉褶 3 n
+绊 361 v
+绊住 3 v
+绊倒 83 v
+绊子 3 n
+绊手绊脚 3 z
+绊脚 3 n
+绊脚石 49 n
+绊跌 3 v
+绊马索 24 n
+绋 152 g
+绌 277 g
+绍 437 ns
+绍丝印 3 nz
+绍介 3 n
+绍休圣绪 3 nr
+绍兴 637 ns
+绍兴人 23 nr
+绍兴县 14 ns
+绍兴城 5 ns
+绍兴市 28 ns
+绍兴戏 4 nz
+绍兴酒 18 nr
+绍剧 4 n
+绍圣 28 ns
+绍尔 22 ns
+绍棠 11 ns
+绍武 2 ns
+绍熙 17 nz
+绍祖 39 ns
+绍纳 10 ns
+绍继 3 nz
+绍罗什 7 ns
+绍述 3 n
+绍酒 7 nz
+绍鲍德 2 nr
+绎 44 g
+经 21042 n
+经三路 3 n
+经上述 2 l
+经不住 64 l
+经不起 182 l
+经世 64 n
+经世之 16 nr
+经世之才 3 nr
+经世奇才 3 nr
+经世实 29 n
+经世文 9 nr
+经世济 2 n
+经世济民 2 n
+经世致用 53 l
+经丘寻壑 3 i
+经东昌 2 nr
+经久 32 d
+经久不息 148 l
+经久不散 8 l
+经久不衰 29 l
+经久耐用 15 l
+经义 3 n
+经义进士 5 n
+经义述 4 n
+经九纬 3 nr
+经书 429 n
+经互会 20 l
+经亚非 2 nr
+经产妇 4 n
+经人介绍 3 nr
+经从乾 2 nr
+经传 76 vn
+经作 4 vn
+经侦 20 j
+经侦处 2 n
+经侦大队 3 n
+经典 2096 n
+经典之作 39 n
+经典作 3 n
+经典作品 3 n
+经典作家 3 n
+经典力学 3 n
+经典台词 3 n
+经典名曲 3 n
+经典对白 3 n
+经典小说 3 n
+经典影片 3 n
+经典影视 3 n
+经典性 27 n
+经典收藏 3 n
+经典歌曲 3 n
+经典电影 3 n
+经典着作 3 n
+经典笑话 3 n
+经典策划 3 n
+经典著作 3 n
+经典语录 3 n
+经典音乐 3 n
+经初字 3 n
+经剑谱 13 nr
+经办 69 n
+经办人 15 n
+经博斯 3 nr
+经卷 95 n
+经历 5266 n
+经压缩 3 l
+经发局 3 n
+经叔平 4 nr
+经受 723 v
+经受考验 3 n
+经受锻炼 3 l
+经变 16 n
+经史 3 n
+经史子集 20 n
+经史百子 3 n
+经合 57 vn
+经合组织 3 nt
+经名儿 3 n
+经君士 2 nr
+经售 3 vn
+经售处 3 n
+经商 459 n
+经商参 3 n
+经商在外 3 l
+经商者 8 n
+经四路 3 n
+经团联 6 n
+经国 3 n
+经国之才 3 l
+经国先生 3 n
+经国大业 3 nt
+经堂 57 n
+经天纬地 9 n
+经委 47 n
+经委会 3 n
+经学 146 n
+经学家 27 n
+经宁西 2 nr
+经审查 3 nr
+经密 3 n
+经师 3 n
+经师人师 3 n
+经帮纬国 3 n
+经常 7253 d
+经常出现 5 vn
+经常化 29 vn
+经常帐户 3 n
+经常性 215 n
+经幡 3 n
+经幢 26 n
+经年累月 14 l
+经度 78 n
+经廷议 4 n
+经建会 3 n
+经得住 49 d
+经得起 244 v
+经德萨 2 nr
+经心 22 n
+经情直遂 3 l
+经意 23 n
+经手 70 n
+经手人 10 n
+经手费 3 n
+经打 3 p
+经打听 3 i
+经承天 3 nr
+经折儿 2 n
+经援 30 vn
+经改 11 j
+经文 319 n
+经文纬武 3 nr
+经文讳武 3 nr
+经斯基 19 nr
+经新义 3 n
+经明帝 2 nr
+经明行修 3 nr
+经春露 2 nr
+经昭陵 2 nr
+经曲 3 n
+经曼德 3 nr
+经期 105 n
+经术 3 n
+经查 3 vn
+经查明 3 n
+经检测 2 j
+经楼镇 2 n
+经永定 2 nr
+经江波 256 nr
+经洗 3 vn
+经济 48718 n
+经济一体 3 n
+经济专科 3 n
+经济主义 6 n
+经济之才 3 n
+经济交往 3 l
+经济仓 3 n
+经济企划厅 2 n
+经济体 45 n
+经济体制 519 n
+经济作物 784 n
+经济侵略 3 n
+经济制裁 3 n
+经济区 102 n
+经济区划 3 n
+经济协作 3 n
+经济危机 130 l
+经济可行性 3 n
+经济史 118 n
+经济合作与发展组织 11 nt
+经济合作组织 8 nt
+经济合同 3 n
+经济同友会 2 nt
+经济周期 3 n
+经济命脉 3 n
+经济圈 14 n
+经济型 365 n
+经济域 3 n
+经济基础 330 n
+经济复原 3 n
+经济大国 3 n
+经济委员会 32 nt
+经济学 1544 n
+经济学奖 3 n
+经济学家 900 n
+经济学界 32 n
+经济学说 60 n
+经济实体 3 n
+经济实用 3 l
+经济封锁 3 n
+经济局 4 n
+经济布局 3 n
+经济师 39 n
+经济带 273 n
+经济年度 3 n
+经济庭 2 n
+经济往来 3 l
+经济性 91 n
+经济总量 3 n
+经济恐慌 3 i
+经济情报 3 n
+经济成就 3 n
+经济战线 3 n
+经济担保 3 n
+经济指标 3 n
+经济损失 22 n
+经济援助 3 n
+经济收益 16 n
+经济效益 1109 n
+经济日报 3 n
+经济时报 3 n
+经济昆虫 3 nr
+经济杂交 3 n
+经济杠杆 3 nr
+经济林 358 n
+经济林木 46 n
+经济核算 7 n
+经济模型 23 n
+经济模式 3 l
+经济法 123 n
+经济法制 2 n
+经济法学 4 n
+经济波动 3 n
+经济渗透 3 n
+经济渠道 3 n
+经济滑坡 3 n
+经济热阻 3 n
+经济特区 1815 n
+经济犯 3 n
+经济犯罪 3 l
+经济界 95 n
+经济社会 528 n
+经济科 8 n
+经济科学出版社 33 nt
+经济秩序 3 nr
+经济系 61 n
+经济繁荣 3 nr
+经济纠纷 3 z
+经济网 17 n
+经济腾飞 3 nr
+经济舱 24 n
+经济范畴 3 n
+经济落后 3 n
+经济衰退 3 l
+经济论文 3 n
+经济评价 3 n
+经济负担 3 n
+经济账 14 n
+经济趋势 3 n
+经济过剩 3 l
+经济过热 3 l
+经济运行 34 n
+经济部 43 n
+经济部长 16 n
+经济阈值 3 vn
+经海道 2 n
+经渠 3 n
+经献忠 3 nr
+经理 2761 n
+经理世界 3 n
+经理人 508 n
+经理制 2 n
+经理助理 3 n
+经理室 8 n
+经理层 4 n
+经理级 3 n
+经理部 6 n
+经由 384 p
+经画邦 2 n
+经略 254 n
+经痛 14 n
+经直 3 d
+经砥柱 3 nr
+经社 14 n
+经社文 3 n
+经社理事会 4 nt
+经穴学 3 n
+经筋 14 n
+经管 363 n
+经管人 3 n
+经管站 3 n
+经管类 3 n
+经管系 3 n
+经管院 3 n
+经籍 132 n
+经纪 147 n
+经纪人 371 n
+经纪商 9 n
+经纬 60 n
+经纬万端 3 n
+经纬仪 63 nr
+经纬分明 3 n
+经纬天下 3 n
+经纬度 38 n
+经纬线 17 n
+经纬网 22 n
+经纬网格 3 n
+经纱 56 n
+经纶 29 n
+经纶济世 3 n
+经纶满腹 3 i
+经线 89 n
+经络 267 n
+经络学 3 n
+经编 10 n
+经编机 3 n
+经脉 449 n
+经营 7456 vn
+经营不善 30 v
+经营不善者 2 n
+经营业 34 n
+经营之道 3 n
+经营企业法 3 n
+经营品种 3 n
+经营商 11 n
+经营场所 3 n
+经营型 3 n
+经营学 3 n
+经营层 4 n
+经营思想 3 n
+经营性 32 n
+经营性质 3 n
+经营户 30 n
+经营承包 3 n
+经营报 3 n
+经营收入 3 n
+经营效果 3 n
+经营方式 3 n
+经营有术 3 n
+经营期 2 n
+经营机制 3 n
+经营权 114 n
+经营策略 3 n
+经营管理者 14 n
+经营者 488 n
+经营范围 3 n
+经营规模 3 n
+经营责任制 29 n
+经营部 6 n
+经营项目 3 n
+经营额 10 n
+经营风险 3 n
+经蝶窦 2 n
+经血 50 n
+经行 38 n
+经衬纬 2 nr
+经裕溪 2 nr
+经解 3 n
+经警 3 n
+经训 3 n
+经论 3 n
+经货联盟 19 j
+经贸 959 n
+经贸公司 3 nt
+经贸关系 3 l
+经贸合作 3 l
+经贸大学 3 nt
+经贸委 42 nt
+经贸局 3 nt
+经贸混委会 2 l
+经贸界 7 n
+经贸网 3 n
+经贸部 3 nt
+经费 1898 vn
+经费不足 3 l
+经费支出 3 n
+经费有限 3 n
+经费紧张 3 l
+经费自给 3 n
+经赫德 2 nr
+经起 3 v
+经轴 3 n
+经过 16218 p
+经过努力 3 l
+经过培训 3 nr
+经过训练 3 n
+经邦之 2 nr
+经邦济 19 n
+经邦纬国 3 n
+经邦论道 3 n
+经部 6 n
+经量部 28 n
+经销 152 vn
+经销商 241 n
+经销处 3 n
+经销家 3 n
+经销店 3 n
+经销权 3 n
+经销点 2 n
+经销站 3 n
+经销网 3 n
+经销者 5 n
+经销部 3 n
+经闭 3 v
+经阁 3 n
+经院 135 n
+经院哲学 3 nt
+经雨淋 2 nr
+经韦兰 2 nr
+经风雨 3 n
+经验 9803 n
+经验不足 3 i
+经验丰富 3 n
+经验主义 58 n
+经验之谈 17 i
+经验交流 3 n
+经验值 3 n
+经验型 5 n
+经验性 35 n
+经验总结 3 n
+经验教训 3 n
+经验老到 3 i
+经验论 64 n
+经验谈 8 n
+经验过程 3 n
+绐 440 g
+绑 1372 zg
+绑上去 3 v
+绑上来 3 v
+绑下 3 v
+绑下去 3 v
+绑下来 3 v
+绑住 3 v
+绑匪 21 n
+绑回 3 v
+绑回去 3 n
+绑回来 3 n
+绑定 36 v
+绑带 4 n
+绑成 3 v
+绑扎 27 v
+绑架 182 v
+绑架人质 3 n
+绑架勒索 3 n
+绑架案 5 n
+绑架者 6 n
+绑牢 3 v
+绑票 28 n
+绑紧 3 v
+绑绳 2 n
+绑缚 3 v
+绑脚 3 v
+绑腿 18 n
+绑赴 3 v
+绑起来 3 v
+绒 320 n
+绒丝 3 n
+绒头绳 2 n
+绒山羊 3 n
+绒布 33 n
+绒帽 5 n
+绒毛 207 n
+绒毛状 20 n
+绒毛玩具 3 n
+绒毡 3 n
+绒毡层 5 n
+绒毯 7 n
+绒球 20 n
+绒线 62 n
+绒线刺绣 3 n
+绒线帽 2 n
+绒线衫 14 n
+绒绒的 3 n
+绒绣 9 n
+绒绳 3 n
+绒花 27 n
+绒衣 13 n
+绒裤 3 n
+绒面 12 n
+绒面革 4 n
+绒鸟 3 n
+结 3761 n
+结上 3 n
+结下 190 v
+结不解缘 3 l
+结业 105 n
+结业典礼 3 n
+结业式 3 n
+结业生 3 n
+结业证 3 n
+结业证书 3 n
+结为 303 v
+结为一体 3 l
+结为义 2 l
+结为夫妇 3 n
+结义 146 n
+结义一 2 n
+结义为 12 n
+结义亭 2 nr
+结义兄 2 n
+结义兄弟 11 n
+结义园 2 n
+结了婚 3 v
+结交 409 v
+结交到 3 v
+结亲 94 n
+结仇 49 v
+结付 3 v
+结伙 27 n
+结伴 161 n
+结伴同游 3 n
+结伴同行 3 n
+结体 34 n
+结余 47 n
+结儿 8 n
+结党 3 n
+结党营私 39 n
+结冤 3 v
+结冰 151 n
+结冰期 32 n
+结冻 3 v
+结出 102 v
+结发 53 v
+结发夫妻 8 n
+结古镇 4 n
+结合 8462 v
+结合上皮 3 n
+结合体 22 n
+结合力 18 n
+结合处 7 n
+结合实际 3 l
+结合律 3 n
+结合态 3 n
+结合法 5 n
+结合点 42 n
+结合牙 3 n
+结合物 2 n
+结合能 52 n
+结合膜 5 n
+结合部 288 n
+结合部位 3 n
+结售汇 3 n
+结善缘 8 n
+结喉 3 n
+结在 3 v
+结块 28 n
+结坚果 3 n
+结垢 2 n
+结壳作用 3 n
+结夥抢劫 3 nr
+结大群 2 n
+结婚 2967 v
+结婚仪式 3 n
+结婚典礼 3 n
+结婚年龄 3 n
+结婚戒指 3 n
+结婚照 15 n
+结婚狂 2 n
+结婚登记 3 n
+结婚的人 3 n
+结婚纪念 3 n
+结婚网 3 n
+结婚证 43 n
+结婚证书 3 n
+结子 20 n
+结存 11 v
+结存额 3 n
+结安答 2 z
+结实 534 n
+结实率 11 n
+结实粗壮 3 l
+结对 49 v
+结对子 3 n
+结对联手 3 n
+结小群 5 n
+结尾 276 n
+结尾处 18 n
+结尾曲 3 n
+结局 803 n
+结巴 65 n
+结帐 30 n
+结幕 3 n
+结平 3 n
+结庐 12 n
+结式 3 n
+结彩 3 n
+结得 3 v
+结怨 49 v
+结息 4 n
+结成 1137 v
+结成联盟 3 j
+结扎 79 v
+结扎户 3 n
+结扎手术 3 n
+结扎术 3 n
+结拜 123 v
+结拜兄弟 3 n
+结掉 3 v
+结撰 3 v
+结断 3 v
+结新欢 2 nr
+结晶 730 n
+结晶体 29 n
+结晶器 3 n
+结晶型 3 n
+结晶学 13 n
+结晶度 17 n
+结晶性 3 n
+结晶材料 3 n
+结晶水 34 n
+结晶法 3 n
+结晶状 3 n
+结晶硅 3 n
+结末 2 n
+结束 8944 v
+结束任务 3 n
+结束位 3 n
+结束引语 3 n
+结束战斗 3 n
+结束符 8 n
+结束语 34 n
+结构 14200 n
+结构严密 3 n
+结构主义 43 n
+结构件 14 n
+结构冲突 3 n
+结构函数 3 n
+结构力学 50 n
+结构化 55 n
+结构化分析 4 l
+结构化程序 23 n
+结构化编程 3 n
+结构单元 3 n
+结构厂 2 n
+结构合理 15 n
+结构因子 3 n
+结构图 23 n
+结构型 7 n
+结构域 3 n
+结构复杂 3 l
+结构层 3 n
+结构式 41 n
+结构性 192 n
+结构特征 2 n
+结构管 3 n
+结构紧凑 2 l
+结构组件 2 n
+结构胶 3 n
+结构设计 3 n
+结构调整 3 l
+结构钢 17 n
+结构限制 3 n
+结果 13963 n
+结果习性 3 n
+结果实 3 n
+结果显示 4 n
+结果期 3 n
+结果枝 3 n
+结果表明 9 n
+结核 263 n
+结核性 3 n
+结核杆菌 24 l
+结核病 77 n
+结核菌 23 n
+结核菌素 10 n
+结案 80 n
+结案率 3 n
+结欠 3 n
+结款 3 n
+结汇 11 n
+结汇证 3 n
+结法 3 n
+结深 3 n
+结清 38 v
+结满 3 v
+结点 59 n
+结焦 3 n
+结环行器 3 n
+结球莴苣 3 n
+结电容 3 n
+结电阻 3 n
+结界 3 n
+结疤 9 n
+结痂 25 v
+结症 6 n
+结瘤 3 n
+结瘤素 3 n
+结盟 359 n
+结盟国 3 n
+结石 164 n
+结石病 3 n
+结社 103 n
+结社组织 3 n
+结社自由 3 l
+结秦晋之 3 nr
+结穗 3 n
+结穴 3 n
+结算 698 v
+结算价 3 n
+结算法 3 n
+结籽 11 n
+结素 3 n
+结纳 41 v
+结线 3 n
+结结 3 v
+结结实实 101 z
+结结巴巴 196 z
+结绳 21 n
+结绳纪事 3 n
+结绳而治 5 l
+结绳记事 3 n
+结缔 3 v
+结缔组织 139 l
+结缘 43 n
+结缡 3 nr
+结网 3 n
+结群性 3 n
+结肠 87 n
+结肠炎 27 n
+结肠癌 54 n
+结肠镜 13 n
+结脉 14 n
+结膜 75 n
+结膜炎 55 n
+结舌 10 n
+结舌杜口 3 ns
+结舌瞠目 3 vn
+结良缘 3 n
+结节 134 n
+结节性 3 n
+结节病 3 n
+结草 3 n
+结草虫 3 n
+结草衔环 11 i
+结荚 17 n
+结言 3 n
+结训 3 n
+结论 2413 n
+结论性 49 n
+结识 461 n
+结语 24 n
+结账 45 n
+结起 3 v
+结起来 3 l
+结转 21 v
+结转额 3 n
+结过 3 v
+结过婚 3 v
+结连 26 v
+结邻 3 v
+结金兰 38 nr
+结铃 3 n
+结队 43 n
+结雅河 7 n
+结集 124 v
+结集在 3 n
+结霜 3 n
+结露 2 v
+结题 4 n
+结驷连骑 3 i
+绔 333 x
+绕 3037 v
+绕到 3 v
+绕口令 10 n
+绕嘴 3 v
+绕回 3 v
+绕圈 3 n
+绕圈圈 3 n
+绕圈子 17 n
+绕圈赛 3 n
+绕城 287 ns
+绕完 3 v
+绕射求和 3 n
+绕开 93 v
+绕弯 4 v
+绕弯儿 19 n
+绕弯子 44 n
+绕往 3 v
+绕成 3 v
+绕指柔 5 ns
+绕指柔肠 3 n
+绕桩 3 v
+绕梁 11 n
+绕梁三日 3 n
+绕梁之音 3 n
+绕线 3 n
+绕线机 3 n
+绕组 104 n
+绕脖子 3 n
+绕膝 5 v
+绕舌 3 v
+绕行 77 v
+绕行道路 3 n
+绕起 3 v
+绕起来 3 v
+绕路 3 n
+绕转 3 v
+绕过 644 v
+绕过去 3 v
+绕远 7 v
+绕远儿 3 n
+绕道 353 v
+绕道而行 3 l
+绕阳河 4 ns
+绗 540 v
+绗缝机 3 vn
+绘 1929 v
+绘像 3 n
+绘具 3 n
+绘出 3 v
+绘制 523 n
+绘制图 3 n
+绘制地图 3 n
+绘图 87 n
+绘图仪 15 n
+绘图卡 3 n
+绘图员 3 n
+绘图室 3 n
+绘图机 6 n
+绘图板 7 n
+绘图法 3 n
+绘图笔 3 n
+绘图纸 6 n
+绘声 3 n
+绘声绘影 6 i
+绘声绘色 49 i
+绘形绘声 3 i
+绘影 3 n
+绘影绘声 3 i
+绘成 3 v
+绘画 1884 n
+绘画史 34 n
+绘画室 3 n
+绘画抹刀 3 i
+绘画板 3 n
+绘画类 3 n
+给 69480 p
+给与 189 v
+给予 3433 v
+给予同情 3 n
+给予帮助 3 n
+给事中 353 v
+给人以 3 v
+给付 98 v
+给你个 3 n
+给你爱 3 n
+给养 163 v
+给出 954 v
+给定 105 v
+给定日期 3 n
+给惠国 3 n
+给我发 3 n
+给排水 22 j
+给料机 3 n
+给水 94 v
+给水器 3 n
+给水团 4 n
+给水泵 3 n
+给水站 3 n
+给水管 3 n
+给水箱 3 n
+给点钱 3 v
+给煤机 3 n
+给钱 159 v
+给面子 27 n
+绚 9 zg
+绚丽 327 a
+绚丽多姿 29 i
+绚丽多彩 57 i
+绚丽夺目 5 i
+绚烂 69 a
+绚烂归于 3 l
+绛 478 b
+绛县 8 ns
+绛州 5 ns
+绛紫 3 n
+绛紫色 2 n
+绛红色 12 n
+绛色 6 n
+络 469 v
+络却 3 v
+络合 3 v
+络合作用 3 l
+络合物 59 l
+络头 3 n
+络子 16 n
+络石 2 n
+络石藤 3 n
+络离子 3 n
+络穴 3 n
+络线 3 n
+络绎 51 v
+络绎不绝 168 i
+络绎于途 3 i
+络脉 3 n
+络腮 4 b
+络腮胡 5 n
+络腮胡子 77 l
+络酸盐 3 n
+绝 4795 d
+绝不 1382 d
+绝不会 3 l
+绝不允许 3 i
+绝不放弃 3 i
+绝不比 3 v
+绝不能 3 v
+绝不食言 3 l
+绝世 128 v
+绝世佳人 3 i
+绝世无双 3 i
+绝世武功 3 i
+绝世独立 3 i
+绝世超伦 3 i
+绝交 53 v
+绝人 3 n
+绝仁弃义 3 i
+绝代 18 m
+绝代佳人 13 i
+绝代双娇 3 i
+绝代美女 3 l
+绝伦 155 n
+绝伦逸群 3 i
+绝佳 107 z
+绝俗 3 a
+绝倒 5 d
+绝其本根 3 i
+绝口 99 m
+绝口不提 3 l
+绝口不道 3 i
+绝句 125 m
+绝后 49 d
+绝后光前 3 l
+绝后空前 3 l
+绝命 6 d
+绝命书 7 n
+绝命诗 27 n
+绝品 22 n
+绝响 14 vn
+绝唱 41 v
+绝嗣 14 n
+绝国殊俗 3 n
+绝圣弃智 6 i
+绝地 99 d
+绝地大 3 d
+绝地重生 3 i
+绝域 11 n
+绝境 245 n
+绝壁 154 n
+绝处 3 d
+绝处逢生 26 i
+绝大 49 a
+绝大多数 1322 m
+绝大多数个 3 m
+绝大多数站 17 m
+绝大部分 1101 m
+绝好 61 d
+绝妙 136 a
+绝妙好词 3 i
+绝妙好辞 3 i
+绝子绝孙 16 i
+绝学 76 n
+绝密 83 a
+绝密件 3 n
+绝密文件 3 n
+绝密级 4 b
+绝对 5260 d
+绝对优势 3 l
+绝对值 72 l
+绝对几何 3 l
+绝对化 49 l
+绝对多数 3 m
+绝对性 18 n
+绝对把握 3 l
+绝对数 15 l
+绝对权 3 n
+绝对民主 3 n
+绝对温度 17 l
+绝对温标 3 l
+绝对湿度 3 l
+绝对熵 3 n
+绝对真理 29 l
+绝对空间 3 n
+绝对观念 10 n
+绝对误差 3 l
+绝对路径 3 l
+绝对过去 3 l
+绝对运动 3 l
+绝对速度 3 n
+绝对量 93 n
+绝对阈限 3 v
+绝对零度 20 l
+绝对额 3 n
+绝对高度 6 l
+绝少 54 d
+绝少分甘 3 l
+绝尘 14 n
+绝尘而去 24 i
+绝径 3 n
+绝待 3 v
+绝恋 2 v
+绝情 485 n
+绝情妻 3 n
+绝情谷 3 n
+绝户 29 m
+绝手 3 d
+绝才 3 d
+绝技 449 n
+绝招 272 m
+绝招儿 6 n
+绝收 11 v
+绝无 427 v
+绝无仅有 210 l
+绝无此事 3 l
+绝无此意 9 i
+绝早 3 d
+绝景 5 n
+绝望 898 v
+绝望已极 3 i
+绝望者 4 n
+绝杀 46 v
+绝活 56 d
+绝活儿 17 n
+绝灭 244 v
+绝热 72 a
+绝热功 3 n
+绝热层 3 n
+绝热指数 3 n
+绝热方程 3 l
+绝热材料 3 n
+绝热线 3 n
+绝热过程 26 l
+绝然 16 d
+绝爱 3 a
+绝版 10 v
+绝版书 3 n
+绝甘分少 3 l
+绝症 74 n
+绝种 39 m
+绝秘 3 a
+绝笔 40 m
+绝粒 6 m
+绝粮 3 n
+绝经 115 d
+绝经期 34 n
+绝续 3 d
+绝缘 346 n
+绝缘体 53 n
+绝缘台 3 n
+绝缘子 17 n
+绝缘导体 3 n
+绝缘层 13 n
+绝缘性 46 n
+绝缘材料 2 n
+绝缘油 3 n
+绝缘漆 3 n
+绝缘物 3 n
+绝缘纸 3 n
+绝缘线 3 n
+绝缘结 3 v
+绝缘胶布 3 n
+绝缘胶带 3 n
+绝缘节 3 n
+绝美 3 a
+绝育 20 v
+绝育手术 3 n
+绝育法 3 n
+绝色 55 n
+绝色佳人 3 i
+绝色美女 3 l
+绝艺 116 n
+绝薪止火 3 i
+绝裙而去 3 z
+绝裾而去 3 z
+绝路 92 m
+绝路相逢 3 i
+绝路逢生 2 i
+绝迹 183 n
+绝配 3 v
+绝长继短 3 i
+绝长续短 3 i
+绝长补短 3 i
+绝门 3 d
+绝非 347 d
+绝非易事 3 i
+绝顶 370 m
+绝顶聪明 3 i
+绝食 112 n
+绝食抗议 3 l
+绞 517 n
+绞上 3 n
+绞丝 3 n
+绞丝旁 3 n
+绞乱 3 n
+绞乾 3 i
+绞决 3 v
+绞出 3 v
+绞刀 3 n
+绞刑 38 n
+绞刑架 140 n
+绞动 3 n
+绞包针 3 n
+绞尽 6 v
+绞尽脑汁 67 i
+绞手 3 n
+绞扭 3 v
+绞接 3 v
+绞断 3 v
+绞杀 31 v
+绞杀战 3 i
+绞架 10 n
+绞死 33 v
+绞痛 38 n
+绞盘 149 n
+绞碎 3 v
+绞索 13 n
+绞纱 2 n
+绞结 3 v
+绞缠 3 n
+绞缢 3 v
+绞肉 3 n
+绞肉机 7 n
+绞肠痧 4 n
+绞股蓝 3 n
+绞脑汁 2 i
+绞脸 3 n
+绞起 3 v
+绞车 49 n
+绞车猫头 3 i
+绞链 3 n
+绞首 3 n
+统 2198 v
+统一 13986 vn
+统一价 4 l
+统一体 60 l
+统一作战 3 l
+统一党 40 nt
+统一分配 3 l
+统一化 3 l
+统一发票 3 l
+统一口径 3 l
+统一大业 3 l
+统一天下 3 l
+统一安排 3 nt
+统一性 67 l
+统一战线 1062 l
+统一指挥 3 l
+统一教 3 nz
+统一标准 3 n
+统一祖国 3 l
+统一经营 3 l
+统一行动 3 l
+统一规划 3 l
+统一认识 3 l
+统一论 7 l
+统万城 23 l
+统供率 2 n
+统借 3 v
+统共 19 v
+统分 16 n
+统分结合 3 l
+统制 281 v
+统包 18 v
+统合 59 v
+统合力 3 l
+统合性 3 n
+统和 31 v
+统属 3 vn
+统帅 1670 n
+统帅体制 3 n
+统帅部 184 n
+统带 3 n
+统建 3 v
+统御 14 v
+统战 65 v
+统战工作 3 l
+统战部 83 nt
+统战部长 6 l
+统战部门 3 l
+统招 20 v
+统招生 6 v
+统括 3 v
+统掌 3 v
+统揽 10 v
+统揽全局 46 l
+统摄 21 v
+统支 3 n
+统收 3 v
+统收统支 18 n
+统治 11085 v
+统治力 3 n
+统治区 433 n
+统治权 258 n
+统治者 3561 n
+统治阶级 614 l
+统治集团 3 nt
+统独 4 d
+统率 775 n
+统率力 3 l
+统理 3 vn
+统由 3 v
+统称 921 v
+统稿 3 v
+统筹 470 v
+统筹兼顾 63 l
+统筹办理 3 n
+统筹学 4 l
+统筹安排 3 n
+统筹法 6 n
+统筹规划 3 l
+统管 55 vn
+统练 3 vn
+统统 459 n
+统编 10 v
+统考 245 v
+统考成绩 3 n
+统舱 6 n
+统裙 11 n
+统观 14 n
+统觉 14 v
+统计 5381 v
+统计人员 3 n
+统计假设 3 l
+统计分析 3 l
+统计分解 3 l
+统计力学 3 nt
+统计员 9 n
+统计图 3 n
+统计图表 3 n
+统计地图 3 n
+统计学 167 nt
+统计学家 25 l
+统计局 136 nt
+统计师 3 n
+统计平衡 3 i
+统计数字 3 l
+统计数据 3 n
+统计数料 3 l
+统计权重 3 l
+统计法 13 n
+统计算法 3 n
+统计算符 3 n
+统计表 19 n
+统计调查 3 l
+统计资料 3 l
+统计链段 3 l
+统货 14 n
+统购 90 v
+统购包销 3 l
+统购派购 3 n
+统购统销 92 l
+统辖 480 v
+统还 3 v
+统选 3 v
+统通 3 vn
+统配 21 vn
+统铺 3 n
+统销 11 vn
+统领 925 v
+统驭 3 v
+绠 316 g
+绠短汲深 3 nrfg
+绠短绝泉 3 n
+绡 64 g
+绢 645 n
+绢丝 15 n
+绢丝品 3 n
+绢丝纺 3 n
+绢子 4 n
+绢布 3 n
+绢布版 3 n
+绢帛 3 n
+绢扇 7 n
+绢本 17 n
+绢画 8 n
+绢素 3 n
+绢纺 5 n
+绢纺厂 2 n
+绢绸 3 n
+绢花 26 n
+绣 4645 v
+绣像 20 v
+绣制 18 v
+绣口锦心 3 i
+绣品 15 n
+绣墩草 3 n
+绣帕 4 n
+绣房 19 n
+绣楼 2 n
+绣毯 3 n
+绣球 69 n
+绣球花 3 n
+绣球风 3 n
+绣线菊 3 n
+绣缎 4 n
+绣花 200 n
+绣花厂 3 n
+绣花机 3 n
+绣花枕头 13 i
+绣花线 3 n
+绣花网 3 nz
+绣花针 56 n
+绣花针儿 3 n
+绣花鞋 81 n
+绣虎雕龙 3 i
+绣衣 14 n
+绣起 3 v
+绣起来 3 v
+绣金匾 2 nz
+绣阁 4 n
+绣鞋 33 n
+绤 2 zg
+绥 211 ns
+绥东 19 ns
+绥中 8 ns
+绥中县 4 ns
+绥化 17 ns
+绥化地区 4 ns
+绥化市 11 ns
+绥北 4 ns
+绥宁 6 ns
+绥宁县 3 ns
+绥德 27 nrt
+绥德县 2 ns
+绥棱 3 ns
+绥棱县 3 ns
+绥江 7 ns
+绥江县 3 ns
+绥汾河 3 ns
+绥汾河市 3 ns
+绥滨 3 ns
+绥滨县 2 ns
+绥芬河 37 ns
+绥芬河市 6 ns
+绥远 132 ns
+绥远战役 2 nz
+绥远省 3 ns
+绥阳 3 ns
+绥阳县 4 ns
+绥靖 106 ns
+绥靖主义 5 ns
+绥靖区 8 ns
+绦 195 n
+绦子 8 n
+绦虫 68 n
+继 2342 v
+继世而理 3 i
+继之 116 c
+继任 284 v
+继任人 10 n
+继任者 56 n
+继位 743 v
+继发 134 v
+继发性 118 n
+继发龋 3 v
+继古开今 3 n
+继嗣 13 v
+继天立极 3 i
+继女 3 n
+继子 18 n
+继室 19 n
+继往 4 v
+继往圣之 3 i
+继往开来 56 v
+继志 3 n
+继志述事 3 n
+继成 3 v
+继承 2580 v
+继承人 397 n
+继承性 25 n
+继承权 122 n
+继承法 30 n
+继承者 119 n
+继承衣钵 3 n
+继晷 3 n
+继武 3 v
+继母 124 n
+继海 2 v
+继父 51 n
+继由 3 v
+继电 28 v
+继电保护 3 n
+继电器 108 n
+继站 3 n
+继绝 3 v
+继绝存亡 3 i
+继绝扶倾 3 i
+继继存存 3 i
+继继承承 3 n
+继继续续 3 i
+继继绳绳 3 n
+继续 14690 v
+继续下去 3 i
+继续传送 2 n
+继续前进 3 i
+继续加强 3 n
+继续发扬 3 i
+继续执行 9 n
+继续抓好 3 z
+继续移动 2 i
+继而 476 c
+继起 3 v
+继进 3 v
+继配 3 v
+绨 48 g
+绨袍之义 3 v
+绩 140 zg
+绩业 3 n
+绩优 23 b
+绩优股 9 n
+绩分 3 n
+绩学 3 n
+绩学之士 3 n
+绩差股 12 n
+绩效 247 b
+绩效奖金 3 n
+绩效考核 3 n
+绩效评价 3 n
+绩溪 12 ns
+绩溪县 5 ns
+绩线 3 n
+绪 172 ng
+绪断 3 n
+绪方 3 n
+绪言 3 n
+绪论 33 n
+绫 319 zg
+绫子 13 n
+绫波丽 3 n
+绫绢 3 n
+绫罗 58 v
+绫罗绸缎 3 n
+续 1092 v
+续书谱 2 nr
+续保 3 nr
+续修成 2 nr
+续借 9 v
+续借手续 3 n
+续假 3 n
+续写 30 v
+续凫截鹤 3 nz
+续凫断鹤 3 nr
+续加 3 v
+续古逸 5 nr
+续向西 7 nr
+续命 6 vn
+续命之 3 nr
+续命汤 3 nr
+续命灵 2 nr
+续增专 3 nr
+续大统 2 nr
+续夷坚 2 nr
+续娶 13 v
+续存 3 v
+续完 6 v
+续展 6 vn
+续建 19 nr
+续弦 41 nr
+续慎吾 2 nr
+续成汉 2 nr
+续接 6 v
+续文 3 nr
+续文献 2 nr
+续断 11 v
+续无统 2 nr
+续晋阳 3 nr
+续期 2 vn
+续殷祀 2 nr
+续流 2 n
+续湘军 2 nr
+续版 3 v
+续玄怪 2 nr
+续租 3 n
+续程 3 n
+续稿 6 n
+续签 26 v
+续篇 18 n
+续絃 3 vn
+续约 95 n
+续约维 3 nr
+续约者 3 n
+续继祖 4 nr
+续编 59 v
+续聘 59 nr
+续聘信 2 nr
+续聘华 2 nr
+续聘岳 2 nr
+续航 112 nr
+续航力 117 n
+续范亭 4 nr
+续行 3 v
+续行水 4 nr
+续行符 3 nr
+续补成 2 nr
+续表 3 n
+续订 21 v
+续订户 3 n
+续诗品 2 nr
+续读 3 v
+续费 3 vn
+续述 3 v
+续通鉴 4 nr
+续道藏 4 nr
+续随子 2 nr
+续集 45 v
+续顺公 2 nr
+续鹜短鹤 3 nz
+续齐谐 3 nr
+绮 1318 a
+绮丽 182 a
+绮云 3 nr
+绮年 3 nr
+绮年玉貌 3 nr
+绮思 3 a
+绮情 3 a
+绮想 3 nr
+绮梦 3 nr
+绮灿 3 nr
+绮窗 3 nr
+绮纨之岁 3 v
+绮罗 3 nr
+绮艳 3 a
+绮衣 3 nr
+绮语 3 nr
+绮貌 3 nr
+绮靡 13 a
+绯 274 n
+绯红 78 z
+绯红色 3 n
+绯色 17 n
+绯闻 53 n
+绰 190 n
+绰号 292 n
+绰尔河 10 ns
+绰有余力 3 i
+绰有余裕 2 i
+绰源 3 n
+绰约 23 n
+绰约多姿 5 i
+绰绰有余 99 i
+绰绰有裕 3 i
+绱 275 v
+绲 154 v
+绲边 2 n
+绳 1056 n
+绳之以法 37 i
+绳儿 3 n
+绳其祖武 3 i
+绳厥祖武 3 n
+绳圈 13 n
+绳墨 7 n
+绳墨之言 3 i
+绳套 28 n
+绳子 693 n
+绳尺 3 n
+绳带 3 n
+绳床瓦灶 3 i
+绳度 3 n
+绳扣 7 n
+绳枢瓮牖 3 n
+绳桥 3 n
+绳梯 20 n
+绳箍 3 n
+绳索 673 n
+绳线 3 n
+绳结 3 n
+绳缆 2 n
+绳网 3 n
+绳网带 3 n
+绳股 3 n
+绳趋尺步 3 n
+绳锯木断 3 i
+维 1685 v
+维乌斯 5 nrt
+维也夫 2 nr
+维也纳 742 ns
+维也纳国家歌剧院 11 nt
+维也纳爱乐乐团 7 nt
+维也纳盆 3 ns
+维亚 10 ns
+维亚凹 2 nr
+维亚切 4 nr
+维亚利 2 nr
+维亚国 3 ns
+维亚城 3 ns
+维亚尔 2 nr
+维亚州 2 ns
+维亚康姆 2 nr
+维亚科 2 nr
+维京 50 ns
+维京开 2 nr
+维京群岛 3 ns
+维他命 67 nz
+维他命丸 3 nz
+维他命源 3 nz
+维伦纽夫 3 nrt
+维伯 3 ns
+维佐峰 2 nr
+维修 1678 v
+维修中心 3 nz
+维修保养 3 nr
+维修区 3 nr
+维修厂 7 nr
+维修工 12 nr
+维修性 9 nr
+维修服务 3 n
+维修期 34 j
+维修点 6 n
+维修班 3 nr
+维修电工 3 nz
+维修站 3 nz
+维修策略 3 n
+维修组 3 n
+维修网 3 nz
+维修费 12 nr
+维修车间 3 n
+维修部 2 nr
+维修队 7 nz
+维先托 4 nr
+维克 17 nrt
+维克党 9 nr
+维克化 3 nr
+维克多 28 nrt
+维克托 25 nrt
+维克拉姆 3 nrt
+维克拉玛 2 nrt
+维克斯 47 nr
+维克派 2 nr
+维克特 83 nrt
+维克里 2 nrt
+维兰 2 ns
+维兰德 3 nr
+维内德 2 nr
+维农山 4 ns
+维几尼亚 3 ns
+维列根 11 nr
+维利 21 nz
+维利奇 3 nr
+维利希 3 nr
+维加 16 v
+维加斯 3 ns
+维勒 12 nrt
+维华 2 nz
+维南 3 ns
+维吉尔 23 nr
+维吉尼 4 nr
+维吉尼亚 3 ns
+维吉纳琴 2 nr
+维吾儿人 3 nz
+维吾尔 210 nz
+维吾尔文 22 nz
+维吾尔族 997 nz
+维吾尔语 48 nz
+维和 272 nz
+维和费 3 nz
+维和部队 3 n
+维哥湾 4 ns
+维埃 2 ns
+维埃克 2 nrt
+维埃克斯 2 nrt
+维埃利 2 nrt
+维埃拉 9 nrt
+维埃纳 2 nr
+维埃诺 4 nr
+维埃里 7 nrt
+维城典 3 ns
+维基 2 nrt
+维基亚 3 nz
+维基人 3 nrt
+维基尼亚 3 ns
+维基百 2 nz
+维基百科 3 nz
+维堡湾 2 ns
+维塔 2 nrt
+维塔利 5 nr
+维塞尔 6 nr
+维多 14 nrt
+维多利 3 nrt
+维多利亚 193 ns
+维多利亚岛 6 ns
+维多利亚州 25 ns
+维多利亚海湾 2 ns
+维多利亚港 23 ns
+维多利亚湖 44 ns
+维大惊 2 nr
+维奇 79 nrt
+维奇奥 3 nr
+维契托 2 nrt
+维奥 2 nrt
+维奥尔琴 4 nz
+维奥拉 2 nrt
+维奥蒂 3 nr
+维妙维肖 19 nr
+维娜斯 7 nr
+维季姆 3 nr
+维宝 3 nz
+维尔 56 nrt
+维尔为 2 nr
+维尔京 7 ns
+维尔京群岛 32 ns
+维尔加 8 nrt
+维尔和 2 nz
+维尔哈伦 5 nrt
+维尔城 3 ns
+维尔士 71 nr
+维尔尼亚 2 ns
+维尔岛 2 ns
+维尔帕夏 4 nrt
+维尔德 4 nrt
+维尔托 2 nrt
+维尔斯 5 nrt
+维尔斯基 4 nrt
+维尔港 3 ns
+维尔特 2 nrt
+维尔纳 20 nr
+维尔纽斯 15 nrt
+维尔芬 2 nr
+维尔茨堡 18 nrt
+维尔诺 8 nr
+维尔顿 10 nrt
+维尼亚 7 ns
+维尼亚夫 2 nrt
+维尼奥 2 nrt
+维尼熊 3 nr
+维尼纶 17 nz
+维尼龙 3 nr
+维山 5 ns
+维州 8 ns
+维希 66 nrt
+维度 34 ns
+维廖夫 5 nr
+维廷霍夫 2 nr
+维引兵 4 nr
+维德 3 nrt
+维德丽 2 nr
+维德曼 11 nr
+维恭维谨 3 nr
+维托斯 2 nrt
+维护 5477 v
+维护员 2 n
+维护和平 3 n
+维护团结 3 n
+维护型 3 n
+维护性 9 n
+维护正义 3 nz
+维护程序 4 n
+维护系数 3 n
+维护者 33 n
+维护费 2 n
+维护费用 3 n
+维护阶段 3 n
+维护陷阱 3 n
+维护集体 3 n
+维护面板 3 n
+维拉 57 nrt
+维拉利 3 ns
+维拉尔 6 nrt
+维拉弗 2 nr
+维拉斯 4 nrt
+维拉港 9 ns
+维拉潘 3 nrt
+维拉特 12 nrt
+维拉第 2 nr
+维拉队 3 nz
+维持 3803 v
+维持下去 3 i
+维持不敝 3 i
+维持会 28 n
+维持原判 3 n
+维持性 3 n
+维持承受 3 nr
+维持现状 3 n
+维持秩序 3 nr
+维持费 9 n
+维捷布斯克 4 nrt
+维提岛 6 nr
+维摩 3 nrt
+维文 11 nz
+维斯 10 nrt
+维斯图 2 nr
+维斯基 4 nrt
+维斯塔 3 nrt
+维斯孔 3 nr
+维斯宁 6 nr
+维斯帕 2 nr
+维斯杜 4 nr
+维斯杜拉 3 nrt
+维斯比 14 nrt
+维斯特 6 nrt
+维斯瓦 5 nrt
+维斯瓦河 30 ns
+维斯马 2 nz
+维新 300 v
+维新派 140 nr
+维新运动 31 nz
+维族 34 nz
+维权 120 n
+维权网 3 nz
+维权行动 3 nz
+维杜卡 2 nrt
+维杰夫 3 nr
+维查峰 2 nr
+维柯 3 nz
+维柳伊 3 nr
+维根 6 nz
+维格 2 nrt
+维格曼 5 nr
+维格纳 2 nr
+维格诺尔 11 nrt
+维棉布 3 nr
+维森特 114 nr
+维止录 3 nr
+维沙卡 9 ns
+维沙卡帕 3 nrt
+维流形 4 n
+维涅隆 2 nr
+维滕贝格 2 nz
+维特 43 nrt
+维特之 6 nr
+维特伯爵 3 nr
+维特向量 3 n
+维特曼 2 nr
+维特根斯坦 4 nrt
+维珍 21 nr
+维琴察 4 nr
+维琴尼亚 3 ns
+维琴查 2 nr
+维瓦尔 2 nr
+维瓦尔第 3 nrt
+维甘 10 j
+维生 13 v
+维生物 3 n
+维生素 1933 nr
+维生素甲 3 nr
+维生素缺 3 nr
+维甲酸 3 nz
+维留琴 2 nr
+维登堡 7 nr
+维登科 13 nr
+维科 3 nz
+维科夫 7 nr
+维科德 2 nr
+维空间 3 n
+维管束 60 n
+维米尔 2 nrt
+维系 257 n
+维系人心 3 n
+维索 7 v
+维索斯 2 nr
+维纳 21 nrt
+维纳尔 4 nr
+维纳布尔 3 nrt
+维纳恩湖 5 nr
+维纳斯 76 nr
+维纳河 3 ns
+维纳滤波 2 nz
+维纶 24 nz
+维经斯 2 nr
+维维 14 nz
+维维安 5 nr
+维维集团 5 nt
+维绵平 2 nr
+维罗尼 3 nr
+维罗纳 27 nr
+维翰为 3 nr
+维耶 10 nrt
+维耶里 14 nrt
+维舍特 4 nr
+维艰 17 nr
+维苏威 31 nr
+维茨 12 nrt
+维茨基 2 nrt
+维莱 2 nrt
+维萨 4 nrt
+维萨克 5 nr
+维萨卡 5 nr
+维萨波 7 nr
+维萨里 5 nrt
+维蒂 4 nrt
+维蒂希 12 nr
+维西 8 ns
+维西傈僳族自治县 4 ns
+维西克 5 nr
+维西县 2 ns
+维语 19 nz
+维诺克拉 2 nrt
+维诺格 6 nr
+维贾亚 9 nr
+维贾亚纳 5 nr
+维贾伊 2 nr
+维辛斯 2 nr
+维辛斯基 4 nrt
+维达 48 nz
+维达尔 10 nr
+维迪加尔 2 nrt
+维迪奇 2 nr
+维迪斯 3 nrt
+维道 3 v
+维那 3 ns
+维那斯 3 nrt
+维采湖 2 nr
+维金人 8 nr
+维雪克 2 nr
+维面 3 n
+维黎曼 2 nr
+维龙加 7 ns
+绵 360 ns
+绵亘 54 v
+绵力 5 n
+绵力薄材 3 i
+绵子 3 n
+绵密 43 ns
+绵延 571 v
+绵延不尽 3 i
+绵延不断 10 i
+绵弱 3 a
+绵白糖 2 n
+绵竹 57 ns
+绵竹县 4 ns
+绵竹市 3 ns
+绵絮 3 n
+绵纸 14 n
+绵线 3 n
+绵织 3 v
+绵绵 139 z
+绵绵不断 3 l
+绵绵不绝 26 l
+绵绵地 3 z
+绵绵细语 3 i
+绵绵细雨 3 l
+绵绸 3 n
+绵羊 281 ns
+绵羊毛 6 n
+绵羊肉 3 n
+绵萆薢 3 z
+绵薄 20 a
+绵薄之力 3 i
+绵言细语 3 i
+绵诱癌素 3 n
+绵软 50 z
+绵远 3 a
+绵连 3 ns
+绵里薄材 3 i
+绵里藏针 26 n
+绵里针 12 n
+绵长 61 n
+绵阳 65 ns
+绵阳市 28 ns
+绵马贯众 3 i
+绶 90 ng
+绶带 19 n
+绶带鸟 3 n
+绷 444 v
+绷住 3 v
+绷场面 3 n
+绷子 4 n
+绷子床 3 n
+绷带 179 n
+绷床 3 n
+绷开 3 v
+绷直 3 v
+绷着 3 v
+绷着劲 3 v
+绷着脸 3 v
+绷着脸儿 3 n
+绷硬 3 v
+绷簧 2 n
+绷紧 86 v
+绷紧神经 3 n
+绷脸 3 n
+绷裂 3 v
+绸 333 n
+绸伞 17 n
+绸子 52 n
+绸密 3 n
+绸巾 26 n
+绸布 25 n
+绸带 116 n
+绸纹纸 3 n
+绸缎 203 n
+绸缎庄 3 v
+绸缪 14 n
+绸缪帷幄 3 n
+绸缪束薪 3 nr
+绹 8 zg
+绺 180 q
+绻 229 x
+综 256 vn
+综上 3 n
+综上所叙 3 n
+综上所述 109 c
+综丝 3 n
+综合 8250 vn
+综合体 81 n
+综合信息 3 nt
+综合利用 3 l
+综合化 33 j
+综合区 4 n
+综合司 50 nt
+综合国力 239 l
+综合型 19 n
+综合处 22 l
+综合大学 30 nt
+综合奖 3 n
+综合局 3 nt
+综合征 435 n
+综合性 1536 n
+综合执法 3 n
+综合排名 3 l
+综合楼 15 n
+综合治理 589 l
+综合法 14 n
+综合派 14 n
+综合测试 3 n
+综合消 3 l
+综合症 78 n
+综合种 3 n
+综合类 24 n
+综合者理 3 l
+综合语 3 l
+综合课 2 n
+综合部 6 nt
+综合题 3 n
+综括 17 v
+综指 19 j
+综揽 3 v
+综核 3 vn
+综核名实 3 l
+综治 6 vn
+综治办 4 n
+综治委 4 nt
+综艺 44 n
+综艺大观 3 l
+综艺片 3 l
+综艺秀 3 n
+综艺节目 3 l
+综观 116 n
+综览 2 vn
+综计 3 vn
+综论 4 c
+综述 106 vn
+综采 8 j
+绽 437 vg
+绽出 17 v
+绽开 83 v
+绽放 94 v
+绽破 3 v
+绽裂 3 v
+绾 635 v
+绿 3701 a
+绿丛丛 3 nr
+绿丝 2 n
+绿丹兰 3 nr
+绿乔木 5 nr
+绿光 21 n
+绿党 19 n
+绿化 1052 n
+绿化区 4 n
+绿化带 151 n
+绿化率 9 n
+绿化祖国 3 n
+绿化费 3 n
+绿化运动 3 nz
+绿区 3 n
+绿十字 3 nz
+绿博会 3 nr
+绿卡 19 n
+绿原 3 n
+绿叶 183 n
+绿叶子 3 n
+绿叶成荫 3 n
+绿叶成阴 3 n
+绿叶菜 3 n
+绿园区 3 n
+绿地 174 n
+绿地区 3 n
+绿地效果 3 n
+绿地率 3 n
+绿地系统 3 l
+绿地面积 3 n
+绿城 86 n
+绿城队 20 n
+绿头巾 2 n
+绿头鸭 14 n
+绿女红男 3 nr
+绿孔雀 14 nr
+绿宝石 47 nr
+绿山 5 n
+绿山富民 3 nr
+绿岛 22 n
+绿岩 21 n
+绿巨人 3 nr
+绿帘石 18 n
+绿带 3 n
+绿带城市 3 n
+绿帽 3 n
+绿帽子 21 n
+绿幽灵 3 nr
+绿廊 3 n
+绿影 4 n
+绿影扶疏 3 n
+绿惨红愁 3 i
+绿惨红销 3 i
+绿意 63 n
+绿意盎然 3 l
+绿旗 2 n
+绿春 3 nr
+绿春县 2 nr
+绿暗红稀 3 l
+绿杨乡 3 nr
+绿杨村 3 nr
+绿杨树 2 nr
+绿松石 290 nr
+绿林 220 n
+绿林中 7 nr
+绿林军 3 nr
+绿林大盗 3 n
+绿林好汉 14 nr
+绿林强盗 3 n
+绿林豪士 3 nr
+绿林豪客 3 nr
+绿林豪杰 3 nr
+绿林起义 17 nz
+绿枝 3 n
+绿柱石 42 nr
+绿柳 6 n
+绿树 80 n
+绿树丛 2 nr
+绿树成荫 21 l
+绿森森 5 nr
+绿毒 3 n
+绿毛 6 n
+绿毛龟 3 nr
+绿水 54 n
+绿水长流 13 n
+绿水青山 3 nr
+绿沉沉 3 z
+绿油油 45 n
+绿油精 3 n
+绿波 5 n
+绿泥石 41 n
+绿洲 388 n
+绿洲耕作 3 n
+绿浪 8 nz
+绿海 4 n
+绿灯 65 n
+绿灯户 3 n
+绿珠 4 n
+绿珠篇 3 n
+绿班 3 n
+绿球藻 3 n
+绿生生 3 n
+绿皮 11 n
+绿皮书 17 n
+绿盈盈 8 nr
+绿盟 5 n
+绿矾 3 n
+绿窗 6 n
+绿竹 117 n
+绿竹翁 3 nr
+绿笔 3 n
+绿篱 15 n
+绿绿 3 nr
+绿绿的 4 z
+绿肥 76 n
+绿肥作物 29 l
+绿肥红瘦 5 z
+绿脓 3 v
+绿脓杆菌 3 n
+绿色 2851 n
+绿色兵团 3 n
+绿色奥运 3 nz
+绿色工程 3 n
+绿色建材 3 n
+绿色植物 86 l
+绿色版 3 n
+绿色生态 3 n
+绿色蔬菜 3 nz
+绿色蚂蚁 3 l
+绿色软件 3 l
+绿色通道 3 n
+绿色革命 3 nz
+绿色食品 3 n
+绿芽 3 n
+绿苔 32 n
+绿茵 33 nr
+绿茵场 41 n
+绿茵茵 13 nr
+绿茵阁 3 nr
+绿茶 139 n
+绿茶粉 3 nr
+绿茸茸 8 z
+绿草 3 n
+绿草如茵 19 i
+绿荧荧 2 nr
+绿荫 66 n
+绿荫蔽日 3 i
+绿莹莹 24 z
+绿营 110 vn
+绿萼 596 n
+绿葱葱 2 nr
+绿蒂 11 nrt
+绿蓑青笠 3 i
+绿蔷薇 3 nr
+绿藻 91 n
+绿衣 107 n
+绿衣人 3 n
+绿衣使者 3 n
+绿衣黄里 3 n
+绿衫 7 n
+绿袖 2 n
+绿装 7 n
+绿褐色 3 n
+绿谷 2 n
+绿豆 709 n
+绿豆汤 20 nz
+绿豆沙 3 nr
+绿豆牙 3 nr
+绿豆稀饭 3 l
+绿豆粉 4 nz
+绿豆粥 2 nz
+绿豆糕 7 n
+绿豆芽 21 nr
+绿豆蛙 3 n
+绿豆蝇 3 n
+绿豆象 2 n
+绿速达 3 nz
+绿酒红灯 3 n
+绿野 18 n
+绿野仙踪 8 i
+绿闪 3 z
+绿阴 2 n
+绿霉素 3 n
+绿领巾 3 nr
+绿鬓朱颜 3 i
+绿鬓红颜 3 i
+绿黄色 7 n
+缀 333 v
+缀出 3 n
+缀合 3 n
+缀字 3 n
+缀字成文 3 n
+缀文 2 n
+缀文之士 3 n
+缀点 3 n
+缀网 3 n
+缀补 3 n
+缀辑 3 n
+缀连 3 n
+缀集 3 n
+缁 1657 g
+缂 225 x
+缂丝 36 n
+缃 210 g
+缄 63 vg
+缄口 3 vn
+缄口不言 3 v
+缄口不语 3 v
+缄口无言 3 z
+缄口结舌 3 v
+缄密 3 v
+缄封 3 v
+缄默 190 v
+缄默无言 3 nz
+缄默无语 3 nz
+缅 516 zg
+缅共 3 v
+缅北 3 ns
+缅因 51 ns
+缅因州 19 ns
+缅怀 234 ns
+缅思 3 v
+缅想 3 v
+缅甸 871 ns
+缅甸人 11 nz
+缅甸政府 10 nt
+缅甸联邦 11 nt
+缅甸语 6 nz
+缅西 3 ns
+缅语 3 nz
+缆 127 n
+缆柱 3 n
+缆索 24 n
+缆线 8 n
+缆绳 70 n
+缆舟 3 n
+缆船 3 n
+缆车 80 n
+缆车线 3 n
+缆车道 3 n
+缇 243 g
+缈 112 x
+缉 236 v
+缉办 3 v
+缉手 3 v
+缉拿 44 v
+缉拿归案 3 n
+缉拿罪犯 3 n
+缉捕 188 v
+缉捕归案 3 n
+缉查 7 vn
+缉毒 45 v
+缉盗 3 v
+缉私 67 v
+缉私局 3 n
+缉私船 3 n
+缉私艇 3 n
+缉私警察 4 n
+缉私队 11 n
+缉获 5 v
+缊 2 zg
+缋 43 g
+缌 139 g
+缌麻服 3 z
+缍 44 zg
+缎 461 ng
+缎子 123 n
+缎带 28 n
+缎带花 3 n
+缎木 3 n
+缎条 2 n
+缎纹 3 n
+缎补服 3 n
+缎被 3 n
+缎面 17 n
+缏 63 zg
+缑 21 g
+缒 189 v
+缓 1824 v
+缓一缓 16 d
+缓不济急 7 a
+缓交 11 v
+缓付 3 v
+缓兵 3 v
+缓兵之计 58 i
+缓冲 194 v
+缓冲体 3 n
+缓冲作用 3 i
+缓冲值 3 n
+缓冲剂 5 n
+缓冲区 38 n
+缓冲器 12 n
+缓冲国 3 i
+缓冲地 3 z
+缓冲地区 3 n
+缓冲地带 3 i
+缓冲基金 3 nz
+缓冲存储器 13 n
+缓冲容量 3 i
+缓冲寄存器 2 n
+缓冲带 3 n
+缓冲式 3 n
+缓冲强度 3 i
+缓冲指数 3 i
+缓冲接头 3 i
+缓冲期 6 n
+缓冲液 2 n
+缓冲溶液 3 n
+缓冲范围 3 n
+缓减 8 v
+缓凝 3 v
+缓凝剂 3 n
+缓刑 184 v
+缓办 3 v
+缓口气 5 i
+缓召 3 v
+缓和 857 a
+缓和剂 3 n
+缓和疼痛 3 i
+缓坡 49 v
+缓存 245 v
+缓存数据 4 n
+缓延 3 v
+缓建 4 v
+缓役 3 v
+缓征 10 v
+缓急 85 a
+缓急相济 3 i
+缓急轻重 3 z
+缓慢 1512 d
+缓慢行走 3 i
+缓手 13 v
+缓期 47 d
+缓查 3 v
+缓步 319 d
+缓步代车 3 n
+缓步而行 3 i
+缓气 3 a
+缓流 3 v
+缓滞 3 v
+缓激肽 3 n
+缓缓 2078 d
+缓缓的 177 z
+缓缓而行 3 i
+缓蚀剂 18 n
+缓行 32 v
+缓解 1111 v
+缓解平息 3 i
+缓议 3 v
+缓释 7 v
+缓释片 3 n
+缓释肥料 3 i
+缓颊 3 n
+缔 31 n
+缔交 4 v
+缔合 23 v
+缔构 3 n
+缔盟 3 n
+缔约 68 n
+缔约国 186 n
+缔约方 8 n
+缔约过失 3 n
+缔结 1195 v
+缔造 206 v
+缔造者 93 n
+缕 235 q
+缕析 3 v
+缕缕 90 z
+缕述 3 v
+缕陈 3 v
+编 3374 v
+编上 3 v
+编上去 3 v
+编上来 3 v
+编下 3 v
+编下去 3 v
+编下来 3 v
+编为 3 v
+编书 3 n
+编余 5 n
+编余人员 3 l
+编作 3 v
+编修 287 v
+编入 293 v
+编入目录 3 n
+编入索引 3 n
+编内 6 n
+编写 953 v
+编写出 3 v
+编写成 3 v
+编写教材 3 n
+编写程序 3 n
+编写组 8 n
+编写者 11 n
+编凑 3 v
+编出 3 v
+编出来 3 v
+编列 17 v
+编列出 3 v
+编创 8 n
+编到 3 v
+编制 2926 v
+编制工作 4 n
+编制成 3 v
+编制数 5 n
+编制法 2 n
+编制程序 3 n
+编制者 2 n
+编剧 502 n
+编剧奖 3 n
+编印 311 n
+编发 17 v
+编号 402 n
+编号栏 3 n
+编号款目 3 n
+编号版本 3 n
+编后 21 n
+编后记 3 n
+编后语 171 n
+编址 4 n
+编外 25 v
+编外人员 3 n
+编好 3 v
+编委 56 n
+编委会 59 j
+编安 3 n
+编定 3 v
+编审 59 v
+编审委员 3 n
+编导 339 n
+编导家 3 n
+编导者 10 n
+编年 31 n
+编年体 58 n
+编年史 84 n
+编录 34 n
+编得 3 v
+编戏 3 n
+编成 760 v
+编户 3 n
+编报 5 n
+编排 279 v
+编排节目 3 n
+编播 3 v
+编撰 170 v
+编撰者 7 n
+编曲 6 n
+编曲人 3 n
+编条 3 n
+编来编去 3 l
+编构 3 n
+编构出 3 n
+编校 9 n
+编档 3 n
+编次 68 n
+编歌 3 n
+编法 3 n
+编派 23 n
+编演 44 v
+编物 3 n
+编班 3 n
+编班法 3 n
+编目 65 n
+编目员 2 n
+编目条例 3 n
+编目者 3 n
+编目草片 3 n
+编目表格 3 n
+编目记录 3 n
+编目部 3 n
+编码 327 n
+编码员 3 n
+编码器 16 n
+编码序列 3 n
+编码数据 3 n
+编码方式 6 n
+编码方案 3 n
+编码方法 4 n
+编码本 3 n
+编码标准 3 n
+编码法 2 n
+编码表示 3 n
+编码链 3 n
+编磬 4 n
+编程 303 n
+编程人员 5 n
+编程器 3 n
+编程序 5 n
+编程技术 3 n
+编程设计 3 n
+编程语言 5 n
+编笆造模 3 n
+编算 3 v
+编算出 3 n
+编篡者 3 r
+编纂 484 v
+编纂会 12 n
+编纂家 3 n
+编纂者 14 n
+编练 3 n
+编组 325 n
+编组站 55 n
+编织 405 n
+编织厂 3 n
+编织品 11 n
+编织布 3 n
+编织带 3 n
+编织成 3 n
+编织机 3 n
+编织物 5 n
+编织绳 3 n
+编织袋 24 n
+编结 103 v
+编绘 25 v
+编缉 2 v
+编者 171 n
+编者按 158 n
+编者案 3 n
+编者注 3 l
+编者的话 3 l
+编著 104 n
+编著者 2 n
+编解码 3 n
+编解码器 3 n
+编订 43 v
+编订者 3 n
+编译 343 v
+编译人员 3 n
+编译器 45 n
+编译局 8 n
+编译成 3 n
+编译程序 37 n
+编译系统 3 n
+编译语言 6 n
+编译馆 5 n
+编读 3 v
+编贝 3 n
+编起 3 v
+编起来 3 v
+编辑 21691 n
+编辑出版 3 n
+编辑卡 3 n
+编辑器 25 n
+编辑室 13 n
+编辑整理 3 n
+编辑文档 4 n
+编辑框 3 n
+编辑组 3 n
+编辑者 1061 n
+编辑表格 3 n
+编辑部 191 n
+编过 3 v
+编述 3 v
+编选 82 v
+编选出 3 n
+编选者 6 n
+编造 202 v
+编造出 3 n
+编造谎言 3 n
+编遣 3 v
+编配 79 v
+编采 8 v
+编钟 725 n
+编错 3 v
+编队 505 n
+编集 38 v
+缗 91 q
+缘 2041 n
+缘于 87 p
+缘份 32 n
+缘会 3 n
+缘何 90 r
+缘分 133 n
+缘分已尽 3 i
+缘因 3 n
+缘悭一面 3 v
+缘悭分线 3 v
+缘悭命蹇 3 v
+缘情体物 3 n
+缘故 965 n
+缘文生义 3 n
+缘木求鱼 6 n
+缘根 3 n
+缘法 3 n
+缘浅 3 n
+缘浓情深 3 n
+缘海 3 n
+缘由 456 p
+缘簿 4 n
+缘缘 3 n
+缘缘堂 8 n
+缘自 13 r
+缘花城 3 n
+缘薄 3 n
+缘起 81 v
+缘起缘灭 3 i
+缙 238 n
+缙云 14 ns
+缙云县 3 ns
+缙云山 17 ns
+缙绅 146 n
+缚 1118 vg
+缚住 3 n
+缚成 3 n
+缚手无策 3 n
+缚手缚脚 36 n
+缚牢 3 n
+缚紧 3 n
+缚起来 3 n
+缚鸡之力 47 n
+缛 41 g
+缛丽 3 i
+缛礼烦仪 3 i
+缛节 3 i
+缜 46 zg
+缜密 132 a
+缜密性 3 vn
+缝 1472 v
+缝上 22 n
+缝上去 3 v
+缝上来 3 v
+缝下 3 n
+缝下去 3 v
+缝下来 3 v
+缝个 3 n
+缝住 3 v
+缝做 3 v
+缝儿 3 n
+缝到 3 v
+缝制 110 n
+缝制成 3 v
+缝反 3 v
+缝口 9 n
+缝合 84 v
+缝合处 3 n
+缝合线 23 n
+缝好 3 v
+缝子 12 n
+缝工 3 n
+缝成 3 v
+缝来缝去 3 v
+缝死 3 v
+缝法 3 n
+缝点 3 n
+缝穷 3 v
+缝纫 66 n
+缝纫工 5 n
+缝纫机 110 n
+缝纫线 3 n
+缝线 19 n
+缝缀 14 v
+缝缝 13 n
+缝缝补补 8 v
+缝缝连连 3 nz
+缝衣服 3 n
+缝衣机 3 n
+缝衣浅带 3 vn
+缝衣针 6 n
+缝补 71 v
+缝起 3 v
+缝起来 3 v
+缝里 3 n
+缝釦子 3 v
+缝针 8 n
+缝际 3 n
+缝隙 445 n
+缝隙天线 3 v
+缝隙连接 3 nr
+缟 125 g
+缟素 37 n
+缟纻之交 3 n
+缟衣 3 n
+缠 1539 v
+缠上去 3 v
+缠上来 3 v
+缠住 238 v
+缠回 3 v
+缠夹 34 n
+缠夹不清 3 i
+缠手 2 v
+缠扰 6 v
+缠斗 79 v
+缠来缠去 3 i
+缠筑 3 v
+缠结 5 v
+缠绕 265 v
+缠绕式 3 nz
+缠绕机 3 nz
+缠绕植物 3 n
+缠绕着 3 i
+缠绕管 3 nz
+缠绕膜 3 nz
+缠绕茎 4 n
+缠绵 234 a
+缠绵床褥 3 nz
+缠绵悱恻 13 i
+缠绵蕴藉 3 vn
+缠缚 3 v
+缠缠绵绵 3 z
+缠脚 3 v
+缠裹 3 v
+缠讼 3 v
+缠足 54 a
+缠身 91 v
+缠身缠脚 3 i
+缡 137 g
+缢 120 g
+缢死 3 n
+缢痕 3 n
+缢缩 3 n
+缢蛏 15 n
+缣 72 g
+缤 47 z
+缤纷 91 z
+缤纷多彩 2 z
+缤纷色彩 3 l
+缥 45 a
+缥渺 5 a
+缥缈 167 a
+缦 63 zg
+缧 77 x
+缧絏 3 n
+缧绁 5 n
+缧绁之忧 3 v
+缨 153 ng
+缨冠 3 n
+缨子 14 n
+缨帽 4 n
+缨穗 2 n
+缨簪 3 n
+缨络 3 n
+缩 2024 v
+缩下 3 v
+缩下去 3 v
+缩下来 3 v
+缩写 216 v
+缩写字母 3 n
+缩写成 3 v
+缩写本 3 n
+缩减 222 v
+缩减到 3 i
+缩减成 3 i
+缩减者 3 n
+缩到 3 v
+缩印 7 v
+缩印本 7 n
+缩叶病 2 n
+缩合 3 v
+缩回 228 v
+缩回去 3 i
+缩回来 3 i
+缩图 3 v
+缩在 3 v
+缩地补天 3 i
+缩头 82 v
+缩头乌龟 3 n
+缩头缩尾 3 i
+缩头缩脑 9 i
+缩头缩颈 3 n
+缩孔 2 n
+缩小 1347 v
+缩小差别 3 i
+缩小差距 3 n
+缩小成 3 v
+缩少 3 v
+缩尺 2 n
+缩影 116 n
+缩影本 3 n
+缩影片 3 n
+缩微 55 v
+缩微卡 3 n
+缩微平片 3 n
+缩微本 3 n
+缩微胶卷 3 n
+缩微胶片 7 n
+缩慄 3 vn
+缩成 3 v
+缩成一团 48 i
+缩手 126 v
+缩手缩脚 24 i
+缩折伞 3 v
+缩排 3 v
+缩放 3 v
+缩放仪 3 n
+缩样 3 n
+缩水 190 v
+缩水率 4 n
+缩略 6 n
+缩略图 3 n
+缩略词 3 n
+缩略语 9 n
+缩瞳 3 v
+缩瞳剂 3 n
+缩瞳药 3 n
+缩短 976 v
+缩短成 3 v
+缩短距离 3 n
+缩砂密 3 n
+缩窄性 3 vn
+缩简 3 v
+缩紧 12 v
+缩绒 3 n
+缩编 37 v
+缩缩 3 v
+缩缩头 3 n
+缩聚 84 v
+缩聚反应 3 n
+缩聚染料 3 n
+缩脖子 10 n
+缩行 3 v
+缩衣啬食 3 n
+缩衣节口 3 n
+缩衣节食 3 n
+缩起 3 v
+缩起来 3 v
+缩进 31 v
+缩酮 3 n
+缩醛 41 n
+缩醛树脂 3 n
+缩量 8 n
+缩阳 3 n
+缩阳入腹 3 i
+缩颈 3 n
+缪 90 nr
+缪云台 4 nr
+缪俄古 16 nr
+缪天瑞 2 nr
+缪寿良 4 nr
+缪尔波 2 nr
+缪尔达 4 nr
+缪文远 4 nr
+缪昌期 6 nr
+缪种流传 3 v
+缪称训 2 nr
+缪色奥 16 nr
+缪荃孙 8 nr
+缪补逸 2 nr
+缪达尔 3 nr
+缫 74 v
+缫丝 124 n
+缫丝厂 21 n
+缫丝机 2 n
+缬 98 g
+缬氨酸 6 n
+缬沙坦 6 n
+缬草 3 n
+缭 85 v
+缭乱 12 v
+缭绕 196 v
+缮 252 v
+缮修 3 v
+缮写 36 v
+缮写员 3 v
+缮甲治兵 3 v
+缮稿 3 v
+缯 65 g
+缰 310 n
+缰绳 312 n
+缱 206 x
+缱绻 18 a
+缲 2 v
+缳 2 g
+缴 484 v
+缴交 7 v
+缴付 21 v
+缴入 19 v
+缴公粮 3 n
+缴出 3 v
+缴出去 3 v
+缴出来 3 v
+缴卷 3 v
+缴售 3 v
+缴回 3 v
+缴存 28 v
+缴库 3 v
+缴掉 3 v
+缴枪 25 v
+缴枪不杀 3 v
+缴械 74 v
+缴械投降 3 n
+缴欠 3 v
+缴款 13 v
+缴款单 3 n
+缴款通知 3 n
+缴清 6 v
+缴白卷 3 n
+缴租 2 v
+缴税 38 v
+缴税单 3 n
+缴税通知 3 n
+缴纳 513 v
+缴获 232 v
+缴费 66 v
+缴费单 3 n
+缴费卡 3 n
+缴费通知 3 n
+缴过 3 v
+缴过去 3 v
+缴过来 3 v
+缴送 4 v
+缴销 5 v
+缴验 3 v
+缴齐 3 v
+缵 10 g
+缶 84 zg
+缶掌 2 v
+缸 803 n
+缸体 8 n
+缸内 3 n
+缸外 3 n
+缸子 26 n
+缸房 3 n
+缸瓦 3 n
+缸盆 3 n
+缸盖 13 n
+缸砖 3 n
+缸管 3 n
+缸鼓 3 n
+缺 2504 v
+缺一不可 65 i
+缺三少四 3 i
+缺乏 4171 v
+缺乏幽默 3 n
+缺乏性 17 n
+缺乏教养 3 n
+缺乏活力 3 n
+缺乏症 36 n
+缺乏经验 3 n
+缺乏自信 3 i
+缺乏营养 3 n
+缺乏食物 3 n
+缺人 3 n
+缺什么 3 l
+缺位 60 n
+缺刻 28 n
+缺勤 15 n
+缺医少药 13 n
+缺口 841 n
+缺口处 18 n
+缺口翻译 3 l
+缺口镊子 3 v
+缺吃少喝 3 l
+缺吃少穿 8 i
+缺吃短穿 3 i
+缺员 3 n
+缺嘴 3 v
+缺失 285 v
+缺失损失 3 v
+缺如 20 v
+缺字 5 n
+缺少 1951 v
+缺少美 3 n
+缺席 269 n
+缺席判决 3 n
+缺席率 3 n
+缺席者 16 n
+缺得 3 v
+缺德 62 n
+缺德事 12 n
+缺德少才 3 n
+缺德鬼 3 n
+缺心少肺 3 l
+缺心眼 3 i
+缺心眼儿 3 l
+缺憾 171 n
+缺损 101 v
+缺料 3 n
+缺斤少两 4 i
+缺斤短两 9 i
+缺月再圆 3 i
+缺期期次 3 l
+缺根弦 3 i
+缺档 2 v
+缺欠 15 v
+缺氧 245 v
+缺氧保藏 3 n
+缺氧性 7 n
+缺水 173 n
+缺水量 2 n
+缺油 3 n
+缺漏 56 v
+缺点 780 n
+缺点错误 3 v
+缺牙间隙 3 n
+缺电 3 n
+缺疑 3 v
+缺盆 3 n
+缺省 5 n
+缺省值 3 v
+缺粮 3 n
+缺级 3 n
+缺编 13 v
+缺考 3 v
+缺苗 3 n
+缺血 99 v
+缺血性 34 n
+缺衣少穿 3 i
+缺衣少食 7 n
+缺衣无食 3 i
+缺词 3 n
+缺课 11 v
+缺课纪录 3 n
+缺货 43 n
+缺货量 3 n
+缺钙 3 n
+缺钱 3 v
+缺铁性 30 n
+缺门 2 n
+缺阵 69 v
+缺陷 993 v
+缺陷晶体 3 n
+缺陷率 5 n
+缺陷美 3 i
+缺集 3 v
+缺页 5 n
+缺页数 3 n
+缺页频率 3 n
+缺项 3 n
+缺额 47 n
+缺食无衣 3 i
+缼 2 zg
+罂 42 n
+罂粟 187 n
+罂粟壳 3 n
+罂粟碱 3 n
+罂粟科 3 n
+罂粟花 23 n
+罄 157 vg
+罄其所有 3 i
+罄击子 3 i
+罄尽 3 i
+罄竭 3 i
+罄竹难书 7 i
+罄笔难书 3 i
+罅 139 zg
+罅口 3 n
+罅漏 2 n
+罅隙 6 n
+罉 2 zg
+罍 13 zg
+罐 734 n
+罐中 22 s
+罐体 3 n
+罐儿 22 n
+罐内 16 s
+罐头 389 n
+罐头厂 14 n
+罐头瓶 4 n
+罐头盒 6 n
+罐头笑声 3 n
+罐头食品 3 n
+罐子 747 n
+罐式 6 n
+罐盖 3 n
+罐笼 12 n
+罐装 20 n
+罐车 4 n
+网 7209 n
+网上 2495 s
+网上交易 3 n
+网上交谈 3 i
+网上冲印 3 i
+网上医院 3 nt
+网上商城 3 n
+网上商店 3 n
+网上垃圾 3 n
+网上学校 3 n
+网上家园 3 n
+网上店铺 3 n
+网上开房 3 n
+网上恋情 3 n
+网上支付 3 n
+网上教育 3 l
+网上游戏 3 n
+网上激情 3 n
+网上生活 3 n
+网上相册 3 i
+网上神游 3 n
+网上网 20 n
+网上聊 3 i
+网上聊天 3 i
+网上药店 3 n
+网上行 3 n
+网上见 3 n
+网上课堂 3 n
+网上谈情 3 n
+网上贸易 3 l
+网上超市 3 ns
+网上邻 3 n
+网上邻居 3 i
+网上银行 3 nt
+网下 11 s
+网丝 3 n
+网中之鱼 4 l
+网中网 3 n
+网主 3 n
+网事 3 n
+网人 3 n
+网位 3 n
+网住 4 v
+网儿 3 n
+网兜 18 n
+网关 32 n
+网兵 3 n
+网具 261 n
+网内 3 s
+网内通话 3 n
+网前球 10 n
+网协 9 j
+网卡 53 n
+网友 1634 n
+网友世界 3 nz
+网友会 3 n
+网友聚会 3 nz
+网变换 3 l
+网口 5 s
+网号 3 n
+网名 34 n
+网吧 335 n
+网员 3 n
+网呼 3 n
+网哥 3 n
+网址 293 n
+网址之家 3 n
+网址库 3 n
+网址推荐 3 n
+网坛 33 n
+网境 3 s
+网外 3 s
+网套 3 n
+网妖 3 n
+网妹 3 n
+网姐 3 n
+网子 7 n
+网孔 3 n
+网守 3 n
+网封 3 n
+网射 3 n
+网屏 2 n
+网巾 28 n
+网布 3 n
+网师园 7 n
+网帐 3 n
+网底 2 s
+网店 3 n
+网开一面 48 n
+网开三面 3 n
+网忙 3 n
+网恋 27 n
+网情 3 n
+网情深 3 n
+网扣 2 n
+网技 3 n
+网捕 4 n
+网文 3 n
+网族 3 n
+网易 159 n
+网易公司 9 n
+网易娱乐 3 n
+网易拍 3 n
+网易泡泡 3 n
+网景 24 n
+网景公司 2 n
+网机 3 n
+网架 10 n
+网校 61 n
+网格 104 n
+网格化 2 n
+网格地图 3 nz
+网格布 3 n
+网格法 3 n
+网格线 3 n
+网格蛋白 3 n
+网桥 6 n
+网段 10 n
+网民 561 n
+网民声 3 n
+网海 3 s
+网游 104 n
+网游版 3 n
+网漏吞舟 3 i
+网点 332 n
+网片 2 n
+网特 3 nz
+网状 130 n
+网状区分 3 n
+网状拱 3 n
+网状组织 3 n
+网状结构 56 n
+网状脉 5 n
+网狗 3 n
+网球 415 n
+网球员 3 n
+网球场 19 n
+网球拍 3 n
+网球王子 3 n
+网球网 3 n
+网球肘 3 n
+网球装 3 n
+网球赛 55 n
+网球鞋 3 n
+网球馆 3 n
+网疯 3 n
+网瘾 54 n
+网皮 3 n
+网目 6 n
+网目线 3 n
+网盲 3 n
+网眼 9 n
+网眼布 3 n
+网眼状 3 n
+网知计算 3 n
+网神 3 n
+网窝 14 n
+网站 4817 n
+网站大全 3 n
+网站空间 3 n
+网笞 3 v
+网管 36 n
+网管员 3 n
+网管软件 3 n
+网箱 20 n
+网篮 6 n
+网精 3 n
+网纲 3 n
+网纹 23 n
+网线 18 n
+网络 8352 n
+网络业 3 n
+网络书店 3 n
+网络产品 3 n
+网络人才 3 n
+网络传媒 3 n
+网络传真 3 n
+网络体系 3 n
+网络体系结构 7 n
+网络信息中心 4 nt
+网络先锋 3 n
+网络公民 3 n
+网络共享 3 i
+网络函数 3 n
+网络分析 3 n
+网络初恋 3 n
+网络化 125 n
+网络协议 19 n
+网络单元 3 n
+网络商城 3 n
+网络图 14 n
+网络地址 9 n
+网络天地 3 n
+网络媒介 3 n
+网络媒体 3 n
+网络安全 107 nz
+网络实名 3 n
+网络小姐 3 n
+网络小说 3 n
+网络层 16 n
+网络工具 3 n
+网络工程 3 n
+网络带宽 11 n
+网络平台 24 n
+网络广告 3 n
+网络应用 29 n
+网络延时 3 n
+网络战 20 n
+网络拓扑 3 n
+网络接口 4 n
+网络操作系统 11 n
+网络攻击 13 i
+网络故障 3 n
+网络教室 3 n
+网络教程 3 n
+网络文学 3 n
+网络新闻 3 n
+网络日志 3 n
+网络日记 3 n
+网络时代 3 n
+网络是坑 3 l
+网络服务 3 n
+网络流量 3 n
+网络游戏 343 n
+网络漫游 3 n
+网络版 78 n
+网络状 4 n
+网络猪 3 n
+网络理论 3 n
+网络电台 7 n
+网络电话 3 n
+网络界 3 n
+网络盗版 3 n
+网络相册 3 n
+网络科技 3 n
+网络空间 3 n
+网络管理 32 n
+网络管理员 4 n
+网络系统 65 n
+网络红人 3 n
+网络线 3 n
+网络结构 10 n
+网络综合 3 n
+网络美女 3 n
+网络股 21 n
+网络色情 3 n
+网络营销 3 n
+网络蚂蚁 3 l
+网络蚊子 3 n
+网络蠕虫 2 vn
+网络覆盖 3 n
+网络警察 3 n
+网络计算机 18 n
+网络设备 3 n
+网络设施 3 n
+网络课堂 3 n
+网络资源 46 n
+网络软件 3 n
+网络连接 3 n
+网络适配器 2 n
+网络通信 35 nt
+网络通讯 3 nt
+网络邮盘 3 n
+网络邻居 3 n
+网络部 4 n
+网络频段 3 n
+网络飞狐 3 n
+网网 12 n
+网罗 80 n
+网罗人才 3 n
+网罗人材 3 n
+网罟 3 n
+网罩 10 n
+网聊 3 v
+网联 3 n
+网聚 3 v
+网膜 15 n
+网膜炎 3 n
+网药 3 n
+网虫 12 n
+网袋 9 n
+网视 3 n
+网警 3 n
+网讯 3 n
+网谈 3 n
+网谊 3 n
+网象大小 3 n
+网贴 3 n
+网费 3 n
+网赚 3 v
+网路 73 n
+网路上 3 s
+网路岗 3 n
+网路版 3 n
+网路系统 3 n
+网路费 3 n
+网迷 3 n
+网通 79 n
+网通公司 2 n
+网速 8 n
+网速慢 3 n
+网里 3 s
+网间 3 n
+网间通话 3 n
+网队 216 n
+网际 5 n
+网际协议 3 nt
+网际快车 3 nt
+网际畅游 3 l
+网际网路 3 n
+网霸 3 n
+网页 3066 n
+网页内容 2 n
+网页制做 3 l
+网页快照 3 n
+网页文件 3 n
+网页背景 3 n
+网鱼 3 n
+网龄 3 n
+罔 107 g
+罔效 3 v
+罔替 3 v
+罔极 3 v
+罔极之恩 3 v
+罔知所措 9 i
+罔顾 9 v
+罔顾人道 3 i
+罕 716 a
+罕事 3 a
+罕有 122 a
+罕用 3 a
+罕用字 3 vn
+罕见 1406 a
+罕言寡语 3 nr
+罕譬而喻 3 v
+罕贴摩 3 vn
+罕闻 3 a
+罗 3730 j
+罗一听 2 nr
+罗三世 5 nr
+罗三国 2 ns
+罗三耳 7 nr
+罗世文 3 nr
+罗世昌 2 nr
+罗世烈 19 nr
+罗东 2 ns
+罗东进 2 nr
+罗丞相 5 nr
+罗严塔尔 3 nr
+罗中旭 3 nr
+罗中立 2 nr
+罗丹 22 nr
+罗丹明 3 nr
+罗丹萍 2 nr
+罗之一目 3 nr
+罗之子 2 nr
+罗乐勃 2 nr
+罗乐林 3 nr
+罗九曜 3 nr
+罗二世 5 nr
+罗五世 3 nr
+罗亚尔 8 nr
+罗亚尔港 15 ns
+罗亚尼 3 nr
+罗亚斯 39 nr
+罗亚蒙 256 nr
+罗交怡 4 nr
+罗亦农 4 nr
+罗人杰 49 nr
+罗什 71 nrt
+罗仁淑 3 n
+罗从彦 2 nr
+罗代言 3 nr
+罗以军 9 nr
+罗以智 4 nr
+罗伊岛 4 nr
+罗伊德 2 nr
+罗伊斯 17 nr
+罗伊河 4 nr
+罗伊特 18 nr
+罗伟伟 13 nr
+罗伦斯 2 nr
+罗伯兹 3 nr
+罗伯托 8 nr
+罗伯斯 12 nr
+罗伯斯庇 3 nr
+罗伯斯比尔 36 nrt
+罗伯特 163 nr
+罗伯茨 27 nrt
+罗伯逊 12 nr
+罗佐夫 6 nr
+罗信见 2 nr
+罗兀城 2 nr
+罗先吉 2 nr
+罗先生 3 nr
+罗光文 2 nr
+罗克尔 2 nr
+罗克汉普 2 nr
+罗克韦尔 16 nrt
+罗六世 3 nr
+罗兰 90 ns
+罗兰加洛 2 ns
+罗兰圆 3 nr
+罗兰德 6 nr
+罗兰特 3 nr
+罗兰贝 2 nr
+罗养性 4 nr
+罗内克 16 nr
+罗冠宗 2 nr
+罗冲围 3 nr
+罗凤遂 3 nr
+罗刀秦 2 nr
+罗切斯 26 nr
+罗切斯特 10 nrt
+罗列 130 ns
+罗利 7 ns
+罗刹 713 nr
+罗副 2 b
+罗力哥 2 nr
+罗力才 2 nr
+罗力正 2 nr
+罗加 36 ns
+罗加拉 5 nr
+罗加诺 4 nr
+罗勃特 2 nr
+罗勒 6 nr
+罗卓英 13 nr
+罗南 2 ns
+罗卜 2 nr
+罗卜藏 16 nr
+罗卡富 2 nr
+罗卡尔 4 nr
+罗卡角 4 nr
+罗厄德 2 nr
+罗又伦 2 nr
+罗友伦 2 nr
+罗友礼 3 nr
+罗双平 2 nr
+罗叔言 2 nr
+罗口 3 ns
+罗召俊 17 nr
+罗可汗 5 nr
+罗吉尔 3 nr
+罗吉斯 3 nr
+罗哈斯 12 nr
+罗哲文 2 nr
+罗唆 3 v
+罗唣 29 a
+罗商人 2 nr
+罗啸华 3 nr
+罗嗦 74 v
+罗嘉良 2 nr
+罗国士 2 nr
+罗圈 15 nr
+罗圈儿揖 3 nr
+罗圈椅 3 nr
+罗圈腿 9 nr
+罗地亚 3 ns
+罗埃岑 64 nr
+罗城 187 ns
+罗城仫佬族自治县 6 ns
+罗城县 2 ns
+罗基蒂 2 nr
+罗塔岛 8 nr
+罗塔里 2 nr
+罗塞塔 7 nr
+罗塞尔 5 nr
+罗塞斯 4 nr
+罗塞蒂 9 nr
+罗塞迪 2 nr
+罗士琳 17 nr
+罗复仁 8 nr
+罗夏墨 3 nr
+罗多斯 3 nr
+罗多族 2 nr
+罗大佑 3 nz
+罗大千 2 nr
+罗大哥 5 nr
+罗大帅 3 nr
+罗大惊 2 nr
+罗天婵 2 n
+罗夫娜 2 nr
+罗夫斯 2 nr
+罗夫斯基 5 nrt
+罗奇法 2 nr
+罗契得 4 nr
+罗契斯 3 nr
+罗奔乃 2 nr
+罗奔尼 2 nr
+罗如望 2 nr
+罗姆尼 2 nr
+罗存萨 10 nr
+罗孚宫 3 nr
+罗学港 3 nr
+罗安江 47 ns
+罗安达 29 nr
+罗宋汤 3 nr
+罗宏宇 3 nr
+罗宗洛 2 nr
+罗宗贤 2 nr
+罗定 11 ns
+罗定县 3 ns
+罗定市 3 ns
+罗宝经 2 nr
+罗家 267 ns
+罗家伦 8 nr
+罗家墩 256 nr
+罗家庄 6 nr
+罗家英 3 nr
+罗家镇 2 nr
+罗容克 2 nr
+罗宾 12 ns
+罗宾岛 3 nr
+罗宾常数 3 nr
+罗宾斯 24 nr
+罗宾森 7 nr
+罗宾汉 3 nr
+罗宾逊 51 nr
+罗宾韦尔 4 nrt
+罗密欧 65 nr
+罗将军 2 nr
+罗小弟 3 nr
+罗小文 20 nr
+罗小梅 217 nr
+罗小蛮 128 nr
+罗少兰 2 nr
+罗尔夫 22 nr
+罗尔斯 26 nr
+罗尔斯罗 2 nrt
+罗尔纲 11 nr
+罗尼亚 7 ns
+罗尼加 6 nr
+罗尼卡 12 nr
+罗尼柯 2 nr
+罗尼河 3 ns
+罗尼神 2 nr
+罗尼科 2 nr
+罗尼迦 3 nr
+罗山 110 ns
+罗山县 9 ns
+罗川 10 ns
+罗州 3 ns
+罗工柳 6 nr
+罗巴切 4 nr
+罗布 41 nr
+罗布尔 2 nr
+罗布朗 2 nr
+罗布林卡 10 ns
+罗布森 3 nr
+罗布泊 163 nr
+罗布泊湖 8 ns
+罗布淖尔 7 ns
+罗布雷 3 nr
+罗布麻 13 nr
+罗布麻叶 3 nr
+罗希洛夫 4 nr
+罗常培 9 nr
+罗帽直 2 nr
+罗干 92 ns
+罗平 8 nr
+罗平县 2 ns
+罗平国 3 ns
+罗庄 2 nr
+罗庄乡 3 nr
+罗庄区 3 ns
+罗庄镇 4 nr
+罗庆昌 2 nr
+罗店 6 ns
+罗庞岭 2 nr
+罗康雄 2 nr
+罗廖夫 9 nr
+罗开富 6 nr
+罗弗特 2 nr
+罗弥迦 2 nr
+罗彩霞 5 nr
+罗彻斯特 13 nrt
+罗得岛 85 ns
+罗得斯 25 nr
+罗得西亚 41 ns
+罗微微 3 nr
+罗德城 5 nr
+罗德奥 2 nr
+罗德宏 3 nr
+罗德尔 3 nr
+罗德尼 3 nr
+罗德岛 10 nr
+罗德斯 5 nr
+罗德曼 10 nr
+罗德洛 2 nr
+罗德港 4 ns
+罗德省 3 ns
+罗德西亚 3 ns
+罗德里 3 nr
+罗德里克 4 nrt
+罗德里戈 3 nrt
+罗德里格 2 nrt
+罗德里格斯 28 nrt
+罗志明 2 nr
+罗念生 5 nr
+罗思人 4 nr
+罗思南 3 nr
+罗思监 2 nr
+罗思诸 4 nr
+罗恩格 7 nr
+罗惠侨 2 nr
+罗慕卢 4 nr
+罗慕洛 10 nr
+罗慕路 3 nr
+罗慧娟 3 nr
+罗戈夫 2 nr
+罗戴恩 6 nr
+罗所译 2 nr
+罗扇 8 n
+罗托鲁 3 nr
+罗技 3 nz
+罗拉 7 nrt
+罗拉喂 2 nr
+罗拉特 12 nr
+罗拔诺 3 nr
+罗拜 3 ns
+罗拜夷 4 nr
+罗振玉 41 nr
+罗掘 3 v
+罗掘一空 3 nr
+罗掘俱穷 3 nr
+罗提诺 7 nr
+罗摩休 2 nr
+罗摩克 6 nr
+罗摩功 14 nr
+罗摩历 8 nr
+罗摩笈 11 nr
+罗摩衍那 33 nr
+罗敦 11 ns
+罗敷夸 2 nr
+罗敷有夫 3 nr
+罗文 73 nr
+罗文刚 2 nr
+罗文又 2 nr
+罗文喊 6 nr
+罗文峪 4 nr
+罗文森 3 nr
+罗文素 5 nr
+罗文聪 3 nr
+罗文藻 2 nr
+罗文说 2 nrfg
+罗文青 2 nr
+罗斯 233 nr
+罗斯丹 5 nr
+罗斯冰 6 nr
+罗斯号 4 nr
+罗斯国 2 ns
+罗斯坦 7 nr
+罗斯基 3 nr
+罗斯塔 7 nr
+罗斯山 7 nr
+罗斯岛 18 ns
+罗斯川 2 ns
+罗斯托 9 nr
+罗斯托克 15 nrt
+罗斯托夫 33 nrt
+罗斯托夫州 3 nrt
+罗斯林 3 nr
+罗斯比 4 nrt
+罗斯氏 3 nr
+罗斯海 6 ns
+罗斯特 4 nr
+罗斯监 2 nr
+罗斯福 318 nr
+罗斯纳 2 nr
+罗斯蒂 2 nr
+罗斯蒙特 2 ns
+罗斯部 3 nr
+罗斯金 4 nr
+罗新社 2 nr
+罗方辉 2 nr
+罗族 2 nz
+罗时丰 3 nr
+罗昌爱 6 nr
+罗明珠 3 nr
+罗星塔 4 nr
+罗星大师 2 nr
+罗晋标 5 nr
+罗晓光 2 nr
+罗晓维 126 nr
+罗晓鹏 8 nr
+罗普郡 2 nr
+罗景民 3 nr
+罗晶晶 3 nr
+罗曼兰科 3 ns
+罗曼努 3 nr
+罗曼史 16 nr
+罗曼司 2 nr
+罗曼科 2 nr
+罗曼系 2 nr
+罗曼罗兰 3 ns
+罗曼蒂克 40 nrt
+罗曼语 15 nr
+罗曼诸 3 nr
+罗曼诺夫 20 nrt
+罗朗展 4 nr
+罗本 13 ns
+罗本古 2 ns
+罗本立 11 nr
+罗来纳 3 nr
+罗杰 10 nr
+罗杰斯 21 nr
+罗林斯 49 nr
+罗林斯基 15 nrt
+罗林森 3 nr
+罗林逊 2 nr
+罗柴冲 3 nr
+罗格 12 nr
+罗格日 7 nr
+罗格朗 3 nr
+罗格海 2 ns
+罗桂英 2 nr
+罗桑丹 3 nr
+罗桑嘉 6 nr
+罗桑意 2 nr
+罗桑曲 2 nr
+罗桑确 3 nr
+罗桑顿 2 nr
+罗梅罗 3 nr
+罗森博 3 nr
+罗森博格 2 nr
+罗森塔尔 12 nr
+罗森布 3 nr
+罗森海姆 2 nr
+罗正钧 2 nr
+罗武英 3 nr
+罗武谕 3 nr
+罗毅刚 4 nr
+罗比 11 nrt
+罗比亚 5 ns
+罗比基恩 3 nr
+罗比尼 16 nr
+罗比尼奥 3 nrt
+罗氏 116 nr
+罗氏公司 2 nr
+罗氏妇 2 nr
+罗氏非 2 nr
+罗氏鬼 2 nr
+罗永浩 3 nr
+罗永秀 16 nr
+罗永胜 2 nr
+罗汉 256 nr
+罗汉堂 60 nr
+罗汉山 6 nr
+罗汉床 3 nz
+罗汉拳 3 nr
+罗汉松 26 nr
+罗汉果 16 nr
+罗汉洞 2 nr
+罗汉豆 3 nr
+罗汝先 2 nr
+罗汝才 365 nr
+罗汝明 29 nr
+罗江 6 ns
+罗江县 3 ns
+罗江科 2 nr
+罗沙 2 ns
+罗沛霖 2 nr
+罗波夫 17 nr
+罗波安 2 nr
+罗波尔 2 nr
+罗波斯 2 nr
+罗波维 3 nr
+罗泰和 2 nr
+罗泽秀 6 nr
+罗洗河 41 nr
+罗洛宏 4 nr
+罗洛普 3 nr
+罗洛浑 2 nr
+罗津斯 4 nr
+罗洪乡 3 nr
+罗洪先 2 nr
+罗洲铁 3 nr
+罗洲雨林 2 nr
+罗浮宫 3 nr
+罗浮山 13 nr
+罗海 58 ns
+罗海城 24 ns
+罗海琼 3 nr
+罗清启 10 nr
+罗清泉 771 nr
+罗湖 41 ns
+罗湖区 27 ns
+罗湖口岸 2 ns
+罗湘晋 3 nr
+罗湾 6 ns
+罗源 3 nr
+罗源县 2 ns
+罗滕堡 11 nr
+罗炳辉 73 nr
+罗照春 2 nr
+罗特克 18 nr
+罗特希尔德 2 nrt
+罗特芬 2 nr
+罗猴山 17 nr
+罗玉成 4 nr
+罗玉文 7 nr
+罗玉通 4 nr
+罗王 6 nrt
+罗王子 5 nr
+罗王爷 4 nr
+罗玛克 3 nr
+罗琳 10 nr
+罗瑞卿 110 nr
+罗瑟林 3 nr
+罗瓦涅米 2 nrt
+罗生门 6 nr
+罗用兵 2 nr
+罗田 785 nr
+罗田县 519 ns
+罗申科 3 nr
+罗甸 12 ns
+罗甸县 3 ns
+罗百吉 3 nr
+罗盘 170 nr
+罗盘仪 5 nr
+罗盘针 3 nr
+罗盛教 8 nr
+罗真人 34 nr
+罗知悌 2 nr
+罗石青 3 nr
+罗祥英 2 nr
+罗福成 2 nr
+罗秀竹 166 nr
+罗科努 3 nr
+罗科夫 5 nr
+罗科索 14 nr
+罗科索夫 2 nr
+罗科铎 4 nr
+罗立如 42 nr
+罗章龙 43 nr
+罗竹风 5 nr
+罗米尼 3 nr
+罗米欧 3 ns
+罗米芬 2 nr
+罗素 117 nr
+罗素伯爵 2 nr
+罗素图 3 nr
+罗素姆 5 nr
+罗索 18 nr
+罗红霉素 5 n
+罗纳 13 nr
+罗纳尔 8 nr
+罗纳尔多 58 nrt
+罗纳尔迪 110 nr
+罗纳德 32 nr
+罗纳河 2 nr
+罗纹 16 nr
+罗织 33 n
+罗织构陷 3 n
+罗织罪名 11 n
+罗绍威 3 nr
+罗经 53 nr
+罗经仪 3 nr
+罗经段 3 n
+罗绢缎 2 nr
+罗绣锦 2 nr
+罗绮 17 nrfg
+罗维奇 27 nr
+罗维尔 2 nr
+罗维迦 3 nr
+罗缎 13 nr
+罗网 66 nz
+罗罗嗦嗦 3 z
+罗罗斯 4 nr
+罗罗罗 2 nr
+罗美薇 3 nr
+罗耀拉 3 nr
+罗耶定 49 nr
+罗联军 4 nr
+罗肃郡 5 nr
+罗肖夫 5 nr
+罗肯希 3 nr
+罗肯湾 2 ns
+罗胜堡 2 nr
+罗腾堡 2 nr
+罗致 51 nr
+罗致人材 3 nr
+罗良伟 2 nr
+罗艾桦 2 nr
+罗芙洛 3 nr
+罗苏 4 ns
+罗苏拉 6 nr
+罗茂城 4 nr
+罗茨 8 nrt
+罗荣光 2 nr
+罗荣怀 3 nr
+罗荣桓 108 nr
+罗荣渠 3 nr
+罗莎 8 nrt
+罗萨尔 2 nr
+罗萨峰 2 nr
+罗萨斯 14 nr
+罗萨莱斯 3 ns
+罗萨里奥 14 nrt
+罗蒙诺 32 nr
+罗蒙诺索 2 ns
+罗蕾莱 8 nr
+罗薛梅 2 nr
+罗藏丹 2 ns
+罗虎刚 3 nr
+罗蜜欧 3 nr
+罗行纪 2 nr
+罗补罗 2 nr
+罗衫动 2 nr
+罗西 35 ns
+罗西娜 4 nr
+罗西尼 12 nr
+罗西里 7 ns
+罗诗力 4 nr
+罗诤诤 5 v
+罗诺沃 8 nr
+罗豪才 10 nr
+罗贝勒 16 nr
+罗贝尔 4 nr
+罗贝舍 9 nr
+罗贡坝 5 nr
+罗贯中 22 nr
+罗贵英 4 nr
+罗贵霜 6 nr
+罗赫林 3 nr
+罗轻烟 2 nr
+罗辛宁 3 nr
+罗近溪 3 nr
+罗进刚 2 nr
+罗迦室 2 nr
+罗迪克 8 nr
+罗迪派伯 3 nr
+罗退尔 4 nr
+罗通社 3 nt
+罗道庄 2 nr
+罗道耳 2 nr
+罗那 11 ns
+罗那顺 3 nr
+罗郡王 7 nr
+罗里 8 ns
+罗里罗 16 nr
+罗金仙 40 nr
+罗钦顺 5 nr
+罗钳吉网 3 n
+罗锅 15 n
+罗锅儿 3 nr
+罗锦辉 2 nr
+罗长奇 2 nr
+罗长礼 95 nr
+罗长老 2 nr
+罗门元 3 nr
+罗门曲 2 nr
+罗门王 2 nr
+罗阳 2 ns
+罗阿丝 3 nr
+罗陀 17 ns
+罗际勋 4 nr
+罗隆基 3 nr
+罗隐和 6 nr
+罗隐道 12 nr
+罗雀掘鼠 6 nr
+罗雅各 3 nr
+罗雪又 2 nr
+罗雪尔 18 nr
+罗雪村 3 nr
+罗雪问 2 nr
+罗雷亚尔 2 nrt
+罗雷尔 5 nr
+罗霄山 3 nr
+罗青玲 3 nr
+罗非鱼 11 nr
+罗顺裕 2 nr
+罗饶余 4 nr
+罗马 3071 ns
+罗马不是 3 l
+罗马公教 6 nz
+罗马城 47 nr
+罗马大学 15 nt
+罗马字 14 nr
+罗马字母 3 nr
+罗马尼 2 nr
+罗马尼亚 596 ns
+罗马尼亚议会 2 nt
+罗马尼亚语 25 nz
+罗马市 4 ns
+罗马帝国 640 ns
+罗马式 50 nr
+罗马教会 3 nr
+罗马教皇 90 nr
+罗马数字 15 n
+罗马柱 3 nr
+罗马法 3 nr
+罗马涅 2 nr
+罗马诺 7 nr
+罗马队 22 nr
+罗高寿 5 nr
+罗麦尔 3 nr
+罗龙文 29 nr
+罘 21 g
+罚 2050 zg
+罚一劝百 3 nz
+罚下 3 v
+罚下场 3 n
+罚不当罪 3 v
+罚不责众 3 n
+罚了不打 3 v
+罚作 3 v
+罚写 3 v
+罚出 3 v
+罚出去 3 v
+罚出来 3 v
+罚函数法 3 n
+罚分 5 n
+罚则 22 n
+罚到 3 v
+罚单 12 n
+罚去 3 v
+罚弗及嗣 3 n
+罚息 3 v
+罚成 3 v
+罚抄 3 v
+罚来罚去 3 n
+罚款 689 n
+罚款单 2 n
+罚没 30 v
+罚没款 4 v
+罚球 161 n
+罚球区 9 n
+罚球弧 3 n
+罚球点 3 n
+罚球线 37 n
+罚税 3 n
+罚站 3 n
+罚给 3 v
+罚罪 3 v
+罚老补新 3 v
+罚调 3 v
+罚起 3 v
+罚起来 3 v
+罚跪 3 v
+罚跳 3 v
+罚踢 3 n
+罚过去 3 v
+罚过来 3 v
+罚进 3 v
+罚酒 36 v
+罚金 148 n
+罚钱 3 v
+罝 2 zg
+罟 31 g
+罡 188 x
+罡风 4 n
+罢 9424 v
+罢了 1736 y
+罢休 327 v
+罢免 1296 v
+罢免权 5 v
+罢免法 3 v
+罢兵 3 v
+罢官 256 v
+罢宴 3 v
+罢工 1321 v
+罢工抗议 3 i
+罢市 218 v
+罢弊 3 v
+罢战 3 v
+罢手 185 v
+罢教 2 v
+罢斥 3 v
+罢朝 3 v
+罢止 3 v
+罢演 3 v
+罢笔 3 v
+罢罢罢 3 v
+罢职 24 v
+罢论 4 v
+罢讼 3 vn
+罢诉 3 v
+罢课 112 v
+罢贴 3 v
+罢赛 5 vn
+罢退 3 v
+罢黜 63 v
+罢黜百家 30 i
+罣 2 zg
+罣碍 3 v
+罨 28 g
+罩 1247 v
+罩不住 3 n
+罩住 3 n
+罩儿 3 n
+罩垫 3 n
+罩壳 2 n
+罩子 39 n
+罩成 3 nz
+罩杯 13 nz
+罩棚 2 n
+罩牙本质 3 n
+罩盖 8 n
+罩衣 10 n
+罩衫 7 n
+罩袍 16 n
+罩袖 3 n
+罩雾 3 n
+罩面 6 n
+罪 4177 zg
+罪上加罪 3 i
+罪不可赎 3 i
+罪不容诛 29 i
+罪不容赦 3 i
+罪不胜诛 3 i
+罪不该死 3 i
+罪与罚 3 n
+罪与非 3 i
+罪与非罪 3 i
+罪业 31 n
+罪业深重 3 i
+罪二级字 3 n
+罪人 262 n
+罪刑 3 n
+罪加一等 21 i
+罪名 627 n
+罪囚 3 n
+罪大容诛 3 i
+罪大恶极 87 i
+罪嫌 3 n
+罪孽 151 n
+罪孽深重 45 i
+罪尤 3 n
+罪工 3 n
+罪应万死 3 i
+罪当万死 3 i
+罪恶 731 n
+罪恶之地 3 i
+罪恶地 3 i
+罪恶工具 3 l
+罪恶感 30 i
+罪恶昭彰 3 i
+罪恶昭著 3 i
+罪恶根源 3 i
+罪恶深重 3 i
+罪恶滔天 18 i
+罪恶累累 3 i
+罪恶行为 3 i
+罪恶行径 3 i
+罪恶贯盈 3 i
+罪恶都市 3 n
+罪情 3 n
+罪愆 21 n
+罪报 3 n
+罪有应得 51 i
+罪有攸归 3 i
+罪案 31 n
+罪案现场 3 n
+罪犯 482 n
+罪状 192 n
+罪盈恶满 3 i
+罪罚 3 n
+罪莫大焉 3 i
+罪行 582 n
+罪行累累 3 i
+罪证 103 n
+罪证确凿 3 n
+罪该万死 96 i
+罪该处死 3 i
+罪责 117 n
+罪责难逃 5 i
+罪轻 3 i
+罪过 338 n
+罪逆深重 3 i
+罪重 3 n
+罪错 2 n
+罪障 3 n
+罪魁 16 n
+罪魁祸首 121 i
+置 11145 v
+置业 80 n
+置业网 3 nz
+置业者 3 n
+置之不理 183 i
+置之不顾 5 i
+置之度外 138 i
+置之死地 24 i
+置之死地而后生 17 i
+置之脑后 26 i
+置之高阁 3 i
+置买 3 v
+置于 1028 v
+置于死地 3 i
+置于死地而后生 3 i
+置于脑后 4 i
+置产 3 n
+置信 64 nz
+置信区间 3 n
+置信度 19 n
+置信水平 3 nz
+置信测度 3 n
+置信限 3 n
+置信集 3 i
+置入 48 v
+置办 117 v
+置喙 3 i
+置地 21 n
+置备 62 v
+置换 177 v
+置换术 5 n
+置换群 3 i
+置换表示 3 n
+置放 25 v
+置标语言 3 n
+置水之情 3 i
+置物架 3 n
+置疑 38 v
+置若罔闻 56 i
+置行 18 v
+置装 29 v
+置评 22 v
+置诸度外 3 i
+置诸脑后 3 l
+置诸高阁 3 i
+置身 341 v
+置身事外 45 i
+置身于 3 l
+置身其中 3 i
+置辩 3 v
+置酒 104 v
+置锥之地 3 i
+置顶 3 n
+置顶帖 3 n
+置顶贴 3 n
+罱 33 v
+罱河泥 3 v
+署 629 ng
+署名 255 v
+署名举报 3 n
+署名文章 3 n
+署名权 7 n
+署期 3 j
+署理 37 v
+署记长 3 n
+署长 70 v
+罴 50 g
+罷 37 zg
+罹 41 zg
+罹厄 3 n
+罹患 54 v
+罹患重病 3 n
+罹灾 3 v
+罹祸 3 v
+罹难 18 v
+罹难者 6 n
+罼 16 zg
+罽 49 zg
+罾 24 g
+罿 28 zg
+羁 97 zg
+羁勒 3 v
+羁押 78 v
+羁押于 3 n
+羁旅 8 n
+羁束 3 v
+羁泊 3 n
+羁牵 3 v
+羁留 18 v
+羁留不归 3 n
+羁禁 3 v
+羁縻 613 v
+羁绊 58 n
+羅 4 zg
+羆 2 zg
+羇客 3 vn
+羇旅 3 v
+羊 2980 n
+羊三世 2 nr
+羊三木 3 nr
+羊东 13 ns
+羊乳 10 n
+羊乳酪 3 n
+羊二蛋 39 nr
+羊倌 4 n
+羊儿 17 n
+羊儿夺 2 nr
+羊儿风 2 nr
+羊入虎口 3 i
+羊入虎群 3 nr
+羊八井 27 nr
+羊公鹤 3 nr
+羊剪绒 3 nr
+羊力 9 n
+羊卓雍湖 3 nr
+羊卓雍错 18 nr
+羊叔子 5 nr
+羊可立 5 nr
+羊和鹿 2 nr
+羊圈 19 n
+羊场 6 n
+羊坊店 7 ns
+羊坝 30 n
+羊城 53 ns
+羊城晚报 3 nz
+羊城通 3 nr
+羊太傅 33 nr
+羊头 28 n
+羊头狗肉 3 i
+羊奶 25 n
+羊奶粉 3 nr
+羊子庙 256 nr
+羊尾 7 n
+羊山 9 ns
+羊崽 3 n
+羊工 3 n
+羊庄镇 3 nr
+羊开泰 2 nr
+羊排 7 n
+羊杂 3 nz
+羊杂碎 9 i
+羊枣 3 n
+羊栏 3 n
+羊桃 3 n
+羊楼洞 2 nr
+羊毛 454 n
+羊毛出在 3 i
+羊毛出在羊身上 10 i
+羊毛商 3 n
+羊毛毡 3 i
+羊毛状 3 n
+羊毛球 3 n
+羊毛疔 3 n
+羊毛皮 3 n
+羊毛绒 3 nr
+羊毛脂 6 n
+羊毛衣 3 n
+羊毛衫 25 nr
+羊毛袋 3 n
+羊毫 20 n
+羊毫笔 3 i
+羊水 47 n
+羊汤 5 n
+羊油 10 n
+羊泉村 8 nr
+羊湖 2 ns
+羊湾 5 ns
+羊狠狼贪 3 i
+羊献容 56 nr
+羊痘 3 n
+羊痫疯 3 n
+羊痫风 3 n
+羊癫疯 3 n
+羊癫风 4 n
+羊皮 914 n
+羊皮夹克 3 n
+羊皮帽 3 n
+羊皮纸 15 n
+羊皮袄 18 n
+羊皮鼓 3 nr
+羊真孔草 3 nr
+羊眼 8 n
+羊眼圈 3 n
+羊祜乃 3 nr
+羊祜叹 2 nr
+羊祜死 2 nr
+羊祜羊 2 nr
+羊粪 8 n
+羊绒 41 n
+羊绒制品 3 n
+羊绒纱 3 nr
+羊绒衫 12 nr
+羊续悬鱼 3 n
+羊羔 81 n
+羊羔绒 3 n
+羊羔美酒 3 n
+羊羔肉 4 n
+羊群 109 n
+羊羹 3 n
+羊耳菊 3 nr
+羊肉 900 n
+羊肉串 14 n
+羊肉汤 3 nz
+羊肉片 5 n
+羊肚 25 n
+羊肚蕈 3 n
+羊肝 3 n
+羊肠 32 n
+羊肠九曲 3 nr
+羊肠小径 3 n
+羊肠小道 24 n
+羊肠线 5 n
+羊肠鸟道 3 n
+羊背石 3 nr
+羊胎素 2 n
+羊脂 61 n
+羊脂玉 3 n
+羊脂球 3 n
+羊腥汤 4 n
+羊腿 3 n
+羊腿子 2 n
+羊膜 26 n
+羊舌 8 n
+羊舍 3 n
+羊草 37 n
+羊落虎口 3 i
+羊蝎子 3 nr
+羊街 2 n
+羊裘垂钓 3 nr
+羊西线 3 n
+羊角 60 n
+羊角疯 3 n
+羊角虱 3 n
+羊角辫 3 n
+羊角风 13 n
+羊质虎皮 3 n
+羊踯躅 3 n
+羊蹄 5 n
+羊蹄甲 10 n
+羊道 3 n
+羊酒 3 n
+羊马 2 n
+羊马河 21 nr
+羊骨 2 n
+羊鱼 3 n
+羊齿 34 n
+羊齿植物 6 n
+羋 2 zg
+羌 549 nr
+羌塘 57 ns
+羌察 3 ns
+羌寨 2 ns
+羌族 360 nz
+羌无故实 3 n
+羌活 16 n
+羌笛 5 n
+羌胡 3 n
+羍 51 zg
+美 16809 ns
+美不美 3 ns
+美不胜收 40 l
+美丑 19 m
+美丑不分 3 l
+美专 2 j
+美专家 3 l
+美东 3 ns
+美东队 3 nt
+美丝丝 3 nr
+美中 3 ns
+美中不足 47 i
+美中关系 3 nt
+美丰银行 3 nt
+美丽 3036 ns
+美丽动人 3 nz
+美丽大方 3 nr
+美丽富饶 3 ns
+美丽童话 3 nr
+美丽陷阱 3 n
+美乐家 3 n
+美乐达 5 nz
+美乳 3 nz
+美乳霜 3 n
+美事 25 n
+美亚 3 ns
+美人儿 131 n
+美人关 3 ns
+美人图 3 ns
+美人归 3 ns
+美人志 3 ns
+美人梅 3 ns
+美人草 3 nz
+美人蕉 21 n
+美人计 42 nz
+美人豹 3 nz
+美人迟暮 3 nr
+美人香草 3 nz
+美人鱼 36 nz
+美仁 2 ns
+美仑 17 ns
+美仑美奂 3 nr
+美众议院 3 nt
+美伦美 2 ns
+美体 18 n
+美作 3 ns
+美侨 3 n
+美元 5382 q
+美元兑 3 nr
+美元汇率 3 nz
+美光 3 nz
+美克美 2 ns
+美兰 4 ns
+美兰区 3 ns
+美其名 3 ns
+美其名曰 44 nr
+美军 4384 j
+美军基地 3 ns
+美军太平洋总部 12 nt
+美军官兵 3 nt
+美军方 3 nt
+美凤 3 ns
+美分 231 m
+美利 15 ns
+美利坚 48 nr
+美利坚共 3 nr
+美利坚合 3 ns
+美利坚合众国 45 ns
+美利坚合众国政府 2 nt
+美利奴 4 nr
+美利纸业 54 nz
+美利达 3 ns
+美制 3 nt
+美加 3 ns
+美加净 2 nr
+美加华 3 ns
+美加地区 3 ns
+美加州 3 ns
+美化 189 ns
+美化版 3 nz
+美化环境 2 j
+美北 3 ns
+美北队 3 nt
+美华人 3 n
+美华裔 3 nr
+美协 36 j
+美南 3 ns
+美南队 3 nt
+美博会 3 j
+美参议院 3 nt
+美参院 3 nt
+美发 44 nz
+美发业 3 nt
+美发厅 12 nt
+美发学校 3 nt
+美发师 18 nt
+美发店 13 nt
+美发网 3 nz
+美名 73 m
+美味 786 nz
+美味佳肴 3 i
+美味可口 11 i
+美味源 2 nz
+美和护专 3 n
+美商 16 n
+美商旗 2 nt
+美善 3 ns
+美因兹 12 nr
+美因河 10 ns
+美因茨 33 ns
+美国 36089 ns
+美国专利局 6 nt
+美国中央情报局 32 nt
+美国中情局 9 nt
+美国丽人 3 nr
+美国之音 24 nz
+美国亚利桑那大学 2 nt
+美国伊利诺伊大学 12 nt
+美国伊利诺大学 5 nt
+美国众议院 16 nt
+美国会 120 nt
+美国会众议院 3 nt
+美国作家 3 l
+美国佬 26 nz
+美国使馆 29 nt
+美国全国广播公司 8 nt
+美国公司 65 nt
+美国共和党 12 nt
+美国军舰 18 nt
+美国农业部 11 nt
+美国加利福尼亚大学 23 nt
+美国加州大学 10 nt
+美国加州大学伯克利分校 3 nt
+美国加州大学洛杉矶分校 12 nt
+美国加州理工学院 11 nt
+美国务院 101 nt
+美国劳工部 5 nt
+美国化 13 nt
+美国化学会 4 nt
+美国匹兹堡大学 6 nt
+美国半导体工业协会 2 n
+美国华人 3 nz
+美国华盛顿大学 6 nt
+美国参议院 24 nt
+美国参谋长联席会议 12 nt
+美国司法部 12 nt
+美国哈佛大学 73 nt
+美国哈佛大学医学院 5 nt
+美国哥伦比亚大学 31 nt
+美国哥伦比亚广播公司 2 nt
+美国商业部 2 nt
+美国商会 4 nt
+美国商务部 6 nt
+美国国会 411 nt
+美国国会众议院 4 nt
+美国国会参议院 8 nt
+美国国务院 242 nt
+美国国家安全局 15 nt
+美国国家档案馆 3 nt
+美国国家航空航天局 15 nt
+美国国防部 220 nt
+美国在线 47 n
+美国在线公司 8 nt
+美国士兵 3 nt
+美国大使馆 9 nt
+美国大学 39 nt
+美国威斯康星大学 10 nt
+美国宇航局 36 nt
+美国宾夕法尼亚大学 24 nt
+美国密歇根大学 15 nt
+美国市场 87 nt
+美国广播公司 11 nt
+美国康乃尔大学 2 ns
+美国康奈尔大学 27 nt
+美国康宁公司 7 nt
+美国式 21 nz
+美国微软公司 4 n
+美国政府 489 nt
+美国斯坦福大学 21 nt
+美国新闻署 3 nt
+美国明尼苏达大学 7 nt
+美国普林斯顿大学 16 nt
+美国最高法院 13 nt
+美国有线电视新闻网 39 nt
+美国杜克大学 3 nt
+美国杜邦公司 9 nt
+美国梦工厂 2 nt
+美国梧桐 3 ns
+美国民主党 3 nt
+美国法院 4 nt
+美国波士顿大学 3 nt
+美国波音公司 23 nt
+美国洛斯阿拉莫斯国家实验室 2 nt
+美国版 3 nz
+美国环球影片公司 7 nt
+美国电影协会 5 nt
+美国电影艺术与科学学院 14 nt
+美国电报电话公司 6 nt
+美国电话电报公司 15 nt
+美国白宫 3 ns
+美国硅谷 13 nz
+美国福特汽车公司 5 nt
+美国科学院 78 nt
+美国移民 3 nr
+美国空军 404 nt
+美国第七舰队 3 nt
+美国第五舰队 3 nt
+美国签证 3 n
+美国红十字会 2 nt
+美国纽约 3 nz
+美国纽约大学 2 nt
+美国纽约州立大学 10 nt
+美国纽约证券交易所 2 nt
+美国耶鲁大学 32 nt
+美国联合航空公司 6 nt
+美国联邦 46 nt
+美国联邦上诉法院 2 l
+美国联邦储备委员会 3 nt
+美国联邦政府 15 nt
+美国联邦调查局 9 nt
+美国联邦贸易委员会 2 nt
+美国股市 3 n
+美国能源 3 nz
+美国能源部 8 nt
+美国航空公司 22 nt
+美国航空航天局 18 nt
+美国芝加哥大学 26 nt
+美国芭蕾舞剧院 3 nt
+美国花旗集团 2 nt
+美国英特尔公司 2 nt
+美国苹果公司 2 nt
+美国西北大学 5 nt
+美国西北航空公司 4 nt
+美国西点军校 5 nt
+美国贝尔公司 2 nt
+美国贝尔实验室 7 nz
+美国财政部 62 nt
+美国辉瑞制药公司 3 nz
+美国运通公司 2 nt
+美国进口 3 ns
+美国通用 26 nt
+美国通用汽车公司 7 nt
+美国通用电气 4 nt
+美国通用电气公司 13 nt
+美国银行 20 nt
+美国长老会 4 nt
+美国队 216 nt
+美国防 3 nz
+美国防部 95 nt
+美国陆军 3 nt
+美国雷声公司 8 nt
+美国食品和药物管理局 7 nt
+美国驻华使馆 3 nt
+美国驻华大使馆 4 nt
+美国高盛公司 6 nt
+美国高通公司 8 nt
+美国麻省理工学院 30 nt
+美国黑人 3 n
+美图 3 ns
+美图秀 3 nr
+美图网 3 nz
+美圆 16 nz
+美塞亚 3 ns
+美塞尼亚 81 ns
+美士兵 3 nr
+美声 12 m
+美声唱法 3 n
+美多 9 m
+美大司 8 nt
+美太平洋舰队 4 nt
+美女 993 n
+美女作家 3 n
+美女动画 3 n
+美女吧 3 n
+美女图 3 nr
+美女壁纸 3 n
+美女如云 3 i
+美女照 3 j
+美女用 3 nt
+美女秀 3 nr
+美女簪花 3 nz
+美女网 3 nt
+美女蛇 3 n
+美女视频 3 n
+美女贴 3 n
+美女贴图 3 n
+美女露 3 nr
+美好 1474 a
+美好世界 3 nz
+美好事物 3 nt
+美好前景 3 i
+美好幸福 3 nr
+美好心愿 3 i
+美好愿望 3 i
+美好时光 3 nz
+美好未来 3 l
+美好理想 3 n
+美好生活 3 i
+美好记忆 3 n
+美如冠玉 3 nr
+美如天仙 3 nr
+美如画 3 nr
+美妇人 3 nz
+美妙 299 a
+美妙绝伦 3 i
+美姑 3 n
+美姑县 2 ns
+美姿 3 n
+美娇娘 2 nr
+美媒体 3 n
+美媚 3 a
+美字 3 nz
+美孚 20 nz
+美孚石油公司 12 nt
+美学 545 n
+美学史 12 n
+美学家 29 n
+美学观 10 n
+美宇航局 3 nt
+美宝莲 3 nr
+美宣王 2 nr
+美容 426 n
+美容业 3 n
+美容中心 3 l
+美容厅 3 n
+美容品 3 n
+美容外科 3 l
+美容室 2 n
+美容师 42 nr
+美容店 13 ns
+美容术 2 n
+美容网 3 n
+美容美发 3 j
+美容美发店 16 ns
+美容院 69 n
+美小面包 3 n
+美少女 3 nr
+美少妇 3 nr
+美少年 3 m
+美少男 3 nr
+美尔 3 ns
+美尔姿 3 nr
+美尔雅 2 ns
+美尼尔 3 ns
+美展 16 j
+美工 28 j
+美工刀 3 n
+美工设计 3 n
+美差 5 n
+美帝国主义 104 nz
+美帝国主义者 6 nz
+美年达 3 nt
+美幸 3 n
+美廉美 3 ns
+美式 94 n
+美式英语 3 nz
+美式足球 3 n
+美得 3 ns
+美德 250 ns
+美恩斯 3 nr
+美恶 3 a
+美惠 6 ns
+美意 40 n
+美意延年 3 ns
+美意盛情 3 l
+美感 113 ns
+美援 3 n
+美政府 69 nt
+美敦力 8 nt
+美文 29 nz
+美斯蒂索 2 ns
+美方 363 q
+美施贵 6 nr
+美日关系 3 nz
+美日韩 3 ns
+美日鹰 4 nz
+美景 201 n
+美景良辰 3 nr
+美智子 5 nr
+美曰韩 2 nr
+美术 1806 n
+美术专业 3 nt
+美术作品 3 n
+美术史 217 n
+美术品 15 n
+美术商 3 n
+美术字 259 n
+美术学 19 nt
+美术学院 3 nt
+美术室 4 nt
+美术家 102 n
+美术师 13 nt
+美术教育 3 l
+美术片 35 n
+美术片儿 3 n
+美术班 2 n
+美术电影 3 n
+美术界 29 n
+美术系 25 nt
+美术纸 3 n
+美术组 2 nt
+美术网 3 nt
+美术设计 3 n
+美术课 2 n
+美术院 11 nt
+美术院校 3 nt
+美术馆 292 nt
+美术高考 3 ns
+美杜沙 3 ns
+美杜莎 3 nz
+美来迟 3 nr
+美极了 3 l
+美林 48 ns
+美林公司 3 nt
+美林集团 4 nt
+美标 3 n
+美格 6 n
+美梦 176 nz
+美梦成真 3 nz
+美欣达 2 nr
+美气 3 n
+美沙酮 3 nz
+美泉宫 4 ns
+美泰克 3 ns
+美津浓 3 nz
+美洲 1394 ns
+美洲国家 3 ns
+美洲国家组织 18 nt
+美洲地区 3 ns
+美洲开发银行 3 nt
+美洲杯 4 nz
+美洲狮 5 ns
+美洲腹蛇 3 n
+美洲葡萄 3 n
+美洲虎 67 nz
+美洲豹 20 nz
+美洲驼 8 n
+美洲鳄 3 n
+美洲鳗 3 n
+美浓 3 nz
+美海军 19 nt
+美涣 3 i
+美溪区 3 ns
+美滋滋 18 z
+美满 108 a
+美满婚姻 3 n
+美满幸福 3 nr
+美满生活 3 i
+美满良缘 3 nr
+美版 3 n
+美特 5 ns
+美特斯 3 ns
+美狄亚 9 ns
+美猴王 3 nr
+美玉 69 nr
+美玉无瑕 3 i
+美玲 3 nr
+美甲 16 ns
+美甲店 3 ns
+美甲机 3 nz
+美男子 33 nr
+美男计 3 nz
+美登木 5 nr
+美登素 5 nr
+美的 230 nr
+美目 3 n
+美目盼兮 6 i
+美眉 44 ns
+美眉图 3 ns
+美眉秀 3 nr
+美眷 3 n
+美科利 33 nz
+美称 96 n
+美第奇 12 ns
+美籍 134 n
+美籍华人 3 nz
+美索 4 ns
+美索不达 3 ns
+美索不达米亚 155 ns
+美纹纸 3 n
+美纽斯 4 nz
+美编 16 j
+美罗城 3 ns
+美美 63 ns
+美联储 146 j
+美联社 225 nt
+美联航 16 j
+美育 92 vn
+美能达 3 nz
+美腿 3 nz
+美舒雅 9 nr
+美航 3 j
+美色 83 n
+美艳 44 a
+美艳绝伦 3 i
+美芹之献 3 nr
+美苏 7 ns
+美苏关系 3 nt
+美苏英 3 nr
+美若天仙 13 nr
+美英 14 nz
+美茵 6 ns
+美茵河 2 ns
+美菱 46 nz
+美菱电器 7 nz
+美菲军 2 nr
+美西 30 ns
+美西北 3 ns
+美西律 3 ns
+美西林 2 ns
+美西队 3 nt
+美观 299 nz
+美观大方 3 ns
+美解眠 3 nr
+美言 17 n
+美言不信 3 i
+美誉 651 n
+美誉度 29 n
+美词 3 n
+美语 2 nz
+美语教学 3 nt
+美语课程 3 n
+美谈 17 nz
+美貌 499 nz
+美貌女 3 n
+美貌惊人 3 i
+美贤之 4 nr
+美质 3 n
+美资 23 n
+美赞臣 5 nr
+美轮美奂 20 nr
+美辛 5 ns
+美达 21 ns
+美迪 6 nz
+美通 5 nz
+美通公司 3 nt
+美酒 131 n
+美酒佳肴 10 i
+美金 55 n
+美钞 24 nr
+美阿 3 ns
+美陆军 10 nt
+美院 31 ns
+美院附中 3 j
+美雪 3 n
+美零售商 3 n
+美韩 3 ns
+美韩军 4 nt
+美音 3 n
+美韶华 2 nr
+美颜 3 nr
+美食 1025 n
+美食主义 3 nz
+美食佳肴 3 i
+美食城 38 ns
+美食天地 3 nz
+美食家 16 n
+美食村 2 nr
+美食网 3 nz
+美食节 11 n
+美食街 8 ns
+美餐 26 m
+美饰 2 n
+美香菱 2 nz
+美髯公 13 nr
+美齿 3 n
+美龄宫 3 ns
+羑 16 zg
+羓 2 zg
+羔 40 n
+羔子 67 n
+羔皮 3 n
+羔羊 83 n
+羔羊皮 6 n
+羔裘 3 n
+羔雁 3 n
+羕 6 zg
+羚 81 n
+羚牛 35 n
+羚羊 227 n
+羚羊挂角 7 nz
+羚羊绒 3 n
+羚羊角 17 n
+羚角 10 n
+羛 3 zg
+羝 65 g
+羝羊触藩 2 nr
+羞 884 v
+羞与为伍 3 n
+羞与哙伍 3 v
+羞于 3 v
+羞于为伍 3 l
+羞于启齿 12 i
+羞人 3 n
+羞人答答 3 v
+羞以牛后 3 l
+羞堪自慰 3 i
+羞女 3 n
+羞容 3 n
+羞态 3 n
+羞怯 106 a
+羞恶 4 a
+羞恶之心 4 i
+羞恼 12 a
+羞惭 121 a
+羞愤 48 a
+羞愤自杀 3 i
+羞愧 257 a
+羞愧难当 3 l
+羞明 10 a
+羞死 3 v
+羞涩 207 a
+羞点 3 n
+羞矜 3 a
+羞答答 12 z
+羞红 3 z
+羞羞 3 a
+羞羞答答 21 z
+羞羞脸 3 i
+羞耻 155 a
+羞耻之心 3 i
+羞耻心 10 n
+羞耻感 9 n
+羞耻晶片 3 n
+羞臊 3 a
+羞花闭月 3 n
+羞花闲目 3 l
+羞赧 12 a
+羞赧感 3 vn
+羞辱 253 v
+羞辱性 3 n
+羞辱者 3 n
+羞面见人 3 n
+羞鸟 3 n
+羟 92 n
+羟乙 3 n
+羟乙基化 3 nz
+羟亚胺 3 nz
+羟化 3 n
+羟化物 3 n
+羟化酶 3 nz
+羟基 490 nz
+羟汞化 3 vn
+羟烷基化 3 nz
+羟皮质醇 3 n
+羟磷灰石 3 n
+羟神经酸 3 nz
+羟脑苷脂 3 n
+羟脯氨酸 5 n
+羟脲 3 nz
+羟腈 3 n
+羟色氨酸 3 nz
+羟色胺 30 nz
+羟赖氨酸 3 n
+羟赖氨醇 3 n
+羟赖氨醛 3 n
+羟醛 3 nz
+羟钴胺素 3 n
+羡 186 v
+羡慕 682 v
+羣 67 zg
+群 8891 n
+群丑 3 n
+群丛 3 n
+群主 3 n
+群交 3 n
+群众 17849 n
+群众体育 3 l
+群众利益 3 n
+群众反映 3 i
+群众团体 3 n
+群众心理 3 i
+群众性 588 n
+群众意见 3 l
+群众斗争 3 l
+群众满意 3 l
+群众演员 3 l
+群众监督 3 n
+群众组织 41 l
+群众绿化 3 n
+群众行为 3 n
+群众观 3 l
+群众观点 3 n
+群众路线 3 l
+群众运动 225 l
+群伦 4 n
+群体 1812 n
+群体交互 3 v
+群体决策 3 n
+群体压力 3 n
+群体思维 3 l
+群体性 26 n
+群体教学 3 l
+群体管理 3 n
+群体行为 3 n
+群体训练 3 n
+群侠 3 n
+群侠传 3 n
+群像 41 n
+群僚 3 n
+群儒 7 n
+群力 2 n
+群化 3 n
+群匪 3 n
+群友 3 n
+群发 17 n
+群发器 3 n
+群发机 3 n
+群发王 3 n
+群发短信 3 j
+群口铄金 3 i
+群号码 3 n
+群呼 3 n
+群团 4 n
+群妖 3 n
+群威群胆 3 i
+群婚 23 n
+群射 3 n
+群小 3 n
+群居 97 n
+群居动物 3 n
+群居和一 3 n
+群居穴处 3 i
+群山 310 n
+群山环绕 3 l
+群山起伏 6 l
+群岛 2127 n
+群峰 65 n
+群峰叠翠 3 n
+群峰电位 3 n
+群工部 4 n
+群弟子 3 n
+群性 3 n
+群情 80 n
+群情愤慨 3 i
+群情振奋 3 l
+群情激动 3 l
+群情激奋 145 l
+群情激愤 21 l
+群情鼎沸 3 i
+群文 4 n
+群时延 3 n
+群星 71 n
+群星会 3 n
+群星奖 3 n
+群星璀灿 3 l
+群星璀璨 2 l
+群架 6 n
+群植 3 v
+群死群伤 2 i
+群殴 3 v
+群氓 10 n
+群治学社 3 n
+群流脑 3 n
+群测群防 3 n
+群生 13 n
+群的阶 3 n
+群空冀北 3 j
+群策 3 n
+群策群力 42 n
+群籍 3 n
+群系 3 n
+群组 3 n
+群经 3 n
+群羊 7 n
+群而不党 3 i
+群聊 3 v
+群聚 18 v
+群育 3 n
+群臣 533 n
+群舞 17 n
+群艺 2 n
+群艺馆 31 n
+群芳 51 n
+群芳争艳 3 l
+群芳竞艳 3 l
+群芳谱 3 l
+群英 172 n
+群英会 43 n
+群英传 3 n
+群英荟萃 3 i
+群英谱 3 n
+群落 272 n
+群落生境 3 l
+群蚁溃堤 3 n
+群蚁附羶 3 ns
+群蚁附膻 3 i
+群蛇 35 n
+群行列式 3 n
+群言 3 n
+群言堂 3 n
+群论 3 n
+群谋咸同 3 l
+群贤 12 n
+群贤毕至 3 i
+群贼 25 n
+群起 123 v
+群起攻之 3 i
+群起效尤 3 n
+群起而攻 3 i
+群起而攻之 13 i
+群轻折抽 3 i
+群轻折轴 3 n
+群速 3 n
+群速度 3 n
+群防群治 4 l
+群际行为 3 n
+群雄 1238 n
+群雄割据 3 l
+群雄逐鹿 13 n
+群集 50 n
+群雌粥粥 4 l
+群雕 6 n
+群马县 6 ns
+群魔乱舞 4 i
+群鸟 7 n
+群鸦 3 n
+群鸭雀飞 3 i
+群鸿戏海 3 i
+群龙 32 n
+群龙无首 48 i
+羧 67 n
+羧化 3 n
+羧化酶 3 n
+羧基 47 n
+羧基端 3 n
+羧甲基 3 n
+羧肽酶 3 n
+羧酶 3 n
+羧酸 114 n
+羧链孢酸 3 nz
+義 2 zg
+羪 40 zg
+羯 208 n
+羯羊 3 n
+羯鼓 11 n
+羯鼓催花 3 z
+羰 37 n
+羰基 106 n
+羰基化 3 n
+羰基镍 7 n
+羱 2 zg
+羲 62 g
+羲皇上人 2 nr
+羳 2 zg
+羶味 3 vn
+羶气 3 z
+羶腥 3 n
+羸 17 z
+羸弱 29 z
+羸疾 3 z
+羸瘦 3 z
+羹 733 ng
+羹匙 10 n
+羹汤 3 n
+羹食 3 n
+羹饭 3 n
+羼 10 g
+羽 1154 nr
+羽书 3 n
+羽冠 23 n
+羽化 76 n
+羽化成仙 3 n
+羽化登仙 3 nr
+羽叶 4 n
+羽叶茑萝 3 nr
+羽坛 100 n
+羽士 3 n
+羽扇 50 n
+羽扇烷 3 nr
+羽扇纶巾 8 nr
+羽扇豆 3 nr
+羽林军 3 nr
+羽根 4 ns
+羽模 3 n
+羽毛 442 n
+羽毛丰满 10 nr
+羽毛扇 264 n
+羽毛未丰 3 nr
+羽毛状 3 n
+羽毛球 446 n
+羽毛球场 3 n
+羽毛球拍 12 n
+羽毛球赛 81 n
+羽毛球队 69 n
+羽毛球馆 3 n
+羽毛缎 3 n
+羽片 3 n
+羽状 3 n
+羽状复叶 3 n
+羽状脉 3 n
+羽球 27 n
+羽球拍 3 n
+羽球网 3 n
+羽球赛 3 n
+羽球馆 3 n
+羽田 119 nr
+羽田孜 4 ns
+羽田机场 3 n
+羽箭 144 n
+羽纱 6 n
+羽绒 37 n
+羽绒制品 3 n
+羽绒布 3 nr
+羽绒服 30 n
+羽绒服装 3 n
+羽绒衣 3 n
+羽绒衫 3 nr
+羽绒被 5 n
+羽缎 2 n
+羽翅 10 n
+羽翮飞肉 3 nr
+羽翼 120 n
+羽翼丰满 3 nr
+羽翼已丰 3 i
+羽翼已成 2 i
+羽翼未丰 3 i
+羽翼渐丰 4 nr
+羽联 7 ns
+羽衣 42 n
+羽衣曲 3 n
+羽西 3 ns
+羽轴 3 n
+羽量级 3 n
+羽饰 3 n
+羿 28 nr
+羿与寒 3 nr
+羿射九日 3 nr
+翀 11 zg
+翁 1735 nr
+翁一掌 2 nr
+翁万料 2 nr
+翁上尉 2 nr
+翁之意 2 nr
+翁仲 4 nr
+翁倩玉 3 nr
+翁偶虹 3 nr
+翁先生 2 nr
+翁内斯 2 nr
+翁功力 2 nr
+翁加雷 3 nr
+翁厄曼 2 nr
+翁同书 2 nr
+翁同和 3 nr
+翁听雨 3 nr
+翁国钧 3 nr
+翁声甫 2 nr
+翁多河 2 nr
+翁大人 2 nr
+翁大怒 2 nr
+翁大惊 2 nr
+翁妪 3 n
+翁婿 15 nr
+翁家山 28 nr
+翁家明 3 nr
+翁富泽 3 nr
+翁尼科 7 nr
+翁山 7 nr
+翁岢隽 2 nr
+翁布里亚 2 ns
+翁师傅 62 nr
+翁广解 2 nr
+翁归靡 7 nr
+翁心存 2 nr
+翁志勇 3 nr
+翁怒极 5 nr
+翁拾起 2 nr
+翁振葆 5 nr
+翁文恭 6 nr
+翁文灏 26 nr
+翁文辉 3 nr
+翁方纲 10 nr
+翁昕歆 6 nr
+翁法勒 2 nr
+翁波意 72 nr
+翁清海 3 nr
+翁源 4 nr
+翁源县 2 nr
+翁牛特 3 nr
+翁牛特旗 13 nr
+翁独健 9 nr
+翁相斗 2 nr
+翁瞿式 2 nr
+翁立达 2 nr
+翁素知 3 nr
+翁绳荣 2 nr
+翁美玲 3 nr
+翁艾发 4 nr
+翁见杨 2 nr
+翁谈录 2 nr
+翁金河北 2 ns
+翁隆盛 9 nr
+翁飞先生 2 nr
+翁飞自 2 nr
+翂 281 zg
+翃 2 zg
+翄 13 zg
+翅 1655 ng
+翅儿 3 n
+翅子 10 n
+翅果 28 n
+翅片管 3 n
+翅翼 9 n
+翅脉 20 n
+翅膀 549 n
+翅鞘 3 n
+翈 4 zg
+翉 2 zg
+翊 86 g
+翋 19 zg
+翌 19 t
+翌年 839 t
+翌日 54 t
+翎 105 n
+翎儿 3 n
+翎子 32 n
+翎毛 39 n
+翎翅 3 n
+翑 6 zg
+翔 274 nr
+翔宇 4 nz
+翔安 3 nz
+翔安区 3 nz
+翔实 94 a
+翔泳 3 nz
+翔集 3 a
+翕 62 v
+翕动 3 v
+翕如 3 v
+翕张 9 v
+翕然 3 v
+翘 540 v
+翘上 3 v
+翘上去 3 v
+翘上来 3 v
+翘下 3 v
+翘下去 3 v
+翘下来 3 l
+翘乳 3 v
+翘企 3 n
+翘出 3 v
+翘出去 3 i
+翘出来 3 i
+翘去 3 v
+翘尾 2 v
+翘尾巴 3 n
+翘曲 2 v
+翘望 3 v
+翘板 3 n
+翘棱 3 v
+翘楚 18 n
+翘盼 3 v
+翘着 3 v
+翘翘 3 n
+翘翘板 2 n
+翘舌音 3 n
+翘角 3 n
+翘起 3 v
+翘起来 3 l
+翘趣 3 n
+翘足以待 3 i
+翘足引领 3 n
+翘足而待 3 i
+翘辫子 4 n
+翘首 181 v
+翘首以待 13 i
+翘首以望 3 i
+翘首以盼 3 i
+翘首企望 3 i
+翘首企盼 3 i
+翘首企足 3 i
+翘首引领 3 i
+翘首星空 3 i
+翘首瞻仰 3 n
+翚 31 zg
+翛 4 zg
+翟 197 nr
+翟万臣 3 nr
+翟中和 3 nr
+翟乃社 3 nr
+翟义亦 2 nr
+翟之隶 4 nr
+翟俊杰 6 nr
+翟安座 3 nr
+翟宏营 4 nr
+翟廷玉 6 nr
+翟彦鹏 19 nr
+翟志刚 3 nr
+翟振华 10 nr
+翟景升 5 nr
+翟洪波 2 nr
+翟理斯 6 nr
+翟秀敏 3 nr
+翟秋白 18 nr
+翟让兄 2 nr
+翟赋明 7 nr
+翠 1094 nr
+翠云区 3 nr
+翠亨村 12 nr
+翠华山 5 nr
+翠围珠绕 3 nr
+翠如意 3 nr
+翠屏区 3 ns
+翠屏山 14 nr
+翠屏峰 4 nr
+翠峦区 3 nr
+翠微 27 nr
+翠微居 3 nr
+翠微路 3 nr
+翠柏 25 nr
+翠柏丛 2 nr
+翠消红减 3 n
+翠玉 18 nr
+翠生生 3 nr
+翠竹 55 nr
+翠竹路 3 nr
+翠竹黄花 3 nr
+翠绕珠围 3 nr
+翠绸 3 n
+翠绿 118 nr
+翠绿色 26 nr
+翠缕 10 z
+翠色 2 n
+翠莲 5 nr
+翠菊 2 nr
+翠镍矿 3 vn
+翠饶珠围 3 nr
+翠鸟 30 nr
+翡 21 n
+翡冷翠 18 n
+翡翠 295 n
+翡翠台 3 n
+翡翠岛 3 n
+翡翠水库 3 n
+翡翠绿 3 n
+翡翠色 3 n
+翡翠谷 3 n
+翣 6 zg
+翥 5 zg
+翥凤翔鸾 3 nr
+翦 84 nr
+翦伯赞 34 nrfg
+翦草除根 3 nz
+翩 12 nr
+翩然 45 z
+翩然而至 3 i
+翩然而过 3 l
+翩翩 72 nr
+翩翩公子 3 l
+翩翩少年 2 l
+翩翩年少 3 l
+翩翩起舞 46 i
+翩翩风度 3 l
+翩翩飞 3 nr
+翩翩飞舞 8 i
+翩若惊鸿 4 i
+翩跹 14 v
+翩跹起舞 3 v
+翫岁愒时 3 v
+翬 2 zg
+翮 10 g
+翰 202 nz
+翰墨 18 n
+翰林 356 nz
+翰林学士 3 nz
+翰林汇 3 nz
+翰林院 771 nz
+翰毛 3 n
+翰海 7 nz
+翰藻 3 n
+翱 96 v
+翱游 3 vn
+翱游四海 3 vn
+翱翔 102 v
+翱翔天空 3 v
+翱翔天际 3 v
+翱翔机 3 vn
+翳 44 g
+翻 4788 v
+翻一番 3 l
+翻上 3 v
+翻上去 3 v
+翻上来 3 v
+翻下 3 v
+翻下去 3 v
+翻下来 3 l
+翻东倒海 3 i
+翻两番 97 i
+翻个儿 3 l
+翻为 3 v
+翻书 3 v
+翻了一番 3 i
+翻云覆雨 23 i
+翻些 3 d
+翻作 3 v
+翻供 18 v
+翻修 572 v
+翻倍 3 d
+翻倒 64 v
+翻入 3 v
+翻写 3 v
+翻出 3 v
+翻出去 3 i
+翻出来 3 l
+翻到 3 v
+翻刻 19 v
+翻动 97 v
+翻印 24 v
+翻印必究 3 l
+翻卷 36 v
+翻双筋斗 3 i
+翻唇弄舌 3 i
+翻唱 2 v
+翻唱网 3 n
+翻唱老歌 3 i
+翻土 3 v
+翻地 16 v
+翻场 3 n
+翻墙 3 n
+翻墙而过 3 i
+翻复无常 3 i
+翻天 27 v
+翻天作地 3 i
+翻天复地 3 i
+翻天覆地 96 i
+翻好 3 v
+翻字典 3 n
+翻完 3 v
+翻寻 3 v
+翻山 3 v
+翻山倒海 3 i
+翻山越岭 46 i
+翻工 3 v
+翻建 133 v
+翻开 306 v
+翻开书 3 l
+翻弄 15 v
+翻录 3 v
+翻得 3 v
+翻悔 16 v
+翻成 3 v
+翻手 3 v
+翻手为云 5 i
+翻扒 3 n
+翻找 25 v
+翻拍 21 v
+翻掉 3 v
+翻搅 9 v
+翻改 2 v
+翻斗 5 v
+翻斗车 2 l
+翻斤斗 3 i
+翻新 95 v
+翻旧帐 3 i
+翻旧账 2 l
+翻晒 3 v
+翻晒干草 3 i
+翻有 3 v
+翻本 19 n
+翻来 3 v
+翻来复去 11 l
+翻来翻去 3 i
+翻来覆去 200 i
+翻板 20 n
+翻查 12 v
+翻案 86 v
+翻案风 80 i
+翻检 14 v
+翻毛 4 n
+翻江倒海 36 i
+翻江搅海 3 i
+翻沉 18 v
+翻浆 3 v
+翻涌 98 v
+翻滚 317 v
+翻炒 15 v
+翻点 3 n
+翻然 5 v
+翻然悔悟 4 i
+翻然改图 3 l
+翻然改进 3 l
+翻然醒悟 3 l
+翻版 71 v
+翻版书 3 n
+翻牌 3 v
+翻番 94 v
+翻白 3 v
+翻白眼 26 l
+翻白草 2 n
+翻皮 3 v
+翻盖 17 v
+翻盖式 3 n
+翻盖机 3 n
+翻盘 81 v
+翻看 161 v
+翻眼 3 v
+翻砂 8 n
+翻砂工 3 n
+翻空出奇 3 i
+翻筋斗 3 i
+翻箱倒柜 40 i
+翻箱倒箧 3 i
+翻红 3 v
+翻翻 159 v
+翻翻看 3 i
+翻老帐 3 i
+翻老账 3 l
+翻耕 36 v
+翻肠倒肚 3 i
+翻肠搅肚 3 i
+翻胃 3 v
+翻脸 173 v
+翻脸不认 3 i
+翻脸不认人 28 l
+翻脸无情 3 i
+翻腾 208 v
+翻自 3 v
+翻船 59 v
+翻覆 17 v
+翻译 2019 v
+翻译人员 3 l
+翻译出 3 l
+翻译员 2 n
+翻译品 3 n
+翻译器 2 l
+翻译学 5 l
+翻译官 30 l
+翻译家 75 l
+翻译成 3 l
+翻译机 3 l
+翻译片 2 l
+翻译社 3 l
+翻译程序 3 l
+翻译网 3 n
+翻译者 4 n
+翻起 3 v
+翻越 115 v
+翻跟头 24 v
+翻跟斗 3 v
+翻身 1000 v
+翻身仗 15 l
+翻身解放 3 l
+翻车 48 v
+翻车鱼 3 n
+翻转 181 v
+翻转机制 3 l
+翻转运动 3 l
+翻辩 3 v
+翻过 443 v
+翻过去 3 l
+翻过来 3 l
+翻造 3 v
+翻错 3 v
+翻阅 361 v
+翻页 3 n
+翻页找字 3 l
+翻页键 3 n
+翻领 17 v
+翻飞 112 v
+翻黄倒皁 3 v
+翻黄倒皂 3 n
+翼 1289 ng
+翼侧 24 n
+翼助 3 n
+翼型 18 b
+翼城 45 ns
+翼城县 3 ns
+翼墙 3 n
+翼尖 32 n
+翼展 150 n
+翼形 7 n
+翼手目 12 n
+翼手龙 2 n
+翼板 16 n
+翼根 27 ns
+翼梢 3 n
+翼状 15 n
+翼王 3 n
+翼盒 5 n
+翼缘区 3 n
+翼缘板 3 n
+翼翅 3 n
+翼翼 3 n
+翼翼小心 3 n
+翼足 3 n
+翼足类 3 n
+翼长 3 n
+翼面 3 n
+耀 403 nz
+耀亮 3 a
+耀华 15 nz
+耀华力路 2 nz
+耀县 32 ns
+耀州区 3 ns
+耀斑 40 n
+耀星 10 nz
+耀武扬威 351 i
+耀目 20 n
+耀眼 492 a
+耀眼夺目 3 i
+耀祖 3 n
+耀祖荣宗 3 i
+耀笑道 3 i
+老 33423 a
+老一代 24 t
+老一套 27 nr
+老一辈 236 n
+老丈 65 n
+老丈人 62 n
+老三 193 nr
+老三届 13 j
+老三样 7 nr
+老三篇 3 nr
+老上去 3 t
+老上来 3 nr
+老下 3 n
+老不修 3 nr
+老不死 3 i
+老世交 3 nr
+老世伯 8 nr
+老世翁 9 nr
+老东家 3 nr
+老东西 29 nr
+老两口 127 n
+老严 3 n
+老丫挺 2 nr
+老中 3 nr
+老中医 3 nr
+老中青 14 nr
+老主顾 21 n
+老举子 2 n
+老么 3 r
+老之将至 3 i
+老九 54 nr
+老乡 381 n
+老乡会 3 n
+老二 275 nr
+老于世故 6 i
+老五 68 n
+老井 8 n
+老交情 19 n
+老亨特 3 nr
+老亲 19 n
+老人 4424 n
+老人与海 3 n
+老人头 3 n
+老人家 1703 n
+老人家非 3 ns
+老人斑 4 n
+老人星 13 n
+老人河 4 ns
+老人统治 3 n
+老人节 3 n
+老人院 2 n
+老人馆 3 n
+老仙翁 5 nr
+老任 2 n
+老伙计 39 n
+老伯 318 nr
+老伯伯 40 nr
+老伴 324 n
+老伴儿 22 nr
+老住户 5 n
+老何 12 r
+老佛爷 341 nr
+老佬 3 n
+老例 3 n
+老侍者 2 nr
+老俩口 3 vn
+老倌 17 n
+老健猛 2 nr
+老僧 3 nr
+老僧入定 3 nr
+老僧微 2 nr
+老儿 95 n
+老元臣 2 nr
+老元良 4 nr
+老兄 578 n
+老先生 384 nr
+老光 3 nr
+老光棍 3 n
+老克腊 60 nr
+老兔儿 2 nr
+老八板儿 3 n
+老八路 11 n
+老八辈子 3 l
+老公 1064 nr
+老公公 177 nr
+老六 3 nr
+老兵 283 n
+老兵不死 3 i
+老典吏 2 nr
+老军医 3 nr
+老农 49 n
+老农夫 3 nr
+老冤家 3 l
+老冬子 42 nr
+老几 38 n
+老凤祥 3 nr
+老前辈 342 n
+老办法 11 n
+老勘 3 j
+老包 5 n
+老化 304 n
+老化试验 3 n
+老区 225 n
+老区办 4 n
+老千 6 nr
+老半天 3 t
+老厂 3 n
+老友 96 n
+老友记 3 nr
+老叔 3 nr
+老叔休 2 nr
+老叟 27 nr
+老古板 4 n
+老古董 30 nr
+老台 3 n
+老叶 19 n
+老吉媳妇 2 nr
+老同事 28 n
+老同学 3 n
+老同志 265 nr
+老向 3 n
+老君 81 nr
+老君堂 2 nr
+老君山 8 nr
+老君岩 5 nr
+老君庙 12 nr
+老君殿 2 nr
+老君炉 4 nr
+老君留 2 nr
+老君眉 8 nr
+老吾老 6 nr
+老吾老以 3 nr
+老员外 3 n
+老周 56 t
+老命 3 n
+老命一条 3 l
+老命呜呼 3 l
+老和尚 3 nr
+老哈河 22 nr
+老哥 243 n
+老哥儿们 3 n
+老唱片 3 n
+老四 181 t
+老圃 3 n
+老土 20 n
+老坟 16 n
+老城 114 n
+老城区 72 ns
+老城厢 3 nr
+老城镇 5 nr
+老境 3 n
+老声老气 3 n
+老处女 11 nr
+老夏 4 n
+老外 205 n
+老大 1063 a
+老大不小 24 l
+老大哥 50 nr
+老大夫 26 nr
+老大妈 12 nr
+老大姐 17 nr
+老大娘 43 nr
+老大徒伤 3 l
+老大无成 3 i
+老大昌 2 nr
+老大爷 29 nr
+老大自居 3 nr
+老大难 179 nr
+老天 184 t
+老天拔地 4 i
+老天爷 453 nr
+老太 229 n
+老太公 3 nr
+老太太 2000 nr
+老太婆 238 nr
+老太爷 306 nr
+老夫 762 nr
+老夫妻 3 nr
+老夫子 86 nr
+老夫少妻 3 nr
+老夫老妻 14 nr
+老头 1285 n
+老头儿 412 n
+老头儿鱼 3 n
+老头子 745 n
+老套 24 n
+老套子 4 n
+老套路 3 n
+老奴 3 n
+老奴才 3 nr
+老奶奶 73 n
+老奸 3 n
+老奸巨滑 28 i
+老奸巨猾 48 i
+老好人 37 n
+老如松柏 3 nr
+老妇 485 n
+老妇人 3 n
+老妈 173 n
+老妈妈 127 nr
+老妈子 116 nr
+老妓 3 n
+老妖 3 n
+老妖精 3 n
+老妪 46 n
+老妪能解 3 vn
+老妹 3 n
+老妹子 3 nr
+老姐 3 nr
+老姐儿 3 nr
+老姑 3 n
+老姑娘 15 nr
+老姑婆 3 nr
+老姜 3 nr
+老娘 298 n
+老娘们儿 7 n
+老娼 3 n
+老婆 3000 n
+老婆儿 4 nr
+老婆大人 3 nr
+老婆婆 206 nr
+老婆子 316 nr
+老婆当军 3 nr
+老婆日记 3 n
+老媪 3 nr
+老嬷嬷 3 nr
+老子 2119 n
+老子天下第一 5 l
+老子山 2 nr
+老字号 84 n
+老学究 10 n
+老宅 66 n
+老宋 48 t
+老宋体 3 nr
+老官 3 n
+老官堡乡 3 ns
+老实 924 n
+老实事 3 n
+老实人 141 n
+老实巴交 34 n
+老实巴脚 3 z
+老实话 30 l
+老客 3 n
+老客户 3 n
+老家 686 n
+老家人 35 nr
+老家伙 165 nr
+老家儿 6 nr
+老寨村 3 nr
+老对头 3 n
+老寿星 27 nr
+老封君 2 nr
+老将 347 n
+老小 139 n
+老小孩 3 nr
+老少 138 r
+老少咸宜 8 nr
+老少无欺 3 i
+老少爷们儿 2 n
+老少皆宜 5 nr
+老少皆知 2 nr
+老少边穷 19 i
+老少配 3 nr
+老尔依 6 nr
+老尚 53 n
+老屋 30 n
+老屋里 5 nr
+老山 828 nr
+老山界 11 n
+老巢 50 n
+老工人 129 n
+老巫婆 3 nr
+老布什 3 nr
+老帅 22 nr
+老师 6415 n
+老师上课 3 n
+老师傅 62 nr
+老师宿儒 3 nr
+老帐 3 n
+老干妈 3 nr
+老干局 3 n
+老干部 70 n
+老干部局 18 n
+老年 404 t
+老年人 515 n
+老年公寓 3 n
+老年医学 8 n
+老年型 2 b
+老年大学 3 l
+老年夫妇 3 n
+老年夫妻 3 n
+老年学 6 n
+老年性 24 n
+老年性痴呆 7 i
+老年斑 10 n
+老年期 24 t
+老年病 12 n
+老年痴呆 3 i
+老年痴呆症 8 n
+老年色素 3 n
+老年间 3 n
+老幺 3 nr
+老幼 97 n
+老庄 66 nr
+老庄学会 3 n
+老庄思想 3 nr
+老庄股 3 nr
+老底 16 t
+老底子 7 n
+老店 30 n
+老店新开 3 ns
+老式 241 n
+老弟 492 n
+老张 256 n
+老弦 3 n
+老弱 3 a
+老弱伤残 3 j
+老弱妇孺 3 n
+老弱残兵 11 i
+老弱病残 30 j
+老弱病残孕 2 n
+老弱病残者 4 n
+老当益壮 13 i
+老律堂 2 nr
+老态 20 n
+老态龙钟 42 n
+老态龙锺 3 nr
+老怪 3 n
+老总 441 nr
+老想 3 n
+老愈健 2 nr
+老愚公 2 nr
+老憨汉 2 nr
+老戏骨 3 n
+老成 56 nrfg
+老成凋谢 3 i
+老成持重 40 n
+老成练达 7 nr
+老成见到 3 l
+老战友 3 n
+老战士 41 n
+老房 3 n
+老房子 53 n
+老所长 5 n
+老手 49 n
+老把式 7 n
+老把戏 3 n
+老抽 3 nz
+老拙 3 nr
+老拳 19 n
+老挝 286 ns
+老挝人民民主共和国 8 ns
+老挝人民革命党 4 nt
+老挝语 6 nz
+老掉牙 33 l
+老搭挡 3 n
+老搭档 25 n
+老支书 3 n
+老方 16 n
+老旦 20 nr
+老早 53 t
+老明友 2 nr
+老晨儿 2 nr
+老景 3 n
+老有所为 4 i
+老有所乐 2 i
+老有所养 14 i
+老有所学 3 l
+老有所终 3 i
+老朋友 421 n
+老木孔 5 nr
+老本 146 n
+老本儿 14 nr
+老本行 28 n
+老朽 154 n
+老朽无能 3 l
+老李 298 nr
+老村 3 n
+老来俏 3 nr
+老来少 3 d
+老来无伴 3 n
+老来无子 3 l
+老来瘦 3 z
+老来福 3 nr
+老杰克 3 nr
+老板 4402 n
+老板娘 146 n
+老板桌 2 n
+老板键 3 n
+老林 11 nr
+老林哥 8 nr
+老林嫂 31 nr
+老枪 3 n
+老柴 3 n
+老树 3 n
+老校 4 n
+老样子 3 n
+老根据地 3 n
+老桂树 2 nr
+老框框 3 n
+老梢公 2 nr
+老槐树 3 nr
+老檐枋 3 n
+老歌 3 n
+老武枉 2 nr
+老死 55 n
+老死不相 3 i
+老死不相往来 16 i
+老死他乡 3 n
+老死异地 3 n
+老残 3 n
+老残游记 11 n
+老母 257 n
+老母猪 3 nr
+老母鸡 3 n
+老毒物 3 n
+老毛 2 n
+老毛病 39 n
+老气 99 n
+老气横秋 36 i
+老汉 857 nr
+老汉推车 3 n
+老江湖 77 nr
+老汤 17 n
+老河口 33 ns
+老河口市 266 ns
+老油子 3 n
+老油条 37 n
+老法子 3 nr
+老泪 3 n
+老泪横流 5 i
+老泪纵横 64 l
+老洋房 3 n
+老洲岭 256 ns
+老派 22 n
+老海瑞 4 nr
+老清叔 6 nr
+老港 34 ns
+老溢血 3 nr
+老滑头 3 n
+老火 6 n
+老照片 3 n
+老熊岭 8 nr
+老爵爷 3 nr
+老父 120 n
+老父亲 38 n
+老父老母 3 nr
+老爷 2391 n
+老爷们儿 5 n
+老爷儿 3 nr
+老爷兵 3 nr
+老爷子 374 n
+老爷庙 7 nr
+老爷爷 74 nr
+老爷车 18 n
+老爸 246 n
+老爹 201 nr
+老片 3 n
+老片新看 3 i
+老版 3 n
+老牌 151 n
+老牌子 3 n
+老牛 97 n
+老牛拖车 3 n
+老牛破车 2 n
+老牛耕地 3 n
+老牛舐犊 3 n
+老物 3 n
+老特拉 3 nr
+老犟头 3 vn
+老狐狸 77 n
+老狼 3 n
+老猪 3 n
+老玉米 3 nr
+老王 190 nr
+老王卖瓜 3 n
+老琉璃 3 nr
+老生 69 n
+老生常谈 25 i
+老电影 3 n
+老疙瘩 3 l
+老病 19 n
+老病号 4 n
+老白干 6 nr
+老白干儿 3 n
+老百姓 2994 n
+老百晓 3 nr
+老的辣 3 l
+老皇历 12 nr
+老皇爷 45 nr
+老相 10 nr
+老相好 15 nr
+老相识 26 n
+老眼光 8 nr
+老眼昏花 16 i
+老着脸皮 9 l
+老知青 3 nr
+老祖 179 nr
+老祖先 3 nr
+老祖宗 190 nr
+老祖母 3 nr
+老神在在 3 i
+老禅师 3 nr
+老秀才 60 nr
+老窖 17 n
+老窝 42 n
+老童 20 n
+老筋 3 n
+老管家 3 n
+老粗 12 n
+老糊涂 37 z
+老红军 85 nr
+老练 106 n
+老练通达 3 n
+老维克 5 nr
+老美 3 nr
+老羞成怒 33 i
+老翁 159 nr
+老老 3 nr
+老老实实 253 z
+老老少少 27 nr
+老者 1838 n
+老而不死 3 i
+老而弥坚 6 nr
+老股 3 n
+老股民 3 n
+老脑筋 7 n
+老脸 67 n
+老脸皮 3 nr
+老脾气 8 n
+老臣 181 n
+老臣议 2 nr
+老臭虫 3 nr
+老舅 15 n
+老舍 85 n
+老色狼 3 nr
+老色鬼 3 n
+老花 33 n
+老花样 3 l
+老花眼 3 n
+老花眼镜 3 l
+老花镜 41 n
+老范 60 n
+老茎 3 n
+老茎生 4 nr
+老茧 36 n
+老莱娱亲 3 nr
+老莱子 257 nr
+老营 1226 nr
+老营盘 3 n
+老蔫 3 z
+老蔫儿 3 n
+老虎 732 nr
+老虎凳 7 nr
+老虎口 2 nr
+老虎头 11 nr
+老虎币 3 n
+老虎机 18 nr
+老虎沟 3 nr
+老虎滩 7 nr
+老虎灶 11 nr
+老虎皮 22 nr
+老虎钳 3 nr
+老蚌珠胎 3 i
+老蚌生珠 3 i
+老蚕作茧 3 n
+老行家 3 n
+老街 45 n
+老街区 2 n
+老街坊 4 nr
+老街旧邻 3 l
+老表 16 n
+老衲 397 nr
+老规矩 54 n
+老视眼 3 n
+老警 3 n
+老记 5 n
+老许 6 d
+老诚诚 2 nr
+老话 111 n
+老话儿 3 n
+老说是 3 n
+老调 8 n
+老调子 6 nr
+老调重弹 9 n
+老调重谈 2 i
+老谋子 3 n
+老谋深算 64 i
+老豆 3 n
+老豆腐 5 n
+老财 16 n
+老账 10 n
+老贼 3 n
+老资格 36 n
+老赖 34 n
+老趼 3 nr
+老路 33 n
+老路子 3 n
+老身 84 n
+老辈 26 n
+老辣 41 a
+老边 6 n
+老边区 3 n
+老迈 83 nr
+老迈无能 3 nr
+老迈龙钟 3 nr
+老运 3 n
+老运亨通 3 nr
+老远 196 nr
+老通城 3 n
+老道 309 n
+老部 3 n
+老酒 39 n
+老醋 8 n
+老金 46 n
+老铁山 34 nr
+老铺 13 n
+老长 3 n
+老闺女 3 n
+老队员 3 n
+老阿公 2 nr
+老阿婆 3 nr
+老陆 53 n
+老陈醋 13 i
+老雕 14 n
+老面子 5 n
+老面孔 3 n
+老面皮 3 n
+老顽固 2 nr
+老顽童 3 nr
+老马 270 n
+老马为驹 3 nr
+老马嘶风 3 nr
+老马恋栈 3 nr
+老马识途 3 n
+老骥伏枥 8 nr
+老骨头 3 n
+老高 213 n
+老高太太 2 nr
+老鸟 8 n
+老鸟们 3 n
+老鸦 48 n
+老鸨 69 n
+老鸭 8 n
+老鸹 28 n
+老鹤乘轩 3 nr
+老鹰 107 nr
+老鹰队 3 n
+老鹳草 3 nr
+老麦 3 n
+老麻雀 3 n
+老黄历 6 n
+老黄牛 18 nr
+老黄酒 3 n
+老黑山 12 nr
+老鼠 747 n
+老鼠会 4 n
+老鼠屎 12 n
+老鼠洞 8 n
+老鼠瓜 3 n
+老鼠的儿子会打洞 4 n
+老鼠药 3 n
+老鼠过街 3 n
+老鼻子 7 n
+老龄 323 n
+老龄化 73 n
+老龄委 2 n
+老龙口 3 nr
+老龙头 25 nr
+老龟 3 n
+耂 65 zg
+考 5973 v
+考上 483 v
+考不上 3 v
+考不倒 3 v
+考不到 3 v
+考中 3 v
+考伯 2 n
+考倒 3 v
+考克 3 nrt
+考克斯 7 nrt
+考入 360 v
+考其原因 3 n
+考出 3 v
+考出来 3 vn
+考分 86 n
+考利 2 vn
+考到 3 v
+考前 291 v
+考前考后 3 n
+考务 58 vn
+考务费 3 n
+考勤 26 vn
+考勤制度 3 n
+考勤卡 2 nr
+考勤机 3 n
+考勤簿 3 n
+考勤表 3 n
+考勤记录 3 n
+考勤钟 3 nr
+考区 17 n
+考博士 3 n
+考卷 452 v
+考卷纸 3 n
+考取 416 v
+考古 1191 vn
+考古学 464 n
+考古学家 246 n
+考古学界 11 n
+考古工作者 40 n
+考古所 14 n
+考古界 20 n
+考古系 2 n
+考古队 113 n
+考古题 3 n
+考号 3 n
+考名责实 3 n
+考场 412 n
+考大学 3 n
+考夫卡 3 nrt
+考夫曼 13 nrt
+考季 3 t
+考学 18 n
+考完试 3 nr
+考官 339 n
+考察 4128 v
+考察团 131 n
+考察干部 3 n
+考察报告 3 n
+考察期 4 n
+考察点 2 n
+考察站 27 n
+考察组 18 n
+考察者 8 n
+考察船 23 n
+考察费 2 n
+考察队 69 n
+考察队员 12 n
+考尔 6 nrt
+考录 15 v
+考拉 7 nrt
+考招生 3 v
+考据 104 n
+考据学 16 n
+考期 3 vn
+考来考去 3 nr
+考查 406 vn
+考校 3 n
+考核 2094 vn
+考核内容 3 n
+考核制 2 v
+考核制度 3 n
+考核办法 3 n
+考核成绩 3 n
+考核组 10 n
+考核表 6 n
+考比伦杯 5 ns
+考法 3 vn
+考点 223 n
+考爱岛 8 nr
+考献 3 n
+考生 7274 v
+考着 3 v
+考研 2095 vn
+考研书 3 n
+考研币 3 n
+考研热 13 n
+考研班 3 n
+考研网 3 n
+考研题 3 n
+考种 3 v
+考稽 3 v
+考究 259 vn
+考米尔 15 nrt
+考索 3 v
+考级 7 vn
+考纪 12 n
+考纲 3 n
+考纳斯 3 nrt
+考练 3 vn
+考绩 14 n
+考绩幽明 3 nr
+考考 3 v
+考考你 3 nr
+考考试 3 n
+考茨基 16 nrt
+考虎 3 n
+考虑 8585 v
+考虑一下 3 n
+考虑不周 3 n
+考虑周到 3 nr
+考虑看看 3 nr
+考覈 3 vn
+考订 114 v
+考证 1148 v
+考证学 3 n
+考证学家 3 n
+考评 124 v
+考评组 3 n
+考试 7815 vn
+考试内容 3 n
+考试分数 3 n
+考试制度 3 n
+考试卷 9 n
+考试及格 3 n
+考试合格 3 n
+考试合格者 13 n
+考试哦 3 v
+考试团 3 n
+考试学 3 n
+考试成绩 3 n
+考试指南 3 n
+考试法 3 n
+考试网 3 n
+考试考核 3 n
+考试者 3 n
+考试虫 3 n
+考试费 3 v
+考试通知 3 n
+考试院 220 n
+考试院长 3 n
+考试题 86 n
+考语 10 v
+考起 3 v
+考过 3 v
+考过去 3 v
+考过来 3 v
+考运 3 v
+考选 3 v
+考选部 3 n
+考释 3 v
+考量 101 n
+考错 3 v
+考问 15 v
+考题 239 n
+考题大全 3 n
+考风 14 v
+考驾照 3 nr
+考验 1290 vn
+考验性 3 n
+耄 100 i
+耄耋 10 n
+耄耋之年 8 i
+耄龄 3 n
+者 23521 k
+者勒米 3 nz
+者奈 3 ns
+者阴山 5 ns
+耆 162 zg
+耆儒 3 n
+耆宿 26 n
+耆年硕德 3 v
+耆德硕老 3 vn
+耆老 134 n
+耆那教 46 n
+耊 6 zg
+耋 6 g
+而 143233 c
+而且 22638 c
+而为 3 c
+而于 3 c
+而今 292 t
+而今而后 5 i
+而以 3 c
+而使 3 c
+而光 3 c
+而其 3 c
+而况 5 c
+而出名 3 i
+而后 651 c
+而后快 3 i
+而复 95 d
+而外 108 c
+而已 3085 y
+而延 3 v
+而无须 3 i
+而是 10185 c
+而有 3 c
+而来 3 c
+而立 601 v
+而立之年 29 i
+而胜于蓝 3 i
+而要 3 c
+而言 3906 c
+而论 579 c
+而轩 2 i
+而过 3 c
+而非 3 c
+耍 1197 v
+耍不动 3 l
+耍两面派 6 l
+耍刀弄枪 3 l
+耍单儿 3 l
+耍嘴 3 v
+耍嘴皮 3 l
+耍嘴皮子 11 l
+耍大牌 3 l
+耍太极 3 v
+耍奸 3 v
+耍威风 16 l
+耍娇 3 v
+耍子 3 l
+耍宝 3 v
+耍弄 45 v
+耍弄刀枪 3 l
+耍弄手腕 3 l
+耍心眼 5 l
+耍心眼儿 3 l
+耍态度 2 l
+耍手段 3 l
+耍手腕 3 l
+耍手艺 3 l
+耍把 3 v
+耍把戏 9 l
+耍把戏者 3 l
+耍掉 3 v
+耍排场 3 l
+耍无赖 21 l
+耍横 3 v
+耍泼 5 l
+耍活宝 3 l
+耍派头 3 l
+耍流氓 11 l
+耍滑 20 v
+耍滑头 3 l
+耍猴 24 v
+耍猴儿 11 l
+耍玩 3 v
+耍笑 31 v
+耍笔杆 3 l
+耍笔杆子 6 l
+耍耍 3 v
+耍脾气 9 l
+耍花招 9 l
+耍花枪 3 l
+耍花样 3 l
+耍花腔 3 l
+耍蛇者 3 l
+耍贫嘴 9 l
+耍赖 49 v
+耍赖皮 3 l
+耍起 3 v
+耍起来 3 l
+耍酒疯 3 l
+耍酒风 3 l
+耍钱 3 v
+耍闹 3 v
+耍阴谋 3 l
+耍频嘴 3 l
+耍风 3 v
+耐 1285 nz
+耐不住 3 l
+耐久 63 a
+耐久力 5 l
+耐久度 3 l
+耐久性 27 n
+耐久霉素 3 n
+耐人咀嚼 3 i
+耐人寻味 124 i
+耐人玩味 2 nz
+耐低温 3 n
+耐住 3 v
+耐候性 9 n
+耐克 30 nz
+耐克公司 3 n
+耐克森 3 nr
+耐克鞋 3 nz
+耐冲击 10 i
+耐力 126 nz
+耐力板 3 nz
+耐力赛 4 nz
+耐劳 14 a
+耐化学 3 l
+耐压 41 nz
+耐压性 3 n
+耐受 97 a
+耐受力 7 nz
+耐受原 3 n
+耐受性 31 n
+耐基 2 nz
+耐寒 162 a
+耐寒性 3 n
+耐尔 4 nz
+耐得 36 v
+耐德 2 nz
+耐心 823 a
+耐性 62 n
+耐打 3 nz
+耐旱 73 a
+耐旱作物 3 l
+耐旱性 9 n
+耐旱植物 3 l
+耐晒 3 v
+耐氧菌 3 n
+耐水 3 n
+耐水性 6 n
+耐水洗 3 nz
+耐油 17 nz
+耐油地面 3 n
+耐油性 2 n
+耐波性 8 n
+耐洗 3 b
+耐洗刷 3 l
+耐液体性 3 n
+耐渍性 3 n
+耐温 9 nz
+耐温性 3 n
+耐渴 3 a
+耐湿性 2 n
+耐湿植物 3 l
+耐溶剂 3 nz
+耐火 98 a
+耐火度 3 l
+耐火性 3 n
+耐火材料 76 l
+耐火泥 2 nz
+耐火砖 5 nz
+耐火等级 3 l
+耐火纤维 3 l
+耐火黏土 3 vn
+耐烦 33 a
+耐热 85 a
+耐热合金 3 n
+耐热性 38 n
+耐热蔬菜 3 nz
+耐热钢 9 nz
+耐热铸铁 3 l
+耐燃 3 b
+耐燃性 3 n
+耐特 14 nz
+耐用 148 a
+耐用品 10 n
+耐用度 3 n
+耐用性 3 n
+耐盐作物 3 l
+耐盐性 2 n
+耐盐碱 3 l
+耐看 14 a
+耐硷性 3 vn
+耐碱 3 n
+耐碱性 3 n
+耐磨 134 a
+耐磨性 65 n
+耐磨性能 3 l
+耐磨损 3 i
+耐磨材料 3 l
+耐磨钢 3 nz
+耐穿 10 v
+耐纶 3 nz
+耐老化 3 l
+耐脏 3 n
+耐腐 33 nz
+耐腐蚀 54 nz
+耐腐蚀性 3 n
+耐苦 3 an
+耐药 38 nz
+耐药性 43 nz
+耐虫害性 3 n
+耐蚀 19 nz
+耐蚀性 30 n
+耐读 7 v
+耐酸 50 nz
+耐酸地面 3 nz
+耐酸性 3 nz
+耐酸碱 3 nz
+耐量 18 n
+耐震 2 n
+耐饥 19 a
+耐高温 90 nz
+耑 11 zg
+耒 28 ns
+耒耜 26 n
+耒阳 19 ns
+耒阳市 3 ns
+耓 17 zg
+耕 677 n
+耕云播雨 3 n
+耕作 691 vn
+耕作业 279 n
+耕作制度 3 n
+耕作层 9 n
+耕作机 7 n
+耕作机具 3 n
+耕佣 3 vn
+耕具 3 n
+耕农 3 n
+耕出 3 v
+耕地 1437 n
+耕地面积 3 n
+耕层 22 n
+耕当问奴 3 n
+耕牛 71 n
+耕牧 3 n
+耕犁 3 n
+耕田 230 n
+耕畜 17 n
+耕种 534 n
+耕稼 3 n
+耕织 3 n
+耕翻 18 v
+耕者 3 n
+耕者有其 3 n
+耕耘 239 v
+耕耘机 3 n
+耕耘树艺 3 n
+耕耘者 2 n
+耕莘 3 n
+耕莘医院 3 n
+耕获 3 v
+耕读 35 v
+耕食 3 n
+耕马 3 n
+耖 7 n
+耗 602 v
+耗住 3 v
+耗体力 3 n
+耗减 3 v
+耗力 3 n
+耗去 3 v
+耗子 238 n
+耗子药 3 n
+耗尽 214 v
+耗尽层 3 z
+耗损 55 v
+耗损率 3 n
+耗损量 3 n
+耗掉 3 v
+耗散 63 v
+耗散力 3 n
+耗散因数 3 n
+耗时 75 n
+耗时耗事 3 n
+耗时间 3 n
+耗材 56 n
+耗材类 3 n
+耗气 3 n
+耗气量 3 n
+耗氧量 2 n
+耗水 10 v
+耗水量 5 n
+耗油 23 n
+耗油率 8 n
+耗油量 31 n
+耗热 3 v
+耗热量 3 n
+耗煤量 7 n
+耗用 64 v
+耗电 53 v
+耗电率 3 n
+耗电量 41 n
+耗着 3 v
+耗神 3 n
+耗竭 58 v
+耗羡 2 v
+耗能 26 v
+耗能吧 3 n
+耗血 3 v
+耗费 602 v
+耗资 291 v
+耗资近 3 n
+耘 59 vg
+耘地 3 n
+耘田 3 n
+耘艺 3 n
+耘草 3 n
+耘锄 3 n
+耙 756 n
+耙土 3 n
+耙地 3 nz
+耙子 15 n
+耙平 3 nz
+耙开 3 v
+耙犁 2 n
+耙田 3 nz
+耙组 3 n
+耙耱 4 v
+耙齿 7 n
+耜 29 g
+耠 2 v
+耡 43 zg
+耢 9 n
+耣 3 zg
+耦 35 zg
+耦合 166 vn
+耦合孔 3 vn
+耦合度 3 vn
+耦合探针 3 v
+耦合摆 3 vn
+耦合环 3 vn
+耦耕乡 3 vn
+耦联 3 vn
+耦色 3 vn
+耧 23 g
+耨 28 g
+耩 9 g
+耪 56 v
+耪地 2 v
+耰 7 zg
+耱 4 g
+耳 4244 n
+耳下腺 2 n
+耳下腺炎 3 n
+耳不旁听 3 i
+耳中 3 s
+耳光 615 n
+耳刀 3 n
+耳刮子 25 n
+耳力 3 n
+耳后生风 3 i
+耳听为虚 7 i
+耳听八方 33 i
+耳听心受 3 i
+耳听是虚 3 i
+耳呜 3 i
+耳和髎 3 nz
+耳坠 34 n
+耳坠子 7 n
+耳垂 58 n
+耳垢 3 n
+耳塞 19 n
+耳塞式 3 n
+耳塞着 3 n
+耳壳 3 n
+耳套 3 n
+耳子 3 n
+耳孔 31 n
+耳尖 3 n
+耳屎 3 n
+耳屏 13 n
+耳廓 47 n
+耳性 3 n
+耳房 66 n
+耳报神 17 n
+耳挖 3 v
+耳挖子 4 n
+耳提面命 15 i
+耳旁风 26 i
+耳朵 2141 n
+耳朵垂 3 n
+耳朵尖 9 l
+耳朵底子 3 n
+耳朵痛 3 n
+耳朵眼 6 n
+耳朵眼儿 2 l
+耳朵软 3 n
+耳机 270 n
+耳机线 3 n
+耳栓 3 n
+耳根 82 n
+耳根子 31 n
+耳根清净 5 i
+耳根清静 3 i
+耳毛 3 n
+耳沈 3 nz
+耳治 3 n
+耳洞 3 n
+耳满鼻满 3 i
+耳濡目染 68 i
+耳炎 3 n
+耳点 3 n
+耳热 3 n
+耳热心跳 3 i
+耳熏目染 3 l
+耳熟 36 a
+耳熟能详 53 i
+耳环 120 n
+耳环孔 3 n
+耳生 2 n
+耳畔 123 n
+耳疾 3 n
+耳病 2 n
+耳痛 3 n
+耳目 362 n
+耳目一新 110 i
+耳目之娱 3 n
+耳目众多 3 i
+耳目喉舌 3 n
+耳目失聪 3 i
+耳目昭彰 3 i
+耳目股肱 3 n
+耳目闭塞 3 n
+耳石 3 n
+耳福 9 n
+耳科 11 n
+耳科医生 3 n
+耳科学 3 n
+耳穴 12 n
+耳红面赤 3 i
+耳罩 4 n
+耳翼 3 n
+耳聋 128 vn
+耳聋眼 3 i
+耳聋眼黒 3 i
+耳聪 4 nz
+耳聪目明 13 i
+耳背 14 n
+耳膜 44 n
+耳药水 3 n
+耳蜗 40 n
+耳视目听 3 i
+耳视目食 3 i
+耳识 3 n
+耳语 139 n
+耳语的人 3 n
+耳语般 3 i
+耳轮 11 n
+耳软 3 a
+耳软心活 2 i
+耳边 844 s
+耳边风 20 n
+耳道 43 n
+耳部 18 n
+耳郭 3 n
+耳针 10 n
+耳钉 14 n
+耳镜 3 n
+耳门 22 n
+耳闻 113 n
+耳闻为虚 3 i
+耳闻则诵 3 i
+耳闻是虚 3 i
+耳闻目击 3 i
+耳闻目睹 31 i
+耳闻目见 2 i
+耳际 24 n
+耳音 3 n
+耳顺 3 nz
+耳顺之年 3 i
+耳风 3 n
+耳食 3 n
+耳食之言 3 i
+耳食之论 3 i
+耳食之谈 3 i
+耳饰 14 n
+耳鬓 3 n
+耳鬓厮磨 19 i
+耳鬓撕磨 3 vn
+耳鬓斯磨 3 i
+耳鸣 130 v
+耳鸣现象 3 n
+耳麦 2 n
+耳鼓 44 n
+耳鼻咽 3 i
+耳鼻喉 3 n
+耳鼻喉科 36 n
+耳鼻科 3 n
+耵 4 n
+耵聍 4 n
+耶 1106 nr
+耶克斯 2 nr
+耶利内克 6 ns
+耶利哥 3 nr
+耶利奇 26 nr
+耶利瓦勒 2 nrt
+耶利米 5 nr
+耶古卜 2 nr
+耶和华 32 nr
+耶城 19 ns
+耶塞特 4 nr
+耶夫斯基 61 nrt
+耶夫采 2 nr
+耶夫采娃 2 nr
+耶宇之 2 nr
+耶尔先生 2 nr
+耶尔尼斯 32 nrt
+耶尔德 2 nr
+耶尔森 3 nr
+耶布斯 2 nr
+耶希尔 2 nr
+耶帕凤 3 nr
+耶律乙辛 11 nr
+耶律亿 5 nr
+耶律休 7 nr
+耶律休哥 13 nr
+耶律余 4 nr
+耶律倍 6 nr
+耶律兄 12 nr
+耶律克 4 nr
+耶律公子 2 nr
+耶律国 3 ns
+耶律国珍 4 nr
+耶律图 2 nr
+耶律基 12 nr
+耶律大 6 nr
+耶律大石 286 nr
+耶律夫人 2 nr
+耶律奚 2 nr
+耶律宗 2 nr
+耶律宗云 2 nr
+耶律宗霖 4 nr
+耶律履 2 nr
+耶律帮 2 nr
+耶律延禧 26 nr
+耶律得 2 nr
+耶律德 32 nr
+耶律怀 4 nr
+耶律思轸 6 nr
+耶律斜轸 18 nr
+耶律晋 35 nr
+耶律楚材 98 nr
+耶律氏 6 nr
+耶律沙 3 nr
+耶律洪 6 nr
+耶律洪基 180 nr
+耶律涅鲁 2 nr
+耶律淳 56 nr
+耶律燕 91 nr
+耶律燕耶 2 nr
+耶律留 2 nr
+耶律莫 4 nr
+耶律莫哥 3 nr
+耶律谷 2 nr
+耶律辉 2 nr
+耶律重 2 nr
+耶律重元 3 nr
+耶律铸 41 nr
+耶律阿 7 nr
+耶律隆 2 nr
+耶律隆绪 5 nr
+耶律雄 2 nr
+耶律雄奴 2 nr
+耶律齐 524 nr
+耶律齐固 2 nr
+耶律齐奇 2 nr
+耶律齐耶 4 nr
+耶戈尔 3 nr
+耶摩诃 2 nr
+耶教 3 nz
+耶斯特 4 nr
+耶林克 3 nr
+耶梯目 2 nr
+耶泽尔察 2 nr
+耶特律 2 nr
+耶百科 3 nr
+耶稣 469 nr
+耶稣会 3 n
+耶稣基督 3 n
+耶稣教 12 n
+耶稣教徒 3 n
+耶纳全 2 nr
+耶纳斯 2 nr
+耶维奇 11 nr
+耶芳斯 3 nr
+耶茨 4 nrt
+耶西 2 ns
+耶诞 3 n
+耶诞夜 3 n
+耶诞节 3 n
+耶路 3 nr
+耶路撒冷 351 ns
+耶路撒冷城 3 ns
+耶路撤冷 3 z
+耶酥 6 nr
+耶酥教 3 nr
+耶里 5 nrt
+耶里奇 3 nr
+耶非耶 3 nr
+耶鲁 46 nr
+耶鲁大学 116 nt
+耷 23 v
+耷拉 121 v
+耸 566 vg
+耸了耸 3 v
+耸了耸肩 3 i
+耸人听闻 75 i
+耸入 3 v
+耸入云霄 3 i
+耸出 3 v
+耸动 74 v
+耸动视听 3 i
+耸听 3 v
+耸壑凌霄 3 i
+耸壑昂霄 3 i
+耸峙 15 v
+耸恿 3 v
+耸惧 3 v
+耸立 263 v
+耸立着 3 i
+耸耸 3 v
+耸耸肩 22 i
+耸肩 45 v
+耸肩曲背 3 i
+耸肩缩背 3 i
+耸膊成山 3 i
+耻 295 n
+耻与哙伍 3 v
+耻居人下 3 n
+耻居王后 3 n
+耻笑 140 v
+耻言人过 3 i
+耻辱 374 n
+耻辱感 7 n
+耻辱柱 13 n
+耻骨 31 n
+耽 264 v
+耽乐 3 v
+耽于 20 v
+耽延 3 v
+耽心 21 v
+耽忧 9 v
+耽惊受怕 3 v
+耽搁 552 v
+耽搁到 3 vn
+耽湎 3 v
+耽溺 3 v
+耽误 697 v
+耽误到 3 v
+耽误时间 3 v
+耽迷 3 v
+耿 130 nr
+耿万钟 74 nr
+耿云志 4 nr
+耿京归 3 nr
+耿介 11 nr
+耿介人士 3 nr
+耿仲明 22 nr
+耿伯钊 2 nr
+耿南仲 13 nr
+耿咏 3 nrfg
+耿大勇 22 nr
+耿天霜 3 nr
+耿天霸 19 nr
+耿学鹏 2 nr
+耿守忠 2 nr
+耿寿昌 18 nr
+耿少明 3 nr
+耿尔直 3 nr
+耿庄镇 3 nr
+耿延禧 4 nr
+耿建国 3 nr
+耿恭见 2 nr
+耿文秀 3 nr
+耿新灵 2 nr
+耿汝光 2 nr
+耿炳文 53 nr
+耿瑞义 3 nr
+耿直 69 nr
+耿秀莲 4 nr
+耿秋战 2 nr
+耿精忠 34 nr
+耿继茂 5 nr
+耿继进 4 nr
+耿耿 55 nr
+耿耿不忘 2 i
+耿耿不躲 3 i
+耿耿之 2 nr
+耿耿于心 6 i
+耿耿于怀 127 i
+耿耿保 3 nr
+耿耿兮 2 nr
+耿耿忠心 3 i
+耿耿星河 3 nr
+耿耿长 2 nr
+耿长锁 10 nr
+耿飙 2 nrfg
+耿飚 2 nrfg
+耿饼 2 nr
+耿马傣族佤族自治县 4 ns
+聀 14 zg
+聂 111 nr
+聂伯河 3 nr
+聂伯湾 2 nr
+聂凤智 257 nr
+聂卫平 33 nr
+聂向庭 2 nr
+聂国辉 2 nr
+聂士全 3 nr
+聂士成 82 nr
+聂大哥 4 nr
+聂天风 2 nr
+聂宗峰 2 nr
+聂宝璋 4 nr
+聂家拳 2 nr
+聂家河 2 nr
+聂崇岐 2 nr
+聂崇歧 2 nr
+聂庄村 3 nr
+聂思脱 23 nr
+聂愿愿 2 nr
+聂拉木 6 nr
+聂拉木县 3 ns
+聂振邦 3 nr
+聂斯托 11 nr
+聂斯脱 8 nr
+聂新二 2 nr
+聂新勇 10 nr
+聂毓禅 2 nr
+聂永芳 3 nr
+聂海涛 6 nr
+聂海胜 266 nr
+聂立人 2 nr
+聂绀弩 5 nr
+聂老拳师 4 vn
+聂耳 28 nr
+聂聂 3 nr
+聂聂雄 2 nr
+聂荣 6 nr
+聂荣县 4 nr
+聂荣臻 145 nrfg
+聂荣贵 2 nr
+聂赫留 2 nr
+聂远 3 nrfg
+聂部武 2 nr
+聂隐娘 26 nr
+聂鲁达 10 nr
+聃 11 g
+聄 6 zg
+聆 99 v
+聆取 3 v
+聆听 161 v
+聆听会 3 v
+聆教 3 v
+聆讯 3 v
+聆赏 3 v
+聆音察理 3 nz
+聊 825 v
+聊且 3 d
+聊个 3 d
+聊个痛快 3 n
+聊以 23 v
+聊以卒岁 3 i
+聊以塞责 3 i
+聊以自娱 3 n
+聊以自慰 139 i
+聊以解嘲 3 i
+聊到 3 v
+聊友 3 nz
+聊城 94 ns
+聊城市 12 ns
+聊备一格 3 nz
+聊复尔耳 3 i
+聊天 560 nz
+聊天事 3 i
+聊天人 3 nz
+聊天儿 3 nz
+聊天写作 3 i
+聊天室 70 nz
+聊天工具 3 nz
+聊天站 3 nz
+聊天网 3 nz
+聊天记录 3 nz
+聊得 3 v
+聊性 3 n
+聊斋 29 nz
+聊斋志异 33 nz
+聊来聊去 3 i
+聊法 3 v
+聊生 3 v
+聊着 3 v
+聊聊 233 v
+聊聊吧 3 n
+聊聊天 59 i
+聊胜一筹 3 i
+聊胜于无 11 i
+聊表 3 v
+聊表寸心 3 i
+聊表心意 3 i
+聊赖 3 v
+聊起 3 v
+聊起来 3 v
+聊过 3 v
+聋 272 n
+聋人 8 n
+聋儿 5 n
+聋哑 88 n
+聋哑人 15 n
+聋哑婆婆 3 n
+聋哑学校 9 n
+聋哑症 3 n
+聋子 69 n
+聋盲 3 n
+聋者之歌 3 n
+职 6037 ng
+职业 21581 n
+职业中专 3 n
+职业中学 33 n
+职业倦怠 3 nr
+职业化 128 n
+职业咨询 3 nz
+职业培训 3 n
+职业女性 3 n
+职业妇女 3 n
+职业工会 3 n
+职业性 53 n
+职业技能 3 n
+职业指导 3 n
+职业服 3 n
+职业服装 3 n
+职业杀手 3 n
+职业生涯 3 n
+职业病 187 n
+职业经理 3 n
+职业者 20 n
+职业联赛 3 n
+职业装 20 n
+职业规划 3 n
+职业资格 3 n
+职业赛 3 n
+职业辅导 3 n
+职业道德 162 n
+职业阶级 3 n
+职业院校 3 n
+职业顾问 3 n
+职业高中 27 n
+职事 3 n
+职介 27 n
+职介所 28 n
+职代会 14 n
+职任 3 n
+职份 3 n
+职位 2478 n
+职分 141 n
+职别 5 n
+职前教育 3 l
+职务 4099 n
+职务侵占 3 l
+职务侵占罪 2 n
+职务分类 3 n
+职务工资 18 n
+职务津贴 3 n
+职务犯罪 3 n
+职务考核 3 n
+职务行为 3 n
+职协 3 j
+职司 2026 n
+职员 617 n
+职员会 2 n
+职员表 3 n
+职场 3 n
+职大 16 j
+职守 60 n
+职官 475 n
+职官表 3 n
+职工 5213 n
+职工之中 3 l
+职工代表 3 n
+职工基本 3 n
+职工大学 3 n
+职工宿舍 3 n
+职工工资 3 n
+职工收入 3 n
+职工教育 3 l
+职工福利 3 n
+职工群众 3 n
+职工股 3 n
+职工薪津 3 n
+职工队伍 3 n
+职工食堂 3 n
+职志 3 n
+职技司 3 n
+职掌 120 n
+职改 3 j
+职改办 11 j
+职教 26 n
+职教司 3 n
+职教社 2 n
+职数 7 n
+职是之故 3 l
+职权 6518 n
+职权所在 3 l
+职权范围 3 n
+职杖 3 n
+职校 52 n
+职棒 3 n
+职棒大赛 3 n
+职称 568 n
+职称外语 3 n
+职称改革 3 l
+职称者 2 n
+职称论文 3 n
+职称评定 3 n
+职系 3 n
+职级 44 n
+职能 3212 n
+职能作用 3 n
+职能资本 3 n
+职能部门 3 n
+职蜂 3 n
+职衔 75 n
+职责 1842 n
+职责所在 3 l
+职高 346 n
+职高生 3 n
+聍 2 x
+聒 29 zg
+聒不知耻 3 v
+聒噪 67 a
+聒耳 6 a
+聒聒叫 3 z
+联 3081 v
+联东 2 ns
+联于 3 v
+联井 3 n
+联交所 2 nt
+联产 21 j
+联产品 3 n
+联产承包 52 n
+联产承包制 18 n
+联众 7 n
+联会 38 n
+联体 7 n
+联体病毒 3 l
+联保 38 j
+联信 2 v
+联储 5 j
+联储局 12 nt
+联共 3 j
+联军 843 n
+联军部队 3 nt
+联创 55 v
+联办 35 v
+联动 192 v
+联动台 3 n
+联动性 2 n
+联动扫描 3 n
+联动机制 3 n
+联勤 38 n
+联勤总部 3 nt
+联勤部 3 nt
+联华 43 nz
+联句 36 n
+联合 8569 v
+联合主义 3 n
+联合会 1335 nt
+联合会杯 17 nz
+联合体 184 nt
+联合作战 3 l
+联合党 25 nt
+联合公报 71 nt
+联合共和国 22 nt
+联合内阁 3 n
+联合利华 3 nz
+联合制 3 n
+联合卡环 3 nz
+联合印模 3 n
+联合国 2976 nt
+联合国人口基金 2 nt
+联合国人权委员会 2 nt
+联合国儿童基金会 7 nt
+联合国国际贸易法委员会 3 nt
+联合国大会 140 nt
+联合国安全理事会 8 nt
+联合国安理会 183 nt
+联合国开发计划署 22 nt
+联合国总部 15 nt
+联合国教科文组织 783 nt
+联合国教科文组织世界遗产委员会 2 nt
+联合国日内瓦办事处 5 nt
+联合国案 3 n
+联合国环境规划署 15 nt
+联合国秘书处 8 nt
+联合国粮农组织 27 nt
+联合国粮食及农业组织 3 nt
+联合国经济及社会理事会 4 nt
+联合国经社理事会 2 nt
+联合国贸易和发展会议 8 nt
+联合国难民事务高级专员公署 2 nt
+联合型 3 n
+联合声明 3 l
+联合大厦 3 nt
+联合宣言 3 l
+联合工专 3 nt
+联合开发 3 nt
+联合式 3 n
+联合战线 23 nz
+联合报 54 nt
+联合报系 3 nt
+联合推出 3 l
+联合操作 3 l
+联合支持 3 v
+联合收割 3 l
+联合攻关 3 n
+联合政府 469 nt
+联合早报 3 nt
+联合晚报 3 nz
+联合机 5 n
+联合派 3 n
+联合演习 3 n
+联合演出 3 l
+联合王国 58 nt
+联合疫苗 3 n
+联合社 7 nt
+联合纤维 3 l
+联合经营 3 l
+联合结构 3 n
+联合航空公司 9 nt
+联合行动 3 l
+联合诉讼 3 l
+联合逼近 3 l
+联合阵线 8 l
+联同 10 v
+联名 939 v
+联名信 9 n
+联名卡 2 n
+联吡啶 3 nz
+联和 9 nt
+联唱 8 v
+联商网 3 nt
+联在 3 v
+联城 151 ns
+联大 96 j
+联大会议 3 nt
+联奏 3 v
+联委会 7 nt
+联姻 434 n
+联婚 3 v
+联审 3 v
+联展 33 vn
+联展联销 3 l
+联带 3 n
+联席 27 n
+联席会 8 nt
+联席会议 138 l
+联建 5 v
+联想 1393 v
+联想值 3 l
+联想公司 3 nt
+联想力 3 l
+联想家 3 l
+联想昭阳 3 l
+联想研究院 4 nt
+联想网 3 nt
+联想起 3 l
+联想集团 98 nt
+联成 83 v
+联成一体 3 l
+联成一气 10 l
+联成一片 3 l
+联成一组 3 n
+联户 11 n
+联手 702 v
+联招 3 j
+联招会 3 v
+联接 223 v
+联接件 17 n
+联接关系 3 l
+联接器 3 n
+联控 17 j
+联播 68 vn
+联播时间 3 n
+联播网 3 nt
+联播节目 3 n
+联数 3 n
+联族 3 nz
+联明 2 v
+联有 3 v
+联机 78 n
+联机处理 3 l
+联机帮助 3 l
+联机服务 3 l
+联机系统 3 l
+联机诊断 3 l
+联村 3 n
+联查 3 v
+联校 8 n
+联检 2 j
+联次 3 n
+联欢 113 v
+联欢会 39 n
+联欢晚会 3 l
+联欢节 30 n
+联汇丰 12 nz
+联汇制 3 n
+联洋 2 n
+联测 8 v
+联海 2 ns
+联片 6 n
+联璧 3 n
+联用 13 v
+联益 3 n
+联盟 2655 j
+联盟党 18 nt
+联盟杯赛 3 nz
+联盟演出 3 n
+联社 23 n
+联票 8 n
+联程 7 n
+联立 3 v
+联立方程 6 n
+联立解法 3 n
+联篇累牍 3 n
+联系 9767 n
+联系业务 3 n
+联系人 120 n
+联系卡 2 n
+联系国 10 nt
+联系地址 3 n
+联系实际 3 l
+联系性 7 n
+联系户 3 l
+联系方式 3 l
+联系方法 3 l
+联系汇率 13 nz
+联系汇率制 3 l
+联系点 30 n
+联系电话 3 l
+联系群众 3 l
+联线 21 n
+联组 2 n
+联组会 3 nt
+联结 334 v
+联结蛋白 3 l
+联结词 3 n
+联结说 3 l
+联络 1238 n
+联络人 14 n
+联络兵 3 nt
+联络列表 3 n
+联络员 59 n
+联络地点 3 n
+联络处 38 nt
+联络官 10 n
+联络小组 3 n
+联络感情 3 n
+联络时间 3 n
+联络点 22 n
+联络站 11 nt
+联络簿 3 n
+联络线 529 n
+联络组 3 n
+联络网 2 nt
+联络部 29 nt
+联绵不断 3 l
+联绵字 6 l
+联缀 22 v
+联网 258 nz
+联网络 2 n
+联署 2 v
+联美 3 nz
+联翩 6 v
+联翩而至 3 l
+联考 124 v
+联考题 3 n
+联航 2 j
+联航队 7 nt
+联苯 274 nz
+联苯胺 11 nz
+联营 101 v
+联营企业 3 n
+联营公司 3 n
+联营公车 3 n
+联营厂 3 n
+联行 5 v
+联袂 71 d
+联袂而至 3 z
+联觉 3 n
+联言判断 3 n
+联训 28 n
+联诀 3 n
+联课 3 v
+联课活动 3 n
+联调 6 v
+联谊 320 nz
+联谊会 102 nt
+联谊会一 3 nz
+联谊网 3 nz
+联谊赛 3 nz
+联贯 4 v
+联贯性 3 n
+联贷 3 j
+联赖氨酸 3 n
+联赛 2113 vn
+联轴器 34 nz
+联轴节 3 n
+联运 113 v
+联运会 3 j
+联运票 3 n
+联通 437 nz
+联通公司 7 nt
+联通在信 3 l
+联通新 3 l
+联通网 3 nt
+联邦 1605 n
+联邦储备委员会 4 nt
+联邦军 8 nt
+联邦制 99 n
+联邦区 21 nt
+联邦德国 246 ns
+联邦德国队 2 nt
+联邦快递 3 nt
+联邦政府 144 nt
+联邦最高法院 10 nt
+联邦调查 3 l
+联邦调查局 16 nt
+联邦贸易委员会 5 nt
+联邦院 264 nt
+联销 2 v
+联锁 8 v
+联锁店 3 n
+联队 561 n
+联队长 37 n
+联防 69 v
+联防军 19 nt
+联防队 5 nt
+联防队员 5 n
+联阵 3 v
+联集 3 v
+联韵诗 3 n
+聘 541 v
+聘上 3 v
+聘为 256 v
+聘书 40 v
+聘任 152 v
+聘任制 35 n
+聘召 3 v
+聘姑娘 3 n
+聘成 3 v
+聘期 13 n
+聘用 269 v
+聘用制 7 n
+聘礼 186 v
+聘约 10 v
+聘者 11 n
+聘请 528 v
+聘请书 3 n
+聘选 2 v
+聘金 8 n
+聘问 3 v
+聚 2492 v
+聚一聚 3 nz
+聚丁二烯 20 nz
+聚丁橡胶 3 n
+聚丙烯 113 nz
+聚丙烯腈 19 n
+聚丙烯酸 2 nz
+聚丙稀 3 nz
+聚义 42 n
+聚义厅 38 n
+聚乙二醇 3 nz
+聚乙炔 11 n
+聚乙烯 70 nz
+聚乙烯醇 18 nz
+聚乙稀 3 nz
+聚乳酸 3 n
+聚众 228 n
+聚众斗殴 3 l
+聚众滋事 3 l
+聚众赌博 3 z
+聚众闹事 12 l
+聚伙 3 v
+聚会 797 n
+聚会地点 3 n
+聚会所 3 n
+聚会时间 3 l
+聚伞花序 91 l
+聚光 23 n
+聚光器 3 n
+聚光灯 29 n
+聚光镜 3 nz
+聚友网络 7 n
+聚变 75 v
+聚变反应 3 l
+聚合 573 v
+聚合体 3 n
+聚合作用 3 l
+聚合力 2 n
+聚合反应 3 l
+聚合头部 3 n
+聚合度 3 n
+聚合杂交 3 n
+聚合物 261 l
+聚合起来 3 l
+聚合酶 3 l
+聚四氟 3 nz
+聚四氟乙 3 nz
+聚四氟乙烯 30 nz
+聚在一起 3 i
+聚头 10 v
+聚季铵盐 3 v
+聚宝 6 nz
+聚宝盆 32 n
+聚对亚苯 3 nz
+聚少成多 3 l
+聚少离多 3 l
+聚居 704 v
+聚居区 89 n
+聚居地 70 n
+聚居点 3 n
+聚异丁烯 8 nz
+聚拢 60 v
+聚拢在 3 l
+聚敛 136 v
+聚敛无厌 3 nr
+聚敛钱财 3 v
+聚散 80 v
+聚散无常 2 i
+聚散浮生 3 n
+聚斯穆特 2 nz
+聚星 15 n
+聚有 3 v
+聚歼 24 v
+聚氟乙烯 3 nz
+聚氧乙烯醚 2 nz
+聚氨脂 3 n
+聚氨酯 39 nz
+聚氯乙烯 45 nz
+聚氯乙稀 3 nz
+聚沙成塔 7 nz
+聚热 3 v
+聚热作用 3 l
+聚烯烃 11 n
+聚焦 332 v
+聚焦点 6 n
+聚珍本 4 l
+聚珍版 6 n
+聚甘氨酸 3 nz
+聚生体 3 n
+聚甲醛 3 nz
+聚砜 4 nz
+聚硅氧烷 5 nz
+聚硅酸盐 3 nz
+聚碳酸 3 n
+聚碳酸酯 16 nz
+聚磷酸铵 2 nz
+聚礼 14 v
+聚礼会 3 n
+聚神 3 n
+聚福隆 6 ns
+聚积 45 n
+聚积为 3 n
+聚米为山 3 i
+聚米为谷 3 i
+聚类分析 4 l
+聚精会神 83 n
+聚糖 36 n
+聚结 5 v
+聚结剂 3 n
+聚聚 3 v
+聚胺 2 nz
+聚胺脂 3 n
+聚脂 10 n
+聚脯氨酸 3 n
+聚脲 6 n
+聚芳酰胺 3 nz
+聚苯 11 n
+聚苯乙烯 42 nz
+聚苯板 3 nz
+聚苯硫醚 9 nz
+聚苯胺 3 nz
+聚苯醚 3 nz
+聚落 178 v
+聚落类型 3 n
+聚蚁成雷 3 i
+聚蚊成雷 3 n
+聚议 3 n
+聚讼 3 vn
+聚财 3 v
+聚赌 16 v
+聚赖氨酸 3 n
+聚起来 3 l
+聚酯 70 nz
+聚酯切片 3 n
+聚酯塑料 3 nz
+聚酯树脂 3 n
+聚酯漆 3 nz
+聚酯瓶 3 n
+聚酯纤维 6 nz
+聚酯薄膜 3 nz
+聚酰亚胺 10 nz
+聚酰胺 87 nz
+聚醚 13 n
+聚醚醚酮 3 nz
+聚鑫 2 nz
+聚错 3 v
+聚阴离子 3 n
+聚集 1912 v
+聚集一堂 4 nz
+聚集体 9 n
+聚集区 6 n
+聚集地 22 n
+聚餐 62 n
+聚餐会 3 n
+聚首 46 v
+聚齐 24 v
+聚龙 5 nz
+聛 10 zg
+聢 3 zg
+聣 30 zg
+聤 14 zg
+聩 7 g
+聪 218 a
+聪加 3 n
+聪悟 3 a
+聪慧 128 a
+聪敏 78 a
+聪明 2068 a
+聪明一世 22 i
+聪明人 223 n
+聪明伶俐 113 i
+聪明反被 3 n
+聪明反被聪明误 13 i
+聪明才智 196 i
+聪明智慧 37 l
+聪明智能 3 i
+聪明正直 3 i
+聪明睿智 7 l
+聪明绝世 3 i
+聪明绝顶 3 i
+聪明者 3 n
+聪明能干 3 i
+聪明起来 3 l
+聪聪 3 i
+聪颖 80 a
+聪颖过人 3 i
+聯 5 zg
+聱牙 4 a
+聱牙佶屈 3 nr
+聱牙戟口 3 nr
+聱牙诘屈 3 vn
+聱牙诘曲 3 z
+職 3 zg
+聿 50 nrfg
+肀 28 zg
+肃 798 nr
+肃北 4 ns
+肃北蒙古族自治县 4 ns
+肃南 3 ns
+肃南裕固族自治县 3 ns
+肃反 83 v
+肃坐 3 v
+肃宁 15 ns
+肃宁县 2 ns
+肃容 3 a
+肃州区 3 ns
+肃慎 22 a
+肃敬 3 a
+肃杀 36 v
+肃杀之气 3 i
+肃清 355 v
+肃清残敌 3 i
+肃清流毒 3 i
+肃然 155 a
+肃然危坐 3 i
+肃然生敬 3 i
+肃然起敬 103 i
+肃穆 508 a
+肃立 328 v
+肃立起敬 3 i
+肃贪 3 vn
+肃贪倡廉 3 v
+肃静 128 a
+肃静无声 3 i
+肄 8 v
+肄业 63 v
+肄业生 257 v
+肄习 3 v
+肆 491 m
+肆力 3 d
+肆口 3 vn
+肆口谩骂 3 vn
+肆奸植党 3 vn
+肆应 3 v
+肆意 555 d
+肆意妄为 12 i
+肆意挑衅 3 v
+肆意挥霍 3 i
+肆意攻击 3 i
+肆意横行 3 i
+肆扰 2 v
+肆无忌惮 387 i
+肆暴 3 v
+肆横 3 v
+肆然 3 d
+肆虐 110 v
+肆虐为患 3 n
+肆虐横行 3 v
+肆行 28 v
+肆行无忌 3 i
+肆言如狂 3 i
+肆言无忌 3 i
+肆言詈辱 3 vn
+肇 214 ns
+肇东 9 ns
+肇东市 4 ns
+肇乱 3 vn
+肇事 65 n
+肇事人 3 n
+肇事案 3 n
+肇事罪 4 n
+肇事者 50 n
+肇事车 3 n
+肇俊 2 n
+肇俊哲 20 nrfg
+肇兴 9 ns
+肇因 3 n
+肇基 3 nrt
+肇始 12 v
+肇始者 3 n
+肇州 5 ns
+肇州县 2 ns
+肇州市 3 ns
+肇庆 70 ns
+肇庆市 30 ns
+肇建 3 ns
+肇新 2 ns
+肇源 6 n
+肇源县 3 ns
+肇祸 2 n
+肇端 25 n
+肇衅 3 vn
+肇造 3 vn
+肉 6683 n
+肉丁 14 n
+肉丝 311 n
+肉丝面 10 n
+肉中刺 18 n
+肉丸 15 n
+肉丸子 2 n
+肉乎乎 3 l
+肉价 3 n
+肉体 462 n
+肉体上 3 l
+肉体化 3 n
+肉儿 3 n
+肉冠 7 n
+肉冻 2 n
+肉刑 63 n
+肉制品 162 n
+肉包 3 n
+肉包子 25 n
+肉包子打 3 n
+肉品 14 n
+肉圆 3 n
+肉圆子 2 n
+肉墩墩 3 n
+肉头 3 n
+肉夹馍 3 n
+肉孜节 15 l
+肉山脯林 3 n
+肉山酒海 3 n
+肉峰 3 n
+肉干 35 n
+肉店 13 n
+肉弹 2 n
+肉感 12 n
+肉排 3 n
+肉搏 40 n
+肉搏战 19 nz
+肉摊 2 n
+肉末 12 n
+肉机 2 n
+肉条 3 n
+肉松 19 n
+肉松罐头 3 n
+肉果 4 n
+肉柱 3 n
+肉样 2 n
+肉桂 45 n
+肉桂粉 3 nz
+肉桂酸 3 nz
+肉案 3 n
+肉棒 3 n
+肉欲 85 n
+肉欲主义 3 n
+肉毒素 3 n
+肉汁 13 n
+肉汤 34 n
+肉浆 3 n
+肉火烧 3 l
+肉片 35 n
+肉牛 62 n
+肉猪 28 n
+肉用 39 n
+肉用鸡 3 n
+肉畜 3 n
+肉痛 16 n
+肉瘤 111 n
+肉白骨 3 n
+肉皮 22 n
+肉皮儿 3 n
+肉盾 3 n
+肉眼 226 n
+肉眼凡夫 3 l
+肉眼凡胎 17 l
+肉眼惠眉 3 n
+肉眼愚眉 3 v
+肉碱 2 n
+肉票 13 n
+肉禽 3 n
+肉禽蛋 2 n
+肉类 438 n
+肉糜 6 n
+肉红 3 n
+肉缝 3 n
+肉羊 2 n
+肉羹 3 n
+肉羹米粉 3 l
+肉羹面 3 l
+肉联厂 34 n
+肉肠 25 n
+肉脯 3 n
+肉色 31 n
+肉芝 3 n
+肉芽 11 n
+肉芽肿 60 n
+肉苁蓉 22 n
+肉蒲团 3 nz
+肉薄骨并 3 n
+肉蛋 3 n
+肉袒牵羊 3 l
+肉袒面缚 3 v
+肉豆蔻 26 n
+肉质 290 n
+肉贩 3 n
+肉赘 3 v
+肉跳 3 n
+肉跳心惊 3 l
+肉跳神惊 3 l
+肉身 82 n
+肉酱 65 n
+肉铺 15 n
+肉阄 3 v
+肉颤心惊 3 n
+肉食 169 n
+肉食动物 3 l
+肉食品 5 n
+肉食性 3 n
+肉食者 6 n
+肉食者鄙 3 l
+肉食鸡 3 n
+肉饼 34 n
+肉馅 25 n
+肉骨粉 3 n
+肉鳍 17 n
+肉鸡 283 n
+肉鸡舍 3 n
+肉鸽 9 n
+肉麻 73 n
+肉麻话 3 n
+肋 417 n
+肋巴骨 3 n
+肋木 9 n
+肋条 12 n
+肋窝 3 n
+肋腹 3 n
+肋膜 3 n
+肋膜炎 3 n
+肋软骨 3 n
+肋间 3 n
+肋间肌 3 n
+肋骨 252 n
+肋骨拱 3 n
+肌 1197 n
+肌上皮岛 3 n
+肌上皮瘤 3 n
+肌上皮癌 3 n
+肌丝 3 n
+肌体 89 n
+肌切蛋白 3 n
+肌割蛋白 3 n
+肌劈理解 3 vn
+肌力 11 n
+肌动蛋白 3 n
+肌原纤维 3 n
+肌发生 3 n
+肌基质 3 n
+肌小管 3 n
+肌尾病毒 3 n
+肌无力 23 n
+肌氨酸 3 n
+肌氨酸盐 3 n
+肌注 36 n
+肌浆网 3 n
+肌浆蛋白 3 n
+肌激酶 3 n
+肌球蛋白 3 n
+肌理 45 n
+肌电图 3 n
+肌瘤 74 n
+肌白蛋白 3 n
+肌监控仪 3 n
+肌管 3 n
+肌红蛋白 3 n
+肌纤维 38 n
+肌细胞 3 n
+肌联蛋白 3 n
+肌肉 1729 n
+肌肉位 3 n
+肌肉发达 3 nz
+肌肉注射 3 nz
+肌肉男 3 n
+肌肉疲劳 3 vn
+肌肉组织 3 n
+肌肤 804 n
+肌肤之亲 3 n
+肌肽 3 n
+肌能修整 3 n
+肌腱 85 n
+肌腱抗原 3 nz
+肌膈 3 n
+肌节 7 n
+肌苷 6 n
+肌苷酸 3 n
+肌萎缩 3 n
+肌蛋白 3 n
+肌调蛋白 3 n
+肌质 3 n
+肌质网 3 n
+肌酐 16 n
+肌酸激酶 3 n
+肌酸酐 3 nz
+肌醇 11 n
+肌醇化 3 nz
+肌醇磷酸 3 nz
+肌钙蛋白 3 n
+肌骨 13 n
+肌麻痹 6 n
+肐 5 zg
+肐膊 3 v
+肐膊肘 3 n
+肐臂 3 v
+肓 55 x
+肖 549 nr
+肖上唇 46 nr
+肖下唇 33 nr
+肖丽梅 2 nr
+肖伦添 4 nr
+肖伯纳 3 nr
+肖侃宁 4 nr
+肖像 368 n
+肖像权 6 n
+肖像画 101 n
+肖像画家 3 n
+肖像画法 3 n
+肖克利 10 nr
+肖克莱 22 nr
+肖其亲 16 nr
+肖冠军 2 nr
+肖劲光 12 nr
+肖劲松 2 nr
+肖卫东 4 nr
+肖厝 3 nrt
+肖厝港 4 ns
+肖吉吉 2 nr
+肖启伟 28 nr
+肖唯妙 2 nr
+肖国文 3 nr
+肖复兴 4 nr
+肖夏春 2 nr
+肖大叔 5 nr
+肖太后 2 nr
+肖家岭 256 nr
+肖家窑 2 nr
+肖山令 4 nr
+肖延裕 3 nr
+肖建佳 8 nr
+肖建刚 2 nr
+肖建妹 23 nr
+肖建成 2 nr
+肖开特 2 nr
+肖形印 4 nr
+肖形虎 2 nr
+肖德贝 2 nr
+肖志斌 5 nr
+肖恩 40 nr
+肖成林 3 nr
+肖战波 12 nr
+肖扬 5 nr
+肖斯塔科维奇 13 nrt
+肖新博 2 nr
+肖明子 45 nr
+肖春阳 2 nr
+肖梓树 2 ns
+肖楚女 2 nr
+肖正权 3 nr
+肖洛姆 3 nr
+肖洛霍夫 9 nr
+肖海亮 256 nr
+肖海英 8 nr
+肖爱华 9 nr
+肖版 3 n
+肖特基 14 nr
+肖特基群 3 nr
+肖玲坐 2 nr
+肖祖建 2 nr
+肖秀荣 4 nr
+肖育军 4 nr
+肖荣生 3 nr
+肖谷欣 2 nr
+肖邦 70 nr
+肖金亮 2 nr
+肖阳生 3 nr
+肖阿姨 5 nr
+肖院长 5 nr
+肖雄文 3 nr
+肖鸿林 378 nr
+肖龙旭 3 nr
+肘 431 ng
+肘关节 30 n
+肘后方 3 n
+肘子 30 n
+肘尖 3 n
+肘弯 46 n
+肘窝 6 n
+肘胁之患 3 i
+肘腋 15 n
+肘腋之忧 3 i
+肘腋之患 12 i
+肘节 3 n
+肘行膝步 3 i
+肘部 20 n
+肘髎 3 n
+肙 14 zg
+肚 1160 n
+肚丝 7 n
+肚中 3 f
+肚兜 101 n
+肚兜儿 2 n
+肚子 1736 n
+肚子疼 3 v
+肚子痛 30 n
+肚子饿 3 n
+肚带 3 n
+肚疼 3 v
+肚皮 309 n
+肚皮舞 3 n
+肚肠 3 n
+肚胀 3 n
+肚脐 61 n
+肚脐眼 17 n
+肚腩 3 n
+肚里 393 n
+肚里泪下 3 n
+肚里蛔虫 3 n
+肚量 17 n
+肛 125 n
+肛交 3 n
+肛瘘 17 n
+肛管 12 n
+肛肠 4 n
+肛肠病 3 n
+肛肠科 2 n
+肛裂 19 n
+肛褶蛙肽 3 nz
+肛道 3 n
+肛门 290 n
+肛门口 3 n
+肛门期 3 n
+肜 23 g
+肝 1715 n
+肝儿 5 n
+肝功 21 n
+肝功能 110 n
+肝吸虫 2 n
+肝心君裂 3 i
+肝心涂地 3 i
+肝心若裂 3 i
+肝气 56 n
+肝油 3 n
+肝火 72 n
+肝炎 308 n
+肝球蛋白 3 n
+肝疾 3 n
+肝病 167 n
+肝病毒属 3 n
+肝癌 165 n
+肝白蛋白 3 n
+肝硬化 81 n
+肝硬变 68 i
+肝移植 3 n
+肝糖 3 n
+肝素 19 n
+肝素钠 3 n
+肝细胞 3 n
+肝肠 24 n
+肝肠寸断 16 i
+肝肠欲裂 3 i
+肝肾 105 n
+肝肿大 3 i
+肝胆 121 n
+肝胆俱裂 3 i
+肝胆披沥 3 i
+肝胆楚越 3 i
+肝胆欲碎 3 i
+肝胆涂地 3 i
+肝胆照人 16 i
+肝胆相照 57 i
+肝胆科 3 n
+肝胆胡越 3 i
+肝胆胰 5 j
+肝胆过人 3 i
+肝脏 587 n
+肝脏毒素 3 n
+肝脑涂地 71 i
+肝腹水 3 i
+肝蛭 3 n
+肝郁 13 n
+肝部 8 n
+肝醣 3 nz
+肝阳 12 n
+肝风 13 n
+肝髓流野 3 n
+肞 3 zg
+肟 90 g
+肠 1006 n
+肠伤寒 3 n
+肠儿 7 n
+肠壁 45 n
+肠套叠 10 n
+肠子 1197 n
+肠抑胃素 3 n
+肠抑胃肽 3 n
+肠断 25 n
+肠杆菌属 3 n
+肠梗阻 43 n
+肠毒素 3 n
+肠泌酸素 3 n
+肠液 21 n
+肠清茶 3 n
+肠溃疡 3 n
+肠溶片 14 n
+肠激酶 2 n
+肠炎 67 n
+肠球菌素 3 n
+肠病毒 3 n
+肠痉挛 3 n
+肠癌 25 n
+肠穿孔 6 n
+肠管 34 n
+肠粉 2 n
+肠粘连 3 n
+肠系膜 25 n
+肠系膜炎 3 n
+肠线 3 n
+肠绒毛 8 n
+肠结核 14 n
+肠绞痛 3 n
+肠肚 3 n
+肠肝循环 3 n
+肠肥脑满 3 n
+肠肽酶 3 n
+肠胃 185 n
+肠胃炎 4 n
+肠胃病 9 n
+肠虫 3 n
+肠蛋白酶 3 n
+肠蠕动 3 vn
+肠衣 27 n
+肠道 291 n
+肠道病毒 3 n
+肠间膜 3 n
+肠阻塞 3 n
+肠骨 11 n
+股 8493 q
+股东 8174 n
+股东会 62 n
+股东大会 3 n
+股东权益 3 n
+股价 951 n
+股价指数 3 n
+股份 5479 n
+股份公司 455 n
+股份制 328 n
+股份化 3 n
+股份合作 5 n
+股份合作制 47 n
+股份有限 13 n
+股值 7 n
+股关节 3 n
+股分 4 n
+股利 106 n
+股利收入 3 n
+股匪 3 n
+股员 3 n
+股天下 3 n
+股天乐 3 n
+股子 203 n
+股市 1191 n
+股市信息 3 n
+股市市值 3 n
+股市行情 3 n
+股市论谈 3 l
+股息 101 n
+股慄 3 v
+股战而栗 3 i
+股抵债 3 l
+股指 404 n
+股掌 33 n
+股掌之上 3 l
+股改 3 j
+股数 323 n
+股本 559 n
+股权 3556 n
+股权结构 3 n
+股权证 3 n
+股栗 11 n
+股民 111 n
+股海 4 n
+股灾 3 n
+股癣 11 n
+股票 2923 n
+股票买卖 3 l
+股票交易 9 n
+股票代码 3 n
+股票价值 3 n
+股票价格 4 n
+股票名称 3 n
+股票市场 3 n
+股票投资 2 n
+股票指数 4 n
+股票数 7 n
+股票族 3 n
+股票机 3 n
+股票网 3 n
+股票行情 3 n
+股票论坛 3 n
+股票证券 3 n
+股票走势 3 n
+股票软件 3 n
+股级 6 n
+股肱 43 n
+股肱之力 3 n
+股肱之臣 6 n
+股行情 3 n
+股评 13 n
+股评家 2 n
+股评类 3 n
+股资 3 n
+股道 3 n
+股金 34 n
+股长 31 n
+股面价格 3 n
+股骨 31 n
+股骨头 14 n
+股骨颈 2 n
+肢 446 n
+肢体 531 n
+肢体冲突 3 n
+肢势 3 n
+肢残 3 v
+肢残人 3 n
+肢离破碎 3 n
+肢窝 3 n
+肢解 46 v
+肢骨 3 n
+肤 222 n
+肤受 3 a
+肤受之愬 3 n
+肤受之言 3 n
+肤受之诉 3 n
+肤如凝脂 3 n
+肤寸而合 3 n
+肤廓 3 n
+肤末支离 3 n
+肤泛 2 a
+肤浅 143 a
+肤浅性 3 vn
+肤浅认识 3 v
+肤皮浮浅 3 n
+肤皮潦草 3 vn
+肤粟股栗 3 n
+肤纹学 3 n
+肤色 232 n
+肤见 3 a
+肤见謭识 3 n
+肤见谫识 3 vn
+肤觉 9 n
+肤轻松 3 n
+肥 1754 n
+肥东 7 ns
+肥东县 6 ns
+肥乎乎 3 z
+肥乡 4 n
+肥乡县 3 ns
+肥冬瘦年 3 i
+肥分 3 n
+肥力 212 n
+肥力高 15 n
+肥厚 121 a
+肥厚型 3 n
+肥嘟嘟 3 z
+肥囊囊 3 n
+肥土 3 n
+肥土植物 3 l
+肥地 3 n
+肥城 19 ns
+肥城县 3 ns
+肥城市 5 ns
+肥墩墩 2 z
+肥壤 3 n
+肥壮 31 a
+肥大 322 a
+肥大症 3 nz
+肥大细胞 3 n
+肥头大耳 3 l
+肥头大面 3 n
+肥头肥脑 3 n
+肥头胖耳 3 n
+肥嫩 19 a
+肥实 5 a
+肥差 11 a
+肥强 3 a
+肥得 3 a
+肥得鲁儿 3 n
+肥效 12 a
+肥料 578 n
+肥料厂 3 n
+肥料效率 3 n
+肥水 54 n
+肥水不流外人田 4 l
+肥沃 816 a
+肥源 5 n
+肥滚滚 3 z
+肥满 3 a
+肥煤 11 n
+肥牛 18 n
+肥猪 50 n
+肥猫 3 n
+肥甘 3 a
+肥田 25 n
+肥田粉 3 nz
+肥田草 3 nz
+肥痴 3 n
+肥瘠 3 a
+肥瘦 24 a
+肥皁粉 3 vn
+肥皂 275 n
+肥皂剧 12 n
+肥皂厂 3 n
+肥皂水 3 n
+肥皂沫 3 n
+肥皂泡 22 n
+肥皂液 3 n
+肥皂盒 3 n
+肥皂箱 3 n
+肥皂粉 6 n
+肥短 3 a
+肥矮 3 a
+肥硕 21 a
+肥缺 39 a
+肥羊 26 n
+肥美 50 a
+肥肉 137 n
+肥肠 5 n
+肥肠满脑 3 l
+肥肥 3 n
+肥肥大大 3 nz
+肥肥的 12 n
+肥育 27 vn
+肥胖 411 a
+肥胖型 3 n
+肥胖率 4 n
+肥胖病 5 n
+肥胖症 39 n
+肥胖者 36 n
+肥胺 3 n
+肥腻 3 a
+肥西 3 ns
+肥西县 6 ns
+肥遁鸣高 3 ns
+肥遯鸣高 3 ns
+肥饱 3 n
+肥饶 3 a
+肥马轻裘 3 n
+肥鱼大肉 3 n
+肥鲜 3 a
+肦 9 zg
+肩 1896 n
+肩上 634 s
+肩不担担 3 l
+肩井 3 n
+肩从齿序 3 l
+肩关节 26 n
+肩前 3 s
+肩劳任怨 3 n
+肩台 3 n
+肩周 3 n
+肩周炎 13 n
+肩垫 3 n
+肩头 1397 n
+肩宽 24 n
+肩带 23 n
+肩并肩 35 l
+肩挑 31 n
+肩挑重担 3 l
+肩摩毂击 129 i
+肩摩毂接 3 i
+肩摩袂接 3 i
+肩摩踵接 3 i
+肩窝 17 n
+肩章 22 n
+肩背相望 3 i
+肩背难望 3 l
+肩胛 45 n
+肩胛骨 31 n
+肩膀 1196 n
+肩臂 16 n
+肩舆 3 n
+肩角 3 n
+肩贞 3 n
+肩负 313 n
+肩负着 3 l
+肩负起 3 l
+肩负重任 3 l
+肩负重荷 3 n
+肩起 3 s
+肩部 89 n
+肩靠肩 3 n
+肩髃 3 v
+肩髎 3 v
+肪 111 x
+肫 31 g
+肭 33 zg
+肮 70 a
+肮肮脏脏 3 n
+肮脏 290 a
+肮脏交易 3 v
+肮脏鬼 3 v
+肮里肮脏 3 nr
+肯 2976 v
+肯上 3 v
+肯上去 3 v
+肯上来 3 v
+肯下 3 v
+肯下去 3 v
+肯下来 3 v
+肯不肯 3 v
+肯为 3 v
+肯于 3 v
+肯亚 3 ns
+肯会 3 v
+肯作 3 v
+肯做 3 v
+肯出 3 v
+肯出去 3 v
+肯出来 3 v
+肯切 4 v
+肯到 3 v
+肯去 3 v
+肯吃苦 3 v
+肯回 3 v
+肯回去 3 nr
+肯回来 3 ns
+肯在 3 v
+肯坐 3 v
+肯堂肯构 3 nr
+肯塔基 17 nr
+肯塔基州 19 ns
+肯定 6227 v
+肯定例证 3 n
+肯定句 3 n
+肯定性 7 n
+肯尼 12 nrt
+肯尼亚 402 ns
+肯尼亚人 2 nrt
+肯尼亚共和国 8 ns
+肯尼亚山 10 ns
+肯尼亚政府 3 nt
+肯尼亚航空公司 2 nt
+肯尼亚非洲民族联盟 3 nt
+肯尼思 2 nr
+肯尼斯 3 ns
+肯尼迪 192 nr
+肯尼迪航天中心 16 nt
+肯干 69 v
+肯得 3 v
+肯得基 3 nr
+肯德 3 nrt
+肯德基 65 nr
+肯德尔 8 nr
+肯德鸡 3 ns
+肯恩 2 v
+肯斯 23 ns
+肯普肽 3 nz
+肯来 3 v
+肯构肯堂 3 nr
+肯求 3 v
+肯特 37 nrt
+肯特山 12 ns
+肯特郡 21 nr
+肯用 3 v
+肯纳 4 v
+肯给 3 v
+肯请 3 v
+肯谈 3 v
+肯起来 3 v
+肯载 3 v
+肯辛顿 3 ns
+肯过 3 v
+肯过去 3 v
+肯过来 3 v
+肯进 3 v
+肯进去 3 v
+肯进来 3 v
+肯迪 3 nz
+肱 40 n
+肱股 3 n
+肱骨 13 n
+育 656 v
+育乐 3 vn
+育乐中心 3 n
+育人 74 nrt
+育儿 46 n
+育儿网 3 nz
+育儿袋 11 n
+育儿观 3 n
+育养 3 v
+育婴 26 nrt
+育婴堂 7 n
+育婴室 3 n
+育婴师 3 n
+育婴房 3 n
+育婴指南 3 nz
+育婴网 3 nz
+育幼 3 n
+育幼袋 3 n
+育幼院 3 n
+育成 76 v
+育成杂交 3 v
+育才 566 n
+育才路 3 ns
+育新 20 v
+育林 11 nrt
+育碧 3 n
+育种 276 v
+育种学 7 n
+育秧 15 v
+育空 22 vn
+育空河 12 n
+育肥 13 v
+育苗 124 v
+育英 9 nrt
+育草 3 v
+育达 3 v
+育迪 3 nz
+育雏 39 v
+育雏器 3 v
+育龄 65 b
+育龄夫妇 3 n
+育龄妇女 3 n
+肴 105 g
+肴酒 3 n
+肴馔 25 n
+肷 48 g
+肸 3 zg
+肺 1401 n
+肺不张 22 i
+肺出血 3 i
+肺动脉 79 n
+肺动脉瓣 9 n
+肺原性 3 n
+肺叶 19 n
+肺吸虫 9 n
+肺大泡 12 n
+肺形草 3 n
+肺循环 19 i
+肺心病 20 n
+肺栓塞 3 n
+肺气肿 48 n
+肺水肿 58 n
+肺泡 96 n
+肺活量 27 n
+肺炎 248 n
+肺炎球菌 3 n
+肺病 85 n
+肺病热 3 n
+肺痈 3 i
+肺痨 18 n
+肺癌 260 n
+肺石风清 3 i
+肺纤维化 3 n
+肺结核 115 n
+肺结核病 3 n
+肺肠 3 n
+肺胀 3 n
+肺脏 23 n
+肺脓肿 29 n
+肺腑 108 n
+肺腑之言 54 i
+肺蛭 3 n
+肺部 186 n
+肺静脉 8 n
+肺鱼 50 n
+肼 38 g
+肽 292 zg
+肽基 3 n
+肽性酶 3 n
+肽扫描 3 n
+肽核酸 3 n
+肽筛选 3 vn
+肽聚糖 3 n
+肽能纤维 3 n
+肽酶 15 n
+肽链 3 n
+肽键 3 n
+肾 1403 zg
+肾上腺 278 l
+肾上腺素 140 l
+肾下垂 2 n
+肾亏 10 n
+肾内科 3 n
+肾功能 250 n
+肾动脉 3 n
+肾囊 4 n
+肾囊肿 3 n
+肾宝 4 n
+肾小球 102 n
+肾小管 144 n
+肾气 51 n
+肾炎 144 n
+肾病 133 n
+肾癌 14 n
+肾盂 53 n
+肾盂炎 3 z
+肾盂肾炎 3 n
+肾积水 3 n
+肾移植 3 l
+肾素 18 n
+肾结核 17 n
+肾结石 33 n
+肾脏 374 n
+肾脏炎 3 n
+肾脏病 16 n
+肾脏科 3 n
+肾虚 58 n
+肾衰 3 n
+肾衰竭 10 n
+肾部 3 n
+肾阳虚 3 n
+肾阴 44 n
+肾阴虚 3 n
+肿 1052 n
+肿块 174 n
+肿大 192 v
+肿大症 3 n
+肿物 102 n
+肿痛 80 n
+肿瘤 1757 n
+肿瘤医院 3 n
+肿瘤发生 3 n
+肿瘤外科 3 n
+肿瘤学 8 n
+肿瘤学家 2 n
+肿瘤性 3 n
+肿瘤病毒 3 n
+肿瘤科 35 n
+肿肿 3 n
+肿胀 208 v
+肿节风 3 n
+肿起 3 v
+肿起来 3 v
+肿骨鹿 5 n
+胀 724 a
+胀大 3 v
+胀库 3 v
+胀气 3 v
+胀满 27 v
+胀痛 3 v
+胀起 3 v
+胀闸 3 v
+胀鼓鼓 6 z
+胁 621 ng
+胁不沾席 3 i
+胁从 17 v
+胁从犯 8 i
+胁制 3 v
+胁持 4 v
+胁痛 3 v
+胁肩 3 v
+胁肩低眉 3 i
+胁肩低首 3 i
+胁肩累足 3 i
+胁肩絫足 3 n
+胁肩谄笑 2 i
+胁腹 3 n
+胁裹 3 v
+胁迫 238 v
+胁逼 3 v
+胂 76 g
+胃 1459 n
+胃下垂 14 n
+胃仓 3 n
+胃出血 3 n
+胃切开术 3 l
+胃切除术 3 l
+胃动素 3 n
+胃口 337 n
+胃壁 23 n
+胃扩张 7 n
+胃泌素 11 n
+胃液 86 n
+胃液素 3 n
+胃溃疡 82 n
+胃灼热 3 n
+胃炎 86 n
+胃病 89 n
+胃痉挛 3 n
+胃痛 3 n
+胃癌 182 n
+胃石 3 n
+胃科 3 n
+胃科医生 3 nz
+胃穿孔 5 n
+胃窦 3 n
+胃窦炎 3 n
+胃粘膜 3 n
+胃肠 251 n
+胃肠功能 3 n
+胃肠炎 25 n
+胃肠病 3 n
+胃肠科 3 n
+胃肠道 142 n
+胃脏 3 n
+胃脘 33 n
+胃脯 3 n
+胃腔 3 n
+胃腺 9 n
+胃舒平 3 nz
+胃药 13 n
+胃药片 3 n
+胃蛋白酶 25 l
+胃部 60 n
+胃部不适 3 l
+胃酸 95 n
+胃酸过多 3 l
+胃镜 31 n
+胃镜室 3 n
+胃黏膜 3 v
+胄 152 g
+胆 1220 n
+胆丧魂惊 3 i
+胆丧魂消 3 n
+胆力 2 n
+胆南星 3 nz
+胆卵肽 3 n
+胆囊 180 n
+胆囊息肉 3 i
+胆囊炎 40 n
+胆囊癌 13 n
+胆囊结石 3 i
+胆固醇 323 n
+胆固醇酯 3 nz
+胆壮 3 a
+胆壮心雄 3 i
+胆壮气粗 3 i
+胆大 203 a
+胆大于身 3 i
+胆大包天 57 i
+胆大妄为 66 i
+胆大心小 3 l
+胆大心粗 3 i
+胆大心细 23 i
+胆大心雄 3 i
+胆大泼天 3 i
+胆子 887 n
+胆寒 73 a
+胆寒发竖 3 i
+胆小 303 a
+胆小如豆 3 i
+胆小如鼠 33 i
+胆小如鼷 3 v
+胆小怕事 41 i
+胆小的马 3 l
+胆小鬼 76 i
+胆怯 310 a
+胆怯怯 3 z
+胆总管 3 n
+胆战心寒 7 i
+胆战心惊 107 i
+胆战心慌 3 n
+胆战心摇 3 i
+胆敢 460 a
+胆木 3 n
+胆机 3 n
+胆气 93 n
+胆汁 158 n
+胆汁质 3 n
+胆汁酸 15 n
+胆瓶 2 n
+胆略 52 n
+胆略过人 3 n
+胆盐 17 n
+胆石 3 n
+胆石病 3 n
+胆石症 3 n
+胆矾 9 n
+胆破心寒 3 i
+胆破心惊 3 i
+胆碱 97 n
+胆碱受体 3 n
+胆碱能 26 n
+胆碱酯酶 3 nz
+胆碱钠 3 nz
+胆管 60 n
+胆管炎 3 n
+胆管癌 3 n
+胆粗气壮 3 i
+胆红素 35 n
+胆结石 43 n
+胆绿素 3 n
+胆绿蛋白 3 n
+胆脂瘤 4 n
+胆色 3 n
+胆色素 10 n
+胆色素原 3 n
+胆落 3 n
+胆虚 3 a
+胆裂魂飞 3 i
+胆识 106 n
+胆识过人 7 n
+胆道 58 n
+胆酸 24 n
+胆量 219 n
+胆钙蛋白 3 n
+胆颤 3 n
+胆颤心惊 6 i
+胆魄 13 n
+胈 661 zg
+背 9853 v
+背上 1760 f
+背下 3 f
+背下来 3 f
+背不住 3 v
+背不动 3 v
+背义忘恩 3 n
+背义负信 3 n
+背义负恩 3 n
+背乡离井 3 n
+背书 103 n
+背井离乡 35 i
+背人 3 n
+背会 3 n
+背伤 3 v
+背信 8 v
+背信弃义 89 n
+背债 3 n
+背光 12 n
+背光性 3 n
+背光板 3 n
+背光源 3 n
+背光灯 3 n
+背公向私 3 n
+背公营私 3 n
+背出 3 v
+背出去 3 i
+背到 3 v
+背前面后 3 i
+背包 294 n
+背包党 3 n
+背包客 3 n
+背包带 4 n
+背包族 3 n
+背包袱 2 n
+背单词 3 n
+背压式 3 n
+背反 3 v
+背叛 536 v
+背叛者 12 n
+背台词 2 n
+背后 1124 f
+背后议论 3 n
+背向 86 n
+背向着 3 n
+背囊 137 n
+背回家去 3 i
+背地 3 n
+背地里 139 n
+背城一战 2 i
+背城借一 2 n
+背墙 3 n
+背墙而立 3 i
+背子 3 n
+背对 105 v
+背对着 3 l
+背对背 8 n
+背射天线 3 n
+背屈含冤 3 i
+背山 3 n
+背山起楼 3 i
+背山面水 3 n
+背带 29 n
+背带裤 2 n
+背弃 60 v
+背影 729 n
+背得起 3 v
+背德 3 n
+背心 942 n
+背心儿 3 n
+背心袋 3 n
+背恩弃义 3 i
+背恩忘义 3 i
+背恩负义 3 i
+背悔 3 v
+背惠食言 3 n
+背成 3 v
+背扇 3 n
+背投 14 v
+背投影 3 i
+背搭子 3 n
+背散射 3 n
+背斜 112 v
+背斜层 3 n
+背斜理论 3 n
+背日 3 n
+背日性 3 n
+背旮旯儿 3 z
+背景 3342 n
+背景噪声 10 n
+背景图 3 n
+背景图片 3 n
+背景墙 3 n
+背景杂交 3 n
+背景校正 3 n
+背景灯 3 n
+背景色 3 n
+背景音乐 6 n
+背暗投明 3 i
+背曲腰弯 3 n
+背曲腰躬 3 n
+背本就末 3 i
+背本趋末 3 n
+背板 49 n
+背根 3 n
+背椅 3 n
+背榜 3 n
+背槽抛粪 3 v
+背气 3 n
+背水 3 n
+背水一战 34 i
+背水阵 3 n
+背熟 32 v
+背理 2 n
+背生芒刺 3 n
+背痛 27 n
+背盟 3 n
+背盟败约 3 n
+背着 62 v
+背着手 3 n
+背碑覆局 3 i
+背离 118 n
+背筐 3 n
+背篓 16 n
+背约 22 n
+背背佳 3 nz
+背脊 236 n
+背脊骨 3 n
+背腹受敌 3 i
+背腹图式 3 n
+背腹轴 3 n
+背若芒刺 3 i
+背街 8 n
+背袋 3 n
+背褡子 3 n
+背角 3 n
+背诵 383 v
+背诵着 3 n
+背诵课文 3 n
+背谬 3 n
+背负 257 v
+背负式 4 n
+背负着 3 l
+背起 3 v
+背运 10 n
+背逆 3 v
+背道而驰 73 i
+背部 800 f
+背阴 27 n
+背阴处 11 n
+背静 2 n
+背靠 129 v
+背靠背 26 n
+背面 576 f
+背面进攻 3 i
+背革装 3 n
+背风 119 n
+背风处 10 n
+背风面 3 n
+背骨 3 n
+背鳍 317 n
+背黑锅 39 n
+胍 94 g
+胎 839 n
+胎位 30 n
+胎体 42 n
+胎儿 628 n
+胎具 3 n
+胎动 28 n
+胎发 6 n
+胎座 38 n
+胎心 23 n
+胎教 18 n
+胎模 3 n
+胎次 3 b
+胎死腹中 10 i
+胎毒 3 n
+胎毛 25 n
+胎毛笔 3 n
+胎气 25 n
+胎生 142 n
+胎生动物 3 n
+胎生学 3 n
+胎生牙 3 n
+胎甲球 3 n
+胎痣 3 n
+胎盘 204 n
+胎盘球蛋白 5 n
+胎盘癌 3 n
+胎膜 17 n
+胎衣 7 n
+胎记 13 n
+胎质 13 n
+胎骨 7 n
+胖 1535 a
+胖丐 3 n
+胖乎乎 36 z
+胖人 7 n
+胖仔 3 n
+胖商人 3 n
+胖嘟嘟 8 z
+胖墩 2 n
+胖墩儿 3 z
+胖墩墩 10 z
+胖大海 6 n
+胖头 7 n
+胖头陀 3 n
+胖头鱼 5 n
+胖女人 3 n
+胖妇人 3 n
+胖妞 2 n
+胖妹 3 n
+胖娃 3 n
+胖嫂 3 n
+胖子 5038 n
+胖尊者 21 n
+胖小子 21 n
+胖汉 4 n
+胖症 3 n
+胖瘦 48 z
+胖胖 31 z
+胖胖的 85 z
+胗 29 g
+胙 27 g
+胚 359 n
+胚乳 133 n
+胚体 3 n
+胚囊 30 n
+胚嫁接 3 n
+胚子 28 n
+胚层 129 n
+胚根 13 n
+胚珠 202 n
+胚盘 10 n
+胚胎 504 n
+胚胎学 70 n
+胚胎学家 17 n
+胚芽 16 n
+胚芽油 3 n
+胚芽米 3 n
+胚芽鞘 10 n
+胚轴 14 n
+胛 25 zg
+胛骨 3 n
+胜 6242 v
+胜不骄 3 i
+胜举 2 v
+胜之 3 l
+胜之不武 3 i
+胜于 3 v
+胜于蓝 3 nr
+胜于防川 3 l
+胜人一筹 10 i
+胜仗 304 n
+胜任 486 n
+胜任愉快 3 z
+胜任者 2 n
+胜会 3 n
+胜似 45 v
+胜出 128 v
+胜出一筹 5 i
+胜利 8904 vn
+胜利品 6 n
+胜利在望 3 v
+胜利归来 3 l
+胜利村 3 n
+胜利果实 25 n
+胜利油田 20 nt
+胜利渠 7 n
+胜利者 157 n
+胜利路 4 n
+胜利队 3 nt
+胜券 13 n
+胜券在握 21 l
+胜势 3 n
+胜友如云 3 l
+胜地 662 n
+胜境 18 n
+胜局 64 n
+胜招 3 n
+胜数 3 n
+胜方 8 n
+胜景 95 n
+胜有声 3 n
+胜朝 3 n
+胜果 8 n
+胜概 3 n
+胜残去杀 3 i
+胜点 3 n
+胜率 43 n
+胜算 118 vn
+胜算可操 3 l
+胜绩 20 n
+胜者 82 n
+胜者为王 3 l
+胜腾 10 v
+胜西 5 n
+胜诉 43 vn
+胜诉人 3 n
+胜诉权 3 n
+胜读十年书 5 n
+胜负 636 v
+胜负彩 3 l
+胜负手 6 n
+胜负难测 3 l
+胜败 379 v
+胜败乃兵家常事 13 i
+胜败可卜 3 l
+胜过 658 v
+胜进村 3 n
+胜迹 804 n
+胜造七级浮屠 15 i
+胜部 3 n
+胜部冠军 3 n
+胜队 5 n
+胝 22 x
+胞 450 n
+胞兄 11 n
+胞兄弟 3 n
+胞内酶 3 n
+胞叔 3 n
+胞吐 3 n
+胞吞 3 n
+胞咽 3 n
+胞嘧啶 15 n
+胞囊 3 n
+胞壁质 3 n
+胞壁酸 3 n
+胞外区 3 n
+胞外域 3 n
+胞外基质 3 n
+胞外连丝 3 n
+胞外酶 3 n
+胞妹 7 n
+胞姊 3 n
+胞姐 3 n
+胞弟 22 n
+胞影蛋白 3 n
+胞波 3 n
+胞肓 3 n
+胞胎 3 n
+胞腔 3 n
+胞腔空间 3 n
+胞膜 3 n
+胞芽 3 n
+胞苷酸 3 n
+胞衣 16 n
+胞衬蛋白 3 nz
+胞质体 3 n
+胞质区 3 n
+胞质压出 3 n
+胞质受体 3 n
+胞质基因 3 n
+胞质定位 3 n
+胞质尾区 3 n
+胞质斑 3 n
+胞质杂交 3 n
+胞质杂种 3 n
+胞质溶胶 3 n
+胞质环流 3 n
+胞质腔 3 n
+胞质运动 3 n
+胞质配合 3 n
+胞转小泡 3 n
+胞转蛋白 3 n
+胞间层 3 n
+胞间连丝 3 n
+胞霉素 3 n
+胞饮 3 n
+胞饮作用 3 n
+胠 2 zg
+胡 3307 nr
+胡一刀 3 nr
+胡一雅 2 nr
+胡丁琦 3 nr
+胡万林 2 nr
+胡三省 5 nr
+胡不归 2 i
+胡世兄 6 nr
+胡世博 5 nr
+胡世庆 5 nr
+胡世祥 6 nr
+胡为乎 3 nr
+胡为乱信 3 i
+胡为民 5 nr
+胡主席 3 n
+胡丽鹃 6 nr
+胡乃辉 2 nr
+胡之缨 3 nr
+胡乐 2 nr
+胡乔木 145 nr
+胡也频 10 nr
+胡书记 3 nr
+胡乱 634 n
+胡于蔡 2 nr
+胡云宣 3 nr
+胡云峰 4 nr
+胡云鹏 5 nr
+胡亚捷 3 nr
+胡亚雷斯 10 nr
+胡人 284 nr
+胡人之 7 nr
+胡人双 2 nr
+胡人安 2 nr
+胡人常 2 nr
+胡仔你 2 nr
+胡传奎 2 nr
+胡传揆 2 nr
+胡佛 39 nr
+胡佛坝 5 nr
+胡作乱为 3 i
+胡作胡为 3 nr
+胡作非为 140 i
+胡你刚 3 nr
+胡你真 3 nr
+胡佩衡 6 nr
+胡佳 256 nr
+胡侦探 3 nr
+胡俊辉 5 nr
+胡信平 2 nr
+胡僧哲 2 nr
+胡元谋 10 nr
+胡兄弟 7 nr
+胡兆军 12 nr
+胡兆明 3 nr
+胡兆龙 3 nr
+胡先生 111 nr
+胡光伟 2 nr
+胡光墉 3 nr
+胡光宝 258 nr
+胡克 89 nr
+胡克定律 3 nr
+胡八一 15 nr
+胡八非为 3 i
+胡公公 3 nr
+胡公子 7 nr
+胡公庙 27 nr
+胡公满 4 nr
+胡兰成 14 nr
+胡兰镇 3 nr
+胡冠珍 3 nr
+胡凤莲 3 nr
+胡利奥 4 nr
+胡力斯台 3 nr
+胡加时 11 nr
+胡劲华 3 nr
+胡匪 55 n
+胡华之 2 nr
+胡卓伟 18 nr
+胡卫东 2 nr
+胡卫民 51 nr
+胡厚宣 8 nr
+胡厚昆 256 nr
+胡厥文 7 nr
+胡口 2 n
+胡司令 11 nr
+胡吃海喝 3 i
+胡吃海塞 3 i
+胡吃闷睡 3 v
+胡同 1762 nr
+胡同口 63 nr
+胡同胡须 3 nr
+胡名斐 6 nr
+胡后马 2 nr
+胡吗个 3 n
+胡君荣 6 nr
+胡吣 6 nr
+胡启立 25 nr
+胡吴会 5 nr
+胡吹 79 nr
+胡和杨 2 nr
+胡和胡 2 nr
+胡噜 3 n
+胡国兴 2 nr
+胡国华 112 nr
+胡国渊 3 nr
+胡图族 7 nr
+胡地 4 n
+胡塞尔 16 nr
+胡士相 17 nr
+胡大一 32 nr
+胡大人 30 nr
+胡大仙 31 nr
+胡大侠 10 nr
+胡大哥 122 nr
+胡大昌 2 nr
+胡大海 11 nr
+胡大爷 45 nr
+胡天 4 nr
+胡天胡地 2 nr
+胡天胡帝 5 nr
+胡天鸽 3 nr
+胡太后 14 nr
+胡太明 3 nr
+胡夫 17 nr
+胡夫人 13 nr
+胡奇森 4 nr
+胡奋 3 nrfg
+胡如雷 16 nr
+胡姬花 3 nr
+胡子 1297 nr
+胡子兵 2 nr
+胡子卷 2 nr
+胡子太医 4 nr
+胡子微微 2 nr
+胡子拉碴 10 l
+胡子拔 2 nr
+胡子昂 4 nr
+胡子渣 3 nr
+胡子生 3 nr
+胡子真 2 nr
+胡子舞 2 nr
+胡子鱼 2 nr
+胡孝乾 16 nr
+胡守仁 3 nr
+胡安国 2 nr
+胡安娜 5 nr
+胡安岛 2 nr
+胡安弗 2 nr
+胡安诺 2 nr
+胡宗南 89 nr
+胡宗宪 412 nr
+胡宗温 3 nr
+胡宗琪 3 nr
+胡宗铎 3 nr
+胡定欣 3 nr
+胡宝玉 2 nr
+胡家 110 nrfg
+胡家刀 3 nr
+胡家小 2 nr
+胡家快 2 nr
+胡家燕 7 nr
+胡家累 3 nr
+胡家那 2 nr
+胡家门 2 nr
+胡寄窗 3 nr
+胡富国 9 nr
+胡富夫 2 nr
+胡寓 2 n
+胡小姐 2 nr
+胡小胖 2 nr
+胡尔城 2 nr
+胡尔奇 8 nr
+胡尔维 2 nr
+胡尔达 3 nr
+胡尧元 2 nr
+胡岳元 2 nr
+胡布会 2 nr
+胡师伯 15 nr
+胡希捷 2 nr
+胡庄村 2 nr
+胡庆余堂 10 nr
+胡庆光 2 nr
+胡庆士 3 nr
+胡床 3 n
+胡应嘉 28 nr
+胡应麟 9 nr
+胡庭胜 3 nr
+胡康生 256 nr
+胡庸医 2 nr
+胡建国 12 nr
+胡建学 2 nr
+胡彦斌 3 nr
+胡彩玲 2 nr
+胡得禄 14 nr
+胡得福 12 nr
+胡德堡 6 nr
+胡德平 258 nr
+胡德章 2 nr
+胡德第 3 nr
+胡志坚 4 nr
+胡志强 3 nr
+胡志明 63 nr
+胡志明市 66 nr
+胡志标 12 nr
+胡忠友 27 nr
+胡思 6 nr
+胡思乱想 249 i
+胡思乱量 3 i
+胡思杜 3 nr
+胡恩勇 5 nr
+胡愈之 17 nr
+胡慧中 2 nr
+胡成精 3 nr
+胡打海摔 3 l
+胡扯 93 v
+胡承华 6 nr
+胡拉乱扯 3 i
+胡搅 11 nr
+胡搅蛮缠 32 i
+胡搞 3 v
+胡搞一气 3 v
+胡支扯叶 3 i
+胡改荐 2 nr
+胡政之 2 nr
+胡敬德 2 nr
+胡文焕 2 nr
+胡文龙 10 nr
+胡斐万 2 nr
+胡斐举 8 nr
+胡斐乘 3 nr
+胡斐伏 2 nr
+胡斐伸 8 nr
+胡斐依 6 nr
+胡斐先 2 nr
+胡斐全 2 nr
+胡斐击 3 nr
+胡斐刀 3 nr
+胡斐刚 2 nr
+胡斐制 2 nr
+胡斐力 3 nr
+胡斐勒 2 nr
+胡斐原 3 nr
+胡斐双 6 nr
+胡斐右 3 nr
+胡斐叹 4 nr
+胡斐吓 2 nr
+胡斐听 9 nr
+胡斐喜 5 nr
+胡斐大 9 nr
+胡斐夹 2 nr
+胡斐奇 8 nr
+胡斐微 5 nr
+胡斐微微 10 nr
+胡斐心 35 nr
+胡斐忍 2 nr
+胡斐忙 12 nr
+胡斐忽 3 nr
+胡斐怒 7 nr
+胡斐惊 3 nr
+胡斐抢 3 nr
+胡斐抱 2 nr
+胡斐拔 2 nr
+胡斐探 2 nr
+胡斐推 2 nr
+胡斐提 2 nr
+胡斐摇 3 nr
+胡斐放 2 nr
+胡斐朗 5 nr
+胡斐望 3 nr
+胡斐本 3 nr
+胡斐枉 2 nr
+胡斐树 2 nr
+胡斐横 4 nr
+胡斐正 7 nr
+胡斐疾 2 nr
+胡斐相 2 nr
+胡斐知 14 nr
+胡斐硬 2 nr
+胡斐离 2 nr
+胡斐站 6 nr
+胡斐竟 2 nr
+胡斐笑 62 nr
+胡斐绕 3 nr
+胡斐背 3 nr
+胡斐胡 2 nr
+胡斐自 6 nr
+胡斐若 3 nr
+胡斐行 2 nr
+胡斐见 59 nr
+胡斐越 4 nr
+胡斐跃 5 nr
+胡斐身 16 nr
+胡斐转 2 nr
+胡斐轻 2 nr
+胡斐连 8 nr
+胡斯党 4 nr
+胡斯尼 9 nr
+胡旋舞 3 nr
+胡明华 2 nr
+胡明复 8 nr
+胡明明 3 nr
+胡春华 264 nr
+胡春蕾 3 nr
+胡昭曦 14 nr
+胡昭衡 4 nr
+胡晓义 4 nr
+胡晓光 3 nr
+胡晓婷 3 nr
+胡晓峰 2 nr
+胡晓梦 3 nr
+胡晓群 4 nr
+胡晓莉 3 nr
+胡景义 3 nr
+胡景桂 2 nr
+胡景翼 3 nr
+胡晴雯 3 nr
+胡智琴 7 nr
+胡有为 3 nr
+胡有儿 12 nr
+胡有财 3 nr
+胡服 17 nr
+胡服骑 23 nr
+胡服骑射 3 nr
+胡本杨 13 nr
+胡朴安 4 nr
+胡杏儿 3 nr
+胡来 95 nr
+胡杨 44 nr
+胡杨林 277 nr
+胡杨树 3 nr
+胡松华 4 nr
+胡林翼 14 nr
+胡果 3 n
+胡枝子 13 nr
+胡枝扯叶 3 i
+胡柚 3 n
+胡校长 21 nr
+胡格利 6 nr
+胡格尔 2 nr
+胡格诺 53 nr
+胡桂兰 2 nr
+胡桂南 102 nr
+胡桃 79 nr
+胡桃木 3 nr
+胡桃肉 3 nr
+胡桃醌 3 nz
+胡桃钳 3 nr
+胡桐木 2 nr
+胡梅尔 2 nr
+胡梅梅 3 nr
+胡梦卜 3 nr
+胡梯边 2 nr
+胡椒 313 nr
+胡椒粉 13 nr
+胡椒面 11 n
+胡樱汶 3 nr
+胡正卿 10 nr
+胡正详 2 nr
+胡正跃 4 nr
+胡毋生 2 nr
+胡母氏 2 nr
+胡永合 59 nr
+胡永柱 2 nr
+胡永福 2 nr
+胡永继 2 nr
+胡汉三 6 nr
+胡汉各 3 nr
+胡汉方 3 nr
+胡汉民 48 nr
+胡汝银 2 nr
+胡治兵 8 nr
+胡注表 2 nr
+胡泽斯 2 nr
+胡济 3 n
+胡海泉 3 nr
+胡海波 18 nr
+胡海洋 5 nr
+胡涂 408 nr
+胡溪涛 9 nr
+胡焕庸 6 nrfg
+胡猜乱想 4 i
+胡猜乱道 3 i
+胡率众 2 nr
+胡玉昆 2 nr
+胡玉珍 2 nr
+胡珀 2 n
+胡琴 89 nr
+胡瓜 11 n
+胡登峰 13 nr
+胡登洲 3 nr
+胡皇后 4 nr
+胡相公 7 nr
+胡祖望 7 nr
+胡福才 2 nr
+胡秉安 45 nr
+胡秉宸 2643 nr
+胡秋原 2 nr
+胡程 17 n
+胡立君 2 nr
+胡立孜 3 nz
+胡立教 3 nr
+胡笑红 3 nr
+胡笙 3 nr
+胡笳 16 nr
+胡笳十八拍 13 l
+胡笳吟 2 nr
+胡笳鸣 2 nr
+胡纯贞 5 nr
+胡经之 3 nr
+胡经甫 2 nr
+胡绣凤 9 nr
+胡绩伟 4 nr
+胡绳武 2 nr
+胡维新 3 nr
+胡编 26 v
+胡编乱写 3 i
+胡编乱造 15 l
+胡缠 3 n
+胡美丽 11 nr
+胡耀宇 6 nr
+胡耀邦 245 nr
+胡老三 20 nr
+胡老大 2 nr
+胡老爷 20 nr
+胡老胡 3 nr
+胡肇轩 3 nr
+胡肥锺瘦 3 nr
+胡腾舞 2 nr
+胡自皋 289 nr
+胡舜陟 2 nr
+胡艳萍 3 nr
+胡艾克 5 nr
+胡芦巴 3 nr
+胡花蕊 6 nr
+胡苗范 9 nr
+胡若愚 2 nr
+胡若望 2 nr
+胡茬 12 n
+胡茬子 3 n
+胡茵梦 3 nr
+胡荣华 8 nr
+胡荽 3 n
+胡莱莱 2 nr
+胡萝卜 452 nr
+胡萝卜汁 3 n
+胡萝卜素 176 n
+胡萨克 9 nr
+胡蒂拉 2 nr
+胡蓉蓉 3 nr
+胡蓝之 2 nr
+胡蜂 36 nr
+胡蝶 11 nr
+胡行乱为 3 i
+胡行乱闹 3 i
+胡西塔 3 nr
+胡言 58 nr
+胡言乱言 3 i
+胡言乱语 177 i
+胡言乱道 3 i
+胡言汉语 3 nr
+胡训军 2 nr
+胡诌 66 v
+胡诌乱扯 3 v
+胡诌乱说 3 v
+胡诌乱道 3 z
+胡诌八扯 3 l
+胡诚善 14 nr
+胡话 32 n
+胡说 699 nrfg
+胡说乱道 3 i
+胡说八道 703 i
+胡说白道 3 i
+胡诺言 3 nr
+胡豆 5 nr
+胡象明 5 nr
+胡贝图 6 nr
+胡贝尔 4 nr
+胡贤生 257 nr
+胡赤儿 3 nr
+胡越一家 3 nr
+胡越之祸 3 i
+胡越同舟 3 i
+胡越山 3 nr
+胡越明 5 nr
+胡跃平 7 nr
+胡车儿 2 nr
+胡载里 2 nr
+胡辉中 6 nr
+胡辣汤 14 nr
+胡达奎 2 nr
+胡达林 12 nr
+胡连生 109 nr
+胡适 250 nr
+胡适之 19 nr
+胡适任 4 nr
+胡逗洲 2 nr
+胡逸之 34 nr
+胡道静 3 nr
+胡那帮 3 nr
+胡里卜 2 nr
+胡里奥 2 nr
+胡里安 2 nr
+胡里改 6 nr
+胡里特 3 nr
+胡里痕 2 nr
+胡里胡涂 90 nr
+胡金 2 n
+胡金德 3 nr
+胡铁钧 3 nr
+胡铨 5 nr
+胡链 2 n
+胡锡琪 3 nr
+胡锦涛 558 nr
+胡锦生 2 nr
+胡镇埔 28 nr
+胡长清 16 nr
+胡长顺 2 nr
+胡闹 493 nr
+胡雅歆 256 nr
+胡雪岩 4 nr
+胡雪峰 7 nr
+胡雪柏 2 nr
+胡震亨 3 nr
+胡青牛 255 nr
+胡青羊 5 nr
+胡青风 123 nr
+胡靖钒 3 nr
+胡鞍钢 7 nr
+胡须 324 d
+胡须渣 3 nr
+胡风 305 nr
+胡风似 2 nr
+胡风分 3 nr
+胡马雍 7 nr
+胡骚情 2 nr
+胡鹏春 2 nr
+胡麻 64 nr
+胡黄连 3 nr
+胡黎明 256 nr
+胡齐斯 4 nr
+胡齐斯坦省 4 ns
+胤 583 g
+胥 64 nr
+胥举鼎 2 nr
+胥入秦 2 nr
+胥各庄 5 nr
+胥吏 25 nr
+胥吏杜 2 nr
+胥吏汇 2 nr
+胥德章 138 nr
+胥慧霞 8 nr
+胥持国 3 nr
+胥柳曼 2 nr
+胥金章 10 nr
+胧 90 x
+胨 44 zg
+胩 38 g
+胪 1739 g
+胪岗镇 2 v
+胫 139 ng
+胫大于股 3 n
+胫骨 45 n
+胬 30 x
+胬肉 2 n
+胭 8 n
+胭粉 3 n
+胭红 3 n
+胭脂 262 n
+胭脂扣 3 n
+胭脂氨酸 3 n
+胭脂粉 2 n
+胭脂红 98 n
+胭脂花粉 3 n
+胭脂虎 3 n
+胭脂鱼 4 n
+胯 426 zg
+胯下 3 n
+胯下之辱 3 n
+胯下蒲伏 3 vn
+胯档 3 n
+胯部 3 n
+胯里 3 n
+胯骨 11 n
+胰 181 n
+胰子 7 n
+胰岛 48 n
+胰岛素 290 n
+胰岛素泵 3 n
+胰岛素瘤 3 n
+胰岛腺 3 n
+胰液 50 n
+胰胆管 4 l
+胰脂酶 3 n
+胰脏 3 n
+胰脏炎 3 n
+胰腺 85 n
+胰腺炎 34 n
+胰腺癌 38 n
+胰蛋白酶 15 l
+胱 99 x
+胱氨酸 6 nz
+胱硫醚 3 nz
+胱胺 3 nz
+胱胺酸 4 nz
+胱胺醚酶 3 nz
+胳 22 zg
+胳肢 5 n
+胳肢窝 16 n
+胳膀 3 n
+胳膊 1249 n
+胳膊扭不过大腿 4 l
+胳膊拧不过大腿 4 l
+胳膊窝 3 n
+胳膊肘 37 n
+胳膊肘儿 3 z
+胳膊肘子 3 v
+胳膊腕子 3 n
+胳臂 114 n
+胴 28 n
+胴体 20 n
+胵 9 zg
+胶 936 n
+胶东 106 ns
+胶东区 3 ns
+胶东半岛 25 ns
+胶丸 3 n
+胶乳 12 nz
+胶住 3 v
+胶体 213 n
+胶体化学 3 n
+胶体沉淀 3 l
+胶体溶液 12 n
+胶体状态 3 l
+胶体磨 2 n
+胶体金 3 n
+胶冻 3 n
+胶化 3 n
+胶南 8 ns
+胶南县 3 ns
+胶南市 7 ns
+胶印 12 n
+胶印机 4 n
+胶卷 86 n
+胶原 89 ns
+胶原病 4 n
+胶原纤维 3 l
+胶原蛋白 3 n
+胶原螺旋 3 n
+胶原酶 3 n
+胶县 3 ns
+胶叉 3 n
+胶合 39 v
+胶合剂 2 n
+胶合板 70 n
+胶合板厂 4 n
+胶合板门 3 n
+胶囊 172 n
+胶囊剂 12 n
+胶囊化 3 n
+胶固 3 v
+胶圈 3 n
+胶块 2 n
+胶垫 3 n
+胶塞 79 n
+胶州 31 ns
+胶州市 9 ns
+胶州湾 65 ns
+胶州网 3 nz
+胶州路 3 ns
+胶布 33 v
+胶布膏 3 n
+胶带 66 n
+胶带机 3 n
+胶底鞋 3 n
+胶态凝胶 3 n
+胶态化 3 n
+胶态硅石 3 n
+胶料 11 n
+胶木 13 n
+胶木粉 3 nz
+胶束 3 v
+胶条 5 n
+胶柱调瑟 3 n
+胶柱鼓瑟 6 ns
+胶棒 2 n
+胶水 31 n
+胶泥 25 n
+胶济线 3 n
+胶溶 3 nz
+胶漆 3 n
+胶片 155 n
+胶片版 3 nz
+胶版 10 n
+胶版印刷 3 n
+胶版纸 3 n
+胶状 25 n
+胶状沉淀 3 l
+胶状物 11 n
+胶状结构 3 n
+胶瑟 3 nz
+胶画 3 n
+胶皮 30 n
+胶盔 3 n
+胶着 35 v
+胶着状态 17 l
+胶管 14 n
+胶粉 3 n
+胶粒 12 n
+胶粘 13 b
+胶粘制品 3 n
+胶粘剂 97 n
+胶粘地 3 n
+胶粘带 3 n
+胶纸 3 n
+胶结 55 v
+胶结作用 3 l
+胶结剂 3 nz
+胶结指数 3 nz
+胶膜 8 n
+胶袋 2 n
+胶装机 3 n
+胶西丘陵 3 ns
+胶质 147 n
+胶质瘤 3 n
+胶转磁 3 n
+胶轮 7 n
+胶辊 2 nz
+胶霉毒素 3 n
+胶靴 2 nz
+胶鞋 49 n
+胶鬲之困 3 v
+胸 2284 ng
+胸中 410 s
+胸中万卷 3 i
+胸中垒块 3 n
+胸中无数 3 i
+胸中有数 3 i
+胸中甲兵 3 n
+胸中鳞甲 3 i
+胸乡 3 n
+胸像 15 n
+胸内 3 s
+胸前 857 s
+胸卡 17 n
+胸口 2299 s
+胸围 43 n
+胸墙 11 n
+胸壁 23 s
+胸外科 16 n
+胸宽 4 n
+胸廓 40 n
+胸式呼吸 3 l
+胸径 45 n
+胸怀 215 n
+胸怀坦白 3 i
+胸怀坦荡 9 i
+胸怀大局 3 i
+胸怀大志 25 i
+胸怀故国 3 i
+胸怀磊落 3 i
+胸怀祖国 4 i
+胸无 3 j
+胸无城府 7 i
+胸无大志 21 i
+胸无宿物 3 i
+胸无成竹 3 i
+胸无点墨 9 i
+胸有丘壑 3 i
+胸有城府 3 n
+胸有悬镜 3 n
+胸有成略 3 i
+胸有成竹 152 i
+胸有成算 3 i
+胸有邱壑 3 v
+胸有鳞甲 3 i
+胸椎 25 n
+胸次 3 n
+胸片 3 n
+胸牌 5 n
+胸甲 3 n
+胸痛 101 n
+胸痹 15 n
+胸章 18 n
+胸管 3 n
+胸罗万象 3 i
+胸罩 48 n
+胸肌 27 n
+胸胁 31 vn
+胸脊 3 n
+胸脯 423 n
+胸腔 174 n
+胸腔镜 3 n
+胸腹 129 n
+胸腺 95 n
+胸腺素 11 n
+胸腺肽 4 n
+胸膈 11 n
+胸膛 663 n
+胸膜 90 n
+胸膜炎 29 n
+胸臆 60 n
+胸花 4 n
+胸衣 3 n
+胸襟 208 n
+胸襟开阔 3 i
+胸透 6 j
+胸部 466 n
+胸部手术 3 n
+胸里 3 s
+胸针 11 n
+胸闷 3 n
+胸际 3 n
+胸饰 12 n
+胸骨 69 n
+胸鳍 196 n
+胺 357 n
+胺凝胶 3 nz
+胺合成酶 3 nz
+胺基 11 nz
+胺基酸 3 nz
+胺多酚 3 nz
+胺盐 3 nz
+胺类 40 nz
+胺脱氢酶 3 nz
+胺酶 3 nz
+胺键 3 nz
+胺霉素 3 nz
+胼 2 n
+胼四俪六 3 t
+胼手胝足 7 i
+胼胝 30 n
+胼胝手足 3 i
+胼胝质 3 i
+能 93096 v
+能上场 3 n
+能上能下 15 n
+能不称官 3 l
+能不能够 3 v
+能丰长 8 nr
+能举贤 3 nr
+能之士 3 nr
+能乐 7 n
+能乘舟 2 nr
+能书善 2 nr
+能事 79 n
+能人 110 n
+能以勇 16 nr
+能以君 3 nr
+能传粉 2 n
+能传送 3 nr
+能伸 3 v
+能伸能屈 2 n
+能保命 2 n
+能修习 2 nr
+能先知 2 nr
+能克刚 5 nr
+能克己 16 nr
+能克承 2 nr
+能克服 3 n
+能克钢 2 nr
+能免 3 v
+能免则免 3 l
+能再容 2 nr
+能写会算 2 n
+能写能听 3 n
+能写能讲 3 v
+能写能说 3 n
+能写能读 3 v
+能冶铸 3 nr
+能到 3 v
+能剧 3 n
+能力 18874 n
+能力倾向 3 n
+能力型 7 n
+能力差 3 n
+能力差异 3 i
+能力表 3 n
+能动 124 v
+能动性 119 n
+能勉力 2 nr
+能化成 2 nr
+能卫国 3 n
+能参详 2 nr
+能及 3 v
+能取 3 v
+能变 3 v
+能吃能喝 3 l
+能否 1845 v
+能听能写 3 i
+能听能看 3 i
+能听能讲 3 l
+能听能说 3 n
+能听能读 3 v
+能呼召 2 nr
+能善加 2 nr
+能增能减 3 i
+能士 3 n
+能复官 2 nr
+能够 14382 v
+能大则大 3 nr
+能天威 2 nr
+能奈 3 n
+能如龙 2 nr
+能守 3 v
+能守能攻 3 nr
+能安眠 2 nr
+能安邦 2 nr
+能官能民 3 n
+能容 14 n
+能容容 2 n
+能少生 2 nr
+能屈能伸 32 i
+能工巧匠 168 n
+能带 152 n
+能干 77 n
+能开 3 v
+能开成 4 nr
+能征 5 n
+能征善战 3 i
+能征惯战 11 n
+能得洪 2 nr
+能御之 2 nr
+能忍则安 3 i
+能感 3 n
+能成 3 v
+能成仙 2 nr
+能成佛 3 nr
+能成善 16 nr
+能手 178 n
+能指 3 n
+能振动 3 n
+能挽弓 2 nr
+能掐会算 3 l
+能攻 3 v
+能攻善守 3 i
+能攻能守 3 n
+能效 24 n
+能教靖 2 nr
+能文能武 13 nr
+能斯脱 5 nr
+能曲能伸 3 nr
+能来 3 v
+能歌善舞 58 i
+能比 180 v
+能永保 17 nr
+能汇纳 2 nr
+能油比 3 n
+能津涧 2 nr
+能流 3 n
+能流密度 3 n
+能流畅 3 nr
+能清肠 2 n
+能源 2232 n
+能源业 3 n
+能源价格 3 n
+能源供应 3 n
+能源办 5 v
+能源动力 3 n
+能源危机 3 i
+能源安全 3 nr
+能源工业 3 n
+能源建设 3 n
+能源开发 3 i
+能源技术 3 n
+能源消耗 3 n
+能源科学 3 n
+能源管理 3 n
+能源经济 3 n
+能源网 3 n
+能源行业 3 n
+能源部 44 n
+能源部长 5 n
+能源需求 3 n
+能溶 17 n
+能漂一邑 3 nr
+能演 3 n
+能演能唱 3 n
+能牙利齿 3 n
+能率 7 n
+能玉成 2 nr
+能玻璃化 3 n
+能用 3 v
+能留 3 v
+能留则留 3 nr
+能登 10 v
+能相容 2 n
+能看懂 3 l
+能看能写 3 i
+能看能听 3 i
+能看能讲 3 l
+能看能说 3 l
+能知 3 v
+能穿孔 3 n
+能立世 2 nr
+能级 213 n
+能级宽度 3 l
+能者 24 n
+能者为师 3 i
+能者多劳 7 i
+能而君 2 nr
+能耐 275 n
+能耐我何 3 l
+能耗 142 n
+能育养 16 n
+能育叶 3 n
+能臣 6 n
+能自生 2 nr
+能行 3 v
+能被通过 3 i
+能见 3 v
+能见度 180 n
+能解 3 v
+能言善 7 nr
+能言善辩 27 i
+能言善道 3 i
+能言巧辩 3 i
+能言快语 2 i
+能言快说 3 l
+能讲能写 3 n
+能讲能听 3 n
+能讲能看 3 l
+能讲能读 3 n
+能译 3 v
+能诗会 3 nr
+能诗善 4 nr
+能说会道 44 n
+能说善道 3 i
+能说惯道 3 v
+能说能写 3 v
+能说能听 3 i
+能说能讲 3 v
+能说能读 3 v
+能读 3 v
+能读能写 3 n
+能读能听 3 n
+能读能讲 3 nr
+能读能说 3 n
+能谋善 2 nr
+能谋善断 3 i
+能谱 57 n
+能谱仪 6 n
+能跑能跳 3 l
+能跟楚 2 nr
+能跟洪 2 nr
+能运功 2 n
+能进宫 129 nr
+能进球 3 n
+能进能出 2 n
+能进能退 3 l
+能连铁 4 n
+能退 3 v
+能退能进 3 i
+能重立 2 nr
+能量 2692 n
+能量不灭 3 v
+能量代谢 3 i
+能量子 8 n
+能量守恒 3 nr
+能量最优 3 nr
+能量棒 2 n
+能量消耗 3 n
+能量色散 3 n
+能量转移 3 n
+能长生 4 n
+能长胜 2 nr
+能阶 3 n
+能阿弥 2 nr
+能降 3 v
+能静心 2 n
+能面 3 n
+能预卜 2 nr
+能食禄 2 nr
+胾 2 zg
+脁 20 zg
+脂 677 n
+脂油 4 n
+脂溶剂 3 n
+脂砚斋 9 ns
+脂类 66 n
+脂粉 161 n
+脂粉未施 3 n
+脂粉气 12 n
+脂肪 1298 n
+脂肪乳 3 n
+脂肪体 3 n
+脂肪型 3 n
+脂肪性 3 n
+脂肪瘤 3 n
+脂肪粒 3 n
+脂肪组织 3 n
+脂肪肝 111 n
+脂肪腺 3 n
+脂肪质 3 n
+脂肪酶 7 n
+脂肪酸 260 n
+脂肪醇 6 n
+脂膏 19 n
+脂膏不润 3 n
+脂膏莫润 3 n
+脂蛋白 90 n
+脂质体 3 n
+脂酸 3 n
+脃 10 zg
+脆 655 a
+脆丽 3 a
+脆亮 3 a
+脆化温度 3 n
+脆响 27 n
+脆嫩 3 a
+脆弱 478 a
+脆弱不堪 3 nz
+脆弱性 28 n
+脆快 3 a
+脆性 65 n
+脆性位点 3 n
+脆性岩石 3 n
+脆性断裂 3 n
+脆点 3 n
+脆爽 3 a
+脆生 2 n
+脆生生 11 n
+脆皮 5 a
+脆而不坚 3 n
+脆金属 3 n
+脆饼 3 n
+脆骨 4 n
+脆骨症 3 n
+脉 3089 ng
+脉位调制 3 n
+脉冲 695 n
+脉冲前沿 3 n
+脉冲功率 3 n
+脉冲后沿 3 n
+脉冲响应 3 n
+脉冲幅度 10 vn
+脉冲序列 3 n
+脉冲效应 3 n
+脉冲数 3 n
+脉冲星 44 n
+脉冲检波 3 n
+脉冲步进 3 n
+脉冲电流 3 n
+脉冲计 3 n
+脉冲调制 3 n
+脉冲阀 3 n
+脉冲雷达 3 n
+脉动 94 n
+脉动星 3 n
+脉动电流 3 n
+脉动阵列 2 l
+脉动阵列结构 2 n
+脉压 8 n
+脉宽调制 3 l
+脉岩 3 n
+脉幅调制 3 l
+脉息 37 n
+脉搏 260 n
+脉搏表 3 n
+脉搏计 3 n
+脉时调制 3 n
+脉案 3 n
+脉波 3 n
+脉泽 3 n
+脉率 8 n
+脉理 3 n
+脉石 3 n
+脉矿 3 n
+脉码调制 4 n
+脉管 26 n
+脉管炎 10 n
+脉细数 3 n
+脉经 3 n
+脉络 155 n
+脉络丛 3 n
+脉络分明 3 n
+脉络可循 3 n
+脉络膜 15 n
+脉络贯通 3 n
+脉脉 33 n
+脉脉传情 3 n
+脉脉含情 18 n
+脉脉念情 3 n
+脉脉相通 3 l
+脉膊 3 n
+脉象 103 n
+脉速 2 n
+脉门 80 n
+脊 2503 n
+脊中 3 l
+脊形喇叭 3 l
+脊形波导 3 n
+脊柱 144 n
+脊柱炎 3 n
+脊梁 143 n
+脊梁背 3 l
+脊梁骨 52 n
+脊椎 121 n
+脊椎动物 491 l
+脊椎炎 6 n
+脊椎神经 3 l
+脊椎骨 38 l
+脊瓜柱 3 n
+脊神经 31 l
+脊索 57 n
+脊索动物 42 l
+脊线 16 n
+脊背 217 n
+脊骨 40 n
+脊髓 297 n
+脊髓型 6 n
+脊髓灰质炎 40 n
+脊髓炎 10 n
+脊鳍 3 n
+脋 4 zg
+脌 3 zg
+脍 24 zg
+脍不厌细 3 i
+脍炙 3 i
+脍炙人口 89 i
+脍饭 3 l
+脎 4 g
+脏 962 a
+脏东西 3 n
+脏乎乎 10 z
+脏乱 19 n
+脏乱差 18 l
+脏兮兮 30 z
+脏器 223 n
+脏土 2 n
+脏字 27 n
+脏弹 3 n
+脏得 3 n
+脏心烂肺 3 l
+脏水 24 n
+脏污 10 n
+脏活 8 n
+脏物 27 n
+脏稀稀 3 l
+脏脸 3 n
+脏腑 376 n
+脏话 58 n
+脏象 3 n
+脏钱 3 n
+脐 112 n
+脐带 43 n
+脐带血 2 n
+脐橙 8 n
+脐部 8 n
+脑 2971 n
+脑上体 3 n
+脑下垂体 21 n
+脑中风 16 l
+脑体倒挂 3 i
+脑儿 3 n
+脑充血 2 n
+脑出血 24 n
+脑力 65 n
+脑力健 3 n
+脑力劳动 64 l
+脑力劳动者 43 n
+脑力激荡 3 l
+脑力键 3 n
+脑勺 3 n
+脑勺子 3 n
+脑卒中 3 i
+脑啡肽 3 n
+脑啡肽原 3 n
+脑啡肽酶 3 n
+脑垂体 64 n
+脑壳 194 n
+脑壳子 3 n
+脑外伤 3 n
+脑外科 9 n
+脑子 1378 n
+脑子里 3 n
+脑学 3 n
+脑室 56 n
+脑干 96 n
+脑心通 5 n
+脑户 3 n
+脑损伤 3 n
+脑机制 3 n
+脑栓塞 8 n
+脑梗塞 3 n
+脑梗死 3 n
+脑死 3 n
+脑死亡 25 n
+脑水肿 3 n
+脑汁 6 n
+脑泡 3 n
+脑波 6 n
+脑浆 120 n
+脑海 580 n
+脑海中 3 l
+脑涨 3 v
+脑液 3 n
+脑溢血 22 n
+脑满肠肥 14 n
+脑炎 95 n
+脑片 3 n
+脑瓜 42 n
+脑瓜儿 15 n
+脑瓜子 28 n
+脑电图 83 n
+脑电波 11 n
+脑病 40 n
+脑瘤 28 n
+脑瘫 14 n
+脑白金 3 n
+脑盖骨 3 n
+脑磷脂 3 n
+脑神经 63 n
+脑科 34 n
+脑科专家 3 l
+脑科学 5 n
+脑积水 14 n
+脑空 3 n
+脑筋 264 n
+脑组织 57 n
+脑细胞 47 n
+脑缺氧 3 n
+脑缺血 3 n
+脑羟脂酸 3 n
+脑肠肽 3 n
+脑肿瘤 15 l
+脑胀 29 l
+脑脊液 52 n
+脑脊膜 3 n
+脑脊髓 3 n
+脑膜 40 n
+脑膜炎 66 n
+脑膜瘤 3 n
+脑苷脂 3 n
+脑萎缩 3 n
+脑血栓 31 n
+脑血管 80 n
+脑血管病 28 n
+脑衰蛋白 3 l
+脑袋 2265 n
+脑袋儿 3 n
+脑袋瓜 22 n
+脑袋瓜儿 3 n
+脑袋瓜子 24 n
+脑贫血 3 l
+脑部 97 n
+脑量 20 n
+脑门 242 n
+脑门儿 23 n
+脑门子 51 n
+脑门穴 3 n
+脑际 39 n
+脑震荡 26 l
+脑颅 27 n
+脑髓 40 n
+脒 18 g
+脓 296 n
+脓仲 3 n
+脓包 133 n
+脓毒 4 n
+脓毒症 2 n
+脓水 23 n
+脓汁 3 n
+脓液 50 n
+脓疮 9 n
+脓疱 16 n
+脓病 3 n
+脓痰 3 n
+脓肿 125 n
+脓胞 3 n
+脓胸 3 n
+脓血 63 n
+脔 10 g
+脖 320 n
+脖子 1810 n
+脖子酸 3 n
+脖领子 4 n
+脖颈 170 n
+脖颈儿 3 n
+脖颈子 3 n
+脘 77 g
+脚 6457 n
+脚上 3 f
+脚下 1566 f
+脚不沾地 18 i
+脚不点地 7 i
+脚丫 39 n
+脚丫子 25 n
+脚伤 41 n
+脚位 10 n
+脚儿 3 n
+脚凳 4 n
+脚制动器 3 n
+脚刹 3 n
+脚力 98 n
+脚动 2 n
+脚劲 15 n
+脚印 194 n
+脚印儿 2 n
+脚印网 3 n
+脚后跟 56 n
+脚型 2 n
+脚垫 8 n
+脚夫 92 n
+脚尖 116 n
+脚尖儿 6 n
+脚底 154 n
+脚底抹油 3 i
+脚底板 21 n
+脚底板儿 3 n
+脚底流脓 3 n
+脚底生风 3 n
+脚形 3 n
+脚心 36 n
+脚心朝天 3 i
+脚忙手乱 3 i
+脚手 3 n
+脚手架 27 n
+脚扣 3 n
+脚扭伤 3 i
+脚指头 8 n
+脚指甲 3 n
+脚掌 68 n
+脚掌心 3 n
+脚数 6 n
+脚本 1136 n
+脚本语言 3 n
+脚板 56 n
+脚架 35 n
+脚步 2093 n
+脚步声 705 n
+脚气 36 n
+脚气病 3 n
+脚法 21 n
+脚注 8 v
+脚灯 3 n
+脚炉 7 n
+脚爪 24 n
+脚状 3 n
+脚瓜 3 n
+脚痛 3 n
+脚痛医脚 11 i
+脚癣 4 n
+脚登子 3 n
+脚盆 38 n
+脚程 3 n
+脚窝 5 n
+脚背 64 n
+脚胫 3 i
+脚脖子 15 n
+脚腕 17 n
+脚腕子 6 n
+脚臭 3 n
+脚色 134 n
+脚行 14 n
+脚趾 103 n
+脚趾头 15 n
+脚趾尖 3 n
+脚趾甲 3 n
+脚趾细长 3 n
+脚跟 260 n
+脚跟脚 3 n
+脚踏 245 v
+脚踏两只船 12 i
+脚踏两船 3 n
+脚踏实地 119 i
+脚踏式 2 n
+脚踏板 3 n
+脚踏船 3 n
+脚踏车 45 n
+脚踝 112 n
+脚踝部 2 n
+脚踢 3 i
+脚踵 3 n
+脚蹬 88 n
+脚蹬子 3 n
+脚蹼 13 n
+脚轮 3 n
+脚迹 6 n
+脚部 19 f
+脚钉 2 n
+脚钱 28 n
+脚铃 3 n
+脚链 3 n
+脚镣 57 n
+脚镣手铐 3 n
+脚镯 6 n
+脚门 7 n
+脚面 32 f
+脚韵 3 n
+脚骨 16 n
+脚高步低 3 n
+脚麻 3 n
+脞 7 g
+脣亡齿寒 3 n
+脣吻 3 v
+脣形 3 vn
+脣枪舌剑 3 v
+脣红齿白 3 nz
+脣脂 3 v
+脣膏 3 nz
+脣舌 3 v
+脣齿 3 v
+脣齿相依 3 nz
+脥 12 zg
+脧 2 zg
+脩 10 n
+脩辞立诚 3 vn
+脬 4 x
+脯 51 g
+脯干 3 n
+脯氨 3 n
+脯氨酸 7 n
+脱 3778 v
+脱下 3 v
+脱下来 3 v
+脱不了 3 v
+脱不了身 14 i
+脱不开 3 v
+脱乙烷 3 nz
+脱亚入 4 v
+脱亚论 2 nr
+脱产 82 v
+脱产学习 3 n
+脱产干部 3 n
+脱产班 3 n
+脱位 76 v
+脱俗 45 n
+脱光 72 v
+脱光光 3 nr
+脱兔 3 n
+脱党 21 n
+脱内裤 3 n
+脱出 113 v
+脱出症 3 i
+脱出重围 3 n
+脱列伯 2 nr
+脱到 3 v
+脱剑膝 4 nr
+脱勒哈 2 nr
+脱卜察 2 nr
+脱卤 3 n
+脱卸 9 v
+脱去 3 v
+脱发 104 v
+脱发剂 3 n
+脱发白发 3 i
+脱口 126 vn
+脱口成章 3 i
+脱口秀 13 i
+脱口而出 199 i
+脱售 3 v
+脱困 114 v
+脱坯 5 n
+脱垂 27 v
+脱壳 83 n
+脱壳机 3 n
+脱壳金蝉 3 l
+脱天漏网 3 i
+脱失 4 v
+脱字 3 v
+脱小龙 2 nr
+脱尽 3 v
+脱屣 3 n
+脱岗 3 v
+脱帽 25 v
+脱帽致敬 3 l
+脱开 19 v
+脱得 3 v
+脱思麻 2 i
+脱手 442 v
+脱手弹丸 3 nz
+脱扣 3 v
+脱扣器 2 n
+脱掉 142 v
+脱支酶 3 n
+脱敏 21 nr
+脱春化 3 nr
+脱期 3 vn
+脱木质化 3 n
+脱机 7 n
+脱机版 3 v
+脱机设备 3 i
+脱来脱去 3 i
+脱档 3 v
+脱榫 2 v
+脱模 5 n
+脱模剂 3 n
+脱毒 3 v
+脱毛 49 n
+脱毛剂 3 n
+脱毛膏 3 i
+脱气 8 v
+脱气装置 3 i
+脱氢 79 v
+脱氢酶 6 nz
+脱氧 73 v
+脱氧剂 9 n
+脱氧塔 3 n
+脱氧尿苷 3 nz
+脱氧核糖 3 n
+脱氧核糖核酸 58 n
+脱氧核苷 3 n
+脱氧糖 3 n
+脱氧肌苷 3 n
+脱氧胞苷 3 n
+脱氧腺苷 3 n
+脱氧鸟苷 3 n
+脱氨 3 n
+脱氨酶 2 n
+脱氯作用 3 n
+脱氰基 3 nz
+脱水 239 v
+脱水剂 11 n
+脱水器 3 n
+脱水机 3 n
+脱水蔬菜 3 nz
+脱水酶 3 n
+脱泡 3 v
+脱涩 4 v
+脱涩法 2 nr
+脱漆剂 3 nz
+脱漏 14 v
+脱烷基化 3 nz
+脱焊 3 vn
+脱熲而出 3 v
+脱燃素 4 n
+脱狱 3 v
+脱班 3 v
+脱白挂绿 3 i
+脱皮 41 n
+脱皮机 3 n
+脱盐 10 n
+脱盲 4 v
+脱矿质水 3 n
+脱砂压力 3 n
+脱硅 2 n
+脱硫 21 v
+脱硫剂 3 nz
+脱碳 6 n
+脱磺酸基 3 nz
+脱离 1706 v
+脱离关系 3 n
+脱离危险 3 i
+脱离实际 3 i
+脱离现实 3 i
+脱离生活 3 i
+脱离群众 3 i
+脱离苦海 3 i
+脱离险境 3 n
+脱程英 2 nr
+脱稿 60 v
+脱空 4 v
+脱笔 3 v
+脱笼 3 v
+脱籍 3 n
+脱粒 30 n
+脱粒机 18 n
+脱糖 3 v
+脱缰 14 v
+脱缰之马 2 i
+脱缰野马 3 i
+脱网 3 v
+脱罪 3 v
+脱羧 3 n
+脱羧卤化 3 n
+脱羧硝化 3 n
+脱羧酶 3 n
+脱羽 3 nr
+脱职 3 v
+脱肛 26 n
+脱肠 3 v
+脱胎 72 v
+脱胎换骨 65 i
+脱胶 7 n
+脱脂 19 n
+脱脂乳 3 n
+脱脂剂 3 n
+脱脂奶 3 n
+脱脂奶粉 3 n
+脱脂棉 2 n
+脱脱 3 v
+脱脱禾 2 nr
+脱腥 3 n
+脱腺苷化 3 n
+脱臭 4 v
+脱臭剂 3 n
+脱臼 27 v
+脱色 19 n
+脱色剂 4 n
+脱节 104 v
+脱芯克 2 nr
+脱落 464 v
+脱落下来 3 i
+脱落酸 16 n
+脱蜡 15 v
+脱衣 3 v
+脱衣女 3 i
+脱衣女郎 3 n
+脱衣服 3 i
+脱衣秀 3 i
+脱衣舞 13 i
+脱衣舞女 3 i
+脱衣舞娘 3 n
+脱衣舞孃 3 nr
+脱表姊 2 nr
+脱袍退位 3 i
+脱裤子 3 n
+脱误 8 v
+脱货 3 v
+脱贫 165 v
+脱贫率 2 l
+脱贫致富 135 l
+脱起 3 v
+脱起来 3 v
+脱身 762 v
+脱身而出 3 i
+脱轨 10 v
+脱轨而出 3 l
+脱辅酶 3 nr
+脱过 3 v
+脱逃 64 v
+脱酸 3 n
+脱钩 41 v
+脱钮飞 2 nr
+脱销 14 v
+脱队 3 n
+脱阻抑 3 nz
+脱除 13 v
+脱险 224 n
+脱靴 3 n
+脱靶 17 v
+脱鞋 3 v
+脱颖 3 nr
+脱颖出 2 i
+脱颖囊锥 3 i
+脱颖而出 215 i
+脱饱和 3 nz
+脱饱和酶 3 nz
+脱骨 3 n
+脱髓鞘 13 n
+脲 62 nz
+脲受体 3 nz
+脲酶 3 nz
+脲醛 12 nz
+脲醛树脂 3 nz
+脸 10566 n
+脸上 8188 s
+脸上抹黑 3 l
+脸上无光 59 l
+脸儿 93 n
+脸厚 3 n
+脸型 30 n
+脸嫩 3 a
+脸子 31 n
+脸孔 350 n
+脸容 28 n
+脸带笑容 3 n
+脸庞 245 n
+脸形 15 n
+脸憨皮厚 3 v
+脸无人色 17 l
+脸水 51 n
+脸皮 235 n
+脸皮厚 20 l
+脸皮嫩 2 l
+脸皮子 7 n
+脸皮薄 11 l
+脸盆 148 n
+脸盆架 6 n
+脸盘 24 n
+脸盘儿 7 n
+脸相 18 n
+脸硬 3 a
+脸红 417 n
+脸红筋暴 3 i
+脸红筋涨 3 l
+脸红红 3 l
+脸红耳热 2 n
+脸红耳赤 7 n
+脸红脖子 3 n
+脸红脖子粗 13 l
+脸罩 3 n
+脸肿 3 n
+脸膛 87 n
+脸膛儿 3 n
+脸色 3458 n
+脸色红润 3 n
+脸色苍白 3 l
+脸色铁青 3 n
+脸蛋 227 n
+脸蛋儿 42 n
+脸谱 168 n
+脸谱化 6 n
+脸软 4 n
+脸软心慈 3 l
+脸部 158 n
+脸部皮肤 3 n
+脸难看 3 l
+脸青鼻肿 3 l
+脸面 321 n
+脸面无光 3 l
+脸颊 577 n
+脸额 3 n
+脸黄肌瘦 3 n
+脾 895 n
+脾寒 3 n
+脾性 79 n
+脾气 1559 n
+脾气坏 3 n
+脾气好 3 n
+脾炎 3 n
+脾肿大 3 n
+脾胃 241 n
+脾胃论 3 n
+脾脏 61 n
+脾虚 33 n
+腂 2 zg
+腄 14 zg
+腆 65 v
+腈 55 n
+腈纶 41 n
+腉 21 zg
+腊 635 t
+腊八 60 t
+腊八粥 50 n
+腊八节 4 t
+腊味 8 n
+腊子口 3 n
+腊尽春回 3 t
+腊戍 7 n
+腊斯克 3 n
+腊日 3 t
+腊月 208 t
+腊月初 12 t
+腊染画 3 n
+腊梅 88 n
+腊玛古猿 23 n
+腊笔 3 n
+腊纸 3 n
+腊肉 601 n
+腊肠 25 n
+腊肠犬 3 n
+腊肠狗 3 n
+腊质 3 n
+腊雪 3 n
+腊鱼 9 n
+腊鸡 3 n
+腊鸭 3 n
+腊黄 5 n
+腊鼓 3 n
+腊鼓频传 3 n
+腋 206 ng
+腋下 185 s
+腋毛 9 n
+腋生 3 n
+腋窝 71 n
+腋窝下 3 n
+腋臭 5 n
+腋芽 10 n
+腌 452 v
+腌制 133 v
+腌制品 3 n
+腌成 3 v
+腌汁 3 n
+腌泡汁 3 nz
+腌浸 3 v
+腌渍 23 n
+腌渍保藏 3 n
+腌渍品 3 n
+腌渍物 3 n
+腌猪肉 3 n
+腌肉 23 n
+腌腊 7 nz
+腌臜 3 v
+腌臢 3 v
+腌菜 38 n
+腌起来 3 v
+腌过 3 v
+腌酱瓜 3 n
+腌鱼 12 n
+腌鱼肉 3 n
+腐 534 a
+腐乳 26 nz
+腐乳瓶 3 n
+腐儒 21 n
+腐刑 3 v
+腐化 162 v
+腐化堕落 3 z
+腐坏 61 v
+腐尸 3 n
+腐干 2 n
+腐心 3 v
+腐恶 3 a
+腐拐 3 v
+腐旧 3 a
+腐朽 403 a
+腐朽思想 3 n
+腐朽性 8 n
+腐朽没落 3 n
+腐植土 3 n
+腐植质 3 n
+腐植酸 8 n
+腐殖 18 v
+腐殖土 5 n
+腐殖质 92 n
+腐殖酸 8 n
+腐气 3 an
+腐烂 383 a
+腐烂不堪 3 v
+腐烂变质 3 n
+腐熟 19 a
+腐生 3 an
+腐生物 3 n
+腐竹 7 n
+腐肉 40 n
+腐胺 3 nz
+腐臭 48 n
+腐臭味 3 n
+腐蚀 733 v
+腐蚀剂 16 n
+腐蚀化 3 n
+腐蚀性 90 n
+腐蚀深度 3 n
+腐蚀电流 3 n
+腐蚀药 3 n
+腐蚁丛生 3 n
+腐败 2377 an
+腐败体系 3 n
+腐败分子 3 n
+腐败无能 3 n
+腐败案 3 n
+腐败现象 3 n
+腐败透顶 3 n
+腐败问题 3 n
+腐霉素 3 n
+腑 571 g
+腓 79 nrt
+腓利 2 nrt
+腓力 203 nz
+腓力二世 3 nz
+腓尼基 87 nrt
+腓尼基人 3 nrt
+腓特烈 75 ns
+腓特烈一世 21 nrt
+腓肠肌 5 n
+腓骨 10 n
+腔 1188 q
+腔上囊 21 n
+腔体 3 n
+腔儿 3 n
+腔壁 3 n
+腔子 3 n
+腔肠 7 n
+腔肠动物 32 l
+腔调 138 n
+腔道 3 n
+腔骨 3 n
+腕 472 ng
+腕上 120 s
+腕儿 2 n
+腕关节 3 n
+腕力 15 n
+腕套 3 nz
+腕子 21 n
+腕尺 3 n
+腕带 3 n
+腕表 7 n
+腕足 59 n
+腕足动物 3 n
+腕踝针 3 n
+腕部 18 n
+腕骨 40 n
+腗 4 zg
+腘 14 zg
+腙 12 g
+腚 36 zg
+腝 30 zg
+腠 14 n
+腠理 21 n
+腡 9 zg
+腥 419 a
+腥味 57 n
+腥味儿 3 n
+腥气 65 n
+腥污 3 n
+腥红 3 n
+腥羶 3 n
+腥腥 3 a
+腥腻 3 a
+腥膻 23 a
+腥臊 5 a
+腥臭 105 a
+腥臭味 7 i
+腥闻在上 3 i
+腥风血雨 47 i
+腥风醎雨 3 n
+腥风雪雨 3 i
+腥黑穗病 3 n
+腦 3 zg
+腧 25 n
+腧穴 174 n
+腩 14 x
+腫 6 zg
+腭 120 n
+腭凹 3 n
+腭咽闭合 3 n
+腭杆 3 n
+腭皱 3 n
+腭腺 3 n
+腭裂 8 n
+腭隆凸 3 n
+腭面 3 n
+腮 515 n
+腮壳 3 n
+腮帮 44 n
+腮帮子 47 n
+腮红 6 n
+腮腺 29 n
+腮腺炎 18 n
+腮须 3 n
+腮颊 9 n
+腰 3532 n
+腰伤 14 n
+腰刀 157 n
+腰力 3 n
+腰包 113 n
+腰围 47 n
+腰墙 3 n
+腰子 21 n
+腰巾 3 n
+腰布 3 n
+腰带 380 n
+腰弯 3 n
+腰斩 68 v
+腰杆 70 n
+腰杆儿 5 n
+腰杆子 18 n
+腰板 66 n
+腰板儿 3 n
+腰果 30 n
+腰果仁 3 n
+腰椎 75 n
+腰椎病 3 n
+腰椎间盘 21 n
+腰椎骨 2 l
+腰牌 36 n
+腰疼 3 v
+腰痛 3 n
+腰痛穴 3 n
+腰眼 42 n
+腰站 14 n
+腰缠 3 n
+腰缠万贯 23 i
+腰肌劳损 9 l
+腰肢 59 n
+腰肥体壮 3 i
+腰背 3 n
+腰背痛 3 n
+腰腹部 3 n
+腰腿疼 3 l
+腰腿痛 19 n
+腰花 2 n
+腰袋 3 n
+腰身 85 n
+腰通宵 3 n
+腰部 170 n
+腰酸 3 n
+腰酸背疼 10 l
+腰酸背痛 29 n
+腰酸背胀 3 l
+腰酸腿痛 4 n
+腰金拖紫 3 n
+腰金衣紫 3 n
+腰锅 3 n
+腰门 3 n
+腰间 1025 n
+腰间盘 3 n
+腰阳关 3 n
+腰际 3 n
+腰饰 3 n
+腰马合一 3 l
+腰骨 3 n
+腰骶部 21 n
+腰鼓 42 n
+腰鼓兄弟 3 n
+腰鼓舞 3 i
+腰鼓队 8 n
+腱 19 n
+腱子 3 n
+腱鞘 8 n
+腱鞘炎 13 n
+腴 19 ag
+腷 12 zg
+腹 1601 n
+腹中 578 s
+腹中兵甲 3 n
+腹内 82 s
+腹哀 3 v
+腹囊 3 n
+腹围 5 n
+腹地 581 n
+腹壁 25 n
+腹带 2 n
+腹心 60 n
+腹心之患 3 i
+腹心之疾 3 i
+腹心区 3 n
+腹心相照 3 i
+腹敌 3 n
+腹有鳞甲 3 i
+腹板 17 n
+腹果 3 n
+腹根 3 n
+腹案 3 n
+腹水 82 n
+腹水瘤 3 n
+腹沟 3 n
+腹泻 356 v
+腹泻药 3 n
+腹点 3 n
+腹热心煎 3 n
+腹热肠荒 3 n
+腹痛 268 n
+腹稿 30 n
+腹笥便便 3 z
+腹结 3 v
+腹肌 26 n
+腹股沟 39 n
+腹胀 171 v
+腹胀满 3 n
+腹胀痛 3 n
+腹背 3 n
+腹背之毛 3 i
+腹背受敌 72 i
+腹腔 144 n
+腹腔镜 59 n
+腹膜 89 n
+腹膜炎 3 n
+腹菌目 3 n
+腹语 3 n
+腹语术者 3 n
+腹诽 17 v
+腹诽心谤 3 vn
+腹足 31 v
+腹足动物 3 n
+腹足类 14 n
+腹载五车 3 i
+腹通谷 3 n
+腹部 1424 n
+腹针 3 n
+腹非心谤 3 n
+腹面 206 n
+腹饱万言 3 i
+腹鳍 133 n
+腹鸣 3 v
+腺 492 n
+腺体 170 n
+腺嘌呤 10 n
+腺垂体 3 n
+腺性唇炎 3 n
+腺毛 20 n
+腺状 3 n
+腺病毒 3 n
+腺瘤 365 n
+腺癌 37 n
+腺细胞 21 n
+腺苷 44 n
+腺苷酸 9 n
+腺苷酸环化酶 3 n
+腺鲻鼢鲫 3 i
+腻 668 v
+腻友 3 n
+腻味 25 v
+腻在一起 3 v
+腻子 3 n
+腻子粉 3 n
+腻歪 12 z
+腻滑 3 v
+腻烦 42 a
+腻着 3 v
+腻胃 3 v
+腻腻歪歪 3 z
+腻虫 3 v
+腼 14 a
+腼然 3 a
+腼脸 3 a
+腼腆 187 a
+腼颜事仇 3 vn
+腼颜事敌 3 vn
+腼颜人世 3 v
+腼颜天壤 3 v
+腽肭兽 3 v
+腽肭脐 3 n
+腾 1264 zg
+腾一雷 3 nr
+腾云 3 ns
+腾云致 2 i
+腾云驾雾 75 i
+腾冲 53 nr
+腾冲县 8 nr
+腾出 58 v
+腾出来 3 l
+腾升 3 v
+腾华 2 nz
+腾地 3 ns
+腾声飞实 3 i
+腾开 3 v
+腾房 3 v
+腾挪 70 v
+腾格尔 3 nr
+腾格里 28 ns
+腾格里山 3 ns
+腾格里沙漠 22 ns
+腾欢 3 v
+腾涌 3 v
+腾焰飞芒 3 i
+腾砰腾 2 nr
+腾空 151 v
+腾空而起 83 i
+腾空而过 3 l
+腾腾 3 v
+腾腾兀兀 3 nr
+腾腾腾 22 i
+腾蛟起凤 3 nr
+腾让 3 v
+腾讯 98 nz
+腾讯社区 3 n
+腾讯网 3 nz
+腾讯通 3 nz
+腾贵 3 nr
+腾起 111 v
+腾越 21 v
+腾跃 35 v
+腾达 21 ns
+腾达飞黄 3 nr
+腾退 3 v
+腾飞 91 nr
+腾高 3 v
+腾龙 7 ns
+腾龙洞 259 ns
+腿 5139 n
+腿伤 51 n
+腿力 3 n
+腿勤 2 n
+腿子 3 n
+腿折 3 n
+腿抽筋 3 v
+腿毛 3 n
+腿法 25 n
+腿疼 3 a
+腿短 3 n
+腿肉 3 n
+腿肚 3 n
+腿肚子 36 n
+腿脚 137 n
+腿腕子 3 n
+腿走路 3 n
+腿软 3 n
+腿部 88 n
+腿酸 3 n
+腿骨 60 n
+膀 109 n
+膀大腰圆 14 l
+膀子 146 n
+膀粗腰圆 3 l
+膀胱 316 n
+膀胱炎 15 n
+膀胱癌 39 n
+膀胱经 3 n
+膀臂 39 n
+膀阔腰圆 3 l
+膂 13 n
+膂力 129 n
+膂力过人 3 n
+膅 3 zg
+膆 2 zg
+膈 82 n
+膈关 3 n
+膈膜 3 n
+膊 195 g
+膌 4 zg
+膏 396 n
+膏丸 3 n
+膏乳 3 n
+膏剂 21 n
+膏唇岐舌 3 v
+膏唇拭舌 3 v
+膏唇试舌 3 i
+膏唇贩舌 3 n
+膏土 3 n
+膏子 3 n
+膏梁 3 n
+膏梁子弟 3 n
+膏梁锦绣 3 n
+膏梁锦锈 3 n
+膏汤 3 n
+膏沃 3 i
+膏油 3 n
+膏泽 3 n
+膏泽脂香 3 n
+膏火 3 n
+膏火之费 3 i
+膏火自煎 3 n
+膏烛 3 n
+膏状 18 n
+膏盲 16 n
+膏盲之病 3 n
+膏粱 15 n
+膏粱子弟 4 n
+膏粱年少 3 i
+膏粱锦绣 3 n
+膏肓 19 n
+膏肓之疾 3 nr
+膏腴 19 n
+膏腴之地 3 v
+膏腴子弟 3 nr
+膏腴贵游 3 ns
+膏药 197 n
+膏药旗 9 n
+膏蟹 2 n
+膏血 3 n
+膏车秣马 3 i
+膑 16 g
+膒 4 zg
+膘 59 ng
+膘情 3 n
+膘满肠肥 3 i
+膘肥体壮 10 i
+膘肥体胖 3 i
+膘肥肉厚 3 i
+膙 2 zg
+膙子 3 v
+膛 432 ng
+膛线 29 n
+膜 1964 n
+膜分离 3 n
+膜式 5 n
+膜技术 3 n
+膜拜 71 v
+膜整合锥 3 nz
+膜桥蛋白 3 nz
+膜法 3 n
+膜消化 3 n
+膜炎 3 n
+膜片 9 n
+膜片形成 3 nz
+膜片钳 3 nz
+膜状 3 n
+膜电位 3 n
+膜电容 3 n
+膜电导 3 n
+膜皮 3 n
+膜盒 2 n
+膜突蛋白 3 n
+膜结构 3 n
+膜翅目 33 n
+膜联蛋白 3 n
+膜蛋白 3 n
+膜过滤 3 v
+膜骨粉 3 n
+膝 908 ng
+膝上型 3 n
+膝下 85 n
+膝伤 7 n
+膝关 3 n
+膝关节 44 n
+膝垫 3 n
+膝头 75 n
+膝弯 44 n
+膝状弯曲 3 n
+膝痒搔背 3 n
+膝盖 459 n
+膝盖骨 7 n
+膝眼 3 n
+膝窝 3 n
+膝糕 3 n
+膝行 3 n
+膝行匍伏 3 vn
+膝行时步 3 n
+膝行而前 3 n
+膝行肘步 3 vn
+膝行蒲伏 3 vn
+膝语蛇行 3 n
+膝踝 3 n
+膝部 10 n
+膝阳关 3 n
+膥 339 zg
+膦 17 g
+膦羧乙酸 3 nz
+膦酸酯 3 nz
+膨 349 v
+膨体 3 n
+膨体纱 3 n
+膨体绒线 3 n
+膨出 53 v
+膨化 26 v
+膨化机 3 l
+膨化食品 3 l
+膨大 112 v
+膨松 11 v
+膨松剂 48 n
+膨润土 36 n
+膨润土罐 3 n
+膨涨 3 v
+膨胀 1353 v
+膨胀剂 3 nz
+膨胀性 5 l
+膨胀机 6 l
+膨胀水泥 3 l
+膨胀水箱 3 n
+膨胀率 3 n
+膨胀系数 36 l
+膨胀节 3 l
+膨胀螺栓 3 n
+膨胀起来 3 l
+膨胀阀 3 l
+膭 8 zg
+膲 49 zg
+膳 756 zg
+膳堂 3 n
+膳夫 3 n
+膳宿 10 n
+膳宿费 3 n
+膳宿费用 3 n
+膳房 3 n
+膳羞 3 n
+膳费 6 n
+膳食 242 n
+膳食费 2 n
+膳食费用 3 n
+膴 2 zg
+膵 38 zg
+膺 123 vg
+膺任 3 nr
+膺品 3 nr
+膺箓受图 3 v
+膺选 3 nr
+膻 152 a
+膻中 3 n
+膻味 12 n
+膻气 8 n
+臀 401 n
+臀围 5 n
+臀尖 11 n
+臀疣 3 n
+臀部 223 n
+臀鳍 179 n
+臁 137 g
+臂 1688 n
+臂丛 4 n
+臂内倒位 3 n
+臂力 43 n
+臂助 3 n
+臂弯 88 n
+臂旁核 3 n
+臂有四肘 3 n
+臂板 3 n
+臂架 10 n
+臂章 35 n
+臂腕 6 n
+臂膀 165 n
+臂膊 30 n
+臂膞 3 n
+臂臑 3 n
+臂部 12 n
+臂长 23 n
+臂间倒位 3 n
+臃 61 zg
+臃肿 105 a
+臆 17 v
+臆中 3 v
+臆度 3 n
+臆想 44 v
+臆断 11 v
+臆测 31 v
+臆见 3 v
+臆说 3 v
+臆造 24 v
+臇 7 zg
+臊 133 a
+臊子 45 n
+臊气 10 n
+臌 3 n
+臌胀 3 n
+臑 44 zg
+臑会 3 vn
+臜 15 zg
+臞 8 zg
+臡 2 zg
+臢 29 zg
+臣 5666 n
+臣仆 12 n
+臣仕 3 n
+臣僚 79 n
+臣公 3 n
+臣妾 193 n
+臣子 231 n
+臣心如水 3 n
+臣服 169 n
+臣服于 3 n
+臣服在 3 n
+臣民 891 n
+臣门如市 3 n
+臧 140 nr
+臧亦嘉 13 nr
+臧传引 2 nr
+臧克家 12 nrfg
+臧否 8 v
+臧否人物 9 n
+臧天朔 22 nr
+臧威霆 12 nr
+臧家桥 3 nr
+臧式毅 2 nr
+臧懋循 3 nr
+臧明华 8 nr
+臧晋叔 3 nr
+臧海利 14 nr
+臧爱亲 25 nr
+臧穀亡羊 3 n
+臧谷亡羊 3 n
+臧霸渡 2 nr
+臧鸿钢 3 nr
+自 33152 p
+自上到下 3 l
+自上而下 139 l
+自下到上 3 l
+自下而上 113 l
+自不待言 24 l
+自不必说 70 l
+自不量力 14 l
+自业自得 3 l
+自个 215 r
+自个儿 225 r
+自为 3 d
+自为阶级 3 l
+自主 2605 v
+自主化 5 n
+自主国 3 n
+自主性 73 n
+自主权 243 n
+自主神经 45 l
+自主经营 27 n
+自主经营权 2 n
+自主质 3 n
+自主运动 3 l
+自举 3 r
+自乐 28 a
+自乘 3 nz
+自习 34 v
+自习室 7 n
+自习时间 3 n
+自习曲 3 n
+自习课 6 n
+自书 3 r
+自了 3 p
+自予 3 v
+自交 22 v
+自交系 5 n
+自产 3 l
+自产自销 9 l
+自从 2476 p
+自付 3 v
+自代 3 n
+自以 3 d
+自以为得计 7 l
+自以为是 117 l
+自以为非 3 i
+自仪 4 n
+自任 3 v
+自伐 3 n
+自会 3 r
+自会在 3 l
+自传 125 vn
+自传体 38 n
+自传式 3 l
+自伤 3 v
+自住 3 v
+自住型 3 n
+自体 41 n
+自体受精 3 l
+自作 3 vn
+自作主张 66 n
+自作多情 29 l
+自作孽 3 n
+自作聪明 52 l
+自作自受 56 l
+自作解人 3 l
+自作门户 3 l
+自供 6 v
+自供状 3 l
+自侦工作 3 n
+自侮 3 v
+自便 105 d
+自保 174 vn
+自信 1316 v
+自信不疑 3 l
+自信力 7 l
+自信心 154 l
+自修 67 v
+自修室 3 n
+自修法 3 n
+自修课 3 n
+自做主张 6 l
+自做自受 3 i
+自傲 70 a
+自养 38 v
+自内心 3 n
+自内而外 3 l
+自决 65 v
+自决权 25 l
+自况 3 n
+自净 3 a
+自净作用 5 l
+自准直 3 d
+自凝树脂 3 n
+自出一家 3 l
+自出心裁 3 i
+自出新裁 3 i
+自出机杼 3 i
+自出机轴 3 n
+自分 3 d
+自分解 3 l
+自刎 241 v
+自创 3 n
+自利 3 a
+自到 3 v
+自制 329 v
+自制力 34 l
+自刽以下 3 nr
+自力 38 n
+自力式 3 l
+自力救济 3 l
+自力更生 258 i
+自力霉素 3 n
+自办 98 v
+自办式 3 l
+自加压力 3 n
+自动 2935 vn
+自动仪器 3 l
+自动伞 3 n
+自动关机 3 l
+自动化 956 l
+自动化系 5 l
+自动合成 3 l
+自动售货机 2 l
+自动增益 3 l
+自动应答 3 l
+自动开关 3 l
+自动开机 3 l
+自动式 3 l
+自动性 4 n
+自动扶梯 3 n
+自动挡 3 i
+自动控制 3 n
+自动播放 3 i
+自动更新 3 i
+自动机 72 n
+自动机车 3 l
+自动枪 13 l
+自动档 3 b
+自动检测 3 n
+自动检索 3 n
+自动楼梯 3 n
+自动步枪 262 l
+自动武器 3 l
+自动气锁 3 n
+自动波 3 n
+自动测序 3 n
+自动测试 3 n
+自动滴定 3 l
+自动现象 3 l
+自动生产 3 l
+自动电话 3 l
+自动线 18 l
+自动绘图 3 i
+自动编码 3 l
+自动自发 3 i
+自动装弹机 15 l
+自动装置 3 n
+自动警报 3 n
+自动记录 3 n
+自动识别 3 n
+自动词 3 n
+自动调谐 3 i
+自动调车 3 l
+自动车 10 n
+自动进样 3 l
+自动重拨 3 i
+自动钢琴 3 n
+自动铅笔 3 n
+自动门 3 n
+自动闭塞 3 n
+自动隐藏 3 l
+自助 213 v
+自助助人 3 v
+自助式 7 l
+自助游 3 v
+自助餐 25 v
+自助餐厅 3 n
+自励 27 v
+自勉 28 a
+自卑 190 n
+自卑心 2 i
+自卑心理 3 i
+自卑感 41 n
+自卖 3 v
+自卖自夸 4 l
+自卫 631 v
+自卫军 103 n
+自卫器 3 n
+自卫战争 3 nz
+自卫权 10 n
+自卫还击 3 l
+自卫队 536 n
+自即日起 3 i
+自卸 9 v
+自卸船 3 n
+自卸车 4 n
+自压 3 v
+自压式 3 n
+自反 3 l
+自发 556 v
+自发势力 3 l
+自发发射 3 l
+自发性 42 n
+自发电位 3 n
+自发终止 3 l
+自发辐射 3 nz
+自发过程 3 l
+自取 86 v
+自取其咎 3 i
+自取其祸 3 i
+自取其辱 30 i
+自取灭亡 24 i
+自变数 2 l
+自变量 38 l
+自叙 24 v
+自古 1022 d
+自古以来 392 l
+自古迄今 3 v
+自右而左 3 l
+自叹不如 3 l
+自叹弗如 7 l
+自各儿 3 l
+自同态 3 l
+自同构 8 n
+自启动 3 l
+自吸泵 3 n
+自吹 3 v
+自吹自捧 3 i
+自吹自擂 36 i
+自告奋勇 112 i
+自命 54 vn
+自命不凡 22 l
+自命为 3 l
+自命清高 3 l
+自咎 12 v
+自唱 3 v
+自喷 3 v
+自喷井 3 i
+自喷式 3 l
+自喻 3 n
+自嘲 122 v
+自因 3 n
+自圆其说 65 l
+自在 73 d
+自在不成人 2 l
+自在阶级 3 l
+自地自建 3 ns
+自场 3 n
+自坏长城 3 n
+自填 3 v
+自处 3 r
+自备 74 v
+自备井 3 n
+自备午餐 3 n
+自备晚餐 3 l
+自备车 3 n
+自外 3 l
+自外而内 3 l
+自大 132 a
+自大狂 128 l
+自夸 64 v
+自夸地 3 i
+自奉 3 v
+自奉甚俭 3 i
+自好 3 d
+自如 456 r
+自始 3 v
+自始自终 2 i
+自始至终 175 l
+自娱 83 a
+自娱娱人 3 n
+自娱性 8 n
+自娱自乐 3 n
+自媒自衒 3 nt
+自存 3 v
+自学 787 n
+自学成功 3 l
+自学成才 37 l
+自学教材 3 n
+自学方法 3 l
+自学法 3 n
+自学系统 3 l
+自学考 3 l
+自学者 3 n
+自学能力 3 l
+自学辅导 3 n
+自守 3 v
+自定 3 d
+自定义 13 l
+自定义词 3 n
+自审 6 v
+自宫 3 n
+自家 839 r
+自家人 94 r
+自家门 11 n
+自寻 3 v
+自寻死路 3 i
+自寻烦恼 26 l
+自寻短见 42 l
+自导 3 n
+自导导弹 3 n
+自导引 3 n
+自导自演 3 n
+自封 46 v
+自封袋 3 n
+自尊 262 v
+自尊心 208 i
+自小 236 d
+自尽 563 d
+自居 294 v
+自展 3 vn
+自崖而反 3 i
+自左而右 3 l
+自己 90933 r
+自己自足 3 i
+自已 263 d
+自带 1130 n
+自幼 1034 d
+自幼儿 16 l
+自序 25 n
+自应 3 v
+自废 3 v
+自建 3 l
+自建厂 3 n
+自建房 3 n
+自弃 3 v
+自弃自暴 3 i
+自弹 3 n
+自弹自唱 3 l
+自强 205 v
+自强不息 70 l
+自强号 3 l
+自当 3 d
+自律 264 n
+自律性 20 n
+自律意识 3 l
+自律细胞 3 n
+自得 122 v
+自得其乐 48 i
+自必 3 d
+自忖 151 v
+自怜 3 v
+自怜自艾 3 i
+自性 32 n
+自怨 3 v
+自怨自艾 29 i
+自恃 191 v
+自恋 35 v
+自恋狂 3 l
+自悲 3 a
+自情不息 3 i
+自惊自怪 3 i
+自惭 3 a
+自惭形秽 58 i
+自惭形迹 3 i
+自愈 49 d
+自感 54 n
+自感应 3 l
+自感系数 3 l
+自愧 3 d
+自愧不如 32 v
+自愧弗如 4 l
+自愿 757 d
+自愿书 3 n
+自愿互利 3 l
+自愿地 3 n
+自愿性 4 n
+自愿者 4 n
+自慰 84 v
+自慰器 3 n
+自慰队 3 n
+自成 1735 v
+自成一体 22 l
+自成一家 53 l
+自成一格 19 l
+自成体系 3 l
+自成景观 3 l
+自我 2817 r
+自我中心 3 l
+自我介绍 3 n
+自我作古 3 l
+自我作故 3 l
+自我保健 3 n
+自我刺激 3 l
+自我剖析 3 l
+自我吹嘘 5 l
+自我嘲解 3 i
+自我安慰 3 i
+自我完善 3 l
+自我实现 3 l
+自我张扬 3 i
+自我意识 3 l
+自我感觉 3 l
+自我批评 214 l
+自我改造 3 l
+自我教育 3 l
+自我暗示 3 i
+自我标榜 10 i
+自我检讨 3 n
+自我概念 3 l
+自我欣赏 3 i
+自我清高 3 l
+自我牺牲 35 l
+自我知觉 3 i
+自我管理 3 l
+自我表现 15 i
+自我解嘲 14 l
+自我认识 3 l
+自我调侃 3 i
+自我调节 3 l
+自我贬低 3 i
+自我鉴定 3 l
+自我陶醉 11 l
+自戒 3 n
+自打 175 p
+自扩散 3 j
+自扫门前 3 i
+自扰 3 v
+自找 39 v
+自找没趣 3 l
+自找苦吃 11 l
+自找麻烦 16 l
+自抑 3 v
+自投 3 v
+自投罗网 56 nz
+自折叠 3 v
+自报 3 r
+自报公议 3 n
+自报家门 12 n
+自拉自唱 3 l
+自拍器 3 l
+自拍图 3 n
+自拍女 3 l
+自拍照 3 l
+自拍网 3 n
+自拍镜 3 l
+自拔 82 n
+自拔无力 3 i
+自拔来归 3 i
+自持 176 v
+自掏腰包 3 v
+自排 3 v
+自掘坟墓 14 n
+自控 68 vn
+自控力 3 n
+自控网 3 nz
+自掺杂 3 z
+自描述 3 n
+自摸 3 d
+自擂自吹 3 v
+自收自支 4 i
+自攻螺钉 3 n
+自放电 3 n
+自救 167 v
+自料 3 n
+自斟 3 i
+自斟自酌 3 i
+自斟自饮 3 i
+自新 3 d
+自新之路 3 l
+自旋 271 v
+自旋守恒 3 i
+自旋磁矩 3 n
+自是 3 d
+自暴家丑 3 i
+自暴自弃 52 i
+自有 1127 v
+自有一套 3 l
+自有主张 3 l
+自有公论 15 l
+自有办法 3 l
+自有妙计 3 i
+自有打算 3 l
+自有率 2 n
+自杀 1183 v
+自杀式 3 l
+自杀性 11 l
+自杀未遂 3 l
+自杀者 12 n
+自杀身亡 3 i
+自来 467 d
+自来水 146 l
+自来水厂 8 n
+自来水笔 35 i
+自来水管 10 l
+自来水龙 3 nz
+自来火 3 l
+自来红 3 l
+自查 64 vn
+自查报告 3 n
+自查自纠 22 l
+自树一帜 3 i
+自核 3 v
+自梳 3 n
+自梳不嫁 3 n
+自检 18 v
+自欺 3 v
+自欺欺人 60 i
+自此 997 r
+自此以后 3 l
+自此刻起 3 l
+自此时起 3 l
+自此而后 3 l
+自残 34 v
+自毁 41 v
+自毁前程 3 l
+自毁长城 3 i
+自比于金 3 l
+自毙 3 v
+自民党 217 nt
+自求 3 v
+自求多福 3 i
+自汗 3 n
+自沉淀 3 l
+自治 3780 v
+自治体 5 n
+自治军 4 n
+自治制 3 n
+自治区 14344 n
+自治县 4055 ns
+自治县委 3 n
+自治州 5667 ns
+自治市 3 n
+自治市长 3 n
+自治旗 14 n
+自治机关 1060 l
+自治权 611 n
+自治法 16 n
+自治洲 3 ns
+自治省 15 ns
+自治领 114 n
+自洁区 3 n
+自洽场 4 n
+自洽性 3 n
+自洽解 3 n
+自派 3 r
+自流 48 n
+自流井 15 n
+自流井区 3 n
+自流平 3 n
+自流水 3 n
+自流灌溉 10 l
+自测 30 vn
+自测试 3 n
+自测题 3 n
+自润滑 3 n
+自渎 3 v
+自溶 2 n
+自溶物 3 l
+自溶现象 3 n
+自溶酶 3 l
+自满 66 a
+自满情绪 3 i
+自演 3 v
+自激振荡 3 i
+自点 3 d
+自点曲 3 v
+自焚 115 v
+自然 20269 d
+自然主义 113 l
+自然产 3 l
+自然人 130 l
+自然保护区 2870 n
+自然光 16 l
+自然免疫 3 l
+自然力 100 l
+自然化 3 l
+自然区划 3 n
+自然历 3 n
+自然史 29 n
+自然哲学 3 nt
+自然地理 3 l
+自然天成 7 l
+自然实验 3 l
+自然对数 3 l
+自然律 3 l
+自然性 7 n
+自然损耗 3 l
+自然数 132 l
+自然景观 3 l
+自然村 33 n
+自然概念 3 l
+自然段 9 n
+自然法 113 l
+自然法则 3 n
+自然法学 3 l
+自然灾害 306 l
+自然物 25 l
+自然环境 373 l
+自然现象 3 l
+自然生态 3 l
+自然界 922 n
+自然疗法 3 l
+自然矿 3 n
+自然码 3 l
+自然硫 8 n
+自然科 3 l
+自然科学 692 l
+自然科学史 11 l
+自然科学家 22 l
+自然等价 3 l
+自然经济 116 l
+自然美 28 i
+自然而然 417 i
+自然肥力 3 l
+自然色 3 l
+自然衰减 3 l
+自然观 56 l
+自然规律 92 l
+自然语言 46 l
+自然课 8 n
+自然资源 1277 l
+自然轨道 3 l
+自然辩证法 24 l
+自然选择 94 l
+自然通风 3 l
+自然遗产 3 l
+自然铜 6 n
+自然风 15 l
+自然风光 3 l
+自然风化 2 l
+自然风景 3 l
+自熄性 5 l
+自燃 44 v
+自燃式 3 l
+自燃性 3 n
+自爆 3 a
+自爱 77 v
+自爱自重 3 i
+自珍 14 b
+自理 131 vn
+自理能力 3 l
+自甘 3 v
+自甘堕落 13 i
+自甘暴弃 3 i
+自生 3 v
+自生放松 3 n
+自生自灭 49 i
+自用 90 v
+自用则小 3 l
+自用品 3 n
+自用车 3 n
+自由 8558 a
+自由业 3 n
+自由主义 333 n
+自由主体 3 n
+自由之子 3 l
+自由之石 3 i
+自由亚齐 3 ns
+自由人 1062 n
+自由价格 3 l
+自由体 18 d
+自由体操 40 l
+自由党 184 nt
+自由动作 3 l
+自由化 296 vn
+自由区 11 n
+自由发挥 3 i
+自由场 3 n
+自由基 3 n
+自由女神 3 i
+自由宝岛 3 n
+自由对象 3 l
+自由市场 107 n
+自由度 149 d
+自由式 36 l
+自由往来 3 i
+自由心证 3 i
+自由态 3 l
+自由思想 3 i
+自由性 7 d
+自由恋爱 3 l
+自由拼音 3 i
+自由振荡 3 i
+自由授粉 3 l
+自由操 3 l
+自由支配 3 l
+自由放任 33 l
+自由散漫 3 i
+自由日报 3 i
+自由权 20 n
+自由民 83 n
+自由民主 17 i
+自由民主党 37 nt
+自由泛滥 3 l
+自由泳 107 l
+自由派 64 n
+自由港 66 n
+自由滑 10 i
+自由王国 8 nt
+自由电子 70 l
+自由电荷 3 n
+自由矢量 3 i
+自由祖国 3 n
+自由空间 3 n
+自由竞争 3 l
+自由组合 3 l
+自由网 3 n
+自由职业 12 l
+自由职业者 43 n
+自由自在 281 i
+自由舰 3 n
+自由落体 31 l
+自由行动 3 l
+自由言论 3 i
+自由词 3 i
+自由诗 20 l
+自由贸易 3 l
+自由贸易区 41 nt
+自由车 3 n
+自由软件 3 l
+自由选择 3 l
+自由邦 36 n
+自由锻 3 n
+自由面 3 d
+自由鸟 3 i
+自画像 31 n
+自留 10 v
+自留地 59 l
+自留山 4 l
+自留畜 3 n
+自留资金 3 l
+自疚 3 a
+自白 35 v
+自白书 2 n
+自相 3 d
+自相惊忧 3 i
+自相惊扰 3 l
+自相残害 23 i
+自相残杀 131 i
+自相水火 3 i
+自相矛盾 97 l
+自相鱼肉 3 i
+自省 55 r
+自矜 3 a
+自矜自伐 3 v
+自知 552 v
+自知之明 60 i
+自知理亏 3 l
+自知理屈 3 i
+自禁 12 d
+自私 247 a
+自私心 3 i
+自私自利 49 i
+自种 3 r
+自称 1066 v
+自称为 103 l
+自立 567 v
+自立军 45 n
+自立早报 3 i
+自立晚报 3 i
+自立更生 3 i
+自立自强 3 i
+自立门户 33 i
+自筹 115 v
+自筹经费 3 n
+自筹资金 3 n
+自管 3 l
+自管自 3 j
+自繁自养 3 i
+自纠 3 l
+自纠自查 3 vn
+自约 3 d
+自组 3 vn
+自经 3 d
+自给 517 v
+自给性 14 n
+自给有余 45 i
+自给率 33 n
+自给自足 267 i
+自绝 70 v
+自编 81 v
+自编自演 3 n
+自编铃声 3 n
+自缢 152 v
+自缢身亡 3 v
+自考 374 v
+自考办 107 n
+自考网 3 n
+自耕 3 v
+自耕农 96 l
+自聚焦 3 n
+自肥 37 n
+自育 4 vn
+自能 3 v
+自能在 3 d
+自艾 3 n
+自花传粉 10 l
+自花受粉 3 l
+自花授粉 3 l
+自若 55 v
+自苦 3 d
+自苦寒 3 i
+自荐 70 v
+自荐书 5 n
+自荐信 3 n
+自营 95 vn
+自营商 3 n
+自营性 4 n
+自营承销 3 n
+自营权 256 n
+自虐 33 v
+自虐狂 3 l
+自行 2325 r
+自行其事 6 i
+自行其是 27 l
+自行决定 3 l
+自行处理 3 l
+自行安排 3 n
+自行式 54 n
+自行检验 3 n
+自行添加 3 i
+自行火炮 129 l
+自行解决 3 l
+自行设计 3 i
+自行车 1034 n
+自行车厂 8 n
+自行车赛 31 n
+自行车道 3 n
+自行车队 5 n
+自裁 3 n
+自见 3 v
+自视 3 v
+自视甚高 27 i
+自觉 1798 d
+自觉形秽 3 n
+自觉性 174 l
+自觉自愿 30 l
+自觉运动 3 l
+自觉遵守 3 ns
+自觉革命 3 l
+自解 3 v
+自言自语 406 i
+自警 12 n
+自警团 3 nt
+自订 3 v
+自认 129 v
+自认会 3 l
+自认倒霉 19 l
+自认是 3 l
+自讨 3 v
+自讨没趣 39 l
+自讨苦吃 49 l
+自许 3 d
+自讼 3 vn
+自设 32 vn
+自证 3 v
+自诉 47 v
+自诉人 11 n
+自诒伊戚 3 nr
+自诩 64 v
+自诩清高 3 z
+自语 103 nz
+自误 3 n
+自误误人 3 l
+自说自话 22 l
+自调 3 v
+自调式 3 l
+自谋 85 n
+自谋出路 3 i
+自谋生路 8 l
+自谋职业 3 l
+自谦 3 nrt
+自谱 3 n
+自豪 521 n
+自豪感 107 l
+自负 321 v
+自负不凡 3 l
+自负盈亏 61 l
+自负赢亏 3 n
+自贡 64 v
+自贡人 4 n
+自贡市 24 ns
+自责 93 v
+自贬 3 v
+自购 3 v
+自贱 3 a
+自贸区 2 l
+自费 187 vn
+自费上学 3 l
+自费旅行 3 nt
+自费生 8 n
+自费留学 3 l
+自贻伊咎 3 nr
+自贻伊戚 3 nr
+自贼 3 n
+自赎 3 i
+自赏 3 v
+自走式 8 l
+自足 170 a
+自足自给 3 i
+自蹈法网 3 i
+自身 4326 r
+自身难保 3 l
+自转 289 v
+自转式 3 l
+自转角 3 i
+自转轴 3 n
+自轻自贱 8 i
+自载 3 v
+自辐射 3 nz
+自述 79 v
+自述文件 3 n
+自适 3 a
+自适应性 3 n
+自选 103 v
+自选动作 3 l
+自选商场 5 n
+自选商店 3 n
+自选市场 3 l
+自选曲 3 l
+自选股 3 n
+自选辑 3 l
+自选集 3 n
+自通 3 a
+自造 3 v
+自造词 3 n
+自造词组 3 n
+自遣 3 v
+自郐以下 3 nr
+自郐无讥 3 nr
+自郐而下 3 v
+自酌 3 v
+自配 2 vn
+自酿 3 v
+自释放 3 l
+自重 186 a
+自重自爱 3 l
+自量 13 n
+自销 3 v
+自销权 3 n
+自闭 3 v
+自闭性 3 n
+自闭症 5 n
+自问 60 v
+自问自答 3 l
+自限性 7 n
+自隔离 3 l
+自顶向下 3 i
+自须 3 d
+自顾不暇 37 i
+自顾自 50 d
+自食 3 l
+自食其力 88 l
+自食其果 16 i
+自食其言 10 l
+自食恶果 3 i
+自馁 2 a
+自首 119 v
+自首书 3 l
+自首变节 3 l
+自驾 3 v
+自驾游 3 i
+自驾车 3 i
+自高自大 18 i
+自鸣得意 30 l
+自鸣钟 54 l
+臬 50 nr
+臭 1827 a
+臭不可当 7 i
+臭不可闻 13 i
+臭丫头 3 n
+臭乎乎 3 z
+臭事 3 n
+臭人 3 n
+臭包 3 n
+臭吃臭喝 3 i
+臭名 9 n
+臭名昭彰 2 i
+臭名昭着 3 i
+臭名昭著 48 i
+臭名远扬 11 i
+臭味 168 n
+臭味儿 8 n
+臭味相投 12 i
+臭哄哄 3 z
+臭头 3 n
+臭小子 3 n
+臭屁 3 n
+臭屎 3 n
+臭架子 9 n
+臭棋 8 n
+臭棋篓子 3 n
+臭椿 14 n
+臭死 3 v
+臭气 150 n
+臭气冲天 3 i
+臭气熏天 3 l
+臭气薰天 3 z
+臭氧 153 n
+臭氧层 117 n
+臭氧机 3 n
+臭氧洞 13 n
+臭氧浓度 7 n
+臭氧解 3 n
+臭水 18 n
+臭水塘 3 n
+臭水沟 20 n
+臭汗 3 n
+臭沟 3 n
+臭灵丹草 3 n
+臭烘烘 13 z
+臭熏熏 3 l
+臭狐 3 n
+臭男人 3 n
+臭皮 3 n
+臭皮匠 3 n
+臭皮囊 14 n
+臭美 17 n
+臭老九 13 l
+臭肉来蝇 3 i
+臭脚 3 n
+臭腺 14 n
+臭臭 3 n
+臭虫 75 n
+臭蛋 3 n
+臭豆腐 299 n
+臭钱 3 n
+臭铜味 3 n
+臭骂 82 v
+臭骂一顿 3 i
+臭鼠 3 n
+臭鼬 3 n
+臮 3 zg
+至 43708 p
+至上 195 d
+至上而下 3 l
+至下而上 3 l
+至为 3 d
+至于 5254 p
+至交 25 v
+至亲 39 n
+至亲好友 29 l
+至亲至爱 8 l
+至亲骨肉 6 l
+至人无为 3 i
+至人无己 3 i
+至人无梦 3 i
+至仁志仁 3 nz
+至今 3323 d
+至今已是 3 l
+至今已有 3 l
+至信辟金 3 l
+至公无私 3 l
+至关 16 v
+至关紧要 33 l
+至关重要 478 l
+至再至三 3 i
+至友 3 nz
+至善至美 3 i
+至嘱 3 v
+至圣 3 nz
+至圣先师 16 l
+至圣孔子 3 i
+至圣至明 3 l
+至多 99 d
+至多是 3 d
+至大无外 3 l
+至大至刚 3 i
+至好 2 d
+至孝 3 v
+至宝 87 nz
+至宝丹 5 nz
+至尊 704 v
+至尊宝 3 i
+至尊无上 3 l
+至尊版 3 l
+至尊至贵 5 i
+至小无内 3 l
+至少 5775 d
+至当不易 3 l
+至德 55 nz
+至情至性 5 l
+至於 3 i
+至智不谋 3 i
+至极 236 n
+至正 252 d
+至此 1429 d
+至死 153 d
+至死不变 6 i
+至死不屈 6 i
+至死不悔 3 l
+至死不悟 5 i
+至死不渝 15 i
+至死不降 3 i
+至死靡它 3 n
+至爱 48 v
+至理名言 39 l
+至理明言 3 l
+至真至诚 2 l
+至矣尽矣 3 nr
+至福 3 nz
+至要 3 d
+至诚 82 d
+至诚如神 3 i
+至诚高节 3 i
+至迟 51 d
+至阳 3 nz
+至阴 3 nz
+至高无上 434 l
+致 3645 v
+致书 3 v
+致事 3 v
+致于 3 v
+致人死命 3 nz
+致仕 150 v
+致以 137 v
+致伤 21 v
+致使 1405 v
+致信 82 v
+致候 3 v
+致公 5 n
+致公党 42 nt
+致冷 29 a
+致冷器 4 nz
+致函 78 v
+致力 1198 n
+致力于 3 n
+致命 720 v
+致命伤 46 v
+致命处 3 nt
+致命性 23 n
+致哀 148 v
+致奠 3 v
+致害 3 v
+致害物 3 n
+致密 212 a
+致富 1137 a
+致富之道 3 nz
+致富思源 3 n
+致富梦 3 nz
+致富线 3 nz
+致富经 3 nz
+致富网 3 nz
+致富路 10 nz
+致幻剂 3 nz
+致开幕词 3 n
+致意 133 v
+致敬 228 v
+致敬祝词 3 nr
+致橡树 3 n
+致歉 62 v
+致歉信 3 vn
+致死 249 v
+致死案 3 n
+致死温度 3 n
+致死率 4 n
+致死量 3 n
+致残 54 v
+致残率 6 nz
+致理 3 v
+致理商专 3 nt
+致理商业 3 nt
+致用 3 v
+致电 272 v
+致畸 45 v
+致畸性 3 vn
+致病 279 v
+致病性 64 n
+致病菌 71 n
+致癌 322 v
+致癌性 26 n
+致癌物 57 n
+致癌物质 3 n
+致盲 15 v
+致知 3 v
+致福轩 2 nz
+致胜 3 v
+致胜球 3 n
+致词 88 n
+致谢 97 v
+致谢辞 3 n
+致贫 14 v
+致贺 12 v
+致赠 3 v
+致辞 90 v
+致远 598 a
+致远任重 3 n
+致送 3 v
+致醉 3 v
+臺 63 zg
+臻 216 vg
+臻于完善 3 nr
+臻于极致 3 nr
+臻臻至至 3 nr
+臼 171 n
+臼头深目 3 n
+臼杵 3 n
+臼杵之交 3 v
+臼灶生蛙 3 n
+臼炮 3 n
+臼齿 95 n
+臽 435 zg
+臾 7 x
+臿 6 zg
+舀 266 v
+舀儿 3 n
+舀出 3 n
+舀去 3 n
+舀取 3 n
+舀子 3 n
+舀水 3 n
+舀汤 3 n
+舀油 3 n
+舀酒 3 n
+舁 7 zg
+舂 363 v
+舂容大雅 3 nr
+舃 59 zg
+舄 10 zg
+舄乌虎帝 3 v
+舅 377 n
+舅兄 3 n
+舅公 3 n
+舅叔 3 n
+舅大人 3 n
+舅妈 78 n
+舅姑 7 n
+舅姨 3 n
+舅娘 3 n
+舅子 8 n
+舅母 90 n
+舅父 94 n
+舅父母 2 n
+舅爷 65 n
+舅舅 541 n
+舅舅家 3 n
+舆 1038 n
+舆人 3 n
+舆台 3 n
+舆图 3 n
+舆地 3 n
+舆情 92 n
+舆榇 5 n
+舆死扶伤 3 i
+舆论 1830 n
+舆论压力 3 n
+舆论哗然 20 i
+舆论导向 3 n
+舆论工具 3 n
+舆论界 84 n
+舆论监督 3 n
+舆车 3 n
+舆马 3 n
+與 8 zg
+興 2 zg
+舉 5 zg
+舌 1282 n
+舌下 3 n
+舌下神经 3 l
+舌下腺 7 n
+舌下间隙 3 n
+舌乳头炎 3 n
+舌乾脣焦 3 i
+舌侧支托 3 n
+舌侧翼缘 3 i
+舌刺 3 n
+舌前 3 v
+舌剑唇枪 2 i
+舌剑脣枪 3 n
+舌叶 3 n
+舌后 3 n
+舌向错位 3 n
+舌向阻生 3 n
+舌咽神经 3 l
+舌头 902 n
+舌尖 107 n
+舌尖口快 3 n
+舌尖音 3 n
+舌弓 3 n
+舌战 78 n
+舌战群儒 3 i
+舌挢不下 3 v
+舌敝唇焦 3 i
+舌敝耳聋 3 i
+舌敝脣焦 3 i
+舌杆 3 n
+舌枪唇剑 3 i
+舌根 31 n
+舌根音 3 n
+舌桥不下 3 i
+舌灿莲花 3 z
+舌炎 4 n
+舌状 3 n
+舌状花 13 n
+舌痛 3 n
+舌癌 2 n
+舌端 3 n
+舌端月旦 3 i
+舌系带 3 n
+舌缘 3 n
+舌苔 104 n
+舌蝇 6 n
+舌裂 3 n
+舌锋 3 n
+舌锋如火 3 i
+舌门 3 n
+舌面 3 n
+舌面前音 3 n
+舌面后音 3 n
+舌面窝 3 n
+舌面隆凸 3 n
+舌面音 3 n
+舌音 2 n
+舌骨 3 n
+舌鳎 6 n
+舍 1477 v
+舍下 76 v
+舍不得 668 v
+舍不得你 3 nr
+舍亲 7 n
+舍人 240 nrt
+舍伍德 5 nrt
+舍侄 19 n
+舍入 6 v
+舍内 7 s
+舍出 3 v
+舍利 104 nrt
+舍利塔 16 nrt
+舍利子 15 n
+舍勒 24 nrt
+舍去 9 v
+舍友 5 n
+舍命 232 nz
+舍命陪君 3 n
+舍妹 3 n
+舍娃 2 nrt
+舍实求虚 3 i
+舍小家 3 n
+舍尔 18 nrt
+舍己 3 n
+舍己为人 13 i
+舍己为公 3 i
+舍己为国 3 i
+舍己从人 4 i
+舍己就人 3 i
+舍己救人 17 i
+舍己芸人 3 i
+舍已为人 3 i
+舍已为公 3 i
+舍已救人 3 i
+舍弃 215 v
+舍弃运算 3 i
+舍弟 3 n
+舍得 651 v
+舍得吃 3 v
+舍恩 7 nrt
+舍我其谁 18 i
+舍拉利 3 nrt
+舍掉 3 v
+舍旧谋新 3 i
+舍末逐末 3 i
+舍本事末 3 n
+舍本求末 4 i
+舍本逐末 17 n
+舍此 3 d
+舍死忘生 12 i
+舍比拉特 6 nrt
+舍特 6 nrt
+舍瓦 35 nrt
+舍生 3 v
+舍生取义 17 i
+舍生忘死 60 i
+舍甫琴柯 2 nr
+舍甫琴科 60 nrt
+舍监 27 n
+舍短取长 3 i
+舍策追羊 3 i
+舍舆登舟 3 ns
+舍费尔 3 nrt
+舍身 140 v
+舍身为国 2 i
+舍身取义 20 i
+舍身图报 3 i
+舍身崖 3 n
+舍身报国 3 i
+舍身救人 3 i
+舍身求法 3 i
+舍车保帅 3 n
+舍近务远 3 i
+舍近即远 3 i
+舍近取远 3 i
+舍近求远 12 i
+舍里 5 s
+舍长 5 v
+舍间 12 n
+舍饲 12 v
+舐 153 vg
+舐吃 3 i
+舐声 3 i
+舐犊之爱 3 i
+舐犊情深 5 i
+舐痈吮痔 3 n
+舐皮论骨 3 i
+舐糠及米 3 i
+舐食 3 i
+舒 491 zg
+舒三和 3 nr
+舒乐安定 2 nr
+舒亦康 3 nr
+舒伊斯 2 nr
+舒伯特 24 nr
+舒克申 2 nr
+舒兰 4 nr
+舒兰县 3 nr
+舒兰市 3 ns
+舒兹伯利 3 nr
+舒利 3 a
+舒化龙 11 nr
+舒华英 4 nr
+舒卷 13 nr
+舒卷自如 3 nr
+舒口气 2 n
+舒可心 3 nr
+舒同 2 a
+舒圣佑 5 v
+舒坦 111 a
+舒城 14 nr
+舒城县 6 nr
+舒声 3 nr
+舒大哥 4 nr
+舒头探脑 3 l
+舒安皇后 2 nr
+舒尔哈 6 nr
+舒尔茨 13 nrt
+舒尼克 9 nr
+舒展 227 vn
+舒巴坦 2 nr
+舒希纳 3 nr
+舒席 2 n
+舒庆春 2 nr
+舒建 3 a
+舒开 2 v
+舒张 132 a
+舒张压 3 z
+舒德干 6 nr
+舒心 71 a
+舒快 3 a
+舒怀 3 nr
+舒恩海 3 nr
+舒悦 2 a
+舒惠国 258 nr
+舒意缓 16 a
+舒拉 2 nrt
+舒散 3 a
+舒斯特 5 nr
+舒新城 8 nr
+舒施尼 16 nr
+舒曼 39 nr
+舒服 1144 a
+舒服些 3 nr
+舒松 2 a
+舒枝展叶 3 nr
+舒柔靡 16 nr
+舒桂林 2 nr
+舒波乐 3 nr
+舒泰 17 nr
+舒洁 3 a
+舒活筋骨 3 l
+舒淇 11 nr
+舒爽 15 a
+舒特金 2 nr
+舒王 3 nrt
+舒玛彻 2 nr
+舒瓦瑟尔 3 nrt
+舒申斯 2 nr
+舒畅 298 a
+舒眉展眼 3 l
+舒积郁 2 nr
+舒筋活络 7 l
+舒筋活血 12 l
+舒绣文 10 nr
+舒缓 103 a
+舒翰 21 nrt
+舒翰统 2 nr
+舒肝理气 3 n
+舒肤佳 3 nz
+舒胸顺 2 nr
+舒舒服服 77 z
+舒舒诺 2 nr
+舒茨 6 nrt
+舒莱金 2 nr
+舒莲记 2 nr
+舒菲尔 2 nr
+舒解 4 v
+舒赫德 4 nr
+舒适 642 a
+舒适型 3 nr
+舒适安逸 3 nr
+舒适度 23 n
+舒适性 40 nr
+舒适感 9 nr
+舒适版 3 n
+舒通 2 a
+舒闲 3 a
+舒马瓦 2 nr
+舒马赫 9 nr
+舒马迪 3 nr
+舒默 3 a
+舓 7 zg
+舔 342 v
+舔乾净 3 z
+舔吃 3 v
+舔掉 3 v
+舔瓜子 3 v
+舔着 3 v
+舔阴 3 v
+舔食 6 v
+舖 6 zg
+舛 94 zg
+舛杂 3 n
+舛讹百出 3 n
+舛误 4 n
+舛谬 3 n
+舛错 3 n
+舛驳 3 n
+舜 377 g
+舜天 111 n
+舜天队 30 n
+舜尧 2 n
+舜帝 8 n
+舜日尧天 3 z
+舜日尧年 3 vn
+舞 2725 v
+舞会 116 n
+舞伴 31 n
+舞俑 3 n
+舞凤飞龙 3 n
+舞出 3 v
+舞刀 82 n
+舞刀弄枪 3 i
+舞刀跃马 3 i
+舞剑 99 n
+舞剧 205 n
+舞剧团 20 n
+舞剧院 7 nt
+舞动 206 n
+舞动着 3 n
+舞厅 108 n
+舞厅舞 3 vn
+舞台 1981 n
+舞台剧 46 n
+舞台化 2 n
+舞台吊杆 3 n
+舞台效果 3 n
+舞台灯光 3 n
+舞台艺术 3 n
+舞团 12 n
+舞场 19 n
+舞坛 13 n
+舞女 67 n
+舞姬 20 n
+舞姿 66 n
+舞娘 3 n
+舞孃 3 vn
+舞客 3 n
+舞弄 22 v
+舞弄文墨 3 i
+舞弄着 3 i
+舞弊 84 n
+舞弊案 2 n
+舞弊者 2 n
+舞弊营私 3 n
+舞影 2 n
+舞态 3 n
+舞态生风 3 n
+舞技 2 n
+舞拳 3 n
+舞文巧法 3 n
+舞文弄墨 12 i
+舞文弄法 3 i
+舞文玩法 3 n
+舞文饰智 3 n
+舞星 3 n
+舞曲 143 n
+舞曲版 3 n
+舞曲网 3 n
+舞月光 3 n
+舞棍 3 n
+舞榭歌楼 3 ns
+舞步 63 n
+舞池 24 n
+舞爪张牙 3 n
+舞牙弄爪 3 i
+舞狮 16 n
+舞狮队 4 n
+舞王 2 n
+舞男 3 n
+舞票 3 n
+舞笔弄文 3 i
+舞美 793 ns
+舞美师 3 n
+舞美艺术 3 n
+舞美设计 3 i
+舞者 47 n
+舞艺 4 n
+舞艺超群 3 ns
+舞衫歌扇 3 n
+舞裙歌扇 3 n
+舞谱 26 n
+舞起 3 v
+舞起来 3 v
+舞蹈 2030 n
+舞蹈团 17 n
+舞蹈学院 8 nt
+舞蹈家 80 n
+舞蹈服装 3 n
+舞蹈演员 3 n
+舞蹈片 3 n
+舞蹈班 4 n
+舞蹈疗法 3 n
+舞蹈病 11 n
+舞蹈社 3 nt
+舞蹈系 4 n
+舞蹈节 9 n
+舞蹈诗 7 n
+舞蹈队 14 n
+舞迷 3 n
+舞钢 5 n
+舞钢市 7 n
+舞阳 29 n
+舞阳县 6 ns
+舞阳钢铁公司 3 nt
+舞雩 3 ns
+舞鞋 6 n
+舞龙 7 n
+舞龙头 3 n
+舞龙竞赛 3 n
+舞龙队 3 n
+舟 985 ns
+舟中敌国 3 l
+舟子 63 n
+舟山 175 ns
+舟山市 18 ns
+舟山渔场 8 ns
+舟山群岛 3 ns
+舟曲 261 ns
+舟曲县 2 ns
+舟桥 33 ns
+舟桥器材 3 n
+舟桥团 4 n
+舟楫 34 n
+舟水之喻 3 n
+舟津圭 7 ns
+舟皿 3 n
+舟舆 3 ns
+舟舰 3 n
+舟船 3 n
+舟车 26 n
+舟车劳顿 4 ns
+舟骨 3 n
+舡 16 g
+舢板 122 n
+舣 7 g
+舥 59 zg
+舨 24 x
+航 1072 n
+航业 3 n
+航业公司 3 n
+航务 5 n
+航向 200 n
+航器 3 n
+航图 3 n
+航天 1344 n
+航天专家 3 n
+航天中心 3 nt
+航天事业 3 n
+航天史 3 n
+航天员 134 n
+航天器 306 n
+航天城 24 n
+航天局 53 n
+航天工业 3 n
+航天工业部 4 nt
+航天技术 3 n
+航天服 3 n
+航天桥 5 n
+航天界 6 n
+航天站 47 n
+航天航空 3 n
+航天遥感 3 n
+航天部 3 n
+航天部门 4 n
+航天部队 2 n
+航天飞机 272 n
+航委会 3 nt
+航宇 66 n
+航寄 3 v
+航展 82 vn
+航徽 3 n
+航意险 33 n
+航手 3 n
+航拍 15 n
+航政 3 n
+航政司 3 n
+航政局 3 nt
+航期 3 n
+航机 5 n
+航权 19 n
+航材 4 n
+航标 62 n
+航标灯 17 n
+航校 13 n
+航梯 3 n
+航模 8 n
+航次 23 n
+航母 1477 n
+航油 11 n
+航测 13 v
+航海 2056 n
+航海历 3 n
+航海图 48 n
+航海士 3 n
+航海家 123 n
+航海技术 3 n
+航海日志 3 n
+航海日记 3 nz
+航海机 3 n
+航海梯山 3 nz
+航海模型 3 n
+航海法 3 n
+航海王 3 n
+航渡 33 v
+航炮 22 n
+航点 3 n
+航班 1479 n
+航班信息 3 n
+航班号 27 n
+航班时刻 3 n
+航电 134 n
+航界 3 n
+航石江 3 j
+航程 462 n
+航空 6021 n
+航空业 32 n
+航空事业 3 n
+航空信 3 n
+航空信件 3 n
+航空公司 96 n
+航空兵 488 n
+航空史 15 n
+航空员 2 n
+航空器 102 n
+航空图 3 n
+航空学 11 n
+航空学院 3 nt
+航空安全 3 n
+航空局 13 nt
+航空展 51 nt
+航空工业 3 n
+航空工业总公司 7 nt
+航空工业部 7 nt
+航空工程 3 n
+航空摄影 3 n
+航空暨太 3 n
+航空术 3 n
+航空母舰 631 n
+航空法 3 n
+航空港 376 n
+航空牙疼 3 n
+航空界 23 n
+航空相片 3 n
+航空站 44 n
+航空箱 3 n
+航空线 74 n
+航空网 3 n
+航空航天 11 n
+航空航天工业部 2 nt
+航空航天部 4 nt
+航空舰 3 n
+航空运输 3 j
+航空遥感 3 n
+航空邮件 3 n
+航空邮政 3 n
+航空部 8 nt
+航空队 111 n
+航空飞船 3 n
+航站 25 n
+航站楼 20 n
+航管 5 n
+航线 2882 n
+航至 3 v
+航船 69 n
+航行 1322 n
+航行图 3 n
+航行权 3 n
+航行灯 3 n
+航行者 3 n
+航路 113 n
+航运 1962 n
+航运业 48 n
+航运公司 3 n
+航运权 3 n
+航运法 3 n
+航运界 11 n
+航迹 40 n
+航速 445 n
+航道 980 n
+航道局 3 n
+舫 52 zg
+般 3306 u
+般地 414 u
+般涅 9 nz
+般的 2260 u
+般般 18 a
+般若 214 z
+般若书会 3 ns
+般若堂汤 3 ns
+般若经 3 ns
+般配 49 a
+般阳 5 ns
+舭 9 x
+舯 28 zg
+舰 3600 ng
+舰只 186 n
+舰地导弹 3 n
+舰塔 3 n
+舰尾 3 n
+舰旗 3 n
+舰炮 210 n
+舰种 21 n
+舰群 3 n
+舰船 536 n
+舰艇 1370 n
+舰载 436 b
+舰载机 3 b
+舰长 164 n
+舰队 1839 n
+舰首 3 n
+舱 1324 n
+舱位 26 n
+舱体 11 n
+舱内 215 s
+舱口 60 s
+舱口处 3 n
+舱壁 17 s
+舱室 57 n
+舱底 3 s
+舱底水泵 3 n
+舱房 3 n
+舱盖 140 n
+舱门 149 n
+舱门口 3 s
+舱面 4 n
+舲 2 zg
+舳 25 x
+舳舻 9 n
+舳舻相继 3 nz
+舴 36 x
+舴艋 2 n
+舵 1126 n
+舵主 536 n
+舵工 26 n
+舵手 33 n
+舵手室 3 n
+舵机 10 n
+舵杆 9 n
+舵柄 3 n
+舵盘 3 n
+舵舱 3 n
+舵轮 9 n
+舶 96 ng
+舶位 3 n
+舶来品 13 n
+舶来货 3 n
+舷 170 ng
+舷侧 13 s
+舷墙 2 n
+舷外 4 s
+舷外机 2 n
+舷梯 23 n
+舷窗 33 n
+舷门 3 n
+舸 27 g
+船 7819 n
+船上 1357 s
+船东 9 n
+船中部 3 n
+船主 41 n
+船仓 3 n
+船位 18 n
+船体 254 n
+船儿 41 n
+船到桥头 3 n
+船务 7 n
+船厂 186 n
+船只 1140 n
+船只总数 3 n
+船台 35 n
+船名 9 n
+船员 165 n
+船员表 3 n
+船坚炮利 20 n
+船坞 187 n
+船坞蛋白 3 z
+船型 33 n
+船型构象 3 n
+船埠 3 n
+船壳 2 n
+船大工 3 n
+船夫 115 n
+船夫曲 3 n
+船头 533 n
+船头雕饰 3 n
+船娘 4 n
+船客 3 n
+船室 3 n
+船家 129 n
+船尾 125 n
+船尾骨 3 n
+船山 21 n
+船山乡 3 n
+船山区 3 n
+船工 31 n
+船帆 39 n
+船帆座 3 n
+船帮 16 n
+船底 64 s
+船底污水 3 n
+船弦 3 n
+船形 36 n
+船形帽 3 n
+船户 17 n
+船支 3 n
+船政 34 n
+船旗国 12 ns
+船昀室 3 v
+船期 7 n
+船期表 3 n
+船木 3 n
+船板 76 n
+船柱 3 n
+船桅 15 n
+船桥 3 n
+船桨 24 n
+船梢 3 n
+船模 3 n
+船歌 4 n
+船民 10 n
+船浆 3 n
+船游 3 n
+船状 3 n
+船王 3 n
+船生噪声 3 n
+船用 42 n
+船田 3 n
+船的宽度 3 l
+船票 45 n
+船篙 3 n
+船篷 47 n
+船籍 3 n
+船级社 17 n
+船翻 3 n
+船老大 119 j
+船脚 3 n
+船腹 3 n
+船舰 3 n
+船舱 291 n
+船舵 9 n
+船舶 1793 n
+船舶业 3 n
+船舶厂 2 n
+船舶学 3 n
+船舶工业 3 n
+船舶机械 3 n
+船舶设计 3 n
+船舷 102 n
+船舷上缘 3 v
+船艇 76 n
+船营区 3 n
+船货 3 n
+船费 3 n
+船身 185 n
+船载小艇 3 n
+船辐 3 n
+船边 3 s
+船运 73 n
+船速 18 n
+船钱 6 n
+船长 1379 n
+船长室 24 n
+船门 3 n
+船闸 135 n
+船队 431 n
+船首 30 n
+船首像 3 n
+船首分水 3 n
+船首斜桅 3 n
+船首楼 3 n
+船首绞车 3 n
+船首锚架 3 vn
+船首饰 3 n
+船龄 3 n
+舺 7 zg
+舻 59 g
+舾 46 n
+舾装 8 n
+艄 107 n
+艄公 113 n
+艇 946 n
+艇员 3 n
+艇长 66 n
+艉 56 g
+艋 35 x
+艌 41 zg
+艍 2 zg
+艏 45 g
+艔 17 zg
+艘 3265 m
+艘次 2 q
+艚 30 g
+艟 13 x
+艨 24 n
+艨艟 16 n
+艮 120 g
+艮岳 3 nz
+艮秋艮新 2 nz
+良 1206 a
+良久 937 a
+良久方 16 n
+良久良久 52 l
+良乡 27 n
+良人 59 n
+良伴 3 n
+良兵 3 n
+良医 29 n
+良友 47 n
+良吏 3 n
+良品率 3 n
+良唇吉日 3 i
+良善 53 a
+良善风俗 3 i
+良士 3 n
+良多 50 m
+良夜 3 b
+良好 6044 a
+良好习惯 3 n
+良好信誉 3 i
+良好印象 3 n
+良好基础 3 l
+良好开端 3 i
+良好形象 3 l
+良好效果 10 n
+良好条件 3 l
+良好氛围 3 v
+良好率 3 a
+良好环境 3 l
+良好经营 3 l
+良子 5 n
+良宵 34 n
+良宵好景 3 i
+良宵美景 2 i
+良家 87 n
+良家女子 3 n
+良家妇女 3 n
+良家子 3 n
+良导体 3 n
+良将 105 n
+良工巧匠 3 n
+良工心苦 3 l
+良工苦心 3 l
+良币 3 n
+良师 21 n
+良师兴国 3 ns
+良师益友 19 n
+良师诤友 3 vn
+良弓无改 3 i
+良心 728 a
+良心不安 3 i
+良心何在 3 i
+良心发现 3 i
+良心话 3 l
+良心谴责 3 vn
+良态 3 n
+良性 436 n
+良性循环 3 i
+良性瘤 3 l
+良性肿瘤 43 l
+良才 10 n
+良方 52 n
+良方妙计 3 i
+良日 3 n
+良时吉日 3 i
+良时美景 3 l
+良有以也 2 i
+良朋 3 n
+良朋益友 3 n
+良机 362 n
+良机不再 3 i
+良机勿失 3 i
+良材 19 n
+良村 6 n
+良母 3 n
+良民 195 n
+良民证 3 n
+良深 3 a
+良渚 52 ns
+良渚文化遗址 6 ns
+良渚遗址 3 ns
+良渚镇 3 ns
+良港 3 ns
+良玉 19 n
+良玉不雕 3 i
+良田 124 n
+良田万顷 3 l
+良相 3 n
+良相佐国 3 ns
+良知 258 n
+良知良能 2 i
+良禽择木 7 i
+良种 186 m
+良种兔 3 n
+良种化 2 l
+良种场 5 n
+良种苗 3 n
+良策 173 n
+良缘 46 n
+良能 3 n
+良苦 10 a
+良苦用心 25 i
+良药 326 n
+良药苦口 2 n
+良药苦口利于病 5 i
+良莠 27 z
+良莠不一 3 i
+良莠不分 3 i
+良莠不齐 49 i
+良莠淆杂 3 i
+良言 30 n
+良计 3 n
+良贱 3 a
+良贾深藏 3 ns
+良辰 47 n
+良辰吉日 4 i
+良辰媚景 3 i
+良辰美景 26 i
+良金美玉 3 nr
+良马 43 n
+艰 158 a
+艰危 27 a
+艰困 3 a
+艰巨 467 a
+艰巨性 36 i
+艰涩 37 a
+艰深 35 a
+艰深晦涩 3 i
+艰深难懂 3 i
+艰苦 1139 a
+艰苦创业 106 l
+艰苦卓绝 75 i
+艰苦备嚐 3 n
+艰苦备尝 3 i
+艰苦奋斗 408 i
+艰苦性 3 i
+艰苦朴素 34 i
+艰苦环境 3 l
+艰苦磨炼 3 i
+艰贞 3 a
+艰辛 342 a
+艰辛发奋 3 i
+艰辛备尝 3 i
+艰阨 3 n
+艰险 199 a
+艰难 1659 a
+艰难困苦 70 i
+艰难度日 3 i
+艰难曲折 32 i
+艰难玉成 3 i
+艰难竭蹶 2 i
+艰难行进 3 i
+艰难险阻 53 i
+色 6908 ng
+色不迷人 3 i
+色丝 2 n
+色丹 10 ns
+色仁行违 3 i
+色价 9 n
+色偏振 3 i
+色光 56 n
+色剖分 3 n
+色卡 8 n
+色即是空 3 i
+色厉内荏 12 i
+色厉胆薄 3 i
+色友 3 n
+色咪咪 3 n
+色块 18 n
+色女郎 3 n
+色如死灰 3 i
+色妹妹 3 n
+色子 3 n
+色层 6 n
+色差 34 n
+色带 25 n
+色带架 3 n
+色庆乡 3 ns
+色度 16 n
+色度图 3 n
+色度学 2 n
+色度计 3 n
+色弱 26 n
+色当 15 n
+色彩 3195 n
+色彩学 3 n
+色彩感 4 n
+色彩斑斓 52 i
+色彩模拟 3 i
+色彩纷呈 10 i
+色彩缤纷 24 i
+色彩艳丽 3 i
+色彩顾问 3 i
+色彩鲜明 3 i
+色彩鲜艳 3 i
+色心 14 n
+色情 309 n
+色情动画 3 n
+色情图 3 n
+色情图片 3 n
+色情女 3 n
+色情小 3 n
+色情小说 3 i
+色情广告 3 i
+色情杂志 3 n
+色情温床 3 n
+色情片 3 n
+色情狂 9 i
+色情电影 3 n
+色情男女 3 n
+色情网 3 n
+色情网站 3 n
+色情行业 3 n
+色情读物 3 n
+色感 3 n
+色拉 16 nrt
+色拉寺 20 ns
+色拉油 3 n
+色授魂与 3 i
+色散 116 n
+色散方程 3 n
+色散本领 3 n
+色斑 21 n
+色料 6 n
+色既是空 3 i
+色映射 3 n
+色晕 3 n
+色林错 12 ns
+色标 3 n
+色样 3 n
+色楞格 5 n
+色楞格河 8 ns
+色欲 16 n
+色母粒 3 n
+色氨酸 20 n
+色法 3 n
+色泽 364 n
+色泽斑驳 3 n
+色泽鲜明 3 ns
+色温 6 n
+色满 2 n
+色漆 6 n
+色灯 3 n
+色狼 38 n
+色狼网 3 n
+色环 3 n
+色球 3 n
+色球层 3 n
+色男 3 n
+色痣 2 n
+色目人 51 n
+色盲 66 n
+色盲患者 3 n
+色盲症 3 n
+色相 42 n
+色眯眯 3 z
+色笔 3 n
+色笔套 3 n
+色粉 7 n
+色系 8 n
+色素 913 n
+色素体 3 n
+色素性 8 n
+色素痣 15 n
+色纯 3 nz
+色纱 6 n
+色纸 7 n
+色织 10 n
+色织厂 3 n
+色织布 3 n
+色胆 11 n
+色胆包天 3 i
+色胆如天 3 i
+色胆迷天 3 i
+色胺 2 n
+色色俱全 3 i
+色艺 3 n
+色艺双绝 9 i
+色艺绝伦 3 i
+色若死灰 3 i
+色蕴 3 n
+色表系 3 n
+色衰 3 n
+色衰爱弛 3 i
+色觉 43 n
+色诱 3 v
+色诱导 3 nz
+色诺芬 14 nrt
+色调 179 n
+色谱 193 n
+色谱仪 4 n
+色谱分析 3 n
+色谱法 3 n
+色达县 3 ns
+色迷 3 n
+色迷迷 3 i
+色酒 4 n
+色酚 512 n
+色釉 18 n
+色雷斯 42 nrt
+色饱和度 3 nz
+色香 3 n
+色香味 19 n
+色鬼 54 n
+色魔 24 n
+艳 746 a
+艳丽 255 a
+艳丽夺目 3 n
+艳事 3 n
+艳光 3 n
+艳光四射 3 l
+艳冶 3 a
+艳史 12 n
+艳后 3 a
+艳如桃李 3 l
+艳妆 7 v
+艳妇 2 n
+艳姿 3 a
+艳媚 3 a
+艳宗 28 n
+艳宗艳 5 n
+艳宗都 3 n
+艳情 23 n
+艳情小说 3 l
+艳情片 3 n
+艳慕 3 v
+艳抹 3 v
+艳无双 78 l
+艳星 3 n
+艳曲淫词 3 v
+艳服 6 a
+艳歌 3 n
+艳照 3 n
+艳福 49 a
+艳福不浅 3 l
+艳称 3 a
+艳粉 3 n
+艳紫妖红 3 n
+艳红 20 n
+艳绝一时 3 l
+艳美无敌 3 l
+艳美绝俗 3 l
+艳羡 93 v
+艳而不俗 3 l
+艳舞 6 n
+艳色 3 n
+艳色绝世 3 l
+艳色耀目 3 n
+艳若桃李 3 l
+艳萍 3 n
+艳蓝色 3 n
+艳装 8 n
+艳诗 4 n
+艳谈 3 v
+艳质 3 n
+艳遇 153 n
+艳阳 21 n
+艳阳天 8 n
+艳阳高照 11 n
+艳霞 5 n
+艴然不悦 3 v
+艹 79 zg
+艺 986 n
+艺不压身 3 n
+艺专 14 n
+艺业 34 n
+艺丰 3 nz
+艺事 3 n
+艺人 493 n
+艺人名 3 n
+艺伎 3 n
+艺体 4 n
+艺匠 3 n
+艺博不精 3 n
+艺博会 2 n
+艺名 57 n
+艺员 8 n
+艺品 3 n
+艺品厂 3 n
+艺品店 3 n
+艺坛 19 n
+艺妓 30 n
+艺委会 2 n
+艺宛 3 nz
+艺宛奇葩 3 n
+艺展 3 n
+艺工队 3 n
+艺师 3 n
+艺廊 3 n
+艺徒 3 n
+艺德 12 n
+艺文 135 n
+艺文志 3 n
+艺无止境 3 l
+艺术 13626 n
+艺术专科 3 n
+艺术交流 3 n
+艺术享受 3 l
+艺术人体 3 n
+艺术人生 3 n
+艺术体操 3 n
+艺术作品 3 n
+艺术修养 3 n
+艺术冲动 3 n
+艺术创作 3 n
+艺术剧院 3 n
+艺术化 16 n
+艺术厅 3 n
+艺术史 42 n
+艺术品 361 n
+艺术团 155 n
+艺术型 3 n
+艺术境界 3 n
+艺术大师 3 n
+艺术宫 13 n
+艺术家 1025 n
+艺术局 4 n
+艺术展 43 n
+艺术工作者 28 n
+艺术形象 3 n
+艺术影院 3 n
+艺术性 140 n
+艺术总监 3 n
+艺术感染 3 n
+艺术摄影 3 n
+艺术格调 3 n
+艺术欣赏 3 i
+艺术歌曲 3 n
+艺术水平 3 n
+艺术流派 3 n
+艺术照 3 n
+艺术片 13 n
+艺术瓷 5 n
+艺术画 3 n
+艺术界 68 n
+艺术科 4 n
+艺术类 335 n
+艺术系 22 n
+艺术细胞 3 n
+艺术网 3 n
+艺术美 12 n
+艺术节 273 n
+艺术表演 3 n
+艺术论 10 n
+艺术论文 3 n
+艺术设计 3 n
+艺术课 5 n
+艺术部 11 n
+艺术院 18 n
+艺术院校 3 n
+艺术风格 3 n
+艺术馆 82 n
+艺林 5 n
+艺校 11 n
+艺海拾贝 3 i
+艺界 3 n
+艺研所 2 n
+艺能 10 n
+艺苑 38 n
+艺苑奇葩 3 n
+艺途 3 n
+艺都 3 n
+艺高 3 n
+艺高人胆大 29 l
+艺高胆大 3 l
+艺龄 3 n
+艽 101 nr
+艾 660 nr
+艾丁湖 21 nr
+艾中信 4 nr
+艾丽丝 3 nr
+艾丽娅 3 nr
+艾丽斯 4 nr
+艾买提 12 nr
+艾亨鲍姆 3 nr
+艾什 11 nrt
+艾从其 3 nr
+艾伦 72 nr
+艾伦伯格 2 nr
+艾伦娜 2 nr
+艾伦级 4 nr
+艾伯塔 4 nr
+艾伯塔省 14 ns
+艾伯特 37 nr
+艾伯特湖 9 nr
+艾佛森 3 nr
+艾儒略 4 nr
+艾克伯格 2 nrt
+艾克尔 3 nr
+艾克斯 10 nr
+艾克曼 3 nr
+艾兰湖 4 nr
+艾兹拉 2 nr
+艾凡赫 6 nr
+艾则孜 6 nrt
+艾利克 2 nr
+艾利和 3 nr
+艾利斯 2 nr
+艾利森 9 nr
+艾利逊 4 nr
+艾力达 2 nr
+艾千子 3 nr
+艾华士 3 nr
+艾南英 8 nr
+艾博特 2 nr
+艾卜伯 2 nr
+艾卜峰 4 nr
+艾卜耶 2 nr
+艾卷 6 nr
+艾叶 20 nr
+艾叶油 3 n
+艾叶花 2 nr
+艾合坦 2 nr
+艾吉耶 2 nr
+艾哈德 2 nr
+艾哈迈 10 nr
+艾哈迈德 46 nrt
+艾哈迈迪 23 nrt
+艾因 9 n
+艾地 7 n
+艾塔斯 3 nr
+艾塞克斯 2 nrt
+艾大怒 3 nr
+艾大惊 3 nr
+艾夫斯 3 nr
+艾奇伟 5 nr
+艾奇逊 37 nr
+艾奥瓦 15 nr
+艾奥瓦州 10 nrt
+艾姆斯 3 nr
+艾姆赫斯 2 nr
+艾威林 3 nr
+艾婉河 2 nr
+艾子 3 nr
+艾宾浩斯 7 nr
+艾小红 32 nr
+艾尔弗雷德 3 nrt
+艾尔文 7 nr
+艾尔斯 6 nr
+艾尔斯勒 3 nrt
+艾尔斯山 3 nrt
+艾尔斯岩 8 nr
+艾尔斯沃 3 nrt
+艾尔沙 3 nr
+艾尔沙德 5 nrt
+艾尔湖 17 nr
+艾尔米 10 nr
+艾尔维斯 2 nrt
+艾尔芬斯 2 nr
+艾尔莎 2 nrt
+艾尔萨哥 3 nr
+艾尔诺 2 nr
+艾尔顿 3 nr
+艾巴克 2 nr
+艾布拉姆斯 9 nrt
+艾弗森 5 nr
+艾弗里 4 nr
+艾微儿 3 nr
+艾德林 9 nr
+艾德格 2 nr
+艾德沃 9 nr
+艾德礼 16 nr
+艾德蒙 2 nr
+艾思奇 7 nr
+艾托奥 3 nr
+艾拉 4 nrt
+艾拉维 3 nr
+艾拜都 2 nr
+艾捷克 2 nr
+艾提卡 3 nr
+艾文斯 4 nr
+艾文莉 3 nr
+艾斯勒 4 nr
+艾斯尤特 2 nrt
+艾斯普伦 6 nrt
+艾斯美尔 2 nr
+艾春荣 256 nr
+艾晓明 3 nr
+艾曼妞 3 nr
+艾曼纽 3 nr
+艾条灸 3 nr
+艾林瓦 2 nr
+艾森克 10 nr
+艾森施塔特 3 nrt
+艾森豪 4 nr
+艾森豪威 3 nr
+艾森豪威尔 122 nr
+艾比 9 nrt
+艾比湖 13 nr
+艾泽拉斯 3 nr
+艾滋 44 nr
+艾滋玻 2 nr
+艾滋病 1130 n
+艾滋病毒 30 n
+艾滋致 2 nr
+艾滋针 2 nr
+艾火纳 4 nr
+艾灸 18 nr
+艾炷 11 nr
+艾特利 2 nr
+艾瑞克 3 nr
+艾瑟尔 3 nr
+艾瑟尔湖 3 nr
+艾瓦佐夫 2 nr
+艾瓦塔 4 nr
+艾略特 24 nr
+艾知生 3 nr
+艾穆单 3 nr
+艾穆沈 5 nr
+艾穆趁 3 nr
+艾窝窝 4 n
+艾米丽 9 nr
+艾米克 2 nr
+艾米利亚 2 nrt
+艾米尔 8 nr
+艾米莉 3 nr
+艾红军 11 nr
+艾约瑟 3 nr
+艾纳香 3 nr
+艾绒 19 nr
+艾维斯 3 nr
+艾美加 3 nr
+艾美奖 2 nr
+艾美特 3 nr
+艾美虫 7 nr
+艾耶尔 5 nr
+艾能奇 7 nr
+艾自引 3 nr
+艾艾 2 nr
+艾芜 14 nrfg
+艾草 2 nr
+艾莉婕 3 nr
+艾莉诺 2 nr
+艾菲尔 3 nr
+艾菲尔铁塔 12 nr
+艾萨克 11 nr
+艾蒿 6 nr
+艾薇尔 3 nr
+艾谢特 2 nr
+艾贝尔 2 nr
+艾赛义德 2 nr
+艾赛尼 2 nr
+艾赫萨 2 nr
+艾赫迈 2 nr
+艾辛庄 3 nr
+艾连特 2 nr
+艾迪 4 nr
+艾迪德 2 nr
+艾迪森 2 nr
+艾释华 2 nr
+艾释黎 3 nr
+艾里 5 nrt
+艾里克 4 nr
+艾里坎 2 nr
+艾里布 2 nr
+艾里森 4 nr
+艾里甫 3 nr
+艾里逊 2 nr
+艾金 2 n
+艾雅斯 6 nr
+艾雅斯岩 3 nr
+艾青 28 nr
+艾马克 3 nr
+艾马尔 2 nr
+艾马拉 12 nr
+艾默伊 2 nrt
+艾默瑞 4 nr
+艾默生 15 nr
+艾默里 2 nrt
+艾齐纳哈 3 nrt
+艾龙曲 4 nr
+艿 233 x
+节 4822 t
+节下 3 t
+节义 3 n
+节令 75 n
+节会 3 n
+节余 33 n
+节俭 171 a
+节俭力行 3 l
+节俭办 3 i
+节假 3 t
+节假日 208 t
+节减 21 v
+节制 876 v
+节制性 2 n
+节制生育 3 l
+节制资本 3 l
+节前 129 t
+节后 169 t
+节哀 22 v
+节哀顺变 3 i
+节圆 3 n
+节地率 3 n
+节士 3 n
+节外生枝 77 n
+节奏 1173 n
+节奏快 3 n
+节奏性 3 n
+节奏感 58 n
+节奏明朗 3 n
+节奏轻快 3 n
+节妇 3 n
+节子 4 n
+节孔 3 n
+节庆 197 t
+节庆典礼 3 nz
+节庆日 5 t
+节序 3 n
+节度 68 n
+节度使 1545 n
+节录 14 n
+节录自 3 v
+节律 181 n
+节拍 139 v
+节拍器 10 n
+节操 32 n
+节支 11 n
+节敬 3 v
+节数 3 n
+节日 2105 t
+节日快乐 3 i
+节日愉快 3 z
+节日期间 3 l
+节日用品 3 n
+节时 3 t
+节期 10 t
+节本 6 n
+节概 3 n
+节次 5 t
+节欲 47 n
+节民 3 n
+节气 68 n
+节气表 3 n
+节气门 3 n
+节水 97 n
+节水器 3 n
+节水型 5 n
+节油 17 n
+节油器 3 n
+节流 28 n
+节流包载 3 n
+节流压力 3 n
+节流致冷 3 i
+节流过程 3 l
+节流阀 7 n
+节点 451 n
+节点均 2 v
+节点机 6 n
+节点计算机 2 n
+节烈 25 a
+节煤 3 n
+节煤型 3 n
+节片 6 n
+节理 88 n
+节瓜 3 n
+节用 3 v
+节用厚生 3 n
+节用爱民 3 n
+节用裕民 3 n
+节电 22 n
+节电器 2 n
+节电池 2 n
+节略 17 n
+节疤 3 n
+节目 2186 n
+节目主持 3 n
+节目单 50 n
+节目源 2 n
+节目组 16 n
+节目表 3 n
+节目部 3 n
+节目预告 3 n
+节目预报 3 n
+节省 695 n
+节省下 3 v
+节省下来 3 v
+节省开支 3 i
+节省成本 2 l
+节省时间 2 n
+节省能源 3 n
+节礼 3 n
+节税 3 n
+节约 883 n
+节约使用 3 n
+节约型 20 n
+节约开支 3 n
+节约水 3 n
+节约用水 3 n
+节约用电 3 n
+节约用粮 3 n
+节约电池 4 n
+节约粮食 3 n
+节约能源 3 n
+节约资源 5 n
+节线 3 n
+节结 3 v
+节肢 6 n
+节肢动物 76 n
+节育 29 vn
+节育器 17 n
+节育手术 3 n
+节育法 3 n
+节育率 3 n
+节育环 3 n
+节能 274 v
+节能产品 3 n
+节能剂 3 n
+节能器 3 n
+节能型 24 n
+节能灯 11 n
+节能降耗 3 n
+节自 3 v
+节节 2 t
+节节上升 3 l
+节节上涨 3 l
+节节下挫 3 l
+节节胜利 53 n
+节节败退 168 l
+节行 3 v
+节衣缩食 18 n
+节译 3 v
+节资率 2 n
+节足动物 3 n
+节车厢 3 n
+节选 24 v
+节选自 3 nz
+节间 54 t
+节食 56 n
+节骨眼 64 n
+节骨眼儿 19 n
+芄 73 zg
+芈 46 o
+芉 40 zg
+芊 91 x
+芊绵 3 nr
+芊芊 3 nr
+芋 105 zg
+芋头 55 n
+芋头冰 3 n
+芋艿 7 n
+芍 62 n
+芍药 155 n
+芍药居 2 n
+芍药花 13 nz
+芍陂 16 ns
+芎 63 x
+芏 70 x
+芑 43 g
+芒 661 ng
+芒克 2 nrt
+芒刃 3 n
+芒刺 10 n
+芒刺在背 13 i
+芒剌 3 nr
+芒寒色正 3 i
+芒市 14 ns
+芒康 2 ns
+芒康县 4 ns
+芒廷 2 n
+芒戈 5 nrt
+芒果 125 n
+芒果乾 3 nr
+芒果园 2 n
+芒果树 8 n
+芒果汁 3 n
+芒果皮 3 n
+芒状 3 n
+芒硝 73 n
+芒种 18 n
+芒芒苦海 3 i
+芒草 8 n
+芒萁 3 n
+芒角 3 n
+芒鞋竹笠 3 n
+芓 5 zg
+芗 82 ns
+芗剧 4 n
+芗城 8 ns
+芗城区 2 ns
+芘 17 x
+芙 2453 nrt
+芙丽曼 3 nrt
+芙拉 4 nrt
+芙琳 364 nrt
+芙蓉 755 n
+芙蓉出水 3 i
+芙蓉区 3 ns
+芙蓉叶 3 ns
+芙蓉国 3 ns
+芙蓉城 3 ns
+芙蓉姐姐 3 ns
+芙蓉峰 4 ns
+芙蓉并蒂 3 i
+芙蓉楼 3 ns
+芙蓉洞 4 ns
+芙蓉王 3 ns
+芙蓉花 3 ns
+芙蓉路 3 ns
+芙蓉里 2 ns
+芙蓉镇 148 ns
+芜 473 ns
+芜劣 3 a
+芜杂 39 a
+芜湖 262 ns
+芜湖县 7 ns
+芜湖市 14 ns
+芜湖路 3 ns
+芜湖长江大桥 34 ns
+芜秽 3 a
+芜繁 3 a
+芜菁 11 n
+芜菁甘蓝 3 nz
+芜鄙 3 a
+芝 685 ns
+芝兰 15 ns
+芝兰之室 3 nz
+芝兰玉树 3 ns
+芝加哥 349 ns
+芝加哥商品交易所 2 nt
+芝加哥大 3 ns
+芝加哥大学 132 nt
+芝加哥市 7 ns
+芝华士 3 ns
+芝城 3 ns
+芝士 3 ns
+芝山 4 ns
+芝山区 3 ns
+芝焚蕙叹 3 nr
+芝焚蕙汉 3 nr
+芝罘 14 ns
+芝罘区 12 ns
+芝罘岛 5 ns
+芝罘湾 3 ns
+芝艾俱焚 3 v
+芝草无根 3 nz
+芝诺 22 ns
+芝麻 377 n
+芝麻官 28 n
+芝麻小事 3 n
+芝麻开门 3 ns
+芝麻汤圆 3 n
+芝麻油 14 n
+芝麻糊 7 n
+芝麻糖 9 n
+芝麻绿豆 3 n
+芝麻荚 3 n
+芝麻街 3 ns
+芝麻酱 10 n
+芟 115 v
+芟夷 3 v
+芟秋 3 v
+芟繁就简 3 nr
+芟除 9 v
+芠 23 zg
+芡 76 n
+芡实 22 n
+芡粉 3 n
+芣 2 zg
+芤 87 n
+芤脉 2 n
+芥 605 n
+芥兰 5 nrt
+芥子 25 n
+芥子毒气 3 n
+芥子气 13 n
+芥子油 4 n
+芥川 14 nrt
+芥末 21 n
+芥茉 5 n
+芥菜 51 n
+芥菜头 3 n
+芥菜干 3 n
+芥蒂 58 nrt
+芥蓝菜 3 n
+芥酸 5 n
+芦 141 n
+芦丛 3 n
+芦之湖 3 nr
+芦卫国 2 nr
+芦叶 6 n
+芦圹 3 n
+芦城乡 3 ns
+芦山 3 nr
+芦山县 8 ns
+芦州 2 ns
+芦席 26 n
+芦木 3 n
+芦杆 3 n
+芦林潭 2 nr
+芦柑 5 n
+芦柴 4 n
+芦根 27 nr
+芦沟 17 n
+芦沟桥 9 nr
+芦沟河 12 nr
+芦洲 3 ns
+芦洲乡 3 n
+芦淞区 3 nr
+芦溪县 3 nr
+芦潮港 9 nr
+芦盐 3 n
+芦盐区 2 n
+芦盐运 3 n
+芦竹 2 nr
+芦笋 46 n
+芦笋汁 3 v
+芦笙 34 nr
+芦笛 7 nr
+芦笛岩 9 nr
+芦管 8 n
+芦管儿 2 nr
+芦粟 3 n
+芦芜 3 ns
+芦花 846 n
+芦花絮 3 n
+芦花马 3 nr
+芦芽山 8 nr
+芦苇 667 n
+芦苇丛 16 nr
+芦苇沼泽 3 nr
+芦苇荡 12 nr
+芦草 5 n
+芦荟 69 n
+芦荟汁 6 nr
+芦荟胶 3 nz
+芦荟露 3 nr
+芦荻 5 nr
+芦荻秋 3 nr
+芦蒿炒 2 nr
+芦雪庵 9 nr
+芦青河 22 nr
+芨 72 n
+芨芨草 8 n
+芩 43 nr
+芪 87 x
+芫 59 n
+芫花 14 n
+芫荽 24 n
+芬 313 zg
+芬克 3 nrt
+芬克尔 2 nrt
+芬兰 745 ns
+芬兰人 27 nrt
+芬兰共和国 2 ns
+芬兰国防军 5 nt
+芬兰政府 11 nt
+芬兰文 3 nz
+芬兰湾 28 ns
+芬兰话 3 nz
+芬兰语 11 nz
+芬兰队 3 nt
+芬兰马克 7 nrt
+芬利 36 ns
+芬南 2 ns
+芬哉芒苍 3 ns
+芬园 3 ns
+芬太尼 5 nrt
+芬奇 81 nrt
+芬妮 3 nrt
+芬尼 25 nrt
+芬尼根 3 ns
+芬必得 2 nz
+芬斯特 3 nrt
+芬芳 136 nz
+芬芳沁人 3 vn
+芬芳馥郁 3 z
+芬达 5 nrt
+芬郁 3 n
+芬香 3 nrt
+芬馥 3 nrt
+芭 96 n
+芭乐 3 n
+芭乐汁 3 n
+芭堤雅 3 z
+芭子 3 n
+芭比 3 n
+芭比娃娃 3 n
+芭芘娃娃 3 nr
+芭芭拉 3 z
+芭莉 3 n
+芭蕉 139 n
+芭蕉叶 15 n
+芭蕉扇 65 n
+芭蕾 295 n
+芭蕾大师 3 n
+芭蕾舞 97 n
+芭蕾舞剧 27 n
+芭蕾舞剧院 2 n
+芭蕾舞团 103 n
+芭蕾舞者 3 n
+芭蕾舞鞋 3 n
+芮 41 nr
+芮乃伟 10 nr
+芮国忠 6 nr
+芮城 14 ns
+芮城县 17 ns
+芮城西 6 ns
+芮晓武 3 nr
+芮玛丽 4 nr
+芮良夫 9 nr
+芯 900 ng
+芯子 22 n
+芯片 1031 n
+芯片业 3 n
+芯片型号 3 n
+芯片尺寸 3 n
+芯片级 3 n
+芯片组 70 n
+芯线 2 n
+芰 278 g
+花 12710 v
+花万紫 65 nr
+花下 3 n
+花下晒裈 3 nz
+花下死 3 l
+花不棱登 3 i
+花与剑 3 nr
+花与蛇 3 nr
+花丛 189 n
+花丝 65 n
+花中之王 3 nr
+花之友 2 nr
+花之子 2 nr
+花乡 36 n
+花事 3 n
+花亚科 4 nr
+花亚纲 2 nr
+花京院 3 nt
+花仙子 3 nr
+花价 3 n
+花会 50 n
+花似锦 2 nr
+花俏 5 nr
+花信年华 3 nt
+花信灯 2 nr
+花儿 288 n
+花儿乐队 3 nt
+花儿匠 7 n
+花儿样子 3 n
+花儿洞子 3 nr
+花先叶 3 nr
+花光 2 nr
+花光柳影 3 nr
+花光满 2 nr
+花关索 6 nr
+花冈岩 3 ns
+花冈石 3 ns
+花军 5 n
+花农 8 n
+花冠 197 n
+花决 3 v
+花刺 3 n
+花刺子模 15 n
+花剌子 52 nr
+花前月下 23 i
+花剑 64 nr
+花剑影 3 nr
+花匠 30 n
+花卉 524 n
+花卉业 3 n
+花卉图 3 nr
+花卉市场 3 n
+花卉画 3 n
+花卉盆景 3 nr
+花卉种子 3 n
+花卉网 3 n
+花卉节 8 nr
+花卉苗木 3 nr
+花卉草木 3 nr
+花卉装饰 3 n
+花单生 20 nr
+花博会 94 nr
+花博园 43 nr
+花印 3 n
+花卷 28 n
+花厂 3 n
+花厅 224 n
+花县 7 ns
+花友会 3 nr
+花发夫 2 nr
+花台 5 n
+花叶 35 n
+花叶之 2 nr
+花叶病 6 n
+花叶病毒 3 n
+花同株 2 l
+花名 11 n
+花名册 25 nr
+花吐鲁 6 nr
+花含露 2 nr
+花呢 39 n
+花和尚 3 nr
+花哨 39 n
+花四宝 3 nr
+花团锦簇 66 i
+花园 1291 n
+花园别墅 3 n
+花园口 55 ns
+花园城 3 ns
+花园子 7 nr
+花园庄 4 nr
+花园式 12 n
+花园村 3 nr
+花园街 3 ns
+花园路 3 n
+花园酒店 3 n
+花园里 75 nr
+花国 3 ns
+花圃 197 nr
+花圈 75 n
+花土沟 5 ns
+花坛 256 n
+花坞 3 ns
+花坳 2 n
+花型 18 n
+花垣 7 nr
+花垣县 2 ns
+花城 26 ns
+花城出版社 2 nt
+花墙 9 n
+花墟街 3 nr
+花大姐 3 nr
+花大姐姐 4 nr
+花大钱 3 nr
+花天酒地 52 i
+花天锦地 3 i
+花头 26 n
+花奇卉 2 nr
+花奉旨 2 nr
+花奶牛 3 nr
+花好园 3 nr
+花好月圆 10 i
+花如玉 8 nr
+花如雪 3 nr
+花妖狐魅 3 n
+花姑娘 3 nr
+花姑子 3 nr
+花姿 2 n
+花娘 3 n
+花媳妇 2 n
+花媳妇儿 3 n
+花子 54 n
+花子儿 3 nr
+花季 18 t
+花季少女 3 nr
+花完 3 v
+花宗茂 3 nr
+花宝鉴 6 nr
+花家地 5 n
+花家舍 2 nr
+花容 44 n
+花容月貌 47 i
+花容玉貌 3 nr
+花尔彻 2 nr
+花展 5 nr
+花山 288 ns
+花山区 3 ns
+花岗山 3 nr
+花岗岩 1641 nr
+花岗岩石 3 nr
+花岗石 76 nr
+花岗闪 7 nr
+花岛 4 ns
+花岛黎 2 ns
+花工 6 n
+花巧 4 n
+花巷 3 n
+花市 44 n
+花布 84 nr
+花帐 3 n
+花带 3 n
+花帽 24 n
+花序 163 n
+花店 13 n
+花开 3 nr
+花开两朵 3 nr
+花开丫 2 nr
+花开南 2 nr
+花开节 2 nr
+花开花 22 nr
+花开花落 3 i
+花开花谢 3 i
+花开见 2 nr
+花异木 6 nr
+花异石 4 nr
+花异色 2 n
+花弄影 3 nr
+花式 69 n
+花式溜冰 3 nr
+花彩 3 n
+花影 31 n
+花径 7 n
+花徐阶 2 nr
+花得精光 3 nr
+花心 53 n
+花心思 3 nr
+花心血 3 i
+花性 3 n
+花息 2 n
+花房 13 n
+花托 38 nr
+花押 19 v
+花拉子 12 nr
+花招 102 nr
+花招儿 4 nr
+花择累 3 nr
+花拳 4 n
+花拳绣腿 8 l
+花掉 110 v
+花插 19 v
+花攒锦簇 3 i
+花攒锦聚 3 i
+花斑 71 n
+花斑癣 3 n
+花旗 88 nr
+花旗参 2 nr
+花旗银行 65 nt
+花旗集团 10 nt
+花无百日 3 i
+花无百日红 4 l
+花无缺 3 i
+花旦 67 nr
+花明柳媚 3 nr
+花明柳暗 3 i
+花明楼 4 nr
+花晨月夕 3 nr
+花景 3 n
+花更艳 2 nr
+花月之身 3 i
+花月夜 3 t
+花月季 3 t
+花月痕 5 nr
+花朝 2 nr
+花朝月夕 2 i
+花朝月夜 3 i
+花期 67 n
+花木 371 n
+花木兰 272 nr
+花木场 3 n
+花木扶疏 3 nr
+花木秋树 3 nr
+花木网 3 nr
+花朵 448 n
+花朵儿 12 nr
+花束 38 n
+花来花去 3 i
+花林粉阵 3 nr
+花果 63 n
+花果医院 3 nt
+花果山 117 nr
+花果茶 3 nr
+花枝 75 n
+花枝招展 57 i
+花枝招颤 3 i
+花枝招颭 3 ns
+花枪 19 n
+花架 23 n
+花架子 26 n
+花柄 8 n
+花柱 58 nr
+花柱同长 3 n
+花柱异长 3 n
+花柳 12 nr
+花柳巷 3 nr
+花柳病 4 nr
+花柳科 2 nr
+花树 89 n
+花树丛 2 nr
+花栗鼠 3 nr
+花样 520 n
+花样不同 3 l
+花样儿 11 nr
+花样刀 3 n
+花样年华 3 l
+花样新翻 3 nz
+花样游泳 29 l
+花样滑冰 3 n
+花样百出 14 l
+花样繁多 3 l
+花样翻新 32 l
+花格 11 n
+花格子 3 nr
+花格架 3 nr
+花桥公 2 nr
+花桥宫 2 nr
+花桶 3 n
+花梗 17 n
+花梨 12 nr
+花梨加 2 nr
+花梨木 34 nr
+花梨椅 2 nr
+花梨雕 2 nr
+花棍舞 3 n
+花棒 2 n
+花棚 3 n
+花椒 94 n
+花椒树 3 nr
+花椒毒素 3 n
+花椒油 3 n
+花椒盐 3 n
+花椒粉 2 nr
+花椒面 3 n
+花椰菜 24 n
+花楸 8 n
+花楸村 2 nr
+花楼 8 n
+花楼子 2 nr
+花榈木 8 n
+花止芳 7 nr
+花正劳 2 nr
+花正芳 196 nr
+花残月缺 3 i
+花毯 3 n
+花气馨 2 nr
+花水湾 4 nr
+花江 6 ns
+花池 17 n
+花池子 2 nr
+花汤 2 n
+花沙纳 3 nr
+花泥画 3 n
+花海 15 ns
+花海子 3 nr
+花消 2 v
+花港 5 ns
+花溪 7 nr
+花溪区 4 ns
+花溪洞 2 nr
+花溪畔 3 nr
+花溪里 2 nr
+花灌木 3 nr
+花灌田 2 nr
+花灯 262 n
+花灯戏 2 n
+花炮 45 n
+花炮厂 3 nt
+花点 3 n
+花点儿钱 3 n
+花点子 2 nr
+花烛 19 n
+花烛之夜 3 i
+花片 3 n
+花状 3 n
+花猫 7 n
+花玉露 37 nr
+花王 6 nr
+花玛拐 13 nr
+花环 42 nr
+花球 12 n
+花瑞草 2 nr
+花瑶草 2 nr
+花瓜 3 n
+花瓣 488 n
+花瓣儿 15 n
+花瓶 148 n
+花生 950 n
+花生仁 8 nr
+花生壳 3 n
+花生果 2 n
+花生油 37 n
+花生米 53 nr
+花生粉 3 n
+花生糖 2 n
+花生衣 3 n
+花生豆 6 n
+花生酱 18 n
+花生饼 3 n
+花用 3 n
+花田错 3 nr
+花甲 29 nr
+花甲之年 4 nr
+花痴 5 n
+花白 240 nr
+花白色 17 n
+花盆 92 n
+花盆里 3 ns
+花盒 3 n
+花盘 41 n
+花真叶 2 nr
+花眼 58 n
+花知寨 16 nr
+花石 6 n
+花石峡 3 nr
+花石纲 26 nr
+花砖 8 n
+花神 26 n
+花福鹿 2 nr
+花种 10 n
+花科 4 nr
+花穗状 2 nr
+花空 2 n
+花童 2 n
+花笃好 2 nr
+花笔 3 n
+花笺记 10 n
+花筒 2 n
+花箭 3 n
+花篮 79 n
+花篱 3 n
+花簇 3 nr
+花簇锦攒 3 nr
+花籽 6 n
+花籽儿 3 nr
+花粉 262 n
+花粉囊 3 n
+花粉外壁 3 n
+花粉热 3 n
+花粉症 21 n
+花粉管 37 n
+花粉粒 3 n
+花粉蒙导 3 nr
+花精 3 n
+花糕 6 n
+花糖 3 n
+花紫薇 2 nr
+花絮 160 n
+花繁叶茂 3 nr
+花红 30 nr
+花红叶绿 3 nr
+花红柳绿 4 nr
+花红欲燃 3 i
+花红草绿 3 nr
+花纱布 3 nr
+花纳锦 2 nr
+花纸 12 n
+花纸伞 3 n
+花纹 408 n
+花纹板 3 n
+花纹纸 3 n
+花纹花样 3 n
+花纹路 3 n
+花线 4 n
+花经 3 n
+花绒 2 n
+花结 3 v
+花绣 2 n
+花绽放 3 i
+花缎 3 n
+花罗汉 3 nr
+花美男 3 nr
+花群 2 n
+花聚顶 4 n
+花肥 3 n
+花脸 44 n
+花腔 24 n
+花自芳 15 nrfg
+花舞 2 n
+花船 5 n
+花色 413 n
+花色品种 10 n
+花色窗棂 3 nr
+花色素 6 n
+花色素酶 3 n
+花色繁多 3 i
+花色齐全 3 i
+花艳丽 2 nr
+花艺 11 n
+花艺师 2 nr
+花花 12 n
+花花世界 48 n
+花花公子 55 n
+花花哨哨 5 z
+花花太岁 8 n
+花花搭搭 3 z
+花花树 4 nr
+花花点子 3 n
+花花绿绿 104 z
+花花肠子 7 n
+花花草草 12 n
+花芽 26 nr
+花芽分化 3 n
+花苗 3 n
+花苞 20 nr
+花茎 19 n
+花茶 52 n
+花草 232 n
+花草树木 3 nr
+花荣便 6 nr
+花荣听 5 nr
+花荣大 3 nr
+花荣寨 2 nr
+花荣带 2 nr
+花荣抢 2 nr
+花荣拨 3 nr
+花荣挺 4 nr
+花荣笑 3 nr
+花荣见 3 nr
+花荣陪 2 nr
+花药 54 n
+花药培养 3 nr
+花莲 46 nr
+花莲人 3 nr
+花莲县 10 nr
+花莲市 6 nr
+花莲师范 3 nr
+花莲港 9 nr
+花莲溪 2 nr
+花菇 262 n
+花菜 6 n
+花萼 90 n
+花萼相辉 3 n
+花落 3 n
+花落花开 9 i
+花落谁家 14 l
+花蒂 3 nr
+花蔡庆 3 nr
+花蕊 46 n
+花蕊石 3 nr
+花蕾 52 nr
+花薰茶 3 nr
+花虎道 2 nr
+花虫 3 n
+花蜜 53 n
+花蝴蝶 7 nr
+花蝶 3 n
+花蟹 3 n
+花街 32 n
+花街柳巷 3 i
+花街柳市 3 ns
+花街柳陌 3 nr
+花衢柳陌 3 nr
+花衣 10 n
+花衣服 3 n
+花衣裳 3 n
+花衫 3 n
+花被 143 n
+花褶 2 n
+花观景 128 n
+花解语 3 nz
+花言巧语 104 i
+花语 2 nz
+花说柳说 3 i
+花谷正 2 nr
+花豹 16 n
+花貎蓬心 3 z
+花账 3 n
+花贩 3 n
+花贵纱 2 nr
+花费 959 n
+花路 3 n
+花车 25 n
+花车游行 3 nt
+花轴 12 n
+花轿 128 n
+花辰月夕 3 i
+花边 156 n
+花边新闻 5 n
+花边机 3 n
+花边饺 7 n
+花道 3 n
+花遮柳掩 3 i
+花遮柳隐 3 nr
+花部雅 2 nr
+花都 51 ns
+花都区 5 ns
+花都巴黎 3 ns
+花都市 10 ns
+花酒 19 n
+花醇 4 n
+花采 3 n
+花里胡哨 13 nr
+花里胡梢 3 nr
+花重锦 3 nr
+花针 13 n
+花针茅 3 nr
+花钱 858 n
+花钱买 3 ns
+花钱消灾 3 i
+花铁 4 n
+花铁干 223 nr
+花铲 3 n
+花销 72 n
+花锦世界 3 nr
+花键 7 n
+花键孔 4 nr
+花键轴 8 n
+花镜 12 n
+花阶柳市 3 n
+花障 3 n
+花雕 24 n
+花雕酒 3 i
+花露 4 v
+花露水 17 nr
+花露瓶 3 nr
+花青素 17 nr
+花面狸 8 n
+花鞋 26 n
+花音 2 n
+花顶生 2 nr
+花颜月貌 3 i
+花飞散 2 nr
+花饭 3 n
+花饰 13 n
+花饰品 3 n
+花香 131 nr
+花香拂拂 3 nr
+花香调 3 nr
+花香鸟语 3 nr
+花马刘 2 nr
+花马剑 41 nr
+花驴 15 n
+花驴奔 2 nr
+花驴臀 2 nr
+花骨朵 7 n
+花魁 30 n
+花鳅 2 n
+花鸟 240 n
+花鸟画 76 n
+花鸟画家 3 n
+花鸟虫鱼 3 n
+花鸽 3 n
+花黄 3 nr
+花鼓 74 n
+花鼓戏 54 n
+花鼓舞 3 i
+花鼠 11 n
+芲 21 zg
+芳 858 nr
+芳主 3 n
+芳兰竞体 3 n
+芳兰竟体 3 vn
+芳华 6 nz
+芳华虚度 3 n
+芳名 36 n
+芳名录 3 n
+芳唇 3 n
+芳城园 3 n
+芳基 16 n
+芳基化 3 nz
+芳姿 4 n
+芳容 7 n
+芳年华月 3 n
+芳心 76 n
+芳心另许 3 vn
+芳心无主 3 n
+芳意 3 n
+芳星园 3 n
+芳村 6 n
+芳村区 3 n
+芳樟醇 2 nz
+芳正离子 3 n
+芳泽 6 n
+芳烃 86 n
+芳烃抽提 3 i
+芳纶 10 n
+芳苑 3 n
+芳草 101 n
+芳草园 3 n
+芳草地 7 n
+芳菲 21 nrt
+芳菲尽 3 n
+芳菲苑 2 nrt
+芳言 3 n
+芳讯 3 nz
+芳踪 3 n
+芳辰 3 n
+芳邻 6 n
+芳郁 3 n
+芳香 355 n
+芳香剂 3 nz
+芳香化 28 nz
+芳香化浊 2 n
+芳香化湿 3 nz
+芳香工业 3 n
+芳香性 3 n
+芳香族 35 nz
+芳香族化合物 19 nz
+芳香植物 3 n
+芳香油 3 n
+芳香烃 3 n
+芳香醛 2 nz
+芳馥 3 nrt
+芳馨 3 n
+芳魂 3 n
+芳龄 13 n
+芴 34 g
+芵 7 zg
+芷 164 ns
+芷江 27 ns
+芷江侗族自治县 7 ns
+芸 374 n
+芸芸 5 z
+芸芸众生 44 i
+芸薹 11 n
+芸豆 14 n
+芸香 67 n
+芸香苷 3 n
+芸香草 3 n
+芹 70 nr
+芹菜 97 n
+芹菜汤 3 n
+芺 3 zg
+芽 496 n
+芽体 15 n
+芽儿 8 n
+芽孢 100 n
+芽尖 3 n
+芽庄 2 n
+芽接 14 n
+芽甘蓝 3 n
+芽眼 5 n
+芽苗菜 2 n
+芽苞 2 n
+芽茶 11 n
+芽蕉 3 n
+芽豆 3 n
+芽选择 3 n
+芾 75 x
+苁 108 x
+苁蓉 6 n
+苄 88 x
+苄基 3 nz
+苄胺 2 nz
+苇 125 zg
+苇丛 14 n
+苇叶 11 n
+苇塘 22 n
+苇子 122 n
+苇岸 2 n
+苇帘子 3 n
+苇席 409 n
+苇河 2 n
+苇眉子 3 n
+苇箔 5 n
+苇草 4 n
+苇荡 3 n
+苈 39 x
+苊 33 g
+苋 81 n
+苋科 3 n
+苋菜 45 n
+苌 77 nr
+苌弘化碧 3 nr
+苌弘碧血 3 nr
+苍 332 nr
+苍之涛 3 nr
+苍冥 3 a
+苍凉 143 a
+苍劲 84 a
+苍南 4 ns
+苍南县 4 ns
+苍双剑 2 nr
+苍古 4 ns
+苍哑 3 a
+苍大头 2 nr
+苍天 219 nr
+苍天录 3 nr
+苍天笑 3 nr
+苍头 29 n
+苍山 87 ns
+苍山县 8 ns
+苍岩山 11 nr
+苍术 18 n
+苍术苷 3 n
+苍松 73 a
+苍松翠柏 19 nr
+苍桑 2 nr
+苍梧 34 a
+苍梧县 8 ns
+苍民 3 n
+苍泪 3 n
+苍浑 5 z
+苍海 3 ns
+苍海郡 4 nr
+苍润 6 n
+苍渔隐 50 nr
+苍溪 8 nr
+苍溪南 2 nr
+苍溪县 2 ns
+苍然 10 z
+苍狗白云 3 nr
+苍狗白衣 3 nr
+苍生 101 nr
+苍生之 11 nr
+苍生任 2 n
+苍生何 3 nr
+苍生圣 4 nr
+苍生涂 2 z
+苍生涂炭 3 n
+苍生鼓 2 z
+苍白 726 z
+苍白无力 27 l
+苍白球 4 n
+苍白色 3 n
+苍穹 63 n
+苍翠 63 nr
+苍翠欲滴 2 nr
+苍老 239 a
+苍耳 5 nr
+苍耳子 6 nr
+苍苍 68 z
+苍苍茫茫 6 z
+苍茫 168 z
+苍茫大地 3 z
+苍莽 5 nr
+苍蝇 362 n
+苍蝇儿 3 z
+苍蝇拍 3 vn
+苍蝇水 3 vn
+苍蝇粉 3 vn
+苍蝇纸 3 vn
+苍蝇见血 3 v
+苍郁 11 a
+苍铅 3 nr
+苍颉篇 2 nr
+苍颜 3 nr
+苍颜白发 3 nr
+苍髯如戟 3 nr
+苍髯童 2 nr
+苍鹭 13 nr
+苍鹰 38 nr
+苍黄 11 z
+苍黄反复 3 l
+苍黄翻复 3 nr
+苍黄翻覆 3 nr
+苍黑 8 z
+苍鼠 3 n
+苍龙 39 nr
+苎 47 n
+苎麻 125 n
+苎麻根 3 n
+苏 3869 j
+苏三国 3 ns
+苏三山 3 ns
+苏世荣 14 nr
+苏东 4 ns
+苏东坡 77 ns
+苏中 96 ns
+苏中七 2 nr
+苏中军区 6 nt
+苏中立 2 nr
+苏中英 2 nr
+苏丹 941 ns
+苏丹人 21 nr
+苏丹共和国 13 ns
+苏丹政府 5 nt
+苏丹红 3 nr
+苏习之 15 nr
+苏二州 2 nr
+苏云金 9 nr
+苏亚佐 3 nr
+苏亚雷 2 nr
+苏亚雷斯 13 ns
+苏京 2 ns
+苏人 2 ns
+苏仙区 3 ns
+苏仙岭 3 nr
+苏伊士 63 nr
+苏伊士湾 21 ns
+苏伊士运河 163 ns
+苏体 3 n
+苏俄 175 ns
+苏保衡 2 nr
+苏信东 3 nr
+苏元春 3 nr
+苏兆征 102 nr
+苏克 7 ns
+苏克萨 107 nr
+苏克达斯 3 ns
+苏克雷 26 nr
+苏公祠 5 nr
+苏六朋 2 nr
+苏共 160 j
+苏共中央 71 nt
+苏兹达 2 nr
+苏冈 3 ns
+苏军 580 nr
+苏刘义 3 nr
+苏利 3 ns
+苏利南 3 ns
+苏利文 2 nr
+苏利曼 5 nr
+苏利民 2 nr
+苏利纳 4 ns
+苏利耶 5 nr
+苏制安 3 nr
+苏剧 3 n
+苏加诺 23 nr
+苏北 282 ns
+苏区 440 ns
+苏区中央局 14 nt
+苏南 187 ns
+苏南地区 6 ns
+苏博尔 5 nr
+苏占区 4 ns
+苏卡乔 2 nr
+苏厄德 5 nr
+苏双碧 2 nr
+苏发努 5 nr
+苏叔阳 4 nr
+苏台定 2 ns
+苏台德 43 nr
+苏台督 2 nr
+苏号朋 3 nr
+苏合散 3 nr
+苏合香 5 nr
+苏吴 3 ns
+苏呼米 2 nr
+苏哈亚迪 3 ns
+苏哈尔亚蒂 2 nrt
+苏哈托 41 nr
+苏哈迈特 2 nrt
+苏四侠 5 nr
+苏四哥 4 nr
+苏园 24 ns
+苏园笑 2 nr
+苏圣玛 7 nr
+苏埠屯 5 nr
+苏堤 21 nr
+苏堤春 6 nr
+苏塞克斯 3 ns
+苏多欢 2 nr
+苏天爵 4 nr
+苏奇科 3 nr
+苏姆盖 3 nr
+苏威 11 ns
+苏威孚 3 nr
+苏娅辉 2 nr
+苏子 19 nr
+苏宁 298 ns
+苏宁欲 2 nr
+苏宁高 3 nr
+苏宁龙 2 nr
+苏安凯 2 nr
+苏定 2 ns
+苏定方 8 nr
+苏家屯 7 nr
+苏家屯区 3 ns
+苏家庄 3 nr
+苏家来 2 nr
+苏家渡 2 nr
+苏家驹 9 nr
+苏富扬 4 nr
+苏富比 10 ns
+苏小宝 26 nr
+苏小小 6 j
+苏尔 18 ns
+苏尔古 2 ns
+苏尔坦 15 ns
+苏尔泽 2 nr
+苏尔特 8 nr
+苏尔瓦 3 ns
+苏尔登 35 nr
+苏尔诗 6 nr
+苏尔达 6 nr
+苏尼尔 2 nr
+苏尼特 2 nr
+苏尼特右旗 4 ns
+苏尼特左旗 3 ns
+苏山岛 2 ns
+苏峪口 3 ns
+苏峻祖 2 nr
+苏峻起 3 nr
+苏州 1646 ns
+苏州人 70 nr
+苏州企业 3 nz
+苏州园林 3 ns
+苏州地区 5 ns
+苏州城 3 ns
+苏州大学 23 nt
+苏州工业园区 4 ns
+苏州市 122 ns
+苏州房产 3 n
+苏州旅游 3 nz
+苏州河 29 ns
+苏州电信 3 nt
+苏州码 3 n
+苏州码子 3 ns
+苏州网 3 nz
+苏州街 3 ns
+苏州酒店 3 ns
+苏州高新区 2 ns
+苏布台 2 ns
+苏师弟 4 nr
+苏常柴 4 nr
+苏幕遮 3 nr
+苏平 3 ns
+苏平胃 2 nr
+苏库尔 2 nr
+苏库马 2 ns
+苏廷石 3 nr
+苏建 2 ns
+苏式 33 n
+苏式彩画 3 nr
+苏弗里 2 nr
+苏德尔 2 nr
+苏德忠 2 nr
+苏德隆 2 nr
+苏必利尔 10 ns
+苏必利尔湖 41 ns
+苏必略湖 3 ns
+苏志 3 ns
+苏志燮 3 nr
+苏悉地 3 ns
+苏惠娟 2 nr
+苏惠渔 2 nr
+苏慧伦 256 nr
+苏打 286 ns
+苏打水 3 nr
+苏打粉 3 nr
+苏打饼干 3 nz
+苏托夫 4 nr
+苏承辉 6 nr
+苏拉 36 ns
+苏拉塔 2 nr
+苏拉威 29 ns
+苏拉威西 7 ns
+苏拉河 3 ns
+苏拉特 13 nr
+苏振华 4 nr
+苏教版 3 n
+苏文协 2 nt
+苏文卿 8 nr
+苏文忠 3 nr
+苏斯 14 ns
+苏斯河 3 ns
+苏斯洛 40 nr
+苏斯特 32 nr
+苏方 21 nr
+苏旦 3 ns
+苏昆生 2 nr
+苏易简 5 nr
+苏星河 143 ns
+苏晋 3 j
+苏晓东 2 nr
+苏普依 2 nr
+苏普叹 2 nr
+苏普喜 2 nr
+苏普大 6 ns
+苏普奇 2 nr
+苏普奔 2 nr
+苏普忙 2 nr
+苏普怒 2 nr
+苏普扶 2 nr
+苏普抢 4 nr
+苏普横 2 nr
+苏普站 2 nr
+苏普竟 2 nr
+苏普笑 8 nr
+苏普续 2 nr
+苏普翻 2 nr
+苏普舒 2 nr
+苏普若 2 nr
+苏普见 4 nr
+苏普解 2 nr
+苏普身 4 nr
+苏普转 2 nr
+苏普送 2 nr
+苏普长 2 nr
+苏曼殊 24 nr
+苏有朋 3 nr
+苏木 203 ns
+苏李诗 3 nr
+苏来 2 ns
+苏来曼 2 nr
+苏杭 53 ns
+苏杰生 2 nr
+苏松太 4 nr
+苏松粮 2 nr
+苏林 139 ns
+苏林家族 4 nz
+苏果 8 ns
+苏果超市 8 ns
+苏格兰 539 ns
+苏格兰人 47 nrt
+苏格拉底 684 ns
+苏梅克 2 nr
+苏梅岛 15 nr
+苏梦清 4 nr
+苏欧 4 ns
+苏欧司 4 nt
+苏步青 14 nr
+苏武 49 nr
+苏比克 6 ns
+苏比克湾 2 ns
+苏比拉 2 ns
+苏毕胡 4 nr
+苏毗 7 n
+苏氏改 2 nr
+苏民生 2 nr
+苏氨酸 5 nz
+苏永康 3 nr
+苏汉臣 3 nr
+苏江 2 ns
+苏沃洛 25 nr
+苏沪杭 6 nr
+苏河 12 ns
+苏河发源 2 ns
+苏泊尔 4 ns
+苏波 4 ns
+苏泽尔 4 nr
+苏洵 23 nr
+苏浙 15 j
+苏浙沪 2 nr
+苏浙皖 8 nr
+苏浙镇 2 nr
+苏海南 2 ns
+苏海韩潮 3 nr
+苏淮埃 3 ns
+苏淳一 2 nr
+苏淳会 2 nr
+苏淳叹 2 nr
+苏淳吓 2 nr
+苏淳才 2 nr
+苏淳皱 2 nr
+苏淳真 2 nr
+苏源仙 34 nr
+苏满塔 4 nr
+苏满营 2 nr
+苏澳 27 ns
+苏澳港 2 ns
+苏澳湾 2 ns
+苏灵扬 3 nr
+苏炳文 3 nr
+苏特尔 2 nr
+苏玉华 3 nr
+苏珊 21 ns
+苏珊娜 8 nr
+苏理宁 2 nr
+苏瓦 20 ns
+苏瓦松 4 nr
+苏白 6 nr
+苏皖 14 j
+苏皮卢 3 nr
+苏真斯 2 nr
+苏祥新 3 nr
+苏禄 30 nr
+苏禄东 2 nr
+苏禄海 6 nr
+苏禄王 2 nr
+苏秉琦 7 nr
+苏秦 101 nr
+苏秦张 2 nr
+苏秦皆 3 nr
+苏纳 8 ns
+苏纳海 4 ns
+苏绣 20 nr
+苏维埃 1255 ns
+苏维埃共和国 28 ns
+苏维埃政府 1175 nt
+苏维尔 2 nr
+苏维汇 4 ns
+苏维迪 2 nr
+苏罗河 3 ns
+苏美 9 ns
+苏美人 3 nr
+苏美尔 98 nr
+苏美曲 2 ns
+苏美英 10 nr
+苏联 7443 ns
+苏联国家安全委员会 5 nt
+苏联地区 8 j
+苏联政府 123 nt
+苏联最高苏维埃 48 nt
+苏联红军 109 nt
+苏联部长会议 34 nt
+苏联队 7 nt
+苏舜卿 8 nr
+苏舜钦 15 nr
+苏芬战争 3 nr
+苏花公路 3 ns
+苏苏 3 ns
+苏苏人 2 nr
+苏茂相 5 nr
+苏荃笑 6 nr
+苏荣连 4 nr
+苏莱姆 2 nr
+苏莱曼 45 nr
+苏菜 6 n
+苏菲 10 nr
+苏菲亚 197 nr
+苏菲派 4 nr
+苏萨 9 ns
+苏萨城 2 ns
+苏萨宁 8 ns
+苏衣糖 8 nr
+苏西 3 ns
+苏西洛 3 nr
+苏谊香 2 nr
+苏贞昌 33 nr
+苏赫巴 13 nr
+苏赫拉 3 nr
+苏轼 258 nr
+苏辙 36 nr
+苏达 3 ns
+苏达米 2 nr
+苏达索 2 nr
+苏达耶 2 nr
+苏连托 3 nr
+苏迪曼 2 nr
+苏迪曼杯 12 nz
+苏迪约 2 ns
+苏醒 190 nr
+苏醒剂 3 nr
+苏醒过来 3 nr
+苏里 2 ns
+苏里亚 10 ns
+苏里兰 16 ns
+苏里南 62 ns
+苏里南共和国 3 ns
+苏里曼 18 nr
+苏里江 2 ns
+苏里玛 3 nr
+苏里科 3 nr
+苏铁 88 nr
+苏铁林 3 nr
+苏铁类 2 nr
+苏锡常 2 nr
+苏门 7 ns
+苏门答腊 106 ns
+苏门答腊岛 81 ns
+苏门答腊虎 2 ns
+苏门羚 296 n
+苏门达腊岛 2 ns
+苏门达腊虎 2 nz
+苏阿索 3 nr
+苏陀 3 ns
+苏霍伊 34 nr
+苏霍依 2 nr
+苏霍夫 5 nr
+苏霍姆 6 nr
+苏霍沃 4 nr
+苏静怡 3 nr
+苏非 32 ns
+苏非导师 2 nr
+苏非教派 3 nr
+苏非派 22 nr
+苏飞霞 3 nr
+苏马 2 ns
+苏鲁 4 ns
+苏鲁克 301 nr
+苏鲁尔 2 nr
+苏鲁德 3 nr
+苏鲁皖 3 nr
+苏鲁豫 17 nr
+苏鸿业 4 nr
+苏麻喇 95 nr
+苏黎世 156 nr
+苏黎世大学 15 nt
+苏黎世市 3 ns
+苏黎士 16 ns
+苑 517 nr
+苑仙葩 2 nr
+苑初转 2 nr
+苑囿 17 n
+苑太监 2 nr
+苑学政 7 nr
+苑家屯 3 nr
+苑川城 2 nr
+苑川王 3 nr
+苑川郡 3 nr
+苑广成 4 nr
+苑德军 2 nr
+苑文炳 3 nr
+苑派湫 2 nr
+苑流风 3 nr
+苑深宫 2 nr
+苑琼丹 3 nr
+苑监官 3 nr
+苑维伟 9 nr
+苑维玮 13 nr
+苑菁华 3 nr
+苑西筑 2 nr
+苑里 3 nr
+苒 12 x
+苓 21 x
+苓耳 3 n
+苔 578 ng
+苔丝 3 n
+苔原 76 n
+苔原气候 3 l
+苔状纤维 3 l
+苔癣 3 n
+苔类 3 n
+苔绿 3 n
+苔绿色 3 n
+苔草沼泽 3 v
+苔藓 173 n
+苔藓植物 45 l
+苔衣 3 n
+苕 1115 n
+苕子 5 n
+苕帚 3 n
+苖 2 zg
+苗 1209 n
+苗丰强 2 nr
+苗丹民 3 nr
+苗乔伟 3 nr
+苗乙乙 3 nr
+苗乡 12 nz
+苗人 3 n
+苗人凤 525 nr
+苗侨伟 3 nr
+苗儿 8 nr
+苗兵攻 2 nr
+苗其巍 6 nr
+苗刘二 2 nr
+苗剧 3 n
+苗可秀 3 nr
+苗向导 2 nr
+苗圃 49 nr
+苗圃场 3 n
+苗土 3 n
+苗圩 2 nrfg
+苗大侠 75 nr
+苗大哥 2 nr
+苗夫人 19 nr
+苗头 67 n
+苗女 27 n
+苗子 147 nr
+苗家 40 n
+苗家剑 19 nr
+苗家女子 4 nr
+苗家社 3 nr
+苗小苗 2 nr
+苗床 3 nz
+苗情 3 n
+苗文 4 nz
+苗族 1310 nz
+苗期 29 n
+苗木 72 nr
+苗木网 3 nz
+苗木花卉 3 nr
+苗条 160 n
+苗条身材 3 n
+苗栗 20 nr
+苗栗人 3 nr
+苗栗县 7 nr
+苗栗市 3 ns
+苗民弗 2 nz
+苗沛霖 2 nr
+苗瑶语 3 nr
+苗田 6 nz
+苗疆中 3 ns
+苗祖洞 2 nr
+苗种 8 n
+苗立杰 2 nr
+苗粟县 3 nr
+苗翠花 3 nr
+苗而不秀 3 i
+苗肥 3 n
+苗脉 2 n
+苗芽 3 nr
+苗苗 19 n
+苗若兰 221 nr
+苗范田 10 nr
+苗裔 19 nr
+苗语 9 nz
+苗语支 9 nr
+苗诺夫 6 nr
+苗贲皇 5 nr
+苘 7 n
+苘麻 8 n
+苛 270 a
+苛全 3 a
+苛刻 254 a
+苛吏 3 n
+苛岚 3 n
+苛征 3 n
+苛待 3 v
+苛性 3 n
+苛性碱 5 l
+苛性纳 3 v
+苛性钠 2 n
+苛性钾 3 n
+苛扣 3 n
+苛捐 3 vn
+苛捐杂税 57 i
+苛政 46 n
+苛政猛于虎 4 l
+苛敛 3 v
+苛杂 3 a
+苛求 81 v
+苛法 3 n
+苛细 4 a
+苛评 3 v
+苛责 22 v
+苛遇 3 n
+苜 6 zg
+苜蓿 75 n
+苜蓿草 2 n
+苞 294 ng
+苞片 90 n
+苞米 8 n
+苞苴竿牍 3 n
+苞衣 3 n
+苞谷 11 n
+苟 312 nr
+苟不能 3 v
+苟且 65 nr
+苟且之心 3 i
+苟且偷安 9 i
+苟且偷生 39 i
+苟从 3 v
+苟仲文 6 nr
+苟免 2 v
+苟全 10 nr
+苟全性命 12 i
+苟利国家生死以 5 i
+苟合 14 v
+苟合取容 3 i
+苟同 23 v
+苟存 3 v
+苟安 38 nr
+苟安一隅 3 i
+苟延残喘 54 i
+苟延残息 3 i
+苟建丽 2 nr
+苟有 3 v
+苟活 40 v
+苟能 3 v
+苟读 3 v
+苡 76 g
+苢 2 zg
+苣 61 x
+苣荬菜 3 n
+苤 82 n
+苤蓝 3 n
+若 17000 c
+若不慎 3 i
+若不然 3 c
+若且唯若 3 i
+若丧考妣 3 i
+若为 3 c
+若于 3 c
+若以 3 c
+若何 142 r
+若使 3 c
+若依杨 4 nr
+若克琳 17 nr
+若兴兵 2 nr
+若冠玉 2 nr
+若冰霜 2 nr
+若列藩 2 nr
+若即若离 28 i
+若卵投石 3 nr
+若司马懿 7 nr
+若合符 3 nr
+若合符节 3 i
+若夫 3 nr
+若夫吾 2 nr
+若姊弟 2 nr
+若存若亡 3 i
+若容杨 2 nr
+若小林 2 nr
+若尔当 6 nrt
+若尔盖 31 nr
+若尔盖县 5 nr
+若崩厥角 3 i
+若巨雷 3 nr
+若干 6633 m
+若干个 451 m
+若干亿年 2 m
+若干代 7 m
+若干份 130 m
+若干位 2 m
+若干倍 43 m
+若干具 11 m
+若干分 5 m
+若干列 3 m
+若干匹 4 m
+若干名 36 m
+若干吨 3 m
+若干员 3 m
+若干块 19 m
+若干处 6 m
+若干天 8 m
+若干头 3 m
+若干套 2 m
+若干封 3 m
+若干层 4 m
+若干幅 2 m
+若干年 194 m
+若干座 3 m
+若干意见 3 i
+若干招 2 m
+若干支 7 m
+若干服 3 m
+若干条 24 m
+若干枚 9 m
+若干根 2 m
+若干次 30 m
+若干段 6 m
+若干点 3 m
+若干片 7 m
+若干目 2 m
+若干种 32 m
+若干章 5 m
+若干篇 5 m
+若干类 19 m
+若干粒 2 m
+若干级 2 m
+若干组 22 m
+若干股 3 m
+若干艘 2 m
+若干节 2 m
+若干辆 2 m
+若干部 5 m
+若干镑 2 m
+若干门 11 m
+若干面 2 m
+若干项 4 m
+若干首 5 m
+若弃城 2 nr
+若引兵 2 nr
+若弘照 3 nr
+若怒龙 2 nr
+若性空 2 nr
+若想 105 nr
+若成丁 2 nr
+若敖之鬼 3 nr
+若敖鬼馁 3 v
+若斯潘 10 nr
+若无 3 i
+若无其事 169 i
+若明若昧 3 i
+若明若暗 8 i
+若星汉 2 nr
+若昧平生 3 i
+若是 70 c
+若曦会 2 nr
+若有志 16 nr
+若有情 3 i
+若有所丧 3 i
+若有所亡 3 i
+若有所失 16 i
+若有所思 113 i
+若有若无 3 i
+若朗星 4 nr
+若期望 16 nr
+若果 42 c
+若泽一世 2 nr
+若洪钟 4 nr
+若涉渊冰 3 nr
+若涉渊水 3 nr
+若热 11 nrt
+若烹小鲜 3 i
+若然 43 c
+若瑟 5 nrt
+若真 7 nr
+若祚宗 2 nr
+若离若即 3 i
+若端 4 m
+若续 2 v
+若羌 36 nrt
+若羌县 13 ns
+若耶江 2 nr
+若耶溪 2 nr
+若苗空 3 nr
+若苗紫 3 nr
+若苗紫苑 3 nr
+若葭萌 2 nr
+若蒙恩 3 nr
+若虫 47 nr
+若蜀兵 5 nr
+若街亭 2 nr
+若要 3 c
+若要人不知 16 i
+若辈 3 m
+若迁延 2 nr
+若遂凌 2 nr
+若遇明 2 nr
+若郭靖 3 nr
+若释重负 3 i
+若银铃 2 nr
+若隐若显 3 nr
+若隐若现 57 i
+若雷霆 3 nr
+若雷震 9 nr
+若需 3 n
+若非 637 c
+若魏延 2 nr
+若龙吟 11 nr
+苦 4796 a
+苦丁茶 3 n
+苦上加苦 3 i
+苦不可言 3 i
+苦不堪言 66 i
+苦中作乐 12 i
+苦主 27 n
+苦乐 32 n
+苦乐不均 3 ns
+苦乐观 2 n
+苦事 5 n
+苦于 247 v
+苦修 26 v
+苦僧 3 n
+苦其心志 7 i
+苦况 3 n
+苦刑 21 n
+苦力 116 n
+苦劝 58 v
+苦功 44 a
+苦功夫 3 n
+苦劳 34 a
+苦卤 3 n
+苦去甘来 3 i
+苦参 5 n
+苦参碱 3 n
+苦参素 3 n
+苦口 11 n
+苦口婆心 50 i
+苦口良药 2 i
+苦口逆耳 3 i
+苦味 83 n
+苦味素 3 n
+苦味道 3 v
+苦味酸 22 n
+苦命 127 n
+苦咸水 3 ns
+苦哈哈 3 ns
+苦土 3 n
+苦地丁 3 n
+苦境 9 n
+苦处 63 n
+苦夏 3 n
+苦大仇深 20 i
+苦大良药 3 i
+苦头 401 n
+苦学 28 n
+苦学多年 3 l
+苦学成名 3 n
+苦学有成 3 n
+苦守 3 v
+苦害 3 v
+苦寒 51 n
+苦尽甘来 24 i
+苦尽甜来 4 i
+苦工 14 n
+苦差 14 n
+苦差事 18 i
+苦干 65 n
+苦干实干 3 l
+苦度 3 n
+苦役 91 n
+苦心 213 n
+苦心人 7 n
+苦心孤诣 32 i
+苦心弧诣 3 n
+苦心焦思 3 n
+苦心积虑 3 i
+苦心经营 65 i
+苦思 149 n
+苦思冥想 27 i
+苦思对策 3 n
+苦思苦想 3 i
+苦恋 3 v
+苦恼 512 a
+苦情 30 n
+苦感 3 n
+苦戏 3 n
+苦战 233 v
+苦挣 3 v
+苦斗 55 n
+苦旅 6 n
+苦无对策 3 i
+苦日子 3 n
+苦木 8 n
+苦木素 3 n
+苦杏仁 3 i
+苦来由 3 d
+苦果 60 n
+苦树 3 n
+苦楚 162 a
+苦楝 9 n
+苦楝树 21 n
+苦楝皮 3 n
+苦槠 5 n
+苦水 95 n
+苦水河 5 n
+苦汁 3 n
+苦求 17 v
+苦活 7 a
+苦活儿 3 n
+苦海 66 n
+苦海无边 19 i
+苦海茫茫 3 i
+苦涩 210 a
+苦涩味 2 n
+苦涩感 3 n
+苦熬 58 a
+苦瓜 62 n
+苦瓜粉 3 n
+苦瓜脸 3 i
+苦甘 3 v
+苦留 30 v
+苦痛 85 a
+苦相 19 n
+苦短 3 v
+苦石莲 3 n
+苦竹 13 n
+苦竹叶 3 n
+苦笑 908 v
+苦累 3 v
+苦练 260 a
+苦练内功 3 n
+苦经 3 d
+苦维 3 n
+苦缺 3 a
+苦肉计 40 i
+苦胆 8 n
+苦艾 5 n
+苦节 3 n
+苦苓林 3 n
+苦苣 3 n
+苦苦 581 a
+苦苦哀求 3 i
+苦苦相求 3 i
+苦苦相逼 3 i
+苦英英 3 n
+苦荞 2 n
+苦荞麦 3 v
+苦药 3 n
+苦菜 3 n
+苦菜花 3 n
+苦行 67 v
+苦行僧 18 n
+苦行者 3 n
+苦衷 188 n
+苦衷太后 3 i
+苦读 94 v
+苦读出身 3 n
+苦调 3 v
+苦豆草 3 n
+苦身焦思 3 n
+苦辛 3 a
+苦辣酸甜 3 l
+苦过来 3 d
+苦酒 21 n
+苦酒满杯 3 n
+苦闷 238 a
+苦难 585 a
+苦难深重 3 i
+苦集灭道 3 n
+苦雨 6 n
+苦雨凄风 3 i
+苦麻菜 2 n
+苫 237 v
+苫块 3 n
+苫垫 3 n
+苫子 3 n
+苫布 6 n
+苫盖 6 n
+苫眼铺眉 3 n
+苭 3 zg
+苯 1079 n
+苯丁酸 2 nz
+苯三酚 3 nz
+苯丙 3 nz
+苯丙氨酸 31 nz
+苯丙胺 3 nz
+苯丙酮 11 nz
+苯丙酸诺龙 3 nz
+苯中毒 3 nz
+苯乙 3 n
+苯乙烯 58 nz
+苯乙胺 2 nz
+苯乙酮 8 nz
+苯乙酸 4 nz
+苯二甲基 3 nz
+苯二胺 19 nz
+苯二酚 3 nz
+苯加氢 3 n
+苯基 40 nz
+苯妥英 11 nz
+苯妥英钠 3 nz
+苯巴比妥 14 nz
+苯并二嗪 3 n
+苯并呋喃 3 n
+苯并咪唑 2 n
+苯并芘 20 n
+苯并菲 3 n
+苯教 5 nz
+苯海拉明 4 nz
+苯环 44 n
+苯甲 10 n
+苯甲基 3 nz
+苯甲酰基 3 nz
+苯甲酸 117 nz
+苯甲酸钠 48 nz
+苯甲醚 3 nz
+苯硫脲 3 nz
+苯硫酚 3 nz
+苯磺酸 4 nz
+苯肼 11 nz
+苯胺 56 nz
+苯胺点 3 n
+苯胺紫 3 n
+苯胺蓝 3 nz
+苯苯 3 nz
+苯酚 103 nz
+苯醌 15 nz
+苯醚 8 n
+苯鸟先飞 3 n
+苰 4 zg
+英 7579 j
+英业达 4 nt
+英东 2 ns
+英主 3 n
+英之杰 4 nr
+英亩 293 q
+英亲王 4 nr
+英仙座 15 nz
+英伦 41 ns
+英伦三岛 23 ns
+英伦海峡 3 ns
+英伽登 3 nz
+英俊 441 nr
+英俊小子 3 nr
+英俊小生 3 nr
+英俊潇洒 3 nr
+英保通 15 nr
+英兵 3 nz
+英军 666 j
+英冠 16 n
+英利 7 ns
+英制 24 n
+英加登 3 ns
+英勇 1435 nr
+英勇作战 3 i
+英勇善战 3 i
+英勇壮举 3 i
+英勇斗争 3 n
+英勇无畏 3 i
+英勇献身 3 nr
+英华 40 nz
+英华殿 19 ns
+英双语 2 nz
+英发 3 nz
+英吉利 106 ns
+英吉利海 3 ns
+英吉利海峡 3 ns
+英吉林 3 ns
+英吉沙 13 ns
+英吉沙县 2 ns
+英名 122 m
+英名扫地 3 i
+英名永存 3 nr
+英名盖世 4 i
+英吨 3 m
+英哩 3 nr
+英商 6 n
+英商义 2 nz
+英商亦 2 nr
+英商宝 3 nz
+英商怡 2 nr
+英商祥 2 nr
+英商立 2 nz
+英国 14049 ns
+英国上议院 2 nt
+英国上院 2 nt
+英国下院 8 nt
+英国人 770 nz
+英国伦敦 3 ns
+英国伦敦大学 27 nt
+英国伦敦经济学院 19 nt
+英国公司 16 nt
+英国内政部 3 nt
+英国利兹大学 2 nt
+英国剑桥大学 58 nt
+英国协 3 nt
+英国史 3 nz
+英国国防部 80 nt
+英国圣公会 18 nt
+英国外交部 23 nt
+英国大学 5 nt
+英国女王 3 nz
+英国工党 16 nt
+英国广播公司 50 nt
+英国广播电台 3 nt
+英国式 24 nz
+英国政府 228 nt
+英国文化委员会 2 nt
+英国文学 3 nt
+英国曼彻斯特大学 10 nt
+英国法 8 nz
+英国海军 193 nt
+英国牛津 10 ns
+英国牛津大学 59 nt
+英国皇家 3 ns
+英国皇家学会 144 nt
+英国皇家海军 71 nt
+英国皇家空军 33 nt
+英国皇家芭蕾舞团 5 nt
+英国管 3 nz
+英国航空公司 21 nt
+英国议会 338 nt
+英国诗 3 nr
+英国钢铁公司 3 nt
+英国队 4 nt
+英国首相 3 nz
+英国高等法院 2 nt
+英士 7 ns
+英声欺人 3 i
+英声茂实 3 nr
+英女王 3 nr
+英姿 28 nz
+英姿勃勃 9 i
+英姿勃发 5 i
+英姿焕发 2 i
+英姿迈往 3 nr
+英姿飒爽 22 i
+英子 129 n
+英子见 2 nr
+英安岩 3 ns
+英宗 132 nz
+英宗初 2 nr
+英宗力 2 nr
+英宗升 2 nr
+英宗弟 2 nr
+英宗皇 4 nr
+英宗皇帝 3 nr
+英宗释 2 nr
+英容 3 n
+英寸 336 n
+英寻 3 nr
+英尺 206 q
+英尼斯 3 ns
+英属 3 nz
+英属维尔京群岛 16 ns
+英山 268 ns
+英山县 265 ns
+英币 3 n
+英布 7 ns
+英年 3 m
+英年早逝 30 l
+英庚款 2 nz
+英式 31 nz
+英式足球 3 n
+英德 61 ns
+英德县 4 ns
+英德字典 3 ns
+英德市 5 ns
+英德红 2 nr
+英戈尔 2 nr
+英才 510 nr
+英才网 3 nr
+英扎吉 3 nr
+英打 3 nt
+英批发商 3 n
+英捷尔 25 nr
+英政府 24 nt
+英数 3 n
+英文 2343 nz
+英文书 3 nr
+英文会话 3 l
+英文信 3 nz
+英文单词 3 nr
+英文原版 3 nz
+英文名 3 nr
+英文名字 3 n
+英文名称 3 n
+英文字 3 nz
+英文字母 3 n
+英文报 3 nz
+英文歌 3 nr
+英文歌曲 3 ns
+英文歌词 3 l
+英文版 54 nz
+英文盲 3 n
+英文稿 3 nz
+英文简历 3 nr
+英文系 3 nt
+英文网 3 nz
+英文翻译 3 nr
+英文舞曲 3 n
+英文课 3 nr
+英文键盘 3 n
+英斯 2 ns
+英方 36 nz
+英日 3 nz
+英日同盟 3 nt
+英明 237 nz
+英明领导 3 n
+英明领袖 3 n
+英杰 45 nr
+英杰传 3 nr
+英格丽 3 nr
+英格兰 821 ns
+英格兰银行 210 nt
+英格兰队 70 nt
+英格利 2 ns
+英格尔 2 ns
+英格尔塞 2 ns
+英格玛 3 nr
+英格索兰 12 ns
+英模 57 n
+英模事迹 3 i
+英模代表 3 n
+英武 88 ns
+英殿 2 ns
+英毫 3 m
+英民 12 n
+英气 72 n
+英气勃勃 3 i
+英气逼人 18 i
+英汉 28 ns
+英汉双 3 nr
+英汉双解 3 nr
+英汉字典 3 ns
+英汉翻译 3 nr
+英汉词典 3 nr
+英汉辞典 3 nr
+英汉通 3 nz
+英沐王爷 7 nr
+英法 4 nz
+英法军 4 nt
+英法字典 3 ns
+英法德 2 nr
+英法意 2 n
+英法美 2 nz
+英法联军 3 nt
+英洛华 2 nz
+英派斯 3 nr
+英海军 3 nt
+英灵 37 ns
+英烈 103 a
+英烈传 3 nr
+英烈千秋 3 nr
+英爽 3 a
+英特 10 ns
+英特尔 661 ns
+英特尔公司 137 nt
+英特网 3 nz
+英王 94 nz
+英王室 3 nt
+英瑞 2 nz
+英瓦尔 2 ns
+英白罗 2 ns
+英皇 4 nz
+英皇道 3 nr
+英石 21 ns
+英研 5 j
+英磅 11 m
+英秀 3 nz
+英科学家 3 nz
+英籍 24 n
+英粤汉 2 nz
+英纳格 9 ns
+英纳格玛 3 nrt
+英美 297 ns
+英美两国 3 nt
+英美法 24 nz
+英美烟 14 nz
+英联邦 217 nt
+英脱利 2 ns
+英航 30 j
+英舰 2 n
+英花 4 nz
+英苏 3 ns
+英若诚 9 nr
+英英玉立 3 nr
+英荷 14 n
+英裔 4 n
+英译 3 nr
+英译中 3 nr
+英译名 3 n
+英译本 3 n
+英译汉 44 nr
+英语 4236 nz
+英语专业 3 nt
+英语书 3 n
+英语会话 3 n
+英语六级 3 l
+英语单词 3 n
+英语原声 3 n
+英语口语 3 nz
+英语听力 3 n
+英语四 3 nr
+英语学校 3 nt
+英语教学 3 nt
+英语教材 3 n
+英语教案 3 n
+英语教育 3 l
+英语歌 3 nr
+英语水平 3 nz
+英语演讲 3 l
+英语版 3 n
+英语班 6 nz
+英语等级 3 l
+英语系 39 n
+英语网 3 nz
+英语翻译 3 nr
+英语老师 3 n
+英语考试 3 n
+英语角 8 nz
+英语论文 3 nz
+英语词典 3 n
+英语词汇 3 n
+英语试题 3 n
+英语语法 3 n
+英语读物 3 n
+英语课 3 n
+英语课堂 3 n
+英语课程 3 n
+英语通 3 nz
+英诺森 15 nr
+英豪 90 n
+英货 2 nz
+英资 18 n
+英赫夫 3 nr
+英超 407 nr
+英超埃 2 ns
+英超球 2 nr
+英超赛 3 nr
+英达 3 nz
+英迈 9 ns
+英迪克 2 nz
+英迪拉 7 nz
+英郡王 2 nr
+英里 122 ns
+英金河 2 ns
+英钱 3 q
+英锐 2 a
+英镑 232 q
+英长老 3 nr
+英陆军 2 nt
+英雄 5354 ns
+英雄主义 46 nz
+英雄事迹 3 n
+英雄人物 3 l
+英雄传 49 nz
+英雄团 3 nz
+英雄城 6 ns
+英雄好汉 289 nz
+英雄崇拜 3 nr
+英雄式 5 nz
+英雄形象 3 l
+英雄所见略同 15 i
+英雄救美 3 nz
+英雄无敌 3 i
+英雄无用武之地 15 l
+英雄末路 3 ns
+英雄本色 26 ns
+英雄榜 3 nr
+英雄模范 3 l
+英雄气概 3 n
+英雄气短 3 l
+英雄汉 11 ns
+英雄版 3 nz
+英雄短气 3 nz
+英雄美人 3 nz
+英雄豪杰 197 nr
+英雄辈出 6 l
+英雄难过 3 l
+英雄馆 3 ns
+英韩语 2 nr
+英韬 2 nrfg
+英音 2 nz
+英颚 3 n
+英风亮节 3 nz
+英风仁 2 nr
+英飞凌 26 nr
+英饼干 3 nz
+英首相 3 nr
+英魂 14 n
+苴 63 zg
+苴蓿 3 n
+苴麻 3 z
+苷 252 x
+苸 65 zg
+苹 103 n
+苹婆 4 n
+苹果 1334 n
+苹果公司 79 n
+苹果园 17 n
+苹果日报 3 nz
+苹果机 3 n
+苹果树 32 n
+苹果梨 6 n
+苹果汁 13 n
+苹果派 3 n
+苹果电脑 3 n
+苹果电脑公司 32 n
+苹果皮 3 n
+苹果绿 10 n
+苹果网 3 n
+苹果肉 3 n
+苹果花 3 n
+苹果蠹蛾 3 n
+苹果酒 3 n
+苹果酱 4 n
+苹果酸 32 n
+苹果酸酶 3 n
+苹果醋 5 n
+苺 13 zg
+苻 317 nr
+苽 3 zg
+苾 11 zg
+苾刍 3 v
+茁 20 l
+茁壮 57 a
+茁壮成长 28 l
+茁实 3 a
+茁育 3 l
+茁长 3 a
+茂 373 a
+茂兰 5 ns
+茂兰喀斯特 2 nrt
+茂南区 3 ns
+茂县 21 ns
+茂名 44 a
+茂名市 21 ns
+茂密 409 a
+茂年 3 ns
+茂德 5 nrt
+茂林 3 ns
+茂林修竹 6 ns
+茂港区 3 ns
+茂物 16 nrt
+茂盛 192 a
+茂竹 3 ns
+茂腔 2 n
+范 843 nr
+范一飞 57 nr
+范世阅 2 nr
+范东升 3 nr
+范中恩 23 nr
+范书 5 n
+范云军 20 nr
+范代克 3 nr
+范仲兴 10 nr
+范仲淹 86 nr
+范任 13 n
+范伟赢 5 nr
+范伦铁 2 nr
+范佛里 8 nr
+范佩西 8 nr
+范例 139 n
+范例修正 3 n
+范例奖 3 n
+范兄 5 n
+范兄弟 3 nr
+范先生 3 nr
+范公堤 8 nr
+范冰冰 8 nr
+范利民 2 nr
+范剑平 2 nr
+范加尔 3 nr
+范化 2 n
+范博梅 4 nr
+范占英 3 nr
+范古农 2 nr
+范可尼 2 nr
+范司令 2 nr
+范司马 9 nr
+范各庄 2 nr
+范向阳 4 nr
+范哈内 11 nr
+范喜梅 2 nr
+范围 12101 n
+范围图 3 nr
+范围广 4 nr
+范型 11 n
+范埃克 17 nr
+范堡罗 6 nr
+范士 2 n
+范复粹 6 nr
+范大人 7 nr
+范大哥 3 nr
+范大夫 6 nr
+范天顺 2 nr
+范子愚 523 nr
+范子长 2 n
+范学鹏 2 nr
+范宗沛 3 nr
+范宝俊 3 nr
+范宝臣 6 nr
+范宣子 4 nr
+范家庄 4 nr
+范家碧 2 nr
+范小青 2 nr
+范尼加 2 nr
+范尼斯特 8 nr
+范尼离 2 nr
+范尼闹 3 nr
+范巴斯 3 nr
+范布伦 4 nr
+范布里 2 nr
+范布隆 3 nr
+范师傅 2 nr
+范希文 2 nr
+范希朝 3 nr
+范帮主 79 n
+范库岑 2 nr
+范府 2 n
+范式 43 n
+范式化 2 nr
+范张鸡黍 3 n
+范徐丽泰 6 nr
+范德华 4 nr
+范德尔 3 nr
+范德彪 3 nr
+范德林 7 nr
+范德林特 3 nr
+范德格 7 nr
+范德梅 10 nr
+范德比尔 6 nr
+范德法 3 nr
+范德瓦 17 nr
+范德维 12 nr
+范德臣 4 nr
+范德萨 8 nr
+范志 10 n
+范志军 2 nr
+范志毅 20 nr
+范志红 88 nr
+范思哲 3 nr
+范怡文 2 nr
+范性 7 n
+范恒山 256 nr
+范成大 23 nrfg
+范托夫 16 nr
+范承谟 2 nr
+范敬宜 3 nr
+范数 4 n
+范文 97 nr
+范文仲 2 nr
+范文博 2 nr
+范文同 3 nr
+范文澜 35 nrfg
+范文程 294 nr
+范文网 3 nr
+范文芳 2 nr
+范文虎 5 nr
+范文鸿 2 nr
+范旭东 2 nr
+范星 13 n
+范春生 2 nr
+范晓萱 3 n
+范晓虹 4 nr
+范晔 14 nr
+范景文 2 nr
+范晶男 3 nr
+范朋克 3 nr
+范木匠 2 nr
+范本 55 n
+范权 4 n
+范柳原 2 nr
+范植伟 3 nr
+范正伟 7 nr
+范比滕 2 nr
+范比藤 2 nr
+范氏义 7 nr
+范水模山 3 nr
+范汉杰 18 nr
+范海辛 3 nr
+范源濂 2 nr
+范炬炜 2 nr
+范爱伦 3 nr
+范玮琪 3 nr
+范甘迪 15 nr
+范用 2 n
+范畴 925 nr
+范畴逻辑 3 vn
+范疯子 2 nr
+范登堡 35 nr
+范百龄 29 nr
+范石湖 2 nr
+范礼安 2 nr
+范祖仁 10 nr
+范祖禹 20 nr
+范祥雍 3 nr
+范秀枝 51 nr
+范秋丽 3 nr
+范立刚 4 nr
+范章京 5 nr
+范筑先 3 nr
+范紫东 3 nr
+范红霞 2 nr
+范纯仁 8 nr
+范老四 7 nr
+范聚普 2 nr
+范艾伦 4 nr
+范节级 3 n
+范著 2 n
+范蠡 684 nr
+范蠡庙 256 nr
+范蠡微微 2 nr
+范蠡身 3 nr
+范质 7 n
+范辞 2 n
+范进中 3 nr
+范迪克 2 nr
+范迪安 2 nr
+范逸臣 3 nr
+范遥心 5 n
+范遥摇 3 nr
+范遥笑 7 nr
+范金 6 n
+范钦臣 4 nr
+范长 2 n
+范长国 8 nr
+范长江 12 nr
+范长生 9 nr
+范阳卢 9 nr
+范阳起 6 nrfg
+范阳郡 8 nr
+范阳高 2 nr
+范雪朋 3 nr
+范骅诸 2 ns
+范鸿轩 3 nr
+范麻子 4 nr
+茄 185 n
+茄克 9 n
+茄克衫 3 n
+茄子 122 n
+茄子河区 3 n
+茄汁 257 n
+茄科 27 n
+茄鲞 3 n
+茅 721 n
+茅丛里 2 nr
+茅之田 2 nr
+茅于轼 2 nr
+茅以升 28 nr
+茅元仪 7 nr
+茅元锡 3 nr
+茅兄 7 n
+茅十八 3 nr
+茅厕 43 n
+茅台 86 n
+茅台酒 54 n
+茅台镇 10 ns
+茅坑 56 n
+茅塞 10 nr
+茅塞顿开 44 ns
+茅大哥 22 nr
+茅子 3 n
+茅子元 6 nr
+茅室蓬户 3 i
+茅家岭 3 nr
+茅寮 2 ns
+茅封草长 3 n
+茅屋 453 n
+茅屋采椽 3 nr
+茅山 99 ns
+茅岭江 2 nr
+茅庐 70 nr
+茅庐三顾 3 nr
+茅店 2 n
+茅庵草 8 nr
+茅忠谨 7 nr
+茅房 51 n
+茅斯港 2 ns
+茅斯赢 2 nr
+茅斯队 2 nz
+茅新进 128 nr
+茅村 3 n
+茅林口 256 nr
+茅棚 35 n
+茅檐 3 n
+茅津堡 2 nr
+茅津渡 5 nr
+茅盾 156 nr
+茅盾故居 5 ns
+茅盾文学奖 59 nz
+茅真君 4 nr
+茅箭区 256 n
+茅舍 79 n
+茅茨土阶 3 nr
+茅草 143 n
+茅草屋 14 n
+茅草房 17 n
+茅草棚 3 nr
+茅草街 256 nr
+茅莓 3 n
+茅道临 6 nr
+茅顶 3 n
+茆 9 nr
+茇 3 g
+茈 2 zg
+茉 127 n
+茉织华 3 n
+茉茉 3 n
+茉莉 83 n
+茉莉花 83 n
+茉莉花茶 29 n
+茌 10 nr
+茌平 2 ns
+茌平县 2 ns
+茎 1338 n
+茎叶比 3 n
+茎干 20 n
+茎杆 5 n
+茎秆 41 n
+茎芥菜 3 v
+茎部 3 n
+茏 70 x
+茏葱 3 nr
+茐 32 zg
+茑 5 g
+茓 41 zg
+茔 12 ng
+茕 20 zg
+茕茕孑立 3 vn
+茗 221 ng
+茗茶 3 nr
+茚 48 g
+茚三酮 5 nz
+茛 5 x
+茜 126 nr
+茜素 7 n
+茜茜公主 3 v
+茜草 22 n
+茝 2 zg
+茤 35 zg
+茧 317 ng
+茧丝 45 n
+茧丝牛毛 3 n
+茧子 17 n
+茧层 3 n
+茧绸 15 n
+茨 584 ns
+茨冈 11 nrt
+茨坝 2 ns
+茨坪 5 ns
+茨城 5 ns
+茨城县 6 ns
+茨威格 14 nrt
+茨淮新河 6 ns
+茨瓦纳 3 nrt
+茫 309 ag
+茫崖 3 i
+茫无头绪 13 i
+茫无所知 3 i
+茫无涯际 3 l
+茫无端绪 3 l
+茫无边际 3 l
+茫昧 3 a
+茫然 691 z
+茫然不知 3 l
+茫然不解 41 l
+茫然失措 3 i
+茫然无措 8 i
+茫然无知 3 l
+茫然自失 3 i
+茫然若失 28 i
+茫茫 559 z
+茫茫人海 3 i
+茫茫前途 3 i
+茫茫大海 3 i
+茫茫无际 9 l
+茫茫然 28 z
+茫茫苦海 3 i
+茫茫路 3 l
+茬 527 q
+茬口 20 n
+茬子 3 n
+茭 22 n
+茭白 38 n
+茭米 3 n
+茯 8 n
+茯神 3 n
+茯苓 424 n
+茯苓皮 3 n
+茱 22 n
+茱丽叶 14 n
+茱莉亚 3 n
+茱萸 19 n
+茳芏 3 nr
+茴 24 n
+茴香 34 n
+茴香油 3 n
+茴香豆 8 n
+茴香霉素 3 n
+茵 92 n
+茵席之臣 3 n
+茵茵 22 z
+茵褥 3 n
+茵陈 12 n
+茵陈蒿 5 n
+茶 10497 n
+茶不思 3 l
+茶业 74 n
+茶乡 17 n
+茶二叉蚜 3 n
+茶亭 23 n
+茶人 3 n
+茶会 29 n
+茶会小区 3 n
+茶会服 3 n
+茶余酒后 3 n
+茶余饭后 21 l
+茶余饭饱 3 l
+茶具 121 n
+茶农 51 n
+茶几 322 n
+茶匙 9 n
+茶博士 39 n
+茶卡盐湖 3 ns
+茶卤 3 n
+茶卤儿 3 n
+茶厂 28 n
+茶厅 5 n
+茶叶 1496 n
+茶叶店 3 n
+茶叶末 6 n
+茶叶罐 3 n
+茶叶网 3 n
+茶叶花 3 n
+茶叶蛋 33 n
+茶商 84 n
+茶器 3 n
+茶园 255 n
+茶园街道 3 n
+茶圣 3 ns
+茶场 23 n
+茶坊 107 n
+茶坪 3 n
+茶垢 3 n
+茶堂 5 n
+茶壶 202 n
+茶壶嘴 3 ns
+茶壶盖 3 ns
+茶多酚 31 nz
+茶客 64 n
+茶室 55 n
+茶屋 2 n
+茶山 53 n
+茶巾 3 n
+茶市 3 n
+茶席 3 n
+茶庄 338 n
+茶店 8 n
+茶座 40 n
+茶庵 4 n
+茶房 64 n
+茶托 7 n
+茶摊 13 n
+茶文化 70 n
+茶晶 5 n
+茶末 3 n
+茶杯 374 n
+茶树 281 n
+茶树油 3 n
+茶树菇 3 n
+茶桌 30 n
+茶桶 3 n
+茶梅 3 n
+茶梢蛀蛾 3 n
+茶棚 6 n
+茶楼 207 n
+茶楼酒肆 3 i
+茶橙瘿螨 3 n
+茶歌 5 n
+茶毛虫 3 n
+茶水 352 n
+茶水供应 3 n
+茶水站 3 n
+茶汤 60 n
+茶汤壶 3 n
+茶油 27 n
+茶泡饭 2 n
+茶淀 3 n
+茶渣 7 n
+茶炉 8 n
+茶炊 28 n
+茶点 60 n
+茶点心 3 n
+茶瘾 3 n
+茶盅 74 n
+茶盏 3 n
+茶盘 64 n
+茶砖 11 n
+茶碗 209 n
+茶碟 3 n
+茶碱 15 n
+茶社 27 n
+茶科所 9 n
+茶籽油 3 n
+茶精 8 n
+茶素 4 n
+茶缘 3 n
+茶缸 43 n
+茶缸子 6 n
+茶罐 3 n
+茶肆 3 n
+茶色 33 n
+茶色眼睛 3 n
+茶色素 5 n
+茶色素厂 3 n
+茶艺 25 n
+茶艺居 3 n
+茶艺馆 3 n
+茶花 142 n
+茶花会 3 n
+茶花女 32 n
+茶茶 3 n
+茶虚 3 n
+茶行 3 n
+茶袋 3 n
+茶褐 3 n
+茶褐色 13 n
+茶角蜡蚧 3 n
+茶话 3 n
+茶话会 73 n
+茶质 3 n
+茶资 4 n
+茶道 153 n
+茶酒 3 n
+茶酒店 3 n
+茶钱 19 n
+茶铺 8 n
+茶锈 3 n
+茶镜 3 n
+茶阳 3 n
+茶院 2 n
+茶陵 26 n
+茶陵县 7 ns
+茶青 3 n
+茶食 12 n
+茶餐厅 3 n
+茶饭 83 n
+茶饭不思 11 l
+茶饭无心 3 i
+茶饮料 3 n
+茶馆 414 n
+茶馓 4 n
+茶香 33 n
+茶鸡蛋 4 n
+茸 523 n
+茸毛 47 n
+茸茸 15 z
+茹 55 nr
+茹利亚点 3 nr
+茹古涵今 3 nr
+茹太素 3 nr
+茹家庄 3 nr
+茹尔宾 2 nr
+茹斯特 5 nr
+茹柔吐刚 3 nr
+茹毛饮血 14 i
+茹科夫 3 nr
+茹科夫斯基 13 nrt
+茹素 5 nr
+茹素之 2 nr
+茹苦含辛 3 nr
+茹苦念辛 3 i
+茹茹公主 4 nr
+茹费理 6 nr
+茹鲁阿 2 nr
+茺 5 x
+茺蔚子 3 v
+茼 3 n
+茼山 3 n
+茼蒿 9 n
+茼蒿菜 3 v
+荀 102 nr
+荀况诸 3 nr
+荀和本 3 nr
+荀子 185 nr
+荀子则 3 nr
+荀子受 2 nr
+荀子所 2 nr
+荀子注 2 nr
+荀子皆 2 nr
+荀子简 2 nr
+荀彧 3 nrfg
+荀慧生 18 nr
+荀文若 5 nr
+荀林父 5 nr
+荀灌娘 3 nr
+荀蔼入 2 nr
+荀蔼守 2 nr
+荀蔼谏 4 nr
+荃 333 g
+荃湾 3 ns
+荆 2679 ns
+荆三棱 6 nr
+荆东 512 ns
+荆人涉澭 3 nr
+荆其诚 3 nr
+荆冠类 3 nr
+荆南 35 ns
+荆南之 2 nr
+荆南府 256 ns
+荆南行 2 ns
+荆南镇 3 ns
+荆天棘地 3 nr
+荆宜菜 256 nr
+荆山 17 ns
+荆山之已 3 i
+荆山之玉 3 nr
+荆川 3 ns
+荆州 11210 ns
+荆州区 513 ns
+荆州市 3082 ns
+荆府 256 ns
+荆张翠 2 nr
+荆扉 3 n
+荆扬晏 3 nr
+荆明华 3 nr
+荆木春 2 nr
+荆杖取 2 nr
+荆条 22 n
+荆树 2 ns
+荆棘 188 nr
+荆棘丛 5 nr
+荆棘丛生 3 nr
+荆棘塞途 3 nr
+荆棘满途 3 nr
+荆棘载途 3 nr
+荆棘铜驼 3 n
+荆棘鸟 3 nr
+荆楚网 48 nr
+荆楚行 2 nr
+荆榛满目 3 v
+荆江 1179 ns
+荆沙 259 ns
+荆沙市 266 ns
+荆河州 2 ns
+荆湖 12 ns
+荆湖南 2 ns
+荆湖占 2 nr
+荆湖行 2 nr
+荆湖诸 3 nr
+荆湖路 3 ns
+荆湘 5 ns
+荆溪 11 ns
+荆紫关 20 nr
+荆群豪 2 nr
+荆胡斐 2 nr
+荆芥 16 nr
+荆萧峰 3 nr
+荆袁承 3 nr
+荆襄之 10 nr
+荆轲 25 nr
+荆轲入 3 nr
+荆逍遥 2 nr
+荆钗布裙 4 nr
+荆钗记 11 nr
+荆门 2150 ns
+荆门市 1552 ns
+荆黄蓉 2 nr
+荆龙 10 ns
+荇 16 x
+荈 2 zg
+草 5919 n
+草业 4 n
+草丛 776 n
+草丛里 3 l
+草乌 11 n
+草书 152 n
+草人 3 n
+草体 4 n
+草偃风从 3 vn
+草偃风行 3 vn
+草儿 10 n
+草具 3 n
+草写 3 n
+草决明 3 n
+草创 71 n
+草创未就 3 l
+草刺 3 n
+草剪刚 3 nr
+草包 70 n
+草原 2404 n
+草原区 50 n
+草原千里 3 i
+草原土壤 3 n
+草原带 3 n
+草原景观 3 n
+草原气候 3 n
+草原法 2 n
+草叉 3 n
+草台 7 n
+草台班子 7 n
+草叶 69 n
+草司 3 n
+草图 59 n
+草圣 10 n
+草地 711 n
+草地上 3 l
+草地螟 3 n
+草地郎 3 n
+草场 414 n
+草坝 3 n
+草坡 48 n
+草坪 291 n
+草坪区 3 ns
+草坪栽植 3 nr
+草坪植物 3 nr
+草坪灯 3 ns
+草垛 30 n
+草垛子 17 n
+草垫 9 n
+草垫子 3 n
+草堂 155 n
+草堆 86 n
+草塘 5 n
+草墩 4 n
+草头 28 n
+草头儿 3 n
+草头天子 3 l
+草字 31 n
+草字头 5 n
+草安 3 n
+草寇 72 n
+草屋 65 n
+草屑 13 n
+草履虫 7 n
+草屯 3 n
+草山 10 n
+草帘 6 n
+草席 48 n
+草帽 135 n
+草庐 24 n
+草庐三顾 3 l
+草库伦 3 nrt
+草底 3 n
+草店 2 n
+草庵 42 n
+草成 3 l
+草房 76 n
+草房子 4 n
+草拟 178 b
+草拟文件 3 n
+草料 125 n
+草料场 16 n
+草明 2 n
+草昧 3 n
+草木 325 n
+草木俱朽 3 i
+草木子 3 n
+草木愚夫 3 nr
+草木樨 3 n
+草木灰 21 n
+草木犀 9 n
+草木皆兵 24 i
+草木知威 3 i
+草木经 3 n
+草木萧疏 3 i
+草本 355 n
+草本植物 139 l
+草果 5 n
+草标 5 n
+草标儿 3 n
+草样 3 n
+草根 127 n
+草根大使 3 nz
+草案 1693 n
+草桥 21 n
+草棉 10 n
+草棚 109 n
+草民 18 n
+草泥马 267 n
+草泽 8 n
+草洼 3 n
+草浆 4 n
+草测 3 vn
+草海 38 n
+草满囹圄 3 i
+草滩 14 n
+草灰 6 n
+草炭 3 n
+草煤 3 n
+草狐 2 nz
+草率 123 n
+草率了事 3 l
+草率从事 3 l
+草率地 3 n
+草率地做 3 l
+草率将事 3 n
+草率收兵 3 n
+草率行事 3 n
+草珊瑚 6 nz
+草甘膦 2 n
+草甸 436 n
+草甸子 9 n
+草甸沼泽 3 v
+草畜 2 n
+草皮 68 n
+草石蚕 3 n
+草码 3 n
+草秆 3 n
+草种 2 n
+草科 3 n
+草稿 136 n
+草稿本 3 n
+草稿箱 3 n
+草稿纸 3 n
+草窝 33 n
+草笠 3 n
+草签 28 n
+草类 37 n
+草籽 20 n
+草糖 3 n
+草红藤 3 n
+草约 17 n
+草纸 16 n
+草绳 36 n
+草绿 9 b
+草绿色 18 n
+草编 30 n
+草腹菜肠 3 n
+草船 3 n
+草船借箭 7 n
+草芙蓉 3 n
+草芥 29 n
+草芥人命 3 l
+草花蛇 3 n
+草芽 8 n
+草苁蓉 2 n
+草苫 3 n
+草茉莉 3 n
+草草 178 n
+草草了事 7 i
+草草收兵 4 n
+草草收场 9 n
+草草率率 3 n
+草草记录 3 n
+草荐 3 v
+草荒 3 n
+草药 196 n
+草药店 2 n
+草药方 3 n
+草药花坛 3 n
+草莓 116 n
+草莓酱 3 nz
+草莱 3 nrt
+草莽 90 nz
+草莽英雄 28 n
+草菅 3 i
+草菅人命 19 i
+草菇 22 n
+草菌 3 n
+草菴 3 vn
+草薙 3 vn
+草薙京 3 v
+草薙柴舟 3 nr
+草薙禽狝 3 nz
+草虫 33 n
+草虾 3 n
+草蛇 3 n
+草蛇灰线 3 n
+草蛭 3 n
+草蜢 3 n
+草蜻蛉 3 n
+草血竭 3 n
+草行 3 n
+草行露宿 3 l
+草衣木食 3 n
+草袋 8 n
+草袋子 2 n
+草裙舞 3 nr
+草诏 3 n
+草豆蔻 3 n
+草质茎 3 n
+草贼 3 n
+草酰乙酸 3 nz
+草酸 82 n
+草酸盐 8 n
+草酸钙 3 n
+草野 17 n
+草铺 15 n
+草镰 3 n
+草长莺飞 9 i
+草长马肥 3 n
+草间 19 n
+草间求活 3 n
+草靡风行 3 i
+草鞋 119 n
+草食 16 n
+草食兽 3 n
+草食动物 3 l
+草食性 18 n
+草驴 3 n
+草鱼 38 n
+草鸡 7 n
+草黄色 8 n
+荏 4 v
+荏平 3 a
+荏平县 3 v
+荏弱 5 a
+荏苒 22 v
+荐 411 vg
+荐举 54 v
+荐任 3 v
+荐引 3 v
+荐拔 3 v
+荐见 3 v
+荐贤 3 v
+荐骨 3 v
+荑 23 g
+荒 1040 v
+荒丘 5 n
+荒乱 11 a
+荒僻 123 a
+荒冢 7 n
+荒冷 3 a
+荒凉 589 a
+荒凉芜秽 3 n
+荒原 251 n
+荒唐 448 a
+荒唐事 3 n
+荒唐无稽 3 n
+荒唐言 3 n
+荒土 3 n
+荒地 237 n
+荒坟 3 n
+荒坡 18 n
+荒寂 3 a
+荒寒 3 a
+荒尾 6 n
+荒山 351 n
+荒山亮 3 n
+荒山僻壤 3 i
+荒山坡 3 ns
+荒山秃岭 4 n
+荒山野岭 46 ns
+荒山野林 3 n
+荒岛 122 n
+荒岭 4 n
+荒川 3 n
+荒年 19 n
+荒废 145 a
+荒废业务 3 n
+荒废多年 3 l
+荒弃 3 v
+荒径 3 n
+荒怠 3 a
+荒政 3 n
+荒无人烟 30 i
+荒旱 3 a
+荒时暴月 3 i
+荒旷 3 a
+荒月 3 n
+荒木村重 3 n
+荒村 35 n
+荒林 4 n
+荒歉 3 a
+荒水 3 n
+荒沙 4 n
+荒沟 8 n
+荒淫 79 a
+荒淫无度 6 i
+荒淫无耻 17 i
+荒淫无道 3 i
+荒滩 61 n
+荒漠 820 n
+荒漠化 71 n
+荒漠区 24 n
+荒漠土壤 3 n
+荒漠气候 3 n
+荒漠甘泉 3 n
+荒火 3 n
+荒灾 3 n
+荒烟 6 n
+荒烟漫草 3 n
+荒田 12 n
+荒疏 16 a
+荒瘠 3 a
+荒碱地 3 n
+荒置 3 n
+荒芜 206 a
+荒草 132 n
+荒落 3 n
+荒蛮 3 a
+荒诞 134 a
+荒诞不稽 3 l
+荒诞不经 47 i
+荒诞主义 3 n
+荒诞剧 3 n
+荒诞无稽 9 i
+荒诞派 30 n
+荒谬 411 a
+荒谬性 7 n
+荒谬绝伦 8 i
+荒郊 51 n
+荒郊野外 3 l
+荒野 159 n
+荒馑 3 n
+荒鸡 3 n
+荔 58 n
+荔城区 3 ns
+荔枝 259 n
+荔枝林 3 ns
+荔枝果 3 n
+荔枝树 3 ns
+荔枝核 3 n
+荔枝汁 3 n
+荔枝蜜 3 n
+荔波 15 n
+荔波县 13 ns
+荔浦 3 ns
+荔浦县 2 ns
+荔湾 6 ns
+荔湾区 6 ns
+荖 8 zg
+荙 2 zg
+荚 148 nr
+荚果 44 n
+荚膜 3 n
+荚膜多糖 3 n
+荜 8 x
+荜拔 3 i
+荜澄茄 3 n
+荜路缕 3 i
+荜路蓝缕 3 i
+荝 16 zg
+荞 38 zg
+荞麦 169 n
+荞麦壳 3 n
+荞麦片 3 n
+荞麦皮 5 n
+荞麦窝 3 n
+荞麦米 3 n
+荞麦面 3 n
+荟 24 v
+荟萃 142 v
+荟萃一堂 3 v
+荟集 3 v
+荠 18 nz
+荠荠菜 6 nz
+荠菜 25 n
+荡 1199 v
+荡产倾家 3 l
+荡人心魄 7 i
+荡出 3 v
+荡口 3 v
+荡女 3 n
+荡妇 16 n
+荡子 4 n
+荡寇 3 n
+荡平 63 v
+荡来荡去 3 i
+荡析离居 3 n
+荡检逾闲 3 z
+荡气回肠 28 i
+荡海拔山 3 i
+荡涤 31 v
+荡漾 210 v
+荡漾出 3 vn
+荡然 3 z
+荡然无存 239 i
+荡神志 3 i
+荡秋千 34 i
+荡舟 3 v
+荡船 3 v
+荡荡 3 v
+荡荡悠悠 3 z
+荡起 43 v
+荡过 3 v
+荡除 3 v
+荡魂摄魄 3 i
+荣 1210 nr
+荣中堂 54 nr
+荣事达 8 nz
+荣于华 3 nr
+荣亲王 6 nr
+荣任 13 n
+荣作佳 2 nr
+荣光 38 nr
+荣八耻 58 i
+荣典 6 nr
+荣典权 3 nr
+荣军 5 nr
+荣剑尘 5 nr
+荣华 41 nr
+荣华富贵 125 nr
+荣县 13 ns
+荣叔荣 2 nr
+荣古虐今 3 l
+荣古陋今 3 i
+荣名彩 2 nr
+荣启期 2 nr
+荣国公 4 nr
+荣国府 52 nr
+荣大人 4 nr
+荣夷公 4 nr
+荣孟源 2 nr
+荣宗耀祖 3 nr
+荣宝拍 2 nr
+荣宝斋 27 nr
+荣富贵 2 nr
+荣工处 3 n
+荣师叔 3 nr
+荣幸 148 nr
+荣幸之至 3 nr
+荣庆社 2 nr
+荣府内 2 nr
+荣归 8 nr
+荣归故里 5 i
+荣彩听 2 nr
+荣彩怒 2 nr
+荣成 26 nr
+荣成县 3 nr
+荣成市 16 n
+荣成湾 7 nr
+荣成龙 3 nr
+荣托保 2 nr
+荣新江 9 nr
+荣昌 13 nr
+荣昌县 2 nr
+荣明耻 2 nr
+荣显 3 a
+荣智健 15 nr
+荣格 21 n
+荣格曾 2 nr
+荣毅仁 28 nr
+荣氏家族 2 nr
+荣民之家 3 n
+荣民工程 3 n
+荣水映 2 nr
+荣登 29 nr
+荣登后座 3 nr
+荣登榜首 3 i
+荣登王座 3 nr
+荣禄 541 nr
+荣禄之 3 nr
+荣禄会 2 nr
+荣禄你 2 nr
+荣禄便 2 nr
+荣禄全 2 nr
+荣禄冷 4 nr
+荣禄分 2 nr
+荣禄奉 2 nr
+荣禄忙 4 nr
+荣禄扎 2 nr
+荣禄执 2 nr
+荣禄扶 2 nr
+荣禄病 7 nr
+荣禄瞅 2 nr
+荣禄站 4 nr
+荣禄端 2 nr
+荣禄笑 2 nr
+荣禄缓 4 nr
+荣禄血 2 nr
+荣禄转 2 nr
+荣禧堂 4 nr
+荣秋谢 2 nr
+荣立 95 nr
+荣立者 3 nr
+荣耀 493 nr
+荣膺 64 nr
+荣获 762 nr
+荣获冠军 3 nr
+荣蝶仙 2 nr
+荣行 3 v
+荣西禅师 2 nr
+荣誉 2877 nr
+荣誉军人 3 n
+荣誉出品 3 n
+荣誉奖 54 n
+荣誉室 18 n
+荣誉心 3 n
+荣誉性 7 n
+荣誉感 49 n
+荣誉权 3 nr
+荣誉榜 3 nr
+荣誉称号 3 n
+荣誉章 20 nr
+荣誉证书 3 n
+荣记 4 n
+荣谐伉俪 3 nr
+荣赫鹏 2 nr
+荣辱 144 n
+荣辱与共 17 i
+荣辱兴衰 3 i
+荣辱毁誉 3 i
+荣辱观 109 i
+荣长老 3 nr
+荣高棠 6 nrfg
+荤 801 ng
+荤段子 3 n
+荤油 2 n
+荤笑话 3 n
+荤粥 8 n
+荤腥 52 n
+荤菜 25 n
+荤辛 3 n
+荤酒 3 n
+荤食 3 n
+荥 45 ns
+荥经 2 ns
+荥经县 3 ns
+荥阳 117 ns
+荥阳县 3 ns
+荥阳市 2 ns
+荦 30 g
+荦荦 3 nr
+荦荦大端 3 nr
+荦荦大者 3 nr
+荦荦确确 3 nr
+荧 41 n
+荧光 365 n
+荧光产额 3 n
+荧光屏 90 n
+荧光棒 2 n
+荧光沥青 3 z
+荧光法 3 n
+荧光灯 46 n
+荧光笔 3 n
+荧光粉 23 n
+荧光素酶 5 n
+荧光颜料 3 vn
+荧屏 94 n
+荧幕 8 n
+荧惑 14 a
+荧火 3 n
+荧烛 3 n
+荧燎 3 z
+荧荧 20 z
+荨 77 n
+荨麻 14 n
+荨麻疹 22 n
+荨麻诊 3 n
+荩 91 g
+荪 55 zg
+荫 887 a
+荫凉 28 a
+荫子封妻 3 n
+荫庇 37 v
+荫影 3 n
+荫棚 3 n
+荫罩 2 v
+荫翳 3 n
+荫蔽 26 a
+荫蔽地 3 n
+荬 2 x
+药 8404 n
+药专 3 n
+药业 360 n
+药丸 202 n
+药丸子 3 n
+药交会 3 nt
+药价 163 n
+药具 7 n
+药典 63 n
+药农 2 n
+药到病除 11 i
+药制剂 3 n
+药剂 179 n
+药剂士 3 n
+药剂学 5 n
+药剂师 21 n
+药剂拌种 2 n
+药剂科 11 n
+药力 55 n
+药包 31 n
+药包材 3 n
+药匙 3 n
+药单 3 n
+药厂 165 n
+药叉 24 n
+药名 25 n
+药味 23 n
+药品 2884 n
+药品店 3 n
+药品柜 3 n
+药品监督管理局 158 nt
+药品网 3 n
+药品费 4 n
+药商 23 n
+药囊 17 n
+药型罩 3 n
+药壶 2 n
+药头 3 n
+药婆 3 n
+药学 71 n
+药学专科 3 nt
+药学会 8 nt
+药学界 3 n
+药学系 5 n
+药学院 27 nt
+药害 9 n
+药局 3 n
+药山 11 n
+药市 3 n
+药师 536 n
+药师佛 3 n
+药库 261 n
+药店 505 n
+药店飞龙 3 n
+药引 3 n
+药引子 9 n
+药性 127 n
+药性气 3 n
+药房 260 n
+药捻 4 n
+药捻子 2 n
+药效 102 n
+药效学 3 n
+药效持久 3 i
+药敏 3 b
+药料 21 n
+药方 251 n
+药方子 2 n
+药材 1287 n
+药材店 9 n
+药枕 5 n
+药械 3 n
+药检 11 j
+药检所 2 nt
+药棉 12 n
+药水 108 n
+药水瓶 3 n
+药汤 3 n
+药油 3 n
+药流后 3 n
+药浴 3 n
+药液 86 n
+药渣 3 n
+药源性 3 n
+药片 95 n
+药物 3727 n
+药物中毒 3 n
+药物制剂 3 n
+药物学 287 n
+药物性 3 n
+药物滥用 3 i
+药王 154 n
+药王山 7 n
+药王庙 20 n
+药理 104 n
+药理作用 3 n
+药理学 37 n
+药瓶 65 n
+药瓶子 3 n
+药用 991 n
+药用价值 3 n
+药用植物 3 n
+药用菌 3 n
+药疗 9 n
+药疗法 3 n
+药疹 13 n
+药瘾 3 n
+药皂 2 n
+药监局 59 nt
+药盒 7 n
+药石 25 n
+药石之言 3 n
+药石罔效 3 i
+药科 10 n
+药笼中物 3 n
+药筒 28 n
+药箱 77 n
+药粉 78 n
+药糖 3 n
+药线 38 n
+药罐 3 n
+药罐子 9 n
+药膏 87 n
+药膜 2 n
+药膳 279 n
+药茶 3 n
+药草 57 n
+药行 3 n
+药衡 3 n
+药补 12 b
+药谱 3 n
+药谷 10 n
+药贩 3 n
+药贩子 12 n
+药费 43 n
+药都 67 n
+药酒 106 n
+药量 31 n
+药针 3 n
+药铺 97 n
+药面 20 n
+药饵 13 n
+荰 20 zg
+荷 1694 ng
+荷人 3 nrt
+荷兰 2333 ns
+荷兰东印度公司 10 nt
+荷兰人 278 nrt
+荷兰属地 3 ns
+荷兰政府 8 nt
+荷兰文 3 nz
+荷兰港 2 ns
+荷兰猪 3 n
+荷兰王国 12 ns
+荷兰盾 10 nz
+荷兰籍 12 n
+荷兰菊 3 nr
+荷兰话 3 n
+荷兰语 51 nz
+荷兰豆 3 ns
+荷兰银行 37 nt
+荷兰队 178 nt
+荷包 191 n
+荷包蛋 46 n
+荷叶 679 n
+荷叶杯 2 n
+荷叶茶 3 n
+荷塘 51 ns
+荷塘区 3 ns
+荷塘月色 3 ns
+荷尔 6 ns
+荷尔德林 12 ns
+荷尔蒙 114 nrt
+荷担 3 n
+荷枪 3 n
+荷枪实弹 287 n
+荷梗 3 n
+荷池 4 ns
+荷泽 9 ns
+荷泽市 3 ns
+荷流 3 n
+荷瘤 3 n
+荷色 3 n
+荷花 477 n
+荷花坪 2 ns
+荷花奖 3 nz
+荷花池 3 ns
+荷花淀 3 ns
+荷花淀派 2 n
+荷荷 3 n
+荷藕 3 n
+荷语 3 nz
+荷载 79 n
+荷里活 3 nrt
+荷重 9 n
+荷重量 3 n
+荷锄 3 n
+荷香 3 n
+荷马 210 ns
+荷马史诗 3 n
+荸荠 28 n
+荻 53 n
+荻村伊智朗 3 nr
+荼 154 v
+荼毒 50 v
+荼毒生灵 3 v
+荽 18 x
+莅 72 vg
+莅临 170 v
+莅临指导 3 v
+莅会 3 v
+莅场 3 v
+莆 167 ns
+莆仙戏 5 n
+莆田 58 ns
+莆田人 6 n
+莆田县 10 ns
+莆田市 7 ns
+莉 162 nrt
+莉亚娜 3 nrt
+莉妮 2 nrt
+莉娅 23 nrt
+莉斯 2 nrt
+莉比 2 nrt
+莉莉 2 nrt
+莉莉丝 3 nrt
+莉雅 2 nrt
+莋 5 zg
+莎 681 nr
+莎啦啦 3 n
+莎士比亚 292 ns
+莎拉 6 nr
+莎翁 13 nr
+莎草 33 nr
+莎草科 23 nr
+莎贝尔 2 nr
+莎车 83 n
+莎车县 7 ns
+莎阿代提 3 nr
+莒 39 ns
+莒光 3 ns
+莒光周 3 nrt
+莒光日 3 nrt
+莒南 5 ns
+莒南县 9 ns
+莒县 42 ns
+莒城 3 ns
+莓 17 g
+莘 32 nr
+莘之君 3 nr
+莘县 3 ns
+莘莘学子 38 nr
+莙 2 zg
+莛 7 g
+莜 4 n
+莜麦 22 n
+莜麦粉 3 n
+莝 2 zg
+莞 32 l
+莞尔 18 v
+莞尔一笑 37 l
+莞尔而笑 3 l
+莠 14 ag
+莠民 3 n
+莣 4 zg
+莧 2 zg
+莨 20 n
+莨绸 3 n
+莨苕 3 n
+莨菪 30 n
+莨菪子 3 n
+莨菪胺 3 n
+莩 12 zg
+莪 35 zg
+莪术 3 n
+莪术油 3 n
+莪蒿 3 n
+莫 3065 d
+莫七侠 20 nr
+莫七叔 11 nr
+莫七弟 5 nr
+莫三鼻给 3 i
+莫不 230 d
+莫不成 5 i
+莫不是 175 l
+莫丹 2 ns
+莫为已甚 3 i
+莫之与京 3 nr
+莫予毒也 3 i
+莫二兄 3 nr
+莫亚 33 ns
+莫什尼科夫 2 nrt
+莫代尔 3 nr
+莫企逊 9 nr
+莫伊 15 nrt
+莫伊塞斯 5 nrt
+莫伊谢耶 2 nrt
+莫伊谢耶夫 16 nrt
+莫伦特 6 nr
+莫伦特兹 3 ns
+莫余毒也 3 l
+莫借 3 v
+莫先乎情 2 i
+莫克利 4 nr
+莫克图 2 nr
+莫克沙 2 nr
+莫入 3 v
+莫兹利 10 nr
+莫兹多克 3 nrt
+莫内 2 ns
+莫农加 3 nr
+莫列诺 2 nr
+莫利 5 ns
+莫利斯 7 nr
+莫利纳 9 nr
+莫力达瓦达斡尔族自治旗 7 ns
+莫勒姆 7 nr
+莫华伦 3 nr
+莫博涅 2 nr
+莫及 3 ns
+莫可 3 nr
+莫可原 4 nr
+莫可名状 7 i
+莫可奈何 3 i
+莫可指数 3 l
+莫可言状 3 i
+莫合烟 9 nr
+莫合金 3 nr
+莫吉与 4 nr
+莫吉同 2 nr
+莫吉廖夫 3 nr
+莫名 220 v
+莫名其妙 659 i
+莫名无言 3 i
+莫向人 2 nr
+莫哈夫 2 nr
+莫哈托 2 nr
+莫哈杰拉尼 3 nrt
+莫哭 2 v
+莫图根 6 nr
+莫埃 3 ns
+莫埃利 2 nr
+莫塔坦 2 nr
+莫塔瓜 2 nr
+莫塔马 2 nr
+莫塞利 2 ns
+莫塞尔贝 2 nrt
+莫塞莱 16 nr
+莫声谷 115 nr
+莫复忧 4 nr
+莫大 471 ns
+莫大焉 3 nr
+莫天全 3 nr
+莫失良机 3 l
+莫奇利 10 nr
+莫奇勒 4 nr
+莫奇卡 3 nr
+莫奈 11 d
+莫如 47 nr
+莫妮卡 3 nr
+莫家尧 3 nr
+莫少聪 3 nr
+莫尔伍 3 nr
+莫尔兹 5 nr
+莫尔兹比港 14 ns
+莫尔加尼 2 ns
+莫尔多瓦 3 nrt
+莫尔德 6 nr
+莫尔托 2 nr
+莫尔斯 37 nr
+莫尔斯比港 3 ns
+莫尔格勒 2 nrt
+莫尔盐 3 nr
+莫尔纳尔 2 nrt
+莫尔耶 4 nr
+莫尔蒂耶 5 nrt
+莫尔达 2 nr
+莫尔顿 2 nr
+莫尼克 3 nr
+莫尼卡 6 nr
+莫尼埃 2 ns
+莫展一筹 3 l
+莫布利 10 nr
+莫布里 2 nrt
+莫师伯 24 nr
+莫希 5 nr
+莫希坎 2 nr
+莫干山 14 ns
+莫应丰 3 nr
+莫弄污 2 i
+莫弄虚 2 nr
+莫往 3 d
+莫德尔 4 nr
+莫德斯 4 nr
+莫忘 3 v
+莫念莫 2 nr
+莫怪 7 d
+莫恰洛 5 nr
+莫悟奇 2 nr
+莫悲兮 2 nr
+莫愁湖 14 nr
+莫扎特 102 nr
+莫抖 2 v
+莫折大提 3 i
+莫折念 2 nr
+莫护跋 5 nr
+莫拉 17 nrt
+莫拉布 2 nr
+莫拉桑 5 nr
+莫拉维 5 nr
+莫拉莱 3 nr
+莫拉蒂 5 nr
+莫拉雷 2 nr
+莫敢 2 d
+莫敢谁何 3 l
+莫文尉 3 nr
+莫文秀 2 nr
+莫文蔚 15 nr
+莫文隆 52 nr
+莫斯凯 2 nr
+莫斯利 13 nr
+莫斯卡 3 nr
+莫斯基托 2 nrt
+莫斯特 17 nr
+莫斯科 1817 nr
+莫斯科东方大学 9 nt
+莫斯科中山大学 17 nt
+莫斯科大剧院 13 nt
+莫斯科大学 88 nt
+莫斯科州 3 ns
+莫斯科市 16 ns
+莫斯科红场 8 nt
+莫斯航宇 4 nr
+莫斯莱 2 nr
+莫斯著 8 nr
+莫无礼 2 i
+莫日根 2 nz
+莫明其妙 19 i
+莫昔芬 19 nr
+莫普提 3 nr
+莫朗格 3 nr
+莫札特 3 nr
+莫朴树 39 nr
+莫来石 4 nr
+莫根 2 ns
+莫根施 2 nr
+莫根森 3 nr
+莫桑比克 213 ns
+莫桑比克共和国 4 ns
+莫桑比克解放阵线党 4 nt
+莫梓江 3 ns
+莫此为甚 9 i
+莫比 5 nrt
+莫比尔 14 nr
+莫比鲁兹 3 ns
+莫汉 12 ns
+莫泊 4 ns
+莫泊桑 31 nr
+莫法兹 5 nr
+莫法特 2 nr
+莫泽尔 2 nr
+莫洛修 32 nr
+莫洛托夫 67 nrt
+莫测 84 nr
+莫测高深 35 i
+莫特 11 nrt
+莫特克 4 nr
+莫特尔 4 nr
+莫特森 3 nr
+莫特雷 2 nr
+莫猎骄 4 nr
+莫理 4 nr
+莫理逊 2 nr
+莫瑟 2 nrt
+莫瓦格 14 nr
+莫生气 3 nt
+莫皮拉 3 nr
+莫知其 4 nr
+莫知所为 3 i
+莫知所措 3 i
+莫等闲 3 nr
+莫管 3 c
+莫管闲事 3 l
+莫索里尼 3 nrt
+莫纳科 2 nr
+莫纳罗 2 nr
+莫纳西 4 ns
+莫维奇 3 nr
+莫罕默 14 nrt
+莫罗 15 nrt
+莫罗佐夫 4 nr
+莫罗反射 3 l
+莫罗尼 9 nr
+莫美林 3 nr
+莫耕闲 16 nr
+莫耶斯 23 nr
+莫胡疑 2 nr
+莫能知 2 nr
+莫能菌素 3 l
+莫舒舒 9 nr
+莫色雷斯 2 ns
+莫艳琳 256 nr
+莫若 59 nr
+莫莫格 2 nr
+莫莱诺 3 nr
+莫菲听 2 nr
+莫菲奥 5 nr
+莫衷一是 49 i
+莫西 13 ns
+莫西奥 25 nr
+莫西族 4 nr
+莫西芬 6 nr
+莫西语 3 nr
+莫要 3 b
+莫要震 2 nr
+莫言 33 nr
+莫让 19 nr
+莫诺莫 12 nr
+莫诺里 2 nr
+莫谈国 3 nr
+莫谓言 2 nr
+莫谢希 4 nr
+莫费奥 5 nr
+莫贺弗 2 nr
+莫跃明 8 nr
+莫辨楮叶 3 t
+莫过 3 c
+莫过于 268 d
+莫过于此 3 l
+莫过如此 3 l
+莫迪凯 15 nr
+莫迪利 3 nr
+莫迪康 3 nr
+莫逆 17 nr
+莫逆之交 28 i
+莫逆于心 3 i
+莫逆胡 2 nr
+莫通博 2 nr
+莫道 12 nr
+莫道石 2 nr
+莫邪 55 nr
+莫里 15 nrt
+莫里亚 3 ns
+莫里克 3 nr
+莫里兹 3 nr
+莫里哀 41 nr
+莫里埃 3 ns
+莫里安 3 nr
+莫里斯 72 nr
+莫里森 54 nr
+莫里特 3 nrt
+莫里索 4 nr
+莫里茨 3 nrt
+莫里诺 2 nr
+莫里逊 36 nr
+莫错 2 ns
+莫长老 10 nr
+莫问前程 3 l
+莫问奴 4 nr
+莫雷亚斯 2 nrt
+莫雷利亚 4 ns
+莫雷河 2 nr
+莫雷洛斯 11 nrt
+莫雷洛斯州 3 ns
+莫雷诺 5 nr
+莫霍克 4 nr
+莫霍洛 3 nr
+莫霸自立 2 nr
+莫非 1353 ns
+莫须 3 d
+莫须有 41 i
+莫顿 5 ns
+莫额尼 3 nr
+莫饶 2 ns
+莫高 4 nr
+莫高窟 110 ns
+莫鲁瓦 2 nr
+莫鲁齐 2 nr
+莮 31 zg
+莰 7 g
+莱 936 ns
+莱亚 2 ns
+莱亚尔 6 nrt
+莱什 5 nrt
+莱伊 3 nrt
+莱伯 2 ns
+莱佛士 3 ns
+莱克 9 nrt
+莱克斯 3 nrt
+莱克星顿 3 ns
+莱切 40 nrt
+莱切斯特 3 nrt
+莱利 10 ns
+莱勒 3 nrt
+莱卡 9 nrt
+莱哈尔 2 nrt
+莱哈尼耶 3 nrt
+莱因哈特 3 nrt
+莱因河 3 ns
+莱城 5 ns
+莱城区 3 ns
+莱塞 6 nrt
+莱夫 7 nrt
+莱夫斯基 3 nrt
+莱奥 8 nrt
+莱奥帕尔 7 nrt
+莱姆 22 nrt
+莱姆病 7 nr
+莱尔 13 nrt
+莱尼 12 nrt
+莱尼亚诺 2 nrt
+莱山 10 ns
+莱山区 3 ns
+莱州 62 ns
+莱州市 19 ns
+莱州湾 20 ns
+莱布 2 nrt
+莱布尼兹 55 nrt
+莱布尼茨 3 nrt
+莱希 2 nrt
+莱希特 2 nrt
+莱德 15 nrt
+莱德杯 3 nr
+莱恩 21 nrt
+莱恩奥尔 7 nrt
+莱拉 2 nrt
+莱文 6 nz
+莱斯 11 nrt
+莱斯利 5 nrt
+莱斯特 7 nrt
+莱斯特郡 2 ns
+莱斯顿 3 nrt
+莱昂 22 nrt
+莱昂斯 3 nrt
+莱昂纳多 3 nrt
+莱昂纳德 8 nrt
+莱易斯 2 nrt
+莱曼 25 nrt
+莱曼系 3 nr
+莱格 3 nrt
+莱格尼察 2 ns
+莱格特 2 nrt
+莱森 2 nrt
+莱比 8 nrt
+莱比锡 266 ns
+莱温斯基 8 nz
+莱热 4 nrt
+莱特 60 nrt
+莱特岛 2 ns
+莱特森 2 nrt
+莱特湾 10 ns
+莱特纳 6 nrt
+莱登 9 nrt
+莱科宁 3 nrt
+莱索托 93 nrt
+莱纳 10 nrt
+莱维 19 nrt
+莱芒湖 6 ns
+莱芜 53 ns
+莱芜县 5 ns
+莱芜市 7 ns
+莱芜战役 22 nz
+莱英达 3 nr
+莱茵 206 ns
+莱茵河 225 ns
+莱菔 3 nr
+莱菔子 3 nz
+莱蒂 2 nrt
+莱蒙 6 nrt
+莱西 30 ns
+莱西县 4 ns
+莱西市 4 ns
+莱诺 3 nrt
+莱辛 32 nrt
+莱里 11 nrt
+莱阳 46 ns
+莱阳县 3 ns
+莱阳市 7 ns
+莱陷 3 n
+莱顿 104 nrt
+莱顿瓶 3 nr
+莱齐耶 3 nr
+莲 1550 n
+莲华经 15 n
+莲台 27 n
+莲叶 21 n
+莲坂 3 ns
+莲塘 14 ns
+莲娜 51 nrt
+莲子 1452 n
+莲子心 3 n
+莲子汤 3 n
+莲子粥 4 n
+莲山 2 ns
+莲峰乡 3 ns
+莲座 32 n
+莲座期 3 n
+莲心 12 n
+莲房 3 n
+莲步 3 n
+莲池 28 n
+莲港湖 3 ns
+莲湖 3 ns
+莲湖区 2 ns
+莲社 3 n
+莲籽 2 n
+莲肉 262 n
+莲花 520 n
+莲花县 5 ns
+莲花山 26 ns
+莲花峰 3 ns
+莲花座 3 n
+莲花式柱 3 n
+莲花池 140 ns
+莲花瓣 3 n
+莲花生 18 n
+莲花白 5 n
+莲花落 30 n
+莲花路 3 n
+莲荷 3 n
+莲菜 2 n
+莲蓉 9 n
+莲蓬 1060 ns
+莲蓬头 11 n
+莲蓬子儿 3 n
+莲藕 33 n
+莲都区 3 ns
+莲雾 3 n
+莲须 3 n
+莲香楼 3 ns
+莳 28 x
+莳秧 3 n
+莳花种草 3 n
+莳萝 3 n
+莴 2 zg
+莴笋 13 n
+莴苣 36 n
+莶 7 x
+获 7931 v
+获兔烹狗 3 l
+获准 419 v
+获利 347 v
+获利率 3 n
+获利盘 3 v
+获到 3 v
+获取 1306 v
+获取信息 4 l
+获取数据 2 l
+获嘉 2 ns
+获嘉县 3 ns
+获奖 989 v
+获奖作品 3 n
+获奖率 3 n
+获奖者 107 n
+获学士 3 n
+获宠 3 v
+获工学 3 l
+获得 16128 v
+获得好评 3 l
+获得性 43 n
+获得性免疫 8 l
+获得性状 3 v
+获得成功 3 l
+获得最佳 4 z
+获得理想 4 n
+获得者 236 n
+获得胜利 3 l
+获悉 807 v
+获救 66 v
+获最佳 3 z
+获益 90 v
+获益匪浅 25 l
+获益者 9 n
+获益非浅 3 l
+获知 113 v
+获罪 3 v
+获胜 849 v
+获胜者 22 n
+获能 3 v
+获能度 3 n
+获致 3 v
+获评 13 v
+获赃款 3 vn
+获赠 39 v
+获赦 3 v
+获选 3 v
+获释 189 v
+获隽公车 3 vn
+获颁 3 vn
+获鹿 10 n
+获鹿县 5 ns
+莸 58 g
+莹 126 nr
+莹洁 3 a
+莹润 10 nz
+莹莹 29 a
+莺 323 ng
+莺俦燕侣 3 n
+莺吟燕儛 3 i
+莺吟燕舞 3 i
+莺啼 3 i
+莺啼燕唱 3 i
+莺啼燕语 2 i
+莺声燕语 3 i
+莺巢燕垒 3 i
+莺期燕约 3 i
+莺歌 3 i
+莺歌燕舞 11 i
+莺歌燕语 3 i
+莺歌蝶舞 3 vn
+莺燕 3 i
+莺猜燕妒 3 i
+莺花 3 i
+莺莺燕燕 3 i
+莺语 3 i
+莺谷 3 i
+莺迁之喜 3 i
+莺闺燕阁 3 i
+莺飞燕舞 3 i
+莼 43 n
+莼菜 272 n
+莼鲈之思 3 v
+莽 204 nr
+莽丛 3 n
+莽原 6 ns
+莽夫 24 n
+莽山 3 ns
+莽撞 149 z
+莽林 3 n
+莽汉 19 ns
+莽苍 2 z
+莽苍苍斋 4 n
+莽草 3 n
+莽荡 3 z
+莽莽 72 z
+莽莽撞撞 3 z
+莽莽苍苍 12 z
+莽里莽撞 3 z
+菀 71 x
+菁 71 zg
+菁华 5 nz
+菁英 8 nz
+菁英份子 3 n
+菁菁 3 nz
+菂 2 zg
+菃 15 zg
+菅 25 nr
+菇 123 ng
+菇农 3 n
+菇类 6 n
+菉 5 zg
+菊 786 n
+菊剑 3 n
+菊化精 3 n
+菊友 3 n
+菊园 3 n
+菊展 3 n
+菊池 3 n
+菊石 51 n
+菊科 69 n
+菊粉 3 n
+菊老荷枯 3 n
+菊芋 10 n
+菊花 496 n
+菊花岛 8 ns
+菊花瓣 7 n
+菊花石 10 n
+菊花茶 21 n
+菊花链 4 n
+菊花香 3 n
+菊芳 3 n
+菊苣 5 n
+菊豆 4 n
+菊酯 3 n
+菊黄 3 n
+菊黄蟹肥 3 vn
+菋 2 zg
+菌 1231 n
+菌丝 93 n
+菌丝体 41 n
+菌伞 3 n
+菌体 3 n
+菌剂 3 n
+菌子 3 n
+菌斑 17 n
+菌斑指数 3 n
+菌斑控制 3 n
+菌柄 3 n
+菌株 25 n
+菌核 7 n
+菌核病 5 n
+菌根 34 n
+菌根营养 3 n
+菌棒 3 n
+菌毛 3 n
+菌毛抗原 3 n
+菌毛蛋白 3 n
+菌液 3 n
+菌物 3 n
+菌状 3 n
+菌痢 3 n
+菌种 41 n
+菌类 64 n
+菌素 3 n
+菌素类 3 n
+菌索 3 n
+菌紫素 3 n
+菌群失调 3 n
+菌肥 3 n
+菌胶团 3 n
+菌膜 3 n
+菌苔 3 n
+菌苗 29 n
+菌草 3 n
+菌落 33 n
+菌落形成 3 n
+菌血症 4 n
+菌褶 3 n
+菍 2 zg
+菎麻 3 z
+菏 91 ns
+菏泽 337 ns
+菏泽地区 5 ns
+菏泽市 11 ns
+菑 659 zg
+菓 12 zg
+菔 40 x
+菖 12 n
+菖蒲 29 n
+菘 23 g
+菜 8544 n
+菜价 19 n
+菜农 40 n
+菜刀 106 n
+菜包子 3 n
+菜单 169 n
+菜单中选择 4 n
+菜单化 3 n
+菜单栏 3 n
+菜单项 3 n
+菜叶 39 n
+菜名 12 n
+菜品 41 n
+菜团子 2 n
+菜园 118 n
+菜园坝 35 ns
+菜园子 58 n
+菜圃 5 n
+菜地 100 n
+菜场 29 n
+菜墩子 3 n
+菜头 5 n
+菜子 8 n
+菜子油 2 n
+菜子饼 3 n
+菜市 28 n
+菜市口 23 n
+菜市场 56 n
+菜店 3 n
+菜心 7 n
+菜摊 7 n
+菜板 4 n
+菜枯 3 n
+菜根 12 n
+菜梗 3 n
+菜汁 7 n
+菜汤 288 n
+菜油 41 n
+菜点 21 n
+菜牛 17 n
+菜瓜 4 n
+菜瓜布 3 n
+菜瓮 2 n
+菜田 16 n
+菜畦 15 n
+菜码儿 3 n
+菜碟 3 n
+菜种 3 n
+菜窖 3 n
+菜筐 3 n
+菜篮 16 n
+菜篮子 209 n
+菜篮子工程 2 n
+菜籽 19 n
+菜籽油 12 n
+菜粉蝶 3 n
+菜系 1048 n
+菜羊 3 n
+菜羹 3 n
+菜肴 1012 n
+菜色 27 n
+菜花 58 n
+菜苔 3 n
+菜苗 2 n
+菜茎 3 n
+菜菜 3 n
+菜蓝 3 n
+菜蔬 77 n
+菜蔬之色 3 nz
+菜薹 4 n
+菜蚜 2 n
+菜螟 3 n
+菜谱 17 n
+菜豆 41 n
+菜货 3 n
+菜贩 3 n
+菜金 2 n
+菜锅 3 n
+菜青 3 n
+菜青虫 5 n
+菜饭 8 n
+菜饼 5 n
+菜馆 32 n
+菜鸟 36 n
+菜鸭 3 n
+菜鹅 3 n
+菝 16 x
+菝葜 3 n
+菟 24 n
+菟丝子 34 n
+菠 10 n
+菠菜 178 n
+菠萝 236 n
+菠萝包 3 n
+菠萝树 3 n
+菠萝汁 3 n
+菠萝油 3 n
+菠萝派 3 n
+菠萝蜜 12 n
+菡 21 n
+菡子 2 n
+菡萏 7 n
+菥 11 x
+菩 64 n
+菩提 185 n
+菩提伽耶 3 n
+菩提子 8 n
+菩提树 64 n
+菩萨 1546 n
+菩萨低眉 3 n
+菩萨像 3 n
+菩萨心肠 33 n
+菩萨顶 8 n
+菪 47 x
+菰 52 g
+菱 426 n
+菱形 420 n
+菱形体 3 n
+菱形硫 3 n
+菱形站位 3 n
+菱湖 259 ns
+菱花 1429 n
+菱花镜 3 nz
+菱角 43 n
+菱铁矿 26 nz
+菱锰矿 3 n
+菱镁 10 nz
+菱镁矿 44 n
+菱镜 3 nz
+菲 1051 ns
+菲亚 3 ns
+菲亚特 28 nrt
+菲亚特集团 5 nt
+菲仪 4 nz
+菲俑 3 n
+菲克 3 nrt
+菲利 3 ns
+菲利克斯 5 nrt
+菲利斯 3 ns
+菲利普 42 nrt
+菲利普岛 2 ns
+菲利普斯 19 nrt
+菲利波 4 ns
+菲利浦 31 ns
+菲利浦斯 6 ns
+菲利皮 4 nrt
+菲力普 3 nz
+菲力浦 3 nz
+菲勒 2 nrt
+菲卡 5 nrt
+菲咯啉 3 nr
+菲国 3 ns
+菲奇 7 nrt
+菲奥莉娜 3 nrt
+菲奥雷 7 nrt
+菲娜 2 nrt
+菲安娜 3 nrt
+菲尔 54 nrt
+菲尔丁 3 nrt
+菲尔克 4 nrt
+菲尔德 39 nrt
+菲尔曼 3 nrt
+菲尔特 4 nrt
+菲尔茨奖 19 nz
+菲尼克斯 116 nrt
+菲廷分解 3 nr
+菲律宾 1024 ns
+菲律宾人 21 nr
+菲律宾共和国 30 ns
+菲律宾参议院 2 nt
+菲律宾海 3 ns
+菲律宾群 3 ns
+菲律宾话 3 n
+菲律宾语 3 nz
+菲德勒 3 nrt
+菲德尔 3 nrt
+菲戈 5 nrt
+菲才寡学 3 nr
+菲拉 5 nrt
+菲拉利 14 ns
+菲政府 2 nt
+菲斯 2 nrt
+菲林 7 ns
+菲格 2 nrt
+菲比 4 nrt
+菲涅耳区 3 ns
+菲特 4 nrt
+菲礼 3 nz
+菲舍尔 13 nrt
+菲英 2 nrt
+菲茨 7 nrt
+菲茨杰拉德 7 nrt
+菲茨沃特 8 nrt
+菲莫维奇 8 nrt
+菲菲飞 3 nr
+菲薄 18 nr
+菲语 3 nz
+菲酌 3 v
+菲食薄衣 3 nz
+菴 10 zg
+菸 7 zg
+菸丝 3 z
+菸叶 3 t
+菸毒 3 vn
+菸碱 3 vn
+菸草 3 vn
+菸酒 3 vn
+菸酒公卖 3 v
+菹 22 g
+菻 10 zg
+菼 2 zg
+菽 36 zg
+菽庄花园 3 ns
+菽水承欢 3 n
+菽粟 3 n
+菽麦 3 ns
+菾 6 zg
+萁 31 g
+萃 81 v
+萃取 170 v
+萃取柱 3 vn
+萃取液 3 vn
+萃聚 3 v
+萄 36 x
+萆 19 x
+萋 20 x
+萌 163 v
+萌兆 3 nz
+萌动 24 v
+萌发 244 v
+萌渚岭 9 ns
+萌牙困难 3 z
+萌生 147 v
+萌芽 425 v
+萌芽期 14 nz
+萌芽林 3 nz
+萌蘖 11 v
+萌起 3 v
+萍 239 nr
+萍乡 53 ns
+萍乡市 10 ns
+萍水 7 ns
+萍水相逢 20 i
+萍踪 11 n
+萍踪侠影 3 n
+萍踪浪迹 5 i
+萍钢 2 n
+萍飘蓬转 3 i
+萎 51 v
+萎缩 428 v
+萎缩性 20 n
+萎蔫 8 v
+萎谢 5 v
+萎陷 2 v
+萎雕 3 n
+萎靡 62 v
+萎靡不振 38 i
+萎顿 23 v
+萎黄 22 v
+萎黄病 3 n
+萏 9 x
+萐 481 zg
+萑 27 g
+萒 66 zg
+萘 92 g
+萘乙酸 2 nz
+萘啶酮酸 3 nz
+萘磺酸 4 n
+萘胺 23 nz
+萘酚 23 nz
+萘醌 12 nz
+萜 75 g
+萜烯 8 n
+萜烯树脂 3 n
+萜类 11 n
+萝 248 n
+萝匐 3 n
+萝北 2 n
+萝北县 3 n
+萝卜 343 n
+萝卜丝 15 nrt
+萝卜头 3 n
+萝卜干 6 nrt
+萝卜快了不洗泥 2 l
+萝卜汤 3 n
+萝卜缨 3 n
+萝卜腿 3 n
+萝卜花 22 n
+萝卜青菜 3 n
+萝筐 3 n
+萝芙木 12 n
+萝菠 3 n
+萣 3 zg
+萤 42 n
+萤光 13 n
+萤光幕 3 n
+萤光板 3 n
+萤光灯 3 n
+萤光镜 3 n
+萤幕 3 n
+萤幕上 3 n
+萤桥 3 n
+萤桥国中 3 n
+萤桥国小 3 n
+萤火 17 n
+萤火虫 109 n
+萤火虫儿 3 n
+萤灯雪屋 3 n
+萤石 427 n
+萤窗 3 n
+萤窗雪案 3 v
+营 6010 n
+营业 1214 n
+营业人员 3 n
+营业厅 44 n
+营业员 144 n
+营业处 3 n
+营业室 5 n
+营业局 3 n
+营业性 29 n
+营业房 4 n
+营业所 32 n
+营业所得 3 l
+营业执照 165 n
+营业日 4 n
+营业时间 3 n
+营业毛利 3 n
+营业点 3 n
+营业税 74 n
+营业站 2 n
+营业网点 3 n
+营业证 5 n
+营业费用 3 n
+营业部 225 n
+营业项目 3 n
+营业额 161 n
+营产 3 vn
+营伍 3 n
+营具 3 n
+营养 4114 n
+营养不良 3 l
+营养价值 3 l
+营养体 26 n
+营养元素 53 n
+营养医师 3 n
+营养卫生 3 n
+营养厨房 3 vn
+营养发水 3 n
+营养品 53 n
+营养器官 3 n
+营养型 12 n
+营养学 57 n
+营养学分 3 n
+营养学家 46 n
+营养师 54 n
+营养性 14 n
+营养成分 3 l
+营养枝 3 n
+营养液 98 n
+营养片 3 n
+营养物 21 n
+营养物质 3 n
+营养状况 3 n
+营养生长 3 n
+营养盐 9 n
+营养素 184 n
+营养繁殖 3 l
+营养缺乏症 3 n
+营养费 6 n
+营养过剩 3 l
+营养部 3 n
+营养配餐 3 n
+营养量 3 n
+营养链 3 n
+营养障碍 3 n
+营养霜 4 n
+营养食品 3 n
+营养餐 3 n
+营利 77 n
+营利事业 3 n
+营利性 13 n
+营前 22 t
+营力 3 n
+营办 4 v
+营务官 3 n
+营区 131 n
+营区规划 3 n
+营卫 3 vn
+营口 112 vn
+营口县 3 ns
+营口市 20 n
+营口港 2 ns
+营商 3 n
+营地 593 n
+营垒 138 n
+营墙 3 n
+营妓 3 n
+营子 20 n
+营寨 205 n
+营山 3 ns
+营山县 3 ns
+营州 21 ns
+营工 3 vn
+营帐 180 n
+营建 776 v
+营建业 3 n
+营建厂 3 n
+营建商 3 n
+营房 185 n
+营房保障 3 n
+营房勤务 3 n
+营房区 3 n
+营房管理 3 n
+营收额 28 n
+营救 558 v
+营救队 3 n
+营林 14 n
+营火 19 n
+营火会 3 n
+营火晚会 3 n
+营生 225 n
+营生之道 3 l
+营田 24 n
+营盘 83 n
+营私 66 vn
+营私作弊 3 i
+营私植党 3 n
+营私结党 3 n
+营私罔利 3 i
+营私舞弊 18 i
+营窟 3 n
+营缮 3 v
+营营 2 vn
+营营苟苟 3 i
+营营逐逐 3 n
+营葬 3 n
+营蝇斐锦 3 v
+营运 223 n
+营运商 3 n
+营运证 2 n
+营造 1379 vn
+营造业 3 n
+营造厂 3 n
+营造厂商 3 n
+营造商 3 n
+营造尺 2 n
+营部 60 n
+营部文书 3 n
+营里 86 s
+营销 1424 vn
+营销中心 3 n
+营销员 6 n
+营销商 5 n
+营销处 3 n
+营销学 34 n
+营销师 3 n
+营销整合 3 n
+营销策划 3 n
+营销网 3 n
+营销者 3 n
+营销部 8 n
+营长 678 n
+营门 27 n
+营门口 6 n
+营队 10 n
+营院 4 n
+萦 56 v
+萦回 9 v
+萦怀 18 v
+萦系 3 v
+萦纡 2 v
+萦绕 91 v
+萦绕在 3 z
+萦身 3 v
+萧 894 nr
+萧一山 13 nr
+萧中慧 190 nr
+萧乾 12 nr
+萧亚轩 3 nr
+萧仲恭 12 nr
+萧伊苏 3 nr
+萧伯纳 42 nr
+萧何力 2 nr
+萧何功 3 nr
+萧何月 3 nr
+萧何败 3 nr
+萧何采 3 nr
+萧余庆 4 nr
+萧先生 17 nr
+萧关 6 ns
+萧关根 3 nr
+萧关鸿 2 nr
+萧军萧 2 nr
+萧别离 3 nr
+萧功秦 4 nr
+萧劲光 4 nr
+萧半仙 6 nr
+萧半和 3 nr
+萧博宜 26 nr
+萧县 27 ns
+萧友梅 7 nr
+萧史乘 7 nr
+萧合达 3 nr
+萧同兹 3 nr
+萧名中 2 nr
+萧嘉穗 28 nr
+萧国亮 5 nr
+萧墙 11 nr
+萧墙之祸 3 i
+萧墙祸起 3 i
+萧大亨 4 nr
+萧大侠 29 nr
+萧大哥 17 nr
+萧大爷 7 nr
+萧大王 10 nr
+萧大观 2 nr
+萧天润 3 nr
+萧天赐 3 nr
+萧太后 13 nr
+萧太太 4 nr
+萧姑娘 2 nr
+萧姑娘可 2 nr
+萧婷婷 8 nr
+萧子显 7 nr
+萧子良 6 nr
+萧子蔚 13 nr
+萧孝嵘 7 nr
+萧宝寅 3 nr
+萧宝融 2 nr
+萧寺图 3 nr
+萧居士 5 nr
+萧山 63 nr
+萧山人 7 nr
+萧山区 5 ns
+萧山县 3 ns
+萧山市 6 ns
+萧山网 3 nr
+萧峰举 2 nr
+萧峰久 3 nr
+萧峰伸 3 nr
+萧峰冷 2 nr
+萧峰双 8 nr
+萧峰叹 10 nr
+萧峰听 4 nr
+萧峰呆 2 nr
+萧峰喜 6 nr
+萧峰喝 2 nr
+萧峰奇 6 nr
+萧峰定 2 nr
+萧峰射 3 nr
+萧峰微 5 nr
+萧峰微微 13 nr
+萧峰心 36 nr
+萧峰怒 5 nr
+萧峰惊 3 nr
+萧峰才 2 nr
+萧峰拔 2 nr
+萧峰掌 5 nr
+萧峰摇 6 nr
+萧峰放 2 nr
+萧峰料 2 nr
+萧峰朗 4 nr
+萧峰极 2 nr
+萧峰甚 5 nr
+萧峰直 2 nr
+萧峰相 4 nr
+萧峰知 7 nr
+萧峰笑 13 nr
+萧峰自 6 nr
+萧峰行 2 nr
+萧峰见 5 nr
+萧峰赞 2 nr
+萧峰越 2 nr
+萧峰身 6 nr
+萧峰轻 4 nr
+萧峰连 4 nr
+萧峰马 3 nr
+萧峰骑 2 nr
+萧御史 3 nr
+萧德言 3 nr
+萧怀侯 3 nr
+萧思温 7 nr
+萧文寿 18 nr
+萧新煌 2 nr
+萧方智 10 nr
+萧普贤 7 nr
+萧曹避席 3 nr
+萧望之 5 nr
+萧朝贵 7 nr
+萧条 288 a
+萧条区 3 ns
+萧林任 2 nr
+萧树文 45 nr
+萧梁 19 nr
+萧森 3 nr
+萧楚女 3 nr
+萧正楠 3 nr
+萧淑慎 3 nrfg
+萧淑芳 2 nrfg
+萧清河 3 nr
+萧渊明 8 nr
+萧滓 4 n
+萧灼基 2 nr
+萧然 25 nr
+萧然物外 3 i
+萧燕燕 2 nr
+萧特末 2 nr
+萧瑟 47 nr
+萧瑟处 3 nr
+萧甬线 3 nr
+萧疏 9 nr
+萧疏鬼 2 nr
+萧皇后 144 nr
+萧知院 2 nr
+萧秋水 3 nr
+萧索 36 nr
+萧红 12 nr
+萧绍矩 2 nr
+萧绎命 3 nr
+萧绎自立 2 nr
+萧翼赚 5 nr
+萧耀南 5 nr
+萧老侠 4 nr
+萧芳芳 2 nr
+萧荫堂 8 nr
+萧萧 96 nr
+萧衍之 2 nr
+萧衍天 2 nr
+萧衍献 2 nr
+萧观音 4 nr
+萧规曹随 5 nr
+萧让照 2 nr
+萧远山 91 nr
+萧遏鲁 10 nr
+萧道成 18 nrfg
+萧邦 8 nr
+萧郎陌路 3 nr
+萧长华 10 nr
+萧韩家奴 6 nr
+萧颖士 2 nr
+萧飒 3 z
+萨 1005 nr
+萨丕尔 6 nr
+萨丽哈 2 nr
+萨义德 4 nr
+萨之战 2 nr
+萨乌丁 22 nr
+萨乌尔 2 nr
+萨了尼亚 3 nr
+萨仁高娃 3 nr
+萨伊夫 46 nr
+萨伊德 4 nr
+萨伏伊 5 nr
+萨伏依 13 nr
+萨伐尔 7 nr
+萨克 32 nr
+萨克司风 3 nr
+萨克图 19 nr
+萨克塞 2 nr
+萨克拉 2 nr
+萨克拉门托 16 nrt
+萨克斯 53 nr
+萨克斯管 23 nr
+萨克斯风 3 nrt
+萨克旗 7 nr
+萨克森 119 nr
+萨克森州 3 ns
+萨克森豪森 5 nr
+萨克管 3 nr
+萨克达 3 nr
+萨克迪纳 8 nrt
+萨克逊 7 nr
+萨克逊人 3 nrt
+萨克雷 19 nr
+萨克领 2 nr
+萨克马 2 nr
+萨兰登 2 nr
+萨兰顿 2 nr
+萨其玛 5 nr
+萨其马 3 nr
+萨内蒂 3 nr
+萨内赫 3 nr
+萨冈 31 nrt
+萨切夫 2 nr
+萨列里 4 nr
+萨利亚 5 nr
+萨利克 9 nr
+萨利哈 2 nr
+萨利姆 5 nr
+萨利安 3 nr
+萨利纳斯 35 nrt
+萨利赫 24 nr
+萨加玛 3 nr
+萨勒河 2 nr
+萨勒诺 5 nr
+萨华滋 6 nr
+萨南诸 3 nr
+萨博 13 nr
+萨博尼斯 3 ns
+萨卡特卡斯 2 nrt
+萨卡萨 2 nr
+萨卡里亚 4 nrt
+萨卢斯 2 nr
+萨发维 3 nr
+萨吉姆 14 nr
+萨哈 32 nrt
+萨哈伯 7 nr
+萨哈夫 60 nr
+萨哈廉 2 nrt
+萨哈林 40 nr
+萨哈洛夫 2 nrt
+萨哈连 2 nr
+萨嘎 3 nr
+萨嘎县 3 nr
+萨图尔 4 nr
+萨城邦 6 nr
+萨基亚 4 nr
+萨基姆 3 nr
+萨基里 3 nr
+萨塔瓦 2 nr
+萨塞克斯 5 nrt
+萨多 3 nrt
+萨多笑 2 nr
+萨夫拉 2 nr
+萨姆松 4 nr
+萨姆索诺夫 2 nrt
+萨姆邦 3 nr
+萨宝府 2 nr
+萨尔 38 nr
+萨尔加多 5 nrt
+萨尔区 5 ns
+萨尔卡 2 nr
+萨尔图区 3 ns
+萨尔塔 3 nr
+萨尔察赫河 3 ns
+萨尔州 3 nr
+萨尔布吕肯 25 nrt
+萨尔托 13 nr
+萨尔拉斯 3 nrt
+萨尔斯堡 16 nrt
+萨尔杜 4 nr
+萨尔河 4 nr
+萨尔浒 29 nr
+萨尔温江 23 nr
+萨尔玛 3 nr
+萨尔瓦 3 nr
+萨尔瓦多 109 nrt
+萨尔瓦多市 2 nrt
+萨尔维尼 2 nrt
+萨尔茨 8 nrt
+萨尔茨堡 33 nrt
+萨尔蒂科 4 nrt
+萨尔西 2 nr
+萨尔诺夫 2 nrt
+萨尔贡 19 nr
+萨尔达 36 nr
+萨尔达渠 2 nr
+萨尔迪瓦 5 nrt
+萨尔马 10 nr
+萨尼亚 4 nr
+萨尼奥尔 3 nrt
+萨巴依 2 nr
+萨巴斯 6 nr
+萨巴莱 8 nr
+萨巴莱塔 3 nrt
+萨巴蒂 3 nr
+萨巴蒂埃 2 nrt
+萨巴赫 10 nr
+萨布克 2 nr
+萨布林 7 nr
+萨布素 29 nr
+萨布里 33 nrt
+萨师俊 3 nr
+萨帕塔 35 nr
+萨帝鹏 38 nr
+萨弗里 3 nr
+萨彦岭 13 nr
+萨彦诺 2 nr
+萨德伯 4 nr
+萨德克 2 nr
+萨德勒 5 nr
+萨德夫人 5 nrt
+萨德尔 2 nr
+萨德弥 2 nr
+萨德科 2 nr
+萨托利 2 nr
+萨托诺 2 nr
+萨托鲁 3 nr
+萨扬舒 3 nr
+萨拉 71 nrt
+萨拉丁 19 nr
+萨拉乌 5 nr
+萨拉伊 2 nr
+萨拉勒 2 nr
+萨拉卡 2 nr
+萨拉夫 3 nr
+萨拉姆 14 nr
+萨拉弗 2 nr
+萨拉戈 7 nr
+萨拉戈萨 16 nrt
+萨拉托 5 nr
+萨拉托夫 17 nrt
+萨拉托夫州 2 nrt
+萨拉拉 4 nrt
+萨拉斯 3 nr
+萨拉族 2 nr
+萨拉曼 8 nr
+萨拉查 4 nr
+萨拉森人 3 nrt
+萨拉热窝 33 ns
+萨拉特 2 nr
+萨拉班 2 nr
+萨拉米 11 nrt
+萨拉萨蒂 3 nrt
+萨拉西 3 nr
+萨拉赫丁 2 nrt
+萨拉逊 2 nr
+萨拉齐 6 nr
+萨摩 17 nrt
+萨摩亚 41 nr
+萨摩亚独立国 4 ns
+萨摩亚群岛 18 ns
+萨摩亚语 5 nr
+萨摩斯 4 nr
+萨摩斯岛 6 ns
+萨摩维 2 nr
+萨摩耶 3 nr
+萨摩藩 18 nr
+萨文比 2 nr
+萨斯 8 nr
+萨斯喀 3 nr
+萨斯喀彻温 5 nrt
+萨斯喀彻温省 7 ns
+萨斯奎 4 nr
+萨斯州 3 nr
+萨斯河 2 nr
+萨斯迦 21 nr
+萨旺那 2 nr
+萨朗宝 2 nr
+萨杜尔 3 nr
+萨林斯 2 nr
+萨查利 2 nr
+萨格勒 3 nr
+萨格勒布 34 nrt
+萨格尔 3 nr
+萨比 6 nrt
+萨比纳 2 nr
+萨汉德 2 nr
+萨沃纳 2 nr
+萨沙便 3 nr
+萨法尔 8 nr
+萨法德 2 nr
+萨法洛 4 nr
+萨法维 11 nr
+萨波特 2 nr
+萨洛尼卡 18 nrt
+萨满摇 2 nr
+萨满教 71 nr
+萨满来 3 nr
+萨满舞 9 nr
+萨满跳 7 nr
+萨灵阿 2 nr
+萨烈兹 2 nr
+萨特 72 nr
+萨特兰 4 nr
+萨特利 3 nr
+萨特累 2 nr
+萨特阔 3 nr
+萨琪玛 3 nr
+萨瑟兰 3 nr
+萨瓦伊 5 nr
+萨瓦尔 2 nr
+萨瓦河 25 nr
+萨瓦纳 5 nr
+萨瓦蒂 2 nr
+萨福克 8 nr
+萨福克县 2 ns
+萨福克郡 4 nr
+萨福均 2 nr
+萨科夫 4 nr
+萨科齐 8 nr
+萨穆埃尔 9 nrt
+萨穆德 2 nr
+萨空了 4 nr
+萨米 4 nrt
+萨米亚 3 nr
+萨米尔 2 nr
+萨米恩 2 nr
+萨米迪 2 nr
+萨纳加 6 nr
+萨维奇 6 nr
+萨维奥 9 nr
+萨维尔 5 nr
+萨维尼 6 nr
+萨维德 2 nr
+萨缪尔 3 nr
+萨缪尔森 30 nr
+萨耶赫 2 nr
+萨芬娜 4 nr
+萨苏 4 ns
+萨莫拉 8 nrt
+萨莫斯 3 nr
+萨莫特 2 nr
+萨莫耶 6 nr
+萨莱城 4 nr
+萨莱斯 2 nr
+萨莱诺 3 nr
+萨菲 21 nr
+萨萨克 5 nr
+萨萨尼亚 2 ns
+萨蒂 6 nr
+萨蒂亚格 2 nrt
+萨诸邦 2 nr
+萨诺夫 3 nr
+萨贾德 5 nr
+萨赫勒 12 nr
+萨赫尔 2 nr
+萨达姆 156 nr
+萨达姆国际机场 2 nz
+萨达特 35 nr
+萨迦 39 nr
+萨迦之 3 nr
+萨迦县 3 nr
+萨迦寺 3 nr
+萨迦派 18 nr
+萨迦诸 4 nr
+萨迪克 4 nr
+萨迪格 5 nr
+萨里 18 nrt
+萨里宁 8 nr
+萨里山 2 nr
+萨里郡 9 nr
+萨金特 2 nr
+萨镇冰 6 nr
+萨长诸 2 nr
+萨阿东 3 nr
+萨阿德 12 nr
+萨雅索 2 nr
+萨雷姆 2 nr
+萨雷阔 4 nr
+萨雷齐 3 nr
+萨非 20 ns
+萨韦河 2 nr
+萨马兰奇 18 nrt
+萨马尔 3 nr
+萨马拉 17 nrt
+萨马拉州 2 ns
+萨马瓦 2 nr
+萨默塞特 4 nrt
+萨默德 3 nrt
+萨默斯 11 nrt
+萨齐玛 3 nr
+萩 3 zg
+萬 2 zg
+萱 377 n
+萱堂 3 n
+萱姿 3 n
+萱望 7 n
+萱花椿树 3 n
+萱草 14 n
+萱草根 3 n
+萵 3 zg
+萷 44 zg
+萸 9 x
+萹蓄 3 v
+萼 452 zg
+萼片 105 n
+落 8776 v
+落三落四 3 i
+落下 1090 v
+落下去 3 v
+落下来 3 l
+落下灰 3 l
+落下风 3 l
+落九天 3 i
+落乡 3 v
+落了空 3 i
+落于 3 v
+落井 3 n
+落井下水 3 i
+落井下石 51 i
+落井投石 3 i
+落人口实 3 i
+落令 3 n
+落价 3 v
+落伍 83 n
+落伍者 4 n
+落体 8 n
+落俗 3 a
+落儿 5 n
+落入 892 v
+落入俗套 3 i
+落入法网 3 i
+落到 782 v
+落到实处 82 l
+落单 3 a
+落去 3 v
+落发 25 v
+落发为僧 3 n
+落叶 805 n
+落叶乔木 3 nz
+落叶归根 12 i
+落叶归秋 3 n
+落叶松 150 n
+落叶林 3 n
+落叶果树 3 n
+落叶树 7 n
+落叶知秋 3 i
+落后 2713 a
+落后分子 3 l
+落后地区 3 ns
+落后状况 3 l
+落后者 11 n
+落后面貌 3 i
+落在后面 3 l
+落地 954 n
+落地式 5 n
+落地扇 3 n
+落地有声 3 i
+落地灯 2 n
+落地生根 3 i
+落地窗 36 n
+落地箱 3 n
+落地钟 3 l
+落地雷 3 i
+落坐 3 v
+落基 64 n
+落基山 27 ns
+落墨 3 n
+落套 8 a
+落子 26 n
+落定 3 v
+落实 2219 a
+落实到人 3 l
+落实到户 3 l
+落实工作 3 l
+落实政策 3 l
+落实率 4 n
+落寞 62 a
+落尘 3 n
+落尘量 3 n
+落山 78 ns
+落山风 3 l
+落岩 12 n
+落巢 3 n
+落差 348 a
+落市 3 v
+落帆 3 v
+落帐 3 n
+落幕 106 v
+落座 139 v
+落弟 3 n
+落得 285 v
+落得清净 3 l
+落成 543 v
+落成典礼 3 i
+落户 204 n
+落拓 27 v
+落拓不羁 6 i
+落掉 3 v
+落日 104 n
+落日余晖 3 n
+落晖 3 n
+落月屋梁 3 i
+落枕 11 v
+落枕穴 3 i
+落果 4 n
+落架 4 v
+落柯 3 n
+落标 3 n
+落桃 3 n
+落榜 107 v
+落榜生 5 i
+落槌 3 n
+落槽 3 n
+落款 62 n
+落水 157 v
+落水洞 3 n
+落水狗 18 n
+落水管 3 n
+落水者 3 n
+落汤螃蟹 3 v
+落汤鸡 27 i
+落泊 3 v
+落法网 3 n
+落泪 116 v
+落海 3 ns
+落潮 22 n
+落点 64 n
+落照 3 v
+落石 13 n
+落矶山 3 ns
+落矿 3 n
+落空 148 n
+落笔 40 v
+落笔审慎 3 n
+落第 44 v
+落籍 14 n
+落絮 3 n
+落纸云烟 3 i
+落纸如飞 3 i
+落网 39 v
+落羽杉 3 n
+落翅仔 3 n
+落耳坡村 2 ns
+落聘 5 v
+落脚 115 v
+落脚处 15 i
+落脚点 59 n
+落膘 3 v
+落花 56 n
+落花无言 3 i
+落花有意 8 i
+落花流水 159 i
+落花生 12 n
+落英 43 n
+落英缤纷 11 i
+落草 55 n
+落草为寇 3 i
+落荒 35 v
+落荒而走 3 i
+落荒而逃 85 i
+落荚 3 v
+落落 3 v
+落落大方 37 i
+落落寡合 9 i
+落落寡欢 3 i
+落落穆穆 3 ns
+落落难合 3 i
+落落难舍 3 i
+落葬 6 v
+落蕾 3 n
+落话 3 v
+落谷 3 n
+落败 154 v
+落进 3 v
+落选 107 v
+落选者 3 n
+落选赛 3 n
+落锁 3 v
+落锤 3 n
+落阱下石 3 vn
+落难 68 a
+落雁 3 n
+落雁沉鱼 3 i
+落雨 3 n
+落雪 41 n
+落雷 3 v
+落霜 3 n
+落霞 13 n
+落霞与孤鹜齐飞 4 l
+落音 3 n
+落首 3 v
+落马 165 v
+落马洲 5 ns
+落魂 3 n
+落魄 120 a
+落魄不偶 3 i
+落魄不羁 3 i
+落魄江湖 3 i
+葀 4 zg
+葆 53 vg
+葇 4 zg
+葉 58 zg
+葎 3 zg
+葑 209 g
+葑菲之采 3 nr
+葖 3 n
+著 6171 n
+著书 84 n
+著书立说 38 n
+著书立说者 2 n
+著于竹帛 3 i
+著作 3447 n
+著作史 3 n
+著作权 99 n
+著作权人 23 n
+著作权法 14 n
+著作等身 7 n
+著作者 2 n
+著合 3 v
+著名 9342 a
+著名人士 3 n
+著名作家 3 n
+著名品牌 3 n
+著名商标 3 n
+著名景点 3 n
+著名权 3 n
+著名演员 3 n
+著名画家 3 n
+著名诗人 3 n
+著实 3 a
+著录 238 n
+著录规则 3 n
+著文 57 n
+著有 3 v
+著称 951 a
+著者 53 n
+著者目录 3 n
+著者索引 3 n
+著色 3 n
+著译 22 v
+著身 3 n
+著述 540 v
+著述等身 3 n
+著迷 3 v
+葙 5 x
+葛 414 nr
+葛一虹 8 nr
+葛不律 5 nr
+葛云萍 3 nr
+葛云飞 4 nr
+葛仙米 2 nr
+葛仙翁 5 nr
+葛伊更 2 nr
+葛优 8 nr
+葛元芬 2 nr
+葛先生 20 nr
+葛光佩 6 nr
+葛兰素 8 nr
+葛兰西 7 nr
+葛凌峰 3 nr
+葛利普 6 nr
+葛剑雄 5 nr
+葛可久 2 nr
+葛城美里 3 ns
+葛城臣 2 nr
+葛天氏 4 nr
+葛如江 2 nr
+葛娟 5 nrfg
+葛嫩 2 ns
+葛存壮 3 nr
+葛守礼 29 nr
+葛家庄 3 nr
+葛家澍 2 nr
+葛尔丹 117 nr
+葛屦履霜 3 nr
+葛岭初 2 nr
+葛巢甫 2 nr
+葛巾 2 nr
+葛巾布 2 nr
+葛巾香 2 nr
+葛布 19 nr
+葛底斯堡 2 ns
+葛店 3 ns
+葛庭燧 2 nrfg
+葛弗阿 3 nr
+葛德莱 2 nr
+葛志毅 3 nr
+葛拥宪 20 nr
+葛振峰 3 nr
+葛振林 34 nr
+葛振邦 3 nr
+葛攀藤 3 nr
+葛朗台 11 nr
+葛杜二 2 nr
+葛条沟 2 ns
+葛根 9 nr
+葛根粉 3 nr
+葛根素 3 nr
+葛根芩 2 nr
+葛民辉 3 nr
+葛永基 4 nr
+葛洛夫 12 nr
+葛洛家族 16 nr
+葛洲坝 372 ns
+葛洲坝水电站 261 nt
+葛石柱 3 nr
+葛秋芳 6 nr
+葛笃德 3 nr
+葛粉 6 nr
+葛红来 2 nr
+葛红林 11 nr
+葛罗希 16 nr
+葛罗米柯 2 nr
+葛翠琳 2 nr
+葛英健 3 nr
+葛莱美 3 nr
+葛莱美奖 3 nz
+葛藤 22 nr
+葛郎王 2 nr
+葛长老 21 nr
+葛雅丽 2 nr
+葛雷岛 2 nr
+葛麻草 2 nr
+葜 12 x
+葟 9 zg
+葡 327 ns
+葡京 8 ns
+葡伏堇 3 n
+葡国 9 ns
+葡币 3 n
+葡文 2 nz
+葡田 3 ns
+葡糖 3 n
+葡糖胺 3 nz
+葡聚糖 3 n
+葡萄 811 n
+葡萄乾 3 ns
+葡萄园 187 ns
+葡萄干 39 ns
+葡萄架 48 n
+葡萄柚 30 n
+葡萄树 3 ns
+葡萄汁 25 n
+葡萄沟 4 ns
+葡萄沟乡 3 ns
+葡萄牙 892 ns
+葡萄牙人 303 n
+葡萄牙共和国 3 ns
+葡萄牙共和国政府 2 nt
+葡萄牙政府 9 nt
+葡萄牙文 3 nz
+葡萄牙语 83 nz
+葡萄牙队 5 n
+葡萄球菌 106 n
+葡萄籽 3 n
+葡萄糖 291 n
+葡萄糖氧化酶 4 nz
+葡萄糖酸钙 8 nz
+葡萄胎 22 n
+葡萄膜 18 n
+葡萄节 5 n
+葡萄花 2 n
+葡萄藤 10 n
+葡萄酒 449 n
+葡萄酒业 3 n
+葡萄酒厂 9 n
+葡萄酒红 3 n
+葡萄酒节 2 n
+葡语 12 nz
+董 999 nr
+董一元 3 nr
+董万才 2 nr
+董乐山 2 nr
+董书明 2 nr
+董事 1190 n
+董事会 2461 n
+董事局 49 n
+董事长 1071 n
+董二人 2 nr
+董亚巍 2 nr
+董仲舒 93 nr
+董传策 6 nr
+董作宾 19 nr
+董兆乾 2 nr
+董兆云 3 nr
+董先生 3 nr
+董克毅 3 nr
+董公公 2 nr
+董其昌 45 nr
+董其武 2 nr
+董军门 2 nr
+董分布 3 nr
+董卓 191 nr
+董卓之 14 nr
+董卓入 5 nr
+董卓劫 2 nr
+董卓拜 3 nr
+董卓欲 2 nr
+董卓西 3 nr
+董卓造 2 nr
+董卓部 3 nr
+董占华 2 nr
+董厥 7 n
+董司令 5 nr
+董国太 8 nr
+董国庆 8 nr
+董国舅 3 nr
+董增贺 2 nr
+董士选 2 nr
+董大夫 3 nr
+董太后 9 nr
+董夫人 9 nr
+董子 21 n
+董子将 7 nr
+董子武 3 nr
+董字三 2 nr
+董存瑞 53 nr
+董学礼 10 nr
+董宋臣 7 nr
+董宏磊 3 nr
+董宜胜 3 nr
+董家 273 n
+董家村 3 nr
+董寅初 6 nr
+董将仕 7 nr
+董小宛 709 nr
+董川峰 2 nr
+董师爷 46 nr
+董希文 7 nr
+董平见 2 nr
+董店 3 n
+董庚臣 11 nr
+董庞儿 106 nr
+董廷献 4 nr
+董建军 2 nr
+董建勤 4 nr
+董建华 145 nr
+董建宇 3 nr
+董开山 19 nr
+董德福 5 nr
+董必武 364 nr
+董志原 2 nr
+董志塬 8 nr
+董怀义 3 nr
+董惠波 7 nr
+董承之 2 nr
+董承自 2 nr
+董折 2 n
+董折发 3 nr
+董振国 4 nr
+董振堂 22 nr
+董文华 5 nr
+董文敏 2 nr
+董文炳 5 nr
+董方卓 66 nr
+董旭业 2 nr
+董时升 2 nr
+董昌部 3 nr
+董明月 10 nr
+董明珠 3 nr
+董显光 2 nr
+董晓扬 2 nr
+董晓燕 3 nr
+董智勇 2 nr
+董杜原 4 nr
+董来扶 8 nr
+董树槐 2 nr
+董桂枝 2 nr
+董梦阳 3 nr
+董洪亮 5 nr
+董海川 7 nr
+董润生 2 nr
+董清世 3 nr
+董渡江 54 nr
+董源 37 n
+董炯 32 nrfg
+董狐之笔 3 nr
+董狐直笔 3 nr
+董玉河 2 nr
+董现明 4 nr
+董理 3 n
+董瑶阶 3 nr
+董皇后 25 nr
+董益平 3 nr
+董监事 2 n
+董福祥 59 nr
+董秘持 3 nr
+董竹君 3 nr
+董糖 4 n
+董耀中 2 nr
+董耀会 3 nr
+董艳梅 4 nr
+董虞候 3 nr
+董解元 7 nr
+董贤举 2 nr
+董贤自 2 nr
+董贵人 5 nr
+董贵妃 2 nr
+董路 3 n
+董遇注 2 nr
+董邦达 4 nr
+董邵南 2 nr
+董都监 2 nr
+董鄂妃 3 nr
+董鄂妹妹 3 nr
+董鄂氏 21 nr
+董鄂皇后 5 nr
+董酒 6 n
+董金 16 n
+董锡林 2 nr
+董镖头 9 vn
+董长征 3 nr
+董雅庄 3 nr
+葩 5 ng
+葫 3 n
+葫芦 904 n
+葫芦丝 3 n
+葫芦依样 3 nz
+葫芦兄弟 3 n
+葫芦头 3 n
+葫芦套 5 nz
+葫芦娃 3 n
+葫芦山 2 ns
+葫芦岛 30 ns
+葫芦岛市 11 ns
+葫芦巴 2 ns
+葫芦状 7 n
+葫芦科 19 nz
+葫芦花 2 n
+葫芦茶 3 n
+葫芦蔓 5 n
+葫芦藓 4 n
+葫芦藤 3 nz
+葫蔓藤 7 n
+葬 1869 vg
+葬仪 10 n
+葬仪社 3 n
+葬埋 3 v
+葬式 12 n
+葬悼 3 v
+葬礼 270 n
+葬花 3 n
+葬身 149 n
+葬身之地 3 i
+葬身大海 3 i
+葬身河底 3 i
+葬身海底 3 i
+葬身湖底 3 i
+葬身火海 3 i
+葬身鱼腹 14 i
+葬送 92 v
+葬送前途 3 i
+葬送在 3 n
+葬送掉 3 i
+葭 50 g
+葭莩之亲 3 nr
+葱 710 n
+葱丝 5 n
+葱头 4 n
+葱姜 3 n
+葱属 3 n
+葱岭 63 n
+葱油 3 n
+葱油饼 3 n
+葱油鸡 3 n
+葱爆 3 z
+葱白 20 z
+葱绿 35 z
+葱翠 14 z
+葱翠欲滴 3 n
+葱花 37 n
+葱花券 3 n
+葱花饼 2 n
+葱茂 3 z
+葱茏 42 z
+葱莲 3 n
+葱葱 7 z
+葱蒜 3 n
+葱郁 38 z
+葳 5 a
+葳蕤 7 a
+葴 3 zg
+葵 178 n
+葵双叶 3 ns
+葵叶 3 n
+葵子 3 n
+葵扇 31 n
+葵涌 10 nrt
+葵花 355 n
+葵花仁 3 n
+葵花子 9 n
+葵花子油 3 n
+葵花宝典 3 ns
+葵花油 3 n
+葵花籽 13 n
+葵藿倾阳 3 v
+葵青 3 n
+葶 8 n
+葶苈子 4 n
+葸 2 g
+葹 2 zg
+葺 6 g
+蒀 128 zg
+蒂 463 nrt
+蒂勒 2 nrt
+蒂华纳 2 ns
+蒂博 18 nrt
+蒂卡 5 nrt
+蒂固 3 nrt
+蒂夫 4 nrt
+蒂姆 51 nrt
+蒂娜 12 nrt
+蒂尔 13 nrt
+蒂巴因 3 nrt
+蒂托 8 nrt
+蒂斯 15 nrt
+蒂格 10 nrt
+蒂格赖 3 nrt
+蒂森 11 nrt
+蒂米什瓦拉 4 nrt
+蒂罗尔 8 nrt
+蒂罗尔州 3 nrt
+蒂萨 6 nrt
+蒂萨河 8 ns
+蒂落 3 n
+蒂诺 7 nrt
+蒂默 2 nrt
+蒉 4 nr
+蒋 1017 nr
+蒋世隆 2 nr
+蒋中正 5 nr
+蒋丽莉 469 nr
+蒋二人 10 nr
+蒋二旺 22 nr
+蒋介石 2812 nr
+蒋仲苓 3 nr
+蒋元椿 12 nr
+蒋兆和 7 nr
+蒋先生 6 nr
+蒋光化 2 nr
+蒋光慈 3 nr
+蒋光鼐 14 nr
+蒋公遗训 3 nr
+蒋兴权 3 nr
+蒋勇青 3 nr
+蒋勤勤 3 nr
+蒋千红 3 nr
+蒋南翔 2 nr
+蒋友军 2 nr
+蒋唐石 2 nr
+蒋四根 3 nr
+蒋坝镇 3 ns
+蒋墅镇 3 ns
+蒋士铨 10 nr
+蒋大为 3 nr
+蒋大哥 2 nr
+蒋大椿 4 nr
+蒋天寿 8 nr
+蒋天流 2 nr
+蒋夫人 2 nr
+蒋奇之 2 nr
+蒋奇领 2 nr
+蒋子翼 3 nr
+蒋子龙 7 nr
+蒋孝严 5 nr
+蒋孝勇 28 nr
+蒋孝慈 2 nr
+蒋孝文 3 nr
+蒋孝武 14 nr
+蒋宇韬 3 nrfg
+蒋宋孔 2 nr
+蒋宋美 2 nr
+蒋宏坤 6 nr
+蒋家 9 nr
+蒋家冲 512 nr
+蒋家堰 3 nr
+蒋家庄 10 nr
+蒋家王朝 5 nr
+蒋师仁 2 nr
+蒋廷锡 6 nr
+蒋廷锴 2 nr
+蒋建华 2 nr
+蒋建宁 6 nr
+蒋建科 3 nr
+蒋张桂 2 nr
+蒋彦士 3 nr
+蒋御史 2 nr
+蒋微微 3 nr
+蒋心莲 13 nr
+蒋志光 3 nr
+蒋总统 3 nr
+蒋故总统 3 nr
+蒋文卓 4 nr
+蒋斌守 2 nr
+蒋方智 3 nr
+蒋方舟 256 nr
+蒋方良 2 nr
+蒋日记 8 nr
+蒋昌义 3 nr
+蒋明安 2 nr
+蒋明谦 2 nr
+蒋晓东 2 nr
+蒋晓月 3 nr
+蒋景祁 4 nr
+蒋智由 4 nrfg
+蒋月泉 3 nr
+蒋林涛 10 nr
+蒋树声 256 nr
+蒋校长 3 nr
+蒋梦麟 17 nr
+蒋正华 259 nr
+蒋正才 4 nr
+蒋氏家族 3 nr
+蒋沈韩 3 nr
+蒋沉韩 2 nr
+蒋海澄 2 nr
+蒋炳尧 3 nr
+蒋爱丽 2 nr
+蒋玉祥 2 nr
+蒋玉菡 30 nr
+蒋琬奏 3 nr
+蒋益沣 2 nr
+蒋石林 2 nr
+蒋硕杰 256 nr
+蒋祝平 769 nr
+蒋竹青 3 nr
+蒋筑英 2 nr
+蒋管区 4 nr
+蒋红星 256 nr
+蒋纬国 6 nr
+蒋绍华 18 nr
+蒋经国 106 nr
+蒋维乔 3 nr
+蒋翊武 11 nr
+蒋耀平 9 nr
+蒋老拳师 8 l
+蒋舵主 15 nr
+蒋蓉妹 5 nr
+蒋调侯 9 nr
+蒋远华 256 nr
+蒋锡金 10 nr
+蒋长瑜 19 nr
+蒋门神 33 nr
+蒋阎冯 29 nr
+蒋雯丽 5 nr
+蒋颜永 3 nr
+蒋高明 3 nr
+蒋黔贵 4 nr
+蒌 16 x
+蒍 2 zg
+蒎 29 g
+蒐 7 zg
+蒐录 3 vn
+蒐求 3 vn
+蒐罗 3 v
+蒐证 3 vn
+蒐购 3 vn
+蒐集 3 vn
+蒕 21 zg
+蒖 2 zg
+蒗 8 g
+蒗渠 3 ns
+蒙 3031 v
+蒙一灯 3 nz
+蒙上 3 ns
+蒙上天 2 nr
+蒙上帝 2 nr
+蒙丞相 4 nr
+蒙乐山 2 ns
+蒙事 3 n
+蒙人 3 ns
+蒙代尔 5 nz
+蒙以养正 3 nr
+蒙众 2 n
+蒙众兄弟 2 nr
+蒙住 125 v
+蒙使君 2 nr
+蒙保国 4 ns
+蒙保宋 4 nr
+蒙兀儿 10 nr
+蒙兀室韦 6 nr
+蒙元 4 nz
+蒙元史 2 nr
+蒙先帝 4 nr
+蒙先皇帝 2 nr
+蒙克 10 ns
+蒙克莱 3 nr
+蒙其利 2 ns
+蒙其庥 2 nr
+蒙养院 4 nz
+蒙冤 37 v
+蒙冤受屈 3 i
+蒙冲斗 5 nr
+蒙击兵 2 nr
+蒙力克 5 nr
+蒙化 6 ns
+蒙博托 24 nr
+蒙卡奇 3 nr
+蒙卡尔 4 nr
+蒙卡达 2 nr
+蒙厚恩 2 nr
+蒙受 151 v
+蒙受损失 3 l
+蒙古 5631 ns
+蒙古人 675 nrt
+蒙古人民革命党 24 nt
+蒙古人种 156 l
+蒙古包 93 nz
+蒙古国 214 ns
+蒙古国政府 2 nt
+蒙古大夫 3 ns
+蒙古政府 6 nt
+蒙古文 35 nz
+蒙古族 1753 nz
+蒙古族人 9 nz
+蒙古时代 3 l
+蒙古症 3 nz
+蒙古草原 3 ns
+蒙古营 10 ns
+蒙古语 202 nz
+蒙古马 43 ns
+蒙古高原 98 ns
+蒙台梭 6 nr
+蒙名臣 2 nr
+蒙员外 3 nr
+蒙哄 3 z
+蒙哥 188 ns
+蒙哥临 2 ns
+蒙哥亦 3 nr
+蒙哥兴 3 ns
+蒙哥卒 2 nr
+蒙哥命 6 nr
+蒙哥嗣 3 nr
+蒙哥子 3 nr
+蒙哥孙 2 nr
+蒙哥射 2 nr
+蒙哥尔 5 nr
+蒙哥御 4 nr
+蒙哥汗 26 ns
+蒙哥筋 2 nr
+蒙哥身 2 nr
+蒙哥马利 39 ns
+蒙哥马利郡 3 ns
+蒙唐 2 nz
+蒙唐王 2 nz
+蒙嘉慧 3 nr
+蒙国恩 3 nr
+蒙圣 3 ns
+蒙圣恩 8 nr
+蒙在鼓里 137 i
+蒙地卡罗 3 ns
+蒙坦纳 4 nr
+蒙垂听 2 nr
+蒙垢 3 n
+蒙城 10 ns
+蒙城县 3 ns
+蒙塔古 8 ns
+蒙塔涅 3 nr
+蒙塔莱 6 nr
+蒙塞拉 2 ns
+蒙大圣 4 ns
+蒙大拿 3 nr
+蒙大拿州 8 ns
+蒙大那 3 ns
+蒙天恩 4 nr
+蒙太古 3 nr
+蒙太后 3 nr
+蒙太奇 38 nr
+蒙头 44 ns
+蒙头大睡 3 l
+蒙头蒙 2 nr
+蒙头转向 3 i
+蒙娜丽莎 31 nr
+蒙字会 2 l
+蒙学 5 n
+蒙学字 2 nz
+蒙学馆 2 nt
+蒙尘 12 nr
+蒙尚书 3 nr
+蒙尼德 4 nr
+蒙山 23 ns
+蒙山县 4 ns
+蒙崇祯 3 nr
+蒙巴尔 2 nr
+蒙巴萨 30 ns
+蒙巴萨港 6 ns
+蒙巴顿 22 ns
+蒙师 20 nr
+蒙师父 2 nr
+蒙彼利 3 ns
+蒙彼利埃 16 ns
+蒙得恩 5 nr
+蒙得维的亚 44 ns
+蒙德拉 6 nr
+蒙德里安 6 ns
+蒙思宠 2 nr
+蒙恩 17 nr
+蒙恩召 3 nr
+蒙恩师 2 nr
+蒙恩泽 2 nr
+蒙恩相 3 nr
+蒙恩造 2 nr
+蒙恩顾 2 nr
+蒙恬 38 nrfg
+蒙戈尔 2 nr
+蒙戈湖 3 nr
+蒙托夫 22 nr
+蒙托邦 6 nr
+蒙抚台 3 nr
+蒙授 5 n
+蒙政制 32 nr
+蒙敝 3 a
+蒙文 25 nz
+蒙文名 2 nr
+蒙文通 5 nr
+蒙斯 14 ns
+蒙斯特 2 nr
+蒙斯科 5 nz
+蒙斯队 2 nz
+蒙新湖 3 ns
+蒙方 10 nz
+蒙族 20 nz
+蒙旗 2 ns
+蒙日 2 nz
+蒙日束 3 nr
+蒙旨宣 2 nr
+蒙昧 83 nr
+蒙昧主义 17 n
+蒙昧无知 3 i
+蒙格斯 2 nr
+蒙梭号 3 nr
+蒙武虏 2 nr
+蒙毅兄弟 2 nr
+蒙汉 20 ns
+蒙汉诸 3 nr
+蒙汗药 89 nr
+蒙江 2 ns
+蒙江县 2 ns
+蒙泰尔 2 nr
+蒙泰朗 3 nr
+蒙泰涅 2 nr
+蒙泰韦尔 2 nrt
+蒙洼 2 ns
+蒙混 16 nr
+蒙混过关 29 l
+蒙牛 47 nz
+蒙特 35 ns
+蒙特克里斯蒂 2 nrt
+蒙特利 3 ns
+蒙特利尔 119 ns
+蒙特利尔市 6 ns
+蒙特勒 3 nr
+蒙特卡洛 31 nrt
+蒙特卡罗 11 nrt
+蒙特哥 5 nr
+蒙特塞 9 nr
+蒙特塞拉特岛 2 ns
+蒙特娄 3 nr
+蒙特尼 4 nr
+蒙特州 3 ns
+蒙特拉 3 nr
+蒙特柳 2 nr
+蒙特港 7 ns
+蒙特罗 4 nr
+蒙特罗斯 3 ns
+蒙特苏 14 ns
+蒙特菲 4 nr
+蒙特雷 11 nr
+蒙玉帝 6 nr
+蒙王爷 2 nr
+蒙田 4 ns
+蒙番宣 2 nr
+蒙疆经 2 nz
+蒙皇后 3 nr
+蒙皇爷 4 nr
+蒙皮 35 nz
+蒙目 3 ns
+蒙眬 12 v
+蒙眼 2 n
+蒙着红 2 l
+蒙知遇 3 nr
+蒙神尼 6 nr
+蒙罗维亚 29 ns
+蒙美路 2 ns
+蒙羞 7 nr
+蒙老爷 6 nr
+蒙胞 3 n
+蒙胧 8 a
+蒙脱石 25 nr
+蒙自 17 nr
+蒙自县 4 ns
+蒙舍诏 5 nr
+蒙苏 4 ns
+蒙茹瓦 2 nr
+蒙荣宠 3 nr
+蒙药 12 nz
+蒙莫朗西 4 nrt
+蒙蒂克拉 32 nrt
+蒙蒂尼 2 nr
+蒙蒙 93 nr
+蒙蒙亮 41 nr
+蒙蒙细雨 3 l
+蒙蒙胧胧 3 z
+蒙蔽 86 a
+蒙薄桐 2 nr
+蒙藏 9 ns
+蒙藏同胞 3 n
+蒙藏委员 3 n
+蒙藏院 2 ns
+蒙语 66 nz
+蒙谷主 2 nr
+蒙贵寺 2 nr
+蒙起 3 ns
+蒙起来 3 l
+蒙达 22 nz
+蒙迪 23 nz
+蒙迪先生 2 nr
+蒙迪欧 3 ns
+蒙迪艾 3 nr
+蒙迪迪 2 nr
+蒙逊 30 nz
+蒙逊弟 2 nr
+蒙逊灭 3 nr
+蒙量表 3 n
+蒙钧鉴 2 nr
+蒙闯王 2 nr
+蒙阴 5 ns
+蒙阴县 4 ns
+蒙难 12 nr
+蒙难记 3 nr
+蒙雨露 2 nr
+蒙霜特 3 nr
+蒙面 170 n
+蒙面人 3 nz
+蒙面侠 3 nr
+蒙面客 3 nr
+蒙韦 2 ns
+蒙音 3 nz
+蒙顶山 2 ns
+蒙馆 5 ns
+蒙马特尔 5 nrt
+蒙骗 51 v
+蒙默思 2 nr
+蒜 478 n
+蒜头 32 n
+蒜末 5 n
+蒜毫 3 n
+蒜泥 12 n
+蒜瓣 11 n
+蒜瓣儿 3 n
+蒜皮 3 n
+蒜苔 2 n
+蒜苗 12 n
+蒜蓉 3 n
+蒜薹 24 n
+蒜辫 2 n
+蒜黄 3 n
+蒟 3 zg
+蒢 2 zg
+蒨 2 zg
+蒩 2 zg
+蒪 53 zg
+蒫 11 zg
+蒭 2 zg
+蒯 14 nr
+蒯侍郎 128 nr
+蒯大富 2 nr
+蒯异度 2 nr
+蒯祥同 256 nr
+蒯祥官 128 nr
+蒯祥死 128 nr
+蒯鲁班 256 nr
+蒱 37 zg
+蒲 605 nr
+蒲与路 3 nr
+蒲东巡 2 nr
+蒲东林 5 nr
+蒲儿帖 15 nr
+蒲公英 48 nr
+蒲公英奖 8 nr
+蒲凌尘 2 nr
+蒲剑 3 nr
+蒲剧 13 n
+蒲包 6 n
+蒲包花 3 nr
+蒲县 3 ns
+蒲台村 2 nr
+蒲吾县 2 ns
+蒲团 179 n
+蒲场巷 2 nr
+蒲圻 563 nr
+蒲圻市 11 ns
+蒲城 8 nr
+蒲城县 4 ns
+蒲墨王子 5 nr
+蒲子再 2 nr
+蒲安臣 6 nr
+蒲将军 9 nr
+蒲州 36 ns
+蒲师伯 2 nr
+蒲席 3 n
+蒲式耳 46 nr
+蒲慕明 3 nr
+蒲扇 74 n
+蒲昌海 6 nr
+蒲松龄 25 nr
+蒲柳 7 nr
+蒲柳之姿 3 nr
+蒲柳之质 3 nr
+蒲桃 3 nr
+蒲殿俊 2 nr
+蒲永伟 3 nr
+蒲江 5 nr
+蒲江县 3 ns
+蒲江石 2 nr
+蒲片 3 n
+蒲犁分 3 nr
+蒲甘 31 nr
+蒲类 2 n
+蒲类海 9 nr
+蒲细柳 2 nr
+蒲结努 2 nr
+蒲绥昌 2 nr
+蒲绶昌 130 nr
+蒲缓昌 44 nr
+蒲老板 23 nr
+蒲节 3 nr
+蒲草 37 nr
+蒲葵 4 n
+蒲辅周 5 nr
+蒲速 2 n
+蒲阿军 2 nr
+蒲鞭之政 3 n
+蒲鞭之罚 3 n
+蒲鞭示辱 3 n
+蒲鱼荷 2 nr
+蒲鲁东 36 nr
+蒲鲜万 5 nr
+蒲黄榆 3 nr
+蒴 78 n
+蒴果 171 n
+蒷 4 zg
+蒸 1465 v
+蒸便当 3 v
+蒸制 7 v
+蒸压 3 n
+蒸去 3 v
+蒸发 498 v
+蒸发器 19 n
+蒸发塔 3 n
+蒸发岩相 3 n
+蒸发掉 3 i
+蒸发热 3 n
+蒸发皿 26 n
+蒸发计 3 n
+蒸发量 113 n
+蒸呢 3 n
+蒸屉 3 n
+蒸干 2 n
+蒸掉 3 v
+蒸散 3 v
+蒸散作用 3 n
+蒸暑 3 v
+蒸格 3 n
+蒸气 347 n
+蒸气机 4 n
+蒸气浴 2 n
+蒸气涡炉 3 n
+蒸气计 3 i
+蒸汽 413 n
+蒸汽压 3 n
+蒸汽参数 3 n
+蒸汽房 3 n
+蒸汽扩散 3 n
+蒸汽机 320 n
+蒸汽机车 3 n
+蒸汽浴 4 n
+蒸汽浴室 3 nz
+蒸汽熨斗 3 n
+蒸汽状 3 n
+蒸汽窜槽 3 vn
+蒸汽轮机 49 n
+蒸汽锅炉 3 n
+蒸汽锤 12 n
+蒸汽驱 3 n
+蒸沙为饭 3 i
+蒸沙成饭 3 n
+蒸湘区 3 nz
+蒸炒 3 v
+蒸点 3 n
+蒸热 3 v
+蒸煮 68 v
+蒸煮袋 3 nz
+蒸熟 3 v
+蒸笼 306 n
+蒸糕 4 n
+蒸肉 3 n
+蒸肉法 3 n
+蒸腾 133 v
+蒸腾作用 3 i
+蒸腾系数 3 i
+蒸腾速率 3 n
+蒸蒸 3 vn
+蒸蒸日上 59 i
+蒸蛋 3 n
+蒸酥 3 n
+蒸锅 12 n
+蒸面 3 n
+蒸食 4 n
+蒸饭 3 v
+蒸饭箱 3 n
+蒸饺 3 n
+蒸饼 14 n
+蒸馍 53 n
+蒸馏 263 v
+蒸馏器 11 n
+蒸馏塔 4 n
+蒸馏水 76 n
+蒸馏液 3 n
+蒸馏罐 3 n
+蒸馏釜 3 n
+蒸鱼 3 n
+蒹 17 g
+蒹葭之思 3 v
+蒹葭伊人 3 nz
+蒹葭倚玉 3 nr
+蒺藜 57 n
+蒻 3 zg
+蒼 2 zg
+蒽 36 n
+蒽油 2 n
+蒽环类 19 n
+蒽醌 281 n
+蒾 4 zg
+蒿 693 nr
+蒿俊闵 3 nr
+蒿子 8 n
+蒿子秆 3 n
+蒿子秆儿 3 n
+蒿本 3 n
+蒿杆 3 n
+蒿目时艰 3 n
+蒿秆覆盖 3 n
+蒿草 161 n
+蓁 6 x
+蓁蓁 3 nr
+蓂 2 zg
+蓄 419 n
+蓄养 17 v
+蓄力 3 n
+蓄势 51 n
+蓄势待发 29 l
+蓄发 14 v
+蓄志 3 n
+蓄念 3 n
+蓄意 137 v
+蓄意已久 3 l
+蓄意谋杀 3 l
+蓄水 141 n
+蓄水位 8 n
+蓄水屋面 3 n
+蓄水库 3 n
+蓄水池 70 n
+蓄水量 100 n
+蓄水隔热 3 l
+蓄洪 29 v
+蓄洪区 4 n
+蓄洪量 3 n
+蓄淡养青 3 l
+蓄炮 3 n
+蓄热 14 v
+蓄热器 3 n
+蓄热屋顶 3 n
+蓄牧 3 v
+蓄牧业 3 n
+蓄电 3 n
+蓄电池 184 n
+蓄电量 3 n
+蓄积 72 n
+蓄积性 2 n
+蓄积物 3 n
+蓄积着 3 l
+蓄积量 398 n
+蓄精养锐 3 n
+蓄能器 2 n
+蓄荒 3 v
+蓄谋 29 n
+蓄谋已久 24 l
+蓄财 3 v
+蓄长发 3 n
+蓄须 6 d
+蓇葖 26 n
+蓉 861 j
+蓉园 3 ns
+蓉城 20 ns
+蓉树 3 ns
+蓉蓉 22 ns
+蓊 7 z
+蓊葧 3 z
+蓊蓊郁郁 2 z
+蓊郁 6 z
+蓋 2 zg
+蓍 15 g
+蓍草 13 n
+蓍菜 3 n
+蓍龟 3 n
+蓎 2 zg
+蓏 3 zg
+蓐 6 g
+蓑 44 zg
+蓑笠 3 n
+蓑草 3 n
+蓑衣 64 n
+蓑衣草 3 n
+蓓 23 n
+蓓尔 2 nrt
+蓓蕾 21 n
+蓕 20 zg
+蓖 65 n
+蓖麻 60 n
+蓖麻子 5 n
+蓖麻油 8 n
+蓖麻蚕 7 n
+蓝 2736 nr
+蓝一白 2 nr
+蓝三色 4 nr
+蓝不蓝 3 nr
+蓝丝绒 3 nr
+蓝五叔 12 nr
+蓝五叹 2 nr
+蓝五哥 10 nr
+蓝光 100 nr
+蓝光刻 4 nr
+蓝光碟 9 nr
+蓝光高 2 nr
+蓝净法 2 n
+蓝凤凰 40 nr
+蓝剑队 7 nr
+蓝印印 5 nr
+蓝囚服 6 n
+蓝四旗 4 nr
+蓝图 333 nr
+蓝图网 3 nr
+蓝圈 3 n
+蓝均镶 2 nr
+蓝墨水 9 nr
+蓝天 643 nr
+蓝天使 5 nr
+蓝天白云 17 nr
+蓝天野 3 nr
+蓝妹妹 3 nr
+蓝威龙 3 nr
+蓝孔雀 3 nr
+蓝字 3 n
+蓝宝石 108 nr
+蓝小梅 412 nr
+蓝山 51 nr
+蓝山县 3 ns
+蓝岛 4 ns
+蓝布 129 nr
+蓝布尔 5 nr
+蓝布正 3 nr
+蓝带 3 n
+蓝幽幽 16 nr
+蓝影 2 n
+蓝慧珠 21 nr
+蓝户口 3 n
+蓝斑 3 n
+蓝方 3 n
+蓝旗东 8 nr
+蓝旗亚 3 nr
+蓝旗旗 13 nr
+蓝旗营 2 nr
+蓝明权 2 nr
+蓝晶晶 3 nr
+蓝晶石 10 nr
+蓝月亮 3 nr
+蓝本 93 n
+蓝板 3 n
+蓝极速 3 n
+蓝框 3 n
+蓝桥 5 nr
+蓝梦特 2 nr
+蓝森森 5 nr
+蓝正龙 3 nr
+蓝毗尼 2 nz
+蓝汞 3 n
+蓝汪汪 2 z
+蓝波 21 nr
+蓝洁瑛 3 nr
+蓝洪华 2 nr
+蓝海 35 ns
+蓝海前进 2 nr
+蓝海碧 3 nr
+蓝湛湛 3 nr
+蓝湾雅境 3 nr
+蓝湿革 3 j
+蓝澄澄 2 nr
+蓝火城 3 nr
+蓝灯 3 n
+蓝灰 6 n
+蓝灰色 25 n
+蓝点 4 n
+蓝点颏 3 n
+蓝烟 2 n
+蓝烟火 3 nr
+蓝片岩 2 nr
+蓝牙 158 ns
+蓝狐 2 nz
+蓝狮队 8 nr
+蓝球 4 n
+蓝琉璃 3 nr
+蓝瓦瓦 2 nr
+蓝生生 3 nr
+蓝田 134 nr
+蓝田县 22 nr
+蓝田城 2 nr
+蓝田猿人 14 n
+蓝田玉 3 nr
+蓝田生玉 3 nr
+蓝田种玉 3 n
+蓝白星 2 nr
+蓝白色 9 n
+蓝皮 2 n
+蓝皮书 46 nr
+蓝盈盈 3 nr
+蓝眼睛 3 n
+蓝矾 3 n
+蓝砂拳 2 n
+蓝秦见 2 nr
+蓝移 3 nr
+蓝答儿 8 nr
+蓝筹 75 j
+蓝筹权 14 nr
+蓝筹股 37 nr
+蓝精灵 3 nr
+蓝素 3 n
+蓝紫色 24 nr
+蓝线 3 n
+蓝细菌 3 n
+蓝绿 19 nr
+蓝绿色 34 nr
+蓝绿藻 3 nr
+蓝缕 4 nr
+蓝翡翠 2 nr
+蓝耀城 16 nr
+蓝胡子 3 nr
+蓝舌 3 n
+蓝色 1094 n
+蓝色基因 3 n
+蓝色妖姬 3 n
+蓝色盲 3 n
+蓝花 14 n
+蓝花参 3 nr
+蓝药水 3 nr
+蓝莓 3 n
+蓝莲花 3 nr
+蓝莹莹 6 nr
+蓝菌 6 n
+蓝蓝 3 nr
+蓝蓝的 7 z
+蓝蔚蔚 3 nr
+蓝藻 90 nr
+蓝藻黄素 3 n
+蓝蜗牛 3 vn
+蓝血人 3 n
+蓝衣 6 n
+蓝衫汉子 4 nr
+蓝证 3 j
+蓝调 3 n
+蓝质体 3 n
+蓝道 10 n
+蓝道行 16 nr
+蓝采和 3 nr
+蓝铜矿 3 n
+蓝镇培 2 nr
+蓝青 3 nr
+蓝青官话 3 nr
+蓝靛 18 n
+蓝领 70 nr
+蓝领工人 9 n
+蓝领阶层 3 n
+蓝飞才 2 nr
+蓝飞教 2 nr
+蓝飞陪 2 nr
+蓝马鸡 15 nr
+蓝鲸 27 nr
+蓝鸟 12 nr
+蓝黑 8 nr
+蓝黑墨水 3 nr
+蓝黑色 17 nr
+蓟 203 nr
+蓟北 3 ns
+蓟南 2 ns
+蓟县 88 ns
+蓟城 31 ns
+蓟密区 3 nr
+蓟州 175 ns
+蓟州城 6 ns
+蓟州守 2 nr
+蓟州寻 4 nr
+蓟州牢 2 nr
+蓟州管 3 nr
+蓟州罗 2 nr
+蓟辽督 14 nr
+蓟运河 23 nr
+蓟门 5 ns
+蓟门关 2 ns
+蓟门烟 2 nr
+蓟马 13 ns
+蓟马属 2 nr
+蓟马科 2 nr
+蓣 2 x
+蓦 50 d
+蓦地 771 d
+蓦然 163 d
+蓦然回首 3 ns
+蓧 128 zg
+蓨 7 zg
+蓩 48 zg
+蓬 550 nr
+蓬之声 5 nr
+蓬乱 45 a
+蓬元帅 3 nr
+蓬加托 2 nr
+蓬勃 523 nr
+蓬勃发展 3 i
+蓬勃向上 11 l
+蓬勃开展 3 i
+蓬勃生机 3 i
+蓬发戴 2 nr
+蓬塔阿雷纳斯 2 nrt
+蓬塔雷 4 nr
+蓬壁生辉 3 nr
+蓬壶 6 nr
+蓬头 3 ns
+蓬头历齿 3 i
+蓬头厉齿 3 i
+蓬头垢面 51 i
+蓬头散发 3 i
+蓬头赤脚 3 i
+蓬头跣足 3 i
+蓬安 3 ns
+蓬安县 2 ns
+蓬山 2 ns
+蓬岛瑶 2 nr
+蓬巴尔 8 nr
+蓬巴蒂 3 nr
+蓬户 3 ns
+蓬户柴门 3 ns
+蓬托尔 6 nr
+蓬松 142 a
+蓬松度 2 ns
+蓬松松 13 nr
+蓬江 2 ns
+蓬江区 3 ns
+蓬江海 2 ns
+蓬溪 3 nr
+蓬溪县 3 ns
+蓬然 3 ad
+蓬生麻中 3 l
+蓬皮杜 24 nr
+蓬筚生辉 3 v
+蓬茸 3 z
+蓬荜 5 n
+蓬荜增辉 3 i
+蓬荜生辉 5 i
+蓬莱 146 nr
+蓬莱仙境 5 nr
+蓬莱仙岛 3 ns
+蓬莱县 6 ns
+蓬莱岛 3 nr
+蓬莱市 10 ns
+蓬莱米 3 nr
+蓬莱阁 39 nr
+蓬蒿 12 nr
+蓬蓬 24 ns
+蓬蓬勃勃 20 i
+蓬蓬松松 3 z
+蓬蓬蓬 8 nr
+蓬蓬裙 3 nr
+蓬赖麻直 3 nr
+蓬车 3 ns
+蓬门 3 ns
+蓬门筚户 3 vn
+蓬门荜户 3 i
+蓬首 3 ns
+蓬首垢面 5 i
+蓰 6 zg
+蓼 110 zg
+蓼大青叶 3 n
+蓼花 3 n
+蓼蓝 2 n
+蓼虫忘辛 3 n
+蓿 27 x
+蔊菜 2 n
+蔑 75 v
+蔑伦悖理 3 vn
+蔑儿乞 6 v
+蔑弃 3 v
+蔑杀 3 v
+蔑称 5 v
+蔑视 212 v
+蔓 212 v
+蔓伸 3 v
+蔓儿 3 n
+蔓延 576 v
+蔓延下来 3 l
+蔓延到 3 l
+蔓延性 3 n
+蔓廷 3 n
+蔓引株求 3 vn
+蔓珠莎华 3 z
+蔓生 3 v
+蔓生植物 3 l
+蔓荆子 2 n
+蔓草 8 v
+蔓草难除 3 n
+蔓菁 12 n
+蔓蔓日茂 3 n
+蔓藤 5 n
+蔓衍 3 v
+蔓陀罗 3 n
+蔔 262 zg
+蔕 11 zg
+蔗 91 n
+蔗作 3 n
+蔗农 3 n
+蔗园 3 n
+蔗板 3 n
+蔗浆 3 n
+蔗渣 6 n
+蔗田 3 n
+蔗糖 334 n
+蔗醣 3 ns
+蔗香 4 n
+蔚 163 nr
+蔚丹 3 ns
+蔚为 3 nr
+蔚为壮观 46 l
+蔚为大观 9 l
+蔚为奇观 3 l
+蔚县 39 ns
+蔚山 33 ns
+蔚州 11 ns
+蔚成 3 nr
+蔚成丰富 3 l
+蔚成大观 3 l
+蔚成新风 3 l
+蔚成风气 3 l
+蔚海岸 3 nr
+蔚然 3 nr
+蔚然成风 43 l
+蔚竹庵 2 nr
+蔚色 3 n
+蔚蓝 58 nr
+蔚蓝海岸 3 nr
+蔚蓝网 3 nr
+蔚蓝色 36 nr
+蔚起 3 ns
+蔛 39 zg
+蔟 10 zg
+蔡 1251 nr
+蔡三州 3 nr
+蔡中郎 10 nr
+蔡丽华 3 nr
+蔡二相 2 nr
+蔡京乃 2 nr
+蔡京任 2 nr
+蔡京依 2 nr
+蔡京命 2 nr
+蔡京奏 2 nr
+蔡京那 2 nr
+蔡仁华 6 nr
+蔡任护 2 nr
+蔡伦 25 nr
+蔡伯喈 5 nr
+蔡佳宏 3 nr
+蔡依林 5 nr
+蔡依琳 3 nr
+蔡健雅 3 nr
+蔡元元 3 nr
+蔡元培 317 nr
+蔡元禧 8 nr
+蔡先生 4 nr
+蔡克廉 2 nr
+蔡入淮 2 nr
+蔡公堂乡 3 nr
+蔡公时 2 nr
+蔡卓妍 3 nr
+蔡叔度 4 nr
+蔡叔监 2 nr
+蔡口镇 2 nr
+蔡启方 10 nr
+蔡和森 138 nr
+蔡善仪 3 nr
+蔡国兆 3 nr
+蔡国公 2 nr
+蔡国庆 5 nr
+蔡国权 3 nr
+蔡国用 2 nr
+蔡培荣 3 nr
+蔡大姐 6 nr
+蔡大爷 11 nr
+蔡太师 2 nr
+蔡夫人 16 nr
+蔡婆婆 2 nr
+蔡子健 3 nr
+蔡子君 2 nr
+蔡子峰 5 nr
+蔡子民 4 nr
+蔡宏柱 256 nr
+蔡宝健 3 nr
+蔡宝林 3 nr
+蔡家坡 2 nr
+蔡家崖 2 nr
+蔡家潭 256 nr
+蔡家艺 2 nr
+蔡寅亦 3 nr
+蔡将军 10 nr
+蔡小艺 3 nr
+蔡小虎 3 nr
+蔡少芬 3 nr
+蔡尔德 3 nr
+蔡州城 4 nr
+蔡州秦 2 nr
+蔡师伯 7 nr
+蔡幸娟 3 nr
+蔡广银 2 nr
+蔡庆图 6 nr
+蔡康永 2 nr
+蔡廷锴 18 nr
+蔡德忠 20 nr
+蔡德金 2 nr
+蔡志忠 3 nr
+蔡惟弹 2 nr
+蔡慧珏 2 nr
+蔡戈尼 4 nr
+蔡成勋 3 nr
+蔡振华 3 nr
+蔡振峰 32 nr
+蔡文姬 22 nr
+蔡文琴 3 nr
+蔡文静 256 nr
+蔡方柏 4 nr
+蔡方荫 4 nr
+蔡时罗 3 nr
+蔡春猪 2 nr
+蔡显枫 2 nr
+蔡晓仪 3 nr
+蔡智恒 3 nr
+蔡松坡 2 nr
+蔡松龄 3 nr
+蔡枫华 3 nr
+蔡桓公 2 nr
+蔡楚川 6 nr
+蔡楚生 17 nr
+蔡正仁 2 nr
+蔡殿齐 2 nr
+蔡永兴 47 nr
+蔡汉跃 28 nr
+蔡河中 2 nr
+蔡河诸 2 nr
+蔡淑敏 10 nrfg
+蔡淑臻 3 nrfg
+蔡渊松 2 nr
+蔡温球 3 nr
+蔡特金 6 nr
+蔡玉兰 2 nr
+蔡玉燕 9 nr
+蔡琼辉 3 nr
+蔡甸区 256 ns
+蔡益所 2 nr
+蔡礼大 2 nr
+蔡祖泉 3 nr
+蔡福便 2 nr
+蔡秉德 4 nr
+蔡继琨 2 nr
+蔡美彪 9 nr
+蔡老者 3 nr
+蔡自兴 2 nr
+蔡臻欣 4 nr
+蔡艾明 2 nr
+蔡节级 2 nr
+蔡若虹 2 nr
+蔡茂德 24 nr
+蔡裕华 3 nr
+蔡襄 10 nr
+蔡诗芸 3 nr
+蔡豪文 2 nr
+蔡达峰 2 nr
+蔡连齐 2 nr
+蔡述明 2 nr
+蔡郑伟 2 nr
+蔡金川 3 nr
+蔡金涛 2 nr
+蔡金芳 4 nr
+蔡金龙 2 nr
+蔡钊珍 12 nr
+蔡锦隆 2 nr
+蔡锷 49 nr
+蔡锷奉 2 nr
+蔡香主 4 nr
+蔡鹤卿 2 nr
+蔣 2 zg
+蔨 2 zg
+蔪 105 zg
+蔪露 3 vn
+蔫 97 v
+蔫不出溜 3 l
+蔫不唧 3 z
+蔫不溜 3 z
+蔫儿坏 3 l
+蔫呼呼 3 z
+蔫头耷脑 11 l
+蔫巴 3 z
+蔫巴巴 2 z
+蔫搭搭 3 z
+蔫耷耷 3 z
+蔫蔫 17 z
+蔫蔫乎乎 3 z
+蔫蔫唧唧 3 z
+蔬 89 n
+蔬果 37 n
+蔬菜 2085 n
+蔬菜业 2 n
+蔬菜制品 3 n
+蔬菜园 4 n
+蔬菜园艺 3 n
+蔬菜基地 3 n
+蔬菜栽培 3 vn
+蔬菜水果 3 n
+蔬菜汁 13 n
+蔬菜汤 3 n
+蔬菜种子 3 n
+蔬菜类 3 n
+蔬食 3 n
+蔭 9 zg
+蔵 8 zg
+蔷 193 n
+蔷薇 191 n
+蔷薇科 3 n
+蔷薇花 4 n
+蔷薇骑士 3 n
+蔸 12 q
+蔹 4 x
+蔺 20 nr
+蔺夫人 3 nr
+蔺家坝 3 nr
+蔺泽溪 3 nr
+蔺益群 11 nr
+蔺相如 23 nr
+蔺草 6 n
+蔻 10 x
+蔻丹 3 nr
+蔼 120 g
+蔼然 3 nr
+蔼然仁者 3 nr
+蔼然可亲 3 nr
+蔼然可观 3 nr
+蔼蔼 3 nr
+蔽 220 v
+蔽体 5 v
+蔽光 3 v
+蔽匿 3 v
+蔽塞 3 v
+蔽天 3 v
+蔽挡 3 v
+蔽日 41 v
+蔽日干云 3 z
+蔽日遮天 3 v
+蔽明塞聪 3 v
+蔽空 3 v
+蔽聪塞明 3 v
+蔽身 3 v
+蔽野 3 v
+蔽阴 3 v
+蔽障 3 v
+蕁麻 3 z
+蕁麻疹 3 n
+蕃 613 n
+蕃人 3 n
+蕃兵 3 n
+蕃客 3 n
+蕃庶 3 n
+蕃息 3 n
+蕃殖 3 v
+蕃茂 3 v
+蕃茄 17 n
+蕃茄汁 3 n
+蕃茄沙司 3 n
+蕃茄片 3 n
+蕃茄酱 3 n
+蕃薯 3 n
+蕃薯粉 3 n
+蕃薯藤 3 n
+蕃衍 6 v
+蕈 33 g
+蕉 243 zg
+蕉农 3 nrt
+蕉叶 7 nrt
+蕉园 3 n
+蕉城区 3 n
+蕉岭 8 nrt
+蕉岭县 3 n
+蕉布 3 nrt
+蕉扇 3 n
+蕉麻 17 n
+蕊 170 ng
+蕍 16 zg
+蕓 58 zg
+蕖 44 x
+蕙 72 ng
+蕙兰 3 nz
+蕙心 3 n
+蕙心兰质 3 nz
+蕙心纨质 3 vn
+蕙质兰心 3 n
+蕞 25 x
+蕞尔小国 3 v
+蕤 11 x
+蕤仁 3 n
+蕤宾 8 n
+蕤宾铁响 3 n
+蕨 200 l
+蕨类 56 n
+蕨类植物 55 l
+蕨菜 40 n
+蕬 18 zg
+蕲 1352 ns
+蕲春 286 ns
+蕲春县 262 ns
+蕲蛇 7 n
+蕴 174 v
+蕴含 223 v
+蕴含着 3 n
+蕴和 3 v
+蕴奇待价 3 n
+蕴念 3 n
+蕴意 2 v
+蕴涵 88 n
+蕴涵着 3 n
+蕴积 5 n
+蕴结 6 v
+蕴育 3 v
+蕴蓄 25 n
+蕴藉 35 v
+蕴藏 834 v
+蕴藏量 525 n
+蕴藻浜 2 n
+蕴酿 3 v
+蕴魔 3 n
+蕹 19 n
+蕹菜 5 n
+蕺 19 x
+蕺菜 2 n
+蕾 145 nr
+蕾丝 3 n
+蕾期 3 n
+蕾期授粉 3 n
+蕾状期 3 n
+蕾状牙 3 n
+蕾铃 3 n
+薄 2710 a
+薄一波 58 nr
+薄业 9 n
+薄为雷 4 nr
+薄义 2 n
+薄云 6 nr
+薄云天 4 nr
+薄互层 3 l
+薄产 3 n
+薄亲 3 n
+薄伽丘 4 nz
+薄伽梵 3 n
+薄具 3 n
+薄冰 32 nr
+薄刃 4 n
+薄刃厚 2 nr
+薄刃斧 2 nr
+薄利 7 a
+薄利多销 10 l
+薄厚 9 a
+薄周孔 7 n
+薄命 32 nz
+薄命佳人 3 nr
+薄唇 12 n
+薄唇轻言 3 n
+薄地 13 n
+薄型 15 n
+薄壁 105 n
+薄壁堰 4 nr
+薄壁机 2 n
+薄壁组织 3 n
+薄壁菌 3 nr
+薄壳 4 n
+薄壳核桃 2 n
+薄太后 11 nr
+薄始祯 3 nr
+薄姑 5 n
+薄嫩 2 a
+薄子 3 n
+薄寒中人 3 nr
+薄层 70 n
+薄层调谐 3 nr
+薄布 3 nr
+薄幕呈 2 nr
+薄幸 55 a
+薄幸之 8 nr
+薄幸郎 2 nr
+薄弱 845 a
+薄弱校 6 l
+薄弱点 6 n
+薄弱环节 3 l
+薄往细故 3 l
+薄待 3 n
+薄情 30 n
+薄情无义 3 l
+薄情郎 4 nr
+薄惩 3 n
+薄技 21 n
+薄技在身 3 n
+薄施 4 n
+薄施粉 2 nr
+薄明 3 nr
+薄晓 3 nr
+薄暮 31 nr
+薄暮冥冥 3 nr
+薄暮蒙蒙 3 nr
+薄曲 2 n
+薄有微 4 nr
+薄松松 3 nr
+薄板 33 n
+薄树人 2 nr
+薄此厚彼 3 nr
+薄氏太 2 nr
+薄海同 3 nr
+薄海腾欢 3 nr
+薄煎饼 3 n
+薄熙来 13 nrfg
+薄父母 3 nr
+薄片 104 n
+薄片形 3 n
+薄物细故 3 n
+薄王太后 3 nr
+薄瑞光 16 nr
+薄田 3 nr
+薄甲藻 5 nr
+薄电 3 n
+薄白 3 z
+薄皇后 5 nr
+薄砂地 3 n
+薄礼 45 nr
+薄纱 21 n
+薄纱罗 2 nr
+薄纱裙 3 nr
+薄纸 24 n
+薄缘夷 3 nr
+薄老 2 a
+薄胎 5 n
+薄脆 17 a
+薄脉弦 3 nr
+薄膜 343 n
+薄膜光学 3 n
+薄膜开关 3 n
+薄膜淀积 3 n
+薄膜状 3 n
+薄膜电泳 3 n
+薄膜袋 3 n
+薄艺 3 n
+薄荷 88 n
+薄荷叶 3 nr
+薄荷油 10 nz
+薄荷精 3 nr
+薄荷糖 21 nr
+薄荷脑 12 nz
+薄荷醇 15 nr
+薄荷香 3 nr
+薄葬 3 n
+薄薄 3 a
+薄薄儿 2 z
+薄薄地 10 z
+薄薄的 198 z
+薄薄红 2 z
+薄行 3 n
+薄衣 3 n
+薄被 31 n
+薄言 2 n
+薄记 3 n
+薄质涂料 3 n
+薄酒 15 n
+薄酬 3 n
+薄钢 2 n
+薄钢板 3 nz
+薄铁叶 7 nr
+薄铝窗 5 nz
+薄隔板 3 n
+薄雾 104 n
+薄青色 3 nr
+薄面 3 n
+薄革质 3 nz
+薄音湖 2 nr
+薄饼 27 n
+薄骨律 3 n
+薅 38 v
+薇 894 g
+薇薇安 3 nr
+薇诺娜 3 nr
+薈 3 zg
+薏 20 n
+薏仁 3 n
+薏仁米 2 n
+薏仁粉 3 nz
+薏米 6 n
+薏苡 21 n
+薏苡之谤 3 v
+薏苡仁 3 v
+薏苡明珠 3 nz
+薏苡蒙谤 3 v
+薑 5 zg
+薔 31 zg
+薗 5 zg
+薙 23 zg
+薙刀 3 v
+薙去 3 z
+薙发 3 vn
+薛 678 nr
+薛万备 2 nr
+薛三姊 3 nr
+薛世雄 2 nr
+薛云飞 3 nr
+薛五哥 2 nr
+薛亚芳 2 nr
+薛仁杲 2 nr
+薛仁贵 19 nr
+薛传薪 243 nr
+薛佳凝 3 nr
+薛修义 2 nr
+薛元辉 3 nr
+薛先生 5 nr
+薛克构 2 nr
+薛公子 5 nr
+薛公远 41 nr
+薛兰守 2 nr
+薛兼崇 2 nr
+薛冬梅 4 nr
+薛凤祚 3 nr
+薛史之 3 nr
+薛呆子 2 nr
+薛国观 95 nr
+薛城 20 nr
+薛城区 3 nr
+薛埠镇 2 nr
+薛士圻 4 nr
+薛大叔 2 nr
+薛大哥 9 nr
+薛大妹妹 2 nr
+薛大爷 8 nr
+薛天培 2 nr
+薛妹妹 4 nr
+薛姨妈 427 nr
+薛姨娘 2 nr
+薛婆阿 4 nr
+薛子斌 2 nr
+薛守琴 4 nr
+薛安郡 4 nr
+薛宗正 2 nr
+薛定谔 55 nr
+薛宝琴 3 nr
+薛宝钗 54 nr
+薛家岗 9 nr
+薛家湾 3 nr
+薛小妹 2 nr
+薛尚书 8 nr
+薛尚功 2 nr
+薛居正 13 nr
+薛广德 2 nr
+薛庄村 3 nr
+薛志鹏 4 nr
+薛慕华 91 nr
+薛所创 2 nr
+薛文献 2 nr
+薛文起 2 nr
+薛文龙 2 nr
+薛斗南 3 nr
+薛景求 3 nr
+薛暮桥 3 nr
+薛月儿 117 nr
+薛永兴 2 nr
+薛永宗 2 nr
+薛泰安 2 nr
+薛淑媛 2 nrt
+薛淑杰 3 nz
+薛瑞福 2 nr
+薛瞎子 4 nr
+薛石民 13 nr
+薛禅皇帝 2 nr
+薛福成 7 nr
+薛稷 5 nr
+薛精通 3 nr
+薛绍彭 2 nr
+薛经理 4 nr
+薛继承 2 nr
+薛老五 2 nr
+薛老爷子 3 nr
+薛肇明 3 nr
+薛蟠实 2 nr
+薛蟠忙 5 nr
+薛蟠笑 8 nr
+薛蟠素 2 nr
+薛蟠自 2 nr
+薛蟠见 5 nr
+薛蟠酒 2 nr
+薛西斯 12 nr
+薛进德 3 nr
+薛道衡 2 nr
+薛里吉 2 nr
+薜 55 nr
+薜凯琪 3 n
+薜荔 10 n
+薜萝 3 n
+薟 41 zg
+薡 44 zg
+薢 3 zg
+薤 11 g
+薤白 7 n
+薥 2 zg
+薨 42 g
+薪 723 n
+薪优 3 n
+薪传 3 n
+薪俸 52 n
+薪尽火传 3 v
+薪尽火佳 3 z
+薪柴 5 n
+薪水 738 n
+薪水阶层 3 n
+薪水阶级 3 n
+薪津 3 n
+薪火 14 n
+薪火相传 3 n
+薪炭 5 n
+薪炭材 9 n
+薪炭林 25 n
+薪给 27 n
+薪资 272 n
+薪资表 3 n
+薪酬 612 n
+薪金 205 n
+薪金制 3 n
+薪饷 9 n
+薫 2 zg
+薮 74 g
+薮中荆曲 3 ns
+薯 105 zg
+薯仔 3 n
+薯干 5 n
+薯条 23 n
+薯片 16 n
+薯童谣 3 n
+薯类 144 n
+薯莨 2 n
+薯莨绸 3 n
+薯蓣 26 nz
+薯藤 3 nz
+薰 193 v
+薰习 3 v
+薰天 3 v
+薰天赫地 3 z
+薰心 3 v
+薰染 3 v
+薰染法 3 vn
+薰沐 4 v
+薰炉 3 v
+薰莸同器 3 v
+薰莸异器 3 v
+薰衣草 3 vn
+薰陶 3 v
+薰风 3 v
+薰香 3 v
+薳 9 zg
+薷 25 x
+薸 2 zg
+薹 66 n
+薽 9 zg
+薾 5 zg
+藁 32 ns
+藁城 10 ns
+藁城县 3 ns
+藁城市 3 ns
+藁本 3 ns
+藂 26 zg
+藉 789 zg
+藉以 3 nr
+藉以窥知 3 vn
+藉口 3 nr
+藉故推辞 3 vn
+藉此 2 nr
+藉此机会 3 nr
+藉由 3 nr
+藉端生事 3 nr
+藉藉无名 5 nr
+藉酒浇愁 3 v
+藋 33 zg
+藌 76 zg
+藏 8819 j
+藏不住 3 v
+藏之名山 4 i
+藏书 289 nz
+藏书室 3 nz
+藏书家 15 n
+藏书库 3 nz
+藏书架 3 nz
+藏书标记 3 n
+藏书楼 45 nr
+藏书票 3 n
+藏书量 2 n
+藏书阁 3 nr
+藏亚菊 2 nr
+藏传 128 nz
+藏传佛教 3 nz
+藏伯希 3 nr
+藏僧 20 nz
+藏僧灵 2 nr
+藏入 3 v
+藏兵峡 2 nr
+藏刀 26 n
+藏剧团 2 n
+藏北 85 s
+藏北高原 3 ns
+藏区 39 n
+藏医 79 n
+藏医学 24 nz
+藏医院 4 nz
+藏匿 106 v
+藏匿于 3 n
+藏匿在 3 i
+藏匿处 3 i
+藏南纵谷 3 nz
+藏印 35 nz
+藏卵器 3 n
+藏历 46 nz
+藏品 137 n
+藏品展 2 nz
+藏器 3 nz
+藏器待时 3 n
+藏在岩 2 nr
+藏址信息 3 nr
+藏垢纳污 3 i
+藏头 25 n
+藏头亢脑 3 i
+藏头诗 3 nr
+藏头露尾 17 i
+藏奸 5 n
+藏奸耍滑 3 l
+藏娇 2 nr
+藏学 52 n
+藏学家 5 n
+藏宝 19 nz
+藏宝之 4 nr
+藏宝图 5 nr
+藏宝库 3 nr
+藏宝洞 26 nr
+藏宝阁 3 nr
+藏家 59 n
+藏密瑜 7 nr
+藏富 3 nz
+藏巧于拙 3 i
+藏布 3 v
+藏式 16 nz
+藏弓烹狗 3 i
+藏形匿影 3 i
+藏徐镇 4 nr
+藏怒宿怨 3 i
+藏戏 14 n
+藏拙 11 nr
+藏掖 5 ns
+藏文 129 nz
+藏族 1887 nz
+藏族人 14 nz
+藏族同胞 3 n
+藏春集 2 nr
+藏有 249 b
+藏服 3 nz
+藏武学 3 n
+藏毯 4 nz
+藏民 50 n
+藏永亮 3 nr
+藏汇 2 nz
+藏汉 5 nz
+藏污 3 v
+藏污纳垢 17 i
+藏洋 3 nz
+藏海利 4 nz
+藏漫阁 3 nr
+藏猫儿 3 nr
+藏獒 3 nr
+藏王 30 nz
+藏珍堂 3 nr
+藏琼玛 3 nz
+藏画 137 n
+藏私 3 b
+藏精器 2 nz
+藏红花 7 nz
+藏纳 14 nz
+藏经 54 nz
+藏经楼 3 n
+藏经殿 5 nz
+藏经洞 24 nr
+藏经阁 77 nr
+藏羚 17 n
+藏羚羊 10 n
+藏而不露 3 i
+藏胞 10 n
+藏药 58 nz
+藏蓝 3 nz
+藏蓝色 4 n
+藏藏 3 n
+藏藏掖掖 3 ns
+藏藏躲躲 3 i
+藏袍 9 n
+藏装 4 nz
+藏语 191 nz
+藏语文 5 nz
+藏语系 3 n
+藏诸名山 3 nr
+藏象 3 n
+藏踪 3 v
+藏踪蹑迹 3 v
+藏身 251 n
+藏身之处 3 i
+藏身处 12 i
+藏躲 3 nr
+藏边三丑 3 nr
+藏边二丑 3 nr
+藏边五丑 3 i
+藏边四丑 3 nr
+藏边大丑 3 nr
+藏进去 3 nr
+藏进来 3 nr
+藏量 29 n
+藏量丰富 3 nz
+藏锋敛锐 3 nr
+藏锋敛锷 3 nr
+藏锋敛颖 3 nr
+藏青 20 nr
+藏青色 19 nr
+藏音吧 3 n
+藏风 3 nz
+藏风纳 9 nr
+藏风聚 7 nz
+藏首露尾 3 i
+藏香 13 nr
+藏马 20 nz
+藏骨楼 3 nr
+藏骨沟 5 nr
+藏龙卧虎 18 i
+藐 25 zg
+藐小 2 v
+藐视 211 v
+藐视一切 3 v
+藓 166 n
+藓类 3 n
+藓类沼泽 3 v
+藓苔 4 n
+藓苔植物 3 n
+藕 4215 n
+藕丝 4 n
+藕叶 3 n
+藕合 3 n
+藕断 3 n
+藕断丝连 21 i
+藕灰 3 n
+藕片 2 n
+藕粉 19 n
+藕色 10 n
+藕节 5 n
+藕花 3 n
+藕荷 3 n
+藕荷色 7 n
+藛 9 zg
+藜 96 g
+藜芦 3 nr
+藜芦碱 3 n
+藠头 3 n
+藤 592 nr
+藤之木 2 nr
+藤井健雄 2 nr
+藤井有 2 nr
+藤井树 5 nr
+藤制 3 n
+藤制品 2 n
+藤原 13 n
+藤原京 3 ns
+藤原基经 3 n
+藤原宣孝 2 nr
+藤原纪香 3 nr
+藤原良房 2 nr
+藤县 16 ns
+藤吉郎 3 nr
+藤围椅 2 n
+藤堂香澄 3 nr
+藤堂高 13 nr
+藤堂龙白 3 nr
+藤壶 34 n
+藤子 5 n
+藤家具 3 l
+藤本 63 n
+藤本植物 37 l
+藤条 57 n
+藤架 3 n
+藤森 8 nr
+藤椅 105 n
+藤榻 7 n
+藤泽 2 nr
+藤泽秀行 3 nr
+藤牌 64 n
+藤球 28 n
+藤甲 3 b
+藤甲兵 10 nr
+藤甲军 6 nr
+藤皮 3 n
+藤真希 3 nr
+藤筐 3 n
+藤箱 3 n
+藤篮 4 n
+藤纪夫 4 nr
+藤编 12 n
+藤缠树 2 nr
+藤罩 3 n
+藤花厅 4 n
+藤茎 3 n
+藤萝 80 n
+藤蔓 55 n
+藤野玄洋 2 nr
+藤鞭 3 nr
+藤顺崖 2 nr
+藤黄 15 nr
+藥 2 zg
+藦 8 zg
+藨 9 zg
+藩 704 ns
+藩国 23 ns
+藩屏 6 n
+藩属 50 n
+藩属国 3 ns
+藩王 127 n
+藩篱 33 ns
+藩镇 191 ns
+藩镇割据 3 n
+藻 794 ng
+藻丽 3 n
+藻井 543 n
+藻思 3 n
+藻类 271 n
+藻类体 3 n
+藻类学 3 l
+藻类植物 32 l
+藻绘 3 n
+藻菌 3 n
+藻饰 11 n
+藿 28 n
+藿香 23 n
+蘅 55 x
+蘅塘退士 3 nr
+蘆 2 zg
+蘋 21 zg
+蘍 2 zg
+蘏 29 zg
+蘑 38 n
+蘑菇 620 n
+蘑菇云 33 nz
+蘑菇状 7 nz
+蘑菇石 3 n
+蘖 26 zg
+蘘 10 n
+蘘荷 2 n
+蘙 24 zg
+蘝 3 zg
+蘠 3 zg
+蘧 9 x
+蘨 2 zg
+蘩 28 g
+蘭 6 zg
+蘸 371 v
+蘸上 3 nr
+蘸水笔 3 nr
+蘸湿 3 nr
+蘸火 3 nr
+蘸笔 3 nr
+蘼 39 x
+蘼芜 9 n
+虀 2 zg
+虁 69 zg
+虎 4845 n
+虎不食儿 3 l
+虎丘 95 ns
+虎丘区 3 ns
+虎亭区 3 ns
+虎仔 13 n
+虎伏 3 t
+虎体熊腰 3 n
+虎克 9 ns
+虎兕出柙 3 nr
+虎党狐侪 3 n
+虎入羊群 8 i
+虎列拉 3 ns
+虎刺 3 n
+虎劲 3 n
+虎势 4 n
+虎势势 3 i
+虎卧龙跳 3 i
+虎卫 3 n
+虎变龙蒸 3 nz
+虎口 216 ns
+虎口余生 3 i
+虎口拔牙 7 i
+虎口脱险 2 i
+虎口逃生 3 i
+虎咽狼吞 3 n
+虎啸 47 n
+虎啸声 3 nr
+虎啸狮吼 3 nr
+虎啸狼啼 3 nr
+虎啸风生 3 nr
+虎嘴 3 ns
+虎坊桥 3 ns
+虎大伤人 3 nz
+虎头 125 n
+虎头山 3 ns
+虎头崖 19 ns
+虎头虎脑 8 i
+虎头蛇尾 23 i
+虎头蜂 3 n
+虎头鞋 2 i
+虎妞 2 n
+虎姑婆 3 n
+虎威 26 ns
+虎娃 2 n
+虎子 58 n
+虎字头 3 n
+虎将 88 n
+虎尾 18 ns
+虎尾兰 3 ns
+虎尾春冰 3 i
+虎尾草 3 n
+虎山 290 ns
+虎山行 3 ns
+虎崽 2 n
+虎帐 3 n
+虎年 124 t
+虎式机 3 n
+虎彪彪 3 nr
+虎据龙蟠 3 ns
+虎掌 2 n
+虎掌草 3 n
+虎掷龙拿 3 i
+虎斗龙争 3 nz
+虎杖 3 n
+虎林 14 ns
+虎林县 5 ns
+虎林园 6 ns
+虎林市 3 ns
+虎槛 3 n
+虎步 3 n
+虎步龙行 3 i
+虎毒不食 3 i
+虎毒不食子 4 l
+虎气 7 n
+虎爪 3 n
+虎父无犬 3 i
+虎父犬子 3 n
+虎牙 13 ns
+虎牢关 3 ns
+虎狮兽 3 i
+虎狼 96 ns
+虎狼之势 3 i
+虎狼之国 3 i
+虎狼之威 3 i
+虎猫 3 n
+虎王 19 nrt
+虎珀拾芥 3 nr
+虎生三子 3 nz
+虎生生 2 n
+虎略龙韬 3 i
+虎疫 3 n
+虎皮 106 n
+虎眼石 3 n
+虎穴 30 n
+虎穴狼巢 3 i
+虎穴龙潭 3 ns
+虎窟龙潭 3 n
+虎符 40 n
+虎纹 3 n
+虎纹蛙 7 n
+虎耳 3 n
+虎耳草 8 nz
+虎胆 3 n
+虎胆妙算 3 i
+虎胆龙威 3 i
+虎背 10 n
+虎背熊腰 12 i
+虎荡羊群 3 i
+虎落平川 3 ns
+虎落平阳 3 ns
+虎虎 3 nz
+虎虎有生气 13 i
+虎虎生威 5 i
+虎虎生气 4 i
+虎虎生风 16 i
+虎蛇毒素 3 i
+虎视 35 n
+虎视眈眈 110 i
+虎视耽耽 3 nr
+虎豹 90 nz
+虎贲 31 n
+虎超龙骧 3 nr
+虎跃龙腾 3 i
+虎跑 46 ns
+虎跑泉 3 nz
+虎跳峡 25 ns
+虎踞 63 v
+虎踞鲸吞 3 i
+虎踞龙盘 5 i
+虎踞龙蟠 2 i
+虎里虎势 3 i
+虎钳 15 n
+虎门 354 ns
+虎门港 2 ns
+虎门销烟 7 n
+虎门镇 3 ns
+虎鞭 3 n
+虎须 3 n
+虎骨 17 n
+虎骨酒 4 n
+虎魄 4 n
+虎鲨 3 nz
+虎鲸 3 n
+虎鸣 7 nrt
+虏 1001 ng
+虏掠 3 v
+虏获 8 v
+虐 152 ag
+虐刑 3 v
+虐待 222 v
+虐待狂 6 nz
+虐待老人 3 n
+虐恋 3 v
+虐政 38 v
+虐暑 3 v
+虐杀 29 v
+虐爱 3 v
+虐疾 3 n
+虐老兽心 3 n
+虑 655 vg
+虑周藻密 3 ns
+虑无不周 3 nr
+虓 8 zg
+虔 155 a
+虔信 3 a
+虔婆 27 n
+虔心 3 a
+虔敬 65 a
+虔文 3 n
+虔诚 419 a
+虔诚地 3 n
+虘 812 zg
+虚 4112 d
+虚与委蛇 19 n
+虚云 3 n
+虚云大师 3 i
+虚付 3 v
+虚价 3 n
+虚伪 266 a
+虚伪性 6 n
+虚位 3 n
+虚位以待 4 i
+虚位移 3 i
+虚假 850 a
+虚假性 2 n
+虚像 18 n
+虚减 3 v
+虚列 3 b
+虚则实之 3 i
+虚力 3 n
+虚功 4 a
+虚功原理 3 n
+虚劳 25 a
+虚化 5 v
+虚华 4 a
+虚发 30 v
+虚名 205 a
+虚嘴掠舌 3 i
+虚堂悬镜 3 i
+虚增 3 v
+虚声 3 n
+虚声恫喝 3 vn
+虚声源 3 n
+虚夜月 3 i
+虚夸 16 v
+虚套 7 a
+虚套子 3 n
+虚妄 61 a
+虚字 18 n
+虚实 371 a
+虚实并举 3 i
+虚室生白 3 i
+虚寒 60 a
+虚岁 27 n
+虚左以待 3 i
+虚己以听 3 i
+虚己受人 3 i
+虚席以待 6 i
+虚幻 153 n
+虚幻不实 3 i
+虚幻境界 3 i
+虚幻性 3 n
+虚应 6 v
+虚应故事 2 i
+虚废词说 3 i
+虚度 42 n
+虚度一生 3 i
+虚度光阴 3 n
+虚度岁月 3 i
+虚度年华 3 nz
+虚度青春 3 n
+虚座以待 3 l
+虚开 19 v
+虚张 3 a
+虚张声势 116 i
+虚弱 459 a
+虚弱不堪 3 i
+虚弱者 11 n
+虚往实归 3 i
+虚心 162 n
+虚心听取 3 i
+虚心学习 3 n
+虚心接受 3 i
+虚怀 14 v
+虚怀若谷 28 i
+虚恋 3 v
+虚情 3 n
+虚情假意 26 i
+虚惊 46 a
+虚惊一场 3 i
+虚报 82 n
+虚报冒领 3 i
+虚报年龄 3 n
+虚报成绩 3 n
+虚拟 455 v
+虚拟世界 26 nz
+虚拟主机 3 n
+虚拟人 3 b
+虚拟仪器 3 n
+虚拟企业 3 n
+虚拟光驱 3 n
+虚拟内存 2 n
+虚拟化 13 n
+虚拟国度 3 n
+虚拟地址 3 n
+虚拟存储 5 nz
+虚拟存储器 14 n
+虚拟实境 2 n
+虚拟幻觉 3 n
+虚拟式 3 b
+虚拟性 10 b
+虚拟拨号 3 n
+虚拟故事 3 b
+虚拟机 8 b
+虚拟环境 3 n
+虚拟现实 4 n
+虚拟盘 3 n
+虚拟目录 3 n
+虚拟社区 3 n
+虚拟空间 3 n
+虚拟词 3 n
+虚拟语气 3 n
+虚拟软盘 3 n
+虚损 3 v
+虚掩 88 v
+虚掷 3 v
+虚掷光阴 3 i
+虚掷时光 3 i
+虚提 3 n
+虚收 3 v
+虚数 72 n
+虚文 12 n
+虚文浮礼 3 nz
+虚无 129 v
+虚无主义 35 n
+虚无假设 3 i
+虚无性 3 i
+虚无缥渺 3 i
+虚无缥缈 43 i
+虚无飘渺 12 i
+虚晃 3 v
+虚晃一下 3 i
+虚晃一招 3 i
+虚晃一枪 10 i
+虚有其表 7 i
+虚构 230 n
+虚构性 2 n
+虚构情节 3 n
+虚根 3 nz
+虚步 2 n
+虚汗 51 n
+虚浮 39 v
+虚渺 3 a
+虚火 79 n
+虚灵 3 n
+虚点 3 n
+虚热 31 a
+虚物 3 n
+虚玄 4 n
+虚症 9 n
+虚盈 3 a
+虚盈实亏 3 l
+虚礼 15 n
+虚空 121 n
+虚竹 3 n
+虚线 21 n
+虚耗 15 n
+虚职 3 v
+虚肿 3 n
+虚胖 7 a
+虚脱 57 v
+虚舟飘瓦 3 i
+虚荣 131 a
+虚荣心 105 i
+虚虚 3 a
+虚虚实实 49 i
+虚表 2 n
+虚言 3 n
+虚誉 3 n
+虚论高议 3 i
+虚设 52 vn
+虚设单元 3 n
+虚证 107 v
+虚诈 3 a
+虚词 66 n
+虚词诡说 3 i
+虚话 3 n
+虚诞 3 a
+虚谈高论 3 i
+虚象 3 n
+虚跨步 3 vn
+虚转 3 v
+虚轴 3 n
+虚辞 3 v
+虚辞滥调 3 i
+虚通路 3 n
+虚造 3 v
+虚靡 3 a
+虚页 3 n
+虚领 3 n
+虚飘飘 17 z
+虚饰 6 n
+虚骄 3 n
+虚骄恃气 3 i
+虛 5 zg
+虞 582 nr
+虞世南 21 nr
+虞之誉 2 nr
+虞于唐 2 nr
+虞以伐 3 nr
+虞以泽 2 nr
+虞仲文 6 nr
+虞伟亮 35 nr
+虞侯 8 nr
+虞候作 2 nr
+虞候和 4 nr
+虞允文 32 nr
+虞兮虞 3 nr
+虞国 2 ns
+虞城 8 nr
+虞城县 8 ns
+虞姬伴 2 nr
+虞山派 5 nr
+虞山镇 2 nr
+虞应龙 4 nr
+虞德海 3 nr
+虞氏义 2 nr
+虞洽卿 13 nr
+虞王司 2 nr
+虞离沪 3 nr
+虞美人 22 nr
+虞者胜 2 nr
+虞舜 18 nr
+虞芮之 2 nr
+虞集驰 3 nr
+虠 2 zg
+虢 113 nr
+虩 6 zg
+虫 3068 n
+虫体 3 n
+虫儿 41 n
+虫卵 89 n
+虫吃牙 3 n
+虫声 3 n
+虫媒 3 n
+虫媒传粉 3 n
+虫媒植物 3 n
+虫媒病毒 3 n
+虫媒花 3 n
+虫子 187 n
+虫害 62 n
+虫情 3 n
+虫情调查 3 n
+虫沙猿鹤 3 n
+虫灾 10 n
+虫牙 3 n
+虫瘿 30 n
+虫白蜡 4 n
+虫眼 3 n
+虫类 3 n
+虫胶 33 n
+虫胶板 3 n
+虫臂鼠肝 3 n
+虫草 76 n
+虫虫 3 n
+虫虫新 3 n
+虫蚀 3 n
+虫蛀 3 n
+虫蛭 3 n
+虫豸 18 n
+虫鱼之学 3 n
+虫鸣 3 n
+虬 73 n
+虬曲挺秀 3 z
+虬枝 9 n
+虬须 3 n
+虬髯 191 n
+虬龙 3 n
+虮 72 g
+虮虱相吊 3 n
+虱 158 n
+虱处裈中 3 n
+虱多不痒 3 n
+虱子 135 n
+虱目 9 n
+虱目鱼 3 n
+虱胫虮肝 3 v
+虹 911 ns
+虹化 2 ns
+虹口 31 ns
+虹口乡 3 ns
+虹口公园 2 ns
+虹口区 13 ns
+虹口足球场 10 n
+虹吸 16 b
+虹吸式 3 n
+虹吸现象 2 n
+虹吸管 23 n
+虹彩 12 n
+虹彩流辉 3 ns
+虹彩病毒 3 n
+虹影 7 n
+虹桥 89 ns
+虹桥店 3 ns
+虹桥机场 33 ns
+虹桥路 3 ns
+虹桥镇 10 ns
+虹梅路 3 ns
+虹膜 41 n
+虹膜仪 3 n
+虹膜炎 3 n
+虹霓 9 n
+虹鳟 13 n
+虹鳟鱼 9 n
+虺 38 x
+虻 228 g
+虼 172 x
+虼蚤 14 n
+虼螂 3 n
+虽 14338 zg
+虽不 3 c
+虽为 3 c
+虽休勿休 3 l
+虽则 94 c
+虽易学 3 l
+虽易输 3 i
+虽是 3 c
+虽有 3 c
+虽死之日 3 i
+虽死犹生 6 i
+虽死犹荣 3 i
+虽然 24267 c
+虽疾无声 3 i
+虽覆能复 3 i
+虽说 1072 c
+虽败犹荣 10 i
+虾 1389 n
+虾丸 2 n
+虾仁 31 n
+虾兵蟹将 15 i
+虾壳 3 n
+虾子 267 n
+虾子镇 3 n
+虾排 3 n
+虾池 3 n
+虾油 4 n
+虾片 2 n
+虾球 2 n
+虾皮 10 n
+虾笼 2 n
+虾米 18 n
+虾类 47 n
+虾群 3 n
+虾肉 3 n
+虾蛄 3 n
+虾蟆 20 n
+虾酱 7 n
+虾饺 3 n
+虾饼 3 n
+虿 44 g
+蚀 412 vg
+蚀刻 11 v
+蚀刻师 3 n
+蚀变岩石 3 n
+蚀成 3 v
+蚀损 3 v
+蚀本 25 n
+蚀魂销骨 3 n
+蚁 473 ng
+蚁丘 4 n
+蚁冢 3 n
+蚁力神 3 n
+蚁后 21 n
+蚁封穴雨 3 n
+蚁巢 26 n
+蚁拥蜂攒 3 nr
+蚁斗蜗争 3 vn
+蚁民 3 n
+蚁溃鼠骇 3 n
+蚁王 5 n
+蚁穴 15 n
+蚁穴坏堤 3 n
+蚁穴溃堤 3 n
+蚁穴自封 3 n
+蚁窝 3 n
+蚁聚蜂屯 3 n
+蚁萃螽集 3 vn
+蚁蚕 6 n
+蚁象 3 n
+蚁酸 4 n
+蚁附蜂屯 3 n
+蚁附蝇集 3 vn
+蚁鼻钱 11 n
+蚂 133 n
+蚂蚁 324 n
+蚂蚁啃骨头 3 i
+蚂蚁河 2 n
+蚂蚁洞 3 n
+蚂蚁窝 3 n
+蚂蚁缘槐 3 n
+蚂蚱 75 n
+蚂蜂 131 n
+蚂蝗 3 n
+蚂螂 3 n
+蚂蟥 56 n
+蚂蟥钉 3 nz
+蚃 12 zg
+蚇 17 zg
+蚊 295 n
+蚊力负山 3 n
+蚊叮虫咬 3 nr
+蚊子 293 n
+蚊帐 50 n
+蚊虫 96 n
+蚊蝇 26 n
+蚊蝇滋生 3 z
+蚊香 16 n
+蚊香盒 3 n
+蚋 65 g
+蚌 504 ns
+蚌埠 89 ns
+蚌埠市 96 ns
+蚌壳 86 n
+蚌珠 3 n
+蚌病成珠 3 n
+蚌病生珠 3 n
+蚌类 3 n
+蚌雕 3 n
+蚌鹬相持 3 nr
+蚍 60 i
+蚍蜉 2 n
+蚍蜉戴盆 3 l
+蚍蜉撼大树 2 i
+蚍蜉撼树 6 i
+蚐 51 zg
+蚑 52 zg
+蚓 72 x
+蚕 384 n
+蚕丛鸟道 3 n
+蚕丝 106 n
+蚕丝被 3 n
+蚕农 4 n
+蚕卵 9 n
+蚕头燕尾 3 i
+蚕子 3 n
+蚕宝宝 3 n
+蚕室 19 n
+蚕山 3 n
+蚕座 3 n
+蚕房 3 n
+蚕桑 95 n
+蚕桑业 13 n
+蚕沙 5 n
+蚕眠 3 v
+蚕种 14 n
+蚕箔 3 n
+蚕纸 3 n
+蚕绩蟹匡 3 nr
+蚕茧 125 n
+蚕蚁 3 n
+蚕蛹 11 n
+蚕蛹油 3 z
+蚕蛾 20 n
+蚕豆 397 n
+蚕豆病 3 n
+蚕豆象 3 n
+蚕豆酥 3 n
+蚕食 127 n
+蚕食鲸吞 4 i
+蚖 2 zg
+蚚蜴 3 n
+蚜 121 n
+蚜虫 80 n
+蚝 70 n
+蚝油 5 n
+蚠 31 zg
+蚡 76 zg
+蚢 2 zg
+蚣 34 x
+蚤 93 g
+蚤休 3 n
+蚥 12 zg
+蚦 112 zg
+蚧 170 x
+蚨 56 x
+蚩 77 j
+蚩尤 53 n
+蚩尤寨 8 n
+蚪 30 x
+蚫 9 zg
+蚬 73 nz
+蚬壳 4 nz
+蚯 39 n
+蚯蚓 407 n
+蚯蚓洞 3 z
+蚰 42 n
+蚰蜒 67 n
+蚰蜒草 3 vn
+蚱 41 n
+蚱蜢 13 n
+蚱蝉 3 n
+蚳 10 zg
+蚴 128 g
+蚵 18 zg
+蚶 76 n
+蚶子 4 n
+蚶田 3 n
+蚹 48 zg
+蚺 22 x
+蛀 134 v
+蛀坏 3 v
+蛀心虫 3 n
+蛀木水虱 3 n
+蛀洞 3 n
+蛀牙 21 n
+蛀虫 37 n
+蛀蚀 4 n
+蛀食 3 n
+蛀齿 3 n
+蛃 5 zg
+蛄 57 x
+蛆 156 n
+蛆卵 3 n
+蛆虫 51 n
+蛇 2430 n
+蛇丝瓜 3 n
+蛇化为龙 3 n
+蛇口 41 n
+蛇口工业区 4 n
+蛇口港 3 ns
+蛇口蜂针 3 n
+蛇名 3 n
+蛇吞象 3 n
+蛇咬伤 14 n
+蛇头 85 n
+蛇头鼠眼 3 n
+蛇宝石 3 n
+蛇尾 32 n
+蛇岛 98 ns
+蛇床子 15 n
+蛇座 3 n
+蛇形 46 n
+蛇影杯弓 3 n
+蛇心佛口 3 n
+蛇性 3 n
+蛇根草 3 n
+蛇欲吞虎 3 n
+蛇欲吞象 3 n
+蛇毒 59 n
+蛇王 3 n
+蛇皮 14 n
+蛇皮张 3 n
+蛇皮皮革 3 n
+蛇皮袋 3 n
+蛇目菊 3 n
+蛇眼 3 n
+蛇类 33 n
+蛇纹 3 n
+蛇纹岩 15 n
+蛇纹石 67 n
+蛇纹石板 3 n
+蛇绿岩 14 n
+蛇肉 3 n
+蛇胆 47 n
+蛇芯 3 n
+蛇药 20 n
+蛇莓 3 n
+蛇蜕 14 n
+蛇蝎 45 n
+蛇蝎为心 3 n
+蛇蝎心肠 3 n
+蛇蝎美人 3 n
+蛇蟠 9 ns
+蛇行 17 n
+蛇谷 3 n
+蛇足 6 n
+蛇鞭 3 n
+蛇食鲸吞 3 n
+蛇麻 3 n
+蛉 89 x
+蛊 211 i
+蛊惑 60 v
+蛊惑人心 49 i
+蛊惑狼 3 i
+蛊毒 3 v
+蛋 3862 n
+蛋制品 3 n
+蛋包 3 n
+蛋包饭 3 n
+蛋卷 9 n
+蛋品 11 n
+蛋壳 587 n
+蛋形 3 n
+蛋彩画 5 n
+蛋松 3 n
+蛋氨酸 19 n
+蛋汤 3 n
+蛋液 12 n
+蛋清 25 n
+蛋炒饭 5 n
+蛋白 1087 n
+蛋白伴侣 3 n
+蛋白体 3 n
+蛋白原 3 n
+蛋白尿 61 n
+蛋白梯 3 n
+蛋白沉淀 3 vn
+蛋白激酶 3 n
+蛋白石 36 n
+蛋白示 3 n
+蛋白粉 3 n
+蛋白组 3 n
+蛋白组学 3 n
+蛋白聚糖 3 n
+蛋白脂质 3 n
+蛋白芯片 3 n
+蛋白质 2097 n
+蛋白质印 3 n
+蛋白酶 54 n
+蛋白酶体 3 n
+蛋白酶解 3 n
+蛋白饲料 3 n
+蛋类 20 n
+蛋粉 3 n
+蛋糕 315 n
+蛋糕店 3 v
+蛋糕盒 3 r
+蛋糕网 3 vn
+蛋羹 4 n
+蛋花 3 n
+蛋花汤 3 n
+蛋蛋 15 n
+蛋酒 3 n
+蛋青 2 n
+蛋青画 3 n
+蛋鸡 13 n
+蛋黄 93 n
+蛋黄派 3 n
+蛋黄粉 3 n
+蛋黄素 3 n
+蛋黄酱 3 n
+蛎 35 g
+蛎黄 3 nr
+蛏 108 n
+蛏子 4 n
+蛏干 2 n
+蛏田 3 n
+蛐 41 n
+蛐蛐 49 n
+蛐蛐儿 16 n
+蛑 65 x
+蛒 6 zg
+蛓 233 zg
+蛔 410 n
+蛔厥 3 n
+蛔虫 96 n
+蛔虫病 11 n
+蛔虫药 3 n
+蛖 15 zg
+蛘 75 g
+蛙 491 ng
+蛙人 39 n
+蛙人操 3 n
+蛙人队 3 n
+蛙人鞋 3 n
+蛙叫 3 vn
+蛙叫声 3 n
+蛙声 14 n
+蛙式 3 n
+蛙式比赛 3 n
+蛙泳 49 vn
+蛙王 3 n
+蛙皮素 3 n
+蛙肉 3 n
+蛙腿 3 n
+蛙蟆胜负 3 n
+蛙跳 11 vn
+蛙鞋 3 n
+蛙鸣 17 vn
+蛙鸣蝉噪 3 vn
+蛛 594 n
+蛛丝 3 n
+蛛丝马迹 110 i
+蛛丝鼠迹 3 i
+蛛形纲 22 n
+蛛网 91 n
+蛛网尘埃 3 n
+蛛网尘封 3 i
+蛛网状 3 i
+蛛网膜 30 n
+蛛虫 3 n
+蛛蛛 3 n
+蛜 29 zg
+蛞 55 x
+蛞蝓 17 n
+蛟 480 zg
+蛟河 11 ns
+蛟河县 3 ns
+蛟河市 6 ns
+蛟龙 81 ns
+蛟龙得水 3 ns
+蛟龙戏水 3 n
+蛡 15 zg
+蛤 145 zg
+蛤壳 3 n
+蛤粉 3 n
+蛤蚌 3 n
+蛤蚌毒素 3 v
+蛤蚧 18 n
+蛤蛎 3 n
+蛤蜊 18 n
+蛤蜊汤 3 v
+蛤蟆 231 n
+蛤蟆功 3 n
+蛤蟆镜 7 n
+蛩 126 g
+蛪 2 zg
+蛬 8 zg
+蛭 206 g
+蛭石 45 n
+蛮 1158 d
+蛮不讲理 60 l
+蛮人 3 n
+蛮刀 3 n
+蛮力 3 n
+蛮劲 17 a
+蛮勇 3 a
+蛮国 3 n
+蛮地 3 n
+蛮夷 71 n
+蛮子 195 n
+蛮干 57 n
+蛮干到底 3 l
+蛮族 3 n
+蛮有意思 3 l
+蛮来生作 3 l
+蛮横 109 a
+蛮横无理 144 i
+蛮烟瘴雨 3 i
+蛮烟瘴雾 3 i
+蛮牛 3 n
+蛮缠 2 n
+蛮缠胡搅 3 i
+蛮荒 51 n
+蛮荒之地 3 i
+蛮荒时代 3 i
+蛮行 3 n
+蛮触相争 3 i
+蛮风 3 n
+蛮高 3 a
+蛮鸩 3 i
+蛰 75 v
+蛰伏 45 v
+蛰居 17 v
+蛰虫 3 v
+蛰雷 3 v
+蛱 36 x
+蛱蝶 11 n
+蛲 52 n
+蛲虫 29 n
+蛳 47 x
+蛴 66 x
+蛴螬 12 n
+蛸 26 x
+蛹 331 g
+蛹卧 3 n
+蛹期 3 n
+蛻 143 zg
+蛾 459 n
+蛾冠博带 3 n
+蛾子 31 n
+蛾害 3 n
+蛾术 3 n
+蛾灾 3 n
+蛾眉 65 n
+蛾眉月 3 n
+蛾眉皓齿 3 v
+蛾眉粉黛 3 n
+蛾眉螓首 3 v
+蛾虫 3 n
+蜀 2606 j
+蜀中 81 ns
+蜀国 66 ns
+蜀地 58 ns
+蜀山 15 ns
+蜀山区 3 ns
+蜀州 10 ns
+蜀汉 84 ns
+蜀犬吠天 3 i
+蜀犬吠日 3 i
+蜀王 32 nz
+蜀绣 13 nz
+蜀葵 11 n
+蜀道 28 ns
+蜀道难 3 n
+蜀道难行 3 i
+蜀都 15 ns
+蜀锦 46 ns
+蜀魏 3 l
+蜀黍 2 n
+蜂 1266 n
+蜂乳 2 n
+蜂产品 4 n
+蜂出泉流 3 i
+蜂刺 9 n
+蜂合蚁聚 3 i
+蜂合豕突 3 i
+蜂场 3 n
+蜂媒蝶使 3 n
+蜂屯乌合 3 i
+蜂屯蚁杂 3 i
+蜂屯蚁聚 3 i
+蜂屯蚁附 3 i
+蜂巢 117 n
+蜂巢形 3 n
+蜂巢状 4 n
+蜂巢胃 3 n
+蜂房 25 n
+蜂房蚁穴 3 n
+蜂扇蚁聚 3 i
+蜂拥 137 v
+蜂拥而上 32 i
+蜂拥而来 39 i
+蜂拥而至 43 i
+蜂拥蚁屯 3 i
+蜂拥蚁聚 3 i
+蜂攒蚁聚 3 i
+蜂攒蚁集 3 i
+蜂毒 29 n
+蜂毒明肽 3 n
+蜂毒激肽 3 n
+蜂毒肽 3 n
+蜂涌 3 v
+蜂涌而上 3 i
+蜂炮 3 n
+蜂狂蝶乱 3 n
+蜂王 43 n
+蜂王乳 3 n
+蜂王浆 32 n
+蜂王精 8 n
+蜂皇浆 2 n
+蜂皇精 3 n
+蜂目豺声 3 z
+蜂窝 129 n
+蜂窝式 2 n
+蜂窝煤 21 n
+蜂窝状 22 n
+蜂窝电话 3 n
+蜂窠 3 n
+蜂窠蚁穴 3 i
+蜂箱 15 n
+蜂糕 3 n
+蜂群 66 n
+蜂聚 2 v
+蜂胶 10 n
+蜂脾 3 n
+蜂腰 18 n
+蜂腰削背 3 n
+蜂腰猿背 3 n
+蜂舞 3 n
+蜂花粉 3 n
+蜂营蚁队 3 n
+蜂虿有毒 3 vn
+蜂蛹 3 n
+蜂蜜 331 n
+蜂蜜水 3 n
+蜂蜜瓶 3 i
+蜂蜡 27 n
+蜂识莺猜 3 i
+蜂起 67 v
+蜂起云涌 3 i
+蜂趋蚁附 3 n
+蜂迷蝶恋 3 vn
+蜂迷蝶猜 3 vn
+蜂附云集 3 i
+蜂飞蝶舞 3 n
+蜂鸟 25 n
+蜂鸟网 3 n
+蜂鸣器 3 n
+蜃 96 n
+蜃景 9 n
+蜃楼 4 n
+蜃楼海市 3 n
+蜃气 3 n
+蜇 49 v
+蜇伤 2 n
+蜇螯部 3 v
+蜈 8 n
+蜈支洲岛 3 n
+蜈蚣 595 n
+蜈蚣洞 3 n
+蜈蚣草 2 n
+蜉 3 n
+蜉蝣 30 n
+蜊 10 x
+蜋 9 zg
+蜍 7 x
+蜎 4 zg
+蜑户 3 vn
+蜑民 3 vn
+蜒 70 x
+蜒蚰 2 n
+蜓 35 x
+蜕 165 vg
+蜕化 15 v
+蜕化变质 31 n
+蜕变 108 v
+蜕壳 3 n
+蜕壳激素 3 n
+蜕皮 62 v
+蜕皮激素 3 i
+蜕膜 6 n
+蜗 55 n
+蜗利蝇名 3 vn
+蜗名微利 3 n
+蜗壳 3 n
+蜗居 21 n
+蜗旋 3 n
+蜗旋而上 3 n
+蜗杆 12 n
+蜗杆传动 3 n
+蜗牛 126 n
+蜗舍 3 n
+蜗舍荆扉 3 n
+蜗行中步 3 n
+蜗行牛步 3 n
+蜗角 3 n
+蜗角之争 3 n
+蜗角虚名 3 n
+蜗角蝇头 3 vn
+蜗轮 10 n
+蜗轮副 3 n
+蜘 7 n
+蜘蛛 311 n
+蜘蛛丝 3 nz
+蜘蛛人 3 n
+蜘蛛侠 3 n
+蜘蛛抱蛋 3 v
+蜘蛛洞 3 n
+蜘蛛痣 2 n
+蜘蛛类 3 n
+蜘蛛精 15 nz
+蜘蛛网 43 nz
+蜘蛛蟹 3 nz
+蜘蛛香 3 nz
+蜘蜘 3 n
+蜚 39 v
+蜚声 84 v
+蜚声中外 5 l
+蜚声国际 3 l
+蜚廉 3 l
+蜚瓦拔木 3 n
+蜚短流长 3 l
+蜚英腾茂 3 l
+蜚蠊 11 n
+蜚言蜚语 3 v
+蜚语 3 v
+蜚诽 3 v
+蜛 2 zg
+蜜 429 n
+蜜丸子 3 n
+蜜二糖 3 n
+蜜意 3 n
+蜜月 173 n
+蜜月旅行 3 nz
+蜜月游 3 n
+蜜枣 292 n
+蜜柑 10 n
+蜜柚 3 n
+蜜桃 37 n
+蜜桔 2 n
+蜜樱桃 3 n
+蜜橘 22 n
+蜜汁 16 n
+蜜洞 3 n
+蜜渍 3 n
+蜜源 56 n
+蜜熊 3 n
+蜜瓜 10 n
+蜜甜 3 n
+蜜粉 4 n
+蜜糖 38 n
+蜜罐 8 n
+蜜腺 38 n
+蜜色 3 n
+蜜蜂 360 n
+蜜蜂窝 3 n
+蜜蜡 2 n
+蜜语 5 n
+蜜里调油 6 n
+蜜雪儿 3 n
+蜜露 3 n
+蜜饯 109 n
+蜡 492 n
+蜡丸 47 n
+蜡书 3 n
+蜡人 3 n
+蜡人馆 3 n
+蜡像 27 n
+蜡像馆 21 n
+蜡光纸 4 n
+蜡刀 3 n
+蜡勺 3 n
+蜡台 9 n
+蜡叶 3 n
+蜡嘴 3 n
+蜡嘴雀 3 n
+蜡地 3 n
+蜡型制作 3 n
+蜡堵 3 vn
+蜡布 3 n
+蜡床 3 n
+蜡板 3 n
+蜡果 3 n
+蜡染 56 vn
+蜡油 5 n
+蜡泪 3 n
+蜡渣子 3 n
+蜡炬 3 n
+蜡炬成灰泪始干 4 i
+蜡烛 928 n
+蜡烛台 3 i
+蜡熟 3 z
+蜡版 3 n
+蜡疗 2 n
+蜡白 3 z
+蜡盘 6 n
+蜡笔 7 n
+蜡笔小新 3 i
+蜡笔画 6 n
+蜡管 3 n
+蜡纸 21 n
+蜡膏 3 n
+蜡芯儿 3 n
+蜡花 4 n
+蜡虫 3 n
+蜡质 46 n
+蜡黄 97 z
+蜡黄色 3 n
+蜢 13 x
+蜣 2 n
+蜣螂 23 n
+蜥 146 n
+蜥脚类 13 n
+蜥蜴 129 n
+蜥蜴人 3 vn
+蜥蜴毒 3 vn
+蜥蝪 3 n
+蜥蟀 3 n
+蜩 10 g
+蜩螗沸羹 3 nr
+蜮 13 g
+蜰 341 zg
+蜱 57 g
+蜴 2 x
+蜷 102 zg
+蜷伏 21 v
+蜷局 3 v
+蜷曲 46 v
+蜷缩 107 v
+蜹 57 zg
+蜺 2 zg
+蜻 10 n
+蜻蛉 3 n
+蜻蜒 3 n
+蜻蜒点水 3 v
+蜻蜓 114 n
+蜻蜓点水 24 i
+蜽 25 zg
+蜾 2 n
+蜾蝇 3 n
+蜾蠃 6 n
+蜿 10 v
+蜿蜒 842 v
+蜿蜓起伏 3 v
+蜿豌豆 3 v
+蝀 5 zg
+蝇 325 ng
+蝇利蜗名 3 vn
+蝇名蜗利 3 vn
+蝇声蛙躁 3 l
+蝇头 7 n
+蝇头之利 3 l
+蝇头小利 12 l
+蝇头小楷 21 l
+蝇头微利 3 l
+蝇头蜗角 3 v
+蝇子 5 n
+蝇拍 3 v
+蝇攒蚁聚 3 i
+蝇攒蚁附 3 i
+蝇矢 3 n
+蝇粪占玉 3 n
+蝇粪点玉 3 n
+蝇营狗苟 8 i
+蝇营蚁聚 3 i
+蝇营蚁附 3 i
+蝇营鼠窥 3 i
+蝇虎 3 n
+蝇蛆 3 n
+蝇蛹 2 n
+蝇随骥尾 3 i
+蝇集蚁附 3 i
+蝇飞蚁聚 3 i
+蝈 3 n
+蝈蝈 16 n
+蝈蝈儿 5 n
+蝉 535 n
+蝉不知雪 3 v
+蝉儿 3 n
+蝉喘雷干 3 n
+蝉嘶 3 n
+蝉声 2 n
+蝉娟 3 n
+蝉纱 3 n
+蝉翼 38 n
+蝉翼为重 3 n
+蝉联 127 v
+蝉联冠军 3 n
+蝉联宝座 3 n
+蝉腹龟肠 3 n
+蝉虾 3 n
+蝉蛹 3 n
+蝉蜕 20 n
+蝉衣 3 n
+蝉连 3 v
+蝉鸣 3 v
+蝉鸣声 3 n
+蝌 107 n
+蝌蚪 321 n
+蝌蚪文 3 vn
+蝎 222 n
+蝎子 193 n
+蝎子王 3 n
+蝎子草 2 n
+蝎毒 19 n
+蝎虎 18 n
+蝎蛇 3 n
+蝕 4 zg
+蝗 254 n
+蝗害 3 n
+蝗情 3 n
+蝗灭 3 n
+蝗灾 20 n
+蝗莺 3 n
+蝗虫 157 n
+蝗蝻 5 n
+蝙 6 n
+蝙蝠 314 n
+蝙蝠侠 5 n
+蝙蝠洞 3 n
+蝙蝠衫 3 n
+蝟 5 zg
+蝠 88 x
+蝠王 66 n
+蝣 2 x
+蝤 3 n
+蝤蛑 4 n
+蝨 15 zg
+蝨子 3 v
+蝮 25 n
+蝮蛇 69 n
+蝮蛇毒素 3 n
+蝮蛇螫手 3 vn
+蝰 53 n
+蝰蛇 6 n
+蝰蛇毒素 3 n
+蝱 2 zg
+蝲蛄 4 n
+蝴 2 n
+蝴蝶 481 n
+蝴蝶儿 4 n
+蝴蝶兰 4 ns
+蝴蝶剑 3 n
+蝴蝶型 3 n
+蝴蝶夫人 3 n
+蝴蝶效应 3 n
+蝴蝶斑 8 n
+蝴蝶树 3 n
+蝴蝶梦 3 n
+蝴蝶泉 12 n
+蝴蝶犬 3 n
+蝴蝶瓦 3 ns
+蝴蝶结 15 n
+蝴蝶花 4 n
+蝴蝶装 5 n
+蝴蝶谷 61 n
+蝴蝶飞飞 3 n
+蝴蝶鱼 13 n
+蝶 261 nz
+蝶儿 2 n
+蝶兰 3 nz
+蝶呤 3 n
+蝶啶 11 n
+蝶型螺母 3 n
+蝶子 3 n
+蝶山区 3 nz
+蝶岛 2 n
+蝶式 3 n
+蝶形 19 n
+蝶形花 15 n
+蝶形花冠 3 n
+蝶形领带 3 n
+蝶恋花 20 nz
+蝶恋蜂狂 3 n
+蝶泳 47 n
+蝶窦 12 n
+蝶类 3 n
+蝶粉 3 nz
+蝶粉蜂黄 3 n
+蝶群 3 n
+蝶翅 2 n
+蝶舞 5 n
+蝶蛹 2 n
+蝶衣 3 n
+蝶阀 5 n
+蝶阀厂 3 v
+蝶鞍 2 n
+蝶鞍点 3 n
+蝶骨 6 n
+蝼 8 n
+蝼蚁 45 n
+蝼蚁儿 3 n
+蝼蚁得志 3 n
+蝼蚁贪生 3 z
+蝼蛄 31 n
+蝼蝈 3 n
+蝽 42 g
+蝾 8 zg
+蝾螈 45 n
+螂 13 x
+螃 6 n
+螃蟹 185 n
+螃蟹壳 3 v
+螃蟹肉 3 v
+螅 359 x
+螇蟀 3 n
+螈 57 x
+螋 7 x
+融 584 vn
+融为 3 v
+融为一体 265 l
+融于 20 v
+融众 3 n
+融会 59 v
+融会贯通 78 nr
+融会通浃 3 i
+融侨锦江 3 nr
+融入 484 v
+融冰 5 vn
+融冰化 3 nr
+融冻 3 vn
+融冻泥 3 nr
+融券 3 n
+融化 327 vn
+融化剂 3 n
+融化指数 3 l
+融合 1392 vn
+融合度 2 n
+融合术 13 n
+融合牙 3 ns
+融合线 3 n
+融和 17 vn
+融土 3 n
+融墙 3 n
+融安 11 ns
+融安县 5 ns
+融成 3 v
+融摄 3 v
+融桥 3 ns
+融水 135 vn
+融水县 2 ns
+融水苗族自治县 7 ns
+融水镇 2 nr
+融汇 61 n
+融汇贯通 7 nr
+融江 4 ns
+融注 3 v
+融洽 270 v
+融洽地 3 nr
+融洽无间 3 nr
+融液 3 n
+融液贯通 3 i
+融融 47 n
+融融洽洽 3 nr
+融解 9 v
+融解点 3 n
+融解热 3 l
+融贯 2 nr
+融资 1006 vn
+融资券 40 n
+融资难 3 l
+融资额 8 n
+融进 6 v
+融进那 2 nr
+融通 67 vn
+融释贯通 3 i
+融雪 42 vn
+融雪剂 3 nr
+融雪径流 3 i
+融雪水 12 nr
+融雪消 2 nr
+融高丽 2 nr
+螐 25 zg
+螒 54 zg
+螓首蛾眉 3 i
+螗 7 g
+螘 2 zg
+螛 125 zg
+螟 55 zg
+螟害 3 n
+螟岭 3 n
+螟虫 9 n
+螟蛉 5 n
+螟蛾 12 n
+螠 6 zg
+螢 3 zg
+螨 297 g
+螨虫 13 n
+螫 97 v
+螫人 3 n
+螫手解腕 3 n
+螫毒 3 n
+螫眼睛 3 n
+螫舌 3 n
+螫针 11 n
+螭 439 g
+螯 132 zg
+螯合 14 nz
+螯合剂 3 nz
+螯合基团 3 nz
+螯合效应 3 n
+螯合树脂 3 nz
+螯合滴定 3 nz
+螯合物 6 n
+螯合环 3 nz
+螯合试剂 3 nz
+螯合配体 3 n
+螱 2 zg
+螲 4 zg
+螳 11 nz
+螳臂当车 5 l
+螳臂当辙 3 i
+螳臂挡车 6 l
+螳螂 65 n
+螳螂奋臂 3 l
+螳螂当车 3 nz
+螳螂拳 14 nz
+螳螂捕蝉 14 l
+螳螂黄雀 3 l
+螵 3 x
+螵蛸 3 n
+螺 709 n
+螺丝 47 n
+螺丝刀 21 n
+螺丝垫 3 n
+螺丝帽 2 n
+螺丝扣 3 n
+螺丝批 3 n
+螺丝攻 3 n
+螺丝机 3 n
+螺丝母 3 n
+螺丝起子 3 n
+螺丝钉 27 n
+螺丝钳 3 n
+螺丝钻 3 n
+螺口 2 n
+螺号 3 n
+螺圈 3 n
+螺增环 3 n
+螺山 22 n
+螺帽 6 n
+螺攻 3 n
+螺旋 550 n
+螺旋体 54 n
+螺旋城 3 n
+螺旋度 3 n
+螺旋式 25 n
+螺旋弹簧 3 n
+螺旋形 3 n
+螺旋性 3 n
+螺旋杆菌 3 n
+螺旋板 3 n
+螺旋桨 237 n
+螺旋浆 3 n
+螺旋状 3 n
+螺旋管 3 n
+螺旋线 15 n
+螺旋菌 3 n
+螺旋藻 9 n
+螺旋转动 3 n
+螺旋轮 3 n
+螺旋运动 3 n
+螺旋钢管 3 n
+螺旋霉素 3 n
+螺旋面 3 n
+螺杆 13 n
+螺杆式 5 n
+螺杆泵 3 n
+螺杆菌 4 n
+螺枪 3 n
+螺柱 2 n
+螺栓 31 n
+螺母 24 n
+螺烷 3 n
+螺纹 138 n
+螺纹钢 3 n
+螺纹钢筋 3 n
+螺线 12 n
+螺线管 9 n
+螺绕环 3 n
+螺蛳 25 n
+螺距 10 n
+螺钉 33 n
+螺钿 22 n
+螺髻 2 n
+螺髻山 5 ns
+螼 7 zg
+螽 6 n
+螽斯 8 n
+螽斯衍庆 3 n
+螾 285 zg
+螿 7 zg
+蟀 60 x
+蟁 9 zg
+蟆 171 x
+蟊 33 g
+蟊县 3 n
+蟊贼 11 n
+蟋 11 n
+蟋蟀 225 n
+蟋蟀草 3 vn
+蟑 4 n
+蟑螂 91 n
+蟑螂乐队 3 v
+蟒 328 n
+蟒山 2 ns
+蟒蛇 78 n
+蟒袍 27 n
+蟒袍玉带 3 n
+蟕 3 zg
+蟘 7 zg
+蟚 3 zg
+蟛 88 x
+蟛蜞菊 3 nz
+蟜 3 zg
+蟝 15 zg
+蟟 19 zg
+蟠 146 vg
+蟠桃 88 n
+蟠桃会 10 n
+蟠螭 13 n
+蟠龙 408 nz
+蟠龙镇 17 ns
+蟢 49 zg
+蟦 10 zg
+蟪 40 x
+蟪蛄 2 n
+蟭 18 zg
+蟮 322 x
+蟰 6 zg
+蟲 3 zg
+蟷 3 zg
+蟸 230 zg
+蟹 802 ng
+蟹匡蝉緌 3 nr
+蟹壳 10 n
+蟹形文字 3 n
+蟹爪 10 n
+蟹类 30 n
+蟹粉 10 nz
+蟹肉 8 n
+蟹肉汤 3 nz
+蟹苗 9 n
+蟹茺蟹乱 3 nz
+蟹行 3 n
+蟹青 3 n
+蟹黄 9 nz
+蟼 11 zg
+蟾 442 n
+蟾光 2 n
+蟾兔 3 n
+蟾宫 24 n
+蟾宫折桂 5 n
+蟾桂 3 n
+蟾毒素 3 n
+蟾毒色胺 3 n
+蟾蜍 181 n
+蟾酥 14 n
+蠀 9 zg
+蠃 5 x
+蠊 71 x
+蠋 11 zg
+蠎 68 zg
+蠓 102 n
+蠓艋 3 n
+蠓虫 10 n
+蠔 3 zg
+蠔油 3 z
+蠔田 3 v
+蠕 44 v
+蠕动 305 v
+蠕动泵 3 n
+蠕变 34 v
+蠕变柔量 3 l
+蠕形动物 2 l
+蠕虫 136 n
+蠕虫形 3 n
+蠕蠕 30 z
+蠕行 3 v
+蠖 69 x
+蠖屈不伸 3 n
+蠖屈求伸 3 n
+蠙 5 zg
+蠛 39 x
+蠠 4 zg
+蠡 67 ns
+蠡县 14 ns
+蠡园 14 ns
+蠡沟 3 ns
+蠡测 2 v
+蠡测管窥 3 nr
+蠡酌管窥 3 nr
+蠢 323 a
+蠢事 59 n
+蠢人 42 n
+蠢动 8 n
+蠢夫 3 n
+蠢头蠢脑 3 i
+蠢如鹿豕 3 i
+蠢才 53 n
+蠢拙 3 a
+蠢材 21 n
+蠢汉 7 n
+蠢物 23 n
+蠢猪 3 n
+蠢笨 31 a
+蠢虫 3 n
+蠢蛋 3 n
+蠢蠢 3 a
+蠢蠢欲动 64 i
+蠢话 15 n
+蠢货 21 n
+蠢驴 7 n
+蠲 37 g
+蠲免 28 v
+蠲除 3 v
+蠴 3 zg
+蠵 9 zg
+蠹 137 n
+蠹众木折 3 n
+蠹国害民 3 n
+蠹国殃民 3 vn
+蠹国残民 3 n
+蠹国病民 3 n
+蠹国耗民 3 n
+蠹居棊处 3 n
+蠹居棋处 3 n
+蠹政 3 n
+蠹政害民 3 n
+蠹政病民 3 n
+蠹简 3 n
+蠹简遗编 3 n
+蠹虫 9 n
+蠹鱼 2 n
+蠼 54 x
+血 7567 n
+血与火 3 n
+血丝 106 n
+血丝乎拉 3 z
+血书 191 n
+血亏 22 n
+血亲 82 n
+血人 3 n
+血仇 37 n
+血余炭 3 n
+血债 41 n
+血债累累 3 l
+血债血还 3 l
+血光 26 n
+血光之灾 9 i
+血凝 3 n
+血凝素 3 n
+血刀老祖 3 i
+血刃 3 n
+血制品 8 n
+血卟啉 3 nr
+血印 21 n
+血压 622 n
+血压低 3 n
+血压计 12 n
+血压过低 3 l
+血压高 3 n
+血友 3 n
+血友病 38 n
+血口 8 n
+血口喷人 29 n
+血吸虫 54 n
+血吸虫病 152 n
+血块 41 n
+血型 268 n
+血域 3 n
+血域龙吟 3 n
+血塞通 3 n
+血小板 195 n
+血尿 80 n
+血尿酸 3 n
+血崩 5 n
+血常规 21 n
+血库 21 n
+血府逐瘀汤 3 n
+血影蛋白 3 l
+血循环 24 n
+血性 202 n
+血性汉子 10 l
+血性男儿 3 l
+血情 3 n
+血战 194 n
+血战到底 12 l
+血手印 3 n
+血拼 3 v
+血斑 4 n
+血族 12 n
+血晕 6 n
+血本 63 n
+血本无归 22 l
+血枯病 3 n
+血染 3 n
+血染沙场 3 n
+血栓 137 n
+血栓性 3 n
+血栓症 3 n
+血栓素 3 n
+血样 29 n
+血案 39 n
+血检 3 j
+血槽 3 n
+血气 95 n
+血气之勇 3 l
+血气方刚 32 n
+血气胸 3 l
+血水 139 n
+血汁 3 n
+血汗 82 n
+血汗钱 67 n
+血汙 3 z
+血污 120 n
+血沉 20 z
+血河 3 n
+血泊 213 n
+血泡 24 n
+血泪 203 n
+血泪交织 3 l
+血泪史 9 l
+血泪斑斑 3 l
+血泪盈襟 3 l
+血洗 40 n
+血流 315 n
+血流如柱 3 i
+血流如注 17 l
+血流成川 3 l
+血流成杵 3 i
+血流成河 57 l
+血流成渠 3 n
+血流漂杵 2 i
+血流量 3 n
+血浆 328 n
+血浆车 3 n
+血浓于水 6 i
+血海 32 n
+血海深仇 45 l
+血涌如注 3 i
+血液 1960 n
+血液制品 3 n
+血液学 7 n
+血液循环 3 n
+血液病 32 n
+血液癌 3 n
+血液科 12 n
+血淋淋 166 z
+血清 318 n
+血清型 3 n
+血清学 42 l
+血清病 10 n
+血清素 15 l
+血清蛋白 3 l
+血渍 73 n
+血源 3 n
+血源性 3 n
+血滴 3 n
+血热型 7 n
+血玲珑 3 i
+血球 13 n
+血痂 5 n
+血症 170 n
+血痕 112 n
+血瘀 45 n
+血癌 12 n
+血盆 3 n
+血盆大口 21 l
+血祭 4 n
+血科 3 n
+血站 36 n
+血竭 17 n
+血管 1265 n
+血管性 18 n
+血管炎 3 n
+血管病 3 n
+血管瘤 49 l
+血管硬化 3 l
+血粉 6 n
+血粘度 3 n
+血糊糊 8 z
+血糖 220 n
+血糖仪 3 n
+血糖值 3 n
+血糖高 3 n
+血素 3 n
+血红 165 n
+血红素 28 n
+血红色 3 n
+血红蛋白 222 l
+血线虫 3 n
+血细胞 61 n
+血统 282 n
+血统书 3 n
+血统工人 3 n
+血统论 12 n
+血统证明 3 n
+血绣 3 n
+血缘 416 n
+血缘关系 3 l
+血耳 3 n
+血肉 181 n
+血肉之躯 211 l
+血肉己 3 i
+血肉模糊 103 l
+血肉横飞 166 i
+血肉相联 3 l
+血肉相连 48 i
+血肉糢糊 3 n
+血肠 13 n
+血肿 43 n
+血脂 82 n
+血脂康 6 n
+血脂高 3 n
+血脉 166 n
+血脉相连 2 l
+血脉相通 3 l
+血脑屏障 3 i
+血脖 3 n
+血腥 835 a
+血腥味 3 n
+血腥气 47 n
+血色 290 n
+血色素 3 n
+血花 13 n
+血荐轩辕 3 v
+血荒 3 n
+血药浓度 3 n
+血虚 41 n
+血行器 3 n
+血衣 145 n
+血证 3 n
+血证论 3 n
+血诏 3 n
+血豆腐 9 n
+血象 20 n
+血账 7 n
+血路 122 n
+血轮 3 n
+血运重建 3 j
+血迹 309 n
+血迹斑斑 3 l
+血透 4 nz
+血量 3 n
+血钙质 3 n
+血防 3 n
+血雨 18 n
+血雨腥风 25 n
+血青素 3 n
+血风肉雨 3 l
+血饮 3 n
+血馒头 3 vn
+血骷髅 3 n
+血鹦鹉 3 nr
+衁 383 zg
+衄 58 zg
+衅 186 zg
+衅发萧墙 3 nr
+衅稔恶盈 3 z
+衅端 3 nr
+衅起萧墙 3 nr
+衅隙 3 n
+衆 3 zg
+行 22128 zg
+行一夫 17 nr
+行万里路 3 n
+行不从径 3 l
+行不副言 3 i
+行不履危 3 i
+行不得 3 v
+行不得也 3 i
+行不改姓 3 l
+行不更名 2 i
+行不由径 3 i
+行不胜衣 3 i
+行不苟合 3 i
+行不行 3 v
+行不贰过 3 v
+行不通 157 v
+行不逾方 3 i
+行业 8127 n
+行业动态 3 n
+行业协会 3 n
+行业性 10 n
+行业新闻 3 n
+行业标准 3 n
+行业类别 3 n
+行业语 3 n
+行业资讯 3 n
+行业软件 3 n
+行业龙头 3 n
+行东 8 n
+行为 8963 v
+行为不检 3 nr
+行为不端 3 i
+行为主义 3 n
+行为主体 9 n
+行为习惯 3 n
+行为人 57 n
+行为准则 3 n
+行为学 22 l
+行为性 2 n
+行为恶劣 3 l
+行为犯 3 i
+行为环境 3 l
+行为矩阵 3 i
+行为矫正 3 nr
+行为科学 3 l
+行为能力 3 n
+行为艺术 3 l
+行为表现 3 i
+行为规范 3 l
+行为责任 3 l
+行为障碍 3 n
+行义 3 n
+行义童子 3 n
+行之不远 3 i
+行之有年 3 l
+行之有效 210 i
+行乐 30 n
+行乞 27 v
+行书 63 n
+行事 1315 n
+行事历 3 n
+行云 13 n
+行云流水 53 n
+行人 979 n
+行人情 3 n
+行人穿越 3 i
+行令 3 n
+行仪礼 2 nr
+行伍 85 n
+行伍出身 3 n
+行会 131 n
+行会战 3 n
+行住坐卧 2 l
+行使 5519 n
+行使主权 3 n
+行使政权 3 n
+行使权力 3 n
+行使职权 3 n
+行侠仗义 92 n
+行侠好义 3 n
+行俭德 7 nr
+行健 6 n
+行僧 3 n
+行兵布阵 3 n
+行内 30 n
+行内人士 3 n
+行军 686 n
+行军壶 3 n
+行军床 23 n
+行冠礼 5 nr
+行凶 134 n
+行凶作恶 3 i
+行凶前 3 i
+行凶后 3 i
+行凶杀人 3 i
+行刑 292 n
+行刑室 6 n
+行刑队 8 n
+行列 693 n
+行列式 43 n
+行列注水 3 n
+行刺 291 n
+行刺者 4 n
+行前 45 t
+行加征 2 n
+行动 9066 vn
+行动不便 3 l
+行动代号 3 n
+行动党 32 n
+行动坐卧 3 l
+行动指南 3 n
+行动敏捷 3 n
+行动者 15 n
+行动自如 3 i
+行动计划 3 n
+行动诡秘 3 nr
+行动迟缓 3 i
+行动队 3 n
+行劫 11 v
+行包 12 n
+行医 203 n
+行医者 3 n
+行南攻 2 nr
+行卫尉 2 n
+行古志今 3 n
+行号 37 n
+行号卧泣 3 i
+行号巷哭 3 i
+行合趋同 3 l
+行同 3 n
+行同狗彘 3 nr
+行同能偶 3 n
+行同陌路 3 nr
+行向量 3 n
+行君臣 8 nr
+行吟 8 v
+行吟诗人 3 nr
+行否 3 v
+行员 3 n
+行唐 3 t
+行唐县 3 nr
+行商 59 n
+行商坐贾 3 n
+行善 99 v
+行善不欲 3 i
+行善积德 3 n
+行囊 116 n
+行外话 3 n
+行大礼 3 nr
+行大运 3 n
+行天 7 n
+行天下 3 n
+行天宫 3 nr
+行头 73 n
+行奉义 2 nr
+行奸卖俏 3 i
+行孝 3 n
+行客 3 n
+行宣政 4 nr
+行宪 3 j
+行宪国 3 n
+行宪国民 3 n
+行宪纪念 3 n
+行宫 219 n
+行家 223 n
+行家话 3 n
+行家里手 27 n
+行宽仁 2 nr
+行宽简 3 nr
+行密子 2 n
+行将 139 n
+行将完成 3 nr
+行将就木 15 i
+行将崩溃 3 i
+行将灭亡 3 i
+行尊 3 n
+行尸走肉 42 n
+行尸走骨 3 i
+行尾 3 n
+行崄侥幸 3 vn
+行己有耻 3 i
+行市 29 n
+行师动众 3 n
+行帮 8 n
+行年 3 n
+行幸乐 2 nr
+行库 3 n
+行废立 2 nr
+行度 2 n
+行庭参 2 n
+行式打印机 6 l
+行当 249 n
+行彩田 6 nr
+行径 698 n
+行得通 42 n
+行御史 3 n
+行御史台 6 n
+行必果 14 n
+行思坐忆 3 n
+行思坐想 3 n
+行思坐筹 3 i
+行情 3357 n
+行情报价 3 n
+行情看涨 3 l
+行情看跌 3 v
+行情表 4 n
+行成于思 3 l
+行房 16 n
+行房事 3 n
+行政 21860 n
+行政主管 3 n
+行政事务 3 n
+行政公署 1062 n
+行政助理 3 n
+行政化 19 n
+行政区 2345 n
+行政区划 5093 n
+行政区号 3 n
+行政区域 1658 n
+行政区画 3 n
+行政命令 3 n
+行政地理 3 j
+行政处分 46 n
+行政处罚 3 n
+行政处罚法 6 n
+行政复议 3 n
+行政官 34 n
+行政官员 72 n
+行政局 3 n
+行政当局 3 n
+行政性 23 n
+行政拘留 3 i
+行政效率 3 n
+行政权 85 n
+行政村 54 n
+行政案件 3 n
+行政法 49 n
+行政法学 3 n
+行政法院 3 n
+行政界线 3 n
+行政监察 3 n
+行政监督 3 n
+行政管理学 33 n
+行政级别 3 n
+行政编制 3 n
+行政职务 3 n
+行政腐败 3 n
+行政许可 3 n
+行政诉讼 44 l
+行政诉讼法 33 n
+行政责任 3 n
+行政部 21 n
+行政部长 3 n
+行政部门 311 n
+行政长官 3 n
+行政院 210 n
+行政院长 3 n
+行数 3 n
+行文 129 n
+行文流畅 3 nr
+行方不明 3 l
+行方便 3 n
+行旅 35 n
+行时 39 n
+行易知难 3 n
+行星 703 n
+行星风系 3 n
+行有余力 6 l
+行有行规 3 n
+行期 19 n
+行权价 2 n
+行李 891 n
+行李包 7 n
+行李卷 9 n
+行李卷儿 2 n
+行李厢 4 n
+行李室 3 n
+行李房 3 n
+行李架 9 n
+行李牌 2 n
+行李物品 3 n
+行李箱 12 n
+行李舱 2 n
+行李袋 9 n
+行李车 7 n
+行杖 3 n
+行板 5 n
+行栈 3 n
+行树 3 n
+行格势禁 3 i
+行检 3 j
+行楷 3 n
+行款 21 n
+行歌坐月 3 l
+行止 122 v
+行步 13 n
+行步如飞 3 i
+行气 57 n
+行气活血 3 n
+行水金 2 n
+行汉法 4 n
+行汉礼 2 nr
+行泉府 2 n
+行波 3 n
+行波天线 3 n
+行波管 8 n
+行波说 3 n
+行洪 7 vn
+行浊言清 3 i
+行灶 3 n
+行点 2 n
+行照 3 n
+行状 20 n
+行狼 3 n
+行猎 3 n
+行田伯 6 nr
+行略 3 n
+行痴 3 n
+行痴和尚 2 n
+行百艺 2 n
+行百里 3 n
+行百里者半九十 4 i
+行相 3 n
+行省 1825 n
+行知 5 n
+行短才高 3 i
+行礼 701 n
+行社 3 n
+行程 766 n
+行程开关 3 n
+行程表 35 n
+行空 8 n
+行窃 11 v
+行笔 3 n
+行笔流畅 3 i
+行符玺 3 n
+行管 8 n
+行箧 3 i
+行约 7 n
+行纪 4 n
+行经 102 n
+行署 242 n
+行者 4111 n
+行者让路 3 n
+行而不远 4 i
+行聘 3 v
+行脚 3 n
+行脚僧 3 n
+行腔 3 n
+行至 353 v
+行舟 15 n
+行船 63 n
+行色 11 n
+行色匆匆 27 i
+行色怱怱 3 v
+行若无事 31 i
+行若狐鼠 3 i
+行若狗彘 3 nr
+行草 39 n
+行营 109 vn
+行藏 3 n
+行藏用舍 3 n
+行血 3 n
+行行 3 n
+行行出状元 14 n
+行行好 3 n
+行行色色 3 n
+行行蛇蚓 3 n
+行装 116 n
+行装甫卸 3 nz
+行规 97 n
+行诈 3 vn
+行译码器 3 n
+行话 28 n
+行谊 3 n
+行货 33 n
+行贩 5 n
+行贾 3 n
+行贿 217 v
+行贿人 2 n
+行贿受贿 3 v
+行贿罪 6 n
+行贿者 8 n
+行赏 3 v
+行走 1241 v
+行走不便 14 i
+行走机构 3 n
+行走路线 3 n
+行距 17 n
+行路 349 n
+行路人 4 n
+行路者 2 n
+行路难 3 n
+行踪 220 v
+行踪不定 3 l
+行踪不明 3 i
+行踪无定 3 i
+行踪飘忽 3 i
+行车 220 n
+行车执照 3 n
+行车时间 3 n
+行车线 3 n
+行车证 3 n
+行车道 20 n
+行辈 11 n
+行辕 311 n
+行运 3 n
+行进 501 v
+行进路线 3 n
+行远升高 3 n
+行远必自 3 nr
+行远自迩 3 i
+行述 5 v
+行迹 50 n
+行速 3 n
+行道 25 n
+行道树 36 n
+行部 3 n
+行酒 3 n
+行酒令 4 n
+行金穗 7 n
+行针 12 n
+行针步线 3 n
+行销 123 vn
+行销全国 3 n
+行销国内 3 n
+行销网 3 n
+行销费用 3 n
+行销量 3 n
+行销骨立 3 n
+行长 419 n
+行间 33 n
+行间字里 3 n
+行间距 3 n
+行院 3 n
+行险徼幸 3 vn
+行频 4 n
+行颠 3 ns
+行风 31 n
+行馆 3 n
+行香挂牌 3 nz
+行驶 726 v
+行驶证 3 n
+行驶路线 3 n
+行骗 32 vn
+行骗者 10 n
+衍 270 v
+衍义 3 n
+衍传 3 vn
+衍化 24 vn
+衍变 44 v
+衍射 342 v
+衍射图样 3 n
+衍射屏 3 n
+衍射角 3 n
+衍文 3 n
+衍生 319 v
+衍生品 3 n
+衍生物 255 n
+衍生词 3 n
+衍绎 3 v
+衎 4 zg
+衏 105 zg
+衒 5 zg
+衒玉求售 3 l
+衒玉自售 3 l
+衒玉贾石 3 ns
+術 16 zg
+衔 1542 v
+衔住 3 v
+衔儿 3 v
+衔冤 7 v
+衔冤负屈 3 nr
+衔华佩实 3 z
+衔命 3 v
+衔命持节 3 n
+衔哀 3 v
+衔头 7 v
+衔尾 5 v
+衔尾相属 3 n
+衔尾相随 3 n
+衔恨 3 v
+衔恨而死 3 n
+衔恨蒙枉 3 n
+衔悲 3 v
+衔悲茹恨 3 i
+衔悲菇恨 3 n
+衔愤 3 v
+衔接 559 v
+衔接航班 3 n
+衔接起来 3 n
+衔枚 15 v
+衔枚疾走 3 n
+衔橛之变 3 v
+衔橛之虞 3 v
+衔毕佩实 3 z
+衔沙填海 3 n
+衔泣 3 v
+衔泥 3 v
+衔玉贾石 3 vn
+衔环 3 n
+衔环结草 3 n
+衔石填海 3 n
+衔竿 3 v
+衔结 3 v
+衔胆栖冰 3 n
+衔铁 5 v
+衕 4 zg
+衖 18 zg
+衖堂 3 z
+街 8680 n
+街上 1877 s
+街亭 45 n
+街办 8 n
+街区 113 s
+街口 99 s
+街号巷哭 3 i
+街名 11 n
+街坊 438 n
+街坊四邻 3 n
+街坊邻居 3 n
+街坊邻里 3 n
+街垒 19 n
+街垒战 6 nz
+街头 1936 s
+街头剧 9 n
+街头巷尾 37 i
+街头巷底 3 i
+街头恶棍 3 n
+街头时尚 3 n
+街头标贴 3 n
+街头诗 5 n
+街头霸王 3 nz
+街子 8 n
+街尾相随 3 i
+街巷 218 n
+街巷战 5 i
+街巷湫隘 3 n
+街市 211 n
+街心 85 n
+街心公园 3 n
+街心花园 3 n
+街招 3 n
+街景 52 n
+街机 4 n
+街机版 3 n
+街沟 3 n
+街灯 32 n
+街灯柱 3 n
+街环结草 3 nz
+街球王 3 n
+街舞 13 n
+街衢 15 n
+街角 36 n
+街谈巷议 13 i
+街谈巷论 3 i
+街谈巷语 3 i
+街谈巷说 3 i
+街谈巷谚 3 n
+街谭巷议 3 nr
+街路 3 n
+街车 10 n
+街边 68 s
+街道 3824 n
+街道办 2 n
+街道口 3 n
+街道社区 3 n
+街道绿化 3 n
+街门 42 n
+街霸 3 nz
+街霸方块 3 n
+街面 68 n
+街面上 3 n
+街面儿上 3 n
+衙 407 n
+衙内 89 n
+衙前 51 ns
+衙官屈宋 3 n
+衙府 3 n
+衙役 240 n
+衙署 709 n
+衙门 2974 n
+衙门作风 3 n
+衚衕 3 z
+衠 4 zg
+衡 319 ns
+衡东 6 ns
+衡东县 3 ns
+衡以山 2 nr
+衡南 4 ns
+衡南县 3 ns
+衡器 27 nr
+衡定 2 v
+衡山 445 ns
+衡山县 7 ns
+衡山路 13 ns
+衡州 19 ns
+衡平 28 ns
+衡平法 15 nr
+衡广 2 v
+衡志诚 2 nr
+衡情 3 v
+衡情度理 3 n
+衡情论理 3 n
+衡情酌理 3 vn
+衡抚辰 2 nr
+衡指 2 v
+衡水 38 ns
+衡水市 12 ns
+衡汇 2 ns
+衡点点 3 v
+衡短论长 3 v
+衡石丈 2 nr
+衡石程书 3 n
+衡石量书 3 n
+衡虑 2 v
+衡虑困心 3 n
+衡量 919 v
+衡量得失 3 v
+衡量标准 3 n
+衡门深巷 3 nr
+衡阳 168 ns
+衡阳人 5 nr
+衡阳县 7 ns
+衡阳市 35 ns
+衡阳路 3 ns
+衡阳雁断 3 ns
+衢 241 ns
+衢县 10 ns
+衢州 105 ns
+衢州市 12 ns
+衢巷 3 ns
+衢江区 3 ns
+衢道 3 ns
+衣 3280 n
+衣不完采 3 i
+衣不盖体 3 i
+衣不蔽体 9 i
+衣不解带 8 n
+衣不重帛 3 i
+衣不重彩 3 i
+衣业 3 n
+衣二僧 3 nr
+衣传 2 n
+衣修午 2 nr
+衣兜 56 n
+衣内摸 2 nr
+衣冠 204 n
+衣冠不整 16 l
+衣冠冢 11 nr
+衣冠南 2 nr
+衣冠土枭 3 n
+衣冠士 3 nr
+衣冠整洁 3 nr
+衣冠文物 3 n
+衣冠楚楚 159 nr
+衣冠济 2 n
+衣冠济济 3 n
+衣冠礼乐 3 nr
+衣冠禽兽 9 i
+衣冠蓝缕 3 nr
+衣分 3 n
+衣刷 3 n
+衣勾 3 nr
+衣包 3 n
+衣单食薄 3 l
+衣原体 18 n
+衣商 2 n
+衣囊 6 n
+衣壳 3 n
+衣夹 4 n
+衣奴 2 n
+衣室 3 n
+衣宫女 3 nr
+衣宵食旰 3 i
+衣宽带松 3 nr
+衣小兵 2 nr
+衣局 3 n
+衣履 38 nr
+衣工 2 n
+衣巾 7 n
+衣帛 3 n
+衣带 3 n
+衣带渐宽终不悔 2 i
+衣带诏 13 n
+衣帽 71 n
+衣帽架 10 n
+衣帽钩 3 n
+衣帽间 2 n
+衣帽鞋袜 3 n
+衣式 2 n
+衣御史 6 n
+衣扣 34 n
+衣披 2 n
+衣摆 3 n
+衣料 72 n
+衣服 5052 n
+衣来伸手 11 n
+衣架 48 n
+衣架子 2 n
+衣架饭囊 3 n
+衣柜 82 n
+衣档 2 n
+衣橱 47 n
+衣民 5 n
+衣烂衫 22 nr
+衣片 14 n
+衣物 314 n
+衣物箱 3 n
+衣甲 19 n
+衣百结 2 nr
+衣着 323 n
+衣着打扮 3 i
+衣示父 2 n
+衣租食税 3 n
+衣端肃 2 nr
+衣箱 25 n
+衣索匹亚 3 ns
+衣索比亚 3 nr
+衣紫绣 2 nr
+衣紫腰金 3 n
+衣紫腰银 3 n
+衣紫腰黄 3 n
+衣纹 12 n
+衣绣夜游 3 i
+衣绣夜行 3 i
+衣绣昼行 3 vn
+衣绳 2 n
+衣羽流 2 nr
+衣老者 2 n
+衣肩 3 n
+衣胞 3 n
+衣草 5 n
+衣薄裳 2 nr
+衣藻 3 n
+衣蛾 3 n
+衣补儿 3 nr
+衣衫 890 n
+衣衫不整 3 l
+衣衫蓝缕 3 nr
+衣衫褴褛 84 l
+衣袋 132 n
+衣袍 23 n
+衣袖 612 n
+衣被 57 n
+衣被群生 3 nr
+衣装 23 n
+衣裙 92 n
+衣裤 130 n
+衣裳 635 n
+衣裳之会 3 nr
+衣褶 7 n
+衣褶飘 2 nr
+衣襟 685 n
+衣角 100 n
+衣象奴 2 nr
+衣起立 2 nr
+衣轻乘肥 3 i
+衣鉢 3 nt
+衣钩 2 n
+衣钵 67 n
+衣钵传人 3 nr
+衣钵相传 3 i
+衣锦夜游 3 nr
+衣锦夜行 2 i
+衣锦昼游 3 vn
+衣锦昼行 3 vn
+衣锦簇 4 nr
+衣锦荣归 2 nr
+衣锦褧衣 3 nr
+衣锦过乡 3 i
+衣锦还乡 34 i
+衣锦食肉 3 i
+衣长 2 n
+衣长齐 2 nr
+衣阿华 2 nr
+衣阿华州 3 nr
+衣雪 50 n
+衣领 152 n
+衣食 364 n
+衣食不周 4 i
+衣食住行 68 n
+衣食无忧 3 i
+衣食父母 13 n
+衣食税租 3 n
+衣饰 109 n
+衣香鬓影 7 i
+衣鱼 3 n
+衤 18 zg
+补 3259 v
+补丁 128 nz
+补丁包 3 n
+补丁集 3 n
+补上 3 v
+补上去 3 v
+补上来 3 v
+补下 3 v
+补下去 3 v
+补下来 3 v
+补习 104 v
+补习功课 3 n
+补习学校 3 n
+补习教育 3 n
+补习班 36 n
+补习社 3 n
+补交 22 v
+补仓 3 v
+补休 32 v
+补体 39 n
+补体受体 3 n
+补体成分 3 n
+补体旁路 3 n
+补体结合 3 vn
+补体蛋白 3 n
+补修 6 vn
+补假 2 v
+补偏救弊 4 i
+补偿 1340 vn
+补偿器 10 n
+补偿定理 3 n
+补偿性 5 n
+补偿曲线 3 n
+补偿板 3 n
+补偿款 21 n
+补偿法 3 n
+补偿点 3 n
+补偿者 3 n
+补偿贸易 3 nz
+补偿费 40 n
+补偿金 38 n
+补充 3399 v
+补充侦查 3 n
+补充兵 3 n
+补充剂 32 n
+补充协议 3 n
+补充品 18 n
+补充性 6 n
+补充教材 3 n
+补充物 3 n
+补充规定 3 n
+补入 22 v
+补全 3 v
+补养 37 v
+补养品 3 n
+补写 3 v
+补剂 7 n
+补办 38 v
+补加 7 v
+补助 373 v
+补助款 3 v
+补助线 3 n
+补助费 27 v
+补助金 57 n
+补助额 3 v
+补发 28 v
+补台 2 n
+补品 61 n
+补图 3 v
+补天柱地 3 n
+补天浴日 3 nz
+补子模 3 n
+补完 3 v
+补射 30 v
+补差 5 n
+补平 3 n
+补强 10 v
+补录 28 v
+补征 3 v
+补心 17 v
+补报 123 n
+补报名 3 n
+补拙 3 v
+补拟书名 3 n
+补救 299 v
+补救性 5 n
+补救措施 3 n
+补救法 3 n
+补敝起废 3 i
+补数 3 n
+补时 30 n
+补校 2 n
+补档 3 v
+补模数 3 n
+补正 18 v
+补气 51 n
+补气药 8 n
+补气血 3 n
+补水 35 n
+补注 3 v
+补泻 20 v
+补洞 3 n
+补派 3 n
+补济 3 n
+补涨 143 v
+补液 2 n
+补漏 17 v
+补焊 3 vn
+补牌 3 v
+补牙 12 v
+补牢顾犬 3 i
+补白 4 v
+补白图案 3 n
+补益 99 n
+补短 3 v
+补码 3 n
+补票 9 n
+补票价 3 n
+补种 15 n
+补税 24 n
+补空 3 vn
+补空位 3 n
+补笔 3 n
+补纳 3 v
+补给 735 v
+补给品 15 n
+补给村 3 n
+补给港 3 n
+补给点 3 n
+补给站 14 n
+补给线 30 n
+补给舰 22 n
+补给船 34 n
+补给量 20 n
+补绽 3 n
+补缀 58 v
+补编 48 v
+补缴 4 v
+补缺 191 v
+补缺位 3 n
+补考 20 v
+补考分数 3 n
+补考时间 3 n
+补考费 3 n
+补肝肾 3 n
+补肾 109 v
+补肾阳 3 n
+补胎 2 n
+补脑 3 n
+补膏 3 n
+补色 17 n
+补苗 3 n
+补苴罅漏 3 vn
+补药 49 n
+补血 339 v
+补血剂 2 n
+补血药 3 n
+补血针 3 n
+补衣 3 n
+补补 44 v
+补西墙 5 n
+补角 3 n
+补记 6 n
+补语 16 nz
+补课 167 v
+补课班 3 n
+补课费 5 n
+补货 3 n
+补贴 586 n
+补贴款 4 n
+补贴费 2 n
+补贴额 3 n
+补赎 3 i
+补赛 10 vn
+补足 91 v
+补足码 3 n
+补过 50 v
+补过拾遗 3 i
+补过饰非 3 n
+补近 3 v
+补述 3 v
+补选 294 v
+补遗 53 v
+补钉 36 n
+补钙 3 n
+补铁 3 n
+补锅 3 n
+补锅匠 33 n
+补锌 3 n
+补间铺作 3 n
+补阙 3 n
+补阙拾遗 3 nr
+补阙挂漏 3 v
+补阳药 6 n
+补阴药 6 n
+补附 3 v
+补零 3 v
+补靴匠 3 i
+补鞋 3 n
+补鞋匠 3 n
+补页 3 n
+补领 3 v
+补题 3 n
+补骨脂 5 n
+补骨脂灵 3 n
+补骨脂素 3 n
+补齐 3 v
+衦 2 zg
+表 6017 v
+表义 3 n
+表亲 26 n
+表伪 3 v
+表伯 3 n
+表位作图 3 n
+表位定位 3 n
+表位扫描 3 n
+表位文库 3 n
+表位甄别 3 vn
+表位鉴定 3 n
+表作业法 3 n
+表侄 10 n
+表侄女 3 n
+表兄 42 n
+表兄妹 3 n
+表兄弟 49 n
+表册 8 v
+表决 2569 v
+表决制 3 v
+表决器 3 n
+表决权 932 v
+表出 3 v
+表出来 3 v
+表列 3 v
+表列出 3 v
+表功 20 v
+表单 10 n
+表厂 3 n
+表叔 82 n
+表同情 3 n
+表哥 416 n
+表土 35 v
+表土层 8 n
+表坏 3 v
+表型 38 n
+表壳 12 n
+表处理 8 v
+表头 5 v
+表妹 300 n
+表妹夫 3 n
+表姊 3 n
+表姊妹 16 n
+表姐 157 n
+表姐夫 3 n
+表姐妹 6 n
+表姑 6 n
+表姑夫 3 n
+表姨 7 n
+表姨夫 4 n
+表姨父 3 n
+表婶 3 n
+表嫂 14 n
+表字 69 n
+表小檗碱 3 vn
+表尺 48 n
+表层 461 n
+表层下 3 n
+表层结构 3 n
+表工 3 v
+表带 4 n
+表店 3 n
+表弟 137 n
+表形 3 n
+表形码 3 n
+表彰 474 v
+表彰会 25 n
+表彰出来 3 n
+表彰大会 3 n
+表征 214 v
+表态 1043 n
+表情 2049 n
+表情丰富 3 n
+表情图 3 n
+表情图片 3 n
+表情法 3 n
+表情符号 3 n
+表意 35 v
+表意文字 7 n
+表扬 300 v
+表扬信 8 v
+表扬大会 3 n
+表扬稿 2 v
+表报 6 v
+表明 5166 v
+表明态度 3 n
+表显 3 v
+表格 191 n
+表演 3088 v
+表演区 5 n
+表演台 4 n
+表演史 2 n
+表演唱 7 n
+表演团 3 n
+表演场 3 n
+表演奖 5 n
+表演家 5 n
+表演性 11 n
+表演机 3 n
+表演系 9 n
+表演者 48 n
+表演艺术 3 n
+表演艺术家 75 n
+表演赛 63 n
+表演队 67 n
+表率 179 n
+表率作用 3 n
+表现 15867 v
+表现主义 86 n
+表现值 3 n
+表现出色 3 n
+表现力 144 n
+表现型 10 n
+表现对象 3 n
+表现形式 9 n
+表现性 9 n
+表现手法 3 n
+表现欲 10 n
+表现者 10 n
+表白 170 v
+表皮 366 n
+表皮原 3 n
+表皮层 3 n
+表皮素 3 n
+表皮纤维 3 l
+表皮菌素 3 n
+表盖 3 v
+表盘 14 v
+表相 3 v
+表示 19238 v
+表示决心 3 n
+表示函子 3 n
+表示同情 3 n
+表示同意 3 n
+表示命令 3 n
+表示层 8 n
+表示悲痛 3 i
+表示感激 3 l
+表示感谢 3 i
+表示慰问 3 n
+表示歉意 3 vn
+表示法 47 n
+表示满意 3 n
+表示的级 3 n
+表示祝贺 3 n
+表示遗憾 3 n
+表章 3 n
+表笔 3 v
+表舅 8 n
+表舅妈 3 n
+表舅母 3 n
+表蒙子 3 n
+表表 3 v
+表袋 3 n
+表见代理 3 n
+表观 11 n
+表观功率 3 n
+表观粘度 3 n
+表解 3 v
+表记 14 v
+表识 3 v
+表语 16 v
+表象 154 n
+表达 2999 v
+表达克隆 3 nz
+表达出来 3 l
+表达力 3 n
+表达式 144 n
+表达形式 3 l
+表达思想 3 n
+表达意见 3 l
+表达文库 3 nz
+表达方式 3 l
+表达方法 3 n
+表达法 9 n
+表达清晰 3 l
+表达能力 3 n
+表述 566 v
+表里 103 n
+表里一致 3 i
+表里不一 14 l
+表里为奸 3 i
+表里受敌 3 n
+表里如一 13 l
+表里山河 3 n
+表里比兴 3 l
+表里河山 3 n
+表里相依 3 i
+表里相应 3 n
+表里相济 3 n
+表里相符 3 n
+表针 5 n
+表链 3 n
+表错 3 v
+表错情 3 n
+表露 145 v
+表露出 3 v
+表露无遗 3 i
+表面 4833 n
+表面光 9 n
+表面光洁 3 i
+表面化 31 n
+表面反应 3 n
+表面层 27 n
+表面工夫 3 n
+表面工程 3 n
+表面张力 51 n
+表面性 3 n
+表面抗原 3 n
+表面文章 38 n
+表面波 24 n
+表面活性 3 n
+表面浓度 3 n
+表面淬火 3 z
+表面温度 3 n
+表面片落 3 n
+表面现象 3 n
+表面电势 3 n
+表面电导 3 n
+表面电阻 3 n
+表面皿 3 n
+表面积 59 n
+表面膜 3 n
+表面膜势 3 n
+表面色 3 n
+表面质量 3 n
+表面起泡 3 n
+表音 20 n
+表音文字 2 n
+表项 2 n
+衩 62 n
+衫 811 ng
+衫林 3 nz
+衫林溪 3 nz
+衫衣 3 nz
+衫袖 3 nz
+衫裤 20 nz
+衬 367 n
+衬儿 3 n
+衬出 3 v
+衬垫 24 n
+衬塞 3 n
+衬头 3 n
+衬套 7 n
+衬字 7 n
+衬布 2 v
+衬底 41 n
+衬底偏置 3 n
+衬托 161 n
+衬托出 3 v
+衬托底 3 n
+衬托物 3 n
+衬料 3 n
+衬映 15 v
+衬比度 3 n
+衬砌 13 v
+衬纸 3 n
+衬衣 213 n
+衬衫 338 n
+衬衫厂 4 n
+衬衫面料 3 n
+衬裙 5 n
+衬裤 15 n
+衬质势 3 n
+衬起 3 v
+衬边 3 n
+衬里 33 n
+衬领 3 n
+衮 186 g
+衮州 2 nrt
+衮衮 3 nrt
+衮衮诸公 6 i
+衯 14 zg
+衰 828 ag
+衰世 3 v
+衰乱 3 a
+衰亡 292 v
+衰仔 3 n
+衰减 157 v
+衰减器 3 n
+衰减常数 3 n
+衰减常量 3 n
+衰减性 3 n
+衰减模型 3 n
+衰减系数 3 n
+衰变 300 v
+衰变产物 3 n
+衰变常数 3 n
+衰变率 3 n
+衰工期 3 n
+衰弱 230 a
+衰弱无力 3 nz
+衰当益壮 3 v
+衰微 109 a
+衰惫 3 v
+衰敝 3 a
+衰替 3 v
+衰朽 9 a
+衰歇 3 v
+衰灭 3 v
+衰神 3 v
+衰竭 357 v
+衰竭性 2 n
+衰翁 3 n
+衰老 467 a
+衰老期 2 v
+衰草 25 v
+衰萎 3 v
+衰落 804 v
+衰落区 3 n
+衰落期 2 n
+衰蔽 3 a
+衰败 180 v
+衰迈 3 a
+衰退 504 v
+衰退期 11 vn
+衰颓 19 v
+衰颜 3 v
+衰颜老态 3 v
+衰飒 3 a
+衲 74 g
+衲僧 3 n
+衲子 3 n
+衲衣 3 n
+衲袄 3 n
+衷 368 d
+衷心 253 n
+衷心希望 3 vn
+衷心感谢 3 n
+衷心祝愿 3 n
+衷心祝福 3 n
+衷情 18 n
+衷曲 35 n
+衷肠 36 n
+衷落 3 n
+衽 28 zg
+衽革枕戈 3 nr
+衾 107 zg
+衾寒枕冷 3 nr
+衾影无惭 3 nr
+衿 49 g
+袁 2870 nr
+袁世凯 2727 nr
+袁世海 8 nr
+袁中道 2 nr
+袁丽萍 8 nr
+袁亚平 8 nr
+袁仁明 2 nr
+袁伟时 3 nr
+袁伟民 26 nr
+袁侍郎 2 nr
+袁保庆 4 nr
+袁保恒 4 nr
+袁保龄 2 nr
+袁先生 4 nr
+袁公子 19 nr
+袁公直 5 nr
+袁冠南 160 nr
+袁凤兰 3 nr
+袁可嘉 2 nr
+袁同礼 4 nr
+袁名冠 2 nr
+袁启彤 3 nrfg
+袁和平 3 nr
+袁咏仪 3 nrfg
+袁善腊 3 nr
+袁国君 2 nr
+袁国平 3 nr
+袁国林 2 nr
+袁士霄 150 nr
+袁复礼 2 nr
+袁大人 39 nr
+袁大侠 8 nr
+袁大叔 9 nr
+袁大哥 20 nr
+袁大头 140 nr
+袁大帅 20 nr
+袁大洪 15 nr
+袁大督 2 nr
+袁天纲 5 nr
+袁天罡 3 nr
+袁夫人 23 nr
+袁头 3 nr
+袁姊姊 3 nr
+袁姑娘 13 nr
+袁姑爷 25 nr
+袁姗姗 256 nr
+袁娘娘 5 nr
+袁守芳 3 nr
+袁守诚 4 nr
+袁安高卧 3 nr
+袁宏道 265 nr
+袁宗皋 512 nr
+袁宗第 301 nr
+袁宗道 258 nr
+袁宝儿 2 nr
+袁家军 3 nr
+袁家新 3 nr
+袁家骝 4 nr
+袁将军 48 nr
+袁将爷 14 nr
+袁小姐 4 nr
+袁少爷 4 nr
+袁尚兵 2 nr
+袁尚引 3 nr
+袁尽力 3 nr
+袁崇焕 1082 nr
+袁州 19 nr
+袁州区 3 nr
+袁巡抚 3 nr
+袁师叔 9 nr
+袁师弟 8 nr
+袁应泰 28 nr
+袁建军 2 nr
+袁开缺 2 nr
+袁思怡 256 nr
+袁恕己 6 nr
+袁惟仁 3 nr
+袁慰亭 8 nr
+袁承志 2941 nr
+袁护国 6 nr
+袁按察 2 nr
+袁敦垒 3 nr
+袁文忠 2 nr
+袁文才 10 nr
+袁文杰 3 nr
+袁新文 2 nr
+袁方策 8 nr
+袁日初 3 nr
+袁时中 344 nr
+袁时泰 22 nr
+袁晁擒 2 nr
+袁本初 6 nr
+袁术引 2 nr
+袁术征 3 nr
+袁术知 2 nr
+袁术资 3 nr
+袁杨二 12 nr
+袁枚 32 nr
+袁枢 3 n
+袁树人 4 nr
+袁桂茹 2 nr
+袁正林 2 nr
+袁毅平 2 nr
+袁水拍 5 nr
+袁汉举 2 nr
+袁汉民 256 nr
+袁洁莹 3 nr
+袁潜斋 3 nr
+袁煕 3 ns
+袁熙坤 12 nrfg
+袁爱玲 2 nr
+袁牧之 8 nr
+袁珂 3 nrfg
+袁琳横 3 nr
+袁相公 140 nr
+袁督师 88 nr
+袁祖亮 2 nr
+袁祖铭 2 nr
+袁祥仁 3 nr
+袁素芹 6 nr
+袁紫衣 416 nr
+袁红岗 10 nr
+袁纯清 2 nr
+袁绍 306 nr
+袁绍之 8 nr
+袁绍二 4 nr
+袁绍亦 2 nr
+袁绍先生 3 nr
+袁绍兵 5 nr
+袁绍军 2 nr
+袁绍处 3 nr
+袁绍大 4 nr
+袁绍已 2 nr
+袁绍引 2 nr
+袁绍既 2 nr
+袁绍未 2 nr
+袁绍欲 2 nr
+袁绍相 4 nr
+袁绍聚 2 nr
+袁绍自 2 nr
+袁绍若 2 nr
+袁绍表 3 nr
+袁绍袁 2 nr
+袁绍见 4 nr
+袁绍闻 2 nr
+袁继咸 25 nr
+袁继威 2 nr
+袁继成 17 nr
+袁翰青 2 nr
+袁耀发 3 nr
+袁老太 5 nr
+袁花镇 2 nr
+袁荣亲 4 nr
+袁荣贵 3 nr
+袁行霈 260 nr
+袁谭引 2 nr
+袁贵仁 6 nr
+袁贵妃 11 nr
+袁连珍 3 nr
+袁遇昌 2 nr
+袁铁蛋 3 nr
+袁锡藩 130 nr
+袁锦林 5 nr
+袁长海 4 nr
+袁阔成 2 nr
+袁陶萍 5 nr
+袁隆平 44 nr
+袁雪芬 10 nr
+袁风光 4 nr
+袂 53 ng
+袂云汗雨 3 i
+袄 347 g
+袅 69 z
+袅娜 30 z
+袅娜娉婷 3 z
+袅绕 3 v
+袅袅 110 z
+袅袅亭亭 3 i
+袅袅余音 3 i
+袅袅娉娉 3 z
+袅袅娜娜 16 z
+袅袅婷婷 22 z
+袅袅绕绕 3 i
+袆 5 zg
+袈 6 n
+袈裟 315 n
+袊 2 zg
+袋 1046 q
+袋中 111 s
+袋兽 2 n
+袋口 27 s
+袋子 181 n
+袋式 2 n
+袋料 2 n
+袋栈 3 n
+袋泡茶 5 n
+袋熊 4 n
+袋状 3 n
+袋状瓣 3 n
+袋装 38 n
+袋鼠 79 n
+袍 1321 ng
+袍哥 3 n
+袍子 202 n
+袍服 69 n
+袍泽 15 n
+袍泽之谊 3 n
+袍笏登场 3 i
+袍罩儿 3 z
+袍褂 3 n
+袒 80 v
+袒护 102 v
+袒护着 3 l
+袒胸 3 v
+袒胸露乳 3 l
+袒胸露背 2 l
+袒胸露腹 3 l
+袒胸露臂 3 l
+袒臂挥拳 3 l
+袒露 57 v
+袒露出 3 l
+袓 5 zg
+袕 39 zg
+袖 1025 n
+袖口 131 n
+袖头 17 n
+袖套 3 n
+袖子 580 n
+袖孔 3 n
+袖手 101 n
+袖手旁观 128 i
+袖扣 3 n
+袖标 10 n
+袖珍 80 b
+袖珍书 3 n
+袖珍型 6 b
+袖珍式 3 l
+袖珍本 4 l
+袖珍版 3 b
+袖章 19 n
+袖筒 58 n
+袖管 18 n
+袖箭 72 n
+袖里 3 n
+袖里乾坤 3 i
+袖釦 3 n
+袖长 3 n
+袜 159 n
+袜业 4 n
+袜厂 3 n
+袜套 10 n
+袜子 304 n
+袜子拿 3 n
+袜带 3 n
+袜底 16 n
+袜楦 3 n
+袜筒 3 n
+袜跟 3 n
+袝 3 zg
+袞 2 zg
+袢 37 v
+袤 14 g
+袪 2 zg
+袪暑 3 vn
+袪暑气 3 nr
+袪除 3 vn
+袪风 3 vn
+袪风油 3 v
+被 106845 p
+被上诉人 2 n
+被举高 3 n
+被乘数 3 n
+被代理人 33 n
+被俘 766 v
+被保护人 3 n
+被保证人 3 n
+被保险人 44 n
+被值 3 n
+被冤枉者 3 l
+被减数 3 n
+被删 3 v
+被判 3 v
+被判赔 3 n
+被剔除者 3 nz
+被加数 3 n
+被动 930 vn
+被动免疫 9 l
+被动型 4 n
+被动局面 3 n
+被动式 40 n
+被动性 9 n
+被动挨打 3 vn
+被动模式 3 l
+被动语态 3 n
+被劫 3 v
+被劫持 3 n
+被劫走 3 l
+被包 13 n
+被单 72 a
+被占领土 43 n
+被卧 5 v
+被压迫 3 n
+被发文身 3 n
+被发缨冠 3 n
+被叫 431 v
+被吸入 3 n
+被告 554 n
+被告人 219 n
+被告席 25 n
+被告席上 3 l
+被告方 5 n
+被囊动物 3 n
+被囚 81 n
+被困 3 a
+被坚执锐 3 n
+被天席地 3 l
+被头散发 3 n
+被套 23 a
+被子 655 n
+被子植物 164 l
+被宠 3 a
+被宠若惊 3 v
+被害 157 v
+被害人 97 n
+被害案 3 n
+被害率 3 n
+被害者 17 n
+被导工业 3 n
+被山带河 3 n
+被巾 3 n
+被开方数 3 l
+被录取者 3 n
+被录用者 3 n
+被征服者 15 n
+被忽略了 3 l
+被忽视 3 l
+被打乱 3 l
+被打者 6 n
+被扣 3 n
+被执行人 37 n
+被批评者 3 n
+被抛弃了 3 nr
+被担保人 17 n
+被拍者 2 n
+被指名人 3 n
+被捕 1623 v
+被接见者 3 n
+被控 48 vn
+被推荐者 3 n
+被提名者 3 n
+被教育者 10 n
+被服 22 n
+被服厂 15 n
+被杀案 3 n
+被杀者 18 n
+被查获 3 n
+被检者 7 n
+被歼 3 v
+被治者 16 n
+被淹 3 n
+被清除者 3 n
+被灾蒙祸 3 l
+被炸飞 3 l
+被特许者 2 n
+被甲执兵 3 n
+被甲持兵 3 n
+被甲据鞍 3 n
+被甲枕戈 3 v
+被申请人 21 n
+被疑 3 d
+被监管人 3 n
+被盖病毒 3 n
+被盗 153 n
+被盗案 3 n
+被禁 3 d
+被称作 3 n
+被窃 11 v
+被窝 389 n
+被管理者 6 n
+被絮 3 n
+被绑 3 v
+被统治者 589 n
+被统治阶 3 n
+被罩 12 n
+被虐待狂 3 l
+被袋 5 n
+被装 55 n
+被褐怀玉 3 nz
+被褐怀珠 3 nz
+被褥 217 n
+被覆 48 v
+被覆着 3 l
+被覆粘膜 3 n
+被誉为 3 n
+被访者 24 n
+被评 263 v
+被诉人 7 n
+被试者 9 n
+被调查者 157 n
+被贬 3 v
+被车撞 3 n
+被迫 2348 d
+被迫辞职 3 n
+被选为 3 n
+被选举权 607 n
+被选人 3 n
+被遗弃 3 n
+被遗弃者 3 n
+被邀请者 3 nz
+被采访人 2 n
+被采访者 7 n
+被除数 6 n
+被雪困住 3 v
+被雷击 3 l
+被领导者 3 n
+被驼 3 n
+被骗 3 v
+袭 2667 v
+袭人故智 3 n
+袭以成俗 3 n
+袭击 1646 v
+袭击战术 3 n
+袭击者 20 n
+袭占 3 v
+袭取 33 v
+袭夺 3 v
+袭扰 71 v
+袭故蹈常 3 n
+袭来 3 v
+袭爵 3 v
+袭用 32 v
+袭警 3 v
+袭警案 3 v
+袱 315 g
+袲 2 zg
+袴 6 l
+袷 188 x
+袷袢 4 n
+袼 16 x
+袾 4 zg
+裀 7 zg
+裁 1425 n
+裁为 3 v
+裁云剪水 3 nz
+裁兵 3 n
+裁军 256 n
+裁军谈判 3 n
+裁决 704 v
+裁决书 8 n
+裁决令 3 n
+裁决定 3 v
+裁决权 4 n
+裁减 253 v
+裁减人员 3 n
+裁刀 3 n
+裁切 3 v
+裁切机 3 n
+裁判 840 vn
+裁判台 3 n
+裁判员 171 n
+裁判官 17 n
+裁判席 3 n
+裁判权 8 n
+裁判组 4 n
+裁判长 14 n
+裁制 3 v
+裁剪 86 v
+裁剪机 3 nz
+裁叛 3 v
+裁员 510 n
+裁员增效 3 n
+裁处 16 n
+裁夺 15 v
+裁委会 3 n
+裁定 240 v
+裁定书 23 n
+裁尺 3 n
+裁并 11 v
+裁度 3 n
+裁开 3 v
+裁心镂舌 3 v
+裁成 3 v
+裁抑 3 v
+裁撤 70 v
+裁断 152 v
+裁断机 3 n
+裁月镂云 3 z
+裁样板 3 n
+裁汰 27 v
+裁法 3 n
+裁示 3 v
+裁简 3 n
+裁红点翠 3 n
+裁纸 3 n
+裁纸刀 3 n
+裁纸机 3 n
+裁缝 213 n
+裁缝业 3 n
+裁缝师 3 n
+裁缝店 10 n
+裁缝机 3 n
+裁而知 3 n
+裁衣 3 n
+裁衣服 3 n
+裁边 2 n
+裁退 3 v
+裁量 14 n
+裁量权 6 n
+裁长补短 3 n
+裂 1413 v
+裂体生殖 3 n
+裂冠毁冕 3 n
+裂到 3 v
+裂化 65 v
+裂区设计 3 n
+裂变 300 v
+裂变化学 3 n
+裂变物质 3 n
+裂口 42 n
+裂合酶 3 n
+裂土分茅 2 i
+裂孔 6 n
+裂帛 21 n
+裂开 206 v
+裂开来 3 v
+裂成 3 v
+裂果 3 n
+裂殖 13 v
+裂殖菌 3 n
+裂殖酵母 3 n
+裂点 3 n
+裂片 116 n
+裂痕 80 n
+裂眦嚼齿 3 i
+裂石穿云 3 n
+裂纹 308 n
+裂纹舌 3 n
+裂缝 371 n
+裂缝延伸 3 i
+裂缝指数 3 n
+裂裳衣疮 3 n
+裂裳裹足 3 nr
+裂解 43 v
+裂解气 3 n
+裂解炉 3 n
+裂解焦油 3 n
+裂解物 3 n
+裂解量 3 n
+裂谷 195 n
+裂钻 3 n
+裂隙 196 n
+裂隙水 3 i
+裃 13 zg
+装 6904 v
+装上 3 n
+装上去 3 v
+装上幕布 3 n
+装上来 3 v
+装下 3 n
+装不下 3 v
+装为 3 v
+装书 3 n
+装作 365 v
+装佯 3 v
+装修 437 v
+装修业 2 n
+装修图 3 n
+装修工 2 n
+装修网 3 n
+装修论坛 3 n
+装修费 4 n
+装修门面 3 n
+装假 55 n
+装做 97 v
+装傻 60 v
+装傻充愣 5 i
+装入 168 v
+装入例程 3 l
+装具 59 n
+装出 3 v
+装出去 3 v
+装到 3 v
+装卸 299 v
+装卸区 9 n
+装卸工 16 n
+装卸桥 2 n
+装卸油泵 3 n
+装卸站台 3 n
+装卸货物 3 n
+装卸车 4 n
+装卸量 257 n
+装卸队 5 n
+装呆 3 v
+装坛 3 n
+装填 230 v
+装填子弹 3 n
+装备 7520 n
+装备定型 3 n
+装备库 3 n
+装备精良 3 i
+装备维修 3 l
+装备费 8 n
+装备部 46 n
+装备齐全 3 i
+装夹 4 n
+装好 3 v
+装妖作怪 3 i
+装子弹 3 n
+装孙子 23 n
+装完 3 v
+装屄 3 vn
+装岩机 2 n
+装工 3 n
+装帧 53 n
+装幌子 3 v
+装弹 3 n
+装徉 3 v
+装得 3 v
+装怯作勇 3 v
+装懂 3 v
+装成 3 v
+装扮 288 v
+装扮成 3 l
+装料 36 n
+装有 1076 b
+装有阀 3 n
+装机 145 n
+装机容量 254 n
+装机店 3 n
+装机必备 3 n
+装机量 3 n
+装束 318 v
+装架工艺 3 n
+装样 3 n
+装样子 4 n
+装框 3 n
+装模作样 93 l
+装模着样 3 l
+装死 3 v
+装死卖活 3 i
+装殓 51 v
+装油量 3 n
+装满 138 v
+装满水 3 n
+装演 3 n
+装潢 134 n
+装潢门面 8 l
+装点 86 n
+装点一新 3 b
+装点门面 7 n
+装熊 3 n
+装燃料 3 n
+装版 4 v
+装璜 7 n
+装璜公司 3 v
+装瓶 16 n
+装甲 1882 b
+装甲兵 501 n
+装甲团 3 n
+装甲师 318 n
+装甲旅 3 n
+装甲艇 3 n
+装甲车 489 n
+装甲车辆 3 n
+装甲运兵车 19 n
+装甲部队 3 n
+装疯 3 v
+装疯作傻 3 l
+装疯卖傻 11 i
+装病 3 n
+装痛 3 n
+装盒 3 n
+装盘 3 n
+装相 3 n
+装睡 21 v
+装神弄鬼 59 i
+装移机 3 n
+装穷 9 v
+装笑 3 v
+装笑脸 3 i
+装箱 20 n
+装箱单 3 n
+装糊涂 49 i
+装缘植物 3 n
+装罐 3 n
+装置 3534 n
+装置业 3 n
+装置成 3 i
+装者 3 n
+装聋作哑 59 i
+装聋卖傻 3 i
+装腔 3 n
+装腔作势 89 n
+装腔作态 3 n
+装船 31 n
+装船费 3 n
+装药 224 n
+装药量 10 n
+装蒜 22 n
+装袋 3 n
+装装 12 n
+装装样子 5 l
+装裱 54 v
+装角 3 n
+装订 70 v
+装订厂 3 n
+装订成册 3 n
+装订所 3 n
+装订机 3 n
+装设 34 vn
+装货 35 n
+装货单 3 n
+装起 3 v
+装车 44 n
+装载 294 b
+装载机 29 b
+装载量 25 n
+装输 3 vn
+装过 3 v
+装运 80 n
+装运港 3 n
+装运量 2 n
+装进 3 v
+装进去 3 v
+装进来 3 l
+装造 3 v
+装配 372 v
+装配分厂 3 n
+装配厂 14 n
+装配图 3 n
+装配工 10 n
+装配工厂 3 n
+装配式 13 n
+装配成 3 n
+装配线 19 n
+装配起来 3 l
+装配车间 3 n
+装酒 3 n
+装酷 3 n
+装错 3 v
+装门面 8 n
+装阔 3 v
+装饰 1631 n
+装饰一新 9 i
+装饰业 3 n
+装饰五金 3 n
+装饰品 154 n
+装饰城 3 n
+装饰布 10 n
+装饰师 3 n
+装饰性 78 n
+装饰板 12 n
+装饰柜 5 n
+装饰灯 2 n
+装饰物 22 n
+装饰玻璃 3 n
+装饰画 13 n
+装饰盖板 3 n
+装饰网 3 n
+装饰铁件 3 n
+装饰门 3 n
+装饰音 11 n
+装鬼脸 3 i
+裆 96 n
+裆部 5 n
+裇 233 zg
+裈 8 zg
+裉 62 g
+裉前擦后 3 n
+裎 16 zg
+裏 663 zg
+裒 14 g
+裒多益寡 3 v
+裔 313 nr
+裔胄 3 nr
+裕 713 nr
+裕中西里 3 ns
+裕兴 11 nz
+裕华 14 nz
+裕华区 3 ns
+裕固 15 nz
+裕固族 38 nz
+裕固族自治县 3 ns
+裕如 3 ns
+裕安区 3 ns
+裕民 9 nz
+裕民县 2 ns
+裕民足国 3 ns
+裕禄 2 nz
+裕舫道 2 z
+裕隆 3 nz
+裕隆牌 3 nz
+裘 904 nr
+裘世安 2 nr
+裘丽丽 131 nr
+裘千丈 3 nr
+裘千仞 485 nr
+裘千尺 3 nr
+裘卫四 4 nr
+裘大帮 2 nr
+裘媸保 2 nr
+裘帮主 15 nr
+裘弊金尽 3 n
+裘德洛 3 nr
+裘法祖 2 nr
+裘瑟夫 2 nr
+裘皮 39 nr
+裘皮服装 3 n
+裘盛戎 11 nr
+裘老儿 2 nr
+裘老帮 8 nr
+裘谷主 8 nr
+裘锡圭 9 nr
+裘马声色 3 nr
+裘马清狂 3 nr
+裘马轻狂 3 nr
+裘马轻肥 3 nr
+裙 841 n
+裙子 343 n
+裙屐少年 3 ns
+裙屣少年 3 ns
+裙布荆钗 3 n
+裙布钗荆 3 n
+裙带 27 n
+裙带关系 10 l
+裙带菜 9 n
+裙带风 9 n
+裙房 3 n
+裙摆 14 n
+裙板 3 n
+裙桩 3 n
+裙衩 3 n
+裙装 17 n
+裙裤 2 n
+裙裾 20 n
+裙边 3 n
+裙钗 9 n
+裚 2 zg
+裛 11 zg
+補 4 zg
+裝 2 zg
+裟 37 x
+裡 4 zg
+裢 24 x
+裣 17 x
+裣衽 21 v
+裤 502 n
+裤下之辱 3 n
+裤兜 20 n
+裤勾 3 n
+裤头 41 n
+裤子 664 n
+裤子背带 3 n
+裤带 110 n
+裤料 3 n
+裤档 3 n
+裤筒 3 n
+裤管 51 n
+裤线 4 n
+裤缝 3 n
+裤脚 77 n
+裤腰 36 n
+裤腰带 43 n
+裤腿 73 n
+裤衩 33 n
+裤袋 8 n
+裤袜 3 n
+裤装 4 n
+裤裆 73 n
+裤裙 3 n
+裤褂 12 n
+裤角折边 3 n
+裤长 3 n
+裥 28 n
+裨 131 n
+裨使 3 n
+裨助 3 n
+裨将 3 n
+裨益 55 n
+裨能 3 n
+裩 3 zg
+裯 9 zg
+裰 32 g
+裱 83 v
+裱工 3 v
+裱画 5 v
+裱糊 36 v
+裱糊工人 3 v
+裱褙 3 v
+裱贴 3 v
+裳 88 ng
+裴 392 nr
+裴他姐 4 nr
+裴伯耆 7 nr
+裴元绍 5 nr
+裴元邵 2 nr
+裴刘乡 3 nr
+裴勇俊 2 nr
+裴勇道 6 nr
+裴多菲 13 nr
+裴宣喝 2 nr
+裴家庄 12 nr
+裴将军 2 nr
+裴少俊 3 nr
+裴度继 3 nr
+裴度自 2 nr
+裴德云 3 nr
+裴恩才 91 nr
+裴文中 10 nr
+裴斯泰 13 nr
+裴李岗 15 nr
+裴松之 7 nr
+裴欣怡 36 nr
+裴济 9 nr
+裴涩琪 3 nr
+裴满氏 4 nr
+裴秀之 2 nr
+裴耀卿 14 nr
+裴艳玲 4 nr
+裴蒂庄 2 nr
+裴行俭 4 nr
+裴高才 256 nr
+裸 463 ag
+裸体 205 n
+裸体像 3 n
+裸体图 3 l
+裸体女 3 l
+裸体照 3 l
+裸体照片 3 l
+裸体画 3 l
+裸体秀 3 n
+裸体美 3 l
+裸体美女 3 l
+裸体艺术 3 l
+裸出 3 v
+裸奔 6 v
+裸女 3 n
+裸子植物 112 l
+裸岩 13 n
+裸机 7 b
+裸死案 3 n
+裸泳 3 v
+裸浴 3 v
+裸照 3 v
+裸燕麦 3 n
+裸男 3 n
+裸眼 27 v
+裸眼井 3 n
+裸睡 3 v
+裸线 3 b
+裸细胞 3 l
+裸聊 3 v
+裸胸 3 v
+裸花 3 n
+裸袒 3 v
+裸袖揎拳 3 v
+裸袖揎衣 3 vn
+裸装 3 v
+裸裎袒裼 3 nr
+裸视 2 v
+裸质体 3 n
+裸身 3 v
+裸露 436 v
+裸露出 3 l
+裸麦 9 n
+裹 1379 v
+裹上去 3 v
+裹上来 3 v
+裹乱 3 v
+裹伤 3 v
+裹住 3 v
+裹入 3 v
+裹创 3 v
+裹好 3 v
+裹尸 3 n
+裹尸马革 3 n
+裹布 3 v
+裹得 3 v
+裹成 3 v
+裹扎 16 v
+裹挟 37 v
+裹粮坐甲 3 n
+裹紧 3 v
+裹肚 3 v
+裹胁 18 v
+裹脚 6 v
+裹脚布 6 i
+裹腿 18 n
+裹血力战 3 i
+裹起 3 v
+裹起来 3 v
+裹足 14 v
+裹足不前 20 i
+裹进 11 v
+裹错 3 v
+裼 38 g
+裾 57 zg
+裾马襟牛 3 nr
+裿 2 zg
+褀 2 zg
+褂 419 ng
+褂子 131 n
+褃 42 zg
+複 2 zg
+褊 22 ag
+褊急 3 a
+褊浅 3 a
+褊狭 15 a
+褎 6 zg
+褎如充耳 3 v
+褎然举首 3 v
+褎然冠首 3 ns
+褎然居首 3 ns
+褐 451 n
+褐土 3 n
+褐家鼠 5 n
+褐布 3 n
+褐斑 14 n
+褐斑病 5 n
+褐木庐 3 n
+褐炭 3 n
+褐煤 115 n
+褐煤田 3 nz
+褐矮星 3 n
+褐红色 10 n
+褐色 477 n
+褐藻 51 n
+褐藻素 3 n
+褐藻酸钠 2 nz
+褐藻门 3 n
+褐虾 3 n
+褐衣疏食 3 n
+褐衣粗食 3 vn
+褐衣蔬食 3 nz
+褐设 3 n
+褐铁矿 20 n
+褐马鸡 21 n
+褐骷髅 3 n
+褐黄斑 3 n
+褐黑色 11 n
+褐鼠 3 n
+褒 123 v
+褒义 10 n
+褒义词 11 i
+褒叟 3 n
+褒善贬恶 3 i
+褒境 3 n
+褒奖 91 v
+褒庇 3 v
+褒忠 2 v
+褒扬 36 v
+褒损 3 v
+褒斜道 13 n
+褒显 3 v
+褒曼 5 nrt
+褒气 3 n
+褒禅山 2 ns
+褒色朦胧 3 z
+褒节 3 n
+褒衣博带 3 n
+褒衣危冠 3 i
+褒誉 3 n
+褒词 3 n
+褒贬 55 v
+褒贬不一 22 i
+褒贬与夺 3 i
+褒赏 3 v
+褒霭 3 n
+褓 3 i
+褔利 3 vn
+褔建 3 vn
+褔建省 3 nt
+褔特 3 q
+褙 8 g
+褚 375 nr
+褚万春 3 nr
+褚万里 3 nr
+褚元海 84 nr
+褚兄弟 2 nr
+褚劲风 30 nr
+褚圆右 2 nr
+褚墨伦 47 nr
+褚大哥 3 nr
+褚小怀大 3 nr
+褚小杯大 3 z
+褚庄主 9 nr
+褚庆喜 2 nr
+褚应璜 3 nr
+褚慎明 17 nr
+褚振江 2 nr
+褚时健 65 nr
+褚映群 2 nr
+褚晓亮 2 nr
+褚福灵 2 nr
+褚红柏 3 nr
+褚红柳 61 nr
+褚绍唐 2 nr
+褚老者 2 nr
+褚衣仆 3 nr
+褚遂良 45 nr
+褚镖头 2 vn
+褛 4 x
+褝 68 zg
+褟 51 zg
+褠 333 zg
+褡 43 n
+褡包 3 n
+褡扣 3 n
+褡裢 53 n
+褡连 3 n
+褢 344 zg
+褥 127 n
+褥单 6 n
+褥垫 4 n
+褥套 3 n
+褥子 60 n
+褥疮 15 n
+褥草 3 n
+褪 571 v
+褪下 3 v
+褪光 3 v
+褪去 55 v
+褪后趋前 3 vn
+褪尽 14 v
+褪成 3 v
+褪掉 3 v
+褪毛 3 v
+褪脱 3 v
+褪色 88 v
+褪色剂 3 v
+褪黑素 3 v
+褫 35 zg
+褫夺 41 v
+褫夺公权 3 vn
+褭 4 zg
+褰 1077 g
+褳 85 zg
+褴 30 z
+褴褛 48 z
+褴褛不堪 4 i
+褴褛筚路 3 vn
+褶 227 n
+褶叠 3 n
+褶子 15 n
+褶曲 3 n
+褶痕 3 n
+褶皱 509 n
+褶纸 3 n
+褶裙 3 n
+褶裥 8 n
+褶边 2 n
+襀 4 zg
+襁褓 84 n
+襁褓之中 9 i
+襄 3478 ns
+襄办 3 v
+襄助 23 v
+襄垣 29 ns
+襄垣县 45 ns
+襄城 64 ns
+襄城区 768 ns
+襄城县 9 ns
+襄州 789 ns
+襄平 3 ns
+襄樊 416 ns
+襄樊县 3 ns
+襄樊基地 3 ns
+襄樊市 302 ns
+襄樊柴发 3 ns
+襄汾 12 ns
+襄汾县 4 ns
+襄渝线 262 nz
+襄渝铁路 264 nz
+襄王 50 nrt
+襄理 4 ns
+襄礼 3 nz
+襄谦 3 nrt
+襄谦县 3 ns
+襄赞 3 nrt
+襄阳 13196 ns
+襄阳县 11 ns
+襌 3 zg
+襕 60 zg
+襛 8 zg
+襜 14 zg
+襝 16 zg
+襞 10 g
+襟 322 n
+襟兄 3 n
+襟度 3 n
+襟弟 3 n
+襟怀 24 n
+襟怀坦白 6 i
+襟怀坦荡 3 i
+襟怀担白 3 i
+襟怀洒落 3 i
+襟怀磊落 3 i
+襟抱 3 n
+襟江带湖 3 n
+襟章 3 n
+襟翼 54 n
+襟裾马牛 3 v
+襟里 3 n
+襤 3 zg
+襦 31 g
+襨 5 zg
+襬 2 zg
+襲 3 zg
+襻 25 v
+西 18324 f
+西一世 8 nr
+西一晃 5 nr
+西一路 4 nz
+西一闪 2 nr
+西三旗 3 nr
+西三环 8 nr
+西三面 3 nr
+西上 3 s
+西上邦 2 nr
+西下 3 s
+西东 13 ns
+西丰 11 ns
+西丰县 3 ns
+西临 5 ns
+西临亚 4 nr
+西为德 129 nr
+西为汉 2 nr
+西丽湖 2 nr
+西丽玛沃 2 nr
+西之罗 2 nr
+西乌 2 ns
+西乌斯 3 nr
+西乌珠穆沁旗 2 ns
+西乐 2 ns
+西九龙 3 nr
+西乡 57 ns
+西乡县 2 ns
+西乡镇 3 ns
+西乡隆 11 ns
+西二旗 2 nr
+西二环 3 nr
+西五环 3 nr
+西五路 8 ns
+西井 2 ns
+西亚 671 ns
+西亚地区 14 ns
+西亚斯 3 nr
+西亚松 2 nr
+西亚特 3 nr
+西亚语 7 nz
+西亚诺 2 nr
+西亚队 3 nt
+西交民巷 129 nz
+西京 112 ns
+西京丸 3 nr
+西京京 2 ns
+西京医院 23 nt
+西京赋 5 nr
+西京道 2 ns
+西京长 2 nr
+西人 72 nrt
+西什库 12 ns
+西伊州 3 ns
+西伦佩 4 nr
+西伯 15 ns
+西伯利亚 573 ns
+西伯利亚地区 10 ns
+西伯卒 2 nr
+西伯吴 5 nr
+西伯尔 2 nr
+西伯昌 10 nr
+西伯行 2 nr
+西侧 1129 f
+西侯度 5 ns
+西便门 397 ns
+西倾山 3 nr
+西偏 3 n
+西元 4 t
+西元前 3 t
+西充 8 nr
+西充县 2 ns
+西克 3 ns
+西克斯 6 nr
+西六乡 3 ns
+西六宫 4 nr
+西六师 5 nr
+西六环 3 nr
+西兰 90 ns
+西兰岛 4 ns
+西兰花 12 nr
+西关 57 ns
+西兴 16 ns
+西兴镇 2 ns
+西兵勤 2 nr
+西冈 2 ns
+西军之 2 nr
+西军旧 4 nr
+西军正 2 nr
+西军监 2 nr
+西军诸 2 nr
+西冷 6 ns
+西凉 44 nr
+西凉之 6 nr
+西凉乐 3 nr
+西凉侯 3 nr
+西凉兵 14 nr
+西凉军 6 nr
+西凉力 3 nr
+西凉州 6 ns
+西凉府 11 nr
+西凉李 3 nr
+西凉民 2 nr
+西凉神 2 nr
+西凤酒 7 nr
+西凯罗 3 nr
+西出阳关无故人 3 i
+西击勃 2 nr
+西击秦 2 nr
+西切诺 2 nr
+西利 4 ns
+西利万 2 nr
+西利斯 6 ns
+西利西亚 3 ns
+西力士 3 nr
+西加开 3 ns
+西加湖 4 ns
+西化 111 ns
+西化运动 3 nz
+西北 5598 ns
+西北位 3 n
+西北侧 16 f
+西北军 62 nr
+西北军政委员会 14 nt
+西北农林科技大学 16 nt
+西北区 13 ns
+西北地区 285 ns
+西北大学 33 nt
+西北局 23 nt
+西北工业大学 12 nt
+西北师范大学 8 nt
+西北方 101 f
+西北欧 52 ns
+西北民族学院 2 nt
+西北缘 5 f
+西北航空公司 6 nt
+西北角 155 f
+西北边 3 f
+西北郊 36 s
+西北部 1681 f
+西北面 58 f
+西北风 136 nr
+西北麓 12 f
+西区 91 ns
+西医 188 nr
+西升东 2 nr
+西半 3 t
+西半球 40 n
+西半边 3 ns
+西华 357 nz
+西华县 28 ns
+西华子 3 nr
+西华路 3 ns
+西单 200 n
+西单商场 3 n
+西南 5401 ns
+西南乡 2 ns
+西南亚 25 ns
+西南交大 7 j
+西南侧 22 f
+西南军政委员会 10 nt
+西南农业大学 5 nt
+西南区 3 ns
+西南地区 238 ns
+西南大风 3 ns
+西南夷 74 ns
+西南局 9 nt
+西南师范大学 7 nt
+西南政法大学 13 nt
+西南方 63 f
+西南联大 59 ns
+西南航空 16 nt
+西南航空公司 3 nt
+西南角 95 f
+西南财大 4 nt
+西南财经大学 9 nt
+西南路 4 ns
+西南边 3 f
+西南郊 24 ns
+西南部 1341 f
+西南铝 3 nz
+西南非 13 ns
+西南非洲 3 ns
+西南面 42 f
+西南风 46 nr
+西博会 3 nr
+西博尼 2 nr
+西博格 7 nr
+西卡 10 ns
+西印度群 3 n
+西印度联 3 nt
+西厂 3 n
+西历 7 t
+西原 8 ns
+西原龟 4 nr
+西厢 56 nz
+西厢房 3 nz
+西厢记 92 nz
+西去 3 t
+西友 2 n
+西双坦村 3 ns
+西双版纳 248 ns
+西双版纳傣族自治州 18 ns
+西双版纳州 8 ns
+西口 278 s
+西台痛哭 3 i
+西右东 3 ns
+西吉 42 nr
+西吉县 11 ns
+西吉斯 2 nr
+西吉斯蒙德 3 ns
+西向 3 nr
+西向东 706 nr
+西向北 6 nr
+西向南 2 nr
+西吴 2 ns
+西周 1342 t
+西周时 3 n
+西周时代 3 n
+西周时期 3 n
+西和 40 ns
+西和县 3 ns
+西和杰 6 nr
+西哀士 13 nr
+西哈努克 78 nrt
+西哈诺 10 nr
+西哥 2 ns
+西哥特 49 nr
+西商 2 n
+西喀尔 2 nr
+西喀尔巴 5 ns
+西善桥 3 nr
+西喇木伦 2 ns
+西四 91 t
+西四环 3 nr
+西园 28 ns
+西园寺 4 ns
+西园村 3 ns
+西园记 9 nr
+西园路 3 ns
+西园闻 7 nr
+西固区 4 ns
+西国图 2 nr
+西圆东 2 nr
+西土 2 ns
+西地 9 s
+西地兰 3 ns
+西地那非 5 ns
+西坑 4 ns
+西坑村 4 ns
+西坝 12 ns
+西坝河 3 ns
+西坡 107 ns
+西坪 2 ns
+西垂 2 nr
+西垣 6 ns
+西埃斯 6 nr
+西城 671 ns
+西城区 59 ns
+西城秀树 3 nr
+西埔湾 2 ns
+西域 1364 ns
+西基利 4 ns
+西基雄 64 nr
+西堪察 2 nr
+西塔 10 nr
+西塔尔 11 nr
+西塔尔琴 2 nr
+西塘 29 ns
+西塘区 2 ns
+西塞山 258 ns
+西塞山区 256 ns
+西塞山怀古 2 ns
+西塞罗 30 nr
+西境 3 s
+西境南 3 nr
+西墙 3 n
+西壁 4 s
+西夏 1023 ns
+西夏区 3 ns
+西夏国 3 ns
+西夏宫女 3 nr
+西夏文 94 nr
+西夕温 2 nr
+西外大街 3 nr
+西多 10 ns
+西多东 2 ns
+西多夫 19 nr
+西夜城 5 nr
+西大街 28 ns
+西天 262 t
+西太后 15 nr
+西太平洋 3 ns
+西太平洋地区 31 ns
+西央 2 n
+西头 59 s
+西夷 3 ns
+西奇 4 nr
+西奈 40 nr
+西奈半岛 50 ns
+西奈山 9 nr
+西套 3 nz
+西奥 43 nrt
+西奥兰 2 nr
+西奥图 3 nr
+西奥多 15 nrt
+西奥夫 3 nr
+西奥德 16 nr
+西奥斯 6 nr
+西奥萨 2 nr
+西姆拉 24 nr
+西娅节 3 nr
+西子 15 n
+西子捧 3 nr
+西子捧心 3 nr
+西子林 3 nr
+西子湖 13 nr
+西子湖畔 18 ns
+西子湾 3 nr
+西子胜 2 nr
+西孟加拉 9 nrt
+西孟加拉邦 14 ns
+西学 210 n
+西学东渐 7 nr
+西学堂 2 nr
+西宁 286 ns
+西宁南路 3 ns
+西宁市 55 ns
+西安 2576 ns
+西安事变 210 nz
+西安交大 29 nt
+西安交通 3 nt
+西安交通大学 121 nt
+西安区 3 ns
+西安卫星测控中心 3 nt
+西安地区 2 ns
+西安城 23 ns
+西安市 165 ns
+西安市卫生局 2 nt
+西安政治学院 5 nt
+西安机票 3 n
+西安杨森制药有限公司 3 n
+西安理工 3 n
+西安电子科技大学 8 nt
+西安石油 3 nz
+西安站 2 ns
+西安美术学院 4 nt
+西安门 3 ns
+西安飞机工业公司 4 nt
+西安高新技术产业开发区 2 nt
+西宗掌 4 nr
+西宗谷 2 nr
+西宝和尚 11 nr
+西客站 6 n
+西宫 151 ns
+西宽东 11 nr
+西宾 5 ns
+西察合 5 nr
+西寨 12 ns
+西小方 3 nr
+西尔 7 ns
+西尔哈 2 nrt
+西尔威斯 2 ns
+西尔斯 7 nr
+西尔瓦 3 ns
+西尔维亚 3 ns
+西尔维尼 4 nrt
+西尔维斯 8 nrt
+西尔金 3 nr
+西尼奥 3 nr
+西尼尔 2 nr
+西尼笑 2 nr
+西尼罗 2 nr
+西尼耳 16 nr
+西尼萨 3 ns
+西尾东 2 nr
+西居昂 3 nr
+西屋 46 ns
+西屋电气 3 nt
+西山 498 ns
+西山区 11 ns
+西山居 3 ns
+西山日薄 3 nr
+西山日追 3 nr
+西山碧 2 nr
+西山碧云 3 nr
+西山街 3 ns
+西山饿夫 3 n
+西山麓 2 nr
+西屿 3 ns
+西岗 4 ns
+西岗区 5 ns
+西岛 32 ns
+西岭 7 ns
+西岭雪 3 nr
+西岭雪山 3 ns
+西岱岛 2 ns
+西岳 58 nr
+西岳华山 3 ns
+西岸 791 s
+西岸地区 3 ns
+西峡 13 ns
+西峡县 19 ns
+西峰 27 ns
+西峰区 3 ns
+西峰山 3 ns
+西峰市 5 ns
+西崎崇子 3 nr
+西崴子 2 nr
+西崽 3 n
+西川 130 ns
+西川之 2 nr
+西川刘 3 nr
+西川双 7 nr
+西川河 4 ns
+西川行 2 nt
+西川见 2 nr
+西州 19 ns
+西工 2 n
+西工区 3 nt
+西工大 3 nt
+西巴尔 2 nr
+西巴斯 2 ns
+西市 34 ns
+西市区 3 ns
+西布兰 4 ns
+西布朗 10 nr
+西布玛斯 4 ns
+西布罗 3 nr
+西布罗姆维奇 7 nrt
+西布鲁 2 nr
+西席 2 n
+西平 175 ns
+西平县 3 ns
+西平王 11 nr
+西庄村 3 nr
+西庇阿 12 nr
+西府 25 n
+西府里 2 ns
+西康 35 nr
+西康人 3 nr
+西康省 7 ns
+西建楼 2 nr
+西开普省 3 ns
+西开渠 4 nr
+西式 81 n
+西式婚礼 3 n
+西式早餐 3 l
+西引荆 2 nr
+西弗吉尼亚 4 ns
+西弗吉尼亚州 7 ns
+西弗维 4 nr
+西归浦 2 nr
+西往 3 t
+西往东 10 nr
+西征 97 nr
+西征军 12 nr
+西征犬 2 nr
+西征花 3 nr
+西徐亚 21 nr
+西德 258 nr
+西德人 3 nr
+西德尼 3 nr
+西德维尔 3 nrt
+西德维纳河 6 ns
+西德马克 3 nrt
+西恩富戈斯 2 nrt
+西戎 44 nr
+西戎别 3 nr
+西戎州 2 nr
+西成纪 4 nr
+西房 3 n
+西房凉 2 nr
+西拉 31 ns
+西拉塔 2 nr
+西拉斯 3 ns
+西拉普利 3 ns
+西拉木 3 ns
+西拉雅 2 ns
+西拿阶 2 nr
+西指 3 nz
+西捻 3 n
+西摩 28 ns
+西摩尔 2 nr
+西摩特 2 nr
+西撒 34 ns
+西撒哈拉 56 ns
+西支 2 n
+西攻宛 2 nr
+西敏寺 22 nr
+西数 3 n
+西文 15 nz
+西文系 3 nr
+西斯 37 ns
+西斯一世 2 nrt
+西斯凯 4 nr
+西斯匹 9 nr
+西斯塔 3 nr
+西斯廷 12 ns
+西斯科 5 nr
+西斯莱 7 nr
+西斯蒙 20 nr
+西斯贝格 2 nrt
+西方 6517 s
+西方人 270 nr
+西方净国 3 ns
+西方净土 4 nz
+西方化 32 nr
+西方哲学 3 nt
+西方式 20 nr
+西方极乐 3 ns
+西施 160 n
+西施犬 3 nr
+西昆仑 2 ns
+西昆体 10 nr
+西昌 84 ns
+西昌卫星发射中心 7 nt
+西昌市 11 ns
+西明寺 2 nr
+西晋 1538 t
+西晋时 3 nr
+西晋时代 3 nr
+西晋时期 3 nr
+西晒 3 nrt
+西暖阁 143 nr
+西曲 2 ns
+西服 155 n
+西服呢 3 n
+西服套装 3 n
+西服店 3 n
+西服裙 2 nr
+西服革履 6 l
+西望 2 nr
+西朝 2 t
+西朝东 257 nr
+西朝房 129 nr
+西本 2 ns
+西朱封 3 nr
+西村 24 ns
+西条 3 ns
+西来 3 t
+西林 16 ns
+西林区 3 ns
+西林县 4 ns
+西林吉镇 2 ns
+西林寺 2 nr
+西林水 2 nr
+西林瓶 4 nr
+西林觉 2 nr
+西枝江 3 ns
+西柏坡 246 ns
+西柏坡乡 3 ns
+西柏坡村 11 ns
+西柏林 70 nr
+西校区 2 n
+西格 17 n
+西格尔 18 nr
+西格弗里德 2 nrt
+西格玛 2 nr
+西格班 5 nr
+西格蒙德 2 ns
+西格雷 4 nr
+西格马 3 ns
+西梁国 5 ns
+西梁女 3 nr
+西梁湖 2 ns
+西楼 14 ns
+西樵 4 nrt
+西樵山 5 ns
+西欧 1140 ns
+西欧人 26 n
+西欧各国 3 ns
+西欧国家 3 n
+西欧地区 2 ns
+西欧联盟 17 nt
+西歪东倒 3 l
+西段 144 n
+西毒 3 nz
+西气东 3 nr
+西水 2 ns
+西水坡 3 ns
+西水峪 4 nr
+西水股份 5 nz
+西永福 2 nr
+西汉 1631 ns
+西汉姆 3 nr
+西汉文 11 nr
+西汉时 3 ns
+西汉时代 3 nr
+西汉时期 3 nz
+西汉水 7 nr
+西江 438 ns
+西江月 26 nr
+西江流域 3 ns
+西沃 2 nz
+西沃图 32 nr
+西沙 233 ns
+西沙尔麻 3 ns
+西沙群岛 151 ns
+西沙里村 3 ns
+西沟 8 ns
+西沟村 4 ns
+西河 84 ns
+西河口 6 ns
+西河柳 3 nr
+西河水 2 ns
+西河沿 10 nr
+西河郡 14 nr
+西治 2 ns
+西沽武 2 ns
+西法 3 n
+西法兰 7 ns
+西法洋 2 ns
+西泠 8 nz
+西泠印社 15 nt
+西泠桥 3 nr
+西洋 751 ns
+西洋乐器 3 nz
+西洋参 18 nr
+西洋味 3 nz
+西洋式 5 nz
+西洋文学 3 nt
+西洋景 10 n
+西洋梨 3 nr
+西洋棋 3 nr
+西洋楼 8 ns
+西洋画 26 n
+西洋镜 31 nz
+西洛可 2 nr
+西洞庭 2 nr
+西津 9 ns
+西洱河 10 ns
+西洲 7 ns
+西洽会 3 nr
+西流 52 n
+西流贯 4 nr
+西济胜 2 nr
+西浦运河 3 ns
+西海 64 ns
+西海固 2 nr
+西海岸 207 s
+西海郡 8 nr
+西海镇 5 ns
+西海黑 2 ns
+西海龙 2 nr
+西涅克 5 nr
+西涅莱 2 nr
+西深东 2 nr
+西清古 3 ns
+西渡 33 ns
+西港 6 ns
+西游 71 f
+西游网 3 n
+西游记 116 n
+西游记宫 8 n
+西湖 567 ns
+西湖区 5 ns
+西湖国中 3 ns
+西湖国小 3 nr
+西湖畔 2 ns
+西湖路 3 ns
+西湾 2 ns
+西源 9 n
+西溪 20 ns
+西溪南 38 ns
+西溪路 3 ns
+西溯江 2 nr
+西潘王 10 nr
+西澳 39 ns
+西澳大利亚 28 ns
+西濒波 2 nr
+西灵道人 3 nr
+西点 29 n
+西点军校 37 nt
+西点面包 3 n
+西照 2 nr
+西燕 38 nr
+西爪哇 6 nrt
+西片 3 n
+西片商 3 nz
+西牛贺 2 nr
+西特 29 ns
+西特拉 12 nrt
+西特林 3 nr
+西特郡 2 nr
+西狄道 2 nr
+西王 64 nrt
+西王印 3 nr
+西王吴 2 nr
+西王庆 2 nr
+西王母 79 nr
+西王母娘 3 nr
+西王狗 2 nr
+西环路 3 ns
+西珠市 2 ns
+西班牙 2887 ns
+西班牙人 346 nz
+西班牙共产党 23 nt
+西班牙政府 20 nt
+西班牙文 19 nz
+西班牙港 9 ns
+西班牙皇家马德里队 2 nt
+西班牙话 3 n
+西班牙语 202 nz
+西班牙队 5 nt
+西琳 2 nrt
+西瑭区 2 nr
+西瓜 449 ns
+西瓜刀 7 nr
+西瓜子 2 nr
+西瓜汁 3 nr
+西瓜渣 3 nr
+西瓜皮 16 nr
+西瓜籽 6 n
+西瓜霜 7 nr
+西瓦利 7 ns
+西瓦吉 12 nr
+西瓯 23 ns
+西甜瓜 3 nr
+西田 29 ns
+西甲 46 ns
+西电东 2 n
+西画 36 n
+西界 2 n
+西略华 2 nr
+西番 8 ns
+西番莲 13 nr
+西畴 3 nr
+西畴县 3 nr
+西疆 2 ns
+西皮 23 n
+西皮二黄 3 nr
+西盟 12 ns
+西盟佤族自治县 5 ns
+西直门 436 ns
+西直门外 146 ns
+西祁王 2 nr
+西祠 3 ns
+西禅寺 2 nr
+西福克 3 nr
+西秀区 3 nr
+西科尔斯基 9 nrt
+西科斯 2 nr
+西科斯基 10 nrt
+西科迪勒 25 nrt
+西秦 25 t
+西秦亦 2 nr
+西秦会 2 nz
+西秦灭 2 nr
+西突厥 3 nr
+西窗 3 n
+西窗剪烛 3 nr
+西站 197 ns
+西章武 2 nr
+西端 108 f
+西竺 2 ns
+西竺寺 21 nr
+西籍 3 n
+西米亚 5 ns
+西米安 3 ns
+西米尔 5 nr
+西米替丁 3 nz
+西米连 2 ns
+西米露 3 nr
+西索尔 2 nr
+西索科 14 nr
+西红墙 128 nr
+西红柿 188 nr
+西红门 3 nr
+西约克郡 5 ns
+西纳 7 ns
+西纽利 2 nr
+西线 186 s
+西织 2 n
+西经 146 n
+西绣岭 2 nr
+西维因 4 nr
+西维茨基 3 nrt
+西缓东 2 nr
+西缘 22 f
+西罗 6 ns
+西罗园 3 ns
+西罗马帝 3 nrt
+西羌 27 nrt
+西美尔 3 nr
+西美昂 3 ns
+西翥灵 2 nr
+西耶娜 3 nr
+西耶那 3 nr
+西自邕 3 nr
+西至 3 ns
+西至东 6 nr
+西至云 3 nr
+西至沙 2 nr
+西至洪 2 nr
+西至潼 2 nr
+西至直 2 nr
+西舒玛 4 nr
+西航 5 j
+西色雷斯 4 ns
+西艺来 2 nr
+西艺知 8 nr
+西花厅 15 ns
+西芹 2 nr
+西苏丹 8 ns
+西苑 121 ns
+西苑机场 2 ns
+西药 131 n
+西药店 3 nz
+西药房 3 nr
+西莒岛 3 nr
+西莫夫 2 nr
+西莫娃 4 nr
+西莫维奇 35 nrt
+西莫诺 2 nr
+西莫诺夫 2 nrt
+西菜 3 n
+西营 90 ns
+西营镇 2 nr
+西萨哈 2 ns
+西萨彦 2 nr
+西萨摩亚 40 ns
+西落 2 n
+西葫芦 12 n
+西蒙丝 2 nr
+西蒙尼 3 nr
+西蒙斯 11 ns
+西蒙斯顿 2 ns
+西蒙森 5 nr
+西蒙诺 7 nr
+西蒙诺夫 8 ns
+西蒙镇 4 ns
+西藏 2596 ns
+西藏农牧学院 2 nt
+西藏地区 70 ns
+西藏地方 3 ns
+西藏大学 7 nt
+西藏天路 35 ns
+西藏山南地区 2 ns
+西藏文 3 nz
+西藏昌都地区 3 ns
+西藏电话 3 n
+西藏自治 3 ns
+西藏自治区 228 ns
+西藏自治区交通厅 2 nt
+西藏自治区人民政府 2 nt
+西藏自治区旅游局 4 nt
+西藏自治区筹备委员会 5 nt
+西藏药业 10 nz
+西藏路 8 ns
+西藏阿里地区 6 ns
+西藏高原 36 ns
+西螺 3 nr
+西螺大桥 3 ns
+西行 8 j
+西行求 3 n
+西行漫记 8 n
+西行长 7 n
+西街 168 ns
+西街白 3 nr
+西装 296 n
+西装店 3 n
+西装笔挺 3 nr
+西装裤 3 n
+西装革履 46 l
+西裤 11 n
+西西 3 ns
+西西伯利 2 ns
+西西伯利亚 45 ns
+西西里 230 ns
+西西里岛 133 ns
+西角 3 f
+西详初 4 nr
+西语 4 nz
+西语系 35 n
+西诸郡 3 nr
+西谚 3 n
+西谷 11 ns
+西谷米 3 nr
+西谷米冻 3 nr
+西贝尔 2 nr
+西贝柳斯 6 nr
+西贝货 2 nz
+西贡 60 ns
+西赆南琛 3 ns
+西越兴 2 nr
+西越河 2 nr
+西路 458 ns
+西路军 111 nr
+西路南 2 ns
+西路招 2 nr
+西边 1230 s
+西边雨 3 nr
+西辽 60 ns
+西辽史 2 nr
+西辽国 3 ns
+西辽德 30 nr
+西辽河 3 nr
+西辽皇帝 2 nr
+西达 25 ns
+西达斯 2 ns
+西达汝 3 nr
+西迂洞 3 nr
+西连岛 2 ns
+西连淮 2 nr
+西连科 2 nr
+西迤逦 2 nr
+西迪布撒 3 nrt
+西通 4 nz
+西道堂 3 nr
+西道行 6 nt
+西道诸 3 nr
+西邻责言 3 l
+西郊 180 s
+西部 5505 f
+西部开发办 6 nt
+西部数据 3 n
+西部旅游 3 n
+西部片 15 n
+西都 3 ns
+西都宾 2 ns
+西里 27 s
+西里伯 2 ns
+西里伯斯 2 nrt
+西里尔 2 nr
+西里斯 9 ns
+西里村 5 ns
+西里西亚 101 ns
+西金堂 2 nr
+西铁城 2 nr
+西铁木 2 nr
+西长安 6 nr
+西长安街 26 ns
+西门 967 ns
+西门倩 3 nr
+西门口 2 ns
+西门国小 3 nt
+西门圆环 3 nr
+西门子 280 nr
+西门子公司 39 nt
+西门市场 3 ns
+西门庆 3 ns
+西门町 3 ns
+西门观止 3 l
+西门豹 19 nr
+西阳 6 ns
+西阿卜 2 nr
+西阿尔 3 nr
+西阿斯 6 nr
+西陆 3 s
+西陆网 3 n
+西陈组合 2 nr
+西院 7 n
+西除东荡 3 l
+西陲 25 s
+西陵 280 ns
+西陵区 256 ns
+西陵峡 26 ns
+西陵桥 3 ns
+西陵氏 2 nr
+西陵督 2 nr
+西陵长江大桥 34 ns
+西隆 7 ns
+西雅图 78 nr
+西雅图市 2 ns
+西青 3 nr
+西青区 7 ns
+西青道 3 nr
+西非 277 ns
+西非各国 3 ns
+西非国家 3 l
+西非地区 6 ns
+西面 399 f
+西顿 8 ns
+西颦东效 3 l
+西风 221 nr
+西风东渐 3 nr
+西风卷帘 3 l
+西风带 53 n
+西风残照 3 nr
+西风落叶 3 n
+西飞公司 3 nt
+西食东眠 3 nr
+西餐 63 n
+西餐厅 30 n
+西餐店 3 n
+西饼 2 n
+西饼屋 3 nz
+西馆 3 ns
+西首 6 ns
+西首宾 2 nr
+西马 27 ns
+西高东 54 ns
+西高止山 3 nr
+西魏 190 t
+西魏之 2 nr
+西魏亦 2 nr
+西魏军 13 nr
+西魏均 2 nr
+西魏平 2 nr
+西魏恭 13 nr
+西魏改 5 nr
+西魏文 5 nr
+西魏相 2 nr
+西魏行 2 nr
+西鸡儿 4 nr
+西麓 15 f
+西黄寺 8 nr
+西龙 4 ns
+要 156581 v
+要不了 54 v
+要不得 32 v
+要不是 426 c
+要不然 342 c
+要为 3 c
+要么 927 c
+要义 94 n
+要买车 3 n
+要人命 3 n
+要从严 3 l
+要付 3 v
+要以 3 c
+要件 29 n
+要价 52 n
+要价还价 3 l
+要位 3 n
+要作到 3 l
+要你命 3 l
+要你管 3 l
+要使 3 c
+要冲 274 v
+要冲城市 3 n
+要决 3 v
+要击 3 v
+要则 3 c
+要到 3 v
+要办 3 v
+要务 198 n
+要区 3 n
+要同 3 c
+要员 112 n
+要命 430 v
+要图 32 v
+要地防空 3 n
+要塞 323 v
+要塞区 8 n
+要好成歉 3 l
+要好看 3 a
+要子 8 n
+要宠召祸 3 v
+要害 568 v
+要害之地 3 n
+要害部门 3 n
+要带头 3 n
+要式合同 3 l
+要强 83 v
+要挟 150 v
+要数 84 n
+要旨 297 n
+要是 2986 c
+要有光 3 n
+要有尽有 3 i
+要来 3 v
+要案 4 n
+要死 533 v
+要死不活 2 i
+要死要活 19 n
+要民 3 n
+要求 23944 v
+要求归还 3 i
+要求者 27 n
+要求进步 3 n
+要津 21 v
+要点 441 n
+要犯 212 v
+要用 3 v
+要略 26 n
+要盟 3 n
+要端正 3 v
+要素 2627 n
+要紧 978 v
+要约 123 v
+要而言之 3 c
+要而论之 3 c
+要职 144 v
+要胁 3 v
+要能 3 v
+要脸 101 v
+要花费 3 n
+要览 11 v
+要言不烦 5 l
+要言不繁 3 l
+要言之 3 c
+要言妙道 2 i
+要诀 101 n
+要说 1519 c
+要谎 3 v
+要账 3 v
+要质 3 n
+要这要那 3 l
+要道 357 v
+要钱 356 v
+要闻 19 n
+要闻评论 3 n
+要隘 23 n
+要雨得雨 3 i
+要面子 34 n
+要领 233 v
+要风得风 3 l
+要饭 85 v
+覃 37 nr
+覃丽媛 3 nr
+覃力鹏 5 nr
+覃加耀 3 nr
+覃塘区 3 nr
+覃塘毛 2 nr
+覃天丞 3 nr
+覃彩妮 5 nr
+覃方确 2 nr
+覃有土 3 nr
+覃立本 17 nr
+覃道善 3 nr
+覆 1153 v
+覆上 3 v
+覆亡 60 v
+覆亡无日 3 i
+覆住 3 v
+覆军杀将 3 i
+覆去翻来 3 i
+覆叠空间 3 n
+覆命 3 v
+覆土建筑 3 n
+覆在 3 v
+覆地翻天 3 i
+覆宗灭祀 3 n
+覆审 3 v
+覆层 7 n
+覆巢 3 n
+覆巢之下 3 i
+覆巢毁卵 3 i
+覆巢破卵 3 i
+覆成 3 v
+覆手为雨 6 i
+覆文 3 n
+覆校 3 n
+覆核 3 v
+覆水难收 9 i
+覆没 56 v
+覆海移山 3 nz
+覆灭 287 v
+覆灭记 3 n
+覆电 3 v
+覆盂之安 3 v
+覆盆 3 n
+覆盆之冤 3 i
+覆盆子 4 n
+覆盆难照 3 i
+覆盖 2078 v
+覆盖义齿 3 i
+覆盖住 3 i
+覆盖全国 3 n
+覆盖层 3 n
+覆盖度 36 n
+覆盖性 3 n
+覆盖文件 3 n
+覆盖物 10 n
+覆盖率 368 n
+覆盖的阶 3 n
+覆盖网 7 n
+覆盖范围 4 n
+覆盖面 91 n
+覆盖面广 4 i
+覆盖面积 3 n
+覆着 3 v
+覆膜 2 n
+覆膜机 3 n
+覆舟 3 n
+覆舟之戒 3 i
+覆议 3 n
+覆败 3 v
+覆车 3 n
+覆车之戒 3 i
+覆车之轨 3 i
+覆车之鉴 3 i
+覆载 3 v
+覆辙 73 n
+覆雨翻云 3 i
+覈实 3 z
+覊 37 zg
+覤 3 zg
+覩 4 zg
+親 8 zg
+覰 3 zg
+覲 3 zg
+覷 4 zg
+覻 11 zg
+见 58965 v
+见上图 3 v
+见上帝 4 n
+见下文 12 n
+见不容发 3 i
+见不得人 132 l
+见不着 3 v
+见世生苗 3 n
+见世面 29 n
+见义勇为 93 i
+见义勇为者 4 i
+见义当为 3 i
+见义必为 3 i
+见义敢为 3 i
+见之不取 3 l
+见之于 3 v
+见习 111 v
+见习员 2 n
+见习官 3 n
+见习期 10 n
+见习生 23 n
+见了面 3 l
+见事生风 3 l
+见事风生 3 i
+见于 1294 v
+见人行事 3 i
+见仁 3 v
+见仁见志 3 i
+见仁见智 17 i
+见信好 3 l
+见光死 3 i
+见兔放鹰 3 n
+见兔顾犬 3 i
+见几而作 3 l
+见出 3 v
+见分晓 32 l
+见利忘义 42 l
+见利思义 3 l
+见到 7522 v
+见势不妙 22 i
+见危授命 3 l
+见危致命 3 i
+见卵求鸡 3 n
+见可而进 3 i
+见哭兴悲 3 i
+见善必迁 3 i
+见噎废食 3 i
+见墙见羹 3 i
+见外 107 v
+见多不怪 3 i
+见多识广 128 i
+见天 101 m
+见天日 3 i
+见好就收 23 l
+见始知终 3 i
+见字打字 3 l
+见字识码 3 l
+见容 3 v
+见小暗大 3 i
+见幾而作 3 v
+见异思迁 15 i
+见弃 3 v
+见弃于人 3 i
+见弹求鸮 3 v
+见得 539 v
+见得多了 3 l
+见得着 3 v
+见微受命 3 i
+见微知着 3 l
+见微知萌 3 i
+见微知著 7 i
+见德思齐 3 i
+见性 3 n
+见性成佛 3 i
+见怪 106 v
+见怪不怪 64 i
+见怪非怪 3 i
+见惑 3 v
+见惯 42 n
+见惯不惊 2 i
+见惯司空 3 n
+见成效 3 i
+见所不见 3 i
+见所未见 39 i
+见报 51 v
+见报率 3 n
+见招拆招 3 i
+见效 190 v
+见效快 4 l
+见效慢 3 l
+见教 107 v
+见方 428 n
+见时知几 3 i
+见景生情 4 n
+见智见仁 3 i
+见机而作 10 l
+见机而行 3 i
+见机行事 46 n
+见棱见角 4 i
+见死不救 94 i
+见溺不救 3 v
+见状 197 n
+见猎心喜 9 i
+见神见鬼 5 i
+见票即付 3 l
+见票后 3 n
+见称 69 v
+见笑 32 v
+见笑大方 3 i
+见精识精 3 i
+见素抱朴 3 i
+见经识经 3 l
+见缝就钻 4 l
+见缝插针 28 i
+见羹见墙 3 i
+见者有份 3 n
+见色忘友 3 i
+见覆 3 v
+见见 322 v
+见见面 34 i
+见解 838 v
+见解独特 3 n
+见证 677 v
+见证人 167 n
+见证据 3 n
+见证者 7 n
+见识 946 v
+见识一下 3 l
+见诮大方 3 z
+见诸 55 v
+见诸于 3 l
+见诸报端 3 i
+见诸行动 3 l
+见谅 75 v
+见豕负涂 3 i
+见貌辨色 3 i
+见财起意 9 i
+见贤思齐 11 i
+见过世面 3 l
+见过面 3 l
+见量 3 n
+见钱眼开 22 i
+见钱眼红 3 l
+见长 1261 v
+见闻 266 n
+见闻广博 3 i
+见闻录 3 n
+见闻甚广 3 i
+见附页 3 n
+见雀张罗 3 n
+见面 2189 n
+见面会 53 n
+见面礼 68 i
+见鞍思马 3 n
+见风使帆 3 l
+见风使舵 37 i
+见风使船 3 l
+见风是雨 3 l
+见风转篷 3 n
+见风转舵 3 i
+见风驶舵 3 n
+见马克思 14 n
+见高低 4 i
+见鬼 70 v
+观 4368 vg
+观世音 125 n
+观世音大 3 nz
+观世音菩 3 n
+观云 2 n
+观云海 2 nr
+观众 2877 n
+观众们 3 n
+观众厅 3 n
+观众台 3 n
+观众席 44 n
+观众群 10 n
+观光 584 n
+观光业 3 n
+观光事业 3 n
+观光农业 3 n
+观光区 3 n
+观光台 2 n
+观光团 3 n
+观光型 9 n
+观光季 3 nr
+观光客 40 nr
+观光局 3 n
+观光旅游 3 nz
+观光旅行 3 n
+观光旅馆 3 n
+观光科 3 nr
+观光者 6 n
+观光胜地 3 n
+观光车 3 n
+观兵 4 n
+观其行 54 n
+观前街 3 nr
+观力学 6 n
+观化听风 3 n
+观台 3 n
+观叶 2 n
+观吁 2 v
+观后 13 n
+观后感 6 n
+观场矮人 3 n
+观堂 2 n
+观塘区 2 ns
+观天象 3 n
+观宇 7 n
+观察 3309 v
+观察使 56 n
+观察入微 3 i
+观察出来 3 l
+观察力 40 n
+观察员 294 n
+观察哨 9 n
+观察器 2 n
+观察团 36 n
+观察学习 3 n
+观察室 11 n
+观察家 129 n
+观察所 63 n
+观察报 3 n
+观察敏锐 3 n
+观察期 3 n
+观察法 10 n
+观察点 8 n
+观察窗 14 n
+观察站 3 n
+观察者 87 n
+观察镜 37 n
+观察面 3 n
+观寺 3 n
+观展 5 vn
+观展者 3 n
+观山 36 n
+观山玩水 3 nz
+观峰 2 n
+观庙乡 2 nr
+观形察色 3 n
+观影 4 n
+观往知来 3 l
+观德 4 n
+观心 5 n
+观念 4115 n
+观念形态 6 n
+观念性 3 n
+观念更新 3 nz
+观感 38 n
+观战 199 v
+观战者 3 n
+观护人 3 n
+观摩 242 v
+观摩会 2 nr
+观摩式 3 nr
+观摩教学 3 l
+观摩演出 3 l
+观摩版 3 n
+观摩课 3 nr
+观摹 3 v
+观政 9 n
+观无量 3 l
+观日 3 n
+观日亭 2 nr
+观星 33 n
+观星台 3 n
+观景 147 n
+观景台 4 n
+观景窗 3 n
+观月雏乃 3 nr
+观望 397 v
+观望不前 3 l
+观望台 3 n
+观机而作 3 l
+观机而动 3 l
+观果植物 3 l
+观查 3 vn
+观根 2 n
+观棋 7 n
+观止 12 v
+观沧海 3 ns
+观津 3 ns
+观测 1547 vn
+观测仪 9 n
+观测台 14 n
+观测员 3 n
+观测哨 3 n
+观测器 6 n
+观测室 4 n
+观测所 3 n
+观测点 40 n
+观测现场 3 n
+观测站 41 n
+观测线 3 n
+观测网 16 n
+观测者 88 n
+观海 2 ns
+观涛 3 nr
+观潮 18 n
+观潮派 3 n
+观澜 6 n
+观澜湖 2 l
+观火 3 n
+观点 5306 n
+观点相同 3 l
+观点鲜明 3 n
+观照 18 n
+观畔伺隙 3 n
+观眉说眼 3 l
+观看 1923 v
+观看电视 3 l
+观看节目 3 l
+观看表演 3 i
+观瞻 42 n
+观礼 173 n
+观礼台 401 n
+观禅师 2 nr
+观童 6 n
+观者 57 n
+观者云集 3 n
+观者如云 3 l
+观者如堵 7 i
+观者如市 3 l
+观者如织 3 l
+观者成堵 3 i
+观色 3 n
+观观众 3 n
+观览 16 v
+观象 3 n
+观象仪 3 nr
+观象台 38 n
+观貌察色 3 n
+观赏 668 v
+观赏价值 3 l
+观赏园艺 3 n
+观赏性 72 n
+观赏树 11 n
+观赏树木 3 n
+观赏植物 86 l
+观赏用 3 l
+观赏石 3 n
+观赏者 14 n
+观赏节 11 n
+观赏节目 3 n
+观赏鱼 14 n
+观赏鸟 3 n
+观赏鸟类 3 n
+观赏鸽 2 n
+观赛 9 vn
+观过知仁 3 i
+观门 3 n
+观隅反三 3 i
+观音 763 n
+观音像 3 n
+观音土 9 n
+观音坐莲 3 n
+观音堂 12 n
+观音大士 3 n
+观音寺 15 nr
+观音山 10 n
+观音岩 2 n
+观音庙 6 n
+观音柳 3 n
+观音桥 10 n
+观音殿 5 n
+观音洞 12 n
+观音竹 3 n
+观音菩萨 3 n
+观音阁 14 n
+观音院 8 n
+观颜察色 3 i
+观风 3 n
+观风察俗 3 n
+观鱼 2 n
+规 2070 n
+规例 8 n
+规划 5445 n
+规划区 4 n
+规划司 6 n
+规划图 2 n
+规划地图 3 n
+规划委 6 n
+规划局 7 n
+规划师 273 n
+规划法 3 n
+规划系统 3 l
+规划组 5 n
+规划署 30 n
+规划者 12 n
+规划表 2 n
+规划设计 2 n
+规划院 4 n
+规则 3473 n
+规则化 3 n
+规则学习 3 n
+规则性 3 n
+规则旋进 3 n
+规制 3 n
+规劝 69 v
+规劝地 3 z
+规勉 3 v
+规圆矩方 3 z
+规复 3 v
+规天矩地 3 nz
+规定 24568 n
+规定值 9 n
+规定动作 3 n
+规定性 69 n
+规定汇率 3 n
+规定熵 3 n
+规定量 8 n
+规小鼠 3 n
+规律 4888 n
+规律性 226 n
+规整 198 vn
+规旋矩折 3 i
+规条 3 n
+规格 929 n
+规格书 3 n
+规格化 10 n
+规格型号 3 n
+规模 11239 n
+规模化 62 n
+规模型 7 n
+规模宏大 3 l
+规模性 6 n
+规模经营 3 l
+规模较 7 v
+规正 3 n
+规求无度 3 l
+规法 3 n
+规画 3 n
+规矩 1594 n
+规矩准绳 3 nz
+规矩绳墨 3 v
+规矩钩绳 3 v
+规程 282 n
+规章 602 n
+规章制度 281 n
+规约 125 n
+规绳 3 n
+规绳矩墨 3 v
+规范 3602 n
+规范化 637 n
+规范变换 3 l
+规范名 3 n
+规范字 3 n
+规范市场 2 n
+规范序列 3 n
+规范性 140 n
+规范王码 3 n
+规范群 3 n
+规行矩止 3 i
+规行矩步 3 nz
+规规矩矩 92 z
+规言矩步 3 i
+规诫 3 v
+规谏 11 v
+规贤矩圣 3 i
+规费 23 n
+规距 3 n
+规避 198 v
+规重矩叠 3 z
+规重矩迭 3 i
+规重组 3 n
+觅 962 v
+觅保 3 v
+觅取 3 v
+觅句 3 v
+觅宝 3 nr
+觅得 3 v
+觅求 3 v
+觅爱寻花 3 nr
+觅爱追欢 3 nr
+觅衣求食 3 nr
+觅路 3 v
+觅食 272 v
+视 2957 vg
+视下如伤 3 i
+视丹如绿 3 i
+视为 1913 v
+视为一体 3 i
+视为儿戏 3 i
+视为畏途 4 i
+视为知己 3 i
+视为知已 3 i
+视为至宝 3 i
+视之为 3 v
+视乎 3 v
+视乐奇 3 n
+视人如伤 3 i
+视人如子 3 i
+视作 181 v
+视保屏 3 n
+视倾角 3 n
+视像 8 n
+视准仪 3 n
+视力 431 n
+视力色 3 n
+视力表 5 n
+视力计 3 n
+视同 36 n
+视同一律 3 i
+视同儿戏 2 n
+视同拱璧 3 i
+视同秦越 3 i
+视同等闲 3 i
+视同路人 3 n
+视同陌路 3 vn
+视听 132 v
+视听中心 3 i
+视听产品 5 n
+视听享受 3 i
+视听会议 3 n
+视听室 2 n
+视听教育 3 l
+视听网 3 n
+视听资料 3 n
+视听间 3 n
+视听音乐 3 i
+视唱 10 v
+视唱练耳 2 i
+视图 28 n
+视在功率 3 n
+视场 44 n
+视域 4 n
+视如土芥 3 n
+视如寇仇 3 i
+视如己出 3 i
+视如敝屣 3 l
+视如敝履 3 i
+视如敝徙 3 i
+视如珍宝 3 i
+视如粪土 3 n
+视如草芥 3 n
+视如陌路 3 vn
+视学 3 n
+视密度 3 n
+视察 1446 v
+视察员 145 n
+视察工作 3 n
+视屏 3 n
+视崖 3 n
+视差 66 n
+视微知著 3 i
+视敏度 3 n
+视日如年 3 i
+视星等 32 n
+视景 3 n
+视机而定 3 i
+视杆细胞 3 n
+视束 3 v
+视检 3 v
+视死如归 57 i
+视死如生 3 i
+视死如饴 3 i
+视死犹归 3 i
+视死若归 3 i
+视死若生 3 i
+视民如伤 3 i
+视民如子 3 l
+视点 72 n
+视界 59 n
+视界网 3 n
+视盘 15 n
+视盘机 3 n
+视神经 55 n
+视窗 23 n
+视紫红质 16 n
+视紫蓝质 3 n
+视紫质 2 n
+视线 522 n
+视网 5 n
+视网膜 178 n
+视网膜炎 3 n
+视而不见 182 i
+视聆通 3 z
+视若儿戏 3 i
+视若无人 3 i
+视若无睹 23 i
+视若等闲 3 i
+视若草芥 3 l
+视若路人 3 i
+视衰减 3 i
+视见函数 3 n
+视觉 672 n
+视觉享受 3 l
+视觉作业 3 n
+视觉作用 3 n
+视觉功效 3 n
+视觉后象 3 n
+视觉器官 3 n
+视觉噪声 3 l
+视觉性 3 n
+视觉效果 3 n
+视觉暂留 3 vn
+视觉污染 3 n
+视觉皮质 3 n
+视觉神经 3 n
+视觉系 3 n
+视觉编码 3 n
+视觉艺术 3 n
+视觉表象 3 n
+视觉记忆 3 n
+视觉适应 3 n
+视角 425 n
+视讯 18 n
+视财如命 3 i
+视距 125 n
+视轴 3 n
+视远步高 3 i
+视野 624 n
+视错觉 3 i
+视锥 3 n
+视阈 3 n
+视险如夷 3 i
+视险若夷 3 i
+视音频 3 n
+视频 1853 n
+视频产品 3 n
+视频会议 41 n
+视频信号 3 n
+视频分类 3 n
+视频剪辑 3 vn
+视频卡 3 n
+视频压缩 3 l
+视频头 3 n
+视频女 3 n
+视频工具 3 n
+视频录像 3 n
+视频教程 3 n
+视频文件 3 n
+视频新闻 3 n
+视频格式 3 n
+视频模式 3 n
+视频流 3 n
+视频点播 3 n
+视频短片 3 n
+视频秀 3 i
+视频网 3 n
+视频聊 3 i
+视频转录 3 n
+视黄酸 3 n
+视黄醇 3 n
+视黄醛 3 n
+觇 25 g
+览 322 v
+览胜 7 v
+览闻辩见 3 n
+觉 6705 v
+觉世 12 v
+觉世名言 3 n
+觉书 3 v
+觉人觉世 3 nrt
+觉出 3 v
+觉察 395 v
+觉察出 3 n
+觉察到 3 nr
+觉察时间 3 n
+觉岸 3 v
+觉得 15995 v
+觉得很有 3 nr
+觉得很没 3 nr
+觉得惊奇 3 nr
+觉悟 449 v
+觉悟社 8 nt
+觉悟程度 3 n
+觉果 5 n
+觉查 3 v
+觉民 3 v
+觉省 3 v
+觉着 340 v
+觉罗 39 nrt
+觉者 9 n
+觉解 3 v
+觉远 3 v
+觉远大师 3 nt
+觉醒 602 v
+觊 10 v
+觊觎 166 v
+觋 12 g
+觌 22 g
+觎 5 x
+觏 23 vg
+觐 44 v
+觐礼 3 v
+觐见 107 v
+觐谒 3 v
+觑 269 v
+角 3477 n
+角不点地 3 v
+角位移 3 n
+角儿 64 n
+角分布 3 n
+角力 42 n
+角力赛 3 n
+角加速度 16 n
+角动量 110 n
+角化 44 n
+角化作用 3 n
+角化层 3 n
+角叉菜 3 n
+角叉菜胶 3 n
+角向运动 3 n
+角头 7 n
+角套 2 n
+角子 13 n
+角孙 3 n
+角尺 3 n
+角岩 3 n
+角峰 3 n
+角巾东路 3 n
+角巾私第 3 n
+角度 3247 n
+角度看 16 v
+角度观察 3 n
+角弓 9 n
+角弓反张 15 n
+角形 15 n
+角户分门 3 n
+角抵 25 n
+角放大率 3 nz
+角斑病 4 n
+角斗 33 n
+角斗场 19 n
+角斗士 20 n
+角旗 2 n
+角杯 4 n
+角果 20 n
+角柱 5 n
+角柱体 3 n
+角柱石 3 n
+角梁 3 n
+角楼 177 n
+角母蛋白 3 n
+角状 3 n
+角球 169 n
+角甲基 3 n
+角的对边 3 n
+角皮层 3 n
+角砾岩 35 n
+角票 4 n
+角立杰出 3 nz
+角美 3 ns
+角美镇 3 ns
+角背 3 n
+角膜 199 n
+角膜炎 116 n
+角色 1867 n
+角色冲突 3 n
+角色定位 3 n
+角色扮演 3 vn
+角色散 3 n
+角色紧张 3 n
+角色行为 3 n
+角色规范 3 n
+角落 780 n
+角落处 10 n
+角落里 3 n
+角蛋白 3 n
+角蛋白酶 3 n
+角蝇 3 n
+角角落落 15 n
+角质 226 n
+角质化 3 n
+角质层 3 n
+角质蛋白 3 n
+角跟踪 3 n
+角逐 417 v
+角速度 74 n
+角野 3 n
+角钢 6 n
+角钱 3 n
+角铁 6 n
+角锥 3 n
+角锥体 3 n
+角门 78 n
+角闪岩 20 n
+角闪石 47 n
+角隅种植 3 ns
+角雉 32 n
+角雕 5 n
+角频率 3 n
+角马 20 n
+角鲨 3 n
+角鲨烷 3 n
+角黄素 3 n
+角黍 3 n
+觔 15 zg
+觚 44 ng
+觛 2 zg
+觜 14 zg
+觝 2 zg
+觝触 3 vn
+觞 43 v
+觞酒豆肉 3 v
+解 5923 v
+解上州 4 nr
+解下 3 v
+解下红 2 nr
+解不开 3 v
+解严 5 v
+解严令 3 nr
+解义 4 v
+解乏 32 v
+解事 3 v
+解交 3 v
+解人 3 n
+解人难得 3 i
+解仇释 3 nr
+解付 3 v
+解任 8 v
+解体 636 n
+解作 3 v
+解偏 10 v
+解偶联剂 3 nz
+解像 3 v
+解像度 2 n
+解元 20 nz
+解入 3 v
+解兵 2 v
+解兵释甲 3 i
+解其索 2 nr
+解典库 2 nz
+解决 14468 v
+解决不了 3 v
+解决之道 3 v
+解决办法 21 n
+解决困难 3 v
+解决方案 3 n
+解决目前 5 i
+解决矛盾 3 l
+解决问题 28 n
+解冻 118 v
+解冻剂 3 nz
+解凝剂 3 n
+解出 3 v
+解出来 3 v
+解到县里 3 nr
+解剑拜仇 3 nr
+解剖 515 v
+解剖冠 3 n
+解剖刀 2 n
+解剖图 3 n
+解剖学 184 n
+解剖学家 3 n
+解剖室 3 n
+解剖式牙 3 n
+解剖根 3 n
+解剖麻雀 5 n
+解劝 48 v
+解劳 2 v
+解包 3 v
+解千愁 2 i
+解升仙 2 nr
+解午 2 t
+解卫州 4 nr
+解危 6 v
+解压 31 v
+解压包 3 n
+解压卡 3 nz
+解压密码 3 n
+解压缩 2 nz
+解发佯狂 3 v
+解可表 2 nr
+解吸 3 v
+解咒 3 v
+解嘲 46 v
+解囊 13 n
+解囊相助 9 i
+解困 132 v
+解困办 2 v
+解困扶贫 2 i
+解困金 3 n
+解围 286 v
+解固基 3 nr
+解夏节 2 nr
+解套 11 nz
+解奥尔 3 nr
+解委会 4 nt
+解娟 4 nrfg
+解字 3 nz
+解存 2 v
+解孟获 2 nr
+解官 9 v
+解宝 138 nz
+解宝便 6 nr
+解宝守 4 nr
+解宝引 2 nr
+解宝谢 2 nr
+解宝领 2 nr
+解密 157 nr
+解密器 3 nr
+解密版 3 n
+解封 4 v
+解小东 3 nr
+解小雀 2 nr
+解巨鹿 2 nr
+解差 3 v
+解帮主 6 nr
+解库 3 nz
+解度 4 n
+解开 1023 v
+解弦更张 3 i
+解往 3 v
+解得开 2 v
+解忧 56 v
+解性 3 n
+解怨 3 v
+解恨 30 v
+解悟 4 v
+解情花 3 i
+解惑 85 v
+解惑答疑 3 i
+解愁 15 v
+解愚怀 2 nr
+解成仙 3 nr
+解手 52 v
+解扣 3 v
+解扣儿 3 nr
+解技 2 nz
+解押 3 v
+解振华 12 nr
+解放 4855 v
+解放事业 3 nz
+解放以前 3 i
+解放以后 3 i
+解放以来 3 l
+解放党 8 nt
+解放公园 257 n
+解放军 3298 nt
+解放军信息工程大学 2 nt
+解放军出版社 4 nt
+解放军四总部 6 nt
+解放军总医院 13 nt
+解放军总参谋部 9 nt
+解放军总后勤部 14 nt
+解放军总政治部 37 nt
+解放军总装备部 8 nt
+解放军报 119 nt
+解放军报社 2 nt
+解放军文艺 4 nt
+解放军理工大学 13 nt
+解放军艺术学院 7 nt
+解放军部队 20 nt
+解放军队 3 nt
+解放出来 3 i
+解放初 14 t
+解放初期 3 t
+解放前 168 t
+解放北路 2 nz
+解放区 1430 nt
+解放南路 5 nz
+解放后 472 t
+解放思想 356 i
+解放战争 966 nz
+解放报 42 nz
+解放日报 50 nz
+解放日报报业集团 4 nt
+解放村 2 nz
+解放桥街 3 ns
+解放牌 17 nz
+解放碑 6 nz
+解放组织 3 nt
+解放网 3 nz
+解放者 40 n
+解放街 4 n
+解放路 530 nz
+解放运动 3 nz
+解放阵线 3 nz
+解放鞋 23 nz
+解救 395 v
+解救出来 3 l
+解救法 3 nz
+解散 642 v
+解散国会 3 nz
+解数 55 n
+解文豹 5 nr
+解方程 3 nr
+解旋酶 3 n
+解明 7 v
+解晓东 3 nr
+解暑 8 v
+解暑清 2 nr
+解暑益 2 nr
+解构 22 n
+解构主义 3 n
+解析 491 vn
+解析几何 58 l
+解析同态 3 n
+解析器 3 n
+解析度 7 n
+解析性 3 n
+解析数论 34 n
+解析映射 3 n
+解析电离 3 n
+解析群 3 n
+解梦 2 nz
+解模 2 n
+解款 3 v
+解毒 414 v
+解毒丸 3 nz
+解毒剂 24 nz
+解毒机 2 n
+解毒片 3 nz
+解毒药 3 nz
+解民倒悬 15 i
+解气 45 v
+解池 6 nr
+解治 2 v
+解治情 2 n
+解法 189 v
+解涷 3 vn
+解深密 10 nr
+解渴 70 v
+解热 72 v
+解热剂 3 nz
+解珍解 4 nr
+解理 9 v
+解理极 2 n
+解理面 2 n
+解甲 20 nr
+解甲休兵 3 nr
+解甲休士 3 nr
+解甲倒戈 3 i
+解甲弃械 3 n
+解甲归 2 nr
+解甲归田 19 nr
+解甲投戈 3 nz
+解甲还乡 3 i
+解甲释 2 nr
+解疑 3 v
+解疑释惑 3 l
+解疑释结 3 l
+解痛 3 v
+解痛剂 3 nz
+解痛药 3 i
+解百 28 nz
+解盈盈 2 nr
+解盐 3 nz
+解盐发 2 nr
+解盐司 2 n
+解盐钞 2 nr
+解盟 16 v
+解码 62 n
+解码器 18 n
+解码板 3 n
+解码率 3 n
+解码程序 2 n
+解码精英 3 nz
+解磷 6 nz
+解禁 94 v
+解禁令 3 nr
+解离 9 v
+解离能 3 nz
+解离酶 3 nz
+解秘 10 v
+解税粮 2 n
+解穴之 6 nr
+解究 3 vn
+解空 2 v
+解立 6 v
+解童 2 n
+解答 787 v
+解索 3 v
+解约 50 v
+解纷 3 n
+解纷排难 3 i
+解组 3 vn
+解结 4 v
+解缆 3 n
+解缰牵 2 nr
+解罪 3 v
+解署 3 v
+解职 79 v
+解聘 64 v
+解聚 2 v
+解聚酶 3 nz
+解脱 541 v
+解脱法 3 nr
+解舒丝 4 nr
+解药 25 v
+解药取 3 nr
+解药必 2 nr
+解药灌 2 nr
+解药藏 2 nr
+解落 3 v
+解蔽 3 v
+解衣 10 v
+解衣伏 2 nr
+解衣包火 3 i
+解衣卸甲 3 nr
+解衣宽带 3 nr
+解衣抱火 3 i
+解衣推食 3 i
+解衣槃磅 3 nr
+解衣盘磅 3 n
+解衣盘礴 3 i
+解衣磅礴 3 i
+解衣般礴 3 i
+解衣衣人 3 n
+解衣钮 2 nr
+解衣露 3 nr
+解表 50 v
+解表法 2 nz
+解表药 10 nz
+解装 3 v
+解装配 3 l
+解襄相助 3 nr
+解解 4 v
+解解渴 3 i
+解解闷 12 n
+解解馋 3 v
+解译 14 v
+解语 4 nz
+解说 329 v
+解说员 22 n
+解说法 3 v
+解说词 7 i
+解读 607 v
+解调 23 v
+解调器 2 nr
+解谜 3 v
+解象力 2 nr
+解赴军 2 nr
+解趣 3 n
+解运 3 v
+解运之 3 nr
+解运京 2 nz
+解述 3 v
+解送 31 v
+解送犯人 3 n
+解邺郡 2 nr
+解酒 2 v
+解酒茶 3 nr
+解释 7421 v
+解释一下 3 i
+解释器 13 n
+解释学 23 n
+解释性 21 n
+解释权 23 nr
+解释法 3 n
+解释程序 3 n
+解钱谷 3 nr
+解铃 8 nz
+解铃系铃 3 n
+解铃还是系铃人 3 l
+解铃还需系铃人 8 l
+解铃还须 3 i
+解铃还须系铃人 3 i
+解铨厚 2 nr
+解链 3 n
+解锁 2 v
+解锦州 5 nr
+解闷 119 v
+解闷法 3 v
+解阳山 3 nr
+解除 1126 v
+解除合同 3 i
+解除婚约 3 n
+解除戒严 3 i
+解除权 3 nz
+解除武装 3 l
+解除疑虑 3 i
+解除管制 3 nz
+解除警报 3 n
+解除负担 3 n
+解除限制 3 n
+解难 43 v
+解雇 133 v
+解韩胤 2 nr
+解颐 5 nrfg
+解题 376 n
+解题技巧 3 n
+解风 3 v
+解风笑 2 nr
+解饱 3 v
+解饿 3 v
+解馋 17 v
+解骖推食 3 v
+解黏去缚 3 i
+解黑水 2 nr
+觥 165 zg
+觥筹 3 i
+觥筹交错 22 i
+触 945 v
+触击 3 v
+触到 3 v
+触力 3 n
+触动 351 v
+触压 3 v
+触压式 3 n
+触及 408 v
+触发 230 v
+触发器 27 n
+触发式 3 n
+触变性 2 l
+触嘴 3 v
+触地号天 3 i
+触处机来 3 l
+触头 18 v
+触媒 12 n
+触家触须 3 i
+触底 3 n
+触怒 214 v
+触感 3 n
+触手 175 v
+触手可及 15 i
+触手生春 3 i
+触探 2 v
+触控式 3 n
+触控板 3 n
+触控笔 3 n
+触摸 149 v
+触摸屏 13 nz
+触摸式 2 nz
+触摸板 2 nz
+触斗蛮争 3 n
+触景 3 n
+触景伤心 3 i
+触景伤怀 3 i
+触景伤情 3 n
+触景生情 33 n
+触机便发 3 i
+触杀 3 v
+触板 3 n
+触棒迷津 3 i
+触毛 3 n
+触法 3 n
+触点 24 n
+触物伤情 3 n
+触物伤神 3 n
+触物兴怀 3 i
+触犯 265 v
+触犯刑律 3 i
+触犯法规 3 i
+触电 110 v
+触电时 3 n
+触电而死 3 i
+触痛 20 n
+触目 27 n
+触目伤心 3 i
+触目伤怀 3 i
+触目儆心 3 i
+触目兴叹 3 i
+触目如故 3 i
+触目崩心 3 i
+触目恸心 3 z
+触目惊心 189 i
+触目成诵 3 i
+触目皆是 3 i
+触目经心 3 i
+触目警心 3 l
+触石决木 3 n
+触礁 20 n
+触类旁通 29 i
+触类而通 3 i
+触类而长 3 i
+触网 3 n
+触网率 3 n
+触觉 114 n
+触觉器 3 n
+触觉式 3 l
+触觉显示 3 n
+触觉神经 3 l
+触觉计 3 l
+触角 282 n
+触诊 23 v
+触雷 8 v
+触霉 3 v
+触霉头 6 n
+触须 39 v
+觬 2 zg
+觯 99 g
+觱篥 9 n
+觳 81 x
+觳觫 5 v
+觺 64 zg
+言 9691 vg
+言一动 8 i
+言一语 12 i
+言三藏 2 nr
+言三语 3 nr
+言三语四 3 i
+言下之意 88 i
+言不二价 3 i
+言不及义 11 i
+言不及私 3 i
+言不及行 3 i
+言不尽意 7 i
+言不由中 3 i
+言不由衷 41 i
+言不诡随 3 i
+言不践行 3 n
+言不达意 3 l
+言不逮意 3 vn
+言不顺 12 i
+言不顾行 3 i
+言与心违 3 i
+言与朋 3 nr
+言且表过 3 l
+言东语西 3 nr
+言中 87 nr
+言中事隐 3 i
+言为心声 6 i
+言为然 2 i
+言义 3 n
+言之不尽 3 i
+言之不渝 3 i
+言之不预 3 v
+言之凿凿 40 i
+言之史 2 nr
+言之士 3 nr
+言之恩 3 nr
+言之成理 38 i
+言之无文 3 i
+言之无物 3 i
+言之有序 3 l
+言之有据 3 i
+言之有故 3 i
+言之有物 19 l
+言之有理 29 i
+言之有礼 3 i
+言之有误 3 i
+言之语 2 i
+言之谆谆 3 i
+言之过早 3 l
+言之过甚 3 i
+言事御 2 nr
+言事若神 3 i
+言亮先 2 nr
+言人人殊 3 i
+言从计听 3 i
+言从计纳 3 nr
+言从计行 3 i
+言传 52 nr
+言传身教 34 n
+言伯乾 113 nr
+言体 4 n
+言信行果 3 n
+言全未 2 nr
+言兴圣 2 nr
+言出必行 5 i
+言出患入 3 i
+言出法随 6 i
+言出祸从 3 i
+言出祸随 3 i
+言刘备 2 nr
+言十妄九 3 l
+言及 28 v
+言发祸随 3 i
+言古体 3 n
+言可喻 3 i
+言可荆 2 nr
+言听事行 3 i
+言听行从 3 i
+言听计从 80 i
+言听计用 3 i
+言听计行 3 i
+言听谋决 3 i
+言启奏 3 nr
+言周瑜 5 nr
+言和意顺 3 i
+言唐僧 2 nr
+言善语 3 nr
+言善辨 2 nr
+言善道 3 nr
+言喻 23 nr
+言圣谕 5 nr
+言声 2 n
+言声儿 5 nr
+言外之味 3 i
+言外之意 36 i
+言多伤倖 3 nz
+言多伤幸 3 i
+言多伤行 3 i
+言多失实 3 i
+言多必失 24 i
+言多语失 4 i
+言大妙 2 nr
+言天人 2 nr
+言孔明 5 nr
+言字旁 3 nr
+言孟德 2 nr
+言孟达 2 nr
+言官 86 n
+言官中 3 nr
+言官参 2 nr
+言实 4 n
+言家拳 4 nr
+言密语 2 nr
+言导帝 3 n
+言少叙 2 nr
+言少述 3 nr
+言尽于此 3 i
+言尽意 2 i
+言差语错 3 i
+言巷语 2 i
+言师伯 10 nr
+言师叔 6 nr
+言幾析理 3 nz
+言开战 2 nr
+言强君 4 nr
+言归于好 17 i
+言归和好 3 i
+言归正传 25 i
+言律 11 n
+言律绝 5 nr
+言微旨远 3 nr
+言心 2 n
+言心哲 4 nr
+言必信 12 nr
+言必善 2 nr
+言必有中 6 l
+言必有据 3 l
+言必有物 3 l
+言志 23 n
+言念 47 n
+言情 32 n
+言情剧 3 n
+言情小说 28 l
+言情片 3 n
+言慈禧 2 nr
+言慧珠 4 nr
+言扬行举 3 i
+言承旭 3 nr
+言抚谕 3 nr
+言提其耳 3 i
+言教 16 n
+言文一致 3 i
+言文行远 3 nr
+言方 14 n
+言方行圆 3 nr
+言无不尽 12 i
+言无不详 3 i
+言无二价 3 i
+言无伦次 3 i
+言无忌 3 i
+言明 53 nr
+言明在先 3 i
+言明直 2 nr
+言是人非 3 i
+言未发 3 i
+言来语 8 i
+言来语去 3 i
+言极 46 n
+言歌行 12 nr
+言正合 3 nr
+言气卑弱 3 i
+言求洪 2 nr
+言治道 2 n
+言浅意深 3 i
+言浪语 2 i
+言清行浊 3 nr
+言片语 2 nz
+言状 8 n
+言犹在耳 15 i
+言犹未尽 4 i
+言狂意妄 3 n
+言玄德 3 nr
+言白语 2 nr
+言益语 16 nr
+言直谏 2 nr
+言相告 2 nr
+言相契 2 nr
+言相慰 4 nr
+言相求 2 i
+言神宗 3 nr
+言祥瑞 3 nr
+言禄山 2 nr
+言积庆 2 nr
+言立决 2 i
+言笑不苟 3 i
+言笑之间 3 i
+言笑晏晏 13 nr
+言笑自如 3 i
+言笑自若 3 i
+言笑间 3 i
+言简义丰 3 nr
+言简意 5 i
+言简意少 3 i
+言简意明 3 i
+言简意深 3 i
+言简意该 3 nr
+言简意赅 75 i
+言类悬河 3 i
+言精苦思 3 i
+言精钩深 3 n
+言约旨远 3 nr
+言纵衡 3 nr
+言绿营 2 nr
+言老爷 2 nr
+言者 3 n
+言者不知 3 i
+言者复 2 nr
+言者弗知 3 i
+言者无罪 6 i
+言者谆谆 3 i
+言而不信 3 i
+言而威 4 i
+言而敏 3 nr
+言而无信 41 i
+言而明 2 i
+言而有信 47 i
+言联想 3 n
+言致祥 16 nr
+言花语 2 i
+言芳行洁 3 nr
+言苏秦 2 nr
+言若何 5 nr
+言若悬河 3 i
+言菊朋 12 nr
+言蜀兵 4 nr
+言行 430 n
+言行一致 22 i
+言行不一 17 i
+言行不符 3 l
+言行不贰 3 nr
+言行举止 3 i
+言行信果 3 n
+言行合一 3 l
+言行如一 3 i
+言行录 2 n
+言行抱一 3 i
+言行相副 3 i
+言行相悖 3 i
+言行相符 3 nr
+言行相诡 3 i
+言行相顾 3 i
+言行若一 3 i
+言行计从 3 i
+言表 12 n
+言触 2 v
+言言殊 2 i
+言论 690 n
+言论者 3 n
+言论自由 3 l
+言论集 3 n
+言论风生 3 i
+言词 126 n
+言词辩论 3 n
+言诗者 2 nr
+言语 2335 nr
+言语不通 3 i
+言语学习 3 n
+言语无味 3 i
+言语特征 3 nr
+言语生成 3 i
+言语知觉 3 i
+言语路绝 3 i
+言语道断 3 i
+言说 136 n
+言谈 177 v
+言谈举止 65 i
+言谈之间 3 i
+言谈林薮 3 n
+言谈话语 3 i
+言谈间 3 n
+言财利 2 nr
+言责 3 v
+言责自负 3 l
+言败 12 v
+言贾政 2 nr
+言路 28 n
+言辞 244 nr
+言辞偏激 3 l
+言辞恳切 3 z
+言辟谷 2 nr
+言达平 102 nr
+言过其实 38 i
+言近意远 3 i
+言近指远 3 i
+言近旨远 3 nr
+言邓艾 3 nr
+言重 43 n
+言重九鼎 3 nr
+言难荆 8 nr
+言非虚 9 nr
+言颂诗 2 nr
+言颠语倒 3 i
+言骨柳筋 3 nr
+言高语低 3 i
+訄 3 zg
+訇 9 x
+訉 2 zg
+訑 4 zg
+記 6 zg
+訢 24 zg
+訫 2 zg
+訬 11 zg
+許 24 zg
+訳 8 zg
+訴 2 zg
+訷 64 zg
+訾 14 nr
+訾议 3 nr
+詀言詀语 3 nz
+詁 12 zg
+詅 3 zg
+詆 14 zg
+詈 147 g
+詈夷为跖 3 nr
+詋 79 zg
+詎 9 zg
+詝 8 zg
+詨诈 3 vn
+詩 2 zg
+詮 11 zg
+詹 548 nr
+詹世亮 5 nr
+詹事府 47 nr
+詹他叔 2 nr
+詹仰庇 4 nr
+詹传教 5 nr
+詹光笑 2 nr
+詹和主 2 nr
+詹善仆 2 nr
+詹在延 3 nr
+詹大同 8 nr
+詹大悲 3 nr
+詹天佑 33 nrfg
+詹妮佛 3 nr
+詹妮弗 3 nr
+詹姆士 26 nr
+詹姆斯 598 nr
+詹姆斯敦 7 nr
+詹姆斯河 2 nr
+詹姆斯湾 5 nr
+詹姆森 3 nr
+詹姆逊 2 nr
+詹家 5 nrfg
+詹小楠 3 nr
+詹小耳 7 nr
+詹巴斯 2 nr
+詹度派 2 nr
+詹建俊 8 nr
+詹志宏 5 nr
+詹懋海 4 nr
+詹文华 2 nr
+詹明信 2 nr
+詹春心 2 nr
+詹春柔 2 nr
+詹来延 3 nr
+詹森 19 nr
+詹森派 4 nr
+詹石梯 22 nr
+詹科道 2 nr
+詹言曲说 3 nr
+詹詹炎炎 3 nr
+詹金斯 5 nr
+詹金泉 3 nr
+詹首先 2 nr
+誉 1858 v
+誉不绝口 3 l
+誉为 1557 v
+誉满 3 v
+誉满全国 3 l
+誉满全球 4 l
+誉满天下 3 l
+誉满寰中 3 vn
+誉称 6 v
+誉过其实 3 l
+誊 58 zg
+誊书 3 v
+誊写 157 v
+誊写板 3 n
+誊写版 3 v
+誊写簿 3 n
+誊写钢版 3 n
+誊出 3 v
+誊出来 3 v
+誊印 3 v
+誊印社 3 n
+誊录 7 v
+誊抄 3 v
+誊本 3 n
+誊清 7 v
+誊稿 3 v
+誊给 3 v
+誓 1040 vg
+誓不两立 10 i
+誓不回头 3 i
+誓不甘休 3 i
+誓不罢休 3 i
+誓以皦日 3 n
+誓同生死 16 i
+誓图 2 n
+誓天指日 3 i
+誓天断发 3 i
+誓夺 3 v
+誓山盟海 3 n
+誓师 99 n
+誓师大会 13 n
+誓愿 38 n
+誓无二心 3 i
+誓无二志 3 i
+誓日指天 3 i
+誓死 376 v
+誓死不二 3 i
+誓死不屈 3 i
+誓死不渝 3 i
+誓死不降 3 i
+誓死保卫 3 n
+誓死捍卫 3 vn
+誓海盟山 3 n
+誓由 3 n
+誓约 32 d
+誓言 271 n
+誓词 35 n
+誓辞 3 n
+誜 7 zg
+說 3 zg
+誯 14 zg
+誰 69 zg
+誹 3 zg
+諂 20 zg
+諅 12 zg
+請 5 zg
+諎 24 zg
+諛 8 zg
+諠客夺主 3 nr
+諡号 3 vn
+諲 1607 zg
+諷 45 zg
+謃 3 zg
+謆 15 zg
+謇 168 g
+謒 2 zg
+講 30 zg
+謡 4 zg
+謤 10 zg
+謦 2 x
+謩 2 zg
+謷牙诘屈 3 vn
+證 8 zg
+譎 7 zg
+譔 2 zg
+譕 23 zg
+識 4 zg
+譙 95 zg
+譚 8 zg
+譞 24 zg
+譟 3 zg
+譥 164 zg
+警 723 n
+警世 40 n
+警世名言 3 n
+警世钟 5 n
+警亭 3 n
+警具 3 n
+警力 64 n
+警务 31 n
+警务人员 3 n
+警务区 3 n
+警务处 3 n
+警务室 3 n
+警务局长 3 n
+警务部长 3 n
+警匪 3 n
+警匪片 3 n
+警区 2 n
+警卫 530 n
+警卫人员 3 n
+警卫军 3 n
+警卫员 119 n
+警卫团 18 n
+警卫处 2 n
+警卫室 3 n
+警卫局 7 n
+警卫连 40 n
+警卫部队 3 n
+警卫队 184 n
+警句 45 n
+警号 9 n
+警司 7 n
+警名派 3 n
+警告 1153 n
+警告声 2 n
+警告性 3 n
+警告牌 3 n
+警告者 3 n
+警员 14 n
+警哨 3 n
+警士 3 n
+警声 3 n
+警备 205 n
+警备区 60 n
+警备司令 3 n
+警备总司 3 n
+警备总部 3 n
+警备车 3 n
+警备队 46 n
+警嫂 3 n
+警官 636 n
+警官学校 3 n
+警官证 3 v
+警容 6 n
+警察 1677 v
+警察厅 15 n
+警察史 3 n
+警察学校 3 n
+警察局 93 n
+警察局长 3 n
+警察广播 3 nz
+警察所 3 n
+警察故事 3 n
+警察机关 3 n
+警察法 2 n
+警察署 5 n
+警察部队 3 n
+警察队 3 n
+警局 2 n
+警岗 3 n
+警广 3 v
+警徽 3 n
+警心涤滤 3 n
+警总 3 n
+警悟 5 v
+警惕 898 v
+警惕作用 3 n
+警惕到 3 n
+警惕心 4 n
+警惕性 43 n
+警愦觉聋 3 nr
+警戒 504 n
+警戒哨 3 n
+警戒水位 3 n
+警戒线 60 n
+警戒艇 3 n
+警戒色 7 n
+警所 3 n
+警报 319 n
+警报器 43 n
+警报声 40 n
+警报灯 3 n
+警报系统 3 n
+警探 3 vn
+警政 8 n
+警政署 3 n
+警政署长 3 n
+警方 696 n
+警方正 3 n
+警服 15 n
+警枪 3 n
+警标 3 n
+警校 2 n
+警械 2 n
+警棍 19 n
+警民 15 n
+警灯 26 n
+警犬 149 n
+警狗 3 n
+警用 25 n
+警界 2 n
+警监 13 n
+警督 7 n
+警示 206 v
+警示器 3 n
+警示录 2 n
+警示灯 3 n
+警示牌 14 n
+警示语 6 n
+警种 7 n
+警笛 11 n
+警笛声 5 n
+警策 14 n
+警纪 2 n
+警署 14 v
+警花 3 n
+警营 3 vn
+警衔 9 n
+警视厅 2 n
+警觉 301 n
+警觉到 3 l
+警觉地 3 n
+警觉心 3 n
+警觉性 9 n
+警言 3 n
+警讯 9 n
+警诫 3 v
+警语 3 n
+警车 118 n
+警车队 3 n
+警辟 3 v
+警醒 109 v
+警钟 135 n
+警钟长鸣 9 n
+警铃 7 n
+警长 25 n
+警长制 3 n
+警队 3 n
+警风 2 n
+譩 2 zg
+譩譆 3 z
+譬 33 v
+譬喻 73 v
+譬如 780 v
+譬如说 101 l
+譬若 3 v
+譭 2 zg
+議 2 zg
+譺 31 zg
+譾 5 zg
+讉 13 zg
+變 5 zg
+讒 6 zg
+讠 18 zg
+讠式 3 r
+讠身寸 3 v
+计 4965 n
+计丁授 3 n
+计三猛 4 nr
+计上心来 22 l
+计不反顾 3 l
+计不旋踵 3 i
+计不返顾 3 l
+计世网 10 n
+计中计 3 l
+计付 3 v
+计件 19 n
+计件工资 86 l
+计价 86 n
+计价器 16 l
+计价格 3 n
+计价法 3 n
+计价表 3 n
+计伐称勋 3 nr
+计会 3 n
+计佑铭 2 nr
+计兄 3 n
+计入 161 v
+计六奇 2 nr
+计其功 2 nr
+计出万全 7 l
+计出万死 3 l
+计出无奈 3 i
+计出无聊 3 i
+计分 52 n
+计分卡 3 n
+计分表 3 n
+计划 19799 n
+计划书 31 n
+计划体制 3 l
+计划供应 3 l
+计划分配 3 l
+计划单列 9 l
+计划单列市 31 n
+计划司 7 n
+计划周密 3 n
+计划处 14 l
+计划外 53 l
+计划室 12 n
+计划局 46 n
+计划性 30 n
+计划成本 3 l
+计划指标 3 n
+计划数 137 n
+计划案 3 n
+计划生育 1446 l
+计划生育户 10 n
+计划生育率 256 n
+计划经济 330 n
+计划编制 3 n
+计划署 17 n
+计划表 17 n
+计划调节 3 l
+计列 3 n
+计利 3 n
+计功受爵 3 n
+计功受赏 3 l
+计功程劳 3 n
+计功行封 3 n
+计功行赏 3 n
+计功补过 3 l
+计功谋利 3 n
+计功量罪 3 n
+计勋行赏 3 nr
+计发 9 v
+计取 3 v
+计口发 2 n
+计可奈 2 nr
+计合谋从 3 n
+计商 3 n
+计在民 2 n
+计堤备 2 nr
+计大妙 47 nr
+计奖 3 n
+计好 3 v
+计如 3 v
+计委 310 n
+计学 2 n
+计将何出 3 l
+计将安 16 nr
+计将安出 3 n
+计小人 2 n
+计尘器 3 n
+计尽力穷 3 l
+计工 3 n
+计年 4 n
+计引兵 9 n
+计征 10 n
+计息 20 n
+计成 18 v
+计提 124 n
+计收 8 v
+计数 196 n
+计数器 98 n
+计数法 2 n
+计数率 3 n
+计数管 16 n
+计数问题 3 n
+计斗负才 3 n
+计无付之 3 l
+计无复之 3 l
+计无所之 3 l
+计无所出 3 i
+计无所施 3 l
+计无施 73 l
+计无由出 3 i
+计无返顾 3 l
+计日以俟 3 nr
+计日以待 3 i
+计日以期 3 n
+计日可待 3 i
+计日可期 3 n
+计日指期 3 n
+计日程功 3 n
+计日而俟 3 nr
+计日而待 3 i
+计时 161 n
+计时反应 3 l
+计时员 5 n
+计时器 18 n
+计时工资 37 l
+计时表 3 n
+计时赛 10 nr
+计春华 3 nr
+计智 2 n
+计月数 2 n
+计有 3 v
+计有畏 2 l
+计未付 5 nr
+计次 6 n
+计次收费 3 n
+计步器 3 n
+计测 3 v
+计深虑远 3 l
+计温 3 n
+计温学 2 n
+计然之术 3 l
+计然之策 3 l
+计生 56 n
+计生办 2 v
+计生委 36 n
+计生局 3 n
+计生户 9 n
+计略 3 n
+计皇明 2 nr
+计直隶 2 n
+计研心算 3 n
+计票 47 n
+计程 5 n
+计程仪 4 n
+计程司机 3 n
+计程器 3 n
+计程汽车 3 n
+计程表 3 n
+计程车 17 n
+计税 18 n
+计穷 3 v
+计穷力尽 3 i
+计穷力屈 3 i
+计穷力极 3 n
+计穷力竭 4 i
+计穷势蹙 3 i
+计穷势迫 3 i
+计穷智极 3 n
+计穷智短 3 i
+计穷虑尽 3 i
+计穷虑极 3 n
+计穷途拙 3 i
+计策 377 n
+计算 5235 v
+计算中心 36 n
+计算公式 3 n
+计算出来 3 l
+计算力 3 n
+计算器 141 n
+计算尺 31 n
+计算成本 3 n
+计算所 12 n
+计算手册 3 n
+计算技术 5 n
+计算方法 3 n
+计算机 6396 n
+计算机上安装 2 n
+计算机专业 3 n
+计算机业 7 n
+计算机主机 2 n
+计算机信息 92 n
+计算机化 13 n
+计算机屏幕 2 nr
+计算机开启 5 v
+计算机房 11 n
+计算机所 17 n
+计算机技术 14 n
+计算机控制 5 n
+计算机操作 2 n
+计算机教育 4 l
+计算机断层扫描 3 n
+计算机无法 4 l
+计算机服务 6 n
+计算机本身 2 n
+计算机机房 3 n
+计算机犯罪 2 n
+计算机用户 10 n
+计算机病毒 75 n
+计算机相关 2 n
+计算机硬件 4 n
+计算机硬盘 3 n
+计算机确定 3 n
+计算机科学 13 n
+计算机程序 6 n
+计算机管理 8 n
+计算机系 29 n
+计算机系统 55 n
+计算机网 23 n
+计算机网络 29 n
+计算机芯片 3 n
+计算机行业 3 n
+计算机设备 2 n
+计算机读 2 n
+计算机课 3 n
+计算机软件 3 n
+计算机辅助 12 i
+计算机集 2 n
+计算机音乐 3 n
+计算机领域 3 n
+计算环境 3 n
+计算站 3 n
+计算精度 3 n
+计算结果 4 n
+计算能力 4 n
+计算误差 3 n
+计算资源 6 n
+计算速度 3 n
+计算错误 2 n
+计算长度 3 n
+计算题 3 n
+计籍 2 n
+计绌方匮 3 i
+计经委 3 n
+计罚 3 n
+计老丈 2 nr
+计耳 2 n
+计育办 3 n
+计育证 3 n
+计胜己 2 nr
+计若何 8 nr
+计获事足 3 i
+计虑 5 v
+计行虑义 3 l
+计行言听 3 n
+计议 305 n
+计谋 180 n
+计财处 3 l
+计财科 3 nr
+计财部 3 j
+计费 71 n
+计费器 3 n
+计费数据 3 n
+计费时间 3 n
+计费法 3 n
+计较 692 v
+计较锱铢 3 nr
+计过自讼 3 l
+计都星 2 nr
+计酬 5 n
+计重 18 n
+计量 526 n
+计量单位 3 n
+计量器 3 n
+计量学 44 n
+计量局 5 n
+计量法 3 n
+计量泵 3 n
+计量秤 3 n
+计量站 2 n
+计量经济学 19 n
+计银 2 n
+计销 3 v
+计高技 4 n
+订 1545 v
+订上 3 v
+订下 3 v
+订为 3 v
+订书 3 n
+订书机 3 n
+订书针 3 n
+订于 3 v
+订交 3 v
+订亲 3 n
+订价 6 n
+订位 3 n
+订作 3 vn
+订做 26 v
+订出 3 v
+订出来 3 v
+订到 3 v
+订制 52 v
+订单 300 n
+订单号 3 n
+订单式 3 n
+订单数 3 n
+订印 3 v
+订合同 3 n
+订好 3 v
+订婚 136 v
+订婚宴 3 n
+订婚戒指 3 n
+订定 3 v
+订实用 3 n
+订座 4 n
+订成 3 v
+订户 35 n
+订户资料 3 n
+订房网 3 n
+订房间 3 n
+订报 2 n
+订数 3 n
+订期 3 n
+订机票 3 n
+订杂志 3 n
+订条约 3 n
+订来订去 3 n
+订正 61 v
+订正作业 3 n
+订死 3 v
+订满 3 v
+订盟 3 n
+订票 83 n
+订票处 3 n
+订票点 3 n
+订立 713 v
+订约 61 n
+订给 3 v
+订花网 3 n
+订货 251 n
+订货人 4 n
+订货会 8 n
+订货单 2 n
+订货号 3 n
+订货量 5 n
+订购 316 v
+订购人 3 n
+订购价 3 n
+订购单 3 n
+订购电话 3 n
+订购者 6 n
+订费 3 vn
+订起 3 v
+订起来 3 v
+订车 4 n
+订过 3 v
+订造 3 v
+订金 7 n
+订阅 75 v
+订阅费 5 n
+订阳 3 n
+订餐 6 n
+讣 42 n
+讣告 41 n
+讣告作者 3 n
+讣文 2 n
+讣闻 6 n
+认 2506 v
+认不出 3 v
+认不出来 3 v
+认不得 3 v
+认不清 3 v
+认为 30204 v
+认亲 31 v
+认人 3 v
+认仇作父 3 n
+认作 3 v
+认供 3 v
+认做 3 v
+认养 2 v
+认准 66 v
+认出 572 v
+认出来 3 v
+认到 3 v
+认可 918 v
+认可度 17 n
+认同 705 v
+认同度 7 n
+认同感 38 n
+认同率 2 n
+认命 56 v
+认头 3 v
+认奴作郎 3 n
+认奴作郞 3 n
+认字 34 v
+认定 1464 v
+认定书 6 n
+认尸 3 v
+认帐 3 v
+认影为头 3 i
+认影迷头 3 i
+认得 1340 v
+认成 3 v
+认捐 10 vn
+认敌作父 3 n
+认明 3 v
+认有 3 v
+认来认去 3 v
+认栽 3 v
+认死 3 v
+认死理 3 n
+认沽权证 3 n
+认清 251 v
+认清形势 3 n
+认清是非 3 i
+认理 3 v
+认生 14 v
+认用 3 v
+认监委 3 j
+认真 4703 ad
+认真仔细 3 z
+认真做事 3 i
+认真反思 3 n
+认真听讲 3 i
+认真吸取 3 i
+认真学习 3 n
+认真完成 3 i
+认真对待 3 i
+认真思考 3 n
+认真总结 3 n
+认真执行 3 n
+认真细致 3 z
+认真落实 3 z
+认真读书 3 nz
+认真负责 3 n
+认真贯彻 3 i
+认知 440 v
+认知和谐 3 i
+认知失调 3 v
+认知学习 3 v
+认知度 24 n
+认知技能 3 n
+认知率 6 n
+认知疗法 3 n
+认知科学 11 n
+认知结构 3 n
+认知障碍 3 n
+认知革命 3 n
+认破 3 v
+认祖归宗 2 n
+认票 3 v
+认给 3 v
+认缴 3 v
+认罚 3 v
+认罪 60 v
+认罪态度 3 n
+认罪悔过 3 i
+认罪服法 3 n
+认罪服罪 3 n
+认老 3 v
+认股 3 v
+认股权 5 nz
+认股权证 79 nz
+认股证 3 nz
+认认 3 v
+认认真真 52 z
+认证 1170 v
+认证书 2 n
+认证咨询 3 nz
+认证工作 3 n
+认证标志 3 n
+认证码 3 n
+认证费 3 v
+认识 8901 v
+认识一下 3 i
+认识不清 3 v
+认识态度 3 n
+认识水平 3 n
+认识肤浅 3 n
+认识论 272 n
+认读 3 v
+认负 2 v
+认账 45 v
+认购 268 v
+认购书 3 nz
+认购价 2 n
+认购股 3 n
+认购证 58 nz
+认贼为子 3 i
+认贼为父 3 i
+认贼作子 3 n
+认贼作父 33 n
+认赔 3 v
+认起 3 v
+认起来 3 v
+认路 3 v
+认输 285 vn
+认辩 3 v
+认过 3 v
+认过去 3 v
+认过来 3 v
+认错 280 v
+认领 37 v
+认鸡作凤 3 i
+讥 136 v
+讥为 3 v
+讥刺 140 v
+讥嘲 82 v
+讥嫌 3 v
+讥笑 160 v
+讥笑声 3 v
+讥讪 4 v
+讥讽 193 v
+讥评 13 v
+讥诮 26 v
+讦 26 g
+讦谯龙 3 v
+讧 15 g
+讨 2229 v
+讨个吉利 3 l
+讨乞 3 v
+讨乱 3 v
+讨亲 3 v
+讨人厌 3 i
+讨人喜欢 45 i
+讨人嫌 10 l
+讨人欢心 3 i
+讨代 3 v
+讨价 15 v
+讨价声 3 l
+讨价还价 185 i
+讨伐 385 v
+讨便宜 7 i
+讨债 152 v
+讨债人 5 n
+讨债鬼 3 n
+讨光 3 v
+讨公道 3 n
+讨出 3 v
+讨出来 3 v
+讨到 3 v
+讨厌 745 v
+讨厌鬼 8 i
+讨去 3 v
+讨取 3 v
+讨吃 3 v
+讨喜欢 3 i
+讨回 3 v
+讨回公道 3 l
+讨好 539 v
+讨好卖乖 3 n
+讨媳妇 3 n
+讨嫌 10 v
+讨工钱 3 l
+讨巧 9 a
+讨帐 3 v
+讨平 3 v
+讨开 3 v
+讨得 3 v
+讨恶翦暴 3 v
+讨情 13 v
+讨扰 3 v
+讨教 120 v
+讨是寻非 3 i
+讨来讨去 3 i
+讨没趣 3 v
+讨流溯源 3 l
+讨烦 3 v
+讨生活 18 i
+讨究 3 vn
+讨空 3 v
+讨米 3 n
+讨类知原 3 i
+讨索 3 v
+讨老婆 7 n
+讨要 46 v
+讨讨 3 v
+讨论 6464 v
+讨论一下 3 l
+讨论会 122 l
+讨论区 3 l
+讨论式 2 l
+讨论探究 3 l
+讨论案件 3 l
+讨论版 3 v
+讨论稿 3 v
+讨论组 3 n
+讨论题 3 l
+讨说法 3 v
+讨账 5 v
+讨贼 3 n
+讨赏 3 v
+讨走 3 v
+讨还 43 v
+讨还血债 3 l
+讨钱 3 v
+讨饭 115 v
+讨饶 50 v
+让 50310 v
+让三让再 3 n
+让人真 3 v
+让价 3 v
+让位 178 v
+让你在 3 n
+让你玩 3 n
+让你能 3 n
+让再让三 3 n
+让出 96 v
+让利 135 v
+让售 3 v
+让子棋 2 v
+让座 35 v
+让开 144 v
+让我学 3 n
+让我忧 3 n
+让我拿 3 n
+让枣推梨 3 n
+让步 376 v
+让渡 104 v
+让玩家 3 v
+让给 258 v
+让茶 20 v
+让蒂尔港 9 ns
+让贤 27 v
+让路 115 v
+让逸竞劳 3 nr
+讪 232 v
+讪牙闲嗑 3 v
+讪皮讪脸 3 vn
+讪笑 37 v
+讪讪 3 v
+讪讪地 3 z
+讪谤 12 v
+讫 230 g
+讫情尽意 3 nr
+讫站 3 nr
+讬 3 zg
+讬孤寄命 3 nr
+训 1058 vn
+训人 3 n
+训令 43 n
+训典 3 n
+训勉 3 v
+训古 3 vn
+训喻 3 vn
+训导 147 vn
+训导主任 3 n
+训导处 3 n
+训导长 3 n
+训戒 5 vn
+训政 3 n
+训政时期 3 n
+训斥 244 vn
+训格之言 3 i
+训示 38 v
+训练 7829 vn
+训练任务 3 n
+训练伤 2 i
+训练保障 3 n
+训练制度 3 n
+训练员 3 n
+训练器 11 n
+训练团 295 n
+训练场 202 n
+训练场地 23 n
+训练大纲 3 n
+训练室 9 n
+训练局 15 n
+训练方法 3 n
+训练有素 134 i
+训练样区 3 n
+训练样本 3 n
+训练法 3 n
+训练班 602 n
+训练科目 3 n
+训练组 3 n
+训练者 3 n
+训练舰 17 n
+训练舱 3 n
+训练营 32 n
+训练课 16 n
+训练费 5 n
+训练赛 3 n
+训练部 22 n
+训练量 8 n
+训练队 8 n
+训练项目 3 n
+训练馆 15 n
+训育 4 vn
+训育组 3 n
+训训 3 vn
+训训话 3 n
+训诂 157 n
+训诂学 3 vn
+训词 6 n
+训话 91 vn
+训诫 59 vn
+训语 3 n
+训诲 30 v
+训谕 11 n
+训责 3 v
+训辞 3 vn
+训过 3 v
+训迪 3 vn
+训饬 3 v
+议 2216 zg
+议不反顾 3 i
+议事 1840 n
+议事会 245 n
+议事厅 20 n
+议事堂 8 n
+议事录 3 n
+议事日程 109 n
+议事规则 3 n
+议付 3 v
+议价 18 n
+议价空间 3 n
+议价粮 3 n
+议会 3669 n
+议会上院 2 n
+议会下院 7 n
+议会党团 49 n
+议会制 80 n
+议会厅 8 n
+议会宫 3 n
+议会斗争 3 n
+议会选举 3 n
+议决 82 v
+议决书 3 n
+议决案 3 n
+议办 3 v
+议员 1333 n
+议员团 23 n
+议和 470 n
+议商 6 n
+议场 3 n
+议处 3 n
+议定 322 v
+议定书 141 n
+议席 103 n
+议政 285 n
+议标 3 n
+议案 2909 n
+议程 681 n
+议而不决 2 i
+议联 3 n
+议论 1678 n
+议论声 16 n
+议论性 7 n
+议论文 71 n
+议论纷纭 3 i
+议论纷纷 124 i
+议论纷错 3 i
+议论英发 3 i
+议论风发 3 i
+议论风生 3 n
+议请 3 v
+议购 8 v
+议购粮 3 n
+议长 376 n
+议长论短 3 i
+议院 95 n
+议题 523 n
+讯 4086 ng
+讯号 32 n
+讯号旗 3 n
+讯号枪 3 n
+讯号线 3 n
+讯实 3 n
+讯息 411 n
+讯息工期 3 n
+讯息通 3 nz
+讯疾 3 n
+讯究 3 vn
+讯通 3 n
+讯问 38 n
+讯问者 3 n
+讯雷 3 n
+讯驰 3 v
+记 7460 n
+记上 3 n
+记上去 3 v
+记上来 3 v
+记下 168 n
+记下去 3 v
+记下来 3 l
+记不住 3 v
+记不得 3 v
+记不清 105 l
+记不请 3 v
+记不起来 3 l
+记为 3 v
+记事 147 n
+记事体 3 n
+记事儿 3 n
+记事文 3 n
+记事本 24 n
+记事板 3 n
+记事簿 18 n
+记仇 48 v
+记住 1204 v
+记作 3 n
+记入 58 v
+记入日记 3 n
+记出 3 v
+记分 85 n
+记分册 3 n
+记分卡 3 n
+记分员 3 n
+记分板 3 n
+记分法 3 n
+记分牌 3 n
+记分裁判 3 n
+记功 19 n
+记功嘉奖 3 n
+记功忘失 3 n
+记功忘过 3 l
+记功碑 2 n
+记协 18 v
+记取 52 v
+记叙 67 v
+记叙体 3 n
+记叙文 42 n
+记号 392 n
+记号笔 2 n
+记名 99 n
+记名字 3 n
+记名投票 3 n
+记名法 3 n
+记大功 3 n
+记大过 13 l
+记好 3 v
+记存模型 3 n
+记实 20 n
+记工 10 n
+记工员 3 n
+记帐 3 n
+记帐式 3 n
+记帐法 3 n
+记帐联 3 n
+记录 3466 n
+记录下来 3 l
+记录仪 20 n
+记录册 5 n
+记录卡 3 n
+记录员 7 n
+记录器 32 n
+记录在案 3 n
+记录时间 2 n
+记录本 22 n
+记录板 3 n
+记录槽 2 n
+记录片 18 n
+记录片儿 3 n
+记录稿 3 n
+记录簿 3 n
+记录纸 12 n
+记录表 4 n
+记录集 3 n
+记得 2545 v
+记得住 3 v
+记忆 1574 n
+记忆体 3 n
+记忆减退 3 i
+记忆分量 3 n
+记忆力 196 n
+记忆区 3 n
+记忆卡 3 n
+记忆合金 14 n
+记忆忧新 3 i
+记忆性 3 n
+记忆搜索 3 z
+记忆效应 2 n
+记忆术 3 n
+记忆棒 2 n
+记忆法 44 n
+记忆犹新 104 i
+记忆电路 3 n
+记忆系统 3 n
+记忆负担 3 n
+记忆里 3 n
+记忆量 3 n
+记念 12 n
+记性 169 n
+记性差 3 n
+记恨 46 v
+记恨在心 3 l
+记恩 3 v
+记成 3 v
+记挂 107 v
+记挂着 3 l
+记数 126 n
+记数器 3 n
+记数法 3 n
+记日记 3 n
+记时 8 n
+记时计 3 n
+记法 3 n
+记熟 3 v
+记牌器 3 n
+记牢 3 n
+记程车 3 n
+记笔记 3 n
+记者 24649 n
+记者会 724 n
+记者团 36 n
+记者席 2 n
+记者村 6 n
+记者来信 3 i
+记者站 38 n
+记者组 2 n
+记者节 4 n
+记者证 26 n
+记者部 22 n
+记要 3 v
+记言 3 n
+记言文 3 n
+记认 16 v
+记诵 35 v
+记诵法 3 n
+记谱 55 n
+记账 48 n
+记账单 3 n
+记账员 5 n
+记账式 12 b
+记账法 2 n
+记起 3 v
+记转器 3 n
+记载 4784 v
+记载下来 3 l
+记过 33 v
+记过处分 3 l
+记述 846 v
+记述体 3 n
+记述文 3 n
+记里鼓车 10 n
+记错 4 v
+记问之学 3 l
+讲 13587 v
+讲下去 3 v
+讲义 205 n
+讲义夹 8 n
+讲义费 3 n
+讲习 336 v
+讲习会 11 n
+讲习所 3 n
+讲习班 22 n
+讲书 3 n
+讲交情 11 n
+讲价 8 n
+讲价钱 3 n
+讲作 3 v
+讲信修睦 3 l
+讲信用 3 n
+讲出 3 v
+讲出去 3 v
+讲到 3 v
+讲卫生 3 n
+讲叙 5 v
+讲古 5 ns
+讲古人 3 n
+讲古论今 3 l
+讲台 198 n
+讲史 3 n
+讲唱文学 4 n
+讲坛 78 n
+讲堂 24 n
+讲学 359 n
+讲学习 3 n
+讲学法 3 n
+讲完 3 v
+讲定 3 v
+讲寺 3 n
+讲师 149 n
+讲师团 10 n
+讲师职位 3 n
+讲席 10 n
+讲座 447 n
+讲座式 3 n
+讲录 3 v
+讲情 11 n
+讲情理 3 n
+讲情面 8 n
+讲成 3 v
+讲授 359 n
+讲授法 3 n
+讲排场 17 n
+讲援提纲 3 n
+讲故事 3 n
+讲效益 3 n
+讲文张字 3 n
+讲文明 3 n
+讲明 46 v
+讲是说非 3 l
+讲来 3 v
+讲来讲去 3 l
+讲桌 3 n
+讲武 14 n
+讲武堂 3 n
+讲求 722 v
+讲求实效 3 n
+讲法 38 n
+讲清 20 v
+讲清楚 3 l
+讲演 243 v
+讲演会 8 n
+讲演录 3 n
+讲演术 3 n
+讲演法 3 n
+讲演稿 3 n
+讲演者 3 n
+讲点 3 n
+讲理 88 n
+讲用会 2 n
+讲礼貌 3 n
+讲稿 68 n
+讲究 1572 vn
+讲究卫生 3 n
+讲究文明 3 n
+讲究礼貌 3 n
+讲经 62 n
+讲经说法 10 n
+讲者 4 n
+讲解 407 v
+讲解员 30 n
+讲解法 3 n
+讲议 3 n
+讲讲 148 v
+讲论 50 n
+讲评 25 v
+讲评人 3 n
+讲评法 3 n
+讲词 3 n
+讲话 2555 n
+讲话声 7 n
+讲话稿 14 n
+讲读 3 v
+讲课 232 v
+讲课人 2 n
+讲课法 3 n
+讲课费 4 n
+讲起 3 v
+讲过来 3 l
+讲述 776 v
+讲述法 3 n
+讲述者 8 n
+讲道 66 v
+讲道德 3 n
+讲道理 3 n
+讲错 3 v
+讲面子 8 n
+讲题 6 n
+讳 575 zg
+讳兵畏刑 3 i
+讳名 3 v
+讳忌 3 v
+讳恶不悛 3 i
+讳树数马 3 i
+讳疾忌医 9 i
+讳病忌医 3 i
+讳莫如深 49 i
+讳莫高深 3 i
+讳言 67 v
+讴 12 v
+讴功颂德 3 v
+讴吟 3 v
+讴歌 112 v
+讵 138 d
+讵非所料 3 ns
+讶 62 v
+讶异 69 v
+讶然 3 v
+讷 196 ns
+讷口少言 3 ns
+讷河 43 ns
+讷河县 3 ns
+讷河市 3 ns
+讷言敏行 3 ns
+讷讷 42 z
+讷谟尔 3 ns
+讷韦尔 8 ns
+许 2921 m
+许万里 4 m
+许三品 128 m
+许下 114 m
+许下诺言 3 nr
+许世友 423 nr
+许世宽 3 nr
+许东辞 2 nr
+许两 3 m
+许个 2 m
+许中田 6 nr
+许丽秀 2 nr
+许乃济 2 nr
+许久 379 m
+许久以前 3 nr
+许久以后 3 nr
+许久方 2 m
+许久许久 8 m
+许之深 2 nr
+许之物 2 nr
+许之遥 4 nr
+许书平 2 nr
+许予明 65 nr
+许二 12 m
+许云峰 2 nr
+许云龙 4 nr
+许五 10 m
+许亚军 3 nr
+许亲王 128 nr
+许从成 20 nr
+许仕廉 3 nr
+许仙 8 nr
+许仲林 3 nr
+许仲琳 4 nr
+许企平 2 nr
+许伟武 6 nr
+许传玺 4 nr
+许作梅 39 nr
+许佳蓉 3 nr
+许俏妞 3 nr
+许信良 2 nr
+许兀慎 2 nr
+许先生 3 nr
+许光达 34 nr
+许克 4 m
+许克敏 2 nr
+许其亮 2 nr
+许再履 2 nr
+许再提 3 nr
+许冠文 3 nr
+许冠杰 3 nr
+许冠英 3 nr
+许出 2 m
+许功明 3 nr
+许勒位 3 nr
+许十年 2 m
+许卓诚 5 nr
+许博渊 12 nr
+许叔微 2 nr
+许叔惠 4 nr
+许可 623 nr
+许可权 6 nr
+许可法 6 nr
+许可证 351 nr
+许可证书 3 nr
+许可证费 3 nr
+许可费 2 nr
+许司令 3 nr
+许呆子 2 nr
+许哲佩 3 nr
+许嘉璐 271 nr
+许四 4 m
+许回 2 m
+许国 25 ns
+许国富 4 nr
+许国璋 6 nr
+许国石 2 nr
+许圆径 4 nr
+许地山 5 ns
+许基仁 3 nr
+许塞尔 3 nr
+许处 2 m
+许夏国 2 ns
+许外人 2 nr
+许多 25601 m
+许多丝 2 m
+许多二次 2 m
+许多代 5 m
+许多倍 39 m
+许多匹 2 m
+许多叶 3 m
+许多名 13 m
+许多味 2 m
+许多块 5 m
+许多天 42 m
+许多年 222 m
+许多座 4 m
+许多招 5 m
+许多支 9 m
+许多文 6 m
+许多星星 2 nr
+许多曲 2 m
+许多条 18 m
+许多次 67 m
+许多歌 3 m
+许多种 144 m
+许多程 2 m
+许多第一 34 m
+许多篇 2 m
+许多股 6 m
+许多节 2 m
+许多许多 20 m
+许多许多年 5 m
+许多路 14 m
+许多辆 2 m
+许多遍 9 m
+许多部 6 m
+许多页 2 m
+许多首次 2 m
+许大相公 2 nr
+许大隆 3 nr
+许大龄 5 nr
+许天 4 m
+许太后 3 nr
+许太太 2 nr
+许如错 2 nr
+许妈妈 10 nr
+许婚 19 v
+许子 2 m
+许字 2 nz
+许孟哲 3 nr
+许学强 2 nr
+许守谦 2 nr
+许宏治 10 nr
+许宏涛 31 nr
+许宗 3 m
+许宗衡 3 nr
+许定 3 v
+许定国 6 ns
+许宝星 8 nr
+许宝蘅 2 nr
+许宪民 43 nr
+许家 544 m
+许家坝 3 nr
+许家祥 13 nr
+许寿裳 5 nr
+许封 2 m
+许尧佐 2 nr
+许崇智 9 nr
+许崇灏 2 nr
+许崇煌 3 nr
+许州 12 ns
+许州治 2 nr
+许州鄢 2 nr
+许巡抚 3 nr
+许巨源 6 nr
+许帕提 8 nr
+许帮 2 m
+许常惠 2 nr
+许平君 45 nr
+许年 2 m
+许幸之 5 nr
+许广平 12 nr
+许广汉 20 nr
+许庆红 5 nr
+许建萍 4 nr
+许德华 4 nr
+许德拉 2 nr
+许德珩 8 nr
+许志安 3 nr
+许志峰 2 nr
+许志永 33 nr
+许志琴 256 nr
+许惠欣 3 nr
+许愿 106 v
+许愿树 3 nr
+许愿池 3 n
+许愿瓶 3 n
+许慎 21 nr
+许慎注 2 nr
+许慎著 3 nr
+许慧欣 3 nr
+许戈辉 3 nr
+许成 5 m
+许打 3 m
+许执洋 9 nr
+许承先 3 nr
+许振超 3 nr
+许敬宗 13 nr
+许文强 3 nr
+许文龙 3 nr
+许方圆 7 nr
+许旺氏 4 nr
+许昆林 2 nr
+许昌 243 nr
+许昌县 3 ns
+许昌市 21 ns
+许是音 2 nr
+许昱华 31 nr
+许显纯 70 nr
+许晓书 106 nr
+许晓轩 2 nr
+许景澄 30 nr
+许智宏 259 nr
+许曾重 2 nr
+许有王 2 nr
+许朝阳 2 nr
+许朱公 2 nr
+许杏虎 2 nr
+许柏年 2 nr
+许栋 5 m
+许次 5 m
+许氏刊 2 nr
+许永胜 2 nr
+许永跃 6 nr
+许汉卿 3 nr
+许汉胜 8 nr
+许海峰 8 nr
+许涤新 2 nr
+许玮伦 3 nr
+许由 14 n
+许留山 3 nr
+许皇后 15 nr
+许皇帝 128 nr
+许祖华 2 nr
+许福来 13 nr
+许福瑞 4 nr
+许秋怡 3 nr
+许立群 25 m
+许章 3 m
+许纯美 3 nr
+许绍洋 3 nr
+许绍雄 3 nr
+许继集团 3 nr
+许维 2 m
+许维枢 2 n
+许美人 5 nr
+许美静 3 nr
+许群 4 m
+许老秀 25 nr
+许自昌 2 nrfg
+许茹芸 3 nr
+许荣茂 13 nr
+许行 6 m
+许衡凡 2 nr
+许衡劾 2 nr
+许衡尊 2 nr
+许衡成 2 nr
+许衡才 2 nr
+许衡知 2 nr
+许衡诣 2 nr
+许衡闻 2 nr
+许裕舫 3 nr
+许褚之 3 nr
+许褚引 6 nr
+许褚领 2 nr
+许褚飞 2 nr
+许见方 15 nr
+许誉卿 5 nr
+许许 3 m
+许许多多 319 m
+许诺 246 nr
+许财 5 v
+许财发 14 nr
+许贯忠 9 nr
+许路 2 m
+许身 3 m
+许辛之 3 nr
+许还山 3 nr
+许进宫 2 nr
+许远放 16 nr
+许道 10 m
+许道临 3 nr
+许都 116 ns
+许配 165 v
+许配给 3 nr
+许重 2 m
+许钦文 2 nr
+许银川 6 nr
+许雅钧 3 nr
+许雪亭 50 nr
+许靖华 2 nr
+许靖奏 2 nr
+许鞍华 4 nrfg
+许高丽 2 nr
+许高士 2 nr
+许高庆 2 nr
+许魏漫 2 nr
+许鹿希 2 nr
+许麟庐 3 nr
+许龙妹妹 2 nr
+讹 329 v
+讹人 3 n
+讹以传讹 3 n
+讹以滋讹 3 n
+讹传 14 v
+讹夺 3 v
+讹字 3 n
+讹脱 3 v
+讹言 3 n
+讹言惑众 3 n
+讹诈 47 vn
+讹误 31 n
+讹谬 3 n
+讹赖 3 v
+讹音 3 n
+讹音惑众 3 n
+讹音谎语 3 n
+论 7378 zg
+论世知人 3 n
+论丛 75 n
+论争 94 nz
+论事 3 n
+论交 11 v
+论今说古 3 l
+论件 3 n
+论件计酬 3 n
+论价 3 n
+论列 8 n
+论列是非 3 i
+论到 3 v
+论剑 43 n
+论功 3 n
+论功受赏 3 i
+论功封赏 3 n
+论功行封 3 n
+论功行赏 38 n
+论千论万 3 i
+论及 165 v
+论坛 4009 n
+论坛会员 3 n
+论坛公告 3 n
+论坛报 3 nz
+论坛排行 3 l
+论坛激情 3 n
+论坛状态 3 l
+论坛精华 3 nz
+论坛经典 3 nz
+论坛网 3 nz
+论域 3 n
+论堆 3 n
+论处 47 n
+论天 3 n
+论天计酬 3 n
+论定 3 n
+论工计酬 3 n
+论德使能 3 n
+论心定罪 3 i
+论我国 3 n
+论战 243 nz
+论持久战 3 n
+论据 133 n
+论据不足 3 i
+论政 3 n
+论敌 3 n
+论文 1875 nz
+论文体 3 n
+论文库 3 nz
+论文格式 3 nz
+论文答辩 3 i
+论文索引 3 nz
+论文网 3 nz
+论文范文 3 n
+论文选 7 n
+论文集 58 n
+论斤 3 n
+论斤两 3 n
+论斤论两 3 i
+论断 461 v
+论断联络 3 n
+论旨 3 n
+论月计酬 3 n
+论本 3 n
+论本计费 3 n
+论正 3 nz
+论法 3 n
+论点 397 n
+论理 70 n
+论理学 10 n
+论甘忌辛 3 i
+论短道长 3 n
+论称 3 n
+论罪 78 vn
+论者 146 n
+论者以为 3 i
+论艺 3 n
+论著 270 n
+论衡 63 nz
+论议风生 3 n
+论证 1425 n
+论证会 13 n
+论评 3 v
+论诗 3 n
+论语 265 nz
+论说 56 n
+论说体 3 n
+论说文 5 n
+论调 73 n
+论谈 3 v
+论资排辈 27 l
+论赞 3 v
+论起 3 v
+论辨 3 v
+论辩 180 v
+论辩风生 3 n
+论述 2057 v
+论述题 3 n
+论道 23 n
+论道经邦 3 n
+论长说短 3 i
+论长道短 3 n
+论难 3 n
+论集 52 n
+论题 468 n
+论高寡合 3 i
+论黄数白 3 n
+论黄数黑 3 n
+讼 269 vg
+讼争 3 n
+讼事 3 n
+讼师 6 n
+讼案 115 n
+讼棍 6 n
+讼狱 3 n
+讼词 3 n
+讼费 3 n
+讽 94 v
+讽一劝百 3 nz
+讽刺 812 v
+讽刺作品 3 n
+讽刺作家 3 n
+讽刺家 3 n
+讽刺性 17 n
+讽刺歌曲 3 n
+讽刺画 3 n
+讽刺诗 3 n
+讽刺话 3 n
+讽古说今 3 n
+讽味遗言 3 n
+讽喻 29 v
+讽多要寡 3 n
+讽德诵功 3 n
+讽语 3 v
+讽诵 5 v
+讽读 3 v
+讽谏 14 v
+设 16042 v
+设下 3 v
+设为 3 v
+设于 3 v
+设伏 61 v
+设使 8 v
+设党 3 n
+设到 3 v
+设制 3 v
+设区 14 n
+设卡 19 n
+设厂 41 n
+设去 3 v
+设台 3 n
+设喻 3 n
+设圈套 4 n
+设在 1465 v
+设坛 3 n
+设坛祭拜 3 vn
+设备 8176 vn
+设备利用 3 n
+设备厂 11 n
+设备描述 3 n
+设备普查 3 n
+设备租金 3 n
+设备简陋 3 i
+设备组 3 n
+设备组长 3 n
+设备设计 3 n
+设备部 4 n
+设备陈旧 3 i
+设备齐全 3 i
+设奠 3 v
+设好 3 v
+设定 406 v
+设定值 6 n
+设定区 3 n
+设定器 3 n
+设宴 229 n
+设宴招待 3 v
+设宴欢迎 3 v
+设宴款待 3 n
+设局 20 n
+设展位 3 n
+设岗 4 vn
+设帐号 3 n
+设张举措 3 i
+设得 3 v
+设得兰 25 ns
+设心处虑 3 i
+设心积虑 3 n
+设想 1519 n
+设成 3 v
+设拉子 29 n
+设摊 7 vn
+设施 4803 n
+设有 3182 v
+设来 3 v
+设来设去 3 i
+设柜 3 n
+设法 1251 n
+设点 33 n
+设立 8773 v
+设立登记 3 n
+设站 3 n
+设给 3 vn
+设置 4230 vn
+设置成 3 n
+设置障碍 3 n
+设色 63 n
+设若 50 c
+设营 12 vn
+设言托意 3 n
+设计 12474 vn
+设计业 4 n
+设计义务 3 n
+设计协议 3 n
+设计印刷 3 n
+设计变更 3 i
+设计员 7 n
+设计图 155 n
+设计奖 13 n
+设计室 2 n
+设计局 122 n
+设计差错 3 i
+设计师 747 n
+设计所 25 n
+设计方案 3 n
+设计标准 3 n
+设计标高 3 n
+设计概算 3 i
+设计模式 2 n
+设计界 8 n
+设计组 7 n
+设计网 3 n
+设计者 501 n
+设计规划 3 n
+设计规范 3 n
+设计说明 3 n
+设计费 5 n
+设计部 10 n
+设计部门 9 n
+设计铺谋 3 n
+设计阶段 3 n
+设计院 99 n
+设设 3 vn
+设账 3 v
+设起 3 v
+设路障 3 n
+设身处地 58 n
+设过 3 v
+设问 26 v
+设问句 2 n
+设防 183 v
+设防地 3 n
+设防地带 3 n
+设限 23 n
+设限于 3 n
+设陷 3 v
+设陷井 3 n
+访 1446 v
+访京 6 v
+访亲 3 v
+访亲问友 3 i
+访华 287 v
+访华之旅 3 nr
+访华团 13 n
+访友 33 n
+访古 7 vn
+访台 3 v
+访台之旅 3 nr
+访员 3 v
+访大陆 3 nr
+访客 24 v
+访察 3 v
+访察团 3 n
+访寻 7 v
+访德 3 nr
+访德之旅 3 nr
+访日 3 vn
+访日之旅 3 nr
+访日团 3 n
+访旧 3 v
+访查 31 vn
+访求 29 v
+访法 3 v
+访法之旅 3 nr
+访美 3 v
+访美之旅 3 nr
+访苏 3 v
+访英 3 nr
+访英之旅 3 nr
+访视 3 v
+访谈 653 v
+访谈实录 3 n
+访谈录 12 v
+访谈法 3 n
+访贤 3 v
+访贫问苦 15 i
+访遍 3 v
+访问 3086 v
+访问不能 3 i
+访问信息 2 i
+访问共享 3 i
+访问团 50 n
+访问学者 3 n
+访问控制 6 n
+访问期间 25 n
+访问演出 3 n
+访问率 2 n
+访问者 23 n
+访问记 9 n
+访问速度 2 n
+访问量 29 n
+访问队 3 n
+访韩之旅 3 nr
+访韩团 3 nr
+诀 696 ng
+诀别 59 n
+诀别书 3 n
+诀窍 187 n
+诀要 4 v
+证 3628 n
+证严 3 n
+证书 1691 n
+证书及 3 n
+证书废除 3 n
+证书编号 3 n
+证书费 6 n
+证书鉴别 3 n
+证于 3 v
+证交会 3 j
+证交所 28 j
+证交税 3 j
+证人 228 n
+证人室 3 n
+证人席 3 n
+证今 7 n
+证件 321 n
+证件号码 3 n
+证件照 3 n
+证伪 3 j
+证出 3 v
+证出来 3 v
+证券 3575 n
+证券业 33 n
+证券交易 3 n
+证券公司 3 n
+证券化 29 n
+证券商 24 n
+证券委 10 n
+证券市场 3 n
+证券报 333 n
+证券日报 3 n
+证券时报 3 n
+证券期货 3 n
+证券杯 3 n
+证券法 83 n
+证券犯罪 3 n
+证券界 2 n
+证券监管 3 j
+证券类 9 n
+证券网 3 n
+证券行情 3 n
+证券部 22 n
+证卡机 3 n
+证号 3 n
+证号码 3 n
+证婚 6 v
+证婚人 12 n
+证实 1611 n
+证悟 3 n
+证据 1486 n
+证据不足 3 v
+证据学 3 n
+证据法 17 n
+证据目录 3 n
+证据确凿 24 n
+证据规则 3 n
+证据辨认 3 n
+证明 6425 n
+证明书 57 n
+证明信 7 n
+证明单 3 n
+证明文件 3 n
+证明题 3 n
+证果 3 n
+证治准绳 3 n
+证法 8 n
+证照 32 n
+证物 12 n
+证监 27 n
+证监会 180 j
+证监局 3 j
+证章 15 n
+证管会 3 j
+证管办 3 j
+证类本草 3 n
+证编号 3 n
+证者 10 n
+证见 366 v
+证言 35 n
+证认 3 v
+证讨 3 v
+证词 107 n
+证象 3 n
+证道 3 n
+证验 3 n
+证龟成鳖 3 n
+诂 25 g
+诃 196 g
+诃佛诋巫 3 nr
+诃子 3 nrt
+诃德 2 nrt
+评 1313 v
+评上 3 v
+评上去 3 v
+评上来 3 v
+评个 3 n
+评个分数 3 n
+评为 2005 v
+评书 81 n
+评书连播 3 nz
+评介 45 n
+评价 3476 n
+评价性 7 n
+评价者 3 n
+评优 12 v
+评传 23 vn
+评估 1419 vn
+评估价 10 n
+评估器 3 n
+评估师 10 n
+评估所 4 n
+评估费 4 n
+评先 4 vn
+评先树优 2 i
+评出 34 v
+评出来 3 vn
+评分 155 n
+评分标准 3 n
+评分表 8 n
+评判 293 vn
+评判人 3 n
+评判出 3 n
+评判员 2 n
+评判者 20 n
+评剧 57 n
+评剧团 4 n
+评剧院 3 n
+评功 9 v
+评功摆好 5 l
+评功论赏 3 v
+评卷 36 n
+评卷人 2 n
+评唱 3 v
+评头品足 8 n
+评头论脚 3 l
+评头论足 15 i
+评奖 179 vn
+评奖人 3 n
+评委 175 n
+评委会 85 n
+评定 345 v
+评定职称 3 n
+评定表 3 n
+评定量表 3 n
+评审 597 vn
+评审会 4 n
+评审团 11 n
+评审委员 3 n
+评审组 3 n
+评工 3 vn
+评弹 30 v
+评得 3 v
+评戏 3 n
+评成 3 v
+评改 3 v
+评断 49 v
+评断是非 3 i
+评析 22 vn
+评析性 3 n
+评核 3 vn
+评比 154 v
+评比会 2 n
+评法批儒 2 n
+评注 22 v
+评测 107 vn
+评测室 3 n
+评点 99 n
+评理 50 vn
+评等 3 v
+评级 273 vn
+评职称 3 n
+评聘 3 v
+评薪 3 n
+评解 3 v
+评议 268 n
+评议会 23 n
+评议员 11 n
+评议委员 3 n
+评议组 4 n
+评记 3 n
+评论 2189 n
+评论员 89 n
+评论家 250 n
+评论性 5 n
+评论界 32 n
+评论者 9 n
+评论部 11 n
+评论集 20 v
+评评 3 v
+评评理 3 n
+评话 55 v
+评语 141 nz
+评语栏 3 n
+评说 201 v
+评起 3 v
+评述 164 v
+评选 858 v
+评选先进 3 l
+评选员 3 n
+评选活动 3 n
+评酷网 3 n
+评释 2 v
+评量 3 n
+评鉴 3 v
+评鉴报告 3 n
+评阅 11 v
+诅 25 v
+诅咒 263 v
+诅咒语 3 v
+诅骂 3 v
+识 2793 v
+识体 3 n
+识假 3 v
+识别 1112 v
+识别力 2 l
+识别区 3 n
+识别器 17 l
+识别字 3 nz
+识别性 3 n
+识别方法 3 l
+识别模式 3 l
+识别率 5 n
+识别码 15 l
+识别系统 3 l
+识别证 3 v
+识变 3 v
+识变从宜 3 l
+识吾 3 v
+识图 3 v
+识多才广 3 i
+识多见广 3 i
+识大体 3 l
+识字 255 n
+识字率 13 n
+识字班 7 n
+识字知书 3 l
+识宝 3 nz
+识家 3 n
+识得 3 v
+识微知著 3 i
+识微见几 3 i
+识微见远 3 i
+识才 3 n
+识才尊贤 3 i
+识数 3 n
+识文断字 17 l
+识文解字 3 l
+识文谈字 3 l
+识时务 58 l
+识时务者 3 n
+识时务者为俊杰 18 i
+识时达务 3 l
+识时达变 3 l
+识时通变 3 l
+识明智审 3 n
+识涂老马 3 i
+识相 70 v
+识破 198 v
+识破阴谋 3 i
+识礼知书 3 i
+识穿 3 v
+识羞 3 v
+识荆 13 v
+识蕴 3 n
+识见 78 v
+识记 46 v
+识读 8 v
+识货 55 n
+识货者 2 n
+识趣 40 n
+识途老马 4 l
+诈 427 v
+诈伪 3 vn
+诈取 12 v
+诈呼 3 v
+诈哑佯聋 3 vn
+诈唬 4 v
+诈尸 41 n
+诈术 3 n
+诈欺 90 v
+诈欺罪 3 vn
+诈死 13 v
+诈病 4 v
+诈痴佯呆 3 z
+诈称 26 v
+诈语 3 n
+诈谋奇计 3 n
+诈财 3 v
+诈败 53 v
+诈败佯输 3 vn
+诈降 54 v
+诈骗 201 vn
+诈骗案 9 n
+诈骗犯 6 n
+诈骗罪 5 n
+诈骗者 3 n
+诉 498 vn
+诉不尽 3 l
+诉冤 14 v
+诉前 3 v
+诉前保全 3 l
+诉情 3 n
+诉愿 10 v
+诉愿状 3 n
+诉权 3 n
+诉求 87 v
+诉求点 3 n
+诉状 63 n
+诉称 3 v
+诉至 8 v
+诉苦 174 v
+诉苦会 3 l
+诉衷情 3 v
+诉衷谈往 3 v
+诉讼 1569 vn
+诉讼时效 3 n
+诉讼权 3 n
+诉讼条例 3 n
+诉讼案 7 n
+诉讼法 66 n
+诉讼法学 4 n
+诉讼状 3 n
+诉讼类 3 n
+诉讼请求 3 n
+诉讼费 15 n
+诉讼费用 3 n
+诉诉 3 vn
+诉说 362 v
+诉说出来 3 l
+诉说着 3 l
+诉请 6 v
+诉诸 97 v
+诉诸武力 17 l
+诉辩 3 vn
+诉述 3 vn
+诊 365 zg
+诊听 3 v
+诊子 3 n
+诊室 23 n
+诊察 33 v
+诊察室 3 n
+诊所 164 v
+诊断 1714 v
+诊断书 9 n
+诊断仪 7 n
+诊断器 3 n
+诊断学 10 n
+诊断室 4 n
+诊断检测 3 n
+诊断模型 3 n
+诊断法 6 n
+诊断率 10 n
+诊断系统 3 n
+诊治 223 v
+诊疗 119 v
+诊疗学 3 n
+诊疗室 3 n
+诊疗所 4 n
+诊疗费 11 n
+诊病 24 v
+诊脉 33 n
+诊视 3 v
+诊费 21 v
+诊金 3 n
+诋 26 zg
+诋毁 77 v
+诌 63 vg
+诌上抑下 3 nz
+词 5735 n
+词不达意 6 i
+词不逮意 3 vn
+词不逮理 3 vn
+词严义密 3 n
+词严义正 3 n
+词串 3 n
+词义 113 n
+词人 125 n
+词令 8 n
+词作家 8 n
+词作者 3 n
+词儿 130 n
+词典 838 n
+词典学 3 n
+词华典赡 3 n
+词句 150 n
+词坛 28 n
+词头 8 n
+词宗 3 n
+词尾 32 n
+词峰 3 n
+词干 10 n
+词序 28 n
+词库 3 n
+词库上网 3 n
+词库导入 3 n
+词库文件 3 n
+词库版 3 n
+词形 21 n
+词形变化 3 n
+词性 13 n
+词意 3 n
+词数 3 n
+词无枝叶 3 i
+词曰 3 i
+词曲 124 n
+词曲作者 2 n
+词曲创作 3 n
+词条 10441 n
+词根 48 n
+词概念 3 i
+词模式 3 n
+词正理直 3 n
+词汇 752 n
+词汇学 17 n
+词汇表 11 n
+词汇量 3 n
+词法 17 n
+词清讼简 3 n
+词源 78 n
+词源学 2 n
+词牌 15 n
+词牌名 3 n
+词目 7 n
+词盲 3 n
+词眼 3 n
+词穷 3 i
+词穷理尽 3 i
+词穷理屈 3 n
+词穷理极 3 n
+词章 17 n
+词类 29 n
+词类变化 3 n
+词素 8 n
+词约指明 3 n
+词组 104 n
+词组导入 3 n
+词组数量 3 n
+词缀 19 n
+词藻 38 n
+词表 19 n
+词言义正 3 n
+词讼 15 n
+词话 41 n
+词语 288 n
+词语切分 3 n
+词调 11 n
+词谱 7 n
+词赋 3 n
+词输入法 3 n
+词选 3 n
+词钝意虚 3 v
+词锋 8 n
+词长 3 n
+词霸 2 n
+词韵 2 n
+词频 4 n
+词频调整 3 n
+词首 3 n
+诎 50 g
+诎寸信尺 3 nr
+诎要桡腘 3 z
+诏 4127 ng
+诏书 2309 n
+诏令 717 n
+诏告 3 n
+诏命 3 n
+诏安 6 ns
+诏安县 4 ns
+诏旨 3 n
+诏示 3 n
+诏谕 22 n
+译 1768 v
+译丛 11 n
+译为 3 v
+译介 23 n
+译传 3 v
+译作 76 n
+译典通 3 n
+译写 3 v
+译出 3 v
+译制 17 n
+译制片 9 n
+译名 60 n
+译吏 3 n
+译员 164 n
+译官 3 n
+译审 3 n
+译师 3 n
+译意 3 n
+译意风 3 n
+译成 439 v
+译成密码 3 n
+译成电码 3 n
+译文 207 n
+译文集 3 n
+译本 294 n
+译林 2 n
+译法 52 n
+译注 15 v
+译电 3 n
+译电员 7 n
+译码 26 n
+译码器 7 n
+译神 2 n
+译稿 10 n
+译笔 2 n
+译经 3 n
+译者 112 n
+译著 98 n
+译述 3 v
+译错 3 v
+译音 46 n
+诒 74 g
+诓 150 v
+诓骗 24 v
+诔 92 zg
+试 3723 v
+试一下 3 n
+试一试 3 v
+试业 3 n
+试乘 3 v
+试乘试驾 3 n
+试了试 3 v
+试井车 3 n
+试产 8 vn
+试以 3 v
+试件 3 n
+试住 3 v
+试作 5 vn
+试做 3 v
+试养 3 v
+试凑搜索 3 nr
+试出 3 v
+试出来 3 vn
+试刊 3 n
+试制 207 v
+试制品 3 n
+试制成功 3 n
+试剂 364 n
+试剂厂 3 n
+试剂瓶 3 n
+试剂盒 2 n
+试办 42 v
+试办期 3 n
+试办阶段 3 n
+试加 3 v
+试卖 3 v
+试卖品 3 n
+试卷 465 n
+试卷网 3 n
+试压泵 3 n
+试压缩 3 nz
+试吃 3 v
+试听 21 v
+试唱 3 vn
+试图 1484 v
+试图用 3 n
+试场 3 n
+试妆 3 v
+试婚 3 v
+试定 3 v
+试射 282 v
+试工 6 vn
+试开 3 v
+试征 3 v
+试得 3 v
+试想 125 v
+试想想 3 n
+试成 3 v
+试戴 3 v
+试手 3 v
+试探 468 vn
+试探性 50 n
+试探法 3 n
+试播 5 vn
+试教 3 n
+试映 3 v
+试机 3 n
+试机号 3 n
+试来试去 3 v
+试析 3 vn
+试样 99 n
+试比高 3 v
+试水器 3 n
+试油 3 n
+试注 3 v
+试液 40 n
+试演 74 vn
+试点 1130 n
+试点区 2 n
+试点单位 3 v
+试点县 15 n
+试点工作 3 n
+试点班 15 v
+试点站 2 n
+试点经验 3 n
+试炼 3 v
+试片 3 n
+试片室 3 n
+试玩 3 v
+试玩版 3 v
+试生产 19 n
+试用 526 vn
+试用品 3 n
+试用期 270 n
+试用本 3 n
+试用版 2 n
+试用者 3 n
+试用装 3 n
+试用课本 3 n
+试电笔 3 n
+试看 56 v
+试种 35 n
+试穿 40 v
+试笔 2 n
+试算 3 vn
+试算表 3 n
+试管 374 vn
+试管婴儿 30 n
+试管架 3 n
+试纸 73 vn
+试练 3 vn
+试编 3 v
+试考 3 v
+试航 37 v
+试药 7 n
+试营业 13 n
+试行 368 v
+试行期 10 n
+试衣 3 n
+试衣间 7 n
+试表 3 n
+试装 5 v
+试订 3 v
+试训 55 vn
+试讲 11 v
+试论 3 n
+试试 693 vn
+试试看 99 v
+试读 3 v
+试读生 3 n
+试起 3 v
+试起来 3 v
+试跑 3 v
+试跳 22 v
+试车 40 n
+试车场 3 n
+试车手 3 n
+试过 3 v
+试运 2 vn
+试运营 3 n
+试运行 37 v
+试运转 3 v
+试述 3 v
+试选 3 v
+试采 2 v
+试金石 32 n
+试针 3 n
+试铸 6 v
+试销 6 vn
+试销品 3 n
+试错 3 v
+试错性 3 n
+试镜 5 n
+试镜头 9 n
+试镜室 3 n
+试问 175 v
+试院 4 n
+试音 3 n
+试音室 3 n
+试音碟 3 n
+试题 574 n
+试题库 3 n
+试题答案 3 n
+试题集 2 n
+试飞 393 v
+试飞员 105 n
+试飞组 3 n
+试验 4648 vn
+试验区 38 n
+试验厂 3 n
+试验台 11 n
+试验品 11 n
+试验园 3 n
+试验场 91 n
+试验型 15 n
+试验室 62 n
+试验小区 3 n
+试验局 5 n
+试验性 19 n
+试验报告 3 n
+试验期 3 n
+试验机 40 n
+试验楼 3 n
+试验段 2 n
+试验片 3 n
+试验物 3 n
+试验班 23 n
+试验田 13 n
+试验站 15 n
+试验箱 3 n
+试验线 8 n
+试验者 5 n
+试验装置 3 n
+试验设备 3 n
+试验误差 3 n
+试验车 7 n
+试麦 3 n
+诖 104 g
+诗 6567 n
+诗三百 3 nr
+诗三首 3 n
+诗中有画 3 n
+诗书 132 n
+诗书发冢 3 n
+诗书画 8 n
+诗书礼乐 3 n
+诗书门第 3 n
+诗二首 3 n
+诗云 67 n
+诗云子曰 8 nr
+诗人 2795 n
+诗人节 3 n
+诗仙 11 n
+诗以言志 3 i
+诗会 5 n
+诗体 153 n
+诗余 3 n
+诗作 220 n
+诗兴 21 nr
+诗兴大发 3 i
+诗刊 22 n
+诗刊社 3 n
+诗剧 52 n
+诗化 10 n
+诗卷 3 n
+诗友 11 n
+诗句 294 n
+诗史 25 n
+诗名 3 n
+诗品 8 n
+诗圣 13 nr
+诗坛 61 n
+诗学 62 n
+诗家三昧 3 i
+诗库 3 n
+诗庭之训 3 nr
+诗律 7 n
+诗念 2 n
+诗思 9 n
+诗性 7 n
+诗情 36 n
+诗情画意 45 i
+诗意 227 n
+诗抄 39 n
+诗文 1026 n
+诗文集 47 nr
+诗朋酒侣 3 n
+诗朋酒友 3 n
+诗朗诵 6 nr
+诗歌 1562 n
+诗歌创作 3 l
+诗歌史 3 n
+诗歌报 3 n
+诗歌散文 3 n
+诗歌朗诵 3 nr
+诗歌网 3 n
+诗歌评论 3 n
+诗歌选 3 nr
+诗歌集 3 n
+诗牌 3 n
+诗琴 3 n
+诗癖 3 n
+诗碑 7 n
+诗礼 2 n
+诗礼之家 3 l
+诗礼之训 3 nr
+诗礼人家 3 n
+诗礼传家 2 n
+诗社 68 n
+诗神 2 n
+诗稿 30 n
+诗章 32 n
+诗笺 41 n
+诗篇 634 n
+诗织 3 n
+诗经 238 n
+诗翁 2 n
+诗肠鼓吹 3 i
+诗艺 5 n
+诗节 2 n
+诗草 3 n
+诗行 14 n
+诗言志 10 n
+诗论 3 n
+诗论家 7 n
+诗词 396 n
+诗词曲赋 3 n
+诗词歌赋 3 nr
+诗词网 3 n
+诗词选 7 nr
+诗词集 5 n
+诗话 107 n
+诗调 3 n
+诗谜 3 n
+诗豪 3 n
+诗赋 45 n
+诗趣 3 n
+诗选 74 n
+诗酒朋侪 3 n
+诗酒风流 4 n
+诗集 575 n
+诗韵 9 n
+诗页 3 n
+诗风 3 n
+诗魂 4 n
+诘 429 v
+诘屈磝碻 3 z
+诘屈聱牙 3 i
+诘屈謷牙 3 v
+诘戎治兵 3 v
+诘曲聱牙 3 i
+诘诎聱牙 3 i
+诘责 7 v
+诘问 32 v
+诘难 3 v
+诙 118 vg
+诙谐 173 a
+诙谐地 3 z
+诙谐曲 3 z
+诙谐歌曲 3 ns
+诚 753 a
+诚信 683 nz
+诚信为本 3 l
+诚信度 15 l
+诚信教育 3 l
+诚信网 3 nz
+诚信通 3 nz
+诚华 3 nz
+诚可贵 3 i
+诚哉斯言 3 i
+诚如 68 v
+诚如所言 3 i
+诚实 288 a
+诚实信用 6 l
+诚实可欺 3 i
+诚实可靠 3 i
+诚属 3 n
+诚属不易 3 l
+诚征 3 n
+诚心 209 a
+诚心地 3 i
+诚心实意 9 l
+诚心正意 3 i
+诚心诚意 57 i
+诚恳 386 a
+诚恳待人 3 vn
+诚惶诚恐 74 i
+诚意 387 a
+诚意金 3 n
+诚愿 3 n
+诚成文化 3 l
+诚招 3 n
+诚挚 169 a
+诚挚友好 3 nr
+诚敬 3 a
+诚服 3 a
+诚朴 17 a
+诚然 250 d
+诚然如此 3 l
+诚笃 21 a
+诚聘 3 v
+诚至 3 d
+诚至金开 3 l
+诚诚 3 a
+诚诚恳恳 8 a
+诚邀 6 v
+诚非 3 d
+诚非所料 3 l
+诚非易事 3 i
+诛 842 v
+诛尽杀绝 3 i
+诛心之论 2 i
+诛戮 85 v
+诛戮忠良 3 i
+诛戮殆尽 3 z
+诛故贳误 3 vn
+诛暴讨逆 3 i
+诛杀 169 v
+诛死 3 v
+诛求 3 v
+诛求不已 3 i
+诛求无厌 3 i
+诛求无己 3 i
+诛求无已 3 i
+诛求无度 3 i
+诛灭 76 v
+诛连九族 3 i
+诛锄异己 3 v
+诛除 3 v
+诛除异已 3 i
+诜 128 x
+话 34240 n
+话不投机 25 i
+话不投机半句多 7 i
+话不相投 3 i
+话不虎传 3 i
+话不虚传 3 i
+话中带刺 3 n
+话中有话 30 l
+话儿 173 n
+话册 3 n
+话别 51 n
+话到嘴边 3 i
+话剧 759 n
+话剧史 9 n
+话剧团 83 n
+话剧界 10 n
+话剧票 3 n
+话剧表演 3 n
+话剧院 14 n
+话务 5 n
+话务台 3 n
+话务员 14 n
+话务班 3 n
+话务量 13 n
+话匣 3 n
+话匣子 37 n
+话单 33 n
+话口儿 3 n
+话声 3 n
+话外音 3 n
+话头 147 n
+话家常 4 i
+话把儿 7 n
+话旧 4 n
+话本 102 n
+话机 45 n
+话柄 15 n
+话梅 12 n
+话筒 203 n
+话篓子 3 n
+话簿 3 n
+话茬 25 n
+话茬儿 14 n
+话虽如此 3 l
+话言话语 3 i
+话语 402 n
+话语分析 3 l
+话语权 81 n
+话说回来 3 l
+话费 243 n
+话费单 3 n
+话费量 3 n
+话路 3 n
+话里带刺 2 n
+话里有刺 3 n
+话里有话 44 l
+话锋 11 n
+话锋一转 37 i
+话长说短 3 i
+话闸子 3 n
+话音 416 n
+话音刚落 3 n
+话音未落 3 l
+话频 3 n
+话题 1943 n
+话题一转 3 i
+诞 210 zg
+诞妄不经 3 z
+诞幻不经 3 n
+诞生 2046 v
+诞生地 37 n
+诞生石 3 n
+诞生记 3 v
+诞罔不经 3 z
+诞育 3 v
+诞谩不经 3 z
+诞辰 284 n
+诞辰日 6 t
+诟 110 n
+诟如不闻 3 n
+诟病 48 n
+诟骂 20 v
+诟龟呼天 3 n
+诠 163 v
+诠才末学 3 n
+诠次 3 v
+诠注 3 v
+诠释 197 v
+诠释者 2 n
+诡 183 zg
+诡变多端 3 i
+诡奇 3 a
+诡局 3 n
+诡异 426 a
+诡怪 8 a
+诡状殊形 3 n
+诡秘 161 a
+诡秘地 3 n
+诡秘莫测 3 n
+诡称 3 a
+诡笑 5 a
+诡衔窃辔 3 i
+诡言浮说 3 i
+诡计 403 v
+诡计多端 89 i
+诡诈 35 a
+诡诞 3 a
+诡诞不经 3 i
+诡谲 63 a
+诡谲多变 3 z
+诡辩 54 a
+诡辩术 3 n
+诡辩者 3 n
+诡辩论 5 n
+诡雅异俗 3 n
+询 228 v
+询事考言 3 n
+询于刍荛 3 n
+询价 37 v
+询价制 3 n
+询价单 3 n
+询查 3 v
+询根问底 3 v
+询证 3 v
+询谋佥同 3 n
+询谋谘度 3 vn
+询迁询谋 3 n
+询问 2256 v
+询问处 3 v
+询问笔录 3 n
+询问者 4 n
+诣 86 v
+诤 135 zg
+诤友 12 n
+诤臣 8 n
+诤言 4 n
+诤讼 3 n
+诤诤 3 v
+诤谏 2 v
+该 27977 r
+该不该 3 v
+该书 890 r
+该事 3 r
+该人 19 r
+该会 123 r
+该位 3 r
+该免则免 3 n
+该党 247 r
+该减 3 v
+该函 3 v
+该刊 63 r
+该删 3 v
+该判 3 v
+该判何罪 3 nz
+该剧 131 r
+该区 125 r
+该博 3 nz
+该卡 8 r
+该印 3 v
+该厂 58 r
+该县 60 r
+该台 34 r
+该员 3 n
+该品 13 n
+该唱 3 v
+该团 193 r
+该国 372 r
+该地 197 r
+该城 133 r
+该填 3 v
+该处 207 r
+该奖 10 nz
+该季 3 r
+该守 3 v
+该寺 22 r
+该局 87 r
+该岛 3 nz
+该州 44 r
+该巷 3 nz
+该市 982 r
+该帐 3 v
+该帮 3 v
+该店 30 r
+该当 474 d
+该当何罪 3 nz
+该当何论 3 nz
+该恰 3 d
+该户 2 r
+该所 109 r
+该扣 3 v
+该投 3 v
+该报 109 r
+该换 3 v
+该换则换 3 n
+该文 66 r
+该是 442 r
+该服 3 v
+该机 426 r
+该村 40 r
+该条 20 r
+该来则来 3 d
+该校 678 r
+该案 100 r
+该楼 10 r
+该欠 3 v
+该款 18 r
+该死 189 v
+该段 30 r
+该涨 3 v
+该涨则涨 3 n
+该涨未涨 3 n
+该港 23 r
+该游戏 3 n
+该片 100 r
+该班 3 r
+该病 165 r
+该省 92 r
+该矿 22 r
+该社 69 r
+该禁 3 v
+该种 72 r
+该科 279 r
+该站 26 r
+该笔 7 r
+该答 3 v
+该管则管 3 n
+该箱 3 nz
+该类 87 r
+该系 15 r
+该线 20 nz
+该组 16 r
+该署 3 v
+该药 36 r
+该行 241 r
+该补 3 v
+该证据 3 n
+该词 3 v
+该车 427 r
+该轮 3 r
+该软件 3 n
+该还则还 3 n
+该部 161 r
+该镇 28 r
+该队 112 r
+该院 279 r
+该集 3 v
+该页 3 n
+该项 282 r
+该馆 94 r
+详 1011 ag
+详写 3 v
+详列 3 v
+详加 3 v
+详加说明 3 v
+详商 3 n
+详图 4 n
+详图图库 3 n
+详备 21 a
+详实 45 ad
+详审 3 v
+详密 26 a
+详察 11 v
+详尽 323 a
+详尽资料 3 nz
+详悉 3 v
+详情 482 a
+详情度理 3 n
+详情请 3 v
+详情页 3 n
+详探井 3 n
+详改 3 v
+详文 5 n
+详明 22 a
+详星拜斗 3 n
+详查 3 v
+详注 3 v
+详略 8 ad
+详细 2532 ad
+详细信息 3 n
+详细分析 3 n
+详细审查 3 n
+详细情况 3 n
+详细描述 3 n
+详细资料 3 n
+详见 244 a
+详解 69 v
+详言之 3 n
+详论 3 n
+详详细细 39 z
+详读 3 v
+详谈 28 v
+详载 3 v
+详述 156 v
+详述列举 3 n
+详述如下 3 n
+详阅 3 v
+诧 145 a
+诧异 1008 a
+诧愕 3 a
+诧然 3 a
+诨 109 zg
+诨号 24 n
+诨名 12 n
+诩 130 g
+诪张为幻 3 nr
+诪张变眩 3 nr
+诫 190 v
+诫勉 12 v
+诫命 3 v
+诫律 3 v
+诫斥 3 v
+诫条 3 v
+诫莫如豫 3 v
+诬 241 zg
+诬告 122 v
+诬告罪 3 n
+诬告者 24 n
+诬告陷害 3 n
+诬害 19 v
+诬控 3 v
+诬枉 3 v
+诬栽 3 v
+诬称 3 v
+诬良为盗 3 n
+诬蔑 123 v
+诬蔑性 3 vn
+诬衊 3 vn
+诬谤 3 v
+诬赖 24 v
+诬赖好人 3 n
+诬陷 361 v
+语 4563 ng
+语不惊人 2 i
+语不惊人死不休 6 i
+语不成句 3 i
+语不投机 3 i
+语不择人 3 i
+语丝 16 n
+语义 150 n
+语义上 3 n
+语义启动 3 i
+语义学 45 n
+语义编码 3 n
+语义记忆 3 n
+语云 3 n
+语体 8 n
+语体化 3 n
+语体文 2 n
+语出惊人 3 i
+语出月胁 3 n
+语刚 3 n
+语助词 2 n
+语句 276 n
+语四言三 3 i
+语基 2 n
+语塞 70 n
+语境 122 n
+语声 191 n
+语妙天下 3 i
+语妙绝伦 3 i
+语委 3 n
+语尾 2 n
+语尾助词 3 n
+语尾词 3 n
+语尾音 3 n
+语序 11 n
+语录 164 n
+语形 3 n
+语态 28 n
+语惊四座 3 i
+语意 130 n
+语感 63 n
+语支 5 n
+语文 815 n
+语文学 46 n
+语文学家 3 n
+语文报 3 n
+语文版 3 n
+语文科 2 nr
+语文系 15 n
+语文网 3 n
+语文能力 3 n
+语文课 22 n
+语文课件 3 n
+语文课堂 3 n
+语文课程 3 n
+语料 3 n
+语料库 6 n
+语方 4 n
+语族 729 n
+语无伦次 52 i
+语无诠次 3 v
+语术 2 n
+语构学 3 n
+语根 2 n
+语次 3 n
+语气 951 n
+语气助词 2 i
+语气词 6 n
+语汇 36 n
+语法 735 n
+语法分析 3 l
+语法学 22 n
+语法结构 3 n
+语法错误 3 n
+语源 22 n
+语源学 3 n
+语焉不详 17 i
+语用 17 n
+语用分析 3 n
+语病 9 n
+语短情长 3 i
+语石 2 n
+语种 277 n
+语笑喧呼 3 i
+语笑喧哗 3 nr
+语笑喧阗 3 nr
+语简意赅 3 i
+语系 431 n
+语素 21 n
+语群 2 n
+语翰林 2 nr
+语聊 3 v
+语言 7647 n
+语言不清 3 i
+语言不通 3 i
+语言包 3 n
+语言学 284 n
+语言学家 75 n
+语言性 2 n
+语言所 18 n
+语言文字 3 n
+语言文字工作委员会 7 nt
+语言文学 3 n
+语言无味 3 i
+语言版 3 n
+语言特点 3 n
+语言美 3 i
+语言艺术 3 n
+语言表达 3 n
+语言论 3 n
+语言选择 3 l
+语言障碍 3 n
+语词 89 n
+语语 4 n
+语调 202 n
+语调模式 3 n
+语象 3 n
+语辞 3 n
+语近指远 3 i
+语速 38 n
+语里 3 n
+语重心沉 3 i
+语重心长 103 i
+语重情深 3 i
+语锋 2 n
+语镜 3 n
+语长心重 3 i
+语音 865 n
+语音信箱 3 n
+语音卡 3 n
+语音听觉 3 n
+语音学 47 n
+语音室 19 n
+语音拨号 3 n
+语音指令 3 n
+语音治疗 3 n
+语音版 3 n
+语音网络 3 n
+语音课 3 n
+语音输入 3 n
+语风 3 n
+诮 104 g
+误 1715 v
+误上贼船 3 l
+误下 3 v
+误事 68 n
+误人 3 n
+误人子弟 22 n
+误人误己 3 i
+误以为 3 i
+误会 547 n
+误传 19 v
+误伤 121 v
+误作非为 3 l
+误信 20 v
+误入 77 v
+误入歧途 40 i
+误其所谋 3 i
+误写 3 v
+误出 3 v
+误删 3 v
+误删除 3 vn
+误判 37 v
+误动作 3 n
+误区 357 n
+误取 3 v
+误句 3 n
+误国 98 n
+误国害民 3 n
+误国殃民 3 i
+误国殄民 3 i
+误场 3 n
+误填 3 v
+误字 4 n
+误字率 3 n
+误导 193 n
+误导人心 3 n
+误导作用 3 n
+误导性 249 n
+误导民心 3 n
+误射 2 v
+误尽天下 3 i
+误工 14 n
+误工费 8 n
+误差 406 n
+误差传递 3 l
+误差值 3 l
+误差率 4 n
+误录 3 v
+误征 3 n
+误扁 3 n
+误打 3 v
+误打误撞 49 l
+误报 3 n
+误报率 3 n
+误操作 3 n
+误收 3 v
+误放 3 v
+误时 3 n
+误服 23 n
+误期 3 n
+误杀 54 v
+误测 3 v
+误点 7 n
+误犯 3 v
+误班 3 v
+误用 54 v
+误码 4 n
+误码率 3 n
+误称 3 v
+误约 3 n
+误纳 3 v
+误置 3 v
+误解 827 v
+误触 3 v
+误订 3 v
+误认 36 v
+误认为 131 v
+误认颜标 3 l
+误记 3 n
+误讹 3 n
+误诊 50 v
+误诊率 4 n
+误译 3 v
+误读 43 v
+误谬 3 n
+误车 3 n
+误述 3 v
+误闯 3 v
+误闯入 3 i
+误食 53 n
+误餐 2 n
+误餐费 3 n
+诰 1034 n
+诰命 46 vn
+诰封 22 n
+诱 417 v
+诱之 3 v
+诱之以利 3 l
+诱人 300 n
+诱使 90 v
+诱供 5 v
+诱入 3 v
+诱出 3 v
+诱发 391 v
+诱发式 3 n
+诱发故障 3 n
+诱发犯罪 3 l
+诱发电位 3 n
+诱变 38 v
+诱变剂 8 nz
+诱因 112 n
+诱奸 2 v
+诱导 303 vn
+诱导分解 3 n
+诱导剂 4 n
+诱导反应 3 n
+诱导型 3 n
+诱导式 3 n
+诱导性 2 n
+诱导法 3 n
+诱导药 3 n
+诱导酶 3 n
+诱引 23 v
+诱惑 601 v
+诱惑之光 3 l
+诱惑写真 3 n
+诱惑力 88 n
+诱惑性 3 n
+诱拐 13 v
+诱拐罪 3 l
+诱拐者 3 n
+诱捕 31 v
+诱掖 3 v
+诱掖后进 3 v
+诱掖奖劝 3 nr
+诱敌 76 v
+诱敌战术 3 l
+诱敌法 3 l
+诱敌深入 57 l
+诱杀 23 v
+诱杀战术 3 l
+诱电性 3 n
+诱秦诓楚 3 z
+诱胁 3 vn
+诱致 4 v
+诱虫灯 3 n
+诱迫 3 v
+诱逼 11 v
+诱降 100 v
+诱降战术 3 n
+诱陷 3 v
+诱饵 115 n
+诱骗 103 v
+诱骗性 4 n
+诱鸟区 3 n
+诲 665 vg
+诲人不倦 15 i
+诲人不惓 3 i
+诲奸导淫 3 vn
+诲淫 3 i
+诲淫诲盗 5 i
+诲盗 3 i
+诲盗诲淫 3 i
+诳 183 zg
+诳妄 3 n
+诳时惑众 3 n
+诳言 3 n
+诳话 3 n
+诳诞 3 n
+诳语 36 n
+诳骗 3 n
+说 219817 v
+说一不二 50 l
+说一千 2 l
+说一千道一万 3 i
+说一是一 26 l
+说一说 3 l
+说三道四 63 i
+说上几句 3 l
+说不上 189 l
+说不上来 3 l
+说不下去 3 l
+说不出 3 v
+说不出口 3 l
+说不出来 3 l
+说不完 3 v
+说不定 1914 l
+说不得 279 l
+说不来 10 l
+说不清 389 l
+说不清楚 184 l
+说不清道不明 15 l
+说不着 6 l
+说不说 3 l
+说不过去 62 l
+说不过来 3 l
+说东说西 3 l
+说东谈西 3 n
+说东道西 9 l
+说个事 3 l
+说书 99 v
+说书人 3 n
+说了半天 3 l
+说了又说 3 l
+说了算 226 l
+说二是二 16 l
+说亲道热 3 l
+说今道古 3 l
+说出 2145 v
+说到做到 32 l
+说到就到 3 l
+说到底 316 l
+说动 25 v
+说千说万 3 i
+说千道万 3 i
+说古 3 l
+说古谈今 3 l
+说古道今 3 l
+说句实话 3 l
+说句话 3 l
+说合 21 v
+说咸道淡 3 l
+说唱 174 v
+说唱乐 3 n
+说唱团 2 n
+说唱文学 11 l
+说唱版 3 n
+说嘴郎中 3 l
+说地谈天 3 l
+说坏话 3 l
+说大话 20 l
+说头儿 3 l
+说好 513 v
+说好听 3 i
+说好嫌歹 3 n
+说好就好 3 l
+说好说歹 3 i
+说妥 8 v
+说媒 42 v
+说学逗唱 3 n
+说完 2484 v
+说定 19 v
+说定了 3 l
+说实话 581 l
+说客 43 v
+说干就干 3 l
+说得上 3 l
+说得动 3 l
+说得好 3 l
+说得对 3 v
+说得有理 3 l
+说得来 3 l
+说得着 19 l
+说得过去 33 l
+说心里话 3 l
+说怪话 11 l
+说情 46 n
+说情者 3 n
+说情风 4 l
+说慌者 3 n
+说教 135 v
+说教式 5 l
+说文解字 3 l
+说时慢那 3 n
+说时迟 37 l
+说时迟那 3 n
+说时迟那时快 14 l
+说明 8446 v
+说明书 407 n
+说明会 51 l
+说明性 10 n
+说明文 14 n
+说明符 3 n
+说是弄非 3 i
+说是谈非 3 l
+说是道非 3 l
+说服 610 v
+说服力 183 l
+说服教育 3 l
+说来 1342 v
+说来听听 3 i
+说来惭愧 3 i
+说来话长 66 l
+说来说去 95 l
+说来道去 3 l
+说梅止渴 3 i
+说梦话 36 l
+说正经 3 l
+说法 3227 v
+说法不一 54 l
+说法儿 7 l
+说漏嘴 4 v
+说理 66 v
+说白 38 v
+说白了 109 l
+说白道绿 3 l
+说白道黑 3 l
+说真的 108 l
+说瞎话 26 l
+说短论长 3 l
+说短道长 3 l
+说破 70 v
+说破嘴 2 l
+说空话 11 l
+说穿 78 v
+说笑声 5 l
+说笑话 46 l
+说老实话 55 l
+说者 27 n
+说者无意 3 l
+说胡话 27 l
+说蛤蜊 3 n
+说词 23 n
+说话 10146 v
+说话声 95 l
+说话算数 3 l
+说话算话 3 l
+说说唱唱 3 l
+说说看 3 l
+说说笑笑 66 l
+说说话 109 l
+说课稿 3 n
+说谎 218 v
+说谎者 5 n
+说走就走 3 l
+说起 1620 v
+说辞 75 v
+说道 21168 v
+说错 306 v
+说长论短 3 l
+说长话短 3 l
+说长说短 3 i
+说长道短 13 l
+说闲话 89 l
+说鬼话 8 l
+说黄道黑 3 l
+说黑道白 3 l
+诵 457 vg
+诵出 3 v
+诵咏 3 v
+诵念 3 v
+诵经 155 v
+诵经台 3 n
+诵经声 8 n
+诵诗 3 v
+诵读 120 v
+诵读诗篇 3 n
+诶 39 e
+请 23523 v
+请上去 3 v
+请上来 3 v
+请不动 3 v
+请不起 3 v
+请举手 3 n
+请予 3 v
+请于 3 v
+请代 3 v
+请便 62 v
+请假 229 v
+请假单 3 n
+请假条 3 n
+请先入瓮 3 i
+请入 3 v
+请出 3 v
+请到 3 v
+请功 18 v
+请功受赏 3 i
+请加群 3 n
+请勿 118 v
+请勿动手 3 i
+请勿吸烟 3 i
+请勿喧哗 3 i
+请勿打扰 3 i
+请勿践踏 3 vn
+请单击 3 v
+请原谅 3 v
+请参阅 3 n
+请吃 21 v
+请君入瓮 10 i
+请命 18 v
+请回到 3 i
+请回去 3 i
+请坐下 3 n
+请坐下来 3 i
+请多关照 3 i
+请安 615 v
+请客 252 v
+请客吃饭 3 i
+请客送礼 3 n
+请寂 3 v
+请帖 50 n
+请愿 1891 v
+请愿书 40 n
+请愿团 3 n
+请战 31 v
+请戴 3 v
+请托 30 v
+请批示 3 n
+请拨 3 v
+请指示 3 v
+请挑 3 v
+请提意见 3 i
+请援 3 v
+请播 3 v
+请救兵 3 n
+请教 847 v
+请旨 3 v
+请来 512 v
+请柬 82 n
+请款 3 v
+请款单 3 n
+请求 2149 v
+请求书 6 n
+请求事项 3 n
+请求分页 3 n
+请求权 33 n
+请求者 3 n
+请洽 3 v
+请点此 3 i
+请用 3 v
+请用茶 3 n
+请留 3 v
+请留下 3 n
+请留步 3 n
+请登入 3 i
+请益 8 v
+请示 496 v
+请示报告 3 n
+请示汇报 3 n
+请稍等 3 vn
+请等一下 3 i
+请答 3 v
+请缨 39 v
+请罪 93 v
+请自隗始 3 vn
+请见 3 v
+请说出 3 v
+请调 10 v
+请调报告 3 n
+请谅解 3 vn
+请谈 3 v
+请谒 3 v
+请贴 3 v
+请赏 3 v
+请起 3 v
+请辞 3 v
+请进 3 v
+请进去 3 v
+请进来 3 v
+请问 774 v
+请降 3 v
+请领 3 v
+诸 6711 r
+诸为闽 2 nr
+诸乐调 16 nr
+诸书之 2 nr
+诸书行 3 nr
+诸书达 3 nr
+诸事 228 r
+诸亲六眷 3 i
+诸亲好友 3 nr
+诸仁桥 9 nr
+诸仓米 4 nr
+诸位 670 m
+诸位先生 3 nr
+诸体 2 n
+诸侯 893 nr
+诸侯国 165 nr
+诸侯王 122 nr
+诸保昆 87 nr
+诸候 3 n
+诸候王 2 nr
+诸儒臣 4 nr
+诸元素 2 nr
+诸兄弟 3 nr
+诸全真 2 nr
+诸公 69 nr
+诸公子 3 nr
+诸公想 2 nr
+诸公皆 2 nr
+诸军之 3 nr
+诸军众 5 nr
+诸军尽 2 nr
+诸军州 2 nr
+诸军战 2 nr
+诸军攻 2 nr
+诸军畏 3 nr
+诸军皆 2 nr
+诸可宝 8 nr
+诸史 3 n
+诸司 3 n
+诸司悉 2 nr
+诸司符 2 nr
+诸司职 5 nr
+诸同存 4 nr
+诸吕之 5 nr
+诸吕秉 2 nr
+诸吕聚 2 nr
+诸君 128 nr
+诸君子 6 nr
+诸善德 48 nr
+诸善必 16 nr
+诸国 667 ns
+诸城 141 nr
+诸城县 3 ns
+诸城市 27 ns
+诸复立 2 nr
+诸夏国 2 ns
+诸夏族 2 nr
+诸多 1044 m
+诸多不便 32 l
+诸多元 2 m
+诸多名 2 m
+诸多困难 3 i
+诸多方面 3 m
+诸多矛盾 3 l
+诸大藩 3 nr
+诸天 5 m
+诸夷内 2 nr
+诸夷皆 2 nr
+诸女伎 2 nr
+诸如 967 nr
+诸如此例 3 i
+诸如此比 3 i
+诸如此类 95 l
+诸妙欲 2 nr
+诸子 158 nr
+诸子之 6 nr
+诸子争 9 nr
+诸子亦 3 nr
+诸子仅 2 nr
+诸子传 2 nr
+诸子则 2 nr
+诸子前 3 nr
+诸子受 2 nr
+诸子封 4 nr
+诸子略 3 nr
+诸子百家 70 m
+诸子皆 2 nr
+诸子系 3 nr
+诸子自立 2 nr
+诸子言 2 nr
+诸子都 16 nr
+诸宗王 12 nr
+诸宝树 6 nr
+诸宫典 2 nr
+诸宫府 2 nr
+诸宫调 62 nr
+诸家之 4 nr
+诸家修 2 nr
+诸家曲 2 nr
+诸家词 3 nr
+诸密档 2 nr
+诸富室 16 nr
+诸将军 2 nr
+诸小国 3 nr
+诸小神 2 nr
+诸小邦 17 nr
+诸山之 2 nr
+诸山寨 3 nr
+诸岛 51 nr
+诸峰诸 2 nr
+诸川流 2 nr
+诸州 549 ns
+诸州佐 2 nr
+诸州均 2 nr
+诸州治 3 nr
+诸州萨 2 nr
+诸州郡 14 nr
+诸帅皆 2 nr
+诸帅臣 2 nr
+诸师伯 7 nr
+诸师弟 2 nr
+诸帮众 12 n
+诸广山 10 nr
+诸府州 2 nr
+诸弟聘 2 nr
+诸弟诸 2 nr
+诸弟谭 3 nr
+诸强国 2 nr
+诸御史 2 nr
+诸恶事 4 i
+诸恶莫作 3 i
+诸教众 12 nr
+诸文武 5 nr
+诸文臣 2 nr
+诸方面 3 m
+诸旗会 4 nr
+诸暨 49 ns
+诸暨县 5 ns
+诸暨市 5 ns
+诸暨网 3 nr
+诸有此类 3 l
+诸本讳 2 nr
+诸校尉 2 nr
+诸水注 2 nr
+诸汗国 6 ns
+诸泉多 2 nr
+诸法 12 n
+诸法实 7 nr
+诸法度 3 n
+诸法性 2 nr
+诸洞主 3 nr
+诸港 2 ns
+诸湖开 2 nr
+诸溪洞 3 nr
+诸猛安 2 nr
+诸王众 3 nr
+诸王公 4 nr
+诸王公主 2 nr
+诸王兼 4 nr
+诸王军 3 nr
+诸王取 2 nr
+诸王各 2 nr
+诸王同 2 nr
+诸王子 6 nr
+诸王拜 3 nr
+诸王诸 3 nr
+诸王贝 3 nr
+诸王贵 2 nr
+诸生 87 nr
+诸生求 3 n
+诸皇亲 2 nr
+诸相 3 nr
+诸祖耿 2 nr
+诸神执 16 nr
+诸福棠 2 nr
+诸种 3 r
+诸税 3 n
+诸笔伐 2 nr
+诸职司 64 n
+诸臣之 4 nr
+诸臣入 2 nr
+诸臣求 2 nr
+诸臣皆 2 nr
+诸臣立 2 nr
+诸臣表 2 nr
+诸臣误 8 nr
+诸般 339 r
+诸般兵 2 nr
+诸般品 2 l
+诸般奇 3 nr
+诸般异 2 l
+诸般法 2 l
+诸色 6 n
+诸色人等 3 l
+诸色伎 3 nr
+诸色民 2 nr
+诸艺未 5 nr
+诸苗决 2 nr
+诸若此类 3 i
+诸药 2 n
+诸葛 152 nr
+诸葛丞相 8 nr
+诸葛亭 3 nr
+诸葛亮 1067 nr
+诸葛亮会 3 nr
+诸葛均 2 nr
+诸葛子瑜 4 nr
+诸葛孔 3 nr
+诸葛孔明 19 nr
+诸葛尚 2 nr
+诸葛巾 2 nr
+诸葛徐天 4 nr
+诸葛村 2 nr
+诸葛武 2 nr
+诸葛武侯 17 nr
+诸葛殷 3 nr
+诸葛爽 5 nr
+诸葛玄 3 nr
+诸葛瑾 31 nr
+诸葛瑾乃 2 nr
+诸葛瑾之 2 nr
+诸葛瞻 9 nr
+诸葛祭风 2 nr
+诸葛绪 7 nr
+诸葛绪分 5 nr
+诸葛谨 2 nr
+诸葛辉 9 nr
+诸葛靓 3 nr
+诸行 3 v
+诸行百 2 nr
+诸行省 4 ns
+诸语言 10 nr
+诸豪杰 2 nr
+诸贝勒 10 nr
+诸路 7 n
+诸路兵 2 nr
+诸路军 3 nr
+诸路招 2 nr
+诸边臣 2 nr
+诸运安 3 nr
+诸进士 128 nr
+诸遂良 2 nr
+诸道之 2 nr
+诸道兵 2 nr
+诸道肃 2 nr
+诸道行 8 nr
+诸郎君 3 nr
+诸郡乌 2 nr
+诸郡县 2 nr
+诸郡常 2 nr
+诸郡海 2 nr
+诸郡生 2 nr
+诸部争 3 l
+诸部兵 3 nr
+诸部军 2 nr
+诸部豪 2 nr
+诸部赐 3 nr
+诸酋 2 ns
+诸镇遂 2 nr
+诸长老 18 nr
+诸阮聚 2 nr
+诸阳之 2 nr
+诸阿哥 2 nr
+诸降羌 2 nr
+诸降臣 2 nr
+诸青阳 4 nr
+诸项 3 r
+诸首领 4 nr
+诸马牧 3 nr
+诹 65 zg
+诺 1442 nz
+诺丁山 3 nz
+诺丁汉 9 nz
+诺丁汉大学 4 nz
+诺丁汉郡 3 nr
+诺亚 9 nrt
+诺亚方舟 4 nz
+诺亚舟 3 nz
+诺伊 13 nrt
+诺伊斯 10 nrt
+诺伊曼 52 nrt
+诺伊维尔 3 nrt
+诺克 14 nrt
+诺克斯 16 nrt
+诺兰 6 nrt
+诺华 80 nz
+诺和诺德 2 nz
+诺埃尔 2 nrt
+诺基亚 310 nz
+诺基亚公司 43 nt
+诺夫 79 nrt
+诺夫哥罗德 22 nrt
+诺奇 2 nrt
+诺姆 8 nrt
+诺威 4 nz
+诺娃 4 nrt
+诺安 3 nz
+诺尔 48 nrt
+诺尔兰 5 nrt
+诺尔德 3 nrt
+诺尔曼 25 nrt
+诺德 19 nrt
+诺思 13 nrt
+诺恩 6 nrt
+诺成合同 3 nz
+诺托 17 nrt
+诺拉 2 nrt
+诺斯 29 nrt
+诺斯州 3 nrt
+诺斯罗普 8 nrt
+诺昂 2 nrt
+诺曼 34 nrt
+诺曼人 41 nrt
+诺曼地 3 nrt
+诺曼底 103 nrt
+诺曼第 3 nrt
+诺木洪 3 nr
+诺森伯兰 5 nrt
+诺比 2 nrt
+诺氟沙星 2 nz
+诺沃特尼 2 nrt
+诺特 16 nrt
+诺特环 3 nz
+诺瓦 2 nrt
+诺瓦克 3 nrt
+诺瓦拉 2 nrt
+诺盖 3 nrt
+诺福克 33 nr
+诺福克岛 3 nrt
+诺福克郡 7 nr
+诺维 3 nz
+诺维奇 17 nrt
+诺维茨基 69 nrt
+诺维萨德 7 nrt
+诺罗敦 8 ns
+诺萨斯 3 nrt
+诺言 206 nz
+诺诺 3 nrt
+诺诺连声 19 nrt
+诺贝 2 nrt
+诺贝尔 205 nrt
+诺贝尔化学奖 62 nz
+诺贝尔和平奖 130 nz
+诺贝尔基金会 3 nz
+诺贝尔奖 138 nz
+诺贝尔文学奖 109 nz
+诺贝尔物理学奖 95 nz
+诺贝尔经济学奖 28 nz
+诺达 3 nz
+诺里 2 nrt
+诺里奇 7 nrt
+诺里斯 2 nrt
+诺韦尔 10 nrt
+诺顿 12 nrt
+读 5660 v
+读一读 3 v
+读万卷书 3 n
+读不舍手 3 v
+读书 2347 n
+读书三余 3 n
+读书三到 3 i
+读书不求 3 n
+读书人 517 n
+读书会 8 n
+读书君子 3 n
+读书声 20 n
+读书处 4 n
+读书得间 3 n
+读书报 7 n
+读书无用 3 n
+读书班 13 n
+读书界 4 n
+读书看报 3 i
+读书社 3 n
+读书种子 5 n
+读书笔记 3 n
+读书网 3 n
+读书节 3 n
+读作 3 v
+读信号 3 n
+读光盘 6 n
+读入 9 v
+读写 182 v
+读写周期 3 n
+读写器 3 n
+读写孔 3 n
+读写操作 4 n
+读写磁头 3 n
+读写网 3 n
+读写能力 3 n
+读写访问 3 n
+读写通道 2 n
+读出 104 v
+读出来 3 v
+读到 3 v
+读卖 2 v
+读卖新闻 50 n
+读卡 3 n
+读卡仪 3 nz
+读卡器 4 n
+读卡机 13 n
+读友 3 n
+读取 79 v
+读取器 4 n
+读取数据 4 n
+读后 15 n
+读后心得 3 i
+读后感 7 n
+读图 26 n
+读字机 3 n
+读存储器 2 n
+读完 476 v
+读心术 3 n
+读懂 3 v
+读成 3 v
+读报 40 n
+读报栏 3 n
+读数 71 n
+读数据 2 n
+读本 77 n
+读来 3 v
+读来读去 3 i
+读框重叠 3 nz
+读档 3 n
+读毕 3 v
+读法 22 n
+读熟 3 v
+读片 3 n
+读物 269 n
+读犯 3 v
+读状态 2 n
+读的书 3 n
+读盘 8 n
+读研 45 n
+读破 3 v
+读秒 8 n
+读秒阶段 3 n
+读稿 3 n
+读稿机 3 n
+读经 69 n
+读者 2695 n
+读者文摘 3 n
+读者来信 3 i
+读者群 23 n
+读者论坛 3 n
+读者部 3 n
+读若 3 v
+读解 2 v
+读诗 3 n
+读诗班 3 n
+读读 20 v
+读读书 5 n
+读起 3 v
+读过去 3 v
+读过来 3 v
+读进 3 v
+读错 3 v
+读阅 3 v
+读雇 3 v
+读音 89 n
+读音节 3 n
+诼 39 g
+诽 93 v
+诽誉在俗 3 n
+诽议 3 v
+诽语 3 v
+诽谤 129 v
+诽谤之木 3 n
+诽谤之术 3 n
+诽谤性 3 n
+诽谤案 3 n
+诽谤罪 13 n
+诽谤者 2 n
+课 2900 n
+课业 37 n
+课业负担 3 n
+课以 69 v
+课以重税 3 n
+课件 36 n
+课件园 3 n
+课件网 3 n
+课余 62 n
+课余时间 3 n
+课内 3 t
+课内练习 3 n
+课前 3 t
+课前课后 3 n
+课前预习 3 n
+课卷 3 n
+课取 3 v
+课名 3 n
+课后 57 t
+课后复习 3 n
+课后练习 3 n
+课吏 3 n
+课员 3 n
+课嘴撩牙 3 v
+课堂 707 n
+课堂作业 3 n
+课堂实录 3 n
+课堂教学 38 n
+课堂气氛 3 n
+课堂秩序 3 vn
+课堂纪律 3 n
+课堂练习 3 n
+课处 3 n
+课外 139 n
+课外书 9 n
+课外作业 3 n
+课外指导 3 n
+课外活动 3 n
+课外练习 3 n
+课外读去 3 n
+课外读物 3 n
+课外辅导 3 n
+课外阅读 3 n
+课室 4 n
+课征 13 n
+课徒 13 n
+课收 3 n
+课文 96 n
+课文内容 3 n
+课时 46 t
+课时费 7 n
+课期 3 t
+课本 462 n
+课本上 3 n
+课本剧 3 n
+课本费 4 n
+课桌 43 n
+课桌凳 2 n
+课桌椅 4 n
+课椅 3 n
+课田制 3 n
+课目 487 n
+课程 2765 n
+课程体系 3 n
+课程内容 2 n
+课程名称 3 n
+课程标准 3 n
+课程班 5 n
+课程目标 3 n
+课程管理 3 n
+课程表 3 n
+课程计划 3 n
+课程设计 3 n
+课税 73 n
+课表 6 n
+课表上 3 n
+课语讹言 3 n
+课诵 3 v
+课课 7 n
+课长 16 n
+课间 20 n
+课间休息 3 n
+课间操 7 n
+课间餐 3 n
+课题 2044 n
+课题组 111 n
+诿 75 vg
+诿过于人 3 nrfg
+谀 145 g
+谀词 3 i
+谀辞 3 i
+谁 25842 r
+谁为谁 3 i
+谁主张 3 v
+谁举证 3 i
+谁他妈 3 i
+谁会想到 3 l
+谁又能 3 l
+谁家 361 r
+谁料 66 v
+谁是谁非 44 i
+谁有空 3 i
+谁来管 3 v
+谁的心 3 l
+谁的车 3 l
+谁知 1082 v
+谁知盘中餐 6 l
+谁给了 3 l
+谁给我 3 i
+谁肯 3 v
+谁能给 3 v
+谁言寸草 3 i
+谁谁谁 3 i
+谁错 3 v
+谂 41 g
+调 7728 v
+调三惑四 3 i
+调三斡四 3 nz
+调三窝四 3 nz
+调上 3 v
+调上去 3 v
+调上来 3 v
+调下 3 v
+调下去 3 v
+调下来 3 v
+调丝品竹 3 n
+调为 3 v
+调五事 3 i
+调人 20 n
+调令 41 v
+调价 123 vn
+调任 196 v
+调休 11 vn
+调位 3 vn
+调位子 3 n
+调低 96 v
+调使 3 v
+调侃 165 v
+调值 5 v
+调停 164 v
+调停两用 3 i
+调停人 9 n
+调停法 3 v
+调停者 6 n
+调光 3 vn
+调光器 3 nz
+调光师 3 n
+调入 133 v
+调关镇 512 ns
+调兵 3 vn
+调兵山 3 nz
+调兵山市 3 ns
+调兵遣将 98 i
+调养 117 v
+调冶 3 vn
+调准 3 v
+调减 18 vn
+调出 67 v
+调出去 3 v
+调到 3 v
+调制 518 vn
+调制剂 3 n
+调制器 19 n
+调制指数 3 nz
+调制法 3 vn
+调制电流 3 n
+调制能力 3 n
+调制解调器 33 n
+调剂 543 n
+调剂余缺 3 l
+调剂品 3 n
+调剂身心 3 n
+调剂金 3 n
+调动 1403 vn
+调匀 117 vn
+调包 5 v
+调包计 2 n
+调升 46 v
+调协 4 v
+调卷 3 v
+调压 19 vn
+调压井 3 n
+调压器 3 n
+调压室 3 n
+调压阀 3 n
+调去 3 v
+调取 26 v
+调号 4 n
+调合 21 vn
+调合漆 3 nz
+调名 3 v
+调向 3 v
+调向叠加 3 nz
+调味 347 n
+调味剂 8 nz
+调味品 66 n
+调味品厂 256 n
+调味料 43 v
+调味汁 3 nz
+调味瓶 3 v
+调味粉 4 v
+调味酱 3 nz
+调和 644 vn
+调和主义 37 nz
+调和函数 3 n
+调和剂 4 nz
+调和数列 3 n
+调和油 3 nz
+调和漆 3 nz
+调和矛盾 3 i
+调和级数 3 n
+调和阴阳 5 ns
+调和鼎鼐 3 i
+调唆 34 v
+调唇弄舌 3 i
+调嗓子 3 nz
+调嘴学舌 3 i
+调嘴弄舌 3 i
+调嘴调舌 3 i
+调回 86 vn
+调回去 3 i
+调回来 3 i
+调增 3 v
+调墨弄笔 3 i
+调处 64 v
+调头 33 v
+调头寸 3 n
+调好 3 v
+调妥 3 a
+调委会 2 n
+调子 158 n
+调宽 3 v
+调寄 7 vn
+调峰 5 n
+调差 3 v
+调幅 35 n
+调幅台 3 l
+调幅器 3 l
+调干 4 v
+调度 359 n
+调度会 3 nz
+调度员 5 n
+调度室 10 nz
+调度机 3 nz
+调度机车 3 nz
+调度表 3 n
+调度长 3 n
+调开 3 v
+调弄 16 v
+调式 78 n
+调弦 3 v
+调弦品竹 3 n
+调强 3 v
+调往 3 vn
+调得 3 v
+调御 3 v
+调快 3 v
+调性 51 n
+调息 3 v
+调情 65 n
+调慑 3 vn
+调戏 108 v
+调戏妇女 3 n
+调成 3 v
+调护 3 vn
+调拌 2 v
+调拨 131 v
+调换 95 v
+调换法 3 n
+调换证券 3 nz
+调控 1035 vn
+调摄 18 v
+调教 141 nz
+调整 8590 vn
+调整器 3 n
+调整型 3 n
+调整布局 3 n
+调整期 12 n
+调整机制 4 n
+调整法 6 n
+调整结构 3 n
+调整计划 3 n
+调料 79 n
+调料作物 3 n
+调料库 3 n
+调料瓶 3 n
+调朱傅粉 3 i
+调朱弄粉 3 i
+调来 215 v
+调来调去 3 i
+调查 8332 vn
+调查取证 3 n
+调查员 16 n
+调查团 42 n
+调查室 3 n
+调查小组 3 n
+调查局 29 n
+调查报告 3 n
+调查权 4 n
+调查核实 3 n
+调查科 11 nz
+调查组 97 n
+调查结果 3 n
+调查网 3 nz
+调查者 37 n
+调查表 33 n
+调查过程 3 n
+调查部 8 n
+调查队 11 n
+调校 3 n
+调校器 3 n
+调档 127 v
+调档线 3 v
+调正 3 v
+调正校准 3 n
+调水 27 vn
+调治 62 vn
+调治法 3 n
+调派 40 vn
+调派到 3 l
+调流 2 vn
+调测 15 vn
+调济 3 n
+调温 19 v
+调湿 3 v
+调演 51 vn
+调焦 6 vn
+调班 3 vn
+调理 150 vn
+调理液 3 n
+调理阴阳 3 ns
+调琴 3 n
+调用 343 vn
+调用函数 5 n
+调用者 13 n
+调画出 3 v
+调白 3 v
+调皮 266 n
+调皮捣乱 3 i
+调皮捣蛋 3 v
+调皮蛋 3 n
+调皮鬼 2 n
+调监 3 n
+调相 21 v
+调相器 3 n
+调研 605 vn
+调研员 22 n
+调研室 6 n
+调研材料 3 n
+调研科 3 nz
+调研组 10 n
+调神畅情 3 i
+调离 104 vn
+调移 3 vn
+调笑 74 vn
+调类 4 vn
+调级 3 vn
+调细 3 a
+调经 14 v
+调给 3 vn
+调置 3 vn
+调羹 13 n
+调职 14 vn
+调聚反应 3 nz
+调脂弄粉 3 i
+调至 3 v
+调舌弄唇 3 i
+调良稳泛 3 n
+调色 13 n
+调色刀 3 n
+调色板 13 n
+调色盘 3 n
+调节 2626 vn
+调节价 8 n
+调节作用 3 n
+调节剂 29 n
+调节力 2 n
+调节器 53 n
+调节异 3 n
+调节性 2 n
+调节税 14 n
+调节费 2 n
+调节阀 3 n
+调蓄 271 n
+调薪 3 v
+调虎离山 47 i
+调角 3 n
+调解 711 v
+调解书 5 n
+调解人 17 n
+调解员 3 n
+调解机制 3 n
+调解法 3 n
+调解纠纷 3 z
+调解者 2 n
+调训 2 vn
+调词架讼 3 i
+调试 177 vn
+调试信息 4 n
+调试器 3 n
+调试模式 2 n
+调试程序 2 n
+调调 35 v
+调调儿 3 n
+调谐 37 a
+调谐器 3 nz
+调谑 3 v
+调账 3 v
+调货 3 vn
+调质 5 n
+调资 3 vn
+调走 3 v
+调赴 3 v
+调起 3 v
+调车 5 n
+调车场 9 n
+调转 52 vn
+调轻 3 v
+调迁 3 vn
+调过 3 v
+调过去 3 v
+调过来 3 v
+调运 73 vn
+调近 3 v
+调进 27 v
+调进去 3 v
+调进来 3 v
+调远 3 nz
+调适 50 a
+调速 34 v
+调速器 30 n
+调遣 300 v
+调配 205 vn
+调配出 3 n
+调配器 3 n
+调配法 3 n
+调酒 26 vn
+调酒师 61 n
+调重 3 v
+调钱 3 v
+调销 3 vn
+调门 26 v
+调门儿 2 n
+调阅 57 v
+调防 12 vn
+调集 377 vn
+调露 12 v
+调音 24 vn
+调音台 3 n
+调音器 3 n
+调音师 8 n
+调频 82 vn
+调频台 3 n
+调频电台 3 nz
+调风变俗 3 i
+调风弄月 3 i
+调香 13 v
+调高 3 v
+谄 120 v
+谄上傲下 3 i
+谄上抑下 3 vn
+谄上欺下 3 i
+谄上骄下 3 i
+谄媚 96 v
+谄媚拍马 3 i
+谄媚者 3 i
+谄害 3 v
+谄笑 15 v
+谄笑胁肩 3 i
+谄词令色 3 i
+谄谀 64 v
+谄谀取容 3 i
+谅 452 v
+谅察 3 v
+谅山 25 ns
+谅山省 3 ns
+谅已 3 v
+谅必 15 v
+谅解 248 v
+谆 28 l
+谆告 3 l
+谆嘱 3 i
+谆诫 3 i
+谆谆 45 d
+谆谆不倦 3 i
+谆谆劝导 3 vn
+谆谆告诫 29 i
+谆谆嘱咐 3 l
+谆谆地 3 l
+谆谆教导 12 l
+谆谆教诲 10 l
+谆谆诰诫 3 vn
+谇 54 g
+谇帚德锄 3 v
+谈 6712 v
+谈一谈 3 i
+谈不上 311 l
+谈不出 3 v
+谈不到 3 v
+谈不完 3 v
+谈不容口 3 i
+谈不成 3 v
+谈不拢 3 v
+谈不来 3 v
+谈不陇 3 nr
+谈丹崖 2 nr
+谈乐 3 vn
+谈书法 2 nr
+谈事 3 v
+谈今论古 3 l
+谈仙岭 3 nr
+谈价 3 vn
+谈优务劣 3 l
+谈何 3 nr
+谈何容易 236 l
+谈入 3 v
+谈兴 18 vn
+谈兴正浓 3 nr
+谈兵 5 vn
+谈出 3 v
+谈判 3141 vn
+谈判下去 3 nr
+谈判代表 3 n
+谈判桌 83 n
+谈判桌上 3 n
+谈判者 9 n
+谈利空 5 nr
+谈到 1263 v
+谈助 4 vn
+谈及 173 v
+谈古论今 14 l
+谈古说今 3 l
+谈叶子 2 nr
+谈吐 99 vn
+谈吐不凡 3 i
+谈吐之间 3 i
+谈吐生风 3 i
+谈吐诙谐 3 v
+谈吐风生 3 i
+谈命理 2 vn
+谈圆说通 3 i
+谈均田 2 nr
+谈天 31 nr
+谈天说地 23 i
+谈妥 3 v
+谈婚论嫁 3 i
+谈完 3 v
+谈宗英 3 nr
+谈定 3 v
+谈家桢 7 nr
+谈崩 3 v
+谈开 3 v
+谈张炜 2 nr
+谈得 3 v
+谈得上 3 l
+谈得出 3 v
+谈得成 3 v
+谈得来 25 v
+谈心 112 v
+谈心交心 3 i
+谈心会 3 nr
+谈心活动 3 i
+谈性 3 n
+谈恋爱 181 v
+谈情 3 v
+谈情说爱 55 i
+谈成 3 v
+谈拢 3 v
+谈明 3 v
+谈朋友 3 nr
+谈来谈去 3 i
+谈松华 4 nr
+谈柄 3 nr
+谈梦 2 v
+谈法 3 vn
+谈清 3 nr
+谈瀛洲 61 nr
+谈点 3 vn
+谈玄理 3 nr
+谈玄说妙 3 i
+谈空说幻 3 i
+谈空说有 3 i
+谈立宪 2 nr
+谈笑 96 vn
+谈笑之间 3 i
+谈笑封侯 3 nr
+谈笑自如 5 i
+谈笑自若 16 i
+谈笑风声 3 i
+谈笑风生 71 i
+谈绪祥 4 nr
+谈老庄 3 nr
+谈色斑 3 l
+谈艺录 7 nr
+谈艺琐 2 nr
+谈若悬河 3 i
+谈虎色变 32 i
+谈言微中 3 i
+谈议风生 3 n
+谈论 892 vn
+谈论出 3 v
+谈论到 3 l
+谈论着 3 l
+谈论风生 3 i
+谈诗论 2 nr
+谈话 2436 vn
+谈话会 6 l
+谈话室 2 n
+谈话录 7 nr
+谈谈 691 vn
+谈谈心 12 i
+谈谈性 3 n
+谈谈情 3 i
+谈资 26 vn
+谈起 388 v
+谈过其实 3 i
+谈过去 3 l
+谈过来 3 l
+谈道 18 v
+谈钱 3 v
+谈锋 5 nr
+谈锋甚健 3 nr
+谈雪卿 2 nr
+谊 180 ng
+谊不容辞 3 nz
+谊不敢辞 3 nr
+谊切苔岑 3 nr
+谋 1989 v
+谋为不轨 4 i
+谋主 3 v
+谋乱 3 v
+谋事 53 v
+谋事在人 3 n
+谋出路 3 n
+谋划 218 n
+谋利 46 n
+谋利益 3 n
+谋刺 3 v
+谋反 293 v
+谋发展 3 n
+谋取 185 v
+谋取私利 3 i
+谋变 3 v
+谋叛 3 v
+谋听计行 3 i
+谋国 3 n
+谋图不轨 3 i
+谋士 205 n
+谋夫孔多 3 i
+谋女郎 3 n
+谋如涌泉 3 i
+谋定 16 v
+谋定而后 3 i
+谋害 108 v
+谋得 3 v
+谋无遗策 3 i
+谋无遗谞 3 n
+谋杀 354 v
+谋杀案 17 n
+谋杀罪 11 i
+谋杀者 3 n
+谋求 496 v
+谋生 367 v
+谋生不易 3 i
+谋生之道 3 i
+谋略 214 n
+谋略史 3 n
+谋略学 3 n
+谋略家 12 n
+谋略思想 3 n
+谋福利 3 n
+谋私 24 n
+谋私利 3 n
+谋算 3 v
+谋篇 8 n
+谋篇布局 3 n
+谋职 26 v
+谋臣 47 n
+谋臣如雨 3 i
+谋臣武将 3 i
+谋臣猛将 3 i
+谋虑 3 v
+谋虚逐妄 3 n
+谋计 45 v
+谋议 3 n
+谋谟帷幄 3 n
+谋财 3 v
+谋财害命 31 i
+谋道作舍 3 i
+谋陷 3 v
+谋面 42 n
+谌 402 nr
+谌家矶 257 nr
+谌颂謇 2 nr
+谍 27 n
+谍中谍 3 n
+谍员 3 n
+谍报 50 n
+谍报人员 3 n
+谍报员 3 n
+谎 377 ng
+谎价 3 n
+谎张 3 n
+谎报 39 n
+谎报年龄 3 n
+谎称 39 n
+谎花 3 n
+谎言 210 n
+谎话 121 n
+谎语 3 n
+谎骗 3 v
+谏 856 vg
+谏书 3 v
+谏争如流 3 n
+谏劝 3 v
+谏壁镇 2 ns
+谏大夫 3 ns
+谏官 3 v
+谏尸谤屠 3 n
+谏言 5 v
+谏议 3 v
+谏诤 18 v
+谏阻 85 v
+谏院 3 n
+谐 468 ag
+谐函数 3 n
+谐剧 3 n
+谐和 64 a
+谐和感 3 n
+谐声 9 n
+谐戏 3 n
+谐振 147 n
+谐振动 3 n
+谐振器 3 n
+谐振子 15 n
+谐振腔 3 n
+谐星 3 n
+谐波 64 n
+谐波分析 3 n
+谐美 3 a
+谐语 3 n
+谐调 18 n
+谐谑 29 z
+谐谑曲 3 z
+谐趣 7 n
+谐趣园 5 n
+谐音 87 n
+谑 267 g
+谑浪笑傲 3 v
+谑浪笑敖 3 nr
+谑而不虐 3 z
+谒 376 vg
+谒拜 3 v
+谒祖 2 v
+谒见 3 v
+谒陵 21 v
+谓 1211 v
+谓之 3 n
+谓予不信 2 i
+谓何 3 n
+谓者 3 n
+谓词 66 n
+谓词变元 3 n
+谓词演算 3 n
+谓语 60 n
+谓语句 3 n
+谔 92 x
+谕 950 ng
+谕令 80 n
+谕告 3 n
+谕旨 233 n
+谕知 3 n
+谕示 32 n
+谖 109 g
+谗 108 vg
+谗佞 3 n
+谗口铄金 3 vn
+谗嘴 3 n
+谗害 3 n
+谗构 3 n
+谗猫 3 n
+谗言 62 n
+谗言佞语 3 v
+谗间 3 n
+谗陷 3 n
+谗鬼 3 n
+谘 71 g
+谘文 3 nrt
+谘经诹史 3 v
+谘议局 3 v
+谘询费 3 vn
+谙 114 v
+谙习 3 v
+谙晓 3 v
+谙然神山 3 v
+谙熟 34 a
+谙练 5 a
+谙识 3 v
+谙达 37 a
+谚 66 n
+谚语 229 n
+谛 325 v
+谛分审布 3 vn
+谛听 43 v
+谛视 3 v
+谜 1206 n
+谜一样 3 n
+谜儿 3 n
+谜团 86 n
+谜宫 3 n
+谜底 105 n
+谜样 3 n
+谜语 68 n
+谜面 8 n
+谜题 3 n
+谝 365 g
+谞 7 zg
+谟 422 g
+谠 107 g
+谠言嘉论 3 nr
+谠言直声 3 nr
+谠论侃侃 3 nr
+谡 137 g
+谢 2504 v
+谢七爷 2 nr
+谢万岁 6 nr
+谢万谢 3 nr
+谢三哥 21 nr
+谢不当 3 v
+谢世 51 nr
+谢世杰 10 nr
+谢东娜 3 nr
+谢东村 3 nr
+谢东闵 4 nr
+谢中博 10 nr
+谢中堂 7 nr
+谢丹阳 256 nr
+谢丽娟 3 nrfg
+谢义炳 2 nr
+谢之光 7 nr
+谢了恩 22 nr
+谢事表 2 nr
+谢亚龙 44 nr
+谢仪 5 nr
+谢企华 13 nr
+谢伏瞻 257 nr
+谢伦德 2 nr
+谢佑卿 257 nrfg
+谢作炎 2 nr
+谢侠逊 2 nr
+谢俊色 3 nr
+谢兄弟 3 nr
+谢先帝 2 nr
+谢先生 15 nr
+谢光战 3 nr
+谢克尔 7 nr
+谢公公 2 nr
+谢兰燕桂 3 nr
+谢兴国 36 nr
+谢再善 2 nr
+谢函 2 nr
+谢切诺 6 nr
+谢列兹尼奥夫 4 nrt
+谢列尔 2 nr
+谢利夫河 2 nr
+谢利姆 4 nr
+谢力健 2 nr
+谢博翰 2 nr
+谢卡尔 4 nr
+谢卿材 2 nr
+谢君豪 3 nr
+谢哈布 5 nr
+谢国城 3 nr
+谢国忠 9 nr
+谢国明 2 nr
+谢国桢 7 nr
+谢国祥 4 nr
+谢国祯 2 nr
+谢国虎 5 nr
+谢国雄 2 nr
+谢培哲 3 nr
+谢多夫 10 nr
+谢大人 3 nr
+谢大侠 61 nr
+谢大夫 4 nr
+谢大帅 5 nr
+谢大玉 4 nr
+谢天华 3 nr
+谢天恩 5 nr
+谢天笑 3 nr
+谢天谢地 171 i
+谢太后 29 nr
+谢夫莱 2 nr
+谢夫隆 5 nr
+谢夷吾 2 nr
+谢好 3 v
+谢娘子 2 nr
+谢婉莹 2 nr
+谢婷婷 3 nr
+谢子长 4 nr
+谢孝 2 nr
+谢安之 2 nr
+谢安任 4 nr
+谢安兄 2 nr
+谢安平 2 nr
+谢安累 4 nr
+谢宋江 2 nr
+谢宗信 2 nr
+谢定 3 v
+谢客 13 nr
+谢家 320 nrfg
+谢家婆 9 nr
+谢家宝树 3 nr
+谢家小子 18 nr
+谢家就 2 nr
+谢家树 3 nr
+谢家泽 2 nr
+谢家活计 3 i
+谢家荣 2 nr
+谢家集区 3 nr
+谢家骥 23 nr
+谢家骧 9 nr
+谢家麟 3 nr
+谢富治 314 nr
+谢小姐 3 nr
+谢尔久 2 nr
+谢尔伍 6 nr
+谢尔兹 16 nr
+谢尔博 2 nr
+谢尔宾 3 nr
+谢尔曼 18 nr
+谢尔瓦 2 nr
+谢尔盖 34 nr
+谢尔盖耶夫 5 nr
+谢尔福德 2 nr
+谢尔顿 5 nr
+谢尚政 13 nr
+谢尼埃 2 nr
+谢居士 13 nr
+谢巡抚 4 nr
+谢巴尼 3 nr
+谢师宴 3 nr
+谢师父 2 nr
+谢希德 10 nr
+谢帖 3 nr
+谢幕 72 nr
+谢应芳 4 nr
+谢庭兰玉 3 nr
+谢康乐 2 nr
+谢康生 2 nr
+谢建东 2 nr
+谢弗勒 2 nr
+谢德曼 10 nr
+谢德林 6 nr
+谢志伟 2 nr
+谢志光 2 nr
+谢忱 8 nr
+谢恩 519 nr
+谢惠连 2 nr
+谢意 88 v
+谢慧敏 3 nr
+谢承你 2 nr
+谢抚台 2 nr
+谢押司 2 nr
+谢拉 8 nr
+谢拉特 3 nr
+谢持 12 v
+谢振华 2 nr
+谢政委 2 nr
+谢文东 2 nr
+谢文州 2 nr
+谢方校 2 nr
+谢方立 12 nr
+谢方芳 4 nr
+谢无忌 4 i
+谢旭人 3 nr
+谢旭峰 3 nr
+谢明斯 2 nr
+谢晋元 3 nr
+谢晓东 2 nr
+谢晓峰 3 nr
+谢普苏 17 nr
+谢景新 113 nr
+谢本义 9 nr
+谢李密 3 nr
+谢杏芳 252 nr
+谢杭生 6 nr
+谢枋得 4 nr
+谢林汉 9 nr
+谢林电桥 3 nz
+谢柬之 2 nr
+谢树仁 17 nr
+谢氏功 2 nr
+谢法王 10 nr
+谢泼德 8 nr
+谢淑琴 2 nrfg
+谢清志 4 nr
+谢清斋 121 nr
+谢温谕 2 nr
+谢灵运 39 nr
+谢灵顿 9 nr
+谢烟客 315 nr
+谢爱光 104 nr
+谢狮王 11 nr
+谢猎者 2 nr
+谢玄任 2 nr
+谢玄加 2 nr
+谢率兵 2 nr
+谢玉堂 2 nr
+谢王爷 4 nr
+谢瑞麟 3 nr
+谢瓦尔德纳 2 nrt
+谢瓦尔德纳泽 34 nrt
+谢瓦莱 2 nr
+谢瓦莱群 3 nr
+谢甫琴 3 nr
+谢电 3 v
+谢病 3 nr
+谢百三 3 nr
+谢皇恩 258 nr
+谢皮利 3 nr
+谢皮诺 2 nr
+谢礼 19 nr
+谢祯祥 2 nr
+谢福畴 12 nr
+谢秋思 132 nr
+谢答 3 v
+谢米亚 6 nr
+谢米列 2 nr
+谢红杰 2 nr
+谢绝 141 v
+谢绝参观 3 i
+谢绝来访 3 i
+谢维扬 2 nr
+谢罗夫 13 nr
+谢罪 153 v
+谢美华 5 nr
+谢老爷 6 nr
+谢老爷子 6 nr
+谢耶夫 9 nr
+谢联辉 2 nr
+谢联队 3 nr
+谢良佐 2 nr
+谢苗诺 3 nr
+谢苗诺夫 11 nrt
+谢若萍 215 nr
+谢莫林 4 nr
+谢菲尔德 30 nrt
+谢菲联 19 nr
+谢落 2 v
+谢虎臣 8 nr
+谢觉哉 4 nr
+谢词 3 nr
+谢诺阿 2 nr
+谢谢 1089 nr
+谢谢你们 3 nr
+谢谢合作 3 i
+谢谢您 3 nr
+谢贝利 13 nr
+谢贾耶 3 nr
+谢赫 26 nr
+谢赫山 2 nr
+谢辞 4 nr
+谢辰生 3 nr
+谢过 3 v
+谢过恩 4 nr
+谢迪赫 2 nr
+谢逊举 2 nr
+谢逊冷 4 nr
+谢逊双 2 nr
+谢逊取 2 nr
+谢逊右 3 nr
+谢逊叹 16 nr
+谢逊啸 2 nr
+谢逊奇 2 nr
+谢逊微微 3 nr
+谢逊忽 8 nr
+谢逊恶 3 nr
+谢逊抚 2 nr
+谢逊拳 2 nr
+谢逊掌 2 nr
+谢逊攻 2 nr
+谢逊朗 3 nr
+谢逊横 3 nr
+谢逊站 2 nr
+谢逊竟 2 nr
+谢逊笑 13 nr
+谢逊续 5 nr
+谢逊若 4 nr
+谢逊跃 2 nr
+谢逊身 4 nr
+谢逊连 2 nr
+谢逊面 2 nr
+谢逊驱 2 nr
+谢通门 3 nr
+谢通门县 3 ns
+谢遐龄 2 nr
+谢道韫 3 nr
+谢里丹 8 nr
+谢里夫 27 nr
+谢里夫派 2 nr
+谢里姆 14 nr
+谢里曼 9 nr
+谢里登 6 nr
+谢金德 2 nr
+谢金燕 3 nr
+谢金虎 2 nr
+谢铁骊 4 nr
+谢长廷 28 nr
+谢雨欣 3 nr
+谢雪桥 2 nr
+谢霆峰 3 nr
+谢霆锋 6 nr
+谢顶 20 nr
+谢顺吉 3 nr
+谢馆秦楼 3 n
+谢首辅 2 nr
+谢香如 2 nr
+谢香斋 18 nr
+谢鸪档 4 nr
+谢鸪翟 2 nr
+谢黄帮 2 nr
+谣 110 n
+谣传 98 n
+谣俗 3 n
+谣言 574 n
+谣言惑众 2 n
+谣言止于 3 l
+谣言满天 3 l
+谣诼 10 n
+谣谚 10 n
+谣风 3 n
+谤 80 zg
+谤议 3 v
+谥 387 vg
+谥号 78 n
+谦 567 nr
+谦冲 8 v
+谦卑 50 a
+谦厚有礼 3 i
+谦受益 3 i
+谦和 101 a
+谦尊而光 3 i
+谦恭 151 a
+谦恭下士 9 i
+谦恭地 3 i
+谦恭有礼 7 i
+谦抑 3 v
+谦称 7 a
+谦虚 290 a
+谦虚敬慎 3 i
+谦虚有礼 3 i
+谦虚谨慎 60 i
+谦让 134 v
+谦词 3 n
+谦诚 3 a
+谦谦君子 17 i
+谦躬下士 3 i
+谦辞 13 v
+谦退 3 v
+谦逊 249 a
+谦逊地 3 l
+谦逊有礼 3 l
+谦顺 3 a
+谧 65 g
+谨 853 d
+谨严 58 a
+谨于此 3 i
+谨以 3 v
+谨以此文 3 i
+谨向 3 a
+谨启 3 v
+谨呈 3 v
+谨备菲酌 3 i
+谨始虑终 3 i
+谨守 3 a
+谨守诺言 3 i
+谨小慎微 52 i
+谨愿 3 v
+谨慎 1131 a
+谨慎从事 3 i
+谨本详始 3 vn
+谨此 3 i
+谨毛失貌 3 i
+谨禀 3 v
+谨终如始 3 i
+谨终慎始 3 i
+谨而慎之 3 i
+谨致 3 a
+谨致谢意 3 i
+谨行俭用 3 i
+谨言慎行 23 i
+谨言慎语 3 i
+谨记 3 v
+谨记在心 3 v
+谨谢不敏 3 i
+谨身 3 a
+谨身节用 3 i
+谨防 77 v
+谨防假冒 3 i
+谨防扒手 3 i
+谨领 3 v
+谨饬 3 v
+谩 246 v
+谩不经意 3 n
+谩天昧地 3 n
+谩天谩地 3 z
+谩藏诲盗 3 vn
+谩辞哗说 3 vn
+谩骂 98 v
+谩骂者 3 n
+谪 82 vg
+谪仙 3 v
+谪居 16 v
+谪戍 17 v
+谪迁 3 v
+谪降 3 v
+谫 3 g
+谬 169 nr
+谬之千里 2 l
+谬以千里 4 l
+谬传 3 n
+谬奖 9 n
+谬妄无稽 3 l
+谬悠 3 v
+谬想天开 3 l
+谬托知己 3 n
+谬种 8 n
+谬种流传 3 l
+谬见 3 n
+谬论 99 n
+谬误 267 n
+谬说 7 n
+谬赞 12 n
+谬采虚声 3 n
+谬采虚誉 3 n
+谭 541 zg
+谭中岳 2 nr
+谭人凤 14 nr
+谭从其 3 nr
+谭仲麟 16 nr
+谭元春 257 nr
+谭入朝 2 nr
+谭公听 2 nr
+谭其骧 22 nr
+谭利华 3 nr
+谭博文 3 nr
+谭嗣同 264 nr
+谭国器 6 nr
+谭处端 44 nr
+谭大人 14 nr
+谭大怒 2 nr
+谭天说地 3 nr
+谭太尉 4 nr
+谭奉明 2 nr
+谭婆怒 3 nr
+谭子拐 256 nr
+谭学明 2 nr
+谭宗亮 5 nr
+谭家 260 nrfg
+谭家冲 2 nr
+谭家洲 256 nr
+谭家渊 257 nr
+谭家菜 2 nr
+谭富英 12 nr
+谭小培 2 nr
+谭小环 3 nr
+谭师弟 3 nr
+谭希思 2 nr
+谭平山 50 nr
+谭庆山 2 nr
+谭廷襄 2 nr
+谭建政 4 nr
+谭德下村 3 nr
+谭慎格 8 nr
+谭慧艳 3 nr
+谭文华 9 nr
+谭文博 7 nr
+谭文理 3 nr
+谭新杰 2 nr
+谭方之 2 nr
+谭旭光 3 nr
+谭昌盛 3 nr
+谭晓文 9 nr
+谭晶华 4 nr
+谭望嵩 59 nr
+谭望蒿 2 nr
+谭正壁 2 nr
+谭武军 3 nr
+谭歪嘴 2 nr
+谭浩强 3 nr
+谭炎午 2 nr
+谭爱英 2 nr
+谭瑞来 3 nr
+谭盾 5 nr
+谭耀文 3 nr
+谭耀铭 5 nr
+谭良德 2 nr
+谭言微中 3 nr
+谭迪人 3 nr
+谭道源 3 nr
+谭道长 2 nr
+谭量顺 8 nr
+谭金根 2 nr
+谭鑫培 37 nr
+谭钟麟 24 nr
+谭震林 117 nr
+谭非翎 3 nr
+谮 20 g
+谮下谩上 3 z
+谯 111 nr
+谯城区 3 ns
+谯楼 13 n
+谰 30 n
+谰言 4 n
+谱 2254 v
+谱上去 3 v
+谱上来 3 v
+谱下去 3 v
+谱下来 3 v
+谱仪 19 n
+谱估计 3 n
+谱儿 24 n
+谱写 121 v
+谱写成 3 v
+谱出来 3 v
+谱分析 30 n
+谱号 11 n
+谱同调 3 n
+谱子 9 n
+谱成 3 v
+谱成乐曲 3 n
+谱扰动 3 n
+谱新声 3 n
+谱曲 28 n
+谱架 3 n
+谱牒 35 n
+谱系 51 n
+谱线增宽 3 n
+谱线宽度 3 vn
+谱线黑度 3 n
+谱表 20 n
+谱项 3 n
+谲 39 zg
+谲怪之谈 3 v
+谲而不正 3 z
+谳 47 g
+谴 166 v
+谴责 1222 v
+谵妄 35 n
+谵语 22 n
+谶 213 n
+谶书 3 n
+谶纬 73 n
+谶言 3 n
+谶语 43 n
+谷 3461 nr
+谷一石 2 nr
+谷两石 2 nr
+谷中世 2 nr
+谷中众 2 nr
+谷中传 2 nr
+谷中养 2 nr
+谷中初 2 nr
+谷中尚 2 nr
+谷中带 2 nr
+谷中张 2 nr
+谷中花 2 nr
+谷中诸 3 nr
+谷中闹 2 nr
+谷主 219 n
+谷主之 2 nr
+谷主允 2 nr
+谷主双 3 nr
+谷主叹 2 nr
+谷主命 2 n
+谷主微微 3 nr
+谷主怒 2 nr
+谷主敬 2 nr
+谷主沉 2 nr
+谷主站 2 n
+谷主竟 2 nr
+谷主笑 2 nr
+谷主终 2 nr
+谷主背 4 n
+谷主防 2 n
+谷之主 2 nr
+谷二仙 5 nr
+谷五仙 28 nr
+谷五怪 3 nr
+谷五郡 2 nr
+谷仓 48 nr
+谷克多 2 nr
+谷八友 10 nr
+谷六仙 310 nr
+谷六小子 2 nr
+谷六鬼 3 nr
+谷关 3 ns
+谷内敏美 4 ns
+谷冰川 2 nr
+谷则 2 n
+谷利源 12 nr
+谷前谷 2 nr
+谷医仙 26 nr
+谷口 135 n
+谷可成 39 nr
+谷叶子 3 nr
+谷司令 2 nr
+谷同进 2 nr
+谷和郭 2 nr
+谷四仙 29 nr
+谷四郡 3 nr
+谷囤 3 n
+谷固醇 3 nr
+谷地 723 n
+谷场 3 n
+谷坊 3 n
+谷坛 7 n
+谷垣祯 2 nr
+谷城 227 ns
+谷城县 264 ns
+谷堆 6 n
+谷壁 3 n
+谷壁呈 2 nr
+谷壳 7 n
+谷壳分离 3 n
+谷大用 7 nr
+谷头 2 n
+谷头子 7 n
+谷子 384 n
+谷守边 3 nr
+谷实 3 n
+谷宽水 2 nr
+谷寿夫 4 nr
+谷少佐 2 nr
+谷山寨 2 nr
+谷崎 2 ns
+谷川 3 ns
+谷川俊 2 nr
+谷平原 3 ns
+谷底 280 t
+谷建芬 257 nr
+谷德带 5 nr
+谷振江 2 nr
+谷斑皮蠹 5 n
+谷斯根 2 nr
+谷昌平 2 nr
+谷朱庆 6 nr
+谷朱庆道 2 nr
+谷李香 3 nr
+谷村新司 3 nr
+谷梁 28 nr
+谷梁传 3 nr
+谷正想 2 nr
+谷正纲 3 nr
+谷氏菌素 3 n
+谷氨 3 n
+谷氨酰胺 3 nz
+谷氨酸 93 n
+谷氨酸钠 3 nz
+谷水仙 2 nr
+谷永曾 2 nr
+谷津 3 ns
+谷深崖 3 nr
+谷深林 2 nr
+谷深流 6 nr
+谷深涧 2 nr
+谷深达 3 nr
+谷源冰 2 nr
+谷源洋 2 nr
+谷满仓 2 nr
+谷燕山 90 nr
+谷父蚕母 3 nr
+谷物 696 n
+谷特洛 2 nr
+谷王朱 2 nr
+谷瑞玉 7 nr
+谷甾醇 3 nz
+谷登堡 18 nr
+谷皮 3 n
+谷祖琳 3 nr
+谷神 8 n
+谷神星 3 nr
+谷神节 2 nr
+谷禄制 4 nr
+谷种 13 n
+谷秕 3 n
+谷穗 9 nr
+谷类 69 n
+谷类作物 22 l
+谷粒 17 n
+谷粱 2 n
+谷精草 9 nr
+谷糠 11 nr
+谷纯悦 3 nr
+谷维素 2 nr
+谷缘 2 n
+谷肩 2 n
+谷胱甘 9 nr
+谷胱甘肽 3 n
+谷胱苷肽 3 n
+谷胺酰胺 3 nz
+谷舱 3 n
+谷花鱼 2 nr
+谷苗 5 n
+谷草 5 n
+谷蛋白 3 nr
+谷蠡王 5 nr
+谷西自 2 nr
+谷诸怪 2 nr
+谷读之 2 nr
+谷谷主 2 nr
+谷象 2 n
+谷贱 2 n
+谷贱伤农 6 nr
+谷贵则 2 nr
+谷贵时 2 nr
+谷超豪 3 nr
+谷路程 4 n
+谷转运 2 nr
+谷钟秀 2 nr
+谷隐居 2 nr
+谷雀 3 n
+谷雨节 2 nr
+谷霁光 2 nr
+谷音 3 n
+谷马砺兵 3 nr
+谷麦总 2 nr
+谹 2 zg
+谻 2 zg
+谿 26 zg
+谿壑 3 v
+谿谷 3 v
+豀 4 zg
+豁 211 v
+豁上 3 v
+豁亮 15 a
+豁人耳目 3 i
+豁免 131 v
+豁免权 29 n
+豁出 189 v
+豁出去 28 i
+豁出来 3 i
+豁口 53 n
+豁口截舌 3 i
+豁嘴 7 v
+豁子 2 n
+豁开 3 v
+豁拳 3 n
+豁朗 18 a
+豁然 195 d
+豁然冰释 3 i
+豁然大悟 3 i
+豁然天成 3 i
+豁然开悟 3 i
+豁然开朗 73 i
+豁然省悟 3 i
+豁然确斯 3 n
+豁然贯通 20 i
+豁然醒悟 3 n
+豁然顿悟 3 i
+豁牙 3 v
+豁脣子 3 v
+豁边 3 d
+豁达 153 a
+豁达大度 31 i
+豆 2483 n
+豆丝 2 n
+豆乳 3 n
+豆儿 2 n
+豆分瓜剖 3 i
+豆制品 76 n
+豆制品厂 3 n
+豆剖瓜分 3 n
+豆包 30 n
+豆叶 4 n
+豆固醇 2 n
+豆壳 3 n
+豆天蛾 2 n
+豆奶 40 n
+豆奶粉 3 n
+豆子 101 n
+豆梨 3 n
+豆汁 36 n
+豆沙 22 n
+豆沙包 2 n
+豆沙月饼 3 n
+豆沙陷 3 n
+豆沙饼 3 n
+豆油 21 n
+豆浆 114 n
+豆浆店 3 n
+豆浆机 3 n
+豆渣 5 n
+豆渣饼 3 n
+豆牙 3 n
+豆状 3 n
+豆球蛋白 3 n
+豆瓣 23 n
+豆瓣儿 3 n
+豆瓣儿酱 3 n
+豆瓣菜 3 n
+豆瓣酱 10 n
+豆种 3 n
+豆科 133 n
+豆科作物 3 n
+豆科植物 3 n
+豆秧 3 n
+豆秸 2 n
+豆类 280 n
+豆类植物 3 n
+豆类蔬菜 3 nz
+豆粉 3 n
+豆粒 24 n
+豆粕 41 n
+豆糕 3 n
+豆素 3 n
+豆绿 4 n
+豆腐 1078 n
+豆腐乳 11 n
+豆腐乾 3 ns
+豆腐坊 4 n
+豆腐块 71 n
+豆腐干 42 n
+豆腐店 6 n
+豆腐心 6 n
+豆腐房 4 n
+豆腐机 3 n
+豆腐汤 3 n
+豆腐渣 31 n
+豆腐渣工程 13 n
+豆腐皮 15 n
+豆腐粉 3 n
+豆腐脑 8 n
+豆腐脑儿 4 n
+豆腐节 2 n
+豆腐花 3 n
+豆腐衣 3 n
+豆腥味 4 n
+豆花 16 n
+豆花汤 3 n
+豆芽 53 n
+豆芽儿 3 n
+豆芽菜 15 n
+豆苗 5 n
+豆茎 3 n
+豆荚 30 n
+豆菜 3 n
+豆萁 2 n
+豆萁燃豆 3 nz
+豆萁相煎 3 n
+豆蓉 3 n
+豆蓉月饼 3 nr
+豆蔻 26 n
+豆蔻基 3 nr
+豆蔻年华 8 i
+豆蔻酸 3 i
+豆薯 10 n
+豆藤 3 n
+豆螺科 2 n
+豆角 50 n
+豆角儿 3 n
+豆豆 3 n
+豆豆龙 3 nr
+豆豉 30 n
+豆象 3 n
+豆象科 2 nr
+豆酱 11 n
+豆青 3 nr
+豆面 12 n
+豆饼 10 n
+豇 3 n
+豇豆 36 n
+豉 9 x
+豉汁 2 n
+豊 10 zg
+豌 4 n
+豌豆 789 n
+豌豆粉 6 n
+豌豆苗 3 n
+豌豆荚 3 n
+豌豆象 3 n
+豌豆黄 11 n
+豐 88 zg
+豕 52 zg
+豕分蛇断 3 i
+豕窜狼逋 3 nr
+豕虎传讹 3 i
+豕食丐衣 3 vn
+豚 98 n
+豚草 3 n
+豚蹄穰田 3 v
+豚鼠 13 n
+豝 3 zg
+豞 37 zg
+豟 5 zg
+象 8475 n
+象不象 3 l
+象传 3 v
+象名 3 v
+象园街道 3 ns
+象场弯曲 3 v
+象声 3 n
+象声词 11 l
+象山 319 ns
+象山区 2 ns
+象山县 11 ns
+象山港 9 ns
+象屿 3 n
+象州 8 ns
+象州县 5 ns
+象差 3 n
+象平面 3 n
+象形 71 n
+象形字 18 l
+象形文 3 n
+象形文字 81 l
+象征 4233 v
+象征主义 3 n
+象征性 189 n
+象征意义 3 n
+象征派 27 n
+象征物 5 n
+象征能力 3 n
+象徵主义 3 vn
+象徵性 3 vn
+象徵着 3 y
+象拔 3 n
+象拔蚌 3 n
+象散 3 v
+象方焦点 3 n
+象方空间 3 n
+象是 897 v
+象极了 3 l
+象样 3 n
+象样儿 3 l
+象棋 182 v
+象棋赛 2 n
+象棋队 8 n
+象泉河 6 ns
+象湖 8 ns
+象爬虫 3 n
+象牙 334 ns
+象牙之塔 7 n
+象牙塔 32 ns
+象牙宝塔 3 ns
+象牙杖 3 n
+象牙海岸 3 ns
+象牙片 3 n
+象牙白 3 l
+象牙者 3 n
+象牙色 5 n
+象牙质 3 n
+象牙针尖 3 l
+象生 3 v
+象皮 4 n
+象眼 3 n
+象笏 3 i
+象管 3 v
+象箸玉杯 3 ns
+象素 8 n
+象素数 3 n
+象耕鸟耘 3 n
+象脚鼓 7 n
+象蜗牛 3 vn
+象角村 5 ns
+象话 24 v
+象距 3 n
+象银一样 3 l
+象限 46 n
+象限仪 3 n
+象雄 10 n
+象马 3 ns
+象鼻 3 v
+象鼻子 2 n
+象鼻山 5 ns
+象鼻虫 2 n
+象齿焚身 3 vn
+豢 215 vg
+豢养 48 v
+豨 19 n
+豨莶草 3 vn
+豪 1182 n
+豪举 8 n
+豪伊 9 nrt
+豪侠 47 n
+豪侠传 3 n
+豪光不减 3 i
+豪克 2 nrt
+豪兴 16 a
+豪勇 3 a
+豪华 1043 a
+豪华团 63 n
+豪华型 29 n
+豪华气派 3 n
+豪华游 11 n
+豪华版 3 n
+豪华设施 3 n
+豪华车 3 n
+豪华轿车 3 n
+豪华酒店 3 n
+豪取智笼 3 n
+豪右 3 nrt
+豪商 3 n
+豪商巨贾 5 n
+豪士 47 n
+豪壮 32 a
+豪夫 2 nrt
+豪夺 4 v
+豪夺巧取 3 i
+豪奇 3 nrt
+豪奢 87 a
+豪奢放逸 3 i
+豪宅 129 n
+豪客 91 n
+豪客来 3 i
+豪宴 3 n
+豪富 73 a
+豪尔 3 nrt
+豪尔赫 2 nrt
+豪峰 3 n
+豪干暴取 3 i
+豪强 279 a
+豪快 3 a
+豪性 3 n
+豪情 120 n
+豪情万丈 3 i
+豪情壮举 3 i
+豪情壮志 14 i
+豪情满怀 3 i
+豪情逸致 3 i
+豪放 116 v
+豪放不羁 6 i
+豪放女 3 n
+豪放派 12 n
+豪斯 92 nrt
+豪斯曼 3 nrt
+豪族 60 n
+豪无 3 v
+豪杰 496 nrt
+豪杰墓 3 i
+豪杰解霸 3 i
+豪格 131 n
+豪森 11 nrt
+豪横 3 a
+豪横跋扈 3 i
+豪歌壮鼓 2 i
+豪氏钳 3 n
+豪气 149 n
+豪气万丈 3 i
+豪气万千 3 i
+豪气吞云 3 i
+豪爽 164 a
+豪特 6 nrt
+豪猪 28 n
+豪福 3 nrt
+豪竹哀丝 3 i
+豪管哀弦 3 i
+豪绅 72 n
+豪耀 2 a
+豪英 3 nrt
+豪萨 3 nrt
+豪萨族 4 nz
+豪言 14 n
+豪言壮语 48 i
+豪语 3 n
+豪赌 28 v
+豪迈 212 a
+豪迈不群 3 ns
+豪门 144 n
+豪门子弟 3 n
+豪门巨室 3 n
+豪门贵胄 3 n
+豪阔 33 a
+豪雄 3 n
+豪雨 9 n
+豪雨成灾 3 i
+豪饮 27 n
+豫 907 ns
+豫东 144 ns
+豫东平原 7 ns
+豫先 3 n
+豫剧 72 n
+豫剧团 4 n
+豫北 84 ns
+豫北攻势 3 n
+豫南 66 ns
+豫园 49 ns
+豫州 78 ns
+豫港 3 ns
+豫章 30 ns
+豫西 174 ns
+豫西南 267 ns
+豫见 3 n
+豫鄂 29 j
+豬 2 zg
+豳 31 g
+豴 8 zg
+豸 7 g
+豹 761 n
+豹头环眼 3 n
+豹子 374 n
+豹子头 3 n
+豹子胆 3 n
+豹死留皮 3 n
+豹猫 13 n
+豹皮 3 n
+豹皮帽 3 n
+豹纹 3 n
+豹蛙肽 3 nz
+豹骨 3 n
+豺 50 zg
+豺死留皮 3 l
+豺狐之心 3 i
+豺狗 3 n
+豺狼 93 n
+豺狼之吻 3 n
+豺狼塞路 3 n
+豺狼当涂 3 i
+豺狼当路 3 l
+豺狼当道 3 l
+豺狼成性 3 l
+豺狼横道 3 i
+豺狼虎豹 7 i
+豺狼野心 3 i
+豺虎肆虐 3 i
+豽 14 zg
+貀 16 zg
+貂 389 n
+貂婵 5 n
+貂熊 3 n
+貂狗相属 3 n
+貂皮 89 n
+貂皮大衣 3 n
+貂皮帽 3 n
+貂禅 3 n
+貂蝉 8 n
+貂蝉满座 3 v
+貂裘 41 n
+貂裘换酒 3 nz
+貂鼠 3 n
+貅 2 x
+貇 4 zg
+貉 86 ng
+貉子 6 n
+貉绒 2 n
+貊 20 g
+貊乡鼠壤 3 n
+貌 870 ng
+貌不惊人 27 i
+貌主才辅 3 i
+貌仓 3 v
+貌似 101 v
+貌似公正 3 i
+貌似强大 8 i
+貌合 3 v
+貌合形离 3 i
+貌合心离 3 i
+貌合情离 3 i
+貌合神离 9 i
+貌合行离 3 i
+貌寝 3 v
+貌是心非 3 i
+貌是情非 3 i
+貌相 3 v
+貌离神合 3 i
+貌美 3 v
+貌美如花 3 i
+貌若 3 v
+貌若天仙 3 i
+貍奴 3 nrt
+貍猫 3 nz
+貒 2 zg
+貔 7 n
+貔虎 3 n
+貔貅 10 n
+貘 45 g
+貜 559 zg
+財 5 zg
+貥 14 zg
+貧 192 zg
+貫 49 zg
+費 5 zg
+貼 4 zg
+賁 6 zg
+資 7 zg
+賍 140 zg
+賛 2 zg
+賨 151 zg
+賬 250 zg
+購 1875 zg
+贇 21 zg
+贌 2 zg
+贏 3 zg
+贔 2 zg
+贝 836 zg
+贝专纳 18 nr
+贝丘 2 nr
+贝丘遗址 7 n
+贝丹意 3 nr
+贝义渊 2 nr
+贝亚 3 ns
+贝亚特 2 nr
+贝京 13 ns
+贝人龙 23 nr
+贝伊 6 nrt
+贝伦斯 3 nr
+贝伦迦尔 2 nr
+贝佳斯 3 nr
+贝克 84 nr
+贝克兰 2 nr
+贝克勒尔 3 nrt
+贝克勒耳 3 nr
+贝克姆 4 nr
+贝克将军 2 nr
+贝克尔 26 nr
+贝克斯 2 nr
+贝克曼 5 nr
+贝克汉姆 89 nr
+贝克特 27 nr
+贝克莱 37 nr
+贝克韦尔 7 nrt
+贝兰加 2 nr
+贝内利 4 nr
+贝内特 19 nr
+贝内特角 3 nz
+贝内索 2 nr
+贝凯普 2 nr
+贝利亚 26 ns
+贝利亚尔 2 nrt
+贝利尼 16 nr
+贝利斯 8 nr
+贝加尔 34 nr
+贝加尔湖 90 ns
+贝加莫 2 nr
+贝加雷 2 nr
+贝努利 4 nr
+贝努埃 21 nr
+贝勒 243 nr
+贝勒人 3 nr
+贝勒代 9 nr
+贝勒寨 2 nr
+贝勒尔 2 nr
+贝勒庙 2 nr
+贝勒府 19 nr
+贝勒斯 2 nr
+贝勒清 2 nr
+贝勒爷 46 nr
+贝勒皇 2 nr
+贝勒者 2 nr
+贝勒莽 3 nr
+贝勒贝 2 nr
+贝勒阿 13 nr
+贝勒阿敏 2 nr
+贝卡里 5 nrt
+贝原俊 2 nr
+贝可勒尔 23 nr
+贝叶 8 nr
+贝叶斯 22 nr
+贝叶树 3 nr
+贝叶经 8 nr
+贝司 2 n
+贝司手 3 nr
+贝和诺 3 nr
+贝器 2 n
+贝因美 3 nr
+贝坦森 2 nr
+贝城 3 ns
+贝塔 11 nrt
+贝塔射线 3 nz
+贝塔斯曼 11 nrt
+贝塔朗 4 nr
+贝塔朗菲 3 nrt
+贝塔粒子 3 nr
+贝塞尔 42 nr
+贝塞麦 18 nr
+贝壳 325 nr
+贝壳屋 3 n
+贝壳状 17 n
+贝壳类 3 n
+贝壳馆 4 n
+贝复济 3 nr
+贝多 3 nrt
+贝多芬 124 nr
+贝大夫 12 nr
+贝奈斯 14 nr
+贝奥 2 nrt
+贝奥武 2 nr
+贝娜齐尔 2 nr
+贝子分 3 nr
+贝子庙 4 nr
+贝子府 2 nr
+贝子爷 2 nr
+贝子花园 2 nr
+贝宁 182 nr
+贝宁共和国 10 ns
+贝宁湾 7 nr
+贝宝 3 nr
+贝尔 695 nr
+贝尔加拉 2 nrt
+贝尔实验室 28 nz
+贝尔岛 8 nr
+贝尔德 12 nr
+贝尔托 2 nr
+贝尔斯 16 nr
+贝尔曼 18 nr
+贝尔根 4 nr
+贝尔格 5 nr
+贝尔格莱德 143 nrt
+贝尔法 3 nr
+贝尔法斯特 29 nrt
+贝尔湖 10 nr
+贝尔特 4 nr
+贝尔福 16 nr
+贝尔纳 19 nr
+贝尔纳斯 6 nrt
+贝尔茨 23 nrt
+贝尔莫潘 6 nrt
+贝尔萨 3 nr
+贝尔蒂 6 nr
+贝尔蒂尼 3 nrt
+贝尔蒙 4 nr
+贝尔金 3 nr
+贝尼克 4 nr
+贝尼奇 7 nr
+贝尼奥 4 nr
+贝尼奥夫 9 nrt
+贝尼尼 25 nr
+贝尼托 5 nr
+贝尼格 2 nr
+贝尼河 4 nr
+贝尼特 8 nr
+贝尼玛 4 nr
+贝尼纳 2 nr
+贝岑贝 2 nr
+贝岑贝格 3 nr
+贝岛 2 ns
+贝州 2 ns
+贝州王 6 nr
+贝币 10 n
+贝布托 3 nr
+贝希斯 9 nr
+贝希特 5 nr
+贝应夔 3 nr
+贝弗利 4 nr
+贝弗里 4 nrt
+贝当 3 nrt
+贝德尔 2 nr
+贝思福 22 nr
+贝恩哈 8 nr
+贝恩斯 4 nr
+贝扎 3 nrt
+贝托莱 4 nr
+贝拉 37 nrt
+贝拉一世 6 nrt
+贝拉坝 3 nr
+贝拉尔 4 nr
+贝拉斯克斯 2 nrt
+贝拉斯科 8 nrt
+贝拉港 2 ns
+贝拉维 6 nr
+贝拿勒斯 12 ns
+贝斯 8 nr
+贝斯基 2 nr
+贝斯手 3 nr
+贝斯提 6 nr
+贝斯特 12 nr
+贝族 3 nz
+贝时璋 4 nr
+贝朗瑞 3 nr
+贝林格 5 nr
+贝柴 2 nz
+贝格 46 nrt
+贝格可 3 nr
+贝格尔 15 nr
+贝格拉 2 nr
+贝格曼 14 nr
+贝桑松 10 nr
+贝母 343 nr
+贝母属碱 3 n
+贝母花 3 nr
+贝氏体 3 nr
+贝氏立 2 nr
+贝氏莫 2 nr
+贝汉津 10 nr
+贝沙坦 8 nr
+贝洛克 2 nr
+贝洛奥里藏特 10 nrt
+贝济埃 2 nr
+贝海石 249 nr
+贝特 21 nrt
+贝特加 5 nr
+贝特南 2 nr
+贝特森 4 nr
+贝特洛 3 nr
+贝瑞特 3 nr
+贝瓦尔 2 nr
+贝登堡 3 nr
+贝监参 3 nr
+贝目 2 n
+贝祖著 8 nr
+贝祖诒 4 nr
+贝第斯 2 nr
+贝类 209 n
+贝纳尔 2 nr
+贝纳文 2 nr
+贝纳永 7 nr
+贝纳特 4 nr
+贝纳通 2 nr
+贝维勒 2 nr
+贝聿铭 17 nr
+贝肯鲍尔 12 nr
+贝色麻 3 nr
+贝若特 4 nr
+贝茨 3 nrt
+贝莎 3 nrt
+贝莱特 3 nr
+贝莱蒂 4 nr
+贝萨里 8 nr
+贝蒂尼 3 nr
+贝蒂数 3 nr
+贝蒂斯 18 nr
+贝蕾帽 3 n
+贝藻类 6 nr
+贝虾类 2 nr
+贝西 3 ns
+贝赫切 2 nr
+贝超科 3 nr
+贝辛格 3 nr
+贝达尔 2 nr
+贝迪埃 2 nr
+贝迪斯 3 nr
+贝采利 25 nr
+贝采里 6 nr
+贝里 89 nrt
+贝里尼 3 nr
+贝里斯 2 nrt
+贝里曼 2 nr
+贝里沙 2 nr
+贝锦仪 20 nr
+贝锦萎菲 3 n
+贝阙珠宫 3 nr
+贝阿塔 5 nr
+贝阿德 10 nr
+贝雕 34 nr
+贝雷帽 29 nz
+贝雷桥 4 nr
+贝青乔 2 nr
+贝马斯 9 nr
+贝鲁奇 3 nr
+贝鲁姆 6 nr
+贝鲁斯 3 nr
+贝鲁斯科 8 nrt
+贝鲁特 77 nr
+贝齐布 2 nr
+贝龙根 7 nr
+贞 418 nz
+贞下起元 3 nz
+贞不绝俗 3 l
+贞丰 4 nz
+贞丰县 3 nr
+贞元 80 nz
+贞元会合 3 nz
+贞卜文字 3 l
+贞固 3 nz
+贞夫烈妇 3 nr
+贞女 10 n
+贞妇 3 n
+贞德 45 nz
+贞德红 3 nr
+贞操 57 nr
+贞操带 3 n
+贞松劲柏 3 nr
+贞洁 40 nrfg
+贞淑 17 a
+贞烈 7 nr
+贞童 3 nz
+贞节 48 nz
+贞节牌坊 3 n
+贞观 278 nz
+贞观之治 29 l
+贞静 5 nrfg
+贞风亮节 3 nz
+贞高绝俗 3 l
+负 4410 v
+负一 3 b
+负丘 3 n
+负义 3 n
+负义忘恩 3 n
+负乘斯夺 3 i
+负乘致寇 3 i
+负于 123 v
+负任蒙劳 3 l
+负伤 254 v
+负作用 13 n
+负俗之累 3 i
+负俗之讥 3 i
+负债 343 n
+负债人 5 n
+负债率 4 n
+负债累累 29 l
+负债者 3 n
+负债表 71 n
+负债额 10 n
+负值 36 n
+负像 3 v
+负冤 3 v
+负分 4 n
+负加速度 3 n
+负压 30 n
+负压闪蒸 3 n
+负反馈 41 n
+负变差 3 n
+负号 19 n
+负合 3 v
+负后象 3 n
+负向 3 n
+负吸附 3 i
+负团费 3 n
+负固不宾 3 n
+负固不服 3 l
+负土成坟 3 n
+负地矜才 3 vn
+负地貌 3 n
+负增长 3 n
+负屈 3 v
+负屈含冤 2 i
+负屈衔冤 3 i
+负山戴岳 3 i
+负干涉 3 i
+负序 3 n
+负异常 3 b
+负弩前驱 3 i
+负得起 3 v
+负德 3 n
+负德孤恩 3 l
+负德背义 3 n
+负德辜恩 3 n
+负心 122 n
+负心人 7 n
+负心汉 3 n
+负心违愿 3 i
+负心郎 3 n
+负恩忘义 3 i
+负恩昧良 3 i
+负恩背义 3 i
+负愧 3 v
+负手之歌 3 i
+负手就擒 3 i
+负才任气 3 n
+负才使气 3 i
+负才傲物 3 i
+负担 1948 v
+负担得起 3 l
+负担沉重 3 l
+负担过重 3 l
+负担重 3 n
+负效应 9 n
+负数 72 n
+负方 3 n
+负晶体 3 n
+负有 392 v
+负有责任 3 n
+负有重任 3 l
+负材任气 3 n
+负材矜地 3 z
+负极 59 n
+负极板 3 n
+负案 3 n
+负案在逃 3 i
+负气 41 n
+负气仗义 3 n
+负气含灵 3 n
+负气斗狠 3 i
+负氧离子 13 n
+负温度 3 n
+负热火 3 n
+负熵 3 n
+负片 5 n
+负电 82 n
+负电子 3 n
+负电极 4 n
+负电流 3 n
+负电荷 80 n
+负疚 28 an
+负相关 3 n
+负石赴河 3 i
+负离子 101 n
+负笈 10 n
+负箧 3 i
+负类反伦 3 l
+负累 23 v
+负约 4 n
+负罪 12 v
+负罪感 8 n
+负翁 6 n
+负老提幼 3 n
+负老携幼 3 i
+负荆 13 n
+负荆请罪 22 i
+负荆谢罪 3 i
+负荷 336 n
+负荷分担 7 n
+负荷应激 3 l
+负荷量 12 n
+负薪 3 n
+负薪之忧 3 i
+负薪救火 3 i
+负薪构堂 3 n
+负衡据鼎 3 n
+负诟忍尤 3 nr
+负负 3 v
+负负得正 3 i
+负责 13745 v
+负责人 3722 n
+负责制 1916 n
+负责同志 3 n
+负责干部 3 n
+负责管理 8 n
+负起 3 v
+负趋性 3 n
+负跃变 3 i
+负载 174 v
+负载平衡 3 i
+负载电阻 2 n
+负载量 3 n
+负遇依险 3 i
+负重 204 v
+负重吞污 3 i
+负重含污 3 i
+负重涉远 3 l
+负重致远 3 i
+负阻不宾 3 i
+负险不宾 3 i
+负险不臣 3 i
+负隅顽抗 87 i
+负面 707 n
+负面影响 16 n
+负面性 3 n
+负面效应 3 n
+负面新闻 3 n
+负项 3 b
+负驽前驱 3 v
+负鼎之愿 3 i
+负鼠 21 n
+贡 681 n
+贡二水 2 nr
+贡于北 2 nr
+贡井区 3 n
+贡入京 2 nr
+贡其物 4 n
+贡内斯 2 nr
+贡单念 2 n
+贡员 3 n
+贡品 335 n
+贡唐仓 3 nr
+贡嘎 10 nr
+贡嘎县 3 nr
+贡嘎山 21 nr
+贡嘎机场 2 ns
+贡培兴 2 nr
+贡士 258 n
+贡多拉 2 nr
+贡奉无 3 nr
+贡家 3 n
+贡寮 3 ns
+贡山 24 nr
+贡山独龙族怒族自治县 10 ns
+贡巴 2 n
+贡布 8 n
+贡布山 2 nr
+贡布苏伦 2 ns
+贡布里希 5 nrt
+贡平原 2 ns
+贡德尔 5 nr
+贡德语 2 nr
+贡戈拉 5 nr
+贡扎加 4 nr
+贡方 2 n
+贡方物 2 n
+贡日嘎 3 nr
+贡期 2 n
+贡榜 11 n
+贡止贡 2 nr
+贡比涅 18 nr
+贡物 19 n
+贡献 5762 n
+贡献一切 3 nr
+贡献余热 3 n
+贡献力量 3 n
+贡献奖 20 nr
+贡献度 22 nr
+贡献才智 3 nr
+贡献率 32 nr
+贡献者 1579 nr
+贡生 13 n
+贡生之 2 nr
+贡生出 3 n
+贡礼 3 nr
+贡禹弹冠 3 v
+贡税 5 n
+贡米 5 n
+贡绢 2 n
+贡缎 7 n
+贡舶 8 n
+贡船 3 n
+贡茶 262 n
+贡萨格 2 nr
+贡萨洛 4 nr
+贡觉 4 n
+贡觉县 3 nr
+贡赋 74 n
+贡赋入 2 nr
+贡赋备 2 nr
+贡赋道 2 nr
+贡酒 16 n
+贡金 6 n
+贡院 35 n
+贡马 2 n
+贡高 3 n
+财 1725 n
+财不露白 3 i
+财东 39 n
+财主 230 n
+财产 7202 n
+财产保险 3 n
+财产性 5 n
+财产损失 3 n
+财产权 60 n
+财产权利 3 n
+财产来源 3 n
+财产法 3 n
+财产清查 3 l
+财产目录 3 n
+财产税 26 n
+财产纠纷 3 z
+财产继承 3 n
+财产险 3 n
+财会 71 n
+财会人员 3 n
+财会字 3 n
+财会网 3 n
+财保 3 j
+财力 499 n
+财力物力 3 n
+财力雄厚 3 l
+财办 2 j
+财务 1822 n
+财务主管 3 n
+财务人员 3 n
+财务会计 3 n
+财务公开 3 n
+财务决算 3 n
+财务制度 3 n
+财务危机 3 n
+财务司 23 nt
+财务咨询 3 nt
+财务处 10 nt
+财务室 6 nt
+财务局 3 nt
+财务帐 2 n
+财务总监 3 n
+财务报告 3 n
+财务报表 6 n
+财务指标 3 n
+财务收支 3 n
+财务数据 3 n
+财务检查 3 n
+财务状况 3 n
+财务监督 3 n
+财务科 10 n
+财务管理 9 n
+财务纪律 3 n
+财务经理 3 n
+财务结构 3 n
+财务股 3 n
+财务计划 3 n
+财务费用 3 n
+财务软件 3 n
+财务部 37 nt
+财务部门 3 n
+财务顾问 3 l
+财务预算 3 n
+财势 12 n
+财匮力绌 3 i
+财商 3 n
+财团 281 n
+财团法人 3 n
+财大 47 j
+财大气粗 72 i
+财委 5 n
+财宝 137 n
+财宝箱 3 n
+财富 4280 n
+财富网 3 n
+财工发 3 nt
+财帛 55 n
+财年 446 n
+财改 3 j
+财政 6228 n
+财政危机 17 l
+财政厅 35 nt
+财政厅长 3 z
+财政司 17 nt
+财政困难 3 n
+财政学 27 nt
+财政寡头 3 n
+财政局 98 nt
+财政年度 3 n
+财政开支 3 n
+财政性 22 n
+财政投入 3 j
+财政拨款 3 n
+财政支出 3 n
+财政收入 3 n
+财政收支 3 n
+财政政策 3 n
+财政权 2 n
+财政法 4 n
+财政状况 3 n
+财政率 3 n
+财政监督 3 n
+财政管理 3 n
+财政纪律 3 n
+财政经济委员会 557 nt
+财政补贴 3 n
+财政负担 3 n
+财政资本 6 n
+财政资金 3 n
+财政赤字 3 n
+财政部 428 nt
+财政部长 119 n
+财政部门 38 n
+财政金融 3 n
+财政预算 3 n
+财智 3 n
+财权 34 n
+财校 3 n
+财殚力尽 3 v
+财殚力痡 3 v
+财殚力竭 3 v
+财气 4 n
+财源 112 n
+财源滚滚 3 n
+财源茂盛 3 n
+财物 1261 n
+财物罪 3 n
+财物部门 3 n
+财用 3 n
+财界 7 n
+财礼 44 n
+财神 61 n
+财神庙 3 n
+财神爷 30 n
+财神老爷 3 n
+财税 347 n
+财税字 3 n
+财税局 3 nt
+财税界 3 n
+财税网 3 n
+财竭力尽 3 i
+财经 612 n
+财经专家 3 l
+财经大学 3 nt
+财经委 3 nt
+财经委员会 17 nt
+财经学院 3 nt
+财经报道 3 n
+财经新闻 3 n
+财经界 3 n
+财经类 59 n
+财经纪律 3 n
+财经网 3 n
+财经论文 3 n
+财经证券 3 nt
+财经部 2 nt
+财经部门 3 n
+财经频道 3 n
+财经首长 3 n
+财综 3 j
+财综字 3 n
+财色 3 n
+财货 3 n
+财贸 50 j
+财贸办 3 nt
+财贸战线 3 nt
+财贸科 3 nt
+财贸系统 3 l
+财赋 3 n
+财赤 3 n
+财路 35 n
+财运 6 n
+财运亨通 3 i
+财迷 8 n
+财迷心窍 13 i
+财金 5 n
+财长 57 n
+财阀 124 n
+财险 24 n
+财险杯 3 n
+财雄势大 5 l
+财革法 3 n
+责 1150 n
+责之切 3 i
+责人 3 n
+责人从宽 3 i
+责人责己 3 n
+责令 227 n
+责任 5946 n
+责任书 38 n
+责任事故 5 n
+责任人 193 n
+责任人员 33 n
+责任保险 3 n
+责任内阁 29 n
+责任准备 3 n
+责任制 446 n
+责任区 11 n
+责任地 27 n
+责任归因 3 n
+责任心 150 n
+责任意识 3 n
+责任感 497 n
+责任扩散 3 n
+责任法 3 n
+责任状 22 n
+责任田 26 n
+责任编辑 3 n
+责任者 24 n
+责任能力 3 n
+责任重大 3 i
+责任险 15 n
+责先利后 3 n
+责善 3 v
+责备 524 n
+责备求全 3 i
+责备贤者 3 i
+责实循名 3 n
+责己 3 n
+责己从严 3 i
+责己以周 3 i
+责怨 3 n
+责怪 219 v
+责成 374 v
+责打 53 v
+责斥 3 v
+责无旁货 3 i
+责无旁贷 190 i
+责有所归 3 i
+责有攸归 3 i
+责权 14 n
+责权分明 2 n
+责权利 5 n
+责编 36 n
+责罚 167 n
+责重山岳 3 n
+责问 107 n
+责难 218 n
+责骂 140 v
+贤 1241 zg
+贤人 37 n
+贤伉俪 3 nr
+贤侄 3 n
+贤侯 3 n
+贤内助 20 n
+贤劳 3 a
+贤后 3 n
+贤哲 45 n
+贤圣 3 a
+贤士 49 n
+贤契 7 a
+贤妹 3 n
+贤妻 21 n
+贤妻良母 19 n
+贤孙 3 n
+贤孝 3 n
+贤弟 414 n
+贤徒 3 n
+贤德 21 n
+贤惠 46 a
+贤惠女子 3 n
+贤愚 33 n
+贤慧 19 n
+贤才 50 n
+贤才君子 3 i
+贤明 40 n
+贤明地 3 n
+贤母良妻 3 n
+贤淑 35 a
+贤王 62 n
+贤相 3 n
+贤者 55 n
+贤能 103 n
+贤臣 35 n
+贤良 465 a
+贤良之士 3 i
+贤良方正 9 i
+贤贤易色 3 i
+贤路 3 n
+贤身贵体 3 i
+贤达 32 a
+贤首 3 n
+败 3221 v
+败下阵来 3 l
+败不旋踵 3 i
+败不馁 3 i
+败也萧何 3 i
+败事 3 n
+败事有余 21 i
+败于垂成 3 i
+败井颓垣 3 i
+败亡 118 v
+败仗 215 v
+败俗伤化 3 n
+败俗伤风 3 i
+败兴 29 v
+败兴而归 10 i
+败兵 75 n
+败兵之将 3 i
+败军 79 n
+败军之将 12 i
+败则为寇 2 i
+败则为贼 3 i
+败化伤风 3 n
+败北 99 n
+败叶 21 n
+败名 3 v
+败因 7 n
+败国丧家 3 l
+败国亡家 3 n
+败坏 396 v
+败坏名誉 3 n
+败子回头 3 n
+败家 23 n
+败家女 3 n
+败家子 87 n
+败家破业 3 n
+败将 80 n
+败将残兵 3 i
+败局 110 n
+败德 3 n
+败德辱行 3 i
+败招 3 n
+败材伤锦 3 n
+败柳 3 n
+败柳残花 3 i
+败毒 10 v
+败法乱纪 3 i
+败溃 3 v
+败火 11 n
+败笔 28 n
+败类 106 n
+败絮 14 n
+败絮其中 3 v
+败给 47 v
+败绩 68 n
+败绩失据 3 n
+败缺 3 v
+败者 26 n
+败者为寇 3 i
+败而不馁 3 i
+败育卵 3 n
+败胃 3 n
+败草 3 n
+败落 53 v
+败血 2 v
+败血病 3 n
+败血症 83 n
+败诉 60 v
+败诉方 2 n
+败责 3 v
+败走 3 v
+败走麦城 7 n
+败退 182 v
+败酱草 2 n
+败门风 3 n
+败阵 72 n
+败阵下来 3 l
+败露 146 v
+败鳞残甲 3 i
+败鼓之皮 3 i
+账 838 n
+账内 3 n
+账册 22 n
+账务 15 n
+账单 62 n
+账卡 3 n
+账号 103 n
+账号密码 3 n
+账号格 3 n
+账外 16 n
+账夹 3 n
+账户 489 n
+账户卡 71 n
+账户就 3 n
+账房 65 n
+账据 3 n
+账本 27 n
+账本儿 3 n
+账款 49 n
+账皮 3 n
+账目 209 n
+账篷 3 n
+账簿 49 n
+账表 3 n
+账证 3 n
+账钉 3 n
+账面 90 n
+账页 3 n
+账项 3 n
+货 2218 n
+货主 39 n
+货人 3 n
+货仓 4 n
+货仓商场 3 n
+货仓式 3 n
+货代 4 n
+货价 23 n
+货位 2 n
+货值 5 n
+货到付款 3 l
+货单 10 n
+货厢 3 n
+货叉 4 n
+货员 3 n
+货品 36 n
+货场 35 n
+货币 8092 n
+货币主义 24 n
+货币制度 3 l
+货币化 74 l
+货币回笼 3 n
+货币地租 109 l
+货币基金 3 l
+货币政策 3 n
+货币权 3 n
+货币汇率 3 n
+货币流 19 n
+货币流通 3 l
+货币率 3 n
+货币联盟 3 nt
+货币贬值 3 vn
+货币资本 495 l
+货币资金 3 l
+货币量 162 l
+货底 3 n
+货店 2 n
+货损 3 n
+货损检验 3 n
+货摊 7 n
+货机 25 n
+货架 76 n
+货架厂 3 n
+货架子 3 n
+货柜 30 n
+货柜船 3 n
+货柜车 3 n
+货栈 66 n
+货样 2 n
+货样室 3 n
+货检 3 j
+货款 154 n
+货款贴息 3 n
+货殖 28 n
+货比三家 17 l
+货流 3 n
+货流地理 3 n
+货源 99 n
+货源充足 3 i
+货物 1482 n
+货物保险 3 n
+货物柜 3 n
+货物税 3 n
+货物贸易 3 l
+货物运输 3 l
+货畅其流 6 i
+货盘 8 n
+货真价实 116 l
+货硬 3 j
+货票 3 n
+货种 13 n
+货站 3 n
+货签 3 n
+货箱 27 n
+货而不售 3 l
+货舱 168 n
+货船 65 n
+货色 110 n
+货色齐全 3 l
+货贿公行 3 n
+货赂公行 3 n
+货赂大行 3 n
+货车 197 n
+货车工 3 n
+货车运输 3 l
+货轮 69 n
+货载 3 n
+货运 419 n
+货运业 3 n
+货运公司 2 n
+货运单 9 n
+货运卡车 3 n
+货运站 17 n
+货运网 3 n
+货运行 3 n
+货运费 3 n
+货运车 3 n
+货运量 113 n
+货邮 3 n
+货郎 19 n
+货郎儿 2 n
+货郎担 2 n
+货郎鼓 6 n
+质 5760 ng
+质优 34 b
+质优价廉 4 l
+质伛影曲 3 v
+质体 40 n
+质保 5 j
+质保书 3 n
+质保卡 3 n
+质保金 3 n
+质变 128 v
+质和量 31 n
+质因数 3 n
+质因素 3 n
+质地 830 n
+质块 3 n
+质子 391 n
+质子化 3 n
+质子号 2 n
+质子泵 3 n
+质子转移 3 n
+质弱 3 v
+质心 68 n
+质心系 3 n
+质感 342 n
+质成 3 v
+质押 106 v
+质控 4 j
+质数 18 n
+质料 59 n
+质朴 257 n
+质朴无华 5 i
+质材 3 n
+质检 98 j
+质检中心 3 nt
+质检员 2 n
+质检局 3 nt
+质检站 3 n
+质次价高 4 nz
+质点 275 n
+质点力学 3 n
+质点系 3 n
+质疑 557 v
+质疑辨惑 3 n
+质疑问难 3 l
+质监 26 n
+质监局 19 j
+质监所 11 j
+质监站 3 j
+质直 7 v
+质直浑厚 3 i
+质科 3 n
+质粒 25 n
+质素 32 n
+质而不野 3 i
+质膜 3 n
+质要 3 b
+质言 3 n
+质言之 3 i
+质证 9 j
+质询 523 v
+质询权 3 n
+质询者 3 n
+质谱 32 n
+质谱仪 27 n
+质谱法 3 n
+质轻 24 v
+质量 8009 n
+质量上乘 17 n
+质量不灭 3 v
+质量事故 3 n
+质量体系 3 n
+质量保证 3 n
+质量保证部 6 nt
+质量关 7 n
+质量型 3 b
+质量奖 5 n
+质量守恒 3 i
+质量技术监督局 10 nt
+质量指标 3 n
+质量数 31 n
+质量方针 3 n
+质量标准 3 n
+质量检查 3 n
+质量检验 3 n
+质量法 3 n
+质量监督员 3 n
+质量第一 3 n
+质量范围 3 n
+质量观 6 n
+质量评比 3 n
+质量课 3 n
+质量遗传 3 n
+质量部 3 n
+质问 232 n
+质非文是 3 l
+贩 464 v
+贩交买名 3 n
+贩到 3 v
+贩卖 737 v
+贩卖人口 3 n
+贩卖军火 3 i
+贩卖机 3 n
+贩卖毒品 3 n
+贩卖部 3 n
+贩售 3 vn
+贩售量 3 n
+贩夫 3 n
+贩夫俗子 3 n
+贩夫皁隶 3 n
+贩夫皂隶 3 n
+贩夫贩妇 3 n
+贩夫走卒 22 i
+贩夫驺卒 3 v
+贩妇 3 n
+贩子 182 n
+贩官鬻爵 3 i
+贩枪 3 n
+贩毒 175 v
+贩毒分子 3 n
+贩毒案 3 n
+贩毒案件 3 n
+贩毒集团 3 n
+贩私 37 vn
+贩货 3 n
+贩贱卖贵 3 i
+贩运 151 v
+贩黄 8 n
+贪 871 v
+贪位慕禄 3 nz
+贪便宜 12 i
+贪内助 3 n
+贪利 3 a
+贪利忘义 3 i
+贪功 3 a
+贪功起衅 3 v
+贪占 3 v
+贪吃 37 a
+贪吃懒做 3 i
+贪吃蛇 3 i
+贪吃鬼 3 i
+贪嘴 14 v
+贪图 268 v
+贪图享乐 3 i
+贪图享受 3 i
+贪图便宜 3 i
+贪图安逸 3 i
+贪墨 89 n
+贪墨成风 3 i
+贪声逐色 3 i
+贪多 18 a
+贪多务得 12 i
+贪多嚼不烂 13 i
+贪多必失 3 i
+贪多无厌 3 i
+贪大 3 a
+贪大求全 4 i
+贪大求洋 3 i
+贪天之功 8 i
+贪夫徇财 3 i
+贪夫殉利 3 i
+贪夫狥财 3 n
+贪好 3 a
+贪好女色 3 i
+贪婪 495 a
+贪婪成性 3 i
+贪婪无厌 4 i
+贪官 286 n
+贪官汙吏 3 n
+贪官污吏 126 i
+贪官浝 3 v
+贪小 3 a
+贪小便宜 3 i
+贪小失大 3 i
+贪得 3 v
+贪得无厌 61 i
+贪心 64 v
+贪心不足 11 i
+贪念 18 n
+贪恋 65 v
+贪恋着 3 v
+贪慕 3 v
+贪慕虚荣 3 ns
+贪杯 10 n
+贪欲 86 v
+贪欲无厌 3 i
+贪欲无艺 3 i
+贪求 7 v
+贪求无厌 3 i
+贪求无已 3 i
+贪汙 3 v
+贪污 639 v
+贪污受贿 3 i
+贪污地 3 i
+贪污案 5 n
+贪污犯 39 i
+贪污狼藉 3 i
+贪污盗窃 3 n
+贪污罪 20 i
+贪污腐化 47 i
+贪污腐败 3 i
+贪污贿赂 3 v
+贪渎 3 v
+贪滥 3 v
+贪狠 3 a
+贪狼 3 n
+贪狼星 3 i
+贪猥无厌 3 nr
+贪玩 48 v
+贪生 3 v
+贪生怕死 120 i
+贪生恶死 3 i
+贪生畏死 7 i
+贪睡 3 v
+贪睡虫 3 n
+贪羡 3 v
+贪而无信 3 i
+贪脏枉法 3 i
+贪腐 3 n
+贪色 26 n
+贪蛇忘尾 3 i
+贪财 88 v
+贪财图利 3 i
+贪财好色 3 i
+贪财害命 3 i
+贪贿 3 v
+贪贿无艺 3 n
+贪赃 33 v
+贪赃坏法 3 i
+贪赃枉法 64 i
+贪赃舞弊 3 i
+贪鄙 21 a
+贪钱 3 v
+贪食 3 n
+贪食者 3 n
+贪食蛇 3 i
+贪黑 3 v
+贫 784 n
+贫下 3 n
+贫下中农 156 j
+贫不学俭 3 i
+贫乏 234 a
+贫僧 229 n
+贫农 181 n
+贫化 13 vn
+贫化铀 4 n
+贫嘴 32 n
+贫嘴恶舌 3 i
+贫嘴滑舌 3 i
+贫嘴薄舌 3 i
+贫嘴贱舌 3 i
+贫困 1882 a
+贫困乡 6 n
+贫困人口 3 n
+贫困人家 3 n
+贫困化 18 n
+贫困县 134 n
+贫困地区 3 n
+贫困学生 3 n
+贫困家庭 3 n
+贫困山区 3 n
+贫困帽子 4 n
+贫困户 115 n
+贫困村 23 n
+贫困潦倒 3 i
+贫困率 2 n
+贫困生 113 n
+贫困线 52 n
+贫困者 9 n
+贫困落后 3 i
+贫困面 4 n
+贫国 3 n
+贫家 3 n
+贫家女 3 n
+贫富 545 a
+贫富不均 3 l
+贫富差距 3 n
+贫富悬殊 46 l
+贫寒 419 a
+贫寒人家 3 n
+贫寒无告 3 i
+贫弱 26 a
+贫户 53 n
+贫族 3 n
+贫无立锥 17 i
+贫无置锥 3 i
+贫民 580 n
+贫民区 21 n
+贫民窟 58 n
+贫民院 3 n
+贫气 3 n
+贫油 10 n
+贫燃火焰 3 l
+贫病 3 n
+贫病交侵 3 n
+贫病交加 9 j
+贫病交攻 3 i
+贫病交迫 4 i
+贫瘠 133 a
+贫瘠化 3 v
+贫矿 10 n
+贫穷 680 a
+贫穷人家 3 n
+贫穷线 2 n
+贫穷落后 3 i
+贫而乐道 3 l
+贫而无谄 3 i
+贫苦 769 an
+贫苦人家 3 l
+贫苦出身 3 i
+贫血 451 n
+贫血病 4 n
+贫血症 3 n
+贫贱 69 a
+贫贱不移 3 i
+贫贱不能 3 l
+贫贱之交 3 i
+贫贱之知 3 l
+贫贱夫妻 3 l
+贫贱糟糠 3 v
+贫贱骄人 3 i
+贫道 305 n
+贫铀 3 n
+贫铀弹 3 n
+贫雇农 10 n
+贬 489 v
+贬为 3 v
+贬义 27 v
+贬义词 19 n
+贬价 3 v
+贬低 130 v
+贬低者 3 n
+贬值 679 v
+贬值率 4 n
+贬官 3 v
+贬幅 3 n
+贬意 3 v
+贬抑 28 v
+贬损 24 v
+贬斥 49 v
+贬毁 3 v
+贬职 5 v
+贬褒 3 v
+贬词 5 v
+贬谪 37 vn
+贬责 3 v
+贬逐 3 v
+贬黜 16 v
+购 1008 v
+购书 30 n
+购买 4275 v
+购买价 2 n
+购买决策 3 n
+购买力 164 n
+购买国 9 n
+购买意识 3 n
+购买户 2 n
+购买方 8 n
+购买权 10 n
+购买欲 4 n
+购买率 2 n
+购买群 3 n
+购买者 79 n
+购买证 3 n
+购买过程 3 l
+购买量 10 n
+购价 9 v
+购入 110 v
+购办 3 v
+购回 17 v
+购屋 3 n
+购并 52 v
+购建 12 v
+购得 100 v
+购房 222 n
+购房人 30 n
+购房款 3 n
+购房置业 2 n
+购房者 73 n
+购料 3 n
+购有 3 v
+购机 33 n
+购汇 69 n
+购油 3 n
+购油案 3 n
+购物 994 n
+购物中心 3 n
+购物券 20 n
+购物单 3 n
+购物广场 3 n
+购物款 2 n
+购物满 3 n
+购物点 38 n
+购物狂 3 n
+购物篮 3 n
+购物网 3 n
+购物者 6 n
+购物袋 3 n
+购物车 3 n
+购用 3 v
+购碟 3 n
+购票 59 n
+购票卡 2 n
+购票者 3 n
+购粮 3 v
+购置 279 v
+购置税 3 n
+购置费 4 n
+购者 5 n
+购自 3 v
+购豪宅 3 n
+购货 34 n
+购货人 4 n
+购货券 3 n
+购货单 2 n
+购货证 3 n
+购车 15 n
+购车人 3 n
+购车和 3 n
+购车族 3 n
+购车网 3 n
+购车者 2 n
+购车费 3 n
+购进 155 v
+购销 158 v
+购销两旺 4 l
+购销员 3 n
+购销差价 3 n
+购销站 3 n
+购销部 3 n
+购销额 5 n
+购食 3 v
+贮 354 v
+贮备 27 v
+贮备金 3 n
+贮存 426 v
+贮存器 3 n
+贮存期 9 n
+贮存量 3 n
+贮木场 2 n
+贮槽 3 v
+贮水 3 v
+贮水器 3 n
+贮水池 3 n
+贮水量 3 n
+贮满 3 v
+贮点红 3 v
+贮积 3 v
+贮积起来 3 n
+贮簿 3 n
+贮罐 2 n
+贮蓄 3 n
+贮藏 516 v
+贮藏器 3 n
+贮藏室 8 n
+贮藏库 5 nz
+贮藏期 3 n
+贮藏量 7 n
+贮运 16 v
+贮量 10 v
+贯 743 nr
+贯串 49 v
+贯众 8 v
+贯例 3 v
+贯家堡 3 n
+贯家堡村 3 n
+贯彻 2922 v
+贯彻到底 3 i
+贯彻始终 7 i
+贯彻实施 3 i
+贯彻执行 3 i
+贯彻落实 3 i
+贯斗双龙 3 i
+贯朽粟红 3 n
+贯朽粟腐 3 n
+贯朽粟陈 3 n
+贯标 3 v
+贯气 3 v
+贯注 39 v
+贯流式 3 n
+贯甲提兵 3 n
+贯眼完井 3 i
+贯穿 463 v
+贯穿今古 3 i
+贯穿力 3 l
+贯穿性 4 n
+贯穿融会 3 n
+贯穿辐射 3 l
+贯穿驰骋 3 i
+贯耳 3 v
+贯轴 3 v
+贯连 3 v
+贯通 524 v
+贯通性 3 n
+贯通融会 3 n
+贯顾奋戟 3 i
+贯颐备戟 3 nr
+贯颐奋戟 3 nr
+贯鱼之序 3 l
+贯鱼之次 3 i
+贰 307 m
+贰仟 2 m
+贰心 11 n
+贰本 2 m
+贰臣 6 n
+贱 875 a
+贱业 3 n
+贱买 3 v
+贱买贱卖 3 i
+贱买贵卖 11 i
+贱事 3 n
+贱人 277 n
+贱价 3 n
+贱价出售 3 n
+贱入贵出 3 i
+贱内 12 n
+贱卖 32 v
+贱号 3 n
+贱妾 54 n
+贱屄 3 v
+贱恙 3 n
+贱敛贵出 3 nr
+贱敛贵发 3 nt
+贱格 3 n
+贱民 84 n
+贱物 3 n
+贱目贵耳 3 i
+贱种 3 n
+贱货 39 n
+贱躯 3 n
+贱骨头 20 n
+贲 75 nr
+贲临 3 nr
+贲之师 2 nr
+贲任 3 n
+贲叶红 3 nr
+贲士 3 n
+贲布图 2 nr
+贲门 20 n
+贲门癌 3 n
+贴 5204 v
+贴上去 3 v
+贴上来 3 v
+贴上标签 3 n
+贴下 3 v
+贴下去 3 v
+贴下来 3 v
+贴付 2 v
+贴住 3 v
+贴体 7 n
+贴兜 3 n
+贴入 3 v
+贴出 3 v
+贴出去 3 v
+贴出来 3 vn
+贴切 166 a
+贴到 3 v
+贴剂 6 n
+贴反 3 v
+贴合 9 v
+贴图 78 v
+贴图区 3 n
+贴图秀 3 nz
+贴图站 3 n
+贴图网 3 nz
+贴地 3 n
+贴地而行 3 n
+贴墙 3 n
+贴墙纸 3 n
+贴壁 3 n
+贴壁培养 3 n
+贴壁细胞 3 n
+贴好 3 a
+贴子 21 n
+贴完 3 v
+贴己 3 n
+贴布 3 v
+贴平 3 n
+贴心 102 v
+贴心人 15 n
+贴心朋友 3 n
+贴心话 6 n
+贴息 35 v
+贴息贷款 6 n
+贴慰 3 v
+贴换 2 v
+贴有 22 v
+贴服 3 v
+贴权 3 n
+贴来 3 v
+贴来贴去 3 n
+贴板 3 n
+贴标机 3 n
+贴标签 3 n
+贴水 9 n
+贴片 16 n
+贴片式 3 nz
+贴片机 3 nz
+贴现 259 v
+贴现率 94 n
+贴用 3 v
+贴画 13 n
+贴着 370 v
+贴砖 3 n
+贴紧 21 v
+贴纸 3 v
+贴纸相 3 n
+贴缝 3 n
+贴肤 3 n
+贴膏 3 n
+贴膏药 9 n
+贴膜 2 n
+贴花 11 n
+贴补 95 v
+贴补家用 3 n
+贴谱 3 n
+贴贴乐 3 n
+贴起 3 v
+贴足 3 a
+贴身 362 v
+贴身衣服 3 n
+贴身衣物 3 n
+贴边 3 n
+贴过去 3 v
+贴过来 3 v
+贴近 323 v
+贴近性 2 n
+贴近生活 3 n
+贴进 3 v
+贴进去 3 v
+贴进来 3 v
+贴金 442 n
+贴钱 6 v
+贴附 3 v
+贴面 19 n
+贴面舞 3 n
+贴题 3 n
+贴饼子 2 n
+贵 4478 a
+贵不凌贱 3 i
+贵不召骄 3 n
+贵不可言 19 i
+贵不期骄 3 i
+贵为天子 3 l
+贵乎 13 a
+贵事 3 n
+贵人 410 n
+贵人善忘 3 i
+贵人多忘 3 i
+贵人多忘事 8 i
+贵人相助 3 i
+贵人网 3 n
+贵人贱己 3 i
+贵会 26 n
+贵体 3 n
+贵公子 3 n
+贵函 3 n
+贵刊 2 n
+贵南 2 ns
+贵南县 4 ns
+贵厂 3 n
+贵友 16 n
+贵古贱今 3 l
+贵和 16 ns
+贵国 146 ns
+贵在 76 n
+贵在知心 3 i
+贵地 3 ns
+贵壮贱弱 3 l
+贵壮贱老 3 i
+贵处 31 n
+贵妃 542 n
+贵妃醉酒 3 n
+贵妇 82 n
+贵妇人 46 n
+贵姓 94 n
+贵委 3 n
+贵子 14 n
+贵定 4 n
+贵定县 5 ns
+贵宝号 3 n
+贵宝地 3 n
+贵客 168 n
+贵客临门 3 n
+贵宾 447 ns
+贵宾卡 3 ns
+贵宾厅 3 nt
+贵宾团 18 nt
+贵宾室 23 n
+贵宾席 6 n
+贵宾房 7 n
+贵宾楼 6 ns
+贵宾版 3 n
+贵宾犬 3 n
+贵宾票 3 n
+贵少贱老 3 i
+贵局 3 n
+贵山 8 ns
+贵峰村 3 ns
+贵州 1202 ns
+贵州大学 29 nt
+贵州工业大学 2 nt
+贵州省 340 ns
+贵州省安顺地区 3 ns
+贵州省政府 5 nt
+贵州省旅游局 3 nt
+贵州省环保局 2 nt
+贵州省遵义地区 2 ns
+贵州省铜仁地区 3 ns
+贵州省黔南布依族苗族自治州 2 ns
+贵州籍 2 n
+贵州菜 3 n
+贵州铜仁地区 3 ns
+贵州铝厂 2 nt
+贵州高原 42 ns
+贵干 41 ns
+贵庚 9 nrt
+贵府 3 n
+贵德 16 ns
+贵德县 3 ns
+贵德残兵 3 nz
+贵恙 8 n
+贵慈 3 a
+贵戚 64 n
+贵所 3 n
+贵报 10 n
+贵方 9 n
+贵族 5389 n
+贵族化 7 ns
+贵族学校 3 nt
+贵族政治 3 n
+贵族气 4 n
+贵无常尊 3 i
+贵昆铁路 4 nz
+贵显 3 a
+贵极人臣 3 n
+贵校 10 n
+贵桑 3 ns
+贵池 18 ns
+贵池区 3 ns
+贵池县 3 ns
+贵池市 3 ns
+贵港 7 ns
+贵港市 11 ns
+贵溪 36 ns
+贵溪冶炼厂 2 nt
+贵溪市 3 ns
+贵点 3 n
+贵省 8 ns
+贵站 3 n
+贵而贱目 3 i
+贵耳贱目 3 i
+贵胄 141 n
+贵航 18 n
+贵行 3 n
+贵贱 103 n
+贵贱无二 3 i
+贵贱无常 3 i
+贵贱高下 3 i
+贵远贱近 3 l
+贵远鄙近 3 l
+贵邦 3 ns
+贵重 342 n
+贵重品 3 n
+贵重物品 3 n
+贵金属 230 n
+贵阳 347 ns
+贵阳人 2 n
+贵阳市 83 ns
+贵阴贱璧 3 i
+贵院 3 n
+贶 8 g
+贷 783 v
+贷个 3 n
+贷借 3 n
+贷入 3 n
+贷出 3 n
+贷取 3 n
+贷好 3 n
+贷存比 2 n
+贷学金 20 n
+贷放 3 n
+贷方 23 n
+贷方余额 3 n
+贷栈 3 n
+贷棚 3 n
+贷款 4000 n
+贷款人 56 n
+贷款率 9 n
+贷款额 15 n
+贷款额度 3 n
+贷款风险 3 n
+贷法 3 n
+贷物 3 n
+贷给 3 n
+贷记卡 14 n
+贷过 3 n
+贷金 3 n
+贸 225 vn
+贸促会 30 j
+贸发 13 vn
+贸发局 3 n
+贸工 3 vn
+贸工农 7 nz
+贸工部 5 n
+贸易 6255 vn
+贸易业 7 n
+贸易中心 3 n
+贸易区 113 n
+贸易协定 3 nz
+贸易口岸 3 n
+贸易商 3 n
+贸易商行 3 n
+贸易国 12 n
+贸易型 3 n
+贸易壁垒 3 n
+贸易大学 3 n
+贸易局 4 n
+贸易差额 3 n
+贸易市场 3 n
+贸易往来 3 vn
+贸易总额 3 n
+贸易战 9 nz
+贸易权 14 n
+贸易条件 3 n
+贸易法 15 n
+贸易界 3 n
+贸易系 2 n
+贸易组织 3 n
+贸易网 3 n
+贸易规模 3 n
+贸易谈判 3 n
+贸易赤字 3 nz
+贸易逆差 3 n
+贸易通 3 n
+贸易部 15 n
+贸易部长 2 n
+贸易量 28 n
+贸易顺差 3 n
+贸易额 172 n
+贸易风 3 n
+贸然 413 d
+贸然行事 3 n
+贸着之仇 3 n
+贸贸然 3 n
+贸首之仇 3 n
+费 3247 v
+费一兵 4 nr
+费一矢 6 nr
+费丹旭 4 nr
+费事 84 n
+费伊 2 nrt
+费伟伟 13 nr
+费伦堡 3 nr
+费伦茨 4 nrt
+费俊龙 4 nr
+费信岛 2 nr
+费信著 3 nr
+费全免 2 l
+费兰特 2 nr
+费兹哥 8 nr
+费凌笑道 4 nr
+费凌道 7 nr
+费列洛 7 nr
+费利佩 2 nr
+费利克 11 nr
+费利克斯 8 nrt
+费力 379 n
+费力劳心 3 l
+费力气 4 n
+费功夫 3 nr
+费加罗 87 nr
+费劲 120 a
+费劲儿 4 nr
+费卢扎 3 nr
+费卢杰 5 nr
+费厄泼赖 5 nr
+费县 28 ns
+费发明 4 nr
+费口舌 15 i
+费周折 3 n
+费周章 6 nr
+费品率 3 n
+费唇舌 3 nr
+费因斯 3 nr
+费因曼 20 nr
+费城 167 ns
+费城故事 3 i
+费多 29 nrt
+费多尔 7 nrt
+费奈斯 2 nr
+费奥 2 nrt
+费奥多 2 nrt
+费奥多罗夫 6 nrt
+费奥拉 2 nrt
+费奥雷 2 nr
+费好 2 a
+费婆子 3 nr
+费孝通 52 nr
+费宫人 11 nr
+费尔丁 3 nr
+费尔兹 9 nr
+费尔南 15 ns
+费尔南多 9 ns
+费尔南德 6 nrt
+费尔南德斯 14 nrt
+费尔巴哈 66 nrt
+费尔干纳 51 ns
+费尔康 2 nr
+费尔德 16 nr
+费尔托 3 nrt
+费尔斯曼 3 nrt
+费尔柴尔 3 ns
+费尔法克斯 5 nrt
+费尔特 8 nrt
+费尔马 23 nr
+费尼著 2 nr
+费尽 99 nr
+费尽周折 17 i
+费尽心力 17 i
+费尽心思 3 i
+费尽心机 42 i
+费尽心血 3 i
+费工 17 n
+费工夫 14 n
+费巨万 2 nr
+费已超 2 nr
+费师兄 2 nr
+费师叔 8 nr
+费师弟 3 nr
+费希尔 28 nr
+费希特 19 nr
+费希纳 10 nr
+费席尔 52 nr
+费库平 3 nr
+费弗尔 5 nr
+费彝民 2 nr
+费彬 3 nrfg
+费得罄 2 nr
+费德列 3 nr
+费德勒 43 nr
+费德林 6 nr
+费德里科 2 nrt
+费心 155 n
+费心劳力 3 l
+费思量 4 n
+费戈伦 2 nr
+费手脚 12 n
+费扬古 12 nr
+费拉 5 nrt
+费拉尔 2 nr
+费拉拉 4 nrt
+费拉杜 2 nr
+费拉菲 2 nr
+费拉西 2 nr
+费拉里 14 nrt
+费改税 3 n
+费文雷 2 nr
+费斯廷 3 nr
+费时 214 n
+费时费事 3 n
+费时费力 4 n
+费时间 3 n
+费曼 4 nr
+费林反应 3 l
+费林德 2 nr
+费林溶液 3 n
+费格尔 3 nr
+费森尤 6 nr
+费森尤斯 8 nr
+费森登 7 nr
+费歇尔 25 nr
+费正清 18 nr
+费毓芳 2 nr
+费点 3 n
+费点心思 3 nr
+费率 56 n
+费玉清 3 nr
+费用 3802 n
+费用减缓 3 i
+费用函数 3 n
+费用应用 3 n
+费用效益 3 n
+费用率 17 n
+费电 3 n
+费留利 3 nr
+费眼 3 n
+费神 49 n
+费米 105 nrt
+费米动量 3 n
+费米子 34 nr
+费米海 3 nr
+费米球 3 nr
+费约 2 n
+费纳喀 2 nr
+费罗 15 nrt
+费罗兹 2 nr
+费耀色 46 nr
+费者协会 3 n
+费耶尔 2 nr
+费胜潮 256 nr
+费脣舌 3 v
+费舍 3 n
+费舍尔 8 nr
+费莱克 2 nr
+费萨尔 28 nr
+费萨拉 9 nr
+费血 3 n
+费要多罗 3 nr
+费解 170 v
+费话 3 n
+费财劳民 3 nr
+费费 4 n
+费赛斯 2 nr
+费赫勒 2 nr
+费边 19 n
+费边主义 3 n
+费边社 24 nr
+费达依 4 nr
+费迪南 6 nr
+费迪南德 17 nrt
+费里 29 nrt
+费里尼 13 nr
+费钱 22 n
+费长房 3 n
+费难 10 n
+费雯丽 9 nr
+费雷尔 7 nr
+费雷拉 5 nrt
+费雷现象 3 n
+费雷罗 9 nr
+费马原理 3 ns
+费马恩 5 nr
+费马数 2 n
+费鸿泰 2 nr
+费鸿钧 2 nr
+贺 1608 nr
+贺一航 3 nr
+贺一诚 256 nr
+贺一龙 8 nr
+贺世贤 2 nr
+贺人龙 208 nr
+贺从龙 2 nr
+贺信 58 nr
+贺兰 37 nr
+贺兰县 11 ns
+贺兰山 108 nr
+贺军翔 3 nr
+贺凤英 43 nr
+贺函 3 nr
+贺劲松 2 nr
+贺匾 3 n
+贺华姐姐 3 nr
+贺卡 84 nr
+贺卡站 3 nr
+贺卫方 2 nr
+贺县 20 ns
+贺同新 2 nr
+贺喜 106 nr
+贺国勇 3 nr
+贺国强 3 nr
+贺国英 3 nr
+贺国贤 3 nr
+贺圣华 4 nr
+贺圣寿 2 nr
+贺圣朝 3 nr
+贺天健 3 nr
+贺太守 11 nr
+贺子珍 128 nr
+贺孟斧 2 nr
+贺宗哲 3 nr
+贺客 7 nr
+贺客盈 6 nr
+贺客盈门 3 nr
+贺家兄弟 2 nr
+贺家坊 21 nr
+贺家庄 2 nr
+贺家湾 2 nr
+贺寨主 2 nr
+贺小书 3 nr
+贺小青 2 nr
+贺尔蒙 3 nr
+贺尔蒙针 3 nr
+贺屋兴 2 nr
+贺岁 18 nr
+贺岁剧 3 n
+贺岁杯 3 nr
+贺岁片 11 n
+贺岁版 3 v
+贺州 3 ns
+贺州市 2 ns
+贺帖 3 nr
+贺幛 3 n
+贺年 12 nr
+贺年卡 10 nr
+贺年片 4 n
+贺广华 3 nr
+贺廷延 2 nr
+贺循至 2 nr
+贺思林 2 nr
+贺承珍 2 nr
+贺拉斯 19 nr
+贺拔岳 31 nr
+贺拔度 2 nr
+贺拔氏 2 nr
+贺拔胜 6 nr
+贺敏学 5 nr
+贺敬之 12 nr
+贺文华 5 nr
+贺新君 2 nr
+贺新年 3 nr
+贺新郎 3 nr
+贺普丁 3 nr
+贺朔 3 nrfg
+贺朔礼 5 nr
+贺江 2 ns
+贺海 79 ns
+贺海大 2 nr
+贺海道 5 nr
+贺炳炎 256 nr
+贺狄干 2 nr
+贺玉堂 3 nr
+贺璐敏 4 nr
+贺生伟 3 nr
+贺田山 2 nr
+贺申康 2 nr
+贺电 39 vn
+贺疯子 23 nr
+贺盛瑞 2 nr
+贺知章 14 nr
+贺礼 49 nr
+贺秀莲 16 nr
+贺统军 29 nr
+贺维帧 4 nr
+贺绿汀 14 nrfg
+贺羽凡 3 nr
+贺耀宗 13 nr
+贺耀祖 18 nr
+贺老三 4 nr
+贺老大 13 nr
+贺联 3 ns
+贺胜桥 16 nr
+贺若弼 6 nr
+贺虎臣 3 nr
+贺表 5 nr
+贺词 41 nr
+贺逢圣 2 nr
+贺重宝 2 nr
+贺金龙 53 nr
+贺长龄 2 nr
+贺闯王 2 nr
+贺鲁之 3 nr
+贺鲁氏 2 nr
+贺鲁渐 2 nr
+贺鲁自 2 nr
+贺鹏飞 3 nr
+贺龙 199 nr
+贺龙任 6 nr
+贺龙来 256 nr
+贺龙部 2 nr
+贻 108 v
+贻人口实 3 i
+贻人话柄 3 i
+贻厥孙谋 3 i
+贻害 13 v
+贻害无穷 5 i
+贻患 3 n
+贻患无穷 2 i
+贻患终身 3 i
+贻祸 3 n
+贻笑 3 v
+贻笑后人 3 i
+贻笑大方 15 i
+贻羞 3 v
+贻臭万年 3 i
+贻误 143 v
+贻误军机 3 i
+贻误农时 3 n
+贻误戎机 3 i
+贻误战机 3 n
+贻误终身 3 i
+贻贝 38 n
+贻赠 3 v
+贼 5032 n
+贼不走空 3 i
+贼亮 13 n
+贼人 212 n
+贼人心虚 3 i
+贼人胆虚 3 i
+贼党 3 n
+贼兵 3 n
+贼军 3 n
+贼匪 3 n
+贼去关门 3 l
+贼喊捉贼 11 i
+贼头狗脑 3 i
+贼头贼脑 11 i
+贼头鬼脑 3 i
+贼头鼠脑 3 i
+贼子 3 n
+贼子乱臣 3 i
+贼寇 39 n
+贼巢 22 n
+贼店 3 n
+贼徒 3 n
+贼心 31 n
+贼心不死 16 i
+贼忒忒 2 z
+贼怎 3 l
+贼性 3 n
+贼星 2 n
+贼样 3 n
+贼欧 3 n
+贼死 3 n
+贼溜溜 3 z
+贼眉贼眼 3 i
+贼眉鼠目 3 i
+贼眉鼠眼 8 i
+贼眼 11 n
+贼秃 3 z
+贼窝 11 n
+贼胆 3 n
+贼臣乱子 3 i
+贼臣逆子 3 i
+贼船 16 n
+贼营 3 n
+贼赃 15 n
+贼走关门 3 l
+贼车 3 n
+贼风 3 n
+贼首 3 n
+贼骨头 19 n
+贼魁 3 n
+贽 26 g
+贾 1901 nr
+贾一平 3 nr
+贾三灌 2 nr
+贾世骏 3 nr
+贾乃亮 3 nr
+贾乃光 3 nr
+贾乌德 2 nr
+贾二爷 3 nr
+贾亚光 4 nr
+贾亚瓦 2 nr
+贾亚辛格 5 nr
+贾亦斌 259 nr
+贾人 3 nr
+贾人达 20 nr
+贾代儒 5 nr
+贾代化 2 nr
+贾似道 42 nr
+贾作光 4 nr
+贾侯渠 3 nr
+贾元春 4 nr
+贾先觉 2 nr
+贾兰中 2 nr
+贾兰便 3 nr
+贾兰坡 7 nr
+贾兰贾 2 nr
+贾兴光 3 nr
+贾冬梅 9 nr
+贾冰硬 2 nr
+贾南风 3 nr
+贾博士 2 nr
+贾口洼 2 nr
+贾可萨 2 nr
+贾吉尔 22 nr
+贾名儒 2 nr
+贾名化 2 nr
+贾基拉 3 nr
+贾大人 7 nr
+贾大泉 3 nr
+贾天祥 2 nr
+贾太君 2 nr
+贾夫人 2 nr
+贾夫纳 3 nr
+贾夫纳半岛 2 nr
+贾奇抢 2 nr
+贾奇换 2 nr
+贾奇断 2 nr
+贾姆希 2 nr
+贾姆谢 3 nr
+贾孝骞 5 nr
+贾宝丽 2 nr
+贾宝玉 62 nr
+贾客乐 2 nr
+贾宪三角 12 nr
+贾家庄 13 nr
+贾家沟 5 nr
+贾家疃 2 nr
+贾尔岭 3 nr
+贾尔德 2 nr
+贾尼丝 2 nr
+贾岛诗 2 nr
+贾巧姐 2 nr
+贾巴尔 17 nr
+贾布里 2 nr
+贾师弟 2 nr
+贾希兹 6 nr
+贾希利 5 nr
+贾平凹 50 nr
+贾庆林 46 nr
+贾府中 3 nr
+贾府之 3 nr
+贾府园 2 nr
+贾廷安 6 nr
+贾建舟 5 nr
+贾彰挥 2 nr
+贾德曾 2 nr
+贾德致 3 nr
+贾志杰 771 nr
+贾怀义 10 nr
+贾思勰 12 nr
+贾惜春 2 nr
+贾成钢 2 nr
+贾拉拉巴德 2 nrt
+贾拓夫 7 nr
+贾政一一 2 nr
+贾政之 2 nr
+贾政亦 2 nr
+贾政便 9 nr
+贾政先 4 nr
+贾政又 3 nr
+贾政叫 2 nr
+贾政叹 5 nr
+贾政同 2 nr
+贾政听 2 nr
+贾政命 7 nr
+贾政喝 2 nr
+贾政回 2 nr
+贾政因 6 nr
+贾政心 2 nr
+贾政忙 12 nr
+贾政才 3 nr
+贾政未 3 nr
+贾政正 2 nr
+贾政王 2 nr
+贾政知 6 nr
+贾政笑 27 nr
+贾政贾 3 nr
+贾政进 7 nr
+贾政道 8 nr
+贾政问 2 nr
+贾政闻 2 nr
+贾政陪 2 nr
+贾敬贾 3 nr
+贾敬颜 10 nr
+贾文先 2 nr
+贾文军 2 nr
+贾文鹏 3 nr
+贾斯丁 3 nr
+贾昌朝 3 nr
+贾春旺 8 nr
+贾昭全 3 nr
+贾朝轩 523 nr
+贾木纳 6 nr
+贾松阳 2 nr
+贾树三 4 nr
+贾根整 3 nr
+贾格尔 3 nr
+贾梅刚 2 nr
+贾梅笑 2 nr
+贾植芳 2 nr
+贾楼乡 3 nr
+贾母亦 4 nr
+贾母先 3 nr
+贾母凤 4 nr
+贾母刚 2 nr
+贾母命 12 nr
+贾母喜 5 nr
+贾母因 10 nr
+贾母安 2 nr
+贾母忙 6 nr
+贾母房 22 nr
+贾母才 3 nr
+贾母扶 2 nr
+贾母方 6 nr
+贾母明 2 nr
+贾母正 2 nr
+贾母歪 4 nr
+贾母灵 2 nr
+贾母王 22 nr
+贾母笑 9 nr
+贾母素 2 nr
+贾母薛 7 nr
+贾母赏 4 nr
+贾母邢 2 nr
+贾母问 2 nr
+贾比尔 8 nr
+贾氏家族 4 nr
+贾水儿 5 nr
+贾汪 4 nr
+贾汪区 3 nr
+贾沃斯 2 nr
+贾治邦 3 nr
+贾法尔 6 nr
+贾法里 2 nr
+贾特波 4 nr
+贾玉川 9 nr
+贾王史 2 nr
+贾环便 3 nr
+贾环见 6 nr
+贾环贾 12 nr
+贾环重 2 nr
+贾珍之 4 nr
+贾珍便 4 nr
+贾珍先 2 nr
+贾珍命 3 nr
+贾珍尤 5 nr
+贾珍忙 13 nr
+贾珍想 2 nr
+贾珍方 5 nr
+贾珍笑 13 nr
+贾珍见 3 nr
+贾珍贾 11 nr
+贾珍遂 2 nr
+贾珍酒 2 nr
+贾珠之 3 nr
+贾琏便 3 nr
+贾琏先 3 nr
+贾琏凤 2 nr
+贾琏复 2 nr
+贾琏宝玉 4 nr
+贾琏忙 9 nr
+贾琏拿 2 nr
+贾琏方 3 nr
+贾琏未 2 nr
+贾琏自 2 nr
+贾琏贾 10 nr
+贾琏越 2 nr
+贾琏陪 2 nr
+贾琏领 2 nr
+贾瑞前 2 nr
+贾瑞如 2 nr
+贾瑞新 3 nr
+贾瑞笑 3 nr
+贾瑞见 2 nr
+贾瓦德 3 nr
+贾生才 2 nr
+贾登屿 3 nr
+贾登峪 3 nr
+贾皇后 4 nr
+贾石头 3 nr
+贾祸 3 l
+贾秀全 54 nr
+贾秀飞 9 nr
+贾科梅 2 nr
+贾科维 5 nr
+贾笑天 6 nr
+贾米森 20 nr
+贾纳五 3 nr
+贾老六 17 nr
+贾老师 3 nr
+贾老板 3 nr
+贾老者 11 nr
+贾艺苑 4 nr
+贾英廷 128 nr
+贾英池 5 nr
+贾荇贾 2 nr
+贾菲尔 2 nr
+贾蓉一一 2 nr
+贾蓉之 12 nr
+贾蓉先 2 nr
+贾蓉忙 9 nr
+贾蓉方 3 nr
+贾蓉笑 5 nr
+贾蓉见 2 nr
+贾蓉送 2 nr
+贾西平 15 nr
+贾诩引 2 nr
+贾诩见 2 nr
+贾诩谏 3 nr
+贾谊 90 nr
+贾贝贝 6 nr
+贾贵人 2 nr
+贾迎春 6 nr
+贾那布尔 3 nr
+贾金刀 3 nr
+贾长老 5 nr
+贾雨岚 3 nr
+贾雨村 24 nr
+贾静雯 3 nr
+贾鲁修 3 nr
+贾鲁河 35 nr
+贾鲁治 2 nr
+贾鸿源 5 nr
+贿 153 v
+贿买 10 v
+贿款 22 v
+贿货公行 3 j
+贿赂 682 v
+贿赂公行 12 n
+贿赂并行 3 i
+贿赂案 13 n
+贿赂款 7 n
+贿赂罪 11 i
+贿赃 3 v
+贿选 29 v
+贿选案 3 n
+贿金 6 n
+赀 100 g
+赀财 3 nr
+赁 84 v
+赁租 3 n
+赁耳佣目 3 n
+赁金 3 n
+赂 53 ng
+赃 83 n
+赃品 3 n
+赃字 3 n
+赃官 32 n
+赃官污吏 3 n
+赃手 3 n
+赃款 33 n
+赃款赃物 3 v
+赃污狼籍 3 n
+赃物 60 n
+赃物罪 3 n
+赃盈恶贯 3 n
+赃私狼籍 3 n
+赃秽狼藉 3 nr
+赃证 13 n
+赃贿狼籍 3 n
+赃车 3 n
+资 1599 n
+资不抵债 36 l
+资中 10 n
+资中县 3 ns
+资产 3243 n
+资产值 3 n
+资产者 43 n
+资产负债 3 n
+资产负债率 21 n
+资产重组 3 n
+资产阶级 3764 n
+资产额 38 n
+资优 3 b
+资优儿童 3 n
+资优班 3 n
+资优生 3 n
+资信 21 n
+资信度 3 n
+资信通 3 n
+资俸 3 n
+资借 3 v
+资兴 7 b
+资兴县 3 ns
+资兴市 3 n
+资力 14 n
+资助 1316 n
+资助款 3 n
+资助者 10 n
+资助金 2 n
+资历 248 n
+资山 2 n
+资州 3 n
+资怨助祸 3 n
+资才 3 n
+资政 53 n
+资政院 3 n
+资料 9021 n
+资料册 3 n
+资料卡 3 n
+资料员 2 n
+资料夹 3 n
+资料完整 3 l
+资料室 58 n
+资料局 3 n
+资料库 32 n
+资料录 3 n
+资料性 9 n
+资料栓 3 n
+资料汇编 3 n
+资料片 2 n
+资料篇 3 n
+资料网 3 n
+资料袋 3 n
+资料费 10 n
+资料软件 3 n
+资料集 5 n
+资料馆 10 n
+资料齐全 3 l
+资斧 3 n
+资方 48 n
+资方人员 3 n
+资方代表 3 n
+资望 24 n
+资本 14732 n
+资本主义 5188 n
+资本主义化 3 n
+资本化 97 n
+资本周转 3 n
+资本外逃 3 l
+资本家 2575 n
+资本密集型 20 n
+资本帝国 3 n
+资本循环 3 n
+资本性 5 n
+资本有机 3 n
+资本积累 3 n
+资本论 150 n
+资本财 3 n
+资本货物 3 n
+资本输出 3 n
+资本运作 3 n
+资本金 41 n
+资本集中 3 n
+资本额 34 n
+资材 5 n
+资格 3379 n
+资格比赛 3 ns
+资格考试 3 n
+资格证 29 n
+资格证书 3 n
+资格赛 76 n
+资水 42 n
+资江 7 n
+资江号 3 n
+资治通鉴 162 n
+资浅 3 n
+资浅能鲜 3 l
+资浅齿少 3 l
+资深 560 n
+资深教师 3 n
+资深望重 3 n
+资深职员 3 n
+资源 17453 n
+资源优势 3 n
+资源传播 3 n
+资源共享 57 n
+资源分配 25 n
+资源化 8 n
+资源型 24 n
+资源委 4 n
+资源库 15 n
+资源性 9 n
+资源整合 3 n
+资源法 9 n
+资源班 3 n
+资源税 13 n
+资源管理 234 n
+资源类型 3 n
+资源网 3 n
+资源节约型 15 n
+资源贫乏 3 n
+资源转移 3 n
+资源配置 3 n
+资源重复 3 n
+资源量 21 n
+资溪 4 n
+资溪县 3 ns
+资生堂 5 n
+资禀 3 v
+资粮 7 n
+资讯 561 n
+资讯专栏 3 n
+资讯业 3 n
+资讯中心 3 n
+资讯学会 3 n
+资讯学系 3 n
+资讯展 3 n
+资讯工业 3 n
+资讯所 3 n
+资讯月 3 n
+资讯社 3 n
+资讯科技 3 n
+资讯系 3 n
+资讯网 3 n
+资讯通 3 n
+资询 3 vn
+资财 327 n
+资质 266 n
+资质审查 3 n
+资质等级 3 n
+资质聪颖 3 n
+资质证书 3 n
+资费 975 n
+资费套餐 3 n
+资金 6555 n
+资金不足 3 n
+资金分配 3 n
+资金占用 3 n
+资金卡 2 n
+资金周转 3 n
+资金回笼 3 n
+资金外流 3 n
+资金平衡 3 n
+资金户 2 n
+资金投入 3 n
+资金捐献 3 n
+资金来源 3 n
+资金流 11 n
+资金短缺 3 n
+资金积累 3 n
+资金紧张 3 n
+资金运用 3 n
+资金量 7 n
+资金雄厚 3 n
+资金面 24 n
+资金额 15 n
+资阳 19 n
+资阳区 3 n
+资阳县 3 ns
+资阳市 2 n
+赅 13 vg
+赆 8 g
+赈 193 v
+赈恤 7 v
+赈救 3 v
+赈款 2 v
+赈济 185 n
+赈济款 2 n
+赈灾 70 vn
+赈粮 3 v
+赈贫贷乏 3 n
+赈饥 3 v
+赉 38 zg
+赊 84 v
+赊乞 3 v
+赊买 3 v
+赊借 3 v
+赊债 3 v
+赊卖 3 v
+赊售 3 v
+赊帐 3 v
+赊旗镇 3 n
+赊欠 15 v
+赊给 3 v
+赊账 14 v
+赊购 20 v
+赊贷 3 v
+赊销 11 v
+赋 1362 v
+赋予 2186 v
+赋予宽 3 n
+赋于 3 v
+赋值 85 n
+赋值等价 3 n
+赋分 3 n
+赋存 55 v
+赋归 3 v
+赋形 2 n
+赋形剂 4 n
+赋役 269 n
+赋性 23 n
+赋性刚强 3 n
+赋敛 3 v
+赋有 150 v
+赋权 2 n
+赋格 22 n
+赋格曲 3 n
+赋禀 3 v
+赋税 675 n
+赋税额 3 n
+赋诗 79 n
+赋课 3 v
+赋贡 3 v
+赋逻辑论 3 n
+赋闲 58 v
+赋闲在家 3 n
+赋闲无事 3 n
+赌 1079 zg
+赌东道 3 n
+赌侠 3 n
+赌债 17 n
+赌具 13 n
+赌博 610 v
+赌博业 3 n
+赌博机 5 n
+赌博罪 2 n
+赌友 5 n
+赌台 3 n
+赌命 3 v
+赌咒 34 v
+赌咒发誓 36 i
+赌圣 3 v
+赌场 221 n
+赌坊 3 n
+赌城 3 n
+赌客 64 n
+赌局 20 n
+赌帐 3 n
+赌彩 3 n
+赌彩一掷 3 i
+赌徒 59 n
+赌户 3 n
+赌房 3 n
+赌技 3 n
+赌数 3 n
+赌本 4 n
+赌术 3 n
+赌枱 3 vn
+赌桌 3 n
+赌棍 15 n
+赌气 219 n
+赌法 3 n
+赌注 101 v
+赌物 3 n
+赌物思人 3 n
+赌王 3 n
+赌球 19 n
+赌瘾 3 v
+赌神 3 n
+赌神发咒 3 n
+赌窝 3 n
+赌窟 2 n
+赌誓 3 v
+赌誓发原 3 i
+赌誓发愿 3 i
+赌账 3 v
+赌资 22 n
+赌赛 3 n
+赌赢 3 v
+赌输 3 vn
+赌过 3 v
+赌运 3 v
+赌金 3 n
+赌钱 179 v
+赌长较短 3 n
+赌风 3 n
+赌馆 3 n
+赌马 3 n
+赌马场 3 n
+赌鬼 5 n
+赍 339 g
+赍志以没 3 nr
+赍志而没 3 v
+赍粮藉寇 3 nr
+赎 436 v
+赎买 59 v
+赎买政策 3 n
+赎人 3 n
+赎价 3 vn
+赎命 3 vn
+赎回 129 v
+赎回费 3 n
+赎当 5 v
+赎款 5 v
+赎罪 122 vn
+赎罪券 3 n
+赎职 3 v
+赎身 42 v
+赎金 44 n
+赏 2419 v
+赏一劝众 3 vn
+赏一劝百 3 nz
+赏不当功 3 i
+赏不逾日 3 i
+赏不逾时 3 i
+赏不遗贱 3 i
+赏信罚必 3 i
+赏信罚明 3 i
+赏光 32 n
+赏到 3 v
+赏功罚罪 5 i
+赏劳罚罪 3 i
+赏同罚异 3 i
+赏善罚否 3 i
+赏善罚恶 41 i
+赏奇析疑 3 n
+赏封 3 v
+赏心 205 n
+赏心乐事 13 i
+赏心悦事 3 i
+赏心悦目 68 i
+赏月 80 n
+赏望 3 v
+赏来赏去 3 i
+赏析 46 vn
+赏格 3 n
+赏梅 3 n
+赏测站 3 n
+赏点 3 n
+赏玩 62 v
+赏画 3 n
+赏立诛必 3 i
+赏给 3 v
+赏罚 76 v
+赏罚不明 3 i
+赏罚严明 5 i
+赏罚信明 3 i
+赏罚分明 21 i
+赏脸 52 n
+赏花 108 n
+赏花季节 3 n
+赏菊 3 n
+赏识 352 v
+赏贤罚暴 3 i
+赏赐 641 n
+赏赐无度 3 i
+赏金 39 n
+赏鉴 18 v
+赏钱 91 v
+赏银 3 n
+赏错 3 a
+赏阅 3 v
+赏高罚下 3 i
+赐 2375 v
+赐与 48 v
+赐予 267 v
+赐函 3 v
+赐告 3 v
+赐墙及肩 3 v
+赐奖 3 v
+赐姓 3 v
+赐官 3 v
+赐宴 3 v
+赐教 84 v
+赐死 3 v
+赐爵 3 v
+赐福 33 v
+赐稿 6 v
+赐给 3 v
+赐茅授土 3 nr
+赐諡 3 vn
+赑 26 zg
+赒 5 zg
+赓 22 nr
+赔 866 v
+赔上 3 v
+赔上去 3 v
+赔上来 3 v
+赔不是 64 l
+赔不起 3 v
+赔了夫人 3 l
+赔了夫人又折兵 15 i
+赔付 45 v
+赔付率 2 n
+赔偿 1072 v
+赔偿义务 3 n
+赔偿制度 3 n
+赔偿损失 3 n
+赔偿机关 3 l
+赔偿标准 3 n
+赔偿案 9 n
+赔偿款 2 n
+赔偿法 2 n
+赔偿物 3 n
+赔偿申请 3 n
+赔偿费 15 n
+赔偿金 45 n
+赔偿额 3 n
+赔光 3 n
+赔出 3 v
+赔到 3 v
+赔垫 3 n
+赔小心 10 l
+赔帐 3 n
+赔得 3 v
+赔得起 3 v
+赔情 3 n
+赔损 3 v
+赔掉 3 v
+赔本 50 n
+赔本生意 3 l
+赔本赚吆喝 4 l
+赔款 339 n
+赔率 184 n
+赔礼 51 v
+赔礼道歉 50 l
+赔笑 99 v
+赔笑脸 6 l
+赔罪 119 v
+赔补 3 v
+赔话 3 v
+赔账 3 v
+赔身下气 3 l
+赔还 12 v
+赔钱 64 v
+赔钱货 4 n
+赔错 3 v
+赔额 3 n
+赕 5 g
+赖 1199 nr
+赖世德 2 nr
+赖世雄 3 nr
+赖丘尔 2 nr
+赖于 3 v
+赖于贞 2 nr
+赖亚文 3 nr
+赖仁琼 3 nr
+赖仕程 2 nr
+赖以 262 v
+赖以为生 7 l
+赖以生存 106 l
+赖伐尔 17 nr
+赖众兄弟 2 nr
+赖传珠 5 nr
+赖债 3 n
+赖光信 5 nr
+赖兴巴 6 nr
+赖其芳 2 nr
+赖听风 2 nr
+赖吴摩 3 nr
+赖和木 2 nr
+赖喜荣 2 nr
+赖在乾 2 nr
+赖在宫 2 nr
+赖大之 2 nr
+赖太后 2 nr
+赖婚 3 v
+赖嬷嬷 9 nr
+赖学 3 nr
+赖安 6 nr
+赖小子 8 nr
+赖尔德 3 nr
+赖尚荣 12 nr
+赖尼莱 4 nr
+赖帐 18 n
+赖平原 2 nr
+赖床 3 v
+赖彩勤 5 nr
+赖振生 4 nr
+赖掉 9 v
+赖文光 9 nr
+赖文武 4 nr
+赖斯 88 nr
+赖斯兰 3 nr
+赖斯称 3 nr
+赖斯说 3 nr
+赖斯顿 2 nr
+赖昌星 10 nr
+赖明珠 3 nr
+赖明辉 2 nr
+赖有此耳 3 l
+赖林诸 2 nr
+赖桑德 2 nr
+赖歇尔 2 nr
+赖比瑞亚 3 nr
+赖氏法 2 nr
+赖氨酸 51 n
+赖汉英 3 nr
+赖特 86 nr
+赖特曼 3 nr
+赖特菲 5 nr
+赖皮 20 nr
+赖秀英 18 nr
+赖索托 3 nr
+赖茶清 2 nr
+赖词 3 nr
+赖诺尔 2 nr
+赖账 24 v
+赖账者 4 n
+赖过 3 v
+赖邓艾 3 nr
+赖郭靖 2 nr
+赘 163 ag
+赘人 3 n
+赘婿 15 n
+赘字 3 n
+赘文 3 n
+赘木 3 n
+赘物 3 n
+赘疣 6 n
+赘瘤 3 n
+赘笔 3 n
+赘聚 3 v
+赘肉 24 n
+赘言 13 n
+赘词 3 n
+赘述 56 v
+赘食太仓 3 n
+赘饰 3 n
+赙 8 vg
+赙仪 3 v
+赙赠 2 v
+赚 1870 v
+赚下来 3 v
+赚个饱 3 n
+赚了钱 3 v
+赚人眼泪 3 n
+赚你没 3 n
+赚八万 3 n
+赚到 3 v
+赚取 113 v
+赚回 3 v
+赚大钱 3 v
+赚头 18 v
+赚完 3 v
+赚有 3 v
+赚法 3 v
+赚疯了 3 n
+赚赚 3 v
+赚赚看 3 v
+赚起 3 v
+赚起来 3 v
+赚过 3 v
+赚过去 3 v
+赚过来 3 v
+赚钱 634 v
+赚钱事业 3 n
+赚钱快 3 v
+赚钱网 3 n
+赚饱 3 v
+赚黑心钱 3 n
+赛 2783 nz
+赛乃姆 5 nr
+赛义夫 2 nr
+赛义德 35 nr
+赛事 599 n
+赛仁贵 8 nr
+赛伊尼 2 nr
+赛会 82 nz
+赛伯 2 nz
+赛伯伊 3 nr
+赛似 3 v
+赛依特 2 nr
+赛先生 26 nr
+赛克 4 nz
+赛克勒 3 nr
+赛克尔 2 nr
+赛克斯 10 nr
+赛典赤 15 nr
+赛况 18 n
+赛到 3 v
+赛制 100 n
+赛前 298 t
+赛力散 3 nr
+赛努西 3 nr
+赛勒 2 nz
+赛区 182 n
+赛博数码 3 n
+赛卡特 2 nr
+赛后 517 t
+赛员 3 n
+赛唐猊 2 nr
+赛圆满 3 nr
+赛地 13 nz
+赛场 473 n
+赛塞尔 2 nr
+赛姆勒 2 nr
+赛姆斯 4 nr
+赛季 1605 t
+赛宝 6 nz
+赛尔 12 nz
+赛尔达 3 nz
+赛弗斯 2 nr
+赛德 2 nrt
+赛德斯 2 nr
+赛德隆 3 nr
+赛德鲁 2 nr
+赛总管 3 nz
+赛手 3 n
+赛扬 32 nr
+赛拉 20 nrt
+赛拉图 3 nr
+赛斯 11 nz
+赛斯纳 2 nr
+赛春社 2 nr
+赛普特 3 nr
+赛期 3 t
+赛果 46 n
+赛格 25 n
+赛格康丽 3 nr
+赛欧 3 ns
+赛段 13 n
+赛汉路 2 nz
+赛点 14 n
+赛特 24 nz
+赛狗场 3 n
+赛珍珠 5 nr
+赛球 3 n
+赛璐玢 3 nr
+赛璐珞 17 n
+赛码 3 n
+赛神 3 nz
+赛福 2 nz
+赛福鼎 8 nr
+赛程 96 n
+赛程表 3 n
+赛米尔 9 nr
+赛纪 2 nz
+赛纳河 2 nr
+赛罕区 3 nr
+赛船 3 nz
+赛艇 30 n
+赛诺 2 nz
+赛诺菲 7 nr
+赛责 3 v
+赛跑 85 v
+赛跑员 3 n
+赛跑者 3 n
+赛跑选手 3 n
+赛车 143 n
+赛车场 22 n
+赛车手 3 n
+赛车服 3 n
+赛车狂 3 nz
+赛车车把 3 nz
+赛车迷 3 nz
+赛车选手 3 n
+赛车队 4 n
+赛达 7 nz
+赛过 35 v
+赛迪 18 nz
+赛迪网 164 nz
+赛道 13 n
+赛里木湖 10 ns
+赛金花 3 nz
+赛锦体 3 nr
+赛门铁克 3 nz
+赛音诺 14 nr
+赛风 7 nz
+赛马 95 nz
+赛马会 2 nz
+赛马场 9 n
+赛马节 3 nr
+赛龙 6 nz
+赛龙泉 2 nz
+赛龙舟 3 nz
+赜 87 g
+赝 54 n
+赝品 63 n
+赝币 3 n
+赝本 3 n
+赝鼎 5 n
+赞 1347 v
+赞不绝口 68 i
+赞乐 3 ns
+赞佩 17 v
+赞助 379 v
+赞助人 8 v
+赞助商 73 v
+赞助者 7 n
+赞助费 31 v
+赞叹 577 v
+赞叹不已 45 i
+赞叹不止 3 l
+赞叹声 5 i
+赞同 721 v
+赞同者 6 n
+赞哈 5 nrt
+赞善 14 v
+赞声不绝 3 i
+赞德 7 nrt
+赞成 1162 v
+赞成票 55 n
+赞成者 9 n
+赞扬 616 v
+赞扬声 3 i
+赞普 43 nrt
+赞歌 61 v
+赞比亚 195 ns
+赞比亚共和国 2 ns
+赞比西河 69 ns
+赞皇 2 n
+赞皇县 8 ns
+赞礼 85 v
+赞美 395 ns
+赞美有加 3 l
+赞美歌 4 n
+赞美诗 36 l
+赞美诗学 3 l
+赞美诗集 3 i
+赞羡 3 v
+赞臣 2 n
+赞誉 200 n
+赞誉之辞 3 i
+赞誉声 2 n
+赞许 156 v
+赞词 12 n
+赞语 20 nz
+赞赏 581 v
+赞赏不已 3 l
+赞辞 3 v
+赞颂 84 v
+赟 171 zg
+赠 627 v
+赠与 84 v
+赠与税 3 n
+赠与者 3 n
+赠书 24 n
+赠予 35 v
+赠以 3 v
+赠别 5 v
+赠券 3 n
+赠台大 3 n
+赠品 26 n
+赠奖 3 v
+赠序 3 n
+赠本 3 n
+赠机 3 n
+赠款 27 n
+赠物 4 n
+赠礼 6 v
+赠票 8 n
+赠答 15 v
+赠给 83 v
+赠言 20 v
+赠订 3 v
+赠送 461 v
+赠送品 3 n
+赠送礼品 3 n
+赠送给 3 n
+赠阅 8 v
+赠阅本 3 n
+赡 215 vg
+赡养 89 v
+赡养人 3 n
+赡养父母 3 n
+赡养费 15 n
+赡望 3 v
+赢 2471 v
+赢了球 3 v
+赢余 3 v
+赢出 3 v
+赢分 3 n
+赢利 213 n
+赢利性 9 n
+赢利点 2 n
+赢到 3 v
+赢取 30 v
+赢回 3 v
+赢回去 3 n
+赢回来 3 n
+赢大奖 3 nz
+赢奸卖俏 3 n
+赢定 3 v
+赢定了 3 v
+赢家 80 n
+赢彩屏 3 n
+赢得 1216 v
+赢得好评 3 n
+赢得荣誉 3 n
+赢政 3 n
+赢方 3 n
+赢球 3 n
+赢过去 3 v
+赢过来 3 v
+赢金一经 3 nz
+赢钱 3 v
+赢队 3 n
+赢面 24 n
+赣 697 ns
+赣东 6 ns
+赣九江 3 ns
+赣剧 8 nz
+赣北 16 ns
+赣南 181 ns
+赣南果业 5 nz
+赣南盆地 3 ns
+赣县 20 ns
+赣州 140 ns
+赣州市 15 ns
+赣州网 3 nz
+赣榆 6 ns
+赣榆县 5 ns
+赣江 98 ns
+赣粤高速 4 nz
+赣莲 5 ns
+赣西 17 ns
+赣西南 55 ns
+赤 2612 vg
+赤乌 13 ns
+赤井英和 3 nz
+赤光 3 n
+赤兔 3 n
+赤兔马 27 n
+赤军 28 n
+赤化 3 n
+赤卫军 7 n
+赤卫队 47 n
+赤县 4 ns
+赤县神州 6 ns
+赤口毒舌 3 i
+赤口白舌 3 i
+赤叶河 2 n
+赤员 3 n
+赤土 3 n
+赤地 3 n
+赤地千里 12 i
+赤坂 2 ns
+赤坎 3 n
+赤坎区 3 n
+赤型构型 3 n
+赤城 22 ns
+赤城县 3 ns
+赤塔 16 n
+赤壁 945 n
+赤壁之战 3 i
+赤壁大战 3 i
+赤壁市 257 ns
+赤壁赋 3 nr
+赤壁鏖兵 3 vn
+赤子 50 n
+赤子之心 21 i
+赤子心 3 n
+赤子情 3 n
+赤字 336 n
+赤小豆 6 nr
+赤山 16 ns
+赤岗 3 ns
+赤岭 4 ns
+赤峰 66 ns
+赤峰市 47 ns
+赤崁楼 3 v
+赤嵌楼 8 n
+赤巴 5 ns
+赤帝 4 n
+赤带 3 n
+赤径 3 n
+赤心 27 n
+赤心报国 4 n
+赤心相待 3 i
+赤忱 3 n
+赤手 3 n
+赤手上阵 3 i
+赤手空拳 246 i
+赤手起家 3 nz
+赤旗 21 ns
+赤旗报 4 nz
+赤日 3 n
+赤日炎炎 3 nr
+赤木 4 n
+赤木律子 3 ns
+赤条条 104 z
+赤杨 113 nr
+赤松 47 n
+赤柱 4 n
+赤棠 3 n
+赤橙 3 n
+赤水 80 n
+赤水市 4 ns
+赤水河 47 ns
+赤沙 2 ns
+赤泥 3 n
+赤潮 24 n
+赤热 3 z
+赤焰 24 n
+赤狐 6 nz
+赤瓜 2 n
+赤瓜礁 6 ns
+赤痢 3 n
+赤白痢 3 n
+赤眉 3 ns
+赤眼蜂 17 n
+赤眼鳟 4 n
+赤石 6 n
+赤石脂 2 n
+赤磷 3 nz
+赤祸 3 n
+赤红 50 z
+赤红色 15 n
+赤练蛇 16 n
+赤绳系足 3 nr
+赤老温 3 nr
+赤胆 3 n
+赤胆忠心 41 i
+赤背 3 n
+赤脚 108 n
+赤脚医生 14 n
+赤脚大仙 3 i
+赤膊 42 n
+赤膊上阵 18 i
+赤舌烧城 3 ns
+赤色 61 n
+赤色彗星 3 n
+赤芍 15 n
+赤藓酮糖 3 v
+赤螯蟹 3 v
+赤血 3 n
+赤血魔剑 3 i
+赤裸 142 z
+赤裸裸 130 z
+赤褐色 13 n
+赤西仁 3 nr
+赤诚 63 nr
+赤诚相待 3 i
+赤诚相见 3 i
+赤豆 24 n
+赤豆粥 2 nz
+赤贫 74 a
+赤贫如洗 3 i
+赤足 37 z
+赤身 16 n
+赤身裸体 58 i
+赤身露体 30 i
+赤道 771 n
+赤道几内 3 ns
+赤道几内亚 45 ns
+赤道几内亚共和国 3 ns
+赤道区 3 ns
+赤道带 3 n
+赤道板 3 n
+赤道气候 3 n
+赤道面 3 n
+赤金 37 n
+赤金色 3 n
+赤铁矿 53 nz
+赤铜 8 n
+赤铜矿 8 n
+赤霉病 9 n
+赤霉素 36 n
+赤霉菌 3 n
+赤露 3 v
+赤面 8 n
+赤马 3 ns
+赤黑 3 z
+赥 2 zg
+赦 1157 v
+赦令 10 v
+赦免 167 v
+赦免令 3 n
+赦免权 5 n
+赦宥 11 v
+赦罪 28 v
+赦过宥罪 3 vn
+赧 26 zg
+赧愧 3 v
+赧然 3 v
+赧颜 3 v
+赧颜汗下 3 ns
+赫 586 nr
+赫什 5 nrt
+赫伦岛 2 nr
+赫伦施 2 nr
+赫伯森 2 nr
+赫伯特 19 nr
+赫位克 16 nr
+赫佐格 2 nr
+赫克托 8 nr
+赫克算子 3 nr
+赫兹 108 nr
+赫兹振子 3 nr
+赫内斯 8 nr
+赫切萨 4 nr
+赫利博 4 nr
+赫利奥 3 nr
+赫加齐 2 nr
+赫勒万 5 nr
+赫勒拿 2 nr
+赫勒敦 6 nr
+赫勒斯 4 nr
+赫勒福 2 nr
+赫卢太 96 nr
+赫哲人 4 nr
+赫哲族 30 nr
+赫哲语 2 nr
+赫图阿拉 20 nrt
+赫塔菲 8 nr
+赫大通 3 nr
+赫夫尔 2 nr
+赫奈斯 2 nr
+赫奕 3 z
+赫姆斯 5 nr
+赫尔 55 nr
+赫尔伯特 2 nrt
+赫尔佐格 2 nrt
+赫尔内 2 nrt
+赫尔利 27 nr
+赫尔城 2 nr
+赫尔墨斯 19 nr
+赫尔姆 2 nr
+赫尔姆斯 7 nrt
+赫尔岑 30 nr
+赫尔巴特 14 nrt
+赫尔德 9 nr
+赫尔措 4 nr
+赫尔斯 4 nr
+赫尔新 2 nr
+赫尔新基 3 nrt
+赫尔曼 27 nr
+赫尔曼德 3 nrt
+赫尔曼斯 3 nrt
+赫尔松 4 nr
+赫尔瓦 2 nr
+赫尔穆特 2 nrt
+赫尔索格 4 nrt
+赫尔谟 2 nr
+赫尔辛 3 nr
+赫尔辛基 91 nrt
+赫尔辛基大学 18 nt
+赫尔辛堡 3 nrt
+赫尔默 3 nr
+赫山区 3 ns
+赫巴蒂 10 nr
+赫布里底 31 nrt
+赫师慎 8 nr
+赫希斯 7 nr
+赫希贝 3 nr
+赫德 24 nr
+赫德任 2 nr
+赫德总 3 nr
+赫德森 5 nr
+赫德逊河 3 nr
+赫拉 142 nrt
+赫拉之 2 nr
+赫拉克 82 nr
+赫拉克利特 18 nrt
+赫拉姆 2 nr
+赫拉特 25 nr
+赫拉笑 6 nr
+赫拉霍娃 3 nr
+赫敦 4 ns
+赫斐斯 3 nr
+赫斯之威 3 nr
+赫斯之怒 3 nr
+赫斯塔尔 5 nrt
+赫斯定 3 nr
+赫斯希 16 nr
+赫斯特 45 nr
+赫曼斯 5 nr
+赫曼斯力 6 nrt
+赫曼汗 6 nr
+赫本 15 ns
+赫林耶 5 nr
+赫格隆 27 nr
+赫梅利 5 nr
+赫梅尔尼 2 nrt
+赫梯古 4 nr
+赫梯语 6 nz
+赫歇尔 27 nr
+赫歇耳 7 nr
+赫比格 3 nr
+赫氏堡 13 nr
+赫法伊 16 nr
+赫洛亚 2 nr
+赫海泉 3 nr
+赫然 445 z
+赫然在目 12 i
+赫然有声 3 i
+赫然而怒 3 i
+赫特尔 3 nr
+赫特福德 2 nr
+赫特福德郡 2 nr
+赫特纳 4 nr
+赫特队 4 nt
+赫磁共振 3 l
+赫福德 4 nr
+赫穆德 3 nr
+赫章 6 nr
+赫章县 2 nr
+赫米特 6 nr
+赫维留 3 nr
+赫维茨 2 nrt
+赫维西 8 nr
+赫罗图 23 nr
+赫耳墨斯 2 nr
+赫胥黎 30 nr
+赫脱 2 nrt
+赫舒斯 5 nr
+赫苏斯 2 nr
+赫英全 5 nr
+赫茨 10 nrt
+赫茨伯格 3 nrt
+赫茨尔 4 nr
+赫荣刚 3 nr
+赫莱布 5 nr
+赫莱斯 3 nr
+赫莲娜 3 nr
+赫菲斯 5 nr
+赫蒂布 5 nr
+赫蒂常 2 nr
+赫蒂彻 8 nr
+赫西奥 7 nr
+赫谢尔 4 nr
+赫费斯 3 nr
+赫赖亚 16 nr
+赫赫 115 nr
+赫赫之光 3 nr
+赫赫之功 3 nr
+赫赫功绩 3 nr
+赫赫巍巍 3 z
+赫赫战功 3 nr
+赫赫扬扬 3 nr
+赫赫有名 96 nr
+赫赫炎炎 3 nr
+赫赫的 21 z
+赫达亚 3 nr
+赫达尔 2 nr
+赫连铁树 3 nr
+赫迪夫 2 nr
+赫里 11 q
+赫里斯 4 nr
+赫里欧 7 nr
+赫里河 2 nr
+赫雷斯 3 nr
+赫雷罗 18 nr
+赫马尼 8 nr
+赫鲁宛 5 nr
+赫鲁晓夫 218 nr
+赫鲁雪夫 3 nr
+赬 3 zg
+赭 40 n
+赭石 15 n
+赭石色 4 n
+赭红 6 b
+赭红色 12 n
+赭色 14 b
+赭衣塞路 3 n
+赭霉素 3 n
+赭黄 17 b
+赭黄色 4 n
+走 50437 v
+走一遍 3 l
+走一遭 3 i
+走上 2107 v
+走上台 3 v
+走上正轨 3 i
+走下 3 v
+走下台 3 n
+走下坡 3 n
+走下坡路 51 l
+走不动 3 l
+走不开 3 v
+走不过去 3 l
+走为上着 3 l
+走为上策 14 i
+走为上计 16 l
+走乡串户 3 l
+走亲戚 3 n
+走亲访友 7 l
+走人 174 n
+走伏无地 3 i
+走低 62 v
+走俏 47 v
+走光 3 n
+走光图 3 n
+走光照 3 n
+走光网 3 n
+走入 335 v
+走兽 316 n
+走内线 3 n
+走出 3073 v
+走到 3 v
+走动 245 v
+走势 687 n
+走势图 6 i
+走卒 18 n
+走单骑 3 n
+走南闯北 35 i
+走去 3 v
+走口 3 n
+走召 3 v
+走台 3 n
+走合 3 v
+走后门 77 n
+走后门儿 3 l
+走向 3550 v
+走向世界 3 n
+走向前去 3 l
+走向前来 3 l
+走向市场 3 n
+走味 3 v
+走味儿 3 v
+走哇 3 n
+走唱 3 v
+走回 3 v
+走回头 3 l
+走回头路 20 l
+走回路 3 l
+走够 3 v
+走失 39 v
+走头无路 4 i
+走好运 2 n
+走娘家 3 n
+走字 3 n
+走家串户 2 l
+走帐 3 n
+走带 3 n
+走廊 954 n
+走开 333 v
+走弯路 48 n
+走强 107 v
+走形 11 n
+走往 3 v
+走得快 3 v
+走得慢 3 l
+走投无路 173 i
+走投没路 3 i
+走捷径 10 n
+走掉 71 v
+走散 26 v
+走时 170 n
+走村串户 16 l
+走村入户 3 n
+走来 1041 v
+走来走去 3 i
+走板 3 n
+走极端 9 n
+走样 28 n
+走桃花运 3 n
+走棋 3 n
+走檐飞翘 3 n
+走步 26 v
+走气 3 n
+走水 24 n
+走江湖 87 n
+走法 31 n
+走漏 90 v
+走漏天机 3 i
+走漏消息 3 i
+走漏风声 25 i
+走火 33 v
+走火入魔 80 l
+走点 3 n
+走狗 530 n
+走眼 13 n
+走着瞧 91 l
+走石飞沙 3 n
+走神 26 n
+走神儿 4 n
+走离 3 v
+走禽 3 n
+走私 900 n
+走私案 4 n
+走私案件 3 n
+走私汽车 3 n
+走私物品 3 n
+走私犯 7 i
+走私罪 8 i
+走私者 4 n
+走私船 10 n
+走私货 4 n
+走私贩私 12 l
+走私车 3 n
+走稳 3 v
+走穴 21 n
+走笔 5 n
+走笔疾书 3 n
+走笔题诗 3 n
+走索 3 v
+走累 3 v
+走红 65 v
+走红运 2 n
+走绳 3 n
+走绳索者 3 n
+走老路 8 n
+走老运 3 n
+走背运 5 n
+走脱 3 v
+走船 3 n
+走色 3 n
+走花溜冰 3 i
+走花溜水 3 l
+走街串巷 23 l
+走访 574 v
+走访调查 3 l
+走读 12 v
+走读学校 3 n
+走读生 16 n
+走调 3 v
+走调儿 3 l
+走账 3 v
+走资 6 vn
+走资派 96 n
+走走 366 v
+走走停停 29 v
+走走看 3 v
+走走看看 8 l
+走走过场 3 l
+走起 3 v
+走起路来 3 l
+走趟 3 v
+走跌 3 v
+走路 813 n
+走过 862 v
+走过场 31 n
+走运 38 v
+走近 962 v
+走近路 3 l
+走进 2742 v
+走远路 3 n
+走遍 135 v
+走遍全国 3 n
+走道 33 v
+走道儿 2 n
+走避 14 v
+走钢丝 20 n
+走钢丝者 3 n
+走错 3 v
+走镖 3 n
+走门串户 3 l
+走门子 2 n
+走门路 3 n
+走险 3 n
+走霉运 3 n
+走露 3 v
+走题 3 n
+走马 44 n
+走马上任 47 l
+走马到任 3 l
+走马岭 768 n
+走马换将 44 i
+走马灯 70 n
+走马疳 3 n
+走马看花 3 i
+走马章台 3 l
+走马观花 31 i
+走马赴任 3 i
+走高 106 v
+走麦城 9 n
+赳 43 x
+赳赳 3 z
+赳赳武夫 3 v
+赴 4943 v
+赴义 3 v
+赴京 3 v
+赴任 84 v
+赴告 3 v
+赴宴 153 v
+赴席 17 v
+赴往 3 v
+赴敌 3 v
+赴救 3 v
+赴死 29 v
+赴汤蹈火 79 i
+赴法 37 v
+赴约 46 v
+赴美 3 v
+赴美国 3 i
+赴考 10 v
+赴英 3 i
+赴藏 3 v
+赴试 3 v
+赴险如夷 3 i
+赴难 13 v
+赵 3084 nr
+赵一伤 3 nr
+赵一曼 8 nr
+赵一荻 233 nr
+赵三叔 9 nr
+赵三哥 41 nr
+赵三弟 2 nr
+赵三当 2 nr
+赵三爷 49 nr
+赵与齐 3 nr
+赵世延 5 nr
+赵世炎 177 nr
+赵世璋 3 nr
+赵世衡 2 nr
+赵中立 4 nr
+赵为御 3 nr
+赵为氏 3 nr
+赵为民 2 nr
+赵主父 2 nr
+赵丽萍 2 nr
+赵丽蓉 6 nr
+赵之战 2 nr
+赵之琛 3 nr
+赵之谦 12 nr
+赵之龙 25 nr
+赵乐际 3 nr
+赵乘齐 3 nr
+赵九章 2 nr
+赵书文 3 nr
+赵争争 140 nr
+赵二人 4 nr
+赵二哥 23 nr
+赵二女 2 nr
+赵二媳妇 9 nr
+赵二嫂 7 nr
+赵于林 2 nr
+赵云 236 nr
+赵云之 6 nr
+赵云传 3 nr
+赵云入 3 nr
+赵云分 2 nr
+赵云回 4 nr
+赵云带 2 nr
+赵云弃 2 nr
+赵云引 18 nr
+赵云得 2 nr
+赵云挺 5 nr
+赵云擒 2 nr
+赵云正 2 nr
+赵云谏 3 nr
+赵云领 5 nr
+赵五娘 6 nr
+赵亚利 2 nr
+赵亦华 2 nr
+赵人孩 12 nr
+赵仁成 3 nr
+赵仅存 2 nr
+赵令穰 3 nr
+赵仰仲 2 nr
+赵伟之 2 nr
+赵伯驹 5 nr
+赵作峻 5 nr
+赵侍郎 4 nr
+赵保吉 3 nr
+赵保忠 2 nr
+赵俪生 2 nr
+赵元任 12 nr
+赵元奴 21 nr
+赵充哲 2 nr
+赵充国 12 nr
+赵先生 39 nr
+赵光义 3 nr
+赵光怀 2 nr
+赵光贤 2 nr
+赵克惠 5 nr
+赵全德 2 nr
+赵全营村 3 nr
+赵公元帅 4 nr
+赵公子 9 nr
+赵公明 6 nr
+赵兰英 4 nr
+赵兴一 2 nr
+赵兴林 7 nr
+赵兴邦 2 nr
+赵军 50 nr
+赵凤昌 112 nr
+赵凯球 9 nr
+赵利红 2 nr
+赵剑华 9 nr
+赵匡胤 174 nr
+赵匡赢 2 nr
+赵升东 2 nr
+赵半山 379 nr
+赵卓昀 3 nr
+赵南星 63 nr
+赵南起 9 nr
+赵博生 24 nr
+赵卫国 2 nr
+赵厚麟 4 nr
+赵友钦 4 nr
+赵叔翘 2 nr
+赵可铭 257 nr
+赵合德 26 nr
+赵向北 3 nr
+赵向齐 2 nr
+赵君卿 8 nr
+赵君徽 8 nr
+赵启昌 6 nr
+赵启明 3 nr
+赵启正 20 nr
+赵启霖 12 nr
+赵员外 39 nr
+赵和尚 3 nr
+赵咏华 3 nrfg
+赵哲畏 2 nr
+赵善桐 2 nr
+赵嘉鸣 3 nr
+赵嘉麟 3 nr
+赵四公子 8 nr
+赵国 73 nr
+赵国为 2 nr
+赵国光 10 nr
+赵国则 3 nr
+赵国基 2 nr
+赵国政 3 nr
+赵国旺 3 nr
+赵国良 2 nr
+赵国荣 5 nr
+赵国都 4 nr
+赵国霖 15 nr
+赵城藏 3 nr
+赵城镇 2 nr
+赵堂官 12 nr
+赵士祯 4 nr
+赵士程 2 nr
+赵复至 3 nr
+赵大人 24 nr
+赵大哥 44 nr
+赵大夫 6 nr
+赵大姐 7 nr
+赵大娘 10 nr
+赵大年 2 nr
+赵大明 525 nr
+赵大锤 90 nr
+赵天王 2 nr
+赵天衡 14 nr
+赵天麟 2 nr
+赵太夫人 4 nr
+赵奎娥 3 nr
+赵姑娘 26 nr
+赵姨奶奶 9 nr
+赵姨娘 127 nr
+赵娘子 27 nr
+赵娟娟 3 nrfg
+赵嬷嬷 13 nr
+赵子健 2 nr
+赵子固 2 nr
+赵子岳 2 nr
+赵子昂 3 nr
+赵子曰 2 nr
+赵子林 4 nr
+赵子琴 2 nr
+赵子龙 52 nr
+赵孝东 4 nr
+赵孝成 5 nr
+赵孟坚 2 nr
+赵孟頫 3 ns
+赵学勤 2 nr
+赵学敏 2 nr
+赵学而 3 nr
+赵守琴 2 nr
+赵安宗 7 nr
+赵安开 3 nr
+赵宋无 2 nr
+赵宏博 18 nr
+赵宏声 407 nr
+赵宗燠 2 nr
+赵官儿 3 nr
+赵宜主 2 nr
+赵宝刚 4 nr
+赵宝民 5 nr
+赵宣子 3 nr
+赵家 454 nrfg
+赵家义 3 nr
+赵家和 20 nr
+赵家堡 7 nr
+赵家姐妹 3 nr
+赵家富 16 nr
+赵家庄 8 nr
+赵家庙 2 nr
+赵家府 2 nr
+赵家条 256 nr
+赵家林 4 nr
+赵家楼 9 nr
+赵家沟 7 nr
+赵家治 3 nr
+赵家湾 256 nr
+赵家璧 6 nrfg
+赵寄客 592 nr
+赵寄容 8 nr
+赵寅成 3 nrfg
+赵富林 2 nr
+赵寡妇 2 nr
+赵将庞 2 nr
+赵将廉 4 nr
+赵小兰 3 nr
+赵小双 114 nr
+赵小姐 6 nr
+赵小婷 3 nr
+赵小川 3 nr
+赵小锐 3 nr
+赵少康 3 nr
+赵少昂 7 nr
+赵尔丰 3 nr
+赵尔巽 11 nr
+赵尚书 2 nr
+赵尚志 2 nr
+赵屹欧 3 nr
+赵岐注 2 nr
+赵峡黄 11 nr
+赵崇祚 5 nr
+赵川镇 2 nr
+赵州桥 35 nr
+赵州茶 3 nr
+赵布泰 2 nr
+赵师傅 3 nr
+赵师兄 33 nr
+赵师叔 3 nr
+赵师弟 2 nr
+赵师秀 2 nr
+赵希平 2 nr
+赵庆华 43 nr
+赵应元 7 nr
+赵应红 2 nr
+赵延刚 12 nr
+赵延寿 5 nr
+赵建中 2 nr
+赵建军 2 nr
+赵建华 3 nr
+赵建平 2 nr
+赵建春 3 nr
+赵开发 10 nr
+赵开心 6 nr
+赵弘殷 2 nr
+赵归真 3 nr
+赵德胜 4 nr
+赵志奇 3 nr
+赵志敬 977 nr
+赵志文 13 nr
+赵志皋 43 nr
+赵志鸿 5 nr
+赵忠尧 3 nr
+赵忠惠 6 nr
+赵忠生 2 nr
+赵忠祥 28 nr
+赵忠贤 3 nr
+赵忻城 2 nr
+赵怀业 2 nr
+赵总兵 11 nr
+赵恒命 2 nr
+赵恒多 3 nr
+赵恒惕 15 nr
+赵恒时 3 nr
+赵恒煊 3 nr
+赵惟一 2 nr
+赵惠文 12 nr
+赵慧玲 6 nr
+赵成子 3 nr
+赵成文 5 nr
+赵承嘏 3 nr
+赵承绶 4 nr
+赵挥金 2 nr
+赵振宇 2 nr
+赵攻燕 2 nr
+赵敏之 10 nr
+赵敏伸 3 nr
+赵敏便 3 nr
+赵敏俏 4 nr
+赵敏入 2 nr
+赵敏冷 2 nr
+赵敏叹 12 nr
+赵敏命 3 nr
+赵敏喜 2 nr
+赵敏奇 3 nr
+赵敏奔 3 nr
+赵敏微微 11 nr
+赵敏心 5 nr
+赵敏忽 5 nr
+赵敏怒 3 nr
+赵敏惊 5 nr
+赵敏扶 2 nr
+赵敏斟 2 nr
+赵敏朗 2 nr
+赵敏柔 2 nr
+赵敏格 5 nr
+赵敏正 2 nr
+赵敏知 3 nr
+赵敏竟 3 nr
+赵敏笑 56 nr
+赵敏练 3 nr
+赵敏见 5 nr
+赵敏身 8 nr
+赵敏转 2 nr
+赵敏那 2 nr
+赵敏靠 2 nr
+赵救卫 3 nr
+赵敬侯 4 nr
+赵敬忠 4 nr
+赵文军 7 nr
+赵文华 75 nr
+赵文卓 3 nr
+赵文子 3 nr
+赵文宣 3 nr
+赵文暄 3 nr
+赵文瑄 3 ns
+赵新先 3 nr
+赵新兵 2 nr
+赵新华 2 nr
+赵新忠 4 nr
+赵新良 3 nr
+赵无极 5 nr
+赵旭日 16 nr
+赵时春 2 nr
+赵昀诏 2 nr
+赵明恩 8 nr
+赵明敏 3 nr
+赵明明 3 nr
+赵明诚 13 nr
+赵明鑫 2 nr
+赵映骥 3 nr
+赵春惠 2 nr
+赵春雨 3 nr
+赵显宰 3 nr
+赵晓亮 12 nr
+赵晓侠 2 nr
+赵晓光 3 nr
+赵晓钟 2 nr
+赵普罢 2 nr
+赵普胜 19 nr
+赵普遂 2 nr
+赵景深 3 nr
+赵有亮 3 nr
+赵望云 6 nr
+赵本山 80 nr
+赵本昌 10 nr
+赵朴初 14 nr
+赵朴斋 2 nr
+赵李桥 2 nr
+赵李桥镇 2 nr
+赵杰娘子 22 nr
+赵松乔 3 nr
+赵松寿 64 nr
+赵构 30 nr
+赵树凯 2 nr
+赵树理 17 nr
+赵桓依然 2 nr
+赵桓靖 3 nr
+赵欣婷 43 nr
+赵步长 2 nr
+赵武灵 42 nr
+赵歧黄 24 nr
+赵毅敏 3 nr
+赵氏仙 2 nr
+赵氏昆 2 nr
+赵氏白 3 nr
+赵永东 29 nr
+赵永军 4 nr
+赵永复 7 nr
+赵永新 2 nr
+赵永生 6 nr
+赵永飞 2 nr
+赵汉乘 2 nr
+赵汉善 3 nr
+赵汝愚 16 nr
+赵汝适 7 nr
+赵治勋 7 nr
+赵洪璋 2 nr
+赵浩生 2 nr
+赵海林 2 nr
+赵海涛 14 nr
+赵淑敏 2 nrfg
+赵温关 3 nr
+赵温讯 5 nr
+赵滦浅 5 nr
+赵灵儿 3 nr
+赵灵时 2 nr
+赵灼华 2 nr
+赵炅亲 2 nr
+赵炅制造 2 nr
+赵炅命 3 nr
+赵炅授 2 nr
+赵炅统 2 nr
+赵烈侯 7 nr
+赵煦微微 2 nr
+赵煦越 2 nr
+赵燕生 3 nr
+赵燕芳 2 nr
+赵献可 2 nr
+赵献子 3 nr
+赵玄坛 2 nr
+赵玄默 2 nr
+赵率教 51 nr
+赵玉屏 37 nr
+赵玉峰 3 nr
+赵玉臣 4 nr
+赵玉英 3 nr
+赵王伦 20 nr
+赵王城 4 nr
+赵王如 3 nr
+赵王如意 4 nr
+赵王张 3 nr
+赵王歇 2 nr
+赵王爷 14 nr
+赵王迁 11 nr
+赵王遂 14 nr
+赵王高 5 nr
+赵用贤 118 nr
+赵登禹 16 nr
+赵白鸽 4 nr
+赵的卓 2 nr
+赵的道人 2 nr
+赵的郡 2 nr
+赵皇帝 4 nr
+赵相如 7 nr
+赵盼儿 2 nr
+赵真人 10 nr
+赵石头 2 nr
+赵研极 3 nr
+赵祖康 3 nr
+赵祯朝 2 nr
+赵福余 3 nr
+赵福君 3 nr
+赵秀娟 7 nrfg
+赵秀娥 20 nr
+赵秉志 3 nr
+赵秉文 12 nr
+赵秉钧 147 nr
+赵科林 7 nr
+赵筱芳 2 nr
+赵简子 7 nr
+赵紫宸 3 nr
+赵紫阳 158 nr
+赵红梅 41 nr
+赵继红 2 nr
+赵绪成 2 nr
+赵美宝 3 nr
+赵美萍 8 nr
+赵老三 8 nr
+赵老师 3 nr
+赵老汉 5 nr
+赵老爵 15 nr
+赵老爷 5 nr
+赵老者 2 nr
+赵胜利 2 nr
+赵自强 3 nrfg
+赵至魏 3 nr
+赵舒翘 12 nr
+赵良嗣 134 nr
+赵良栋 63 nr
+赵良燕 2 nr
+赵艳珍 3 nr
+赵英俊 3 nr
+赵荣福 2 nr
+赵莲秀 2 nr
+赵莲茹 3 nr
+赵萍萍 13 nr
+赵襄子 24 nr
+赵谦听 2 nr
+赵谦本 3 nr
+赵谦派 2 nr
+赵谦见 2 nr
+赵贞吉 19 nr
+赵贞女 2 nr
+赵财主 3 nr
+赵贤成 29 nr
+赵败秦 7 nr
+赵败魏 2 nr
+赵超构 5 nr
+赵辛楣 82 nr
+赵远寿 3 nr
+赵连庆 3 nr
+赵连弟 2 nr
+赵述岛 6 nr
+赵道士 4 nr
+赵邦之 2 nr
+赵邦杰 29 nr
+赵郡李 2 nr
+赵郡王 2 nr
+赵金凤 25 nr
+赵金涛 3 nr
+赵金玲 2 nr
+赵金风 8 nr
+赵鑫鑫 40 nr
+赵钊怡 2 nr
+赵钟泉 256 nr
+赵钱孙 167 nr
+赵铁锤 4 nr
+赵铭彝 2 nr
+赵锡元 2 nr
+赵锡君 2 nr
+赵长义 2 nr
+赵长平 6 nr
+赵长征 41 nr
+赵长春 3 nr
+赵长海 2 nr
+赵阎王 2 nr
+赵阔明 2 nr
+赵隆才 2 nr
+赵雅芝 3 nr
+赵雅雯 3 nr
+赵雨润 3 nr
+赵雪曾 3 nr
+赵雪芳 4 nr
+赵顼元 2 nr
+赵顼朝 2 nr
+赵颂茹 3 nr
+赵飞燕 22 nr
+赵首辅 2 nr
+赵高任 3 nr
+赵高恐 3 nr
+赵鹏飞 5 nr
+赵鹤寿 18 nr
+赵鹤破 2 nr
+赵齐贤 83 nr
+赵龙图 15 nr
+赶 4518 v
+赶上 958 d
+赶上去 3 v
+赶上来 3 v
+赶下 3 d
+赶下去 3 v
+赶下台 13 v
+赶下来 3 d
+赶不上 3 d
+赶不上趟 3 v
+赶不出 3 v
+赶不出来 3 v
+赶不到 3 v
+赶不及 11 v
+赶不回来 3 i
+赶任务 3 i
+赶伏 3 v
+赶修 3 v
+赶做 3 v
+赶先进 3 i
+赶入 3 v
+赶写 3 v
+赶出 3 v
+赶出去 3 v
+赶出来 3 v
+赶到 1967 v
+赶制 163 v
+赶前错后 3 i
+赶办 3 v
+赶劲 3 v
+赶印 3 v
+赶去 3 v
+赶向 3 d
+赶嘴 3 v
+赶回 653 v
+赶回到 3 i
+赶回去 3 i
+赶回来 3 i
+赶在 3 d
+赶场 47 d
+赶场子 3 v
+赶奔 3 v
+赶尽杀绝 75 i
+赶工 12 v
+赶工期 3 v
+赶巧 34 d
+赶庙会 13 v
+赶开 3 v
+赶录 3 v
+赶往 205 d
+赶得 3 v
+赶得上 3 d
+赶得出 3 v
+赶得到 3 v
+赶得及 6 v
+赶忙 627 d
+赶快 3242 d
+赶戏 3 v
+赶成 3 v
+赶排 7 v
+赶摆 3 v
+赶早 56 d
+赶早儿 3 d
+赶时间 3 d
+赶时髦 27 v
+赶明儿 46 d
+赶有 3 v
+赶来 1228 d
+赶来赶去 3 i
+赶洗 3 v
+赶活 3 d
+赶浪头 3 i
+赶海 8 v
+赶演 3 v
+赶潮流 5 i
+赶点 3 d
+赶点儿 3 d
+赶热闹 3 v
+赶牛 3 v
+赶着 403 v
+赶程 3 d
+赶稿 3 v
+赶紧 2603 d
+赶练 3 v
+赶羊 3 v
+赶考 36 v
+赶脚 3 v
+赶课 3 v
+赶走 373 v
+赶赴 173 v
+赶赴现场 3 i
+赶赶 3 v
+赶起 3 v
+赶起来 3 v
+赶超 88 v
+赶趟 22 v
+赶趟儿 3 v
+赶跑 54 v
+赶路 371 v
+赶路的人 3 i
+赶车 109 v
+赶过 3 v
+赶过去 3 v
+赶过来 3 d
+赶进 3 v
+赶进去 3 v
+赶进来 3 v
+赶造 3 v
+赶锥 3 i
+赶集 103 v
+赶集会 4 i
+赶集网 3 i
+赶马 3 d
+赶驴 3 v
+赶鸟 3 v
+赶鸭子 3 i
+赶鸭子上架 11 i
+起 58684 v
+起不来 3 v
+起义 4138 v
+起义军 1190 n
+起义将领 3 n
+起义者 110 n
+起义领袖 3 n
+起事 153 v
+起云 6 n
+起亚 17 nz
+起价 29 v
+起伏 1120 v
+起伏不定 3 v
+起伏跌宕 17 l
+起会 3 v
+起信论 3 n
+起偃为竖 3 i
+起先 306 d
+起兴 3 v
+起兵 670 v
+起初 838 d
+起到 1406 v
+起动 106 v
+起动器 6 n
+起动机 2 n
+起动转矩 3 n
+起动钮 3 n
+起劲 140 v
+起劲儿 3 d
+起劲地 3 d
+起博器 3 n
+起卧 3 v
+起卸 3 v
+起发性 3 n
+起吊 53 v
+起名 33 v
+起名儿 3 n
+起名叫 3 i
+起名网 3 n
+起吸器 3 n
+起哄 193 v
+起喘 3 v
+起因 364 n
+起因于 3 v
+起坐 3 v
+起坐室 3 n
+起复 3 v
+起夜 15 v
+起头 29 v
+起始 257 v
+起始信号 3 n
+起始值 3 n
+起始页 3 n
+起子 28 n
+起子头 3 n
+起学潮 3 n
+起定量 3 n
+起家 143 n
+起封 3 v
+起居 238 v
+起居厅 2 n
+起居室 34 n
+起居无时 3 i
+起居注 3 nz
+起居生活 3 i
+起居饮食 3 n
+起岸 3 n
+起工 3 v
+起帆 2 nz
+起床 530 v
+起床号 2 n
+起开 3 v
+起征 3 v
+起征点 5 n
+起惑 3 v
+起意 3 v
+起房子 3 n
+起手 3 v
+起承转合 10 n
+起拆 3 v
+起拍 5 v
+起拍价 9 n
+起搏 24 v
+起搏器 9 nz
+起搏点 2 n
+起效 3 v
+起敬 10 v
+起数 11 n
+起早床 3 nz
+起早摸黑 6 i
+起早贪黑 35 i
+起旱 3 v
+起来 39788 v
+起根发由 3 n
+起止 24 v
+起止日期 3 n
+起止点 5 n
+起步 501 d
+起步价 3 n
+起步区 2 n
+起步晚 3 l
+起死人 3 n
+起死回生 101 i
+起毛 13 n
+起水泡 3 n
+起油锅 3 n
+起泡 29 v
+起泡沫 3 n
+起波纹 3 n
+起源 1504 n
+起源于 3 v
+起源地 21 v
+起火 396 v
+起火燃烧 3 l
+起点 1199 n
+起点升 3 v
+起点处 4 v
+起点站 9 v
+起点网 3 v
+起爆 63 v
+起爆点 3 n
+起球 16 n
+起球现象 3 n
+起用 218 v
+起电机 3 n
+起电盘 7 v
+起疑 186 v
+起疑心 3 n
+起疹 3 n
+起病 137 v
+起痱子 3 v
+起皮 4 n
+起皱 3 n
+起眼 92 v
+起码 607 n
+起码要求 3 n
+起碇 3 n
+起租 3 v
+起程 152 n
+起稿 8 v
+起立 86 v
+起端 3 n
+起笔 12 v
+起算 3 v
+起纠纷 3 z
+起绉 3 n
+起绒 8 n
+起网 3 v
+起脚 98 v
+起至 3 v
+起舞 32 v
+起航 33 v
+起航出海 3 n
+起色 137 n
+起花 3 n
+起草 733 v
+起草人 22 n
+起草文件 3 n
+起草组 2 n
+起草者 10 n
+起获 3 v
+起落 185 v
+起落架 138 n
+起落架轮 3 n
+起落点 3 n
+起衅 3 v
+起行 3 v
+起见 42 v
+起解 7 v
+起誓 46 v
+起计 3 v
+起讫 27 v
+起讫之间 3 v
+起诉 530 v
+起诉书 36 n
+起诉人 10 n
+起诉方 2 n
+起诉权 4 n
+起诉状 8 n
+起诉科 2 n
+起货 3 n
+起赃 3 v
+起起伏伏 16 v
+起起伏伏的 3 l
+起起落落 12 i
+起跑 44 v
+起跑器 3 n
+起跑点 2 n
+起跑线 73 n
+起跳 81 v
+起跳台 2 v
+起跳板 3 n
+起跳点 3 n
+起跳线 3 n
+起身 2195 v
+起运 26 v
+起运港 3 nz
+起运点 3 n
+起造摸黑 3 i
+起重 68 v
+起重器 3 n
+起重机 78 n
+起重机械 3 n
+起重船 8 n
+起重量 9 n
+起钓 3 v
+起钻 3 n
+起锅 3 v
+起锚 21 v
+起锚机 3 vn
+起降 324 v
+起音 3 n
+起风 40 v
+起风云 3 n
+起飞 1024 v
+起飞前 3 i
+起飞时 3 n
+起飞时间 3 n
+起首 9 v
+起驾 38 v
+起鬨 3 vn
+赻 3 zg
+赾 2 zg
+趁 1909 v
+趁人之危 6 i
+趁便 16 d
+趁兴 3 d
+趁势 129 d
+趁哄打劫 3 i
+趁心像意 3 i
+趁心如意 3 i
+趁愿 3 d
+趁手 3 d
+趁早 192 d
+趁早行动 3 l
+趁机 630 d
+趁机行事 3 i
+趁此 3 d
+趁此机会 3 l
+趁水和泥 3 i
+趁波逐浪 3 i
+趁火打劫 43 i
+趁火抢劫 3 i
+趁热 3 l
+趁热打铁 45 i
+趁现在 3 l
+趁着 531 p
+趁空 3 d
+趁虚而入 13 i
+趁风使船 3 i
+趄 8 v
+超 3870 v
+超一 3 b
+超一流 3 b
+超上 3 v
+超世拔俗 3 i
+超世绝伦 3 i
+超世绝俗 3 i
+超临界 11 nz
+超乎 130 v
+超乎寻常 3 i
+超乎想像 3 l
+超二倍体 3 nz
+超五类 3 n
+超产 10 v
+超产奖 3 n
+超产奖励 3 l
+超亲优势 3 n
+超亲遗传 3 i
+超人 166 n
+超人一等 3 l
+超人气 3 n
+超人装 3 n
+超人高校 3 nt
+超今冠古 3 i
+超今绝古 3 l
+超今越古 3 l
+超以象外 3 l
+超任 3 v
+超伦 3 nz
+超低 41 h
+超低价 3 n
+超低压 3 n
+超低容量 3 n
+超低温 26 n
+超低空 83 n
+超俗 3 n
+超俗绝世 3 i
+超倍体 3 n
+超倍性 3 b
+超值 25 v
+超值价 3 n
+超值版 3 n
+超假 3 v
+超免疫 3 v
+超党派 5 n
+超再生 3 i
+超净 3 v
+超凡 65 v
+超凡人圣 3 i
+超凡入圣 14 i
+超凡出世 3 i
+超凡脱俗 21 i
+超出 1128 v
+超出范围 3 n
+超出预算 3 l
+超前 319 v
+超前享受 3 l
+超前发展 3 nz
+超前性 8 n
+超前意识 3 l
+超前消费 3 n
+超前绝后 3 l
+超前补偿 3 i
+超升 4 v
+超单元型 3 n
+超历史 19 n
+超压 20 v
+超压保护 3 n
+超发函 3 n
+超合金 3 n
+超员 17 n
+超固态 3 n
+超国家 11 n
+超图 3 v
+超基因 3 n
+超声 257 v
+超声仪 3 n
+超声波 160 n
+超声波学 3 n
+超声速 66 n
+超声键合 3 n
+超外差 3 n
+超外差式 3 l
+超大 74 v
+超大型 44 b
+超大穗 3 nz
+超大规模 64 b
+超女 2 n
+超媒体 3 n
+超子 9 n
+超家族 3 nz
+超宽 3 v
+超宽带 2 nr
+超宽组合 3 l
+超导 381 v
+超导体 93 n
+超导电性 43 n
+超导磁体 3 n
+超导金属 3 n
+超射 3 v
+超小型 7 b
+超尘出俗 3 i
+超尘拔俗 3 i
+超层序 3 l
+超山 4 v
+超巨型 5 b
+超巨星 27 nz
+超市 534 v
+超市业 2 n
+超市发 3 v
+超市货架 3 n
+超常 78 b
+超常发挥 3 n
+超常性 3 b
+超常规 14 b
+超幂 3 n
+超平面 2 n
+超广角 3 nz
+超度 79 n
+超度众生 3 nz
+超强 79 v
+超强度 9 n
+超强版 3 b
+超微 23 v
+超微粉 3 n
+超微结构 3 n
+超微距 3 n
+超必杀 3 v
+超必杀技 3 nz
+超快感 3 n
+超想 3 v
+超感染 3 v
+超技 3 n
+超拔 5 v
+超控 3 v
+超操纵子 3 l
+超支 27 v
+超收 9 v
+超敏 3 v
+超敏反应 3 l
+超数排卵 3 v
+超文本 13 n
+超新星 90 nz
+超时 45 b
+超时空 8 n
+超时限 3 n
+超旷 3 a
+超星 3 n
+超显性 3 n
+超期 36 b
+超期服役 3 n
+超期羁押 3 nr
+超杀 3 v
+超极化 3 n
+超标 227 v
+超标准 34 n
+超模 4 b
+超次 3 b
+超氧化物 3 n
+超水平 20 n
+超沉淀 3 l
+超流水线 3 n
+超消费 3 n
+超滤 5 v
+超滤膜 3 nz
+超点 3 n
+超然 52 b
+超然不群 3 l
+超然物外 9 l
+超然独处 3 l
+超然独立 3 i
+超然绝俗 3 i
+超然自得 3 i
+超然自逸 3 i
+超然迈伦 3 l
+超然远举 3 i
+超然远引 3 n
+超爽 3 v
+超现代化 3 j
+超现实 19 n
+超现实主义 71 l
+超生 84 v
+超短 14 v
+超短波 30 n
+超短裙 59 n
+超短裤 3 j
+超离心机 3 n
+超稳定 2 b
+超穷基数 3 n
+超穷序数 3 i
+超等 3 b
+超类绝伦 3 l
+超精 5 v
+超级 790 b
+超级公路 3 n
+超级大国 161 nt
+超级女 3 n
+超级客机 3 n
+超级市场 48 n
+超级强国 3 n
+超级抗原 3 n
+超级服务器 8 l
+超级玛丽 3 n
+超级稻 3 n
+超级终端 3 l
+超级解霸 3 l
+超级计算机 3 n
+超级链接 3 l
+超纯 9 v
+超纯水 3 n
+超线程 3 b
+超细 5 a
+超细笔尖 3 n
+超细粉 3 n
+超绝 10 v
+超绝尘寰 3 i
+超编 16 v
+超羁押 3 nr
+超群 232 n
+超群出众 3 i
+超群拔类 3 i
+超群绝伦 2 l
+超群越辈 3 l
+超群轶类 3 vn
+超能 3 v
+超能力 3 n
+超脱 97 v
+超自然 58 b
+超英 6 nz
+超范围 10 n
+超蓝 3 b
+超薄 30 a
+超薄型 4 b
+超螺旋 3 n
+超计划 8 n
+超诱变剂 3 nz
+超诱导 3 nr
+超负 3 v
+超负荷 77 b
+超超玄箸 3 nr
+超超玄著 3 nr
+超越 1215 v
+超越五笔 3 n
+超越前人 3 n
+超越性 32 b
+超越数 3 n
+超越者 3 n
+超越自我 3 b
+超越阶段 3 n
+超越限度 3 n
+超跌 59 v
+超跌股 13 n
+超距作用 3 n
+超车 29 v
+超轴 3 n
+超轶绝尘 3 v
+超轻 3 v
+超轻型 3 n
+超轻薄 3 n
+超载 61 v
+超载车 3 b
+超过 12732 v
+超过滤 3 v
+超过预算 3 l
+超迈绝伦 3 l
+超远 8 b
+超速 51 v
+超速离心 3 n
+超速行驶 3 v
+超速鞭蛇 3 n
+超逸 12 v
+超逸绝尘 3 i
+超酷 3 a
+超采 4 v
+超重 60 v
+超重低音 3 n
+超重击 3 b
+超重型 7 b
+超重量级 3 b
+超量 32 n
+超链接 3 l
+超长 32 v
+超长版 3 b
+超长穗型 3 n
+超阶段 3 n
+超阶级 10 b
+超阶越次 3 b
+超限 45 v
+超限战 3 n
+超霸 3 v
+超霸杯 3 nz
+超霸赛 3 nz
+超音 3 n
+超音波 2 n
+超音速 271 n
+超音速队 7 n
+超音速飞 3 n
+超音鼠 3 n
+超预算 4 l
+超频 22 b
+超频版 3 n
+超额 275 b
+超额分配 3 l
+超额利润 220 n
+超额完成 3 l
+超额录取 3 l
+超验 12 v
+超高 56 v
+超高产 3 b
+超高亮 3 z
+超高压 71 b
+超高层 5 b
+超高温 3 nz
+超高热 3 z
+超高速 45 nz
+超高频 23 b
+超龄 31 b
+超龄儿童 3 n
+趆 11 zg
+越 15864 d
+越久越 3 nr
+越之君 2 nr
+越传越 20 nr
+越位 117 n
+越俎代庖 23 i
+越做越 3 v
+越儿 56 d
+越共 46 d
+越共中央 5 nt
+越兴 3 ns
+越养越 2 nr
+越军乘 2 nr
+越冬 250 nr
+越冬作物 11 l
+越冬场 3 ns
+越冬防治 3 l
+越凫楚乙 3 nr
+越分 3 d
+越分妄为 3 i
+越剑士 2 nr
+越剧 75 d
+越剧团 8 nt
+越加 128 d
+越区 3 ns
+越区就读 3 l
+越南 1532 ns
+越南人 46 nr
+越南人民军 7 nt
+越南共产党 13 nt
+越南共和 3 ns
+越南化 3 ns
+越南式 3 nz
+越南战争 69 nz
+越南政府 4 nt
+越南民主共和国 22 ns
+越南盾 2 nr
+越南社会主义共和国 5 nt
+越南籍 3 nr
+越南话 3 l
+越南语 9 nz
+越发 897 d
+越古超今 3 nr
+越国 588 ns
+越国公 3 nr
+越坏 3 v
+越城区 3 ns
+越城岭 23 ns
+越境 32 n
+越境者 3 n
+越墙 3 n
+越夏 2 ns
+越多 3 d
+越多越 3 d
+越多越好 3 l
+越女剑 12 nr
+越好 3 d
+越学越 14 nr
+越小越 3 nr
+越少 3 d
+越岭 11 ns
+越州 60 ns
+越往后 3 nr
+越忙 3 d
+越快 3 d
+越快越好 3 l
+越念越 3 nr
+越思越 3 nr
+越感 3 ns
+越慢 3 d
+越战 89 nz
+越战越勇 13 nr
+越抗美 19 nr
+越拉越 2 nr
+越描越黑 3 i
+越改越 2 nr
+越方 10 d
+越早 3 d
+越是 1539 d
+越权 27 nr
+越来 3 d
+越来越 7867 d
+越来越低 3 i
+越来越少 3 l
+越来越快 3 l
+越来越松 3 nr
+越来越近 3 nr
+越来越重 3 i
+越格 2 n
+越梳越 4 nr
+越棉寮 4 ns
+越橘 7 n
+越次 3 d
+越次超伦 3 nr
+越水旱 2 nr
+越江 8 ns
+越江隧道 3 n
+越洋 26 ns
+越洋电话 3 l
+越流越 2 ns
+越浅 3 nr
+越海军 2 nr
+越深 3 d
+越狙代庖 3 i
+越狱 63 v
+越狱犯 3 n
+越狱罪 3 i
+越王兴 2 nr
+越王勾 263 nr
+越瓜 3 ns
+越用越少 3 l
+越界 41 n
+越瘦秦肥 3 nr
+越盟 7 ns
+越短 3 v
+越礼 3 nr
+越秀 64 nr
+越秀区 16 nr
+越积越 5 nr
+越窑 25 ns
+越站不停 3 nr
+越章王 2 nr
+越笑越 4 nr
+越糟 3 n
+越累 3 v
+越繇王 2 nr
+越级 40 d
+越级报考 3 l
+越线 3 nz
+越耶律 2 nr
+越聚越 2 nr
+越葱岭 4 nr
+越行越 2 nr
+越裔南 2 nr
+越西 6 ns
+越西县 2 ns
+越要 3 d
+越觉 3 d
+越语 2 nz
+越调 9 v
+越谷 3 ns
+越走越远 3 i
+越跃越 3 nr
+越轨 75 nr
+越轨行为 3 l
+越轻 3 d
+越过 93 d
+越过波 2 nr
+越远 3 d
+越通社 2 nt
+越遂成 3 nr
+越野 217 ns
+越野性 5 nr
+越野赛 36 nr
+越野赛跑 3 ns
+越野跑 12 ns
+越野车 74 nt
+越长越 13 nr
+越阿尔 3 nr
+越陷越深 3 i
+越隔纤维 3 l
+越障 8 v
+越雷池 3 nr
+越雷池一步 9 l
+越飞 8 nr
+越飞君 2 nr
+越飞越 4 nr
+越鸟南栖 3 nr
+趋 1314 n
+趋之若骛 10 i
+趋之若鹜 47 i
+趋于 869 v
+趋于平稳 3 i
+趋于稳定 3 i
+趋使 3 n
+趋光性 29 n
+趋利 12 n
+趋利性 2 n
+趋利避害 53 i
+趋前 3 v
+趋前退后 3 i
+趋势 3047 n
+趋势性 2 n
+趋化因子 3 n
+趋化性 3 n
+趋吉逃凶 3 n
+趋吉避凶 3 n
+趋同 63 n
+趋同化 2 n
+趋同性 3 n
+趋向 991 n
+趋向于 3 n
+趋向性 8 n
+趋奉 3 v
+趋拜 3 v
+趋时 3 n
+趋时奉势 3 i
+趋时附势 3 n
+趋暗 3 n
+趋权附势 3 n
+趋炎附势 39 i
+趋炎附热 3 i
+趋缓 3 v
+趋而迎之 3 i
+趋肤效应 3 n
+趋肤深度 3 n
+趋舍异路 3 n
+趋近 17 v
+趋避 55 v
+趋长避短 3 i
+趋阿奉媚 3 i
+趋附 20 v
+趋附于 3 n
+趋附权贵 3 i
+趋集 3 n
+趎 17 zg
+趑趄 2 v
+趑趄不前 3 v
+趔 3 v
+趔趄 75 v
+趔趔趄趄 7 v
+趙 4 zg
+趟 642 zg
+趟水 3 n
+趟浑水 5 l
+趟马 4 n
+趣 315 n
+趣事 56 n
+趣剧 3 n
+趣味 312 n
+趣味十足 3 n
+趣味性 58 n
+趣味无穷 3 n
+趣味盎然 3 z
+趣味竞赛 3 n
+趣园 3 n
+趣怪 3 n
+趣旨 3 n
+趣论 3 n
+趣话 5 n
+趣谈 5 n
+趣闻 49 n
+趣闻轶事 3 vn
+趮 32 zg
+趱 74 g
+足 9485 a
+足三里 11 i
+足下 363 v
+足下生辉 3 i
+足不出户 54 i
+足不出门 3 i
+足不履影 3 i
+足不窥户 3 i
+足不逾户 3 i
+足临泣 3 i
+足五里 3 i
+足以 498 v
+足以自豪 3 n
+足以认定 3 i
+足健 3 n
+足兵足食 3 i
+足协 398 j
+足协杯 12 nz
+足协杯赛 2 nz
+足印 102 v
+足厥阴肝经 15 i
+足取 3 v
+足坛 149 n
+足够 2565 v
+足委会 3 j
+足字旁 3 n
+足少阴肾经 16 n
+足尖 74 n
+足尺加二 3 i
+足履实地 3 i
+足岁 19 n
+足已 38 d
+足底 118 d
+足弓 3 nz
+足彩 3 n
+足彩网 3 n
+足总杯 42 n
+足恭 3 v
+足指 3 j
+足掌 11 v
+足数 3 n
+足敷所需 3 i
+足智多谋 121 i
+足智彩 3 i
+足月 17 n
+足月儿 2 n
+足本 3 n
+足校 3 n
+足浴 3 v
+足球 2042 n
+足球之乡 3 n
+足球博彩 3 n
+足球圈 6 n
+足球场 78 n
+足球城 4 n
+足球大赛 3 nz
+足球学校 3 n
+足球宝贝 3 n
+足球彩票 3 n
+足球报 3 n
+足球明星 3 n
+足球比赛 3 n
+足球流氓 3 n
+足球界 6 n
+足球网 4 n
+足球联赛 3 n
+足球资讯 3 n
+足球赛 127 n
+足球赛事 3 n
+足球运动 3 nz
+足球迷 5 n
+足球队 154 n
+足球鞋 3 n
+足用 3 v
+足癣 3 n
+足矣 3 i
+足秤 3 n
+足窍阴 3 i
+足立 2 v
+足联 119 j
+足色 3 n
+足茧 3 n
+足衣足食 3 i
+足见 252 v
+足赛 3 n
+足赤 3 n
+足足 369 v
+足足地 3 i
+足足有 3 v
+足足有余 2 i
+足趾 35 n
+足踏实地 3 i
+足踝 60 n
+足蹈手舞 3 i
+足轻 3 d
+足迹 386 n
+足通谷 3 n
+足部 3 f
+足部按摩 3 n
+足量 3 n
+足金 13 n
+足针 3 n
+足银 3 j
+足音 4 n
+足音空谷 3 n
+足音跫然 3 z
+足额 88 n
+足食 3 n
+足食丰衣 3 i
+足食足兵 5 i
+足高气强 3 i
+足高气扬 3 i
+趴 290 zg
+趴下 74 v
+趴下去 3 v
+趴下来 3 v
+趴伏 5 v
+趴倒 3 v
+趴卧 3 v
+趴在 484 v
+趴得 3 v
+趴着 3 v
+趴着不动 3 v
+趴着睡 3 v
+趴窝 6 v
+趴铺 3 v
+趵 16 zg
+趵突 3 n
+趵突泉 31 n
+趷 2 zg
+趸 185 vg
+趸售 3 n
+趸批 2 d
+趸批买入 3 n
+趸批卖出 3 n
+趸船 18 n
+趺 45 g
+趺坐 5 v
+趼 19 g
+趾 598 n
+趾头 7 n
+趾甲 14 n
+趾触 3 n
+趾踢 3 i
+趾踵相接 3 i
+趾踵相错 3 i
+趾部 3 n
+趾骨 6 n
+趾高气扬 63 i
+趾高气昂 3 i
+趿 44 v
+趿拉 26 v
+趿着 3 v
+跂 3 zg
+跂想 3 vn
+跂望 3 vn
+跃 2750 v
+跃上 450 v
+跃入 214 v
+跃出 398 v
+跃动 35 v
+跃升 71 v
+跃变层 3 l
+跃层 9 v
+跃居 135 v
+跃居第一 3 l
+跃居首位 3 i
+跃然 30 v
+跃然纸上 16 i
+跃脚板 3 n
+跃至 3 v
+跃起 725 v
+跃跃一试 3 i
+跃跃欲试 129 i
+跃身 3 v
+跃身而起 4 i
+跃迁 176 v
+跃过 83 v
+跃进 128 v
+跃进桥 2 i
+跃进路 3 l
+跃马 91 v
+跃马中原 3 ns
+跃马弯弓 3 i
+跃马扬鞭 2 i
+跃龙 3 ns
+跃龙门 3 ns
+跄 21 x
+跅幪不羁 3 v
+跅弛不羁 3 v
+跅弢不羁 3 v
+跆 17 n
+跆拳 3 n
+跆拳道 52 n
+跆拳道队 4 n
+跋 312 ng
+跋前踕后 3 v
+跋前踬后 3 v
+跋履山川 3 i
+跋山涉川 3 i
+跋山涉水 31 i
+跋扈 137 a
+跋扈飞扬 3 ns
+跋文 2 v
+跋涉 193 v
+跋涉山川 3 i
+跋胡疐尾 3 v
+跋语 8 v
+跌 2158 v
+跌下去 3 v
+跌下来 3 l
+跌交 4 v
+跌价 62 n
+跌份 2 n
+跌伤 19 v
+跌倒 377 v
+跌停 3 v
+跌停板 4 n
+跌入 145 v
+跌到 3 v
+跌势 25 n
+跌多涨少 3 l
+跌宕 172 v
+跌宕不羁 3 l
+跌宕昭彰 3 l
+跌宕起伏 53 l
+跌宕遒丽 3 z
+跌宕风流 3 l
+跌幅 124 n
+跌幅已深 3 l
+跌弹斑鸠 3 n
+跌打 68 v
+跌打损伤 3 l
+跌打滚爬 3 l
+跌来跌去 3 l
+跌死 3 v
+跌水 3 n
+跌涨 3 v
+跌百元 3 n
+跌破 71 v
+跌破眼镜 3 n
+跌碎 3 v
+跌穿 3 v
+跌脚捶胸 3 v
+跌脚搥胸 3 n
+跌脚槌胸 3 v
+跌脚绊手 3 vn
+跌自 3 v
+跌荡 3 v
+跌荡不拘 3 v
+跌荡不羁 3 l
+跌荡放言 3 n
+跌荡风流 3 n
+跌落 305 v
+跌足 3 v
+跌跌 3 v
+跌跌撞撞 144 z
+跌跟头 3 n
+跌跤 3 v
+跌进 52 v
+跌进去 3 l
+跌进来 3 l
+跎 60 x
+跏 39 x
+跏趺 2 v
+跑 11414 v
+跑上来 3 l
+跑上跑下 3 l
+跑下去 3 l
+跑下来 3 l
+跑不了 3 l
+跑不动 3 l
+跑不掉 3 v
+跑买卖 5 l
+跑位 3 n
+跑供销 3 l
+跑光 21 n
+跑冒滴漏 2 n
+跑出去 3 l
+跑刀 3 n
+跑前跑后 18 l
+跑动 92 v
+跑单帮 8 n
+跑反 3 v
+跑哮 3 v
+跑啦 3 nz
+跑圆场 3 n
+跑坏道 3 l
+跑垒 24 n
+跑垒员 3 n
+跑堂 44 n
+跑堂儿 2 l
+跑堂儿的 2 l
+跑墒 3 v
+跑官 12 n
+跑得快 3 l
+跑得慢 3 l
+跑掉 3 v
+跑操 2 n
+跑断腿 7 l
+跑旱船 5 n
+跑来跑去 3 l
+跑步 164 n
+跑步器 3 l
+跑步机 3 l
+跑步走 3 l
+跑江湖 18 ns
+跑片 3 n
+跑生意 3 l
+跑电 3 n
+跑的快 3 l
+跑码头 7 n
+跑程 3 n
+跑腿 44 n
+跑腿儿 4 l
+跑街 3 n
+跑表 3 n
+跑警报 46 n
+跑调 3 v
+跑跑 3 v
+跑跑步 3 l
+跑跑跳跳 4 l
+跑跑颠颠 3 v
+跑跳 3 v
+跑车 43 n
+跑过来 3 l
+跑速 3 n
+跑遍 66 v
+跑道 357 v
+跑门串门 3 l
+跑面 3 n
+跑鞋 6 n
+跑题 17 n
+跑马 70 n
+跑马卖解 10 l
+跑马地 2 n
+跑马场 5 n
+跑马山 3 ns
+跑马灯 3 n
+跑马观花 3 n
+跑龙套 26 nz
+跖 28 g
+跖犬吠尧 3 nrt
+跖犬噬尧 3 nrt
+跖狗吠尧 3 nrt
+跖骨 6 n
+跗 60 n
+跗萼联芳 3 n
+跗萼载韡 3 n
+跗萼连晖 3 n
+跗蹠 29 n
+跗阳 3 n
+跗面 3 n
+跗骨 4 n
+跗骨炎 3 n
+跚 22 x
+跛 196 n
+跛子 63 n
+跛脚 23 n
+跛行 16 n
+跛行千里 3 n
+跛行症 3 n
+跛足 28 v
+跛鳖千里 3 n
+距 4166 n
+距人千里 3 n
+距今 3 n
+距今已有 3 n
+距离 4556 n
+距离处 2 n
+距离感 22 n
+距离远 4 n
+距跃三百 3 n
+距阵 3 n
+跞 23 x
+跟 32393 p
+跟上 400 f
+跟上去 3 v
+跟上来 3 v
+跟不上 157 v
+跟住 3 v
+跟你急 3 n
+跟你走 3 n
+跟党走 3 n
+跟出 3 v
+跟到 3 v
+跟前 769 f
+跟前儿 4 n
+跟前跟后 3 n
+跟包 3 v
+跟单员 3 n
+跟去 3 v
+跟唱 3 v
+跟头 111 v
+跟定 3 v
+跟屁虫 4 n
+跟帖 3 v
+跟庄 3 n
+跟得 3 v
+跟得上 3 v
+跟我学 3 n
+跟我来 3 n
+跟我走 3 n
+跟斗 29 v
+跟来 3 v
+跟来跟去 3 v
+跟班 33 v
+跟着 1018 v
+跟紧 3 v
+跟腱 6 n
+跟读 12 v
+跟贴 3 v
+跟起 3 v
+跟踪 1222 v
+跟踪器 14 nz
+跟踪报道 3 n
+跟踪服务 6 n
+跟踪目标 5 n
+跟踪站 6 nz
+跟踪符 3 nz
+跟踪调查 3 n
+跟踪追击 3 n
+跟过 3 v
+跟进 220 v
+跟进去 3 v
+跟追 3 v
+跟部 3 f
+跟随 1269 v
+跟随者 5 n
+跟随运动 3 n
+跟风 65 v
+跟风盘 3 v
+跟风者 3 n
+跡 5 zg
+跣 60 g
+跣足 3 i
+跣足科头 3 i
+跤 173 ng
+跨 2858 v
+跨上 150 v
+跨上去 3 v
+跨上来 3 v
+跨下 3 v
+跨下之辱 3 v
+跨下去 3 v
+跨下来 3 v
+跨专业 3 b
+跨世纪 180 n
+跨业 3 n
+跨乡 3 n
+跨党 3 n
+跨入 161 v
+跨凤乘龙 3 n
+跨出 3 v
+跨出去 3 v
+跨出来 3 vn
+跨刀相助 3 l
+跨到 3 v
+跨区 13 n
+跨县 3 n
+跨向 3 v
+跨国 322 n
+跨国企业 3 n
+跨国公司 438 n
+跨国性 3 b
+跨地区 3 n
+跨坐 3 v
+跨境 38 n
+跨墙 3 n
+跨墙而过 3 l
+跨媒体 3 n
+跨学科 44 n
+跨山压海 3 n
+跨州连郡 3 n
+跨市 3 v
+跨平台 24 n
+跨年度 3 n
+跨度 599 n
+跨度长 3 n
+跨径 30 n
+跨得 3 v
+跨成 3 v
+跨接 3 b
+跨文化 3 n
+跨斗 3 vn
+跨期 3 b
+跨来 3 v
+跨来跨去 3 z
+跨栏 32 n
+跨步 70 vn
+跨步前进 3 l
+跨步向前 3 l
+跨步电压 2 n
+跨河 3 n
+跨河大桥 3 n
+跨洋 3 b
+跨洲 3 n
+跨海 33 n
+跨海大桥 3 n
+跨湖 3 n
+跨湖大桥 3 n
+跨环聚合 3 n
+跨省 3 n
+跨脚 3 n
+跨脚而过 3 l
+跨行 3 v
+跨行业 3 n
+跨起 3 v
+跨起来 3 v
+跨越 573 v
+跨越国界 3 b
+跨越式 90 b
+跨越性 5 b
+跨跃 3 v
+跨距 23 n
+跨跨 3 v
+跨跳 3 v
+跨过 272 v
+跨进 160 v
+跨进去 3 v
+跨进来 3 v
+跨部门 3 n
+跨门 3 n
+跨门而过 3 l
+跨音速 3 n
+跨马 3 n
+跨马而过 3 l
+跨骑 3 n
+跨鹤西游 3 n
+跩 2 zg
+跪 3466 v
+跪下 1636 v
+跪丐 3 n
+跪伏 43 v
+跪倒 568 v
+跪到 3 v
+跪叩 12 v
+跪地求饶 3 v
+跪坐 14 v
+跪垫 3 v
+跪姿 3 n
+跪射 6 v
+跪得 3 v
+跪拜 210 v
+跪拜礼 13 n
+跪求 3 v
+跪谢 3 v
+跪领 3 v
+跫 108 x
+跫响空谷 3 v
+跫然足音 3 v
+跬 16 g
+跬步 4 n
+跬步千里 3 n
+路 27626 n
+路丁 2 nrt
+路上 2706 s
+路上行人 3 n
+路上车 5 n
+路下 13 s
+路下峰 2 nr
+路不拾遗 8 i
+路世德 7 nr
+路东 7 ns
+路东之 3 nr
+路为旭 2 nr
+路之远 2 nr
+路之遥 2 nr
+路乌古 2 nr
+路于涛 2 nr
+路云天 2 nr
+路人 117 n
+路人甲 3 nr
+路人皆知 28 i
+路会越 2 nr
+路伟强 2 nr
+路传中 4 nr
+路儿 4 n
+路兵 2 n
+路军 85 n
+路军夫 2 nr
+路军州 2 nr
+路况 70 n
+路剑招 4 nr
+路剑法 41 nr
+路副将 2 n
+路加福音 3 nr
+路劫 3 v
+路北 10 s
+路北区 3 ns
+路北口 3 s
+路南 65 s
+路南区 5 ns
+路南彝族自治县 3 ns
+路卜 2 n
+路卡 3 nrt
+路叟之忧 3 i
+路口 416 s
+路口处 3 n
+路可选 2 nr
+路可通 3 nr
+路名 5 n
+路向 82 n
+路嘉欣 3 nr
+路国贤 5 nr
+路在何方 3 n
+路地 3 s
+路基 113 nrt
+路基导弹 3 n
+路堤 4 n
+路堤式 3 nr
+路大军 19 nr
+路头 3 s
+路妙传 4 nr
+路子 475 n
+路子走 3 nr
+路宁化 2 nr
+路宣慰 3 nr
+路宣抚 8 nr
+路宪文 20 nr
+路富德 2 nr
+路寿山 2 nr
+路小军 3 nr
+路局 13 n
+路平 3 n
+路府 2 n
+路府州 15 ns
+路府治 2 nr
+路引兵 2 nr
+路归路 4 n
+路径 486 n
+路径分析 3 l
+路径名 8 n
+路德 102 nrt
+路德会 3 nr
+路德宗 29 nr
+路德教 5 nz
+路德教派 3 nr
+路德维希 35 nrt
+路德维希港 6 ns
+路徽 3 ns
+路怀有 2 nr
+路总管 3 n
+路惠男 5 nr
+路振飞 3 nr
+路摊 3 n
+路政 16 n
+路政科 3 nr
+路数 66 n
+路断人稀 3 i
+路斯 4 nrt
+路旁 355 s
+路无拾遗 3 i
+路明军 4 nr
+路易 156 n
+路易丝 3 n
+路易十三 13 nz
+路易十五 16 n
+路易十六 39 nrt
+路易十四 62 nrt
+路易吉 10 nrt
+路易士 2 n
+路易复 2 nr
+路易撒 2 nrt
+路易斯 106 nrt
+路易斯安 3 nrt
+路易斯安那 26 nrt
+路易斯安那州 29 ns
+路易斯维尔 4 nrt
+路易斯酸 3 nz
+路易港 13 ns
+路易莎 2 nrt
+路昭回 2 nr
+路景 2 n
+路有冻死骨 4 i
+路望北 2 nr
+路权 5 n
+路柳墙花 3 i
+路标 53 n
+路校 2 n
+路桥 698 ns
+路桥区 7 ns
+路桥费 3 nz
+路检 3 v
+路棒法 7 n
+路歧 2 n
+路段 185 n
+路沙城 2 ns
+路沿 17 s
+路淮宁 2 nr
+路演 43 n
+路演利 2 nz
+路漫漫其修远兮 5 nr
+路灯 446 n
+路牌 16 n
+路环 2 n
+路环岛 9 ns
+路珊 3 ns
+路甬祥 268 nr
+路由 67 n
+路由器 97 n
+路由表 3 n
+路电路 2 nz
+路痴 3 n
+路盲 3 n
+路直传 2 nr
+路直隶 2 nr
+路相州 3 nr
+路矿 46 n
+路神 8 n
+路祭 3 nr
+路程 297 n
+路程遥远 3 l
+路端电压 3 n
+路竹 3 nr
+路签 3 n
+路精兵 2 nr
+路线 4463 n
+路线图 81 n
+路线教育 3 l
+路线斗争 3 nz
+路线方针 3 n
+路经 88 n
+路经略 3 n
+路绝人稀 3 i
+路统军 2 nr
+路网 39 n
+路考 3 v
+路肩 3 n
+路至凤 2 nr
+路至岭 2 nr
+路芷佩 43 nr
+路茶坊 3 nr
+路西 38 ns
+路见不平 36 i
+路规 3 n
+路警 3 n
+路诸州 3 ns
+路费 68 n
+路路克 2 nr
+路路通 2 nr
+路轨 10 n
+路边 697 s
+路边公园 3 n
+路边摊 3 n
+路边花坛 3 ns
+路过 535 v
+路远 6 nrt
+路远物 2 n
+路远迢迢 3 i
+路追征 2 nr
+路透 181 nz
+路透社 151 n
+路途 234 n
+路途遥远 3 i
+路通 23 nz
+路遇 49 n
+路道 3 n
+路道客 2 nr
+路遥 2 nr
+路遥知马力 8 i
+路长传 2 nr
+路长全 2 nr
+路长林 3 nr
+路长老 2 nr
+路队 6 n
+路障 45 n
+路雪 2 n
+路霸 3 nr
+路非 3 ns
+路面 494 n
+路面宽 3 nr
+路韶州 2 nr
+路风 5 n
+路麻贵 3 nr
+跳 8462 v
+跳上去 3 v
+跳上来 3 v
+跳上跳下 3 v
+跳下 3 v
+跳下去 3 v
+跳下来 3 v
+跳丸日月 3 i
+跳井 31 n
+跳井自尽 3 i
+跳井自杀 3 i
+跳交谊舞 3 n
+跳价 3 v
+跳伞 210 v
+跳伞台 3 n
+跳伞员 8 n
+跳伞塔 3 n
+跳伞运动 3 n
+跳入 91 v
+跳出 461 v
+跳出去 3 v
+跳出火坑 3 n
+跳到 3 v
+跳加官 3 n
+跳动 412 vn
+跳动地 3 n
+跳升 3 v
+跳发球 3 n
+跳变 2 v
+跳台 129 v
+跳周 3 n
+跳回去 3 i
+跳回来 3 i
+跳垒 3 n
+跳墙 3 n
+跳墙出去 3 i
+跳帧 3 n
+跳帮 5 v
+跳开 3 v
+跳往 3 v
+跳房子 3 n
+跳投 347 v
+跳机 3 n
+跳来 3 v
+跳来跳去 3 v
+跳板 223 n
+跳查文库 3 n
+跳栏 3 n
+跳桑巴舞 3 n
+跳梁 7 n
+跳梁小丑 9 n
+跳棋 18 v
+跳楼 68 v
+跳楼价 2 n
+跳楼自尽 3 i
+跳楼自杀 3 i
+跳槽 955 n
+跳槽率 3 n
+跳步 7 vn
+跳水 332 v
+跳水台 3 n
+跳水池 3 n
+跳水赛 6 n
+跳水队 5 n
+跳汰机 3 n
+跳河 23 n
+跳河自尽 3 i
+跳河自杀 3 i
+跳海 3 v
+跳海自尽 3 i
+跳海自杀 3 i
+跳爆竹 3 n
+跳班 3 v
+跳球 3 n
+跳皮筋 7 n
+跳皮筋儿 3 n
+跳神 67 n
+跳票 3 n
+跳离 3 v
+跳空 3 vn
+跳窗 3 n
+跳窗而逃 3 i
+跳箱 3 n
+跳级 5 b
+跳线 3 n
+跳绳 52 n
+跳羚 2 n
+跳脚 37 v
+跳脱 3 v
+跳舞 336 v
+跳舞会 3 n
+跳舞厅 3 n
+跳舞场 3 n
+跳舞机 3 n
+跳舞毯 3 n
+跳舞草 6 n
+跳船 3 vn
+跳船落海 3 i
+跳荡 24 v
+跳虫 4 n
+跳蚤 53 n
+跳蚤市场 21 n
+跳蝻 3 n
+跳行 2 v
+跳街舞 3 i
+跳表 3 v
+跳读 3 v
+跳起 3 v
+跳越 3 v
+跳跃 447 v
+跳跃传导 3 n
+跳跃式 23 b
+跳跃性 10 b
+跳跃者 3 n
+跳跃键 3 n
+跳跑 3 v
+跳跳 3 v
+跳跳床 3 v
+跳跳舞 15 v
+跳跳虎 3 n
+跳跳蹦蹦 12 z
+跳踉 3 z
+跳蹦 3 z
+跳车 3 n
+跳转 3 v
+跳过去 3 v
+跳过来 3 v
+跳进 206 v
+跳进去 3 v
+跳进来 3 v
+跳远 77 v
+跳远场地 3 n
+跳针 3 n
+跳闸 7 v
+跳鞋 3 n
+跳页 3 n
+跳马 49 v
+跳高 76 v
+跳高滑雪 3 n
+跳鼠 18 n
+跳龙门 3 n
+践 419 v
+践位 3 v
+践冰履炭 3 n
+践土食毛 3 v
+践墨随敌 3 nr
+践律蹈礼 3 vn
+践祚 4 v
+践约 17 v
+践行 30 v
+践规踏矩 3 z
+践诺 5 v
+践踏 239 v
+践踏在 3 z
+践踏着 3 y
+跶 59 zg
+跷 193 v
+跷了 3 n
+跷出 3 a
+跷去 3 n
+跷来跷去 3 n
+跷着 3 a
+跷课 3 n
+跷起 3 a
+跷起来 3 n
+跷足抗手 3 n
+跷足抗首 3 n
+跷足而待 3 n
+跷足而得 3 n
+跷跷 3 a
+跷跷板 4 n
+跷蹊 29 a
+跷过 3 a
+跸 70 g
+跹 44 x
+跺 990 v
+跺步 3 v
+跺脚 228 v
+跺跺脚 11 v
+跻 41 v
+跻升 3 v
+跻峰造极 3 nr
+跻身 487 v
+跻身于 3 v
+跼 4 zg
+跼促 3 v
+跼促一隅 3 i
+跼促不安 3 j
+跼地籥天 3 vn
+跼天促地 3 i
+跼天蹐地 3 v
+跼蹐不安 3 z
+跼躅 3 v
+跼高蹐厚 3 z
+跽 12 g
+踁 567 zg
+踄 5 zg
+踅 529 v
+踉 35 v
+踉跄 345 z
+踉踉 3 z
+踉踉跄跄 109 z
+踊 126 ad
+踊贵屦贱 3 v
+踊跃 252 ad
+踊跃发言 3 v
+踊跃报名 3 nz
+踊跃输将 3 nr
+踌 7 v
+踌蹰 3 v
+踌躇 518 v
+踌躇不决 9 i
+踌躇不前 8 i
+踌躇满志 91 i
+踌躇滿志 3 l
+踌躇澲 3 l
+踏 1817 v
+踏上 718 v
+踏上去 3 v
+踏上来 3 v
+踏下 3 v
+踏下去 3 v
+踏下来 3 v
+踏倒 3 v
+踏入 181 v
+踏入社会 3 l
+踏出 3 v
+踏出去 3 v
+踏出来 3 v
+踏到 3 v
+踏勘 42 v
+踏实 516 a
+踏寻 3 v
+踏平 21 a
+踏故习常 3 i
+踏春 3 v
+踏月 7 n
+踏来 3 v
+踏来踏去 3 i
+踏板 74 n
+踏板车 3 n
+踏查 4 v
+踏歌 8 v
+踏步 107 v
+踏步机 3 n
+踏步走 3 l
+踏水 9 v
+踏看 7 v
+踏破 15 v
+踏破铁鞋 24 n
+踏空 3 n
+踏级 3 a
+踏脚 3 v
+踏脚板 3 n
+踏脚石 21 n
+踏花被 3 n
+踏访 13 v
+踏足 27 a
+踏踏 3 v
+踏踏实实 95 z
+踏踏看 3 i
+踏过 3 v
+踏进 211 v
+踏遍 47 v
+踏道 3 v
+踏错 3 a
+踏雪 53 n
+踏雪寻梅 4 l
+踏雪鲟熊 3 z
+踏青 76 z
+踒 47 zg
+踔 97 g
+踔厉奋发 3 i
+踔厉风发 2 i
+踔厉骏发 3 vn
+踔绝之能 3 i
+踚 6 zg
+踜 32 zg
+踝 89 n
+踝关节 10 n
+踝子骨 3 n
+踝蛋白 3 n
+踝饰 3 n
+踝骨 9 n
+踞 171 vg
+踞傲自大 3 i
+踞炉炭上 3 z
+踞虎盘龙 3 i
+踟 3 v
+踟蹰 60 v
+踟蹰不前 3 v
+踟蹰不进 3 v
+踟躇 3 v
+踟躇不前 3 v
+踠 8 zg
+踡伏 3 vn
+踡跼 3 z
+踢 2993 v
+踢上去 3 v
+踢上来 3 l
+踢下去 3 l
+踢下来 3 l
+踢不出 3 v
+踢不到 3 l
+踢不起 3 v
+踢伤 3 v
+踢倒 3 v
+踢出 3 v
+踢出去 3 v
+踢出局 3 n
+踢出来 3 l
+踢回 3 v
+踢回去 3 l
+踢回来 3 l
+踢天弄井 3 l
+踢射 3 v
+踢射入门 3 l
+踢开 3 v
+踢打 21 v
+踢掉 3 v
+踢来踢去 3 n
+踢棉被 3 n
+踢死 3 v
+踢毽 5 v
+踢毽子 15 v
+踢法 4 v
+踢球 154 n
+踢球入网 3 n
+踢球者 3 n
+踢皮球 5 n
+踢翻 3 v
+踢脚 3 v
+踢脚板 3 n
+踢脚线 3 n
+踢脱 3 v
+踢腾 3 v
+踢腿 38 v
+踢芪 3 n
+踢走 3 v
+踢起 3 v
+踢起来 3 l
+踢足球 3 n
+踢踏 22 v
+踢踏舞 8 n
+踢踢 3 n
+踢踢球 3 n
+踢踢腿 2 n
+踢蹬 3 n
+踢躂舞 3 v
+踢过去 3 l
+踢过来 3 l
+踢进 3 v
+踢进去 3 l
+踢进来 3 l
+踢门 3 v
+踢飞 3 v
+踣 5 g
+踣地呼天 3 z
+踥 12 zg
+踦 47 zg
+踧踖不安 3 z
+踩 1241 zg
+踩下 3 v
+踩下去 3 v
+踩下来 3 v
+踩住 3 v
+踩光 3 v
+踩入 3 v
+踩到 3 v
+踩坏 3 v
+踩坏了 3 n
+踩得 3 v
+踩扁 3 n
+踩死 3 v
+踩水 6 v
+踩油门 3 n
+踩点 10 v
+踩踏 80 v
+踩闸 3 v
+踩高跷 14 v
+踪 388 n
+踪影 367 n
+踪迹 458 n
+踪迹诡秘 3 z
+踬 7 vg
+踬碍难行 3 nt
+踮 78 v
+踮着 3 v
+踮脚 2 v
+踮脚眺望 3 nr
+踮起 3 v
+踯躅 20 v
+踰 88 zg
+踰年 3 vn
+踰矩 3 z
+踰越 3 z
+踱 457 v
+踱去 3 v
+踱方步 2 v
+踱来 3 v
+踱步 115 v
+踲 12 zg
+踳 9 zg
+踵 56 g
+踵事增华 6 i
+踵决肘见 3 i
+踵接 3 i
+踵武 3 i
+踵武前贤 3 i
+踵武相接 3 i
+踵至 3 i
+踵足相接 3 i
+踵趾相接 3 nr
+踵迹相接 3 i
+踹 308 v
+踹出去 3 z
+踺子 5 n
+踽踽 14 z
+踽踽凉凉 3 z
+踽踽独行 6 i
+踽踽而行 3 i
+蹀 5 zg
+蹀躞 7 v
+蹀躞不下 3 v
+蹁 2 v
+蹁跹 9 v
+蹂 5 v
+蹂躏 424 v
+蹄 420 n
+蹄印 3 n
+蹄垫 3 n
+蹄声 203 n
+蹄子 296 n
+蹄形 3 n
+蹄形磁铁 3 n
+蹄灯 3 n
+蹄筋 7 n
+蹄膀 7 n
+蹄铁 3 n
+蹅 2 zg
+蹇 1580 nr
+蹇人上天 3 v
+蹇人升天 3 nz
+蹇视高步 3 v
+蹈 134 vg
+蹈人旧辙 3 v
+蹈仁履义 3 nr
+蹈入 3 v
+蹈其覆辙 3 v
+蹈刃不旋 3 v
+蹈厉之志 3 v
+蹈厉奋发 3 nz
+蹈常习故 3 v
+蹈常袭故 3 v
+蹈故习常 3 t
+蹈机握杼 3 nr
+蹈汤赴火 3 nr
+蹈海 6 v
+蹈火 3 v
+蹈火探汤 3 v
+蹈火赴汤 3 v
+蹈矩循彟 3 ns
+蹈矩循规 3 nr
+蹈矩践墨 3 nr
+蹈节死义 3 v
+蹈袭 21 v
+蹈袭前人 3 v
+蹈袭覆辙 3 n
+蹈规循矩 3 z
+蹈赴汤火 3 ns
+蹈锋饮血 3 vn
+蹉 8 v
+蹉跌 3 v
+蹉跎 23 v
+蹉跎光阴 3 i
+蹉跎岁月 3 i
+蹉跎日月 3 i
+蹉跎时光 3 i
+蹉跎时日 3 i
+蹉跎自误 3 i
+蹊 4 a
+蹊径 30 n
+蹊田夺牛 3 n
+蹊跷 256 a
+蹊跷作怪 3 n
+蹋 121 v
+蹏 2 zg
+蹐 6 zg
+蹐地局天 3 nt
+蹐地跼天 3 vn
+蹑 83 z
+蹑影潜踪 3 i
+蹑影藏形 3 i
+蹑影追风 3 i
+蹑悄悄 3 z
+蹑手 3 v
+蹑手蹑脚 97 z
+蹑手蹑足 3 z
+蹑着 3 v
+蹑着脚 3 z
+蹑脚 3 z
+蹑脚根 3 i
+蹑脚蹑手 3 vn
+蹑足 43 z
+蹑足其间 3 i
+蹑足潜踪 2 i
+蹑足而行 3 i
+蹑足附耳 3 i
+蹑踪 3 v
+蹒 5 v
+蹒跚 124 v
+蹒跚岁月 3 v
+蹒跚而行 3 v
+蹒跚行走 3 vn
+蹓 27 zg
+蹙 353 vg
+蹙眉 42 v
+蹙蹙靡骋 3 i
+蹙金结绣 3 v
+蹙额 3 v
+蹚 197 zg
+蹟 2 zg
+蹠 36 n
+蹠狗吠尧 3 i
+蹡 11 zg
+蹦 501 v
+蹦出 3 v
+蹦出来 3 v
+蹦床 5 v
+蹦极 15 v
+蹦极跳 3 v
+蹦起 3 v
+蹦跃 3 v
+蹦跳 51 v
+蹦蹦 3 v
+蹦蹦儿戏 3 n
+蹦蹦儿车 3 n
+蹦蹦跳 3 v
+蹦蹦跳跳 19 v
+蹦蹦车 2 v
+蹦达 5 v
+蹦迪 12 v
+蹦高 3 v
+蹧 3 zg
+蹧蹋 3 vn
+蹩 31 a
+蹩脚 48 a
+蹩脚货 3 vn
+蹫 2 zg
+蹬 492 v
+蹬技 6 n
+蹬立 3 v
+蹬脚 3 n
+蹬腿 16 n
+蹬踏 6 v
+蹬蹬 3 n
+蹬车 3 n
+蹭 417 v
+蹭蹬 16 a
+蹯 2 g
+蹱 2 zg
+蹲 1286 v
+蹲下 297 v
+蹲下去 3 v
+蹲下来 3 v
+蹲伏 23 v
+蹲位 3 v
+蹲到 3 v
+蹲厕所 3 n
+蹲坐 132 v
+蹲坐在 3 l
+蹲坑 6 v
+蹲大牢 3 v
+蹲守 14 v
+蹲射 3 v
+蹲板 3 n
+蹲点 28 v
+蹲牢 3 v
+蹲班 3 v
+蹲腰 3 v
+蹲苗 2 v
+蹲过 3 v
+蹲马步 2 l
+蹴 74 g
+蹴鞠 9 n
+蹶 45 g
+蹶子 3 v
+蹻 29 zg
+蹻勇 3 v
+蹻脚 3 z
+蹼 101 n
+蹼泳 14 n
+蹼足 3 v
+蹼趾 2 n
+蹽 13 zg
+蹾 13 zg
+蹿 477 v
+蹿出 3 v
+蹿到 3 v
+蹿升 5 v
+蹿房越脊 3 nr
+蹿火 3 v
+蹿红 3 v
+蹿跳 3 v
+蹿蹦 3 v
+躁 211 v
+躁动 53 vn
+躁动不安 23 a
+躁急 3 a
+躁热 3 a
+躁狂 13 a
+躁狂症 11 n
+躁言丑句 3 v
+躁进 3 v
+躄 7 zg
+躅 2 x
+躇 9 x
+躍 2 zg
+躏 5 x
+躐 10 g
+躔 4 g
+躖 3 zg
+躘 8 zg
+躜 6 g
+躟 13 zg
+躡 11 zg
+躦 15 zg
+躧 30 zg
+身 15789 ng
+身上 11123 s
+身下 192 s
+身不由主 96 i
+身不由己 108 i
+身不由已 4 i
+身不遇时 3 l
+身世 348 n
+身中数弹 3 n
+身中数枪 3 l
+身临 3 v
+身临其境 53 i
+身为 769 v
+身事 3 n
+身亡 406 v
+身价 329 n
+身价倍增 3 i
+身价十倍 3 l
+身价百倍 138 i
+身价超 3 i
+身份 2691 n
+身份证 708 n
+身份证件 3 n
+身份证号 3 n
+身份证明 3 n
+身份证法 3 n
+身份验证 3 n
+身体 7962 n
+身体健壮 3 i
+身体健康 3 l
+身体力行 111 n
+身体发肤 8 n
+身体检查 3 n
+身体状况 3 n
+身体疲劳 3 i
+身体瘦弱 3 i
+身体素质 3 n
+身体虚弱 3 l
+身体衰弱 3 l
+身体语言 3 n
+身做身当 3 i
+身先士众 3 n
+身先士卒 80 i
+身先朝露 3 i
+身兼 56 v
+身兼多职 2 i
+身兼数职 3 l
+身分 1253 n
+身分不明 3 i
+身分证 23 n
+身单力薄 5 l
+身历 7 n
+身历其境 6 i
+身历声 3 n
+身受 583 v
+身受其害 3 i
+身名两泰 3 i
+身名俱泰 3 i
+身名俱灭 3 i
+身名俱败 3 i
+身后 2293 f
+身后之事 3 i
+身后事 3 n
+身后萧条 3 i
+身土不二 3 i
+身在其中 3 i
+身在曹营心在汉 14 i
+身在江湖 5 i
+身处 387 s
+身处牢笼 3 v
+身外 75 s
+身外之物 67 l
+身外物 3 n
+身姿 61 n
+身娇肉贵 3 i
+身子 6107 n
+身子骨 69 n
+身子骨儿 17 n
+身孕 74 v
+身家 63 n
+身家性命 92 n
+身家清白 3 l
+身寄虎吻 3 n
+身密 3 n
+身居 158 n
+身居要职 3 n
+身居高位 3 n
+身废名裂 3 i
+身强体壮 13 i
+身强力壮 41 i
+身当其境 3 i
+身当矢石 3 i
+身形 637 n
+身影 837 n
+身微力薄 3 i
+身微言轻 3 i
+身心 618 n
+身心交病 3 n
+身心交瘁 5 i
+身心俱疲 3 i
+身心健康 116 l
+身心愉快 3 z
+身心状态 3 n
+身怀 38 n
+身怀六甲 7 i
+身怀绝技 34 i
+身患 73 n
+身患绝症 3 i
+身手 453 n
+身手不凡 23 i
+身披 400 v
+身担 3 n
+身担重任 3 l
+身操井臼 3 i
+身故 39 n
+身教 17 n
+身旁 1615 s
+身无分文 20 i
+身无完肤 3 i
+身无寸缕 3 i
+身无寸铁 3 i
+身无择行 3 i
+身无立锥 3 i
+身无长处 3 i
+身无长物 6 i
+身显名扬 3 i
+身有同感 3 n
+身材 1275 n
+身材修长 3 n
+身材矮小 3 n
+身材苗条 3 n
+身材高大 3 n
+身条 3 n
+身板 43 n
+身板儿 2 n
+身柱 3 n
+身根 3 n
+身残志不残 3 i
+身残志坚 6 i
+身段 81 n
+身段优美 3 n
+身段匀称 3 vn
+身法 429 n
+身相 3 n
+身着 672 v
+身穿 1263 v
+身经 3 n
+身经百战 107 n
+身肩重任 3 l
+身背 31 n
+身负 185 n
+身负重任 3 l
+身负重伤 3 i
+身败名裂 92 i
+身躯 518 n
+身轻如燕 3 n
+身轻言微 3 i
+身边 5641 s
+身远心近 3 n
+身退功成 3 i
+身遥心迩 3 i
+身量 31 n
+身长 203 n
+身陷 86 n
+身陷囹圄 19 i
+身非木石 3 i
+身首异地 3 i
+身首异处 42 i
+身驱 3 n
+身高 573 v
+身高体重 3 i
+身高计 3 i
+身高马大 8 i
+躬 398 v
+躬亲 12 v
+躬体力行 3 l
+躬先士卒 3 i
+躬先表率 3 l
+躬冒矢石 3 i
+躬奉 3 v
+躬擐甲胄 3 nr
+躬耕 14 v
+躬耕乐道 3 l
+躬自菲薄 3 i
+躬行 3 v
+躬行实践 3 l
+躬行节俭 3 i
+躬蹈矢石 3 i
+躬身 1013 v
+躬身下拜 14 l
+躬身行礼 154 i
+躬迎 3 v
+躬送 3 v
+躬逢 10 v
+躬逢其盛 10 i
+躭惊受怕 3 l
+躯 222 n
+躯体 750 n
+躯体虐待 3 n
+躯壳 59 n
+躯干 204 n
+躯干部 47 n
+躯骸 3 n
+躱 2 zg
+躲 3628 v
+躲上去 3 v
+躲上来 3 v
+躲下 3 v
+躲下去 3 v
+躲下来 3 l
+躲不了 3 l
+躲不开 3 v
+躲债 9 v
+躲开 294 v
+躲得 3 v
+躲懒 14 v
+躲来 3 v
+躲来躲去 3 l
+躲猫猫 3 l
+躲藏 163 v
+躲藏在 3 v
+躲藏处 3 l
+躲藏着 3 l
+躲藏者 3 l
+躲让 8 v
+躲起 3 v
+躲起来 3 l
+躲躲 3 v
+躲躲藏藏 12 l
+躲躲闪闪 54 l
+躲过 211 v
+躲过一劫 3 l
+躲过去 3 l
+躲过来 3 l
+躲逃 3 v
+躲避 708 v
+躲避不了 3 l
+躲避球 3 l
+躲闪 235 v
+躲闪不及 3 l
+躲雨 21 v
+躷 11 zg
+躺 3481 v
+躺上去 3 v
+躺上来 3 v
+躺下去 3 v
+躺下来 3 v
+躺倒 75 v
+躺倒不干 3 v
+躺出去 3 v
+躺出来 3 v
+躺卧 18 v
+躺平 3 n
+躺来躺去 3 n
+躺柜 3 n
+躺椅 67 n
+躺直 3 v
+躺躺 3 v
+躺过去 3 v
+躺过来 3 v
+躺进 3 v
+躺进去 3 v
+躺进来 3 v
+躻 5 zg
+軂 3 zg
+軃 17 zg
+軆 41 zg
+車 10 zg
+軋 2 zg
+軍 4 zg
+軎 4 zg
+軏 14 zg
+軓 100 zg
+軠 3 zg
+軴 28 zg
+軶 10 zg
+軹 5 zg
+輂 6 zg
+輈 5 zg
+輣 34 zg
+輨 23 zg
+輯 290 zg
+輳 3 zg
+轂 2 zg
+轉 3 zg
+轑 2 zg
+轘 11 zg
+轛 445 zg
+轠 14 zg
+轣辘 3 v
+车 9985 zg
+车一族 3 nz
+车上 811 s
+车中定 2 nr
+车中望 2 nr
+车中跃 4 nr
+车主 61 n
+车乘岭 3 nr
+车仁表 3 nr
+车代舟 2 nz
+车价 6 n
+车伊洛 4 nr
+车位 17 n
+车位费 3 n
+车位锁 3 n
+车体 496 n
+车体广告 3 n
+车保帅 2 nr
+车儿 12 n
+车全宽 2 j
+车八岭 3 nr
+车公庄 3 nr
+车兵 23 n
+车兵混 2 nr
+车内 3 s
+车况 18 n
+车击舟连 3 nr
+车刀 7 n
+车列 3 n
+车到山前必有路 11 l
+车削 11 v
+车前子 21 nr
+车前灯 3 n
+车前草 10 nr
+车前马后 3 nr
+车加言 2 n
+车务段 4 n
+车匪 6 n
+车匪路霸 4 l
+车厂 3 n
+车厢 512 n
+车厢广告 3 i
+车友 2 n
+车友们 3 n
+车友会 3 nr
+车号 18 n
+车号牌 3 n
+车同轨 2 n
+车向西 2 nr
+车商 3 n
+车圈 2 n
+车在马前 3 i
+车场 21 n
+车型 165 n
+车垫 3 n
+车城 261 n
+车城商场 3 n
+车城热线 3 n
+车城西 512 ns
+车填马隘 3 n
+车声 2 n
+车声辚 2 nr
+车外 3 s
+车大炮 3 nr
+车天下 3 n
+车太贤 3 nr
+车太铉 3 nr
+车夫 241 n
+车头 53 n
+车头灯 3 n
+车婉婉 3 nr
+车子 711 n
+车守 3 n
+车将君 2 nr
+车尔尼 3 nr
+车尔尼雪 3 nr
+车尔尼雪夫斯基 19 ns
+车尔库 194 nr
+车尔臣 3 nr
+车尔臣河 7 nr
+车尘马足 3 i
+车尘马迹 3 i
+车尾 34 n
+车尾灯 3 n
+车展 10 j
+车工 14 n
+车市 17 n
+车师 10 n
+车师六 2 nr
+车师前 5 nr
+车师常 2 nr
+车师王 3 nr
+车带 3 n
+车床 58 n
+车床族 3 n
+车库 32 n
+车库里 3 nr
+车底 107 n
+车府 2 n
+车座 21 n
+车座弹簧 3 n
+车开进 3 nr
+车式炉 2 nr
+车影 3 n
+车怠马烦 3 l
+车房 3 n
+车手 43 n
+车技 8 n
+车把 31 n
+车把势 3 n
+车把式 10 n
+车把把套 3 n
+车持谦 2 nr
+车损险 4 n
+车掌 3 n
+车改 3 j
+车斗 17 n
+车旅费 3 n
+车族 3 n
+车族化 3 n
+车旗 2 n
+车无退表 3 i
+车晓蕙 4 nr
+车木匠 5 nr
+车机 2 n
+车杠 3 n
+车条 3 n
+车架 27 n
+车架号 3 n
+车标 3 n
+车桥 13 n
+车检 3 j
+车棚 9 n
+车棚费 3 nr
+车模 3 n
+车次 42 n
+车次表 3 nz
+车款 3 n
+车殆马烦 3 v
+车毁人亡 5 i
+车水马龙 55 nr
+车江窑 2 nr
+车沿 2 s
+车流 65 n
+车流量 119 n
+车渠 3 n
+车满为患 2 i
+车灯 35 n
+车灯架 3 n
+车烦马毙 3 i
+车照 3 n
+车牌 797 n
+车牌号 10 n
+车牌号码 3 n
+车王贤 3 nr
+车班 3 n
+车用 14 n
+车用汽油 3 n
+车田正美 3 nz
+车皮 26 n
+车盖 3 n
+车盖亭 2 nr
+车盘 3 n
+车盘岭 2 n
+车磨 3 n
+车神 3 n
+车票 264 n
+车票价 2 n
+车祸 138 n
+车种 2 n
+车程 2119 n
+车程计 3 n
+车窗 167 n
+车站 946 n
+车站里 3 n
+车笠之盟 3 v
+车管 5 n
+车管所 8 j
+车箱 28 n
+车篷 3 n
+车篷子 3 n
+车系 3 n
+车组 13 n
+车继铃 3 nr
+车缝 3 n
+车老板 11 n
+车胄 3 n
+车胎 12 n
+车臣 129 n
+车臣共和国 5 ns
+车舟 4 n
+车船 48 n
+车船廪 2 n
+车船税 3 n
+车船费 3 n
+车节 2 n
+车营 2 n
+车行 70 n
+车行网 3 n
+车行道 115 n
+车裂 60 n
+车讯网 3 n
+车贷险 3 n
+车费 63 n
+车资 3 n
+车赶 2 v
+车路 6 n
+车身 367 n
+车车 3 n
+车轮 304 n
+车轮下 3 n
+车轮子 10 n
+车轮战 25 n
+车轮锁 3 n
+车轱辘 12 n
+车轱辘话 2 l
+车轴 69 n
+车载 137 n
+车载台 3 n
+车载式 19 n
+车载斗量 3 n
+车载船装 3 n
+车辆 1912 n
+车辆保养 3 n
+车辆厂 7 n
+车辆段 4 n
+车辆管理 6 n
+车辆通行 5 n
+车辆配件 3 n
+车辆驾驶 4 v
+车辐 3 n
+车辕 36 n
+车辖 3 n
+车辙 84 n
+车辙马迹 3 nr
+车辚马啸 3 nr
+车运 2 n
+车运输 3 j
+车迷 3 n
+车迷网 3 i
+车速 84 n
+车道 180 n
+车都尉 7 nr
+车里 173 s
+车里雅宾斯克 13 ns
+车钩 3 n
+车钱 12 n
+车铃 7 n
+车铣刨磨 3 vn
+车链 3 n
+车链子 3 nr
+车长 317 n
+车门 150 n
+车门口 6 n
+车门数 3 n
+车间 617 n
+车间主任 3 n
+车间成本 3 n
+车间经费 3 n
+车闸 3 n
+车队 212 n
+车险 2 n
+车顶 74 n
+车飞黄 3 nr
+车首 3 n
+车马 172 n
+车马喧阗 3 nr
+车马坑 28 n
+车马填门 3 n
+车马店 5 n
+车马炮 6 nr
+车马盈门 3 n
+车马费 6 n
+车马骈阗 3 ns
+车驰马骤 3 nr
+车驾 73 nr
+车骑 108 n
+轧 339 v
+轧上 3 v
+轧件 3 n
+轧伤 3 v
+轧光 6 n
+轧入 3 v
+轧制 33 v
+轧场 3 n
+轧头寸 3 n
+轧差 3 n
+轧帐 3 n
+轧带 3 n
+轧平 3 n
+轧戏 3 n
+轧断 5 v
+轧机 25 n
+轧来 3 v
+轧来轧去 3 n
+轧染 3 v
+轧棉 3 n
+轧棍 3 n
+轧死 10 v
+轧毙 3 v
+轧片 3 n
+轧着 3 v
+轧碎 3 v
+轧票 3 n
+轧空 3 n
+轧空头 3 n
+轧米 3 n
+轧膜 3 n
+轧花 31 n
+轧花厂 6 n
+轧花机 32 n
+轧花网 3 n
+轧花边 3 n
+轧账 3 v
+轧起 3 v
+轧起来 3 v
+轧路 3 n
+轧轧 3 v
+轧轧声 3 n
+轧辊 11 n
+轧道机 3 n
+轧道车 3 n
+轧钢 43 n
+轧钢厂 11 n
+轧钢机 3 n
+轧马路 3 nz
+轨 515 n
+轨度 3 n
+轨形 3 n
+轨枕 19 n
+轨物范世 3 n
+轨范 2 n
+轨距 31 n
+轨辙 2 n
+轨迹 471 n
+轨迹球 3 n
+轨道 2410 n
+轨道交通 9 n
+轨道控制 10 n
+轨道电子 3 n
+轨道电路 3 n
+轨道站 5 n
+轨道舱 9 n
+轨道衡 3 n
+轨道车 3 n
+轩 632 nr
+轩化道 4 nr
+轩宇大 2 nr
+轩将军 4 nr
+轩尼诗 5 nr
+轩敞 2 nr
+轩昂 49 nr
+轩昂气宇 3 nr
+轩昂自若 3 nr
+轩朗然 2 nr
+轩机 41 n
+轩机道 8 i
+轩权道 7 nr
+轩然大波 209 i
+轩然霞举 3 i
+轩盖如云 3 i
+轩眉笑 2 nr
+轩笑笑 2 nr
+轩词甲 3 nr
+轩诗文 3 nr
+轩轩甚得 3 i
+轩轾 6 nr
+轩轾不分 3 z
+轩辕 93 n
+轩辕二 3 nr
+轩辕剑 2 nr
+轩辕台 2 nr
+轩辕夏禹 3 nr
+轩辕帝 2 nr
+轩辕庙 2 nr
+轩辕教 3 nr
+轩辕氏 9 nr
+轩辕黄帝 3 nr
+轩鹤冠猴 3 nr
+轫 63 g
+轫致辐射 3 nz
+转 11622 v
+转上 3 v
+转上去 3 v
+转上来 3 v
+转下 3 v
+转下去 3 v
+转世 166 v
+转世灵童 12 l
+转业 161 v
+转业军人 13 n
+转业干部 3 n
+转业费 3 vn
+转个弯 3 l
+转为 760 v
+转主寄生 3 n
+转义 64 v
+转义字符 4 n
+转义序列 13 n
+转义键 3 n
+转乘 16 v
+转交 191 v
+转产 36 vn
+转亮 3 v
+转付 3 v
+转任 35 v
+转会 104 v
+转会制 5 n
+转会费 22 vn
+转位 8 v
+转体 49 n
+转作 3 v
+转供 3 v
+转侧 14 n
+转借 19 v
+转储 4 v
+转儿 3 n
+转入 1182 v
+转入地下 3 i
+转关 4 v
+转写 20 v
+转出 3 v
+转出去 3 v
+转分化 3 n
+转列 3 v
+转到 3 v
+转到第 3 l
+转制 84 v
+转办 6 v
+转动 1093 v
+转动惯量 3 n
+转动扩散 3 n
+转动瞬心 3 l
+转动瞬轴 3 i
+转动角 3 n
+转动轴 3 n
+转包 29 v
+转包合同 3 l
+转化 3673 v
+转化体 3 n
+转化成 3 l
+转化率 23 n
+转化酶 3 l
+转区 3 n
+转卖 59 v
+转印 13 v
+转印纸 3 n
+转危为安 96 i
+转去 3 v
+转发 520 v
+转发器 28 n
+转发给 3 v
+转受让方 3 n
+转变 3510 v
+转变态度 3 l
+转变思想 3 i
+转变成 3 l
+转变立场 3 n
+转变职能 3 l
+转变观念 3 l
+转变认识 3 l
+转口 136 vn
+转口港 3 n
+转口站 3 n
+转口货 3 n
+转口贸易 3 l
+转台 15 v
+转向 2176 v
+转向剂 3 n
+转向器 3 n
+转向架 8 n
+转向标 3 n
+转向灯 9 n
+转向离合 3 i
+转向节 3 n
+转呈 3 v
+转告 174 v
+转售 18 v
+转售他人 3 n
+转喻 3 v
+转嗔为喜 3 i
+转回 135 v
+转圈 38 n
+转圈儿 6 l
+转圈圈 9 n
+转圜之地 3 v
+转圜余地 3 nz
+转在 3 v
+转场 30 n
+转型 763 n
+转型期 76 n
+转基因 47 n
+转基因学 3 l
+转塔 6 n
+转增 301 v
+转天 3 t
+转头 1480 v
+转头就走 3 l
+转嫁 121 v
+转嫁到 3 l
+转嫁危机 3 l
+转嫁给 3 n
+转子 157 n
+转子泵 3 n
+转存 3 v
+转学 51 n
+转守为攻 3 i
+转完 3 v
+转寄 5 v
+转寰 3 n
+转导 6 v
+转导子 3 n
+转导物 3 n
+转导素 3 n
+转小 3 v
+转岗 60 v
+转工 3 v
+转差率 3 n
+转帐 3 v
+转干 4 v
+转年 9 t
+转库 3 n
+转度 3 n
+转座 3 v
+转座子 3 n
+转座酶 3 l
+转开去 3 v
+转引 24 v
+转弯 304 v
+转弯半径 3 i
+转弯处 38 v
+转弯子 2 n
+转弯抹角 33 i
+转弯磨角 3 i
+转归 35 v
+转录 62 v
+转形 3 v
+转形期 3 n
+转往 3 v
+转得 3 v
+转徙 3 v
+转忧为喜 2 i
+转念 595 v
+转念之间 3 i
+转悠 155 v
+转悲为喜 9 i
+转愁为喜 3 i
+转意 5 v
+转成 3 v
+转战 287 v
+转战千里 3 i
+转户 2 n
+转户口 3 n
+转手 143 v
+转手倒卖 3 i
+转托 3 v
+转托管 3 v
+转抄 3 v
+转投资 3 j
+转折 509 v
+转折关头 3 l
+转折处 6 v
+转折年 3 n
+转折性 10 n
+转折期 3 n
+转折点 291 n
+转报 17 v
+转拨 2 v
+转换 1648 v
+转换器 56 l
+转换头 3 l
+转换开关 9 l
+转换成 3 i
+转换方向 3 i
+转换方法 4 l
+转换期 4 n
+转换机制 3 l
+转换法 3 n
+转换率 3 n
+转换规则 3 l
+转换边界 3 i
+转换键 3 n
+转捩 9 v
+转捩期 3 n
+转捩点 3 n
+转授 20 v
+转接 174 v
+转接卡 3 n
+转接器 7 n
+转接头 4 n
+转接环 3 i
+转接线 3 n
+转播 143 vn
+转播台 11 n
+转播器 3 n
+转播塔 2 n
+转播权 18 n
+转播站 3 n
+转播表 3 n
+转播费 3 n
+转播车 5 n
+转攻为守 3 i
+转数 3 n
+转文 3 v
+转斗千里 3 l
+转日回天 3 l
+转晴 3 v
+转机 290 n
+转机建制 3 l
+转来 3 v
+转来转去 105 i
+转枱 3 vn
+转柄 3 n
+转染 2 v
+转染子 3 n
+转染瘤 3 n
+转校 3 n
+转椅 21 n
+转款 3 v
+转正 222 v
+转死沟壑 3 i
+转死沟渠 3 n
+转氢酶 3 n
+转氨甲 3 n
+转氨酶 66 n
+转法 3 v
+转法轮 4 n
+转注 7 v
+转流 3 v
+转海回天 3 i
+转游 21 vn
+转湾抹角 3 v
+转灯 3 v
+转灾为福 3 l
+转炉 63 v
+转生 24 v
+转用 33 v
+转病 3 v
+转登 3 v
+转益多师 8 i
+转盘 40 v
+转盘式 3 n
+转盼流光 3 i
+转看 3 v
+转眼 346 v
+转眼之间 116 l
+转眼间 243 t
+转着 3 v
+转睛 3 n
+转瞬 94 t
+转瞬之间 41 l
+转瞬即逝 55 i
+转瞬间 75 t
+转矩 19 n
+转矩托槽 3 nz
+转矩辅弓 3 nz
+转码 3 n
+转磨 3 v
+转祸为福 5 i
+转种 3 v
+转科 3 n
+转租 17 v
+转租给 3 n
+转移 3941 v
+转移因子 3 l
+转移性 3 n
+转移氢化 3 nz
+转移率 11 n
+转移盖 3 l
+转移装置 3 i
+转移视线 3 n
+转移酶 3 l
+转移阵地 3 i
+转移预测 3 i
+转站 3 n
+转笔刀 3 n
+转筋 11 v
+转糖基酶 3 nz
+转系 3 v
+转经筒 3 n
+转结 3 v
+转给 148 v
+转网 3 v
+转置 3 v
+转羟基 3 nz
+转羧酶 3 n
+转而 569 c
+转职 3 v
+转肽作用 3 n
+转肽基酶 3 n
+转胜为败 3 l
+转脸 122 v
+转至 3 v
+转舵 3 v
+转船 3 v
+转行 129 v
+转角 69 n
+转角处 32 n
+转角铺作 3 l
+转让 1306 v
+转让技术 3 n
+转让方 26 n
+转让权 2 n
+转让款 12 n
+转让费 3 n
+转让金 2 n
+转议 3 v
+转诊 12 v
+转译 28 v
+转语 3 v
+转请 3 v
+转调 50 v
+转败为功 3 i
+转败为成 3 i
+转败为胜 33 i
+转账 50 v
+转账支票 3 n
+转贴 3 v
+转贴自 3 i
+转贷 2 v
+转赠 17 v
+转赠给 3 n
+转走 3 v
+转赴 38 v
+转起 3 v
+转身 3256 v
+转身法 3 n
+转车 13 v
+转车站 3 n
+转轨 139 v
+转轨变型 3 n
+转转 132 v
+转转看 3 v
+转轮 60 n
+转轮密码 3 n
+转轮手枪 18 l
+转轴 139 n
+转载 271 v
+转载稿 3 n
+转载自 3 nz
+转辗反侧 3 v
+转辙机 3 nz
+转达 296 v
+转过 2232 v
+转过身 3 v
+转运 591 v
+转运体 3 n
+转运港 3 nz
+转运站 25 n
+转进 3 v
+转述 100 v
+转送 74 v
+转递 10 v
+转速 257 v
+转速比 3 n
+转速表 3 n
+转道 30 v
+转配股 4 n
+转酮酶 3 n
+转酯 3 n
+转铁蛋白 3 l
+转铃 3 n
+转销 8 v
+转门 8 v
+转阴 25 v
+转院 28 n
+转隶 7 n
+转音 3 n
+转韵 3 n
+转风易俗 3 i
+转马 169 v
+转鼓 12 v
+轭 161 g
+轮 4615 zg
+轮上去 3 v
+轮上来 3 v
+轮下去 3 v
+轮下来 3 v
+轮不上 3 d
+轮不到 3 v
+轮为 3 v
+轮休 24 v
+轮休制 3 n
+轮休地 3 n
+轮住 3 v
+轮作 80 vn
+轮作制 21 n
+轮作周期 3 n
+轮作法 3 n
+轮值 73 n
+轮值法 3 n
+轮具 3 n
+轮养 3 n
+轮到 3 v
+轮南 3 ns
+轮发 3 v
+轮台 23 n
+轮台县 5 ns
+轮唱 5 v
+轮回 376 v
+轮回亲本 3 n
+轮圈 3 n
+轮奸 13 n
+轮奸案 3 n
+轮子 207 n
+轮子功 3 n
+轮完 3 v
+轮岗 17 n
+轮带 7 n
+轮底 3 n
+轮底下 3 n
+轮廓 499 n
+轮廓仪 3 ns
+轮廓图 3 ns
+轮廓线 19 ns
+轮式 228 n
+轮形 3 n
+轮战 3 n
+轮扁斫轮 3 r
+轮抗六号 3 n
+轮指 7 n
+轮换 221 v
+轮换制 7 n
+轮换成 3 n
+轮换排列 3 n
+轮换次序 3 n
+轮提 3 n
+轮播 3 vn
+轮数 3 n
+轮替 24 v
+轮有 3 v
+轮机 19 n
+轮机员 3 n
+轮机室 3 n
+轮机手 3 n
+轮机舱 3 n
+轮机长 2 n
+轮来 3 v
+轮来轮去 3 n
+轮架 3 n
+轮栽 3 n
+轮栽法 3 vn
+轮椅 96 n
+轮椅车 2 n
+轮次 16 d
+轮毂 11 n
+轮毂罩 3 v
+轮法 3 n
+轮流 694 n
+轮流做庄 3 n
+轮流制 3 n
+轮流法 3 n
+轮流转 3 n
+轮渡 72 v
+轮滑 22 v
+轮滑鞋 5 n
+轮演 3 n
+轮点 3 n
+轮焉奂焉 3 nr
+轮牧 5 n
+轮状 3 n
+轮状病毒 3 n
+轮班 43 n
+轮班制 3 n
+轮班工作 3 n
+轮班看守 3 vn
+轮生叶 3 n
+轮番 514 d
+轮番上阵 3 n
+轮盖 3 n
+轮盘 29 n
+轮着 3 v
+轮种 7 n
+轮种法 3 n
+轮空 37 n
+轮穿 3 v
+轮箍 5 n
+轮纹病 2 n
+轮组 2 n
+轮缘 7 n
+轮网 3 n
+轮耕 3 v
+轮胎 311 n
+轮胎厂 6 n
+轮胎壁 3 n
+轮胎式 11 n
+轮胎橡胶 9 n
+轮胎气压 3 n
+轮舞 9 n
+轮舱 3 n
+轮船 679 n
+轮虫 3 n
+轮补 3 v
+轮训 28 n
+轮训班 3 n
+轮试 3 vn
+轮询 3 vn
+轮调 3 n
+轮调制 3 n
+轮调法 3 n
+轮起来 3 v
+轮距 56 n
+轮踢 3 n
+轮轨 7 n
+轮转 43 v
+轮转工 3 n
+轮转机 3 n
+轮轴 14 n
+轮辋 11 n
+轮辐 4 n
+轮过 3 v
+轮过去 3 v
+轮过来 3 d
+轮退 3 v
+轮送 3 v
+轮锤 3 n
+轮陷 3 n
+轮鞋 3 n
+轮驳 3 v
+轮骑 3 n
+轮齿 3 n
+软 3730 a
+软下疳 3 n
+软乎乎 5 z
+软交会 6 j
+软交换 3 v
+软件 4601 n
+软件世界 3 n
+软件业 93 l
+软件产业 3 l
+软件产品 57 l
+软件体系结构 4 l
+软件作者 3 n
+软件保护 6 n
+软件加密 3 n
+软件包 41 l
+软件协会 3 l
+软件厂商 3 n
+软件可靠性 6 n
+软件名称 3 n
+软件商 10 n
+软件园 260 n
+软件屋 3 n
+软件工具 20 l
+软件工程 377 l
+软件工程学 4 l
+软件巨头 3 n
+软件平台 9 l
+软件应用 3 l
+软件开发 3 l
+软件技术 3 n
+软件教程 3 l
+软件架构 3 l
+软件测试 29 n
+软件版 3 n
+软件狗 3 l
+软件生产率 6 l
+软件程序 4 l
+软件站 3 n
+软件系统 73 l
+软件结构 2 l
+软件维护 13 n
+软件缺陷 3 n
+软件网 3 n
+软件设计 3 l
+软件资源 5 l
+软件超市 3 i
+软件部 3 n
+软件配置管理 2 l
+软件量度 3 l
+软任务 3 n
+软体 30 n
+软体动物 169 l
+软体部 3 n
+软兜 3 n
+软刀子 11 n
+软包装 3 n
+软化 161 n
+软化剂 5 n
+软化政策 3 n
+软化栽培 3 l
+软化水 3 n
+软化病 2 n
+软博会 3 j
+软卧 26 n
+软口盖 3 n
+软启动 3 l
+软和 81 nz
+软商品 3 n
+软土 3 n
+软坚 16 n
+软坚散结 3 n
+软型 2 n
+软垢指数 3 i
+软垫 26 n
+软塌塌 10 z
+软失效率 3 n
+软字库 3 n
+软尺 3 n
+软层 3 n
+软布 3 v
+软席 3 n
+软床 9 n
+软座 6 n
+软式 17 n
+软式磁碟 3 n
+软弱 428 a
+软弱可欺 3 i
+软弱性 3 n
+软弱无力 48 l
+软弱无能 3 l
+软弱涣散 3 i
+软心肠 3 l
+软思维 3 l
+软性 42 n
+软性覆面 3 l
+软懒散 3 i
+软指标 5 n
+软故障 3 n
+软文 3 n
+软木 68 n
+软木塞 13 n
+软木板 3 n
+软木树 3 n
+软木质 3 n
+软材 3 n
+软板 3 n
+软枣 7 n
+软柿子 3 v
+软梯 5 n
+软椅 15 n
+软武器 3 l
+软毛 3 n
+软水 15 n
+软水器 3 n
+软水机 3 n
+软沥青 3 z
+软波导 3 n
+软泥 70 n
+软流圈 20 n
+软片 6 n
+软玉 34 n
+软玉娇香 3 i
+软玉温香 3 i
+软环境 27 l
+软瘤 3 n
+软瘫 59 n
+软皮 3 n
+软皮动物 3 l
+软盘 53 n
+软盘套 3 n
+软盘片 3 n
+软盘版 3 n
+软盘驱动器 2 n
+软着陆 76 l
+软硬 88 a
+软硬不吃 3 l
+软硬件 62 l
+软硬兼施 32 l
+软硬木 3 n
+软碟 3 n
+软碟机 3 n
+软磁 26 n
+软磁化 3 n
+软磁盘 16 n
+软磁盘机 3 n
+软磨 5 v
+软磨硬抗 3 i
+软磨硬泡 15 l
+软禁 133 v
+软科学 36 l
+软管 29 n
+软管束 3 n
+软箱 3 n
+软簧 3 n
+软糖 15 n
+软红十丈 3 l
+软红香土 3 n
+软线 2 n
+软组织 110 l
+软绳 3 n
+软绵 10 z
+软绵绵 96 z
+软缎 15 n
+软耳朵 3 n
+软肋 3 n
+软胶 4 n
+软胶囊 3 n
+软脂 3 n
+软脂酸 12 n
+软脚 3 n
+软腐 3 n
+软腐病 10 n
+软腭 22 n
+软膏 34 n
+软膏剂 4 n
+软膜 7 n
+软蛋 3 n
+软裘快马 3 i
+软解压 3 n
+软设备 3 n
+软话 3 n
+软语 70 nz
+软语温言 3 l
+软谈丽语 3 i
+软质 3 n
+软质性 3 n
+软起动 3 l
+软起动器 3 l
+软软 177 a
+软软弱弱 3 l
+软软松松 3 n
+软轴 3 n
+软酥酥 3 z
+软钉子 9 l
+软钢 2 n
+软铁 3 n
+软铅 3 nz
+软银 19 n
+软键 3 n
+软键盘 3 n
+软锰矿 12 n
+软门帘 3 l
+软陶 2 n
+软雕塑 3 i
+软鞋 3 n
+软风 3 n
+软食 3 n
+软饭 3 n
+软饮料 35 l
+软香温玉 3 nz
+软驱 34 n
+软骨 161 n
+软骨头 41 n
+软骨病 16 n
+软骨素 6 n
+软骨鱼 35 n
+软骨鱼类 3 n
+轰 1895 v
+轰上 3 v
+轰上去 3 v
+轰上来 3 v
+轰下 3 v
+轰下去 3 v
+轰下台 7 n
+轰下来 3 v
+轰乱 3 v
+轰传 3 v
+轰倒 3 v
+轰出 3 v
+轰出去 3 i
+轰出来 3 i
+轰击 349 v
+轰到 3 v
+轰动 432 v
+轰动一时 61 i
+轰动性 4 n
+轰动效应 3 n
+轰响 42 vn
+轰堂大笑 3 i
+轰声 3 n
+轰声四起 3 i
+轰天烈地 3 i
+轰天裂地 3 n
+轰天雷 3 i
+轰开 3 v
+轰得 3 v
+轰成 3 v
+轰掉 3 v
+轰来轰去 3 i
+轰炸 684 v
+轰炸机 860 n
+轰然 270 d
+轰的一声 3 i
+轰走 3 v
+轰赶 3 v
+轰起 3 v
+轰起来 3 v
+轰轰 8 v
+轰轰声 3 i
+轰轰烈烈 431 i
+轰轰隆隆 21 o
+轰过 3 v
+轰进 3 v
+轰进去 3 v
+轰进来 3 v
+轰隆 129 o
+轰隆声 3 n
+轰隆轰隆 36 o
+轰隆隆 103 o
+轰雷掣电 3 l
+轰雷贯耳 3 i
+轰需宽尔 3 l
+轰鸣 159 v
+轰鸣声 72 i
+轱 3 n
+轱轳 2 n
+轱辘 24 n
+轲 39 x
+轲比能 3 nr
+轳 2 x
+轴 1377 n
+轴丝 3 n
+轴功率 3 n
+轴向 3 n
+轴头 5 n
+轴套 3 n
+轴子 3 n
+轴孔 3 n
+轴对称 16 n
+轴封 3 n
+轴式 12 n
+轴心 63 n
+轴心国 72 n
+轴承 186 n
+轴承厂 4 n
+轴承合金 3 n
+轴承座 2 n
+轴承网 3 n
+轴承钢 3 n
+轴档 3 n
+轴比 3 n
+轴毛 3 n
+轴流 4 n
+轴流式 16 n
+轴流泵 2 n
+轴浆 3 n
+轴浆流 3 n
+轴瓦 266 n
+轴皮 3 n
+轴矢量 3 vn
+轴突 61 n
+轴突导向 3 n
+轴突延伸 3 n
+轴突成束 3 n
+轴突生长 3 n
+轴突运输 3 n
+轴箱 4 n
+轴系 3 n
+轴索 3 n
+轴线 122 n
+轴衬 3 n
+轴视图 3 n
+轴角 3 n
+轴距 55 n
+轴重 3 n
+轴面 3 n
+轴颈 11 n
+轵 10 g
+轶 288 n
+轶事 78 n
+轶事遗闻 3 n
+轶类超群 3 vn
+轶群绝类 3 n
+轶诗 3 n
+轶闻 103 n
+轶闻遗事 3 n
+轸 31 g
+轸念 3 nr
+轹 2 zg
+轹釜待炊 3 n
+轺 13 g
+轻 7559 a
+轻不着力 3 l
+轻世傲物 2 i
+轻世肆志 3 i
+轻中度 3 n
+轻举妄动 169 i
+轻举绝俗 3 i
+轻举远游 3 i
+轻事重报 3 n
+轻于 3 d
+轻于鸿毛 13 i
+轻伤 110 a
+轻伤者 3 n
+轻体 6 n
+轻佻 44 a
+轻侮 3 v
+轻便 166 a
+轻便型 3 n
+轻便式 3 l
+轻便车 5 n
+轻俏 3 a
+轻信 103 j
+轻傜薄赋 3 v
+轻元素 18 n
+轻兵 27 n
+轻兵器 3 n
+轻减 3 v
+轻击 3 v
+轻判 4 v
+轻利 3 a
+轻利重义 3 i
+轻剑 3 n
+轻功 3 a
+轻加工 3 n
+轻卒锐兵 3 vn
+轻印刷 3 l
+轻压 3 n
+轻取 81 v
+轻口薄舌 3 i
+轻口轻舌 3 i
+轻叩 3 v
+轻吊 13 v
+轻吞慢吐 3 i
+轻吟 3 z
+轻吹 3 v
+轻吻 3 n
+轻咬 3 v
+轻喜剧 5 n
+轻嘴薄舌 3 i
+轻型 639 b
+轻型化 5 n
+轻型坦克 69 nz
+轻型客车 3 n
+轻型机车 3 n
+轻型车 6 n
+轻声 603 d
+轻声细语 9 i
+轻声轻气 3 i
+轻声道 135 i
+轻奏 3 n
+轻如羽毛 3 i
+轻如鸿毛 4 i
+轻妙 4 a
+轻婉 3 a
+轻安 3 a
+轻巡洋舰 3 nz
+轻工 706 n
+轻工业 717 n
+轻工业品 13 n
+轻工业局 7 n
+轻工业部 16 n
+轻工产品 3 n
+轻工厅 2 n
+轻工学院 2 n
+轻工局 3 n
+轻工部 5 n
+轻巧 148 a
+轻巧型 3 n
+轻巧方便 3 i
+轻度 209 d
+轻弹 3 n
+轻待 3 v
+轻徙鸟举 3 i
+轻徭薄税 3 l
+轻徭薄赋 23 l
+轻微 538 d
+轻微伤 3 i
+轻心 3 n
+轻快 167 d
+轻快地 3 z
+轻快飞过 3 i
+轻忽 105 d
+轻怜疼惜 3 i
+轻怜痛惜 3 i
+轻怜重惜 3 i
+轻悄悄 2 z
+轻悠悠 3 z
+轻慢 31 d
+轻手蹑脚 3 z
+轻手软脚 3 i
+轻手轻脚 75 z
+轻手鸿毛 3 i
+轻才好施 3 i
+轻扬 12 v
+轻抚 3 n
+轻护航舰 3 n
+轻拂 12 v
+轻拉 3 z
+轻拍 3 v
+轻拨 3 v
+轻按 3 n
+轻捷 112 a
+轻推 3 b
+轻揉 3 i
+轻描淡写 184 i
+轻描谈写 3 i
+轻撞 3 z
+轻擂 3 v
+轻擦 3 v
+轻放 3 v
+轻敌 194 n
+轻敌思想 3 i
+轻敲 3 v
+轻敲缓击 3 i
+轻文重武 3 i
+轻易 1474 a
+轻暖 3 a
+轻木 12 n
+轻机关枪 3 l
+轻机枪 95 n
+轻松 1979 a
+轻松升级 3 n
+轻松愉快 3 z
+轻松感 12 n
+轻松松 3 z
+轻松自在 3 b
+轻松自如 3 ns
+轻松自由 3 n
+轻柔 187 a
+轻柴油 3 n
+轻歌剧 3 n
+轻歌妙舞 3 i
+轻歌曼舞 3 i
+轻武器 189 n
+轻死重义 3 i
+轻死重气 3 z
+轻气 3 n
+轻气球 3 n
+轻水 14 n
+轻油 6 n
+轻油裂解 3 l
+轻洗 3 b
+轻活 9 a
+轻浮 93 a
+轻灵 96 a
+轻点 35 d
+轻爽 3 a
+轻狂 42 a
+轻率 167 n
+轻率地 3 n
+轻率地说 3 l
+轻率行为 3 n
+轻生 48 b
+轻生女 3 n
+轻生重义 3 i
+轻盈 232 z
+轻盔 3 n
+轻矛 3 n
+轻石 3 n
+轻税 3 n
+轻窕 3 a
+轻粉 3 n
+轻繇薄赋 3 v
+轻纱 3 n
+轻纺 210 j
+轻纺产品 3 n
+轻纺城 3 n
+轻缓 3 d
+轻罚 3 n
+轻罪 3 v
+轻罪重判 3 l
+轻者 3 n
+轻而易举 196 i
+轻而易取 3 i
+轻脆 3 d
+轻脆动听 3 i
+轻脆悦耳 3 i
+轻脚轻手 3 i
+轻舟 27 n
+轻舟浮泛 3 n
+轻色重义 3 i
+轻色重利 3 i
+轻若鸿毛 3 i
+轻蔑 309 v
+轻蔑地笑 3 vn
+轻蔑性 3 vn
+轻薄 218 a
+轻薄型 2 b
+轻薄少年 3 i
+轻薄无知 3 i
+轻薄无礼 3 i
+轻薄无行 6 i
+轻薄透明 3 z
+轻虑浅谋 3 i
+轻装 221 b
+轻装上阵 22 i
+轻装前进 3 l
+轻装师 3 n
+轻装简从 11 i
+轻装简行 2 i
+轻裘 3 n
+轻裘缓带 3 i
+轻裘缓辔 3 i
+轻裘肥马 2 i
+轻视 472 b
+轻视傲物 3 i
+轻触 3 v
+轻言 3 n
+轻言寡信 3 i
+轻言细语 5 i
+轻言肆口 3 i
+轻言软语 3 i
+轻言轻语 3 i
+轻诺寡信 3 i
+轻诺寡言 3 i
+轻财 3 j
+轻财仗义 3 i
+轻财好义 3 i
+轻财好士 3 i
+轻财好施 3 i
+轻财敬士 3 i
+轻财贵义 3 i
+轻财重义 3 i
+轻财重土 3 i
+轻财重士 3 i
+轻质 49 n
+轻质油 9 n
+轻质车架 3 n
+轻贱 51 a
+轻赋薄敛 3 i
+轻踏 3 v
+轻身 178 n
+轻身下气 3 i
+轻身徇义 3 i
+轻身殉义 3 i
+轻身重义 3 i
+轻车 16 n
+轻车从简 3 i
+轻车熟路 23 i
+轻车熟道 3 i
+轻车简从 7 i
+轻轨 15 b
+轻轨站 3 n
+轻软 40 a
+轻轻 4408 d
+轻轻作响 3 i
+轻轻地 903 z
+轻轻松松 47 z
+轻载 9 b
+轻重 467 a
+轻重倒置 2 i
+轻重失宜 3 i
+轻重工业 22 n
+轻重武器 3 l
+轻重缓急 52 z
+轻重量级 3 b
+轻量 9 n
+轻量化 3 n
+轻量级 13 b
+轻金属 14 n
+轻钢 3 n
+轻铁 3 n
+轻链 8 n
+轻闲 9 z
+轻音 3 n
+轻音乐 26 n
+轻风 26 n
+轻风徐来 3 l
+轻飘 19 z
+轻飘飘 184 z
+轻饶 3 a
+轻饶素放 3 l
+轻骑 120 n
+轻骑兵 107 n
+轻骑简从 3 i
+轻骑队 6 n
+轻骨头 3 n
+轼 9 g
+载 3349 v
+载一抱素 3 i
+载于 3 v
+载人 282 n
+载体 474 n
+载入 356 v
+载入史册 3 n
+载入器 3 n
+载出 3 v
+载出去 3 v
+载出来 3 v
+载到 3 v
+载力 3 n
+载客 108 n
+载客率 4 n
+载客量 19 n
+载弹量 43 n
+载录 9 n
+载往 3 v
+载文 28 n
+载明 33 v
+载有 216 b
+载来 3 v
+载来载去 3 i
+载歌且舞 3 i
+载歌载舞 96 i
+载沉载浮 6 i
+载波 53 n
+载波机 3 n
+载波通信 3 i
+载流子 59 n
+载湉 3 vn
+载满 3 v
+载满了 3 i
+载热剂 3 n
+载物 4 n
+载物台 2 n
+载率 3 n
+载玻片 2 n
+载畜量 12 n
+载笑载言 3 i
+载脂蛋白 3 n
+载舟 3 n
+载舟覆舟 3 i
+载荷 430 n
+载誉 21 n
+载誉归来 3 i
+载记 3 n
+载货 38 n
+载货率 3 n
+载货电梯 3 n
+载货车 2 n
+载货量 5 n
+载起 3 v
+载起来 3 v
+载运 96 n
+载运量 3 n
+载道 3 v
+载酒问字 3 n
+载重 415 b
+载重汽车 3 n
+载重车 8 n
+载重量 100 n
+载量 14 n
+载金碳 3 n
+载频 2 b
+载驰载驱 3 i
+载驱载驰 3 i
+载驳船 15 n
+轿 2458 n
+轿厢 4 n
+轿夫 142 n
+轿子 593 n
+轿椅 3 n
+轿车 521 n
+轿车如 3 n
+轿车市场 3 n
+轿门 3 n
+辂 219 g
+较 30431 zg
+较严 3 a
+较为 2350 d
+较为理想 2 n
+较为简单 2 z
+较之 215 d
+较之于 4 p
+较优 3 d
+较佳 3 a
+较前年 3 n
+较力 3 d
+较劲 79 a
+较劲儿 8 d
+较厚 3 a
+较后 3 d
+较场 3 d
+较场口 21 v
+较坏 3 v
+较多序 3 n
+较大 6637 a
+较大型 16 b
+较妥 3 a
+较完整 4 z
+较少 3 d
+较差 786 a
+较广 3 a
+较弱 3 a
+较往年 3 v
+较德焯勤 3 vn
+较快 3 d
+较慢 3 a
+较技 5 n
+较早 3 d
+较易 3 a
+较晚 3 d
+较松 3 a
+较正 3 d
+较武论文 3 n
+较浅 2 a
+较熟 3 a
+较理想 2 n
+较瘦 3 a
+较瘦量肥 3 v
+较真 32 a
+较真儿 11 d
+较短比长 3 v
+较短絜长 3 v
+较短量长 3 b
+较硬 3 a
+较窄 3 a
+较紧 3 d
+较繁 3 a
+较胜一筹 3 n
+较若画一 3 v
+较著 3 a
+较轻 3 a
+较远 3 a
+较重 3 a
+较重者 8 n
+较量 929 d
+较量法 3 b
+较长时间 5 n
+较长絜短 3 v
+较高级 37 b
+辄 89 dg
+辅 1035 vn
+辅世长民 3 nz
+辅之于 3 v
+辅仁 90 nz
+辅仁大学 3 nz
+辅以 126 v
+辅佐 355 v
+辅佐剂 3 v
+辅佑 3 nz
+辅修 28 vn
+辅助 1345 vn
+辅助信号 3 nz
+辅助剂 3 n
+辅助副本 3 n
+辅助单位 3 v
+辅助因子 3 n
+辅助存储器 2 n
+辅助工具 3 n
+辅助性 32 n
+辅助材料 3 n
+辅助生产 3 v
+辅助码 3 n
+辅助线 3 n
+辅助编码 3 n
+辅助色素 3 n
+辅助蛋白 3 n
+辅助设计 3 n
+辅助货币 3 n
+辅助输入 3 n
+辅因子 3 n
+辅增塑剂 3 n
+辅大 3 v
+辅导 471 vn
+辅导书 66 n
+辅导会 3 n
+辅导员 55 n
+辅导处 3 n
+辅导室 3 n
+辅导工作 3 n
+辅导教师 3 n
+辅导材料 3 n
+辅导班 228 n
+辅导站 8 n
+辅导级 3 n
+辅导组 3 n
+辅导课 6 n
+辅导资料 3 n
+辅导院 3 n
+辅币 23 n
+辅弼 12 v
+辅弼之勋 3 v
+辅政 206 n
+辅料 39 n
+辅料厂 3 n
+辅机 12 n
+辅激活物 3 n
+辅系 3 n
+辅线 6 n
+辅翼 3 n
+辅育院 3 n
+辅脂肪酶 3 n
+辅致癌剂 3 n
+辅车 3 n
+辅车唇齿 3 n
+辅车相依 3 nz
+辅车相将 3 n
+辅选 3 v
+辅酶 47 nz
+辅音 139 n
+辆 2547 m
+辆数 3 m
+辆次 8 m
+辆车 3 m
+辇 779 g
+辈 1337 n
+辈份 84 n
+辈出 604 v
+辈分 85 n
+辈子 394 n
+辈数 15 n
+辈数儿 3 n
+辈行 3 n
+辉 510 nr
+辉光 29 n
+辉光值 3 n
+辉光日新 3 nz
+辉光灯 3 n
+辉南 4 ns
+辉南县 3 ns
+辉县 29 ns
+辉县市 5 ns
+辉映 213 v
+辉月使 3 nz
+辉煌 1235 a
+辉煌成就 3 n
+辉煌灿烂 3 z
+辉煌金碧 3 n
+辉瑞 29 nz
+辉瑞公司 9 nt
+辉石 144 n
+辉砷镍矿 3 vn
+辉绿岩 19 ns
+辉耀 4 a
+辉钴矿 4 n
+辉钼矿 12 n
+辉铜 3 n
+辉铜矿 14 nz
+辉银 3 nz
+辉银矿 6 nt
+辉锑矿 12 n
+辉长岩 21 n
+辊 50 n
+辊子 3 n
+辊轴 3 n
+辋 14 g
+辍 177 vg
+辍学 172 v
+辍学率 273 v
+辍学生 7 v
+辍毫栖牍 3 n
+辍演 3 v
+辍笔 5 v
+辍耕 3 v
+辎 14 n
+辎重 185 n
+辏 333 ng
+辐 130 v
+辐凑 3 v
+辐合 73 v
+辐合思维 3 n
+辐射 2452 v
+辐射交联 3 nz
+辐射仪 10 n
+辐射体 3 n
+辐射保藏 3 n
+辐射分解 3 n
+辐射剂 3 n
+辐射力 13 n
+辐射功率 3 n
+辐射加工 3 n
+辐射区 7 n
+辐射参数 3 n
+辐射器 6 n
+辐射型 3 n
+辐射学 3 n
+辐射对称 3 n
+辐射尘 3 n
+辐射式 2 n
+辐射强度 3 n
+辐射性 3 n
+辐射损伤 3 n
+辐射改性 3 n
+辐射效率 3 n
+辐射敏化 3 n
+辐射源 54 n
+辐射炉 3 n
+辐射点 12 n
+辐射热 3 n
+辐射状 55 n
+辐射率 3 n
+辐射电阻 3 n
+辐射线 3 n
+辐射能 57 n
+辐射计 24 n
+辐射跃迁 3 n
+辐射量 288 n
+辐射阻抗 3 n
+辐射面 4 n
+辐射频谱 3 n
+辐条 12 n
+辐照 89 v
+辐照室 3 n
+辐照度 3 n
+辐照率 3 n
+辐辏 17 v
+辑 640 q
+辑书 3 n
+辑佚 21 v
+辑刊 3 v
+辑印 3 v
+辑印成书 3 n
+辑录 124 v
+辑录出来 3 v
+辑志协力 3 n
+辑要 3 v
+输 2922 v
+输不起 3 v
+输了球 3 l
+输了钱 3 v
+输人 3 n
+输人不 3 l
+输光 26 n
+输入 1700 v
+输入区 3 n
+输入品 3 n
+输入国 13 n
+输入地 8 n
+输入度 3 n
+输入您 3 l
+输入条 3 l
+输入板 8 n
+输入框 3 n
+输入法 19 n
+输入电阻 3 l
+输入码 3 l
+输入脉冲 3 n
+输入输出 3 n
+输入通 3 l
+输入速度 3 n
+输入量 9 n
+输入阻抗 3 n
+输入额 3 n
+输出 2335 v
+输出介质 3 l
+输出入 5 v
+输出功率 3 n
+输出区 3 n
+输出变压 3 l
+输出品 3 n
+输出国 52 n
+输出地 7 n
+输出幅面 3 l
+输出方 5 n
+输出模块 3 n
+输出特性 3 n
+输出电阻 3 v
+输出管 3 vn
+输出精度 3 n
+输出线路 3 n
+输出表 3 n
+输出设备 3 n
+输出量 3 n
+输出阻抗 3 n
+输到 3 v
+输卵 3 v
+输卵管 130 n
+输卵管炎 3 n
+输去 3 v
+输变电 31 l
+输嘴 3 v
+输多赢少 3 n
+输完 3 v
+输定 3 v
+输家 31 n
+输导 40 v
+输导组织 3 n
+输少赢多 3 n
+输尽光 3 l
+输尿管 116 n
+输往 87 v
+输得 3 v
+输心服意 3 l
+输成 3 v
+输掉 3 v
+输来 3 v
+输来输去 3 n
+输气 54 n
+输气管 4 vn
+输气管道 3 l
+输气量 3 n
+输氧 22 v
+输氧管 3 n
+输水 54 v
+输水管 2 n
+输水管线 2 n
+输水道 3 n
+输沙 9 ns
+输沙能力 3 n
+输沙量 86 n
+输油 74 n
+输油末站 3 n
+输油泵 3 n
+输油管 47 n
+输油管线 17 n
+输油管道 52 n
+输注 74 v
+输液 186 n
+输液器 6 n
+输液泵 3 n
+输液瓶 8 n
+输液管 17 n
+输点 3 n
+输球 147 n
+输理 3 v
+输电 467 v
+输电线 17 n
+输电网 2 nz
+输粮 3 v
+输精 3 n
+输精管 54 n
+输纸 3 v
+输给 358 v
+输者 3 n
+输肝写胆 3 n
+输肝剖胆 3 n
+输肝沥胆 3 n
+输胆管 3 l
+输血 222 v
+输血反应 3 l
+输血式 2 n
+输血机 3 n
+输血管 3 n
+输诚 3 v
+输财助边 3 l
+输赢 178 v
+输赢不计 3 n
+输起 3 v
+输起来 3 l
+输输 3 vn
+输过 3 v
+输过去 3 l
+输过来 3 l
+输运 71 v
+输运到 3 l
+输运现象 3 l
+输进 3 v
+输进去 3 v
+输进来 3 l
+输送 631 v
+输送乳汁 3 n
+输送到 3 l
+输送小车 3 n
+输送带 9 n
+输送机 43 n
+输送架 3 n
+输送泵 2 n
+输送管 3 n
+输送线 3 n
+输送车 194 n
+输送量 5 n
+输送链 3 n
+输送顺序 3 l
+输配 5 v
+输配水 2 n
+输配电 18 n
+输钱 11 v
+辔 176 zg
+辔头 47 n
+辕 94 n
+辕门 169 n
+辕马 4 n
+辖 7589 v
+辖下 22 s
+辖内 3 s
+辖制 18 n
+辖区 1733 n
+辖地 3 n
+辖境 3 n
+辖属 4 n
+辖治 3 n
+辗 80 v
+辗平 3 v
+辗成 3 v
+辗毙 3 v
+辗米 3 v
+辗米厂 3 l
+辗转 374 v
+辗转不安 3 i
+辗转反侧 50 i
+辗转流传 3 i
+辗转相告 3 i
+辗转难眠 6 i
+辗过 3 v
+辗铁 3 v
+辘 39 n
+辘轳 42 n
+辘辘 3 n
+辙 70 n
+辙叉 3 nz
+辙口 3 nz
+辙环天下 3 nz
+辙鲋之急 3 v
+辚 28 x
+辚辚 3 nr
+辛 562 nr
+辛丑 196 nr
+辛丑和约 3 nz
+辛丑年 3 m
+辛业江 14 nz
+辛丰年 2 nr
+辛二 2 m
+辛二祀 2 nr
+辛亥 32 m
+辛亥年 4 nz
+辛亥革命 2027 nz
+辛亥首 11 ns
+辛企宗 3 nr
+辛伐他汀 7 nz
+辛伯达 2 nr
+辛佐伊海巴 2 ns
+辛元年 3 nr
+辛元植 2 nr
+辛元祀 6 nr
+辛克 4 nz
+辛克莱 7 nr
+辛兴宗 48 nr
+辛凉解 6 nr
+辛几何 2 nr
+辛劳 117 nz
+辛勤 1342 nr
+辛勤努力 3 nr
+辛勤劳动 3 nz
+辛勤工作 3 n
+辛勤耕耘 3 nr
+辛卯 7 m
+辛卯日 2 m
+辛双 5 m
+辛双清 10 nr
+辛变换 3 nr
+辛可宁 6 nr
+辛可尼 2 nr
+辛吉斯 27 nr
+辛味 4 nz
+辛四烯 4 nz
+辛国梁 24 nr
+辛地亚 2 ns
+辛基 3 nz
+辛壬癸甲 3 nr
+辛大人 4 nr
+辛夷 24 nz
+辛安驿 2 ns
+辛宪英 2 nr
+辛家 4 nz
+辛家庄 3 nr
+辛巳 10 nr
+辛巴威 3 nr
+辛巴达 3 nr
+辛师叔 4 nr
+辛庄村 2 nr
+辛庄镇 3 nr
+辛店 17 nz
+辛店村 3 ns
+辛店镇 5 ns
+辛康宗 4 nr
+辛弃疾 73 nr
+辛德勒 7 nr
+辛德赫 2 nr
+辛志伟 3 nr
+辛思忠 7 nr
+辛戌 3 m
+辛拉帕加 2 nz
+辛敞 3 a
+辛散温 2 nr
+辛散轻 2 nr
+辛斯克 10 nz
+辛晓琪 3 nr
+辛普利 2 nz
+辛普朗 10 nr
+辛普森 12 nr
+辛普里 26 nr
+辛未 6 nr
+辛杜格 2 nr
+辛松钊 2 nr
+辛柏利 4 nr
+辛柏青 3 nr
+辛树力 2 nr
+辛树见 5 nr
+辛根 2 nz
+辛格 73 nz
+辛格尔 2 nr
+辛武贤 2 nr
+辛比尔 4 nr
+辛永宗 7 nr
+辛汉臣 2 nr
+辛泰 4 nz
+辛温 11 nz
+辛温解 4 nr
+辛温香 2 nr
+辛炔 3 n
+辛烈 3 a
+辛烯 2 nz
+辛烷 4 nz
+辛烷值 13 nr
+辛然 10 z
+辛燥 2 a
+辛甘性 2 nr
+辛白林 3 nr
+辛硫磷 3 nz
+辛祀谱 2 nr
+辛纪功 2 nr
+辛育龄 2 nr
+辛胜破 3 nr
+辛苑薇 6 nr
+辛苦 1221 a
+辛苦工作 3 l
+辛苦费 6 nr
+辛菲罗 2 nr
+辛虎 2 nz
+辛西娅 2 nr
+辛评 2 v
+辛诵 3 v
+辛辛苦苦 194 z
+辛辛那提 21 ns
+辛辛那提大学 3 nt
+辛辣 188 z
+辛辣味 16 nz
+辛辣讽刺 3 vn
+辛辣诡异 3 nr
+辛辣辣 3 z
+辛辰 3 nz
+辛迪 18 nz
+辛迪加 22 nz
+辛那克 2 nr
+辛酉 28 nr
+辛酉年 5 m
+辛酉日 2 m
+辛酮 3 nz
+辛酸 162 nz
+辛酸史 3 nz
+辛酸泪 3 n
+辛酸苦辣 2 z
+辛醇 15 nz
+辛醛 3 nz
+辛里奇 12 nr
+辛金 3 nz
+辛集 10 v
+辛集市 9 ns
+辛香料 3 nz
+辛香温 2 nr
+辛黛瑞 7 nr
+辜 110 nr
+辜恩背 2 nr
+辜恩背义 3 nr
+辜恩负义 3 nr
+辜振甫 20 nr
+辜濂松 6 nr
+辜胜阻 257 nr
+辜负 360 v
+辜负希望 3 nr
+辜鸿铭 216 nr
+辞 1742 v
+辞不获命 3 i
+辞不达义 3 l
+辞不达意 7 l
+辞不逮意 3 vn
+辞世 61 v
+辞严义正 3 i
+辞严意正 3 i
+辞严气正 3 i
+辞严谊正 3 n
+辞义 3 n
+辞之不能 3 v
+辞书 36 n
+辞令 37 v
+辞修 3 v
+辞典 133 n
+辞别 140 v
+辞去 552 v
+辞句 17 n
+辞呈 68 v
+辞多受少 3 l
+辞官 3 n
+辞富居贫 3 i
+辞尊居卑 3 n
+辞岁 6 n
+辞工 7 v
+辞巧理拙 3 i
+辞微旨远 3 n
+辞意 3 v
+辞掉 64 v
+辞旧岁 3 n
+辞旧迎新 25 l
+辞条 2 n
+辞格 3 n
+辞汇 3 n
+辞海 47 n
+辞源 12 n
+辞穷理屈 3 i
+辞章 6 n
+辞简义赅 3 i
+辞类 3 n
+辞职 1276 v
+辞职书 9 n
+辞职信 29 n
+辞职报告 3 n
+辞聘 3 v
+辞色 38 n
+辞藻 34 n
+辞行 76 v
+辞让 15 v
+辞讼 4 v
+辞谢 39 v
+辞赋 45 n
+辞退 112 v
+辞金蹈海 3 n
+辟 1637 v
+辟作 3 v
+辟划 3 v
+辟开 3 v
+辟谣 75 nr
+辟谷 21 nr
+辟邪 371 nr
+辣 1024 n
+辣丝丝 3 n
+辣乎乎 2 z
+辣味 807 n
+辣呼呼 3 z
+辣妹 13 n
+辣妹子 17 n
+辣子 72 n
+辣子肉丁 3 n
+辣子鸡 3 n
+辣子鸡丁 4 n
+辣得 3 n
+辣手 64 n
+辣手摧花 3 z
+辣根 3 n
+辣椒 417 n
+辣椒城 3 n
+辣椒干 3 n
+辣椒水 6 n
+辣椒油 13 n
+辣椒粉 4 n
+辣椒素 3 n
+辣椒红 3 n
+辣椒酱 264 n
+辣椒面 11 n
+辣油 3 n
+辣瓣儿酱 3 n
+辣白菜 3 n
+辣菜 3 n
+辣蒿蒿 3 nr
+辣辣的 7 z
+辣酥酥 3 z
+辣酱 22 n
+辣酱油 3 n
+辦 6 zg
+辧 11 zg
+辨 1633 v
+辨义 5 v
+辨伪 39 a
+辨出 3 v
+辨别 342 v
+辨别出来 3 v
+辨别力 5 v
+辨别方向 3 v
+辨别是非 3 v
+辨别真假 3 n
+辨士 3 n
+辨如悬河 3 n
+辨子 3 n
+辨才无碍 3 n
+辨日炎凉 3 n
+辨明 184 v
+辨明是非 3 v
+辨析 155 vn
+辨析题 3 n
+辨正 3 v
+辨清 3 v
+辨物居方 3 n
+辨率 9 v
+辨白 3 v
+辨色 3 v
+辨若悬河 3 vn
+辨认 399 v
+辨认出 3 v
+辨认出来 3 v
+辨论 3 v
+辨证 235 v
+辨证法 3 v
+辨证论治 52 v
+辨识 132 v
+辨音 3 v
+辩 1188 n
+辩口利舌 3 l
+辩口利辞 3 n
+辩士 7 n
+辩手 10 v
+辩才 12 n
+辩才无碍 2 i
+辩才无阂 3 n
+辩护 397 v
+辩护书 3 n
+辩护人 44 n
+辩护士 21 n
+辩护律师 50 n
+辩护权 3 n
+辩护者 3 n
+辩护词 3 n
+辩方 8 n
+辩明 42 v
+辩明是非 3 l
+辩术 3 n
+辩正 4 v
+辩白 50 v
+辩称 25 v
+辩解 271 v
+辩解者 3 n
+辩认 3 v
+辩论 474 n
+辩论会 12 l
+辩论网 3 n
+辩论赛 4 n
+辩证 339 v
+辩证关系 3 l
+辩证唯物 2 l
+辩证唯物主义 184 n
+辩证唯物论 6 n
+辩证法 364 n
+辩证统一 3 l
+辩证逻辑 57 l
+辩诉 3 v
+辩词 5 n
+辩诬 6 v
+辩说 3 v
+辩说属辞 3 l
+辩辞 3 v
+辩难 3 n
+辩驳 85 v
+辫 546 n
+辫儿 3 n
+辫子 419 n
+辫状河 3 n
+辬 2 zg
+辰 497 ng
+辰光 14 nz
+辰巳 6 nrt
+辰时 3 t
+辰星 5 nz
+辰河 6 ns
+辰溪 5 nrt
+辰溪县 3 ns
+辰牌 3 nz
+辰砂 32 n
+辰阳 5 ns
+辰龙 3 nz
+辱 693 ng
+辱命 3 v
+辱国 3 v
+辱国丧师 3 vn
+辱国丧权 3 vn
+辱国殃民 3 vn
+辱国殄民 3 vn
+辱没 70 v
+辱没门庭 3 v
+辱身败名 3 v
+辱门败户 3 v
+辱骂 161 v
+辱骂者 3 r
+辶 28 zg
+边 16283 d
+边上 524 s
+边下 3 s
+边个 3 b
+边五雄 2 nr
+边令诚 2 nr
+边以济 2 nr
+边传首 2 n
+边值问题 3 n
+边做边看 3 v
+边储充 2 nr
+边儿 54 n
+边全缘 3 n
+边关 62 n
+边兵 10 n
+边军 4 n
+边军帅 2 nr
+边前卫 2 nr
+边区 537 n
+边卡 3 n
+边厢 8 n
+边后卫 10 nr
+边吏 2 n
+边听边聊 3 v
+边啸边 2 nr
+边围 3 n
+边地 3 s
+边坝 3 n
+边坝县 3 n
+边坡 28 n
+边垂泪 3 n
+边城 33 n
+边塞 130 n
+边塞诗 20 nr
+边塞风光 3 nr
+边境 1738 n
+边境区 5 n
+边境县 6 nr
+边境地区 3 n
+边境税 3 n
+边境线 52 n
+边境证 3 nr
+边境贸易 3 n
+边墙 41 n
+边壁 3 s
+边外 3 s
+边大绶 5 nr
+边孤石 256 nr
+边学边 2 n
+边安慰 6 nr
+边宗王 3 nr
+边宣慰 2 nr
+边宣抚 2 nr
+边寇 2 n
+边寨 7 nr
+边寿民 3 nr
+边尖红 3 nr
+边尘不惊 3 nr
+边岸 3 s
+边州军 4 nr
+边州郡 2 nr
+边巴 2 n
+边帅 5 n
+边带 18 n
+边幅 3 n
+边幕 3 n
+边干边学 3 n
+边府 8 n
+边度 3 n
+边庭 15 n
+边廷 3 n
+边得胜 2 nr
+边微微 2 nr
+边微露 2 nr
+边心距 3 n
+边患 3 n
+边意存 2 n
+边房 3 n
+边撑 2 v
+边政 3 n
+边整边改 3 nr
+边料 3 n
+边旁 3 s
+边景昭 4 nr
+边材 10 n
+边框 19 n
+边框线 3 n
+边检 7 j
+边检站 5 n
+边款 10 n
+边民 36 n
+边水 3 n
+边沟 49 n
+边沿 356 s
+边海子 2 nr
+边海防 2 nr
+边灯 3 n
+边炉 3 n
+边玩 3 n
+边界 1815 n
+边界争端 3 n
+边界值 7 n
+边界元件 3 n
+边界地区 3 n
+边界对应 3 n
+边界层 3 n
+边界条件 3 n
+边界检测 3 nr
+边界点 3 n
+边界现状 3 n
+边界线 25 n
+边界表现 3 nr
+边界谈判 3 n
+边界问题 3 n
+边疆 476 s
+边疆区 17 n
+边疆地区 3 n
+边疆地带 3 n
+边疆民族 3 n
+边看边吃 3 v
+边看边听 3 nr
+边看边讲 3 v
+边看边说 3 v
+边笑边 5 nr
+边筑寨 2 n
+边篱 3 n
+边红杏 2 nr
+边纹 2 n
+边线 105 n
+边线发球 3 n
+边线球 19 n
+边经略 2 n
+边缘 1932 n
+边缘化 60 n
+边缘型 3 n
+边缘增强 3 nr
+边缘学科 3 n
+边缘性 12 n
+边缘效应 3 n
+边缘波动 3 n
+边缘海 3 nr
+边缘种植 3 v
+边缘科学 17 n
+边缘系统 3 n
+边缘运动 3 n
+边缘连接 3 nr
+边缘龈 3 n
+边罪 3 n
+边考研 3 n
+边臣 4 n
+边臣甚 2 nr
+边舞 3 n
+边荒 2 n
+边荒集 3 nr
+边行军 2 n
+边裁 15 n
+边覆盖 3 n
+边角 44 n
+边角余料 3 n
+边角废料 3 n
+边角料 15 n
+边诸军 2 nr
+边诸郡 2 nr
+边调鹤 2 nr
+边贸 15 n
+边走边叫 3 v
+边走边吃 3 n
+边走边想 3 n
+边走边看 3 v
+边走边谈 3 n
+边跟丽 2 nr
+边路 98 n
+边路传 8 nr
+边跳边唱 3 n
+边边 3 s
+边边角角 4 n
+边远 250 nr
+边远地区 3 s
+边连通度 3 n
+边郡汉 8 nr
+边郡领 2 nr
+边野 2 n
+边野古 3 nr
+边锋 8 n
+边锋线 3 n
+边镇 3 n
+边长 93 n
+边门 38 n
+边间 3 n
+边防 546 n
+边防军 122 n
+边防前哨 3 n
+边防前线 3 n
+边防哨 6 n
+边防哨所 3 n
+边防团 5 n
+边防战士 3 n
+边防支队 3 n
+边防站 4 n
+边防线 16 n
+边防要塞 3 n
+边防证 3 n
+边防连 3 n
+边防部队 3 n
+边际 301 n
+边际人 3 n
+边际效应 3 n
+边陲 390 s
+边隘 3 n
+边音 2 n
+边飞步 2 nr
+边飞边 3 nr
+边饰 4 n
+边鱼 3 n
+辽 3713 ns
+辽东 1105 ns
+辽东军区 4 nt
+辽东半岛 147 ns
+辽东湾 42 ns
+辽中 5 ns
+辽中县 5 ns
+辽代 87 t
+辽八厂 3 nt
+辽北 3 ns
+辽北省 3 ns
+辽南 61 ns
+辽原 3 ns
+辽大 14 ns
+辽太后 3 j
+辽太祖 33 nrt
+辽宁 1094 ns
+辽宁中医 3 j
+辽宁人 6 nrt
+辽宁人民艺术剧院 2 nt
+辽宁大学 6 nt
+辽宁大学工商管理学院 2 nt
+辽宁大连 3 ns
+辽宁抚顺 10 ns
+辽宁教育出版社 13 nt
+辽宁日报 3 nz
+辽宁沈阳 3 ns
+辽宁省 547 ns
+辽宁省委 2 nt
+辽宁省政府 2 nt
+辽宁街 3 ns
+辽宁队 368 nt
+辽小虎 3 nz
+辽沈 90 ns
+辽沈战役 97 nz
+辽沈战役纪念馆 2 ns
+辽河 281 ns
+辽河平原 3 ns
+辽河油田 6 ns
+辽河流域 30 ns
+辽海 3 ns
+辽源 13 ns
+辽源市 15 ns
+辽西 212 ns
+辽远 31 ns
+辽金 33 ns
+辽阔 382 a
+辽阳 188 ns
+辽阳县 8 ns
+辽阳市 23 ns
+辽鲁 3 ns
+达 28255 v
+达丽亚 10 nr
+达丽尔 2 nr
+达乌德 11 nrt
+达乘 3 nz
+达云贵 2 nr
+达亚 4 nrt
+达产 12 v
+达人 3 nrt
+达人知命 3 i
+达什 12 nrt
+达仁堂 3 nr
+达令 15 v
+达令河 24 nr
+达令港 3 nr
+达伊 5 nrt
+达伦 19 nrt
+达佛涅 2 nr
+达保土 17 nr
+达信 15 v
+达克 33 nrt
+达克宁 5 nr
+达克思 5 nr
+达克斯 3 nrt
+达克罗 3 nrt
+达克罗宁 3 nrt
+达兰 5 ns
+达内 2 nrt
+达列什 8 nrt
+达列夫 2 nrt
+达利 18 nrt
+达利亚 2 ns
+达利桑 2 nrt
+达到 15471 v
+达到抑制 2 l
+达到最佳 3 nr
+达到目标 3 l
+达到顶点 3 i
+达到高潮 3 nr
+达力达 3 nr
+达加 2 v
+达努彪 2 nr
+达勒 2 nrt
+达勒姆 10 nrt
+达南 36 ns
+达卡 66 nrt
+达卢佩 8 nr
+达卢普 4 nr
+达原饮 2 nr
+达县 15 ns
+达县市 3 ns
+达吉 2 nrt
+达吉亚娜 81 nrt
+达吉斯坦 2 nrt
+达吉雅 2 nr
+达吉雅娜 2 nrt
+达吾提 2 nr
+达喀尔 43 nr
+达地知根 3 ns
+达坂 28 nrt
+达坂城 15 ns
+达坂城区 3 ns
+达坂山 4 ns
+达埠 3 ns
+达基亚 16 ns
+达士通人 3 nr
+达声 5 v
+达夫 32 nrt
+达夫尼斯 2 nrt
+达奇 3 nrt
+达契亚 5 nrt
+达奴 2 nrt
+达姆 23 nrt
+达姆弹 12 nr
+达姆施 3 nr
+达姆达姆 3 nrt
+达子嫂 4 nr
+达孜 4 nrt
+达孜县 4 ns
+达安 7 nrt
+达官 26 nr
+达官显宦 3 nr
+达官显贵 17 nr
+达官知命 3 i
+达官要人 3 l
+达官贵人 76 nr
+达官贵要 3 l
+达富 4 nrt
+达尔 66 nrt
+达尔丘 2 nr
+达尔主义 3 nz
+达尔富尔 5 ns
+达尔巴 179 nrt
+达尔文 190 nr
+达尔文主义 32 nz
+达尔文港 5 ns
+达尔斯 4 nrt
+达尔曼 3 nrt
+达尔朗 4 nr
+达尔杜 8 nr
+达尔汉 2 nr
+达尔汗 5 nr
+达尔河 2 nr
+达尔泰 2 nr
+达尔礼 2 nr
+达尔维 2 nr
+达尔罕 5 nrt
+达尔罕茂明安联合旗 6 ns
+达尔贝 23 nrt
+达尔金 4 nrt
+达尚峰 4 nr
+达尼 3 nrt
+达尼丁 3 nrt
+达尼利 2 nrt
+达尼尔 36 nrt
+达川 2 nrt
+达川市 3 ns
+达州 29 ns
+达州市 11 ns
+达巴 9 nrt
+达布逊 2 nrt
+达布问题 3 n
+达幼发 2 nr
+达延汗 17 nr
+达式 35 n
+达式常 2 nr
+达弗林 2 nr
+达德 9 nrt
+达德利 3 nr
+达意 16 v
+达成 1850 v
+达成协议 3 nz
+达成谅解 3 l
+达扬 4 v
+达拉 51 nrt
+达拉斯 42 nrt
+达拉斯小牛队 7 nz
+达拉斯市 2 ns
+达拉然 3 nr
+达拉特 5 nrt
+达拉特旗 7 ns
+达拉西 2 nrt
+达摩 300 nrt
+达摩剑 2 nr
+达摩堂 14 nr
+达摩院 4 nr
+达文波特 3 nrt
+达文西 3 nr
+达斡尔 69 ns
+达斡尔族 40 nz
+达斯 18 nrt
+达斯坦 2 nrt
+达斯汀 3 nrt
+达日 3 nrt
+达日县 3 ns
+达旦 13 nr
+达明一派 3 nr
+达普鬼 5 nr
+达智桥 2 nr
+达曼 10 nrt
+达朗伯 9 nr
+达朗贝尔 8 nrt
+达木丁 2 nr
+达木尼 2 nr
+达木鼎 2 nr
+达权知变 3 i
+达权通变 3 i
+达来 6 v
+达来诺尔 11 nr
+达林 4 nrt
+达林顿 4 nr
+达果 6 n
+达标 251 v
+达标排放 9 l
+达标率 9 n
+达标者 3 n
+达格 6 nrt
+达格兰 2 nr
+达格利什 2 nrt
+达格斯 5 nr
+达格斯坦 3 nrt
+达梅尔 2 nr
+达比 10 nrt
+达永定 2 nr
+达江 3 ns
+达江乡 7 ns
+达沃 7 nrt
+达沃斯 11 nr
+达波尔 2 nrt
+达活泉 5 nr
+达浦生 2 nr
+达润 5 v
+达灵顿 2 nr
+达特 10 nrt
+达特茅斯 6 nrt
+达玛拉 72 nr
+达玛烷 3 nr
+达玛烷型 3 nz
+达理 2 v
+达瓦买提 10 nrt
+达瓦兰 2 nr
+达瓦孜 5 nrt
+达瓦齐 6 nr
+达生 3 v
+达科 19 nrt
+达科塔 3 nrt
+达科尔 2 nrt
+达穷 2 v
+达米亚 28 nrt
+达索 34 v
+达累斯萨拉姆 32 ns
+达纳 13 nrt
+达纳基 2 nr
+达纳基尔 2 nrt
+达维久 3 nr
+达维亚 22 nrt
+达维坚科 4 nr
+达维多维奇 4 nrt
+达维尔 2 nrt
+达维登 13 nrt
+达罕 9 nrt
+达罗 65 nrt
+达罗斯 17 nrt
+达美康 3 nr
+达美航空公司 2 nt
+达耶 5 nrt
+达致 4 v
+达芙妮 3 nrt
+达芬奇 30 nr
+达茂旗 5 nr
+达荷美 32 nr
+达菲 22 nrt
+达萨克 2 nrt
+达蒙 36 nrt
+达西 309 nrt
+达见 3 v
+达观 36 v
+达观山 3 nr
+达识 3 v
+达诺斯 2 nrt
+达赖 209 v
+达赖喇嘛 123 n
+达赫 2 nrt
+达赫尔 3 nr
+达赫拉 2 nrt
+达赫甘 6 nr
+达赫莱 2 nr
+达达 3 nrt
+达达主义 3 nz
+达达乐队 3 nz
+达达兰 2 nr
+达达尼 13 nr
+达达瑟 2 nrt
+达达画派 3 nr
+达迪耶 3 nrt
+达道 3 v
+达里 30 nrt
+达里奥 3 nrt
+达里诺尔 11 nrt
+达雷乔 2 nr
+达马托法 7 nrt
+达鲁 3 nrt
+达鲁花赤 76 nr
+达默尔 4 nrt
+迁 2901 v
+迁上 3 v
+迁上去 3 v
+迁上来 3 v
+迁下 3 v
+迁下去 3 v
+迁下来 3 v
+迁乔之望 3 ns
+迁乔出谷 3 v
+迁于乔木 3 vn
+迁入 258 v
+迁入地 2 n
+迁出 62 v
+迁出去 3 v
+迁出来 3 v
+迁到 3 v
+迁升 3 v
+迁厂 3 n
+迁去 3 v
+迁台 3 v
+迁善 3 v
+迁善去恶 3 n
+迁善塞违 3 v
+迁善改过 3 n
+迁善远罪 3 n
+迁善黜恶 3 vn
+迁回 80 v
+迁回去 3 n
+迁回来 3 ns
+迁地为良 3 ns
+迁址 8 n
+迁坟 3 v
+迁好 3 v
+迁妥 3 v
+迁安 12 ns
+迁安市 7 ns
+迁完 3 v
+迁客骚人 3 vn
+迁就 138 v
+迁就于 3 n
+迁居 304 v
+迁岛 3 ns
+迁岛夏实 3 n
+迁延 83 v
+迁延岁月 3 n
+迁延日月 3 n
+迁延时日 3 n
+迁延稽留 3 ns
+迁延羁留 3 vn
+迁延观望 3 n
+迁延顾望 3 n
+迁建 12 v
+迁开 3 v
+迁往 3 v
+迁得 3 v
+迁徙 446 v
+迁徙流离 3 v
+迁徙的鸟 3 nz
+迁徙耕作 3 nr
+迁怒 87 v
+迁怒于 3 n
+迁怒于人 3 n
+迁思回虑 3 n
+迁户 3 n
+迁来 3 v
+迁松之寿 3 n
+迁流 3 n
+迁离 9 v
+迁移 731 v
+迁移倾向 3 n
+迁移开销 3 n
+迁移性 3 n
+迁移扩散 3 n
+迁移率 3 n
+迁移费 3 n
+迁臣逐客 3 vn
+迁至 3 v
+迁莺出谷 3 n
+迁葬 15 v
+迁西 11 ns
+迁西县 7 ns
+迁调 3 v
+迁走 16 v
+迁过去 3 v
+迁过来 3 v
+迁进 3 v
+迁进去 3 v
+迁进来 3 v
+迁都 905 v
+迁风移俗 3 n
+迁飞 49 v
+迂 82 v
+迂久 3 a
+迂儒 3 n
+迂回 257 v
+迂回前进 3 i
+迂回战术 3 i
+迂回曲折 49 i
+迂回线路 3 i
+迂回行为 3 i
+迂回通过 3 i
+迂回问题 3 i
+迂夫子 3 i
+迂徊 3 v
+迂徊战术 3 nr
+迂徊渐进 3 nr
+迂执 3 v
+迂拙 3 a
+迂曲 6 v
+迂曲度 3 i
+迂直 3 v
+迂缓 5 v
+迂腐 80 v
+迂腐之见 3 i
+迂见 3 v
+迂论 3 v
+迂谈阔论 3 i
+迂路 3 v
+迂阔 13 a
+迂阔之论 3 i
+迂陋 3 a
+迄 255 l
+迄今 671 d
+迄今为止 311 l
+迄今已 3 l
+迄今已有 3 l
+迄无 3 d
+迄无回音 3 l
+迄无音讯 3 l
+迄未 3 d
+迄未成功 3 l
+迄未见效 3 l
+迄止 3 l
+迄至 3 d
+迅 185 zg
+迅即 112 d
+迅即出发 3 i
+迅即处理 3 i
+迅快如电 3 n
+迅急 6 a
+迅捷 385 a
+迅步 3 d
+迅流 3 a
+迅猛 450 ad
+迅猛发展 3 i
+迅猛地 3 i
+迅电流光 3 nz
+迅疾 59 z
+迅速 9323 ad
+迅速出击 3 i
+迅速开展 3 nz
+迅速行动 3 nz
+迅雷 18 n
+迅雷不及 3 i
+迅雷不及掩耳 41 i
+迅雷不及掩耳之势 24 i
+迅雷风烈 3 i
+迅风 3 nz
+迅风暴雨 3 i
+迅驰 3 nz
+迆 3 zg
+迆逦 3 z
+过 97817 ug
+过三拳 3 nr
+过上 201 t
+过不下去 3 l
+过不去 308 t
+过不来 3 t
+过与不及 3 i
+过世 135 t
+过东林 2 nr
+过丹根 2 nz
+过为 3 v
+过为已甚 3 i
+过丽鹃 6 nr
+过乾清 2 nr
+过于 1775 v
+过于自信 3 i
+过云雨 3 nr
+过五关 3 t
+过五关斩 3 nz
+过五关斩六将 11 i
+过亚丁 2 nr
+过些 3 t
+过些天 3 t
+过些日子 3 t
+过些时日 3 t
+过产 3 n
+过亮 3 v
+过人 439 n
+过人之处 3 l
+过仁侠 2 nr
+过从甚密 23 i
+过付 3 v
+过仙霞 2 nr
+过份 62 n
+过份眩耀 3 i
+过会儿 3 n
+过会子 4 n
+过会芳 2 nr
+过位 3 n
+过依言 8 nr
+过儿 582 t
+过儿成 2 nr
+过儿真 2 nr
+过克捷 2 nr
+过入 3 v
+过共析钢 3 n
+过关 296 v
+过关斩将 15 l
+过兵科 3 nr
+过内丹 2 nr
+过冬 72 t
+过冬作物 3 l
+过冷 32 a
+过冷蒸气 3 n
+过凉 3 t
+过出 3 v
+过分 1430 n
+过分劳累 3 l
+过分小心 3 l
+过分延伸 3 nr
+过分拥挤 3 v
+过分瘦长 3 i
+过切 3 ad
+过到 3 v
+过剑尖 2 nr
+过剑锋 2 nr
+过剩 607 v
+过剩人口 3 i
+过劲 3 a
+过劳死 3 l
+过化存神 3 n
+过午 3 t
+过午不食 3 l
+过半 140 t
+过半数 3 n
+过厅 4 n
+过去 17444 t
+过去分词 3 i
+过后 611 t
+过后燕 2 nr
+过君亭 3 nr
+过喀尔 5 nr
+过嘉平 2 nr
+过嘉轩 4 nr
+过圆 3 n
+过圳 3 ns
+过场 20 n
+过场戏 3 n
+过坊 3 n
+过埠 3 n
+过堂 24 n
+过堂风 4 nr
+过塑机 3 n
+过境 682 n
+过境旅客 3 n
+过境税 5 n
+过境签证 3 n
+过境费 2 n
+过夏 3 t
+过夜 202 t
+过夜费 3 n
+过大年 3 t
+过天 3 t
+过天星 6 nr
+过失 236 v
+过失伤害 3 i
+过失杀人 3 l
+过失犯罪 3 i
+过失罪 3 v
+过头 168 n
+过头话 5 l
+过奖 50 nz
+过孔 3 n
+过季 3 t
+过宁府 2 nr
+过宁远 2 nr
+过完 3 v
+过客 56 n
+过家家 17 n
+过密 10 n
+过小僧 2 nr
+过小宝 2 nr
+过小年 3 nr
+过小红 2 nr
+过少安 3 nr
+过屠大嚼 3 i
+过山炮 3 n
+过山车 27 n
+过山龙 3 nz
+过岗龙 3 nr
+过市招摇 3 v
+过师伯 4 nr
+过干瘾 3 n
+过年 1142 t
+过年节 10 t
+过府冲州 3 nr
+过度 1152 n
+过度生长 3 n
+过庭之训 3 nr
+过延津 5 nr
+过张乏弛 3 i
+过弯 3 v
+过强 3 v
+过录 3 v
+过彦之 35 nr
+过往 513 t
+过往人 3 i
+过往即逝 3 i
+过往甚密 3 i
+过往船只 3 i
+过往行人 3 i
+过得去 82 v
+过得来 3 d
+过得硬 18 a
+过心 3 n
+过恒山 6 nr
+过惯 3 n
+过意 3 v
+过意不去 198 l
+过慈恩 2 nr
+过慢 3 d
+过户 176 n
+过户费 3 n
+过房 3 n
+过所 3 n
+过手 89 n
+过把瘾 8 n
+过招 261 n
+过拜伦 2 nr
+过挤 3 v
+过挺剑 4 nr
+过掌力 2 n
+过敏 521 nr
+过敏原 18 n
+过敏反应 3 l
+过敏史 3 n
+过敏性 151 n
+过敏毒素 3 n
+过敏源 3 n
+过敏症 22 n
+过敏者 3 n
+过数 23 n
+过文泰 3 nr
+过旋 3 n
+过日子 351 n
+过早 897 t
+过早地 3 l
+过早搏动 3 l
+过时 340 t
+过时不候 3 l
+过时黄花 3 n
+过旺 3 nr
+过明叔 3 nr
+过是其伺 3 v
+过晚 3 t
+过望 3 v
+过期 186 t
+过期不候 3 l
+过期作废 3 i
+过期数据 3 n
+过期无效 3 l
+过期未付 3 n
+过期杂志 3 n
+过杆 3 n
+过来 10268 t
+过来人 56 n
+过柔 3 a
+过桥 115 n
+过桥抽板 4 i
+过桥拆桥 3 nz
+过桥米线 14 nz
+过桥费 3 n
+过梁 11 n
+过楚雁 2 nr
+过武举 2 nr
+过武英 3 nr
+过死 3 v
+过段时间 3 n
+过气 3 n
+过气去 3 l
+过氧 15 n
+过氧乙酸 10 nz
+过氧化 15 n
+过氧化氢 58 n
+过氧化物 62 n
+过氧化苯甲酰 76 nz
+过氧化钙 24 nz
+过氧化钠 12 nz
+过氧化钡 3 nz
+过氧酸 3 n
+过水 3 n
+过水溪 2 nr
+过水面 6 n
+过永寿 2 nr
+过永平 3 nr
+过江之鲫 8 i
+过江青 17 nr
+过江龙 3 nr
+过沅江 7 nr
+过河 249 n
+过河卒子 9 nr
+过河拆桥 27 nz
+过油 3 n
+过洁世 3 nr
+过洋 3 n
+过洋操 2 nr
+过洋而来 3 l
+过活 123 vn
+过浓 3 nz
+过海萍 2 nr
+过渡 3036 v
+过渡内阁 3 n
+过渡型 25 n
+过渡带 26 n
+过渡形式 3 n
+过渡态 3 n
+过渡性 114 n
+过渡政府 3 n
+过渡时期 3 n
+过渡期 34 n
+过渡流 3 n
+过渡阶段 3 n
+过溪亭 2 nr
+过滤 408 v
+过滤出来 3 n
+过滤嘴 29 nz
+过滤器 57 n
+过滤器材 3 n
+过滤布 3 n
+过滤性 3 n
+过滤机 25 n
+过滤法 3 n
+过滤纸 3 nz
+过滤网 4 nz
+过滤芯 3 n
+过激 85 v
+过激份子 3 n
+过激派 3 n
+过火 56 n
+过灵隐 2 nr
+过热 148 v
+过热器 3 n
+过热液体 3 n
+过犹不及 30 l
+过玉娘 2 nr
+过玉宾 5 nr
+过玉蜂 4 nr
+过瑶琴 2 nr
+过甚其词 3 i
+过甚其辞 3 i
+过生日 3 t
+过电 27 n
+过电压 91 n
+过痒 3 v
+过瘾 142 n
+过盛 3 nz
+过盛必哀 3 nr
+过盛必衰 3 l
+过目 207 n
+过目不忘 25 i
+过目成诵 4 i
+过目难忘 2 i
+过眼 34 n
+过眼云烟 16 i
+过眼即忘 3 i
+过眼烟云 14 l
+过砥柱 2 nr
+过硫 3 n
+过硫酸氨 3 n
+过硬 328 a
+过硬本领 3 n
+过磅 4 n
+过磅员 3 i
+过磅处 3 i
+过磷酸 2 n
+过磷酸钙 21 nz
+过礼 3 n
+过神儿 2 n
+过福堂 3 nr
+过秤 9 n
+过秦论 3 nz
+过程 18051 n
+过程中将 3 n
+过程同步 3 n
+过程线 3 n
+过窄 3 a
+过站 3 n
+过站不停 3 n
+过竹棒 4 n
+过竿 3 n
+过筛 9 n
+过筛子 2 nr
+过素诚 2 nr
+过紧 3 d
+过紫衫 2 nr
+过紫金 2 n
+过线 3 n
+过细 26 ad
+过给 3 v
+过继 45 d
+过继免疫 3 n
+过继转移 3 i
+过而不入 3 l
+过而能改 3 l
+过肩而掷 3 i
+过脆 3 d
+过膝 3 v
+过节 252 t
+过节儿 3 n
+过节费 8 n
+过荣府 3 nr
+过荣禄 2 nr
+过荥阳 2 nr
+过虑 48 v
+过街 3 n
+过街天桥 7 nz
+过街柳 3 nr
+过街桥 3 nz
+过街楼 4 n
+过街老鼠 17 l
+过誉 3 n
+过访 3 v
+过话 3 n
+过谦 3 nr
+过责 3 v
+过账 3 v
+过费 3 n
+过起 3 v
+过路 54 n
+过路人 32 n
+过路客 2 n
+过路财神 3 l
+过路费 3 n
+过路车 3 n
+过载 57 v
+过过 3 v
+过过瘾 3 l
+过透 3 v
+过速 45 d
+过逾 3 nr
+过道 141 v
+过都历块 3 n
+过酸酯 3 nz
+过重 199 v
+过量 336 n
+过金军 2 n
+过金波 3 nr
+过铁剑 6 nr
+过锋锐 3 nr
+过错 258 v
+过错方 3 n
+过错责任 3 l
+过锰酸钾 3 n
+过长 227 n
+过长剑 23 nr
+过门 118 n
+过门不入 3 l
+过门儿 3 n
+过问 206 v
+过闷 3 v
+过阻尼 3 n
+过阿宝 2 nr
+过隙白驹 3 i
+过雪妍 3 nr
+过雪梅 2 nr
+过青红 2 nr
+过顶球 8 n
+过饱 3 n
+过饱和 3 nz
+过驳 4 v
+过高估计 3 l
+过龙兵 2 nr
+迈 926 v
+迈克 57 nrt
+迈克尔 101 nrt
+迈入 48 v
+迈凯伦 3 nrt
+迈出 435 v
+迈动 3 v
+迈勒 3 nrt
+迈古 3 ns
+迈向 172 v
+迈尔 48 nrt
+迈尔斯 11 nrt
+迈巴赫 3 nrt
+迈开 127 v
+迈往 3 v
+迈德 4 nrt
+迈拉 2 nrt
+迈拓 3 v
+迈斯特 2 nrt
+迈斯纳 9 nrt
+迈方步 3 nz
+迈森 2 nrt
+迈步 165 v
+迈步前进 3 nz
+迈特 6 nrt
+迈着 3 v
+迈耶 27 nrt
+迈耶函数 3 v
+迈赫迪 3 nrt
+迈达尼 4 nrt
+迈达斯 3 nrt
+迈过 3 v
+迈过去 3 v
+迈进 651 v
+迈阿密 144 nrt
+迋 3 zg
+迍 10 zg
+迍邅 3 z
+迎 4509 v
+迎上 3 v
+迎上去 3 v
+迎上来 3 v
+迎亲 52 v
+迎亲送故 3 i
+迎候 84 v
+迎出 3 v
+迎击 117 v
+迎刃以解 3 i
+迎刃冰解 3 i
+迎刃立解 3 i
+迎刃而理 3 i
+迎刃而解 93 i
+迎合 225 v
+迎合人心 3 l
+迎向 3 v
+迎向前去 3 l
+迎国庆 3 nr
+迎头 102 v
+迎头敢上 3 l
+迎头棒喝 3 i
+迎头法 3 i
+迎头痛击 23 i
+迎头赶上 28 i
+迎头赶头 3 i
+迎奸卖俏 3 i
+迎娶 342 v
+迎客 68 nr
+迎客松 8 nr
+迎宾 438 nr
+迎宾曲 7 nr
+迎宾路 3 nr
+迎宾馆 10 nr
+迎意承旨 3 nr
+迎战 417 v
+迎接 2388 v
+迎接挑战 3 i
+迎敌 3 v
+迎新 14 v
+迎新会 3 nr
+迎新年 3 nr
+迎新弃旧 3 i
+迎新春 3 nr
+迎新晚会 3 j
+迎新生 3 nr
+迎新送故 3 i
+迎新送旧 2 i
+迎新面 3 nr
+迎春 216 nr
+迎春会 2 nr
+迎春曲 3 nr
+迎春节 3 nr
+迎春花 17 nr
+迎晓 128 v
+迎来 748 v
+迎来送往 25 i
+迎水 2 v
+迎江区 3 ns
+迎泽 8 nr
+迎泽区 3 nr
+迎神 3 v
+迎神大会 3 l
+迎神赛会 11 l
+迎考 3 v
+迎角 3 n
+迎起 3 v
+迎送 54 v
+迎门请盗 3 i
+迎难而上 19 l
+迎面 607 d
+迎面而来 66 l
+迎风 222 v
+迎风冒雪 3 i
+迎风待月 3 i
+迎风招展 10 i
+迎风而去 3 i
+迎风迎接 3 i
+迎香穴 4 i
+运 5366 n
+运七 6 ns
+运上 3 n
+运上去 3 v
+运上来 3 l
+运下 3 n
+运下去 3 l
+运下来 3 l
+运之掌上 3 l
+运乖时蹇 3 i
+运书车 3 n
+运价 45 n
+运体 3 n
+运作 1247 vn
+运作者 3 n
+运入 3 v
+运八 21 n
+运兵 3 n
+运兵船 3 n
+运兵车 6 n
+运出 51 v
+运出去 3 v
+运出来 3 vn
+运到 309 v
+运力 535 n
+运功 3 n
+运功散 3 v
+运动 18435 vn
+运动会 440 n
+运动健将 38 n
+运动前区 3 n
+运动包 3 n
+运动史 28 n
+运动后效 3 n
+运动后象 3 n
+运动员 1690 n
+运动器材 3 n
+运动场 105 n
+运动型 12 n
+运动套装 3 n
+运动学 48 n
+运动定律 3 n
+运动常量 3 n
+运动帽 3 n
+运动性 35 n
+运动情绪 3 n
+运动感 12 n
+运动成瘾 3 n
+运动战 133 n
+运动服 17 n
+运动服装 3 n
+运动版 3 n
+运动用品 3 n
+运动病 7 n
+运动知觉 3 n
+运动神经 25 n
+运动神经元 29 n
+运动竞赛 3 n
+运动竞速 3 n
+运动线法 3 n
+运动衣 4 n
+运动表 2 n
+运动表象 3 n
+运动衫 12 n
+运动衫裤 3 n
+运动袜 3 n
+运动装 10 n
+运动裤 3 n
+运动视差 3 n
+运动过度 3 l
+运动选手 3 n
+运动量 61 n
+运动队 34 n
+运动障碍 3 n
+运动鞋 31 n
+运势 3 n
+运十 50 n
+运十二 10 l
+运单 5 n
+运命 4 vn
+运回 126 v
+运回去 3 l
+运回来 3 l
+运土 18 n
+运城 70 n
+运城地区 4 ns
+运城市 11 ns
+运城战役 3 nz
+运开时泰 3 nz
+运往 266 vn
+运思 3 n
+运思精妙 3 i
+运抵 40 v
+运拙时乖 3 i
+运拙时艰 3 i
+运指如飞 3 l
+运掉自如 3 l
+运搬 3 v
+运数 8 n
+运斤如风 3 l
+运斤成风 3 l
+运斧般门 3 n
+运旺时盛 3 l
+运星 3 n
+运智铺谋 3 l
+运木船 2 n
+运杂费 2 n
+运来了 3 l
+运气 1059 n
+运河 1170 n
+运河区 37 n
+运河税 3 n
+运河镇 5 ns
+运流电流 3 n
+运渠 3 n
+运煤 15 n
+运煤船 3 n
+运煤车 8 n
+运猪 3 n
+运球 35 n
+运球过场 3 n
+运用 4112 vn
+运用之妙 2 i
+运用自如 10 l
+运用裕如 3 l
+运盐 3 n
+运祚 3 v
+运移 90 vn
+运移时易 3 l
+运移距离 3 n
+运程 5 n
+运笔 27 n
+运策决机 3 n
+运策帷幄 3 i
+运筹 76 v
+运筹借箸 3 n
+运筹决策 3 n
+运筹决算 3 n
+运筹决胜 3 l
+运筹出奇 3 i
+运筹制胜 3 n
+运筹千里 3 l
+运筹子里 3 n
+运筹学 72 n
+运筹帏幄 3 n
+运筹帷帐 3 n
+运筹帷幄 81 i
+运筹帷幄之中 3 n
+运筹建策 3 n
+运筹演谋 3 n
+运筹画策 3 n
+运筹设策 3 n
+运算 721 vn
+运算元 3 n
+运算器 59 n
+运算子 3 n
+运算法 3 n
+运算码 3 n
+运算符 9 n
+运算表 3 n
+运算量 3 n
+运管 11 vn
+运管处 3 n
+运管局 3 n
+运管所 3 n
+运粮 3 n
+运粮河 8 n
+运能 16 v
+运至 3 v
+运营 1039 vn
+运营业 2 n
+运营商 983 n
+运营官 3 n
+运营权 7 n
+运营者 4 n
+运营部 4 n
+运行 3393 v
+运行剖面 3 n
+运行图 33 n
+运行库 3 n
+运行日志 3 n
+运行机制 3 n
+运行状况 3 n
+运行部 3 n
+运计铺谋 3 n
+运货 34 n
+运货舱 3 n
+运货车 3 n
+运费 87 vn
+运费先付 3 n
+运费单 3 n
+运费已付 3 n
+运费率 6 n
+运费表 3 n
+运走 55 v
+运起 3 v
+运距 9 n
+运蹇时乖 3 v
+运蹇时低 3 z
+运转 689 vn
+运转不畅 3 i
+运转带 3 n
+运转时来 3 l
+运载 393 v
+运载工具 3 l
+运载火箭 266 l
+运载车 7 n
+运输 6308 vn
+运输业 126 n
+运输体制 3 n
+运输公会 3 n
+运输勤务 3 n
+运输区划 3 n
+运输商 3 n
+运输处 3 n
+运输局 4 n
+运输工 5 n
+运输工人 3 n
+运输工具 3 n
+运输成本 3 n
+运输户 2 n
+运输机 614 n
+运输枢纽 3 n
+运输段 3 n
+运输滑道 3 n
+运输系统 3 n
+运输线 307 n
+运输统计 3 n
+运输罐 3 n
+运输网 36 n
+运输网络 3 n
+运输联系 3 n
+运输能力 3 n
+运输舰 52 n
+运输船 53 n
+运输装置 3 n
+运输设备 3 n
+运输费 9 n
+运输车 80 n
+运输部 15 n
+运输部队 18 n
+运输量 324 n
+运输队 33 n
+运达 5 v
+运进 35 v
+运送 653 v
+运送交付 3 n
+运送者 3 n
+运送费 3 n
+运通 20 vn
+运通卡 3 n
+运道 3 n
+运量 119 n
+运钞 3 n
+运钞车 2 n
+运铁蛋白 3 l
+运销 120 vn
+运销业 3 n
+运销商 2 n
+运销网 3 n
+运飞 3 v
+近 17557 a
+近一半 3 t
+近一年来 3 t
+近万名 3 l
+近三年 3 t
+近三成 3 l
+近世 136 t
+近东 46 n
+近东国家 3 l
+近东地区 3 ns
+近两天 3 l
+近两年 3 l
+近两年来 3 l
+近中错位 3 l
+近中面 3 l
+近义词 6 n
+近乎 473 d
+近乎零 3 i
+近九成 3 l
+近于 197 v
+近于零 3 i
+近些 3 t
+近些年 208 t
+近些年来 3 t
+近交 11 v
+近交品系 3 l
+近交系 3 l
+近交系数 3 l
+近交远攻 3 i
+近亲 150 n
+近亲属 3 l
+近亲系数 3 l
+近亲繁殖 11 l
+近亲结婚 3 l
+近亲通婚 3 l
+近代 2572 t
+近代化 84 l
+近代史 336 n
+近代思想 3 i
+近代文学 3 l
+近似 759 a
+近似于 3 l
+近似值 42 l
+近似商 3 n
+近似律 3 l
+近似算法 3 n
+近似计算 3 l
+近体诗 33 l
+近作 10 v
+近侍 3 v
+近光灯 3 l
+近八年 3 t
+近况 200 n
+近几个月 3 l
+近几周来 3 l
+近几天 3 l
+近几天来 3 l
+近几年 3 l
+近几年来 3 l
+近几日 3 l
+近利 3 a
+近前 224 t
+近剖 3 v
+近十年 3 l
+近千人 3 l
+近千名 3 l
+近千家 3 l
+近半年 51 t
+近卫 35 v
+近卫军 68 n
+近古 3 t
+近古时代 3 t
+近四百 3 l
+近因 38 n
+近因律 3 l
+近在 3 t
+近在咫尺 242 i
+近在眉睫 3 i
+近在眼前 40 l
+近地 87 s
+近地点 19 l
+近场 2 n
+近场区 3 n
+近墨则黑 3 l
+近墨者黑 15 l
+近处 314 s
+近岁 3 t
+近岸 141 s
+近年 616 t
+近年以来 3 l
+近年来 3723 t
+近影 3 n
+近忧 17 v
+近悦远来 3 i
+近情 3 n
+近情理 3 l
+近战 75 nz
+近支 3 n
+近旁 21 s
+近日 2033 t
+近日以来 3 l
+近日来 43 l
+近日点 34 l
+近日里 3 l
+近景 15 n
+近月 15 t
+近月来 3 t
+近月点 3 t
+近期 1285 t
+近期内 3 t
+近期走势 3 l
+近朱者赤 13 i
+近来 1311 t
+近来可好 3 l
+近水惜水 3 l
+近水楼台 13 nz
+近水楼台先得月 15 i
+近洋 2 n
+近海 407 f
+近海渔业 3 j
+近海航运 3 nz
+近火先焦 3 i
+近照 8 n
+近现代 300 l
+近现代史 22 l
+近理 3 n
+近畿 23 nz
+近畿小子 3 ns
+近百 3 j
+近百人 3 l
+近百名 3 l
+近百家 3 l
+近百年来 3 l
+近程 199 n
+近程导弹 3 n
+近程目标 3 l
+近端着丝 3 l
+近红外 19 l
+近缘 24 n
+近臣 89 n
+近藤 57 n
+近观 16 a
+近视 130 v
+近视眼 49 l
+近视眼镜 3 l
+近视镜 11 n
+近距 94 n
+近距离 3 l
+近路 16 n
+近近 3 t
+近邻 101 v
+近郊 266 s
+近郊区 6 s
+近郊地区 3 s
+近闻 3 n
+迓 42 g
+返 1370 v
+返乡 49 v
+返产 3 v
+返京 3 v
+返任 3 v
+返俗 3 v
+返修 13 v
+返修率 5 n
+返修货 3 n
+返光镜 3 n
+返利 7 v
+返台 3 v
+返哺之恩 3 v
+返回 2528 v
+返回值 3 n
+返回地面 3 i
+返回式 8 n
+返回舱 11 n
+返国 70 v
+返复 3 v
+返完即止 3 i
+返家 14 v
+返岗 3 v
+返工 6 v
+返归 28 v
+返德 3 v
+返我初服 3 i
+返抵 14 v
+返映 3 v
+返本朝元 3 n
+返本求源 3 n
+返本还元 3 i
+返本还原 4 i
+返本还源 3 i
+返朴归真 6 i
+返朴还真 3 i
+返来复去 3 i
+返校 31 v
+返校日 3 n
+返汉 3 n
+返法 3 v
+返波管 3 n
+返流性 3 n
+返潮 3 v
+返照 7 v
+返照回光 3 i
+返璞归真 10 i
+返盐 3 v
+返祖 3 v
+返祖现象 11 n
+返租 3 v
+返程 87 n
+返程票 3 n
+返美 3 v
+返老归童 3 i
+返老还童 31 i
+返聘 5 v
+返航 94 v
+返英 3 n
+返虚入浑 3 n
+返观内照 3 n
+返观内视 3 n
+返视内照 3 n
+返贫 18 v
+返辔收帆 3 i
+返还 126 v
+返道 3 v
+返邪归正 3 i
+返销 7 v
+返销粮 4 n
+返防 3 v
+返青 24 v
+返青肥 3 n
+迕 23 g
+还 157058 d
+还为 3 c
+还乡 92 v
+还乡团 48 nz
+还乡昼锦 3 v
+还乡河 4 nz
+还于 3 c
+还人情 2 n
+还付 3 v
+还以 3 c
+还价 14 v
+还俗 82 v
+还债 51 v
+还值 3 v
+还元返本 3 l
+还养 3 v
+还击 223 v
+还原 836 v
+还原二聚 3 nz
+还原作用 3 l
+还原剂 66 n
+还原卡 3 nr
+还原反本 3 l
+还原型 2 n
+还原性 60 n
+还原成 3 v
+还原染料 3 n
+还原法 17 n
+还原炉 3 n
+还原点 3 n
+还原焰 3 n
+还原熔炼 3 nr
+还原硫 3 v
+还原精灵 3 nr
+还原论 14 v
+还原酶 3 n
+还原铁 3 n
+还吞 3 v
+还吵 3 v
+还嘴 16 v
+还够 3 v
+还够用 3 l
+还好 709 v
+还射 3 v
+还席 3 v
+还年却老 3 n
+还年卻老 3 vn
+还年驻色 3 z
+还得起 3 v
+还怕 3 c
+还愿 29 v
+还我河山 20 l
+还手 149 v
+还撕 3 nz
+还政于民 9 l
+还施彼身 44 nz
+还是 9922 c
+还有 18487 v
+还望 3 v
+还本付息 3 l
+还朴反古 3 l
+还款 126 v
+还款期 6 n
+还款法 3 n
+还款额 13 n
+还治其人之身 35 l
+还淳反古 3 z
+还淳反朴 3 z
+还淳反素 3 v
+还淳返朴 3 z
+还清 108 v
+还珠合浦 3 nz
+还珠格格 8 nz
+还珠返璧 3 n
+还用 3 v
+还用说 3 l
+还真好 3 l
+还着 3 c
+还礼 50 v
+还算 3 v
+还纳 2 v
+还织 3 v
+还给 269 v
+还行 3 v
+还行得通 3 v
+还要 6790 c
+还让出 3 n
+还让到 3 l
+还调 3 v
+还账 6 v
+还贷 81 v
+还跟到 3 v
+还跟在 3 v
+还跟着 3 v
+还载 3 v
+还过 3 c
+还过得去 3 v
+还都不 3 nz
+还醇返朴 3 n
+还阳 16 v
+还魂 31 v
+还魂丹 3 nr
+还魂草 8 n
+这 261791 r
+这一下 800 l
+这一关 3 l
+这一来 231 l
+这一阵子 3 l
+这三只 3 n
+这三名 3 l
+这三家 3 l
+这三条 3 mq
+这三类 3 l
+这三项 3 nz
+这下子 70 l
+这两台 3 l
+这两块 3 n
+这两点 3 l
+这两项 3 nz
+这两首 3 l
+这个 61310 r
+这么 18886 r
+这么一来 3 l
+这么久 3 r
+这么些 77 r
+这么回事 3 l
+这么晚 3 r
+这么样 35 r
+这么点儿 13 r
+这么着 165 r
+这事 3 r
+这五种 3 l
+这些 47400 r
+这些年来 3 t
+这人 3 r
+这他 3 r
+这件 4399 mq
+这份 1470 mq
+这份儿 12 mq
+这伙 228 r
+这会儿 1117 r
+这位 7656 rz
+这俩 3 r
+这儿 3784 r
+这几天来 3 l
+这几年来 3 l
+这厢 3 nz
+这双 3 r
+这周 3 r
+这四名 3 l
+这回 788 mq
+这场 3143 mq
+这块 1078 r
+这天 1453 r
+这季 3 mq
+这家 1031 r
+这就是说 263 l
+这局 3 r
+这山望着那山高 11 l
+这帧 3 n
+这帮 355 mq
+这幅 3 r
+这幢 3 n
+这年头 3 l
+这方 60 r
+这方面 1729 mq
+这时 11628 r
+这时候 1934 r
+这期 3 r
+这本 459 r
+这条 3 mq
+这栋 34 r
+这样 48926 r
+这样一来 518 l
+这样儿 44 l
+这样的话 362 l
+这根 156 mq
+这档戏 3 l
+这次 9832 r
+这款 3 r
+这歌 14 nz
+这步田地 3 l
+这段 3 r
+这段话 3 l
+这炷香 3 z
+这点 877 mq
+这点儿 57 r
+这番话 3 n
+这病 3 r
+这种 40923 r
+这笔 755 r
+这篮 3 nz
+这类 3 r
+这群人 3 l
+这股 3 r
+这般 3009 r
+这般光景 3 l
+这行 3 r
+这话 2680 r
+这趟路 3 vn
+这身 3 r
+这车 3 r
+这辆 123 mq
+这辈子 3 l
+这边 901 r
+这边儿 12 l
+这部 1127 r
+这部分 599 mq
+这里 29358 r
+这间 3 r
+这阵儿 20 r
+这阵子 3 l
+这面 3 mq
+这项 1499 r
+进 25668 v
+进一步 10588 d
+进一步提高 36 i
+进万家 3 n
+进不了 3 v
+进不去 3 v
+进不来 3 v
+进不起 3 v
+进些 3 d
+进产房 3 n
+进京 697 v
+进京城 3 n
+进京赴考 3 nr
+进人关 4 n
+进价 36 v
+进位 117 v
+进位制 3 n
+进修 436 v
+进修学校 3 n
+进修班 26 v
+进修生 3 v
+进修部 2 n
+进俯退俯 3 l
+进入 18436 v
+进入位点 3 n
+进入状态 3 n
+进入计算机 3 n
+进入门户 3 n
+进八强 3 i
+进关 152 vn
+进兵 441 v
+进军 1051 v
+进出 978 v
+进出口 966 vn
+进出口可 3 i
+进出口商 3 n
+进出口银行 9 nt
+进出口额 3 n
+进出境 8 vn
+进出港 26 n
+进击 129 v
+进刀 5 v
+进利除害 3 n
+进到 3 v
+进制 89 v
+进前 3 v
+进前一步 3 i
+进前一级 3 l
+进剿 3 v
+进化 1052 v
+进化史 21 n
+进化史观 3 n
+进化树 3 n
+进化版 3 n
+进化稳态 3 n
+进化论 207 n
+进化论者 3 n
+进化负荷 3 n
+进化趋异 3 n
+进化距离 3 n
+进化速率 3 n
+进化钟 3 n
+进占 84 v
+进厂 3 n
+进去 4929 v
+进发 495 v
+进取 367 v
+进取之心 3 i
+进取心 57 n
+进取精神 3 i
+进口 3404 vn
+进口产品 3 n
+进口关税 3 n
+进口品 8 n
+进口商 46 n
+进口商品 82 n
+进口国 40 n
+进口成本 3 n
+进口棉 4 n
+进口港 6 n
+进口税 33 n
+进口药 7 n
+进口设备 4 n
+进口货 11 n
+进口车 8 n
+进口软件 3 n
+进口轿车 3 n
+进口量 32 n
+进口额 23 n
+进可攻 3 v
+进可替不 3 l
+进可替否 3 nr
+进呈 54 v
+进善惩奸 3 i
+进善惩恶 3 i
+进善退恶 3 i
+进善黜恶 3 i
+进在 3 v
+进场 128 n
+进场费 3 v
+进城 1468 v
+进境 98 n
+进壤广地 3 i
+进士 2072 n
+进奉 3 v
+进学 3 n
+进完 3 v
+进宝 6 n
+进宫 794 v
+进寸退尺 3 i
+进尺 17 n
+进屋 392 v
+进展 2022 vn
+进展因素 3 n
+进山 227 v
+进帐 3 v
+进帐单 3 n
+进度 392 d
+进度条 3 n
+进度槽 3 n
+进度缓慢 3 n
+进度表 7 n
+进影院 3 n
+进得 3 v
+进德 5 n
+进德修业 3 n
+进德脩业 3 vn
+进思尽忠 3 nr
+进抵 3 v
+进拜 3 v
+进攻 7091 v
+进攻型 29 n
+进攻性 94 n
+进攻战 23 n
+进攻方 5 n
+进攻者 24 n
+进料 8 n
+进料加工 3 n
+进旅退旅 3 n
+进晚餐 3 n
+进有 3 v
+进本退末 3 i
+进村 79 n
+进来 6878 v
+进来者 3 c
+进栏 3 v
+进校 84 n
+进校园 3 n
+进款 15 v
+进步 5265 d
+进步事业 3 n
+进步人士 3 n
+进步党 87 n
+进步分子 3 n
+进步力量 3 n
+进步奖 46 n
+进步性 19 n
+进步程 3 n
+进气 55 v
+进气口 28 vn
+进气管 5 vn
+进气道 103 n
+进气门 3 n
+进水 155 v
+进水口 32 n
+进水塔 3 n
+进水管 3 n
+进水闸 17 n
+进汤 3 n
+进沸 3 v
+进洞 3 n
+进深 933 d
+进港 32 n
+进爵 3 v
+进犯 342 v
+进犯边境 3 n
+进献 36 v
+进球 1023 n
+进球彩 3 vn
+进球数 28 n
+进用 8 v
+进益 43 d
+进社区 3 n
+进禄加官 3 nr
+进种善群 3 n
+进移 3 v
+进移到 3 i
+进程 2589 n
+进程同步 3 n
+进站 35 n
+进级 3 vn
+进纸 3 v
+进纸器 3 n
+进纸盒 3 n
+进线 3 n
+进给 27 v
+进给量 3 n
+进网 7 v
+进网吧 3 n
+进考场 3 n
+进而 1372 c
+进而言之 5 c
+进膳 3 v
+进荣退辱 3 i
+进藏 58 v
+进行 54355 v
+进行性 77 n
+进行批评 3 n
+进行拍卖 3 v
+进行曲 375 n
+进行谈判 3 n
+进补 23 v
+进袭 66 v
+进见 51 v
+进言 64 v
+进谏 180 v
+进谒 3 v
+进谗害贤 3 i
+进贡 184 v
+进贤 16 v
+进贤任能 3 i
+进贤兴功 3 i
+进贤县 4 nr
+进贤屏恶 3 i
+进贤拔能 3 i
+进贤用能 3 v
+进贤达能 3 i
+进贤进能 3 v
+进贤退奸 3 i
+进贤退愚 3 i
+进贤黜奸 3 i
+进贤黜恶 3 i
+进账 17 v
+进账单 3 n
+进货 72 v
+进货价 4 n
+进货价格 3 n
+进货关 2 n
+进货单 3 n
+进货员 2 n
+进货让价 3 n
+进货运费 3 n
+进货退出 3 i
+进货退回 3 i
+进货量 2 n
+进路 13 v
+进身 3 v
+进身之阶 8 i
+进过 3 v
+进进 7 v
+进进出出 83 v
+进进退退 2 v
+进退 217 v
+进退两端 3 i
+进退两难 80 i
+进退中度 3 i
+进退中绳 3 n
+进退为难 3 i
+进退亡据 3 n
+进退出处 3 i
+进退双难 3 i
+进退可否 3 i
+进退可度 3 i
+进退唯谷 3 n
+进退失图 3 i
+进退失所 3 i
+进退失据 3 i
+进退失措 3 i
+进退失踞 3 i
+进退存亡 2 i
+进退守舍 3 i
+进退履绳 3 i
+进退应对 3 i
+进退应矩 3 i
+进退惟咎 3 i
+进退惟谷 3 i
+进退损益 3 n
+进退无依 3 i
+进退无所 3 i
+进退无据 3 i
+进退无措 3 i
+进退无路 13 i
+进退无途 3 i
+进退无门 3 i
+进退有常 3 i
+进退有度 9 i
+进退有节 3 i
+进退构造 3 vn
+进退消息 3 i
+进退消长 3 i
+进退狐疑 3 i
+进退狼狈 3 i
+进退维亟 3 nr
+进退维艰 3 i
+进退维谷 15 n
+进退自如 3 i
+进退荣辱 3 i
+进退裕如 3 i
+进退触篱 3 n
+进退触籓 3 nr
+进退跋疐 3 i
+进退路穷 3 i
+进退迍邅 3 vn
+进退首鼠 3 i
+进逼 199 v
+进道若踡 3 v
+进道若退 3 i
+进酒 3 v
+进针 3 n
+进销 3 v
+进销存 3 n
+进锐退速 3 v
+进门 872 v
+进门处 3 n
+进阶 3 n
+进阶篇 3 n
+进项 46 n
+进项税额 3 n
+进风口 3 n
+进食 232 v
+进餐 73 v
+进餐时间 3 n
+进香 64 v
+进香团 3 n
+进香客 3 n
+进驻 721 v
+远 13523 a
+远不如 3 v
+远不止 3 l
+远不间亲 3 l
+远东 525 ns
+远东区 3 ns
+远东国家 3 l
+远东国际军事法庭 37 nt
+远东图书 3 nr
+远东地区 38 ns
+远东局 39 nt
+远东工专 3 nt
+远中错位 3 l
+远中面 3 b
+远于 3 v
+远交 3 b
+远交近攻 20 i
+远亲 38 n
+远亲不如 3 i
+远亲不如近邻 7 i
+远亲近友 3 i
+远亲近戚 3 l
+远亲近邻 4 i
+远人无目 3 i
+远光灯 4 n
+远别 3 d
+远升 3 v
+远华 13 nz
+远华案 3 n
+远南 3 ns
+远去 406 t
+远古 294 ns
+远古文化 3 l
+远古时代 3 t
+远图 3 n
+远在他乡 3 l
+远在天边 18 i
+远地点 25 d
+远场区 3 n
+远垂不朽 3 i
+远处 1580 s
+远大 101 b
+远大于 3 nr
+远大前程 3 l
+远大抱负 3 i
+远大理想 3 n
+远大目标 3 l
+远大路 3 ns
+远天 7 t
+远嫁 29 v
+远嫁他乡 3 l
+远安 783 ns
+远安县 262 ns
+远客 29 n
+远客来访 3 i
+远射 93 v
+远山 111 ns
+远山芙蓉 3 nr
+远山近水 3 i
+远岸 3 s
+远年近岁 3 l
+远年近日 3 l
+远度 3 d
+远征 531 n
+远征军 158 nr
+远征队 3 n
+远征难 3 i
+远心点 3 n
+远志 29 n
+远怀近集 3 i
+远愁近虑 3 i
+远房 36 n
+远房亲戚 14 n
+远扬 66 v
+远投 31 v
+远播 3 v
+远效 3 b
+远方 378 s
+远方来 3 l
+远族 3 n
+远日点 4 n
+远景 170 n
+远景规划 3 b
+远月点 3 n
+远望 92 v
+远望号 2 n
+远期 108 b
+远未 3 d
+远水不救近火 2 i
+远水不解近渴 5 i
+远水救不 3 l
+远水救不了近火 2 i
+远水解 3 l
+远水解不了近渴 7 i
+远求骐骥 3 nr
+远洋 352 ns
+远洋渔业 11 nt
+远洋渔船 3 l
+远洋班轮 3 nz
+远洋航行 3 nt
+远洋船 15 n
+远洋货轮 3 nt
+远洋轮 22 n
+远洋轮船 3 n
+远洋运输 3 l
+远流 3 n
+远海 3 ns
+远涉 3 v
+远涉重洋 17 i
+远渡 3 v
+远渡重洋 11 n
+远游 33 n
+远源 10 n
+远溯 3 v
+远溯博索 3 nr
+远潮 4 n
+远点 3 n
+远略 3 n
+远略宏规 3 nr
+远眺 281 v
+远瞩 3 i
+远瞩高瞻 3 i
+远祖 165 n
+远离 824 v
+远程 989 n
+远程教学 3 nt
+远程教室 3 n
+远程教育 3 l
+远程桌面 3 n
+远程登陆 3 n
+远程目标 3 n
+远程管理 3 n
+远程结构 3 n
+远程网 3 n
+远程行军 3 n
+远端 3 n
+远竹 3 ns
+远红外 23 l
+远红外线 3 l
+远缘 21 n
+远缘嫁接 3 l
+远者 3 n
+远胜 3 v
+远自 3 d
+远至迩安 3 i
+远航 155 v
+远航船 3 n
+远虑 20 v
+远虑深谋 3 i
+远行 151 v
+远西村 3 ns
+远见 174 v
+远见卓识 94 i
+远视 26 v
+远视眼 6 n
+远视者 3 n
+远角 26 n
+远识 3 n
+远谋 4 n
+远谋深算 3 i
+远走 52 v
+远走他乡 18 l
+远走高飞 85 i
+远超过 3 ns
+远足 23 v
+远距 3 n
+远距离 293 n
+远路 34 n
+远近 344 t
+远近兼顾 3 i
+远近法 3 b
+远近皆知 3 i
+远近闻名 50 i
+远近驰名 3 i
+远远 3159 d
+远远不够 3 nr
+远远不如 3 i
+远远地 449 z
+远远望 3 nr
+远远望去 3 i
+远远近近 48 n
+远途 16 b
+远逝 3 v
+远遁 3 v
+远道 91 v
+远道而来 48 l
+远避 3 v
+远邻 5 v
+远郊 42 s
+远郊区 9 s
+远郊区县 9 n
+远销 684 v
+远门 35 d
+远限 3 n
+远隔 3 v
+远隔重洋 6 l
+远非 114 ns
+远颺 3 z
+远高于 3 nr
+违 480 vg
+违世乖俗 3 i
+违世异俗 3 i
+违世绝俗 3 i
+违乡负俗 3 i
+违令 34 v
+违例 41 n
+违信背约 3 i
+违利赴名 3 i
+违反 1512 v
+违反原则 3 n
+违反常理 3 l
+违反常规 3 l
+违反纪律 3 l
+违反经营 3 l
+违反者 4 n
+违反规定 3 l
+违反非 3 l
+违天害理 3 i
+违天悖人 3 v
+违天悖理 3 v
+违天逆理 3 i
+违实绝实 3 l
+违宪 71 vn
+违害就利 3 l
+违建 3 v
+违建户 3 l
+违强陵弱 3 n
+违心 59 v
+违心之伦 3 i
+违心之言 3 i
+违心之论 5 i
+违心论 3 i
+违忤 2 v
+违愿 3 v
+违抗 224 vn
+违抗上级 3 l
+违抗命令 3 n
+违拗 147 v
+违时绝俗 3 i
+违条犯法 3 l
+违条舞法 3 l
+违法 1214 vn
+违法不究 8 l
+违法乱纪 73 l
+违法必究 6 l
+违法性 6 l
+违法活动 3 l
+违法犯罪 3 l
+违法者 17 n
+违法自弊 3 i
+违法行为 3 l
+违法违纪 3 i
+违犯 114 v
+违犯者 3 n
+违理 3 vn
+违碍 6 v
+违礼 3 v
+违禁 83 v
+违禁品 14 n
+违禁机 2 l
+违禁物品 5 n
+违禁者 4 n
+违章 178 vn
+违章人 3 l
+违章处罚 3 i
+违章建筑 3 l
+违章操作 3 l
+违章率 2 l
+违章罚款 3 l
+违章者 2 n
+违章行为 3 l
+违章行车 3 l
+违约 196 v
+违约方 3 n
+违约责任 3 l
+违约金 105 n
+违纪 294 n
+违纪处分 3 l
+违纪者 5 n
+违纪行为 3 v
+违者 233 n
+违者必究 3 l
+违者罚款 3 l
+违背 887 v
+违背者 3 n
+违背良心 3 i
+违背规律 3 l
+违规 463 vn
+违规人 3 b
+违规操作 3 l
+违规者 5 n
+违规行为 3 l
+违警 3 vn
+违警罚法 3 l
+违警罪 3 v
+违警行为 3 v
+违误 3 vn
+违逆 15 v
+连 23315 nr
+连一星 2 nr
+连三并四 3 i
+连三接二 3 i
+连三接五 3 l
+连三接四 3 i
+连三跨五 3 t
+连上 3 d
+连上去 3 l
+连上善 2 nr
+连上来 3 l
+连下 3 d
+连不上 3 l
+连东洋 2 ns
+连丝微管 3 n
+连严阵 2 nr
+连个 3 b
+连中三元 10 nr
+连丰村 3 nr
+连串 22 n
+连串反应 3 l
+连为一体 3 l
+连义 6 n
+连之战 4 l
+连乔峰 2 nr
+连乘 3 nr
+连乘积 3 nr
+连了 3 p
+连二并三 3 i
+连二赶三 3 i
+连于 3 p
+连云 8 nr
+连云列 2 nr
+连云区 3 ns
+连云山 2 nr
+连云樯 2 nr
+连云港 137 nr
+连云港市 45 ns
+连亘 3 v
+连些 3 d
+连人 3 n
+连代立 2 nr
+连任 334 v
+连伟健 3 nr
+连住 3 v
+连佐夫 2 nr
+连体 13 a
+连体婴 3 nr
+连体服 3 l
+连体衣 3 nr
+连作 28 vn
+连修园子 2 nr
+连傻子 3 nr
+连克二 2 nr
+连克嘉 2 nr
+连克康 2 nr
+连克灵 2 nr
+连克瓜 2 nr
+连克陶 2 nr
+连入 17 v
+连关 3 vn
+连关性 3 l
+连兵刃 5 nr
+连写 10 v
+连凤姐 2 nr
+连出 3 v
+连击 3 v
+连分数 3 l
+连刘抗曹 3 nr
+连到 3 v
+连刺 3 v
+连前儿 2 nr
+连剑法 2 nr
+连加 3 d
+连动 20 a
+连升 5 v
+连南 3 ns
+连南夫 3 nr
+连南瑶族自治县 2 ns
+连卡佛 3 nr
+连卸岭 2 nr
+连县 3 ns
+连发 178 v
+连变文 2 nr
+连台好戏 3 l
+连台本戏 6 n
+连史纸 3 n
+连号 3 n
+连吃 3 a
+连合 21 v
+连合纤维 3 l
+连同 981 a
+连名 3 a
+连名带姓 3 n
+连呼上当 3 l
+连命儿 2 nr
+连唱 13 v
+连善一 4 nr
+连嘉草 2 nr
+连四明 2 nr
+连回 3 v
+连在 3 d
+连在一起 3 l
+连地仙 2 nr
+连坐 73 v
+连坐法 3 l
+连城 107 ns
+连城之璧 3 i
+连城决 3 nr
+连城县 3 ns
+连城诀 21 n
+连塔娜 2 nr
+连塔尔 4 nr
+连墙接栋 3 i
+连声 782 d
+连声称好 3 l
+连夜 826 d
+连夜赶去 3 i
+连夜赶来 3 i
+连天 117 d
+连天匝地 3 z
+连天烽火 3 ns
+连太后 2 nr
+连太子爷 2 nr
+连太郎 2 nr
+连夺全 2 nr
+连套 3 a
+连字号 3 n
+连守 3 a
+连官家 2 l
+连定情 2 n
+连宝贝 2 nr
+连宝钗 3 nr
+连宵彻曙 3 nr
+连宵达旦 3 nr
+连封信 4 nr
+连射 3 v
+连小命 3 nr
+连小娃 2 nr
+连小孔 2 nr
+连小学 2 l
+连小狗 2 nr
+连小蛇 2 nr
+连小龙 2 nr
+连屁 3 v
+连山 32 ns
+连山区 3 ns
+连山壮族瑶族自治县 3 ns
+连山排海 3 ns
+连山湾 3 ns
+连屿 5 n
+连岛坝 3 nr
+连崇祯 3 nr
+连州 9 ns
+连州市 2 ns
+连州比县 3 ns
+连州跨郡 3 ns
+连师兄弟 2 nr
+连师父 8 nr
+连带 342 n
+连带保证 3 n
+连带关系 11 l
+连带处分 3 l
+连带而来 3 l
+连带责任 3 l
+连帮主 2 n
+连干 14 n
+连平 22 nr
+连平儿 3 nr
+连平县 2 ns
+连年 425 d
+连年不断 3 l
+连年丰收 3 l
+连年来 3 l
+连幺妹 2 nr
+连康熙 2 nr
+连影儿 5 nr
+连徐阶 2 nr
+连得 3 v
+连得杨 2 nr
+连德勒 3 nr
+连心 3 a
+连心桥 256 nr
+连志摩 2 nr
+连忙 2085 d
+连怀中 2 nr
+连想到 3 l
+连慈禧 3 nr
+连成 173 nrfg
+连成一气 6 l
+连成一片 357 l
+连成五 2 nrfg
+连成线 3 l
+连战 63 v
+连战皆北 3 l
+连战皆捷 6 l
+连战连 8 nr
+连战连捷 5 nz
+连手 13 d
+连打 3 p
+连打带踢 3 i
+连打带骂 3 l
+连承欢 2 nr
+连投 3 v
+连报 3 n
+连拨 3 v
+连拱坝 6 nr
+连指 3 n
+连指儿 5 nr
+连挥 3 v
+连捧 3 v
+连捷 2 a
+连排 3 v
+连接 2554 v
+连接不断 3 l
+连接件 10 n
+连接体 3 n
+连接功能 3 b
+连接区 3 n
+连接反应 3 l
+连接号 2 n
+连接器 13 l
+连接埠 3 n
+连接处 26 l
+连接子 3 nr
+连接学习 3 n
+连接性 3 n
+连接成 3 nr
+连接数 3 l
+连接时间 3 l
+连接池 3 nr
+连接点 8 n
+连接盒 3 n
+连接端 2 nr
+连接符 2 nr
+连接线 10 l
+连接结构 2 l
+连接蛋白 3 l
+连接词 3 n
+连接起来 3 l
+连接酶 3 l
+连播 5 vn
+连收 3 v
+连攻 3 v
+连放 3 v
+连敬 2 a
+连敬轩 5 nr
+连斩 3 v
+连斯基 12 nr
+连斯奇 15 nr
+连方证 2 nr
+连旗昌 2 nr
+连日 336 d
+连日带夜 3 l
+连日来 124 l
+连日继夜 3 nz
+连日连夜 17 l
+连早朝 2 nr
+连昌宫 4 nr
+连明叔 4 nr
+连明彻夜 3 nr
+连明达夜 3 l
+连明连夜 3 nr
+连昏接晨 3 nr
+连昏达曙 3 nr
+连昬接晨 3 nz
+连更彻夜 3 i
+连更星夜 3 i
+连更晓 2 nr
+连更晓夜 3 nr
+连曼桢 2 nr
+连有 3 v
+连望 3 v
+连朝宴 16 nr
+连朝廷 2 nr
+连本带利 3 l
+连杆 50 n
+连杆式 3 l
+连杆机构 3 l
+连李高 2 nr
+连来连去 3 l
+连杨诚 5 nr
+连杨过 8 nr
+连杭汉 2 nr
+连杵风 2 nr
+连枝共冢 3 nr
+连枝分叶 3 n
+连枝同气 3 i
+连枝带叶 3 n
+连枝并头 3 i
+连枝比翼 3 i
+连架 3 n
+连枷 3 n
+连柯夫 8 nr
+连栋全 2 nr
+连根儿 3 nr
+连根带梢 3 l
+连根拔 17 nr
+连根拔出 3 i
+连根拔起 15 l
+连桃 2 n
+连梅剑 2 nr
+连梅子 4 nr
+连横 3 a
+连橇 3 n
+连檐 3 n
+连欧阳锋 2 nr
+连正眼 5 nr
+连比 3 nr
+连江 15 ns
+连江县 2 ns
+连汤带水 3 nr
+连油星 2 n
+连治 3 v
+连济度 3 n
+连海子 2 nr
+连涨 3 v
+连混 3 a
+连港 3 ns
+连滚 3 z
+连滚带爬 39 i
+连潇湘 2 nr
+连激 2 v
+连爬带滚 4 l
+连片 49 n
+连猜 3 v
+连猪狗 5 nr
+连猫儿 2 nr
+连猫蛋 2 nr
+连王旗 3 nr
+连王爷 5 nr
+连环 267 vn
+连环体 3 l
+连环保 3 nr
+连环图画 3 l
+连环套 19 l
+连环撞 3 l
+连环泡 3 l
+连环画 81 l
+连环蛋白 3 l
+连环计 13 l
+连珠 154 nr
+连珠合璧 3 n
+连珠灯 3 nr
+连珠炮 40 nr
+连理 35 a
+连理之木 3 nr
+连理分枝 3 n
+连理枝 3 nr
+连琐 3 a
+连甍接栋 3 nr
+连生 40 v
+连用 37 v
+连番 17 d
+连畴接陇 3 nr
+连白帆 2 nr
+连皇后 2 nr
+连皇太后 2 nr
+连皇帝 146 nr
+连皮 3 a
+连皮带 3 n
+连皮带肉 3 l
+连皮带骨 3 l
+连盈盈 2 nr
+连着 24 p
+连瞎子 2 nr
+连石亨 2 nr
+连石湖 2 nr
+连破洪 2 nr
+连碰 3 v
+连祖宗 2 nr
+连祷 3 v
+连秀春 2 nr
+连种 3 n
+连科兰 2 nr
+连科夫 5 nr
+连空 3 n
+连穿 3 v
+连窝儿 2 nr
+连窝端 2 nr
+连站 3 n
+连章累牍 3 i
+连笑带 3 nr
+连笔 7 d
+连笔画 3 n
+连答 3 v
+连管 3 vn
+连篇 27 b
+连篇累册 3 l
+连篇累帙 3 n
+连篇累帧 3 n
+连篇累幅 3 n
+连篇累牍 37 i
+连篇絫幅 3 n
+连篇絫牍 3 n
+连类比事 3 l
+连类比物 3 l
+连系 3 n
+连系起来 3 l
+连紫文 4 nr
+连累 208 a
+连累到 3 l
+连红儿 2 nr
+连线 162 n
+连线作业 3 n
+连线表 3 n
+连细纹 2 nr
+连结 239 a
+连结环 3 nr
+连结线 3 l
+连结起来 3 l
+连结车 3 l
+连络 18 n
+连络官 3 nr
+连络机 3 n
+连络站 3 n
+连络运 2 nr
+连续 6317 a
+连续不断 112 l
+连续介质 3 n
+连续传代 3 n
+连续作战 3 l
+连续光谱 13 l
+连续函数 31 l
+连续剧 136 n
+连续区 3 n
+连续卡环 3 nz
+连续发酵 3 n
+连续变异 3 l
+连续变量 3 l
+连续型 10 n
+连续培养 3 l
+连续层析 3 l
+连续展开 3 l
+连续工艺 3 n
+连续式 21 n
+连续性 257 n
+连续感 3 n
+连续技 3 n
+连续梯度 3 n
+连续流 5 n
+连续灭菌 3 n
+连续犯 3 n
+连续相变 3 l
+连续表位 3 n
+连续谱 3 n
+连续飞行 3 n
+连绵 193 a
+连绵不断 99 l
+连绵不绝 36 l
+连绵起伏 3 l
+连缀 24 v
+连缀转录 3 vn
+连编累牍 3 n
+连网 14 n
+连署 4 v
+连翘 32 nr
+连翠芝 3 nr
+连翩 4 nr
+连老侯 2 nr
+连老大 2 nr
+连老天 3 nr
+连老子 3 nr
+连职 11 v
+连胖子 5 nr
+连胜 138 nr
+连胜文 3 nr
+连脚裤 3 n
+连腾 2 v
+连舆并席 3 l
+连舆接席 3 l
+连芬兰 3 nr
+连芬军 3 nr
+连芯锁 3 nr
+连花 3 n
+连花清 4 nr
+连若曦 2 nr
+连苯三酚 3 nz
+连茬 3 n
+连茶清 2 nr
+连茶蓬 2 nr
+连营 21 vn
+连萧峰 2 nr
+连蛋白 3 l
+连蜈蚣 3 nr
+连街倒巷 3 i
+连衡 3 a
+连衣 10 n
+连衣裙 61 nr
+连衫裙 2 nr
+连衽成帷 3 nr
+连袂 9 d
+连袂前去 3 i
+连袂前来 3 i
+连裆 7 n
+连裆裤 6 n
+连裤袜 3 n
+连襟 5 n
+连觉 7 d
+连记法 3 n
+连词 20 n
+连试 3 vn
+连诚诀 3 n
+连话都 3 n
+连读 3 v
+连败 82 v
+连贯 154 nr
+连贯性 27 nr
+连贯起来 3 l
+连赛 3 vn
+连赢 5 nr
+连起 3 v
+连跑带跳 3 l
+连踢 3 i
+连踢带打 3 n
+连蹦带跳 3 l
+连身 14 v
+连车平斗 3 n
+连轧 9 v
+连轴 7 n
+连轴转 13 l
+连载 97 v
+连载中 3 l
+连载小说 3 l
+连载报导 3 n
+连载故事 3 i
+连过 3 p
+连过儿 2 l
+连运 3 a
+连进 3 a
+连进士 3 nr
+连远 2 d
+连连 1418 d
+连连看 3 l
+连选连任 3 l
+连通 160 a
+连通分支 3 n
+连通器 4 l
+连通性 3 n
+连通数 3 l
+连通率 3 n
+连通环 3 nr
+连通管 3 n
+连遭 3 v
+连遭挫败 3 vn
+连遭败绩 3 v
+连部 44 n
+连郭靖 3 nr
+连采 3 v
+连里竟街 3 nr
+连金军 2 nr
+连金子 2 nr
+连金轮 4 n
+连钱草 3 nr
+连银铅 2 nr
+连铸机 2 l
+连铺 3 n
+连销 3 v
+连锁 466 vn
+连锁业 9 l
+连锁功能 3 b
+连锁化 3 l
+连锁反应 67 l
+连锁商店 3 n
+连锁店 127 n
+连锁式 2 l
+连锁性 3 nr
+连锅端 8 n
+连镳并轸 3 nr
+连镳并驾 3 nr
+连长 522 v
+连门儿 3 nr
+连闯 3 nr
+连闯王 3 nr
+连阔如 2 nr
+连队 390 n
+连阳 16 ns
+连阴天 2 nr
+连阴雨 27 nr
+连阶累任 3 l
+连阿朱 2 nr
+连降 11 v
+连除 3 v
+连随营 2 nr
+连集 3 a
+连青烟 2 nr
+连音 3 n
+连音符 3 nr
+连首辅 2 nr
+连香树 28 nr
+连香菱 2 nr
+连骨肉 3 n
+连鬓胡子 6 l
+连鳌跨鲸 3 nr
+连黄蓉 4 nr
+迟 1919 a
+迟于 3 d
+迟凤利 7 nr
+迟则生 4 nr
+迟到 337 v
+迟到席 3 i
+迟到早退 3 i
+迟到者 4 nr
+迟发性 6 nr
+迟回观望 3 i
+迟复 3 d
+迟太迟 2 nr
+迟尚义 2 nr
+迟尚国 3 nr
+迟尚斌 7 nr
+迟延 44 nr
+迟徊不决 3 v
+迟徊观望 3 nz
+迟志强 3 nr
+迟慢 3 d
+迟效性 2 n
+迟日旷久 3 i
+迟早 517 d
+迟早会 3 nr
+迟昭平 2 nr
+迟暮 47 nr
+迟暮之年 3 i
+迟来 3 d
+迟浩田 130 nr
+迟滞 85 a
+迟滞不前 3 i
+迟演 3 v
+迟玉洁 4 nr
+迟疑 862 d
+迟疑不决 17 i
+迟疑不前 3 i
+迟疑不定 4 i
+迟疑不断 3 i
+迟疑未决 3 i
+迟疑观望 3 i
+迟疑顾望 3 i
+迟百城 4 nr
+迟百诚 3 nr
+迟眉钝眼 3 v
+迟睡 3 v
+迟缓 262 d
+迟脉 13 nr
+迟误 81 v
+迟迟 415 d
+迟迟吾行 3 nr
+迟迟疑疑 66 z
+迟钝 250 a
+迠 2 zg
+迢 8 z
+迢远 3 z
+迢迢 35 z
+迢迢万里 3 nz
+迢迢千里 3 q
+迢遥 3 z
+迤 206 x
+迤逦 101 z
+迥 396 i
+迥不犹人 3 i
+迥乎不同 3 i
+迥别 3 d
+迥异 107 a
+迥然 12 d
+迥然不同 118 i
+迥然不群 3 i
+迥然回异 3 i
+迥然有别 3 i
+迥然有异 6 i
+迥然相异 10 i
+迥若 3 d
+迥若两人 3 i
+迥远 3 a
+迦 349 ns
+迦勒 6 nrt
+迦勒氏 3 nrt
+迦南 9 ns
+迦南人 19 nrt
+迦太基 548 nrt
+迦纳 3 ns
+迦西亚 3 ns
+迨 108 g
+迩 42 g
+迩安远至 3 i
+迩来 3 i
+迪 393 nr
+迪乌夫 2 nr
+迪乌斯 2 nr
+迪乔瓦 2 nr
+迪亚兹 3 nr
+迪亚塔 8 nr
+迪亚士 15 nr
+迪亚巴克尔 2 nrt
+迪亚戈 6 nr
+迪亚拉 5 nr
+迪亚斯 37 nr
+迪亚曼 2 nr
+迪亚纳 2 nr
+迪亚贝 3 nr
+迪亚霍 2 nr
+迪伊夫 3 nr
+迪伦 7 nr
+迪伦马特 5 ns
+迪信通 3 nr
+迪克 17 nr
+迪克斯 7 nr
+迪克桑斯 2 ns
+迪克森 9 nr
+迪克牛仔 3 nr
+迪兰 3 ns
+迪利厄斯 3 nrt
+迪利埃 2 ns
+迪功郎 7 nr
+迪努瓦尔 9 nr
+迪努瓦耶 2 nr
+迪勒拉 16 nr
+迪化 21 ns
+迪化街 3 ns
+迪南 59 ns
+迪厅 3 ns
+迪古 3 ns
+迪吉尔卡 2 ns
+迪吧 3 nr
+迪图瓦 2 nr
+迪址乃 6 nr
+迪塞尔 3 nr
+迪士尼 195 nr
+迪士高 3 nr
+迪多 6 ns
+迪奈尔 2 nr
+迪奥 122 nr
+迪奥拉 2 nr
+迪奥斯 2 nr
+迪奥普 9 nr
+迪奥狄 6 nr
+迪奥赛 2 nr
+迪安 15 ns
+迪富尔 5 nr
+迪尔凯姆 26 nr
+迪尔汗 2 nr
+迪尔维尔 2 nrt
+迪尼级数 3 nz
+迪帕克 4 nr
+迪庆 14 ns
+迪庆藏族自治州 13 ns
+迪弗尔 2 nr
+迪弗斯 11 nr
+迪德伍 10 nr
+迪德洛 3 nr
+迪戈加 6 nr
+迪戈加西亚岛 3 ns
+迪拉姆 3 nr
+迪拜 113 ns
+迪教团 2 nt
+迪斯可 3 nr
+迪斯尼 331 nr
+迪斯尼乐园 83 ns
+迪斯尼公司 29 nt
+迪斯特尔 2 nrt
+迪斯科 28 nr
+迪斯累 12 nr
+迪斯考 2 nr
+迪昂戈 3 nr
+迪朗斯河 2 ns
+迪梅泽格 2 nr
+迪比亚 3 ns
+迪比特 3 nr
+迪沃斯 2 nr
+迪波尔 2 nr
+迪泽尔 2 nr
+迪济耶 2 nr
+迪港 2 ns
+迪牙 2 ns
+迪特尔 2 nr
+迪玛凯 3 nr
+迪瓦 4 ns
+迪瓦尔 2 nr
+迪瓦茨 3 nrt
+迪科夫 2 nr
+迪米特里 5 nrt
+迪纳夫 2 nr
+迪纳拉 10 nr
+迪纳摩 3 nr
+迪维希语 4 nz
+迪耶普 2 nr
+迪茨 4 nrt
+迪西 2 ns
+迪西科 3 nr
+迪西莫 2 nr
+迪语 6 nz
+迪迪埃 2 nr
+迪迪尔 2 nr
+迪里拜尔 3 ns
+迪金森 3 nr
+迪马 6 ns
+迫 929 v
+迫不及待 303 i
+迫不可待 3 i
+迫不得己 3 i
+迫不得已 188 i
+迫不急待 3 i
+迫临 3 v
+迫于 326 v
+迫于形势 3 i
+迫令 3 n
+迫使 1393 v
+迫促 14 v
+迫击 6 v
+迫击炮 455 n
+迫击炮弹 3 n
+迫切 756 a
+迫切希望 3 vn
+迫切性 22 n
+迫切愿望 3 i
+迫切要求 3 i
+迫切需要 3 n
+迫在 3 v
+迫在眉睫 188 i
+迫害 701 v
+迫害致死 3 i
+迫近 160 v
+迫问 3 v
+迫降 74 v
+迭 463 d
+迭代 44 v
+迭代法 11 vn
+迭出 42 v
+迭创新高 14 l
+迭句 3 n
+迭宕 2 v
+迭嶂层峦 3 nr
+迭床架屋 3 n
+迭戈 2 nrt
+迭放 3 v
+迭有佳绩 3 l
+迭有发现 3 l
+迭有斩获 3 n
+迭次 3 n
+迭片结构 3 l
+迭矩重规 3 nr
+迭起 58 v
+迭连 3 v
+迭部 5 n
+迭部县 4 l
+迮 6 nr
+迯 104 zg
+述 1671 vg
+述作 3 v
+述及 3 v
+述古 19 v
+述宾 3 n
+述异记 3 v
+述心 3 v
+述怀 6 v
+述略 3 v
+述而不作 10 i
+述职 107 v
+述补 2 v
+述记 3 v
+述论 3 v
+述评 50 v
+述词 3 n
+述语 3 v
+述说 215 v
+迳 343 zg
+迳寄 3 vn
+迳庭 3 v
+迳直 3 z
+迳自 3 v
+迳行 3 vn
+迴 11 zg
+迷 1608 v
+迷上 3 v
+迷之小物 3 l
+迷乱 3 a
+迷了眼 3 l
+迷了路 3 l
+迷人 421 n
+迷人眼 3 l
+迷人眼目 3 l
+迷住 59 v
+迷你 51 b
+迷你品 3 l
+迷你型 8 b
+迷你游戏 3 l
+迷你版 3 b
+迷你王 3 l
+迷你裙 7 n
+迷你车 3 l
+迷信 689 v
+迷信活动 3 l
+迷倒 3 v
+迷到 3 v
+迷城 23 n
+迷天大罪 7 nz
+迷天大谎 3 i
+迷失 230 v
+迷失方向 3 i
+迷失消息 3 l
+迷头认影 3 l
+迷奸 3 v
+迷奸药 3 n
+迷宫 321 n
+迷宫般 3 i
+迷岸 3 n
+迷幻 21 a
+迷幻药 5 l
+迷彩 77 a
+迷彩服 103 l
+迷彩色 7 l
+迷思 3 v
+迷恋 436 v
+迷恋着 3 l
+迷恋骸骨 3 n
+迷悟 3 v
+迷惑 435 v
+迷惑不解 53 l
+迷惑性 8 n
+迷惑视听 3 i
+迷惘 186 a
+迷昏药 3 l
+迷朦 3 z
+迷来迷去 3 l
+迷梦 11 v
+迷楼 2 n
+迷死 3 v
+迷死人 3 n
+迷汤 3 n
+迷津 20 z
+迷涂知反 3 i
+迷漫 27 a
+迷濛 3 z
+迷狂 3 a
+迷瞪 5 z
+迷离 106 v
+迷离徜仿 3 v
+迷离徜恍 3 nr
+迷离恍惚 3 i
+迷离惝恍 3 nr
+迷离扑朔 3 i
+迷箱 3 n
+迷糊 240 a
+迷罔 3 i
+迷而不反 3 i
+迷而不返 3 l
+迷而知反 3 i
+迷而知返 3 l
+迷航 8 v
+迷花沾草 3 i
+迷茫 238 z
+迷药 3 n
+迷蒙 53 z
+迷蒙蒙 3 z
+迷藏 9 v
+迷误 59 v
+迷走 3 v
+迷走神经 37 l
+迷起 3 v
+迷起来 3 l
+迷路 155 n
+迷踪失路 3 l
+迷迭香 10 l
+迷迷 3 v
+迷迷忽忽 3 z
+迷迷濛濛 3 z
+迷迷瞪瞪 12 z
+迷迷糊糊 310 z
+迷迷茫茫 2 z
+迷迷荡荡 3 z
+迷迷蒙蒙 7 z
+迷途 50 b
+迷途失偶 3 i
+迷途知反 3 i
+迷途知返 15 l
+迷途羔羊 3 n
+迷醉 30 v
+迷金醉纸 3 n
+迷阵 4 v
+迷雾 192 n
+迷题 3 n
+迷香 9 n
+迷魂 48 n
+迷魂夺魄 3 i
+迷魂汤 16 i
+迷魂淫魄 3 i
+迷魂药 17 n
+迷魂计 3 i
+迷魂阵 29 i
+迷魂阵隙 3 i
+迸 404 zg
+迸出 3 v
+迸出去 3 v
+迸出来 3 v
+迸发 130 v
+迸发出 3 v
+迸射 20 v
+迸开 3 v
+迸泪 3 v
+迸流 3 v
+迸溅 8 v
+迸裂 92 v
+迹 580 n
+迹地 9 n
+迹线 3 n
+迹语言 3 n
+迹象 780 n
+迺 4 zg
+迻 2 zg
+迻译 3 vn
+追 5675 v
+追上 3 v
+追上去 3 v
+追上来 3 v
+追下 3 v
+追下去 3 v
+追下来 3 v
+追不上 3 v
+追云逐电 3 l
+追亡逐北 2 i
+追交 3 v
+追债 3 v
+追偿 17 v
+追光 4 v
+追光灯 3 n
+追入 3 v
+追兵 265 v
+追减 3 v
+追凶 3 v
+追击 515 v
+追击战 10 n
+追到 3 v
+追到手 3 l
+追剿 43 v
+追加 952 v
+追加素 3 n
+追加预算 3 l
+追南逐北 3 i
+追去 3 v
+追叙 4 v
+追叙法 3 n
+追名逐利 14 i
+追向 3 v
+追命 3 v
+追回 73 v
+追回去 3 l
+追回来 3 l
+追堵 3 v
+追奔逐北 3 i
+追女仔 3 n
+追女友 3 n
+追女孩 3 n
+追女生 3 n
+追寻 251 v
+追寻着 3 l
+追封 3 v
+追尾 12 v
+追征 3 v
+追忆 97 v
+追忆往事 3 i
+追忆篇 3 n
+追念 18 v
+追怀 3 v
+追思 47 v
+追思会 2 n
+追思弥撒 3 n
+追思礼拜 3 i
+追恋 3 v
+追悔 28 v
+追悔何及 3 i
+追悔莫及 29 i
+追悼 29 v
+追悼会 119 n
+追想 3 v
+追慕 3 v
+追截 2 v
+追打 3 v
+追捉 3 v
+追捕 157 v
+追捧 167 v
+追授 32 v
+追掉 3 v
+追撞 3 v
+追敌 3 v
+追施 8 v
+追昔抚今 3 i
+追星 13 n
+追星一族 3 nz
+追星族 13 n
+追朔 3 nz
+追本清源 3 l
+追本溯源 6 l
+追本穷源 2 n
+追杀 247 v
+追杀令 3 n
+追来 3 v
+追来追去 3 l
+追查 169 v
+追查责任 3 l
+追根 9 v
+追根寻底 3 i
+追根查源 3 l
+追根求底 3 i
+追根求源 2 i
+追根溯源 28 l
+追根究底 6 n
+追根究蒂 3 n
+追根穷源 3 i
+追根问底 3 l
+追欢买笑 3 i
+追欢作乐 3 i
+追欢取乐 3 i
+追款 3 v
+追歼 22 v
+追比 3 v
+追求 3065 v
+追求名利 3 i
+追求幸福 3 i
+追求理想 3 i
+追求真理 3 i
+追求者 36 n
+追求进步 3 l
+追涨 37 v
+追涨杀跌 3 l
+追源溯始 3 i
+追源溯流 3 i
+追溯 637 v
+追溯到 3 l
+追溯力 3 l
+追猎 6 v
+追究 902 v
+追究其 3 n
+追究制 6 n
+追究来 3 n
+追究责任 3 n
+追索 90 v
+追索权 4 n
+追纵 3 v
+追缉 19 v
+追缉令 3 n
+追缴 42 v
+追者如云 3 i
+追肥 18 v
+追补 3 v
+追认 58 v
+追讨 22 v
+追记 7 v
+追诉 46 v
+追诉时效 3 l
+追诉权 2 n
+追赃 51 v
+追赔 3 v
+追赠 46 v
+追赶 1138 v
+追赶而来 3 i
+追踪 379 v
+追踪实验 3 l
+追踪报道 3 i
+追踪曲线 3 nz
+追踪者 3 n
+追踪调查 3 l
+追身球 3 n
+追车 3 v
+追过 3 v
+追过去 3 v
+追过来 3 l
+追进 3 v
+追进去 3 v
+追进来 3 v
+追远 3 v
+追远慎终 3 i
+追述 165 v
+追逃 3 v
+追逐 525 v
+追逐名利 3 i
+追逐战 3 i
+追逐赛 3 n
+追逼 16 v
+追问 623 v
+追问到底 3 l
+追随 407 v
+追随着 3 l
+追随者 126 n
+追风 26 v
+追风掣电 3 l
+追风摄景 3 i
+追风蹑影 3 vn
+追风蹑景 3 vn
+追风逐影 3 i
+追风逐日 3 i
+追风逐电 5 l
+追魂夺命 16 i
+追魂夺魄 3 i
+追魂摄魄 3 i
+迾 23 zg
+退 7280 v
+退一万 3 i
+退一步 3 l
+退一步海 3 i
+退一步讲 3 l
+退一步说 3 l
+退上 3 v
+退下 3 v
+退下去 3 v
+退下来 3 l
+退为 3 v
+退书 3 v
+退亲 7 v
+退付 3 v
+退伍 121 v
+退伍令 3 n
+退伍兵 12 n
+退伍军人 74 n
+退伍费 3 n
+退休 1073 v
+退休军官 3 l
+退休工人 3 l
+退休干部 3 n
+退休年龄 3 n
+退休者 2 n
+退休职工 3 l
+退休证 2 v
+退休费 5 v
+退休金 108 n
+退伙 5 v
+退佃 3 v
+退位 295 v
+退保 37 v
+退信 3 v
+退党 25 n
+退入 3 v
+退关 3 v
+退兵 273 v
+退兵之计 3 i
+退养 3 v
+退冰 3 v
+退净 3 v
+退减 3 v
+退出 2313 v
+退出键 3 n
+退到 3 v
+退化 534 v
+退化蛋白 3 l
+退化雌蕊 3 n
+退却 513 v
+退却主义 3 n
+退去 251 v
+退可守 3 l
+退后 282 v
+退向 3 v
+退回 586 v
+退回去 3 l
+退回来 3 l
+退团 3 n
+退场 55 n
+退场式 3 l
+退坡 3 v
+退堂 7 v
+退堂鼓 11 i
+退如山移 3 i
+退婚 16 v
+退学 94 v
+退学生 4 n
+退守 161 v
+退居 119 v
+退居二线 20 l
+退居幕后 3 n
+退市 45 v
+退席 8 v
+退库 3 v
+退庭 4 v
+退开 3 v
+退役 607 v
+退役军人 3 l
+退役军官 3 l
+退役制度 3 l
+退役费 3 n
+退得 3 v
+退徙三舍 3 i
+退思补过 3 l
+退房 3 v
+退押 3 v
+退拒 3 v
+退换 15 v
+退换货 3 n
+退掉 17 v
+退敌 3 v
+退敌之计 3 l
+退料 3 v
+退旅进旅 3 nz
+退晕 3 v
+退有后言 3 l
+退朝 48 v
+退机 3 n
+退来 3 v
+退极化 3 l
+退查 3 v
+退格 3 v
+退格符 3 v
+退款 25 v
+退步 71 v
+退步抽身 3 i
+退水 3 v
+退水曲线 3 n
+退汇 3 v
+退汞效率 3 v
+退浆 2 v
+退潮 48 v
+退火 35 v
+退火炉 3 l
+退烧 28 v
+退烧药 3 n
+退热 24 v
+退热药 8 n
+退现 3 v
+退瓶 3 n
+退瓶费 3 n
+退磁 9 n
+退票 73 v
+退票费 15 n
+退离 9 v
+退租 3 v
+退税 68 v
+退税款 2 n
+退税率 6 n
+退稿 5 v
+退管 3 v
+退组 3 vn
+退给 3 v
+退缩 381 v
+退缩不前 3 l
+退缩撤回 3 z
+退而求其 3 n
+退而求其次 25 i
+退而结网 6 i
+退耕 6 v
+退耕还林 27 l
+退职 27 v
+退职费 3 n
+退职金 3 l
+退股 3 v
+退膛 3 v
+退色 151 v
+退藏于密 3 i
+退行 3 v
+退行性 3 n
+退补 3 v
+退订 29 v
+退让 271 v
+退让贤路 3 l
+退训 3 v
+退课 3 v
+退败 3 v
+退货 34 v
+退费 3 v
+退赃 7 v
+退赔 38 v
+退走 181 v
+退路 252 v
+退车 3 v
+退辅会 3 l
+退过 3 v
+退过去 3 l
+退过来 3 l
+退还 202 v
+退还失主 3 i
+退还给 3 i
+退远 3 v
+退选 3 v
+退避 106 v
+退避三舍 30 l
+退钱 3 v
+退除 3 v
+退除役 3 n
+退隐 54 v
+退食从容 3 l
+退食自公 3 l
+退魔录 3 v
+送 13539 v
+送上去 3 v
+送上来 3 v
+送上门 3 v
+送下 3 v
+送下去 3 v
+送与 113 v
+送丧 8 v
+送交 144 v
+送交到 3 v
+送交给 3 v
+送亲 32 v
+送人情 6 n
+送信 165 v
+送信人 3 n
+送信儿 2 l
+送修 3 v
+送入 277 v
+送养人 3 n
+送出 3 v
+送出去 3 v
+送出门 3 v
+送别 108 v
+送到 1885 v
+送医 3 v
+送医急救 3 i
+送去 3 v
+送去迎来 3 l
+送友人 3 l
+送君 3 v
+送呈 3 v
+送命 64 v
+送回 270 v
+送妆 3 v
+送子观音 5 n
+送存 3 v
+送存单 3 n
+送审 8 v
+送审版 3 n
+送审稿 9 n
+送客 48 v
+送客出门 3 l
+送岁 3 v
+送往 453 v
+送往事居 3 v
+送往劳来 3 l
+送往视居 3 i
+送往迎来 11 l
+送情 3 v
+送所 3 v
+送报 13 v
+送报人 3 n
+送报员 5 n
+送报生 3 n
+送报童 3 n
+送抱推襟 3 l
+送掉 3 v
+送故迎新 3 i
+送料 131 v
+送料机 3 l
+送旧 3 v
+送旧迎新 3 l
+送暖 4 v
+送暖偎寒 3 i
+送暖偷寒 3 i
+送机 3 v
+送来 1049 v
+送检 27 v
+送款 3 v
+送死 84 v
+送殡 29 v
+送气 14 v
+送气音 11 n
+送水工 2 n
+送洗 3 v
+送温暖 3 n
+送灶神 3 v
+送煤 3 v
+送电 10 v
+送眼流眉 3 l
+送礼 331 v
+送礼人 3 n
+送礼大方 3 i
+送礼物 3 l
+送礼者 4 n
+送祝福 3 n
+送神 3 v
+送秋波 3 v
+送稿 3 v
+送粪 3 v
+送粮 19 v
+送终 28 v
+送终追远 3 l
+送给 1679 v
+送美珍 3 i
+送股 3 v
+送至 3 v
+送花 3 v
+送药 3 v
+送菜 3 v
+送葬 84 v
+送葬者 3 n
+送葬队 3 n
+送行 261 v
+送行人 3 n
+送话 3 v
+送话器 11 l
+送货 36 v
+送货上门 15 l
+送货到 3 l
+送货去 3 l
+送货员 3 l
+送货来 3 l
+送走 285 v
+送起 3 v
+送输 3 vn
+送达 235 v
+送过来 3 l
+送还 104 v
+送还到 3 l
+送还给 3 i
+送进 3 v
+送进去 3 v
+送进来 3 v
+送送 3 v
+送送礼 3 n
+送递 3 v
+送错 3 v
+送风 9 v
+送风口 3 l
+送风机 3 l
+送餐费 3 n
+送饭 3 v
+送验 3 v
+适 766 v
+适中 465 v
+适之 3 v
+适于 941 v
+适于航行 3 n
+适于销售 3 l
+适从 3 v
+适以相成 3 i
+适任 3 v
+适俗随时 3 i
+适值 18 v
+适切 3 a
+适口 29 v
+适可而止 41 i
+适合 3795 v
+适合者 3 n
+适如其分 3 l
+适婚 3 v
+适婚年龄 3 n
+适婚者 3 n
+适宜 2206 a
+适宜区 2 l
+适宜性 3 l
+适居其反 3 i
+适应 5971 v
+适应力 24 n
+适应度 5 n
+适应性 607 n
+适应控制 20 n
+适应期 13 n
+适应环境 3 l
+适应症 67 n
+适应能力 3 n
+适应需要 3 l
+适度 417 a
+适度从紧 27 l
+适度性 2 n
+适当 5584 a
+适当其冲 3 i
+适当其时 3 i
+适得其反 125 i
+适心娱目 3 n
+适性任情 3 n
+适性忘虑 3 i
+适情任欲 3 i
+适情率意 3 l
+适意 18 v
+适才 1656 n
+适时 501 ad
+适时地 3 l
+适时应务 3 l
+适时性 2 b
+适有 3 v
+适材适所 3 n
+适生区 2 n
+适用 3142 v
+适用人群 3 n
+适用地区 3 n
+适用性 42 n
+适用房 3 n
+适用技术 3 n
+适用於 3 i
+适用法律 3 l
+适用者 3 n
+适用范围 3 n
+适者 3 n
+适者生存 51 l
+适航 3 v
+适航性 3 n
+适航证 9 n
+适足 3 a
+适逢 95 v
+适逢佳节 3 i
+适逢其会 4 i
+适逢其时 2 i
+适配 4 v
+适配卡 3 n
+适配器 26 n
+适配法 3 n
+适量 362 v
+适量标准 3 n
+适量水 3 v
+适销 6 v
+适销对路 39 n
+适龄 367 n
+适龄儿童 3 n
+适龄青年 3 n
+逃 4781 v
+逃上 3 v
+逃上去 3 v
+逃上来 3 v
+逃下 3 v
+逃下去 3 v
+逃下来 3 v
+逃不了 3 v
+逃不出 3 v
+逃不掉 3 v
+逃不过 3 v
+逃之夭夭 73 i
+逃亡 434 v
+逃亡者 31 n
+逃债 5 v
+逃光 3 v
+逃入 3 v
+逃兵 73 v
+逃出 539 v
+逃出去 3 v
+逃出来 3 v
+逃出虎口 3 i
+逃到 3 v
+逃匿 22 v
+逃去 3 v
+逃反 3 v
+逃命 434 v
+逃命要紧 3 n
+逃回 3 v
+逃奔 75 v
+逃奔自由 3 i
+逃妻 3 v
+逃婚 9 v
+逃学 34 v
+逃学者 3 n
+逃家 3 v
+逃席 3 v
+逃废 2 v
+逃开 3 v
+逃归 3 v
+逃役 3 v
+逃往 382 v
+逃得 3 v
+逃慌 3 v
+逃掉 3 v
+逃散 91 v
+逃杀 3 v
+逃来逃去 3 i
+逃汇 3 v
+逃漏 3 v
+逃漏税 3 v
+逃灾避难 3 i
+逃犯 55 v
+逃生 317 v
+逃生梯 3 n
+逃生门 3 v
+逃票 20 v
+逃禅 3 v
+逃离 276 v
+逃离现场 3 n
+逃税 73 v
+逃窜 192 v
+逃缴 3 v
+逃罪 3 v
+逃脱 485 v
+逃脱出 3 v
+逃脱责任 3 n
+逃腾 3 v
+逃荒 180 v
+逃课 67 v
+逃课学生 3 n
+逃走 1335 v
+逃起 3 v
+逃跑 941 v
+逃跑主义 17 n
+逃路 3 v
+逃过 3 v
+逃过一劫 3 i
+逃进 3 v
+逃进去 3 v
+逃进来 3 v
+逃逸 75 v
+逃逸塔 2 i
+逃逸案 3 i
+逃逸速度 3 i
+逃遁 88 v
+逃避 532 v
+逃避现实 3 i
+逃避者 3 n
+逃避责任 3 n
+逃难 254 v
+逃难所 3 i
+逄 20 nr
+逄先知 3 nr
+逅 20 x
+逆 1328 vg
+逆之者亡 3 i
+逆事 3 n
+逆产 3 n
+逆伦 3 n
+逆元 3 n
+逆光 21 n
+逆党 3 n
+逆函数 3 n
+逆势 12 vd
+逆势上涨 3 l
+逆势下跌 3 l
+逆压 3 n
+逆反 13 v
+逆反应 3 n
+逆反心理 38 i
+逆反性 3 n
+逆取顺守 3 i
+逆变 28 v
+逆变器 12 l
+逆变换 2 v
+逆变电源 3 l
+逆变迁 3 i
+逆向 84 n
+逆向传导 3 n
+逆向反应 3 l
+逆向抑制 3 n
+逆向法 3 n
+逆向行驶 3 n
+逆否命题 3 n
+逆命 3 n
+逆命题 3 n
+逆坂走丸 3 nr
+逆城市化 3 j
+逆境 109 n
+逆天则亡 3 i
+逆天暴物 3 i
+逆天犯顺 3 i
+逆天者亡 2 i
+逆天违众 3 i
+逆天违理 3 i
+逆子 20 n
+逆子贼臣 3 i
+逆定理 3 n
+逆差 128 n
+逆序 5 n
+逆恶魔城 3 i
+逆我者亡 7 i
+逆我者死 3 i
+逆戟鲸 3 n
+逆数 3 n
+逆料 29 n
+逆施 3 n
+逆施倒行 3 i
+逆旅 3 n
+逆时偏移 3 i
+逆时针 43 n
+逆映射 3 n
+逆来横受 3 i
+逆来顺受 49 i
+逆水 14 n
+逆水行舟 19 i
+逆水顺舟 3 i
+逆流 183 n
+逆流分配 3 l
+逆流地 3 n
+逆流层析 3 l
+逆流而上 3 i
+逆流而行 3 i
+逆流萃取 3 vn
+逆浪 3 n
+逆温 7 n
+逆温层 14 n
+逆溯 3 v
+逆火 3 n
+逆知 3 v
+逆程率 3 n
+逆网 3 n
+逆耳 9 n
+逆耳之言 5 i
+逆耳利行 3 n
+逆耳忠言 5 i
+逆耳良言 3 i
+逆臣 3 n
+逆臣贼子 3 i
+逆行 104 v
+逆行倒施 3 i
+逆行冲动 3 i
+逆行而进 3 i
+逆贼 178 n
+逆转 289 v
+逆转录 11 n
+逆转录子 3 n
+逆转录酶 3 n
+逆转每 3 d
+逆转而进 3 i
+逆运算 5 n
+逆进 3 v
+逆迹昭彰 3 i
+逆道 3 v
+逆道乱常 3 i
+逆阪走丸 3 nr
+逆风 46 n
+逆风恶浪 3 i
+逆风而上 3 i
+逆风而行 3 i
+选 7132 zg
+选上 3 v
+选上去 3 v
+选上来 3 v
+选中 232 v
+选为 3 v
+选举 15208 v
+选举事务 3 n
+选举人 114 n
+选举制 12 n
+选举地理 3 n
+选举委员 3 n
+选举权 682 n
+选举法 234 n
+选举票 3 n
+选举罢免 3 i
+选举署 3 n
+选举资格 3 n
+选人 190 n
+选任 601 v
+选优淘劣 3 l
+选修 114 v
+选修科 3 nz
+选修科目 3 n
+选修课 57 v
+选入 152 v
+选关 3 v
+选兵秣马 3 i
+选冶 3 v
+选准 3 v
+选出 2298 v
+选刊 10 v
+选务 3 n
+选务工作 3 n
+选务所 3 n
+选区 951 n
+选单 3 n
+选去 3 v
+选取 378 v
+选号 3 n
+选号器 3 n
+选号费 3 n
+选品 3 n
+选场 2 n
+选址 108 n
+选型 25 n
+选士厉兵 3 i
+选士学 3 n
+选好 3 v
+选妓征歌 3 nz
+选委 3 n
+选委会 2 n
+选字 3 n
+选季 3 n
+选学 11 n
+选定 610 v
+选对 3 v
+选录 52 v
+选得 3 v
+选态 3 n
+选情 3 n
+选成 3 v
+选战 11 v
+选手 2418 v
+选手村 3 n
+选拔 1831 v
+选拔会 3 n
+选拔干部 3 n
+选拔性 5 n
+选拔赛 56 n
+选拣 3 v
+选拨 6 v
+选择 11160 v
+选择函数 3 n
+选择响应 3 n
+选择器 2 n
+选择地 58 n
+选择定则 3 n
+选择对象 3 n
+选择差 3 n
+选择开关 3 n
+选择性 209 n
+选择扩散 3 n
+选择指数 3 n
+选择掺杂 3 z
+选择权 64 n
+选择氧化 3 n
+选择率 3 n
+选择符 3 n
+选择网络 7 n
+选择键 3 n
+选择面 7 n
+选择项 3 n
+选择题 207 n
+选排 3 v
+选摘 3 v
+选播 3 v
+选收 3 v
+选文 3 n
+选料 279 n
+选曲 13 v
+选本 34 n
+选机 3 n
+选材 72 n
+选校 3 n
+选样 9 n
+选样法 3 v
+选框 3 n
+选案 3 n
+选歌试舞 3 l
+选段 12 n
+选民 3169 n
+选民代表 3 n
+选民权 3 n
+选民证 4 n
+选派 309 n
+选派代表 3 n
+选点 7 n
+选煤 10 v
+选煤厂 2 n
+选片 3 n
+选牙色 3 n
+选牙色板 3 n
+选用 768 v
+选留 4 v
+选登 11 v
+选矿 82 n
+选矿厂 12 n
+选磨 3 v
+选票 800 n
+选秀 56 v
+选秀权 9 n
+选种 30 v
+选种室 3 n
+选科 3 n
+选稿 3 v
+选粒 3 n
+选粹 3 n
+选系 3 v
+选线 17 n
+选编 49 v
+选罢法 3 v
+选美 75 v
+选美大会 3 nz
+选美赛 3 nz
+选聘 23 v
+选育 86 v
+选自 3 v
+选舞征歌 3 n
+选色征歌 3 n
+选萃 3 v
+选装 11 v
+选言判断 3 n
+选言肢 3 n
+选评 3 v
+选词 3 n
+选译 3 v
+选读 41 v
+选读生 3 n
+选读科目 3 n
+选读课 3 n
+选课 11 v
+选调 21 v
+选调生 7 v
+选贤与能 3 i
+选贤举能 5 i
+选贤任能 12 i
+选购 250 v
+选购指南 3 nz
+选载 2 v
+选辑 31 n
+选过 3 v
+选送 68 v
+选配 44 v
+选错 3 v
+选集 516 v
+选项 631 n
+选项卡 3 n
+选题 116 n
+选风 3 v
+逊 442 vg
+逊于 54 v
+逊位 3 n
+逊克 10 nz
+逊克县 3 ns
+逊尼 3 nz
+逊尼派 157 nz
+逊志时敏 3 nz
+逊色 187 n
+逊谢 3 v
+逋 60 zg
+逋逃之臣 3 v
+逋逃之薮 3 n
+逍 556 a
+逍遥 336 a
+逍遥丸 3 n
+逍遥事外 3 i
+逍遥叹 3 i
+逍遥子 3 i
+逍遥客 3 i
+逍遥散 24 i
+逍遥法外 21 i
+逍遥津 3 i
+逍遥派 87 n
+逍遥游 3 i
+逍遥物外 3 i
+逍遥网 3 i
+逍遥自在 51 i
+逍遥自娱 3 n
+逍遥自得 3 i
+逍遥谷 3 i
+逍遥镇 3 ns
+逎 7 zg
+透 2743 v
+透一口气 3 l
+透上 3 v
+透上去 3 v
+透上来 3 v
+透下 3 v
+透下去 3 v
+透下来 3 l
+透不过 3 v
+透不过气 73 l
+透了心 3 l
+透亮 85 a
+透亮儿 3 z
+透亮性 3 n
+透信 3 v
+透光 58 v
+透光伐 3 n
+透光度 4 n
+透光性 5 n
+透光率 3 n
+透光镜 3 nz
+透入 3 v
+透出 281 v
+透出去 3 v
+透出来 3 v
+透切 3 a
+透剔 3 v
+透化 3 v
+透古通今 3 l
+透味 3 n
+透天 3 v
+透天凉 3 l
+透射 79 v
+透射比 3 n
+透射率 3 n
+透射电镜 3 nz
+透射系数 3 l
+透平 26 a
+透平机 14 n
+透底 4 v
+透彻 197 v
+透心 3 v
+透心凉 3 l
+透拐 3 v
+透支 149 v
+透明 1371 v
+透明人 12 n
+透明体 5 n
+透明化 26 n
+透明图 3 n
+透明度 263 n
+透明性 19 n
+透明板 3 n
+透明消失 3 n
+透明漆 2 z
+透明版 3 v
+透明皂 3 n
+透明纸 2 n
+透明胶 9 n
+透明膜 6 n
+透明装 3 n
+透明质 3 n
+透晰 3 a
+透析 184 v
+透析仪 3 n
+透析发酵 3 n
+透析器 7 n
+透析培养 3 n
+透析机 2 n
+透析法 3 n
+透析液 3 n
+透析物 3 n
+透析膜 3 n
+透析袋 3 n
+透气 121 n
+透气性 25 n
+透水 3 v
+透水性 18 n
+透汗 3 v
+透河井 3 n
+透湿 15 a
+透漏 21 v
+透漏出 3 v
+透漏过来 3 v
+透热 3 v
+透热性 3 n
+透热疗法 2 n
+透照 3 v
+透照仪 3 nz
+透疹 11 n
+透空 15 v
+透花纹 3 n
+透视 230 v
+透视力 3 n
+透视图 8 n
+透视学 20 n
+透视画 3 n
+透视画法 3 n
+透视装 3 n
+透视错觉 3 n
+透视镜 3 n
+透辉石 20 nz
+透辟 8 v
+透过 768 v
+透过去 3 l
+透过来 3 l
+透进 3 v
+透进去 3 v
+透进来 3 l
+透透 3 v
+透透气 3 n
+透透风 3 n
+透镜 255 n
+透镜光心 3 n
+透镜天线 3 n
+透镜状 3 n
+透闪石 19 n
+透雕 19 n
+透雨 13 v
+透露 2598 v
+透露消息 3 l
+透顶 118 n
+透题 3 n
+透风 71 v
+透骨 83 n
+透骨草 3 n
+透骨酸心 3 n
+逐 972 d
+逐一 378 d
+逐个 105 d
+逐个数 3 d
+逐件 3 d
+逐免先得 3 l
+逐出 296 v
+逐利 3 v
+逐利性 16 n
+逐厂 3 n
+逐句 15 d
+逐句逐字 3 i
+逐名趋势 3 l
+逐字 21 d
+逐字逐句 18 i
+逐宕失返 3 l
+逐客 11 v
+逐客令 15 n
+逐层 32 d
+逐年 778 d
+逐年逐月 3 i
+逐影吠声 3 i
+逐影寻声 3 i
+逐影随波 3 i
+逐户 22 d
+逐新趣异 3 i
+逐日 77 d
+逐日追风 3 l
+逐月 25 d
+逐月逐日 3 i
+逐期 3 d
+逐末弃本 3 l
+逐末忘本 3 l
+逐末舍本 3 l
+逐机应变 3 i
+逐村逐户 3 n
+逐条 55 d
+逐次 85 d
+逐步 4848 d
+逐步回归 3 l
+逐步完善 3 l
+逐步形成 3 l
+逐步推广 3 i
+逐步推进 3 l
+逐步提高 3 l
+逐步撤出 3 vn
+逐步求精 2 i
+逐波而去 3 i
+逐流忘返 3 i
+逐浪网 3 i
+逐浪随波 3 i
+逐渐 7853 d
+逐点 3 d
+逐物不还 3 l
+逐电追风 3 l
+逐笔 2 d
+逐级 131 d
+逐级分解 3 l
+逐臭 4 v
+逐臭之夫 3 i
+逐行 8 d
+逐行扫描 3 v
+逐词 3 d
+逐走 3 v
+逐退 3 v
+逐逐眈眈 3 i
+逐队 2 n
+逐队成群 3 l
+逐页 3 n
+逐项 63 d
+逐风追电 3 l
+逐鹿 28 n
+逐鹿中原 20 i
+逑 60 g
+递 2282 v
+递上 3 v
+递上去 3 v
+递上来 3 v
+递交 274 v
+递交国书 3 n
+递价 3 v
+递传 3 v
+递信 3 v
+递兴递废 3 n
+递减 278 v
+递减性 3 n
+递减率 3 n
+递减系列 3 n
+递减系数 3 n
+递出 3 v
+递出去 3 v
+递出来 3 v
+递加 3 v
+递升 21 v
+递变 3 v
+递向 3 v
+递呈 3 v
+递回 8 v
+递回去 3 l
+递回来 3 l
+递增 1798 v
+递增率 3 n
+递增级数 3 l
+递嬗 9 v
+递延 3 v
+递归 84 v
+递归函数 17 l
+递归性 3 n
+递归结构 3 l
+递归计算 3 l
+递归论 13 n
+递归语言 3 l
+递归边图 3 l
+递承 3 v
+递推 3 v
+递条子 3 l
+递水 6 v
+递烟 3 v
+递眼色 11 l
+递给 1022 v
+递胜递负 3 n
+递补 17 v
+递解 8 v
+递质 3 v
+递质共存 3 l
+递过去 3 v
+递过来 3 l
+递进 69 v
+递送 45 v
+递送人 3 n
+递阶控制 4 n
+递降 3 v
+途 857 n
+途上 3 s
+途中 1180 s
+途径 2801 n
+途程 20 n
+途穷日暮 3 n
+途经 187 n
+途途是道 3 n
+途遇 3 n
+逖 23 g
+逖听远闻 3 nr
+逖听遐视 3 nr
+逗 424 v
+逗乐 33 a
+逗人 48 n
+逗人喜欢 3 v
+逗人喜爱 3 n
+逗你玩 3 n
+逗号 31 n
+逗哏 2 v
+逗嘴 3 v
+逗弄 23 v
+逗引 27 v
+逗惹 3 v
+逗我 3 v
+逗点 3 n
+逗点符号 3 n
+逗猴 3 n
+逗玩 3 v
+逗留 312 v
+逗笑 72 v
+逗笑儿 3 n
+逗耍 3 v
+逗趣 16 a
+逗趣儿 3 v
+逗逗 3 v
+逗逗乐乐 3 n
+逗闷子 3 v
+這 7 zg
+通 9628 v
+通三营 2 nr
+通上 3 d
+通上彻下 3 i
+通不过 3 l
+通世务 3 n
+通中原 2 ns
+通丹吉 2 nr
+通为 3 v
+通久源 2 l
+通义 33 n
+通书 27 n
+通书达礼 3 nz
+通了 3 p
+通事 3 n
+通事郎 2 n
+通于权 4 l
+通云阳 2 nr
+通亚丁 2 nr
+通亚速 2 nr
+通产 4 j
+通产相 4 n
+通产省 8 j
+通亨奇 3 nr
+通亮 13 nr
+通人 20 n
+通人达才 3 l
+通什 18 nrt
+通什市 10 ns
+通今博古 7 nr
+通今达古 3 l
+通令 67 n
+通令全国 3 n
+通令嘉奖 3 nr
+通任督 2 n
+通传 4 vn
+通体 167 n
+通体砖 3 nr
+通作 3 vn
+通例 170 n
+通依言 3 nr
+通便 37 d
+通便剂 3 n
+通便药 3 l
+通俗 534 n
+通俗化 32 vn
+通俗小说 3 l
+通俗性 3 n
+通俗文学 3 l
+通俗易懂 3 l
+通俗歌曲 3 l
+通俗读物 3 n
+通信 2998 j
+通信业 26 n
+通信产业 3 nt
+通信兵 48 nr
+通信协议 3 nt
+通信卫星 154 nz
+通信员 16 n
+通信团 13 nt
+通信地址 8 n
+通信处 8 nt
+通信处理机 3 l
+通信子网 4 n
+通信安全 3 nr
+通信密钥 3 nr
+通信局 4 nt
+通信工程 3 l
+通信建筑 3 l
+通信录 3 nr
+通信情报 7 nt
+通信接口 9 l
+通信机房 3 n
+通信模型 3 n
+通信班 3 nr
+通信用 4 l
+通信站 8 nt
+通信线 5 n
+通信线路 3 l
+通信网 70 nt
+通信联系 3 nt
+通信联络 3 n
+通信费 2 n
+通信软件 8 l
+通信连 13 nr
+通信部 14 nt
+通信量 3 n
+通信集 3 nr
+通信鸽 3 nr
+通假 7 n
+通假字 3 l
+通儒硕学 3 nr
+通儒达士 3 nr
+通儒达识 3 nr
+通儒院 3 nr
+通元识微 3 l
+通元谷 21 nr
+通兑 3 vn
+通共 29 j
+通关 64 vn
+通典 28 n
+通军报 3 nt
+通分 3 d
+通则 165 n
+通判 100 vn
+通利 5 n
+通别 3 d
+通到 3 v
+通前彻后 3 i
+通前澈后 3 l
+通前至后 3 l
+通力 28 n
+通力协作 3 l
+通力合作 90 l
+通功易事 3 n
+通加巴 2 ns
+通勤 2 j
+通勤带 3 n
+通勤车 3 j
+通化 44 j
+通化县 2 ns
+通化市 16 j
+通化街 3 n
+通北疆 3 ns
+通匪 3 n
+通华声 7 nr
+通南夷 3 ns
+通南彻北 3 ns
+通卡 3 n
+通原文 2 nr
+通去 3 v
+通县 47 ns
+通双掌 2 nr
+通变 3 v
+通变达权 3 l
+通古今 6 l
+通古博今 3 nr
+通古斯 109 nr
+通古达变 3 l
+通台东 2 ns
+通史 391 n
+通司 3 n
+通吃岛 3 n
+通同 3 p
+通同一气 3 l
+通同作弊 3 l
+通名 3 v
+通名道 2 l
+通向 858 n
+通告 238 n
+通哥 6 n
+通商 949 n
+通商口岸 3 n
+通商惠工 3 l
+通商条约 3 n
+通商部 3 nt
+通喃喃 2 n
+通嘻嘻 4 z
+通国 7 ns
+通圆 2 n
+通城 280 ns
+通城县 257 ns
+通声气 3 l
+通夜 8 d
+通大秦 3 nr
+通天 625 n
+通天塔 4 nr
+通天彻地 23 i
+通天本领 3 n
+通天河 39 nr
+通天达地 3 l
+通奸 178 n
+通奸罪 6 i
+通好 3 d
+通婚 159 v
+通孔 6 n
+通存通兑 5 l
+通学 3 n
+通守郭 2 nr
+通宜兰 3 nr
+通宝 73 nr
+通宝一 2 nr
+通宝为 2 nr
+通宝卡 3 nr
+通宝钱 3 nr
+通宵 286 n
+通宵彻夜 3 i
+通宵彻旦 3 i
+通宵彻昼 3 nr
+通宵达旦 45 i
+通家之好 4 l
+通宿 3 v
+通屏东 2 nr
+通山 39 ns
+通山县 266 ns
+通川区 3 ns
+通州 306 ns
+通州区 18 ns
+通州市 3 ns
+通工 16 j
+通工易 18 l
+通工易事 3 n
+通布卡 2 nr
+通布图 9 nr
+通带 3 n
+通常 8161 d
+通常国会 3 nt
+通常条件 3 l
+通年 3 l
+通幽 5 z
+通幽动微 3 nr
+通幽洞冥 3 nr
+通幽洞微 3 z
+通幽洞灵 3 z
+通式 67 n
+通彻 3 v
+通往 1921 d
+通得 3 v
+通德乡 5 nr
+通德论 2 nr
+通心念 2 n
+通心粉 8 nr
+通心阳 2 nr
+通心面 3 n
+通志 84 n
+通志初 2 nr
+通志馆 3 nt
+通忧共患 3 i
+通性 19 n
+通悉 2 v
+通情达理 100 l
+通惠 6 vn
+通惠河 29 nr
+通感 12 n
+通才 55 n
+通才硕学 3 nr
+通才练识 3 i
+通扬 2 v
+通扬水 2 nr
+通扬运河 26 ns
+通报 870 n
+通报会 10 nt
+通报制度 3 n
+通报情况 3 n
+通报批评 3 l
+通报者 3 n
+通指 3 j
+通播 3 vn
+通政 161 n
+通政使 3 n
+通政司 82 nt
+通政院 7 nt
+通敌 51 v
+通文墨 14 nr
+通文调武 3 nr
+通文达理 3 l
+通文达礼 3 nr
+通文达艺 3 l
+通断键控 3 n
+通时合变 3 l
+通时达务 3 l
+通时达变 3 l
+通明 160 v
+通明透亮 3 z
+通易 3 vn
+通易论 2 n
+通显 3 a
+通晓 180 nr
+通晓兵 3 nr
+通有 3 v
+通杀 3 v
+通权达变 10 l
+通权达理 3 l
+通材达识 3 l
+通条 3 n
+通来 3 v
+通来通去 3 l
+通枪 3 n
+通枪条 3 n
+通枪管 3 n
+通栏 3 n
+通栏广告 3 l
+通栏标题 3 n
+通榆 5 nr
+通榆县 4 ns
+通款 3 n
+通气 151 n
+通气会 3 l
+通气口 3 n
+通气孔 9 n
+通气管 3 vn
+通水 12 n
+通水管 3 n
+通永道 4 nr
+通汛员 4 n
+通江 5 ns
+通江县 2 ns
+通江口 3 ns
+通江子 4 nr
+通河 47 ns
+通河县 3 ns
+通泉草 2 nr
+通波波 2 nr
+通流 3 n
+通济 4 n
+通济堰 3 nr
+通济桥 3 nr
+通济渠 30 nr
+通济门 5 n
+通海 38 ns
+通海县 5 ns
+通海怒 2 nr
+通海节 2 nr
+通海运 129 j
+通涨 3 v
+通淮利 2 ns
+通淮右 2 nr
+通渭 4 nrt
+通渭县 2 ns
+通湖 3 ns
+通源 4 n
+通滤波 3 n
+通灵之 2 nr
+通灵宝玉 6 nr
+通灵术 2 nr
+通灵玉 6 nr
+通灵王 3 nr
+通灵知 2 nr
+通灵祝 3 nr
+通灵者 3 nr
+通灵遇 2 nr
+通点 3 n
+通然 2 d
+通牒 140 n
+通用 1861 v
+通用五菱 3 nz
+通用件 3 n
+通用公司 14 nt
+通用化 27 j
+通用型 26 n
+通用字 5 n
+通用寄存器 6 n
+通用性 49 n
+通用报表 3 n
+通用机 34 n
+通用机架 3 n
+通用机械 3 n
+通用汉码 3 l
+通用汽车 3 nt
+通用汽车公司 43 nt
+通用版 3 n
+通用电气 72 n
+通用电气公司 44 nt
+通用码 3 n
+通用网址 3 n
+通用设备 3 n
+通用软件 3 l
+通电 80 j
+通电传 3 l
+通电子 3 n
+通电讯 3 nz
+通电话 33 l
+通畅 153 a
+通畅无阻 3 i
+通病 56 n
+通百艺 2 nr
+通盘 53 n
+通盘安排 3 n
+通盘性 3 n
+通盘筹划 3 n
+通盘考虑 3 n
+通盘计划 3 n
+通直 36 d
+通真达灵 3 l
+通知 3130 v
+通知书 211 nr
+通知函 3 nr
+通知单 31 n
+通知照会 3 l
+通知精神 3 i
+通神 5 n
+通票 5 n
+通科技 3 j
+通称 1102 v
+通稳 2 a
+通稿 3 n
+通窍 6 n
+通篇 41 n
+通红 873 z
+通经 30 d
+通经史 2 n
+通经活络 4 n
+通经致 4 l
+通络 17 n
+通统 34 n
+通缉 242 v
+通缉令 180 n
+通缉犯 2 n
+通缉逃犯 3 n
+通缩 8 j
+通老鹳 2 nr
+通考 2 v
+通联 19 j
+通肯河 2 nr
+通胀 138 j
+通胀率 16 j
+通背拳 13 nr
+通脉 3 n
+通脱木 2 nr
+通臂拳 5 n
+通至凯 2 nr
+通航 1295 j
+通色卡 3 nr
+通花莲 4 nr
+通草 11 n
+通草花 3 n
+通葡萄酒 7 n
+通融 83 n
+通行 1253 j
+通行币 3 n
+通行无阻 16 i
+通行本 25 n
+通行权 3 n
+通行证 152 n
+通行证号 3 n
+通行费 8 n
+通衢 1071 n
+通衢大道 3 z
+通衢大邑 3 ns
+通衢广陌 3 nr
+通见杨 2 nr
+通观 14 n
+通观全局 3 n
+通览 4 vn
+通解 3 v
+通计熟筹 3 i
+通训 3 vn
+通训定 3 n
+通讯 1473 nz
+通讯业 15 n
+通讯兵 6 n
+通讯卫星 12 n
+通讯员 438 n
+通讯器 3 n
+通讯器材 3 n
+通讯地址 3 n
+通讯处 13 n
+通讯录 13 n
+通讯杯 3 n
+通讯社 593 nt
+通讯稿 3 n
+通讯站 2 n
+通讯簿 3 n
+通讯网 10 n
+通讯联系 3 n
+通讯设备 3 n
+通讯费 8 n
+通讯部 5 n
+通许 16 d
+通许县 3 nr
+通论 99 n
+通译 19 v
+通话 502 n
+通话器 12 l
+通话录音 3 n
+通话时间 3 l
+通话积分 3 l
+通话记录 3 n
+通话质量 3 n
+通话费 139 n
+通话量 3 l
+通话音质 3 l
+通读 75 v
+通谍 2 n
+通谕 2 n
+通谱 2 n
+通谷 2 n
+通贝宝 2 nr
+通贝斯 2 nr
+通财 3 j
+通财之 2 nr
+通财之义 3 l
+通货 234 n
+通货收缩 3 l
+通货紧缩 22 l
+通货膨胀 498 l
+通货膨胀率 72 l
+通贯书 3 nr
+通路 126 n
+通路商 3 n
+通路子 3 l
+通身 79 n
+通车 1289 n
+通辑 3 n
+通辽 37 nr
+通辽市 11 ns
+通达 659 nr
+通达事理 3 l
+通达人情 3 l
+通达信 3 nr
+通达情理 3 l
+通达谙练 3 l
+通过 35063 p
+通过参观 3 l
+通过商量 3 l
+通过培训 3 nr
+通过审查 3 nr
+通过批评 3 l
+通过率 80 n
+通过考察 3 l
+通过考核 3 n
+通过表演 3 n
+通过观察 3 l
+通过议案 3 n
+通过鉴定 3 l
+通运 3 j
+通运公司 3 n
+通进 3 v
+通连 12 d
+通透 93 j
+通透性 3 n
+通透酶 3 l
+通途 76 n
+通通 105 vn
+通通风 3 l
+通道 2130 v
+通道容量 3 l
+通道接口 3 l
+通邑大都 3 ns
+通邮 39 j
+通都 3 d
+通都大埠 3 ns
+通都大邑 10 ns
+通都巨邑 3 nr
+通配符 20 n
+通释 3 v
+通量 58 n
+通金 2 n
+通金代 2 n
+通鉴学 2 nt
+通鉴考 3 nr
+通鉴胡 2 nr
+通鉴论 6 n
+通鉴音 4 nr
+通钦察 2 nr
+通铺 16 n
+通间 3 n
+通险畅机 3 l
+通雨阻 2 nr
+通霄 3 nr
+通霄达旦 3 nr
+通非斯 2 nr
+通非通 2 nr
+通顺 61 nr
+通风 407 n
+通风井 3 nr
+通风口 17 l
+通风器 3 l
+通风处 3 l
+通风孔 8 nr
+通风报信 56 l
+通风报讯 6 nz
+通风机 23 l
+通风柜 3 nr
+通风栅门 3 n
+通风管 4 l
+通风管道 3 l
+通风讨信 3 l
+通风设备 3 n
+通风道 2 l
+通首至尾 3 i
+通高 663 v
+通麦 2 n
+通齐 3 d
+逛 931 v
+逛一逛 3 v
+逛上去 3 v
+逛上来 3 v
+逛下 3 v
+逛下去 3 v
+逛下来 3 v
+逛公园 3 v
+逛出 3 v
+逛出去 3 v
+逛出来 3 v
+逛去 3 v
+逛商场 3 vn
+逛商店 3 v
+逛回 3 v
+逛回去 3 z
+逛回来 3 vn
+逛庙会 3 v
+逛得 3 v
+逛来 3 v
+逛来逛去 3 z
+逛游 3 v
+逛灯 3 v
+逛花灯 3 vn
+逛荡 9 v
+逛街 141 v
+逛起 3 v
+逛起来 3 v
+逛过 3 v
+逛过去 3 v
+逛过来 3 v
+逛进 3 v
+逛进去 3 v
+逛进来 3 v
+逛逛 144 v
+逝 492 v
+逝世 1383 v
+逝世者 3 n
+逝去 116 v
+逝将去汝 3 l
+逝水 22 v
+逝波 3 v
+逝者 20 n
+逝者如斯 19 l
+逞 394 vg
+逞一时之 3 l
+逞凶 26 v
+逞凶肆虐 3 i
+逞勇 3 l
+逞匹夫之 3 i
+逞奇眩异 3 i
+逞妍斗色 3 v
+逞威 3 v
+逞威风 11 l
+逞娇呈美 3 i
+逞娇斗媚 3 i
+逞工炫巧 3 v
+逞工衒巧 3 v
+逞己失众 3 i
+逞异夸能 3 i
+逞强 73 v
+逞强好胜 11 l
+逞强称能 3 l
+逞心如意 3 l
+逞性 3 v
+逞性妄为 3 l
+逞性子 3 l
+逞怪披奇 3 i
+逞恶 3 v
+逞欲 3 v
+逞能 56 v
+逞英雄 31 l
+速 2061 ng
+速交 3 n
+速写 63 n
+速写员 3 n
+速写法 3 n
+速决 33 v
+速决战 19 n
+速冻 41 n
+速冻干燥 3 n
+速冻机 3 n
+速凝剂 3 n
+速办 3 n
+速动 2 n
+速印 3 n
+速印机 3 n
+速去速回 3 i
+速变 2 n
+速告 3 n
+速回 3 v
+速复 3 v
+速寄 2 v
+速射 71 n
+速射炮 3 n
+速将 3 n
+速度 8218 n
+速度下拉 3 n
+速度共振 3 n
+速度快 3 n
+速度感 3 n
+速度慢 3 n
+速度测验 3 n
+速度空间 3 n
+速度表 7 n
+速度计 6 n
+速度谱 3 n
+速度门值 3 n
+速度限制 3 n
+速归 3 n
+速录 3 n
+速录员 3 n
+速录师 3 n
+速录机 3 n
+速成 68 v
+速成法 3 n
+速成班 4 n
+速战 3 n
+速战速决 54 i
+速战速结 3 n
+速报 4 n
+速描 3 n
+速攻 3 vn
+速效 36 n
+速效性 3 n
+速效肥料 3 n
+速来电 3 n
+速来速往 3 i
+速查 3 vn
+速查表 3 n
+速比 6 n
+速洽 3 v
+速测仪 3 n
+速溶 18 n
+速溶性 3 n
+速溶茶 3 n
+速滑 59 v
+速滑赛 6 n
+速滑队 3 n
+速激肽 3 n
+速率 418 n
+速率方程 3 n
+速生 39 n
+速生丰产林 258 n
+速生杨 3 n
+速生林 3 n
+速生柳 3 n
+速简 3 n
+速算 2 n
+速胜 3 n
+速胜论 23 n
+速记 43 n
+速记员 3 n
+速记法 3 n
+速记簿 3 n
+速读 3 v
+速读法 3 n
+速读课 3 n
+速调管 5 n
+速达 3 n
+速递 26 v
+速递网 3 n
+速速 3 n
+速配 3 vn
+速配网 3 n
+速降 27 v
+速食 6 n
+速食店 3 n
+速食面 3 n
+造 3060 v
+造人 3 n
+造价 445 v
+造价员 3 n
+造价师 3 n
+造作 62 vn
+造作矫揉 3 nr
+造假 182 v
+造假者 16 n
+造像 262 v
+造册 41 v
+造出 3 v
+造出来 3 v
+造势 52 n
+造化 358 v
+造化小儿 3 l
+造化弄人 3 i
+造反 1279 v
+造反派 307 n
+造口术 2 n
+造句 26 n
+造句法 3 l
+造因得果 3 n
+造因结果 3 n
+造园 3 n
+造园学 3 n
+造在 3 v
+造型 1501 n
+造型各异 4 l
+造型地貌 3 n
+造型师 3 n
+造型机 3 n
+造型艺术 72 n
+造字 34 n
+造字程序 3 n
+造孽 58 v
+造就 803 v
+造就人才 3 l
+造就人材 3 l
+造山运动 67 l
+造币 38 n
+造币厂 3 n
+造府 3 n
+造形 16 n
+造形艺术 3 l
+造形设计 3 i
+造影 154 n
+造影剂 17 n
+造影术 2 n
+造微入妙 3 i
+造恶不悛 3 i
+造成 9428 v
+造成危害 3 l
+造成堕落 3 i
+造成数 2 l
+造成真空 3 l
+造扣 3 v
+造斜工具 3 l
+造斜点 3 n
+造景 10 n
+造极登峰 3 n
+造林 1069 n
+造林学 3 n
+造桥 62 n
+造桥工程 3 n
+造模 3 n
+造次 70 n
+造次行事 3 v
+造次颠沛 3 v
+造渣 3 n
+造爱 3 v
+造物 45 n
+造物主 26 n
+造物者 3 n
+造田 32 n
+造福 240 v
+造福一方 9 i
+造福人类 3 n
+造福人群 3 n
+造端 3 n
+造端倡始 3 l
+造端讬始 3 v
+造粒 4 n
+造粒机 3 n
+造纸 777 v
+造纸业 30 n
+造纸厂 93 n
+造纸工 3 n
+造纸工业 3 n
+造纸术 42 n
+造纸机 16 n
+造纸用 3 n
+造舆论 3 l
+造船 668 n
+造船业 79 n
+造船公司 3 n
+造船厂 210 n
+造船场 3 n
+造船工业 3 n
+造船系 3 n
+造茧自缚 3 i
+造血 177 v
+造血型 2 n
+造表 2 v
+造言捏词 3 i
+造言生事 3 l
+造访 94 v
+造词 3 n
+造词法 3 n
+造诣 597 n
+造谋布穽 3 n
+造谋布阱 3 n
+造谣 109 v
+造谣中伤 3 i
+造谣中尚 3 i
+造谣惑众 10 i
+造谣生事 2 i
+造谣生非 3 i
+造谣言 3 i
+造谣诽谤 3 vn
+造车合辙 3 n
+造酒 3 v
+造陆运动 4 n
+逡 29 zg
+逡巡 23 v
+逡巡不前 3 v
+逢 985 zg
+逢人便讲 3 l
+逢人说项 3 v
+逢低买进 3 l
+逢低卖出 3 i
+逢凶化吉 57 i
+逢合 3 v
+逢吉丁辰 3 i
+逢君之恶 3 i
+逢场作乐 3 l
+逢场作戏 48 l
+逢场作趣 3 l
+逢场游戏 3 l
+逢场竿木 3 i
+逢山开路 15 l
+逢山开道 3 l
+逢年过节 105 l
+逢恶导非 3 l
+逢时 3 v
+逢时遇节 3 l
+逢机立断 3 i
+逢机遘会 3 vn
+逢甲 3 l
+逢甲大学 3 l
+逢甲学院 3 l
+逢见 3 v
+逢赌必输 3 v
+逢迎 59 v
+逢遇 3 v
+逢集 3 v
+逢高买进 3 l
+逢高卖出 3 i
+連 2 zg
+逦 49 x
+逧 2 zg
+逭 27 vg
+逮 541 zg
+逮住 3 v
+逮到 3 v
+逮得 3 v
+逮捕 1395 v
+逮捕令 10 n
+逮捕权 2 n
+逮捕法办 3 n
+逮捕证 10 n
+逮获 3 v
+逯 48 nr
+逯钦立 3 nr
+進 2 zg
+逴俗绝物 3 v
+逵 46 g
+逶 30 z
+逶迤 68 z
+逶迤退食 3 vn
+逸 744 zg
+逸乐 11 n
+逸书 3 n
+逸事 34 n
+逸仙 3 n
+逸仙湖 3 nr
+逸仙路 3 n
+逸以待劳 3 i
+逸兴 3 n
+逸兴云飞 3 nr
+逸兴横飞 3 i
+逸兴遄飞 4 i
+逸出功 5 i
+逸劳 3 n
+逸史 11 n
+逸品 3 n
+逸士 6 n
+逸夫 13 n
+逸夫楼 3 nr
+逸尘断鞅 3 nr
+逸度 3 n
+逸态横生 3 i
+逸才 3 n
+逸散 5 v
+逸文 3 n
+逸民 8 n
+逸气 3 n
+逸海书城 3 n
+逸游自恣 3 i
+逸群 3 n
+逸群之才 3 i
+逸群绝伦 3 i
+逸致 3 v
+逸诗 3 n
+逸豫 6 nr
+逸趣 3 n
+逸趣横生 3 i
+逸辈殊伦 3 n
+逸闻 9 n
+逸闻琐事 3 nr
+逸闻趣事 2 i
+逸闻轶事 3 vn
+逸韵高致 3 i
+逻 617 n
+逻各斯 15 l
+逻格斯 3 n
+逻辑 2059 n
+逻辑值 3 n
+逻辑关系 3 l
+逻辑加法 3 n
+逻辑图 2 n
+逻辑学 172 n
+逻辑学家 3 n
+逻辑思维 91 l
+逻辑性 39 n
+逻辑推理 52 n
+逻辑摆幅 3 n
+逻辑文件 3 n
+逻辑模拟 3 n
+逻辑电路 3 n
+逻辑盘 3 n
+逻辑移位 3 n
+逻辑程序 3 n
+逻辑系统 3 l
+逻辑联系 3 n
+逻辑设备 3 n
+逻辑设计 8 n
+逻辑运算 2 l
+逼 3617 v
+逼一逼 3 v
+逼上去 3 v
+逼上来 3 v
+逼上梁山 33 i
+逼下 3 v
+逼下去 3 v
+逼下台 3 v
+逼下来 3 v
+逼不得已 3 i
+逼为 3 v
+逼人 214 v
+逼人太甚 2 i
+逼仄 14 z
+逼住 3 v
+逼使 23 v
+逼供 39 v
+逼供信 3 l
+逼债 10 v
+逼出 3 v
+逼出去 3 v
+逼出来 3 v
+逼到 3 v
+逼向 3 v
+逼命 3 v
+逼回 3 v
+逼回去 3 l
+逼回来 3 l
+逼婚 20 v
+逼宫 15 v
+逼得 3 v
+逼急 3 a
+逼成 3 v
+逼抢 26 v
+逼来逼去 3 i
+逼死 129 v
+逼状 3 v
+逼真 241 v
+逼真度 3 l
+逼真性 3 l
+逼空 11 v
+逼紧 3 v
+逼肖 3 l
+逼良为娼 12 i
+逼视 52 v
+逼走 3 v
+逼起 3 v
+逼起来 3 v
+逼过去 3 v
+逼过来 3 l
+逼近 677 v
+逼进 3 v
+逼进去 3 v
+逼进来 3 v
+逼迫 362 v
+逼问 108 v
+逼降 3 v
+逾 769 vg
+逾出 3 v
+逾分 3 v
+逾千越万 3 ns
+逾墙 3 v
+逾墙窥蠙 3 n
+逾墙窥隙 3 n
+逾墙越舍 3 ns
+逾墙钻穴 3 n
+逾墙钻蠙 3 nz
+逾墙钻隙 3 n
+逾山越海 3 ns
+逾常 3 t
+逾年历岁 3 t
+逾恒 3 v
+逾时 3 t
+逾时不候 3 v
+逾期 119 t
+逾期作废 3 v
+逾期费 3 v
+逾次超秩 3 nr
+逾沙轶漠 3 z
+逾淮之橘 3 n
+逾绳越契 3 ns
+逾越 175 v
+逾越节 4 t
+逾重 3 v
+逾量 3 v
+逾闲荡检 3 v
+逾限 17 v
+逾额 3 v
+逾龄 3 v
+逿 33 zg
+遁 277 vg
+遁世 3 v
+遁世幽居 3 n
+遁世无闷 3 n
+遁世离俗 3 i
+遁世离群 3 i
+遁世绝俗 3 i
+遁世遗荣 3 i
+遁世长往 3 i
+遁世隐居 3 i
+遁俗无闷 3 n
+遁入 36 v
+遁入空门 15 i
+遁名匿迹 3 i
+遁名改作 3 i
+遁声匿迹 3 i
+遁天之刑 3 i
+遁天倍情 3 i
+遁天妄行 3 i
+遁形 10 v
+遁形远世 3 i
+遁藏 3 v
+遁词 3 v
+遁走 3 v
+遁身远迹 3 i
+遁辞 3 v
+遁迹 8 v
+遁迹匿影 3 i
+遁迹山林 3 i
+遁迹方外 3 i
+遁迹桑门 3 i
+遁迹潜形 3 i
+遁迹空门 3 i
+遁迹藏名 3 i
+遁迹销声 3 i
+遁迹黄冠 3 i
+遁逃 16 v
+遁逸无闷 3 i
+遁阴匿景 3 i
+遁隐 3 v
+遂 4209 d
+遂其所愿 3 i
+遂即 3 v
+遂宁 10 ns
+遂宁市 12 ns
+遂定 3 v
+遂川 15 ns
+遂川县 4 ns
+遂平 37 ns
+遂平县 5 ns
+遂心 17 v
+遂心如意 2 i
+遂心应手 3 i
+遂心快意 3 i
+遂心满意 3 i
+遂意 8 v
+遂愿 6 v
+遂昌 6 ns
+遂昌县 4 ns
+遂曰 3 v
+遂溪 5 ns
+遂溪县 3 ns
+遂行 223 v
+遂起歹念 3 i
+遂迷不窹 3 nrt
+遂迷忘反 3 i
+遄 46 g
+遇 3465 v
+遇上 987 v
+遇上爱 3 v
+遇不到 3 v
+遇不惊 3 v
+遇事 239 v
+遇事生端 3 n
+遇事生风 3 n
+遇人不淑 6 n
+遇冷 3 v
+遇冷收缩 3 n
+遇到 5143 v
+遇到困难 3 i
+遇刺 132 v
+遇合 3 v
+遇害 118 v
+遇害案 3 n
+遇害者 3 n
+遇害身亡 3 i
+遇拙 3 v
+遇挫 3 v
+遇敌 3 v
+遇救 7 v
+遇有 3 v
+遇水叠桥 3 n
+遇水架桥 4 n
+遇水迭桥 3 nr
+遇热 3 v
+遇热膨胀 3 n
+遇物持平 3 n
+遇祸 3 v
+遇秋 2 n
+遇罗克 3 nr
+遇袭 3 v
+遇见 729 v
+遇过 3 v
+遇阻 12 v
+遇险 158 v
+遇险记 3 n
+遇难 215 v
+遇难呈祥 6 i
+遇难成祥 3 i
+遇难成详 3 i
+遇难者 41 n
+遇雨 3 v
+遇鬼 3 v
+遊 15 zg
+遍 2147 v
+遍于 3 v
+遍体 98 n
+遍体鳞伤 196 i
+遍历 25 v
+遍历假说 3 i
+遍历性 3 n
+遍及 815 v
+遍吻 3 v
+遍在蛋白 3 i
+遍地 467 v
+遍地开花 35 i
+遍寻 3 v
+遍寻天下 3 i
+遍山 3 v
+遍布 850 v
+遍布全国 3 n
+遍布整个 3 n
+遍找 3 v
+遍数 3 n
+遍览 17 v
+遍览群籍 3 n
+遍计所执 3 n
+遍访 29 v
+遍身 3 v
+遍野 52 v
+過 6 zg
+遏 110 v
+遏云绕梁 3 i
+遏制 716 v
+遏密八音 3 i
+遏恶扬善 3 i
+遏抑 6 v
+遏止 141 v
+遏止住 3 i
+遏渐防荫 3 i
+遏渐防萌 3 i
+遏阻 3 v
+遏阻作用 3 i
+遐 19 v
+遐尔闻名 3 i
+遐州僻壤 3 i
+遐志 3 n
+遐思 25 v
+遐想 73 v
+遐方绝域 3 n
+遐方绝壤 3 i
+遐迩 23 n
+遐迩一体 3 i
+遐迩著闻 3 v
+遐迩闻名 4 i
+遐龄 4 n
+遑 63 zg
+遑论 25 n
+遑论其他 3 n
+遑遑不可 3 v
+遒 41 a
+遒健 3 a
+遒劲 68 a
+道 140545 q
+道不举遗 3 i
+道不同不相为谋 6 i
+道不拾遗 3 i
+道不掇遗 3 v
+道不明 11 i
+道不相谋 3 i
+道东说西 3 n
+道义 230 n
+道义上 3 n
+道义之交 3 i
+道义感 3 n
+道义责任 3 n
+道乏 3 v
+道亨银行 3 nr
+道人 1277 n
+道众 2 n
+道依茨 6 nr
+道候 3 n
+道傍之筑 3 i
+道傍筑室 3 v
+道傍苦李 3 i
+道儿 12 n
+道光 475 n
+道光帝 34 nr
+道具 1205 n
+道具中心 3 l
+道具栏 3 n
+道别 102 n
+道友 11 n
+道口 99 n
+道口镇 3 n
+道号 52 n
+道合志同 3 n
+道同义合 3 n
+道同契合 3 nr
+道同志合 3 nr
+道听涂说 3 i
+道听耳食 3 i
+道听途说 77 i
+道员 3 n
+道喜 63 n
+道在人为 3 i
+道在屎溺 3 n
+道场 359 n
+道坎 5 n
+道士 1258 n
+道外区 6 n
+道大莫容 3 nz
+道天雷 9 nr
+道夫 9 n
+道头知尾 3 i
+道奇 47 nr
+道姑 277 n
+道威 5 n
+道子 32 n
+道存目击 3 i
+道孚 3 nz
+道孚县 4 nr
+道学 53 n
+道学先生 3 n
+道学家 11 n
+道家 258 n
+道寡称孤 3 nr
+道尔 48 nz
+道尔吉 2 nr
+道尔顿 3 nr
+道尔顿体 3 nz
+道尔顿制 4 nz
+道尽涂穷 3 i
+道尽途穷 3 i
+道山学海 3 nz
+道岔 20 n
+道岔区段 3 l
+道工序 3 n
+道床 3 nz
+道康宁 2 nr
+道弟称兄 3 n
+道徒 5 n
+道微德薄 3 nr
+道德 3241 nr
+道德两难 3 i
+道德修养 3 nr
+道德化 7 nr
+道德品质 3 n
+道德哲学 3 nr
+道德家 22 nr
+道德心 3 nr
+道德性 4 nr
+道德感 4 nr
+道德教育 3 nr
+道德文章 3 nr
+道德水准 3 nr
+道德法庭 3 nr
+道德素质 3 nr
+道德经 48 nr
+道德行为 3 nr
+道德观 22 nr
+道德观念 3 nr
+道德规范 3 nr
+道德败坏 3 i
+道德需要 3 n
+道德风尚 3 nr
+道德风险 3 n
+道心 3 n
+道情 23 n
+道成仙去 3 i
+道拉吉里峰 3 nrt
+道教 1681 nz
+道教协会 260 nt
+道教徒 12 n
+道数 2 n
+道斯 2 nz
+道旁 168 s
+道旁苦李 3 i
+道无拾遗 3 i
+道明 8 nz
+道明四 3 nr
+道明寺 3 nr
+道木 10 n
+道术 22 n
+道板 2 n
+道林 5 nz
+道林纸 3 nz
+道格 4 n
+道格拉斯 71 nrt
+道歉 457 v
+道歉信 3 vn
+道殣相属 3 nr
+道殣相望 3 nz
+道殣相枕 3 nz
+道法 25 n
+道济 3 n
+道渣 3 n
+道渣电容 3 n
+道爷 7 n
+道特 256 nz
+道理 3304 n
+道琼斯 25 nz
+道白 87 n
+道破 27 nrt
+道祖 5 n
+道福 16 nz
+道福特 3 nr
+道童 11 n
+道符 3 n
+道紫光 4 nr
+道红光 4 nr
+道经 57 n
+道统 75 n
+道而不径 3 i
+道菜 34 n
+道融 2 n
+道行 117 j
+道行军 3 n
+道袍 156 n
+道西说东 3 n
+道观 134 n
+道诺霉素 3 nz
+道谢 249 nr
+道貌 3 n
+道貌俨然 3 z
+道貌凛然 3 i
+道貌岸然 50 i
+道贺 89 nr
+道路 5532 n
+道路交通 62 nz
+道路以目 2 i
+道路容量 3 n
+道路灯 3 n
+道路网 19 nz
+道路设施 3 n
+道路设计 3 n
+道轨 3 n
+道边苦李 3 i
+道远日暮 3 i
+道远知骥 3 i
+道道儿 4 nr
+道道地地 3 n
+道里区 5 ns
+道钉 11 n
+道长 499 n
+道长争短 3 n
+道长论短 3 n
+道门 69 n
+道院 34 n
+道骨仙风 3 n
+道高一丈 6 i
+道高一尺 10 i
+道高德重 3 nr
+道高益安 3 nz
+道高魔重 3 i
+達 3 zg
+違 16 zg
+遗 1158 n
+遗下 3 n
+遗世忘累 3 i
+遗世拔俗 3 i
+遗世独立 6 i
+遗世绝俗 3 i
+遗世越俗 3 n
+遗业 3 n
+遗书 360 n
+遗事 17 n
+遗产 2995 vn
+遗产地 27 n
+遗产税 3 n
+遗从 3 n
+遗休余烈 3 l
+遗传 1234 vn
+遗传侵蚀 3 n
+遗传信息 3 n
+遗传力 3 n
+遗传变异 3 n
+遗传因子 3 n
+遗传型 3 n
+遗传基因 3 n
+遗传学 434 n
+遗传学家 45 n
+遗传工程 30 n
+遗传工程学 3 n
+遗传性 119 n
+遗传性状 3 n
+遗传操作 6 n
+遗传物质 124 n
+遗传疾病 3 n
+遗传病 69 n
+遗传算法 3 n
+遗体 583 n
+遗余 3 n
+遗作 23 vn
+遗俗 6 n
+遗俗绝尘 3 i
+遗像 75 n
+遗华反质 3 n
+遗名去利 3 i
+遗命 3 vn
+遗哂大方 3 z
+遗嘱 330 n
+遗嘱继承 10 n
+遗址 5882 n
+遗墨 9 n
+遗声余价 3 n
+遗声坠绪 3 n
+遗大投艰 3 i
+遗失 99 n
+遗失启事 3 i
+遗失在 3 v
+遗失物 2 n
+遗失独立 3 i
+遗孀 48 n
+遗存 319 n
+遗孤 20 n
+遗孽 3 n
+遗孽余烈 3 i
+遗害 8 n
+遗害万年 3 n
+遗害无穷 2 i
+遗害终身 3 n
+遗容 44 n
+遗寝载怀 3 i
+遗少 13 v
+遗尿 47 n
+遗属 40 n
+遗弃 221 v
+遗弃物 3 n
+遗弃罪 3 n
+遗形去貌 3 i
+遗形忘性 3 n
+遗形藏志 3 n
+遗德休烈 3 n
+遗德余烈 3 i
+遗志 89 n
+遗忘 320 v
+遗忘传说 3 n
+遗忘曲线 3 n
+遗忘症 3 n
+遗念 2 n
+遗恨 60 n
+遗恨千古 3 i
+遗恨终天 3 i
+遗恨终身 3 i
+遗恩余烈 3 i
+遗患 8 n
+遗患终身 3 i
+遗情书 3 n
+遗惠余泽 3 n
+遗愿 51 n
+遗憾 1156 a
+遗憾终生 3 n
+遗憾终身 3 n
+遗教 13 n
+遗文 38 n
+遗文逸句 3 i
+遗族 17 n
+遗毒 6 n
+遗民 60 n
+遗气 3 n
+遗漏 437 n
+遗漏掉 3 v
+遗漏罪行 3 n
+遗照 2 n
+遗爱 3 a
+遗爱人世 3 i
+遗爱人间 3 n
+遗物 353 n
+遗物忘形 3 n
+遗物箱 3 n
+遗物识心 3 n
+遗珠 3 n
+遗珠之憾 3 i
+遗珠弃璧 3 n
+遗珥坠簪 3 n
+遗留 798 vn
+遗留下 3 n
+遗留下来 3 l
+遗留物 6 n
+遗留问题 3 n
+遗着 3 v
+遗矢 3 n
+遗祸 6 n
+遗祸无穷 2 i
+遗稿 28 n
+遗笑大方 3 n
+遗策 3 n
+遗篇 7 n
+遗篇坠款 3 n
+遗篇断简 3 n
+遗簪坠履 3 n
+遗簪坠珥 3 n
+遗簪堕履 3 i
+遗簪弊履 3 n
+遗簪绝缨 3 v
+遗精 77 n
+遗绪 3 n
+遗编坠简 3 n
+遗编断简 3 n
+遗编绝简 3 n
+遗缺 10 a
+遗老 49 n
+遗老孤臣 3 i
+遗老遗少 3 i
+遗腹 5 n
+遗腹子 22 n
+遗臣 3 n
+遗自万代 3 i
+遗臭万世 3 i
+遗臭万代 3 i
+遗臭万年 26 i
+遗臭万载 3 i
+遗臭千年 3 i
+遗臭千秋 3 i
+遗臭无穷 3 i
+遗艰投大 3 i
+遗芬余荣 3 n
+遗芬剩馥 3 nrt
+遗芳余烈 3 i
+遗落 26 n
+遗落世事 3 n
+遗著 58 n
+遗觉象 3 n
+遗言 192 n
+遗训 57 vn
+遗训余风 3 n
+遗诏 164 n
+遗赠 43 v
+遗赠人 3 n
+遗踪 3 v
+遗迹 1068 n
+遗迹谈虚 3 i
+遗送 3 v
+遗闻 12 n
+遗闻琐事 3 vn
+遗闻轶事 3 vn
+遗闻逸事 3 i
+遗音余韵 3 n
+遗音犹在 3 l
+遗韵 12 n
+遗风 73 n
+遗风余习 3 n
+遗风余俗 3 n
+遗风余思 3 l
+遗风余教 3 n
+遗风余泽 3 n
+遗风余烈 3 i
+遗风余象 3 n
+遗风余采 3 i
+遗风余韵 3 n
+遗风古道 3 n
+遗风旧俗 3 n
+遗风逸尘 3 i
+遗馈 3 v
+遗骨 114 n
+遗骸 99 n
+遗魂亡魄 3 i
+遗鸥 3 n
+遗黎故老 3 n
+遘 8 g
+遛 105 v
+遛弯 4 v
+遛弯儿 2 v
+遛早 3 v
+遛狗 3 v
+遛达 3 v
+遛马 10 v
+遛鸟 4 v
+遝冈复岭 3 n
+遠 2 zg
+遢 6 x
+遣 1787 vg
+遣下去 3 v
+遣使 453 v
+遣俘 3 v
+遣兴 3 v
+遣兴陶情 3 l
+遣兵调将 3 i
+遣唐使 26 n
+遣将征兵 3 n
+遣将调兵 3 n
+遣归 3 v
+遣忧 3 v
+遣怀 10 v
+遣愁索笑 3 l
+遣戍 18 v
+遣散 80 v
+遣散费 8 v
+遣言措意 3 n
+遣词 3 v
+遣词措意 3 n
+遣词用句 18 i
+遣词立意 3 i
+遣词造句 10 l
+遣词造意 3 l
+遣辞措意 3 n
+遣返 113 v
+遣返作业 3 l
+遣返回国 3 l
+遣送 138 v
+遣送出境 3 l
+遣送回国 3 l
+遣送站 3 n
+遣闷 3 v
+遥 581 ag
+遥不可及 28 i
+遥听 3 v
+遥呼相应 3 l
+遥寄 3 v
+遥念 3 n
+遥想 36 v
+遥感 289 a
+遥感信息 3 l
+遥感制图 3 l
+遥感平台 3 l
+遥感技术 3 n
+遥指 30 n
+遥控 268 vn
+遥控员 3 n
+遥控器 43 n
+遥控装置 3 n
+遥控车 3 n
+遥控钮 3 n
+遥无音信 3 l
+遥望 231 v
+遥测 143 vn
+遥测技术 3 n
+遥测计 3 n
+遥现 3 v
+遥相 3 n
+遥相呼应 44 l
+遥相应和 3 i
+遥知 3 v
+遥祝 7 v
+遥祭 3 v
+遥见 53 a
+遥远 848 a
+遥远号 2 n
+遥遥 163 a
+遥遥千里 3 i
+遥遥华胄 3 n
+遥遥在望 3 i
+遥遥地 4 l
+遥遥无期 40 i
+遥遥注目 3 i
+遥遥相对 25 i
+遥遥相望 3 i
+遥遥领先 55 l
+遥闻 3 n
+遨 5 v
+遨游 83 v
+遨游四海 3 vn
+遨游天下 3 v
+遨游太空 3 v
+遨翔自得 3 v
+適 50 zg
+遬 38 zg
+遭 3334 v
+遭事制宜 3 n
+遭人 3 n
+遭人暗算 3 n
+遭人白眼 6 n
+遭人算计 3 n
+遭倾遇祸 3 n
+遭偷拍 3 i
+遭到 4679 v
+遭劫 23 v
+遭劫在数 3 n
+遭劫持 3 n
+遭厄 3 n
+遭受 2212 v
+遭变 3 v
+遭天打雷 3 i
+遭害 3 v
+遭家不造 3 v
+遭强奸 3 n
+遭强暴 3 n
+遭打 3 v
+遭抢 3 v
+遭报 3 n
+遭报应 3 n
+遭时不偶 3 i
+遭时制宜 3 n
+遭时定制 3 n
+遭此 3 i
+遭殃 111 v
+遭灾 29 n
+遭炮轰 3 i
+遭绑架 3 vn
+遭罪 17 v
+遭致 3 v
+遭袭 6 v
+遭逢 226 v
+遭逢不偶 3 i
+遭逢会遇 3 i
+遭逢际会 3 i
+遭遇 1854 n
+遭遇不偶 3 i
+遭遇战 32 n
+遭遇运会 3 n
+遭遇际会 3 n
+遭际 108 n
+遭难 61 v
+遭雷击 3 n
+遭骂 3 v
+遮 893 v
+遮三瞒四 3 i
+遮上 3 v
+遮上去 3 v
+遮上来 3 v
+遮下 3 v
+遮不了 3 l
+遮不住 3 v
+遮丑 13 v
+遮人眼目 3 i
+遮人耳目 5 i
+遮住 370 v
+遮体 3 n
+遮光 8 v
+遮光板 4 nz
+遮光片 3 nz
+遮光罩 2 l
+遮光角 3 nz
+遮前掩后 3 i
+遮地漫天 3 nz
+遮地盖天 3 i
+遮天 3 v
+遮天映日 3 i
+遮天盖地 11 i
+遮天盖日 3 i
+遮天蔽日 41 i
+遮天迷地 3 i
+遮太阳 3 nz
+遮头盖面 3 i
+遮得 3 v
+遮成 3 v
+遮护 16 v
+遮拦 143 v
+遮挡 132 v
+遮挡住 3 l
+遮掩 240 v
+遮掩法 3 v
+遮掩耳目 3 i
+遮掩起来 3 v
+遮放 4 v
+遮敝 3 i
+遮断 3 v
+遮架 3 v
+遮瑕膏 2 nz
+遮盖 155 v
+遮盖住 3 i
+遮盖力 3 i
+遮盖着 3 l
+遮盖起 3 i
+遮盖起来 3 i
+遮目鱼 7 i
+遮眼 3 v
+遮眼法 3 l
+遮眼睛 3 i
+遮瞒 3 v
+遮空蔽日 3 i
+遮罩 3 v
+遮羞 13 v
+遮羞布 13 i
+遮羞费 3 i
+遮脸 3 v
+遮荫 18 v
+遮蔽 163 v
+遮蔽住 3 i
+遮蔽物 3 i
+遮蔽着 3 l
+遮蔽罩 3 n
+遮藏 3 v
+遮覆 3 v
+遮起 3 v
+遮起来 3 l
+遮路 3 nz
+遮遮掩掩 40 v
+遮遮盖盖 3 l
+遮阳 25 ns
+遮阳伞 7 nz
+遮阳帽 7 nz
+遮阳时间 3 l
+遮阳板 3 nz
+遮阳棚 3 n
+遮阳篷 3 n
+遮阳网 3 nz
+遮阳蓬 3 ns
+遮阴 3 v
+遮障 5 v
+遮雨 3 v
+遮雨棚 3 n
+遮面 3 v
+遮风 3 v
+遮风挡雨 14 l
+遮风避雨 3 l
+遯 59 zg
+遯世 3 vn
+遯形 3 vn
+遴 14 v
+遴选 122 v
+遴选出 3 vn
+遴选出来 3 vn
+遵 820 nr
+遵一级字 3 l
+遵义 179 v
+遵义会议 174 nz
+遵义县 4 ns
+遵义市 25 ns
+遵义路 3 nz
+遵从 279 v
+遵令 3 v
+遵养待时 3 l
+遵养时晦 3 v
+遵养晦时 3 vn
+遵办 3 v
+遵化 69 v
+遵化县 12 ns
+遵化市 8 ns
+遵厌兆祥 3 z
+遵命 148 nz
+遵嘱 6 v
+遵奉 60 v
+遵守 1982 v
+遵守合同 3 l
+遵守纪律 3 l
+遵守规则 3 l
+遵循 1223 v
+遵循原则 3 ns
+遵旨 3 v
+遵时 3 ns
+遵时养晦 3 v
+遵照 336 v
+遵照办理 3 l
+遵照执行 3 l
+遵照指示 3 l
+遵章守纪 4 l
+遵纪 3 nz
+遵纪守法 61 l
+遵纪爱民 3 ns
+遵而不失 3 l
+遵而勿失 3 l
+遵行 60 v
+遵道秉义 3 vn
+選 7 zg
+遹 16 zg
+遺 49 zg
+遼 9 zg
+遽 105 d
+遽下 3 d
+遽下结论 3 vn
+遽尔 3 d
+遽然 14 d
+遽然变色 3 v
+避 2419 v
+避一避 3 v
+避不作答 3 v
+避不见面 3 i
+避世 41 v
+避世墙东 3 n
+避世离俗 3 i
+避世绝俗 3 i
+避世金门 3 n
+避世金马 3 n
+避乱 28 v
+避井入坎 3 n
+避人眼目 3 i
+避人耳目 10 i
+避俗趋新 3 l
+避债 3 v
+避光 19 v
+避免 3827 v
+避免出现 3 v
+避免浪费 3 n
+避其锐气 5 v
+避军三舍 3 i
+避凉附炎 3 n
+避凶趋吉 3 l
+避到 3 v
+避匿 3 v
+避向 3 v
+避坑落井 3 i
+避嫌 40 v
+避嫌守义 3 vn
+避孕 221 v
+避孕套 60 n
+避孕措施 3 n
+避孕栓 3 n
+避孕法 3 n
+避孕片 5 n
+避孕环 6 n
+避孕用品 3 n
+避孕药 189 n
+避孕药物 3 n
+避孕针 5 n
+避实击虚 9 i
+避实就虚 14 i
+避害 3 v
+避害就利 3 i
+避寒 276 v
+避居 34 v
+避席 3 v
+避开 1163 v
+避弹坑 3 n
+避强击弱 3 l
+避强打弱 3 i
+避影匿形 3 i
+避影敛迹 3 v
+避役 3 v
+避忌 22 v
+避恶 3 v
+避振 3 v
+避暑 443 v
+避暑山庄 29 ns
+避暑胜地 3 n
+避暑药 3 n
+避李嫌瓜 3 ns
+避毁就誉 3 l
+避溺山隅 3 nrt
+避烦斗捷 3 l
+避瓜防李 3 n
+避病性 3 n
+避着 3 v
+避祸 3 v
+避祸就福 3 i
+避祸求福 3 i
+避秦 3 ns
+避税 21 v
+避穽入坑 3 v
+避繁就简 3 i
+避缩 3 v
+避缩到 3 v
+避而不答 3 l
+避而不见 3 i
+避而不谈 23 i
+避而远之 3 i
+避蚊剂 3 n
+避蚊油 3 n
+避让 130 v
+避让贤路 3 l
+避讳 102 v
+避读 3 v
+避谣 3 v
+避迹藏时 3 i
+避迹违心 3 i
+避避 3 v
+避避风头 3 l
+避邪 37 v
+避重就轻 14 i
+避重逐轻 3 i
+避错 3 v
+避阱入坑 3 v
+避陋 3 i
+避险 46 v
+避难 241 v
+避难就易 2 l
+避难所 39 i
+避难权 2 n
+避难者 6 n
+避难趋易 3 l
+避雨 55 v
+避雷 15 v
+避雷器 31 n
+避雷线 7 n
+避雷设计 3 i
+避雷针 31 n
+避震 2 n
+避震器 3 n
+避面尹邢 3 nr
+避风 210 v
+避风塘 3 ns
+避风头 21 n
+避风港 33 ns
+邀 1267 v
+邀买 3 v
+邀准 3 v
+邀击 3 v
+邀功 32 v
+邀功希宠 3 vn
+邀功求赏 3 i
+邀功请赏 11 i
+邀名射利 3 n
+邀天之幸 3 i
+邀宠 9 v
+邀客 6 v
+邀宴 3 v
+邀斤论两 3 i
+邀约 30 v
+邀聘 3 v
+邀请 3258 v
+邀请书 2 n
+邀请信 7 n
+邀请函 18 n
+邀请卡 3 n
+邀请者 3 n
+邀请赛 133 n
+邀集 57 v
+邁 7 zg
+邂 2 v
+邂逅 106 v
+邂逅不偶 3 i
+邂逅相逢 16 i
+邂逅相遇 16 i
+邃 16 ag
+邅 8 zg
+邆 2 zg
+邈 25 zg
+邈以山河 3 nz
+邈处欿视 3 vn
+邈如旷世 3 vn
+邈然 3 a
+邈若山河 3 nz
+邈若河山 3 nz
+邈若河汉 3 t
+邈视 3 a
+邈远 8 a
+邋 6 a
+邋遢 59 a
+邋里邋遢 10 z
+邑 663 ng
+邓 818 nr
+邓世昌 64 nr
+邓严衡 3 nr
+邓中夏 63 nr
+邓中翰 3 nr
+邓丽君 24 nr
+邓之诚 10 nr
+邓九如 4 nr
+邓二人 5 nr
+邓亚平 3 nr
+邓亚萍 46 nr
+邓伟杰 3 nr
+邓伯温 2 nr
+邓健泓 3 nr
+邓元觉 23 nr
+邓光荣 3 nr
+邓克岛 2 nr
+邓八公 13 nr
+邓军举 2 nr
+邓军叉 3 nr
+邓军叹 2 nr
+邓军挥 2 nr
+邓军放 2 nr
+邓军正 3 nr
+邓军站 2 nr
+邓军让 2 nr
+邓初民 6 nr
+邓利维 14 nr
+邓力群 8 nr
+邓南 6 ns
+邓县 28 ns
+邓县北 2 nr
+邓友梅 4 nr
+邓吉超 2 nr
+邓君和 6 nr
+邓嗣禹 3 nr
+邓在军 9 nr
+邓士载 2 nr
+邓大人 8 nr
+邓大哥 11 nr
+邓大妙 4 nr
+邓大海 67 nr
+邓大爷 3 nr
+邓大翠 33 nr
+邓天君 2 nr
+邓太后 4 nr
+邓太妙 27 nr
+邓夫人 28 nr
+邓奶奶 2 nr
+邓子恢 16 nr
+邓子文 3 nr
+邓子龙 24 nr
+邓孚槐 3 nr
+邓宗南 2 nr
+邓宗煌 2 nr
+邓宝金 3 nr
+邓家岭 256 nr
+邓家湾 4 nr
+邓寅达 2 nr
+邓寿鹏 10 nr
+邓将军 2 nr
+邓小平 4055 nr
+邓小平理论 825 nr
+邓小玲 3 nr
+邓少剡 2 nr
+邓尼金 9 nr
+邓屯乡 2 nr
+邓州 116 ns
+邓州市 3 ns
+邓师兄 2 nr
+邓广铭 27 nr
+邓廷桢 10 nr
+邓建军 3 nr
+邓张二 3 nr
+邓征西 2 nr
+邓志成 2 nr
+邓忠引 2 nr
+邓恩铭 42 nr
+邓惜华 2 nr
+邓成城 2 nr
+邓承修 3 nr
+邓拓 21 nr
+邓政委 6 nr
+邓散木 3 nr
+邓敦 2 ns
+邓文俊 2 nr
+邓文原 3 nr
+邓昊天 3 nr
+邓昌伶 2 n
+邓昌友 5 nr
+邓普顿 2 nr
+邓有米 305 nr
+邓本殷 20 nr
+邓朴方 11 nr
+邓李宝 13 nr
+邓格拉 2 nr
+邓梓峰 3 ns
+邓植仪 2 nr
+邓正来 2 nr
+邓氏鱼 2 nr
+邓永清 6 nr
+邓永红 6 nr
+邓波儿 4 nr
+邓泽如 2 nr
+邓洛普 3 nr
+邓浦东 2 nr
+邓浩光 3 nr
+邓淑丽 3 nrfg
+邓演达 24 nr
+邓炳春 8 nr
+邓牧自 2 nr
+邓玉函 7 nr
+邓百川 176 nr
+邓皇后 5 nr
+邓石如 15 nr
+邓碧云 3 nr
+邓祖琳 3 nr
+邓福龙 3 nr
+邓禹位 2 nr
+邓稼先 36 nrfg
+邓绶林 47 nr
+邓美成 35 nr
+邓翠文 3 nr
+邓翠沉 2 nr
+邓肯 224 nr
+邓肯单 4 nr
+邓肯封 2 nr
+邓肯抢 7 nr
+邓肯接 2 nr
+邓肯跳 4 nr
+邓肯连 2 nr
+邓致新 3 nr
+邓艾之 6 nr
+邓艾兵 3 nr
+邓艾分 3 nr
+邓艾取 3 nr
+邓艾引 9 nr
+邓艾约 2 nr
+邓艾表 2 nr
+邓艾见 2 nr
+邓茂七 16 nr
+邓荫南 2 nr
+邓菊香 2 nr
+邓萃雯 3 nr
+邓蒂斯 2 nr
+邓裕强 3 nr
+邓贤寨 4 nr
+邓辅纶 2 nr
+邓辛张 3 nr
+邓里宝 15 nr
+邓金科 2 nr
+邓锡侯 6 nr
+邓长春 5 nr
+邓颖超 65 nr
+邓鸿勋 2 nr
+邕 47 ns
+邕剧 3 ns
+邕城 3 ns
+邕宁 7 ns
+邕宁县 13 ns
+邕江 16 ns
+邖 97 zg
+邗 20 ns
+邗江 3 ns
+邗江区 3 ns
+邗江县 4 ns
+邗沟 62 ns
+邘 8 zg
+邙 25 ns
+邙山 34 ns
+邙山区 3 ns
+邚 33 zg
+邛 79 ns
+邛崃 22 ns
+邛崃县 3 ns
+邛崃山 20 ns
+邛崃市 4 ns
+邛海 16 ns
+邝 36 nr
+邝天雄 14 nr
+邝宝官 3 nr
+邝小平 5 nr
+邝曰广 2 nr
+邝湛若 2 nr
+邝瑞露 2 nr
+邝美云 5 nr
+邝邺生 3 nr
+邠 15 zg
+邡 10 g
+邢 608 nr
+邢世忠 258 nr
+邢丫头 2 nr
+邢二夫人 2 nr
+邢先生 4 nr
+邢其毅 2 nr
+邢冉冉 3 nr
+邢台 222 ns
+邢台县 9 ns
+邢台市 23 ns
+邢国公 2 nr
+邢大姐 8 nr
+邢大舅 22 nr
+邢太医 32 nr
+邢夫人 247 nr
+邢妹妹 6 nr
+邢姐姐 6 nr
+邢姑娘 9 nr
+邢宇道 16 nr
+邢小杰 2 nr
+邢履庄 2 nr
+邢岫烟 16 nr
+邢岷山 3 nr
+邢州 14 ns
+邢州南 2 ns
+邢州龙 2 nr
+邢德全 10 nr
+邢救卫 2 nr
+邢树忠 2 nr
+邢照泉 4 nr
+邢爱英 2 nr
+邢玉飞 2 nr
+邢王二 41 nr
+邢秀银 2 nr
+邢贲思 2 nr
+邢进士 3 nr
+邢道荣 2 nr
+邢长春 2 nr
+那 111550 r
+那一军 2 nr
+那一刻 3 r
+那一剑 8 nr
+那一城 16 nr
+那一男 6 nr
+那一科 2 nr
+那丁莫 2 nr
+那七僧 2 nr
+那万圣 2 nr
+那万夫 5 nr
+那三弟 2 nr
+那三春 4 nr
+那不勒斯 154 ns
+那不就 3 l
+那丐妇 4 nr
+那丑汉 3 nr
+那世里 8 nr
+那东发 2 nr
+那东土 5 nr
+那东廊 2 nr
+那东珠 2 nr
+那个 14550 r
+那个游戏 3 l
+那丫头 21 nr
+那中堂 6 nr
+那丰儿 2 nr
+那串 3 nr
+那丹哈达 3 ns
+那丹炉 2 nr
+那举子 20 nr
+那么 18923 r
+那么些 52 r
+那么出色 3 l
+那么回事 3 l
+那么彩京 3 nr
+那么样 14 r
+那么点儿 4 r
+那义兄 16 nr
+那乔峰 4 nr
+那九曜 4 nr
+那也好 66 nr
+那乡姑 3 nr
+那书呆 2 nr
+那书生 48 nr
+那云逸 5 nr
+那云青 3 nr
+那云鹤 2 nr
+那五仙 2 nr
+那五儿 3 nr
+那亚尔 2 nr
+那亚河 5 nr
+那些 16360 r
+那人 3 r
+那人纳 2 nr
+那仕人 2 nr
+那仙器 2 nr
+那仙童 4 nr
+那仙长 3 nr
+那件 3 mq
+那件事 3 l
+那份 3 mq
+那伊修 16 nr
+那众僧 6 nr
+那众军 2 nr
+那伙 3 r
+那伙子 2 r
+那伙群 2 nr
+那会儿 225 r
+那会子 7 r
+那传译 8 nr
+那伯钦 3 nr
+那位 1919 r
+那佐领 3 nr
+那俊秀 2 nr
+那俊美 2 nr
+那俊色 2 nr
+那信递 2 nr
+那修灵 7 nr
+那修真 5 nr
+那僧官 3 nr
+那僧笑 3 nr
+那僧道 3 nr
+那儿 1947 r
+那兀颜 2 nr
+那元兵 9 nr
+那光艳 2 nr
+那克西 22 nr
+那兔儿 2 nr
+那八宝 2 nr
+那公子 25 nr
+那兴儿 2 nr
+那具男 2 nr
+那军汉 4 nr
+那冰魄 6 nr
+那凉凉 2 nr
+那凤姐 8 nr
+那凤鸣 2 nr
+那剑冢 2 nr
+那剑士 2 nr
+那剑斗 2 nr
+那剑横 2 nr
+那剑直 3 nr
+那剑谱 10 nr
+那化子 33 nr
+那区 3 r
+那十夫 2 nr
+那华山 4 ns
+那华服 2 nr
+那华筝 2 nr
+那厮 3 n
+那参领 3 nr
+那双 387 r
+那双久 2 nr
+那双明 2 nr
+那双竹 2 nr
+那双长 2 nr
+那口凤 2 nr
+那口子 9 nr
+那口玉 5 nr
+那古尸 7 nr
+那句话 3 c
+那叮叮 2 nr
+那可儿 2 nr
+那可奇 7 nr
+那可妙 4 nr
+那可真 36 nr
+那叶清 2 nr
+那司棋 3 nr
+那名参 2 nr
+那名章 2 nr
+那君臣 2 nr
+那哑梢 4 l
+那哗哗 2 nr
+那唐僧 2 nr
+那啸声 3 nr
+那回事 3 l
+那国 3 r
+那国丈 4 nr
+那国师 5 nr
+那圆峰 4 nr
+那圆真 3 nr
+那土兵 2 nr
+那圣僧 3 nr
+那场 364 mq
+那块 3 r
+那坡县 2 ns
+那坡里 3 ns
+那堪 8 nr
+那堪梦 2 nr
+那壁厢 16 nr
+那士子 2 nr
+那声儿 2 nr
+那大 395 ns
+那天 2224 r
+那太公 2 nr
+那太尉 2 nr
+那太监 11 nr
+那头陀 9 ns
+那如山 2 nr
+那妙玉 2 nr
+那姓云 10 nr
+那姓倪 5 nr
+那姓凤 6 nr
+那姓卫 2 nr
+那姓姬 4 nr
+那姓寿 5 nr
+那姓尹 2 nr
+那姓平 4 nr
+那姓康 2 nr
+那姓杨 28 nr
+那姓林 10 nr
+那姓梁 4 nr
+那姓梅 8 nr
+那姓滕 3 nr
+那姓瑞 4 nr
+那姓申 12 nr
+那姓程 3 nr
+那姓童 4 nr
+那姓舒 4 nr
+那姓范 2 nr
+那姓辛 10 nr
+那娇俏 3 nr
+那娇秀 7 nr
+那娘子 2 nr
+那婆子 104 nr
+那婆惜 6 nr
+那孙行 2 nr
+那它 3 r
+那宝光 2 nr
+那宝典 4 nr
+那宝官 14 nr
+那宝玉 19 nr
+那宝船 4 nr
+那宝象 2 nr
+那宝贝 7 nr
+那宝钗 2 nr
+那家 3 r
+那家伙 12 r
+那家子 10 nr
+那家铁 2 nr
+那密密 5 nr
+那富安 2 nr
+那寺僧 4 nr
+那尊藤 2 nr
+那尊银 5 nr
+那小丐 59 nr
+那小仆 2 nr
+那小仙 5 nr
+那小兵 8 nr
+那小兽 3 nr
+那小和尚 12 nr
+那小太监 10 nr
+那小女孩 14 nr
+那小子 19 nr
+那小官 10 nr
+那小巧 2 nr
+那小师 2 nr
+那小慧 3 nr
+那小木 2 nr
+那小校 10 nr
+那小沙弥 10 nr
+那小狐 2 nr
+那小王爷 5 nr
+那小瓶 2 nr
+那小白 3 nr
+那小童 5 nr
+那小红 10 nr
+那小舟 3 nr
+那小蛇 6 nr
+那小道士 4 nr
+那小释 6 nr
+那小锁 2 nr
+那小鬟 45 nr
+那小鹿 2 nr
+那小龙 12 nr
+那少林 3 nr
+那尔吉 2 nr
+那尔迈 2 nr
+那尔迪 2 nr
+那尖尖 3 nr
+那就好 3 l
+那就是说 3 c
+那就算了 3 l
+那尼庵 2 nr
+那层楼 3 nr
+那屠龙 8 nr
+那山客 3 nr
+那山洞 2 nr
+那巧姐儿 3 nr
+那巨岩 7 nr
+那巨虫 3 nr
+那巨钟 2 nr
+那师叔 2 nr
+那幅 125 r
+那干尸 4 nr
+那年 657 r
+那广目 2 nr
+那庄丁 2 nr
+那庄客 3 nr
+那弼马 2 nr
+那彩雪 2 nr
+那彪军 2 nr
+那径山 2 nr
+那御弟 5 nr
+那微末 2 nr
+那德加 4 nr
+那怎么行 3 l
+那怎生 6 nr
+那怒晴 3 nr
+那思摩 2 nr
+那恭谨 2 nr
+那恶僧 5 nr
+那悟净 2 nr
+那愚夫 3 nr
+那慧风 2 nr
+那成昆 5 nr
+那成精 2 nr
+那战甲 2 nr
+那才德 16 nr
+那才真 19 nr
+那扎格 3 nr
+那护法 3 nr
+那报子 2 nr
+那拉提 30 nr
+那拉氏 11 nr
+那掌旗 2 nr
+那放光 4 nr
+那救生 3 nr
+那散修 2 nr
+那文士 10 nr
+那文秀 9 nr
+那斯城 3 nr
+那方和尚 3 nr
+那方孔 2 nr
+那方怡 2 nr
+那无君 2 nr
+那日 754 r
+那日杨 4 nr
+那日武 2 nr
+那日震 2 nr
+那时 4465 r
+那时快 31 nr
+那时花开 3 l
+那明教 2 nr
+那明明 5 nr
+那星官 3 nr
+那春娇 3 nr
+那晚 183 r
+那普利 3 nr
+那晴雯 3 nr
+那曲 91 nr
+那曲县 6 ns
+那曲地区 21 ns
+那曲镇 3 nr
+那曼生 2 nr
+那朝奉 4 nr
+那期 3 r
+那木叉 4 nr
+那木梁 2 nr
+那木罕 21 nr
+那木鼎 2 nr
+那末 1100 t
+那本书 3 nr
+那朵会 2 nr
+那朵珠 2 nr
+那朵红 4 nr
+那李怀 2 nr
+那条 891 mq
+那杨志 2 nr
+那松烛 2 nr
+那板儿 4 nr
+那林任 2 nr
+那枝戟 3 nr
+那枝箭 15 nr
+那枝金 3 nr
+那柄倚 2 nr
+那柄刀 3 nr
+那柄剑 9 nr
+那柄金 3 nr
+那柄长 5 nr
+那柄飞 2 nr
+那柳丰 2 nr
+那栋 13 r
+那树洞 2 nr
+那株梅 3 nr
+那样 8812 r
+那样一来 3 l
+那样的话 73 l
+那根 213 mq
+那根木 5 nr
+那根筋 3 nr
+那根银 2 nr
+那梅香 2 nr
+那梢公 27 nr
+那梦中 5 nr
+那楚卿 7 nr
+那榆木 3 nr
+那次 644 r
+那款 3 r
+那段 382 r
+那殿阁 3 nr
+那毓贤 3 nr
+那水养 2 nr
+那汉 22 t
+那汉笑 2 nr
+那汝阳 2 nr
+那江州 2 ns
+那沙僧 3 nr
+那沙沙 3 ns
+那治情 2 nr
+那法王 3 nr
+那波利 4 nr
+那波帕 3 nr
+那波里 10 nr
+那洁静 2 nr
+那洪亮 2 nr
+那流云 2 nr
+那海洞 3 nr
+那海眼 2 nr
+那润叶 2 nr
+那溪极 2 nr
+那满山 3 nr
+那潇湘 3 nr
+那潭 2 ns
+那灵官 2 nr
+那灵狐 2 nr
+那灵霄 2 nr
+那焙茗 2 nr
+那焚尸 4 nr
+那狐 9 nz
+那狐媚 9 nr
+那狗子 3 nr
+那狗官 9 nr
+那狗日 8 nr
+那狗洞 2 nr
+那猛力 2 nr
+那猛汉 6 nr
+那献王 5 nr
+那玄冥 3 nr
+那玄铁 2 nr
+那玉凤 4 nr
+那玉函 2 nr
+那玉山 2 nr
+那玉帝 3 nr
+那玉眼 2 nr
+那玉红 16 nr
+那王庆 3 nr
+那珠囊 2 nr
+那珠母 2 nr
+那班儿 2 nr
+那琦针 5 nr
+那琪官 2 nr
+那琴造 2 nr
+那琼英 3 nr
+那瑛姑 8 nr
+那瓶玉 2 nr
+那甜甜 3 nr
+那田伯 2 nr
+那画儿 3 nr
+那留斯 4 nr
+那番僧 5 nr
+那瘦道人 2 nr
+那白衫 2 nr
+那百夫 4 nr
+那盏 3 nz
+那盘棋 3 nr
+那真仙 4 nr
+那真君 2 nr
+那知刚 2 nr
+那知客 3 nr
+那知杨 13 nr
+那石宝 2 nr
+那石崖 4 nr
+那石枕 2 nr
+那石椁 5 nr
+那石洞 2 nr
+那碧蚕 2 nr
+那社友 2 nr
+那社尔 6 nr
+那祖千秋 3 nr
+那神光 2 nr
+那神兵 2 nr
+那神木 2 nr
+那神箭 2 nr
+那禁子 2 nr
+那禅师 3 nr
+那福公子 2 nr
+那离群 16 nr
+那秀士 6 nr
+那秋桐 2 nr
+那种 4377 r
+那科 2 r
+那秘笈 2 nr
+那秦安 2 nr
+那秦钟 2 nr
+那程英 2 nr
+那窝儿 2 nr
+那童儿 5 nr
+那童兆 2 nr
+那竹梯 5 nr
+那竹棒 3 nr
+那笔 3 r
+那笛声 3 nr
+那管家 4 l
+那箱 3 nz
+那粒红 2 nr
+那紫微 2 nr
+那紫文 36 nr
+那紫衣 6 nr
+那紫衫 6 nr
+那紫金 3 nr
+那紫鹃 4 nr
+那红云 2 nr
+那红布 5 nr
+那红玉 4 nr
+那红马 11 nr
+那纬宇 2 nr
+那纳克 2 nr
+那绢子 3 nr
+那绳儿 2 nr
+那维亚 9 nr
+那绿火 4 nr
+那绿竹 3 nr
+那绿衫 18 nr
+那罗刹 10 nr
+那美妇 22 nr
+那群人 3 nr
+那群狗 2 nr
+那群玉 5 nr
+那老僧 80 nr
+那老儿 48 nr
+那老军 3 nr
+那老君 4 nr
+那老龙 4 nr
+那耶律 8 nr
+那聪辩 2 nr
+那育府 2 nr
+那脸儿 2 nr
+那舟子 4 nr
+那般 203 r
+那舵主 3 nr
+那艮岳 2 nr
+那花豹 2 nr
+那芳官 2 nr
+那英俊 2 nr
+那荒谷 8 nr
+那荣府 2 nr
+那莽夫 2 nr
+那萨沙 3 nr
+那蓉儿 4 nr
+那蓝衫 5 nr
+那蕾蕾 3 nr
+那藏僧 7 nr
+那虎力 5 nr
+那虞候 3 nr
+那蚕儿 8 nr
+那蜂儿 2 nr
+那行 3 r
+那西亚斯 16 ns
+那观山 2 nr
+那识君 2 nr
+那话儿 11 nr
+那谷主 4 nr
+那豪仆 2 nr
+那貂儿 11 nr
+那贤臣 2 nr
+那贵公子 18 nr
+那贵官 16 nr
+那赞礼 5 nr
+那赤练 13 nr
+那越儿 2 nr
+那身 3 r
+那车 3 r
+那辆车 3 n
+那边 1871 r
+那辽兵 2 nr
+那达尔 4 nr
+那达慕 29 nr
+那还用说 3 l
+那道人 54 nr
+那道士 21 nr
+那道婆 2 nr
+那道旨 2 nr
+那道石 2 nr
+那道童 2 nr
+那道锈 2 nr
+那郑克 2 nr
+那郡侯 13 nr
+那部 3 r
+那里 13132 r
+那金兵 3 nr
+那金刚 4 nr
+那金叶子 2 nr
+那金桂 4 nr
+那金球 2 nr
+那金甲 2 nr
+那金花 6 nr
+那金蛇 6 nr
+那金轮 8 nr
+那针儿 3 nr
+那铁头 4 nr
+那铁拐 2 nr
+那铁枪 2 nr
+那铁蛇 2 nr
+那铁跃 3 nr
+那铜尸 2 nr
+那铜鼎 4 nr
+那银铃 2 nr
+那锋利 2 nr
+那锦帕 7 nr
+那锦衫 3 nr
+那锦鳞 6 nr
+那镖旗 3 vn
+那长发 2 nr
+那长汉 4 nr
+那长眉 5 nr
+那长老 27 nr
+那门儿 2 r
+那间 3 r
+那队 3 r
+那阵儿 27 nr
+那阵子 74 nr
+那陈九 2 nr
+那陈清 3 nr
+那陵提 2 nr
+那雀儿 2 nr
+那雄伟 3 nr
+那雄雕 7 nr
+那雨越 2 nr
+那雪亮 2 nr
+那雪雁 3 nr
+那霸市 5 nr
+那青砖 3 nr
+那青翼 2 nr
+那青衫 8 nr
+那青跃 2 nr
+那青骢 3 nr
+那青鳞 4 nr
+那青龙 3 nr
+那静如 2 nr
+那顶蓝 2 nr
+那项 3 r
+那颗丹 3 nr
+那颗星 3 nr
+那飞云 2 nr
+那首歌 3 nr
+那香菱 3 nr
+那马 230 ns
+那高俅 4 nr
+那魔闻 2 nr
+那鸣声 2 nr
+那黄衫 6 nr
+那黑沙 2 nr
+那黛玉 14 nr
+那鼎盖 3 nr
+那龙家 2 nr
+那龙岭 2 nr
+那龙符 2 nr
+那龙虎 2 nr
+那龙象 3 nr
+那龙马 2 nr
+那龟奴 3 nr
+邦 5417 ng
+邦交 67 n
+邦交国 3 n
+邦克 24 nrt
+邦克山 3 nrt
+邦加 23 nrt
+邦加岛 2 ns
+邦国 3 ns
+邦国殄瘁 3 v
+邦土 3 n
+邦基 3 nrt
+邦奇 10 nrt
+邦定机 3 n
+邦尼 11 nrt
+邦尼奇 4 nrt
+邦弗雷 3 nrt
+邦彦 3 nrt
+邦德 18 nrt
+邦德维克 2 nrt
+邦戈 4 nrt
+邦政府 48 n
+邦斯 3 nrt
+邦本 3 n
+邦杰 4 nrt
+邦板牙 3 ns
+邦特 5 nrt
+邦畿 3 nrt
+邦联 57 ns
+邦达 5 nrt
+邦达连科 5 nrt
+邦迪 7 nz
+邦阿西楠 3 nr
+邨 16 zg
+邩 52 zg
+邪 1979 a
+邪不伐正 3 i
+邪不压正 2 i
+邪不干正 3 i
+邪不敌正 3 i
+邪不犯正 3 i
+邪不胜正 6 i
+邪世 3 n
+邪乎 20 a
+邪佞 2 n
+邪僻 3 a
+邪劲 3 a
+邪妄 3 a
+邪心 7 n
+邪念 37 n
+邪性 10 n
+邪恶 285 a
+邪恶之都 3 n
+邪恶势力 3 i
+邪恶轴心 3 l
+邪教 96 n
+邪教徒 3 n
+邪教组织 3 l
+邪术 94 n
+邪气 160 n
+邪法 3 n
+邪淫 3 a
+邪神 3 n
+邪祟 23 a
+邪脸 3 n
+邪臣 3 n
+邪虎 3 n
+邪行 2 n
+邪见 3 a
+邪计 3 n
+邪语 3 n
+邪说 42 n
+邪说异端 3 l
+邪谲 3 a
+邪财 3 n
+邪路 25 n
+邪辟 3 a
+邪途 3 n
+邪道 33 n
+邪门 3 n
+邪门儿 3 n
+邪门歪道 11 l
+邪风 5 n
+邪鬼 3 n
+邪魔 57 n
+邪魔外祟 3 i
+邪魔外道 57 i
+邪魔怪道 3 i
+邪魔歪道 4 i
+邬 300 nr
+邬中和 3 nr
+邬作霖 7 nr
+邬倩倩 3 nr
+邬君临 8 nr
+邬君梅 3 nr
+邬国舅 3 nr
+邬思道 3 nr
+邬桥真 2 nr
+邬梨依 2 nr
+邬梨国 5 nr
+邬翊光 3 nr
+邬贺铨 2 nr
+邮 402 n
+邮亭 6 n
+邮件 436 n
+邮件信箱 3 n
+邮件地址 3 n
+邮件系统 3 n
+邮件门 3 n
+邮件附件 3 n
+邮传部 3 n
+邮储 3 j
+邮出 3 v
+邮到 3 v
+邮务 9 n
+邮包 20 n
+邮区 3 n
+邮去 3 v
+邮发 4 j
+邮品 11 n
+邮售 3 vn
+邮商 3 n
+邮坛 3 n
+邮寄 105 v
+邮寄汇票 3 n
+邮寄费 2 n
+邮局 199 n
+邮展 19 vn
+邮差 13 n
+邮币 2 n
+邮币卡 3 n
+邮市 2 n
+邮戳 31 n
+邮戳为凭 3 v
+邮报 79 n
+邮政 873 n
+邮政代办 3 nt
+邮政信箱 3 n
+邮政储汇局 7 nt
+邮政储蓄 3 n
+邮政储金 3 n
+邮政划拨 3 v
+邮政局 45 nt
+邮政局长 3 n
+邮政工作 3 n
+邮政总局 3 nt
+邮政所 14 nt
+邮政法 3 n
+邮政编码 599 n
+邮政网 5 n
+邮政车 2 n
+邮来 3 v
+邮汇 3 n
+邮汇局 3 nt
+邮电 514 j
+邮电业 13 n
+邮电大学 3 nt
+邮电学院 3 nt
+邮电局 55 nt
+邮电所 13 nt
+邮电报 3 n
+邮电费 3 n
+邮电通信 3 nt
+邮电通讯 3 nt
+邮电部 57 nt
+邮电部门 3 n
+邮盘 3 n
+邮码 3 n
+邮票 349 n
+邮票夹 3 n
+邮票迷 3 n
+邮科院 256 nt
+邮筒 11 n
+邮箱 81 n
+邮箱地址 3 n
+邮编 377 n
+邮编地址 3 n
+邮船 13 n
+邮花 3 n
+邮袋 8 n
+邮购 22 v
+邮购价格 3 n
+邮购品 3 n
+邮购目录 3 n
+邮购部 3 n
+邮费 13 n
+邮费付讫 3 n
+邮资 32 n
+邮资封 3 n
+邮资已付 3 n
+邮资片 3 n
+邮走 3 v
+邮路 25 n
+邮车 16 n
+邮轮 104 n
+邮运 3 n
+邮迷 3 n
+邮递 19 v
+邮递区号 3 n
+邮递员 44 n
+邮通 7 n
+邮集 3 n
+邯 90 ns
+邯山区 3 ns
+邯郸 272 ns
+邯郸匍匐 3 v
+邯郸县 6 ns
+邯郸学步 9 i
+邯郸市 22 ns
+邯郸路 3 ns
+邯郸重步 3 i
+邯郸钢铁集团 2 nt
+邯钢 53 n
+邰 19 nr
+邰丽华 266 nr
+邰正宵 3 nr
+邱 282 nr
+邱为铎 3 nr
+邱义仁 2 nr
+邱乙郎 2 nr
+邱于庭 3 nr
+邱仕健 2 nr
+邱会作 5 nr
+邱俊介 3 nr
+邱先生 2 nr
+邱公公 34 nr
+邱兴隆 5 nr
+邱创焕 2 nr
+邱北县 2 nr
+邱占祥 2 nr
+邱吉尔 18 nr
+邱吉彩 2 nr
+邱四毛 62 nr
+邱四豪 256 nr
+邱国栋 2 nr
+邱处机 13 nr
+邱娥国 9 ns
+邱宝仁 4 nr
+邱宝昌 10 nr
+邱小乙 5 nr
+邱少云 39 nr
+邱山风 4 nr
+邱岳峰 3 nr
+邱巡抚 2 nr
+邱巧萍 4 nr
+邱延鹏 2 nr
+邱弘济 3 nr
+邱得用 44 nr
+邱心志 3 nr
+邱文珍 13 nr
+邱晓华 10 nr
+邱晓昀 2 nr
+邱朝震 3 nr
+邱树森 14 nr
+邱民仰 28 nr
+邱永峥 5 nr
+邱永明 2 nr
+邱洁明 3 nr
+邱洪标 2 nr
+邱淑贞 3 nz
+邱清泉 11 nr
+邱琪雯 3 nr
+邱祥林 3 nr
+邱红杰 2 nr
+邱绪民 9 nr
+邱绵德 2 nr
+邱茂华 3 nr
+邱道人 3 nr
+邲 9 zg
+邳 78 ns
+邳县 18 ns
+邳州 15 ns
+邳州市 4 ns
+邳苍 7 ns
+邴 5 nr
+邴元真 4 nr
+邵 181 nr
+邵东 3 nr
+邵东县 3 ns
+邵云环 2 nr
+邵亦波 2 nr
+邵仲光 8 nr
+邵仲衡 3 nr
+邵伯湖 3 nr
+邵伯诸 3 nr
+邵伯镇 2 nr
+邵佳一 74 nr
+邵元冲 3 nr
+邵力子 8 nr
+邵力平 2 nr
+邵华泽 24 nr
+邵友濂 8 nr
+邵员外 33 nr
+邵大侠 594 nr
+邵大哥 6 nr
+邵大官人 7 nr
+邵大爷 2 nr
+邵大箴 3 nrfg
+邵太太 5 nr
+邵婷婷 6 nr
+邵宏来 3 nr
+邵宏渊 2 nr
+邵巡抚 3 nr
+邵康节 5 nr
+邵建武 4 nr
+邵循正 6 nr
+邵抚之 2 nr
+邵抚台 3 nr
+邵捷春 22 nr
+邵时信 154 nr
+邵时昌 24 nr
+邵昌浩 4 nr
+邵明立 9 nr
+邵晋涵 3 nr
+邵武 34 nr
+邵武市 4 ns
+邵永东 3 nr
+邵洵美 3 nr
+邵炜刚 3 nr
+邵燕君 2 nr
+邵燕祥 5 nr
+邵琪伟 24 nr
+邵科馆 2 nr
+邵维正 3 nr
+邵美琪 5 nr
+邵肇复 6 nr
+邵荃麟 5 nr
+邵远平 3 nr
+邵逸夫 16 nr
+邵醉翁 2 nr
+邵阳 55 nr
+邵阳县 9 ns
+邵阳市 14 ns
+邵陵厉 2 nr
+邵雍 10 nr
+邵飘萍 138 nr
+邶 24 g
+邸 334 nr
+邸前治 2 nr
+邸宅 12 nr
+邸钡囊 2 nr
+邸阁 3 nr
+邹 108 nr
+邹一桂 3 nr
+邹伯奇 12 nr
+邹侑根 67 nr
+邹元标 32 nr
+邹先彪 2 nr
+邹先生 2 nr
+邹冈 3 ns
+邹县 17 ns
+邹可仁 92 nr
+邹哲开 3 nr
+邹城 7 nr
+邹城市 14 ns
+邹声文 4 nr
+邹太太 22 nr
+邹家 4 nrfg
+邹家华 61 nr
+邹容 50 nr
+邹容著 2 nr
+邹尔均 2 nr
+邹平 8 nr
+邹平南 2 ns
+邹平县 5 ns
+邹应龙 16 nr
+邹德华 2 nr
+邹德浩 16 nr
+邹志刚 3 nr
+邹志华 2 nr
+邹承鲁 2 nr
+邹振民 3 nr
+邹春兰 3 nr
+邹晓东 2 nr
+邹晓春 4 nr
+邹普胜 17 nr
+邹武装 2 nr
+邹汉青 4 nr
+邹沅帆 2 nr
+邹渊领 2 nr
+邹爱国 2 nr
+邹玉川 2 nr
+邹玉麟 2 nr
+邹秉文 3 nr
+邹缨齐紫 3 nr
+邹老爹 2 nr
+邹荻帆 3 nr
+邹衍 18 nr
+邹衍谈天 3 nr
+邹远东 256 nr
+邹逸麟 21 nr
+邹靖华 2 nr
+邹靖引 3 nr
+邹韬奋 46 nrfg
+邹高阳 256 nr
+邺 335 g
+邺架之藏 3 v
+邻 1937 n
+邻二甲苯 3 nz
+邻人 64 n
+邻人们 2 n
+邻伍 3 n
+邻位效应 3 n
+邻分泌 3 n
+邻县 25 n
+邻国 556 n
+邻域 20 n
+邻基参与 3 n
+邻境 3 n
+邻女窥墙 3 n
+邻女詈人 3 vn
+邻室 3 n
+邻家 37 n
+邻家女孩 3 n
+邻层影响 3 n
+邻居 613 v
+邻居们 3 n
+邻居家 26 n
+邻座 23 n
+邻接 93 v
+邻接矩阵 3 nz
+邻接面 3 n
+邻村 57 n
+邻桌 10 n
+邻水 3 n
+邻水县 3 n
+邻海 3 n
+邻省 25 n
+邻舍 95 n
+邻苯二甲酸 17 nz
+邻苯二甲酸氢钾 2 nz
+邻苯二甲酸酐 24 nz
+邻苯二酚 13 nz
+邻角 3 n
+邻边 3 n
+邻近 888 v
+邻近地区 3 n
+邻邦 263 n
+邻里 94 n
+邻里公园 3 n
+邻里关系 3 n
+邻里单位 3 n
+邻里纠纷 3 z
+邻长 3 n
+邻面接触 3 n
+邻面轴沟 3 n
+邻顶点 3 n
+邽 21 zg
+邾 37 g
+郁 181 nr
+郁久化 2 nr
+郁之策 3 nr
+郁仁存 2 nr
+郁伟华 3 nr
+郁保四 26 nr
+郁先生 2 nr
+郁光标 33 nr
+郁化 10 v
+郁化火 5 nr
+郁南 3 nr
+郁南县 3 nr
+郁塞 3 nr
+郁师兄 4 nr
+郁律 2 n
+郁怒伤 4 i
+郁怒难 3 i
+郁悒 9 a
+郁愤 8 a
+郁慕明 3 nr
+郁抑 3 v
+郁新卒 3 nr
+郁李仁 2 nr
+郁林郡 4 nr
+郁气 3 n
+郁气结 2 nr
+郁江 43 nr
+郁滞 12 a
+郁烈 3 a
+郁热 10 a
+郁然 4 z
+郁积 82 n
+郁结 64 a
+郁罗迦 2 nr
+郁美净 3 nr
+郁而激 4 nr
+郁血 3 n
+郁达夫 34 nr
+郁郁 127 a
+郁郁不乐 36 i
+郁郁寡欢 58 i
+郁郁沉沉 3 z
+郁郁累累 3 z
+郁郁而终 7 i
+郁郁芊芊 3 nr
+郁郁苍苍 19 z
+郁郁葱葱 62 i
+郁金 7 n
+郁金香 61 nr
+郁钧剑 2 nr
+郁闭 12 v
+郁闭度 6 n
+郁闷 467 a
+郁闷不乐 3 i
+郁闷死 3 i
+郁陵岛 2 nr
+郁黑 3 z
+郃 261 zg
+郄 20 zg
+郅 186 g
+郅振璞 4 nr
+郇 9 nr
+郊 510 s
+郊区 668 s
+郊区农业 3 n
+郊区化 7 n
+郊区县 11 n
+郊区居民 3 n
+郊区景观 3 n
+郊区绿地 3 n
+郊原 3 n
+郊县 39 n
+郊外 289 s
+郊寒岛瘦 3 i
+郊游 39 n
+郊甸 3 n
+郊祀 3 v
+郊野 65 n
+郎 1978 nr
+郎与纯 2 nr
+郎世宁 6 nr
+郎中 457 nr
+郎之万 2 nr
+郎书奇 3 nr
+郎侯多 4 nr
+郎侯迎 2 nr
+郎刘林 2 nr
+郎卡郡 29 nr
+郎君 309 nr
+郎吴硕 2 nr
+郎员主 3 nr
+郎周世 2 nr
+郎周顺 3 nr
+郎和嘉 3 nr
+郎和松 2 nr
+郎咸平 16 nr
+郎咸芬 2 nr
+郎国灭 4 nr
+郎大佐 2 nr
+郎大将 2 nr
+郎家取 2 nr
+郎家庄 2 nr
+郎师傅 3 nr
+郎平 19 nr
+郎廷佐 7 nr
+郎当 3 nr
+郎心 3 n
+郎心似铁 3 nr
+郎才女姿 3 nr
+郎才女貌 21 nr
+郎才珠 6 nr
+郎效农 2 nr
+郎族 2 n
+郎朗 12 nr
+郎木寺 2 nr
+郎机 4 n
+郎束皙 2 nr
+郎杨仁 2 nr
+郎杰雪 3 nr
+郎格尔 2 nr
+郎毓秀 2 nr
+郎气 2 n
+郎海军 3 nr
+郎溪 2 nr
+郎溪县 3 nr
+郎王兴 4 nr
+郎石秀 3 nr
+郎秦钟 2 nr
+郎立国 2 nr
+郎署 2 n
+郎舅 9 nr
+郎艾穆 4 nr
+郎蔡邕 5 nr
+郎费罗 3 nr
+郎赵彦 2 nr
+郎转祠 2 nr
+郎酒 3 n
+郎酒厂 2 n
+郎金学 2 nr
+郎陆琼 2 nr
+郎陈诚 2 nr
+郎顾宪 2 nr
+郏 98 nr
+郏县 16 ns
+郐 12 g
+郐下无讥 3 nr
+郑 1551 ns
+郑一钧 4 nr
+郑七灭 3 nr
+郑万通 8 nr
+郑三娘 48 nr
+郑下寨 2 nr
+郑世横 2 nr
+郑东发 2 nr
+郑东新 3 nr
+郑东焕 3 nr
+郑东红 2 nr
+郑中基 3 nr
+郑丰喜 2 nr
+郑丹瑞 3 nr
+郑为元 4 nr
+郑丽媛 3 nr
+郑丽文 3 nr
+郑之珍 4 nr
+郑之瑞 2 nr
+郑买嗣 2 nr
+郑二公子 8 nr
+郑于鹤 8 nr
+郑京和 2 ns
+郑京平 4 ns
+郑亲王 119 nr
+郑人买履 2 nr
+郑人争年 3 nr
+郑人实履 3 nr
+郑人照 2 nr
+郑人铸 2 nr
+郑介民 3 nr
+郑伊健 3 nr
+郑伯克 2 nr
+郑伯奇 8 nr
+郑作新 6 nrfg
+郑佩佩 3 nr
+郑佳明 2 nr
+郑俊怀 5 nr
+郑俊浩 3 nr
+郑健英 2 nr
+郑元勋 139 nr
+郑元和 3 nr
+郑元畅 3 nr
+郑先生 6 nr
+郑光祖 14 nr
+郑光芝 3 nrfg
+郑克 467 ns
+郑克晟 4 nr
+郑克爽 3 nr
+郑公子 121 nr
+郑公爷 2 nr
+郑其贵 9 nr
+郑养性 5 nr
+郑冬梅 2 nr
+郑凤荣 5 nr
+郑则仕 3 nr
+郑则士 3 nr
+郑功成 261 nr
+郑勋铎 3 nr
+郑匡国 5 nr
+郑华玲 2 nr
+郑卫之音 4 nr
+郑卫国 25 ns
+郑卫桑间 3 ns
+郑卫莉 3 nr
+郑吉发 2 nr
+郑吉至 2 nr
+郑君里 9 nr
+郑周永 7 nr
+郑和 479 nrfg
+郑和奉 5 nr
+郑和宝 7 nr
+郑和曾 2 nr
+郑和环 3 ns
+郑和群 5 nr
+郑哲敏 2 nr
+郑商所 2 nt
+郑嘉栋 5 nr
+郑国公 3 nr
+郑国公子 2 nt
+郑国江 3 nr
+郑国泰 27 nr
+郑国渠 20 nr
+郑国良 2 nr
+郑国锠 3 nz
+郑国鸿 3 nr
+郑培敏 8 nr
+郑士利 8 nr
+郑士琦 2 nr
+郑士良 35 nr
+郑声乱雅 3 i
+郑复光 4 nr
+郑多彬 3 i
+郑大人 2 nr
+郑大官人 6 nr
+郑天寿 35 nr
+郑天挺 29 nr
+郑天翔 3 nr
+郑太原 3 nr
+郑太性 3 nr
+郑奎飞 3 nr
+郑婉雯 3 nr
+郑子取 4 nr
+郑孝胥 12 nr
+郑孟印 2 nr
+郑学勤 2 nr
+郑学定 2 nr
+郑宇成 3 nrfg
+郑守成 2 nrfg
+郑安平 6 nr
+郑宏范 5 nr
+郑定公 2 nr
+郑家 288 nrfg
+郑家二 2 nr
+郑家屯 3 nr
+郑家庄村 3 ns
+郑家榆 3 nr
+郑家生 3 nr
+郑家纯 2 nr
+郑小姐 12 nr
+郑小瑛 3 nr
+郑小秋 3 nr
+郑小聪 3 nr
+郑小锁 2 nr
+郑小龙 2 nr
+郑少师 2 nr
+郑少忠 2 nr
+郑少秋 3 nr
+郑尚书 2 nr
+郑尚宫 10 nr
+郑屠家 4 nr
+郑屠那 3 nr
+郑岛主 8 nr
+郑岩松 3 nr
+郑崇俭 72 nr
+郑州 833 ns
+郑州商品交易所 2 nt
+郑州大学 16 nt
+郑州市 117 ns
+郑州市政府 2 nt
+郑州火车站 20 nt
+郑州路 3 ns
+郑州铁路局 8 nt
+郑师姊 2 nr
+郑希怡 3 nr
+郑广文 2 nr
+郑庄公 11 nr
+郑府众 7 nr
+郑府伴 5 nr
+郑康公 3 nr
+郑廷奇 14 nr
+郑建仙 8 nr
+郑建军 3 nr
+郑建卫 2 nr
+郑律成 5 nr
+郑德刚 3 nr
+郑德成 5 nrfg
+郑必坚 7 nr
+郑志辉 2 nr
+郑思肖 4 nr
+郑惠玉 3 nr
+郑愁予 3 nr
+郑成功 289 nrfg
+郑承军 11 nr
+郑振环 3 nr
+郑振瑶 2 nr
+郑振铎 39 nr
+郑文公 10 nr
+郑文宝 2 nr
+郑文雅 3 nr
+郑文龙 3 nr
+郑斯林 4 nr
+郑新玮 3 nrfg
+郑新立 8 nr
+郑方贤 22 nr
+郑明军 2 nr
+郑明明 3 nr
+郑明熙 3 nr
+郑易里 3 ns
+郑春华 2 nr
+郑昭宋聋 3 nr
+郑昱闽 3 nr
+郑晓丽 3 nr
+郑晓京 207 nr
+郑晓宁 3 nr
+郑智化 5 nr
+郑智带 3 nr
+郑智直 2 nr
+郑智薰 3 nr
+郑有备 2 nrfg
+郑望之 11 nr
+郑朝铨 2 nr
+郑李辉 256 nr
+郑村坝 5 nr
+郑村祺 3 nr
+郑板桥 34 nrfg
+郑林国 3 ns
+郑柏顺 2 nr
+郑某挺 2 nr
+郑根东 3 ns
+郑梦熊 2 nr
+郑楚光 2 nr
+郑欣宜 3 nr
+郑正秋 17 nr
+郑武公 8 nr
+郑氏佚 2 nr
+郑氏抗 2 nr
+郑氏治 2 nr
+郑氏集团 3 nt
+郑汝成 3 nrfg
+郑法士 2 nr
+郑注合 3 nr
+郑洁均 2 nr
+郑洁捧 2 nr
+郑洞国 7 ns
+郑浩南 3 ns
+郑海楼 2 ns
+郑海泉 2 nr
+郑海现 2 nr
+郑海霞 4 nr
+郑渊洁 3 nr
+郑炎甫 11 nr
+郑焕清 2 nr
+郑燕文 3 nr
+郑燕玲 3 nr
+郑爱华 3 nr
+郑爱新 3 nr
+郑玄 53 nr
+郑玄注 9 nr
+郑王爷 33 nr
+郑瑞晓 3 nr
+郑甘培 4 nr
+郑白渠 5 nr
+郑皇后 21 nr
+郑福成 4 nrfg
+郑秀文 4 nr
+郑科伟 57 nr
+郑科扬 19 nr
+郑穆公 4 nr
+郑筱萸 5 nr
+郑简公 7 nr
+郑素英 2 nr
+郑经部 2 nt
+郑绪岚 2 nr
+郑美珠 2 nr
+郑而重 2 i
+郑联军 2 nt
+郑肖庄 256 nr
+郑背楚 2 nr
+郑若曾 2 nr
+郑蛟麟 2 nr
+郑裕庆 7 nr
+郑裕彤 15 nrfg
+郑裕玲 3 nr
+郑观应 8 nr
+郑贵妃 131 nr
+郑起云 26 nr
+郑超宗 14 nr
+郑超麟 3 nr
+郑进一 3 nr
+郑道人 2 nrfg
+郑道昭 3 nr
+郑遵谦 5 nr
+郑邦玉 4 nr
+郑重 711 a
+郑重其事 100 i
+郑重其辞 3 i
+郑重声明 3 nr
+郑重宣布 3 nr
+郑金发 2 nr
+郑钦谕 4 nr
+郑镖头 27 vn
+郑长庆 3 nr
+郑长老 17 nr
+郑雨庭 3 nr
+郑雪儿 3 nr
+郑韶婕 3 nr
+郑魔君 13 nr
+郑鸿业 6 nr
+郑鸿逵 4 nr
+郑鹤声 11 nr
+郑鹤龄 4 nr
+郓 101 ns
+郓城 42 ns
+郓城县 77 ns
+郕 7 zg
+郗恩庭 4 nr
+郛 20 g
+郜 27 nr
+郝 294 nr
+郝一标 153 nr
+郝劭文 3 nr
+郝友好 2 nr
+郝员外 8 nr
+郝和平 5 nr
+郝国祥 3 nr
+郝大勇 3 nr
+郝大哥 4 nr
+郝大手 23 nr
+郝大通 233 nr
+郝天挺 2 nr
+郝太监 3 nr
+郝如本 3 nr
+郝家庄 2 nr
+郝寿臣 12 nr
+郝将爷 2 nr
+郝师叔 2 nr
+郝师弟 14 nr
+郝建恒 4 nr
+郝建秀 7 nr
+郝思嘉 4 nr
+郝思平 10 nr
+郝思文 47 nr
+郝振基 2 nr
+郝振省 4 nr
+郝摇旗 360 nr
+郝效忠 3 nr
+郝昭守 3 nr
+郝昭病 4 nr
+郝曼丽 3 nr
+郝柏村 11 nr
+郝梦笔 2 nr
+郝梦龄 3 nr
+郝海东 41 nr
+郝渊侃 3 nr
+郝爱国 49 nr
+郝璐璐 3 nr
+郝的道人 2 nr
+郝红梅 97 nr
+郝美玲 4 nr
+郝老板 6 nr
+郝老爷 18 nr
+郝连叹 2 nr
+郝连和 4 nr
+郝连道 5 nr
+郝道长 2 nr
+郝邵文 3 nr
+郝麦收 4 nr
+郞 2 zg
+郠 241 zg
+郡 9988 n
+郡主 473 n
+郡候 3 n
+郡县 245 ns
+郡县制 306 n
+郡县制度 3 n
+郡吏 3 n
+郡国 3 ns
+郡守 76 n
+郡尉 6 n
+郡王 205 n
+郡王府 4 n
+郡长 3 n
+郢 1113 g
+郢中白雪 3 ns
+郢书燕说 3 vn
+郢人斤斧 3 nz
+郢人斤斫 3 nr
+郢人斫垩 3 n
+郢匠挥斤 3 n
+郢州 271 ns
+郤 7 zg
+郤诜丹桂 3 nz
+郤诜高第 3 v
+郦 14 nr
+郦家驹 2 nr
+郦寄击 3 nr
+郦寄攻 2 nr
+郦道元 18 nrfg
+郦飞云 2 nr
+郦食其 7 nr
+郧 570 ns
+郧县 270 ns
+郧县人 4 n
+郧西 11 ns
+郧西县 258 ns
+郧阳 2191 ns
+部 13579 n
+部下 900 n
+部件 700 n
+部件是否 2 n
+部件编码 3 n
+部份 28 n
+部优 4 n
+部会 3 n
+部会首长 3 n
+部位 1984 n
+部党组 37 n
+部分 27619 n
+部分冠 3 n
+部分加电 3 n
+部分合子 3 n
+部分合成 3 n
+部副 58 n
+部发 3 n
+部员 3 n
+部品 3 n
+部头 6 n
+部奖 3 n
+部委 964 n
+部委局 3 n
+部委级 3 n
+部将 323 n
+部属 1126 n
+部属工作 3 n
+部属院校 3 n
+部族 643 n
+部标 4 n
+部省级 2 n
+部类 1137 n
+部级 158 n
+部署 3333 n
+部落 2021 n
+部落币 3 n
+部落社会 3 n
+部落领土 3 n
+部里 118 n
+部长 5654 n
+部长会议 155 n
+部长级 62 n
+部长职务 3 n
+部门 16543 n
+部门人呢 3 n
+部门化 2 n
+部门法 30 n
+部门级 4 n
+部门经理 3 n
+部门规章 3 n
+部队 12400 n
+部队长 17 n
+部队驻防 3 vn
+部际 10 n
+部院 3 n
+部颁 5 vn
+部颁标准 3 v
+部首 43 n
+郪 112 zg
+郫 18 ns
+郫县 42 ns
+郭 3318 nr
+郭万有 8 nr
+郭世兄 13 nr
+郭世广 4 nr
+郭东坡 2 nr
+郭东文 3 nr
+郭东木 9 nr
+郭中姚 296 nr
+郭为笑 2 nr
+郭丽丽 4 nr
+郭二人 4 nr
+郭云龙 41 nr
+郭京花 4 nr
+郭从谦 3 nr
+郭令公 2 nr
+郭仲华 3 nr
+郭仲荀 2 nr
+郭任远 2 nr
+郭伟成 2 nr
+郭伯雄 12 nr
+郭保山 5 nr
+郭允泰 3 nr
+郭允能 4 nr
+郭元振 2 nr
+郭兄弟 5 nr
+郭先生 5 nr
+郭先臣 2 nr
+郭全宝 2 nr
+郭公破 3 nr
+郭兰英 4 nr
+郭兴华 4 nr
+郭冬临 3 nr
+郭凡生 13 nr
+郭凤岐 2 nr
+郭凤莲 257 nr
+郭利君 2 nr
+郭力群 4 nr
+郭勒县 5 nr
+郭勒河 7 nr
+郭化若 3 nr
+郭南垣 2 nr
+郭卫华 9 nr
+郭可盈 3 nr
+郭台铭 3 nr
+郭名襄 3 nr
+郭启光 6 nr
+郭启宏 3 nr
+郭品君 3 nr
+郭品文 2 nr
+郭啸天 77 nr
+郭善明 4 nr
+郭嘉入 2 nr
+郭図 3 ns
+郭国三 2 nr
+郭图谓 2 nr
+郭圣通 84 nr
+郭城 15 nr
+郭士立 3 nr
+郭士纳 2 nr
+郭外峰 4 nr
+郭大侠 156 nr
+郭大力 4 nr
+郭大哥 13 nr
+郭大官人 3 nr
+郭大岳 8 nr
+郭大爷 14 nr
+郭大鑫 4 nr
+郭天叙 3 nr
+郭天民 256 nr
+郭太后 17 nr
+郭太尉 8 nr
+郭太生 4 nr
+郭夫人 106 nr
+郭奉孝 6 nr
+郭女侠 14 nr
+郭女王 2 nr
+郭妃丽 3 nr
+郭姐姐 2 nr
+郭姑娘 40 nr
+郭姑娘之 2 nr
+郭姑娘成 2 nr
+郭姑娘放 2 nr
+郭威灭 5 nr
+郭威迎 3 nr
+郭威遂 3 nr
+郭娟 3 nrfg
+郭婉容 3 nr
+郭子仪 54 nr
+郭子兴 68 nr
+郭子宓 2 nr
+郭子章 2 nr
+郭存先 11 nr
+郭守敬 59 nr
+郭守敬纪念馆 2 nr
+郭宗清 2 nr
+郭宝昌 3 nr
+郭宝玉 3 nr
+郭宝珍 14 nr
+郭宝臣 4 nr
+郭宝钧 5 nr
+郭家姊妹 2 nr
+郭家学 10 nr
+郭家屯 2 nr
+郭家已 2 nr
+郭家店 13 ns
+郭家河 3 nr
+郭寄峤 3 nr
+郭富城 4 nr
+郭小姐 4 nr
+郭小川 4 nr
+郭小诚 3 nr
+郭少庆 3 nr
+郭尔罗 7 nr
+郭展序 2 nr
+郭崇礼 2 nr
+郭崇立 2 nr
+郭嵩焘 55 nr
+郭师叔 8 nr
+郭希文 2 nr
+郭常之 3 nr
+郭平坦 2 nr
+郭平梁 5 nr
+郭广平 3 nr
+郭庄泉 2 nr
+郭庄镇 3 nr
+郭庆华 3 nr
+郭庆藩 3 nr
+郭庚茂 2 nr
+郭府中 2 nr
+郭延芬 2 nr
+郭廷标 3 nr
+郭建光 5 nr
+郭建楠 6 nr
+郭建跃 5 nr
+郭待封 2 nr
+郭德刚 3 nr
+郭德毛 5 nr
+郭志勤 2 nr
+郭忠恕 2 nr
+郭怀一 2 nr
+郭戈平 2 nr
+郭振东 7 nr
+郭振乾 257 nr
+郭振清 3 nr
+郭掌柜 3 nr
+郭攸之 3 v
+郭效昌 2 nr
+郭敬中 2 nr
+郭敬明 26 nr
+郭文举 2 nr
+郭新力 2 nr
+郭旭光 2 nr
+郭旭新 3 nr
+郭春涛 3 nr
+郭晋安 3 nr
+郭晓蕙 2 nr
+郭晓霞 9 nr
+郭景昌 2 nr
+郭景阳 2 nr
+郭晶晶 70 nr
+郭有恒 20 nr
+郭有明 256 nr
+郭未成 4 nr
+郭来喜 3 nr
+郭松义 5 nr
+郭松龄 34 nr
+郭林宗 2 nr
+郭柯宇 256 nr
+郭树忠 17 nr
+郭树清 9 nr
+郭树范 2 nr
+郭树言 513 nr
+郭样正 3 nr
+郭样盛 2 nr
+郭样见 2 nr
+郭桂彬 3 nrfg
+郭桂蓉 2 nr
+郭次口 3 nr
+郭正域 14 nr
+郭殿成 2 nr
+郭氏姊妹 2 nr
+郭氏家族 4 nr
+郭永宏 256 nr
+郭永强 2 nr
+郭永怀 25 nr
+郭汜之 2 nr
+郭汜令 2 nr
+郭汜兵 3 nr
+郭汜引 4 nr
+郭汜知 3 nr
+郭汜领 4 nr
+郭汝霖 2 nr
+郭江涛 6 nr
+郭汴河 2 nr
+郭汾阳 3 nr
+郭沫若 222 nr
+郭法曾 3 nr
+郭海卫 2 nr
+郭海涛 4 nr
+郭海萍 12 nr
+郭淑珍 3 nrfg
+郭淮亦 2 nr
+郭淮入 2 nr
+郭淮复 2 nr
+郭淮引 4 nr
+郭淮闻 3 nr
+郭炎炎 5 nr
+郭炳江 4 nr
+郭炳湘 7 nr
+郭炳联 2 nr
+郭焏 3 ns
+郭燕杰 2 nr
+郭玉堂 21 nr
+郭王庙 3 nr
+郭瑞龙 2 nr
+郭瑶琪 3 nr
+郭瑾浩 4 nr
+郭璞注 2 nr
+郭璞浩 3 nr
+郭生练 256 nr
+郭皇后 17 nr
+郭盛四 3 nr
+郭破虏 39 nr
+郭碧川 3 nr
+郭礼华 4 nr
+郭礼祥 4 nr
+郭祥义 6 nr
+郭祥仰 3 nr
+郭祥全 2 nr
+郭祥刚 10 nr
+郭祥前 2 nr
+郭祥叉 10 nr
+郭祥叹 6 nr
+郭祥同 8 nr
+郭祥听 8 nr
+郭祥呀 2 nr
+郭祥呵 2 nr
+郭祥和 39 nr
+郭祥咬 2 nr
+郭祥喊 3 nr
+郭祥嘻 3 nr
+郭祥妈 2 nr
+郭祥嫌 2 nr
+郭祥存 2 nr
+郭祥学 2 nr
+郭祥往 6 nr
+郭祥微微 3 nr
+郭祥忙 6 nr
+郭祥怪 2 nr
+郭祥想 6 nr
+郭祥才 4 nr
+郭祥抗 2 nr
+郭祥抢 2 nr
+郭祥抱 2 nr
+郭祥接 3 nr
+郭祥推 2 nr
+郭祥提 2 nr
+郭祥支 2 nr
+郭祥望 3 nr
+郭祥正 7 nr
+郭祥涨 5 nr
+郭祥深 4 nr
+郭祥满 2 nr
+郭祥点 5 nr
+郭祥电 2 nr
+郭祥皱 3 nr
+郭祥直 3 nr
+郭祥真 5 nr
+郭祥眼 2 nr
+郭祥瞅 5 nr
+郭祥禽 2 nr
+郭祥站 3 nr
+郭祥笑 4 nr
+郭祥老 2 nr
+郭祥背 2 nr
+郭祥见 17 nr
+郭祥越 3 nr
+郭祥身 2 nr
+郭祥转 4 nr
+郭祥迎 2 nr
+郭祥醒 2 nr
+郭祥马 4 nr
+郭祥鬼 2 nr
+郭秀云 3 nr
+郭秀仪 2 nr
+郭秋香 2 nr
+郭绍虞 7 nr
+郭经理 6 nr
+郭络罗 7 nr
+郭美美 3 nr
+郭羡妮 3 nr
+郭耀华 3 nr
+郭耀明 3 nr
+郭老板 2 nr
+郭老驹 2 nr
+郭良勤 3 nr
+郭芯其 3 nr
+郭若虚 5 nr
+郭英剑 2 nr
+郭茂倩 6 nr
+郭荣昌 2 nr
+郭药师 379 nr
+郭莉萍 4 nr
+郭葛明 3 nr
+郭蔼明 3 nr
+郭裕怀 2 nr
+郭襄东 2 nr
+郭襄举 2 nr
+郭襄之 4 nr
+郭襄争 2 nr
+郭襄伸 4 nr
+郭襄依 3 nr
+郭襄俏 5 nr
+郭襄内 2 nr
+郭襄冷 2 nr
+郭襄凝 2 nr
+郭襄剑 2 nr
+郭襄发 3 nr
+郭襄只 7 nr
+郭襄叹 9 nr
+郭襄各 4 nr
+郭襄同 2 nr
+郭襄吓 4 nr
+郭襄听 19 nr
+郭襄呆 2 nr
+郭襄唤 2 nr
+郭襄喂 4 nr
+郭襄喜 7 nr
+郭襄嘻 3 nr
+郭襄因 2 nr
+郭襄夜 2 nr
+郭襄大 11 nr
+郭襄奇 11 nr
+郭襄女 5 nr
+郭襄姊妹 4 nr
+郭襄定 2 nr
+郭襄小小 4 nr
+郭襄左 4 nr
+郭襄开 2 nr
+郭襄引 2 nr
+郭襄强 2 nr
+郭襄心 15 nr
+郭襄忙 8 nr
+郭襄忽 3 nr
+郭襄怒 6 nr
+郭襄惊 2 nr
+郭襄惨 4 nr
+郭襄房 6 nr
+郭襄扶 3 nr
+郭襄护 2 nr
+郭襄抱 4 nr
+郭襄拉 2 nr
+郭襄招 2 nr
+郭襄拨 2 nr
+郭襄挥 2 nr
+郭襄摇 4 nr
+郭襄摸 2 nr
+郭襄攻 2 nr
+郭襄放 6 nr
+郭襄星 2 nr
+郭襄格 2 nr
+郭襄正 3 nr
+郭襄浮 2 nr
+郭襄点 2 nr
+郭襄生 2 nr
+郭襄睡 3 nr
+郭襄瞿 2 nr
+郭襄知 2 nr
+郭襄确 2 nr
+郭襄稳 2 nr
+郭襄站 2 nr
+郭襄笑 39 nr
+郭襄细 2 nr
+郭襄耳 2 nr
+郭襄自 3 nr
+郭襄落 2 nr
+郭襄行 4 nr
+郭襄见 32 nr
+郭襄跃 2 nr
+郭襄身 27 nr
+郭襄转 2 nr
+郭襄连 2 nr
+郭襄递 2 nr
+郭襄那 4 nr
+郭襄郭 5 nr
+郭襄随 2 nr
+郭襄靠 2 nr
+郭襄飞 2 nr
+郭襄饱 2 nr
+郭襄骑 2 nr
+郭谏臣 4 nr
+郭象注 2 nr
+郭贞焕 3 nr
+郭贵妃 2 nr
+郭贵嫔 3 nr
+郭超人 257 nr
+郭跃华 2 nr
+郭载代 2 nr
+郭远远 2 nr
+郭连文 3 nr
+郭里洼 2 nr
+郭金富 2 nr
+郭金龙 3 nr
+郭铁锋 6 nr
+郭锡章 257 nr
+郭锦恩 3 nr
+郭长城 2 nr
+郭阿多 3 nr
+郭雅莉 2 nr
+郭靖一一 2 nr
+郭靖举 6 nr
+郭靖乃 3 nr
+郭靖久 6 nr
+郭靖之 23 nr
+郭靖乘 7 nr
+郭靖习 2 nr
+郭靖交 5 nr
+郭靖亦 3 nr
+郭靖令 3 nr
+郭靖仰 2 nr
+郭靖伏 3 nr
+郭靖传 2 nr
+郭靖伸 10 nr
+郭靖依 26 nr
+郭靖依然 2 nr
+郭靖便 8 nr
+郭靖倚 3 nr
+郭靖傻 3 nr
+郭靖兄弟 2 nr
+郭靖先 4 nr
+郭靖全 3 nr
+郭靖兵 3 nr
+郭靖写 2 nr
+郭靖冲 2 nr
+郭靖凝 3 nr
+郭靖击 2 nr
+郭靖刚 8 nr
+郭靖初 4 nr
+郭靖制 2 nr
+郭靖力 3 nr
+郭靖劝 3 nr
+郭靖单 3 nr
+郭靖叉 3 nr
+郭靖双 17 nr
+郭靖叫 5 nr
+郭靖右 5 nr
+郭靖叹 16 nr
+郭靖吓 10 nr
+郭靖听 53 nr
+郭靖呆 6 nr
+郭靖呼 2 nr
+郭靖命 5 nr
+郭靖唯 2 nr
+郭靖啊 4 nr
+郭靖喜 24 nr
+郭靖喝 2 nr
+郭靖回 8 nr
+郭靖圆 2 nr
+郭靖埃 2 nr
+郭靖堪 2 nr
+郭靖大 20 nr
+郭靖头 5 nr
+郭靖奇 32 nr
+郭靖奔 6 nr
+郭靖守 2 nr
+郭靖安 7 nr
+郭靖实 2 nr
+郭靖害 2 nr
+郭靖寻 2 nr
+郭靖射 5 nr
+郭靖少 2 nr
+郭靖尽 2 nr
+郭靖左 19 nr
+郭靖府 2 nr
+郭靖影 2 nr
+郭靖微 7 nr
+郭靖微微 11 nr
+郭靖心 41 nr
+郭靖必 5 nr
+郭靖忙 48 nr
+郭靖快 3 nr
+郭靖念 3 nr
+郭靖忽 6 nr
+郭靖怒 11 nr
+郭靖情 2 nr
+郭靖惊 14 nr
+郭靖愈 3 nr
+郭靖感 2 nr
+郭靖才 6 nr
+郭靖托 2 nr
+郭靖扶 4 nr
+郭靖技 2 nr
+郭靖抚 2 nr
+郭靖抢 15 nr
+郭靖抱 13 nr
+郭靖抹 2 nr
+郭靖拉 2 nr
+郭靖拍 2 nr
+郭靖拔 2 nr
+郭靖拙 2 nr
+郭靖招 4 nr
+郭靖拜 4 nr
+郭靖拥 2 nr
+郭靖拳 2 nr
+郭靖拿 5 nr
+郭靖挥 5 nr
+郭靖挺 3 nr
+郭靖掌 24 nr
+郭靖接 5 nr
+郭靖提 5 nr
+郭靖摇 2 nr
+郭靖摸 4 nr
+郭靖擒 2 nr
+郭靖收 5 nr
+郭靖教 4 nr
+郭靖斗 7 nr
+郭靖方 2 nr
+郭靖既 2 nr
+郭靖智 2 nr
+郭靖曾 5 nr
+郭靖有为 2 nr
+郭靖朗 3 nr
+郭靖望 15 nr
+郭靖未 7 nr
+郭靖本 20 nr
+郭靖柔 2 nr
+郭靖横 10 nr
+郭靖欲 6 nr
+郭靖正 18 nr
+郭靖殊 2 nr
+郭靖派 3 nr
+郭靖涨 2 nr
+郭靖渐 2 nr
+郭靖溜 2 nr
+郭靖满 2 nr
+郭靖照 2 nr
+郭靖爷 2 nr
+郭靖牵 3 nr
+郭靖犹 2 nr
+郭靖独 2 nr
+郭靖猛 5 nr
+郭靖甚 7 nr
+郭靖留 2 nr
+郭靖疾 3 nr
+郭靖皱 2 nr
+郭靖盘 4 nr
+郭靖相 9 nr
+郭靖眼 2 nr
+郭靖知 14 nr
+郭靖硬 2 nr
+郭靖确 2 nr
+郭靖离 2 nr
+郭靖稳 2 nr
+郭靖突 3 nr
+郭靖立 2 nr
+郭靖站 17 nr
+郭靖竟 7 nr
+郭靖端 2 nr
+郭靖笑 44 nr
+郭靖练 5 nr
+郭靖统 2 nr
+郭靖翻 4 nr
+郭靖耳 2 nr
+郭靖背 7 nr
+郭靖腹 3 nr
+郭靖腿 3 nr
+郭靖自 12 nr
+郭靖若 3 nr
+郭靖西 4 nr
+郭靖见 117 nr
+郭靖解 2 nr
+郭靖识 3 nr
+郭靖谨 2 nr
+郭靖责 2 nr
+郭靖赞 2 nr
+郭靖越 6 nr
+郭靖足 4 nr
+郭靖跃 8 nr
+郭靖跳 2 nr
+郭靖身 21 nr
+郭靖躲 2 nr
+郭靖转 5 nr
+郭靖轻 4 nr
+郭靖运 3 nr
+郭靖远 3 nr
+郭靖连 15 nr
+郭靖邀 3 nr
+郭靖郭 20 nr
+郭靖闪 2 nr
+郭靖闻 4 nr
+郭靖降 2 nr
+郭靖陪 2 nr
+郭靖露 2 nr
+郭靖面 2 nr
+郭靖领 5 nr
+郭靖飞 9 nr
+郭靖驰 4 nr
+郭靖骑 5 nr
+郭靖黄 8 nr
+郭鹤年 4 nr
+郭黄而 2 nr
+郭鼎堂 2 nr
+郭齐勇 3 nr
+郯 35 ns
+郯城 20 ns
+郯城县 5 ns
+郴 93 ns
+郴县 8 ns
+郴州 30 ns
+郴州市 17 ns
+郷 16 zg
+郸 16 ns
+郸城 8 ns
+郸城县 2 ns
+都 202780 d
+都东瓯 2 nr
+都中纸贵 3 n
+都为燕 2 nr
+都乐 14 n
+都乐岩 2 nr
+都乐网 3 n
+都亚耶 3 nr
+都亭侯 4 nr
+都会亮 2 nr
+都会区 3 n
+都依允 2 nr
+都保正 2 nr
+都俞吁咈 3 nr
+都先胜 3 nr
+都兰 5 ns
+都兰县 7 ns
+都加容 2 nr
+都匀 29 ns
+都匀市 10 ns
+都卜勒 3 nr
+都发青 4 nr
+都受了 3 n
+都变青 2 nr
+都史 3 n
+都司 139 n
+都哄然 2 nr
+都城 886 ns
+都城远 2 nr
+都大锦 66 nr
+都头导姓 3 n
+都头异姓 3 n
+都子察 4 nr
+都学全 4 nr
+都学武 2 nr
+都安县 2 ns
+都安瑶族自治县 7 ns
+都实况 3 n
+都察院 678 n
+都尉 188 nr
+都尉许 5 nr
+都尔罕 2 nr
+都崇信 4 nr
+都市 692 ns
+都市人 41 n
+都市人口 3 ns
+都市化 25 n
+都市区 26 ns
+都市型 4 n
+都市女性 3 n
+都市妖 3 n
+都市快报 3 n
+都市报 83 n
+都市沙龙 3 ns
+都市热线 3 n
+都市生活 3 n
+都市田园 3 ns
+都市男女 3 n
+都市病 3 n
+都市网 3 n
+都市计划 3 n
+都市计画 3 n
+都市集聚 3 nz
+都平阳 2 ns
+都广陵 6 nr
+都府 3 n
+都庞岭 8 nr
+都建业 3 nr
+都建州 2 nr
+都建康 14 nr
+都得利 3 nr
+都御使 3 nr
+都御史 72 nr
+都心知 2 nr
+都必领 8 nr
+都悔青 7 nr
+都承旨 5 nr
+都护府 51 n
+都拉斯 5 nr
+都拥兵 2 nr
+都拥立 2 nr
+都指挥使 3 n
+都挑明 2 nr
+都斯山 2 ns
+都昌 4 nr
+都昌县 2 ns
+都晋阳 2 nr
+都本洁 2 nr
+都柏林 89 nr
+都柳江 10 nr
+都桃里 3 nr
+都欢然 2 nr
+都水营 3 nr
+都江 10 ns
+都江堰 177 ns
+都江堰市 35 ns
+都洛邑 7 nr
+都灵 141 nr
+都监王 2 nr
+都督 942 n
+都督府 631 n
+都立泰 2 nr
+都素知 2 nr
+都统 341 n
+都统军 13 nr
+都统卞 2 nr
+都统叶 2 nr
+都统国 2 n
+都统德 2 nr
+都统海 3 nr
+都统郎 2 nr
+都群公 2 nr
+都耸然 2 nr
+都胜臣 2 nr
+都能安 32 nr
+都腾腾 2 nr
+都虞候 3 nr
+都行 175 n
+都译成 2 nr
+都说会 3 n
+都诺夫 6 nr
+都还不 3 nr
+都还没 3 nr
+都远胜 3 nr
+都遵旨 2 nr
+都邑常 3 nr
+都邑镐 3 nr
+都鄙有章 3 vn
+都钦慕 2 nr
+都锦生 17 nr
+都镇湾镇 5 ns
+都门儿 2 nr
+都静静 3 nr
+都领兵 3 nr
+郾 47 nrt
+郾城 53 nrt
+郾城县 2 nrt
+郿 34 zg
+鄀 149 zg
+鄂 8347 nr
+鄂三州 256 ns
+鄂东 1075 ns
+鄂东北 10 ns
+鄂伦春 33 nr
+鄂伦春人 6 nr
+鄂伦春族 31 nz
+鄂伦春自治旗 12 ns
+鄂入湘 2 nr
+鄂北 26 ns
+鄂北岗 4 ns
+鄂北路 2 ns
+鄂北锺 5 nr
+鄂北鬼 6 nr
+鄂南 1038 ns
+鄂博 30 nr
+鄂博矿 3 nr
+鄂君启 6 nr
+鄂国公 3 nr
+鄂城 25 ns
+鄂城区 256 ns
+鄂境川 4 nr
+鄂多立 2 nr
+鄂嫩河 14 ns
+鄂尔勒 3 nr
+鄂尔多 6 ns
+鄂尔多斯 73 ns
+鄂尔多斯市 9 ns
+鄂尔多斯高原 41 ns
+鄂尔怀 3 nr
+鄂尔泰 21 nr
+鄂尔浑 7 nr
+鄂尔达 4 nr
+鄂川 3 ns
+鄂州 1608 ns
+鄂州市 1553 ns
+鄂巴 2 ns
+鄂布斯 3 nr
+鄂托克 3 nr
+鄂托克前旗 4 ns
+鄂托克旗 14 nr
+鄂拉山 3 ns
+鄂木斯克 15 ns
+鄂毕河 42 nr
+鄂毕湾 12 nr
+鄂温克 77 nr
+鄂温克族 30 nz
+鄂温克族自治旗 5 ns
+鄂温克旗 3 nr
+鄂潜江 3 nr
+鄂登楚 2 nr
+鄂百灵 11 nr
+鄂皖 266 j
+鄂皖赣 2 nr
+鄂硕克 2 nr
+鄂粤赣 3 j
+鄂罗斯 3 nr
+鄂罗罗 2 nr
+鄂菜鱼 256 nr
+鄂西 2300 ns
+鄂西北 789 ns
+鄂西地区 8 ns
+鄂豫皖 685 j
+鄂豫皖革命根据地 9 ns
+鄂豫陕 263 nr
+鄂陵湖 17 ns
+鄂齐尔 5 nr
+鄃 5 zg
+鄄 126 g
+鄄城 19 ns
+鄄城县 3 ns
+鄅 4 zg
+鄏 26 zg
+鄐 19 zg
+鄗 31 zg
+鄘 21 zg
+鄙 298 ag
+鄙于不屑 3 i
+鄙人 63 r
+鄙俗 176 a
+鄙俚 7 a
+鄙吝 6 v
+鄙吝复萌 3 i
+鄙啬 3 a
+鄙夫 37 n
+鄙夷 201 v
+鄙夷不屑 5 i
+鄙弃 46 v
+鄙意 6 v
+鄙称 3 v
+鄙笑 3 v
+鄙薄 283 a
+鄙见 3 v
+鄙视 217 v
+鄙言 3 v
+鄙贱 3 a
+鄙陋 27 a
+鄚 6 zg
+鄜 23 zg
+鄞 18 ns
+鄞俨话 3 vn
+鄞僖挥 3 v
+鄞县 39 ns
+鄞州区 3 ns
+鄠 8 zg
+鄡 4 zg
+鄢 32 nr
+鄢光华 2 nr
+鄢光荣 2 nr
+鄢家河村 4 ns
+鄢懋卿 16 nr
+鄢浩魁 3 n
+鄢烈山 4 nr
+鄢玉红 2 nr
+鄢陵 33 nr
+鄢陵之战 18 nr
+鄢陵侯 6 nr
+鄢陵北 3 ns
+鄢陵县 7 ns
+鄢陵君 2 nr
+鄣 123 g
+鄤 12 zg
+鄩 8 zg
+鄫 9 zg
+鄮 7 zg
+鄯 47 ns
+鄯善 76 ns
+鄯善县 4 ns
+鄯善国 3 ns
+鄱 89 ns
+鄱阳 3 ns
+鄱阳县 3 ns
+鄱阳湖 248 ns
+鄱阳湖区 6 ns
+鄱阳湖畔 7 ns
+鄱阳湖自然保护区 2 ns
+鄱阳盆地 3 ns
+鄴 2 zg
+鄷 5 zg
+鄹 26 g
+鄼 2 zg
+酂 8 zg
+酃 35 g
+酆 98 nr
+酆居镐 2 nr
+酉 198 ns
+酉垩纪 3 t
+酉时 3 t
+酉矩阵 3 vn
+酉空间 3 ns
+酉长 3 ns
+酉阳 18 ns
+酉阳县 3 ns
+酉阳土家族苗族自治县 5 ns
+酉鸡 3 ns
+酊 19 ng
+酊剂 5 n
+酋 165 n
+酋长 391 n
+酋长国 53 n
+酌 179 vg
+酌予 3 v
+酌减 8 v
+酌办 3 v
+酌加 3 d
+酌古准今 3 l
+酌古参今 3 l
+酌古御今 3 v
+酌古斟今 3 v
+酌古沿今 3 v
+酌商 3 v
+酌处 3 d
+酌定 9 d
+酌情 77 d
+酌情处理 3 l
+酌收 3 v
+酌水知源 3 l
+酌盈剂虚 3 l
+酌盈注虚 3 l
+酌议 3 v
+酌酒 3 v
+酌量 21 d
+酌金馔玉 3 nz
+配 2720 v
+配上 3 v
+配上去 3 v
+配上来 3 v
+配不上 3 v
+配乐 50 vn
+配乐师 3 n
+配产配注 3 n
+配享 18 v
+配享千秋 3 i
+配件 778 n
+配件厂 12 n
+配伍 48 v
+配位 237 n
+配位作用 3 n
+配位聚合 3 n
+配位键 3 n
+配体 3 n
+配作 3 vn
+配偶 381 v
+配偶栏 3 n
+配克 3 nz
+配军 3 n
+配出 3 v
+配出来 3 vn
+配分 3 v
+配分函数 3 n
+配分法 3 n
+配到 3 v
+配制 278 v
+配制饲料 3 n
+配剂 6 n
+配发 109 v
+配号 3 n
+配合 4307 v
+配合力 9 n
+配合起来 3 v
+配合默契 3 n
+配售 79 vn
+配唱 3 v
+配器 45 n
+配器法 9 n
+配图 8 v
+配图量 3 n
+配在 3 v
+配在一起 3 v
+配型 41 n
+配基 3 nz
+配备 1119 v
+配套 1939 a
+配套化 4 n
+配套工程 3 n
+配套性 2 n
+配套成龙 3 n
+配套技术 3 n
+配套措施 3 n
+配套改革 3 n
+配套方案 3 n
+配套率 2 n
+配子 200 n
+配子体 3 n
+配对 112 v
+配对法 3 n
+配属 97 v
+配布 3 v
+配带 8 n
+配平 3 n
+配得 3 v
+配戏 7 v
+配成 3 v
+配戴 35 v
+配戴者 2 n
+配房 3 n
+配搭 11 v
+配数 3 n
+配料 94 n
+配料表 8 n
+配方 208 n
+配曲 5 v
+配有 314 v
+配机 3 n
+配殿 293 n
+配比 32 v
+配水管网 3 nz
+配水系统 3 n
+配法 3 v
+配演 3 v
+配用 135 v
+配电 106 vn
+配电器 3 nz
+配电室 2 n
+配电房 2 n
+配电柜 3 nz
+配电盒 2 n
+配电盘 3 n
+配电站 3 n
+配电箱 3 nz
+配电网 2 nz
+配电装置 3 n
+配画诗 3 n
+配眼镜 3 nz
+配种 28 v
+配种站 3 n
+配称 5 v
+配穴 3 n
+配第 3 nz
+配系 23 v
+配线 3 n
+配线架 3 n
+配线箱 3 n
+配给 112 v
+配给制 7 n
+配给卡 3 n
+配给品 3 n
+配给票 3 n
+配给证 3 n
+配给量 3 n
+配置 1590 v
+配置图 3 n
+配置审核 3 n
+配置文件 4 n
+配置管理 6 n
+配股 89 v
+配股价 3 nz
+配股缴款 3 n
+配舞 3 v
+配色 278 n
+配色盘 3 n
+配药 58 n
+配药师 3 n
+配菜 9 n
+配衬 3 v
+配装 28 v
+配角 103 n
+配角奖 3 nz
+配调 3 v
+配调法 3 n
+配货站 3 n
+配货网 3 n
+配购 3 v
+配起 3 v
+配起来 3 v
+配载 2 v
+配送 96 v
+配送费 3 n
+配配 3 vn
+配重 16 a
+配量 3 n
+配钥匙 3 n
+配销 3 v
+配锁 3 vn
+配镜 5 n
+配音 33 n
+配音员 3 n
+配音演员 3 n
+配页 3 n
+配额 142 n
+配额制 10 n
+配餐 16 v
+配饰 10 v
+配齐 15 a
+酎 33 g
+酐 29 g
+酐化 3 n
+酒 9653 n
+酒不醉 3 i
+酒业 11 n
+酒中仙 3 n
+酒井 4 n
+酒井法子 3 n
+酒仙 3 n
+酒仙桥 6 ns
+酒令 41 n
+酒会 156 n
+酒余茶后 3 n
+酒保 257 n
+酒儿 7 n
+酒入舌出 3 i
+酒兴 39 ns
+酒具 90 n
+酒剑仙 3 n
+酒力 3 n
+酒厂 85 n
+酒友 9 n
+酒后 170 t
+酒后失态 3 i
+酒后失言 3 i
+酒后失音 3 i
+酒后无德 3 i
+酒后茶余 3 i
+酒吧 326 n
+酒吧女 3 n
+酒吧街 3 n
+酒吧间 5 n
+酒味 46 n
+酒商 10 n
+酒器 50 n
+酒囊饭包 3 n
+酒囊饭桶 3 n
+酒囊饭袋 15 n
+酒地花天 3 ns
+酒场 2 n
+酒坊 10 n
+酒坛 44 n
+酒坛子 15 n
+酒城 2 ns
+酒壶 227 n
+酒女 3 n
+酒好不怕巷子深 2 i
+酒客 3 n
+酒宴 168 n
+酒家 542 n
+酒家女 3 n
+酒市 3 n
+酒席 275 n
+酒店 2524 n
+酒店业 31 n
+酒店客房 3 n
+酒店家具 3 n
+酒店宾馆 3 ns
+酒店式 3 n
+酒店服 3 n
+酒店用品 3 n
+酒店设备 3 n
+酒店设施 3 n
+酒店设计 3 n
+酒店风云 3 ns
+酒廊 10 n
+酒徒 12 n
+酒性 19 n
+酒意 84 n
+酒拳 3 n
+酒旗 3 n
+酒曲 18 n
+酒有别肠 3 n
+酒杯 719 n
+酒杯子 4 n
+酒架 3 n
+酒柜 8 n
+酒标 3 n
+酒桌 13 n
+酒桌上 3 n
+酒桶 40 n
+酒棍 3 n
+酒椰 3 n
+酒楼 484 n
+酒榨 3 v
+酒槽鼻 3 n
+酒歌 22 n
+酒母 3 n
+酒气 91 n
+酒气冲天 3 i
+酒气熏人 3 l
+酒气熏天 3 l
+酒水 85 n
+酒池肉林 6 nz
+酒汤 3 n
+酒泉 208 n
+酒泉卫星发射中心 2 nt
+酒泉地区 3 ns
+酒泉市 18 ns
+酒泉街 3 ns
+酒泉钢铁公司 5 nt
+酒浆 21 n
+酒涡 5 n
+酒渣鼻 3 n
+酒滓 3 n
+酒狂 3 n
+酒瓶 122 n
+酒瓶子 16 n
+酒瓶盖 2 n
+酒疯 3 n
+酒病花愁 3 i
+酒痕 3 n
+酒瘾 16 n
+酒癖 3 n
+酒盅 49 n
+酒盏 3 n
+酒石 3 n
+酒石酸 54 n
+酒石酸钾钠 6 nz
+酒神 3 n
+酒神节 3 n
+酒禁 3 n
+酒税 3 n
+酒窖 15 n
+酒窝 57 n
+酒窝儿 10 n
+酒筵 50 n
+酒类 113 n
+酒精 523 n
+酒精中毒 3 nz
+酒精依赖 3 i
+酒精厂 3 n
+酒精喷灯 3 n
+酒精度 9 n
+酒精性 3 n
+酒精灯 159 n
+酒精炉 3 n
+酒精类 3 n
+酒精肝 3 n
+酒糟 21 n
+酒糟鼻 15 n
+酒绿灯红 2 n
+酒缸 11 n
+酒罐 3 n
+酒翁 3 n
+酒肆 66 n
+酒肉 182 n
+酒肉兄弟 3 n
+酒肉和尚 3 n
+酒肉朋友 5 n
+酒肴 43 n
+酒色 63 n
+酒色之徒 8 i
+酒色财气 12 i
+酒芯糖 3 n
+酒花 25 n
+酒荒 3 n
+酒药 8 n
+酒菜 192 n
+酒虎诗龙 3 n
+酒袋 3 n
+酒言酒语 3 i
+酒话 3 n
+酒质 3 n
+酒趣 3 n
+酒足饭饱 22 i
+酒过三巡 3 v
+酒递 3 v
+酒逢知己 4 i
+酒逢知己千杯少 8 l
+酒都 49 ns
+酒酣耳热 20 i
+酒酣耳熟 3 i
+酒酸不售 3 l
+酒酿 13 n
+酒酿汤圆 3 z
+酒醉 3 v
+酒醉饭饱 11 i
+酒醒 53 v
+酒醰 3 v
+酒量 152 n
+酒钢 6 n
+酒钱 48 n
+酒铺 5 n
+酒阑人散 3 i
+酒霸 3 n
+酒靥 3 n
+酒食 179 n
+酒食地狱 3 n
+酒食征逐 3 i
+酒饭 93 n
+酒馆 103 n
+酒香 106 n
+酒鬼 45 n
+酒齇鼻 3 v
+酒龄 3 n
+酒龙诗虎 3 n
+酕 3 zg
+酖 3 zg
+酖毒 3 vn
+酗 6 v
+酗酒 144 v
+酗酒滋事 3 vn
+酗酒闹事 3 v
+酚 231 nz
+酚妥拉明 3 nz
+酚类 46 n
+酚类化合物 2 l
+酚酞 13 n
+酚酸 2 nz
+酚醛 22 nz
+酚醛塑料 5 nz
+酚醛树脂 33 nz
+酝 82 v
+酝成 3 v
+酝积 3 v
+酝藉 3 v
+酝酿 467 v
+酞 20 nz
+酞菁 9 nz
+酞酸酯 2 nz
+酡 15 vg
+酢 107 g
+酢浆草 3 vn
+酢酱草 3 vn
+酣 252 ag
+酣乐 3 a
+酣兴 3 a
+酣卧 3 v
+酣娱 3 a
+酣嬉淋漓 3 nr
+酣战 36 v
+酣放 3 v
+酣放自若 3 i
+酣梦 8 v
+酣歌 3 v
+酣歌恒舞 3 n
+酣歌醉舞 3 i
+酣然 17 d
+酣然入梦 3 i
+酣甜 3 a
+酣畅 65 a
+酣畅淋漓 44 i
+酣痛淋漓 3 i
+酣眠 6 v
+酣睡 55 v
+酣醉 5 v
+酣饮 56 v
+酤 18 g
+酥 883 a
+酥松 2 a
+酥松可口 3 n
+酥梨 10 n
+酥油 50 n
+酥油花 5 n
+酥油茶 36 n
+酥油草 3 n
+酥皮 3 n
+酥碱 2 n
+酥糖 13 n
+酥胸 3 n
+酥脆 31 a
+酥脆可口 3 vn
+酥软 22 a
+酥软软 3 n
+酥酥的 4 z
+酥饼 3 n
+酥麻 14 n
+酥麻麻 3 z
+酧 120 zg
+酩 10 i
+酩酊 4 v
+酩酊大醉 21 i
+酩酊烂醉 3 i
+酪 80 nz
+酪农业 3 nz
+酪农场 3 n
+酪氨酸 22 nz
+酪浆 3 n
+酪素 2 nz
+酪蛋白 8 n
+酪酸 7 nz
+酪饼 3 n
+酫 13 zg
+酬 434 ng
+酬功给效 3 n
+酬劳 74 v
+酬唱 15 v
+酬宾 8 n
+酬对 3 v
+酬应 7 v
+酬庸 3 n
+酬报 14 n
+酬神 3 n
+酬答 46 v
+酬谢 112 v
+酬躇满志 3 v
+酬酢 17 v
+酬金 39 n
+酮 470 g
+酮体 3 n
+酮康唑 3 n
+酮症 11 n
+酮类 3 n
+酮酸 6 n
+酯 435 ng
+酯交换 3 nz
+酯化 3 n
+酯类 3 n
+酯类化合物 2 n
+酯酶 12 n
+酰 181 n
+酰亚胺 10 n
+酰化 3 n
+酰叠氮 3 n
+酰基 16 n
+酰氟 3 n
+酰氯 42 n
+酰胺 175 n
+酰胺键 3 n
+酱 696 n
+酱园 12 n
+酱坊 3 n
+酱料 5 n
+酱汁 3 n
+酱汤 2 n
+酱油 206 n
+酱油瓶 2 n
+酱油膏 3 n
+酱牛肉 3 n
+酱瓜 9 n
+酱紫 3 n
+酱紫色 6 n
+酱缸 11 n
+酱缸气 3 n
+酱肉 13 n
+酱腌菜 3 v
+酱色 27 n
+酱菜 56 n
+酱菜厂 2 n
+酱菜瓶 3 n
+酱豆腐 8 n
+酱香 4 n
+酱香型 2 n
+酱鸭 3 n
+酱黄瓜 2 n
+酲 5 g
+酴 2 g
+酵 64 n
+酵母 111 n
+酵母氨酸 3 n
+酵母片 4 n
+酵母粉 8 n
+酵母聚糖 3 n
+酵母菌 44 n
+酵粉 3 n
+酵素 17 n
+酵解 9 n
+酶 1219 n
+酶分类 3 n
+酶切位点 3 n
+酶制剂 3 n
+酶原 3 n
+酶子 3 n
+酶工程 3 n
+酶标仪 3 n
+酶法 8 n
+酶类 17 n
+酶系统 3 n
+酷 413 n
+酷仔 3 n
+酷似 173 v
+酷冷 3 a
+酷刑 181 n
+酷到 3 v
+酷刻 3 n
+酷吏 40 n
+酷哥 3 n
+酷夏 2 n
+酷好 3 a
+酷寒 36 n
+酷弊了 3 n
+酷政 3 n
+酷暑 118 v
+酷月钟 3 n
+酷极了 3 l
+酷毙 3 v
+酷毙了 3 y
+酷求 3 v
+酷烈 8 a
+酷热 81 a
+酷爱 127 v
+酷男 3 n
+酷站 3 n
+酷网 3 n
+酷肖 3 n
+酷虐 9 v
+酷评 2 v
+酷酷 3 a
+酷酷吧 3 n
+酷酷小狼 3 n
+酷酷贴 3 n
+酷龙 3 n
+酸 3899 n
+酸不拉唧 3 z
+酸中毒 88 nz
+酸乳 17 nz
+酸乳酪 3 n
+酸值 4 n
+酸催化 3 vn
+酸儒文人 3 n
+酸冷 3 z
+酸化 35 n
+酸化油 3 n
+酸味 108 n
+酸咸苦辣 3 z
+酸处理 5 n
+酸奶 103 n
+酸奶子 2 n
+酸奶机 3 n
+酸度 42 n
+酸度计 3 nz
+酸式盐 11 n
+酸心 3 n
+酸性 544 n
+酸性反应 3 n
+酸性土 3 n
+酸性岩 17 n
+酸性染料 3 n
+酸懒 3 a
+酸文假醋 7 i
+酸李 3 n
+酸枝木 3 n
+酸枣 78 n
+酸枣仁 3 n
+酸枣树 3 n
+酸根 16 nz
+酸梅 8 n
+酸梅汤 23 nz
+酸楚 133 a
+酸槽 3 n
+酸洗 5 nz
+酸浆 3 n
+酸涩 29 a
+酸液 22 n
+酸溜溜 52 z
+酸炼 3 nz
+酸牛奶 9 nz
+酸甜 20 a
+酸甜苦辣 56 z
+酸疼 35 a
+酸痛 187 n
+酸痛不已 3 i
+酸盐 3 n
+酸硷值 3 vn
+酸硷度 3 vn
+酸碱 165 n
+酸碱值 3 n
+酸碱度 40 n
+酸碱性 19 n
+酸管 3 n
+酸类 3 n
+酸罐 3 n
+酸腐 8 n
+酸臭 13 n
+酸苦 3 a
+酸菜 100 n
+酸菜汤 3 n
+酸菜鱼 2 n
+酸葡萄 3 n
+酸蓄电池 3 n
+酸蚀处理 3 n
+酸豆 3 n
+酸豆角 3 nz
+酸败 5 n
+酸软 217 a
+酸辛 4 a
+酸辣 3 z
+酸辣汤 12 nz
+酸辣粉 3 nz
+酸过多 3 i
+酸酐 47 nz
+酸酸 3 n
+酸酸乳 3 nz
+酸酸咸咸 3 v
+酸酸甜甜 3 i
+酸酸的 34 z
+酸酸苦苦 3 z
+酸钠 49 nz
+酸雨 110 n
+酸雾 5 n
+酸麻 248 n
+酸黄瓜 3 n
+酸鼻 3 a
+酹 17 vg
+酺 10 zg
+酻 4 zg
+酽 35 a
+酾 3 vg
+酿 186 vn
+酿制 69 vn
+酿成 498 v
+酿母 3 n
+酿母菌 3 n
+酿皮子 2 n
+酿祸 3 v
+酿蜜 9 n
+酿造 150 vn
+酿造业 5 n
+酿造出来 3 n
+酿造厂 3 n
+酿造品 3 n
+酿造学 3 n
+酿造酒 4 n
+酿酒 422 vn
+酿酒业 6 n
+酿酒厂 13 n
+酿酒师 16 n
+酿酶 3 n
+醄 12 zg
+醅 5 zg
+醇 928 ag
+醇化 3 nz
+醇厚 311 a
+醇和 56 nz
+醇朴 3 a
+醇正 3 nz
+醇溶液 4 nz
+醇类 3 n
+醇精 3 nz
+醇美 3 nz
+醇芳 3 nz
+醇酒 23 nz
+醇酒妇人 4 nz
+醇酒美人 3 nz
+醇酸 21 nz
+醇酸树脂 3 nz
+醇酿 3 n
+醇醇 3 nz
+醇醚 3 nz
+醇醨 3 z
+醇醪 4 z
+醇雅 5 a
+醇香 27 nz
+醈 2 zg
+醉 1736 v
+醉乡 63 n
+醉人 108 n
+醉倒 3 v
+醉倒在 3 i
+醉八仙 3 nr
+醉卧 3 nr
+醉吐相茵 3 i
+醉吟 3 z
+醉山颓倒 3 i
+醉心 190 n
+醉心于 3 nr
+醉态 19 n
+醉意 78 v
+醉打金枝 3 i
+醉拳 16 n
+醉枣 3 n
+醉歌 3 n
+醉死梦生 3 i
+醉汉 62 nr
+醉熏熏 3 nr
+醉玉颓山 3 i
+醉生梦死 30 i
+醉眼 53 n
+醉眼惺忪 3 i
+醉红尘 3 nr
+醉翁 5 nr
+醉翁之意 3 i
+醉翁之意不在酒 50 i
+醉翁亭 15 nr
+醉翁亭记 3 nr
+醉舞 4 v
+醉舞狂歌 3 i
+醉薰薰 3 nr
+醉蝶花 3 nr
+醉话 12 n
+醉过 3 v
+醉酒 88 n
+醉酒者 3 n
+醉酒饱德 3 i
+醉醉 3 nr
+醉醺醺 47 z
+醉金刚 3 nr
+醉马草 3 nr
+醉鬼 22 n
+醉鱼草 3 nr
+醉鸡 3 n
+醋 757 n
+醋劲 8 n
+醋劲儿 3 n
+醋化 3 n
+醋坛 3 n
+醋坛子 3 nz
+醋心 3 n
+醋意 60 n
+醋栗 4 n
+醋海生波 3 nz
+醋海翻波 3 n
+醋溜 7 n
+醋溜族 3 n
+醋瓶 4 n
+醋粟 3 n
+醋精 3 n
+醋罐子 7 n
+醋酸 59 n
+醋酸乙烯 2 nz
+醋酸乙烯酯 2 nz
+醋酸乙酯 3 nz
+醋酸盐 3 nz
+醋酸纤维 10 nz
+醋酸钠 7 nz
+醋醰 3 v
+醌 43 g
+醌氢醌 3 nz
+醌霉素 3 v
+醍 3 n
+醍醐 19 n
+醍醐灌顶 17 i
+醎 4 zg
+醑 6 g
+醒 2793 v
+醒世 3 v
+醒世名言 3 l
+醒世姻缘 3 n
+醒世箴言 3 z
+醒吾 3 v
+醒吾商专 3 l
+醒悟 315 v
+醒木 12 v
+醒来 462 v
+醒来时 3 l
+醒狮 19 v
+醒目 244 v
+醒盹 3 v
+醒眼 3 a
+醒聩震聋 3 v
+醒脑 3 n
+醒莲 3 n
+醒觉 46 v
+醒豁 3 a
+醒过来 3 l
+醒酒 29 v
+醒醒 3 v
+醕 5 zg
+醚 138 n
+醚化剂 3 v
+醛 281 n
+醛亚胺 3 n
+醛固酮 3 n
+醛水合物 3 n
+醛甾酮 3 n
+醛类 3 n
+醛酸 17 n
+醜 3 zg
+醠 10 zg
+醡 40 zg
+醡浆草 3 n
+醢 20 g
+醣 24 zg
+醣化 3 vn
+醣厂 3 v
+醣尿病 3 n
+醣果 3 v
+醣水 3 vn
+醣浆 3 vn
+醣类 3 vn
+醣精 3 vn
+醣蜜 3 z
+醣衣 3 vn
+醣醋 3 v
+醤 99 zg
+醪 68 n
+醪糟 12 n
+醫 2 zg
+醭 29 g
+醮 107 g
+醯 105 g
+醲郁 3 z
+醴 71 zg
+醴泉 12 ns
+醴酒不设 3 n
+醴陵 308 ns
+醴陵市 6 ns
+醵 22 g
+醺 80 g
+醺酣 3 z
+醺醺 3 z
+醺醺然 3 z
+醼 28 zg
+采 1996 v
+采下 3 v
+采下去 3 v
+采下来 3 v
+采为 3 v
+采买 52 v
+采伐 138 v
+采伐量 271 n
+采众 3 v
+采住 3 v
+采供血 8 n
+采信 8 v
+采光 37 v
+采光口 3 nr
+采光板 3 nr
+采光系数 3 n
+采光罩 3 nr
+采兰赠芍 3 n
+采兰赠药 3 n
+采写 51 v
+采冶 5 v
+采出程度 3 n
+采到 3 v
+采制 24 v
+采办 114 v
+采区 8 n
+采去 3 v
+采及葑菲 3 nr
+采取 9791 v
+采取任何 3 nr
+采取措施 48 nr
+采取有效 14 n
+采取相应 5 nr
+采取行动 3 n
+采回 3 v
+采回去 3 nr
+采回来 3 nr
+采在 3 v
+采地 13 v
+采声 3 v
+采备 2 v
+采女 3 n
+采好 3 v
+采彔 3 vn
+采录 23 v
+采得 3 v
+采择 3 v
+采挖 5 v
+采捕 9 v
+采掘 102 v
+采掘业 12 n
+采摘 206 v
+采摘期 3 n
+采撞 3 v
+采播 3 vn
+采撷 19 v
+采收 68 v
+采收期 3 n
+采收率 16 n
+采料 3 v
+采暖 29 v
+采暖期 3 nr
+采暖炉 3 nr
+采暖系统 3 n
+采暖设备 3 nr
+采暖费 3 nr
+采木 2 v
+采果 2 n
+采样 67 v
+采样器 2 n
+采样法 3 v
+采样率 3 v
+采样系统 3 n
+采桑子 4 nr
+采椽不斫 3 nr
+采水 2 v
+采油 67 v
+采油厂 3 n
+采油工 3 n
+采油强度 3 n
+采油曲线 3 n
+采油速率 3 n
+采油队 3 n
+采炼 5 v
+采煤 175 v
+采煤机 3 nz
+采煤矿 3 nz
+采猎 2 v
+采珠 32 nr
+采用 12193 v
+采用率 5 n
+采石 169 nr
+采石厂 3 n
+采石场 20 n
+采石工人 3 n
+采矿 437 v
+采矿业 156 n
+采矿场 6 n
+采矿工 3 n
+采矿工业 3 n
+采矿工程 3 n
+采矿方法 3 n
+采矿权 26 n
+采矿点 3 n
+采砂船 3 n
+采种 22 v
+采稿 3 v
+采空区 8 n
+采粉 2 v
+采纳 550 v
+采纳者 3 nr
+采给 3 v
+采编 31 v
+采编部 3 n
+采育 8 vn
+采育镇 3 nr
+采色 3 v
+采芝斋 5 nz
+采花 314 v
+采花贼 3 n
+采苗 6 v
+采茧 3 n
+采茶 362 v
+采茶戏 2 n
+采药 94 v
+采药人 4 nr
+采莲船 5 nr
+采获 3 v
+采菱 4 nz
+采葑采菲 3 nr
+采薪之忧 3 nr
+采薪之患 3 n
+采薪之疾 3 nr
+采蘑菇 3 v
+采蛋 31 v
+采蝇 2 n
+采螺 8 n
+采血 6 v
+采血车 3 n
+采行 29 v
+采衣 3 v
+采访 3369 v
+采访员 3 n
+采访团 8 n
+采访录 2 n
+采访报道 3 n
+采访新闻 3 n
+采访权 2 n
+采访编辑 3 n
+采访者 3 n
+采访记 3 n
+采访记者 3 n
+采访证 18 nr
+采访部 5 n
+采诗 12 v
+采货 3 v
+采购 1843 v
+采购价 4 n
+采购供应 3 n
+采购员 21 n
+采购商 7 n
+采购团 3 n
+采购师 3 n
+采购站 3 nz
+采购网 3 nz
+采购规则 3 n
+采购计划 4 n
+采购部 10 n
+采购额 8 n
+采辑 2 n
+采过 3 v
+采过去 3 v
+采过来 3 v
+采选 22 v
+采邑 74 nr
+采采 3 v
+采金 6 n
+采金地 3 n
+采铁 2 v
+采阳补阴 3 nr
+采集 719 v
+采集卡 3 nr
+采集器 2 n
+采集法 3 n
+采集者 27 n
+采集起来 3 nz
+采风 42 v
+采风问俗 3 n
+采食 32 v
+釈 2 zg
+釉 321 n
+釉上彩 11 n
+釉上皮 3 n
+釉丛 3 n
+釉基质 3 n
+釉子 3 n
+釉小皮 3 n
+釉工 3 n
+釉彩 3 n
+釉料 21 n
+釉板 3 n
+釉柱 3 n
+釉柱鞘 3 n
+釉梭 3 nz
+釉瓷 45 n
+釉索 3 n
+釉结 3 n
+釉色 36 n
+釉药 3 n
+釉质 13 n
+釉质发生 3 n
+釉质珠 3 n
+釉里红 8 nz
+釉陶 32 n
+釉面 18 n
+釉面横纹 3 n
+釉面砖 5 n
+释 826 nr
+释严颜 5 nr
+释义 44 nr
+释二教 2 nz
+释仇解 2 nr
+释例 3 n
+释俗 3 n
+释俘 3 v
+释免 3 v
+释典 3 nr
+释出 3 v
+释利摩 2 nr
+释剂 2 n
+释加牟 3 nr
+释卷 3 v
+释去重负 3 nr
+释名 16 v
+释器 2 n
+释回增美 3 nr
+释奠 3 v
+释奠于 2 nr
+释嫌 3 v
+释宋围 2 nr
+释家 3 n
+释尊 3 nr
+释小虎 3 nr
+释小龙 3 nr
+释怀 26 nr
+释慧琳 2 nr
+释手 3 v
+释放 2139 v
+释放出 3 v
+释放出来 3 v
+释放器 2 nz
+释放者 4 n
+释教 7 nz
+释教录 4 nr
+释教都 2 nr
+释文 39 nr
+释明 3 v
+释本 6 n
+释梦 2 nr
+释法 3 v
+释然 80 z
+释生取义 3 nr
+释疑 66 v
+释知遗形 3 n
+释缚焚榇 3 nr
+释菜礼 3 nr
+释藏 2 v
+释言 3 v
+释读 29 v
+释读天 3 nr
+释迎牟 2 nr
+释迦 39 nr
+释迦多 4 nr
+释迦方 2 nr
+释迦族 5 nr
+释迦牟尼 117 nr
+释道 7 v
+释道三 5 nr
+释道安 3 nr
+释重 3 v
+里 77054 f
+里一明 2 nr
+里三层外三层 15 l
+里下河 35 ns
+里丑捧心 3 i
+里丹药 2 nz
+里乌斯 12 nrt
+里亚克 3 nrt
+里亚原 16 ns
+里亚夫 13 nr
+里亚宁 2 nr
+里亚宾 2 ns
+里亚尔 8 nr
+里亚尼 2 nr
+里亚斯 10 nr
+里亚格 2 nrt
+里亚海 6 ns
+里亚湾 6 ns
+里亚蒂 9 nr
+里亚语 2 nr
+里亚诺 3 nr
+里亚迪 3 nr
+里亚金 5 nr
+里亚钦 2 nr
+里人 3 nrt
+里佐夫 2 nr
+里克 71 nrt
+里克利 31 nrt
+里克尔梅 3 nrt
+里克斯 3 nrt
+里克松 2 nr
+里克森 6 nr
+里克河 2 ns
+里克温 2 nr
+里出外进 3 l
+里利昂 3 ns
+里剑光 2 nr
+里加 112 nrt
+里加斯 2 ns
+里加病 3 n
+里勾外联 3 i
+里勾外连 3 i
+里卡 10 nrt
+里卡多 5 nrt
+里卡尔 3 nrt
+里卡尔多 3 nrt
+里场 3 n
+里坡 3 ns
+里埃尔 6 nrt
+里基 16 nrt
+里塔 2 nrt
+里士多德 2 nrt
+里士满 19 nr
+里夏尔 6 nrt
+里外 177 f
+里外不是 3 l
+里外不是人 10 l
+里外勾结 3 i
+里外受敌 3 i
+里外夹攻 3 i
+里外开花 3 i
+里外里 4 nr
+里夫 36 nrt
+里夫兰 29 nr
+里夫斯 3 nrt
+里头 614 f
+里头儿 3 nr
+里奇 60 nrt
+里奇兰 2 nr
+里奇曲率 3 nz
+里奇蒙 2 nr
+里奎斯 2 nr
+里奥 68 nrt
+里奥尔 17 nrt
+里奥斯 4 nrt
+里奥格兰德 3 nrt
+里姆 9 nrt
+里姆斯基 6 nrt
+里姆林 4 nr
+里子 35 n
+里安 18 nrt
+里安柱 2 nr
+里宾 3 ns
+里富兰 8 ns
+里尔 65 nrt
+里尔克 10 nrt
+里尔岭 2 nrt
+里尔帕 2 nrt
+里尔逊 3 nrt
+里尼 42 nrt
+里尼奥 7 nrt
+里层 3 f
+里屋 102 n
+里巷 31 ns
+里巷之谈 3 i
+里布 13 nrt
+里希南 2 ns
+里希特 12 nr
+里希纳 4 nr
+里带里根 3 nr
+里干事 3 n
+里庄 16 ns
+里庄村 4 nr
+里应外合 80 i
+里弄 42 ns
+里弗 3 nrt
+里弗兰 7 nr
+里德 116 nrt
+里德亚 16 ns
+里德伯 19 nr
+里德利 2 nr
+里德尔 8 nr
+里拉 101 nrt
+里拉琴 3 nr
+里挺剑 2 nr
+里数 23 n
+里料 3 n
+里斯 71 nrt
+里斯丹 7 ns
+里斯坦 9 nrt
+里斯基 2 nrt
+里斯托 3 nrt
+里斯本 118 ns
+里斯特 5 nrt
+里斯科 3 nrt
+里斯莱 2 nrt
+里昂 247 nrt
+里昂市 2 ns
+里昂队 3 nr
+里普斯 3 nrt
+里曼城 2 ns
+里有件 3 n
+里来 3 f
+里查德 3 nrt
+里根 97 ns
+里格 7 nrt
+里格夫 2 nrt
+里格尼 5 nr
+里格斯 2 nrt
+里森 15 nrt
+里比多 3 nrt
+里氏 24 nr
+里民 3 ns
+里民大会 3 nt
+里泛青 2 nr
+里海 256 ns
+里港 3 ns
+里湖 12 ns
+里特 169 nrt
+里特尔 5 nrt
+里特雄 16 nr
+里瑟 6 nrt
+里瓦 19 nrt
+里瓦尔多 3 nrt
+里瓦斯 4 nrt
+里瓦达维亚 3 nrt
+里生外熟 3 l
+里甲 45 ns
+里科夫 3 nrt
+里科尔 2 nrt
+里科弗 2 nr
+里程 1371 n
+里程碑 265 n
+里程碑式 28 b
+里程表 9 n
+里程计 4 n
+里窝那 4 nrt
+里米 2 nrt
+里米尼 12 nrt
+里约热内 3 ns
+里约热内卢 123 ns
+里约集团 6 nt
+里纳 8 nrt
+里维埃 8 ns
+里维廉 2 nrt
+里维拉 5 nrt
+里维斯 3 nrt
+里维特 3 nrt
+里维西 2 ns
+里耐尔 2 nr
+里耶夫 13 nrt
+里耶尔 5 nrt
+里肌肉 3 n
+里脊 10 n
+里脊肉 2 n
+里脚手 3 n
+里色 3 n
+里色奥 3 nr
+里茨 9 nrt
+里茨方法 3 nz
+里莱斯 2 nrt
+里菲思 5 nr
+里萨 11 nrt
+里衬 3 n
+里诺夫 2 nrt
+里谈巷议 3 i
+里谷 3 ns
+里贾纳 3 nr
+里赫利 8 nr
+里边 637 f
+里边儿 10 nr
+里达 9 nrt
+里运河 43 ns
+里通外合 3 i
+里通外国 13 nt
+里通外敌 3 i
+里里 3 nrt
+里里外外 245 l
+里长 62 n
+里间 189 f
+里闾 3 n
+里雅宾 2 nr
+里雅语 2 nz
+里静静 2 nr
+里面 5994 f
+里面儿 3 n
+里韦拉 3 nrt
+里韦罗 4 nrt
+里马 12 ns
+重 15718 a
+重三叠四 3 t
+重三迭四 3 ns
+重上 3 d
+重丘区 3 ns
+重中之重 107 l
+重为 3 v
+重义气 3 n
+重义轻利 3 n
+重义轻生 2 n
+重义轻财 3 i
+重九 12 t
+重九登高 3 i
+重于 130 v
+重于泰山 20 i
+重人 3 n
+重仓 3 v
+重仓股 24 n
+重价 6 n
+重任 628 n
+重任在肩 14 i
+重传 3 vn
+重伤 1503 a
+重伤事故 3 n
+重伤号 8 n
+重伤员 26 n
+重伤风 3 n
+重估价 3 n
+重低音 3 n
+重作 3 vn
+重作冯妇 3 i
+重信 7 a
+重修 834 vn
+重修旧好 7 l
+重修费 3 n
+重元素 23 n
+重光 29 n
+重光累洽 3 n
+重入 3 v
+重兴旗鼓 3 i
+重兵 422 n
+重兵把守 3 n
+重典 19 ns
+重写 62 v
+重农主义 3 n
+重出 21 v
+重出江湖 3 n
+重击 25 vn
+重刑 44 n
+重刑犯 4 n
+重划 3 n
+重则 3 n
+重创 240 n
+重利 18 a
+重到 3 v
+重制 3 v
+重刷 3 vn
+重剑 82 n
+重力 589 n
+重力仪 17 n
+重力加速 3 n
+重力势能 3 n
+重力单位 3 n
+重力场 71 n
+重力坝 38 n
+重力基点 3 n
+重力梯度 3 n
+重力选矿 3 n
+重办 5 v
+重化工 6 n
+重化工业 35 n
+重印 56 n
+重印书目 3 n
+重印本 5 n
+重压 70 n
+重厚寡言 3 i
+重友谊 3 nz
+重友轻色 3 n
+重发 3 v
+重叙旧好 3 l
+重叠 349 v
+重叠式 7 b
+重叠构象 3 n
+重叠法 3 b
+重叠群 3 n
+重叠重复 3 i
+重号 3 n
+重合 129 vn
+重合同 3 a
+重名 27 a
+重名名 3 n
+重听 16 a
+重启 68 v
+重启动 3 l
+重吸收 3 n
+重味 3 n
+重命名 3 n
+重唱 39 v
+重商主义 59 n
+重回 151 v
+重围 244 n
+重图 3 n
+重圆 3 n
+重圭叠组 3 n
+重地 170 n
+重场 3 n
+重型 725 b
+重型化 2 n
+重型机械 3 n
+重型汽车 3 n
+重型货架 3 n
+重型车 3 n
+重垣叠锁 3 i
+重垣迭锁 3 l
+重塑 73 n
+重复 1829 d
+重复使用 3 l
+重复劳动 3 l
+重复区 3 n
+重复子 3 n
+重复式 3 l
+重复性 27 n
+重复本 3 l
+重复标识 3 n
+重复法 3 n
+重复记录 3 n
+重复部分 3 l
+重复阻抗 3 i
+重外孙女 3 n
+重外孙子 3 n
+重大 12193 a
+重大事件 3 n
+重大事故 3 n
+重大任务 3 n
+重大意义 3 ns
+重大成就 3 i
+重大成果 3 nz
+重大损失 3 n
+重大斗争 3 nz
+重大新闻 3 nz
+重大案件 3 n
+重大突破 3 i
+重大胜利 3 ns
+重大贡献 3 n
+重大责任 3 l
+重大过失 3 i
+重大进展 3 nt
+重大项目 3 n
+重头 39 n
+重头戏 66 n
+重奏 37 n
+重奖 36 nz
+重如泰山 6 i
+重婚 20 v
+重婚案 5 n
+重婚纳妾 3 n
+重婚罪 14 n
+重嫁 3 v
+重子 52 n
+重孙 27 n
+重孙女 3 n
+重孙子 12 n
+重孝 14 a
+重学 3 n
+重安江 3 ns
+重定向 3 n
+重宝 3 n
+重实效 3 n
+重审 13 vn
+重寄生 3 n
+重山 10 ns
+重山复岭 3 i
+重山复水 3 i
+重山峻岭 3 ns
+重岩叠嶂 3 i
+重峦叠嶂 5 i
+重峦叠巘 3 l
+重峦复嶂 3 i
+重峦迭巘 3 l
+重工 89 vn
+重工业 441 n
+重工业部 17 nt
+重工轻商 3 n
+重庆 3518 ns
+重庆出版社 5 nt
+重庆力帆 3 nz
+重庆力帆队 24 n
+重庆医药 3 nt
+重庆地区 7 ns
+重庆大学 44 nt
+重庆市 806 ns
+重庆市公安局 2 nt
+重庆市委 2 nt
+重庆市政协 5 nt
+重庆市政府 4 nt
+重庆政府 2 nt
+重庆晚报 3 nz
+重庆晨报 3 nz
+重庆江北国际机场 3 nt
+重庆江北机场 2 ns
+重庆火锅 3 n
+重庆版 3 nz
+重庆电信 3 nz
+重庆电视台 2 nt
+重庆百货 2 nz
+重庆百货大楼股份有限公司 4 n
+重庆谈判 3 n
+重庆路 3 ns
+重庆队 59 nt
+重床叠屋 3 nz
+重床叠架 3 nz
+重床迭屋 3 nz
+重床迭架 3 nz
+重度 108 n
+重建 3491 a
+重建家园 3 ns
+重建术 3 n
+重建法 3 n
+重开 57 v
+重弹 3 n
+重弹老调 3 n
+重归 3 v
+重归于好 14 l
+重当 3 a
+重录 3 n
+重彩 26 a
+重彩画 3 n
+重影 10 n
+重心 542 a
+重心坐标 3 n
+重心点 3 n
+重情 3 n
+重情义 3 n
+重惩 3 v
+重感冒 16 n
+重手累足 3 z
+重托 79 v
+重扣 6 n
+重扼 3 l
+重抄 3 v
+重报 3 n
+重担 317 v
+重拍 3 v
+重拳 50 n
+重拳出击 3 i
+重拾 3 v
+重挫 3 v
+重振 157 a
+重振旗鼓 39 i
+重振朝纲 3 n
+重振雄风 3 l
+重排 56 vn
+重排本 3 l
+重接 3 v
+重描 3 n
+重提 143 n
+重提旧事 3 n
+重摄取 3 i
+重摔 3 n
+重播 85 vn
+重播节目 3 n
+重操旧业 19 n
+重放 3 v
+重数 3 n
+重敲 3 v
+重整 147 vn
+重整家园 3 n
+重整旗鼓 34 i
+重整齐鼓 3 z
+重文轻武 3 n
+重新 8297 a
+重新估价 3 n
+重新做人 3 l
+重新储存 3 n
+重新分配 3 l
+重新制定 3 n
+重新加入 3 n
+重新加油 3 n
+重新包扎 3 n
+重新占领 3 n
+重新召集 3 ns
+重新启动 3 i
+重新命名 3 n
+重新处理 3 n
+重新夺得 3 i
+重新学习 3 n
+重新安排 3 nt
+重新安装 3 nz
+重新得到 3 l
+重新排列 3 j
+重新整理 3 n
+重新武装 3 n
+重新点燃 3 i
+重新犯罪 3 i
+重新组合 3 j
+重新组建 3 j
+重新考虑 3 n
+重新聚合 3 nz
+重新聚集 3 nz
+重新补充 3 l
+重新装配 3 l
+重新认识 3 l
+重新起动 3 nz
+重新部署 3 n
+重新配置 3 n
+重新重心 3 n
+重新铸造 3 l
+重施故技 3 i
+重旱 2 a
+重明继焰 3 n
+重映 3 v
+重晚 3 t
+重晶石 382 n
+重望 3 a
+重望高名 3 i
+重机 5 n
+重机关枪 3 l
+重机枪 139 n
+重机械 3 n
+重权势 3 n
+重来 3 v
+重构 44 n
+重样 3 d
+重棒眼 3 n
+重楼 3 n
+重檐 822 n
+重此抑彼 3 l
+重武器 32 n
+重武轻文 3 n
+重残 3 a
+重气徇命 3 i
+重气狥名 3 vn
+重气轻命 3 i
+重气轻生 3 z
+重氢 6 n
+重氮 25 n
+重氮偶联 3 nz
+重氮化 13 n
+重氮基 3 n
+重氮盐 3 n
+重水 36 n
+重水复 3 l
+重汽 4 j
+重油 22 n
+重洋 7 ns
+重活 34 vn
+重活儿 3 n
+重涂 3 a
+重温 127 n
+重温旧业 3 n
+重温旧梦 3 l
+重游 3 vn
+重游旧地 3 n
+重演 316 vn
+重灌 3 v
+重灾 5 n
+重灾区 65 n
+重灾户 2 n
+重炮 175 n
+重点 12694 n
+重点中学 3 nt
+重点保护 3 n
+重点县 31 n
+重点嫌疑 3 z
+重点学科 3 n
+重点对象 3 n
+重点式 3 n
+重点校 4 n
+重点班 7 v
+重点线 42 n
+重点部位 3 n
+重点难点 3 n
+重点项目 3 n
+重点高中 3 l
+重点高校 3 nt
+重熔 13 n
+重熙累叶 3 i
+重熙累盛 3 i
+重爬 3 v
+重版 9 v
+重物 99 n
+重特大 14 ns
+重犯 40 n
+重现 345 v
+重珪叠组 3 n
+重理旧业 3 n
+重瓣胃 2 n
+重生 46 n
+重生父母 7 n
+重生爷娘 3 n
+重用 671 v
+重申 599 v
+重申立场 3 n
+重申观点 3 n
+重电子 3 n
+重男轻女 30 n
+重甸甸 13 z
+重画 3 n
+重病 210 n
+重病号 2 n
+重病缠身 5 i
+重症 145 n
+重登 26 a
+重百 9 nz
+重睹天日 3 i
+重石 3 n
+重码 3 n
+重码率 3 n
+重码词 3 n
+重磅 39 n
+重礼 3 n
+重离子 64 n
+重税 12 n
+重竿 3 n
+重纰貤缪 3 v
+重纸累札 3 n
+重组 925 vn
+重组股 3 n
+重结晶 3 z
+重编目 3 n
+重编页码 3 n
+重罚 97 vn
+重罪 84 vn
+重罪轻判 3 n
+重置 23 n
+重置成本 3 l
+重置费用 3 n
+重考 3 v
+重考生 3 n
+重者 178 n
+重耳 16 a
+重聚 3 v
+重臂 3 n
+重臣 360 n
+重色轻友 3 n
+重茬 3 n
+重荷 6 n
+重获 3 v
+重葩累藻 3 ns
+重行 3 v
+重衬 3 n
+重裀列鼎 3 v
+重装 3 n
+重装备 3 n
+重装机兵 3 n
+重装系统 3 l
+重裘 3 n
+重要 37557 a
+重要一环 3 i
+重要依据 3 l
+重要关头 3 l
+重要性 979 n
+重要批示 3 n
+重要文件 3 n
+重要文献 3 n
+重要环节 3 l
+重要职责 3 l
+重要著作 3 n
+重要讲话 3 l
+重要途径 3 l
+重覆 3 v
+重见 46 a
+重见光明 3 i
+重见天日 61 i
+重规叠矩 3 z
+重规沓矩 3 i
+重规累矩 3 z
+重规袭矩 3 i
+重规迭矩 3 l
+重视 6063 v
+重言 13 n
+重言式 3 n
+重计 3 vn
+重议 3 n
+重设 15 vn
+重设键 3 n
+重访 4 v
+重译 3 v
+重试 3 vn
+重话 3 n
+重读 28 v
+重谢 23 v
+重负 42 v
+重财 3 v
+重财轻义 2 i
+重责 69 v
+重责大任 3 l
+重质原油 3 n
+重贴现率 3 n
+重资 3 vn
+重赋 3 n
+重赏 197 v
+重赏之下 13 l
+重起炉灶 8 i
+重足一迹 3 i
+重足屏息 3 i
+重足屏气 3 i
+重足累息 3 i
+重足而立 3 i
+重跌 3 v
+重踏 3 v
+重蹈 53 n
+重蹈覆辙 43 i
+重轨 3 n
+重轰炸机 3 l
+重载 55 v
+重迁 3 vn
+重运行点 3 n
+重返 390 v
+重返家园 3 n
+重迭 13 d
+重述 3 b
+重迹屏气 3 i
+重选 3 v
+重选一次 3 l
+重造 3 v
+重逢 171 v
+重配 3 vn
+重酬 3 n
+重重 1032 a
+重重包围 22 n
+重重叠叠 62 z
+重重困难 3 i
+重重围住 3 l
+重重围困 13 i
+重重地 163 z
+重重的 132 z
+重重障碍 3 n
+重重难关 3 l
+重量 1610 n
+重量单 3 n
+重量级 88 b
+重量计 3 v
+重量轻 3 v
+重金 166 n
+重金兼紫 3 i
+重金属 112 n
+重金收买 3 l
+重金礼聘 3 n
+重金聘用 3 n
+重金袭汤 3 nz
+重钙粉 3 n
+重钢 3 n
+重铬酸钠 4 nz
+重铬酸钾 2 nz
+重锤 3 n
+重镇 665 ns
+重阳 665 ns
+重阳节 47 n
+重陷囹圄 3 i
+重障 3 v
+重难点 7 n
+重霄 4 n
+重音 36 n
+重音符号 3 n
+野 1470 n
+野三关镇 3 n
+野三坡 3 nr
+野上 6 s
+野上丽香 3 nr
+野上唯香 3 n
+野上寒子 3 n
+野丫头 3 n
+野中 7 s
+野中广务 3 l
+野人 585 n
+野人奏曝 3 nr
+野人族 3 nz
+野人献日 3 n
+野人献曝 3 nr
+野人献芹 3 nr
+野人谷 3 n
+野兔 152 n
+野兔子 3 n
+野兰 3 nz
+野兰花 3 nz
+野兽 605 n
+野兽派 3 n
+野利仁荣 8 nr
+野劲儿 3 n
+野叟 3 n
+野叟曝言 3 i
+野口 4 n
+野台 3 n
+野台戏 3 n
+野史 86 n
+野合 25 n
+野味 353 n
+野味十足 3 i
+野地 112 n
+野地训练 3 n
+野外 705 s
+野外作业 3 n
+野外工作 8 n
+野外求生 3 i
+野外装备 3 n
+野外队 3 n
+野孩子 3 n
+野宴 3 n
+野山 12 n
+野山参 4 nz
+野山羊 3 n
+野岛伸司 3 n
+野心 617 n
+野心人士 3 n
+野心勃勃 119 i
+野心家 89 n
+野性 89 b
+野性未脱 3 l
+野性美 3 nz
+野性难驯 3 i
+野战 497 nz
+野战军 656 n
+野战医院 3 nz
+野战排 3 n
+野战条令 3 n
+野战炮 57 n
+野战炮兵 3 n
+野战部队 3 n
+野手 3 n
+野放 3 b
+野无遗才 3 i
+野无遗贤 3 i
+野景 2 n
+野望 3 n
+野木瓜 3 n
+野村 45 n
+野果 97 n
+野果子 8 n
+野柳 3 n
+野柳乡 3 n
+野汉子 3 nr
+野没遗贤 3 i
+野渡 10 n
+野游 3 n
+野火 29 n
+野火烧 3 i
+野火烧不尽 9 i
+野火版 3 n
+野炊 12 n
+野炮 29 n
+野炮营 3 n
+野牛 103 n
+野牛群 3 n
+野牛草 3 nz
+野牦牛 3 vn
+野物 58 n
+野犬 3 n
+野狐禅 8 nr
+野狗 80 n
+野狗群 3 nr
+野狼 27 n
+野猪 228 n
+野猪林 7 nz
+野猫 114 n
+野王 10 nrt
+野玫瑰 3 nr
+野球 3 n
+野球拳 3 n
+野生 1768 b
+野生动物 3 n
+野生型 3 b
+野生大豆 3 nz
+野生植物 3 n
+野生种 19 n
+野生虎 5 nz
+野田 6 nz
+野病毒 4 n
+野百合 3 n
+野祭 3 n
+野禽 9 n
+野种 14 b
+野翅膀 2 n
+野老 21 n
+野胡萝卜 3 n
+野色 3 b
+野芋 3 n
+野花 155 n
+野芹菜 3 nr
+野茫茫 3 i
+野草 115 n
+野草堆 3 n
+野草闲花 5 i
+野菊 4 n
+野菊花 11 nz
+野菜 238 n
+野营 38 b
+野营区 3 n
+野营地 3 n
+野营拉练 3 n
+野营训练 3 n
+野营队 3 n
+野葛 3 n
+野葛根 3 nz
+野葡萄 6 n
+野葫芦引 2 n
+野葬 3 n
+野葱 6 b
+野蓟 3 n
+野蔌山肴 3 nr
+野蔷薇 7 n
+野蚕 6 n
+野蛮 915 a
+野蛮冲撞 3 i
+野蛮女友 3 n
+野蛮暴行 3 i
+野蛮装卸 3 n
+野蜂 3 n
+野调无腔 3 l
+野豌豆 3 n
+野象 10 n
+野趣 14 n
+野间 5 n
+野雁 3 n
+野食 6 n
+野食儿 3 n
+野餐 49 n
+野餐盒 3 n
+野马 157 n
+野马无缰 3 i
+野马追 3 i
+野驴 55 n
+野骆驼 3 n
+野鬼 3 n
+野鸟 7 n
+野鸟群 3 n
+野鸡 88 n
+野鸡大学 3 nz
+野鸡车 3 n
+野鸭 76 n
+野鸭子 13 n
+野鸭蛋 2 n
+野鸳鸯 3 n
+野鸽 15 n
+野鸽子 3 nz
+野鹤 3 n
+野鹤孤云 3 i
+野鹤闲云 3 i
+野鹿 25 n
+野麦 3 n
+野麻 3 n
+野鼠 36 n
+量 10182 n
+量产 3 n
+量人为出 3 i
+量仪 11 n
+量价背离 3 i
+量体温 3 n
+量体裁衣 10 n
+量体重 3 l
+量值 31 n
+量入为出 18 i
+量入计出 3 i
+量具 33 n
+量减少 3 i
+量出为入 2 i
+量分析 3 l
+量刑 71 n
+量力 12 n
+量力度德 3 n
+量力而为 5 l
+量力而行 91 l
+量化 117 v
+量变 100 v
+量器 7 n
+量回去 3 l
+量回来 3 l
+量块 3 n
+量大增 3 i
+量如江海 3 i
+量子 617 n
+量子产率 3 n
+量子光学 3 l
+量子力学 244 l
+量子化 74 l
+量子化学 61 l
+量子场论 30 n
+量子学说 3 l
+量子态 3 n
+量子数 3 n
+量子检测 3 n
+量子群 3 n
+量子论 53 n
+量完 3 v
+量小力微 3 l
+量尺寸 2 n
+量差 3 n
+量己审分 3 n
+量度 94 n
+量成 3 v
+量才器使 3 n
+量才录用 6 l
+量才施用 3 i
+量才而为 3 i
+量控 3 v
+量时度力 3 l
+量材录用 3 n
+量杯 3 n
+量枘制凿 3 v
+量水堰 3 n
+量水槽 3 n
+量油尺 3 n
+量浅 3 n
+量热器 3 n
+量热学 3 n
+量瓶 3 n
+量程 28 n
+量窄 3 n
+量筒 22 n
+量级 107 n
+量纲 3 n
+量纲分析 3 l
+量能授官 3 l
+量表 3 n
+量规 10 n
+量角 3 n
+量角器 3 n
+量角规 3 n
+量计 11 v
+量计算 3 l
+量词 50 n
+量贩式 3 n
+量身 3 n
+量身定做 3 l
+量过去 3 l
+量过大 3 l
+量过来 3 l
+量量 3 n
+量量看 3 l
+量金买赋 3 n
+量限 3 n
+釐 28 zg
+金 15074 nr
+金一南 62 nr
+金一哲 11 nr
+金万昌 4 nr
+金三世 2 nr
+金三角 26 nz
+金三银 2 nr
+金三顺 3 nr
+金不换 8 i
+金世宗 39 nr
+金世明 4 nr
+金业 3 n
+金业勤 2 n
+金东 4 nr
+金东区 3 ns
+金东园 3 nr
+金东文 4 nr
+金东木 2 nr
+金丝 617 n
+金丝小枣 15 n
+金丝柳 3 nr
+金丝燕 61 nr
+金丝猫 3 nr
+金丝猴 373 n
+金丝猿 3 nr
+金丝绒 4 nr
+金丝边 13 nr
+金丝雀 2 n
+金丝鸟 2 nr
+金中都 23 nr
+金丰 5 nz
+金丰投资 45 nz
+金丸 6 n
+金丸信 3 nr
+金丸珠 2 nr
+金丹 103 nr
+金丹之 5 nr
+金丹元婴 2 nr
+金丹奉 2 nr
+金丹换骨 3 i
+金丹期 4 nz
+金丹术 2 nr
+金丹派 4 nr
+金丹独 2 nr
+金丹里 2 nr
+金主 8 n
+金主亮 3 nr
+金主侦 2 nr
+金主敕 2 nr
+金主暴 2 n
+金丽华 2 nr
+金乃杰 2 nr
+金义成 2 nr
+金之俊 35 nr
+金之竣 7 nr
+金之策 2 nr
+金之议 2 nr
+金之象 2 nr
+金乌 55 nr
+金乌派 31 nr
+金乌玉兔 3 nr
+金乌西 3 nr
+金乌西坠 3 i
+金乔觉 10 nr
+金九银 14 nr
+金乡 19 n
+金乡县 5 ns
+金书 6 n
+金书铁券 3 nz
+金云翅 2 nr
+金云翘 13 nr
+金云龙 4 nr
+金互动 3 l
+金五星 4 nr
+金井 30 n
+金井中 2 nr
+金井玉 2 nr
+金井里 3 nr
+金交椅 20 n
+金亦设 2 nr
+金亭馆 4 nr
+金亮架 2 nr
+金人 3 n
+金人三缄 3 nr
+金人之缄 3 nr
+金人庆 5 nr
+金人成 2 nr
+金人战 2 nz
+金人缄口 3 i
+金仑溪 3 ns
+金代 625 n
+金代初 2 nr
+金代章 2 nr
+金代董 5 nr
+金仲华 3 nr
+金价 118 n
+金伐辽 3 nr
+金会俊 3 nr
+金伯利 37 nr
+金佛山 12 nr
+金俊山 149 nr
+金俊文 85 nr
+金俊斌 23 nr
+金俊武 272 nr
+金俊海 36 nr
+金俗 6 n
+金信 10 nz
+金信安 32 nr
+金像 13 n
+金像奖 30 nz
+金兀术 19 nr
+金元 243 nz
+金元丹 21 nr
+金元国 3 nr
+金元外交 3 n
+金元宝 287 nr
+金元帅 5 nr
+金元王国 3 nr
+金元荣 3 nr
+金光 322 nr
+金光亮 70 nr
+金光党 3 nr
+金光大道 3 nz
+金光明 47 nr
+金光灿灿 14 nr
+金光灿烂 27 z
+金光燮 3 nr
+金光盖地 3 n
+金光辉 4 nr
+金光闪闪 74 z
+金克尔 6 nr
+金克木 19 nr
+金全盛 2 nz
+金六福 3 nr
+金兰 29 nr
+金兰之 4 nr
+金兰之交 3 nr
+金兰之友 3 nr
+金兰之契 3 nr
+金兰之好 3 nr
+金兰契 2 nr
+金兰姊妹 2 nr
+金兰湾 18 nr
+金兰结 4 nr
+金兰语 2 nz
+金兴贤 3 nr
+金兵 182 n
+金兵势 2 n
+金兵南 2 nr
+金兵渡 6 nr
+金兵相 2 nr
+金具 2 n
+金冉冉 94 nr
+金军侵 2 nr
+金军入 9 nr
+金军军 3 nr
+金军分 3 nr
+金军势 2 n
+金军北 5 nr
+金军南 12 nr
+金军如 3 nr
+金军攻 4 nr
+金军渡 6 nr
+金军败 3 nr
+金军进 2 nr
+金农 10 nz
+金农网 3 nz
+金冠 212 n
+金冲及 23 nrfg
+金凤凰 11 nr
+金凤区 3 nr
+金凤花 3 nr
+金凤还巢 3 nr
+金凯德 2 nr
+金凯瑞 3 nr
+金击子 9 n
+金刀 7 n
+金刀势 2 n
+金刀寨 23 nr
+金刀挥 4 nr
+金刀杨 2 nr
+金刀王 19 nr
+金刀疾 2 nr
+金刀绣 128 nr
+金刃 3 n
+金切玉 5 nr
+金刑俊 3 nr
+金刚 640 nr
+金刚努目 3 nr
+金刚山 22 nr
+金刚怒目 3 i
+金刚恕月 3 nr
+金刚杵 3 nr
+金刚烷 3 nr
+金刚烷胺 3 n
+金刚眼睛 3 n
+金刚石 287 nr
+金刚砂 11 nr
+金刚经 58 nr
+金刚胺 3 n
+金刚钻 24 nr
+金创 3 n
+金创药 5 nz
+金利 259 nz
+金利域 21 nr
+金利来 2 nr
+金利源 2 nr
+金利莱 3 nr
+金前线 2 nr
+金勒银 2 nr
+金勒马 2 nr
+金化 5 n
+金化攻势 10 n
+金化郡 2 nr
+金匙 3 n
+金匠 20 n
+金匮 3 i
+金匮石室 3 i
+金匮要略 27 i
+金匾 3 n
+金华 224 nz
+金华人 8 nr
+金华县 9 ns
+金华市 15 ns
+金华戏 3 n
+金华殿语 3 nz
+金南珠 3 nr
+金卡价 3 nz
+金卤灯 3 nz
+金印 66 nr
+金印紫绶 3 nr
+金厂 2 n
+金厦 2 n
+金县 3 ns
+金友玉昆 3 nr
+金发 153 nz
+金发女郎 3 n
+金发碧眼 3 nr
+金变沙 2 nr
+金口 50 n
+金口御言 3 n
+金口木舌 3 i
+金口河区 2 ns
+金口玉牙 2 nr
+金口玉言 5 nr
+金口玉音 3 nr
+金口难开 3 i
+金古符 4 nr
+金台 546 n
+金台区 3 ns
+金台市骏 3 nr
+金台西路 5 ns
+金台路 3 nz
+金台里 2 nr
+金史 8 n
+金叶 29 n
+金叶金兰 3 nr
+金合欢 27 nr
+金合欢树 3 n
+金合欢花 3 n
+金吉列 3 nr
+金同好 3 nr
+金同珍 8 nr
+金同舟 3 nr
+金名臣 6 nr
+金吾不禁 3 i
+金吾卫 3 nr
+金吾村 3 nr
+金吾秩 3 nr
+金吾耿 5 nr
+金员外 3 n
+金和 3 nz
+金和银 24 nr
+金哀宗 27 nr
+金善宝 4 nr
+金善雅 3 nr
+金喜善 10 nr
+金喜爱 3 nr
+金喜贞 3 nr
+金嗓子 11 nz
+金嗓子喉宝 5 nz
+金器 16 n
+金园区 3 ns
+金国 191 ns
+金国使者 2 n
+金国六 4 nr
+金国兵 4 nr
+金国将军 3 nr
+金国方 2 nr
+金国林 6 nr
+金国汗 3 nr
+金国灭 4 nr
+金国王子 5 nr
+金国王爷 5 nr
+金国皇帝 8 nr
+金国赵 4 nr
+金国钦 14 nr
+金图 4 n
+金圆券 32 n
+金土地 3 n
+金圣叹 15 nr
+金圣宫 15 nr
+金圣皇后 2 nr
+金地 16 n
+金坑 3 n
+金块 21 n
+金坛 32 n
+金坛县 5 ns
+金坛市 7 ns
+金坤 11 nz
+金坤道 3 ns
+金城 131 ns
+金城千里 3 nr
+金城川 2 ns
+金城武 7 nr
+金城江区 3 ns
+金城池地 3 ns
+金城汤地 3 ns
+金城汤池 3 ns
+金城石室 3 n
+金城郡 18 nr
+金培华 12 nr
+金基德 3 nr
+金基鹏 3 nr
+金堂 13 nr
+金堂南 2 nr
+金堂县 3 nr
+金堂峡 2 nr
+金堤 2 n
+金塔 17 nr
+金塔县 2 ns
+金塔寺 3 nr
+金境 2 n
+金墉城 21 nr
+金壁辉煌 3 i
+金士尧 2 nr
+金士珍 15 nr
+金士顿 11 nr
+金壮龙 16 nr
+金声 33 n
+金声掷地 3 i
+金声玉应 3 i
+金声玉振 3 nr
+金声玉服 3 nr
+金声玉润 3 nr
+金声玉色 3 i
+金声遥 2 nr
+金壶 5 n
+金壶墨汁 3 i
+金复州 3 nr
+金多宝 3 nr
+金大中 103 nr
+金大人 11 nr
+金大侠 3 nr
+金大坚 40 nr
+金大定 24 nr
+金大班 3 nr
+金大监 2 nr
+金大鹏 3 nr
+金天会 8 nr
+金天氏 5 nr
+金天翮 7 nr
+金天辅 2 nr
+金太太 2 nr
+金太宗 38 nr
+金太祖 34 nr
+金太阳 3 nr
+金夫人 3 nr
+金奉如 25 nr
+金奖 153 nz
+金始 2 nz
+金威 94 nr
+金威队 5 n
+金娃娃 34 nr
+金婚 4 n
+金嫣 463 nrfg
+金子 356 n
+金子般 3 nr
+金字 97 n
+金字塔 425 nr
+金字塔式 24 nz
+金字塔状 5 nz
+金字招牌 37 n
+金存 2 n
+金学 31 n
+金学台 4 n
+金学峰 3 nr
+金学曾 614 nr
+金宅雷 8 nr
+金宇春 5 nr
+金宇车 10 nr
+金安 19 nz
+金安区 3 ns
+金安歌 3 nr
+金宗勋 2 nr
+金宗英 2 nr
+金定 4 n
+金定洲 3 ns
+金宝善 2 nr
+金宝花 3 nr
+金宝贝 2 nr
+金宣宗 31 nr
+金家 90 n
+金家三 2 nr
+金家兄弟 2 nr
+金家巷 3 nr
+金家庄 3 nr
+金家庄区 3 ns
+金家户 2 n
+金家湾 98 nr
+金家疃村 3 vn
+金家藩 3 nr
+金容淳 5 nr
+金宽斌 2 nr
+金密国 2 ns
+金寇 9 n
+金寇之 3 nr
+金富 54 nz
+金寨 10 nr
+金寨县 11 ns
+金寨路 3 nr
+金寸舟 2 nr
+金将军 3 nr
+金小丑 2 nr
+金小明 2 nr
+金小玉 2 nr
+金小蜂 11 nr
+金少山 5 nr
+金尚 2 n
+金尚钟 3 nr
+金尼尔 3 nr
+金尼阁 6 nr
+金尽裘弊 3 i
+金尽裘敝 3 i
+金屋 15 n
+金屋之选 3 nr
+金屋娇娘 3 nr
+金屋藏娇 13 nr
+金屋贮娇 3 n
+金屏生 2 nr
+金属 4290 n
+金属丝 23 nz
+金属丝网 3 nz
+金属主义 3 nz
+金属产品 3 n
+金属件 3 n
+金属元素 57 n
+金属光泽 3 nz
+金属制 9 n
+金属制品 3 n
+金属制造 3 n
+金属加工 3 nz
+金属包装 3 n
+金属化 3 nz
+金属卟啉 3 nr
+金属品 5 n
+金属器 8 nz
+金属器皿 3 n
+金属圈 3 nz
+金属型铸 3 n
+金属基托 3 nz
+金属塑料 3 nz
+金属外壳 3 nz
+金属学 5 n
+金属家具 3 n
+金属封装 3 n
+金属工艺 3 n
+金属带 2 n
+金属建材 3 nz
+金属性 2 n
+金属探伤 2 n
+金属支架 3 n
+金属杆 3 n
+金属材料 8 n
+金属板 3 nz
+金属构件 3 n
+金属核酶 3 n
+金属棒 16 nz
+金属模 3 n
+金属漆 3 nz
+金属片 23 nz
+金属物 5 n
+金属环 3 nz
+金属电极 3 n
+金属矿 133 nz
+金属矿床 3 n
+金属硅 3 nz
+金属磨带 3 nz
+金属管 13 nz
+金属簇 3 nr
+金属粉末 3 n
+金属粒子 3 nz
+金属纤维 3 nz
+金属线 3 nz
+金属线材 3 n
+金属结构 3 n
+金属罐 2 nz
+金属网 5 nz
+金属肽 3 nz
+金属肽酶 3 n
+金属背牙 3 nz
+金属腐蚀 3 nz
+金属膜 17 nz
+金属色 3 n
+金属薄板 3 nz
+金属蛋白 3 l
+金属表面 3 n
+金属货币 3 n
+金属软管 3 n
+金属酶 3 nz
+金属钙 11 nz
+金属钠 52 nz
+金属银 3 nz
+金属锂 8 nz
+金属锑 3 nz
+金属键 3 n
+金属锰 6 nz
+金属镁 3 nz
+金属镉 2 nz
+金属门 3 n
+金属陶瓷 19 nz
+金山 291 nr
+金山乡 3 ns
+金山公司 2 n
+金山区 8 ns
+金山县 9 ns
+金山口 8 ns
+金山嘴 4 nr
+金山寺 32 nr
+金山屯区 3 ns
+金山岭 7 nr
+金山影霸 3 nr
+金山快译 3 nr
+金山明星 3 nz
+金山明珠 3 nr
+金山毒霸 3 nz
+金山游侠 3 nr
+金山画王 3 nr
+金山网镖 3 n
+金山词霸 3 nr
+金岚珠 3 nr
+金岳霖 9 nr
+金川 113 ns
+金川区 3 ns
+金川县 2 ns
+金川有色金属公司 3 nt
+金川河 3 ns
+金川镇 3 nr
+金州 40 ns
+金州区 11 ns
+金州路 3 ns
+金工 11 n
+金巧巧 3 nr
+金币 149 n
+金布律 5 nr
+金布里 2 nr
+金帛之 3 nr
+金帛相 4 nr
+金帛粮 2 nr
+金帛请 2 nr
+金带梅 2 nr
+金平 520 nr
+金平区 3 ns
+金平府 13 nr
+金平糖 5 nr
+金平苗族瑶族傣族自治县 5 ns
+金平阳 2 ns
+金庆圭 2 nr
+金庆堂 2 nr
+金庆寿 2 nr
+金庆玉 2 nr
+金库 73 nz
+金库门 3 nr
+金店 7 n
+金庸 331 nrfg
+金庸群 3 nr
+金廷 9 n
+金开诚 3 nr
+金开锣 2 nr
+金弘道 2 nr
+金张掖 10 ns
+金弹 3 n
+金彩 2 n
+金彩瓷 4 nr
+金律 3 n
+金循宋 4 nr
+金微山 7 nr
+金德炒 2 nr
+金德球员 4 n
+金德闹 2 nr
+金德队 69 nr
+金志 15 n
+金志扬 3 nr
+金志秀 3 nr
+金恒源 3 nz
+金惠淑 3 n
+金惠珍 3 nr
+金戈 6 nr
+金戈铁甲 3 nr
+金戈铁马 29 nz
+金戈铁骑 3 nr
+金成 8 nrfg
+金成一 4 nrfg
+金成民 3 nr
+金成熙 2 nrfg
+金戒指 3 n
+金戴银 4 nr
+金手指 3 nz
+金手镯 3 n
+金承佑 3 nrfg
+金技玉 2 nr
+金抗蒙 3 nr
+金报 3 n
+金收军 2 n
+金文 169 nz
+金文历 2 nr
+金文宜 2 nr
+金文秀 3 nr
+金文翔 4 nr
+金文陈 2 nr
+金斗 3 nr
+金斧 3 nz
+金断觿决 3 nr
+金斯克 2 nr
+金斯利 3 nz
+金斯基 2 nr
+金斯堡 2 nr
+金斯敦 33 ns
+金斯湾 2 nr
+金斯顿 9 nr
+金方 7 n
+金施子 2 nr
+金施尔 2 nr
+金旅 3 n
+金旋 3 n
+金旗掌 6 nr
+金旗旗 2 nr
+金无足赤 5 i
+金日 3 nz
+金日成 140 nrfg
+金旦旦 2 nr
+金旨 2 n
+金早立 2 nr
+金昌 113 nr
+金昌市 6 ns
+金明 2 nr
+金明寨 2 nr
+金明德 3 nr
+金明昌 8 nr
+金明池 41 nr
+金明章 4 nr
+金明馆 5 nr
+金易 2 n
+金星 695 nz
+金星奖 8 nz
+金昭玉粹 3 nr
+金晃晃 2 z
+金晓湘 5 nr
+金普斯 5 nr
+金晶恩 3 nr
+金智秀 3 nr
+金曜日 3 nr
+金曲 4 n
+金曲奖 3 nz
+金曲榜 3 nr
+金月兰 87 nr
+金有树 8 nr
+金朝东 2 nr
+金朝兴 2 nr
+金朝分 2 nr
+金朝君 3 nr
+金朝四 2 nr
+金朝守 2 nr
+金朝官 4 nr
+金朝州 2 nr
+金朝建国 3 ns
+金朝派 3 nr
+金朝皇帝 4 nr
+金朝都 3 nr
+金木水火 3 n
+金木水火土 2 n
+金末迁 2 nr
+金本位 7 n
+金本位制 51 n
+金本杜 3 nr
+金术士 3 n
+金权政治 3 n
+金杖 3 n
+金束发 2 n
+金条 100 n
+金来元 3 nr
+金来沅 3 nr
+金杯 72 nz
+金杯奖 3 nz
+金杯车 3 n
+金杵之 2 nr
+金杵如 2 nr
+金杵横 2 nr
+金杵舞 2 nr
+金杵落 2 nr
+金杵转 2 nr
+金杵递 2 nr
+金杵重 2 nr
+金杵金 4 nr
+金林鹏 3 nr
+金果 5 n
+金果榄 3 n
+金枝 20 n
+金枝欲 7 nr
+金枝玉叶 45 nr
+金枝玉孽 3 n
+金枣 3 n
+金枪 24 n
+金枪不倒 3 i
+金枪人 3 n
+金枪鱼 92 n
+金枷玉锁 3 i
+金柄 9 n
+金柏松 7 nr
+金柚 3 n
+金柜 3 n
+金校卫 3 nr
+金校慰 4 nr
+金根 79 nz
+金格 3 n
+金桂便 3 nr
+金桂华 64 nr
+金桂房 2 nr
+金桂笑 5 nr
+金桂见 3 nr
+金桔 18 nr
+金桥网 2 nz
+金桦果 2 n
+金梁王 2 nr
+金棕榈 15 nz
+金棕榈奖 9 nz
+金楚帝国 3 ns
+金榜 34 n
+金榜挂名 3 i
+金榜提名 3 i
+金榜题名 41 i
+金樱子 3 nr
+金樽玉 2 nr
+金橘 26 n
+金正勋 3 nr
+金正常 3 nr
+金正恩 3 nr
+金正日 352 nz
+金正昆 3 nr
+金步摇 2 nr
+金武生 3 nr
+金殿 1497 nr
+金毛 17 n
+金毛犬 7 nr
+金毛狗 2 nr
+金毛狮 108 nr
+金氏法 2 nr
+金民钟 3 n
+金水 13 n
+金水区 3 n
+金水桥 711 nr
+金水河 937 nr
+金水路 3 n
+金永南 10 nr
+金永哲 2 nr
+金永春 3 nr
+金永爱 3 nr
+金汇 7 n
+金江 6 ns
+金江义 16 nr
+金江街 3 ns
+金池长老 2 nr
+金汤 37 nr
+金汤之固 3 nr
+金沃 3 nz
+金沙 83 nr
+金沙县 3 ns
+金沙水 3 nr
+金沙江 223 ns
+金沙江流域 6 ns
+金沙江畔 2 ns
+金沙湾 2 ns
+金沙滩 3 nr
+金沙萨 39 nr
+金沙镇 3 nr
+金河 13 ns
+金河仁 3 nr
+金河水 2 nr
+金河田 3 nr
+金沸草 3 nr
+金泉 4 nz
+金泉网 3 nz
+金泊 3 n
+金波哥 7 nr
+金波妈 3 nr
+金波旬 12 nr
+金波湾 4 nr
+金波玉液 3 nr
+金泥玉 3 nr
+金泰 13 nz
+金泰克 3 nr
+金泰映 3 nr
+金泰熙 3 nz
+金泳 8 n
+金泳三 12 nrfg
+金泽洙 5 nr
+金泽海 2 nr
+金洋 4 ns
+金津 3 ns
+金流 2 n
+金浆玉液 3 n
+金浦 4 nz
+金海 7 ns
+金海岸 3 nr
+金海心 3 nr
+金海波 6 nr
+金海湖 16 nr
+金海陵 41 nr
+金海马 3 nr
+金液 2 n
+金淘沙拣 3 i
+金淳哲 2 nr
+金港 7 ns
+金湖 3 ns
+金湖县 3 ns
+金湾区 3 ns
+金源 10 n
+金溪 9 nr
+金溪县 2 nr
+金澄澄 2 nr
+金灯 2 n
+金灯桥 2 nr
+金灯苑 2 nr
+金灵含 2 nr
+金灿宇 3 nr
+金灿灿 56 nr
+金炳华 257 nr
+金炳植 3 nr
+金点子 3 nr
+金点胡 8 nr
+金焰 64 nrfg
+金煌煌 3 ns
+金熊奖 4 nz
+金熙 42 nz
+金燕子 3 nr
+金燕玲 3 nr
+金燕铃 3 nr
+金牌 943 n
+金牌奖 3 n
+金牌得主 3 n
+金牌数 3 n
+金牌榜 6 n
+金牙 698 ns
+金牛 66 nz
+金牛区 8 ns
+金牛实业 45 nz
+金牛山 15 nr
+金牛岭 2 nr
+金牛座 51 nz
+金牛能源 2 nz
+金牛道 2 nr
+金犀牛 3 nr
+金狐狸 3 nr
+金狮 10 nz
+金狮奖 6 nz
+金猫 5 n
+金猴 3 n
+金猴降妖 3 n
+金玄道 2 nr
+金玉 99 nr
+金玉丁香 2 nr
+金玉之言 3 nr
+金玉其 3 nr
+金玉其处 3 i
+金玉其外 3 nr
+金玉其质 3 nr
+金玉均 3 nr
+金玉奴 2 nr
+金玉如意 2 i
+金玉婷 3 nr
+金玉宝 3 nr
+金玉泉 3 nr
+金玉满堂 8 nr
+金玉良 3 nr
+金玉良缘 2 nr
+金玉良言 13 nr
+金玉锦绣 3 nr
+金玛利 2 nr
+金玟 3 z
+金玫 3 n
+金环三结 3 nr
+金环蛇 5 nr
+金珠玛米 2 nr
+金球 28 n
+金球击 3 nz
+金球奖 16 nz
+金球疾 2 n
+金瑞林 5 nr
+金璧辉煌 3 i
+金瓜 24 n
+金瓜石 5 nr
+金瓜银 2 nr
+金瓦寺 2 nr
+金瓯 25 nr
+金瓯无缺 3 vn
+金瓶掣签 13 l
+金瓶梅 233 nr
+金瓶落井 3 n
+金生 2 n
+金生水 3 nr
+金生记 2 n
+金田一 3 nr
+金田一一 3 nr
+金田村 17 nr
+金田河 3 nr
+金田起义 145 nz
+金甲利兵 3 nz
+金甲神 4 nr
+金甲茅 15 nr
+金甲虫 3 nr
+金甲锦 3 nr
+金界壕 2 n
+金疮 21 n
+金登干 3 nr
+金白银 3 nr
+金百万 3 nr
+金百蝶 2 nr
+金皇帝 9 nr
+金盆 96 n
+金盆坡 7 ns
+金盆洗手 3 n
+金盏 10 n
+金盏花 4 nr
+金盏草 3 nr
+金盒 3 n
+金盒子 2 nr
+金盘龙 3 nr
+金盛世 2 nr
+金相 3 nr
+金相学 3 nr
+金相庆 3 nr
+金相玉式 3 nr
+金相玉振 3 nr
+金相玉映 3 nr
+金相玉质 3 nr
+金盾 6 nr
+金眼妖瞳 3 n
+金眼彪 11 nr
+金睛兽 6 nr
+金睛火眼 3 l
+金睛鬼 2 nr
+金知雲 3 nt
+金石 450 nr
+金石不渝 3 i
+金石丝竹 3 nr
+金石为开 9 nr
+金石之交 3 i
+金石之功 3 nr
+金石之坚 3 nr
+金石之策 3 nr
+金石之言 3 nr
+金石之计 3 i
+金石交 3 nr
+金石交情 3 n
+金石可开 3 nr
+金石学 63 n
+金石家 6 n
+金石滩 2 nr
+金石至交 3 nr
+金石良言 6 nr
+金矿 150 n
+金矿业 6 n
+金矿石 3 n
+金码 3 n
+金砂 3 n
+金砖 10 n
+金砖银 2 nr
+金碗 3 n
+金碧 15 nr
+金碧交 3 nr
+金碧嘉 4 nr
+金碧荧煌 3 nr
+金碧辉映 3 nr
+金碧辉煌 375 nr
+金礞石 3 vn
+金祥高 9 nr
+金祯 3 nrt
+金秀壮 2 nr
+金秀山 2 nr
+金秀才 22 nr
+金秀来 2 nr
+金秀瑶族自治县 6 ns
+金秋 178 nr
+金科 5 nz
+金科玉律 19 nr
+金科玉条 3 nr
+金科玉津 3 nr
+金科玉臬 3 i
+金秘术 12 n
+金积堡 5 nr
+金称臣 8 nr
+金程 3 n
+金税 3 n
+金穗卡 3 nr
+金窝银 2 nz
+金立木 2 nr
+金章宗 30 nr
+金章玉句 3 i
+金章紫绶 3 nr
+金童 6 n
+金童奖 3 nz
+金童玉女 21 nr
+金竹公 2 nr
+金竹山 3 nr
+金笔 10 n
+金笛秀才 17 nr
+金笛舞 2 nr
+金符授 2 n
+金策 2 n
+金箍 3 nz
+金箍棒 134 n
+金箔 430 n
+金箔纸 3 n
+金算盘 3 n
+金管会 3 n
+金管局 7 n
+金篦刮目 3 n
+金簪 13 n
+金粉 22 n
+金粉地 2 n
+金粒 3 n
+金粟兰 6 nr
+金粪 3 n
+金精玉液 3 nr
+金精石 3 nr
+金素 3 n
+金素县 3 nr
+金素妍 3 nr
+金素梅 3 nr
+金紫光 6 nr
+金紫荆 3 nr
+金紫银青 3 nr
+金红利 22 nr
+金红石 61 nr
+金约 2 n
+金纸 3 n
+金纹工 3 n
+金线 8 n
+金线巷 2 n
+金线泉 3 nr
+金线绣 6 n
+金线虫 3 n
+金线鱼 4 n
+金绍尔 2 nr
+金绣袋 2 nr
+金绳来 2 nr
+金维他 3 ns
+金维映 2 nr
+金绿石 4 nr
+金缕玉衣 28 i
+金缕衣 3 n
+金缨子 3 nr
+金羊网 3 nz
+金美姬 3 nr
+金美林 3 nr
+金美淑 3 n
+金美玉 2 nr
+金羚 2 n
+金翅大 11 nr
+金翅擘海 3 vn
+金翅雀 6 n
+金翅鱼 4 nr
+金翅鸟 3 nr
+金翠莲 3 nr
+金耀门 4 nr
+金老公 3 nr
+金耳朵 3 nr
+金耳环 3 nr
+金胜宇 3 nr
+金能筹 2 nr
+金脉 4 n
+金腰带 3 n
+金腿 3 n
+金自孟 15 nrfg
+金舌弊口 3 n
+金舌蔽口 3 n
+金色 434 n
+金色年华 3 nz
+金色池塘 3 ns
+金色花 3 n
+金节 7 n
+金芒 3 n
+金芝禾 3 nz
+金花 849 n
+金花婆婆 3 nr
+金花菜 3 n
+金苗 3 n
+金英哲 2 nr
+金英玉 22 nr
+金苹果 8 nz
+金荞麦 3 v
+金荣垣 2 nr
+金荣笑 2 nr
+金药 2 n
+金荷娜 3 nr
+金莉莉 3 nr
+金莲 335 nr
+金莲花 3 nr
+金莺微 2 nr
+金葫芦 3 n
+金葱粉 3 nr
+金葵花 3 nr
+金蒂莱 2 nr
+金藻色素 3 n
+金蘸斧 2 nr
+金蚕 7 n
+金蛇 231 n
+金蛇剑 60 nr
+金蛇游 2 nr
+金蛇秘 22 nr
+金蛇银 3 nr
+金蛇锥 16 nr
+金蛋 3 n
+金蜘蛛 3 n
+金蝉 2 nr
+金蝉子 5 nr
+金蝉脱壳 26 nr
+金蝉长老 8 nr
+金蝶 110 n
+金蝶全 2 nr
+金蝶公司 4 n
+金融 6455 n
+金融业 172 n
+金融业务 2 n
+金融中心 11 n
+金融交易 3 n
+金融体制 3 n
+金融体系 3 n
+金融保险 3 n
+金融信息 4 n
+金融债 5 n
+金融债券 3 n
+金融债权 3 n
+金融公司 5 n
+金融区 6 n
+金融危机 3 n
+金融司 3 n
+金融城 3 nr
+金融学 41 n
+金融学院 3 n
+金融家 12 n
+金融寡头 19 n
+金融工具 3 n
+金融市场 192 n
+金融性 2 n
+金融报 3 nz
+金融时报 51 nz
+金融服务 19 n
+金融机关 3 n
+金融机具 3 n
+金融机构 22 n
+金融法 10 n
+金融版 7 n
+金融电子 3 n
+金融界 67 n
+金融监管 3 j
+金融管理 3 n
+金融类 6 n
+金融系 5 n
+金融网 3 nz
+金融股 10 n
+金融街 17 n
+金融设备 3 n
+金融证券 3 n
+金融贸易 3 nz
+金融资产 3 n
+金融资本 33 n
+金融部门 3 n
+金融风暴 3 n
+金融风险 3 n
+金蟾脱壳 3 nz
+金行 9 n
+金衡 3 nr
+金衡制 3 n
+金衣力士 2 n
+金表 42 n
+金袍 3 n
+金西京 2 ns
+金西林 3 nr
+金观政 2 nr
+金角 2 n
+金角湾 11 ns
+金角铜 6 n
+金角银 2 nr
+金言 6 n
+金计发 2 nz
+金诗 2 n
+金话筒 3 n
+金谷 16 n
+金谷园 2 nr
+金谷酒数 3 n
+金谷里 5 nr
+金象 82 n
+金象复 3 nr
+金貂取酒 3 nr
+金貂换酒 3 n
+金貂贳酒 3 vn
+金贞恩 3 nr
+金贤正 3 nr
+金贤珠 3 nr
+金质 115 n
+金质奖 20 n
+金质奖章 3 n
+金贵升 3 nr
+金起弘 3 nr
+金超群 3 nr
+金身 3 n
+金身罗汉 2 nr
+金车 3 n
+金轮 649 n
+金轮法 191 n
+金轮法王 3 nz
+金轮铁 2 n
+金轮飞 3 nr
+金载沅 3 nr
+金辉玉洁 3 nr
+金边 134 n
+金边王宫 3 ns
+金边眼镜 3 nz
+金辽朝 2 nr
+金达 2 nz
+金达拉 2 nr
+金达莱 6 nr
+金近 10 t
+金迪亚 3 nr
+金迪至 2 nr
+金迷纸碎 3 i
+金迷纸醉 3 i
+金通 3 nz
+金邦平 3 nr
+金都 30 ns
+金量 9 n
+金量来 3 nr
+金金 17 n
+金銮宝 8 nr
+金銮宝座 3 nr
+金銮店 3 ns
+金銮殿 57 nr
+金针 232 n
+金针度人 3 n
+金针菇 12 n
+金针菜 12 n
+金针虫 8 nr
+金针见血 3 i
+金钏儿 41 nr
+金钗 16 nr
+金钗十二 3 nr
+金钗换 2 nr
+金钗换酒 3 nr
+金钗石 2 nr
+金钗细合 3 nr
+金钟 26 nr
+金钟国 3 nr
+金钟奖 2 nr
+金钟杰 2 nr
+金钟泌 8 n
+金钟罩 11 nr
+金钢 24 n
+金钢伞 31 nr
+金钢桥 4 nz
+金钢琢 4 nr
+金钢石 2 nr
+金钢砂石 3 nz
+金钢砂轮 3 nz
+金钢砂钻 3 nz
+金钢钻 4 nr
+金钥匙 18 n
+金钩 10 nz
+金钱 1121 n
+金钱万能 3 i
+金钱值 3 n
+金钱关 2 n
+金钱挂帅 3 n
+金钱松 48 nr
+金钱游戏 3 n
+金钱美女 3 n
+金钱至上 3 i
+金钱草 7 nr
+金钱观 3 n
+金钱豹 328 nr
+金钱龟 3 nr
+金铁 8 n
+金铁交 9 nr
+金铁林 2 nz
+金铁相 3 nr
+金铁销 3 n
+金铃 50 nz
+金铃子 2 n
+金铃玲 2 nr
+金铃索 22 nr
+金铃软 11 nr
+金铃飞 2 nr
+金铜 4 n
+金铜矿物 3 n
+金铜铁 2 nr
+金铬 3 n
+金银 1340 nz
+金银丝 3 nr
+金银制 7 nr
+金银器 28 nr
+金银岛 16 nr
+金银币 3 n
+金银彩 3 nr
+金银木 3 nr
+金银滩 12 nr
+金银牌 11 n
+金银珠宝 3 nz
+金银箔 3 n
+金银线 3 nr
+金银花 60 nr
+金银财宝 129 nr
+金银财富 3 nr
+金银铜 26 nr
+金银铜铁 3 nz
+金铺 133 n
+金链 3 n
+金锁记 4 nr
+金锁锁 2 nr
+金锞子 6 nr
+金锡勋 3 nr
+金锣 264 n
+金锦香 3 nr
+金锭 9 n
+金镑 3 nr
+金镖 8 n
+金镞科 2 nr
+金镯 3 n
+金镯子 3 nz
+金镳玉络 3 nr
+金镶宝 2 nr
+金镶玉 5 nr
+金镶玉裹 3 nr
+金镶珠 3 nr
+金长城 9 nr
+金门 149 n
+金门县 8 ns
+金门大桥 38 nz
+金门岛 16 ns
+金门绣户 3 ns
+金门诱户 3 nz
+金门马祖 3 nr
+金闪闪 4 z
+金闺国士 3 n
+金闺玉堂 3 i
+金阁寺 11 nr
+金阊区 3 nr
+金阙云 2 nr
+金阳 3 ns
+金阳县 3 ns
+金陵 432 nr
+金陵中学 7 nt
+金陵乡 3 nr
+金难 2 n
+金雀花 15 nr
+金雁功 6 nr
+金雁桥 5 nr
+金雁横 2 nr
+金雄白 3 nr
+金雕 6 n
+金雨泽 3 nr
+金霉素 14 n
+金霞岭 2 nr
+金霸王 3 nr
+金青罗 2 nr
+金静华 3 nr
+金非玉 2 nr
+金非铁 4 nr
+金面佛 76 nr
+金革 3 n
+金革亡难 3 n
+金靴 29 nz
+金靴奖 8 nz
+金鞋奖 4 nz
+金鞍玉 2 nr
+金音 2 n
+金顶 56 n
+金顶寺 7 nr
+金顶绵 4 nr
+金项链 3 n
+金领 65 n
+金额 1292 n
+金额满 3 nr
+金风 21 n
+金风寨 7 nr
+金风玉露 4 nr
+金风送爽 3 i
+金饭碗 3 n
+金饰 28 n
+金饰品 3 n
+金香玉 6 nr
+金马 33 nz
+金马地区 3 ns
+金马奖 29 nz
+金马河 4 nr
+金马玉堂 3 nr
+金鱼 109 n
+金鱼池 6 nr
+金鱼缸 9 nz
+金鱼胡同 9 ns
+金鱼草 3 nr
+金鱼藻 4 nr
+金鱼虫 3 nr
+金鲁生 293 nr
+金鲁贤 2 nr
+金鳞玉 2 nr
+金鳷擘海 3 vn
+金鸡 191 n
+金鸡亭 3 nr
+金鸡奖 37 nz
+金鸡山 2 nr
+金鸡岭 3 nr
+金鸡消息 2 n
+金鸡湖 7 nr
+金鸡独立 19 i
+金鸡纳 3 nr
+金鸡纳树 8 ns
+金鸡纳霜 14 nz
+金鸳鸯 2 nr
+金鸽 4 n
+金鹏奖 3 nr
+金鹏杯 2 nr
+金鹰奖 4 nz
+金鹰节 3 nr
+金麒麟 21 nr
+金黄 421 nr
+金黄地鼠 3 n
+金黄色 344 n
+金鼎奖 3 nz
+金鼓 10 n
+金鼓喧 2 nr
+金鼓喧阗 3 nr
+金鼓振 2 nr
+金鼓旗 6 nr
+金鼓连天 3 i
+金鼓齐鸣 20 i
+金齿 2 n
+金龙泉 2 nr
+金龙队 3 n
+金龙鱼 3 nr
+金龟 53 nr
+金龟婿 3 nr
+金龟子 27 nr
+金龟换酒 3 n
+金龟车 3 n
+釚 2 zg
+釜 1210 ns
+釜中之鱼 3 i
+釜中游鱼 3 i
+釜中生尘 3 i
+釜中生鱼 3 i
+釜中鱼 3 i
+釜山 124 ns
+釜底抽薪 38 i
+釜底游魂 3 i
+釜底游鱼 4 i
+釜鱼幕燕 3 ns
+釜鱼甑尘 3 vn
+釦 6 zg
+釦上 3 z
+釦上去 3 v
+釦上来 3 v
+釦下 3 vn
+釦下去 3 v
+釦下来 3 vn
+釦了 3 y
+釦在 3 z
+釦好 3 z
+釦子 3 v
+釦着 3 y
+釦紧 3 v
+釦起 3 vn
+釦起来 3 v
+釪 12 zg
+釭 11 zg
+釱 8 zg
+釼 67 zg
+釿 2 zg
+鈇 13 zg
+鈈 11 zg
+鈋 35 zg
+鈒 11 zg
+鈚 6 zg
+鈛 2 zg
+鈤 2 zg
+鈥 2416 zg
+鈪 5 zg
+鈰 8 zg
+鈴 2 zg
+鈶 4 zg
+鉅 2 zg
+鉏 4 zg
+鉔 104 zg
+鉙 188 zg
+鉠 5 zg
+鉤 8 zg
+鉥心刿肾 3 v
+鉥肝刿肾 3 v
+鉧 2 zg
+鉨 15 zg
+鉩 9 zg
+鉲 8 zg
+鉴 565 p
+鉴于 951 p
+鉴别 442 v
+鉴别仪 3 nz
+鉴别信息 3 i
+鉴别剂 3 nz
+鉴别力 13 nz
+鉴别器 3 nz
+鉴别手段 3 n
+鉴别方法 3 nz
+鉴别染色 3 n
+鉴别法 2 vn
+鉴别能力 3 nz
+鉴前毖后 3 i
+鉴安 3 nrt
+鉴定 1226 v
+鉴定中心 3 n
+鉴定书 15 n
+鉴定人 20 n
+鉴定会 264 n
+鉴定员 3 n
+鉴定室 2 n
+鉴定家 17 n
+鉴定组 3 n
+鉴定结论 3 n
+鉴定考试 3 n
+鉴定者 9 n
+鉴定证书 3 n
+鉴定费 7 n
+鉴察 3 vn
+鉴影度形 3 n
+鉴往知来 3 i
+鉴戒 25 vn
+鉴明 3 v
+鉴机识变 3 i
+鉴核 3 vn
+鉴毛辨色 3 n
+鉴湖 20 ns
+鉴湖女侠 2 n
+鉴照 3 p
+鉴相器 19 n
+鉴真 44 nz
+鉴真纪念堂 7 nz
+鉴空衡平 3 n
+鉴裁 3 vn
+鉴证 18 vn
+鉴证师 3 n
+鉴识 3 v
+鉴诫 3 v
+鉴谅 3 v
+鉴貌辨色 29 n
+鉴赏 188 v
+鉴赏会 2 n
+鉴赏力 15 n
+鉴赏家 12 n
+鉴赏能力 3 n
+鉴频 3 vn
+鉴频器 10 n
+鉷 3 zg
+鉻 12 zg
+銀 2 zg
+銃 2 zg
+銆 6982 zg
+銊 2 zg
+銎 36 g
+銐 100 zg
+銙 4 zg
+銮 87 g
+銮舆 12 n
+銮铃 3 n
+銮驾 34 n
+銲住 3 vn
+銲工 3 vn
+銲接 3 vn
+銲枪 3 v
+銲锡 3 nz
+銶 105 zg
+銷 29 zg
+銻 17 zg
+銼 20 zg
+銾 3 zg
+銿 2 zg
+鋁 6 zg
+鋆 9 zg
+鋈 123 g
+鋐 7 zg
+鋕 7 zg
+鋘 3 zg
+鋚 3 zg
+鋬 2 zg
+鋱 7 zg
+鋹 5 zg
+鋽 5 zg
+錏 2 zg
+錘 378 zg
+錝 71 zg
+錞 58 zg
+錡 12 zg
+錧 326 zg
+錬 4 zg
+錯 120 zg
+錱 18 zg
+録 2 zg
+錶 41 zg
+錻 2 zg
+錾 88 v
+錾刀 3 n
+錾子 3 n
+鍂 189 zg
+鍅 11 zg
+鍉 3 zg
+鍊 421 zg
+鍋 334 zg
+鍌 27 zg
+鍍 226 zg
+鍎 141 zg
+鍏 2134 zg
+鍐 1528 zg
+鍑 1749 zg
+鍒 2309 zg
+鍓 567 zg
+鍔 1192 zg
+鍕 194 zg
+鍖 484 zg
+鍗 1181 zg
+鍘 877 zg
+鍙 2979 zg
+鍚 2323 zg
+鍛 1050 zg
+鍜 822 zg
+鍝 415 zg
+鍞 82 zg
+鍟 366 zg
+鍠 206 zg
+鍡 58 zg
+鍢 236 zg
+鍣 45 zg
+鍤 26 zg
+鍥 1141 zg
+鍦 2932 zg
+鍧 308 zg
+鍨 32 zg
+鍩 283 zg
+鍪 150 x
+鍫 89 zg
+鍬 4 zg
+鍱 2 zg
+鍼黹 3 n
+鍾 10 zg
+鍿 22 zg
+鎀 16 zg
+鎁 5 zg
+鎈 5 zg
+鎉 12 zg
+鎌 3 zg
+鎌仓幕府 3 nr
+鎎 3 zg
+鎏 67 b
+鎏金 46 b
+鎑 16 zg
+鎒 2 zg
+鎓 4 zg
+鎔 6 zg
+鎔剂 3 v
+鎔化 3 vn
+鎔岩 3 v
+鎔度 3 vn
+鎔接 3 vn
+鎔炉 3 v
+鎔点 3 z
+鎔融 3 z
+鎔解 3 vn
+鎔铸 3 v
+鎔销 3 vn
+鎗 10 zg
+鎚 9 zg
+鎛 7 zg
+鎝 43 zg
+鎞 2 zg
+鎡 12 zg
+鎩 3 zg
+鎬 827 zg
+鎭 323 zg
+鎮 296 zg
+鎯 1013 zg
+鎰 515 zg
+鎱 105 zg
+鎲 19 zg
+鎳 32 zg
+鎴 2117 zg
+鎵 1510 zg
+鎶 1077 zg
+鎷 471 zg
+鎸 583 zg
+鎹 200 zg
+鎺 468 zg
+鎻 228 zg
+鎼 150 zg
+鎽 168 zg
+鎾 131 zg
+鎿 59 zg
+鏀 716 zg
+鏁 547 zg
+鏂 1258 zg
+鏃 1660 zg
+鏄 4025 zg
+鏅 855 zg
+鏆 134 zg
+鏇 222 zg
+鏈 2960 zg
+鏉 2105 zg
+鏊 59 n
+鏊子 24 n
+鏋 552 zg
+鏌 288 zg
+鏍 702 zg
+鏐 5 zg
+鏖 24 v
+鏖兵 3 v
+鏖战 112 v
+鏖战到底 3 nz
+鏖战犹酣 3 z
+鏬 6 zg
+鏮 37 zg
+鏯 6 zg
+鏱 2 zg
+鏴 27 zg
+鏿 30 zg
+鐄 3 zg
+鐇 18 zg
+鐍 39 zg
+鐎 10 zg
+鐏 251 zg
+鐐 436 zg
+鐑 229 zg
+鐒 686 zg
+鐓 79 zg
+鐔 46 zg
+鐕 20 zg
+鐖 210 zg
+鐗 1193 zg
+鐘 135 zg
+鐙 230 zg
+鐚 100 zg
+鐜 696 zg
+鐝 49 zg
+鐞 231 zg
+鐟 11 zg
+鐠 2 zg
+鐡 51 zg
+鐢 947 zg
+鐣 197 zg
+鐤 189 zg
+鐥 151 zg
+鐦 32 zg
+鐧 236 zg
+鐨 5901 zg
+鐩 614 zg
+鐪 1326 zg
+鐫 753 zg
+鐬 103 zg
+鐭 449 zg
+鐮 108 zg
+鐵 2 zg
+鐾 47 g
+鐾刀布 3 nr
+鑅 20 zg
+鑉 30 zg
+鑊 24 zg
+鑋 25 zg
+鑍 8 zg
+鑐 4 zg
+鑜 45 zg
+鑞枪头 3 v
+鑨 44 zg
+鑫 141 nr
+鑫茂 6 nz
+鑫诺 19 nz
+鑫诺号 3 nz
+鑰 942 zg
+鑱 144 zg
+鑲 330 zg
+鑳 744 zg
+鑴 434 zg
+鑵 235 zg
+鑶 60 zg
+鑷 660 zg
+鑸 170 zg
+鑹 183 zg
+鑺 160 zg
+鑻 525 zg
+鑼 57 zg
+鑽 186 zg
+鑾 142 zg
+鑿 28 zg
+钀 395 zg
+钁 67 zg
+钁头 3 vn
+钂 43 zg
+钃 93 zg
+钄 23 zg
+钅 26 zg
+钆 13 g
+钇 57 g
+针 2434 p
+针入度 3 n
+针入度比 3 i
+针凿 3 v
+针刺 260 n
+针刺毡 3 i
+针刺麻醉 24 l
+针剂 47 n
+针叶 94 n
+针叶林 274 n
+针叶树 47 n
+针头 71 n
+针头削铁 3 n
+针头线尾 3 n
+针头线脑 19 n
+针孔 43 n
+针孔照像 3 n
+针对 4053 p
+针对实际 3 l
+针对性 571 n
+针尖 63 n
+针尖对麦芒 8 n
+针峰 3 n
+针工 3 n
+针布 3 v
+针式 4 n
+针形叶 3 n
+针打印机 3 l
+针插 3 v
+针杆 3 n
+针梳机 3 n
+针毡 3 n
+针法 51 n
+针灸 328 n
+针灸大成 3 n
+针灸学 19 n
+针灸师 4 n
+针灸术 2 n
+针灸疗法 3 n
+针灸科 6 n
+针炙 4 v
+针状 77 n
+针状物 3 l
+针盘 3 n
+针眼 20 n
+针眼子 3 n
+针砭 23 v
+针砭时弊 22 i
+针筒 4 n
+针箍 3 n
+针管 11 n
+针纺织 3 n
+针纺织品 2 n
+针线 164 n
+针线包 10 n
+针线活 32 n
+针线活儿 3 n
+针线盒 3 n
+针线袋 3 n
+针织 101 n
+针织厂 7 n
+针织品 22 n
+针织布 3 n
+针织料 3 n
+针织机 14 n
+针织物 20 n
+针织纱 3 n
+针织衫 2 n
+针脚 27 n
+针芒 2 n
+针芥之合 3 l
+针芥之投 3 l
+针芥相投 3 l
+针角 3 n
+针迹 2 n
+针锋 3 n
+针锋相对 194 i
+针骨 3 n
+针麻 3 n
+针黹 16 n
+针鼹 13 n
+针鼻 4 n
+针鼻儿 3 n
+钉 1651 v
+钉上去 3 l
+钉上来 3 l
+钉下 3 n
+钉下去 3 l
+钉下来 3 l
+钉书机 3 n
+钉书针 3 n
+钉人 3 n
+钉住 52 v
+钉入 3 n
+钉合 3 n
+钉嘴铁舌 3 l
+钉头 3 n
+钉头磷磷 3 n
+钉好 3 n
+钉子 229 n
+钉子户 25 n
+钉尖 3 n
+钉嵌体 3 n
+钉帽 3 n
+钉床 3 n
+钉形固位 3 n
+钉扣子 3 l
+钉是钉 3 l
+钉来钉去 3 l
+钉梢 3 n
+钉死 3 n
+钉洞 3 n
+钉牢 3 n
+钉状牙 3 l
+钉痕 3 n
+钉紧 3 l
+钉耙 5 n
+钉耙猫 3 nz
+钉脚 3 n
+钉螺 39 n
+钉过 3 n
+钉过去 3 l
+钉过来 3 l
+钉进 3 l
+钉进去 3 l
+钉进来 3 l
+钉钉子 3 l
+钉钮 3 n
+钉钮釦 3 z
+钉锤 4 n
+钉问 3 n
+钉鞋 50 n
+钉齿耙 5 n
+钊 318 g
+钋 77 ng
+钌 57 zg
+钍 139 ng
+钎 43 ng
+钎头 3 n
+钎子 5 n
+钎焊 10 n
+钏 50 nr
+钐 21 g
+钑 304 zg
+钒 447 n
+钒酸盐 3 n
+钒钝化剂 3 nz
+钒铁 3 n
+钒铅矿 3 n
+钒镍比 3 z
+钓 417 v
+钓上 3 v
+钓上去 3 v
+钓上来 3 v
+钓丝 14 n
+钓个 3 n
+钓公 4 n
+钓具 4 n
+钓具店 3 n
+钓利 3 ns
+钓到 3 v
+钓勾 3 n
+钓去 3 v
+钓台 4 ns
+钓名 3 v
+钓名欺世 3 i
+钓名沽誉 3 n
+钓名要誉 3 l
+钓场 3 n
+钓大鱼 17 ns
+钓好 3 v
+钓子 3 n
+钓客 3 n
+钓徒 3 n
+钓得 3 v
+钓游之地 3 l
+钓秆 3 n
+钓竿 25 n
+钓线 3 n
+钓船 3 n
+钓虾 3 n
+钓虾场 3 n
+钓誉 3 n
+钓誉沽名 3 n
+钓走 3 v
+钓起 3 v
+钓起来 3 l
+钓过 3 v
+钓钓 3 v
+钓钓鱼 3 l
+钓钩 15 v
+钓饵 14 n
+钓鱼 317 n
+钓鱼人 11 n
+钓鱼台 96 ns
+钓鱼台列 3 ns
+钓鱼台国宾馆 43 ns
+钓鱼岛 339 ns
+钓鱼式 3 n
+钓鱼用具 3 l
+钓鱼竿 3 n
+钓鱼网 3 n
+钓鱼者 2 n
+钔 19 g
+钕 37 g
+钕铁硼 5 n
+钖 81 zg
+钗 235 ng
+钗头凤 4 n
+钗横鬓乱 3 vn
+钗荆裙布 3 vn
+钗鐶 3 n
+钘 28 zg
+钙 1142 n
+钙剂 14 n
+钙化 97 v
+钙塑 3 n
+钙奶 3 n
+钙库 3 n
+钙拮抗剂 3 nz
+钙振荡 3 n
+钙池 3 n
+钙波 3 n
+钙泵 3 n
+钙片 10 n
+钙磷蛋白 3 n
+钙粘蛋白 3 n
+钙精蛋白 3 n
+钙肥 4 n
+钙膨润土 3 n
+钙芒硝 3 nz
+钙蛋白 3 n
+钙试剂 3 n
+钙调素 3 n
+钙质 148 n
+钙超载 3 vn
+钙通道 3 n
+钙钛矿 5 n
+钙镁磷肥 3 n
+钙长石 4 n
+钚 124 n
+钚后元素 3 v
+钛 879 nz
+钛合金 3 nz
+钛白 3 nz
+钛白粉 3 nz
+钛酸 4 nz
+钛酸钡 4 nz
+钛酸锶 2 nz
+钛铁 5 nz
+钛铁矿 38 nz
+钛镍丝 3 z
+钜 48 g
+钜人长德 3 nr
+钜子 3 nr
+钜学鸿生 3 nr
+钜款 3 nr
+钜额 3 nr
+钝 341 zg
+钝兵 3 n
+钝兵挫锐 3 nz
+钝刀 3 n
+钝剑 3 n
+钝劣 3 a
+钝化 34 v
+钝化剂 3 n
+钝化工艺 3 n
+钝响 3 v
+钝器 3 n
+钝学累功 3 n
+钝性 3 n
+钝挫 3 v
+钝斧 3 n
+钝气 3 n
+钝滞 3 v
+钝角 9 n
+钝钝 3 a
+钝顶 3 n
+钞 747 ng
+钞券 3 n
+钞录 3 n
+钞本 3 n
+钞票 313 n
+钟 3570 nr
+钟万仇 201 nr
+钟丽琼 2 nr
+钟丽缇 3 nr
+钟乳石 28 n
+钟仪奏楚 3 nr
+钟会 11 n
+钟会攻 3 nr
+钟会构 2 n
+钟体 14 n
+钟佳宜 3 nr
+钟健夫 2 nr
+钟兆文 3 nr
+钟兆琳 5 nr
+钟兆能 3 nr
+钟兆英 3 nr
+钟克勤 128 nr
+钟公摇 2 nr
+钟关 3 ns
+钟兴民 3 nr
+钟南山 11 ns
+钟叔河 7 nr
+钟名湖 2 nr
+钟响 3 n
+钟响声 3 n
+钟啸灵 3 nr
+钟善桐 4 nr
+钟嗣成 5 nr
+钟嘉欣 3 nr
+钟四嫂 3 nr
+钟塔 19 nr
+钟声 285 nr
+钟夫人 46 nr
+钟头 205 n
+钟头工 3 n
+钟子仪 3 nr
+钟子昂 9 nr
+钟子期 263 nr
+钟宅 3 n
+钟安平 2 nr
+钟宜淳 5 nr
+钟家湾 3 nr
+钟小二 3 nr
+钟小鸟 2 nr
+钟山 123 nr
+钟山区 3 ns
+钟山县 3 ns
+钟师兄 4 nr
+钟座 3 n
+钟开莱 8 nr
+钟形裙 2 nr
+钟律 4 n
+钟志灵 12 nr
+钟恺欣 2 nr
+钟情 123 n
+钟意 3 n
+钟慧冰 3 nr
+钟摆 32 n
+钟敬之 8 nr
+钟敬文 8 nr
+钟文芳 9 nr
+钟明亮 16 nr
+钟朋荣 256 nr
+钟架 3 n
+钟树楠 3 nr
+钟楚红 3 nr
+钟楼 157 nr
+钟楼区 3 nr
+钟楼怪人 3 i
+钟欣桐 3 nr
+钟水饺 3 n
+钟汉良 3 nr
+钟泄媛 3 nr
+钟浩然 6 nr
+钟淑慧 3 i
+钟漏并歇 3 n
+钟潜九 2 nr
+钟灵可 128 nr
+钟灵叹 5 nr
+钟灵吓 3 nr
+钟灵听 2 nr
+钟灵大 4 nr
+钟灵奇 3 nr
+钟灵奔 2 nr
+钟灵心 2 nr
+钟灵忙 2 nr
+钟灵忽 2 nr
+钟灵惊 2 nr
+钟灵拉 2 nr
+钟灵毓秀 7 nr
+钟灵甚 2 nr
+钟灵笑 3 nr
+钟灵见 3 nr
+钟灵那 5 nr
+钟点 34 n
+钟点工 16 nr
+钟点房 3 nr
+钟点费 3 nr
+钟焕娣 4 nr
+钟燕明 5 nr
+钟爱 107 nr
+钟状 3 n
+钟状期 3 n
+钟玉磬 2 nr
+钟理 6 n
+钟琪久 3 nr
+钟瑶道 6 nr
+钟磬鼓 2 nr
+钟祥 549 nr
+钟祥县 3 nr
+钟祥市 776 nr
+钟离 23 n
+钟立珍 4 nr
+钟立风 3 nr
+钟粹 2 n
+钟粹宫 20 nr
+钟素知 2 nr
+钟繇 33 nr
+钟罩 4 n
+钟罩状 2 nr
+钟羽正 3 nr
+钟肇政 3 nr
+钟肇鹏 3 nr
+钟茶来 2 nr
+钟行 10 n
+钟表 171 n
+钟表匠 4 n
+钟表厂 2 n
+钟表学 3 n
+钟表店 2 n
+钟训正 34 nr
+钟谷主 26 nr
+钟路 3 n
+钟镇涛 2 nr
+钟镇西 2 nr
+钟阳胜 3 nr
+钟阳阳 256 nr
+钟阿四 3 nr
+钟面 5 n
+钟馗 52 nr
+钟鸣漏尽 3 i
+钟鸣鼎列 3 nr
+钟鸣鼎重 3 nr
+钟鸣鼎食 8 i
+钟鸣鼓 3 nr
+钟麟忍 2 nr
+钟鼎 11 nr
+钟鼎之 2 nr
+钟鼎之家 3 nr
+钟鼎人家 3 n
+钟鼎山林 3 nr
+钟鼎彝 6 nr
+钟鼎文 2 nr
+钟鼓 84 n
+钟鼓之色 3 i
+钟鼓楼 36 nr
+钟鼓馔玉 2 i
+钠 894 n
+钠尿肽 3 nz
+钠气灯 3 n
+钠泵 6 nz
+钠溶液 2 nz
+钠灯 91 nz
+钠玻璃 3 nz
+钠盐 67 nz
+钠硝石 4 nz
+钠硫电池 3 nz
+钠离子 3 nz
+钠钾泵 3 nz
+钠长石 26 nz
+钡 431 n
+钡剂 13 n
+钡盐 7 n
+钡餐 13 n
+钢 2541 n
+钢丝 141 n
+钢丝刷 3 n
+钢丝圈 3 n
+钢丝床 9 n
+钢丝绳 55 n
+钢丝网 3 n
+钢丝钳 3 n
+钢丝锯 6 n
+钢之家 3 n
+钢之炼 3 l
+钢产量 3 n
+钢件 5 n
+钢凿 2 n
+钢刀 252 n
+钢制 35 n
+钢制品 3 n
+钢制成 3 n
+钢包 2 n
+钢化 4 n
+钢化玻璃 18 n
+钢协 3 n
+钢印 3 n
+钢厂 300 n
+钢叉 88 n
+钢号 3 n
+钢圈 11 n
+钢坯 12 n
+钢城 9 n
+钢城区 3 n
+钢塔 5 n
+钢套 3 n
+钢尺 5 n
+钢带 4 n
+钢抹压光 3 l
+钢料 3 n
+钢斧 7 n
+钢材 620 n
+钢材价格 3 n
+钢材市场 3 n
+钢材网 3 n
+钢条 17 n
+钢杯 3 n
+钢板 308 n
+钢板网 3 n
+钢枪 27 n
+钢架 13 n
+钢柔 3 l
+钢柔并济 3 n
+钢栅 3 n
+钢格板 3 n
+钢桥 13 n
+钢桶 2 n
+钢梁 166 n
+钢棒 3 n
+钢模 2 n
+钢模板 3 n
+钢水 15 n
+钢浇铁铸 3 n
+钢混 2 n
+钢渣 8 n
+钢炮 7 n
+钢片 3 n
+钢片琴 6 n
+钢版 3 n
+钢珠 29 n
+钢球 16 n
+钢琴 992 n
+钢琴伴奏 3 n
+钢琴协奏 3 n
+钢琴家 84 n
+钢琴师 6 n
+钢琴曲 75 n
+钢琴曲谱 3 n
+钢琴漆 3 n
+钢琴演奏 3 n
+钢琴网 3 n
+钢琴课 3 n
+钢琴谱 3 n
+钢瓶 7 n
+钢皮 3 n
+钢盔 67 n
+钢砂 3 n
+钢硬 3 j
+钢种 46 n
+钢窗 2 n
+钢笔 151 n
+钢笔头 3 n
+钢笔套 3 n
+钢笔字 6 n
+钢笔尖 3 n
+钢笔杆 3 n
+钢笔水 2 n
+钢笔画 6 n
+钢笔盖 3 n
+钢筋 573 n
+钢筋水泥 3 nz
+钢筋混凝 3 n
+钢筋铁骨 8 l
+钢筒 4 n
+钢箍 9 n
+钢管 232 n
+钢管厂 3 n
+钢管秀 3 n
+钢管舞 3 n
+钢箱 2 n
+钢箱梁 2 n
+钢精 3 n
+钢精锅 5 n
+钢索 44 n
+钢纤维 3 n
+钢纸 3 n
+钢线 3 n
+钢结构 2 n
+钢绞线 2 n
+钢绳 68 n
+钢缆 21 n
+钢芯 4 n
+钢花 2 n
+钢花呢 3 n
+钢质 36 n
+钢轨 71 n
+钢轮 3 n
+钢针 129 n
+钢钉 14 n
+钢钎 20 n
+钢钳 7 n
+钢铁 2610 n
+钢铁业 8 n
+钢铁产业 3 n
+钢铁价格 3 n
+钢铁企业 3 n
+钢铁公司 3 n
+钢铁厂 101 n
+钢铁工 3 n
+钢铁工业 3 n
+钢铁工人 3 n
+钢铁市场 3 n
+钢铁网 3 nz
+钢铁股 3 n
+钢铁行业 3 n
+钢铁贸易 3 nz
+钢铁长城 6 n
+钢铁集团 3 nt
+钢锥 3 n
+钢锭 16 n
+钢锯 3 n
+钢锯条 3 n
+钢锹 3 n
+钢门 4 n
+钢鞭 101 n
+钢领 5 n
+钢骨 3 n
+钢骨伞 3 n
+钢鼓 8 n
+钣 46 g
+钣金件 3 n
+钤 164 vg
+钤印 7 n
+钤记 3 n
+钥 112 n
+钥匙 721 n
+钥匙儿童 3 n
+钥匙包 3 n
+钥匙卡 3 n
+钥匙圈 17 n
+钥匙孔 17 n
+钥匙扣 2 n
+钥匙环 3 n
+钥匙盘 3 n
+钥匙链 3 n
+钥子 3 n
+钦 1315 nr
+钦仰 3 v
+钦佩 390 v
+钦佩莫名 3 ns
+钦北区 3 ns
+钦南区 3 ns
+钦博拉索山 4 ns
+钦命 3 n
+钦宗 20 nrt
+钦定 210 v
+钦州 46 ns
+钦州南路 2 ns
+钦州市 10 ns
+钦州港 4 ns
+钦差 548 n
+钦差大臣 156 i
+钦慕 16 v
+钦敬 31 v
+钦此 3 i
+钦点 3 n
+钦羡 31 v
+钦贤好士 3 i
+钦赐 3 n
+钧 593 q
+钧儒 2 n
+钧启 3 i
+钧命 3 n
+钧天广乐 2 i
+钧安 3 n
+钧来 2 n
+钧瓷 9 n
+钧窑 17 n
+钧谕 3 n
+钧道 21 n
+钧鉴 3 n
+钨 432 n
+钨丝 28 n
+钨丝灯 3 n
+钨矿 37 n
+钨矿局 3 n
+钨砂 4 n
+钨粉 3 n
+钨酸 13 n
+钨酸盐 3 nz
+钨酸钙 2 nz
+钨钢 3 n
+钨钼 3 nz
+钨铁 4 n
+钩 1492 n
+钩上去 3 i
+钩上来 3 v
+钩下 3 n
+钩下去 3 i
+钩下来 3 v
+钩住 2 v
+钩元提要 3 n
+钩元摘秘 3 n
+钩出 3 v
+钩出来 3 i
+钩勒 3 n
+钩勒出 3 i
+钩勒法 3 n
+钩去 3 v
+钩去提要 3 i
+钩取 3 v
+钩头 3 n
+钩子 55 n
+钩心斗角 8 i
+钩拳 3 n
+钩挂 9 v
+钩来钩去 3 n
+钩栏 3 n
+钩棍 3 n
+钩毛衣 3 n
+钩沉 8 v
+钩深图远 3 i
+钩深极奥 3 n
+钩深索隐 3 i
+钩深致远 8 i
+钩爪 3 n
+钩爪锯牙 3 n
+钩状 3 n
+钩状物 3 n
+钩玄 3 n
+钩玄提要 3 i
+钩玄猎秘 3 n
+钩破 3 v
+钩章棘句 3 n
+钩索 3 n
+钩花 3 n
+钩花点叶 3 i
+钩藤 3 n
+钩虫 17 n
+钩虫病 6 n
+钩起 3 v
+钩载 3 v
+钩边 3 n
+钩过 3 v
+钩过去 3 i
+钩过来 3 i
+钩金舆羽 3 v
+钩针 23 n
+钩钩 3 v
+钩锚 3 n
+钩骨 3 n
+钩鼻 3 n
+钪 101 g
+钫 48 g
+钬 7 ng
+钭 14 nr
+钮 87 nr
+钮先钟 3 nr
+钮制 2 n
+钮扣 43 nr
+钮扣孔 3 nr
+钮文忠 28 nr
+钮永建 3 nr
+钮祜禄 3 nr
+钮经义 2 nr
+钮茂生 3 nr
+钯 381 g
+钰 11 g
+钱 17871 n
+钱三强 47 nr
+钱串子 11 n
+钱临照 6 nr
+钱之利 2 nr
+钱之江 228 nr
+钱乐之 3 nr
+钱二萍 2 nr
+钱二败 3 nr
+钱仁康 12 nr
+钱以文 2 nr
+钱仲联 3 nr
+钱伟长 24 nr
+钱伯斯 4 nr
+钱伯海 2 nr
+钱俊瑞 5 nr
+钱信忠 2 nr
+钱全空 2 nr
+钱其琛 560 nr
+钱养先 35 nr
+钱凤览 77 nr
+钱勇夫 3 nr
+钱包 98 n
+钱匣子 2 n
+钱千里 3 nr
+钱卓君 2 nr
+钱南扬 6 nr
+钱友荣 2 nr
+钱取利 16 nr
+钱可通神 3 nr
+钱吉成 4 nr
+钱嘉乐 3 nr
+钱嘉征 2 nr
+钱嘉徵 3 nr
+钱四弟 2 nr
+钱塘 118 ns
+钱塘君 7 nr
+钱塘江 282 nr
+钱塘潮 3 nr
+钱塞勒 3 nr
+钱士升 3 nr
+钱大昕 17 nr
+钱大钧 2 nr
+钱孙喜 2 nr
+钱孙李 3 nr
+钱孙爱 100 nr
+钱学森 70 nr
+钱学礼 135 nr
+钱宁兄 2 nr
+钱宇平 17 nr
+钱官铸 2 nr
+钱宝琮 64 nr
+钱实甫 4 nr
+钱家乐 3 nr
+钱家修 2 nr
+钱家峪 3 nr
+钱小豪 3 nr
+钱少胆 2 nr
+钱山漾 14 nr
+钱岳林 2 nr
+钱币 519 n
+钱币司 3 n
+钱希钧 4 nr
+钱庄 93 nr
+钱建萍 8 nr
+钱开宗 5 nr
+钱弘佐 3 nr
+钱德勒 19 nr
+钱德拉 13 nr
+钱德拉塞卡 7 nrt
+钱德洪 8 nr
+钱德里卡 3 nrt
+钱志节 2 nr
+钱思亮 4 nr
+钱惟演 3 nr
+钱慧安 2 nr
+钱振波 5 nr
+钱振鹏 14 nr
+钱敏康 12 nr
+钱文燕 7 nr
+钱文祺 2 nr
+钱昌照 5 nr
+钱明经 76 nr
+钱春弦 12 nr
+钱晋卿 2 nr
+钱晓虎 4 nr
+钱晓鸣 2 nr
+钱松岩 7 nr
+钱柜 17 nr
+钱柜杂志 3 n
+钱树根 2 nr
+钱校本 16 nr
+钱款 8 n
+钱正伦 35 nr
+钱正英 17 nr
+钱永昌 4 nr
+钱江晚报 3 nz
+钱江潮 3 nr
+钱法堂 4 nr
+钱法成 2 nr
+钱清北 2 nr
+钱清南 2 nr
+钱澄之 4 nr
+钱牧斋 54 nr
+钱物 65 n
+钱玄同 27 nr
+钱理群 8 nr
+钱生亮 24 nr
+钱瘦铁 2 nr
+钱皇后 3 nr
+钱益多 3 nr
+钱眼儿 4 nr
+钱端升 5 nr
+钱箱 6 n
+钱粮 155 nr
+钱老儿 3 nr
+钱老本 3 nr
+钱老爷 6 nr
+钱肃乐 4 nr
+钱能训 2 nr
+钱袋 55 n
+钱袋子 11 n
+钱谦吾 2 nr
+钱谦益 1665 nr
+钱谷 6 nr
+钱谷之 2 nr
+钱财 337 nr
+钱财乃身 3 nr
+钱贵物 2 nr
+钱达尔 5 nr
+钱运录 258 nr
+钱通四 3 nr
+钱道人 2 nr
+钱重银 2 nr
+钱金福 2 nr
+钱钞 24 nr
+钱钟书 22 nr
+钱银之 2 nr
+钱锺书 2 nr
+钱镜塘 2 nr
+钱青健 9 nr
+钱青剑 3 nr
+钱韦杉 3 nr
+钱顺堂 3 nr
+钱风览 6 nr
+钱龙锡 51 nr
+钲 15 g
+钳 246 n
+钳击 3 v
+钳刑 3 n
+钳制 63 n
+钳制电位 3 n
+钳口 14 n
+钳口不言 3 i
+钳口吞舌 3 i
+钳口挢舌 3 v
+钳口结舌 3 i
+钳口蚕舌 3 n
+钳噤 3 n
+钳夹 3 n
+钳子 59 n
+钳工 41 n
+钳工班 3 n
+钳床 3 n
+钳形攻势 3 n
+钳形表 3 n
+钳梏 3 n
+钳虫 3 n
+钳蝎 3 n
+钳马衔枚 3 i
+钴 582 ng
+钴粉 2 nz
+钴胺素 3 nz
+钴蓝 2 nz
+钴蓝色 3 n
+钴蓝釉 3 n
+钵 392 ng
+钵头 5 n
+钵子 6 n
+钵盂 53 n
+钵衣 3 n
+钶 4 zg
+钷 13 g
+钹 76 n
+钺 92 ng
+钻 2369 v
+钻井 143 n
+钻井工 3 n
+钻井工程 3 n
+钻井机 2 n
+钻井泵 3 n
+钻井液 6 n
+钻井理论 3 n
+钻井设计 3 i
+钻井进尺 3 i
+钻井队 35 n
+钻儿 3 n
+钻入 308 v
+钻具 28 n
+钻冰取火 3 i
+钻冰求火 3 n
+钻冰求酥 3 n
+钻出 3 v
+钻出来 3 v
+钻凿 3 v
+钻到 3 v
+钻劲 6 v
+钻台 2 n
+钻地 3 n
+钻地弹 3 n
+钻坚仰高 3 i
+钻坚研微 3 n
+钻塔 6 n
+钻天入地 3 i
+钻天打洞 3 n
+钻天杨 2 n
+钻天柳 4 n
+钻天觅缝 3 i
+钻头 58 n
+钻头体 3 n
+钻头就锁 3 i
+钻头泥包 3 n
+钻头特性 3 n
+钻头觅缝 3 i
+钻子 3 n
+钻孔 118 n
+钻孔器 3 n
+钻孔机 3 n
+钻尖 3 n
+钻屑含量 3 n
+钻山塞海 3 nz
+钻工 3 n
+钻床 18 n
+钻开 3 v
+钻得 3 v
+钻心 43 n
+钻心刺骨 3 i
+钻心虫 3 n
+钻懒帮闲 3 z
+钻成 3 v
+钻戒 26 n
+钻探 120 v
+钻探机 3 n
+钻故纸堆 3 n
+钻时录井 3 n
+钻木 3 n
+钻木取火 9 i
+钻机 80 n
+钻机拆卸 3 nz
+钻杆 14 n
+钻杆吊卡 3 n
+钻柱特性 3 n
+钻求 3 v
+钻洞 20 n
+钻洞觅缝 3 i
+钻火得冰 3 i
+钻牛犄角 3 v
+钻牛角 3 n
+钻牛角尖 22 n
+钻狗洞 3 n
+钻皮出羽 3 n
+钻眼 2 n
+钻石 454 n
+钻石戒指 3 n
+钻石版 3 n
+钻石珑 3 i
+钻石矿 3 j
+钻石项链 3 n
+钻研 385 n
+钻研业务 3 n
+钻穴 3 n
+钻穴逾垣 3 i
+钻穴逾墙 3 i
+钻穴逾隙 3 i
+钻空 3 n
+钻空子 31 n
+钻营 61 n
+钻蚀 3 v
+钻谋 3 n
+钻过去 3 v
+钻过来 3 v
+钻进 658 v
+钻进去 3 v
+钻进来 3 v
+钻速方程 3 n
+钻采 7 v
+钻铣床 3 vn
+钻锉 3 n
+钻门子 3 n
+钻门路 3 n
+钻隙逾墙 3 i
+钻霸 3 v
+钼 298 ng
+钼栅工艺 3 n
+钼矿 25 n
+钼肥 3 n
+钼酸 3 n
+钼酸铵 4 nz
+钼钢 3 n
+钽 142 ng
+钽电容 3 n
+钽铁矿 12 n
+钾 669 n
+钾盐 117 nz
+钾矿 3 n
+钾缺乏 3 nz
+钾肥 51 n
+钾肥厂 7 n
+钾血症 30 nz
+钾钠 4 nz
+钾长石 299 n
+钿 44 g
+钿合金钗 3 nr
+铀 729 n
+铀工 3 n
+铀浓缩物 3 n
+铀矿 166 n
+铀矿床 10 n
+铀酰 3 n
+铁 8654 n
+铁一中 3 nr
+铁一局 5 nt
+铁三角 19 nr
+铁丑 5 n
+铁业 7 n
+铁东区 3 ns
+铁丝 233 n
+铁丝网 88 n
+铁中铮铮 3 l
+铁丹 3 nr
+铁之议 9 n
+铁了心 3 i
+铁二院 2 nt
+铁五局 3 nt
+铁交椅 3 n
+铁交鸣 3 nr
+铁人 64 n
+铁人三项 10 nz
+铁佛寺 6 nr
+铁像 3 n
+铁元素 5 nr
+铁克净 2 nr
+铁公祠 3 nr
+铁公鸡 5 n
+铁军 52 n
+铁冠图 3 nr
+铁冠道 8 nr
+铁冠道人 44 nr
+铁冶业 5 nr
+铁冶户 2 nr
+铁凳 2 n
+铁刀木 6 nr
+铁刃 3 n
+铁划银 2 n
+铁则 5 n
+铁制 83 n
+铁制品 3 n
+铁券 3 n
+铁剂 3 n
+铁剑利 2 nr
+铁剑断 2 nr
+铁剑门 15 nr
+铁力 6 n
+铁力县 3 nr
+铁力市 6 n
+铁力木 6 nr
+铁劳 3 n
+铁勒布 2 nr
+铁勺 8 n
+铁匠 237 n
+铁匠工场 3 n
+铁匠铺 47 n
+铁匣 3 n
+铁十八局 5 nt
+铁卡笋 2 nr
+铁印 3 n
+铁厂 88 n
+铁叉 14 n
+铁口 13 n
+铁叶 12 n
+铁叶子 5 n
+铁叶盘 3 n
+铁合金 48 n
+铁合金厂 3 nt
+铁和尚 8 nr
+铁和钢 2 nr
+铁哥 2 n
+铁哥们 3 n
+铁哥们儿 3 n
+铁嘴 16 n
+铁嘴钢牙 2 nr
+铁器 275 n
+铁器时代 3 n
+铁围山 3 nr
+铁圈 3 n
+铁块 39 n
+铁坚杉 4 nr
+铁城 2 n
+铁基非 2 nr
+铁塔 155 n
+铁墙铁壁 3 n
+铁壁 5 n
+铁壁铜墙 2 n
+铁壁铜山 3 nr
+铁壶 3 n
+铁大牛 3 nr
+铁头 53 n
+铁头人 7 n
+铁头功 3 n
+铁头杖 3 n
+铁夹 3 n
+铁套 3 n
+铁女寺 6 nr
+铁姑娘 7 nr
+铁娘子 3 nr
+铁子 7 n
+铁子儿 3 nr
+铁存 3 n
+铁官徒 2 nr
+铁官营 32 nr
+铁定 42 n
+铁将军 3 nr
+铁将军把门 4 n
+铁尺 3 n
+铁屋 10 n
+铁屑 20 n
+铁山 20 nr
+铁山区 257 ns
+铁山港 2 ns
+铁山港区 3 ns
+铁岭 69 nr
+铁岭县 2 ns
+铁岭市 18 n
+铁州 2 ns
+铁工 18 n
+铁工厂 3 n
+铁布杉 3 nr
+铁布衫 15 nr
+铁帽 25 n
+铁幕 8 n
+铁干里克 8 ns
+铁床 25 n
+铁庙 2 n
+铁延部 8 nr
+铁弓缘 2 nr
+铁弹 3 n
+铁律 5 n
+铁心 70 n
+铁心兰 3 nr
+铁心木肠 3 i
+铁心石肠 3 n
+铁心轮 3 n
+铁性 5 n
+铁戟 257 n
+铁扇公主 3 n
+铁手 3 n
+铁手无情 3 i
+铁手镯 3 n
+铁打 17 n
+铁打心肠 3 i
+铁打江山 2 i
+铁打的营盘流水的兵 2 n
+铁打铜铸 3 nr
+铁托 47 n
+铁托格 2 n
+铁拐李 3 nr
+铁拳 52 n
+铁掌 335 n
+铁搭 3 nr
+铁料 5 n
+铁斧 3 n
+铁显色 2 nr
+铁木 9 n
+铁木儿 7 nr
+铁木哥 8 nr
+铁木尔 13 nr
+铁木真 437 nr
+铁木辛 12 nr
+铁木迭 32 nr
+铁术 6 n
+铁杆 67 n
+铁杆子 3 n
+铁杉 66 n
+铁材 12 n
+铁杖 42 n
+铁杖伸 2 nr
+铁杖守 2 nr
+铁杖微 4 nr
+铁杖挥 2 nr
+铁杖猛 2 nr
+铁杖疾 2 nr
+铁杠 3 n
+铁条 3 n
+铁杵 13 n
+铁杵成针 3 i
+铁杵磨成针 2 i
+铁杵磨针 3 i
+铁板 165 n
+铁板一块 18 n
+铁板不易 3 l
+铁板大鼓 3 n
+铁板桥 16 n
+铁板歌喉 3 n
+铁板烧 3 n
+铁板钉钉 8 i
+铁板铜弦 3 n
+铁板铜琶 3 n
+铁枪 8 n
+铁架 23 n
+铁架子 3 n
+铁架床 3 n
+铁柄摇 2 nr
+铁柜 23 n
+铁柱 19 n
+铁栅 8 n
+铁栅栏 183 n
+铁栅门 3 n
+铁栏 8 n
+铁栏杆 17 n
+铁树 112 n
+铁树开华 3 nr
+铁树开花 12 nr
+铁树花开 3 i
+铁栓 3 n
+铁案 6 n
+铁案如山 3 i
+铁桥 25 n
+铁桨呈 2 nr
+铁桨柄 2 nr
+铁桶 107 n
+铁桶江山 3 n
+铁桶阵 3 n
+铁棍 74 n
+铁棍子 2 n
+铁棒 472 n
+铁棺峡 2 nr
+铁椅 3 n
+铁椎 3 n
+铁氟龙 3 nz
+铁氧体 48 n
+铁氰化钾 3 nz
+铁水 57 n
+铁汉 13 n
+铁汉子 13 nr
+铁沙 3 n
+铁沙掌 4 nr
+铁泉 3 n
+铁法 12 n
+铁法县 3 nr
+铁法官 3 n
+铁法市 7 n
+铁活 2 n
+铁流 22 n
+铁浆 3 n
+铁海棠 2 nr
+铁渣 3 n
+铁灰 3 n
+铁灰色 3 n
+铁炉 21 n
+铁炮 4 n
+铁片 52 n
+铁牛 43 n
+铁特河 3 nr
+铁犁 5 ns
+铁狮子 2 nr
+铁狮峰 4 nr
+铁狱铜笼 3 n
+铁环 80 n
+铁珠 2 n
+铁球 3 n
+铁球镶 2 nr
+铁琴 17 n
+铁琴铜 6 nr
+铁瓜 2 n
+铁甲 287 n
+铁甲兵 3 nr
+铁甲威龙 3 nr
+铁甲武士 3 n
+铁甲舰 18 n
+铁甲车 2 n
+铁电体 9 n
+铁电性 3 n
+铁画 7 n
+铁画银钩 2 n
+铁的事实 3 n
+铁的纪律 3 n
+铁皮 97 n
+铁皮大鼓 3 n
+铁皮屋 3 n
+铁皮柜 2 nr
+铁盆 5 n
+铁盐 3 n
+铁盒 128 n
+铁盒子 11 nr
+铁盖 14 n
+铁盖山 3 nr
+铁盘 3 n
+铁盼盼 2 nr
+铁睦尔 4 nr
+铁矛 4 n
+铁石 26 n
+铁石人 3 n
+铁石坚 2 nr
+铁石心肝 3 n
+铁石心肠 33 n
+铁矾土 2 n
+铁矿 1073 n
+铁矿石 180 n
+铁矿砂 26 n
+铁砂 16 n
+铁砂掌 3 n
+铁砧 19 n
+铁硫 2 n
+铁碗 3 n
+铁磁 30 n
+铁磁体 42 n
+铁磁学 3 n
+铁磁性 3 n
+铁磁质 4 n
+铁票 3 n
+铁穆耳 19 nr
+铁窗 33 n
+铁窗业 3 nr
+铁窗风味 3 i
+铁站 2 n
+铁笔 20 n
+铁笔无私 3 i
+铁笛 7 n
+铁笛仙 9 nr
+铁笼 60 n
+铁笼子 3 n
+铁筋 3 n
+铁筝 3 n
+铁筷 3 n
+铁箍 29 n
+铁算盘 21 n
+铁管 44 n
+铁箱 3 n
+铁箱子 3 n
+铁粉 36 n
+铁精矿 3 n
+铁精粉 3 nr
+铁系元素 3 n
+铁素体 11 n
+铁索 50 n
+铁索桥 34 nr
+铁纱 2 n
+铁纹石 3 nr
+铁线 18 n
+铁线莲 7 nr
+铁线蕨 5 n
+铁罐 7 n
+铁网 3 n
+铁网珊瑚 3 nz
+铁罗汉 66 nr
+铁翼飞 4 nr
+铁老大 11 nr
+铁耗子 3 n
+铁耙 4 n
+铁肠石心 3 n
+铁肩担道义 3 l
+铁胆 5 n
+铁胆周 7 nr
+铁胆庄 89 nr
+铁脚 3 n
+铁脚仙 7 n
+铁脚板 5 n
+铁腕 25 n
+铁腕人物 7 n
+铁臂 3 n
+铁舟 4 n
+铁船 6 n
+铁芯 25 n
+铁花 3 n
+铁苋菜 3 v
+铁范 3 n
+铁莲子 2 nr
+铁落 3 n
+铁蒺藜 29 n
+铁虎车 2 n
+铁蚕豆 2 n
+铁蛇 7 n
+铁蛇护 2 nr
+铁蛇挺 2 nr
+铁蛋 2 n
+铁蛋白 3 n
+铁蝎子 5 nr
+铁血 54 n
+铁血丹心 3 n
+铁血主义 3 n
+铁血宰相 3 n
+铁血政策 5 n
+铁血男儿 3 n
+铁血网 3 n
+铁血青年 3 n
+铁衣 3 n
+铁袖功 3 nr
+铁西 3 n
+铁西区 7 ns
+铁观音 34 n
+铁证 278 n
+铁证如山 27 nr
+铁质 58 n
+铁路 11065 n
+铁路信号 3 n
+铁路分局 3 n
+铁路医院 3 nt
+铁路局 85 n
+铁路局长 3 n
+铁路工人 3 n
+铁路工程 3 n
+铁路干线 3 n
+铁路权 3 n
+铁路桥 333 nr
+铁路桥梁 3 nr
+铁路沿线 3 n
+铁路法 5 n
+铁路线 449 n
+铁路网 71 n
+铁路职工 3 n
+铁路车辆 3 n
+铁路运输 3 l
+铁路部门 3 n
+铁蹄 55 n
+铁车兵 3 n
+铁轨 146 n
+铁轮 3 n
+铁轮飞 2 nr
+铁轴 3 n
+铁载体 3 n
+铁达尼 4 nr
+铁运 15 n
+铁通 46 n
+铁道 168 n
+铁道兵 31 nr
+铁道口 3 n
+铁道线 6 n
+铁道部 431 nt
+铁道部长 2 n
+铁郭金城 3 ns
+铁金刚 3 nr
+铁针 4 n
+铁钉 342 n
+铁钉子 3 nr
+铁钎 18 n
+铁钟 5 n
+铁钤钤 4 nr
+铁钦纳 9 nr
+铁钩 10 n
+铁钳 3 n
+铁钵 2 n
+铁铧 3 n
+铁铮铮 33 nr
+铁铲 64 n
+铁铺 4 n
+铁链 416 n
+铁锁 123 n
+铁锁链 3 n
+铁锅 398 n
+铁锈 64 n
+铁锋区 3 n
+铁锌 3 n
+铁锚 66 n
+铁锤 198 n
+铁锥 3 n
+铁锨 50 n
+铁锹 77 n
+铁镁 3 n
+铁镍 3 n
+铁门 367 n
+铁门关 10 n
+铁门窗 3 n
+铁闪锌矿 3 n
+铁闸 26 n
+铁阁子 2 nr
+铁阁露 2 nr
+铁青 332 nr
+铁青色 3 n
+铁面 65 n
+铁面人 3 n
+铁面孔 17 n
+铁面御史 3 n
+铁面无私 39 i
+铁面枪牙 3 i
+铁鞋 4 n
+铁鞋踏破 3 n
+铁鞭 21 n
+铁饭 2 n
+铁饭碗 72 n
+铁饼 49 n
+铁马 29 n
+铁马金戈 6 nr
+铁骑 242 n
+铁骨 21 n
+铁骨铮铮 13 l
+铁鱼 2 n
+铁鸟 10 n
+铁鸥 2 n
+铁麒麟 4 nr
+铁黑 3 z
+铂 306 n
+铂电阻 3 n
+铂金 34 n
+铂金卡 3 n
+铂金版 3 n
+铃 595 nr
+铃兰 3 nr
+铃兰苦苷 3 n
+铃兰苷 3 nz
+铃响 3 n
+铃响后 3 n
+铃响时 3 n
+铃声 276 n
+铃声下载 3 n
+铃声响起 3 n
+铃子 3 n
+铃木 13 nr
+铃木亚美 3 nr
+铃木京香 3 nr
+铃木光司 3 nr
+铃木大拙 2 nr
+铃木学衍 2 nr
+铃木春信 3 nr
+铃木杏 3 nr
+铃木秀 5 nr
+铃木秀男 39 nr
+铃木虎雄 2 nr
+铃木贞 2 nr
+铃舌 3 n
+铃虫 3 n
+铃行法 3 n
+铃行试验 3 n
+铃铛 61 n
+铃铛响 3 nr
+铃铛声 3 nr
+铃鼓 8 n
+铄 29 i
+铄古切今 3 i
+铄懿渊积 3 nr
+铄石流金 3 i
+铄金 3 i
+铄金毁骨 3 i
+铄金点玉 3 i
+铅 1711 n
+铅丝 25 n
+铅中毒 30 n
+铅丸 3 n
+铅丹 2 ns
+铅丹鑤 3 nz
+铅刀一刻 3 n
+铅刀一割 3 v
+铅制 3 n
+铅化物 2 n
+铅华 6 nz
+铅印 25 n
+铅合金 3 n
+铅含量 10 n
+铅块 15 n
+铅垂 9 v
+铅垂线 18 n
+铅字 24 n
+铅字盘 3 n
+铅室法 3 n
+铅封 2 ns
+铅山 29 ns
+铅山县 8 ns
+铅弹 10 n
+铅条 2 n
+铅板 4 n
+铅桶 3 n
+铅模 3 n
+铅汞 3 n
+铅油 3 n
+铅灰色 22 n
+铅版 5 v
+铅玻璃 8 n
+铅珠 3 n
+铅球 51 n
+铅白 3 n
+铅皮 3 n
+铅直 54 v
+铅直线 3 n
+铅矿 28 n
+铅砖 3 n
+铅笔 327 n
+铅笔刀 3 n
+铅笔头 137 n
+铅笔尖 3 n
+铅笔画 11 n
+铅笔盒 2 n
+铅笔芯 9 n
+铅笔鑤 3 nz
+铅管 3 n
+铅管匠 3 n
+铅粉 4 n
+铅膏 3 n
+铅芯 2 n
+铅酸 5 n
+铅针 3 n
+铅钢 3 n
+铅铁 7 n
+铅锌 48 n
+铅锌矿 29 n
+铅锤 3 n
+铅锭 2 n
+铅黄 3 n
+铅黛 3 n
+铆 44 zg
+铆劲 3 v
+铆劲儿 3 n
+铆工 3 n
+铆接 91 v
+铆接机 3 n
+铆机 3 n
+铆钉 36 n
+铆钉机 3 n
+铆钉枪 3 n
+铇 2 zg
+铈 37 n
+铈量法 3 n
+铉 33 g
+铊 59 g
+铋 120 g
+铌 136 ng
+铍 110 g
+铍青铜 3 nz
+铎 163 nr
+铏 193 zg
+铐 182 v
+铐起来 3 vn
+铑 35 g
+铒 12 g
+铓 18 zg
+铔 79 zg
+铕 12 n
+铖 31 g
+铗 10 g
+铙 65 nr
+铙钹 20 n
+铚 24 zg
+铛 34 o
+铛铛 3 nr
+铜 5739 n
+铜业 26 n
+铜丝 49 n
+铜人 3 n
+铜仁 21 n
+铜仁地区 6 ns
+铜仁市 5 ns
+铜价 28 n
+铜像 143 n
+铜元 66 n
+铜兵 3 n
+铜制 43 n
+铜制品 3 n
+铜勺 3 n
+铜包钢 3 n
+铜匠 7 n
+铜印 3 n
+铜厂 8 n
+铜合金 3 n
+铜唇铁舌 3 i
+铜器 320 n
+铜器时代 3 n
+铜围铁马 3 n
+铜圆 3 n
+铜圈 3 n
+铜块 3 n
+铜城 78 ns
+铜城铁壁 3 nz
+铜基 3 nrt
+铜墙铁壁 52 i
+铜壶 27 n
+铜头铁臂 3 n
+铜头铁额 2 n
+铜奖 15 n
+铜套 3 n
+铜子 18 n
+铜子儿 3 n
+铜字 3 n
+铜官山区 3 ns
+铜屑 3 n
+铜山 26 ns
+铜山县 20 ns
+铜山西崩 3 n
+铜山金穴 3 n
+铜山铁壁 3 nz
+铜川 31 ns
+铜川市 15 ns
+铜川路 3 ns
+铜币 50 n
+铜带 13 n
+铜彭 3 nrt
+铜心铁胆 3 i
+铜打铁铸 3 n
+铜拔 3 n
+铜排 5 n
+铜期货 3 n
+铜材 4 n
+铜条 3 n
+铜板 102 n
+铜板纸 3 n
+铜柱 3 n
+铜梁 10 n
+铜梁县 3 ns
+铜棒 3 n
+铜椎 3 n
+铜模 2 n
+铜殿 6 n
+铜氨丝 3 n
+铜汞合金 3 vn
+铜油 3 n
+铜活 3 n
+铜活字 7 n
+铜浇铁铸 3 n
+铜滑轮 3 n
+铜漏 3 n
+铜焊 3 n
+铜片 47 n
+铜版 19 n
+铜版印刷 3 n
+铜版画 14 n
+铜版纸 5 n
+铜牌 314 n
+铜牙 3 ns
+铜环 3 n
+铜球 3 n
+铜琶铁板 3 n
+铜瓦 3 nrt
+铜皮 5 n
+铜盆 46 n
+铜盘 3 n
+铜盘重肉 3 n
+铜盾 3 n
+铜矿 311 n
+铜碑 3 n
+铜筋铁肋 3 n
+铜筋铁骨 6 i
+铜箔 7 n
+铜管 20 n
+铜管乐 12 n
+铜管乐器 14 n
+铜管乐队 3 n
+铜粘固剂 3 n
+铜精矿 3 n
+铜线 19 n
+铜绿 27 n
+铜绿色 3 n
+铜网 11 n
+铜肥 3 n
+铜臭 14 n
+铜臭味 3 n
+铜臭气 3 n
+铜臭熏天 3 z
+铜色 3 n
+铜蛋白 3 n
+铜街子 3 n
+铜褐色 3 n
+铜质 50 n
+铜车马 17 n
+铜轴 3 n
+铜载网 3 n
+铜钉 3 n
+铜钟 37 n
+铜钱 294 n
+铜钵 2 n
+铜钹 14 n
+铜钿 3 n
+铜铃 86 n
+铜铸 34 n
+铜铸铁浇 3 n
+铜锁 34 n
+铜锅 22 n
+铜锈 17 n
+铜锣 49 n
+铜锣湾 7 ns
+铜锤 53 n
+铜镍 12 n
+铜镜 270 n
+铜门 27 n
+铜陵 159 ns
+铜陵县 3 ns
+铜陵市 19 ns
+铜雕 17 n
+铜青 3 n
+铜驼 15 n
+铜驼荆棘 3 n
+铜驼草莽 3 nz
+铜鼎 62 n
+铜鼓 70 n
+铜鼓县 3 ns
+铝 901 n
+铝业 45 n
+铝丝 3 n
+铝冶炼 3 vn
+铝制 42 n
+铝制品 9 n
+铝加工 3 n
+铝勺 3 n
+铝厂 40 n
+铝压铸 3 n
+铝合金 138 n
+铝圈 4 n
+铝土 129 n
+铝土矿 131 n
+铝型材 3 n
+铝塑 6 n
+铝塑板 3 n
+铝塑管 3 n
+铝壶 3 n
+铝屉 3 n
+铝屑 3 n
+铝带 3 n
+铝扣板 3 n
+铝排 7 n
+铝材 4 n
+铝条 3 n
+铝板 5 n
+铝板带 3 n
+铝桶 4 n
+铝棒 3 n
+铝水壶 3 n
+铝热剂 3 n
+铝热焊 2 n
+铝焊 3 n
+铝片 2 n
+铝球 3 n
+铝电解 3 n
+铝皮 3 n
+铝盆 3 n
+铝盖 3 n
+铝矾土 63 n
+铝矿 23 n
+铝硅酸盐 23 nz
+铝窗 3 n
+铝箔 12 n
+铝箔纸 3 n
+铝箔袋 3 n
+铝管 3 n
+铝粉 6 n
+铝线 3 n
+铝质 13 n
+铝酸盐 4 n
+铝酸钙 3 nz
+铝针 3 n
+铝钒土 10 nz
+铝锅 10 n
+铝锭 10 n
+铝镁合金 3 n
+铝门 3 n
+铝门窗 3 n
+铞 4 x
+铟 48 n
+铠 115 n
+铠甲 161 n
+铠装 2 n
+铡 191 v
+铡刀 49 n
+铡草 3 n
+铡门 3 n
+铢 110 q
+铢两 3 n
+铢两分寸 3 n
+铢两悉称 3 vn
+铢两相称 3 n
+铢分毫析 3 i
+铢寸累积 3 n
+铢施两较 3 i
+铢积寸累 3 n
+铢称寸量 3 n
+铢累寸积 3 n
+铢量寸度 3 n
+铢铢校量 3 n
+铢铢较量 3 n
+铣 223 vg
+铣刀 11 n
+铣刨机 3 n
+铣削 8 v
+铣头 3 n
+铣工 3 n
+铣床 54 n
+铣蚀 3 nz
+铣轧 3 v
+铣铁 3 n
+铣鞋 3 n
+铣齿机 6 n
+铤 8 i
+铤而走险 128 i
+铤鹿走险 3 i
+铥 8 g
+铦 14 zg
+铧 37 x
+铧犁 6 n
+铨 53 g
+铨叙 14 v
+铨叙部 3 v
+铨擢 3 v
+铨考 3 v
+铨衡 3 v
+铨选 3 v
+铩 129 g
+铩羽 14 v
+铩羽暴鳞 3 i
+铩羽涸鳞 3 z
+铩羽而归 24 i
+铪 45 g
+铫 19 g
+铬 572 n
+铬氧磁带 3 n
+铬版 3 n
+铬盐 11 n
+铬蓝黑 3 n
+铬酸 16 nz
+铬酸盐 11 nz
+铬酸钾 3 nz
+铬钢 3 n
+铬钼 4 nz
+铬铁 22 n
+铬铁矿 86 nz
+铬镍钢 3 vn
+铬黄 3 nz
+铬黑 3 nz
+铭 323 n
+铭万 18 l
+铭传 3 n
+铭传商专 3 n
+铭传女子 3 n
+铭传学院 3 n
+铭佩 3 n
+铭刻 71 n
+铭德新村 3 n
+铭心 7 n
+铭心刻骨 32 i
+铭心镂骨 3 i
+铭感 3 n
+铭感不忘 3 l
+铭感五内 3 l
+铭文 509 n
+铭旌 2 n
+铭牌 9 n
+铭篆 3 n
+铭肌镂骨 3 i
+铭肤镂骨 3 i
+铭记 68 n
+铭记不忘 3 l
+铭记在心 21 l
+铭诸肺腑 3 i
+铭谢 3 v
+铭谢惠顾 3 l
+铭骨 3 n
+铮 698 a
+铮亮 5 a
+铮铮 144 a
+铮铮有声 3 l
+铮铮的 9 z
+铮铮誓言 3 l
+铮铮铁汉 3 l
+铮铮铁骨 3 l
+铮锵 3 a
+铯 85 g
+铰 135 v
+铰刀 5 n
+铰接 20 v
+铰接式 3 nz
+铰接柱 3 n
+铰链 32 n
+铰链位 3 nz
+铰链叶 3 nz
+铰链轴 3 nz
+铰链轴点 3 nz
+铰链运动 3 nz
+铱 92 n
+铱星 3 nz
+铱金 3 n
+铱金笔 4 n
+铲 950 v
+铲下 3 v
+铲倒 3 v
+铲出 3 v
+铲凿 3 v
+铲刀 3 n
+铲土 3 n
+铲土机 3 n
+铲子 70 n
+铲平 42 n
+铲斗 5 v
+铲煤 3 n
+铲球 13 n
+铲起 3 v
+铲车 4 n
+铲运 4 n
+铲运机 8 nz
+铲运车 3 nz
+铲迹销声 3 n
+铲除 128 v
+铲雪机 3 n
+铳 154 ng
+铴锣 3 v
+铵 75 n
+铵基 3 n
+铵态氮 3 n
+铵态氮肥 3 n
+铵盐 24 n
+银 5956 ng
+银丝 72 n
+银丝击 2 nr
+银丝卷 2 n
+银丝软 2 nr
+银两 405 n
+银丰 4 nz
+银丹 2 nr
+银之恩 2 nr
+银亮 12 nr
+银付 3 n
+银价 3 n
+银企合作 2 n
+银元 295 n
+银元宝 2 nr
+银光 132 n
+银光闪闪 3 nr
+银兔 3 n
+银公会 3 n
+银冠 8 n
+银冠雌 2 nr
+银利来 3 nr
+银制 26 n
+银券 3 n
+银包 3 n
+银匠 139 n
+银协巴 4 nr
+银南 7 ns
+银印 3 n
+银发 41 n
+银发族 3 nz
+银叶 8 n
+银叶先生 2 nr
+银号 19 n
+银员 3 n
+银和金 2 n
+银品 3 n
+银器 67 n
+银团 15 n
+银圆 53 n
+银圈 3 n
+银坑 6 n
+银基发展 11 nz
+银基通 7 nr
+银壶 3 n
+银奖 304 n
+银妆素裹 2 n
+银姑 12 n
+银婚 3 n
+银婚纪念 3 n
+银子 3704 n
+银安殿 9 nr
+银屏 29 n
+银屏金屋 3 ns
+银屑 3 n
+银屑病 7 n
+银山 60 nr
+银山铁壁 3 nz
+银川 290 n
+银川市 57 ns
+银川平原 40 ns
+银州 5 ns
+银州区 3 ns
+银币 153 n
+银帆 2 nr
+银带 9 n
+银带奖 3 n
+银幕 164 n
+银幕偶像 3 n
+银广夏 3 nr
+银庄大 2 nr
+银库 3 n
+银座 27 n
+银座区 3 n
+银开复 3 nr
+银弹 3 n
+银弹攻势 3 n
+银微晶 3 nr
+银悉熔 4 nr
+银战车 3 n
+银戟杨 4 nr
+银手镯 3 n
+银托 3 n
+银扣 4 n
+银政 3 n
+银数 2 n
+银施罗 2 nr
+银星 8 n
+银月 3 n
+银木荷 3 nr
+银本位 21 n
+银术可 15 nr
+银朱 2 nr
+银杉 38 n
+银杏 447 nr
+银杏叶 3 nr
+银杏果 3 n
+银杏树 61 nr
+银杏苗木 3 nr
+银杏茶 3 nr
+银条 9 n
+银条菜 3 n
+银杯 15 n
+银板 3 n
+银柜 3 n
+银柴胡 3 nr
+银核 6 n
+银根 61 n
+银根紧 3 nz
+银根紧缩 3 nz
+银根菜 3 n
+银桂树 2 nr
+银框 3 n
+银桦 3 n
+银楼 2 n
+银母 3 n
+银水成 2 nr
+银汉 9 nr
+银汉横 2 nr
+银汉鱼 4 nr
+银汞合金 3 vn
+银沙 3 n
+银河 346 n
+银河倒泻 3 n
+银河尘 3 nr
+银河帝国 3 ns
+银河系 298 n
+银河网 3 n
+银河证券 3 n
+银洋 32 n
+银海 258 ns
+银海区 3 ns
+银海格 2 nr
+银海网吧 2 n
+银滩 12 n
+银漆 3 n
+银瀑 2 n
+银火 3 n
+银灯 3 n
+银灰 6 n
+银灰色 43 n
+银烛 3 n
+银熊奖 2 n
+银燕 7 nr
+银片 3 n
+银牌 201 n
+银牌奖 3 n
+银牙 3 ns
+银狐 9 nz
+银环 2 n
+银环蛇 12 nr
+银珠冰片 3 n
+银瑞信 4 nr
+银瓶 24 n
+银生节 2 n
+银甲 5 n
+银甲峡 2 nr
+银白 43 n
+银白杨 3 nr
+银白色 131 n
+银盐 13 n
+银监 3 n
+银监会 59 nr
+银监委 2 j
+银监局 11 j
+银盘 44 n
+银矿 71 n
+银矿石 3 n
+银硃 3 nz
+银碗 12 n
+银碗盛 2 nr
+银碟 5 n
+银票 287 n
+银离子 2 n
+银筷 3 n
+银箍 3 n
+银箔 2 n
+银箔纸 3 n
+银粉 4 n
+银粉漆 3 n
+银粒 3 n
+银粟 3 n
+银红 2 nr
+银红色 3 n
+银纬 2 n
+银纸 3 n
+银线 16 n
+银练 6 n
+银绢 7 n
+银翘散 13 nr
+银翼 3 n
+银耳 92 nr
+银耳汤 3 nr
+银联 86 ns
+银联卡 77 nr
+银胶菊 3 n
+银脸桃腮 3 n
+银色 185 n
+银花 61 n
+银花火树 3 n
+银苗 3 n
+银荔 6 n
+银荔杯 3 n
+银莲花 3 nr
+银蓬花 3 nr
+银蛇 15 n
+银蝶 4 n
+银蝶笑 2 nr
+银行 7684 n
+银行业 192 n
+银行业务 3 n
+银行信用 3 n
+银行信贷 3 n
+银行借款 3 n
+银行债券 3 n
+银行利息 3 n
+银行利率 3 n
+银行制 3 n
+银行券 387 n
+银行卡 216 nr
+银行号码 3 n
+银行团 3 n
+银行存折 3 n
+银行存款 3 n
+银行学 10 n
+银行家 233 n
+银行局 2 n
+银行帐号 3 n
+银行帐户 3 n
+银行户头 3 n
+银行担保 3 n
+银行汇票 3 n
+银行法 88 n
+银行界 13 n
+银行职员 3 n
+银行行印 3 n
+银行行长 3 n
+银行账 3 n
+银行账号 3 n
+银行贷款 3 n
+银行费用 3 n
+银行资本 3 n
+银行间 3 n
+银装 19 n
+银装素裹 9 n
+银角 3 n
+银证通 3 n
+银货两讫 2 n
+银质 33 n
+银质奖 9 n
+银质奖章 3 n
+银贵铜 2 nr
+银贷 3 n
+银赏锺 2 nr
+银赛富 26 nr
+银轮 44 n
+银辉 12 nr
+银辉洒 2 nr
+银输纳 2 nr
+银边 3 n
+银边眼镜 3 n
+银道 3 n
+银道面 11 n
+银都路 3 n
+银量 2 n
+银针 341 n
+银钩 7 n
+银钩虿尾 3 vn
+银钩铁画 3 n
+银钱 195 n
+银铃 21 n
+银铃样 3 n
+银链 3 n
+银锞子 7 nr
+银锭 61 n
+银镜 21 n
+银镯 3 n
+银雀山 36 nr
+银雨梨云 3 nr
+银鞍照 4 nr
+银鞭 3 n
+银项链 3 n
+银须 18 n
+银饰品 3 n
+银首饰 3 nr
+银髯老者 2 nr
+银髯蛟 3 nr
+银鱼 2886 n
+银鲤杯 5 nr
+银鲳 5 n
+银鳞 2 n
+银鸥 3 n
+银鸽 3 n
+银鸽投资 2 nz
+银鹤翎 2 nr
+银黄 3 n
+银黑狐 2 nr
+银鼠 12 n
+银龙岛 2 ns
+铷 66 g
+铸 1047 n
+铸下 3 v
+铸下大错 3 i
+铸人 3 n
+铸件 58 n
+铸像 3 v
+铸冶 3 v
+铸出 3 v
+铸刻 3 n
+铸剑为犁 3 n
+铸印 3 v
+铸台 3 n
+铸型 14 n
+铸字 8 n
+铸字工 3 n
+铸就 45 n
+铸山煮海 3 nz
+铸工 3 n
+铸币 205 n
+铸币厂 7 n
+铸成 206 v
+铸成大错 22 i
+铸排机 7 n
+铸新淘旧 3 i
+铸木镂冰 3 i
+铸模 7 n
+铸熔 3 n
+铸物 3 n
+铸甲销戈 3 n
+铸石 6 n
+铸管 5 n
+铸补 3 v
+铸造 817 v
+铸造业 3 n
+铸造件 3 n
+铸造冠 3 n
+铸造出 3 n
+铸造制品 3 n
+铸造卡环 3 n
+铸造厂 9 n
+铸造唇杆 3 n
+铸造圈 3 n
+铸造型盒 3 n
+铸造成 3 n
+铸造蜡 3 n
+铸造顶盖 3 n
+铸道 3 v
+铸道针 3 n
+铸金 3 n
+铸钟 3 n
+铸钢 27 n
+铸钢件 2 n
+铸钢厂 3 n
+铸铁 367 n
+铸铁件 3 n
+铸铁工 3 n
+铸铁管 3 nz
+铸铁量具 3 n
+铸铜 3 n
+铸错 3 v
+铸锭 12 n
+铸锻 3 n
+铸锻件 2 nz
+铸鼎象物 3 n
+铹 7 g
+铺 6811 v
+铺上 147 v
+铺上去 3 v
+铺上来 3 v
+铺下 3 v
+铺下去 3 v
+铺下来 3 v
+铺位 42 n
+铺保 3 v
+铺出 3 v
+铺出去 3 i
+铺到 3 v
+铺叙 23 v
+铺叙法 3 n
+铺地 3 n
+铺地园 3 ns
+铺地板 3 n
+铺地砖 3 n
+铺垫 106 n
+铺天盖地 163 i
+铺头 3 n
+铺子 175 n
+铺就 33 n
+铺展 24 vn
+铺展开 3 n
+铺展开来 3 ns
+铺席子 3 n
+铺平 102 ns
+铺平道路 3 ns
+铺床 28 n
+铺底 4 n
+铺开 85 v
+铺张 55 n
+铺张扬厉 5 i
+铺张浪费 48 i
+铺彻 3 v
+铺成 3 v
+铺户 17 n
+铺排 43 v
+铺摊 3 v
+铺放 8 v
+铺板 13 n
+铺满 3 v
+铺盖 143 v
+铺盖卷 40 n
+铺盖卷儿 10 n
+铺眉苫眼 3 v
+铺眉蒙眼 3 v
+铺砌 11 v
+铺筑 268 n
+铺管工人 3 n
+铺纸 3 n
+铺胸纳地 3 i
+铺行 3 v
+铺衬 4 v
+铺设 401 vn
+铺设成 3 i
+铺谋定计 3 i
+铺起 3 v
+铺路 87 n
+铺路工 3 n
+铺路石 6 n
+铺轨 31 n
+铺采摛文 3 nz
+铺锦列绣 3 n
+铺锦叠翠 3 i
+铺陈 47 v
+铺陈法 3 i
+铺集镇 2 n
+铺面 82 n
+铺面房 4 n
+铻 11 zg
+铼 32 g
+铽 5 g
+链 1173 n
+链丝菌素 3 n
+链丹 3 n
+链乳 3 n
+链产额 3 n
+链传动 3 l
+链分析 3 l
+链反应 3 l
+链增长 3 n
+链套 3 n
+链子 133 n
+链孢霉属 3 n
+链尺定距 3 n
+链带 5 n
+链延伸 3 n
+链延长 3 n
+链式 51 n
+链式反应 46 l
+链式法则 3 n
+链式连接 3 l
+链引发 3 n
+链形菜单 3 n
+链接 735 n
+链接库 3 n
+链接表 3 n
+链改组 3 n
+链断裂 3 n
+链条 171 n
+链条式 3 n
+链板 2 n
+链激酶 4 l
+链烃 9 n
+链状 33 n
+链环 9 n
+链球 32 n
+链球菌 80 n
+链球菌病 3 n
+链码跟踪 3 n
+链终止 3 l
+链结 3 n
+链罩 3 n
+链群 3 n
+链表 3 n
+链装配 3 l
+链路 44 n
+链路层 3 n
+链路管理 3 l
+链轨 4 n
+链转移 3 n
+链轮 8 n
+链轮输纸 3 n
+链金术 3 n
+链钢 3 n
+链钳子 3 n
+链锁 5 n
+链锯 5 n
+链长 3 n
+链霉糖 3 n
+链霉素 48 n
+铿 303 o
+铿然 3 a
+铿金戛玉 3 nz
+铿金霏玉 3 nz
+铿铿 3 o
+铿铿锵锵 9 o
+铿锵 114 o
+铿锵声 3 i
+铿锵有力 22 i
+铿锵集 3 i
+铿镪顿挫 3 i
+销 849 v
+销价 7 vn
+销假 3 n
+销出 3 v
+销势 8 n
+销区 2 n
+销去 3 v
+销号 2 n
+销售 6078 vn
+销售一空 15 n
+销售业 3 n
+销售业务 3 n
+销售主管 3 n
+销售价 5 n
+销售价格 3 n
+销售区 4 n
+销售员 49 n
+销售商 31 n
+销售处 3 n
+销售奖 5 n
+销售学 3 n
+销售市场 3 n
+销售店 4 n
+销售总额 3 n
+销售收入 3 n
+销售方 2 n
+销售权 5 n
+销售款 3 n
+销售点 23 n
+销售科 2 n
+销售税 4 n
+销售策略 3 n
+销售网 7 n
+销售者 26 n
+销售费用 3 n
+销售部 50 n
+销售量 159 n
+销售额 615 n
+销回 3 vn
+销回去 3 l
+销回来 3 l
+销地 3 n
+销场 3 n
+销声匿影 3 i
+销声匿迹 76 i
+销声敛迹 3 v
+销声避影 3 i
+销子 4 n
+销帐 3 n
+销往 89 vn
+销得 3 v
+销志 3 n
+销户 3 n
+销掉 3 v
+销来销去 3 l
+销案 18 n
+销毁 316 v
+销毁骨立 3 i
+销灭 3 v
+销烟 7 n
+销神流志 3 n
+销给 3 vn
+销蚀 8 vn
+销行 6 vn
+销账 3 vn
+销货 6 n
+销货单 2 n
+销货员 3 n
+销货帐 3 n
+销货成本 3 l
+销货折扣 3 n
+销货收入 3 n
+销货款 3 n
+销货毛利 3 n
+销货运费 3 n
+销赃 9 vn
+销赃罪 3 i
+销路 142 n
+销过 3 v
+销量 382 n
+销金 3 n
+销金窟 3 n
+销鎔 3 vn
+销钉 3 n
+销铄 3 a
+销销 3 vn
+销项税额 3 n
+销魂 96 n
+销魂夺魄 3 i
+销魂窟 3 n
+锁 1505 v
+锁上 47 v
+锁上去 3 v
+锁上来 3 v
+锁不住 3 v
+锁住 3 v
+锁具 3 n
+锁匙 5 n
+锁匙扣 3 n
+锁匠 3 n
+锁呐 3 n
+锁国 3 ns
+锁圈 5 n
+锁头 13 v
+锁好 3 v
+锁孔 17 n
+锁定 386 v
+锁定器 3 n
+锁定目标 3 n
+锁定键 3 n
+锁扣 11 v
+锁柜 3 n
+锁死 10 v
+锁炳勋 2 v
+锁片 21 n
+锁相 3 n
+锁相环 3 n
+锁相环路 3 nz
+锁眼 6 v
+锁簧 6 n
+锁紧 3 v
+锁线 3 n
+锁起 3 v
+锁起来 3 v
+锁边 2 n
+锁边器 3 n
+锁钉 3 n
+锁钥 20 n
+锁链 71 n
+锁镣 3 n
+锁门 27 n
+锁闭 11 v
+锁阳 9 n
+锁频 3 n
+锁骨 67 n
+锁麟囊 9 n
+锂 219 nz
+锂电 3 nz
+锂电池 3 nz
+锂离子 8 nz
+锂辉石 13 nz
+锃 19 z
+锃亮 51 z
+锃光瓦亮 5 l
+锄 311 v
+锄地 3 n
+锄大地 3 n
+锄头 172 n
+锄奸 25 n
+锄强扶弱 13 l
+锄把 3 n
+锄犁 3 n
+锄田 3 n
+锄禾 3 n
+锄禾日当午 3 l
+锄草 24 n
+锅 2561 n
+锅伙 3 n
+锅儿 3 n
+锅包肉 3 n
+锅匠 3 n
+锅台 49 n
+锅名 3 n
+锅垢 3 n
+锅子 62 n
+锅巴 1296 n
+锅庄 3 n
+锅底 67 n
+锅底朝天 3 l
+锅汤 16 n
+锅灶 57 n
+锅炉 349 n
+锅炉厂 8 n
+锅炉工 3 n
+锅炉房 138 n
+锅炉管 3 n
+锅炉配件 3 n
+锅炉间 3 n
+锅烟子 5 n
+锅盔 3 n
+锅盖 64 n
+锅盖头 3 n
+锅碗瓢盆 18 l
+锅贴 7 n
+锅贴儿 3 n
+锅里煮 3 nz
+锅铲 12 n
+锅饼 2 n
+锅驼机 3 n
+锆 120 nrt
+锆包壳 3 n
+锆石 40 n
+锇 56 g
+锈 172 n
+锈了 3 v
+锈住 3 v
+锈斑 9 n
+锈牢 3 n
+锈病 46 n
+锈菌 4 n
+锈蚀 26 v
+锈迹 13 n
+锈迹斑斑 17 l
+锈铁 3 n
+锉 98 n
+锉光 3 n
+锉刀 15 n
+锉去 3 n
+锉子 5 n
+锉尖 3 n
+锉平 3 n
+锉床 3 n
+锉成 3 n
+锉磨 3 n
+锊 63 zg
+锋 887 nr
+锋不可当 3 i
+锋刃 36 n
+锋利 382 a
+锋发韵流 3 n
+锋头 3 n
+锋快 3 a
+锋电位 3 n
+锋矢 3 n
+锋箭 3 n
+锋线 103 n
+锋芒 148 n
+锋芒不露 3 i
+锋芒内敛 3 i
+锋芒太露 3 i
+锋芒所向 3 i
+锋芒毕露 24 i
+锋芒逼人 3 i
+锋铓毕露 3 n
+锋锐 113 a
+锋镝 8 n
+锋镝余生 3 nz
+锋面 54 n
+锋面雨 3 i
+锌 1652 n
+锌元素 3 n
+锌华 3 nz
+锌合金 3 n
+锌指 3 nz
+锌板 3 n
+锌极 3 n
+锌片 3 n
+锌版 3 nz
+锌白 3 nz
+锌皮 3 n
+锌盐 3 nz
+锌矿 3 nz
+锌粉 16 nz
+锌粒 3 n
+锌肥 3 n
+锌试剂 3 nz
+锌钡白 2 n
+锌铁矿 3 nz
+锌锭 3 nz
+锌黄 2 nz
+锍 38 g
+锎 20 g
+锏 324 g
+锐 368 nr
+锐不可当 14 l
+锐不可挡 3 i
+锐兵 3 n
+锐减 202 v
+锐利 212 a
+锐利地 3 n
+锐利度 3 n
+锐利武器 3 l
+锐势 3 n
+锐化 7 v
+锐升 3 v
+锐器 5 n
+锐增 3 v
+锐志 3 n
+锐意 64 v
+锐意改革 3 l
+锐意进取 42 l
+锐挫望绝 3 ns
+锐挫气索 3 z
+锐敏 18 a
+锐步 2 d
+锐气 240 n
+锐眼 3 a
+锐而不挫 3 i
+锐角 18 n
+锐角三角 3 n
+锐进 2 v
+锐钛矿 3 n
+锑 295 ng
+锑化物 3 n
+锑化铟 5 n
+锑华 2 n
+锑矿 3 n
+锒 53 i
+锒铛 4 n
+锒铛入狱 16 i
+锓 51 g
+锔 30 g
+锔锅匠 3 n
+锕 67 g
+锕系元素 3 v
+锖 52 x
+锖色 3 nr
+锗 156 n
+锗晶体 3 nr
+锗石 3 nr
+锘 38 g
+错 6340 v
+错上加错 3 i
+错义 3 n
+错乱 106 n
+错了又错 3 i
+错事 94 n
+错会 3 n
+错位 105 n
+错位原子 3 n
+错分 3 n
+错分裂 3 i
+错划 58 n
+错列 3 n
+错判 9 v
+错别字 55 n
+错动 3 n
+错号 6 n
+错告 3 n
+错填 3 v
+错处 27 n
+错失 84 n
+错失良机 19 i
+错字 25 n
+错字连篇 3 n
+错开 49 v
+错彩镂金 3 i
+错待 3 v
+错怪 91 n
+错愕 90 a
+错手 3 n
+错插 3 v
+错放 3 v
+错断 38 v
+错杂 47 a
+错杂在 3 z
+错杂着 3 v
+错构瘤 2 n
+错案 26 n
+错模式 2 n
+错殊 3 a
+错流 3 n
+错漏 12 n
+错爱 24 n
+错版 3 v
+错用 3 n
+错码 3 n
+错筋 3 n
+错综 42 z
+错综复杂 202 i
+错缪 3 nrt
+错节 3 n
+错节盘根 3 n
+错落 347 n
+错落不齐 3 i
+错落有致 42 i
+错落高下 3 i
+错觉 268 n
+错觉作用 3 n
+错认 3 v
+错认颜标 3 i
+错讹 10 n
+错词 3 n
+错译 3 n
+错话 48 n
+错误 6379 n
+错误代码 3 n
+错误信息 3 i
+错误倾向 3 v
+错误做法 3 i
+错误判断 3 n
+错误处理 3 i
+错误引导 3 n
+错误思想 3 i
+错误想法 3 i
+错误扩散 3 n
+错误报告 3 n
+错误掺入 3 vn
+错误操作 3 i
+错误方法 3 n
+错误模式 3 n
+错误率 2 n
+错误百出 3 i
+错误码 5 n
+错误类别 3 i
+错误缺点 3 n
+错误行为 3 i
+错误观念 3 n
+错误观点 3 n
+错误计算 3 i
+错误认识 3 i
+错误诊断 3 n
+错读 3 v
+错谬 3 a
+错车 3 n
+错载 3 v
+错过 46 v
+错过去 3 i
+错过机会 3 n
+错过来 3 i
+错退 3 v
+错那县 4 ns
+错配 3 v
+错配修复 3 i
+错配序列 3 n
+错金 28 n
+错铺路 3 n
+错题 51 n
+锚 225 n
+锚位 3 n
+锚喷支护 3 v
+锚固 24 j
+锚地 32 n
+锚定 3 n
+锚定引物 3 n
+锚定蛋白 3 n
+锚机 3 n
+锚杆 13 n
+锚架 3 n
+锚标 3 j
+锚栓 2 n
+锚桩 2 n
+锚泊 10 n
+锚索 11 n
+锚缆 3 n
+锚蛋白 3 n
+锚链 7 n
+锚链孔 3 vn
+锚雷 3 n
+锛 12605 v
+锛得儿木 3 n
+锜 812 zg
+锝 77 g
+锞 66 g
+锟 28 g
+锠 9 zg
+锡 1246 ns
+锡业 2 n
+锡业股份 5 nz
+锡伯 73 ns
+锡伯族 319 nz
+锡克 27 nz
+锡克人 12 nrt
+锡克教 20 nz
+锡克族 3 nz
+锡兰 73 ns
+锡兰人 3 nz
+锡兰岛 4 ns
+锡剧 28 n
+锡匠 3 n
+锡华 77 nz
+锡卡索 2 ns
+锡器 3 nz
+锡壶 3 n
+锡安 3 ns
+锡安山 3 ns
+锡尔河 52 ns
+锡尔特 3 nrt
+锡山 87 ns
+锡山区 3 ns
+锡山市 32 ns
+锡德 2 ns
+锡德尼 3 ns
+锡杖 37 n
+锡林 7 nz
+锡林浩特 8 ns
+锡林浩特市 6 ns
+锡林郭勒 14 ns
+锡林郭勒盟 31 ns
+锡林郭勒草原 8 ns
+锡瓦 7 ns
+锡瓦斯 6 ns
+锡盟 7 ns
+锡石 3 nz
+锡矿 90 nz
+锡矿山 17 ns
+锡简 3 n
+锡箔 41 n
+锡箔纸 3 n
+锡纸 10 nz
+锡罐 3 nz
+锡耶纳 78 nrt
+锡耶那 2 ns
+锡诺普 3 nrt
+锡金 105 n
+锡金人 3 n
+锡铁山 12 nz
+锡锭 3 nz
+锡鼓 3 n
+锢 173 g
+锢囚 7 n
+锢疾 3 n
+锣 396 n
+锣声 95 n
+锣经 3 n
+锣鼓 294 n
+锣鼓喧天 39 i
+锣鼓声 44 i
+锣鼓振天 3 i
+锣鼓点 11 n
+锣鼓队 7 n
+锤 651 ng
+锤下 3 n
+锤儿 3 n
+锤击 3 v
+锤头 12 n
+锤子 90 n
+锤子敲 3 v
+锤床捣枕 3 v
+锤打 3 v
+锤炼 101 v
+锤造冠 3 n
+锤链 3 n
+锤骨 3 n
+锥 696 n
+锥井 3 n
+锥体 44 n
+锥体外系 3 n
+锥体束 3 n
+锥体细胞 3 n
+锥刀 3 n
+锥刀之利 3 i
+锥刀之未 3 i
+锥刀之末 3 i
+锥刀之用 3 i
+锥刺股 3 n
+锥处囊中 3 n
+锥头 3 n
+锥子 79 n
+锥度 4 n
+锥形 127 n
+锥形牙 3 n
+锥形物 3 n
+锥形瓶 3 n
+锥心 3 n
+锥心泣血 3 i
+锥心蚀骨 3 n
+锥指 3 n
+锥栗 6 n
+锥股 3 n
+锥虫 30 n
+锥虫病 11 n
+锥间盘 3 n
+锥面 26 n
+锥齿轮 15 n
+锦 1968 ns
+锦上添花 99 i
+锦兴 15 ns
+锦匣 3 ns
+锦华 5 nz
+锦县 8 ns
+锦囊 85 n
+锦囊佳制 3 i
+锦囊佳句 3 i
+锦囊妙计 20 i
+锦囊玉轴 3 i
+锦囊还矢 3 i
+锦团花簇 3 i
+锦城 18 ns
+锦城镇 5 ns
+锦天绣地 3 i
+锦字 3 n
+锦官城 3 ns
+锦屏 14 n
+锦屏县 3 ns
+锦州 610 ns
+锦州市 30 ns
+锦州港 2 ns
+锦州湾 7 ns
+锦帐 3 n
+锦帛 3 n
+锦带 3 n
+锦心绣口 4 i
+锦心绣肠 3 i
+锦心绣腹 3 i
+锦户亮 3 n
+锦旗 225 ns
+锦春 3 ns
+锦标 24 n
+锦标主义 3 n
+锦标赛 918 n
+锦橙 4 n
+锦母角 2 n
+锦江 162 ns
+锦江区 23 ns
+锦沧 2 ns
+锦涛 3 n
+锦灯笼 3 n
+锦熟黄杨 3 i
+锦片前程 3 nz
+锦瑟华年 3 n
+锦瑟年华 3 nrt
+锦生 3 n
+锦盒 36 n
+锦石 2 n
+锦砖面层 3 n
+锦秀 3 nz
+锦笺 3 n
+锦篇绣帙 3 n
+锦簇 2 n
+锦簇花团 3 nz
+锦纶 33 n
+锦纶丝 3 n
+锦绣 173 n
+锦绣前程 16 i
+锦绣大地 30 i
+锦绣山 3 ns
+锦绣山河 3 ns
+锦绣川 4 ns
+锦绣心肠 3 i
+锦绣江山 19 ns
+锦绣河山 4 ns
+锦绣肝肠 3 i
+锦绣路 3 ns
+锦缎 151 n
+锦胸绣口 3 i
+锦营花阵 3 i
+锦葵 14 n
+锦衣 194 n
+锦衣卫 739 n
+锦衣玉带 3 i
+锦衣玉食 42 i
+锦衣纨裤 3 nz
+锦衣肉食 3 i
+锦衣行昼 3 n
+锦袍 3 n
+锦被 31 n
+锦西 13 ns
+锦西市 2 ns
+锦阳 3 ns
+锦阵花营 3 i
+锦霞 3 ns
+锦鲤 3 n
+锦鳞 46 n
+锦鸡 38 ns
+锦鸡儿 9 n
+锧 6 zg
+锨 105 n
+锩 52 v
+锪 25 v
+锫 12 g
+锬 25 g
+锭 327 q
+锭剂 3 n
+锭子 33 n
+锭子油 3 n
+键 804 n
+键不放 3 l
+键位 4 n
+键位图 3 n
+键位布局 3 n
+键位提示 3 n
+键值 3 n
+键元 2 n
+键入 17 n
+键入程序 3 l
+键击 3 v
+键刷新 3 n
+键名 3 n
+键名字 3 l
+键名汉字 3 l
+键呼出 3 l
+键子 3 n
+键拖动 3 l
+键指 3 n
+键控 10 b
+键板 3 n
+键槽 7 n
+键步如飞 3 l
+键盘 378 n
+键盘乐器 24 n
+键盘记录 3 n
+键盘输入 3 n
+键码 3 n
+键竖琴 3 l
+键角 3 n
+键贴 3 n
+键配合 4 n
+键钮 9 n
+键面 3 n
+锯 390 v
+锯下 3 n
+锯下去 3 n
+锯下来 3 n
+锯出 3 n
+锯刀 3 n
+锯切成 3 nz
+锯口 3 n
+锯好 3 n
+锯子 17 n
+锯屑 3 n
+锯床 9 nz
+锯开 3 n
+锯断 3 n
+锯木 38 n
+锯木业 3 n
+锯木厂 11 n
+锯木屑 3 n
+锯木架 3 n
+锯末 8 n
+锯末子 2 n
+锯机 3 n
+锯材 17 n
+锯条 6 n
+锯树 3 n
+锯片 3 n
+锯牙钩爪 3 n
+锯直 3 nz
+锯蛋白 3 n
+锯起来 3 nz
+锯过 3 n
+锯过去 3 n
+锯过来 3 nz
+锯错 3 n
+锯锯 3 n
+锯齿 227 n
+锯齿形 2 n
+锯齿波形 3 n
+锯齿状 3 nz
+锯齿草 3 n
+锯齿鲑 3 n
+锰 995 n
+锰土 3 n
+锰矿 118 n
+锰矿石 3 n
+锰肥 3 n
+锰酸钾 3 n
+锰钢 9 n
+锰铁 12 n
+锱 8 g
+锱珠必较 3 i
+锱铢 4 n
+锱铢不爽 3 i
+锱铢必较 12 i
+锱铢较量 3 n
+锲 29 i
+锲而不舍 66 i
+锲鹄 3 i
+锴 7 g
+锵 77 o
+锵金铿玉 3 nr
+锵金鸣玉 3 nr
+锵锵 3 o
+锶 120 ng
+锶盐 3 nz
+锷 43 g
+锸 53 n
+锹 155 n
+锺 516 zg
+锺子期 3 nr
+锺灵毓秀 3 nr
+锻 182 v
+锻件 25 n
+锻压 61 v
+锻压机 6 n
+锻压设备 3 n
+锻子 3 n
+锻工 7 v
+锻工术 3 n
+锻工钳 3 n
+锻打 16 v
+锻接 3 v
+锻模 3 n
+锻炉 4 v
+锻炼 1689 v
+锻炼者 2 n
+锻炼身体 3 n
+锻烧 3 v
+锻烧成 3 n
+锻烧炉 3 n
+锻石 3 n
+锻练 3 v
+锻造 142 v
+锻造厂 3 n
+锻造工 3 n
+锻造法 3 n
+锻造车间 3 n
+锻钢 5 n
+锻铁 17 n
+锻铸 2 v
+锻链出 3 vn
+锻锤 11 n
+锼 24 zg
+锾 111 q
+锿 28 g
+镀 138 n
+镀上 3 n
+镀在 3 v
+镀层 14 n
+镀成 3 v
+镀板 3 n
+镀膜 12 n
+镀膜机 3 n
+镀膜钛 3 n
+镀覆 3 v
+镀角 3 n
+镀边 3 n
+镀金 101 n
+镀金工人 3 n
+镀铁 3 n
+镀铜 4 n
+镀铝 2 n
+镀铝膜 3 nz
+镀铬 8 n
+镀铬钢 3 n
+镀银 14 n
+镀锌 7 n
+镀锌丝 3 n
+镀锌板 2 n
+镀锌管 3 n
+镀锌铁 3 n
+镀锡 3 nz
+镀锡铁 2 n
+镀镍 2 n
+镁 588 n
+镁光 3 nz
+镁光灯 16 nz
+镁合金 2 n
+镁矿 4 nz
+镁砂 4 nz
+镁砖 5 nz
+镁粉 2 nz
+镁质 21 n
+镁铝合金 3 nz
+镂 350 v
+镂冰 3 v
+镂冰劚雪 3 n
+镂冰炊砾 3 v
+镂冰雕朽 3 i
+镂冰雕琼 3 i
+镂刻 29 v
+镂尘吹影 3 i
+镂心刻骨 3 i
+镂心呕血 3 vn
+镂心鉥肝 3 v
+镂月裁云 3 i
+镂版 3 v
+镂玉裁冰 3 i
+镂空 126 vn
+镂空雕 2 i
+镂肝鉥肾 3 n
+镂花 21 v
+镂金铺翠 3 n
+镂金错彩 3 i
+镂骨铭心 2 i
+镂骨铭肌 3 i
+镃 33 zg
+镄 23 g
+镅 83 g
+镆 46 x
+镇 11036 n
+镇上 684 v
+镇乡 6 ns
+镇住 98 v
+镇元斋 3 nz
+镇党委 3 nt
+镇公所 3 nt
+镇内 16 ns
+镇北堡 9 ns
+镇区 38 ns
+镇南 100 ns
+镇南关 3 ns
+镇南王 94 nrt
+镇压 2422 v
+镇压住 3 i
+镇压器 3 n
+镇压者 3 n
+镇原 19 ns
+镇原县 3 ns
+镇县 3 ns
+镇反 26 v
+镇名 3 v
+镇吐 3 v
+镇咳剂 3 nz
+镇咳药 11 n
+镇国寺 8 ns
+镇坪 3 ns
+镇坪县 3 ns
+镇委 16 n
+镇子 130 n
+镇子梁乡 3 ns
+镇宁 20 ns
+镇宁县 2 ns
+镇宁布依族苗族自治县 10 ns
+镇宁路 3 ns
+镇宅 3 n
+镇守 386 v
+镇守使 18 n
+镇安 31 ns
+镇安县 6 ns
+镇定 638 v
+镇定剂 3 n
+镇定自若 48 i
+镇尺 9 n
+镇嵩军 4 nz
+镇巴 4 ns
+镇巴县 2 ns
+镇平 18 ns
+镇平县 5 ns
+镇康 2 ns
+镇康县 3 ns
+镇心 3 v
+镇惊 9 v
+镇戍 3 v
+镇政府 31 nt
+镇日镇夜 3 nz
+镇星 9 n
+镇暴 3 n
+镇暴部队 3 n
+镇暴队形 3 n
+镇服 3 v
+镇民 7 n
+镇民大会 3 nt
+镇江 512 ns
+镇江人 3 nz
+镇江市 40 ns
+镇流器 6 n
+镇流管 3 n
+镇海 127 ns
+镇海区 4 ns
+镇海县 3 ns
+镇海寺 7 ns
+镇海村 2 ns
+镇海港 4 ns
+镇海电厂 2 nt
+镇痛 187 a
+镇痛剂 13 n
+镇痛药 3 n
+镇级 5 n
+镇纸 17 n
+镇西 46 ns
+镇贲 3 n
+镇贲县 3 v
+镇赉 2 nrt
+镇赉县 5 ns
+镇远 122 a
+镇远县 3 ns
+镇里 19 ns
+镇长 1050 v
+镇雄 2 ns
+镇雄县 4 ns
+镇静 396 a
+镇静剂 33 n
+镇静自若 3 i
+镇静药 25 n
+镇静钢 3 n
+镈 12 zg
+镉 222 n
+镊 24 n
+镊子 53 n
+镋 2 zg
+镌 121 zg
+镌刻 97 v
+镌印 3 v
+镌心铭骨 3 z
+镌琢 3 v
+镌空妄实 3 z
+镌脾琢肾 3 v
+镌镂 3 v
+镌骨铭心 3 z
+镍 858 n
+镍合金 3 n
+镍币 2 n
+镍材 3 n
+镍氢 8 n
+镍氢电池 3 n
+镍粉 8 n
+镍都 5 n
+镍钢 8 n
+镍铁 4 n
+镍铬 3 n
+镍铬丝 3 n
+镎 28 g
+镏 293 n
+镏子 3 n
+镏金 138 n
+镐 512 n
+镐京 3 n
+镐头 10 n
+镐素 3 n
+镑 2820 m
+镒 58 q
+镓 64 g
+镔 2 n
+镔铁 67 n
+镕 31 nr
+镕今铸古 3 nr
+镕古铸今 3 nr
+镖 921 n
+镖客 31 n
+镖局 467 n
+镖局子 44 n
+镖师 177 n
+镗 184 o
+镗孔 3 n
+镗床 27 n
+镘 4 g
+镛 7 g
+镜 1565 ng
+镜与鸾凤 3 i
+镜中人 3 n
+镜中花 3 n
+镜像 45 n
+镜像文件 3 n
+镜像游戏 3 n
+镜光 3 n
+镜内 3 n
+镜分鸾凤 3 i
+镜匣 2 n
+镜匾 3 n
+镜台 14 n
+镜圆璧合 3 i
+镜外 3 j
+镜头 618 n
+镜头感 4 n
+镜子 818 n
+镜屏 6 n
+镜戒 3 n
+镜报 15 n
+镜架 7 n
+镜框 64 n
+镜检 14 j
+镜检查 2 n
+镜泊 7 n
+镜泊湖 60 ns
+镜湖 17 ns
+镜湖区 3 ns
+镜潭路 3 ns
+镜片 168 n
+镜画 3 n
+镜盒 19 n
+镜破钗分 3 n
+镜筒 3 n
+镜箱 3 n
+镜花 3 n
+镜花水月 15 n
+镜花缘 8 n
+镜记 2 n
+镜象 3 n
+镜象原理 3 n
+镜象平面 3 n
+镜象异构 3 n
+镜象法 3 n
+镜边 3 n
+镜里观花 3 ns
+镜里采花 3 n
+镜鉴 3 n
+镜铁山 4 ns
+镜面 109 n
+镜面反射 3 n
+镜频干扰 3 i
+镝 7 g
+镞 335 ng
+镞砺括羽 3 v
+镟 72 zg
+镠 113 zg
+镡 3 nr
+镢 23 n
+镢头 67 n
+镣 118 n
+镣铐 58 n
+镤 7 g
+镥 8 g
+镦 131 g
+镧 38 n
+镧系元素 15 n
+镨 7 g
+镪 9 zg
+镪水 3 vn
+镫 128 g
+镬 114 zg
+镭 111 n
+镭射 7 b
+镭射光 3 b
+镭射气 3 b
+镯 73 n
+镯子 120 n
+镰 192 n
+镰刀 171 n
+镰刀形 7 n
+镰刀状 3 n
+镰孢菌属 3 n
+镰孢菌酸 3 n
+镰状 3 n
+镰菌素 3 n
+镱 6 g
+镲 6 n
+镳 63 g
+镴 6 zg
+镵 3 zg
+镶 640 v
+镶上 3 v
+镶上去 3 v
+镶上来 3 v
+镶住 3 v
+镶入 3 v
+镶制 3 v
+镶宝石 3 ns
+镶嵌 392 v
+镶嵌图 3 n
+镶嵌画 25 n
+镶嵌花坛 3 n
+镶成 3 v
+镶木 3 ns
+镶板 2 n
+镶满 3 v
+镶牙 8 ns
+镶玉 3 nz
+镶着 3 v
+镶花 3 v
+镶边 45 ns
+镶金 3 n
+镶银 3 nz
+镶铸 3 v
+镶黄旗 37 ns
+镶齿钻头 3 nz
+長 5 zg
+镺 24 zg
+长 40281 a
+长一智 13 nr
+长七短八 3 i
+长三 52 d
+长三丙 2 nr
+长三乙 4 nr
+长三火箭 3 l
+长三甲 12 ns
+长三角 389 ns
+长上 28 d
+长不大 3 l
+长丝 56 n
+长丝级 3 n
+长丰 26 ns
+长丰县 5 ns
+长串 3 n
+长久 763 d
+长久不衰 3 l
+长久之计 34 l
+长久以来 67 l
+长久性 5 n
+长乐 202 ns
+长乐县 6 ns
+长乐宫 10 ns
+长乐市 3 ns
+长乐未央 3 n
+长乐村 2 ns
+长乐烧 3 l
+长乐路 3 nz
+长于 357 d
+长亭 34 ns
+长亲 4 n
+长休 3 ns
+长传 66 nz
+长伴 3 n
+长住 44 v
+长信 33 nz
+长信侯 4 nr
+长假 486 n
+长傲饰非 3 i
+长兄 94 n
+长兄为父 3 nr
+长兴 100 ns
+长兴县 6 ns
+长兴岛 3 ns
+长冈 4 ns
+长冠牙 3 ns
+长凳 99 n
+长列 3 ns
+长别 3 d
+长剑 2070 n
+长势 62 n
+长势喜人 3 i
+长勺 7 n
+长卷 50 n
+长卷发 3 l
+长发 210 nz
+长发女 3 n
+长句 18 n
+长台 5 ns
+长台关 4 ns
+长史 142 n
+长叶松 3 n
+长号 31 n
+长叹 540 v
+长叹一声 3 l
+长吁短叹 46 i
+长吁短气 3 z
+长吏 3 n
+长吟 3 z
+长吟阁 10 nr
+长吨 6 n
+长命 17 nz
+长命富贵 3 i
+长命百岁 40 n
+长命锁 7 nz
+长啸 165 n
+长嘘短叹 2 l
+长嘴 51 ns
+长嚎 3 n
+长围巾 3 n
+长圆 3 n
+长坂 33 ns
+长坂坡 18 ns
+长坑 2 ns
+长型 3 b
+长垣 28 ns
+长垣县 3 ns
+长城 1559 ns
+长城公司 7 nt
+长城博物馆 7 ns
+长城卡 3 ns
+长城汽车 3 nt
+长城牌 2 n
+长城特殊钢股份有限公司 2 nt
+长城电脑 5 nt
+长城站 26 ns
+长堤 298 n
+长处 224 d
+长备 3 n
+长夏 3 ns
+长夜 115 d
+长夜漫漫 3 l
+长夜短 3 i
+长夜难明 3 l
+长夜难眠 3 l
+长大 1498 ns
+长大成人 103 nz
+长大衣 3 nz
+长天 28 ns
+长天老日 3 l
+长头 7 n
+长女 70 n
+长姊 3 nr
+长媳 3 n
+长嫂如母 3 nr
+长子 786 n
+长子县 3 ns
+长字元 3 n
+长存 42 n
+长孙 96 ns
+长孙女 3 n
+长学 2 n
+长宁 27 ns
+长宁区 22 ns
+长宁县 4 ns
+长宁店 3 ns
+长宁路 3 ns
+长宁镇 3 ns
+长安 5355 ns
+长安乡 3 ns
+长安区 12 ns
+长安县 17 ns
+长安城 178 ns
+长安少年 3 n
+长安庙 3 ns
+长安棋局 3 nt
+长安汽车 4 nt
+长安街 1482 ns
+长安道上 3 ns
+长安镇 2 ns
+长官 1270 n
+长官司 20 n
+长官意志 3 ns
+长实 25 d
+长宽 27 v
+长寿 283 ns
+长寿区 2 ns
+长寿县 4 ns
+长寿命 3 nr
+长寿烟 3 nr
+长寿牌 3 n
+长寿菜 2 n
+长寿路 3 ns
+长寿面 13 n
+长射程 3 n
+长尾 116 ns
+长尾巴 21 n
+长尾猴 3 n
+长尾猿 3 n
+长尾病毒 3 n
+长局 3 n
+长屋 18 ns
+长山 319 ns
+长山岛 3 ns
+长山核桃 3 n
+长岐镇 3 nr
+长岛 37 ns
+长岛县 8 ns
+长岭 29 ns
+长岭县 3 ns
+长岭子 3 n
+长岭岗 256 ns
+长崎 131 ns
+长崎县 7 ns
+长崎市 2 ns
+长川 4 ns
+长工 167 n
+长巷 13 ns
+长带 3 n
+长平 76 ns
+长年 206 d
+长年三老 3 l
+长年累月 40 l
+长幼 3 d
+长幼尊卑 3 n
+长幼慈 16 nr
+长幼有叙 3 nr
+长幼有序 12 l
+长庆 46 ns
+长庆油田 2 nt
+长庚 8 nrt
+长庚医院 3 nz
+长庚星 9 nr
+长庚纪念 3 nr
+长度 1542 ns
+长廊 431 n
+长影 4 n
+长往远引 3 i
+长征 865 n
+长征一号 3 n
+长征三号 2 n
+长征三号甲 2 i
+长征二号 3 nz
+长征军 3 n
+长征医院 4 nt
+长征四号 3 n
+长征路 3 n
+长径 3 n
+长得俊 4 nr
+长得帅 3 nr
+长得艳 2 l
+长忧 3 nz
+长念却虑 3 i
+长性 3 n
+长恨 3 n
+长恨歌 29 nz
+长恶不悛 3 i
+长恶靡悛 3 i
+长情 3 n
+长成 227 v
+长戟高门 3 n
+长房 8 n
+长才广度 3 ns
+长才短驭 3 i
+长拳 56 n
+长挑 3 a
+长排 3 v
+长揖 3 v
+长揖不拜 3 nr
+长效 152 a
+长效机制 3 n
+长文 16 nz
+长斋 5 nr
+长斋绣佛 3 nz
+长方 37 n
+长方体 6 n
+长方型 3 n
+长方形 1268 n
+长方脸 14 l
+长日照型 3 nz
+长时间 119 l
+长明 5 ns
+长明灯 29 n
+长春 770 ns
+长春不老 3 i
+长春亚泰 101 nz
+长春亚泰队 68 nt
+长春园 7 ns
+长春客车厂 2 nt
+长春市 113 ns
+长春市委 2 nt
+长春新碱 3 nz
+长春电影制片厂 13 nt
+长春碱 9 l
+长春站 3 ns
+长春花 10 ns
+长春花碱 3 l
+长春藤 4 nr
+长春道 2 ns
+长春队 51 nt
+长智 3 n
+长曲棍球 3 n
+长有仪 2 nr
+长期 8664 d
+长期不懈 3 l
+长期争斗 3 l
+长期以来 761 l
+长期保持 3 n
+长期借款 3 l
+长期债务 3 n
+长期共存 3 l
+长期冻结 3 l
+长期化 5 l
+长期存在 3 l
+长期实践 3 l
+长期性 82 n
+长期打算 3 l
+长期投资 3 l
+长期抗战 3 l
+长期斗争 3 l
+长期有效 3 l
+长期负债 3 l
+长期贷款 3 n
+长期趋势 3 l
+长机 34 n
+长杆 3 n
+长杆话筒 3 n
+长材小试 3 n
+长材茂学 3 n
+长条 72 n
+长条形 299 n
+长条状 15 n
+长条石 4 n
+长板 4 n
+长板凳 3 n
+长枕 3 ns
+长枕大衾 3 nr
+长枕大被 3 i
+长林丰草 3 nz
+长林哥 2 ns
+长枪 150 n
+长枪队 3 n
+长柄 3 n
+长柄勺子 3 nr
+长桌 35 n
+长桥 19 ns
+长梁山 2 ns
+长椅 40 n
+长歌当哭 7 l
+长正中 3 nr
+长此下去 24 l
+长此以往 78 l
+长武 2 ns
+长武县 3 ns
+长殇 3 n
+长毛 118 n
+长毛兔 8 n
+长毛绒 16 n
+长毛象 3 n
+长汀 29 ns
+长汀县 8 ns
+长江 18930 ns
+长江三峡 583 ns
+长江三峡工程 7 nz
+长江三峡水利枢纽工程 257 nz
+长江三角 3 ns
+长江三角洲 109 ns
+长江三角洲地区 15 ns
+长江上游 3 l
+长江下游 3 ns
+长江中下游地区 24 ns
+长江中路 3 ns
+长江口 118 ns
+长江后浪 3 l
+长江后浪推前浪 14 l
+长江大桥 3858 ns
+长江天堑 3 l
+长江局 40 nt
+长江文艺出版社 3 nt
+长江日报 3 nz
+长江水产研究所 512 nt
+长江水利委员会 7 nt
+长江流域 1098 ns
+长江源 3 ns
+长江网 3 nz
+长江路 12 ns
+长江黄河 3 ns
+长沙 2708 ns
+长沙人 26 n
+长沙县 21 ns
+长沙地区 5 ns
+长沙市 137 ns
+长沙市人 2 n
+长沙火车站 3 ns
+长沟 3 ns
+长河 537 ns
+长治 103 n
+长治久安 677 l
+长治县 10 ns
+长治市 16 ns
+长法 9 n
+长波 75 ns
+长泰 2 nz
+长泰县 3 ns
+长津江 2 ns
+长津湖 9 ns
+长洲区 3 ns
+长活 7 d
+长流 84 n
+长流水 7 ns
+长海 8 ns
+长海县 11 ns
+长淮 5 j
+长清区 21 ns
+长清县 13 ns
+长清镇 3 ns
+长渠 3 ns
+长港 3 ns
+长湖 23 ns
+长溜儿 2 z
+长满 280 a
+长滨 8 ns
+长滨乡 2 ns
+长滩 23 ns
+长滩峡 3 ns
+长澄田 2 nr
+长烟一空 3 l
+长焦机 3 n
+长焦端 3 n
+长焰煤 6 n
+长片 3 n
+长牙 3 ns
+长物 2 n
+长特 2 ns
+长玢岩 6 nr
+长班 21 ns
+长生 210 n
+长生不死 46 l
+长生不老 104 l
+长生久视 2 l
+长生剑 3 n
+长生塔 2 n
+长生子 4 n
+长生延 2 nr
+长生果 8 n
+长生殿 30 n
+长生禄 2 l
+长生草 3 n
+长生药 3 n
+长田 3 ns
+长甸 3 ns
+长留 15 v
+长畸 3 v
+长痘痘 3 n
+长白 76 ns
+长白丘陵 3 ns
+长白参 3 n
+长白山 218 ns
+长白山区 18 ns
+长白山地 3 ns
+长白山天池 10 ns
+长白山脉 23 ns
+长白朝鲜族自治县 5 ns
+长白猪 3 n
+长皮 3 n
+长皱纹 3 i
+长盛 3 nz
+长盛不衰 34 l
+长目飞耳 3 i
+长直 8 d
+长相 251 d
+长相依 3 nr
+长相左右 3 l
+长眉俊 4 nr
+长真子 4 l
+长眠 58 ns
+长眠不起 3 l
+长眠不醒 2 l
+长矛 344 n
+长短 472 z
+长短不一 3 l
+长短不齐 3 i
+长短句 35 l
+长短期 7 j
+长短诗 3 l
+长短途 2 b
+长石 197 n
+长程 3 n
+长程力 3 n
+长程计划 3 n
+长程飞弹 3 n
+长空 79 n
+长立幼 2 i
+长笛 54 n
+长筒取心 3 l
+长筒袜 3 n
+长筒袜子 3 n
+长筒靴 2 nz
+长策 3 n
+长算远略 3 n
+长箭飞 2 nr
+长篇 385 b
+长篇大套 3 l
+长篇大论 68 l
+长篇小说 820 l
+长篇累牍 3 i
+长线 129 n
+长线产品 2 n
+长线天线 3 l
+长细晶 2 z
+长绒 2 n
+长绒棉 22 n
+长统 3 n
+长统袜 5 n
+长统靴 4 nz
+长绳 79 ns
+长绳系日 3 l
+长绳系景 3 l
+长编 44 n
+长缨 10 n
+长老 2251 n
+长老会 24 n
+长老教会 3 l
+长老派 10 n
+长者 193 n
+长耳朵 11 ns
+长肉 3 n
+长肥 3 ns
+长胖 3 a
+长胜 4 ns
+长胡子 3 l
+长脚 188 ns
+长脸 24 d
+长膘 3 v
+长臂 70 n
+长臂猿 52 n
+长臂虾 4 n
+长舌 26 n
+长舌之妇 3 i
+长舌夫 3 ns
+长舌妇 6 n
+长航 38 j
+长芽 3 n
+长英岩 2 nr
+长茄子 3 n
+长荣 22 nr
+长葛 43 ns
+长葛县 2 ns
+长葛市 12 ns
+长虑却顾 3 i
+长虑后顾 3 l
+长虑顾后 3 l
+长虫 29 n
+长虹 400 nz
+长虹公司 4 nt
+长虹桥 2 ns
+长虺成蛇 3 v
+长蛇 3 n
+长蛇封豕 3 i
+长蛇阵 14 i
+长街 123 ns
+长街短巷 3 i
+长衣 40 n
+长衫 261 n
+长袍 480 n
+长袍马褂 3 n
+长袖 105 n
+长袖善舞 3 i
+长袖衫 3 n
+长袜 10 n
+长裕 3 nz
+长裙 102 n
+长裤 57 n
+长褂 3 n
+长见识 3 l
+长见识了 3 l
+长角牛 3 ns
+长言 3 n
+长计远虑 3 i
+长词组 3 n
+长诗 242 n
+长话 29 n
+长话局 2 nt
+长话短说 13 l
+长话费 3 n
+长调 13 n
+长谈 74 nz
+长谈阔论 3 i
+长谷 14 ns
+长豇豆 3 v
+长足 213 a
+长足发展 3 nt
+长足性 3 n
+长足进展 3 nt
+长足进步 3 l
+长跑 87 ns
+长跑队 2 n
+长距离 69 n
+长跪 27 v
+长路 28 ns
+长轴 46 n
+长轴距 5 nz
+长辈 414 n
+长辛店 161 ns
+长辛店镇 2 ns
+长辞 3 n
+长边 2 d
+长达 3 ns
+长运 6 n
+长进 136 v
+长远 812 d
+长远利益 3 n
+长远性 4 n
+长远打算 3 l
+长远目标 3 n
+长远规划 3 l
+长途 453 d
+长途客车 3 l
+长途旅行 3 n
+长途汽车 99 l
+长途汽车站 20 l
+长途电话 113 l
+长途贩运 3 l
+长途费 2 n
+长途跋涉 80 i
+长途车 20 l
+长途运输 3 l
+长途飞行 3 l
+长逝 3 v
+长郡中学 12 nr
+长野 54 ns
+长野健 3 nr
+长野县 5 ns
+长金志 3 n
+长针 3 n
+长钉 3 n
+长钓 3 v
+长销 2 v
+长镜头 5 n
+长长 217 n
+长长地 122 z
+长长的 686 z
+长长短短 17 z
+长门 42 ns
+长队 42 n
+长阳 336 ns
+长阳县 5 ns
+长阳土家族自治县 270 ns
+长阳路 3 ns
+长陵 39 ns
+长随 51 ns
+长隧 3 n
+长青 49 nr
+长青子 3 nr
+长青树 2 nr
+长青藤 3 nr
+长青路 3 ns
+长靠椅 3 n
+长靴 3 nz
+长鞭 75 n
+长音 3 n
+长音程 3 n
+长音阶 3 n
+长顶盖 3 ns
+长项 11 n
+长顺 69 ns
+长顺县 3 ns
+长须鲸 5 nr
+长颈 3 n
+长颈鹿 75 n
+长颈龟 3 n
+长风 58 n
+长风破浪 3 i
+长驱 93 n
+长驱深入 3 l
+长驱直入 69 i
+长驱直进 2 i
+长驱而入 3 i
+长驾远驭 3 i
+长骨 24 n
+长鸣 90 nrt
+长鸣都尉 3 n
+长黑 3 ns
+长鼓 10 n
+长鼓舞 14 i
+长鼻 3 ns
+长鼻目 13 n
+长龙 66 ns
+門 43 zg
+閆 7 zg
+閉 2 zg
+開 12 zg
+閏 9 zg
+閑 133 zg
+間 11 zg
+閘 2 zg
+閚 4 zg
+閜 2 zg
+閟 5 zg
+閣 8 zg
+閤 13 zg
+閥 2 zg
+閦 2 zg
+閫 542 zg
+閬 747 zg
+閭 792 zg
+閮 877 zg
+閯 8 zg
+閰 138 zg
+閰王 3 v
+閱 62 zg
+閲 1174 zg
+閴 7 zg
+閺 3 zg
+閽 98 zg
+閾 68 zg
+閿 157 zg
+闀 749 zg
+闂 965 zg
+闃 1046 zg
+闄 964 zg
+闅 267 zg
+闆 299 zg
+闇 134 zg
+闇伦 3 z
+闇冥 3 v
+闇劣 3 v
+闇弱 3 z
+闈 783 zg
+闉 29 zg
+闊 378 zg
+關 3 zg
+闟 256 zg
+闠 157 zg
+门 39823 n
+门丁 10 nr
+门上 527 s
+门下 1179 s
+门下省 51 n
+门不停宾 3 i
+门不夜关 3 i
+门世族 3 nz
+门中跃 2 nr
+门丹墀 3 nr
+门之东 2 nr
+门之义 2 nr
+门之宝 18 nr
+门之谊 12 nr
+门云铮 3 nr
+门人 951 n
+门修练 2 nr
+门儿 19 n
+门儿清 3 nr
+门兴格 7 nr
+门兵刃 2 n
+门内 575 s
+门到户说 3 i
+门券 3 n
+门前 2960 s
+门前三包 3 i
+门前门后 3 s
+门剑 2 n
+门剑招 2 nr
+门剑法 17 nr
+门匾 3 n
+门单户薄 3 i
+门单枝 3 nr
+门卫 191 n
+门卫室 8 n
+门卫种植 3 l
+门厅 71 n
+门口 3713 s
+门可张罗 3 nr
+门可罗雀 22 i
+门叶 3 n
+门号 2 n
+门吊 3 n
+门吏 3 n
+门吏转 2 nr
+门吏阻 2 nr
+门吸 9 v
+门坎 62 n
+门垛 3 n
+门堪罗雀 3 i
+门墙 194 n
+门墙桃李 3 i
+门墩 8 n
+门墩儿 3 nr
+门士族 9 nz
+门外 3759 s
+门外汉 22 n
+门多萨 13 nr
+门夫 2 n
+门头 3 s
+门头沟 14 n
+门头沟区 9 ns
+门子 136 n
+门官果 2 nr
+门客 78 n
+门宣赞 6 nr
+门封 10 n
+门将 311 n
+门尚铭 2 nr
+门尼德 12 nr
+门岗 5 nr
+门巴 74 n
+门巴族 45 nz
+门市 55 n
+门市价 3 n
+门市房 3 n
+门市部 49 n
+门师伯 5 nr
+门师叔 17 nr
+门师尊 2 nr
+门希尔 5 nr
+门帘 167 n
+门底 3 s
+门底下 3 s
+门店 132 n
+门庭 36 n
+门庭冷落 11 i
+门庭如市 3 i
+门庭若市 22 i
+门庭赫奕 3 i
+门廊 34 n
+门式 8 n
+门式刚 3 nr
+门弓 3 n
+门弟 3 n
+门当户对 62 i
+门径 85 n
+门徒 119 n
+门德尔 2 nr
+门德尔松 12 nrt
+门德斯 3 nr
+门急诊 3 j
+门恭迎 2 nr
+门户 2202 n
+门户之争 19 i
+门户之见 40 i
+门户之间 3 i
+门户开放 3 i
+门户站 3 n
+门户网 3 n
+门户网站 5 n
+门房 97 n
+门扇 66 n
+门扉 389 n
+门托河 2 nr
+门把手 3 n
+门拉手 3 n
+门拱 3 n
+门捷列夫 52 nrt
+门掌力 2 n
+门控 4 j
+门控通道 3 n
+门插关儿 3 n
+门插销 3 n
+门文峰 14 nr
+门斗 5 n
+门斯基 3 nr
+门方术 2 n
+门旁 42 s
+门旗影 14 nr
+门无杂客 3 i
+门无杂宾 3 i
+门机 3 n
+门李云风 4 nr
+门板 228 n
+门极 2 n
+门枕 3 n
+门枕石 3 nr
+门枢 3 n
+门架 5 n
+门架式 2 n
+门柄 3 n
+门柱 81 n
+门栓 3 n
+门格尔 4 nr
+门格拉 2 nr
+门格斯 3 nr
+门框 121 n
+门桥 3 n
+门梁 4 n
+门梁芳 3 nr
+门楣 62 n
+门楼 606 n
+门槛 740 n
+门槛儿 10 n
+门武学 3 n
+门殚户尽 3 nr
+门法 3 n
+门洞 1080 n
+门派 249 n
+门海 3 s
+门源 9 n
+门源回族自治县 6 ns
+门溪龙 5 nr
+门演礼 6 nr
+门灯 3 n
+门点 7 n
+门烟 3 n
+门牌 155 n
+门牌号 10 n
+门牌号码 3 n
+门牙 77 n
+门环 42 n
+门球 20 n
+门生 226 n
+门生故吏 10 i
+门生故旧 15 i
+门甲 3 n
+门电路 3 n
+门神 124 n
+门票 653 n
+门票价格 3 n
+门票费 8 n
+门禁 13 v
+门禁卡 3 n
+门禁机 3 n
+门禁森严 2 i
+门禁系统 2 n
+门禅师 2 nr
+门科 2 n
+门窗 542 n
+门窗厂 3 nr
+门童 26 n
+门第 112 nr
+门类 683 n
+门缝 192 n
+门罗 36 nrt
+门罗主义 3 n
+门耶跋 3 nr
+门联 133 n
+门脸 10 n
+门脸儿 17 nr
+门苔纲 2 nr
+门荫结 3 nr
+门萨 2 n
+门蒂耶 18 nr
+门衰祚薄 3 v
+门襄仲 2 nr
+门规 3 n
+门訇然 2 nr
+门警 3 n
+门诊 417 n
+门诊室 4 n
+门诊患者 3 n
+门诊所 3 n
+门诊病人 3 n
+门诊费 5 n
+门诊部 99 n
+门诊量 14 n
+门诺派 2 nr
+门路 216 n
+门轩权 2 nr
+门辛双 2 nr
+门边 251 s
+门迎凉 2 nr
+门进东 2 nr
+门进宫 2 nr
+门迭塔 3 nr
+门迳 3 v
+门道 199 n
+门道若市 3 i
+门采尔 3 nr
+门里 3 s
+门里出身 3 i
+门里门外 3 i
+门重恩 3 nr
+门钉 3 n
+门钮 3 n
+门钹 3 n
+门铁克 37 nr
+门铃 75 n
+门铃系统 3 n
+门锁 60 n
+门镜 3 n
+门门 3 n
+门闩 188 n
+门闾之望 3 i
+门阀 242 n
+门阵列 3 nr
+门阵列法 3 n
+门阶 3 n
+门阶户席 3 n
+门限 10 n
+门隙 3 n
+门青跃 2 nr
+门静脉 32 nr
+门面 147 n
+门面当面 3 i
+门面房 26 n
+门面活 3 n
+门面话 9 n
+门额 3 n
+门风 23 n
+门馆 3 n
+门首 102 n
+门高弟 2 nr
+门鼻儿 3 n
+门齿 69 n
+闩 160 v
+闩上去 3 z
+闩上来 3 vn
+闩锁效应 3 v
+闩门闭户 3 v
+闪 2906 v
+闪了一下 3 i
+闪亮 206 z
+闪人 3 n
+闪信息 3 n
+闪光 247 n
+闪光光解 3 i
+闪光器 3 n
+闪光弹 2 n
+闪光灯 50 n
+闪光点 31 n
+闪光盲 3 n
+闪入 3 v
+闪出 3 v
+闪击 12 v
+闪击战 16 n
+闪动 492 v
+闪卡 3 n
+闪去 3 v
+闪失 110 v
+闪存 155 v
+闪存卡 3 n
+闪存式 3 n
+闪存盘 9 n
+闪客 3 n
+闪客帝国 3 n
+闪射 16 v
+闪开 195 v
+闪念 17 n
+闪掉 3 v
+闪族 3 n
+闪来 3 v
+闪来闪去 3 z
+闪灼 11 z
+闪点 4 n
+闪烁 759 v
+闪烁不定 3 i
+闪烁其词 14 i
+闪烁其辞 9 i
+闪烁器 3 i
+闪烁生辉 2 i
+闪烁着 3 i
+闪爆 2 v
+闪现 173 v
+闪电 771 v
+闪电侠 3 n
+闪电式 12 n
+闪电战 37 nz
+闪电战术 3 n
+闪电河 2 nz
+闪电结婚 3 v
+闪电般 3 n
+闪盘 2 v
+闪着光 3 z
+闪石 45 n
+闪络 11 n
+闪耀 192 v
+闪耀着 3 i
+闪耀角 3 i
+闪腰 3 v
+闪蒸 3 nz
+闪语 3 nz
+闪身 298 v
+闪躲 42 v
+闪躲不及 3 v
+闪过 366 v
+闪速炉 5 n
+闪避 704 v
+闪避不及 3 i
+闪铄 3 i
+闪锌矿 17 n
+闪长岩 20 n
+闪闪 445 z
+闪闪发亮 3 n
+闪闪发光 3 n
+闪闪地 12 z
+闪闪烁烁 29 z
+闪驱 3 n
+闫 97 nr
+闫京生 111 nr
+闫利军 7 nr
+闫副参 3 nr
+闫戌麟 2 nz
+闫新平 5 nr
+闫盛霆 2 nr
+闫相闯 47 nr
+闫秀珍 11 nr
+闫章更 2 nr
+闫震中 11 nr
+闬 19 zg
+闭 2544 v
+闭一只眼 3 i
+闭上嘴 3 l
+闭上眼 3 l
+闭上眼睛 3 i
+闭会 4143 v
+闭住 3 v
+闭元音 3 n
+闭公式 3 n
+闭关 185 v
+闭关却扫 3 i
+闭关政策 3 l
+闭关绝市 3 l
+闭关自主 3 i
+闭关自守 105 i
+闭关自首 3 i
+闭关锁国 30 l
+闭包运算 3 l
+闭卷 22 v
+闭卷考试 3 i
+闭口 100 n
+闭口不答 3 l
+闭口不言 3 i
+闭口不谈 14 i
+闭口印模 3 l
+闭口捕舌 3 l
+闭口无言 4 i
+闭口结舌 3 i
+闭口藏舌 3 i
+闭只眼 3 i
+闭合 207 v
+闭合式 3 l
+闭合思过 3 l
+闭合性 6 b
+闭合方位 3 l
+闭合电路 3 l
+闭合盆地 3 l
+闭合自责 3 l
+闭合面 3 l
+闭嘴 3 v
+闭囊壳 2 i
+闭塞 218 v
+闭塞分区 3 n
+闭塞性 3 n
+闭境自守 3 i
+闭壁清野 3 i
+闭壳肌 13 l
+闭壳龟 6 n
+闭市 9 v
+闭幕 281 v
+闭幕会 20 n
+闭幕典礼 3 n
+闭幕式 41 n
+闭幕词 5 n
+闭庭 3 n
+闭式 9 n
+闭户读书 3 n
+闭明塞聪 3 v
+闭月羞花 9 i
+闭架 3 v
+闭架式 3 l
+闭架管理 3 l
+闭气 67 v
+闭环 38 vn
+闭环控制 3 n
+闭目 263 n
+闭目养神 89 i
+闭目塞听 8 i
+闭目塞耳 3 i
+闭目塞聪 3 i
+闭眼 153 v
+闭管 3 v
+闭经 88 v
+闭花羞月 3 i
+闭起 3 v
+闭路 13 n
+闭路电势 3 l
+闭路电视 26 l
+闭锁 164 v
+闭门 170 v
+闭门不出 3 i
+闭门不纳 3 v
+闭门却扫 3 i
+闭门却轨 3 i
+闭门合辙 3 i
+闭门器 3 l
+闭门埽轨 3 vn
+闭门塞户 3 i
+闭门塞窦 3 n
+闭门墐户 3 vn
+闭门思愆 3 n
+闭门思过 13 l
+闭门扫轨 3 i
+闭门扫迹 3 i
+闭门投辖 3 n
+闭门羹 27 i
+闭门自守 3 i
+闭门觅句 3 i
+闭门读书 3 n
+闭门谢客 23 i
+闭门造车 14 l
+闭门酣歌 3 i
+闭阁思过 3 i
+闭阁自责 3 i
+闭音节 4 n
+闭馆 7 n
+问 34296 n
+问一答十 4 i
+问一问 3 l
+问上问下 3 l
+问下 3 n
+问不倒 3 v
+问与答 3 nr
+问世 759 n
+问东问西 3 n
+问个问题 3 n
+问中知马 3 i
+问事处 3 n
+问人 3 n
+问住 3 v
+问供 3 v
+问侯 2 n
+问俗 3 n
+问候 489 n
+问候信 4 n
+问候声 2 n
+问候语 10 n
+问出 3 v
+问到 3 v
+问十道百 3 l
+问华 2 n
+问卜 14 n
+问卷 166 n
+问卷调查 65 l
+问及 219 v
+问及此事 3 i
+问叔惠 2 nr
+问句 13 n
+问号 133 n
+问名 5 n
+问君 4 n
+问天买卦 3 n
+问好 113 v
+问安 98 n
+问安者 3 n
+问安视寝 3 n
+问安视膳 3 n
+问官答花 3 i
+问宝玉 8 nr
+问寒问暖 28 i
+问市 3 n
+问心 18 n
+问心无愧 73 i
+问心有愧 8 i
+问情篇 3 n
+问政 8 n
+问政于民 3 n
+问斩 21 v
+问明 160 n
+问曼桢 2 nr
+问曼璐 2 nr
+问朝 3 n
+问来 3 v
+问来问去 3 l
+问柳寻花 3 i
+问柳评花 3 n
+问案 3 n
+问津 53 nr
+问清 48 n
+问点 3 n
+问牛知马 3 i
+问程 2 n
+问答 167 v
+问答式 3 n
+问答法 3 n
+问答集 3 n
+问答题 8 n
+问罪 77 n
+问罪之师 6 n
+问羊知马 3 n
+问者 5 n
+问舍求田 3 n
+问苍天 3 n
+问荆 5 n
+问药网 3 n
+问计 46 v
+问讯 82 n
+问讯处 3 n
+问诊 35 v
+问话 359 n
+问询 41 v
+问询处 3 n
+问诸水滨 3 nr
+问责制 3 n
+问起 587 v
+问路 56 n
+问辛楣 2 nr
+问这问那 3 l
+问道 7484 n
+问道于盲 3 n
+问长道短 3 n
+问长问短 52 i
+问问 561 n
+问问看 3 l
+问难 3 n
+问青天 3 n
+问题 55563 n
+问题女孩 3 n
+问题归约 3 n
+问题所在 3 i
+问题男孩 3 n
+问题表征 3 n
+问题解答 3 l
+问题重构 3 n
+问题重重 3 i
+问鼎 42 n
+问鼎中原 3 n
+闯 2921 v
+闯上 3 nrt
+闯上去 3 v
+闯上来 3 nrt
+闯下 3 nrt
+闯下大祸 3 l
+闯世界 3 n
+闯事 3 v
+闯入 279 v
+闯关 42 v
+闯关东 9 n
+闯关夺隘 2 n
+闯出 3 v
+闯出去 3 v
+闯出来 3 v
+闯劲 14 v
+闯劲儿 3 n
+闯南走北 3 l
+闯将 44 n
+闯开 3 v
+闯情关 3 l
+闯来 3 nrt
+闯来闯去 3 z
+闯江湖 24 nrt
+闯王 5004 nrt
+闯祸 94 v
+闯红灯 4 n
+闯荡 96 v
+闯荡江湖 40 l
+闯贼 3 n
+闯过去 3 l
+闯过来 3 l
+闯进 340 v
+闯进去 3 v
+闯进来 3 l
+闯进闯出 3 vn
+闰 159 nr
+闰位 3 n
+闰年 41 t
+闰日 11 t
+闰月 37 t
+闰秒 3 n
+闰阁 3 n
+闰音 3 n
+闱 64 g
+闲 1616 n
+闲下来 3 l
+闲不住 27 v
+闲书 36 n
+闲事 113 n
+闲云 2 n
+闲云孤鹤 3 i
+闲云野鹤 22 i
+闲人 188 n
+闲人免进 3 l
+闲儿 3 n
+闲冗 3 a
+闲员 3 n
+闲地 3 n
+闲坐 43 v
+闲官 3 n
+闲居 91 v
+闲居家中 3 l
+闲工 3 n
+闲工夫 24 n
+闲常 3 a
+闲庭 8 n
+闲庭信步 13 i
+闲弃 3 v
+闲得无聊 3 i
+闲心 74 n
+闲情 3 n
+闲情别致 3 i
+闲情逸志 3 i
+闲情逸致 31 i
+闲情逸趣 3 i
+闲愁 3 v
+闲愁万种 3 i
+闲房 6 n
+闲扯 26 v
+闲放 3 v
+闲散 86 v
+闲散地 3 n
+闲日 3 t
+闲时 142 t
+闲是闲非 3 l
+闲暇 912 n
+闲暇地理 3 i
+闲曹冷局 3 l
+闲杂 65 a
+闲杂人员 10 n
+闲杂人等 3 l
+闲来 3 v
+闲来无事 44 i
+闲步 3 n
+闲民 3 n
+闲气 25 n
+闲汉 3 t
+闲混 3 v
+闲渡 3 v
+闲游 3 n
+闲着 275 v
+闲着没事 3 l
+闲磕牙 3 l
+闲神野鬼 3 i
+闲空 3 n
+闲章 7 n
+闲笔 3 n
+闲篇 3 b
+闲经 3 n
+闲置 239 n
+闲置不用 3 l
+闲置地 3 n
+闲置费 3 n
+闲聊 126 v
+闲职 22 v
+闲花埜草 3 n
+闲花野草 3 n
+闲荡 6 v
+闲见层出 3 l
+闲言泼语 3 i
+闲言淡语 3 i
+闲言碎语 16 i
+闲言长语 3 i
+闲言闲语 11 i
+闲话 470 n
+闲话家常 3 i
+闲话少说 3 l
+闲谈 215 v
+闲趣 3 n
+闲过 3 v
+闲适 111 a
+闲逛 105 v
+闲逸 28 v
+闲邪存诚 3 i
+闲钱 36 n
+闲隙 3 n
+闲雅 28 a
+闲静 3 a
+闲非闲是 3 l
+闲饭 3 v
+闲鸥野鹭 3 nz
+闳 190 g
+闳中肆外 3 nr
+闳侈不经 3 z
+闳大不经 3 nr
+闳宇崇楼 3 nr
+闳意妙指 3 nr
+闳意眇指 3 vn
+闳言崇议 3 nr
+闳言高论 3 nr
+闳识孤怀 3 nr
+间 23632 f
+间不容发 57 l
+间不容息 3 l
+间不容瞚 3 v
+间不容瞬 3 d
+间不容砺 3 v
+间不容缓 3 d
+间不容缕 3 l
+间二甲苯 3 nz
+间伐 7 n
+间位 3 n
+间体 3 n
+间作 64 n
+间冰期 60 n
+间协议 2 n
+间型霉素 3 n
+间壁 3 n
+间奏 2 n
+间奏曲 10 n
+间套 4 b
+间孙 3 n
+间层 3 b
+间或 159 d
+间接 1141 b
+间接人工 3 n
+间接原因 3 n
+间接口 3 n
+间接地 3 n
+间接性 12 b
+间接成本 3 l
+间接推理 3 n
+间接材料 3 n
+间接测量 3 n
+间接照明 3 l
+间接理解 3 l
+间接税 10 n
+间接经验 6 n
+间接调控 3 n
+间接选举 790 l
+间接采暖 3 n
+间数 3 n
+间断 345 d
+间断分布 3 n
+间断性 12 b
+间期 33 b
+间杂 22 b
+间杂着 3 l
+间架 15 n
+间歇 181 n
+间歇喷泉 3 n
+间歇式 11 b
+间歇性 77 b
+间歇抽油 3 z
+间歇期 3 b
+间歇气举 3 n
+间歇河 3 n
+间歇泉 32 n
+间歇注水 3 n
+间歇热 3 n
+间歇自喷 3 b
+间歇辐照 3 n
+间皮瘤 14 l
+间皮细胞 3 n
+间种 8 b
+间脑 32 n
+间色 4 b
+间苗 10 n
+间苯二甲酸 3 nz
+间苯二胺 2 nz
+间苯二酚 10 nz
+间见层出 3 l
+间谍 544 n
+间谍卫星 3 nz
+间谍案 14 n
+间谍活动 3 n
+间谍片 3 n
+间谍网 5 n
+间谍罪 3 nz
+间质 3 b
+间质性 3 n
+间距 184 n
+间运 3 n
+间连接 2 n
+间通信 5 n
+间量 3 n
+间隔 488 n
+间隔号 2 n
+间隔基盘 3 n
+间隔性 3 n
+间隔成 3 l
+间隔时间 2 l
+间隔期 12 n
+间隙 319 n
+间隙体积 3 vn
+间隙卡环 3 nz
+间隙扩散 3 n
+间隙连接 3 nr
+闵 212 nr
+闵乱思治 3 nz
+闵二叔 2 nr
+闵二哥 8 nr
+闵二爷 16 nr
+闵可夫 3 nr
+闵四官 3 nr
+闵园竹 2 nr
+闵大洪 6 nr
+闵子华 154 nr
+闵子叶 22 nr
+闵师弟 3 nr
+闵庄路 3 nr
+闵惠芬 2 nr
+闵慧芬 2 nr
+闵政浩 3 nr
+闵斯特 2 nr
+闵方武 4 nr
+闵方诸 2 nr
+闵柔剑 4 nr
+闵柔听 2 nr
+闵柔微微 4 nr
+闵柔本 3 nr
+闵柔笑 3 nr
+闵柔见 4 nr
+闵椒沟 2 nr
+闵河 7 ns
+闵生赋 2 nr
+闵科夫 16 nr
+闵红波 2 nr
+闵耀良 2 nr
+闵行区 15 ns
+闵行校 14 nr
+闵行镇 2 nr
+闵采尔 8 nr
+闵鹿蕾 7 nr
+闶 78 x
+闷 1222 v
+闷住 3 v
+闷倦 3 a
+闷响 47 n
+闷在心里 3 i
+闷声 23 n
+闷声不响 30 l
+闷声闷气 6 i
+闷头 45 n
+闷头儿 3 l
+闷头闷脑 3 i
+闷子车 2 n
+闷得 3 v
+闷得慌 3 a
+闷怒 3 a
+闷棍 58 n
+闷死 3 v
+闷气 116 n
+闷海愁山 3 i
+闷火 3 n
+闷烧 3 v
+闷热 138 a
+闷着头 3 l
+闷罐 5 n
+闷罐车 6 n
+闷脑 3 n
+闷葫芦 19 l
+闷酒 27 n
+闷闷 3 a
+闷闷不乐 92 i
+闷闷地 28 z
+闷雷 51 n
+闷顶 3 n
+闷骚 3 n
+闸 1167 n
+闸刀 3 n
+闸刀开关 3 ns
+闸北 39 ns
+闸北区 9 ns
+闸北网 3 n
+闸口 28 n
+闸口镇 15 ns
+闸坝 9 ns
+闸子 3 n
+闸把 3 n
+闸板 3 n
+闸极 3 ns
+闸流管 7 n
+闸瓦 3 ns
+闸皮 3 n
+闸盒 3 n
+闸线 3 n
+闸轮 3 n
+闸门 213 n
+闸阀 6 n
+闹 4458 v
+闹中取静 3 l
+闹乱子 2 l
+闹了归齐 3 l
+闹事 491 v
+闹事区 3 n
+闹事者 12 n
+闹僵 8 v
+闹元宵 3 n
+闹出 3 v
+闹出去 3 v
+闹出来 3 l
+闹出笑话 3 l
+闹别扭 60 z
+闹剧 124 n
+闹区 3 n
+闹哄 3 z
+闹哄哄 66 z
+闹喧 3 v
+闹嚷 3 v
+闹嚷嚷 21 z
+闹场 3 n
+闹声 3 n
+闹市 121 v
+闹市区 180 n
+闹市口 4 n
+闹心 19 v
+闹情绪 11 n
+闹情绪者 3 n
+闹意气 3 l
+闹意见 5 l
+闹戏 3 n
+闹房 3 n
+闹新房 7 n
+闹来闹去 3 z
+闹架 3 n
+闹气 3 n
+闹水灾 2 n
+闹洞房 13 n
+闹海 3 ns
+闹灾 3 n
+闹灾荒 5 l
+闹热 14 z
+闹热滚滚 3 z
+闹独立性 3 n
+闹猛 3 a
+闹病 7 n
+闹着玩 136 v
+闹着玩儿 23 v
+闹矛盾 3 l
+闹穷 3 z
+闹笑话 10 l
+闹羊花 3 n
+闹翻 89 v
+闹翻天 4 l
+闹肚子 12 l
+闹脾气 3 v
+闹腾 167 v
+闹荒 3 v
+闹贼 3 n
+闹起 3 v
+闹起来 3 l
+闹钟 61 n
+闹铃 2 n
+闹闹哄哄 6 z
+闹闹攘攘 3 z
+闹闹轰轰 3 z
+闹革命 60 nz
+闹饥荒 12 v
+闹鬼 60 n
+闺 197 n
+闺中 3 n
+闺女 480 n
+闺怨 3 n
+闺房 76 n
+闺秀 23 n
+闺艳 3 n
+闺英闱秀 3 z
+闺范 8 n
+闺门 3 n
+闺阁 84 n
+闻 4745 v
+闻一多 566 l
+闻一知二 3 i
+闻一知十 3 i
+闻一闻 20 nr
+闻万夫 28 nr
+闻世震 256 nr
+闻东虏 2 nr
+闻丞相 2 nr
+闻乌孙 2 nr
+闻云长 2 nr
+闻人 27 nr
+闻令兄 2 nr
+闻佳平 2 nr
+闻使君 3 nr
+闻先生 3 nr
+闻关云 2 nr
+闻兵刃 3 nr
+闻兵法 2 nr
+闻其名 4 i
+闻其声 4 nr
+闻其臭 2 nr
+闻其详 27 i
+闻其语 2 nr
+闻其贤 2 nr
+闻其音 2 nr
+闻其香 3 nr
+闻出 3 v
+闻刘备 3 nr
+闻刘景 3 nr
+闻刘玄 4 nr
+闻刘豫 2 nr
+闻到 513 v
+闻千树 2 nr
+闻华山 2 nr
+闻名 1310 v
+闻名不如见面 2 i
+闻名世界 3 nr
+闻名丧胆 14 i
+闻名中外 308 l
+闻名于世 153 l
+闻名全国 3 nr
+闻名全球 3 nr
+闻名四方 3 nr
+闻名天下 3 i
+闻名遐尔 2 nr
+闻名遐迩 48 l
+闻君侯 2 nr
+闻听 46 nr
+闻吾之 2 nr
+闻周文 2 nr
+闻喜 30 nr
+闻喜县 5 nr
+闻噎废食 3 i
+闻声 44 nr
+闻声奔 6 nr
+闻声相思 3 l
+闻声起 2 l
+闻声转 2 i
+闻声齐 2 nr
+闻大军 2 nr
+闻大圣 3 nr
+闻天子 6 nr
+闻天鹤 30 nr
+闻太师 3 nr
+闻如是 3 l
+闻姚苌 2 nr
+闻姜维 2 nr
+闻孔明 4 nr
+闻孙权 3 nr
+闻孙策 3 nr
+闻宋江 5 nr
+闻宠若惊 3 i
+闻家堰 4 nr
+闻将军 3 nr
+闻少林 3 nr
+闻尤氏 2 nr
+闻屋瓦 2 nr
+闻师门 2 nr
+闻弦歌 3 nr
+闻彩兵 7 nr
+闻得今 2 nr
+闻得孙 3 nr
+闻得宝玉 2 nr
+闻得燕 2 nr
+闻得王 2 nr
+闻得贤 2 nr
+闻得香 3 nr
+闻悉 3 v
+闻慕容 3 nr
+闻所不闻 3 i
+闻所未闻 106 i
+闻报 3 v
+闻明公 2 nr
+闻明教 6 nr
+闻有何 3 l
+闻朝廷 3 nr
+闻机起舞 3 l
+闻李道 2 nr
+闻李闯 2 nr
+闻来闻去 3 i
+闻武王 4 nr
+闻永历 2 nr
+闻汉中 2 nr
+闻江湖 2 nr
+闻泉声 2 nr
+闻潮声 2 nr
+闻焕章 11 nr
+闻燕昭 3 nr
+闻玄德 7 nr
+闻玉帝 4 nr
+闻皇叔 6 nr
+闻知 12 v
+闻知王爷 2 nr
+闻神卜 2 nr
+闻窝阔 3 nr
+闻立鹏 7 nr
+闻者足戒 3 i
+闻良禽 2 nr
+闻苍松 3 nr
+闻萧半 2 nr
+闻虎山 3 nr
+闻蜀兵 2 nr
+闻融敦厚 3 nr
+闻见 53 v
+闻见香 3 nr
+闻言 72 nr
+闻言心 2 l
+闻言笑 6 l
+闻言色 3 i
+闻讯 371 nz
+闻讯而动 3 i
+闻讯而来 6 l
+闻讯赶来 3 i
+闻谢烟 3 nr
+闻贵爵 2 nr
+闻赤练 4 nr
+闻起 3 v
+闻起来 3 l
+闻达 33 nr
+闻过则喜 3 l
+闻过则改 3 l
+闻遐迩 2 l
+闻道夕 3 nr
+闻道龙 2 nr
+闻邓艾 3 nr
+闻邦国 2 nr
+闻郭靖 2 nr
+闻问 3 v
+闻闻 10 nr
+闻闻看 3 i
+闻陵川 2 nr
+闻雷失箸 3 nr
+闻韩信 2 nr
+闻风 21 nr
+闻风丧胆 33 i
+闻风响应 3 n
+闻风破胆 3 i
+闻风而兴 3 l
+闻风而动 24 l
+闻风而来 3 l
+闻风而至 3 i
+闻风而起 3 i
+闻风而逃 10 i
+闻风节 2 nr
+闻风远扬 3 i
+闻风远遁 3 nr
+闻风逃窜 3 i
+闻香玉 17 nr
+闻香识 3 nr
+闻马超 2 nr
+闻魏文 2 nr
+闻鲁肃 2 nr
+闻鸟语 4 nr
+闻鸡起舞 19 i
+闻鹤村 7 nr
+闼 59 g
+闽 848 j
+闽东 16 ns
+闽东南 27 ns
+闽东地区 2 ns
+闽东特委 2 nt
+闽侯 26 ns
+闽侯县 16 ns
+闽候 3 n
+闽剧 7 n
+闽北 21 ns
+闽北人 3 nrt
+闽北地区 3 ns
+闽北话 3 j
+闽南 55 ns
+闽南人 3 nz
+闽南地区 3 ns
+闽南歌 3 nz
+闽南话 10 n
+闽南语 4 nz
+闽发证券 3 nt
+闽台 3 ns
+闽台地区 3 ns
+闽商 3 n
+闽宁 2 ns
+闽方言 3 n
+闽江 124 ns
+闽江大学 3 nt
+闽江流域 3 ns
+闽江路 3 ns
+闽浙 63 j
+闽清 3 ns
+闽清县 3 ns
+闽省 3 ns
+闽福鼎 3 ns
+闽籍 4 n
+闽籍人士 3 nz
+闽粤 3 ns
+闽粤人士 3 nz
+闽粤地区 3 j
+闽粤赣 3 j
+闽菜 3 n
+闽西 212 ns
+闽西北 4 ns
+闽西南 7 ns
+闽语 3 nz
+闽越 31 ns
+闾 153 nr
+闾为帝 2 nr
+闾伐楚 2 nr
+闾伐越 3 nr
+闾巷 10 nr
+闾弟夫 3 nr
+闾汉彪 3 nr
+闾破楚 3 nr
+闾而立 2 nr
+闾里 7 nr
+闾阎 4 nr
+闾阎安堵 3 nr
+闾阎扑地 3 nr
+闾领兵 2 nr
+闿 93 zg
+阀 192 n
+阀体 5 n
+阀值 3 n
+阀座 3 n
+阀门 67 n
+阀门厂 3 n
+阀门网 3 n
+阀阅 3 n
+阁 2395 ng
+阁下 761 n
+阁主 2 n
+阁僚 7 n
+阁员 50 n
+阁外 3 n
+阁子 3 n
+阁楼 268 n
+阁瑞斯 3 n
+阁老 3 n
+阁议 3 n
+阂 33 vg
+阃 30 g
+阄 48 ng
+阄割 3 v
+阅 715 v
+阅世 3 v
+阅书架 3 n
+阅兵 197 v
+阅兵典礼 3 n
+阅兵台 3 n
+阅兵场 2 n
+阅兵式 178 n
+阅办 3 v
+阅卷 269 v
+阅卷组 3 n
+阅历 287 v
+阅完 3 v
+阅批 3 v
+阅报 3 v
+阅报室 3 n
+阅报栏 11 n
+阅月 3 v
+阅看 3 v
+阅知 3 v
+阅览 66 v
+阅览器 2 n
+阅览室 110 n
+阅览数 3 n
+阅览者 3 n
+阅读 4979 v
+阅读写作 3 n
+阅读准备 3 n
+阅读器 19 n
+阅读室 3 n
+阅读教学 3 n
+阅读数 3 n
+阅读文章 3 n
+阅读机 3 n
+阅读程序 3 n
+阅读站 3 n
+阅读网 3 n
+阅读者 23 n
+阅读课 3 n
+阅读课文 3 n
+阅读赏析 3 n
+阅读辅导 3 n
+阅读障碍 3 n
+阆 66 ns
+阆中 33 ns
+阆中县 3 ns
+阆中市 4 ns
+阆苑 5 ns
+阆苑琼楼 3 ns
+阇 98 n
+阈 96 n
+阈值 14 n
+阈值条件 3 n
+阈值电压 3 n
+阈值电流 3 n
+阈限 56 n
+阈限人口 3 n
+阉 230 n
+阉人 16 n
+阉党 257 n
+阉割 99 v
+阉割情结 3 n
+阉割者 3 n
+阉奴 3 n
+阉宦 3 n
+阉寺 3 n
+阉掉 3 v
+阉牛 3 n
+阉猪 3 n
+阉过 3 v
+阉鸡 4 n
+阊 188 x
+阋 64 g
+阋墙 34 v
+阋墙御侮 3 n
+阋墙谇帚 3 n
+阌 70 g
+阍 46 ng
+阎 310 nr
+阎世章 55 nr
+阎世翔 3 nr
+阎世铎 7 nr
+阎世魁 3 nrfg
+阎书勤 3 nr
+阎五爷 5 nr
+阎君 13 nr
+阎君之 2 nr
+阎圃谏 2 nr
+阎基去 2 nr
+阎基吓 2 nr
+阎基笑 3 nr
+阎基陪 2 nr
+阎士贵 3 nr
+阎大夫 8 nr
+阎婆告 2 nr
+阎婆惜 21 nr
+阎婆结 2 nr
+阎孝忠 2 nr
+阎家寨 2 nr
+阎家岗 3 nr
+阎家庄 3 nr
+阎家班 3 nr
+阎寨主 4 nr
+阎尔梅 8 nr
+阎岚秋 2 nr
+阎崇年 2 nr
+阎应元 2 nr
+阎志强 2 nr
+阎志才 8 nr
+阎慧光 2 nr
+阎振利 2 nr
+阎敬铭 58 nr
+阎文清 11 nr
+阎春梅 8 nr
+阎晓宏 6 nr
+阎晓明 7 nr
+阎李寨 49 nr
+阎步克 3 nr
+阎洪臣 3 nr
+阎浮提 2 nr
+阎炳武 2 nr
+阎玉龙 2 nr
+阎王 219 nr
+阎王帐 3 n
+阎王殿 10 nr
+阎王爷 41 nr
+阎王账 3 n
+阎生华 6 nr
+阎相闯 20 nr
+阎立德 3 nr
+阎立本 30 nr
+阎维文 2 nr
+阎罗 85 nr
+阎罗殿 3 nr
+阎罗王 42 nr
+阎良 3 nr
+阎良区 3 nr
+阎若璩 12 nr
+阎连科 3 nr
+阎银玲 8 nr
+阎锡山 82 nr
+阎鸣泰 2 nr
+阎鸿唤 486 nr
+阏 41 x
+阏氏 23 n
+阐 116 v
+阐发 110 v
+阐幽抉微 3 z
+阐幽明微 3 z
+阐扬 11 v
+阐扬光大 3 v
+阐明 1321 v
+阐述 1330 v
+阐释 233 v
+阐释学 3 vn
+阑 131 ng
+阑入 3 v
+阑尾 35 n
+阑尾炎 42 n
+阑干 3 n
+阑槛 3 n
+阑珊 16 v
+阑珊处 7 n
+阑风伏雨 3 n
+阑风长雨 3 n
+阒 63 g
+阒其无人 3 i
+阒寂 3 i
+阒寂无声 3 i
+阒无一人 8 i
+阒无人声 3 i
+阒然 3 i
+阒然无声 3 i
+阓 2 zg
+阔 1959 a
+阔人 12 n
+阔人家 3 n
+阔佬 14 n
+阔别 63 n
+阔别多年 3 n
+阔叶 148 n
+阔叶林 402 n
+阔叶树 589 n
+阔叶植物 3 n
+阔大 50 a
+阔少 6 d
+阔少爷 3 n
+阔度 3 n
+阔手 3 n
+阔步 40 n
+阔步前进 3 n
+阔步向前 3 n
+阔步高谈 3 n
+阔气 34 n
+阔绰 63 a
+阔老 3 n
+阔落 3 n
+阔论 3 n
+阔论高谈 3 n
+阔边帽 3 n
+阔达 2 a
+阔野 3 n
+阔阔的 2 n
+阕 84 q
+阖 315 n
+阖上 3 n
+阖家 4 n
+阖家团圆 2 i
+阖家幸福 3 i
+阖家欢 3 l
+阖家欢乐 3 i
+阖府 3 n
+阖户 3 n
+阖扇 3 n
+阖眼 2 n
+阖第 3 n
+阖第光临 3 l
+阖门百口 3 l
+阗 68 zg
+阘 8 zg
+阙 1619 nr
+阙一不可 3 nr
+阙之禁 3 nr
+阙二剑 2 nr
+阙右门 128 nr
+阙失 3 v
+阙如 10 nr
+阙左门 4 nr
+阙平明 128 nr
+阙建容 2 nr
+阙文 3 nr
+阙无载 2 nr
+阙朝贺 2 nr
+阙漏 3 v
+阙特勤 10 nr
+阙疑 3 nr
+阙至尊 2 nr
+阙门力 2 nr
+阙门未 128 nr
+阚 7 nr
+阚泽来 2 nr
+阚立田 3 nr
+阚维雍 5 nr
+阛 3 zg
+阜 523 ns
+阜南 3 ns
+阜南县 6 ns
+阜城 13 ns
+阜城县 6 ns
+阜外医院 3 nt
+阜宁 12 ns
+阜宁县 3 ns
+阜平 36 ns
+阜平县 13 ns
+阜康 4 ns
+阜康县 3 ns
+阜康市 2 ns
+阜成路 3 ns
+阜成门 190 ns
+阜新 77 ns
+阜新市 24 ns
+阜新蒙古族自治县 4 ns
+阜财 3 nt
+阜阳 83 ns
+阜阳市 24 ns
+阝 14 zg
+队 12982 n
+队伍 7420 n
+队伍素质 3 n
+队会 8 n
+队内 41 n
+队刑 3 n
+队列 180 n
+队列训练 3 n
+队别 3 n
+队医 35 n
+队友 731 n
+队名 29 n
+队员 3137 n
+队商 3 n
+队形 199 n
+队形变换 3 n
+队徽 3 n
+队报 12 n
+队旗 19 n
+队日 3 n
+队服 14 n
+队歌 11 n
+队礼 3 n
+队章 2 n
+队组 3 n
+队部 35 n
+队里 227 n
+队长 1688 n
+阠 4 zg
+阡 74 n
+阡表 3 n
+阡陌 31 n
+阢陧不安 3 z
+阨 2 zg
+阨困 3 vn
+阨塞 3 vn
+阨灾 3 vn
+阨穷 3 z
+阪 38 ns
+阪本龙一 3 ns
+阪田 3 ns
+阪神 16 ns
+阬 54 zg
+阬儒 3 nrfg
+阮 424 nr
+阮丹宁 3 nr
+阮之流 3 nr
+阮之钿 22 nr
+阮二人 8 nr
+阮云生 2 nr
+阮伟建 2 nr
+阮佩珍 3 nr
+阮元 2 nr
+阮兆祥 3 nr
+阮公墩 2 nr
+阮公欢 2 nr
+阮功爱 3 nr
+阮咸 15 nr
+阮啸仙 19 nr
+阮囊羞涩 2 i
+阮圆海 59 nr
+阮士中 87 nr
+阮士忠 3 nr
+阮大人 4 nr
+阮大哥 4 nr
+阮大铖 555 nr
+阮家三 19 nr
+阮家庄 2 nr
+阮小七 84 nr
+阮小二 49 nr
+阮小五 45 nr
+阮崇武 5 nr
+阮师兄 12 nr
+阮师叔 14 nr
+阮志峰 3 nr
+阮志清 2 nr
+阮成发 256 nr
+阮承志 2 nr
+阮文灵 7 nr
+阮文绍 3 nr
+阮星竹 114 nr
+阮正隆 3 nr
+阮玲玉 18 nr
+阮福时 2 nr
+阮福映 5 nr
+阮章竞 4 nr
+阮素琼 3 nr
+阮经天 3 nr
+阮经宙 2 nr
+阮老爷 8 nr
+阮黑死 2 nr
+阮黑身 2 nr
+阯 25 zg
+阱 17 g
+防 3021 v
+防上 3 v
+防不及防 3 i
+防不胜防 104 i
+防个 3 b
+防人 3 n
+防人之心 3 l
+防伪 96 vn
+防伪标志 3 n
+防住 3 v
+防保 4 j
+防信息泄漏 5 i
+防修 3 v
+防假 2 v
+防具 3 n
+防写 3 v
+防写贴纸 3 n
+防军 15 n
+防冷 5 vn
+防冻 27 v
+防冻保暖 3 n
+防冻剂 3 n
+防冻棚 9 n
+防冻液 4 n
+防冻肽 3 n
+防凌 20 v
+防到 3 v
+防制 3 v
+防办 6 v
+防务 1061 vn
+防务展 3 nt
+防劫 5 v
+防化 53 vn
+防化兵 18 n
+防化学 13 n
+防化学兵 5 n
+防化服 3 n
+防区 129 n
+防卫 631 v
+防卫厅 109 nt
+防卫性 3 n
+防卫素 3 n
+防卫肽 3 nz
+防卫过当 8 l
+防原子 3 n
+防反 7 v
+防喷器组 3 n
+防地 29 n
+防城 36 ns
+防城区 3 j
+防城各族自治县 3 ns
+防城港 18 ns
+防城港市 10 ns
+防堵 7 v
+防备 543 v
+防夜 3 n
+防好 3 v
+防守 1572 v
+防守不住 3 l
+防守反击 3 i
+防守型 3 n
+防守战 2 n
+防守战术 3 n
+防害 3 v
+防寒 40 v
+防寒保暖 3 i
+防寒服 3 n
+防寒防冻 3 i
+防尘 21 n
+防尘套 3 nz
+防尘盖 3 n
+防尘罩 3 n
+防川 2 ns
+防己 3 n
+防弊 3 v
+防弹 54 v
+防弹服 5 n
+防弹武僧 3 n
+防弹汽车 3 n
+防弹玻璃 10 n
+防弹背心 8 i
+防弹衣 52 n
+防弹车 4 n
+防得 3 v
+防御 2833 v
+防御不能 3 n
+防御力 3 n
+防御区 7 n
+防御反应 3 n
+防御土墙 3 n
+防御型 17 n
+防御工事 103 n
+防御性 85 n
+防御战 44 n
+防御机制 3 n
+防御者 3 n
+防御能力 3 n
+防微杜渐 28 i
+防微虑远 3 l
+防心摄行 3 i
+防总 28 v
+防患 2 n
+防患于未 3 l
+防患于未然 52 i
+防患未然 4 i
+防患未萌 3 i
+防意如城 3 l
+防战 3 v
+防扩散 3 j
+防抖动 3 i
+防护 843 v
+防护力 53 n
+防护区 3 n
+防护团 3 n
+防护堤 3 n
+防护性 2 n
+防护服 3 n
+防护林 100 n
+防护林带 18 n
+防护栏 2 n
+防护物 3 n
+防护用品 3 n
+防护眼镜 3 n
+防护系统 3 l
+防护网 5 n
+防护罩 9 n
+防护衣 3 n
+防护装置 2 n
+防护门 3 n
+防抱死 2 i
+防拷 3 v
+防拷贝 3 v
+防振设计 3 i
+防控 74 vn
+防撞 19 vn
+防撬门 3 vn
+防敌 3 v
+防旱 3 vn
+防晒 122 v
+防晒乳 3 nz
+防晒品 5 n
+防晒油 3 n
+防晒霜 69 nz
+防晒露 3 nz
+防暑 6 v
+防暑药 3 n
+防暑降温 4 n
+防暴 22 n
+防暴警察 3 l
+防暴车 3 l
+防暴队 8 n
+防木马 3 ns
+防来 3 v
+防来防去 3 l
+防染剂 3 n
+防染印花 3 n
+防止 3364 v
+防止出现 2 i
+防止网络 2 n
+防毒 52 v
+防毒墙 3 n
+防毒衣 15 n
+防毒软件 3 l
+防毒面具 148 l
+防民之口 5 l
+防氧化 3 n
+防水 651 v
+防水剂 5 n
+防水坝 3 n
+防水层 5 n
+防水工程 3 l
+防水布 3 n
+防水材料 3 n
+防水油布 3 n
+防水涂料 3 n
+防水砂浆 3 n
+防水纸 3 nz
+防水表 2 n
+防汛 232 vn
+防汛措施 2 n
+防汛防台 3 n
+防污 5 v
+防污措施 3 n
+防污染 3 v
+防沉迷 3 i
+防沙 23 ns
+防沙林 3 ns
+防油 2 n
+防治 1521 v
+防治所 2 nt
+防治效果 3 n
+防治法 16 n
+防治规划 3 l
+防波堤 64 n
+防洪 256 vn
+防洪堤 5 n
+防洪工程 11 l
+防洪抗灾 3 l
+防洪措施 2 n
+防洪法 4 n
+防洪设施 3 n
+防浪板 14 n
+防涝 9 v
+防淤渣剂 3 v
+防渗 163 v
+防渗墙 4 n
+防渗膜 3 n
+防湿 2 v
+防溼 3 vn
+防滑 14 v
+防滑垫 3 n
+防滑条 3 n
+防滑砖 3 n
+防滑装置 3 n
+防滑链 2 n
+防滑防跌 3 l
+防漏 3 v
+防潮 50 n
+防潮垫 2 nz
+防潮层 3 l
+防潮法 3 nz
+防潮箱 3 nz
+防潮纸 3 nz
+防火 273 v
+防火剂 3 n
+防火堤 3 n
+防火墙 113 n
+防火层 3 l
+防火巷 3 i
+防火布 3 n
+防火幕 3 n
+防火板 2 n
+防火线 3 n
+防火设备 3 i
+防火设计 3 i
+防火门 3 n
+防火间距 3 nz
+防火阀 3 l
+防灾 48 vn
+防烟挡板 3 n
+防热 21 v
+防热层 3 n
+防热法 3 n
+防焦剂 3 n
+防爆 35 v
+防爆型 3 nz
+防爆灯 3 nz
+防爆电器 3 nz
+防爆网 3 nz
+防爆膜 3 nz
+防爆设备 3 n
+防特 3 nz
+防电剂 3 nz
+防疫 76 vn
+防疫站 9 n
+防疫针 5 n
+防病 92 v
+防病毒 22 n
+防病毒卡 2 n
+防病毒程序 2 n
+防病治病 3 n
+防痨 3 n
+防痨疫苗 3 n
+防痨邮票 3 n
+防癌 70 vn
+防皱 8 n
+防盗 74 vn
+防盗保险 3 n
+防盗器 4 n
+防盗版 3 n
+防盗窗 3 n
+防盗网 2 nz
+防盗铃 3 nz
+防盗链 3 n
+防盗锁 3 nz
+防盗门 7 n
+防盲 3 v
+防盾 16 n
+防眩 2 v
+防眩目 3 i
+防着 3 v
+防砂砾石 3 n
+防碍 3 v
+防碎 3 v
+防磁 3 n
+防磨接头 3 l
+防空 2119 vn
+防空兵 31 n
+防空军 26 j
+防空壕 7 n
+防空洞 115 n
+防空演习 3 n
+防空网 8 n
+防空节 3 n
+防空警报 3 nt
+防窃听 2 i
+防红眼 3 l
+防线 844 n
+防缩 6 v
+防署 3 v
+防老 6 vn
+防老剂 3 n
+防脱发 3 nz
+防腐 297 n
+防腐剂 330 nz
+防腐工程 3 l
+防腐木 3 nz
+防腐材料 3 l
+防腐涂料 3 n
+防腐液 6 nz
+防腐漆 3 nz
+防腐蚀 16 nz
+防腐设备 3 n
+防臭 4 n
+防臭剂 3 n
+防臭氧剂 3 n
+防芽遏萌 3 nr
+防范 917 v
+防范控制 3 n
+防范措施 3 n
+防范设施 3 n
+防萌杜渐 3 nr
+防虫 156 n
+防虫网 3 n
+防蚀剂 3 n
+防蛀 12 v
+防裂 3 v
+防触电 3 nz
+防讯 3 nz
+防谍 3 n
+防贼 12 n
+防贼法 3 l
+防走光 3 n
+防身 143 v
+防身器 3 l
+防身术 3 l
+防身武器 3 l
+防辐射 25 nz
+防避 3 v
+防部 3 n
+防酶 3 n
+防酸 2 n
+防锁 3 vn
+防锈 32 v
+防锈剂 6 n
+防锈油 3 n
+防锈漆 3 n
+防错 2 v
+防防 3 v
+防阻 3 v
+防除 26 v
+防险 5 n
+防雨 9 n
+防雨布 3 n
+防雨罩 3 n
+防雷 26 v
+防雷击 3 i
+防雷单元 3 n
+防雷器 3 n
+防雷设计 3 i
+防雹 7 n
+防雾剂 3 nz
+防震 56 n
+防震措施 3 n
+防震棚 4 n
+防霉 20 v
+防霉剂 3 n
+防霜林 3 nz
+防静电 7 vn
+防非典 3 ns
+防音绿地 3 n
+防颱 3 vn
+防风 88 n
+防风固沙 14 nz
+防风固沙林 5 nz
+防风墙 3 n
+防风外衣 3 n
+防风林 13 nz
+防风标 3 n
+防骄破满 3 i
+防鼠 3 n
+防龋 16 v
+阳 3406 nr
+阳一阴 2 nr
+阳三义 2 nr
+阳三城 3 nr
+阳三蒸 256 nr
+阳三郡 3 nr
+阳上亢 3 nr
+阳世 12 nr
+阳东 3 ns
+阳东县 3 ns
+阳东至 2 nr
+阳义烈 2 nr
+阳之城 2 nr
+阳书指 4 n
+阳二阴 6 nr
+阳五龙 2 nr
+阳交 3 n
+阳亭侯 2 nr
+阳伞 11 nr
+阳伞效应 3 l
+阳信 5 nr
+阳信县 5 nr
+阳光 3451 nr
+阳光充足 3 nr
+阳光化 2 nr
+阳光厅 3 nr
+阳光城 2 nr
+阳光工程 3 n
+阳光房 3 nr
+阳光明媚 3 nr
+阳光普照 3 nr
+阳光板 3 nr
+阳光灿烂 3 i
+阳光男孩 3 n
+阳光网 3 nr
+阳光计划 3 n
+阳光集团 14 nt
+阳光雨露 3 nr
+阳公样 2 nr
+阳关 78 ns
+阳关三叠 14 nr
+阳关三迭 3 nr
+阳关大道 9 ns
+阳关道 10 nr
+阳具 3 n
+阳刘沟 2 nr
+阳刚 70 nr
+阳刚之气 33 n
+阳刚之美 5 nr
+阳刚味 3 nr
+阳刚气 3 n
+阳剑剑 2 nr
+阳化 2 n
+阳化风 5 nr
+阳历 69 n
+阳历年 3 nr
+阳原 8 ns
+阳原县 7 ns
+阳友鹤 3 nr
+阳台 242 n
+阳台窗 3 nr
+阳台门 2 ns
+阳四义 4 nr
+阳坡 56 ns
+阳坪 3 ns
+阳城 113 ns
+阳城县 4 ns
+阳大会 2 nt
+阳天部 4 nr
+阳太守周 2 nr
+阳太守袁 2 nr
+阳夫人 6 nr
+阳奉阳违 3 nr
+阳奉阴违 25 nr
+阳子 183 n
+阳子则 2 nr
+阳宅 16 n
+阳守军 2 nr
+阳安关 3 ns
+阳安江 2 ns
+阳宗海 12 nr
+阳宝华 2 nr
+阳宫里 2 nr
+阳寿 22 nr
+阳尊怀 2 nr
+阳山 21 ns
+阳山县 3 ns
+阳崖阴 6 nr
+阳工 2 n
+阳平 32 nr
+阳平关 34 ns
+阳平声 3 nr
+阳府 256 n
+阳府君 3 nr
+阳强易 2 n
+阳律 2 n
+阳心经 2 nr
+阳忠恕 2 nr
+阳性 335 n
+阳性反应 3 l
+阳性植物 3 l
+阳性率 19 n
+阳性纤维 3 l
+阳性细胞 3 n
+阳性者 10 n
+阳性菌 3 n
+阳掌 7 n
+阳政范 3 nr
+阳散寒 2 nr
+阳数 3 n
+阳文 14 nr
+阳新 781 nr
+阳新县 261 ns
+阳方口 3 nr
+阳明 90 nr
+阳明区 3 nr
+阳明医学 3 nt
+阳明医院 3 nt
+阳明国中 3 nr
+阳明国小 3 nr
+阳明堡 6 nr
+阳明山 18 nr
+阳明巾 2 nr
+阳明心 13 nr
+阳明病 9 nr
+阳明经 14 nr
+阳明络 2 n
+阳明胃 19 nr
+阳春 70 nr
+阳春县 3 nr
+阳春型 3 nr
+阳春市 3 ns
+阳春有脚 3 i
+阳春白雪 26 nr
+阳春砂 3 nr
+阳春面 6 nr
+阳曲 8 n
+阳曲县 4 ns
+阳曲郡 2 nr
+阳朔 44 nr
+阳朔县 13 ns
+阳极 160 ns
+阳极板 3 n
+阳极泥 3 n
+阳林堂 2 nr
+阳桃 7 n
+阳樊 2 ns
+阳武侯 6 nr
+阳武县 2 ns
+阳气 127 n
+阳水吉 2 nr
+阳汜水 7 nr
+阳江 77 ns
+阳江市 11 ns
+阳池 4 n
+阳沟 43 ns
+阳河 11 ns
+阳泉 28 nr
+阳泉市 9 ns
+阳浦 3 ns
+阳渠直 2 nr
+阳湖 21 ns
+阳湖派 5 nr
+阳湾 3 ns
+阳澄湖 17 nr
+阳烛 5 n
+阳煦山立 3 nr
+阳燧 10 n
+阳物 3 n
+阳率军 2 nr
+阳玉酒 2 nr
+阳王章 2 nr
+阳玛诺 2 nr
+阳生春 2 nr
+阳甲兄弟 4 nr
+阳电 3 n
+阳电子 3 n
+阳电子炮 3 n
+阳界 3 n
+阳畦 2 nr
+阳痿 122 v
+阳盛阴衰 3 nr
+阳相火 2 nr
+阳督脉 7 n
+阳石隘 2 n
+阳神 2 n
+阳神掌 2 nr
+阳离子 117 n
+阳童 3 n
+阳线 81 n
+阳经行 2 nt
+阳络脉 2 nr
+阳维脉 10 ns
+阳羡春 2 nr
+阳羡茶 3 nr
+阳羡词 3 nr
+阳翰笙 23 nr
+阳胆经 3 nr
+阳脉 2 ns
+阳至刚 2 nr
+阳茎 4 n
+阳茎基 2 nr
+阳萎 14 v
+阳虚 87 nr
+阳虚治 3 nr
+阳虚者 2 nr
+阳虚证 8 nr
+阳虚阴 3 nr
+阳融雪 5 nr
+阳襄陵 3 nr
+阳西 6 ns
+阳西县 3 ns
+阳解阴毒 3 n
+阳证 3 n
+阳诸姬 3 nr
+阳谋 2 n
+阳谷 38 n
+阳谷县 35 ns
+阳起石 16 nr
+阳路 2 n
+阳跷脉 3 n
+阳转运 2 nr
+阳道行 2 nr
+阳邵江 2 nr
+阳郡治 2 nr
+阳酒 3 n
+阳间 30 n
+阳阳 8 ns
+阳阿公主 2 nr
+阳陵泉 3 nr
+阳面 12 n
+阳韵 3 nr
+阳顶 3 n
+阳顶天 29 nr
+阳驿 2 ns
+阳高 8 nr
+阳高县 9 ns
+阳高境 6 nr
+阳黄柏 2 nr
+阴 2300 a
+阴一阳 20 nr
+阴三阳 4 nr
+阴与阳 6 nr
+阴世再 2 nr
+阴世去 4 t
+阴世地 2 n
+阴世路 2 nr
+阴世里 5 nr
+阴丹士林 13 nr
+阴丽华 122 nr
+阴之品 3 n
+阴云 112 nr
+阴云密布 19 nr
+阴交 3 n
+阴亲 2 n
+阴令 3 n
+阴假凤 2 nr
+阴僻 3 a
+阴八阳 2 nr
+阴兵 7 n
+阴养颜 2 nr
+阴冷 144 nr
+阴凄凄 3 z
+阴凉 63 nr
+阴凉处 7 n
+阴凝冰坚 3 nr
+阴凝坚冰 3 nr
+阴刻 22 n
+阴功 11 a
+阴劲 3 a
+阴包 3 n
+阴化寒 2 nr
+阴历 125 n
+阴历年 7 nr
+阴司 44 n
+阴司地府 3 n
+阴司见 2 nr
+阴司里 10 nr
+阴吏 3 n
+阴君火 2 nr
+阴唇 6 n
+阴囊 80 n
+阴囊炎 3 n
+阴地 3 n
+阴地蕨 3 n
+阴坡 53 ns
+阴声阴 4 nr
+阴处 3 n
+阴天 46 n
+阴奉阳 2 nr
+阴宅 58 n
+阴宅阳 2 nr
+阴室 3 n
+阴宫 8 n
+阴宫里 2 nr
+阴密 3 n
+阴寒 32 n
+阴寒之 2 nr
+阴寿 3 nr
+阴小帖 2 nr
+阴山 155 ns
+阴山山脉 28 ns
+阴山背后 3 i
+阴差 3 n
+阴差阳错 43 i
+阴市 3 n
+阴干 12 n
+阴平 51 n
+阴应节 3 n
+阴府 3 n
+阴影 838 n
+阴德 33 nr
+阴性 166 n
+阴性反应 3 l
+阴性草 3 n
+阴性菌 3 n
+阴恻恻 3 nr
+阴惨 3 a
+阴户 24 n
+阴损 38 n
+阴文 15 n
+阴星君 2 nr
+阴晦 39 a
+阴晴 14 nr
+阴晴不定 3 nr
+阴晴圆 4 nr
+阴晴寒暑 3 nr
+阴暗 244 a
+阴暗处 9 i
+阴暗面 39 n
+阴曹 63 nr
+阴曹地府 3 nr
+阴月阴 2 nr
+阴有小雨 5 nr
+阴有异 2 nr
+阴有阳 2 nr
+阴服微行 3 n
+阴极 150 n
+阴极保护 3 n
+阴极射线 74 n
+阴极射线管 24 n
+阴极极化 3 n
+阴极管 3 n
+阴极铜 3 n
+阴柔 77 a
+阴柔之美 2 i
+阴柔性 3 nr
+阴柔气 3 i
+阴核 3 n
+阴棒 10 n
+阴森 138 nr
+阴森可怖 23 i
+阴森恐怖 3 i
+阴森森 105 nr
+阴模 3 n
+阴欲夺 3 i
+阴毒 206 n
+阴毛 24 n
+阴气 105 n
+阴气森 143 nr
+阴气沉沉 3 z
+阴沈沈 3 nr
+阴沉 313 a
+阴沉沉 75 z
+阴沟 58 ns
+阴沟里翻 3 nr
+阴河 21 ns
+阴河中 2 ns
+阴河横 2 nr
+阴测测 2 i
+阴消阳 2 nr
+阴润 4 n
+阴润温 4 nr
+阴湿 47 a
+阴潜阳 6 nr
+阴火 10 n
+阴火潜 6 nr
+阴灵儿 2 nr
+阴炎 2 n
+阴爪 2 n
+阴狠 3 z
+阴狠毒辣 3 l
+阴生叶 2 nr
+阴生植物 3 l
+阴电 3 n
+阴电子 3 n
+阴电性 3 n
+阴界 5 n
+阴疑阳战 3 l
+阴痒 3 a
+阴皇后 4 nr
+阴盛阳 22 ns
+阴盛阳衰 3 l
+阴着儿 3 l
+阴神 2 n
+阴离子 98 n
+阴离子酸 3 n
+阴私 15 n
+阴穴 3 n
+阴童 3 n
+阴笑 7 nr
+阴笑道 7 nr
+阴符 8 n
+阴精 4 n
+阴纯阳 2 nr
+阴线 8 n
+阴经行 2 n
+阴络脉 6 n
+阴维脉 9 nr
+阴脣 3 z
+阴至寒 3 nr
+阴茎 252 n
+阴茎头 3 nr
+阴荐西 2 n
+阴蒂 13 nr
+阴虚 110 nr
+阴虚内 6 nr
+阴虚治 5 nr
+阴虚生 2 nr
+阴虚者 7 nr
+阴虚证 9 nr
+阴虚阳 4 nr
+阴虱 9 n
+阴补阳 12 nr
+阴角 3 n
+阴证 4 n
+阴谋 1404 n
+阴谋份子 3 n
+阴谋家 42 n
+阴谋活动 3 i
+阴谋计划 3 n
+阴谋论 3 n
+阴谋诡计 107 i
+阴谋败露 3 i
+阴谷 4 n
+阴贵人 3 nr
+阴跌 3 v
+阴跷脉 3 n
+阴转多云 3 i
+阴转晴 6 nr
+阴转阳 2 nr
+阴转雨 2 nr
+阴进 2 a
+阴道 502 n
+阴道内 3 nr
+阴道口 28 n
+阴道炎 127 nr
+阴道镜 3 nr
+阴郁 86 a
+阴部 124 n
+阴错阳差 22 n
+阴门 11 n
+阴间 111 n
+阴间多云 3 l
+阴阜 3 ns
+阴阳 1232 ns
+阴阳五行 3 nr
+阴阳交错 3 n
+阴阳人 10 n
+阴阳历 31 nr
+阴阳官 3 nr
+阴阳家 27 n
+阴阳师 3 nr
+阴阳形码 3 n
+阴阳怪气 68 i
+阴阳易位 3 n
+阴阳水 3 nr
+阴阳生 5 nr
+阴阳界 3 n
+阴阳眼 3 n
+阴阳码 3 n
+阴阳鱼 3 nr
+阴阴 3 ns
+阴阴暗暗 3 i
+阴阴森森 3 nr
+阴阴沈沈 3 nr
+阴阴沉沉 3 z
+阴阴的 10 z
+阴险 145 n
+阴险毒辣 30 i
+阴陵泉 4 nr
+阴雨 107 n
+阴雨天 11 nr
+阴雨寡照 3 i
+阴雨连绵 144 nr
+阴雨雪 2 nr
+阴霾 81 n
+阴霾霾 3 n
+阴面 5 n
+阴韵 3 n
+阴风 106 n
+阴风愁惨 3 i
+阴骘 26 n
+阴鬼 2 n
+阴魂 50 n
+阴魂不散 60 i
+阴魔 3 n
+阴鸷 24 a
+阵 3405 n
+阵云 3 n
+阵亡 420 v
+阵亡人数 3 n
+阵亡将士 3 n
+阵亡者 3 n
+阵位 13 n
+阵内 27 s
+阵列 75 q
+阵列卡 3 nrt
+阵列柜 3 n
+阵前 269 s
+阵势 442 n
+阵单元 3 n
+阵发 3 n
+阵发性 66 n
+阵因子 3 n
+阵图 3 n
+阵地 1812 n
+阵地失守 3 n
+阵地战 68 n
+阵地防御 3 n
+阵型 63 n
+阵天线 3 n
+阵子 41 n
+阵容 917 n
+阵容坚强 3 n
+阵容庞大 3 z
+阵容强大 3 n
+阵式 8 n
+阵形 31 n
+阵挛性 4 n
+阵法 758 n
+阵痛 76 n
+阵痛期 3 n
+阵纪 3 n
+阵线 382 n
+阵缩 3 v
+阵脚 191 n
+阵脚大乱 3 n
+阵营 417 n
+阵阵 527 q
+阵雨 75 n
+阵雨般 3 n
+阵雪 3 n
+阵风 167 n
+阵马风墙 3 n
+阵马风樯 3 n
+阶 1356 n
+阶下 3 n
+阶下囚 39 n
+阶下百诺 3 l
+阶乘 6 nz
+阶前万里 3 l
+阶地 3 n
+阶地沼泽 3 v
+阶层 1253 n
+阶梯 699 n
+阶梯天线 3 nz
+阶梯式 31 n
+阶梯形 16 n
+阶梯教室 3 n
+阶梯法 3 n
+阶梯状 62 nz
+阶段 9574 n
+阶段发育 3 l
+阶段性 197 n
+阶沿 3 n
+阶石 3 n
+阶级 4640 n
+阶级分化 3 l
+阶级分析 3 l
+阶级化 3 n
+阶级友爱 3 l
+阶级性 54 n
+阶级意识 3 l
+阶级教育 3 l
+阶级斗争 947 l
+阶级本质 3 n
+阶级矛盾 3 l
+阶级立场 3 n
+阶级观点 3 n
+阶级觉悟 3 l
+阶级路线 3 l
+阶跃 3 n
+阶跃干扰 3 l
+阶跃电压 3 nz
+阻 1730 v
+阻值 17 n
+阻击 196 v
+阻击战 12 n
+阻击手 3 n
+阻力 645 n
+阻力位 3 n
+阻力点 4 n
+阻吓 3 v
+阻垢剂 3 v
+阻塞 243 v
+阻塞住 3 v
+阻塞器 3 n
+阻塞性 37 n
+阻塞点 3 n
+阻塞状态 3 n
+阻容 3 n
+阻尼 93 n
+阻尼作用 3 n
+阻尼力 3 n
+阻尼器 3 n
+阻尼峰 3 n
+阻尼振动 3 nz
+阻尼振荡 3 n
+阻尼比 3 n
+阻山带河 3 n
+阻带 3 n
+阻干 3 n
+阻延 3 v
+阻截 49 v
+阻扰 2 v
+阻抑 3 v
+阻抑物 3 n
+阻抑蛋白 3 n
+阻抗 93 v
+阻抗匹配 4 nz
+阻抗圆图 3 n
+阻抗素 3 n
+阻抗角 3 n
+阻拦 940 v
+阻拦着 3 y
+阻挠 575 v
+阻挠挫败 3 vn
+阻挡 584 v
+阻挡层 3 n
+阻援 3 v
+阻断 170 v
+阻断剂 3 n
+阻断器 3 n
+阻梗 3 n
+阻止 1620 v
+阻止不了 3 n
+阻止本领 3 n
+阻止距离 3 n
+阻深 3 v
+阻滞 161 v
+阻滞剂 20 n
+阻火器 3 n
+阻燃 12 v
+阻燃剂 5 n
+阻燃性 3 n
+阻生牙 3 n
+阻碍 785 v
+阻碍交通 3 n
+阻碍类 3 n
+阻绝 9 v
+阻聚作用 3 n
+阻聚剂 5 n
+阻遏 57 v
+阻遏物 3 v
+阻郁 3 v
+阻隔 223 v
+阻隔开 3 n
+阻隔性 3 n
+阻障 3 v
+阻难 3 v
+阻雨 3 n
+阼 4 g
+阽 2 g
+阽危之域 3 ns
+阿 6905 j
+阿丁枫 4 nr
+阿七 8 ns
+阿不来 3 nr
+阿不来提 6 ns
+阿不都热依木 3 ns
+阿不都热西提 6 ns
+阿丑道 5 nr
+阿世取容 3 nr
+阿世媚俗 3 nr
+阿世盗名 3 nz
+阿丘 2 ns
+阿东 62 ns
+阿丰索 10 nr
+阿丹 13 ns
+阿丹斯 2 nr
+阿丽亚娜 5 nr
+阿丽思 3 nr
+阿乔利 6 nr
+阿亚 4 ns
+阿亚克斯 3 nrt
+阿亚图 7 nr
+阿亚库乔 15 nr
+阿亚拉 4 nr
+阿亨 7 nr
+阿什 46 nrt
+阿什利 3 nrt
+阿什哈巴德 18 nrt
+阿什顿 7 nrt
+阿仑 7 ns
+阿仙奴 3 nr
+阿代尔 3 nr
+阿代希安 2 nz
+阿们 3 n
+阿伊 8 nrt
+阿伊努 10 nr
+阿伊杰 3 nr
+阿伊达 2 nr
+阿会喃 3 n
+阿伦 18 nr
+阿伦尼 22 nr
+阿伦德 3 nr
+阿伦特 4 nr
+阿伯 14 ns
+阿伯丁 19 nr
+阿伯德 2 nr
+阿伯思 2 nr
+阿伯拉 4 nr
+阿伯拉尔 3 nrt
+阿伯特 7 nr
+阿佛洛 14 nr
+阿佤 3 nrt
+阿佩伊伦 4 nrt
+阿佩尔 3 nr
+阿依努儿 2 nr
+阿依古丽 8 nr
+阿依曼 3 nr
+阿依达 5 nr
+阿保机 17 nr
+阿修罗 25 nr
+阿倍仲麻吕 3 nr
+阿儿浑 2 nr
+阿兄 3 nr
+阿克 30 nrt
+阿克丽塔 2 nrt
+阿克兴 2 nr
+阿克塞哈萨克族自治县 2 ns
+阿克尔 3 nr
+阿克巴 47 nr
+阿克布 2 nr
+阿克库 3 nr
+阿克拉 34 nrt
+阿克敦 2 ns
+阿克斯 2 nr
+阿克曼 2 nr
+阿克罗 2 nr
+阿克美 4 nr
+阿克苏 122 ns
+阿克苏地区 4 ns
+阿克苏市 8 ns
+阿克苏河 28 ns
+阿克茹 5 nr
+阿克莫拉 6 nrt
+阿克莱 6 nr
+阿克萨 3 nr
+阿克萨清真寺 6 ns
+阿克赛 4 nr
+阿克达 2 nr
+阿克陶 2 nr
+阿克陶县 4 ns
+阿克顿 4 nr
+阿党比周 3 nr
+阿党相为 3 n
+阿公 55 nr
+阿公阿婆 3 nr
+阿兰 75 ns
+阿兰亦 2 nr
+阿兰人 16 nrt
+阿兰若 4 nr
+阿兰达 3 nr
+阿兵哥 3 nr
+阿其克 3 nr
+阿其克谷地 3 ns
+阿其所好 3 i
+阿兹特 95 nr
+阿兹特克 2 nrt
+阿内 10 nrt
+阿内尔 3 nr
+阿内尔卡 3 nrt
+阿冈 3 ns
+阿几米德 3 nr
+阿凡提 34 nr
+阿凡提妻 3 nr
+阿凯亚 5 nr
+阿列 5 ns
+阿列克 6 nr
+阿列克谢 16 nrt
+阿列克谢耶夫 11 nrt
+阿列克谢耶维奇 5 nrt
+阿列克谢耶芙娜 2 nrt
+阿列曼 2 nr
+阿利 19 ns
+阿利乌 3 nr
+阿利亚 2 ns
+阿利奥 2 nr
+阿利安 3 ns
+阿利安人 3 nrt
+阿利斯 7 nr
+阿利纳斯 7 ns
+阿利耶夫 2 nrt
+阿利萨 2 nr
+阿利雅 12 nr
+阿剌伯 4 nr
+阿剌兀 4 nr
+阿剌吉 10 nr
+阿剌海 5 nr
+阿剌知 3 nr
+阿剌罕 2 nr
+阿力麻 39 nr
+阿加 11 ns
+阿加尼亚 6 ns
+阿加德兹 5 ns
+阿加特 6 nr
+阿加索 2 nr
+阿加莎 3 ns
+阿加莱 2 nr
+阿加西 21 ns
+阿加迪尔 5 nrt
+阿努伊 3 nr
+阿努拉达普拉 3 nrt
+阿努斯 3 nr
+阿努维尔 6 nrt
+阿努钦 4 nr
+阿劳 8 nrt
+阿劳加 3 nr
+阿劳坎 5 nr
+阿劳龟 3 nr
+阿勒 20 nrt
+阿勒代斯 3 nrt
+阿勒坦 4 nr
+阿勒坦格列尔 3 nrt
+阿勒山 4 ns
+阿勒曼 4 nr
+阿勒曼尼 6 nrt
+阿勒格 2 nr
+阿勒格尼 12 nrt
+阿勒楚 2 nr
+阿勒河 4 ns
+阿勒波 2 nr
+阿勒泰 44 nr
+阿勒泰地区 10 ns
+阿勒泰市 7 ns
+阿勒班 2 nr
+阿勒纳哈扬 9 nrt
+阿勒萨 3 nr
+阿勒萨尼 2 nrt
+阿勒锦 6 nr
+阿勒颇 25 nrt
+阿华之 2 nr
+阿卓糖 3 nr
+阿南 4 ns
+阿南德 9 nr
+阿卜德 3 nrt
+阿卜拉 2 nrt
+阿卜杜 21 nr
+阿卜杜勒 56 nrt
+阿卜杜拉 60 nrt
+阿卜杜拉季波夫 3 nrt
+阿卜杜拉耶 3 nrt
+阿卜莱 2 nrt
+阿卡 80 nrt
+阿卡亚 48 nr
+阿卡什 26 nrt
+阿卡德 33 nr
+阿卡斯 8 nr
+阿卡族 11 nr
+阿卡普尔科 5 nrt
+阿卡耶夫 16 nrt
+阿卡胡 2 nr
+阿卡苏 2 nr
+阿卡西 3 nr
+阿卡迪亚 9 nrt
+阿卢南 3 ns
+阿历克 3 nrt
+阿历山大 3 ns
+阿叔 5 nr
+阿古 6 ns
+阿古斯丁 2 nrt
+阿古斯塔 4 nrt
+阿古斯金 2 nrt
+阿古柏 74 nr
+阿司匹林 47 nz
+阿合奇 3 nr
+阿合奇县 4 ns
+阿合马 12 ns
+阿吉仔 3 nr
+阿吉依明 2 nr
+阿吉勒 2 nr
+阿吉雷 2 nr
+阿同葛 3 nr
+阿呀呀 3 o
+阿呆瓜 3 nr
+阿哈 23 nrt
+阿哈加尔 2 ns
+阿哈尔 3 nr
+阿哈福 2 nr
+阿哥 2088 ns
+阿哥哥 3 nr
+阿喀斯 2 nr
+阿喀琉斯 3 nr
+阿喇古 2 ns
+阿喇戈 2 nr
+阿嚏 2 n
+阿囡 12 n
+阿国 2 ns
+阿图什 8 nrt
+阿图什市 3 ns
+阿图尔 2 nr
+阿图岛 6 nr
+阿图罗 2 nr
+阿土 3 n
+阿地力 7 nr
+阿坝 37 ns
+阿坝县 4 ns
+阿坝州 10 ns
+阿坝藏族羌族自治州 11 ns
+阿埃塔 3 nrt
+阿城 32 ns
+阿城县 3 ns
+阿城市 9 ns
+阿培尔 2 nr
+阿基亚斯 16 nrt
+阿基兰 2 nr
+阿基坦 13 nr
+阿基姆 4 nr
+阿基拉 2 nr
+阿基洛 16 nr
+阿基米 3 nr
+阿基米得 3 nrt
+阿基米德 112 nrt
+阿基诺 53 nr
+阿基里 2 nrt
+阿基雷 4 nr
+阿堵物 3 nr
+阿塔 13 nrt
+阿塔卡马 11 nrt
+阿塔图尔克 10 nrt
+阿塔夫 9 nr
+阿塔尔 4 nr
+阿塔瓦尔 8 nrt
+阿塔科 4 nr
+阿塔纳 4 nr
+阿塔纳索 4 nrt
+阿塞弗 2 nr
+阿塞拜疆 148 ns
+阿塞拜疆人 11 nz
+阿塞拜疆共和国 3 ns
+阿塞菲 2 nr
+阿塞西 2 ns
+阿墨士 2 nr
+阿墨江 3 nr
+阿多尔诺 3 nrt
+阿多诺 3 nr
+阿太卢 16 nr
+阿夫坦 3 nr
+阿夫拉 2 nrt
+阿夫沙 2 nr
+阿奇兹 2 nr
+阿奇博尔德 9 nrt
+阿奇太 16 nr
+阿奇木 2 nr
+阿奇木伯克 24 nrt
+阿奎丹 2 nr
+阿奎纳 5 nr
+阿奎那 11 nr
+阿契劳 16 nrt
+阿契劳斯 64 nrt
+阿契美 13 nr
+阿契美尼 2 nr
+阿契贝 2 nr
+阿奴律 8 nr
+阿奶 28 nr
+阿妈 22 nr
+阿妈妮 72 nr
+阿妹 21 nr
+阿姆 28 nrt
+阿姆利 17 nr
+阿姆哈 17 nr
+阿姆尔 2 nr
+阿姆巴 2 nr
+阿姆布 2 nr
+阿姆德 2 nr
+阿姆拉 2 nr
+阿姆斯 8 nr
+阿姆斯壮 3 nr
+阿姆斯特 3 nrt
+阿姆斯特丹 146 ns
+阿姆斯特朗 48 nrt
+阿姆河 83 nr
+阿姆罗 3 nr
+阿姆赫斯 2 nrt
+阿姆里 4 nr
+阿姐鼓 3 nr
+阿姑阿翁 3 nr
+阿姨 276 nr
+阿威罗 4 nr
+阿娇金屋 3 nr
+阿娘 5 nr
+阿娜斯 2 nr
+阿婆 79 nr
+阿婶 3 n
+阿婶婆 3 nr
+阿子营 2 nr
+阿季尼 16 nr
+阿宝先 2 nr
+阿宝和 2 nr
+阿宝来 2 nr
+阿宝笑道 3 nr
+阿宝道 5 nr
+阿家翁 2 nr
+阿家阿翁 3 nr
+阿寅勒 2 nr
+阿密尔 2 nr
+阿富哈 2 nr
+阿富汉 4 nr
+阿富汗 816 nr
+阿富汗人 21 nr
+阿富诺 2 nr
+阿尔丁 3 nr
+阿尔万 5 nrt
+阿尔丰 5 nr
+阿尔丰索 4 ns
+阿尔丹 6 nr
+阿尔乔 2 nr
+阿尔代什 4 nrt
+阿尔伯 4 nr
+阿尔伯克 2 nrt
+阿尔伯特 16 nrt
+阿尔伯达 2 nrt
+阿尔先季耶夫 3 nr
+阿尔克 6 nrt
+阿尔农 6 nr
+阿尔凯 3 nr
+阿尔凯奥 2 nrt
+阿尔利 3 nr
+阿尔加 5 nr
+阿尔加维 2 nrt
+阿尔勒 2 nrt
+阿尔卑 9 nr
+阿尔卑斯 99 ns
+阿尔卑斯山 151 ns
+阿尔卑斯山区 29 ns
+阿尔卑斯山脉 91 ns
+阿尔卑斯省 3 ns
+阿尔博 2 nr
+阿尔卡 18 nr
+阿尔卡勒 3 nrt
+阿尔卡拉 3 nrt
+阿尔卡特 177 nrt
+阿尔卡特公司 7 ns
+阿尔及利亚 430 ns
+阿尔及利亚人 10 nz
+阿尔及利亚民主人民共和国 5 ns
+阿尔及尔 66 ns
+阿尔发 2 nr
+阿尔哈 4 nrt
+阿尔喀 32 nr
+阿尔图 2 nr
+阿尔图罗 3 nrt
+阿尔坎 2 nr
+阿尔基 3 nr
+阿尔基洛 2 nrt
+阿尔塔 5 nrt
+阿尔塔米拉 10 nrt
+阿尔塞 2 nr
+阿尔夫 2 nr
+阿尔察 2 nr
+阿尔尼 2 nr
+阿尔尼姆 3 nrt
+阿尔山 18 nr
+阿尔山市 3 ns
+阿尔巴 11 nrt
+阿尔巴尼 3 nrt
+阿尔巴尼亚 359 nrt
+阿尔巴尼亚人 28 nrt
+阿尔巴尼亚族 7 nz
+阿尔巴尼亚语 11 nz
+阿尔布佐 6 nrt
+阿尔布克 2 nrt
+阿尔希 5 nr
+阿尔希波夫 24 nrt
+阿尔帕 2 nr
+阿尔帕德 2 nrt
+阿尔弗 2 nr
+阿尔弗莱 3 nrt
+阿尔弗雷 22 nrt
+阿尔弥 3 nr
+阿尔德 7 nrt
+阿尔忒 19 nr
+阿尔忒弥 3 nr
+阿尔戈 2 nr
+阿尔戈斯 5 nrt
+阿尔托 13 nrt
+阿尔托夫 3 nrt
+阿尔捷 2 nr
+阿尔摩 11 nrt
+阿尔摩哈 2 nrt
+阿尔文 25 nr
+阿尔文号 2 nz
+阿尔斯 3 nr
+阿尔斯兰 6 nrt
+阿尔斯特 38 nrt
+阿尔斯通 6 nz
+阿尔明尼 2 nr
+阿尔普 8 nr
+阿尔杜 3 nr
+阿尔杜伊 2 nrt
+阿尔杜塞 2 nrt
+阿尔杜斯 4 nrt
+阿尔格 3 nrt
+阿尔比 12 nrt
+阿尔汉格尔斯克 7 nrt
+阿尔汗 3 nr
+阿尔沃兰 4 ns
+阿尔法 69 nr
+阿尔法粒子 2 nz
+阿尔波 8 nr
+阿尔泰 85 nr
+阿尔泰山 193 ns
+阿尔泰山脉 25 ns
+阿尔泽 6 nr
+阿尔派 5 nr
+阿尔滕 4 nr
+阿尔特 9 nrt
+阿尔玛 3 nr
+阿尔玛格 2 nrt
+阿尔琼 2 nr
+阿尔瓦 17 nrt
+阿尔瓦拉多 3 nrt
+阿尔瓦罗 3 nrt
+阿尔瓦雷 5 nrt
+阿尔登 5 nrt
+阿尔皮 2 nr
+阿尔福斯 3 nrt
+阿尔穆 12 nr
+阿尔穆尼 2 nrt
+阿尔穆尼亚 5 ns
+阿尔穆瓦 9 nrt
+阿尔米达 5 nrt
+阿尔索 11 nr
+阿尔索伊 4 nrt
+阿尔维斯 7 nrt
+阿尔腾 8 nr
+阿尔艾 2 nr
+阿尔茨 10 nrt
+阿尔茨海默 9 nrt
+阿尔茨海默氏症 3 n
+阿尔莫 3 nr
+阿尔菲耶 3 nrt
+阿尔萨斯 57 nrt
+阿尔蒙德 7 nrt
+阿尔衮 2 nrt
+阿尔衮琴 4 nr
+阿尔西 3 ns
+阿尔诺 12 nr
+阿尔诺河 5 ns
+阿尔谢尼 2 nrt
+阿尔贝 11 nr
+阿尔贝尔 2 nrt
+阿尔贝德 3 nrt
+阿尔贝托 4 nrt
+阿尔贝特 10 nrt
+阿尔贝蒂 5 nrt
+阿尔贡 7 nr
+阿尔费 6 nr
+阿尔赫 2 nr
+阿尔赫西 3 nrt
+阿尔达 6 nr
+阿尔达布拉 2 nrt
+阿尔都塞 3 ns
+阿尔金 22 nr
+阿尔金山 46 ns
+阿尔韦 2 nr
+阿尔顿 6 nrt
+阿尔马 3 ns
+阿尔高 2 nrt
+阿尤布 21 nr
+阿尤恩 11 nr
+阿尼哥 14 nr
+阿尼奥库 2 nrt
+阿尼斯 2 nr
+阿尼玛 4 nr
+阿尼玛卿山 21 ns
+阿山 7 ns
+阿岭 2 nrt
+阿巴 49 nrt
+阿巴丹 32 nr
+阿巴亚 2 ns
+阿巴公 3 nr
+阿巴嘎旗 2 ns
+阿巴坎 6 nr
+阿巴基 4 nr
+阿巴尔虎 3 nrt
+阿巴尔金 2 nrt
+阿巴岛 2 ns
+阿巴德 9 nrt
+阿巴拉 3 nrt
+阿巴拉契亚 71 nrt
+阿巴斯 34 nr
+阿巴斯港 4 ns
+阿巴查 5 nr
+阿巴桑 3 nr
+阿巴泰 8 nr
+阿巴鸟 3 nr
+阿布哈兹 44 nrt
+阿布德 3 nr
+阿布德努尔 2 nrt
+阿布扎比 45 nrt
+阿布扎比酋长国 2 ns
+阿布拉 2 nrt
+阿布拉莫维奇 10 nrt
+阿布杜 15 nr
+阿布杜尔 2 nrt
+阿布沙 3 nr
+阿布维 3 nr
+阿布维尔 4 nrt
+阿布罗斯 4 nrt
+阿布西 2 ns
+阿布贾 4 nr
+阿布赉 2 nrt
+阿布辛 5 nr
+阿布里 3 nrt
+阿布鲁 3 nr
+阿布鼐 5 nr
+阿希拉 2 nr
+阿帕克 10 nr
+阿帕奇 52 nr
+阿帕契 2 nr
+阿帕拉契 3 nrt
+阿帕河 2 nr
+阿帕网 6 nz
+阿干镇 3 ns
+阿平绝倒 3 i
+阿庆嫂 7 nr
+阿库布 4 nr
+阿库拉 3 nrt
+阿库里 3 nrt
+阿廖欣 3 nr
+阿廷映射 3 nr
+阿式 4 n
+阿弗尔 21 nr
+阿弗罗尔 2 nrt
+阿弗莱克 3 nrt
+阿弟 3 nr
+阿弟仔 3 nr
+阿弥光 3 nr
+阿弥陀 14 nr
+阿弥陀佛 357 ns
+阿律奴 2 nr
+阿得莱 2 nr
+阿得雷 8 nr
+阿德 12 nrt
+阿德儿 12 nr
+阿德利 2 nr
+阿德勒 8 nr
+阿德南 3 ns
+阿德尔 11 nr
+阿德拉 2 nr
+阿德斯 4 nr
+阿德福 2 nr
+阿德莱 2 nr
+阿德莱德 14 nrt
+阿德里 7 nr
+阿德里亚 6 nrt
+阿德里安 7 nrt
+阿德雷 6 nr
+阿德默勒尔蒂 2 nrt
+阿思哈 2 nr
+阿恩海姆 3 nr
+阿意取容 3 n
+阿慕尔 2 nr
+阿戈 4 nrt
+阿戈斯 11 nr
+阿戈斯蒂 4 nrt
+阿房 3 n
+阿房宫 92 nr
+阿房宫赋 12 nr
+阿房宫遗址 7 ns
+阿扎 4 nrt
+阿扎姆 4 nr
+阿扎尔 4 nr
+阿扎尼亚 8 ns
+阿托 12 nrt
+阿托卡夫 2 nrt
+阿托品 52 nr
+阿拉 277 nrt
+阿拉丁 11 nr
+阿拉伯 1860 nr
+阿拉伯人 590 nrt
+阿拉伯半岛 195 ns
+阿拉伯叙利亚共和国 3 ns
+阿拉伯国 7 ns
+阿拉伯国家联盟 10 nt
+阿拉伯国家首脑会议 2 nz
+阿拉伯地区 16 ns
+阿拉伯埃及共和国 6 ns
+阿拉伯塔 3 nrt
+阿拉伯复兴社会党 7 nt
+阿拉伯字 4 nz
+阿拉伯数 3 nz
+阿拉伯数字 39 nz
+阿拉伯文 78 nrt
+阿拉伯河 18 ns
+阿拉伯海 82 ns
+阿拉伯湾 5 ns
+阿拉伯糖 3 nr
+阿拉伯联 3 ns
+阿拉伯联合酋长国 61 ns
+阿拉伯联盟 12 ns
+阿拉伯胶 9 nz
+阿拉伯语 228 nz
+阿拉伯马格里布联盟 3 ns
+阿拉克 4 nrt
+阿拉加尔 3 ns
+阿拉吉 2 nr
+阿拉善 67 nr
+阿拉善右旗 6 ns
+阿拉善地区 5 ns
+阿拉善左旗 12 ns
+阿拉善旗 3 ns
+阿拉善盟 20 ns
+阿拉培 16 nr
+阿拉塔 7 nrt
+阿拉塔斯 2 nrt
+阿拉姆 4 nrt
+阿拉尔 7 nr
+阿拉尔市 3 ns
+阿拉山口 13 ns
+阿拉巴马 2 ns
+阿拉巴马州 7 ns
+阿拉布 22 nr
+阿拉弗 5 nr
+阿拉德 5 nrt
+阿拉戈 11 nr
+阿拉斯 5 nr
+阿拉斯加 228 nrt
+阿拉斯加州 34 ns
+阿拉斯河 4 ns
+阿拉曼 7 nr
+阿拉木图 106 ns
+阿拉木图宣言 7 nr
+阿拉杰 2 nr
+阿拉果 4 nr
+阿拉梅达 2 nrt
+阿拉比 7 nrt
+阿拉法 4 nr
+阿拉法特 123 nrt
+阿拉济 3 nr
+阿拉瓦 7 nrt
+阿拉真主 3 nr
+阿拉科 11 nr
+阿拉米 15 nrt
+阿拉维 12 nr
+阿拉蕾 3 nr
+阿拉贡 38 nr
+阿拉达 7 nr
+阿拉里克 9 nrt
+阿拔斯 95 nr
+阿拜 5 ns
+阿提卡 17 nr
+阿摩 5 nrt
+阿摩利 6 nr
+阿摩尔 4 nr
+阿摩尼亚 3 ns
+阿敏道 2 nr
+阿散蒂 30 nr
+阿斗 61 nr
+阿斯 102 nrt
+阿斯佩纳 2 nrt
+阿斯克 7 nr
+阿斯兰 3 nr
+阿斯利 10 nr
+阿斯利康 15 ns
+阿斯勒 2 nr
+阿斯匹林 28 nz
+阿斯哈 3 nrt
+阿斯哥 2 nr
+阿斯图里亚斯 13 nrt
+阿斯基 9 nr
+阿斯塔 3 nrt
+阿斯塔纳 8 nrt
+阿斯塔那 14 nrt
+阿斯奎 8 nr
+阿斯尔 2 nr
+阿斯巴 26 nr
+阿斯巴甜 3 nr
+阿斯帕 2 nr
+阿斯彭 2 nr
+阿斯托 4 nrt
+阿斯旺 45 nr
+阿斯普伦 9 nrt
+阿斯洛 14 nr
+阿斯洛克 4 nrt
+阿斯特 6 nrt
+阿斯特拉 6 nrt
+阿斯特拉公司 2 nt
+阿斯特拉罕 36 nrt
+阿斯特拉罕州 3 nrt
+阿斯王 16 nrt
+阿斯玛 3 nr
+阿斯科 44 nr
+阿斯科利 2 nrt
+阿斯第 16 nr
+阿斯纪 3 nr
+阿斯菇 3 nr
+阿斯顿 28 nr
+阿斯马拉 28 nrt
+阿方索 22 nr
+阿旃陀 21 n
+阿族 4 nz
+阿时趋俗 3 n
+阿旺新传 3 nr
+阿旺晋 3 nr
+阿旺晋美 12 nr
+阿旺罗 7 nr
+阿昌 13 ns
+阿昌族 288 nz
+阿昌语 3 nr
+阿明 24 nr
+阿明尼 6 nr
+阿是穴 9 i
+阿普列 4 nr
+阿普利 6 nr
+阿普利亚 5 ns
+阿普尔 4 nr
+阿普拉 7 nrt
+阿普斯 2 nr
+阿普歇 2 nr
+阿普雷 5 nr
+阿普顿 8 nr
+阿曼 536 nr
+阿曼尼 3 nr
+阿曼湾 31 ns
+阿曼苏丹国 16 ns
+阿曼队 3 nr
+阿月浑子 3 nr
+阿朗佐 4 nr
+阿木冬 2 nr
+阿木尔 2 nr
+阿木岗 2 nr
+阿木林 2 nr
+阿本德 2 nr
+阿本斯 6 nr
+阿札木 2 nr
+阿术 4 n
+阿术拉 3 nr
+阿术辅 2 nr
+阿术领 2 nr
+阿朱久 2 nr
+阿朱乔 3 nr
+阿朱伏 2 nr
+阿朱叹 5 nr
+阿朱喜 2 nr
+阿朱姊 3 nr
+阿朱房 2 nr
+阿朱笑 13 nr
+阿朱续 2 nr
+阿朱陪 2 nr
+阿李朵 2 nr
+阿杜尔 2 nrt
+阿杜德 9 nrt
+阿杜瓦 7 nrt
+阿来 12 nrt
+阿来克 3 nr
+阿林顿 3 nr
+阿柯河 2 nr
+阿根 22 ns
+阿根廷 964 nr
+阿根廷共和国 3 ns
+阿根廷政府 4 nt
+阿根廷海军 3 nt
+阿根廷港 9 ns
+阿根廷湖 3 ns
+阿根廷队 16 nt
+阿格 24 nrt
+阿格丽 2 nr
+阿格利 18 nr
+阿格尼 5 nr
+阿格布 138 nr
+阿格拉 13 nr
+阿格斯 3 nr
+阿格涅 2 nr
+阿格罗 2 nr
+阿格达 2 nr
+阿格里 9 nrt
+阿桂代 2 nr
+阿梅奥 3 nr
+阿森 2 nr
+阿森松岛 11 ns
+阿森纳 391 nr
+阿森纳队 35 nr
+阿歇特 3 nr
+阿母河 14 nr
+阿比 9 nrt
+阿比可糖 3 nr
+阿比托 4 nr
+阿比西尼亚 21 ns
+阿比让 53 nr
+阿比让市 2 ns
+阿毗地狱 3 ns
+阿汤哥 3 nr
+阿沅才 2 nr
+阿沙尔 2 nr
+阿河 3 ns
+阿治曼 4 nr
+阿法尔 21 nr
+阿法拉 3 nr
+阿波利 6 nr
+阿波利奈 4 nr
+阿波罗 243 nr
+阿波罗号 19 nz
+阿波美 6 nr
+阿波菲 4 nr
+阿泰斯 72 nr
+阿泰斯特 3 nrt
+阿洛夫 3 nr
+阿洛糖 3 nr
+阿洛菲 4 nr
+阿洛酮糖 3 n
+阿济 7 n
+阿济格 82 nr
+阿济赤 14 nr
+阿海 3 ns
+阿涅利 19 nr
+阿涅斯 2 nr
+阿灵阿 15 nr
+阿灵顿 9 nr
+阿炳会 3 nr
+阿炳半 2 nr
+阿炳叫 2 nr
+阿炳听 7 nr
+阿炳呵 2 nr
+阿炳如 3 nr
+阿炳妈 111 nr
+阿炳家 4 nr
+阿炳扶 6 nr
+阿炳抢 3 nr
+阿炳抱 2 nr
+阿炳拍 2 nr
+阿炳摸 3 nr
+阿炳曲 2 nr
+阿炳洗 2 nr
+阿炳猛 3 nr
+阿炳现 2 nr
+阿炳真 2 nr
+阿炳赢 3 nr
+阿炳进 5 nr
+阿炳递 2 nr
+阿炳除 2 nr
+阿炳马 3 nr
+阿爷 10 nr
+阿爸 35 n
+阿爹 23 nr
+阿片 12 n
+阿片类 20 nz
+阿片肽 4 nz
+阿牛哥 3 nr
+阿物儿 3 nr
+阿特 28 nrt
+阿特兰蒂斯 5 nrt
+阿特利 4 nr
+阿特塔 2 nr
+阿特巴拉河 12 ns
+阿特拉 12 nrt
+阿特拉斯 74 nrt
+阿特金 3 nr
+阿狗 3 nr
+阿狗阿猫 3 nr
+阿猫 2 nr
+阿猫妈 2 nr
+阿猫阿狗 14 nr
+阿玉奇 6 nr
+阿玛临 3 nr
+阿玛会 3 nr
+阿玛发 2 nr
+阿玛可 2 nr
+阿玛图 4 nr
+阿玛尼 20 nr
+阿玛求 2 nr
+阿玛赐 4 nr
+阿玛雅 2 nr
+阿琳 6 nrt
+阿琼主 3 nr
+阿瑞斯 11 nr
+阿瑞纳斯 5 nr
+阿瑟 43 nrt
+阿瑟尔 3 nrt
+阿瑟斯 3 nrt
+阿瓜维 2 nr
+阿瓦 44 nrt
+阿瓦士 8 nr
+阿瓦尔 23 nr
+阿瓦尔泽德 2 ns
+阿瓦提 2 nr
+阿瓦提县 6 ns
+阿瓦斯 2 nr
+阿瓦朗 2 nr
+阿瓦鲁 3 nr
+阿甘正传 3 nr
+阿留申 80 nr
+阿登 30 nrt
+阿登纳 10 nr
+阿的平 3 ns
+阿的江 5 ns
+阿皮亚 4 nr
+阿皮佩 3 nr
+阿盟 53 ns
+阿睦尔撒纳 25 nr
+阿碧二 4 nr
+阿碧叹 2 nr
+阿碧听 2 nr
+阿碧好 2 nr
+阿碧姊 7 nr
+阿碧微微 2 nr
+阿碧忍 2 nr
+阿碧忙 4 nr
+阿碧抿 2 nr
+阿碧柔 2 nr
+阿碧站 2 nr
+阿碧笑 9 nr
+阿碧自 2 nr
+阿碧见 2 nr
+阿礼国 3 nr
+阿福道 2 nr
+阿禾姆 2 nr
+阿科斯塔 3 nrt
+阿科松博 4 nr
+阿穆尔 23 nr
+阿穆尔州 4 ns
+阿穆尔河 42 ns
+阿穆达 2 nr
+阿空加瓜 3 ns
+阿空加瓜山 6 ns
+阿童木 3 nr
+阿米 21 nrt
+阿米塔奇 3 nrt
+阿米尔 2 nr
+阿米巴 52 nrt
+阿米巴病 5 nr
+阿糖胞苷 3 n
+阿紫之 2 nr
+阿紫又 2 nr
+阿紫取 2 nr
+阿紫口 2 nr
+阿紫叹 4 nr
+阿紫听 7 nr
+阿紫喜 4 nr
+阿紫嘟 5 nr
+阿紫嘻 2 nr
+阿紫奇 4 nr
+阿紫妹妹 2 nr
+阿紫射 2 nr
+阿紫尖 2 nr
+阿紫微微 5 nr
+阿紫心 4 nr
+阿紫怒 4 nr
+阿紫扁 4 nr
+阿紫抢 3 nr
+阿紫抿 2 nr
+阿紫服 4 nr
+阿紫格 9 nr
+阿紫格格 2 nr
+阿紫正 4 nr
+阿紫笑 41 nr
+阿紫见 3 nr
+阿紫觉 2 nr
+阿紫言 2 nr
+阿紫顿 2 nr
+阿约 3 ns
+阿纳多卢 2 nrt
+阿纳姆 8 nr
+阿纳托利 6 nrt
+阿纳托尔 3 nrt
+阿绣提 2 nr
+阿绣教 2 nr
+阿绣肯 3 nr
+阿维亚诺 4 nrt
+阿维兰热 2 nrt
+阿维农 3 nr
+阿维勒 2 nr
+阿维安 2 nr
+阿维尼翁 26 ns
+阿维拉 3 nrt
+阿维斯 6 nr
+阿维森 2 nr
+阿维森纳 2 ns
+阿维莱斯 2 nrt
+阿维菌素 3 nz
+阿维阿 2 nr
+阿罗 27 nrt
+阿罗汉 11 ns
+阿罗约 23 ns
+阿罗罗 2 nr
+阿罗蒙 3 nr
+阿罗诃 3 nr
+阿美 13 ns
+阿美军 4 nr
+阿美利加 3 ns
+阿美士 6 nr
+阿美族 3 nr
+阿美玲 3 nr
+阿美莉 2 nr
+阿耳发 3 nr
+阿耳戈 2 nr
+阿耶桑 2 nr
+阿耶波 23 nr
+阿联 3 ns
+阿联酋 138 ns
+阿肯色 9 nr
+阿肯色州 25 ns
+阿肯色河 6 ns
+阿育王 45 nr
+阿胶 52 n
+阿舍尔 2 nr
+阿舒拉 6 nr
+阿芙 27 nrt
+阿芙乐尔 2 nr
+阿苏 86 ns
+阿苏尔 10 nr
+阿苏山 5 ns
+阿荣旗 4 nr
+阿莫 2 nrt
+阿莫尔 2 nr
+阿莫斯 3 nrt
+阿莫西林 2 nrt
+阿莫鲁 6 nr
+阿莫鲁索 3 nrt
+阿莱克 6 nr
+阿莱克斯 3 nrt
+阿莱城 2 nr
+阿莱夫 2 nr
+阿莱奇 2 nr
+阿莱姆 2 nr
+阿莱尼亚 3 ns
+阿莱曼 17 nr
+阿莱汉 2 nr
+阿莱科斯 2 nrt
+阿莱维 3 nr
+阿莱赫 2 nr
+阿莲 12 nr
+阿菲 4 nrt
+阿萍奶奶 5 nr
+阿萍问 2 nr
+阿萨 7 ns
+阿萨伊 3 nr
+阿萨伊果 3 ns
+阿萨勒 6 nr
+阿萨姆 44 nr
+阿萨寄省 3 nr
+阿萨密 2 nr
+阿萨布 7 nr
+阿萨帕 2 nr
+阿萨德 27 nr
+阿萨息 2 nr
+阿蒂加斯 7 nrt
+阿蒂博尼特 3 nrt
+阿蒙 35 nr
+阿蒙森 14 nr
+阿蒙神 4 nr
+阿蒙霍 11 nr
+阿蕴庄 4 nr
+阿西 4 ns
+阿西夫 2 nr
+阿西尔 8 nr
+阿西恩 2 nr
+阿西河 3 ns
+阿西莫 3 nr
+阿西莫夫 3 nrt
+阿訇 90 n
+阿诈里 3 nz
+阿诗玛 27 nr
+阿诺 5 nr
+阿诺德 43 nr
+阿诺斯 77 nr
+阿诺新 4 nr
+阿诺河 2 nr
+阿谀 34 v
+阿谀取容 3 i
+阿谀奉承 31 i
+阿谀曲从 3 i
+阿谀苟合 3 i
+阿谀谄媚 3 i
+阿谀趋奉 3 v
+阿谀逢迎 6 i
+阿谢格 2 nr
+阿贝丁 2 nr
+阿贝尔 63 nr
+阿贝拉尔 3 nrt
+阿贝湖 2 nr
+阿贝特 3 nrt
+阿贺野 2 nr
+阿贾克 3 nr
+阿贾克斯 2 nr
+阿贾苏 3 nr
+阿赖斯 2 nr
+阿赖耶识 13 nr
+阿赛拜疆 3 ns
+阿赛洛 19 nr
+阿赞德 10 nr
+阿赫玛 4 nr
+阿赫罗梅耶夫 3 nrt
+阿赫迈德 10 nrt
+阿赫默 3 nr
+阿达姆 3 nr
+阿达姆库斯 3 nrt
+阿达婆 2 nr
+阿达拉 8 nrt
+阿达米 2 nrt
+阿达纳 14 nr
+阿达莫夫 5 nrt
+阿达马 16 ns
+阿达马瓦 5 nrt
+阿迈勒 3 nrt
+阿连德 11 nr
+阿连特 3 nr
+阿迪力 3 nr
+阿迪斯 3 nr
+阿迪盖 4 nr
+阿迪达斯 39 nrt
+阿通社 6 nt
+阿速军 5 nr
+阿速卫 6 nr
+阿道夫 21 nr
+阿道尔 2 nr
+阿那 18 ns
+阿邦丹 2 nr
+阿部 12 n
+阿部宽 3 nr
+阿部规秀 7 nr
+阿里 726 nrt
+阿里亚 8 ns
+阿里亚娜 2 nrt
+阿里亚斯 6 nrt
+阿里什 8 nrt
+阿里卡 10 nrt
+阿里地区 33 ns
+阿里奥 4 nrt
+阿里安 18 nrt
+阿里山 54 ns
+阿里巴巴 82 nrt
+阿里巴巴公司 4 nt
+阿里斯 6 nrt
+阿里斯托 32 nrt
+阿里斯托夫 3 nrt
+阿里斯蒂德 15 nrt
+阿里斯顿 13 nrt
+阿里桑那 3 ns
+阿里汉 3 nr
+阿里汗 6 nr
+阿里河 7 ns
+阿里郎 4 nr
+阿里马 2 ns
+阿金 33 n
+阿金纳 6 nr
+阿钦斯 5 nr
+阿门 16 ns
+阿附 3 nrt
+阿陶罗 2 nr
+阿隆悉 2 nr
+阿隆神 2 nr
+阿隆索 25 nr
+阿难 3 nr
+阿雅克 3 nr
+阿雅克肖 5 nr
+阿雅尔 2 nr
+阿雯 4 nz
+阿雷佐 7 nr
+阿雷基帕 5 nrt
+阿雷格 16 nr
+阿雷格里港 6 ns
+阿雷瓦 3 nr
+阿雷瓦洛 3 nrt
+阿雷纳 14 nr
+阿雷纳斯 3 nrt
+阿霉素 45 n
+阿霍姆 2 nr
+阿非 12 ns
+阿非利 12 nr
+阿非利加 10 ns
+阿韦斯 2 nr
+阿音扎 3 nr
+阿音札鲁 2 nr
+阿顿 4 nrt
+阿飞 26 nr
+阿香先 2 nr
+阿香吓 2 nr
+阿香摇 2 nr
+阿香放 2 nr
+阿马 4 ns
+阿马多 3 nrt
+阿马尔 3 nr
+阿马拉 2 nrt
+阿马杜 5 nr
+阿马蒂 4 nr
+阿马里 2 nrt
+阿骗正传 3 n
+阿魏 4 nr
+阿魏酸 3 i
+阿鲁卡多 3 nrt
+阿鲁台 47 ns
+阿鲁威 2 nr
+阿鲁巴 22 nr
+阿鲁巴岛 7 ns
+阿鲁忽 25 nr
+阿鲁提亚 3 ns
+阿鲁沙 12 nr
+阿鲁浑 24 nr
+阿鲁温 2 nr
+阿鲁科尔沁旗 3 ns
+阿鲁纳 5 nr
+阿鲁西 3 ns
+阿鲁阿 2 nr
+阿默斯 7 nrt
+阿默栋 2 nr
+阿默达 6 nrt
+阿黛儿 6 nr
+阿鼻 18 nr
+阿鼻地狱 3 n
+阿齐兹 35 nr
+阿齐木 2 nr
+阿龙索 3 nr
+陀 1147 nrt
+陀枪师姐 3 n
+陀罗 88 nrt
+陀罗尼 23 nrt
+陀螺 202 n
+陀螺仪 79 n
+陁 2 zg
+陂 58 x
+陂塘 13 ns
+陂池 3 n
+陂湖禀量 3 vn
+陂陀 3 ns
+附 2664 v
+附上 40 f
+附上去 3 v
+附上来 3 f
+附上罔下 3 i
+附下罔上 3 i
+附中 291 f
+附丽 9 n
+附二 4 b
+附交 3 b
+附件 304 n
+附件栏 3 n
+附件炎 3 n
+附会 50 n
+附会穿凿 3 i
+附体 55 n
+附信 2 vn
+附光盘 3 n
+附册 3 v
+附凤攀龙 3 v
+附分 3 n
+附则 61 n
+附到 3 v
+附加 431 v
+附加值 117 n
+附加刑 23 n
+附加原子 3 n
+附加文件 2 n
+附加条件 3 n
+附加物 2 n
+附加码 3 n
+附加税 19 n
+附加系 3 n
+附加语 3 n
+附加费 75 n
+附加赛 35 n
+附势趋炎 3 n
+附匪 3 n
+附去 3 v
+附合 3 vn
+附后 3 f
+附启 3 v
+附和 277 v
+附图 18 n
+附图片 3 n
+附城镇 3 j
+附壁石 3 n
+附声吠影 3 i
+附声韵 3 n
+附子 38 n
+附小 30 b
+附属 987 b
+附属中学 3 n
+附属品 22 n
+附属国 40 n
+附属国民 3 n
+附属地 3 n
+附属小学 3 n
+附属性 2 b
+附属物 48 n
+附属绿地 3 n
+附属高级 3 b
+附带 209 n
+附带性 3 b
+附带条件 3 n
+附庸 85 n
+附庸国 21 n
+附庸风雅 23 i
+附录 174 v
+附影附声 3 i
+附得 3 v
+附息 126 b
+附息债 2 vn
+附成 3 v
+附托 3 v
+附控 3 b
+附文 3 n
+附有 235 b
+附来 3 f
+附案 3 n
+附档 3 b
+附款 3 n
+附此 3 d
+附注 63 v
+附炎趋热 3 n
+附点 3 n
+附爱 3 b
+附生 3 b
+附生植物 3 n
+附着 342 v
+附着力 15 n
+附着增加 3 i
+附着性 3 n
+附着点 2 n
+附着物 13 n
+附着龈 3 n
+附睾 61 n
+附睾炎 20 n
+附笔 5 n
+附籍 3 n
+附约 3 n
+附给 3 vn
+附置 3 vn
+附翼攀鳞 3 z
+附耳 69 n
+附耳低言 3 n
+附耳低语 3 n
+附耳射声 3 n
+附耳细谈 3 i
+附肢 64 n
+附肤落毛 3 n
+附膻逐腥 3 n
+附表 21 n
+附言 4 n
+附议 7 n
+附记 23 n
+附设 62 vn
+附识 3 n
+附赘县疣 3 n
+附赘悬疣 3 n
+附赘悬肬 3 nr
+附赠 3 v
+附赠品 3 n
+附起 3 v
+附足 3 v
+附身 3 v
+附载 6 b
+附近 8499 f
+附送 20 v
+附送品 3 n
+附逆 3 v
+附钱 3 v
+附院 4 n
+附随 3 v
+附面层 3 n
+附页 2 n
+附项 3 b
+附骥 3 n
+附骥名彰 3 i
+附骥彰名 3 vn
+附骥攀鳞 3 z
+附骥攀鸿 3 nz
+际 1131 ng
+际会 13 n
+际会风云 3 n
+际地蟠天 3 z
+际涯 3 n
+际网路 4 n
+际遇 94 n
+际遇风云 3 n
+陆 2144 nr
+陆万龄 8 nr
+陆上 509 s
+陆上运输 3 l
+陆丰 89 nr
+陆丰县 4 ns
+陆丰市 3 ns
+陆丹蒙 2 nr
+陆乘风 70 nr
+陆九渊 47 nr
+陆书 2 n
+陆二人 6 nr
+陆二娘 44 nr
+陆亿良 2 nr
+陆伯言 7 nr
+陆侃如 2 nr
+陆俨少 3 v
+陆修静 10 nr
+陆健叹 2 nr
+陆健笑 3 nr
+陆元九 4 nr
+陆元盛 3 nr
+陆先生 55 nr
+陆公子 9 nr
+陆兼运 2 nr
+陆军 3253 nr
+陆军上校 3 nt
+陆军中尉 3 nr
+陆军军官 3 nr
+陆军医院 3 nt
+陆军大学 281 nt
+陆军学院 3 nt
+陆军官校 3 nr
+陆军师 34 nr
+陆军总部 3 nt
+陆军省 6 nr
+陆军航空兵 60 nt
+陆军营 3 nr
+陆军部 50 nt
+陆冠英 272 nr
+陆凉州 7 nr
+陆凤仪 2 nr
+陆刃波 6 nr
+陆剑民 3 nr
+陆半球 3 n
+陆卖婆 41 nr
+陆博飞 30 nr
+陆口之 2 nr
+陆口守 2 nr
+陆口寨 2 nr
+陆台 11 n
+陆启贤 4 nr
+陆和领 3 nr
+陆地 1110 n
+陆地区 5 ns
+陆地卫星 3 nr
+陆地棉 4 j
+陆均松 11 nr
+陆块 3 n
+陆坡 14 nr
+陆城侯 4 nr
+陆域 23 n
+陆埠镇 2 nr
+陆基 100 nr
+陆基型 4 nr
+陆基核 2 nr
+陆士衡 2 nr
+陆壳 18 n
+陆大人 2 nr
+陆大哥 18 nr
+陆大有 116 nr
+陆天抒 35 nr
+陆天明 2 nr
+陆太太 3 nr
+陆夫人 6 nr
+陆奥君 2 nr
+陆奥宗 55 nr
+陆奥皱 2 nr
+陆姑娘 7 nr
+陆委会 21 nt
+陆子冈 11 nr
+陆子刚 2 nr
+陆子网 3 nr
+陆子静 2 nr
+陆孝彭 5 nr
+陆学 3 n
+陆学善 3 nr
+陆学艺 2 nr
+陆定 19 d
+陆定一 20 nr
+陆宣公 6 nr
+陆家 16 n
+陆家嘴 38 nr
+陆家嘴金融贸易区 5 n
+陆家堰 20 nr
+陆家庄 56 nr
+陆家湾 2 nr
+陆家满 2 nr
+陆家炳 20 nr
+陆家羲 8 nr
+陆封型 3 nr
+陆将军 2 nr
+陆小四 4 nr
+陆小姐 3 nr
+陆小曼 3 nr
+陆小艺 124 nr
+陆小芬 3 nr
+陆少鹏 2 nr
+陆尔奎 2 nr
+陆展元 37 nr
+陆峻岭 3 nr
+陆川 94 nr
+陆川县 3 ns
+陆师伯 2 nr
+陆师兄 4 nr
+陆师叔 5 nr
+陆师弟 12 nr
+陆希荣 207 nr
+陆平原 2 ns
+陆平和 2 nr
+陆平撑 2 nr
+陆平梳 2 nr
+陆幸生 4 nr
+陆庄主 131 nr
+陆府 4 n
+陆建华 2 nr
+陆建瀛 2 nr
+陆强华 3 nr
+陆征祥 7 nr
+陆徵祥 5 nr
+陆德明 4 nr
+陆德景 2 nr
+陆心 8 n
+陆心源 7 nr
+陆心贤 22 nr
+陆志勇 3 nr
+陆志韦 8 nr
+陆思博 4 nr
+陆性 2 n
+陆悦农 36 nr
+陆战 173 n
+陆战队 153 nt
+陆承业 36 nr
+陆承伟 210 nr
+陆承志 14 nr
+陆承祖 2 nr
+陆抗卒 2 nr
+陆抗死 3 nr
+陆探微 14 nr
+陆攻队 3 n
+陆放翁 11 nr
+陆敏厚 2 nr
+陆文军 3 nr
+陆文夫 3 nr
+陆文康 5 nr
+陆无双 859 nr
+陆日升 3 nr
+陆春龄 5 nr
+陆景 2 n
+陆机 25 n
+陆权 3 n
+陆林达 2 nr
+陆架 28 n
+陆标 4 n
+陆树德 38 nr
+陆树铭 3 nr
+陆栖 38 nr
+陆栖动物 7 l
+陆栖性 3 nr
+陆核区 2 n
+陆桥 26 nr
+陆梦龙 4 nr
+陆棚 8 n
+陆步轩 3 nr
+陆氏妙 2 nr
+陆氏茶 2 nr
+陆水根 2 nr
+陆沉 18 nr
+陆河 3 nr
+陆河县 3 ns
+陆治 2 n
+陆法言 3 nr
+陆海 44 ns
+陆海军 60 nr
+陆海大战 3 nz
+陆海大餐 3 l
+陆海潘江 3 nr
+陆海祜 5 nr
+陆海空 101 nr
+陆海空三 3 nr
+陆海空军 52 nt
+陆海荣 14 nr
+陆清河 2 nr
+陆游 620 n
+陆源 19 n
+陆澄源 2 nr
+陆炳兄 3 nr
+陆炳来 2 nr
+陆煌 2 ns
+陆王心 9 nr
+陆琼琼 2 nr
+陆生 93 nr
+陆生动物 3 n
+陆界 2 n
+陆疆 2 ns
+陆相 82 d
+陆相沉积 28 l
+陆真腊 7 nr
+陆离 4 n
+陆离光怪 3 nr
+陆离斑驳 3 l
+陆秀夫 33 nr
+陆程 5 n
+陆稻 3 n
+陆空大战 3 nz
+陆立鼎 123 nr
+陆站 4 n
+陆管处 3 n
+陆红军 10 nr
+陆纯初 37 nr
+陆终 5 d
+陆绩 6 n
+陆续 2153 d
+陆缘冰 5 nr
+陆缘地 2 n
+陆羽 342 nr
+陆耕水 2 nr
+陆肚 3 ns
+陆胡理 92 nr
+陆自和 2 nrfg
+陆航 34 j
+陆航团 16 nt
+陆良 2 nr
+陆良县 2 nr
+陆荣廷 30 nr
+陆菲青 496 nr
+陆虞候 37 nr
+陆行 3 n
+陆表 3 n
+陆詟水栗 3 v
+陆谷孙 2 nr
+陆费逵 8 nr
+陆贻吉 3 nr
+陆路 306 n
+陆运 56 n
+陆运费 3 n
+陆连岛 3 nr
+陆逊之 11 nr
+陆逊入 2 nr
+陆逊子 2 nr
+陆逊营 2 nr
+陆逊见 3 nr
+陆道培 2 nr
+陆金 2 n
+陆金强 4 nr
+陆金海 3 nr
+陆铁琳 2 nr
+陆镜若 5 nr
+陆长守 2 nr
+陆门何 6 nr
+陆间海 9 nr
+陆防 16 n
+陆防区 3 n
+陆阳清 4 nr
+陆阿果 5 nr
+陆陆 9 n
+陆陆续续 62 n
+陆雄文 2 nr
+陆雅池 3 nr
+陆震声 3 nr
+陆震天 91 nr
+陆面蒸发 3 nz
+陆风 18 nr
+陆高止 11 nr
+陆高轩 148 nr
+陆鸿渐 7 nr
+陆鼎立 3 nr
+陆龙卷 5 nr
+陆龟 4 nr
+陆龟科 2 nr
+陆龟蒙 21 nr
+陇 259 ns
+陇上 3 ns
+陇东 54 ns
+陇亩 3 n
+陇剧 3 n
+陇南 32 ns
+陇南地区 2 ns
+陇县 15 ns
+陇右 88 nrt
+陇头音信 3 nz
+陇山 3 ns
+陇川 11 ns
+陇川县 3 ns
+陇州 3 ns
+陇海 6 ns
+陇海线 16 nz
+陇海路 7 ns
+陇海铁路 68 nz
+陇西 136 ns
+陇西县 2 ns
+陇西高原 3 ns
+陈 5608 nr
+陈一方 3 nr
+陈一舟 3 nr
+陈一鸣 2 nr
+陈七师 2 nr
+陈万志 6 nr
+陈万里 2 nr
+陈万雷 3 nr
+陈三和 2 nr
+陈三立 10 nr
+陈三谟 10 nr
+陈与义 8 nr
+陈与郊 2 nr
+陈丕显 514 nr
+陈世团 2 nr
+陈世安 2 nr
+陈世松 2 nr
+陈世温 3 nr
+陈世美 278 nr
+陈世骧 10 nr
+陈东则 2 nr
+陈东升 256 nr
+陈东同 2 nr
+陈东林 4 nr
+陈东梅 3 nr
+陈东阳 27 nr
+陈丞相 2 nr
+陈中伟 8 nr
+陈丹华 4 nr
+陈丹青 33 nr
+陈丽丽 3 nr
+陈丽华 2 nr
+陈丽卿 3 nr
+陈丽娜 5 nr
+陈丽峰 3 nr
+陈丽萍 2 nr
+陈久仁 7 nr
+陈久明 3 nr
+陈久金 2 nr
+陈久霖 3 nr
+陈义勇 2 nr
+陈义甚高 3 nr
+陈之佛 7 nr
+陈之制 2 nr
+陈之才 22 nr
+陈之罡 2 nr
+陈乐亮 2 nr
+陈乐融 3 nr
+陈乐阳 3 nr
+陈乔年 128 nr
+陈乔恩 3 nr
+陈九如 2 nr
+陈书记 2 nr
+陈书长 35 nr
+陈予新 3 nr
+陈二人 10 nr
+陈二湖 98 nr
+陈二爷 2 nr
+陈于廷 3 nr
+陈云 293 nr
+陈云岗 3 nr
+陈云峰 9 nr
+陈云林 6 nr
+陈云裳 3 nr
+陈云龙 2 nr
+陈五事 2 nr
+陈亚兰 3 nr
+陈亚平 2 nr
+陈亮集 3 nr
+陈介祺 9 nr
+陈仓 36 nr
+陈仓城 8 nr
+陈仓道 5 nr
+陈仙梅 3 nr
+陈代梁 3 nr
+陈代荣 12 nr
+陈令勤 2 nr
+陈以勤 21 nr
+陈以心 3 nr
+陈仲举 2 nr
+陈仲安 22 nr
+陈仲才 4 nr
+陈仲良 2 nr
+陈伐吴 3 nr
+陈伟斯 4 nr
+陈伟明 3 nr
+陈伟荣 2 nr
+陈传康 2 nr
+陈伯之 5 nr
+陈伯华 3 nr
+陈伯吹 8 nr
+陈伯玉 2 nr
+陈伯荣 2 nr
+陈伯达 179 nr
+陈佐湟 4 nr
+陈体强 2 nr
+陈作新 3 nr
+陈佩斯 7 nr
+陈佩珊 3 ns
+陈佩秋 4 nr
+陈佳洱 3 n
+陈佳荣 3 nr
+陈佳贵 256 nr
+陈侯午 2 nr
+陈俊卿 2 nr
+陈俊杰 3 nr
+陈俊生 20 nr
+陈俐同 7 nr
+陈修园 8 nr
+陈修边 3 nr
+陈健斌 3 nr
+陈健民 3 nr
+陈健锋 3 nr
+陈傅良 9 nr
+陈元晖 3 nr
+陈元靓 6 nr
+陈元龙 5 nr
+陈兄弟 4 nr
+陈先义 3 nr
+陈先奎 7 nr
+陈先生 32 nr
+陈光培 2 nr
+陈光大 4 nr
+陈光崇 4 nr
+陈光明 2 nr
+陈光毅 2 nr
+陈光甫 4 nr
+陈光蕊 14 nr
+陈光远 7 nr
+陈克恢 2 nr
+陈克然 3 nr
+陈公博 60 nr
+陈公培 3 nr
+陈公子 23 nr
+陈公陶 2 nr
+陈六弟 4 nr
+陈兰皋 3 nr
+陈关保 5 nr
+陈兴才 2 nr
+陈兴瑜 256 nr
+陈兴良 4 nr
+陈兴贵 5 nr
+陈兵 32 nr
+陈其事 2 nr
+陈其尤 4 nr
+陈其瑗 2 nr
+陈其美 22 nr
+陈再教 2 nr
+陈再良 14 nr
+陈再道 261 nr
+陈军森 3 nr
+陈冠宇 3 nr
+陈冠希 2 nr
+陈冠蒲 3 nr
+陈冬尧 2 nr
+陈冬梅 4 nr
+陈冲 42 nr
+陈冲之 22 nrfg
+陈凌孚 3 nr
+陈凤桐 2 nr
+陈凯南 8 nr
+陈凯歌 29 nr
+陈列 665 nr
+陈列品 15 nr
+陈列室 63 nr
+陈列架 3 nr
+陈列柜 7 nr
+陈列窗 3 nr
+陈列馆 88 nr
+陈刚毅 3 nr
+陈剑虹 2 nr
+陈剑飞 3 nr
+陈副将 2 nr
+陈力就列 3 nr
+陈加松 2 nr
+陈加玲 3 nr
+陈劭先 3 nr
+陈劲松 2 nr
+陈勋奇 3 nr
+陈化兰 4 nr
+陈化成 17 nr
+陈化粮 7 nr
+陈医师 2 nr
+陈医生 2 nr
+陈十思 3 nr
+陈十策 3 nr
+陈半丁 9 nr
+陈南梁 4 nr
+陈博士 4 nr
+陈卫东 5 nr
+陈卫星 2 nr
+陈去病 5 nr
+陈友仁 3 nr
+陈友定 7 nr
+陈友谅 870 nr
+陈叔宝 15 nr
+陈叔通 9 nr
+陈古刺今 3 nr
+陈古秋 5 nr
+陈可愿 5 nr
+陈可汗 3 nr
+陈可畏 7 nr
+陈可美 3 nr
+陈司翰 3 nr
+陈各代 3 nr
+陈吉余 2 nr
+陈名夏 217 nr
+陈后主 21 nr
+陈吏部 3 nr
+陈向东 2 nr
+陈向平 2 nr
+陈向阳 2 nr
+陈君石 9 nr
+陈启修 3 nr
+陈启泰 3 nr
+陈启源 13 nr
+陈吾德 15 nr
+陈周骅 2 nr
+陈咏霞 3 nrfg
+陈哲男 5 nr
+陈唐山 3 nr
+陈啸宏 9 nr
+陈善广 9 nr
+陈善闭邪 3 i
+陈喜文 6 nr
+陈嘉庚 30 nr
+陈嘉庚奖 3 nr
+陈嘉异 2 nr
+陈嘉玲 3 nr
+陈嘉辉 3 nr
+陈四益 2 nr
+陈国令 2 nr
+陈国公主 4 nr
+陈国典 3 nr
+陈国华 3 nr
+陈国发 32 nr
+陈国安 6 nr
+陈国年 2 nr
+陈国庆 3 nr
+陈国强 136 nr
+陈国志 3 nr
+陈国明 6 nr
+陈国栋 3 nr
+陈国潘 3 nr
+陈国灿 7 nr
+陈国琦 18 nr
+陈国符 2 nr
+陈国邦 3 nr
+陈圆圆 258 nr
+陈在竹 62 nr
+陈坚红 3 nr
+陈墨香 3 nr
+陈士奇 2 nr
+陈士英 2 nr
+陈复礼 4 nr
+陈复表 2 nr
+陈大人 13 nr
+陈大哥 16 nr
+陈大夫 2 nr
+陈大师 16 nr
+陈大庆 4 nr
+陈大方 20 nr
+陈大林 2 nr
+陈大毛 90 nr
+陈大民 256 nr
+陈大燮 2 nr
+陈大白 2 nr
+陈大鹏 6 nr
+陈大齐 4 nr
+陈天华 27 nr
+陈天国 3 nr
+陈天宇 3 nr
+陈天平 12 nr
+陈天桥 2 nr
+陈天湖 3 nr
+陈天陆 3 nr
+陈太后 38 nr
+陈太太 2 nr
+陈太尉 26 nr
+陈太监 3 nr
+陈夫人 72 nr
+陈奂生 4 nr
+陈奇猷 2 nr
+陈奇瑜 34 nr
+陈奎一 32 nr
+陈奎一一 5 nr
+陈奎元 2 nr
+陈女士 3 nr
+陈如为 3 nr
+陈妈妈 16 nr
+陈妙常 3 nr
+陈妙瑛 3 nr
+陈妙英 3 nr
+陈姑娘 7 nr
+陈娇 40 nr
+陈娟红 17 nrfg
+陈婆婆 2 nr
+陈婉雯 2 nr
+陈婷婷 3 nr
+陈嫣嫣 3 nr
+陈子善 2 nr
+陈子壮 6 nr
+陈子尧 2 nr
+陈子山 12 nr
+陈子建 2 nr
+陈子昂 24 nr
+陈子聪 3 nr
+陈子荷 9 nr
+陈子龙 27 nr
+陈孟祥 2 nr
+陈孤雁 4 nr
+陈学众 3 nr
+陈学刚 3 nr
+陈学希 3 nr
+陈守一 5 nr
+陈守建 3 nr
+陈守民 2 nr
+陈守维 2 nr
+陈安之 3 nr
+陈安琪 2 nr
+陈安邦 4 nr
+陈宏绪 2 nr
+陈宏范 3 nr
+陈宗兴 4 nr
+陈宗善 2 nr
+陈宗德 2 nr
+陈官屯 2 nr
+陈官庄 3 nr
+陈官权 2 nr
+陈定南 3 nr
+陈定生 23 nr
+陈宜张 3 nr
+陈宜瑜 259 nr
+陈宝光 4 nr
+陈宝初 4 nr
+陈宝国 3 nr
+陈宝山 2 nr
+陈宝柱 208 nr
+陈宝珠 3 nr
+陈宝琛 3 nr
+陈宝莲 3 nr
+陈实功 3 nr
+陈宣帝 7 nr
+陈宫之 3 nr
+陈宫引 2 nr
+陈宫来 2 nr
+陈家 77 nrfg
+陈家兴 5 nr
+陈家坪 2 nr
+陈家姐姐 5 nr
+陈家山 3 nr
+陈家峪 2 nr
+陈家庄 24 nr
+陈家彬 4 nrfg
+陈家徒 3 nr
+陈家易 2 nr
+陈家松 8 nr
+陈家沟 4 nr
+陈家洛 2087 nr
+陈家湖 256 nr
+陈家湾 16 nr
+陈家瑛 4 nr
+陈家祠 4 nr
+陈家秀 2 nr
+陈家花园 2 nr
+陈家荣 2 nr
+陈家铺 256 ns
+陈家骅 2 nr
+陈家鼎 2 nr
+陈寅恪 102 nrfg
+陈富忠 317 nr
+陈寺福 82 nr
+陈寿著 5 nr
+陈将军 14 nr
+陈将士 8 nr
+陈小二 6 nr
+陈小军 2 nr
+陈小奇 2 nr
+陈小姐 15 nr
+陈小宇 2 nr
+陈小官 10 nr
+陈小川 26 nr
+陈小春 3 nr
+陈小炮 160 nr
+陈小群 3 nr
+陈小艺 3 nr
+陈小芬 6 nr
+陈少华 3 nr
+陈少春 3 nr
+陈少泽 3 nr
+陈少白 19 nr
+陈少霞 3 nr
+陈尔寿 2 nr
+陈尔翼 14 nr
+陈尚书 5 nr
+陈尚君 3 nr
+陈尚实 3 nr
+陈尚智 2 nr
+陈尧叟 2 nr
+陈履安 2 nr
+陈履生 128 nr
+陈山葱 3 nr
+陈岱孙 5 nrfg
+陈岳云 8 nr
+陈峰玖 2 nr
+陈崇荣 3 nr
+陈川平 2 nr
+陈巨源 7 nr
+陈巴尔虎旗 5 nr
+陈币桥 256 nr
+陈市长 2 nr
+陈布雷 10 nr
+陈师兄 2 nr
+陈师姊 2 nr
+陈师曾 3 nr
+陈师道 11 nr
+陈师鞠旅 3 nr
+陈希光 3 nr
+陈希同 16 nr
+陈希滔 2 nr
+陈希烈 6 nr
+陈平之 4 nr
+陈平亦 2 nr
+陈平归 2 nr
+陈平才 2 nr
+陈平曾 3 nr
+陈平生 2 nr
+陈平西 4 nr
+陈平重 7 nr
+陈年 109 nr
+陈年老账 3 n
+陈年老辞 3 nr
+陈年老酒 3 nr
+陈广庭 4 nr
+陈广文 2 nr
+陈庄乡 3 nr
+陈庄揽 3 nr
+陈庄搭 2 nr
+陈庆之 6 nr
+陈庆新 3 nr
+陈庆朝 4 nr
+陈庆瑜 11 nr
+陈庆祥 3 nr
+陈序经 19 nr
+陈应凤 75 nr
+陈应安 4 nr
+陈府尹 5 nr
+陈庭威 3 nr
+陈廉伯 11 nr
+陈廷敬 7 nr
+陈廷焯 4 nr
+陈建仁 4 nr
+陈建军 3 nr
+陈建力 5 nr
+陈建功 19 nr
+陈建华 3 nr
+陈建国 3 nr
+陈建宁 3 nr
+陈建州 3 nr
+陈建平 3 nr
+陈建年 3 nr
+陈建彬 3 nrfg
+陈建斌 3 nr
+陈建民 3 nr
+陈建生 256 nr
+陈开心 3 nr
+陈式引 2 nr
+陈式来 2 nr
+陈彦祺 4 nr
+陈彦行 3 nr
+陈彦衡 5 nr
+陈徐陵 3 nr
+陈得才 3 nr
+陈德娃 3 nr
+陈德容 3 nr
+陈德恩 3 nr
+陈德生 2 nr
+陈德良 2 nr
+陈德蓉 3 nr
+陈德铭 3 nr
+陈德霖 6 nr
+陈德高 36 nr
+陈志刚 3 nr
+陈志南 2 nr
+陈志强 3 nr
+陈志斌 12 nr
+陈志新 2 nr
+陈志明 3 nr
+陈志朋 3 nr
+陈志梁 9 nr
+陈志益 2 nr
+陈志远 3 nr
+陈忠华 3 nr
+陈忠和 7 nr
+陈忠实 4 nr
+陈忠文 2 nr
+陈忠阳 2 nr
+陈怀生 2 nr
+陈思佳 3 nr
+陈思兵 9 nr
+陈思和 4 nr
+陈思思 9 nr
+陈思慧 3 nr
+陈思成 3 nr
+陈思王 3 nr
+陈思珍 2 nr
+陈思璇 3 nr
+陈怡蓉 3 nr
+陈总兵 10 nr
+陈总舵 108 nr
+陈恒六 9 nr
+陈恒玲 3 nr
+陈恩凤 2 nr
+陈恭善 2 nr
+陈恭尹 3 nr
+陈恭澍 8 nr
+陈情表 3 nr
+陈惠敏 3 nr
+陈惠文 4 nr
+陈惠明 3 nr
+陈惠良 3 nr
+陈慕华 13 nr
+陈慧仪 3 nr
+陈慧增 3 nr
+陈慧姗 3 nr
+陈慧娴 3 nr
+陈慧平 3 nr
+陈慧明 3 nr
+陈慧珊 3 ns
+陈慧琳 5 nr
+陈懋恒 2 nr
+陈抒怡 2 i
+陈抚台 4 nr
+陈振兴 4 nr
+陈振华 2 nr
+陈振孙 4 nr
+陈振炎 4 nr
+陈捷先 3 nr
+陈捷文 3 nr
+陈掌公 8 nr
+陈掌柜 9 nr
+陈掌爷 4 nr
+陈揖怀 92 nr
+陈撄宁 6 nr
+陈政委 279 nr
+陈政高 3 nr
+陈敏之 3 nr
+陈敏乘 3 nr
+陈敏任 3 nr
+陈敏儿 3 nr
+陈敏华 2 nr
+陈敏章 5 nr
+陈散原 4 nr
+陈敬儒 2 nr
+陈敬夫 2 nr
+陈敬考 3 nr
+陈文坚 3 nr
+陈文媛 3 nr
+陈文帝 3 nr
+陈文洪 606 nr
+陈文灯 4 nr
+陈文登 12 nr
+陈文英 52 nr
+陈文茜 3 nr
+陈文辉 2 nr
+陈文鸿 2 nr
+陈新华 3 nr
+陈新欣 2 nr
+陈新民 2 nr
+陈新甲 254 nr
+陈方垣 3 nr
+陈方策 12 nr
+陈无择 2 nr
+陈日君 3 nr
+陈旧 327 nr
+陈旧不堪 3 i
+陈旧性 8 nr
+陈旧观念 3 n
+陈旭东 30 nr
+陈旭军 2 nr
+陈旭麓 6 nr
+陈昊苏 3 nr
+陈昌君 5 nr
+陈昌智 258 nr
+陈昌本 9 nr
+陈昌浩 21 nr
+陈明义 3 nr
+陈明仁 8 nr
+陈明君 3 nr
+陈明振 4 nr
+陈明智 3 nr
+陈明真 3 nr
+陈明辉 6 nr
+陈明远 2 nr
+陈星唱 3 nr
+陈星星 2 nr
+陈星灿 6 nr
+陈星陈 2 nr
+陈春园 4 nr
+陈春生 3 nr
+陈春舫 2 nr
+陈春艳 2 nr
+陈春辉 2 nr
+陈昭亮 4 nr
+陈昭荣 3 nr
+陈晓东 2 nr
+陈晓伟 3 nr
+陈晓兰 47 nr
+陈晓彦 6 nr
+陈晓彬 2 nrfg
+陈晓旭 3 nr
+陈晓明 7 nr
+陈晓涛 9 nr
+陈晓红 9 nr
+陈晓钟 7 nr
+陈普文 2 nr
+陈景润 32 nr
+陈望祥 2 nr
+陈望道 11 nr
+陈木森 256 nr
+陈木胜 6 nr
+陈李济 3 nr
+陈村镇 3 nr
+陈杰锋 3 nr
+陈松伶 3 n
+陈松勇 3 nr
+陈松龄 3 nr
+陈林展 2 nr
+陈林朝 2 nr
+陈果夫 41 nr
+陈柏榕 3 nr
+陈柏霖 3 nr
+陈树人 8 nr
+陈树生 8 nr
+陈树铿 15 nr
+陈桥门 5 nr
+陈桥驿 18 nrfg
+陈梅曲 4 nr
+陈梅玲 2 nr
+陈梅馨 3 nr
+陈梦雷 2 nr
+陈植锷 2 nr
+陈楚然 2 nr
+陈欢松 3 nr
+陈正一 2 nr
+陈正德 184 nr
+陈正清 2 nr
+陈歪嘴 4 nr
+陈毅 362 nr
+陈毅任 7 nr
+陈毛弟 2 nr
+陈水扁 800 nr
+陈水敏 3 nr
+陈永仁 3 nr
+陈永华 24 nr
+陈永孝 18 nr
+陈永川 2 nr
+陈永强 27 nr
+陈永文 2 nr
+陈永明 60 nr
+陈永森 48 nr
+陈永正 6 nr
+陈永民 4 nr
+陈永福 212 nr
+陈永红 2 nr
+陈永贵 11 nr
+陈永霞 3 nr
+陈永龄 4 nr
+陈求发 10 nr
+陈汉忠 2 nr
+陈汉章 5 nr
+陈汝弼 6 nr
+陈汝斌 3 nr
+陈汤方 2 nr
+陈沸宇 3 nr
+陈沿其 2 nr
+陈泉官 3 nr
+陈法蓉 3 nr
+陈波儿 8 nr
+陈泯公 2 nr
+陈泰引 5 nr
+陈泽池 3 nr
+陈泽霖 2 nr
+陈洁仪 3 nr
+陈洪兄 2 nr
+陈洪兴 2 nr
+陈洪绶 13 nr
+陈洪范 7 nr
+陈洪进 5 nr
+陈洪铎 2 nr
+陈浩力 3 nr
+陈浩文 3 nr
+陈浩民 3 nr
+陈海宁 2 nr
+陈海恒 3 nr
+陈海玲 3 nr
+陈海翔 2 nr
+陈海龙 3 nr
+陈淑兰 3 nrfg
+陈淑芳 3 nrfg
+陈清华 2 nr
+陈清文 2 nr
+陈清泉 3 nr
+陈清泰 2 nr
+陈滋英 2 nr
+陈潜夫 4 nr
+陈潭秋 304 nr
+陈灏珠 2 nr
+陈灿荣 5 nr
+陈炯明 3 i
+陈炳德 3 nr
+陈烟桥 3 nr
+陈焕友 6 nr
+陈焕然 3 nr
+陈焕镛 2 nr
+陈熙京 3 nrfg
+陈燕燕 3 nr
+陈燕玲 2 nr
+陈燮阳 7 nr
+陈爱莲 7 nr
+陈犹龙 2 nr
+陈狄克 3 nr
+陈独秀 747 nr
+陈献章 3 nr
+陈玄奘 14 nr
+陈玄景 3 nr
+陈玄风 64 nr
+陈玉和 8 nr
+陈玉娘 3 nr
+陈玉成 22 nr
+陈玉文 4 nr
+陈玉杰 3 nr
+陈玉益 3 nr
+陈玉英 2 nr
+陈玉莲 3 nr
+陈玉辉 2 nr
+陈玉银 20 nr
+陈王庭 2 nr
+陈王廷 2 nr
+陈珊妮 3 nr
+陈珍艳 3 nr
+陈珏蓉 2 nr
+陈琪琪 3 nr
+陈瑞华 11 nr
+陈瑞如 2 nr
+陈璧君 7 i
+陈生弟 3 nr
+陈田鹤 2 nr
+陈甲亮 32 nr
+陈留南 2 nr
+陈留县 8 nr
+陈留尉 5 nr
+陈留王 21 nr
+陈留郡 3 nr
+陈留阮 2 nr
+陈癸尊 3 nr
+陈登往 2 nr
+陈白尘 14 nr
+陈白沙 4 nr
+陈白露 3 nr
+陈百史 10 nr
+陈百强 3 nr
+陈百炎 3 nr
+陈百祥 3 nr
+陈皇后 151 nr
+陈皮梅 2 nr
+陈相公 6 nr
+陈省身 22 nrfg
+陈眉之 2 nr
+陈眉公 2 nr
+陈眉抱 3 nr
+陈瞎子 684 nr
+陈石泉 2 nr
+陈硕真 3 nr
+陈碧铧 2 nr
+陈礼明 12 nr
+陈社康 2 nr
+陈祖义 35 nr
+陈祖德 21 nr
+陈祖武 27 nr
+陈祖甲 4 nr
+陈祖芬 11 nr
+陈祥兴 5 nr
+陈祥生 2 nr
+陈福今 18 nr
+陈福宝 2 nr
+陈福寿 7 nr
+陈福林 2 nr
+陈禹心 2 nr
+陈禹见 2 nr
+陈禹谟 3 nr
+陈秀丽 3 nr
+陈秀华 3 nr
+陈秀山 2 nr
+陈秀才 2 nr
+陈秀文 3 nr
+陈秀榕 256 nr
+陈秀环 3 nr
+陈秀珠 3 nr
+陈秋荣 2 nr
+陈秋霞 3 nr
+陈积银 3 nr
+陈称鸿 2 nr
+陈立中 3 nr
+陈立夫 41 nr
+陈立宏 2 nr
+陈立新 4 nr
+陈立波 3 nr
+陈立英 2 nr
+陈章良 260 nr
+陈素贞 2 nr
+陈素贤 2 nr
+陈紫函 3 nr
+陈红勇 5 nr
+陈纳德 11 nr
+陈绍伟 2 nr
+陈绍基 3 nr
+陈绍瑜 2 nr
+陈绍禹 3 nr
+陈绍馨 3 nr
+陈绍鹏 41 nr
+陈经理 4 nr
+陈经纶 3 nr
+陈继儒 9 nr
+陈继铭 3 nr
+陈继领 8 nr
+陈继龄 4 nr
+陈绪英 2 nr
+陈绮贞 3 nrfg
+陈维亚 3 nr
+陈维伟 14 nr
+陈维斌 4 nr
+陈维稷 2 nr
+陈美凤 3 nr
+陈美琪 3 nr
+陈翔华 4 nr
+陈翠婷 2 nr
+陈翰伯 2 nr
+陈翰笙 5 nr
+陈耀烨 16 nr
+陈耀邦 3 nr
+陈老丐 3 nr
+陈老先生 6 nr
+陈老大 7 nr
+陈老师 3 nr
+陈老总 3 nr
+陈老板 5 nr
+陈老爷 8 nr
+陈老爷子 9 nr
+陈联寿 21 nr
+陈肇敏 2 nr
+陈肖依 3 nr
+陈肖霞 2 nr
+陈育平 6 nr
+陈胖子 2 nr
+陈胜另 2 nr
+陈胜吴广 5 nr
+陈胜少 2 nr
+陈胜昌 6 nr
+陈胜王 2 nr
+陈胜自立 2 nrfg
+陈胜部 3 nr
+陈腐 52 nr
+陈腔滥调 3 i
+陈腔烂 2 nr
+陈自强 3 nrfg
+陈自昌 8 nrfg
+陈至立 12 nr
+陈舍娃 14 nr
+陈舵主 32 nr
+陈良宇 3 nr
+陈良弼 7 nr
+陈良臣 2 nr
+陈艳青 2 nr
+陈艺戈 256 nr
+陈芳允 5 nr
+陈芳听 2 nr
+陈芷箐 3 nr
+陈苑淇 3 nr
+陈若琳 9 nr
+陈英士 5 nr
+陈荒煤 5 nr
+陈荣捷 5 nr
+陈荣生 2 nr
+陈莉莉 3 nr
+陈莉莎 3 nr
+陈莎莉 3 nr
+陈莎莎 3 nr
+陈莹莲 3 nr
+陈薪伊 3 nr
+陈蝶仙 3 nr
+陈衍泰 4 nr
+陈被举 2 nr
+陈西滢 4 nr
+陈见飞 3 nr
+陈观泰 3 nr
+陈规 36 nr
+陈规陋习 6 i
+陈言务去 3 i
+陈言老套 3 nr
+陈言肤词 3 i
+陈警云 128 nr
+陈训秋 2 nr
+陈记室 2 nr
+陈设 443 nr
+陈词 44 nr
+陈词滥调 24 i
+陈诗启 4 nr
+陈诚任 5 nr
+陈诚系 2 nr
+陈说 41 nrfg
+陈谷子 2 nr
+陈谷子烂 3 nr
+陈谷子烂芝麻 5 i
+陈豫安 16 nr
+陈豫钟 3 nr
+陈贞慧 538 nr
+陈贤玲 2 nr
+陈贻范 3 nr
+陈超英 2 nr
+陈越香 2 nr
+陈辉光 2 nr
+陈辞滥调 3 i
+陈达海 196 nr
+陈迎松 3 nr
+陈运鹏 11 nr
+陈近南 436 nr
+陈进兴 5 nr
+陈进军 3 nr
+陈迪华 3 nr
+陈述 763 nr
+陈述句 10 n
+陈述彭 3 nr
+陈述者 3 nr
+陈迹 37 nr
+陈通筹 2 nr
+陈逢衡 3 nr
+陈逸生 3 nr
+陈逸达 3 nr
+陈逸飞 66 nr
+陈逸鸣 3 nr
+陈遇乾 3 nr
+陈道明 7 nr
+陈那之 2 nr
+陈那颜 4 nr
+陈邦柱 2 nr
+陈邦治 25 nr
+陈邦贤 3 nr
+陈郡长 3 nr
+陈郡阳 12 nr
+陈采南 2 nr
+陈重名 5 nr
+陈金刚 20 nr
+陈金武 2 nr
+陈金水 4 nr
+陈金钢 3 nr
+陈鉴胡 2 nr
+陈铁迪 3 nr
+陈锡文 2 nr
+陈锡联 268 nr
+陈锦华 3 nr
+陈锦鸿 3 nr
+陈键锋 3 nr
+陈镐民 12 nr
+陈镜开 6 nr
+陈镜泉 113 nr
+陈长庚 2 nr
+陈长文 3 nr
+陈长禄 8 nr
+陈长老 88 nr
+陈长蘅 4 nr
+陈闻晋 2 nr
+陈阿伯 17 nr
+陈阿娇 3 nr
+陈陆军 3 nr
+陈陈相因 7 nr
+陈院长 4 nr
+陈隆年 3 nr
+陈难先 256 nr
+陈雅伦 3 nr
+陈雅清 5 nr
+陈集双 19 nr
+陈雪飞 3 nr
+陈震宇 2 nr
+陈震雷 3 nr
+陈霸先 22 nr
+陈青云 3 nr
+陈颢庐 7 nr
+陈飞华 2 nr
+陈香主 22 nr
+陈香梅 10 nr
+陈骏涛 2 nr
+陈高华 22 nr
+陈高波 5 nr
+陈高祖 6 nr
+陈鲁豫 15 nr
+陈鲤庭 4 nr
+陈鸿寿 10 nr
+陈鸿源 2 nr
+陈鸿烈 3 nr
+陈鹏麟 4 nr
+陈鹤琴 6 nr
+陈鹤高 2 nr
+陈鼎常 2 nr
+陈龙川 5 nr
+陈龙灿 15 nr
+陈龙飞 27 nr
+陉 28 g
+陋 122 ag
+陋习 50 n
+陋俗 20 n
+陋室 10 n
+陋室铭 3 n
+陋屋 3 n
+陋巷 19 n
+陋巷箪瓢 3 nr
+陋见 3 n
+陋规 7 n
+陌 162 a
+陌上 15 s
+陌上归人 3 n
+陌上桑 3 n
+陌上陇间 3 vn
+陌生 818 n
+陌生人 316 n
+陌生化 3 n
+陌生客 3 n
+陌生感 20 n
+陌路 36 n
+降 6014 v
+降下 74 v
+降下去 3 v
+降下帷幕 3 n
+降下来 3 v
+降世 3 v
+降临 536 v
+降临到 3 i
+降为 3 v
+降于 3 v
+降价 636 n
+降价出售 3 n
+降价榜 3 n
+降价求售 3 n
+降价风 5 n
+降伏 43 v
+降低 4432 v
+降低利率 3 n
+降低功耗 2 n
+降低干扰 2 i
+降低库存 2 n
+降低成本 10 n
+降低标准 3 n
+降低法 3 n
+降低消耗 2 n
+降低生产 4 n
+降低要求 3 n
+降值 3 n
+降入 3 v
+降到 377 v
+降半旗 3 n
+降压 112 v
+降压法 3 n
+降压片 14 n
+降压药 48 n
+降去 3 v
+降县 3 n
+降变现象 3 n
+降号 3 n
+降噪 22 v
+降噪系数 3 n
+降回 3 v
+降回到 3 i
+降回去 3 i
+降回来 3 i
+降大任 3 n
+降好 3 v
+降妖 3 n
+降妖捉怪 3 i
+降妖除魔 3 n
+降妞 3 n
+降官 3 n
+降尊临卑 3 i
+降尊纡贵 3 nrfg
+降尘 5 n
+降幂 2 n
+降幅 107 n
+降序 3 n
+降得 3 v
+降心下气 3 n
+降心俯首 3 v
+降心相从 3 i
+降心顺俗 3 i
+降志辱身 3 n
+降息 33 n
+降成 3 v
+降挡 3 v
+降斜 3 v
+降旗 23 n
+降旗典礼 3 i
+降旗队 2 n
+降旨 3 n
+降暑 3 v
+降服 85 v
+降本 3 n
+降本增效 3 n
+降本流末 3 n
+降格 50 n
+降格以求 3 i
+降格相求 3 n
+降植烷 3 n
+降气 3 n
+降水 963 n
+降水区 8 n
+降水强度 3 n
+降水量 2660 n
+降法 3 n
+降温 226 n
+降温法 3 n
+降火 3 v
+降点 3 n
+降热 3 v
+降生 112 v
+降甾烷 3 nz
+降百元 3 n
+降福 3 v
+降糖 13 n
+降糖药 10 n
+降级 172 n
+降级运行 3 n
+降组 3 n
+降维法 3 n
+降耗 12 v
+降职 51 v
+降脂 3 n
+降脂药 3 n
+降自 3 v
+降至 3 v
+降落 648 v
+降落伞 122 n
+降落场 2 n
+降落点 3 n
+降落费 3 n
+降薪 3 n
+降血压 3 n
+降血糖 3 n
+降血脂 3 n
+降解 120 v
+降解塑料 5 n
+降调 4 v
+降贵纡尊 3 vn
+降赐 3 v
+降起 3 v
+降速 2 n
+降钙素 3 n
+降链条件 3 nz
+降错 3 v
+降附 3 v
+降降温 4 n
+降雨 244 n
+降雨带 3 n
+降雨量 333 n
+降雪 82 n
+降雪量 4 n
+降霜 3 n
+降顺 81 v
+降频 3 n
+降频扫描 3 n
+降颜屈体 3 i
+降香 18 n
+降魔 3 n
+降龙伏虎 18 i
+降龙十八掌 163 i
+限 2452 v
+限为 3 v
+限乘 3 v
+限于 886 v
+限产 2 v
+限产压库 3 n
+限产压锭 3 n
+限令 58 n
+限价 80 v
+限位 4 n
+限位器 3 n
+限值 9 n
+限制 5089 v
+限制住 3 v
+限制修饰 3 n
+限制器 3 n
+限制型 3 n
+限制性 97 n
+限制符 3 n
+限制级 3 n
+限制词 3 n
+限区 3 n
+限印 3 v
+限压阀 3 n
+限同性 3 n
+限员 3 n
+限定 429 v
+限定价格 3 n
+限定值 3 n
+限定性 3 n
+限定版 3 n
+限定符 4 n
+限定词 7 n
+限定量 3 n
+限定额 3 n
+限宽 3 v
+限幅 3 n
+限幅器 3 l
+限度 1231 n
+限异性 3 n
+限性 3 n
+限收 3 v
+限时 54 n
+限时专送 3 n
+限时信 3 nz
+限时批 3 v
+限明 3 v
+限期 304 n
+限期完成 3 l
+限次 4 n
+限止 3 v
+限武 3 n
+限武谈判 3 n
+限流 3 n
+限田 3 n
+限电 3 v
+限界 2 n
+限累模式 3 l
+限至 3 v
+限购 3 v
+限速 16 v
+限量 172 n
+限量供应 3 l
+限量版 3 v
+限额 369 n
+限高 3 v
+陔 8 g
+陕 625 ns
+陕人 3 ns
+陕北 705 ns
+陕北公学 13 nt
+陕北高原 9 ns
+陕北黄土高原 17 ns
+陕南 64 ns
+陕南战役 3 nz
+陕南秦巴山区 2 ns
+陕县 37 ns
+陕康 3 ns
+陕甘 220 j
+陕甘宁 81 ns
+陕甘宁边区 246 ns
+陕甘红军 2 j
+陕西 3091 ns
+陕西人 25 j
+陕西人民出版社 2 nt
+陕西历史博物馆 3 ns
+陕西国力 2 nt
+陕西梆子 2 n
+陕西汉 3 ns
+陕西省 1099 ns
+陕西省委 3 nt
+陕西省政府 4 nt
+陕西省旅游局 2 nt
+陕西省榆林地区 2 ns
+陕西省物价局 7 nt
+陕西省考古研究所 2 nt
+陕西籍 3 j
+陕西路 10 ns
+陗 27 zg
+陙 549 zg
+陛 289 n
+陛下 2326 n
+陞 5 zg
+陟 30 zg
+陟罚 3 i
+陟罚臧否 2 i
+陟降 3 i
+陡 768 a
+陡势 3 n
+陡变 3 v
+陡坡 114 ns
+陡增 29 v
+陡壁 292 n
+陡壁悬崖 3 n
+陡峭 278 a
+陡峻 72 a
+陡崖 58 n
+陡度 3 d
+陡河 13 ns
+陡然 471 d
+陡然升高 3 n
+陡然间 3 n
+陡直 6 d
+陡立 3 v
+陡起 3 v
+陡跌 3 v
+陡门 3 d
+院 6957 n
+院中 590 s
+院会 3 n
+院内 629 s
+院内外 2 s
+院刊 8 n
+院前 11 s
+院办 2 n
+院务 27 n
+院务部 3 n
+院区 3 n
+院团 3 n
+院团委 3 n
+院址 3 n
+院坝 4 n
+院墙 139 n
+院士 1642 n
+院外 3 s
+院子 2269 n
+院定 3 n
+院容 2 n
+院庆 6 n
+院所 30 n
+院方 58 n
+院本 40 n
+院校 4170 n
+院校体制 3 n
+院校所 9 n
+院校教育 3 n
+院校长 3 n
+院系 79 n
+院级 3 n
+院线 2 n
+院落 472 n
+院貌 3 n
+院辖 3 n
+院辖市 3 n
+院部 3 n
+院里 528 s
+院长 6397 n
+院长室 2 n
+院门 422 n
+陣 12 zg
+除 16316 p
+除不尽 3 l
+除丧 3 v
+除个别 3 n
+除了 7785 p
+除以 143 c
+除伐 3 v
+除冰 3 v
+除却 37 v
+除去 747 t
+除去物 3 l
+除名 45 v
+除味剂 3 nz
+除四害 3 l
+除垢 8 n
+除垢仪 3 i
+除垢器 3 i
+除夕 145 t
+除夕之夜 3 i
+除夕夜 32 t
+除外 640 c
+除夜 6 t
+除奸 3 v
+除奸革弊 3 l
+除妖 3 n
+除害 40 v
+除害兴利 3 nz
+除害灭病 3 n
+除少数 3 l
+除尘 34 n
+除尘器 11 nz
+除尽 3 v
+除开 31 v
+除异味 3 l
+除弊 6 v
+除役 3 nz
+除怪 3 v
+除息 35 v
+除息日 21 t
+除恶 33 v
+除恶务尽 14 i
+除恶务本 3 l
+除恶布新 3 i
+除患兴利 3 l
+除我之外 3 l
+除掉 244 v
+除数 19 n
+除数函数 3 l
+除数问题 3 l
+除斥 3 v
+除旧 11 v
+除旧布新 10 l
+除旧更新 4 i
+除旧迎新 3 l
+除暴 3 n
+除暴安良 16 i
+除杂 19 v
+除权 65 v
+除权日 5 l
+除权除息日 24 nz
+除根 11 nz
+除此 3 c
+除此之外 470 c
+除此以外 109 l
+除此外 12 c
+除此而外 33 c
+除残去秽 3 i
+除氧器 3 nz
+除油剂 3 nz
+除治 3 v
+除法 48 v
+除法器 2 l
+除法回路 3 l
+除涝 5 v
+除渣 2 nz
+除湿 53 v
+除湿机 3 l
+除湿量 3 l
+除溼 3 vn
+除溼机 3 vn
+除灾 3 v
+除狼得虎 3 l
+除甲醛 3 nz
+除疤 3 n
+除疾遗类 3 n
+除病 3 v
+除痘 3 nz
+除皱 3 nz
+除皱术 3 i
+除眼袋 3 l
+除砂 3 n
+除磁 3 nz
+除秽布新 3 i
+除籍 3 n
+除罪 3 v
+除臭 5 v
+除臭剂 2 n
+除臭药 3 l
+除草 53 nz
+除草人 3 n
+除草剂 110 nz
+除草机 3 nz
+除草醚 2 nz
+除莠菌素 3 v
+除莠霉素 3 v
+除虫 3 n
+除虫剂 3 n
+除虫菊 43 n
+除过 3 p
+除邪 3 v
+除邪惩恶 3 i
+除钙剂 3 n
+除铁 7 n
+除铁器 3 nz
+除锈 6 v
+除锈剂 3 nz
+除错 2 v
+除险 3 n
+除雪 5 n
+除雾器 2 l
+除霜 3 nz
+除霜机 3 nz
+除静电 3 nz
+除非 1098 c
+除非己莫为 20 i
+除颤 14 v
+除风湿 3 l
+除魔 3 n
+陧 10 x
+陨 132 n
+陨命 3 n
+陨星 48 n
+陨星学 3 n
+陨灭 3 v
+陨石 319 n
+陨石坑 19 n
+陨石雨 11 n
+陨硫铁 5 n
+陨落 40 n
+陨越 3 v
+陨身糜骨 3 z
+陨铁 27 n
+陨雹飞霜 3 nr
+陨首 3 n
+险 1733 a
+险乎 4 d
+险些 791 d
+险些儿 3 z
+险兆 3 n
+险关 12 n
+险别 3 d
+险区 3 n
+险固 3 a
+险堤 3 n
+险境 98 n
+险峰 28 n
+险峻 233 a
+险崖老林 3 n
+险工 4 n
+险弹 3 n
+险怪 3 a
+险恶 477 a
+险恶用心 3 l
+险情 161 n
+险招 3 n
+险棘 3 n
+险段 7 n
+险毒 3 n
+险滩 78 n
+险症 3 n
+险种 30 n
+险绝 5 a
+险胜 95 n
+险要 335 a
+险诈 15 a
+险谲 3 a
+险象 6 n
+险象环生 57 l
+险走光 3 n
+险路 3 n
+险遭 20 n
+险遭不测 3 v
+险遭毒手 3 v
+险阻 50 n
+险阻艰难 3 z
+险险 3 n
+险隘 9 a
+险韵 3 a
+陪 3654 v
+陪不是 3 v
+陪伴 425 n
+陪伴机理 3 n
+陪伴着 3 n
+陪住 3 v
+陪你到 3 l
+陪你去 3 l
+陪你玩 3 n
+陪你走 3 l
+陪侍 61 v
+陪出 3 v
+陪删 3 v
+陪到 3 v
+陪吃陪喝 3 n
+陪吊 3 v
+陪同 547 v
+陪同团 17 n
+陪哭 3 v
+陪夜 3 n
+陪嫁 141 v
+陪审 164 v
+陪审制 5 n
+陪审制度 3 n
+陪审员 288 n
+陪审团 57 n
+陪审席 16 n
+陪客 57 n
+陪小心 3 n
+陪床 3 v
+陪您 3 l
+陪我玩 3 n
+陪房 15 n
+陪护 12 v
+陪礼 3 v
+陪祭 3 v
+陪笑 3 v
+陪笑脸 7 l
+陪练 18 vn
+陪绑 4 v
+陪罪 3 v
+陪考 3 v
+陪聊 3 v
+陪臣 3 n
+陪葬 148 v
+陪葬品 75 n
+陪葬坑 8 n
+陪衬 37 v
+陪话 50 v
+陪读 35 v
+陪起 3 v
+陪起来 3 v
+陪送 17 v
+陪都 60 n
+陪酒 38 v
+陪酒女 3 n
+陪陪 3 v
+陪陵 3 n
+陬 29 g
+陯 4 zg
+陰 2 zg
+陲 18 g
+陳堵 3 vn
+陳禕 3 z
+陴 2 g
+陵 2855 ng
+陵云 3 ns
+陵劲淬砺 3 vn
+陵区 306 n
+陵县 49 ns
+陵园 110 n
+陵墓 693 n
+陵夷 3 ns
+陵寝 117 n
+陵川 16 ns
+陵川县 3 ns
+陵庙 6 ns
+陵替 3 n
+陵水 17 n
+陵水县 5 ns
+陵水黎族自治县 2 ns
+陵碑 3 n
+陵谷变迁 3 n
+陵谷沧桑 3 ns
+陵迟 7 v
+陵霄 3 n
+陶 734 nr
+陶世兄 8 nr
+陶世恩 3 nr
+陶业 21 n
+陶乐 2 nr
+陶乐县 2 nr
+陶云逵 2 nr
+陶仲历 3 nr
+陶仲文 8 nr
+陶伯泉 2 nr
+陶伯钧 258 nr
+陶作坊 5 n
+陶使君 2 nr
+陶侃卒 3 nr
+陶侍郎 3 nr
+陶俑 57 nr
+陶元信 2 nr
+陶全海 4 nr
+陶公府 3 nr
+陶共王 2 nr
+陶冶 146 nr
+陶冶性情 53 nr
+陶冶情操 3 nr
+陶制 24 n
+陶匠 3 n
+陶博会 2 nr
+陶叔蔚 4 nr
+陶吉吉 3 nr
+陶君薇 3 nr
+陶吧 2 n
+陶哲轩 16 nr
+陶唐氏 17 nr
+陶喆 3 vn
+陶器 1061 n
+陶器厂 4 n
+陶土 67 n
+陶土制品 3 n
+陶埙 5 n
+陶塑 24 n
+陶塑女 2 n
+陶大临 2 nr
+陶大宇 3 nr
+陶大镛 3 nr
+陶大顺 10 nr
+陶姊姊 2 nr
+陶子 3 n
+陶子安 107 nr
+陶宏开 3 nr
+陶宏景 3 nr
+陶宗仪 23 nr
+陶宗旺 12 nr
+陶宫娥 49 nr
+陶寨主 3 nr
+陶尔斐 6 nr
+陶履恭 3 nr
+陶峙岳 3 nr
+陶工 20 n
+陶师傅 3 nr
+陶希全 4 nr
+陶希圣 10 nr
+陶希夷 34 nr
+陶幸蓉 2 nr
+陶庵梦 4 nr
+陶式 12 n
+陶弘景 24 nr
+陶张辛 2 nr
+陶录 2 n
+陶得 2 v
+陶得二 2 nr
+陶德曼 2 nr
+陶志彭 3 nr
+陶忠信 7 nr
+陶恩顿 2 nr
+陶恭祖 5 nr
+陶情适性 3 n
+陶慧敏 3 nr
+陶成章 29 nr
+陶折腹 2 nr
+陶文钊 3 nr
+陶斋吉 2 nr
+陶方 54 n
+陶方身 3 nr
+陶明器 4 nr
+陶晋生 2 nr
+陶晶莹 14 nr
+陶朗加市 3 ns
+陶望卿 5 nr
+陶朱公 6 nr
+陶法阿 2 nr
+陶波湖 6 nr
+陶泽如 3 nr
+陶洛斯 5 nr
+陶渊明 96 nr
+陶源明 5 nr
+陶潜 20 nr
+陶澍改 2 nr
+陶然 18 nr
+陶然亭 35 nr
+陶然自得 3 l
+陶熔鼓铸 3 nr
+陶片 116 n
+陶犬瓦鸡 3 n
+陶玉玲 3 nr
+陶璐娜 2 nr
+陶瓦 2 nr
+陶瓮 3 n
+陶瓮口 4 nr
+陶瓶 3 n
+陶瓷 701 n
+陶瓷业 13 n
+陶瓷产品 3 n
+陶瓷修复 3 nr
+陶瓷制品 3 n
+陶瓷厂 5 n
+陶瓷原料 3 n
+陶瓷器 45 n
+陶瓷娃娃 3 nr
+陶瓷封装 3 n
+陶瓷工 3 nr
+陶瓷工业 3 n
+陶瓷工艺 3 n
+陶瓷材料 3 n
+陶瓷杯 3 n
+陶瓷烫 3 n
+陶瓷球 3 n
+陶瓷砖 3 nr
+陶瓷纤维 3 n
+陶瓷网 3 n
+陶瓷膜 3 n
+陶瓷餐具 3 n
+陶百岁 3 nr
+陶盆 4 n
+陶砚 2 nr
+陶社兰 9 nr
+陶笛 3 nr
+陶管 3 n
+陶粒 2 n
+陶系 2 n
+陶系灰 9 nr
+陶红英 105 nr
+陶缸 3 n
+陶罐 54 n
+陶老者 3 nr
+陶者 33 n
+陶胎 3 n
+陶艺 14 n
+陶艺品 3 n
+陶艺家 3 n
+陶芬家族 2 nr
+陶苗 3 n
+陶莉萍 3 nr
+陶菲克 163 nr
+陶菲格 3 nr
+陶蒙华 4 nr
+陶行知 57 nr
+陶西平 2 nr
+陶西格 7 nr
+陶诗言 3 nr
+陶质 2 n
+陶轮 2 n
+陶道 3 n
+陶都 7 n
+陶醉 281 nr
+陶醒世 2 nr
+陶里亚 5 nr
+陶里斯 2 nr
+陶金 4 n
+陶鑫良 2 nr
+陶钧 4 nr
+陶铸 44 nr
+陶阳镇 2 nr
+陶陶 3 nr
+陶陶兀兀 3 nr
+陶陶然 3 nr
+陶陶自得 3 nr
+陶驷驹 260 nr
+陷 1320 v
+陷于 739 v
+陷于绝境 3 l
+陷于缧绁 3 n
+陷井 3 n
+陷住 3 v
+陷入 1901 v
+陷入僵局 30 l
+陷入困境 3 l
+陷入绝境 3 l
+陷入重围 3 l
+陷坑 63 n
+陷坚挫锐 3 nz
+陷害 297 v
+陷害忠良 3 l
+陷敌 3 v
+陷没 12 v
+陷波 3 n
+陷溺 3 v
+陷滞 3 v
+陷耳囹圄 3 n
+陷肼 3 n
+陷落 288 v
+陷落地震 3 l
+陷落计中 3 l
+陷谷 3 n
+陷身 3 v
+陷身囹圄 3 n
+陷进 3 v
+陷阱 569 n
+陷阵 13 v
+陼 36 zg
+陽 28 zg
+隄堰 3 nz
+隄岸 3 vn
+隄边 3 z
+隄防 3 vn
+隅 467 ng
+隆 1584 nr
+隆中 800 t
+隆中对 3 nr
+隆乳 8 nz
+隆二人 2 nr
+隆儿寿 2 nr
+隆元年 2 t
+隆兴元 8 nr
+隆兴寺 9 nr
+隆兴行 2 nr
+隆冬 229 t
+隆准 7 v
+隆刑峻法 3 nr
+隆力奇 2 nr
+隆化 8 v
+隆化县 5 ns
+隆卒悉 4 nr
+隆厚 3 a
+隆和众 2 nr
+隆回 7 t
+隆回县 5 ns
+隆基班 9 nr
+隆夫人 3 nr
+隆头鱼 2 nr
+隆子 3 nr
+隆子县 3 nr
+隆安 17 nr
+隆安县 3 ns
+隆安队 2 nr
+隆宗门 8 nr
+隆宝滩 2 nr
+隆尧 3 nr
+隆尧东 2 nr
+隆尧县 3 nr
+隆平府 4 nr
+隆庆 677 t
+隆德 16 nr
+隆德东 4 nr
+隆德县 6 nr
+隆德府 6 nr
+隆恩 24 nr
+隆恩殿 5 nr
+隆情 3 a
+隆昌 12 nr
+隆昌县 2 ns
+隆暑 3 t
+隆替 3 v
+隆极 3 ad
+隆林 12 nr
+隆林各族自治县 8 ns
+隆格尔 3 nr
+隆格尔县 3 ns
+隆武元 2 nr
+隆武帝 11 nr
+隆武皇帝 4 nr
+隆然 2 ad
+隆状 2 nz
+隆盛 10 nr
+隆礼洽 2 nr
+隆福寺 73 nr
+隆科多 7 nr
+隆美尔 41 nr
+隆肉 3 n
+隆胸 78 v
+隆胸术 2 nr
+隆胸者 3 nr
+隆虑公主 2 nr
+隆裕太后 4 nr
+隆贵远 3 nr
+隆起 450 v
+隆起带 37 nr
+隆达人 3 nr
+隆达斯 112 nr
+隆达族 2 nz
+隆达高 2 nr
+隆通 2 o
+隆重 917 a
+隆重举行 3 nr
+隆重召开 3 nr
+隆重庆祝 3 nr
+隆重开业 3 nr
+隆重开幕 3 nr
+隆重推出 3 n
+隆重闭幕 3 n
+隆重集会 3 nz
+隆镇卫 2 nr
+隆阳区 2 ns
+隆隆 280 o
+隆隆响 3 nr
+隆隆声 28 nr
+隆鼻 3 nr
+隆鼻术 3 nr
+隈 10 g
+隋 1056 nr
+隋东亮 12 nr
+隋东陆 9 nr
+隋丽君 2 nr
+隋义宁 3 nr
+隋书 15 nr
+隋五朝 3 t
+隋代 174 t
+隋代人 3 nr
+隋代修 2 nr
+隋代内 2 nr
+隋代则 2 nr
+隋代周 5 nr
+隋代定 2 nr
+隋代旧 2 nr
+隋代曾 2 nr
+隋代杨 5 nr
+隋代流 2 nr
+隋代皇帝 2 nr
+隋作护 2 nr
+隋侯之珠 3 nr
+隋军分 2 nr
+隋军攻 2 nr
+隋初 11 t
+隋初唐 3 t
+隋和唐 4 nr
+隋唐 543 t
+隋唐演义 3 nr
+隋国胜 4 nr
+隋场帝 3 nr
+隋大业 10 nr
+隋将宇 2 nr
+隋常平 2 nr
+隋平陈 2 nr
+隋广通 2 nr
+隋废六 2 nr
+隋废郡 3 nr
+隋开永济 2 nr
+隋开皇 381 nr
+隋彭生 3 nr
+隋心慈 2 nr
+隋所开 2 nr
+隋改为 2 nr
+隋改今 2 nr
+隋改绵 2 nr
+隋文帝 104 nr
+隋时官 2 nr
+隋显官 2 nr
+隋晓光 2 nr
+隋朝 398 t
+隋朝人 3 nr
+隋末 82 t
+隋末唐 7 t
+隋末李 2 nr
+隋树森 4 nr
+隋海涛 7 nr
+隋炀帝 151 nr
+隋珠和玉 3 nr
+隋珠弹雀 3 ns
+隋纪 4 t
+隋继承 2 nr
+隋置武 2 nr
+隋至唐 3 nr
+隋菲菲 17 nr
+隋贡方 2 nr
+隋越王 3 nr
+隋阳帝 3 nr
+隋魏 2 t
+隍 20 g
+隍城 3 ns
+随 9036 v
+随上 3 d
+随世沉浮 3 i
+随之 1207 p
+随之而来 98 l
+随之而起 3 i
+随乡入乡 2 i
+随乡入俗 3 i
+随书 3 n
+随书赠送 3 n
+随事制宜 3 i
+随人作计 3 l
+随人俯仰 3 l
+随从 509 p
+随从人员 3 l
+随从官 3 l
+随份子 3 l
+随传随到 3 l
+随伴者 3 n
+随你便 3 l
+随你挑 3 n
+随侍 3 v
+随侍在侧 3 n
+随便 2056 d
+随便说说 3 l
+随俗 18 n
+随俗沉浮 3 i
+随俗浮沉 3 i
+随军 218 n
+随动 6 d
+随即 4194 d
+随口 473 d
+随口答应 3 i
+随口说说 3 l
+随叫随到 18 l
+随同 299 p
+随同前往 3 i
+随后 4706 d
+随后就到 3 l
+随后就去 3 l
+随后就来 3 l
+随员 70 n
+随和 145 v
+随喜 26 d
+随国 7 ns
+随圆就方 3 l
+随地 77 d
+随地吐痰 3 n
+随地随时 3 i
+随堂 3 n
+随堂测验 3 n
+随声 3 d
+随声吠影 3 i
+随声是非 3 l
+随声趋和 3 l
+随声附合 3 i
+随声附和 50 i
+随处 94 d
+随处可见 153 l
+随大势 3 n
+随大流 27 i
+随大溜 3 z
+随宜 3 v
+随寓而安 3 n
+随寓随安 3 n
+随州 2369 ns
+随州市 1304 ns
+随带 21 n
+随常 3 d
+随心 27 d
+随心变 3 i
+随心听 3 i
+随心所欲 210 i
+随心换 3 i
+随心舞 3 i
+随惑 3 v
+随想 19 v
+随想录 4 n
+随想曲 25 l
+随意 1306 d
+随意卸 3 v
+随意发 3 d
+随意型 6 n
+随意性 56 d
+随意想象 3 l
+随意注意 3 i
+随意肌 5 l
+随感 17 n
+随我动 3 l
+随手 1092 d
+随手关灯 3 l
+随手关门 3 l
+随才器使 3 i
+随文 3 n
+随方就圆 3 l
+随方逐圆 3 l
+随时 2476 d
+随时制宜 3 i
+随时奉陪 3 l
+随时施宜 3 i
+随时欢迎 3 l
+随时随地 103 l
+随机 769 d
+随机化 3 l
+随机取样 3 l
+随机变量 3 l
+随机噪声 3 l
+随机因素 3 l
+随机失效 3 i
+随机存取 3 l
+随机对照 3 l
+随机差错 3 i
+随机应变 154 i
+随机性 54 n
+随机抽样 3 i
+随机振动 3 l
+随机数 58 l
+随机样本 3 l
+随机码 3 l
+随机编码 3 l
+随机误差 3 l
+随机阵 3 l
+随机集 3 n
+随案 3 n
+随案移送 3 n
+随波逐尘 3 i
+随波逐流 46 i
+随波逐浪 3 i
+随片赠送 3 n
+随物应机 3 n
+随物赋形 3 l
+随珠和璧 3 ns
+随珠弹雀 3 n
+随珠荆玉 3 i
+随眠 3 v
+随着 10614 p
+随礼 3 n
+随科考 3 l
+随笔 147 d
+随笔集 16 i
+随缘 3 n
+随缘乐助 3 i
+随群 3 n
+随葬 89 v
+随葬品 128 n
+随行 279 d
+随行人员 3 n
+随行就市 8 l
+随行逐队 3 n
+随记 3 n
+随访 70 v
+随话答话 3 i
+随踵而至 3 i
+随身 556 d
+随身侍从 3 n
+随身听 14 i
+随身带 3 n
+随身携带 3 i
+随身行李 3 i
+随车 17 n
+随车夏雨 3 l
+随车携带 3 i
+随车甘雨 3 i
+随车致雨 3 i
+随迁 2 v
+随近逐便 3 i
+随遇平衡 3 i
+随遇而安 24 l
+随钻测量 3 n
+随队 3 n
+随附 3 v
+随随 3 v
+随随便便 126 z
+随需应变 3 l
+随顺 20 ns
+随风 3 n
+随风倒 8 i
+随风倒舵 3 i
+随风潜入夜 3 i
+随风而去 7 i
+随风而逝 8 i
+随风而靡 3 i
+随风转舵 3 i
+随风逐浪 3 i
+随风飘 3 v
+随风飘扬 3 i
+随风飘荡 3 i
+随风飞舞 8 i
+随高就低 3 l
+随高逐低 3 i
+隐 1630 n
+隐为者 3 n
+隐介藏形 3 n
+隐伏 139 v
+隐伏性 3 n
+隐匿 160 v
+隐匿型 2 n
+隐匿性 3 n
+隐匿罪 3 i
+隐占身体 3 n
+隐去 3 v
+隐名 3 v
+隐名埋姓 10 i
+隐君子 4 n
+隐含 180 v
+隐含地 3 z
+隐喻 74 n
+隐士 104 n
+隐天蔽日 3 i
+隐失模式 3 l
+隐失波 3 i
+隐头喷泉 3 i
+隐头花序 2 l
+隐姓埋名 50 i
+隐密 3 a
+隐密性 3 n
+隐射 3 v
+隐居 712 v
+隐居求志 3 i
+隐形 440 n
+隐形失业 3 l
+隐形技术 49 n
+隐形眼睛 3 i
+隐形眼镜 138 l
+隐形笔 3 n
+隐形纱窗 3 n
+隐形迷彩 3 l
+隐形遗传 3 i
+隐形飞机 26 l
+隐德来希 3 l
+隐忍 120 v
+隐忍不发 16 i
+隐忍不言 7 l
+隐忍住 3 l
+隐忍着 3 l
+隐忧 105 v
+隐性 121 n
+隐恶扬善 7 i
+隐患 502 n
+隐情 81 n
+隐括 3 v
+隐映 3 v
+隐晦 75 a
+隐晦曲折 8 i
+隐暗 3 z
+隐没 125 v
+隐潭 3 n
+隐火 3 n
+隐然 3 z
+隐然作痛 3 l
+隐然可见 3 l
+隐然敌国 3 i
+隐然若现 3 i
+隐现 41 v
+隐疾 4 z
+隐痛 58 a
+隐癖 3 n
+隐白 3 z
+隐睾 3 n
+隐睾症 3 n
+隐瞒 667 v
+隐瞒不住 3 l
+隐瞒事实 3 l
+隐私 363 b
+隐私权 22 n
+隐秘 333 a
+隐秘处 3 z
+隐秘性 4 n
+隐约 360 z
+隐约其词 3 i
+隐约其辞 3 i
+隐约可见 45 i
+隐约约 3 z
+隐者 23 n
+隐若敌国 3 i
+隐蔽 768 a
+隐蔽处 26 n
+隐蔽性 94 n
+隐蔽所 5 n
+隐蔽斗争 3 n
+隐蔽物 3 n
+隐藏 1212 v
+隐藏人物 3 n
+隐藏住 3 v
+隐藏处 3 n
+隐藏式 3 n
+隐藏所 3 n
+隐血 2 v
+隐衷 7 n
+隐讳 36 v
+隐语 24 n
+隐踪 3 v
+隐身 395 v
+隐身人 4 n
+隐身技术 3 n
+隐身术 5 n
+隐身法 3 n
+隐身草 3 n
+隐身衣 3 n
+隐身飞机 3 l
+隐迹 3 n
+隐迹埋名 3 i
+隐迹藏名 3 i
+隐退 162 v
+隐逸 29 z
+隐遁 16 v
+隐避 5 v
+隐避处 3 l
+隐隐 1144 z
+隐隐作痛 74 l
+隐隐地 3 z
+隐隐然 7 z
+隐隐约约 239 z
+隐隐绰绰 2 i
+隐隐若现 3 i
+隐隐藏藏 3 i
+隐饰 3 v
+隐鳞戢羽 3 v
+隐鳞戢翼 3 v
+隐鳞藏彩 3 i
+隓 2 zg
+隔 3859 v
+隔三岔五 17 l
+隔三差五 46 l
+隔上 3 s
+隔下 3 s
+隔世 43 v
+隔世之感 3 l
+隔世轮回 3 l
+隔世追凶 3 n
+隔代 3 n
+隔代遗传 3 i
+隔作 3 vn
+隔入 3 v
+隔出 3 v
+隔出来 3 l
+隔别 3 d
+隔周 3 n
+隔坨区 3 n
+隔墙 39 n
+隔墙有耳 19 i
+隔墙板 3 n
+隔壁 507 s
+隔壁听话 3 i
+隔壁家 3 n
+隔壁撺椽 3 nr
+隔壁邻居 3 i
+隔壁邻舍 3 i
+隔声 61 n
+隔声层 3 l
+隔声幕 3 n
+隔声板 3 n
+隔声罩 3 l
+隔声量 3 l
+隔声门 3 l
+隔夜 49 b
+隔夜茶 3 l
+隔夜饭 3 l
+隔天 3 nz
+隔子 3 n
+隔完 3 v
+隔室 20 n
+隔宿 3 v
+隔层 3 b
+隔居 3 v
+隔屋撺椽 3 nr
+隔山 13 nz
+隔岸 3 s
+隔岸观火 19 i
+隔巷 3 n
+隔年皇历 3 n
+隔开 343 v
+隔心 3 n
+隔成 3 v
+隔扇 34 n
+隔振 28 v
+隔断 102 v
+隔断门 3 n
+隔日 27 b
+隔来隔去 3 l
+隔板 50 n
+隔栅 3 n
+隔栏 3 n
+隔次 3 b
+隔此 3 d
+隔水 3 n
+隔水层 3 n
+隔水相望 3 i
+隔沟 3 n
+隔河 3 nz
+隔河岩 259 n
+隔河相望 3 i
+隔油 3 n
+隔法 3 n
+隔海 3 nz
+隔海相望 51 i
+隔湖 3 n
+隔湖相望 3 i
+隔溪 3 nz
+隔溪相望 3 nz
+隔热 67 v
+隔热层 3 n
+隔热性 5 n
+隔热材料 3 l
+隔热板 6 n
+隔热法 3 n
+隔热管柱 3 n
+隔热膜 3 n
+隔皮断货 3 n
+隔离 688 v
+隔离区 11 n
+隔离卡 3 nz
+隔离器 4 nz
+隔离墙 3 n
+隔离墩 3 n
+隔离室 3 n
+隔离工艺 3 n
+隔离带 12 n
+隔离度 3 n
+隔离开 3 i
+隔离政策 3 n
+隔离法 2 n
+隔离液 3 n
+隔离病房 3 n
+隔离线 3 n
+隔离舱 3 n
+隔离车 7 n
+隔离霜 3 nz
+隔绝 297 v
+隔绝力 3 l
+隔膜 107 n
+隔膜波导 3 n
+隔膜泵 3 n
+隔膜阀 3 n
+隔舱 15 n
+隔舱板 3 ns
+隔行 3 v
+隔行如隔山 20 l
+隔行扫描 3 n
+隔起 3 s
+隔起来 3 l
+隔距 3 n
+隔邻 2 v
+隔门 3 n
+隔间 21 n
+隔阂 163 n
+隔靴抓痒 3 z
+隔靴搔痒 9 i
+隔靴爬痒 3 z
+隔音 37 n
+隔音墙 3 n
+隔音室 3 n
+隔音性 2 n
+隔音材料 3 l
+隔音板 4 n
+隔音棉 3 n
+隔音窗 3 n
+隔音符号 3 n
+隔音纸 3 n
+隔音设备 3 n
+隔餐 3 n
+隗 23 nr
+隗瀛涛 2 nr
+隗福临 257 nr
+隘 322 n
+隘口 96 n
+隘害 3 n
+隘岭 3 n
+隘巷 3 n
+隘穷 3 n
+隘路 4 n
+隘阻 3 n
+隘险 3 n
+隙 464 ng
+隙地 15 n
+隙大墙坏 3 n
+隙流束源 3 n
+隙穴之窥 3 n
+隙缝 14 n
+隙间 3 n
+隙驹 3 n
+障 269 n
+障人眼目 3 n
+障壁 11 n
+障壁坝 3 n
+障壁岛 3 n
+障子 3 n
+障景 3 n
+障景种植 3 n
+障目 3 n
+障眼 6 n
+障眼法 31 n
+障碍 2280 n
+障碍因素 3 n
+障碍性 27 n
+障碍滑雪 3 n
+障碍灯 2 n
+障碍物 168 n
+障碍竞走 3 n
+障碍者 11 n
+障碍赛 3 n
+障碍赛跑 3 n
+障翳 3 n
+障蔽 3 n
+隞 6 zg
+隧 71 n
+隧洞 71 n
+隧道 1207 n
+隧道口 8 n
+隧道窑 3 n
+隨 276 zg
+隭 4 zg
+隰 46 g
+隰县 8 ns
+隳 51 g
+隳肝尝胆 3 nr
+隳肝沥胆 3 nr
+隳胆抽肠 3 i
+隳节败名 3 v
+隶 622 j
+隶书 118 v
+隶农 3 v
+隶农制 3 n
+隶卒 3 n
+隶字 2 n
+隶属 1110 v
+隶属于 3 n
+隷 135 zg
+隹 48 g
+隼 231 g
+隽 192 x
+隽拔 3 a
+隽敏 3 a
+隽永 49 a
+隽良 3 a
+隽茂 3 a
+隽语箴言 3 z
+难 18505 a
+难上加难 56 i
+难上难 2 l
+难不住 3 d
+难不倒 3 d
+难不成 3 v
+难两全 3 i
+难为 10 d
+难为人 3 l
+难为情 91 l
+难为易 3 l
+难乎为情 3 i
+难乎为继 3 i
+难乎其难 2 i
+难事 124 n
+难于 364 d
+难于上天 3 i
+难于上青天 16 l
+难于启齿 3 i
+难于登天 9 i
+难产 87 n
+难以 5681 d
+难以为情 3 l
+难以为继 35 i
+难以估计 3 l
+难以使用 3 l
+难以克服 3 l
+难以出口 3 l
+难以名状 10 i
+难以启齿 34 i
+难以完成 3 l
+难以实现 3 l
+难以容忍 3 l
+难以形容 3 l
+难以忍受 98 l
+难以忘怀 42 i
+难以想像 3 n
+难以想象 162 l
+难以成眠 6 l
+难以承受 3 l
+难以捉摸 3 i
+难以接近 3 l
+难以描述 3 n
+难以根除 3 i
+难以渗透 3 n
+难以相信 3 i
+难以相处 3 l
+难以确定 3 l
+难以置信 169 i
+难以自拔 3 i
+难以获得 3 i
+难以解决 3 l
+难以言状 3 i
+难以言表 12 l
+难以辨认 3 i
+难以达到 3 l
+难以逆料 9 l
+难以逾越 3 i
+难以避免 3 l
+难以预料 25 l
+难以预测 3 l
+难休 3 v
+难住 35 v
+难侨 3 n
+难保 348 v
+难倒 25 d
+难兄 3 n
+难兄难弟 32 l
+难免 1188 d
+难免会 3 l
+难关 269 v
+难出 3 v
+难分 3 d
+难分上下 3 l
+难分仲伯 3 nz
+难分伯仲 3 n
+难分难舍 19 i
+难分难解 21 l
+难分高下 3 l
+难割难舍 4 i
+难办 11 v
+难匹敌 3 i
+难友 29 n
+难受 827 v
+难句 3 n
+难吃 19 a
+难听 137 v
+难喝 3 v
+难堪 380 v
+难处 110 d
+难如登天 3 i
+难嫁 3 v
+难学 3 n
+难守 3 v
+难容 3 n
+难容于 3 d
+难寻 3 v
+难局 3 n
+难度 1515 d
+难度很大 3 z
+难弟难兄 3 n
+难当 354 d
+难得 1653 d
+难得一见 50 d
+难得糊涂 3 i
+难忍 303 a
+难忘 415 v
+难忘项背 3 l
+难怪 728 d
+难怪会 3 l
+难惹 3 v
+难愈 44 d
+难懂 46 a
+难抑 3 v
+难拆 3 v
+难挨 23 a
+难接近 3 n
+难搞 19 a
+难料 3 n
+难易 3 a
+难易度 3 n
+难更仆数 3 i
+难民 740 n
+难民所 3 n
+难民收容 3 n
+难民潮 4 n
+难民署 9 n
+难民营 20 n
+难治 3 n
+难治性 10 n
+难治病 2 n
+难测 107 v
+难点 303 d
+难熔 3 n
+难熬 162 a
+难燃 6 v
+难用 3 v
+难症 3 n
+难看 381 v
+难眠 3 v
+难禁 3 d
+难经 23 d
+难缠 60 v
+难者 79 n
+难者不会 3 l
+难耐 76 v
+难胞 3 n
+难能可贵 102 i
+难舍 3 n
+难舍难分 23 l
+难舍难离 2 i
+难色 35 n
+难行 3 v
+难覆 3 v
+难觅 40 v
+难解 108 v
+难解之谜 9 n
+难解难分 48 l
+难言 145 n
+难言之事 3 i
+难言之隐 60 i
+难记 3 n
+难评 3 v
+难说 177 v
+难读 3 v
+难赚 3 v
+难辞其咎 18 i
+难辨 78 v
+难过 691 v
+难过地 3 d
+难近母 9 l
+难进 16 v
+难进易退 3 l
+难追踪 3 i
+难逃 217 v
+难逃一死 3 i
+难逃法网 3 i
+难逢 3 v
+难逢敌手 3 i
+难遇 3 n
+难道 6207 d
+难道真 3 l
+难道说 37 l
+难避 3 v
+难闻 46 n
+难顾 3 d
+难题 1148 n
+难颜 3 n
+难驯服 3 z
+难驾驭 3 i
+难鸣孤掌 3 i
+雀 501 ng
+雀儿 3 n
+雀儿山 9 ns
+雀喧鸠聚 3 i
+雀噪 3 v
+雀子 3 n
+雀小脏全 3 n
+雀屏 3 n
+雀巢 15 nz
+雀巢公司 4 nt
+雀巢咖啡 3 nr
+雀形目 28 n
+雀斑 38 n
+雀替 3 v
+雀然无声 3 nz
+雀目 3 n
+雀目鼠步 3 n
+雀盲眼 3 n
+雀窝 3 n
+雀类 3 n
+雀蛋 3 n
+雀角鼠牙 3 n
+雀起 3 v
+雀跃 33 v
+雀跃三分 3 n
+雀跃不已 3 n
+雀马鱼龙 3 nz
+雀鸟 17 n
+雀鹰 7 nz
+雀麦 4 ns
+雀鼠之争 3 n
+雁 415 nr
+雁北 25 ns
+雁南燕北 3 nr
+雁去鱼来 3 l
+雁城 3 ns
+雁塔 10 nr
+雁塔区 3 ns
+雁塔新题 3 nr
+雁塔路 3 nr
+雁塔题名 3 n
+雁山区 3 ns
+雁峰区 3 ns
+雁影分飞 3 nr
+雁断鱼沉 3 i
+雁来红 3 nr
+雁杳鱼沉 3 nr
+雁栖湖 18 nr
+雁江区 3 ns
+雁泊人户 3 ns
+雁湖 256 ns
+雁滩 2 ns
+雁窝岛 2 nr
+雁素鱼笺 3 nr
+雁翎队 5 nr
+雁荡 14 nr
+雁荡山 51 ns
+雁行 47 nr
+雁过拔毛 5 nr
+雁过拨毛 3 i
+雁过留声 3 nr
+雁逝鱼沉 3 nr
+雁门 77 ns
+雁门关 125 ns
+雁鸣 2 nr
+雁默先烹 3 nr
+雄 2932 n
+雄伟 807 a
+雄伟壮观 36 l
+雄体 3 n
+雄健 76 a
+雄健步伐 3 n
+雄关 32 n
+雄兵 31 n
+雄冠 3 n
+雄劲 18 a
+雄厚 449 a
+雄厚实力 3 l
+雄厚资金 3 n
+雄县 30 ns
+雄唱雌和 3 i
+雄图 28 n
+雄图大业 3 nz
+雄图大略 2 i
+雄壮 863 a
+雄壮威武 3 ns
+雄大 5 a
+雄奇 46 a
+雄姿 216 a
+雄姿英发 7 i
+雄威 14 n
+雄居 8 n
+雄峻 3 a
+雄峻挺拔 3 i
+雄州 3 ns
+雄州镇 2 ns
+雄师 30 n
+雄师百万 3 i
+雄强 45 a
+雄心 159 n
+雄心万丈 3 i
+雄心勃勃 102 i
+雄心壮志 62 i
+雄心豹胆 3 i
+雄性 373 n
+雄性不育 3 l
+雄性化 3 l
+雄性激素 3 l
+雄才 23 n
+雄才伟略 8 i
+雄才大略 57 i
+雄据一方 3 n
+雄文 9 n
+雄文大手 3 l
+雄断 3 a
+雄材大略 3 n
+雄杰 2 n
+雄森 2 z
+雄武 3 a
+雄浑 180 z
+雄浑有力 3 i
+雄海马 3 ns
+雄深雅健 3 nz
+雄激素 3 n
+雄犊 3 n
+雄狮 110 n
+雄猫 3 n
+雄略 3 n
+雄纠纠 12 z
+雄花 110 n
+雄蕊 347 n
+雄蚁 3 n
+雄蜂 27 n
+雄视 3 b
+雄视一世 3 i
+雄豪 3 n
+雄赳赳 36 z
+雄赳赳地 3 z
+雄起 17 v
+雄踞 52 v
+雄踞一方 3 i
+雄辨 3 v
+雄辩 68 a
+雄辩家 3 n
+雄辩高谈 3 l
+雄震集团 3 n
+雄霸 3 n
+雄霸一方 3 i
+雄风 181 n
+雄风不减 3 i
+雄风犹在 3 l
+雄飞 2 v
+雄飞突进 3 i
+雄飞雌伏 3 i
+雄马驹 3 n
+雄骏图 3 nz
+雄鱼 3 n
+雄鸟 3 n
+雄鸡 88 n
+雄鸡夜鸣 3 i
+雄鸡断尾 3 i
+雄鹰 60 n
+雄鹿 3 n
+雄鹿队 3 i
+雄黄 60 b
+雄黄酒 20 n
+雅 1051 ns
+雅不可攀 3 nr
+雅丹 32 ns
+雅丽 13 nr
+雅乐 54 ns
+雅事 6 n
+雅人 12 nrt
+雅人深致 3 nz
+雅人清致 3 l
+雅人韵士 3 nz
+雅伯 3 ns
+雅佳 15 nz
+雅俗 51 a
+雅俗共赏 42 l
+雅克 235 nrt
+雅克萨 3 nr
+雅兰 8 ns
+雅兴 42 ns
+雅兴不浅 3 l
+雅典 1269 ns
+雅典卫城 12 nz
+雅典奥运 3 nz
+雅典娜 76 nr
+雅利 6 ns
+雅利安 84 ns
+雅加达 130 ns
+雅加达人 3 nrt
+雅加达市 4 ns
+雅化 2 ns
+雅古布 2 nrt
+雅可比场 3 ns
+雅号 28 nz
+雅司病 3 nr
+雅各 129 nrt
+雅各宾派 3 nr
+雅各布 41 nrt
+雅各布森 3 nrt
+雅各布逊 3 nrt
+雅园 17 ns
+雅塔 19 nrt
+雅士 31 ns
+雅士利 3 nr
+雅姆 3 nrt
+雅娜 2 nrt
+雅安 41 ns
+雅安地区 2 ns
+雅安市 9 ns
+雅宝路 3 nr
+雅室 3 nz
+雅尔 32 nrt
+雅尔塔 75 nrt
+雅尼 3 nrt
+雅尼克 2 ns
+雅山 3 ns
+雅州 3 ns
+雅布 3 nrt
+雅库 5 nz
+雅库布 2 nr
+雅库特 20 nrt
+雅库茨克 4 nrt
+雅座 20 nz
+雅德 2 nrt
+雅思 183 nr
+雅思网 3 nr
+雅思考试 3 nr
+雅意 11 n
+雅戈 2 nrt
+雅戈尔 44 nr
+雅戈尔集团 4 nz
+雅拉 2 nrt
+雅故 3 n
+雅斯 4 ns
+雅普 9 nrt
+雅格 2 nrt
+雅格布森 3 nrt
+雅格布逊 3 nrt
+雅歌 3 nr
+雅正 10 nr
+雅气 3 nz
+雅江 3 ns
+雅江县 3 ns
+雅法 9 nz
+雅洁 26 nr
+雅浦 7 ns
+雅淡 3 a
+雅温得 21 nr
+雅爱 3 nr
+雅皮士 2 nr
+雅相 3 nr
+雅砻 4 ns
+雅砻江 58 ns
+雅科 3 nz
+雅科夫 3 nr
+雅科夫列夫 3 nrt
+雅称 6 n
+雅纳 2 ns
+雅绅特 3 q
+雅罗 10 nrt
+雅罗斯拉夫 9 nrt
+雅罗斯拉夫尔 4 nrt
+雅美 3 ns
+雅美族 3 nz
+雅美达 3 nr
+雅聚 3 nz
+雅致 184 a
+雅芳 7 nr
+雅虎 268 nz
+雅虎公司 35 nr
+雅虎哦哦 3 v
+雅虎将 4 nr
+雅虎网站 3 n
+雅虎通 3 nr
+雅西 3 ns
+雅观 27 nz
+雅言 4 nr
+雅词 3 n
+雅诗兰黛 3 nr
+雅语 3 nz
+雅赫 4 nrt
+雅趣 14 a
+雅趣盎然 3 l
+雅辛 5 nrt
+雅远 2 nrt
+雅量 16 n
+雅量高致 3 nz
+雅间 11 n
+雅阁 3 nr
+雅隆 3 ns
+雅雀无声 3 l
+雅雅 4 ns
+雅集 3 ns
+雅静 6 nr
+雅音 3 nz
+雅马哈 54 nrt
+雅驯 3 nr
+雅高 144 nrt
+雅鲁 9 ns
+雅鲁河 2 ns
+雅鲁泽尔斯基 4 ns
+雅鲁藏布 3 ns
+雅鲁藏布江 166 ns
+雅鲁藏布江大峡谷 2 ns
+雅龙 134 nz
+集 6174 q
+集中 9232 v
+集中体现 3 l
+集中供热 5 l
+集中兵力 3 n
+集中制 4 n
+集中力 3 n
+集中力量 3 n
+集中化 13 n
+集中区 42 n
+集中反映 7 i
+集中器 3 n
+集中地 127 n
+集中型 5 b
+集中处理 2 l
+集中学习 3 n
+集中度 38 n
+集中式 16 n
+集中性 11 n
+集中控制 4 n
+集中管理 13 l
+集中精力 3 n
+集中统一 3 l
+集中营 176 b
+集中量数 3 n
+集为 14 v
+集于一身 3 l
+集会 1076 n
+集会广场 3 n
+集会法 3 n
+集会游行 3 n
+集会结社 3 l
+集会自由 3 n
+集体 3332 n
+集体主义 91 n
+集体企业 3 n
+集体农庄 3 n
+集体创作 3 n
+集体利益 3 n
+集体制 3 n
+集体化 89 vn
+集体合同 3 n
+集体土地 3 n
+集体奖 2 n
+集体婚礼 3 n
+集体工 3 n
+集体性 34 n
+集体户 3 n
+集体所有 544 l
+集体所有制 100 l
+集体承包 3 n
+集体照 3 n
+集体生活 3 n
+集体福利 3 n
+集体积累 3 l
+集体经济 189 n
+集体舞 17 n
+集体行动 3 n
+集体领导 3 n
+集其大成 3 nz
+集刊 33 n
+集合 1952 v
+集合令 3 n
+集合体 121 n
+集合号 3 n
+集合地点 3 n
+集合时间 3 n
+集合点 3 n
+集合版 3 n
+集合竞价 3 n
+集合论 145 n
+集合起来 3 l
+集团 12298 n
+集团主义 3 n
+集团公司 1297 n
+集团军 782 n
+集团化 17 n
+集团卡 3 n
+集团型 3 n
+集团式 3 n
+集团效应 3 n
+集团电话 3 n
+集团积分 3 n
+集团结婚 3 n
+集团股份 3 nz
+集团选择 3 l
+集大成 16 nz
+集大成者 41 n
+集子 71 n
+集宁 13 nz
+集宁区 3 ns
+集宁市 7 ns
+集安 26 n
+集安县 3 ns
+集安市 5 n
+集少成多 3 l
+集尘 3 n
+集居 12 v
+集市 264 n
+集市贸易 21 l
+集思会 3 n
+集思广义 3 nz
+集思广益 33 n
+集思广议 3 nz
+集成 741 v
+集成化 31 n
+集成商 12 n
+集成块 4 n
+集成型 2 n
+集成声卡 3 n
+集成度 33 n
+集成式 2 n
+集成性 10 n
+集成显卡 3 n
+集成材 3 n
+集成板 3 n
+集成版 3 n
+集成电路 520 nz
+集成系统 2 l
+集拢 3 v
+集散 269 v
+集散中心 3 n
+集散地 222 n
+集散站 3 n
+集数 8 n
+集料 7 n
+集权 109 n
+集权主义 3 n
+集权国家 3 l
+集材 3 n
+集束 45 v
+集束炸弹 9 n
+集气 3 n
+集气站 3 n
+集水 3 n
+集水区 15 n
+集水管 3 n
+集油站 2 n
+集注 54 v
+集流 6 n
+集流环 3 n
+集热器 10 n
+集琦 3 nz
+集电区 3 n
+集电极 3 n
+集电环 2 n
+集电结 3 v
+集疏运 7 n
+集矢之的 3 i
+集积 3 n
+集粹 4 n
+集约 43 n
+集约农业 3 n
+集约化 90 n
+集约型 34 n
+集约式 3 n
+集约经营 23 n
+集纳 9 v
+集线器 3 n
+集结 733 v
+集结地 18 n
+集结待命 3 n
+集结成 3 v
+集美 35 nz
+集美区 3 ns
+集美学村 2 n
+集群 216 n
+集聚 131 v
+集腋为裘 3 i
+集腋成裘 2 i
+集苑集枯 3 n
+集萃 3 v
+集萤映雪 3 nr
+集落 7 v
+集落杂交 3 n
+集装 19 n
+集装箱 411 n
+集装箱船 34 n
+集装箱运输 2 i
+集装袋 3 n
+集解 3 v
+集训 357 n
+集训中心 3 n
+集训团 3 n
+集训地 3 n
+集训班 5 n
+集训营 3 n
+集训队 97 n
+集训队员 2 n
+集贤 44 n
+集贤县 3 ns
+集货 3 n
+集贸 19 n
+集贸市场 156 n
+集资 323 n
+集资合建 3 n
+集资房 4 n
+集资款 8 n
+集资费 2 n
+集资额 5 n
+集输 7 vn
+集运 3 n
+集邮 99 vn
+集邮册 3 n
+集邮品 2 n
+集邮家 2 n
+集邮票 3 n
+集邮簿 3 n
+集邮网 3 nz
+集邮者 4 n
+集邮联 2 nz
+集邮迷 3 n
+集部 4 n
+集锦 48 n
+集锦式 3 n
+集镇 361 n
+集韵 18 n
+集齐 3 v
+雇 663 n
+雇个 3 n
+雇主 530 v
+雇主家 2 n
+雇于 3 v
+雇人 3 n
+雇佣 597 v
+雇佣兵 54 n
+雇佣军 66 n
+雇佣劳动 140 l
+雇佣工人 3 l
+雇佣观点 3 l
+雇农 37 n
+雇凶 3 n
+雇到 3 v
+雇员 244 n
+雇好 3 v
+雇工 120 n
+雇户 3 n
+雇有 3 v
+雇用 375 v
+雇用军 3 n
+雇船 3 n
+雇请 12 v
+雇车 17 n
+雇马 3 n
+雉 193 ng
+雉堞 29 n
+雉头狐腋 3 n
+雉尾 3 n
+雉求牡匹 3 nrt
+雉鸠 3 n
+雉鸡 20 n
+雌 1024 b
+雌三醇 8 nz
+雌二醇 20 nz
+雌伏 4 l
+雌兽 3 n
+雌威 3 n
+雌异配 3 l
+雌性 266 n
+雌性化 3 l
+雌性激素 3 l
+雌性花 3 n
+雌核 3 n
+雌核发育 3 l
+雌激素 210 l
+雌牙露嘴 3 l
+雌犊 3 n
+雌狮 3 n
+雌禽 3 n
+雌老虎 6 l
+雌花 106 n
+雌蕊 109 n
+雌虎 3 n
+雌蚁 3 n
+雌蜂 30 n
+雌豹 3 n
+雌质 3 n
+雌配子 3 n
+雌酮 3 n
+雌雄 290 n
+雌雄同体 55 l
+雌雄同柱 3 n
+雌雄同株 73 l
+雌雄异体 76 l
+雌雄异株 68 l
+雌雄未决 3 l
+雌雄莫辨 3 l
+雌马 3 n
+雌马驹 3 n
+雌驴 3 n
+雌鸟 3 n
+雌鹅 3 n
+雌鹿 3 n
+雌黄 21 b
+雌鼠 3 n
+雍 269 nr
+雍丘非 2 nr
+雍二州 3 nr
+雍亲王 5 nr
+雍六州 3 ns
+雍和宫 47 nr
+雍园 2 n
+雍城 5 ns
+雍奴 4 n
+雍容 73 n
+雍容不迫 3 i
+雍容典雅 3 i
+雍容华贵 43 nr
+雍容大度 15 l
+雍容大雅 3 nr
+雍容尔雅 3 nr
+雍容闲雅 3 i
+雍容雅步 3 l
+雍州 71 ns
+雍州兵 4 nr
+雍州牧 4 nr
+雍布拉 3 nr
+雍布拉康 2 ns
+雍正 616 nr
+雍正帝 3 nr
+雍正年间 3 n
+雍正皇帝 3 nr
+雍热田 3 nr
+雍熙 26 n
+雍睦 3 nr
+雍籍 4 n
+雍荣华贵 3 nr
+雍荣闲雅 3 nr
+雍荣雅步 3 nr
+雍门刎首 3 v
+雍齿 4 n
+雎 29 g
+雎鸠 3 n
+雏 100 n
+雏儿 21 n
+雏凤 2 n
+雏凤清声 3 n
+雏型 17 n
+雏妓 3 n
+雏形 197 n
+雏燕 3 n
+雏莺 3 n
+雏菊 3 n
+雏菊式 3 n
+雏鸟 104 n
+雏鸡 12 n
+雏鸽 3 n
+雏鹰 5 n
+雏鹰展翅 3 n
+雏鹰网 3 nz
+雒 199 nr
+雒于仁 25 nr
+雒祥明 5 nr
+雒越征 2 nr
+雓 19 zg
+雕 2981 n
+雕像 372 n
+雕像头 3 n
+雕凿 27 v
+雕刀 3 n
+雕刻 1520 n
+雕刻刀 3 n
+雕刻厂 3 n
+雕刻品 6 n
+雕刻器 12 n
+雕刻家 42 n
+雕刻师 3 n
+雕刻术 3 n
+雕刻机 3 n
+雕塑 885 n
+雕塑公园 3 n
+雕塑品 14 n
+雕塑园 3 n
+雕塑学 3 n
+雕塑家 101 n
+雕塑感 9 n
+雕塑系 2 n
+雕墙峻宇 3 i
+雕工 15 n
+雕弓 3 n
+雕彻 3 v
+雕心刻肾 3 n
+雕心雁爪 3 i
+雕心鹰爪 3 n
+雕成 3 v
+雕文刻镂 3 i
+雕文织采 3 n
+雕板 3 n
+雕栋画梁 3 i
+雕栏 276 n
+雕栏玉砌 9 l
+雕梁 3 n
+雕梁画栋 34 i
+雕残 3 v
+雕漆 40 n
+雕版 99 v
+雕玉双联 3 l
+雕琢 109 v
+雕画 3 n
+雕盘绮食 3 vn
+雕砌 3 b
+雕章琢句 3 i
+雕章绘句 3 i
+雕章缋句 3 v
+雕章缛彩 3 i
+雕章表句 3 n
+雕章镂句 3 i
+雕红漆 3 n
+雕绘 3 n
+雕花 149 n
+雕虎焦原 3 n
+雕虫刻篆 3 n
+雕虫小事 3 n
+雕虫小巧 3 n
+雕虫小技 24 n
+雕虫小艺 3 n
+雕虫小计 3 n
+雕虫末伎 3 n
+雕虫末技 3 n
+雕虫篆刻 3 vn
+雕虫薄技 3 i
+雕象 3 n
+雕铸 3 n
+雕镂 16 v
+雕镂藻绘 3 vn
+雕鞍 39 n
+雕风镂月 3 i
+雕饰 52 n
+雕饰品 3 n
+雕龙 3 n
+雕龙画凤 3 i
+雕龙记 3 n
+雘 3 zg
+雙 4 zg
+雟 4 zg
+雠 118 g
+雡 3 zg
+離 3 zg
+難 3 zg
+雨 4450 n
+雨丝 28 n
+雨丝风片 2 n
+雨中散步 3 i
+雨中曲 3 nr
+雨井烟垣 3 i
+雨伞 96 n
+雨伞套 3 l
+雨伞架 3 n
+雨伞节 3 l
+雨僝云僽 3 ns
+雨僽风僝 3 ns
+雨具 14 n
+雨凇 3 nr
+雨凑云集 3 nz
+雨刮器 3 n
+雨前 5 t
+雨前茶 3 nr
+雨势 19 n
+雨区 7 n
+雨卧风餐 3 i
+雨后 3 t
+雨后春笋 68 i
+雨后送伞 3 n
+雨器 5 n
+雨地 3 n
+雨城 3 nr
+雨城区 2 ns
+雨声 99 n
+雨夜 20 t
+雨天 74 t
+雨夹雪 16 l
+雨子 71 n
+雨季 339 t
+雨宿风餐 3 n
+雨层云 11 nr
+雨山 3 nr
+雨山区 3 ns
+雨巾风帽 3 n
+雨布 10 nr
+雨师 2 n
+雨帘 3 n
+雨帘云栋 3 i
+雨带 31 n
+雨帽 10 n
+雨幕 16 n
+雨影 7 n
+雨恨云愁 3 i
+雨情 6 n
+雨愁烟恨 3 i
+雨意 2 n
+雨打霜摧 3 i
+雨打风吹 6 i
+雨披 2 nr
+雨收云散 3 i
+雨散云收 3 nr
+雨散云飞 3 nr
+雨散风流 3 i
+雨断云销 3 i
+雨无声 3 i
+雨旸时若 3 nr
+雨景 2 n
+雨条烟叶 3 n
+雨来 166 t
+雨林 74 nr
+雨林中 2 nr
+雨果 67 n
+雨栋风帘 3 nr
+雨棚 4 n
+雨歇云收 3 nr
+雨水 591 n
+雨水管 2 n
+雨沐风餐 3 l
+雨沾云惹 3 nr
+雨泣云愁 3 i
+雨消云散 3 i
+雨涝 11 n
+雨润 11 n
+雨淋 148 nr
+雨淋日晒 3 i
+雨淋日炙 3 i
+雨湖区 3 ns
+雨滴 70 n
+雨滴侵蚀 3 n
+雨潇潇 3 nr
+雨点 150 n
+雨点儿 3 nr
+雨点小 3 n
+雨点般 3 l
+雨燕 63 nr
+雨珠 3 nr
+雨痕 3 n
+雨神 11 n
+雨窟云巢 3 n
+雨篷 2 n
+雨约云期 3 n
+雨纷飞 3 i
+雨罩 3 n
+雨脚 3 n
+雨膏烟腻 3 n
+雨花 14 n
+雨花区 3 n
+雨花台 31 n
+雨花台区 4 ns
+雨花台烈士陵园 9 ns
+雨花石 17 nr
+雨蒙蒙 2 nr
+雨蓑烟笠 3 i
+雨蓑风笠 3 i
+雨蛙 12 n
+雨衣 102 n
+雨覆云翻 3 i
+雨踪云迹 3 i
+雨过天晴 18 nr
+雨过天青 3 nr
+雨迹云踪 3 i
+雨量 260 n
+雨量器 4 n
+雨量站 3 n
+雨量表 3 n
+雨量计 5 n
+雨雪 71 n
+雨雪霏霏 3 nr
+雨零星乱 3 i
+雨零星散 3 i
+雨雾 40 n
+雨露 60 nr
+雨露之恩 3 nr
+雨霾风障 3 v
+雨靴 2 n
+雨鞋 12 n
+雨顺风调 4 i
+雨鬓风鬟 3 i
+雨鬣霜蹄 3 nr
+雩 11 g
+雪 4284 n
+雪上 18 n
+雪上加霜 70 i
+雪上汽车 3 n
+雪上运动 3 i
+雪上飞 3 nr
+雪丘 4 nr
+雪中情 2 nr
+雪中莲 3 nr
+雪中送炭 37 n
+雪中鸿爪 3 nr
+雪亮 125 nr
+雪人 39 n
+雪人兄弟 3 n
+雪仗 3 n
+雪佛兰 3 nr
+雪佛兰车 3 nz
+雪佛莱 2 nr
+雪佛龙 3 nr
+雪停了 3 i
+雪儿 26 nr
+雪兆丰年 3 nr
+雪兰莪 4 nr
+雪兰莪州 2 ns
+雪具 3 n
+雪冤 2 n
+雪利酒 3 nr
+雪北香南 3 ns
+雪博会 3 nr
+雪原 37 n
+雪参包 3 n
+雪团 28 n
+雪地 358 n
+雪地冰天 3 ns
+雪地车 2 n
+雪地鞋 2 nz
+雪场 5 n
+雪城 16 nr
+雪域 29 n
+雪堆 30 n
+雪堤 3 n
+雪夜 31 t
+雪天 31 t
+雪天使 3 nr
+雪天萤席 3 v
+雪季 3 t
+雪宝顶 3 nr
+雪害 3 n
+雪尼尔 3 nr
+雪屋 3 n
+雪山 863 nr
+雪山山 4 nr
+雪山山脉 3 ns
+雪山飞狐 3 nr
+雪峰 121 nr
+雪峰山 29 nr
+雪崩 149 n
+雪带 3 n
+雪弗兰 3 nr
+雪影 2 n
+雪恨 22 n
+雪战 3 nz
+雪挂 3 n
+雪操冰心 3 n
+雪日 3 t
+雪旺细胞 3 l
+雪景 14 n
+雪暴 10 n
+雪月风花 3 nz
+雪朵 3 n
+雪村真琴 3 nr
+雪杖 4 n
+雪条 3 n
+雪松 33 nr
+雪松林 2 nr
+雪松烷 3 nr
+雪松类 3 nr
+雪板 10 n
+雪柜 3 n
+雪柳 2 nr
+雪案萤灯 3 vn
+雪案萤窗 3 v
+雪梨 18 nr
+雪橇 90 n
+雪橇犬 3 nr
+雪水 69 n
+雪泥 3 n
+雪泥鸿爪 2 nr
+雪泥鸿迹 3 nr
+雪海 8 ns
+雪深 3 nr
+雪灾 51 n
+雪片 71 n
+雪犁 3 nr
+雪球 21 n
+雪白 811 z
+雪白色 3 n
+雪盲 8 n
+雪碗冰瓯 3 nr
+雪碧榜 3 nr
+雪神 2 n
+雪种 3 n
+雪窑冰天 3 ns
+雪窖冰天 3 z
+雪窗萤几 3 r
+雪窗萤火 3 z
+雪窦寺 5 nr
+雪窦山 9 nr
+雪粉 9 n
+雪糕 25 n
+雪纳瑞 3 nr
+雪纺纱 3 n
+雪线 140 n
+雪绒花 3 nr
+雪维菜 3 nr
+雪耻 25 n
+雪耻复国 3 i
+雪耻报仇 3 i
+雪肌精 3 n
+雪肤 3 n
+雪胎梅骨 3 i
+雪舟 4 nz
+雪节 8 n
+雪花 395 n
+雪花儿 2 nr
+雪花呢 4 n
+雪花片片 3 nz
+雪花膏 25 n
+雪花遍地 3 i
+雪茄 95 n
+雪茄烟 30 nz
+雪荷 2 n
+雪莱 37 nr
+雪莲 26 nr
+雪莲子 3 nr
+雪莲花 10 nr
+雪菜 7 n
+雪蚀 3 nz
+雪融 3 n
+雪谷 38 n
+雪豹 72 nz
+雪路 3 n
+雪车 5 n
+雪连纸 3 nz
+雪那瑞 3 nr
+雪里红 2 nr
+雪里蕻 14 n
+雪里送炭 2 n
+雪铁龙 7 nz
+雪雕 9 n
+雪青 10 nr
+雪鞋 3 n
+雪顶 3 n
+雪顿节 5 nr
+雪饼 3 n
+雪鬓霜毛 3 i
+雪鬓霜鬟 3 i
+雪鸟 3 n
+雪鸡 34 n
+雪鸿指爪 3 nr
+雪龙号 14 nz
+雮 133 zg
+雯 8 nr
+雱 2 zg
+雲 6 zg
+零 1848 m
+零一架 6 m
+零一规划 3 l
+零丁 2 n
+零丁孤苦 3 i
+零丁洋 17 n
+零七 3 m
+零七个 2 m
+零七八碎 3 i
+零三 2 m
+零三个 6 m
+零三架 8 m
+零下 144 m
+零下温度 3 n
+零东 3 n
+零两个 8 m
+零个 4 m
+零九个 11 m
+零九天 2 m
+零乱 81 a
+零五个 6 m
+零五分 2 m
+零件 433 mq
+零件厂 3 n
+零件图 3 n
+零件库 3 n
+零件盒 3 n
+零任偶 3 n
+零伤亡 3 i
+零位 3 n
+零修 3 vn
+零儿 3 n
+零元 2 m
+零光片羽 3 n
+零八个 3 m
+零六 2 m
+零六个 4 m
+零关税 3 n
+零冠词 3 n
+零出 3 a
+零刀 2 n
+零分 11 n
+零利率 4 n
+零力系 3 n
+零十四天 2 m
+零卖 4 vn
+零卖商 3 n
+零南 3 s
+零口 2 vn
+零号 3 n
+零吃 3 a
+零周期 3 n
+零售 1397 vn
+零售业 53 n
+零售价 67 n
+零售价格 3 n
+零售商 93 n
+零售处 3 n
+零售店 19 n
+零售总额 3 n
+零售点 4 n
+零售版 3 n
+零售物价 3 n
+零售网 3 n
+零售量 4 n
+零售额 48 n
+零嘴 4 n
+零四个 4 m
+零四十二点 2 m
+零四十八点 2 m
+零四天 2 m
+零四架 18 m
+零圭断璧 3 i
+零型 3 n
+零基 3 n
+零增长 3 n
+零声母 5 n
+零壹 3 m
+零壹公司 3 m
+零备件 7 n
+零头 26 n
+零子 3 n
+零字 3 n
+零存整付 3 n
+零存整取 3 i
+零工 18 vn
+零币 3 n
+零度 26 mq
+零度以上 3 l
+零度以下 3 i
+零度白茶 3 n
+零所 2 n
+零打碎敲 3 i
+零担 5 n
+零排放 2 l
+零摄氏度 2 m
+零散 129 vn
+零数 4 n
+零敲碎打 10 i
+零整 3 vn
+零日 3 m
+零时 58 d
+零时许 3 d
+零星 574 n
+零星小雨 3 n
+零星知识 3 n
+零杂 3 a
+零杂工 3 n
+零次 6 m
+零沽批发 3 n
+零活 11 vn
+零活儿 3 n
+零点 435 n
+零点乐队 3 n
+零点公司 5 n
+零点幕 3 m
+零点能 3 n
+零点调查公司 9 n
+零点零三八 2 m
+零珠碎玉 3 i
+零用 10 vn
+零用费 2 n
+零用金 3 n
+零用钱 34 n
+零电荷点 3 n
+零的突破 3 i
+零碎 134 a
+零秒 4 m
+零税率 2 n
+零空间 3 n
+零篇 4 m
+零米 2 m
+零级 14 vn
+零线 9 n
+零组件 3 n
+零缺点 3 n
+零股 6 n
+零花 6 n
+零花钱 45 n
+零茶 3 n
+零茶影院 3 n
+零落 42 n
+零蛋 2 n
+零起 2 s
+零起点 3 n
+零距离 3 n
+零路 3 n
+零部件 1515 mq
+零配件 74 n
+零重码 3 n
+零钞 9 n
+零钱 41 n
+零长 3 n
+零陵 3 n
+零陵路 3 n
+零集 3 n
+零零 7 z
+零零乱乱 3 i
+零零发 3 m
+零零散散 10 z
+零零星星 17 z
+零零碎碎 25 z
+零零落落 25 z
+零食 397 n
+零首 2 m
+零首付 8 n
+雷 1951 n
+雷一军 2 nr
+雷一啸 8 nr
+雷东达 9 nr
+雷中庆 2 nr
+雷丸 3 nr
+雷之声 2 nr
+雷之源 3 nr
+雷二人 2 nr
+雷二公 4 nr
+雷于蓝 3 nr
+雷于钧 3 nr
+雷亚尔 16 nr
+雷亨顺 12 nr
+雷介公 5 nr
+雷仙器 4 nr
+雷令风行 3 n
+雷伯格 2 nr
+雷体 15 n
+雷傲元 3 nr
+雷先生 4 nr
+雷光 3 nr
+雷光拳 3 nr
+雷克吕 2 nr
+雷克塔 2 nr
+雷克巴 3 nr
+雷克斯 4 nr
+雷克萨 4 nr
+雷克萨斯 3 nr
+雷克雅 2 nr
+雷克雅未克 19 nrt
+雷公 116 nr
+雷公山 15 nr
+雷公柱 3 nr
+雷公藤 3 nr
+雷兽科 3 nr
+雷内克 3 nr
+雷凌振 6 nr
+雷击 213 v
+雷击火 3 n
+雷分兵 3 n
+雷切尔 3 nr
+雷列耶 4 nr
+雷利亚 6 nr
+雷劈 15 n
+雷力利 2 nr
+雷动 46 n
+雷动风行 3 n
+雷北 2 ns
+雷区 40 n
+雷卡尔特 3 nrt
+雷历风行 3 i
+雷厉风行 92 i
+雷厉风飞 3 nr
+雷可秀 3 nr
+雷吉娜 8 nr
+雷吉纳 104 nr
+雷吉纳队 2 nr
+雷同 99 nr
+雷哈尼 2 nr
+雷嗔电怒 3 i
+雷器 2 n
+雷四王子 2 nr
+雷四王爷 2 nr
+雷因斯 3 nr
+雷坛 2 n
+雷坪乡 3 nr
+雷基王 16 nr
+雷士祯 9 nrt
+雷声 337 nr
+雷声大 3 nr
+雷声大作 3 i
+雷声大雨 3 i
+雷天心 2 nr
+雷天觉 2 nr
+雷夫纳 2 nr
+雷奥利 7 nr
+雷子炮 7 nr
+雷孝思 3 nr
+雷宇扬 3 nr
+雷安答 9 nr
+雷害 3 n
+雷家庄 2 nr
+雷家沟 256 nr
+雷宾斯 6 nr
+雷射 80 nr
+雷射枪 3 n
+雷射炮 2 n
+雷将舒 2 nr
+雷尔夫 2 nr
+雷尼克 2 nr
+雷尼尔 2 nr
+雷尼替丁 3 nr
+雷履泰 6 nr
+雷山 53 nr
+雷山县 2 ns
+雷山摩 2 nr
+雷山脉 2 nr
+雷峰 4 nr
+雷峰塔 25 nr
+雷州 120 ns
+雷州半岛 3 ns
+雷州市 3 ns
+雷巴奇 4 nr
+雷布林 2 nr
+雷布查 5 nr
+雷布金 2 nr
+雷希察 2 nr
+雷庆哥 12 nr
+雷庆家 5 nr
+雷庆忙 2 nr
+雷庆想 2 nr
+雷庆来 2 nr
+雷庆泡 2 nr
+雷庆送 2 nr
+雷庭万钧 3 nr
+雷弗洛 2 nr
+雷德 38 nr
+雷德尔 3 nr
+雷德河 6 nr
+雷德福 2 nr
+雷德纳 4 nr
+雷德罗 2 nr
+雷德菲 4 nr
+雷德通 2 nr
+雷德里克 3 nrt
+雷必达 9 nr
+雷志敏 2 nr
+雷恩 17 nr
+雷恩斯 8 nr
+雷恪生 3 z
+雷情深 2 nr
+雷惊电绕 3 i
+雷慕沙 2 nr
+雷戈尔 2 nr
+雷手文 9 nr
+雷扎耶 2 nr
+雷打不动 32 i
+雷抒雁 2 i
+雷拉峰 2 nr
+雷拉抿 2 nr
+雷摩斯 4 nr
+雷敦 11 ns
+雷数 3 n
+雷斯卡 4 nr
+雷斯国 2 ns
+雷斯塔 2 nr
+雷斯特 3 nr
+雷斯皮 3 nr
+雷斯福 2 nr
+雷斯达 6 nr
+雷日科夫 7 nrt
+雷明光 4 nr
+雷明登 17 nr
+雷明顿 6 nr
+雷显明 5 nr
+雷暴 79 n
+雷暴雨 5 nr
+雷曼 10 nr
+雷有子 2 nr
+雷有终 3 nr
+雷术 3 n
+雷根 3 nr
+雷根斯堡 10 ns
+雷格尔 2 nr
+雷格生 3 nr
+雷格蒙 11 nr
+雷格诺 2 nr
+雷梦拉 3 nr
+雷棚 3 n
+雷横先 2 nr
+雷横守 2 nr
+雷横执 2 nr
+雷正兴 2 nr
+雷正妻 3 nr
+雷比 10 nrt
+雷比斯 2 nr
+雷汉义 14 nr
+雷汞 7 n
+雷池 12 nr
+雷法 2 n
+雷波 4 nr
+雷波县 3 nr
+雷泽克 7 nr
+雷泽盖 4 nr
+雷洁琼 21 nr
+雷洛夫 2 nr
+雷洛昔芬 5 nr
+雷洞坪 4 nr
+雷济 2 n
+雷海宗 4 nr
+雷演祚 79 nr
+雷火 18 n
+雷火弹 29 n
+雷火焚 3 i
+雷焦卡拉 2 nr
+雷特曼 2 nr
+雷特河 2 nr
+雷猴 3 n
+雷琐辛 2 nr
+雷瑟福 6 nr
+雷瓦尔 4 nr
+雷电 370 n
+雷电交加 8 nz
+雷电术 3 n
+雷监国 3 nr
+雷神之锤 3 nr
+雷神庙 13 nr
+雷福斯 25 nr
+雷科巴 3 nr
+雷科雷 3 nr
+雷管 81 n
+雷管线 3 n
+雷米埃 9 nr
+雷米耶 2 nr
+雷系 5 n
+雷素 2 n
+雷红霞 2 nr
+雷约 2 n
+雷纳德 3 nr
+雷纳托 6 nr
+雷统 2 n
+雷维尔 7 nr
+雷维素 3 nr
+雷网 2 n
+雷老爷 3 nr
+雷耶斯 11 nr
+雷舰 9 n
+雷艇 9 n
+雷英夫 3 nr
+雷茨 3 nrt
+雷荣天 2 nr
+雷菊芳 4 nr
+雷蒙举 2 nr
+雷蒙德 5 nr
+雷蒙磨 3 l
+雷蒙笑 2 nr
+雷蒙达 3 nr
+雷虎小组 3 nr
+雷西亚 3 nr
+雷西昂 2 nr
+雷观 24 n
+雷观笑 2 nr
+雷诺 65 nr
+雷诺兹 9 nr
+雷诺数 27 nr
+雷诺方 2 nr
+雷诺氏 3 nr
+雷诺瓦 2 nr
+雷诺病 3 nr
+雷诺萨 4 nr
+雷诺阿 16 nr
+雷贯耳 2 nr
+雷轰 19 nr
+雷轰电闪 6 i
+雷达 2930 nr
+雷达信标 3 nr
+雷达兵 18 nr
+雷达员 3 nr
+雷达哨艇 3 n
+雷达探测 2 nr
+雷达站 93 nr
+雷达网 6 nr
+雷达表 3 nr
+雷达遥感 3 l
+雷迪森 2 nr
+雷遥遥 2 nr
+雷量 3 n
+雷锋 232 nr
+雷锋塔 3 nr
+雷锋式 3 n
+雷锋报 3 n
+雷锋精神 3 i
+雷锋纪念馆 5 n
+雷锡恩 6 nr
+雷镇语 3 nr
+雷阵雨 222 nr
+雷阿伦 3 nr
+雷雨 195 nr
+雷雨云 8 nr
+雷雨交加 3 i
+雷雨大风 2 nr
+雷霆 249 nr
+雷霆万钧 28 nr
+雷霆之怒 3 nr
+雷霆霹雳 3 i
+雷震之 2 nr
+雷震会 4 nr
+雷震天 3 nr
+雷震甲 4 nr
+雷震电 3 nr
+雷震震 2 nr
+雷音 31 n
+雷音宝 5 nr
+雷音寺 34 nr
+雷顶 2 n
+雷风云 2 nr
+雷风烈 2 nr
+雷飞张 3 nr
+雷马克 13 nr
+雷马根 3 nr
+雷鬼 2 nr
+雷鸟 36 nr
+雷鸣 129 nr
+雷鸣声 3 nr
+雷鸣瓦釜 3 n
+雷鸣电闪 16 l
+雷鸣般 3 nr
+雷默奇 8 nr
+雷龙 6 nr
+雹 88 ng
+雹子 12 n
+雹害 3 n
+雹暴 3 n
+雹灾 16 n
+雹霰 3 n
+電 4 zg
+雼 3 zg
+雾 1542 n
+雾信号器 3 n
+雾兴云涌 3 i
+雾凇 17 n
+雾化 21 n
+雾化器 5 n
+雾台 3 n
+雾天 6 n
+雾害 3 n
+雾峰 3 ns
+雾惨云愁 3 i
+雾散云披 3 n
+雾暗云深 3 i
+雾气 220 n
+雾气腾腾 8 z
+雾水 67 n
+雾沉沉 3 z
+雾涌云蒸 3 i
+雾滴 23 z
+雾灯 3 n
+雾灰色 3 n
+雾灵 2 n
+雾灵山 22 ns
+雾状 3 n
+雾社 14 n
+雾笛 3 n
+雾腾腾 29 z
+雾色 3 n
+雾茫茫 8 z
+雾蒙蒙 32 z
+雾起云涌 3 i
+雾都 17 ns
+雾释冰融 3 n
+雾里 3 ns
+雾里看花 17 i
+雾里观花 3 ns
+雾锁烟迷 3 i
+雾阁云窗 3 n
+雾障 3 n
+雾集云合 3 ns
+雾霭 22 z
+雾霭蒙蒙 3 z
+雾非雾 3 i
+雾鬓云鬟 3 i
+雾鬓风鬟 3 i
+雾鳞云爪 3 i
+需 9183 v
+需不需要 29 v
+需加 3 v
+需将 3 n
+需帖 3 n
+需承担 3 n
+需提交 3 n
+需方 3 n
+需有 3 v
+需款 3 n
+需款孔急 3 n
+需氧量 17 n
+需水 19 n
+需水量 16 n
+需求 5424 v
+需求增 3 v
+需求方 9 n
+需求者 13 n
+需求量 299 n
+需求面 3 n
+需求预测 3 n
+需沙出穴 3 n
+需注意 3 n
+需用 161 v
+需知 3 v
+需索 4 v
+需肥量 2 n
+需脚本 3 n
+需要 27430 v
+需要的话 3 n
+需要量 62 n
+需设 3 v
+需谨慎 3 n
+霁 57 vg
+霁月 3 n
+霁月光风 2 i
+霁色 2 n
+霁风朗月 3 i
+霃 20 zg
+霄 71 nr
+霄壤 3 n
+霄壤之别 4 i
+霄壤之殊 3 i
+霄夜 3 n
+霄汉 17 n
+霄鱼垂化 3 i
+霅 2 zg
+霅溪 3 nz
+霆 33 g
+震 2904 v
+震东帮 3 nz
+震中 80 v
+震中区 3 n
+震主之威 3 nz
+震于 3 v
+震元 3 nz
+震动 841 vn
+震动手柄 3 i
+震动筛 3 nz
+震动计 3 vn
+震区 53 n
+震古烁今 7 i
+震古铄今 3 i
+震后 29 t
+震响 30 vn
+震垮 3 v
+震天 397 t
+震天价响 3 i
+震天动地 52 i
+震天响 3 i
+震天撼地 12 i
+震天雷 5 i
+震天骇地 3 i
+震央 3 n
+震害 8 v
+震山子 3 nz
+震幅 13 n
+震怒 126 v
+震悸 3 v
+震悼 3 v
+震情 10 v
+震惊 1074 v
+震惊中华 3 i
+震惊中外 3 i
+震惊全国 3 i
+震惧 3 v
+震感 17 v
+震慄 3 vn
+震慑 149 v
+震慑力 7 n
+震憾 26 v
+震憾全球 3 nz
+震憾力 3 vn
+震摇 3 v
+震撼 696 v
+震撼人心 53 i
+震撼价 3 i
+震撼作用 3 i
+震撼力 28 i
+震撼性 7 n
+震旦 47 t
+震旦系 24 n
+震旦纪 50 t
+震次 3 t
+震波 5 v
+震泽镇 2 n
+震洲 3 n
+震源 75 n
+震源地 3 v
+震源组合 3 n
+震灾 17 vn
+震矜 3 v
+震破 3 vn
+震级 94 vn
+震耳 45 v
+震耳欲聋 111 i
+震聋发聩 3 i
+震荡 456 v
+震荡不安 3 i
+震荡性 3 n
+震荡波 3 i
+震裂 3 v
+震震 3 n
+震音 3 n
+震颤 209 v
+震颤跳动 3 i
+震颤麻痹 3 n
+震风 3 v
+震骇 22 n
+霈 2 g
+霉 391 n
+霉乾菜 3 v
+霉变 62 v
+霉味 14 n
+霉天 3 n
+霉头 3 n
+霉女 3 n
+霉干菜 3 n
+霉斑 7 n
+霉毒 3 n
+霉气 20 n
+霉气冲天 3 n
+霉潮 3 n
+霉烂 33 n
+霉病 4 n
+霉素 104 n
+霉素发酵 2 n
+霉菌 193 n
+霉菌性 3 n
+霉菌病 9 n
+霉运 3 n
+霉运当头 3 v
+霉酚酸 3 n
+霉雨 6 n
+霉香 3 n
+霍 913 nr
+霍万斯 2 nr
+霍丘 6 nr
+霍丘县 3 nr
+霍乱 85 d
+霍乱弧菌 3 n
+霍乱菌 3 n
+霍五娘 3 nr
+霍亨施 10 nr
+霍亨索 24 nr
+霍亨萨 2 nr
+霍以剑 2 nr
+霍伊特 7 nr
+霍元甲 8 nr
+霍元龙 44 nr
+霍先生 4 nr
+霍光尊 2 nr
+霍光死 3 nr
+霍光秉 2 nr
+霍克 73 nr
+霍克尼 2 nr
+霍克森 10 nr
+霍克菲 2 nr
+霍兰德 5 nr
+霍内斯 2 nr
+霍利卡 4 nr
+霍利嘉 3 nr
+霍利抢 8 nr
+霍利换 2 nr
+霍利节 2 nr
+霍利菲尔德 4 nrt
+霍利跳 4 nr
+霍加斯 2 nr
+霍勒瑞 8 nr
+霍华德 61 nr
+霍博克 4 nr
+霍博肯 2 nr
+霍厄街 3 nr
+霍去病 60 nr
+霍县 18 ns
+霍叔监 2 nr
+霍吉斯 4 nr
+霍启刚 2 nr
+霍启山 3 nr
+霍在梦 2 nr
+霍地 208 nr
+霍城 12 nr
+霍城南 3 ns
+霍城县 17 ns
+霍城至 2 nr
+霍大娘 3 nr
+霍夫人 2 nr
+霍夫堡 2 nr
+霍夫斯 9 nr
+霍夫曼 69 nr
+霍夫特 5 nr
+霍夫迈 2 nr
+霍奇森 5 nr
+霍奇金 36 nr
+霍姆伯 2 nr
+霍姆斯 27 nr
+霍姊姊 2 nr
+霍威尔 2 nr
+霍婆子 189 nr
+霍守业 7 nr
+霍宝柱 6 nr
+霍将军 2 nr
+霍小勇 2 nr
+霍小玉 15 nr
+霍尔 98 nr
+霍尔丹 11 nr
+霍尔克拉 18 nrt
+霍尔卡 2 nr
+霍尔堡 5 nr
+霍尔塔 3 nr
+霍尔姆 6 nr
+霍尔子群 3 nr
+霍尔巴赫 8 nrt
+霍尔斯 13 nr
+霍尔斯特 11 nrt
+霍尔木 5 nr
+霍尔木兹 13 nr
+霍尔木兹海峡 72 ns
+霍尔果斯 12 nrt
+霍尔格 2 nr
+霍尔特 4 nr
+霍尔瓦特 2 nrt
+霍尔登 2 nr
+霍尔穆 3 nr
+霍尔茨 8 nrt
+霍尔蒂 14 nr
+霍尔金娜 10 nr
+霍尤克 2 nr
+霍尼亚拉 5 nrt
+霍尼韦尔 22 nrt
+霍屯督 24 nr
+霍山 39 nr
+霍山县 4 ns
+霍峻守 3 nr
+霍州 19 ns
+霍州市 3 ns
+霍巴特 17 nr
+霍布斯 26 nr
+霍布根 2 nr
+霍布森 10 nr
+霍布豪 7 nr
+霍布逊 2 nr
+霍平君 18 nr
+霍建宁 4 nr
+霍德兹 2 nr
+霍德勒 2 nr
+霍德尔 2 nr
+霍思燕 3 nr
+霍恩布 3 nr
+霍成君 16 nr
+霍拉姆 4 nr
+霍拉山 3 nr
+霍拉斯 2 nr
+霍拉桑 11 nr
+霍拉特 20 nr
+霍振祥 5 nr
+霍斯内 2 nr
+霍斯特 3 nr
+霍斯特曼 2 nrt
+霍斯陆 3 nr
+霍春阳 5 nr
+霍普夫 2 nr
+霍普森 3 nr
+霍普菲 13 nr
+霍普金 2 nr
+霍普金斯 10 nr
+霍普金斯大学 59 nt
+霍普镇 2 nr
+霍普韦尔 2 nrt
+霍智宇 6 nr
+霍曼斯 6 nr
+霍来特 2 nr
+霍林河 7 nr
+霍林舍 2 nr
+霍林郭勒 3 nr
+霍格兰 2 nr
+霍桑效应 3 nr
+霍梅尼 32 nr
+霍次克 32 nr
+霍比特 3 nr
+霍氏家族 2 nr
+霍氏权 2 nr
+霍洛德 2 nr
+霍洛曼 5 nr
+霍洞主 2 nr
+霍温第 2 nr
+霍然 51 d
+霍然而愈 3 nr
+霍特林 2 nr
+霍珀 8 nrt
+霍瓦兹 5 nr
+霍皇后 6 nr
+霍童溪 3 nr
+霍纳桑 4 nr
+霍纳法 8 nr
+霍经伦 3 nr
+霍维华 2 nr
+霍罗波 2 nr
+霍耳效应 3 nr
+霍英东 15 nr
+霍茹夫 3 nr
+霍诺留 2 nr
+霍贝玛 3 nr
+霍费尔 3 nr
+霍赫胡 2 nr
+霍邱 3 nr
+霍邱县 2 nr
+霍都 163 ns
+霍都举 4 nr
+霍都伸 2 nr
+霍都先 2 nr
+霍都全 2 nr
+霍都双 2 nr
+霍都右 2 nr
+霍都吓 2 nr
+霍都实 2 nr
+霍都居 2 nr
+霍都心 4 nr
+霍都怒 4 nr
+霍都情 2 nr
+霍都挥 3 nr
+霍都放 2 nr
+霍都斗 2 nr
+霍都曾 2 nr
+霍都混 2 nr
+霍都王子 20 nr
+霍都空 2 nr
+霍都笑 4 nr
+霍都羞 2 nr
+霍都若 2 nr
+霍都见 10 nr
+霍都转 2 nr
+霍都长 2 nr
+霍都齐 2 nr
+霍金 32 nr
+霍金如 4 nr
+霍金斯 20 nr
+霍金的 2 nr
+霍闻海 11 nr
+霍阿伊 19 nr
+霍集占 25 nr
+霍震霆 3 nr
+霍霍 25 nr
+霍霍生 2 nr
+霍青桐 648 nr
+霍顿 16 nr
+霍鲁海 2 nr
+霎 66 d
+霎时 548 t
+霎时之间 3 vn
+霎时间 307 t
+霎那 3 t
+霎那之间 3 vn
+霎那间 11 t
+霏 268 z
+霏霏 14 z
+霏霏细雨 3 v
+霑 3 zg
+霓 330 n
+霓红柱 3 n
+霓红灯 3 n
+霓虹 23 n
+霓虹灯 93 n
+霓裳 35 n
+霖 83 nr
+霖生 14 n
+霖雨 5 n
+霜 852 n
+霜冻 103 n
+霜凋夏绿 3 nz
+霜剂 6 n
+霜化 3 n
+霜叶 8 t
+霜天 14 t
+霜害 3 n
+霜寒 3 n
+霜打雨淋 3 n
+霜晨 3 t
+霜期 6 t
+霜气横秋 3 n
+霜淇淋 3 n
+霜穴 3 n
+霜絮 3 n
+霜花 15 n
+霜行草宿 3 n
+霜降 146 n
+霜雪 49 n
+霜霉病 34 n
+霜露 17 t
+霜露之思 3 nz
+霜露之悲 3 n
+霜露之感 3 n
+霜露之病 3 n
+霜露之辰 3 nz
+霜鬓 3 n
+霞 414 n
+霞云 3 n
+霞云岭 2 ns
+霞儿 4 n
+霞光 135 n
+霞光万道 4 l
+霞光满天 3 l
+霞冠 3 n
+霞友云朋 3 n
+霞境村 3 n
+霞天 3 n
+霞姿月韵 3 n
+霞山 3 ns
+霞山区 5 ns
+霞帔 23 n
+霞彩 10 n
+霞思云想 3 n
+霞思天想 3 n
+霞明玉映 3 nz
+霞暮迷人 3 vn
+霞浦 7 ns
+霞浦县 3 ns
+霞照 3 n
+霞石 25 n
+霞蔚云蒸 3 nz
+霞衣 3 n
+霞裙月帔 3 n
+霞辉 3 n
+霞飞路 3 n
+霣 8 zg
+霤 4 zg
+霨 7 zg
+霩 4 zg
+霪 3 n
+霪雨 3 n
+霫 3 zg
+霭 76 ng
+霭霭 16 z
+霰 60 n
+霰弹 55 n
+霰弹枪 3 n
+露 2822 v
+露一下 3 n
+露一手 32 n
+露三点 3 n
+露两手 3 n
+露两点 3 n
+露乳沟 3 n
+露体 3 n
+露光 3 n
+露出 3058 v
+露出原形 3 n
+露出破绽 3 n
+露出马脚 3 n
+露半球 3 n
+露华浓 3 nz
+露台 35 v
+露地 37 n
+露地栽培 3 vn
+露天 642 v
+露天剧场 3 n
+露天开采 3 v
+露天煤矿 3 nz
+露天甲板 3 nz
+露天电影 3 n
+露天矿 38 n
+露天表演 3 n
+露天集市 3 n
+露头 66 v
+露头脚 3 n
+露头角 9 n
+露宿 80 v
+露宿街头 3 n
+露宿风餐 3 n
+露富 3 a
+露尸 3 n
+露尾巴 3 n
+露尾藏头 3 n
+露己扬才 3 n
+露布 6 v
+露底 3 v
+露影藏形 3 n
+露往霜来 3 vn
+露得清 3 v
+露怯 7 a
+露才 3 n
+露才扬己 3 n
+露易丝 10 n
+露有 3 v
+露水 133 v
+露水夫妻 3 n
+露水河 3 n
+露点 17 n
+露点仪 3 n
+露点图 3 v
+露点曲线 3 n
+露点照 3 v
+露牙 3 v
+露珠 51 n
+露珠儿 4 n
+露白 2 v
+露相 8 n
+露纂雪钞 3 n
+露红烟紫 3 n
+露红烟绿 3 n
+露肚脐 3 n
+露胆披肝 3 v
+露胆披诚 3 vn
+露背 3 v
+露背装 3 n
+露脐装 4 n
+露脸 70 v
+露脸儿 3 n
+露芝 2 nrt
+露苗 3 n
+露营 72 v
+露营地 3 n
+露营车 3 n
+露蜂房 3 n
+露袒 3 v
+露西 14 n
+露西亚 3 nrt
+露豪乳 3 n
+露酒 10 v
+露酥胸 3 n
+露钞雪纂 3 n
+露阴癖 3 n
+露雨 3 n
+露露 9 v
+露露脸 2 n
+露面 386 n
+露面抛头 3 vn
+露顶 3 n
+露风 3 n
+露餐风宿 3 n
+露馅 19 v
+露馅儿 2 v
+露马脚 5 n
+露骨 71 n
+露髓 3 n
+露齿 17 n
+霳 908 zg
+霸 810 n
+霸业 97 n
+霸主 284 n
+霸占 145 v
+霸占住 3 n
+霸县 7 ns
+霸图 3 n
+霸天虎 3 n
+霸州 48 ns
+霸州市 3 ns
+霸权 378 n
+霸权主义 175 n
+霸正 3 v
+霸气 66 n
+霸王 268 n
+霸王丸 3 n
+霸王传 3 l
+霸王别姬 27 l
+霸王枪 3 n
+霸王花 3 n
+霸王车 3 n
+霸王鞭 5 n
+霸王风月 3 l
+霸王餐 3 n
+霸王龙 13 ns
+霸着 3 v
+霸者 3 n
+霸者之证 3 n
+霸道 211 n
+霸道横行 3 l
+霸陵醉尉 3 n
+霹 8 n
+霹雳 320 n
+霹雳娇娃 3 n
+霹雳弹 3 n
+霹雳游侠 3 n
+霹雳火 3 n
+霹雳炮 3 n
+霹雳舞 9 n
+霹雳车 3 n
+霹雷 10 n
+霺 15 zg
+霾 107 g
+霿 2 zg
+靉靆 3 z
+靊 4 zg
+青 5581 ns
+青丘子 2 nr
+青丝 59 n
+青丝白马 3 n
+青乌 2 ns
+青乌术 3 nr
+青云 47 ns
+青云万里 3 ns
+青云山 2 ns
+青云独步 3 i
+青云直上 21 i
+青云街 2 ns
+青云谱区 2 n
+青云路 3 ns
+青仁乌 2 nr
+青仙露 9 nr
+青儿 21 n
+青光 97 n
+青光如 2 nr
+青光眼 43 nr
+青光闪 7 nr
+青光霍 2 nr
+青兰 2 ns
+青冈 50 ns
+青冈县 3 ns
+青冈林 3 ns
+青冈树 2 ns
+青冠黄 2 nr
+青冢 4 n
+青冷 3 ns
+青凤阁 8 nr
+青出于 3 v
+青出于蓝 26 i
+青出于蓝而胜于蓝 5 i
+青刀豆 3 n
+青创益 3 n
+青剑兮 2 nr
+青化砭 21 ns
+青南 24 ns
+青原 4 ns
+青原区 3 ns
+青县 14 ns
+青口 5 ns
+青口白舌 3 i
+青史 63 n
+青史传名 3 n
+青史垂名 3 n
+青史标名 3 n
+青史流芳 3 nr
+青史留名 28 n
+青史留芳 3 nr
+青叶 3 n
+青叶胆 3 nr
+青吉勒 3 nr
+青君兄 26 nr
+青唐羌 8 nr
+青商 3 n
+青商会 3 nt
+青地境 2 j
+青坡 4 ns
+青埂峰 11 nr
+青城 507 ns
+青城山 105 ns
+青城派 3 nr
+青基会 14 nt
+青堂瓦舍 3 i
+青壮年 154 nr
+青壮年人 3 l
+青天 130 t
+青天白日 70 n
+青天霹雳 3 i
+青女 2 n
+青妹 15 n
+青委 3 j
+青娱乐 3 nr
+青嫩 4 ns
+青子 6 n
+青子道 3 nr
+青安岗 3 ns
+青安杯 3 nz
+青官 3 n
+青家 3 n
+青少 3 v
+青少年 1223 nr
+青少年儿童 4 l
+青少年宫 5 n
+青少年犯 2 n
+青少棒 3 nr
+青尼罗河 25 ns
+青山 192 ns
+青山一发 3 nz
+青山不老 3 i
+青山冰臼 2 ns
+青山区 521 ns
+青山常在 3 i
+青山湖 3 ns
+青山湖区 3 ns
+青山秀水 3 ns
+青山素子 3 nr
+青山绫里 2 t
+青山绿水 29 ns
+青山羊 2 ns
+青山翠谷 3 ns
+青岗 3 ns
+青岚湖 2 nr
+青岛 2190 ns
+青岛东路 3 ns
+青岛啤酒集团 2 nt
+青岛大学 14 nt
+青岛市 113 ns
+青岛市政府 3 nt
+青岛市旅游局 3 nt
+青岛房产 3 n
+青岛海尔 7 ns
+青岛海洋大学 11 nt
+青岛港 23 ns
+青岛碱业 15 n
+青岛西路 3 ns
+青岛队 132 nt
+青岩 10 ns
+青岩板 3 nr
+青峰 11 ns
+青川 12 ns
+青川县 5 ns
+青州 223 ns
+青州从事 3 n
+青州市 12 ns
+青州府 9 nt
+青工 59 n
+青巾 3 n
+青巾者 5 nr
+青布 16 v
+青布罩 2 n
+青布衫 3 nr
+青帮 18 j
+青干班 4 ns
+青年 7606 t
+青年一代 3 t
+青年中心 3 nt
+青年人 350 n
+青年令 3 n
+青年会 56 nt
+青年修养 3 n
+青年党 3 nt
+青年商会 3 nt
+青年团 108 nt
+青年城 3 ns
+青年学 3 nt
+青年宫 2 n
+青年工人 3 n
+青年干部 3 n
+青年志愿者协会 2 nt
+青年才俊 3 nr
+青年报 42 n
+青年救国 3 ns
+青年教师 3 n
+青年文明 3 l
+青年日报 3 nz
+青年时代 3 t
+青年有为 3 l
+青年期 3 t
+青年歌手 3 l
+青年湖 3 ns
+青年电影制片厂 2 nt
+青年科 2 n
+青年组 3 n
+青年网 3 n
+青年节 9 t
+青年节日 3 n
+青年装 3 b
+青年赛 5 n
+青年辅导 3 n
+青年运动 3 l
+青年队 29 nt
+青幽 3 z
+青庙 3 ns
+青康滇纵 3 nr
+青康藏 2 ns
+青康藏高 3 nz
+青弋江 16 nr
+青弟 10 n
+青影 9 n
+青徐兵 2 nr
+青徽素 3 nr
+青戈江 3 ns
+青文 3 n
+青旅 18 j
+青旅控股 13 nz
+青旗 7 ns
+青旗军 9 nt
+青旗红 2 nr
+青春 1089 ns
+青春不老 3 i
+青春偶像 3 n
+青春少女 3 nr
+青春岁月 3 i
+青春年华 3 nz
+青春年少 23 l
+青春文学 3 nt
+青春有限 3 n
+青春期 231 t
+青春校园 3 nr
+青春永驻 3 nr
+青春活力 3 n
+青春片 4 n
+青春痘 52 nz
+青春豆 3 nr
+青木 281 ns
+青木堂 49 nr
+青木堂中 6 ns
+青木堂众 3 i
+青木堂韦 6 ns
+青木堂香 28 nr
+青木正儿 2 nr
+青木河 256 ns
+青木瓜 3 ns
+青木香 7 nr
+青未了 3 l
+青来 3 t
+青杨 19 nr
+青松 75 n
+青林黑塞 3 ns
+青果 23 n
+青果协 3 j
+青果巷 3 ns
+青枝绿叶 6 nr
+青枣 6 n
+青枯病 10 n
+青柳猛 2 nr
+青格 7 n
+青桃 2 n
+青桐 8 n
+青梅 37 nr
+青梅竹马 50 ns
+青棒 3 n
+青森 9 nr
+青森县 6 ns
+青森森 2 nr
+青椒 28 n
+青楼 70 n
+青楼女子 2 n
+青楼楚馆 3 nr
+青楼艳妓 3 n
+青檀 2 nr
+青毛虎 2 nr
+青气 2 n
+青水 2 ns
+青江 3 ns
+青河 31 ns
+青河县 13 ns
+青洪帮 6 nr
+青洲 2 ns
+青洽会 3 j
+青浦 38 ns
+青浦区 5 ns
+青浦县 22 ns
+青海 932 ns
+青海华鼎 4 nr
+青海地区 10 ns
+青海大学 7 nt
+青海柴达木盆地 6 ns
+青海湖 114 ns
+青海省 283 ns
+青海省人民政府 2 nt
+青海省循化撒拉族自治县 2 ns
+青海矿区 3 ns
+青海苔 3 nr
+青海高原 9 ns
+青涩 3 a
+青涩宝贝 3 nr
+青溪 67 ns
+青溪镇 23 ns
+青滩 3 ns
+青灯 15 n
+青灯古佛 10 nz
+青灯黄卷 2 nz
+青灰 13 n
+青灰色 37 n
+青灵子 27 nr
+青烟 73 n
+青牛 5 n
+青物 3 n
+青狮潭 3 nr
+青猫 3 n
+青玉案 3 nr
+青环 14 ns
+青瓜 7 n
+青瓦 11 ns
+青瓦台 5 ns
+青瓷 143 n
+青田 37 ns
+青田县 5 ns
+青田石 9 nr
+青甲狮 11 nr
+青白 56 n
+青白江 2 ns
+青白江区 3 ns
+青白玉 2 nr
+青白色 16 n
+青百 3 j
+青皮 27 n
+青皮竹 3 nr
+青盐 3 n
+青目 3 n
+青眼 40 n
+青眼有加 3 l
+青眼相看 3 i
+青睐 696 v
+青睐有加 12 l
+青石 231 n
+青石条 2 n
+青石板 135 n
+青石板路 5 n
+青石桥 14 ns
+青石路 3 ns
+青砖 155 n
+青砖青 2 nr
+青碧色 3 nr
+青磁 3 n
+青磐岩 2 nr
+青礞石 3 vn
+青神 4 n
+青神县 2 ns
+青秀区 2 nr
+青秀山 2 nr
+青稞 134 n
+青稞酒 25 n
+青稞麦 3 n
+青空 2 n
+青竹 352 ns
+青竹丝 3 nr
+青竹丹枫 3 nr
+青筋 132 n
+青粗饲料 3 vn
+青紫 60 nr
+青紫被体 3 nr
+青红丝 2 nr
+青红帮 4 nr
+青红皁白 3 z
+青红皂白 18 l
+青红芽 2 nr
+青红鞍 3 nr
+青纱 3 n
+青纱帐 18 n
+青绿 91 nr
+青绿色 3 n
+青罗 6 ns
+青羊 5 ns
+青羊区 3 ns
+青羊宫 4 nr
+青翠 51 nr
+青翠欲滴 9 i
+青翠色 3 nr
+青翼 18 n
+青联 22 ns
+青肝碧血 3 i
+青肿 3 n
+青脸儿 5 nr
+青色 264 n
+青艺 2 n
+青花 108 n
+青花瓷 51 n
+青花菜 3 n
+青花鱼 3 n
+青苍 3 ns
+青苍色 2 i
+青苔 55 n
+青苔村 3 nr
+青苗 63 n
+青苗法 3 nr
+青苹果 3 nz
+青茶 8 n
+青草 296 n
+青草地 11 n
+青草坡 3 ns
+青草湖 3 ns
+青莲 14 nr
+青莲寺 2 nr
+青莲居士 2 nr
+青莲岗 9 nr
+青莲色 3 nr
+青莲镇 3 nr
+青菌 3 n
+青菜 164 n
+青菜头 3 n
+青菜汤 3 n
+青菜萝卜 7 n
+青萝卜 2 n
+青葙子 3 v
+青葱 284 b
+青葱葱 3 nr
+青蒜 5 n
+青蒿 82 nr
+青蒿素 3 nr
+青蓝 16 nr
+青蓝冰水 3 nr
+青蓝紫 3 nr
+青蓝色 5 n
+青藏 220 ns
+青藏公路 40 ns
+青藏线 3 n
+青藏铁路 111 nz
+青藏高原 411 ns
+青藜学士 3 n
+青藤 17 nr
+青虾 8 n
+青蛇 54 n
+青蛙 340 n
+青蛙人 3 nr
+青蛙王子 3 nr
+青蛙肉 3 nr
+青蛙腿 3 nr
+青蛤 3 n
+青蜂 2 n
+青蜂钉 3 nr
+青蝇 3 n
+青蝇吊客 3 vn
+青蝇染白 3 nz
+青蝇点玉 3 nz
+青蝇点素 3 nz
+青螺 3 n
+青蟹 13 n
+青衣 319 n
+青衣人 3 n
+青衣楼 3 n
+青衣江 3 nr
+青衫 54 n
+青衫司马 3 nr
+青衫少女 2 nr
+青衿 3 nr
+青裙玉 2 nr
+青裙缟袂 3 v
+青豆 30 n
+青贮 10 j
+青贮窖 3 n
+青贮饲料 3 n
+青跃 52 v
+青跃道 7 nr
+青辅会 3 nr
+青过于蓝 3 i
+青釉 4 n
+青釉瓷器 3 n
+青金石 7 nr
+青钢剑 6 nr
+青钱万选 3 i
+青钱学士 3 n
+青钱柳 3 nr
+青铜 950 n
+青铜像 3 n
+青铜剑 3 nr
+青铜器 361 n
+青铜器时代 13 t
+青铜峡 38 ns
+青铜峡市 10 ns
+青铜峡铝厂 2 nt
+青铜时代 3 t
+青铜目 3 n
+青铜色 3 n
+青铜镜 2 nz
+青锋 5 n
+青阳 12 ns
+青阳县 3 ns
+青阳腔 3 n
+青阳镇 3 ns
+青陵 2 ns
+青雀 3 n
+青霄白日 3 i
+青霄直上 3 i
+青霉 3 n
+青霉素 194 n
+青霜 2 nz
+青霜剑 3 nr
+青青 954 nr
+青青草 3 nr
+青青草原 3 ns
+青面獠牙 14 i
+青鞋布袜 3 n
+青风 16 n
+青风寨 3 nr
+青风藤 3 nr
+青风道 2 n
+青饲料 10 n
+青马 27 ns
+青驴 3 n
+青骢马 8 nr
+青鱼 41 n
+青鸟 60 n
+青鸟殷勤 3 nr
+青麻 9 n
+青黄不接 43 i
+青黄未接 3 i
+青黄沟木 3 ns
+青黑 8 ns
+青黑色 12 n
+青龙 164 ns
+青龙刀 21 nr
+青龙县 4 ns
+青龙堂 2 nr
+青龙寺 10 ns
+青龙山 13 ns
+青龙峡 4 ns
+青龙帮 3 nr
+青龙桥 12 ns
+青龙江 2 ns
+青龙河 7 ns
+青龙湖 6 ns
+青龙满族自治县 2 ns
+青龙滩 8 ns
+青龙金匮 3 i
+青龙镇 11 ns
+青龙门 2 ns
+青龙集 4 ns
+青龙顿 2 ns
+靓 58 a
+靓丽 32 a
+靓丽女性 3 n
+靓仔 3 n
+靓声 3 n
+靓女 13 n
+靓妆 5 n
+靓妞 3 n
+靓妹 3 n
+靓姐 3 n
+靓照 3 n
+靖 541 nr
+靖乱 3 nz
+靖二藩 2 nr
+靖伯 4 ns
+靖侯卒 2 nr
+靖侯史 3 nr
+靖南侯 3 nr
+靖南王 8 nr
+靖哥哥 63 nr
+靖回军 2 nr
+靖国 3 ns
+靖国军 4 nr
+靖国安 20 nr
+靖国神社 75 nr
+靖宇 7 nr
+靖宇县 10 nr
+靖安 5 ns
+靖安县 2 ns
+靖寇大 2 nr
+靖州 4 ns
+靖康 59 nr
+靖康君 4 nr
+靖康朝 2 nr
+靖志远 5 nr
+靖援台 3 nr
+靖江 18 ns
+靖江县 3 ns
+靖江市 2 ns
+靖海 3 ns
+靖海侯 3 nr
+靖海将军 2 nr
+靖海王 2 nr
+靖港 3 ns
+靖西 6 ns
+靖西县 4 ns
+靖言庸回 3 nr
+靖言庸违 3 nr
+靖谮庸回 3 z
+靖边 24 ns
+靖边县 6 ns
+靖远 45 nr
+靖远县 5 ns
+靖逆侯 2 nr
+静 2453 nr
+静一动 2 l
+静下 3 v
+静下去 3 l
+静下心来 3 l
+静下来 3 l
+静乐 18 nr
+静乐县 5 ns
+静以制动 3 l
+静伏 2 v
+静休息区 3 n
+静候 92 n
+静僻 3 a
+静养 72 v
+静冈 20 ns
+静冈县 11 ns
+静净斋 4 nr
+静力 44 n
+静力学 73 l
+静卧 20 v
+静卧在 3 v
+静压 34 n
+静压梯度 3 n
+静听 155 v
+静嘉堂 4 nr
+静园 4 n
+静地 3 z
+静场 3 n
+静坐 187 v
+静坐少出 3 l
+静坐疗法 3 n
+静坐示威 3 l
+静夜 3 n
+静如处女 3 l
+静如处子 5 l
+静宁 33 nr
+静宁县 4 ns
+静安 50 nr
+静安区 29 ns
+静安寺 3 nr
+静定 12 v
+静定问题 3 l
+静宜 2 v
+静宜女子 3 l
+静宜文理 3 nr
+静室 8 n
+静寂 70 z
+静寂寂 3 nr
+静居寺 3 nr
+静州 2 ns
+静平衡 3 nr
+静幽幽 3 z
+静影沉璧 3 i
+静心 55 n
+静心思过 3 l
+静态 204 n
+静态冒险 3 l
+静态平衡 3 l
+静态数据 2 n
+静态方法 3 l
+静息 54 n
+静息细胞 3 n
+静悄悄 324 z
+静摩擦 3 l
+静摩擦力 8 l
+静智大师 3 nr
+静极思动 3 l
+静校正量 3 n
+静止 582 v
+静止不动 3 l
+静止图像 8 n
+静止地 3 l
+静水 5 n
+静水压 12 n
+静水压力 3 n
+静水流 3 n
+静江 2 ns
+静注 20 v
+静海 24 ns
+静海县 11 ns
+静滴 3 z
+静照 3 n
+静物 27 n
+静物画 27 n
+静玄师太 3 nr
+静电 453 n
+静电作用 3 l
+静电保护 3 n
+静电健康 3 nz
+静电力 3 n
+静电势 3 n
+静电印刷 3 l
+静电场 14 n
+静电学 13 n
+静电屏蔽 4 l
+静电引力 3 n
+静电感应 19 l
+静电推斥 3 v
+静电效应 3 l
+静电积累 3 l
+静电聚焦 3 nz
+静电能 3 n
+静电荷 7 n
+静电计 4 l
+静电透镜 3 nz
+静磁学 3 n
+静磨擦 3 l
+静穆 27 nr
+静穆无声 3 nr
+静空 3 n
+静立 11 v
+静置 3 n
+静肃 3 ns
+静脉 677 n
+静脉曲张 67 l
+静脉注射 36 l
+静脉滴注 3 l
+静脉炎 15 nr
+静脉瘤 3 l
+静脉血 3 l
+静脉针 3 n
+静舍 3 n
+静色 3 n
+静若处子 2 nr
+静荡荡 3 z
+静藏 3 ns
+静虑 3 v
+静虚师太 3 nr
+静观 75 n
+静观其变 3 l
+静观默察 3 nr
+静言令色 3 n
+静言庸违 3 i
+静读 3 v
+静谧 76 nr
+静逸 4 z
+静配合 3 nr
+静闻 6 n
+静静 236 nr
+静静地 776 z
+静静心 3 z
+静静的 142 z
+静音 14 n
+静音版 3 n
+静风 2 n
+静默 327 nr
+静默致哀 3 nr
+靛 471 b
+靛紫 3 b
+靛紫色 3 n
+靛红肟 3 n
+靛蓝 45 b
+靛蓝色 12 b
+靛青 9 b
+靜 2 zg
+非 16318 h
+非一日之寒 9 i
+非上 3 d
+非上不可 3 i
+非上市 14 ns
+非下 3 d
+非下不可 3 l
+非专业 30 j
+非专利 3 l
+非专职 2 b
+非中文 3 nz
+非主业 3 n
+非主流 3 n
+非也 3 d
+非买 3 ns
+非买不可 3 i
+非争不可 3 i
+非于 3 d
+非交不可 3 i
+非交换环 3 i
+非交换群 3 j
+非交替烃 3 n
+非亲非故 19 i
+非人 104 b
+非人工 3 n
+非人性 3 n
+非人生活 3 i
+非人类 3 n
+非他不可 3 l
+非他莫属 3 l
+非付不可 3 l
+非价格 4 l
+非伙伴 3 n
+非会不可 3 l
+非会员 2 n
+非传统 38 n
+非伤即死 3 i
+非但 464 c
+非住不可 3 i
+非住宅 3 n
+非作战 13 l
+非你不可 3 l
+非你莫属 3 l
+非保密 3 ns
+非信不可 3 i
+非倒不可 3 i
+非倒凹区 3 l
+非借不可 3 l
+非僧非俗 3 i
+非儿 3 d
+非党人士 19 n
+非党员 3 n
+非全日制 15 nz
+非公 3 d
+非公务 4 b
+非公勿入 3 i
+非公有 5 b
+非公有制 81 n
+非公版 3 b
+非公经济 3 n
+非公莫入 3 l
+非关税 7 l
+非关税壁垒 12 b
+非关键 3 n
+非其 3 d
+非其所为 3 c
+非其所能 3 i
+非典 215 b
+非典型 3 n
+非再 3 d
+非军事 21 b
+非军事化 3 nt
+非军事区 6 nt
+非农 19 b
+非农业 335 b
+非农产业 9 nt
+非决定性 3 l
+非减 3 v
+非凡 540 d
+非凡地 3 z
+非出不可 3 i
+非分 61 d
+非分之念 3 l
+非分之想 58 i
+非分之财 3 l
+非刑 3 n
+非到不可 3 l
+非刺不可 3 l
+非割不可 3 l
+非加太 5 ns
+非动不可 3 l
+非包不可 3 i
+非单位体制 2 l
+非单着丝 3 l
+非单色波 3 ns
+非卖品 5 n
+非占不可 3 i
+非卿莫娶 3 i
+非原先 3 l
+非去不可 3 i
+非发不可 3 i
+非古典 3 ns
+非叫不可 3 i
+非可小觑 3 i
+非吃不可 3 i
+非同 42 d
+非同一般 94 l
+非同以往 3 i
+非同余 3 i
+非同儿戏 8 l
+非同凡响 15 l
+非同寻常 135 i
+非同小可 560 i
+非吐不可 3 i
+非君 3 ns
+非君莫嫁 3 i
+非君莫属 2 i
+非周期性 3 n
+非命 13 d
+非售不可 3 l
+非唯心 3 l
+非商业 11 j
+非商业性 3 n
+非因工 3 l
+非国大 109 b
+非国家 45 l
+非国有 52 b
+非国有化 3 l
+非国有经济 14 l
+非在 3 d
+非地带性 3 b
+非均相 13 b
+非均衡 2 b
+非处方药 22 l
+非处方药品 5 l
+非奏不可 3 n
+非她不可 3 v
+非她莫属 3 nr
+非妳 3 z
+非妳不可 3 v
+非妳莫属 3 nr
+非婚 3 v
+非婚生 3 n
+非婚生子 3 n
+非子 3 n
+非学历 5 n
+非守不可 3 i
+非完整系 3 l
+非官方 30 b
+非定域键 3 n
+非定常 10 d
+非实质 3 l
+非审不可 3 ns
+非宰不可 3 i
+非对抗性 3 n
+非对称 37 n
+非寻常光 3 i
+非导体 3 n
+非将 3 d
+非工会 3 nt
+非工作侧 3 n
+非工程 13 l
+非市场 26 ns
+非常 15958 d
+非常丰富 3 l
+非常之谋 3 i
+非常任 7 b
+非常低 5 b
+非常复杂 3 b
+非常家庭 3 nt
+非常容易 9 l
+非常少 14 l
+非常广阔 4 i
+非常态 4 n
+非常悲哀 3 nr
+非常感激 3 l
+非常感谢 3 i
+非常明显 4 nr
+非常灵活 3 i
+非常热心 3 b
+非常简单 6 z
+非常耐久 3 l
+非常规 52 b
+非常设 8 b
+非常适合 8 i
+非常重视 3 l
+非常高兴 3 b
+非平衡态 3 n
+非应用 3 l
+非异人任 3 l
+非当 3 d
+非当不可 3 i
+非往 3 d
+非徒 6 n
+非得 314 d
+非得不可 3 d
+非必要 3 l
+非必需区 3 l
+非惯性系 3 n
+非想不可 3 l
+非意愿 2 d
+非意相干 3 l
+非成员国 6 n
+非我不可 3 i
+非我所愿 3 i
+非我族类 15 l
+非我站 3 l
+非我莫属 3 l
+非戒不可 3 i
+非战 3 b
+非战争性 3 n
+非战公约 3 n
+非战斗 26 nz
+非战斗性 2 nz
+非所宜 3 i
+非手术 8 n
+非手术治疗 8 n
+非打不可 3 i
+非承重墙 3 n
+非技术 11 n
+非技术性 4 n
+非报不可 3 i
+非抱不可 3 i
+非抹不可 3 i
+非接不可 3 i
+非接触性 5 b
+非揍不可 3 v
+非摸不可 3 i
+非撕不可 3 v
+非播不可 3 i
+非收不可 3 i
+非攻不可 3 i
+非政府 90 nt
+非政治化 3 nt
+非政治性 6 n
+非故意 3 i
+非教不可 3 l
+非整不可 3 i
+非斩不可 3 i
+非断不可 3 i
+非早不可 3 l
+非昔是今 3 i
+非晶 31 n
+非晶体 5 n
+非晶态 64 n
+非晶硅 6 n
+非智力 15 l
+非暴力 69 l
+非有 3 b
+非有不可 3 i
+非服不可 3 l
+非本 4 ns
+非本原群 3 ns
+非本意 3 d
+非本质 3 n
+非机动 3 b
+非机动车 34 l
+非杀不可 3 i
+非来 3 d
+非来不可 3 d
+非林地 3 ns
+非标 3 n
+非标件 3 n
+非标准 4 n
+非核 3 b
+非核心 8 b
+非梦 3 nz
+非歉不可 3 v
+非正义 16 b
+非正义战争 12 nz
+非正常 68 b
+非正式 246 b
+非正统 3 b
+非正规 48 b
+非正规军 6 i
+非此 3 d
+非此不可 3 l
+非此即彼 23 i
+非武装 17 b
+非歧视 6 b
+非死不可 3 i
+非死即伤 3 i
+非殖民化 3 n
+非毒不可 3 l
+非比 98 j
+非比寻常 3 i
+非永久性 3 l
+非求不可 3 i
+非池中物 3 l
+非油 2 n
+非法 1647 b
+非法交易 3 l
+非法人 25 l
+非法传销 3 l
+非法关机 3 l
+非法出版 3 l
+非法利润 3 l
+非法占有 3 i
+非法定 6 l
+非法性 3 n
+非法所得 10 l
+非法手段 3 n
+非法拘禁 3 i
+非法操作 3 l
+非法收入 3 l
+非法活动 3 l
+非法组织 3 nt
+非法经营 3 l
+非法行为 3 l
+非洛地平 5 ns
+非洲 3960 ns
+非洲之角 3 nz
+非洲人 153 n
+非洲人国民大会 6 nt
+非洲地区 24 ns
+非洲大陆 3 ns
+非洲开发银行 3 nt
+非洲杯 3 nz
+非洲法郎 27 ns
+非洲狮 2 ns
+非洲统一 3 b
+非洲统一组织 22 nt
+非洲联盟 3 nt
+非洲金融共同体法郎 8 nz
+非洲鳄 3 n
+非流通股 3 n
+非浅 3 z
+非涂不可 3 i
+非涨不可 3 i
+非淋菌性 3 l
+非深不可 3 i
+非清不可 3 l
+非游览区 3 n
+非点不可 3 d
+非点源 3 d
+非然 3 d
+非煮不可 3 i
+非燃烧体 3 n
+非爱 3 b
+非爱不可 3 l
+非特 2 ns
+非特异 3 l
+非独 12 d
+非现金 16 n
+非球面 3 n
+非理性 148 b
+非生产 98 b
+非生产性 31 n
+非生物 3 l
+非用 3 b
+非用不可 3 l
+非电子地 3 l
+非电解质 3 l
+非画不可 3 i
+非甾体 3 n
+非盈利 12 n
+非盈利性 7 n
+非睡不可 3 n
+非短不可 3 i
+非磁性 3 b
+非磨不可 3 i
+非礼 65 b
+非礼勿视 16 i
+非社会地 3 l
+非离散 3 i
+非移调 3 l
+非税 2 n
+非穿不可 3 i
+非站不可 3 ns
+非端着丝 3 z
+非签不可 3 n
+非类 3 b
+非纯种 3 n
+非线性 353 b
+非线性元 3 n
+非线性失 3 l
+非线编 3 b
+非织造 6 b
+非经 3 d
+非经济 17 n
+非经营性 39 b
+非结不可 3 i
+非结盟 3 j
+非统 44 n
+非统组织 8 nt
+非缴不可 3 n
+非罚不可 3 i
+非翻不可 3 i
+非耕地 2 l
+非职业 8 b
+非肥 3 ns
+非肥皁 3 z
+非肥皂 3 n
+非艺术 13 l
+非营利 14 ns
+非营利性 17 b
+非虚 3 nrt
+非蛋白氮 3 n
+非行 18 d
+非补不可 3 l
+非西方 29 ns
+非要 3 b
+非要不可 3 l
+非让不可 3 l
+非议 93 n
+非讲不可 3 l
+非讼事件 3 n
+非诉 3 v
+非诉讼 8 l
+非说不可 3 i
+非请勿入 3 i
+非请莫入 3 i
+非读不可 3 i
+非谐振动 3 l
+非负值 3 l
+非贴不可 3 i
+非贸易 30 l
+非赌不可 3 j
+非赢 3 n
+非赢不可 3 nr
+非赢利 3 nr
+非走不可 3 i
+非跌不可 3 l
+非跑 3 ns
+非跑不可 3 l
+非轻不可 3 i
+非载不可 3 i
+非过 3 c
+非过不可 3 l
+非通不可 3 i
+非造不可 3 l
+非遗传性 2 n
+非那西丁 2 nrt
+非金属 219 b
+非金属性 3 b
+非金属材料 2 nz
+非金属矿 50 nz
+非金融 8 n
+非银行 13 nt
+非门 3 ns
+非问不可 3 i
+非阈逻辑 3 n
+非附不可 3 i
+非降不可 3 l
+非隔不可 3 l
+非难 55 d
+非非 3 ns
+非领导职务 7 l
+非饱和 7 nz
+非驴非马 5 i
+非骑不可 3 i
+靠 8829 v
+靠上去 3 v
+靠上来 3 l
+靠不住 135 v
+靠了 3 p
+靠住 3 v
+靠你了 3 l
+靠傍 3 v
+靠到 3 v
+靠前面 3 l
+靠北 3 v
+靠北边 3 n
+靠右 3 n
+靠右走 3 i
+靠右边 3 n
+靠右边走 3 i
+靠后面 3 l
+靠垫 28 n
+靠墙 3 n
+靠墙角 3 i
+靠墙边 3 n
+靠外边 3 l
+靠外边走 3 l
+靠外面 3 l
+靠外面走 3 l
+靠天吃饭 10 i
+靠山 223 n
+靠山吃山 14 i
+靠山边 3 n
+靠岸 90 n
+靠岸边 3 n
+靠左 3 v
+靠左走 3 l
+靠左边 3 l
+靠左边走 3 l
+靠得住 117 v
+靠手 12 v
+靠拢 217 v
+靠拢过来 3 l
+靠旗 3 n
+靠枕 7 v
+靠椅 22 n
+靠模 2 n
+靠水吃水 9 i
+靠水面 3 n
+靠河 3 n
+靠河边 3 n
+靠泊 15 v
+靠海 3 n
+靠海吃海 2 i
+靠海边 3 n
+靠港 3 n
+靠港口 3 n
+靠湖 3 n
+靠湖边 3 n
+靠着 394 p
+靠窗 3 n
+靠窗户 3 i
+靠背 61 v
+靠背椅 16 n
+靠背轮 3 n
+靠行 3 v
+靠起 3 v
+靠边 18 n
+靠边儿站 3 n
+靠边站 34 n
+靠边走 3 v
+靠边闪 3 l
+靠近 946 v
+靠近海岸 3 i
+靠进去 3 l
+靠进来 3 l
+靠里面 3 n
+靠里面走 3 l
+靠门边 3 n
+靠靠 3 v
+靡 261 vg
+靡下 3 n
+靡不 3 i
+靡不有初 3 i
+靡丽 3 a
+靡倒 3 a
+靡坚不摧 3 i
+靡所底止 3 i
+靡所适从 3 i
+靡日不思 3 i
+靡有孑遗 3 v
+靡烂 3 a
+靡烂不堪 3 i
+靡烂性 3 n
+靡然乡风 3 i
+靡然从风 3 i
+靡然向风 3 i
+靡然成风 3 i
+靡然顺风 3 i
+靡知所措 3 i
+靡衣偷食 3 i
+靡衣媮食 3 n
+靡衣玉食 3 i
+靡费 22 n
+靡靡之乐 3 i
+靡靡之声 3 i
+靡靡之音 6 i
+靡颜腻理 3 vn
+面 14337 n
+面上 985 f
+面上无光 3 i
+面不改容 3 l
+面不改色 35 l
+面世 100 n
+面临 4096 v
+面乎乎 3 i
+面争庭论 3 n
+面交 20 v
+面人 15 n
+面人儿 2 n
+面从腹诽 3 v
+面价 3 n
+面会 3 n
+面伺服 3 z
+面似靴皮 3 i
+面值 108 n
+面元划分 3 l
+面光 3 n
+面光源 3 n
+面具 479 n
+面冷心狠 3 i
+面制品 3 n
+面前 7896 f
+面包 884 n
+面包刀 3 n
+面包圈 3 n
+面包屑 3 n
+面包师 7 n
+面包师傅 3 n
+面包干 2 n
+面包店 9 n
+面包心 3 n
+面包房 20 n
+面包机 2 n
+面包果 13 n
+面包树 3 n
+面包片 3 n
+面包皮 3 n
+面包车 75 n
+面包酵母 3 n
+面包酶 3 n
+面北 3 f
+面北眉南 3 ns
+面卷 3 n
+面厂 3 n
+面友 3 n
+面叙 3 v
+面向 1900 n
+面向世界 3 n
+面向全国 3 n
+面向农村 3 n
+面向基层 3 n
+面向对象 128 n
+面向对象分析 4 l
+面向对象编程 5 l
+面向市场 3 n
+面向未来 3 l
+面向用户 2 n
+面向社会 3 n
+面呈 3 v
+面告 9 n
+面命耳提 3 n
+面和心不和 6 i
+面商 12 n
+面善 33 v
+面善心恶 3 i
+面团 308 n
+面团团 3 n
+面型 3 n
+面塑 23 n
+面墙 3 n
+面墙而立 3 i
+面壁 46 n
+面壁九年 3 i
+面壁功深 3 i
+面壁思过 8 i
+面壁磨砖 3 n
+面天线 3 n
+面奏 3 n
+面如 3 v
+面如傅粉 4 i
+面如冠玉 10 i
+面如凝脂 3 n
+面如土色 86 i
+面如桃花 3 i
+面如死灰 19 i
+面如满月 3 i
+面如灰土 3 i
+面嫩 3 a
+面子 1333 n
+面孔 728 n
+面孔识别 3 n
+面容 425 n
+面宽 3 v
+面密度 2 n
+面对 5937 v
+面对现实 3 n
+面对面 310 f
+面层 24 n
+面层抹灰 3 l
+面山 3 n
+面巾 15 n
+面巾纸 3 n
+面市 31 n
+面带 3 n
+面带微笑 23 l
+面带笑容 3 i
+面广 3 v
+面店 3 n
+面庞 91 n
+面弓 3 n
+面弓记录 3 n
+面引廷争 3 l
+面心点格 3 n
+面恶 3 n
+面恶心善 3 i
+面折 3 n
+面折庭争 3 n
+面折廷争 3 n
+面授 27 n
+面授机宜 28 i
+面授班 3 i
+面料 161 n
+面斜裂 3 n
+面斥 3 v
+面无 3 i
+面无人色 62 i
+面无惭色 3 i
+面无血色 5 i
+面是心非 3 i
+面是背非 3 i
+面晤 3 v
+面有 3 v
+面有喜色 3 i
+面有菜色 3 n
+面有难色 14 i
+面朋口友 3 n
+面朝 7 n
+面朝天 3 i
+面朝着 3 l
+面杖 3 n
+面条 859 n
+面条儿 3 n
+面条机 3 n
+面板 217 n
+面板厂 3 n
+面横裂 3 i
+面汤 50 n
+面泛 3 a
+面洽 3 v
+面浆 2 n
+面海 3 f
+面灰 3 n
+面点 56 n
+面点师 2 n
+面热心跳 3 i
+面熟 30 v
+面片 26 n
+面生 59 n
+面疙瘩 6 l
+面疱 2 n
+面痉挛 3 n
+面瘫 33 n
+面皂 3 n
+面皮 341 n
+面皰 3 v
+面盆 22 n
+面目 850 n
+面目一新 14 i
+面目全非 109 i
+面目可憎 25 i
+面目狰狞 34 l
+面目皆非 3 i
+面相 125 n
+面瞩 3 i
+面砖 2 n
+面碗 4 n
+面神经 23 n
+面票 3 n
+面禀 3 v
+面积 22455 n
+面窄 3 n
+面筋 35 n
+面粉 1221 n
+面粉厂 28 n
+面粉处理 3 n
+面粉袋 3 n
+面糊 14 v
+面糊糊 2 l
+面红 3 n
+面红耳热 3 i
+面红耳赤 135 i
+面红面绿 3 n
+面红面赤 3 i
+面红颈赤 3 n
+面纱 198 n
+面纸 2 n
+面线 3 n
+面缚舆榇 3 nr
+面缚衔璧 3 i
+面网 4 n
+面罩 93 n
+面肥 3 n
+面膜 68 n
+面色 633 n
+面色如土 14 i
+面色苍白 3 i
+面若死灰 2 i
+面茶 9 n
+面薄 3 n
+面表 2 n
+面裂囊肿 3 n
+面西 3 n
+面见 74 v
+面角 3 n
+面誉背毁 3 i
+面誉背非 3 i
+面议 26 n
+面试 2642 v
+面试官 3 n
+面试题 3 n
+面请 3 v
+面谀背毁 3 i
+面谈 161 v
+面谒 3 v
+面谕 59 n
+面谢 3 v
+面谩腹诽 3 v
+面貌 1445 n
+面貌一新 8 i
+面貌全非 3 i
+面贴膜 3 n
+面辅料 3 i
+面达 2 v
+面邀 3 v
+面部 491 f
+面部侧貌 3 n
+面部潮红 3 l
+面部皮肤 3 n
+面部轮廓 3 n
+面酱 7 n
+面陈 44 n
+面霜 13 n
+面露难色 9 i
+面面 3 f
+面面俱到 40 l
+面面俱圆 3 i
+面面厮觑 3 i
+面面圆到 3 l
+面面皆到 3 l
+面面相看 3 i
+面面相睹 3 i
+面面相觑 394 i
+面面观 8 n
+面颊 366 n
+面颜 3 n
+面额 49 n
+面食 64 n
+面食节 3 n
+面饺 3 n
+面饼 49 n
+面馆 10 n
+面首 7 n
+面黄 3 n
+面黄肌瘦 32 i
+面黄饥瘦 3 i
+靣 26 zg
+靥 58 g
+靦 7 zg
+靦颜事仇 3 nr
+靦颜人世 3 ns
+革 1242 vn
+革兰氏 3 nz
+革凡成圣 3 i
+革凡登圣 3 i
+革出 3 vn
+革制品 3 n
+革吉 3 nrt
+革吉县 3 ns
+革命 18856 vn
+革命主义 7 nz
+革命事业 3 nz
+革命人生 3 nz
+革命先烈 3 i
+革命党 308 nz
+革命党人 3 nz
+革命军 175 n
+革命军人 3 n
+革命创制 3 nz
+革命制度党 2 nz
+革命力量 3 n
+革命化 145 vn
+革命反正 3 nz
+革命史 54 nz
+革命圣地 3 n
+革命委员 3 n
+革命实践 3 n
+革命家 486 nz
+革命干劲 3 n
+革命志士 3 nz
+革命性 184 n
+革命意志 3 n
+革命战争 315 nz
+革命政权 3 n
+革命文学 3 nz
+革命斗争 3 nz
+革命斗志 3 n
+革命残废 3 i
+革命派 190 nz
+革命烈士 3 n
+革命烈火 3 i
+革命犯 3 n
+革命现实 3 n
+革命理想 3 n
+革命生涯 3 n
+革命知识 3 n
+革命积极 3 n
+革命者 181 n
+革命胜利 3 nz
+革命英雄 3 n
+革命英雄主义 40 nz
+革命行动 3 nz
+革命道路 3 nz
+革命队伍 3 n
+革命领袖 3 n
+革囊 24 n
+革图易虑 3 n
+革大 3 j
+革奸铲暴 3 v
+革委会 153 j
+革履 2 n
+革左五营 3 i
+革带移孔 3 n
+革心 3 n
+革心易行 3 n
+革心洗面 3 n
+革故立新 3 i
+革故鼎新 8 i
+革新 1108 vn
+革新党 4 nz
+革新变旧 3 n
+革新家 9 nz
+革新派 13 nz
+革新者 4 n
+革新能手 3 n
+革新运动 3 nz
+革旧从新 3 i
+革旧图新 3 i
+革旧维新 3 ns
+革旧鼎新 3 i
+革正 3 nz
+革盖菌素 3 n
+革职 189 vn
+革职留任 3 n
+革退 3 v
+革邪反正 3 i
+革除 82 v
+革除陋规 3 i
+革面悛心 3 z
+革面敛手 3 vn
+革面洗心 3 n
+革面革心 3 nz
+革风易俗 3 n
+靬 27 zg
+靳 30 nr
+靳三针 3 nr
+靳云鹏 11 nr
+靳尚宜 2 nr
+靳尚谊 11 nr
+靳德茂 3 nr
+靳文然 2 nr
+靳杖子 4 nr
+靳羽西 3 nr
+靴 351 n
+靴刀誓死 3 n
+靴子 171 n
+靴尖 3 n
+靴底 3 n
+靴形 3 n
+靴钉 3 n
+靴鞋 11 n
+靶 414 p
+靶位 6 n
+靶台 3 n
+靶台上 3 n
+靶向 29 n
+靶场 141 n
+靶子 150 n
+靶心 26 n
+靶托 3 n
+靶机 38 n
+靶标 17 n
+靶档 3 n
+靶点 3 n
+靶细胞 3 n
+靸 5 zg
+靹 8 zg
+靺 51 zg
+靼 46 x
+靿 8 zg
+鞁 2 zg
+鞅 46 x
+鞅鞅不乐 3 z
+鞈 283 zg
+鞋 1578 n
+鞋业 16 n
+鞋业网 3 n
+鞋刷 4 n
+鞋匠 171 n
+鞋印 3 n
+鞋厂 3 n
+鞋号 2 n
+鞋后跟 5 n
+鞋垫 11 n
+鞋城 3 n
+鞋头 3 n
+鞋套机 3 n
+鞋子 442 n
+鞋带 45 n
+鞋帮 27 n
+鞋帽 35 n
+鞋帽网 3 n
+鞋底 146 n
+鞋底儿 2 n
+鞋底抹油 3 z
+鞋店 10 n
+鞋弓袜小 3 n
+鞋弓袜浅 3 n
+鞋弓襪小 3 n
+鞋弓襪浅 3 n
+鞋扣 3 n
+鞋拔子 3 n
+鞋料 3 n
+鞋架 3 n
+鞋柜 5 n
+鞋样 7 n
+鞋根 3 nz
+鞋楦 7 n
+鞋油 9 n
+鞋盒 8 n
+鞋类 16 n
+鞋粉 5 n
+鞋脸 3 n
+鞋舌 3 n
+鞋行 3 n
+鞋衬 3 n
+鞋袜 134 n
+鞋跟 34 n
+鞋里 11 n
+鞋面 23 n
+鞍 540 ns
+鞍不离马 3 i
+鞍前马后 25 i
+鞍勒 3 ns
+鞍基 3 ns
+鞍子 40 n
+鞍尾 3 ns
+鞍山 169 ns
+鞍山人 2 n
+鞍山市 32 ns
+鞍山道 2 ns
+鞍座 4 n
+鞍架 3 n
+鞍点 3 n
+鞍状物 3 n
+鞍辔 3 i
+鞍部 6 n
+鞍钢 114 n
+鞍钢宪法 3 nz
+鞍革 3 n
+鞍鞯 11 n
+鞍马 134 ns
+鞍马之劳 3 i
+鞍马劳倦 3 i
+鞍马劳困 3 i
+鞍马劳神 3 i
+鞍马劳顿 20 ns
+鞏 2 zg
+鞑 1100 zg
+鞑子 3 n
+鞑虏 3 n
+鞑靼 351 n
+鞑靼人 3 ns
+鞑靼斯坦 3 ns
+鞒 90 g
+鞓 3 zg
+鞔 52 v
+鞗 9 zg
+鞘 656 n
+鞘磷脂 3 n
+鞘翅 3 n
+鞘翅目 52 n
+鞘里藏刀 3 n
+鞞 2 zg
+鞠 113 nr
+鞠一躬 8 nr
+鞠世忠 2 nr
+鞠为茂草 3 nr
+鞠养 3 v
+鞠文泰 10 nr
+鞠智盛 6 nr
+鞠维松 2 nr
+鞠育 3 v
+鞠觉亮 5 nr
+鞠躬 175 v
+鞠躬君子 3 i
+鞠躬尽力 3 i
+鞠躬尽瘁 61 i
+鞠躬屏气 3 i
+鞠躬礼 8 i
+鞣 140 v
+鞣制 20 n
+鞣剂 3 n
+鞣料 8 n
+鞣草 3 n
+鞣质 3 n
+鞣酸 23 n
+鞣酸酶 3 n
+鞦 2 zg
+鞧 2 zg
+鞨 50 zg
+鞫 93 g
+鞫为茂草 3 nz
+鞬 14 zg
+鞭 1933 n
+鞭不及腹 3 i
+鞭丝帽影 3 n
+鞭刑 3 n
+鞭墓戮尸 3 v
+鞭头绳 3 n
+鞭子 504 n
+鞭子一样 3 i
+鞭尸 3 n
+鞭形 3 n
+鞭打 125 v
+鞭打快牛 3 i
+鞭打快驴 3 i
+鞭挞 71 v
+鞭擗向里 3 n
+鞭擗进里 3 n
+鞭杆 3 n
+鞭毛 152 n
+鞭毛基体 3 n
+鞭毛抗原 3 n
+鞭毛藻 2 n
+鞭毛虫 25 n
+鞭毛蛋白 3 n
+鞭炮 236 n
+鞭炮厂 3 n
+鞭炮声 88 n
+鞭状天线 3 n
+鞭痕 13 n
+鞭笞 71 v
+鞭策 63 n
+鞭箠 3 vn
+鞭约近里 3 i
+鞭苔 3 n
+鞭虫 3 n
+鞭蛇 3 n
+鞭责 3 v
+鞭辟入里 8 i
+鞭辟向里 3 i
+鞭辟着里 3 i
+鞭辟近里 3 i
+鞭达 3 n
+鞭长不及 3 i
+鞭长莫及 31 i
+鞭长驾远 3 i
+鞭驽策蹇 3 nr
+鞮 12 zg
+鞯 285 x
+鞲 51 x
+鞳 6 zg
+鞴 66 x
+鞶 13 zg
+鞸 8 zg
+鞹 57 zg
+鞻 25 zg
+韁 2 zg
+韂 7 zg
+韈 4 zg
+韕 81 zg
+韗 9 zg
+韘 17 zg
+韜 22 zg
+韣 44 zg
+韥 3 zg
+韦 830 nr
+韦一笑 237 nr
+韦专政 3 nr
+韦为彭 2 nr
+韦为界 2 nr
+韦为相 2 nr
+韦乌卢 2 nr
+韦亚努 2 nr
+韦伊塞 5 nr
+韦伊配对 3 nr
+韦伯 147 nr
+韦伯分数 3 nr
+韦伯定律 3 nr
+韦伯所 2 nr
+韦伯斯特 9 nrt
+韦伯氏 4 nr
+韦伯爵 5 nr
+韦兄弟 26 nr
+韦克斯勒 18 nrt
+韦克菲尔德 2 nrt
+韦公子 22 nr
+韦公爷 20 nr
+韦兰秀 3 nr
+韦列夏 2 nr
+韦利 6 nr
+韦利波 2 nr
+韦力转 3 nr
+韦勒克 2 nr
+韦后临 3 nr
+韦后之 8 nr
+韦后妹 2 nr
+韦后立 2 nr
+韦君宜 2 nr
+韦启美 3 nr
+韦嗣立 4 nr
+韦四哥 2 nr
+韦四弟 4 nr
+韦国清 3 nr
+韦塞克 2 nr
+韦塞尔 8 nr
+韦大人 70 nr
+韦大哥 27 nr
+韦大帅 16 nr
+韦奇伍 2 nr
+韦孝宽 4 nr
+韦家能 257 nr
+韦家营 2 nr
+韦家雄 3 nr
+韦寿栓 8 nr
+韦寿铨 8 nr
+韦小 3 nrt
+韦小宝 9863 nr
+韦少爷 4 nr
+韦少辉 2 nr
+韦尔塔 15 nr
+韦尔奇 94 nr
+韦尔德 2 nr
+韦尔斯 10 nr
+韦尔特曼 4 nrt
+韦尔瓦 2 nr
+韦尔申 2 nr
+韦尔纳 22 nr
+韦尼勒 3 nr
+韦尼奥 2 nr
+韦尼泽 3 nr
+韦应物 10 nr
+韦建桦 3 nr
+韦弗尔 3 nr
+韦弦之佩 3 nr
+韦德 82 nr
+韦德同 2 nr
+韦德尼 2 nr
+韦德断 3 nr
+韦德曼 13 nr
+韦德里纳 38 nrt
+韦忠武 3 nr
+韦思德 4 nr
+韦执谊 8 nr
+韦拉 15 nrt
+韦拉亚提 9 nrt
+韦拉克 3 nr
+韦拉克鲁斯 18 nrt
+韦拉克鲁斯州 7 nrt
+韦拔群 4 nr
+韦斯利 8 nr
+韦斯尔 2 nr
+韦斯巴 3 nr
+韦斯明 4 nr
+韦斯普 3 nr
+韦斯特 12 nr
+韦斯皮 3 nr
+韦斯顿 3 nr
+韦昌辉 54 nr
+韦春花 3 nr
+韦春芳 55 nr
+韦昭范 2 nr
+韦查耶 5 nr
+韦格曼 2 nr
+韦格纳 9 nr
+韦格蒂 6 nr
+韦桑岛 2 nr
+韦梅河 2 nr
+韦森堡 2 nr
+韦死宝 2 nr
+韦氏 68 nr
+韦氏临 3 nr
+韦氏恐 3 nr
+韦氏音标 3 nr
+韦江州 2 nr
+韦法王 2 nr
+韦爵爷 77 nr
+韦特卢 2 nr
+韦特海 3 nr
+韦玄成 4 nr
+韦瑟尔 4 nr
+韦瓦克 3 nr
+韦甘德 2 nr
+韦皇后 4 nr
+韦相公 5 nr
+韦眉子 3 nr
+韦祖辉 7 nr
+韦绮珊 3 nrfg
+韦维尔 4 nr
+韦编三绝 3 i
+韦罗内 4 nr
+韦罗基 8 nr
+韦英雄 3 nr
+韦茅斯 7 nr
+韦荣氏 4 nr
+韦莱河 3 nr
+韦裤布被 3 nz
+韦词疏 2 nr
+韦诸部 4 nr
+韦贝尔 2 nr
+韦贝恩 7 nr
+韦达 19 nr
+韦达著 9 nr
+韦都统 29 nr
+韦里尼 2 nr
+韦银豹 25 nr
+韦雷河 5 nr
+韦香主 280 nr
+韦驮 3 nz
+韦鲁湖 5 nr
+韧 166 n
+韧劲 21 n
+韧劲儿 3 n
+韧带 143 n
+韧带位 3 n
+韧度 3 n
+韧性 226 n
+韧挺 3 l
+韧皮 3 n
+韧皮纤维 20 l
+韧皮部 66 n
+韩 3448 j
+韩一良 17 nr
+韩三国 9 ns
+韩三奇 4 nr
+韩三平 3 nr
+韩三爷 5 nr
+韩世华 3 nr
+韩世同 4 nr
+韩世忠 91 nr
+韩世昌 5 nr
+韩东基 2 nr
+韩为氏 3 nr
+韩丽珍 33 nr
+韩义生 3 nr
+韩乐卿 2 nr
+韩乐悟 2 nr
+韩乔生 3 nr
+韩五娘 3 nr
+韩亚 3 ns
+韩仲良 2 nr
+韩企先 4 nr
+韩伯龙 6 nr
+韩佳人 3 nr
+韩侯岭 2 nr
+韩俊则 2 nr
+韩信 202 nr
+韩信将兵 3 nr
+韩信早 2 nr
+韩信点 3 nr
+韩信点兵 3 nt
+韩健徽 3 nr
+韩儒林 16 nr
+韩元 39 nr
+韩先楚 259 nr
+韩先生 4 nr
+韩光华 2 nr
+韩全诲 2 nr
+韩公廉 9 nr
+韩公政 13 nr
+韩兰根 3 nr
+韩再芬 2 nr
+韩军演 4 nr
+韩冰岩 6 nr
+韩剧 3 nz
+韩剧宫 3 ns
+韩匡嗣 2 nr
+韩千叶 3 nr
+韩南鹏 2 nr
+韩卢逐块 3 nz
+韩发贵 3 nr
+韩向齐 2 nr
+韩启德 3 nr
+韩咬儿 4 nr
+韩善续 3 nr
+韩喜凯 3 nr
+韩国 3375 ns
+韩国三星 9 nz
+韩国三星电子 7 nt
+韩国三星电子公司 12 nt
+韩国公司 7 nt
+韩国制 3 nr
+韩国史 3 nr
+韩国国会 6 nt
+韩国国防部 23 nt
+韩国城 3 nr
+韩国外交通商部 5 nt
+韩国大宇 4 nr
+韩国延 2 nr
+韩国政府 49 nt
+韩国标 3 nr
+韩国法务部 2 nt
+韩国泡菜 3 nz
+韩国游 3 nr
+韩国片 3 nz
+韩国猪 3 nr
+韩国现代 12 nr
+韩国网 3 nz
+韩国联合通讯社 7 nt
+韩国菜 3 nr
+韩国议会 2 nt
+韩国话 3 nr
+韩国语 8 nr
+韩国货 3 nt
+韩国队 158 nt
+韩在石 3 nr
+韩城 71 ns
+韩城市 6 ns
+韩培信 3 nr
+韩培玲 5 nr
+韩大哥 11 nr
+韩大太 4 nr
+韩大建 2 nr
+韩天星 26 nr
+韩天麟 4 nr
+韩太大 3 nr
+韩太太 350 nr
+韩太监 2 nr
+韩夫人 18 nr
+韩女侠 2 nr
+韩女士 5 nr
+韩女星 3 nr
+韩姬竟 2 nr
+韩婶子 2 nr
+韩子云 2 nr
+韩子奇 862 nr
+韩存保 30 nr
+韩孝珠 3 nr
+韩学愈 32 nr
+韩宁夫 256 nr
+韩宇道 8 nr
+韩安国 5 ns
+韩宝驹 172 nr
+韩宝骑 2 nr
+韩宣子 6 nr
+韩家 59 nrfg
+韩家潭 7 nr
+韩寒主 2 nr
+韩寓群 3 nr
+韩寿偷香 3 z
+韩寿分香 3 nr
+韩将军 2 nr
+韩小莹 193 nr
+韩少功 5 nr
+韩尚宫 6 nr
+韩山 3 ns
+韩山童 43 nr
+韩岳廷 5 nr
+韩希孟 5 nr
+韩幕侠 3 nr
+韩庆 2 ns
+韩应选 2 nr
+韩康伯 3 nr
+韩康信 31 nr
+韩康卖药 3 nt
+韩康子 13 nr
+韩延徽 4 nr
+韩廷榜 28 nr
+韩建交 3 nr
+韩建华 3 nr
+韩式育 3 nr
+韩彦直 2 nr
+韩彩英 3 nr
+韩彭二 3 nr
+韩御史 2 nr
+韩德勤 4 nr
+韩德培 3 nr
+韩德尔 3 nr
+韩德彩 43 nr
+韩德福 3 nr
+韩德让 11 nr
+韩志远 30 nr
+韩忠学 2 nr
+韩忠彦 4 nr
+韩惠珍 3 nr
+韩愈 126 nrfg
+韩战 4 nz
+韩拔陵 2 nr
+韩择木 2 nr
+韩振军 2 nr
+韩振宇 2 nr
+韩揖喊 2 nr
+韩揖话 2 nr
+韩擒虎 11 nr
+韩政府 3 nt
+韩文 36 nr
+韩文冲 85 nr
+韩文玉 7 nr
+韩文藻 3 nr
+韩新月 52 nr
+韩方 22 nr
+韩无垢 2 nr
+韩日 11 nr
+韩昌黎 4 ns
+韩春霖 13 nr
+韩晓华 3 nr
+韩晓鹏 4 nr
+韩景侯 8 nr
+韩晶娜 7 nr
+韩智力 2 nr
+韩智慧 3 nr
+韩月乔 3 nr
+韩朋赋 2 nr
+韩服 3 nr
+韩朝 10 nr
+韩朝风 3 nr
+韩木林 133 nr
+韩本铉 2 nr
+韩村河 3 nr
+韩杼滨 12 nr
+韩林儿 130 nr
+韩桂芝 2 nr
+韩桑林 3 nr
+韩桥生 3 nr
+韩榕华 3 nr
+韩欧美 2 nr
+韩武子 2 nr
+韩殿甲 2 nr
+韩民九 2 nr
+韩永禄 2 nr
+韩汝琦 2 nr
+韩江 59 ns
+韩江流域 3 ns
+韩济生 14 nr
+韩浠芥 3 nr
+韩海苏潮 3 nr
+韩湘子 4 nr
+韩滔领 2 nr
+韩潮苏海 3 nr
+韩炳杰 3 nr
+韩熙载 32 nrfg
+韩爱平 2 nr
+韩爱萍 3 nr
+韩片 3 nz
+韩玉建 2 nr
+韩玉贵 2 nr
+韩王位 3 nr
+韩王信 12 nr
+韩王山 3 nr
+韩生贵 2 nr
+韩百诗 2 nr
+韩真真 3 nr
+韩知章 10 nr
+韩礼德 10 nr
+韩福利 3 nr
+韩福瑞 3 nr
+韩素云 9 nr
+韩素音 4 nr
+韩经权 4 nr
+韩罗兰 2 ns
+韩美 9 ns
+韩美军 40 nr
+韩美华 3 nr
+韩美林 5 nr
+韩老丐 3 nr
+韩老师 12 nr
+韩老板 2 nr
+韩联社 12 nt
+韩胜延 2 nr
+韩蕲王 2 nr
+韩诗外 7 nr
+韩诗外传 3 nr
+韩语 103 nz
+韩语版 3 nz
+韩贤旺 4 nr
+韩赞周 31 nr
+韩起祥 5 nr
+韩进 3 nrfg
+韩通社 2 nt
+韩遂引 3 nr
+韩邦庆 2 nr
+韩里奇 27 nr
+韩陈二 2 nr
+韩雪亭 129 nr
+韩静茹 3 nr
+韩非 34 ns
+韩非则 2 nr
+韩非子 89 nr
+韩食 3 n
+韩马利 3 nr
+韩高湖 256 nr
+韩魏公 7 nr
+韩鹏争 2 nr
+韩鹏前 2 nr
+韪 81 x
+韫 56 g
+韫椟而藏 3 v
+韫椟藏珠 3 nz
+韬 530 n
+韬光 3 n
+韬光俟奋 3 nr
+韬光养晦 133 i
+韬光敛彩 3 nr
+韬光敛迹 3 nr
+韬光晦迹 3 i
+韬光灭迹 3 i
+韬光用晦 3 i
+韬光隐晦 3 i
+韬光隐迹 3 i
+韬光韫玉 3 nr
+韬奋 6 v
+韬形灭影 3 i
+韬戈偃武 3 vn
+韬戈卷甲 3 i
+韬晦 10 v
+韬晦之计 2 i
+韬晦待时 3 i
+韬曜含光 3 nr
+韬略 95 n
+韬神晦迹 3 i
+韬迹隐智 3 i
+韭 55 n
+韭子 3 n
+韭芽 2 n
+韭菜 144 n
+韭菜合子 2 n
+韭菜子 3 n
+韭菜花 3 n
+韭菜苗 3 n
+韭葱 3 n
+韭黄 19 n
+音 2679 n
+音义 34 n
+音乐 6216 n
+音乐书 3 n
+音乐会 465 nt
+音乐作品 3 n
+音乐创作 3 n
+音乐剧 42 n
+音乐厅 294 nt
+音乐台 3 nt
+音乐史 37 n
+音乐吧 3 n
+音乐味 3 n
+音乐喜剧 3 n
+音乐堂 1154 n
+音乐声 98 n
+音乐大师 3 nt
+音乐奖 2 n
+音乐季 12 n
+音乐学 26 nt
+音乐学校 3 nt
+音乐学院 463 nt
+音乐室 4 n
+音乐家 238 n
+音乐屋 3 n
+音乐帝国 3 nt
+音乐库 3 n
+音乐性 19 n
+音乐感 8 n
+音乐手机 3 n
+音乐才能 3 n
+音乐指导 26 n
+音乐教室 3 nt
+音乐教育 3 l
+音乐文件 3 n
+音乐无限 3 n
+音乐极限 3 n
+音乐格式 3 n
+音乐榜 3 n
+音乐欣赏 3 i
+音乐演奏 3 n
+音乐片 8 n
+音乐界 23 n
+音乐疗法 3 n
+音乐盒 3 n
+音乐盛典 3 n
+音乐盲 3 n
+音乐种类 3 n
+音乐程序 3 n
+音乐窝 3 n
+音乐站 3 n
+音乐系 43 n
+音乐网 3 n
+音乐网站 3 nt
+音乐舞蹈 3 n
+音乐节 42 n
+音乐节目 3 n
+音乐营 3 n
+音乐视听 3 n
+音乐课 7 n
+音乐谷 3 n
+音乐迷 2 n
+音乐部 3 nt
+音乐门户 3 n
+音乐频道 3 n
+音乐风格 3 n
+音位 56 n
+音位学 11 nt
+音体美 3 n
+音信 93 n
+音信全无 6 l
+音信杳无 3 v
+音信杳然 3 z
+音信渺茫 3 i
+音值 8 n
+音像 269 n
+音像制品 3 n
+音像店 2 n
+音像教材 3 n
+音准 2 n
+音分 3 n
+音势 3 n
+音区 13 n
+音协 9 j
+音叉 12 n
+音变 14 n
+音名 4 n
+音品 6 n
+音响 285 n
+音响世界 3 n
+音响器 3 n
+音响器材 3 n
+音响工程 3 n
+音响技术 3 n
+音响效果 33 n
+音响系统 3 n
+音响网 3 n
+音响设备 3 n
+音场 3 n
+音型 13 n
+音域 116 n
+音声如钟 3 l
+音孔 3 n
+音容 16 n
+音容凄断 3 i
+音容如在 3 l
+音容宛在 3 n
+音容笑貌 28 i
+音尘 3 n
+音带 5 n
+音序 11 n
+音序器 2 n
+音强 2 n
+音形 3 n
+音形码 3 n
+音律 171 n
+音息 3 n
+音感 3 n
+音拍 3 n
+音效 29 n
+音效卡 3 n
+音旁 3 n
+音板 7 n
+音柱 2 n
+音标 21 n
+音栓 3 n
+音段 3 n
+音波 9 n
+音源 3 n
+音画 3 n
+音画脱节 3 i
+音界号 3 n
+音码 3 n
+音程 71 n
+音符 107 n
+音箱 93 n
+音素 26 n
+音素文字 3 n
+音缀 3 n
+音羽 3 n
+音耗 3 n
+音耗不绝 3 l
+音色 164 n
+音色库 3 n
+音色甜美 3 i
+音节 389 n
+音节文字 18 n
+音视 3 n
+音视频 15 n
+音讯 126 n
+音讯全无 3 i
+音讯渺茫 3 i
+音译 247 n
+音译词 3 n
+音读 6 n
+音调 200 n
+音调优美 3 l
+音质 70 n
+音轨 3 n
+音速 65 n
+音部 3 n
+音量 84 n
+音量控制 3 n
+音长 5 n
+音问 15 n
+音问两绝 3 i
+音问杳然 3 z
+音问相继 3 i
+音阶 116 n
+音隙 3 n
+音障 3 n
+音韵 132 n
+音韵学 52 n
+音频 131 n
+音频工具 3 n
+音频接口 3 n
+音频文件 3 n
+音频格式 3 n
+音频系统 3 n
+音频线 3 n
+音频编辑 3 n
+音频芯片 3 n
+音频视频 3 n
+音频设备 3 n
+音高 84 n
+音魁网 3 i
+韵 764 n
+韵书 3 n
+韵事 8 n
+韵味 144 n
+韵味儿 2 n
+韵头 7 n
+韵尾 28 n
+韵律 296 n
+韵律体操 3 n
+韵律学 2 n
+韵律感 3 n
+韵律操 3 n
+韵文 56 n
+韵母 75 n
+韵白 10 n
+韵脚 14 n
+韵腹 4 n
+韵致 48 n
+韵诗 2 n
+韵语 18 n
+韵调 3 n
+韵音 3 n
+韶 58 ns
+韶乐 5 ns
+韶乐班 2 nr
+韶光 3 nr
+韶光荏苒 3 v
+韶关 68 ns
+韶关市 20 ns
+韶华 7 nz
+韶华如驶 3 nr
+韶华易 2 nr
+韶山 36 ns
+韶山冲 9 nr
+韶山区 3 ns
+韶山型 3 nz
+韶山市 5 ns
+韶山路 4 ns
+韶州 10 ns
+韶状磨牙 3 nz
+韶秀 3 nr
+韶颜稚齿 3 v
+韶龄少女 2 nr
+韹 38 zg
+韽 2 zg
+頂 3 zg
+頃 19 zg
+項 25 zg
+須 5 zg
+預 8 zg
+領 3 zg
+頞 21 zg
+頠 21 zg
+頢 5 zg
+頤 3 zg
+頧 32 zg
+頫 72 zg
+頬 34 zg
+頭 2 zg
+頵 3 zg
+頷 7 zg
+顃 2 zg
+顅 74 zg
+顆 11 zg
+顊 3 zg
+題 16 zg
+顒 14 zg
+顔 4 zg
+顖会 3 vn
+顗 5 zg
+願 2 zg
+類 4 zg
+顠 2 zg
+顣 361 zg
+顯 2 zg
+页 4911 m
+页岩 181 n
+页心 3 n
+页数 10 n
+页模式 3 n
+页次 3 n
+页状剥落 3 z
+页理 3 n
+页眉 3 n
+页码 11 n
+页脚 3 n
+页表 8 n
+页面 92 n
+页面失效 3 n
+页面设置 3 n
+页页 3 n
+顶 7797 v
+顶一下 3 d
+顶一顶 3 n
+顶上 651 f
+顶上去 3 v
+顶上来 3 f
+顶下 3 f
+顶下去 3 v
+顶下来 3 f
+顶不住 3 v
+顶不起 3 v
+顶不起来 3 l
+顶事 25 n
+顶交 3 v
+顶住 343 v
+顶体反应 3 l
+顶体蛋白 3 l
+顶儿 29 n
+顶入 3 v
+顶冒 3 v
+顶冠 8 n
+顶凶 3 n
+顶刮刮 2 n
+顶升 3 v
+顶叶 5 n
+顶名 3 n
+顶名冒姓 3 i
+顶名替身 3 n
+顶向下 2 n
+顶吹 3 v
+顶呱呱 3 z
+顶嘴 15 n
+顶回 3 v
+顶回去 3 i
+顶回来 3 l
+顶塔 3 n
+顶多 262 d
+顶多会 3 n
+顶多有 3 i
+顶多能 3 n
+顶天 28 n
+顶天立地 64 i
+顶天踵地 3 i
+顶头 31 n
+顶头上司 79 n
+顶好市场 3 n
+顶子 46 n
+顶少 3 d
+顶尖 183 n
+顶尖人物 3 n
+顶尖儿 15 n
+顶尖级 13 n
+顶尖高手 3 n
+顶层 86 n
+顶层楼 3 n
+顶岗 11 n
+顶峰 247 n
+顶帐 3 n
+顶得住 3 v
+顶戴 3 v
+顶推船 5 n
+顶撞 122 v
+顶效 6 n
+顶数 3 n
+顶替 157 v
+顶替层析 3 l
+顶替电泳 3 l
+顶来顶去 3 i
+顶板 26 n
+顶极 15 n
+顶极土壤 3 n
+顶极群落 3 i
+顶梁 5 n
+顶梁柱 27 i
+顶棚 189 n
+顶楼 33 n
+顶正波 3 n
+顶死你 3 l
+顶灯 14 n
+顶点 235 n
+顶点子图 3 n
+顶点次数 3 d
+顶点的权 3 n
+顶烈日 3 i
+顶牛 5 n
+顶牛儿 3 n
+顶珠 3 n
+顶班 15 n
+顶球 9 n
+顶瓜瓜 3 n
+顶用 69 n
+顶盒 3 n
+顶盖 37 n
+顶真 17 nz
+顶礼 20 n
+顶礼膜拜 41 i
+顶端 666 f
+顶端优势 3 n
+顶篷 12 n
+顶级 284 n
+顶缸 16 n
+顶罪 3 v
+顶职 3 n
+顶背离 3 i
+顶膜礼拜 3 i
+顶芽 19 n
+顶视图 3 n
+顶角 29 n
+顶账 4 n
+顶踵尽捐 3 i
+顶过去 3 i
+顶过来 3 d
+顶部 570 f
+顶针 13 n
+顶针儿 3 n
+顶针续麻 3 i
+顶错 3 a
+顶门 93 n
+顶门壮户 3 i
+顶门立户 8 n
+顶面 3 f
+顶顶 3 n
+顶顶顶 3 n
+顶风 50 n
+顶风冒雨 3 i
+顶风冒雪 9 i
+顶骨 30 n
+顷 502 t
+顷之 3 d
+顷刻 224 d
+顷刻之间 241 i
+顷刻间 423 t
+顷接来信 3 i
+顷者 3 i
+顷襄王 11 nrt
+顷闻 3 i
+顸 4 a
+项 8766 n
+项下 3 n
+项伯亦 2 nr
+项俊波 3 nr
+项内 3 n
+项发明 3 nr
+项周延 2 nr
+项圈 38 n
+项圣谟 3 nr
+项城 63 n
+项城县 3 ns
+项奴儿 2 nr
+项少龙 2 nr
+项庄 3 n
+项庄舞剑 12 nr
+项应祥 2 nr
+项怀诚 5 nr
+项数 4 n
+项明远 9 nr
+项普略 4 nr
+项朝宗 2 nr
+项梁 19 n
+项梁立 2 nr
+项梁自立 4 nr
+项武忠 8 nr
+项海帆 34 nr
+项王 22 n
+项目 13257 n
+项目分析 3 i
+项目前期 3 n
+项目区 17 n
+项目名称 3 n
+项目数 3 n
+项目法人 3 n
+项目管理 71 n
+项目组 22 n
+项目经理 3 n
+项目编号 3 n
+项目联展 3 n
+项目表 3 n
+项目选择 3 nr
+项目部 11 n
+项目风险 3 n
+项立刚 12 nr
+项符合 3 n
+项级 3 n
+项绍芳 2 nr
+项网摘 3 n
+项群 2 n
+项羽 772 nr
+项背 7 n
+项背相望 4 i
+项英 57 nr
+项链 187 n
+项长老 3 nr
+项领 3 n
+项饰 2 n
+项骨 2 n
+顺 2916 p
+顺丁橡胶 9 n
+顺丁烯二酸 18 nz
+顺丁烯二酸酐 18 nz
+顺世 3 nrt
+顺义 75 n
+顺义区 10 ns
+顺义县 18 ns
+顺之者昌 3 i
+顺乎 11 d
+顺乎民心 6 l
+顺乎民意 2 i
+顺乎自然 38 i
+顺产 6 n
+顺人应天 3 i
+顺从 309 p
+顺价 3 n
+顺位 11 n
+顺便 1008 ad
+顺便去 3 l
+顺便来 3 l
+顺其自然 59 i
+顺利 2948 ad
+顺利完成 3 l
+顺利实现 3 i
+顺利开展 3 nz
+顺利性 3 n
+顺利进行 3 n
+顺势 322 n
+顺势上涨 3 l
+顺化 30 v
+顺化乡 3 n
+顺反子 3 n
+顺反异构 3 l
+顺发顺 3 nz
+顺变 3 v
+顺叠构象 3 n
+顺口 144 n
+顺口开河 3 ns
+顺口溜 77 n
+顺口答应 3 i
+顺口谈天 3 i
+顺向 11 d
+顺向构象 3 n
+顺命 3 nz
+顺和 30 nz
+顺嘴 13 ns
+顺坡下驴 3 l
+顺坡骑驴 3 n
+顺城区 3 ns
+顺城街 3 ns
+顺境 35 n
+顺天 3 t
+顺天从人 3 i
+顺天应人 7 i
+顺天应命 3 i
+顺天应时 3 i
+顺天恤民 3 n
+顺天者存 3 i
+顺天者昌 2 i
+顺子 3 n
+顺导 3 n
+顺差 159 n
+顺帝 93 nrt
+顺带 34 n
+顺常 3 d
+顺平 8 n
+顺平县 3 ns
+顺庆区 3 ns
+顺序 1265 n
+顺序号 7 n
+顺序回忆 3 l
+顺序存储 5 n
+顺序拔牙 3 i
+顺序排列 3 l
+顺序控制 8 n
+顺序搜索 3 l
+顺序效应 3 l
+顺序程序 3 l
+顺序索引 3 i
+顺序调用 3 l
+顺序进程 3 l
+顺序量表 3 n
+顺应 247 v
+顺应性 3 n
+顺应时代 3 n
+顺应时势 3 n
+顺应潮流 3 i
+顺延 18 v
+顺延到 3 l
+顺式 32 ad
+顺当 31 p
+顺德 111 nrt
+顺德人 8 nrt
+顺德区 3 ns
+顺德县 5 ns
+顺德市 13 ns
+顺心 97 ad
+顺心如意 3 i
+顺息万变 3 i
+顺情理 3 i
+顺意 5 d
+顺我者昌 7 i
+顺我者生 3 i
+顺手 825 d
+顺手带走 3 i
+顺手牵羊 52 i
+顺承 3 v
+顺排 3 v
+顺旨 3 n
+顺时 3 t
+顺时而动 3 i
+顺时针 3 n
+顺时钟 3 l
+顺时随俗 3 i
+顺昌 10 ns
+顺昌县 3 ns
+顺服 12 n
+顺杆 3 n
+顺杆儿爬 3 l
+顺杆爬 3 l
+顺次 24 d
+顺毛驴 3 n
+顺民 51 n
+顺民者昌 3 ns
+顺气 25 n
+顺水 65 n
+顺水人情 14 n
+顺水推舟 65 nz
+顺水推船 3 nz
+顺水放船 3 nz
+顺水行舟 3 i
+顺水行船 3 n
+顺水顺风 3 i
+顺河 3 ns
+顺治 2479 t
+顺治帝 3 nrt
+顺流 49 n
+顺流而下 56 i
+顺溜 22 z
+顺溜溜 3 z
+顺滑 3 v
+顺理成章 180 i
+顺畅 154 a
+顺畅网 3 i
+顺直 22 d
+顺眼 101 d
+顺着 1178 p
+顺磁屏蔽 3 l
+顺磁性 3 n
+顺磁效应 3 n
+顺祝 3 nrt
+顺美 3 ns
+顺美匡恶 3 i
+顺耳 23 d
+顺脚 16 n
+顺致 3 d
+顺蔓摸瓜 3 n
+顺藤摸瓜 31 i
+顺行 14 v
+顺行冲动 3 i
+顺访 4 v
+顺起来 3 l
+顺路 99 n
+顺路到 3 l
+顺路去 3 l
+顺路来 3 l
+顺路车 2 n
+顺转 3 v
+顺达 3 nrt
+顺过饰非 3 i
+顺适 3 a
+顺逆 20 v
+顺遂 29 v
+顺道 79 v
+顺道儿 3 n
+顺道去 3 i
+顺道来 3 l
+顺随 3 v
+顺非而泽 3 i
+顺面 3 ad
+顺顺 7 nz
+顺顺利利 3 ns
+顺顺当当 27 i
+顺风 148 n
+顺风使帆 3 l
+顺风使舵 3 i
+顺风使船 3 i
+顺风吹火 3 i
+顺风岛 3 ns
+顺风张帆 3 nz
+顺风扯帆 3 l
+顺风扯旗 3 l
+顺风球 3 n
+顺风而呼 3 i
+顺风耳 28 i
+顺风船 3 n
+顺风行船 3 n
+顺风转舵 3 i
+顺风驶船 3 nz
+须 8997 d
+须一一 4 t
+须三思 7 nr
+须为城 16 nr
+须乖乖 2 nr
+须作诗 3 nr
+须修持 2 nr
+须内劲 2 nr
+须刨 3 n
+须力 2 n
+须加盖 4 nr
+须加考 4 nr
+须勤修 2 nr
+须勤慎 2 nr
+须卜氏 3 nr
+须发 94 v
+须发皆白 13 l
+须右乃 2 nr
+须向北 2 nr
+须和戎 2 nr
+须城安 3 nr
+须备 2 n
+须子 11 nr
+须学得 2 nr
+须尊奉 2 nr
+须少林 2 nr
+须尽欢 3 nr
+须居士 2 nr
+须弥 3 nr
+须弥山 20 nr
+须弥座 1296 nr
+须弥福 4 nr
+须弥芥子 3 l
+须得依 8 nr
+须得先 33 nr
+须得学 3 l
+须得寻 3 nr
+须得治 2 nr
+须得海 2 nr
+须得胜 2 nr
+须得言 3 nr
+须得连 2 nr
+须得静 2 nr
+须得马 2 nr
+须德海 6 nr
+须怪 3 v
+须慎防 16 nr
+须执盾 16 nr
+须报 3 n
+须拔 3 n
+须拔发 2 nr
+须持 3 v
+须按 3 nr
+须授 2 n
+须掌力 3 nr
+须明言 2 nr
+须曾闻 2 nr
+须根 51 nr
+须毛 3 nr
+须海棠 2 nr
+须溪集 2 nr
+须生 13 nr
+须略 3 n
+须疮 2 n
+须白眉 8 nr
+须眉 119 nr
+须眉交白 3 l
+须眉男儿 3 l
+须眉男子 3 l
+须眉皓然 3 z
+须知 241 nr
+须答允 5 nr
+须纳复 2 nr
+须经 3 n
+须老儿 3 nr
+须老翁 2 nr
+须联孙 2 nr
+须至榜 2 nr
+须臾 217 t
+须臾不离 3 l
+须臾之间 12 l
+须芒草 2 nr
+须菩提 3 n
+须虾纲 3 nr
+须要 161 v
+须赐赠 2 nr
+须运铜 2 nr
+须连累 2 nr
+须送 3 v
+须道人 22 nr
+须针 2 n
+须长发 2 nr
+须防丘 2 nr
+须防仁 4 nr
+须顾 2 v
+须飘然 2 nr
+须髯如戟 3 nr
+须髯戟 4 nr
+须鲸 4 nr
+须鲸亚 3 nr
+顼 7 g
+顽 559 ag
+顽儿 2 n
+顽军 5 n
+顽冥不化 3 l
+顽劣 33 a
+顽劣分子 3 l
+顽匪 3 n
+顽嚣 3 v
+顽固 432 a
+顽固不化 29 l
+顽固份子 3 n
+顽固性 15 n
+顽固派 286 n
+顽固立场 3 n
+顽固腐朽 3 n
+顽廉懦立 3 vn
+顽张 3 a
+顽强 815 a
+顽强不屈 3 i
+顽强抵抗 3 l
+顽强拼搏 3 n
+顽意儿 18 l
+顽愚 3 a
+顽抗 90 v
+顽抗到底 3 l
+顽敌 6 n
+顽昧 3 a
+顽梗 3 n
+顽梗不化 3 n
+顽民 5 n
+顽父嚚母 3 nz
+顽疣 3 n
+顽疾 25 n
+顽症 29 n
+顽痛 3 a
+顽癣 2 n
+顽皮 254 a
+顽皮贼骨 3 l
+顽皮赖肉 3 n
+顽皮赖骨 3 n
+顽皮鬼 3 l
+顽石 29 n
+顽石点头 3 n
+顽磁性 3 n
+顽童 541 n
+顽钝 5 a
+顽靡 3 a
+顾 3823 v
+顾一望 3 nr
+顾万明 3 nr
+顾三麻子 3 nr
+顾上尉 2 nr
+顾不上 358 l
+顾不了 12 l
+顾不到 3 l
+顾不得 425 v
+顾不过来 3 l
+顾中庆 4 nr
+顾主 10 nr
+顾之恩 4 nr
+顾也鲁 3 nr
+顾二哥 10 nr
+顾云章 3 nr
+顾亭林 12 nr
+顾信义 4 nr
+顾倾人 4 nr
+顾健翎 8 nr
+顾允成 2 nr
+顾兆熊 2 nr
+顾先生 7 nr
+顾全 85 nr
+顾全大局 76 nr
+顾公子 2 nr
+顾其子 2 nr
+顾其耳 2 nr
+顾养民 129 nr
+顾冠中 3 nr
+顾况 4 n
+顾准 68 n
+顾凤才 8 nr
+顾到 3 v
+顾前不顾 3 i
+顾前不顾后 5 i
+顾功叙 2 nr
+顾及 468 v
+顾双凤 28 nr
+顾名 3 n
+顾名世 5 nr
+顾名思义 104 nr
+顾后瞻前 3 i
+顾君恩 58 nr
+顾员 3 n
+顾命辅 4 nr
+顾品珍 4 nr
+顾嗣立 3 nr
+顾圣婴 3 nr
+顾复之恩 3 nr
+顾大喜 2 nr
+顾大嫂 75 nr
+顾大局 3 nr
+顾大章 36 nr
+顾太太 6 nr
+顾头不顾尾 3 i
+顾始汗 2 nr
+顾媚生 82 nr
+顾子方 12 nr
+顾学颉 2 nr
+顾安茹 3 nr
+顾实汗 9 nr
+顾客 1365 nr
+顾客群 3 nr
+顾宪成 47 nr
+顾家 19 n
+顾家岗 3 nr
+顾小失大 3 i
+顾尔纯 2 nr
+顾尔谦 28 nr
+顾崇廉 9 nr
+顾左右而言他 13 l
+顾希尧 3 nr
+顾广圻 2 nr
+顾应祥 8 nr
+顾延清 6 nr
+顾延盛 19 nr
+顾建兵 3 nr
+顾建发 2 nr
+顾影弄姿 3 i
+顾影惭形 3 i
+顾影自怜 14 i
+顾彼忌此 3 i
+顾得上 80 l
+顾得东 2 nr
+顾得取 2 nr
+顾德蓉 2 nr
+顾心 2 n
+顾忌 321 nr
+顾念 114 n
+顾怀远 43 nr
+顾恤 3 v
+顾恩思 2 nr
+顾恺之 33 nr
+顾惜 43 nr
+顾意 3 n
+顾拜旦 20 nr
+顾振清 4 nr
+顾无语 2 i
+顾晓宁 11 nr
+顾晓鸣 13 nr
+顾景惭形 3 i
+顾曲周 2 nr
+顾曲周郎 3 n
+顾曲斋 2 nr
+顾曼桢 3 nr
+顾朝曦 2 nr
+顾杲才 2 nr
+顾杲扶 2 nr
+顾杲望 2 nr
+顾杲正 3 nr
+顾林娣 2 nr
+顾林生 2 nr
+顾果字 2 n
+顾梅君 3 nr
+顾正红 29 nr
+顾正龙 16 nr
+顾此失彼 48 i
+顾永菲 3 nr
+顾海兵 2 nr
+顾海波 8 nr
+顾清山 3 nr
+顾渚紫 3 nr
+顾源 466 n
+顾源之 2 nr
+顾源会 2 nr
+顾源伸 2 nr
+顾源正 2 nr
+顾澄勇 8 nr
+顾瀚思 5 nr
+顾炎武 172 nr
+顾犬补牢 3 i
+顾玉书 3 nr
+顾玉清 2 nr
+顾理 5 n
+顾盼 74 nr
+顾盼多姿 3 i
+顾盼生姿 12 i
+顾盼生情 3 i
+顾盼生辉 3 nr
+顾盼神飞 2 nr
+顾盼自得 3 i
+顾盼自若 3 nr
+顾盼自豪 3 nr
+顾盼自雄 6 nr
+顾眉扬 2 nr
+顾祖禹 6 nr
+顾祝同 20 nr
+顾秀莲 260 nr
+顾秉谦 19 nr
+顾秋水 857 nr
+顾筑胜 3 nr
+顾绣 13 nr
+顾维均 2 nr
+顾维钧 14 nr
+顾翊群 2 nr
+顾翼东 2 nr
+顾而言他 3 l
+顾自地 5 nr
+顾莞尔 2 nr
+顾虑 457 v
+顾虑到 3 l
+顾虑重重 26 i
+顾视 3 v
+顾诱 3 v
+顾诸紫 2 nr
+顾谓众 8 nr
+顾谓诸 4 nr
+顾返 3 v
+顾里刚 2 nr
+顾里新 2 nr
+顾金 4 n
+顾金标 216 nr
+顾铁华 2 nr
+顾锡畴 12 nr
+顾长卫 16 nr
+顾问 1697 nr
+顾问公司 3 n
+顾问团 66 nr
+顾问处 9 l
+顾问权 3 nr
+顾问组 2 n
+顾问费 7 nr
+顾雍进 2 nr
+顾雏军 33 nr
+顾面子 4 n
+顾顺章 3 nr
+顾顾 2 v
+顾颉刚 51 nr
+顾颜面 3 nr
+顾麟生 25 nr
+顾黄吕 4 nr
+顾鼎臣 3 nr
+顾齐平 16 nr
+顿 2604 q
+顿住 3 d
+顿切夫 2 nrt
+顿口拙腮 3 i
+顿口无言 3 i
+顿号 7 n
+顿学累功 3 i
+顿巴教橡 3 n
+顿巴斯 16 ns
+顿开 3 v
+顿开茅塞 4 ns
+顿悟 89 v
+顿悟说 3 n
+顿感 3 v
+顿成 3 v
+顿挫 34 v
+顿挫抑扬 3 nz
+顿改 3 v
+顿改前非 3 i
+顿教 3 v
+顿时 2285 d
+顿河 102 ns
+顿涅茨克 6 nrt
+顿消 3 v
+顿渐 3 d
+顿然 81 d
+顿珠 3 ns
+顿珠次仁 2 ns
+顿生 36 v
+顿笔 3 d
+顿纲振纪 3 n
+顿绝法 3 i
+顿脚 3 ns
+顿脚捶胸 3 i
+顿腹之言 3 i
+顿觉 104 d
+顿起 3 v
+顿足 234 d
+顿足不前 3 i
+顿足失色 3 i
+顿足捩耳 3 n
+顿足捶胸 2 i
+顿足搓手 3 vn
+顿足搥胸 3 v
+顿足椎胸 3 n
+顿音 3 n
+顿饭 3 v
+顿首 91 v
+顿首再拜 3 i
+颀 22 z
+颀然 3 z
+颀长 33 z
+颁 2636 v
+颁予 3 v
+颁令 6 v
+颁发 1395 v
+颁发奖品 3 n
+颁发奖杯 3 n
+颁发奖牌 3 n
+颁发奖状 3 n
+颁发奖金 3 n
+颁奖 317 v
+颁奖仪式 3 n
+颁奖会 2 n
+颁奖典礼 3 n
+颁奖礼 3 n
+颁奖词 3 n
+颁布 2537 v
+颁布实施 3 n
+颁布法律 3 n
+颁布者 3 n
+颁授 3 v
+颁给 3 v
+颁行 273 v
+颁证 12 v
+颁证会 4 v
+颁赏 3 v
+颁赐 43 v
+颁赠 8 v
+颁赠给 3 n
+颂 602 v
+颂古非今 2 i
+颂叹 3 v
+颂声 3 n
+颂声载道 3 i
+颂德 6 n
+颂德歌功 3 i
+颂扬 323 v
+颂扬备至 3 i
+颂扬性 3 n
+颂杨 3 n
+颂歌 63 n
+颂祝 3 v
+颂词 18 n
+颂诗 27 n
+颂赞 3 v
+颂辞 3 v
+预 703 v
+预习 23 v
+预习功课 3 n
+预亏 7 v
+预交 4 v
+预产 3 vn
+预产期 16 n
+预付 1200 vn
+预付卡 3 n
+预付定金 3 n
+预付款 19 n
+预付费 9 vn
+预付资本 3 n
+预付金 3 n
+预估 50 vn
+预作 3 vn
+预借 3 v
+预充电 3 n
+预兆 112 n
+预先 850 vn
+预先付讫 3 n
+预先判断 3 n
+预先备有 3 l
+预先安排 3 n
+预先审查 3 n
+预先录制 3 n
+预先想定 3 l
+预先指定 3 n
+预先注定 3 n
+预先测验 3 n
+预先确定 3 n
+预先规定 3 b
+预先警告 3 n
+预先计划 3 n
+预先设立 3 n
+预先选择 3 l
+预入 3 v
+预决算 4 v
+预冷 10 vn
+预冷器 3 n
+预分 3 n
+预删除 3 vn
+预制 65 v
+预制件 3 n
+预制厂 3 n
+预制品 3 n
+预制板 4 n
+预制构件 4 n
+预加工 6 n
+预卜 16 v
+预压 4 v
+预压载舱 3 n
+预发 3 v
+预后 174 d
+预告 69 v
+预告片 3 n
+预告篇 3 n
+预售 79 vn
+预售处 3 n
+预售版 3 n
+预售票 3 n
+预售证 3 n
+预埋 8 vn
+预埋件 3 n
+预处理 33 vn
+预备 913 v
+预备会 3 n
+预备会议 3 n
+预备党员 3 n
+预备军官 3 n
+预备士官 3 n
+预备工作 3 n
+预备役 350 n
+预备性 4 n
+预备期 3 n
+预备班 12 n
+预备生 8 n
+预备立宪 3 n
+预备费 4 n
+预备赛 3 n
+预备部 4 n
+预备金 3 n
+预备队 212 n
+预委会 3 n
+预存 3 v
+预官 3 n
+预定 1093 v
+预定金 3 n
+预审 177 vn
+预审员 2 n
+预层 3 n
+预展 7 vn
+预应力 102 n
+预征 4 v
+预想 147 v
+预想出 3 v
+预想到 3 v
+预感 393 n
+预扣 3 v
+预扩散 3 j
+预把 3 v
+预报 700 vn
+预报名 3 n
+预报员 3 n
+预报地图 3 n
+预拨 2 v
+预探 3 vn
+预控 3 vn
+预提 7 n
+预搔待痒 3 n
+预支 35 n
+预收 23 v
+预收款 2 n
+预收费 2 n
+预料 579 n
+预料不到 3 l
+预料中 3 n
+预料之中 3 l
+预料出 3 n
+预料到 3 l
+预断 3 v
+预映 3 v
+预有安排 3 n
+预期 1656 vn
+预期利益 3 n
+预案 320 n
+预测 2013 vn
+预测值 9 n
+预测出 3 n
+预测器 3 n
+预测学 2 n
+预测性 15 n
+预测者 3 n
+预测间隔 3 n
+预混料 2 n
+预演 44 vn
+预烧 3 v
+预热 43 v
+预热器 3 n
+预热炉 3 n
+预留 168 v
+预白化 3 n
+预知 76 v
+预知子 3 n
+预研 36 vn
+预示 333 v
+预示性 3 n
+预示条件 3 n
+预祝 58 v
+预科 135 n
+预科班 53 n
+预科生 3 n
+预科部 2 n
+预筹 3 v
+预算 4797 v
+预算书 5 n
+预算内 48 n
+预算员 3 n
+预算外 21 n
+预算案 48 n
+预算法 3 n
+预算编制 3 n
+预算表 3 n
+预算赤字 3 n
+预精制 3 n
+预紧 3 v
+预约 143 v
+预约卡 2 n
+预编 5 v
+预缴 3 v
+预置 11 vn
+预考 3 v
+预聚物 2 n
+预藏 3 v
+预藏着 3 v
+预行 3 v
+预表 3 v
+预装 113 v
+预见 283 v
+预见到 3 v
+预见性 39 n
+预览 136 vn
+预览版 3 n
+预觉 3 v
+预解式 3 n
+预言 644 v
+预言家 22 n
+预言性 3 n
+预言者 3 n
+预警 768 vn
+预警机 265 n
+预警系统 3 n
+预警线 2 n
+预警飞机 3 n
+预计 2768 vn
+预订 507 v
+预订单 3 n
+预订电话 3 n
+预设 64 vn
+预设值 3 n
+预设底线 3 n
+预设短信 3 n
+预设立场 3 n
+预读 4 v
+预调 2 v
+预谋 93 v
+预购 7 v
+预购版 3 n
+预贷 3 n
+预赛 159 vn
+预述 3 v
+预选 154 v
+预选赛 32 n
+预防 2016 v
+预防为主 3 n
+预防剂 3 n
+预防性 45 n
+预防接种 3 n
+预防措施 3 n
+预防注射 3 n
+预防犯罪 3 n
+预防药 2 n
+预防针 9 n
+预风 3 v
+颅 177 n
+颅内 75 s
+颅底 7 s
+颅底点 3 n
+颅息 3 n
+颅相学 5 n
+颅脑 28 n
+颅腔 23 n
+颅顶骨 3 n
+颅骨 73 n
+领 6800 v
+领主 203 n
+领书 3 n
+领事 313 n
+领事司 13 n
+领事团 3 n
+领事裁判 3 n
+领事裁判权 52 n
+领事部 6 n
+领事馆 83 n
+领人 3 n
+领会 529 n
+领会到 3 l
+领会理解 3 n
+领使馆 2 n
+领先 1775 n
+领先于 3 n
+领先地位 3 n
+领先水平 3 n
+领先者 25 n
+领入 3 n
+领兵 3 n
+领养 46 n
+领养人 3 n
+领军 188 n
+领军人 5 n
+领军人物 63 n
+领军者 3 n
+领出 3 v
+领出去 3 v
+领到 281 v
+领办 13 n
+领勾 3 n
+领单 3 n
+领去 3 v
+领发 3 n
+领取 554 v
+领取证 10 n
+领受 136 v
+领受到 3 l
+领口 98 n
+领口处 11 n
+领司 3 n
+领命 3 n
+领唱 20 n
+领唱者 3 n
+领回 44 v
+领回去 3 l
+领回来 3 l
+领国 3 n
+领圈 2 n
+领土 2344 n
+领土完整 3 l
+领土毗连 3 vn
+领土问题 3 n
+领地 788 n
+领地行为 3 n
+领域 9771 n
+领域专家 3 n
+领域建模 3 n
+领域规约 3 n
+领头 268 n
+领头人 35 n
+领头羊 97 n
+领头雁 4 n
+领奖 35 n
+领奖人 3 n
+领奖台 75 n
+领奖者 3 n
+领子 90 n
+领存 3 n
+领导 31739 n
+领导人 4726 n
+领导人员 284 n
+领导作风 3 n
+领导全党 3 n
+领导力 69 n
+领导品牌 3 n
+领导小组 3 n
+领导层 215 n
+领导岗位 3 n
+领导带头 3 n
+领导成员 3 n
+领导批示 3 n
+领导有方 4 n
+领导权 450 n
+领导核心 3 n
+领导班子 519 n
+领导组 6 n
+领导者 457 n
+领导职务 3 n
+领导责任 3 n
+领导阶层 3 n
+领导集体 3 n
+领属 14 n
+领巾 5 n
+领带 191 n
+领带卡 3 n
+领带夹 9 n
+领带针 3 n
+领异标新 3 l
+领引 3 v
+领悟 401 n
+领悟出 3 n
+领悟到 3 n
+领悟力 6 n
+领情 77 n
+领成 3 v
+领扣 3 n
+领报 3 n
+领拨 3 v
+领携 3 v
+领收 3 n
+领教 439 n
+领教过 3 l
+领料 3 n
+领有 71 v
+领来 3 v
+领来领去 3 l
+领款 3 n
+领款人 3 n
+领水 3 n
+领洗 3 vn
+领海 222 n
+领海宽度 3 l
+领海权 8 n
+领海范围 3 n
+领港 5 n
+领港员 3 n
+领港费 3 n
+领点 3 n
+领照 3 n
+领班 143 n
+领用 3 n
+领略 303 n
+领略出 3 n
+领略到 3 l
+领空 144 n
+领空权 3 n
+领章 30 n
+领结 28 v
+领罪 3 vn
+领舞 20 n
+领航 70 n
+领航员 39 n
+领航图 3 n
+领航权 3 n
+领航者 3 n
+领航艇 3 n
+领花 2 n
+领衔 232 n
+领衔主演 3 n
+领表 3 n
+领表格 3 n
+领袖 2578 n
+领袖人物 3 n
+领袖像 137 n
+领袖欲 3 n
+领袖群伦 12 l
+领证 3 n
+领读 6 v
+领购 3 v
+领赏 32 v
+领走 26 v
+领跑 38 v
+领跑者 10 n
+领路 99 n
+领路人 6 n
+领过去 3 l
+领过来 3 l
+领近 3 v
+领进 3 v
+领进去 3 l
+领进来 3 l
+领退 3 v
+领道 8 n
+领里乡党 3 n
+领釦 3 vn
+领钱 3 n
+领队 302 n
+领队人 3 n
+领队证 3 n
+领风骚 3 n
+领饷 3 n
+领馆 43 n
+领骑 2 n
+颇 5456 d
+颇丰 49 v
+颇为 122 v
+颇为得意 3 l
+颇为费解 3 l
+颇为重要 3 l
+颇久 3 d
+颇似 27 v
+颇佳 3 v
+颇具 255 v
+颇具匠心 6 l
+颇具规模 23 l
+颇冷 3 v
+颇受 3 v
+颇受欢迎 3 l
+颇少 3 d
+颇感 138 v
+颇感兴趣 3 l
+颇成 3 v
+颇据 3 v
+颇显 3 v
+颇有价值 3 l
+颇有同感 3 l
+颇有微辞 3 l
+颇欲 3 v
+颇深 3 d
+颇知 3 v
+颇见好评 3 l
+颇觉 3 v
+颇负盛名 22 l
+颇费 3 v
+颇费周折 3 l
+颇费猜测 3 vn
+颇重 3 v
+颈 1891 ng
+颈侧 17 n
+颈内 28 s
+颈动脉 3 n
+颈圈 3 n
+颈子 3 n
+颈巾 3 n
+颈支抗 3 n
+颈梗 3 n
+颈椎 175 n
+颈椎病 67 n
+颈椎骨 3 n
+颈淋巴 2 n
+颈窝 4 n
+颈肩痛 5 n
+颈背 3 n
+颈脖 30 n
+颈部 315 n
+颈长 3 n
+颈静脉 3 n
+颈项 71 n
+颈饰 4 n
+颉 139 nr
+颉颃 16 v
+颊 742 ng
+颊上三毛 3 n
+颊上三毫 3 n
+颊上添毫 3 v
+颊侧翼缘 3 n
+颊向阻生 3 n
+颊嗛 3 n
+颊囊 12 n
+颊板区 3 n
+颊白鸟 3 n
+颊系带 3 n
+颊线 3 n
+颊肽 3 n
+颊脂垫 3 n
+颊腺 3 n
+颊车 3 n
+颊车穴 4 n
+颊间隙 3 n
+颊面 3 n
+颊面管 3 n
+颊须 3 n
+颊骨 3 n
+颋 6 zg
+颌 178 n
+颌下腺 9 n
+颌下腺炎 3 n
+颌内支抗 3 n
+颌力计 3 n
+颌后缩 3 n
+颌外支抗 3 n
+颌学 3 n
+颌导板 3 n
+颌裂 3 n
+颌跳反射 3 n
+颌间固定 3 n
+颌间挛缩 3 n
+颌间支抗 3 n
+颌间牵引 3 vn
+颌间距离 3 n
+颌间间隙 3 n
+颌面 7 n
+颌面部 15 n
+颌骨 47 n
+颍 266 nz
+颍上县 3 ns
+颍川 44 ns
+颍河 32 ns
+颍泉区 3 ns
+颍阳 2 ns
+颎 22 zg
+颏 167 ng
+颏下点 3 n
+颏下间隙 3 n
+颏兜 3 n
+颏前点 3 n
+颏成形术 3 n
+颏结节 3 n
+颏顶点 3 n
+颐 416 ns
+颐中 8 ns
+颐养 19 v
+颐养天年 21 i
+颐养精神 3 i
+颐合园 3 ns
+颐和 18 nz
+颐和园 349 ns
+颐年堂 9 l
+颐性养寿 3 i
+颐指气使 61 i
+颐指风使 3 i
+颐神 3 nz
+颐神养寿 3 i
+颐神养性 3 l
+颐神养气 3 i
+颐精养神 3 i
+频 849 n
+频仍 96 v
+频传 29 n
+频信 3 n
+频偏 3 d
+频出 17 a
+频分多址 3 n
+频发 40 d
+频响 3 n
+频域 3 n
+频宽 3 n
+频密 3 a
+频带 71 n
+频带宽度 3 vn
+频度 38 n
+频散关系 3 n
+频数 13 n
+频次 20 d
+频段 102 n
+频率 2342 n
+频率响应 3 n
+频率抖动 3 vn
+频率段 3 n
+频率牵引 3 vn
+频率特性 3 n
+频率计 3 n
+频率阶跃 3 n
+频生 3 n
+频移键控 3 n
+频繁 1945 a
+频谱 58 n
+频谱仪 3 n
+频道 1024 n
+频道文件 3 n
+频道栏目 3 n
+频遭 5 n
+频闪仪 3 n
+频频 646 d
+频频告急 3 n
+频频点头 3 n
+颓 111 n
+颓丧 57 a
+颓势 64 n
+颓唐 32 a
+颓坏 3 n
+颓垣废井 3 l
+颓垣断堑 3 l
+颓垣断壁 3 l
+颓垣败井 3 l
+颓垣败壁 3 l
+颓堕委靡 3 nr
+颓塌 3 z
+颓废 98 a
+颓废派 16 n
+颓废者 3 n
+颓放 3 z
+颓敝 3 a
+颓然 125 z
+颓然丧气 3 l
+颓败 31 n
+颓运 3 n
+颓靡 5 a
+颓顶 3 n
+颓颜 3 n
+颓风 3 n
+颓龄 3 n
+颔 72 zg
+颔下 3 v
+颔厌 3 v
+颔版 3 v
+颔联 3 v
+颔首 80 v
+颔首微笑 3 nr
+颖 511 nr
+颖上 3 n
+颖上县 2 n
+颖川 3 n
+颖异 3 a
+颖悟 28 n
+颖悟绝人 3 n
+颖悟绝伦 3 n
+颖慧 6 n
+颖慧绝伦 3 v
+颖慧过人 3 v
+颖果 21 n
+颖秀 3 a
+颖脱 3 a
+颖脱而出 3 n
+颖花 3 n
+颖黠 3 a
+颗 1980 m
+颗卫星 2 nz
+颗烂 3 n
+颗粒 565 n
+颗粒剂 9 nz
+颗粒化 2 nz
+颗粒归仓 3 n
+颗粒感 3 n
+颗粒无收 3 n
+颗粒机 3 n
+颗粒物 43 n
+颗粒状 44 nz
+颗粒细胞 3 n
+颗粒肥料 3 nz
+颗粒饲料 3 n
+题 5668 n
+题上去 3 v
+题上来 3 v
+题下 3 n
+题下去 3 v
+题下来 3 v
+题为 367 v
+题写 239 n
+题刻 25 n
+题匾 5 n
+题号 11 n
+题名 28 n
+题名录 17 n
+题咏 17 n
+题图 3 n
+题型 381 n
+题壁 3 n
+题外 43 n
+题外话 3 n
+题头 3 n
+题字 60 n
+题库 30 n
+题库系统 3 n
+题录 6 n
+题得 3 v
+题意 30 n
+题旨 39 n
+题材 1470 n
+题材股 3 n
+题款 13 n
+题注 2 v
+题海 26 n
+题海战术 30 n
+题画 3 n
+题目 1221 n
+题着 3 v
+题签 13 n
+题署 3 n
+题花 3 n
+题解 10 v
+题记 52 n
+题词 349 n
+题诗 77 n
+题跋 50 n
+题辞 11 n
+颙 34 zg
+颚 122 n
+颚下腺 3 n
+颚裂 2 n
+颚足 3 n
+颚骨 9 n
+颛 9 n
+颛臾 5 ns
+颛顼 82 n
+颜 444 nr
+颜三卫 15 nr
+颜世贵 5 nr
+颜丙燕 3 nr
+颜东彪 2 nr
+颜丹晨 3 nr
+颜丹鬓绿 3 i
+颜为笑 2 nr
+颜之推 14 nr
+颜乌野 8 nr
+颜书 2 n
+颜事敌 2 n
+颜二女 2 nr
+颜二姓 2 nr
+颜亮南 2 nr
+颜亮天 2 nr
+颜从彝 3 nr
+颜仟汶 3 nz
+颜代领 2 nr
+颜体 18 n
+颜佩韦 26 nr
+颜元之 2 nr
+颜元孙 3 nr
+颜兄弟 2 nr
+颜光禄 3 nr
+颜其额 2 nr
+颜冬润 3 nr
+颜勤礼 2 nr
+颜博尔 2 nr
+颜卫地 2 n
+颜卫曰 2 nr
+颜合达 7 nr
+颜回 3 nr
+颜大喜 2 nr
+颜大怒 134 nr
+颜大悦 10 nr
+颜如桃花 2 nr
+颜如玉 15 nr
+颜姊姊 4 nr
+颜姑娘意 2 nr
+颜子 8 n
+颜学柏 6 nr
+颜守忠 3 nr
+颜守贞 3 nr
+颜宗弼 61 nr
+颜宗望 8 nr
+颜宗磐 11 nr
+颜宗翰 12 nr
+颜宗辅 8 nr
+颜宗隽 5 nr
+颜容 3 n
+颜射 3 nr
+颜小将军 12 nr
+颜山赵 4 nr
+颜师古 10 nr
+颜希尹 23 nr
+颜康惊 2 nr
+颜康笑 12 nr
+颜康见 5 nr
+颜延之 6 nr
+颜延寿 8 nr
+颜异 4 n
+颜彼得 3 nr
+颜忤旨 2 nr
+颜思烈 4 nr
+颜思齐 6 nr
+颜总帅 2 nr
+颜悦色 3 nr
+颜惠庆 5 nr
+颜承麟 3 nr
+颜文梁 6 nr
+颜料 275 n
+颜料商 3 n
+颜料盒 3 n
+颜昔班 2 nr
+颜晟天 2 nr
+颜晟子 2 nr
+颜晟时 2 nr
+颜杲卿 10 nr
+颜杲攻 3 nr
+颜欣悦 2 nr
+颜正国 3 nr
+颜氏家训 3 nr
+颜氏异 2 nr
+颜永盛 2 nr
+颜洪烈 346 nr
+颜海英 3 nr
+颜渊 3 nr
+颜烈笑 5 nr
+颜珠定 2 nr
+颜相公 2 nr
+颜真卿 47 nr
+颜神 3 n
+颜福兴 3 nr
+颜福庆 2 nr
+颜筋柳骨 2 i
+颜精柳骨 3 nr
+颜统 3 n
+颜统军 39 nr
+颜良之 2 nr
+颜色 3100 n
+颜色代码 3 n
+颜色混合 3 nr
+颜色爱好 3 nr
+颜色立体 3 n
+颜色视觉 3 n
+颜色适应 3 n
+颜若冰 2 nr
+颜若春 2 nr
+颜若朝 2 nr
+颜萍喜 2 nr
+颜萍奇 2 nr
+颜萍奔 3 nr
+颜萍容 2 nr
+颜萍强 2 nr
+颜萍微微 4 nr
+颜萍心 4 nr
+颜萍欲 2 nr
+颜萍芳 2 nr
+颜萍行 2 nr
+颜萍骑 2 nr
+颜行书 3 n
+颜襄任 2 nr
+颜谋衍 2 nr
+颜貌 3 n
+颜邦屏 256 nr
+颜阿骨 68 nr
+颜阿鲁 2 nr
+颜陈和尚 8 nr
+颜集镇 3 nr
+颜面 213 n
+颜面何存 3 n
+颜面扫地 7 n
+颜面无光 3 n
+颜面骨 3 n
+颜骨柳筋 3 nr
+颜鲁公 7 nr
+额 2464 n
+额伦夫人 13 nrt
+额伦特 3 nr
+额前 3 nrfg
+额勒登 3 nr
+额叶 11 n
+额吉纳 2 nr
+额吉诺 4 nr
+额喇克 2 nr
+额外 1486 b
+额外主事 3 n
+额外其 3 nr
+额外小费 3 n
+额外开支 3 n
+额外收费 3 n
+额外牙 3 n
+额外环 3 n
+额外负担 3 n
+额头 930 n
+额娘 175 n
+额定 99 b
+额定值 3 n
+额定功率 3 n
+额定电流 3 n
+额定负载 3 b
+额定量 3 n
+额尔克 2 nr
+额尔其斯 3 ns
+额尔古 6 ns
+额尔古纳 24 ns
+额尔古纳市 2 ns
+额尔古纳河 91 ns
+额尔德 3 nr
+额尔德尼 13 nrt
+额尔济 2 nr
+额尔登 2 nr
+额尔金 6 nr
+额尔齐 6 nr
+额尔齐斯 23 ns
+额尔齐斯河 88 ns
+额巴钦 2 nr
+额布根 2 ns
+额度 185 n
+额手 3 n
+额手相庆 3 i
+额手称庆 9 n
+额手称颂 3 nr
+额敏 10 nr
+额敏县 7 ns
+额敏河 6 nr
+额数 10 n
+额木尔 3 nr
+额林沁 2 nr
+额比亚 4 ns
+额济纳 23 nr
+额济纳旗 26 nr
+额满为止 3 i
+额菲尔士 3 nr
+额角 124 n
+额贺福志郎 7 nr
+额蹙心痛 3 i
+额金岭 2 nr
+额面 3 n
+额饰 3 n
+额首称庆 3 nr
+额骨 3 n
+额鲁特 2 nr
+颞 62 n
+颞下间隙 3 n
+颞叶 13 n
+颞间隙 3 n
+颞颥 16 n
+颞骨 6 n
+颟顸 15 a
+颟顸无能 3 nz
+颠 655 v
+颠三倒四 79 i
+颠乾倒坤 3 i
+颠仆 3 n
+颠仆流离 3 i
+颠倒 438 v
+颠倒乾坤 3 i
+颠倒众生 3 i
+颠倒反转 3 i
+颠倒干坤 3 i
+颠倒是非 14 i
+颠倒衣裳 3 n
+颠倒阴阳 3 i
+颠倒黑白 21 i
+颠儿 24 n
+颠唇簸嘴 3 v
+颠复 3 v
+颠峰 3 n
+颠扑不破 15 i
+颠扑不磨 3 i
+颠斤播两 3 i
+颠末 3 n
+颠来倒去 21 i
+颠来播去 3 i
+颠来簸去 3 z
+颠毛种种 3 i
+颠沛 144 a
+颠沛流离 45 i
+颠狂 22 a
+颠簸 242 v
+颠簸不破 3 z
+颠茄 19 n
+颠茄草 3 n
+颠衣到裳 3 n
+颠覆 301 v
+颠覆不破 3 i
+颠覆性 3 i
+颠覆者 3 i
+颠连 3 v
+颠颠 3 z
+颠颠倒倒 3 i
+颠颠晃晃 3 z
+颠颠簸簸 4 z
+颠鸾倒凤 5 i
+颡 17 g
+颢 6 g
+颣 2 zg
+颤 1678 v
+颤动 349 v
+颤动回声 3 n
+颤动线 3 n
+颤声 3 v
+颤巍 3 z
+颤巍巍 114 z
+颤微微 7 z
+颤悠 3 z
+颤悠悠 13 z
+颤悸 3 v
+颤慄 3 z
+颤抖 873 v
+颤抖地 3 z
+颤抖抖 24 z
+颤振 17 v
+颤栗 75 v
+颤沼 3 n
+颤笔 3 v
+颤音 25 n
+颤颤巍巍 24 z
+颤颤悠悠 11 z
+颦 61 g
+颦眉 3 l
+颧 50 n
+颧骨 106 n
+颧髎 3 n
+風 3 zg
+颭 11 zg
+颯 342 zg
+颱 15 zg
+颱风 3 vn
+颱风天 3 v
+颱风季 3 v
+颱风眼 3 v
+颱风雨 3 v
+颳了 3 y
+颳倒 3 z
+颳去 3 z
+颳得 3 vn
+颳着 3 y
+颳走 3 vn
+颳起 3 vn
+颳起来 3 v
+颳风 3 vn
+颼 23 zg
+飄 7 zg
+飆 22 zg
+飊 3 zg
+风 11195 n
+风不 3 i
+风不鸣条 3 i
+风中之烛 3 i
+风中残烛 3 i
+风中秉烛 3 i
+风举云摇 3 i
+风举云飞 3 i
+风之伤 3 i
+风之影 3 i
+风之狼 3 n
+风之翼 3 i
+风之舞 3 i
+风之谷 3 i
+风之轩 3 nz
+风习 28 n
+风乾 3 ns
+风乾机 3 i
+风云 349 n
+风云不测 3 i
+风云之志 3 i
+风云二号 8 n
+风云人物 74 i
+风云变幻 83 i
+风云变态 3 l
+风云变色 3 i
+风云叱吒 3 nrt
+风云录 2 n
+风云月露 3 i
+风云榜 3 i
+风云突变 17 i
+风云篇 3 n
+风云翔 3 ns
+风云际会 25 n
+风从虎 4 i
+风仪 6 n
+风传 35 n
+风俗 819 n
+风俗习惯 3 n
+风俗人情 16 i
+风俗画 47 n
+风信 3 n
+风信子 5 n
+风信年华 3 i
+风信花 3 n
+风信鸽 3 n
+风偏 9 n
+风停了 3 l
+风儿 32 n
+风光 1746 n
+风光一时 8 i
+风光不在 3 i
+风光十足 3 i
+风光带 3 n
+风光旖旎 23 i
+风光明媚 3 i
+风光月霁 3 i
+风光片 8 n
+风光秀丽 3 i
+风入松 4 n
+风兰 5 n
+风兵草甲 3 n
+风再起 3 i
+风冷 33 n
+风冷式 3 n
+风凄月冷 3 i
+风凉 20 a
+风凉话 38 n
+风刀霜剑 4 i
+风前月下 3 i
+风前残烛 3 i
+风剥雨蚀 3 i
+风力 333 n
+风力机 3 n
+风动 33 n
+风动工具 6 n
+风动石 9 n
+风势 45 n
+风化 419 n
+风化作用 3 n
+风化区 3 n
+风化场所 3 n
+风化壳 3 n
+风化层 3 n
+风华 25 n
+风华富丽 3 i
+风华正茂 31 i
+风华绝代 8 i
+风华高科 2 n
+风卷残云 27 i
+风卷荷叶 3 n
+风压 17 n
+风压差 3 n
+风发 3 n
+风口 34 n
+风口浪尖 36 n
+风向 288 n
+风向器 3 n
+风向图 3 n
+风向标 50 n
+风向针 3 n
+风吟 3 v
+风吹 3 v
+风吹不动 3 i
+风吹云散 3 i
+风吹日晒 156 i
+风吹浪打 4 i
+风吹草低见牛羊 10 i
+风吹草动 89 i
+风吹雨打 25 i
+风吹雨淋 7 i
+风吹马耳 3 i
+风味 3024 n
+风味十足 3 i
+风味小吃 3 i
+风味菜 11 n
+风味餐厅 3 n
+风和日丽 32 i
+风和日暖 5 i
+风和日美 3 nz
+风嘴 3 n
+风回电激 3 l
+风圈 4 n
+风土 71 n
+风土人情 112 i
+风土化 3 n
+风土志 3 n
+风土民情 7 n
+风城 3 n
+风声 766 n
+风声水起 3 i
+风声鹤唳 22 i
+风天 2 n
+风头 164 n
+风头甚健 3 i
+风姿 88 n
+风姿绰约 20 i
+风媒 3 n
+风媒传粉 3 n
+风媒花 4 n
+风季 3 n
+风害 8 n
+风寒 196 n
+风尘 151 n
+风尘中人 3 i
+风尘之会 3 i
+风尘之变 3 i
+风尘仆仆 71 i
+风尘女 3 n
+风尘女郎 3 n
+风尘碌碌 3 i
+风尘肮脏 3 nr
+风尚 223 n
+风尚大典 3 i
+风尚奖 2 nz
+风岗 3 n
+风市 3 n
+风帆 105 n
+风带 49 n
+风帽 28 n
+风幕机 3 n
+风干 54 n
+风平波息 3 n
+风平浪静 84 i
+风府 3 n
+风府穴 4 n
+风度 303 n
+风度翩翩 48 i
+风影敷衍 3 i
+风心病 2 n
+风必摧之 2 i
+风急浪大 3 i
+风急浪高 6 i
+风情 782 n
+风情万种 34 i
+风情区 4 n
+风情园 6 n
+风情月债 2 n
+风情月思 3 i
+风情月意 3 i
+风情画 5 n
+风情线 3 n
+风情节 3 n
+风情街 3 n
+风扇 115 n
+风扇工作 2 n
+风扇散热 2 i
+风扇皮带 3 n
+风扫落叶 3 i
+风扬 53 v
+风挡 18 n
+风掣雷行 3 l
+风操 3 n
+风斗 9 n
+风旋电掣 3 i
+风无痕 3 n
+风景 2981 n
+风景不殊 3 a
+风景优美 3 i
+风景区 1562 n
+风景名胜 3 i
+风景园林 3 n
+风景图 3 n
+风景图片 3 n
+风景如画 34 i
+风景学 3 n
+风景林 2 n
+风景树 6 n
+风景点 23 n
+风景画 104 n
+风景秀丽 3 i
+风景线 319 n
+风景设计 3 i
+风景迷人 3 i
+风暴 1196 n
+风暴潮 33 n
+风月 122 n
+风月场所 3 n
+风月无涯 3 i
+风月无边 3 i
+风木之思 3 i
+风木之悲 3 i
+风木含悲 3 i
+风机 40 n
+风机厂 3 n
+风来云散 3 i
+风林火山 3 n
+风枪 2 n
+风标 3 n
+风栉雨沐 3 i
+风栗 3 n
+风格 3758 n
+风格化 2 n
+风格各异 42 l
+风格特征 2 n
+风格馆 3 n
+风档 3 n
+风梨 3 n
+风棱石 2 n
+风樯阵马 3 t
+风正 7 n
+风正一帆悬 4 i
+风气 756 n
+风气之先 21 i
+风水 781 n
+风水先生 3 n
+风水学 3 n
+风水宝地 51 n
+风水师 5 n
+风池 3 n
+风池穴 10 n
+风沙 273 n
+风沙区 6 n
+风沙暴 3 n
+风沙源 3 n
+风油精 26 n
+风波 1354 n
+风波不断 3 i
+风波恶 3 i
+风泵 3 n
+风洞 137 n
+风洞试验 3 n
+风流 523 n
+风流云散 11 i
+风流人物 25 n
+风流倜傥 39 i
+风流债 3 n
+风流儒雅 3 i
+风流冤孽 3 i
+风流千古 3 i
+风流成性 3 n
+风流才子 27 i
+风流潇洒 3 z
+风流罪过 6 l
+风流跌宕 3 l
+风流韵事 26 n
+风浪 320 n
+风浪板 3 n
+风海流 4 n
+风淋室 3 i
+风清弊绝 3 n
+风清扬 3 i
+风清月明 3 i
+风清月朗 3 i
+风湿 144 n
+风湿性 35 n
+风湿性关节炎 17 n
+风湿热 27 n
+风湿疹 3 n
+风湿病 63 n
+风湿病学 3 n
+风湿症 3 n
+风湿痛 6 n
+风湿科 3 n
+风源 5 n
+风溼 3 vn
+风溼性 3 vn
+风溼病 3 vn
+风满楼 3 i
+风潇潇 3 z
+风潇雨晦 3 i
+风潮 149 n
+风激电飞 3 l
+风激电骇 3 n
+风火 31 n
+风火墙 4 n
+风火山 3 i
+风火轮 11 n
+风灯 4 n
+风灾 11 n
+风炉 3 n
+风炉子 3 n
+风烛 3 n
+风烛之年 3 i
+风烛残年 24 i
+风烛草露 3 i
+风烟 7 n
+风爪 3 n
+风物 66 n
+风物志 3 n
+风物长宜放眼量 2 n
+风狂雨骤 3 l
+风玫瑰图 3 n
+风球 3 n
+风琴 39 n
+风琴手 3 n
+风生水 3 n
+风电 36 n
+风电场 6 n
+风疹 21 n
+风疹块 4 n
+风疹病毒 3 n
+风痹 2 n
+风瘫 4 n
+风砂 3 n
+风磨 2 n
+风神 37 n
+风禾尽起 3 l
+风笛 13 n
+风筝 375 n
+风筝会 7 n
+风筝节 13 n
+风管 6 n
+风箱 116 n
+风籍 3 n
+风絮 3 n
+风级 23 n
+风纪 29 n
+风纪扣 7 n
+风罩 2 n
+风翔 46 v
+风能 83 n
+风致 102 n
+风良 3 n
+风色 17 n
+风艳阁 3 i
+风花雪夜 3 i
+风花雪月 45 i
+风范 185 n
+风范长存 3 n
+风萧萧 3 i
+风虎云龙 3 i
+风虫媒 3 n
+风蚀 133 n
+风蚀坑 3 n
+风蚀残年 3 n
+风蚀洼地 3 n
+风蚀脊 3 n
+风蜡 3 n
+风行 131 n
+风行一世 3 i
+风行一时 21 i
+风行水上 3 n
+风行电击 3 n
+风行电扫 3 nz
+风行电掣 3 i
+风行电照 3 n
+风行者 3 n
+风行草从 3 i
+风行草靡 3 i
+风行雨散 3 i
+风行雷厉 3 i
+风衣 33 n
+风褛 3 l
+风言影语 3 i
+风言醋语 3 n
+风言雾语 3 i
+风言风语 41 i
+风讯网 3 n
+风语不透 3 i
+风语者 3 n
+风调雨顺 54 i
+风谣 4 n
+风貌 404 n
+风起云涌 72 i
+风起云蒸 3 nz
+风起水涌 3 i
+风趣 146 n
+风趣横生 3 i
+风车 63 n
+风车云马 3 i
+风车翼 3 n
+风车雨马 3 n
+风轮 13 n
+风轻云净 3 i
+风选 3 n
+风速 247 n
+风速仪 3 n
+风速器 3 n
+风速表 2 n
+风速计 10 n
+风道 27 n
+风邪 3 n
+风采 650 n
+风采录 3 n
+风采飞扬 3 i
+风里 3 n
+风里来 5 l
+风里来雨里去 5 i
+风量 6 n
+风钻 5 n
+风铃 51 n
+风铲 3 n
+风锤 2 n
+风镐 3 n
+风镜 6 n
+风门 9 n
+风门水口 3 n
+风闸 5 n
+风闻 145 n
+风闻而来 3 i
+风闻而至 3 i
+风际中 3 n
+风险 4042 n
+风险性 33 n
+风险意识 3 n
+风险投资 3 n
+风险管理 3 n
+风险系数 3 n
+风险金 2 n
+风障 3 n
+风雅 97 n
+风雅颂 3 n
+风雨 585 n
+风雨不改 3 i
+风雨不测 3 i
+风雨不透 11 i
+风雨交加 16 i
+风雨共舟 3 i
+风雨兼程 5 l
+风雨凄凄 3 i
+风雨剥蚀 7 i
+风雨同舟 25 i
+风雨同路 3 i
+风雨如晦 13 i
+风雨如磐 7 i
+风雨对床 3 n
+风雨摇摆 3 i
+风雨无阻 28 i
+风雨时若 3 i
+风雨晦冥 3 i
+风雨沧桑 3 i
+风雨漂摇 3 i
+风雨灯 3 n
+风雨萧条 3 i
+风雨衣 7 n
+风雨连床 3 n
+风雨雷电 3 n
+风雨飘摇 45 i
+风雨飘零 3 i
+风雨飘飖 3 l
+风雪 329 n
+风雪交加 9 i
+风雪帽 3 n
+风雷 75 n
+风雷之变 3 i
+风雷动 3 n
+风雷火炮 3 n
+风雹 3 n
+风霜 73 n
+风霜雨雪 16 i
+风靡 194 a
+风靡一时 35 i
+风韵 213 n
+风韵犹存 10 l
+风顺雨调 3 i
+风风 3 n
+风风光光 22 n
+风风火火 70 i
+风风雨雨 79 i
+风风韵韵 3 n
+风餐露宿 32 i
+风马不接 3 i
+风马云车 3 n
+风马牛 3 n
+风马牛不 3 l
+风马牛不相及 28 i
+风驰 3 v
+风驰云卷 3 i
+风驰云走 3 i
+风驰电击 3 i
+风驰电卷 3 i
+风驰电掣 66 i
+风驰电赴 3 i
+风驰电逝 3 i
+风驰电骋 3 i
+风驰草靡 3 i
+风驰雨骤 3 i
+风驰霆击 3 i
+风驱电击 3 i
+风驱电扫 3 nz
+风骚 83 n
+风骨 57 n
+风骨峭峻 3 i
+风高放火 3 n
+风鬟雨鬓 3 i
+风鬟雾鬓 3 i
+风魔 3 n
+风鸟 4 n
+飏 26 zg
+飐 3 zg
+飑 23 g
+飒 14 z
+飒然 62 z
+飒爽 15 z
+飒爽英姿 10 l
+飒飒 62 z
+飒飒声 3 z
+飓 31 n
+飓风 202 n
+飕 98 o
+飕飕 91 o
+飖 9 zg
+飗 20 zg
+飘 1507 v
+飘下 3 v
+飘下去 3 v
+飘下来 3 l
+飘乎 3 d
+飘云版 3 n
+飘到 3 v
+飘动 146 v
+飘去 3 v
+飘向 3 v
+飘垂 3 v
+飘失 3 v
+飘尘 5 v
+飘展 3 vn
+飘带 50 v
+飘往 3 v
+飘忽 137 v
+飘忽不定 3 l
+飘悠 3 z
+飘扬 164 v
+飘拂 19 v
+飘摆 3 v
+飘摇 34 v
+飘摇不定 3 v
+飘散 74 v
+飘散在 3 v
+飘晃 3 z
+飘曳 7 v
+飘曵 3 z
+飘来 3 v
+飘来飘去 3 z
+飘柔 3 a
+飘水 3 v
+飘泊 43 v
+飘泊不定 3 l
+飘泊无定 3 l
+飘洋 2 z
+飘洋航海 3 n
+飘洋过海 14 i
+飘洒 32 v
+飘洒在 3 z
+飘洒自如 3 i
+飘流 29 v
+飘浮 111 v
+飘海 3 v
+飘游 3 v
+飘游四海 3 i
+飘渺 78 a
+飘渺峰 3 nr
+飘溢 6 v
+飘然 152 d
+飘然出世 3 i
+飘然而至 3 i
+飘然而过 3 l
+飘瓦虚舟 3 i
+飘着雪 3 l
+飘移 14 v
+飘絮 3 n
+飘红 13 z
+飘缈 4 a
+飘自 3 v
+飘至 3 v
+飘舞 37 v
+飘舞着 3 l
+飘荡 194 v
+飘萍断梗 3 nr
+飘萍浪迹 3 nr
+飘落 109 v
+飘落在 3 z
+飘蓬 2 z
+飘蓬断梗 3 i
+飘走 3 v
+飘起 3 v
+飘起来 3 l
+飘过 3 v
+飘过去 3 l
+飘过来 3 l
+飘进 3 v
+飘远 3 d
+飘送 3 v
+飘逝 6 v
+飘逸 167 v
+飘雨 3 v
+飘雪 3 v
+飘零 56 z
+飘零书剑 3 i
+飘零水 3 i
+飘面 3 v
+飘风 18 v
+飘风急雨 3 i
+飘风暴雨 3 i
+飘风苦雨 3 i
+飘风过耳 3 l
+飘风骤雨 3 i
+飘飘 179 z
+飘飘忽忽 18 z
+飘飘悠悠 3 z
+飘飘扬扬 8 i
+飘飘摇摇 10 i
+飘飘欲仙 17 i
+飘飘洒洒 6 z
+飘飘然 50 z
+飘飘荡荡 3 z
+飘飞 25 v
+飘香 47 v
+飘香一剑 3 i
+飙 71 v
+飙举电至 3 v
+飙升 125 v
+飙发电举 3 v
+飙车 4 v
+飙车族 3 n
+飚 298 v
+飝 30 zg
+飞 9563 n
+飞上 3 n
+飞上了 3 l
+飞上去 3 v
+飞上来 3 v
+飞下 3 v
+飞下去 3 v
+飞下来 3 v
+飞中雪 3 nr
+飞临 3 v
+飞也似 3 nr
+飞也似地 3 i
+飞书 3 n
+飞云 39 n
+飞云制电 3 nz
+飞云掣电 3 l
+飞亚达 4 nz
+飞人 92 n
+飞低 3 v
+飞入 78 v
+飞兵 3 n
+飞出 3 v
+飞出去 3 v
+飞刀 286 n
+飞刍挽粒 3 v
+飞刍挽粟 3 nr
+飞刍挽粮 3 vn
+飞刍转饷 3 n
+飞利普 3 nr
+飞利浦 166 nz
+飞利浦公司 10 nt
+飞利浦电子中国集团 2 nt
+飞利蒲 3 nr
+飞到 3 v
+飞剑 4 n
+飞剪 10 v
+飞动 35 vn
+飞升 207 v
+飞升腾实 3 i
+飞去 263 v
+飞向 3 n
+飞吻 7 n
+飞回 3 v
+飞回去 3 i
+飞回来 3 l
+飞土逐害 3 i
+飞土逐肉 3 n
+飞地 29 n
+飞多高 3 nr
+飞天 160 n
+飞天奖 10 nz
+飞天梦 3 nz
+飞天猫 3 nr
+飞天舞 3 i
+飞夺 8 v
+飞奔 435 v
+飞奔而去 3 i
+飞奔而来 3 i
+飞宇 3 n
+飞宏 5 nz
+飞射 3 v
+飞将军 18 nr
+飞将数奇 3 n
+飞尘 3 n
+飞度 3 n
+飞康 9 nz
+飞廉草 3 nr
+飞弹 161 n
+飞弹头 3 n
+飞弹潜艇 3 n
+飞彩 7 n
+飞影 3 n
+飞往 256 v
+飞得 3 v
+飞快 317 v
+飞成 3 v
+飞扑 3 n
+飞扬 564 v
+飞扬浮躁 3 i
+飞扬跋扈 38 i
+飞报 3 n
+飞抵 71 v
+飞拓 2 v
+飞掠 25 v
+飞播 9 vn
+飞散 38 v
+飞文染翰 3 nz
+飞旋 19 n
+飞机 9091 n
+飞机制造 3 n
+飞机场 107 n
+飞机库 2 nz
+飞机故障 4 n
+飞机棚 3 n
+飞机票 46 n
+飞机翼 3 n
+飞机骨架 3 n
+飞来 391 v
+飞来峡 5 ns
+飞来峰 29 nr
+飞来横祸 11 i
+飞来石 3 nr
+飞来艳福 3 nr
+飞来飞去 3 i
+飞杨草 3 nr
+飞架 318 n
+飞标 4 n
+飞桥 19 n
+飞梭 16 nz
+飞檐 185 n
+飞檐翘角 5 n
+飞檐走壁 30 i
+飞檐走脊 3 n
+飞歌 3 n
+飞步 4 d
+飞殃走祸 3 i
+飞毛腿 46 n
+飞毯 4 n
+飞沙扬砾 3 n
+飞沙走石 40 n
+飞沙走砾 3 n
+飞沫 3 n
+飞沫传染 3 nr
+飞沿走壁 3 n
+飞泉 23 nz
+飞洒 6 v
+飞流 16 n
+飞流直下 7 i
+飞流直下三千尺 7 i
+飞流短长 3 z
+飞涌 2 nz
+飞涨 40 v
+飞渡 33 v
+飞湍 3 n
+飞溅 158 v
+飞瀑 75 n
+飞火流星 3 n
+飞灾 3 n
+飞灾横祸 2 i
+飞熊入梦 3 nz
+飞燕草 3 nr
+飞燕诺 3 nr
+飞狐 79 nz
+飞猫 3 n
+飞珠溅玉 5 nr
+飞球 3 n
+飞田 2 nz
+飞白 4 v
+飞盘 3 n
+飞直 3 d
+飞眼 2 n
+飞眼传情 3 n
+飞短流长 3 z
+飞石 36 n
+飞砂扬砾 3 n
+飞砂走石 15 n
+飞砂转石 3 n
+飞碟 98 n
+飞祸 3 n
+飞离 3 n
+飞禽 56 n
+飞禽走兽 33 i
+飞秒 2 n
+飞符 3 n
+飞箭 22 n
+飞米转刍 3 n
+飞粮挽秣 3 nr
+飞絮 13 n
+飞红 72 n
+飞经 3 d
+飞翔 393 nz
+飞翔网 3 nz
+飞翼 2 n
+飞腾 85 v
+飞至 3 v
+飞舞 585 n
+飞舟 2 nz
+飞航 13 v
+飞船 382 n
+飞艇 53 n
+飞花 22 n
+飞苍走黄 3 i
+飞英塔 4 nr
+飞落 3 v
+飞蓬随风 3 i
+飞虎 105 nz
+飞虎队 9 n
+飞虫 35 n
+飞虹 2 nz
+飞蚁 3 n
+飞蛾 48 n
+飞蛾扑火 11 i
+飞蛾投火 2 i
+飞蛾赴火 3 i
+飞蛾赴烛 3 i
+飞蛾赴焰 3 l
+飞蜂浪蝶 3 n
+飞蝇重珠 3 nz
+飞蝗 120 n
+飞行 4226 v
+飞行体 4 n
+飞行区 10 n
+飞行史 3 n
+飞行员 1110 n
+飞行器 393 n
+飞行团 13 n
+飞行士 3 n
+飞行官 3 n
+飞行家 3 n
+飞行帽 2 n
+飞行技术 3 n
+飞行数据 3 n
+飞行服 6 n
+飞行棋 3 n
+飞行物 5 n
+飞行轨道 3 n
+飞行速度 3 n
+飞行道具 3 n
+飞行队 43 n
+飞行高度 4 n
+飞觞走斝 3 v
+飞觥献斝 3 v
+飞觥走斝 3 v
+飞语 3 nz
+飞谋荐谤 3 n
+飞豹 30 nz
+飞贼 28 n
+飞赴 36 v
+飞起 3 v
+飞越 99 v
+飞跃 503 v
+飞跃发展 3 nz
+飞跃性 6 n
+飞跃成长 3 nz
+飞跑 94 v
+飞跨 3 v
+飞踢 3 i
+飞身 315 n
+飞车 33 n
+飞车党 3 n
+飞车走壁 3 i
+飞转 13 v
+飞轮 49 n
+飞轮海 3 nz
+飞达 4 nz
+飞过 252 v
+飞过去 3 v
+飞过来 3 l
+飞过海 3 nr
+飞返 7 v
+飞进 3 v
+飞进去 3 v
+飞进来 2 v
+飞逝 8 v
+飞速 303 n
+飞速上升 3 v
+飞速发展 3 nz
+飞遁离俗 3 nr
+飞遁鸣高 3 ns
+飞针走线 5 n
+飞镖 44 n
+飞阁流丹 3 n
+飞院 2 n
+飞雁 4 n
+飞雨 5 n
+飞雪 58 n
+飞雷 5 n
+飞霜六月 3 i
+飞靶 3 n
+飞音 3 n
+飞飞扬扬 3 i
+飞马 204 n
+飞驰 161 v
+飞驰而去 3 i
+飞驰而来 3 i
+飞驶 3 v
+飞骑 3 n
+飞鱼 80 n
+飞鸟 125 n
+飞鸟依人 3 i
+飞鸟惊蛇 3 i
+飞鸟集 3 n
+飞鸢 3 n
+飞鸣 2 v
+飞鸵 3 n
+飞鸽 11 n
+飞鸽传书 3 nz
+飞鸾翔凤 3 nr
+飞鸿 4 nr
+飞鸿印雪 3 nr
+飞鸿踏雪 3 nr
+飞鸿雪爪 3 nr
+飞鹰 22 nz
+飞鹰奔犬 3 nr
+飞鹰走犬 3 n
+飞鹰走狗 3 n
+飞鹰走马 3 n
+飞黄腾踏 3 z
+飞黄腾达 91 i
+飞鼠 8 n
+飞龙 96 nz
+飞龙乘云 3 i
+飞龙再生 3 i
+飞龙在天 18 i
+飞龙镇 9 nr
+食 6350 v
+食不下咽 18 l
+食不二味 3 l
+食不充口 3 l
+食不充肠 3 l
+食不充饥 3 l
+食不兼味 3 l
+食不兼肉 3 l
+食不厌精 9 i
+食不暇饱 3 i
+食不果腹 6 i
+食不求甘 3 v
+食不求饱 3 l
+食不甘味 15 l
+食不知味 2 l
+食不糊口 3 l
+食不累味 3 l
+食不终味 3 i
+食不裹腹 2 i
+食不遑味 3 vn
+食不重味 3 l
+食不重肉 3 l
+食不餬口 3 v
+食为天 3 l
+食为民天 3 l
+食亲财黑 3 l
+食人 3 n
+食人妖 3 n
+食人族 3 n
+食人花 3 n
+食人魔 3 n
+食人鱼 3 n
+食俸 3 n
+食全食 3 n
+食具 15 n
+食利者 9 n
+食前方丈 3 i
+食变星 8 n
+食口 3 n
+食古不化 3 l
+食古如鲠 3 n
+食味 2 n
+食味方丈 3 n
+食品 6610 n
+食品业 16 n
+食品业者 3 n
+食品保藏 3 n
+食品包装 3 n
+食品卫生 3 n
+食品厂 18 n
+食品商 3 n
+食品城 3 n
+食品安全 3 l
+食品容器 3 l
+食品工业 3 n
+食品市场 3 n
+食品店 13 n
+食品机械 3 n
+食品柜 3 n
+食品标签 3 n
+食品盒 14 n
+食品科学 3 l
+食品科技 3 n
+食品站 3 n
+食品类 7 n
+食品级 3 n
+食品网 3 n
+食品药品 3 n
+食品行业 3 n
+食品街 4 n
+食品袋 9 n
+食品论坛 3 n
+食品设备 3 n
+食品质量 3 n
+食品部 3 n
+食品铺 3 n
+食品饮料 3 n
+食器 3 n
+食坊 3 n
+食块 3 n
+食堂 660 n
+食子徇君 3 i
+食子蜂 3 n
+食客 96 n
+食宿 140 n
+食宿相兼 3 i
+食宿自理 3 n
+食宿费 13 n
+食寝 3 n
+食少事烦 2 l
+食少事繁 3 l
+食少便溏 5 l
+食府 11 n
+食心虫 15 n
+食必方丈 3 i
+食性 549 n
+食指 474 n
+食指大动 10 l
+食指浩繁 3 l
+食文化 6 n
+食斋 3 n
+食料 140 n
+食方于前 3 l
+食无求饱 3 i
+食既 3 i
+食日万钱 3 l
+食杂店 3 n
+食案方丈 3 n
+食槽 3 n
+食橱 3 n
+食欲 506 n
+食欲不佳 3 i
+食欲不振 68 l
+食毛践土 3 n
+食油 36 n
+食源性 6 n
+食火鸡 3 n
+食物 3368 n
+食物中毒 161 l
+食物嵌塞 3 n
+食物店 3 n
+食物残渣 3 n
+食物链 87 n
+食玉炊桂 3 v
+食甘寝宁 3 i
+食甘寝安 3 i
+食生不化 3 l
+食用 1836 n
+食用作物 3 n
+食用动物 3 n
+食用大黄 3 n
+食用方法 3 n
+食用植物 3 l
+食用油 48 n
+食用盐 3 n
+食用笋 3 n
+食用糖 3 n
+食用者 10 n
+食用菌 63 n
+食用菌类 3 n
+食用酒精 2 n
+食用量 7 n
+食用鱼 3 n
+食疗 82 n
+食疗方 3 n
+食盐 450 n
+食盐水 3 n
+食盒 64 n
+食相 2 n
+食神 3 n
+食禄 3 n
+食租衣税 3 n
+食积 16 n
+食窦 3 n
+食管 181 n
+食管炎 3 n
+食管癌 75 n
+食箪浆壶 3 n
+食篮 3 n
+食米 3 n
+食粮 105 n
+食糖 59 n
+食糜 24 n
+食者 32 n
+食而不化 3 l
+食肆 11 n
+食肉 143 n
+食肉兽 3 n
+食肉动物 3 l
+食肉寝皮 2 i
+食肉类 3 n
+食色性 3 n
+食色性也 3 i
+食茱萸 3 n
+食草 13 n
+食草兽 3 n
+食草动物 11 n
+食荚豌豆 3 nz
+食药监 3 n
+食荼卧棘 3 n
+食菌 3 n
+食藿悬鹑 3 nr
+食虫目 17 n
+食虫虻 3 n
+食蚁兽 31 n
+食蚊鱼 5 n
+食蚜蝇 3 n
+食衣住行 3 n
+食补 9 v
+食言 84 n
+食言而肥 12 i
+食谱 69 n
+食谱问题 3 n
+食货 3 n
+食货志 3 n
+食辨劳薪 3 n
+食道 86 n
+食道炎 2 n
+食道癌 33 n
+食邑 47 n
+食醋 26 n
+食量 64 n
+食饥息劳 3 i
+食饵 3 n
+食马留肝 3 n
+食髓知味 3 n
+飠 34 zg
+飤 2 zg
+飧 209 g
+飨 124 vg
+飨客 11 n
+飨宴 2 n
+飪 3 zg
+飲 10 zg
+飴 138 zg
+飼 4 zg
+餂 5 zg
+餍 46 g
+餐 627 n
+餐云卧石 3 i
+餐会 4 n
+餐具 145 n
+餐具柜 3 n
+餐刀 3 n
+餐券 4 n
+餐匙 3 n
+餐厅 667 n
+餐叉 3 n
+餐台椅 3 n
+餐室 17 n
+餐巾 21 n
+餐巾纸 15 n
+餐房 3 n
+餐松啖柏 3 nz
+餐松饮涧 3 n
+餐桌 300 n
+餐桌上 3 n
+餐桌椅 3 n
+餐椅 2 n
+餐点 2 n
+餐盒 11 n
+餐盘 8 n
+餐腥啄腐 3 vn
+餐葩饮露 3 nr
+餐费 25 n
+餐费票 3 n
+餐车 16 n
+餐霞吸露 3 i
+餐霞漱瀣 3 n
+餐霞饮景 3 i
+餐霞饮液 3 i
+餐霞饮瀣 3 i
+餐风咽露 3 n
+餐风啮雪 3 vn
+餐风宿水 3 n
+餐风宿草 3 n
+餐风宿雨 3 n
+餐风宿雪 3 n
+餐风宿露 3 i
+餐风沐雨 3 i
+餐风茹雪 3 i
+餐风露宿 3 i
+餐风饮露 3 i
+餐食 9 n
+餐饮 330 n
+餐饮业 41 n
+餐饮企业 3 n
+餐饮公司 3 n
+餐饮具 3 n
+餐饮店 13 n
+餐饮网 3 n
+餐饮行业 3 n
+餐饮费 2 n
+餐饮部 5 n
+餐馆 591 n
+餐馆老板 3 n
+餔糟啜漓 3 v
+餔糟啜醨 3 z
+餔糟歠醨 3 z
+餘 7 zg
+餝 38 zg
+餠 46 zg
+餢 308 zg
+餬 2 zg
+餬口 3 vn
+餮 52 x
+餽 2 zg
+餽赠 3 vn
+饄 28 zg
+饉 4 zg
+饔 271 g
+饔飧不济 3 v
+饔飧不给 3 v
+饔飧不继 3 v
+饔飧不饱 3 v
+饕 196 n
+饕口馋舌 3 v
+饕风虐雪 3 n
+饕餮 46 n
+饕餮之徒 5 i
+饘粥 3 v
+饛 7 zg
+饣 52 zg
+饤 2 n
+饥 385 n
+饥不择食 18 i
+饥不暇食 3 i
+饥不遑食 3 vn
+饥冻交切 3 i
+饥困 3 v
+饥寒 94 n
+饥寒交凑 3 i
+饥寒交切 3 i
+饥寒交加 3 i
+饥寒交至 3 i
+饥寒交迫 32 i
+饥民 357 n
+饥渴 118 n
+饥渴交攻 3 i
+饥渴症 3 i
+饥溺 3 n
+饥火烧肠 3 i
+饥焰中烧 3 i
+饥笑 3 n
+饥肠 16 n
+饥肠辘辘 39 l
+饥色 3 n
+饥荒 191 n
+饥附饱飏 3 n
+饥飡渴饮 3 i
+饥餐渴饮 10 i
+饥饱 3 n
+饥饱劳役 3 i
+饥饿 591 n
+饥饿感 9 n
+饥饿线 3 n
+饥馁 3 v
+饥馑 33 n
+饥馑荐臻 3 nr
+饥驱叩门 3 vn
+饥鹰饿虎 3 n
+饧 80 v
+饧糖 2 n
+饨 93 x
+饩 145 g
+饪 45 g
+饫 70 g
+饫甘餍肥 3 vn
+饫闻厌见 3 n
+饬 223 g
+饭 6331 n
+饭丸 3 n
+饭前 66 t
+饭前洗手 3 n
+饭匙 3 n
+饭卡 3 n
+饭厅 35 n
+饭后 243 t
+饭后漱口 3 n
+饭否 3 n
+饭囊 3 n
+饭囊衣架 3 n
+饭囊酒瓮 3 i
+饭囊酒甕 3 n
+饭团 33 n
+饭团子 3 n
+饭坑酒囊 3 n
+饭堂 47 n
+饭局 84 n
+饭岛爱 3 n
+饭岛直子 3 n
+饭庄 40 n
+饭店 1249 n
+饭店业 19 n
+饭时 59 t
+饭来开口 3 n
+饭来张口 21 n
+饭桌 232 n
+饭桶 37 n
+饭橱 3 n
+饭煲 2 n
+饭牛屠狗 3 n
+饭瓢 3 n
+饭田 3 n
+饭盆 3 n
+饭盒 117 n
+饭盖 3 n
+饭碗 425 n
+饭票 21 n
+饭筐 3 n
+饭筒 3 n
+饭篮 17 n
+饭米粒儿 3 n
+饭粒 16 n
+饭粝茹蔬 3 nr
+饭糗茹草 3 ns
+饭菜 702 n
+饭蔬饮水 3 i
+饭袋 3 n
+饭豆 3 n
+饭量 50 n
+饭钱 60 n
+饭铺 225 n
+饭锅 7 n
+饭食 69 n
+饭馆 242 n
+饭馆儿 2 n
+饭馆子 2 n
+饮 3189 n
+饮下 3 n
+饮冰 3 n
+饮冰内热 3 n
+饮冰吞檗 3 n
+饮冰茹 3 n
+饮冰茹蘗 3 ns
+饮冰食檗 3 n
+饮冰食蘖 3 n
+饮品 55 n
+饮子 8 n
+饮宴 212 n
+饮嶂箍 3 nz
+饮店 3 n
+饮弹 8 n
+饮弹自尽 3 i
+饮弹身亡 3 i
+饮恨 32 v
+饮恨吞声 3 i
+饮恨终生 3 i
+饮恨而终 3 l
+饮料 888 n
+饮料包装 3 n
+饮料厂 3 n
+饮料店 3 n
+饮料机 3 n
+饮料机械 3 n
+饮料水 3 n
+饮料瓶 4 n
+饮料类 3 n
+饮料罐 2 n
+饮既 3 i
+饮服 12 n
+饮气吞声 3 i
+饮水 162 n
+饮水啜菽 3 nr
+饮水器 3 n
+饮水困难 3 n
+饮水处 3 n
+饮水思源 8 n
+饮水思饮 3 n
+饮水曲肱 3 n
+饮水机 21 n
+饮水栖衡 3 l
+饮水池 3 n
+饮水知源 3 n
+饮水辨源 3 n
+饮水量 11 n
+饮水难 3 n
+饮水饱 3 n
+饮汤 3 n
+饮河满腹 3 i
+饮河鼹鼠 3 v
+饮泉清节 3 n
+饮泣 28 v
+饮泣吞声 3 i
+饮泪 3 n
+饮流怀源 3 l
+饮灰洗胃 3 n
+饮片 19 n
+饮牛 3 n
+饮犊上流 3 n
+饮用 369 n
+饮用水 105 n
+饮用水舱 3 n
+饮羽 3 n
+饮胆尝血 3 i
+饮茶 173 n
+饮血 3 n
+饮血崩心 3 i
+饮血茹毛 3 i
+饮誉 278 n
+饮谷栖丘 3 n
+饮酒 922 n
+饮酒作乐 3 n
+饮酒室 3 n
+饮酒者 11 n
+饮酒量 4 n
+饮酖止渴 3 n
+饮醇自醉 3 i
+饮露餐风 3 i
+饮风餐露 3 i
+饮食 1742 n
+饮食业 14 n
+饮食业者 3 n
+饮食习惯 3 n
+饮食卫生 3 n
+饮食店 36 n
+饮食文化 3 l
+饮食无味 3 l
+饮食无度 3 l
+饮食男女 12 l
+饮食疗法 11 n
+饮食结构 3 n
+饮食网 3 n
+饮食起居 41 l
+饮马 3 n
+饮马投钱 3 n
+饮马河 3 n
+饮马长江 4 n
+饮鸠止渴 3 i
+饮鸩止渴 15 i
+饮鸩解渴 3 i
+饯 20 v
+饯别 24 v
+饯行 107 v
+饯送 3 v
+饰 945 v
+饰以斑点 3 n
+饰件 14 n
+饰品 105 n
+饰品厂 3 n
+饰品店 3 n
+饰品网 3 n
+饰垢掩疵 3 i
+饰带 3 n
+饰怪装奇 3 v
+饰情矫行 3 vn
+饰智矜愚 3 nr
+饰演 203 n
+饰演者 7 n
+饰物 145 n
+饰终 3 v
+饰词 7 n
+饰辞 3 n
+饰过 3 v
+饰针 3 n
+饰钉 3 n
+饰非养过 3 n
+饰非拒谏 3 vn
+饰非掩丑 3 nz
+饰非掩过 3 nz
+饰非文过 3 n
+饰非遂过 3 n
+饰面 6 n
+饰面板 3 n
+饱 1587 a
+饱中枢 3 l
+饱享 3 v
+饱以 3 v
+饱以老拳 3 i
+饱历 3 v
+饱受 201 v
+饱受虚惊 3 i
+饱合 3 v
+饱含 103 v
+饱和 460 a
+饱和剂 3 n
+饱和压力 3 n
+饱和器 3 n
+饱和带 3 n
+饱和度 37 n
+饱和杂交 3 i
+饱和水汽 3 n
+饱和湿度 3 n
+饱和溶液 14 n
+饱和点 5 n
+饱和状态 3 l
+饱和电流 3 n
+饱和色 3 i
+饱和诱变 3 z
+饱和量 3 n
+饱嗝 18 v
+饱嗝儿 3 v
+饱嚐 3 vn
+饱学 3 n
+饱学之士 29 l
+饱尝 46 v
+饱暖 31 v
+饱暖思淫 3 i
+饱暖思淫欲 13 i
+饱汉不知饿汉饥 2 l
+饱满 221 v
+饱满度 2 l
+饱眼福 8 i
+饱练世故 3 i
+饱经 34 v
+饱经世变 3 i
+饱经世故 6 i
+饱经忧患 20 i
+饱经沧桑 18 i
+饱经霜雪 3 i
+饱经风雨 3 i
+饱经风霜 27 i
+饱胀 3 v
+饱腹 3 n
+饱蘸 6 v
+饱览 36 v
+饱读 3 v
+饱谙世故 3 l
+饱足 3 a
+饱食 46 v
+饱食暖衣 3 i
+饱食终日 13 i
+饱飨老拳 3 v
+饱餐 128 v
+饱餐一顿 3 i
+饱餐秀色 3 i
+饱饱 3 v
+饲 652 n
+饲主 3 v
+饲养 1099 v
+饲养业 40 n
+饲养员 29 n
+饲养场 12 n
+饲养室 19 n
+饲养所 3 n
+饲养标准 3 n
+饲养者 2 n
+饲养量 14 n
+饲喂 14 v
+饲料 612 n
+饲料作物 3 n
+饲料厂 17 n
+饲料原料 3 n
+饲料用 4 n
+饲料粮 3 n
+饲料行业 3 n
+饲料食物 3 n
+饲料鸡 3 n
+饲机 3 n
+饲槽 3 n
+饲用甜菜 3 v
+饲用谷物 3 n
+饲育 23 v
+饲草 37 n
+饲草料 3 n
+饴 19 n
+饴含抱孙 3 ns
+饴浆 3 n
+饴糖 272 n
+饵 681 n
+饵以重利 3 n
+饵名钓禄 3 nz
+饵敌 3 n
+饵料 132 n
+饵食 3 n
+饶 1659 v
+饶不饶 7 nr
+饶丝竹 3 nr
+饶乐水 3 nr
+饶乐郡 5 nr
+饶你狗 3 nr
+饶先生 5 nr
+饶勒斯 12 nr
+饶命 137 nr
+饶国华 2 nr
+饶头 3 v
+饶小弟 2 nr
+饶州窑 3 nr
+饶巧莲 2 nr
+饶平 2 nr
+饶平县 2 ns
+饶恕 118 nr
+饶是杨 2 nr
+饶有 55 v
+饶有兴味 11 l
+饶有兴致 22 l
+饶有兴趣 44 l
+饶有趣味 6 l
+饶有风趣 3 l
+饶毓泰 3 nr
+饶河 8 nr
+饶河县 2 ns
+饶漱石 44 nr
+饶舌 38 nr
+饶舌歌 3 v
+饶舌调唇 3 l
+饶让 3 v
+饶述一 3 nr
+饶阳 4 nr
+饶阳县 3 nr
+饶雪漫 3 nr
+饶风关 3 l
+饷 563 n
+饷客 3 n
+饷银 65 n
+饷餽 3 n
+饸 2 zg
+饹 7 zg
+饺 105 n
+饺子 378 n
+饺子城 5 n
+饺子宴 3 n
+饺子机 3 n
+饺子皮 5 n
+饺子馅 6 n
+饺子馆 5 n
+饼 1543 n
+饼乾店 3 v
+饼乾盒 3 r
+饼子 68 n
+饼屑 3 n
+饼干 202 n
+饼盒 3 n
+饼粕 3 n
+饼肥 2 n
+饼铛 3 n
+饼饵 4 n
+饼馅 3 n
+饽 41 n
+饽饽 72 n
+饾饤 2 n
+饿 1943 v
+饿不死 3 v
+饿倒 3 v
+饿坏 3 v
+饿惯 3 n
+饿极了 3 l
+饿死 721 v
+饿死事小 4 n
+饿死鬼 3 i
+饿殍 24 n
+饿殍枕藉 3 i
+饿殍满道 3 i
+饿殍载道 3 i
+饿殍遍野 4 i
+饿汉 3 n
+饿狗 3 n
+饿狼 104 n
+饿狼扑羊 3 l
+饿猫 3 n
+饿瘦 3 n
+饿着肚子 3 l
+饿着肚皮 3 l
+饿肚 3 v
+饿肚子 3 n
+饿肚皮 3 l
+饿莩载道 3 nz
+饿莩遍野 3 vn
+饿虎 3 n
+饿虎之蹊 3 i
+饿虎吞羊 3 i
+饿虎扑羊 4 i
+饿虎扑食 9 i
+饿虎擒羊 3 i
+饿过 3 v
+饿饭 6 v
+饿鬼 49 v
+馀 137 g
+馁 36 vg
+馂 5 zg
+馃 6 zg
+馄 91 zg
+馄饨 107 n
+馄饨面 3 z
+馄鹄 3 n
+馅 166 n
+馅儿 26 n
+馅儿饼 4 n
+馅心 13 n
+馅料 3 n
+馅饼 82 n
+馆 2024 ng
+馆主 5 n
+馆之宝 3 n
+馆使 3 n
+馆内 72 ns
+馆前 3 ns
+馆名 6 n
+馆员 51 n
+馆址 15 n
+馆外 3 n
+馆子 117 n
+馆牌 3 n
+馆舍 76 n
+馆藏 97 ns
+馆藏品 5 n
+馆邸 3 n
+馆里 63 ns
+馆长 207 n
+馆阁 3 n
+馆际互借 3 n
+馆陶 72 n
+馆陶县 10 ns
+馆驿 107 ns
+馇 18 x
+馈 122 v
+馈源 2 n
+馈电 3 vn
+馈线 3 n
+馈给 3 vn
+馈贫之粮 3 n
+馈赠 96 v
+馈赠礼品 3 n
+馈送 13 v
+馈遗 3 v
+馊 82 a
+馊主意 47 n
+馊味 3 n
+馊水 3 n
+馊水油 3 n
+馊臭 3 n
+馋 446 a
+馋嘴 21 n
+馋嘴巴 3 i
+馋涎 3 i
+馋涎欲滴 28 i
+馋猫 7 n
+馋猫子 3 i
+馋言 3 n
+馋鬼 4 n
+馍 348 n
+馍侠 3 n
+馍先 3 n
+馍馍 66 n
+馏 18 n
+馏出物 8 n
+馏分 42 n
+馏分油 9 n
+馏程 7 n
+馐 293 g
+馑 75 x
+馒 9 n
+馒头 810 n
+馒头山 2 n
+馒首 3 n
+馓 43 ng
+馓子 13 n
+馔 660 g
+馔具 3 i
+馔玉炊珠 3 nz
+馔玉炊金 3 vn
+馕 121 g
+首 8747 m
+首一 41 m
+首一个万 2 m
+首一名 7 m
+首一家 2 m
+首一席 2 m
+首一座 7 m
+首一张 6 m
+首一排 3 m
+首一条 6 m
+首一艘 2 m
+首一间 5 m
+首七 3 m
+首下 8 m
+首下尻高 3 z
+首丘之思 3 i
+首丘之情 3 n
+首丘夙愿 3 vn
+首两条 2 m
+首个 207 m
+首义 43 n
+首乌 24 n
+首乌藤 3 n
+首九 4 m
+首五 3 t
+首付 59 v
+首付款 17 n
+首代 14 t
+首件 2 m
+首任 186 n
+首份 13 m
+首位 1079 m
+首位城市 3 n
+首位度 3 n
+首位编码 3 n
+首体 2 n
+首例 90 n
+首信 5 n
+首倡 37 v
+首倡义举 3 n
+首倡者 14 n
+首先 9248 d
+首八名 2 m
+首册 3 m
+首几株 2 m
+首出 13 v
+首刀 8 m
+首分 2 m
+首列 5 m
+首则 8 n
+首创 503 n
+首创人 3 n
+首创精神 3 n
+首创者 16 n
+首创股份 17 nz
+首功 3 n
+首千遍 3 m
+首半晌 2 t
+首卷 3 m
+首发 331 d
+首发式 38 n
+首句 35 m
+首只 12 m
+首台 12 m
+首名 5 m
+首告 3 n
+首唱 3 n
+首唱义兵 3 n
+首善 6 v
+首善之区 4 n
+首善之地 3 i
+首四 4 m
+首四卷 2 m
+首四句 3 m
+首回 3 m
+首回合 3 i
+首因效应 3 n
+首场 148 n
+首堂 2 n
+首声 3 m
+首夜 3 t
+首天 2 t
+首夺 3 v
+首奖 3 n
+首套 7 m
+首字 11 n
+首字母 3 n
+首季 45 t
+首宗 3 m
+首家 151 m
+首富 85 n
+首对 3 d
+首封 3 m
+首尊 2 m
+首尔 3 d
+首尾 160 m
+首尾两端 3 n
+首尾共济 3 n
+首尾受敌 3 i
+首尾呼应 3 n
+首尾夹攻 3 i
+首尾相卫 3 n
+首尾相应 4 i
+首尾相接 3 i
+首尾相援 3 i
+首尾相继 3 i
+首尾相赴 3 i
+首尾相连 10 i
+首尾贯通 3 i
+首局 58 n
+首层 3 m
+首屈一指 87 i
+首届 524 m
+首岁 3 m
+首左右 2 m
+首师大 9 b
+首席 1201 n
+首席专家 3 l
+首席代表 3 n
+首席检查 3 n
+首席法官 3 n
+首席记者 3 n
+首年 7 t
+首应 3 n
+首府 870 n
+首度 116 n
+首度来台 3 ns
+首座 663 m
+首开 42 v
+首开纪录 3 n
+首张 18 m
+首当 3 d
+首当其冲 115 i
+首当其冲者 2 i
+首形码 3 n
+首恶 26 n
+首恶必办 3 i
+首战 51 n
+首战告捷 20 nz
+首户 6 n
+首所 2 n
+首批 781 m
+首把 2 m
+首招 2 m
+首排 2 m
+首推 3 b
+首播 136 vn
+首播仪式 3 n
+首播典礼 3 n
+首支 22 m
+首数 3 m
+首数十丈 2 m
+首方 6 n
+首施两端 3 i
+首旅 8 n
+首旅股份 11 nz
+首日 72 t
+首日封 9 m
+首映 22 v
+首映会 3 n
+首映典礼 3 n
+首映式 12 n
+首映礼 3 n
+首曲 3 n
+首月 3 t
+首服 4 n
+首期 87 t
+首期款 3 n
+首末 3 t
+首条 17 m
+首枚 10 m
+首架 89 m
+首次 3783 m
+首次放空 3 nz
+首次来台 3 nz
+首款 36 n
+首歌 88 n
+首歌曲 3 n
+首段 14 m
+首汽 2 n
+首波 3 n
+首演 180 n
+首犯 18 n
+首班 4 m
+首班车 3 n
+首盘 44 n
+首目 2 n
+首相 1058 d
+首相府 7 n
+首着 3 v
+首种 4 m
+首站 35 n
+首端 2 n
+首端过程 3 l
+首笔 3 m
+首第一 4 m
+首第一个 4 m
+首第一位 2 m
+首第一只 2 m
+首第一头 2 m
+首第一席 2 m
+首第一间 6 m
+首第二 2 m
+首第四 2 m
+首等 12 b
+首篇 7 m
+首粒 12 m
+首级 394 b
+首线 2 n
+首经贸 3 n
+首编码 3 n
+首群 2 m
+首肯 36 d
+首脑 1119 n
+首脑人物 3 n
+首脑份子 3 n
+首脑会 2 n
+首脑会晤 3 v
+首脑会议 3 n
+首脑机关 3 n
+首航 41 j
+首航日 3 n
+首舱 3 n
+首艘 35 m
+首节 32 t
+首行 2 n
+首要 954 b
+首要任务 3 n
+首要分子 3 n
+首要地位 3 n
+首要必备 3 n
+首要条件 3 n
+首规办字 3 n
+首规委 3 n
+首角 2 m
+首调 3 n
+首谋 3 n
+首谋者 3 n
+首起 5 m
+首趟 3 m
+首足异处 3 i
+首身分离 3 i
+首车 3 n
+首轮 354 m
+首轮影院 3 nt
+首轮电影 3 n
+首载 4 m
+首辅 1445 n
+首辆 10 m
+首迎式 2 n
+首选 377 v
+首选项 3 n
+首途 3 n
+首逢 3 v
+首道 30 n
+首邑 3 n
+首部 45 m
+首部曲 3 m
+首都 4278 d
+首都体育馆 3 nt
+首都儿科研究所 6 nt
+首都剧场 5 n
+首都北京 3 ns
+首都区 11 n
+首都医科大学 17 nt
+首都博物馆 3 ns
+首都国际机场 27 nt
+首都图书馆 2 nt
+首都在线 22 n
+首都师范大学 22 nt
+首都机场 107 n
+首都机场高速公路 3 nz
+首都经贸大学 5 nt
+首都钢铁公司 4 nt
+首里城 3 ns
+首重 11 m
+首金 3 n
+首钢 27 n
+首钢总公司 6 nt
+首钢队 12 nt
+首键 3 n
+首长 797 n
+首门 3 n
+首间 3 t
+首队 3 n
+首阳山 3 ns
+首陀罗 40 ns
+首集 3 n
+首需 3 n
+首面 3 n
+首页 2940 m
+首项 9 m
+首须 3 d
+首顿 2 m
+首领 1840 n
+首领蜂 3 n
+首颗 9 m
+首飞 3 v
+首饰 710 n
+首饰厂 3 n
+首饰店 9 n
+首饰盒 29 n
+首饰配件 3 n
+首魁 3 n
+首鼠两端 7 i
+首鼠模棱 3 n
+馗 28 g
+馘 7 g
+香 5826 ns
+香串 3 n
+香丸 3 n
+香主 198 n
+香云纱 3 nr
+香会 5 n
+香克利 2 ns
+香兰 178 ns
+香兰素 3 nr
+香军 3 n
+香农 13 nz
+香冢飞 2 nr
+香加皮 3 nr
+香包 10 n
+香化 3 ns
+香又烈 6 nr
+香口胶 6 n
+香台 3 ns
+香叶 11 n
+香叶冠 5 nr
+香叶油 2 n
+香叶醇 12 n
+香吻 3 n
+香味 561 n
+香味儿 14 nr
+香味喷鼻 3 i
+香味扑鼻 3 i
+香唇 3 n
+香喷喷 80 z
+香囊 27 n
+香园绣 2 nr
+香坊 3 ns
+香坊区 3 ns
+香坛 3 n
+香型 24 n
+香培玉琢 3 nr
+香堂 4 ns
+香墨 2 ns
+香奈儿 3 nr
+香奈尔 9 nr
+香娇玉嫩 3 nr
+香嫩 4 ns
+香客 85 n
+香小筑 3 nr
+香山 418 ns
+香山县 6 ns
+香山寺 5 ns
+香山路 7 ns
+香岛 3 ns
+香川 4 ns
+香巢 3 n
+香巴拉 3 ns
+香币 3 n
+香帅奏 2 nr
+香干 5 ns
+香庐 31 ns
+香扑扑 3 z
+香料 539 n
+香料厂 3 n
+香料商 3 n
+香料店 3 n
+香料群岛 3 ns
+香日德镇 2 ns
+香木 8 ns
+香林 4 ns
+香果 2 n
+香果脂 3 ns
+香柏 6 ns
+香柚 3 n
+香树科 2 nr
+香格里拉 42 nrt
+香格里拉县 3 ns
+香格里拉酒店 2 ns
+香案 113 n
+香桌儿 11 nr
+香桩 3 n
+香椿 23 nr
+香椿头 3 nr
+香椿树 6 nr
+香椿芽 5 nr
+香榧 20 n
+香榧子 3 v
+香榭 14 ns
+香榭丽舍 20 nr
+香榭丽舍大街 7 ns
+香榭里 3 ns
+香槟 116 n
+香槟色 3 n
+香槟酒 69 n
+香槟金 3 n
+香樟 16 ns
+香橙 4 nr
+香橼 5 nr
+香殿 7 ns
+香气 432 n
+香气扑鼻 24 l
+香水 220 ns
+香水味 3 n
+香水品牌 3 n
+香水梨 2 nr
+香水瓶 3 n
+香汗 3 ns
+香江 27 ns
+香江明珠 3 nr
+香汤 3 n
+香河 74 ns
+香河县 18 ns
+香河园 2 ns
+香油 110 n
+香油钱 3 n
+香泉 10 ns
+香波 11 ns
+香泽 11 ns
+香洲 8 ns
+香洲区 8 ns
+香浓 5 nr
+香浦 2 ns
+香消玉 5 nr
+香消玉减 3 i
+香消玉损 3 nr
+香消玉殒 9 i
+香消玉碎 3 i
+香液 3 n
+香港 8044 ns
+香港三联书店 2 nt
+香港上海汇丰银行有限公司 5 nt
+香港中华总商会 2 nt
+香港中文 3 nz
+香港中文大学 62 nt
+香港入境事务处 2 nt
+香港入境处 3 nt
+香港凤凰卫视 5 nz
+香港厅 3 nt
+香港商标 3 n
+香港回归 3 ns
+香港地区 41 ns
+香港城 3 ns
+香港城市大学 21 nt
+香港基本法 3 nz
+香港大学 95 nt
+香港媒体 3 nt
+香港岛 39 ns
+香港市民 3 ns
+香港廉政公署 11 nt
+香港彩 3 nz
+香港政府 10 nt
+香港旅游 3 nz
+香港旅游协会 2 nt
+香港机场 3 ns
+香港海关 11 ns
+香港浸会 3 n
+香港浸会大学 15 n
+香港游 6 ns
+香港湾区 3 ns
+香港特别行政区 153 nt
+香港特别行政区基本法起草委员会 7 nt
+香港特别行政区政府 4 nt
+香港特区 170 ns
+香港特区政府 18 nt
+香港理工大学 26 nt
+香港电台 3 nt
+香港电影 3 n
+香港电视广播有限公司 2 nt
+香港科技大学 22 nt
+香港立法会 2 nt
+香港站 4 nt
+香港网 3 nz
+香港联交所 11 nt
+香港股市 3 n
+香港脚 3 ns
+香港艺人 3 n
+香港艺术馆 2 nt
+香港证券交易所 3 nt
+香港贸发局 2 nt
+香港贸易发展局 2 nt
+香港邮报 3 nt
+香港金融管理局 3 nt
+香港队 5 nt
+香港黄金 3 n
+香源堂 2 nr
+香溪 9 ns
+香溪宽 2 nr
+香溪洞 3 nr
+香火 225 n
+香火不断 3 l
+香火不绝 3 i
+香火因缘 3 nr
+香火姻缘 3 n
+香火很盛 3 nr
+香火钱 3 n
+香灰 18 n
+香灼 2 z
+香炉 259 n
+香炉灰 3 n
+香烛 74 n
+香烟 505 n
+香烟头 3 n
+香烟盒 6 n
+香烟盒纸 2 n
+香烧鸡 3 ns
+香熏 16 nr
+香片 13 n
+香獐子 2 n
+香球 3 n
+香瓜 17 ns
+香瓜汁 3 nr
+香甜 138 nr
+香甜可口 3 nr
+香皁 3 z
+香皂 47 n
+香皂盒 3 n
+香盒 3 n
+香石竹 3 nr
+香砂 2 n
+香科 7 ns
+香积 2 n
+香积厨 3 n
+香积寺 2 nr
+香税银 3 nz
+香稻 5 n
+香米 8 n
+香粉 12 n
+香粉盒 3 n
+香粳 5 n
+香精 242 n
+香精油 3 n
+香精香料 3 nz
+香纸 5 n
+香罗 3 ns
+香肉 3 n
+香肠 108 n
+香胰子 2 n
+香脂 12 ns
+香脆 12 a
+香脖 3 n
+香腮 3 n
+香膏 3 n
+香臭 3 n
+香舌 3 n
+香艳 25 nr
+香艳小说 3 l
+香芋 11 n
+香花 36 n
+香花供养 3 n
+香花毒草 3 n
+香花镇 3 ns
+香芹 3 nr
+香芹菜 3 nr
+香茅 43 ns
+香茅油 5 n
+香茅草 5 nr
+香茶 3 n
+香草 84 n
+香草冰 3 nr
+香草美人 3 nr
+香草醇 2 nr
+香草醛 3 nz
+香药脆梅 3 l
+香菇 174 n
+香菊片 2 nz
+香菌 8 n
+香菜 34 n
+香菱 171 nz
+香菸 3 z
+香葱 5 n
+香蒲 21 nrt
+香蒿 3 nr
+香蕈 11 n
+香蕉 526 n
+香蕉冰 3 nr
+香蕉叶 3 nr
+香蕉园 2 nr
+香蕉林 5 nr
+香蕉水 3 nr
+香蕉油 3 n
+香蕉皮 3 nr
+香蕉苹果 4 nr
+香蕉键 3 nr
+香薰 10 nr
+香薰油 4 nr
+香薷 12 n
+香蜡 3 n
+香蜡店 3 n
+香袋 24 n
+香豆素 18 nr
+香豌豆 3 n
+香豌豆花 3 nz
+香象渡河 3 ns
+香象绝流 3 l
+香车 3 n
+香车宝马 3 ns
+香车美人 3 n
+香轮宝骑 3 n
+香辛料 2 nr
+香辣 265 z
+香辣虾 3 nr
+香辣蟹 3 n
+香都 2 ns
+香酒 3 n
+香酥 4 n
+香酥可口 3 n
+香酥鸡 5 n
+香醇 30 n
+香醇美味 3 nz
+香醋 14 nz
+香钱 3 n
+香销玉沉 3 i
+香闺 3 n
+香闺绣阁 3 i
+香阁 31 ns
+香附 3 nrt
+香附子 8 n
+香院 6 n
+香雪 3 n
+香雪厅 8 nr
+香露刀 2 nr
+香风 4 n
+香饵 21 n
+香饼 3 n
+香饽饽 3 n
+香香 70 nr
+香香公主 95 nr
+香香甜甜 3 nr
+香香的 8 z
+香香酥酥 3 z
+香馥馥 4 nr
+香魂女 2 n
+香鱼 5 n
+香鸡城 3 ns
+馥 25 ag
+馥郁 49 z
+馨 161 ng
+馨心 3 n
+馨著 3 n
+馨香 32 n
+馨香祷祝 3 n
+馷 374 zg
+馿 4 zg
+駁 4 zg
+駃 2 zg
+駇 74 zg
+駉 2 zg
+駔 2 zg
+駕 7 zg
+駛 16 zg
+駤 2 zg
+駬 2 zg
+駮 3 zg
+駰 3 zg
+駹 14 zg
+騂 2 zg
+騃 2 zg
+騃女痴男 3 nr
+騃童钝夫 3 v
+騄 14 zg
+騊 2 zg
+騍 15 zg
+騑 3 zg
+騕 4 zg
+騗 160 zg
+騟 7 zg
+騠 10 zg
+騢 2 zg
+騰 4 zg
+騺鹰 3 nz
+驍 3 zg
+驎 38 zg
+驩 5 zg
+驫 13 zg
+马 19918 n
+马一人 2 nr
+马一勒 3 nr
+马一合 2 nr
+马一奔 2 nr
+马一青 2 nr
+马丁 437 nr
+马丁任 2 nr
+马丁内斯 70 ns
+马丁啉 2 nr
+马丁尼 2 nr
+马丁工 4 nr
+马丁抢 4 nr
+马丁换 2 nr
+马丁斯 14 nr
+马丁新 2 nr
+马丁炉 8 nr
+马丁路德 3 ns
+马丁跳 2 nr
+马万勇 2 nr
+马万祺 20 nr
+马三俊 234 nr
+马三保 11 nr
+马三卫 13 nr
+马三娘 6 nr
+马三婆 77 nr
+马三嫂 9 nr
+马三立 3 nr
+马三舅 2 nr
+马上 2306 d
+马上会 4 nr
+马上传 2 nr
+马上先 2 nr
+马上功成 3 nr
+马上发 4 nr
+马上吟 3 nr
+马上坡 2 nr
+马上墙头 3 i
+马上开 3 nr
+马上得天下 17 i
+马上心 2 nr
+马上悟 2 nr
+马上房子 3 nr
+马上拉 4 nr
+马上摇 2 nr
+马上望 2 nr
+马上正 2 nr
+马上治 6 nr
+马上直 2 nr
+马上看花 3 i
+马上笑 4 nr
+马上观 2 nr
+马上谓 3 nr
+马上转 2 nr
+马上连 2 nr
+马上遥 5 nr
+马上锁 2 nr
+马上风 3 nr
+马上飞 2 nr
+马上马 2 nr
+马不停蹄 128 i
+马不解鞍 3 n
+马与齐 6 nr
+马世祥 3 nr
+马世耀 116 nr
+马世龙 7 nr
+马丘比丘 14 ns
+马东 9 ns
+马中关五 3 nr
+马中欣 3 nr
+马中箭 2 nr
+马中赤 2 nr
+马中足 2 nr
+马中锡 9 nr
+马丹阳 3 nr
+马丹风 6 nr
+马主 2 n
+马丽华 8 nr
+马丽恩 2 nr
+马丽特 2 nr
+马之劳 2 nr
+马之域 2 nr
+马之庚 3 nr
+马之战 3 nr
+马之法 2 nr
+马也拉 5 nr
+马二世 11 nr
+马二哥 6 nr
+马二拴 20 nr
+马二马 2 nr
+马云鹤 20 nr
+马五哥 5 nr
+马五子 12 nr
+马五德 14 nr
+马五爷 2 nr
+马亚 48 ns
+马亚圭 2 nr
+马亚科 2 nr
+马亨德 2 nr
+马亨祖 4 nr
+马享佐 15 nr
+马什 30 nrt
+马什伯格 2 nrt
+马什哈德 18 nrt
+马从云 12 nr
+马代拉 4 nr
+马令旨 2 nr
+马仰人翻 2 i
+马任加 5 nr
+马伊俐 3 nr
+马伊利 3 nr
+马伊堪 98 nr
+马伏里 2 nr
+马伟明 2 nr
+马伦戈 2 nr
+马伯乐 2 nr
+马佐夫 13 nr
+马佐维 5 nr
+马佐维耶茨基 2 nrt
+马佑 3 nrfg
+马体 2 n
+马便冲 2 nr
+马俊仁 8 nr
+马俊如 2 nr
+马俊峰 2 nr
+马俊潼 4 nr
+马保平 4 nr
+马修斯 9 nr
+马倌 4 n
+马偕医院 3 nr
+马偕尔 2 nr
+马偕纪念 3 nr
+马健翎 5 nr
+马傅颜 2 nr
+马儿 115 nr
+马儿快 3 nr
+马儿罕 4 nr
+马儿跑 3 ns
+马元 10 q
+马元义 5 nr
+马元利 87 nr
+马元安 3 nr
+马兄弟 5 nr
+马先入 2 nr
+马先生 7 nr
+马先蒿 4 nr
+马光义 2 nr
+马光佐 141 nr
+马克 491 nr
+马克吐温 3 nr
+马克图姆 3 nrt
+马克坚 2 nr
+马克坦 3 nr
+马克尔 2 nr
+马克尼 3 nr
+马克思 983 nr
+马克思主义 2759 n
+马克思主义者 126 n
+马克思列 3 nr
+马克思列宁主义 461 ns
+马克思列宁主义者 7 n
+马克斯 57 nr
+马克杯 3 nr
+马克沁 15 nr
+马克笔 3 nr
+马克苏德 4 nrt
+马克萨 4 nr
+马克西 5 nr
+马克西姆 5 nrt
+马克西米 4 nrt
+马克西米利安 6 ns
+马克西莫夫 7 nrt
+马克西马 3 ns
+马克辛 3 nr
+马克里 17 nr
+马兜铃 8 n
+马入华山 3 nr
+马入城 4 nr
+马全智 9 nr
+马八儿 9 nr
+马公 15 nr
+马公子 28 nr
+马公市 5 ns
+马公港 8 nr
+马公至 2 nr
+马公镇 3 nr
+马六儿 7 nr
+马六河 43 nr
+马六甲 97 nr
+马六甲海峡 131 ns
+马兰 112 nr
+马兰士 3 nr
+马兰头 3 nr
+马兰峪 70 nr
+马兰巴 9 nr
+马兰帕 2 nr
+马兰村 3 nr
+马兰花 20 nr
+马兰草 6 nr
+马关 47 ns
+马关县 3 ns
+马关条约 98 ns
+马其诺 11 nr
+马其顿 443 nr
+马其顿人 28 i
+马其顿共和国 3 ns
+马具 39 n
+马兹达 3 nr
+马兹鲁 2 nr
+马内奇 9 nr
+马内斯 2 nr
+马再战 3 nr
+马军先 3 nr
+马军勤 3 nr
+马军司 10 nr
+马军寨 3 nr
+马军拴 2 nr
+马军放 2 nr
+马军来 2 nr
+马军步 4 nr
+马军随 2 nr
+马军齐 2 nr
+马冲进 2 nrfg
+马凌汉 2 nr
+马凤仪 2 nr
+马出城 2 nr
+马出林 2 nr
+马刀 200 nr
+马分尸 4 n
+马切洛 2 nr
+马切纳 2 nr
+马列 102 q
+马列主义 360 n
+马列著作 3 n
+马刘丘 4 nr
+马利亚 21 ns
+马利克 13 nr
+马利兰 5 nr
+马利兰州 3 ns
+马利列 6 ns
+马利市 3 ns
+马利斯 4 nr
+马利沃 2 nr
+马利涅 6 nr
+马利皮 3 nr
+马利筋 4 nr
+马利翁 6 nr
+马利肯 7 nr
+马利诺夫斯基 3 nrt
+马到功成 3 i
+马到成功 313 i
+马制 3 n
+马刺 460 nr
+马刺进 2 nr
+马刺队 3 n
+马剌丁 2 nr
+马前冲 2 nr
+马前卒 19 nr
+马前小卒 3 nr
+马前泼水 2 nr
+马前率子 3 nr
+马前足 4 nr
+马前马 3 nr
+马前驰 2 nr
+马力 446 n
+马力克 2 nr
+马加丹 3 nr
+马加尔 3 nr
+马加比 2 ns
+马加特 17 nr
+马努斯 2 nr
+马努蒂 3 nr
+马努金 2 nr
+马勃菌 4 nr
+马勒 56 nr
+马勒山 2 nr
+马勒库 2 nr
+马勺 82 nr
+马勺全 4 nr
+马勺娃 4 nr
+马勺舀 2 nr
+马化腾 18 nr
+马化龙 3 nr
+马匹 727 nr
+马千乘 2 nr
+马华山 2 ns
+马南 2 ns
+马南蒂 2 nr
+马南雅 2 nr
+马博仁 15 nr
+马博兰 2 nr
+马占山 7 nr
+马占鳌 2 nr
+马卡尔 4 nr
+马卡洛 5 nr
+马卡瓜 2 nr
+马卡科 3 nr
+马卡罗 2 nr
+马卡罗夫 12 nrt
+马卡良 9 nr
+马卡萨 3 nr
+马卡连 2 nr
+马卡连柯 2 nr
+马卡迪 3 nr
+马卡鲁峰 5 nr
+马厂 22 n
+马厂塬 2 nr
+马原 2 ns
+马原路 2 nr
+马原野 4 nr
+马厩 63 n
+马去马归 3 i
+马友友 11 nr
+马双雕 2 nr
+马变龙 3 nr
+马叙伦 38 nr
+马口 269 ns
+马口铁 7 nr
+马可尼 62 nr
+马可波 11 nr
+马可波罗 3 nr
+马可福音 3 nr
+马台国 6 ns
+马号 101 n
+马司 12 n
+马司主 3 nr
+马合木 4 nr
+马合答 3 nr
+马吉德 9 nr
+马吉良 3 nr
+马后 3 nr
+马后炮 11 nr
+马向东 8 nr
+马向前 7 nr
+马向北 15 nr
+马向南 4 nr
+马向西 13 nr
+马吕斯 7 nr
+马君武 8 nr
+马启智 3 nr
+马命风 4 nr
+马和狗 2 nr
+马和红 2 nr
+马哈 11 nr
+马哈努 2 nr
+马哈吉 3 nr
+马哈坎 2 nr
+马哈尔 2 nr
+马哈拉 2 nr
+马哈拉施特拉 6 nrt
+马哈拉施特拉邦 9 ns
+马哈木 64 nr
+马哈茂德 15 nrt
+马哈蒂 2 nr
+马哈蒂尔 8 nrt
+马哈迪 3 nr
+马哈金 2 nr
+马哲史 3 nr
+马善均 33 nr
+马嘉理 13 nr
+马嘶 80 n
+马嘶人 5 nr
+马嘶声 5 nr
+马嘶鸣 5 nr
+马嚼子 4 n
+马四膝 2 nr
+马回寨 5 nr
+马回营 4 nr
+马围 2 n
+马国 2 ns
+马国平 6 nr
+马国明 3 nr
+马国翰 9 nr
+马国雄 32 nr
+马图拉 6 nr
+马图林 2 nr
+马图里 3 nr
+马圈城 3 nr
+马圈湾 7 nr
+马圭 2 ns
+马圭省 2 ns
+马地臣 7 nr
+马场 295 n
+马均须 2 nr
+马坊 3 ns
+马坑 13 ns
+马坝人 16 n
+马坦巴 2 nr
+马坦萨斯 2 ns
+马坪相 2 nr
+马坪里 3 nr
+马埃 6 ns
+马埃岛 8 nr
+马埃斯 7 nr
+马城 3 ns
+马城西 2 ns
+马基亚 3 nr
+马基延 4 nr
+马基拉 2 nr
+马基维利 3 ns
+马基雅 22 nr
+马堡 7 ns
+马堡病毒 3 n
+马塔乌 4 nr
+马塔夫 5 nr
+马塔帕 7 nr
+马塔武 2 nr
+马塔潘角 2 nr
+马塔贝 9 nr
+马塔迪 9 nr
+马塘区 3 ns
+马塘村 3 nr
+马塞克 3 nr
+马塞利 3 nr
+马塞卢 9 nr
+马塞塔 3 nr
+马塞奥 5 nr
+马塞尔 7 nr
+马塞拉 3 nr
+马塞诸塞 3 nr
+马塞道 2 nr
+马塞里 3 nr
+马增芬 5 nr
+马士基 15 nr
+马士英 401 nr
+马士著 2 nr
+马壮人强 3 nr
+马复初 2 nr
+马多尔 2 nr
+马大中 15 nr
+马大人 3 nr
+马大元 28 nr
+马大呼 2 nr
+马大哈 3 nr
+马大哥 39 nr
+马大夫 2 nr
+马大姐 3 nr
+马大帅 2 nr
+马大挺 14 nr
+马大爷 3 nr
+马大猷 3 nr
+马大鸣 17 nr
+马天放 3 nr
+马太 28 nr
+马太后 6 nr
+马太宁 4 nr
+马太效应 3 n
+马太福音 3 nr
+马夫 443 nr
+马夫人 22 nr
+马夫罗季 2 nr
+马央宗 7 nr
+马失前蹄 15 i
+马头 462 n
+马头墙 3 nr
+马头山 4 ns
+马头琴 23 nr
+马头镇 2 nr
+马头鱼 3 nr
+马奇诺 17 nr
+马奉操 2 nr
+马奎兹 6 nr
+马奎斯 3 nr
+马契雷 3 nr
+马奔泉 3 nr
+马奔腾 3 nr
+马奔行 2 nr
+马奔西 2 ns
+马奶 20 n
+马奶子 5 nr
+马奶酒 18 nr
+马如流水 3 i
+马如游 2 nr
+马如游鱼 3 l
+马如游龙 3 nr
+马如箭 3 nr
+马如风 3 nr
+马如飞 7 nr
+马如龙 14 nr
+马姆斯 4 nr
+马婉容 3 nr
+马子 21 nr
+马子充 29 nr
+马子禄 3 nr
+马孔多 3 nr
+马孔德 2 nr
+马孟起 5 nr
+马季华 4 nr
+马季诺 5 nr
+马宁蒂 2 nr
+马守应 3 nr
+马守贞 2 nr
+马安澜 2 nr
+马宗汉 4 nr
+马宗素 2 nr
+马宗达 2 nr
+马宝玉 3 nr
+马宣赞 52 nr
+马家军 3 nr
+马家堡 4 nr
+马家寨 13 nr
+马家庄 28 nr
+马家棚 256 nr
+马家渡 2 nr
+马家爵 3 nr
+马家窑 27 nr
+马家骏 32 nr
+马寅初 21 nr
+马富生 3 nr
+马寨主 4 nr
+马导 7 n
+马小军 5 nr
+马小林 6 nr
+马小柱 6 nr
+马小玲 3 nr
+马小舍 7 nr
+马小跳 3 nr
+马少爷 7 nr
+马尔他 5 ns
+马尔代夫 114 nrt
+马尔代夫共和国 2 ns
+马尔伯 5 nr
+马尔克 19 nr
+马尔克斯 12 nrt
+马尔凯 4 nr
+马尔切 5 nr
+马尔加 7 nr
+马尔卡 5 nr
+马尔可 33 nr
+马尔可夫 2 nr
+马尔吉 11 nr
+马尔基 10 nr
+马尔堡 17 nr
+马尔塔 2 nr
+马尔奈 3 nr
+马尔尚 5 nr
+马尔山 4 nr
+马尔巴 3 nr
+马尔库 6 nr
+马尔库塞 3 nrt
+马尔库斯 2 nrt
+马尔康 8 nr
+马尔康县 8 ns
+马尔廷 2 nr
+马尔戈 3 nr
+马尔扎 2 nr
+马尔托 6 nr
+马尔文 2 nr
+马尔斯 11 nr
+马尔林 2 nr
+马尔法 2 nr
+马尔泰 10 nr
+马尔滕 4 nr
+马尔特 2 nr
+马尔瓦 10 nr
+马尔科 10 nr
+马尔科夫 14 nrt
+马尔科维奇 4 nrt
+马尔索 5 nr
+马尔维 2 nr
+马尔维纳斯 17 nrt
+马尔维纳斯群岛 29 ns
+马尔罗 11 nr
+马尔菲 4 nr
+马尔萨斯 71 nrt
+马尔蒂 3 nr
+马尔蒂尼 8 nrt
+马尔诺 4 nr
+马尔迪 9 nr
+马尔逊 2 nr
+马尔马 26 nr
+马尔默 21 nr
+马尘不及 3 i
+马尼亚 22 ns
+马尼克 4 nr
+马尼切 3 nr
+马尼卡 2 nr
+马尼哈 3 nr
+马尼图 4 nr
+马尼尔 2 nr
+马尼山 2 ns
+马尼干戈 3 ns
+马尼托巴 7 nrt
+马尼托巴省 7 ns
+马尼拉 166 nr
+马尼拉市 3 ns
+马尼拉湾 8 ns
+马尼拉麻 10 nr
+马尼格 4 nr
+马尼科 2 nr
+马尾 150 nrt
+马尾区 3 n
+马尾松 347 nr
+马尾藻 36 nr
+马尾辫 5 n
+马尾黄连 3 nr
+马尿酸 4 n
+马屁 111 nr
+马屁大 3 nr
+马屁大王 3 nr
+马屁拍 7 nr
+马屁精 24 nr
+马屁股 11 nr
+马屁鬼 2 nr
+马山 66 ns
+马山县 2 ns
+马岛 124 ns
+马岭 5 ns
+马岭河 8 nr
+马岱 124 nrfg
+马峰北 2 ns
+马崇乐 3 nr
+马嵬驿 8 ns
+马川 16 ns
+马工枚速 3 n
+马巨贤 12 nr
+马已冲 2 nr
+马已驰 2 nr
+马巴赫 3 nr
+马币 12 n
+马市 24 ns
+马布利 2 nr
+马布埃 4 nr
+马布里 4 nr
+马师伯 8 nr
+马师兄 5 nr
+马希尔 3 nr
+马帮 42 nr
+马库斯 4 nr
+马库罗 3 nr
+马应珊 2 nrfg
+马应龙 5 nr
+马店 5 ns
+马府尹 2 nr
+马康南 2 nr
+马廉 2 nrt
+马廉访 29 nr
+马廷宝 5 nr
+马廷英 2 nr
+马廷鸾 5 nr
+马建军 3 nr
+马建华 2 nr
+马建国 3 ns
+马建堂 2 nr
+马建忠 7 nr
+马开贤 2 nr
+马弁 39 nr
+马引军 4 nr
+马弗拉 7 nr
+马弗炉 3 nr
+马当 6 d
+马形铜 2 nr
+马彦祥 3 nr
+马彦超 47 nr
+马径 2 n
+马径奔 2 nr
+马律 9 n
+马得泰 5 nr
+马御史 4 nr
+马德仁 2 nr
+马德伦 2 nr
+马德克 3 nr
+马德兴 3 nr
+马德吉 2 nr
+马德堡 8 nr
+马德拉 33 nr
+马德拉斯 59 nrt
+马德普拉塔 13 nrt
+马德望 10 nr
+马德望省 5 ns
+马德海 9 nr
+马德禄 2 nr
+马德罗 12 nr
+马德莱 2 nr
+马德里 239 nr
+马德里队 3 nr
+马德钟 3 nr
+马德雷 27 nr
+马志尼 16 nr
+马志平 3 nr
+马志明 4 nr
+马志涛 7 nr
+马志达 6 nr
+马忠入 2 nr
+马忠引 3 nr
+马忠臣 3 nr
+马快 3 d
+马忽喇 2 nr
+马忽思 2 nr
+马思宇 24 nr
+马思忠 2 nr
+马思答 2 nr
+马思聪 10 nr
+马思远 3 nr
+马总兵 9 nr
+马恒昌 24 nr
+马恩列 5 nr
+马恩列斯 3 nrt
+马恩华 3 nr
+马恩岛 2 nr
+马恩河 18 nr
+马戏 28 n
+马戏团 41 nt
+马戏团表 3 n
+马戏场 3 n
+马戏演员 3 n
+马戏班 3 n
+马戏篷 3 n
+马戏节 2 n
+马戏节目 3 n
+马戏表演 3 n
+马成全 3 nr
+马成群 3 nr
+马战 12 nz
+马房 9 n
+马扎 76 nr
+马扎罗 7 nr
+马扎里沙里夫 3 nrt
+马打蓝 8 nr
+马托格罗索 8 nrt
+马托格罗索州 2 ns
+马扬巴 6 nr
+马承宣 2 nr
+马承源 2 nr
+马投唐 2 nr
+马拉 116 nr
+马拉之 4 nr
+马拉亚 3 ns
+马拉加 24 nr
+马拉加西 3 ns
+马拉博 7 nr
+马拉卡 4 nr
+马拉喀什 16 ns
+马拉地 3 ns
+马拉基 2 nr
+马拉塔 15 nr
+马拉多纳 16 nrt
+马拉威 3 nr
+马拉尼 10 nr
+马拉巴尔 11 nrt
+马拉干 3 nr
+马拉开波 23 nr
+马拉开波湖 26 ns
+马拉德 3 nr
+马拉松 80 nr
+马拉松式 7 nr
+马拉松赛 11 nr
+马拉梅 10 nr
+马拉河 4 ns
+马拉海 16 ns
+马拉特 38 nr
+马拉硫磷 4 nz
+马拉维 87 nr
+马拉维湖 30 ns
+马拉美 3 nr
+马拉若岛 8 nr
+马拉语 6 nr
+马拉进 2 nr
+马拉迪 5 nr
+马拉雅 2 nr
+马拉雅兰 3 ns
+马挥刀 2 n
+马振岗 2 nr
+马振抚 5 nr
+马振海 6 nr
+马挺戟 3 nr
+马挺枪 13 nr
+马挺矛 2 nr
+马捉老鼠 3 i
+马掌 14 nr
+马掌柜 2 nr
+马提亚 13 nr
+马提刀 2 nr
+马提尼克 30 nrt
+马提尼克岛 19 ns
+马提尼酒 3 nr
+马摇铃 2 nr
+马撒 18 nrt
+马放南山 3 ns
+马放鹰 2 nr
+马政考 2 nr
+马敬侠 24 nr
+马数依 3 nr
+马文升 20 nr
+马文彪 4 nr
+马文忠 17 nr
+马文昭 2 nr
+马文普 7 nr
+马文瑞 8 nr
+马文禄 3 nr
+马文骏 2 nr
+马料 4 n
+马斯一世 3 nrt
+马斯中 2 nr
+马斯克 3 nr
+马斯克林 9 nr
+马斯内 2 nr
+马斯医院 2 nz
+马斯卡尼 3 nrt
+马斯哈 3 nr
+马斯哈多夫 24 nrt
+马斯喀特 22 ns
+马斯地 4 ns
+马斯基 3 nr
+马斯塔 5 nr
+马斯巴特 2 nrt
+马斯抢 4 nr
+马斯断 2 nr
+马斯普 12 nr
+马斯格 3 nr
+马斯河 14 nr
+马斯洛 17 nr
+马斯洛夫 4 nrt
+马斯湖 9 nr
+马斯特 5 nr
+马斯特里赫特 17 nrt
+马斯登 12 nr
+马斯顿 4 nr
+马日事变 3 nz
+马昌博 2 nr
+马明博 2 nr
+马明宇 3 nr
+马明德 79 nr
+马明心 3 nr
+马明捷 2 nr
+马易茶 2 nr
+马星野 3 nr
+马春花 257 nr
+马晓伟 3 nr
+马晓年 5 nr
+马晓春 40 nr
+马晓晖 7 nr
+马晓晴 3 nr
+马晓河 2 nr
+马晓芳 4 nr
+马晓霖 5 nr
+马普安 15 nr
+马普尔 3 nr
+马普托 28 nr
+马普特拉 3 nrt
+马景林 4 nr
+马景涛 2 nr
+马曾德兰 3 nr
+马服 2 n
+马服君 2 nr
+马望东 4 nr
+马望北 3 nr
+马望城 2 nr
+马望本 7 nr
+马朝旭 1844 nr
+马木留 14 nr
+马木路 3 nr
+马木鲁 5 nr
+马本斋 6 nr
+马札儿 11 nr
+马札儿人 3 nr
+马札尔 2 nr
+马术 56 n
+马术演员 3 n
+马朱罗 3 nr
+马杀鸡 3 nr
+马村区 3 ns
+马杜古 2 nr
+马来 557 nr
+马来亚 80 ns
+马来人 3 nr
+马来半岛 116 ns
+马来族 9 nr
+马来熊 2 nr
+马来稀亚 3 nr
+马来群岛 3 ns
+马来西亚 820 ns
+马来西亚人 10 nr
+马来西亚林吉特 3 ns
+马来西亚籍 2 nr
+马来西亚队 49 nz
+马来西大 3 ns
+马来语 32 nr
+马来酸 2 nz
+马杰农 4 nr
+马林代 2 nr
+马林克 8 nr
+马林凯 3 nr
+马林工 256 nr
+马林斯 8 nr
+马林溪 2 nr
+马林科 11 nr
+马林科夫 3 nr
+马林诺 3 nr
+马林诺夫斯基 10 nrt
+马林迪 6 nr
+马枪 13 n
+马架 2 n
+马查多 3 nr
+马校尉 4 nr
+马格丽特 3 nr
+马格利 2 nr
+马格努斯 2 nr
+马格勒 2 nr
+马格尼 41 nr
+马格德 6 nr
+马格德堡 10 nr
+马格斯 2 nr
+马格洛 6 nr
+马格瓦 2 nr
+马格罗 7 nr
+马格达 5 nr
+马格达莱纳 10 nrt
+马格里 8 nr
+马格里布 40 nrt
+马桂花 2 nr
+马桑内酯 3 nz
+马桑溪 34 nr
+马桑科 2 nr
+马桥镇 3 nr
+马桩 7 nr
+马桶 124 n
+马桶刷 3 n
+马桶盖 5 n
+马梅多夫 2 nrt
+马梅特 2 nr
+马梯尼 3 nr
+马棚 66 nr
+马森布 12 nr
+马槟榔 3 n
+马槽 8 nr
+马槽中 3 nr
+马槽里 2 nr
+马模 4 n
+马横戈 2 nr
+马横枪 2 nr
+马檀溪 3 nr
+马欢岛 4 nr
+马欢著 5 nr
+马歇尔 171 nr
+马正向 2 nr
+马正林 2 nr
+马步 65 d
+马步军 66 nr
+马步水 3 nr
+马步芳 5 nr
+马殴官 2 v
+马殷死 3 nr
+马殷进 2 nr
+马毓真 97 nr
+马毛猬磔 3 nr
+马毛蝟磔 3 nr
+马氏体 25 nr
+马氏文 9 nr
+马氏文通 3 nr
+马氏珠 6 nr
+马水河 2 nr
+马水车龙 3 ns
+马永成 8 nr
+马永贞 3 nr
+马汝珩 9 nr
+马江 7 ns
+马沙巴 2 nr
+马河 27 ns
+马河中 2 ns
+马沽 32 ns
+马泉河 4 ns
+马泊六 4 nr
+马法五 2 nr
+马法通 9 nr
+马波乔 2 nr
+马泰伊 2 nr
+马泰休斯 3 nr
+马泰依 2 nr
+马泰克 3 nr
+马泰奥 7 nr
+马泽尔 4 nr
+马泽帕 2 nr
+马洛 10 nr
+马洛伊 9 nr
+马洛卡 12 nr
+马洛湾 5 ns
+马洛耶 2 nr
+马洛蒂 5 nr
+马浚伟 3 nr
+马浩然 2 nr
+马浪 3 nz
+马海丽 4 nr
+马海德 4 nr
+马海春 2 nr
+马海毛 5 nr
+马海盆 2 nr
+马海龙 3 nr
+马清秀 11 nr
+马渡江 5 nr
+马温加 4 nr
+马湖村 256 nr
+马湖江 2 ns
+马湘君 5 nr
+马湾 2 ns
+马滕斯 6 nr
+马滴达乡 3 nz
+马灯 66 n
+马灵往 2 nr
+马灵金 2 nr
+马烽 3 ns
+马焱俊 2 nr
+马熊 26 nr
+马燕红 4 nr
+马燕萍 2 nr
+马牛其风 3 nr
+马牛羊 3 nr
+马牧集 23 nr
+马特之 2 nr
+马特乌斯 3 nrt
+马特克 2 nr
+马特奥 2 nr
+马特峰 2 nr
+马特拉 12 nr
+马特拉齐 3 nrt
+马特斯 3 nr
+马玉仁 4 nr
+马玉昆 8 nr
+马玉涛 2 nr
+马玉田 4 nr
+马玉芹 5 nr
+马王堆 89 nr
+马王庙 2 nr
+马王爷 5 nr
+马王神 4 nr
+马班庄 3 ns
+马球 38 n
+马琳先 3 nr
+马瑙斯 18 ns
+马瑟集 3 nr
+马瑶草 115 nr
+马生角 3 nr
+马甲 63 nr
+马略卡岛 3 ns
+马略特 7 nr
+马瘦毛长 2 i
+马皇后 28 nr
+马皮 10 n
+马监太监 2 nr
+马监缺 2 nr
+马盖斯 2 nr
+马盖蒂 15 nr
+马盖麻 2 nr
+马直 5 d
+马直冲 6 nr
+马直抢 2 nr
+马直来 2 nr
+马直驰 2 nr
+马相伯 7 nr
+马相候 2 nr
+马相武 4 nr
+马相询 2 nr
+马相迎 2 nr
+马相随 2 nr
+马真之 2 nr
+马真人 18 nr
+马真塔 2 nr
+马真氏 7 nr
+马真道 5 nr
+马石山 2 nr
+马礼逊 7 nr
+马礼逊美 3 nr
+马祖 46 nr
+马祖光 3 nr
+马祖卡 13 nr
+马祖地区 3 ns
+马祖尔 2 nr
+马祖岛 6 nr
+马祖常 5 nr
+马祖庵 3 nr
+马祖澳 4 nr
+马祖诺夫 4 nr
+马神庙 2 nr
+马神骏 7 nr
+马福生 2 nr
+马福益 2 nr
+马科 44 nr
+马科斯 67 nr
+马科西 2 nr
+马科马 2 nr
+马空冀北 3 j
+马立克 35 nr
+马立师 2 nr
+马端临 25 nr
+马符验 2 n
+马笼头 3 n
+马类 3 n
+马粪 3 n
+马粪纸 3 n
+马精武 3 nr
+马系 7 n
+马索林 27 nr
+马约 34 ns
+马约尔 7 nr
+马约特岛 7 ns
+马约罗夫 2 ns
+马约莉 3 nr
+马纪壮 5 nr
+马纳克 2 nr
+马纳尔 2 nr
+马纳斯 3 nr
+马纳河 2 nr
+马纳特 4 nr
+马纳罗 4 nr
+马纹鎏 2 nr
+马纽 2 n
+马绍尔 68 nr
+马绍尔群岛 39 ns
+马绍纳 3 nr
+马绍纳兰 2 nr
+马给丁 3 nr
+马绛士 2 nr
+马继前 5 nr
+马续 2 d
+马维亚 4 nr
+马缨丹 2 nr
+马缨杜鹃 3 nr
+马缨花 3 nr
+马缰系 2 nr
+马缰绳 6 nr
+马罗基 3 nr
+马罗夫 2 nr
+马罗姆 3 nr
+马罗尼 2 nr
+马羚 3 n
+马群 34 nr
+马群奔 2 nr
+马翻人仰 3 nr
+马耀华 10 nr
+马老爷 6 nr
+马老镖 16 nr
+马考莱 2 nr
+马者 2 n
+马而泰 9 nr
+马耳东风 3 ns
+马耳他 143 ns
+马耳他人 6 n
+马耳他共和国 3 ns
+马耳他热 3 ns
+马耳春风 3 nr
+马肃 2 ns
+马肉 3 n
+马肥 3 ns
+马背 471 nr
+马背上 3 nr
+马脚 134 ns
+马脸汉子 3 nr
+马腊格 4 nr
+马腹逃鞭 3 i
+马腾之 2 nr
+马腾结 2 nr
+马腾见 2 nr
+马腿 3 n
+马自东 5 nrfg
+马自南 3 ns
+马自强 6 nrfg
+马自西 2 nr
+马自达 10 nrfg
+马至桥 2 nr
+马致远 21 nr
+马臻诚 2 nr
+马舍尔 4 nr
+马舞刀 3 nr
+马良 672 nr
+马良之 2 nr
+马良奏 3 nr
+马良弈 2 nr
+马良斯 3 nr
+马良行 18 nr
+马良骏 2 nr
+马艳丽 3 nr
+马艳红 2 nr
+马艳萍 11 nr
+马艳鲜 2 nr
+马苏 3 ns
+马苏德 3 nr
+马苏第 3 nr
+马苏麻 2 nr
+马若瑟 2 nr
+马英九 21 nr
+马英梅 13 nr
+马茶哥 2 nr
+马荣 7 nr
+马荣成 3 nrfg
+马荣起 2 nr
+马莉莉 22 nr
+马莫杜 2 nr
+马莫雷 2 nr
+马莱伯 2 nr
+马莱塔 2 nr
+马莲 9 nr
+马萨乔 7 nr
+马萨林 2 nr
+马萨格 5 nr
+马萨瓦 6 nr
+马萨诸塞 42 nr
+马萨诸塞州 113 ns
+马萨达 6 nr
+马萨里克 8 nrt
+马萨革 6 nr
+马蒂亚 6 nr
+马蒂厄 10 nr
+马蒂厄法 3 nr
+马蒂厄群 3 nr
+马蒂尼 2 nr
+马蒂斯 16 nr
+马蒂河 6 nr
+马蒂琴 2 nr
+马蓝 5 nr
+马蔚华 2 nr
+马蔺 3 nr
+马虎 171 nr
+马虎了事 3 i
+马虎子 3 nr
+马虎眼 4 nr
+马蛋果 2 n
+马蜂 22 nr
+马蜂橙 3 nr
+马蜂窝 36 n
+马蝇 2 nr
+马蝨 3 t
+马融 9 n
+马蟥 3 n
+马行 7 n
+马行空 137 nr
+马行街 4 nr
+马行迟 3 nr
+马衔 3 nr
+马衔山 12 nr
+马衔杯 2 nr
+马街 9 ns
+马衣 3 n
+马表 3 n
+马裕祥 3 nr
+马裕藻 4 nr
+马裤 4 n
+马裤呢 3 n
+马褂 104 n
+马褂木 3 vn
+马褡子 14 n
+马西 16 ns
+马西亚 3 ns
+马西埃 3 ns
+马西尼 6 nr
+马西拉 2 nr
+马西斯 4 nr
+马西昂 4 nr
+马西纳 2 nr
+马西莫 2 nr
+马西雷 2 nr
+马西驰 2 nr
+马观斗 2 nr
+马角 7 n
+马角乌头 3 ns
+马角乌白 3 ns
+马角坝 3 ns
+马让迪 2 nr
+马识得 2 nr
+马语 2 nz
+马语者 3 n
+马诺河 4 nr
+马诺诺 3 nr
+马谡极 3 nr
+马谢尔 2 nr
+马豫兴 2 nr
+马负超 5 nr
+马贤会 2 nr
+马贩子 8 n
+马贵斯 2 nr
+马费奥 2 nr
+马贼 38 n
+马贾利 4 nr
+马赛 208 nr
+马赛克 28 nr
+马赛曲 19 nr
+马赛港 15 nr
+马赛队 5 nr
+马赞德 3 nr
+马赞达 2 nr
+马赤军 11 nr
+马赫 186 nr
+马赫主义 17 nr
+马赫带 3 nr
+马赫数 49 nr
+马赫穆 12 nr
+马赫迪 39 nr
+马赫雷 2 nr
+马超 170 nr
+马超之 2 nr
+马超亦 2 nr
+马超兴 73 nr
+马超兵 6 nr
+马超引 2 nr
+马超战 2 nr
+马超新 2 nr
+马超群 3 nr
+马超背 2 nr
+马超见 3 nr
+马超闻 3 nr
+马足拔 2 n
+马足车尘 3 n
+马足龙沙 3 ns
+马跑泉 3 n
+马路 660 n
+马路上 3 l
+马路天使 3 nr
+马路如虎 3 nr
+马路新闻 5 nr
+马路消息 2 n
+马路边 29 nr
+马踏连 3 d
+马踏飞 6 nr
+马蹄 475 n
+马蹄声 283 n
+马蹄寺 6 ns
+马蹄形 46 n
+马蹄疾 3 n
+马蹄粉 5 n
+马蹄莲 5 n
+马蹄表 9 n
+马蹄袖 10 n
+马蹄金 5 n
+马蹄铁 10 n
+马蹄银 3 nz
+马蹬 3 n
+马蹬子 2 nr
+马车 429 n
+马车夫 19 nr
+马车时代 3 n
+马车赛 3 nr
+马辛杰 2 nr
+马边 19 d
+马边河 2 ns
+马达 98 nr
+马达加斯 3 ns
+马达加斯加 219 ns
+马达加斯加共和国 2 ns
+马达声 20 nr
+马达维基亚 4 ns
+马达里 2 nr
+马进击 3 nr
+马进宫 4 nr
+马进忠 2 nr
+马远程 18 nr
+马远航 2 nr
+马连曲村 3 ns
+马连登 2 nr
+马连科 2 nr
+马连良 27 nr
+马连道 3 nr
+马迟枚疾 3 nr
+马迦举 2 nr
+马迪斯 4 nr
+马述宽 2 nr
+马迹 5 n
+马迹塘 3 nr
+马迹山 6 nr
+马迹蛛丝 3 n
+马适建 4 nr
+马速 2 d
+马道 281 nr
+马道兄 2 nr
+马道婆 24 nr
+马道长 25 nr
+马邑县 2 ns
+马邑郡 3 nr
+马那瓜 35 ns
+马邦杰 4 nr
+马郎加 2 nr
+马部海 3 nr
+马都拉 10 nr
+马都监 8 nr
+马配驹 2 nr
+马里 318 q
+马里亚 12 ns
+马里亚纳 34 nrt
+马里亚纳群岛 31 ns
+马里克 3 nr
+马里兰 22 nr
+马里兰大学 10 nt
+马里兰州 31 ns
+马里共和国 6 ns
+马里奥 10 nr
+马里恩 4 nr
+马里拉 3 nrt
+马里政府 2 nt
+马里斯 3 nr
+马里昂 78 nr
+马里科 37 nr
+马里诺 7 nr
+马重喜 3 nr
+马金保 2 nr
+马金凤 2 nr
+马金叙 3 nr
+马金瓦 3 nr
+马銮湾 3 ns
+马钢高 2 nr
+马钦太 2 nr
+马钰之 2 nr
+马钰叹 4 nr
+马钰学 2 nr
+马钰微微 4 nr
+马钰授 2 nr
+马钰本 3 nr
+马钰甚 2 nr
+马钰笑 2 nr
+马钰见 2 nr
+马钰马 3 nr
+马钱子 17 nr
+马钱科 10 nr
+马铃 4 nr
+马铃瓜 3 n
+马铃薯 373 n
+马铃薯泥 3 n
+马锐林 4 nr
+马锡五 5 nr
+马锡龄 2 nr
+马镫 63 nr
+马长声 5 nr
+马门 8 ns
+马门溪 7 nr
+马阑勒 2 nr
+马队 83 n
+马阿林 2 nr
+马陆 7 nr
+马陆目 4 nr
+马院 2 n
+马陵山 2 nr
+马陵道 5 nr
+马雄山 9 nr
+马雅 2 nr
+马雅可 2 nr
+马雅可夫斯基 24 nrt
+马雅文化 3 nr
+马雪征 6 nr
+马雪斯 16 nr
+马雷斯 7 nr
+马雷霍 4 nr
+马霍尼 9 nr
+马青雄 15 nr
+马青骅 2 nr
+马靖方 3 nr
+马静芬 4 nr
+马静芳 2 nr
+马非马 5 nr
+马面牛头 3 n
+马革盛尸 3 nr
+马革裹尸 14 n
+马革里 3 ns
+马靴 35 nz
+马鞍 216 nr
+马鞍子 10 nr
+马鞍山 326 ns
+马鞍山市 23 ns
+马鞍山钢铁公司 2 nt
+马鞍形 24 nr
+马鞍桥 3 ns
+马鞭 231 nr
+马鞭子 30 n
+马鞭草 12 n
+马领兵 2 nr
+马颈圈 3 n
+马颈坳镇 2 v
+马飞报 18 nr
+马饰 3 n
+马首 3 n
+马首是瞻 25 i
+马香主 4 nr
+马马虎虎 69 nr
+马马足 2 nr
+马驰入 2 nr
+马驰奔 2 nr
+马驰骋 3 nr
+马驱兵 2 nr
+马驹 90 nr
+马驹子 2 nr
+马驹桥 3 nr
+马骑灯 4 nr
+马骡 6 n
+马骨胡 5 nr
+马鬃 29 n
+马鬃山 13 ns
+马鬃岭 4 ns
+马鲁一世 2 nr
+马鲁丁 10 nr
+马鲁古 15 nr
+马鲁夫 2 nr
+马鲁穆 2 nr
+马鲛鱼 19 n
+马鳖 3 n
+马鸣寺 5 nr
+马鸣萧萧 3 nr
+马鸣著 2 nr
+马鸣风 2 nr
+马鸿良 6 nr
+马鸿逵 4 nr
+马鹰亦 2 nr
+马鹿 34 nr
+马鹿异形 3 nr
+马鹿易形 3 nr
+马麟引 2 nr
+马黎诺 9 nr
+马黑麻 2 nr
+马默德 2 nrt
+马默里 3 nrt
+马黛茶 2 nr
+马鼎盛 2 nr
+马鼻疽 2 n
+马齐奔 2 nr
+马齿徒增 3 i
+马齿徒长 3 l
+马齿苋 34 n
+马龙 37 nr
+马龙县 3 ns
+马龙山 3 nr
+马龙峰 3 nr
+马龙派 8 nr
+马龙车水 3 ns
+驭 179 n
+驭凤骖鹤 3 nz
+驭夫 3 n
+驭夫有术 3 n
+驭手 2 n
+驭者 3 n
+驮 519 v
+驮子 24 n
+驮戥村 3 vn
+驮篓 3 n
+驮背 3 n
+驮负 3 v
+驮轿 6 n
+驮运 52 v
+驮马 4 n
+驮骡 2 n
+驯 203 n
+驯养 140 v
+驯兽 13 n
+驯兽师 5 n
+驯化 127 v
+驯和 3 n
+驯服 75 n
+驯服者 3 n
+驯熟 2 a
+驯狮 3 n
+驯狮者 3 n
+驯良 25 a
+驯虎 3 n
+驯虎师 3 n
+驯象 6 n
+驯顺 33 v
+驯马 15 n
+驯马师 3 n
+驯鹿 438 n
+驰 1203 vg
+驰名 516 v
+驰名世界 3 i
+驰名中外 617 i
+驰名于世 3 i
+驰名商标 3 l
+驰名天下 3 i
+驰名当世 3 i
+驰声走誉 3 i
+驰往 3 v
+驰志伊吾 3 nz
+驰念 3 v
+驰援 162 v
+驰誉 21 v
+驰风骋雨 3 l
+驰马 3 v
+驰马试剑 3 i
+驰驱 28 v
+驰骋 170 v
+驰骋疆场 4 l
+驰骋纵横 3 l
+驰骤 3 l
+驰高鹜远 3 l
+驰魂夺魄 3 i
+驱 865 v
+驱使 268 v
+驱出 3 v
+驱动 756 vn
+驱动之家 3 n
+驱动力 53 n
+驱动器 65 n
+驱动电流 4 n
+驱动程序 22 n
+驱动程式 3 n
+驱动轮 3 n
+驱动链 3 n
+驱去 3 v
+驱寒 16 v
+驱役 3 v
+驱恶向善 3 n
+驱护舰 17 n
+驱散 130 v
+驱离 2 v
+驱程 3 n
+驱策 50 n
+驱羊战狼 3 n
+驱羊攻虎 3 n
+驱虫 44 n
+驱虫剂 10 n
+驱虫药 11 n
+驱蚊 3 n
+驱蚊剂 9 n
+驱蚊器 3 n
+驱走 29 v
+驱赶 331 v
+驱车 129 n
+驱迫 3 v
+驱逐 987 v
+驱逐令 3 n
+驱逐出境 3 n
+驱逐机 5 n
+驱逐舰 785 n
+驱遣 9 v
+驱邪 49 v
+驱除 230 v
+驱雷掣电 3 vn
+驱雷策电 3 n
+驱霆策电 3 nz
+驱风 12 n
+驱马 3 n
+驱马上路 3 n
+驱马前进 3 v
+驱驰 13 v
+驱鬼 3 n
+驱魔人 3 v
+驱鸟 27 n
+驱鼠驾猫 3 nz
+驲 2 zg
+驳 427 v
+驳倒 35 v
+驳回 107 v
+驳回上诉 3 n
+驳回去 3 n
+驳回来 3 n
+驳回申诉 3 n
+驳壳 3 n
+驳壳枪 45 n
+驳壳枪薄 3 n
+驳岸 5 n
+驳斥 165 v
+驳杂 27 a
+驳正 3 v
+驳船 73 n
+驳议 3 n
+驳运 8 v
+驳运费 3 n
+驳面子 3 n
+驳骨丹 3 n
+驴 1209 n
+驴儿 3 n
+驴前马后 3 i
+驴叫声 3 n
+驴唇 3 n
+驴唇不对马嘴 7 i
+驴唇马嘴 3 i
+驴头 3 n
+驴子 291 n
+驴年马月 2 n
+驴心狗肺 3 i
+驴打滚 13 l
+驴皮影 3 n
+驴皮胶 3 n
+驴粪 3 n
+驴粪蛋 4 n
+驴肉 39 n
+驴肝肺 6 n
+驴肾 3 n
+驴车 3 n
+驴驹 3 n
+驴骡 12 n
+驴鸣犬吠 3 i
+驴鸣狗吠 3 i
+驵 5 g
+驶 422 v
+驶上 3 v
+驶入 117 v
+驶出 98 v
+驶动 3 v
+驶去 108 v
+驶向 97 v
+驶回 3 v
+驶往 48 v
+驶抵 20 v
+驶来 58 v
+驶离 35 v
+驶过 121 v
+驶近 43 v
+驶进 181 v
+驷 305 n
+驷不及舌 2 i
+驷之过蠙 3 n
+驷之过隙 3 i
+驷华 3 n
+驷马 14 n
+驷马不追 3 i
+驷马仰秣 3 n
+驷马莫追 3 i
+驷马轩车 3 i
+驷马难追 36 i
+驷马高盖 3 n
+驷马高车 4 i
+驷马高门 3 i
+驸 88 n
+驸马 691 n
+驸马巷 3 n
+驸马爷 3 n
+驹 160 ng
+驹光过隙 3 n
+驹子 4 n
+驹留空谷 3 n
+驹窗电逝 3 vn
+驹鸟 3 n
+驹齿 3 n
+驹齿未落 3 n
+驺 17 g
+驻 6848 v
+驻京 173 ns
+驻京办 381 nt
+驻伊美军 3 nt
+驻兵 3 n
+驻军 616 n
+驻华 890 v
+驻华使节 3 n
+驻华使馆 3 nt
+驻华大使 3 n
+驻厂 3 n
+驻在员 3 n
+驻在国 18 n
+驻地 1437 n
+驻地网 3 n
+驻场 3 n
+驻外 741 vn
+驻外使馆 3 nt
+驻守 435 v
+驻屯 41 ns
+驻屯军 3 i
+驻屯重兵 3 i
+驻戌 3 n
+驻扎 730 v
+驻扎地 6 ns
+驻有 3 v
+驻极体 8 n
+驻沪 3 ns
+驻法 18 n
+驻波 23 n
+驻波天线 3 n
+驻波比 3 ns
+驻港 24 ns
+驻港部队 2 nt
+驻澳门部队 2 nt
+驻点 4 n
+驻留 35 v
+驻监 3 n
+驻穗 3 n
+驻站 5 n
+驻红却白 3 n
+驻警 3 n
+驻足 641 v
+驻足不前 2 v
+驻足观看 3 i
+驻跸 108 v
+驻防 168 v
+驻防军 3 n
+驻防地 3 n
+驻防部队 3 n
+驻颜 3 n
+驻颜有术 3 i
+驻颜益寿 3 ns
+驻马店 21 ns
+驻马店市 6 ns
+驼 949 n
+驼员 3 n
+驼子 102 n
+驼峰 60 n
+驼毛 6 n
+驼着背 3 n
+驼绒 18 n
+驼群 2 n
+驼背 134 n
+驼色 11 n
+驼负 3 n
+驼铃 18 n
+驼铃声 5 n
+驼队 15 n
+驼马 33 n
+驼鸟 3 n
+驼鹿 22 n
+驽 14 a
+驽下 3 a
+驽劣 3 a
+驽弓 3 n
+驽材 3 n
+驽箭离弦 3 n
+驽钝 13 a
+驽马 3 n
+驽马十舍 3 n
+驽马十驾 3 n
+驽马恋栈 3 n
+驽马铅刀 3 n
+驾 2002 v
+驾上 3 v
+驾上去 3 v
+驾上来 3 v
+驾临 123 v
+驾乘 4 nz
+驾云 49 n
+驾信 3 nz
+驾凌 3 v
+驾到 157 v
+驾去 3 v
+驾回 3 v
+驾回去 3 i
+驾回来 3 l
+驾好 3 v
+驾崩 195 v
+驾御 37 v
+驾成 3 v
+驾机 46 n
+驾机投诚 3 nz
+驾来驾去 3 i
+驾校 4 n
+驾照 31 v
+驾肩接武 3 i
+驾肩接迹 3 i
+驾船 3 n
+驾走 3 v
+驾起 3 v
+驾车 266 n
+驾车人 5 n
+驾车者 3 n
+驾车记 3 n
+驾轻就熟 28 i
+驾辕 8 n
+驾过 3 v
+驾雾腾云 3 i
+驾驭 248 v
+驾驭者 5 n
+驾驭能力 3 n
+驾驶 911 v
+驾驶人员 5 n
+驾驶仪 6 nz
+驾驶台 14 n
+驾驶员 552 n
+驾驶室 85 n
+驾驶席 3 n
+驾驶座 8 nz
+驾驶执照 2 n
+驾驶本 10 n
+驾驶盘 3 n
+驾驶者 9 n
+驾驶舱 154 n
+驾驶证 86 nz
+驾驶证者 3 n
+驾鹤 3 nz
+驾鹤成仙 3 i
+驾鹤西归 3 i
+驾鹤西游 3 n
+驿 683 n
+驿丞 3 n
+驿书 3 n
+驿传 102 n
+驿使 3 n
+驿使梅花 3 n
+驿卒 47 n
+驿吏 3 n
+驿城区 3 ns
+驿寄梅花 3 n
+驿站 271 n
+驿舍 5 n
+驿路 33 n
+驿路梅花 3 n
+驿车 3 n
+驿运处 3 n
+驿道 67 n
+驿馆 3 n
+驿马 37 n
+驿马车 3 n
+骀 10 x
+骀背鹤发 3 nt
+骁 61 n
+骁勇 79 a
+骁勇善战 32 i
+骁将 72 n
+骁悍 3 a
+骁雄 3 n
+骁骑 154 n
+骂 7047 v
+骂不绝口 34 l
+骂不还口 5 l
+骂人 421 n
+骂名 43 v
+骂咧 3 z
+骂咧咧 3 z
+骂声 115 n
+骂大街 10 n
+骂天咒地 3 z
+骂天扯地 3 l
+骂娘 49 n
+骂山门 3 n
+骂是爱 3 l
+骂杀 2 v
+骂来骂去 3 z
+骂架 2 n
+骂街 27 n
+骂谁 3 l
+骂阵 3 v
+骂题 3 n
+骂骂 3 v
+骂骂咧咧 42 z
+骃 10 zg
+骄 240 a
+骄人 70 n
+骄人成绩 3 l
+骄佚 3 n
+骄佚奢淫 3 i
+骄侈暴佚 3 n
+骄侈淫虐 3 z
+骄傲 794 a
+骄傲地 3 i
+骄傲情绪 3 i
+骄傲感 3 i
+骄傲自大 3 i
+骄傲自满 21 i
+骄傲起来 3 i
+骄儿 3 n
+骄儿騃女 3 n
+骄兵 31 n
+骄兵之计 3 i
+骄兵必败 5 i
+骄兵悍将 3 v
+骄奢 3 a
+骄奢放逸 3 i
+骄奢淫佚 2 i
+骄奢淫泆 3 i
+骄奢淫逸 40 i
+骄女 3 n
+骄娇二气 3 i
+骄子 39 n
+骄态 3 n
+骄恣 3 i
+骄悍 3 a
+骄慢 3 a
+骄敌 3 n
+骄横 123 a
+骄横奢侈 3 i
+骄气 23 a
+骄泰淫泆 3 i
+骄爱 3 a
+骄狂 6 a
+骄生惯养 3 i
+骄盈 3 a
+骄矜 32 a
+骄纵 57 a
+骄者必败 3 l
+骄肆 3 a
+骄色 3 a
+骄躁 3 a
+骄阳 39 n
+骄阳似火 17 i
+骅 8 nr
+骅骝 3 n
+骆 256 nr
+骆二人 2 nr
+骆五爷 2 nr
+骆元通 8 nr
+骆冬宣 2 nr
+骆冰喜 4 nr
+骆冰大 2 nr
+骆冰奔 3 nr
+骆冰微微 2 nr
+骆冰忙 9 nr
+骆冰怒 2 nr
+骆冰抢 2 nr
+骆冰本 2 nr
+骆冰笑 36 nr
+骆冰见 11 nr
+骆国骏 3 nr
+骆宾王 12 nr
+骆尚志 5 nr
+骆清传音 2 nr
+骆清在 2 nr
+骆清时 3 nr
+骆清都 2 nr
+骆玉笙 7 nr
+骆秉全 5 nr
+骆秉章 6 nr
+骆立言 2 nr
+骆绎不绝 3 nr
+骆雨乔 3 nr
+骆雨会 2 nr
+骆马 4 nr
+骆马湖 24 nr
+骆驼 705 n
+骆驼刺 11 n
+骆驼峰 3 n
+骆驼比 3 n
+骆驼毛 3 n
+骆驼湖 3 n
+骆驼牌 11 n
+骆驼绒 3 nz
+骆驼肉 5 n
+骆驼蓬 3 nz
+骆驼队 3 n
+骆驿 3 ns
+骆驿不绝 3 ns
+骆鹏道 3 nr
+骇 559 i
+骇人 3 n
+骇人听闻 223 i
+骇人视听 3 i
+骇人闻听 3 i
+骇人闻见 3 i
+骇客 9 n
+骇客帝国 3 n
+骇异 135 z
+骇心动目 3 i
+骇怕 11 a
+骇怪 3 a
+骇惧 3 a
+骇愕 3 a
+骇浪 15 n
+骇浪惊涛 3 n
+骇然 316 z
+骇状殊形 3 n
+骇目惊心 3 i
+骇目振心 3 i
+骇闻 3 n
+骇龙走蛇 3 i
+骈 139 n
+骈丽 3 n
+骈体 22 n
+骈体文 3 n
+骈俪 7 n
+骈兴错出 3 n
+骈列 3 n
+骈四俪六 3 t
+骈四骊六 3 t
+骈拇枝指 3 n
+骈文 98 n
+骈枝 3 n
+骈枝俪叶 3 t
+骈比 3 n
+骈肩叠迹 3 n
+骈肩接迹 3 n
+骈肩累足 3 n
+骈肩累踵 3 n
+骈肩累迹 3 n
+骈肩迭迹 3 v
+骈门连室 3 n
+骈首就僇 3 n
+骈首就死 3 n
+骈首就系 3 n
+骊 93 ns
+骊山 44 ns
+骊歌 3 ns
+骊歌四起 3 ns
+骊珠 3 ns
+骊驹 3 ns
+骋 88 vg
+骋怀 3 nr
+骋怀游目 3 nr
+骋目 3 nr
+骋耆奔欲 3 nr
+验 440 v
+验伤 11 v
+验伤单 3 n
+验伪机 3 l
+验光 13 v
+验光师 3 n
+验关 4 vn
+验勘 3 v
+验印 3 v
+验发 3 v
+验尸 16 n
+验尸官 3 n
+验尿 3 v
+验布机 3 n
+验戳 3 v
+验收 501 v
+验收人 3 n
+验收关 3 n
+验收单 3 n
+验收报告 3 n
+验收组 4 n
+验放 9 v
+验方 32 n
+验明 27 v
+验明正身 8 n
+验查 3 vn
+验核 3 vn
+验湿器 3 l
+验电器 10 n
+验电笔 3 v
+验看 10 v
+验票 7 n
+验算 18 v
+验线 3 n
+验血 10 v
+验血单 3 n
+验讫 3 v
+验证 783 v
+验证台 10 n
+验证法 3 n
+验证码 3 n
+验货 5 vn
+验货单 3 n
+验资 9 vn
+验钞 3 vn
+验钞机 3 n
+骍 2 zg
+骎 22 zg
+骏 157 n
+骏业 2 n
+骏发 3 n
+骏奔 3 nrt
+骏波虎浪 3 n
+骏迈 3 n
+骏马 236 n
+骏马奔驰 3 vn
+骏骨 3 n
+骏骨牵盐 3 v
+骐 4 g
+骐驎 3 n
+骐骥 4 n
+骐骥一毛 3 v
+骐骥一砾 3 v
+骐骥才郎 3 ns
+骐骥过隙 3 n
+骑 4437 v
+骑上去 3 v
+骑上来 3 v
+骑下 3 n
+骑下去 3 v
+骑下来 3 v
+骑乘 3 n
+骑兵 2735 n
+骑兵军 3 n
+骑兵团 88 n
+骑兵师 3 n
+骑兵队 3 n
+骑出 3 v
+骑出去 3 v
+骑出来 3 v
+骑到 3 v
+骑劫 15 v
+骑单车 3 n
+骑回 3 v
+骑回去 3 i
+骑回来 3 i
+骑坐 3 v
+骑墙 6 n
+骑墙份子 3 n
+骑墙派 6 n
+骑士 839 n
+骑士团 38 n
+骑士队 3 n
+骑射 165 v
+骑师 2 n
+骑弓 3 n
+骑成 3 v
+骑手 51 n
+骑扬州鹤 3 n
+骑术 68 n
+骑李湘 3 ns
+骑来 3 v
+骑来骑去 3 i
+骑楼 3 n
+骑毛驴 3 n
+骑牛觅牛 3 i
+骑田岭 14 ns
+骑着马 3 n
+骑破 3 v
+骑缝 7 n
+骑缝印 3 n
+骑缝章 3 n
+骑者善堕 3 i
+骑虎之势 3 i
+骑虎难下 22 i
+骑行 3 v
+骑警 14 n
+骑车 172 n
+骑车人 28 n
+骑车到 3 i
+骑车去 3 i
+骑车来 3 n
+骑过去 3 v
+骑过来 3 v
+骑进 3 v
+骑进去 3 v
+骑进来 3 v
+骑马 1183 n
+骑马寻马 3 i
+骑马打仗 3 i
+骑马找马 3 vn
+骑马装 3 n
+骑马飞奔 3 i
+骑驴 3 n
+骑驴倒堕 3 i
+骑驴找马 3 vn
+骑驴找驴 3 v
+骑驴索句 3 n
+骑驴觅驴 3 i
+骑骆驼 3 n
+骑骑 3 n
+骑鹤上扬 3 i
+骑鹤扬州 3 ns
+骑鹤维扬 3 i
+骑鹤西归 3 i
+骑龙弄凤 3 i
+骒马 4 n
+骓 50 g
+骕 13 zg
+骖 3 v
+骖风驷霞 3 i
+骖鸾驭鹤 3 n
+骗 1764 v
+骗上去 3 v
+骗上来 3 v
+骗下去 3 v
+骗下来 3 v
+骗买骗卖 3 n
+骗人 353 n
+骗保 3 v
+骗倒 3 v
+骗光 3 n
+骗入 3 v
+骗出 3 v
+骗出去 3 v
+骗出来 3 v
+骗到 3 v
+骗取 130 v
+骗取信任 3 n
+骗取钱财 3 n
+骗吃 3 v
+骗吃骗喝 3 n
+骗嘴 3 v
+骗回 3 v
+骗回去 3 n
+骗回来 3 n
+骗婚 3 v
+骗子 321 n
+骗子手 2 n
+骗局 122 n
+骗拐 3 n
+骗术 36 n
+骗来 3 v
+骗来骗去 3 n
+骗案 3 n
+骗税 6 n
+骗线 3 n
+骗腿 3 n
+骗财 3 v
+骗财骗色 3 n
+骗购 10 v
+骗赔案 3 n
+骗走 3 v
+骗过 3 v
+骗钱 3 n
+骗马 3 n
+骗骗 3 v
+骘 13 g
+骙 47 zg
+骚 193 v
+骚乱 312 v
+骚乱喧嚣 3 i
+骚乱性 3 n
+骚人 4 n
+骚人墨士 3 n
+骚人墨客 3 i
+骚人词客 3 i
+骚人逸客 3 i
+骚人雅士 3 n
+骚体 16 n
+骚动 324 v
+骚客 11 v
+骚情赋骨 3 i
+骚扰 469 v
+骚扰电话 3 n
+骚气 3 v
+骚翁墨客 3 i
+骚苏 3 v
+骚货 21 v
+骛 26 g
+骜 5 g
+骝 21 g
+骞 852 g
+骟 28 v
+骠 52 n
+骠勇 3 n
+骠骑 80 n
+骡 342 n
+骡夫 3 n
+骡子 678 n
+骡车 3 n
+骡马 225 n
+骡马车 3 n
+骡驮子 3 v
+骢 11 g
+骣 4 g
+骤 340 d
+骤不及防 3 i
+骤冷 3 v
+骤减 31 v
+骤变 29 v
+骤增 55 v
+骤灭 3 v
+骤然 372 d
+骤至 3 d
+骤落 3 v
+骤起 46 v
+骤降 44 v
+骤雨 75 n
+骤雨暴风 3 i
+骤雨狂风 3 i
+骤雪 3 n
+骤风 3 n
+骤风急雨 3 i
+骤风暴雨 3 i
+骥 40 nr
+骥伏盐车 3 nr
+骥子龙文 3 nr
+骥服盐车 3 nr
+骥骜 3 nr
+骦 7 zg
+骧 17 vg
+骨 3946 n
+骨下袋 3 n
+骨伤 11 n
+骨伤病 2 n
+骨伤科 6 n
+骨关节 22 n
+骨关节炎 3 n
+骨内袋 3 n
+骨刺 25 n
+骨力 22 n
+骨化 49 n
+骨化形销 3 l
+骨化风成 3 nz
+骨嘟 37 o
+骨器 58 n
+骨坏死 3 n
+骨塔 3 n
+骨外膜 3 n
+骨头 851 n
+骨头架子 24 n
+骨头汤 3 n
+骨头节儿 3 n
+骨子 12 n
+骨子里 190 n
+骨子里头 3 n
+骨学 10 n
+骨密度 13 n
+骨寒毛竖 3 i
+骨屑 3 n
+骨干 1103 n
+骨干人物 3 n
+骨干企业 3 n
+骨干分子 3 n
+骨干力量 3 n
+骨干成员 3 n
+骨干教师 3 n
+骨干网 17 n
+骨库 3 n
+骨度 3 n
+骨感 3 n
+骨成形瓣 3 n
+骨折 361 n
+骨料 4 n
+骨朵 14 n
+骨朵儿 2 n
+骨松筋软 3 n
+骨板 42 n
+骨架 272 n
+骨架子 2 n
+骨架蛋白 3 l
+骨桥蛋白 3 n
+骨殖 23 v
+骨气 151 n
+骨灰 200 n
+骨灰坛 3 n
+骨灰堂 3 n
+骨灰瓮 3 n
+骨灰盒 48 n
+骨灰盒子 3 n
+骨灰箱 3 n
+骨灰级 3 n
+骨炎 12 n
+骨炭 17 n
+骨牌 55 n
+骨牌效应 3 n
+骨牙粘连 3 n
+骨瓷 13 n
+骨生成素 3 l
+骨疑难 3 l
+骨病 12 n
+骨痨 3 n
+骨瘤 11 n
+骨瘦如材 3 i
+骨瘦如柴 36 i
+骨瘦形销 3 i
+骨癌 3 n
+骨盆 98 n
+骨盘 3 n
+骨直 3 v
+骨相 3 n
+骨眼 3 n
+骨硬蛋白 3 l
+骨碌 32 z
+骨碌碌 51 z
+骨碎补 3 i
+骨科 59 n
+骨科医生 3 nz
+骨稽 3 v
+骨立 3 v
+骨筷 3 n
+骨粉 27 n
+骨组织 23 n
+骨细胞 3 n
+骨结核 7 n
+骨缝 3 n
+骨肉 263 n
+骨肉之情 3 i
+骨肉分离 3 i
+骨肉同胞 3 l
+骨肉团圆 5 nz
+骨肉团聚 3 nz
+骨肉情 3 n
+骨肉未寒 3 i
+骨肉瘤 3 l
+骨肉相残 6 i
+骨肉相连 3 i
+骨肉离散 2 i
+骨肉至亲 6 i
+骨肿瘤 3 l
+骨胶 8 n
+骨胶原 3 n
+骨腔 3 n
+骨腾肉飞 3 i
+骨膜 25 n
+骨膜炎 2 n
+骨节 66 n
+骨董 69 n
+骨蒸 3 nz
+骨血 50 n
+骨质 222 n
+骨质增生 14 n
+骨质瓷 3 n
+骨质疏松症 34 n
+骨质酥松 3 n
+骨转移 3 i
+骨软筋酥 2 i
+骨软筋麻 3 l
+骨软肉酥 3 i
+骨针 70 n
+骨钙蛋白 3 n
+骨隐窝 3 n
+骨雕 3 n
+骨颤肉惊 3 i
+骨骸 3 n
+骨骼 619 n
+骨骼肌 55 n
+骨髓 387 n
+骨髓库 9 n
+骨髓炎 19 n
+骨髓瘤 17 n
+骨髓移植 3 n
+骨髓细胞 3 n
+骨鲠 9 n
+骨鲠之臣 3 i
+骨鲠在喉 5 i
+骨龄 5 n
+骮 444 zg
+骯 11 zg
+骰 97 n
+骰子 407 n
+骱 83 g
+骲 6 zg
+骶 71 n
+骶椎 3 n
+骶骨 8 n
+骷 50 n
+骷髅 223 n
+骷髅兵 3 vn
+骷髅头 3 vn
+骷髅旗 3 vn
+骷髅洞 3 z
+骸 349 n
+骸骨 133 n
+骺 53 x
+骻 45 zg
+骻骨 3 z
+骼 39 x
+骼炭 3 n
+髀 52 g
+髀关 3 i
+髀肉复生 5 i
+髀里肉生 3 i
+髀骨 3 i
+髁 114 g
+髁导斜度 3 ns
+髁突运动 3 v
+髁道斜度 3 ns
+髂 57 n
+髂骨 3 n
+髃 2 zg
+髅 29 x
+髋 30 n
+髋关节 20 n
+髋关节炎 3 n
+髋臼 2 n
+髋部 3 n
+髋骨 19 n
+髌 34 n
+髌骨 14 n
+髑 24 n
+髑髅 7 n
+髓 287 g
+髓内 3 n
+髓室 3 n
+髓室底 3 n
+髓室顶 3 n
+髓心 8 n
+髓海 3 n
+髓石 3 n
+髓角 3 n
+髓质 3 n
+髓鞘 25 n
+體 41 zg
+高 57483 a
+高一 278 b
+高一丈 3 nr
+高一上 3 d
+高一功 238 nr
+高一化学 3 l
+高一层 3 b
+高一箭 5 l
+高一郡 2 nr
+高三 497 nr
+高三上 3 l
+高三下 3 l
+高三娘子 3 nr
+高下 188 n
+高下任心 3 n
+高下其手 3 l
+高下在口 3 l
+高下在心 3 l
+高下在手 3 l
+高不云衢 3 n
+高不可攀 60 i
+高不可登 3 i
+高不成 7 v
+高不成低不就 13 l
+高专 57 j
+高世之德 3 nr
+高世之才 3 nr
+高世之智 3 nr
+高世之行 3 nr
+高世千 9 nr
+高世宣 42 nr
+高世骇俗 3 i
+高丝氨酸 3 n
+高丝美 3 nr
+高个 53 b
+高个儿 47 d
+高个子 92 n
+高中 4732 s
+高中低 3 b
+高中低档 5 b
+高中化学 3 nt
+高中历史 3 nr
+高中同学 3 nt
+高中地理 3 j
+高中女生 3 nr
+高中学生 3 nr
+高中收入 3 l
+高中政治 3 l
+高中数 3 l
+高中数学 3 l
+高中文化 3 nr
+高中时代 3 l
+高中档 5 b
+高中毕业 3 nr
+高中版 2 b
+高中物理 3 n
+高中班 10 nr
+高中生 129 nr
+高中生物 3 l
+高中篇 3 b
+高中级 11 b
+高中英语 3 nr
+高中语文 3 nr
+高中课程 3 n
+高丰度 3 ns
+高丰文 3 nr
+高丽 228 nr
+高丽乐 4 nr
+高丽人 3 nr
+高丽军 4 nr
+高丽参 10 nr
+高丽国 6 nr
+高丽图 2 nr
+高丽布 2 nr
+高丽庄 2 nr
+高丽往 3 nr
+高丽族 2 nr
+高丽沈 2 nr
+高丽生 3 nr
+高丽纸 3 nz
+高丽菜 3 nr
+高丽营 2 nr
+高丽营镇 4 nr
+高丽藏 4 nr
+高丽虹 3 nr
+高丽青 4 nr
+高举 833 d
+高举深藏 3 i
+高举着 3 l
+高举远蹈 3 i
+高举高打 20 i
+高乃依 18 nr
+高义 3 n
+高义薄云 3 nr
+高之士 2 nr
+高乐 3 n
+高乐高 3 nr
+高二上 3 l
+高二下 3 l
+高于 1766 v
+高于一切 3 i
+高云 23 nr
+高云峰 2 nr
+高云才 2 nr
+高云鹏 4 nr
+高井 4 n
+高亢 527 a
+高交会 15 j
+高产 719 n
+高产出 3 n
+高产田 3 n
+高产稳产 3 n
+高亮度 3 nr
+高人一头 3 l
+高人一等 41 l
+高人一筹 14 j
+高人逸士 3 i
+高人雅士 3 ns
+高仁山 5 nr
+高仓健 8 nr
+高仪喊 2 nr
+高价 252 n
+高价位 3 n
+高价股 3 n
+高价药 3 n
+高伐林 3 nr
+高会 3 n
+高伯年 159 nr
+高估 65 v
+高位 550 n
+高位厚禄 3 l
+高位池 3 n
+高位沼泽 3 nr
+高位牙 3 n
+高位重禄 3 l
+高低 1198 a
+高低不平 3 l
+高低压 5 n
+高低型 3 b
+高低杠 38 n
+高低柜 3 n
+高低温 3 n
+高低贵贱 15 l
+高低贵贱之分 9 l
+高低音 3 n
+高佬 3 nz
+高俅领 2 nr
+高保勖 2 nr
+高保成 3 nr
+高保真 10 nr
+高倍 14 d
+高倍率 3 n
+高健民 27 nr
+高傲 158 a
+高傲不屈 3 i
+高傲自大 3 i
+高像素 3 n
+高僧 628 nr
+高元钧 5 nr
+高光泽 3 nr
+高克恭 7 nr
+高克新 21 nr
+高兰村 3 nr
+高兰科 2 nr
+高兴 5387 b
+高其佩 9 nr
+高冈 28 ns
+高军 3 n
+高农 3 n
+高冠 2 n
+高冠博带 3 nr
+高冬平 3 nr
+高冷蔬菜 3 nz
+高凌风 256 nr
+高凝油 2 n
+高凤祥 3 nr
+高凤翰 4 nr
+高凤自秽 3 i
+高凤阁 33 nr
+高出 1295 v
+高出一筹 22 i
+高分 450 n
+高分低能 8 n
+高分子 489 n
+高分子化 3 n
+高分辨率 72 n
+高则成 14 nrfg
+高则诚 4 nr
+高利 56 n
+高利圣 4 nr
+高利率 3 n
+高利货 3 n
+高利贷 292 n
+高利贷者 72 n
+高剑父 16 nr
+高剪切 3 nr
+高力 2 n
+高力士 25 nr
+高功率 3 n
+高功耗 3 b
+高加索 245 nr
+高加索区 3 ns
+高加索地区 19 ns
+高勇杰 17 nr
+高医 3 n
+高千穗 3 nr
+高升 71 nr
+高升专 3 nr
+高升本 3 n
+高升泰 3 nr
+高升镇 14 nr
+高华柱 3 nr
+高单翼 4 nr
+高占祥 21 nr
+高卢 138 nr
+高卢人 2 nr
+高卢战 2 nr
+高卧 3 nr
+高卧东山 3 ns
+高危期 3 j
+高卷珠 2 nr
+高压 925 n
+高压包 3 n
+高压手段 3 n
+高压政策 3 n
+高压服 3 n
+高压柜 5 n
+高压氧 21 n
+高压氧化 3 n
+高压水泵 3 n
+高压泵 3 n
+高压火炬 3 i
+高压电 20 n
+高压电器 3 n
+高压电源 3 n
+高压硅堆 3 n
+高压线 34 n
+高压线塔 3 n
+高压缩 3 l
+高压脊 21 n
+高压锅 18 n
+高压阀门 3 vn
+高原 3264 ns
+高原区 61 ns
+高原地区 3 ns
+高原期 3 n
+高原气候 3 n
+高原沼泽 3 nr
+高原病 3 n
+高原直泰 3 nr
+高县 4 ns
+高县人 3 nr
+高参 16 n
+高又壮 2 nr
+高叉胖 2 nr
+高发 72 v
+高发区 15 n
+高发期 16 n
+高口 7 n
+高古 15 ns
+高句丽 113 ns
+高可用性 3 n
+高可立 13 nr
+高可靠性 3 n
+高台 258 n
+高台县 4 ns
+高台教 12 nz
+高台跳水 3 ns
+高叶密 2 nr
+高吉义 3 nr
+高吊 3 v
+高名 3 a
+高名凯 2 nr
+高名大姓 3 i
+高名衡 113 nr
+高君宇 40 nr
+高含水 2 nr
+高含沙 4 nr
+高启 7 nr
+高吸水 3 n
+高周波 3 nr
+高呼 1122 v
+高呼口号 3 n
+高咏 3 nrfg
+高品位 22 n
+高品佚 2 nr
+高品保 4 nr
+高品质 4 n
+高哈尔 2 nr
+高唐 9 nr
+高唐县 3 nr
+高唐州 38 nr
+高唱 189 v
+高唱入云 3 n
+高喊 265 nr
+高嗓 3 n
+高四班 3 nr
+高回报 3 n
+高国珠 4 nr
+高圆圆 18 nr
+高地 460 n
+高地价 3 n
+高坛 3 n
+高坡 306 nr
+高坪区 2 ns
+高垒 2 n
+高垒深沟 3 nr
+高城 19 ns
+高城深池 3 nr
+高基庙 768 nr
+高堂 28 nr
+高堂大厦 3 i
+高堂生 2 nr
+高堡乡 2 nr
+高塔 64 nr
+高填方涵洞 2 nr
+高墙 123 n
+高增值 2 nr
+高增益 7 nr
+高墨达 4 nr
+高士 41 n
+高士其 6 nr
+高士图 2 nr
+高士奇 3 nr
+高士廉 7 nr
+高士晶莹 2 nr
+高士达 6 nr
+高声 942 n
+高处 443 d
+高处不胜 3 l
+高大 1737 a
+高大乔木 4 nr
+高大卫 13 nr
+高大威武 2 nr
+高大威猛 3 nr
+高大挺拔 3 nr
+高大监 2 nr
+高大英俊 18 nr
+高大雄 2 nr
+高大雄伟 3 nr
+高大魁梧 3 nrfg
+高天厚 2 nr
+高天厚地 3 i
+高天民 2 nr
+高太公 2 nr
+高太尉 192 nr
+高头 30 n
+高头大马 45 ns
+高头讲章 4 n
+高奇峰 5 nr
+高奏 11 n
+高如岳 2 nr
+高妙 16 a
+高妹 3 n
+高富帅 13 n
+高姓大名 3 nr
+高姿态 10 l
+高威达 3 nr
+高婕放 2 nr
+高媛媛 3 nr
+高子白 2 nr
+高字节 3 n
+高季兴 20 nr
+高学历 3 n
+高守中 2 nr
+高守义 10 nr
+高安 13 nr
+高安市 3 ns
+高宗 198 nr
+高宗之 4 nr
+高宗卒 3 nr
+高宗封 2 nr
+高宗时 4 nr
+高宗欲 4 nr
+高宗武 7 nr
+高宗死 7 nr
+高宗皇帝 7 nr
+高宗益 2 nr
+高宗立 5 nr
+高宗许 3 nr
+高宗诏 2 nr
+高宗遂 2 nr
+高官 252 n
+高官厚爵 3 nr
+高官厚禄 160 nr
+高官尊爵 3 nr
+高官显爵 3 nr
+高官显贵 4 nr
+高官极品 3 n
+高官重禄 3 nr
+高宝宝 3 nr
+高宝湖 2 nr
+高实 2 d
+高家 296 n
+高家俊 2 nr
+高家军 3 nr
+高家堰 3 nr
+高家岭 257 nr
+高家庄 15 nr
+高家村 2 nr
+高家湾 2 nr
+高容量 3 n
+高宽比 3 z
+高密 125 a
+高密县 3 nr
+高密市 2 n
+高密度 8 n
+高密镇 3 nr
+高寒 198 b
+高寒区 14 nr
+高寮 3 ns
+高对比度 3 l
+高寿 21 nr
+高射 95 v
+高射炮 126 n
+高射炮兵 15 n
+高射炮弹 3 n
+高射炮火 3 n
+高射部队 3 n
+高小 18 nr
+高小勇 10 nr
+高尔吉 36 nr
+高尔吉亚 3 ns
+高尔基 177 nr
+高尔基体 3 nz
+高尔基路 3 nz
+高尔夫 176 nr
+高尔夫球 93 nr
+高尔夫球会 3 nz
+高尔夫球场 73 n
+高尔夫球赛 3 nz
+高尔察 6 nr
+高尔察克 3 ns
+高尔德 2 nr
+高尔文 3 nr
+高尔斯 13 nr
+高尔韦 2 nr
+高尔顿 20 nr
+高尚 957 n
+高尚情操 3 nr
+高尚风格 3 nr
+高尾 11 n
+高尿酸 3 n
+高层 1220 n
+高层云 3 nr
+高层人士 3 n
+高层住宅 3 n
+高层建筑 3 l
+高层次 62 b
+高层用户 3 n
+高层论坛 3 n
+高层领导 3 n
+高居 91 n
+高居条视 3 l
+高居榜首 3 i
+高居深拱 3 nr
+高屋建瓴 27 i
+高屏地区 3 ns
+高屏溪 5 nr
+高山 1202 ns
+高山仰之 3 i
+高山仰止 15 l
+高山冻土 3 n
+高山反应 2 l
+高山土壤 3 ns
+高山大川 3 ns
+高山寺 2 nr
+高山峰 2 nr
+高山峻岭 20 ns
+高山族 356 nz
+高山景行 3 nr
+高山栎 21 nr
+高山植物 3 l
+高山榕 3 nr
+高山流水 40 ns
+高山湖 6 ns
+高山病 17 nr
+高山症 3 nz
+高岛 8 ns
+高岩岸 2 nr
+高岭土 110 nr
+高岭石 36 nr
+高岸 3 n
+高岸为谷 3 nr
+高岸为陵 3 nr
+高岸深谷 3 nr
+高峡出平湖 3 nz
+高峭 3 a
+高峰 1556 nr
+高峰乡 3 ns
+高峰会 4 nr
+高峰期 167 n
+高峰论坛 3 n
+高峻 77 a
+高崎 4 ns
+高崖 29 n
+高崖子 3 nr
+高嵌体 3 n
+高州 35 ns
+高州县 3 ns
+高州市 3 ns
+高工 10 n
+高差 163 n
+高师 3 n
+高师弟 3 nr
+高带宽 8 nr
+高帽 57 n
+高帽儿 3 nr
+高帽子 30 nr
+高干 76 n
+高平 106 nr
+高平原 28 ns
+高平县 3 ns
+高平市 3 ns
+高平省 2 ns
+高平镇 3 nr
+高年级 40 b
+高庆奎 11 nr
+高庆裔 5 nr
+高店 2 n
+高庙 7 n
+高度 6119 n
+高度一致 3 nz
+高度化 3 ns
+高度发达 3 nz
+高度层 5 n
+高度文明 3 nz
+高度机密 3 ns
+高度民主 3 n
+高度肯定 3 ns
+高度自治权 17 nz
+高度表 15 n
+高度计 14 n
+高度评价 3 n
+高度负责 3 n
+高度赞扬 3 nr
+高度重视 3 l
+高度限制 3 n
+高度集中 3 nz
+高康州 4 nr
+高廉见 2 nr
+高廊 3 n
+高建华 3 nr
+高建国 4 ns
+高建民 2 nr
+高建芳 3 nr
+高开低走 3 l
+高开冲 2 nr
+高开高 6 nr
+高弟武 2 nr
+高弹力 3 n
+高弹性 3 n
+高强 182 nr
+高强度 15 n
+高彦君 3 nr
+高彦超 71 nr
+高彩霞 3 nr
+高征 2 n
+高待遇 3 n
+高徒 76 n
+高得幸 2 nr
+高德占 10 nr
+高德原 2 nr
+高德年 3 nr
+高德康 2 nr
+高德曼 3 nr
+高志 4 n
+高志军 23 nr
+高志强 2 nr
+高志森 3 nr
+高志航 7 nr
+高忱无忧 3 nr
+高怀德 4 nr
+高怀昌 3 nr
+高怡平 3 nr
+高怡生 3 nr
+高性 5 n
+高性价 6 n
+高性价比 3 l
+高性能 191 n
+高息 12 n
+高悬 473 nr
+高悬秦镜 3 nr
+高情厚谊 3 nr
+高情远意 3 i
+高情远致 3 i
+高情远韵 3 n
+高情逸兴 3 nr
+高情逸态 3 i
+高情逸致 3 i
+高惠彬 3 i
+高感光度 2 n
+高慢 3 d
+高慧君 3 nr
+高懿屏 3 nr
+高成 87 nrfg
+高成冷 2 nr
+高成呆 2 nr
+高成好 2 l
+高成忍 2 nr
+高成揉 2 nr
+高成摇 2 nr
+高成明 2 nrfg
+高成理 2 nr
+高成皱 2 nr
+高成真 2 nr
+高成瞅 2 nr
+高成费 2 n
+高成长性 3 n
+高成顿 2 nr
+高房价 3 n
+高手 2405 n
+高手如云 3 i
+高手如林 3 l
+高手林立 3 nz
+高才卓识 3 i
+高才大学 3 nr
+高才捷 4 nr
+高才捷足 3 nr
+高才生 16 nr
+高才疾足 3 i
+高才绝学 3 l
+高才远识 3 i
+高扬 33 nr
+高技 3 n
+高技术 99 n
+高技术司 3 n
+高技能 3 n
+高抗 10 v
+高抬明镜 3 l
+高抬贵手 53 i
+高抬身价 3 i
+高招 153 nr
+高招办 100 v
+高拱伏 2 nr
+高拱兄 6 nr
+高拱刚 3 nr
+高拱明 2 nr
+高拱朝 3 nr
+高拱领 2 nr
+高拱鹰 2 nr
+高挑 35 a
+高挑儿 3 nr
+高挑挑 3 z
+高挡 3 v
+高换婷 5 nr
+高掌远跖 3 nr
+高掌远蹠 3 n
+高搁 3 v
+高攀 65 nr
+高攀不上 3 l
+高攀不起 3 l
+高收入者 19 n
+高收视率 3 n
+高效 1139 a
+高效化 2 n
+高效廉洁 3 nr
+高效快捷 3 l
+高效性 15 n
+高效率 24 n
+高效益 14 n
+高效能 3 n
+高敏捷 5 nr
+高敖曹 3 nr
+高教 163 nz
+高教司 3 n
+高教法 3 n
+高教自考 3 l
+高教部 4 n
+高敞 3 a
+高敞郡 2 nr
+高敬亭 2 nr
+高数码 3 n
+高文举 3 nr
+高文典 3 nr
+高文典册 3 n
+高文典策 3 nr
+高文大册 3 nr
+高文秀 3 nr
+高斋学士 3 nz
+高斯 187 nr
+高斯分布 3 nr
+高斯型 2 nr
+高斯定理 3 nr
+高斯密 4 nr
+高斯曲率 3 nz
+高斯测度 3 n
+高斯消 2 nr
+高斯特 4 nr
+高斯计 3 nr
+高新 563 d
+高新产业 3 n
+高新产品 2 n
+高新区 270 nr
+高新技术 2537 n
+高新科技 14 nz
+高时明 2 nr
+高旷 2 nr
+高昂 324 nr
+高明 791 nr
+高明主 2 nr
+高明剑 2 nr
+高明区 3 nr
+高明县 3 nr
+高明市 2 ns
+高明根 3 nr
+高明远识 3 n
+高明骏 3 nr
+高春燕 2 nr
+高春辉 3 nr
+高显 3 a
+高晋海 2 nr
+高晓宇 2 nr
+高晓松 7 nr
+高景德 2 nr
+高景恒 3 nr
+高智商 3 nr
+高智慧 3 nr
+高智晟 3 nr
+高智能 3 nr
+高曙光 3 nr
+高曼华 3 nr
+高曼寺 3 nr
+高有德 5 nr
+高朋喝 2 l
+高朋故戚 3 n
+高朋满座 12 l
+高朗 41 nr
+高朗亭 8 nr
+高末儿 7 nr
+高本汉 4 nr
+高杆 11 n
+高杆灯 3 n
+高杉晋 5 nr
+高材 3 n
+高材捷足 3 nr
+高材生 37 n
+高材疾足 3 n
+高村 5 n
+高村正彦 3 nr
+高松 13 a
+高松年 83 nr
+高枕 14 nr
+高枕勿忧 3 i
+高枕安卧 3 nr
+高枕安寝 3 i
+高枕无忧 56 i
+高枕而卧 3 i
+高林密 11 nr
+高林茂 2 nr
+高枝 4 n
+高枝儿 10 nr
+高架 56 n
+高架公路 3 n
+高架桥 36 ns
+高架路 10 n
+高架轻轨 3 n
+高架道路 2 n
+高架铁路 3 nz
+高架铁道 3 n
+高柜 3 n
+高柠檬酸 3 nz
+高标 5 n
+高标准 52 n
+高标号 3 n
+高栏 15 n
+高栏赛 3 nr
+高树 23 n
+高树光 3 nr
+高树勋 3 nr
+高树图 2 nr
+高树堂 3 nr
+高校 3824 n
+高校后勤 3 nr
+高校学生 3 n
+高校教师 3 n
+高校网 3 n
+高根 5 nz
+高根明 10 nr
+高根鞋 3 nr
+高格 2 n
+高桂英 114 nr
+高档 705 b
+高档化 2 l
+高档商品 3 l
+高档次 4 b
+高档礼品 3 l
+高档轿车 3 l
+高桥克典 3 ns
+高桥洋子 3 nz
+高桥虫麻 2 n
+高桥镇 9 nr
+高梁 88 nr
+高梁河 6 nr
+高梁米 3 nr
+高梁酒 3 nr
+高梦丸 3 nr
+高梦九 41 nr
+高检 260 j
+高检院 5 nt
+高棉 55 n
+高棉人 22 n
+高棉语 7 nz
+高棚 3 n
+高棠 2 nrfg
+高楼 178 n
+高楼大厦 82 nz
+高模量 9 l
+高次方程 23 nz
+高欢 63 v
+高欢亲 2 nr
+高欢命 2 nr
+高歌 197 n
+高歌一曲 3 l
+高歌猛进 53 l
+高止山 3 nr
+高步云衢 3 n
+高步杰 5 nr
+高步通衢 3 n
+高步阔视 3 l
+高残留 3 nr
+高段 3 n
+高殿帅 11 nr
+高氏世 2 nr
+高氏父 2 nr
+高气 3 n
+高气压 3 n
+高气压区 2 n
+高气昂 3 nr
+高气豪 2 nr
+高氮沥青 3 n
+高氯酸 11 nz
+高氯酸钾 3 nz
+高水头 6 n
+高水平 91 nr
+高水箱 3 n
+高永昌 2 nr
+高污染 3 b
+高汤 7 nr
+高沈阳 4 nr
+高沛 6 a
+高沟 3 ns
+高油价 3 n
+高法 263 n
+高泳源 2 n
+高洁 49 a
+高洋 8 ns
+高洪波 31 nr
+高活性 8 n
+高济宇 2 nr
+高济译 5 nr
+高浓度 90 n
+高浩荣 6 nr
+高浮雕 3 nr
+高海况 3 n
+高海情 4 nr
+高涨 789 v
+高深 175 b
+高深莫测 32 i
+高淳 7 nr
+高淳县 2 nr
+高清 57 nr
+高清化 3 nr
+高清晰 3 nr
+高清晰度 3 l
+高清晰度电视 2 l
+高清碟 3 nr
+高渐离 3 nr
+高温 1515 n
+高温作业 2 n
+高温假 2 n
+高温区 9 n
+高温多雨 75 nr
+高温检修 3 nr
+高温气候 3 l
+高温炎热 2 nr
+高温计 7 nr
+高温高压 2 z
+高港区 6 ns
+高湖 8 ns
+高湛 6 a
+高潮 1435 nr
+高潮时 3 nr
+高潮期 8 n
+高潮点 3 n
+高潮线 9 nz
+高潮迭起 26 l
+高灵敏 2 nr
+高灵敏度 3 n
+高炉 105 n
+高炮 227 n
+高炮团 10 nt
+高炮旅 14 n
+高炯 3 nrfg
+高点 153 n
+高烧 90 v
+高热 75 a
+高热量 3 n
+高烯丙醇 3 nz
+高焕陆 3 nr
+高煦之 6 nr
+高照 24 n
+高燥 3 a
+高爵丰禄 3 nr
+高爵厚 3 nr
+高爵厚禄 3 nr
+高爵重禄 3 nr
+高爽 22 a
+高玄殿 10 nr
+高玉倩 5 nr
+高玉凤 14 nr
+高玉林 7 nr
+高玉涛 2 nr
+高珊 3 nrfg
+高球 38 n
+高球赛 3 n
+高琳颜 2 nr
+高瑞欣 3 nr
+高璐娜 3 nr
+高田乡 3 nr
+高田昊 3 nr
+高甲戏 4 n
+高电位 3 n
+高电平 3 n
+高电阻线 3 n
+高画质 2 n
+高留华 2 nr
+高瘦 3 a
+高瘦和尚 2 nr
+高登宝 3 nr
+高登岛 2 nr
+高登布尔 2 nr
+高皇后 3 nr
+高益民 2 nr
+高监军 4 nr
+高盛 105 nr
+高盛集团 13 nt
+高睨大谈 3 i
+高瞻远嘱 3 n
+高瞻远瞩 76 i
+高矗 3 v
+高矮 79 a
+高矮不一 3 n
+高砂 2 n
+高研文 7 nr
+高研班 3 nr
+高硫煤 2 n
+高硬度 3 n
+高碑店 10 ns
+高碑店市 3 ns
+高碘酸 2 n
+高碳 9 n
+高碳钢 10 n
+高碳青质 3 n
+高磁纬 2 n
+高祀仁 3 nr
+高祖 175 nr
+高祖母 3 nr
+高祖父 3 nr
+高神 3 n
+高票 3 n
+高票当选 3 n
+高福利 17 nr
+高福早 2 nr
+高秀华 2 nr
+高秀敏 4 nr
+高秀玉 2 nr
+高秆作物 3 n
+高科技 173 nz
+高科技产品 2 n
+高科技化 3 j
+高科技股 3 n
+高积云 16 nr
+高积安 2 nr
+高程 480 n
+高穹 3 n
+高空 644 n
+高空作业 4 n
+高空槽 13 n
+高空病 3 n
+高立 3 nr
+高立士 2 nr
+高端 499 n
+高端化 2 nr
+高端用户 7 n
+高端轻 3 nr
+高竿 3 n
+高等 2134 b
+高等专科 3 l
+高等动物 3 l
+高等学历 3 n
+高等学府 3 l
+高等学校 837 l
+高等师范 3 nr
+高等教育 1341 l
+高等教育出版社 34 nt
+高等教育法 33 l
+高等教育部 12 nt
+高等数学 3 l
+高等植物 3 l
+高等法院 3 l
+高等级 59 b
+高等级公路 5 l
+高等考试 3 n
+高等职业 3 l
+高等院校 604 l
+高筑 3 n
+高筒 9 n
+高筒靴 3 nz
+高管家 3 n
+高篱 3 n
+高粘度 3 n
+高粱 567 n
+高粱米 9 nr
+高粱蚜 3 n
+高粱酒 6 n
+高粱面 22 n
+高粱饴 2 i
+高精密 3 nr
+高精尖 22 nr
+高精度 7 n
+高精氨酸 3 nz
+高素质 10 nr
+高红村 3 nr
+高级 5737 b
+高级专员 3 l
+高级中学 1300 nt
+高级人才 3 l
+高级人民法院 40 nt
+高级会议 3 n
+高级会谈 3 l
+高级别 3 n
+高级化 3 n
+高级品 3 n
+高级官员 3 l
+高级将领 3 n
+高级小学 5 l
+高级工 9 n
+高级干部 3 n
+高级律师 3 n
+高级技工 3 n
+高级技师 3 n
+高级教师 3 n
+高级法院 3 nt
+高级班 9 n
+高级社 10 nt
+高级神经 20 l
+高级者 3 n
+高级职称 3 n
+高级轿车 3 l
+高级阶段 3 n
+高级顾问 3 l
+高纪东 19 nr
+高纬 56 b
+高纬度 114 n
+高纯度 3 n
+高纯水 3 nr
+高纯砷 2 nr
+高纯锗 2 nr
+高线 9 n
+高结彩 2 nr
+高统靴 3 nz
+高继冲 2 nr
+高绩效 3 n
+高绪衡 2 nr
+高维 11 nr
+高维山 2 nr
+高维索引 3 nr
+高翔 17 nr
+高翔引 2 nr
+高翔远引 3 nr
+高耀洁 3 nr
+高老头 3 nr
+高老庄 8 nr
+高老者 3 nr
+高考 3565 v
+高考作文 3 n
+高考制度 3 n
+高考卷 3 nr
+高考及格 3 n
+高考状元 3 n
+高考网 3 nz
+高考落榜 3 n
+高考题 3 n
+高者 75 n
+高而不危 3 i
+高耐磨 3 a
+高耗能 11 n
+高耸 385 nr
+高耸入云 34 i
+高职 389 n
+高职班 7 nr
+高职生 12 nr
+高职高专 3 j
+高联考 2 j
+高聚物 33 n
+高背 9 n
+高背椅 2 n
+高胜洪 3 nr
+高胜美 3 nr
+高胡 13 nr
+高胱氨酸 3 n
+高能 269 n
+高能原子 3 n
+高能态 6 n
+高能物理 69 n
+高能耗 11 n
+高能量 27 n
+高能键 3 nr
+高脂肪 3 n
+高脂血症 13 n
+高脘大谈 3 vn
+高脚 39 n
+高脚屋 5 n
+高脚杯 7 n
+高腔 53 n
+高自位置 3 n
+高自旋 9 nr
+高自标树 3 n
+高自标置 3 n
+高自标誉 3 n
+高自考 3 nr
+高致 3 a
+高致病 3 nr
+高良姜 3 nr
+高良河 2 nr
+高良涧 7 nr
+高节 3 n
+高节清风 3 l
+高苕华 2 z
+高草草原 3 ns
+高荣盛 6 nr
+高莽 6 nrfg
+高蓓蓓 3 nr
+高薪 436 nr
+高薪养廉 3 nr
+高薪技术 3 n
+高薪者 5 n
+高蛋白 51 l
+高血压 876 n
+高血压病 3 n
+高血糖 21 n
+高血糖素 29 n
+高血脂 37 n
+高血脂症 3 n
+高行 3 j
+高行健 3 nr
+高衙内 22 nrt
+高西广 4 nr
+高西沟 3 ns
+高要 13 b
+高要县 6 ns
+高要市 4 n
+高见 112 v
+高见远识 3 i
+高观 3 n
+高视阔步 7 i
+高觉敷 2 nr
+高论 70 n
+高设花台 3 nt
+高识远见 3 n
+高调 124 n
+高谈大论 3 n
+高谈弘论 3 nr
+高谈虚论 3 i
+高谈阔论 91 i
+高谈雄辩 3 l
+高负荷 3 n
+高质 10 n
+高质量 99 n
+高贵 359 a
+高贵不贵 3 i
+高贵典雅 3 nr
+高赀 3 i
+高资费 3 n
+高赛尔 2 nr
+高赫宇 4 nr
+高起潜 75 nr
+高起点 3 n
+高超 317 nr
+高超无比 3 nr
+高超绝伦 3 i
+高超音速 3 nr
+高足 23 a
+高足弟子 2 n
+高跃丈 5 nr
+高跃仰 2 nr
+高跟鞋 142 n
+高路江 2 nr
+高跳台 3 ns
+高跷 40 a
+高踞 51 v
+高蹈远举 3 i
+高躅 3 v
+高车 38 n
+高车山 5 nr
+高车驷马 2 i
+高转速 3 d
+高轶军 2 vn
+高辛氏 7 nr
+高达 3 nr
+高迁 3 nr
+高迈 3 nr
+高迎样 3 nr
+高迎祥 195 nr
+高远 81 d
+高远球 3 n
+高迢险峻 3 i
+高迪奥 9 nr
+高适 11 a
+高通 166 nr
+高通公司 75 nt
+高通量 3 n
+高速 6279 d
+高速下载 3 n
+高速串行总线 2 n
+高速传输 2 nr
+高速公路 2939 n
+高速公路网 268 n
+高速化 7 n
+高速存取 2 l
+高速层 3 n
+高速度 15 n
+高速性 3 n
+高速成长 3 n
+高速接口 2 n
+高速摄影机 2 n
+高速数据 5 n
+高速旋转 3 i
+高速率 2 n
+高速电影 3 n
+高速移动 2 nz
+高速线 3 n
+高速缓冲存储器 3 n
+高速缓存 4 nr
+高速行驶 3 nr
+高速路 33 n
+高速运行 2 n
+高速运转 4 l
+高速通信 2 n
+高速钢 21 n
+高速铁路 3 nz
+高遇常 3 nr
+高遏行云 3 nr
+高邑 11 nr
+高邑县 3 ns
+高邮 131 ns
+高邮县 6 ns
+高邮市 10 j
+高都镇 3 nr
+高里津 9 ns
+高野 4 n
+高野山 2 nr
+高金素梅 3 nr
+高钙片 3 n
+高钙血症 3 n
+高钠血症 3 nz
+高钻井液 3 nz
+高钾血症 3 nz
+高铁 350 n
+高铭暄 2 nr
+高银仙 2 nr
+高键 2 n
+高锰酸盐 3 n
+高锰酸钾 82 n
+高锰钢 7 n
+高长壮 2 nr
+高长恭 3 nr
+高长河 128 nr
+高长胜 2 nr
+高门 3 n
+高门卢 2 nr
+高门大屋 3 ns
+高门大户 3 ns
+高闯王 21 nr
+高闻 3 n
+高阁 123 nr
+高阈逻辑 3 n
+高阔 4 a
+高阳 69 ns
+高阳县 2 ns
+高阳酒徒 3 n
+高阳酒德 3 nr
+高阶 55 nr
+高阶层 3 n
+高阶差分 3 l
+高阶微 2 l
+高阶微分 3 n
+高阶语言 3 n
+高阻隔 3 n
+高陂 3 ns
+高附加值 14 n
+高院 11 n
+高陵 529 nr
+高陵县 5 ns
+高陵镇 256 nr
+高难 52 a
+高难度 70 l
+高雄中学 3 l
+高雄人 3 nr
+高雄医学 3 l
+高雄县 12 ns
+高雄县长 3 nr
+高雄工专 3 l
+高雄市 31 ns
+高雄师范 3 nr
+高雄海专 3 nr
+高雄港 3 ns
+高雅 309 nr
+高雅简朴 3 nr
+高集成度 2 n
+高雪峰 2 nr
+高雪氏 2 nr
+高雷诺 6 nr
+高雷雷 8 nr
+高震主 8 nr
+高露洁 18 nr
+高青 3 nr
+高青县 6 nr
+高青高 2 nr
+高韧性 4 n
+高韫玉 2 nr
+高音 165 n
+高音区 9 n
+高音单元 3 n
+高音喇叭 3 n
+高音质 3 n
+高音部 3 nt
+高顺亦 2 nr
+高顺军 3 nr
+高顺式 3 nr
+高顺引 3 nr
+高顾遐视 3 l
+高领 21 n
+高频 208 b
+高频先见 3 nr
+高频头 2 n
+高频干燥 3 l
+高频抖动 2 i
+高频放电 3 nz
+高频机 3 n
+高频率 3 n
+高频电波 3 n
+高频词 3 n
+高颖维 2 nr
+高颜超 3 nr
+高额 353 n
+高颧骨 3 z
+高风亮节 27 nr
+高风劲节 3 n
+高风峻节 3 i
+高风险 57 n
+高飞 3 nr
+高飞球 4 nr
+高飞远 2 nr
+高飞远举 3 i
+高飞远翔 3 nr
+高飞远走 16 i
+高飞远遁 3 nr
+高飞远集 3 nr
+高香草酸 3 nz
+高高 563 a
+高高低低 26 z
+高高兴兴 119 ns
+高高在上 99 l
+高高地 81 z
+高高大大 13 nz
+高高手 3 n
+高高挂 3 nr
+高高挂起 8 i
+高高的 283 nrfg
+高高飘扬 3 i
+高鸿业 3 nr
+高黎贡山 38 ns
+高鼻子 9 n
+高鼻梁 3 nr
+高鼻深目 14 i
+高龄 204 n
+高龄产妇 3 n
+高龙巴 3 nr
+髙 4 zg
+髝 2 zg
+髞 68 zg
+髟 52 zg
+髡 119 g
+髦 233 g
+髫 11 g
+髬 2 zg
+髭 55 g
+髭毛 3 n
+髭须 33 n
+髮 2 zg
+髯 236 ng
+髯儿 3 n
+髯口 15 n
+髰 42 zg
+髳 2 zg
+髹 36 g
+髻 215 g
+髼 80 zg
+髽 3 zg
+髽髻 3 n
+鬃 98 ng
+鬃刷 3 n
+鬃毛 40 n
+鬅松 3 z
+鬈 36 g
+鬏 5 g
+鬐 4 zg
+鬓 244 n
+鬓乱钗横 3 n
+鬓发 65 n
+鬓发皆白 3 z
+鬓毛 2 n
+鬓角 62 n
+鬓边 3 n
+鬓霜 3 n
+鬘 10 zg
+鬟 39 g
+鬡 18 zg
+鬣 66 n
+鬣狗 48 n
+鬣羚 13 n
+鬣蜥 3 n
+鬣鬃 3 n
+鬥 2 zg
+鬨堂 3 z
+鬩 56 zg
+鬬 2 zg
+鬯 26 g
+鬰 4 zg
+鬲 53 ng
+鬴 99 zg
+鬵 34 zg
+鬶 7 zg
+鬻 55 vg
+鬻儿卖女 3 i
+鬻声钓世 3 i
+鬻宠擅权 3 vn
+鬻文为生 3 i
+鬻矛誉楯 3 i
+鬻良杂苦 3 i
+鬻驽窃价 3 n
+鬻鸡为凤 3 i
+鬼 5314 n
+鬼不觉 37 i
+鬼丫头 3 n
+鬼主意 29 n
+鬼伞菌素 3 l
+鬼佬 8 n
+鬼使神差 45 i
+鬼兵 10 n
+鬼出电入 3 n
+鬼出神入 3 i
+鬼刻神劖 3 n
+鬼剃头 3 n
+鬼功神力 3 i
+鬼压床 3 n
+鬼友 3 n
+鬼叫声 3 n
+鬼名堂 3 nr
+鬼吒狼嚎 3 nr
+鬼吹灯 3 i
+鬼呀 3 n
+鬼咤狼嚎 3 i
+鬼哭 3 v
+鬼哭天愁 3 i
+鬼哭狼嗥 3 nr
+鬼哭狼嚎 35 i
+鬼哭神号 2 i
+鬼哭神嚎 8 i
+鬼哭神惊 3 i
+鬼哭神愁 3 i
+鬼哭粟飞 3 nr
+鬼器狼嚎 3 i
+鬼城 11 n
+鬼域伎俩 3 r
+鬼天气 9 i
+鬼头 113 n
+鬼头滑脑 3 i
+鬼头鬼脑 19 i
+鬼子 573 n
+鬼子兵 8 nr
+鬼子姜 3 nr
+鬼尊 6 n
+鬼屋 20 n
+鬼屋传奇 3 nr
+鬼屋魔影 3 i
+鬼工雷斧 3 i
+鬼市 17 n
+鬼帅 6 n
+鬼形怪状 3 i
+鬼影 3 n
+鬼心肠 3 i
+鬼怕恶人 2 i
+鬼性 3 n
+鬼怪 181 n
+鬼怪式 3 l
+鬼才 52 n
+鬼扯 3 v
+鬼把戏 7 n
+鬼搞 3 v
+鬼故事 3 i
+鬼斧神功 3 i
+鬼斧神工 34 i
+鬼方 30 n
+鬼晓得 3 nr
+鬼来电 3 n
+鬼武者 3 n
+鬼气 3 n
+鬼气冲天 3 i
+鬼气森森 3 nr
+鬼泣 3 v
+鬼泣神号 3 n
+鬼泣神嚎 3 i
+鬼混 52 nr
+鬼火 106 n
+鬼灵精 14 nr
+鬼点子 12 n
+鬼点火 3 i
+鬼烂神焦 3 i
+鬼片 3 n
+鬼片当道 3 i
+鬼物 3 n
+鬼王 3 n
+鬼画符 10 n
+鬼畜 3 n
+鬼眼狂刀 3 i
+鬼瞰其室 3 n
+鬼瞰高明 3 n
+鬼神 276 n
+鬼神不测 3 i
+鬼神莫测 11 i
+鬼祟 35 n
+鬼笔 6 n
+鬼笔毒素 3 n
+鬼笔溶血 3 n
+鬼笔素 3 n
+鬼符 3 n
+鬼箭羽 3 nr
+鬼精 3 n
+鬼精灵 3 nr
+鬼线 3 n
+鬼聪明 3 nr
+鬼胎 20 n
+鬼脸 151 n
+鬼臼 3 n
+鬼臼毒素 3 n
+鬼臼素 3 n
+鬼舞者 3 n
+鬼船 3 n
+鬼节 8 n
+鬼花招 3 i
+鬼蜮 12 n
+鬼蜮伎俩 14 i
+鬼蜮技俩 3 i
+鬼见愁 17 i
+鬼计 26 n
+鬼计多端 13 i
+鬼计百端 3 i
+鬼设神使 3 i
+鬼话 113 n
+鬼话连篇 2 i
+鬼谷子 23 n
+鬼车 3 n
+鬼迷心窍 24 i
+鬼针草 3 i
+鬼门 3 n
+鬼门关 78 n
+鬼雄 10 n
+鬼马 3 n
+鬼鬼 3 n
+鬼鬼崇崇 3 l
+鬼鬼祟 3 i
+鬼鬼祟祟 228 i
+鬼魂 228 n
+鬼魅 95 n
+鬼魅伎俩 3 i
+鬼魊 3 v
+鬼魔 4 n
+鬼黠 3 a
+鬽 51 zg
+鬾 12 zg
+魀 5 zg
+魁 362 ns
+魁伟 53 a
+魁元 4 n
+魁北克 87 ns
+魁北克城 12 ns
+魁北克省 43 ns
+魁岸 3 n
+魁星 65 n
+魁星楼 3 ns
+魁星踢斗 3 n
+魁星阁 11 ns
+魁梧 261 a
+魁祸 3 n
+魁首 46 ns
+魂 1207 n
+魂不守宅 3 n
+魂不守舍 30 i
+魂不着体 3 l
+魂不著体 3 n
+魂不负体 3 l
+魂不赴体 3 i
+魂不附体 119 i
+魂丧神夺 3 i
+魂亡胆落 3 i
+魂亡魄失 3 i
+魂兮归来 6 l
+魂劳梦断 3 l
+魂归 3 n
+魂归何处 3 i
+魂惊胆丧 3 i
+魂惊胆落 3 i
+魂惊胆颤 3 i
+魂惊魄惕 3 i
+魂惊魄落 3 i
+魂摇魄乱 3 i
+魂斗罗 3 n
+魂断蓝桥 3 n
+魂消胆丧 3 i
+魂消魄丧 3 i
+魂消魄夺 3 i
+魂灵 71 n
+魂牵梦系 3 l
+魂牵梦绕 9 i
+魂牵梦萦 19 l
+魂离魄散 3 i
+魂耗魄丧 3 i
+魂车 3 n
+魂轿 3 n
+魂销目断 3 i
+魂销肠断 3 l
+魂销魄散 3 i
+魂门 3 n
+魂颠梦倒 3 i
+魂飘神荡 3 i
+魂飘魄散 3 i
+魂飞天外 83 i
+魂飞目断 3 i
+魂飞神丧 3 i
+魂飞胆丧 3 i
+魂飞胆战 3 i
+魂飞胆破 3 i
+魂飞胆落 3 i
+魂飞胆裂 3 i
+魂飞胆颤 3 i
+魂飞魄丧 3 i
+魂飞魄散 141 i
+魂飞魄荡 3 i
+魂飞魄越 3 i
+魂飞魄飏 3 i
+魂驰梦想 3 i
+魂魄 144 n
+魃 61 x
+魄 272 n
+魄力 191 n
+魄户 3 n
+魄散魂消 3 n
+魄散魂飘 3 i
+魄散魂飞 6 i
+魄消魂散 3 i
+魄荡魂摇 3 i
+魄荡魂飞 3 i
+魅 189 zg
+魅人 3 n
+魅力 997 n
+魅力值 3 n
+魅力十足 3 n
+魅力四射 6 l
+魅影 3 n
+魅惑 3 n
+魆 18 zg
+魆风骤雨 3 l
+魇 124 v
+魈 28 x
+魉 53 x
+魍 38 x
+魍魅 3 n
+魍魉 16 n
+魍魍儿 3 z
+魎 6 zg
+魏 2010 nr
+魏三公 3 nr
+魏丑夫 5 nr
+魏丞相 2 nr
+魏中兴 2 nr
+魏为氏 5 nr
+魏主曹 19 nr
+魏主闻 3 nr
+魏久矣 2 nr
+魏之名 4 nr
+魏之战 2 nr
+魏之策 3 nr
+魏书 4 nr
+魏书生 3 nr
+魏了翁 3 nr
+魏五国 4 nr
+魏京生 2 nr
+魏仁君 3 nr
+魏伐 4 j
+魏伯阳 9 nr
+魏侍郎 2 nr
+魏俊仁 7 nr
+魏俊杰 3 nr
+魏信陵 10 nr
+魏允贞 4 nr
+魏元忠 4 nr
+魏元英 2 nr
+魏先生 3 nr
+魏克拉玛 2 nrt
+魏入楚 2 nr
+魏公公 109 nr
+魏公子 4 nr
+魏公孙 4 nr
+魏公村 2 nr
+魏兴郡 256 nr
+魏兵之 2 nr
+魏兵分 4 nr
+魏兵势 5 nr
+魏兵屯 3 nr
+魏兵弃 2 nr
+魏兵必 4 nr
+魏兵抢 2 nr
+魏兵方 4 nr
+魏兵皆 5 nr
+魏兵袭 2 nr
+魏兵见 2 nr
+魏兵骤 3 nr
+魏兵齐 2 nr
+魏其侯 4 nr
+魏军围 3 nr
+魏军夜 3 nr
+魏军惊 3 nr
+魏军见 2 nr
+魏分立 2 nr
+魏初行 3 nr
+魏华存 3 nr
+魏南凉 4 nr
+魏博牙 2 nr
+魏博遂 3 nr
+魏县 19 ns
+魏友枋 2 nr
+魏同超 2 nr
+魏名士 2 nr
+魏名徵 2 nr
+魏吴起 2 nr
+魏嘉平 2 nr
+魏围赵 3 nr
+魏国 165 ns
+魏国之 4 nr
+魏国信 2 nr
+魏国公 38 nr
+魏国变 3 nr
+魏国君 2 nr
+魏国大 5 nr
+魏国攻 3 nr
+魏国用 2 nr
+魏国百 2 nr
+魏国皮 2 nr
+魏圣美 19 nr
+魏在河 2 nr
+魏均田 2 nr
+魏塔线 2 nr
+魏塘镇 3 nr
+魏复盛 256 nr
+魏大中 6 nr
+魏大人 8 nr
+魏大军 5 nr
+魏大炮 16 nr
+魏大统 3 nr
+魏大铭 2 nr
+魏天兴 2 nr
+魏太和 17 nr
+魏太平 5 nr
+魏太武 31 nr
+魏太监 2 nr
+魏奔楚 2 nr
+魏子建 2 nr
+魏孝庄 2 nr
+魏孝文帝 63 nr
+魏孝明 4 nr
+魏孝武 3 nr
+魏学义 2 nr
+魏学曾 192 nr
+魏宏运 2 nr
+魏宗万 3 nr
+魏宗凯 3 nr
+魏定仁 5 nr
+魏定国 32 nr
+魏定族 2 nr
+魏宪辑 2 nr
+魏宫人 15 nr
+魏宫薄 2 nr
+魏家庄 11 nr
+魏小安 5 nr
+魏小飞 8 nr
+魏少游 2 nr
+魏尔伦 3 nr
+魏尔兰 6 nr
+魏尔德 3 nr
+魏尔斯 31 nr
+魏嵩平 4 nr
+魏巍 242 nr
+魏巍丈 15 nr
+魏巍业 2 nr
+魏巍义 3 nr
+魏巍卫 2 nr
+魏巍史 56 nr
+魏巍土 3 nr
+魏巍女 4 nr
+魏巍戈 4 nr
+魏巍支 10 nr
+魏巍文 45 nr
+魏巍正 3 nr
+魏巍盘 5 nr
+魏巍直 2 nr
+魏巍空 4 nr
+魏巍立 26 nr
+魏州昌 4 nr
+魏州至 2 nr
+魏州骄 3 nr
+魏平城 2 nr
+魏平澳 3 nr
+魏广微 23 nr
+魏延乃 2 nr
+魏延之 6 nr
+魏延入 2 nr
+魏延分 2 nr
+魏延各 4 nr
+魏延听 4 nr
+魏延复 2 nr
+魏延大 4 nr
+魏延守 3 nr
+魏延寨 2 nr
+魏延射 2 nr
+魏延引 17 nr
+魏延收 2 nr
+魏延断 2 nr
+魏延来 2 nr
+魏延背 2 nr
+魏延至 2 nr
+魏延表 2 nr
+魏延解 5 nr
+魏延领 8 nr
+魏建功 5 nr
+魏建国 5 nr
+魏建新 2 nr
+魏建晋 2 nr
+魏建猷 2 nr
+魏弘简 2 nr
+魏征 43 nr
+魏征奏 2 nr
+魏征好 2 nr
+魏征谢 2 nr
+魏律序 2 nr
+魏徵代 3 nr
+魏徵典 3 nr
+魏徵劝 3 nr
+魏徵卒 3 nr
+魏徵少 3 nr
+魏徵进 2 nr
+魏徵遂 3 nr
+魏德堡 2 nr
+魏德林 2 nr
+魏德迈 19 nr
+魏德运 7 nr
+魏德金 3 nr
+魏心镇 2 nr
+魏志勇 3 nr
+魏忠杰 4 nr
+魏忠贤 661 nr
+魏恩加 4 nr
+魏悼子 3 nr
+魏惠王 26 nr
+魏成子 4 nr
+魏我桓 2 nr
+魏拯民 3 nr
+魏振亮 2 nr
+魏振国 4 nr
+魏揭飞 5 vn
+魏收 24 nr
+魏收亦 2 nr
+魏收师 3 nr
+魏攻楚 3 nr
+魏攻秦 2 nr
+魏攻赵 4 nr
+魏攻韩 2 nr
+魏政权 5 nr
+魏敏芝 3 nr
+魏敦瑞 30 nr
+魏文侯 37 nr
+魏文候 4 nr
+魏文帝 46 nr
+魏文德 14 nr
+魏文成 2 nr
+魏文斌 4 nr
+魏文生 2 nr
+魏文长 2 nr
+魏斯埃 2 nr
+魏斯曼 21 nr
+魏旋风 2 nr
+魏无知 2 nr
+魏明伦 13 nr
+魏明帝 18 nr
+魏昭子 3 nr
+魏显忠 3 nr
+魏晋 608 nr
+魏晓东 2 nr
+魏景元 4 nr
+魏曹植 2 nr
+魏有二 2 nr
+魏有司 2 nr
+魏朝得 3 nr
+魏朝聘 2 nr
+魏末晋 3 nr
+魏末郦 2 nr
+魏权龄 2 nr
+魏柯嘉 3 nr
+魏格尔 9 nr
+魏格林 12 nr
+魏格纳 26 nr
+魏桓子 14 nr
+魏森博 2 nr
+魏武侯 8 nr
+魏武帝 26 nr
+魏武王 2 nr
+魏氏世 3 nr
+魏永忠 4 nr
+魏海力 2 nr
+魏清慧 214 nr
+魏清泉 12 nr
+魏源重 2 nr
+魏源集 3 nr
+魏特林 7 nr
+魏献安 3 nr
+魏献文 2 nr
+魏献温 3 nr
+魏王假 3 nr
+魏王太子 2 nr
+魏王弼 2 nr
+魏王旨 2 nr
+魏王泰 4 nr
+魏王豹 6 nr
+魏玛 94 nr
+魏瓦地 3 nr
+魏皆取 2 nr
+魏皇帝 11 nr
+魏相楚 2 nr
+魏相魏 2 nr
+魏碑 18 nr
+魏礼群 3 nr
+魏禧 7 nrt
+魏秋月 5 nr
+魏秋桦 3 nr
+魏移治 2 nr
+魏紫姚黄 3 nr
+魏続 3 t
+魏红涛 2 nr
+魏纪中 3 nr
+魏绍旭 2 nr
+魏置秀 2 nr
+魏老大 3 nr
+魏联军 7 j
+魏自道 3 nr
+魏良卿 2 nr
+魏良辅 10 nr
+魏茨 10 nrt
+魏茨泽克 5 nr
+魏荣爵 3 nr
+魏菲尔 2 nr
+魏薏梅 3 v
+魏蜀吴 2 nr
+魏裔介 3 nr
+魏襄王 16 nr
+魏设江 2 nr
+魏贾诩 2 nr
+魏赤娅 6 nr
+魏运亨 5 nr
+魏遂沿 3 nr
+魏道明 3 nr
+魏道武 36 nr
+魏郡元 3 nr
+魏都区 8 ns
+魏都洛 2 nr
+魏都赋 2 nr
+魏都邺 2 nr
+魏金斯 9 nr
+魏金玉 2 nr
+魏铭言 2 nr
+魏长生 9 nr
+魏长贤 3 nr
+魏阙 10 nr
+魏降梁 2 nr
+魏雪漫 3 nr
+魏青刚 3 nr
+魏青龙 2 nr
+魏颗结草 3 nr
+魏香颖 2 nr
+魏骏杰 3 nr
+魏高允 2 nr
+魏鹊无枝 3 v
+魏鹤龄 5 nr
+魏黄初 2 nr
+魏黄姚 2 nr
+魐 141 zg
+魑 169 g
+魑魅 5 n
+魑魅罔两 3 i
+魑魅魍魉 11 i
+魔 3172 n
+魔仙 3 n
+魔党刊 3 n
+魔兽 63 n
+魔兽争霸 3 i
+魔兽版 3 n
+魔军 3 n
+魔剑 3 n
+魔剑士 3 n
+魔力 90 n
+魔力宝贝 3 n
+魔咒 3 n
+魔堡 3 n
+魔塔 3 n
+魔境 3 n
+魔头 344 n
+魔奇 3 n
+魔女 3 n
+魔女传 3 n
+魔存 3 n
+魔宫 3 n
+魔导 3 n
+魔导器 3 n
+魔导师 3 n
+魔导石 3 n
+魔岩 5 n
+魔幻 40 n
+魔幻现实主义 14 n
+魔影 8 n
+魔怪 9 n
+魔戒 3 n
+魔战记 3 n
+魔手 6 n
+魔掌 25 n
+魔教 631 n
+魔方 26 n
+魔晶石 3 n
+魔术 170 n
+魔术家 3 n
+魔术师 73 n
+魔术节 3 n
+魔术队 3 n
+魔杖 22 n
+魔棒 7 n
+魔毡 3 n
+魔池 3 n
+魔法 76 n
+魔法书 3 n
+魔法值 3 n
+魔法力 3 n
+魔法师 7 n
+魔法盾 3 n
+魔法石 3 n
+魔法门 3 n
+魔法阵 3 n
+魔爪 43 n
+魔犬 3 n
+魔王 278 n
+魔瓶 3 n
+魔电 3 n
+魔界 3 n
+魔界村 3 n
+魔盒 3 n
+魔盘 3 n
+魔眼 3 n
+魔石 3 n
+魔神 3 n
+魔神剑 3 n
+魔神王 3 n
+魔窟 15 n
+魔羯 3 nz
+魔羯座 3 nz
+魔芋 74 n
+魔衣橱 3 n
+魔装 3 n
+魔道 3 n
+魔邪 3 n
+魔里红 3 n
+魔铃 3 n
+魔镜 23 n
+魔防 3 n
+魔障 30 n
+魔音 3 n
+魔音穿脑 3 n
+魔高一丈 9 i
+魔高一尺 5 i
+魔鬼 386 n
+魔鬼列车 3 n
+魔鬼城 3 n
+魔鬼天使 3 i
+魔鬼怪 2 i
+魔鬼猪 3 n
+魔鬼般 3 i
+魔鬼身材 3 i
+魔鬼连 3 i
+魔魂 3 n
+魚 12 zg
+魜 10 zg
+魟 26 zg
+魣 3 zg
+魦 1147 zg
+魰 106 zg
+鮄 11 zg
+鮈 7 zg
+鮊 5 zg
+鮋 13 zg
+鮌 3 zg
+鮛 41 zg
+鮝 2 zg
+鮟 28 zg
+鮠 1035 zg
+鮣 14 zg
+鮤 17 zg
+鮨 2 zg
+鮺 10 zg
+鮻 3 zg
+鯈 3 zg
+鯒 7 zg
+鯪 104 zg
+鯭 12 zg
+鯯 21 zg
+鯵 13 zg
+鯷 9 zg
+鯷鱼 3 v
+鯺 2 zg
+鯼 12 zg
+鯾 4 zg
+鰁 515 zg
+鰃 22 zg
+鰏 4 zg
+鰐 9 zg
+鰕 14 zg
+鰛 3 zg
+鰯 6 zg
+鰱 28 zg
+鰶 4 zg
+鰾 3 zg
+鱀 20 zg
+鱂 7 zg
+鱇 28 zg
+鱊 19 zg
+鱏 15 zg
+鱑 5 zg
+鱓 7 zg
+鱗 2 zg
+鱚 8 zg
+鱡 7 zg
+鱤 3 zg
+鱥 4 zg
+鱩 8 zg
+鱵 5 zg
+鱺 5 zg
+鱼 16190 n
+鱼与熊掌 6 i
+鱼业 3 n
+鱼丝 3 n
+鱼丸 6 n
+鱼丸子 3 nr
+鱼丸汤 3 nr
+鱼主 2 n
+鱼之乐 3 nr
+鱼乐 2 n
+鱼乐国 3 n
+鱼书雁信 3 nr
+鱼书雁帖 3 nr
+鱼书雁帛 3 nr
+鱼亚目 6 nr
+鱼亚科 16 nr
+鱼亚纲 14 nr
+鱼产 3 n
+鱼介 3 n
+鱼传尺素 3 n
+鱼体 10 n
+鱼体色 3 n
+鱼儿 148 n
+鱼具 3 n
+鱼冻 4 n
+鱼刺 33 n
+鱼化石 3 nr
+鱼化龙 4 nr
+鱼升龙门 3 n
+鱼卵 18 n
+鱼原 256 n
+鱼叉 93 nr
+鱼口 8 n
+鱼台 7 n
+鱼台县 3 ns
+鱼叶 5 n
+鱼同伏 2 nr
+鱼同飞 2 nr
+鱼品 6 n
+鱼唇 3 n
+鱼场 3 n
+鱼块 3 n
+鱼塘 121 n
+鱼复山 3 nr
+鱼复诸 3 nr
+鱼大水小 3 n
+鱼头 310 n
+鱼头汤 3 n
+鱼子 13 n
+鱼子酱 12 n
+鱼宴馆 6 nr
+鱼封雁帖 3 nr
+鱼小虾 5 nr
+鱼尾 294 n
+鱼尾板 2 n
+鱼尾狮 2 nr
+鱼尾狮公园 2 n
+鱼尾纹 31 nr
+鱼尾雁行 3 nr
+鱼峰 2 nr
+鱼峰区 3 n
+鱼市 29 n
+鱼帛狐声 3 nr
+鱼库 2 n
+鱼弘志 2 nr
+鱼弦 2 n
+鱼形 18 n
+鱼惊鸟散 3 i
+鱼排 3 n
+鱼朝恩 20 nr
+鱼杆 3 n
+鱼村 3 n
+鱼松 259 nr
+鱼死网破 27 i
+鱼水 31 n
+鱼水之 2 nr
+鱼水之欢 3 i
+鱼水和谐 3 nr
+鱼水情 11 n
+鱼水情深 9 i
+鱼水深情 4 i
+鱼水相 3 nr
+鱼水相投 3 i
+鱼水相欢 3 i
+鱼水相逢 3 i
+鱼氽元 256 v
+鱼汁 2 n
+鱼汛 267 n
+鱼池 549 n
+鱼汤 90 n
+鱼沉雁杳 3 nr
+鱼沉雁渺 3 nr
+鱼沉雁落 3 i
+鱼沉雁静 3 nr
+鱼沉鸿断 3 i
+鱼河堡 3 nr
+鱼油 48 n
+鱼沼飞 2 nr
+鱼泡 4 n
+鱼游沸釜 3 i
+鱼游沸鼎 3 i
+鱼游濠上 3 nr
+鱼游燋釜 3 n
+鱼游釜中 3 i
+鱼游釜内 3 i
+鱼游釜底 3 i
+鱼溃鸟散 3 n
+鱼溃鸟离 3 n
+鱼漂 3 n
+鱼烂取亡 3 i
+鱼烂土崩 3 i
+鱼烂河决 3 i
+鱼烂瓦解 3 i
+鱼烂而亡 3 i
+鱼烂虾 4 nr
+鱼片 18 n
+鱼狗 5 nr
+鱼珠 8 n
+鱼生 6 n
+鱼生空釜 3 n
+鱼白 4 nr
+鱼皮 3 n
+鱼盐 10 n
+鱼盐之利 3 nr
+鱼目 35 n
+鱼目帆 4 nr
+鱼目混珍 3 i
+鱼目混珎 3 nr
+鱼目混珠 19 i
+鱼目间珠 3 n
+鱼眼 17 n
+鱼瞵鹗睨 3 v
+鱼石脂 3 n
+鱼石螈 3 nr
+鱼礁 4 n
+鱼种 1573 n
+鱼科 18 nr
+鱼科旗 2 nr
+鱼秧 3 n
+鱼秧子 3 n
+鱼端 2 n
+鱼竿 8 n
+鱼符 8 n
+鱼笺雁书 3 vn
+鱼箭 2 n
+鱼箱 3 n
+鱼篓 21 n
+鱼篮 2 n
+鱼米之乡 55 i
+鱼米之地 3 i
+鱼米之献 3 nr
+鱼米乡 4 nr
+鱼类 2987 n
+鱼类学 7 n
+鱼粉 35 n
+鱼精 2 n
+鱼精蛋白 3 n
+鱼纹 3 n
+鱼线 10 n
+鱼缸 31 n
+鱼网 35 n
+鱼网鸿离 3 nr
+鱼美人 3 nr
+鱼群 92 n
+鱼翅 312 n
+鱼翅羹 3 nr
+鱼肉 131 n
+鱼肉乡民 3 n
+鱼肉乡里 10 i
+鱼肉人民 3 n
+鱼肉百姓 3 i
+鱼肚 2077 n
+鱼肚白 8 n
+鱼肝 3 n
+鱼肝油 49 n
+鱼肠 13 n
+鱼肠剑 18 nr
+鱼肠尺素 3 n
+鱼肠雁足 3 nr
+鱼胶 8 n
+鱼胶粉 3 n
+鱼腥 3 n
+鱼腥味 8 n
+鱼腥草 18 n
+鱼腩 6 nr
+鱼腰 3 n
+鱼腹 23 n
+鱼船 3 n
+鱼花 259 n
+鱼苗 1839 n
+鱼藤 5 nr
+鱼藤酮 4 n
+鱼藻宫 2 nr
+鱼虞模 2 nr
+鱼虫 17 n
+鱼虾 157 n
+鱼蛋 3 n
+鱼装 2 n
+鱼貂 3 n
+鱼质龙文 3 n
+鱼贩 41 n
+鱼贩头子 3 n
+鱼贩子 9 n
+鱼贯 66 nr
+鱼贯登 2 nr
+鱼贯而 4 nr
+鱼贯而入 24 i
+鱼贯而出 3 i
+鱼贯而行 4 i
+鱼贯进 3 nr
+鱼贯阵 4 nr
+鱼贯雁比 3 nr
+鱼贯雁行 3 nr
+鱼跃 14 nr
+鱼跃鸢飞 3 vn
+鱼跃龙门 4 nr
+鱼迹 2 n
+鱼道 3 n
+鱼酱 3 n
+鱼钩 28 n
+鱼镖 2 n
+鱼际 16 n
+鱼际部 4 n
+鱼雁往返 3 nr
+鱼雷 1007 nr
+鱼雷快艇 12 n
+鱼雷舰 3 nr
+鱼雷艇 88 nr
+鱼露 2 nr
+鱼食 9 n
+鱼饲料 3 n
+鱼饵 22 n
+鱼馁肉败 3 nz
+鱼香肉丝 8 nr
+鱼香茄子 3 n
+鱼骨 64 n
+鱼骨冠 2 nr
+鱼骨天线 3 n
+鱼骨头 3 n
+鱼骨庙 31 nr
+鱼鱼雅雅 3 nr
+鱼鲁帝虎 3 nr
+鱼鲜 9 ns
+鱼鳃 3 n
+鱼鳍 8 n
+鱼鳔 5 n
+鱼鳖 13 n
+鱼鳞 110 n
+鱼鳞图册 3 i
+鱼鳞坑 3 n
+鱼鳞松 10 nr
+鱼鳞片 3 n
+鱼鳞状 4 nr
+鱼鳞病 3 nr
+鱼鳞癣 3 n
+鱼鹰 66 nr
+鱼鼓 3 n
+鱼龙 79 nr
+鱼龙变化 2 l
+鱼龙曼延 3 nr
+鱼龙曼羡 3 nr
+鱼龙曼衍 3 nr
+鱼龙混杂 22 i
+鱼龙漫衍 3 nr
+鱼龙百变 3 i
+鱽 4 zg
+鱿 152 n
+鱿鱼 336 n
+鱿鱼丝 3 n
+鱿鱼干 3 n
+鱿鱼片 3 n
+鲀 55 zg
+鲁 1594 nr
+鲁不花 2 nr
+鲁世家 14 nrfg
+鲁中南 10 nr
+鲁为氏 2 nr
+鲁乃湖 2 nr
+鲁之公 2 nr
+鲁之君 2 nr
+鲁之孙 2 nr
+鲁人回日 3 i
+鲁什 8 nrt
+鲁仲连 7 nr
+鲁伊兹 3 nr
+鲁伊斯 6 nr
+鲁伊科 2 nr
+鲁伍马 2 nr
+鲁伯特 3 nr
+鲁伯鲁 3 nr
+鲁佐将军 5 nr
+鲁僖公 6 nr
+鲁儿虎 6 nr
+鲁元公主 5 nr
+鲁克山 2 nr
+鲁克往 2 nr
+鲁克斯 7 nr
+鲁克林 4 nr
+鲁克沁 4 nr
+鲁克湖 3 nr
+鲁克至 2 nr
+鲁公伯 2 nr
+鲁公礼 3 nr
+鲁典吏 2 nr
+鲁兹派 3 nr
+鲁内莱 2 nr
+鲁冠球 23 nr
+鲁冰花 3 nr
+鲁凯族 3 nr
+鲁利亚 5 nr
+鲁剌氏 3 nr
+鲁勃极 2 nr
+鲁勉采 5 nr
+鲁北 6 ns
+鲁北平 2 nr
+鲁南 56 ns
+鲁南区 3 ns
+鲁卜哈 11 nr
+鲁卫之政 3 nr
+鲁史 3 nr
+鲁吉亚 2 nr
+鲁君 7 nr
+鲁呼奴 3 nr
+鲁哀公 6 nr
+鲁国 89 ns
+鲁国为 2 nr
+鲁国公 8 nr
+鲁图斯 4 nr
+鲁坤 3 nrfg
+鲁塞尔 2 nr
+鲁塞德 6 nr
+鲁大哥 7 nr
+鲁夸湖 2 nr
+鲁子敬 10 nr
+鲁孙意 3 nr
+鲁宗润 3 nr
+鲁定公 7 nr
+鲁宣公 3 nr
+鲁宾 19 nr
+鲁宾孙 10 nr
+鲁宾斯坦 7 nrt
+鲁宾逊 10 nr
+鲁尔 42 nr
+鲁尔区 31 nr
+鲁尔河 11 nr
+鲁尼亚 3 nr
+鲁山 47 nr
+鲁山县 8 ns
+鲁州 3 ns
+鲁巴族 4 nr
+鲁巴语 4 nr
+鲁布革 4 nr
+鲁师伯 3 nr
+鲁师兄 3 nr
+鲁帮主 41 nr
+鲁庄公 7 nr
+鲁庄公子 3 nr
+鲁库阿 2 nr
+鲁德艾 2 nr
+鲁志枢 2 n
+鲁忽乃 7 nr
+鲁忽赤 40 nr
+鲁思东 2 nr
+鲁思汗 8 nr
+鲁恭王 3 nr
+鲁惠民 3 nr
+鲁戈回日 3 nr
+鲁戈挥日 3 nz
+鲁成 3 nrfg
+鲁才全 11 nr
+鲁托斯 2 nr
+鲁拜诗 3 nr
+鲁接界 2 nr
+鲁提菲 7 nr
+鲁攻银 2 nr
+鲁故帮 4 nr
+鲁文佐 7 nr
+鲁斋郎 2 nr
+鲁斤燕削 3 n
+鲁斯之 2 nr
+鲁斯兰 15 nr
+鲁斯卡 13 nr
+鲁斯图 3 nr
+鲁斯坎 16 nr
+鲁斯坦 5 nr
+鲁斯塔 4 nr
+鲁昂 21 nr
+鲁明善 4 nr
+鲁昭公 6 nr
+鲁晓冬 8 nr
+鲁晓夫 2 nr
+鲁普努 2 nr
+鲁普奖 2 nz
+鲁普莱 7 nr
+鲁智深 327 nrfg
+鲁有脚 168 nr
+鲁本 5 ns
+鲁本斯 32 nr
+鲁本辛 3 nr
+鲁朵之 3 nr
+鲁朵制 4 nr
+鲁杰罗 4 nr
+鲁格海德 26 nr
+鲁桂成 256 nr
+鲁桓公 4 nr
+鲁桥镇 4 nr
+鲁梅哈 2 nr
+鲁梅尼 9 nr
+鲁棒性 7 nr
+鲁棒控制 3 nz
+鲁殿灵光 3 nr
+鲁比 6 j
+鲁比亚 9 nr
+鲁毕克 2 nr
+鲁沙尔镇 4 ns
+鲁法洛 2 nr
+鲁济济 5 nr
+鲁涤平 7 nr
+鲁滨孙 11 nr
+鲁滨州 3 nr
+鲁滨逊 29 nr
+鲁火者 4 nr
+鲁火赤 2 nr
+鲁灵光殿 3 nr
+鲁灵敏 3 nr
+鲁特兵 2 nr
+鲁特旗 9 nr
+鲁特氏 128 nr
+鲁玉瓷 2 nr
+鲁王子 2 nr
+鲁王朱 2 nr
+鲁王爷 9 nr
+鲁王监 4 nr
+鲁王部 2 nr
+鲁王霸 6 nr
+鲁珀特 6 nrt
+鲁班 38 nr
+鲁班奖 5 nz
+鲁班尺 3 nr
+鲁班爷 3 nr
+鲁班路 3 ns
+鲁班锁 2 nr
+鲁瓦尔 2 nr
+鲁男子 3 nr
+鲁甸 2 ns
+鲁甸县 3 ns
+鲁番 5 ns
+鲁登堡 2 nr
+鲁登道 17 nr
+鲁监国 11 nr
+鲁盖尔 9 nr
+鲁真公 2 nr
+鲁磨路 256 nr
+鲁禾帖 13 nr
+鲁穆公 2 nr
+鲁简梁 2 nr
+鲁米诺 3 nr
+鲁索普 2 nr
+鲁纳斯 5 nr
+鲁群生 2 nr
+鲁老爷 2 nr
+鲁老者 4 nr
+鲁肃 121 nr
+鲁肃入 7 nr
+鲁肃引 4 nr
+鲁肃相 2 nr
+鲁肃荐 2 nr
+鲁肃见 2 nr
+鲁肃责 2 nr
+鲁肃遂 2 nr
+鲁肃领 2 nr
+鲁能泰山 71 nr
+鲁能泰山队 8 nz
+鲁能队 29 nr
+鲁至魏 2 nr
+鲁花赤 2 nr
+鲁茨 15 nrt
+鲁莽 211 nr
+鲁莽地 3 nr
+鲁莽灭裂 3 n
+鲁莽行事 3 nr
+鲁菜 8 nr
+鲁蒙德 2 nr
+鲁藏布 3 nr
+鲁襄公 3 nr
+鲁西北 12 ns
+鲁西南 64 ns
+鲁西尔 2 nr
+鲁西永 2 nr
+鲁西洛 2 nr
+鲁西费 2 nr
+鲁讯 4 nz
+鲁语 6 nz
+鲁诸道 2 nr
+鲁谒居 2 nr
+鲁谟斯 18 nr
+鲁豫巡 5 nr
+鲁豫有约 3 nr
+鲁贝尔 5 nr
+鲁贡玛 3 nr
+鲁达基 10 nr
+鲁迅 1507 nr
+鲁迅公园 4 nr
+鲁迅博物馆 5 ns
+鲁迅故居 7 nr
+鲁迅文学奖 10 nz
+鲁迅文学院 2 nt
+鲁迅研究 3 nr
+鲁迅美术学院 2 nt
+鲁迈拉 3 nr
+鲁连荣 10 nr
+鲁连蹈海 3 i
+鲁道夫 28 nr
+鲁那颜 2 nr
+鲁邦多 2 nr
+鲁里亚 20 nr
+鲁钝 31 a
+鲁银投资 6 j
+鲁长老 42 nr
+鲁阳回日 3 ns
+鲁阳挥戈 3 nr
+鲁阳挥日 3 nz
+鲁阳麾戈 3 v
+鲁院长 2 nr
+鲁难未已 2 i
+鲁飞尼 4 nr
+鲁马河 2 nr
+鲁鱼亥豕 3 i
+鲁鱼帝虎 3 nr
+鲁鱼陶阴 3 ns
+鲁麻子 4 nr
+鲁齐齐 4 nr
+鲂 110 g
+鲂鱼赪尾 3 vn
+鲃 7 zg
+鲅 33 ns
+鲅鱼 13 n
+鲅鱼圈 4 ns
+鲅鱼圈区 3 n
+鲆 108 g
+鲇 142 n
+鲇鱼 297 n
+鲇鱼上竹 3 n
+鲇鱼上竿 3 n
+鲈 133 g
+鲈形目 53 n
+鲈鱼 31 n
+鲉 22 zg
+鲊 4 zg
+鲋 66 g
+鲌 276 zg
+鲍 325 nr
+鲍丘水 4 nr
+鲍二媳妇 2 nr
+鲍仲良 8 nr
+鲍伊诺克 3 nrt
+鲍利斯 4 nr
+鲍勒尔 2 nr
+鲍千灵 34 nr
+鲍卉芳 4 nr
+鲍参军 4 nr
+鲍叔牙 7 nr
+鲍国安 3 nr
+鲍国宝 2 nr
+鲍大志 3 nr
+鲍大楚 69 nr
+鲍姆加登 3 nr
+鲍威尔 58 nr
+鲍子知我 3 nr
+鲍尔斯 7 nr
+鲍尔森 3 nr
+鲍尔温 2 nr
+鲍尔默 56 nr
+鲍峡镇 3 nr
+鲍崇德 6 nr
+鲍廷博 4 nr
+鲍彻格 3 nr
+鲍德主 2 nr
+鲍德温 18 nr
+鲍德里 2 nr
+鲍德里亚 3 nrt
+鲍恩斯 4 nr
+鲍恩氏 3 nr
+鲍承先 11 nr
+鲍敬言 3 nr
+鲍文岳 7 nr
+鲍文玉 2 nr
+鲍旭引 2 nr
+鲍旭挺 2 nr
+鲍明刚 3 nr
+鲍春来 276 nr
+鲍曼氏 2 nr
+鲍曼高 2 nr
+鲍格丹 2 nr
+鲍格米 2 nr
+鲍桑尼 82 nr
+鲍桑葵 3 n
+鲍比 3 nrt
+鲍比达 3 nr
+鲍永珍 3 nr
+鲍泰利 4 nr
+鲍洪俊 7 nr
+鲍海楠 4 nr
+鲍海鸣 3 nr
+鲍狄埃 5 nr
+鲍绍雄 3 nr
+鲍罗丁 5 nr
+鲍罗夫 3 nr
+鲍罗廷 91 nr
+鲍罗斯 8 nr
+鲍老板 2 nr
+鲍耶 9 nr
+鲍蒂兹 2 nr
+鲍起静 3 nr
+鲍里斯 21 nr
+鲍长老 15 nr
+鲍鱼 54 nr
+鲍鱼之次 3 i
+鲍鱼之肆 7 i
+鲎 125 g
+鲎试验 3 vn
+鲏 15 zg
+鲐 35 g
+鲑 90 n
+鲑精 3 n
+鲑精蛋白 3 n
+鲑鱼 56 n
+鲒 5 g
+鲔 20 g
+鲕 20 g
+鲖 56 zg
+鲙 2 zg
+鲚 39 g
+鲛 271 g
+鲛绡 5 n
+鲜 2563 n
+鲜为人知 89 i
+鲜丽 20 a
+鲜之意 8 i
+鲜于 39 v
+鲜于通 47 nr
+鲜亮 70 a
+鲜儿 2 n
+鲜克有终 3 nr
+鲜切花 6 z
+鲜卑 796 n
+鲜卑语 4 nz
+鲜叶 7 n
+鲜味 42 n
+鲜品 263 n
+鲜奶 39 n
+鲜奶油 3 n
+鲜姜 3 n
+鲜嫩 348 a
+鲜嫩嫩 3 z
+鲜少 3 a
+鲜度 2 n
+鲜廉寡耻 3 i
+鲜彩 3 a
+鲜明 1521 a
+鲜明个性 3 n
+鲜明主题 3 n
+鲜明对比 3 n
+鲜明形象 3 n
+鲜明性 2 n
+鲜明特征 3 nr
+鲜明特点 3 n
+鲜明立场 3 n
+鲜明风格 3 n
+鲜有 319 v
+鲜果 52 n
+鲜果汁 3 n
+鲜桃 3 n
+鲜榨 3 v
+鲜橙 3 n
+鲜橙多 9 z
+鲜橙汁 3 nr
+鲜水河 4 nr
+鲜汤 14 n
+鲜活 178 a
+鲜润 7 n
+鲜灵灵 2 nr
+鲜爽 4 a
+鲜牛奶 24 n
+鲜状 2 n
+鲜甜嫩 2 z
+鲜眉亮眼 3 i
+鲜碧楼 2 nr
+鲜竹沥 3 nr
+鲜笋 4 n
+鲜粉红色 3 n
+鲜红 537 z
+鲜红色 51 n
+鲜绿 10 z
+鲜绿色 6 n
+鲜美 1014 a
+鲜肉 65 n
+鲜艳 589 a
+鲜艳夺目 36 i
+鲜艳艳 3 nr
+鲜花 1102 n
+鲜花丛 2 n
+鲜花店 3 n
+鲜花礼品 3 n
+鲜花网 3 n
+鲜花茶 3 nr
+鲜花蛋糕 3 n
+鲜茧 3 n
+鲜草 15 n
+鲜荷叶 3 nr
+鲜菇 3 n
+鲜菊花 3 nr
+鲜菜 21 n
+鲜蘑 2 n
+鲜虞亭 3 nr
+鲜虞氏 2 nr
+鲜虞郡 2 nr
+鲜虾 3 n
+鲜蛋 7 n
+鲜血 1956 n
+鲜血淋漓 136 i
+鲜衣怒马 5 i
+鲜衣美食 3 n
+鲜衣良马 3 nr
+鲜见 53 a
+鲜话 3 n
+鲜贝 3 n
+鲜货 10 n
+鲜蹦活跳 3 l
+鲜车健马 3 n
+鲜车怒马 3 i
+鲜酵母 3 n
+鲜重 3 a
+鲜食 60 n
+鲜食蕉 2 n
+鲜鱼 58 n
+鲜鲜 3 a
+鲜黄 7 z
+鲜龙活 11 nr
+鲝 18 zg
+鲞 14 g
+鲟 34 g
+鲟鱼 539 n
+鲠 10 a
+鲠慰 3 a
+鲠直 6 a
+鲠言 3 a
+鲡 3 x
+鲢 840 n
+鲢鱼 19 n
+鲣 21 n
+鲣鱼 3 n
+鲣鸟 19 n
+鲤 535 nz
+鲤城区 9 n
+鲤科 49 nz
+鲤素 3 n
+鲤跃龙门 3 nz
+鲤鱼 355 nz
+鲤鱼打挺 21 i
+鲤鱼池 3 n
+鲤鱼潭 3 ns
+鲤鱼门 3 n
+鲥 15 n
+鲥鱼 325 n
+鲦 9 x
+鲧 130 g
+鲨 516 n
+鲨烯 9 n
+鲨肝醇 3 n
+鲨鱼 387 n
+鲨鱼肉 3 n
+鲩 267 g
+鲪 3 zg
+鲫 95 n
+鲫鱼 69 n
+鲫鱼汤 3 n
+鲭 42 g
+鲮 22 n
+鲮鱼 9 n
+鲮鲤 10 n
+鲰 2 g
+鲱 67 n
+鲱鱼 46 n
+鲲 31 n
+鲲鹏 9 n
+鲲鹏展翅 3 v
+鲳 16 n
+鲳鱼 24 n
+鲴 21 g
+鲵 50 g
+鲶 15 n
+鲶鱼 268 n
+鲷 59 g
+鲷类 3 n
+鲷鱼 12 n
+鲸 427 ng
+鲸吞 29 v
+鲸吞虎据 3 n
+鲸吞蚕食 3 n
+鲸吸牛饮 3 n
+鲸油 6 n
+鲸波怒浪 3 n
+鲸波鼍浪 3 vn
+鲸涛鼍浪 3 vn
+鲸蜡 2 n
+鲸须 3 n
+鲸骨 23 n
+鲸鱼 50 n
+鲸鲨 8 n
+鲹 5 zg
+鲺 5 g
+鲻 31 g
+鲼 37 g
+鲽 47 g
+鲽离鹣背 3 v
+鲾 8 zg
+鲿 26 zg
+鳀 26 zg
+鳁 15 zg
+鳂 6 zg
+鳃 492 n
+鳃裂 25 v
+鳃裂囊肿 3 n
+鳄 727 ng
+鳄梨 3 n
+鳄梨糖醇 3 n
+鳄鱼 182 n
+鳄鱼恤 3 n
+鳄鱼泪 3 n
+鳄鱼湖 2 n
+鳄鱼皮 3 n
+鳄鱼眼泪 3 n
+鳄鱼衫 3 n
+鳅 77 x
+鳇 7 n
+鳇鱼 520 n
+鳉 20 zg
+鳊 39 n
+鳊鱼 260 n
+鳋 2 zg
+鳌 959 g
+鳌园 4 n
+鳌头 4 n
+鳌头独占 3 ns
+鳌山 53 ns
+鳌峰 3 n
+鳌愤龙愁 3 n
+鳌拜 3 ns
+鳌掷鲸吞 3 n
+鳌掷鲸呿 3 nr
+鳌里夺尊 3 n
+鳌鸣鳖应 3 n
+鳍 548 n
+鳍线 3 n
+鳎 249 g
+鳏 16 n
+鳏夫 8 n
+鳏寡 3 n
+鳏寡孤惸 3 i
+鳏寡孤独 8 i
+鳏寡惸独 3 i
+鳏寡茕独 3 v
+鳏居 3 n
+鳏鱼渴凤 3 i
+鳐 49 g
+鳑 15 zg
+鳒 7 zg
+鳓 15 g
+鳔 571 n
+鳔胶 3 n
+鳕 94 n
+鳕鱼 49 n
+鳖 481 n
+鳖状 3 n
+鳖甲 8 n
+鳖精 3 n
+鳖肉 3 n
+鳖边 3 n
+鳖鱼 3 n
+鳗 111 n
+鳗鱼 44 n
+鳗鲡 68 n
+鳘 5 g
+鳙 1074 n
+鳙鱼 2 n
+鳚 17 zg
+鳛 14 zg
+鳜 39 n
+鳜鱼 278 n
+鳝 68 n
+鳝鱼 31 n
+鳞 1427 n
+鳞介 3 n
+鳞伤 3 n
+鳞叶 3 n
+鳞屑 16 n
+鳞形 3 n
+鳞次 3 n
+鳞次栉比 66 i
+鳞次相比 3 i
+鳞次节比 3 i
+鳞比 3 n
+鳞毛 3 n
+鳞波 3 n
+鳞爪 4 n
+鳞片 234 n
+鳞片状 3 n
+鳞甲 58 n
+鳞癌 3 n
+鳞翅目 81 n
+鳞茎 49 n
+鳞萃比栉 3 nr
+鳞集 3 n
+鳞集仰流 3 n
+鳞集毛萃 3 i
+鳞鳞 3 n
+鳟 18 n
+鳟鱼 13 n
+鳡 7 zg
+鳢 11 g
+鳣 2 zg
+鳴 2 zg
+鳶 11 zg
+鳷 4 zg
+鳾 5 zg
+鴃舌 3 v
+鴏 3 zg
+鴐 3 zg
+鴗 5 zg
+鴙 109 zg
+鴡 5 zg
+鴢 12 zg
+鴪 2 zg
+鴭 2 zg
+鴴 4 zg
+鴷 2 zg
+鵏 2 zg
+鵐 3 zg
+鵖 18 zg
+鵚 7 zg
+鵞 467 zg
+鵣 12 zg
+鵩 4 zg
+鵰 17 zg
+鵰悍 3 i
+鵽 18 zg
+鶊 14 zg
+鶑 5 zg
+鶒 8 zg
+鶗 46 zg
+鶗鴂雕卉 3 n
+鶴 555 zg
+鶹 22 zg
+鶺 9 zg
+鶺鴒 3 z
+鷁 52 zg
+鷃 2 zg
+鷇音 3 vn
+鷈 3 zg
+鷉 2 zg
+鷋 3 zg
+鷓 2 zg
+鷟 2 zg
+鷭 3 zg
+鷯 3 zg
+鷶 18 zg
+鸂 8 zg
+鸊 2 zg
+鸑 48 zg
+鸓 10 zg
+鸔 16 zg
+鸛 3 zg
+鸜 9 zg
+鸞 14 zg
+鸟 3048 zg
+鸟为食亡 3 i
+鸟之诗 3 n
+鸟人 3 n
+鸟伏兽穷 3 i
+鸟儿 282 n
+鸟入樊笼 3 nr
+鸟兽 112 n
+鸟兽散 7 i
+鸟冠 3 n
+鸟协 3 n
+鸟叫 3 v
+鸟叫声 3 n
+鸟哭猿啼 3 i
+鸟啭 3 v
+鸟啼 14 n
+鸟啼花怨 3 i
+鸟啼花落 3 i
+鸟嘌呤 5 n
+鸟嘌呤酶 3 n
+鸟嘴 3 n
+鸟园 3 n
+鸟声 27 n
+鸟声兽心 3 i
+鸟头 3 n
+鸟媒 3 n
+鸟媒花 3 n
+鸟害 2 n
+鸟尽弓藏 14 i
+鸟居 3 n
+鸟屋 3 n
+鸟山名 3 n
+鸟山明 3 nz
+鸟岛 50 n
+鸟巢 60 n
+鸟巢蕨 3 n
+鸟巣 3 v
+鸟市 9 n
+鸟店 3 n
+鸟得弓藏 3 i
+鸟惊鱼散 3 i
+鸟惊鱼溃 3 i
+鸟惊鱼骇 3 n
+鸟惊鼠窜 3 i
+鸟散 3 v
+鸟散鱼溃 3 i
+鸟松 3 n
+鸟林 3 n
+鸟枪 30 n
+鸟枪换炮 7 n
+鸟枪换砲 3 n
+鸟枪法 3 n
+鸟气 3 n
+鸟氨酸 3 n
+鸟浴 3 n
+鸟焚鱼烂 3 nr
+鸟爪 3 n
+鸟瞰 704 v
+鸟瞰图 3 n
+鸟穷则啄 3 i
+鸟窝 28 n
+鸟窝式 3 n
+鸟笼 53 n
+鸟笼子 21 n
+鸟类 873 n
+鸟类学 5 n
+鸟类学家 5 n
+鸟粪 24 n
+鸟粪层 9 n
+鸟纲 3 n
+鸟群 19 n
+鸟翼 3 n
+鸟苷 8 n
+鸟苷蛋白 3 n
+鸟苷酸 4 n
+鸟蛋 53 n
+鸟蛤 3 n
+鸟覆危巢 3 i
+鸟语 35 nz
+鸟语林 4 n
+鸟语花香 40 n
+鸟跩 3 v
+鸟迷 3 n
+鸟迹虫丝 3 n
+鸟道羊肠 3 n
+鸟铳 32 n
+鸟雀 61 n
+鸟集鳞萃 3 i
+鸟面鹄形 3 i
+鸟革翚飞 3 v
+鸟食 3 n
+鸟骇鼠窜 3 i
+鸟鸟 3 n
+鸟鸣 63 v
+鸟龙 10 nz
+鸠 768 nr
+鸠僭鹊巢 3 i
+鸠占鹊巢 4 i
+鸠夺鹊巢 3 i
+鸠尾峡 3 nr
+鸠尾形 3 nr
+鸠居鹊巢 3 i
+鸠山 6 nr
+鸠山由纪夫 2 nr
+鸠工庀材 3 v
+鸠形鹄面 3 i
+鸠摩智 3 nr
+鸠江区 3 nr
+鸠车竹马 3 nr
+鸠集凤池 3 nr
+鸡 3779 n
+鸡丁 2 nz
+鸡不及凤 3 i
+鸡东 3 ns
+鸡东县 2 ns
+鸡东市 3 ns
+鸡丝 23 n
+鸡争鹅斗 3 i
+鸡仔 3 n
+鸡仔饼 3 n
+鸡兔 3 n
+鸡兔同笼 3 n
+鸡兔问题 3 n
+鸡公 3 n
+鸡公山 17 n
+鸡公车 4 n
+鸡内金 5 n
+鸡冠 38 n
+鸡冠区 3 n
+鸡冠子 7 n
+鸡冠石 3 n
+鸡冠花 10 i
+鸡冠菜 3 n
+鸡南山 3 ns
+鸡友 3 n
+鸡口牛后 3 i
+鸡叫 3 v
+鸡同鸭讲 3 n
+鸡啼 26 n
+鸡圈 7 n
+鸡场 12 n
+鸡场主 3 n
+鸡块 7 n
+鸡声鹅斗 3 i
+鸡头 63 n
+鸡头米 3 n
+鸡头鱼刺 3 n
+鸡奸 2 n
+鸡奸者 3 n
+鸡婆 9 n
+鸡子 3 n
+鸡子儿 4 n
+鸡尸牛从 3 i
+鸡尾 3 n
+鸡尾酒 61 n
+鸡尾酒会 10 n
+鸡屁股 3 n
+鸡屎 11 n
+鸡巴 45 n
+鸡心 13 n
+鸡心形 3 n
+鸡心领 3 n
+鸡杂 6 v
+鸡栅 3 n
+鸡栖凤巢 3 n
+鸡棚 3 n
+鸡毛 119 n
+鸡毛信 10 nz
+鸡毛帚 3 n
+鸡毛掸子 14 n
+鸡毛撢子 3 v
+鸡毛蒜皮 42 i
+鸡汁 3 n
+鸡汤 374 n
+鸡泽 4 n
+鸡泽县 3 ns
+鸡清汤 3 nz
+鸡爪 3 n
+鸡爪疯 3 n
+鸡爪菊 3 n
+鸡犬不宁 34 i
+鸡犬不安 3 i
+鸡犬不惊 5 i
+鸡犬不留 37 i
+鸡犬不闻 3 i
+鸡犬之声相闻 5 i
+鸡犬升天 10 i
+鸡犬无惊 3 i
+鸡犬桑麻 3 i
+鸡犬皆仙 3 i
+鸡犬相闻 20 i
+鸡瘟 7 n
+鸡皮 11 n
+鸡皮疙瘩 59 l
+鸡皮鹤发 3 i
+鸡眼 25 n
+鸡矢藤 3 i
+鸡窝 40 n
+鸡笼 57 n
+鸡粪 10 n
+鸡精 13 n
+鸡精蛋白 3 i
+鸡翅 16 n
+鸡翅木 3 n
+鸡翅膀 3 n
+鸡肉 169 n
+鸡肉饭 3 l
+鸡肋 47 n
+鸡肝 3 n
+鸡肠狗肚 3 i
+鸡肠鼠肚 3 i
+鸡肤鹤发 3 i
+鸡胸 19 n
+鸡胸肉 3 n
+鸡胸龟背 3 n
+鸡脚 3 n
+鸡腿 56 n
+鸡腿大餐 3 l
+鸡腿肉 3 n
+鸡腿菇 3 n
+鸡腿面 3 n
+鸡腿饭 3 n
+鸡舍 9 n
+鸡虫得丧 3 i
+鸡虫得失 3 i
+鸡虱 3 n
+鸡蛋 1355 n
+鸡蛋壳 7 n
+鸡蛋清 19 l
+鸡蛋粉 2 n
+鸡蛋糕 3 n
+鸡蛋羹 2 n
+鸡蛋花 11 n
+鸡蛋里挑 3 n
+鸡蛋黄 10 n
+鸡血 44 n
+鸡血石 14 n
+鸡血藤 3 n
+鸡西 20 ns
+鸡西市 14 ns
+鸡豚之息 3 v
+鸡足山 18 i
+鸡雏 12 n
+鸡零狗碎 14 i
+鸡霍乱 2 i
+鸡飞狗叫 3 i
+鸡飞狗走 8 i
+鸡飞狗跳 23 i
+鸡飞蛋打 17 l
+鸡食 2 n
+鸡饲料 3 n
+鸡首 4 n
+鸡骨 3 n
+鸡骨头 3 n
+鸡骨支床 3 n
+鸡骨草 3 n
+鸡鸡 3 n
+鸡鸡喈喈 3 nr
+鸡鸣 108 n
+鸡鸣不已 3 i
+鸡鸣候旦 3 n
+鸡鸣寺 5 ns
+鸡鸣戒旦 3 i
+鸡鸣犬吠 7 i
+鸡鸣狗吠 3 i
+鸡鸣狗盗 15 i
+鸡鸣而起 3 i
+鸡鸣起舞 3 i
+鸡鸣馌耕 3 n
+鸡鸭 3 n
+鸡鸭鱼肉 3 i
+鸡鹜争食 3 l
+鸡鹜相争 3 l
+鸢 37 n
+鸢尾 25 n
+鸢尾科 3 n
+鸢尾花 7 n
+鸢肩羔膝 3 n
+鸢肩豺目 3 vn
+鸢肩鹄颈 3 v
+鸢飞鱼跃 3 n
+鸢鹰 3 n
+鸣 1260 v
+鸣不平 16 i
+鸣乎哀哉 3 i
+鸣于乔木 3 vn
+鸣冤 21 v
+鸣冤叫屈 5 i
+鸣凤 10 nrt
+鸣凤朝阳 3 ns
+鸣叫 378 v
+鸣叫声 12 nrfg
+鸣号 2 n
+鸣咽 3 v
+鸣响 90 vn
+鸣哨 19 n
+鸣唱 7 v
+鸣啭 11 v
+鸣声 97 n
+鸣奏 3 v
+鸣放 19 v
+鸣放鞭炮 3 n
+鸣枪 157 n
+鸣枪示警 3 n
+鸣沙山 36 ns
+鸣炮 20 n
+鸣玉曳履 3 i
+鸣玉曳组 3 n
+鸣珂锵玉 3 nr
+鸣琴 6 n
+鸣琴而治 3 l
+鸣石 3 n
+鸣禽 22 n
+鸣笛 24 n
+鸣管 3 vn
+鸣谢 4 v
+鸣谢碑 3 i
+鸣野食苹 3 l
+鸣金 36 n
+鸣金击鼓 3 n
+鸣金收兵 21 n
+鸣金收军 26 n
+鸣銮 3 v
+鸣钟 3 n
+鸣钟列鼎 3 i
+鸣钟食鼎 3 i
+鸣锣 3 n
+鸣锣喝道 5 i
+鸣锣开道 5 i
+鸣镝 9 n
+鸣门 2 ns
+鸣雁 3 n
+鸣雁直木 3 i
+鸣震 3 n
+鸣震波 3 nrfg
+鸣鞭 4 v
+鸣音 4 n
+鸣鸟 3 n
+鸣鹤之应 3 i
+鸣鼓 3 n
+鸣鼓奏乐 3 n
+鸣鼓而攻 3 i
+鸣鼓而攻之 2 i
+鸤 5 zg
+鸥 113 ng
+鸥水相依 3 n
+鸥波萍迹 3 v
+鸥鸟 11 n
+鸥鹭忘机 3 n
+鸦 246 nz
+鸦嘴锄 3 n
+鸦巢生凤 3 i
+鸦没鹊静 3 i
+鸦片 730 nz
+鸦片剂 3 nz
+鸦片战争 555 nz
+鸦片烟 3 nz
+鸦片烟瘾 3 n
+鸦片贸易 3 nz
+鸦片酊 3 n
+鸦片鬼 3 i
+鸦牙 3 nz
+鸦胆子 3 n
+鸦蛋 3 n
+鸦雀 3 n
+鸦雀无声 168 i
+鸦雀无闻 3 i
+鸦青 3 nz
+鸦飞雀乱 3 i
+鸦飞鹊乱 3 i
+鸦髻 3 n
+鸦鬓 3 n
+鸦鹊无声 3 i
+鸦默雀静 3 i
+鸦默鹊静 3 i
+鸨 46 n
+鸨儿 7 n
+鸨妓 3 n
+鸨婆 3 n
+鸨母 41 n
+鸩 148 ng
+鸩媒 3 n
+鸩毒 28 n
+鸩酒 3 n
+鸪 46 x
+鸪鸪 3 n
+鸫 34 g
+鸬 123 n
+鸬鶿 3 n
+鸬鹚 39 n
+鸭 1638 ns
+鸭儿梨 3 n
+鸭公 3 n
+鸭叫 3 n
+鸭嘴 3 ns
+鸭嘴兽 32 n
+鸭嘴笔 3 n
+鸭嘴龙 16 ns
+鸭头 3 n
+鸭子 673 n
+鸭广梨 3 nz
+鸭掌 10 n
+鸭梨 18 n
+鸭步鹅行 3 n
+鸭毛 3 n
+鸭池 4 ns
+鸭汤 12 n
+鸭片 3 n
+鸭票 3 n
+鸭绒 8 n
+鸭绒毛 3 n
+鸭绒被 5 n
+鸭绿江 252 ns
+鸭绿江口 20 ns
+鸭绿江大桥 6 ns
+鸭绿江畔 4 ns
+鸭群 6 n
+鸭肉 35 n
+鸭肉汤 3 nz
+鸭肫 7 n
+鸭肫肝 3 v
+鸭脖子 3 n
+鸭脚 3 ns
+鸭舌 3 n
+鸭舌帽 27 n
+鸭苗 3 n
+鸭茅 4 ns
+鸭蛋 53 n
+鸭蛋圆 3 n
+鸭蛋壳 3 n
+鸭蛋形 2 n
+鸭蛋脸 3 n
+鸭蛋青 3 n
+鸭行鹅步 3 n
+鸭跖草 15 n
+鸭蹼 3 n
+鸭都劳 3 ns
+鸭钩 3 nz
+鸭霸 3 nz
+鸭黄 3 n
+鸮 70 zg
+鸮啼鬼啸 3 l
+鸮心鸝舌 3 v
+鸮心鹂舌 3 nr
+鸮鸟生翼 3 nr
+鸮鸣鼠暴 3 n
+鸯 53 x
+鸯侣 3 n
+鸰 15 zg
+鸱 64 g
+鸱吻 270 n
+鸱尾 4 n
+鸱张蚁聚 3 n
+鸱张门户 3 n
+鸱张鱼烂 3 n
+鸱张鼠伏 3 n
+鸱枭 4 n
+鸱目虎吻 3 n
+鸱视狼顾 3 n
+鸱视虎顾 3 n
+鸱鴞 3 n
+鸱鸦嗜鼠 3 v
+鸱鸮弄舌 3 v
+鸲 34 g
+鸲鹆 2 n
+鸳 75 n
+鸳侣 3 n
+鸳俦凤侣 3 n
+鸳梦 3 n
+鸳瓦 3 n
+鸳盟 3 n
+鸳鸯 740 n
+鸳鸯刀 82 n
+鸳鸯戏水 3 n
+鸳鸯楼 3 n
+鸳鸯浴 3 n
+鸳鸯蝴蝶 3 nr
+鸳鸯锅 3 n
+鸵 125 n
+鸵鸟 86 n
+鸵鸟政策 5 n
+鸵鸟蛋 3 n
+鸶 25 x
+鸷 57 n
+鸷鸟 3 n
+鸷鹰 3 n
+鸸 25 n
+鸸鹋 20 n
+鸹 52 x
+鸺 55 x
+鸻 12 zg
+鸽 191 n
+鸽哨 7 n
+鸽子 283 n
+鸽子笼 4 n
+鸽子花 256 n
+鸽房 3 n
+鸽派 3 n
+鸽笼 17 n
+鸽群 25 n
+鸽翼 3 n
+鸽蛋 3 n
+鸽赛 3 n
+鸽镇 3 n
+鸾 250 nr
+鸾交凤友 3 n
+鸾俦凤侣 3 n
+鸾凤 12 n
+鸾凤分飞 3 i
+鸾凤和鸣 3 i
+鸾分凤离 3 i
+鸾只凤单 3 n
+鸾吟凤唱 3 i
+鸾姿凤态 3 i
+鸾孤凤只 3 i
+鸾孤凤寡 3 i
+鸾歌凤吹 3 i
+鸾歌凤舞 3 i
+鸾漂凤泊 3 n
+鸾翔凤集 3 n
+鸾翱凤翥 3 nr
+鸾胶凤丝 3 n
+鸾舆 3 n
+鸾舆凤驾 3 nr
+鸾跂鸿惊 3 i
+鸾音鹤信 3 i
+鸾颠凤倒 3 i
+鸾飘凤泊 3 i
+鸾飞凤舞 3 i
+鸾鸟 2 n
+鸾鸣凤奏 3 n
+鸾鹄在庭 3 i
+鸿 2446 nr
+鸿业 3 n
+鸿业远图 3 n
+鸿信通 3 nz
+鸿俦鹤侣 3 n
+鸿儒 22 nr
+鸿儒硕学 3 nr
+鸿利 3 nz
+鸿商富贾 3 nr
+鸿图 9 n
+鸿图华构 3 n
+鸿图大展 3 nz
+鸿基 6 nz
+鸿宾楼 2 nr
+鸿志 3 n
+鸿恩 3 nr
+鸿才 157 n
+鸿文 3 nz
+鸿断鱼沉 3 i
+鸿案相庄 3 n
+鸿案鹿车 3 i
+鸿毛 3 n
+鸿毛泰山 3 nr
+鸿毛泰岱 3 ns
+鸿毳沉舟 3 nr
+鸿沟 139 n
+鸿泥雪爪 3 i
+鸿消鲤息 3 nr
+鸿渐之仪 3 nr
+鸿渐于干 3 i
+鸿源 3 n
+鸿爪 3 n
+鸿爪春泥 3 nz
+鸿爪留泥 3 n
+鸿爪雪泥 3 n
+鸿福 3 nz
+鸿禧 2 nrt
+鸿稀鳞绝 3 i
+鸿章钜字 3 nr
+鸿笔丽藻 3 nr
+鸿篇 4 n
+鸿篇巨制 6 n
+鸿篇巨着 3 i
+鸿篇巨著 3 n
+鸿篇钜制 3 vn
+鸿翔鸾起 3 nr
+鸿范 3 n
+鸿蒙 15 nr
+鸿蒙初辟 3 nr
+鸿衡鳞绝 3 i
+鸿衣羽裳 3 nr
+鸿轩凤翥 3 nr
+鸿达 3 nz
+鸿运 8 n
+鸿都买第 3 nz
+鸿门 3 n
+鸿门宴 55 n
+鸿隐凤伏 3 i
+鸿雁 56 nr
+鸿雁传书 4 nr
+鸿雁哀鸣 3 nr
+鸿飞冥冥 3 nr
+鸿飞雪爪 3 i
+鸿飞霜降 3 i
+鸿鳦满纸 3 nz
+鸿鶱凤立 3 nz
+鸿鶱凤逝 3 i
+鸿鹄 8 nr
+鸿鹄之志 4 i
+鸿鹄将至 3 i
+鹀 3 zg
+鹁 36 n
+鹁鸪 3 n
+鹁鸽 43 n
+鹂 18 nr
+鹃 512 x
+鹄 233 ng
+鹄峙鸾停 3 nr
+鹄峙鸾翔 3 nr
+鹄形菜色 3 nr
+鹄形鸟面 3 nr
+鹄形鸠面 3 i
+鹄望 3 nr
+鹄立 3 nr
+鹄面鸠形 3 i
+鹅 702 n
+鹅不食草 3 l
+鹅冠草 2 nz
+鹅卵 3 n
+鹅卵石 76 n
+鹅口疮 6 n
+鹅头 3 n
+鹅岭 2 ns
+鹅掌 13 n
+鹅掌楸 31 n
+鹅掌风 4 n
+鹅毛 40 n
+鹅毛大雪 17 i
+鹅毛扇 5 n
+鹅毛雪 3 n
+鹅池 3 ns
+鹅湖 4 ns
+鹅湖之会 3 nz
+鹅王择乳 3 n
+鹅绒 4 n
+鹅绒毛 3 n
+鹅群 3 n
+鹅翎扇 3 n
+鹅肉 3 n
+鹅肉汤 3 nz
+鹅肌肽 3 n
+鹅蛋 16 n
+鹅蛋脸 18 l
+鹅行鸭步 3 n
+鹅观草 3 n
+鹅銮鼻 21 ns
+鹅鸾鼻 3 i
+鹅黄 40 b
+鹅黄色 18 n
+鹆 70 x
+鹇 21 x
+鹈 21 n
+鹈鹕 23 n
+鹉 11 x
+鹊 355 ng
+鹊反鸾惊 3 i
+鹊垒巢鸠 3 n
+鹊山 31 ns
+鹊巢 3 n
+鹊巢鸠主 3 i
+鹊巢鸠佔 3 i
+鹊巢鸠占 3 i
+鹊巢鸠居 3 i
+鹊巢鸠据 3 i
+鹊巢鸠踞 3 i
+鹊报 3 n
+鹊桥 18 ns
+鹊桥会 3 ns
+鹊桥相会 7 i
+鹊笑鸠舞 3 i
+鹊起 3 ns
+鹊返鸾回 3 i
+鹋 11 x
+鹌 24 n
+鹌鹑 79 n
+鹌鹑蛋 3 v
+鹍 2 zg
+鹎 12 g
+鹏 589 nr
+鹏举 3 i
+鹏图 11 nz
+鹏城 9 ns
+鹏抟鹢退 3 vn
+鹏泰 17 nz
+鹏游蝶梦 3 ns
+鹏程 40 nz
+鹏程万里 3 i
+鹏笑道 11 i
+鹏运 5 nz
+鹏道 11 nz
+鹏霄万里 3 i
+鹏飞 3 nz
+鹏鸟 3 nz
+鹐 4 zg
+鹑 69 x
+鹑居 3 i
+鹑居鷇食 3 i
+鹑居鷇饮 3 i
+鹑衣 3 i
+鹑衣百结 5 i
+鹑衣鷇食 3 i
+鹑衣鹄面 3 i
+鹕 35 x
+鹖 3 zg
+鹗 174 ng
+鹘 93 x
+鹘仑吞枣 3 ns
+鹘入鸦群 3 vn
+鹚 17 x
+鹛 14 g
+鹜 40 ng
+鹞 98 ng
+鹞子 38 n
+鹞子翻身 3 n
+鹞式 16 b
+鹞鹰 28 n
+鹟 10 zg
+鹠 7 zg
+鹡 14 zg
+鹡鸰在原 3 v
+鹢 4 zg
+鹣 29 g
+鹣鲽情深 3 v
+鹤 935 ns
+鹤侣 3 n
+鹤势螂形 3 l
+鹤发 3 nz
+鹤发松姿 3 nz
+鹤发童颜 11 i
+鹤发鸡皮 3 nz
+鹤唳 3 i
+鹤唳华亭 3 nz
+鹤唳猿声 3 n
+鹤唳风声 3 v
+鹤嘴锄 3 n
+鹤嘴镐 3 n
+鹤困鸡群 3 i
+鹤城 3 ns
+鹤城区 3 ns
+鹤壁 27 ns
+鹤壁市 22 ns
+鹤声 3 n
+鹤处鸡群 3 i
+鹤子梅妻 3 i
+鹤山 24 ns
+鹤山区 3 ns
+鹤山县 3 ns
+鹤山市 3 ns
+鹤岗 27 ns
+鹤岗市 10 ns
+鹤岗矿务局 2 n
+鹤峰 266 ns
+鹤峰县 257 ns
+鹤年堂 5 n
+鹤庆 8 ns
+鹤庆县 2 ns
+鹤归华表 3 n
+鹤怨猿惊 3 i
+鹤望兰 3 ns
+鹤林李园 3 ns
+鹤林溪口 3 ns
+鹤林蒲岭 3 nz
+鹤田真由 3 l
+鹤知夜半 3 i
+鹤短凫长 3 z
+鹤立 3 nz
+鹤立鸡群 28 i
+鹤笔翁 3 n
+鹤算龟龄 3 n
+鹤群 3 n
+鹤羽 3 nrt
+鹤翼 3 n
+鹤背扬州 3 n
+鹤膝蜂腰 3 i
+鹤草芽 3 n
+鹤草酚 3 nz
+鹤虱 3 n
+鹤行鸡群 3 i
+鹤见 5 n
+鹤长凫短 3 z
+鹤顶 3 ns
+鹤顶红 27 i
+鹤骨松姿 3 n
+鹤骨松筋 3 n
+鹤骨霜髯 3 n
+鹤骨鸡肤 3 i
+鹤骨龙筋 3 nz
+鹤鸣 9 nrt
+鹤鸣之士 3 i
+鹤鸣九皋 2 ns
+鹤鹑蛋 3 v
+鹥 2 zg
+鹦 41 n
+鹦哥 38 n
+鹦哥绿 6 n
+鹦鹉 177 n
+鹦鹉学舌 13 n
+鹦鹉学语 3 n
+鹦鹉热 4 n
+鹦鹉螺 40 n
+鹧 44 n
+鹧鸪 982 n
+鹧鸪天 3 n
+鹧鸪菜 4 n
+鹨 39 g
+鹩 18 x
+鹩哥 3 n
+鹪 165 n
+鹪巢蚊睫 3 n
+鹪鹩 2 n
+鹪鹩一枝 3 v
+鹫 168 ns
+鹫山 3 ns
+鹫峰 19 ns
+鹫峰山 4 ns
+鹬 56 i
+鹬类 3 n
+鹬蚌持争 3 i
+鹬蚌相争 21 i
+鹬蚌相危 3 i
+鹬蚌相持 2 i
+鹬蚌相斗 3 i
+鹬鸵 3 n
+鹭 61 ng
+鹭岛 3 ns
+鹭岭里 3 ns
+鹭序 3 n
+鹭序鸳行 3 n
+鹭序鹓行 3 n
+鹭朋鸥侣 3 n
+鹭约鸥盟 3 vn
+鹭鸟 6 n
+鹭鸶 28 n
+鹭鹚 2 n
+鹮 22 zg
+鹯视狼顾 3 n
+鹰 1050 n
+鹰击长空 3 n
+鹰勾鼻 3 i
+鹰厦线 4 nz
+鹰厦铁路 16 nz
+鹰嘴 12 nz
+鹰嘴豆 3 n
+鹰嘴鹞目 3 vn
+鹰头雀脑 3 i
+鹰巢 15 nz
+鹰式 8 n
+鹰式飞弹 3 l
+鹰心雁爪 3 i
+鹰手营子 3 n
+鹰扬 19 nrt
+鹰扬万里 3 i
+鹰扬虎噬 3 i
+鹰扬虎视 3 i
+鹰拿燕雀 3 i
+鹰拿雁捉 3 ns
+鹰挚狼食 3 n
+鹰撮霆击 3 nr
+鹰星 2 nz
+鹰架 3 n
+鹰洋 18 nz
+鹰派 46 n
+鹰派人物 9 n
+鹰潭 27 ns
+鹰潭市 6 ns
+鹰爪 135 n
+鹰爪毛儿 3 n
+鹰爪王 3 nrt
+鹰爪虾 2 nz
+鹰犬 72 n
+鹰犬之才 3 i
+鹰犬塞途 3 n
+鹰狮 21 nz
+鹰王 8 nz
+鹰眼 3 n
+鹰睃狼顾 3 nr
+鹰瞵虎视 3 v
+鹰瞵鴞视 3 vn
+鹰瞵鹗视 3 vn
+鹰窠顶 3 i
+鹰缘网 3 nz
+鹰翔天涯 3 n
+鹰视狼步 3 n
+鹰视狼顾 2 i
+鹰视虎步 3 i
+鹰觑鹘望 3 i
+鹰金钱 3 n
+鹰钩 12 nz
+鹰钩鼻 3 n
+鹰隼 17 n
+鹰鹞 2 n
+鹰鼻 3 ns
+鹰鼻鹞眼 3 v
+鹱 39 g
+鹲 6 zg
+鹳 43 ns
+鹳山 2 ns
+鹳雀 3 ns
+鹳雀楼 10 ns
+鹹 12 zg
+鹼 41 zg
+鹾 39 g
+鹿 1817 nr
+鹿三刚 3 nr
+鹿三和 6 nr
+鹿三扬 2 nr
+鹿下山 2 nr
+鹿乡约 4 ns
+鹿于霖 13 nr
+鹿产仔 2 nr
+鹿人 3 nr
+鹿儿 7 nr
+鹿儿岛 82 nr
+鹿儿岛县 10 ns
+鹿兆海 151 nr
+鹿兆谦 15 nr
+鹿兆鹏 543 nr
+鹿喜欢 2 nr
+鹿回头 7 nr
+鹿场 4 n
+鹿城 6 nr
+鹿城区 2 ns
+鹿姓兆 2 nr
+鹿子霖 805 nr
+鹿寨 3 nr
+鹿寨县 2 nr
+鹿屋 2 n
+鹿市 3 ns
+鹿师傅 2 nr
+鹿心社 2 nr
+鹿惠氏 22 nr
+鹿成群 5 nr
+鹿杖客 199 nr
+鹿死谁手 30 i
+鹿永建 5 nr
+鹿泉 3 nr
+鹿泉市 3 ns
+鹿泰恒 35 nr
+鹿泰桓 15 nr
+鹿清笃 119 nr
+鹿港 6 ns
+鹿港镇 3 nr
+鹿溪河 3 nr
+鹿特丹 73 nr
+鹿特斯 4 nr
+鹿皮 54 nr
+鹿皮苍璧 3 i
+鹿皮鞋 3 nr
+鹿砦 11 nr
+鹿科鹿 2 nr
+鹿类 2 n
+鹿精灵 3 nr
+鹿老儿 4 nr
+鹿肉 38 n
+鹿肾 3 n
+鹿脯 2 nr
+鹿茸 104 nr
+鹿茸酒 3 nr
+鹿衔草 3 nr
+鹿裘不完 3 nr
+鹿角 887 nr
+鹿角胶 3 n
+鹿角菜 6 n
+鹿角霜 3 nr
+鹿谷 3 nr
+鹿谷乡 2 nr
+鹿贺氏 52 nr
+鹿走苏台 3 ns
+鹿蹄草 5 n
+鹿车共挽 3 i
+鹿邑 13 nr
+鹿邑县 2 nr
+鹿野 8 nr
+鹿野苑 7 nr
+鹿野道彦 3 nr
+鹿钟麟 5 nr
+鹿镇逢 2 nr
+鹿门隐 2 nr
+鹿非鹿 2 nr
+鹿食草 3 nr
+鹿马勺 10 nr
+鹿驯豕暴 3 i
+鹿鸣湖 3 nr
+鹿鸣馆 2 nr
+鹿鹿耳 3 nr
+鹿黑娃 8 nr
+鹿鼎公 22 nr
+鹿鼎山 15 nr
+鹿鼎记 16 nr
+鹿鼎鸡 2 nr
+麂 80 n
+麂子 10 n
+麂皮 16 n
+麅 2 zg
+麇 25 g
+麇至沓来 3 i
+麇骇雉伏 3 nr
+麈 20 g
+麈尾之诲 3 nr
+麋 31 n
+麋沸蚁动 3 n
+麋羚 3 n
+麋鹿 2159 n
+麐 25 zg
+麑 2 zg
+麒 281 n
+麒麟 128 n
+麒麟区 3 ns
+麒麟山 6 ns
+麒麟座 3 n
+麒麟杯 7 n
+麒麟盖 3 n
+麓 283 ng
+麕 9 zg
+麖 2 zg
+麜 16 zg
+麝 381 n
+麝子油醇 3 n
+麝牛 15 n
+麝猫 3 n
+麝香 119 n
+麝香石竹 3 n
+麝香草 3 n
+麝香鹿 3 n
+麝鼠 29 n
+麟 99 ng
+麟儿 3 nz
+麟凤一毛 3 nz
+麟凤龟龙 3 i
+麟子凤雏 3 i
+麟庐 2 i
+麟德 6 nrt
+麟游 5 nz
+麟经 3 nz
+麟肝凤髓 3 i
+麟角 3 nz
+麟角凤嘴 3 nz
+麟角凤毛 3 nz
+麟角凤距 3 nz
+麟角虎翅 3 i
+麟趾呈祥 3 nr
+麣 4 zg
+麥 9 zg
+麦 1452 nr
+麦丘之祝 3 nr
+麦丹月 2 nr
+麦乳 3 nz
+麦乳精 3 n
+麦乳茶 3 n
+麦二叉蚜 3 n
+麦亚明 2 nr
+麦仁汤 2 nr
+麦伯良 7 nr
+麦保罗 6 nr
+麦克 93 nr
+麦克利 3 nr
+麦克劳 19 nr
+麦克劳德 5 nrt
+麦克唐 6 nr
+麦克唐奈 2 nr
+麦克唐纳 56 nrt
+麦克基 4 nr
+麦克奈尔 2 nr
+麦克尔 7 nr
+麦克尔士 3 nr
+麦克尼利 6 ns
+麦克库 2 nr
+麦克弗森 4 nr
+麦克恩 2 nr
+麦克戴 20 nr
+麦克戴斯 6 ns
+麦克拉 3 nr
+麦克拉伦 147 nrt
+麦克斯 67 nr
+麦克斯韦 152 nrt
+麦克林斯 2 nrt
+麦克格 7 nr
+麦克比 2 nrt
+麦克沃特 2 nrt
+麦克法 2 nr
+麦克洛 3 nr
+麦克灯 3 nr
+麦克白 18 nr
+麦克米伦 21 nrt
+麦克米兰 2 nrt
+麦克级 2 nr
+麦克纳马拉 5 nrt
+麦克莱 3 nr
+麦克莱伦 36 nrt
+麦克莱兰 3 nr
+麦克莱恩 2 nrt
+麦克迪尔 4 nrt
+麦克阿瑟 115 nrt
+麦克雷 3 nr
+麦克风 44 nr
+麦克马斯特 2 nrt
+麦克马洪 15 nr
+麦克马洪线 38 nz
+麦克默 4 nr
+麦其官 7 nr
+麦其家 55 nr
+麦其领 2 nr
+麦农 3 nz
+麦冬 34 nr
+麦冬草 3 nr
+麦凯伦 3 nr
+麦凯恩 3 nr
+麦利那 3 nr
+麦加 285 nr
+麦勒斯 8 nr
+麦卡宾 2 nr
+麦卡尔 5 nr
+麦卡蒂 2 nr
+麦卡锡 26 nr
+麦卡锡主义 17 nz
+麦可 2 nr
+麦台依 2 nr
+麦吉尔 11 nr
+麦吉柯 2 nr
+麦吊杉 3 nr
+麦咖啡 3 nr
+麦哲仑 2 nr
+麦哲伦 92 nr
+麦哲伦云 4 nr
+麦圭尔 4 nr
+麦地 50 n
+麦地那 105 ns
+麦城 12 ns
+麦基诺 9 nr
+麦天思 3 nr
+麦子 460 nr
+麦家琪 3 nr
+麦尊致 3 nr
+麦小琴 3 nr
+麦少帮 14 nr
+麦少帮主 3 nr
+麦尔尼克 3 nrt
+麦尔斯 2 nr
+麦尔杰 2 nr
+麦尔登 5 nr
+麦尔登呢 3 nr
+麦尔维 2 nr
+麦尔维尔 7 nrt
+麦尼克 4 nr
+麦尼埃 2 nr
+麦已盛 2 nr
+麦库尔 2 nr
+麦康奈尔 2 nr
+麦康纳 3 nr
+麦建光 3 nr
+麦当乐 3 nr
+麦当劳 127 nrt
+麦当劳公司 8 n
+麦当娜 13 nr
+麦德林 8 nr
+麦德森 5 nr
+麦德福特 2 nr
+麦德罗 3 nr
+麦德龙 4 nr
+麦折银 2 nr
+麦拉 10 nrt
+麦收 54 nr
+麦斯欧 5 ns
+麦斯特 5 nr
+麦斯纳 3 nr
+麦斯道 2 nr
+麦日盖 2 nr
+麦春华 2 nr
+麦木鲁克 2 ns
+麦杆 3 n
+麦柯里 3 nr
+麦根 3 nz
+麦根沙士 3 ns
+麦格理 18 nr
+麦格雷 3 nr
+麦梗 3 n
+麦洛村 2 nr
+麦浪 10 nz
+麦片 21 n
+麦片粥 3 nz
+麦特 3 nrt
+麦王 2 nrt
+麦瑞尔 2 nr
+麦瓦利 5 nr
+麦田 133 nr
+麦田圈 3 nz
+麦皮 5 n
+麦盖提 4 nr
+麦盖提县 3 ns
+麦秀两岐 3 nr
+麦秀两歧 3 nr
+麦秀黍离 3 vn
+麦秆 35 n
+麦秆菊 3 n
+麦秆虫 3 n
+麦秆蝇 3 n
+麦秋 4 nr
+麦种 35 n
+麦科德 4 nr
+麦科特 3 nr
+麦科马克 6 nrt
+麦积山 31 nr
+麦秸 117 n
+麦穗 62 nr
+麦穗两岐 3 nr
+麦穗两歧 3 nr
+麦穗鱼 2 nr
+麦立克 2 nr
+麦管 3 n
+麦类 12 n
+麦粉 9 nz
+麦粒 52 n
+麦粒肿 5 n
+麦粥 3 nz
+麦精 3 nz
+麦纳麦 13 nr
+麦绥莱勒 3 nr
+麦维德 3 nr
+麦罗埃 21 nr
+麦翠娴 3 nr
+麦考伊 4 nr
+麦考利 2 nr
+麦考利夫 4 nr
+麦考密克 6 nr
+麦考莱 6 nr
+麦肯康 2 nr
+麦肯纳 4 nr
+麦肯罗 2 nr
+麦肯锡 10 nr
+麦肯锡公司 9 nr
+麦肯齐 6 nr
+麦芒 11 nr
+麦芽 41 nr
+麦芽乳 3 nz
+麦芽糖 32 nr
+麦芽糖酶 3 nz
+麦芽茶 3 nr
+麦苗 64 nr
+麦茬 15 n
+麦草 79 nr
+麦莱丹 2 nr
+麦蒂加 2 nr
+麦蒙哈 2 nr
+麦蚜 3 n
+麦蚜虫 3 n
+麦蛾 3 n
+麦蜂属 2 nr
+麦西尼 16 nr
+麦西尼亚 34 ns
+麦西来甫 3 nr
+麦角 46 nz
+麦角固醇 3 nz
+麦角肽 3 n
+麦角胺 7 nz
+麦角钙化 3 n
+麦谷蛋白 3 nr
+麦赐球 2 nr
+麦赫杜 3 nr
+麦迪逊 32 nr
+麦迪霉素 6 nz
+麦道 42 nr
+麦酒 3 n
+麦金 2 n
+麦金农 13 nr
+麦金利 24 nr
+麦金利峰 4 nr
+麦金塔 6 nr
+麦金德 7 nr
+麦金莱 4 nr
+麦长青 3 nr
+麦门冬 2 nr
+麦门冬汤 2 nr
+麦饭 3 n
+麦饭石 20 ns
+麦饭豆羹 3 n
+麦马立 2 nr
+麦高文 3 nr
+麦鲸身 2 nr
+麦鸡 2 ns
+麦麸 12 n
+麩 5 zg
+麴 21 nr
+麵 5 zg
+麸 27 n
+麸子 8 n
+麸曲 3 n
+麸皮 16 n
+麸素 3 n
+麸胺酸 3 n
+麹 9 zg
+麹义 3 vn
+麻 1772 nr
+麻中之蓬 3 nr
+麻仁 4 nr
+麻俐 3 nr
+麻光佐 141 nr
+麻六甲 3 nr
+麻六甲海 3 nr
+麻刀 3 n
+麻利 97 nr
+麻制套索 3 n
+麻制绳 2 n
+麻剌为 2 nr
+麻剌子 3 nr
+麻剌朗 3 nr
+麻剑法 2 nr
+麻包 22 n
+麻卵石 3 nr
+麻原彰晃 2 nr
+麻又辣 3 nr
+麻哈鱼 2 nr
+麻四哥 6 nr
+麻四嫂 21 nr
+麻团 7 n
+麻坊镇 5 nr
+麻城 1059 nr
+麻城县 2 ns
+麻城市 258 ns
+麻塞诸塞 3 nr
+麻大哥 3 nr
+麻大年 8 nr
+麻姑献寿 3 nr
+麻婆 4 nr
+麻婆豆腐 3 n
+麻子 84 n
+麻宣慰 4 nr
+麻将 253 n
+麻将机 3 nr
+麻将桌 5 n
+麻将牌 32 n
+麻将馆 3 nr
+麻尔罕 16 nr
+麻山区 3 ns
+麻州 3 ns
+麻工厂 2 nt
+麻巧正 2 nr
+麻布 418 v
+麻布袋 2 n
+麻意 3 n
+麻扎刀 3 nr
+麻扎塔 2 nr
+麻木 430 nr
+麻木不仁 69 i
+麻木感 3 nr
+麻木树 9 nr
+麻木状态 3 n
+麻札刀 2 nr
+麻札塔 2 nr
+麻杆 3 n
+麻杏石 3 nr
+麻林迪 5 nr
+麻栎 23 nr
+麻栗坡 3 nr
+麻栗坡县 10 ns
+麻核 2 n
+麻核桃 2 n
+麻江 3 nr
+麻江县 5 ns
+麻沸散 7 i
+麻油 31 n
+麻油瓶 3 n
+麻油鸡 3 n
+麻渣 3 n
+麻溜儿 2 nr
+麻点 7 n
+麻烦 2059 an
+麻烦事 36 i
+麻理 3 n
+麻生 7 an
+麻生太 15 nr
+麻生太郎 3 nr
+麻田一 2 nr
+麻田村 6 nr
+麻田镇 9 nr
+麻疹 94 n
+麻疹病毒 3 n
+麻痹 295 v
+麻痹不仁 3 i
+麻痹大意 28 i
+麻痹思想 3 i
+麻痹症 3 i
+麻痺不仁 3 v
+麻登云 3 nr
+麻皮 2 n
+麻皮阿 80 nr
+麻省 35 ns
+麻省理工 3 nt
+麻省理工学院 82 nt
+麻秸 3 n
+麻立 2 v
+麻章区 3 nr
+麻答 5 v
+麻类 47 n
+麻类作物 3 n
+麻粒岩 14 nr
+麻粟坡 3 nr
+麻粟坡县 3 n
+麻糖 263 n
+麻絮 2 n
+麻纤维 3 nr
+麻纱 40 n
+麻纸 38 n
+麻纺 23 b
+麻纺厂 8 n
+麻纺织 12 n
+麻线 18 n
+麻织 2 n
+麻织业 4 n
+麻织品 10 n
+麻绍勤 2 nr
+麻经 3 n
+麻经儿 3 nr
+麻绳 165 n
+麻老四 47 nr
+麻耳干 17 nr
+麻脚软 2 i
+麻脸 47 n
+麻腐 3 n
+麻花 64 n
+麻花儿 7 nr
+麻花辫子 3 n
+麻花钻 3 nr
+麻苏苏 3 nr
+麻药 50 n
+麻菽麦 2 nr
+麻萨诸塞 3 nr
+麻萨诸州 3 ns
+麻薯 3 n
+麻藤属 3 nr
+麻藤科 3 nr
+麻衣 7 n
+麻衣汉子 4 nr
+麻衣相 6 nr
+麻衣麻 2 nr
+麻袋 474 n
+麻袋布 3 n
+麻袋片 16 n
+麻豆 3 n
+麻豆文旦 3 nr
+麻豆腐 5 n
+麻贵亲 2 nr
+麻软未 2 nr
+麻辣 43 z
+麻辣味 3 nr
+麻辣教师 3 nr
+麻辣火锅 3 n
+麻辣烫 8 z
+麻辣酱 256 n
+麻辣锅 3 n
+麻速忽 5 nr
+麻酥酥 6 z
+麻酱 9 n
+麻酱面 3 n
+麻醉 264 nr
+麻醉剂 40 nr
+麻醉品 12 nr
+麻醉学 4 nr
+麻醉师 15 nr
+麻醉弹 3 nr
+麻醉性 4 nr
+麻醉机 3 nr
+麻醉枪 3 nr
+麻醉科 16 nr
+麻醉药 31 nr
+麻醉药品 3 n
+麻醉针 3 nr
+麻钱 3 n
+麻铁黎 2 nr
+麻阳 11 nr
+麻阳话 2 n
+麻雀 391 n
+麻雀在后 3 i
+麻雀战 33 nr
+麻雀虽小 10 i
+麻鞋 38 n
+麻风 25 nr
+麻风病 12 n
+麻风病人 3 n
+麻风病院 3 n
+麻鸭 28 n
+麻鹰岗 2 nr
+麻麻 13 n
+麻麻亮 25 nr
+麻麻呼呼 3 z
+麻麻糊糊 3 z
+麻麻黑 3 z
+麻黄 76 nr
+麻黄根 3 nr
+麻黄汤 3 nr
+麻黄碱 23 n
+麻黄素 12 nr
+麻黄草 5 nr
+麼 51 zg
+麽 483 x
+麾 66 n
+麾下 383 n
+麾之即去 3 z
+麾军 3 n
+麿 15 zg
+黃 3 zg
+黃凱芹 3 nr
+黄 11062 a
+黄一冬 2 nr
+黄一山 3 nr
+黄一彪 323 nr
+黄一炮 2 nr
+黄一飞 3 nr
+黄万波 6 nr
+黄三耀 27 nr
+黄不拉 2 nr
+黄丕烈 8 nr
+黄世仁 9 nr
+黄东 2 ns
+黄丝桥 3 nr
+黄丝藻 6 nr
+黄中原 3 ns
+黄中发 2 nr
+黄中秋 3 nr
+黄中辅 3 nr
+黄丸加 5 nr
+黄丹华 2 nr
+黄丽亚 3 nr
+黄丽满 3 nr
+黄义交 4 nr
+黄乙娜 3 nr
+黄乙玲 3 nr
+黄二人 6 nr
+黄二公 2 nr
+黄二州 256 nr
+黄二毛 5 nr
+黄二毛子 3 nr
+黄亚生 5 nr
+黄人 3 n
+黄人守日 3 n
+黄人捧日 3 i
+黄仁宇 14 nr
+黄仁植 3 nr
+黄仁英 3 nr
+黄介正 4 nr
+黄仕忠 2 nr
+黄仙姑 40 nr
+黄仲霖 4 nr
+黄伊汶 3 nr
+黄会计 2 n
+黄伟文 3 nr
+黄伟虎 4 nr
+黄传贵 2 nr
+黄伯云 7 nr
+黄伯流 36 nr
+黄佐临 8 nr
+黄体 17 n
+黄体化 3 nr
+黄体期 9 n
+黄体素 4 nr
+黄体芳 5 nr
+黄体酮 5 n
+黄依依 1173 nr
+黄俊子 2 nr
+黄俊杰 5 nr
+黄保坪 6 nr
+黄信 40 nr
+黄信便 2 nr
+黄健中 6 nr
+黄健翔 2 nr
+黄允材 3 nr
+黄元林 3 nr
+黄元申 3 nr
+黄先生 41 nr
+黄光亮 3 nr
+黄光升 6 nr
+黄光裕 61 nr
+黄光连 2 nr
+黄光闪 2 nr
+黄光黑 2 nr
+黄克诚 41 nr
+黄入济 2 n
+黄公望 41 nr
+黄公略 57 nr
+黄公覆 12 nr
+黄公酒垆 3 nr
+黄兴 101 ns
+黄兴代 2 nr
+黄兴国 3 ns
+黄兴路 3 nr
+黄冈 2870 ns
+黄冈县 3 ns
+黄冈市 1799 ns
+黄册 8 n
+黄册库 5 nr
+黄冠灰 2 nr
+黄冠草履 3 nr
+黄冠草服 3 nr
+黄冠道人 5 nr
+黄冠野服 3 nr
+黄冶 3 ns
+黄凌霜 2 nr
+黄凤涛 23 nr
+黄凯芹 3 nr
+黄分兵 3 n
+黄初 16 t
+黄初平 2 nr
+黄初民 13 nr
+黄刺玫 3 n
+黄前帮 16 nr
+黄力行 3 nr
+黄包车 98 n
+黄化 16 ns
+黄化病 2 n
+黄化质体 3 n
+黄华华 4 nr
+黄华琼 12 nr
+黄卓玲 3 nr
+黄南 9 ns
+黄南藏族自治州 5 ns
+黄博文 13 nr
+黄卫青 2 nr
+黄卷幼妇 3 n
+黄卷青灯 3 nr
+黄历 10 n
+黄原 299 ns
+黄原原 2 ns
+黄原城 30 ns
+黄原府 2 nr
+黄原开 3 nr
+黄原扎 2 nr
+黄原揽 2 nr
+黄原河 26 ns
+黄县 10 ns
+黄又稀 2 nr
+黄友 10 n
+黄双武 2 nr
+黄发儿齿 3 n
+黄发台背 3 n
+黄发垂髫 3 n
+黄发垂鬓 3 nr
+黄发紫 2 nr
+黄发骀背 3 v
+黄发鲐背 3 v
+黄口 7 ns
+黄口孺子 6 nr
+黄口小儿 9 nr
+黄古蒿 256 nr
+黄台之瓜 3 nr
+黄台吉 2 nr
+黄叶 34 nr
+黄叶飘零 3 nr
+黄吉安 3 nr
+黄君汉 2 nr
+黄君璧 6 nrfg
+黄启东 2 nr
+黄启俊 3 nr
+黄启臣 2 nr
+黄和祥 3 nr
+黄品冠 3 n
+黄品源 3 n
+黄善夫 3 nr
+黄善洪 3 nr
+黄嘉鑫 3 nr
+黄嘌呤 3 n
+黄团元 2 nr
+黄国 2 ns
+黄国伦 3 nr
+黄国俊 3 nr
+黄国强 3 nr
+黄国文 2 nr
+黄国柏 7 nr
+黄国雄 3 nr
+黄土 1161 n
+黄土地 50 ns
+黄土地貌 3 nz
+黄土坡 11 ns
+黄土塬 3 nr
+黄土层 11 n
+黄土岗 261 ns
+黄土岭 4 ns
+黄土峁 3 nr
+黄土梁 4 nr
+黄土背 3 nr
+黄土路 2 ns
+黄土高原 266 ns
+黄土高原地区 3 ns
+黄均雨 2 nr
+黄坛 2 n
+黄坛口 5 ns
+黄坡 3 ns
+黄垆之痛 3 nr
+黄埃 3 ns
+黄埔 190 ns
+黄埔军官 3 nr
+黄埔军官学校 7 nt
+黄埔军校 215 nt
+黄埔军校武汉分校 259 nt
+黄埔区 5 ns
+黄埔江 3 ns
+黄埔海关 5 ns
+黄埔港 11 ns
+黄培升 6 nr
+黄培昭 4 nr
+黄培生 7 nr
+黄培英 2 nr
+黄堡 3 ns
+黄堡镇 2 nr
+黄墟之痛 3 nr
+黄墨谷 2 nr
+黄壁庄 13 nr
+黄壤 81 n
+黄士 2 n
+黄士陵 5 nr
+黄大人 4 nr
+黄大仙 91 nr
+黄大仙区 2 ns
+黄大仙姑 3 nr
+黄大仙庙 27 nr
+黄大哥 3 nr
+黄大炜 3 nr
+黄大豆 3 nr
+黄天焦日 3 nr
+黄天立 2 nr
+黄天翔 8 nr
+黄天荡 7 nr
+黄天霸 3 nr
+黄太冲 21 nr
+黄夫人 14 nr
+黄头发 3 nr
+黄奇帆 2 nr
+黄奕 3 z
+黄奕中 2 i
+黄女侠 3 nr
+黄姓武 2 nr
+黄姜 4 nr
+黄威义 2 nr
+黄媛媛 2 nr
+黄嫩嫩 3 ns
+黄子佼 3 n
+黄子华 3 nr
+黄子扬 3 nr
+黄子澄 45 nr
+黄子骅 3 nr
+黄孔目 4 nr
+黄字 3 n
+黄孝德 2 nr
+黄孟复 3 nr
+黄学峰 7 nr
+黄学明 2 nr
+黄宇诗 3 nr
+黄守瓜 2 nr
+黄安 410 ns
+黄安拿 2 nr
+黄安正 3 nr
+黄宏嘉 2 nr
+黄宏生 89 nr
+黄宗仰 2 nr
+黄宗会 90 nr
+黄宗宪 8 nr
+黄宗汉 4 nr
+黄宗江 4 nr
+黄宗洛 3 nr
+黄宗炎 2 nr
+黄宗羲 1636 nr
+黄宗翰 2 nr
+黄宗英 4 nr
+黄定宇 3 nr
+黄宛苏 3 nr
+黄宝腊 2 nr
+黄室韦 3 nr
+黄家 800 n
+黄家嫂子 3 nr
+黄家富贵 6 nr
+黄家强 3 nr
+黄家渡 4 nr
+黄家湖 256 nr
+黄家潭 256 nr
+黄家诺 3 nr
+黄家酿 3 nr
+黄家驹 3 nr
+黄家鼐 2 nr
+黄宽重 2 nr
+黄宾虹 31 nr
+黄富琪 21 nr
+黄寺 2 ns
+黄封御 4 nr
+黄封殿 128 nr
+黄尊素 28 nr
+黄小咬 3 nr
+黄小晶 3 nr
+黄小桢 3 nr
+黄小玲 3 nr
+黄小立 3 nr
+黄少敏 2 nr
+黄少良 18 nr
+黄尘清水 3 nr
+黄尾屿 20 nr
+黄屋 10 n
+黄山 486 ns
+黄山区 3 ns
+黄山市 94 ns
+黄山松 19 nr
+黄山站 3 ns
+黄山谷 3 nr
+黄岗山 10 nr
+黄岗梁 5 nr
+黄岛 135 ns
+黄岛区 2 ns
+黄岩 41 nr
+黄岩区 3 ns
+黄岩县 3 ns
+黄岩岛 14 nr
+黄岩市 5 ns
+黄岩村 3 nr
+黄岩港 3 ns
+黄崇简 3 nr
+黄崖关 3 nr
+黄崖洞 7 nr
+黄州 1575 ns
+黄州区 256 ns
+黄州市 3 ns
+黄州武 2 nr
+黄州菜 256 nr
+黄州镇 3 ns
+黄巢 88 nr
+黄巢之 2 nr
+黄巢事 3 n
+黄巢入 3 nr
+黄巢军 2 nr
+黄巢北 3 nr
+黄巢攻 3 nr
+黄巢败 3 nr
+黄巢起义 47 l
+黄巢遂 2 nr
+黄巢部 2 nr
+黄巨星 2 nr
+黄巾 75 nr
+黄巾之乱 3 l
+黄巾党 6 nr
+黄巾军 13 nr
+黄巾刘 3 nr
+黄巾力士 7 nr
+黄巾张 3 nr
+黄巾者 3 nr
+黄巾起义 53 nr
+黄布密 2 nr
+黄师伯 7 nr
+黄师爷 50 nr
+黄希扬 2 nr
+黄希节 30 nr
+黄帝 388 nr
+黄帝内经 74 n
+黄帝城 4 nr
+黄帝陵 24 nr
+黄帮主 112 nr
+黄帽 9 n
+黄干黑廋 3 z
+黄平 5 nr
+黄平县 3 ns
+黄平府 3 nr
+黄幸强 2 nr
+黄幸明 2 nr
+黄底 3 t
+黄庙 3 ns
+黄府君 2 nr
+黄庭坚 587 nr
+黄庭经 7 nr
+黄庭钧 3 nr
+黄康生 256 nr
+黄建云 4 nr
+黄建刚 9 nr
+黄建华 3 nr
+黄建平 2 nr
+黄建福 3 nr
+黄建翔 3 nr
+黄彩虹 2 nr
+黄影 29 n
+黄得功 26 nr
+黄御史 2 nr
+黄德强 2 nr
+黄德洁 4 nr
+黄德骧 2 nr
+黄心仲 5 nr
+黄心柏 2 nr
+黄志宏 3 nr
+黄志强 3 nr
+黄志忠 3 nr
+黄志明 2 nr
+黄志添 2 nr
+黄志红 3 nr
+黄忠 143 nr
+黄忠大 2 nr
+黄忠夺 2 nr
+黄忠寨 3 nr
+黄忠引 3 nr
+黄忠甚 2 nr
+黄忠谓 2 nr
+黄忠连 2 nr
+黄忠领 3 nr
+黄念棠 2 nr
+黄怀信 4 nr
+黄怀玉 2 nr
+黄总兵 9 nr
+黄惠英 6 nr
+黄惠贤 13 nr
+黄慕松 3 nr
+黄懋衡 3 nr
+黄手帕 3 nr
+黄承彦 4 nr
+黄振中 17 nr
+黄振华 3 nr
+黄振声 2 nr
+黄振家 2 nr
+黄振龙 3 nr
+黄挺东 2 nr
+黄操良 6 nr
+黄教 45 nz
+黄教授 3 n
+黄文农 2 nr
+黄文卿 2 nr
+黄文奎 3 nr
+黄文山 4 nr
+黄文弼 10 nr
+黄文杰 3 nr
+黄文炳 79 nr
+黄文烨 5 nr
+黄文豪 3 nr
+黄文龙 23 nr
+黄斑 31 n
+黄斑部 3 n
+黄新波 3 nr
+黄旗 82 nr
+黄旗军 11 nr
+黄旗影 2 nr
+黄旗招 4 nr
+黄旗海 3 nr
+黄日华 3 nz
+黄时鉴 5 nr
+黄时雨 4 nr
+黄昌元 4 nr
+黄明升 3 nr
+黄明生 263 nr
+黄明胶 3 n
+黄昏 901 t
+黄昏恋 6 nr
+黄昏时候 3 l
+黄昏时分 3 l
+黄易 7 n
+黄春平 4 nr
+黄是勇 2 nr
+黄显声 2 nr
+黄晋安 3 nr
+黄晓明 3 nr
+黄晓玲 4 nr
+黄晓蓉 2 nr
+黄晕 2 n
+黄晨琦 4 nr
+黄景 2 n
+黄景珍 3 nr
+黄智权 3 nrfg
+黄智贤 3 nr
+黄曲霉 32 n
+黄曲霉素 16 n
+黄曲霉菌 7 n
+黄月英 256 nr
+黄朝兴 3 nr
+黄朝猛 14 nr
+黄木道 11 nr
+黄木道人 13 nr
+黄权 6 n
+黄权督 2 nr
+黄杆病毒 3 n
+黄杏秀 3 nr
+黄村镇 4 nr
+黄来儿 13 nr
+黄杨 65 nr
+黄杨厄闰 3 nr
+黄杨木 3 nr
+黄杨苗 3 nr
+黄松龄 512 nr
+黄板滩 2 nr
+黄板纸 3 n
+黄极 4 ns
+黄林楠 2 nr
+黄果 10 n
+黄果树 55 nr
+黄枝木 2 nr
+黄柏 20 nr
+黄柏仁 3 nr
+黄柏富 9 nr
+黄柏林 2 nr
+黄栌 6 nr
+黄树棠 3 nr
+黄格选 256 nr
+黄桂清 3 nr
+黄桂稠 3 nr
+黄桥 27 ns
+黄桥战役 8 nz
+黄桥镇 2 nr
+黄桷 2 n
+黄梁一梦 3 nr
+黄梁梦 3 nr
+黄梁美梦 3 nr
+黄梅 35 nr
+黄梅县 258 nr
+黄梅天 3 nr
+黄梅季 3 nr
+黄梅山 6 nr
+黄梅庄 2 nr
+黄梅戏 37 nr
+黄梅莹 3 nr
+黄梅调 3 nr
+黄梅雨 4 nr
+黄梦然 54 nr
+黄梨洲 4 nr
+黄棕色 3 nr
+黄森森 2 nr
+黄楠雁 2 nr
+黄榜 128 nr
+黄樟 3 ns
+黄樟素 3 nz
+黄橙子 256 nr
+黄橙橙 3 nr
+黄檀 21 nr
+黄檗 7 n
+黄歇口镇 3 ns
+黄正利 3 nr
+黄段子 5 n
+黄毅诚 3 nr
+黄毒 6 n
+黄毛 7 nr
+黄毛丫头 23 nr
+黄毛小子 2 nr
+黄毛狗 2 nr
+黄毛舌 3 nr
+黄毛貂 2 nr
+黄毛青 2 nr
+黄氏兄弟 2 nr
+黄氏家族 2 nr
+黄气澄 2 nr
+黄水 133 ns
+黄水中 2 nr
+黄水仙 3 nr
+黄水冲 3 nr
+黄水劫 2 nr
+黄水晶 3 nr
+黄水来 2 nr
+黄水河 3 nr
+黄水疮 3 n
+黄永华 9 nr
+黄永玉 14 nr
+黄永胜 268 nr
+黄汉中 2 nr
+黄汉升 6 nr
+黄江镇 3 ns
+黄池 7 ns
+黄池之会 3 nr
+黄汤 21 nr
+黄汤淡水 3 nr
+黄汤辣水 3 nr
+黄汲清 3 nr
+黄沙 494 ns
+黄沙滚滚 3 nr
+黄沙铺 4 ns
+黄河 3241 ns
+黄河三角洲 20 ns
+黄河三门峡水库 2 ns
+黄河口 21 ns
+黄河壶口瀑布 4 ns
+黄河旋风 2 nr
+黄河水 3 ns
+黄河水利委员会 10 nt
+黄河水清 3 ns
+黄河流域 248 ns
+黄河网 3 nr
+黄河路 14 ns
+黄河集团 21 nt
+黄河颂 3 nr
+黄油 51 n
+黄油枪 3 n
+黄治林 2 nr
+黄泉 96 nr
+黄泉之下 3 nr
+黄泉路 3 ns
+黄泛区 106 nr
+黄泥 51 n
+黄泥堡 2 nr
+黄泥巴 5 nr
+黄泥河 10 ns
+黄泥河镇 3 ns
+黄泰植 3 nr
+黄洋 3 ns
+黄洋界 11 n
+黄洲全 3 nr
+黄流 4 n
+黄济 2 n
+黄浦 25 ns
+黄浦区 16 ns
+黄浦江 134 ns
+黄浦江畔 6 ns
+黄浩义 3 nr
+黄浩然 3 nr
+黄海 399 ns
+黄海之滨 3 nr
+黄海冰 3 nr
+黄海波 3 nr
+黄海贝 16 nr
+黄润 3 n
+黄润甫 9 nr
+黄淑仪 3 nrfg
+黄淑惠 3 i
+黄淮 38 nr
+黄淮地区 5 ns
+黄淮平原 32 ns
+黄淮海 7 ns
+黄淮海平原 38 ns
+黄渤海 11 ns
+黄湘怡 3 nr
+黄演庄 2 nr
+黄潜善 10 nr
+黄潜蝇 2 nr
+黄潭 2 ns
+黄潮土 3 nr
+黄澄澄 46 nr
+黄澍命 2 nr
+黄澍才 2 nr
+黄澍笑 2 nr
+黄灌球 4 nr
+黄火亮 3 nr
+黄火木 9 nr
+黄火青 2 nr
+黄灯 11 n
+黄灿灿 14 nr
+黄炎培 49 nr
+黄炳新 13 nr
+黄炳炎 2 nr
+黄炳章 3 nr
+黄烟 2 n
+黄热病 20 n
+黄烷 3 n
+黄烷醇 6 nr
+黄焦焦 4 nr
+黄焰 6 n
+黄熟 11 ns
+黄燐 3 z
+黄燮清 2 nr
+黄爵滋 5 nr
+黄父 2 n
+黄片 3 n
+黄牌 218 n
+黄牌儿 3 n
+黄牌警告 29 n
+黄牙 26 ns
+黄牛 218 nr
+黄牛党 3 nt
+黄牛票 3 n
+黄牯牛 3 n
+黄狗肾 3 n
+黄狮孙 2 nr
+黄狮寨 2 nr
+黄狮精 5 nr
+黄猄 3 z
+黄猫峡 2 nr
+黄玉 23 nr
+黄玉剑 3 nr
+黄玉斌 7 nr
+黄玉昆 2 nr
+黄玉梅 2 nr
+黄玉米 3 nr
+黄玉郎 2 nr
+黄玫瑰 3 nr
+黄琪翔 18 nr
+黄瑞兰 52 nr
+黄瑞纶 2 nr
+黄瑞采 2 nr
+黄瓜 201 n
+黄瓜汁 10 nr
+黄瓜片 3 n
+黄瓜皮 3 nr
+黄瓜秧 3 nr
+黄瓦 15 ns
+黄瓦东 3 nr
+黄瓦朱 257 nr
+黄瓦红 5 nr
+黄瓦飞 384 nr
+黄甫川 5 nr
+黄疸 134 n
+黄疸型 3 vn
+黄疸病 3 vn
+黄病毒 3 n
+黄癣 3 n
+黄登仁 2 nr
+黄登登 3 nr
+黄白 32 nr
+黄白之 3 nr
+黄白术 4 n
+黄白混 3 nr
+黄白红 2 nr
+黄白色 46 n
+黄百鸣 3 nr
+黄皆令 3 nr
+黄皮 17 n
+黄皮书 5 nr
+黄皮刮廋 3 n
+黄皮子 29 nr
+黄皮寡廋 3 nr
+黄皮肤 3 n
+黄盖献 2 nr
+黄盖船 2 nr
+黄相公 12 nr
+黄眉僧 120 nr
+黄眉和尚 3 nr
+黄真笑 10 nr
+黄真见 6 nr
+黄知真 256 nr
+黄石 2709 nr
+黄石公园 3 n
+黄石地区 3 ns
+黄石大峡 3 ns
+黄石寨 3 nr
+黄石市 2332 ns
+黄石河 8 nr
+黄石港区 257 ns
+黄石湖 3 nr
+黄石瀑布 3 ns
+黄石路 3 nr
+黄砂 12 n
+黄砚秋 18 nr
+黄碟 3 n
+黄碧签 2 nr
+黄磷 19 nr
+黄祖引 2 nr
+黄祖必 2 nr
+黄祖部 3 nr
+黄祸 4 n
+黄祸论 2 i
+黄禹锡 3 nr
+黄秀虹 19 nr
+黄秀贞 3 nr
+黄秉维 4 nr
+黄秋园 20 nr
+黄秋生 2 nr
+黄秋葵 3 n
+黄秋雅 50 nr
+黄种 39 n
+黄种人 3 n
+黄程 2 n
+黄窝儿 2 nr
+黄立行 3 nr
+黄站 3 n
+黄童 2 n
+黄童白叟 3 nr
+黄童白颠 3 ns
+黄童皓首 3 i
+黄竹浦 20 nr
+黄管藻 2 nr
+黄籍 9 n
+黄米 27 nr
+黄粉 7 n
+黄粉虫 3 nr
+黄粒 2 n
+黄粱 8 n
+黄粱一梦 3 nz
+黄粱梦 5 nr
+黄粱美梦 10 nr
+黄精 3 nr
+黄糖 2 nr
+黄素 21 n
+黄素影 3 nr
+黄素蒽 2 nr
+黄素酶 3 nr
+黄红麻 15 nr
+黄约兴 6 nr
+黄纪莲 2 nr
+黄纪莹 3 nr
+黄纸 250 n
+黄纸板 3 n
+黄线 2 n
+黄绍兹 3 nr
+黄绍站 3 nr
+黄绍芬 3 nr
+黄绍雄 4 nr
+黄经 17 n
+黄经差 3 n
+黄经臣 14 nr
+黄绢幼 2 nr
+黄绢连 2 nr
+黄继光 57 nr
+黄继美 4 nr
+黄绮珊 3 nrfg
+黄维垣 2 nr
+黄绵土 4 nr
+黄绵袄子 3 v
+黄绸所 3 n
+黄综翰 5 nr
+黄绿 37 nr
+黄绿光 2 nr
+黄绿色 103 nr
+黄绿青 7 nr
+黄罗伞 7 nr
+黄罗销 2 nr
+黄羊 97 nr
+黄美丽 6 nr
+黄美真 4 nr
+黄群藻 8 nr
+黄翅大 2 nr
+黄翰晨 11 nr
+黄耀明 3 nr
+黄老之 18 nr
+黄老五 13 nr
+黄老学派 3 nr
+黄老汉 3 nr
+黄老爷 20 nr
+黄老邪 108 nr
+黄而厚 2 nr
+黄耳传书 3 nr
+黄肠题 5 n
+黄胆 2 nr
+黄背草 2 nr
+黄脉弦 2 nr
+黄脉浮 2 nr
+黄脉滑 2 nr
+黄脸 2 nr
+黄脸婆 24 nr
+黄腔 3 n
+黄腹角雉 24 n
+黄腻 3 n
+黄至武 2 nr
+黄舒骏 3 nr
+黄色 2115 n
+黄色书刊 3 n
+黄色人种 3 n
+黄色图片 3 n
+黄色小说 3 l
+黄色工会 3 nt
+黄色录像 3 n
+黄色录相 3 n
+黄色故事 3 n
+黄色文学 3 n
+黄色炸药 7 n
+黄色片 3 n
+黄色电影 3 n
+黄色笑话 3 l
+黄色素 10 n
+黄色网 3 n
+黄色霉素 3 n
+黄艳艳 2 nr
+黄节 5 t
+黄芦叶 2 nr
+黄芩 49 nr
+黄芪 114 n
+黄芫花 3 z
+黄花 411 n
+黄花冈 3 ns
+黄花女 3 n
+黄花女儿 3 nr
+黄花岗 36 nr
+黄花岗七 3 ns
+黄花晚节 3 n
+黄花梨 6 nr
+黄花烟草 3 n
+黄花瘦 3 z
+黄花苜蓿 3 l
+黄花菜 53 n
+黄花镇 7 ns
+黄花闺女 23 n
+黄花鱼 28 nr
+黄芽菜 3 n
+黄苔主 2 nr
+黄苷 3 n
+黄苷酸 3 n
+黄茂如 13 nr
+黄茅尖 2 nr
+黄茅白苇 3 nr
+黄茶岭 2 nr
+黄茸茸 3 z
+黄草坝 2 nr
+黄草梁 2 nr
+黄荣北 2 nr
+黄荣焱 3 nr
+黄药子 3 nr
+黄药师 968 nr
+黄药眠 3 nr
+黄莓 3 n
+黄莲湖 256 nr
+黄莺 28 nr
+黄莺儿 11 nr
+黄莺出谷 3 nr
+黄莺莺 3 nr
+黄菊 17 nr
+黄菊花 3 nr
+黄菊香 3 nr
+黄菜叶子 2 n
+黄菠萝 3 n
+黄萎病 2 n
+黄萝卜 2 n
+黄葛树 3 nr
+黄蒙蒙 4 nr
+黄蒿梁 3 nr
+黄蓉一一 3 nr
+黄蓉举 5 nr
+黄蓉之 17 nr
+黄蓉乍 2 nr
+黄蓉乘 2 nr
+黄蓉亲 4 nr
+黄蓉伏 5 nr
+黄蓉传 4 nr
+黄蓉伸 15 nr
+黄蓉依 4 nr
+黄蓉先 5 nr
+黄蓉入 2 nr
+黄蓉全 3 nr
+黄蓉冷 6 nr
+黄蓉凑 3 nr
+黄蓉凝 7 nr
+黄蓉刚 3 nr
+黄蓉初 3 nr
+黄蓉原 2 ns
+黄蓉双 8 nr
+黄蓉叫 5 nr
+黄蓉右 7 nr
+黄蓉叹 60 nr
+黄蓉吓 5 nr
+黄蓉听 8 nr
+黄蓉呆 5 nr
+黄蓉命 3 nr
+黄蓉喂 2 nr
+黄蓉喜 8 nr
+黄蓉嘻 3 nr
+黄蓉固 2 nr
+黄蓉夺 3 nr
+黄蓉奇 11 nr
+黄蓉奔 8 nr
+黄蓉嫣然 2 nr
+黄蓉学 3 nr
+黄蓉害 3 nr
+黄蓉岂 2 nr
+黄蓉差 2 nr
+黄蓉强 2 nr
+黄蓉微 7 nr
+黄蓉微微 46 nr
+黄蓉心 52 nr
+黄蓉必 3 nr
+黄蓉忒 2 nr
+黄蓉忙 22 nr
+黄蓉念 5 nr
+黄蓉忽 13 nr
+黄蓉怒 10 nr
+黄蓉情 3 nr
+黄蓉惊 3 nr
+黄蓉愈 3 nr
+黄蓉房 2 nr
+黄蓉才 6 nr
+黄蓉扶 5 nr
+黄蓉折 3 nr
+黄蓉抚 4 nr
+黄蓉抢 14 nr
+黄蓉抱 5 nr
+黄蓉抹 2 nr
+黄蓉抿 10 nr
+黄蓉拉 5 nr
+黄蓉拔 5 nr
+黄蓉拖 2 nr
+黄蓉拾 3 nr
+黄蓉按 2 nr
+黄蓉挥 3 nr
+黄蓉授 3 nr
+黄蓉掌 3 nr
+黄蓉推 4 nr
+黄蓉提 3 nr
+黄蓉摇 4 nr
+黄蓉摸 4 nr
+黄蓉放 2 nr
+黄蓉教 7 nr
+黄蓉料 5 nr
+黄蓉智 2 nr
+黄蓉朗 3 nr
+黄蓉望 8 nr
+黄蓉本 7 ns
+黄蓉板 3 nr
+黄蓉极 3 ns
+黄蓉柔 7 nr
+黄蓉格 8 nr
+黄蓉横 3 nr
+黄蓉欲 4 nr
+黄蓉正 9 nr
+黄蓉甚 9 nr
+黄蓉略 5 nr
+黄蓉登 2 nr
+黄蓉百 2 nr
+黄蓉相 8 nr
+黄蓉眼 2 nr
+黄蓉知 21 nr
+黄蓉确 2 nr
+黄蓉秀 9 nr
+黄蓉究 2 nr
+黄蓉站 8 ns
+黄蓉竟 3 nr
+黄蓉竹 20 nr
+黄蓉笑 243 nr
+黄蓉素 7 nr
+黄蓉终 2 nr
+黄蓉绕 3 nr
+黄蓉统 2 nr
+黄蓉续 4 nr
+黄蓉耐 2 nr
+黄蓉耳 4 nr
+黄蓉背 7 nr
+黄蓉自 3 nr
+黄蓉若 5 nr
+黄蓉落 5 nr
+黄蓉见 125 nr
+黄蓉计 2 nr
+黄蓉识 2 nr
+黄蓉赞 6 nr
+黄蓉越 9 nr
+黄蓉跃 2 nr
+黄蓉跳 2 nr
+黄蓉身 20 nr
+黄蓉转 2 nr
+黄蓉轻 3 nr
+黄蓉迎 2 nr
+黄蓉连 18 ns
+黄蓉重 2 nr
+黄蓉闻 4 nr
+黄蓉阴 2 ns
+黄蓉陪 2 nr
+黄蓉靠 2 nr
+黄蓉面 2 nr
+黄蓉飞 3 nr
+黄蓉黄 2 nr
+黄蓉齐 3 nr
+黄蔷薇 4 nr
+黄蕉 5 n
+黄蕉风 52 nr
+黄薇薇 3 nr
+黄蘗 3 z
+黄蚁 3 n
+黄蜂 145 nr
+黄蜂毒 3 n
+黄蜂队 3 n
+黄蜡 15 n
+黄蜡蜡 6 n
+黄蝴蝶 4 nr
+黄衣 12 n
+黄衣主教 3 nz
+黄衣僧 2 nr
+黄衣少 2 nr
+黄衣服 3 nr
+黄衣汉子 6 nr
+黄衣黄 2 nr
+黄表 3 n
+黄表纸 19 nz
+黄衫女子 42 nr
+黄衫客 3 nr
+黄衫少女 4 nr
+黄衫星 2 nr
+黄衫汉子 2 nr
+黄衫美女 8 nr
+黄衫老者 4 nr
+黄衫霍 4 nr
+黄袍 78 n
+黄袍加身 22 n
+黄裳 28 n
+黄褐 34 n
+黄褐斑 16 n
+黄褐色 133 n
+黄观 8 n
+黄诚本 2 nr
+黄豆 322 n
+黄豆大 3 nr
+黄豆斗箕 3 n
+黄豆粉 5 nr
+黄豆粒 3 nr
+黄豆芽 18 nr
+黄豆豆 3 nr
+黄货 3 n
+黄贯中 3 nr
+黄贻钧 2 nr
+黄赌毒 2 j
+黄赛红 4 nr
+黄赤白 2 nr
+黄越峰 2 nr
+黄跃金 2 nr
+黄辅臣 2 nr
+黄辣丁 6 nr
+黄达亮 3 nr
+黄连 625 ns
+黄连山 5 ns
+黄连木 3 nr
+黄连素 12 nr
+黄道 231 n
+黄道光 4 nr
+黄道吉日 45 nr
+黄道周 56 nr
+黄道婆 15 nr
+黄道带 3 nr
+黄道日 3 nr
+黄道良 3 nr
+黄道荣 3 nr
+黄道面 2 n
+黄遵宪 33 nr
+黄遵素 2 nr
+黄酒 97 n
+黄酮 3 n
+黄酮类 27 n
+黄酮醇 3 n
+黄酱 7 n
+黄酵 3 v
+黄金 3086 n
+黄金世界 3 nz
+黄金书屋 3 n
+黄金交叉 3 n
+黄金价格 3 n
+黄金会员 3 n
+黄金分割 15 l
+黄金剑 2 nr
+黄金卡 3 nr
+黄金右脚 3 ns
+黄金叶 2 nr
+黄金周 1407 nr
+黄金地段 3 n
+黄金城 7 nr
+黄金壳 3 nr
+黄金宝 13 nr
+黄金屋 13 n
+黄金山 2 nr
+黄金岁月 3 n
+黄金岛 3 nr
+黄金峡 2 nr
+黄金市场 3 n
+黄金律 2 nr
+黄金搭档 3 n
+黄金时代 103 t
+黄金时间 34 n
+黄金村 3 nr
+黄金树 3 nr
+黄金档 3 nr
+黄金梨 3 nr
+黄金椁 2 nr
+黄金槐 3 nr
+黄金水 3 nr
+黄金水道 155 n
+黄金洞 2 nr
+黄金海岸 58 nr
+黄金湖 6 nr
+黄金湾 256 nr
+黄金版 3 n
+黄金珠宝 3 nr
+黄金甲 2 nr
+黄金电影 3 n
+黄金眼 3 nr
+黄金矿 2 nr
+黄金矿工 3 n
+黄金组合 3 n
+黄金荣 11 nr
+黄金铸象 3 n
+黄金饰品 3 n
+黄金首饰 3 nr
+黄金高 3 nr
+黄金魁 3 nrfg
+黄钟之 4 nr
+黄钟公 112 nr
+黄钟大吕 9 nr
+黄钟律 2 nr
+黄钟毁弃 2 i
+黄钟瓦釜 3 n
+黄钟长弃 3 nr
+黄钟骏 8 nr
+黄钺 24 nr
+黄钺白 5 nr
+黄铁矿 39 nr
+黄铜 114 nr
+黄铜矿 20 n
+黄锈病 3 n
+黄锡会 2 nr
+黄锦声 3 nr
+黄锦显 3 nr
+黄锦森 3 nr
+黄锦炎 3 nr
+黄锦荣 3 nr
+黄锺毁弃 3 vn
+黄锺瓦缶 3 nr
+黄镇 7 ns
+黄镇东 16 nr
+黄镇球 2 nr
+黄长怡 4 nr
+黄长路 2 nr
+黄门 65 ns
+黄门奏 2 nr
+黄门官 14 nr
+黄门迁 3 nr
+黄门郎 4 nr
+黄队 7 n
+黄陂 1318 ns
+黄陂区 261 ns
+黄陂县 3 ns
+黄际 2 n
+黄陵 547 ns
+黄陵县 23 ns
+黄陶庵 2 nr
+黄雀 15 n
+黄雀伺蝉 3 nr
+黄雀在后 16 nr
+黄雀衔环 3 nr
+黄雅丽 3 nr
+黄集伟 3 nr
+黄雾冲 2 nr
+黄震华 2 nr
+黄静华 2 nr
+黄面尊 4 nr
+黄面道人 3 n
+黄韬 2 nrfg
+黄韵玲 3 nr
+黄韵诗 3 nr
+黄韶诗 3 nr
+黄页 11 n
+黄页网 3 n
+黄顺玲 2 nr
+黄须 2 n
+黄须人 4 nr
+黄须儿 2 nr
+黄须客 2 nr
+黄颁谷 3 nr
+黄风吹 2 nr
+黄风寨 7 nr
+黄风岭 6 nr
+黄风怪 7 nr
+黄风涛 2 nr
+黄风雾罩 3 l
+黄飞虎 3 nr
+黄飞鸿 3 nr
+黄香粉 2 nr
+黄马 15 ns
+黄马之 2 nr
+黄马奔 2 nr
+黄马甚 2 nr
+黄马褂 56 n
+黄骅 274 ns
+黄骅县 4 ns
+黄骅市 6 ns
+黄骅港 2 ns
+黄骠马 15 n
+黄骨髓 3 n
+黄骨鱼 2 nr
+黄鱼 34 n
+黄鲁直 3 nr
+黄鲷 3 n
+黄鳝 351 n
+黄鸟 4 nr
+黄鸣俊 2 nr
+黄鸿斌 3 nr
+黄鸿超 3 nr
+黄鹂 29 n
+黄鹄兮 3 nr
+黄鹄矶 2 nr
+黄鹏 3 nr
+黄鹤 28 nr
+黄鹤楼 810 nr
+黄鹤矶 3 nr
+黄麂 3 n
+黄麴毒素 3 v
+黄麻 135 nr
+黄麻紫书 3 nr
+黄麻紫泥 3 nr
+黄麻起义 10 nr
+黄黄 3 nr
+黄黄的 26 n
+黄黎洲 8 ns
+黄鼎杰 3 nr
+黄鼎臣 5 nr
+黄鼠 30 n
+黄鼠狼 131 n
+黄鼬 43 n
+黄齐文 2 nr
+黄齑淡饭 3 nr
+黄齑白饭 3 v
+黄龙 433 nr
+黄龙县 4 ns
+黄龙寺 4 nr
+黄龙山 23 ns
+黄龙府 4 nr
+黄龙旗 7 nr
+黄龙洞 6 nr
+黄龙溪 3 nr
+黄龙滩 2 ns
+黄龙痛饮 3 n
+黄龙镇 2 ns
+黅 20 zg
+黉 5 g
+黍 179 ng
+黍子 9 n
+黍油麦秀 3 n
+黍离麦秀 3 n
+黍秀宫庭 3 n
+黍米 3 n
+黎 714 nr
+黎世留 2 nr
+黎丘丈人 3 nr
+黎中城 2 nr
+黎之五笔 3 nr
+黎亚 3 ns
+黎介寿 6 nr
+黎元洪 444 nr
+黎凡特 11 nr
+黎刹公园 2 ns
+黎可漂 6 nr
+黎国 3 ns
+黎国伟 4 nr
+黎国荃 4 nr
+黎圣宗 3 nr
+黎城 7 ns
+黎城县 4 ns
+黎培里 4 nr
+黎塘 3 ns
+黎塞留 6 nr
+黎夫人 3 nr
+黎将军 2 nr
+黎小田 3 nr
+黎山 2 ns
+黎川 3 ns
+黎川县 3 ns
+黎巴嫩 301 nr
+黎巴嫩人 15 nr
+黎巴嫩共和国 3 ns
+黎巴嫩山 9 ns
+黎巴嫩真主党 2 nt
+黎平 33 nr
+黎平县 2 ns
+黎庆宁 2 nr
+黎庶 21 n
+黎庶涂炭 3 n
+黎得芳 3 nr
+黎德寿 3 nr
+黎思嘉 3 nr
+黎拔力 45 nr
+黎斐飞 2 nr
+黎族 608 nz
+黎旭阳 2 nr
+黎明 670 nr
+黎明俱乐部 2 nt
+黎明前 3 t
+黎明工专 3 nt
+黎明晨光 2 nr
+黎明村 6 nr
+黎明诗 3 nr
+黎晓新 4 nr
+黎景辉 2 nr
+黎曼 187 nr
+黎曼可 2 nr
+黎曼流 3 nr
+黎曼积分 3 nr
+黎朝 4 t
+黎桂桂 32 nr
+黎民 64 nr
+黎民安 2 nz
+黎民百姓 28 n
+黎汉持 3 nr
+黎沸挥 3 nr
+黎湛铁路 8 nt
+黎满庚 135 nr
+黎燕珊 3 nr
+黎玉玺 3 nr
+黎瑞恩 3 nr
+黎生黎 2 nr
+黎美娴 3 nr
+黎耀祥 3 nr
+黎能清 3 nr
+黎莉莉 4 nr
+黎语 6 nz
+黎锦晖 8 nr
+黎阳 52 ns
+黎阳仓 2 nr
+黎雄才 3 nr
+黎黎 2 ns
+黏 154 zg
+黏上 3 n
+黏上去 3 v
+黏上来 3 v
+黏下去 3 v
+黏了 3 v
+黏人 3 n
+黏住 6 v
+黏到 3 v
+黏力 3 n
+黏合 4 v
+黏合剂 5 n
+黏合力 3 n
+黏合成 3 n
+黏吝缴绕 3 nr
+黏土 8 n
+黏土砖 3 n
+黏在 3 v
+黏好 3 a
+黏完 3 v
+黏度 4 n
+黏度计 3 n
+黏得 3 v
+黏性 14 n
+黏成 3 v
+黏手 3 n
+黏接 3 v
+黏来黏去 3 z
+黏涎 3 v
+黏液 104 n
+黏满 3 a
+黏点 3 n
+黏皮带骨 3 n
+黏皮着骨 3 n
+黏着 18 v
+黏着剂 3 n
+黏着力 3 n
+黏着性 3 n
+黏着语 3 n
+黏稠 21 a
+黏稠度 10 n
+黏米 3 n
+黏糊 9 a
+黏糊糊 10 n
+黏结 2 a
+黏结力 3 n
+黏结性 3 n
+黏胶 2 n
+黏膜 143 n
+黏膜炎 2 n
+黏贴 3 n
+黏起 3 v
+黏起来 3 v
+黏过 3 v
+黏附 10 v
+黏附力 3 n
+黏附性 3 n
+黏鱼 3 n
+黐 33 zg
+黑 11296 a
+黑三棱 6 nr
+黑下 3 n
+黑下来 3 l
+黑下脸 2 l
+黑不溜偢 3 z
+黑不溜秋 6 z
+黑与白 3 nr
+黑丝布 2 nr
+黑丝披巾 3 nr
+黑丝袜 3 n
+黑严 2 a
+黑中介 3 nr
+黑乌乌 16 nr
+黑乎乎 85 z
+黑乡 3 ns
+黑书 3 n
+黑云 86 nr
+黑云压城 3 n
+黑云压城城欲摧 3 i
+黑云山 2 nr
+黑云岭 10 nr
+黑云杉 2 nr
+黑云母 48 nr
+黑云犹 2 nr
+黑云龙 6 nr
+黑五类 14 nr
+黑五龙 2 nr
+黑井 11 ns
+黑井岛 3 nr
+黑亮 51 nr
+黑亮亮 2 nr
+黑人 986 n
+黑人区 3 ns
+黑价 3 n
+黑价白日 3 l
+黑伯龙 4 nr
+黑体 103 n
+黑体字 19 n
+黑作坊 3 n
+黑佬 2 nz
+黑信 3 nr
+黑信号 3 n
+黑光 3 n
+黑克勒 2 nr
+黑克尔 5 nr
+黑公话 3 n
+黑典型 3 n
+黑刺李 3 nr
+黑剑先 2 nr
+黑剑划 6 nr
+黑剑削 3 nr
+黑剑剑 2 nr
+黑剑斗 2 nr
+黑剑疾 2 nr
+黑剑连 2 nr
+黑剑锋 2 nr
+黑加仑 3 ns
+黑劳士 18 nr
+黑势力 3 n
+黑化肥 3 n
+黑匣 3 ns
+黑匣子 22 n
+黑博士 3 nr
+黑压压 203 z
+黑又亮 8 nr
+黑又静 2 nr
+黑双色 2 nr
+黑发 112 n
+黑发人 3 n
+黑口 7 n
+黑古隆冬 3 nr
+黑叶猴 9 n
+黑吃黑 3 l
+黑名 3 n
+黑名单 101 nr
+黑咕笼咚 3 z
+黑咕隆冬 3 z
+黑咕隆咚 23 z
+黑哨 9 n
+黑啤 6 n
+黑啤酒 18 nt
+黑嘴鸥 3 nr
+黑回绒 2 nr
+黑土 76 n
+黑土地 13 ns
+黑地 52 n
+黑地昏天 3 i
+黑垆土 4 nr
+黑城 14 ns
+黑塞哥维那 44 ns
+黑墨 14 n
+黑墨水 5 nr
+黑墨汁 3 nr
+黑壤 3 n
+黑夜 715 n
+黑天 47 n
+黑天半夜 7 i
+黑天墨地 3 i
+黑天摸地 3 i
+黑天白日 3 n
+黑天鹅 3 nz
+黑太阳 3 nr
+黑头 56 n
+黑头发 3 i
+黑奴 75 n
+黑奴吁 3 nr
+黑如墨 4 nr
+黑娃引 3 nr
+黑娃瞅 2 nr
+黑娃谦 2 nr
+黑婚介 3 n
+黑嫩 3 ns
+黑子 163 n
+黑字 34 n
+黑宋江 4 nr
+黑官 3 n
+黑客 413 nr
+黑客基地 3 n
+黑客工具 3 l
+黑客帝国 3 ns
+黑客技术 3 n
+黑客攻击 2 i
+黑客程序 3 n
+黑客网 3 n
+黑客软件 3 l
+黑家白日 3 n
+黑家鼠 3 nr
+黑寡妇 9 nr
+黑小白 3 z
+黑尔堡 2 ns
+黑尔斯 2 nr
+黑屏 2 nr
+黑山 110 ns
+黑山共和国 18 ns
+黑山南 2 ns
+黑山县 2 ns
+黑山头 2 ns
+黑山峡 3 ns
+黑山族 2 nz
+黑山羊 5 nr
+黑岗 2 ns
+黑岗口 2 n
+黑岛 3 ns
+黑工 4 n
+黑巾 2 n
+黑市 73 ns
+黑市拳 3 n
+黑布 84 nr
+黑布洋 2 ns
+黑布老者 2 n
+黑布蒙 3 nr
+黑帐 3 n
+黑帖 3 n
+黑带 3 n
+黑带高手 3 n
+黑帮 29 nr
+黑帮片 3 n
+黑幕 54 n
+黑幕小说 3 n
+黑幕重重 3 n
+黑幢幢 3 z
+黑幽幽 7 z
+黑底 12 n
+黑底屏 3 nrt
+黑底白字 3 n
+黑店 18 ns
+黑度 5 n
+黑影 356 n
+黑德兰 2 nr
+黑心 64 n
+黑心棉 3 nr
+黑心肝 3 n
+黑心肠 3 n
+黑心钱 3 n
+黑忽忽 3 z
+黑恶 3 n
+黑恶势力 3 i
+黑户 17 n
+黑手 89 n
+黑手党 34 n
+黑手机 3 n
+黑招委 2 nr
+黑摩 2 ns
+黑教堂 3 nr
+黑斑 139 n
+黑斑病 3 n
+黑斑蚊 2 n
+黑斯廷斯 3 nr
+黑方 10 n
+黑方先 2 nr
+黑旋风 3 n
+黑旗军 32 nr
+黑无常 3 i
+黑日危机 3 l
+黑旦 2 ns
+黑星 3 n
+黑晶 2 nr
+黑暗 2479 z
+黑暗世界 3 nr
+黑暗之刃 3 i
+黑暗时代 3 l
+黑暗面 7 n
+黑曜岩 5 nr
+黑曜石 5 nr
+黑曲霉 3 n
+黑更半夜 3 i
+黑月兄 2 nr
+黑木 19 n
+黑木令 4 nr
+黑木山 2 ns
+黑木崖 81 nr
+黑木梁 5 nr
+黑木瞳 3 n
+黑木耳 31 nr
+黑李子色 3 nr
+黑杰克 3 nr
+黑松 5 nr
+黑松岩 2 nr
+黑松林 5 nr
+黑松汽水 3 n
+黑松沙士 3 ns
+黑松驿乡 2 ns
+黑板 153 n
+黑板刷 3 z
+黑板协调 3 nz
+黑板报 25 n
+黑板擦 3 l
+黑林山 2 ns
+黑林钵 6 nr
+黑林错觉 3 n
+黑枣 6 n
+黑枪 35 n
+黑格 24 n
+黑格尔 335 nr
+黑桃 21 n
+黑案 3 n
+黑桦 12 nr
+黑梅萨 3 nr
+黑棋子 2 nr
+黑棘皮病 2 n
+黑森州 3 ns
+黑森林 12 nr
+黑森森 29 nr
+黑椒 2 n
+黑楂楂 3 n
+黑檀木 3 nr
+黑檀树 3 nr
+黑武士 3 nr
+黑死病 3 n
+黑毛 6 n
+黑毛舌 3 i
+黑气 3 n
+黑水 142 n
+黑水县 4 ns
+黑水城 4 ns
+黑水峪 5 nr
+黑水晶 3 nr
+黑水河 49 ns
+黑水洋 4 ns
+黑水营 2 nr
+黑汉 5 ns
+黑汗 2 ns
+黑沈沈 3 nr
+黑沉 3 z
+黑沉沉 160 z
+黑沙 5 ns
+黑沙掌 5 nr
+黑沙湾 3 ns
+黑沟 2 ns
+黑河 111 ns
+黑河市 15 ns
+黑油 3 n
+黑油油 21 n
+黑油红 2 z
+黑沼 11 n
+黑泥 11 n
+黑泽明 12 nr
+黑洞 222 ns
+黑洞洞 104 nr
+黑派 3 n
+黑海 447 ns
+黑海地区 10 ns
+黑海舰队 44 nt
+黑润 2 n
+黑液 3 n
+黑溜溜 7 z
+黑漆 3 n
+黑漆一团 37 nz
+黑漆漆 113 z
+黑漆皮灯 3 n
+黑漆皮鞋 3 n
+黑潮 75 nr
+黑澄澄 3 nr
+黑火药 3 n
+黑灯下火 3 i
+黑灯瞎火 45 i
+黑灵灵 3 nr
+黑炭 22 n
+黑点 354 n
+黑点儿 3 nr
+黑烟 12 n
+黑烟红 2 nr
+黑热病 15 n
+黑熊 163 z
+黑牌 3 n
+黑牡丹 2 nr
+黑物扣 2 n
+黑状 3 n
+黑狗 57 nr
+黑猩猩 38 n
+黑猪 2 n
+黑猫 14 n
+黑玉断 7 nr
+黑玛丽 2 nr
+黑玫瑰 7 nr
+黑珍珠 4 nr
+黑瓦 35 ns
+黑瓷 14 n
+黑甲军 3 nr
+黑电胶 3 n
+黑疸 3 n
+黑病热 3 z
+黑痣 59 n
+黑瘤 2 n
+黑瘦 33 z
+黑白 666 z
+黑白不分 3 l
+黑白两道 3 n
+黑白分明 45 n
+黑白图片 3 n
+黑白图象 3 n
+黑白子 3 nr
+黑白屏 3 nr
+黑白影片 3 n
+黑白棋 3 nr
+黑白森林 3 ns
+黑白混淆 3 i
+黑白照片 3 n
+黑白片 11 n
+黑白片儿 3 z
+黑白电视 3 n
+黑白画面 3 n
+黑白相间 3 n
+黑白胶片 3 n
+黑白花 13 z
+黑皮 7 n
+黑盒 33 n
+黑盒子 5 nr
+黑盘 3 n
+黑眉乌嘴 3 ns
+黑眼 3 n
+黑眼圈 16 n
+黑眼珠 24 nr
+黑眼睛 3 n
+黑眼镜 3 n
+黑瞎子 48 nr
+黑石 13 nr
+黑石关 2 ns
+黑石沟 2 ns
+黑石礁 14 nr
+黑石礁湾 2 nr
+黑碜碜 3 v
+黑磷 3 n
+黑社会 162 nt
+黑神散 2 nr
+黑种 21 n
+黑种人 3 n
+黑穗病 9 nr
+黑窝 7 n
+黑窝点 4 n
+黑竹 3 nr
+黑笔 3 n
+黑箍 2 n
+黑管 11 n
+黑箱 30 n
+黑箱子 3 nr
+黑箱操作 3 n
+黑箱测试 3 n
+黑簇簇 3 z
+黑米 39 n
+黑粉 2 n
+黑粉病 6 n
+黑粉菌 5 n
+黑粗 3 z
+黑糊糊 35 z
+黑糖 3 n
+黑糯米 3 vn
+黑素 4 n
+黑素瘤 3 nr
+黑素细胞 3 n
+黑索 14 ns
+黑索今 3 nr
+黑索索 2 nr
+黑红 160 z
+黑纱 188 n
+黑纸 3 n
+黑纹 4 n
+黑线 64 n
+黑绸 4 n
+黑绿 9 z
+黑绿色 13 n
+黑网 3 n
+黑罗斯 2 ns
+黑美人 3 nr
+黑老大 16 nr
+黑老虎根 3 nr
+黑职介 3 n
+黑胖 3 z
+黑胡桃 3 nr
+黑胡椒 5 nr
+黑胶 2 n
+黑胶碟 3 n
+黑胶绸 2 n
+黑脂膜 3 n
+黑脂麻 3 n
+黑脉 2 ns
+黑脸 113 n
+黑腾腾 3 z
+黑色 2337 n
+黑色人种 3 n
+黑色化 3 ns
+黑色带 3 n
+黑色幽默 20 nr
+黑色星期 3 n
+黑色火药 8 n
+黑色素 71 n
+黑色素瘤 14 n
+黑色金属 21 n
+黑色链条 3 l
+黑色领带 3 n
+黑色饼干 3 n
+黑芝麻 38 n
+黑芝麻糊 3 n
+黑苍苍 7 z
+黑茫茫 14 z
+黑茬茬 3 n
+黑莓 10 n
+黑蒙蒙 7 nr
+黑蓝红 4 nr
+黑藻 4 nr
+黑虎星 153 nr
+黑虎泉 2 nr
+黑虎玄 8 nr
+黑蚁 3 n
+黑蚂蚁 3 l
+黑蛇 9 n
+黑蝇 3 n
+黑蝙蝠 3 nr
+黑衣 441 n
+黑衣人 87 n
+黑衣服 3 n
+黑衫 3 n
+黑袍 49 n
+黑裙 6 n
+黑褐 3 n
+黑褐色 107 n
+黑角 15 n
+黑言诳语 3 v
+黑诊所 3 n
+黑话 35 n
+黑豆 235 n
+黑豹 40 nr
+黑豹党 3 nr
+黑貂 12 n
+黑账 3 n
+黑货 6 n
+黑质 3 n
+黑超特警 3 nr
+黑路 3 n
+黑车 66 n
+黑边 3 ns
+黑边眼镜 3 l
+黑运 3 n
+黑迭儿 3 nr
+黑道 113 n
+黑道份子 3 n
+黑道日 3 nr
+黑道风云 3 nr
+黑郁 2 z
+黑郁郁 4 z
+黑金 14 n
+黑金刚 3 nr
+黑金刚石 3 nr
+黑金属 3 n
+黑钙土 37 n
+黑钨矿 13 n
+黑钱 25 n
+黑铁 14 n
+黑铅 3 nz
+黑锅 78 n
+黑镜头 3 nr
+黑门 11 ns
+黑阴阴 3 ns
+黑陶 546 nr
+黑陶文化 3 nr
+黑雕 4 n
+黑雾 114 n
+黑霉 2 a
+黑露脊 4 nr
+黑非洲 28 ns
+黑面 44 n
+黑面包 3 n
+黑页岩 3 n
+黑领阶层 3 n
+黑颈鹤 37 n
+黑风 2 n
+黑风双 36 nr
+黑风口 24 n
+黑风孽海 3 i
+黑风山 5 nr
+黑风洞 2 nr
+黑风藤 3 nr
+黑香墨 2 nr
+黑马 192 ns
+黑马公司 3 n
+黑马河 2 ns
+黑马神拼 3 nr
+黑马编校 3 n
+黑驴 15 n
+黑骏马 19 nr
+黑骑士 3 nr
+黑鬼 2 n
+黑魔法 3 nr
+黑鱼 2084 n
+黑鲁帖 2 nr
+黑鲁雪夫 3 nr
+黑鲷 3 n
+黑鳞鲛 9 nr
+黑鸦 28 n
+黑鸭子 3 n
+黑鹰 41 nr
+黑鹰坠落 3 n
+黑鹳 19 n
+黑麦 73 ns
+黑麦草 13 nr
+黑麻答 2 z
+黑黑 3 z
+黑黑家鼠 3 n
+黑黑白白 3 z
+黑黑的 40 z
+黑黜黜 3 i
+黑黝黝 160 z
+黑黢黢 18 z
+黑黪黪 3 z
+黑鼠 3 n
+黑龙会 3 nr
+黑龙江 1472 ns
+黑龙江人民出版社 7 nt
+黑龙江垦区 2 ns
+黑龙江日报 7 nz
+黑龙江省 586 ns
+黑龙江省政府 2 nt
+黑龙江省旅游局 2 nt
+黑龙江队 13 nt
+黑龙河 7 ns
+黑龙洞 2 nr
+黑龙港 8 ns
+黑龙潭 71 ns
+黑龙门 2 ns
+黔 959 j
+黔东南 32 ns
+黔东南州 9 ns
+黔东南苗族侗族自治州 13 ns
+黔剧 2 n
+黔北 42 ns
+黔南 15 ns
+黔南州 2 ns
+黔南布依族苗族自治州 11 ns
+黔县 3 ns
+黔江 33 ns
+黔江区 3 ns
+黔江县 2 ns
+黔江土家族苗族自治县 3 ns
+黔突暖席 3 i
+黔西 23 ns
+黔西南 16 ns
+黔西南州 2 ns
+黔西南布依族苗族自治州 9 ns
+黔西县 3 ns
+黔阳 8 ns
+黔阳县 3 ns
+黔首 18 ns
+黔驴 3 n
+黔驴之技 3 i
+黔驴之计 3 i
+黔驴技孤 3 n
+黔驴技穷 14 i
+默 605 z
+默不作声 200 l
+默不做声 3 i
+默书 3 v
+默从 3 v
+默伯桑 3 nrt
+默克 6 nrt
+默克尔 3 nrt
+默兹河 5 nr
+默写 48 v
+默化 2 v
+默化潜移 3 i
+默启 3 v
+默哀 24 a
+默哀致意 3 i
+默坐 20 v
+默多克 16 nrt
+默契 276 nrt
+默契神会 3 nr
+默存 3 v
+默尔 4 nrt
+默德 13 nrt
+默念 69 v
+默思 3 nrt
+默想 63 v
+默换潜移 3 i
+默斯 2 nrt
+默林 3 nrt
+默求 3 v
+默沙东 5 nr
+默沙东公司 2 nt
+默然 379 d
+默然不语 3 i
+默片 6 z
+默省 3 nrt
+默示录 3 nr
+默祝 3 nrt
+默祷 26 v
+默算 3 v
+默罗 2 nrt
+默而识之 3 i
+默背 3 v
+默视 3 v
+默认 224 v
+默认主页 3 n
+默认值 3 l
+默认设置 3 i
+默认页 3 n
+默认首页 3 n
+默记 18 v
+默许 116 d
+默诵 32 v
+默读 11 v
+默转潜移 3 i
+默里 43 nrt
+默问 3 v
+默顿 19 nrt
+默默 734 d
+默默不语 28 i
+默默地 767 z
+默默无名 3 i
+默默无声 3 i
+默默无言 64 i
+默默无语 45 i
+默默无闻 120 i
+默默耕耘 3 nr
+黚 10 zg
+黛 260 nr
+黛安娜 2 nr
+黛绿 10 nr
+黛绿年华 3 nr
+黛蛾 3 n
+黜 85 v
+黜免 4 v
+黜奢崇俭 3 nr
+黜幽陟明 3 ns
+黜斥 3 v
+黜昏启圣 3 nrfg
+黜衣缩食 3 v
+黜责 3 v
+黜退 3 v
+黜邪崇正 3 nr
+黜陟幽明 3 z
+黝 30 z
+黝帘石 11 n
+黝性 3 n
+黝暗 3 z
+黝黑 157 z
+點 8 zg
+黟 8 ns
+黟县 36 ns
+黠 18 n
+黠慧 3 n
+黠戛斯 50 n
+黢 5 ag
+黢黑 3 z
+黥 49 g
+黧 11 z
+黧黑 45 z
+黩 4 v
+黩武 10 v
+黩武穷兵 3 vn
+黮 8 zg
+黯 56 z
+黯晦消沉 3 i
+黯淡 160 z
+黯淡下来 3 l
+黯淡无光 9 i
+黯然 397 z
+黯然伤神 3 i
+黯然失色 46 i
+黯然无光 3 i
+黯然无色 3 i
+黯然欲绝 3 i
+黯然泪下 3 l
+黯然消魂 3 i
+黯然神伤 53 i
+黯然谷 3 i
+黯然销魂 3 l
+黯霭 3 z
+黯黑 3 z
+黵 3 zg
+黹 5 g
+黺 20 zg
+黻 22 g
+黼 173 g
+黼国黻家 3 i
+黼蔀黻纪 3 i
+黼衣方领 3 i
+黼黻文章 3 i
+黾 96 x
+黾勉 3 v
+黾穴鸲巢 3 v
+鼂 19 zg
+鼇头 3 vn
+鼋 157 ns
+鼋头渚 11 ns
+鼋鱼 2 n
+鼋鸣鳖应 3 n
+鼍 103 g
+鼎 988 ng
+鼎业 3 n
+鼎中 5 ns
+鼎举 3 d
+鼎分三足 2 i
+鼎力 23 n
+鼎力扶持 3 i
+鼎力支持 3 i
+鼎力相助 13 i
+鼎助 3 v
+鼎城 3 ns
+鼎城区 2 ns
+鼎峙 3 v
+鼎成龙升 3 l
+鼎成龙去 3 i
+鼎折覆餗 3 n
+鼎折餗覆 3 v
+鼎新 15 d
+鼎新革故 3 i
+鼎沸 41 v
+鼎湖 2 ns
+鼎湖区 3 ns
+鼎湖山 23 ns
+鼎湖龙去 3 i
+鼎玉龟符 3 n
+鼎盛 279 z
+鼎盛时期 3 i
+鼎盛期 24 i
+鼎立 322 v
+鼎言 3 v
+鼎足 7 z
+鼎足三分 3 i
+鼎足之势 13 i
+鼎足而三 7 i
+鼎足而居 3 i
+鼎足而立 9 i
+鼎铛有耳 3 i
+鼎铛玉石 3 i
+鼎铭 3 n
+鼎锅 3 n
+鼎镬刀锯 3 v
+鼎镬如饴 3 n
+鼎革 3 ns
+鼎食钟鸣 3 i
+鼎食鸣钟 3 i
+鼎鱼幕燕 3 n
+鼎鱼幕蒸 3 n
+鼎鼎 3 nz
+鼎鼎大名 36 i
+鼎鼎有名 4 i
+鼎鼐调和 3 v
+鼐 217 g
+鼓 2674 v
+鼓一村 3 n
+鼓丘 3 n
+鼓乐 567 n
+鼓乐喧天 12 i
+鼓乐声 192 n
+鼓乐队 3 n
+鼓乐齐鸣 18 i
+鼓书 9 n
+鼓儿词 3 n
+鼓出 3 v
+鼓出来 3 v
+鼓动 335 v
+鼓动性 8 n
+鼓动风潮 3 n
+鼓励 2370 v
+鼓励奖 6 n
+鼓励性 7 n
+鼓励类 3 n
+鼓劲 60 v
+鼓包 16 n
+鼓台 3 v
+鼓号 3 n
+鼓号乐队 3 n
+鼓吹 719 v
+鼓吹者 9 n
+鼓吻奋爪 3 n
+鼓吻弄舌 3 v
+鼓唇咋舌 3 v
+鼓唇弄舌 3 i
+鼓唇摇舌 3 i
+鼓噪 184 v
+鼓噪声 2 l
+鼓噪而起 3 l
+鼓囊囊 3 z
+鼓声 328 n
+鼓声隆隆 3 ns
+鼓子词 9 n
+鼓室 21 n
+鼓山 3 ns
+鼓山支行 3 n
+鼓师 12 n
+鼓座 3 n
+鼓弄 3 v
+鼓式 10 n
+鼓惑 4 v
+鼓惑人心 3 i
+鼓感 3 n
+鼓成 3 v
+鼓手 38 v
+鼓捣 39 v
+鼓捶 3 i
+鼓掌 278 v
+鼓掌声 9 n
+鼓掌欢迎 3 i
+鼓旗相当 3 i
+鼓曲 5 v
+鼓板 23 n
+鼓棒 5 n
+鼓椅 3 n
+鼓楼 141 n
+鼓楼区 10 n
+鼓槌 36 n
+鼓气 24 n
+鼓浪 9 nz
+鼓浪屿 21 n
+鼓涨 7 v
+鼓满 3 v
+鼓点 48 n
+鼓点儿 2 n
+鼓点子 3 n
+鼓王 3 nrt
+鼓瑟 3 z
+鼓皮 3 n
+鼓盆之戚 3 l
+鼓眼努睛 3 n
+鼓睛暴眼 3 l
+鼓秋 3 n
+鼓箧 3 i
+鼓翼 3 n
+鼓胀 45 v
+鼓脑争头 3 n
+鼓腮 3 n
+鼓腹 3 n
+鼓腹击壤 3 n
+鼓腹含和 3 i
+鼓腹含哺 3 i
+鼓膜 91 n
+鼓膜炎 3 n
+鼓舌 3 v
+鼓舌如簧 3 i
+鼓舌扬唇 3 n
+鼓舌掀簧 3 nz
+鼓舌摇唇 3 n
+鼓舌摇簧 3 i
+鼓舌摇脣 3 v
+鼓舞 988 v
+鼓舞人心 19 i
+鼓舞士气 3 n
+鼓舞斗志 3 n
+鼓荡 50 v
+鼓衰力尽 3 l
+鼓角 71 n
+鼓角齐鸣 3 l
+鼓词 22 n
+鼓起 3 v
+鼓起勇气 3 i
+鼓起如簧 3 i
+鼓起来 3 v
+鼓足 72 v
+鼓足勇气 3 i
+鼓足干劲 38 l
+鼓锤 3 n
+鼓面 31 n
+鼓颊 3 n
+鼓风 50 n
+鼓风机 13 n
+鼓风炉 19 n
+鼓风管 3 n
+鼓馁旗靡 3 nr
+鼓鼓 14 v
+鼓鼓囊囊 25 z
+鼓鼓掌 2 i
+鼓鼓的 47 z
+鼕鼕 3 z
+鼗 55 g
+鼙 68 x
+鼠 845 n
+鼠偷狗盗 3 i
+鼠入牛角 3 i
+鼠凭社贵 3 l
+鼠啮虫穿 3 nz
+鼠啮蠹蚀 3 vn
+鼠害 17 n
+鼠尾胶 3 n
+鼠尾草 2 n
+鼠屎汙羹 3 n
+鼠屎污羹 3 n
+鼠年 10 t
+鼠心狼肺 3 i
+鼠曲草 3 n
+鼠李糖 9 n
+鼠标 230 n
+鼠标器 4 n
+鼠标垫 3 n
+鼠标悬停 3 l
+鼠标键 3 n
+鼠牙雀角 3 i
+鼠疫 75 n
+鼠疮 12 n
+鼠盗狗窃 3 n
+鼠目 3 n
+鼠目寸光 13 i
+鼠目獐头 3 n
+鼠目麞头 3 n
+鼠穴 2 n
+鼠穴寻羊 3 i
+鼠窃 3 v
+鼠窃狗偷 3 i
+鼠窃狗盗 5 i
+鼠窜 12 v
+鼠窜狼奔 3 l
+鼠窜蜂逝 3 l
+鼠窟 3 n
+鼠笼式 3 n
+鼠类 84 n
+鼠群 3 n
+鼠肉 3 n
+鼠肚鸡场 3 n
+鼠肚鸡肠 2 n
+鼠肝虫臂 3 n
+鼠胆 3 n
+鼠胶 3 n
+鼠腹蜗肠 3 vn
+鼠腹鸡肠 3 i
+鼠臂虮肝 3 v
+鼠药 52 n
+鼠蹊 3 i
+鼠蹊部 3 l
+鼠辈 56 n
+鼠迹狐踪 3 i
+鼠雀之牙 3 i
+鼠雀之辈 3 i
+鼠首偾事 3 vn
+鼠齧虫穿 3 l
+鼠齧蠹蚀 3 vn
+鼢鼠 10 n
+鼩 27 zg
+鼪鼬之迳 3 v
+鼪鼯之径 3 v
+鼬 92 n
+鼬獾 5 n
+鼬鼠 23 n
+鼬鼠皮 3 n
+鼯 21 n
+鼯鼠 15 n
+鼱 7 zg
+鼲 2 zg
+鼴 3 zg
+鼷 27 zg
+鼷腹鹪枝 3 v
+鼷鼠 3 v
+鼷鼠饮河 3 n
+鼸 2 zg
+鼹 12 n
+鼹鼠 20 n
+鼻 1763 n
+鼻中膈 2 n
+鼻中隔 14 n
+鼻儿 4 n
+鼻准 3 n
+鼻准儿 3 n
+鼻出血 3 n
+鼻前棘 3 n
+鼻后棘 3 n
+鼻咽 18 n
+鼻咽癌 54 n
+鼻唇囊肿 3 n
+鼻垩挥斤 3 n
+鼻塌唇青 3 i
+鼻塌嘴歪 3 i
+鼻塌脣青 3 n
+鼻塞 52 n
+鼻头 57 n
+鼻头出火 3 i
+鼻子 1787 n
+鼻子嘴巴 3 n
+鼻子头儿 3 n
+鼻子尖 3 n
+鼻子眼儿 3 n
+鼻子眼睛 3 n
+鼻子走 3 l
+鼻孔 453 n
+鼻孔撩天 3 z
+鼻孔朝天 10 i
+鼻孔辽天 3 i
+鼻尖 117 n
+鼻屎 3 n
+鼻息 154 n
+鼻息如雷 4 i
+鼻息肉 10 n
+鼻旁窦 4 n
+鼻根 3 n
+鼻根点 3 n
+鼻梁 219 n
+鼻梁儿 3 n
+鼻梁骨 4 n
+鼻母音 3 n
+鼻毛 3 n
+鼻水 3 n
+鼻洼子 3 n
+鼻涕 276 n
+鼻涕虫 3 i
+鼻炎 106 n
+鼻烟 23 n
+鼻烟壶 47 n
+鼻烟盒 3 n
+鼻牛儿 3 n
+鼻环 2 n
+鼻甲 17 n
+鼻疽 7 n
+鼻疽病 3 vn
+鼻癌 3 n
+鼻祖 62 n
+鼻科 3 n
+鼻科医学 3 n
+鼻窦 29 n
+鼻窦炎 36 n
+鼻端 54 n
+鼻端出火 3 l
+鼻端生火 3 n
+鼻粘膜 15 n
+鼻翅 3 n
+鼻翅儿 3 n
+鼻翼 72 n
+鼻肿眼青 3 l
+鼻背 3 n
+鼻腔 149 n
+鼻膜 5 n
+鼻血 82 n
+鼻通 3 n
+鼻部 3 n
+鼻酸 6 n
+鼻镜 9 n
+鼻青眼乌 3 n
+鼻青眼紫 3 i
+鼻青眼肿 3 l
+鼻青脸肿 19 l
+鼻青额肿 3 n
+鼻音 31 n
+鼻韵 3 n
+鼻韵母 3 n
+鼻饲 13 v
+鼻骨 27 n
+鼻黏膜 3 v
+鼻黏膜炎 3 n
+鼾 44 n
+鼾声 198 n
+鼾声如雷 3 n
+鼾息 3 n
+鼾息声 3 n
+鼾睡 7 v
+鼾音 3 n
+齁 8 zg
+齄 6 g
+齆 27 zg
+齉 2 zg
+齋 14 zg
+齌 2 zg
+齍 9 zg
+齎 43 zg
+齎送 3 vn
+齐 4450 a
+齐一 3 nr
+齐一儒 3 nr
+齐上城 2 nr
+齐下山 2 nr
+齐世武 6 nr
+齐世荣 5 nr
+齐东野语 6 nz
+齐丞相 3 nr
+齐乃霸 3 nr
+齐之仇 3 nr
+齐之以 3 v
+齐之子 2 nr
+齐乐乐 3 nr
+齐二公子 3 nr
+齐云山 7 nr
+齐云峰 3 nr
+齐亚尼 2 nr
+齐亚拉 3 nr
+齐亚诺 13 nr
+齐人之福 3 i
+齐人攫金 3 vn
+齐人立 2 nr
+齐人著 4 nr
+齐仁圣 3 nr
+齐仁明 2 nr
+齐伐燕 3 nr
+齐众兄弟 2 nr
+齐伯林 4 nr
+齐伯涛 5 nr
+齐俊德 3 nr
+齐儿会 2 nr
+齐元凯 26 nr
+齐元振 5 nr
+齐克尔 3 nr
+齐克新 3 nr
+齐全 1417 nr
+齐其家 2 nrfg
+齐出 3 v
+齐列 3 nr
+齐刷刷 74 z
+齐力 4 nr
+齐化 3 v
+齐化门 139 nr
+齐北 2 ns
+齐去楚 2 nr
+齐发 103 nz
+齐发喊 4 nr
+齐发声 2 nr
+齐发式 3 nz
+齐发足 2 nr
+齐叫化 4 nr
+齐名 474 a
+齐名并价 3 i
+齐后主 5 nr
+齐向东 2 nr
+齐向厅 2 nr
+齐向杨 2 nr
+齐向树 2 nr
+齐向萧 2 nr
+齐向青 2 nr
+齐向鸣 2 nr
+齐呼 3 v
+齐和帝 3 nr
+齐和燕 2 nr
+齐和秦 3 nr
+齐咣齐 2 z
+齐哀公 3 nr
+齐哥得 2 nr
+齐唱 26 v
+齐善行 3 nr
+齐国 312 ns
+齐国人 3 nr
+齐圆健 2 nr
+齐堂主 3 nr
+齐声 1544 nr
+齐声叫好 3 l
+齐声欢唱 3 l
+齐声高唱 3 l
+齐备 173 nr
+齐大非偶 3 i
+齐天乐 2 nr
+齐天圣 5 nr
+齐天大 3 nr
+齐天大圣 3 nr
+齐天府 3 nr
+齐天洪福 3 nr
+齐太公 4 nr
+齐头 9 nr
+齐头并进 42 i
+齐头式 3 l
+齐奏 24 nr
+齐奥塞斯库 17 nz
+齐奥尔科夫斯基 26 nrt
+齐如山 6 nr
+齐姆良 2 nr
+齐威王 17 nr
+齐学启 2 nr
+齐宣王 13 nr
+齐宪代 6 nr
+齐家 45 nrfg
+齐家治国 3 ns
+齐家治国平天下 7 l
+齐对燕 2 nr
+齐射 79 v
+齐尔品 5 nr
+齐尔山 2 nr
+齐尼亚 3 nr
+齐山区 3 ns
+齐岳山 2 nr
+齐峰北 2 nr
+齐崭崭 7 z
+齐州 9 ns
+齐州历 4 nz
+齐布尔 3 nr
+齐师伯 2 nr
+齐师叔 4 nr
+齐平 20 nr
+齐庄公 4 nr
+齐康公 2 nr
+齐强鲁 2 nr
+齐心 89 a
+齐心一力 3 i
+齐心併力 3 v
+齐心协力 96 i
+齐心合力 75 l
+齐心同力 3 i
+齐心并力 3 i
+齐心戮力 3 i
+齐心涤虑 3 i
+齐怀仲 24 nr
+齐怀远 143 nr
+齐性 2 n
+齐截 3 v
+齐戳戳 3 v
+齐手 3 v
+齐抓共管 29 l
+齐抗秦 2 nr
+齐拉贝 2 nr
+齐振江 2 nr
+齐揍 3 v
+齐放 162 nr
+齐放箭 7 nr
+齐政权 2 nr
+齐政门 2 nr
+齐救燕 2 nr
+齐整 142 a
+齐整如一 3 i
+齐文宣 4 nr
+齐文宣帝 3 nr
+齐文明 5 nr
+齐明帝 7 nr
+齐明点 3 nr
+齐景公 6 nr
+齐最强 3 nr
+齐根 13 nz
+齐格勒 34 nr
+齐格弗 9 nr
+齐格菲 14 nr
+齐格达 5 nr
+齐桓公 91 nr
+齐桓公主 2 nr
+齐梁间 3 nr
+齐楚 13 a
+齐楚浙 11 nr
+齐次 38 d
+齐次图 3 nz
+齐步 7 d
+齐步走 11 l
+齐武帝 5 nr
+齐民要术 33 l
+齐永明 6 nr
+齐河 6 nr
+齐河县 3 ns
+齐泯王 2 nr
+齐泰 19 nz
+齐洛诺 5 nr
+齐洛诺夫 18 nr
+齐海山 2 nr
+齐涩然 2 nr
+齐清波 8 nr
+齐烟九点 3 nr
+齐燕铭 6 nr
+齐燮元 2 nr
+齐物 3 n
+齐特勒 5 nr
+齐特拉琴 3 nr
+齐献公 3 nr
+齐王求 3 nr
+齐王田 3 nr
+齐王肥 8 nr
+齐王舍牛 3 nr
+齐王芳 2 nr
+齐王赛 2 nr
+齐用 3 v
+齐白石 91 nr
+齐相国 2 nr
+齐相淖 2 nr
+齐相王 3 nr
+齐眉 28 nr
+齐眉举 3 nr
+齐眉举案 3 i
+齐眉棍 3 l
+齐眉棒 2 nr
+齐眉穗儿 3 nr
+齐福霖 36 nr
+齐立国 3 nr
+齐索姆 2 nr
+齐纨鲁缟 3 nr
+齐纳曼 2 nr
+齐纵亲 2 nr
+齐续春 2 nr
+齐美尔 8 nr
+齐联军 3 nr
+齐聚一堂 3 nz
+齐肩 12 nr
+齐肩拜 2 nr
+齐胸 13 n
+齐腰 3 v
+齐自勉 10 nr
+齐自威 2 nr
+齐行 3 v
+齐襄王 6 nr
+齐观山 2 nr
+齐解甲 3 nr
+齐谢赫 6 nr
+齐豫 3 a
+齐贝吉 2 nr
+齐败魏 2 nr
+齐趋并驾 3 n
+齐足并驰 3 i
+齐足并驱 3 i
+齐达内 273 nz
+齐进齐 3 nr
+齐量等观 3 l
+齐金蝉 3 nr
+齐镳并驱 3 nr
+齐闵王 3 nr
+齐集 110 a
+齐顷公 2 nr
+齐首 3 v
+齐驱并进 3 i
+齐驱并驾 3 nr
+齐驱并骤 3 l
+齐高帝 7 nr
+齐鲁 95 nr
+齐鲁大地 2 nz
+齐鲁晚报 13 nz
+齐鲁石化 8 nr
+齐鸣 119 nr
+齐默尔曼 2 nrt
+齐齐 50 nr
+齐齐儿 4 nr
+齐齐发 2 nr
+齐齐哈尔 89 nr
+齐齐哈尔市 48 ns
+齐齐尔 6 nr
+齐齐扎 2 nr
+齐齐整整 3 z
+齐齐站 2 nr
+齑 34 n
+齑粉 32 n
+齑身粉骨 3 n
+齙 18 zg
+齛 3 zg
+齡 2 zg
+齣 8 zg
+齧 2 zg
+齧合 3 z
+齧断 3 vn
+齧齿类 3 nz
+齸 3 zg
+齹 276 zg
+齿 1253 n
+齿亡舌存 3 n
+齿位 3 n
+齿冠 27 n
+齿冷 3 n
+齿剑如归 3 l
+齿印 3 n
+齿危发秀 3 n
+齿唇音 3 n
+齿垢 3 n
+齿如含贝 3 n
+齿如编贝 3 n
+齿孔 3 n
+齿孔酸 3 n
+齿寒 3 n
+齿少心锐 3 n
+齿少气锐 3 n
+齿弊舌存 3 n
+齿形 8 n
+齿接手 3 n
+齿条 9 n
+齿根 11 nz
+齿槽 14 n
+齿牙为祸 3 l
+齿牙余论 3 l
+齿牙春色 3 n
+齿牙馀惠 3 vn
+齿牙馀慧 3 nr
+齿牙馀论 3 vn
+齿状 3 n
+齿状回 3 l
+齿状物 3 l
+齿甘乘肥 3 n
+齿白 3 n
+齿白唇红 7 l
+齿科 9 nz
+齿缝 7 n
+齿耙 3 n
+齿腔 3 n
+齿舌 3 n
+齿舞 2 n
+齿豁头童 3 nz
+齿质 3 n
+齿轮 283 n
+齿轮厂 3 n
+齿轮油 4 n
+齿轮泵 3 n
+齿轮箱 19 n
+齿轮轴 3 nz
+齿轴 3 n
+齿过肩随 3 l
+齿间 3 n
+齿音 4 n
+齿颊挂人 3 v
+齿颊生香 3 z
+齿髓 3 n
+齿鲸 15 n
+齿鸟类 3 n
+齿龈 5 n
+齿龈炎 3 n
+龀 109 g
+龁 8 zg
+龃 113 n
+龃齿 3 n
+龃龉 42 n
+龃龉不合 3 z
+龄 710 zg
+龄期 11 n
+龄级 3 n
+龅 299 n
+龅牙 4 n
+龆 93 g
+龇 135 v
+龇牙 3 i
+龇牙咧嘴 36 i
+龇牙裂嘴 3 i
+龈 78 g
+龈上牙石 3 n
+龈下牙石 3 n
+龈乳头 3 n
+龈乳头炎 3 n
+龈交 3 n
+龈切除术 3 n
+龈变性 3 n
+龈口炎 3 n
+龈成形术 3 n
+龈沟 3 n
+龈炎 3 n
+龈炎指数 3 n
+龈牙纤维 3 n
+龈瓣 3 n
+龈袋 3 n
+龈谷 3 n
+龈齿弹舌 3 n
+龉 102 x
+龊 69 x
+龋 269 n
+龋失补 3 n
+龋失补牙 3 n
+龋病学 3 n
+龋齿 71 n
+龌 70 a
+龌龊 74 a
+龌龊事 3 vn
+龔 37 zg
+龕 437 zg
+龙 9197 n
+龙一脉 2 nr
+龙丹 9 ns
+龙举云兴 3 nr
+龙举云属 3 nr
+龙之介 6 nr
+龙之吻 3 nr
+龙之国 3 nr
+龙之士 2 nr
+龙之峡谷 3 nr
+龙之梦 3 nr
+龙之臣 12 nr
+龙之舞 3 nr
+龙乐豪 267 nr
+龙争虎战 3 i
+龙争虎斗 15 nr
+龙二虎 5 nr
+龙云飞 3 nr
+龙五 3 n
+龙井 242 ns
+龙井县 3 ns
+龙井市 4 ns
+龙井村 9 nr
+龙井茶 120 nr
+龙亚目 14 nr
+龙京沙 35 ns
+龙亭 406 nr
+龙亭区 3 nr
+龙介虫 4 nr
+龙伏渊 2 nr
+龙众 3 n
+龙伸蠖屈 3 n
+龙体 19 n
+龙儿蒙 2 nr
+龙儿跃 2 nr
+龙兄虎弟 3 nr
+龙先擒 4 nr
+龙光塔 2 nr
+龙光寺 2 nr
+龙光电 3 nz
+龙兴 8 ns
+龙兴云属 3 nr
+龙兴元 4 nr
+龙兴凤举 3 nr
+龙兴寺 4 nr
+龙兴江 4 ns
+龙兵华 2 nr
+龙冈 19 ns
+龙冠海 3 nr
+龙净环保 3 nz
+龙凤 141 nr
+龙凤区 3 nr
+龙凤呈祥 13 nr
+龙凤斗 3 nr
+龙凤胎 3 nr
+龙凤配 3 nr
+龙凤饼 3 nr
+龙勃罗 6 nr
+龙化虎变 3 nz
+龙十象 2 nr
+龙华 39 nz
+龙华区 3 ns
+龙华塔 4 nr
+龙华寺 8 ns
+龙华工专 3 nt
+龙华民 5 nr
+龙华烈士陵园 6 ns
+龙华路 3 ns
+龙华镇 4 ns
+龙南 4 ns
+龙南县 6 ns
+龙博利 2 nr
+龙博斗 3 nr
+龙卷 33 n
+龙卷风 69 nr
+龙原府 2 nr
+龙去鼎湖 3 nr
+龙发 10 nz
+龙取睛 2 n
+龙口 118 n
+龙口夺食 3 n
+龙口市 15 ns
+龙台 2 n
+龙史进 3 nr
+龙合玺 256 nr
+龙向超 2 nr
+龙君 4 nr
+龙吟 17 nr
+龙吟虎啸 4 nr
+龙吴 2 ns
+龙吴港 3 nr
+龙哥 7 ns
+龙喷彩 2 nr
+龙图腾 3 nr
+龙图阁 20 nr
+龙场 24 n
+龙城 77 ns
+龙城区 3 ns
+龙培培 3 nr
+龙基纳 3 nr
+龙塘坝乡 3 ns
+龙多乃旱 3 nr
+龙大 515 ns
+龙大哥 3 nr
+龙大渊 3 nr
+龙天武 2 nr
+龙太子 3 nr
+龙太郎 3 nr
+龙头 1430 n
+龙头乡 2 ns
+龙头企业 3 n
+龙头山 3 ns
+龙头老大 3 i
+龙头股 3 n
+龙头蛇尾 3 i
+龙头锯角 3 n
+龙夺锦 2 nr
+龙套 22 nz
+龙女 3 n
+龙女召 2 nr
+龙女娇 2 nr
+龙女影 2 nr
+龙女微 4 nr
+龙女池 2 nr
+龙女秀 6 nr
+龙女连 2 nr
+龙如林 2 nr
+龙如风 3 nr
+龙姊姊 6 nr
+龙姑娘芳 2 nr
+龙姿凤采 3 i
+龙威虎震 3 nr
+龙子 8 n
+龙子龙 25 nr
+龙子龙女 3 nr
+龙子龙孙 3 nr
+龙守大 2 nr
+龙安 3 ns
+龙安区 3 ns
+龙宗武 3 nr
+龙宫 317 nr
+龙宫洞 7 nr
+龙家 6 n
+龙家妹妹 2 nr
+龙宾 2 ns
+龙寺 3 ns
+龙少爷 3 nr
+龙尾 83 ns
+龙尾山 4 nr
+龙屈蛇伸 3 i
+龙山 206 ns
+龙山区 3 ns
+龙山县 5 ns
+龙山寺 3 ns
+龙山庄 3 nr
+龙山文化 179 nz
+龙山镇 5 ns
+龙岗 19 nr
+龙岗区 20 n
+龙岗山 2 nr
+龙岛主 43 nr
+龙岩 50 nr
+龙岩坡 2 nr
+龙岩市 8 ns
+龙岭 48 ns
+龙岭迷 18 nr
+龙崎 3 ns
+龙川 20 ns
+龙川令 3 nr
+龙川县 4 ns
+龙川江 3 ns
+龙川王 3 nr
+龙州 25 ns
+龙州县 12 ns
+龙年大吉 3 nr
+龙庆峡 7 nr
+龙床 3 nz
+龙床快婿 3 i
+龙应台 8 n
+龙庭 10 n
+龙引兵 2 nr
+龙形 35 n
+龙形玉 4 nr
+龙御上宾 3 nr
+龙德在田 3 nr
+龙德宫 6 nr
+龙德邻 19 nr
+龙心 4 n
+龙心凤肝 3 n
+龙成亲 2 nr
+龙成凤 2 nr
+龙战 2 nz
+龙战士 3 nz
+龙战玄黄 3 nr
+龙战虎争 3 nz
+龙战鱼骇 3 n
+龙户文 2 nr
+龙抄手 3 n
+龙抢珠 14 nr
+龙抬头 3 n
+龙抱柱 3 nr
+龙拏虎掷 3 i
+龙拏虎跳 3 nr
+龙掌 2 n
+龙探海 2 nr
+龙摄影 3 n
+龙摇摇 6 nr
+龙攀凤附 3 nr
+龙文 3 nz
+龙文五笔 3 nr
+龙文区 3 nr
+龙文鼎 2 nr
+龙断之登 3 i
+龙断可登 3 i
+龙新民 4 nr
+龙方 3 n
+龙旋风 3 nr
+龙无畏 3 i
+龙日一 3 nr
+龙昆南 4 ns
+龙晃晃 2 nr
+龙服 128 n
+龙朔 9 ns
+龙机发 4 nz
+龙李俊 9 nr
+龙杠 3 n
+龙林杰 2 nr
+龙枪 3 n
+龙柏球 3 nr
+龙柏苗 3 nr
+龙标遥 2 nr
+龙树 31 nr
+龙树著 2 nr
+龙栖凤 2 nr
+龙校注 2 nr
+龙桥 12 ns
+龙椅 83 n
+龙楼凤城 3 nr
+龙楼凤池 3 nr
+龙楼凤阁 3 nr
+龙楼凤阙 3 nr
+龙母镇 3 nr
+龙比亚 6 ns
+龙水 2 n
+龙永图 54 nr
+龙汇 4 n
+龙江 69 ns
+龙江县 3 ns
+龙江虎浪 3 nz
+龙江路 3 ns
+龙江镇 3 ns
+龙池 15 ns
+龙沙 7 ns
+龙沙区 2 ns
+龙沟 2 ns
+龙河 12 ns
+龙泉 404 nz
+龙泉剑 3 nr
+龙泉县 4 ns
+龙泉寺 8 nr
+龙泉山 22 ns
+龙泉市 6 ns
+龙泉窑 25 nr
+龙泉路 3 ns
+龙泉镇 3 ns
+龙泉驿 20 ns
+龙泉驿区 20 ns
+龙泓涧 4 nr
+龙洋 5 ns
+龙洞 52 nr
+龙津 3 ns
+龙津桥 2 nr
+龙济光 4 nr
+龙海 8 ns
+龙海县 5 ns
+龙海市 4 ns
+龙涎 3 i
+龙涎香 11 i
+龙港 8 ns
+龙港区 3 ns
+龙港镇 3 ns
+龙游 19 n
+龙游县 4 ns
+龙游帮 16 nr
+龙游曲沼 3 n
+龙湖 13 ns
+龙湖区 9 ns
+龙湫 8 nz
+龙湾 39 ns
+龙湾区 2 ns
+龙源口 5 ns
+龙溪河 3 nr
+龙滩 5 ns
+龙潜凤采 3 nr
+龙潭 79 ns
+龙潭区 3 ns
+龙潭山 3 ns
+龙潭湖 9 ns
+龙潭虎穴 42 ns
+龙潭虎窟 3 ns
+龙火 13 n
+龙火炼 2 nr
+龙灯 38 n
+龙点晴 2 nr
+龙烟铁矿 3 nz
+龙爪槐 4 n
+龙牌 3 n
+龙牙星 3 nz
+龙牙草 3 nz
+龙牡壮骨冲剂 2 nr
+龙狼传 3 nr
+龙献寿 2 nr
+龙玉琪 2 nr
+龙王 373 nr
+龙王堂 13 nr
+龙王庙 64 nr
+龙王潭公园 2 ns
+龙王爷 34 nr
+龙玺堂 2 nr
+龙生九子 13 nr
+龙生九种 3 i
+龙生岗 2 nr
+龙生龙 9 nr
+龙生龙凤 3 nr
+龙画凤 129 nr
+龙画虎 2 nr
+龙白虎 2 nr
+龙的传人 3 n
+龙皮 8 n
+龙益飞 2 nr
+龙盘凤翥 3 nr
+龙盘凤舞 3 nr
+龙盘凤逸 3 nr
+龙盘虎拏 3 nz
+龙盘虎踞 2 i
+龙目岛 20 ns
+龙眉凤 2 nr
+龙眉凤目 3 i
+龙眉豹颈 3 n
+龙眼 177 n
+龙眼乾 3 nr
+龙眼树 3 nr
+龙眼肉 3 n
+龙睁虎眼 3 i
+龙睛 3 n
+龙石重 2 nr
+龙神 3 n
+龙神丐 2 n
+龙神马壮 3 i
+龙票 3 n
+龙禁尉 6 nr
+龙种 21 n
+龙科 5 nz
+龙科技 3 nz
+龙穴 3 n
+龙窑 9 nz
+龙章凤 4 nr
+龙章凤函 3 nr
+龙章凤姿 3 nr
+龙章凤彩 3 nr
+龙章秀骨 3 nr
+龙章麟角 3 nr
+龙竹坪 3 nr
+龙筹股 3 nr
+龙精虎猛 2 nr
+龙纪元 3 nr
+龙纹 11 n
+龙纹剑 3 nr
+龙纹尊 2 nr
+龙纹玉 2 nr
+龙绘凤 3 nr
+龙绣凤 3 nr
+龙羊峡 30 nr
+龙羊峡水电站 15 nz
+龙翔凤翥 3 nr
+龙翔凤舞 3 nr
+龙翔凤跃 3 nr
+龙翔虎跃 3 nr
+龙翰凤翼 3 nr
+龙翰凤雏 3 nr
+龙肝凤脑 3 i
+龙肝凤髓 5 n
+龙肝豹胎 3 n
+龙胆 34 nr
+龙胆三糖 3 nr
+龙胆二糖 3 nr
+龙胆科 6 nr
+龙胆紫 2 nr
+龙胆草 9 nr
+龙背 9 n
+龙胜县 2 ns
+龙胜各族自治县 8 ns
+龙胡之痛 3 i
+龙脉 145 ns
+龙脊 3 n
+龙脑 3 n
+龙腾凤集 3 nr
+龙腾渊 2 nr
+龙腾虎啸 3 nr
+龙腾虎掷 3 i
+龙腾虎跃 18 nr
+龙腾虎踞 3 i
+龙腾虎踯 3 n
+龙腾虎蹴 3 i
+龙腾豹变 3 i
+龙舌兰 13 ns
+龙舞 27 n
+龙舟 230 nz
+龙舟竞渡 3 nr
+龙舟竞赛 3 nr
+龙舟节 3 nr
+龙舟赛 2 nr
+龙舟队 3 nr
+龙船 287 n
+龙船竞赛 3 nr
+龙船花 3 n
+龙船调 3 n
+龙船赛 3 nr
+龙芯 3 nr
+龙芽草 2 nr
+龙荒朔漠 3 ns
+龙荒蛮甸 3 n
+龙菲尔 5 nr
+龙葵 15 n
+龙藏 5 ns
+龙虎 59 nr
+龙虎乱舞 3 i
+龙虎山 34 nr
+龙虎斗 8 nr
+龙虎榜 3 nr
+龙虎网 3 nr
+龙虎豹 4 nr
+龙虎门 3 nr
+龙虎风云 5 nr
+龙虾 101 nr
+龙虾肉 3 nr
+龙虾节 3 nr
+龙蛇 16 n
+龙蛇杂处 3 i
+龙蛇混杂 10 i
+龙蛇飞动 3 i
+龙蛇飞舞 3 i
+龙蛰蠖屈 3 n
+龙蟠 4 nr
+龙蟠凤翥 3 nr
+龙蟠凤逸 3 nr
+龙蟠虎伏 3 nr
+龙蟠虎绕 3 nr
+龙蟠虎踞 6 i
+龙蟠虬结 3 z
+龙蟠路 2 nr
+龙血凤髓 3 n
+龙血树 3 n
+龙血玄黄 3 nr
+龙行虎变 3 i
+龙行虎步 2 i
+龙街 2 ns
+龙衮 2 nrt
+龙袍 492 n
+龙袍加身 3 i
+龙观站 2 n
+龙言凤语 3 i
+龙语 2 nz
+龙象 18 n
+龙贝格 2 nr
+龙超峰 2 nr
+龙超科 2 nr
+龙跃凤鸣 3 nr
+龙跃虎踞 3 i
+龙跃鸿矫 3 nr
+龙跧虎卧 3 nr
+龙跳虎伏 3 i
+龙跳虎卧 3 nr
+龙蹲虎踞 3 v
+龙身 31 n
+龙车 14 n
+龙逆天 3 nr
+龙邹润 3 nr
+龙里 24 ns
+龙里县 2 ns
+龙钟 11 nr
+龙钟老态 4 nr
+龙银 3 nz
+龙镇 4 ns
+龙门 835 ns
+龙门刨 7 n
+龙门县 6 ns
+龙门口 3 ns
+龙门吊 2 n
+龙门客栈 3 n
+龙门寺 3 ns
+龙门山 45 ns
+龙门架 3 n
+龙门汤 6 nr
+龙门点额 3 n
+龙门石窟 24 ns
+龙门路 3 ns
+龙门镇 4 ns
+龙门阵 7 nr
+龙闻哀 2 nr
+龙阳 6 ns
+龙阳泣鱼 3 n
+龙阳路 3 ns
+龙陵 9 ns
+龙陵县 2 ns
+龙集贞 2 nr
+龙雏凤种 3 nr
+龙雕凤咀 3 i
+龙韬豹略 3 nr
+龙音 6 n
+龙须 14 n
+龙须沟 19 ns
+龙须河 3 nr
+龙须茶 3 nr
+龙须草 12 nr
+龙须菜 2 nr
+龙须面 6 n
+龙颜 20 nr
+龙颜不悦 3 nr
+龙颜凤姿 3 nr
+龙颜大悦 3 nr
+龙颜碑 3 nr
+龙飞 26 nr
+龙飞凤翥 3 nr
+龙飞凤舞 27 nr
+龙飞虎 3 nr
+龙飞虎跳 3 i
+龙首 25 n
+龙首山 14 nr
+龙首渠 4 nr
+龙首豕足 3 i
+龙马 23 ns
+龙马潭区 3 ns
+龙马精神 4 nr
+龙驭上宾 6 i
+龙驰虎骤 3 nr
+龙驹 86 nr
+龙驹凤雏 3 nr
+龙驹镇 2 nr
+龙骏跃 2 nr
+龙骑兵 3 nr
+龙骑士 3 nr
+龙骧凤矫 3 nr
+龙骧虎啸 3 nr
+龙骧虎步 2 i
+龙骧虎视 3 nr
+龙骧虎跱 3 nr
+龙骧蠖屈 3 vn
+龙骧豹变 3 i
+龙骧麟振 3 nr
+龙骨 207 n
+龙骨坡 3 nr
+龙骨山 10 nr
+龙骨水车 2 n
+龙骨车 3 n
+龙髯紫 2 nr
+龙鬼蛇神 3 i
+龙鳞状 2 nr
+龙鸣剑 2 nr
+龙鸣狮吼 3 nr
+龙齐诺 2 nr
+龙齿 3 n
+龚 176 nr
+龚世萍 2 nr
+龚书铎 2 nr
+龚二人 2 nr
+龚云甫 3 nr
+龚伟强 5 nr
+龚先生 4 nr
+龚光杰 44 nr
+龚古尔 24 nr
+龚子敬 2 nr
+龚孝升 12 nr
+龚学平 2 nr
+龚完敬 5 nr
+龚定庵 3 nr
+龚定敬 2 nr
+龚宝铨 5 nr
+龚家村 3 nr
+龚建国 29 nr
+龚德俊 6 nr
+龚心瀚 3 nr
+龚志国 2 nr
+龚意田 3 nr
+龚慈恩 3 nr
+龚施茜 3 nr
+龚晓犁 2 nr
+龚普洛 3 nr
+龚智超 7 nr
+龚松林 10 nr
+龚永明 3 nr
+龚永泉 5 nr
+龚泽艺 256 nr
+龚睿 8 nrfg
+龚祖同 2 nr
+龚秋婷 3 nr
+龚老爷 2 nr
+龚育之 19 nr
+龚自珍 28 nr
+龚蓓苾 3 nr
+龚虹嘉 3 nr
+龚诗嘉 3 nr
+龛 223 ng
+龜 2 zg
+龟 903 ns
+龟儿子 123 n
+龟兆 3 nz
+龟兹 215 ns
+龟兹王 3 nrt
+龟冷搘床 3 v
+龟冷支床 3 n
+龟卜 3 n
+龟厌不告 3 l
+龟壳 33 n
+龟壳花 3 n
+龟头 34 n
+龟头炎 3 n
+龟山 23 ns
+龟山乡 3 ns
+龟山岛 3 ns
+龟年鹤寿 3 ns
+龟年鹤算 3 l
+龟文 3 nz
+龟文写迹 3 n
+龟文鸟迹 3 n
+龟板 10 n
+龟毛免角 3 n
+龟毛兔角 3 n
+龟溪 3 ns
+龟玉 3 nz
+龟王 3 nz
+龟甲 92 ns
+龟甲胶 3 nz
+龟筮 3 n
+龟纹 3 n
+龟缩 29 v
+龟肉 3 n
+龟背 21 n
+龟背竹 3 n
+龟苓膏 3 n
+龟苗 3 n
+龟裂 34 v
+龟足 5 v
+龟鉴 2 n
+龟镜 3 nz
+龟鳖 3 n
+龟鹤遐寿 3 l
+龟龄鹤算 3 n
+龟龙片甲 3 nz
+龟龙麟凤 3 ns
+龠 5 g
+龢 732 zg
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/char_state_tab.utf8 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/char_state_tab.utf8
new file mode 100644
index 0000000000..e1e4d8d815
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/char_state_tab.utf8
@@ -0,0 +1,6653 @@
+#某个字的候选状态集合
+#格式
+#字:状态1;状态2;状态3;
+#状态集合是{B,E,M,S}和词性集合的笛卡尔乘积,所以用二元组表示
+
+耀:E,v;M,nr;E,nr;B,a;S,v;E,a;M,nt;B,i;B,n;B,ns;B,nz;E,n;M,i;S,vg;M,nrfg;M,n;E,nrfg;
+涉:B,v;E,v;S,vg;B,vn;B,n;M,n;E,i;M,l;M,i;E,nr;M,nr;E,vn;B,ns;E,l;S,j;B,i;
+谈:S,v;B,vn;B,v;E,v;E,vn;M,n;E,i;E,n;B,i;B,nr;B,n;M,i;E,nz;M,l;B,l;E,l;M,nz;E,a;E,nr;M,v;M,nr;B,nz;M,j;
+伊:B,ns;B,nz;B,nr;S,j;B,nrt;M,nr;E,nr;M,ns;E,nrt;M,nrt;B,n;B,v;M,nz;E,n;M,nt;E,ns;B,nt;E,nz;B,j;M,l;E,m;M,i;
+亟:B,v;S,d;B,d;B,l;E,nr;
+洞:S,n;E,n;B,n;E,nr;E,ns;B,v;B,ns;M,nr;M,z;E,z;M,n;E,a;E,v;B,i;M,i;M,ns;M,l;B,j;B,vn;E,l;B,nrt;M,v;
+咣:S,o;B,o;E,nr;
+猢:B,n;M,l;B,l;
+悫:S,ag;E,nr;
+缪:B,nr;E,i;M,nr;S,nr;E,nr;S,q;E,v;E,nrt;B,nrt;E,n;
+河:B,ns;E,ns;B,n;S,n;E,n;E,nr;M,ns;B,s;E,v;E,nz;M,n;B,nt;B,nr;M,nr;E,nrt;E,i;E,nrfg;E,j;M,i;M,nt;B,nz;B,v;M,nz;B,l;B,nrt;M,j;E,l;M,l;B,j;B,i;E,vn;B,vn;M,t;M,nrt;
+临:E,v;B,b;B,v;S,v;B,ns;E,ns;B,vn;E,nr;B,n;M,i;M,nr;M,nt;B,nrt;B,i;M,nz;B,d;M,n;M,l;B,nz;B,nt;B,l;M,ns;B,j;E,nrfg;E,nz;E,l;
+犷:E,a;B,a;
+吸:B,v;S,v;E,v;B,n;M,n;M,l;B,vn;E,l;E,vn;B,nz;B,l;E,n;E,b;B,b;E,nz;M,i;M,nr;M,b;
+娼:B,n;E,v;E,n;E,i;E,vn;E,l;M,n;
+线:E,n;S,n;B,n;M,n;E,s;E,m;E,nz;E,j;E,f;M,b;E,vn;E,l;E,v;E,b;E,nr;M,l;B,l;B,s;M,nr;S,m;E,i;B,b;M,nt;E,nt;B,nz;M,nz;B,j;M,i;B,ns;M,ns;
+反:B,v;S,v;B,d;B,vn;E,v;B,n;M,n;B,a;B,c;M,l;M,i;B,f;B,i;B,j;E,c;B,l;E,i;B,nz;E,b;E,vn;E,j;M,nz;B,b;M,v;E,l;M,j;B,nt;
+牌:E,n;E,v;S,n;B,n;E,b;E,nz;M,n;E,l;E,i;E,nr;M,nt;E,j;M,vn;M,l;E,nrt;B,ns;M,ns;
+雏:B,n;S,ng;E,v;E,n;E,nr;M,nr;B,nz;E,i;
+姑:B,n;E,n;S,n;M,n;E,nr;M,nr;B,v;B,d;B,ns;M,ns;B,b;B,i;E,ns;S,dg;B,l;M,l;M,i;
+硐:S,g;
+鳓:S,g;
+卢:B,nr;B,ns;B,n;S,j;M,nr;E,nr;S,nr;E,n;E,ns;B,nrt;M,ns;B,nrfg;B,nz;M,n;M,nrt;E,nrt;M,nz;B,q;E,nz;
+知:B,v;E,v;B,n;S,v;E,n;B,a;M,i;E,i;M,n;E,nr;M,nr;E,l;M,l;E,a;E,vn;B,l;B,i;B,vn;M,v;M,nt;E,nrfg;M,ns;E,ns;B,b;B,nt;B,ns;B,nz;
+除:S,p;E,v;B,p;B,v;B,c;B,n;B,l;B,t;B,nz;M,n;M,i;M,l;B,vn;E,i;M,nz;B,i;E,nr;E,n;E,vn;
+彪:E,nr;S,q;M,nr;B,i;B,a;B,v;E,nrfg;B,b;
+觱:B,n;
+闹:S,v;E,a;B,v;E,v;B,n;B,z;M,z;E,z;M,l;E,l;M,v;M,n;B,l;E,vn;E,nr;E,i;B,vn;B,a;B,ns;B,nz;
+廿:B,m;S,m;M,m;E,m;
+覆:B,v;S,vg;B,n;M,i;E,v;E,i;E,nr;E,n;M,l;B,i;B,vn;E,nz;B,nz;E,vn;M,n;
+辊:E,n;E,nz;B,n;
+应:B,v;S,v;E,v;E,vn;B,vn;E,n;M,n;B,n;E,l;M,i;M,nr;B,nr;E,d;B,i;M,l;E,i;E,nr;B,nz;B,ns;B,b;E,ns;B,l;E,nz;M,v;E,nrfg;B,nrfg;M,nz;M,nrfg;M,ns;
+蠛:S,x;
+踟:B,v;
+儡:E,n;M,n;S,x;E,nr;
+皤:S,g;E,nr;
+崩:B,v;S,v;M,i;E,v;E,n;B,n;M,n;M,nr;B,vn;E,i;
+芬:E,nr;B,ns;S,j;B,n;M,nr;B,nrt;M,n;M,ns;B,nz;E,nrt;B,nt;E,ns;E,a;E,nz;E,n;
+冶:B,n;E,j;B,v;S,vg;E,ns;M,nr;E,nr;E,v;B,vn;M,ns;E,a;M,nt;E,n;E,vn;M,l;M,nrfg;B,nt;B,a;
+骼:E,n;M,n;S,x;
+赉:S,g;M,nr;E,nr;E,nrt;M,ns;
+湟:B,ns;S,g;E,nr;M,nr;
+跞:S,x;E,nr;
+囤:S,v;B,v;B,i;E,n;
+峨:B,ns;E,z;B,n;B,i;M,ns;E,nrt;
+括:E,v;S,v;B,n;E,nr;M,n;E,a;M,nz;E,nrfg;M,i;
+棰:S,v;E,n;M,ns;
+豳:S,g;
+滴:S,v;B,n;E,n;E,m;B,v;B,o;E,i;S,q;M,n;B,z;B,i;M,z;E,z;M,m;M,o;S,m;E,nr;M,i;B,ns;B,l;M,nz;B,vn;E,l;B,nz;M,vn;M,l;M,nr;
+须:E,d;S,d;E,n;B,n;B,nr;B,t;E,v;B,v;M,nr;M,i;M,n;M,ns;B,l;E,nr;B,ns;M,l;E,nrt;M,nz;E,i;B,nrt;
+孽:S,ag;E,n;E,v;B,n;M,i;B,nz;B,i;
+鹿:B,nr;S,n;E,n;B,n;E,nr;M,nr;M,ns;B,ns;E,nz;M,nz;E,ns;S,nr;M,i;E,nrt;E,v;B,i;E,l;B,nrt;E,i;
+沉:B,v;B,a;S,v;B,n;E,a;E,v;E,z;B,z;M,z;B,vn;M,i;M,l;B,i;E,nr;E,i;B,ad;E,n;B,l;M,nr;E,l;E,vn;M,b;E,nrfg;
+上:S,f;B,v;E,s;B,ns;E,f;E,v;B,t;B,n;E,n;E,d;B,f;B,b;B,j;E,t;E,l;B,nt;M,v;M,i;M,n;M,l;B,l;E,ns;E,i;B,nr;B,s;M,nr;B,vn;B,nz;B,m;B,nrt;M,c;B,a;M,f;E,b;M,b;M,ns;B,i;E,nr;B,z;M,t;E,z;M,m;M,nt;E,nrt;M,j;B,mq;M,a;M,nrt;M,nz;M,mq;
+犍:B,ns;B,n;
+后:S,f;E,f;E,t;B,n;E,c;E,d;B,t;B,f;E,n;B,r;E,nr;E,a;B,v;E,v;B,vn;E,s;M,l;B,nr;B,i;M,i;B,b;E,l;M,n;E,i;B,ns;E,b;M,nr;M,f;B,nz;B,j;E,j;M,j;B,l;M,s;B,nrt;M,t;M,v;M,nt;M,ns;B,s;M,nz;M,nrt;
+碑:E,n;S,n;B,n;E,nr;M,b;E,nz;E,i;M,nr;E,ns;M,i;M,ns;B,ns;E,v;
+餐:B,n;E,n;S,ng;E,v;E,m;M,n;E,vn;E,l;M,i;E,i;E,r;S,m;E,j;B,i;
+怖:E,a;M,n;S,vg;E,i;E,l;M,nr;E,nr;
+蒙:B,ns;M,ns;S,v;B,nr;E,nr;B,nz;B,n;B,v;M,nr;B,l;E,v;E,ns;E,z;M,l;E,nrt;E,vn;B,i;B,nrt;M,z;B,z;E,n;B,a;E,a;B,nrfg;B,nt;B,vn;M,nt;M,v;M,nrt;M,n;E,nz;E,l;M,nz;E,nrfg;E,i;
+邡:S,g;E,ns;M,ns;
+砦:S,g;E,n;E,nr;
+鲩:S,g;
+枯:B,n;S,v;B,v;B,a;B,t;E,v;B,z;M,i;M,n;B,i;E,nr;B,l;B,an;E,z;
+伴:B,v;E,n;S,v;E,v;B,n;M,n;E,nr;B,vn;M,nr;E,nz;
+玷:B,v;
+逶:B,z;
+离:B,v;S,v;E,v;E,n;B,n;M,n;E,vn;M,i;E,i;B,vn;B,a;B,ns;E,nr;B,i;M,nz;E,a;E,d;M,nr;B,b;E,l;M,l;B,l;M,b;B,nz;B,j;M,j;
+羿:S,nr;E,nrt;E,nr;B,nr;M,nr;
+浈:S,g;E,nr;M,nr;
+壑:S,ng;E,n;E,nr;M,n;E,i;M,nr;M,i;E,v;E,l;
+罔:S,g;M,i;B,i;B,v;E,nr;
+盥:B,b;B,n;B,v;
+裱:S,v;E,v;B,v;
+号:E,n;S,q;S,m;B,n;B,v;E,m;E,v;M,n;E,nz;E,b;M,i;E,nr;B,l;M,l;E,l;E,i;M,vn;E,vn;M,nz;M,nr;M,b;
+灶:S,n;E,n;B,n;E,v;E,i;E,nr;M,ns;M,nr;E,l;
+铹:S,g;
+姻:E,n;B,n;E,v;M,n;M,i;M,nr;M,nz;
+忿:B,a;B,i;M,i;B,n;
+节:E,n;B,n;B,v;S,n;E,vn;E,t;B,t;M,n;E,v;E,m;S,m;B,vn;E,nr;M,l;B,a;E,i;E,ns;E,l;B,l;B,i;E,j;M,b;M,i;M,ns;M,nr;B,b;E,b;E,nz;M,nz;B,j;B,ns;E,nt;E,nrfg;B,nz;M,z;E,z;
+厌:B,v;E,v;S,vg;M,i;B,vn;E,i;B,n;E,n;E,l;M,l;M,n;E,a;E,nr;
+钎:E,n;S,ng;B,n;E,nr;
+骒:B,n;
+茗:S,ng;E,v;M,nr;E,nr;E,n;
+褛:E,z;E,l;S,x;M,i;
+倡:E,v;B,v;S,vg;B,n;M,l;M,n;E,nr;M,nr;
+熠:E,z;B,z;B,i;M,i;M,nr;E,nr;
+锣:S,n;B,n;M,i;E,n;M,l;B,i;E,v;E,nr;M,ns;E,i;E,nz;M,nr;
+稽:S,nr;B,v;E,a;B,n;M,i;M,ns;E,nr;E,v;M,n;E,l;M,nr;B,vn;M,nz;E,i;E,vn;E,j;
+拂:S,v;E,v;B,t;B,v;B,i;M,nr;B,n;E,vn;E,nr;M,i;
+豉:E,n;S,x;B,n;
+克:M,nr;E,nr;E,n;S,q;M,ns;E,ns;M,n;S,m;E,m;E,nrt;B,nr;E,nz;B,v;E,q;B,nrt;B,ns;M,nz;E,v;M,nrt;B,nz;B,q;B,n;M,nt;E,nt;B,i;B,nt;M,nrfg;M,b;E,i;B,m;E,a;E,nrfg;M,i;M,v;M,m;B,vn;E,vn;M,l;E,b;
+坏:E,v;S,a;B,n;B,v;E,n;M,n;E,i;M,l;E,l;M,j;B,l;E,z;M,nz;M,z;E,nr;M,i;
+鹕:S,x;E,n;
+胖:B,n;S,a;E,a;B,z;M,n;M,z;E,z;M,nr;E,v;E,nr;M,i;B,a;E,n;E,i;M,b;
+几:B,m;B,d;M,m;S,m;B,n;B,ns;B,r;E,m;E,n;M,nr;E,i;M,ns;B,l;E,l;M,l;E,c;M,i;E,r;E,d;B,mq;B,i;E,nr;M,n;E,nrt;B,j;B,v;M,mq;
+埤:S,x;
+巨:B,a;B,n;B,b;B,nr;S,ag;S,ng;E,a;M,nr;B,nz;M,i;E,nr;M,n;B,vn;B,ns;B,v;B,i;B,nrt;M,nz;B,nt;M,b;B,l;
+赳:S,x;E,z;M,z;
+篼:S,g;
+齿:E,n;S,n;B,n;E,i;M,n;E,v;E,nr;M,i;E,l;E,b;B,nz;M,l;E,nz;B,l;E,d;M,nz;
+舀:S,v;E,nr;B,n;
+萄:M,n;E,n;M,ns;M,nz;S,x;M,nt;E,nr;E,v;B,n;
+澉:B,ns;S,g;
+挖:S,v;B,v;B,n;E,v;B,i;E,nr;B,nz;B,l;M,n;
+嚣:E,v;B,a;E,vn;S,vg;M,i;B,l;E,nr;E,n;M,n;E,a;
+符:B,v;B,n;E,n;S,v;E,v;M,n;B,nr;E,nr;E,nz;M,nr;M,i;B,ns;B,vn;S,vg;E,l;M,l;S,nr;
+披:B,v;S,v;B,n;E,v;B,i;M,i;E,n;B,l;M,nr;B,nz;E,nr;M,ns;B,nt;
+蜮:S,g;E,n;M,i;
+炷:S,q;E,nr;
+锺:S,nr;E,nr;M,nr;
+鼾:B,n;E,v;B,v;
+所:S,u;B,c;E,n;B,n;B,b;E,v;B,v;M,i;E,j;M,c;E,nt;E,m;M,l;S,m;M,n;B,i;E,ns;B,l;E,r;E,i;B,d;M,nr;E,nz;B,ns;E,nr;B,nrt;M,s;M,ns;E,nrt;E,l;
+摄:B,v;B,n;S,vg;E,v;B,m;M,m;B,b;B,q;M,n;M,i;M,nt;E,nrfg;B,i;B,nz;B,vn;
+灌:B,n;B,vn;S,v;B,v;E,v;E,n;M,nr;E,nr;M,l;B,ns;M,n;B,j;B,nrt;M,i;M,j;B,l;E,vn;B,b;B,nz;M,nz;
+柙:S,g;E,nr;
+佞:E,n;B,n;E,a;
+兢:M,i;E,i;M,z;E,z;B,i;E,nrfg;
+学:E,n;B,n;M,n;S,v;E,nt;B,v;M,nt;E,v;M,nr;E,l;M,l;M,nz;E,nr;E,vn;E,j;E,a;M,i;E,nrt;E,nz;B,l;M,j;M,v;B,i;E,i;M,b;B,b;B,j;M,ns;B,nz;B,ns;B,nrfg;B,nrt;B,vn;E,nrfg;E,ns;M,nrfg;B,t;
+翩:E,nr;B,nr;M,l;B,i;M,i;E,l;E,i;B,z;S,ag;B,l;E,v;B,v;M,n;B,n;M,nr;
+鹨:S,g;E,n;
+臭:S,a;B,n;E,n;B,v;E,a;E,v;B,i;M,i;B,z;E,nr;M,n;B,a;E,i;E,z;E,nz;M,nr;M,l;B,l;
+诱:B,v;B,vn;S,vg;B,n;E,v;B,a;E,i;B,l;B,nz;E,vn;M,nz;M,nr;
+仳:S,x;
+践:E,v;B,v;S,vg;E,nrt;M,n;M,nr;E,nr;E,l;B,vn;
+罾:S,g;
+昃:S,g;E,i;
+膂:B,n;
+标:B,n;E,n;E,v;S,v;M,n;B,v;E,j;E,nr;B,vn;B,a;E,l;M,nr;M,nt;B,i;B,l;M,l;B,nz;M,b;M,i;B,nt;M,d;E,vn;M,v;S,n;M,j;B,b;E,nz;
+予:E,v;B,v;S,vg;S,v;E,nr;M,nr;E,vn;M,i;M,l;B,i;M,n;E,nrfg;
+越:S,d;B,d;E,d;E,v;B,ns;E,a;E,nr;B,v;B,nr;B,n;M,n;M,nr;B,vn;E,ns;E,n;B,nz;E,nz;M,b;M,i;B,j;E,i;B,nt;B,l;B,i;M,l;E,z;E,j;E,nrfg;B,nrt;M,ns;M,t;
+琏:E,nr;S,g;M,nr;E,n;
+馒:B,n;B,ns;M,nr;
+岔:S,v;B,n;B,v;M,ns;E,n;E,v;E,b;B,ns;M,l;M,s;M,v;E,ns;E,nr;
+耗:E,v;B,v;E,n;S,v;B,n;M,n;E,vn;E,b;E,l;E,nr;M,nr;M,l;M,i;
+谟:S,g;E,nr;M,nr;E,ns;M,ns;
+匡:M,nr;B,nr;S,nr;B,v;E,nr;M,i;S,vg;B,i;
+弩:S,ng;M,i;B,n;E,nr;M,n;E,n;
+纨:B,n;B,i;B,l;
+洵:E,nr;S,g;M,nr;
+厶:S,g;
+懂:S,v;B,v;B,a;E,v;E,a;E,l;M,l;E,i;M,i;E,z;E,nr;M,n;
+配:B,v;E,vn;E,v;S,v;B,vn;B,n;B,a;M,n;E,a;B,nz;E,l;E,j;E,nr;E,n;E,nz;M,nr;E,ad;M,i;M,j;B,i;M,l;M,ns;
+魑:S,g;B,i;B,n;E,nr;
+秒:S,n;S,q;S,m;E,m;B,n;E,r;E,q;E,i;E,n;E,nr;M,i;M,n;E,v;E,b;M,nr;
+菖:B,n;M,n;
+橛:B,n;
+江:E,ns;B,ns;E,nr;S,nr;M,ns;B,n;B,nr;M,nr;B,j;E,n;B,s;E,nz;M,nz;E,f;M,nt;B,nz;M,i;M,n;E,nrfg;B,nrfg;E,j;E,nrt;M,l;B,nrt;B,nt;B,i;M,v;E,i;M,s;M,j;M,nrt;E,l;B,l;
+连:S,u;B,a;B,d;B,v;B,n;E,v;E,d;B,nr;E,ns;M,ns;B,vn;B,p;B,l;M,nr;M,n;E,n;E,nr;B,ns;M,i;B,b;B,z;B,nrfg;M,l;E,vn;M,nt;B,i;E,i;B,nrt;M,nz;B,nz;E,j;M,nrt;M,j;E,l;M,z;E,nt;E,nz;E,nrt;
+癣:E,n;S,n;B,i;
+廨:S,g;
+惬:B,a;
+相:B,v;B,d;S,d;B,a;E,n;E,d;B,n;M,i;B,l;E,v;M,nr;E,nr;B,nr;B,i;M,l;M,n;E,b;M,c;B,c;E,a;B,ns;E,nz;E,i;M,ns;B,vn;E,vn;E,l;B,nz;M,nrfg;M,nz;E,nrt;
+驻:S,v;B,n;B,v;E,v;B,vn;B,ns;M,nt;E,nr;B,i;B,nt;
+好:S,a;E,a;E,d;E,v;B,v;B,n;B,d;B,a;B,m;E,z;E,n;E,y;E,l;B,l;M,a;M,i;B,z;M,n;M,l;B,i;B,ns;E,nr;M,z;B,nz;M,m;E,i;M,nr;B,e;E,j;M,nt;M,nz;E,vn;E,nrfg;B,mq;M,v;
+鱿:B,n;M,v;B,nz;
+撅:S,v;S,n;E,z;M,z;
+溉:E,vn;S,vg;E,v;M,n;E,l;
+嘎:S,o;B,o;M,nr;E,o;M,ns;E,nr;M,o;E,ns;B,nz;E,nrfg;B,nrt;E,nz;B,ns;B,nr;B,z;
+窑:S,n;B,n;E,n;E,nr;E,nz;E,ns;E,v;M,ns;M,nz;M,n;B,ns;E,vn;S,ng;
+粕:E,n;S,g;E,nz;
+或:S,c;B,c;B,d;E,c;M,d;E,d;M,l;E,nr;B,v;B,n;
+垣:E,n;S,ng;E,nr;E,ns;M,ns;E,nrt;B,ns;E,i;M,nr;M,l;E,l;M,i;E,nz;
+钥:B,n;S,ng;E,n;E,nr;M,n;E,i;M,nr;
+簪:B,n;E,n;B,v;M,nz;
+斯:E,nr;M,ns;E,ns;M,nr;B,nr;M,nz;E,nrt;M,nrt;E,n;E,nz;B,ns;S,nr;S,r;M,n;M,nt;B,nrt;S,rg;B,n;S,j;M,nrfg;B,nz;B,a;B,nt;M,i;S,ng;B,i;M,v;E,l;E,nt;M,l;
+澳:B,ns;S,j;B,n;E,j;B,nt;E,ns;M,ns;M,m;B,nz;B,q;E,nr;M,j;B,m;M,nr;M,nrt;B,j;B,nrt;E,nz;E,nrt;M,nt;
+蠲:S,g;B,v;
+夼:S,g;
+鸾:S,nr;E,nr;B,n;M,nr;M,i;E,v;B,i;
+觇:S,g;
+仉:S,nr;M,nr;
+煌:E,ns;E,a;S,ag;S,g;E,i;E,nr;M,n;M,ns;M,nr;M,nt;
+筐:S,n;E,n;E,m;B,n;M,nr;S,q;E,nr;
+曙:M,nr;B,n;B,nz;M,ns;M,nrfg;
+乞:B,v;B,n;E,v;B,ns;M,i;E,n;B,vn;
+狡:B,a;B,vd;B,i;B,n;B,v;
+镤:S,g;
+绩:E,n;B,n;E,nr;B,b;S,ng;M,n;E,l;M,nr;B,ns;E,v;
+胭:B,n;
+普:B,ad;B,a;S,nr;B,n;E,nr;B,nr;M,nr;B,v;B,nz;M,n;B,ns;M,ns;B,vn;E,nrt;M,nz;B,nrt;E,ns;E,n;E,b;M,nrt;E,nz;M,nt;B,nt;B,z;M,z;B,q;B,i;B,b;S,ag;B,l;B,j;E,j;E,nrfg;
+俳:S,ng;B,n;E,nr;
+雹:E,n;S,ng;B,n;
+寻:B,v;S,v;E,v;B,nr;B,a;M,i;M,l;E,nr;B,i;B,l;M,nr;B,vn;B,n;B,ns;E,i;
+侈:M,n;E,a;S,vg;E,i;B,v;M,l;B,a;E,nr;
+貊:S,g;
+册:E,v;E,n;S,q;E,m;B,v;M,n;S,m;B,n;E,l;E,nr;M,nt;M,nr;E,i;E,j;E,nz;B,ns;
+甏:S,ng;
+缓:B,v;B,a;E,v;S,v;B,d;E,d;E,a;B,n;E,i;B,i;M,nr;B,vn;M,i;E,ad;E,nr;B,z;M,z;E,j;E,z;B,l;B,nz;M,n;
+枘:S,g;
+榜:S,n;B,n;E,v;E,n;E,nr;B,l;M,i;M,l;E,i;M,nr;B,i;M,n;E,nrfg;E,nz;E,nrt;
+负:B,n;B,v;S,v;E,v;B,b;B,vn;E,n;M,n;M,l;M,i;E,i;M,d;B,i;E,j;E,l;B,an;B,l;M,b;E,vn;M,nr;M,nz;E,nr;
+疤:S,n;E,n;B,n;E,v;
+樱:B,n;S,nr;S,ng;B,ns;E,nr;B,nr;M,nr;M,n;B,nz;
+记:B,n;E,n;B,v;S,v;E,v;M,n;M,nz;E,m;E,nz;M,nt;E,nr;B,l;M,l;B,b;B,i;B,vn;M,nr;M,d;B,nz;E,i;E,a;M,v;E,j;B,j;M,j;S,m;M,b;
+趴:B,v;S,v;
+庾:B,nr;S,nr;M,ns;M,nr;E,nr;
+蹉:B,v;B,i;
+泊:E,n;S,ng;E,v;M,ns;B,n;S,vg;E,ns;E,nr;M,nr;M,nz;B,v;M,n;E,a;M,l;B,ns;M,nt;E,vn;M,i;
+遍:E,ad;E,m;B,v;S,q;E,v;E,a;M,n;M,i;B,n;B,i;M,vn;M,l;S,m;E,f;E,l;M,v;
+盎:B,q;B,z;B,nz;M,m;M,l;B,m;M,i;
+当:B,t;S,p;B,d;B,v;E,v;E,a;E,d;B,s;B,n;M,v;B,f;E,n;M,i;E,p;B,p;B,i;M,l;E,c;E,i;B,ns;E,l;E,o;B,vn;M,z;E,z;M,ns;M,nz;M,n;M,nrt;E,nrt;M,nr;E,nr;B,l;B,o;E,ns;M,o;M,a;M,f;M,t;
+叠:E,v;S,v;E,m;B,v;M,t;B,n;E,z;M,n;M,nz;M,b;M,m;M,z;B,vn;B,z;E,nr;M,i;M,nr;E,n;E,nz;E,vn;M,l;E,l;B,i;B,ns;
+督:E,n;E,vn;M,nz;S,vg;B,v;M,n;B,n;M,nt;E,nr;B,vn;M,nr;E,j;E,nz;
+郢:S,g;E,nr;B,ns;M,nr;
+嗤:S,vg;B,i;E,o;B,v;
+祧:E,n;S,g;
+髦:S,g;E,a;E,nr;E,v;M,nr;
+荫:S,a;E,n;M,nr;E,nr;E,v;S,ng;B,v;B,a;B,n;S,vg;M,i;M,n;E,i;E,l;E,nrt;M,ns;M,l;M,nrfg;
+轳:E,n;S,x;
+酷:E,a;B,v;S,d;B,n;B,a;M,n;M,l;E,nr;B,l;B,t;
+矸:B,n;M,n;
+舄:S,g;
+榉:E,n;S,x;B,n;E,nr;
+瞍:S,g;
+阌:S,g;
+箕:S,g;E,n;B,n;M,i;
+挚:E,a;S,ag;B,n;E,nr;M,nr;B,a;
+傣:B,nz;S,j;M,ns;B,n;
+眢:S,g;
+座:E,m;S,q;E,n;B,n;S,m;E,v;E,nz;E,nr;B,v;M,n;E,a;M,b;B,i;E,l;M,ns;M,nz;E,i;B,nz;M,nr;M,l;B,nr;
+笪:S,nr;E,nr;
+梳:B,v;S,v;B,n;E,b;E,n;B,i;B,nz;E,nz;E,nr;E,vn;M,nr;M,n;B,vn;
+锶:S,ng;E,n;E,nz;B,nz;E,nr;
+帼:M,i;E,b;M,l;
+窿:E,n;M,n;
+胃:S,n;B,n;E,n;E,v;E,a;B,l;E,nr;B,nz;M,n;M,l;M,v;
+案:E,n;B,n;S,ng;E,v;E,r;M,n;E,m;B,v;M,i;M,nt;E,vn;E,j;E,i;M,l;E,l;M,vn;E,nr;S,m;M,j;B,j;B,i;
+铋:S,g;E,nr;E,n;
+癌:E,n;B,n;S,n;E,vn;E,v;M,n;M,nt;
+飓:B,n;
+聘:E,v;B,v;S,v;M,n;B,n;E,nr;E,vn;M,nr;
+珥:E,n;S,g;
+秩:B,n;S,ng;E,nr;B,i;M,nr;S,qg;M,nz;B,v;
+孪:B,b;B,n;
+潲:S,v;B,n;
+诵:E,v;S,vg;B,v;E,nr;M,n;E,vn;E,i;M,nr;B,n;E,n;
+峻:E,a;S,ag;M,i;E,nr;E,z;E,an;M,nr;B,a;B,n;M,l;B,v;M,n;M,ns;E,nz;
+螂:E,n;S,x;M,nz;M,l;
+岐:B,ns;S,ng;E,nr;M,nr;E,nrt;B,nrt;M,nrfg;
+谛:E,n;B,v;
+溜:S,v;M,z;E,z;E,m;B,v;M,d;E,n;E,a;B,z;S,q;E,v;M,l;B,i;M,nr;E,nr;E,o;B,n;M,n;E,l;M,i;
+天:B,n;E,t;E,m;S,q;E,r;B,ns;E,n;M,nr;S,m;B,nz;B,b;M,i;M,n;B,nr;B,q;E,q;B,i;E,v;B,s;B,v;E,nr;E,d;M,l;B,l;E,i;E,nz;B,nrt;E,z;M,nz;B,t;E,ns;B,a;M,b;B,nt;M,ns;M,nt;B,j;E,l;M,v;M,m;M,d;M,nrfg;B,d;B,e;B,f;E,nrfg;B,nrfg;E,nt;E,vn;B,m;
+札:S,q;S,ng;E,n;B,n;M,nr;B,ns;E,nr;B,nrt;
+蚬:S,g;B,nz;
+洱:B,ns;M,n;E,ns;M,ns;B,nrt;
+邸:S,nr;E,n;E,nr;B,nr;B,n;E,ns;
+妾:S,n;E,n;E,v;E,i;
+乇:S,q;E,nr;
+淆:E,v;M,i;B,v;M,l;
+呋:B,n;M,n;B,nz;M,nz;
+燎:S,v;E,i;B,v;E,l;B,l;B,n;E,z;M,l;E,nr;M,nr;
+晗:E,nr;S,g;M,nr;
+汛:B,t;E,n;S,ng;E,vn;E,nr;M,nr;E,v;M,n;B,n;
+觞:S,v;E,n;E,v;
+勤:E,n;B,a;S,a;E,a;B,n;E,nr;B,v;B,ad;M,nr;E,v;E,vn;M,n;B,l;E,j;M,j;B,i;B,ns;M,nt;B,z;M,z;E,ns;E,ad;E,nrt;E,nz;B,j;M,ns;M,i;E,l;M,nz;E,i;M,l;
+葫:B,n;M,n;B,ns;M,l;M,i;B,nz;S,nr;M,nz;
+良:B,a;E,a;B,n;E,nr;M,nr;E,z;E,v;S,a;B,b;S,d;B,m;E,n;M,n;S,nr;M,l;B,ns;B,i;M,i;E,ns;B,l;E,nz;B,z;E,i;E,vn;M,ns;B,nrt;E,nrt;M,nz;E,l;M,nrfg;M,nrt;M,nt;S,ng;M,m;E,nrfg;B,nz;B,t;B,v;B,nr;
+泰:E,nz;B,ns;S,j;B,nr;E,nr;B,n;M,nr;B,nz;M,ns;E,ns;B,nrt;B,z;M,i;M,nz;E,nrt;E,n;M,nt;M,nrt;B,i;M,n;B,nt;E,i;E,nt;B,b;M,l;E,nrfg;B,l;E,a;
+陷:B,v;E,v;S,v;E,n;B,n;M,i;M,n;E,i;B,l;E,vn;
+兹:E,nr;M,nr;M,ns;S,rg;E,ns;E,q;B,nrt;E,nrt;E,nz;M,nrt;M,nt;B,i;E,i;M,i;B,n;E,n;
+综:B,vn;B,n;B,j;S,ng;M,n;B,l;M,i;B,v;B,c;E,nr;E,z;B,nt;S,vg;M,nr;B,nz;M,nt;E,j;M,nz;
+驿:B,n;E,ns;B,v;E,nrfg;B,ns;M,ns;
+茄:E,n;B,n;M,n;M,nz;B,nz;
+粑:S,g;E,n;E,nr;
+窕:S,x;E,a;M,i;E,nr;
+戚:E,n;B,nr;S,nr;M,n;E,nr;E,a;M,i;M,nr;B,ns;E,v;E,l;B,nrfg;B,n;
+钡:S,n;B,n;E,n;E,nr;E,nz;M,nr;M,n;
+瘢:B,n;
+簦:S,g;
+斫:S,vg;M,nr;E,nr;
+弼:E,nr;S,g;M,nr;M,nrfg;E,v;E,i;E,nrfg;B,nrfg;
+臃:B,a;S,ag;
+过:S,ug;E,p;E,v;B,n;B,v;E,c;B,t;B,d;E,d;B,ad;M,l;B,a;E,vq;B,vn;E,a;B,l;E,l;M,n;M,i;E,n;B,nr;M,d;B,nz;B,i;E,ns;M,v;M,nr;B,ns;M,c;E,i;E,f;B,q;M,a;E,nr;B,b;M,nz;E,nrt;M,s;
+答:E,v;B,v;S,v;B,n;B,vn;M,ns;E,ns;E,nr;E,vn;B,l;E,l;M,z;E,z;M,o;E,o;M,i;M,n;M,nr;M,v;M,nrt;E,nz;
+噢:S,y;S,e;
+屦:S,g;
+饨:S,x;E,n;
+婪:E,a;S,x;E,nr;M,i;
+蛭:S,g;B,n;E,n;E,nr;
+瑶:E,nr;S,j;M,nr;B,n;B,nz;M,ns;B,ns;M,i;B,i;
+牺:B,v;B,n;M,i;M,l;B,j;
+寿:B,n;E,n;E,nr;B,nr;M,nr;S,nr;B,ns;E,ns;S,ng;E,a;M,n;E,v;M,i;E,i;B,i;M,ns;S,vg;E,nz;E,b;M,nt;M,l;B,vn;
+蚂:B,n;M,l;B,ns;B,i;
+誊:S,v;B,v;E,nr;B,n;
+垌:S,g;E,nr;
+礓:E,n;S,x;
+麒:B,n;M,nr;B,ns;
+蜗:B,n;E,n;B,v;
+丝:E,n;B,n;S,n;E,m;B,m;S,q;M,n;M,i;E,v;E,nr;B,l;B,b;M,nr;B,nz;M,z;E,nz;E,mq;M,mq;E,nrt;B,nrt;M,l;B,z;E,z;E,ns;E,l;B,i;M,nz;E,vn;S,m;M,m;M,ns;E,i;B,q;E,b;M,nrt;
+澜:B,ns;E,n;E,i;E,nrfg;M,l;M,i;E,nz;E,nr;E,a;M,n;
+吡:B,n;M,nz;B,nz;M,n;
+疠:E,n;S,g;
+鄣:S,g;B,ns;
+昭:S,vg;E,nr;M,nr;B,nrt;B,v;M,ns;B,ns;B,nz;M,i;B,n;E,z;B,z;B,i;B,a;S,ag;M,nrt;M,l;
+螬:E,n;
+亲:E,n;B,n;B,d;S,v;B,a;B,v;E,v;M,nr;B,b;E,nr;M,n;B,l;E,i;M,i;E,vn;M,l;E,b;B,i;B,z;M,z;E,l;E,a;M,t;E,nz;B,vn;
+樵:B,n;E,n;M,ns;B,v;E,nrt;
+讴:B,v;
+瀹:S,g;
+降:E,v;B,v;S,v;B,n;E,vn;M,n;E,n;B,vn;E,i;E,nr;M,nr;E,t;M,l;B,i;E,l;M,j;B,nz;M,nz;M,i;M,v;
+协:B,n;B,v;M,nt;E,j;S,vg;E,nt;E,v;B,vn;M,nz;M,n;B,nz;M,i;E,nr;E,n;B,nt;B,j;M,l;M,nr;B,d;S,dg;M,j;B,i;B,b;
+绒:B,n;E,n;S,n;M,n;E,nr;E,nz;M,nr;E,v;M,z;B,z;
+蓖:B,n;
+俜:S,x;
+古:B,n;B,t;S,a;E,ns;M,n;B,a;B,nr;B,ns;M,ns;B,b;E,vn;E,d;E,nr;E,n;M,l;M,nz;E,t;M,nr;B,v;E,v;M,i;M,nrt;B,nz;B,nrt;B,i;M,nt;M,t;B,d;E,nrt;B,l;B,nt;E,i;E,z;M,z;B,z;B,nrfg;E,l;M,d;M,j;E,nz;E,a;E,b;
+姨:B,n;M,nr;S,n;E,n;E,nr;M,n;E,l;
+柬:B,ns;S,j;E,n;B,nt;M,nr;B,n;E,nr;B,nz;
+药:E,n;B,n;S,n;E,v;M,n;B,b;M,nr;E,nz;E,j;M,nz;E,nt;M,nt;E,i;B,nt;E,nr;E,l;B,j;E,r;E,vn;M,l;B,nz;B,i;B,ns;M,i;B,l;M,ns;B,v;
+幽:B,n;B,a;S,ng;S,ag;E,z;B,v;B,z;M,nr;E,a;M,z;E,nr;S,vg;M,n;E,i;B,vn;B,an;M,nrt;E,v;
+翼:E,n;S,ng;E,i;M,i;E,nr;B,n;M,nr;B,ns;M,n;E,s;M,ns;E,j;E,nz;B,b;E,b;M,nz;E,v;E,d;E,ns;E,f;M,l;E,nrfg;
+极:E,ad;S,d;B,d;E,n;B,n;B,a;M,n;E,ns;E,a;E,v;B,u;M,i;B,m;B,vn;B,v;M,ns;M,l;E,nr;E,i;B,b;E,b;B,i;M,nt;M,nr;M,vn;E,j;M,v;M,nz;B,nrt;B,ns;B,j;B,nz;E,nrfg;
+耄:B,i;B,n;
+殉:B,v;S,vg;B,n;M,i;M,l;
+些:E,r;E,m;S,q;E,d;M,m;M,t;B,m;B,a;B,d;E,nr;S,m;B,b;
+愚:E,nr;B,a;S,v;B,n;B,v;B,i;E,n;B,nr;E,i;M,nr;B,l;B,t;E,a;M,i;E,l;
+劣:E,a;B,n;E,n;S,a;B,b;M,l;E,j;E,b;S,ag;B,v;S,ng;E,v;M,i;M,nr;B,i;E,l;
+悯:E,v;S,g;E,vn;E,z;M,i;E,nr;M,nr;
+丰:B,a;E,ns;S,ag;E,nz;B,nr;B,nz;E,nr;B,v;B,n;B,i;B,ns;M,nt;S,nr;M,nr;M,ns;E,v;E,nrt;M,i;B,l;B,nt;B,vn;M,l;E,l;M,nz;B,nrt;M,n;E,nrfg;M,v;E,i;E,a;M,nrt;
+贲:S,nr;E,nr;E,n;B,n;M,nr;B,nr;
+券:E,n;B,n;M,n;M,nt;S,ng;E,nt;M,v;E,nz;E,l;M,nz;M,ns;M,l;E,i;M,j;
+尼:E,nr;M,ns;M,nr;S,j;B,ns;B,nr;E,nrt;M,n;E,ns;B,n;E,n;M,nz;B,nrt;E,nz;M,nt;M,nrt;B,nz;B,nt;M,l;B,j;E,l;
+嗍:S,v;
+郏:S,nr;B,ns;B,nr;
+忑:M,i;E,a;S,x;
+髓:E,n;S,g;M,n;B,n;E,i;E,v;
+艘:S,m;E,m;S,q;B,q;
+淝:S,g;B,ns;
+燥:E,a;S,ag;B,a;E,n;B,n;E,nr;E,l;M,nz;M,n;M,i;E,i;
+彦:S,g;M,nr;E,nr;M,ns;B,nrfg;E,n;M,nz;E,nrt;
+据:E,n;E,p;S,p;B,v;E,v;M,n;B,d;B,n;M,ns;E,l;B,i;E,a;E,vn;M,l;E,i;M,i;M,v;M,nr;
+煺:S,v;
+签:B,v;S,v;M,n;E,v;B,n;E,n;B,vn;E,l;E,nr;E,vn;M,nr;M,nz;
+氇:E,n;S,x;
+辆:E,m;E,n;S,m;S,q;E,mq;M,n;M,nt;B,m;E,nz;M,m;
+和:S,c;B,n;B,nz;M,ns;B,nr;E,v;E,a;M,n;E,n;B,a;E,nz;M,nr;B,v;B,ns;E,ns;E,nr;B,vn;M,nz;E,nrfg;M,nt;B,i;E,vn;E,nrt;B,l;E,j;E,i;B,nrt;M,i;B,t;M,z;M,l;B,z;E,l;E,z;B,b;M,nrfg;M,b;B,nt;B,ad;E,b;
+庐:B,ns;S,ng;E,n;E,nr;B,n;E,i;E,ns;M,ns;B,nz;M,nr;E,v;B,i;M,l;B,nt;
+折:B,v;S,v;B,n;E,n;E,a;E,v;S,m;E,m;E,vn;M,n;B,vn;M,i;B,nr;E,i;M,v;E,nr;B,b;E,l;M,nr;M,z;E,z;M,l;B,ns;B,nz;B,i;
+窨:S,v;M,n;B,n;
+漱:S,v;E,v;B,v;M,nr;M,n;E,nr;B,n;M,nz;
+袴:M,l;
+鲼:S,g;
+宾:E,ns;B,n;E,n;S,n;E,nr;M,nr;M,n;B,nr;B,ns;M,ns;E,nrt;E,v;E,i;M,nt;M,nrt;B,nt;M,i;E,vn;M,nz;B,nrt;M,l;B,i;S,nr;E,l;B,nz;B,l;
+槊:S,g;E,nr;M,nr;M,i;
+镍:S,n;B,n;E,n;E,nr;
+偏:S,d;S,a;B,n;B,v;B,d;E,d;B,a;B,f;M,i;B,an;M,n;M,l;B,nz;B,vn;B,z;B,ns;B,i;E,v;E,n;B,b;B,l;M,nz;
+齑:S,g;B,n;
+饕:B,n;B,i;
+湛:B,ns;E,a;B,nr;B,z;E,nr;S,nr;M,nr;S,j;M,nt;E,nrt;M,z;M,ns;
+诞:B,v;E,t;M,t;E,a;M,n;B,n;E,n;M,i;M,l;B,t;
+因:B,c;S,p;E,n;B,n;M,c;B,i;M,nr;E,nr;E,nrt;B,v;M,v;B,d;M,i;M,n;E,i;M,nrt;M,l;M,ns;E,nz;E,v;B,l;E,ns;B,nrt;B,ns;B,p;B,vn;B,nz;M,nz;E,nrfg;
+虫:E,n;S,n;B,n;M,n;E,v;E,nr;E,nz;M,nr;M,i;E,i;M,nz;M,nt;E,vn;E,l;M,l;M,j;
+狸:E,n;B,n;M,n;M,i;E,nr;M,nr;
+顿:B,d;E,m;E,v;S,q;E,ns;E,nr;E,nrt;B,v;E,q;M,nt;M,i;B,ns;E,a;M,ns;E,l;M,n;M,nr;M,nz;B,n;E,nz;S,v;E,i;B,i;M,l;S,m;E,vn;B,nrt;B,vn;M,t;
+蜀:S,j;B,ns;E,n;B,n;M,nr;B,nz;E,nr;S,t;M,n;M,l;E,i;B,l;B,i;
+锌:S,n;E,n;E,nr;M,n;B,n;E,nz;B,nz;M,nr;
+刎:E,v;S,g;
+鼐:E,nr;S,g;M,nr;E,i;
+芙:B,n;B,nrt;B,ns;M,nr;M,n;E,nrt;M,i;E,nz;M,nz;M,nrt;B,i;
+供:E,v;B,vn;S,v;B,n;B,v;B,l;B,i;M,l;M,n;E,n;E,i;B,j;B,nt;M,j;E,nr;E,b;M,nt;
+厣:S,g;
+琢:B,v;S,v;E,v;M,nr;E,nr;E,i;B,l;M,v;M,i;
+枫:S,nr;E,nr;B,n;B,ns;M,nr;S,ng;E,n;B,nz;
+估:B,n;B,v;E,vn;E,v;S,v;M,n;M,l;M,nr;E,n;E,nrt;B,vn;E,nr;
+殳:S,nr;B,nr;E,nr;
+谲:E,a;S,g;
+阶:B,n;M,n;S,ng;E,n;M,l;M,t;B,l;E,nr;B,nz;B,b;M,nr;M,b;E,i;M,v;M,nrfg;
+杀:S,v;B,v;E,v;B,n;E,vn;B,i;B,vn;M,i;E,n;M,n;B,l;B,nz;M,l;E,i;E,a;M,nz;M,nr;E,nz;M,v;B,ns;M,ns;E,l;
+响:E,vn;S,v;B,v;E,n;M,n;E,v;B,n;E,m;B,a;E,l;E,i;E,nr;B,z;B,ns;B,i;S,m;M,nr;S,a;E,a;
+界:E,n;S,n;M,nz;M,n;B,n;M,l;E,r;B,nrt;M,nt;E,v;B,nz;S,k;B,v;E,b;E,nr;E,nz;E,ns;M,b;E,i;M,nr;E,j;B,s;E,l;B,ns;M,ns;B,b;E,vn;
+量:E,n;S,n;E,m;E,v;E,vn;E,d;B,n;M,n;B,v;E,l;E,a;E,b;E,nr;B,l;M,m;M,b;E,ad;M,l;M,v;E,j;B,i;E,i;E,nz;M,i;M,nz;M,nt;M,nr;M,ns;B,vn;E,jn;E,vd;
+廑:E,nr;S,g;
+罐:B,n;E,n;S,q;M,n;E,m;B,s;B,b;M,l;E,l;E,nz;E,b;E,v;M,nr;S,m;
+壕:E,n;B,n;E,ns;M,nz;
+拙:E,a;S,ag;B,a;E,i;B,ns;E,nr;B,n;E,v;M,i;
+赜:S,g;E,nr;M,nr;
+靠:S,v;E,v;E,a;B,v;M,n;B,p;B,n;B,a;E,i;B,i;B,l;E,nr;M,i;M,v;E,nz;
+呢:S,y;B,n;E,n;E,y;B,v;B,nz;E,nr;B,vn;
+酤:S,g;
+扮:E,v;B,v;S,v;E,i;B,n;M,l;
+汲:B,v;B,nr;S,v;E,nr;M,nr;B,i;M,nrfg;
+嗷:E,o;B,o;B,v;B,i;M,v;M,i;
+忻:B,ns;S,nr;B,nr;E,nr;M,nr;M,ns;
+姿:B,n;E,n;S,ng;M,i;E,a;E,i;M,l;E,nr;E,l;M,nr;M,n;E,nz;
+蒂:M,nr;E,nr;S,g;M,ns;E,nrt;M,i;B,nrt;E,n;M,nrt;B,ns;M,a;M,nz;E,v;E,i;E,ns;M,n;E,l;B,n;M,nt;
+洇:S,v;M,nr;
+看:S,v;B,v;E,v;E,u;B,n;E,a;E,l;E,i;M,l;B,l;B,vn;E,c;M,i;M,c;M,v;B,i;E,nr;M,nr;E,n;
+銎:S,g;E,nr;M,nr;
+徐:B,nr;S,nr;B,ns;E,nr;E,d;M,nr;B,d;B,nrfg;E,nrfg;B,n;B,z;B,nrt;B,l;M,l;E,ns;B,nt;B,v;M,i;M,ns;E,z;B,nz;
+鲒:S,g;
+蔗:E,n;B,n;S,ng;M,n;B,ns;M,nz;M,ns;E,nr;
+掘:E,v;S,v;B,v;M,n;B,n;M,nr;M,i;E,vn;M,nz;
+瞠:B,l;B,v;B,i;
+倥:B,a;M,i;S,x;
+娩:E,v;S,vg;M,n;
+箨:S,g;
+搭:S,v;B,v;E,v;B,n;B,vn;M,n;M,l;M,z;E,z;B,l;E,nr;M,i;
+辰:E,n;S,ng;E,nr;M,nr;E,nz;B,n;E,m;M,i;B,nz;B,nrt;E,i;S,mg;E,ns;B,ns;M,m;B,t;M,t;M,l;M,nt;
+爹:S,n;E,n;B,n;E,nr;M,nr;
+傺:S,x;
+媾:B,v;E,v;
+擂:B,v;S,v;E,i;B,n;M,v;E,v;B,i;B,ns;
+狎:B,v;B,a;
+鹑:E,n;S,x;B,i;E,nr;
+孓:E,n;
+胚:B,n;M,n;E,n;M,l;
+埠:S,ng;E,n;E,ns;M,nr;M,ns;B,n;E,r;
+铢:M,n;E,m;E,n;M,i;S,q;S,m;E,nr;
+凤:B,nr;M,nr;B,n;E,nr;B,ns;S,ng;S,nr;E,n;B,nz;M,n;B,i;M,i;E,ns;E,i;E,nz;B,nrt;M,nz;M,ns;E,nrt;M,l;
+寨:S,ng;E,n;E,nr;E,ns;B,n;M,ns;M,nr;E,nrt;E,nz;E,i;M,nt;M,n;M,nz;E,l;
+旬:E,t;S,q;E,m;B,n;S,ng;E,j;B,ns;E,nr;M,m;M,nr;
+乱:S,d;E,a;E,v;E,n;B,v;B,n;M,i;E,i;E,d;B,z;B,i;E,vn;M,l;E,l;B,l;M,v;E,nz;M,n;B,ns;E,ad;M,z;E,nr;E,j;E,an;M,nz;B,a;
+饿:S,v;B,v;E,n;B,n;E,v;E,i;B,i;M,n;M,l;B,l;
+箍:S,v;M,n;E,n;B,v;E,nz;B,n;
+崎:B,a;E,ns;M,ns;B,i;E,nrt;M,nr;E,nr;
+逐:B,d;E,v;S,v;M,n;B,v;M,i;S,vg;M,l;B,n;B,i;E,vn;B,l;M,nz;
+阔:E,a;B,n;S,a;E,v;M,i;B,a;E,nr;E,i;B,v;M,n;E,an;M,nr;M,l;B,d;B,ns;
+岣:S,g;B,ns;
+焦:B,n;B,a;S,a;B,nr;B,ns;E,v;E,n;E,vn;M,n;B,i;B,q;E,a;B,z;B,v;B,vn;E,nr;S,nr;S,j;M,nr;E,nz;B,nz;S,ng;B,nt;M,l;E,i;M,i;
+溯:E,v;S,vg;B,v;M,l;E,nr;M,nr;M,i;M,nz;E,vn;
+贮:B,v;S,v;B,n;E,vn;B,vn;M,n;E,v;E,j;B,nz;E,nr;B,b;
+尸:B,n;S,ng;E,n;B,v;E,v;E,nr;M,i;M,n;B,i;E,i;B,l;B,nz;M,nz;
+炻:S,x;B,n;
+皿:E,n;S,x;E,nr;M,nr;
+锾:S,q;E,nr;
+桀:S,nr;E,nr;B,i;B,a;M,nr;B,n;M,i;
+俅:S,x;E,nr;M,nr;
+湄:B,ns;B,n;B,nrt;
+苇:E,n;B,n;S,ng;M,n;E,nr;M,nr;B,ns;B,nrfg;
+摈:B,v;S,vg;
+黏:B,n;S,a;B,a;B,v;
+凑:S,v;B,v;E,a;B,a;E,v;M,b;E,i;E,nr;M,z;B,z;B,ad;E,vn;E,l;
+埕:S,g;E,nr;
+癔:B,n;B,nz;
+淙:E,o;B,o;
+佚:S,vg;E,v;B,n;E,nr;E,n;E,i;M,nr;
+孢:B,n;E,n;E,nz;M,nz;M,n;
+翥:E,nr;S,g;M,nr;
+鹤:S,n;E,nr;E,n;M,nr;B,ns;B,n;B,i;M,i;E,nz;E,i;B,nrt;M,n;B,nz;M,ns;M,l;B,nt;E,nrfg;B,l;M,nt;M,nrfg;
+坪:S,v;E,ns;E,n;E,nr;M,ns;B,ns;M,nr;S,ng;E,nrt;E,nz;B,nrt;B,n;
+语:B,n;E,n;E,nz;S,ng;E,v;E,i;E,nr;S,v;M,n;E,l;B,i;M,nr;M,l;B,nr;M,i;B,v;M,nt;M,v;M,nz;B,nt;B,l;B,ns;B,nz;
+浮:S,v;B,n;B,v;E,v;B,vn;B,a;B,l;M,n;E,a;E,nr;B,nr;M,l;B,ns;E,ns;B,i;M,ns;M,i;M,nz;M,nr;E,n;E,vn;B,nz;E,nz;E,b;E,i;E,nrt;
+僻:E,a;S,ag;B,a;B,n;M,i;M,n;M,nr;
+囿:S,vg;E,n;B,v;
+弥:B,v;B,n;S,d;M,n;S,ag;M,nr;E,n;M,l;E,nr;B,l;S,vg;B,i;B,nz;M,i;B,ns;M,ns;B,nrt;E,nrfg;
+纤:B,n;E,n;M,l;S,ng;M,n;B,a;B,v;B,l;E,v;E,nz;E,nr;B,i;M,nz;E,nt;M,nr;M,nt;B,nz;
+璨:E,z;M,l;S,g;E,l;E,nr;
+朵:E,n;E,m;S,q;E,nr;S,m;E,ns;E,q;B,q;M,m;M,l;M,nr;B,n;M,n;B,nrt;E,l;B,nz;B,v;
+蚴:S,g;E,n;
+鲸:S,ng;E,nr;E,n;B,n;M,nr;B,v;M,n;M,i;
+喾:S,g;E,nrt;E,nr;
+襁:B,n;B,i;
+毂:S,x;E,n;B,n;E,nr;M,i;
+蕉:E,n;S,ng;M,n;M,nr;B,n;E,nr;B,nrt;M,l;
+魍:S,x;B,n;M,i;
+呓:E,n;B,n;
+觖:S,g;
+晟:E,nr;S,g;M,nr;
+牧:B,n;M,n;E,v;S,j;E,n;B,nr;E,j;E,nr;M,j;S,nr;M,nr;B,v;E,vn;M,nz;S,vg;B,vn;E,ns;M,nt;S,ng;M,v;
+哨:S,ng;B,n;E,n;S,q;E,v;E,nr;E,o;E,a;E,z;M,n;M,z;E,nrt;
+衫:E,n;S,ng;M,nr;E,nr;M,l;E,nz;B,nz;M,n;M,i;
+韪:E,i;S,x;M,nr;E,nr;
+蹯:S,g;
+惰:B,n;S,ag;E,a;B,l;B,nz;
+葳:B,a;E,n;M,n;S,x;E,nr;
+更:S,d;B,d;B,v;E,v;E,t;B,l;B,a;M,i;B,i;M,nr;B,n;B,vn;E,i;B,c;M,nz;M,n;B,nr;E,nr;M,l;B,b;B,nz;E,nrt;B,t;
+驷:B,i;B,n;M,i;
+狼:S,n;E,n;B,n;B,i;B,ad;E,nr;M,i;M,n;B,an;B,ns;B,a;E,ns;M,l;M,nr;E,nz;M,ns;
+梁:B,nr;E,n;S,n;B,ns;E,nr;M,nr;E,ns;M,i;M,n;M,ns;B,nrfg;E,v;B,nrt;B,n;E,i;E,l;E,nz;M,nz;E,nrt;M,l;E,nrfg;B,i;
+溅:S,v;E,v;B,v;M,nr;
+窍:S,ng;B,n;E,n;E,v;M,i;E,i;E,l;
+划:E,n;B,v;E,v;S,v;M,n;M,l;B,a;B,b;B,n;E,nz;M,nt;M,i;E,vn;E,l;E,d;E,j;E,nr;M,b;M,v;E,b;B,l;B,vn;E,nrfg;B,i;M,nr;M,nz;
+栖:B,v;S,vg;E,b;E,nr;M,nr;M,l;B,n;B,ns;M,n;E,ns;M,ns;
+渚:S,g;E,ns;M,ns;M,nr;E,nr;B,ns;
+芝:B,n;B,ns;B,nt;E,nrt;E,n;M,nt;M,n;E,nz;M,ns;M,nz;E,nr;M,i;E,nrfg;B,nz;
+搞:S,v;B,v;E,v;B,a;E,a;B,n;B,l;
+颡:S,g;
+钩:S,n;E,v;E,n;B,n;S,v;E,nz;B,v;E,nr;M,n;B,i;E,i;E,l;M,l;
+榫:B,n;E,n;M,n;E,v;
+瘪:S,a;E,a;B,n;M,z;B,z;B,v;E,z;E,v;
+谮:S,g;
+鸺:S,x;
+瞿:B,nr;S,nr;B,nrfg;E,nr;M,nr;B,n;
+鐾:S,g;M,nr;E,nr;
+跃:E,v;B,v;S,vg;E,vn;E,ad;M,nr;E,nr;M,l;B,i;M,i;M,nz;M,n;M,b;E,l;B,n;B,ns;B,l;E,i;E,n;B,vn;E,nrfg;E,a;
+仅:S,d;E,c;E,d;B,d;B,v;M,d;M,l;B,l;M,i;B,i;E,nr;M,nr;
+菇:E,n;S,ng;M,n;M,nz;B,n;E,nr;E,v;
+效:B,n;E,a;E,n;E,v;M,n;B,v;E,b;S,ng;E,i;M,l;M,nr;E,nr;M,i;E,l;E,j;M,nz;E,vn;M,v;E,nz;E,ns;
+筌:E,nr;S,g;
+赘:E,an;S,ag;E,v;B,n;B,v;M,l;E,nr;
+荜:S,x;E,n;M,i;
+婢:E,n;B,n;M,i;
+绥:B,ns;S,j;B,v;E,j;M,nr;E,nr;B,nrt;M,ns;E,nrt;E,ns;B,n;B,nz;
+镨:S,g;
+噪:B,n;E,v;S,ng;E,a;M,l;M,nz;E,i;S,vg;E,vn;E,n;B,a;M,n;
+俯:B,v;S,v;B,i;B,n;E,nr;B,l;M,l;
+胱:E,n;S,x;M,n;M,nr;B,n;B,nz;
+击:E,v;E,vn;B,v;M,n;S,vg;E,i;E,b;M,l;E,n;E,l;E,nr;M,nr;M,i;B,n;B,vn;E,nz;B,i;M,nt;
+瑾:E,nr;S,nr;M,nr;
+侄:B,n;E,n;M,n;
+指:B,n;B,v;S,v;E,n;B,vn;E,j;M,n;E,v;E,nz;M,nz;M,l;M,i;B,i;E,i;M,ns;B,l;M,v;E,nr;M,nr;B,d;M,nt;B,nz;E,vn;E,l;
+肆:E,d;S,m;B,v;E,a;B,i;B,d;E,n;S,ng;E,v;E,i;M,l;B,vn;M,nr;E,nr;M,i;
+蚊:B,n;S,ng;E,n;M,n;E,nr;M,nr;
+完:B,v;B,ad;S,v;B,a;E,v;B,n;M,l;B,nr;B,i;M,nr;B,nrt;M,z;B,z;M,i;B,ns;B,l;E,nr;B,nz;B,vn;
+缏:S,g;
+鲎:S,g;
+甓:S,g;
+堡:E,ns;S,ng;E,nr;E,n;B,n;E,nrt;M,nt;M,nr;M,ns;E,nz;M,nz;M,n;B,nz;
+群:B,n;S,q;E,n;E,m;E,nr;M,ns;E,v;M,i;B,v;M,nr;B,l;M,l;E,j;B,i;E,ns;E,l;M,n;B,d;E,i;E,a;M,j;B,vn;S,m;M,v;B,ns;B,j;M,b;B,b;E,nz;B,nz;E,vn;B,nt;E,nrfg;
+吩:B,v;B,vn;E,n;M,n;B,n;
+昵:S,vg;E,v;E,a;B,n;E,nr;
+爽:E,a;B,a;S,nr;E,nr;E,i;B,nz;M,nr;E,v;B,n;E,z;B,vn;M,z;M,l;B,nrt;M,a;B,i;B,d;M,n;M,b;S,ag;
+惆:B,a;
+奋:E,v;B,v;B,d;E,a;M,i;M,n;S,vg;B,i;B,l;E,l;E,nrfg;M,l;E,ad;E,nr;E,n;M,nr;E,i;B,nz;M,nz;B,n;B,vn;E,vn;
+遑:S,ag;B,n;
+狒:B,n;E,n;
+陕:B,ns;S,j;B,j;S,nr;B,nt;E,n;E,nr;B,n;M,nr;B,nz;E,ns;M,nt;M,ns;
+束:E,v;E,vn;E,n;S,v;B,v;E,m;M,n;S,q;B,i;B,vn;B,nr;E,a;B,n;E,i;E,b;E,nr;M,nr;B,nrt;S,m;B,l;M,l;B,nz;
+忤:S,ag;B,v;B,l;M,nr;E,v;
+郦:B,nr;E,nr;S,nr;B,nrfg;M,nr;
+嗨:S,e;B,e;
+雪:E,n;S,n;B,n;E,nr;B,nr;M,nr;E,v;B,z;B,nz;M,i;M,n;B,i;E,vn;M,ns;E,l;E,i;B,ns;E,nrfg;B,v;B,t;M,l;M,v;B,nrt;E,nrt;B,s;B,b;E,nz;B,l;M,nrfg;B,nrfg;
+软:B,n;S,a;E,a;B,a;B,v;B,l;B,z;B,j;E,v;E,n;E,z;B,i;E,i;B,nz;M,nt;B,b;E,nr;E,j;M,l;M,nr;M,i;M,n;M,v;E,ad;E,an;
+柴:B,n;S,n;B,nr;E,n;B,ns;E,v;E,nz;M,n;E,i;B,i;M,ns;M,i;M,nt;B,l;B,nrt;E,nr;M,nr;E,j;
+屹:E,nr;B,v;S,vg;M,i;M,nr;M,l;B,d;
+剽:B,a;B,v;B,vn;B,n;
+殁:S,g;
+言:E,n;S,vg;E,u;E,v;M,i;B,n;M,n;B,nr;M,l;E,nr;B,v;E,i;B,i;E,l;E,c;M,c;E,r;M,nr;E,b;B,l;E,d;E,nz;E,nrfg;E,a;M,nt;B,nz;M,ns;E,vn;M,nz;E,z;
+涅:S,ng;M,nr;E,nr;S,vg;M,ns;M,nrt;E,nrt;B,ns;B,nrt;E,nz;E,ns;
+谄:B,v;M,i;B,i;
+枉:S,vg;E,v;M,i;B,v;M,n;B,z;E,nr;M,l;B,i;
+玑:E,n;E,nr;S,g;E,nz;E,i;M,nr;
+儒:B,n;E,nr;S,ng;S,j;M,nr;B,nz;E,n;B,z;E,i;M,n;M,i;E,nrfg;M,nrfg;B,l;E,l;
+辙:E,n;E,i;S,n;E,nr;E,v;E,a;M,nz;E,l;E,nrfg;M,nr;
+膝:S,ng;B,n;E,v;E,n;E,i;E,nr;M,i;M,l;E,l;
+傧:B,n;
+檫:S,g;
+脲:S,g;E,n;B,nz;M,n;E,nz;
+常:E,d;E,a;S,d;B,n;B,a;B,d;E,b;B,v;B,b;B,nr;B,ns;M,n;M,nt;E,t;B,l;B,j;E,i;E,v;E,nr;E,n;M,nr;B,vn;M,vn;M,b;M,i;M,l;E,l;E,nrt;E,ns;E,z;M,z;B,nrfg;B,nz;M,v;M,nz;B,nrt;M,j;E,vn;B,z;M,ns;B,i;
+值:E,n;E,v;S,n;B,v;E,l;M,n;B,n;B,a;B,vn;M,l;E,vn;B,l;E,a;M,i;E,nr;E,i;E,j;S,v;M,nt;M,nr;M,v;M,nz;E,b;
+霾:E,n;S,g;
+髋:B,n;
+硌:S,v;
+鳏:B,n;B,i;
+发:B,v;B,vn;E,v;B,n;S,v;M,n;B,a;B,l;E,n;E,j;E,d;M,nt;E,nz;E,vn;E,i;S,m;M,l;E,nr;M,nr;E,m;M,nz;M,i;E,b;B,j;E,l;B,i;B,nz;M,ns;E,nt;M,j;B,t;B,b;E,ns;M,b;E,nrt;M,v;M,nrfg;B,ns;E,a;E,mq;M,mq;E,nrfg;
+篡:B,v;
+奢:B,a;B,n;S,ag;B,v;M,i;E,nr;B,vn;E,a;B,l;
+卦:S,n;E,n;E,v;M,n;E,nr;M,ns;E,vn;B,n;E,i;S,q;
+矩:E,n;B,n;S,ng;E,nr;M,z;E,z;E,l;E,i;M,nz;B,b;E,a;M,nr;M,i;
+陨:B,n;S,vg;B,v;M,nr;
+啪:S,o;E,o;M,o;B,o;
+潮:E,n;S,n;B,n;E,nr;B,a;B,ns;E,v;B,v;M,n;M,nr;E,i;M,l;M,i;M,nz;E,nt;B,l;B,nrt;E,nz;E,ns;B,vn;B,z;M,v;M,nt;E,nrfg;E,l;
+菱:E,nr;S,ng;E,nz;B,n;M,nz;M,nr;B,nz;M,nt;B,ns;E,nt;E,ns;
+哿:S,g;M,nr;
+睾:B,n;E,n;M,n;M,nz;
+莆:B,ns;B,n;
+程:E,n;B,n;M,n;S,n;B,nr;E,l;E,b;E,nr;E,v;S,q;E,m;E,d;B,v;E,nz;M,nt;M,nr;M,l;B,b;M,b;M,i;M,nz;E,i;E,vn;B,nrfg;E,j;M,v;E,nrfg;E,ns;B,i;S,m;
+簏:S,g;
+醒:E,v;S,v;E,a;B,v;B,a;E,l;E,nr;E,i;E,vn;M,nr;B,n;M,l;M,n;B,l;
+咔:S,o;B,o;B,n;
+伙:E,n;B,n;M,n;E,v;S,q;E,r;E,m;E,mq;M,r;B,v;E,e;E,nr;M,ns;M,nr;E,l;M,v;B,b;E,vn;
+溘:B,i;
+舛:E,l;B,n;
+窠:S,n;B,n;M,i;E,n;
+鸣:E,v;S,v;E,nr;M,n;B,v;M,nr;S,vg;B,n;E,i;E,vn;E,n;M,i;B,i;E,l;B,vn;E,nrt;B,ns;M,l;M,ns;B,l;B,nrt;E,nz;E,r;M,nrfg;B,nrfg;E,ns;E,nrfg;
+粤:S,j;B,ns;B,n;E,nr;M,nr;B,nz;M,nz;E,ns;B,j;B,nt;M,j;E,nz;
+圩:B,n;E,ns;B,ns;E,nrfg;
+椭:B,n;
+侮:B,v;E,v;S,vg;E,n;B,n;B,nz;E,vn;
+芰:S,g;
+蒴:B,n;S,g;
+家:E,n;S,q;B,n;E,r;E,m;S,m;B,s;E,v;M,nr;E,l;M,n;M,nt;B,j;M,ns;E,ns;M,i;E,nrfg;M,l;E,nr;M,nz;E,d;B,l;M,b;E,nz;B,i;B,nz;B,v;B,nr;E,i;B,q;E,q;E,b;B,a;E,vn;M,j;M,r;B,b;M,e;M,v;E,a;B,nrt;B,ns;M,m;M,nrfg;E,nrt;M,nrt;
+麸:B,n;E,n;
+乃:S,v;B,c;B,v;M,nr;E,nr;M,n;E,v;B,n;B,ns;M,ns;M,l;M,i;B,nr;
+赅:E,i;S,vg;
+揆:S,g;E,nr;
+蝉:S,n;B,v;B,n;E,nr;E,i;M,nr;M,i;E,n;E,l;
+屏:B,n;S,ng;E,n;B,v;E,nr;B,ns;M,nr;B,nz;M,ns;E,nrt;E,v;M,i;B,i;E,ns;E,nz;M,l;B,l;
+翎:S,ng;B,n;E,nr;M,nr;E,n;M,n;E,nz;
+镕:M,nr;
+诖:S,g;B,v;
+付:E,v;E,vn;B,v;S,v;E,n;B,nr;M,n;B,l;B,n;M,l;B,i;M,nr;E,nr;E,mq;M,i;B,vn;M,vn;E,b;
+扛:S,v;B,v;B,l;
+跚:E,v;S,x;E,l;E,nr;E,vn;
+嫠:S,g;
+峤:E,nr;S,g;M,nr;
+闪:B,v;S,v;B,n;E,z;B,z;E,v;M,z;M,n;M,l;E,nr;E,l;E,i;M,i;E,n;B,i;M,nr;B,b;B,nz;B,ns;M,nz;
+顷:E,m;E,q;B,t;B,d;E,d;S,q;B,i;S,m;M,nr;E,l;B,nrt;E,nr;
+役:E,n;S,ng;E,v;E,b;E,nz;E,vn;M,n;B,v;E,r;B,n;E,nr;M,nr;M,l;E,i;B,nrt;E,ns;M,ns;E,nt;
+绸:E,n;B,n;S,ng;M,l;M,i;M,n;B,v;M,nr;E,nr;
+兽:E,n;S,ng;B,n;E,nr;E,i;M,i;M,nr;M,n;E,v;B,nz;B,l;E,l;
+沅:B,ns;S,j;E,nr;M,nr;
+蜈:B,n;M,nr;
+碍:E,n;E,v;S,v;M,n;B,a;B,v;E,b;B,i;M,i;M,v;M,l;B,l;E,i;M,nz;
+倒:S,v;B,v;E,v;E,d;B,n;B,a;M,i;B,l;E,i;B,d;M,l;M,n;B,i;E,a;E,vn;B,c;E,n;E,l;B,vn;B,ns;M,nr;B,vd;M,v;M,nz;M,z;E,z;
+锔:S,g;B,n;
+氚:S,g;
+肝:S,n;B,n;E,n;M,n;B,i;E,v;M,l;M,i;E,l;E,i;M,nz;E,nz;B,j;B,nz;
+骡:B,n;S,ng;E,n;
+鲥:B,n;
+琪:E,nr;M,nr;S,g;M,n;B,i;M,i;E,nrfg;E,nrt;
+涯:E,n;S,ng;E,i;M,i;M,l;E,v;E,nr;E,l;M,nz;M,nr;
+踮:S,v;B,v;
+枳:B,n;
+玻:B,n;S,j;B,ns;M,n;B,nrt;B,l;M,l;M,nt;B,nz;M,nz;E,nr;B,j;B,nt;B,vn;
+杈:E,n;S,n;E,v;
+獐:B,n;B,i;M,n;
+哕:S,g;
+畔:E,n;S,ng;E,ns;E,nr;E,s;M,nr;
+惝:B,a;S,x;
+湮:B,v;B,i;
+英:B,ns;S,j;B,n;E,nr;B,nz;M,nr;B,nt;E,n;B,a;B,j;B,nr;B,q;B,m;M,m;M,n;E,nz;E,nrt;B,nrt;M,ns;B,i;M,j;B,l;M,q;M,i;B,b;E,nrfg;M,nz;M,l;M,nrfg;E,ns;B,ad;E,b;M,nrt;B,nrfg;M,nt;
+究:E,vn;M,n;B,d;E,v;M,nt;E,d;S,vg;S,d;E,n;E,l;M,i;M,s;E,a;M,l;B,v;M,j;E,nr;M,b;
+黹:E,n;S,g;
+叻:S,g;E,ns;M,ns;
+都:S,d;E,ns;B,n;E,n;E,d;E,v;M,ns;B,nr;B,ns;M,n;M,nr;E,nr;E,nz;M,nt;B,v;E,nrt;M,nz;B,nz;B,vn;B,nrt;E,vn;M,i;B,b;B,nrfg;M,nrt;
+百:M,m;B,n;B,m;E,m;M,n;S,m;M,nr;M,i;B,i;B,nz;B,ns;M,l;B,l;B,d;E,nz;B,b;M,nz;E,j;E,nr;E,i;M,j;M,nt;E,l;B,mq;M,ns;B,nt;B,j;B,nr;E,mq;
+袂:E,d;S,ng;E,v;M,i;
+笋:E,n;S,n;B,n;E,i;E,nr;E,nz;E,ns;B,ns;S,ng;
+喔:S,o;S,e;
+丙:B,n;M,n;S,mg;M,nz;M,nr;B,m;E,nr;B,nz;E,nrfg;M,i;E,nz;
+茛:E,n;S,x;
+蔟:S,g;
+尥:B,v;
+亮:S,v;E,a;E,nr;E,v;E,n;B,n;B,v;E,z;B,a;M,nr;B,z;M,z;E,nrfg;B,l;E,l;M,n;M,i;B,nz;E,b;M,ns;M,nz;E,i;M,l;
+莰:S,g;
+佃:B,n;S,v;E,v;M,n;E,nr;M,nr;E,n;
+棂:S,g;E,n;M,nr;E,nr;
+拆:B,v;S,v;E,v;B,n;M,n;B,vn;M,i;M,nz;B,l;M,v;E,n;B,j;E,nr;M,nr;
+绎:E,v;M,i;E,nr;S,g;M,n;M,nr;
+楗:S,g;M,nr;
+俘:B,n;E,v;S,v;B,v;E,n;E,vn;M,n;
+蛞:S,x;B,n;
+照:E,p;B,v;S,v;B,n;E,v;E,n;B,d;M,n;E,nr;M,nr;E,j;M,i;M,l;M,ns;E,i;B,vn;E,l;M,nz;B,b;B,i;E,vn;B,l;B,nz;
+铪:S,g;
+饷:E,n;B,n;E,v;
+长:E,n;E,v;S,a;B,n;B,ns;B,d;M,n;B,v;E,a;B,a;M,nr;B,l;M,j;E,z;M,z;B,nz;B,z;B,b;B,nrt;M,i;E,nr;E,i;B,i;E,r;B,j;M,nt;B,nt;B,nr;M,ns;E,l;E,b;M,b;M,nz;M,nrfg;M,l;E,nz;E,j;E,ns;E,nrfg;B,nrfg;M,v;E,d;B,vn;B,s;
+谀:S,g;E,v;M,i;
+疑:E,v;E,d;B,n;E,a;B,v;M,n;S,vg;M,l;E,i;S,ng;E,n;E,l;M,z;E,z;E,nr;M,i;E,vn;B,i;B,l;M,nr;E,an;
+缢:E,v;S,g;B,n;
+沫:E,n;M,nr;M,v;M,n;M,l;B,n;E,i;M,nz;
+猪:S,n;B,n;E,n;E,v;M,n;E,nr;B,nz;M,nz;M,nr;M,i;M,l;B,l;E,t;B,t;B,j;
+纷:E,d;B,d;E,n;M,i;B,a;S,ag;E,i;B,n;B,v;E,z;B,i;M,z;B,z;M,l;M,n;B,l;B,ad;
+汀:E,ns;B,ns;E,nrt;B,n;E,nz;E,n;E,nrfg;M,ns;B,nrt;M,n;M,nz;
+橄:B,n;M,n;B,ns;
+蛇:S,n;E,n;B,n;M,i;E,i;E,nr;M,nr;M,n;B,ns;M,l;B,v;E,l;E,v;E,t;E,nz;M,ns;M,v;
+忍:B,v;S,v;E,v;E,a;B,i;M,i;M,l;E,i;E,nr;B,d;B,n;E,l;M,n;M,nr;B,nz;B,vn;M,nrfg;
+嗑:S,v;E,v;
+郓:B,ns;S,g;
+柝:S,g;M,nr;
+形:B,n;B,v;E,n;S,ng;E,v;E,b;M,n;M,l;M,i;B,l;B,i;M,d;E,i;M,ns;E,nr;E,ns;E,l;E,nz;M,nr;E,vn;M,s;B,b;M,v;M,nz;E,a;
+篥:E,n;S,x;
+啦:S,y;E,o;M,o;E,z;E,nr;M,n;M,nz;M,z;B,n;E,nz;E,n;
+遨:B,v;S,vg;M,nr;
+迭:S,d;E,d;B,v;E,vn;E,v;E,nr;B,l;B,vn;E,i;M,ns;M,l;M,nr;B,n;B,nrt;E,l;M,nz;E,n;
+楮:S,nr;
+杲:E,nr;S,nr;M,nr;
+廷:E,n;M,nr;S,g;E,nr;E,ns;B,n;M,n;M,l;M,nt;M,ns;E,nrt;B,nrt;B,nr;E,nt;
+勿:S,d;E,d;E,v;B,n;M,i;M,nr;E,nr;B,i;B,l;M,l;
+辂:S,g;E,nr;M,nr;
+簋:S,ng;
+馎:B,n;
+咐:E,v;E,vn;S,x;E,l;
+鞒:S,g;E,nr;
+舟:S,n;E,n;B,ns;E,i;E,nr;B,n;E,nz;E,v;M,i;M,nr;B,l;B,nrt;M,ns;M,n;E,nrfg;
+漭:S,x;
+躬:B,v;S,ng;S,vg;E,v;M,i;E,nr;B,l;M,n;B,i;
+芴:S,g;B,n;
+隼:S,g;E,n;E,nr;M,nr;
+赁:E,v;M,n;S,v;E,nr;
+濂:S,g;E,nr;M,nr;
+旆:S,g;E,nr;
+屋:E,n;B,n;B,s;S,n;E,v;E,ns;E,nz;B,nz;M,i;M,n;M,nr;M,ns;E,nr;M,nrt;E,i;M,nt;B,ns;
+镑:S,m;E,m;E,q;S,q;E,nr;
+跖:S,g;M,n;B,n;E,nr;
+诚:E,nr;E,a;B,a;S,a;B,n;M,i;B,v;E,v;M,nr;B,i;B,d;B,l;E,d;E,n;M,n;B,nz;E,nz;M,j;M,l;M,nt;E,ad;E,nrfg;E,vn;E,l;M,a;B,an;
+豫:E,a;S,j;B,ns;E,l;E,nr;E,j;B,n;M,nr;M,i;M,j;E,n;M,z;E,z;M,l;M,ns;B,j;B,nz;E,v;M,nt;
+拴:S,v;E,nr;B,n;M,nr;E,n;B,v;
+她:S,r;B,r;
+盼:S,v;B,v;E,v;B,nr;E,nr;E,i;B,n;M,nr;M,i;M,l;E,nz;B,nz;E,vn;
+沁:B,ns;S,v;E,nr;M,ns;E,ns;M,nr;B,i;E,nz;B,v;B,n;B,l;
+悉:E,v;B,d;S,ad;S,vg;B,ns;M,nr;E,nr;B,nt;B,l;B,nz;M,ns;
+锐:E,a;S,a;B,n;B,v;E,nr;B,a;S,nr;M,nr;B,d;E,i;M,v;E,n;B,l;M,n;B,i;E,nz;M,l;
+侗:S,j;B,nz;E,nr;M,ns;M,nr;B,n;
+氖:B,n;M,n;
+蚝:S,n;B,n;
+鲡:E,n;S,x;
+妣:E,i;S,g;
+骥:E,nr;M,nr;S,nr;E,i;S,ng;M,i;E,n;
+垧:S,q;E,m;S,m;
+琦:M,nr;E,nr;S,nr;E,nz;
+涫:S,g;M,nr;E,nr;
+爪:S,ng;B,ns;B,n;E,n;E,i;E,nr;M,nrt;M,n;M,nz;M,ns;
+夸:B,v;B,nrt;S,v;B,n;E,v;B,i;M,i;E,nr;M,nr;B,ns;M,n;B,nz;E,l;B,q;B,vn;B,l;
+逾:S,vg;B,v;M,i;M,l;E,nr;B,t;
+慈:B,a;B,nrt;B,nr;S,ag;E,nr;B,n;E,a;M,nr;B,ns;M,i;M,l;E,nrt;B,i;M,nz;M,ns;E,nz;M,nt;
+哑:B,n;S,v;E,a;B,i;M,n;E,i;E,n;E,v;B,z;E,j;B,l;B,b;M,v;M,l;B,nz;
+曝:B,v;S,vg;B,nz;B,n;E,nr;M,i;
+幢:S,q;E,m;E,n;S,m;M,z;E,nr;E,z;
+童:E,n;B,nr;B,n;S,nr;B,t;S,n;E,nr;M,n;M,nr;E,l;M,l;M,nt;E,nz;M,i;M,ns;E,i;M,nz;B,i;B,l;B,nz;E,nrt;E,j;M,t;
+呦:S,e;
+烩:B,n;S,v;E,n;M,nr;E,nr;
+剪:S,v;B,n;B,vn;B,v;E,v;E,vn;E,n;B,nz;M,nr;B,i;E,nr;M,nz;
+空:B,n;E,n;S,a;M,n;B,s;E,s;B,v;E,vn;E,v;B,a;E,nr;M,nt;B,nr;B,b;B,z;M,i;M,l;B,d;S,v;E,i;B,i;B,l;M,v;E,z;E,d;E,l;E,j;M,j;E,a;B,vn;E,nt;B,j;E,nz;B,nz;E,b;B,nt;B,an;B,ns;M,nr;M,nz;M,z;M,ns;E,nrt;M,nrt;M,nrfg;
+灾:B,n;S,n;E,n;M,l;E,vn;M,i;E,v;M,n;E,i;E,l;B,l;E,nr;
+芊:S,x;E,nr;M,nr;
+後:S,nr;E,nr;
+笏:S,g;E,nr;M,nr;M,i;
+焓:S,g;E,nr;M,nr;
+果:E,c;E,n;B,d;B,n;S,ng;M,c;M,n;B,a;E,ns;E,v;E,nr;E,nz;E,i;M,nr;M,ns;B,ad;B,i;B,c;B,nr;M,l;M,i;B,j;E,j;B,ns;B,nrt;M,nt;B,b;M,nz;M,j;B,nz;E,nrt;M,nrt;B,v;E,l;M,t;E,nrfg;
+娥:E,n;M,ns;M,l;B,n;E,nr;
+倩:E,nr;S,v;M,nr;B,n;S,nr;M,i;
+熨:S,v;B,v;M,n;B,n;B,a;M,nr;
+渭:B,ns;E,nrfg;M,i;E,nrt;M,ns;E,ns;
+薰:S,v;E,nr;M,nr;B,v;E,nz;
+莴:B,n;
+砹:S,g;
+豁:B,v;S,v;B,n;B,a;B,i;B,d;E,a;E,nr;
+滂:M,l;B,a;B,n;
+嵋:S,g;E,n;M,n;E,nr;M,nr;
+拊:S,g;
+盒:E,n;S,q;B,n;E,m;S,ng;B,b;S,m;M,n;E,nz;M,nr;E,r;
+敛:E,v;S,vg;B,v;E,vn;E,i;E,a;M,nr;B,i;E,nr;
+损:B,n;B,v;E,vn;E,v;S,vg;S,vn;E,n;B,vn;M,n;B,i;E,i;E,nr;M,v;M,l;E,l;E,a;M,nr;M,i;
+胞:E,n;M,n;E,b;E,l;B,n;M,nt;M,ns;
+黢:E,z;M,z;S,ag;
+寤:B,v;
+赫:B,nr;E,nr;M,nr;B,z;S,nr;E,a;S,q;B,nrt;E,q;B,ns;B,q;E,nrt;M,i;E,z;M,ns;B,i;M,n;M,nz;B,nz;E,nz;M,nrt;E,l;B,nt;B,l;M,z;E,ns;M,nt;
+旰:S,g;M,i;
+援:E,v;B,vn;S,vg;E,vn;B,v;B,n;E,n;M,nr;M,j;M,n;E,i;E,nr;M,nz;E,nrfg;E,l;M,i;E,j;B,d;
+秸:E,n;B,n;
+掉:S,v;E,v;B,v;B,i;M,l;E,i;B,l;
+瞑:B,v;M,i;
+阐:B,v;S,vg;E,nr;M,nr;B,vn;
+途:E,n;B,n;B,s;E,d;E,b;S,ng;M,i;B,v;M,l;M,n;E,s;E,nr;E,i;E,j;E,v;M,s;
+挞:E,v;S,g;M,i;B,v;M,nr;
+索:E,v;B,nr;E,n;E,nr;B,v;B,d;M,nr;S,nr;B,n;E,vn;E,ns;B,ns;M,ns;S,j;S,vg;M,n;E,i;E,a;B,nz;E,nrt;B,nrt;S,ng;E,z;M,i;M,l;E,l;M,z;M,nrt;M,nz;B,z;E,m;B,i;B,vn;B,nt;E,j;E,nz;M,nt;M,t;B,l;
+馥:E,nr;B,z;S,ag;M,nr;E,nrt;M,nrfg;
+咧:S,v;M,z;E,z;B,v;M,i;B,n;M,n;M,nr;
+眦:S,g;M,i;E,v;
+梯:E,n;B,n;S,ng;M,n;M,nz;M,b;E,nr;M,nr;B,nr;S,q;E,ns;M,l;E,nz;M,ns;
+吼:S,v;B,v;E,v;B,n;E,nr;M,n;E,i;E,n;B,vn;
+錾:S,v;E,nr;B,n;
+桄:B,n;S,v;
+蓇:B,n;
+扈:B,nr;E,a;B,n;S,nr;E,i;M,ns;M,nrt;B,ns;E,nr;M,nr;
+巍:E,nr;S,nr;M,nr;B,z;E,z;M,z;B,d;B,ns;B,i;B,nr;E,nrfg;
+毙:E,v;S,v;B,v;E,i;E,l;
+葜:S,x;E,n;
+翡:B,n;B,ns;M,nr;
+坦:B,n;E,ns;E,a;E,nr;B,a;M,ns;B,v;S,j;M,nr;M,n;B,ns;M,nt;E,nrt;E,nz;M,nrt;M,nz;B,nrt;B,ad;B,i;B,z;M,z;B,nz;M,i;M,l;B,j;E,z;B,nt;
+珩:E,nr;S,g;B,v;B,nz;
+仫:B,nz;M,ns;
+敲:S,v;B,v;E,v;B,n;B,i;B,l;M,i;B,nz;E,l;M,l;E,i;
+祺:M,nr;E,nr;S,g;
+闽:S,j;B,ns;B,j;B,n;B,nt;B,nz;E,nr;M,nr;E,j;B,nrt;
+獾:S,g;E,n;B,n;
+膊:E,n;S,g;M,n;E,v;M,l;M,i;E,l;
+岌:B,i;M,i;B,z;M,z;
+谗:S,vg;B,n;M,i;
+纠:B,v;B,n;S,vg;E,l;M,z;E,z;B,j;B,vn;E,nr;
+夥:S,g;
+朱:B,nr;S,nr;B,n;E,nr;M,nr;B,nrfg;B,b;B,nrt;B,ns;M,i;B,i;B,nt;M,n;E,n;M,ns;B,nz;
+蚰:B,n;E,n;
+肴:E,n;S,g;B,n;E,i;E,nr;
+骸:E,n;B,n;E,i;M,n;
+钼:S,ng;B,n;E,nz;M,n;E,nr;B,nz;M,nr;
+草:B,n;E,n;S,n;E,v;M,n;B,b;E,nr;M,i;B,l;B,v;M,nr;M,ns;E,nz;E,d;B,d;B,a;B,vn;M,l;B,i;E,l;B,nrt;E,i;E,nrt;E,a;M,nz;B,nz;E,b;M,nt;B,ns;E,vn;B,ad;E,ns;B,j;M,j;B,nr;
+懊:B,v;B,vn;
+痒:S,a;E,a;E,v;B,a;E,i;E,n;E,z;E,l;M,l;B,z;
+汗:S,n;E,ns;B,n;E,nr;E,n;E,v;E,l;B,i;M,n;M,l;M,nr;B,z;M,ns;B,l;E,nrt;M,i;B,v;
+觚:S,ng;
+壤:E,n;E,v;E,ns;B,n;M,n;M,i;E,i;M,ns;M,nz;B,ns;
+韦:B,nr;S,nr;E,nr;M,nr;E,ns;B,nrt;E,n;M,nrt;E,nrt;M,ns;B,ns;M,nt;B,nz;B,i;B,nrfg;
+曰:S,vg;E,v;M,nr;E,nr;E,c;E,l;M,i;E,i;
+艳:E,a;S,a;E,nr;B,a;M,nr;B,n;E,z;B,v;M,z;M,i;E,l;M,l;B,l;E,i;E,v;E,nrfg;B,vn;M,n;
+惴:B,i;M,i;B,z;E,z;M,z;
+避:B,v;E,v;S,v;M,l;B,n;B,vn;M,i;B,i;B,ns;M,ns;E,nr;M,nr;M,v;B,l;M,n;
+梅:E,nr;B,nr;B,n;E,n;S,ng;M,nr;S,nr;B,ns;B,nrt;B,nz;E,ns;E,nz;M,n;M,i;M,ns;M,nt;M,nrt;E,nrt;M,nz;E,v;S,j;E,l;M,t;B,nrfg;E,nrfg;
+抉:B,v;B,vn;S,vg;
+皑:E,z;B,z;E,i;M,i;M,z;
+吒:E,nrt;S,g;E,nr;
+炕:S,n;B,n;E,n;B,s;M,nr;E,v;
+宣:B,v;B,vn;B,n;B,nr;M,nr;S,nr;E,nr;B,ns;B,t;M,nt;E,i;M,j;M,l;B,j;M,nz;M,i;E,j;M,nrt;
+颥:E,n;
+喧:B,v;S,vg;B,vn;M,i;B,n;B,i;E,v;B,a;E,nr;M,nr;S,ag;
+瘦:S,a;B,a;E,a;B,n;B,z;E,z;E,i;M,z;B,nz;E,n;B,l;M,i;B,ns;B,b;M,nr;E,l;
+掳:S,vg;B,v;
+鸶:E,n;S,x;
+瞻:M,n;S,vg;E,n;B,v;M,i;B,i;E,nr;E,i;M,nr;E,l;B,n;B,vn;
+唼:S,x;
+仁:E,nr;M,nr;S,ng;B,nr;E,n;B,n;B,ns;E,i;E,v;B,a;M,i;E,nz;M,ns;B,i;E,ns;M,nz;M,nt;B,nrt;M,n;E,a;E,nrt;M,l;M,nrt;B,l;S,ag;B,nz;
+诃:S,g;M,nr;E,nr;B,nrt;
+睐:E,v;M,l;S,g;E,nr;
+乖:S,a;B,n;B,a;E,n;E,d;B,d;E,v;B,z;E,nr;M,nr;M,i;
+绡:S,g;E,n;E,nr;M,nr;E,nz;
+饤:E,n;
+狩:B,n;E,nz;B,v;B,nrt;
+蛱:S,x;B,n;
+巷:S,ng;E,n;B,n;E,i;B,s;B,v;E,nr;M,i;E,ns;M,n;E,l;B,ns;E,nz;M,nr;M,l;M,ns;
+髹:S,g;
+铽:S,g;
+凿:S,v;E,v;E,a;B,v;B,n;M,i;E,i;E,l;E,n;E,nr;B,i;M,l;B,l;
+牾:S,vg;E,v;
+貂:S,n;B,n;E,n;M,nr;M,n;E,nr;E,v;
+缋:S,g;
+钒:S,n;E,n;M,nz;E,nr;B,n;
+斜:S,v;E,v;B,n;B,v;E,n;M,z;E,z;M,n;S,a;B,f;M,l;B,b;M,nr;B,nz;M,ns;B,i;E,d;E,nz;
+鬣:B,n;S,ng;
+利:B,n;E,n;B,v;M,ns;M,n;E,ns;E,a;S,n;M,v;E,vn;M,nr;E,nr;E,v;B,a;E,ad;B,nr;E,nz;M,l;E,nrt;B,ns;M,nz;E,l;M,nt;M,i;M,nrt;B,nrt;E,i;B,nz;M,b;M,vn;E,b;B,l;B,i;B,nt;E,nrfg;E,j;M,nrfg;M,z;B,z;E,nt;B,vn;M,t;
+昱:E,nr;S,g;M,nr;
+怵:S,vg;E,v;B,i;
+庶:B,n;E,a;B,c;E,n;B,b;M,n;M,nr;
+稹:E,nr;
+劾:E,v;S,g;E,nr;M,nr;
+蹁:B,v;S,g;
+衅:E,v;S,g;M,l;E,vn;M,n;M,nr;
+艉:S,g;
+惊:B,a;S,v;B,v;E,v;E,a;M,i;B,i;E,i;B,n;M,l;E,nr;E,l;B,ad;B,l;B,vn;B,t;M,nr;M,n;
+奏:S,v;E,n;E,v;B,n;M,n;B,v;E,nr;E,vn;E,b;M,nr;E,i;
+卓:B,a;B,nr;E,nr;S,nr;M,nr;B,i;M,i;B,n;B,z;M,ns;B,v;B,ns;B,nrt;E,z;B,nz;M,nrfg;B,l;
+瓒:E,nr;S,nr;M,nr;
+苞:S,ng;B,n;E,nr;E,n;M,i;M,l;E,v;M,n;
+忠:E,nr;S,nr;B,n;M,nr;B,a;B,v;E,v;B,i;S,vg;M,i;E,a;B,b;B,l;E,n;B,ns;M,ns;B,nrt;M,l;E,nrfg;E,ns;M,nrfg;B,nr;
+鳢:S,g;E,n;
+叨:E,v;E,z;M,z;B,v;E,vn;
+轫:S,g;
+淬:B,vn;B,nz;B,v;
+柰:S,g;
+命:E,vn;E,n;S,n;B,n;E,v;B,v;M,n;E,nz;E,i;M,nt;E,d;M,nz;E,nr;E,l;M,l;M,i;M,ns;E,a;M,nr;E,b;B,a;M,v;B,l;E,z;M,vn;B,b;S,v;B,vn;B,t;B,i;
+痼:B,n;
+酿:B,vn;E,v;B,v;S,v;B,n;E,n;M,t;E,nr;
+退:B,v;S,v;E,v;B,n;B,vn;M,i;M,vn;B,l;E,l;E,i;M,n;B,i;E,vn;B,j;M,nr;E,j;M,l;M,v;B,nz;E,nr;
+瞅:S,v;B,v;E,nr;M,nr;M,i;
+阄:E,v;S,ng;M,v;
+弊:S,ng;B,n;E,n;E,i;E,v;E,vn;M,n;E,l;
+舌:S,n;B,n;E,n;E,i;E,v;M,n;M,ns;E,l;M,l;M,v;E,a;B,v;M,i;E,nr;B,i;B,l;E,b;B,vn;
+踔:S,g;B,i;
+焖:S,v;E,v;E,nr;B,n;
+眚:S,ng;
+废:S,v;B,v;B,n;E,v;E,vn;M,n;E,i;E,a;M,nr;B,b;B,vn;E,n;M,l;M,i;B,i;S,ag;M,nrt;B,j;
+挢:S,g;
+炫:B,v;S,vg;B,a;E,nr;M,nr;B,n;B,nz;
+漪:M,nr;E,n;S,g;E,nr;B,n;
+键:E,n;S,n;M,n;B,n;E,nr;M,nr;B,l;S,nr;B,v;B,b;M,b;M,nz;
+堰:S,ng;E,ns;E,nr;B,ns;E,n;M,ns;B,nz;M,nr;E,nz;B,n;
+粳:B,n;E,n;
+鬲:S,ng;E,nr;
+贾:B,nr;S,nr;M,nr;E,nr;E,n;M,ns;B,nrfg;E,l;E,i;B,nrt;B,ns;B,l;E,nrt;E,ns;
+铃:M,n;E,n;S,ng;B,n;B,nr;E,nr;E,nz;M,nr;E,i;M,l;M,i;B,nz;M,nt;M,b;E,v;E,l;
+蛏:E,n;B,n;
+桐:E,n;B,ns;E,nr;B,n;S,ng;M,n;M,nr;E,j;B,nz;E,ns;B,nr;M,ns;
+湔:S,g;
+兖:B,ns;S,g;B,nz;M,nr;B,j;E,nr;B,nt;
+坚:B,v;B,a;B,ad;E,nr;S,a;B,i;S,nr;B,n;M,nr;E,n;E,vn;M,n;M,ns;B,vd;M,i;E,v;M,l;E,i;B,l;B,nrt;E,l;M,nt;E,d;B,nt;S,ad;B,q;M,m;E,ns;B,m;S,ng;
+篝:B,n;B,i;
+查:E,vn;B,v;E,v;S,v;B,nr;M,n;B,nrt;E,l;E,nr;M,nr;M,nt;B,ns;M,ns;M,l;B,vn;M,nrt;E,n;M,nz;M,i;B,l;E,ns;B,n;E,nrt;B,nz;
+豨:B,n;
+筲:S,g;B,n;
+诽:B,v;B,n;E,v;B,vn;
+仿:B,d;B,v;E,v;S,v;B,n;E,n;B,b;B,vn;M,n;M,nr;B,nz;E,nr;M,nrfg;S,n;
+傀:B,n;M,nr;
+球:E,n;B,n;S,n;M,n;E,v;M,vn;E,nr;M,nt;M,nz;M,ns;E,nz;E,ns;E,vn;M,nr;E,j;B,l;E,l;E,nt;B,nz;M,v;M,t;
+馆:E,n;S,ng;B,n;E,ns;E,nt;M,n;B,ns;E,r;E,nr;E,vn;E,v;E,nz;M,v;M,nt;E,i;B,v;M,l;E,j;
+岈:S,g;
+龊:S,x;E,a;E,i;
+昏:E,t;B,v;S,v;B,a;B,z;E,v;M,i;B,l;B,vn;M,z;B,n;M,l;B,i;S,tg;E,i;M,d;B,d;M,nr;S,vn;M,n;E,nr;S,a;E,n;
+氓:E,n;S,x;E,l;M,n;E,nr;
+五:B,m;M,m;S,m;B,n;E,n;E,m;B,t;E,t;B,j;B,ns;B,nz;B,i;M,i;B,b;B,nrt;M,nr;E,nr;B,mq;M,t;B,l;B,nr;M,n;M,l;M,ns;E,l;M,nz;M,j;B,vn;M,nt;E,nrfg;E,nz;B,nt;E,j;E,i;
+窜:S,v;E,v;E,i;B,v;M,l;
+鸟:S,n;B,n;E,n;B,v;E,nr;M,n;M,i;E,i;B,i;M,nr;B,nz;E,l;M,l;E,v;E,nz;B,ns;B,nr;B,nrt;
+悠:B,a;E,z;B,z;M,z;E,v;S,v;B,i;B,ad;B,an;E,nr;B,v;B,l;M,nr;M,l;M,n;E,n;
+缵:S,g;E,nr;
+麴:S,nr;
+改:B,v;B,vn;S,v;E,v;B,n;M,l;E,j;M,nr;B,i;B,d;B,j;E,nr;M,n;M,i;E,vn;E,i;M,nz;B,nz;E,l;M,j;M,nt;B,ns;B,l;
+蒸:B,n;B,v;S,v;M,n;E,vn;M,i;B,i;B,vn;E,nr;M,nz;E,nz;B,nz;E,n;M,nr;E,v;E,b;B,ns;
+呃:S,y;B,v;
+珂:E,nrfg;
+秆:S,ng;E,n;B,n;E,b;M,n;E,nr;
+翊:M,nr;S,g;E,nr;
+旎:S,x;E,a;E,i;M,l;
+毒:B,n;E,n;E,v;S,n;E,vn;M,n;B,v;E,l;E,a;E,nz;M,l;E,an;M,v;B,a;M,i;E,b;E,j;M,nz;E,i;S,v;B,i;B,vn;M,b;B,j;B,z;B,l;B,nz;M,t;
+嫜:S,g;
+触:E,v;B,v;S,v;B,n;M,i;E,n;B,i;E,vn;M,n;E,l;M,b;M,nz;B,nz;B,l;E,b;B,vn;E,nr;B,b;M,l;M,nr;
+迪:B,nr;B,ns;E,nr;M,nr;E,nz;S,nr;M,nz;M,ns;B,nz;M,nrt;B,nrt;E,ns;E,nrt;E,vn;M,n;M,nt;B,nt;B,n;M,i;E,v;E,nrfg;
+独:B,v;B,a;B,n;E,d;B,d;S,d;B,i;S,a;M,i;E,a;B,vn;M,nr;B,b;B,ns;B,l;B,j;B,ad;B,nz;M,l;B,nr;M,n;E,nr;E,c;E,j;E,v;M,ns;E,ns;B,nrt;M,v;E,i;M,nt;M,nrfg;
+维:B,v;E,n;B,n;M,ns;M,nr;E,nr;E,m;B,nr;B,ns;B,vn;B,nz;M,n;E,l;S,nr;S,j;B,nrt;B,j;M,nrt;S,q;E,nz;M,l;M,nz;M,nt;S,m;E,nrt;E,v;E,ns;M,v;M,i;B,nt;B,z;B,i;M,m;S,vg;E,vn;E,j;E,nrfg;S,ng;M,vn;
+蹿:S,v;B,v;M,l;
+霄:E,nr;E,n;S,nr;M,i;M,nr;B,n;E,i;M,ns;E,v;B,i;E,nz;
+堆:S,v;B,v;E,n;E,m;B,n;E,v;S,q;B,vn;E,l;B,i;E,nr;S,n;E,ns;M,v;M,ns;B,ns;E,nz;
+粉:E,n;B,n;S,n;B,v;B,b;M,n;B,i;E,v;E,nz;E,nr;M,nr;E,i;E,l;M,nz;B,z;M,i;S,v;B,nz;B,vn;E,vn;M,l;
+茌:S,nr;B,ns;
+褐:B,n;M,n;S,b;S,ng;E,n;B,nz;
+钙:S,n;E,n;B,n;M,n;B,v;E,nz;B,nz;B,vn;E,nr;
+骝:S,g;E,nr;E,n;
+股:B,n;S,q;E,n;E,m;E,v;S,m;E,r;M,nz;M,n;E,vn;E,nr;B,l;M,nt;B,q;B,j;E,nz;M,l;B,v;M,nr;E,l;B,i;E,j;B,nz;M,d;E,i;
+戢:S,nr;
+掷:S,v;E,v;E,i;B,n;M,i;B,i;B,v;
+耶:B,nr;S,j;E,nr;M,nr;B,ns;B,nt;S,y;B,nrt;M,nrt;E,nrt;M,nt;M,ns;B,n;M,n;B,nz;E,n;M,nz;
+榻:S,n;E,n;E,v;B,n;M,n;
+捌:S,m;B,m;E,nr;M,m;E,m;
+仕:S,n;B,n;E,n;E,nr;M,nr;E,v;E,i;
+镘:S,g;M,nr;
+属:S,v;E,n;B,v;E,v;B,n;E,vn;M,n;E,b;E,l;M,nz;E,nr;M,ns;M,l;B,a;M,nr;M,nt;E,i;M,b;E,j;B,vn;
+腠:B,n;S,ng;
+蝤:B,n;S,x;
+凫:B,v;
+埯:S,g;
+巳:S,mg;E,m;E,nr;E,nrt;M,nr;M,m;B,t;
+恶:S,a;B,n;B,a;B,v;E,a;E,v;E,n;M,i;B,b;B,l;B,z;B,i;B,d;E,i;E,nr;M,n;M,l;M,nr;E,vn;E,l;M,z;B,an;E,nz;E,an;M,j;
+智:B,n;S,ng;E,nr;E,n;B,nr;S,nr;M,nr;E,a;B,ns;B,v;S,j;M,n;E,i;M,i;M,nrfg;E,v;M,l;E,b;B,i;B,b;E,l;B,nt;E,nz;B,vn;M,j;E,ad;E,j;M,b;B,j;S,ag;E,nrt;E,nrfg;
+汾:B,ns;E,ns;B,n;M,nz;M,ns;M,nr;
+冀:B,ns;S,j;B,nr;M,j;S,nr;M,nt;E,v;B,nt;E,j;E,nr;M,ns;M,nr;B,n;E,vn;B,j;E,n;B,nz;
+垄:B,v;S,ng;B,n;B,l;M,n;E,n;E,nr;M,nr;
+领:B,n;E,v;E,n;S,v;B,v;B,vn;E,nr;M,n;M,l;B,l;M,nr;M,i;E,i;E,b;E,l;B,b;M,nt;E,nz;M,ns;
+蒎:S,g;
+侔:E,nr;S,g;
+箜:B,n;
+涨:E,v;S,v;B,n;B,v;E,a;B,j;M,i;B,vn;E,nr;M,nr;M,n;E,l;B,nz;M,l;
+媲:B,v;
+樽:S,ng;M,nr;B,n;E,nr;M,i;
+讼:E,vn;S,vg;M,n;E,l;E,v;B,n;E,n;E,i;E,b;B,j;
+遁:S,vg;E,v;B,v;B,i;E,nr;B,n;
+啃:S,v;M,l;B,l;M,i;B,v;
+狂:E,a;S,d;B,n;B,a;B,v;B,i;E,i;M,i;E,v;B,l;B,vn;E,n;M,n;M,l;E,l;B,an;E,nr;E,nz;M,nr;E,ad;
+际:E,n;M,d;E,f;M,n;M,nt;S,ng;E,l;M,v;E,b;M,nz;E,i;E,nt;M,l;E,nz;B,n;M,vn;E,v;M,ns;S,vg;M,nr;E,z;M,i;M,b;E,nr;E,vn;M,j;M,t;
+绊:S,v;E,n;B,v;B,n;M,z;E,z;E,v;
+擎:E,n;E,nr;S,v;B,v;M,nr;B,n;M,n;M,i;
+獗:E,a;S,x;
+祛:B,v;S,vg;B,n;M,i;B,nz;
+罟:S,g;E,n;
+鳞:S,n;B,n;E,n;M,i;E,nr;M,nr;M,n;B,i;B,v;E,z;B,z;
+散:E,v;S,v;B,v;B,n;E,a;M,n;E,i;E,vn;B,a;E,n;M,i;E,nr;B,b;M,nr;E,l;B,vn;E,j;B,i;M,v;M,z;E,z;M,nrt;M,l;S,n;M,nz;M,b;M,nrfg;
+歧:E,n;B,v;B,n;S,ag;M,l;E,nr;M,nr;B,vn;M,i;M,n;B,nz;M,b;
+称:S,v;B,v;E,v;E,n;B,n;E,a;M,n;M,nr;B,a;M,i;E,ad;B,i;M,l;E,nr;B,l;E,vn;E,j;B,nrt;B,vn;B,ns;
+荷:E,n;B,ns;S,ng;B,n;E,nr;B,nrt;S,j;M,nr;E,d;B,nt;M,ns;M,nz;M,n;B,nz;B,i;E,b;E,j;B,nr;M,l;E,l;
+襻:S,v;E,n;
+轿:B,n;S,ng;S,j;E,n;M,n;M,l;E,l;
+而:S,c;B,c;E,c;M,i;B,u;E,d;M,l;B,y;M,c;M,n;B,d;B,t;B,v;M,nr;E,nr;B,nrt;M,v;M,b;M,d;B,i;M,z;M,nrfg;B,l;
+涕:E,n;S,ng;E,v;M,i;E,i;B,n;B,v;B,i;E,nr;
+谔:S,x;E,nr;
+猖:B,a;B,ad;
+媛:S,x;E,nr;M,nr;E,nrt;
+甚:B,d;S,dg;B,r;B,z;B,v;M,i;M,l;B,c;E,a;E,nr;M,c;E,d;E,i;B,i;B,b;E,u;B,n;M,nr;
+辩:B,v;B,n;E,v;S,vg;B,vn;M,n;E,nr;B,l;E,vn;E,vd;E,n;E,l;E,a;E,i;M,l;B,i;B,a;
+洪:B,nr;B,n;E,nr;M,nr;S,nr;B,ns;E,v;E,vn;B,t;B,a;M,n;B,nz;E,n;S,ng;M,l;M,ns;B,i;B,l;E,ns;S,j;M,nz;B,nrfg;B,nt;E,nrt;M,i;M,nt;B,v;E,nrfg;E,nz;
+倬:S,g;E,nr;M,nr;
+纳:E,v;B,v;E,nr;S,v;E,ns;B,nr;B,n;M,ns;M,nr;B,nz;E,nrt;E,n;M,n;E,nz;B,ns;S,j;B,nrt;B,j;B,m;M,nrt;E,vn;M,i;B,a;M,nz;M,nt;E,nt;M,l;M,m;E,i;B,nt;
+尴:B,a;M,i;B,an;
+茶:S,n;B,n;E,n;E,v;E,nr;M,nr;B,ns;M,n;B,nz;E,nz;B,i;M,i;B,j;B,l;E,vn;E,ns;E,l;M,ns;M,nz;M,nt;M,l;
+蔺:B,n;S,nr;B,nr;E,nr;M,nr;E,ns;M,ns;
+沿:B,f;S,p;B,p;B,v;B,n;E,s;B,d;E,n;B,b;M,nr;B,s;E,nr;B,ns;E,p;E,i;E,ns;M,n;M,nz;
+叁:S,m;B,m;E,nr;E,m;M,m;
+嗅:S,v;B,n;B,v;
+苋:E,n;B,n;
+橐:S,o;M,nrfg;
+汔:S,g;
+卖:S,v;E,v;B,v;B,n;M,n;B,a;M,i;B,l;B,i;M,nr;B,vn;E,l;E,vn;M,l;E,n;M,nt;E,i;B,nz;M,nz;M,v;E,nz;
+握:E,v;S,v;B,v;E,l;B,nz;E,i;B,i;M,n;B,n;M,nr;
+日:S,m;E,t;B,ns;B,n;S,j;E,n;E,m;B,d;B,t;E,r;M,nz;B,j;B,b;E,vn;E,d;B,nt;B,v;E,nrt;M,i;M,n;M,l;E,i;M,ns;E,nz;E,b;M,m;B,i;M,nr;B,nr;E,v;E,l;B,nz;B,m;B,nrt;E,nr;M,nt;B,l;E,ns;M,nrt;E,nrfg;B,q;E,q;B,a;B,z;M,nrfg;E,j;M,t;M,j;B,vn;M,v;M,b;
+捶:S,v;B,v;B,i;M,i;
+蟹:S,ng;E,n;B,n;B,nz;M,nz;M,i;E,v;E,nz;
+咄:B,i;M,i;B,v;
+戋:S,x;
+搏:B,v;S,vg;E,v;E,n;S,ng;B,vn;M,n;E,nr;M,nz;M,l;E,l;E,i;M,nr;
+逗:B,v;S,v;E,v;B,n;B,a;E,nr;M,nr;E,vn;M,n;
+碜:E,v;S,x;E,a;
+抠:S,v;B,a;B,v;B,l;M,l;
+撤:B,v;S,v;E,v;B,vn;E,nr;B,nz;
+邬:S,nr;B,nr;
+垮:S,v;E,v;B,v;M,z;E,z;E,a;
+骰:B,n;
+妲:S,g;E,nr;M,nr;
+鲴:S,g;
+椽:S,ng;B,n;E,nr;M,nr;
+袼:S,x;
+镅:S,g;
+篆:S,ng;B,n;S,j;E,n;
+乓:M,n;S,o;E,j;M,o;E,o;M,nt;
+赕:S,g;
+鏖:B,v;
+桧:E,nr;S,g;M,nr;E,nrfg;B,n;
+详:B,a;B,ad;S,ag;E,v;B,n;B,v;E,a;E,i;E,nr;M,z;B,z;M,nr;
+仨:S,m;B,m;E,n;E,m;
+跪:S,v;B,v;E,v;B,n;B,vn;
+六:B,m;M,m;S,m;E,m;B,n;B,t;B,ns;E,t;B,j;M,i;M,nr;M,ns;B,i;E,nr;B,nz;E,nrt;M,l;M,j;B,b;M,n;M,nt;M,nrt;E,l;M,nz;E,ns;E,nz;B,mq;E,n;B,nrfg;B,s;E,i;
+烬:E,n;E,l;S,g;E,nr;
+孱:B,a;
+鹳:E,n;S,g;B,ns;E,nr;M,nz;M,nr;
+棼:S,g;
+犁:S,n;E,ns;M,ns;B,n;E,nr;B,v;M,n;E,n;S,v;B,nz;M,nr;B,i;E,v;E,nrfg;
+锄:S,v;B,n;B,v;E,nr;M,nr;B,l;E,n;E,v;
+娆:E,a;S,x;E,i;
+尊:B,v;S,q;B,n;E,m;E,v;B,a;E,n;M,nr;E,nr;M,n;M,i;E,vn;S,m;E,i;B,vn;B,i;M,l;B,l;E,l;B,nrt;
+悍:E,a;B,d;E,an;B,n;E,i;B,a;B,i;
+檑:B,n;S,g;
+冗:S,ag;B,a;B,n;E,a;E,d;
+隙:E,n;S,ng;M,i;E,d;B,n;E,i;E,l;
+宛:E,nr;B,nr;B,v;E,ns;S,nr;B,ns;E,nz;S,d;M,nr;B,vd;B,nrt;M,nz;M,n;M,ns;B,a;
+琚:S,nr;E,nr;
+额:E,n;B,n;S,n;E,b;E,v;B,b;M,n;B,ns;B,d;B,nr;B,nrfg;E,nz;E,i;M,nr;E,nr;B,nrt;E,vd;E,d;B,i;M,l;
+芡:B,n;E,v;
+玫:B,n;M,nr;B,nz;E,n;
+氪:S,g;
+疯:B,a;S,v;B,n;E,v;B,v;M,nr;B,z;M,z;E,l;M,l;M,i;E,n;M,n;
+阮:B,nr;S,nr;E,nr;M,nr;B,nrfg;
+崴:S,v;E,ns;E,nr;M,nr;
+憷:S,g;E,v;E,nr;
+舶:E,n;S,ng;M,n;E,nr;M,nt;B,n;
+涿:B,ns;B,n;
+廉:S,ag;B,a;E,a;B,n;E,nrt;B,v;B,nr;E,nr;E,l;M,nr;E,n;M,i;M,nrt;B,l;M,l;M,ns;E,v;B,ns;B,i;E,i;M,nt;
+慌:S,a;S,v;B,ad;E,a;E,an;B,a;M,i;M,z;B,z;M,n;E,ad;B,i;E,z;E,v;B,v;M,l;E,n;
+藏:S,j;E,v;E,n;E,ns;M,ns;B,n;S,v;B,nz;M,n;B,v;E,nr;B,nr;E,j;M,nz;B,s;B,b;E,vn;M,nr;M,nt;B,i;M,i;E,l;B,nrt;B,ns;E,i;M,l;E,nt;M,v;E,nz;M,nrt;B,l;B,vn;B,j;M,b;E,b;E,a;
+迓:S,g;
+浔:S,j;B,ns;E,ns;M,nr;E,nr;M,ns;
+剖:B,v;M,n;B,n;E,v;S,v;B,vn;E,i;M,l;B,i;E,nr;M,nr;
+幞:S,g;
+荠:E,n;B,n;B,nz;M,nz;
+蕤:S,x;E,a;B,n;
+滩:E,n;S,ng;B,n;E,ns;E,nr;E,v;M,nr;M,n;M,nt;M,ns;E,nrt;M,nz;E,nz;
+轨:B,n;S,ng;E,n;E,v;E,b;E,vn;M,n;E,nr;B,nz;M,l;E,i;E,a;
+叫:S,v;B,v;E,v;B,n;E,i;M,n;E,vn;E,nr;B,i;B,vn;M,l;M,nr;M,i;B,a;B,b;E,z;M,nrfg;B,ns;
+郭:B,nr;S,nr;E,n;E,nr;M,ns;M,nr;B,ns;B,nrfg;M,i;M,n;E,ns;
+嗯:S,e;
+扶:S,v;B,v;E,v;B,ns;B,nr;B,n;B,vn;E,nr;M,n;B,i;E,b;M,i;M,nr;B,z;B,d;B,l;M,nt;E,nz;B,j;B,nz;M,nz;B,nt;M,l;
+蛹:S,g;E,n;B,n;
+摺:S,v;B,v;B,n;
+湾:E,ns;E,n;S,v;M,ns;E,nr;M,nz;M,nt;B,ns;B,n;M,nr;S,q;M,n;E,nz;E,nrt;E,s;B,nrt;M,b;
+邂:B,v;B,i;
+善:E,v;S,v;B,v;E,a;B,n;B,a;E,nr;E,ad;M,nr;M,i;E,ns;B,i;S,dg;M,l;M,ns;E,i;E,n;M,n;S,ag;E,l;B,ns;B,l;M,v;E,b;E,nrt;M,nt;
+骆:B,n;B,nr;S,nr;B,ns;B,nz;E,nr;M,n;M,nr;
+很:S,d;B,m;B,a;B,d;B,l;M,m;B,n;M,nr;
+漓:E,v;M,i;B,ns;E,i;E,l;S,j;E,nr;E,a;
+袒:B,v;E,v;S,vg;B,l;
+掠:B,v;S,v;E,v;M,n;B,n;E,l;B,vn;E,vn;M,i;M,l;B,d;B,b;B,i;
+蜣:B,n;
+斤:E,m;S,q;E,q;S,m;M,i;B,n;B,i;M,n;E,n;E,mq;M,l;M,nrfg;
+栽:B,vn;S,v;B,v;E,n;B,l;E,v;B,n;M,l;E,nr;M,nr;
+烂:S,v;E,v;E,a;S,a;E,n;B,n;M,i;E,z;B,z;E,i;B,v;M,z;M,l;M,nr;E,l;M,n;B,i;E,nr;B,a;B,nz;E,vn;B,l;M,v;
+奇:B,v;E,nr;E,a;B,n;S,ag;B,a;E,n;M,nr;E,nrt;B,nz;B,i;E,i;B,b;M,i;M,n;S,a;S,nr;E,ns;E,nz;B,ns;M,nz;M,l;E,l;M,nrt;B,nrt;E,v;M,b;M,ns;B,z;E,vn;B,vn;E,nrfg;S,ad;
+鹉:E,n;M,n;S,x;E,nr;M,i;
+糊:E,a;B,a;M,z;S,v;E,v;E,z;B,n;E,n;B,v;M,i;M,l;B,z;M,n;E,l;M,v;B,i;E,vn;B,vn;
+聍:E,n;S,x;
+体:E,n;B,n;E,a;B,v;S,n;S,ng;B,s;M,n;M,vn;E,d;M,l;E,b;E,v;M,nr;E,nr;B,vn;E,l;B,nr;E,j;M,c;B,a;M,d;E,nz;M,i;M,nt;E,nt;E,i;M,v;M,b;B,j;M,ns;B,l;B,i;M,nz;B,z;M,z;E,vn;B,nz;B,t;M,j;
+棒:S,a;E,n;B,n;E,i;M,n;E,nr;E,nz;M,nr;B,v;M,nz;E,v;M,i;E,a;B,ns;B,i;B,z;
+豕:S,g;M,i;E,i;
+埘:S,n;
+筛:S,v;B,v;B,n;B,vn;E,n;M,nr;E,nz;E,v;M,i;M,v;
+姜:B,nr;S,n;E,n;M,nr;E,nr;B,n;B,ns;B,nrfg;B,i;
+俨:B,v;
+镯:E,n;B,n;M,nz;
+崆:B,ns;S,g;
+涑:S,g;B,ns;
+谐:E,a;S,ag;B,n;B,a;E,v;E,nr;B,z;M,l;E,i;M,nz;
+岛:E,ns;E,n;S,n;B,n;B,s;E,nr;M,n;E,nrt;M,ns;M,nt;M,nr;E,nz;E,j;M,nz;E,nrfg;B,ns;B,nr;B,nrt;M,i;M,nrt;
+礞:S,x;
+产:B,n;E,n;E,vn;M,n;B,v;E,v;E,j;S,v;B,j;M,l;M,nt;E,b;B,vn;E,l;B,l;M,j;M,nz;M,b;E,i;B,t;E,nr;M,vn;M,v;B,nz;M,nr;B,b;M,t;B,jn;M,ns;E,nz;
+嘬:S,v;
+犯:S,v;B,vn;E,v;E,n;B,v;B,n;E,i;E,d;M,n;M,i;B,l;M,l;B,i;E,nr;E,l;E,vn;
+碳:S,n;B,n;E,n;M,n;E,nz;B,v;B,nz;S,ng;E,l;M,nz;
+娴:B,a;M,nr;
+治:E,n;B,v;E,v;M,n;S,v;M,ns;E,vn;M,l;B,n;M,nt;E,t;E,nr;M,nr;M,nz;E,nz;E,l;B,ns;E,ns;M,i;E,nrt;E,i;B,vn;B,l;M,v;B,i;B,nz;M,nrt;M,nrfg;B,j;M,b;E,j;E,nrfg;B,nrt;M,j;
+茺:S,x;
+晌:E,m;B,t;S,q;S,tg;E,t;M,m;E,v;E,nr;
+苏:B,ns;E,v;B,nr;E,ns;S,j;M,ns;B,n;B,j;B,nt;E,nr;M,nr;B,nz;B,v;M,nt;M,n;E,n;B,nrt;E,nrt;B,nrfg;M,nz;M,nrt;E,a;M,z;E,z;
+汐:E,n;M,n;S,g;
+啖:S,vg;E,nr;
+遘:S,g;E,nr;
+博:B,n;E,nr;B,nr;S,nr;B,v;M,nr;M,ns;B,ns;E,v;M,n;B,a;S,ng;B,vn;S,vg;E,ns;E,a;S,j;B,i;B,nrt;M,j;B,l;E,l;E,nz;E,nrt;B,nz;M,i;E,j;M,nz;E,i;E,vn;B,j;M,nrt;M,nt;E,z;E,nrfg;B,nt;M,l;
+鹜:E,i;S,ng;M,l;E,n;
+表:B,v;E,n;B,n;E,v;S,n;M,n;B,vn;M,nz;E,nr;M,nt;E,l;E,vn;M,nr;E,nz;M,i;E,b;M,l;E,i;B,i;E,r;B,l;B,nz;M,ns;
+韭:B,n;B,nz;M,nr;
+煮:S,v;B,v;E,v;M,nr;E,nr;M,i;M,nz;
+壳:E,n;S,n;M,n;B,n;M,l;B,nz;E,nr;E,nz;E,v;E,i;S,ng;B,nt;E,j;M,nt;
+署:E,v;E,n;S,ng;B,v;E,nt;B,n;B,j;M,nr;E,l;E,nr;M,n;E,r;
+捺:M,i;S,n;S,v;E,v;
+追:B,v;S,v;B,n;E,v;M,l;M,i;B,i;B,vn;E,i;B,l;E,nr;M,nr;M,n;B,nz;E,l;
+咀:B,v;E,ns;M,i;
+搋:S,v;
+戏:B,n;E,n;S,n;E,v;B,v;M,nt;M,n;E,l;E,i;B,nz;M,v;M,i;M,l;E,nz;E,j;B,j;M,t;B,nt;B,vn;M,nz;E,nr;
+栓:E,n;B,n;S,ng;E,nr;M,n;E,v;M,nr;
+阗:E,ns;S,g;E,nr;M,nr;
+护:E,v;M,n;B,n;B,v;S,v;E,vn;E,n;B,nz;B,vn;M,nr;E,nr;M,l;M,ns;E,ns;M,nz;E,nz;E,i;M,nt;
+梨:S,n;B,n;E,n;E,nr;M,nr;M,n;M,nz;B,ns;E,ns;B,i;B,nz;M,ns;B,l;E,nz;
+眭:S,nr;M,nr;
+鲰:S,g;
+镁:S,n;E,n;M,n;B,n;E,nr;B,nz;E,nz;M,nr;
+偃:B,ns;B,i;M,nrt;B,n;B,v;
+濒:B,v;S,vg;B,vn;B,b;E,nr;M,nr;B,n;
+恣:B,d;B,v;M,i;B,i;
+鑫:E,nr;S,nr;M,nr;M,nz;B,nz;E,nt;E,nz;
+坭:S,g;
+孵:B,v;S,v;B,t;B,vn;B,n;B,nz;
+璁:S,g;E,nr;M,nr;
+销:B,vn;E,v;B,n;E,vn;M,n;S,v;E,n;B,v;M,j;B,i;B,a;E,l;E,i;M,l;M,nt;B,l;E,j;M,nz;E,nr;M,i;M,jn;
+将:S,d;B,n;E,n;E,d;B,t;B,d;M,n;M,nr;M,i;B,i;E,i;B,v;E,nr;E,v;E,l;M,l;B,ns;B,b;B,nrt;M,ns;
+碉:B,n;
+邙:B,ns;S,g;E,nr;
+麝:B,n;
+蒡:E,n;M,nz;S,x;
+芥:B,n;S,q;E,n;B,nrt;E,nr;M,l;M,nr;
+侧:E,f;S,v;B,f;B,n;B,v;E,n;B,d;E,i;B,vn;E,s;B,nz;E,v;M,nr;M,i;B,i;S,q;M,n;
+氦:S,n;E,n;B,n;
+疫:B,n;E,vn;E,v;M,n;E,n;S,ng;E,l;M,nt;
+横:S,v;B,v;B,n;E,v;B,ns;E,a;M,i;B,i;E,nr;B,d;M,l;M,n;M,nr;B,nz;B,l;E,l;B,b;B,a;E,nz;M,v;E,i;B,nr;E,ad;B,nrt;
+圬:S,g;
+环:B,n;B,j;S,v;E,vn;E,n;B,v;M,l;E,nr;E,ns;M,n;B,ns;B,nz;E,b;E,i;M,nr;M,ns;M,nz;E,nz;M,nt;B,l;E,s;M,j;B,t;M,b;E,l;B,nt;M,i;E,nrfg;
+逮:B,v;S,v;B,n;
+禳:S,a;M,nr;E,nr;
+鸲:S,g;B,n;
+嬴:S,g;B,nr;M,nr;E,nr;
+枷:B,n;M,i;E,n;
+似:B,d;E,v;B,u;E,a;S,d;S,vg;M,i;M,n;B,i;B,l;M,nr;E,nr;M,l;M,v;
+殿:S,n;E,n;E,nr;B,n;E,ns;M,nr;B,s;B,v;E,nz;E,i;M,b;S,ng;M,nz;M,ns;
+品:E,n;B,n;M,n;S,v;E,m;B,v;M,l;M,nt;E,l;E,j;E,b;E,v;E,nr;M,v;M,nr;E,nz;S,m;M,ns;M,nz;B,vn;M,i;B,i;B,q;E,r;M,b;M,j;B,nr;B,nrt;E,i;B,b;
+畀:S,g;
+祈:B,v;S,vg;S,ng;M,nr;E,nr;B,nz;B,b;
+杌:S,g;B,n;
+菏:S,j;B,ns;E,nr;
+呖:E,o;B,o;
+烙:B,n;S,v;E,n;E,nr;M,n;M,nr;
+绝:B,d;E,v;S,d;B,m;B,v;B,n;B,a;E,i;E,ns;M,i;E,l;M,l;B,l;B,b;B,i;E,n;B,vn;B,z;E,a;E,z;B,t;E,nr;M,m;M,n;M,v;
+塞:S,v;E,v;M,ns;E,n;B,ns;M,nr;B,nr;E,nr;B,nrt;B,s;M,n;B,n;B,v;E,vn;E,ns;E,nrt;M,nrt;M,nz;M,i;E,a;B,nz;M,nt;B,l;B,j;B,i;B,nt;M,v;E,j;E,i;E,e;E,nz;
+拥:B,v;S,v;E,v;B,a;M,i;B,n;E,nr;E,i;M,nr;B,i;B,l;M,v;B,vn;M,l;E,j;
+荤:S,ng;B,n;E,v;E,n;B,nz;
+嗫:B,v;B,z;M,z;
+可:B,v;S,v;B,c;E,v;B,a;B,n;M,i;B,l;M,l;M,nr;E,d;M,d;M,n;E,nr;E,n;E,vn;M,c;B,i;B,vn;E,i;B,d;B,b;B,nz;E,nrt;B,z;M,ns;E,l;M,v;B,ns;M,nz;B,nrt;M,nt;B,nt;E,nrfg;M,nrt;E,ns;E,nz;M,j;
+喀:B,ns;S,j;M,ns;M,nr;B,nz;E,nr;B,o;E,n;S,o;B,n;M,nrt;M,nz;B,nt;B,nrt;
+厄:S,j;B,ns;B,n;M,nr;E,nr;B,nrt;E,nrt;M,nrt;E,ns;E,an;E,n;B,nt;B,nz;M,v;
+缇:S,g;E,nr;M,nr;
+鲆:S,g;E,nr;E,n;
+妈:E,n;S,n;B,n;E,nr;M,l;M,n;M,nr;B,ns;E,i;M,i;B,l;B,nrt;
+骊:S,g;B,ns;E,nr;M,nr;M,i;
+候:E,n;E,v;E,r;E,l;S,v;E,d;B,n;B,b;M,n;E,vn;B,l;B,v;B,nr;E,nr;E,t;E,b;M,nr;M,nt;B,vn;M,nz;E,nz;
+熘:S,v;M,nr;
+帝:E,n;B,n;E,nr;S,j;E,nrt;E,v;M,n;S,ng;M,nr;B,nr;M,ns;M,nz;M,nt;E,nz;B,i;B,nrt;E,i;M,l;B,ns;E,j;M,i;
+鬟:E,n;S,g;E,nr;M,nr;M,i;
+榨:B,v;B,n;S,v;E,v;E,vn;B,vn;M,nz;E,b;E,nr;M,i;
+元:E,m;S,m;E,q;S,q;E,n;B,t;B,n;M,t;M,nr;M,n;B,nr;E,nr;E,nz;M,vn;B,nz;E,v;M,l;B,ns;E,t;E,nrfg;E,b;E,ns;M,ns;E,nrt;B,a;B,nrt;M,nz;M,v;E,i;M,nrfg;B,q;M,nt;
+盂:E,n;S,g;M,nr;B,ns;
+铖:E,nr;S,g;
+飞:B,n;S,v;B,v;E,nr;E,v;B,vn;M,nr;B,nz;M,i;M,n;B,z;B,d;B,i;E,i;B,nr;E,j;M,l;E,n;B,ns;M,nt;E,nz;E,l;E,nrfg;B,l;E,vn;B,nt;M,ns;B,b;B,nrt;B,a;E,b;E,nrt;
+镫:S,g;E,n;E,i;E,nr;
+矬:B,n;
+山:B,n;E,ns;S,n;B,ns;E,n;E,nr;M,ns;B,s;B,nr;E,v;M,n;M,nr;M,i;B,nrt;M,nz;E,i;E,nrt;M,l;E,vn;E,nz;M,nt;B,nz;B,i;B,nt;B,l;B,f;E,l;B,v;E,nrfg;M,nrfg;M,nrt;B,j;E,nt;E,j;M,s;
+饳:E,n;
+婵:B,n;E,n;M,nr;
+阀:E,n;S,n;E,l;B,n;E,nz;
+逄:B,nr;S,nr;S,nt;
+萌:B,v;E,nr;S,v;S,nr;M,nr;B,ns;E,i;B,nz;B,vn;
+榕:B,n;S,j;S,ng;B,ns;E,nr;M,nr;B,nz;
+焚:B,v;S,vg;E,v;B,n;E,i;B,i;E,nr;M,nr;B,l;E,l;B,vn;
+墟:E,n;S,ng;M,nr;B,ns;
+笞:S,vg;E,v;E,nr;M,nr;
+让:S,v;E,v;B,v;M,n;E,nr;E,i;B,vn;E,l;M,nr;E,ns;E,nrt;M,l;M,nz;E,vn;B,n;M,ns;E,n;B,ns;
+听:S,v;B,v;E,v;B,n;E,a;M,i;E,nr;B,a;E,n;E,i;B,i;M,n;B,nr;E,vn;M,nr;M,l;B,vn;B,l;M,v;B,b;B,nz;
+炯:M,i;E,z;B,z;E,nrfg;B,i;E,i;
+窳:S,g;
+撷:S,vg;B,v;E,v;
+癀:E,nz;S,x;
+鳇:B,n;S,ng;
+蛋:B,n;S,n;E,n;M,n;M,l;E,v;E,nr;M,i;M,nr;E,nz;B,b;M,nz;B,nz;
+俑:S,ng;E,n;M,n;E,nr;B,n;M,ns;
+桔:B,n;S,nr;E,n;B,b;E,nr;S,ng;B,nrt;M,nr;
+珙:B,n;S,g;E,nr;B,ns;M,nr;
+党:E,n;S,n;B,n;E,nt;M,n;B,nt;M,nt;B,s;E,v;B,j;E,r;B,nz;B,nr;E,nr;E,ns;E,j;E,nz;M,nz;M,l;B,l;M,i;B,i;E,i;B,ns;E,vn;M,nr;M,b;
+囫:B,d;B,i;
+闭:E,v;S,v;B,v;M,n;B,n;B,vd;B,i;E,b;B,l;E,vn;E,n;B,a;B,vn;M,l;M,i;B,b;E,a;M,j;M,nz;M,v;
+菹:S,g;E,nr;
+任:S,v;E,n;E,v;B,r;B,n;B,v;B,nr;M,n;E,l;B,d;E,b;E,m;E,nr;B,nrfg;B,b;B,a;B,i;M,i;M,nr;E,i;S,m;B,vn;M,nt;M,l;B,ns;B,l;E,nrfg;E,vn;
+跽:S,g;
+簇:B,v;S,ng;S,q;E,q;B,q;B,z;E,i;E,nr;M,m;E,m;E,v;E,n;B,nz;B,n;E,z;
+龆:S,g;E,nr;
+馊:S,a;B,n;
+怏:E,z;B,z;B,i;M,i;M,z;
+莎:B,nr;M,nr;B,ns;E,nrt;B,n;E,ns;M,nrt;E,nz;E,n;E,nr;M,ns;M,nt;M,nz;B,nrt;
+匙:E,n;M,n;B,n;E,nrt;
+粜:S,v;
+舣:S,g;
+谧:E,a;S,g;E,nr;M,nr;E,nrfg;
+甭:S,v;S,d;B,c;B,v;E,nr;
+钬:S,ng;
+厮:B,v;E,n;M,i;B,vn;
+缱:S,x;B,a;
+挹:B,n;S,g;B,v;
+芸:B,n;B,i;M,i;M,nr;E,nr;E,z;B,z;E,nrfg;M,nrfg;
+洽:E,v;B,v;S,nr;B,n;M,nr;E,nr;M,j;B,vn;M,n;S,ag;
+剃:S,v;B,vn;B,n;B,v;M,n;
+痂:S,n;E,v;E,n;E,nr;
+魉:S,x;E,n;E,i;
+揎:S,v;B,i;
+瑗:E,nr;S,g;
+勘:B,vn;B,v;S,vg;E,v;B,n;M,n;E,j;M,nr;
+扣:B,v;S,v;E,n;E,v;B,n;E,i;E,l;B,i;E,nr;M,n;E,nz;M,l;B,vn;M,nr;
+迦:S,g;B,ns;E,nr;M,nr;M,n;E,ns;M,ns;B,n;B,nrt;E,nz;E,nrt;
+啭:S,g;E,v;
+影:B,vn;E,n;B,n;S,n;M,n;E,v;B,b;M,i;E,nr;E,i;E,vn;M,nt;B,v;M,l;M,nr;B,i;S,ng;E,j;B,l;E,l;S,vg;M,v;M,ns;B,nrt;M,nz;M,t;B,j;
+绰:B,n;S,v;M,i;E,a;E,nr;E,i;B,i;M,l;B,a;B,ns;M,nr;M,z;E,z;
+驳:E,v;S,v;B,v;B,n;E,z;E,l;E,vn;M,n;B,vn;E,nr;B,a;E,n;M,z;M,i;E,a;
+磴:S,q;B,ns;
+泼:S,v;E,a;B,n;B,a;B,v;E,v;E,l;B,t;M,nr;M,i;E,nr;M,z;E,z;M,l;B,o;B,i;M,v;M,n;E,n;B,nz;M,ns;
+衿:S,g;E,nr;M,nr;
+需:B,v;B,n;S,v;E,n;E,v;M,n;E,l;B,vn;E,i;M,l;M,v;E,nr;E,vn;M,nr;
+炅:S,g;E,nr;M,nr;
+鄄:S,g;B,ns;E,nr;
+帆:E,nr;S,n;B,n;E,nz;E,n;M,i;M,nr;E,v;M,n;E,nrfg;E,l;
+鬈:S,g;
+瀚:E,nr;E,a;B,n;M,nr;S,g;E,z;M,i;
+稞:E,n;M,n;E,nr;B,n;
+肥:B,a;E,n;B,n;S,n;E,v;E,ns;M,n;S,v;M,l;E,vn;M,ns;B,ns;M,i;E,nr;S,a;M,nt;B,vn;B,nz;M,nz;M,nr;E,i;B,nrt;B,z;M,z;B,l;B,b;E,l;B,i;
+株:E,m;S,q;E,n;B,ns;E,l;B,n;B,v;B,vn;S,m;M,i;E,r;E,nr;M,nr;B,i;B,nt;M,nt;E,i;
+唬:S,v;E,v;B,v;
+头:E,n;S,n;E,v;B,n;E,m;E,f;E,s;B,s;M,n;M,i;M,l;E,ns;B,a;E,d;E,b;B,v;B,i;E,l;E,nr;M,ns;B,b;E,i;M,d;E,a;E,vn;E,nz;B,f;B,l;M,nr;B,nz;B,t;S,m;M,v;M,nt;M,m;M,nz;B,d;M,z;E,nrt;B,ns;M,t;M,a;
+訾:S,nr;B,nr;
+着:S,uz;E,v;E,p;E,c;B,v;E,l;B,a;E,a;M,l;B,d;B,n;E,m;E,n;E,r;E,d;M,v;M,n;M,i;E,y;E,ad;B,y;E,u;S,m;E,i;M,nz;M,nr;B,vn;B,z;M,z;
+嫉:B,v;S,vg;B,i;E,v;M,i;E,vn;
+蟋:B,n;
+敌:B,n;S,ng;E,v;E,n;B,a;E,i;B,s;M,i;E,vn;B,v;B,l;E,nr;M,l;M,n;S,vg;M,nt;E,l;M,nz;B,i;
+仑:M,ns;E,n;E,ns;E,nr;E,q;S,g;M,n;M,nr;E,nz;E,nrt;
+诓:S,v;B,v;
+楔:B,n;S,v;B,l;E,n;E,nz;
+狙:B,v;B,n;
+做:S,v;B,v;E,v;B,n;M,v;M,l;E,i;M,i;B,i;B,a;E,l;E,nr;M,n;B,l;M,nr;
+蝠:E,n;S,x;M,n;E,nr;
+书:E,n;S,n;B,n;M,n;E,v;E,r;M,nr;E,nr;M,nt;B,v;E,vn;B,b;E,nz;B,s;M,nz;M,i;B,d;E,l;B,ns;B,i;E,i;B,nr;B,j;M,l;E,nrfg;B,nz;E,ns;M,nrfg;M,ns;B,l;
+铭:E,nr;B,n;S,ng;M,nr;E,n;B,v;M,i;S,vg;B,l;B,i;
+凯:E,nr;B,nr;B,nrt;S,nr;M,nr;B,n;B,nz;B,v;B,ns;M,ns;E,nz;S,ng;B,i;E,v;E,ns;E,nrfg;M,n;M,nrt;E,nrt;
+牮:S,g;
+晶:B,n;E,n;M,n;S,nr;E,nr;B,a;M,nr;M,z;E,z;B,nz;M,nz;E,nrt;B,i;S,ng;B,j;E,j;B,l;E,nz;E,nrfg;
+苹:B,n;B,ns;B,nt;M,l;B,nz;M,nz;M,nt;M,nr;
+恺:E,nr;S,g;M,nr;M,nrfg;B,nrt;
+猃:S,g;
+守:E,v;S,v;B,v;E,n;E,a;B,n;M,nr;E,vn;M,n;E,nr;M,i;B,a;E,i;B,i;M,l;B,l;E,l;B,vn;B,nrt;M,ns;M,nrfg;B,nr;M,vn;
+朋:B,n;M,n;S,ng;M,l;E,n;E,nr;M,i;M,nr;M,v;B,i;E,i;B,nz;
+颊:E,n;S,ng;B,n;
+意:B,n;E,v;E,n;S,ng;E,d;B,v;B,ns;B,a;M,n;E,a;E,i;M,i;M,l;E,ad;M,a;M,ns;B,l;E,l;B,i;E,nr;M,v;M,d;B,vn;M,nt;E,b;S,j;B,nz;M,nz;B,nt;M,nr;E,vn;E,nz;B,j;M,b;
+芎:S,x;E,n;E,nr;
+锗:S,n;E,n;E,nr;M,nr;E,nz;
+则:S,d;E,n;E,c;E,m;M,nr;E,a;M,d;E,nr;E,v;S,m;M,n;M,l;E,ns;M,i;M,ns;E,i;B,u;B,l;B,nrfg;E,ad;E,l;M,nrfg;M,nrt;E,b;
+尝:B,v;S,v;E,d;E,v;B,vn;M,i;M,nr;B,n;E,nr;M,l;B,l;B,i;
+货:B,n;E,n;S,n;M,l;M,n;E,v;B,l;M,nt;E,vn;E,nz;B,vn;B,i;M,j;E,j;M,i;E,i;E,nr;B,nz;E,nt;B,nt;B,j;M,nz;M,ns;E,ns;M,t;
+莸:S,g;
+氽:S,v;
+趼:S,g;M,nr;
+千:B,m;M,m;M,q;E,m;S,m;B,i;B,q;B,n;M,i;M,l;B,nr;B,ns;M,nr;B,l;E,n;E,i;B,d;B,mq;E,nr;M,nz;B,b;M,n;E,v;M,mq;B,nz;E,nrfg;E,l;M,nrfg;E,mq;M,ns;
+嵇:B,nr;S,nr;B,nz;M,nr;E,nr;
+细:B,n;S,a;E,ad;E,a;B,a;M,n;B,v;B,z;E,n;E,d;B,d;M,ns;M,z;M,i;M,l;M,b;M,v;B,l;M,nr;B,vn;B,i;E,i;E,z;E,v;E,nr;B,nz;E,b;M,nz;B,nrt;B,nr;E,nz;B,ns;E,l;
+磊:E,nr;S,nr;M,i;B,a;E,nrfg;M,nr;B,i;
+拎:S,v;B,n;E,nr;
+蹑:B,z;M,z;S,v;B,v;B,i;
+变:B,vn;B,v;E,v;S,v;B,n;M,l;E,n;E,vn;E,nz;E,i;M,n;B,l;E,z;B,i;E,l;M,nr;M,i;E,a;B,nz;M,nz;E,j;E,nr;M,v;E,b;B,b;M,b;
+祟:E,i;M,i;E,v;S,g;E,n;E,a;
+捣:B,v;S,v;E,v;B,n;M,v;M,i;
+酯:S,ng;E,n;E,nz;B,n;M,n;E,l;M,nz;B,nz;
+翰:E,nrt;B,nz;B,n;E,nr;S,ng;M,nz;M,nr;E,ns;M,ns;M,nrt;M,nt;E,nz;B,nrt;
+轻:S,a;B,d;E,a;B,a;B,n;E,d;E,v;M,n;B,z;M,z;B,v;B,b;M,i;B,i;B,j;E,i;B,vn;M,l;M,v;E,nr;M,nr;B,l;B,ns;M,nz;E,j;M,ns;E,nz;B,nz;E,l;B,ad;M,nt;M,b;
+淼:E,a;E,i;E,nrfg;
+西:E,ns;B,ns;E,n;B,s;S,f;B,f;B,n;M,ns;B,nr;B,t;E,nr;M,n;M,nr;E,f;E,nrt;B,nz;M,f;B,nrt;B,nt;M,nz;M,j;E,j;M,nt;M,i;B,v;B,j;M,l;M,nrt;B,b;E,nz;B,l;E,i;E,s;M,s;M,b;E,v;E,l;M,v;B,i;E,jn;
+禁:E,v;B,v;E,d;S,v;B,n;M,n;E,vn;E,i;E,n;B,vn;M,l;M,i;E,nr;M,nr;E,b;B,ns;M,nz;M,v;B,l;M,j;B,j;B,nz;E,j;M,t;
+儆:S,g;M,i;M,v;B,v;E,nr;
+圊:S,g;
+殍:E,n;S,x;M,i;
+耐:B,a;S,v;B,n;M,a;E,v;B,nz;B,v;E,n;B,b;B,i;B,l;E,a;B,an;M,nr;B,ad;E,i;E,nr;B,nr;M,n;M,i;M,l;B,vn;B,nrt;E,l;E,nrfg;
+枕:B,n;S,v;B,s;E,n;M,i;E,v;E,nr;M,nr;B,i;B,v;E,i;S,ng;E,ns;E,l;B,nz;B,l;E,nz;B,b;
+缚:S,vg;E,v;E,vn;B,n;E,i;M,n;M,i;
+欢:E,v;B,v;S,a;B,a;B,n;E,nr;M,i;B,i;E,n;B,ns;M,n;M,nr;B,l;M,v;E,vn;M,l;E,i;E,l;B,z;M,z;B,vn;M,nz;
+愦:S,g;E,a;
+未:S,d;B,t;E,d;B,v;B,d;M,i;B,n;M,l;B,i;E,nr;M,nr;M,n;B,vn;B,ns;B,nrt;B,l;E,m;M,nrt;B,nz;M,nrfg;M,m;E,nz;B,b;
+纯:S,a;E,a;B,a;B,n;E,nr;B,v;B,d;B,b;E,v;M,nr;M,n;M,i;B,nz;E,nz;E,vn;B,i;M,nrfg;
+嘴:S,n;B,n;B,s;E,v;E,n;E,ns;E,nr;M,i;M,n;B,a;M,ns;E,l;E,i;B,v;E,nz;M,l;M,nr;E,d;E,a;B,l;B,i;M,v;
+褶:B,n;S,ng;E,n;E,nr;M,n;E,b;M,nr;
+悻:B,d;E,d;M,d;
+础:E,n;M,n;S,ng;E,l;M,l;E,nr;E,v;M,nr;B,n;M,nt;
+鳃:S,n;B,v;M,n;
+必:B,d;E,d;S,d;B,a;B,v;B,l;B,n;M,l;M,i;M,nr;M,v;B,vn;E,nr;M,n;B,i;E,i;M,nz;M,ns;E,r;B,nz;B,nrt;
+嗉:B,n;
+恐:B,d;S,d;B,a;B,an;E,a;B,n;E,v;M,i;E,i;B,v;E,n;E,nr;B,nz;M,l;M,nr;
+蓓:B,n;B,nrt;M,nr;
+晔:E,nr;S,g;M,nr;
+奖:S,n;E,n;B,n;E,nz;E,v;B,vn;E,vn;B,v;M,n;E,nr;E,r;M,nz;M,l;B,l;M,nr;E,j;
+早:S,a;B,t;B,d;E,d;B,n;E,t;B,v;B,f;E,v;E,l;E,nr;M,l;E,a;M,i;M,r;B,i;M,nr;B,nt;B,j;E,n;B,l;M,d;M,nt;B,vn;B,nz;M,nz;B,a;B,nr;B,nrt;E,nz;
+士:E,n;B,n;M,nr;S,ng;E,ns;E,nr;M,ns;B,nr;M,nz;M,n;M,nrt;E,m;E,i;M,nt;E,nz;E,v;M,i;E,l;E,nrfg;B,l;B,nz;E,nrt;B,b;B,nrt;M,l;B,ns;M,q;B,i;M,nrfg;
+絮:M,nr;S,v;E,n;B,n;B,v;M,z;B,z;E,nr;E,v;
+哳:S,x;
+韵:S,n;E,n;B,n;E,nr;M,n;E,a;M,nr;M,nz;M,l;M,i;
+跹:S,x;E,v;
+潺:E,z;B,z;E,o;B,i;B,o;M,i;
+菽:S,ng;E,nr;B,ns;M,nr;B,n;
+墀:E,nr;E,n;S,g;
+庄:E,nr;B,n;B,nr;E,n;S,nr;E,ns;B,a;M,nr;B,ns;E,a;M,ns;B,nrfg;S,ng;M,n;E,nz;M,i;E,v;E,r;M,nrt;M,nt;M,nz;E,nrfg;S,ag;E,l;E,nrt;B,l;
+栋:E,m;E,nr;S,q;E,r;S,m;M,nr;E,i;B,n;M,i;B,i;B,l;
+搓:S,v;E,v;B,v;B,n;B,nz;B,i;
+莒:S,g;B,ns;B,nrt;M,nr;
+粘:B,n;S,v;B,v;M,n;B,a;B,vn;B,nz;B,z;E,b;M,nz;M,z;E,nz;
+逛:S,v;E,v;B,v;E,i;
+匝:S,q;S,vg;B,n;M,z;E,z;E,nr;E,n;
+队:E,n;B,n;S,n;E,nt;E,m;E,v;M,n;E,r;M,l;E,i;E,j;E,nz;S,m;E,nr;E,l;M,nr;B,s;E,d;E,vn;
+谣:B,n;E,n;E,v;S,ng;B,v;E,nr;M,i;B,vn;B,l;M,nr;
+伥:E,i;B,n;
+焱:S,g;E,nr;M,nr;
+邰:S,nr;B,nr;M,nr;E,nr;
+眵:S,g;E,n;
+洹:S,g;E,nr;
+挽:B,v;S,v;B,n;M,i;M,nr;M,nz;
+镉:S,n;E,n;S,ng;E,nz;
+乏:E,v;B,a;E,a;S,v;M,n;E,i;B,l;E,an;M,i;B,v;M,nz;S,a;S,vg;
+腑:E,n;S,g;E,i;M,i;E,l;
+插:S,v;B,v;B,n;E,v;B,i;M,i;B,vn;E,n;M,l;B,nz;M,n;B,l;B,d;B,ns;
+穗:S,n;E,n;B,n;E,nr;B,l;B,nz;M,nr;E,v;M,n;E,nz;E,nrt;S,j;M,t;M,ns;B,v;
+询:B,v;E,vn;E,v;S,vg;M,n;E,nr;M,nr;M,nt;E,j;M,nz;M,t;B,n;E,nrt;
+令:E,n;S,v;B,nrt;M,n;E,v;B,l;E,nr;B,n;M,nr;E,c;M,l;B,i;M,i;E,ns;E,i;B,nr;E,l;E,q;M,ns;M,b;E,nrt;M,nt;B,nrfg;E,nz;
+执:B,v;B,vn;S,v;B,n;E,v;B,a;B,d;M,n;E,a;E,nr;M,i;M,nr;B,i;B,l;M,nt;E,n;B,j;B,nz;M,l;M,ns;
+蟪:S,x;B,n;
+共:S,d;B,n;B,d;M,nt;M,ns;B,v;E,b;E,j;E,d;M,n;E,v;M,l;B,l;M,i;M,j;B,b;M,nz;M,nr;B,j;B,nz;B,vn;B,nt;B,ns;E,i;E,l;E,nr;B,i;E,n;
+直:E,d;B,ad;S,d;B,v;B,n;E,v;B,b;B,ns;E,a;M,i;B,a;E,nr;B,z;B,i;E,j;E,z;B,vn;M,nr;M,n;B,l;M,z;B,nz;M,ns;M,l;E,n;B,nt;B,d;E,i;E,ns;B,j;B,nrt;E,nz;M,j;M,nt;M,v;M,b;E,b;
+泸:B,ns;B,nrt;B,nz;
+拼:B,v;S,v;B,d;E,v;B,n;B,l;M,n;M,i;B,vn;B,i;E,nr;E,n;B,nz;M,nr;
+虿:S,g;E,nr;E,n;
+锈:M,n;B,n;E,v;S,n;E,b;E,n;S,v;B,v;B,l;M,nz;E,vn;E,nr;M,nr;
+脐:S,ng;B,n;E,n;M,n;M,i;
+宗:B,n;M,nr;E,nr;E,m;S,q;B,nr;E,n;E,nrt;E,nz;E,b;M,nrfg;S,m;M,i;E,v;E,i;B,ns;B,nz;M,ns;M,m;B,nrt;B,nt;M,n;M,nt;E,nrfg;
+砖:B,n;S,n;E,n;E,nr;M,n;E,v;B,nz;M,i;M,nr;E,nz;B,b;M,l;
+军:E,n;B,n;S,n;E,nr;E,v;E,j;E,nt;M,nt;M,nr;B,s;B,b;M,n;M,i;B,j;M,l;B,l;E,nrfg;E,vn;B,nt;E,i;B,ns;B,v;M,ns;B,i;E,l;M,b;B,vn;M,j;M,nz;E,nz;M,v;M,t;E,nrt;B,nz;
+怦:E,o;B,o;B,l;B,z;S,o;
+羯:B,n;M,nz;E,nz;
+疳:B,n;E,n;
+殷:B,nr;B,a;S,nr;B,n;E,nr;B,b;M,v;B,t;E,z;B,z;M,nr;B,ad;B,i;S,o;B,nrt;
+踺:B,n;
+壁:E,n;B,n;S,ng;E,s;E,nr;B,s;E,ns;E,i;M,i;S,q;M,n;E,v;M,nr;E,m;M,ns;E,nz;B,v;M,b;B,l;B,b;E,l;M,l;B,ns;B,nz;M,nz;B,i;
+祀:E,v;S,g;E,nr;M,n;M,nr;B,n;
+罄:S,vg;E,v;B,i;E,nr;
+哉:S,y;E,nr;E,a;E,l;E,i;M,i;E,u;M,nr;M,l;
+畈:S,q;E,nr;
+觋:S,g;
+歌:B,n;E,n;S,n;B,v;E,v;E,nr;M,l;E,m;B,nrt;B,i;M,i;M,nr;M,nt;E,i;M,n;E,nz;B,nz;S,m;M,ns;E,nrt;B,b;B,ns;E,vn;B,nr;
+藓:E,n;M,l;B,n;
+糙:E,a;S,a;B,n;M,n;M,z;E,z;E,nr;
+滥:E,v;B,v;S,ad;S,a;M,i;E,l;B,n;B,l;B,i;E,i;E,n;M,l;M,v;B,vn;
+蕨:B,n;B,l;E,n;
+髭:S,g;B,n;
+嗳:S,e;B,n;
+牲:E,v;B,n;M,n;E,n;E,i;E,l;M,t;M,nz;
+桶:S,q;E,m;E,n;E,r;S,m;B,b;E,v;M,n;B,nrt;E,nz;
+骂:S,v;E,v;B,v;E,i;B,n;M,i;M,z;B,z;E,vn;B,l;M,n;E,l;E,n;
+径:E,n;B,n;S,ng;B,d;E,b;M,i;E,nr;M,l;E,l;M,n;E,i;E,v;M,nr;M,nt;B,ns;B,nz;
+喈:E,nr;S,x;
+椋:S,x;B,n;M,nr;E,nr;
+漏:S,v;E,v;B,n;B,v;E,n;B,nz;E,i;B,l;E,vn;B,i;M,i;B,vn;M,j;M,v;B,t;M,n;E,nz;
+芒:E,n;S,ng;B,n;E,nr;M,i;M,nr;B,ns;B,t;E,i;M,nz;B,nrt;B,i;M,ns;M,n;E,l;E,ns;E,v;B,nr;E,nrt;
+初:S,f;E,t;B,d;B,f;E,d;B,t;B,n;B,v;B,b;E,nr;E,b;B,l;B,nr;M,nr;M,t;B,vn;M,i;B,i;E,nz;M,n;E,v;E,l;M,nz;E,r;E,mq;E,i;M,l;B,j;E,nrfg;B,nz;E,j;M,j;
+责:E,v;B,n;M,n;B,v;E,n;M,l;S,ng;E,l;E,vn;B,i;B,vn;M,nt;E,i;E,nr;B,j;M,j;M,nr;M,i;M,nz;B,l;E,j;
+严:B,a;B,ad;S,a;B,nr;B,v;E,a;B,n;E,n;B,an;E,d;B,ns;M,nr;B,i;E,nr;B,z;M,z;E,v;E,i;B,t;M,nz;E,l;B,d;B,l;M,i;B,nrfg;M,n;M,ns;B,j;E,nz;B,vd;M,l;B,vn;
+茧:S,ng;E,n;B,n;E,nr;M,i;M,n;E,l;M,nr;
+劲:E,a;S,n;B,n;E,v;M,d;E,n;M,nr;B,v;M,n;E,nr;M,a;B,a;E,d;E,l;M,i;E,i;M,v;B,nz;
+瘵:S,g;
+鞴:S,x;
+趸:S,vg;B,n;B,d;
+人:S,n;E,n;B,n;E,r;M,n;E,nrt;M,i;E,v;E,nr;M,ns;E,a;M,nt;M,l;B,l;E,b;B,j;B,i;E,i;B,nt;B,nz;B,d;E,vn;E,l;E,nz;M,nr;B,b;M,nz;M,m;E,nrfg;M,j;B,ns;B,v;E,rr;B,q;M,v;E,j;B,m;B,vn;M,a;B,ln;M,t;M,nrt;M,b;
+戽:S,v;
+莼:B,n;
+鹅:E,n;S,n;B,n;E,nz;B,ns;M,n;M,nz;M,ns;B,b;B,nz;B,i;M,nr;M,i;M,l;E,nr;B,l;M,nt;
+升:E,v;B,v;S,v;B,vn;E,nr;M,n;B,n;E,m;M,nr;E,l;B,l;E,q;B,nrt;B,a;E,nz;M,i;B,nz;E,vn;E,ns;E,nrt;E,nrfg;E,n;B,j;B,ns;E,i;M,nrt;M,l;M,nz;B,b;E,mq;
+益:E,n;M,n;E,d;E,v;E,nr;B,nr;M,v;E,a;S,nr;M,nr;B,n;B,ns;M,i;B,nz;E,vn;E,l;E,i;B,d;S,ng;M,l;B,nrt;B,v;S,dg;B,l;E,ns;S,vg;E,j;M,nz;M,ns;E,z;E,nz;B,i;M,nrfg;M,t;
+住:S,v;E,v;B,n;B,v;E,d;M,n;E,a;E,i;M,v;E,vn;E,l;M,l;M,i;E,nr;B,nz;E,j;M,j;B,nt;M,b;B,j;B,vn;M,nr;M,nt;
+拒:B,v;S,vg;E,v;B,l;B,ns;B,i;E,i;M,l;B,nz;M,nr;
+铞:S,x;
+浣:S,vg;B,n;M,n;M,nr;E,nr;
+捧:S,v;E,v;B,v;E,nr;M,i;B,l;B,vn;M,nr;E,vn;
+饫:S,g;
+镳:E,nr;S,g;E,i;M,nr;
+腻:E,a;S,v;E,n;B,v;M,z;E,z;B,a;M,l;B,z;B,n;
+匆:B,z;E,z;B,a;M,d;E,d;M,z;B,ad;E,i;M,i;M,nr;E,nr;
+阈:B,n;E,n;
+榍:S,x;
+伎:S,ng;B,n;E,n;E,nr;M,i;
+舐:S,vg;B,i;
+龙:S,n;B,n;E,nr;M,ns;E,n;B,nr;B,ns;E,ns;E,nz;M,nr;M,n;B,nz;M,i;M,nz;E,nrt;B,i;B,nrt;E,i;B,nrfg;M,l;E,nrfg;M,nt;B,b;B,nt;E,v;E,j;B,j;E,l;B,l;E,t;B,t;
+力:E,n;B,n;S,n;E,d;E,v;E,ad;M,n;E,a;B,v;E,nr;E,l;M,l;M,nr;E,nz;E,i;M,i;B,nz;B,i;E,b;E,nrt;M,nz;M,nt;E,vn;M,ns;E,nt;B,l;M,nrfg;B,nrt;B,nrfg;E,nrfg;M,b;E,j;M,nrt;E,ns;M,v;
+计:E,v;B,n;E,vn;B,v;S,v;E,n;M,n;M,i;M,nt;E,i;B,l;B,vn;B,nr;E,l;B,j;E,d;M,nz;E,nr;M,l;E,nz;M,d;M,v;B,i;B,b;M,nr;M,b;E,nrt;B,nz;M,nrfg;B,nrt;
+到:S,v;E,v;B,d;B,v;E,l;B,vn;M,l;B,l;M,i;E,a;E,vn;E,i;B,n;M,nr;M,n;M,nz;M,j;E,nr;
+吴:B,nr;S,nr;E,ns;B,ns;E,nr;B,n;M,nr;B,nrfg;M,nt;M,nz;B,j;B,i;M,nrt;B,nt;E,nz;B,nrt;
+丸:E,n;S,ng;S,q;B,n;E,nr;E,nz;M,nr;M,i;M,n;B,nz;
+抻:S,v;
+贺:B,nr;S,vg;E,v;B,ns;E,nr;B,v;M,nr;B,vn;B,n;B,nrfg;E,a;E,ns;M,ns;M,l;E,nrt;M,n;
+蜾:B,n;
+巅:B,n;E,n;S,ng;E,nr;
+郇:S,nr;B,nr;
+桌:B,n;B,s;E,n;S,ng;E,m;E,v;M,v;S,q;M,n;B,ns;M,nr;B,nz;S,m;E,nz;
+摔:S,v;B,v;E,n;B,vn;E,l;B,n;
+鹘:E,ns;S,x;M,i;
+坞:S,ng;E,ns;E,n;B,n;M,ns;
+毡:S,ng;B,n;E,n;E,i;M,n;
+柩:E,n;
+嫫:S,g;
+置:E,v;E,n;S,v;E,vn;B,v;B,n;M,n;M,i;M,nr;B,i;B,nz;M,l;B,vn;E,i;B,l;M,nz;M,b;E,nz;E,nrt;
+煲:S,v;E,n;B,n;E,nz;
+闵:B,nr;S,nr;B,ns;E,nr;M,nr;
+迹:E,n;B,n;S,ng;E,v;E,i;M,i;M,nr;E,nr;M,l;E,l;M,n;E,nrt;
+松:E,a;S,v;E,n;B,n;B,ns;E,nr;B,a;B,nr;E,v;B,v;M,nr;M,n;E,vn;M,ns;E,nrt;M,z;B,nrt;E,z;B,nz;E,ns;E,nz;B,z;B,nt;E,nrfg;B,j;E,l;M,b;M,nt;M,nz;M,nrt;
+氏:E,nr;S,ng;B,n;M,nr;E,n;M,m;M,ns;E,b;M,n;E,nrt;M,nz;E,nz;M,q;E,ns;M,nt;
+辎:B,n;
+易:E,n;E,vn;M,n;E,a;S,a;B,nr;M,nt;E,d;E,l;B,v;M,i;B,n;E,nr;E,i;B,a;E,nz;M,nr;M,ns;E,nrt;B,ns;M,nrt;B,nz;M,nz;M,l;E,b;M,t;E,v;B,i;B,l;B,nrfg;B,vn;B,nt;B,b;B,nrt;M,nrfg;E,ns;
+炜:E,nr;S,nr;M,nr;
+檠:S,g;
+踣:S,g;
+沤:S,v;B,vn;M,nr;
+耧:S,g;
+暨:S,c;B,nt;E,ns;B,j;B,nr;M,ns;B,ns;M,n;E,nr;M,nr;
+微:B,n;E,d;B,vn;B,a;S,d;B,d;S,a;E,a;B,v;B,b;E,nr;M,n;B,l;B,i;M,nr;E,v;B,m;E,i;B,q;B,j;E,z;M,z;B,z;E,an;E,l;E,vn;M,i;B,ns;E,b;S,ag;E,nz;B,nt;M,l;M,m;E,m;M,nz;B,nz;M,q;M,ns;E,ns;
+猱:S,g;
+冲:S,v;B,vn;B,v;B,n;E,n;E,nr;E,v;B,a;B,p;E,vn;E,i;M,z;E,z;M,nr;M,i;B,z;M,n;B,ns;E,ns;B,i;E,nrfg;M,nrfg;B,nz;M,nz;B,l;E,nz;B,an;M,v;M,ns;
+电:B,n;S,n;E,n;M,n;E,v;E,j;E,vn;M,nt;B,vn;M,nz;B,b;M,v;M,l;B,l;E,nz;E,b;B,v;E,l;B,nz;B,j;M,j;M,i;E,nt;M,b;E,nr;M,nr;B,i;B,nrt;M,ns;M,vn;B,nt;B,ns;B,t;
+钴:S,ng;E,n;M,n;B,n;B,nz;E,nz;
+肼:S,g;E,n;E,nz;
+魁:E,n;B,a;B,ns;B,n;M,i;E,v;E,nrfg;M,nr;M,nrfg;
+假:S,a;B,n;B,v;E,n;E,v;B,c;E,a;B,t;M,t;E,t;B,vn;M,i;M,n;M,l;E,i;B,b;E,l;B,l;B,j;B,i;E,vn;B,z;M,j;E,nr;E,j;M,nr;B,nz;M,nt;
+痊:B,v;
+荑:S,g;E,nr;M,nr;
+懒:S,a;B,v;B,n;B,z;B,a;E,v;E,a;E,n;E,i;M,v;M,i;E,l;M,nr;
+硗:S,x;
+牛:S,n;B,n;B,nr;E,n;M,ns;E,v;M,n;E,nr;B,ns;E,nz;B,q;B,nt;M,i;M,nr;B,i;E,ns;B,t;M,nz;M,nt;M,l;M,v;B,l;B,nrt;B,nz;E,i;E,l;B,a;E,nt;E,t;E,vn;B,nrfg;M,j;
+瑟:S,ng;E,nr;M,nr;E,z;E,nrt;M,nrt;B,z;M,n;B,v;E,n;B,nrt;E,nz;M,ns;E,i;E,ns;B,ns;
+恧:S,g;
+磬:S,ng;E,nr;E,n;M,nr;
+危:B,n;B,an;B,v;B,a;M,l;E,n;S,nr;B,i;E,v;E,a;E,i;M,i;B,nr;B,ns;S,ng;E,nr;S,j;B,nz;E,z;E,vn;S,vg;S,ag;E,l;M,nr;M,n;B,j;M,ns;B,nt;E,nrt;E,nrfg;M,j;
+狰:B,a;M,l;B,l;M,nr;
+啵:S,y;
+瓴:S,g;E,i;
+衷:E,n;E,v;E,i;M,v;E,d;M,i;B,d;B,n;B,b;E,vn;M,n;
+突:B,ad;B,vn;B,a;B,v;B,n;E,vn;S,d;B,i;B,ns;E,n;M,i;B,nz;E,v;M,n;B,d;E,nr;E,nz;M,nr;E,i;E,j;
+堂:E,n;S,q;E,nr;B,n;E,ns;E,z;M,i;B,z;E,v;E,m;B,i;E,nz;M,nr;E,j;M,l;E,l;M,n;E,i;E,nt;B,a;E,a;M,z;M,ns;S,ng;E,d;B,d;E,s;M,nt;B,nrt;S,m;E,nrt;M,nz;E,nrfg;
+分:B,v;E,n;B,vn;B,n;S,q;B,d;E,m;E,d;M,n;E,ad;E,v;S,m;E,l;M,m;B,m;M,l;E,mq;M,i;B,q;B,b;B,l;M,mq;B,a;B,i;E,a;E,q;E,nr;E,vn;B,ns;M,nt;M,nr;E,t;E,i;B,j;M,a;M,v;B,nz;E,nrt;E,b;M,nz;B,s;E,j;B,nrt;M,z;E,z;M,q;
+霈:E,nr;S,g;
+吊:S,v;B,n;B,v;E,v;M,i;E,n;B,nz;B,l;B,i;M,n;B,vn;M,nr;B,ns;M,l;E,i;B,b;
+与:S,p;E,v;B,c;M,n;B,i;B,v;B,u;B,l;M,i;M,nr;B,n;M,nt;B,d;M,l;M,nz;E,nr;B,ns;E,i;
+抑:B,v;E,v;S,vg;B,a;B,n;B,c;B,i;B,nz;B,vn;M,nr;B,l;M,n;E,vn;E,nr;M,nz;M,l;
+撕:S,v;B,v;B,l;E,nz;
+妗:S,g;M,nr;E,nr;
+邝:B,nr;S,nr;
+喟:S,g;B,v;E,vn;
+侣:E,n;M,nz;B,n;M,n;
+蚩:S,j;B,n;
+箫:S,ng;E,v;E,n;E,nr;B,n;M,nr;
+搪:B,n;B,v;S,v;E,v;
+瞳:B,n;E,v;M,n;
+榷:S,g;E,v;E,nr;
+伸:B,v;E,v;S,v;E,nr;B,i;B,n;M,nr;B,b;B,vn;E,i;M,n;E,n;M,l;E,nrfg;B,a;B,nz;M,i;
+嫁:S,v;E,v;B,v;E,n;B,n;B,i;E,i;M,l;M,n;
+采:B,v;B,vn;S,v;E,v;B,n;E,n;B,nr;M,i;E,i;M,nr;M,n;E,nr;B,nz;E,nrt;B,ns;E,j;E,a;B,nrt;M,nz;E,vn;E,l;M,l;B,j;
+诋:B,v;
+跏:S,x;B,v;
+捐:B,v;S,v;B,n;M,i;E,vn;E,n;B,l;M,n;E,v;E,i;
+给:S,p;E,v;B,v;E,vn;B,n;M,n;M,i;M,ns;M,l;B,j;B,vn;E,n;M,nr;B,nz;E,i;M,nt;E,nr;
+泥:B,n;E,n;S,n;M,n;B,t;E,v;E,nr;E,nt;M,i;M,nr;M,ns;E,i;E,nz;B,i;B,ns;E,l;B,l;B,v;S,v;M,nt;M,l;M,nz;B,a;
+赤:B,n;S,vg;B,ns;E,nr;B,z;S,ag;B,i;B,a;E,n;M,nr;B,v;E,i;B,nz;B,nr;B,b;B,nrt;M,nz;E,nrt;M,i;B,l;M,nt;M,n;M,ns;M,z;M,l;E,z;
+曩:S,g;
+巯:B,n;S,g;E,nr;
+铵:E,n;B,n;E,nz;
+能:E,v;S,v;B,n;E,n;B,v;M,n;E,j;M,nr;E,b;E,d;M,d;M,i;M,l;E,a;B,nr;E,nr;E,vn;E,nz;M,v;M,nz;E,i;B,i;M,nt;B,a;E,l;M,b;B,l;M,vn;E,ns;E,nt;B,nz;B,nrt;E,nrt;B,ns;
+晾:S,v;B,v;M,nr;E,nr;B,n;
+缃:S,g;E,nr;M,nr;
+颂:E,v;S,v;B,v;B,n;S,vg;E,nr;M,i;M,nr;E,nrfg;E,n;E,l;B,i;
+钊:E,nr;S,g;M,nr;
+帙:S,q;M,l;E,n;M,nr;
+锟:E,nr;S,g;M,nr;
+涤:E,v;B,n;S,ng;M,n;S,vg;M,nr;E,nr;E,vn;B,v;M,i;M,nz;B,nz;
+枨:S,g;
+砭:S,vg;E,v;M,i;E,ns;B,n;E,vn;
+爱:S,v;B,n;E,v;M,nr;B,a;E,a;B,nr;B,v;B,ns;E,n;E,nr;B,nz;E,b;B,nrt;B,i;M,ns;B,vn;E,l;B,nt;E,vn;E,i;B,l;M,nt;M,a;M,l;M,i;M,z;E,z;E,j;E,nrt;E,nz;M,n;M,nz;M,nrt;B,t;B,nrfg;
+傲:E,a;S,a;B,a;E,nr;B,d;B,v;B,n;E,i;B,nr;M,i;B,i;E,v;M,nr;B,l;E,l;
+琵:B,n;B,ns;M,l;
+陉:E,ns;S,g;M,ns;
+衍:B,v;B,vn;E,v;B,n;S,vg;E,nr;M,nr;M,nz;M,i;E,i;M,n;E,nrfg;B,nz;E,vn;
+祗:S,g;E,n;E,nr;
+忘:S,v;B,v;E,v;M,n;M,i;E,i;B,i;E,a;B,b;M,l;B,n;B,d;E,vn;E,l;B,l;E,nr;
+裢:E,n;S,x;
+慧:B,nr;E,nr;E,n;M,nr;S,ng;E,a;B,nrt;B,n;M,l;E,l;M,ns;M,i;B,a;B,l;B,nz;
+苦:S,a;E,an;B,n;E,v;E,a;B,v;B,a;E,d;M,i;B,d;E,n;E,i;B,i;E,ad;E,z;M,z;M,l;E,l;M,n;M,nr;B,l;E,vn;B,ns;M,v;M,ns;B,ad;E,nz;
+靳:B,nr;S,nr;M,nr;E,nr;
+呵:S,v;S,y;B,v;B,vn;M,z;E,z;M,i;B,n;E,nr;M,v;B,ns;M,nr;E,a;
+痴:S,a;B,z;B,n;B,v;E,n;M,z;B,i;E,i;B,nr;E,z;B,a;M,i;E,v;E,nr;M,n;M,l;B,vn;M,nr;E,a;S,ad;B,l;
+荻:S,n;M,nr;S,nr;E,nr;B,nr;
+异:B,n;E,n;B,a;S,vg;E,a;B,d;E,v;M,l;M,n;B,b;B,i;E,i;E,nr;B,v;M,i;M,v;E,z;M,nr;E,l;B,l;B,nz;E,nz;B,vn;E,vn;S,ag;M,b;M,nz;B,nrt;
+唆:E,v;B,v;M,n;
+澍:E,nr;M,nr;S,g;
+踌:B,v;B,i;B,l;
+斑:B,n;E,n;S,n;B,z;M,n;E,z;E,l;M,l;M,i;M,z;M,nr;E,i;M,nz;B,ns;B,i;
+舔:S,v;B,v;
+店:E,n;S,n;B,n;E,ns;E,v;M,ns;E,r;E,nz;E,nt;M,n;B,ns;M,b;M,nz;M,nr;E,nrt;
+香:B,ns;B,n;S,a;E,n;E,nr;M,nr;B,nr;E,v;B,nt;M,n;M,ns;B,a;B,nz;B,z;M,nz;E,a;M,i;B,nrt;E,i;E,nz;E,b;E,nrt;M,z;M,l;B,l;B,b;E,z;M,nt;B,i;E,ns;E,l;B,nrfg;E,nrfg;
+咛:E,v;S,x;M,l;E,l;
+功:B,n;E,a;S,n;E,n;M,n;E,v;E,nr;M,b;M,i;B,i;E,nrfg;E,i;M,v;M,l;M,nr;B,l;E,vn;B,nz;M,ns;B,vn;E,l;E,nrt;E,nz;M,nt;
+讥:B,v;S,vg;E,i;B,vn;E,nr;
+挪:B,ns;S,v;B,v;E,v;B,n;B,nt;S,j;B,nz;M,nr;M,i;M,l;
+餮:S,x;E,n;M,i;E,nr;M,nr;
+炳:E,nr;M,nr;S,g;B,ns;E,v;M,i;M,nrfg;
+露:E,v;B,v;S,v;B,n;E,n;M,i;E,nr;M,nr;E,nz;B,a;E,i;E,t;M,l;E,ns;M,nz;B,nz;B,nrt;M,ns;E,vn;E,nrt;M,n;E,l;E,a;M,v;B,ns;
+溷:S,g;B,a;
+贶:S,g;E,nr;
+抿:S,v;E,nr;B,n;
+脾:B,n;S,n;M,v;E,n;M,n;E,i;E,nr;M,l;
+籀:S,g;
+寅:S,mg;E,nr;M,nrfg;M,nr;E,m;M,l;B,t;M,m;B,i;B,n;E,t;
+雇:B,v;B,n;S,v;B,l;E,v;B,vn;M,n;
+凉:S,v;E,a;B,n;E,nr;B,a;E,z;E,v;M,nr;B,nrt;M,ns;B,ns;E,ns;E,an;B,z;E,l;M,n;B,v;B,nz;E,i;E,t;M,z;S,j;M,l;E,n;S,a;B,vn;
+扔:S,v;B,v;
+孚:E,nr;S,vg;E,nz;B,nrt;M,nr;M,nt;M,nz;M,l;B,ns;M,ns;
+淡:B,n;S,a;E,a;B,z;B,v;E,z;M,z;B,b;E,v;M,i;B,a;E,n;M,nr;E,nr;B,i;E,l;B,l;B,t;B,ns;M,l;M,ns;B,j;M,n;E,an;B,vn;
+闱:S,g;E,n;E,nr;E,v;M,nr;
+僳:E,nz;M,nz;M,ns;S,x;
+价:B,n;E,n;E,v;S,n;M,l;E,vn;M,n;E,a;M,i;E,nz;B,l;E,i;B,i;E,nr;E,l;E,d;B,a;E,b;M,nt;M,nr;M,nz;M,b;E,j;
+傈:B,nz;S,nr;M,ns;E,nr;
+二:B,m;S,m;M,m;E,m;B,n;B,nrt;B,b;M,nz;E,t;M,nr;B,ns;B,t;B,r;M,n;B,c;E,r;E,nr;B,j;E,n;M,l;M,t;M,i;E,i;B,nz;B,l;M,nt;B,nr;B,i;B,v;E,b;M,d;B,mq;E,j;M,ns;M,j;E,l;M,mq;B,nt;E,nrfg;E,nz;E,ns;
+夙:B,n;B,i;
+碘:S,n;B,n;B,nz;M,n;E,nz;M,nz;
+蘧:S,x;
+您:S,r;B,l;B,r;B,rr;M,l;E,nr;
+缭:B,v;S,v;M,i;E,nr;B,a;
+妮:E,n;E,nrt;B,n;B,nrt;E,nr;M,n;M,nr;M,nrt;E,nz;
+由:S,p;B,c;E,a;E,n;B,d;M,n;M,d;B,nr;M,i;E,v;E,d;M,nr;B,l;E,p;B,n;M,l;M,nt;E,l;M,vn;E,nr;M,v;B,i;M,b;M,ns;M,nz;E,nrfg;B,nrfg;
+钰:E,nr;S,g;M,nr;
+椹:E,nr;S,x;E,n;M,nz;
+朽:E,a;E,z;S,v;E,n;B,v;B,nr;E,i;M,l;M,n;E,v;S,vn;B,i;M,i;
+魅:B,n;E,n;M,i;E,l;B,l;
+酉:E,m;B,ns;M,m;E,ns;E,l;E,nr;B,t;
+珊:B,n;E,ns;M,nz;E,v;E,nrfg;M,nr;M,nrt;B,nrt;E,nrt;M,n;E,i;M,ns;B,i;M,i;
+槎:S,ng;E,n;E,nr;
+柒:S,m;B,m;E,nr;M,m;E,m;
+瑛:E,nr;M,nr;S,g;
+牟:B,nr;S,nr;E,ns;B,v;M,n;M,ns;B,l;E,nr;B,ns;S,vg;M,nr;B,nrfg;
+档:B,n;S,n;E,b;E,n;E,m;S,q;E,v;S,m;M,nt;M,m;M,l;E,nr;E,j;M,b;E,vn;M,v;B,nz;S,ng;E,i;
+迢:E,i;M,i;E,z;B,z;M,l;E,l;
+菪:S,x;E,n;M,n;M,i;
+彭:B,nr;S,nr;B,ns;E,nr;S,m;M,nr;B,nrt;E,nrfg;E,nz;E,nrt;B,nrfg;B,a;
+驯:B,n;B,v;S,v;E,nr;E,i;B,a;E,a;B,vn;
+卵:S,n;B,n;E,v;E,n;M,n;E,vn;B,b;M,t;M,nr;E,i;M,l;
+狴:B,n;S,x;
+曼:E,nr;M,ns;B,ns;E,nrt;S,ag;B,nr;E,ns;M,nr;M,n;E,n;B,nrt;B,n;M,nrt;E,nz;M,nz;M,nt;M,a;B,nt;B,a;B,nrfg;E,a;B,j;E,an;B,nz;M,i;B,v;
+艿:S,x;E,nr;E,n;
+市:B,n;E,n;E,v;E,ns;S,n;B,s;E,j;M,n;M,nt;B,v;E,r;M,v;M,ns;B,b;M,l;B,j;B,l;M,nr;E,b;E,i;M,nz;E,nr;M,i;B,ns;M,b;E,nrt;M,vn;E,l;B,i;B,m;M,j;B,q;B,nz;E,vn;M,m;B,nrt;B,nr;
+吆:B,v;S,v;B,n;B,l;B,vn;M,l;E,nr;
+炉:E,n;S,n;B,n;E,v;B,nz;E,nz;E,nr;M,n;B,i;M,i;E,l;B,s;M,nr;S,ng;B,ns;
+刊:E,n;B,v;B,n;E,v;S,ng;E,r;S,vg;M,n;E,nr;M,l;M,nr;E,nz;B,j;M,nz;
+撑:E,v;S,v;B,v;M,n;B,n;E,n;E,nr;M,nz;B,l;E,vn;
+投:B,vn;B,n;B,v;S,v;E,v;E,j;M,i;M,nt;B,i;B,j;M,j;B,nz;M,nz;M,n;M,ns;E,ns;M,l;E,nt;E,i;M,nr;B,l;B,a;E,vn;
+茔:E,n;S,ng;
+得:S,ud;E,v;B,v;E,d;M,d;M,v;M,n;B,a;E,a;E,n;M,l;M,nr;M,ns;M,i;B,n;E,l;E,i;E,nr;M,a;B,i;E,nrt;E,ns;B,ns;E,nz;B,l;E,an;M,nrt;E,b;B,nz;E,nrfg;B,nt;M,nz;E,vn;M,nt;B,nrt;B,vn;
+簖:S,g;
+稚:E,a;B,a;B,n;M,n;E,nrfg;E,n;M,nrfg;B,l;
+原:B,n;E,n;S,b;B,d;E,ns;B,v;B,a;M,n;E,v;B,nr;E,nr;B,l;M,ns;B,b;M,nr;B,i;E,nrt;B,vn;B,ns;M,nt;E,i;B,nz;M,i;E,vn;E,b;E,nz;M,v;M,l;B,s;E,nt;B,j;M,nz;E,j;E,l;M,b;
+搦:S,g;E,v;
+肩:B,n;S,n;B,s;E,n;B,v;E,d;E,v;M,l;B,l;E,l;M,i;M,nr;E,i;M,n;E,nr;E,nz;B,i;E,b;S,v;
+截:B,v;S,v;E,v;E,m;B,n;M,i;B,i;B,d;B,vn;M,n;M,m;E,d;E,n;M,nz;E,vn;S,q;M,nr;
+熳:S,x;E,a;E,nr;
+防:B,v;E,v;B,vn;B,n;E,n;S,v;M,n;B,j;M,nt;E,b;E,vn;B,l;E,i;B,nz;E,d;M,l;B,ns;B,i;E,nr;B,b;B,nt;E,nz;M,i;M,nr;E,j;M,j;E,l;E,nrt;
+谶:B,n;
+峁:S,g;E,nr;E,n;M,nr;
+跋:E,nr;S,ng;B,v;B,a;M,i;E,n;B,i;B,n;B,vn;E,v;
+仍:S,d;B,d;E,v;E,nr;M,nr;
+诏:S,ng;B,n;E,n;E,nr;M,nr;B,ns;M,n;
+磙:E,n;B,n;
+婚:E,v;B,n;S,ng;M,n;E,n;B,t;B,j;B,vn;E,vn;B,l;M,i;E,l;B,v;E,i;B,b;M,nz;B,nz;S,vg;
+泡:B,n;S,v;E,n;E,v;B,v;B,nz;E,nr;S,n;M,n;B,l;M,i;E,b;M,nz;M,nr;E,l;E,ns;E,vn;
+赠:E,v;B,v;S,v;B,n;E,vn;M,n;E,nr;M,nr;B,vn;
+惩:B,v;E,v;S,vg;B,vn;B,n;E,n;M,i;B,i;B,l;M,n;
+巫:B,n;S,nr;B,nr;B,ns;E,n;S,ng;E,i;M,nr;M,i;M,ns;E,nr;B,i;
+确:B,v;E,a;E,ad;B,ad;S,d;M,n;E,d;B,a;B,n;M,ad;E,i;B,ns;M,l;M,d;E,nr;B,l;B,d;M,v;B,j;
+铱:S,n;S,ng;B,n;E,nr;B,nz;
+凳:E,n;S,ng;B,n;E,nr;E,l;
+汶:B,ns;M,ns;S,g;E,nr;E,n;M,nr;E,nz;B,nrt;M,nt;
+裹:S,v;E,n;E,v;B,v;B,n;B,i;M,i;E,l;M,nr;M,n;
+麂:B,n;E,n;
+宄:S,x;E,n;
+眇:S,g;E,nr;
+钆:S,g;
+冈:E,ns;M,ns;B,ns;E,n;E,nrt;B,nz;B,nrt;E,nz;B,nr;B,n;M,n;E,nr;M,nrt;M,nt;
+洋:E,n;E,ns;B,n;M,n;S,ag;M,ns;E,nz;M,nt;E,b;M,l;M,i;E,nr;S,nr;E,z;M,z;E,i;B,v;M,nz;B,ns;B,s;M,nr;B,i;E,v;E,nrfg;S,b;E,l;B,z;B,a;B,j;M,v;E,vn;E,a;B,l;B,b;B,nz;M,b;
+鼗:S,g;E,nr;
+堙:S,g;
+锛:S,v;E,nr;M,nr;B,n;
+涠:S,g;
+憨:S,ng;B,a;B,v;E,a;M,nr;B,n;B,l;M,z;E,nr;B,z;S,ag;
+爵:E,n;E,nr;S,ng;B,n;E,v;M,nr;E,i;
+根:B,p;B,a;B,n;E,m;S,q;E,n;E,ns;E,nz;M,ns;E,nr;M,nz;S,m;E,v;E,mq;M,nr;M,i;B,v;M,d;M,l;M,n;E,nrt;B,i;M,nt;E,i;E,d;M,nrt;B,nrt;M,v;B,ns;B,b;B,vn;E,vn;
+绂:S,g;E,nr;
+均:S,d;E,a;E,j;B,a;B,n;M,n;E,nr;B,v;M,l;E,d;M,nr;M,v;B,nz;B,ad;M,i;B,ns;M,nz;B,vn;M,b;E,ns;B,nrt;
+葑:S,g;M,nr;E,nr;
+罗:B,nr;M,ns;B,ns;S,j;M,nr;E,nr;E,nrt;B,n;E,ns;M,n;E,v;B,nrt;E,n;E,nz;M,nrt;M,nz;M,i;B,v;M,t;M,nt;B,nz;B,a;B,b;E,b;B,nrfg;B,nt;B,l;M,l;M,b;B,vn;E,l;M,nrfg;
+鳖:S,n;E,n;B,n;E,i;M,n;
+姘:B,n;B,v;
+畛:S,g;B,n;M,nr;E,nr;
+楣:S,g;E,n;E,nr;M,nr;
+蓦:B,d;
+呱:B,o;E,o;M,z;B,z;B,v;E,v;B,i;M,i;M,o;E,z;
+痰:S,n;E,v;E,n;B,n;M,n;B,i;B,nz;
+蕻:E,n;M,nr;
+羁:B,v;B,n;S,ag;E,v;E,i;B,vn;E,nr;E,l;M,nr;
+崂:S,g;B,ns;
+禅:S,ng;B,n;E,n;E,nr;E,v;B,v;M,nr;M,n;M,ns;B,nz;B,ns;
+圆:B,n;S,vg;E,n;S,n;M,n;B,a;E,nr;M,nr;E,v;B,ns;E,z;B,l;B,z;M,z;B,v;E,a;S,v;M,l;M,i;B,t;B,b;S,a;E,i;B,nr;E,nz;E,l;B,nz;B,j;E,nrfg;M,nrfg;M,t;M,v;
+玉:E,nr;B,n;M,nr;S,n;B,nr;B,ns;E,n;B,nz;M,i;E,i;B,i;E,nrt;E,nz;B,nrt;B,v;M,n;M,nrfg;M,ns;B,l;E,ns;M,nrt;E,nrfg;M,l;E,j;M,nt;M,nz;
+谌:S,nr;B,nr;E,nr;M,nr;
+岗:S,n;B,n;M,n;E,ns;E,nr;E,v;E,n;E,vn;M,nr;M,ns;B,ns;B,s;M,l;E,nrt;M,j;B,l;M,nt;E,l;
+编:B,n;B,v;S,v;E,v;E,n;E,vn;M,n;E,j;B,j;M,l;B,l;B,b;B,vn;E,b;M,nz;B,nz;M,nt;E,i;M,i;
+猞:B,n;
+朦:B,a;B,z;M,z;E,z;B,n;M,nr;E,nr;
+莩:S,x;M,nr;
+纫:M,n;S,g;E,n;E,v;M,nr;M,nz;
+尬:E,a;S,x;E,i;E,an;
+锲:B,i;
+叉:S,n;M,n;E,v;S,v;E,n;E,nr;B,v;E,vn;B,n;E,b;M,nr;E,l;M,l;E,nz;
+版:E,v;S,n;B,n;M,n;E,n;M,nt;M,ns;E,vn;E,b;E,r;M,l;B,ns;E,nz;E,l;M,mq;B,nz;
+苓:E,n;E,nr;S,x;M,n;B,n;M,nr;
+彖:S,g;
+篙:S,ng;E,n;M,ns;
+奚:S,nr;B,nr;B,v;E,nr;M,nr;
+卞:B,nr;S,nr;E,nr;M,nr;
+濡:S,vg;M,i;B,v;M,nr;E,nr;
+蹠:E,n;
+揩:S,v;B,v;E,nr;
+艨:S,x;B,n;
+筮:S,g;E,n;
+畲:S,j;B,nz;M,ns;E,nr;
+诹:S,g;
+庀:S,g;
+稃:S,g;E,n;
+劈:S,v;B,d;B,v;B,i;B,n;B,o;E,n;B,l;M,o;E,v;E,i;B,nz;B,vn;
+栏:E,n;B,n;S,n;E,r;E,v;M,n;E,nr;E,d;E,ns;M,ns;M,nr;M,l;E,vn;
+窘:S,v;B,a;B,n;E,v;E,a;E,nr;M,nr;
+璜:E,nr;S,nr;M,nr;E,n;E,nrt;
+速:E,d;B,n;E,n;E,ad;E,v;M,n;S,ng;E,z;E,nz;B,v;E,a;M,i;M,nz;E,vn;E,b;E,nr;M,nr;B,b;B,vn;M,l;B,i;E,i;M,ns;E,nt;B,nz;M,v;M,nt;
+萧:B,nr;S,nr;B,a;B,z;B,ns;M,nr;E,z;E,nr;B,nrfg;B,n;M,i;B,i;
+抨:B,v;
+隰:S,g;B,ns;E,nr;
+邴:B,nr;S,nr;
+欹:S,ag;S,e;
+之:S,u;B,f;B,r;M,i;M,l;M,nr;E,c;E,nr;B,c;E,d;M,v;B,ns;E,i;M,n;M,m;M,c;B,n;E,v;M,mq;E,l;E,p;E,n;E,nrfg;M,nz;M,s;E,t;B,nr;E,m;B,i;M,p;M,ns;
+赍:S,g;
+旒:S,g;E,n;
+腕:E,n;S,ng;B,n;B,s;M,n;E,v;B,nz;E,l;M,l;E,nr;M,v;
+嫘:S,g;B,n;
+哜:S,g;
+摧:B,v;S,vg;E,i;B,vn;B,i;B,n;M,i;E,nr;
+鹫:B,ns;S,n;E,n;M,nr;E,nr;
+自:B,r;S,p;B,d;B,v;B,n;B,a;E,v;E,d;M,nrfg;B,l;E,r;B,vn;M,ns;M,i;B,p;B,i;M,nr;M,n;M,l;M,nz;B,nrt;E,nr;M,nt;B,b;M,b;B,ns;B,nz;M,d;B,an;B,nt;M,v;B,z;B,j;E,ns;E,j;E,nz;E,p;M,a;B,vd;
+兵:E,n;S,n;B,n;E,v;E,nr;M,n;E,vn;M,i;M,nr;B,i;B,v;E,nz;E,i;M,nz;B,l;M,j;M,v;M,ns;E,nt;E,j;M,nt;M,l;B,ns;B,nt;E,l;E,nrfg;B,vn;M,vn;
+虻:S,g;E,n;E,nr;
+聿:M,nrfg;M,nr;
+暑:E,v;E,n;B,t;S,ag;S,tg;M,ns;B,n;E,t;M,n;M,nr;E,l;E,nr;M,l;E,vn;M,i;
+脔:S,g;E,n;E,i;
+垛:E,n;S,v;B,n;M,n;S,q;E,nr;E,v;
+砚:S,ng;E,n;M,nr;B,n;E,nr;M,ns;
+钝:S,a;E,a;B,v;E,i;B,n;B,a;
+氢:B,n;S,n;E,n;M,n;E,v;M,nz;E,nr;M,nr;E,nz;B,nz;
+芩:S,nr;E,n;E,nr;M,nr;
+怪:E,v;S,v;S,a;B,n;E,a;E,n;E,d;E,i;B,a;B,d;M,i;B,v;B,l;E,l;E,nr;M,l;B,z;M,z;B,i;E,nz;M,d;M,v;E,z;B,ns;
+地:S,uv;B,n;E,n;B,s;M,j;E,s;M,ns;E,r;E,z;E,v;E,d;M,n;E,ns;E,i;B,ns;B,v;E,u;M,i;E,l;E,nz;B,nz;M,l;B,nr;M,nz;M,nr;E,nr;M,d;E,nrt;B,j;B,l;B,a;B,nrt;B,i;B,b;M,v;E,j;M,nt;M,s;E,vn;B,nt;M,b;E,q;E,b;M,c;M,vn;M,t;B,t;B,vn;
+玳:B,n;M,n;
+舾:B,n;
+壅:S,g;B,v;
+勉:B,v;S,vg;E,ad;E,nr;E,v;E,a;B,i;M,nr;M,z;B,z;E,i;S,dg;B,ns;
+觏:S,vg;
+材:E,n;B,n;M,n;S,n;E,v;E,nr;S,ng;M,l;M,nz;E,nz;E,i;M,i;M,nr;E,l;E,nt;M,nt;E,j;B,nz;
+站:S,v;E,n;B,v;B,n;B,s;E,m;E,ns;E,nt;E,nz;E,r;E,v;M,n;E,nr;M,b;B,l;E,l;E,j;S,m;B,ns;B,j;E,vn;M,nr;M,ns;
+镜:E,n;S,ng;B,n;E,nz;M,nr;E,nr;M,n;B,ns;E,l;E,v;M,v;B,j;M,i;B,i;M,l;M,ns;E,i;B,nrt;M,nt;
+剞:S,x;
+满:S,a;B,v;E,v;E,a;B,n;B,ns;B,d;B,nr;B,nz;E,nr;M,nr;M,i;M,l;B,i;B,l;B,z;M,z;B,b;M,ns;M,n;E,j;E,i;B,t;B,a;E,n;E,t;M,nz;E,ns;B,j;E,d;M,nt;E,z;B,nrfg;M,v;E,nrfg;
+择:E,v;S,v;M,n;B,v;E,l;M,i;E,vn;B,d;M,nr;E,nr;B,i;B,vn;B,n;B,l;E,n;B,ns;B,nz;
+荨:B,n;
+快:S,a;E,d;B,d;E,v;E,a;B,a;B,n;E,z;B,z;E,i;E,l;B,nz;M,l;M,i;M,z;B,v;B,vn;E,n;B,i;M,n;M,nt;E,nr;E,b;E,j;B,j;E,ad;M,nr;B,l;M,a;B,b;B,an;B,ns;
+右:E,m;S,f;B,n;B,f;M,m;M,i;B,s;B,b;M,n;E,nr;E,n;B,ns;M,nr;M,l;E,l;M,ns;M,j;E,v;E,b;B,nrt;E,i;M,nrfg;E,nrt;E,j;B,nz;
+找:S,v;B,v;E,v;B,n;E,a;M,l;B,nz;B,l;
+往:S,p;E,v;E,d;B,d;B,t;B,v;E,t;E,vn;B,vn;B,n;E,i;M,i;B,vd;M,v;E,nr;E,l;M,l;M,nr;B,b;
+笃:S,ag;B,v;B,z;E,nr;E,z;M,nr;B,a;M,n;E,a;
+鲂:S,g;E,nr;E,n;
+妄:B,v;S,d;M,i;E,a;B,n;E,b;E,n;B,i;B,vn;M,l;
+隆:E,nr;E,ns;B,t;B,nr;S,nr;B,v;B,a;E,o;E,t;M,nr;M,ns;B,o;B,ns;B,n;M,o;E,a;E,v;E,nz;M,n;M,z;E,nrt;B,ad;E,n;B,nz;B,vn;E,i;E,b;M,nz;M,nt;E,z;E,l;M,nrt;S,ag;M,nrfg;
+吝:B,a;B,v;E,v;E,a;S,vg;B,n;M,i;E,nr;
+推:B,v;S,v;B,n;B,vn;E,vn;B,i;E,v;M,n;E,l;M,i;E,nr;M,l;B,nz;M,nz;E,b;M,v;B,l;E,i;
+瀵:S,g;
+醴:B,ns;B,n;
+许:B,m;E,d;E,v;S,m;B,nr;B,v;B,ns;B,n;E,m;M,m;E,nr;E,n;B,nz;M,n;M,nr;B,nrfg;M,i;S,v;E,nrt;E,vn;M,r;M,nz;M,ns;
+搽:S,v;B,v;B,i;E,nr;M,nr;
+鹁:B,n;
+盆:B,n;E,n;M,ns;S,n;S,q;E,m;M,t;E,ns;B,ns;E,l;E,nr;M,i;M,nr;E,z;M,l;E,v;M,n;B,v;E,nz;
+烊:S,x;E,v;M,nr;E,nr;
+虑:E,v;E,n;S,vg;E,a;E,vn;E,i;M,i;M,l;E,nr;M,n;M,nr;E,l;M,ns;
+擒:S,v;E,v;B,v;E,nr;M,i;M,nr;B,l;E,i;B,i;M,l;B,nz;B,n;
+睛:E,n;E,i;E,d;S,ng;E,nr;M,nr;E,nz;B,n;M,l;
+飚:E,v;E,nrfg;
+嗜:S,vg;B,n;B,v;B,i;
+正:S,d;B,a;E,d;B,v;B,ad;B,d;B,n;E,nr;E,v;B,z;M,nr;E,a;B,t;B,b;M,i;E,n;E,nrfg;E,nz;M,b;M,n;B,ns;B,f;B,nz;B,vn;M,nz;B,i;E,i;B,nr;B,l;M,z;E,z;M,l;M,nrfg;E,vn;B,nrt;E,t;B,j;E,ns;B,mq;M,d;M,nt;E,b;B,nt;E,ad;E,l;E,nt;M,ns;M,t;
+胪:S,g;
+饯:B,v;E,n;
+噱:B,n;
+起:B,v;S,v;E,v;E,s;B,n;E,m;M,l;B,d;B,vn;M,i;M,v;E,i;S,m;M,nr;M,n;E,a;M,nz;E,vn;E,l;E,nr;E,ns;B,a;B,i;B,nz;B,b;M,a;E,n;E,nrfg;E,d;B,l;B,u;M,nt;M,c;B,nrt;B,t;E,b;M,nrfg;
+蝻:E,n;
+腿:S,n;E,n;B,n;E,v;M,n;E,d;E,nz;E,l;M,nr;M,l;E,nr;M,nz;M,v;B,a;E,j;
+挂:S,v;B,v;E,v;B,n;E,n;M,i;E,i;B,nz;E,vn;E,mq;M,l;E,nr;M,nz;M,n;B,l;M,m;B,b;M,v;B,m;B,i;E,nz;
+邋:B,a;B,z;M,z;
+厍:S,g;B,nr;E,nr;
+随:B,p;B,d;S,v;E,v;B,ad;B,v;B,n;B,l;B,i;B,a;M,n;M,i;B,b;M,l;B,ns;B,z;M,z;E,nr;E,ns;M,nr;E,n;B,vn;E,i;E,l;
+徕:E,v;S,x;M,nr;
+抗:B,v;S,v;E,v;B,vn;B,n;B,nz;E,vn;M,n;B,l;B,j;E,n;B,nt;E,nr;M,l;M,nr;M,i;E,i;B,b;M,nt;E,nz;M,ns;M,nz;E,b;
+萘:S,g;B,n;E,nr;M,nz;B,nz;E,nz;
+溟:S,g;E,nr;M,nr;
+造:E,v;B,v;M,n;B,n;S,v;E,vn;E,n;B,vn;E,b;M,l;B,l;E,nr;M,i;E,l;M,nt;E,ns;M,nr;B,i;E,i;M,nz;M,b;B,a;
+弪:S,g;
+戬:E,nr;S,g;M,nr;
+渴:B,v;S,a;E,v;E,n;E,i;E,a;E,l;S,v;M,i;M,nr;E,nr;B,vn;
+稼:E,n;M,n;B,nr;M,nrfg;B,n;M,l;
+珍:E,nr;B,a;B,n;B,v;S,ng;E,b;M,nr;B,ns;S,vg;M,l;E,n;B,nz;B,i;M,n;E,i;M,i;B,nrt;E,nrt;E,a;B,vn;M,b;E,nrfg;E,nz;
+剌:S,v;M,nr;E,o;
+镎:S,g;
+科:B,n;E,n;S,n;M,nt;E,nr;M,n;B,nr;M,l;E,nz;E,ns;B,ns;M,nr;M,nz;B,nrt;E,nrt;E,r;E,j;M,j;B,b;M,ns;B,j;M,nrt;B,nz;B,v;E,b;E,l;M,i;B,nt;E,v;B,l;E,i;E,nt;E,a;M,b;B,i;M,v;E,nrfg;
+翕:B,v;
+幔:E,n;B,n;
+苗:E,n;S,n;B,n;B,nr;B,nz;E,v;M,ns;E,nr;B,a;M,nr;B,ns;M,nrt;M,n;M,i;E,vn;B,nrfg;B,i;E,nz;M,nrfg;
+浞:S,v;E,nr;
+凡:S,d;B,d;E,z;B,n;E,nr;E,d;B,ns;E,a;B,nr;M,nr;E,ns;E,l;E,v;E,nrt;M,i;M,l;B,i;B,s;E,i;M,j;B,nrt;M,nrt;B,m;M,z;B,a;B,l;M,n;
+铣:S,vg;B,n;E,nr;B,v;E,nz;B,nz;M,nr;
+巩:B,v;B,nr;B,ns;E,nr;S,nr;B,n;E,nrfg;M,nr;
+惫:E,v;E,a;M,l;S,g;B,a;M,n;
+罪:S,n;B,n;E,v;E,vn;E,n;M,n;B,i;E,i;E,nz;E,l;M,a;M,l;M,i;B,l;M,nr;
+衰:B,v;S,ag;B,a;E,n;M,n;B,vn;E,v;M,l;E,l;B,n;E,i;E,nr;M,nz;M,i;B,nz;
+泳:E,vn;E,n;M,n;S,vg;B,n;E,v;E,nr;M,nr;E,l;M,nrfg;M,nt;M,nz;M,ns;
+蹴:M,i;S,g;B,n;
+狷:S,x;
+其:S,r;B,r;E,d;B,d;E,c;B,c;M,i;E,ns;B,f;M,nr;B,t;E,nr;M,ns;M,n;M,l;B,rr;M,d;B,n;B,i;B,nz;M,c;M,v;M,nz;B,l;M,nrfg;E,n;M,nt;E,b;E,nrfg;B,nr;
+磻:B,ns;
+驼:E,n;S,v;B,n;M,n;M,nz;E,nrfg;
+绿:B,n;S,a;M,n;M,nr;E,v;E,nr;B,vn;E,z;M,ns;B,nr;E,n;E,b;M,z;B,nrt;B,nz;B,z;B,l;M,i;E,a;B,i;E,i;B,v;M,l;M,nrfg;B,ns;M,nz;B,nt;E,l;M,v;B,b;E,nz;
+暄:E,v;S,g;E,nr;
+沈:B,nr;B,ns;S,j;S,nr;B,nz;M,nz;B,nt;M,nr;E,nr;E,ns;E,j;B,n;B,j;B,nrfg;M,ns;
+嘏:S,g;E,nr;
+谳:S,g;E,nr;
+鸿:M,nr;E,nr;S,nr;B,n;S,ng;S,ag;E,n;M,i;E,nrfg;B,nz;M,nz;B,nr;B,i;E,i;B,ns;E,nrt;M,n;M,l;B,nrt;E,nz;
+胀:E,j;E,l;E,v;S,a;M,n;M,j;M,l;E,n;B,v;E,i;M,nz;B,z;E,vn;M,z;E,a;
+蛄:S,x;E,n;
+橇:S,g;E,n;
+俊:M,nr;E,nr;S,nr;S,a;B,a;E,a;M,i;B,n;B,nr;E,n;B,nz;B,z;M,nrfg;B,i;B,nrt;
+寒:B,n;B,a;S,ag;E,n;S,a;E,a;B,v;E,an;E,b;B,nr;E,v;M,i;S,nr;E,nr;M,nr;M,n;B,t;E,vn;E,i;B,ns;E,t;M,s;E,l;B,l;M,l;B,i;B,nz;M,nz;
+黔:S,j;B,ns;E,j;M,nr;B,nt;E,nz;B,j;E,nr;B,n;B,nrt;B,i;M,ns;M,nz;
+蕙:E,nr;S,ng;M,nr;B,n;B,nz;
+擘:S,g;E,n;B,v;
+也:S,d;B,d;E,d;B,y;B,l;M,ns;B,ns;E,i;M,nr;M,l;E,nr;M,nt;E,nrfg;M,i;B,nt;E,l;
+酡:S,vg;
+靥:S,g;E,n;E,nr;
+婧:E,nr;S,g;M,nr;
+糨:B,n;S,a;
+捭:M,i;
+诲:E,v;S,vg;B,i;E,nr;M,i;E,l;M,nr;
+畹:B,ns;
+醋:S,n;B,n;E,n;E,i;E,v;E,nz;M,n;B,nz;M,l;B,v;M,nz;
+渊:E,nr;S,ng;B,n;M,nr;E,n;B,a;M,l;E,ns;M,ns;M,i;E,l;E,i;M,nrfg;B,nr;E,nrt;E,nrfg;B,i;
+底:S,f;E,t;E,d;E,n;E,ad;B,n;B,f;E,v;E,s;M,n;E,l;E,i;M,s;B,ns;M,ns;E,ns;E,nr;M,i;M,nrt;E,b;E,nrt;B,l;M,l;E,vn;M,nz;B,nz;E,nz;M,nr;M,vn;M,z;E,z;
+榛:B,n;B,nz;E,nrfg;
+疣:S,g;E,n;B,n;
+箧:S,g;E,i;
+芭:B,n;M,nt;B,nrt;
+袱:E,n;S,g;M,n;
+椰:B,n;S,ng;M,n;M,nz;E,n;E,nr;M,nr;B,ns;
+钹:S,n;E,n;E,nr;
+甸:E,ns;E,n;M,z;E,z;M,n;B,n;M,ns;E,nrfg;M,nt;E,nrt;B,ns;M,nz;
+妻:B,n;E,n;S,ng;M,n;E,nr;E,r;E,v;M,i;B,i;B,l;E,i;M,l;E,l;B,nz;E,nrt;
+笼:E,n;B,v;E,v;S,v;B,n;S,n;E,vn;B,a;M,n;B,i;E,nr;S,ng;B,ad;M,nr;E,nz;B,l;
+泉:E,n;S,n;E,nr;E,nz;B,ns;B,n;E,ns;M,ns;M,n;S,ng;M,nr;M,s;M,i;B,v;E,nrt;M,nt;M,nz;E,i;E,l;
+蹊:B,a;M,l;E,a;M,i;B,n;
+狍:B,n;
+绕:E,v;S,v;B,v;B,n;E,nr;E,n;E,i;M,nr;B,ns;M,n;B,vn;M,i;M,nz;E,l;M,l;B,l;B,a;
+晚:B,t;S,tg;E,t;B,n;E,d;E,l;E,n;E,r;B,v;M,j;M,i;E,nz;E,nr;M,nr;M,n;M,t;M,nz;E,i;E,nrfg;M,l;B,j;
+迟:S,a;B,a;B,d;E,v;E,d;B,v;E,nr;E,l;M,nr;M,z;B,z;B,nr;M,l;E,i;B,n;B,i;B,t;E,vn;M,n;M,i;B,nrfg;
+汞:S,n;B,n;E,n;E,nz;M,q;E,nr;
+牢:S,a;B,a;E,d;B,d;B,n;E,v;E,n;B,v;M,v;M,ns;E,nr;E,i;M,nr;M,n;E,a;M,i;B,i;B,ad;S,ng;
+荬:S,x;M,n;
+柯:B,nr;B,nz;E,nr;S,n;M,nr;E,n;B,nrt;M,i;M,nz;E,nz;M,ns;B,nrfg;M,n;S,nr;B,nt;E,nrt;
+淳:E,nr;S,ag;B,a;E,nrt;B,nr;B,nz;B,ns;M,nr;B,nrt;M,ns;E,nz;
+轴:S,n;E,n;B,n;M,n;M,l;E,nz;M,nz;B,nz;E,nr;S,q;E,v;M,v;E,d;E,mq;M,ns;E,i;
+偶:B,d;B,a;E,n;B,n;S,d;S,n;E,v;E,i;B,ad;M,n;B,b;M,nr;B,v;E,nr;B,i;E,l;E,j;M,nz;M,l;E,nz;B,nz;B,vn;
+移:E,v;B,vn;S,v;B,v;B,n;E,vn;E,n;E,i;M,i;M,nr;E,nr;B,i;B,b;M,nt;M,n;M,l;M,nz;B,nz;E,l;
+老:B,n;S,a;B,nr;E,a;E,n;M,nr;M,n;B,a;B,ns;E,vn;E,nr;B,t;E,v;M,l;M,i;B,b;E,r;B,v;B,i;B,d;B,l;B,r;M,v;E,i;B,z;M,z;B,j;B,nrfg;E,j;B,nrt;M,j;B,nz;M,ns;M,d;E,l;B,vn;E,ns;M,nt;B,nt;M,nz;
+蘅:S,x;E,nr;M,nr;B,nr;
+构:E,n;B,v;B,n;M,n;S,vg;E,v;B,l;B,vn;S,ng;E,l;E,nr;E,nt;M,nr;M,l;E,vn;E,nrt;M,vn;M,nz;
+消:B,n;B,vn;B,v;E,v;S,v;B,a;M,n;B,l;B,b;M,i;E,l;M,l;B,j;B,nz;M,nt;M,nr;E,nr;E,n;
+儋:B,ns;S,g;E,nr;
+羔:B,n;E,n;S,ng;E,v;M,n;E,nr;
+肖:B,nr;B,n;S,nr;E,b;M,nr;E,nr;E,i;E,n;E,l;M,i;S,vg;M,ns;B,ns;B,nrt;B,nrfg;E,ns;
+冠:B,n;S,v;E,n;M,nr;E,nr;B,v;B,l;M,i;B,i;E,v;M,n;B,nz;E,i;E,b;E,j;M,l;B,j;M,nz;E,nz;M,nrfg;B,ns;S,j;E,l;M,ns;B,b;B,vn;
+垤:S,g;M,nr;
+颦:S,g;M,l;E,i;E,v;
+撮:S,v;S,q;B,v;E,m;B,n;B,vn;M,m;M,nr;
+贳:S,g;
+吹:S,v;B,v;E,v;M,i;B,n;B,vn;B,i;M,l;M,n;E,nr;M,nr;B,l;E,i;B,nz;
+精:B,n;B,a;S,a;B,v;E,n;B,ad;B,i;M,i;E,v;M,nr;M,n;B,ns;E,nr;B,nz;E,nz;B,b;B,l;E,l;E,i;M,nt;M,nz;B,z;E,vn;B,nrt;B,vn;M,b;M,j;M,z;B,nt;B,an;
+臀:B,n;S,ng;E,nr;
+歇:S,v;B,v;E,v;M,n;E,n;M,ns;M,nr;B,n;E,nr;B,ns;M,b;M,nt;M,nrt;M,v;
+今:B,t;S,tg;E,t;E,d;M,l;E,n;B,nr;B,n;M,i;E,nr;E,l;B,i;M,nr;E,i;E,v;M,n;B,nrt;E,j;E,nrfg;
+哎:S,e;B,e;B,y;
+嫒:S,x;E,n;E,nr;
+葙:S,x;
+佟:B,nr;S,nr;E,nr;
+燠:B,a;S,ag;E,nr;
+扭:B,v;S,v;B,n;E,a;B,l;M,z;E,z;E,v;B,a;B,z;B,i;M,i;M,l;B,nz;
+导:E,n;B,v;B,n;M,n;E,v;E,vn;S,v;E,b;E,j;E,nr;B,vn;S,j;M,l;E,i;M,nr;E,l;M,nt;M,b;M,nz;B,b;
+侉:B,n;
+再:S,d;B,d;E,d;B,v;B,c;M,nr;B,i;M,i;B,n;B,l;E,nr;B,nrt;E,i;M,l;M,n;B,vn;M,nz;B,j;
+钏:M,nr;S,nr;E,nr;
+麓:E,f;E,n;S,ng;E,nr;M,nr;M,nt;E,s;E,ns;
+蘘:B,n;
+沟:S,n;B,v;E,ns;E,n;B,n;M,ns;B,s;E,nr;B,nrt;M,nr;E,v;M,i;M,n;M,nz;B,ns;E,nrt;M,v;
+伞:S,n;B,n;E,n;E,v;M,l;E,nr;B,b;B,v;M,n;E,nz;M,nr;
+碧:S,ng;M,nr;B,n;B,nr;B,z;M,i;E,nr;E,n;S,ag;B,ns;E,a;B,l;M,l;B,nz;E,ns;E,z;
+鸨:B,n;E,n;
+亳:S,x;B,ns;E,nr;
+趵:B,n;S,g;
+水:B,n;E,n;S,n;M,n;E,v;B,s;E,ns;E,nr;B,b;B,nr;E,vn;M,nr;M,ns;B,l;M,i;B,i;B,v;M,l;E,i;E,b;B,nz;B,ns;M,nz;M,nt;E,nz;E,nrt;B,nrt;E,l;M,t;E,j;B,z;B,j;B,vn;B,nt;B,a;M,v;M,b;M,j;
+瘸:S,v;B,n;
+砼:S,n;E,nz;
+岿:B,i;B,d;
+旅:B,vn;B,n;S,n;B,v;E,n;E,j;B,ns;M,nt;B,nz;M,nz;E,nr;B,j;M,n;B,nt;E,v;E,nz;E,nt;M,nr;
+濉:S,g;B,ns;E,nr;
+么:E,r;M,r;S,y;S,nr;E,d;E,l;E,v;E,c;M,l;E,nr;B,nr;M,nr;
+赊:S,v;B,v;B,n;
+偌:B,b;S,r;E,nr;
+篑:E,i;S,g;
+胗:S,g;E,nr;
+潞:S,g;B,nz;B,ns;M,nr;E,nr;
+嗥:S,g;E,n;B,v;M,nr;
+飧:S,g;
+烷:E,n;B,n;S,n;E,nz;E,nr;M,nr;M,n;M,nz;B,nz;
+顼:E,n;E,nr;S,g;M,nr;
+茁:B,a;B,l;B,ad;
+技:B,n;E,n;M,n;E,nz;S,ng;M,nt;B,l;B,j;S,j;M,b;E,j;E,nt;M,ns;M,i;E,i;M,j;M,l;M,nz;M,nr;B,v;E,nr;E,l;E,v;M,v;B,b;
+撄:S,g;M,nr;
+吏:E,n;B,n;S,ng;E,nr;E,i;M,nr;B,ns;E,nz;
+辞:B,v;S,v;E,v;E,n;B,n;E,i;M,i;E,nr;M,n;M,l;E,vn;E,nz;E,vd;E,l;B,l;M,nr;M,nt;B,i;
+猡:S,x;
+加:B,v;E,v;E,d;S,v;B,vn;M,ns;B,ns;B,n;M,n;B,nr;E,ns;B,c;M,nr;E,nr;B,nrt;M,nt;M,i;E,vn;E,nz;B,d;M,v;B,q;E,nrt;B,nt;E,n;M,l;B,nz;M,nz;B,b;B,l;E,i;E,l;M,nrt;B,m;B,i;M,c;M,m;M,j;B,j;E,vd;E,j;
+醢:S,g;
+甥:E,n;M,n;B,n;
+咤:M,i;E,v;S,x;
+缩:E,v;B,v;S,v;E,vn;B,n;M,n;E,j;E,l;B,vn;M,i;M,l;B,i;M,v;E,nr;M,b;E,nz;M,nz;E,n;
+舫:E,n;S,g;E,nr;M,nr;
+圹:S,ng;E,n;
+晃:S,v;E,v;M,z;B,v;E,z;E,nr;M,i;M,nr;B,z;B,a;E,a;E,nz;B,n;M,n;B,d;
+蓄:E,n;B,v;B,n;S,v;M,n;E,a;B,d;E,v;B,l;E,i;M,i;B,vn;E,nr;M,nr;M,nt;
+城:B,n;S,n;E,ns;E,n;B,s;B,ns;E,nr;E,v;M,ns;B,v;B,j;M,n;M,j;E,nrt;B,b;M,nr;B,f;B,nz;E,r;M,nrt;E,s;M,i;E,i;M,nt;E,nz;M,nz;B,nt;B,l;E,l;E,vn;E,nrfg;B,i;B,nrt;E,j;M,l;M,nrfg;
+姒:S,g;E,nr;
+鳔:S,n;E,n;B,n;
+蝙:B,n;M,nr;
+狠:S,d;B,d;E,d;M,z;E,z;B,a;E,a;B,v;B,an;E,v;M,i;M,l;M,d;B,ad;B,z;E,i;S,a;
+镥:S,g;
+瓤:S,ng;B,n;E,n;M,n;
+绨:S,g;
+蟮:S,x;
+睹:E,v;E,i;S,v;E,l;B,i;S,vg;M,l;M,i;M,n;M,nr;
+闺:B,n;M,i;E,n;M,n;
+螃:B,n;
+怂:S,vg;B,v;E,nr;
+争:E,n;E,vn;B,v;E,nz;S,v;B,vn;M,n;B,n;E,v;E,l;E,nr;B,i;M,nr;B,d;M,l;E,i;M,i;B,a;B,l;B,z;M,ns;M,v;B,nt;E,j;
+傍:B,t;S,v;M,i;E,v;E,nr;S,vn;B,i;
+砒:B,n;
+蜘:B,n;B,nz;M,n;
+殛:S,g;
+涟:B,ns;B,n;E,z;B,z;M,z;E,n;
+丞:B,n;M,n;M,nr;E,n;E,nrfg;
+锤:S,ng;E,n;E,nr;M,n;B,n;E,m;B,v;M,i;S,q;M,l;S,m;M,nz;M,nrt;E,nz;
+禧:E,nrt;M,nr;E,nr;S,g;E,nz;E,b;E,l;E,n;
+肭:S,x;
+冷:S,a;B,n;B,v;B,a;E,a;B,nr;B,vn;E,z;B,z;E,nr;B,d;E,ns;M,l;E,v;M,z;E,n;E,vn;M,n;B,an;B,i;B,ns;M,nr;E,b;M,v;E,i;B,t;M,nz;M,i;B,nz;B,j;B,l;E,j;B,nrt;B,b;M,ns;M,d;
+隹:S,g;E,nr;M,nr;
+眸:B,n;E,n;E,v;M,i;
+礼:B,n;S,n;E,n;E,v;E,nr;M,nr;E,nz;B,an;B,v;E,a;M,n;M,i;E,i;B,i;M,l;B,t;E,vn;E,b;B,ns;E,l;M,v;E,nrt;M,t;E,ns;B,nz;E,ad;
+聂:B,nr;M,ns;S,nr;B,nrfg;M,nrt;B,ns;M,nr;E,nr;
+擅:S,vg;B,v;B,d;E,v;B,i;
+子:E,n;S,ng;E,nr;B,n;M,n;M,nr;E,m;B,nr;E,l;E,v;M,l;E,nz;E,ns;E,r;M,i;M,ns;E,i;E,q;M,m;M,nz;M,v;B,ns;E,t;M,nt;E,nrt;E,nt;B,t;B,l;E,d;M,b;B,i;B,nrt;M,vn;M,nrfg;M,j;E,a;M,nrt;B,nz;B,nrfg;E,nrfg;
+糕:E,n;E,a;S,ng;B,n;E,nz;B,nz;
+诛:B,v;M,i;E,n;E,i;E,v;B,i;E,l;
+跟:S,p;B,v;S,v;B,f;E,n;B,n;E,v;M,d;M,n;M,v;M,l;M,nr;B,nz;B,vn;E,nr;B,d;
+哥:E,n;B,n;S,n;B,ns;E,ns;E,nr;M,ns;M,nr;M,nt;M,n;B,nt;B,nr;B,nz;B,b;E,nz;M,nrt;B,nrt;M,i;S,j;M,nz;
+旯:E,n;S,x;E,nr;
+赴:S,v;E,v;B,v;E,i;M,i;B,i;M,nr;M,l;E,nr;
+饼:E,n;S,n;B,n;E,v;M,n;E,nr;M,i;M,nz;B,nz;E,nz;
+掀:B,v;S,v;B,i;
+踉:B,v;B,z;M,z;
+澈:E,a;S,g;E,z;M,l;E,nr;M,nr;
+逍:B,a;B,i;B,n;B,ad;B,ns;M,nr;
+唏:B,v;
+箐:S,g;E,nr;
+弓:S,v;B,n;B,nr;S,n;E,n;E,nr;E,nz;E,v;M,i;E,i;M,nr;M,n;B,v;E,l;E,b;E,ns;B,ns;
+昙:B,i;B,n;
+栝:B,n;S,x;
+躞:E,v;
+邢:B,nr;S,nr;B,ns;E,nr;M,nr;B,nz;
+琥:B,n;
+徨:E,v;S,x;
+茫:E,z;B,a;B,z;S,ag;E,a;M,z;B,l;B,ad;E,l;B,v;E,i;M,i;M,l;E,nr;B,i;E,an;
+暮:S,tg;B,n;B,t;M,i;S,ag;E,n;B,l;M,nr;E,t;E,i;E,nr;B,i;M,n;
+状:B,n;E,n;S,ng;M,n;M,l;E,nz;E,v;E,b;E,nr;E,i;B,v;M,nr;E,l;M,nz;E,vn;B,nz;B,nt;
+嘹:B,a;
+鬻:S,vg;M,i;E,nz;
+璺:S,n;
+纾:S,g;E,nr;B,v;M,i;M,nr;
+菀:S,x;E,n;E,nr;M,nr;
+权:E,n;B,n;S,n;E,v;M,n;B,nr;E,nr;M,l;E,j;B,v;M,nr;E,nrfg;M,i;E,l;B,d;E,vn;M,nz;B,i;M,nt;E,nz;E,ln;E,ns;M,ns;B,j;E,d;B,nz;B,l;E,i;M,j;E,nrt;B,t;B,a;
+迈:B,v;S,v;B,nrt;E,a;M,nr;E,nr;E,z;M,nrt;B,ns;E,ns;M,ns;B,nz;E,nrfg;E,n;E,nz;M,l;
+里:S,f;E,r;E,s;E,m;E,q;E,n;B,f;M,ns;E,ns;M,nr;E,nrt;B,n;M,nrt;E,t;M,n;E,nr;B,ns;B,nrt;E,d;B,nr;M,i;E,f;E,i;M,z;M,l;E,l;S,m;M,nz;B,i;M,nt;B,nz;E,nz;E,nrfg;M,o;B,q;B,b;B,l;M,m;B,m;B,nt;B,d;M,q;
+畏:S,vg;B,v;E,v;M,i;B,a;E,i;E,nr;B,i;E,l;M,v;E,vn;E,n;M,nr;B,n;E,b;
+柘:S,g;B,ns;M,nr;M,ns;E,nr;
+珠:E,n;S,ng;B,ns;B,n;E,nr;M,n;B,nz;S,j;B,j;E,nz;M,nr;M,ns;M,nz;E,i;M,nt;B,i;E,nt;E,ns;M,i;M,b;E,l;M,l;E,j;E,nrt;B,nt;E,nrfg;
+痤:B,n;
+鹩:S,x;B,n;E,n;E,nr;
+恭:B,a;S,ag;B,v;E,nr;M,i;M,z;B,z;M,nr;E,a;B,n;E,i;B,ns;M,nz;E,v;B,l;B,i;M,l;B,vn;E,nrfg;
+蛮:S,d;E,a;B,n;E,n;E,nr;B,a;S,a;M,n;M,i;B,l;B,v;B,i;M,l;E,an;
+橱:B,n;E,n;S,ng;
+埸:S,g;
+铺:S,v;E,n;B,v;B,n;B,i;B,ns;E,ns;B,vn;B,a;E,v;E,nz;M,l;M,n;M,ns;B,nz;M,i;M,nz;
+黾:S,x;E,nr;B,v;
+肃:E,ns;E,a;S,nr;B,a;M,ns;B,v;E,nr;E,ad;M,nr;E,v;B,vn;B,i;M,n;S,vg;B,n;B,ns;M,nt;B,ad;B,nrt;M,nrt;B,z;
+躇:E,v;M,i;M,l;S,x;
+钋:S,ng;
+颓:B,a;B,n;S,vg;B,z;E,v;E,nr;M,l;M,i;B,l;
+缒:S,v;
+宕:S,g;E,v;M,l;E,l;B,nrt;M,nr;
+暗:B,d;S,v;B,v;B,n;E,a;E,d;E,n;B,a;S,a;E,v;E,z;M,i;B,vn;B,b;B,i;M,nr;E,i;E,l;M,l;M,n;S,ad;B,s;B,z;E,nr;
+耘:E,v;S,vg;E,nr;M,n;M,nr;B,n;E,nrfg;E,n;
+沛:E,a;S,ag;E,nr;B,ns;M,nr;M,i;E,l;B,nr;E,v;B,nrt;E,nrfg;
+级:E,n;E,b;S,q;E,a;E,vn;E,v;E,r;B,n;E,m;M,n;S,m;E,l;M,l;M,nt;E,d;E,j;E,nr;M,i;M,v;M,nz;E,mq;M,vn;M,b;
+崦:S,x;B,n;
+螭:S,g;E,n;
+趱:S,g;E,nr;
+氰:M,nz;B,n;M,n;B,nz;B,v;M,l;E,nz;
+讵:S,d;
+嚷:S,v;E,v;B,v;M,v;M,z;E,z;E,vn;
+旁:B,f;S,f;E,f;E,s;B,r;B,v;B,n;M,i;B,ns;B,i;M,l;E,nr;E,n;M,n;M,ns;E,j;B,l;B,vn;
+赆:S,g;
+矍:B,a;
+噌:S,o;S,x;
+酎:S,g;
+屐:E,n;S,g;
+敖:B,nr;S,nr;E,nr;B,n;M,nr;M,nt;B,ns;S,vg;B,nz;
+保:B,v;B,n;S,v;E,j;E,v;E,vn;M,n;E,nr;B,vn;B,a;B,ns;M,nr;B,nr;B,nz;B,nrt;M,l;E,n;M,nt;E,nz;M,ns;B,d;B,j;B,l;B,nrfg;M,j;M,i;B,b;E,nrt;B,nt;E,ns;B,i;E,d;M,nz;E,l;
+楞:M,ns;E,n;B,n;M,n;E,ns;E,v;M,z;E,z;
+嗡:E,o;B,o;S,o;
+睢:S,nr;B,ns;E,nr;E,v;S,x;
+句:E,m;S,q;E,n;B,n;M,c;E,q;B,q;M,ns;E,i;S,m;M,i;B,ns;E,v;M,m;E,l;B,l;E,d;M,l;M,n;
+黧:B,z;
+虬:B,n;
+拯:B,v;E,nr;S,vg;M,nr;
+啶:E,n;S,x;M,n;E,nz;M,nz;
+系:E,n;B,n;S,v;E,v;M,m;B,q;M,l;E,b;E,l;M,n;B,m;M,b;E,nr;B,v;B,l;E,nz;E,nt;M,nr;B,nz;E,r;B,s;M,nz;M,nt;M,i;B,b;M,vn;B,vn;
+卺:E,v;S,g;
+竿:S,ng;E,n;M,i;B,n;M,n;E,i;M,nr;M,l;E,v;M,nz;E,nr;
+茅:B,n;B,nr;S,nr;E,n;E,i;B,ns;E,nr;B,nz;M,n;M,i;M,ns;E,ns;M,nr;B,i;M,nz;M,nrt;B,nrfg;
+抄:S,v;B,v;E,v;B,n;M,n;E,n;E,b;B,l;E,nr;B,vn;E,vn;
+万:B,m;S,m;E,m;M,m;B,n;B,nz;B,nr;M,i;B,b;B,ns;B,t;B,i;B,d;M,nr;E,nr;M,l;E,i;E,nrt;B,l;M,n;B,mq;M,nz;B,nrt;M,ns;B,q;M,mq;B,a;B,nt;B,j;B,nrfg;M,nrt;B,v;E,l;E,ns;M,nrfg;
+霍:B,nr;E,nr;S,nr;S,j;B,ns;E,v;B,d;M,nr;B,n;B,nrt;B,nt;M,i;M,ns;E,nrt;E,i;M,nrt;E,ns;B,nrfg;M,n;B,nz;
+猥:B,v;B,an;E,a;
+墨:B,n;B,ns;E,n;S,n;B,nr;E,v;M,nr;E,nr;M,n;B,nrt;E,ns;M,l;M,i;M,ns;B,b;B,z;B,i;E,i;E,b;B,nt;
+玺:E,nr;S,ng;E,n;B,n;M,nr;E,nrfg;
+禾:S,ng;B,n;E,n;E,nr;B,nz;M,nr;E,nz;M,l;E,ns;B,b;
+恃:S,vg;E,v;M,i;B,i;E,nr;E,i;
+苄:S,x;E,nz;E,nr;M,nz;B,nz;M,n;
+雌:S,b;B,n;B,l;B,b;M,l;M,i;B,nz;M,v;M,n;B,v;M,nz;E,nr;
+鳐:S,g;E,nr;
+忒:S,d;M,nr;E,nr;E,z;M,z;
+腙:S,g;
+惘:E,a;B,z;B,i;
+镡:S,nr;
+瓠:S,g;B,n;E,nr;
+饩:S,g;
+磨:E,v;S,v;B,v;B,n;M,n;E,a;E,n;E,vn;B,vn;M,i;B,nz;B,z;M,z;M,l;E,i;M,nz;B,i;M,nr;E,l;B,b;B,l;M,ns;E,nz;
+杭:B,nr;B,ns;S,j;M,nz;B,n;E,nr;E,ns;M,ns;M,nr;B,nrfg;B,nt;B,nz;E,nrt;B,nrt;
+闶:S,x;
+昂:B,a;S,v;E,nr;E,a;E,ns;B,v;E,i;M,nr;B,nr;M,z;E,z;E,nrt;B,nrt;E,n;S,vg;M,i;E,nz;B,l;M,nz;B,i;M,nrt;B,z;B,ns;M,ns;B,nt;E,nrfg;
+辇:S,g;E,n;M,nz;E,nr;
+氆:B,n;
+樊:B,nr;B,ns;E,ns;S,nr;M,ns;B,n;E,nr;M,nr;
+鎏:S,g;B,b;E,nr;M,nr;
+岑:B,nr;E,nr;S,nr;M,nr;B,nrfg;B,a;B,ns;
+馓:S,ng;B,n;E,n;
+林:E,n;B,nr;E,nr;B,n;S,ng;E,ns;M,nr;E,nz;M,ns;M,n;M,nz;E,v;B,s;M,nt;E,nrt;B,v;B,ns;B,nrfg;E,j;M,j;E,l;E,nrfg;B,nrt;E,i;B,nz;M,nrt;B,f;M,l;B,j;M,i;E,nt;B,l;B,nt;M,v;M,b;M,nrfg;
+脘:S,g;E,n;
+涛:E,nr;E,n;S,nr;M,i;M,l;B,n;M,nr;S,ng;E,nrfg;E,nz;
+羧:B,n;S,x;M,n;
+本:E,n;B,r;E,a;S,r;E,ns;M,n;B,n;B,t;B,d;E,l;M,d;M,ns;E,d;E,m;M,nt;M,l;M,nr;E,b;E,v;E,nr;M,i;E,r;B,nz;B,p;M,vn;B,nr;B,ns;S,m;B,i;B,v;B,nrt;E,nrt;M,nz;E,i;B,j;M,nrfg;B,l;M,b;B,b;E,nrfg;E,vn;M,nrt;B,z;M,z;E,nz;E,mq;B,a;
+邹:B,nr;S,nr;B,ns;B,nrfg;E,nr;M,nr;S,nt;
+麽:S,x;
+宿:B,n;E,v;S,v;B,nr;E,n;B,ns;S,q;B,v;E,nr;E,l;M,n;M,nr;E,i;M,ns;E,ns;E,vn;M,i;
+担:B,v;E,v;B,vn;E,n;S,v;B,n;E,m;S,q;M,n;M,l;B,i;E,nr;E,l;S,m;M,i;E,q;
+豆:E,n;B,n;S,n;M,n;E,nr;M,nz;M,nr;B,nr;M,l;M,i;E,nz;E,i;M,v;E,ns;B,i;B,ns;E,v;B,b;B,nz;M,nt;E,l;
+棉:B,n;S,ng;E,n;B,nz;B,b;M,n;E,ns;B,ns;E,nr;E,j;E,v;M,nr;E,nz;M,ns;M,nz;E,nt;M,nt;
+盍:S,g;
+坌:S,g;
+孔:B,nr;E,n;S,n;B,n;E,v;E,nr;S,nr;M,nr;B,nrfg;E,b;M,n;B,ns;M,i;E,i;B,l;E,vn;E,l;E,nrt;B,nrt;E,nz;M,ns;B,b;B,i;M,nrt;M,nz;
+跛:B,n;B,v;
+仝:E,nr;M,nr;S,nr;B,nr;
+诟:B,n;B,v;
+走:S,v;B,v;B,n;E,v;M,i;B,l;M,n;B,vn;B,i;M,l;E,l;E,vn;E,i;M,v;B,a;E,n;E,nr;M,ns;E,a;M,b;E,j;E,t;B,b;M,nr;
+呶:S,g;
+酸:E,n;M,n;S,n;B,n;M,nz;E,nz;E,a;B,a;B,z;E,v;B,nz;E,an;M,vn;B,v;M,z;B,i;S,a;E,l;M,l;M,i;B,an;E,vn;B,b;
+塾:E,n;B,n;
+萁:S,g;E,nr;E,n;
+舅:E,n;B,n;S,n;M,n;E,nr;S,ng;E,i;
+榈:M,n;E,n;S,x;M,ns;E,nz;M,nz;
+阍:S,ng;
+瞌:B,v;M,v;B,n;
+匏:S,x;M,nr;
+箔:E,n;B,n;E,j;M,n;
+怙:S,g;B,i;
+渝:S,j;E,nr;B,nt;B,ns;M,nz;E,i;E,l;E,j;M,nr;B,nrt;
+鲦:S,x;
+砩:S,g;
+妨:E,v;B,v;E,d;E,r;B,nz;
+蔫:S,v;B,z;E,z;B,l;E,v;M,n;M,z;
+茯:B,n;M,n;
+溲:S,g;
+帽:E,n;B,n;S,n;E,v;M,n;S,ng;M,l;E,nz;M,nr;M,v;M,ns;
+碾:S,v;B,n;B,v;B,vn;B,ns;M,n;E,nr;M,nz;
+潇:B,a;B,ns;E,nr;M,nr;B,z;E,z;S,j;M,z;B,nt;B,i;
+览:E,v;M,n;E,vn;S,v;E,n;E,nr;M,l;M,i;S,vg;M,ns;M,nr;B,v;M,nz;
+畋:E,nr;S,g;B,v;
+祓:S,g;
+廒:S,g;
+银:B,n;M,nt;S,ng;B,nr;E,n;E,nr;E,nz;B,ns;M,n;M,nr;E,j;M,j;B,nz;M,i;B,b;M,b;B,j;E,b;M,ns;M,nz;E,vn;B,a;B,l;B,nrt;E,v;B,nt;E,l;M,l;
+凸:B,v;S,ag;B,n;S,vg;E,n;M,l;M,nz;B,l;B,a;B,vn;M,nr;M,n;E,nr;M,i;
+漆:E,n;S,n;B,z;B,n;B,nr;S,v;M,z;E,z;E,nz;B,i;E,i;E,v;M,n;M,i;M,nz;E,nrt;
+隋:B,t;S,nr;B,nr;E,nr;S,tg;B,nrt;
+猎:B,n;E,v;E,n;S,ng;B,v;M,n;S,vg;E,nr;E,vn;M,nr;B,nt;B,vn;M,i;E,l;M,l;
+骓:S,g;
+谜:S,n;B,n;E,n;E,v;E,nr;M,v;
+唢:B,n;
+弦:S,n;E,n;M,n;B,n;E,nr;E,v;M,i;B,nr;B,i;E,i;M,nr;
+太:B,n;S,d;B,ns;M,nr;E,n;M,n;B,nr;E,nr;B,j;B,nrt;B,nz;B,a;E,nz;M,nz;M,ns;B,s;M,j;M,nt;B,l;M,nrt;M,i;M,v;E,ns;E,nrfg;B,nt;B,i;B,d;E,j;B,z;M,z;M,l;B,v;
+搬:S,v;B,v;E,v;B,vn;B,n;M,i;B,i;B,l;E,nr;
+辱:E,v;E,n;S,ng;B,v;M,i;S,vg;M,n;E,i;E,vn;E,nr;E,l;B,vn;M,nz;
+爸:E,n;B,n;S,n;E,nr;M,nr;
+柁:S,g;
+痍:M,i;E,n;E,i;S,g;
+秕:E,n;B,n;
+塔:S,j;E,n;B,ns;M,nr;E,nr;B,nr;M,ns;B,nrt;E,nrt;B,n;B,nz;E,ns;E,nz;M,nz;M,nrt;M,n;B,b;M,b;B,nt;M,nt;E,i;E,nt;M,l;
+杖:E,n;S,ng;M,nr;E,nr;E,v;E,i;M,ns;B,l;
+裟:E,n;S,x;
+葬:E,v;S,vg;E,n;M,n;B,n;B,v;M,i;B,i;E,vn;M,ns;
+惯:E,n;B,n;S,v;M,v;B,v;M,n;E,v;B,d;E,i;M,i;B,vn;M,l;
+蹰:E,v;S,x;
+瓷:E,n;B,n;S,ng;M,n;E,nz;E,nr;E,l;B,b;B,a;B,nz;M,nr;
+坶:S,x;
+绻:S,x;E,a;
+鱼:S,n;B,n;E,n;E,v;B,nr;E,nr;M,ns;B,i;M,n;E,nz;M,i;E,i;E,l;M,nr;B,ns;M,l;B,l;B,v;B,d;E,ns;B,nz;M,nz;
+悄:B,d;M,z;E,d;B,z;E,z;B,l;B,n;M,n;M,nr;E,nr;
+锍:S,g;
+倏:B,d;S,dg;
+娓:B,l;M,l;B,i;M,i;B,d;E,d;E,nr;B,nr;M,nr;
+掮:B,n;
+液:E,n;B,n;S,ng;B,vn;E,nz;E,v;M,n;E,l;E,nr;B,nz;E,vn;M,i;E,i;M,nz;
+匹:E,m;B,v;E,n;S,q;M,nz;B,ns;S,m;M,n;B,n;B,vn;M,i;B,i;M,nt;E,nr;M,ns;S,vg;B,d;E,nrt;B,nz;B,nrt;
+崽:B,n;M,n;E,n;
+蛀:S,v;B,n;E,v;B,v;M,n;
+扃:S,g;
+胄:S,g;E,n;E,nr;E,nrfg;M,nr;
+汇:S,v;B,n;E,n;B,v;B,vn;B,nz;M,n;E,v;M,nt;E,ns;B,nt;E,nr;M,nz;M,nr;E,nrt;E,nz;M,ns;M,l;B,s;B,l;E,vn;E,j;E,l;B,i;M,i;B,ns;
+铌:S,ng;
+灏:S,g;E,nr;M,nr;
+拘:B,v;S,vg;B,a;E,v;M,i;B,n;E,j;M,nz;B,vn;
+赝:S,bg;B,n;
+靡:S,vg;E,a;E,v;M,i;E,i;E,nr;B,an;B,n;M,n;B,a;B,i;
+酥:S,a;B,n;B,a;E,n;B,v;M,z;E,b;M,n;E,z;E,nr;B,z;E,i;M,nr;
+烤:S,v;B,n;E,v;B,v;M,n;M,ns;E,vn;E,nz;B,nz;
+仰:E,n;S,v;E,v;B,v;B,d;B,l;B,nr;E,nr;B,ns;M,i;B,n;E,vn;M,n;B,i;M,nr;M,l;B,vn;E,l;
+韶:B,ns;M,l;E,nr;B,nr;M,nr;S,nr;S,j;B,nz;B,nt;B,n;
+搂:S,v;B,v;E,v;B,n;
+鞋:E,n;S,n;B,n;E,v;M,n;E,nr;E,i;E,nz;E,l;B,nz;M,nz;B,j;B,ns;
+栊:S,g;E,nr;
+庑:S,ng;E,n;
+斗:B,vn;E,vn;S,v;M,n;E,v;E,n;B,n;M,l;E,m;B,v;E,nr;E,i;M,nz;M,i;B,d;M,nr;B,ns;B,i;B,nz;E,a;E,l;E,nz;M,ns;S,m;E,nrfg;M,v;M,b;
+带:S,v;B,v;E,n;E,v;M,n;B,n;M,b;M,i;E,nr;M,l;B,d;E,nz;E,vn;B,nz;M,nr;E,b;E,nrt;E,i;E,d;E,j;B,vn;B,a;M,nz;B,ns;M,nt;M,d;
+堪:E,v;S,v;B,v;M,i;E,nr;B,ns;E,l;M,ns;E,i;M,l;E,a;B,n;M,nr;S,vg;E,ns;M,nz;B,l;
+椴:B,n;E,n;
+喷:B,v;S,v;B,n;E,v;B,b;B,vn;M,v;M,z;E,z;B,nz;E,nz;M,i;B,z;M,n;B,i;M,nr;E,b;E,nr;B,l;B,a;M,l;E,n;M,b;B,ns;
+鲽:S,g;
+情:B,n;E,n;S,n;E,v;E,a;M,i;M,n;B,v;E,d;B,i;E,i;B,l;M,l;E,vn;E,l;E,nr;B,a;E,r;B,t;M,nr;M,nt;M,t;M,nz;M,v;B,nz;E,an;M,j;
+绑:S,v;B,v;E,v;B,n;E,l;M,b;B,vn;B,nz;
+磕:S,v;B,v;M,z;B,z;M,v;B,n;M,l;
+奔:S,v;B,v;E,v;M,i;E,nr;M,ns;B,z;B,n;M,l;B,i;E,nrt;M,nr;B,nz;B,vn;B,nt;B,nrt;E,nz;
+晖:E,nr;S,nr;E,n;M,nr;E,nrfg;M,nz;
+进:B,v;E,v;S,v;B,vn;B,d;B,n;E,a;B,c;M,n;E,nr;M,nr;M,l;E,nrfg;E,l;E,i;E,vn;M,nt;E,nz;E,j;M,v;B,i;E,n;M,i;E,ns;M,nz;M,ns;B,j;M,j;B,nt;B,nz;B,nr;E,b;M,nrfg;B,ns;E,nrt;B,l;
+恚:S,g;E,nr;
+囡:E,n;
+嫩:S,a;E,a;B,n;E,ns;B,ns;M,ns;B,b;E,nr;M,nr;E,z;B,z;M,nt;M,z;M,n;E,j;E,l;
+硪:S,g;
+轰:B,v;S,v;B,n;B,i;M,i;B,o;B,d;E,v;B,vn;M,o;E,nr;M,z;B,z;B,l;M,l;
+毳:S,g;
+噶:M,ns;S,x;B,nrt;B,ns;M,n;B,n;E,nr;M,nz;B,nz;
+翻:B,v;S,v;E,v;B,i;B,n;B,l;M,i;E,n;M,l;E,nz;E,nr;B,vn;E,i;M,nr;E,vn;B,d;M,n;
+者:E,n;S,k;E,c;E,r;M,c;E,nr;M,n;M,l;M,i;E,nz;E,j;M,nr;M,nt;E,i;E,l;B,nz;M,ns;B,ns;
+肚:B,n;S,ng;B,f;M,m;M,n;E,n;E,v;M,l;E,i;M,v;E,ns;B,v;M,i;B,m;E,l;
+垠:E,a;E,l;E,nr;S,ng;E,i;M,nr;
+钢:B,n;E,n;S,n;M,n;M,nt;E,nr;M,nz;E,v;E,j;M,nr;E,nz;B,nz;B,b;E,nt;E,i;M,l;E,vn;B,l;B,nrt;E,nrfg;B,v;M,ns;S,v;B,j;B,nt;
+冤:B,n;S,v;B,v;E,v;M,i;B,j;B,i;E,n;E,i;M,l;B,l;
+麦:E,n;B,nr;B,n;S,ng;E,ns;E,nr;B,ns;S,nr;B,nz;M,nr;B,nrt;M,ns;E,nrt;M,n;M,nz;B,b;B,v;E,v;M,nt;M,i;E,nz;M,v;B,t;
+脯:E,n;S,g;M,n;B,n;E,nr;
+锷:S,g;E,nr;M,nr;
+刹:B,t;B,n;S,v;M,t;E,n;B,v;M,l;M,ns;E,nr;E,nrt;E,v;M,nz;
+鼻:B,n;S,ng;E,v;E,nr;M,n;B,v;E,a;M,i;E,n;E,ns;M,v;M,l;E,i;B,s;B,l;E,l;B,i;M,ns;B,nz;M,nz;M,nr;E,b;
+尽:B,c;S,v;B,d;E,v;E,d;B,v;M,i;B,f;E,i;B,l;B,i;E,a;M,l;E,l;E,nr;M,nr;E,n;E,z;E,b;B,a;
+蟀:E,n;S,x;
+捃:S,g;
+浇:S,v;B,v;M,n;M,i;E,nr;B,n;B,l;B,a;
+仆:B,n;S,ng;E,nr;E,n;M,nr;M,i;E,i;M,nz;B,v;M,ns;B,i;
+诈:S,v;B,v;E,vn;B,vn;E,a;E,v;M,i;B,n;E,i;M,n;M,nz;E,nr;E,n;S,vn;
+峒:S,g;M,ns;E,ns;E,nr;
+佛:B,nz;B,n;S,n;E,d;B,ns;E,n;E,v;E,nr;M,nt;M,n;M,nr;M,ns;M,nz;E,ns;E,nrt;B,nrt;E,i;M,l;E,nz;B,nt;M,i;B,i;M,nrt;
+陡:S,a;B,a;B,n;B,d;B,v;B,ns;E,ns;
+卣:S,g;E,nr;
+遥:B,a;B,v;B,n;S,ag;S,ng;B,vn;E,a;B,l;B,i;M,i;M,l;B,z;E,z;E,nr;E,ns;M,n;E,l;E,ad;M,ns;M,nr;M,d;B,d;
+摭:S,g;E,nr;
+零:B,n;B,vn;S,m;M,m;B,a;B,m;M,z;B,mq;B,d;E,v;E,z;B,s;E,i;M,i;B,z;E,m;E,o;B,v;M,l;E,nr;E,vn;B,i;M,v;B,t;B,an;M,nr;E,n;M,o;B,l;B,nt;M,n;
+特:B,n;B,d;E,nr;B,a;S,d;B,b;E,nrt;M,nr;E,a;M,ns;E,ns;B,nr;B,v;M,n;B,nrt;E,nz;M,nrt;M,nz;E,n;M,l;B,ns;M,nt;B,j;E,q;B,z;B,nz;M,b;B,vn;M,j;M,i;B,i;B,l;B,nt;E,mq;E,j;E,m;E,nt;
+司:E,n;B,n;B,nr;S,ng;E,nt;M,n;E,q;S,n;E,nr;M,nr;E,l;E,v;E,ns;B,i;E,m;B,nrt;B,nrfg;B,nt;M,i;M,nz;B,ns;M,ns;M,nt;M,v;B,v;B,j;B,b;E,j;E,i;B,nz;E,nrt;M,b;M,j;E,nz;
+籽:E,n;S,ng;M,n;B,n;M,nr;E,v;E,b;E,nr;E,nz;
+愆:S,g;E,n;B,v;
+朊:S,g;
+钓:B,v;S,v;B,ns;B,n;E,v;M,i;M,l;E,nr;B,l;M,ns;E,n;B,i;
+檗:E,n;S,x;
+谘:S,g;E,nr;B,nrt;
+悛:E,i;S,g;
+会:S,v;E,n;E,v;B,n;M,n;E,nt;E,j;B,v;M,m;E,nr;M,l;E,nz;B,t;M,r;M,nt;E,l;E,m;E,r;M,nz;E,mq;B,q;B,vn;M,vn;M,nr;B,ns;B,j;M,ns;M,i;E,i;M,d;E,ns;B,nrt;B,a;B,s;B,nz;E,vn;B,l;B,d;M,v;
+舜:S,g;E,nr;M,nr;E,n;M,nt;B,n;E,nz;
+圪:B,n;B,ns;
+训:B,vn;E,vn;E,n;S,v;B,n;B,v;E,v;E,nr;M,n;B,i;E,j;M,nr;M,nz;M,nt;B,j;E,i;M,ns;M,j;
+螵:M,n;S,x;
+昴:S,g;E,nr;
+簸:E,v;B,n;E,vn;E,z;M,z;
+傻:S,a;B,n;B,v;B,z;B,l;E,v;E,a;M,i;E,i;E,l;B,i;E,nr;M,nr;M,z;
+槁:S,g;E,a;B,n;B,i;E,nr;M,i;
+腆:E,a;S,v;
+噔:S,o;E,o;
+胛:E,n;M,n;
+蛟:E,nr;S,ng;B,n;B,ns;M,nr;
+敞:S,v;E,a;B,v;B,b;B,a;M,l;E,nr;B,n;M,nr;E,nrfg;
+煦:E,nr;M,nr;S,nr;E,a;M,z;E,z;B,a;
+奶:B,n;E,n;S,n;M,n;E,v;M,nr;E,nr;E,nz;M,l;B,l;E,l;E,vn;B,ns;
+啾:S,x;E,o;
+堋:S,g;E,nr;
+帏:B,n;
+吓:S,v;B,v;E,v;E,nr;E,vn;B,a;M,n;M,nr;M,i;
+洙:E,nr;S,g;M,nr;
+辚:S,x;M,nr;E,nr;
+挝:E,ns;S,x;M,nz;M,ns;M,nt;
+缥:B,a;M,i;B,z;M,z;
+甩:S,v;B,v;B,n;B,l;E,nr;B,nz;B,vn;
+咨:B,vn;B,n;B,j;M,nt;E,j;B,t;M,nz;B,nz;
+踯:B,v;M,n;
+涮:S,v;B,n;E,v;M,v;B,v;
+逻:B,n;E,v;M,n;M,l;M,nz;E,vn;B,l;
+阿:B,nr;B,ns;B,n;S,j;B,nrt;M,nr;B,nz;M,ns;E,nr;E,ns;B,nt;M,nrt;E,i;B,v;E,nrt;B,i;M,nt;B,j;M,i;E,n;E,nz;M,n;B,b;B,o;
+疾:B,n;S,ng;M,n;E,n;B,v;M,i;E,nr;M,l;B,d;B,i;E,z;E,i;S,dg;B,ad;M,nt;M,nz;S,ag;
+扇:S,q;E,n;B,n;E,m;S,v;B,v;S,n;E,v;S,m;E,i;M,i;B,i;M,nr;E,nz;M,n;B,nz;B,ns;
+髌:B,n;
+郐:S,g;
+赙:S,vg;B,v;
+拜:S,v;E,ns;B,v;E,v;E,n;M,ns;B,n;M,n;E,nr;M,nr;B,nrt;B,ns;B,nt;M,t;E,i;E,nrt;E,l;M,i;B,nz;B,nr;E,t;E,vn;M,nz;
+屣:S,g;E,n;E,l;
+剧:E,n;B,n;E,v;B,a;S,n;E,d;M,n;M,nt;B,v;E,r;M,l;M,ns;M,v;B,vn;E,nz;B,j;M,nz;M,nr;
+镩:E,n;S,g;
+菲:M,nr;B,ns;S,j;E,nr;B,nrt;B,nz;M,nrt;E,nrt;E,a;M,ns;B,n;E,n;B,v;B,nt;M,nz;B,nr;E,ns;E,nz;M,i;M,nt;M,n;E,nrfg;
+杵:S,v;E,n;B,n;S,ng;E,nr;E,i;M,nr;M,i;
+闾:S,nr;E,n;B,nr;B,n;M,ns;E,nr;M,nr;M,i;
+怆:E,a;S,g;E,an;
+馋:S,a;E,v;E,a;B,n;B,i;
+昊:S,nr;E,nr;M,nr;B,ns;B,nz;E,nz;E,nrfg;
+业:E,n;M,n;B,n;E,v;M,nt;E,vn;S,ng;E,j;M,vn;B,f;E,l;E,nz;E,b;E,nr;M,l;M,v;B,b;B,d;E,i;M,nz;E,nt;S,n;M,nr;M,i;B,j;M,ns;E,r;E,nrt;M,b;B,l;E,ns;M,t;S,d;B,nz;B,i;E,nrfg;
+茜:S,nr;B,n;E,nr;M,nr;E,nrt;
+倦:E,a;S,a;E,v;B,a;B,n;E,i;
+锨:S,n;E,n;S,ng;
+侯:B,nr;E,nr;E,n;S,nr;M,nr;M,n;S,ng;B,n;B,ns;B,nrt;E,ns;M,ns;E,i;B,nrfg;B,l;E,l;
+肱:E,n;B,n;M,n;E,l;
+朴:E,a;B,a;B,nr;B,n;S,nr;E,nr;E,n;M,nr;B,i;M,i;B,nrt;M,l;E,z;B,z;M,z;E,i;B,nrfg;M,nrfg;E,nrfg;E,an;
+冻:B,v;S,v;E,v;B,n;E,n;E,vn;M,n;M,t;E,i;M,nr;M,i;M,l;E,l;E,nr;B,b;M,nz;
+聆:B,v;S,vg;E,nr;M,nr;
+诗:B,n;S,n;E,n;E,nr;E,v;M,nr;B,nr;E,l;B,i;M,n;B,l;M,nrt;M,l;M,b;B,v;E,i;B,nz;E,nz;M,i;E,nrfg;
+摞:E,m;S,v;S,q;
+哩:S,y;S,q;E,nr;E,n;M,z;M,nz;B,z;M,l;
+譬:B,v;B,l;
+濯:S,vg;E,v;B,v;M,nr;B,nz;
+腰:S,n;B,n;E,v;E,n;E,d;B,v;M,n;E,l;M,v;B,l;B,i;E,b;M,l;B,ns;E,i;M,nrt;B,nz;E,nz;
+蝴:B,n;B,ns;M,nr;
+篷:E,n;S,n;M,n;E,b;B,n;E,nr;
+幺:S,nr;M,nr;E,nr;E,n;M,i;
+矿:B,n;E,n;S,n;M,n;E,v;M,l;E,j;E,b;B,j;E,nz;E,vn;E,ns;B,v;B,b;M,j;M,nr;E,nr;E,r;E,nt;M,nt;M,ns;B,l;E,l;
+榀:S,q;
+踅:S,v;E,nr;
+澄:B,v;S,v;E,nr;B,ns;M,nr;B,a;M,z;E,z;B,z;S,j;B,nz;B,nrt;E,a;
+式:E,n;S,k;E,ad;E,b;S,ng;E,l;E,nz;M,nr;E,nr;E,a;M,l;B,n;M,n;M,v;E,r;B,v;M,q;E,d;E,nrt;M,nz;M,vn;M,nt;E,j;M,i;
+逑:S,g;E,i;E,nr;
+阕:S,q;E,m;E,n;S,m;E,nr;
+袖:E,n;B,n;S,v;B,i;B,b;M,i;E,b;E,nr;E,v;E,nz;M,n;M,l;B,l;S,ng;M,nr;E,i;
+氙:B,n;
+骢:E,nr;S,g;M,nr;
+邦:E,n;E,nr;S,ng;M,nr;E,nt;E,ns;M,ns;M,nt;M,n;E,nz;B,n;M,z;E,z;B,nrt;M,nrt;E,i;M,t;M,i;B,ns;E,v;B,nz;E,nrt;M,nz;M,l;E,nrfg;B,nr;
+褫:B,v;
+沮:B,a;B,n;
+尹:B,nr;S,nr;E,nr;E,n;M,nr;E,nz;B,ns;B,nrfg;
+纺:B,n;E,j;M,n;B,v;S,v;E,b;M,nz;E,n;E,v;E,nz;B,vn;E,nr;B,nz;B,ns;M,nt;
+刽:B,n;
+浃:M,i;S,g;M,nr;
+迄:B,d;B,l;S,v;S,vg;E,nr;
+勒:E,nr;S,v;M,ns;M,nr;E,nrt;E,nz;E,ns;E,n;B,v;B,nrt;B,n;M,n;E,v;M,nrt;M,i;M,nt;B,ns;M,nz;B,nz;
+淘:B,v;S,v;B,a;B,n;M,nr;M,l;E,nr;M,n;M,nz;B,nz;M,i;
+卧:S,v;B,n;B,ns;E,v;B,v;M,i;B,b;B,l;B,i;E,n;E,nr;E,l;M,n;M,v;B,vn;E,i;M,ns;E,vn;
+痨:B,n;E,n;
+叼:S,v;
+链:E,n;S,ng;B,n;S,q;B,l;E,nr;E,b;E,nz;M,l;M,nr;M,nz;B,d;B,nz;
+肇:B,ns;B,vn;S,nr;M,nr;B,n;E,nr;B,nrt;B,v;M,nz;M,nrfg;B,nz;B,nrfg;
+骋:E,v;S,vg;E,i;M,nr;E,nr;M,l;
+妍:E,nr;S,nr;E,v;M,nr;B,a;E,a;B,n;
+缎:S,ng;E,n;B,n;E,nr;B,nz;
+梗:S,v;B,v;M,n;E,n;B,n;E,v;M,nr;E,i;E,j;B,a;E,a;
+抛:S,v;B,v;B,n;B,vn;B,i;B,l;
+耜:E,nr;S,g;E,n;
+纣:B,nrt;M,i;E,n;M,nrt;
+匦:S,g;
+唪:S,g;E,nr;
+莱:M,nr;B,ns;S,q;E,nr;B,nrt;M,ns;E,ns;E,nrt;M,nz;M,nrt;B,nr;B,n;B,nz;M,nt;B,nt;E,n;E,nz;M,l;
+搴:S,g;
+咿:B,o;M,o;B,i;
+毁:E,v;S,v;B,v;B,n;B,i;E,nr;B,vn;M,l;M,n;M,i;M,nz;B,l;
+淅:B,ns;M,z;B,o;B,z;B,n;
+荆:B,ns;B,nr;S,j;M,ns;B,n;S,nr;E,n;M,nr;E,nr;M,i;E,v;M,n;B,nrt;B,i;
+蕊:E,n;S,ng;E,nr;M,nr;M,l;M,n;
+种:E,r;E,m;E,n;B,n;S,q;S,m;E,v;B,v;B,q;E,q;E,b;M,l;M,n;B,nr;E,vn;E,l;E,a;E,i;B,l;E,j;M,m;B,i;E,t;E,nr;M,i;M,nz;B,ns;M,v;M,ns;B,j;
+塌:E,v;S,v;B,v;M,i;E,vn;M,z;E,z;B,a;B,n;B,vn;E,a;B,nz;M,n;
+珑:E,a;E,i;M,i;S,x;E,nr;
+剐:S,v;E,i;
+酒:S,n;B,n;E,n;E,v;E,vn;M,n;B,ns;B,t;M,i;E,nr;B,i;M,nt;B,v;E,nt;E,nz;B,nz;E,i;M,nr;E,l;B,l;M,l;M,v;B,b;M,ns;B,nt;M,nz;B,nrt;
+痕:B,n;E,n;S,ng;M,l;E,nr;
+呔:S,e;S,g;
+苛:B,a;B,v;B,n;E,a;B,i;B,l;B,vn;
+浚:S,ng;E,v;E,nr;B,ns;M,nr;E,nrfg;
+蓟:B,nr;S,nr;B,ns;E,nr;M,nr;E,n;M,n;
+杞:B,ns;E,n;M,n;B,i;B,n;E,nr;B,nt;
+寡:B,n;S,ag;M,i;E,n;B,i;E,v;M,l;B,v;M,n;B,l;B,a;M,nr;E,b;E,i;E,l;M,j;
+祢:S,g;B,n;
+工:B,n;B,vn;E,n;E,vn;M,n;E,v;S,n;B,j;M,nt;M,l;B,l;E,j;E,nr;B,a;M,nz;B,nz;E,nz;E,l;B,b;M,j;M,i;E,i;E,d;B,ns;B,v;M,b;M,nr;M,ns;E,nt;M,v;B,i;B,an;E,a;M,z;B,z;E,nrfg;B,nt;B,nr;E,nrt;
+郧:B,ns;S,g;B,n;E,nr;
+番:E,m;S,q;B,n;B,ns;E,ns;E,d;E,v;E,t;M,n;M,i;M,ns;E,l;E,nr;E,i;M,nr;M,m;B,nz;M,nt;S,m;
+衬:B,n;S,v;B,v;E,v;E,n;E,nr;E,nz;M,nr;
+泯:S,vg;B,v;E,l;M,nr;E,nr;
+艰:B,a;B,i;E,l;S,ag;B,l;E,n;B,n;M,i;E,i;E,z;M,l;E,nr;
+曳:E,v;B,n;B,v;M,n;M,z;M,l;E,z;B,nz;M,i;
+磷:B,n;S,n;B,nz;E,n;M,n;B,vn;E,nz;E,nr;M,nz;M,nr;B,j;B,b;
+狻:S,x;M,nr;B,n;
+瓿:S,g;
+檀:S,nr;E,nr;B,n;E,n;M,nr;S,ng;B,nr;B,ns;M,n;
+七:B,m;M,m;S,m;E,m;B,t;B,n;B,ns;B,i;M,i;M,nr;B,nz;E,ns;E,nr;M,nz;M,ns;B,b;M,n;B,l;E,t;M,nt;E,n;B,nt;B,j;B,nr;M,l;E,nz;M,mq;M,j;
+蜉:B,n;M,i;M,l;E,n;
+餍:S,g;
+碌:E,a;M,z;E,z;E,v;E,d;B,n;B,i;M,i;B,nrt;E,vn;B,ns;M,l;
+小:B,n;S,a;B,nr;M,nr;E,n;E,b;E,a;B,v;M,j;E,v;M,n;E,d;B,b;B,d;B,z;M,z;B,ad;M,l;E,j;E,z;M,i;B,i;B,ns;M,b;B,nz;B,nrt;E,nrt;B,l;E,l;E,nr;B,t;M,v;B,m;B,a;M,m;M,q;M,nrfg;M,nt;B,vn;B,j;E,i;M,ns;M,nrt;B,nrfg;E,nt;E,ns;B,nt;M,nz;
+锕:S,g;
+亘:E,v;B,n;B,i;M,ns;
+眩:B,v;S,vg;E,i;E,v;B,n;M,i;E,l;E,nr;
+谯:S,nr;B,n;M,nr;B,ns;M,ns;
+弹:E,n;E,v;B,n;S,v;B,v;M,n;E,l;B,vn;B,i;E,nr;E,vn;E,i;M,i;B,l;M,v;M,nz;M,l;M,j;E,j;
+湃:E,v;S,x;E,i;E,nr;M,nr;E,l;E,a;
+惜:E,v;S,vg;E,a;B,v;B,nr;E,nr;M,i;E,i;M,nr;E,l;M,l;B,i;E,vn;B,a;B,vn;
+章:E,n;E,m;E,nr;S,q;B,nr;B,n;E,r;S,m;E,i;M,nr;E,v;M,l;E,vn;E,ns;B,ns;M,i;M,n;B,nrfg;M,ns;E,nrfg;E,nz;E,j;B,b;E,nrt;E,l;B,nrt;
+革:E,vn;B,vn;M,nz;M,n;E,n;B,n;S,vg;M,nt;M,l;B,v;E,l;E,j;E,v;B,nz;E,nr;B,j;M,ns;E,ns;M,v;E,nz;M,nr;M,i;B,nrt;B,i;B,ns;M,j;E,nrt;
+迮:S,nr;
+罹:B,v;B,n;
+煽:B,v;B,a;B,l;B,n;B,vn;
+较:S,d;E,d;B,a;B,d;E,v;B,v;B,p;M,n;E,i;B,b;B,vn;B,n;B,ns;M,l;M,nz;
+咕:B,o;S,o;B,v;E,v;E,o;M,z;M,o;E,z;E,l;M,l;
+斟:B,v;S,v;M,i;E,nr;M,nr;
+袭:S,v;E,v;B,v;E,vn;M,i;E,nr;B,n;M,nz;M,n;M,nr;
+花:E,n;B,n;S,v;M,n;B,nr;B,v;M,i;M,ns;E,v;M,l;E,nr;B,ns;E,i;B,i;B,z;M,nr;B,nt;M,z;E,nz;E,z;E,ns;E,b;B,nz;B,t;B,l;M,nz;M,nt;B,nrfg;E,vn;E,a;B,b;B,a;B,nrt;B,j;E,l;M,nrt;E,nrfg;
+缸:S,n;E,n;B,n;E,nz;E,b;M,n;E,v;E,nr;B,nz;B,ns;
+去:S,v;E,v;E,t;B,t;B,v;B,n;M,i;B,vq;E,i;E,l;M,l;M,nr;M,n;B,nz;M,z;E,z;E,nr;E,n;B,i;B,l;
+泅:B,v;S,v;
+鹎:S,g;
+遒:B,a;E,l;
+仙:S,ng;B,n;E,n;E,nr;M,nr;B,ns;M,n;M,ns;B,nz;E,v;M,i;M,nz;E,i;B,v;E,nz;B,l;M,l;E,ns;B,i;B,nt;M,nrfg;E,l;B,nrt;
+嫡:B,n;B,b;B,v;
+峥:B,z;E,nr;S,nr;M,nr;M,i;B,i;
+牦:B,n;B,nz;
+毫:B,m;B,q;B,v;B,l;E,m;B,d;B,n;S,q;S,d;E,n;M,m;E,i;M,i;B,i;E,v;M,q;E,nr;M,l;S,ng;M,nr;
+柳:B,nr;S,n;B,n;S,ng;E,n;B,ns;M,nr;E,nr;M,ns;B,nrt;B,nrfg;B,j;M,i;B,i;M,n;E,nrt;E,i;B,b;B,l;B,nz;M,nz;E,ns;B,nt;M,nrfg;M,l;
+蕴:B,v;B,n;E,n;S,vg;E,nr;M,nr;E,ns;M,ns;B,ns;B,a;E,v;
+婶:B,n;E,n;M,n;M,nr;
+屺:S,g;M,nr;
+痿:E,v;S,g;B,n;
+谅:E,v;B,v;S,v;E,nr;B,ns;E,vn;M,nr;M,l;
+疔:E,n;
+思:B,n;E,n;B,v;M,nr;E,nr;E,v;S,v;M,n;M,i;E,a;E,l;B,nr;E,i;M,l;B,nz;B,i;E,nrt;B,l;B,ns;B,vn;B,nrt;E,vn;M,nz;E,nz;M,ns;E,ns;M,nrfg;E,nrfg;M,nrt;
+宠:S,v;B,v;B,n;E,v;E,a;E,vn;M,i;E,nr;M,nr;E,i;E,n;B,i;B,l;
+颢:E,nr;S,g;M,nr;
+瘩:E,n;E,l;E,z;M,z;M,n;S,x;E,i;E,nr;
+钪:S,g;M,nr;
+贯:B,v;E,nr;E,v;S,nr;E,d;M,i;E,b;M,nr;E,n;E,a;E,m;M,n;S,vg;E,i;B,n;M,m;B,b;M,nrfg;M,l;B,i;B,l;
+悲:B,a;B,n;E,a;S,an;S,vg;B,an;B,i;B,v;E,n;E,i;M,i;M,nr;S,ag;B,l;E,l;B,z;B,ad;M,z;E,v;M,l;E,nr;
+锿:S,g;
+诀:S,ng;E,n;B,n;B,v;E,v;B,vn;
+跄:E,v;E,z;M,z;S,x;
+筋:E,n;S,n;B,n;E,v;B,i;M,l;M,i;E,nz;M,nz;E,nr;B,a;M,n;B,nz;
+蹙:S,vg;B,v;M,i;
+险:E,n;E,an;M,n;E,v;S,a;B,a;E,a;B,n;E,j;B,d;E,l;E,i;M,i;E,vn;M,nr;M,nt;M,nz;E,nt;B,l;B,v;M,l;E,nr;E,b;
+忸:B,a;B,i;
+凼:S,g;B,ns;M,nr;E,nr;
+雾:E,n;S,n;B,n;B,ns;E,v;E,i;B,z;E,nr;M,ns;M,l;M,nr;B,v;M,n;B,i;E,l;M,i;B,l;E,nz;M,nz;B,nrt;
+漂:B,a;B,v;S,v;B,n;E,n;E,nr;M,z;B,z;B,i;E,a;B,vn;B,nz;M,nr;M,n;M,i;
+鲋:S,g;E,nr;
+骏:E,nr;S,ng;B,n;M,nr;M,nz;S,ag;B,nrt;
+喑:B,v;E,i;
+邓:B,nr;S,nr;B,ns;E,nr;B,n;M,nr;B,nrfg;B,nrt;
+厕:B,n;E,n;S,ng;M,n;E,v;
+抟:S,v;E,nr;
+碣:B,n;E,nr;E,n;S,ng;B,ns;M,ns;
+匪:E,n;S,ng;B,n;E,v;B,i;S,dg;M,l;E,vn;E,nr;M,n;
+戴:S,v;B,nr;E,v;E,n;M,i;B,nz;M,ns;B,l;M,nr;B,nrt;E,nr;B,i;B,nrfg;E,vn;B,v;E,i;M,n;B,ns;M,l;
+康:E,a;B,nr;B,n;E,nr;S,j;M,nr;E,n;E,ns;S,nr;B,v;B,ns;B,nz;E,nz;B,nrfg;M,ns;M,n;B,a;M,nt;E,l;M,nz;B,nrt;B,nt;B,vn;B,i;E,nrt;M,i;M,z;E,z;B,t;M,nrt;
+砸:S,v;B,v;B,i;M,j;M,l;
+咻:S,g;E,z;M,z;
+瘼:S,g;
+势:E,n;B,n;S,ng;E,v;E,d;M,i;B,d;E,vd;B,i;E,i;M,n;E,nr;M,l;E,l;B,a;B,l;M,nr;E,nz;M,ns;E,ns;E,a;
+毅:E,nr;E,a;M,nr;B,d;S,nr;B,n;M,nrfg;B,i;E,nrfg;B,a;M,l;
+幌:B,n;E,ns;M,ns;
+呐:B,v;S,y;E,n;B,n;B,vn;M,i;B,l;M,n;E,nr;M,nr;
+青:B,n;B,ns;S,a;E,nr;B,v;M,nr;B,nr;E,n;B,j;M,n;B,b;M,nt;B,nt;E,z;B,t;B,i;B,nz;B,a;B,z;M,j;M,l;E,v;E,nrfg;B,l;M,i;E,a;M,ns;E,b;E,i;E,vn;B,nrt;E,nz;E,ns;E,l;E,nrt;M,z;M,nz;E,j;M,nrfg;
+剔:B,v;E,v;S,v;M,i;S,n;E,l;B,n;B,a;B,i;B,nz;
+苟:B,v;S,d;B,i;E,i;M,i;B,nr;M,l;E,nr;S,c;S,nr;B,n;M,nr;
+巡:B,n;B,v;S,q;B,vn;S,vg;E,v;E,nr;B,l;M,nr;B,nz;M,nz;M,j;E,nrfg;E,vn;M,i;
+罢:S,v;B,v;B,y;E,y;E,v;M,i;E,nr;M,v;B,i;M,nz;B,vn;B,n;
+寥:B,z;E,z;B,i;M,i;S,nr;E,a;B,a;M,nr;
+畦:S,q;S,ng;E,n;E,nr;B,n;
+泫:S,g;
+蹬:S,v;E,n;B,v;E,a;B,n;M,nr;E,v;M,n;
+想:S,v;B,v;E,n;E,v;M,l;B,n;E,vn;B,l;M,n;E,i;B,d;M,i;B,i;E,nr;M,nt;E,l;M,v;E,nz;M,nr;M,a;B,vn;M,vn;E,a;
+艴:S,g;
+绷:S,v;B,n;B,v;M,z;E,z;E,n;
+顸:E,a;
+孺:E,n;B,n;M,i;E,nrfg;B,nrt;M,nr;B,i;
+檄:B,n;
+脉:E,n;S,ng;E,ns;B,n;S,q;M,l;M,n;E,nr;E,i;E,l;E,v;M,i;M,nr;E,nz;E,z;B,z;B,l;M,nz;
+鼍:S,g;
+锑:S,ng;M,n;B,n;E,nz;E,nr;
+璐:E,nr;S,nr;M,n;M,nr;
+朝:S,p;E,t;B,n;E,n;B,ns;M,nr;E,nr;B,v;B,p;B,nz;M,i;E,v;M,ns;B,i;E,mq;E,l;B,nt;E,j;B,j;M,n;M,l;M,nz;B,nr;M,nrfg;B,vn;M,nt;E,i;B,nrt;E,ns;
+笥:S,g;M,nr;
+储:B,n;B,vn;E,j;S,v;B,v;E,v;E,vn;M,n;B,nr;M,nt;E,n;M,j;M,nr;E,nz;B,l;E,nr;S,vg;B,j;B,nz;M,b;M,nz;
+谫:S,g;
+耳:B,n;S,n;M,ns;E,n;E,nr;M,n;B,s;B,v;M,i;E,a;E,d;B,i;M,nr;E,i;E,q;B,vn;E,l;M,nz;E,v;B,a;M,l;M,nt;B,l;B,nz;E,nrt;
+鸷:E,a;B,n;
+夹:S,v;B,v;B,n;E,n;B,b;M,l;M,i;B,ns;B,l;M,n;E,nr;B,vn;B,i;B,nz;E,b;E,nz;
+桃:E,n;B,n;S,n;B,ns;M,n;E,nr;M,ns;M,i;M,nr;B,i;E,nz;M,nz;M,l;E,l;B,b;E,ns;
+铐:E,n;S,v;
+埒:S,g;E,nr;
+棘:S,ng;E,n;B,a;B,n;B,l;E,i;E,nr;M,nr;M,n;B,b;M,l;
+曜:S,g;E,nr;M,nr;E,nz;
+糠:S,n;S,v;E,v;B,n;E,n;M,nz;M,i;M,nr;E,nr;E,nz;
+酩:B,i;B,v;
+烨:E,nr;S,nr;M,nr;
+潭:S,n;E,ns;E,n;M,ns;E,nr;B,n;M,nr;M,i;E,nrt;M,nz;B,ns;M,nt;M,n;E,i;E,l;
+们:E,r;S,k;E,n;M,n;M,ns;M,l;E,ns;E,rr;M,nz;E,nr;
+睽:E,i;M,i;S,g;
+覃:B,nr;S,nr;E,nr;M,nr;
+戊:S,mg;B,n;B,l;M,n;B,m;B,nz;M,nr;M,nz;E,nr;E,nz;B,t;
+斛:S,q;E,nr;E,n;B,nr;
+蜜:B,n;E,n;S,n;E,a;E,nr;M,n;M,i;M,z;E,z;M,nr;M,l;M,nz;E,v;B,nz;M,ns;B,i;
+瞧:S,v;B,v;E,v;E,l;E,nr;M,a;
+否:E,v;B,c;B,v;S,vg;S,y;E,u;M,v;E,i;B,n;M,l;M,i;B,i;E,nr;M,n;E,n;
+德:B,ns;E,nr;M,nr;S,j;E,n;E,nrt;B,nr;M,ns;E,ns;B,n;B,j;B,nrt;B,nz;E,t;E,nz;B,nt;M,nrt;E,i;E,v;M,nz;M,n;B,i;E,a;M,nt;M,i;E,j;E,nrfg;M,nrfg;M,q;B,b;M,l;E,l;E,nt;B,nrfg;M,v;B,l;
+喻:E,i;E,n;B,nr;E,v;S,nr;M,i;B,v;E,nr;S,vg;S,ng;E,vn;M,l;M,nr;B,ns;
+隽:S,x;E,nr;B,a;M,nr;M,i;
+眼:B,n;S,n;B,t;E,m;E,n;B,s;E,d;B,v;E,v;E,a;M,l;M,n;M,i;B,d;E,l;M,v;E,i;M,t;B,l;B,i;B,a;B,nz;E,nr;M,nr;M,nz;E,t;S,m;M,a;M,ns;E,b;B,b;M,nt;
+县:E,ns;S,n;B,n;E,n;E,r;E,nr;B,b;M,nr;M,n;E,nrt;M,ns;B,j;E,v;M,b;B,vn;E,l;E,nt;B,ns;M,nt;
+蹂:B,v;B,vn;
+葆:M,nr;S,vg;M,ns;E,nr;E,v;M,l;
+绍:E,v;B,ns;E,nr;M,nr;S,nr;M,n;E,ns;M,ns;B,nz;B,n;B,nrt;B,nr;M,i;E,n;M,nrfg;B,nt;
+啐:S,v;
+菟:B,n;E,n;
+峡:E,n;E,ns;B,n;S,j;E,nr;M,nz;M,n;M,nt;M,ns;B,ns;M,nr;M,l;S,ng;
+韧:B,n;E,a;S,ag;E,nr;B,l;M,n;M,i;E,nz;M,nz;M,nr;E,ad;
+淫:B,a;E,v;S,ag;B,n;M,i;B,v;E,a;E,vn;M,nz;E,i;B,vn;E,nr;E,l;
+转:B,v;S,v;E,v;B,n;B,vn;E,vn;M,n;B,c;M,i;B,d;E,nr;B,i;B,t;E,i;E,a;B,l;M,l;M,nr;E,l;M,d;E,n;B,j;M,b;M,v;E,j;M,vn;M,nz;B,nz;M,j;
+毯:E,n;B,n;M,b;M,n;E,nz;
+婺:B,ns;B,n;
+靼:E,n;S,x;M,ns;
+偾:S,g;
+谁:S,r;B,v;B,r;M,i;B,i;M,l;E,i;B,l;E,nr;M,nr;
+殄:S,g;M,i;E,nr;
+羌:S,nr;S,j;B,ns;B,nz;M,ns;E,nr;E,nrt;E,n;B,n;E,j;
+昝:S,nr;B,nr;
+室:E,n;S,n;B,s;B,n;E,nr;E,nz;E,nt;M,nr;E,v;M,n;E,i;M,i;E,nrt;E,j;E,mq;M,nt;
+钦:E,nr;S,nr;M,nr;S,j;B,v;B,n;B,i;B,ns;S,ng;S,vg;E,ns;B,nrt;M,l;M,ns;E,nrt;
+贫:B,a;B,n;S,ag;B,vn;B,v;E,a;B,an;E,vn;B,j;E,v;M,l;M,i;B,l;E,b;E,l;E,i;B,i;M,nt;E,nr;M,j;M,n;E,n;
+中:S,f;B,ns;B,n;E,r;E,s;B,nt;B,j;B,f;E,v;B,nz;B,b;E,f;B,t;B,v;E,ns;M,nt;M,nr;E,n;M,l;E,d;M,ns;M,n;E,nr;M,j;B,nrt;E,nrt;M,i;B,a;E,j;E,t;M,b;B,l;E,l;B,d;M,s;B,vn;B,nr;E,nz;E,nrfg;E,a;M,nz;E,i;B,i;B,s;M,f;E,nt;M,vn;E,b;E,vn;M,v;M,nrfg;M,t;M,jn;
+锻:B,v;B,n;S,vg;E,n;M,l;M,nz;E,nz;E,nr;E,v;M,nr;B,vn;
+评:B,v;B,vn;B,n;E,v;S,v;E,n;M,n;E,vn;E,nr;E,j;B,nz;E,l;M,i;M,nt;B,i;M,nr;B,l;B,j;M,j;
+筏:E,n;S,ng;B,n;M,n;B,ns;M,nr;E,nr;
+佗:E,nr;S,g;E,nrfg;M,nz;
+衙:B,n;E,n;B,ns;M,nrt;M,nr;M,n;
+柜:E,n;B,n;S,ng;M,n;E,nr;E,i;E,nz;E,v;B,s;B,b;B,nz;
+蛲:B,n;
+白:B,n;B,nr;E,v;S,a;M,n;E,n;B,ns;E,z;B,t;E,nr;E,a;M,nr;M,ns;B,z;B,nz;B,v;E,l;M,z;E,b;M,l;B,i;E,ns;B,d;M,i;E,d;E,i;M,nt;B,a;B,nrt;B,nrfg;B,b;B,l;E,nz;E,nrfg;E,vn;E,nrt;M,nz;E,ad;B,nt;M,s;M,v;B,vn;
+郾:B,nrt;S,g;B,ns;E,nr;
+蒇:S,g;
+麋:B,n;
+颏:S,ng;E,n;M,n;
+冕:E,v;S,ng;E,n;M,i;E,nr;B,nrt;B,ns;M,n;M,nr;B,n;
+萜:S,g;B,n;E,n;M,n;
+悟:S,v;E,v;E,n;E,i;M,nr;B,v;B,n;E,nrt;E,nr;E,a;E,vn;M,nt;E,l;M,ns;S,vg;M,n;E,ns;
+鸠:B,nr;E,n;E,nrt;B,i;M,i;
+璧:E,n;M,i;E,ns;E,nrfg;E,i;E,v;B,ns;M,ns;
+享:B,v;E,v;S,v;B,n;B,l;S,vg;E,nr;M,nr;M,i;B,vn;B,ns;M,n;E,i;M,l;
+岷:B,ns;S,g;E,nr;M,nr;B,nz;
+琼:M,nz;E,nr;S,j;B,ns;B,nrt;S,nr;B,nz;M,nr;B,n;S,ng;B,i;B,nr;M,ns;M,i;E,nrt;M,n;
+赂:E,v;S,ng;M,n;M,i;E,vn;
+揉:S,v;B,v;M,i;E,nr;
+腊:E,ns;M,n;S,ng;B,t;M,nz;B,n;E,nr;M,nr;M,ns;E,n;M,nt;M,l;M,i;B,mq;E,nz;E,nrt;E,v;M,nrt;
+镒:S,q;E,nr;
+燕:B,nr;B,ns;S,nr;B,n;E,nr;B,nz;M,nr;E,n;B,nt;M,i;S,ng;E,nrt;M,n;E,nrfg;B,i;E,ns;B,l;
+蛛:E,n;B,n;B,i;M,n;M,nz;
+楚:E,a;B,nr;S,nr;S,j;B,n;B,ns;M,nr;M,z;E,z;E,nr;E,l;E,n;M,i;B,i;M,ns;E,t;M,n;B,nrt;B,nz;E,i;E,nrt;E,ns;M,nrfg;B,nrfg;
+捞:S,v;E,v;B,v;M,i;M,ns;E,vn;M,n;B,l;E,n;B,n;B,ns;
+忡:E,i;M,i;E,n;S,x;
+姥:M,nr;E,nr;B,n;E,n;E,nrfg;M,nrfg;M,ns;B,ns;
+铧:S,x;E,n;B,n;E,nr;M,nr;
+睦:S,ag;E,a;B,n;M,nr;B,l;M,i;E,nr;E,l;M,z;E,i;E,vn;E,z;M,nz;
+叩:B,v;S,vg;B,n;E,v;M,nr;E,nr;
+拳:B,n;E,n;S,n;E,m;E,v;M,i;E,nr;E,i;B,i;S,v;E,nz;B,v;M,n;M,l;
+驸:B,n;
+茉:B,n;M,n;E,n;
+炔:E,n;B,n;M,nz;
+辖:S,v;E,v;M,n;B,n;E,n;B,v;B,s;E,vn;
+莞:E,ns;M,ns;S,j;B,l;M,nr;E,nr;B,v;M,nt;
+缡:S,g;E,nr;
+庠:S,g;E,nr;B,n;
+猩:E,n;B,n;B,z;M,n;M,nr;E,nr;
+动:E,vn;E,v;B,n;M,n;E,n;S,v;E,a;B,v;E,d;M,l;E,ad;E,l;E,b;M,i;E,i;E,nz;M,vn;B,j;B,an;B,a;M,nz;B,d;M,b;M,v;B,l;E,nr;M,nt;B,i;B,vn;M,t;M,ns;M,nr;M,a;E,nt;E,an;B,nz;B,b;
+醪:B,n;E,z;
+舳:S,x;B,n;
+阻:B,v;B,n;E,v;S,v;E,n;M,n;B,vn;E,i;E,nr;E,vn;E,l;M,i;B,nz;M,nz;
+禺:E,ns;M,ns;E,nr;S,g;M,n;M,nr;M,nz;
+摇:B,v;S,v;M,v;E,v;M,nr;B,n;B,i;M,i;B,z;M,z;E,nr;E,i;E,b;B,l;E,ad;M,l;E,l;E,vn;B,nz;B,vn;M,b;M,n;
+苈:S,x;M,nr;M,n;E,nr;
+鳌:S,g;E,nr;B,n;E,n;M,i;B,ns;
+嗒:S,o;E,o;
+绠:S,g;
+饥:B,n;S,ng;E,v;B,i;M,i;B,l;E,a;M,v;B,v;S,ag;E,i;M,l;E,l;
+诮:S,g;E,v;E,vn;E,nr;
+慵:S,g;B,a;
+筹:B,v;E,j;M,n;S,v;B,n;E,v;M,nr;E,nr;M,i;E,n;E,i;M,l;B,vn;E,l;M,nt;B,j;
+哼:S,v;B,v;E,v;M,z;E,z;B,n;B,z;B,o;M,i;
+薇:S,g;E,nr;E,n;M,nr;M,n;E,nrfg;
+昆:B,ns;B,n;S,j;E,nr;M,nr;M,ns;M,nz;B,j;B,nt;B,nrt;B,nr;E,nrfg;E,j;E,ns;M,nt;B,nz;M,l;
+龋:B,n;E,v;
+怊:S,g;
+岍:S,g;
+馏:E,v;B,n;M,n;E,n;S,v;
+税:E,n;B,n;S,n;E,v;M,n;E,j;B,b;M,j;E,vn;M,nt;B,t;B,j;E,l;E,i;M,nz;B,nt;M,nr;E,b;M,b;E,nz;B,v;B,nz;M,ns;
+世:B,n;S,ng;M,nr;E,v;E,n;M,nz;M,n;E,nrt;E,nr;M,t;B,t;B,l;B,s;M,i;B,nr;B,nt;B,vn;E,t;E,i;B,j;B,nz;M,l;E,l;E,j;B,b;E,ns;E,b;M,mq;M,nt;B,i;B,v;E,d;M,m;B,m;M,nrfg;M,v;E,m;E,nz;B,a;E,vn;M,ns;M,nrt;
+鼠:E,n;S,n;B,n;M,n;M,i;E,v;E,nr;E,i;S,ng;B,t;B,i;B,v;E,l;E,t;B,l;E,nz;
+倪:B,nr;S,nr;E,n;E,nr;E,l;S,x;M,nr;B,nrfg;
+蚱:E,n;B,n;
+嶷:S,g;E,nr;M,ns;
+笸:B,n;
+钽:S,ng;B,n;M,nz;
+滁:B,ns;B,n;
+拉:S,v;M,ns;B,v;M,nr;E,nrt;M,n;B,nr;E,nr;B,ns;E,ns;B,nrt;M,nrt;B,n;M,nz;E,n;B,nz;E,v;E,q;B,j;E,nz;M,nt;M,l;B,l;E,vn;M,i;M,z;E,z;E,j;E,m;E,o;M,m;B,i;M,b;M,o;B,nt;B,vn;B,z;E,i;E,a;E,l;B,ad;B,a;
+聊:S,v;B,v;E,a;E,v;B,ns;M,i;B,nz;B,n;B,i;B,d;M,v;E,i;M,n;M,nr;
+糍:B,n;
+嵌:S,v;E,v;B,v;M,n;E,nr;B,n;B,nz;B,vn;
+监:B,vn;E,n;B,n;M,j;S,j;B,v;M,nr;E,nr;M,nt;M,n;S,ng;S,vg;B,ns;E,j;B,j;E,v;E,vn;M,nz;B,nz;B,i;B,nt;M,ns;
+坐:S,v;B,v;E,v;B,n;B,i;E,i;M,n;M,l;E,n;B,l;M,i;E,nr;B,vn;B,b;B,nz;M,nr;E,vn;
+兔:S,ng;B,n;E,n;E,nr;M,n;E,i;B,i;M,nr;M,i;E,v;M,l;B,l;E,t;B,t;B,nz;
+跗:B,n;
+湖:B,ns;E,ns;B,n;S,n;E,n;E,nr;B,s;B,nz;M,ns;M,n;M,nr;B,nt;M,nz;B,i;E,l;E,f;M,i;E,v;M,j;E,j;M,nt;M,l;E,nz;E,i;B,b;B,j;E,nrt;B,l;
+蟛:S,x;
+蝰:B,n;
+腴:E,a;E,n;S,ag;S,g;
+并:S,c;B,v;B,c;E,v;B,d;B,n;E,d;B,vn;M,i;B,l;B,ns;M,n;B,i;M,l;E,n;M,nr;E,vn;M,j;B,b;E,nr;
+榄:M,n;E,n;S,g;M,ns;M,nr;E,nr;
+授:E,n;B,v;S,vg;E,v;E,nr;M,l;B,n;B,vn;M,i;B,b;M,nr;E,vn;M,n;B,i;B,nz;M,b;E,l;M,nt;
+弋:M,nr;S,ng;E,v;B,ns;B,n;E,nr;M,ns;
+夏:B,t;B,nr;S,tg;E,n;E,ns;E,nr;B,n;E,t;B,ns;M,ns;M,nr;M,nt;B,nz;M,nz;M,l;E,nrfg;M,n;E,v;B,j;M,nrt;E,nrt;E,vn;B,v;E,nz;B,nrt;B,nt;B,nrfg;B,l;
+阑:S,ng;B,n;B,v;E,nr;E,v;M,nr;M,i;
+熔:B,n;B,v;S,v;E,n;B,l;M,nr;B,vn;E,v;E,nr;M,n;E,nz;B,nz;M,l;
+鲢:B,n;E,n;
+砥:M,i;S,ng;B,v;B,vn;M,nr;E,nr;B,i;
+妤:E,nr;E,n;S,x;M,nr;
+厨:B,n;S,ng;E,n;E,v;E,nz;B,ns;B,j;
+邪:S,a;B,n;B,a;E,v;E,n;E,a;E,nr;M,i;E,i;B,l;B,i;B,an;
+茳:M,nr;
+纶:E,n;E,nr;S,x;E,nz;E,i;M,nr;B,i;B,n;M,n;M,i;E,l;M,nz;E,a;
+歃:B,v;B,i;
+规:B,n;B,v;E,n;M,b;E,vn;S,ng;M,l;E,v;E,a;M,a;M,n;B,vn;E,b;E,nr;B,l;M,vn;B,a;M,d;M,i;B,z;M,z;E,i;M,nr;M,nt;B,nz;E,l;S,vg;B,j;M,ad;E,nrt;M,nz;E,j;M,v;B,i;
+哒:S,o;E,o;S,x;E,v;B,n;M,o;
+翠:S,ng;E,nr;B,nr;E,n;M,nr;B,n;B,z;E,z;B,ns;E,a;M,n;E,v;M,i;S,ag;M,ns;M,l;E,l;E,ns;B,nrt;E,i;
+季:B,n;M,mq;E,t;E,m;E,n;S,ng;B,nr;B,l;M,nr;E,nr;E,b;M,n;E,l;S,q;S,m;E,r;M,l;E,j;E,v;M,b;B,nz;B,nrt;S,nr;M,ns;M,nrt;B,nrfg;E,nrt;B,i;B,vn;E,ns;M,nrfg;B,t;
+秤:S,n;E,n;B,n;M,n;E,v;E,nz;
+啧:E,o;B,o;S,o;B,l;M,l;B,i;M,i;B,n;M,n;S,e;
+穹:B,n;E,n;
+寸:E,n;E,m;S,q;S,m;M,i;B,i;B,n;B,l;E,a;E,q;M,l;M,n;E,l;M,nr;E,v;B,v;E,i;
+骇:E,a;B,i;M,i;B,z;B,a;B,n;E,n;M,ns;
+肋:S,n;B,n;E,n;M,l;
+碛:S,g;E,n;M,n;
+崞:S,g;
+耠:S,v;
+谨:B,a;S,d;E,a;M,i;B,v;E,nr;B,i;M,nr;M,n;
+伪:B,n;S,j;B,v;E,vn;E,a;E,n;E,v;E,j;B,ns;M,l;B,j;M,j;E,nr;B,b;M,n;M,i;M,nr;
+爬:S,v;B,v;B,n;E,v;M,l;E,i;M,n;B,l;B,vn;
+嚯:S,e;
+砰:S,o;E,nr;M,nr;
+岳:B,nr;E,nr;B,n;S,n;E,n;B,ns;E,ns;M,nr;M,ns;B,nt;S,ng;B,nrt;E,nrt;E,nz;E,i;B,nz;
+薹:S,n;E,n;
+讽:B,v;E,v;B,vn;S,vg;B,n;E,vn;E,i;M,i;E,nr;
+亿:B,m;S,m;M,m;E,m;M,l;B,nz;M,nr;E,nr;B,b;E,mq;B,n;
+屈:E,v;B,n;B,v;B,nr;S,v;M,i;B,i;E,i;E,vn;E,n;E,a;M,nr;E,nr;B,ns;B,a;M,n;E,l;
+揍:S,v;E,v;
+乔:B,nr;E,nr;B,n;S,nr;M,nr;B,nrt;B,ns;B,i;M,nz;E,nrt;M,nrt;S,ng;B,v;B,j;B,nrfg;B,nz;M,ns;B,nt;B,b;
+睚:B,i;B,v;S,g;B,nrt;
+寝:B,n;S,ng;S,vg;E,n;E,v;B,l;E,i;M,i;E,nr;B,i;
+黟:B,ns;S,g;
+蓣:E,nz;S,x;
+换:E,v;S,v;B,v;B,nz;B,c;M,l;M,i;B,nrt;M,n;E,vn;B,vn;B,n;E,i;M,nz;M,nr;E,nr;M,j;E,l;
+楦:S,ng;E,n;B,n;M,nr;E,nr;
+烫:S,v;E,z;B,v;B,a;E,v;E,n;B,b;E,b;B,n;E,l;M,nr;
+盯:S,v;B,v;E,z;M,z;
+啮:B,n;S,vg;B,b;B,v;E,v;
+拷:S,vg;B,v;B,n;B,vn;M,v;B,nz;
+葸:E,v;S,g;
+炀:M,nr;B,nrt;S,g;E,nr;
+吃:S,v;B,v;B,a;E,v;M,i;E,a;B,n;B,l;M,l;E,n;B,i;M,n;E,l;E,i;E,nr;B,j;M,v;
+的:S,uj;E,r;E,n;E,z;E,u;E,d;B,u;E,l;B,d;M,l;M,n;E,nz;E,nrfg;M,ns;M,c;E,v;E,b;B,n;E,nr;B,ns;M,nr;E,i;M,i;M,d;B,l;M,nz;E,a;
+娇:B,a;S,v;E,nr;E,v;B,n;S,a;B,v;M,nr;B,z;B,i;M,i;E,n;E,i;M,n;M,z;B,l;E,a;
+甙:S,g;E,nz;E,n;
+疮:E,n;S,n;B,n;M,i;B,i;E,i;M,n;M,nz;
+失:B,v;E,v;E,n;S,v;B,n;B,vn;B,a;M,i;E,vn;E,i;M,l;M,v;B,i;M,n;E,a;E,l;E,z;M,z;M,nr;E,nrt;B,l;B,nz;
+舷:S,ng;E,n;B,n;B,s;B,nz;E,nr;
+参:B,v;B,n;S,n;E,n;M,n;S,j;B,vn;M,l;E,nr;M,nr;B,a;M,nt;B,i;B,z;M,i;B,j;M,ns;E,j;B,nz;B,l;E,nz;E,nrfg;S,vg;B,nt;
+雄:E,n;E,nr;B,n;B,a;S,b;S,ng;B,b;M,l;E,ns;S,nr;M,nr;M,n;B,z;M,ns;B,i;E,v;B,v;E,i;B,l;E,z;M,i;B,ns;M,nz;E,l;E,a;B,nz;E,nrt;B,nrt;M,nrfg;E,nrfg;
+姆:E,nr;M,nr;S,x;E,n;E,nrt;M,ns;E,ns;M,nz;M,n;M,nrt;B,nrt;M,l;E,nz;B,n;M,nt;E,q;B,nr;
+恋:E,v;B,v;S,v;B,n;M,v;E,vn;B,i;M,i;M,l;E,nr;E,n;M,n;M,nz;M,nr;S,vn;
+苌:S,nr;E,nr;M,nr;
+晏:B,nr;E,nr;S,nr;M,nr;B,v;M,ns;M,i;E,i;E,nrt;S,ag;B,nrfg;
+惠:E,vn;B,nr;M,nr;B,ns;S,nr;E,a;E,nr;E,v;S,ng;M,n;B,nz;B,v;E,n;M,l;E,nz;E,ns;E,j;B,nrt;E,i;B,nt;B,i;M,i;S,vg;E,nrt;M,ns;
+蝥:E,n;S,x;
+注:B,v;E,v;S,v;B,n;M,i;E,n;M,n;E,nr;E,i;M,l;E,nz;M,nz;E,l;M,nr;M,nt;E,vn;B,b;B,nz;B,vn;M,v;
+獭:E,n;S,g;M,n;
+问:B,n;S,v;B,v;E,v;E,n;E,l;E,vn;B,vn;E,nr;M,i;M,l;M,n;E,nz;E,i;B,i;B,l;B,nr;M,nt;M,nr;M,v;
+声:B,n;E,n;E,m;S,q;E,d;E,v;M,i;E,ad;B,v;E,nr;M,l;M,n;E,i;B,i;E,b;E,l;M,nr;M,m;B,l;M,ns;E,nz;B,q;E,q;B,j;E,nrfg;E,vn;M,nt;M,z;E,z;M,nz;B,vn;E,nrt;S,m;B,nz;
+嚅:E,v;S,x;E,z;M,z;
+井:E,n;S,n;B,n;B,nr;B,ns;E,ns;B,v;M,n;E,nr;B,s;M,nr;E,v;M,i;B,i;E,nrt;M,nz;E,nz;M,ns;E,i;B,nrt;M,l;B,nz;M,nt;B,z;B,l;
+锘:S,g;E,nr;
+羟:B,n;B,nz;M,n;M,nz;
+质:E,n;B,n;S,ng;M,n;B,v;E,b;E,v;E,l;E,nr;B,a;E,nz;B,j;B,b;M,vn;E,vn;M,l;M,nr;M,nt;B,vn;E,i;M,i;B,nt;B,nz;M,ns;E,a;M,v;B,l;B,i;M,nz;
+个:E,m;E,r;S,q;S,m;B,n;E,b;M,m;B,a;E,d;B,q;E,q;M,n;M,d;M,t;E,t;M,r;B,j;B,v;M,l;B,l;B,r;E,n;B,ns;B,m;M,j;B,vn;M,v;M,nz;M,nr;M,u;
+猬:E,n;S,g;
+缴:B,v;E,v;S,v;E,n;M,n;B,vn;E,vn;B,n;M,nr;E,l;
+蒹:S,g;
+攸:B,v;M,i;B,ns;M,l;
+便:S,d;B,v;E,a;B,a;E,c;E,d;E,ad;E,v;E,n;B,n;E,nr;B,m;B,b;M,l;M,n;M,z;E,z;B,vn;B,y;E,l;M,v;M,i;E,i;M,ns;M,nr;B,i;B,t;M,m;B,ns;E,nz;B,l;
+烁:E,v;S,ag;M,z;E,z;S,g;M,i;E,nr;M,nr;
+兀:S,ag;B,d;E,v;M,nr;E,nr;B,n;M,n;
+盅:S,q;E,n;S,ng;E,nr;B,n;
+鹊:S,ng;E,n;E,nr;B,ns;M,i;B,n;B,i;M,ns;
+拍:B,v;S,v;E,v;B,n;E,n;M,n;B,i;M,i;E,nr;M,l;B,l;E,l;M,v;M,nt;E,vn;M,nr;
+滕:B,nr;S,nr;E,nr;M,nr;M,nz;B,n;B,ns;M,nrt;E,nrt;M,ns;
+哙:E,nr;S,g;
+诧:B,a;E,a;M,l;
+桦:S,nr;B,n;E,n;E,nr;B,ns;M,n;B,nz;M,nr;B,nrt;E,nz;
+饰:E,v;E,n;S,v;M,n;B,n;B,v;E,nr;M,i;E,b;E,vn;M,l;M,nt;B,nz;E,nz;M,nz;
+送:S,v;B,v;E,v;M,n;B,n;M,i;E,vn;E,nr;B,vn;M,l;B,l;E,n;B,i;B,nz;M,nr;E,nz;M,nz;
+阅:B,v;E,v;S,vg;B,vn;B,n;E,vn;E,nr;M,nr;M,n;E,n;
+瞄:B,v;S,v;B,nz;B,n;E,nr;
+舍:E,n;S,v;B,v;B,n;E,i;E,v;M,nr;B,d;M,n;E,nr;E,nrt;B,i;B,nrt;B,s;E,vn;E,ns;M,ns;B,nz;M,nrt;M,i;E,l;M,l;B,nr;M,v;B,ns;
+掌:B,v;B,n;S,n;E,n;S,v;E,v;B,j;B,nr;E,i;B,b;M,nr;M,n;E,nr;B,vn;M,i;E,nz;M,l;B,i;E,l;B,l;
+喘:S,v;B,v;E,n;M,i;M,n;E,v;E,i;B,z;B,vn;E,nz;M,z;E,z;M,v;B,n;
+宜:S,vg;E,v;E,a;E,n;B,ns;E,i;M,nr;B,a;B,v;E,nr;B,nr;M,ns;M,l;B,n;M,i;B,nz;M,n;B,nrt;E,l;E,nrt;E,ns;M,v;E,nrfg;E,nz;
+鲞:S,g;E,n;
+怡:S,vg;E,nr;B,a;M,nr;B,nz;B,n;E,i;B,v;B,i;B,z;B,nrt;B,ns;B,nt;
+春:S,tg;B,n;B,t;E,nr;M,nr;E,ns;E,n;B,nr;E,t;M,ns;M,t;E,vn;M,i;E,v;E,nrfg;B,nz;M,n;B,i;B,v;E,j;B,j;B,l;E,l;M,nz;M,l;E,nz;M,nt;E,i;B,vn;B,ns;B,nrt;M,j;E,nrt;B,nt;M,b;M,nrfg;
+氩:S,n;B,nz;B,n;
+刭:S,g;E,nr;
+沾:S,v;B,v;M,i;B,i;E,nr;B,ns;M,nr;B,l;E,i;
+筇:S,g;B,n;E,nr;
+廊:E,n;S,ng;B,n;B,ns;E,nr;E,ns;
+菌:E,n;S,n;E,v;B,n;M,n;E,l;E,nr;M,l;M,nz;M,b;E,nz;
+杏:S,ng;B,n;E,nr;E,n;M,nr;B,ns;M,n;B,b;M,i;E,nz;B,l;
+觐:E,v;B,v;S,g;M,n;E,vn;M,nr;E,nr;
+浓:B,a;B,n;S,a;B,v;B,z;M,z;M,n;B,l;B,i;B,vn;B,b;E,nr;E,z;M,nr;M,i;E,nz;M,b;M,l;M,ns;E,l;B,nz;
+返:B,v;S,v;E,v;E,l;B,n;E,i;M,l;B,i;E,n;M,i;E,nr;B,vn;B,b;M,n;
+南:E,ns;B,ns;S,f;B,f;M,ns;E,f;E,s;B,t;B,n;B,nr;M,n;M,f;M,nt;E,nr;M,nr;B,j;E,n;B,nt;B,nz;B,nrt;B,vn;M,nz;B,v;B,s;E,nrt;B,l;M,l;B,b;M,i;E,j;B,i;M,j;E,p;E,nz;M,s;E,l;M,nrt;E,nrfg;B,nrfg;
+痘:E,n;B,n;E,v;E,nz;M,n;
+召:B,v;S,nr;E,v;E,nr;S,vg;S,ng;M,n;M,nr;B,n;B,vn;M,ns;E,ns;E,vn;B,i;
+铮:B,a;E,a;M,l;E,l;M,z;B,z;E,nr;M,nr;E,nrfg;B,l;B,v;
+胶:E,n;S,n;B,n;B,ns;B,v;M,n;B,b;B,nz;E,vn;E,nz;M,i;B,l;B,vn;S,v;E,l;M,nz;B,i;E,b;M,l;
+摹:S,v;E,v;B,v;B,n;E,nr;M,nr;
+颇:S,d;B,v;B,d;E,nz;B,l;E,an;M,nz;M,ns;E,nrt;E,z;E,nr;M,i;E,l;
+笆:E,n;B,n;M,n;
+徉:E,v;S,x;
+芋:E,n;B,n;
+紊:B,a;E,i;S,ag;E,nr;
+椒:E,n;S,ng;M,n;E,nr;B,ns;M,nr;E,ns;B,n;E,nz;
+化:E,v;E,vn;B,n;E,n;M,n;S,v;E,j;B,v;M,nz;M,l;E,ns;B,l;E,nr;M,nr;M,nt;E,nz;E,l;M,j;B,nr;M,ns;M,i;B,i;E,i;E,t;E,a;B,vn;E,b;M,t;E,nt;B,nrt;B,ns;B,nz;B,nt;B,b;E,nrt;M,nrfg;E,d;E,nrfg;
+粟:S,nr;E,n;B,nr;E,nr;B,n;M,n;S,ng;E,i;M,nr;B,nrt;
+萤:B,n;E,n;
+梧:B,n;B,ns;E,a;E,nrt;M,n;E,nrfg;M,ns;
+劫:E,v;S,v;B,v;S,n;B,n;M,i;E,n;E,nr;M,n;E,i;B,vn;B,i;B,t;M,l;E,vn;E,l;B,l;M,nr;
+醭:S,g;
+咯:B,o;S,v;E,o;B,v;E,n;M,o;E,nz;M,n;S,y;E,nr;M,nr;
+庳:S,g;
+格:E,n;B,n;E,ad;M,nr;M,ns;B,nr;E,v;S,j;E,nr;B,d;S,n;B,nz;M,n;E,nrt;B,ns;B,nrt;M,nz;M,nt;E,ns;E,nz;M,nrt;E,i;B,v;B,i;E,l;B,nt;M,i;M,v;M,l;E,q;E,a;M,vn;E,b;M,q;B,j;
+剀:E,nr;S,x;M,nr;
+病:E,n;B,n;S,n;E,v;B,v;M,n;E,r;M,i;E,vn;E,nr;E,d;B,vn;B,j;E,l;B,i;B,a;E,i;M,j;B,l;B,z;E,j;M,l;B,nz;M,z;M,nt;B,b;
+蝎:S,ng;B,n;E,n;M,n;E,nr;M,nr;E,v;
+郗:B,nr;E,nr;S,nr;
+埙:S,ng;E,n;
+畚:B,n;
+姝:S,g;E,nr;M,nr;
+鳟:E,n;B,n;M,n;
+慢:B,d;E,d;S,a;E,a;B,b;E,v;B,n;B,z;E,l;E,n;B,v;B,i;B,nz;M,n;M,l;E,vn;M,b;B,l;M,i;E,nr;M,z;B,c;B,t;M,nr;
+武:B,n;B,ns;B,nr;E,nr;B,v;M,n;E,n;S,nr;M,nr;B,l;M,l;M,ns;B,j;S,j;E,v;E,a;E,t;E,ns;B,nt;M,i;B,nz;S,ng;E,nrt;M,nrt;M,nt;E,j;E,i;S,ag;B,a;E,nz;M,b;B,nrt;B,vn;E,nrfg;B,nrfg;B,ad;M,j;E,vn;M,v;M,t;
+俩:S,m;E,r;E,n;B,m;E,m;E,i;M,m;
+浪:S,n;E,n;B,n;E,nz;B,v;B,a;M,n;E,v;E,i;M,i;E,nr;M,l;E,l;B,nz;M,nr;M,nz;E,vn;B,l;E,a;M,ns;M,nt;B,i;M,b;E,ns;B,ns;E,nrt;B,nt;
+瓯:S,j;E,n;B,ns;E,ns;E,nr;B,n;M,ns;
+驰:S,vg;E,v;B,v;B,i;E,nr;M,i;E,i;E,a;E,nz;M,nr;M,nt;E,vn;B,nz;B,l;M,nz;
+绳:B,n;E,n;S,ng;S,nr;M,nr;E,ns;E,v;E,nr;B,i;M,ns;E,nz;E,l;M,n;E,nrfg;B,nz;M,l;S,vg;E,b;E,i;
+佾:S,g;
+犀:B,n;S,ng;B,a;E,n;E,nr;M,n;M,i;M,nr;B,i;
+锅:S,n;E,n;B,n;M,n;E,v;M,l;M,i;E,l;B,l;M,v;E,i;B,nz;E,nrfg;M,nr;E,nr;
+堇:E,n;B,n;
+脍:B,i;S,ng;S,vg;B,l;
+悌:S,g;E,nr;M,nr;
+檐:E,n;S,ng;M,i;B,n;E,nr;M,n;M,l;
+专:B,n;B,d;S,d;B,v;B,vn;B,b;B,a;B,l;M,l;E,j;B,ad;E,n;M,j;B,i;B,nz;E,nr;M,nr;B,j;M,nt;M,n;E,b;M,i;M,b;E,l;E,nt;
+沔:S,g;B,nrt;E,nr;B,ns;
+眙:E,ns;M,ns;S,g;
+挡:S,v;E,v;B,v;E,n;B,n;E,i;M,l;M,n;B,vn;B,i;
+攥:S,v;
+讦:E,vn;S,g;E,nr;
+漩:B,n;
+亨:B,nrt;S,nr;E,nr;M,nr;E,n;M,ns;B,nr;M,i;B,v;B,ns;E,nrt;
+鸳:B,n;M,n;M,nr;M,i;
+耷:B,v;E,nr;M,l;E,z;M,z;
+癃:B,n;S,g;
+铄:E,a;M,i;
+硇:B,ns;B,n;
+密:B,n;E,a;B,ad;E,n;S,a;B,a;B,v;M,n;E,ad;E,nr;B,ns;E,v;M,nr;E,ns;B,z;M,z;E,vn;M,i;E,nrt;B,l;M,ns;E,b;E,i;B,vn;B,nz;B,nrt;B,nr;M,l;M,nt;M,b;B,nt;M,nrt;B,b;M,nz;B,i;M,v;E,nz;
+手:B,n;S,n;E,n;E,v;B,s;B,v;E,d;E,m;M,n;M,i;B,b;S,m;M,nz;B,i;E,a;M,l;E,i;E,b;E,l;B,nz;B,a;M,z;M,v;B,l;B,d;E,nr;M,m;M,nr;E,vn;M,b;B,j;E,nt;M,ns;E,nrt;M,a;E,nz;B,ns;
+背:S,v;B,n;B,v;B,f;E,n;E,v;B,i;B,d;M,i;E,nr;M,n;E,i;E,l;B,vn;M,nr;B,a;B,s;E,ns;E,b;E,a;B,nz;M,l;M,nz;B,l;M,v;
+湓:S,g;
+静:E,a;B,n;S,v;B,v;E,n;E,nr;B,z;M,z;B,nr;S,a;E,v;M,nr;B,a;M,n;B,l;B,ns;E,i;B,vn;E,z;E,l;M,i;B,nz;E,nz;M,nrt;M,vn;B,nrt;M,ns;E,nrfg;M,nz;B,i;M,l;M,nrfg;
+盘:E,n;S,q;E,v;M,n;B,v;B,n;B,s;E,m;M,ns;B,nr;E,nr;E,d;B,ns;B,vn;E,vn;M,i;M,nr;M,l;E,nz;S,m;B,nrt;E,i;B,i;B,a;E,ns;E,l;M,nz;E,nrt;B,nz;B,t;
+荡:E,v;E,vn;S,v;E,an;M,i;B,v;E,a;M,z;E,z;E,i;M,v;B,i;E,n;M,n;M,ns;M,l;E,nr;E,l;E,ns;M,nr;B,n;B,l;B,z;M,nz;
+擤:S,v;
+轩:E,nr;S,nr;B,nr;B,i;B,n;B,a;M,nr;S,ng;M,i;B,ns;E,nz;B,nz;
+滨:B,n;E,ns;E,n;S,ng;B,ns;M,ns;E,nr;M,nr;M,nt;M,nz;E,s;B,nr;M,n;E,nrt;
+僬:S,x;
+筱:M,nr;S,g;E,nr;B,nr;
+劁:S,v;
+馇:S,x;
+薏:B,n;B,nz;
+明:E,v;B,t;B,a;B,v;E,n;E,nr;S,a;E,a;B,ad;B,nr;B,n;M,nr;S,d;M,n;E,d;E,ns;E,nz;M,ns;B,d;E,t;M,i;E,nrfg;E,i;B,i;B,l;B,z;B,ns;B,nz;E,l;M,l;M,z;E,z;M,t;S,ag;M,nt;B,j;B,vn;M,nz;E,nrt;M,v;B,nrt;M,d;M,nrt;M,j;M,b;E,ad;E,vn;B,nrfg;B,b;M,vn;E,q;B,nt;M,nrfg;
+输:E,vn;B,v;S,v;M,n;B,n;B,vn;E,v;B,l;B,ns;M,nt;E,j;E,i;M,nr;B,nz;E,l;E,nr;M,nz;B,j;
+刖:S,g;
+枣:E,n;S,n;B,n;B,ns;B,b;B,nrt;M,n;M,nr;E,i;E,ns;
+榧:E,n;B,n;
+骱:S,g;
+鲵:E,n;S,g;
+狁:S,x;
+遂:S,d;E,nr;S,v;B,v;B,ns;M,nr;E,v;B,n;E,l;E,a;M,i;M,n;B,nrt;E,n;B,i;E,i;M,l;M,nrfg;
+啄:S,v;B,n;B,v;E,i;E,o;
+绉:E,z;M,z;B,n;E,n;
+虎:S,n;E,n;E,nr;B,n;M,nr;M,i;B,ns;E,nz;E,i;B,i;M,n;E,a;B,t;B,nz;E,nrfg;M,ns;B,v;M,l;E,l;E,ns;B,l;B,nrt;B,r;M,v;E,nrt;M,nrfg;M,nz;M,nt;B,z;B,a;B,nr;B,nrfg;M,nrt;
+法:E,n;B,n;S,j;B,ns;E,v;E,vn;M,n;E,a;E,d;E,b;M,l;B,nr;E,nr;B,b;M,nt;B,nz;M,nr;E,nz;E,i;B,nt;E,r;E,l;M,i;M,ns;B,nrt;M,nz;E,j;B,q;M,v;B,j;B,v;M,m;M,j;B,m;M,vn;E,ns;B,vn;M,nrt;B,l;E,nrfg;E,nrt;B,i;M,b;M,q;
+牖:S,g;E,n;
+瑚:E,n;M,n;E,nz;S,x;E,nr;B,n;M,nr;
+恢:B,v;S,ag;B,n;B,a;B,t;E,nr;M,nr;M,l;E,i;M,i;B,b;E,l;
+汪:B,nr;S,v;B,n;E,z;M,z;B,z;S,nr;B,i;E,m;M,i;B,nrfg;E,nr;M,nr;E,ns;B,l;M,ns;S,q;B,nrt;S,m;
+酬:E,n;S,ng;E,v;B,v;B,n;S,vg;E,l;M,n;E,i;M,nz;B,vn;M,l;M,v;
+翳:S,g;E,nr;E,n;E,v;
+乾:S,j;B,nr;B,t;M,nr;E,nr;B,n;S,ng;B,nz;B,j;B,ns;M,i;E,ns;E,nrfg;
+圃:S,ng;E,n;E,nr;M,nr;B,ns;M,n;
+备:E,v;E,n;E,vn;S,v;M,n;B,v;E,a;E,nr;B,n;E,b;B,vn;E,nrfg;M,nt;M,nr;E,l;E,i;M,i;M,l;B,z;B,nz;E,nz;M,nz;B,d;B,b;B,i;M,t;
+耍:S,v;E,v;B,v;B,l;E,n;E,a;M,l;
+谕:S,ng;E,n;B,n;E,v;S,vg;E,nr;M,nr;
+涔:S,g;M,nr;M,ns;E,nr;M,z;E,z;
+瘙:B,a;S,g;
+钚:S,n;
+砝:B,n;
+戡:S,vg;B,v;E,nr;M,nr;
+肢:E,n;S,ng;B,n;M,n;E,v;B,v;E,b;M,i;
+温:B,n;E,n;S,v;B,a;B,nr;E,v;B,an;B,ns;E,nr;M,n;M,nr;E,nz;E,a;B,i;M,l;B,v;B,z;B,nrt;E,b;M,nz;M,ns;B,l;S,ng;M,z;E,nrt;B,j;E,j;E,ns;M,nt;M,i;E,l;B,b;B,nt;B,nz;M,j;
+侨:E,n;B,n;S,ng;B,v;M,n;S,j;M,nt;B,nz;E,nr;E,j;B,j;S,nr;M,ns;M,nr;
+倭:S,ng;B,n;E,v;
+锯:B,n;S,v;E,v;E,n;M,n;B,nz;S,n;M,i;
+皮:B,n;E,n;S,n;B,nr;M,n;E,a;M,l;E,v;M,nr;B,f;E,l;E,nr;B,nrt;M,i;B,i;E,nz;E,i;B,l;E,nrt;M,nrt;E,b;B,ns;M,ns;B,a;E,ns;M,nz;M,v;B,nz;E,vn;
+娱:B,vn;B,n;S,vg;E,v;E,n;E,a;E,nr;M,n;M,nr;
+碲:S,g;B,n;
+撺:B,v;
+贿:E,v;B,v;S,ng;M,n;B,n;B,j;B,i;S,vg;E,i;E,vn;B,vn;M,v;
+睃:S,v;
+捋:S,v;B,v;M,i;
+臌:B,n;S,g;
+敏:E,nr;B,a;S,ag;E,a;M,nr;M,n;E,v;B,n;E,ns;M,ns;E,b;E,nz;E,vn;M,l;E,n;E,l;E,i;E,nrfg;M,nz;
+孛:S,g;E,nr;
+揠:B,i;
+蹩:B,a;
+灭:E,v;S,v;B,v;M,n;E,i;E,nr;B,i;M,i;B,n;E,l;E,vn;M,v;M,l;E,nz;
+寰:B,n;E,i;E,n;E,l;E,nrfg;M,nr;
+巴:B,ns;E,n;B,nr;S,j;M,ns;M,nr;M,n;B,nrt;B,n;E,ns;E,nr;B,v;M,nrt;E,z;M,z;B,nz;M,nz;E,nrt;E,v;B,j;M,nt;B,nt;B,l;E,d;M,d;E,a;E,nz;M,l;M,i;M,v;E,i;E,l;E,o;E,q;B,b;E,b;M,b;B,z;
+喁:S,g;
+邃:E,a;S,ag;E,nr;
+厅:E,n;S,n;B,n;E,nt;E,nr;E,ns;E,s;M,b;B,b;M,nz;M,nr;B,j;E,i;E,nz;
+麇:S,g;E,nr;
+蒋:B,nr;S,j;E,nr;S,nr;M,nr;B,nrfg;B,n;B,l;B,ns;
+笊:B,n;
+芏:S,x;M,nr;E,nr;
+愎:S,g;M,i;E,an;
+窟:E,n;S,ng;B,n;E,ns;M,n;E,i;
+患:B,n;S,v;E,n;B,v;E,i;E,v;B,i;E,j;M,i;M,j;M,n;M,l;E,in;E,l;
+溧:B,ns;S,g;
+咫:M,i;B,n;B,i;B,l;
+鞭:B,n;S,n;B,v;E,n;S,v;E,v;E,nr;M,n;B,i;E,i;M,i;B,vn;S,ng;E,l;E,nz;
+簰:B,ns;
+辽:B,ns;S,j;B,a;E,ns;M,nr;E,nr;B,t;B,j;B,nz;E,n;B,nt;B,nrt;B,s;M,ns;M,i;B,n;E,nrt;E,j;
+呀:S,y;E,e;E,o;M,o;M,y;E,y;E,nr;M,n;E,n;M,nr;M,i;
+秉:M,nr;B,v;S,vg;B,n;E,nr;B,d;B,i;M,nrfg;M,i;
+淑:B,n;E,a;M,nrfg;M,i;E,n;B,nrt;
+毕:B,d;B,v;S,vg;E,v;B,n;B,nr;M,i;B,i;M,nr;B,b;B,ns;E,n;E,nr;E,ns;B,nz;B,nrfg;S,nr;M,n;B,nrt;
+忝:S,vg;E,nr;M,nr;
+神:B,n;E,n;S,n;B,a;M,n;B,l;M,i;E,v;E,nr;M,l;B,nz;B,i;B,nr;B,ns;E,i;M,nr;E,a;B,v;E,nz;E,l;M,nz;B,z;M,ns;B,nt;M,z;B,vn;E,ns;B,b;E,nrt;M,v;M,nrt;M,nt;E,ad;B,nrt;
+浦:B,ns;E,ns;M,ns;B,nt;B,nr;S,j;E,nr;S,nr;M,nz;E,j;M,nr;E,nz;M,nt;B,j;E,nrt;B,nrt;B,nrfg;B,nz;
+歪:S,v;B,v;M,z;B,z;E,i;B,n;B,i;E,a;E,z;E,nr;M,l;E,l;M,nr;M,i;S,a;B,vn;
+陬:S,g;
+狯:E,a;S,g;
+兮:S,y;E,nr;M,z;E,z;E,i;M,l;M,nr;E,l;
+驴:S,n;E,n;B,n;E,nr;M,n;M,i;M,nr;E,i;B,v;E,l;B,i;B,ns;B,l;E,v;
+曷:S,g;
+泻:E,v;S,v;B,n;E,n;B,v;M,i;M,l;M,n;S,n;E,vn;E,l;
+蹼:S,n;B,v;E,n;B,n;
+锁:S,v;E,v;E,vn;B,v;E,n;B,n;M,n;M,nr;M,l;E,nr;M,i;B,nz;B,a;E,nz;E,nrfg;M,v;B,nrt;E,i;M,b;E,nrt;B,ns;
+璀:B,z;B,l;M,l;
+犄:B,n;
+蜍:E,n;S,x;
+暌:S,vg;B,v;
+沐:B,v;S,vg;B,nz;E,nr;M,l;M,nr;E,v;B,i;B,nrt;M,i;
+焙:S,v;B,v;E,v;M,nr;B,nz;E,nr;B,n;
+缝:E,n;S,v;B,n;M,n;B,v;E,v;E,vn;S,n;E,i;B,nz;E,b;E,l;M,i;M,v;M,nz;M,l;B,vn;
+府:E,n;E,nt;S,ng;S,nr;E,nr;S,j;E,l;M,n;B,n;E,ns;M,nr;B,ns;M,ns;M,nt;E,b;B,nrt;M,i;M,j;E,i;E,nrt;B,j;M,nz;
+挥:E,v;S,v;B,v;M,n;E,n;B,n;E,nr;B,i;B,l;E,i;M,i;M,nr;M,nt;E,l;M,l;M,nz;B,vn;
+讪:E,v;B,v;
+圭:E,ns;B,ns;S,j;E,nr;B,n;M,ns;M,nr;M,n;E,n;M,i;B,nrt;M,nt;B,nt;
+羲:E,nr;M,nr;S,g;M,nrfg;E,n;E,nrfg;
+掺:B,v;S,v;B,n;B,nz;B,l;
+伽:B,nr;E,n;B,nrt;B,n;B,ns;M,nz;M,n;
+铀:S,n;B,n;E,n;M,n;M,nr;E,nr;
+埂:S,ng;E,n;M,nr;E,ns;E,nr;B,n;M,ns;
+繇:E,nr;S,p;M,nr;
+桓:B,nr;S,g;E,nr;M,nr;E,v;E,n;B,ns;
+噗:S,o;B,o;
+烘:S,v;B,v;M,z;E,z;B,n;M,l;E,a;E,nr;B,vn;B,i;M,nr;
+络:E,n;E,v;S,v;E,vn;M,n;B,i;B,n;B,l;M,v;E,a;B,v;M,i;M,nr;M,nt;E,nr;E,l;M,l;E,nz;M,b;M,nz;B,b;
+荥:B,ns;S,g;M,nr;E,nr;
+峰:E,n;E,nr;B,n;S,nr;E,ns;M,n;S,q;E,m;M,ns;E,nz;M,nr;B,nz;E,nrt;B,i;M,i;E,j;E,v;S,m;S,ng;M,nz;B,ns;E,nrfg;E,l;
+筵:B,n;E,n;
+龇:S,v;B,i;
+墉:E,nr;M,nr;S,g;E,nrfg;
+怎:B,r;S,r;M,l;B,c;B,l;M,nr;
+吖:S,x;B,n;E,nr;
+刚:S,d;B,d;E,d;B,t;E,nr;B,n;E,n;B,a;M,n;B,ns;M,nr;B,i;B,nr;E,i;E,nrfg;M,ns;B,an;E,a;M,l;M,i;E,ns;B,nt;
+堞:S,g;E,n;
+澧:B,ns;S,j;E,nr;E,ns;M,nr;
+眬:E,v;
+鲱:B,n;
+陂:S,x;E,ns;E,n;B,n;M,ns;B,ns;
+奈:E,d;S,vg;M,i;B,v;M,nr;E,nr;M,d;E,n;M,nt;E,c;E,a;B,ns;E,i;M,ns;B,nrt;M,l;E,ns;B,nz;B,n;E,l;E,v;E,nrt;
+蹒:B,v;M,l;B,vn;
+臣:E,n;S,n;E,nr;B,n;M,nr;E,i;B,v;E,v;E,ns;M,i;M,ns;E,nrt;E,l;S,ng;E,nz;
+痫:E,n;S,x;M,n;M,nz;
+干:S,v;B,n;B,v;B,a;E,n;E,m;B,d;E,v;M,m;M,n;M,ns;B,nr;B,z;E,ns;M,z;E,nr;E,l;B,j;M,l;M,nr;M,i;B,vn;E,a;B,nz;E,i;B,l;B,i;E,nrt;E,j;E,nz;B,ns;M,j;E,z;B,t;M,nrt;E,vn;M,nz;E,b;E,nrfg;
+添:S,v;E,v;B,v;B,n;M,i;E,nr;B,i;B,vn;B,l;M,nr;M,l;E,nrfg;
+轼:E,n;E,nr;S,g;E,nrfg;
+玄:B,nr;M,nr;S,a;B,n;E,nr;B,ns;B,a;M,i;M,nrfg;E,i;B,i;E,n;M,n;
+谑:S,g;E,v;E,z;E,nr;
+徜:B,v;
+颞:B,n;
+搡:E,v;S,v;M,v;E,nr;
+戥:S,v;
+栩:B,i;M,i;B,z;M,z;
+锫:S,g;
+嘭:S,o;
+炮:E,n;B,n;S,n;E,nr;E,v;B,v;E,l;M,n;S,v;E,j;B,ns;M,nt;M,l;M,i;B,i;E,i;B,vn;M,ns;
+就:S,d;B,d;B,v;E,d;E,n;M,l;E,v;B,c;M,i;M,c;E,i;B,n;B,nrfg;M,d;B,i;M,n;E,nr;B,l;E,l;M,nr;B,vn;B,nz;
+纲:S,n;B,n;E,nr;E,n;M,n;E,v;M,nr;M,i;E,nrfg;B,i;M,l;E,b;
+蜷:B,v;S,v;
+贻:B,v;S,vg;B,n;M,nr;B,i;E,nr;
+丽:E,a;M,nr;E,nr;S,nr;B,ns;B,nr;E,z;E,ns;M,i;E,nrt;M,nrt;B,n;M,ns;B,nt;E,n;M,n;B,nrt;S,ag;E,i;B,nz;M,nz;S,vg;E,v;M,nrfg;M,l;E,nrfg;B,a;
+捏:S,v;B,v;E,v;B,l;E,a;M,z;E,z;M,i;M,l;B,nz;B,i;
+诔:S,g;
+块:E,n;E,m;S,q;E,r;E,d;E,s;M,d;B,n;S,m;E,v;M,n;E,i;B,q;M,nz;M,s;E,nz;B,nz;M,l;M,i;
+嵛:S,g;M,ns;M,nr;
+孟:B,nr;S,j;B,ns;M,nr;B,n;E,nr;B,nrt;B,nz;B,a;M,n;M,ns;M,nrt;E,ns;B,t;B,nrfg;M,nt;E,nrfg;B,i;B,nt;E,nrt;
+葡:B,n;B,ns;S,j;B,nz;M,n;B,nt;B,j;M,v;M,nr;E,n;
+无:S,v;B,v;B,d;M,i;B,n;B,c;B,i;E,v;B,b;B,l;B,a;M,l;B,m;B,z;B,ns;B,nz;B,t;M,nr;B,nr;B,vn;E,b;M,n;E,nr;M,nz;E,l;E,j;E,d;E,i;B,ad;B,j;M,b;M,nt;M,m;B,nt;B,an;M,nrfg;
+衩:S,n;E,n;S,x;
+恹:E,z;B,z;M,z;
+裾:S,ng;E,n;
+内:S,f;E,s;B,n;B,f;E,f;B,s;M,n;B,ns;E,u;E,n;M,s;E,t;M,ns;B,v;B,b;B,nr;E,nz;M,nr;B,a;E,ns;E,nrt;E,d;M,nz;E,nr;B,nrt;E,b;B,i;M,j;B,nt;E,r;B,vn;B,j;M,l;M,f;E,j;M,nt;M,nrt;E,l;E,v;M,i;M,d;E,i;E,vn;B,l;E,a;B,nz;B,z;
+鲇:B,n;B,nrt;
+缆:E,n;B,n;S,n;M,n;S,v;E,l;E,nz;E,nr;M,nt;
+安:B,v;S,v;B,an;E,ns;B,ns;B,nr;E,n;E,nr;E,a;B,a;M,ns;E,nz;M,n;B,n;M,nr;E,v;M,nt;B,nz;E,nrt;E,i;B,nrt;M,nz;B,i;M,i;B,j;B,z;E,l;M,z;M,l;B,l;B,nt;B,t;E,z;B,q;B,nrfg;B,vn;M,j;E,m;E,q;E,nt;M,nrt;B,ad;E,nrfg;E,j;E,vn;M,nrfg;E,mq;
+蚋:S,g;E,nr;
+挎:S,v;B,n;
+侑:S,g;E,nr;M,nr;
+誓:S,vg;E,v;B,n;E,n;B,v;B,d;M,i;E,i;E,nr;B,i;M,nr;M,n;M,l;
+洒:S,v;E,a;E,v;B,v;B,a;B,r;M,i;E,i;E,nr;B,l;B,n;M,z;E,z;M,nr;M,l;
+纛:S,g;
+碟:S,ng;S,q;E,n;B,n;M,nr;M,n;E,nr;
+沧:B,ns;M,ns;B,n;B,i;M,i;E,ns;M,l;B,nt;E,nrfg;M,nr;
+伦:B,ns;M,ns;E,nr;M,nr;B,n;E,ns;S,nr;B,nr;M,nt;M,i;E,nrt;B,nt;E,n;B,nrt;S,ng;E,z;M,nz;M,nrt;E,nz;E,i;E,v;M,n;B,l;E,l;B,v;E,nrfg;B,q;
+琬:E,nr;S,g;M,nr;
+媳:B,n;E,n;M,n;S,ng;M,nr;E,nr;M,l;
+破:B,v;S,v;E,vn;E,v;B,n;M,n;M,i;B,i;B,a;E,nrt;B,vn;E,i;B,l;M,nr;M,l;B,z;M,z;E,nr;E,l;B,ns;M,v;B,t;E,n;M,nt;
+莹:E,a;E,nr;S,nr;M,nr;M,i;M,z;E,z;B,a;B,nr;B,nz;
+镂:B,v;B,vn;E,v;B,n;B,i;E,i;M,i;
+濑:B,ns;B,nr;E,nrt;B,nrt;E,ns;
+乐:E,n;B,n;B,a;M,n;S,a;E,a;B,nr;E,vn;E,nr;E,ns;E,v;B,v;M,nt;B,ns;M,i;M,nz;M,nr;M,ns;M,l;E,i;E,nz;E,t;B,i;E,nrt;S,v;B,z;B,nrt;B,nz;E,l;B,l;M,v;E,b;M,z;E,z;M,t;E,nt;E,nrfg;M,j;
+铗:S,g;
+叙:B,v;S,v;B,ns;B,n;E,v;B,vn;E,nr;M,nr;E,n;M,n;B,l;M,l;B,nt;E,i;M,ns;
+黛:B,nr;M,nr;S,ng;E,nr;E,n;B,n;B,nrt;M,nrfg;
+川:E,ns;E,n;S,j;M,ns;E,nr;B,ns;M,nt;B,nr;E,nrt;M,nr;B,n;E,nz;B,nz;B,j;M,nz;M,n;B,i;E,l;B,nrt;E,i;M,t;E,d;E,nrfg;M,i;
+食:B,n;E,n;S,v;E,v;B,v;M,l;M,n;E,i;B,l;B,b;M,i;M,nr;B,i;M,nt;E,l;E,b;M,nz;E,vn;B,nz;M,ns;E,nz;E,j;B,vn;
+苣:S,x;E,n;M,nr;B,n;
+敢:E,d;S,v;B,n;E,a;B,v;E,v;M,l;B,d;B,i;M,i;E,nr;M,nr;B,l;M,n;M,v;
+潦:B,a;M,i;M,l;
+烯:E,n;S,x;B,n;M,n;M,nz;E,nz;E,nr;M,nr;B,nz;
+卮:S,g;E,nr;
+鹰:S,n;E,nr;E,n;B,n;E,nz;M,nr;B,nz;M,n;M,nz;B,ns;B,b;B,nrt;B,i;M,ns;B,l;E,nrt;
+霁:S,vg;E,nr;M,nr;B,i;B,n;M,i;
+刃:S,ng;E,n;M,i;M,n;E,i;B,n;E,nr;M,nr;B,v;E,v;
+窈:B,a;B,i;M,nr;
+源:E,n;S,ng;B,v;B,n;E,nr;M,n;M,v;E,ns;E,v;E,l;E,nz;M,nr;B,i;M,ns;M,i;M,nt;M,nz;M,b;E,i;E,nrt;E,b;B,d;E,d;B,nrt;B,nz;E,vn;E,nrfg;E,nt;E,j;B,ns;M,nrfg;M,j;
+醚:E,n;S,n;E,nz;E,nr;
+岜:S,g;
+逯:S,nr;B,nr;
+玮:S,nr;E,nr;M,nr;E,nrfg;E,a;
+弱:S,a;E,a;E,v;B,n;E,n;B,v;E,l;E,ad;B,a;M,l;M,n;E,z;M,i;E,i;B,i;B,b;E,nr;M,j;M,nr;M,nz;
+架:E,n;S,q;S,m;E,m;E,v;B,n;B,v;M,n;B,s;B,vn;E,ns;M,ns;E,nz;M,l;M,i;E,vn;B,m;M,m;E,nr;B,q;B,ns;M,v;E,i;B,nz;M,nz;M,b;
+雀:E,n;S,ng;M,i;B,n;M,n;M,nr;M,ns;M,l;B,nz;E,i;B,ns;B,v;E,nr;B,nt;M,b;E,l;E,ns;
+郄:S,nr;B,nr;
+忆:E,v;E,n;E,nr;M,n;S,v;M,i;M,nr;B,v;B,nr;B,l;B,vn;E,l;B,n;S,vg;M,nz;
+晋:S,j;E,t;B,nr;B,ns;E,j;E,nr;B,v;E,n;M,nr;B,j;B,t;B,nz;B,nt;S,v;B,nrt;B,n;E,ns;M,ns;B,vn;M,l;M,nt;E,nrfg;M,i;B,i;
+姊:B,n;S,n;M,nr;M,n;E,nr;
+裔:E,n;S,nr;E,nr;M,nr;
+呗:S,y;E,o;
+幛:E,n;
+糜:B,nr;B,v;S,nr;E,n;B,a;B,n;E,nr;B,vn;E,nz;
+腥:S,a;E,a;B,n;B,a;M,n;E,n;M,i;B,i;M,nz;
+罱:S,v;S,n;
+课:B,n;S,n;E,v;E,n;B,t;B,v;B,b;M,n;E,vn;E,nr;E,j;
+傅:E,n;B,nr;S,nr;E,nr;E,nz;M,nr;B,nrfg;M,i;B,ns;M,l;B,v;
+螋:S,x;E,n;
+膏:E,n;S,v;B,n;M,n;E,nz;M,i;E,i;E,l;B,i;M,l;M,nz;
+戎:S,nr;B,nr;E,nr;B,n;B,i;M,nr;B,v;M,i;E,n;E,i;E,nrt;E,v;B,l;
+云:S,n;B,ns;E,nr;E,n;B,n;M,nr;B,nr;E,ns;M,ns;M,i;B,v;E,v;B,nz;M,n;B,nt;B,j;E,i;E,z;E,nz;E,l;M,l;B,l;M,nz;E,nrt;B,i;B,nrt;M,nrfg;B,s;E,nrfg;M,nt;B,u;E,u;
+疗:E,v;E,n;B,n;M,n;B,v;S,vg;E,vn;M,l;E,l;E,j;M,nz;
+倚:S,v;B,v;E,nr;E,i;E,v;B,i;M,nr;E,l;B,n;M,i;
+掣:S,v;B,v;E,i;M,l;B,vn;E,v;
+涧:S,ng;E,n;E,nr;B,ns;M,nr;E,ns;E,nrt;M,ns;
+垫:S,v;E,n;B,n;B,v;M,n;B,nrt;E,v;B,ns;E,nz;B,nz;
+钭:S,nr;B,nr;M,nr;E,nr;
+甬:B,n;S,j;B,ns;M,nr;M,ns;E,nr;B,j;B,nz;
+冯:B,nr;S,nr;S,m;E,nr;M,nr;B,nrfg;B,ns;E,nrt;M,i;
+缰:B,n;S,ng;E,v;E,i;M,n;M,nr;M,i;
+害:E,v;B,v;E,n;E,a;S,v;M,n;B,n;E,l;B,a;E,vn;E,i;M,i;E,b;M,nz;E,nr;B,i;M,v;E,j;M,l;M,vn;B,nz;
+礴:E,i;E,v;E,vn;S,x;
+芹:E,nr;B,n;S,nr;M,nr;S,ng;E,n;
+洼:B,n;E,a;S,a;E,n;M,l;E,l;M,n;E,nr;M,nr;E,ns;B,ns;E,nz;M,ns;E,an;
+址:E,n;S,ng;E,v;E,nr;E,ns;E,vn;M,ns;M,nr;M,n;
+兄:B,n;E,n;S,ng;E,nr;M,nr;M,n;M,l;M,j;M,nt;B,i;B,l;
+鹆:S,x;E,n;
+操:B,v;S,v;E,nr;B,n;E,n;B,nr;B,l;M,n;E,l;B,i;M,l;E,v;M,i;S,n;E,vn;M,nr;M,nt;B,a;B,vn;
+滑:E,v;S,v;B,v;B,n;E,a;M,n;B,a;B,vn;B,nr;E,vn;B,ns;E,n;B,l;E,z;B,nz;M,i;B,z;M,nz;E,nr;E,i;M,nr;E,l;M,l;B,i;M,ns;
+佐:S,vg;E,v;E,nr;M,nr;B,n;B,nrt;B,v;B,ns;E,n;B,vn;M,ns;B,nr;E,nrt;M,nrt;B,nt;E,nrfg;E,nz;
+棕:B,n;S,ng;B,b;E,n;E,nr;B,ns;M,nz;M,n;E,b;M,nr;
+癖:S,ng;E,n;B,n;
+矫:B,v;S,nr;B,a;B,nr;B,vn;B,i;B,n;E,nr;B,b;S,ag;B,nz;M,nr;E,a;
+镬:S,g;
+饴:B,n;E,i;E,n;M,i;
+旷:S,a;B,nr;B,n;E,a;E,nr;S,nr;B,i;M,i;M,nr;B,b;B,a;B,d;B,v;M,z;E,z;E,i;M,l;
+荸:B,n;
+槿:S,x;E,nr;E,n;M,nr;M,n;
+阁:E,n;E,nr;S,ng;B,n;E,v;M,n;E,ns;M,nr;E,l;E,nz;E,i;M,ns;M,i;
+瞀:S,g;
+逅:E,v;S,x;M,i;
+熄:B,v;S,v;B,n;M,l;E,n;M,n;B,vn;E,v;M,nr;
+崇:B,nrt;B,v;M,nr;S,nr;E,v;B,a;B,ns;E,nr;B,i;B,nz;S,vg;B,n;M,l;B,t;B,nt;E,vn;M,i;S,ag;
+萍:E,nr;S,nr;B,ns;M,nr;E,n;B,n;B,i;
+斌:E,nr;S,nr;M,nr;E,nrfg;
+蠕:B,v;B,n;B,z;E,z;B,l;
+榔:E,n;B,n;
+厘:B,m;B,q;S,q;M,m;M,q;E,ns;E,q;B,vn;M,nr;M,ns;B,v;E,n;B,n;E,i;M,n;M,i;
+骞:E,nr;S,g;M,nr;E,nrfg;
+急:S,v;E,a;B,d;B,n;B,v;B,a;B,z;E,vn;E,i;B,i;B,b;M,i;E,v;M,l;M,z;B,ad;B,l;B,vn;E,n;E,b;M,j;M,n;E,z;E,l;B,nz;M,nz;B,j;M,nt;
+吭:B,v;S,v;E,l;B,o;M,i;E,v;E,nr;
+鄯:B,ns;S,g;
+粲:B,a;
+堵:B,v;S,v;E,v;E,m;B,nr;E,vn;E,i;E,j;M,n;B,vn;B,n;M,ns;M,l;M,nr;
+蔷:B,n;M,n;M,nr;
+哂:S,vg;B,v;
+运:B,n;B,vn;B,v;E,n;E,v;S,v;M,nz;M,n;M,l;E,vn;M,j;E,a;E,j;M,ns;B,l;E,nr;M,nr;M,i;B,ns;M,v;B,nz;E,nz;B,i;M,nt;B,j;E,l;E,nt;E,i;B,nt;
+柠:B,n;B,nz;
+瑭:E,nr;S,g;M,nr;
+嗬:S,e;B,e;E,nr;
+批:E,m;B,v;S,q;E,v;B,n;B,vn;E,d;B,d;M,m;M,n;S,m;E,b;M,l;E,n;B,l;E,vn;B,m;M,ns;B,j;B,i;
+胺:E,n;S,n;E,nz;M,n;B,nz;M,nz;E,nr;M,nr;
+汽:B,n;E,j;E,n;M,nt;M,n;M,l;B,v;B,j;M,nz;B,nz;B,ns;E,nt;M,ns;
+妁:E,n;
+待:E,v;S,v;B,n;E,i;B,v;M,n;M,i;M,l;E,n;B,d;B,vn;B,i;M,nr;E,vn;E,nr;B,l;E,l;M,nz;
+喉:B,n;S,ng;E,n;M,n;E,v;B,nz;E,i;M,nz;E,l;
+袋:E,n;S,q;E,m;B,n;M,n;E,nz;B,s;E,mq;B,b;E,nr;S,m;E,i;E,l;E,ns;M,nrt;
+躏:E,v;E,vn;S,x;
+洎:E,nr;S,g;
+窗:B,s;B,n;E,n;S,ng;E,v;E,nz;M,i;E,nr;B,i;S,q;M,nr;E,i;B,b;
+外:B,n;S,f;E,c;E,s;E,f;B,f;E,vn;E,a;E,v;B,v;E,d;M,l;M,n;E,n;B,b;E,j;E,l;E,b;M,nt;E,i;B,nt;B,s;M,i;B,ns;E,nr;B,vn;B,j;E,ns;M,j;M,v;B,nz;E,u;M,nr;B,l;M,nz;E,t;B,a;E,nz;B,i;B,nrt;E,nrt;M,d;M,z;
+沣:S,nr;E,nr;B,ns;M,nr;
+萨:B,nr;E,n;M,ns;E,nr;E,ns;M,nr;S,nr;B,ns;M,n;S,j;B,nrt;B,n;M,nz;E,nrt;M,nrt;B,nz;M,l;M,nt;B,j;B,nrfg;E,nz;
+咳:B,v;S,v;E,vn;E,v;B,nz;E,n;B,n;M,n;S,e;B,i;M,nz;
+瘴:M,i;B,n;E,n;
+永:B,d;M,nr;B,ns;S,d;E,nr;B,nz;B,nr;B,n;B,b;B,z;B,v;B,t;B,l;B,nrt;B,nrfg;E,a;M,nrfg;B,i;E,nrt;M,l;M,i;E,ns;E,nrfg;B,nt;E,i;B,vn;M,ns;
+莽:E,nr;E,nz;S,nr;E,a;E,nrfg;B,a;E,n;M,nr;B,z;M,n;E,z;B,n;M,z;S,ag;B,ns;
+私:B,n;B,a;S,ag;B,b;B,d;E,n;B,v;E,vn;B,vn;M,i;M,n;E,a;E,v;E,i;E,b;E,l;M,l;B,j;E,d;E,nr;E,j;B,l;B,i;
+魂:E,n;S,n;M,i;B,n;E,v;B,i;M,n;E,a;E,b;B,l;E,nr;E,i;M,nr;E,l;M,nz;
+翅:S,ng;B,n;M,n;M,nr;E,v;E,n;M,i;E,nr;E,nrt;M,nz;
+幄:E,i;S,g;E,n;M,n;
+酆:S,nr;B,nr;E,nr;
+痉:B,vn;B,n;M,n;
+呈:S,v;B,v;E,v;M,nr;E,nr;E,n;B,n;E,i;E,l;M,i;B,nr;B,ns;
+母:E,n;B,n;S,b;E,nr;M,n;B,nr;M,nr;S,ng;B,b;E,l;M,l;M,ns;E,nz;E,j;B,i;B,t;E,ns;M,nz;B,j;E,i;M,i;
+赎:B,v;B,vn;S,v;B,n;M,i;
+懑:E,a;S,g;E,n;
+荒:B,n;B,a;S,v;E,v;E,n;S,ng;M,i;B,v;B,i;E,ns;E,i;M,n;B,l;M,nr;B,ns;E,s;M,l;B,vn;E,l;B,nrt;E,j;E,nr;M,ns;
+祖:B,n;E,n;E,nr;B,nr;M,n;S,nr;M,nr;S,ng;E,nrt;B,vn;E,v;B,nrfg;B,l;M,i;E,ns;E,i;M,l;B,i;M,ns;B,nrt;B,ns;E,vn;M,nrfg;E,nrfg;M,nz;
+郛:S,g;
+罚:E,vn;S,v;E,v;B,v;E,n;B,n;M,n;M,i;M,l;B,j;E,i;B,vn;
+止:E,v;S,v;B,v;E,u;E,l;E,n;E,i;B,d;B,n;M,n;E,vn;B,vn;M,l;B,nr;M,i;E,nr;M,nr;B,l;B,i;B,nz;
+杪:S,g;M,nr;E,nr;
+马:S,n;B,nr;E,n;B,n;E,ns;B,ns;E,v;M,ns;M,nr;B,d;M,n;E,nr;E,nz;M,i;B,nrt;M,nrt;E,d;E,i;B,q;E,nrt;M,nz;B,nz;B,nrfg;B,i;E,l;B,a;M,l;B,j;M,nt;M,m;B,l;M,b;M,v;M,nrfg;B,m;B,nt;E,vn;B,t;E,nt;M,d;B,b;E,t;
+绯:B,n;B,z;
+陴:S,g;
+豸:E,n;S,g;M,ns;
+替:S,p;E,v;B,v;B,n;E,n;B,i;B,vn;E,i;E,vn;M,n;E,l;M,nz;M,nr;M,l;S,v;E,nz;B,nz;
+切:E,r;E,ad;E,a;B,v;S,v;B,ad;B,n;E,v;B,d;M,i;E,vn;E,i;B,l;M,nr;B,vn;M,n;B,nrt;E,nr;M,l;E,n;E,d;M,z;E,z;B,i;E,l;B,ns;B,b;B,nz;M,nrt;E,ns;B,z;B,a;M,ns;B,nt;M,nz;E,nrt;E,nz;B,nr;
+锉:S,n;S,v;B,n;E,n;
+脑:B,n;E,n;S,n;M,l;E,i;M,n;E,l;M,i;M,v;B,l;E,nt;E,nz;E,v;B,v;E,z;B,i;E,d;M,nz;E,a;M,nt;B,nz;
+蜕:S,vg;B,v;E,n;B,i;B,n;
+首:B,n;B,m;B,d;S,m;B,t;E,v;B,v;E,n;B,b;E,m;B,i;E,i;M,i;B,vn;E,f;M,m;M,nr;B,nz;B,ns;E,ns;M,n;B,nt;M,ns;M,l;E,t;B,j;E,nr;B,l;E,l;M,nt;E,d;E,j;M,nz;M,nrfg;
+岘:E,nr;S,g;B,ns;E,ns;
+龚:B,nr;S,nr;M,nr;E,nr;B,nrfg;B,ns;
+猝:B,i;B,v;E,z;B,d;S,dg;B,n;
+订:E,v;B,n;B,v;S,v;B,vn;M,n;B,b;E,vn;
+交:B,n;B,v;E,v;M,n;S,v;B,vn;M,j;M,nt;E,n;B,j;E,b;B,l;M,i;E,vn;B,nt;M,v;M,nz;E,i;B,i;M,l;B,ns;E,nr;E,l;B,t;B,nz;B,b;M,ns;M,nr;B,nrt;E,j;B,d;B,a;
+膦:E,n;S,g;
+鸯:E,n;S,x;E,nr;M,n;E,i;M,nr;
+綮:S,x;
+玲:E,nr;M,nr;B,a;S,nr;M,i;B,i;E,nrfg;
+耻:E,a;B,n;E,n;S,v;E,i;B,v;M,i;M,n;E,l;E,v;M,l;B,vn;E,nr;B,i;E,an;
+寂:B,a;E,v;E,a;S,ag;B,z;E,an;E,i;E,z;E,nr;M,i;B,v;M,n;B,l;M,nr;
+黄:B,n;B,nr;B,ns;S,a;B,t;E,n;M,n;E,b;E,z;E,nr;B,j;B,nz;B,nrfg;B,nt;M,nr;E,v;M,i;B,l;M,ns;E,j;M,l;E,nz;B,z;E,ns;B,i;B,v;E,nrt;E,i;M,nz;M,z;M,nt;E,a;B,b;B,nrt;M,v;M,j;
+片:E,n;E,m;S,q;B,m;B,n;M,nz;E,v;M,n;B,a;B,b;S,m;E,nz;E,r;M,nt;M,m;E,l;B,s;B,nz;M,i;E,vn;B,i;M,z;E,z;E,b;M,l;B,d;B,nr;E,i;M,nr;E,nr;E,ns;M,b;B,v;B,q;M,v;B,nrt;
+准:B,v;E,n;E,v;S,a;B,n;B,a;B,ns;M,n;M,vn;M,nz;E,nr;M,l;M,v;E,a;B,d;B,vn;M,t;M,nt;E,d;B,nz;M,nr;E,b;B,l;B,ad;E,nrfg;B,j;E,j;E,i;M,d;M,i;
+铈:S,n;M,n;E,nz;
+蛔:B,n;M,n;
+棠:E,n;E,nrfg;M,n;E,nr;B,n;E,ns;B,ns;
+滤:S,v;E,v;B,n;M,n;B,v;B,nz;M,nz;E,n;E,nr;B,nrt;
+围:E,n;E,f;B,v;S,v;E,v;B,n;M,n;E,nr;B,vn;M,l;E,l;B,i;M,nr;B,l;M,i;E,ns;E,b;M,ns;M,nt;B,ns;B,nz;E,nz;
+墁:S,v;
+稂:S,g;M,i;
+瘊:B,n;
+辏:S,ng;E,v;
+戒:E,n;B,n;S,v;B,v;E,vn;E,v;M,n;B,i;E,i;M,i;B,vn;B,ns;E,l;M,l;M,t;M,nr;B,a;B,nz;E,nr;
+算:E,v;S,v;B,v;M,n;E,n;E,vn;E,d;B,n;E,l;E,a;B,l;E,i;M,nt;M,i;M,b;M,v;E,nr;E,j;E,b;M,l;B,vn;M,nr;B,i;M,nz;
+帚:E,n;S,ng;M,n;M,i;
+瞟:S,v;B,v;
+吞:B,v;S,v;M,i;B,n;E,v;B,i;B,vn;M,z;E,z;B,l;M,n;M,ns;B,ns;E,a;E,n;E,i;
+涣:B,v;M,i;B,i;
+控:B,v;E,vn;E,v;S,v;B,n;E,j;B,vn;E,b;E,n;M,n;M,nz;B,nz;E,nz;B,l;M,nt;B,j;
+妫:S,g;B,nr;E,nr;
+第:B,m;S,m;B,nz;B,t;B,n;E,nr;M,n;B,l;M,ns;E,n;B,b;M,nt;M,l;M,m;B,nt;B,ns;E,v;E,nz;M,nz;E,nrt;M,nr;E,m;E,i;B,nrt;B,nr;E,ns;E,l;E,d;M,i;B,mq;M,nrt;
+邱:B,nr;S,nr;M,nr;E,nr;M,ns;E,ns;B,ns;
+焰:E,n;B,n;M,n;E,nrfg;E,l;M,i;E,nr;
+喳:E,o;M,o;S,o;B,o;
+芽:E,v;S,n;E,n;B,n;E,nr;M,n;M,nr;E,vn;M,l;M,nz;B,nrt;
+磁:B,n;M,n;S,ng;E,n;B,v;M,l;B,ns;B,nz;E,nz;B,vn;M,nr;E,v;M,b;B,b;M,ns;E,j;
+绅:E,n;B,n;E,l;B,nz;E,nz;
+惑:E,v;E,a;E,vn;S,v;M,i;M,n;E,l;M,l;B,v;E,n;E,nr;S,vg;M,nr;B,i;
+硖:S,g;B,ns;E,nr;
+峙:E,v;S,vg;E,nr;M,ns;E,ns;M,nr;
+瑞:B,ns;E,nr;S,j;M,nr;B,nr;B,j;M,ns;E,nz;B,n;B,nt;B,nrt;B,nz;M,nz;E,nrt;E,a;M,nt;S,ng;M,n;M,nrt;E,n;E,nrfg;B,q;E,v;
+跣:S,g;M,i;
+以:S,p;B,f;E,v;B,c;E,c;E,d;B,v;B,d;M,l;M,i;B,t;M,nr;B,ns;B,i;B,l;B,n;B,nz;B,p;B,nt;B,j;M,n;E,i;B,nr;E,nz;E,nr;M,nrfg;E,n;
+秫:B,n;
+酰:B,n;M,n;S,x;M,nz;E,n;M,l;E,nz;
+割:E,v;S,v;B,v;E,l;E,n;M,n;B,n;M,l;B,vn;B,nrt;E,i;M,i;E,vn;M,t;B,i;M,nz;
+靴:S,ng;B,n;E,n;E,nz;B,nz;M,i;M,nz;
+荼:E,i;B,v;M,n;
+柿:S,ng;B,n;E,n;M,nr;E,nr;B,ns;
+禀:B,v;E,v;B,n;
+崃:S,g;M,ns;E,ns;M,nr;E,nr;
+伏:E,v;S,v;B,nr;B,ns;B,v;E,j;B,n;E,i;E,nr;M,t;M,nr;E,m;B,q;E,l;E,t;M,i;B,t;M,l;E,q;B,nz;M,v;S,q;M,n;E,n;E,vn;B,a;E,mq;B,nt;M,ns;B,vn;S,vn;B,l;M,m;
+颖:S,nr;E,a;E,nr;M,i;M,nr;B,n;B,a;M,n;E,nrfg;
+爝:S,x;
+钞:S,ng;B,n;E,n;E,nr;M,n;M,nr;E,vn;M,nt;
+校:E,n;B,n;S,ng;E,j;E,l;B,v;M,n;E,r;E,v;E,nt;E,nr;M,nr;E,b;B,s;B,vn;S,v;E,vn;B,f;B,nz;B,j;B,b;M,nt;M,nz;B,ns;
+渥:B,ns;E,a;M,nt;
+蚪:E,n;S,x;
+鼯:B,n;
+粮:B,n;S,n;E,n;M,n;B,l;E,j;E,v;B,j;M,nt;E,nr;M,i;E,i;E,ns;M,ns;B,nt;M,nr;M,j;M,nz;B,i;E,vn;B,nz;M,l;
+溺:S,vg;B,v;E,v;B,n;E,n;
+蜿:B,v;B,z;
+嫂:B,n;E,n;S,ng;E,nr;M,n;M,nr;
+囊:E,n;S,ng;B,n;B,v;B,s;M,n;E,a;E,nr;M,i;E,i;M,z;E,z;B,i;E,v;B,l;E,nz;B,nrt;M,ns;B,ns;
+诌:S,vg;E,v;
+字:S,n;E,n;B,n;M,n;E,v;E,nz;M,l;E,l;M,i;M,vn;E,vn;B,i;E,i;M,nr;M,v;E,nr;M,nt;M,nz;M,b;M,ns;E,b;E,d;B,nz;B,nrfg;B,ns;
+坟:S,n;B,n;E,n;E,v;M,i;E,ns;M,n;
+衡:E,a;E,v;B,v;E,nr;B,ns;E,n;M,n;S,nr;B,nr;E,i;M,nr;E,nz;B,n;M,i;E,vn;E,ad;M,nz;E,b;E,l;B,nrt;M,l;E,nrfg;B,b;M,v;B,nt;
+槠:E,n;S,g;E,nr;
+葩:E,n;S,ng;E,nr;
+旨:S,ng;E,n;B,v;B,n;E,v;E,nr;M,nr;M,n;E,i;
+凰:E,n;M,ns;S,ng;M,nz;E,nr;E,l;M,n;E,nz;M,i;M,nr;S,x;
+埴:S,g;
+汹:B,v;E,i;M,i;B,n;E,z;B,z;M,l;B,i;B,a;M,z;
+宁:E,nr;E,ns;B,ns;M,ns;S,j;B,nr;M,nr;B,d;E,a;B,a;E,nrt;E,nz;M,n;B,nrfg;M,nt;B,n;B,v;E,j;E,nrfg;E,n;E,i;B,i;E,c;M,nz;M,i;B,nz;B,nrt;M,nrt;S,d;M,j;B,nt;B,c;M,l;E,v;B,l;
+蚓:E,n;S,x;
+碗:S,q;E,m;E,n;B,n;M,n;S,m;M,ns;S,n;M,nr;M,l;E,nr;M,i;M,nz;E,l;B,nz;E,v;
+嬖:S,g;
+谤:E,v;S,g;M,n;B,v;E,vn;
+砬:B,n;S,g;
+爰:S,g;E,nr;M,nr;
+琴:E,n;S,n;E,nr;B,n;M,n;M,ns;E,v;M,nr;E,nz;B,nrt;B,i;E,i;E,ns;E,l;M,l;B,ns;E,nrfg;M,i;M,nrt;B,nrfg;E,nrt;E,q;
+边:S,d;E,f;E,s;E,d;B,n;E,n;E,r;B,s;B,nr;E,ns;E,z;B,f;E,b;M,n;M,ns;E,nr;E,v;B,b;M,i;M,v;M,l;B,v;M,nr;E,nrt;E,l;E,nrfg;B,j;E,i;B,p;M,nz;E,j;M,j;B,nrfg;M,nt;M,f;E,nz;M,a;E,vn;B,nz;
+游:B,n;E,n;S,v;E,vn;B,v;E,f;M,n;B,vn;E,v;B,nr;B,b;E,nr;E,j;M,l;B,i;M,nt;M,ns;E,nz;M,v;M,i;B,l;E,ns;E,l;M,nr;M,nz;E,i;E,nrt;M,j;
+怼:S,g;E,v;
+篁:S,g;E,ns;E,nr;E,n;
+婀:B,a;B,i;
+镊:S,v;B,n;
+策:E,n;B,n;E,nr;S,ng;B,v;M,n;E,v;E,i;B,vn;M,nr;E,l;M,nt;E,nz;B,ns;M,i;E,vn;M,nz;B,nrt;M,nrt;E,nrt;
+忙:S,v;E,d;E,v;E,ad;E,a;B,a;B,v;M,z;E,z;E,nr;E,i;M,i;B,d;E,n;B,z;E,l;M,l;B,i;B,l;M,nr;B,n;M,n;M,d;
+凝:B,v;M,n;S,vg;B,n;B,a;E,vn;B,nr;E,nr;M,nr;B,nz;E,v;M,i;B,z;B,l;B,vn;E,n;M,nz;E,a;
+铟:S,n;E,nz;E,n;E,nr;
+胧:E,a;S,x;M,z;E,z;E,nr;M,n;
+糯:S,ng;B,n;E,b;S,ag;
+窀:S,x;B,n;
+布:E,v;B,n;B,nr;E,n;S,n;B,v;M,ns;M,n;B,ns;E,nr;M,nr;B,nrt;E,ns;B,nz;M,nrt;E,nrt;E,i;E,nz;M,b;B,l;M,i;M,l;B,vn;M,nt;E,vn;E,l;B,j;B,nt;S,v;B,b;B,i;M,nz;
+霉:M,n;E,a;B,n;S,n;S,v;E,n;E,v;B,v;M,nz;E,l;B,a;M,v;B,vn;
+皈:B,v;M,n;
+茑:S,g;
+缙:B,n;S,g;B,ns;E,nr;M,nr;E,nrfg;
+次:E,m;E,r;E,d;S,q;S,m;B,t;E,c;M,nz;B,n;E,n;M,v;E,t;E,b;M,d;B,b;E,mq;B,v;M,m;E,v;E,i;M,n;M,ns;M,nr;E,l;E,q;M,l;E,ns;M,i;B,q;M,mq;B,d;B,nz;B,l;E,nr;B,nrt;B,ns;
+津:E,ns;S,j;M,ns;E,nr;M,nt;B,n;M,nr;B,ns;M,i;B,i;E,nrt;E,j;B,j;B,nz;E,v;M,nz;E,l;M,n;E,i;E,n;M,z;E,z;M,l;E,nt;B,nt;B,nrt;B,nr;E,nrfg;
+薪:B,n;S,n;E,nr;E,n;E,v;E,i;M,n;M,i;S,ng;M,nr;M,l;E,l;
+夭:B,v;S,vg;S,ng;E,i;M,i;E,nr;M,nr;B,a;
+阳:E,ns;E,n;B,n;E,nr;M,ns;M,n;B,nr;M,nr;S,b;S,ng;B,ns;M,nz;E,v;S,nr;E,t;B,v;E,nz;E,nrt;M,l;M,t;M,nt;M,i;M,nrfg;B,nrt;B,i;E,b;B,nz;B,nt;E,l;B,a;E,nrfg;E,i;B,l;S,j;E,nt;E,vn;S,ag;E,j;
+舻:S,g;E,n;
+髀:S,g;B,i;
+鳄:S,ng;E,n;B,n;
+俎:S,nr;M,i;E,n;E,i;M,nr;
+晓:M,nr;B,v;E,v;B,nr;S,vg;E,nr;E,i;E,t;M,nrfg;B,i;E,l;M,l;B,ns;M,n;E,nz;E,n;B,n;B,nrt;E,vn;E,nrfg;
+绘:B,n;E,v;S,v;B,v;E,n;E,vn;B,i;M,i;E,nr;M,n;M,nr;B,vn;M,nz;M,nt;
+酝:B,v;B,t;
+祭:S,v;B,v;B,n;E,v;M,nr;S,vn;B,vn;E,nr;E,l;E,n;E,vn;
+壬:B,m;B,n;B,ns;
+勰:S,g;E,nr;M,nr;
+诶:S,e;
+跺:S,v;B,v;M,v;
+蟾:B,n;E,nrfg;E,nrt;B,i;M,nz;
+龃:B,n;
+砂:B,n;S,n;E,n;M,n;M,i;E,nr;B,nz;E,nz;E,b;M,nz;E,ns;M,ns;E,v;M,nr;
+醇:E,n;S,ag;E,nz;B,a;E,nr;M,nz;E,a;B,n;B,nz;M,n;E,nrt;B,i;M,nr;B,z;M,i;
+爆:B,v;E,a;B,n;S,v;E,v;B,vn;M,n;E,nz;M,nz;E,b;B,b;E,l;E,n;E,vn;M,z;E,z;E,j;E,nr;B,l;M,nr;
+琊:S,g;
+渎:E,v;B,vn;B,v;M,ns;B,n;
+螓:B,i;
+怒:E,v;S,vg;B,n;E,a;B,i;B,v;B,ns;E,nr;M,i;E,i;E,n;M,l;B,nz;B,z;M,nr;M,ns;B,l;B,vn;M,n;
+玛:E,nr;B,nr;S,nr;M,nr;M,ns;B,n;B,ns;E,nrt;B,nrt;B,nz;M,n;E,nz;E,ns;M,nz;M,nrt;M,nt;
+尚:S,d;B,d;E,n;B,n;B,v;B,nr;M,nr;E,nr;E,a;E,v;B,c;M,l;E,nrt;B,ns;M,i;B,a;B,i;M,nz;B,nrt;M,ns;B,nrfg;M,n;M,v;B,l;B,e;B,nz;E,i;
+疟:B,n;E,n;M,n;
+嘞:S,y;
+贤:E,nr;S,ng;B,n;E,n;M,nr;M,i;E,v;E,nrt;B,a;M,l;E,l;M,ns;B,i;B,l;E,nz;E,i;M,v;S,ag;
+憧:B,v;M,l;E,l;
+宫:B,n;E,n;S,nr;B,nr;B,s;E,nr;S,ng;E,ns;E,v;B,f;M,nr;M,ns;B,nrt;M,n;M,v;B,ns;E,nrt;E,nz;B,l;E,l;M,nrt;B,b;M,i;M,nt;
+钵:S,ng;B,n;E,n;M,nr;E,nr;E,ns;M,i;
+肽:S,ng;E,n;E,nz;B,n;M,n;
+孀:E,n;B,v;B,n;
+糅:B,v;E,v;S,vg;
+棍:S,ng;E,n;B,n;M,n;E,l;M,i;M,l;
+聒:B,a;E,v;
+癞:B,n;B,l;
+桢:E,nr;S,g;E,t;M,nr;
+臧:B,nr;S,nr;B,v;B,nrfg;E,nr;B,n;M,i;
+扦:B,v;B,n;
+饬:S,g;E,v;
+石:B,n;E,n;S,ng;B,nr;E,nr;B,ns;B,j;M,n;M,nr;M,j;M,ns;E,ns;S,n;M,t;M,nt;M,i;E,nz;B,nz;S,j;B,nt;E,i;E,v;B,t;M,l;B,b;B,i;M,nz;B,v;B,nrfg;E,vn;E,nrt;E,l;M,b;E,nrfg;E,j;B,l;B,nrt;
+轸:E,nr;S,g;M,nr;
+腼:B,a;
+简:B,a;B,v;B,d;B,n;S,n;B,nr;E,n;B,l;E,nr;E,v;M,i;M,nr;B,z;M,z;S,nr;E,i;B,b;B,nz;B,nrfg;B,vn;E,a;M,l;B,ns;
+弃:E,v;S,vg;M,n;M,nr;B,v;E,i;M,i;E,nr;E,vn;B,n;B,i;B,l;M,l;
+儇:S,g;
+阉:S,v;B,n;B,v;
+掐:S,v;B,v;B,i;M,l;
+骖:S,v;
+徘:B,v;
+鲚:S,g;
+农:B,n;S,ng;B,j;E,n;M,nt;M,n;B,nr;B,nz;B,l;E,nz;B,nt;E,nr;E,v;E,j;B,v;E,b;M,nz;M,b;M,nr;M,ns;B,b;M,j;M,l;E,nrt;B,ns;E,vn;E,l;E,ns;B,nrt;E,i;M,i;
+模:E,n;B,n;E,b;B,v;S,ng;B,a;E,nr;M,i;E,l;M,l;B,b;B,z;M,z;M,v;B,l;M,n;E,d;B,i;M,nr;E,j;B,vn;B,nz;M,vn;E,nrt;E,v;E,nz;
+袢:S,v;E,n;
+芦:B,n;E,n;B,nr;S,nr;M,ns;M,n;B,ns;E,l;E,nr;M,nr;M,nz;E,i;M,i;B,nz;M,l;
+吵:S,v;B,v;E,v;M,v;E,vn;M,l;E,nr;B,vn;B,n;M,n;
+丹:E,ns;B,ns;E,nr;B,nr;S,nr;E,n;B,n;M,nr;S,j;M,ns;M,nz;M,n;E,v;S,ng;B,nz;B,nrt;M,i;B,nt;E,nrt;B,i;M,nt;E,nz;M,l;E,i;B,l;
+暾:S,g;E,nr;
+觌:S,g;E,nr;
+浏:B,ns;B,v;B,n;B,vn;
+从:S,p;B,d;B,c;B,v;E,v;E,p;B,nr;B,t;E,n;B,l;B,b;B,a;B,i;M,nr;E,d;E,i;M,i;B,n;M,l;B,ns;B,vn;M,n;E,nr;B,z;M,z;M,v;E,vn;
+杓:S,g;M,nr;E,nr;
+套:E,m;S,q;B,n;E,n;E,a;B,v;S,m;E,b;E,nz;E,v;M,n;E,r;E,ns;B,l;E,l;B,vn;E,nr;E,i;B,nz;M,nr;M,i;B,i;B,b;M,v;M,m;
+翘:S,v;B,v;E,nr;E,n;B,n;B,i;M,nr;M,n;M,l;B,l;
+佣:B,n;E,v;S,ng;M,l;M,n;E,vn;E,n;M,nr;
+淤:S,v;B,v;B,n;E,v;M,nr;E,n;S,vn;M,l;E,nr;E,l;
+硭:S,x;
+姬:S,nr;B,nr;E,nr;E,n;M,nr;E,l;E,nrfg;B,nrt;B,nrfg;E,nrt;
+台:E,n;B,ns;S,q;E,v;B,n;E,m;E,ns;B,s;M,ns;S,m;M,n;E,nt;B,j;E,nr;M,nr;B,nr;B,nt;E,l;E,nz;M,nz;E,nrt;E,j;M,i;B,b;E,r;M,nt;M,l;M,j;E,s;B,nz;E,d;M,b;E,mq;E,nrfg;E,i;E,b;B,q;M,v;B,nrt;B,m;M,nrt;M,m;
+俸:S,nr;B,n;E,n;M,nr;E,nr;
+恽:B,nr;S,nr;E,nr;M,nr;B,nrfg;
+蛾:E,n;B,n;M,l;M,i;
+颃:E,v;S,x;
+缂:S,x;B,n;
+宅:E,n;S,ng;B,n;M,n;E,nr;M,nr;M,i;E,b;E,nrt;B,nz;B,ns;
+冉:B,nr;E,d;B,d;E,nr;S,nr;M,nr;S,zg;
+猊:E,n;E,nr;S,x;
+侍:B,n;S,nr;B,nr;B,v;E,v;E,n;M,nr;S,vg;M,n;
+椎:M,l;E,n;B,n;M,n;
+肓:S,x;E,i;E,n;
+崖:S,ng;E,n;B,n;E,nr;M,i;E,ns;M,nr;B,s;B,ns;B,v;E,nz;M,n;M,ns;
+阜:B,ns;E,ns;M,ns;M,l;E,n;E,nrt;B,nt;M,nt;
+犟:S,a;E,a;B,n;B,v;E,nr;
+谠:S,g;E,nr;M,nr;
+伢:B,n;
+暧:B,a;B,n;B,i;
+耨:S,g;
+岫:S,g;B,ns;E,nr;M,nr;B,nz;
+琰:E,nr;S,g;M,nr;
+核:B,n;S,n;E,n;E,v;B,v;E,vn;B,vn;M,n;B,l;M,nt;M,l;E,nr;B,j;M,v;M,b;E,b;M,nr;M,j;M,nz;
+螽:B,n;S,x;
+昼:B,n;E,n;S,ng;E,nr;B,l;B,t;B,i;S,tg;
+局:E,n;B,n;S,n;E,nt;E,j;B,v;E,r;E,v;E,m;M,n;E,nr;B,a;S,m;M,nt;B,j;E,i;E,l;M,b;B,i;E,nz;B,b;M,j;M,i;M,l;M,ns;B,nz;
+镆:S,x;
+偈:S,g;B,n;E,nr;
+乌:B,ns;B,n;B,nr;S,j;B,nrt;B,z;M,nr;B,nz;B,i;E,nr;M,ns;E,ns;M,i;E,n;M,nrt;E,nz;B,nt;M,z;E,z;M,n;E,nrt;E,i;B,j;B,v;M,l;E,nt;
+铛:E,n;S,o;M,i;E,nr;M,nr;
+筚:B,n;B,i;S,g;
+埝:S,g;
+煞:S,v;B,z;B,l;B,n;B,i;E,i;B,v;E,v;S,dg;E,n;M,i;M,nr;E,nr;
+裣:S,x;B,v;
+潢:S,g;E,n;B,ns;E,nr;M,l;M,nr;E,v;
+敦:E,ns;B,ns;E,nr;B,v;M,nt;S,nr;B,n;M,nr;E,n;S,j;M,ns;B,a;M,nrfg;B,nt;E,nrt;M,i;B,z;B,vn;M,z;B,nrt;S,ag;
+鹬:B,i;B,n;
+端:E,n;S,v;E,f;B,n;B,v;E,m;E,nr;B,t;B,a;M,z;M,nr;E,d;E,z;E,b;E,i;B,ns;E,j;M,l;E,l;E,v;B,z;B,nz;E,s;M,n;E,a;B,nr;M,i;M,v;B,nrt;E,nrt;B,f;S,m;
+鉴:B,p;B,vn;E,v;B,v;E,n;S,nr;E,nr;B,n;E,i;S,ng;M,i;M,nr;B,nrt;B,ns;M,n;M,v;S,vg;E,vn;B,nz;B,i;E,nz;M,nt;M,l;
+虼:S,x;B,n;E,nr;
+拿:S,v;B,v;M,ns;E,v;B,n;B,a;B,l;M,nz;M,n;E,nr;M,i;M,nt;M,nr;E,n;E,ns;E,vn;M,l;B,ns;E,nrt;B,i;B,nr;B,nrt;E,nrfg;
+窄:S,a;E,a;B,d;B,a;E,n;E,v;B,z;M,z;E,i;B,n;
+蔑:E,v;B,v;B,n;E,vn;B,vn;
+茕:S,g;
+莪:S,x;E,ns;B,n;M,ns;E,nr;
+弭:S,nr;E,v;
+唱:S,v;E,v;B,v;B,n;M,n;E,n;E,vn;M,i;B,l;E,nr;M,l;E,l;M,nt;B,vn;B,i;E,j;M,nz;M,nr;M,v;
+憾:E,a;E,n;S,ng;E,v;E,i;S,ag;B,n;E,l;
+及:S,c;E,c;E,v;B,c;B,ad;E,ns;E,i;M,i;M,ns;B,d;B,p;M,n;B,v;E,nr;B,n;E,n;E,p;M,nr;M,nz;E,l;M,nt;M,l;E,nrfg;M,v;M,b;B,i;
+蓐:S,g;
+苔:S,ng;B,n;E,n;E,nr;B,l;M,nr;M,n;B,ns;
+呛:S,v;E,v;B,a;B,v;
+赡:S,vg;B,v;B,n;B,vn;E,n;
+泠:S,nr;M,nt;E,nr;E,nz;B,z;M,nr;
+腩:S,x;E,n;E,nr;
+惨:B,a;B,n;S,a;E,a;B,v;B,z;B,i;M,z;E,z;M,i;B,vn;S,ad;E,i;E,nr;
+楹:S,q;E,nr;M,nr;B,n;
+诺:E,v;E,nr;B,nz;S,nr;B,nrt;M,nr;M,ns;B,nr;B,ns;B,n;E,ns;E,nrt;S,ng;E,nz;M,nrt;M,n;M,nz;E,n;M,nt;E,l;M,l;S,vg;B,nt;B,z;M,z;E,i;M,i;
+臾:E,t;M,l;S,x;E,ns;M,i;E,nr;
+岁:S,m;E,m;E,n;S,q;B,n;B,t;E,vn;M,n;E,v;E,t;M,i;E,nr;M,l;E,l;B,i;E,i;M,v;B,l;M,nr;B,nz;E,q;
+理:E,n;B,n;E,vn;E,v;M,n;B,v;E,a;S,n;M,nt;M,l;S,v;E,nr;E,i;E,ns;E,l;B,i;M,i;M,nr;M,nz;E,j;M,j;E,nrt;M,b;M,ns;E,r;B,l;B,vn;B,nrt;M,vn;B,nr;E,d;M,v;B,ns;B,nz;E,ad;B,a;B,d;E,nz;B,nt;M,a;E,nrfg;B,j;B,b;
+趋:B,n;B,v;S,v;E,d;E,i;B,i;M,l;E,nr;B,vn;M,n;
+亍:S,x;E,n;
+栎:S,ng;E,n;E,nr;M,nr;B,n;B,ns;
+尖:S,a;B,a;E,n;B,n;B,v;M,n;B,b;E,v;E,a;B,ns;E,l;E,nr;M,nr;B,l;E,b;M,l;B,i;M,a;M,i;M,b;B,vn;E,j;E,ns;M,ns;
+霜:S,n;M,t;E,n;B,n;E,nr;E,i;E,nz;M,nr;B,t;M,i;M,nz;B,nz;B,v;M,n;E,b;
+丢:S,v;B,v;B,a;B,l;B,i;B,nr;
+枧:S,g;M,nr;
+缬:S,g;E,nr;M,nr;B,n;
+钱:S,n;B,nr;E,v;E,n;B,n;E,a;B,ns;M,n;E,q;M,i;B,nrt;E,nr;B,nrfg;M,nr;B,nz;E,l;E,nz;M,ns;M,l;E,vn;E,nrt;M,nz;M,v;E,i;
+田:S,n;B,nr;E,n;B,n;E,nr;E,ns;M,nr;E,nz;E,v;M,ns;M,l;E,nt;B,ns;B,nrfg;B,s;M,nz;M,n;M,nt;E,nrt;B,nrt;B,l;E,i;E,l;B,v;E,j;M,i;B,j;B,nt;E,nrfg;M,vn;B,vn;M,nrt;
+决:B,v;E,v;B,n;S,d;E,ad;E,vn;B,d;S,v;M,n;M,v;B,vn;E,i;M,l;B,i;E,l;E,a;E,nr;M,i;E,b;M,nr;S,vg;M,j;B,l;M,nz;
+猴:S,ng;B,n;E,n;B,nz;M,n;M,nr;E,nr;E,v;M,i;B,l;E,i;E,t;B,t;M,l;B,i;M,v;B,ns;
+糁:S,g;
+鹂:E,n;S,nr;S,x;M,nr;E,nr;
+先:S,d;B,n;E,d;B,d;B,a;M,nr;E,vn;E,v;B,t;B,v;E,n;E,nr;M,n;B,b;M,i;B,i;E,t;E,l;E,i;M,l;B,f;B,q;M,j;E,nrfg;B,j;M,nt;B,l;B,ns;B,nz;E,j;M,b;E,nrt;
+灞:S,x;B,ns;
+解:B,v;E,v;S,v;B,n;M,n;E,n;B,nr;M,nt;E,vn;B,nz;E,l;B,vn;B,t;E,i;M,l;E,a;M,i;E,nr;B,i;M,nr;B,nt;B,ns;M,j;B,l;M,nz;B,a;B,an;E,j;B,nrfg;M,v;M,nrfg;B,j;
+扪:B,i;M,i;
+镰:S,ng;B,n;E,n;E,nr;M,nr;E,v;
+蝼:B,n;
+选:B,v;E,v;S,v;B,n;M,n;E,n;E,vn;M,l;B,vn;E,nr;E,b;E,j;M,nr;B,nz;B,l;E,nz;B,i;E,i;M,nz;E,nrfg;M,nt;
+澌:S,g;M,nr;E,nr;
+萑:S,g;M,nr;
+斐:S,j;M,nr;E,nr;B,ns;B,z;B,nrt;M,nrt;
+骚:B,v;E,n;S,a;E,v;E,i;B,n;B,vn;E,ns;M,nr;E,nr;B,i;M,l;E,l;E,nz;
+氡:S,g;
+怩:E,a;S,x;M,i;
+芪:E,n;S,x;E,nr;
+席:E,n;E,v;B,n;S,q;M,n;E,m;B,v;M,l;B,nr;S,m;M,i;B,i;E,l;E,nr;E,i;M,nt;E,d;B,d;M,nr;M,ns;B,nrt;B,nrfg;
+鬯:S,g;M,nr;
+吱:S,o;B,v;E,o;B,o;M,o;B,n;M,n;E,nr;
+皲:B,v;
+蔻:E,n;M,i;S,x;M,nr;E,nr;
+睇:S,vg;E,v;
+哆:B,v;M,v;B,z;M,z;
+测:E,v;E,vn;B,vn;B,v;S,v;M,n;B,n;B,nz;E,i;E,nr;E,l;E,nrt;M,nt;E,j;M,i;E,n;M,nz;M,nr;M,l;
+藐:B,v;B,a;
+菔:S,x;M,nz;E,n;E,nr;
+彗:B,n;M,n;M,nr;
+秘:B,n;E,a;B,ns;S,ng;E,n;E,v;E,nr;S,j;M,n;M,nr;M,l;M,z;M,v;B,v;B,i;E,z;B,nt;B,l;M,nt;
+矜:B,a;S,vg;E,nr;E,a;M,nr;B,v;E,v;
+卟:S,x;
+象:E,n;S,n;E,v;B,v;M,n;B,n;E,a;M,nr;E,l;S,ng;E,nr;B,ns;B,l;M,l;M,nt;M,v;E,i;E,nz;M,i;B,a;B,nrt;M,ns;E,ns;M,nz;B,i;
+淠:S,g;B,ns;
+聩:E,a;E,i;S,g;
+牵:B,v;S,v;B,n;B,vn;B,nz;B,i;E,nr;M,i;B,a;B,l;E,v;M,l;E,i;B,ad;
+征:E,n;B,v;E,v;S,v;E,nr;B,n;B,vn;M,n;M,nr;M,i;B,j;E,ns;E,vn;E,nz;E,j;E,i;M,ns;M,nt;M,nz;E,nrfg;E,l;B,nz;
+钇:S,g;M,nz;E,nr;
+厉:B,a;E,ad;B,d;E,a;E,i;B,nr;S,nr;B,n;M,i;M,nr;E,nr;B,v;B,i;B,nrfg;B,l;S,ag;
+焊:B,v;S,v;B,n;E,n;E,vn;B,vn;M,n;E,b;E,nz;B,nz;E,v;E,nr;M,l;
+攒:S,v;E,v;M,l;B,v;B,n;E,nr;M,i;
+粗:S,a;B,a;B,n;B,ad;B,v;B,i;E,d;B,d;E,i;E,z;E,n;E,l;B,b;B,l;E,a;E,nr;M,l;M,i;B,z;
+多:S,m;B,m;E,m;M,m;B,r;B,d;B,n;E,d;E,l;E,v;B,v;B,b;B,nrt;B,a;M,ns;M,i;B,ns;E,a;M,l;B,l;M,nr;B,vn;E,ns;M,nrt;B,nr;B,nz;M,d;E,nrt;B,z;E,n;M,t;B,i;E,nr;M,n;E,i;M,nz;B,mq;E,r;E,nrfg;E,nz;E,z;M,nt;M,z;E,j;E,b;B,j;B,an;
+舨:S,x;
+瘰:B,n;
+劳:B,vn;B,n;E,a;M,l;S,v;B,nr;B,l;E,n;B,v;B,a;E,v;M,nr;E,i;M,n;M,i;M,nt;E,nr;M,ns;B,i;M,nrt;E,nz;B,nt;B,nz;E,nrt;B,nrt;E,l;B,ns;B,t;E,ns;E,ad;B,j;M,nz;B,ad;E,j;M,t;E,vn;
+醵:S,g;
+讹:S,v;B,n;B,v;E,i;M,i;E,n;M,n;B,vn;
+翁:S,ng;E,n;B,nr;S,nr;E,nr;M,i;M,nr;E,ns;B,ns;M,ns;B,n;M,l;E,nrt;
+塄:S,g;E,nr;
+珉:E,nr;S,nr;
+酊:M,i;S,ng;B,n;E,v;E,n;
+柑:B,n;S,ng;E,n;M,nr;
+鳗:B,n;S,ng;E,n;E,v;M,nr;
+祚:E,nr;M,nr;S,g;E,l;E,v;M,nrt;
+嗝:E,v;E,n;B,n;M,v;
+信:B,n;S,n;E,v;E,n;B,v;E,vn;E,nr;M,nt;E,nz;E,j;M,n;B,nr;E,a;M,nr;B,ns;B,nz;M,i;B,vn;B,i;E,i;E,nt;M,l;M,nz;E,nrfg;B,nt;B,b;E,nrt;E,l;B,d;E,r;B,l;B,nrt;M,j;E,ns;B,j;M,b;M,ns;
+绫:B,v;B,n;
+狳:E,n;
+遴:B,v;
+泷:S,g;
+佶:E,nr;S,g;B,i;M,nr;
+娃:S,ng;E,n;B,n;E,nr;B,nz;M,n;M,nr;E,nrt;B,nt;E,nz;M,nt;
+下:S,f;B,v;E,v;E,f;E,n;E,m;E,s;B,n;B,t;B,f;M,n;E,d;M,m;E,t;M,l;E,l;E,i;E,a;E,b;B,b;B,l;M,c;M,v;E,r;M,i;E,vn;B,ns;M,j;B,vn;B,a;M,d;E,ns;M,ns;S,m;M,nr;M,f;M,t;E,nr;B,i;E,nrt;M,b;M,nt;B,q;E,nz;B,nrt;B,nz;M,vn;E,mq;M,mq;B,d;M,nz;E,nt;
+沌:E,a;S,x;E,i;M,i;M,z;E,z;
+悔:E,v;S,vg;B,v;B,i;M,i;M,l;M,n;E,l;E,i;B,n;E,vn;B,vn;M,nr;E,nr;
+笙:S,n;E,nr;B,n;E,n;M,nr;
+鸫:S,g;
+崭:B,b;B,i;S,ad;M,z;E,z;B,v;E,nr;
+疲:B,a;S,a;B,v;M,i;B,l;B,n;B,i;E,i;B,ad;
+谷:E,n;B,n;S,ng;B,nr;E,nr;E,ns;S,nr;M,n;B,ns;M,nr;E,nt;M,ns;E,nrt;M,nz;E,i;B,t;M,i;E,v;B,nz;B,l;E,nz;M,nrfg;B,i;M,l;B,nrt;
+澶:S,g;B,ns;E,nr;
+耿:B,nr;M,i;E,i;S,nr;B,i;E,nr;B,a;M,nr;B,ns;B,n;B,l;M,l;B,nrfg;
+掾:S,g;
+鋈:S,g;E,nr;
+蛐:B,n;E,n;M,n;
+打:B,v;S,v;E,v;B,n;M,i;B,l;E,n;E,m;B,i;M,l;B,vn;M,nt;E,i;E,p;M,n;E,nz;E,l;B,nz;M,v;E,nr;B,j;M,nr;E,vn;E,ns;S,m;E,d;M,nz;B,d;B,ns;M,ns;
+镝:E,n;S,g;E,nr;
+瓜:E,n;S,n;B,n;B,v;M,ns;M,n;E,ns;B,ns;B,nrt;M,i;E,i;M,nr;B,i;E,nr;B,nz;M,nz;M,nt;M,nrt;E,nrt;M,l;
+滠:S,g;
+荩:S,g;
+拨:S,v;B,v;E,v;B,i;E,nr;M,n;M,i;B,n;E,vn;B,d;B,j;B,nz;
+困:B,an;B,n;E,a;S,v;B,a;B,v;E,v;M,n;M,i;E,b;E,i;B,l;E,vn;M,v;B,i;M,l;E,j;M,vn;M,nr;
+闲:S,v;B,n;B,v;E,a;E,v;E,vn;M,l;E,n;E,z;B,a;M,i;B,an;E,i;B,i;B,b;B,l;M,n;E,nr;B,t;M,v;M,nr;E,vd;M,a;B,vn;E,ad;M,z;
+歹:E,n;B,n;E,i;S,ag;B,a;M,i;E,d;
+墅:E,n;S,x;M,n;M,ns;E,nr;M,b;
+辋:E,n;S,g;
+莓:E,n;S,g;M,nr;E,nr;M,nz;
+帖:S,q;E,n;B,n;S,ng;E,a;E,nr;E,m;E,v;M,i;M,z;E,z;M,n;S,m;
+熟:E,a;B,v;S,a;S,v;B,n;B,a;E,v;M,i;E,ns;M,n;E,n;E,i;E,z;E,l;E,nr;B,i;M,l;B,l;M,ns;E,vn;E,b;M,nz;
+斧:S,ng;B,n;E,n;E,nz;M,n;E,i;E,nr;M,i;B,vn;
+茨:E,nrt;M,ns;E,ns;M,nz;E,nr;M,nr;M,nrt;B,ns;B,nrt;B,nz;E,nz;M,n;M,nt;
+鲭:S,g;
+妯:B,n;
+邵:B,nr;S,nr;B,ns;B,n;E,nr;M,nr;B,nrfg;E,ns;M,ns;
+蒽:S,g;B,n;E,nr;
+绁:S,g;E,n;
+彀:S,n;
+磅:S,m;S,q;E,n;E,m;M,i;S,n;E,v;B,v;S,v;B,nrt;B,n;B,vn;E,nr;B,ns;
+奄:M,i;B,i;E,i;E,z;B,z;B,l;M,l;
+陆:E,n;B,n;B,nr;B,d;E,v;M,n;E,s;S,m;E,ns;M,nt;B,ns;B,s;E,nr;S,nr;M,nr;S,ng;E,nz;B,j;B,nt;B,l;M,d;M,i;M,j;E,l;B,v;E,j;B,nz;M,nz;M,ns;B,mq;S,j;M,l;E,mq;B,a;B,nrfg;
+午:E,t;B,t;S,tg;B,n;B,ns;M,nz;M,n;B,v;E,m;M,t;E,nr;M,nr;E,n;M,m;M,l;E,l;B,j;
+惕:E,v;M,n;S,g;E,nr;E,i;M,nr;M,i;
+哝:E,v;S,x;
+仡:B,nz;
+诣:E,n;S,v;E,i;E,nr;M,nr;
+晦:B,an;E,a;B,a;E,i;B,z;M,i;E,v;B,n;B,t;
+恪:B,v;E,nrfg;B,l;
+积:E,n;B,ad;E,v;B,n;B,v;M,n;S,v;E,d;E,vn;M,i;E,nr;M,nr;E,l;M,l;B,vn;B,i;B,l;B,ns;E,nrt;M,ns;
+呲:S,v;
+酴:S,g;
+混:B,n;B,vn;S,v;B,v;B,a;B,b;B,i;E,v;M,i;B,l;E,a;B,nz;E,nr;M,nz;M,l;E,j;M,nr;E,n;E,b;B,j;M,n;B,z;M,z;
+懿:S,g;E,nr;M,nr;B,n;
+禄:E,nr;E,n;M,nr;B,nr;S,nr;S,ng;B,ns;B,n;E,l;M,nrfg;E,i;E,ns;E,nz;M,n;
+唇:E,n;S,ng;B,n;E,nr;B,nz;M,n;M,i;B,i;M,nr;B,l;M,l;M,v;B,j;
+谍:E,n;B,n;M,n;M,nz;
+涌:B,v;S,v;E,v;B,n;E,i;E,n;E,nr;E,l;E,nz;M,i;E,a;M,nr;E,nrt;B,ns;M,ns;E,ns;
+蘑:B,n;E,n;B,nz;E,nz;M,v;
+析:E,vn;M,n;E,v;S,vg;E,l;B,v;M,l;E,n;E,i;E,nr;M,nr;E,nz;M,nz;M,i;
+耕:B,n;B,v;S,v;B,vn;E,nr;E,v;M,n;M,i;M,l;M,nr;E,vn;E,n;B,nz;M,b;
+憔:B,a;M,l;
+官:B,n;E,n;S,n;E,v;B,nr;E,nr;M,nr;B,ns;E,l;M,i;M,n;M,ns;B,v;B,nz;B,l;M,v;E,ns;M,l;B,i;M,b;B,nrt;E,nrt;M,nt;M,nz;B,vn;M,j;
+颚:E,n;B,n;
+喜:B,v;S,v;B,n;E,v;E,n;E,a;E,nr;B,a;B,i;B,ns;M,nr;M,i;E,i;B,z;E,l;M,l;M,n;M,ns;E,d;E,vn;B,l;E,ns;M,z;E,z;B,nz;M,v;B,nrt;B,vn;E,nrfg;E,nz;E,nrt;M,nz;B,an;
+渡:E,v;S,v;B,v;B,n;M,n;E,nr;E,n;M,nr;B,ns;E,ns;M,ns;B,nz;E,vn;M,nz;E,nz;M,i;M,l;B,nr;E,nrt;E,nrfg;E,l;B,nrt;M,nrt;
+侠:E,nr;E,n;S,nr;B,n;M,n;B,a;S,ng;M,nz;M,nr;B,i;M,l;
+肪:E,n;M,n;S,x;M,b;
+嘱:B,v;E,v;E,n;S,vg;B,vn;M,l;M,n;E,i;
+贷:B,n;E,n;S,v;E,j;E,v;M,n;E,vn;E,nr;M,j;E,i;B,j;M,v;
+溶:B,n;B,v;S,v;M,n;E,nr;E,n;E,v;M,l;M,nz;E,nz;M,nr;E,z;B,z;E,b;
+蜻:B,n;B,i;M,n;
+潋:M,l;B,z;S,x;E,nr;
+跌:E,v;S,v;B,n;B,v;M,j;M,z;B,z;M,l;B,l;M,n;B,vn;B,a;
+坛:E,n;S,ng;S,q;M,nt;E,ns;B,n;E,nr;M,nr;B,l;M,l;M,ns;M,nz;E,nz;M,n;M,i;E,v;B,ns;E,j;
+濠:S,g;E,nr;M,nr;B,ns;B,nt;
+补:B,v;S,v;B,n;B,vn;E,v;M,l;E,b;M,i;B,nz;M,n;E,vn;M,nr;M,v;E,nr;E,i;E,n;E,j;B,i;B,j;M,nz;
+铲:S,v;B,v;B,n;E,n;B,nz;E,nr;
+灵:B,n;B,a;E,n;S,a;E,nr;B,nr;B,ns;M,nr;E,a;E,v;M,n;B,i;E,ns;M,ns;E,i;M,i;B,nrt;B,v;M,l;M,z;E,z;E,nz;E,nrt;E,l;B,b;M,nz;B,vn;E,nrfg;B,nz;M,nrt;
+橹:S,ng;E,nr;M,nr;E,n;
+茂:E,nr;B,a;S,a;M,nr;E,a;B,ns;E,i;B,nrt;M,n;E,l;E,nz;M,nrt;E,v;B,nr;M,nz;M,ns;M,l;B,n;E,z;B,nz;
+锎:S,g;
+帔:S,g;E,n;E,i;
+芗:B,n;B,ns;
+钣:S,g;B,n;
+瘤:E,n;S,n;E,l;M,n;B,n;E,nr;S,ng;M,nt;
+骧:E,nr;S,vg;E,j;M,nr;M,i;E,nrfg;
+掭:S,v;
+般:E,a;B,u;S,u;E,r;M,l;E,d;E,l;B,n;M,n;M,i;E,u;E,i;B,a;M,v;B,z;E,z;M,nr;E,n;B,nz;E,nr;B,ns;E,b;
+榱:S,g;
+疹:E,n;B,n;M,v;M,n;
+场:E,n;B,n;E,m;S,q;E,s;E,v;M,n;E,mq;B,s;M,v;E,ns;E,d;E,r;E,l;M,l;S,m;E,i;M,i;B,f;E,b;E,j;M,ns;M,m;B,q;E,q;M,nz;M,nr;M,nt;E,a;E,vn;E,nt;E,nr;E,nz;B,m;M,j;
+臁:S,g;M,nr;
+捂:S,v;B,v;M,nr;
+畎:S,g;
+筒:E,n;S,q;S,ng;B,n;M,n;B,b;M,b;M,l;M,nz;E,nr;E,nz;M,ns;B,v;B,ns;
+拗:S,a;B,n;E,a;E,v;B,v;B,a;M,nr;
+滟:E,l;E,z;S,x;
+赞:B,v;E,v;S,v;E,nr;B,n;M,nr;B,ns;E,n;S,j;B,vn;B,nrt;B,i;S,vg;E,nrfg;E,l;B,l;E,nrt;E,i;M,nz;B,nz;B,nt;M,nrt;
+瓣:E,n;S,q;S,ng;B,n;M,n;E,b;M,l;
+噤:E,n;B,i;B,n;E,l;
+饦:E,n;
+胫:S,ng;M,i;B,n;
+扬:E,v;B,ns;S,vg;B,v;M,i;E,nr;E,i;B,n;B,nz;B,nr;B,i;E,a;M,nr;E,ns;M,ns;E,nrt;E,vn;M,nrt;E,n;M,n;M,l;B,vn;B,d;S,v;B,nrt;B,l;E,nrfg;M,v;E,nz;M,z;E,z;
+愁:S,v;E,v;E,a;B,n;B,i;B,a;M,i;E,n;M,nr;M,l;E,i;B,l;E,nr;M,ns;E,l;
+颐:B,ns;B,i;E,nrfg;B,v;E,l;B,nz;B,l;E,v;
+缕:E,m;S,q;E,z;E,i;B,z;M,i;M,z;E,nr;M,n;E,a;S,m;M,l;B,v;E,nrt;
+枚:S,m;E,m;S,q;M,n;M,i;E,nr;E,v;E,nrfg;M,nr;B,nz;
+涞:S,g;B,ns;M,nr;E,nr;B,nrt;
+吣:S,v;E,nr;
+玢:S,x;M,nr;E,nr;
+怫:S,g;
+是:S,v;E,c;E,n;E,d;E,v;B,v;M,l;E,l;B,l;E,r;B,c;M,c;B,n;E,i;M,i;B,t;B,i;E,nz;M,nr;E,j;M,n;B,r;M,nrfg;M,v;
+薮:S,g;E,n;
+讲:S,v;B,v;B,n;E,v;M,n;B,vn;E,l;E,c;M,l;B,ns;E,vn;E,j;B,l;B,i;E,nr;M,j;M,i;
+爷:E,n;S,ng;E,nr;B,n;M,n;M,nr;M,ns;B,r;M,l;
+咸:B,ns;S,a;B,n;B,nr;E,nr;S,nr;M,nr;B,nz;M,ns;M,l;E,v;S,ng;
+砻:S,v;M,ns;E,ns;B,nz;E,nr;M,nr;B,n;B,ns;
+契:B,n;B,ns;S,ng;E,a;E,nr;M,nr;B,v;E,n;B,nr;M,nrt;S,vg;M,n;E,v;E,nrt;B,vn;B,b;B,nz;B,nrt;E,ad;M,ns;E,ns;
+磐:S,ng;B,n;E,nr;M,i;E,i;M,nr;B,nrt;B,ns;
+录:E,v;E,n;S,v;B,v;B,n;M,n;E,nr;M,nr;E,vn;E,nz;B,vn;M,nz;M,l;E,j;M,i;M,v;M,nt;E,i;
+绔:S,x;M,i;E,n;M,nr;
+教:B,n;B,vn;E,nz;E,n;S,v;E,v;M,n;M,l;B,v;E,j;M,nt;E,nr;M,nr;E,vn;B,j;M,i;E,i;M,j;E,l;E,nt;M,ns;B,t;B,l;B,nt;M,nz;B,b;M,b;B,i;B,nrt;M,nrfg;
+睥:B,i;S,x;B,l;
+忪:E,i;E,a;S,x;
+旮:B,n;M,nr;
+轵:S,g;B,ns;
+广:B,ns;B,a;B,n;S,a;B,b;E,v;B,nz;B,nr;B,vn;M,nr;E,nz;B,nt;E,nr;B,v;E,j;B,j;E,a;M,nz;M,i;M,ns;M,nt;B,d;B,l;M,l;E,i;B,nrt;S,j;M,n;E,nrfg;B,i;B,t;E,n;M,nrfg;E,nrt;E,nt;E,ns;M,j;
+舂:S,v;M,nr;E,nr;
+殇:S,vg;E,n;M,nr;E,nr;
+踊:B,ad;
+攘:S,vg;M,i;E,i;M,nr;B,l;E,v;E,z;B,v;
+辟:E,v;S,v;B,nr;B,v;E,a;M,i;M,l;M,nr;E,vn;E,i;B,n;E,nr;
+岩:E,n;B,n;E,nr;S,nr;E,ns;M,nr;S,ng;M,ns;E,nz;B,ns;E,v;M,n;B,nrt;E,l;B,v;B,i;M,i;E,nrt;M,nt;M,nrfg;
+茬:S,q;E,m;E,n;E,v;B,n;M,n;S,ng;M,v;
+褰:S,g;
+锸:S,n;
+鬼:S,n;B,n;E,n;E,v;M,i;B,i;S,a;E,nr;M,l;E,i;M,n;B,v;B,nr;E,l;B,a;B,l;M,v;B,t;
+尾:S,n;B,n;E,n;M,n;E,i;S,q;E,v;E,ns;E,m;B,v;E,nrt;B,ns;M,nr;B,f;E,t;E,nr;M,i;M,v;S,m;B,i;M,ns;E,l;S,ng;B,nrt;E,vn;B,nz;
+胁:E,vn;S,ng;B,v;E,v;S,vg;E,n;M,n;B,n;M,i;M,nr;B,i;
+框:B,n;E,n;S,v;M,n;S,q;B,v;E,nz;E,m;S,m;E,nr;M,nz;
+凋:B,v;B,a;S,vg;M,i;
+埏:E,nr;S,g;
+飑:S,g;
+槛:E,n;S,g;M,n;
+虚:S,d;B,a;B,n;B,v;E,a;E,v;M,i;E,n;E,nr;B,i;B,b;M,nr;E,i;M,l;B,ad;E,nrt;B,vn;B,z;M,n;E,ns;M,z;B,nz;M,ns;E,l;E,nz;B,l;
+痣:S,n;E,n;
+坤:B,ns;E,n;E,ns;M,ns;E,nz;E,i;B,n;E,nrfg;E,nr;B,nrt;
+鹪:B,n;
+跳:S,v;B,v;E,v;B,vn;B,n;E,i;E,l;M,i;E,nr;M,n;M,ns;E,n;E,vn;B,b;M,v;M,nt;M,l;B,z;M,z;M,nr;B,i;B,nz;M,nz;
+仵:B,n;S,nr;B,nr;S,x;
+潴:B,v;B,ns;
+畸:B,n;S,ng;E,v;B,v;B,i;M,i;
+态:E,n;B,n;S,n;E,v;M,n;E,l;M,l;E,i;M,i;S,ng;E,nr;M,v;E,vn;E,a;M,nr;M,nz;
+膀:E,n;B,n;S,v;M,l;B,l;E,nz;E,l;
+咎:E,v;S,ng;E,i;M,l;B,i;E,l;M,i;E,nr;
+砑:S,g;
+馐:S,g;E,n;
+媒:B,n;E,n;S,ng;M,n;E,v;E,l;M,i;E,i;M,nt;B,v;E,nr;
+悖:S,vg;B,n;E,v;M,v;E,i;B,v;B,a;
+伟:E,nr;B,a;E,a;M,nr;S,nr;B,n;B,nz;M,l;E,nrfg;M,nrfg;E,l;M,i;
+逡:S,g;B,v;M,nr;
+唣:E,a;S,x;
+愫:S,g;E,n;E,nr;M,nr;
+纪:E,n;B,n;E,t;B,v;M,t;B,nr;M,n;E,nr;M,nr;S,nr;B,j;E,nz;S,ng;M,v;M,l;M,nz;E,vn;E,mq;M,j;M,ns;M,nt;E,i;B,l;E,v;B,b;E,l;E,j;B,nrt;
+术:E,n;M,n;S,v;E,v;S,ng;B,n;M,nt;E,nr;E,l;B,t;M,l;M,nr;M,ns;E,j;E,i;M,i;E,b;M,v;M,nz;M,b;
+洳:S,x;E,n;M,nr;E,nr;
+猷:E,nr;S,g;M,nr;
+邶:S,g;
+蕃:E,ns;E,nrfg;M,n;B,v;B,n;
+柄:S,n;E,n;E,nr;M,nr;E,i;S,ng;E,nz;B,n;
+酋:B,n;E,ns;S,ng;M,ns;E,n;M,nt;E,nr;
+前:S,f;E,t;E,f;B,n;B,f;B,v;E,v;E,s;B,t;B,r;B,s;B,i;E,a;M,i;E,nr;M,l;B,b;B,l;E,d;E,ns;E,i;M,nr;E,b;M,n;B,j;E,l;B,ns;B,nz;E,nrt;M,f;M,ns;E,nrfg;M,s;E,n;B,nrt;M,t;M,nz;M,v;E,ad;M,nt;E,vn;M,c;B,nt;E,nz;
+塑:B,n;E,n;B,v;S,ng;M,n;M,nz;E,v;E,nr;M,l;E,nz;B,nz;E,i;E,vn;M,i;M,nr;M,nt;B,j;B,nrt;E,j;S,vg;
+幕:E,n;S,q;B,n;E,v;E,m;M,n;B,s;S,m;E,b;E,nr;S,n;B,ns;M,nr;M,j;B,i;M,l;
+翔:E,nr;E,v;E,ns;S,nr;B,a;M,n;E,nz;M,nr;E,vn;E,nrfg;B,nz;M,ns;M,nz;E,nrt;
+诜:S,x;
+廪:S,g;E,n;E,nr;M,nr;
+卷:E,m;S,q;S,m;E,n;B,n;B,v;E,v;B,i;M,l;M,n;E,nz;E,nr;M,i;B,l;E,b;B,nz;E,r;B,ns;M,nr;M,ns;E,vn;B,s;E,i;E,j;B,vn;B,b;
+驽:B,a;B,n;
+脂:B,n;E,n;M,n;E,ns;E,l;M,i;M,ns;E,nz;E,v;B,ns;B,b;
+丈:B,n;E,m;S,q;E,n;M,n;E,i;B,v;E,nr;S,m;M,i;M,l;B,nz;M,nr;E,nrt;B,i;E,l;
+犋:S,q;
+倌:S,g;E,n;
+霎:B,d;M,t;E,t;B,t;
+尔:E,nr;M,ns;M,nr;E,ns;M,nrt;S,nr;E,nrt;M,nz;B,nr;M,n;E,nz;E,d;E,n;M,nt;B,nrt;E,nt;B,c;M,nrfg;M,i;M,q;E,i;S,yg;B,q;M,l;B,i;B,n;M,t;B,a;E,v;B,ns;B,r;
+颧:B,n;
+涵:E,n;B,v;B,n;E,v;E,nr;M,nr;S,vg;B,nr;E,vn;E,nrfg;M,n;B,a;
+谴:B,v;S,vg;
+禽:E,n;S,ng;B,n;M,i;E,nr;M,n;E,vn;M,nz;
+菁:S,nr;E,nr;E,n;E,nz;M,nr;B,n;B,nz;
+歆:E,nr;S,g;M,nr;B,a;
+勋:E,nr;B,n;S,ng;E,n;M,nr;B,nz;E,v;
+浊:S,an;E,a;B,n;E,v;M,nr;E,nr;M,n;S,ag;M,i;E,n;B,ns;E,an;E,b;B,nz;
+重:B,a;B,n;E,a;B,v;S,a;E,v;B,d;B,vn;E,n;B,ns;M,n;E,m;E,b;B,b;M,i;M,nr;M,l;B,z;E,i;B,t;M,z;E,l;E,z;B,i;E,j;B,l;E,nr;B,nz;M,nz;E,d;B,j;B,nt;M,nt;M,j;E,vn;E,ad;S,m;B,nrt;M,b;B,q;E,q;M,nrfg;E,nrfg;M,ns;
+哏:E,v;
+廓:E,n;B,nr;B,v;E,z;E,a;B,vn;M,ns;
+酢:S,g;E,v;
+呤:E,n;S,x;E,nz;M,n;E,nr;
+苫:S,v;B,n;E,n;
+恬:B,a;E,nrfg;B,i;M,i;B,z;E,a;
+汴:S,g;B,ns;M,nr;B,nrt;E,nr;M,ns;
+培:B,v;B,vn;E,vn;E,nr;B,n;M,nr;S,v;M,ns;M,l;E,q;E,v;M,nz;E,l;M,n;B,nz;E,ns;B,nrt;B,nr;
+癸:S,mg;B,m;E,nr;B,nz;M,nr;M,m;
+髻:S,g;E,n;M,ns;
+硼:S,n;B,n;E,n;M,n;E,nr;E,nz;B,nz;M,nz;M,nr;
+持:E,v;B,v;B,vd;S,v;B,n;M,n;E,nr;B,a;M,i;E,a;E,n;M,nr;E,vn;B,i;B,t;M,b;E,i;B,l;M,l;
+漉:E,z;M,z;S,v;
+笑:S,v;E,v;B,n;E,vn;E,nr;E,l;B,z;B,v;E,a;M,i;E,n;E,i;M,l;M,nr;B,i;B,l;M,n;B,nr;M,v;
+骐:S,g;B,n;E,nr;M,nr;
+妒:E,v;B,v;B,n;M,i;B,i;M,n;B,vn;
+鲔:S,g;
+掖:S,v;E,ns;E,v;B,ns;M,ns;E,vn;
+嘣:S,o;M,z;
+锥:S,v;B,n;M,n;E,n;M,l;E,nz;M,i;E,nr;E,i;B,i;
+箦:S,g;
+稻:E,n;B,n;S,ng;M,l;M,nr;M,nt;B,nz;E,v;M,n;E,nr;M,nz;M,v;B,ns;E,j;
+墼:S,x;
+簿:S,ng;E,n;B,n;M,i;M,nr;
+免:E,v;B,v;E,d;S,v;B,n;E,c;E,l;B,vn;E,i;M,n;E,vn;M,l;B,d;B,b;E,nr;M,j;M,i;M,v;B,i;B,nz;B,l;M,nr;
+孑:B,n;B,i;
+蛘:S,g;
+楝:M,n;E,n;B,n;
+俞:B,nr;S,nr;M,nr;E,nr;B,nrfg;
+略:E,n;S,d;E,v;B,v;M,n;B,d;E,vn;E,nr;E,d;E,ad;E,a;B,n;M,ns;E,i;B,i;M,i;M,nr;E,nrt;E,ns;B,ns;B,l;M,l;E,l;B,nrt;M,nrt;
+铤:B,i;
+罩:S,v;E,n;E,v;B,n;E,l;M,nr;E,nr;E,nz;B,nz;
+腭:E,n;B,n;M,j;
+乳:B,n;S,ng;M,n;E,n;E,v;E,nz;B,v;S,vg;B,ns;B,b;M,l;E,nr;B,nz;M,i;B,i;E,vn;M,nz;
+槲:B,n;B,nz;
+赵:B,nr;S,nr;E,nr;M,nr;B,nrfg;E,t;B,ns;E,i;E,ns;B,n;B,nrt;
+偷:S,v;B,v;B,d;E,d;B,i;E,n;M,i;B,vn;B,n;B,j;B,l;B,vd;M,l;E,i;
+饽:B,n;E,n;
+屿:E,n;S,ng;E,nr;E,ns;M,ns;M,nr;
+榇:S,g;E,nr;E,n;M,nr;
+王:B,nr;S,nr;B,n;E,n;E,nrt;E,nr;M,nr;E,nz;M,n;B,nrfg;E,v;B,ns;M,ns;M,nt;M,l;M,i;E,ns;E,i;B,l;M,nz;E,l;B,i;E,nrfg;B,nrt;B,nz;B,j;M,nrfg;M,t;B,t;
+谊:E,nr;E,n;E,nz;M,nr;S,ng;M,ns;M,n;E,v;M,nz;M,nt;E,i;E,vn;
+疏:B,v;S,vn;S,vg;E,a;E,n;B,n;B,a;B,vn;E,nr;B,ns;M,i;B,l;E,z;E,i;M,n;B,i;M,j;M,z;B,z;M,nr;E,v;B,j;E,l;B,nrt;B,nz;
+阎:B,nr;B,n;S,nr;M,nr;M,n;B,nrfg;E,n;E,nr;
+崔:B,nr;S,nr;M,nr;B,nrfg;E,nr;
+趟:E,m;S,q;S,m;E,v;B,n;B,l;M,v;
+务:E,n;E,vn;M,n;M,nt;E,b;S,d;B,d;B,v;M,l;E,l;M,i;E,j;S,ng;M,nr;E,nr;E,i;B,n;M,nz;S,dg;E,nrt;M,j;E,v;S,vg;B,ns;M,nrfg;M,b;M,t;
+鞣:S,v;B,n;B,v;M,n;
+缨:S,ng;E,nr;E,n;M,n;B,n;E,v;M,nr;E,nz;
+悭:B,a;S,g;
+脬:S,x;
+贴:S,v;E,n;B,v;E,v;B,n;B,vn;B,a;E,a;M,n;E,vn;E,nr;M,i;E,nz;B,nz;M,nr;M,l;M,z;E,z;B,ad;
+制:E,v;B,v;B,n;E,n;S,v;E,vn;M,n;B,vn;M,l;E,b;M,i;E,nr;M,v;E,j;M,nt;M,b;E,l;E,nz;M,nr;M,nz;B,nz;M,j;M,vn;E,i;B,nrt;E,a;B,l;M,d;
+霸:B,n;S,n;E,nr;E,v;B,v;M,n;E,n;M,nr;B,ns;E,nz;S,vg;M,nz;E,i;M,i;B,l;E,vn;E,ns;M,l;E,l;M,ns;E,nrt;B,a;
+苁:S,x;M,n;B,n;E,nr;
+恂:E,nr;S,g;M,nr;
+友:E,n;B,n;B,a;S,ng;E,nr;M,nr;S,n;E,l;E,v;B,ns;E,nz;E,i;M,n;B,nr;B,v;E,j;M,nz;M,l;M,nt;B,nz;M,ns;M,i;B,nrt;B,nt;E,nrfg;E,vn;B,j;E,ns;E,nrt;E,b;
+汊:B,n;E,n;M,ns;
+髑:B,n;
+硒:S,n;E,nz;B,n;
+鳕:B,n;E,n;
+毛:B,n;S,nr;E,n;B,nr;M,n;E,nr;B,ns;M,nr;M,i;B,b;B,q;B,i;E,v;B,z;E,b;B,nz;E,i;E,l;E,nrt;B,a;M,v;M,z;M,nz;M,nt;E,nz;B,j;B,l;B,nrt;M,ns;M,l;B,nrfg;
+葚:E,n;E,nr;
+占:S,v;B,v;E,v;B,nr;B,n;M,n;M,nr;E,nr;M,ns;E,vn;B,l;M,i;B,vn;M,nz;E,l;E,i;M,nrfg;
+矣:S,y;E,i;E,nr;B,u;
+遢:E,a;E,z;S,x;
+啤:B,n;E,j;M,nt;M,n;E,n;B,nz;
+秧:B,n;S,n;E,v;M,n;E,n;S,v;E,vn;M,v;M,nr;E,nr;
+浴:E,v;B,n;S,vn;E,n;E,nr;S,vg;E,vn;M,nz;B,i;B,v;M,nr;E,j;M,n;B,vn;
+囹:M,i;B,n;
+搅:S,v;B,v;E,v;B,n;M,i;E,nr;B,vn;
+薄:S,a;B,n;E,a;B,a;B,nr;B,z;M,z;M,i;E,n;E,nr;E,v;B,nz;M,l;M,nr;E,l;B,nrfg;E,i;E,b;B,b;B,l;M,n;M,v;M,nz;B,nrt;M,b;
+辈:M,m;E,n;S,n;B,n;E,r;E,m;B,v;M,l;B,q;E,l;E,i;M,t;M,n;M,i;B,m;S,m;
+醌:E,n;S,g;E,nz;
+嚎:S,v;B,v;B,d;E,v;E,i;E,n;B,n;E,nr;
+墒:S,ng;E,v;B,n;E,nr;
+抖:S,v;E,v;B,v;M,i;B,i;M,z;E,z;B,vn;E,nr;B,l;M,nr;
+圣:B,n;S,j;B,ns;E,ns;E,nr;M,nr;E,a;B,t;B,nrt;B,nz;E,v;B,a;E,n;E,nz;B,nr;M,l;M,nt;M,ns;M,n;E,nt;M,i;M,v;E,i;B,nt;M,t;E,nrfg;M,nrt;
+大:B,n;S,a;E,a;B,d;B,m;E,v;B,r;E,j;B,ns;B,b;M,nt;M,nr;M,ns;B,v;B,nz;M,nz;E,b;M,n;B,i;E,d;M,i;E,ns;B,nr;M,m;M,l;B,l;B,ad;E,nz;E,n;B,z;B,j;M,z;B,vn;B,nrt;E,nr;B,a;B,nt;E,i;B,t;M,v;E,nt;M,t;M,b;E,l;E,vn;E,nrfg;B,s;B,q;M,j;M,nrfg;M,nrt;E,nrt;B,f;M,in;E,z;M,a;M,vn;B,nrfg;M,d;
+窦:B,nr;S,nr;E,n;E,nr;M,n;B,n;M,ns;M,nr;M,i;
+鸩:S,ng;B,n;M,i;
+挫:E,v;S,v;B,n;B,v;E,i;E,l;B,l;
+粪:S,n;B,n;E,n;M,n;E,i;E,v;M,nr;
+支:B,v;B,n;E,m;E,n;S,q;B,vn;E,v;M,n;S,m;B,nr;M,ns;M,j;M,i;E,nr;E,nz;B,i;M,v;M,nr;B,nz;B,j;E,ns;E,vn;E,i;E,r;E,j;B,l;M,l;E,l;B,z;
+漳:B,ns;S,j;E,ns;B,nz;M,ns;E,nr;B,n;M,nr;
+垸:S,ng;E,n;
+钺:S,ng;E,nr;E,n;M,nr;E,i;
+麾:B,n;
+旄:S,g;M,i;
+义:E,n;B,n;E,v;S,ng;E,nr;M,n;M,nr;S,nr;E,l;E,nz;E,b;E,ns;E,i;M,ns;B,l;E,vn;M,i;B,ns;B,i;E,a;B,nz;M,nz;M,nt;B,a;B,v;S,nt;M,l;E,nrt;B,nt;M,v;B,nrt;E,nrfg;M,vn;B,vn;M,nrt;B,nr;
+镏:B,n;
+展:E,vn;E,v;B,v;M,l;M,n;S,vg;B,n;E,j;E,nt;E,n;B,vn;E,nr;M,nt;M,nr;B,nr;E,nz;E,i;E,l;E,a;M,ns;S,ng;B,b;M,nz;B,nrfg;M,z;E,z;M,nrfg;B,j;B,nz;M,v;
+觜:S,g;
+仞:S,q;E,l;E,nr;M,nr;E,ns;
+牡:B,n;B,ns;M,nr;B,l;B,nz;B,nt;
+嫦:B,n;B,l;M,nr;
+峪:S,g;E,nr;M,ns;M,nr;E,ns;B,nrt;E,nrt;
+佳:E,z;S,a;B,n;E,nr;M,nr;E,a;E,j;B,ns;E,v;B,nz;M,i;E,nz;B,nt;B,t;M,n;M,l;E,nrt;M,nt;B,i;M,nrfg;
+具:B,v;E,n;B,a;S,vg;E,v;E,m;M,l;E,l;S,m;M,n;M,i;B,c;B,n;M,nr;M,nz;E,nr;B,l;E,nz;B,i;M,ns;E,i;M,v;
+顽:B,a;S,ag;B,n;B,v;E,a;M,i;M,nr;B,nz;B,l;E,nr;M,n;B,i;
+绾:S,v;E,nr;
+悃:S,g;
+蜂:B,n;E,n;S,n;B,v;E,d;E,nr;B,i;M,n;M,nr;E,v;E,l;S,ng;M,l;B,b;M,i;B,ns;
+璋:E,nr;S,g;M,nr;E,v;
+嘌:S,g;B,n;M,n;M,nz;
+犏:S,x;
+碓:S,g;E,n;M,nr;
+依:B,d;B,v;S,v;B,n;E,nr;B,z;M,nr;B,p;E,v;B,nr;M,i;B,l;B,i;E,z;E,nz;M,ns;M,nz;B,ns;E,ns;E,l;B,vn;B,nz;E,vn;M,nrt;M,l;M,nt;E,i;E,n;B,a;B,nrt;
+那:B,r;S,r;B,nr;B,mq;B,c;E,ns;B,ns;B,t;M,t;M,ns;E,t;E,nr;B,l;E,n;E,nrt;M,nr;M,n;B,nz;E,nz;M,nrt;M,l;B,n;B,nrt;M,nz;M,nt;M,i;
+厥:E,n;S,r;E,v;M,nz;E,nr;M,nr;M,n;M,i;
+妩:B,a;B,i;M,nr;
+枭:B,n;B,v;B,i;E,n;
+谰:B,n;
+段:E,n;E,m;S,q;M,n;B,nr;E,f;E,t;E,r;B,n;M,l;E,v;S,m;E,i;E,nr;B,ns;E,vn;E,l;B,nrfg;B,q;E,j;M,nr;
+熹:E,nr;B,nz;B,nrt;B,a;E,nz;
+逸:S,vg;E,nr;E,v;M,i;M,nr;E,a;S,ag;B,n;E,i;E,z;E,b;B,v;B,i;E,nz;B,nr;E,j;
+区:E,n;B,n;E,ns;S,n;E,s;B,v;M,n;B,nrfg;E,r;E,nt;E,j;E,nr;B,s;B,b;E,b;B,nr;E,v;M,nt;E,l;E,nz;B,z;E,z;B,vn;M,l;B,f;B,l;M,nz;M,b;M,v;M,nr;B,j;E,i;B,nz;E,nrt;M,vn;E,vn;
+羽:E,nr;B,n;S,nr;S,q;E,n;B,nr;M,nr;B,v;S,j;B,ns;E,b;M,i;S,ng;E,m;M,nt;B,i;E,v;E,nrt;B,nrt;E,nrfg;M,n;S,m;B,l;
+藁:S,g;B,ns;
+杂:E,a;B,n;S,v;E,v;S,a;M,n;B,vn;E,i;B,a;B,v;B,i;M,v;M,i;E,z;E,b;B,l;M,l;M,z;E,vn;E,n;E,l;M,nt;E,nz;B,z;E,ad;E,j;M,nr;B,ns;B,nz;
+菅:M,i;S,nr;B,nr;S,ng;
+仇:B,n;E,v;S,n;B,nr;E,n;M,i;B,v;E,i;M,n;E,l;E,nr;E,vn;M,nr;B,vn;B,i;S,nr;B,nrfg;
+浆:E,n;S,n;B,n;M,n;E,v;B,nz;B,v;B,ns;E,vn;E,i;S,v;M,i;E,nr;E,nz;
+觉:B,v;E,n;E,v;S,v;E,d;E,a;E,i;B,n;E,nr;M,nr;M,n;E,l;M,l;E,vn;M,nrt;B,vn;B,nrt;B,nt;B,nr;M,ns;E,ns;
+煎:S,v;B,v;E,v;B,vn;B,n;M,n;M,z;E,z;E,n;B,nz;M,nr;M,l;
+蕖:S,x;E,nr;
+泛:E,a;S,v;B,v;B,j;B,n;M,j;E,nr;M,n;M,nr;E,d;B,d;M,l;B,i;E,v;B,nz;B,ns;B,vn;B,l;
+荚:S,nr;B,n;E,n;E,v;M,nr;
+乜:S,nr;B,v;B,nr;E,nr;M,nr;
+襞:E,n;S,g;
+面:E,n;B,n;E,f;S,n;B,v;E,c;B,f;E,ad;E,d;E,v;M,n;E,m;E,b;E,mq;B,s;M,i;B,i;M,d;E,l;E,a;M,l;B,l;E,i;M,nz;B,a;M,nt;E,nr;M,v;S,m;M,nr;E,nz;E,vn;M,ns;B,nz;M,nrt;M,a;M,m;E,j;M,z;M,mq;E,z;S,q;B,ns;
+继:B,v;S,vg;E,d;B,n;M,nr;B,c;B,vn;E,nr;E,vn;E,i;E,v;M,n;M,i;M,nz;B,i;E,nz;B,t;M,nrfg;E,l;
+苯:S,n;B,n;E,n;M,n;M,nz;B,nz;E,nz;B,nt;
+汰:E,v;E,l;S,vg;M,n;E,a;B,v;M,l;
+裳:E,n;S,ng;E,nr;M,nr;
+雷:B,n;B,nr;E,n;E,nr;S,n;M,nr;E,v;M,n;B,v;B,ns;M,ns;M,nrt;E,nrt;M,i;B,nrt;B,i;E,ns;E,i;M,l;E,vn;M,nz;B,l;E,l;M,nt;B,nz;E,nz;
+凹:S,a;B,v;B,n;E,n;B,l;B,nz;E,a;E,nr;B,vn;M,l;E,nrfg;
+灸:E,n;S,g;M,n;E,nr;
+忽:B,d;S,d;B,v;M,l;E,v;B,z;E,d;M,z;B,l;M,nr;E,nr;M,i;E,z;M,m;B,o;E,vn;B,nz;E,a;B,i;
+袈:B,n;
+眍:S,v;
+鲐:S,g;
+徒:E,n;S,d;B,n;M,l;E,nr;M,nr;B,d;B,v;E,i;B,i;E,v;E,nrt;M,ns;B,b;M,nrt;M,i;M,n;B,l;B,ns;E,l;E,c;
+笕:S,g;M,nr;
+锡:S,n;M,nr;E,ns;B,ns;B,n;E,nr;B,nz;M,ns;M,n;M,nz;E,n;B,nrt;E,nz;B,j;E,nrt;M,nt;
+瞢:S,g;
+帧:S,q;E,n;E,m;E,nr;S,m;M,nr;
+綦:B,ns;B,nr;S,nr;
+箪:B,i;
+栳:E,n;S,x;
+稿:E,n;S,ng;B,n;E,v;M,n;E,nz;E,j;E,vn;E,l;
+擀:S,v;B,n;E,nr;M,nz;
+聃:S,g;E,nr;M,nr;
+拄:S,v;B,v;
+蹇:S,nr;E,i;E,nr;S,ag;E,v;
+坍:B,v;S,v;E,v;
+孕:E,v;B,n;B,v;S,j;B,t;M,n;E,vn;S,ng;E,n;B,nz;M,t;B,j;S,vg;E,nr;M,nr;M,nz;
+铠:B,n;
+左:B,m;S,f;B,nr;B,n;B,f;M,m;B,i;B,s;B,nrfg;B,ns;B,j;M,nr;M,l;M,ns;E,v;E,ns;E,b;B,l;E,nr;B,b;B,nrt;E,nrt;B,v;M,i;B,d;B,nz;M,nt;B,a;
+飨:S,vg;E,e;B,n;B,v;
+酹:S,vg;
+婿:E,n;S,ng;E,v;E,i;E,nr;
+谆:E,d;B,d;B,l;M,l;B,i;M,i;
+疋:S,g;
+螗:S,g;
+墩:S,v;E,n;B,n;E,nr;M,z;S,q;M,nr;E,z;E,ns;S,ng;E,nrt;M,n;
+沱:M,ns;B,ns;B,nz;E,ns;B,n;E,l;E,a;M,n;B,nt;
+贰:S,m;B,m;B,n;E,nr;M,m;
+串:S,v;E,n;E,m;B,v;B,n;E,v;B,vn;B,b;M,l;E,vn;B,ns;B,i;M,n;E,nr;B,j;E,nz;B,l;S,q;M,i;
+点:E,n;S,m;E,m;S,q;B,v;E,d;B,n;M,m;M,v;E,v;E,vn;E,mq;M,d;M,n;M,i;E,nr;M,nr;E,l;E,i;M,l;M,nt;B,l;M,mq;B,i;B,m;B,q;E,nz;B,nz;M,b;B,b;M,r;M,z;E,z;E,t;E,b;B,vn;E,a;M,nz;E,j;E,q;
+刺:B,v;S,v;B,n;E,v;E,n;B,a;E,vn;B,z;M,n;M,l;E,nr;M,nr;B,ns;M,i;B,o;M,v;B,nz;E,l;M,nz;E,nz;B,vn;
+纽:B,ns;E,n;S,j;B,n;B,nt;E,l;M,nr;B,nrt;M,nz;M,nt;E,nr;M,nrt;E,nrt;
+蓁:E,nr;S,x;M,nr;
+汆:S,v;
+裉:S,g;
+雍:B,n;E,nr;S,nr;B,nr;M,nr;S,j;M,ns;B,ns;B,z;B,i;B,nz;B,l;B,t;M,n;
+姓:E,n;S,v;B,n;E,v;E,b;E,i;E,nrfg;M,nr;E,ns;E,nr;M,n;M,i;E,l;E,vn;
+葖:E,n;
+艚:S,g;
+作:E,vn;B,n;B,v;E,v;S,v;E,n;M,n;M,l;M,i;M,nr;E,ns;E,l;E,i;M,nt;B,i;M,v;B,j;M,ns;E,nr;B,vn;E,a;E,j;B,nz;M,nrfg;M,nz;B,nt;E,b;M,vn;B,b;M,b;
+院:E,n;B,n;E,nt;S,n;E,j;E,l;E,v;M,n;E,nz;M,nt;E,ns;E,nr;E,r;B,s;M,j;E,s;M,ns;M,nr;E,i;E,nrt;B,ns;M,l;M,b;E,vn;B,nz;B,j;
+卤:B,n;S,n;S,v;B,v;E,n;M,nz;M,n;B,a;B,nz;E,nz;
+觳:S,x;B,v;
+煸:S,v;B,n;E,v;
+搁:S,v;E,v;B,v;B,nz;E,nr;
+栉:S,g;M,i;B,v;E,nr;B,i;M,nr;
+撖:S,g;
+耙:S,n;S,v;B,n;E,n;E,i;B,nz;B,v;
+抚:S,vg;B,v;E,n;E,v;M,nr;B,ns;E,nr;E,vn;B,n;M,ns;B,vn;B,i;M,n;B,nz;B,nt;M,nt;M,i;
+踝:E,n;B,n;M,n;
+弧:B,n;S,n;E,n;M,n;M,nz;B,b;M,l;
+攫:B,v;
+振:B,v;S,v;M,nr;E,n;E,v;B,n;B,vn;E,nr;E,a;M,n;E,l;E,i;B,i;M,i;B,nr;B,nz;S,vg;M,l;M,nz;B,l;B,ns;M,nrfg;M,ns;
+肮:B,a;B,ad;
+躲:S,v;B,v;M,l;B,l;E,v;M,i;M,v;E,nr;E,i;E,l;
+眷:E,n;B,n;B,v;B,vn;M,i;E,i;
+徼:S,g;
+揄:E,v;S,g;
+噍:S,vg;
+屑:E,n;S,n;M,n;E,v;M,i;S,ng;E,nz;E,a;E,i;
+婕:E,nr;S,x;M,nr;B,n;
+恙:E,i;E,z;E,l;B,n;E,n;
+远:S,a;E,d;E,a;B,v;B,d;B,n;B,s;E,nr;B,b;M,n;B,ns;B,z;M,z;M,nr;M,s;M,i;E,ns;B,t;E,nz;E,v;E,nrfg;E,nrt;E,b;E,z;B,i;E,l;E,i;M,ns;B,nr;B,l;E,n;M,nt;M,l;B,a;B,nt;M,b;B,nz;E,an;M,nz;E,f;E,j;B,nrt;E,vn;B,vn;B,j;
+团:E,n;B,n;S,n;E,nt;M,n;B,a;E,m;B,v;E,v;M,nt;S,m;E,d;B,d;M,nz;E,r;M,i;E,nz;M,l;E,nr;B,ns;E,i;E,a;E,l;E,j;B,i;B,j;M,v;B,b;M,nr;B,l;B,nt;M,j;M,b;B,q;B,z;M,z;B,vn;B,t;M,vn;
+峦:E,n;S,g;M,i;E,nr;M,nr;M,l;
+惮:E,i;E,v;S,vg;
+坷:E,a;M,n;M,l;M,z;E,z;B,n;
+瓶:S,n;B,n;E,n;E,m;M,n;B,b;E,i;E,nr;S,m;E,r;M,l;E,v;M,ns;M,nz;M,nr;E,nz;
+狺:S,x;
+皋:E,nr;E,ns;S,g;B,ns;M,nr;M,ns;B,nrt;E,nrfg;E,l;
+褊:S,ag;B,a;
+同:E,a;S,p;B,c;B,n;B,d;B,j;E,d;B,v;E,v;E,n;B,b;B,f;M,c;M,n;B,vd;M,i;E,i;E,ns;E,p;M,l;B,i;E,nr;B,ns;M,nr;M,nt;B,vn;E,l;E,vn;B,nr;B,nz;B,r;B,l;B,t;M,vi;M,ns;B,nrt;B,nt;M,nz;E,nrfg;B,m;E,nz;M,v;E,j;M,b;M,s;
+帐:S,q;B,n;S,ng;E,n;E,v;E,m;E,i;B,nz;M,n;
+蒗:E,nrt;S,g;E,nr;M,ns;
+战:B,n;E,v;S,vg;E,n;M,nz;B,vn;E,nz;E,vn;B,v;M,n;B,t;E,j;M,nt;B,nr;E,i;M,l;M,i;E,b;E,l;E,nr;B,i;E,nrt;M,nr;B,z;B,nz;E,a;E,r;E,nrfg;B,l;B,j;M,ns;M,j;
+垡:S,g;B,ns;
+瘠:E,a;S,ag;B,a;M,v;
+冥:S,ng;B,n;B,l;M,l;E,a;B,vn;E,nr;B,i;B,a;M,nr;M,i;B,v;E,v;
+鲧:S,g;
+断:E,d;E,v;S,v;B,v;B,n;E,i;M,n;E,n;B,d;E,a;M,i;B,i;E,l;E,vn;M,ns;M,l;E,ad;B,vn;B,b;E,ns;E,nr;M,b;B,l;B,nz;M,v;M,nr;
+潆:S,x;M,nr;
+诉:E,v;B,vn;B,v;E,vn;S,n;M,n;B,n;M,l;E,i;S,vg;B,l;M,nz;M,b;M,i;E,nr;E,n;
+像:S,v;E,v;E,n;B,v;M,n;E,vn;E,d;B,n;B,a;E,a;M,a;M,l;B,l;M,nz;B,nz;M,nr;M,i;E,nz;E,nrt;
+镢:B,n;
+饪:E,v;E,n;S,g;M,nt;
+胯:S,ng;B,n;M,nr;
+俱:S,dg;B,n;M,i;B,v;M,l;B,a;E,nr;M,nr;M,nt;E,nz;M,j;M,nz;
+桴:S,g;
+铷:S,g;M,nr;
+叹:S,v;E,v;B,v;E,nr;M,n;E,i;M,i;B,i;M,l;E,a;E,vn;B,n;E,l;
+黻:S,g;M,i;
+巽:S,g;M,nr;E,nr;B,ns;
+籼:B,n;M,n;E,n;
+蚀:E,v;S,vg;E,vn;E,n;M,n;E,nz;B,v;E,a;E,i;M,l;B,n;
+肄:B,v;B,n;
+甍:S,g;
+缑:S,g;B,nr;
+颔:B,v;S,vg;
+丛:E,n;B,n;S,nr;B,nr;B,f;B,v;E,nr;S,q;M,n;S,ng;M,l;M,nr;M,m;E,m;B,q;E,q;M,i;B,s;B,ns;B,i;M,z;E,z;
+贝:B,nr;E,n;B,n;M,nz;M,nr;S,j;B,ns;E,nr;B,nrt;M,ns;M,nrt;B,nz;E,q;M,n;M,nt;E,nrt;E,nz;E,v;B,nt;B,j;M,i;
+尧:S,nr;E,nr;M,nr;B,n;B,ns;M,ns;B,nrt;E,n;E,i;M,nrt;E,nrt;
+怯:S,a;E,a;B,a;B,z;E,z;B,n;E,v;E,an;B,v;M,z;
+縻:E,v;S,g;E,nr;
+醺:S,g;E,z;M,z;E,v;
+豇:B,n;
+陋:E,a;B,n;S,ag;M,i;
+遏:B,v;S,vg;E,i;E,v;M,nr;M,i;B,i;
+绐:S,g;
+奕:E,i;M,i;B,z;E,z;
+磔:S,g;E,n;E,nr;
+苘:B,n;S,g;
+睡:S,v;B,v;E,v;B,n;E,vn;B,vn;E,l;E,nr;B,nz;B,i;M,n;
+雠:S,g;
+轱:B,n;B,v;M,n;M,l;
+呷:S,v;E,nr;
+矶:S,g;E,ns;M,ns;E,nr;M,nt;
+幻:B,n;E,n;S,vg;B,v;E,v;B,nr;E,a;M,i;E,i;M,n;E,b;M,l;S,ng;E,nr;E,l;B,nz;M,nr;M,nz;
+篾:E,n;B,n;
+蠊:S,x;E,n;
+熏:S,v;B,vn;B,v;E,v;M,l;B,n;E,nr;B,nz;E,nz;M,nr;
+箓:E,n;E,nrfg;
+夔:S,nr;E,nr;B,ns;B,n;
+辛:B,v;B,nr;B,a;B,nz;S,nr;E,nr;E,a;B,m;M,ns;M,i;B,z;M,z;M,nr;B,ns;E,nrt;B,n;E,n;M,nt;B,nrt;E,i;M,n;M,nrt;E,ns;M,l;B,l;E,an;B,nt;B,nrfg;M,nz;
+眠:E,v;S,vg;E,vn;M,n;E,nr;E,l;M,t;M,l;E,i;E,ns;E,n;B,ns;M,nr;E,nrfg;M,nz;B,n;B,i;
+傥:E,i;S,c;E,a;
+笨:S,a;B,a;E,a;B,n;B,l;M,l;B,i;M,a;E,nr;
+播:E,vn;B,v;S,v;E,v;M,n;B,n;M,nt;B,ns;E,nrt;E,n;E,l;B,vn;E,nr;E,nz;M,b;M,nz;M,i;
+蔬:B,n;E,n;E,j;B,j;S,ng;M,nz;E,nr;B,nz;B,ns;M,i;
+溱:S,g;
+梵:B,nz;B,ns;B,n;B,o;M,n;B,nrt;B,nt;
+褴:B,z;M,l;B,i;
+嘶:S,vg;B,a;B,v;M,i;E,n;E,i;M,nr;S,o;
+犹:B,a;B,v;S,d;B,n;B,nz;M,l;M,i;B,i;B,ns;B,l;M,z;B,z;E,nrt;E,nr;M,ns;M,nr;M,n;E,v;B,nt;B,an;
+债:B,n;S,n;E,n;E,v;E,vn;M,n;B,i;E,l;M,l;M,nt;B,l;M,i;
+粽:B,n;
+埋:B,v;S,v;E,v;E,vn;M,i;M,n;B,i;B,vn;B,a;M,v;B,n;
+桊:S,g;
+铍:S,g;E,n;E,nr;
+减:B,v;E,v;B,vn;S,v;B,n;E,vn;M,i;B,j;E,i;M,n;B,nz;B,l;E,l;M,nz;
+黑:B,n;S,a;B,ns;B,nr;E,z;B,z;E,v;B,a;E,ns;E,nr;B,b;M,n;M,ns;B,l;E,nrt;M,i;B,nrt;B,nz;E,n;M,nr;B,i;E,b;E,l;M,l;B,nt;E,i;E,a;M,z;E,nz;M,v;M,nt;E,j;M,nz;
+寓:B,n;E,n;S,vg;B,v;E,v;M,n;B,l;B,i;M,nr;E,nr;M,b;
+飕:S,o;E,z;M,z;E,o;B,o;
+旗:B,n;E,n;S,n;E,nr;E,ns;M,nt;M,i;M,nr;B,i;M,ns;E,v;M,l;M,n;E,vn;M,nz;E,nz;E,nt;B,nrt;E,l;
+聚:B,v;S,v;E,v;B,n;M,n;M,nz;B,l;B,vn;M,nr;E,nr;B,i;B,nz;B,ns;M,i;E,nz;E,i;E,vn;M,l;M,ns;
+槟:B,n;E,n;M,n;
+坠:S,v;B,v;E,i;E,v;B,n;E,n;M,n;M,i;E,nz;B,vn;
+鹦:B,n;B,i;M,nr;
+敬:B,v;E,v;M,nr;S,v;B,nr;E,a;E,nr;B,n;M,z;E,z;E,i;B,i;B,vn;M,i;B,l;E,l;M,l;M,ns;E,nrfg;
+诳:S,v;B,n;
+闷:S,v;E,a;E,v;B,n;B,a;B,an;B,i;M,i;E,n;B,l;B,v;M,z;B,z;M,v;M,a;B,d;B,b;E,ad;
+怅:E,a;B,a;B,d;B,i;M,d;
+了:S,ul;E,p;B,v;E,v;E,l;E,y;B,a;M,i;E,u;M,l;E,d;E,t;B,i;E,n;E,i;B,l;M,v;M,nr;B,nr;E,b;B,n;E,nr;E,nrfg;M,n;E,vn;
+馔:S,g;E,n;M,i;
+暖:S,a;E,v;E,an;B,n;M,nr;B,z;E,a;B,a;M,z;E,n;M,n;B,v;M,l;M,nz;E,nr;B,b;E,i;M,i;E,b;B,ns;E,vn;M,j;B,nz;
+伛:B,v;S,v;
+悚:M,i;S,g;B,a;E,a;E,nr;
+谝:S,g;
+阡:B,n;M,ns;E,nrfg;
+匣:B,n;E,n;E,ns;M,n;
+约:S,d;E,n;E,v;E,d;B,vn;E,ns;B,v;M,n;B,nrt;E,j;B,n;M,nt;E,z;B,ns;M,ns;B,d;M,i;M,z;E,a;B,nz;E,nr;M,nr;E,vn;B,i;M,vn;M,b;M,l;E,nrt;E,l;E,i;B,nr;E,nz;M,nz;M,v;M,nrt;B,nt;
+末:S,f;E,t;B,n;E,c;E,n;B,f;M,nr;E,nr;M,t;B,t;M,i;M,nrt;E,ns;M,n;E,i;M,l;E,f;E,a;B,d;B,l;E,r;M,ns;E,l;
+芮:B,nr;S,nr;E,nr;B,ns;M,nr;
+男:B,n;S,b;E,nr;B,i;B,l;M,l;M,n;E,n;B,j;M,i;M,nr;M,nt;B,v;B,b;M,nz;B,nt;
+隶:E,n;B,v;M,n;E,ns;S,j;M,l;B,n;M,nr;E,nr;S,ng;M,nt;E,v;
+邺:S,g;E,nr;M,nr;
+荃:E,nr;S,g;M,nr;B,ns;
+菘:S,g;M,nr;
+汝:M,nr;B,nr;S,r;S,nr;B,ns;E,nr;B,n;B,nz;M,nrfg;M,l;S,rg;
+葭:S,g;M,nr;
+拮:B,a;B,n;B,v;
+啷:S,x;E,o;
+彻:B,ad;E,v;S,vg;M,ns;E,a;E,nr;B,d;M,i;B,i;M,nr;B,z;M,nt;B,n;M,nrt;B,l;B,vn;E,nrt;M,z;
+沃:B,nr;E,a;E,nz;B,nz;M,nr;S,nr;E,nr;B,ns;M,ns;B,nrt;B,n;E,ns;E,nrt;B,i;M,nrt;S,vg;M,nz;B,nt;M,nt;M,i;
+脆:E,d;B,a;S,a;E,a;B,n;E,n;M,i;M,l;B,z;E,nz;E,z;M,z;B,nz;
+蜊:E,n;S,x;
+娌:S,x;E,n;M,nr;E,nr;
+氘:S,g;B,n;
+肛:B,n;E,n;
+鲣:B,n;
+琨:E,nr;S,g;M,nr;
+枵:S,g;
+强:E,v;S,a;B,a;B,v;B,n;E,a;E,nr;E,n;B,vn;B,l;B,d;B,nr;M,i;M,l;M,n;E,nrfg;E,b;B,b;B,i;E,i;E,nt;M,nr;B,nz;E,nrt;E,nz;E,j;E,l;M,z;E,z;M,nz;E,r;E,ns;M,ns;M,b;B,nt;M,nrfg;E,ad;B,j;
+唾:B,n;S,v;B,v;B,i;
+见:S,v;E,v;B,v;E,n;E,a;B,n;M,i;E,nr;M,nr;M,n;E,i;B,i;E,c;E,l;M,v;E,d;M,l;B,l;M,d;B,a;B,m;B,d;E,r;E,u;E,nrt;M,nz;M,m;B,t;E,nrfg;B,vn;E,nz;
+迅:B,ad;E,nr;B,a;S,ag;M,nr;B,d;B,i;B,z;B,n;B,nz;M,nt;M,ns;M,nz;
+藉:S,vg;E,v;E,i;E,a;E,l;E,vn;E,nr;E,nz;M,nr;
+金:E,n;B,n;S,b;B,nr;M,n;S,ng;M,nr;B,nz;B,ns;E,nr;M,nt;E,v;B,nrfg;M,nz;E,nz;M,ns;B,i;E,l;E,ns;B,nrt;M,l;M,i;B,z;E,j;B,l;B,t;E,nrt;E,t;B,b;M,b;M,t;E,b;E,i;M,nrt;E,m;B,j;B,nt;B,a;E,nt;E,nrfg;M,vn;E,vn;E,q;M,nrfg;
+獒:S,g;E,nr;
+蕞:S,x;
+周:E,t;B,t;B,n;B,nr;S,nr;M,n;B,f;E,m;E,f;S,m;E,nr;B,v;E,n;B,m;B,a;E,r;B,ns;B,vn;B,nz;M,nr;M,m;M,i;B,nrfg;B,q;E,ns;E,nrfg;M,l;B,i;B,nrt;B,l;S,q;E,a;M,f;B,ad;E,nrt;M,ns;E,j;M,a;E,v;B,an;E,i;
+恰:B,d;S,d;E,d;B,a;B,v;M,c;B,c;B,i;B,ns;M,nr;E,nr;M,ns;E,nrt;E,ns;B,nr;B,nrt;
+晴:S,v;E,nr;B,nz;B,n;B,a;M,nr;B,i;B,l;E,v;B,v;E,i;E,l;B,ns;E,n;B,nrt;B,z;
+叽:B,o;S,o;M,o;E,o;E,n;B,v;B,l;
+椁:S,g;E,n;E,nr;M,nr;
+攉:S,v;
+蒈:S,g;
+验:E,vn;E,n;E,v;M,n;B,v;S,v;B,vn;E,a;B,n;M,nt;E,nr;M,i;E,l;M,nz;E,b;B,l;M,nr;B,nz;
+隔:S,v;E,v;B,v;E,n;B,vn;B,n;B,s;B,b;M,l;B,l;B,nz;B,d;E,nr;M,n;B,i;E,i;M,i;E,l;B,ns;B,nt;
+箢:S,x;
+锩:S,v;
+瞪:S,v;M,i;B,v;M,z;E,z;M,n;M,v;E,a;
+港:E,ns;B,n;S,j;E,n;B,m;M,m;M,nt;M,n;M,ns;E,nr;B,j;M,nz;E,r;E,nz;E,v;B,ns;M,nr;E,j;M,j;B,b;B,nz;E,l;B,l;M,b;
+莲:M,nr;B,n;S,ng;E,nr;E,n;M,n;B,ns;B,nrt;E,ns;B,nt;B,nz;M,ns;M,nz;E,nz;M,nrfg;E,nrfg;
+稷:E,n;S,g;E,nr;B,ns;M,nr;
+岸:E,n;E,s;E,f;S,n;B,s;M,n;B,n;E,v;E,nr;E,vn;M,nr;M,i;E,nrt;E,ns;E,a;M,ns;E,i;M,nt;B,nr;E,l;M,nrfg;B,z;E,nz;E,nrfg;
+瘿:S,g;E,n;E,nr;M,n;
+检:B,vn;B,v;B,n;E,v;S,v;E,j;B,b;M,n;M,nt;M,j;E,vn;E,nr;M,nr;E,n;B,nz;M,nz;
+艇:E,n;S,n;B,n;E,nr;S,ng;M,nt;M,n;
+鹏:E,nr;S,nr;M,nr;E,n;E,nz;B,nz;M,nrfg;E,nrfg;B,i;M,ns;B,ns;
+兑:S,v;B,v;E,v;E,vn;B,n;E,nr;B,vn;M,n;E,l;
+盔:E,n;B,n;M,i;B,nz;
+浙:B,ns;S,j;E,j;B,nt;B,nz;E,nz;E,nr;M,nr;B,n;M,nt;B,j;
+俚:B,n;E,a;
+苜:B,n;M,l;B,ns;
+铨:E,nr;S,g;B,v;M,nr;
+淮:B,ns;S,j;E,j;M,ns;E,nr;B,nz;M,nr;B,n;E,ns;E,nrfg;M,j;E,nrt;B,nrt;M,nz;B,nt;
+腱:E,n;B,n;
+揲:S,g;
+婷:E,nr;M,nr;S,x;E,nz;E,i;M,i;E,z;M,z;E,nrt;
+偻:E,v;M,n;E,n;S,x;
+掇:E,v;S,g;
+耆:E,ns;S,ng;B,n;E,nr;M,ns;
+膛:E,n;S,ng;M,nr;E,v;B,n;M,n;
+螟:E,n;B,n;M,n;
+庥:S,g;E,nr;M,nr;
+缤:M,i;B,z;B,l;
+咩:S,o;
+用:E,v;S,p;E,n;B,v;E,vn;B,n;M,n;E,b;E,a;E,d;E,l;B,d;B,l;B,vn;M,l;M,nr;E,nr;E,ns;M,nt;E,nt;E,i;E,nz;M,i;E,r;B,a;B,i;M,v;M,nz;B,nz;M,nrfg;M,j;M,vn;M,b;B,nt;
+悱:M,i;S,vg;B,a;
+蜴:E,n;S,x;
+粹:E,a;E,d;E,n;M,n;E,b;M,nr;S,ng;E,nr;E,an;
+吾:S,r;M,nz;E,nr;M,ns;E,v;M,nr;M,v;B,r;E,ns;M,nt;M,i;E,nrfg;B,nrt;M,l;B,l;
+裁:E,n;B,v;B,n;E,v;S,v;E,vn;E,a;M,n;B,vn;E,ad;E,i;E,nr;B,nz;M,j;M,nr;M,i;M,nt;B,j;
+蓉:E,n;E,nr;M,ns;S,j;M,nr;E,i;B,ns;E,nz;E,j;M,i;
+始:E,v;S,vg;B,d;E,a;B,v;M,n;B,n;M,nr;M,l;B,i;M,i;M,ns;E,nz;E,i;E,vn;E,n;E,d;M,v;E,ns;B,nrt;E,nr;B,ns;M,nrt;E,b;E,l;
+忏:B,v;B,vn;B,n;E,v;
+郑:B,ns;B,nr;S,nr;B,nrfg;B,nt;E,ns;B,a;E,nr;M,ns;B,i;B,j;M,nr;E,nrt;S,j;B,nz;
+嗓:B,n;S,q;S,ng;M,n;M,nz;E,n;M,v;
+牒:S,g;E,n;E,l;E,nr;
+雕:B,n;E,n;S,v;B,v;E,nr;B,b;M,i;B,i;E,i;E,nrt;B,l;E,nz;M,n;B,vn;
+毗:B,v;B,nrt;B,n;E,n;M,nz;B,vn;M,ns;
+奠:B,v;B,n;S,vg;E,v;M,nr;E,nr;E,vn;
+彤:E,nrfg;E,z;M,z;B,n;
+珧:M,nr;S,g;E,nr;M,n;
+觫:E,v;
+陪:S,v;B,v;B,n;E,v;E,nr;B,vn;E,j;E,n;M,nr;M,n;E,l;B,l;
+慰:E,v;B,v;E,a;S,vg;E,nr;M,nr;B,n;E,vn;B,vn;M,n;E,i;E,an;
+清:B,a;S,a;B,n;B,t;B,v;E,v;E,nr;M,nr;E,t;B,vn;E,n;B,ns;E,b;B,z;M,z;B,nt;B,nr;E,l;M,l;M,t;M,ns;B,j;B,l;B,i;M,n;E,a;E,vn;M,i;E,ns;B,nz;B,b;B,nrt;E,z;E,i;M,nt;E,nrfg;M,nz;E,nrt;E,j;E,an;B,an;E,nz;B,ad;M,nrfg;M,nrt;
+辄:E,d;S,dg;M,i;E,v;S,g;
+稍:S,d;B,d;E,d;B,v;B,l;B,i;B,f;
+瀑:B,n;S,ng;E,n;M,ns;E,nr;M,nr;
+醐:E,n;M,i;
+瘕:S,g;
+鞔:S,v;
+谙:E,v;B,v;B,a;M,l;
+撞:S,v;B,v;E,v;E,vn;M,z;E,z;E,a;E,i;B,vn;M,n;B,n;M,i;E,n;E,l;E,nr;
+鸥:E,n;S,ng;E,nr;M,nr;B,n;
+漯:B,ns;
+钾:S,n;B,n;E,n;E,nz;B,nz;M,nz;E,nr;M,n;
+赃:E,v;B,n;S,ng;M,i;E,vn;E,n;E,i;
+久:S,a;E,m;E,a;E,r;B,v;E,d;B,d;M,t;E,b;M,n;E,t;E,nr;M,i;M,l;M,nr;B,i;E,i;B,z;M,m;B,l;E,l;B,t;E,v;M,v;E,ad;B,a;B,nrt;B,nr;B,nz;E,ns;E,n;B,ns;M,ns;
+荇:S,x;M,nr;
+篌:E,n;S,x;
+镓:S,g;E,n;E,nz;E,nr;M,nr;
+菜:E,n;S,n;B,n;M,n;E,v;M,nr;B,ns;E,nr;M,nz;E,l;E,nz;E,i;M,ns;B,nz;M,l;M,v;E,a;
+僦:S,g;
+门:E,n;S,n;B,n;B,s;E,v;E,ns;E,d;M,n;E,m;M,ns;E,nr;M,l;S,m;B,nr;E,a;M,i;M,nr;M,nt;B,v;E,i;E,nrt;M,nz;E,r;B,i;E,l;E,nz;M,s;B,nz;B,nrt;M,vn;B,ns;M,r;B,j;E,s;M,v;E,j;M,nrt;E,b;E,vn;M,d;M,a;E,nt;B,l;
+佯:B,v;E,v;
+泮:E,nr;S,nr;B,nr;E,nz;M,nr;B,nz;
+聱:M,i;B,a;S,x;
+养:E,v;E,n;S,v;B,v;B,vn;B,n;M,n;B,nr;M,nr;M,l;E,vn;M,i;B,i;E,nr;B,l;M,nz;B,a;E,i;M,v;B,j;M,b;B,nz;E,l;B,nrt;M,nt;B,ns;M,j;
+绺:S,q;
+溃:E,v;B,v;S,vg;B,n;M,n;B,i;E,i;
+褂:S,ng;E,n;B,n;
+茆:S,nr;E,ns;
+蔊:B,n;
+鼎:E,nr;S,ng;E,n;B,z;M,i;M,nr;B,v;E,v;M,l;E,nz;E,i;B,i;E,l;B,ns;B,d;B,n;M,n;B,l;M,nrfg;M,nz;M,ns;E,ns;B,nz;
+皓:E,nrfg;B,nz;M,i;B,i;B,n;B,a;
+怜:E,v;B,v;E,a;S,vg;M,z;E,i;M,v;M,n;B,i;B,vn;E,nr;M,nr;M,l;E,vn;M,i;
+审:B,v;B,vn;E,v;S,v;E,n;E,vn;B,a;B,n;M,j;M,n;M,nr;B,i;M,ns;E,b;E,j;M,nt;E,nr;B,nz;E,ns;B,j;
+稠:B,a;S,a;E,a;E,nr;M,n;M,i;M,nz;B,n;B,i;
+垩:M,n;E,n;S,g;M,t;
+榭:S,g;E,n;E,ns;M,ns;E,nrt;E,nr;M,nr;E,i;M,i;
+舰:E,n;B,n;S,ng;B,b;M,nt;E,nr;M,nz;M,nr;E,nt;
+羹:S,ng;E,n;M,nr;B,n;M,l;M,i;E,i;E,nr;E,nz;
+鸸:B,n;
+逼:S,v;B,v;E,v;M,i;B,a;B,i;B,z;B,vn;M,l;M,nr;B,l;E,vn;
+圾:E,n;M,n;S,x;
+证:B,n;E,v;B,v;E,j;S,n;E,n;M,nt;M,n;B,j;E,vn;E,nr;E,a;M,nz;M,j;M,l;M,nr;E,nz;M,v;B,l;M,i;B,nz;E,i;M,ns;M,b;
+仃:S,x;M,ns;E,i;E,a;E,nrfg;E,nr;
+楂:E,n;S,x;M,n;M,z;E,z;
+捆:S,v;B,v;E,m;B,b;E,v;B,n;M,n;E,nz;S,m;
+乘:S,v;B,n;B,v;B,d;E,nz;E,v;E,nr;B,p;E,n;B,i;M,i;B,l;B,nz;E,z;M,nr;E,i;M,n;E,mq;E,l;B,vn;E,a;B,b;E,vn;M,l;M,ns;
+招:B,v;B,n;S,n;B,vn;B,nt;B,j;S,v;B,nr;E,m;M,v;E,n;B,i;B,l;M,i;E,v;E,nr;M,n;E,j;B,ad;M,nr;B,ns;M,l;E,l;B,nz;E,i;M,ns;S,m;E,vn;M,nz;
+赚:S,v;B,v;E,v;B,n;E,nr;M,l;E,l;
+绣:S,v;E,n;B,n;B,v;M,nr;E,nr;M,i;B,nz;E,nz;B,i;M,ns;M,l;E,v;M,n;M,nz;B,vn;
+烧:S,v;E,v;B,v;B,n;M,n;E,n;M,i;M,ns;E,b;B,vn;E,i;B,a;E,l;B,l;M,nr;M,l;B,nz;E,vn;
+器:E,n;B,n;S,n;M,n;E,nz;E,l;E,nr;M,t;M,l;B,v;E,nt;M,nt;E,v;S,k;E,a;E,i;M,nr;B,b;M,v;B,vn;B,i;E,nrfg;E,b;E,j;M,i;B,l;M,nz;M,b;M,ns;
+扰:E,v;S,v;B,v;B,vn;E,vn;M,n;E,l;M,nz;B,n;E,i;E,nr;M,i;M,nr;
+蛳:S,x;E,n;
+函:B,n;S,n;E,n;M,l;E,v;M,n;E,nr;B,v;B,vn;M,nr;B,j;M,nt;M,i;
+灼:S,vg;B,z;E,a;B,v;E,z;B,n;E,vn;M,n;M,i;E,nr;E,v;S,ag;M,nr;
+铿:B,a;S,o;E,nr;B,i;M,o;B,o;M,nr;
+有:S,v;E,v;B,r;B,v;B,a;E,b;B,n;B,vn;B,d;M,n;B,l;E,vn;E,c;B,b;M,i;M,l;M,nr;B,i;E,i;E,d;B,nr;E,a;B,m;M,nt;M,v;E,nr;E,l;M,nrfg;M,b;E,nz;M,c;B,nz;M,t;M,vn;M,nz;M,m;B,j;E,nrfg;E,j;
+颌:E,n;M,n;B,n;
+冒:S,v;B,v;E,v;B,n;E,vn;B,a;M,i;B,i;B,vn;M,n;E,n;M,z;B,z;M,l;B,vd;M,j;B,b;M,vn;E,l;E,nr;
+钔:S,g;
+殖:B,n;E,vn;E,v;M,n;B,v;E,l;B,vn;E,n;E,b;M,v;E,nz;M,l;M,nz;
+枞:B,ns;B,n;
+氯:B,n;S,n;M,n;B,v;B,nz;M,nz;E,n;E,nz;
+砷:S,n;B,n;E,nr;E,n;M,n;B,l;
+庸:B,a;E,a;M,ns;E,n;M,l;E,d;B,n;M,i;E,nrt;E,nrfg;B,z;B,i;B,v;M,z;M,n;E,v;M,nr;
+爻:S,g;B,n;E,nr;E,n;
+泄:S,vg;E,v;B,v;M,i;M,n;B,n;B,vn;M,nr;B,i;B,l;E,vn;
+卑:E,n;B,n;B,a;S,ag;M,ns;E,a;M,i;E,i;B,ns;M,n;B,l;B,i;E,nr;B,an;M,nz;M,l;
+狐:B,n;S,nr;E,nz;B,v;S,ng;E,n;B,i;M,nr;M,n;M,i;E,nr;E,v;M,nt;
+啕:E,d;M,l;E,v;S,g;
+慝:S,g;
+胜:B,vn;E,v;S,v;M,n;B,n;E,nr;E,n;B,v;M,i;M,nr;E,i;M,l;E,ns;E,nz;M,ns;B,l;E,l;E,b;B,nt;B,i;B,nz;M,nz;B,ns;M,nrfg;E,j;E,nrfg;E,a;M,nrt;B,nr;E,nrt;E,vn;B,t;
+另:S,r;B,c;B,d;B,n;B,i;B,v;B,l;E,nr;M,nr;M,i;
+雨:S,n;E,n;B,n;E,nr;M,n;E,v;M,i;E,i;B,nr;M,nr;B,t;E,l;E,vn;E,nrfg;B,i;M,l;B,ns;B,l;E,t;E,nz;M,nz;E,b;E,nrt;
+嗪:E,n;S,g;M,n;E,nz;
+濮:B,ns;S,nr;B,nr;M,nr;E,nr;
+酽:S,a;
+矾:M,n;E,n;B,n;M,nz;B,ns;
+舆:B,n;E,n;B,i;M,ns;E,ns;M,l;
+匐:E,v;S,x;M,n;
+递:E,v;B,v;S,v;E,vn;B,vn;M,n;E,nr;E,nt;B,n;E,l;B,l;B,ns;E,ns;
+唔:S,y;E,o;
+莛:S,g;
+笠:E,n;E,nr;E,i;
+眨:S,v;B,v;M,i;B,l;
+梭:B,n;S,ng;E,v;E,nr;S,q;E,n;E,nrt;B,nrt;M,nr;E,nz;M,n;B,nz;E,i;B,ns;E,b;
+抱:S,v;B,v;E,v;E,n;B,a;B,n;B,i;E,nr;M,i;M,nr;B,l;M,l;M,b;E,l;B,ns;B,nrt;
+撵:S,v;B,v;
+娶:S,v;E,v;B,v;B,vn;E,n;E,i;E,l;
+纹:E,n;S,ng;M,n;B,n;E,nr;M,nr;B,i;E,b;E,nz;M,ns;M,nz;M,i;
+尺:B,n;E,m;E,n;S,q;E,nr;E,i;E,q;S,m;M,n;M,i;E,l;M,b;M,l;E,v;B,i;M,v;M,nz;M,ns;
+炽:B,a;M,n;S,ag;E,nr;E,a;M,nr;E,b;
+促:B,v;E,v;S,v;E,a;B,vn;B,n;M,nt;E,ad;M,i;B,a;E,n;B,nz;B,i;M,j;E,nr;B,l;E,j;
+桂:E,nr;B,ns;B,nr;M,nr;B,n;S,j;S,nr;E,n;E,j;M,nt;S,ng;B,nz;M,nz;B,j;M,n;E,nrt;M,ns;E,i;M,nrfg;E,v;E,nz;B,nrfg;M,v;B,nt;B,i;
+蛉:S,x;E,n;E,nr;
+摊:B,n;S,n;S,v;B,v;E,m;E,n;E,v;E,vn;M,n;B,s;M,v;E,l;E,nr;S,m;
+铕:S,n;
+佘:B,nr;S,nr;B,ns;
+豚:E,n;B,n;
+虞:B,nr;E,nr;M,nr;S,nr;E,v;S,t;E,ns;S,ng;M,ns;B,ns;M,i;B,n;B,nrfg;
+燧:E,n;B,n;B,nrt;E,nrfg;
+坨:S,v;S,q;B,n;M,n;E,ns;
+诫:E,v;E,vn;E,i;B,v;
+路:E,n;S,n;B,n;E,m;B,s;E,v;E,ns;M,n;E,nz;B,v;M,l;B,nr;E,nr;B,ns;E,r;E,l;M,ns;S,m;E,i;B,nrt;M,nr;E,nrt;B,nz;M,i;E,f;M,nt;M,m;E,vn;M,nz;E,nt;M,q;M,j;E,b;B,i;M,nrt;M,s;B,l;E,a;E,nrfg;E,mq;B,f;E,j;
+整:E,vn;B,n;B,b;B,v;E,a;B,d;E,v;B,vn;B,m;S,m;B,a;E,d;S,v;M,m;M,n;M,z;B,z;B,l;B,nz;M,i;E,m;B,i;E,z;M,t;E,nr;M,nr;E,l;E,n;M,nz;M,l;M,nt;
+氅:S,g;E,n;M,nr;
+趄:E,v;S,v;M,v;
+螈:S,x;E,n;E,nr;
+砍:S,v;B,v;B,n;E,v;B,vn;B,i;M,l;M,i;
+育:E,vn;E,v;M,n;E,n;E,l;B,v;S,vg;M,nr;B,vn;M,nt;M,l;E,nr;M,t;B,n;M,ns;B,b;E,nrt;M,i;B,nrt;B,ns;M,nz;E,j;B,nz;M,nrfg;M,nrt;
+骶:M,n;B,n;
+鲺:S,g;
+冼:B,nr;S,nr;B,nrfg;
+难:S,a;B,d;E,an;B,n;B,v;B,a;E,n;E,a;E,v;E,d;M,i;M,l;B,l;B,i;M,n;E,i;E,l;E,z;E,vn;E,nr;E,b;M,nr;B,nz;M,nt;M,ns;M,j;E,j;
+淄:B,ns;E,ns;M,ns;M,nrt;
+塍:S,g;E,nr;E,n;E,ns;
+剑:S,n;E,n;E,nr;M,nr;B,n;B,ns;B,nt;E,v;E,nz;E,i;E,vn;M,nt;M,i;B,i;E,l;B,nz;M,n;M,l;M,nrfg;E,nrfg;B,nr;B,nrt;
+珐:B,n;
+靓:B,a;S,g;B,n;E,nr;M,nr;M,i;
+呕:B,v;S,y;B,vn;B,i;E,v;E,i;
+痔:B,n;E,n;B,nz;
+还:S,d;B,v;B,c;E,v;M,i;B,n;M,l;B,vn;B,nz;B,l;M,nr;E,nr;E,i;M,n;B,nr;B,ns;E,l;
+哪:B,r;S,r;B,c;B,mq;B,nrt;B,l;M,nr;E,nr;
+葵:E,n;B,n;B,nrt;M,nr;B,ns;M,nz;
+遽:E,a;B,d;
+盾:E,an;S,q;B,n;E,n;E,nr;E,l;E,i;M,n;M,nz;S,m;E,m;E,nz;M,ns;M,nr;
+梃:B,n;
+暇:S,g;E,n;E,d;E,i;M,i;E,nr;M,l;
+希:B,v;B,ns;M,nr;B,nr;M,ns;S,j;E,nr;B,n;B,nrt;S,v;B,nz;M,nz;E,nrt;E,nz;B,nt;B,a;M,nrt;B,l;B,vn;B,i;M,nt;M,l;
+吐:S,v;B,ns;E,v;B,v;M,n;M,i;B,n;E,i;E,vn;E,n;B,nr;B,nz;M,nr;E,nr;M,l;B,o;B,nrt;B,i;M,ns;M,nt;B,l;M,nrt;
+芟:B,v;
+宥:S,g;E,v;E,n;E,nr;
+隧:B,n;S,ng;M,n;E,n;M,nt;
+踬:S,vg;
+舴:S,x;B,n;
+禹:B,nr;E,nr;S,nr;E,nz;B,ns;M,nr;M,l;E,nrfg;E,ns;
+瞽:S,g;
+阼:S,g;
+诅:B,v;E,v;
+峋:S,x;E,z;E,l;E,i;E,nr;
+滗:S,v;
+赖:E,v;S,v;E,n;B,nr;M,n;B,v;M,v;M,nr;B,l;B,n;E,nr;B,nrt;E,i;E,a;M,nt;M,nrt;M,i;E,l;E,ns;M,ns;E,nrt;M,l;
+拟:S,v;E,v;B,v;E,b;B,d;B,n;E,vn;E,i;M,n;M,b;M,nz;B,b;M,v;B,vn;
+屠:B,vn;B,v;B,n;S,v;B,nr;M,n;E,nr;M,nr;E,n;M,nz;E,i;E,nz;M,i;M,ns;E,nrt;B,ns;
+镦:S,g;E,nr;E,nz;
+鍪:S,x;E,n;
+俭:E,nr;E,a;S,ag;M,i;M,l;B,a;B,v;M,nr;E,ad;E,i;
+胳:B,n;B,l;B,v;
+姹:B,i;
+埽:S,g;
+洁:E,a;E,nr;S,ag;B,z;M,n;B,a;E,v;M,nr;E,z;M,l;B,n;B,i;B,nz;E,l;E,n;E,nz;M,nz;E,i;M,v;B,v;E,nrfg;M,i;E,j;M,nt;B,l;
+愉:B,a;E,a;
+甑:S,nr;E,nr;B,n;
+钐:S,g;
+垒:E,n;S,v;E,v;E,nr;B,n;E,i;B,v;M,nr;M,n;E,b;E,nz;M,ns;M,nt;M,nz;M,i;
+猕:B,n;
+褙:S,g;E,v;
+殚:B,i;
+嘧:B,n;S,x;M,n;E,nr;
+京:E,ns;S,j;M,nt;B,ns;M,ns;B,n;B,nz;E,v;M,n;E,nr;E,nz;M,nr;B,j;M,nz;E,n;B,nt;E,nrt;E,nrfg;B,nrt;E,j;M,nrfg;M,i;M,j;
+樯:S,ng;E,n;E,nr;B,n;
+嚼:S,v;E,v;M,i;B,n;M,l;B,v;M,n;
+爿:S,q;E,nr;M,nr;
+绌:E,i;S,g;
+道:S,q;E,v;E,n;B,n;E,d;E,m;M,n;M,nr;E,nr;E,i;B,nz;E,l;B,j;E,ns;E,a;B,v;B,nr;M,l;M,i;B,s;M,ns;B,ns;E,nz;M,nt;S,m;E,mq;M,mq;B,i;B,t;B,nrt;M,nrfg;E,nrt;M,a;M,d;E,s;M,j;B,l;B,nt;M,nz;M,z;E,nrfg;E,z;M,v;E,an;E,j;M,b;M,s;
+单:B,n;S,d;E,a;E,n;B,b;B,a;B,d;B,nr;E,v;E,d;E,j;E,c;B,v;B,nz;M,n;M,l;B,i;E,nr;M,z;E,z;M,nr;M,v;E,ns;M,i;B,l;M,ns;B,ns;M,j;M,m;E,nrt;M,vn;B,nrfg;M,b;
+裘:B,nr;S,nr;B,n;E,nr;E,n;E,i;M,nr;M,i;B,nrt;
+嗦:E,v;S,x;E,a;E,z;
+部:B,n;E,f;E,n;E,m;M,m;S,q;M,n;E,nt;B,v;M,l;E,r;S,m;M,mq;E,j;B,j;M,nt;E,nr;B,b;E,v;M,nr;E,nz;E,ns;M,i;E,b;M,b;E,nrt;M,v;E,s;M,ns;B,nz;B,vn;M,j;
+只:S,d;E,m;B,d;B,v;B,c;S,m;E,n;B,i;E,c;E,nr;B,b;B,l;E,d;M,i;B,n;E,i;M,n;M,ns;M,v;
+轭:S,g;M,n;
+呻:B,v;M,i;
+剿:S,v;E,v;B,v;E,vn;B,vn;
+枇:B,n;B,ns;
+萆:S,x;
+唐:B,nr;B,t;S,nr;E,t;S,j;B,ns;E,nr;S,tg;E,nz;B,n;E,a;M,nr;M,nz;E,j;B,nrt;M,n;M,ns;B,v;M,nrt;B,nrfg;S,nt;B,nz;B,nt;E,ns;E,nrt;M,nt;E,nrfg;
+阒:S,g;B,i;
+辗:B,v;B,i;B,l;
+薛:B,nr;S,nr;M,nr;E,n;E,nr;B,ns;
+素:E,n;S,n;B,n;E,nr;B,v;E,l;M,nr;E,a;B,d;E,nz;S,ng;M,n;E,i;E,d;B,a;E,ns;B,i;E,v;S,dg;S,a;B,ns;M,ns;M,i;M,nrt;M,nt;M,l;B,nrt;M,nz;E,nrt;B,t;S,ad;
+笤:B,n;
+傩:S,g;B,n;
+抵:B,v;B,vn;S,v;E,v;B,n;E,d;M,l;E,n;B,d;E,b;
+茴:B,n;M,n;
+碹:S,g;
+倾:B,v;B,n;S,v;M,v;M,n;E,b;B,i;M,i;B,vn;M,l;M,nr;B,z;B,d;E,i;E,nr;B,l;M,nz;
+摆:B,v;S,v;E,v;B,n;M,l;E,n;M,v;E,i;B,l;M,i;B,vn;B,b;E,vn;M,nz;M,n;
+黍:S,ng;E,n;B,n;
+硎:S,g;E,nr;
+铑:S,g;
+秣:E,n;S,g;M,i;E,nr;B,i;M,nr;
+孤:S,a;B,n;B,a;B,v;S,ng;B,i;B,nr;B,z;B,l;M,i;E,nr;E,v;M,nr;B,ns;M,z;B,b;E,n;M,ns;E,l;M,l;B,ad;B,j;
+全:B,n;S,a;E,ad;B,m;E,an;B,ad;B,d;E,v;M,n;B,b;B,nt;E,a;B,nr;B,nz;E,nr;B,i;M,j;M,i;B,vn;M,nr;M,nt;B,l;M,nz;E,i;B,v;M,l;E,n;E,l;E,nz;B,j;M,z;E,z;M,nrfg;M,m;B,ns;E,ns;E,nrfg;B,nrt;M,t;M,ns;M,b;
+跫:S,x;E,nr;
+误:E,n;E,v;B,n;S,v;B,v;E,vn;B,vn;B,i;E,nr;M,l;B,l;E,i;E,l;M,n;M,i;M,v;
+数:E,n;B,n;E,m;B,m;S,m;M,n;M,m;E,l;E,v;E,d;M,l;E,i;B,j;B,v;E,nz;E,a;B,l;M,v;B,vn;E,nr;B,i;M,i;M,nr;M,nt;B,t;B,b;B,nrt;M,nz;B,nz;
+至:S,p;E,d;E,v;B,d;B,p;E,c;M,d;B,v;B,l;M,c;M,nr;E,ns;E,nr;M,i;M,l;B,nz;E,t;E,i;E,p;B,i;B,n;E,f;E,l;M,n;E,z;E,n;M,ns;E,nrfg;M,nz;
+壹:S,m;B,m;E,nr;E,m;M,nr;M,m;
+祸:S,n;E,n;B,n;E,i;M,i;E,v;B,i;E,l;B,v;M,l;B,l;M,n;
+闻:E,n;S,v;B,v;B,nr;M,n;E,nr;E,i;E,v;M,i;B,l;M,nr;B,i;M,nt;E,nz;E,a;B,n;E,l;B,nrfg;M,l;B,ns;M,j;M,nz;E,nrfg;M,ns;B,nz;M,nrfg;E,ns;
+国:E,ns;B,n;E,n;S,n;M,nt;B,s;M,n;E,r;B,nt;M,nr;E,v;M,l;B,vn;B,j;B,nz;E,nr;M,nz;B,b;E,nt;B,nr;E,a;M,ns;B,t;E,b;B,v;E,vn;E,t;B,l;E,nrt;M,i;E,nz;B,i;E,i;E,nrfg;B,ns;M,b;M,j;E,l;B,nrt;M,nrfg;E,s;E,j;M,v;M,vn;M,nrt;
+膈:E,n;M,n;
+龌:B,a;M,i;
+众:E,n;S,ng;B,n;B,m;B,i;E,v;M,i;E,i;M,l;M,nz;M,n;E,nr;E,d;E,nt;M,nr;E,a;M,nt;M,j;M,v;E,b;E,l;E,j;B,nz;M,ns;B,l;E,vn;B,j;M,m;M,vn;E,nz;S,n;
+红:B,n;S,a;B,nr;E,n;M,n;E,nr;E,v;M,nr;E,z;B,nz;E,b;B,ns;M,nt;E,l;B,a;M,l;B,v;B,z;B,nt;B,j;M,i;E,nz;B,l;M,z;M,nz;B,b;B,i;E,i;E,nrfg;M,j;M,ns;M,b;M,a;B,vn;E,nrt;E,ns;
+洫:E,n;S,g;
+侬:S,g;E,nr;E,nrt;
+鲶:B,n;
+画:E,n;S,v;B,n;E,v;M,n;B,v;M,i;B,i;M,nt;E,nr;E,i;M,nr;M,l;E,l;B,l;B,nz;M,v;M,b;E,nz;E,vn;B,s;E,b;M,ns;
+骺:S,x;
+猿:S,ng;E,n;B,n;E,nr;M,n;M,i;E,i;
+邾:S,g;
+淀:B,n;E,v;E,n;E,ns;M,n;M,ns;B,ns;E,vn;M,nt;M,l;
+蝇:E,n;S,ng;E,nr;E,i;B,l;B,v;B,n;B,i;M,nz;B,b;
+懈:S,vg;E,a;E,z;B,a;E,i;M,l;M,i;E,v;E,l;
+翌:B,t;
+魏:B,nr;S,nr;E,t;E,nr;B,j;M,nr;B,ns;B,nrt;M,i;B,n;S,tg;B,nrfg;E,l;B,t;
+哦:S,e;E,v;S,o;
+蹭:S,v;E,v;E,z;M,z;B,a;
+森:B,n;E,nr;M,nr;S,nr;M,ns;B,a;B,nr;E,nrt;E,nz;E,a;M,z;E,z;M,i;B,j;E,ns;B,z;M,nt;B,nrt;M,l;M,nrt;B,nz;M,n;S,ag;M,nz;B,i;B,ns;
+葱:S,n;E,b;E,n;B,n;B,z;E,i;M,i;E,nr;M,nr;E,l;E,z;M,n;M,l;M,z;E,nz;
+曲:E,n;B,n;S,q;E,v;B,a;M,n;B,nr;B,ns;E,m;E,nr;E,ns;M,i;M,z;E,z;B,z;M,l;M,ns;B,v;M,nr;M,nz;B,i;E,nrt;E,l;E,a;B,l;M,nt;B,nrt;S,m;E,b;E,vn;B,nz;
+彷:B,v;
+项:B,n;E,m;E,r;E,n;S,q;S,m;E,b;B,nr;E,v;E,nz;M,n;B,ns;E,d;M,l;M,nz;B,i;M,nr;E,ns;E,nr;B,nrfg;
+啻:S,g;E,v;E,d;M,nr;
+竺:E,ns;E,nr;S,nr;B,nr;M,nr;M,n;B,nrfg;
+卿:E,nr;S,nr;E,n;S,ng;B,nr;M,nr;M,ns;E,nrfg;B,i;M,i;E,i;M,l;
+一:B,m;S,m;B,d;B,a;M,m;B,n;B,u;E,r;E,m;M,d;B,s;B,r;B,i;E,vn;E,b;M,i;B,b;B,t;B,j;B,l;M,l;B,c;M,c;M,nr;B,mq;E,t;B,v;M,n;M,nz;E,a;E,n;E,v;M,t;E,d;B,vn;B,f;M,b;E,nr;E,l;B,ns;M,j;E,mq;M,r;B,nr;E,i;M,nt;B,nz;E,nrfg;M,v;E,nrt;E,j;M,ns;B,nrt;B,nt;M,nrfg;M,nrt;E,nz;B,q;M,q;M,mq;
+撇:B,v;S,v;S,n;E,m;M,n;S,q;E,l;M,l;
+脊:B,n;S,ng;B,l;E,n;M,n;E,nr;M,nr;M,ns;B,j;M,i;
+锒:B,i;B,n;
+倔:B,a;S,a;
+樘:S,q;
+搜:B,v;S,v;B,vn;B,nz;B,n;B,i;M,nr;M,l;E,l;B,nt;
+肟:S,g;E,nz;M,n;
+御:S,vg;E,v;B,n;M,n;M,nr;B,v;E,nr;B,b;B,nrt;B,ns;B,vn;B,i;M,nz;
+骣:S,g;
+妥:S,a;E,a;B,v;B,a;B,ad;E,v;E,nr;E,nz;M,z;B,n;M,nz;B,z;M,n;E,n;E,z;B,ns;
+钧:E,nr;S,q;M,nr;B,n;M,i;E,i;B,i;M,l;
+厩:E,n;B,n;
+爨:S,g;E,nr;
+谬:E,a;B,n;S,nr;S,ng;E,n;M,i;M,n;B,v;E,nr;B,l;
+夺:E,v;B,v;S,v;M,n;M,i;B,i;E,i;E,nr;M,l;M,nr;E,vn;E,l;M,d;M,b;B,vn;B,j;B,ns;
+疽:E,n;S,g;
+匾:S,n;B,n;E,n;M,nr;E,nz;
+迁:S,v;B,v;E,v;E,vn;E,nr;B,n;M,n;B,vn;M,nr;E,i;E,ns;B,ns;E,nrfg;M,ns;M,l;M,i;
+觅:B,v;S,v;E,v;M,i;E,l;M,l;E,nr;B,nr;S,vg;M,nr;
+杆:E,n;B,n;S,q;E,m;M,l;M,n;E,ns;B,nz;M,nr;E,nz;E,nr;E,b;M,b;S,m;E,v;
+慊:S,g;E,nr;
+泗:B,ns;S,j;E,nr;M,n;M,nr;E,nrt;B,n;M,ns;B,nrt;E,ns;M,i;
+曛:S,g;
+惟:S,d;B,v;B,b;E,c;B,d;S,c;M,nr;E,nr;B,i;M,i;B,c;E,v;S,u;
+荞:B,n;E,n;B,nz;
+竣:B,v;E,nr;E,v;S,vg;B,n;M,j;
+酪:E,n;B,nz;B,n;M,n;
+晰:E,a;E,v;M,l;M,n;S,g;E,nr;M,vn;
+对:S,p;B,p;E,d;B,v;B,n;E,v;B,vn;E,m;E,p;M,n;B,d;B,l;M,l;B,a;B,f;E,a;S,m;B,s;E,i;E,n;M,c;B,i;E,l;M,i;M,b;B,ad;B,nz;M,f;M,m;M,v;M,nr;B,nt;E,vn;M,nt;B,m;B,b;M,nz;B,ns;E,nr;
+穸:S,x;E,n;
+嗽:E,v;M,n;
+椅:E,n;B,n;S,ng;M,n;E,nr;E,nz;M,nr;
+袄:S,g;E,n;E,nr;
+按:S,p;B,p;B,v;B,d;B,i;B,n;E,n;B,vn;B,l;M,nr;E,nr;M,n;B,b;M,l;E,i;
+芈:S,o;
+隐:B,v;B,n;S,v;B,z;E,nr;B,a;B,b;E,z;M,z;M,i;E,v;M,ns;B,l;B,i;M,nr;M,l;E,i;M,n;B,vn;E,ns;
+焕:E,nr;S,vg;B,v;M,nr;M,i;B,i;B,z;S,ag;M,nrfg;
+娣:S,g;E,nr;
+吧:S,y;E,n;B,o;B,v;B,n;E,o;E,nr;M,n;E,l;E,nz;
+渫:S,g;
+议:E,n;B,n;E,v;S,v;B,v;M,n;E,vn;E,i;E,nz;M,nt;E,l;E,nr;B,i;B,vn;M,nr;E,nt;E,j;M,ns;M,l;B,l;
+戳:S,v;B,v;E,n;B,n;E,v;M,v;M,nr;
+媸:S,g;M,nr;E,n;
+拈:S,v;B,v;B,i;M,i;
+鹋:E,n;S,x;
+糌:B,n;
+坑:S,n;E,n;B,n;E,v;E,ns;B,v;B,l;M,l;M,i;E,nrt;E,l;E,nr;M,n;S,v;M,ns;B,a;
+盐:S,n;B,n;E,n;B,ns;M,n;B,j;E,v;E,nz;E,nr;B,v;M,ns;M,l;M,nr;B,nz;E,i;B,nrt;M,i;B,vn;
+兕:S,g;E,nr;
+歙:S,g;B,ns;B,n;E,nr;
+敝:S,r;E,a;B,s;E,i;B,n;B,r;B,i;M,i;M,l;
+罡:S,x;E,nr;E,n;M,nr;B,n;M,i;
+黠:E,a;B,n;S,g;
+巢:E,n;S,n;B,nr;B,ns;B,n;E,v;E,nr;S,v;M,nr;M,l;M,n;E,nz;B,nz;M,i;M,ns;M,nt;E,i;M,b;
+祥:E,nr;M,nr;S,nr;E,n;E,z;M,n;B,a;S,ng;B,ns;E,a;E,ns;M,i;E,nrfg;B,nr;S,ag;B,nz;E,nz;M,nz;M,ns;B,nrfg;M,l;B,l;E,i;E,v;E,nrt;B,n;
+赭:B,n;B,b;
+噻:B,n;E,l;E,n;M,n;
+偿:E,vn;E,v;B,v;E,d;M,n;S,vg;E,i;B,n;M,i;S,ng;B,vn;M,nz;M,l;E,b;
+殃:E,v;S,vg;B,v;M,i;E,n;B,i;
+谂:S,g;E,nr;M,nr;
+文:B,n;E,n;M,nr;S,ng;M,n;E,nr;B,nr;E,nz;B,nz;B,l;E,v;M,l;E,r;E,m;B,j;M,nt;B,ns;M,nz;M,i;B,nt;M,ns;M,nrt;B,s;B,i;E,t;B,a;M,nrfg;E,a;E,ns;B,nrt;E,nrt;E,nrfg;M,v;E,i;B,z;B,nrfg;E,j;E,q;S,m;M,vn;B,v;M,j;E,vn;B,t;M,b;B,vn;M,z;
+福:B,ns;M,nr;S,n;B,n;E,a;B,nr;E,nr;B,nz;E,nz;M,ns;E,n;E,ns;E,v;M,nt;B,nt;E,nrt;E,vn;B,nrt;E,i;M,n;E,l;M,i;M,nrt;B,i;B,j;B,l;M,nrfg;B,v;B,nrfg;E,nrfg;M,l;M,nz;B,a;
+缠:S,v;B,v;E,v;E,n;B,a;E,a;E,i;M,i;M,nr;B,n;B,i;M,l;M,z;B,nz;B,z;
+礤:S,x;
+助:E,v;E,vn;M,v;B,n;S,v;B,v;M,n;B,vn;B,b;E,n;M,i;E,nr;E,b;E,i;E,d;M,l;B,i;B,l;E,a;B,j;M,nr;M,b;M,ns;E,l;M,nz;B,nz;M,j;
+沭:B,ns;S,j;M,ns;E,nr;E,ns;
+贬:B,v;S,v;E,v;B,vn;B,n;M,i;E,l;
+求:E,v;E,n;S,v;B,v;M,n;M,i;E,i;E,l;E,vn;E,nr;B,vn;B,n;B,i;M,ns;M,l;M,nr;B,nz;B,l;M,v;M,nt;E,nz;B,nrt;
+装:B,n;E,v;B,v;S,v;E,n;B,b;M,n;M,l;E,vn;E,b;B,vn;B,i;M,i;E,l;M,nt;E,j;E,nz;B,l;E,nr;M,nz;B,nz;M,nr;M,b;M,v;E,d;E,nrfg;B,j;M,t;
+鳍:E,n;S,n;M,n;
+痧:E,vn;E,n;E,v;
+迫:B,v;E,d;E,v;S,vg;E,a;B,a;B,i;B,n;E,vn;M,n;E,i;B,vn;B,b;E,ad;
+觯:S,g;
+杰:E,nr;B,a;M,nr;B,nr;S,nr;E,n;B,n;B,nrt;S,ng;E,nrt;B,ns;E,l;E,i;E,nrfg;M,i;E,j;M,nz;S,ag;M,nrt;E,nz;
+哽:B,v;S,v;
+栅:S,ng;E,n;B,n;E,nr;M,n;M,ns;M,nr;E,nz;
+咒:S,v;E,v;B,n;B,v;E,n;M,i;B,vn;
+萝:M,n;B,n;E,n;E,nr;M,l;B,l;B,nrt;M,nr;M,nrt;
+鸡:S,n;B,n;E,n;E,ns;B,i;M,n;M,i;B,ns;B,v;E,v;B,nz;E,i;B,l;M,ns;E,nr;M,nz;M,nr;M,l;E,nz;M,v;E,vn;B,nrt;E,t;M,nt;B,t;
+粢:S,g;
+唧:B,o;E,o;E,v;S,v;B,n;M,o;E,z;M,z;B,v;
+漫:B,a;E,a;M,n;E,v;S,v;B,n;E,n;B,i;B,v;B,z;B,vn;M,nr;E,l;E,nr;E,z;E,i;B,l;M,l;B,ns;B,b;M,nz;M,ns;
+蒲:B,nr;S,nr;B,n;E,n;B,ns;E,nrt;E,nr;B,q;M,nr;B,nrt;M,nz;
+宸:E,nr;S,g;M,nr;M,nz;
+激:E,v;B,a;B,n;B,v;M,n;S,v;M,i;M,l;B,l;E,a;B,vn;E,nr;B,i;E,l;M,nr;E,n;B,nz;E,vn;M,nz;M,b;
+偕:S,vg;B,v;M,i;M,ns;M,nr;
+燔:S,g;
+他:S,r;B,r;E,r;B,n;B,l;M,r;M,rr;M,n;E,ns;B,vn;E,n;M,ns;E,v;M,l;B,s;E,l;M,nr;B,i;M,nz;M,i;B,nz;B,v;M,nt;
+橙:B,n;S,ng;E,n;B,b;E,nr;S,bg;E,nz;M,nr;M,nz;M,z;E,z;B,nz;
+诘:B,v;E,v;B,vn;
+藜:S,g;E,n;M,n;M,nr;E,nr;
+物:E,n;B,n;M,n;S,ng;E,l;E,v;B,l;M,ns;E,j;M,l;E,nt;E,i;E,r;B,v;E,nr;M,nz;M,nt;B,i;M,i;B,nz;E,nz;M,nr;E,nrt;B,j;E,b;B,vn;M,j;
+虱:B,n;E,n;
+绶:M,nr;S,ng;E,n;E,nr;B,n;M,n;E,i;
+驹:E,n;S,ng;E,nr;M,nr;B,n;M,ns;M,i;M,n;
+坻:E,ns;M,ns;S,g;
+磺:E,n;B,n;B,nz;M,n;M,nz;M,ns;
+璃:E,n;M,n;M,l;M,ns;E,l;E,nt;M,nz;S,x;E,nr;E,nz;
+沓:S,q;E,m;E,a;M,i;
+且:E,c;S,c;B,c;E,d;B,l;B,ns;M,i;E,v;M,l;E,nr;
+喙:S,ng;E,i;
+颛:B,n;S,g;B,ns;M,nr;
+宝:B,nr;B,n;S,n;E,n;E,nr;M,nr;B,nz;E,nz;B,ns;B,a;M,n;B,nrt;E,nrt;E,i;M,i;B,nt;M,ns;E,b;E,v;M,nz;E,l;S,v;E,ns;M,nrfg;M,b;M,nt;B,i;E,nrfg;M,j;B,l;
+麟:E,nr;E,n;S,ng;M,nr;M,i;M,ns;M,n;B,nz;B,nrt;E,nz;B,i;
+怠:S,ag;B,v;E,a;B,n;B,a;M,l;E,nr;
+氨:B,n;S,n;M,n;E,n;M,nz;B,nz;B,nrt;B,v;
+售:E,vn;E,v;S,v;M,n;B,n;B,v;B,l;B,vn;M,j;M,l;E,j;E,l;B,nz;M,nz;
+嬲:S,g;
+方:B,n;E,n;S,q;E,f;E,s;M,q;M,c;M,m;E,m;B,nr;M,n;B,a;M,nr;E,r;M,l;M,mq;B,d;E,nr;E,q;E,d;M,i;B,t;M,nt;E,a;E,i;B,nz;E,v;E,nz;M,nz;E,b;E,j;M,ns;B,ns;B,i;M,z;S,m;E,ns;E,z;M,b;E,l;M,v;B,nrfg;B,l;M,nrfg;M,d;B,z;M,nrt;E,mq;E,nt;E,vn;E,nrfg;B,nt;B,nrt;
+萸:E,n;S,x;E,nr;M,nr;
+祆:S,x;
+觑:S,v;E,i;E,v;E,nr;
+迕:S,g;
+狗:S,n;B,n;E,n;E,nr;M,nr;M,i;B,i;E,i;B,l;B,nr;B,nz;M,n;B,v;E,v;E,l;E,nz;M,l;E,t;M,nz;B,t;B,ns;
+员:E,n;M,n;M,nt;B,n;S,q;E,v;E,m;M,nr;E,l;S,n;E,nr;M,i;E,vn;M,j;M,l;E,j;B,nr;S,m;E,i;B,ns;M,b;M,ns;
+统:E,n;B,v;B,vn;B,n;S,v;M,n;E,l;B,l;M,nt;E,nr;E,a;B,d;E,d;M,nr;E,v;M,l;M,nz;E,j;E,t;M,v;B,i;M,i;B,j;E,nz;B,nt;E,b;E,i;E,nrt;M,b;E,ad;B,nz;M,j;B,ns;
+襦:S,g;E,nr;
+郫:B,ns;
+叭:E,n;S,o;M,n;M,o;E,o;B,n;E,nz;B,o;E,l;
+雯:E,nz;E,nr;S,nr;M,nr;E,nrfg;
+念:E,n;S,v;E,v;M,n;B,v;B,n;M,i;B,i;E,nr;M,nr;M,ns;B,nr;B,ns;M,v;B,a;M,nz;E,l;M,l;E,vn;B,b;M,b;E,i;M,nt;
+苷:S,x;M,n;E,n;E,nz;M,nz;
+摸:S,v;E,v;B,v;B,n;M,i;B,l;E,d;E,i;M,l;E,nr;M,n;M,z;M,nz;B,z;E,l;M,b;B,i;E,vn;
+橼:S,x;E,n;M,nz;E,nr;
+邀:B,v;S,v;E,v;B,n;E,nr;B,i;E,vn;M,nr;
+厂:E,n;B,n;S,n;E,v;M,n;E,nt;E,ns;E,r;B,j;M,v;E,nr;M,ns;M,nr;E,j;M,l;B,ns;M,nz;B,b;
+妆:E,v;M,n;S,ng;E,n;M,i;B,n;S,vg;B,v;M,nr;E,nr;E,vn;E,b;M,l;M,nz;
+鲈:S,g;B,n;E,nr;E,n;
+徊:E,v;S,vg;S,x;
+漕:B,v;B,n;B,ns;M,ns;
+躔:S,g;
+列:E,m;E,v;S,v;B,v;E,n;E,q;B,n;M,n;E,b;E,ns;B,nr;M,nr;M,ns;B,vn;B,ns;E,nr;B,nrt;M,i;S,m;M,nrt;M,v;E,j;E,l;B,i;M,nt;M,l;E,nrt;B,nt;B,m;M,vn;E,vn;M,b;B,q;M,m;M,nz;
+错:B,n;E,a;S,n;S,v;E,v;B,v;E,n;E,i;B,i;E,nr;E,ns;M,i;B,z;B,a;B,vn;M,n;E,vn;M,l;M,j;M,v;B,nrt;B,ns;E,l;E,b;M,nrt;M,ns;
+探:B,v;S,v;B,n;E,v;B,vn;E,vn;B,nr;E,n;M,n;B,i;E,nr;M,i;M,nr;M,l;B,nz;B,l;B,t;
+蜥:B,n;E,n;
+贩:S,v;B,v;E,n;M,n;B,n;B,vn;B,i;M,l;E,vn;E,nr;
+劬:S,g;B,a;E,nr;
+户:E,n;S,q;B,n;E,m;E,v;M,n;S,m;E,i;M,i;E,ns;B,s;E,r;E,l;B,j;B,nr;M,ns;M,nr;B,nz;E,d;E,nr;M,nz;B,ns;B,q;E,q;E,vn;E,nz;E,j;E,nrt;B,i;
+螺:B,n;S,ng;E,n;M,n;E,nr;B,b;M,nr;M,ns;B,ns;E,ns;B,nz;
+趾:E,n;M,n;B,i;B,n;
+允:B,v;S,vg;E,nr;E,a;E,v;M,nr;B,nr;B,a;E,l;B,n;B,i;M,i;E,vn;
+烀:S,v;
+糈:S,g;
+聋:S,v;B,n;E,vn;E,i;M,i;E,v;M,j;E,nr;
+拌:S,v;E,v;B,v;M,n;B,vn;E,vn;M,l;E,n;M,nz;
+虏:S,ng;E,n;M,nz;E,v;E,nr;B,v;M,n;
+何:E,r;B,r;S,r;B,d;B,nr;B,c;E,n;E,l;M,r;B,v;E,i;B,n;M,l;E,v;M,n;E,nr;M,i;B,i;E,d;M,nr;B,a;B,nrfg;M,ns;B,l;B,nrt;E,nrfg;B,ns;M,nz;B,nz;
+滔:B,z;E,z;M,i;E,nr;B,i;S,vg;M,nr;B,l;B,n;M,l;
+留:B,v;E,v;S,v;E,vn;B,n;M,n;M,nr;E,nr;M,l;M,t;B,ns;M,i;B,vn;E,i;B,l;B,i;E,ns;E,b;M,ns;B,nrt;E,n;M,nt;B,nz;
+埚:E,n;S,g;E,nr;
+筝:E,n;S,n;M,n;E,nr;E,i;M,nr;
+州:E,ns;S,n;M,ns;E,nr;E,n;B,n;M,nt;M,nr;E,r;E,nz;E,nrt;M,n;M,nz;B,b;E,j;M,i;
+来:E,v;S,v;E,t;B,v;E,d;E,f;B,u;B,n;M,d;E,l;E,vn;E,c;E,nr;B,t;E,i;E,ns;M,ns;M,i;M,n;M,l;E,b;E,nrt;M,nr;E,n;M,c;B,nr;B,i;M,v;B,ns;M,z;B,z;M,nz;B,y;E,nz;B,a;B,l;B,nz;E,nrfg;M,j;B,nrt;M,nt;B,vn;M,b;E,a;
+蛤:B,n;S,ng;M,n;M,nr;E,n;M,l;E,nr;
+浩:E,nr;S,nr;M,ns;B,a;S,ag;M,i;M,nr;B,i;B,n;B,v;B,ns;M,n;M,l;M,v;B,z;B,nz;B,l;B,vn;E,nz;M,nt;E,nrfg;
+俪:E,n;S,g;E,nr;M,nr;
+饱:B,v;S,a;S,v;B,a;M,nz;B,vn;B,i;E,n;B,n;M,i;M,l;B,l;E,i;E,v;E,l;E,nr;M,b;M,n;M,vn;
+蕹:B,n;
+疃:S,g;E,nr;
+圄:E,i;E,n;S,x;
+憋:S,v;B,a;B,l;
+萎:B,v;B,a;E,v;B,n;B,i;S,v;M,n;
+涓:E,z;B,z;B,n;M,nr;B,i;E,nr;
+咙:E,n;S,x;
+甘:B,ns;B,n;B,nr;B,v;S,nr;M,i;S,j;E,v;M,ns;B,nrt;E,j;S,vg;E,nr;M,l;M,nr;B,a;M,n;M,j;B,nz;B,i;S,ad;E,vn;M,nz;E,a;B,b;E,nrt;M,nt;B,nt;B,l;B,j;
+龟:S,n;E,n;B,n;B,ns;B,nz;M,nr;E,nr;B,v;M,n;B,l;E,nz;M,ns;B,nrt;S,ng;M,i;
+愠:B,v;B,n;
+讧:E,v;S,g;E,vn;
+吮:S,v;E,v;B,v;E,nr;
+碱:E,n;S,n;B,n;M,n;E,l;B,l;B,v;M,nz;M,vn;B,nz;E,nz;M,nt;S,v;E,i;E,vn;
+娲:E,n;S,x;M,l;E,nr;M,nr;
+纵:B,v;S,v;E,v;B,n;B,d;B,c;B,i;M,l;M,n;M,i;E,nrt;E,nz;E,a;M,nr;E,i;B,a;E,nr;M,nt;S,c;E,j;E,vn;M,nz;B,l;S,a;B,nz;
+蔸:S,q;
+郁:E,a;B,nr;B,a;B,n;E,z;S,nr;B,v;M,i;B,i;M,n;E,nr;B,z;M,nr;E,n;E,v;M,z;B,nrfg;M,l;M,nz;B,ns;B,nz;
+雅:B,ns;E,a;S,ag;E,nr;E,ns;M,nr;B,nr;B,n;B,nz;M,ns;M,n;B,nrt;B,a;E,nrt;E,n;E,i;M,nz;E,z;E,nz;M,nrt;B,l;B,v;M,l;E,an;E,l;M,nt;B,nt;
+寇:E,n;S,nr;B,nr;S,ng;E,nrt;E,nr;M,nr;E,i;M,i;B,n;
+苍:B,a;B,n;B,nr;B,z;B,ns;S,nr;E,z;M,i;E,n;M,z;B,nrt;E,i;E,nr;M,n;S,ng;M,l;M,nr;B,l;E,ns;E,nrt;B,i;B,an;E,a;
+孜:M,nz;M,ns;E,ns;E,nz;M,z;E,z;B,l;M,l;B,i;M,i;E,nrt;B,n;M,nrt;M,t;
+翟:B,nr;S,nr;E,nr;
+獬:S,x;B,n;
+罴:S,g;
+歼:B,v;S,vg;E,v;B,n;E,vn;
+劂:S,x;
+瘅:S,x;
+床:E,n;B,n;S,n;E,v;E,vn;E,nz;E,m;M,n;M,i;M,l;B,nz;M,nz;S,m;
+戍:S,vg;B,v;E,v;E,b;B,n;M,n;E,nr;E,n;M,nt;M,nr;
+树:B,n;E,n;S,v;M,nr;B,s;B,v;E,nr;E,ns;M,n;M,ns;E,v;M,i;M,l;B,i;B,ns;B,l;B,b;E,l;E,i;E,nrt;E,nrfg;B,nz;M,nz;E,vn;M,nrt;B,nrfg;M,nrfg;M,t;E,nz;
+辔:B,n;E,v;M,i;
+北:B,ns;S,f;B,f;E,ns;E,s;E,f;B,n;B,t;M,ns;M,f;B,nt;B,nr;B,j;B,s;M,n;B,nz;M,t;B,v;B,b;M,nt;M,nr;E,nr;M,j;E,n;M,l;B,l;E,l;E,i;E,j;M,i;E,v;M,s;B,nrt;E,nz;M,nz;E,nrt;M,nrt;B,i;M,nrfg;
+炖:S,v;B,n;E,v;B,v;B,nz;
+弟:E,n;B,n;S,n;E,nr;M,n;E,l;M,nr;E,i;E,j;M,i;M,nt;M,l;
+粞:S,g;
+抢:B,v;S,v;B,a;E,v;B,n;E,nr;M,i;M,l;B,l;E,j;M,n;B,nz;B,ns;M,nr;B,vn;
+梦:S,n;B,n;M,nr;E,n;E,v;B,v;E,nz;B,nr;E,nr;M,i;M,n;E,i;B,i;M,l;B,nz;B,nrt;E,l;E,nrt;B,l;M,nz;M,ns;M,nt;
+谩:B,v;B,vn;B,n;
+溪:S,n;E,nr;E,ns;B,n;E,n;M,nr;M,ns;B,ns;E,nrt;E,nz;M,nz;M,n;S,ng;B,s;M,nt;
+眯:S,v;M,z;E,z;B,v;E,nr;M,nr;
+钮:E,n;B,nr;S,nr;B,n;E,nr;M,nr;M,b;
+蚺:S,x;
+魇:E,n;E,v;
+屉:E,n;M,b;B,n;M,nz;
+腋:S,ng;B,s;B,n;E,n;M,i;E,i;
+槐:B,n;S,nr;E,n;E,nr;S,ng;M,ns;E,i;M,nr;B,ns;
+赓:E,nr;S,nr;M,nr;
+僖:S,g;M,nr;B,nrt;E,nr;M,nrt;
+瑙:E,n;M,ns;B,n;E,nrt;B,nrt;M,n;E,ns;M,nrt;
+囚:B,n;S,vg;B,v;E,n;E,v;M,n;B,vn;
+汩:E,o;B,o;
+跨:S,v;B,v;B,n;B,vn;B,b;E,v;E,n;B,l;E,j;
+八:B,m;M,m;B,n;S,m;E,m;M,i;B,t;B,j;M,l;M,n;E,n;B,ns;E,t;M,nr;M,nz;E,i;B,nz;B,l;B,i;B,b;B,nt;M,ns;M,nt;E,nr;B,mq;M,b;M,t;M,q;B,s;M,z;E,nz;B,nrt;M,j;
+仪:B,n;E,n;E,nr;S,ng;E,nz;M,nr;S,k;B,nr;B,ns;M,n;B,nz;B,j;E,v;B,l;B,i;M,i;M,nt;M,l;E,i;E,nrt;B,vn;E,nrfg;M,ns;
+坯:E,n;S,n;B,n;M,n;E,v;E,nz;
+瓮:S,n;B,ns;B,l;M,l;E,n;B,i;E,i;M,nr;
+惶:B,a;M,i;E,a;B,i;B,z;E,i;E,z;E,ad;M,z;
+使:S,v;B,v;E,v;E,c;E,n;B,n;E,nr;B,l;M,n;E,a;M,i;E,i;M,nr;M,nt;M,l;B,d;E,nz;M,v;E,b;
+泾:B,ns;E,ns;B,i;M,n;M,ns;M,nt;
+刀:S,n;E,n;B,n;E,m;E,v;M,i;B,i;E,nr;M,n;M,v;M,nr;M,l;E,i;E,l;B,b;E,nz;S,m;M,nz;S,q;M,ns;B,nrfg;B,l;
+鄂:B,ns;B,nr;S,j;E,nr;E,j;B,j;B,nz;M,nr;M,nz;M,j;B,n;B,nt;E,nz;M,ns;M,nt;
+各:B,r;S,r;M,l;B,l;B,a;B,i;M,ns;E,nrt;E,nr;E,ns;M,nr;B,v;M,i;M,nrt;B,z;M,n;B,ns;B,b;
+碇:S,g;E,n;
+师:E,n;S,ng;B,n;B,nr;E,nr;M,nr;E,v;B,v;M,n;M,nt;E,ns;M,i;E,i;E,j;E,nt;B,j;M,ns;M,nz;M,l;E,l;B,b;B,i;M,j;M,t;M,b;B,vn;E,r;E,nz;E,vn;B,nrt;B,l;B,t;
+褒:B,v;S,v;E,nr;B,i;B,n;B,vn;B,nrt;B,ns;M,l;S,vn;E,v;
+邗:B,ns;S,g;E,nr;M,nr;
+瘘:S,g;E,n;B,n;
+骛:S,g;M,i;E,l;E,n;E,i;
+砜:S,g;E,nz;E,n;E,nr;
+鲟:E,n;S,g;B,n;
+蚣:E,n;S,x;E,nr;M,n;
+侩:E,n;S,g;M,n;
+圮:S,g;
+箱:E,n;B,n;S,q;E,m;M,n;E,nz;E,v;B,f;M,i;B,s;B,b;M,nr;S,m;B,ns;B,nz;E,b;B,j;
+蘸:S,v;E,v;M,nr;E,nr;
+蠼:S,x;B,n;
+李:B,nr;S,nr;B,nrfg;E,n;E,nr;M,nr;B,n;M,n;B,ns;E,ns;M,i;B,nz;E,i;M,ns;B,nt;E,l;B,i;B,nrt;
+译:E,v;S,v;B,n;E,n;B,v;M,n;E,nr;M,l;M,nr;E,b;E,vn;B,j;E,l;M,nt;B,nz;E,j;
+仓:B,n;S,nr;E,v;S,ng;E,nr;M,n;E,n;B,ad;E,ns;B,nr;M,nr;B,a;B,j;B,vn;B,v;B,z;E,i;M,ns;E,nz;B,ns;B,nz;E,nrt;M,l;B,i;B,b;B,nrt;
+噘:S,v;B,v;
+镚:M,n;
+糟:S,v;B,a;B,v;E,i;S,a;M,z;E,z;B,n;E,n;B,i;M,n;B,nz;B,vn;
+警:B,n;B,v;E,n;E,j;B,vn;E,v;S,ng;E,vn;M,n;E,a;M,nt;M,v;M,l;B,j;B,b;M,nr;B,nz;B,l;E,nr;
+凭:S,p;B,p;B,n;E,v;B,d;E,n;B,v;B,ns;E,i;E,nr;M,i;M,nr;B,b;B,i;M,n;M,l;
+铯:S,g;E,n;
+穰:S,g;E,nr;M,nr;
+籴:S,v;E,nr;
+猁:E,n;S,x;
+缉:E,v;B,v;M,n;B,n;B,vn;E,vn;E,n;
+麈:S,g;M,nr;
+愍:S,g;M,nr;
+肌:B,n;S,ng;E,n;M,n;B,v;M,i;B,nrt;M,l;B,nz;E,l;
+貔:B,n;
+玖:S,m;E,nr;B,m;M,nr;E,m;
+疚:E,a;S,g;E,an;E,ad;M,n;
+羞:S,v;B,a;B,v;E,a;B,n;M,i;E,v;B,z;M,n;E,nr;M,z;B,l;B,vn;E,n;B,i;S,a;
+涪:B,ns;B,nrt;
+催:B,v;S,v;B,n;B,vn;B,i;B,nz;M,nr;B,l;M,vn;E,nr;
+莶:S,x;E,nr;E,n;
+达:S,v;B,v;E,v;E,a;E,nr;E,n;M,l;E,nz;M,ns;E,ns;B,nrt;B,nr;M,nr;M,nz;E,nrt;B,ns;B,n;M,n;E,i;E,nrfg;M,nrt;M,i;E,nt;B,nz;E,l;B,i;M,nt;E,vn;M,nrfg;B,a;B,l;B,nt;B,ad;
+十:M,m;B,m;B,d;S,m;E,m;B,t;B,j;B,n;B,l;B,z;B,nz;M,l;B,i;M,n;B,mq;M,nr;B,ns;E,i;M,i;M,nrt;M,nz;E,t;E,v;M,nt;E,n;B,v;E,nr;M,mq;M,ns;E,l;B,nt;B,b;M,j;M,v;E,nz;
+终:E,d;B,d;B,n;S,d;B,v;E,v;B,m;E,t;B,nr;E,i;M,i;B,ns;E,nr;E,l;M,n;M,l;M,m;B,i;E,vn;B,nz;
+艋:S,x;E,n;
+泔:B,n;M,n;
+取:E,v;B,v;S,v;B,n;B,i;M,i;B,vn;E,nr;M,n;M,l;E,l;M,nr;E,a;E,i;E,vn;B,j;M,j;B,l;B,nz;E,nrt;M,nz;M,nt;M,ns;
+祝:S,v;B,v;E,v;B,nr;B,vn;E,nr;B,n;M,nr;E,nrt;E,n;B,nrfg;M,ns;E,ns;B,ns;M,n;
+捡:S,v;B,v;E,v;B,l;
+苠:E,nr;
+矮:S,a;S,v;E,a;B,n;B,a;M,n;B,z;B,v;E,n;M,z;B,b;
+平:B,a;E,n;B,n;B,q;S,v;E,nr;M,ns;B,t;B,v;M,m;E,ns;B,nr;E,a;M,n;E,v;B,ns;M,nr;B,m;B,i;M,i;E,nz;E,b;B,z;M,nz;B,nz;E,i;B,vn;M,l;B,l;M,z;E,z;B,d;B,nt;E,nrt;E,nrfg;B,b;E,l;M,nt;B,nrt;B,j;M,v;E,j;B,ad;M,nrfg;M,nrt;M,j;M,b;B,nrfg;
+揶:B,v;
+旺:S,a;B,a;B,n;E,nr;E,a;M,ns;M,nr;B,nr;B,v;M,l;E,ns;B,nrt;E,l;E,i;E,nrt;E,n;M,j;E,nrfg;B,ns;
+匀:E,a;S,v;B,a;E,ad;E,v;E,ns;B,d;B,b;E,vn;M,nr;B,l;M,ns;M,nz;E,nr;S,a;B,n;E,z;B,z;
+适:B,v;B,a;E,a;S,vg;B,ad;B,n;M,n;B,d;E,nr;B,i;S,ag;B,b;M,i;E,an;B,l;M,nr;E,v;E,nrfg;B,vn;E,l;M,nrfg;
+弈:E,v;E,vn;S,vg;M,n;B,n;E,nr;M,nr;
+挠:S,v;E,v;E,i;B,v;E,n;B,n;M,i;B,ns;E,l;
+亩:E,m;S,q;S,m;E,q;E,r;E,n;B,vn;B,j;B,n;B,v;
+炭:E,n;S,n;B,n;M,n;M,t;E,v;E,i;B,v;M,nt;B,nz;M,ns;B,ns;E,l;M,nz;
+暹:B,ns;S,x;E,nr;
+举:B,v;S,v;E,v;B,n;E,d;B,i;E,r;E,n;M,i;M,n;E,nr;E,i;B,l;M,l;E,l;M,nr;B,d;B,vn;M,nz;M,v;M,nt;E,vn;E,nrfg;
+埃:B,ns;B,nr;E,ns;S,j;E,n;B,nrt;M,nr;E,nr;M,ns;M,i;M,nt;B,nz;S,q;E,nt;M,nrt;B,nt;B,n;E,nrt;M,nz;M,n;B,j;B,m;
+铅:S,n;B,n;B,v;B,ns;E,nz;M,n;E,n;M,nr;E,nr;E,b;B,nz;M,l;M,nz;M,v;
+穆:B,nz;B,nr;B,nrt;M,nr;E,nr;M,ns;E,a;S,nr;S,j;B,nt;E,ns;M,nrt;M,nz;E,nrfg;E,ad;B,nrfg;E,nrt;M,nt;B,ns;
+黉:S,g;
+胍:S,g;
+鹞:S,ng;B,n;E,n;B,b;E,nr;
+豪:B,n;B,a;E,n;S,ag;M,nr;E,nr;E,a;B,nrt;B,v;M,n;B,i;M,l;M,i;E,l;E,nz;B,nz;M,ns;E,nrt;B,ns;
+僭:S,g;
+闯:B,nrt;S,v;B,v;M,nr;E,nr;B,n;M,i;B,l;E,v;E,nrfg;E,i;
+嫱:S,g;E,nr;M,nr;
+读:E,v;S,v;B,v;B,n;E,vn;M,n;E,b;E,n;E,j;M,nr;E,l;B,nz;E,nr;B,i;M,nz;E,i;M,nt;M,i;E,a;
+楼:B,n;E,n;S,n;B,s;E,v;E,ns;E,nr;B,nr;M,nz;B,ns;M,i;E,i;B,f;M,nr;M,n;E,r;E,nrfg;M,ns;B,nrfg;E,nz;B,l;E,nrt;M,l;B,nrt;E,nt;
+琅:E,n;M,i;B,ns;B,i;E,nrfg;M,n;M,z;B,z;
+龈:E,n;S,g;M,n;
+怍:S,g;
+氕:S,g;
+趔:B,v;M,v;
+阙:S,nr;S,q;E,nr;B,nr;S,ng;M,nr;E,n;E,i;B,v;
+舡:S,g;
+营:E,vn;B,n;S,n;B,vn;E,n;M,n;E,b;E,v;B,v;E,nr;E,ns;B,ns;M,nr;E,l;E,i;B,s;M,i;M,b;B,l;M,v;M,ns;B,b;E,nrt;M,l;B,nz;B,i;B,t;S,v;M,nt;B,nrt;
+踩:S,v;B,v;B,n;
+猫:S,n;E,n;B,n;S,v;E,nr;E,nz;B,ns;M,nr;M,l;B,v;B,l;M,i;M,n;B,i;M,nt;
+沪:S,j;B,j;B,n;E,nr;M,nz;E,j;B,nz;M,nr;B,ns;B,nrt;M,ns;M,nrfg;E,nrfg;
+冬:B,t;S,tg;B,n;E,v;E,t;B,v;E,nr;E,n;M,nr;B,j;B,nr;B,l;M,t;M,l;B,nrt;B,ns;E,l;B,b;M,n;B,nz;M,ns;M,i;E,o;B,vn;M,v;B,a;M,o;E,z;M,nrfg;M,nz;
+宰:B,n;S,v;E,v;B,nr;E,nr;B,v;E,nrt;M,n;M,nr;M,i;B,t;M,ns;B,nz;
+缳:S,g;
+蒺:B,n;M,n;
+剁:S,v;B,v;
+珀:E,n;E,nrt;B,nrt;M,n;B,ns;B,nz;M,ns;M,nrt;B,n;
+痄:B,n;
+勖:S,g;E,nr;M,nr;
+哚:E,n;E,nr;
+硝:B,n;S,n;E,n;M,n;B,l;B,v;M,nz;B,nz;M,nr;E,nz;S,v;
+菠:B,n;M,n;
+藤:S,n;B,n;M,nr;B,nr;E,nr;E,n;B,b;B,l;B,nrt;M,i;E,nz;M,n;B,ns;E,nrt;B,nz;M,l;
+迨:S,g;E,nr;
+卫:B,n;E,v;B,an;M,n;E,n;S,v;E,nr;B,nr;M,nr;E,vn;B,nt;M,nt;M,nz;E,j;E,ns;E,nz;M,ns;E,nrt;B,nz;B,b;B,nrt;B,ns;B,j;M,l;B,v;E,l;S,nr;M,i;M,v;E,i;B,l;B,t;M,j;M,nrfg;
+遭:B,v;S,v;B,n;E,m;E,v;E,n;E,i;S,m;B,i;
+目:B,t;E,n;B,n;S,ng;M,i;E,i;E,v;B,v;E,ad;B,i;E,m;E,a;E,nr;M,n;E,l;M,l;E,ns;M,ns;S,m;E,vd;M,nr;B,l;S,q;E,b;E,nz;E,vn;E,nrt;B,ns;B,vn;
+驱:B,v;S,vg;B,n;B,vn;E,n;E,v;M,n;M,i;E,nr;E,i;M,l;M,nz;M,nr;
+彳:S,x;B,n;
+磲:E,n;S,x;
+拶:S,g;E,v;
+虹:E,n;E,nr;S,n;E,nt;E,nz;B,ns;B,n;M,n;E,i;M,i;M,nr;B,b;M,ns;M,nt;B,l;M,nz;B,nr;
+衽:S,g;E,v;E,n;E,i;
+脎:S,g;
+梓:E,n;B,nrt;E,nrfg;E,ns;B,n;E,v;E,nr;B,ns;M,ns;
+隗:E,nr;B,nr;S,nr;M,nr;
+写:S,v;B,v;E,v;B,n;E,n;M,n;E,i;B,vn;E,b;E,nr;E,vn;E,j;M,v;M,i;M,nr;M,nz;B,nz;
+鲛:S,g;M,n;E,nr;E,n;B,n;
+骟:S,v;
+搠:S,v;E,nr;M,nr;
+戤:S,g;
+瞭:B,v;B,n;
+耸:S,vg;B,v;E,v;M,i;B,i;M,n;B,n;M,l;E,nr;M,nr;
+慎:E,a;B,a;E,d;E,i;B,v;S,a;B,nr;E,nr;E,l;M,nr;S,nr;M,i;B,l;E,n;S,ag;E,nrfg;B,i;S,ad;
+跑:S,v;E,v;B,v;B,n;M,n;E,n;B,l;E,ns;M,l;E,vn;B,ns;E,i;E,l;B,nz;M,v;M,i;B,vn;M,ns;M,nz;M,nt;
+试:B,v;B,vn;E,vn;S,v;E,v;B,n;E,n;M,n;E,i;M,v;E,j;M,i;M,l;M,nz;E,nr;B,nz;M,nt;
+盗:S,vg;B,v;E,n;B,n;E,vn;B,vn;E,v;E,i;M,i;M,n;B,l;M,nz;B,i;
+镖:E,n;S,n;E,nr;B,n;
+竟:E,d;S,d;B,d;B,v;B,ns;E,nr;E,v;M,nr;M,i;
+赦:B,v;E,v;E,i;M,i;B,n;M,n;E,vn;E,l;B,vn;
+铫:S,g;E,nr;M,nr;
+埭:S,g;
+己:E,r;S,r;B,n;E,i;E,n;M,i;E,nr;M,n;M,nz;E,l;E,v;B,m;M,l;B,r;M,nr;B,i;B,nz;
+穴:E,n;S,ng;S,q;B,n;B,v;E,v;M,i;M,nr;E,i;E,ns;M,b;M,n;M,ns;E,l;B,i;
+恸:E,a;S,g;B,v;
+垂:B,v;S,v;B,n;E,v;B,i;E,nr;M,n;E,n;M,nr;M,i;B,z;M,l;B,b;
+颈:S,ng;E,n;B,n;M,n;B,s;E,v;M,nz;
+服:B,vn;E,n;E,v;B,n;B,v;S,v;E,a;M,n;E,vn;M,l;E,nr;E,m;E,i;M,i;E,l;M,z;M,nr;E,nz;E,z;B,a;E,j;B,z;B,nr;M,nz;M,nt;S,m;B,i;B,t;
+蚌:B,ns;B,n;E,n;M,ns;M,i;
+疖:B,n;
+鄙:B,v;S,ag;E,a;B,r;B,a;M,l;B,n;B,vn;E,nr;M,i;B,i;
+娟:B,a;E,nrfg;E,n;E,nr;E,nrt;M,nrfg;
+蔡:B,nr;S,nr;M,ns;E,ns;M,nr;E,nr;B,nrfg;E,nrfg;B,nz;B,ns;
+枢:B,n;E,n;M,n;M,l;E,l;B,nz;B,l;M,nz;M,i;
+丧:B,v;S,vg;B,n;E,a;E,v;M,i;B,i;E,vn;S,ng;M,l;B,a;B,b;M,n;B,l;B,j;M,nz;
+润:E,n;E,v;S,v;M,n;E,a;M,nr;E,nr;B,n;B,v;E,nz;B,vn;E,l;B,ns;B,nz;M,nt;M,nz;E,ns;E,vn;E,i;M,ns;M,z;B,l;E,z;
+殪:S,g;
+醮:S,g;E,v;M,nr;
+莺:S,ng;E,n;E,nr;M,nr;B,i;M,n;E,nz;M,i;
+啁:S,x;B,o;
+卅:M,nz;S,m;E,m;B,m;M,m;
+狄:B,nr;S,nr;E,nr;M,nr;S,ng;M,ns;M,nz;B,nrt;
+鹇:E,n;S,x;
+奉:S,v;B,v;E,v;B,ns;E,nr;M,nr;B,n;M,i;B,nrt;M,l;B,vn;E,n;B,i;M,n;B,l;
+艏:S,g;
+泐:S,g;E,nr;
+嗖:S,o;E,o;B,o;M,z;E,z;
+黜:E,v;M,i;B,v;
+蓠:E,n;S,x;
+苤:B,n;
+裨:M,i;B,n;B,nr;
+副:S,b;B,n;E,m;M,i;E,b;M,j;B,b;E,n;M,n;E,v;M,l;S,m;M,nr;E,j;E,i;
+燮:E,nr;S,g;M,nr;
+时:B,n;S,ng;E,c;E,t;E,r;E,d;E,n;E,b;E,ad;B,d;M,n;M,l;M,r;E,v;M,d;M,nr;E,ns;B,v;M,i;E,a;M,t;B,nr;B,l;B,nrfg;E,i;E,m;B,a;E,nr;M,b;M,nz;E,l;B,t;E,mq;B,i;M,nt;E,q;E,j;E,nrt;E,nrfg;B,z;M,z;B,nt;M,v;B,nz;E,vn;B,ns;B,nrt;B,b;M,m;M,ns;M,nrfg;
+腹:B,n;S,ng;E,n;B,v;B,s;M,i;E,v;M,n;E,i;B,i;E,nr;M,v;M,in;M,l;B,vn;M,nz;
+载:E,v;S,v;B,n;B,v;E,b;E,m;E,vn;B,b;E,n;M,l;M,i;B,vn;M,n;E,nr;E,i;M,nr;S,m;E,nrfg;B,i;M,b;B,nz;M,nz;
+阂:E,n;S,vg;M,nr;
+斋:S,ng;E,nr;B,v;E,v;E,n;B,n;E,nz;M,nz;M,nr;B,t;M,t;E,ns;B,ns;B,nr;M,l;
+掏:B,v;S,v;E,nr;
+焘:E,nr;S,nr;
+缜:B,a;
+膣:S,g;
+挤:S,v;B,v;E,v;E,a;B,vn;B,i;M,i;B,l;B,nz;B,n;E,vn;M,z;B,z;
+倮:S,g;
+粱:E,n;S,nr;M,n;E,nr;M,nr;M,i;E,i;M,l;M,nz;
+脸:S,n;B,s;B,n;E,n;E,d;E,m;E,v;B,v;E,i;E,l;E,a;E,ad;E,nr;B,l;M,l;M,n;M,nr;M,i;M,a;E,vn;B,i;B,a;
+溽:B,n;B,a;
+铁:B,n;E,n;S,n;M,nz;M,n;B,nr;M,nr;M,nt;E,nr;E,v;E,i;B,ns;E,j;B,z;B,nt;B,i;M,i;M,l;E,nz;M,ns;B,v;B,nz;E,nrt;S,v;B,d;B,b;B,l;E,l;B,nrt;E,vn;M,v;E,ns;M,j;M,nrfg;B,j;B,nrfg;
+矗:B,v;E,v;
+虢:S,nr;E,nr;M,nr;E,i;
+闫:B,nr;S,nr;M,nr;
+园:E,n;B,n;S,ng;E,ns;E,nr;M,ns;B,s;M,n;M,nr;E,j;E,v;S,q;E,nz;E,nrt;M,i;M,nz;E,vn;E,r;B,v;M,vn;B,vn;E,nt;B,nz;B,b;M,j;
+睬:E,v;S,v;E,vn;M,nr;E,i;
+跻:B,v;
+份:E,n;E,m;B,n;S,q;E,nz;M,n;E,mq;E,b;S,m;M,l;E,t;E,nt;M,nt;E,q;E,r;B,nz;E,a;M,mq;M,v;E,v;M,i;M,ns;
+潼:B,ns;E,ns;M,ns;S,g;E,nrt;E,nr;M,nr;
+诿:S,vg;E,v;E,l;
+砉:S,o;M,nr;
+馈:E,v;B,v;E,n;B,vn;B,n;M,n;
+民:E,n;B,n;M,n;S,ng;M,nt;E,nr;M,ns;B,b;B,a;M,l;M,nz;E,v;B,nt;M,i;B,l;B,j;M,nr;B,nz;E,nrt;E,vn;B,ns;B,v;E,ns;B,i;E,l;E,i;E,nrfg;M,v;M,j;B,t;M,ln;E,nz;M,vn;E,j;B,vn;M,t;M,nrfg;
+互:E,d;B,d;B,v;B,n;S,d;M,l;E,v;B,l;M,n;B,i;B,vn;M,j;M,nt;B,b;B,ns;M,i;E,nr;B,nz;
+崛:B,v;E,a;
+伧:E,v;S,x;E,nrfg;
+沦:B,v;E,v;B,n;B,l;B,vn;E,a;M,l;E,nz;
+甫:E,nr;S,d;M,nr;E,n;E,ns;E,nz;M,nz;M,nrt;B,nrt;M,nrfg;
+邮:B,n;S,v;E,ns;B,j;B,v;M,n;E,vn;M,nt;M,nz;B,vn;M,l;E,n;M,j;M,ns;B,nt;E,v;E,j;E,nr;B,nz;
+宴:E,n;B,n;S,ng;E,v;B,v;S,nr;E,nr;M,nr;E,ns;M,l;E,nrt;
+活:E,vn;B,vn;B,v;S,n;B,n;E,a;E,v;M,n;S,v;E,n;B,a;B,d;M,l;E,d;B,b;E,i;B,l;B,z;M,i;B,j;M,v;M,t;E,nr;B,i;E,l;M,nr;M,ns;B,t;B,nz;M,vn;E,nrt;S,a;
+酃:S,g;E,nr;
+荏:M,i;E,i;B,v;B,a;M,l;S,g;E,nr;
+比:S,p;B,d;B,n;E,j;E,v;B,v;B,vn;M,ns;E,n;B,ns;B,l;B,nr;E,z;M,nr;B,nrt;M,l;E,nrt;E,ns;M,n;M,nt;E,vn;M,i;E,i;B,i;B,p;E,nr;M,nrt;M,nz;E,nz;M,v;B,nt;E,q;B,m;E,d;M,m;B,nz;B,b;E,l;
+藠:B,n;
+桩:E,m;S,q;S,n;E,n;E,v;E,i;B,n;E,nr;M,n;S,m;
+卯:E,m;E,v;E,l;E,n;M,i;M,l;M,m;B,i;E,i;B,t;B,n;
+女:B,n;E,n;S,b;M,n;B,nz;E,nr;M,i;E,l;M,l;E,i;M,nr;B,nr;B,j;M,nt;B,l;B,b;M,j;B,v;B,i;M,ns;B,ns;M,t;M,v;E,b;E,nrfg;E,nz;E,ns;M,nz;
+绲:S,v;E,nr;B,n;
+驵:S,g;
+嘀:B,v;M,l;M,z;B,z;B,o;
+锂:S,n;B,nz;E,nz;E,nr;E,n;
+娈:B,n;M,nr;S,g;
+茎:S,n;E,n;E,nr;B,n;M,nr;M,l;
+丐:E,n;S,g;M,nr;E,nr;B,n;
+钗:E,nr;E,nrt;M,nr;S,ng;M,n;E,n;E,i;B,n;M,i;
+嶝:S,g;
+颟:B,a;
+映:E,v;S,v;B,v;M,n;B,nr;B,n;E,i;E,nr;B,l;M,nr;M,i;E,vn;E,nz;
+樨:E,n;E,nr;S,x;
+匮:B,v;S,vg;M,i;E,i;
+舸:S,g;E,nr;M,i;M,nr;
+勃:E,i;M,i;S,ag;B,vn;E,a;M,nr;E,nr;B,nz;B,z;B,i;B,ns;M,l;E,z;E,nz;E,ad;E,n;E,l;B,nr;B,nrt;B,v;B,l;M,ns;M,z;B,n;M,v;E,nrt;
+捎:S,v;B,v;B,d;
+近:S,a;B,t;E,v;E,f;E,t;B,l;B,n;E,d;B,v;B,s;B,d;B,a;E,a;E,n;B,f;B,b;M,i;B,j;B,i;M,nr;M,l;M,n;B,nrt;B,nz;M,nt;M,nrfg;B,vn;E,nrfg;M,b;E,vn;E,nr;E,l;B,ns;
+浒:M,nz;E,n;S,g;E,nr;E,nz;B,ns;B,nrt;M,nr;
+靖:E,t;E,nr;B,nr;B,ns;M,nr;S,nr;E,v;E,ns;S,j;E,nz;M,ns;B,nz;E,nrt;M,n;M,i;E,nrfg;
+绛:S,b;B,n;E,nr;M,nr;E,ns;B,ns;M,ns;
+酚:E,n;S,n;E,nz;B,n;B,nz;M,n;B,l;M,nz;
+拣:S,v;E,v;B,v;M,i;M,z;E,z;M,n;M,nr;
+车:E,n;B,n;S,n;E,v;M,n;B,s;B,nr;E,r;M,nt;E,m;B,j;E,ns;B,ns;E,l;B,v;M,i;E,b;E,nt;E,vn;E,j;M,ns;B,b;E,nz;B,nz;S,m;E,nr;B,i;E,i;M,nr;M,nz;B,l;M,l;E,nrt;
+郯:S,g;B,ns;M,nr;
+忱:E,n;S,ng;E,nr;E,a;E,i;M,nr;
+省:E,ns;S,n;B,n;E,n;E,r;M,nt;E,j;E,v;B,v;B,b;B,j;B,s;M,ns;B,a;E,nr;E,nt;M,i;E,nrt;M,v;E,i;B,i;B,nz;M,nr;M,n;B,vn;M,j;E,vn;B,l;M,nrfg;E,l;M,l;E,a;M,nz;
+喂:S,v;B,v;B,vn;E,v;E,nr;
+骈:B,n;
+妊:B,v;B,t;B,vn;B,j;
+蒌:S,x;
+躐:S,g;
+吗:S,y;E,v;B,n;M,n;
+帛:S,ng;E,n;E,nr;B,n;M,nr;E,v;E,i;
+蜡:B,n;S,n;E,n;M,n;B,z;E,v;B,vn;E,nz;E,i;M,z;B,nz;E,z;E,l;B,i;
+瘫:B,v;S,v;E,n;E,v;B,n;E,vn;
+咬:S,v;B,v;B,i;B,n;E,v;M,v;B,l;M,i;E,nr;B,vn;M,nr;M,n;M,l;E,n;
+稳:B,a;E,a;S,a;B,n;S,v;B,d;B,v;E,v;B,ad;B,l;M,n;M,z;B,i;B,b;E,nr;B,z;E,i;E,z;M,i;B,nz;M,a;M,nr;E,l;M,b;M,l;
+膺:S,vg;E,v;E,nr;E,i;M,nr;
+设:E,vn;B,n;B,v;B,vn;S,v;E,v;M,nt;E,n;M,n;M,i;E,l;M,nr;E,nr;M,ns;B,c;B,i;E,b;E,j;B,ns;E,i;M,l;
+充:B,ad;B,v;E,v;B,a;B,n;S,v;E,nr;B,d;E,ns;M,n;M,nr;M,l;B,i;M,i;B,l;B,nz;M,ns;B,vn;E,vn;B,b;M,v;
+佑:E,v;E,nz;E,nrfg;B,v;E,vn;
+鳜:B,n;
+寞:E,a;E,i;S,ag;E,nr;S,g;
+条:B,n;E,m;S,q;E,n;S,m;E,mq;M,n;E,a;M,l;M,d;M,i;B,l;E,l;E,r;M,ns;M,z;E,z;E,v;E,i;E,d;M,nr;E,nrt;B,v;M,nz;E,b;E,nr;B,i;E,ns;E,nz;B,ns;B,j;M,v;B,nz;M,nt;B,m;
+胤:S,g;E,nr;M,nr;
+俦:S,g;E,nr;
+噫:S,e;B,e;
+镭:S,n;E,nr;B,b;M,nr;
+珮:M,nr;
+饵:B,n;E,n;S,ng;E,nr;M,n;
+枋:S,g;E,nr;M,nr;B,ns;E,n;
+伐:E,n;S,v;E,v;M,ns;E,j;M,n;M,nz;E,nr;M,nr;B,v;M,i;E,i;B,n;E,vn;B,vn;S,vn;E,l;
+殓:E,v;S,vg;
+谒:S,vg;E,v;E,nr;M,nr;B,v;
+龛:S,ng;E,n;
+愤:B,v;E,a;B,a;E,n;S,vn;B,d;M,i;E,d;B,i;B,vn;E,v;E,l;S,vg;E,vn;M,n;B,n;S,ng;E,ad;B,l;E,an;
+锬:S,g;E,nr;
+刮:S,v;B,v;E,v;B,n;B,i;M,n;B,vn;M,i;M,z;B,nz;B,z;E,n;B,l;E,z;
+纱:E,n;S,n;B,n;E,v;M,n;E,nr;M,nr;E,vn;E,nz;B,nz;
+抹:S,v;E,v;B,v;E,m;B,n;M,i;E,i;E,nr;M,l;M,v;
+茸:E,n;E,z;M,z;B,n;B,z;M,nr;E,nr;
+沽:S,j;E,ns;B,v;M,ns;B,i;M,n;B,nrt;E,i;E,nr;B,ns;M,nr;M,i;
+贼:S,n;E,n;B,n;M,i;S,a;B,i;B,z;M,l;E,i;B,l;E,v;M,n;
+雁:M,nr;E,nr;S,n;B,nr;B,ns;E,n;B,n;B,nrt;M,ns;E,i;B,nz;B,l;E,nz;B,i;M,i;
+郅:S,g;E,nr;M,nr;
+蓍:S,g;B,n;
+扎:E,v;S,v;B,a;B,v;B,ns;M,nr;M,ns;B,nrt;E,n;E,nr;B,vn;M,i;E,nrt;B,nr;B,z;M,z;E,ns;E,i;B,n;M,nrt;M,n;B,nz;E,vn;B,i;
+裕:E,a;E,nr;S,nr;M,nr;E,nz;B,nz;M,nz;M,ns;M,l;B,ns;M,i;M,nrfg;M,n;E,i;S,vg;M,b;
+租:S,v;B,v;E,n;B,n;M,n;E,v;E,l;M,l;E,vn;M,nz;
+揣:S,v;B,v;E,v;E,nr;
+蹦:S,v;B,v;M,l;M,v;M,i;M,z;E,z;B,n;M,n;E,nr;
+韫:E,nr;S,g;M,nr;
+哭:S,v;E,v;B,v;B,n;M,i;B,i;B,l;M,z;B,z;E,i;E,l;E,vn;M,l;E,nr;B,vn;B,nz;M,nr;
+浼:S,g;
+瘁:E,i;S,vg;E,v;E,a;
+咂:S,v;B,v;M,n;B,n;
+庆:E,ns;S,vg;E,nr;E,t;M,nr;B,v;E,n;M,ns;M,t;B,n;M,nt;E,v;M,nz;B,ns;B,nz;E,nz;E,i;E,nrfg;M,n;E,nrt;B,vn;B,nr;E,nt;B,nrt;B,nrfg;B,l;B,nt;
+渑:B,ns;S,g;
+辐:B,v;B,n;M,n;S,ng;M,nz;B,b;E,n;B,s;B,nz;E,nz;E,nr;M,l;
+皖:S,j;B,ns;B,n;B,nz;E,j;E,nr;B,j;M,nr;M,ns;M,nt;
+弛:E,a;S,vg;E,vn;B,n;B,a;E,nr;E,nrfg;E,l;E,i;
+够:E,v;S,v;E,a;B,v;B,a;B,l;M,nr;M,l;E,nr;
+耥:S,x;
+焯:S,v;E,nr;M,nr;
+銮:S,g;M,n;B,n;M,ns;E,nr;M,nr;E,v;E,b;
+笳:S,g;E,nr;M,l;M,nr;
+鲲:B,n;
+蚶:E,n;B,n;
+肺:S,n;B,n;E,n;E,l;E,v;B,i;E,i;M,i;M,n;M,l;
+椿:S,g;E,nr;B,n;M,nr;E,n;M,n;
+婉:E,a;B,a;M,nr;S,dg;S,ag;B,d;B,v;E,z;B,l;E,ad;E,nr;B,z;B,n;
+旌:B,n;M,l;B,ns;B,v;E,n;B,nrt;B,i;
+槔:S,x;
+牙:E,ns;S,n;B,n;E,n;M,ns;M,n;E,v;E,nr;M,i;M,nz;B,ns;M,l;M,nt;E,i;E,l;B,vn;E,nz;E,nrt;B,nz;B,v;B,nt;E,a;B,l;B,i;
+僚:E,n;B,n;M,l;M,n;M,vn;
+晡:S,g;
+蟠:E,nr;S,vg;B,n;M,nr;B,ns;B,nz;E,ns;M,i;E,i;
+诨:B,n;E,i;E,v;
+坫:S,g;
+狮:B,n;S,n;E,n;B,ns;M,nr;E,ns;E,nr;S,ng;M,n;E,nz;E,v;M,nz;M,ns;B,nrt;B,l;M,i;E,vn;
+鹱:S,g;
+孳:B,v;
+页:S,m;E,m;E,n;B,n;S,q;M,n;M,nrt;M,l;E,nr;E,b;M,nr;
+佻:E,a;S,g;
+惺:M,i;M,z;E,z;B,i;B,l;M,l;E,i;B,a;B,z;
+合:E,v;B,v;E,vn;B,n;M,n;B,vn;B,a;S,v;M,nt;E,n;M,l;M,b;B,ns;M,a;E,nr;M,i;E,i;B,l;M,nz;M,ns;M,nr;E,j;B,i;E,ns;E,b;B,nz;B,b;E,l;E,nz;B,j;B,d;B,nt;M,v;M,j;M,vn;E,a;E,d;M,s;E,nrt;B,nrt;M,z;E,z;E,nrfg;
+溏:S,g;E,l;
+骗:S,v;E,v;B,n;B,v;E,vn;M,n;E,i;E,l;
+嶙:B,z;M,l;M,i;
+邛:S,g;B,ns;E,nr;
+厝:M,ns;E,nrt;
+侥:B,a;B,ad;
+渤:B,n;B,ns;M,ns;M,j;
+箭:S,n;E,n;M,n;B,n;E,vn;E,l;E,nr;E,v;M,i;B,ns;M,nt;B,i;E,i;M,nr;M,l;M,nz;M,ns;E,ns;B,l;
+崮:S,g;E,ns;M,nz;
+瞵:S,vg;
+阴:B,n;S,a;B,nr;B,a;E,n;E,ns;B,v;B,ns;B,i;M,ns;B,an;E,nr;M,nr;B,z;B,s;M,n;B,l;E,nrt;E,v;M,i;E,l;B,b;M,l;M,s;M,z;B,t;M,v;E,nz;
+伺:B,v;B,d;B,vn;E,v;B,nz;
+勇:E,nr;B,n;B,a;S,n;E,a;B,v;E,d;M,nr;E,i;M,i;M,n;E,n;E,l;E,b;B,i;E,nrfg;S,ag;B,ad;E,v;M,l;S,nr;S,d;B,l;M,v;E,j;
+词:S,n;E,n;B,n;E,i;E,v;E,nr;M,i;M,n;M,nr;E,d;E,l;M,l;B,i;M,v;
+济:E,n;M,n;B,ns;S,j;M,l;M,nr;E,nr;E,v;M,nt;M,nz;S,vg;M,i;E,a;E,i;E,ns;B,v;E,l;E,nz;M,ns;M,a;M,nrfg;B,nrt;B,nz;E,b;B,n;B,nt;B,nr;B,i;M,j;E,j;E,nrt;M,v;M,b;
+烛:E,n;S,ng;B,n;E,v;E,nr;B,v;E,i;M,i;M,nr;M,l;B,vn;
+剜:S,v;B,i;
+盟:E,n;E,j;B,n;M,n;S,n;E,v;E,ns;E,nt;M,nt;E,l;E,nr;S,ng;E,i;M,nz;M,ns;E,vn;E,nz;B,v;M,nr;M,i;M,vn;
+镞:S,ng;E,n;M,nr;
+泣:E,v;S,ng;B,i;S,vg;M,n;B,v;E,i;M,i;E,l;E,n;E,vn;B,n;E,nr;
+拧:S,v;B,v;B,l;M,l;E,nr;
+黯:B,z;B,a;B,i;B,l;B,an;
+灰:B,n;S,n;M,n;E,n;B,z;M,i;S,ag;B,i;B,v;S,a;M,l;E,i;E,nr;E,b;M,nz;E,v;E,l;B,nz;E,a;M,nr;E,j;M,ns;B,a;
+铳:S,ng;E,n;E,nr;
+扼:B,v;S,vg;B,a;M,l;B,ad;B,l;B,vn;
+礁:S,n;E,n;B,n;E,nr;E,ns;E,v;M,nr;B,ns;
+颀:B,z;
+缅:B,ns;S,v;B,v;B,nt;S,j;B,n;B,nz;E,nrt;M,nrt;
+针:B,p;E,n;B,n;S,n;B,v;M,i;B,i;B,b;E,v;E,j;M,n;E,nr;E,i;B,l;E,b;E,nrt;E,nz;M,v;M,nr;E,d;B,nz;M,l;E,l;B,vn;
+朕:S,g;E,nr;B,n;M,nr;
+羚:B,n;E,n;M,n;B,nz;B,v;
+嘟:B,v;E,o;S,o;B,o;M,z;B,z;B,q;M,o;E,z;E,nr;M,nr;
+褡:B,n;M,n;
+枪:S,n;E,n;B,n;E,m;E,v;E,l;B,v;M,n;M,i;E,nr;B,vn;E,nz;E,i;B,i;S,m;M,l;B,l;B,nz;M,v;
+琳:E,nr;E,nrt;B,nrt;M,nr;S,nr;B,i;M,ns;M,nz;B,n;E,ns;M,nrt;E,nrfg;
+总:B,n;S,b;B,d;B,v;B,c;M,n;M,nt;E,nr;B,b;E,n;E,v;M,nr;B,l;B,j;E,b;M,nz;E,d;M,l;B,nz;E,vn;E,j;M,ns;E,l;B,nt;M,j;B,ns;B,s;B,vn;E,nrfg;
+奁:S,g;E,n;
+组:B,v;E,vn;B,n;E,n;S,q;B,l;M,nt;E,m;M,n;M,l;E,v;S,m;M,j;S,n;E,r;B,b;M,nr;B,q;E,q;E,j;M,nrfg;E,nr;B,j;E,nt;B,vn;M,m;M,nz;B,m;E,b;
+啉:E,n;S,x;E,nr;
+鳘:S,g;
+填:B,v;S,v;E,v;B,n;M,i;E,nr;B,nz;B,b;M,nr;M,n;B,vn;E,i;B,i;B,l;
+酱:S,n;E,n;B,n;S,v;M,n;M,i;M,l;E,i;E,nz;B,b;B,nz;
+味:E,n;M,v;B,n;S,ng;E,v;E,d;M,n;E,i;E,m;E,a;M,i;E,nz;E,l;E,nr;M,nz;M,nt;M,nr;M,l;E,b;B,nz;S,m;B,i;B,a;M,ns;E,vn;M,a;
+珲:S,g;B,ns;E,nr;
+荽:E,n;S,x;
+弄:S,v;E,v;B,v;B,n;M,i;B,i;E,n;E,ns;E,vn;M,nr;M,ns;B,ns;M,l;
+率:E,n;S,v;B,v;B,d;E,nz;E,v;E,a;E,b;E,nr;M,n;M,nr;E,j;E,l;B,a;M,l;E,d;E,ad;M,nz;B,n;B,l;B,i;M,i;E,vn;
+逆:B,n;S,vg;B,v;B,vd;S,ng;E,v;M,i;E,n;M,n;B,d;B,i;B,b;B,a;B,vn;E,nr;M,l;E,vn;E,j;M,nr;B,j;E,a;B,l;B,nz;
+阊:S,x;M,nr;
+谎:S,ng;E,v;B,n;B,v;M,n;E,i;E,nr;
+斓:S,x;E,z;E,i;E,l;E,nr;M,nr;
+舒:B,a;B,nr;E,nr;B,n;S,nr;B,v;B,vn;M,nr;S,vg;B,z;M,z;B,nrt;B,l;E,a;B,ns;B,nz;M,nz;E,n;M,n;S,ag;E,nrt;B,nrfg;
+岙:S,g;M,nr;
+醛:E,n;S,n;E,nz;M,n;B,n;M,l;M,nz;
+劝:S,v;B,v;E,v;B,vn;E,nr;B,n;B,nz;M,ns;E,l;M,nr;E,ns;M,nt;B,i;
+猜:S,v;B,v;B,vn;E,v;M,nz;E,nr;E,i;M,i;B,l;E,nrt;E,vn;
+椠:S,g;
+趣:E,n;E,a;B,n;S,ng;E,v;M,i;E,l;E,i;M,v;M,l;M,n;M,a;E,nr;M,nr;S,ag;
+亥:M,nz;M,ns;E,m;M,m;M,l;B,t;M,i;
+漤:S,v;
+窭:S,g;
+炱:S,g;
+油:E,n;B,n;S,n;M,n;E,v;M,nt;E,j;E,nz;E,vn;B,z;B,v;B,i;B,l;M,l;B,nz;B,j;M,i;E,i;E,nr;M,z;E,z;E,l;B,a;M,nz;M,nr;M,ns;B,d;E,nt;B,ns;E,b;B,b;B,vn;M,b;M,j;
+贸:B,vn;E,n;E,j;M,l;B,n;M,nt;B,d;M,n;S,n;M,nz;M,b;S,vg;B,j;M,ns;B,nz;E,b;M,j;E,nt;E,nr;M,i;S,ng;S,j;
+为:S,p;E,v;E,c;B,v;E,d;B,p;B,r;E,n;M,i;E,nr;M,l;B,u;M,nr;B,l;E,i;B,n;B,i;B,c;E,ns;B,nrt;E,l;E,nrfg;M,n;E,r;E,nz;B,a;M,a;M,nt;M,ns;E,vn;
+抽:B,v;S,v;B,a;B,n;B,l;B,vn;M,i;B,nz;M,z;B,z;B,b;E,nz;M,nt;B,t;B,i;B,d;
+茼:B,n;
+铉:E,nr;S,g;M,nr;
+俏:S,a;E,a;S,v;B,a;B,n;E,i;E,nr;E,v;B,v;M,n;M,nr;B,z;
+扒:S,v;B,v;B,n;M,i;M,ns;E,nr;E,n;B,vn;
+嵘:E,z;E,nr;S,x;E,i;M,i;M,nr;
+鹚:E,n;S,x;
+卜:E,n;S,nr;B,nr;M,nr;E,v;M,n;E,nr;M,nrt;B,n;S,ng;S,vg;B,v;M,nrfg;M,ns;M,i;M,l;E,l;B,nrfg;E,nrt;
+佤:B,nz;S,j;M,ns;E,nrt;
+闳:S,g;E,nr;M,nr;
+囵:E,d;M,i;S,x;
+请:S,v;E,v;B,v;B,n;M,n;M,i;E,nr;B,vn;M,nr;B,i;M,l;M,nz;E,i;
+浸:B,v;S,v;E,v;E,n;B,n;B,vn;M,nr;B,nz;M,n;M,z;E,z;M,l;
+臻:S,nr;E,nrfg;S,vg;E,nr;M,i;E,v;M,l;M,nr;
+码:E,n;B,n;S,v;E,d;M,n;E,v;E,l;B,v;S,q;M,l;M,ns;E,vn;E,j;B,ns;M,nz;
+馀:S,g;E,nr;M,nr;
+龄:E,n;E,nr;S,ng;E,b;M,n;S,q;M,v;E,v;M,nr;M,b;M,vn;B,n;M,nt;M,ns;E,nrfg;
+琉:B,n;B,ns;B,nz;M,nr;M,n;
+昕:E,nr;S,g;M,nr;
+嬗:B,v;E,v;B,vn;
+土:B,n;E,n;S,n;E,v;B,ns;M,n;M,ns;M,i;B,nz;B,l;M,l;E,nr;M,nt;E,i;M,nr;B,v;B,i;E,nz;E,vn;B,nrt;M,v;M,nz;B,a;B,nr;E,j;B,nt;M,z;B,z;B,b;E,l;E,nrt;E,ns;B,vn;B,t;B,j;
+璞:S,nr;E,nr;S,ng;B,n;M,nr;M,i;
+蠡:S,g;E,nr;M,nr;B,ns;M,i;B,v;
+悦:E,a;S,vg;E,nr;B,a;M,i;E,v;B,nz;M,nr;B,ns;S,ag;M,n;E,an;
+缯:S,g;E,nr;
+鲮:B,n;M,n;
+冰:B,n;S,n;M,nr;E,nr;B,z;B,t;M,ns;E,v;B,v;M,n;E,n;B,nr;B,ns;E,vn;B,s;B,i;M,z;E,z;E,i;B,nt;B,nrt;M,i;B,nz;E,nrfg;M,t;M,l;M,nt;
+申:B,v;B,nr;S,v;B,nz;E,v;E,nr;B,n;M,nr;E,m;E,i;B,vn;M,n;B,ns;M,m;E,nz;E,ns;B,nt;B,t;S,j;B,nrt;M,nz;M,nrt;B,nrfg;B,j;E,j;
+垴:S,g;
+欷:S,x;E,nr;
+躺:S,v;B,v;E,v;B,n;E,nr;M,l;M,n;
+秀:E,a;E,nr;S,ag;M,nr;B,n;B,a;E,i;E,n;E,nz;M,n;B,ns;E,v;B,z;M,ns;M,i;B,nr;E,z;B,i;M,nrfg;E,ns;B,nrt;E,nrfg;B,l;
+幅:E,n;E,d;B,n;E,m;S,q;M,d;E,j;E,b;S,m;E,r;B,i;E,i;M,l;M,nr;
+痈:B,n;M,i;
+柔:B,a;E,a;S,v;B,n;M,i;E,nr;M,nr;E,ns;S,a;B,an;B,nrt;B,l;M,n;M,ns;B,z;M,z;B,i;B,v;M,nz;E,l;M,nt;M,l;
+牝:B,n;
+哞:S,o;
+桡:B,n;
+迤:S,x;B,z;E,z;M,nr;
+摩:B,nz;S,j;B,n;M,nr;B,v;E,v;B,ns;B,vn;B,nrt;E,ns;E,nr;E,nrt;M,ns;B,i;B,a;E,nz;B,nr;M,nz;M,n;M,l;S,v;E,vn;B,j;B,z;M,nt;E,mq;M,nrt;B,nt;M,i;
+驭:E,v;M,i;M,n;B,n;
+狲:S,x;E,n;M,l;
+陵:E,n;E,ns;S,ng;E,nr;B,n;M,ns;M,n;M,nr;B,ns;E,nrt;M,nz;E,j;E,nt;E,nz;M,nrt;M,nt;B,v;E,v;M,nrfg;M,s;
+豹:E,n;S,n;B,n;E,nr;E,nz;E,i;S,ng;E,l;M,i;M,n;M,nr;E,nrt;
+艽:S,nr;E,nr;M,nr;E,n;S,x;
+射:E,v;B,n;M,n;S,v;B,vn;B,v;E,n;E,vn;E,l;E,nz;M,l;E,b;M,nz;E,nr;B,ns;M,nt;E,i;M,nr;M,v;M,b;M,i;M,s;B,l;B,nt;B,nz;B,nrt;
+嘈:B,a;B,z;M,z;
+沏:S,v;B,v;
+脒:S,g;E,n;E,nz;
+颗:E,m;S,q;B,n;S,m;B,nz;M,nr;M,n;B,v;
+徙:S,vg;E,n;E,v;M,i;
+钟:E,m;S,n;B,n;E,n;B,nr;E,q;M,nr;E,nr;B,v;B,ns;E,mq;E,l;M,i;E,i;M,ns;M,n;E,v;B,i;E,nz;M,nrfg;M,l;B,nrfg;
+氤:B,n;B,v;
+昨:B,t;S,tg;E,nr;M,nr;
+疵:E,n;B,n;E,i;
+澹:B,nr;B,a;
+藕:S,n;M,nr;E,n;B,n;E,nr;B,i;
+停:B,v;S,v;E,v;E,d;B,n;M,n;M,v;B,a;B,i;M,i;B,vn;E,nr;E,l;B,l;M,nr;M,j;M,l;E,n;E,vn;M,vn;B,z;M,z;
+非:B,d;S,h;B,b;S,d;E,v;B,ns;E,ns;E,d;B,n;E,c;E,n;E,i;B,z;M,i;E,nr;M,l;B,i;B,l;M,nr;B,c;M,ns;B,j;B,nrt;B,v;M,nt;B,vn;M,n;E,l;B,nz;B,nt;M,j;E,nrt;M,nz;E,j;B,nr;M,nrfg;E,nrfg;
+惧:E,an;S,v;E,v;E,a;B,v;M,n;E,i;B,n;M,nr;B,a;
+荦:E,nr;S,g;M,nr;
+髫:S,g;E,n;
+硬:S,a;B,n;E,a;B,v;B,d;B,l;M,l;M,n;B,a;B,z;E,j;E,v;M,j;B,b;M,i;E,z;B,nz;B,vn;E,nr;E,i;B,nt;M,nt;
+叱:B,v;B,i;E,v;
+雳:E,n;E,i;M,n;E,nr;M,nz;
+嗵:S,o;
+苻:S,nr;M,nr;
+恼:E,a;S,v;B,v;B,a;E,v;E,an;B,i;E,l;E,vn;
+蓿:E,n;S,x;E,l;M,n;M,ns;
+骀:S,x;
+如:S,v;B,c;B,r;E,v;B,t;B,v;M,l;M,i;B,i;E,c;M,nr;B,n;B,l;B,d;E,nr;M,c;E,a;E,r;B,ns;B,z;B,nr;M,a;M,t;E,i;E,n;E,l;E,nrfg;M,v;M,n;B,a;E,ns;B,nz;
+历:B,n;E,n;B,v;E,v;B,d;S,v;E,t;M,ns;B,nr;E,nz;B,b;S,d;E,nr;B,ns;B,i;M,n;B,l;M,i;M,nt;E,ns;E,d;M,nr;M,nrt;M,l;S,vg;B,nrt;M,t;M,b;E,l;E,vn;E,b;M,nz;
+眉:B,n;S,n;E,nr;M,i;E,n;B,i;M,ns;E,v;M,v;E,ns;M,nr;M,l;B,ns;B,s;E,i;M,n;E,l;
+隈:S,g;
+喊:S,v;E,v;B,v;B,n;M,i;M,n;E,nr;E,vn;B,vn;E,i;M,l;B,i;M,nr;
+植:B,n;E,v;M,n;M,l;S,v;M,j;B,v;E,nr;B,l;B,nr;M,nr;B,nz;E,ns;B,vn;M,ns;M,nt;B,b;B,nrt;E,vn;E,l;B,t;
+挑:B,vn;B,v;S,v;B,n;M,i;B,i;M,l;E,a;B,l;E,v;M,v;M,z;M,nr;B,z;E,n;E,z;B,a;
+鼙:S,x;
+创:B,n;B,v;B,vn;E,n;S,vg;E,v;B,j;E,vn;M,n;B,nz;E,nz;E,nr;E,j;B,nt;M,nz;M,l;M,nr;M,nt;M,i;B,i;M,j;B,b;E,b;
+吟:E,v;S,v;B,v;M,z;E,z;E,nr;M,nr;E,i;E,n;E,nrfg;B,i;M,i;B,vn;E,nz;
+败:E,v;S,v;E,an;B,v;B,n;E,n;M,i;M,n;M,l;E,vn;E,nr;E,a;B,i;B,a;M,v;M,nr;E,l;E,i;B,l;B,vn;B,b;B,ad;E,nz;
+蜩:S,g;
+瘳:S,nr;
+咴:S,x;B,o;M,o;
+样:E,r;E,u;E,d;B,n;E,n;E,m;S,q;E,l;M,l;M,v;M,n;E,v;E,i;E,nr;S,ng;E,a;E,b;M,nr;E,vn;M,i;M,m;S,m;M,nz;B,q;E,q;S,u;M,mq;M,b;E,mq;
+讶:E,a;E,v;B,v;
+趺:S,g;B,v;E,v;
+搿:S,g;
+鹃:E,nr;S,x;E,n;M,n;M,l;M,nz;M,nr;
+遇:B,v;E,n;S,v;E,v;E,nr;E,i;E,l;M,nr;B,n;M,l;M,n;M,i;B,i;M,ns;E,vn;B,nr;B,vn;
+盈:B,n;M,n;S,vg;M,nr;E,nr;E,a;E,l;M,l;E,z;B,v;E,v;B,z;M,z;B,nz;B,ns;B,b;E,i;E,n;M,i;M,b;E,nz;E,vn;M,nz;
+拐:B,n;S,v;B,v;B,i;B,s;M,n;E,nr;E,n;M,l;E,v;M,nr;E,j;E,l;M,j;
+默:E,a;B,z;M,z;E,v;E,d;B,d;M,nrt;B,v;S,v;E,nr;M,nr;M,i;B,a;B,l;B,i;B,nrt;M,l;M,n;M,ns;E,nz;B,nr;E,n;E,nrt;E,vn;B,vn;B,nz;B,nt;B,n;B,ad;B,ns;
+郜:S,nr;B,nr;E,nr;
+杩:S,x;
+饭:S,n;E,v;E,n;B,n;B,t;E,l;M,n;M,ns;E,i;M,i;M,l;E,nr;E,b;B,i;E,vn;B,nz;B,l;M,v;E,nrt;
+屯:S,v;B,v;B,n;E,ns;E,nr;B,ns;M,nr;E,n;M,ns;E,v;S,ng;M,i;B,vn;
+翮:E,nr;S,g;
+轹:S,g;E,nr;
+圈:E,n;E,m;B,n;S,q;S,v;B,v;S,n;M,n;E,nz;M,v;B,ns;B,vn;M,l;S,m;B,q;E,v;M,nr;E,nr;E,ns;B,nz;E,l;
+残:B,n;S,a;B,a;B,v;E,v;M,i;E,vn;B,vn;E,a;B,i;M,n;B,l;E,j;E,n;M,nt;M,nr;M,nz;B,t;M,l;B,j;B,z;B,nz;E,b;E,i;M,j;
+耒:B,ns;B,n;
+馗:E,n;S,g;E,nr;M,nr;
+庙:S,n;E,n;B,n;E,ns;E,nr;B,ns;M,nr;M,v;M,ns;M,n;
+缘:E,n;S,n;B,n;E,v;E,nr;M,n;E,f;B,p;M,i;B,r;E,vn;E,i;M,v;M,nr;E,b;M,l;E,l;E,nz;S,p;E,a;B,v;B,i;B,nz;M,nz;E,s;
+欠:S,v;B,v;E,v;E,n;B,n;M,i;E,nr;B,l;B,a;B,vn;M,nr;B,i;
+辣:B,n;S,v;E,a;E,z;M,z;S,a;E,i;M,nr;M,n;E,l;M,nz;E,b;M,l;E,nr;B,a;B,z;E,n;
+木:B,n;E,n;S,n;M,ns;B,nr;E,nr;M,nr;M,n;E,ns;S,ng;E,v;B,b;M,i;S,a;M,l;E,i;E,nz;B,z;B,i;B,ns;E,nrt;B,l;B,a;M,nrfg;B,nz;M,nz;B,nrt;E,a;M,nt;E,j;M,nrt;M,z;E,b;E,vn;E,l;E,nt;
+帮:B,v;S,v;B,n;E,m;E,n;E,mq;E,j;E,v;E,nr;M,n;M,l;B,l;B,vn;M,ns;M,nr;M,j;E,nz;S,m;
+锴:E,nr;S,g;M,nr;
+髁:S,g;
+心:E,n;B,n;B,s;E,v;S,n;E,a;M,i;B,v;M,n;B,i;E,d;E,i;B,a;E,ad;M,nr;E,l;M,l;E,nr;E,nt;E,s;E,b;B,nr;B,l;B,b;E,r;E,nz;E,ns;M,ns;B,nz;E,vn;E,nrt;B,vn;B,in;B,j;M,b;M,v;M,j;M,nt;M,z;E,z;M,nz;M,nrfg;M,a;E,nrfg;M,vn;
+鳅:S,x;E,n;E,nr;
+凇:S,x;E,n;E,nr;M,nr;
+雉:S,ng;E,n;B,n;E,nr;M,nr;
+湎:S,x;E,v;M,i;
+苑:S,ng;S,nr;E,nr;E,n;E,ns;B,nr;M,nr;B,n;M,ns;E,nz;E,nrt;M,n;
+恒:B,n;S,nr;B,nz;E,nr;B,j;E,z;B,an;E,v;M,n;M,nz;B,ns;M,nr;S,ng;S,ag;E,i;B,a;M,l;E,ns;B,ad;B,nrt;B,nt;E,nz;B,i;M,nrfg;E,nrfg;
+彘:S,g;E,nr;
+兜:S,v;B,v;E,n;B,s;B,n;M,l;M,n;E,nr;E,m;S,n;S,m;E,nz;M,m;E,v;
+衢:B,ns;E,n;
+音:E,n;B,n;S,n;M,n;E,v;E,nr;M,nt;B,nt;E,nz;M,l;M,ns;M,nr;E,vn;E,i;E,b;M,i;B,l;B,i;B,j;B,nz;E,ns;E,l;M,nz;
+畴:E,nr;E,n;S,g;B,t;M,nr;M,i;
+潸:B,i;B,z;E,z;M,nr;E,nr;
+藿:B,n;
+于:E,v;S,p;E,p;E,c;E,d;B,c;B,nr;M,i;M,l;E,n;M,nr;B,nrfg;B,ns;E,l;E,nr;B,d;E,vi;M,n;E,nrt;B,l;B,i;B,nrt;M,nrfg;
+我:S,r;B,r;B,n;E,r;M,l;M,i;E,n;M,n;E,v;B,i;B,nz;E,b;E,i;B,l;E,d;E,nr;M,nr;E,nrt;
+窖:E,n;S,n;B,v;
+逝:B,v;E,v;S,vg;E,i;E,vn;B,n;E,l;B,l;
+梢:S,ng;E,n;M,nr;B,n;E,nr;E,l;E,i;E,v;M,l;M,n;
+谥:S,vg;B,n;E,nr;
+蘩:S,g;E,nr;
+笫:S,g;
+累:B,v;E,v;S,a;S,v;E,a;E,l;M,ns;B,z;B,vn;E,z;M,l;B,an;M,i;E,nr;B,n;M,n;B,d;E,vn;E,n;E,i;M,z;B,a;B,l;E,ad;B,ns;M,nt;
+政:B,n;E,n;M,n;M,nt;E,v;E,nr;S,ng;M,l;M,nr;B,j;B,v;B,l;E,j;M,j;B,nz;M,nz;E,i;M,ns;E,vn;M,b;B,ns;M,ln;B,nt;E,nrfg;E,l;B,vn;M,i;E,nrt;E,nt;M,v;B,i;M,nrfg;
+居:B,n;S,v;E,v;M,nr;B,v;E,n;B,d;B,nr;M,nrfg;M,n;E,nr;B,l;B,ns;M,i;B,i;E,nrt;B,j;B,vn;B,q;E,ns;E,j;M,nz;E,vn;E,i;B,nrt;E,l;M,l;M,ns;E,nz;M,nt;E,b;
+槌:S,ng;E,n;E,v;M,i;
+赏:E,v;S,v;B,v;B,n;B,a;E,n;M,l;B,i;M,n;E,nr;E,i;M,nr;E,vn;E,l;B,vn;M,i;M,nz;
+提:B,v;S,v;E,n;B,n;M,n;B,vn;E,v;E,nr;M,nr;E,b;M,i;B,i;E,ns;M,ns;M,l;E,l;B,b;E,i;E,nrt;B,nrt;M,nrt;B,ns;M,b;E,nz;B,l;M,nt;E,vn;B,nz;M,nz;B,d;M,j;
+蝓:E,n;
+嫖:S,v;B,v;B,n;M,l;B,vn;
+釜:M,i;B,ns;B,i;E,n;
+回:B,v;S,v;E,v;B,n;E,m;B,vn;E,mq;B,nz;E,vn;M,l;B,ns;M,i;M,ns;M,n;B,i;E,nr;E,t;S,m;E,i;M,nr;M,z;E,z;E,l;B,l;E,n;E,ns;E,b;B,nrfg;M,b;M,nt;
+橡:B,n;M,n;M,l;B,nz;B,l;
+诠:B,v;B,n;
+跤:S,ng;E,v;E,vn;
+嵯:S,x;B,z;
+绮:B,a;E,nrfg;B,nr;M,nrfg;
+坳:S,g;E,n;
+泺:S,g;M,nr;B,ns;
+曾:S,d;B,d;E,d;B,nr;E,nr;B,n;B,ns;E,nrt;M,nr;M,i;B,nrfg;B,i;E,nrfg;B,nrt;
+娄:B,nr;S,j;B,ns;S,nr;M,ns;B,n;E,n;E,nr;M,v;
+皇:B,n;S,ng;E,n;M,nr;E,nr;M,ns;B,ns;M,nt;M,n;E,ad;E,i;E,nz;B,nz;M,i;B,nr;E,a;M,nrt;E,vn;B,a;B,i;M,l;E,d;B,v;M,z;E,ns;E,z;B,nrfg;E,nrt;B,nt;
+锆:B,n;B,nrt;E,n;E,nz;M,n;
+蜒:E,v;S,x;E,n;E,z;B,n;
+妙:E,a;S,a;E,i;B,n;B,nr;M,i;E,n;E,nr;M,nr;B,i;B,ns;E,b;E,l;B,a;M,l;B,an;B,nrt;M,n;E,an;B,l;
+砘:S,v;
+钛:S,n;B,nz;E,n;B,n;M,n;E,nz;M,nr;E,nr;
+蚧:S,x;E,n;
+怨:E,v;S,v;B,n;E,n;B,v;B,i;B,d;E,a;E,i;M,i;M,l;S,vn;B,vn;M,n;E,l;
+鸬:B,n;
+央:E,n;B,j;M,nt;S,vg;E,nt;M,n;M,ns;B,v;E,nr;M,nr;B,nt;E,nrt;M,j;M,b;E,l;E,ns;
+疱:B,n;E,n;S,n;M,n;
+蘼:S,x;B,n;
+罂:B,n;M,nr;
+釉:S,n;B,n;E,n;E,nr;M,n;B,nz;
+绗:S,v;
+塘:E,n;S,j;E,ns;M,ns;B,ns;M,nr;B,n;E,nr;S,ng;E,nrt;B,s;M,nz;B,nrt;
+噜:E,o;E,n;E,v;M,o;E,q;B,a;E,z;E,l;
+酞:B,nz;S,g;E,n;
+棣:M,nrfg;E,n;E,ns;B,n;M,ns;
+荪:S,g;E,nr;E,nz;
+忭:S,g;E,nr;
+髯:S,ng;E,n;M,nr;B,n;E,nr;
+瑰:E,n;M,n;B,z;B,n;E,nr;B,a;
+叵:B,v;M,i;
+徂:S,g;
+骄:B,a;S,ag;B,n;B,i;E,nr;E,n;M,i;B,l;E,i;M,nr;
+焉:S,v;B,ns;E,i;E,nr;M,i;B,i;M,nr;S,y;E,l;S,r;
+邈:E,nr;S,ag;B,a;M,nr;
+君:S,n;B,n;E,nr;B,nz;E,n;M,nr;B,ns;B,l;M,i;S,v;E,v;E,nrt;M,n;E,ns;M,ns;E,l;B,nrt;M,nt;E,nz;M,a;M,nz;B,v;S,ng;M,nrfg;B,i;E,i;B,nr;M,l;E,r;M,v;
+贡:B,n;S,nr;B,nr;E,nr;E,v;E,ns;M,ns;B,ns;S,ng;M,nr;S,vg;E,n;E,nrt;M,n;B,nrt;
+脩:E,n;
+措:B,n;E,n;E,i;E,v;B,v;B,i;S,vg;B,vn;E,nr;B,nrt;M,nr;B,ns;M,n;B,l;B,nr;
+鞲:S,x;
+论:E,n;S,v;B,n;E,v;E,c;B,v;E,vn;B,vn;M,l;M,n;M,c;E,i;B,nz;E,l;E,u;M,i;E,nr;M,v;M,nz;B,i;E,nz;M,nt;B,l;M,nr;M,b;
+房:B,n;E,n;B,j;S,n;E,v;B,s;M,n;E,vn;B,nr;B,ns;M,ns;E,nr;B,v;E,ns;B,nz;M,i;M,nr;E,nz;E,j;E,b;E,l;M,nz;B,vn;M,nt;B,nt;M,l;
+陇:S,j;B,ns;B,nz;B,n;E,nr;M,nr;B,nrt;M,ns;E,n;M,i;
+光:E,n;B,n;S,n;E,nr;E,v;M,nr;B,v;M,n;B,a;E,nz;M,i;B,j;E,c;B,i;E,vn;B,nr;B,z;M,nz;E,ns;M,l;B,l;B,d;B,nt;E,z;B,nz;E,b;M,nrt;M,nt;E,t;E,i;B,ns;B,vn;B,m;E,l;M,nrfg;B,b;M,m;B,q;E,a;B,nrt;M,ns;E,nrt;M,z;M,v;M,a;E,nrfg;M,j;E,j;B,nrfg;E,nt;B,t;
+烈:E,a;S,a;B,n;E,nr;E,i;M,i;E,l;E,n;M,nr;E,ad;E,ns;B,b;M,nrt;B,z;E,z;E,b;M,l;M,ns;M,n;B,nz;B,l;B,i;E,nrfg;E,v;
+位:E,n;E,m;B,v;S,q;B,n;E,v;E,rz;E,r;S,m;E,vn;M,n;E,b;M,l;E,mq;B,nr;E,l;E,nr;M,nt;B,l;M,i;E,i;B,i;M,j;M,nr;E,d;M,nz;B,ns;E,qe;E,nz;E,j;
+擐:S,g;
+拔:E,n;S,v;E,v;B,v;M,nr;E,a;M,i;E,nr;B,i;E,i;B,a;M,l;B,vn;M,n;B,n;E,nz;
+飘:B,v;S,v;M,z;E,v;B,d;M,i;E,z;B,a;B,z;B,n;B,vn;M,nr;B,i;E,a;E,nr;B,l;M,l;E,vn;B,nr;M,v;
+步:E,d;E,m;B,n;E,vn;E,n;S,q;E,v;B,v;E,vd;M,n;M,l;M,i;B,nr;E,l;B,q;E,q;M,nr;M,m;E,i;S,m;B,nz;B,i;M,nz;M,nrfg;E,nr;B,l;M,j;E,nz;M,v;M,ns;E,ns;B,d;B,j;
+胨:S,g;
+镱:S,g;
+蝽:S,g;E,nr;
+墙:E,n;S,n;B,n;B,s;E,v;M,i;E,nr;E,i;M,n;E,nz;B,i;M,l;E,l;B,b;B,nz;E,j;E,ns;B,ns;
+欤:S,y;E,nr;
+纭:S,x;E,i;E,z;M,l;
+鼬:E,n;B,n;
+锰:S,n;B,n;M,n;E,n;E,nz;E,nr;M,nr;
+嘲:B,v;E,v;S,vg;B,vn;M,i;E,l;E,vn;B,n;E,i;
+髅:E,n;S,x;
+桎:B,n;B,v;
+蓑:B,n;M,i;
+晒:S,v;E,v;B,v;B,n;M,n;E,i;M,i;E,nrt;M,nr;E,nr;M,nz;B,nz;
+苕:E,n;B,n;
+奘:E,nr;M,nr;S,g;
+痛:E,n;B,an;S,a;E,a;B,v;B,a;E,v;B,n;M,i;B,i;E,vn;M,n;B,z;M,z;E,d;E,l;B,l;E,i;B,d;M,l;E,nr;B,vn;E,an;M,nz;
+坜:E,ns;M,ns;
+迷:E,v;B,v;S,v;B,a;B,n;E,n;M,l;B,b;M,i;M,z;B,z;B,l;E,nr;E,a;E,nz;E,i;B,i;E,vn;B,vn;M,nrt;B,nz;M,nr;E,z;B,nrt;B,an;
+楸:S,g;E,n;E,nz;B,n;M,nr;
+藻:S,ng;E,n;B,n;E,nr;M,n;B,l;M,nr;B,v;M,ns;M,nz;E,ns;B,nz;
+杼:S,g;E,n;E,nr;M,nr;E,i;
+咆:B,v;B,l;B,n;
+渍:S,v;E,n;E,v;M,v;B,n;M,n;
+戕:B,v;B,vn;
+弗:B,nr;S,dg;B,nrt;M,nr;B,ns;E,nr;M,nrt;E,nz;M,b;E,nrt;B,nt;M,ns;M,l;M,i;M,n;B,nz;E,q;B,a;M,nz;
+唛:S,g;
+谡:S,g;E,nr;E,n;M,nr;
+溢:B,n;E,v;S,v;B,v;E,nr;B,l;E,l;M,nr;E,vn;E,i;M,n;M,l;
+耩:S,g;
+紫:B,n;S,a;B,nr;B,ns;M,nr;B,b;E,nr;M,n;B,nz;B,nt;E,a;M,i;E,n;E,i;B,l;B,nrt;E,b;B,z;M,nt;E,ns;
+攻:B,v;E,v;S,v;E,vn;B,n;B,vn;M,n;E,nr;M,i;B,i;M,nr;E,i;B,l;M,l;B,nz;
+肾:B,n;S,n;E,v;B,l;E,n;B,v;B,nz;M,n;B,b;
+屁:B,n;S,n;E,v;E,n;M,nr;B,i;E,nr;M,l;M,n;M,i;M,v;
+赋:S,v;B,v;B,n;E,n;E,nr;S,n;M,l;E,l;M,nr;E,v;M,i;E,nz;
+乍:S,d;S,v;B,ns;M,i;B,l;E,nr;
+腓:B,nrt;B,nz;B,ns;B,n;E,ns;
+污:B,vn;B,n;E,v;M,n;S,ng;E,n;B,v;M,i;E,vn;M,b;E,i;B,a;S,vg;B,i;E,a;M,v;M,nz;B,nz;M,j;E,nr;
+橥:S,g;
+诤:S,vg;E,v;B,n;E,nr;B,v;
+恩:E,nr;M,nr;E,v;S,nr;B,n;S,ng;B,nr;E,n;S,j;E,nrt;M,nrt;M,i;B,nrt;B,ns;E,l;B,v;M,n;M,t;B,a;B,vn;E,ns;M,nt;B,nz;B,i;E,nz;M,ns;B,z;M,z;M,l;
+嵫:S,x;E,n;
+鹭:S,ng;E,nr;E,n;B,n;B,ns;E,nz;M,nr;
+关:B,n;B,v;E,v;E,vn;B,p;E,n;S,v;E,ns;B,nr;M,l;B,ns;B,vn;M,n;M,ns;E,l;E,nr;B,f;M,nr;B,s;M,i;E,i;B,nt;E,t;S,n;E,nt;B,j;M,nt;B,nz;B,nrfg;M,nz;B,l;B,a;M,b;M,v;E,b;E,j;B,i;
+盲:B,n;B,ad;S,ng;E,n;B,a;E,v;M,n;B,v;S,vg;B,j;B,i;M,nr;B,vn;M,nt;
+虽:B,c;S,c;B,i;M,i;B,l;M,l;
+窃:S,vg;E,v;B,v;M,n;M,i;B,i;B,n;B,l;M,l;E,vn;B,vn;E,n;
+璇:S,g;E,nr;M,nr;B,n;E,nrfg;
+霆:E,n;E,nr;E,i;S,g;M,nr;M,i;
+刈:S,vg;B,v;E,nr;
+梏:E,n;S,g;E,v;
+抓:B,v;S,v;E,v;B,n;M,l;B,i;E,l;B,nz;B,l;E,i;B,vn;
+宙:E,n;M,n;M,l;B,nrt;E,nr;S,g;M,nr;M,nz;
+喝:S,vg;B,v;E,v;B,vn;E,l;E,nr;M,l;M,i;M,n;E,a;B,l;B,ns;B,n;E,n;E,i;E,vn;
+渠:B,n;S,n;E,n;E,nr;E,ns;B,nr;M,i;M,n;B,ns;M,nr;M,ns;B,v;E,nz;
+熵:S,g;E,n;E,nr;
+伶:B,a;M,i;E,n;B,ns;B,i;M,ns;M,z;E,z;M,nr;M,l;M,nz;
+施:E,n;E,v;B,v;B,vn;B,nr;S,v;M,nr;B,n;E,nr;E,i;B,nrt;M,i;E,ns;E,l;M,ns;B,nrfg;B,ns;M,n;E,nrt;B,nt;E,vn;M,v;B,nz;M,nrt;M,nz;M,l;E,nz;B,i;
+萼:B,n;E,n;M,n;
+哇:S,y;B,o;E,ns;E,o;M,ns;M,n;E,nrt;B,l;B,e;
+介:B,v;M,nr;E,n;B,n;E,v;M,n;S,nr;E,nr;B,nr;E,j;S,ng;M,l;B,ns;M,i;M,j;B,j;S,vg;M,nz;B,nrfg;E,vn;B,a;
+煊:E,nr;S,x;B,a;M,nr;
+蟑:B,n;
+糗:S,g;
+盛:S,v;B,v;E,a;B,n;B,nr;E,nr;E,nz;M,ns;B,b;M,nr;E,z;B,ns;B,t;M,l;E,b;B,i;M,nt;E,v;B,l;B,nz;M,i;M,n;M,nz;E,i;E,l;B,nrfg;E,nrt;E,ns;B,nrt;M,nrfg;
+呜:S,o;B,v;B,l;M,l;B,e;M,i;E,nr;M,nr;
+烟:B,n;S,n;E,n;E,v;M,n;B,ns;M,i;M,l;B,i;E,nr;B,nz;E,d;E,vn;E,nz;M,nr;E,i;B,v;B,l;E,b;B,nt;M,nz;B,z;E,l;M,nt;M,j;
+习:E,v;B,n;M,n;S,v;E,vn;E,n;B,v;B,nr;B,i;E,nr;M,nr;B,z;E,z;S,vg;B,nrfg;M,t;M,nz;B,ns;M,i;E,i;S,ng;S,nr;
+赢:S,v;B,v;B,n;E,v;E,n;E,nr;M,nr;B,nz;M,n;
+缁:S,g;
+嶂:S,g;E,n;E,i;E,nr;
+礅:S,g;
+预:B,v;B,vn;B,n;S,d;E,v;B,d;E,vn;M,l;E,nr;B,b;M,nr;M,n;M,b;B,nz;M,i;B,j;B,l;M,nt;B,t;M,j;
+垆:S,g;M,nr;
+貌:E,n;S,ng;E,an;E,nz;B,v;M,i;M,n;E,i;E,nr;M,l;B,i;E,l;M,nr;B,l;
+愕:B,a;E,a;E,v;
+嘛:S,y;E,n;M,n;E,ns;M,ns;
+锝:S,g;
+借:B,v;S,v;B,n;E,p;E,v;B,p;B,d;B,vn;B,i;B,l;M,p;M,n;M,l;E,i;E,vn;M,i;
+褥:E,n;B,n;M,t;M,n;E,nz;
+岬:B,n;
+怿:S,g;E,nr;
+绀:E,n;S,g;M,nr;M,n;
+卉:E,n;S,ng;E,nr;M,n;M,nr;M,nt;
+狈:E,ad;E,an;S,x;M,i;
+蹋:E,v;S,v;E,vn;
+泌:E,v;E,n;M,n;B,n;B,nz;B,v;B,ns;M,nz;
+忖:E,v;B,v;
+高:S,a;B,n;E,v;B,a;E,a;B,d;B,v;B,nr;B,b;M,nr;E,n;M,n;M,ns;B,ns;B,j;E,nr;B,l;M,i;B,s;M,l;B,nz;M,nrfg;B,i;M,nz;M,nt;B,z;E,nrt;M,z;B,nrt;E,b;B,nrfg;M,b;E,d;B,nt;E,i;E,j;E,l;E,nz;M,j;E,z;B,vn;M,nrt;M,v;E,nrfg;E,ns;B,an;E,vn;
+姚:B,nr;E,nr;E,ns;S,m;S,nr;B,m;B,nrfg;M,n;M,nr;M,ns;B,ns;E,m;
+铜:S,n;B,n;E,n;M,n;B,ns;E,nr;B,nrt;M,nz;M,nr;B,i;B,nz;E,nz;E,j;M,t;M,ns;M,nt;M,i;
+裤:B,n;E,n;S,ng;M,n;E,j;E,nz;E,nr;
+捩:E,v;S,g;M,n;
+篮:B,n;E,n;S,j;S,q;E,v;E,nz;M,n;E,vn;B,s;E,nr;E,nt;M,l;B,j;M,ns;M,nz;S,ng;M,nt;B,nz;M,j;
+酵:E,v;B,n;M,n;E,vn;B,v;M,nt;B,nz;
+开:B,v;E,v;S,v;B,n;E,ad;B,ns;M,nr;B,nz;B,vn;B,a;E,m;M,i;B,l;M,l;M,nt;E,n;S,m;M,n;B,i;E,nr;E,i;M,ns;E,l;B,nrt;E,ns;M,nz;B,b;B,q;B,f;M,v;B,t;M,b;B,nt;E,j;B,d;E,nrfg;E,a;E,nz;B,j;E,nrt;M,z;B,z;M,nrt;B,u;
+处:B,v;S,n;E,n;E,s;E,d;E,m;E,v;B,n;E,r;B,vn;B,d;S,m;E,l;E,i;M,l;M,n;M,nr;M,v;M,i;E,nt;E,nz;B,b;M,vn;B,i;B,l;E,vn;M,m;E,b;M,j;E,nr;M,z;E,z;M,b;B,t;B,q;E,ns;E,q;M,nz;M,nt;B,j;
+阆:S,x;B,ns;B,n;M,nr;E,nr;
+匈:B,n;B,ns;S,j;B,nz;B,nt;
+逊:E,nr;S,vg;E,a;E,nz;E,nrt;B,a;B,n;M,nr;B,v;M,b;E,i;E,ns;M,l;B,nz;M,ns;M,nrt;E,n;B,ns;M,nt;
+咝:S,o;B,n;M,n;E,nr;
+甜:B,n;S,a;E,nr;B,a;E,a;B,z;M,z;M,nr;B,i;M,i;E,l;E,n;E,i;B,nz;B,b;
+亡:E,v;S,vg;B,v;E,vn;S,v;M,n;E,i;E,n;B,n;E,l;B,i;M,nz;M,i;M,l;B,l;
+漠:E,n;E,ns;B,n;E,a;B,z;B,ns;M,v;E,v;B,v;M,n;E,z;B,i;M,vn;B,l;B,vn;E,nrfg;
+讣:B,n;
+椤:S,x;E,n;E,nr;
+挨:S,v;B,v;B,d;M,i;B,i;E,a;E,nr;M,d;B,l;M,z;E,z;
+皱:E,n;S,v;B,n;S,n;B,v;E,nr;B,z;E,i;E,nz;M,z;E,v;M,i;
+霰:B,n;M,n;
+吲:B,n;S,x;
+蔼:E,nr;S,g;E,a;M,nr;M,i;
+蛑:S,x;E,n;
+摒:B,v;S,vg;B,l;
+存:B,v;E,v;B,n;S,v;E,n;B,vn;M,n;M,nr;E,vn;E,nr;M,l;M,i;E,l;E,i;E,a;B,j;B,d;M,t;M,nz;M,b;E,nrfg;B,l;B,nz;B,nrfg;B,i;
+矛:B,an;S,n;B,n;M,l;E,n;M,i;E,nr;M,nr;M,n;E,i;S,nr;
+啜:S,vg;B,v;B,n;
+你:S,r;B,r;B,l;B,i;E,b;M,l;E,nr;M,nr;B,n;M,b;E,l;M,n;
+豢:S,vg;B,v;
+旧:S,a;B,n;E,z;E,d;B,t;E,a;E,v;E,n;B,ns;B,b;M,n;E,ns;E,b;E,j;E,i;M,l;E,nr;M,i;E,vn;B,i;E,l;M,ns;B,l;B,nrt;B,v;M,j;M,nr;
+聪:B,a;E,nr;B,n;S,ag;B,i;M,i;M,nr;E,nz;E,v;B,l;M,l;M,n;E,nrfg;
+峭:B,n;E,a;S,ag;M,i;B,a;E,nr;E,i;E,z;E,l;M,nr;
+囱:E,n;S,x;
+僵:B,n;S,a;B,v;B,a;B,z;E,v;M,l;B,vn;E,a;E,i;S,ad;M,n;M,nr;E,n;M,z;E,z;
+跷:E,a;S,v;B,n;M,n;B,a;E,n;E,v;E,nr;
+龀:S,g;E,nr;
+岂:S,d;B,v;B,d;B,i;B,c;E,nr;M,nr;B,n;M,nrfg;
+馄:B,n;
+嚆:S,x;
+氍:B,n;S,x;
+怕:S,v;E,v;E,d;E,a;E,c;B,a;M,l;M,i;E,i;E,l;B,v;B,n;E,j;
+碚:S,g;E,nr;M,ns;M,nr;
+缫:B,v;B,n;B,vn;
+钲:S,g;E,nr;
+愿:S,v;B,v;E,v;E,n;B,n;M,n;E,i;E,d;M,i;M,nt;M,v;E,l;E,nr;E,vn;E,j;M,nr;B,i;M,l;E,b;
+芾:S,x;E,nr;
+魃:E,n;S,x;
+镇:S,n;E,n;E,ns;B,v;E,nr;B,n;B,ns;M,v;B,a;M,nr;E,r;E,v;E,nrt;B,vn;M,n;E,j;B,nrt;B,nz;B,i;M,ns;M,nz;B,j;B,nt;M,b;E,nrfg;B,b;
+珈:S,g;E,n;E,nrt;M,ns;M,nr;E,nr;
+淌:S,v;E,v;M,ns;M,nr;
+某:B,r;S,r;E,nr;E,r;M,nr;E,n;M,nrt;E,nrt;
+懔:S,g;E,nr;
+廖:B,nr;S,nr;M,nr;M,nrt;B,l;E,nr;M,ns;B,nrt;
+桥:S,n;E,n;E,ns;B,n;E,nr;E,v;B,s;M,nt;E,nz;M,ns;M,nr;E,nrt;M,nz;B,ns;M,n;B,nz;E,i;M,nrfg;M,i;B,nr;E,l;E,nrfg;B,nrt;B,l;
+扩:B,v;S,vg;E,nr;B,n;B,vn;M,j;M,n;B,l;B,b;B,nz;E,vn;
+即:S,v;E,d;B,c;B,d;B,v;M,i;B,t;E,v;B,ns;B,b;B,n;M,l;M,nr;E,i;B,i;B,l;B,nz;
+遵:B,v;S,nr;B,ns;S,vg;M,nr;E,nr;B,nz;B,l;M,ns;B,vn;
+詹:B,nr;S,nr;B,nrfg;B,nrt;E,nr;M,nr;B,ns;M,nrt;
+棺:B,n;S,ng;E,n;M,nr;E,v;M,i;M,l;B,nz;
+拾:E,v;S,v;B,v;E,i;B,l;B,i;M,i;E,nr;B,mq;E,l;S,m;B,n;M,nr;
+怀:B,v;S,v;B,s;B,n;E,nr;E,v;B,nr;M,nr;E,n;E,vn;B,ns;M,i;E,i;M,l;B,nrt;B,l;B,vn;B,i;B,t;E,l;E,ns;E,d;E,a;M,ns;M,d;E,nrfg;M,nrt;B,nz;E,z;M,nrfg;M,nz;
+螅:S,x;E,n;
+嚏:E,n;E,v;B,n;E,o;
+馑:S,x;E,n;
+脖:B,n;S,ng;E,n;M,v;M,n;M,l;E,nr;
+料:E,n;S,n;E,v;E,l;B,v;M,n;M,l;E,i;E,d;E,nz;E,vn;M,i;B,n;S,v;E,nr;E,b;B,i;M,nt;E,ns;B,z;M,nz;M,b;M,ns;
+蜚:B,v;M,i;B,n;B,l;
+贞:M,nr;E,nr;S,nr;B,nz;E,n;B,nrfg;B,n;B,nr;M,i;E,a;B,l;E,nz;M,n;E,nrfg;B,a;M,l;M,nt;B,ns;B,b;
+瞥:S,v;B,v;E,n;S,q;S,vn;
+嘤:S,o;E,nr;
+肫:S,g;E,n;
+蚯:B,n;
+攮:S,v;B,n;
+欲:S,d;E,n;M,i;B,n;E,v;E,i;M,l;E,nr;B,l;B,i;B,v;M,nr;M,n;
+侵:B,v;E,v;S,vg;B,vn;B,n;M,n;E,nr;M,l;B,nz;B,ns;M,nz;
+然:E,d;E,c;B,c;E,ad;M,n;E,b;E,a;M,l;S,r;M,i;E,z;E,i;E,nr;E,n;E,v;M,c;E,l;M,nz;M,t;M,nr;M,nt;M,ns;E,r;M,v;E,vd;E,nrfg;E,nrt;S,c;E,nz;M,z;
+喹:B,n;E,n;B,nz;
+眺:B,v;E,v;S,vg;E,nr;M,nr;E,i;
+宽:S,a;B,a;B,n;E,v;B,v;E,nr;E,n;M,nr;B,vn;B,i;E,j;B,z;B,ns;M,z;B,l;E,i;E,vn;B,b;M,i;M,l;E,l;B,nz;M,nt;
+盏:S,q;E,m;E,n;M,n;E,nz;S,m;M,nr;
+摘:S,v;B,v;B,n;E,v;E,n;B,vn;B,l;M,i;E,vn;E,nr;M,n;
+话:S,n;E,n;E,v;E,u;B,n;E,r;E,vn;E,l;M,n;M,l;M,i;M,c;E,a;E,i;B,i;E,c;E,j;B,l;M,nt;B,v;E,nr;M,nr;M,nz;E,nz;
+仟:S,m;M,m;B,m;E,nr;
+揭:B,v;S,v;E,vn;E,v;B,n;B,ns;B,i;B,l;B,nr;E,i;B,nrt;M,i;
+酶:S,n;E,n;E,l;M,n;B,n;E,nz;E,nr;
+痹:E,v;S,ng;M,i;E,vn;E,a;E,n;B,n;M,n;
+呸:S,e;
+萃:B,v;E,v;E,i;S,ng;S,vg;E,nr;E,n;M,nr;
+掂:S,v;B,v;M,v;B,i;
+訇:E,n;S,x;M,nr;E,nr;
+榆:B,ns;S,ng;B,n;E,nr;M,nr;E,n;M,ns;E,ns;B,i;E,i;
+逋:S,g;M,nr;E,nrt;E,nr;
+匍:B,v;B,n;
+阏:S,x;B,n;
+引:B,v;S,v;E,v;B,n;M,n;E,nr;B,i;E,n;E,vn;B,l;M,nr;M,l;B,j;M,nz;B,vn;M,i;E,i;B,nz;E,nz;
+戗:S,v;E,a;
+厢:E,n;B,n;S,q;S,ng;M,nz;M,i;E,nr;E,nz;B,b;M,l;M,ns;E,i;E,nrt;
+鲨:B,n;E,n;E,nz;B,nz;M,n;
+循:B,vn;E,v;S,vg;M,n;M,i;B,l;B,i;E,nr;B,v;B,n;B,d;B,ns;M,nr;B,b;E,i;E,ns;M,ns;B,nz;M,b;
+茭:B,n;
+抬:B,v;S,v;M,i;B,n;B,l;E,v;M,l;M,n;
+械:E,n;M,n;M,v;M,vn;M,l;M,b;E,v;M,nt;E,l;B,v;M,nz;B,vn;E,vn;
+溴:S,ng;B,n;B,nz;M,nz;
+刷:E,v;B,v;S,v;E,vn;M,n;M,z;E,z;B,n;E,n;E,l;B,z;B,o;M,nz;B,nz;
+锹:S,n;E,n;M,nr;E,nr;
+视:E,v;B,n;E,n;S,vg;M,n;B,v;E,b;E,j;E,l;M,nt;M,i;B,i;E,a;E,vn;E,nr;E,i;E,nt;M,vn;M,l;M,nz;M,j;E,nz;B,l;B,vn;M,ns;B,j;
+獍:S,g;
+罕:B,a;S,ad;M,nrt;E,v;E,nr;E,nrt;S,ag;E,ns;M,i;E,nz;M,nr;M,ns;E,a;M,n;
+柚:S,ng;B,n;E,n;M,nr;
+淞:S,g;M,nr;E,nr;M,ns;
+秦:B,nr;S,nr;B,ns;E,t;B,t;B,n;E,nr;S,j;M,nz;M,nr;B,j;B,nz;E,ns;B,nrt;B,nrfg;B,nt;M,ns;M,i;B,l;M,n;B,i;E,nz;E,nrfg;M,nt;
+嵩:B,ns;S,g;E,nr;M,nr;M,nz;B,n;E,nrfg;B,nrt;
+恫:B,vn;
+景:E,n;B,n;S,ng;B,nr;M,n;M,nr;B,a;E,nr;B,ns;M,a;B,nz;E,v;M,i;M,ns;E,ns;M,l;B,v;M,nz;E,l;E,i;E,vn;M,b;E,nz;E,nt;B,nrfg;M,nrt;
+裰:E,n;S,g;
+凶:S,a;B,a;B,n;E,n;E,v;B,i;M,i;B,an;B,v;B,ad;B,z;M,l;B,vn;
+铸:S,v;B,v;B,n;E,v;E,nr;E,n;B,vn;M,l;B,i;M,nr;M,n;B,nz;M,nrfg;
+基:B,n;B,a;S,ng;E,n;B,nz;B,d;E,nr;B,p;M,n;M,ns;M,nr;M,nz;M,nt;B,nr;E,nrt;B,ns;B,l;E,v;E,ns;B,v;B,nrt;M,l;E,nz;B,nt;B,t;M,nrt;B,j;E,j;M,j;M,v;M,i;E,nrfg;E,vn;S,j;
+巾:E,n;S,ng;M,nr;E,nr;M,l;B,i;M,n;B,b;M,i;B,n;E,i;B,nz;B,l;
+愀:S,x;
+貉:S,ng;E,i;B,n;
+频:B,n;B,a;E,n;E,d;B,d;S,ng;E,b;B,v;S,ag;E,v;E,vn;M,n;E,nr;M,nr;E,nz;M,i;M,l;M,nz;E,j;B,nz;
+缔:B,v;B,n;E,v;M,l;B,vn;
+耖:S,n;
+撙:B,v;
+鸪:E,n;S,x;M,nr;M,n;
+螯:S,n;B,nz;B,n;E,nr;
+足:E,a;E,v;S,a;B,v;M,n;B,n;M,i;B,d;E,i;E,z;E,n;M,v;E,d;B,r;M,l;B,j;B,f;M,nt;B,i;E,nr;M,nr;M,ns;E,ns;B,nz;E,l;E,vn;M,j;E,j;E,b;E,nt;B,vd;B,nrt;
+亵:B,v;E,v;B,a;
+旃:S,g;M,n;B,n;E,nr;
+赈:B,v;B,vn;E,l;B,n;
+俟:S,x;M,nr;E,nrt;
+郡:S,n;E,nr;B,n;B,ns;M,nr;E,n;E,ns;M,nrt;
+嗣:M,nr;S,ng;E,nr;B,t;E,n;E,v;M,nrfg;B,n;
+拭:S,vg;E,v;B,i;B,v;
+棱:S,ng;B,n;E,nr;M,i;M,n;E,b;B,nz;M,nr;B,i;M,ns;E,n;M,l;E,v;M,nz;E,ns;E,a;
+啸:E,n;E,v;S,v;E,nr;M,nr;B,n;E,l;B,l;B,v;E,i;E,nrfg;B,nr;
+竽:S,g;M,i;E,n;
+謇:S,g;E,nr;
+梆:B,n;S,o;M,n;M,z;E,z;M,nr;B,z;E,nr;
+刍:E,v;B,v;M,n;B,n;
+霏:B,z;E,z;M,nr;E,nr;
+璎:B,n;
+堑:E,n;B,n;E,l;M,i;M,n;
+窒:B,v;B,a;
+帕:B,nr;S,ng;E,n;M,nr;B,ns;E,nr;B,nrt;M,nrt;M,ns;M,nz;E,nrt;B,nz;E,ns;E,nz;
+劢:S,g;E,nr;
+舭:S,x;
+掬:S,v;E,i;E,l;M,nr;
+踵:M,i;S,g;E,v;E,i;B,i;E,n;
+疸:E,n;S,x;
+恁:S,g;B,u;
+裆:E,n;M,n;E,b;B,n;
+汉:S,j;B,n;E,t;B,nz;E,n;B,nr;E,ns;B,ns;B,t;E,nr;M,nr;M,ns;B,j;E,j;B,nrt;E,nz;M,nz;M,nt;M,n;B,v;M,l;E,nrt;B,b;E,i;B,nt;E,l;M,i;E,nrfg;M,nrt;B,nrfg;M,nrfg;M,v;B,l;E,v;
+牍:E,n;S,g;E,i;M,n;M,i;
+双:B,n;S,m;B,m;E,m;B,b;B,nr;B,nz;M,nr;E,r;B,d;B,ns;M,ns;M,m;E,nr;M,i;B,j;B,v;E,v;B,t;M,l;E,i;B,i;E,j;B,l;B,nt;M,nrfg;E,nrfg;B,nrt;M,j;E,ns;M,n;B,mq;M,nz;E,nz;
+铎:E,nr;S,nr;M,nr;E,n;
+姐:E,n;B,n;E,nr;S,n;M,nr;M,n;E,i;E,ns;
+泞:E,n;S,g;E,a;
+镣:E,n;B,n;
+绪:E,n;M,n;E,v;S,ng;E,nr;M,nr;E,i;M,v;M,i;B,n;E,l;E,t;M,l;
+杯:E,m;E,n;S,q;B,n;E,v;E,nz;B,i;M,n;S,m;B,s;E,nr;E,a;E,j;M,m;E,ns;M,l;M,nz;E,q;B,q;E,i;
+闸:S,n;E,n;B,n;E,v;M,n;E,vn;B,ns;E,ns;S,v;
+固:B,a;E,v;B,n;S,j;E,a;B,l;B,v;B,c;M,n;B,b;S,vg;E,nr;B,ns;E,vn;E,i;M,nr;M,l;B,i;E,ns;M,nz;B,nz;E,j;E,nrt;E,nz;E,ad;M,ns;B,nrt;B,vn;E,n;M,v;M,i;B,nt;
+薅:S,v;
+辉:E,nr;B,a;S,nr;E,n;B,n;M,i;M,nr;E,v;S,ng;B,ns;B,v;M,n;E,i;E,ns;M,nz;B,nz;E,nz;B,nt;M,ns;B,nrt;E,l;
+醍:B,n;B,i;S,x;
+咏:B,v;E,n;B,n;E,v;E,nrfg;M,n;M,nrfg;
+库:B,n;E,n;S,n;B,nr;B,nrt;B,ns;E,nr;E,nz;M,ns;M,nr;M,n;E,v;E,ns;M,nrt;E,j;E,l;E,nrt;M,nt;B,v;M,nz;B,q;B,nt;B,nz;
+蔚:E,nr;S,nr;M,nr;B,ns;B,nr;B,l;B,a;S,ag;B,i;B,n;E,i;B,b;
+删:B,v;S,v;E,v;B,i;B,vn;B,n;E,nr;
+鄢:S,nr;B,nr;B,n;E,nr;B,ns;
+疥:B,n;M,i;
+芫:B,n;
+蒯:B,nr;S,nr;M,nr;
+町:E,ns;M,ns;B,nr;B,ns;
+蹈:E,n;M,n;E,v;M,i;S,vg;E,i;M,nt;B,v;M,t;E,nr;
+坎:S,ng;B,nrt;B,a;E,n;E,nr;B,n;B,ns;M,nr;B,q;M,n;E,nrt;B,l;M,nrt;M,z;B,z;E,ns;
+结:B,n;B,v;E,v;S,v;B,vn;E,a;E,n;M,n;B,a;M,i;M,l;B,l;M,z;B,z;M,v;E,nr;B,nr;M,nr;E,vn;M,nz;B,i;M,j;E,l;E,j;B,j;E,i;M,nt;M,ns;M,vn;E,nrt;B,ns;B,nz;E,z;E,nz;
+蝮:B,n;
+秽:E,a;E,n;B,n;E,i;B,a;M,i;
+殆:B,v;S,d;E,a;E,i;
+伉:B,n;S,nr;E,nr;
+瞎:S,v;M,nr;B,n;B,v;M,i;M,l;M,n;E,n;S,vn;E,v;B,l;
+袜:B,n;E,n;S,ng;M,n;E,nz;
+氟:S,n;B,n;M,n;B,nz;M,nz;E,n;E,nr;E,nz;
+冢:S,ng;M,nr;E,n;E,nrt;E,nr;B,i;
+钤:S,vg;E,nr;B,n;M,nr;
+砧:B,n;S,ng;E,n;E,nr;
+宦:B,n;S,nr;E,n;B,nr;E,nr;M,nr;E,i;B,v;
+悬:S,v;B,v;B,n;B,a;B,i;E,v;M,l;M,i;E,nr;M,n;E,i;B,nz;M,nr;B,vn;
+贵:B,n;E,a;S,a;B,ns;M,nr;E,nr;E,n;B,a;E,i;M,ns;M,i;B,v;B,nt;B,nz;E,l;B,nrt;M,l;B,i;M,n;E,nrfg;B,vn;B,l;B,r;M,nt;M,nrfg;M,nrt;
+霹:B,n;M,i;M,nr;B,nz;
+尿:S,n;M,n;B,n;E,v;E,n;S,v;B,v;M,nz;E,nr;M,i;B,j;
+臂:E,n;S,n;B,n;M,i;M,n;E,i;S,ng;E,v;M,nr;E,nr;E,l;E,b;M,l;M,nz;
+故:S,c;B,n;E,n;B,d;E,v;B,ns;E,i;E,d;B,v;B,c;S,n;M,i;M,ns;B,i;B,nz;B,l;M,n;E,l;M,nr;M,b;E,a;M,l;
+识:E,n;E,v;M,n;S,v;B,v;M,l;M,i;E,i;E,l;B,n;E,d;E,nr;B,a;M,nt;B,l;B,vn;B,i;M,nr;E,vn;M,v;E,b;M,b;B,nz;E,a;
+筑:E,n;M,n;S,v;E,v;B,v;E,l;M,b;B,vn;E,nr;E,i;M,nr;M,nt;B,nz;B,nt;M,nrfg;
+揖:S,vg;M,nr;E,v;E,nr;E,i;B,v;
+濞:S,x;E,nr;E,ns;
+卡:B,nr;S,n;E,n;B,n;M,nr;B,nrt;E,nr;B,ns;B,nz;E,ns;M,ns;M,n;E,nrt;E,v;M,nz;B,v;M,nrt;E,q;E,nz;B,q;S,v;M,l;B,b;E,r;E,vn;E,j;B,nt;M,nt;E,mq;
+啥:S,r;E,r;B,r;B,n;
+篦:E,n;B,n;
+彩:B,n;E,n;S,ng;E,a;B,b;E,i;E,nr;M,nr;E,b;M,i;E,v;M,n;E,nz;E,vn;M,l;E,l;B,l;B,nz;B,v;M,z;B,nrt;B,j;M,ns;E,z;M,nz;M,b;B,i;
+扫:B,v;S,v;E,v;B,n;B,a;M,i;B,vn;B,l;M,v;M,l;B,i;M,n;M,nz;E,nz;B,j;E,vn;
+胬:S,x;B,n;
+叶:E,n;B,nr;B,n;S,n;M,n;E,t;S,j;E,nr;S,v;E,m;B,ns;M,nr;E,f;S,nr;E,nz;M,i;E,i;S,m;E,nrt;B,nrt;M,nz;E,ns;B,nrfg;B,nz;E,l;B,i;S,ng;M,ns;S,q;M,nt;M,l;M,t;B,l;
+忾:E,i;S,g;M,i;
+压:B,n;E,n;E,v;S,v;B,v;M,n;E,vn;B,vn;B,d;M,z;E,z;E,nz;E,b;B,l;M,i;B,nz;M,nz;M,l;B,b;E,l;E,j;B,i;
+喏:S,e;E,v;S,x;E,nr;
+骑:S,v;B,n;B,v;E,n;E,nr;M,n;M,nr;B,ns;E,v;B,i;B,b;M,nt;M,i;E,vn;E,i;M,v;
+鲕:S,g;
+踞:E,v;S,vg;E,i;M,i;
+匠:E,n;S,ng;B,n;M,n;E,nr;E,i;M,i;B,i;M,l;E,l;E,ns;
+逢:S,v;E,v;M,i;E,i;B,i;M,nr;B,l;E,nr;B,v;E,vn;M,l;
+唤:S,vg;E,v;E,nr;B,v;M,i;E,vn;E,i;M,nr;M,n;M,l;
+纩:S,g;
+莫:S,d;B,nr;B,ns;B,d;B,v;B,i;M,i;M,nr;B,nrt;E,d;B,l;E,nr;B,b;B,nt;M,l;M,nrt;B,n;E,nrt;B,c;B,nz;M,ns;M,nz;M,n;B,nrfg;E,ns;E,nz;B,a;M,nt;
+薯:E,n;B,n;B,nz;M,n;
+栲:B,n;
+父:B,n;E,n;S,ng;E,r;E,nr;B,b;M,n;E,v;M,nr;E,nrt;M,l;B,l;B,j;M,j;M,i;E,i;B,t;E,nz;M,nz;E,ns;B,i;
+荀:B,nr;S,nr;E,nr;M,nr;B,nrfg;
+柃:S,x;
+酌:E,v;S,vg;B,d;E,i;B,v;E,nr;B,l;
+噎:S,v;B,v;E,v;M,i;B,n;
+蛙:S,ng;E,n;B,n;B,vn;M,nr;E,i;M,l;
+獠:B,n;M,i;
+铥:S,g;
+黩:M,i;B,v;
+罨:S,g;
+惭:B,a;E,a;S,ag;M,i;E,i;E,nr;
+虮:S,g;
+衲:E,r;S,g;M,n;E,nr;
+泵:S,n;E,n;B,n;E,nz;S,v;E,nr;B,nz;M,b;
+盹:S,ng;E,v;B,n;M,v;
+鹾:S,g;
+蜃:M,i;B,n;
+三:B,m;S,m;M,m;B,mq;E,m;B,n;M,nr;B,ns;B,j;B,nz;B,b;M,ns;E,t;B,t;M,n;B,i;M,i;M,nz;B,nrt;B,l;M,l;E,d;M,t;E,r;E,nr;E,n;B,r;M,j;E,i;B,nr;B,nt;M,nt;B,v;E,nz;E,nrfg;E,j;B,vn;B,s;M,mq;E,l;M,nrfg;M,d;E,mq;M,v;M,b;
+倍:S,m;E,m;S,q;B,n;B,v;E,d;M,n;B,d;E,i;M,nr;E,b;E,l;E,nr;B,nr;M,b;B,nz;M,nz;M,i;E,n;M,m;M,l;
+锏:S,g;E,n;M,nr;
+皎:B,z;
+娑:E,z;B,n;B,ns;B,l;M,l;
+鼓:B,v;S,v;B,n;E,n;E,v;E,i;M,i;M,n;M,z;B,z;E,l;E,nr;M,ns;M,l;M,nr;B,l;E,z;B,ns;S,n;B,nz;B,i;E,nz;B,vn;B,nrt;B,a;
+尕:B,ns;M,nz;M,ns;
+憬:E,v;B,v;
+谵:B,n;B,v;
+扁:S,a;B,n;B,b;B,nr;B,z;E,nr;B,l;B,v;M,nr;M,z;M,n;
+胂:S,g;
+摅:S,g;
+凌:B,nr;B,t;B,v;B,a;S,nr;E,nr;M,nr;E,v;E,n;M,ns;B,ns;M,i;B,nz;E,ns;B,vn;E,vn;S,vg;B,n;M,l;B,nrfg;M,z;E,nz;E,z;M,nz;S,ng;B,nrt;M,nrfg;B,l;
+雎:E,nr;S,g;E,n;B,n;
+穑:S,x;E,n;E,nr;
+寐:S,vg;M,i;E,v;E,i;
+飒:B,z;E,z;M,i;B,l;B,d;M,nr;E,nr;E,a;
+拖:S,v;B,v;B,n;M,n;E,j;B,vn;M,l;E,l;B,nz;B,i;B,a;E,nr;B,z;M,z;E,v;M,nr;M,m;M,i;E,ns;B,l;B,m;E,nt;
+滞:E,v;B,v;S,vg;B,n;E,a;M,i;M,n;E,vn;E,n;B,vn;
+剡:S,v;B,ns;E,nr;
+饧:S,v;B,n;
+竦:S,g;E,nr;
+臬:S,nr;E,n;E,i;
+诰:B,n;B,vn;E,v;
+筻:S,g;
+哺:B,n;B,v;S,vg;B,l;E,i;E,v;B,vn;M,nr;
+搀:S,v;B,v;E,nr;
+莅:S,vg;B,v;
+栈:E,n;B,n;S,ng;E,nr;M,i;E,v;
+咋:S,r;B,r;B,v;M,z;B,z;
+鞍:S,ng;B,n;E,n;B,ns;M,ns;B,i;M,nr;M,n;E,nr;M,nrfg;M,nt;B,nz;B,nt;
+瘌:E,n;M,n;B,n;
+墓:S,n;B,n;E,n;E,v;M,n;E,j;E,vn;E,i;E,ns;
+稔:S,vg;E,a;E,nr;
+茚:S,g;B,nz;
+东:B,n;E,ns;B,f;B,ns;S,f;E,n;B,s;E,nr;B,nr;M,ns;B,t;M,nr;B,j;B,nz;E,f;M,nt;B,b;B,nt;M,n;B,v;B,i;E,nrt;M,nz;E,s;M,i;M,l;E,nz;M,f;B,l;B,nrt;E,nt;E,nrfg;B,vn;M,nrt;E,v;B,nrfg;E,l;B,jn;M,nrfg;M,j;
+疡:E,n;S,g;M,n;
+吠:S,vg;E,n;B,n;E,v;E,i;M,i;M,l;
+判:B,v;E,vn;E,v;S,v;B,vn;B,n;M,n;E,n;B,i;E,l;M,nr;E,nr;M,nz;
+芯:S,ng;B,n;E,n;S,q;E,nr;M,n;M,nr;E,m;E,nz;M,nz;
+鲻:S,g;
+徽:E,ns;M,ns;B,n;E,n;S,j;M,nr;E,nr;S,ng;E,nz;M,nt;B,ns;M,nrt;M,n;M,nrfg;
+社:B,n;E,n;S,n;E,nt;M,n;B,vn;B,l;M,nt;M,l;B,j;E,l;E,nr;B,nt;E,j;E,ns;E,v;E,r;M,nr;E,nrt;M,vn;M,j;M,ns;E,nz;B,ns;E,vn;M,v;B,b;M,nz;E,nrfg;B,nz;
+艄:B,n;
+滇:S,j;B,ns;B,nrt;B,j;B,n;E,nr;M,nr;B,nz;
+陌:B,a;B,n;S,ag;E,n;B,s;E,nr;B,v;M,nr;
+归:S,v;B,v;E,v;B,vn;B,n;M,i;E,i;M,n;B,nr;B,i;E,n;E,d;E,nr;B,l;E,l;M,nr;E,ns;B,ns;B,nrt;M,l;M,ns;B,nz;M,nt;E,vn;
+违:B,vn;B,v;S,vg;E,v;B,n;B,l;E,i;B,i;B,b;E,nr;B,j;E,j;M,i;M,nr;
+腮:S,n;B,n;M,l;E,i;M,nr;E,n;M,n;E,b;
+深:S,a;B,v;B,ns;B,a;B,n;B,j;B,s;E,n;B,d;E,d;B,nt;B,b;B,nz;E,a;B,i;B,t;E,v;E,b;E,nr;M,i;B,l;M,l;E,i;E,nrfg;M,nr;E,t;M,nz;E,l;M,d;M,n;E,nrt;B,z;M,z;E,nz;B,nrt;M,ns;
+轲:S,x;E,nr;M,nr;
+毵:S,x;
+镶:S,v;B,v;B,n;B,ns;E,nr;M,nr;E,v;B,nz;M,ns;
+燹:E,n;S,g;
+幼:B,n;E,d;S,ag;B,t;B,a;S,ng;E,n;B,nr;M,n;M,nr;E,j;B,ns;E,i;E,nr;E,l;B,l;M,l;B,b;B,j;E,a;M,i;E,v;M,j;B,i;
+饾:B,n;
+考:B,v;B,vn;E,v;S,v;B,n;M,n;E,l;E,vn;E,nr;M,nr;E,n;E,ns;B,nrt;M,ns;M,nz;E,j;B,nr;B,t;B,ns;M,i;M,l;B,a;B,j;M,nt;M,j;M,nrt;E,nrt;
+殊:E,a;S,d;M,n;B,n;B,v;E,nr;E,l;B,i;B,a;E,n;M,nr;E,i;M,l;M,v;B,d;B,l;M,nt;M,vn;M,nz;
+肘:S,ng;E,v;B,n;E,n;E,i;B,i;E,vn;M,i;
+氛:E,n;B,n;
+躜:S,g;
+樟:B,n;B,ns;E,n;E,ns;M,nz;
+钠:S,n;E,n;E,nz;B,nz;B,n;E,nr;M,nz;M,nr;
+瀣:M,i;E,n;
+垢:S,ng;E,n;M,i;E,i;E,v;E,nr;
+宪:B,n;E,nr;M,nr;E,j;M,n;S,nr;E,vn;E,n;M,nz;S,j;B,nrt;E,v;B,nt;S,ng;M,l;E,i;M,nrfg;B,ns;M,nrt;
+贱:S,a;B,n;E,a;E,n;E,v;B,v;E,l;B,i;M,nr;M,i;E,i;M,l;E,nr;
+鄹:S,g;
+炸:E,v;B,n;S,v;M,n;B,v;M,l;E,n;E,i;M,b;E,vn;E,nr;M,nr;
+尻:S,g;
+捅:S,v;B,v;B,l;
+跆:B,n;
+诊:B,v;E,v;S,vg;B,n;M,n;E,n;B,vn;E,j;M,l;E,vn;
+野:B,n;E,n;B,b;S,b;B,a;S,a;E,v;B,s;E,nr;E,ns;M,n;E,vn;E,i;B,nz;M,nt;M,nr;E,a;M,i;B,i;E,nrt;B,vn;B,nrt;E,nz;E,l;M,l;M,ns;E,j;B,v;B,nr;M,nz;B,l;B,an;B,ns;E,nrfg;
+嫔:E,nr;S,g;E,n;B,n;M,nr;
+旖:B,a;M,i;B,l;
+佝:B,n;B,v;
+啡:E,n;M,n;S,x;M,nz;E,nr;
+遣:S,vg;E,v;B,v;E,b;M,n;M,i;B,n;E,vn;B,l;B,i;
+矢:S,ng;B,n;E,nr;B,i;M,i;E,i;B,v;E,n;
+鹧:B,n;
+篪:E,nr;S,g;
+扯:S,v;E,v;B,v;M,l;E,l;E,i;M,i;B,vn;
+郸:E,ns;M,ns;B,ns;M,i;M,n;M,nt;
+类:E,n;S,q;B,n;E,r;E,m;B,v;E,vn;E,b;M,n;S,m;M,l;E,i;E,v;E,nr;E,nz;M,i;E,l;B,b;M,nr;B,l;M,nz;B,ns;M,nt;
+黼:S,g;B,i;
+穿:S,v;B,v;E,v;B,n;B,b;E,i;M,i;B,i;B,vn;M,n;E,a;B,l;M,l;E,l;B,nz;E,vn;E,nz;
+攀:B,v;S,v;B,ns;E,nr;M,nr;E,v;B,n;E,i;B,i;B,vn;M,l;B,l;B,nt;
+喋:B,i;M,i;B,v;M,n;
+隍:E,ns;M,ns;S,g;B,ns;
+鲑:B,n;E,n;
+妓:B,n;E,n;E,v;
+笔:B,n;S,q;E,n;E,m;E,r;E,v;B,z;S,m;E,d;M,n;M,i;B,v;M,nz;M,l;B,ns;E,nr;M,nr;E,i;B,l;E,nz;B,i;B,vn;E,l;B,nz;
+唠:B,v;S,v;M,z;B,z;B,vn;E,v;
+阢:S,x;
+渲:B,v;S,vg;E,nr;M,nr;
+琶:E,n;S,x;M,n;M,ns;M,l;
+砾:B,n;E,n;M,n;E,v;
+珏:E,nr;M,nr;S,g;
+偎:S,v;E,v;B,v;E,nr;E,l;B,i;M,i;
+魔:B,n;S,ng;E,n;M,i;E,nr;M,nr;E,v;B,b;M,v;E,l;B,i;B,l;B,nz;
+胙:S,g;
+潜:B,n;S,v;B,v;B,b;M,n;E,vn;E,nr;B,d;E,v;B,ns;B,t;B,vn;M,nr;B,i;M,nz;B,nz;M,i;B,l;M,nt;
+铡:S,v;B,n;
+忧:E,v;S,v;B,a;B,v;B,vn;B,n;M,i;E,n;B,i;E,i;E,nz;E,nr;E,l;S,ng;E,a;M,n;M,l;B,an;
+票:E,n;B,n;S,n;E,v;M,n;E,m;E,vn;S,m;E,l;E,i;M,l;E,nr;B,v;M,ns;M,nt;
+泱:B,i;M,i;E,z;B,z;M,nr;E,nr;
+蹲:S,v;B,v;B,n;B,l;
+烹:B,v;S,v;B,vn;B,n;M,nt;E,i;M,l;B,nz;M,i;E,nr;
+典:B,n;E,n;E,ns;E,b;S,ng;M,n;E,nr;B,a;B,v;M,nr;M,nt;M,i;M,nz;E,v;E,i;M,ns;B,vn;E,nz;
+绽:S,vg;B,v;E,n;E,i;E,nr;M,i;
+彼:B,r;S,r;M,ns;B,nrt;M,i;B,n;B,ns;B,t;E,i;M,l;M,nr;M,nrt;B,i;B,l;M,nz;E,nr;
+顾:E,v;B,nr;B,n;S,v;B,v;M,i;E,d;E,i;B,i;E,n;M,l;M,nt;B,b;B,l;E,l;M,nr;M,d;E,nr;B,nrfg;B,a;M,n;E,vn;M,j;B,ns;
+暂:B,d;S,d;B,v;E,a;B,b;B,n;M,nr;E,nr;B,vn;
+沆:B,i;B,n;
+锋:E,n;M,n;E,v;E,nr;S,nr;B,a;B,n;M,i;S,ng;M,l;M,nr;E,vn;B,i;M,nt;E,l;M,ns;E,nrfg;M,v;
+炎:E,n;S,ng;B,n;B,a;E,nr;M,nr;E,v;B,nrt;E,vn;E,nz;S,k;E,z;B,z;M,i;B,j;M,n;B,ns;B,nz;M,l;B,l;
+少:S,a;E,v;E,r;E,d;E,m;B,n;B,m;M,nr;M,n;B,v;E,a;B,a;E,l;B,l;M,m;E,i;E,n;M,l;B,nr;B,d;B,ns;E,nr;B,i;B,j;M,i;M,nt;B,nz;B,nrt;B,nt;B,b;M,ns;M,j;E,j;B,mq;B,nrfg;E,nrt;B,z;M,z;
+朗:E,nr;E,a;E,ns;S,nr;M,nr;M,ns;B,v;M,nrt;B,nrt;M,nz;E,n;E,z;B,z;M,vn;E,nrt;E,i;M,l;E,m;M,n;M,i;B,ns;E,nz;E,nrfg;B,a;B,i;S,ag;M,nt;B,n;B,vn;M,z;E,l;B,nz;
+膘:S,ng;B,i;E,v;B,n;
+洛:B,ns;M,ns;M,nr;S,j;E,nr;B,nr;B,nrt;M,nrt;B,n;E,ns;M,nz;M,n;B,nz;E,nrt;B,nt;M,nt;E,nz;B,i;
+辜:B,v;E,n;B,nr;S,nr;E,l;E,i;E,nr;M,n;
+缧:S,x;B,n;
+馨:E,nr;E,a;S,ng;E,n;B,n;M,nr;M,n;E,an;E,l;
+媪:S,g;E,nr;M,nr;
+谱:E,n;S,v;M,n;B,n;S,ng;E,nr;E,v;E,l;E,a;B,v;M,l;E,b;M,nr;E,nz;M,nz;M,a;E,vn;M,v;
+殴:B,v;S,vg;E,v;E,l;
+鸽:B,n;E,n;S,ng;E,nr;M,nz;E,nz;M,nr;B,nz;
+羼:S,g;
+摁:S,v;
+桉:B,n;B,nz;E,n;
+癍:S,n;
+郎:E,n;S,ng;E,nr;B,nr;B,n;M,n;M,nr;E,m;E,j;M,ns;M,i;M,l;E,nrt;E,l;E,ns;M,nrt;E,q;B,l;B,nt;E,nz;M,v;E,o;
+蝗:B,n;E,n;E,v;
+赛:E,vn;E,n;S,v;B,n;B,nz;M,nr;E,nr;B,nr;E,v;E,ns;B,v;S,vn;M,n;M,nz;B,t;E,nz;M,ns;M,nrt;B,nrt;E,j;B,i;B,ns;B,vn;M,i;M,l;E,nrt;B,l;
+拚:B,v;
+九:B,m;M,m;S,m;M,nr;B,ns;E,m;B,t;B,n;B,nz;E,nr;B,j;M,i;B,nr;E,t;B,i;M,nz;B,nt;E,n;E,l;B,s;M,n;B,b;M,l;M,mq;M,ns;M,nt;E,j;B,l;E,nz;M,q;M,t;E,b;B,nrt;M,nrfg;
+酣:S,ag;B,v;B,a;E,z;B,i;B,d;M,i;B,n;E,nr;M,nr;
+剥:B,v;S,v;B,n;E,v;E,vn;B,vn;E,i;E,nr;M,i;M,l;B,o;B,nz;
+敫:S,g;
+仲:M,nr;B,v;E,nr;B,nr;S,nr;B,vn;E,n;B,n;B,t;B,ns;M,nz;M,i;B,j;M,nt;B,nrt;M,nrfg;
+说:S,v;B,v;E,v;E,n;E,u;E,l;E,c;B,n;B,l;M,i;E,nrfg;M,l;E,i;M,n;M,v;B,i;E,d;E,a;E,vn;M,c;B,vn;E,nr;B,b;M,nt;M,nr;
+勺:S,q;E,n;B,n;E,nr;E,m;S,ng;M,nr;S,m;E,v;B,nrt;E,nz;M,n;
+昀:E,nr;S,g;M,nr;
+怄:S,v;B,v;
+馕:S,g;E,nr;
+研:B,vn;B,n;B,v;B,j;E,n;S,v;E,vn;M,nt;E,v;M,n;M,j;E,j;E,nr;B,nz;B,s;M,nr;M,nz;M,ns;B,b;
+脚:S,n;B,n;E,n;B,f;E,v;E,mq;E,i;M,n;M,i;E,ns;B,v;E,l;M,f;B,i;E,z;M,s;E,a;E,nr;M,l;E,d;M,nr;B,b;E,b;M,d;
+涝:E,n;S,v;E,v;B,n;M,l;E,vn;M,nr;
+锢:S,g;E,v;E,n;B,n;E,vn;
+箩:S,ng;B,n;E,n;E,nr;M,nr;
+肯:B,v;E,v;S,v;B,ns;E,nr;E,d;B,nr;M,nr;B,n;M,ns;B,nrt;B,a;E,a;E,nrt;B,nz;B,nt;E,nz;E,n;M,nrt;E,vn;E,c;E,ns;M,nt;M,nz;
+洲:E,ns;E,n;M,n;M,nt;S,ng;E,nr;M,ns;S,q;E,j;B,b;E,nz;M,nz;M,nr;B,n;M,b;E,nrt;
+钷:S,g;
+眶:E,n;S,ng;E,l;M,i;E,v;
+麻:B,n;E,n;S,n;B,nr;B,an;B,v;B,a;M,n;M,nr;M,z;E,z;E,nr;E,v;B,i;E,i;M,l;B,vn;B,z;S,v;B,ns;B,nt;E,a;E,l;B,b;E,j;M,nt;M,i;M,ns;E,nz;M,v;B,nrt;E,ns;B,nz;M,nz;
+笾:S,g;
+但:S,c;B,c;E,c;B,nr;B,v;B,d;B,nrt;M,ns;B,n;B,i;B,l;
+詈:S,g;
+华:B,ns;S,j;E,nz;B,nz;B,n;E,nr;B,nr;M,ns;M,n;M,nt;E,a;E,v;M,nr;E,n;B,nt;B,a;E,j;E,ns;M,nz;E,nrfg;E,vn;M,i;B,nrt;B,j;E,i;E,nrt;B,nrfg;M,m;B,b;E,nt;E,l;B,i;M,nrfg;B,l;B,q;M,nrt;M,l;M,t;B,m;E,z;
+托:E,v;S,v;E,n;B,v;M,n;B,nr;B,n;E,nr;M,nr;B,nrt;E,nrt;M,ns;E,vn;M,v;E,ns;M,nz;M,nrt;B,ns;B,vn;E,b;M,nt;M,i;B,nz;E,nz;E,j;B,l;B,j;
+距:B,n;S,p;E,n;E,v;M,n;M,nz;M,d;E,nz;M,l;E,vn;
+汜:S,g;E,nr;M,nr;B,ns;
+旭:E,nr;M,nr;S,nr;M,nrfg;B,nrt;B,n;B,l;B,ns;E,nrfg;B,i;B,nr;
+买:S,v;B,v;E,v;B,n;M,n;M,ns;E,ns;B,vn;M,i;M,l;M,nr;B,nr;E,vn;B,l;M,nrt;B,nrt;E,l;B,i;B,b;M,nt;M,nz;
+靶:S,p;B,n;S,q;E,n;E,v;S,ng;E,vn;M,n;E,nr;B,nz;
+谇:S,g;
+阋:S,g;M,i;E,nr;B,v;M,l;
+透:B,v;S,v;B,a;E,v;B,n;M,n;E,nz;E,a;E,i;B,z;B,l;E,j;M,l;B,b;B,vn;E,vn;M,nz;B,nz;E,l;M,nr;E,n;M,i;M,z;B,nrt;E,z;
+玎:S,x;
+弑:S,vg;B,v;
+夕:E,f;B,n;S,tg;E,t;E,i;E,n;M,i;M,ns;E,nr;M,nt;B,l;M,t;M,nr;E,l;M,n;B,ns;B,nz;B,i;
+芘:E,n;S,x;
+簧:E,n;S,n;M,n;B,n;E,i;E,nz;E,nr;
+骨:B,n;S,ng;E,n;M,n;B,v;E,i;M,i;E,v;E,nr;E,z;M,nr;M,l;E,a;B,nz;B,i;E,l;M,d;B,l;M,nz;B,z;M,ns;M,v;M,nt;B,o;
+妪:E,n;S,g;
+撬:S,v;B,v;B,n;
+犸:M,n;E,n;S,x;
+帻:S,g;E,nr;
+粼:B,z;E,z;M,l;E,l;
+歉:E,v;E,a;S,ng;B,n;B,a;S,ag;E,l;B,vn;B,v;
+觊:B,v;
+哌:B,n;M,n;M,nz;E,n;B,nz;
+网:B,n;E,n;S,n;B,s;E,v;E,nz;M,n;B,v;M,i;E,i;E,nr;M,nt;M,l;B,nz;E,nt;B,i;B,nt;M,nr;B,j;M,v;E,vn;B,l;B,ns;B,b;M,nz;E,j;E,l;
+著:B,a;S,v;B,n;E,a;E,n;B,v;E,v;E,nr;B,i;M,n;E,i;M,nr;E,nz;
+坡:E,n;S,n;E,ns;B,n;E,nr;E,v;M,n;M,ns;M,l;M,nt;E,nz;E,nrt;B,ns;E,nrfg;B,s;E,vn;
+痢:B,n;M,n;E,n;
+入:E,v;E,n;S,v;B,v;B,n;M,i;M,n;B,ns;E,nr;E,i;M,l;E,vn;E,l;M,j;M,nr;B,nrt;B,i;B,a;E,j;B,vn;M,nz;B,l;M,b;M,nt;B,j;M,v;
+翦:S,nr;E,nr;B,nrfg;
+孩:B,n;E,n;M,n;M,nz;S,ng;M,nr;E,nr;M,v;
+蓬:B,a;S,v;B,nr;B,ns;E,ns;E,nr;B,ad;B,i;M,z;E,z;M,i;E,n;M,nr;B,l;S,q;B,z;M,n;B,n;M,ns;E,nz;S,nr;B,nrt;M,l;
+息:E,n;E,v;S,n;M,n;E,b;E,nr;B,n;M,v;E,i;M,i;M,vn;E,l;B,i;B,v;M,nz;M,nt;E,a;E,vn;E,nz;M,l;M,t;M,nr;B,ns;E,t;E,nt;S,ng;S,vg;
+裴:B,nr;S,nr;M,nr;E,nr;B,nrfg;
+瑷:S,x;M,nr;E,nr;
+出:B,v;E,v;S,v;B,vn;B,n;E,a;E,n;B,a;E,m;B,i;M,vn;M,i;E,i;M,n;M,nt;E,vn;B,l;M,l;M,v;B,j;B,vq;B,m;E,l;M,m;M,a;B,b;M,j;S,m;M,nr;E,nr;B,nz;B,nrt;M,nz;E,b;
+蚁:E,n;S,ng;B,n;M,n;E,l;M,i;M,ns;M,l;
+最:S,d;B,a;B,d;B,f;B,t;B,n;B,z;B,b;B,v;B,nt;B,l;E,d;M,nt;B,s;E,nr;M,nr;B,j;
+誉:E,n;B,v;S,ng;E,v;M,n;E,nr;E,vn;E,l;E,i;S,vg;M,i;E,nz;M,nr;B,n;E,a;B,l;
+型:E,n;S,k;E,b;E,vn;B,n;E,v;M,n;E,nz;E,r;M,v;E,nr;M,l;M,ns;E,j;M,nr;M,nz;M,vn;M,nt;
+钍:S,ng;E,nr;
+宓:S,nr;B,nr;E,nr;M,nr;
+蘖:E,n;S,ng;E,v;E,l;
+鸦:B,n;B,nz;E,n;B,i;M,nz;E,v;M,l;M,ns;B,ns;
+螫:S,v;B,n;
+戮:E,v;E,vn;B,i;M,i;
+讳:E,v;S,vg;E,i;B,v;B,i;M,i;E,vn;E,l;E,nr;M,nr;
+氲:S,x;E,n;M,nr;E,v;E,nr;
+岽:S,g;E,nr;
+淇:S,g;E,nr;M,n;B,ns;M,nr;B,nz;M,nz;
+镌:S,vg;B,v;M,nr;E,nr;
+齐:S,a;B,nr;E,d;S,d;B,a;E,a;B,v;E,nr;E,t;E,ns;B,n;M,ns;B,nz;B,d;M,nr;M,i;E,v;B,ns;M,nrfg;M,z;E,z;B,i;E,i;B,z;E,nrt;B,l;M,l;B,nrfg;B,b;B,ad;M,nt;B,nrt;S,v;M,nrt;E,l;B,nt;M,v;E,m;
+篓:E,n;B,n;S,q;S,ng;E,m;M,n;
+饔:S,g;E,nr;
+浜:E,ns;E,n;B,nz;
+口:E,n;E,vn;S,q;B,n;E,m;E,s;M,n;E,ns;E,v;M,i;B,s;B,v;M,ns;M,nt;E,nr;E,d;E,a;B,vn;E,i;E,l;B,i;M,b;M,nr;M,l;E,nrt;B,ns;S,m;B,l;M,nz;M,mq;E,j;M,v;M,d;E,mq;E,ad;E,nz;M,r;E,b;M,j;B,d;M,a;B,b;B,a;
+煤:B,n;S,n;E,n;B,j;E,v;E,j;M,n;B,nz;M,nz;E,vn;M,nt;B,v;E,nr;B,nt;E,nz;B,ns;
+巧:E,n;E,a;B,nr;S,a;B,a;E,d;B,v;B,n;E,nr;S,ad;M,i;B,i;M,nr;E,i;M,n;E,v;M,l;M,nrfg;B,nrt;E,ad;B,vn;
+艮:S,g;M,nz;E,n;E,nr;M,nr;
+佰:M,nr;E,nr;S,m;M,m;B,m;E,m;M,nz;
+棵:E,m;S,q;M,ns;S,m;B,n;E,nr;M,nr;M,l;
+陶:B,n;B,nr;S,nr;B,v;M,nr;E,n;M,ns;E,nr;E,v;E,vn;E,nrt;M,l;B,ns;M,nz;B,nrfg;E,ns;B,nz;M,n;M,i;S,ag;E,nz;B,vn;B,l;S,vg;S,nt;B,nrt;
+卸:S,v;B,v;E,v;E,vn;M,n;M,nr;E,nz;B,nz;B,i;M,i;M,j;
+驾:B,v;S,v;B,n;E,v;E,m;E,n;E,nr;B,nz;B,j;M,i;M,nr;B,i;S,q;S,m;B,l;E,vn;
+范:B,n;E,v;B,nr;E,n;M,n;E,vn;S,nr;E,nr;M,nt;M,vn;B,nrfg;M,nr;B,ns;E,l;S,ng;M,b;E,nt;M,ns;M,l;B,nz;B,nrt;
+撂:S,v;B,v;E,nr;
+溆:S,g;B,ns;M,nr;E,nr;
+名:B,n;E,v;S,q;E,m;E,n;E,a;S,m;B,v;M,i;M,n;B,i;M,nr;M,l;E,i;B,a;B,l;E,l;E,nr;E,vn;E,ns;B,ns;M,ns;B,j;E,b;E,d;B,nz;E,vd;B,nr;E,nz;M,a;M,t;B,nrt;E,nrfg;
+帑:S,g;E,n;
+鬓:S,ng;B,n;E,n;M,i;E,nr;M,l;E,i;
+粒:B,n;E,n;S,q;E,m;M,n;S,m;M,nz;M,l;E,v;E,nr;M,nr;B,l;B,nz;E,ns;M,v;E,nz;
+堕:B,v;S,v;M,i;E,nr;
+莘:S,nr;B,nr;E,nr;B,n;M,n;B,ns;M,nr;
+椟:S,g;
+鞠:B,v;S,nr;S,vg;B,nr;B,i;B,n;E,n;M,nr;E,nr;B,nrfg;
+紧:B,a;E,d;S,a;E,v;B,d;B,v;S,d;B,ad;E,a;B,vn;B,c;B,n;M,l;E,l;B,l;B,i;B,b;E,n;E,nz;B,z;M,nz;E,nr;M,n;M,nr;M,z;M,i;B,nz;M,nt;
+度:E,n;E,mq;E,d;E,ns;S,q;E,a;E,m;M,ns;M,n;B,v;E,l;S,m;E,v;M,nz;E,vn;B,n;E,nr;E,i;E,b;M,nt;M,i;M,v;M,nr;E,nz;B,vn;M,l;B,i;E,t;E,nrt;E,q;E,j;M,vn;B,l;M,m;
+踱:S,v;B,v;
+榴:B,n;M,n;E,n;E,nr;
+唷:S,x;E,nr;E,o;
+晁:B,nr;S,nr;E,nr;M,nr;
+嗌:S,g;
+忐:B,i;B,a;
+硕:B,n;S,ag;E,nr;E,a;M,nr;B,a;E,nrt;B,i;B,l;M,ns;
+委:B,n;E,n;M,nt;B,v;S,j;M,n;E,j;E,nt;M,j;E,nr;B,ns;B,a;B,vn;M,l;B,j;B,d;B,i;S,vg;M,nr;M,i;B,ad;E,v;B,l;S,ng;E,nz;B,nt;M,b;M,nz;E,nrfg;
+惚:E,a;E,i;M,z;E,z;S,x;E,ad;
+襟:E,n;S,n;M,i;B,n;E,b;B,i;E,nr;E,l;M,nr;
+瓢:S,n;E,m;B,n;B,i;E,n;M,l;B,v;E,i;E,nr;S,q;E,l;
+健:B,a;E,a;B,v;E,nr;S,nr;E,n;S,v;B,n;E,ad;M,n;M,nr;B,vn;E,v;M,l;B,nz;M,nz;E,nz;M,i;E,nrfg;B,z;M,z;B,l;B,ns;B,d;M,nt;B,nt;M,b;
+绦:B,n;M,n;
+述:E,b;E,v;E,vn;S,vg;E,n;E,c;B,v;E,nr;M,n;M,nr;E,l;B,n;B,i;M,nrfg;B,b;
+要:S,v;E,b;E,a;E,v;B,v;E,d;E,c;B,n;E,df;B,c;M,n;E,n;B,a;M,l;E,l;M,i;M,a;B,l;M,nr;E,ad;E,ns;B,i;M,ns;B,vn;M,j;E,i;E,nr;
+栀:B,n;S,ng;M,nr;
+辅:E,n;B,vn;B,v;S,vg;B,n;S,ng;E,nr;E,v;M,nr;B,nz;M,i;M,nz;M,l;M,n;E,ns;E,j;
+序:E,n;B,n;S,n;E,a;E,l;E,v;M,n;M,l;M,i;M,v;E,vn;E,nr;E,i;M,nr;B,d;M,b;E,nrfg;M,nz;
+醑:S,g;
+堠:S,g;
+吨:E,m;S,q;S,m;M,n;B,b;B,n;M,b;E,q;M,m;E,n;B,q;B,j;
+被:S,p;B,n;E,n;B,d;B,v;B,a;B,vn;B,b;B,l;B,j;M,nr;E,nz;M,i;E,v;M,j;E,ns;
+霪:B,n;S,x;
+躯:B,n;E,n;S,ng;E,l;E,v;E,i;
+洮:B,ns;E,ns;B,n;M,ns;
+挲:E,v;S,x;
+骷:B,n;
+邻:B,n;S,v;E,v;B,v;E,n;E,nr;M,i;B,nz;M,l;M,nr;M,n;E,l;E,i;E,vn;B,vn;B,ns;
+缺:B,v;B,n;S,v;E,v;E,a;B,vn;E,l;M,n;E,n;M,i;B,i;E,i;B,a;B,l;E,nr;M,l;M,nz;E,vn;
+甾:S,g;B,n;M,n;M,nz;
+血:B,n;S,n;E,v;M,n;E,n;B,l;E,vn;M,i;B,z;B,a;B,i;M,l;E,i;M,nz;B,v;E,b;E,l;B,j;E,nr;E,nz;B,nz;M,nr;B,b;M,nt;E,j;
+蹄:M,n;E,n;B,n;S,ng;E,i;E,b;M,nz;E,l;E,nr;M,ns;B,nz;
+拇:M,n;B,n;
+磋:B,vn;E,v;E,i;M,i;
+经:B,n;E,d;S,p;B,p;E,n;B,vn;M,n;B,v;B,d;E,v;M,l;E,b;B,l;M,i;E,l;M,nt;B,j;M,nr;M,nz;B,nr;E,a;E,j;E,nr;E,nz;E,i;B,i;M,a;B,nt;E,vn;M,ns;M,j;B,ns;M,b;B,a;E,ad;M,t;M,ad;M,nrfg;E,ns;B,nz;E,z;B,nrfg;M,v;
+遐:B,v;M,i;M,l;B,vn;S,ag;B,n;B,i;E,nr;M,nr;
+卒:S,ng;E,n;S,vg;E,nr;E,i;E,a;B,n;M,i;M,nr;E,v;S,dg;B,v;
+陔:S,g;
+菝:S,x;B,n;
+闩:E,n;S,n;S,v;E,nr;
+饶:S,v;B,v;B,nr;E,a;E,v;E,ns;B,l;E,nr;E,i;M,ns;M,l;M,nr;B,ns;M,n;S,nr;B,i;
+调:B,vn;E,v;B,v;S,v;E,n;B,n;M,n;B,a;M,nr;E,a;M,l;B,nz;E,vn;E,l;E,nz;M,i;B,i;E,nr;M,v;E,i;B,ns;E,j;M,nt;M,nz;M,j;B,j;B,l;
+殂:S,g;
+樗:S,g;M,nr;B,n;
+貘:S,g;
+怛:S,g;E,nr;
+芜:B,ns;E,a;E,ns;E,nrfg;B,a;M,ns;B,n;E,n;M,nz;M,nt;M,n;
+星:E,n;B,n;S,n;E,nr;E,nz;B,t;M,n;M,nr;M,b;E,a;B,nz;B,i;B,nr;M,i;E,d;M,ns;M,nt;B,b;M,l;E,v;B,v;B,ns;E,l;E,i;E,b;B,l;E,mq;M,t;M,z;E,z;M,nz;E,ns;E,j;M,m;E,m;M,nrfg;B,nrt;E,nt;M,mq;E,nrfg;
+颠:B,v;S,v;E,ns;B,i;B,vn;M,i;B,n;M,z;E,z;B,a;S,a;E,i;E,l;B,z;E,s;E,v;E,nr;B,l;M,v;
+客:B,n;E,n;S,ng;E,nr;E,v;B,a;M,n;E,j;B,v;E,i;M,nr;B,j;E,nrt;M,l;B,z;M,z;E,a;E,vn;E,l;M,i;M,nt;M,j;E,nz;B,l;M,nz;B,nz;M,ns;
+钨:S,n;B,n;M,n;E,n;E,nz;B,nz;M,nz;
+檬:E,n;S,x;M,n;M,nz;E,nr;
+脱:B,v;E,v;S,v;B,i;B,n;B,vn;E,a;M,ns;E,nr;M,i;E,nrt;B,nr;M,nr;M,z;E,z;B,l;E,q;E,l;M,n;M,nz;B,nz;E,vn;M,v;M,nt;M,l;E,nz;
+暴:B,v;B,n;E,n;E,a;S,n;B,nr;B,a;B,vn;M,i;M,l;B,i;M,n;E,v;B,l;S,a;E,nr;E,i;M,nr;E,ad;S,ad;
+嘿:E,o;B,o;S,e;
+诂:E,n;S,g;
+仄:E,n;E,z;B,n;
+臆:B,v;E,n;E,i;S,ng;M,l;B,vn;B,n;E,nr;
+敉:S,g;M,nr;
+蟊:S,g;B,n;
+嫌:S,v;B,n;E,v;B,v;E,n;E,a;E,l;E,nr;B,i;M,nr;
+囔:E,v;E,z;M,z;B,v;
+桫:B,n;
+胰:B,n;S,ng;B,l;M,n;E,j;
+蛴:S,x;B,n;
+穷:S,a;B,n;E,d;E,i;B,i;B,a;E,a;E,z;M,i;E,an;B,v;M,n;M,z;E,l;E,v;B,l;E,nr;E,j;B,nz;M,l;M,nr;
+嗾:S,g;
+袁:B,nr;S,nr;M,nr;E,nr;B,nrfg;B,ns;B,n;
+躅:E,v;S,x;E,n;
+蒉:S,nr;
+邑:S,ng;E,nr;E,n;E,ns;M,nr;M,ns;E,i;E,nrfg;E,r;E,nrt;
+焐:S,v;
+蠖:S,x;E,n;M,n;
+沙:B,n;B,nr;S,n;E,n;E,ns;M,ns;B,ns;E,nr;M,n;B,nz;M,nr;E,nz;B,nrt;B,v;B,a;E,v;M,i;E,i;E,nrt;E,l;M,nt;M,nrt;M,nz;B,nt;M,l;E,vn;E,o;B,o;B,vn;B,i;
+碡:E,n;S,x;
+纥:E,nz;S,x;E,nr;M,nr;
+逦:E,z;S,x;E,nr;
+璩:E,nr;S,nr;B,nr;M,nr;
+阪:E,ns;E,nr;B,ns;M,ns;M,nt;
+氮:S,n;B,n;E,n;M,n;E,nz;B,v;E,nrt;B,nz;M,nz;
+蕈:S,g;E,n;
+秋:E,n;M,nr;S,tg;B,t;E,nr;B,n;B,nr;E,t;M,t;B,v;M,nrfg;M,i;B,i;B,nz;B,l;E,i;M,l;M,n;M,j;E,v;M,v;B,nrt;E,l;E,z;B,ns;B,b;M,nz;M,ns;
+屎:S,n;E,v;E,n;B,n;M,n;
+酐:E,n;E,nz;S,g;M,n;
+祠:S,ng;B,n;E,nr;E,ns;E,n;M,nr;
+黥:S,g;
+铩:S,g;B,i;B,v;
+色:E,n;B,n;S,ng;M,n;E,b;E,v;E,i;E,a;M,ns;E,l;M,i;E,nr;M,l;E,r;E,mq;M,nr;B,ns;E,ns;E,vn;B,i;M,nz;M,nt;B,nrt;M,v;B,b;E,d;B,nz;E,nz;B,v;E,z;
+顶:S,v;E,n;B,n;B,f;B,v;E,m;M,ns;B,d;E,v;M,n;E,nr;B,i;E,ns;M,i;E,z;B,a;E,b;M,nr;E,vn;E,i;B,b;S,m;B,l;E,s;B,nz;M,l;E,l;B,z;B,ns;M,nt;E,d;E,a;
+茇:S,g;
+锓:S,g;E,nr;
+犒:B,v;B,n;
+亚:E,ns;B,ns;S,j;B,n;E,nr;M,nr;M,ns;B,nr;E,nz;E,nrt;B,nrt;M,nt;M,n;B,j;M,nz;B,nt;B,nz;M,v;M,nrt;E,n;E,j;M,j;M,nrfg;E,nrfg;
+莜:B,n;
+期:E,n;E,f;E,vn;E,t;B,n;E,d;E,b;B,f;S,q;E,v;B,v;E,j;E,m;M,n;M,l;M,t;E,r;S,m;B,t;M,nt;E,nr;B,j;M,i;E,nz;M,v;E,i;B,b;B,vn;M,nz;M,nr;B,i;E,mq;
+伯:M,nr;B,nr;E,ns;E,nr;M,ns;B,n;E,n;S,nr;M,n;M,nz;B,ns;S,ng;M,nrt;B,nrt;E,nz;M,nt;E,nrt;M,nrfg;E,nrfg;B,nt;B,i;B,nz;
+耱:E,v;S,g;
+嬷:B,n;E,n;E,nr;M,nr;
+桁:B,n;B,b;
+俄:B,ns;S,j;M,ns;E,ns;B,n;B,j;B,nt;B,nz;E,j;B,d;B,b;M,nt;M,nr;M,n;E,nrt;
+胆:B,n;E,ad;S,n;B,a;E,n;E,i;B,i;M,i;B,v;E,v;E,nr;M,l;E,d;M,n;M,nr;B,l;B,nz;B,z;M,j;
+蛊:B,i;B,v;B,vn;
+富:E,a;E,n;B,n;S,a;B,v;B,a;B,nr;M,ns;M,nr;E,nr;E,nz;E,v;M,i;B,ns;B,nz;B,i;M,n;E,l;B,nrt;B,nt;M,l;E,nrt;B,vn;B,l;B,nrfg;E,ns;M,nz;E,i;M,nt;M,nrfg;M,v;B,b;M,vn;E,nrfg;M,nrt;
+鳎:S,g;E,n;
+埔:M,ns;E,ns;M,nt;S,g;M,nr;E,nr;B,ns;M,n;M,nz;
+滚:S,v;B,v;B,z;E,z;B,n;E,v;M,i;B,l;M,l;E,n;B,vn;M,n;B,b;B,nz;M,z;E,l;B,i;M,nr;E,nr;
+擞:S,x;E,i;M,i;E,v;
+烦:B,a;S,v;E,an;E,a;E,v;E,l;M,i;B,an;E,i;B,v;B,n;E,nr;M,n;M,l;M,nr;B,vn;S,a;E,ns;M,ns;
+楫:E,n;S,ng;E,nr;M,nr;
+诬:B,v;S,vg;B,vn;B,n;E,v;M,i;
+筷:B,n;E,n;S,ng;M,n;
+壶:E,n;S,q;S,ng;B,ns;E,nr;B,n;E,v;M,i;M,ns;
+建:B,v;B,n;B,vn;E,v;S,v;E,a;M,nr;E,ns;B,j;M,l;M,n;B,nz;E,j;B,nt;E,nr;M,nt;E,n;M,ns;B,ns;B,nrt;M,nz;B,t;B,nr;E,nz;M,nrfg;E,b;B,b;B,nrfg;B,i;E,nrt;E,nrfg;M,j;E,vn;B,l;M,i;E,l;M,t;
+睿:B,a;E,nrfg;B,nrt;M,nrt;M,l;
+超:B,v;S,v;B,n;E,nr;B,b;M,nr;B,a;E,a;E,v;B,h;B,nz;B,s;B,l;B,j;B,d;B,vn;B,i;E,j;E,nrfg;B,ns;M,ns;B,z;B,vd;B,nt;B,ad;E,vn;B,nr;M,i;
+馍:E,n;B,n;E,v;E,nz;
+砌:S,v;E,v;B,v;E,b;B,n;E,l;
+嚓:E,o;S,o;M,o;
+丘:B,n;E,n;B,nr;E,ns;S,nr;E,nr;M,n;S,q;M,nr;M,ns;S,ng;E,nrt;B,ns;M,i;M,nt;M,nz;E,nz;B,nrt;E,i;B,nz;B,s;M,nrt;
+憝:S,g;
+蜞:S,x;
+管:B,vn;E,c;S,v;E,n;B,n;E,vn;E,v;B,v;M,n;M,nt;B,nr;M,l;E,j;M,j;B,ns;E,nr;M,nr;B,j;B,f;E,nz;B,nz;E,l;B,l;M,nz;M,i;E,i;B,nrt;B,i;M,a;B,nrfg;E,b;E,d;
+娠:E,v;M,t;E,vn;S,g;
+尤:B,d;S,d;B,nr;M,nr;E,n;E,nr;B,nrt;B,ns;B,n;M,i;E,i;B,nz;E,v;B,nrfg;M,n;M,l;E,nrt;B,j;M,ns;M,nrt;
+瞩:B,v;M,i;M,l;E,i;
+锪:S,v;
+冽:E,a;E,nr;S,g;
+钿:S,g;E,nr;E,n;M,nr;
+立:E,v;B,d;S,v;B,v;B,n;M,m;M,nr;B,vn;E,nr;M,n;B,q;E,b;M,i;B,b;B,nr;B,j;B,ns;B,i;B,t;E,i;B,m;M,ns;E,nz;E,vn;B,nz;B,nrt;B,l;M,nt;M,vn;M,l;M,b;E,l;E,nrt;M,nrfg;E,n;E,nrfg;M,nz;E,a;B,nrfg;E,nt;M,v;
+这:B,r;S,r;B,mq;B,rz;B,l;B,d;B,c;M,l;B,n;B,nz;B,i;B,t;
+湘:S,j;B,ns;B,j;M,nr;E,nr;E,ns;B,n;B,nt;B,nz;E,j;M,nz;M,ns;M,nt;
+僧:E,nr;S,n;B,n;E,n;M,nr;E,nz;B,j;E,nrt;B,i;B,nr;S,ng;M,l;B,nz;M,n;M,i;
+韩:B,nr;S,j;B,ns;E,nr;B,nrfg;B,nt;B,nz;M,nr;B,n;E,ns;B,nrt;M,m;M,ns;E,n;M,nt;B,m;S,nr;
+槭:S,g;
+轮:S,q;B,n;E,n;E,m;B,v;M,n;E,r;B,d;B,b;S,m;E,nz;B,vn;E,j;M,nt;M,l;B,ns;M,nz;E,nt;E,nr;M,i;E,b;M,b;M,nr;E,nrfg;B,nz;
+幸:B,a;E,n;B,d;E,a;B,nr;S,ng;B,v;E,v;S,vg;B,n;E,nr;B,i;E,d;E,ad;M,nr;B,l;S,dg;E,i;M,i;E,vn;M,n;B,ns;M,l;
+概:B,n;E,d;B,v;S,d;E,n;M,i;M,l;B,l;S,ng;B,i;E,nr;B,c;B,j;
+复:B,v;E,v;B,a;E,d;S,d;B,n;S,c;M,nr;B,vn;M,l;E,nr;M,i;E,vn;S,b;M,n;S,dg;B,b;S,nr;B,nt;B,nz;E,vd;E,i;E,n;M,nt;B,l;E,l;E,a;E,nrt;B,t;M,t;M,b;B,ns;M,nz;B,j;M,v;E,nrfg;S,vg;
+美:B,ns;S,j;B,q;M,m;B,n;B,m;B,nt;E,a;B,a;B,j;M,ns;B,nz;E,ns;M,nr;B,nr;E,nr;E,nz;E,vn;E,n;E,v;B,v;E,j;M,nt;M,l;M,n;B,b;B,vn;M,j;M,nz;E,i;M,i;B,i;B,l;B,nrt;E,nrt;E,d;B,d;B,z;E,l;E,nt;E,nrfg;M,nrfg;E,z;M,z;B,an;
+栗:E,n;B,nr;B,n;E,v;E,nr;S,nr;E,i;S,ng;M,nr;M,ns;E,ns;M,n;E,vn;M,i;B,i;
+戛:B,ns;B,i;M,n;
+肜:S,g;E,nr;
+骠:B,n;S,x;M,n;E,nr;
+鲤:S,ng;B,n;B,nz;E,nr;E,n;B,i;M,nr;M,ns;B,ns;
+厦:B,ns;E,n;S,j;B,nt;E,ns;E,i;E,nt;M,nz;B,nz;E,nr;M,nr;M,i;B,n;S,ng;E,nz;B,j;
+茱:M,n;B,n;
+鼹:B,n;E,n;
+纸:E,n;S,n;B,n;E,v;M,n;E,m;E,nz;E,vn;M,i;M,nz;B,i;M,v;B,nz;B,l;S,m;M,l;E,l;
+刻:E,d;E,n;E,m;E,a;S,v;E,r;B,v;B,n;E,v;E,i;B,d;M,t;B,a;B,i;M,m;M,n;B,ad;E,l;M,l;M,i;M,mq;E,nr;E,t;B,vn;E,vn;B,nrt;B,q;
+炼:E,v;B,v;S,v;B,n;B,vn;M,n;E,nr;E,a;E,vn;E,i;B,j;E,nz;M,nr;M,i;M,nz;B,nz;M,nt;B,i;E,l;
+观:E,n;B,n;B,v;E,a;S,vg;B,vn;E,v;M,n;E,nr;E,l;E,nz;M,i;E,vn;M,nr;M,ns;B,nr;E,i;B,ns;M,l;B,l;E,ns;B,nz;B,i;E,j;M,nz;E,ad;M,nt;B,nrt;
+浅:S,a;B,n;B,b;B,a;E,n;E,a;E,v;M,z;B,nr;B,z;E,i;E,l;E,nr;M,l;B,v;M,i;M,nr;B,nrt;B,ns;E,z;B,vn;B,i;M,nrfg;
+杉:E,n;S,ng;E,nr;M,ns;B,n;E,nz;B,nz;M,n;B,nr;M,nt;B,nt;M,nr;B,ns;B,nrt;E,nrt;
+勐:S,g;B,ns;E,nr;B,nrt;M,nr;
+哔:B,n;
+街:S,n;B,n;B,s;E,n;E,ns;E,v;M,i;E,s;E,nr;M,nz;E,f;M,l;B,nz;M,n;M,ns;B,i;M,nr;B,j;B,vn;B,ns;E,vn;
+毖:S,g;M,i;
+余:B,m;S,m;E,r;M,m;M,l;E,m;B,n;B,nr;E,n;E,v;M,n;E,a;E,b;B,ns;E,vn;B,v;M,i;E,i;B,nrfg;E,nr;E,ns;B,r;M,nr;E,l;M,ns;B,nrt;M,nz;E,t;M,nt;B,l;B,i;B,vn;
+柞:B,n;B,ns;
+鹣:S,g;
+坩:B,n;
+痪:E,v;S,x;
+修:B,v;S,v;E,v;B,n;E,vn;B,nr;E,nr;B,vn;M,nr;M,n;B,ns;B,a;E,nrfg;M,nz;E,j;E,l;E,nrt;M,i;B,l;B,nrt;M,ns;M,v;B,i;M,j;B,nz;M,l;E,n;
+硷:S,n;S,v;
+侃:E,v;S,v;E,nr;B,i;M,i;E,d;M,nr;B,d;B,l;B,v;M,nrfg;
+貅:E,n;S,x;
+洄:B,v;S,g;M,l;M,nr;
+月:S,m;S,n;B,n;E,t;E,m;E,n;B,t;E,r;B,j;M,t;M,nr;S,q;M,n;E,v;M,nz;E,nr;E,d;M,i;E,i;E,nz;M,ns;M,v;B,nr;B,i;E,l;B,ns;M,mq;B,nz;E,nrfg;M,l;E,nrt;E,mq;M,nt;E,vn;B,l;E,ns;
+宋:B,nr;S,nr;E,t;B,t;E,nr;M,nr;B,n;S,q;B,nrfg;S,tg;B,ns;E,b;B,nrt;B,nt;M,n;M,ns;B,l;
+颍:S,g;B,ns;B,nz;M,nr;E,nrt;E,nr;M,ns;
+垓:S,g;M,nr;
+钕:S,g;B,n;E,nr;M,nr;
+优:B,n;B,a;B,v;B,vn;B,b;B,z;S,ag;M,v;E,b;B,l;M,n;E,v;E,d;E,nr;B,i;M,l;E,j;E,i;E,n;M,nr;B,nrt;M,i;B,nz;E,nrfg;M,j;E,l;E,vn;
+谚:B,n;E,n;
+悝:E,nr;S,g;
+粥:S,n;E,n;B,b;M,i;E,nz;E,l;M,l;E,v;B,i;
+崤:S,g;B,i;
+在:S,p;E,v;E,t;B,v;E,d;B,u;E,n;M,i;E,b;M,n;B,vn;M,l;B,b;M,nr;M,v;E,l;M,z;E,z;B,i;E,i;B,r;B,nrt;B,a;B,n;E,nr;B,d;B,l;E,a;M,nz;M,nt;E,nrfg;
+讫:S,g;E,v;E,n;E,l;M,nr;
+螳:B,n;B,nz;B,l;B,i;
+庹:S,q;S,nr;B,nr;
+瘾:S,n;E,n;E,v;E,a;M,n;B,n;E,l;
+资:B,n;E,vn;M,n;E,n;M,l;E,v;S,ng;B,b;B,v;E,l;M,nt;E,j;B,vn;B,ns;M,nz;E,nz;E,b;B,l;E,nr;M,nr;B,nrt;B,nz;M,j;E,i;E,d;B,j;B,nrfg;
+蝈:B,n;E,n;M,n;
+镔:B,n;
+潘:B,nr;S,nr;E,nr;B,ns;M,nr;E,nrt;B,nz;B,nrfg;B,nrt;M,ns;E,n;B,n;E,ns;M,nrt;M,nz;
+胝:E,n;S,x;M,i;
+髡:S,g;E,nr;
+筠:E,nr;M,nr;S,g;B,ns;E,nrfg;
+雩:S,g;E,ns;
+睨:S,vg;E,v;M,i;M,l;
+拱:S,v;B,v;B,n;M,nr;B,ns;E,v;M,n;E,n;E,nr;B,l;E,nz;B,nt;B,b;M,i;
+驶:E,v;M,n;B,v;S,vg;M,nz;S,v;E,nr;
+烽:B,n;E,ns;M,ns;B,i;E,nrfg;
+兼:S,v;B,v;M,i;B,i;M,l;E,nr;E,v;B,n;M,nr;B,vn;E,d;B,l;E,i;M,j;
+刑:B,n;S,n;E,n;E,v;B,b;B,j;E,l;B,nr;B,l;M,n;B,i;M,i;E,vn;E,i;B,nz;B,v;M,nr;M,nt;M,nz;
+霓:B,n;E,n;
+炒:B,v;S,v;E,v;B,n;B,vn;E,n;E,nr;M,n;B,l;M,nr;
+吕:B,nr;S,nr;M,nr;E,nr;B,ns;B,n;M,nrt;B,nrt;E,n;M,ns;E,nrt;E,nz;M,i;E,i;
+辘:E,n;B,n;M,l;E,l;E,v;
+挛:E,vn;M,n;B,v;E,v;E,n;
+膜:E,n;S,n;M,n;E,nz;B,n;B,v;M,i;E,v;B,nz;
+缣:S,g;
+咪:B,n;E,n;B,nz;E,o;B,o;M,nz;M,n;E,nr;M,nr;
+舱:E,n;S,n;B,n;B,s;E,v;E,nr;M,ns;
+掰:S,v;B,v;M,nr;E,v;
+夷:S,ng;E,nr;M,ns;E,ns;E,n;E,v;M,nr;M,i;E,nz;B,ns;E,i;B,v;B,l;B,n;M,nt;S,ag;
+鸹:S,x;E,n;
+羸:B,z;
+医:B,n;E,n;S,v;B,j;M,n;M,nt;E,v;B,b;B,v;E,nr;M,nz;S,ng;B,vn;E,j;M,l;E,l;M,nr;M,i;B,ns;E,vn;E,i;M,j;B,nz;E,b;
+唿:S,x;B,n;
+裂:E,v;B,n;S,v;B,v;M,n;E,i;E,n;E,vn;B,vn;M,l;M,nt;B,b;M,nr;B,i;E,j;M,i;
+蓊:B,z;M,z;
+黎:E,ns;B,nr;B,t;M,ns;S,j;E,nr;B,ns;M,nr;B,n;M,l;M,nt;B,nz;B,nt;B,nrt;E,nrfg;M,n;M,nz;B,nrfg;
+瑕:B,n;E,z;M,nz;E,i;B,i;E,n;
+嗔:B,v;E,v;M,i;
+乙:B,n;S,n;M,n;M,nz;E,nr;M,nr;B,nz;B,l;B,m;E,n;S,m;B,b;S,mg;B,nrfg;M,j;M,nrfg;E,nz;
+荛:E,n;S,g;
+履:B,v;B,n;E,nr;S,vg;B,b;E,n;S,ng;M,nr;M,i;M,l;E,l;B,vn;E,i;M,n;B,i;
+噩:B,n;M,z;E,z;E,a;E,i;M,i;
+浯:S,g;M,nr;B,ns;E,nr;
+菰:S,g;
+杳:B,i;S,ag;M,nr;E,nr;B,l;B,v;
+祷:E,v;S,vg;B,v;B,n;B,vn;M,n;M,nr;
+畿:S,g;B,n;E,nz;E,nr;E,nrt;M,ns;M,nr;
+图:S,n;B,n;E,n;E,v;E,nr;B,nrt;M,nr;M,n;B,ns;E,ns;E,nz;E,vn;M,i;B,v;E,nrt;M,ns;E,i;M,nt;M,l;M,nz;B,nr;M,nrt;E,l;E,j;B,l;B,i;E,nrfg;B,vn;B,nz;B,q;
+趁:S,v;B,d;B,p;S,p;B,i;E,nr;B,l;M,nr;
+琐:E,a;S,ag;B,a;B,n;E,an;E,nr;M,nr;
+枝:E,n;S,q;B,n;E,m;M,i;E,nr;M,ns;M,n;M,nr;B,ns;E,i;B,i;E,v;S,m;M,l;S,ng;S,j;B,z;M,z;E,l;M,nt;E,b;
+脞:S,g;
+鼢:B,n;
+锦:B,n;S,ng;M,nr;B,ns;S,j;E,nr;E,n;B,i;B,nz;M,i;E,ns;M,ns;M,j;M,n;E,i;B,nrt;M,nrfg;E,l;E,v;S,ag;E,nz;B,v;
+倨:S,ag;B,a;S,g;M,i;
+妹:E,n;B,n;S,n;E,nr;M,nr;M,n;
+钻:S,v;B,v;B,n;E,a;E,n;E,nr;B,j;M,nz;M,i;B,vn;M,nr;B,i;E,l;E,v;M,n;E,nz;B,nz;
+笺:S,v;E,n;B,n;E,nr;M,n;
+鹌:B,n;
+奎:E,nr;M,nr;S,nr;B,n;B,nrt;B,ns;M,nrt;M,nrfg;E,ns;
+仗:S,n;E,v;E,n;B,a;B,i;S,v;M,n;E,nr;B,v;E,l;E,i;M,i;M,nt;M,l;
+旱:E,a;B,n;S,a;E,n;M,n;B,vn;E,vn;E,v;B,l;B,j;B,t;M,t;M,v;E,nr;E,l;M,nr;M,l;
+蝲:B,n;
+矽:B,n;B,nz;
+噼:B,o;M,o;
+酾:S,vg;
+蠃:E,n;S,x;
+掊:S,g;
+唑:E,n;S,x;E,nz;M,n;M,nz;
+瞒:S,v;E,v;M,l;B,v;B,i;M,i;
+匕:B,n;M,i;
+渗:B,v;S,v;B,n;E,v;M,n;E,nr;E,nz;M,nz;B,vn;B,nz;B,j;E,vn;
+搛:S,v;
+蚜:B,n;E,n;M,n;
+戟:S,ng;E,n;E,nr;M,n;E,i;M,i;M,nr;
+鲠:E,n;M,i;B,a;
+砣:S,v;E,n;B,n;
+骤:E,n;B,d;S,d;B,v;E,l;E,ad;B,n;M,i;B,vn;E,nr;M,l;B,i;
+撰:S,vg;B,v;E,v;B,n;E,nr;M,n;
+茵:E,ns;M,ns;E,nr;S,ng;M,nr;B,n;E,z;E,i;B,z;M,z;E,n;M,n;E,nrt;
+帷:B,n;S,ng;M,i;M,n;E,nr;E,n;M,nr;
+吻:S,v;E,n;B,v;E,v;B,n;M,n;E,nr;
+刿:S,g;
+流:E,n;B,n;B,v;B,vn;S,v;M,n;E,v;E,vn;M,ns;E,b;M,i;B,l;M,l;B,a;E,a;E,i;E,nr;E,ns;B,i;M,nr;E,r;E,j;B,b;E,l;B,ns;E,d;M,s;M,nz;M,b;B,nz;M,nt;M,v;B,z;M,z;E,nz;B,q;B,j;
+迂:B,v;B,a;S,a;B,i;B,vn;B,n;M,nr;E,nr;
+菊:S,ng;B,n;E,nr;M,nr;E,n;M,n;M,nz;B,ns;E,nrfg;B,nrt;E,i;E,nz;
+哐:S,o;B,o;
+淖:S,g;M,ns;E,n;E,nr;M,nr;B,n;
+葛:M,nr;B,nr;B,ns;S,nr;E,n;E,nr;B,n;E,ns;B,nt;M,ns;M,nz;M,l;B,nrfg;B,nz;
+艟:E,n;S,x;
+孥:S,g;E,nr;
+陧:S,x;
+痦:B,n;
+恳:B,v;E,a;B,a;M,z;E,z;B,n;M,a;
+寺:S,ng;E,ns;B,n;E,nr;E,n;B,s;M,nr;E,nz;E,r;B,ns;E,nrt;M,ns;B,nrt;
+肉:E,n;S,n;B,n;M,i;E,b;M,l;M,n;E,v;E,i;B,a;B,b;M,nz;E,l;B,v;B,l;E,nr;M,b;M,nr;B,nz;E,nz;B,t;E,j;B,j;
+愈:S,d;B,d;E,v;E,d;B,v;B,l;M,l;E,nr;E,nrfg;M,i;M,nr;E,l;M,n;M,nrfg;
+缌:S,g;E,nr;
+宏:B,n;M,nr;B,a;S,nr;E,nr;B,nz;S,j;M,i;E,a;M,ns;E,nz;E,ns;M,nz;E,z;E,l;B,ns;B,l;M,l;M,nrfg;S,nz;M,nt;B,nrt;E,nrfg;B,v;
+谖:S,g;E,nr;
+暝:S,g;
+鸢:B,n;S,ng;E,n;E,nr;
+窥:B,v;S,vg;M,n;E,v;M,i;B,n;E,nr;B,i;E,i;
+亭:S,ng;E,nr;B,n;E,n;M,nr;E,ns;E,nz;M,ns;E,nrt;B,i;M,i;M,n;B,ns;
+讯:E,nz;E,n;S,ng;M,n;E,v;E,nt;B,n;E,nr;M,i;M,nt;B,v;E,vn;M,l;E,i;E,j;M,nz;B,vn;B,nz;M,nr;
+膳:S,ng;B,n;E,v;E,nrt;E,n;E,nz;
+赀:S,g;M,nr;E,i;
+腈:E,n;B,n;M,n;
+镐:S,n;E,nr;S,ng;E,n;B,n;M,nr;
+俗:E,n;E,a;S,a;B,v;B,n;B,l;E,i;E,v;M,n;M,i;M,v;B,a;M,l;E,nr;M,nr;B,i;M,vn;E,l;
+裙:S,ng;E,n;B,n;E,nr;B,b;E,nz;M,nr;B,l;E,i;
+杜:B,nr;B,n;S,nr;B,v;M,nr;E,nr;M,nrt;B,ns;B,nz;M,nz;B,nrt;S,vg;B,nrfg;M,nt;M,ns;B,nt;M,i;E,nrt;B,i;B,l;
+姣:B,z;B,n;
+煨:S,v;E,nr;
+佬:S,ng;E,nz;M,nz;E,n;E,l;M,ns;E,nr;M,n;
+衮:E,nrt;E,nr;S,g;B,i;M,i;M,nr;B,nrt;
+奸:B,n;E,n;S,a;E,v;B,v;B,a;E,i;M,i;M,n;S,ng;M,l;
+驺:S,g;
+坼:S,g;
+蜇:E,n;S,v;M,n;E,t;
+把:S,p;E,m;B,v;B,n;E,n;M,n;M,l;E,v;M,v;E,nz;S,m;E,i;E,l;M,m;M,t;M,i;M,nr;B,nz;M,nz;E,nr;B,l;B,i;
+鬏:S,g;
+碎:E,v;B,n;S,a;S,v;E,a;M,i;B,v;E,i;E,n;M,n;E,nz;M,nr;B,i;M,z;E,z;B,nz;E,vn;E,an;M,nz;B,z;
+向:S,p;E,n;E,v;B,v;E,d;B,nr;B,d;M,n;B,n;M,nr;E,b;E,f;B,p;M,l;E,a;M,i;E,j;E,i;M,b;E,vn;B,ns;E,nz;M,nrfg;E,nrt;B,b;B,nrfg;E,nr;B,nrt;B,nz;B,t;M,nz;E,l;B,vn;M,nt;B,i;
+挟:S,v;B,v;E,v;B,i;E,vn;
+咦:S,e;M,nr;
+努:B,ad;M,nr;S,v;B,nrt;E,nr;B,v;M,ns;M,l;B,ns;E,ns;M,nrt;E,nrt;M,n;B,nr;
+萱:B,n;E,n;
+新:S,a;B,n;E,v;B,ns;E,d;B,b;B,v;E,a;B,nz;B,a;B,nt;M,nr;M,n;E,b;E,nr;M,nz;B,nrt;E,nz;E,vn;M,ns;E,ns;B,nr;B,i;E,i;B,t;B,d;E,n;E,j;M,i;B,vn;M,t;B,l;M,nt;E,l;B,j;M,j;M,nrfg;M,l;E,nrfg;M,nrt;E,nrt;M,b;E,z;B,nrfg;
+舵:S,n;E,v;B,n;E,n;E,i;M,n;M,nr;E,nr;
+掴:S,v;
+阽:S,g;
+匿:E,v;S,vg;B,v;M,i;B,n;E,nr;B,vn;M,n;E,vn;
+汁:E,n;S,ng;B,n;E,nr;E,i;E,nz;M,n;M,i;M,nr;E,v;
+苊:S,g;
+忌:S,v;E,n;B,v;E,v;M,i;E,i;M,n;E,l;E,nr;B,vn;B,t;E,vn;B,n;
+风:B,n;E,n;S,n;E,v;M,i;E,nr;M,n;B,i;M,l;B,v;B,a;E,l;M,nr;E,i;B,l;E,vn;E,ns;M,ns;M,nz;E,nz;M,v;E,a;E,nrt;B,b;E,r;B,vn;B,nz;E,nrfg;B,ns;M,nt;B,nt;M,j;M,s;E,j;B,j;B,nrt;M,nrfg;M,b;
+雒:S,nr;B,nr;E,ns;
+叔:S,n;E,nr;E,n;B,n;M,nr;M,n;E,nrt;B,nrt;B,nz;M,nrfg;
+泖:S,g;
+荟:B,v;E,n;M,i;M,nz;M,nr;B,ns;
+屡:S,d;B,d;E,d;B,i;B,l;M,l;
+绢:S,n;E,n;B,n;E,nr;E,nrt;M,nr;M,n;B,nz;
+瓦:E,m;S,n;B,nr;M,nr;B,n;E,ns;M,ns;E,nr;B,v;B,nrt;E,n;E,nrt;E,q;M,n;M,nrt;M,m;S,m;B,ns;M,i;M,q;M,nz;E,nz;B,nz;B,q;S,v;M,nt;B,z;E,i;M,l;S,q;B,i;E,v;
+莉:E,nr;S,x;M,n;E,n;M,nr;B,nrt;E,nrt;M,nrt;
+戈:B,nr;B,n;M,nr;E,nr;S,nr;E,v;B,nrt;E,n;M,ns;E,nrt;M,i;M,nz;M,nrt;S,ng;E,i;E,l;B,nz;E,ns;B,ns;M,n;M,l;E,nz;E,m;B,nrfg;E,q;
+庋:S,g;
+簌:E,z;B,z;M,z;
+鞑:B,n;B,ns;
+瘐:S,x;
+劓:S,g;
+褚:B,nr;S,nr;M,nr;E,nr;
+羡:B,v;E,v;S,nr;M,nr;M,l;E,nr;S,vg;E,vn;E,n;E,a;M,i;
+堤:E,n;S,n;B,n;E,v;B,s;E,nr;M,nr;E,ns;E,nz;E,i;E,nrt;M,l;B,ns;
+玩:S,v;B,n;B,v;M,v;E,v;E,n;B,i;E,a;M,i;M,nz;M,a;E,nr;M,n;B,l;M,nr;B,nz;B,vn;
+刨:S,v;B,n;B,i;B,v;E,n;M,n;B,nz;
+身:B,n;E,v;B,s;E,n;E,r;S,ng;B,v;B,f;M,i;E,m;E,d;B,i;E,vn;M,n;M,l;E,i;E,a;E,b;B,l;E,nr;E,l;M,nr;E,nz;M,d;S,m;M,nz;E,nrfg;M,v;E,ad;
+芳:E,nr;B,n;M,nr;S,nr;E,n;S,ng;E,v;M,i;S,ag;B,nz;E,nrfg;B,ns;E,nz;E,i;M,nz;E,l;M,l;B,nrt;M,nt;B,z;
+鲷:S,g;B,n;E,n;
+容:E,n;B,a;E,v;B,n;S,v;M,l;B,v;M,n;E,nr;M,i;B,nr;E,a;E,vn;M,nr;M,d;E,i;E,z;B,i;E,l;E,ns;B,ns;B,nrt;M,ns;E,nz;M,z;B,vn;E,nrt;B,nz;M,j;B,b;M,v;M,nz;
+示:E,v;E,n;B,v;E,vn;M,n;S,vg;B,vn;B,n;E,nr;M,l;M,i;B,b;M,nz;M,nr;E,i;B,l;E,l;M,ns;B,nrt;
+喽:B,n;S,y;S,u;M,nr;
+猾:E,a;E,i;S,g;
+蹀:B,v;S,g;
+衄:S,g;
+绋:S,g;
+限:M,n;B,v;E,n;S,v;E,a;E,v;B,n;M,l;M,nt;B,vn;E,t;E,nr;M,i;M,nr;B,l;B,nz;M,v;B,b;M,nz;E,l;E,j;
+诙:S,vg;B,a;
+橘:E,n;B,n;B,b;B,ns;B,nr;
+嫣:E,nrfg;B,i;B,b;M,i;B,z;M,nr;B,l;
+哧:E,o;S,o;M,o;B,o;
+柱:E,n;S,n;E,nr;B,n;M,n;M,nr;B,nz;E,m;E,i;E,vn;M,ns;M,nrfg;E,ns;E,q;M,i;S,m;S,q;E,nz;E,nrfg;
+蕲:S,g;B,ns;B,n;M,nr;E,nr;
+懵:S,v;B,v;B,l;M,l;M,z;B,z;E,nr;
+饺:B,n;S,ng;E,n;
+呼:B,v;E,v;S,v;B,n;B,nr;B,ns;E,n;M,i;M,l;M,z;B,i;M,n;B,o;E,z;B,vn;B,l;E,i;E,e;B,j;E,nr;B,z;B,nz;M,o;M,nr;M,v;E,vn;B,nrt;E,l;M,ns;B,nt;
+企:B,n;S,ng;M,j;B,v;E,j;M,n;E,n;S,j;M,l;M,nr;E,nr;M,nz;B,j;M,nt;M,b;M,i;B,b;B,vn;E,vn;
+涂:S,v;E,a;B,n;B,v;B,nr;E,n;E,z;M,i;M,n;E,i;E,vn;E,v;E,ns;M,z;E,nr;E,nrt;B,i;M,ns;B,ns;M,nr;E,nz;B,nz;E,l;B,vn;
+蒜:E,n;S,n;B,n;E,v;M,i;
+稣:E,nr;S,g;M,n;
+颤:B,v;S,v;E,v;B,z;E,n;B,n;M,z;E,vn;E,i;M,i;B,vn;M,n;E,l;
+垦:E,v;S,v;B,vn;E,n;B,v;B,n;E,vn;M,n;B,ns;B,nrt;E,nr;M,nt;E,nz;M,ns;
+丫:B,n;M,nr;S,n;M,n;E,n;S,ng;E,nr;M,v;M,ns;
+购:E,v;B,v;E,vn;B,n;S,vg;B,vn;M,n;M,nz;E,n;M,l;B,nz;B,l;M,ns;E,j;
+蜱:S,g;
+悴:E,a;S,g;E,l;
+嘻:S,o;M,z;E,z;B,v;B,z;S,e;E,nr;B,i;M,nr;E,e;
+什:B,r;M,r;M,l;M,v;M,ns;E,ns;E,nrt;B,n;M,nrt;E,nr;M,n;E,n;B,ns;M,nz;B,nrt;M,nr;E,nz;
+蟆:S,x;E,n;E,nr;M,n;M,l;
+捉:S,v;E,v;B,v;M,i;B,i;B,l;B,vn;M,ns;
+臊:S,a;E,a;B,n;E,n;E,v;
+睑:E,n;S,g;B,n;
+奥:S,j;B,nr;B,ns;B,nz;B,n;B,j;B,nrt;M,nr;E,nr;E,nrt;M,nt;E,a;M,nrt;M,ns;M,nz;E,nz;B,nt;M,j;B,a;E,ns;M,n;E,j;E,n;B,i;
+湫:S,g;E,nz;E,nr;M,nr;
+蛰:B,v;E,t;
+扳:S,v;B,n;B,v;E,n;S,vn;
+胴:B,n;
+登:B,v;S,v;E,v;B,n;M,nr;E,nr;B,vn;B,ns;B,d;B,nz;E,nrt;E,ns;B,nrt;M,i;M,ns;E,a;B,l;E,nz;B,i;E,i;M,nt;M,n;E,n;M,nrt;M,l;M,z;E,z;
+铼:S,g;E,nr;
+灿:B,a;E,nr;S,ag;M,z;E,z;M,i;M,nr;B,i;B,nz;B,l;E,l;M,l;B,z;
+躁:E,a;S,v;B,v;B,a;E,i;B,n;E,l;B,vn;M,z;E,z;M,nr;
+袅:B,z;E,z;B,i;M,i;M,z;E,l;M,l;B,v;
+挈:S,g;E,v;M,i;
+律:E,n;B,n;S,nr;E,d;M,nr;M,ns;M,n;E,nr;S,ng;E,l;E,v;E,ns;M,nt;E,i;S,vg;E,vn;E,nz;M,v;M,l;B,v;E,b;M,i;M,nz;B,j;
+鲍:B,nr;S,nr;B,n;M,nr;B,nrt;E,nr;B,i;
+邕:E,nr;S,j;B,ns;M,nr;
+舞:B,n;S,v;E,v;E,n;M,n;B,v;M,i;E,i;E,nr;B,vn;E,l;M,nt;B,ns;M,nr;M,l;B,j;B,i;E,vn;B,nt;B,t;B,l;
+纡:S,g;M,nr;E,v;E,nr;B,i;
+张:B,nr;S,q;E,n;E,m;E,v;E,a;B,v;B,nrfg;B,ns;E,nr;S,m;M,i;M,nr;M,n;B,nz;B,i;B,n;E,z;E,vn;E,ns;M,z;E,i;E,l;E,r;B,a;M,l;E,b;M,b;B,nrt;M,ns;M,nz;
+碥:S,g;
+夤:S,g;B,t;E,nr;B,v;
+辫:B,n;S,ng;E,n;M,n;M,v;M,l;E,b;
+莳:S,x;M,nr;B,n;B,i;E,nr;
+砺:S,ng;E,v;S,vg;E,nr;M,nr;E,vn;B,n;
+咽:S,v;E,v;B,n;B,v;E,l;M,l;E,i;E,n;M,n;E,nr;
+襄:S,j;B,ns;E,nr;M,nr;E,ns;B,nrt;B,nz;M,nrt;S,ng;S,vg;B,v;E,nrt;M,n;B,n;M,ns;
+蓝:B,n;B,nr;S,a;B,j;M,n;B,ns;E,b;E,nr;E,n;M,nr;E,z;B,nz;E,a;B,b;B,z;E,nz;M,z;M,i;M,b;E,i;B,nt;M,j;B,a;E,l;B,nrfg;B,nrt;
+竹:B,n;S,ng;E,n;E,nr;M,nr;E,ns;E,i;B,nz;M,n;M,i;M,ns;B,ns;B,nrt;B,b;B,l;B,nr;M,v;M,nz;S,n;E,nrt;
+顺:E,nr;B,ad;B,n;B,d;S,v;M,nr;S,a;B,v;B,p;E,nz;B,t;E,v;B,a;E,ns;E,a;E,i;B,ns;B,nrt;B,i;E,nrfg;M,ns;B,nz;E,nrt;M,i;E,t;B,l;B,z;M,z;B,j;M,l;B,b;B,vn;M,nt;E,nt;E,vn;M,nz;M,nrfg;E,n;M,n;
+啼:B,v;S,v;M,z;E,z;E,n;B,n;B,i;B,vn;E,nr;M,l;M,i;
+丁:B,nr;S,nr;E,nr;E,n;M,ns;M,n;B,n;M,nr;M,nz;E,nrt;E,nz;E,d;B,o;B,m;S,vg;M,nt;B,ns;E,i;E,v;M,m;M,i;S,ng;E,ns;M,nrt;B,nrfg;M,l;M,o;B,nz;B,i;B,v;E,l;B,t;B,nrt;B,b;E,nrfg;
+沂:S,j;E,ns;B,ns;M,ns;B,n;M,nr;E,nr;M,n;
+鼋:B,ns;B,n;
+洗:B,v;S,v;E,v;B,n;E,vn;B,nz;E,b;M,n;B,a;E,nr;B,vn;B,i;E,i;B,l;E,n;M,l;E,nz;E,l;M,nr;M,v;M,i;B,j;E,a;M,nz;
+望:E,v;S,v;E,n;E,a;B,v;B,nr;B,n;E,nr;M,n;M,i;B,i;E,vn;E,i;M,nr;B,ns;E,nz;E,l;E,t;E,b;M,l;B,l;B,nz;E,ns;E,nrt;M,ns;M,nrt;M,nt;M,nz;M,nrfg;B,t;
+薜:S,nr;B,n;M,nr;E,nr;
+感:B,v;B,n;E,n;S,vg;E,a;E,v;M,n;B,a;M,l;B,l;B,vn;B,i;B,t;E,b;E,ns;M,i;E,nr;B,nz;M,v;M,ns;E,i;E,l;E,an;E,nz;E,vn;M,nz;
+龠:S,g;
+岢:S,g;M,nr;B,nrt;E,nr;
+伫:B,v;S,vg;E,nr;
+谭:B,nr;S,vn;S,nr;E,nr;E,i;M,nr;B,nrfg;
+枰:S,ng;E,nr;
+耵:B,n;S,x;
+圻:E,ns;E,nr;S,g;M,ns;M,nr;
+疼:B,n;S,v;E,v;S,a;E,a;B,v;B,a;E,z;M,i;M,n;M,z;E,l;B,an;B,vn;
+儿:E,n;S,n;B,n;E,r;E,nr;E,m;E,d;M,n;E,t;E,v;E,l;E,q;M,nr;M,t;M,l;M,ns;E,z;E,a;M,m;E,nz;M,nz;B,t;B,l;E,mq;S,ng;M,i;E,i;B,nt;M,nt;B,i;E,nrt;E,s;B,nz;E,j;E,f;B,v;B,j;M,v;E,b;E,o;M,o;M,j;
+桅:S,ng;B,n;E,n;E,nr;M,nr;
+蛆:S,n;B,n;M,n;
+扉:E,n;B,n;
+籍:E,n;S,ng;E,nr;B,n;E,b;B,nr;E,v;M,nt;B,v;M,n;E,j;E,a;M,nz;E,i;E,vn;
+铒:S,g;
+棚:E,n;S,n;B,n;B,s;E,nr;E,v;E,l;M,nr;E,ns;M,n;
+幡:S,ng;E,n;B,d;M,nr;B,l;E,nr;
+塥:S,g;
+镧:B,n;
+剩:B,l;B,v;E,v;S,v;B,n;B,vn;E,l;M,i;M,l;M,nr;E,nr;
+跬:S,g;M,l;B,n;
+致:E,v;E,a;B,v;S,v;E,d;E,c;E,n;B,n;M,i;B,a;E,i;B,vn;M,n;M,l;M,nr;B,nz;E,nr;B,nt;M,v;E,l;E,an;E,nz;M,nt;M,z;M,nrfg;M,nrt;E,z;
+絷:S,g;
+延:B,v;E,nr;E,v;B,ns;M,nr;S,j;B,nr;B,n;E,n;B,nrt;S,vg;B,nz;M,i;B,i;B,nt;M,l;M,n;M,ns;B,vn;E,ns;M,nrfg;E,a;
+闼:S,g;E,nr;
+勾:B,v;S,v;B,n;B,nr;B,nrt;M,z;E,z;B,i;M,i;E,nr;B,z;E,n;E,nz;
+鞅:E,nr;S,x;
+戌:M,l;E,m;M,nz;M,n;M,m;B,t;
+辕:E,n;B,n;M,nr;M,i;M,ns;E,v;E,nr;
+渔:B,n;S,j;E,j;E,nr;S,ng;M,j;B,i;M,nr;E,v;M,nt;E,i;M,ns;M,n;E,n;M,i;B,l;M,l;B,ns;M,nz;B,v;S,vg;E,nrfg;
+疙:B,n;M,l;M,n;M,z;B,z;M,nr;M,i;
+箝:B,n;
+娜:E,nr;S,x;E,nrt;M,nr;B,nrt;E,nz;E,z;E,a;M,i;M,z;M,ns;E,ns;
+枥:S,g;E,i;E,nr;B,ns;E,v;
+涩:E,a;S,a;E,v;B,n;E,i;B,nrt;B,v;M,nr;B,ns;M,n;
+鲳:B,n;E,n;
+徵:E,nr;S,g;M,nr;
+芷:S,x;E,n;B,ns;E,nr;M,nr;B,nr;
+机:B,n;E,n;S,ng;M,n;E,d;E,b;B,a;E,vn;E,v;B,b;M,l;M,i;B,v;E,l;E,nz;B,vn;E,nr;B,s;M,nz;M,ns;E,i;E,r;M,b;M,nt;B,l;E,j;B,i;B,nt;M,nr;E,nrt;M,v;B,nz;B,j;M,j;E,m;B,ad;B,ns;
+派:S,v;E,n;B,v;B,n;E,v;E,nr;E,m;E,b;E,a;M,n;E,r;E,vn;S,m;E,nz;M,nr;B,nz;M,l;B,nrt;M,i;E,l;M,nt;B,ns;E,nt;E,nrfg;
+附:B,f;S,v;B,n;B,v;E,v;B,b;B,vn;M,i;M,n;B,d;B,j;E,vn;M,j;M,nz;B,i;M,nt;M,ns;M,nr;E,i;E,nrt;E,nr;
+惋:B,a;E,v;
+泓:S,q;E,nr;M,nr;
+蟥:E,n;S,x;
+晤:E,v;S,vg;M,n;M,ns;M,nt;B,v;E,nr;M,nr;
+汨:B,ns;
+班:M,ns;S,n;B,n;E,v;E,n;M,n;B,nr;E,m;E,vn;E,nr;M,nz;B,s;M,l;B,nz;B,v;E,nz;M,nr;E,ns;B,ns;S,m;E,i;E,nrt;B,nrt;M,nt;E,r;B,t;E,j;B,i;B,j;B,l;E,b;E,vd;M,nrt;B,a;
+年:S,m;E,m;E,t;S,q;B,n;B,t;E,n;E,r;E,d;B,a;M,n;B,j;M,l;M,t;B,v;B,b;E,v;E,nr;M,b;E,q;M,i;E,j;M,v;B,l;M,nt;B,q;B,f;E,l;E,i;B,m;B,i;B,nr;B,z;E,nz;M,nrt;E,nrfg;E,ns;M,vn;B,ns;M,ns;M,nz;M,nr;E,b;E,mq;M,m;E,f;M,j;B,nz;M,mq;E,vn;
+毽:M,v;B,n;E,v;
+耋:M,i;E,n;S,g;
+羊:B,n;S,n;E,n;E,nr;B,nr;M,nr;M,n;E,ns;E,v;B,ns;E,l;M,ns;M,i;B,nz;B,i;M,nt;E,i;E,nz;M,nz;M,l;E,vn;E,nrfg;M,v;E,t;B,nrfg;B,t;M,j;
+谓:E,v;S,v;E,l;E,n;B,n;E,b;E,nr;M,nr;S,vg;E,vn;B,i;
+殒:B,v;E,i;
+骜:E,nr;M,i;E,a;M,nr;S,g;
+肠:E,n;B,n;S,n;M,n;M,l;M,i;E,v;E,i;E,l;M,nr;B,v;M,nz;E,nr;E,vn;
+蚤:S,g;E,n;M,n;
+侪:E,n;B,n;S,g;E,r;M,nr;
+犬:S,ng;E,n;B,n;M,n;E,nr;M,i;B,i;E,i;M,l;E,l;
+碰:B,v;S,v;B,vn;E,v;B,d;M,v;B,l;M,l;B,n;E,nr;M,n;M,nr;
+蔹:S,x;M,nr;
+撸:B,n;
+捍:B,v;B,n;
+诒:S,g;E,nr;M,nr;
+仔:B,ad;S,ng;E,nr;S,b;E,n;M,n;M,nz;M,z;B,z;M,nr;M,ns;B,n;E,ns;B,nrt;
+孝:S,ng;M,nr;E,nr;B,n;B,v;B,ns;E,v;E,a;M,nrt;E,n;B,nrt;B,nz;E,i;B,i;M,l;M,nrfg;M,n;M,i;B,nr;E,l;B,vn;M,ns;
+董:B,n;B,nr;S,nr;E,n;M,nr;E,nr;B,nrfg;M,n;B,nz;B,ns;M,ns;M,nz;M,j;
+火:B,n;S,n;E,n;E,v;B,a;M,n;M,i;B,v;B,z;M,l;E,a;B,d;B,b;E,i;B,j;B,i;E,nr;E,b;E,vn;B,ns;E,l;B,l;E,nrt;M,nr;M,nz;M,ns;M,z;E,z;B,nt;B,nz;M,nt;E,nz;B,t;M,a;B,nr;B,nrfg;B,vn;E,ns;M,v;E,j;M,j;
+癯:S,g;E,a;
+米:E,m;S,q;S,m;E,q;E,n;B,nr;B,n;M,ns;M,n;M,nr;E,nrt;E,nr;B,nrt;B,ns;M,nz;M,nrt;M,i;B,nz;E,vn;E,v;M,l;E,ns;M,q;E,nz;E,l;M,nt;B,nt;B,i;B,b;E,i;
+湿:B,v;S,a;B,n;E,a;S,v;E,v;E,n;B,a;M,n;B,z;M,l;M,nrt;E,z;E,b;E,nr;E,nz;M,z;E,l;M,nz;B,b;M,j;
+喃:E,o;B,o;E,n;B,i;M,i;M,n;E,v;M,nz;E,nr;M,nr;E,vn;
+隅:S,ng;E,n;E,f;M,i;E,nrt;M,ns;E,i;E,l;E,nr;
+眄:S,vg;
+宇:B,n;E,nr;E,n;B,nr;M,nr;B,l;S,nr;B,nz;E,nz;M,i;M,nt;S,ng;M,nz;M,ns;B,s;E,i;B,nrt;E,nt;M,nrfg;E,nrt;
+芍:B,n;E,n;B,nz;B,ns;
+椐:S,g;
+演:B,v;E,v;B,n;E,vn;E,n;S,v;B,vn;M,n;M,l;M,nz;M,nr;E,nr;E,i;E,nz;M,nt;M,nrfg;B,j;
+逖:E,nr;S,g;M,nr;
+阚:B,nr;S,nr;
+窝:S,n;E,n;B,n;B,a;S,v;M,n;M,d;B,v;M,nr;E,ns;M,nz;M,l;E,v;B,l;M,nrt;E,l;M,ns;M,i;
+舢:B,n;
+沩:S,g;B,ns;B,n;
+踪:E,v;B,n;S,ng;E,n;E,i;M,i;E,b;M,n;M,nz;E,vn;M,l;E,nz;
+劭:E,nr;S,g;M,nr;E,nrfg;
+鞯:S,x;E,n;
+琮:E,nr;S,g;M,nr;
+庵:S,ng;E,nr;E,n;M,nr;E,ns;B,n;
+获:B,v;S,v;E,v;B,n;B,vn;E,i;M,i;M,n;E,nr;B,ns;B,l;E,n;M,nz;B,nrt;M,nr;
+痃:S,x;E,n;
+剂:E,n;S,ng;B,n;S,q;E,nz;E,v;M,n;E,nr;M,l;
+篇:E,m;S,q;M,l;S,m;M,n;E,n;E,b;B,n;M,i;E,r;E,v;E,nr;E,i;E,l;M,m;
+懋:S,g;E,nr;M,nr;B,n;B,nz;
+柏:B,ns;B,nr;M,nr;E,nr;E,n;M,ns;B,n;S,ng;S,nr;E,ns;B,nz;M,nt;E,nrfg;E,nrt;M,n;B,nt;B,nrt;E,nz;
+受:S,v;B,v;E,v;B,n;E,a;B,l;M,n;B,a;M,i;E,i;B,vn;E,l;B,i;M,l;M,nr;E,b;M,nz;E,nr;E,vn;M,v;B,ns;
+铙:S,nr;B,n;
+胡:B,nr;B,n;S,nr;B,v;E,nr;B,i;B,d;E,n;B,nrfg;M,nr;M,n;S,d;M,l;B,nz;M,ns;B,l;B,ns;M,v;M,i;B,a;M,z;B,vn;B,nrt;B,z;M,nrt;E,nrt;S,ng;B,s;
+狭:B,a;B,b;S,ag;B,z;E,a;B,n;B,i;
+绵:S,a;B,n;E,z;B,v;B,ns;E,n;B,z;E,a;M,l;B,a;M,n;E,nr;M,nr;M,z;M,i;E,l;E,v;B,i;B,l;B,ad;M,nrfg;E,nrfg;M,nz;B,nt;
+虺:S,x;
+锃:B,z;B,l;
+尉:E,n;E,nr;B,nr;S,nr;M,nr;B,ns;B,n;
+丕:S,g;E,nr;M,nr;E,nrfg;
+猗:S,y;E,ns;M,ns;S,e;B,nrt;M,nr;E,nr;
+缟:S,g;B,n;E,nr;
+欧:B,ns;B,n;E,ns;S,j;B,nr;B,j;B,nt;B,nz;M,n;B,nrt;E,j;E,nr;E,n;B,b;B,nrfg;M,nt;B,l;M,nr;B,v;M,ns;E,nrt;E,v;E,vn;E,nz;B,i;B,q;
+圯:E,nr;S,g;
+鸵:B,n;B,l;E,n;
+净:B,n;S,a;E,a;B,v;E,v;M,n;M,z;E,z;E,i;E,nr;M,nz;M,ns;E,l;M,i;B,z;M,nr;M,l;B,ns;B,a;E,nz;E,n;B,nz;
+才:S,d;E,n;E,t;E,nr;E,d;B,v;B,n;M,i;M,nr;E,v;E,i;B,d;B,i;E,a;M,ns;E,l;M,n;B,l;E,vn;B,nr;E,nrfg;M,l;B,ns;M,nrt;M,nrfg;
+桑:B,nr;B,n;M,ns;E,n;E,nr;S,ng;S,nr;B,ns;M,nr;E,nrt;M,i;B,nz;E,ns;E,i;B,nrt;M,n;M,nt;E,l;B,nrfg;E,nz;E,j;B,nt;M,nrt;M,nz;B,l;
+呙:S,nr;
+拢:E,v;S,v;M,l;E,nr;B,v;B,d;E,vn;
+哮:E,v;B,n;M,l;M,n;
+捷:B,ns;E,a;S,j;E,nr;E,n;M,nr;B,n;E,v;E,z;B,nz;E,nz;E,l;B,i;M,ns;M,n;E,d;M,nrt;M,vn;M,l;E,i;B,nr;M,i;B,v;B,nt;B,nrt;E,nrt;E,nrfg;
+诼:S,g;E,n;
+龉:S,x;E,n;
+亓:S,nr;B,nr;M,nr;
+气:E,n;B,n;S,n;E,v;M,n;E,a;M,i;M,l;B,a;B,i;E,i;B,v;E,l;B,z;E,an;M,nr;E,nz;M,vn;B,b;E,nt;E,vn;M,nt;M,b;E,d;E,z;M,ns;M,z;E,j;E,nr;B,l;M,v;M,nz;B,nz;B,vn;E,u;E,ad;
+嘘:E,v;S,v;B,n;M,n;E,n;B,i;M,z;E,z;E,l;S,e;B,v;M,l;E,vn;
+锚:S,n;B,n;E,v;B,j;E,n;B,v;B,b;
+斥:E,v;B,v;S,vg;E,vn;M,i;B,n;M,n;B,l;M,l;
+謦:S,x;
+贪:B,v;S,v;B,a;B,n;B,i;M,j;M,i;E,vn;B,l;E,n;
+钯:S,g;E,n;E,nr;M,nr;E,nz;
+肷:S,g;
+漾:E,v;S,v;E,nr;B,ns;M,nr;
+鹈:B,n;
+嵊:S,g;B,ns;B,nrt;
+职:B,n;S,ng;E,v;E,n;E,vn;M,n;B,v;E,b;M,l;M,i;E,i;E,a;E,j;E,nz;B,j;E,l;E,nr;B,vn;M,nr;M,j;M,b;B,l;B,nz;
+滓:S,g;E,n;M,ns;M,nr;
+菡:E,nr;S,x;B,n;M,nr;
+迩:S,g;E,i;E,l;E,n;E,nr;M,i;
+偬:E,a;E,i;S,x;
+篱:B,n;E,n;M,i;E,ns;
+饲:B,n;B,v;S,vg;E,v;M,n;B,nz;B,b;
+蕺:S,x;B,n;
+槽:S,ng;E,n;B,n;E,v;E,nr;M,nr;M,n;E,nz;B,nz;E,vn;
+轾:E,nr;S,x;
+阃:S,g;
+萏:S,x;E,n;
+隘:E,n;B,n;E,a;S,ng;M,n;M,nr;
+颜:B,n;B,nr;E,nr;M,i;E,n;M,nr;S,nr;S,ng;E,nrt;M,ns;M,l;S,j;E,v;E,i;E,ns;B,i;E,l;B,l;E,nz;
+簟:S,g;
+别:E,d;B,r;S,d;E,n;E,v;E,a;B,n;B,v;M,ns;B,nr;B,a;M,n;B,i;E,i;M,v;M,i;B,c;B,l;E,vn;B,b;M,nz;E,nr;M,nr;B,nz;B,d;M,vn;M,l;B,nrt;M,nt;E,ns;B,z;M,z;E,l;B,ns;M,nrt;
+炬:E,n;M,nz;S,g;E,i;M,nr;E,nr;M,n;M,i;
+启:B,v;S,v;E,v;M,nr;B,vn;E,nr;E,t;B,n;B,ns;B,l;M,i;M,l;B,nz;B,b;B,nrt;M,nrfg;M,b;
+畅:E,a;S,a;B,a;B,v;B,i;E,nr;B,nr;B,n;E,v;M,i;B,ad;M,ns;B,z;B,l;B,vn;M,nr;E,nrfg;M,l;E,i;
+哄:S,v;B,v;M,z;E,z;E,v;B,vn;M,i;B,i;B,n;E,nr;M,nr;E,vn;E,n;
+角:B,n;E,n;M,n;S,q;S,n;M,ns;E,m;E,f;B,v;E,i;E,ns;E,nz;E,j;M,l;B,ns;E,nr;E,s;S,m;M,i;M,nr;E,b;M,s;E,l;E,nrt;M,nz;E,v;B,nz;B,vn;M,v;B,s;E,nrfg;B,q;M,nt;
+遗:B,n;B,vn;B,v;B,a;S,vg;S,ng;E,v;M,n;E,n;M,i;E,i;M,ns;B,i;E,nr;M,nr;M,l;M,nt;M,b;B,l;
+佩:B,v;M,nr;B,nr;E,v;S,v;E,nr;B,nrt;B,n;M,nt;M,ns;E,n;B,ns;E,l;M,nrt;E,nrt;B,nz;
+蛸:S,x;E,n;
+裼:S,g;M,nr;E,nr;
+俾:B,nrt;S,vg;B,ns;
+垃:B,n;E,n;
+甄:B,nr;B,v;S,nr;E,nr;M,nr;B,vn;
+妇:E,n;B,n;S,ng;S,j;E,nr;M,n;B,j;B,l;M,nz;B,i;M,nt;E,i;E,j;M,i;M,nr;M,l;M,t;
+缈:E,a;E,i;S,x;E,z;M,z;
+皙:E,nr;E,z;S,g;M,nr;
+夜:B,t;E,t;S,tg;E,n;E,m;B,n;E,d;E,v;E,b;B,v;M,i;E,i;M,l;E,l;B,l;B,i;M,n;E,nr;M,t;B,nr;S,m;B,b;E,nz;M,nr;B,ns;B,nrt;B,j;B,vn;B,nz;
+抡:S,v;E,nr;
+耢:S,n;S,v;
+谪:S,vg;B,v;E,vn;E,nr;
+岵:S,g;E,nr;
+携:B,v;S,v;M,b;B,n;E,v;M,i;E,b;B,nz;B,l;E,nr;M,n;B,i;M,l;M,nr;
+趿:S,v;B,v;
+镄:S,g;
+婆:E,n;B,n;E,nr;S,ng;M,nr;M,n;M,i;B,nrt;B,z;B,i;B,ns;E,nrfg;B,nz;M,nz;E,v;E,ns;B,l;E,l;E,i;
+届:E,m;E,r;B,d;S,m;E,j;E,b;S,q;M,nz;E,v;B,v;M,nt;B,n;E,n;E,i;M,l;B,s;
+腌:S,v;B,v;B,n;B,nz;
+族:E,n;E,nz;S,ng;M,ns;M,n;B,n;E,r;E,nr;S,q;M,nz;M,l;M,nt;E,v;E,j;M,v;M,nr;M,b;M,vn;E,i;E,l;
+赔:B,v;S,v;E,v;B,n;B,l;E,vn;M,nz;M,n;B,i;E,nr;B,vn;
+祜:S,g;M,nz;E,nr;E,nrt;M,ns;M,nr;
+苡:S,g;E,n;E,nr;
+蓥:M,ns;E,ns;
+热:B,n;S,a;B,a;E,v;M,n;E,a;B,v;E,n;E,z;B,z;B,l;B,ns;B,i;M,v;E,i;E,vn;M,l;M,ns;B,vn;M,z;E,l;B,nz;M,i;M,nz;B,ad;M,nr;B,nrt;E,nz;E,nrt;E,nr;B,b;M,b;E,an;E,ns;M,nrt;B,j;E,b;M,j;M,vn;B,nr;
+公:B,n;M,n;B,v;B,ad;M,m;B,q;B,t;B,b;E,n;S,ng;E,nr;M,q;M,nt;B,m;B,nr;M,nr;B,a;E,vn;M,l;S,b;M,ns;B,vn;B,d;M,i;B,nt;B,i;E,j;M,nz;E,a;B,l;M,b;E,v;B,ns;E,i;B,j;E,d;B,nz;M,j;E,l;M,vn;E,r;S,r;E,ns;E,nz;M,v;E,nrt;B,nrt;M,nrfg;E,b;B,an;
+孰:S,r;B,l;M,l;B,v;
+嵴:S,g;
+曹:B,nr;S,nr;B,ns;M,nr;E,nr;E,n;B,nrfg;E,ns;M,i;B,n;B,i;E,r;M,l;B,nz;
+葺:E,v;M,l;S,g;E,nr;
+刁:B,nr;S,a;B,a;B,v;B,n;B,i;E,v;S,nr;M,n;E,nr;M,l;B,nrfg;B,vn;
+窆:S,g;
+鞘:E,n;B,n;E,v;M,ns;M,n;E,l;
+笛:S,n;B,n;E,n;B,nr;E,nr;S,ng;M,nr;M,n;E,v;
+咚:E,o;S,o;B,o;M,o;E,z;M,nr;E,nr;
+庞:B,a;B,nr;E,n;S,nr;M,nr;B,i;B,nrt;E,nr;M,ns;B,ns;M,nt;B,n;B,nz;M,nrt;B,nrfg;
+莠:M,i;E,z;S,ag;E,i;S,g;B,n;E,nr;
+薤:S,g;B,n;
+辨:B,v;S,vg;E,v;B,a;M,n;E,vn;E,nr;B,vn;E,l;M,i;B,n;
+逭:S,vg;
+熬:S,v;E,v;B,v;E,a;E,vn;E,nr;
+唯:B,b;B,n;S,d;B,v;M,n;E,nr;B,d;B,l;B,a;M,nr;M,l;B,i;M,i;B,nz;B,ns;
+枸:B,n;B,nz;M,nr;
+嗄:S,e;S,g;
+鳊:B,n;
+恍:S,vg;B,a;B,i;B,d;B,v;M,i;M,z;B,z;B,ad;E,nr;E,a;M,nr;
+蛎:E,n;S,g;E,nr;M,n;M,nr;
+裒:S,g;
+汕:B,ns;E,ns;S,j;E,nr;M,ns;B,nt;B,n;M,nr;
+酗:B,v;
+噙:S,v;E,nr;
+绞:S,v;B,n;M,n;B,v;B,i;E,l;S,q;
+蝣:E,n;S,x;
+乩:S,x;E,v;
+泪:E,n;B,n;S,n;E,v;M,l;B,l;B,z;M,i;B,i;M,n;E,i;E,l;E,nr;
+慷:B,a;B,i;B,ad;S,vg;M,i;E,nr;E,l;M,nr;
+死:S,v;E,v;B,v;B,n;M,n;M,i;E,n;B,i;E,d;E,i;E,nr;B,z;B,d;M,z;E,l;M,l;E,a;B,a;B,l;E,vn;B,j;M,v;E,z;B,vn;M,nr;M,nz;E,b;B,ns;
+庇:S,vg;B,v;E,v;M,nr;E,n;B,n;E,nr;M,n;M,nz;
+馉:B,n;
+融:E,n;B,vn;B,v;M,n;S,v;B,n;E,v;B,nr;M,nz;B,ns;E,nr;M,j;M,nt;B,l;E,b;M,nr;E,i;E,z;E,nz;E,a;M,l;B,z;B,i;M,i;M,z;E,nrfg;M,ns;E,vn;B,j;B,nrt;
+昌:E,ns;E,nr;M,nr;B,nr;B,ns;M,ns;S,j;E,nrt;S,nr;M,l;M,nz;B,nz;M,n;B,a;E,nrfg;E,nz;B,nrt;M,i;B,n;M,nt;E,i;B,nt;
+趑:B,v;
+氐:S,g;
+锖:S,x;M,nr;E,nr;
+熙:E,n;E,nz;B,nz;B,i;M,i;M,nrfg;E,nrt;E,nrfg;E,t;B,z;E,nr;B,nr;B,n;M,ns;M,nt;
+倘:B,c;S,c;B,v;
+羝:S,g;
+帜:E,n;E,i;S,ng;M,i;S,q;E,v;E,nr;M,nr;
+斡:M,ns;B,v;M,nz;B,vn;
+蜢:S,x;E,n;E,nr;
+接:B,v;E,ad;S,v;E,v;B,c;E,b;B,n;B,d;M,c;M,n;B,l;E,n;M,i;B,i;E,vn;B,vn;M,l;E,i;B,j;E,nr;B,nz;M,nz;M,nr;B,b;M,b;M,j;E,l;
+账:B,n;S,n;E,v;E,n;M,b;E,l;E,vn;M,n;E,j;E,i;
+钫:S,g;E,nr;M,nr;
+垭:S,g;B,n;M,nr;E,nr;
+缲:S,v;
+宵:E,n;S,tg;M,t;E,nr;B,n;E,t;M,i;B,v;B,i;M,nr;
+收:B,n;B,v;E,v;S,v;M,n;E,n;B,vn;E,vn;M,i;B,i;M,l;E,nr;E,l;M,j;E,j;B,nz;E,i;B,l;M,nr;M,nz;B,j;M,b;B,t;
+挺:S,d;B,v;S,v;E,nr;E,a;B,a;E,z;B,i;M,z;M,nr;M,l;E,v;B,z;E,i;B,n;E,nrfg;M,i;
+烃:E,n;S,n;B,n;E,nr;M,nr;
+坂:M,ns;S,n;E,n;E,ns;B,nr;M,nr;E,nrt;B,nrt;B,ns;B,nz;
+织:E,v;E,n;M,n;E,nt;B,n;S,v;B,v;E,b;E,l;E,nz;M,nt;M,nz;E,j;E,nr;M,l;B,vn;M,i;B,ns;M,v;M,nr;B,b;M,b;M,ns;M,vn;E,vn;B,nrt;
+菥:S,x;M,nr;E,nr;
+桨:E,n;S,n;B,n;E,v;E,nz;M,nr;E,nr;
+短:B,b;S,a;B,n;E,v;B,a;B,z;B,v;E,z;E,n;M,j;M,z;E,i;E,a;M,n;M,i;B,i;M,l;M,b;B,q;B,nz;M,v;E,nz;E,l;E,j;M,nr;M,nz;B,j;B,vn;
+噬:E,v;S,vg;B,n;M,l;B,i;E,i;
+酮:S,g;E,n;E,nz;M,n;B,n;M,nz;
+婴:B,n;S,ng;E,n;E,nr;M,n;E,v;M,nr;E,nrt;M,nz;B,j;B,nz;
+唁:E,v;B,n;E,vn;
+逃:B,v;S,v;E,v;E,i;B,n;M,i;B,i;M,j;M,n;E,vn;E,l;M,nz;B,j;B,vn;B,nz;
+包:B,v;S,v;B,n;E,n;B,nr;E,v;B,vn;M,n;E,m;B,ns;M,l;B,nz;S,m;M,i;E,i;B,i;B,l;M,nr;E,l;E,nr;E,j;E,nz;B,nt;B,b;M,nz;E,a;E,vn;B,nrfg;M,ns;
+萋:S,x;
+憎:B,v;S,vg;E,n;E,a;M,i;E,i;S,ag;M,nr;
+蠓:S,n;B,n;
+瘗:S,g;
+厚:S,a;E,a;B,n;B,a;E,nr;B,z;M,z;E,n;M,nr;E,i;B,nz;M,i;B,i;B,v;E,v;M,n;E,l;E,d;B,d;M,l;E,b;B,nt;E,z;
+妞:B,n;S,ng;E,nr;E,n;M,n;E,v;M,nr;
+芤:B,n;
+含:S,v;B,n;E,v;B,v;B,a;B,nr;B,i;B,vn;E,nr;M,nr;M,z;B,z;E,n;B,nz;M,n;B,l;M,a;M,i;M,l;B,ns;B,nrt;
+霭:S,ng;E,n;E,nr;E,z;B,z;M,nr;
+悸:E,v;E,i;B,vn;E,n;
+哀:B,v;S,vg;B,a;B,n;E,a;E,an;B,an;E,v;M,nr;E,nr;M,i;B,ns;B,i;B,nz;B,vn;B,z;M,l;S,ag;
+祉:E,n;S,ng;E,nr;
+浑:B,n;S,a;B,a;B,ns;E,n;B,z;E,z;E,nr;B,i;B,l;M,z;M,nr;E,v;E,a;M,i;M,l;
+痖:S,g;
+彝:S,j;B,nz;M,ns;E,nr;M,nr;B,ns;B,n;B,l;
+柢:S,g;E,i;
+淦:S,nr;E,nr;M,nr;
+毪:S,g;
+牯:B,n;M,n;
+晷:S,g;E,n;E,i;
+胸:B,n;S,ng;B,s;E,n;B,i;M,n;E,v;M,i;E,i;E,l;B,vn;E,d;S,n;B,j;M,nr;B,l;M,l;
+徇:S,vg;B,v;B,i;M,i;B,l;
+颉:S,nr;M,nr;E,nr;E,nz;B,v;
+蚍:B,i;B,n;B,l;
+炙:M,i;B,i;B,a;E,v;B,v;E,i;
+报:E,n;B,n;B,v;S,n;E,v;E,r;E,vn;E,nz;M,n;B,vn;M,i;E,nt;E,j;M,nt;E,nr;M,l;B,l;E,i;B,i;E,l;M,nr;B,ns;E,ns;B,nz;M,nz;
+谦:M,nr;E,nr;B,a;S,nr;B,v;S,vg;B,i;E,nrfg;B,n;M,i;B,l;E,nrt;M,ns;
+岱:E,nrfg;B,ns;B,nrt;B,n;M,nrfg;E,ns;M,ns;
+媵:S,g;
+访:E,v;B,v;S,v;M,n;E,n;B,vn;E,i;E,j;B,n;M,l;E,nr;E,vn;M,nr;M,nt;B,i;B,nr;B,j;M,nz;
+栾:B,nr;B,ns;S,nr;M,nr;E,nr;
+镀:B,n;B,v;S,v;E,v;M,n;E,n;E,vn;B,nz;
+燃:B,n;B,v;E,v;S,vg;M,n;E,b;B,i;E,a;M,l;E,i;E,nr;M,nz;E,vn;M,nr;E,nz;B,j;M,b;
+旋:B,v;B,n;S,d;E,v;E,n;M,n;B,d;E,vn;E,nr;M,i;B,b;M,nr;M,b;B,nz;M,ns;B,l;B,i;
+婊:B,n;
+蝌:B,n;
+描:B,v;E,v;E,n;S,v;M,n;M,i;B,n;E,nr;B,vn;B,i;
+赐:S,v;E,n;E,v;M,nr;B,v;E,nr;E,vn;B,vn;M,i;M,l;M,n;
+乒:B,n;S,j;B,j;M,o;B,o;M,nt;E,nr;E,j;
+黝:B,z;E,z;M,z;B,n;
+察:E,v;M,n;E,n;S,j;B,v;E,vn;E,b;E,nr;M,nt;B,ns;B,n;M,ns;S,vg;M,nr;M,i;B,i;M,j;B,nrt;E,l;M,nz;E,ns;M,l;E,nrt;B,vn;B,l;
+若:S,c;B,m;E,c;M,nr;M,i;B,nr;E,nr;B,i;B,c;B,r;E,n;B,nrt;E,v;E,i;B,v;B,n;B,ns;M,l;E,z;M,v;M,ns;E,nz;E,d;M,m;E,nrfg;B,l;S,v;E,l;
+遮:B,v;S,v;M,ns;B,i;B,n;M,v;E,l;B,l;B,nz;M,i;M,l;B,vn;B,ns;M,nr;
+葶:S,x;B,n;E,nr;
+惹:S,v;B,v;E,v;B,i;B,l;B,a;M,i;M,ns;E,ns;E,nr;M,nr;E,a;M,l;
+艺:B,n;E,n;M,n;M,l;S,ng;E,nr;E,v;M,nr;M,nt;E,i;E,l;E,nz;B,nz;M,nz;M,ns;E,j;B,l;B,v;E,nt;B,j;M,i;M,nrfg;B,i;M,b;M,j;E,nrt;E,nrfg;
+佼:B,n;M,n;
+衾:S,g;E,nr;
+吁:E,v;M,i;S,vg;E,i;M,z;E,z;B,v;S,e;E,nr;M,n;S,o;M,nr;
+皂:E,n;B,n;M,l;M,n;B,v;M,i;B,ns;B,nz;
+茏:S,x;E,z;M,nr;
+褓:E,n;M,i;
+咖:B,n;B,nz;
+增:B,v;B,n;S,v;E,v;M,nr;E,nr;B,vn;M,i;E,i;M,n;B,nz;B,ns;M,l;E,ns;B,b;M,j;E,nrt;B,l;E,l;E,vn;M,b;
+愣:S,v;B,v;E,v;M,z;E,z;B,z;E,i;
+瞬:B,t;M,m;E,t;B,i;M,l;M,i;M,t;E,d;B,d;B,l;B,n;
+箴:B,n;E,nrfg;
+踽:B,z;E,z;B,i;M,i;
+瑁:E,nr;E,n;S,x;
+鳆:S,x;
+胎:E,n;B,n;S,q;E,v;M,n;B,b;E,m;E,vn;E,l;M,i;E,nt;E,nr;E,nz;S,m;B,i;B,nz;M,vn;E,i;
+轧:E,v;S,v;B,v;B,n;M,n;E,vn;M,nz;M,nr;E,j;B,nz;E,nr;
+韬:B,n;B,i;M,nrfg;B,v;E,nrfg;B,nr;M,nr;M,i;B,nz;
+獯:S,x;B,nz;
+僮:E,n;B,n;
+杷:E,n;S,x;M,n;M,ns;
+瘀:S,g;E,l;E,n;B,n;E,v;M,n;
+醅:S,g;
+辑:E,n;S,q;M,n;B,v;E,l;E,vn;E,nr;S,m;M,l;S,vg;E,m;B,n;M,nr;E,v;B,vn;
+渐:E,d;S,d;B,d;B,v;B,n;E,nr;M,i;M,nr;B,i;M,l;E,i;E,l;E,nrfg;
+霖:E,nr;S,nr;M,nr;E,n;B,n;
+刘:B,nr;S,nr;B,nrfg;M,nr;E,nr;B,ns;B,n;B,nrt;B,nt;B,nz;B,j;E,ns;M,ns;
+尜:S,x;
+褪:S,v;B,v;
+邯:B,ns;B,i;B,n;B,nt;
+献:E,n;S,v;M,nr;B,v;E,v;M,n;E,nr;B,nrt;B,n;B,ns;M,nt;E,i;M,i;M,v;M,l;B,l;
+款:E,n;E,v;S,n;E,m;S,m;B,n;M,n;B,v;E,b;E,j;E,r;E,l;E,vn;M,nz;E,nz;M,l;E,nr;B,vn;B,a;E,a;B,l;
+陀:M,n;B,n;E,n;E,ns;M,ns;B,nrt;E,nrt;E,nz;E,a;E,nr;
+狃:S,g;
+遄:S,g;M,i;
+糇:S,g;
+衔:S,v;E,n;B,v;E,v;M,nr;E,nr;M,i;B,n;M,ns;M,n;E,vn;
+哗:S,vg;B,o;E,v;B,v;B,z;M,o;B,i;M,z;M,i;S,o;E,nr;M,nr;
+廛:E,n;S,g;
+恤:E,v;M,n;E,vn;B,n;
+诩:S,g;E,nr;E,v;M,nr;
+翱:B,v;B,vn;M,nr;
+蝶:E,n;S,ng;B,n;M,n;E,nr;B,nz;M,nr;M,ns;E,i;
+腺:E,n;B,n;M,n;M,l;E,l;
+嬉:B,v;S,vg;B,i;B,l;E,nr;M,nr;E,i;B,n;B,vn;
+禊:S,g;
+掎:B,i;S,g;
+休:B,v;S,v;E,v;B,vn;B,n;E,nr;E,vn;E,l;M,n;E,i;B,ns;B,i;M,nr;M,v;B,nz;E,n;M,l;B,nrt;M,t;E,ns;B,t;M,ns;E,j;E,nz;B,nt;M,j;
+鲜:E,ns;B,n;B,a;E,a;S,a;M,nz;M,ns;B,z;M,n;B,nr;B,v;E,n;M,nt;E,i;B,i;M,i;E,nr;E,vn;E,v;M,nr;E,b;B,b;B,l;B,nz;M,j;E,l;B,nrt;B,ns;
+砟:B,n;
+实:B,v;B,n;B,d;E,d;E,n;E,a;E,v;E,ad;S,a;B,vn;M,l;M,n;M,z;E,nr;E,i;E,z;B,a;M,i;B,z;B,i;B,l;M,nr;M,nz;E,l;B,b;M,ad;E,nz;M,nt;B,nz;B,s;E,b;B,t;M,d;E,nrfg;E,vn;B,ad;B,nt;
+肤:E,n;M,n;S,ng;B,n;E,v;M,nz;B,a;E,i;M,i;E,nr;E,nz;
+氧:M,n;B,n;B,v;S,n;E,n;M,nz;E,v;E,vn;E,b;B,vn;E,nr;M,nr;B,nz;
+侦:B,v;B,n;S,vg;E,j;B,vn;B,l;M,nz;E,nr;E,v;M,n;B,nz;M,nr;
+锭:E,n;S,q;E,m;B,n;E,nz;S,m;E,nr;M,nr;E,v;
+纰:B,n;S,v;
+碴:E,n;E,l;M,n;B,n;E,v;M,v;
+茹:B,nr;E,nr;S,nr;M,i;M,nr;B,i;B,nrt;E,n;M,ns;E,ns;
+主:B,n;B,b;M,n;E,v;E,n;S,n;B,v;E,a;B,ad;B,vn;M,nz;E,i;M,nt;E,nr;M,l;M,ns;M,nr;B,l;M,v;B,j;E,l;B,nrt;M,b;M,vn;M,i;E,ns;E,nrt;E,vd;
+贽:E,nr;S,g;
+沼:B,n;E,n;S,ng;E,nr;M,nr;E,nrt;
+睁:S,v;E,d;M,d;B,n;E,i;M,nr;M,i;E,nr;
+煅:S,v;B,v;
+等:S,u;B,v;B,u;E,u;E,b;B,n;E,v;E,a;E,m;E,r;M,n;M,l;S,m;E,d;B,b;E,n;E,mq;B,vi;B,vn;B,i;B,z;E,l;M,b;B,ns;B,l;M,nr;E,i;M,vn;M,nt;E,vn;M,nz;M,i;E,nrt;M,v;B,nz;
+鹛:S,g;
+嵝:S,g;E,ns;E,nr;
+既:S,c;B,c;B,b;M,i;B,i;B,n;B,t;E,nr;M,nr;B,l;
+癫:B,n;E,nr;B,a;S,vg;E,v;M,z;E,z;M,n;B,nz;
+铬:S,n;E,n;B,n;M,n;E,nr;B,nz;E,nz;S,ng;M,nz;
+灯:E,n;B,n;S,n;E,v;M,i;M,n;E,nr;E,vn;B,t;E,nz;B,i;B,ns;M,nz;M,nr;E,ns;M,l;E,i;E,l;B,nz;
+叮:B,v;S,v;B,o;M,l;M,o;E,nr;B,l;M,i;M,nr;
+已:S,d;B,d;B,v;E,d;E,y;E,v;B,nrt;E,a;M,l;E,i;E,l;M,i;E,r;M,n;B,t;B,vn;B,n;E,nr;M,nr;E,u;E,n;M,nz;
+笈:S,g;E,n;E,nr;E,v;
+阖:E,i;B,n;B,i;B,l;
+通:B,p;B,n;E,n;B,v;S,v;E,vn;B,d;E,v;B,j;E,a;B,vn;M,n;E,nz;E,nr;B,l;M,nt;B,nr;B,ns;B,a;B,z;E,ns;M,l;E,m;M,i;E,o;E,nt;E,i;E,l;B,i;B,nt;M,nr;M,ns;B,nz;M,z;E,z;B,nrt;E,j;E,d;S,m;M,nz;E,nrt;M,j;B,b;M,b;E,nrfg;
+粝:S,g;E,n;E,nr;
+檩:B,n;S,ng;E,nr;
+鞫:S,g;
+咭:S,o;
+醯:S,g;
+薷:S,x;E,n;E,nr;
+昶:E,nr;S,g;M,nr;
+樾:S,g;E,nr;M,nr;
+魈:S,x;E,n;M,nr;
+毓:S,g;M,nr;E,nr;B,nz;M,i;
+鳝:E,n;B,n;
+杠:B,n;E,n;S,v;E,v;E,nr;E,ns;M,nr;
+胥:B,nr;E,nr;S,nr;M,nr;B,ns;B,n;
+啬:E,a;S,ag;M,n;S,g;M,nr;
+绱:S,v;
+彰:E,v;S,ag;B,ns;B,v;E,i;E,nr;M,nr;M,n;E,a;E,l;
+奴:B,n;E,n;S,ng;M,n;B,l;B,v;E,nr;E,nrt;M,nr;B,vn;M,ns;B,i;B,nrt;
+泽:M,nr;E,n;E,nr;S,nr;M,n;M,ns;B,nr;E,ns;B,n;E,v;S,ng;B,nrt;E,nz;B,ns;E,nrt;M,i;E,i;M,nz;
+嘁:M,o;B,o;
+娉:B,z;M,z;
+脏:E,n;S,a;B,n;M,n;E,a;M,i;B,z;B,a;M,nz;M,l;E,ad;B,l;E,nr;M,nt;
+丑:S,a;B,n;B,a;E,n;E,m;E,v;E,nr;M,l;B,v;M,i;M,m;B,i;M,nr;E,t;B,t;B,l;M,nz;E,i;E,an;E,j;S,j;M,t;E,a;
+缛:S,g;E,a;M,i;
+挣:B,v;S,v;E,v;M,i;E,nr;
+洧:S,g;E,nr;B,nrt;M,nr;
+亦:S,d;B,v;E,nr;M,nr;M,i;B,nr;M,l;B,i;B,r;E,d;B,ns;
+讨:B,v;E,v;S,v;M,n;B,i;E,vn;B,n;B,vn;M,i;B,l;B,a;E,i;M,l;B,b;
+疬:E,n;S,x;
+鸱:S,g;B,n;
+羰:B,n;S,x;
+船:S,n;B,n;E,n;B,s;E,v;E,vn;M,n;E,j;M,i;E,nz;B,vn;E,l;B,b;E,nr;M,nt;B,ns;B,j;B,nrt;M,nz;M,nr;E,i;M,l;E,mq;B,l;
+掸:S,v;B,ns;M,n;B,n;
+铂:S,n;B,n;E,nr;M,nr;
+凄:B,a;S,ag;B,z;B,an;E,a;B,i;M,z;M,i;E,i;E,z;
+苎:B,n;
+俐:E,a;E,nr;E,i;S,x;M,i;M,nr;E,l;
+桕:E,n;S,g;M,n;
+镗:S,o;B,n;E,nr;
+盖:S,v;E,v;E,n;M,n;B,nr;B,n;E,nr;B,v;M,i;B,nrt;M,nr;B,ns;E,nrfg;E,ns;E,nrt;E,l;M,ns;B,i;M,l;B,nrfg;B,nz;E,vn;E,nz;
+竞:B,vn;B,n;B,v;S,vg;B,d;E,nr;B,l;M,nr;M,l;E,v;M,i;M,n;B,a;E,d;
+荣:E,v;E,nr;B,nr;B,n;S,ag;M,nr;E,a;B,v;B,a;E,n;M,n;B,i;S,nr;E,i;M,i;B,nz;M,nrfg;B,ns;E,l;M,l;E,ns;M,ns;E,nrfg;E,nrt;E,nz;B,nrfg;B,l;M,nt;B,nrt;
+擢:S,g;B,v;E,v;E,nr;B,i;
+赧:S,g;M,nr;E,a;B,v;E,nr;M,nrt;
+滦:B,ns;S,j;E,ns;M,l;M,nt;M,nr;B,nrt;M,ns;E,nr;M,j;
+睫:B,n;E,i;M,n;B,nz;E,n;
+敷:S,v;B,v;E,v;M,i;E,nr;B,i;B,n;M,nr;B,nz;M,n;B,vn;
+馁:E,a;S,vg;E,v;E,i;
+砀:B,ns;S,g;E,nr;
+龅:B,n;
+亏:B,vn;S,v;E,v;B,v;E,d;B,n;E,n;M,l;B,d;E,l;M,i;B,a;E,i;
+膑:E,nr;S,g;
+昔:B,t;S,tg;E,t;M,nr;M,i;E,nr;E,n;E,i;B,ns;E,d;
+尘:E,n;S,ng;B,n;M,i;B,i;E,nr;E,v;M,n;E,i;B,v;E,vn;M,nr;E,nz;E,l;M,l;M,nz;
+锞:S,g;M,nr;E,nr;
+两:B,m;S,m;B,n;B,f;E,m;M,m;B,r;B,j;B,b;B,ns;M,i;E,n;M,n;B,l;B,i;M,l;B,z;M,j;B,t;E,i;B,v;M,nr;B,nz;M,nt;B,vn;M,nz;E,l;E,nr;M,v;B,nrt;
+斩:S,v;B,v;B,i;E,v;M,i;M,l;E,b;M,n;E,nz;
+钳:S,v;B,n;B,v;E,n;E,nr;M,n;B,i;E,nz;
+放:B,v;E,v;S,v;M,n;B,n;M,nt;M,nz;E,l;E,nr;B,d;M,t;M,i;B,l;B,nrfg;B,a;B,vn;E,i;E,z;E,a;B,i;M,l;M,nr;M,b;E,b;M,ns;E,vn;B,j;E,nrfg;E,nz;M,v;E,ns;M,vn;B,nz;E,n;B,ns;M,j;
+鹄:S,ng;E,nr;M,nr;E,n;M,i;M,l;
+兆:M,nr;S,m;E,n;B,q;E,nr;E,nz;S,vg;B,n;E,i;B,nz;M,nz;E,m;S,ng;M,nrfg;M,n;B,qe;B,v;
+棋:B,n;S,n;E,n;M,i;E,v;E,nr;E,l;M,nr;B,v;M,n;B,i;E,i;M,nt;B,ns;B,j;
+坊:E,n;S,ng;E,ns;B,n;E,nr;E,nz;M,ns;M,nr;M,n;B,ns;M,nz;M,b;
+滏:B,ns;S,g;E,nr;
+虔:B,a;B,n;E,nrfg;
+囟:B,n;
+桠:E,n;B,n;
+迥:B,a;B,i;S,ad;E,nr;S,ag;B,d;B,l;M,nr;
+藩:S,ng;E,nr;B,ns;B,n;M,nr;E,n;
+淹:B,v;S,v;E,nr;E,n;M,l;B,n;B,nrt;E,v;
+轺:S,g;
+揽:S,v;M,l;E,v;B,v;E,l;E,i;E,nr;M,i;M,nz;M,nr;M,q;
+蕾:E,n;E,nr;M,n;S,nr;M,nr;M,nt;B,n;S,ng;
+唉:S,e;B,i;B,v;
+踏:S,v;B,v;E,v;B,a;B,n;M,d;M,i;M,n;E,nz;M,z;B,z;B,vn;B,i;M,nr;B,l;E,vn;M,b;B,ns;
+涎:E,v;M,i;B,n;M,n;B,v;B,i;
+排:B,v;E,v;B,n;S,v;E,vn;E,m;B,vn;E,n;B,nz;E,s;E,d;S,m;B,i;M,l;M,j;B,l;M,i;E,j;B,t;M,n;E,nt;E,nr;B,ns;M,nt;B,j;M,v;M,ns;B,a;
+稗:S,ng;B,n;B,i;E,n;M,nr;
+妖:B,n;B,a;E,n;B,nz;B,i;M,n;B,v;M,i;M,z;B,z;B,nrt;
+瀛:S,g;M,nr;E,nr;B,ns;E,n;B,n;B,nz;
+瘟:B,n;S,v;E,n;M,n;M,z;
+窬:S,g;E,v;
+鄱:B,ns;M,ns;
+皴:S,n;S,v;B,v;B,n;
+费:E,vn;E,n;M,n;B,n;E,v;S,v;B,nr;B,a;B,ns;B,v;M,l;B,nrt;M,nr;E,nr;M,i;B,l;E,nz;E,d;B,i;M,nrt;M,nt;E,i;E,a;B,nz;E,nrt;E,an;E,j;M,nz;E,l;B,nrfg;M,v;B,ad;
+沸:B,n;B,v;M,i;S,vg;B,i;E,v;E,i;M,nr;B,nz;
+押:E,v;S,v;E,vn;B,v;B,n;M,n;B,a;M,nr;E,nr;E,n;B,vn;
+祁:B,ns;B,nr;S,nr;E,nr;B,n;M,nr;B,nrfg;
+罅:B,n;
+哈:M,ns;S,j;B,ns;B,nr;B,nrt;E,o;B,o;M,nr;M,l;B,l;B,nt;B,nz;B,n;M,n;E,nrt;E,nr;E,ns;M,nrt;M,nt;M,o;M,nz;E,nz;M,z;E,z;B,j;E,e;M,v;E,n;B,z;B,e;E,v;B,v;E,i;B,nrfg;
+跎:S,x;E,v;M,i;
+慑:E,v;S,vg;E,n;E,vn;M,n;B,v;
+遛:S,v;B,v;E,v;
+陟:S,g;M,ns;M,nr;E,nr;B,i;E,ns;
+痞:B,n;E,n;M,n;
+佥:S,g;E,nr;M,n;B,n;
+懦:S,ag;B,ad;E,a;B,n;B,a;M,nr;
+硫:B,n;S,n;B,v;E,n;E,v;M,n;M,nz;B,nz;E,nz;E,nr;B,ns;
+差:B,n;S,a;E,n;B,l;E,v;E,a;B,d;B,v;M,i;M,l;E,nr;B,i;M,n;B,vn;E,l;E,i;E,vn;B,nz;B,a;B,nrt;
+史:E,n;S,ng;B,n;B,nr;M,n;E,nr;M,l;B,b;M,ns;M,nt;E,nz;M,nr;B,i;E,v;E,l;B,ns;M,i;M,j;E,i;B,nrt;B,nz;B,l;E,b;M,nrt;B,nrfg;E,ns;E,j;M,nz;
+恻:B,i;S,ag;E,i;E,a;B,v;M,nr;
+俺:S,r;B,r;E,nr;
+颁:B,v;S,vg;B,vn;E,nr;M,nr;B,n;E,vn;
+缄:S,vg;B,v;M,i;E,nr;B,vn;
+钉:S,v;B,n;E,n;M,i;B,l;E,nr;E,i;E,l;M,l;E,nz;M,n;M,v;M,nr;B,v;
+侏:B,t;B,n;B,nr;B,b;
+蚕:B,n;E,n;S,n;B,v;M,n;E,nr;M,nr;E,nz;B,i;M,l;
+朔:S,j;B,n;M,i;E,ns;B,t;E,nr;B,ns;E,nrfg;M,nr;M,ns;E,nz;E,t;B,nz;E,a;
+溥:E,nr;B,nr;M,nr;S,nr;
+伤:E,v;S,v;B,n;B,v;E,n;B,a;B,vn;E,a;M,n;E,vn;E,an;E,i;B,i;M,i;B,l;E,l;B,s;E,nr;M,nz;M,j;M,nr;B,an;M,l;
+耦:B,vn;
+撩:S,v;B,v;B,a;
+讷:B,ns;E,z;B,z;E,a;M,ns;
+膻:S,a;E,a;B,n;E,i;
+渺:B,a;S,ag;E,a;E,i;B,i;M,i;B,l;E,nr;E,z;M,nr;
+齄:S,g;
+腐:B,an;E,n;B,v;S,a;B,n;B,a;M,n;E,v;E,a;M,nz;M,l;E,nz;B,b;M,v;M,i;E,vn;E,l;S,vg;B,nz;M,ns;E,nr;E,i;
+鳙:B,n;
+凛:B,z;M,i;E,i;E,z;B,a;M,nr;
+域:E,n;E,ns;S,n;E,nr;M,n;E,l;B,n;M,nr;M,vn;B,s;S,ng;E,nrt;M,v;
+楠:E,nr;B,n;S,n;M,nr;S,nr;B,ns;E,nrfg;B,nrt;
+竭:B,d;E,v;E,i;E,n;S,an;B,i;S,ag;B,v;M,i;E,a;B,l;E,nr;M,n;
+孬:B,n;
+兰:E,ns;E,nr;M,ns;M,nr;M,nz;B,nr;S,j;M,n;B,ns;E,n;M,nt;B,n;B,nrt;E,nz;E,nrt;M,nrt;B,nz;S,nr;E,nrfg;B,nt;E,j;B,q;S,ng;M,m;B,j;B,v;M,i;B,m;E,i;
+拽:S,v;E,l;E,nr;
+帅:E,n;E,nr;S,a;B,nr;M,n;E,v;M,nr;S,nr;B,a;B,n;S,vg;E,nz;S,ng;
+吉:B,nr;B,ns;M,nr;B,n;S,j;E,nr;M,ns;B,nrt;E,ns;B,a;M,nz;E,nrt;B,nz;B,nt;E,i;M,i;M,n;B,i;E,n;M,nrt;E,z;B,l;E,v;M,nt;B,j;E,l;M,l;E,nz;E,nrfg;
+蔓:B,v;E,n;B,n;M,n;E,v;B,l;
+抒:B,v;B,n;B,vn;S,vg;M,i;E,nr;
+庚:E,nr;M,nr;S,nr;B,m;E,nrt;B,nz;B,n;M,n;E,l;E,nz;E,v;M,nz;M,m;B,nrt;
+真:B,d;S,d;B,n;B,a;E,ad;E,nr;E,v;M,nr;E,a;M,n;B,nr;E,nz;E,d;M,l;M,i;B,i;E,n;B,l;E,b;E,i;M,nz;B,nz;E,c;M,z;B,nrt;B,b;E,vn;E,nrt;E,z;E,l;B,z;M,d;M,ns;B,v;M,a;M,nt;B,nt;E,nrfg;M,nrt;
+薨:S,g;E,nr;
+夫:E,n;B,n;E,nr;M,nr;S,n;E,nrt;E,ns;M,nz;M,n;M,nrt;B,ns;E,v;S,ng;M,i;M,ns;E,nz;B,nrt;M,l;M,nt;E,i;E,l;B,i;E,nrfg;B,l;
+箬:B,n;
+弯:B,v;S,v;E,v;B,n;E,n;M,z;B,z;S,n;M,i;M,v;M,n;S,a;E,l;M,l;E,vn;E,z;E,i;E,nr;B,a;
+唳:E,i;S,g;
+阵:E,m;B,n;S,ng;E,n;M,m;E,v;E,nr;B,q;B,v;E,q;B,s;M,l;E,i;M,i;M,t;M,nr;M,n;E,l;B,vn;B,nrt;E,j;M,nz;M,nt;E,nz;E,vn;M,r;M,b;S,m;M,j;
+涸:E,v;B,i;
+髂:B,n;
+苒:E,i;S,x;E,v;E,l;E,nr;
+晕:S,v;E,v;B,v;E,n;M,i;B,i;E,a;B,z;M,z;E,nr;M,n;M,l;B,l;E,i;B,n;
+屙:S,g;
+绚:B,a;B,i;B,l;
+瓞:S,g;
+赣:S,j;B,ns;E,j;M,nz;B,nz;M,nr;E,nr;B,n;B,f;S,nr;
+荧:B,n;E,z;B,z;B,a;M,nr;E,nr;
+惦:B,v;S,v;E,nr;
+跸:E,v;S,g;
+板:E,n;B,n;S,ng;M,n;E,v;E,nz;E,a;E,nr;B,b;B,ns;E,ns;M,i;B,nz;B,a;M,nr;M,l;B,nrt;M,ns;B,i;M,nz;E,l;M,nrfg;E,i;E,j;E,nrt;M,v;M,z;E,z;
+稀:B,a;S,a;B,n;B,v;E,a;B,z;E,d;B,l;M,l;M,z;E,i;B,b;B,ns;E,nr;B,i;B,nz;E,n;B,vn;M,nr;M,v;M,i;E,l;E,v;E,nz;S,ng;M,n;M,nz;
+栌:S,x;E,n;E,nr;
+成:E,v;B,v;S,v;B,n;B,a;E,nrfg;E,nr;E,m;B,ns;M,l;M,n;B,nr;E,n;M,i;M,nr;M,nz;B,vn;E,nrt;B,i;E,vn;E,i;S,m;B,d;E,b;E,ns;E,nz;B,l;M,nrfg;B,b;E,l;B,nz;B,t;M,j;M,v;M,ns;B,j;B,nt;E,a;B,m;M,a;B,nrt;M,m;M,nrt;B,nrfg;E,d;B,mq;M,nt;
+搔:S,v;B,v;M,i;B,i;M,n;
+帘:E,n;B,n;S,q;S,ng;M,n;M,i;E,l;E,nr;E,v;E,nz;
+倜:E,nr;S,x;M,i;B,a;M,nr;
+霞:E,nr;E,n;S,n;M,nr;B,n;M,ns;S,ng;E,nrfg;E,ns;B,ns;M,i;M,nz;B,l;M,l;E,l;E,i;S,nr;B,nz;
+殡:B,v;E,v;B,n;B,vn;E,vn;
+缮:E,v;B,v;
+隳:S,g;
+喵:S,o;
+袷:S,x;B,n;
+蒿:S,nr;E,nr;B,n;E,n;M,nr;
+练:E,vn;S,v;B,v;E,a;E,v;E,n;M,n;B,nr;B,n;M,i;E,nr;B,a;M,nr;B,vn;E,i;B,ns;E,nrfg;M,l;E,d;M,ns;B,nz;
+奂:S,g;E,nr;E,i;M,nr;
+陈:B,nr;S,nr;B,v;B,nrfg;B,n;M,i;E,nr;B,a;M,nr;E,v;E,n;B,ns;E,l;M,n;B,i;E,ns;B,nrt;B,nz;M,nz;
+啊:S,y;B,e;E,nr;B,n;M,nr;
+行:E,v;B,n;E,n;S,v;E,j;M,n;E,nt;B,v;E,vn;B,vn;E,a;E,d;E,m;E,r;E,b;E,nr;B,j;M,i;E,i;M,nr;M,ns;M,l;M,nt;E,ns;E,l;B,nr;M,b;B,i;S,m;M,v;M,nz;B,d;B,l;B,t;B,nz;E,nz;B,f;M,t;E,mq;M,mq;B,a;B,ns;E,nrfg;E,nrt;B,nrfg;M,vn;M,nrfg;M,j;
+低:S,a;E,v;B,v;B,n;E,a;B,a;E,n;B,d;M,n;B,b;B,s;M,j;E,b;E,h;B,i;M,z;M,s;B,an;B,j;B,nz;B,l;B,z;E,i;B,ad;M,l;M,b;E,z;E,j;E,l;M,i;
+哟:S,y;E,e;E,nr;
+诡:B,a;S,ag;B,n;M,i;B,v;B,i;M,nr;B,vn;
+代:E,t;E,n;B,n;B,v;E,v;S,q;E,m;M,n;M,vn;B,vn;M,nz;E,nr;B,nr;M,i;M,nr;M,nt;M,l;S,m;E,i;E,b;E,j;E,l;E,f;M,ns;B,l;E,mq;M,v;M,mq;E,nrt;M,m;M,j;E,vn;M,nrt;B,i;B,nrt;B,ns;B,nz;E,nt;E,nz;B,d;B,j;B,nrfg;M,b;M,nrfg;
+汤:S,n;B,nr;E,n;B,n;B,ns;E,nr;M,nr;E,nz;B,nz;E,v;M,n;M,i;B,nrt;E,i;B,nrfg;M,ns;M,l;E,l;B,j;M,nt;
+晨:E,t;B,n;S,nr;E,nr;E,nz;M,nz;M,nr;S,tg;B,t;B,v;M,i;E,nrfg;B,i;M,nt;
+秭:B,ns;S,g;
+塬:S,ng;E,nr;E,ns;M,nr;
+酲:S,g;
+蝾:B,n;
+圉:S,g;M,nr;
+谏:S,vg;E,nr;E,v;B,v;E,vn;M,nr;E,l;M,i;E,i;B,n;B,ns;
+澎:B,ns;B,v;B,n;M,i;E,nr;S,j;M,nr;S,nr;M,l;
+砗:S,x;B,n;
+渣:E,n;S,n;B,nt;B,nz;B,n;M,n;B,ns;E,nr;M,nt;E,nz;M,nr;
+性:E,n;B,n;S,n;E,b;M,n;E,d;M,l;E,nr;E,v;M,v;M,i;E,l;E,vn;B,vn;B,a;E,nz;E,a;S,ng;M,nr;M,vn;E,j;E,i;B,v;M,nz;M,t;B,l;B,i;
+蚨:S,x;M,nz;
+犰:B,n;
+锵:E,a;S,o;M,i;M,o;E,o;E,nr;M,nr;
+悼:M,n;E,v;B,v;S,vg;M,nr;B,n;E,vn;B,vn;
+峄:S,g;E,nr;B,ns;
+迎:B,v;S,v;E,v;B,d;M,nr;B,vn;B,i;B,nr;E,nr;B,l;B,n;E,l;E,i;M,l;E,vn;M,n;B,ns;M,i;B,j;
+敕:S,ng;B,n;S,vg;E,nr;B,ns;
+忮:S,g;
+桷:S,g;M,n;
+胼:B,n;B,i;
+骁:B,a;B,n;B,i;M,nr;
+鲅:B,n;B,ns;
+眈:E,i;M,i;S,x;
+袍:E,n;S,ng;B,n;M,i;M,n;B,i;
+芑:S,g;E,nr;
+弘:B,nr;E,nr;M,nr;S,nr;B,v;B,t;B,n;E,a;B,nz;M,nrfg;
+炝:S,v;
+蠢:E,a;S,a;B,n;B,i;M,i;B,a;B,v;E,nr;M,nr;
+沥:B,n;S,ng;M,i;E,o;E,nr;M,z;E,z;M,nr;M,n;B,v;E,nz;E,n;M,ns;B,nz;
+励:E,v;E,vn;B,n;B,i;S,nr;B,nr;E,nr;M,n;M,nr;B,v;S,vg;E,l;
+显:B,v;E,a;S,v;B,ad;B,a;B,n;E,v;E,nr;M,nr;B,i;B,nr;B,b;B,nz;M,n;M,i;M,l;E,nz;B,l;B,j;B,ns;E,n;M,v;E,ns;M,nrfg;M,nrt;
+毋:B,l;S,d;B,nr;B,c;B,i;M,i;B,d;M,nr;S,nr;E,nr;
+告:E,n;B,v;E,v;S,v;M,n;B,n;B,l;M,i;M,l;E,nr;E,vn;E,l;M,nz;E,i;B,i;B,ns;M,t;E,j;M,nr;B,vn;
+乎:E,d;E,v;S,y;E,z;M,z;M,i;M,l;S,p;E,i;E,a;E,l;E,nr;E,c;M,nr;E,vn;
+荐:E,v;S,vg;E,vn;M,n;B,v;E,nr;E,i;E,n;M,nr;B,n;M,nz;
+染:E,v;E,vn;B,n;M,n;S,v;B,v;E,n;E,i;E,b;E,nr;E,nz;M,l;B,vn;B,nz;M,nz;E,l;M,nr;M,t;M,b;
+姗:B,i;M,i;S,nr;E,nr;M,nr;
+罘:S,g;E,ns;M,ns;
+叛:B,v;B,n;E,v;M,i;E,vn;B,vn;M,n;E,i;
+郝:B,nr;S,nr;E,nr;M,nr;B,nrfg;
+煜:E,nrfg;
+嗟:B,v;B,i;E,v;M,i;
+俣:S,x;M,n;M,nr;E,nr;
+蛩:S,g;
+杨:B,nr;S,nr;E,nr;B,n;E,n;B,nrfg;M,nr;B,ns;M,n;E,nz;M,ns;B,nz;E,ns;M,i;E,i;M,nz;E,nrfg;B,nrt;B,l;
+狱:E,n;E,v;S,ng;B,s;B,n;E,vn;E,i;M,n;E,nt;M,i;E,ns;
+印:B,ns;B,n;S,v;B,v;E,v;E,n;B,nz;B,vn;B,nr;M,n;M,nt;E,nr;B,nt;B,j;M,nr;E,nz;E,vn;M,l;E,i;M,nz;E,b;M,j;E,l;M,i;B,nrt;
+滹:B,ns;
+豺:B,n;B,l;B,i;
+虾:S,n;E,n;B,n;E,nr;M,nr;B,i;E,nz;M,n;
+威:B,vn;B,n;E,n;E,nr;E,ns;B,ns;S,ng;B,nrt;S,nr;B,a;M,ns;M,nr;E,v;M,n;B,v;B,nz;E,nz;B,i;E,i;M,l;B,nr;M,nt;M,i;E,vn;B,nt;E,l;M,nrt;M,nz;B,l;E,nrt;E,nrfg;
+嘉:S,j;M,nr;B,nr;B,ns;E,nr;B,t;B,nz;B,n;M,ns;E,ns;E,nz;B,v;E,j;E,a;B,vn;B,nrt;M,nz;M,nt;B,nt;E,nrt;M,n;
+蜓:E,n;S,x;M,i;E,nr;
+悒:B,z;E,a;E,z;
+猛:S,d;B,d;E,a;B,a;B,v;B,n;E,nr;S,a;M,i;M,l;B,t;B,ad;E,ad;M,nr;E,n;B,vn;B,ns;M,v;E,an;B,nt;
+岚:E,nr;S,nr;B,ns;M,nr;E,ns;E,nrt;E,n;
+生:B,vn;E,v;B,n;E,n;B,v;S,v;M,n;E,nr;E,b;B,l;E,an;M,l;M,nt;M,i;B,a;E,i;M,v;E,vn;M,nr;B,nr;E,d;E,a;B,t;B,i;E,nz;M,t;E,m;M,nz;B,j;E,nrt;M,z;E,z;E,l;B,d;E,t;E,j;M,b;M,j;B,b;E,r;E,nrfg;M,ns;B,nz;E,ns;M,d;M,m;M,a;
+愧:E,a;E,v;S,vg;E,i;B,a;E,d;M,v;B,v;B,n;M,i;M,l;E,nr;B,ad;E,l;M,nr;E,vn;
+螨:S,g;E,n;M,n;B,n;
+现:E,v;B,t;B,n;S,tg;B,v;B,s;B,vn;B,b;B,d;M,n;E,i;E,vn;M,j;E,nr;M,l;B,i;M,nr;M,b;E,j;E,z;B,nt;M,nt;E,l;M,i;M,ns;B,a;M,v;M,nz;B,l;E,n;
+圳:E,ns;M,ns;M,nt;M,n;
+疴:E,n;S,g;
+踹:S,v;
+耽:B,v;S,nr;E,nr;B,a;
+铊:S,g;
+扑:S,v;B,v;B,o;E,n;E,v;B,n;B,i;M,n;B,l;M,z;E,z;B,z;M,l;M,i;E,vn;M,nr;B,a;
+竖:S,v;B,v;B,n;E,d;M,i;S,n;M,l;M,nr;E,i;B,ns;
+腧:B,n;S,g;
+拦:B,v;S,v;E,v;B,d;B,n;M,nr;B,nz;B,vn;E,nz;E,nr;
+间:E,n;E,f;S,f;E,t;E,m;B,n;B,b;M,n;E,s;E,d;E,r;E,v;B,v;E,l;M,l;E,i;E,ns;S,m;B,d;M,nz;E,nr;B,l;E,j;M,nr;M,ns;M,i;E,nrt;B,nz;M,v;M,nt;M,f;E,nz;M,m;E,vn;B,vn;
+楷:B,n;E,nr;S,nr;E,n;S,ng;E,l;S,j;M,nr;
+迸:S,v;B,v;
+捻:S,v;B,n;E,n;B,v;M,n;
+臼:S,ng;B,n;E,ns;E,n;M,n;E,v;E,nr;E,i;M,ns;
+境:E,n;B,s;S,ng;B,n;E,s;E,vn;E,v;E,l;M,n;E,nr;E,j;E,i;M,nt;M,i;M,nr;M,v;M,t;B,f;E,nz;B,j;
+醉:S,v;E,nr;E,v;M,nr;B,n;B,v;B,nr;M,n;E,vn;M,i;E,i;B,i;E,nrfg;B,z;E,l;B,ns;M,l;E,nz;B,nz;
+辍:S,vg;B,v;E,v;E,l;
+渌:S,g;E,z;M,z;E,nr;M,nr;
+搐:E,v;S,g;B,v;
+鄞:S,g;B,ns;
+涡:B,n;E,n;B,ns;M,l;M,n;
+憩:E,v;S,vg;B,v;E,vn;E,nr;
+鲫:B,n;E,i;
+徭:B,n;M,l;B,l;
+喱:S,x;M,nz;E,n;M,n;
+邳:S,g;B,ns;M,ns;
+欺:B,v;S,vn;B,vn;M,i;B,i;B,n;S,vg;E,v;B,a;B,l;E,i;
+商:B,n;E,n;B,v;S,n;E,v;M,nt;B,nt;B,ns;M,n;B,nr;E,vn;M,j;B,t;B,l;E,nr;M,nz;B,j;B,vn;E,j;M,nr;M,l;E,nz;M,ns;M,b;E,t;M,i;M,t;B,nz;B,b;E,nt;E,l;
+半:B,m;S,m;M,t;B,n;E,m;M,ns;M,n;M,m;E,d;B,t;B,i;E,v;B,s;M,i;M,l;B,b;B,l;B,nr;B,ns;B,d;E,t;M,nr;E,f;B,mq;B,v;E,n;E,i;B,z;E,nr;M,v;M,z;M,j;B,nz;B,vn;
+癜:M,n;E,n;S,g;
+募:B,v;S,vg;E,a;E,v;E,vn;B,vn;B,n;M,n;
+池:E,n;S,ng;E,ns;B,n;E,nr;S,nr;B,nr;M,ns;M,n;S,q;E,l;B,ns;M,nr;B,nrt;E,nz;B,s;M,l;M,i;M,nz;E,nrt;E,mq;E,v;
+该:S,r;E,v;B,r;B,v;E,d;B,d;B,nz;M,i;B,n;E,nr;M,nr;
+恨:S,v;E,v;B,d;E,n;E,a;E,vn;B,nr;E,i;B,i;B,v;M,l;M,nz;B,n;M,i;M,nr;M,n;E,l;
+饮:B,n;S,v;B,v;E,n;E,v;M,n;B,l;M,l;B,i;M,i;E,nr;B,vn;E,i;B,j;E,nz;M,nr;B,ns;
+痱:B,n;
+赶:B,d;B,v;S,v;E,v;M,i;B,i;E,l;M,n;E,ns;B,t;
+柽:B,n;S,x;E,nr;
+腾:E,v;S,v;B,v;E,nr;E,i;E,n;M,i;M,nr;M,z;E,z;B,ns;M,ns;B,i;B,l;B,nr;E,vn;B,nz;M,n;E,l;M,l;B,n;E,nz;
+阇:B,n;
+疆:E,ns;B,n;E,s;M,ns;E,n;E,nr;S,j;M,nt;E,i;M,n;M,i;M,nz;E,v;M,nr;E,j;M,l;E,l;
+谋:E,n;B,v;S,v;M,n;E,v;B,n;M,i;E,nr;E,i;M,nr;M,l;E,vn;E,l;M,ns;M,nt;B,i;E,ns;B,vn;E,nrfg;
+伍:E,n;B,nr;E,v;S,m;E,nr;M,n;M,nr;B,m;S,nr;M,m;B,nrt;M,ns;M,nrt;B,ns;E,m;B,n;E,ns;B,nrfg;E,l;
+题:E,n;B,n;S,n;B,v;E,v;M,n;E,l;M,i;E,nr;M,l;S,v;E,a;E,i;M,nz;B,ns;
+琛:S,g;E,nr;E,ns;M,nr;B,ns;
+定:E,v;E,d;E,n;E,a;S,v;M,n;B,n;B,v;B,vn;B,d;E,b;E,vn;E,l;M,l;E,ns;M,nr;B,ns;E,nr;E,i;M,ns;M,i;B,b;B,l;E,an;E,nz;B,nrt;M,d;M,b;M,v;M,nz;E,z;M,nt;E,j;M,nrfg;B,nz;
+障:E,v;B,n;E,n;E,vn;M,n;S,ng;M,b;M,nt;B,v;E,b;M,i;B,nz;M,nz;E,j;M,j;
+昧:E,a;S,v;E,n;M,i;B,b;E,i;M,n;E,nr;
+纬:E,n;S,ng;M,nr;B,n;M,n;E,b;E,nr;B,ns;M,i;
+锱:B,i;S,g;B,n;M,nr;
+犴:E,nr;E,n;S,x;
+筅:S,x;
+鏊:B,n;
+潍:B,ns;
+觎:E,v;S,x;
+救:S,v;E,v;B,v;B,vn;B,n;M,i;E,vn;B,l;M,n;M,l;B,i;M,nz;E,i;M,nr;E,n;M,ns;M,j;B,nt;B,b;
+蟒:B,n;E,n;B,ns;M,ns;
+捕:E,v;B,v;S,v;B,n;E,n;B,i;M,n;B,vn;B,nz;E,vn;M,l;
+鹗:S,ng;E,nr;
+篚:S,g;
+坝:E,n;S,n;B,n;E,ns;E,nr;B,s;M,ns;E,v;M,n;B,ns;M,nt;E,nz;E,nrt;
+衣:B,n;E,n;S,ng;M,n;E,v;B,nr;M,i;B,i;M,nr;E,nr;B,l;E,i;E,vn;E,nz;M,l;M,j;M,nz;E,b;M,ns;B,nt;B,ns;
+旦:E,d;E,t;E,n;E,nr;M,nt;E,ns;S,j;E,i;S,ng;M,i;S,q;M,t;E,nz;B,t;M,n;M,nr;B,n;M,ns;E,j;S,vg;E,v;M,l;
+揪:S,v;B,a;B,v;B,i;
+铰:S,v;B,n;B,v;B,nz;M,nz;E,nr;
+裸:S,ag;B,v;B,l;B,b;M,z;E,z;E,a;B,n;M,i;B,vn;
+承:B,v;E,v;M,nr;B,n;S,nr;M,n;E,nr;B,vn;S,vg;B,nr;E,n;B,ns;S,j;E,i;E,l;B,i;M,l;B,nz;E,vn;E,nz;B,b;B,a;M,i;B,l;M,nrfg;M,b;M,v;M,nz;
+鲁:B,nr;M,nr;M,ns;S,n;E,nr;M,n;E,ns;B,ns;E,nz;M,nt;M,j;E,a;B,nrfg;B,nz;B,nrt;E,nrt;B,j;B,a;M,nrt;M,nz;S,j;E,n;E,nrfg;B,nt;B,n;E,j;B,i;S,nr;E,v;
+妃:E,n;E,nr;B,n;M,nrfg;M,n;M,nr;E,nrfg;E,nz;
+骅:E,ns;M,ns;S,nr;E,nr;B,n;
+笄:S,g;E,v;
+圜:S,x;B,n;E,nr;
+逞:S,vg;B,v;E,v;B,l;M,i;M,nr;E,nr;B,i;E,i;
+没:B,v;S,d;B,l;M,v;E,v;E,i;B,a;M,l;E,d;B,i;M,i;B,d;B,ad;B,n;M,a;B,nz;M,nr;M,j;B,vn;M,n;E,nr;
+踢:S,v;B,v;E,i;B,n;B,l;M,n;
+萦:B,v;M,nr;S,vg;E,l;E,nr;
+航:B,n;E,j;E,v;B,v;S,ng;M,n;E,n;M,nt;E,nr;S,nr;B,vn;E,vn;B,j;M,nz;B,nt;E,nt;E,nz;M,nr;B,nz;M,j;M,ns;S,vg;B,ns;B,q;E,nrfg;
+庭:E,n;E,nr;B,n;S,ng;M,n;E,v;E,ns;M,nr;M,i;B,v;E,i;E,l;E,d;M,l;M,ns;E,nt;E,s;M,b;E,nz;B,b;M,v;B,f;E,j;M,nrfg;
+咱:B,r;S,r;
+秃:S,a;B,n;E,z;M,z;B,v;E,n;M,n;B,z;
+幂:S,n;B,n;E,nr;E,n;
+魄:E,n;E,i;B,n;S,ng;E,a;M,i;E,l;B,i;E,nr;M,nr;
+矇:B,v;
+呆:S,v;B,n;M,z;E,i;E,v;B,z;B,a;E,z;M,n;B,v;E,nr;B,i;B,j;M,nr;M,i;E,n;
+淋:B,n;S,v;M,z;E,z;B,v;B,i;M,i;M,l;E,nr;B,vn;E,n;E,i;M,nr;E,l;B,nz;M,n;M,nz;B,a;
+削:B,v;E,v;S,v;M,n;E,a;B,a;E,b;B,n;B,i;E,vn;E,nr;B,l;E,n;M,nr;M,nz;E,nz;B,b;
+每:B,r;S,r;B,p;B,v;E,d;B,d;B,l;B,i;M,l;B,n;B,nz;E,nr;M,nr;
+荔:B,n;E,nrt;B,ns;M,n;B,nrt;E,n;M,ns;E,nrfg;E,nz;B,nz;
+志:E,n;S,n;M,nr;E,nr;B,n;E,ns;M,n;E,v;M,nt;E,i;B,i;M,ns;B,nr;M,i;B,t;B,v;M,nz;M,v;E,l;M,nrfg;B,ns;B,nrt;B,nrfg;E,nz;B,l;E,nrt;E,nrfg;B,nz;M,b;
+飙:B,v;E,n;M,l;E,nrfg;B,n;
+叟:S,g;E,nr;E,n;M,nr;M,i;
+浠:S,g;B,ns;E,nr;M,nr;
+此:S,r;E,c;B,r;E,r;E,d;B,c;B,t;M,c;B,s;M,l;E,l;M,i;B,i;B,mq;E,i;B,l;B,nz;E,nr;B,v;M,nr;
+胩:S,g;
+慨:E,a;E,v;M,i;E,ad;B,v;B,d;M,l;S,ng;E,i;S,ag;B,vn;E,n;B,i;B,l;M,nr;M,a;E,nr;
+续:E,v;E,vd;E,a;E,d;M,n;E,n;E,vn;S,v;B,nr;B,v;B,n;E,i;M,i;M,l;B,vn;E,nr;M,d;E,b;M,nz;M,nr;E,l;
+彬:M,i;B,i;E,nrfg;E,nz;E,i;B,ns;
+陲:E,n;E,s;S,g;
+却:S,d;B,d;B,v;E,v;B,nr;E,vn;M,n;M,i;E,l;B,i;M,nz;M,nr;E,nz;M,ns;
+棹:S,g;E,nr;
+封:S,q;E,v;B,n;B,a;B,v;B,nr;E,m;B,l;E,ns;M,ns;E,n;E,nr;M,n;B,vn;M,b;M,nr;E,vn;M,l;B,t;M,i;B,ns;B,i;S,m;B,nz;E,i;E,d;B,j;M,nt;E,l;B,nrt;E,b;M,nz;
+纂:E,v;S,g;B,v;E,nr;M,n;
+娅:E,nr;S,x;E,nrt;M,nr;
+震:B,v;E,n;B,vn;S,v;E,nr;B,n;M,nr;M,n;B,i;B,t;E,v;E,vn;B,nz;M,l;E,l;M,i;E,nrfg;M,nrfg;M,v;M,nt;B,ns;M,j;
+犊:S,ng;E,n;B,n;E,l;M,n;M,l;M,i;
+不:S,d;B,v;B,d;B,a;B,n;B,c;M,i;M,l;M,v;B,m;E,d;B,i;B,l;B,df;M,d;E,l;B,z;M,n;M,c;B,t;M,a;M,ns;B,ns;B,b;M,t;B,s;B,nz;B,vn;M,nr;E,c;B,nrt;M,nz;M,m;E,j;M,z;B,ad;M,b;M,nrt;B,nr;M,j;
+脓:B,n;S,n;M,n;E,v;
+缗:S,q;E,nr;
+岖:E,a;M,i;S,x;
+馘:S,g;
+媚:E,a;S,vg;M,nr;E,v;B,n;E,nr;E,an;M,i;E,i;B,a;B,v;
+亢:S,nr;B,a;E,a;B,v;E,n;B,nr;E,i;B,i;M,i;E,nr;E,v;M,nr;B,n;
+认:B,v;E,v;B,ad;S,v;B,vn;B,n;M,l;M,v;B,nz;E,i;M,z;B,z;M,n;E,n;E,l;E,nr;B,a;B,i;M,i;M,nt;B,j;
+膨:M,l;B,v;M,n;B,n;B,l;B,nz;B,a;
+鸭:S,ng;B,n;E,n;B,ns;M,ns;M,n;E,nz;B,nz;E,v;M,b;M,i;
+疰:B,n;
+蠹:B,n;E,n;E,i;
+籁:E,n;S,ng;M,i;M,nr;M,l;E,nr;
+寄:S,v;B,v;M,nr;B,n;B,vn;E,v;M,n;B,i;B,nr;E,vn;E,nr;B,ns;
+铆:B,n;B,v;S,ng;S,vg;
+湍:S,ag;B,n;B,a;E,nr;E,n;M,nr;
+裎:S,g;
+糖:E,n;B,n;S,n;E,v;M,n;E,nr;M,nt;M,nz;M,nr;B,nz;B,v;B,l;M,i;
+镛:E,nr;S,g;
+滢:E,nr;S,g;M,nr;
+擦:S,v;E,v;E,vn;B,v;M,n;B,l;B,n;M,i;E,l;M,l;E,n;B,i;B,nz;
+壮:S,v;E,a;B,a;B,v;B,n;M,ns;E,i;M,nr;B,nz;E,nr;E,v;M,i;M,l;M,n;B,t;B,ad;B,i;B,l;E,b;E,l;E,j;E,ad;E,n;M,v;
+闰:S,nr;B,n;E,nr;S,b;B,t;M,nr;
+煳:S,a;E,nr;
+馅:S,ng;B,n;E,n;E,v;E,nz;E,b;M,v;
+事:B,n;S,n;E,n;E,v;M,n;B,l;E,r;E,b;E,i;M,i;B,d;B,t;M,l;M,nt;M,nz;E,a;B,v;E,l;B,i;E,vn;E,d;M,v;M,nr;E,nz;E,nr;E,j;M,ns;E,nt;M,j;B,b;M,vn;
+怔:S,v;B,v;E,v;B,n;E,nr;M,z;E,z;
+娘:E,n;S,n;B,n;E,nr;M,nr;M,n;E,v;E,l;M,l;M,ns;M,nrt;
+疝:B,n;
+澡:E,v;S,ng;B,n;M,n;E,n;M,nz;S,vg;
+财:B,n;E,v;S,n;B,nt;B,j;E,n;M,nt;M,i;E,j;E,i;E,l;M,l;E,nr;M,nr;B,i;E,a;B,l;M,j;M,n;E,nz;M,nz;
+掩:B,v;S,v;E,v;B,n;B,vn;B,i;M,v;M,i;M,nz;E,i;B,l;E,vn;E,l;M,nr;
+笮:S,g;E,nr;
+甲:S,n;B,n;E,b;E,n;M,n;E,nr;B,nz;M,nr;E,ns;B,m;B,l;M,nz;B,b;E,v;M,ns;S,v;M,i;S,m;E,l;S,mg;E,i;M,m;E,j;B,ns;E,nz;B,nrt;M,l;B,nt;B,t;B,j;M,nt;B,nrfg;
+况:E,n;E,c;B,c;E,l;S,nr;B,nr;M,i;M,l;E,nr;M,n;B,d;S,ng;B,n;M,nr;E,i;M,nt;
+漶:E,v;S,x;
+肿:B,n;E,n;S,v;E,v;B,v;M,l;E,a;E,l;M,n;M,i;B,vn;E,i;M,nt;
+滋:B,v;B,n;M,n;S,v;M,z;E,z;M,l;E,nr;E,ns;M,nr;B,vn;B,l;B,nrt;E,nz;M,ns;B,nz;
+豌:B,n;M,n;M,nz;
+虐:E,v;B,v;S,ag;E,i;E,a;B,n;E,vn;B,nz;M,l;E,z;M,n;
+拓:B,v;E,v;S,v;B,nr;B,n;M,n;E,nr;M,i;M,l;B,nz;M,nr;E,a;E,nz;M,b;
+联:B,v;B,n;E,ns;S,vg;M,j;M,n;B,nt;M,nt;E,vn;E,n;E,v;E,j;B,j;M,ns;B,l;B,vn;E,nz;B,nz;B,ns;E,nr;M,nr;E,nt;M,l;M,nz;B,d;M,i;E,l;B,b;M,v;B,a;M,b;
+四:B,m;S,m;M,m;B,ns;E,m;B,mq;B,n;B,j;B,f;M,nr;E,t;B,d;B,t;M,n;B,i;M,t;B,v;B,nrt;M,nz;B,nt;E,n;B,nz;E,nr;M,i;M,l;B,b;E,i;B,l;E,ns;M,ns;E,r;M,nt;E,nrt;E,nz;M,j;E,j;M,b;B,nr;E,l;
+瑜:E,nr;S,nr;B,n;M,nr;M,l;E,nrfg;E,i;M,i;
+觥:B,i;
+桤:S,g;B,n;M,nr;
+菩:B,n;B,l;M,n;B,ns;M,l;
+镲:S,n;E,nz;
+轶:B,n;
+毹:E,n;S,x;
+弁:S,g;E,nr;E,n;
+熊:B,nr;S,n;B,n;E,n;M,n;E,z;B,z;E,nr;M,nr;E,nrt;M,i;B,ns;B,i;E,nz;M,l;M,nz;E,v;B,nt;M,nt;B,nz;
+骘:E,n;S,g;E,nr;
+瘛:S,x;
+钜:S,g;M,nr;E,nr;
+袤:E,a;S,g;E,nr;
+芨:B,n;M,n;E,n;
+刳:S,g;
+蔽:E,a;E,v;E,n;S,v;M,n;M,i;B,v;E,vn;M,l;E,l;M,nr;M,v;
+撼:E,v;S,v;B,v;M,i;M,n;B,i;B,l;M,nr;M,l;E,nr;
+释:E,v;B,v;S,ng;E,n;B,nr;B,n;M,n;M,i;S,vg;E,nr;B,vn;E,vn;M,l;B,z;M,nr;B,nz;M,j;E,i;
+浍:S,g;E,nr;
+诎:S,ag;S,g;
+村:B,n;E,n;S,n;E,nr;E,ns;E,r;B,s;B,j;B,b;E,nz;M,nr;M,n;E,nrt;E,v;B,ns;M,ns;B,l;B,nr;B,vn;E,nrfg;E,l;M,nrt;M,l;E,vn;M,nt;B,v;M,nz;
+慕:B,nr;E,v;B,ns;S,nr;M,nr;M,ns;S,ng;B,v;E,nr;E,l;E,n;S,vg;E,vn;B,l;M,nt;M,nz;B,n;E,ns;
+孙:B,nr;S,nr;E,nr;E,n;B,n;M,nr;B,nrfg;M,n;M,ns;B,nz;E,ns;E,i;M,i;B,ns;M,l;E,l;E,nrfg;M,nrt;
+陛:B,n;
+珞:B,nz;E,n;B,nrt;B,ns;
+寮:S,g;E,ns;E,nrt;
+嗲:M,l;B,l;
+郴:B,ns;S,j;E,nr;M,nr;
+蓼:S,nr;M,nr;B,n;
+恿:E,v;S,x;E,nr;M,nr;
+缀:S,v;E,v;E,n;E,nr;B,n;
+它:S,r;B,r;E,r;E,n;M,i;
+颅:E,n;S,ng;B,n;B,s;E,i;E,v;M,n;
+喇:B,n;S,nr;M,ns;E,nr;M,n;M,nr;E,n;E,o;M,o;M,l;B,ns;
+例:E,n;B,v;S,n;B,n;S,m;E,d;E,m;E,v;M,l;M,n;B,vn;E,i;B,i;E,mq;M,b;E,l;E,vn;E,nr;
+洌:S,g;E,a;M,nr;E,nr;
+朐:S,g;E,ns;M,ns;
+传:B,n;B,v;S,v;B,vn;E,vn;E,v;M,n;M,nr;E,n;E,nr;E,l;E,nz;E,i;B,a;E,b;M,l;M,nt;B,l;B,i;M,i;B,nz;M,b;B,b;M,nz;E,nrt;B,j;E,nrfg;B,t;
+谢:E,v;B,nr;S,v;B,v;E,i;E,nr;E,vn;M,n;B,nrfg;E,nrt;M,i;M,nr;B,i;B,n;B,nrt;M,l;M,nrt;B,ns;E,l;B,nz;M,ns;
+耪:S,v;B,v;
+岭:E,ns;S,n;E,n;E,nr;E,nrt;B,n;M,n;M,ns;M,nr;E,i;B,s;B,ns;M,nz;E,l;E,nz;B,nt;E,j;E,v;S,ng;M,nt;
+戾:S,g;E,a;E,z;
+层:E,n;S,q;E,m;B,n;E,b;E,f;S,m;M,b;M,n;B,q;E,q;M,l;E,l;B,i;E,v;M,m;B,z;E,nr;B,m;E,d;E,j;B,nz;M,z;E,z;M,nr;M,i;B,l;E,nz;M,v;B,v;E,a;
+症:E,n;B,n;S,ng;E,v;E,nz;E,i;E,l;M,i;E,j;M,nz;
+赌:S,v;B,v;B,n;E,v;E,l;B,i;E,vn;B,vn;M,j;
+腔:E,n;S,q;E,v;E,m;B,n;E,b;M,n;M,i;B,l;M,l;M,nr;S,ng;E,l;
+筘:S,g;
+铝:S,n;B,n;E,n;E,nz;E,j;M,nr;B,b;M,nz;B,nz;M,n;E,nr;M,nt;
+畜:B,n;E,n;S,ng;E,j;M,n;E,v;S,n;B,v;E,nz;B,nz;M,i;E,nr;
+裥:E,n;
+嵬:S,g;E,nr;M,ns;
+驮:S,v;B,v;B,n;M,nz;
+盱:B,ns;
+兴:B,v;E,a;E,b;B,n;S,v;E,v;E,ns;E,nr;B,ns;M,ns;M,nr;B,a;E,vn;B,i;E,l;M,nt;E,n;M,i;E,nz;B,z;M,n;E,d;M,l;B,d;B,j;E,nrt;B,l;M,z;B,nz;E,z;B,nr;E,nrfg;E,nt;B,nrt;M,j;M,nz;B,nt;M,nrfg;E,ad;E,i;
+蹶:M,i;S,g;M,v;E,i;
+艾:B,nr;B,n;S,nr;E,nr;M,nr;B,nrt;M,ns;E,i;B,ns;E,n;M,i;B,nrfg;B,nz;
+币:E,n;M,l;S,n;M,nt;M,n;B,n;E,v;M,vn;E,j;E,l;E,nr;E,vn;E,nz;M,nr;B,nr;
+鬃:S,ng;E,n;B,n;M,ns;
+锇:S,g;
+皆:S,d;M,i;E,nr;M,nr;B,i;M,l;B,nrt;
+炊:B,n;S,vg;E,n;E,i;E,v;B,l;
+檎:S,x;E,n;E,nr;
+撒:S,v;B,v;M,ns;B,n;B,ns;E,ns;B,nrt;E,v;B,nz;E,nrt;B,l;E,nr;B,d;M,nr;E,n;M,n;B,nr;B,i;M,i;M,nrt;
+庖:S,ng;E,i;B,n;B,nrt;B,i;
+墚:S,g;
+办:B,n;S,v;E,v;B,v;B,vn;E,n;M,n;E,j;E,vn;M,nt;E,b;M,l;E,nr;E,i;E,nt;B,j;M,j;E,nz;B,nz;E,l;M,nr;
+欣:B,v;B,a;E,nr;S,nr;S,vg;B,d;M,nr;M,i;B,i;B,nz;E,a;B,n;B,nrt;M,d;E,ns;E,nrfg;M,nrfg;
+莨:B,n;S,x;M,n;M,nr;E,n;M,i;
+夯:S,n;B,v;E,nr;B,n;S,v;E,vn;M,n;
+阱:E,n;S,g;
+瞰:E,v;S,g;M,n;
+逵:E,nr;S,g;
+落:E,v;B,v;S,v;E,n;B,a;B,n;E,i;M,i;M,n;E,a;E,l;E,vn;M,l;B,i;E,z;M,z;B,l;B,vn;B,ns;M,nr;E,nr;M,v;M,s;B,b;E,ns;B,nz;M,ns;
+於:S,nr;B,nr;S,e;M,nr;E,nr;M,i;
+繁:B,v;B,a;E,a;B,n;S,n;M,i;B,i;E,nr;M,nr;S,vg;B,ns;E,l;B,l;B,vn;M,n;B,nrt;B,nz;M,l;
+硅:S,n;B,n;E,n;B,nz;M,n;E,nz;M,nz;B,j;M,ns;E,nr;
+集:B,n;B,v;E,v;S,q;E,n;M,nt;E,a;M,n;S,vg;B,vn;E,vn;E,nr;E,m;E,ns;B,l;B,nz;M,nr;M,nz;B,ns;E,i;S,m;B,b;B,nrt;E,j;M,ns;M,l;B,j;E,nz;B,i;M,b;M,i;M,t;
+又:S,d;B,n;M,l;M,nr;B,l;E,nr;M,i;M,nz;B,nr;B,c;
+郊:E,s;B,s;E,n;S,ng;E,ns;E,nr;B,n;E,j;B,v;M,ns;M,n;M,s;M,l;B,i;M,b;
+恕:S,vg;S,nr;E,v;B,v;E,nr;M,nr;B,l;E,vn;
+靛:B,b;E,n;B,n;
+狞:E,a;B,v;E,l;B,a;M,l;E,nr;
+乡:S,n;E,n;B,n;E,v;E,ns;B,s;M,ns;E,m;M,n;E,i;E,r;E,nr;E,l;M,i;M,nr;E,nz;B,l;M,nz;M,l;E,nrt;B,b;S,m;E,vn;M,m;B,nrt;M,nrfg;M,nt;B,ns;M,nrt;
+波:B,ns;B,vn;E,n;B,n;S,j;E,nr;E,ns;B,nr;B,nz;M,nr;M,n;E,v;B,v;S,n;M,i;M,ns;B,nt;B,nrt;B,l;M,nrt;M,nz;E,nrt;E,i;B,i;B,b;E,l;M,nt;M,l;E,nrfg;E,nz;B,j;
+曦:E,nr;S,nr;E,n;M,nr;
+祯:E,nrt;E,nr;S,g;M,nr;E,nrfg;
+哲:B,n;S,nr;M,nr;E,nr;B,ns;B,nrt;E,n;M,nz;S,ng;M,nt;E,j;M,i;M,nrfg;B,j;E,a;E,nrfg;
+海:B,n;E,ns;S,n;B,s;E,n;M,ns;B,ns;E,f;E,nr;M,nt;B,nr;B,nz;M,nr;B,nt;E,v;E,nz;M,n;B,nrt;M,nz;B,v;E,s;E,i;B,vn;B,q;B,j;B,m;M,i;E,nrt;M,s;B,l;M,l;B,i;E,vn;B,b;E,j;M,j;M,nrfg;M,m;E,b;E,nrfg;E,l;M,nrt;B,nrfg;M,q;
+件:E,n;E,m;E,mq;S,q;S,m;E,l;M,n;M,l;E,d;E,nz;E,j;B,n;E,v;M,nr;E,nr;M,nz;M,i;
+诸:S,r;B,nr;B,n;B,m;B,r;B,v;E,nr;E,v;M,nr;B,ns;M,ns;M,l;B,l;B,i;M,i;B,nrfg;M,nt;
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/prob_emit.utf8 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/prob_emit.utf8
new file mode 100644
index 0000000000..cc207d11dc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/prob_emit.utf8
@@ -0,0 +1,166 @@
+#发射概率
+#格式
+#状态:字符1,概率1;字符2,概率2;
+B,ad:突,-2.70366861046;肃,-10.2782270947;适,-5.57547658034;肅,-10.2782270947;匆,-7.7132777372;安,-9.58507991411;專,-6.95499125447;踊,-6.27089390943;認,-3.94140136352;随,-4.24334392719;明,-3.36997194064;耐,-7.90332134009;败,-11.6645214558;粗,-6.55857598188;猖,-10.5659091671;清,-11.6645214558;驚,-7.53738707074;详,-5.07834980093;没,-7.36045636258;虚,-7.58698401188;侥,-7.63916976505;隨,-4.24334392719;順,-4.19202071105;骯,-10.0550835434;熱,-7.79332044488;沉,-7.79332044488;劳,-10.0550835434;疲,-9.26662618299;贴,-11.6645214558;殷,-9.09957209832;徹,-3.9387500142;費,-11.6645214558;机,-10.2782270947;笼,-9.87276198656;綿,-10.9713742752;显,-3.78788299481;迅,-2.91987401747;武,-10.5659091671;纷,-9.87276198656;勇,-9.36193636279;恆,-9.26662618299;拉,-11.6645214558;對,-7.75249845036;默,-10.9713742752;湊,-10.5659091671;慌,-5.25106249862;低,-8.36868458978;凑,-10.5659091671;齐,-8.89193273355;仓,-6.20920034043;恒,-9.26662618299;齊,-8.89193273355;達,-10.5659091671;愧,-10.2782270947;招,-7.95094938908;坚,-4.35597865825;刻,-7.00108236167;籠,-9.87276198656;牢,-9.179614806;僥,-7.63916976505;孤,-11.6645214558;緊,-4.97367917837;坦,-8.44564563092;全,-3.21453701406;懦,-7.00108236167;热,-7.79332044488;公,-3.05712199648;壯,-8.2972256258;普,-3.10025385698;英,-9.46729687845;適,-5.57547658034;绵,-10.9713742752;精,-5.30321897821;偶,-7.24568084799;对,-7.75249845036;狠,-9.87276198656;扼,-8.83130811173;茁,-10.2782270947;堅,-4.35597865825;切,-4.84559739051;隆,-8.2305342513;倉,-6.20920034043;沈,-7.79332044488;逍,-9.09957209832;準,-9.46729687845;不,-9.02546412617;和,-11.6645214558;小,-4.74187756431;蓬,-7.69422954223;专,-6.95499125447;沒,-7.36045636258;輕,-9.87276198656;积,-2.71450742625;周,-8.77414969789;畅,-9.58507991411;猛,-7.77270115767;确,-3.41207536554;果,-7.17588508605;实,-10.9713742752;無,-8.61999901806;悠,-8.57347900243;暢,-9.58507991411;严,-3.30304683937;均,-7.32071603393;大,-4.90642695136;踴,-6.27089390943;茫,-8.83130811173;努,-3.56012014786;詳,-5.07834980093;肮,-10.0550835434;週,-8.77414969789;稳,-5.84741029582;悲,-9.71861130673;嚴,-3.30304683937;过,-5.00908110542;紧,-4.97367917837;费,-11.6645214558;主,-3.88380056967;確,-3.41207536554;貼,-11.6645214558;紛,-9.87276198656;疾,-8.89193273355;惊,-7.53738707074;充,-3.23900505294;兇,-8.95647125468;准,-9.46729687845;草,-9.58507991411;積,-2.71450742625;及,-3.61222495625;恍,-8.44564563092;认,-3.94140136352;超,-9.71861130673;獨,-6.94602258449;仔,-4.11228416822;敗,-11.6645214558;苦,-10.9713742752;完,-2.46090362957;妥,-5.8715078474;虛,-7.58698401188;過,-5.00908110542;轻,-9.87276198656;機,-10.2782270947;勞,-10.0550835434;无,-8.61999901806;正,-2.95176148082;顺,-4.19202071105;顯,-3.78788299481;勤,-6.92832300739;實,-10.9713742752;穩,-5.84741029582;达,-10.5659091671;独,-6.94602258449;密,-3.68518256052;壮,-8.2972256258;平,-9.179614806;盲,-5.30321897821;牵,-11.6645214558;直,-2.4687872362;慷,-6.86050041105;凶,-8.95647125468;彻,-3.9387500142;急,-7.01056110563;牽,-11.6645214558;狼,-6.80470905142;委,-8.95647125468;
+B,an:安,-1.43293313455;耐,-6.23237245075;妙,-8.5741782569;多,-10.1836161693;痛,-2.59125004081;貧,-5.51078733487;溫,-3.22042618346;尴,-9.08500388066;傷,-8.3918567001;猶,-10.1836161693;麻,-3.60575481161;低,-6.1582644786;恐,-3.20168149218;工,-7.47556596823;周,-9.49046898877;黯,-10.1836161693;陰,-5.47408596802;憂,-10.1836161693;美,-10.1836161693;閒,-6.08927160711;無,-10.1836161693;悠,-7.69870951954;猥,-7.18788389578;动,-4.04373161711;禮,-4.81297814121;冲,-8.5741782569;嚴,-4.51373524635;尷,-9.08500388066;蒼,-10.1836161693;哀,-5.66182759228;闷,-5.6949797996;負,-7.18788389578;偏,-6.54603000961;野,-10.1836161693;卑,-7.69870951954;淒,-7.29324441144;高,-9.49046898877;剛,-7.0481219534;诚,-10.1836161693;靡,-8.3918567001;狠,-6.00922889944;煩,-6.1582644786;自,-6.05648178429;危,-2.60087768042;困,-1.88507662396;闲,-6.08927160711;凶,-6.25179053661;狼,-5.75279937049;刚,-7.0481219534;衛,-2.66067525126;伤,-8.3918567001;枯,-8.3918567001;冷,-5.90695005032;犹,-10.1836161693;礼,-4.81297814121;阴,-5.47408596802;恆,-4.89031134461;苍,-10.1836161693;腐,-3.09771470497;恒,-4.89031134461;動,-4.04373161711;矛,-2.02538625237;惡,-9.08500388066;解,-6.96474034446;忧,-10.1836161693;晦,-5.16633633252;快,-10.1836161693;公,-9.49046898877;迷,-9.49046898877;恶,-9.08500388066;酸,-9.08500388066;空,-7.00556233899;清,-9.49046898877;喜,-10.1836161693;负,-7.18788389578;严,-4.51373524635;温,-3.22042618346;贫,-5.51078733487;邪,-10.1836161693;累,-5.87955107613;週,-9.49046898877;悲,-5.39612442655;悶,-5.6949797996;疼,-10.1836161693;精,-10.1836161693;狂,-8.10417462765;凄,-7.29324441144;兇,-6.25179053661;誠,-10.1836161693;柔,-6.71788026653;衝,-8.5741782569;无,-10.1836161693;烦,-6.1582644786;卫,-2.66067525126;零,-8.23770602028;幽,-7.78572089653;
+B,a:要,-6.89481027452;耀,-7.96159301432;茂,-7.369222053;羅,-9.50203805527;鏗,-9.25462988196;劇,-6.49931274623;脆,-7.53627613766;閉,-10.5005668854;合,-4.75345128602;邋,-10.0485817616;亏,-10.9801399656;崎,-8.32473349803;耐,-6.44671368451;漂,-6.50367765931;阔,-8.80015719474;外,-10.0187287985;会,-10.9060319935;宝,-7.37967146887;贞,-10.9060319935;怠,-10.9060319935;欢,-6.89869880826;侥,-8.06445039976;皇,-10.6006503439;焦,-6.48118536163;谨,-5.80051951375;炫,-9.8315172564;矫,-8.80015719474;纯,-6.87052793129;靜,-8.55465673633;熱,-5.18454994173;體,-8.03975778717;嘴,-9.61326369038;犷,-12.158794962;專,-7.74903157234;方,-5.82773805092;贵,-8.07702918197;强,-4.48139453147;宽,-5.07331199522;放,-8.31934264939;私,-6.08402380875;桀,-11.1471940503;黴,-11.4656477814;必,-5.5072230884;勇,-6.87432300226;屈,-12.4464770344;惋,-8.36330577281;齊,-6.58189933723;反,-6.93574007994;经,-10.0485817616;昌,-9.20128390125;凑,-9.05645295337;恐,-6.55391243598;陆,-12.8519421425;牢,-7.62083352569;濕,-7.99212973818;纏,-8.84460895731;拗,-10.6547175652;飘,-9.73842683333;坚,-5.59141954446;軟,-7.81824157552;孤,-7.05284948808;凡,-12.4464770344;遠,-10.0187287985;賣,-8.91036033488;知,-6.36273721122;诧,-7.56115304242;諧,-9.76089968919;煦,-13.5450893231;早,-12.8519421425;周,-7.15821000374;惫,-10.1111021186;彪,-11.0601826733;班,-13.5450893231;马,-9.01248982995;錚,-10.711875979;浮,-8.50166420619;恰,-7.76434580731;念,-10.3262134982;噴,-11.7533298539;闹,-10.9060319935;僻,-9.03422981659;达,-11.1471940503;扼,-9.63306631768;滿,-10.1438919414;愁,-8.9703783446;吃,-6.63833454446;庄,-7.02299652493;切,-11.0601826733;沈,-5.32792072734;個,-6.2107599728;纷,-8.20275507114;昏,-7.65344511128;金,-10.4540468697;香,-8.75759758032;吓,-10.2869927851;排,-13.5450893231;輕,-5.66504112213;華,-7.24798000317;妖,-9.12624871531;错,-9.55610527654;畅,-7.50008400907;芜,-10.7725006009;丟,-8.38603402389;飄,-9.73842683333;無,-5.96643247251;悠,-6.60971887709;氣,-6.93708869781;客,-7.20826359196;缥,-9.37070205321;交,-13.5450893231;胆,-7.20826359196;走,-9.98974126162;葳,-11.9356514107;锁,-11.1471940503;识,-9.69494172139;劬,-11.599179174;白,-8.87226048864;單,-5.72545302074;失,-6.60196690029;草,-9.15064016843;養,-9.93417141046;厲,-6.5151164114;張,-9.69494172139;嚴,-4.34742900429;冶,-13.5450893231;费,-7.67579240997;蠻,-9.17564147064;押,-9.40195459671;允,-10.9801399656;参,-9.21435598282;膨,-12.158794962;片,-8.39759484629;准,-6.2055516277;俊,-8.36330577281;乏,-7.5511278958;離,-8.46368495812;惹,-10.2128848129;寒,-6.7835165543;何,-9.43421545893;鄭,-7.89611508494;奸,-8.6698919999;顛,-11.3478647458;潑,-9.11427252426;瑣,-9.15064016843;来,-10.2128848129;盤,-11.0601826733;剧,-6.49931274623;姦,-8.6698919999;浩,-8.16059426032;火,-6.46422142641;独,-5.92242537178;景,-7.17690213675;差,-10.9060319935;銳,-8.46368495812;膩,-11.0601826733;味,-11.4656477814;燒,-10.1777934931;更,-8.18850304843;穷,-8.32473349803;凶,-6.84929040605;基,-4.18529499796;狼,-9.8315172564;广,-4.81714910071;靓,-9.10243806661;樂,-5.64482328634;率,-9.93417141046;逆,-9.96157038465;沉,-5.32792072734;憋,-9.26842320409;上,-8.54114301716;認,-11.599179174;嬌,-7.80529641093;發,-5.24704766173;傑,-7.08205986618;經,-10.0485817616;划,-8.63981454467;嚕,-12.8519421425;蕴,-12.8519421425;沙,-9.11427252426;清,-4.24007533753;窝,-8.59632943273;牛,-11.9356514107;搞,-10.0485817616;銷,-9.8315172564;夠,-9.85620986899;伤,-6.61753141683;倦,-9.38620623975;撩,-10.837039122;用,-8.7167755858;个,-6.2107599728;枯,-8.86295809598;糜,-10.9801399656;悱,-12.4464770344;虚,-6.50455293289;亵,-12.4464770344;朴,-7.33448924608;殷,-7.71320684582;油,-10.2492524571;离,-8.46368495812;为,-9.29659408106;抽,-7.21180969497;笼,-9.17564147064;便,-5.80051951375;阴,-7.1632733057;郁,-8.34659229184;雅,-8.41519060818;溷,-12.4464770344;恆,-10.0187287985;凋,-9.48464631256;湊,-9.05645295337;苍,-7.01713140548;俏,-9.11427252426;郑,-7.89611508494;腐,-8.05202787976;绕,-13.5450893231;潔,-8.39179772861;受,-8.15146177675;聖,-8.74106827837;奥,-10.837039122;凛,-9.78388920741;繚,-11.3478647458;最,-3.19170518995;迟,-6.73605001706;属,-9.07918120445;惡,-6.48204115972;民,-5.75150251973;机,-6.5356803904;寧,-7.86833552084;誘,-8.3301535655;莽,-9.37070205321;噪,-11.4656477814;狭,-6.50982072382;矯,-8.80015719474;盲,-8.81770150439;惱,-8.31934264939;轩,-9.96157038465;淳,-9.04527965277;绵,-9.41795493806;調,-8.08976820775;偶,-7.00405932392;蹺,-10.5005668854;橫,-9.88152767698;忿,-9.32558161793;老,-6.68128593165;见,-8.83555912179;自,-4.80491259318;帅,-9.88152767698;朗,-11.1471940503;血,-8.25682229241;吉,-8.63243443737;消,-6.98123379657;颖,-10.7725006009;鈍,-13.5450893231;完,-5.37377244839;伏,-11.3478647458;頑,-7.04080114957;般,-9.88152767698;窒,-12.8519421425;赏,-8.23188334406;顯,-5.66997004206;悖,-11.7533298539;谙,-10.0187287985;迅,-7.59444677052;愛,-6.30372303978;矮,-8.63981454467;宜,-8.35213247221;伟,-6.38813295849;貞,-10.9060319935;怡,-8.82659045181;孱,-10.2128848129;抢,-7.83466230573;严,-4.34742900429;鬧,-10.9060319935;悦,-8.73290496773;險,-7.10733767337;爭,-8.93991913712;詳,-6.25343311393;弯,-11.9356514107;沮,-7.93561752792;週,-7.15821000374;臉,-12.158794962;劲,-10.4095951072;土,-10.2869927851;悶,-8.92011650982;極,-5.77275774794;褻,-12.4464770344;爽,-7.59705433392;精,-4.9882908771;净,-12.158794962;狂,-7.22612120936;久,-11.1471940503;升,-9.32558161793;惆,-8.94996947297;珍,-6.36349737849;驍,-9.41795493806;富,-6.29516378639;灑,-9.09074202685;慳,-10.5493570496;浓,-6.32033591734;暢,-7.50008400907;闷,-8.92011650982;柔,-6.66060267106;胖,-11.7533298539;帥,-9.88152767698;绚,-8.44522289528;賞,-8.23188334406;燠,-11.0601826733;散,-8.03975778717;勢,-9.65326902499;荧,-10.9801399656;烦,-6.58569081097;摩,-9.41795493806;巨,-4.9576240787;對,-6.92368367134;扭,-10.2492524571;寬,-5.07331199522;软,-7.81824157552;铮,-10.711875979;聱,-12.158794962;称,-9.04527965277;荒,-6.65041928367;驽,-11.2425042301;烫,-9.29659408106;獷,-12.158794962;惶,-7.88212884297;汹,-11.0601826733;养,-9.93417141046;固,-5.32684139642;剽,-10.0187287985;遥,-7.1332710554;板,-9.65326902499;虔,-7.79888613256;宁,-7.86833552084;稀,-6.22721312448;超,-8.21721315432;各,-7.69865054805;匆,-8.03166057694;辉,-7.11860086565;嘈,-8.38603402389;紊,-7.6645563367;妍,-12.4464770344;较,-4.45827343741;成,-4.39609258137;皓,-12.158794962;适,-5.12484765777;尔,-11.9356514107;梗,-13.5450893231;猖,-8.06029238961;肅,-7.54367444514;蔚,-10.0187287985;倜,-10.9060319935;审,-7.85472986878;稠,-7.6900174009;嚣,-9.22760120957;靚,-9.10243806661;造,-13.5450893231;義,-9.2410242299;洪,-8.36330577281;缺,-9.88152767698;纳,-10.2869927851;涵,-12.4464770344;尴,-6.99115591908;傷,-6.61753141683;猶,-6.66162673669;澹,-11.2425042301;常,-5.35695590859;骇,-10.2492524571;敞,-10.6006503439;膽,-7.20826359196;值,-7.78303794032;鯁,-12.4464770344;婀,-10.3670354928;练,-9.96157038465;逊,-8.5614827014;病,-10.3670354928;歆,-13.5450893231;駁,-10.9801399656;碍,-9.00179454083;重,-3.1950267094;塌,-11.4656477814;棘,-8.63243443737;低,-5.79017905108;发,-5.24704766173;頹,-8.4211253437;仓,-8.70880741615;規,-9.29659408106;卖,-8.91036033488;忙,-7.43806643536;迥,-8.84460895731;苛,-8.40929088605;凝,-8.7248077575;停,-8.3301535655;糟,-7.88560710735;燦,-7.67015859225;寡,-10.3670354928;顶,-9.51973763237;廣,-4.81714910071;奢,-7.50008400907;工,-8.48249429008;惧,-11.599179174;武,-9.90750316338;浪,-7.69288684333;臭,-11.9356514107;恬,-9.20128390125;潮,-7.18898166241;诱,-8.3301535655;緩,-6.18689557037;淵,-9.11427252426;幸,-5.93423653271;勻,-8.52780948629;秽,-11.9356514107;恼,-8.31934264939;铿,-9.25462988196;松,-6.82728462808;持,-7.28359763878;犀,-8.78291538831;如,-12.158794962;紅,-7.72797816314;标,-8.85374144088;秀,-7.36507266945;有,-3.83852947975;短,-6.65549801475;靦,-8.88165022899;复,-5.25429497572;小,-8.92996880626;美,-5.83085817826;挑,-13.5450893231;专,-7.74903157234;冒,-8.74106827837;黯,-8.96012184443;逗,-10.4095951072;團,-6.53027497183;爛,-11.7533298539;順,-7.32648920341;從,-7.49300015418;抠,-10.6006503439;慧,-12.4464770344;潇,-8.26697466387;性,-8.53445402901;灰,-13.5450893231;昭,-11.599179174;别,-7.8313565176;喪,-9.59384560452;夭,-13.5450893231;悬,-7.77676832731;微,-6.37189758062;鬱,-8.34659229184;莹,-11.0601826733;阳,-10.7725006009;冲,-6.95067586336;纖,-8.25178449838;貴,-8.07702918197;家,-9.21435598282;酷,-9.37070205321;庸,-7.3923566284;刻,-8.44522289528;綺,-9.41795493806;年,-5.59388216663;魁,-8.70090223665;晃,-11.1471940503;懂,-8.04383111256;浅,-8.27208976454;密,-6.3379704669;頂,-9.51973763237;手,-9.09074202685;緊,-4.9739762897;配,-6.56222657164;背,-10.5005668854;長,-6.10025604921;卑,-7.78303794032;欺,-10.9801399656;懒,-9.11427252426;絕,-6.76858233073;跷,-10.5005668854;遗,-7.08989075976;陽,-10.7725006009;静,-8.55465673633;盘,-11.0601826733;剛,-7.54863723449;风,-7.66735354133;惜,-13.5450893231;贤,-9.29659408106;歡,-6.89869880826;狠,-8.64724952315;顧,-10.5493570496;實,-7.75819194174;澄,-10.0485817616;扫,-9.03422981659;瘦,-7.88909751229;惬,-9.01248982995;摯,-12.8519421425;修,-9.05645295337;危,-7.09146432421;狰,-8.90069842396;平,-3.45081613536;鋒,-8.18850304843;敵,-8.13791755164;寶,-7.37967146887;相,-4.69571881935;旺,-7.01421169538;好,-5.85024125072;详,-6.25343311393;翔,-9.12624871531;突,-5.45254405921;匀,-8.52780948629;粲,-11.1471940503;堂,-9.88152767698;陳,-8.26697466387;醇,-8.90069842396;分,-7.98826126141;争,-8.93991913712;残,-6.54020733339;尊,-8.33560317026;悍,-10.7725006009;调,-8.08976820775;疏,-8.31398070625;明,-3.89978976779;抑,-8.2823991342;遙,-7.1332710554;倒,-7.73095879128;疯,-6.26370365953;冗,-9.53775613787;淘,-8.94996947297;优,-5.38571458633;宛,-13.5450893231;尚,-10.2492524571;愜,-9.01248982995;骄,-7.27032730186;欠,-12.158794962;辣,-11.1471940503;蠢,-11.4656477814;娇,-7.80529641093;蛮,-9.17564147064;在,-8.90069842396;莫,-12.158794962;悭,-10.5493570496;斯,-8.80889087471;远,-10.0187287985;抱,-8.18850304843;愉,-6.88964897274;贴,-8.09835195144;冷,-6.25343311393;邈,-11.7533298539;伸,-13.5450893231;飞,-12.4464770344;炽,-8.50813672069;綿,-9.41795493806;显,-5.66997004206;勁,-10.4095951072;象,-10.6006503439;促,-10.4095951072;莊,-7.02299652493;懇,-8.86295809598;廉,-7.59184598882;靈,-5.90304492023;友,-6.86298072566;帶,-11.4656477814;慌,-7.34661060661;虎,-12.8519421425;恒,-10.0187287985;踏,-8.06445039976;霸,-12.8519421425;毛,-10.4095951072;惝,-12.4464770344;篤,-11.4656477814;狡,-7.73095879128;恢,-9.63306631768;泥,-13.5450893231;赤,-8.90069842396;鼓,-11.9356514107;駑,-11.2425042301;叫,-10.7725006009;豪,-6.5329740288;惭,-7.98440769209;公,-5.97774364709;普,-5.28952066982;英,-6.93170510473;獰,-12.158794962;遲,-6.73605001706;整,-6.91308754571;淨,-12.158794962;荣,-8.1837971574;寻,-7.44926476067;渾,-7.9503779435;能,-9.16306268843;腼,-8.88165022899;繾,-11.1471940503;刁,-9.40195459671;简,-4.83678002721;會,-10.9060319935;善,-7.46744707976;随,-8.48884351776;侈,-12.8519421425;逍,-8.81770150439;心,-6.82849454958;鄙,-9.93417141046;圓,-7.22973132158;粘,-8.92996880626;瘙,-9.05645295337;猛,-7.077390597;森,-8.35770351726;跋,-9.15064016843;醜,-7.83797905836;生,-6.50630578172;庞,-6.40781088584;模,-7.04831433292;圣,-8.74106827837;大,-7.28169106051;温,-5.72024363208;辨,-8.08550380896;茫,-7.54615276116;貪,-7.61284413566;頭,-7.05740530462;冬,-12.158794962;唯,-9.37070205321;亮,-8.29806525094;爱,-6.30372303978;现,-12.158794962;傲,-8.5614827014;適,-5.12484765777;嘹,-9.38620623975;鹵,-11.599179174;耽,-11.4656477814;響,-7.95410234259;难,-5.75687776526;执,-7.93928725681;权,-13.5450893231;烂,-11.7533298539;兇,-6.84929040605;颠,-11.3478647458;义,-9.2410242299;操,-12.8519421425;筋,-11.7533298539;糊,-6.99543858087;恍,-8.36893959053;凌,-8.38603402389;敏,-6.14141903309;从,-7.49300015418;扑,-13.5450893231;体,-8.03975778717;懸,-7.77676832731;穎,-10.7725006009;衝,-6.95067586336;凜,-9.78388920741;纤,-8.25178449838;零,-7.5338221487;驳,-10.9801399656;內,-8.05615159695;苦,-7.22612120936;蹩,-10.3262134982;牽,-9.69494172139;荫,-10.4095951072;質,-8.49523331586;恭,-7.37967146887;规,-9.29659408106;绮,-9.41795493806;艱,-6.00819219354;聒,-9.48464631256;痴,-10.5493570496;具,-4.89196761446;競,-13.5450893231;幹,-5.25982818904;忸,-10.1111021186;死,-9.18838049642;铺,-10.1111021186;聽,-8.30864736027;懼,-11.599179174;长,-6.10025604921;肃,-7.54367444514;异,-5.8375771285;嚇,-10.2869927851;權,-13.5450893231;希,-10.0187287985;琐,-9.15064016843;颓,-8.4211253437;飛,-12.4464770344;酥,-9.85620986899;暗,-7.40952443202;妙,-11.2425042301;茁,-10.3262134982;挚,-12.8519421425;依,-12.4464770344;腻,-11.0601826733;皮,-10.837039122;暧,-8.78291538831;妩,-8.47618512088;倨,-10.5005668854;隆,-7.49771714406;骯,-8.36893959053;詼,-9.04527965277;安,-5.76020002745;傳,-8.7167755858;玲,-8.83555912179;娴,-8.76596582999;康,-9.20128390125;洶,-11.0601826733;熹,-10.6547175652;費,-7.67579240997;挺,-8.81770150439;辽,-7.73095879128;势,-9.65326902499;暴,-7.99212973818;局,-9.26842320409;杂,-8.4391438492;毅,-12.158794962;淺,-8.27208976454;凉,-7.96914021996;默,-8.36893959053;矍,-10.6547175652;陌,-7.34458014906;慎,-7.81824157552;豐,-4.64959669165;青,-8.85374144088;剔,-11.0601826733;仗,-9.15064016843;燙,-9.29659408106;腥,-9.12624871531;博,-7.72500639275;保,-6.61557255234;噜,-12.8519421425;神,-5.72665905103;淡,-8.57527602353;籠,-9.17564147064;面,-9.06775250863;寥,-10.5493570496;锋,-8.18850304843;敦,-9.71644792662;高,-4.4907012529;俭,-9.71644792662;端,-8.37460532807;深,-5.32334159476;瑰,-12.8519421425;洒,-9.09074202685;价,-10.2492524571;峻,-10.1777934931;幼,-7.97293529093;拿,-9.09074202685;气,-6.93708869781;洁,-8.39179772861;考,-11.7533298539;恶,-6.48204115972;窄,-9.17564147064;万,-10.5005668854;儉,-9.71644792662;热,-5.18454994173;尋,-7.44926476067;殊,-10.2869927851;服,-10.4095951072;寂,-6.83334892805;礙,-9.00179454083;彎,-11.9356514107;厚,-7.54615276116;輝,-7.11860086565;娟,-10.3670354928;雄,-6.74826560483;贪,-7.61284413566;連,-4.71104368194;愚,-7.54863723449;萎,-8.85374144088;丧,-9.59384560452;天,-7.88909751229;風,-7.66735354133;含,-7.39662102719;缭,-11.3478647458;榮,-8.1837971574;耳,-9.90750316338;节,-8.82659045181;熾,-8.50813672069;流,-7.46515612801;哀,-8.44522289528;迂,-9.41795493806;混,-6.22257888911;嗆,-12.4464770344;光,-6.66060267106;野,-7.78934710952;浑,-7.9503779435;单,-5.72545302074;拔,-10.0187287985;旖,-11.0601826733;妥,-7.67015859225;呛,-12.4464770344;诚,-6.91572606967;雜,-8.4391438492;機,-6.5356803904;節,-8.82659045181;顺,-7.32648920341;勤,-7.36094043217;虧,-10.9801399656;左,-13.5450893231;煩,-6.58569081097;惨,-7.24614007625;揪,-9.38620623975;彭,-13.5450893231;迫,-7.42479190415;良,-5.16463265526;辩,-13.5450893231;恳,-8.86295809598;毒,-10.1111021186;时,-8.08125751808;驚,-5.24108935215;罕,-6.78120441454;曼,-11.1471940503;承,-11.4656477814;花,-10.6547175652;鲁,-9.20128390125;威,-7.20826359196;太,-7.23154127683;理,-10.6006503439;肉,-9.98974126162;熨,-11.3478647458;開,-7.22432102885;較,-4.45827343741;宏,-6.98689152029;萬,-10.5005668854;岑,-12.4464770344;锐,-8.46368495812;投,-11.7533298539;得,-6.41579177418;尖,-6.82607616872;炙,-10.5005668854;怅,-9.53775613787;遒,-9.71644792662;刚,-7.54863723449;濃,-6.32033591734;缜,-9.18838049642;原,-5.91705819617;薄,-7.21536841758;没,-7.9503779435;素,-9.41795493806;丢,-8.38603402389;谦,-7.48596612752;碩,-8.82659045181;横,-9.88152767698;本,-13.5450893231;細,-5.93522712219;痒,-8.85374144088;祥,-8.67755487265;很,-4.66353083447;脸,-12.158794962;刺,-7.99212973818;溽,-13.5450893231;眼,-8.791499132;水,-10.5005668854;擁,-7.84130684845;臃,-9.41795493806;時,-8.08125751808;过,-7.09936950372;呆,-8.57527602353;先,-5.693817326;淋,-13.5450893231;削,-10.1438919414;露,-9.45074476088;滂,-11.0601826733;過,-7.09936950372;結,-7.40952443202;動,-7.55863731782;脏,-10.9060319935;俗,-9.98974126162;愧,-9.17564147064;慘,-7.24614007625;痛,-7.04530228245;缱,-11.1471940503;绝,-6.76858233073;张,-9.69494172139;駭,-10.2492524571;解,-9.98974126162;癢,-8.85374144088;拥,-7.84130684845;卤,-11.599179174;忧,-7.16158268822;龐,-6.40781088584;淫,-7.5996687145;懦,-12.158794962;黏,-10.0793534203;缓,-6.18689557037;可,-4.86986726746;确,-7.26282257621;異,-5.8375771285;干,-5.25982818904;嫵,-8.47618512088;執,-7.93928725681;價,-10.2492524571;典,-8.24677195656;麗,-12.8519421425;空,-6.66060267106;逼,-8.58224469285;顾,-10.5493570496;封,-5.75687776526;盡,-13.5450893231;亂,-13.5450893231;玄,-9.12624871531;顢,-11.1471940503;倉,-8.70880741615;洋,-10.711875979;準,-6.2055516277;不,-2.79908675836;龌,-9.6738883122;炎,-7.67297153363;少,-7.40520477088;醒,-8.62510839728;驯,-10.4095951072;弗,-13.5450893231;蘊,-12.8519421425;紛,-8.20275507114;媚,-11.2425042301;縝,-9.18838049642;果,-7.67579240997;簡,-4.83678002721;饱,-8.27208976454;亢,-8.86295809598;別,-7.8313565176;认,-11.599179174;憨,-9.38620623975;贫,-6.23120249147;中,-7.02741805019;摳,-10.6006503439;錯,-9.55610527654;肮,-8.36893959053;新,-6.14691523013;亲,-6.17422915657;感,-7.56115304242;強,-4.48139453147;陈,-8.26697466387;根,-4.89231683745;活,-7.23881403616;丽,-12.8519421425;雋,-10.0793534203;直,-7.61550017972;豁,-9.15064016843;元,-9.6738883122;囂,-9.22760120957;艷,-8.32473349803;均,-6.06748507991;偉,-6.38813295849;懈,-9.13837007584;霉,-11.4656477814;懶,-9.11427252426;湍,-8.55465673633;荏,-12.158794962;行,-11.4656477814;藐,-12.8519421425;軒,-9.96157038465;驕,-7.27032730186;罗,-9.50203805527;胡,-10.7725006009;急,-6.59907533201;坎,-8.6698919999;矜,-8.87226048864;孟,-10.1777934931;隽,-10.0793534203;污,-10.7725006009;无,-5.96643247251;酣,-9.78388920741;团,-6.53027497183;古,-5.83085817826;恩,-9.07918120445;鋪,-10.1111021186;蹭,-10.837039122;结,-7.40952443202;魯,-9.20128390125;壮,-6.97560790269;关,-10.4540468697;曲,-6.87813253068;牵,-9.69494172139;湿,-7.99212973818;齷,-9.6738883122;银,-11.1471940503;凸,-11.4656477814;骁,-9.41795493806;幽,-6.89740094954;達,-11.1471940503;极,-5.77275774794;一,-3.61871566678;劃,-8.63981454467;内,-8.05615159695;圆,-7.22973132158;厉,-6.5151164114;興,-7.1872470566;褊,-11.0601826733;純,-6.87052793129;馬,-9.01248982995;诙,-9.04527965277;昂,-7.72500639275;倔,-8.40929088605;粗,-6.13595287918;些,-9.13837007584;多,-6.54840783493;颟,-11.1471940503;瘠,-9.8315172564;冥,-10.5493570496;貧,-6.23120249147;朦,-6.75386786038;溫,-5.72024363208;優,-5.38571458633;隐,-7.18898166241;听,-8.30864736027;肯,-9.85620986899;遜,-8.5614827014;丰,-4.64959669165;劳,-7.52893216341;悲,-5.94119135458;破,-8.26697466387;伶,-8.74106827837;容,-4.94797650851;樸,-7.33448924608;麻,-7.58408398348;綽,-10.7725006009;見,-8.83555912179;连,-4.71104368194;款,-11.9356514107;诡,-7.60491807038;渊,-9.11427252426;钝,-13.5450893231;衰,-7.40520477088;鲠,-12.4464770344;介,-13.5450893231;煊,-10.5005668854;藍,-12.8519421425;難,-5.75687776526;像,-8.91036033488;华,-7.24798000317;近,-7.25167004426;乐,-5.64482328634;絢,-8.44522289528;联,-12.158794962;木,-9.71644792662;日,-10.837039122;慚,-7.98440769209;频,-6.33500969493;確,-7.26282257621;燥,-9.21435598282;烧,-10.1777934931;坦,-7.40736226902;審,-7.85472986878;落,-6.05232902218;潦,-9.34039670371;闭,-10.5005668854;屬,-9.07918120445;壯,-6.97560790269;疼,-9.37070205321;俱,-10.2128848129;陰,-7.1632733057;諳,-10.0187287985;戒,-12.4464770344;瓷,-11.2425042301;闲,-9.12624871531;对,-6.92368367134;任,-8.81770150439;誠,-6.91572606967;癲,-9.65326902499;省,-8.78291538831;蕪,-10.7725006009;缠,-8.84460895731;來,-10.2128848129;窈,-10.2128848129;下,-8.44522289528;憊,-10.1111021186;納,-10.2869927851;和,-6.14385805869;透,-6.47776947445;硬,-8.73290496773;蒙,-9.63306631768;黑,-7.02152701696;閒,-9.12624871531;愕,-8.791499132;险,-7.10733767337;甘,-9.31098281851;猙,-8.90069842396;窘,-9.02330074606;累,-10.711875979;膚,-9.50203805527;鲜,-6.14324774436;瀟,-8.26697466387;实,-7.75819194174;稚,-9.11427252426;谐,-9.76089968919;奇,-6.38813295849;萧,-7.63972747505;艰,-6.00819219354;羞,-7.8247775465;动,-7.55863731782;親,-6.17422915657;蔭,-10.4095951072;怯,-8.90069842396;鎮,-7.8020861353;弱,-9.01248982995;稳,-4.37588349449;疲,-5.86122534285;尷,-6.99115591908;謹,-5.80051951375;頻,-6.33500969493;蒼,-7.01713140548;耿,-9.65326902499;繞,-13.5450893231;磊,-10.5005668854;充,-5.81843565826;迷,-7.29126051153;歉,-9.6738883122;销,-9.8315172564;偏,-7.53627613766;坑,-13.5450893231;淒,-7.07119862675;畏,-9.57479740955;著,-7.01421169538;陸,-12.8519421425;闊,-8.80015719474;拘,-8.11574369415;虛,-6.50455293289;嫻,-8.76596582999;靡,-12.4464770344;曠,-11.4656477814;詫,-7.56115304242;入,-9.11427252426;煽,-10.711875979;癫,-9.65326902499;穢,-11.9356514107;蕭,-7.63972747505;蓬,-7.8479958366;聯,-12.158794962;遼,-7.73095879128;困,-7.33851339638;艳,-8.32473349803;聰,-6.60680483909;慵,-10.5493570496;质,-8.49523331586;歹,-9.59384560452;出,-6.40463628;沒,-7.9503779435;泼,-9.11427252426;灿,-7.67015859225;現,-12.158794962;躁,-10.1438919414;开,-7.22432102885;掃,-9.03422981659;悅,-8.73290496773;文,-8.70880741615;銀,-11.1471940503;舒,-6.24057337664;拖,-10.4540468697;澆,-13.5450893231;福,-13.5450893231;討,-10.711875979;肤,-9.50203805527;红,-7.72797816314;憂,-7.16158268822;辯,-13.5450893231;世,-11.4656477814;睿,-9.31098281851;辛,-7.33248322735;通,-7.18378684553;苗,-9.13837007584;甜,-7.81174804621;熟,-7.69288684333;传,-8.7167755858;肥,-6.36959960948;愤,-7.5662035582;喧,-11.599179174;带,-11.4656477814;窩,-8.59632943273;笨,-8.13344327125;怪,-8.03975778717;真,-5.70202530641;隱,-7.18898166241;地,-8.5892622655;害,-8.45749298787;悵,-9.53775613787;头,-7.05740530462;喷,-11.7533298539;嘶,-8.65474019488;犹,-6.66162673669;纵,-10.7725006009;狞,-12.158794962;瘋,-6.26370365953;被,-6.88451417327;爾,-11.9356514107;仁,-8.50166420619;着,-7.01421169538;參,-9.21435598282;稱,-9.04527965277;情,-9.55610527654;酸,-7.83797905836;忠,-7.18206121956;拉,-13.5450893231;埋,-11.7533298539;搶,-7.83466230573;响,-7.95410234259;敌,-8.13791755164;扎,-7.8247775465;滑,-7.84464574971;齐,-6.58189933723;乖,-8.7167755858;拙,-9.69494172139;識,-9.69494172139;做,-11.3478647458;蓝,-12.8519421425;臟,-10.9060319935;镇,-7.8020861353;满,-10.1438919414;靠,-8.50813672069;口,-13.5450893231;渺,-8.36893959053;僥,-8.06445039976;奧,-10.837039122;巧,-7.54367444514;晦,-9.63306631768;獨,-5.92242537178;快,-6.49844204526;聪,-6.60680483909;峭,-10.711875979;易,-8.21721315432;鬼,-10.4540468697;杰,-7.08205986618;熒,-10.9801399656;僵,-8.48884351776;兴,-7.1872470566;旷,-11.4656477814;晶,-8.15601759329;狹,-6.50982072382;遺,-7.08989075976;鮮,-6.14324774436;笃,-11.4656477814;堅,-5.59141954446;瑩,-11.0601826733;崇,-7.91746820941;了,-7.35682520002;守,-8.791499132;鎖,-11.1471940503;名,-7.8247775465;意,-5.92193625463;丑,-7.83797905836;謙,-7.48596612752;慷,-8.19798179239;怕,-7.96159301432;憔,-8.19323118963;洗,-9.55610527654;暖,-8.12455432383;標,-8.85374144088;殘,-6.54020733339;弛,-10.5493570496;悚,-10.0485817616;吝,-9.28240944606;喜,-7.40952443202;够,-9.85620986899;侠,-9.8315172564;欣,-7.43806643536;倥,-10.6006503439;憤,-7.5662035582;紧,-4.9739762897;利,-5.91414274221;讨,-10.711875979;漫,-6.84067496814;邪,-8.43310153475;窮,-8.32473349803;縱,-10.7725006009;撲,-13.5450893231;馴,-10.4095951072;慈,-6.84929040605;為,-9.29659408106;尽,-13.5450893231;涼,-7.96914021996;練,-9.96157038465;繁,-5.87746323152;激,-5.26640716013;蹊,-8.18850304843;凄,-7.07119862675;浇,-13.5450893231;细,-5.93522712219;婉,-8.30864736027;惊,-5.24108935215;跌,-12.4464770344;狎,-12.8519421425;忐,-9.48464631256;卓,-7.11698405042;硕,-8.82659045181;委,-8.08976820775;敗,-10.2128848129;曖,-8.78291538831;败,-10.2128848129;關,-10.4540468697;勞,-7.52893216341;陡,-7.77364819997;俠,-9.8315172564;正,-4.37328190085;賢,-9.29659408106;健,-5.26818584184;竞,-13.5450893231;穩,-4.37588349449;顽,-7.04080114957;貼,-8.09835195144;绰,-10.7725006009;飽,-8.27208976454;拮,-9.50203805527;乱,-13.5450893231;縹,-9.37070205321;灵,-5.90304492023;致,-8.2823991342;起,-8.66228740052;隨,-8.48884351776;特,-5.18454994173;轻,-5.66504112213;惺,-11.2425042301;命,-9.61326369038;詭,-7.60491807038;腿,-13.5450893231;晴,-8.26697466387;
+B,b:挂,-11.6689287134;專,-5.3922852241;随,-7.90772859775;預,-8.77855695555;抗,-9.10397935598;废,-8.35474270877;贞,-11.2634636053;礦,-8.2845384501;伪,-9.79712653654;作,-12.362075894;临,-4.18850040737;吸,-9.87716924422;机,-5.71828616086;宽,-10.7526379816;亿,-10.059490801;附,-5.46134522996;齊,-9.22658167808;反,-9.18402206366;姑,-9.52886254995;筒,-9.066239028;濕,-10.416165745;乔,-12.362075894;飛,-11.2634636053;軟,-9.27103344065;遠,-5.75407526871;知,-10.9757815329;烫,-10.7526379816;彪,-11.6689287134;啮,-8.86556833254;念,-10.059490801;年,-5.28204939408;滿,-7.71768499486;厂,-12.362075894;輕,-5.88972959951;五,-6.67171643968;無,-4.50420833467;厢,-10.2826343523;数,-10.416165745;循,-9.96418062121;單,-4.52689213874;螺,-9.02987138383;雄,-6.53902999852;契,-10.5703164248;教,-10.7526379816;衛,-8.4702555959;州,-8.11358065196;触,-10.5703164248;注,-10.1648513167;火,-6.58442357078;独,-7.30583008866;米,-10.9757815329;广,-4.4347515337;巾,-9.41763691484;閃,-9.96418062121;輪,-7.10458052198;順,-9.87716924422;粉,-7.24408208159;上,-3.63559469757;后,-6.58133237821;甘,-10.5703164248;键,-10.059490801;质,-7.84028731696;醫,-6.74167502829;离,-9.02987138383;便,-7.61714376564;虚,-7.39923126375;惡,-6.81689844953;民,-4.56437385849;盥,-9.18402206366;狭,-6.27530116709;矯,-9.96418062121;跳,-9.066239028;线,-9.6540256929;恶,-6.81689844953;數,-10.416165745;移,-9.14320006914;智,-9.41763691484;老,-6.55694092509;节,-9.41763691484;领,-9.79712653654;消,-6.72372122467;掌,-7.68924705954;树,-9.79712653654;北,-6.25728266159;貞,-11.2634636053;膠,-8.21894116761;欧,-8.37309184744;纪,-10.2826343523;乳,-8.83571536939;課,-9.22658167808;悶,-10.9757815329;精,-7.84028731696;汉,-9.02987138383;車,-8.04458778047;前,-6.91103744044;双,-5.28204939408;杏,-8.41083217542;浓,-9.36634362045;返,-11.2634636053;南,-7.23217717908;科,-6.97300416419;散,-8.03134255372;編,-9.10397935598;八,-8.20319281065;卷,-12.362075894;胶,-8.21894116761;固,-6.30763654774;导,-12.362075894;織,-10.2826343523;刀,-9.52886254995;脂,-11.2634636053;各,-11.6689287134;师,-9.27103344065;气,-7.28067152902;化,-11.6689287134;蔚,-11.6689287134;伞,-8.99478006402;分,-6.50987341423;箱,-9.47170413611;水,-5.18048394939;敞,-8.75115798136;沿,-7.34479605719;所,-3.22076410844;病,-12.362075894;摄,-9.6540256929;凍,-11.6689287134;灌,-10.7526379816;仓,-11.6689287134;慢,-5.5787506934;日,-5.07519948226;学,-9.066239028;凭,-10.5703164248;廳,-9.31755345628;饲,-10.9757815329;噸,-7.37164330723;技,-12.362075894;标,-12.362075894;載,-7.05380819661;专,-5.3922852241;從,-6.0723603231;加,-8.08540977499;别,-8.07161645286;启,-9.47170413611;十,-11.6689287134;密,-10.5703164248;手,-5.84440462109;緊,-8.20319281065;免,-9.58948717177;城,-6.53607578663;絕,-7.88473907953;风,-8.53343449752;连,-7.06375852746;卡,-10.059490801;顧,-8.31902462617;實,-7.84028731696;彩,-6.16563176621;六,-9.22658167808;矮,-10.7526379816;平,-7.73710308072;仿,-8.23494150896;在,-6.54794536218;書,-6.59688479122;飼,-10.9757815329;匀,-8.96087851234;适,-8.12796938941;压,-10.059490801;明,-10.9757815329;骑,-11.2634636053;純,-7.26220946618;團,-9.27103344065;额,-6.39849655039;夜,-9.14320006914;枣,-8.67319643989;莫,-7.50226348964;冷,-10.416165745;父,-7.28690207877;績,-7.72734690578;鋁,-8.83571536939;區,-7.0993857051;藏,-7.42760196088;歐,-8.37309184744;離,-9.02987138383;法,-5.58215398653;雙,-5.28204939408;毛,-7.43482220885;裝,-5.01735683986;鹞,-9.79712653654;恢,-12.362075894;哥,-7.93125909516;绩,-7.72734690578;叫,-9.6540256929;热,-9.6540256929;公,-4.19927454051;普,-9.10397935598;应,-8.09939601696;薄,-10.059490801;备,-10.5703164248;三,-5.06769859472;濃,-9.36634362045;階,-8.20319281065;负,-5.49306144334;組,-8.83571536939;掠,-10.9757815329;营,-9.36634362045;大,-3.28138873026;温,-11.6689287134;冬,-9.14320006914;唯,-4.34641827945;记,-8.12796938941;说,-10.9757815329;扁,-6.58133237821;奇,-7.2204123375;银,-7.86226622368;里,-8.96087851234;展,-9.72301856439;點,-9.72301856439;跨,-6.31707057997;藤,-8.17242115198;卫,-8.4702555959;禦,-7.69863679989;巴,-10.7526379816;虹,-9.47170413611;擺,-10.2826343523;滾,-9.36634362045;蜂,-11.6689287134;厅,-9.31755345628;暗,-7.68924705954;东,-5.89748759032;接,-9.27103344065;产,-10.7526379816;铁,-8.83571536939;区,-7.0993857051;夾,-8.55541340424;织,-10.2826343523;腎,-11.6689287134;壓,-10.059490801;毕,-8.09939601696;燙,-10.7526379816;保,-9.10397935598;神,-10.5703164248;孪,-8.2845384501;短,-3.60350638301;深,-5.48477982251;系,-10.059490801;幼,-9.52886254995;垂,-12.362075894;包,-9.96418062121;万,-5.66627697695;變,-11.2634636053;徒,-10.059490801;傘,-8.99478006402;黄,-10.1648513167;拱,-10.2826343523;連,-7.06375852746;丧,-9.72301856439;天,-4.56355284038;墨,-9.10397935598;石,-8.08540977499;農,-7.98004925933;禾,-12.362075894;雌,-7.00548961933;野,-5.2367928025;濒,-8.99478006402;络,-11.2634636053;機,-5.71828616086;左,-9.52886254995;磨,-10.7526379816;迫,-10.7526379816;副,-7.67072801178;泰,-10.9757815329;时,-10.7526379816;类,-8.6485038273;载,-7.05380819661;穿,-8.15738327462;将,-11.6689287134;開,-8.21894116761;鎏,-8.45005288858;萬,-5.66627697695;備,-10.5703164248;横,-8.60087577831;本,-9.96418062121;串,-9.18402206366;点,-9.72301856439;品,-12.362075894;時,-10.7526379816;过,-10.2826343523;豆,-11.6689287134;棉,-8.00536706732;祈,-11.6689287134;旋,-8.77855695555;過,-10.2826343523;孔,-11.2634636053;绝,-7.88473907953;潜,-6.09108746215;類,-8.6485038273;园,-12.362075894;華,-8.96087851234;走,-12.362075894;酸,-12.362075894;顾,-8.31902462617;暂,-6.07794173294;少,-9.96418062121;互,-9.87716924422;候,-7.03906591487;丝,-7.26220946618;增,-9.96418062121;酱,-12.362075894;別,-8.07161645286;弧,-10.5703164248;說,-10.9757815329;亲,-6.86490766871;活,-7.00548961933;總,-6.28903135991;直,-5.85928584809;协,-10.7526379816;胎,-7.57458415122;比,-10.9757815329;九,-9.22658167808;远,-5.75407526871;飞,-11.2634636053;无,-4.50420833467;团,-9.27103344065;古,-5.45832863642;药,-6.29365030576;女,-9.02987138383;湿,-10.416165745;瓶,-8.18768862411;翼,-9.6540256929;孿,-8.2845384501;塔,-8.80672783252;极,-8.45005288858;劃,-7.50226348964;内,-6.01293690263;計,-9.58948717177;锚,-12.362075894;同,-4.22878203278;醬,-12.362075894;研,-12.362075894;些,-11.6689287134;脚,-11.2634636053;四,-7.11505182185;劣,-7.87343952427;產,-10.7526379816;暫,-6.07794173294;断,-8.67319643989;听,-11.2634636053;洲,-7.65254569269;麻,-8.99478006402;騎,-11.2634636053;資,-6.04852784773;蛋,-11.6689287134;藍,-9.10397935598;华,-8.96087851234;近,-7.18592616143;桔,-9.27103344065;食,-7.31221988676;畢,-8.09939601696;臥,-8.55541340424;车,-8.04458778047;闭,-9.87716924422;买,-10.7526379816;絲,-7.26220946618;瓷,-9.96418062121;任,-7.42760196088;省,-5.99560544627;將,-11.6689287134;和,-10.7526379816;透,-9.10397935598;折,-8.4702555959;鲜,-9.72301856439;实,-7.84028731696;鹰,-10.9757815329;親,-6.86490766871;鎮,-12.362075894;弱,-8.99478006402;稳,-8.57788626009;網,-10.5703164248;主,-1.62718034466;充,-10.9757815329;等,-7.01974164204;偏,-10.416165745;网,-10.5703164248;鵝,-8.96087851234;曠,-10.1648513167;既,-5.27617442964;镭,-11.6689287134;擬,-11.2634636053;聯,-10.9757815329;影,-6.32420497408;極,-8.45005288858;出,-8.60087577831;课,-9.22658167808;最,-6.22434883992;億,-10.059490801;通,-9.6540256929;肥,-11.6689287134;並,-11.2634636053;头,-6.86901445067;斷,-8.67319643989;阶,-8.20319281065;界,-9.52886254995;黑,-7.02935710074;罐,-9.31755345628;棕,-8.18768862411;口,-11.6689287134;內,-6.01293690263;书,-6.59688479122;嫩,-8.11358065196;矫,-9.96418062121;旷,-10.1648513167;狹,-6.27530116709;壁,-10.2826343523;質,-7.84028731696;國,-4.90909356454;辐,-10.2826343523;可,-7.20302059479;暖,-8.86556833254;钢,-8.99478006402;急,-6.78992186183;紧,-8.20319281065;麦,-8.96087851234;讨,-12.362075894;喬,-12.362075894;男,-9.87716924422;船,-8.03134255372;輻,-10.2826343523;千,-9.14320006914;绿,-10.5703164248;敗,-11.6689287134;变,-11.2634636053;潛,-6.09108746215;穩,-8.57788626009;偽,-9.79712653654;述,-11.6689287134;長,-6.01819545988;特,-4.17951662994;司,-10.416165745;轻,-5.88972959951;西,-7.22627745696;羅,-8.67319643989;閉,-9.87716924422;合,-8.31902462617;袋,-9.36634362045;憑,-10.5703164248;耐,-7.5337621567;枕,-12.362075894;窗,-11.6689287134;外,-5.64669250767;鮮,-9.72301856439;两,-5.68499243276;吨,-7.37164330723;被,-8.53343449752;未,-12.362075894;纯,-7.26220946618;贮,-12.362075894;熱,-9.6540256929;阴,-9.18402206366;永,-6.60317412013;强,-7.47927397142;私,-5.94208096586;血,-10.416165745;母,-7.42760196088;金,-7.84028731696;啞,-10.9757815329;士,-10.5703164248;马,-10.9757815329;噴,-7.48687857081;鷹,-10.9757815329;切,-8.92808868952;针,-7.76695604387;隔,-6.56601814324;首,-5.36447991102;星,-8.04458778047;氣,-7.28067152902;订,-11.6689287134;交,-8.77855695555;港,-10.7526379816;鐳,-11.6689287134;总,-6.28903135991;阿,-11.6689287134;检,-6.6126829081;组,-8.83571536939;片,-7.27447955877;偶,-8.77855695555;填,-10.416165745;共,-7.08907633544;史,-7.20302059479;更,-11.6689287134;鋼,-8.99478006402;訂,-11.6689287134;逆,-8.62440627572;侏,-8.89633999121;導,-12.362075894;間,-5.30849016681;划,-7.50226348964;砖,-10.416165745;军,-5.84588281796;业,-6.53607578663;麥,-8.96087851234;第,-7.38534215159;殷,-8.43025026128;油,-10.7526379816;冻,-11.6689287134;抽,-10.416165745;磁,-10.5703164248;秋,-11.6689287134;歌,-10.416165745;腐,-9.27103344065;雕,-7.86226622368;裡,-8.96087851234;色,-10.059490801;资,-6.04852784773;桶,-8.96087851234;社,-10.9757815329;矿,-8.2845384501;清,-7.7873649155;袖,-8.20319281065;初,-5.9502576263;真,-8.62440627572;校,-10.5703164248;檢,-6.6126829081;群,-11.6689287134;土,-10.416165745;人,-6.20086857231;桁,-12.362075894;鹅,-8.96087851234;俄,-9.18402206366;升,-12.362075894;冠,-12.362075894;富,-12.362075894;處,-8.57788626009;滚,-9.36634362045;衡,-11.6689287134;卧,-8.55541340424;雪,-10.2826343523;寬,-10.7526379816;软,-9.27103344065;歷,-6.86490766871;建,-8.43025026128;板,-7.7873649155;稀,-8.33672420327;超,-5.0793147144;成,-7.15806920693;龙,-8.89633999121;计,-9.58948717177;违,-8.89633999121;貯,-12.362075894;舰,-6.85268755738;边,-7.33819537316;游,-6.90249037986;黃,-10.1648513167;捆,-10.416165745;立,-6.00250202533;低,-6.45127924997;发,-9.10397935598;囓,-8.86556833254;酒,-10.1648513167;棗,-8.67319643989;乘,-10.9757815329;討,-12.362075894;針,-7.76695604387;非,-4.22760832373;廣,-4.4347515337;工,-7.62587744561;矩,-11.6689287134;器,-9.31755345628;硬,-8.72448973428;轮,-7.10458052198;磷,-12.362075894;勻,-8.96087851234;七,-7.91942463752;紅,-7.95535664674;历,-6.86490766871;有,-4.33134096991;程,-8.69851424788;复,-7.10458052198;小,-4.9918452522;美,-7.39923126375;易,-10.9757815329;冒,-9.72301856439;伙,-11.6689287134;创,-11.6689287134;次,-6.26850612396;縣,-6.69219497103;败,-11.6689287134;隨,-7.90772859775;喪,-9.72301856439;微,-6.26175694199;电,-5.59819098544;家,-8.62440627572;浅,-7.0007837283;假,-8.45005288858;盈,-9.14320006914;線,-9.6540256929;章,-10.7526379816;橫,-8.60087577831;闪,-9.96418062121;業,-6.53607578663;擴,-9.52886254995;衷,-8.55541340424;淺,-7.0007837283;较,-8.89633999121;頂,-9.22658167808;爆,-9.36634362045;吊,-11.6689287134;优,-5.05554449507;掛,-11.6689287134;粥,-8.26773133178;木,-6.78992186183;宫,-9.79712653654;花,-9.47170413611;伸,-9.6540256929;显,-7.58295240089;心,-7.03906591487;顶,-9.22658167808;喷,-7.48687857081;牆,-10.5703164248;靈,-11.2634636053;嫡,-8.6485038273;赤,-8.96087851234;艦,-6.85268755738;英,-8.83571536939;柳,-9.6540256929;整,-3.46644626687;巨,-5.30331774149;都,-11.6689287134;百,-7.55805484927;简,-10.1648513167;較,-8.89633999121;嶄,-6.72372122467;刑,-5.85181755348;圓,-8.89633999121;农,-7.98004925933;生,-7.91942463752;模,-7.36486362024;頭,-6.86901445067;馬,-10.9757815329;贯,-10.416165745;现,-5.13368744243;育,-9.31755345628;鐵,-8.83571536939;医,-6.74167502829;節,-9.41763691484;裂,-9.72301856439;額,-6.39849655039;从,-6.0723603231;提,-8.04458778047;套,-11.6689287134;乙,-9.27103344065;忘,-8.96087851234;啟,-9.47170413611;履,-7.28690207877;照,-9.6540256929;齐,-9.22658167808;台,-8.69851424788;间,-5.30849016681;風,-8.53343449752;聽,-11.2634636053;长,-6.01819545988;异,-6.6649824075;龍,-8.89633999121;園,-12.362075894;香,-9.52886254995;領,-9.79712653654;漢,-9.02987138383;铝,-8.83571536939;貫,-10.416165745;傳,-9.58948717177;局,-9.47170413611;商,-9.96418062121;應,-8.09939601696;半,-7.28067152902;青,-6.57825071168;拟,-11.2634636053;淡,-6.93712587652;形,-9.79712653654;發,-9.10397935598;鄉,-9.87716924422;二,-4.31905500871;定,-6.7710889135;負,-5.49306144334;甚,-8.86556833254;昧,-9.14320006914;夹,-8.55541340424;流,-7.94323528621;桃,-12.362075894;闷,-10.9757815329;光,-8.55541340424;烈,-8.2845384501;救,-12.362075894;单,-4.52689213874;棘,-11.6689287134;絡,-11.2634636053;兩,-5.68499243276;部,-7.5337621567;只,-8.53343449752;卵,-7.95535664674;裸,-7.61714376564;承,-10.2826343523;紀,-10.2826343523;市,-6.75260409882;理,-11.6689287134;肉,-8.86556833254;舊,-7.18592616143;尖,-7.73710308072;墙,-10.5703164248;原,-6.87727896052;庭,-10.416165745;防,-8.55541340424;德,-10.2826343523;眼,-11.2634636053;县,-6.69219497103;摆,-10.2826343523;先,-6.56906228562;削,-11.6689287134;軍,-5.84588281796;哑,-10.9757815329;動,-12.362075894;協,-10.7526379816;常,-5.14316618639;裙,-9.52886254995;婚,-10.9757815329;孤,-9.87716924422;全,-5.28965399347;異,-6.6649824075;迷,-7.28067152902;空,-6.36562380539;国,-4.90909356454;稅,-7.20878429951;倉,-11.6689287134;洋,-12.362075894;不,-6.58442357078;後,-6.58133237821;向,-8.62440627572;良,-6.69564920589;果,-9.87716924422;簡,-10.1648513167;綠,-10.5703164248;红,-7.95535664674;紫,-6.95042984215;中,-3.54448185773;新,-3.86141867123;強,-7.47927397142;根,-10.416165745;鍵,-10.059490801;肾,-11.6689287134;廂,-10.2826343523;蝇,-11.6689287134;重,-5.77177484581;偌,-7.21458141719;盒,-8.99478006402;罗,-8.67319643989;柜,-10.9757815329;廢,-8.35474270877;適,-8.12796938941;臨,-4.18850040737;腳,-11.2634636053;創,-11.6689287134;觸,-10.5703164248;白,-8.4702555959;一,-3.93415117035;圆,-8.89633999121;事,-10.5703164248;粗,-9.27103344065;编,-9.10397935598;記,-8.12796938941;多,-4.93374269982;御,-7.69863679989;溫,-11.6689287134;優,-5.05554449507;甲,-7.22627745696;買,-10.7526379816;容,-11.2634636053;示,-9.22658167808;櫃,-10.9757815329;限,-10.9757815329;联,-10.9757815329;橘,-9.10397935598;盛,-6.20509690842;惟,-6.16971340453;信,-8.33672420327;嫣,-9.14320006914;警,-9.72301856439;陰,-9.18402206366;对,-10.9757815329;電,-5.59819098544;企,-10.416165745;预,-8.77855695555;按,-10.9757815329;下,-5.92913580127;隐,-6.37813961332;閒,-8.4908748831;攝,-9.6540256929;速,-8.35474270877;夥,-11.6689287134;动,-12.362075894;師,-9.27103344065;崭,-6.72372122467;宮,-9.79712653654;朱,-8.14256818883;鷂,-9.79712653654;草,-6.34836073796;村,-7.48687857081;高,-4.2361490913;虛,-7.39923126375;廠,-12.362075894;自,-7.16911904312;赭,-9.52886254995;顯,-7.58295240089;東,-5.89748759032;闲,-8.4908748831;現,-5.13368744243;开,-8.21894116761;处,-8.57788626009;銀,-7.86226622368;布,-12.362075894;税,-7.20878429951;世,-7.63468807529;甜,-11.2634636053;传,-9.58948717177;瘦,-9.6540256929;助,-7.10458052198;錨,-12.362075894;隱,-6.37813961332;地,-7.80819900241;装,-5.01735683986;植,-10.9757815329;遊,-6.90249037986;坐,-10.9757815329;藥,-6.29365030576;湖,-10.2826343523;蓝,-9.10397935598;營,-9.36634362045;满,-7.71768499486;旧,-7.18592616143;獨,-7.30583008866;快,-11.6689287134;右,-7.25008810565;混,-5.64306273962;并,-11.2634636053;竹,-9.10397935598;學,-9.066239028;顺,-9.87716924422;丁,-12.362075894;往,-9.52886254995;蠅,-11.6689287134;授,-9.10397935598;邊,-7.33819537316;對,-10.9757815329;瀕,-8.99478006402;標,-12.362075894;斜,-9.41763691484;漫,-10.7526379816;庶,-9.87716924422;樹,-9.79712653654;落,-10.9757815329;起,-8.07161645286;镇,-12.362075894;集,-8.20319281065;違,-8.89633999121;期,-8.72448973428;橙,-9.10397935598;靛,-8.67319643989;磚,-10.416165745;乡,-9.87716924422;忠,-8.86556833254;正,-5.8196039335;波,-8.80672783252;扩,-9.52886254995;即,-8.30163288346;灵,-11.2634636053;海,-8.0580108008;命,-9.72301856439;魔,-9.47170413611;
+B,c:宁,-11.5009465028;一,-4.75541607895;再,-6.18282650899;同,-2.92242305627;且,-6.26317563616;倘,-5.29739935177;甚,-8.82679785341;进,-5.8625918335;縱,-7.20026550762;那,-5.9053061868;接,-4.53374376521;况,-6.44152104457;然,-3.30595781791;所,-3.14175305607;但,-3.08889162954;豈,-10.4893455912;反,-6.62765939989;而,-2.94280332509;慢,-10.4023342142;这,-7.60912620472;若,-7.457895235;怎,-8.65313435936;惟,-9.39073330249;非,-7.87660556986;换,-6.89577631685;除,-5.85021324927;继,-6.94970465887;尽,-4.04897918107;恰,-8.03521060004;其,-5.04614109853;繼,-6.94970465887;尔,-7.87660556986;如,-2.76253160567;還,-4.26767160592;與,-4.75836072183;二,-6.33616052891;從,-4.10124265586;無,-4.72216160515;加,-6.19267880543;别,-8.09974912117;甭,-8.93599714537;是,-6.44470069749;由,-2.72930491028;概,-11.7886285753;总,-5.66030484546;设,-8.93599714537;乃,-5.9034508987;及,-4.52716942831;故,-7.93848097358;假,-6.19764159478;轉,-6.69487837448;之,-5.52206073793;緊,-6.73026187837;何,-5.83106557985;因,-2.12320787466;既,-4.8157099704;另,-3.65533471406;否,-5.26849848628;更,-9.17366879725;相,-8.59678142281;综,-7.99689173573;与,-4.75836072183;抑,-7.9243962337;倒,-9.66836503909;或,-3.73601375647;尚,-7.52594869825;並,-4.23028573016;莫,-9.33189280247;進,-5.8625918335;纵,-7.20026550762;为,-7.39007263866;爾,-7.87660556986;況,-6.44152104457;要,-5.07405359643;毋,-9.01603985305;換,-6.89577631685;盡,-4.04897918107;以,-2.77661719825;此,-3.81777305086;寧,-11.5009465028;转,-6.69487837448;可,-3.97369058346;并,-4.23028573016;岂,-10.4893455912;不,-2.56813987226;于,-4.11045648025;這,-7.60912620472;果,-8.79289630173;別,-8.09974912117;紧,-6.73026187837;設,-8.93599714537;綜,-7.99689173573;就,-7.23826662579;庶,-9.33189280247;為,-7.39007263866;總,-5.66030484546;於,-4.11045648025;又,-12.887240864;从,-4.10124265586;雖,-3.16899913973;还,-4.26767160592;无,-4.72216160515;哪,-6.25655747831;即,-4.11416591264;具,-8.48052161669;只,-3.76748187021;固,-6.54160450313;虽,-3.16899913973;
+B,df:不,0.0;
+B,d:趁,-7.11166369798;极,-5.29659954143;异,-6.92726385848;待,-9.20366646553;冉,-8.68835652932;合,-10.2583156308;權,-9.18144332875;亏,-8.68835652932;憑,-8.78702805682;轻,-5.73197920611;阔,-11.2073961855;暗,-6.15967921647;鼎,-10.4342062972;会,-12.3060084741;依,-4.83749520265;轉,-8.29414013374;亟,-10.4734270104;接,-7.4213144034;怨,-9.54916810887;被,-6.30027126775;未,-5.74781067133;纯,-7.95250992308;拢,-12.5936905466;铁,-10.0813849226;临,-10.0034233811;纷,-5.46894393578;專,-5.4983498117;方,-6.81500676377;永,-5.70852176629;悻,-8.9216182108;伺,-9.11759185676;势,-7.43847402369;放,-8.03631102444;私,-7.29871208131;盡,-5.30909828385;必,-4.02605775842;附,-9.63185982472;秉,-9.97873076856;豈,-8.19104462472;半,-9.50264809324;反,-4.87871563079;经,-5.52637069794;而,-7.8751916753;姑,-9.18144332875;恐,-6.08194521695;壓,-8.51051928497;牢,-7.8751916753;毕,-5.78281334259;序,-11.7463926862;泛,-9.95463321698;迄,-7.79240548168;保,-8.99182246947;頻,-7.28542284919;拟,-9.29785368059;凡,-6.80781618322;遠,-6.13014120404;止,-8.31240548172;该,-9.40184339411;渐,-6.03928242146;早,-4.98135370943;恨,-7.86042035798;扬,-11.3897177423;奮,-7.78150619122;深,-6.65001666332;恰,-6.44593475516;想,-7.48371280917;赶,-5.12498703444;其,-4.8552024241;顷,-8.86398909796;疾,-9.88564034549;忽,-5.22157251826;毫,-7.17315554732;仿,-6.09641291754;頃,-8.86398909796;恶,-9.74105911668;的,-6.63440489785;万,-7.71088862401;自,-4.03580336885;誓,-9.47279513009;殊,-11.7463926862;霍,-8.88828179053;较,-5.55637006326;昏,-11.6128612936;转,-8.29414013374;頓,-6.24688527856;徒,-8.59855263446;輕,-5.73197920611;隔,-10.1369547738;首,-5.04777239539;故,-6.37442663664;厚,-10.3600983251;猝,-9.93110271957;飄,-9.50264809324;無,-4.80506448097;究,-5.71708199661;甚,-4.40917679356;鬥,-9.82110182435;交,-12.9991556547;天,-9.64925156743;循,-10.3964659693;單,-6.22207869936;由,-5.86585969981;碰,-9.41563671625;厲,-7.72104099547;嚴,-10.2911054536;直,-10.8590894912;紧,-6.34693799485;改,-8.96491501655;总,-5.29321773233;整,-6.35341470142;理,-10.919714113;緊,-6.34693799485;諄,-10.7478638561;片,-10.5142490049;准,-9.20366646553;光,-8.58031504691;沒,-9.07718231842;及,-8.19924139192;開,-10.8019310774;胡,-7.84297805532;插,-12.5936905466;何,-5.75958180778;飘,-9.50264809324;揚,-11.3897177423;也,-5.23337455198;恣,-9.58142897109;顺,-6.69562134709;扶,-10.919714113;执,-8.44002940722;左,-11.7463926862;通,-5.12536755195;火,-7.91155931947;只,-4.47409350491;独,-6.62583586513;差,-7.15996854304;共,-5.07183129439;更,-4.18512245305;时,-6.15914402781;单,-6.22207869936;基,-6.17641375005;衷,-9.34849741341;拼,-7.80065862344;广,-8.51051928497;谆,-10.7478638561;輪,-8.1510392901;率,-6.59392719667;将,-7.02153651442;悉,-8.14712539078;愈,-6.78554805661;見,-9.38823774206;較,-5.55637006326;频,-7.28542284919;裡,-12.3060084741;經,-5.52637069794;稍,-6.48222320709;默,-7.64021366634;備,-11.7463926862;业,-8.16684989613;原,-4.5097448443;没,-9.07718231842;素,-8.41418817603;诚,-9.27346222747;侧,-8.96491501655;用,-6.80781618322;截,-8.73647577766;本,-5.46840745508;細,-7.84010035549;决,-7.42510228672;抵,-10.8019310774;驟,-7.95573053778;油,-10.6965705617;贸,-8.00532747892;马,-6.38175267673;连,-5.40603338248;抽,-12.9991556547;似,-4.97282207441;倾,-11.1273534778;況,-11.2073961855;兀,-8.40909910652;時,-6.15914402781;仅,-5.99836550975;过,-5.65121183155;屆,-7.24183241312;先,-5.00384903441;始,-5.85474847438;仍,-4.60763907137;驀,-7.84010035549;每,-8.36442666647;简,-6.38845960998;動,-7.80898044677;協,-10.919714113;步,-12.0828649228;痛,-10.3964659693;嚎,-9.41563671625;最,-4.1326445158;潜,-8.57430902285;迟,-7.23553317969;惡,-9.74105911668;少,-8.93871264416;提,-13.6923028353;强,-7.72615609614;以,-5.91660708535;虧,-8.68835652932;寧,-7.23867783637;全,-5.88805145173;間,-8.70187024848;實,-4.6340652415;竭,-7.19101316472;確,-10.9842526342;可,-8.32632682024;确,-10.9842526342;異,-6.92726385848;至,-4.83792337649;干,-6.88547347487;却,-5.53121332242;執,-8.44002940722;偶,-7.02661911748;绝,-5.31506160427;空,-8.26735281778;老,-8.49934598437;见,-9.38823774206;暂,-5.86506193351;興,-9.09718298513;径,-7.5942285531;指,-10.9842526342;肆,-9.14900805299;不,-2.91232623274;隨,-4.41001396397;向,-6.42198994918;魚,-10.919714113;互,-5.65056812378;這,-8.18291449863;毅,-8.493805804;紛,-5.46894393578;初,-5.8433691089;果,-5.72953890509;真,-4.08412638234;簡,-6.38845960998;統,-7.96871773331;严,-10.2911054536;群,-10.0813849226;这,-8.18291449863;險,-8.20336510911;中,-7.86630272788;瞬,-11.2073961855;舍,-9.22639471661;就,-4.72863055965;新,-8.25858083171;死,-8.63605702991;亲,-5.37551370819;強,-7.72615609614;悶,-11.1273534778;趸,-12.9991556547;活,-7.80898044677;人,-7.23396455192;爽,-12.5936905466;傾,-11.1273534778;豁,-10.1659423106;齊,-8.29867528891;久,-7.62156510726;俄,-10.4342062972;迥,-11.3897177423;忍,-9.63185982472;奋,-7.78150619122;益,-9.5334197519;才,-9.37481472173;双,-8.15891334654;协,-10.919714113;行,-9.0194740008;處,-7.25455118553;比,-4.33976869758;相,-3.87639045498;遙,-12.9991556547;別,-9.93110271957;捎,-13.6923028353;远,-6.13014120404;轟,-8.84027257134;飞,-8.42961264636;屡,-7.6908879573;几,-4.73132166142;慣,-9.56516845022;勢,-7.43847402369;古,-9.24965157877;蓦,-7.84010035549;適,-8.34044470179;臨,-10.0034233811;對,-6.44451025349;援,-12.5936905466;歷,-7.05504480398;屹,-12.9991556547;白,-8.4505558202;遥,-12.9991556547;使,-11.2073961855;链,-12.9991556547;宁,-7.23867783637;一,-2.70121338658;超,-10.1087838968;颇,-9.58142897109;开,-10.8019310774;厉,-7.72104099547;席,-10.8590894912;事,-7.06691046725;再,-4.40305886569;同,-4.66348433991;躉,-12.9991556547;霎,-8.70869621355;徑,-7.5942285531;成,-7.89018445989;百,-8.75066041265;适,-8.34044470179;趕,-5.12498703444;曠,-11.6128612936;粗,-9.78027982983;些,-10.5142490049;多,-5.56815223196;飛,-8.42961264636;約,-8.2369817199;索,-7.65921661346;尤,-4.92965680561;暫,-5.86506193351;太,-9.97873076856;断,-7.95250992308;萬,-7.71088862401;颯,-12.3060084741;到,-5.07743861667;銳,-9.56516845022;况,-11.2073961855;竟,-5.73372593145;徹,-9.47279513009;常,-5.6289250129;格,-6.95771117529;岿,-12.0828649228;慨,-9.44380759321;迅,-9.74105911668;所,-9.17051425821;終,-5.01947435231;逐,-4.18899438641;擇,-10.0547166755;但,-8.80195370704;立,-4.63814854648;巍,-10.2265669325;廣,-8.51051928497;低,-6.96967304041;近,-6.9952685876;敢,-9.37481472173;联,-9.03834248511;娓,-11.4950782579;忙,-9.03834248511;乘,-7.11166369798;四,-6.91011077926;明,-7.42320655156;旋,-8.58635736136;惟,-8.74354294488;非,-4.46953994329;信,-9.86366143877;顶,-8.33101066955;代,-12.0828649228;慢,-5.89995391115;日,-5.4000047282;锐,-9.56516845022;總,-5.29321773233;囫,-9.34849741341;凭,-8.78702805682;硬,-7.95250992308;惯,-9.56516845022;据,-7.13127216937;頂,-8.33101066955;緩,-6.84748735605;側,-8.96491501655;对,-6.44451025349;幸,-7.00644188819;任,-7.26743381136;鱼,-10.919714113;純,-7.95250992308;如,-7.7364654658;悄,-6.5314569286;將,-7.02153651442;历,-7.05504480398;按,-7.24025388083;劈,-8.55063927876;下,-12.9991556547;該,-9.40184339411;酣,-10.919714113;权,-9.18144332875;倏,-8.70187024848;美,-10.1659423106;预,-7.54811720114;源,-9.74105911668;专,-5.4983498117;特,-4.28746533056;险,-8.20336510911;頗,-9.58142897109;累,-10.0034233811;轮,-8.1510392901;借,-8.06109105344;实,-4.6340652415;次,-11.3897177423;加,-8.53324753605;刚,-5.39675431904;纵,-7.50815394433;动,-7.80898044677;别,-9.93110271957;親,-5.37551370819;微,-6.6190331178;順,-6.69562134709;稳,-6.65351929387;匹,-12.9991556547;誠,-9.27346222747;刻,-8.06109105344;爭,-8.56240412034;額,-8.66842231442;十,-4.52434817978;骤,-7.95573053778;晃,-13.6923028353;充,-9.21496602078;蓄,-9.06733002198;顿,-6.24688527856;草,-8.96491501655;终,-5.01947435231;手,-9.80048253715;當,-4.61824048158;免,-10.5568086193;背,-9.05757384703;偏,-6.94589070669;迎,-7.94929964745;打,-12.9991556547;絕,-5.31506160427;著,-7.56981002575;陸,-6.06038632219;高,-4.90142508104;剛,-5.39675431904;貿,-8.00532747892;勻,-9.95463321698;愤,-8.66842231442;因,-9.56516845022;略,-7.55673794418;另,-8.30323110545;拨,-12.9991556547;橫,-8.56833885586;带,-9.76047720254;業,-8.16684989613;擬,-9.29785368059;聯,-9.03834248511;仰,-8.60470650003;平,-8.80195370704;已,-3.07280643302;極,-5.29659954143;滿,-6.55026626056;偷,-7.30879620038;挨,-8.9473707069;書,-8.9473707069;登,-8.05751323209;好,-5.95120374523;與,-9.95463321698;現,-7.28048456755;突,-10.4734270104;匀,-9.95463321698;侃,-10.6012603819;堂,-11.6128612936;处,-7.25455118553;分,-4.22701021546;争,-8.56240412034;压,-8.51051928497;悍,-9.80048253715;与,-9.95463321698;沿,-8.3499685833;倒,-9.34849741341;攔,-9.22639471661;斗,-9.82110182435;或,-6.08691047045;團,-8.66186491387;尚,-5.7153640783;额,-8.66842231442;闊,-11.2073961855;窄,-7.71595192596;务,-7.63551882203;陡,-8.40909910652;撥,-12.9991556547;切,-8.19104462472;並,-5.87065970902;在,-10.0034233811;莫,-7.07356385175;怪,-8.3499685833;足,-7.31387665161;有,-4.62525563311;難,-4.80520263114;進,-4.48627173487;悵,-10.3964659693;头,-10.4734270104;冷,-8.19513460997;帶,-9.76047720254;漸,-6.03928242146;举,-10.2265669325;着,-7.56981002575;越,-4.90036084681;僅,-5.99836550975;斷,-7.95250992308;无,-4.80506448097;毋,-11.2944075625;届,-7.24183241312;酌,-9.27346222747;齐,-8.29867528891;团,-8.66186491387;小,-6.49711551508;乖,-9.21496602078;務,-7.63551882203;存,-9.97873076856;进,-4.48627173487;跟,-12.9991556547;满,-6.55026626056;口,-12.0828649228;屢,-7.6908879573;书,-8.9473707069;择,-10.0547166755;獨,-6.62583586513;快,-5.0700291674;苦,-8.16684989613;公,-8.18291449863;眼,-7.93025145248;狠,-7.26743381136;轰,-8.84027257134;遲,-7.23553317969;闷,-11.1273534778;兴,-9.09718298513;旷,-11.6128612936;并,-5.87065970902;统,-7.96871773331;翻,-12.5936905466;決,-7.42510228672;幾,-4.73132166142;往,-5.24167688812;會,-12.3060084741;岂,-8.19104462472;怅,-10.3964659693;备,-11.7463926862;随,-4.41001396397;舉,-10.2265669325;很,-4.90554062682;倍,-9.68496965003;攏,-12.5936905466;于,-8.34044470179;徐,-8.6950905615;缓,-6.84748735605;撒,-9.90811320134;準,-9.20366646553;擅,-7.83723091306;猛,-6.45740441495;生,-8.48829614819;掠,-12.0828649228;欣,-8.59243640744;定,-5.74923011798;急,-6.10600652811;憤,-8.66842231442;大,-3.40022509184;约,-8.2369817199;畢,-5.78281334259;末,-11.2073961855;陆,-6.06038632219;頭,-10.4734270104;馬,-6.38175267673;唯,-8.58635736136;縱,-7.50815394433;现,-7.28048456755;傲,-10.0547166755;鐵,-10.0813849226;預,-7.54811720114;逆,-9.48761021587;横,-8.56833885586;從,-4.59334105127;尽,-5.30909828385;巋,-12.0828649228;难,-4.80520263114;千,-9.82110182435;聊,-10.9842526342;居,-6.79459789213;長,-4.70373195905;细,-7.84010035549;婉,-10.3964659693;鏈,-12.9991556547;零,-8.93012890046;恍,-8.79446303531;連,-5.40603338248;从,-4.59334105127;批,-8.63605702991;当,-4.61824048158;飒,-12.3060084741;委,-9.78027982983;過,-5.65121183155;忘,-11.1273534778;潛,-8.57430902285;據,-7.13127216937;彻,-9.47279513009;竞,-8.68835652932;幡,-11.6128612936;正,-5.10260295306;健,-12.0828649228;重,-4.93814208594;照,-6.88436789156;拦,-9.22639471661;穩,-6.65351929387;於,-8.34044470179;雙,-8.15891334654;即,-5.63050056072;间,-8.70187024848;起,-6.70204633477;競,-8.68835652932;幹,-6.88547347487;卻,-5.53121332242;里,-12.3060084741;遽,-11.4950782579;长,-4.70373195905;曾,-5.63334281749;
+B,e:哇,-6.52795791762;哈,-4.13006264482;啊,-1.85512908316;哎,-0.526543039661;嗚,-2.55766600407;呜,-2.55766600407;尚,-4.91852000519;天,-2.52062473239;嗨,-4.91852000519;噫,-6.52795791762;嗬,-5.42934562895;好,-2.86439627149;
+B,f:一,-5.96797248623;境,-10.5971381778;内,-3.81786583187;最,-3.2274474442;頭,-7.8517004446;同,-4.5575639701;外,-3.81381297717;脚,-5.94046043464;东,-3.2615973274;管,-8.0544119571;两,-4.56610956987;身,-5.53544771288;箱,-8.93213041419;場,-9.04654076536;边,-6.87316740385;区,-9.97809896937;沿,-3.90434571802;旁,-4.77536104964;盡,-6.4815914079;附,-3.66902020427;反,-7.10932632328;行,-9.07731242403;近,-7.15397659701;四,-4.91842934067;面,-4.09028699557;早,-6.75308815593;周,-4.40594493719;端,-11.1567539657;年,-7.0096588381;當,-5.24190052097;对,-6.1117172449;下,-4.27226731367;樓,-8.02125974978;丛,-7.14942078048;天,-9.07731242403;宮,-6.97470382307;側,-6.00201832764;之,-1.72191096638;其,-5.80371169947;背,-5.40022092567;偏,-7.2855529548;城,-7.14037094496;叢,-7.14942078048;左,-5.6453433837;兩,-4.56610956987;業,-5.62831743411;東,-3.2615973274;开,-8.6310253214;頂,-5.69292216068;開,-8.6310253214;上,-3.54800735215;后,-3.73214129073;底,-4.95017803899;林,-8.44870376461;业,-5.62831743411;侧,-6.00201832764;宫,-6.97470382307;庭,-10.9336104144;足,-7.82454945554;头,-7.8517004446;尾,-8.6310253214;區,-9.97809896937;稍,-10.2404632338;正,-6.87662163872;跟,-6.14945757288;裡,-4.10858478301;场,-9.04654076536;以,-1.4809986012;路,-11.4444360382;右,-5.67715725195;顶,-5.69292216068;楼,-8.02125974978;邊,-6.87316740385;對,-6.1117172449;後,-3.73214129073;北,-3.51363049073;贛,-10.7512888576;肚,-6.96709922368;初,-4.92479722895;斜,-9.01668780221;期,-3.54466431678;校,-10.145153054;大,-9.32417250196;末,-6.0121706991;中,-3.34104259164;关,-7.01361923932;皮,-7.23974341877;週,-4.40594493719;先,-8.95952938837;尽,-6.4815914079;前,-3.36007915165;里,-4.10858478301;当,-5.24190052097;南,-3.20704493686;關,-7.01361923932;赣,-10.7512888576;內,-3.81786583187;山,-7.78087439203;腳,-5.94046043464;西,-3.43396578693;
+B,h:超,0.0;
+B,in:心,0.0;
+B,i:怀,-8.41371285156;挂,-11.8794487544;蛛,-7.43679749787;志,-7.12585856326;誇,-8.02930115265;耀,-7.92820503578;涉,-11.1863015738;專,-7.64534224977;振,-7.30473777586;随,-6.41986324022;悬,-6.77350328046;貓,-11.1863015738;渔,-8.98907699647;料,-9.04623541031;鐘,-9.57686366137;曠,-7.98762845625;宝,-10.4931543932;废,-8.9350097752;洞,-7.98762845625;造,-8.9350097752;骇,-7.73631402797;晨,-11.1863015738;谨,-8.09525912045;潜,-8.26853084172;鶉,-11.1863015738;河,-10.0876892851;欲,-7.35766017731;临,-7.68979401234;膠,-10.4931543932;谈,-6.66996260152;方,-7.40211193989;贵,-8.98907699647;机,-8.32410069287;宽,-8.00824774346;附,-9.10686003212;談,-6.66996260152;骨,-8.24186259464;屈,-7.67475613497;齊,-7.24471976613;反,-6.60133409513;解,-7.14325030597;舌,-10.4931543932;姑,-9.17139855326;賓,-10.2700108419;乔,-8.54724424419;狗,-7.57538366116;纸,-8.41371285156;若,-6.37819054382;飛,-6.78569855356;坚,-6.12054698049;寝,-11.1863015738;统,-7.92820503578;此,-5.9850459201;凡,-8.4782513727;遠,-6.93068886399;賢,-9.68222417703;甜,-8.4782513727;噤,-8.88371648081;逐,-8.98907699647;緩,-7.75231436932;彪,-8.88371648081;揭,-8.3829411929;扬,-6.89584213266;阖,-11.1863015738;鳳,-8.24186259464;歲,-9.68222417703;念,-6.95946782854;年,-7.41354063571;其,-7.73631402797;摸,-10.2700108419;馋,-9.24039142475;达,-7.80191131046;滿,-6.27732993348;踔,-11.1863015738;愁,-7.1087641299;邀,-10.0876892851;吃,-7.60278263535;扪,-9.17139855326;娇,-8.54724424419;榆,-9.93353860531;鴉,-7.29448127569;沈,-7.54871541408;羊,-8.70139492402;禦,-11.8794487544;昏,-8.11824863867;转,-6.59118172367;颐,-7.90915684081;谓,-11.1863015738;观,-9.93353860531;引,-5.75915133541;五,-5.75915133541;列,-8.41371285156;计,-8.83492631664;错,-6.62195338234;畅,-7.70506148447;轻,-5.85358278054;謝,-7.75231436932;丟,-8.83492631664;賄,-9.57686366137;無,-3.78110990817;悠,-8.70139492402;探,-8.00824774346;遇,-10.0876892851;胆,-6.65909292929;異,-6.18908930004;洩,-9.80000721268;貨,-7.73631402797;循,-7.17896838857;犬,-7.87211556913;是,-8.32410069287;單,-7.52273992767;失,-7.03526166791;讲,-9.93353860531;張,-6.81054455214;麟,-11.8794487544;户,-11.8794487544;改,-6.76145494195;蒸,-8.35308822975;蠻,-9.93353860531;欽,-7.11727481957;鸿,-9.93353860531;趾,-8.29592981591;允,-10.4931543932;臭,-8.11824863867;参,-7.80191131046;睥,-11.1863015738;视,-7.01963635;配,-11.1863015738;恋,-8.05080735787;俊,-11.1863015738;鋌,-7.76857489019;繼,-9.24039142475;惹,-8.02930115265;寒,-11.1863015738;何,-6.81054455214;滔,-7.40211193989;鉗,-11.8794487544;教,-10.4931543932;顛,-7.32557186276;孝,-9.10686003212;惠,-10.2700108419;叢,-10.7808364657;来,-6.28473737476;囤,-8.6605729295;狐,-7.76857489019;浩,-7.18810087213;峨,-10.0876892851;火,-6.66996260152;晓,-8.26853084172;问,-7.42510145811;銳,-9.80000721268;声,-6.15260100678;米,-10.4931543932;诲,-9.39454210458;滴,-8.41371285156;凶,-7.29448127569;科,-10.7808364657;智,-8.78840630101;孽,-11.8794487544;阴,-6.77350328046;广,-9.17139855326;巾,-8.6605729295;儀,-8.98907699647;喃,-7.67475613497;街,-8.21588710823;堆,-7.52273992767;沉,-7.54871541408;紈,-9.3144993969;上,-7.80191131046;劍,-8.07278626459;非,-6.67544206729;后,-6.00733096489;静,-10.2700108419;涓,-11.1863015738;井,-7.16094988307;绘,-8.09525912045;蒙,-7.41354063571;甘,-8.44546154988;牛,-7.14325030597;驕,-8.24186259464;簞,-9.93353860531;股,-9.39454210458;鎩,-9.04623541031;岩,-10.4931543932;质,-10.0876892851;豪,-8.02930115265;钳,-11.8794487544;枯,-8.83492631664;胜,-8.83492631664;选,-10.0876892851;足,-7.29448127569;茲,-10.0876892851;纵,-6.94497482123;掷,-9.24039142475;頂,-7.56196064083;妻,-8.83492631664;连,-7.76857489019;笼,-8.35308822975;便,-9.3144993969;尾,-9.17139855326;胁,-11.1863015738;闃,-10.7808364657;维,-9.68222417703;銷,-7.81900574382;鹊,-10.2700108419;拍,-7.37963908403;潔,-8.70139492402;受,-7.73631402797;永,-8.6605729295;虚,-6.65909292929;孜,-9.04623541031;濟,-9.48155348157;惡,-7.05113501706;民,-7.09195701158;牢,-9.3144993969;狂,-7.57538366116;寧,-7.61676887732;鳩,-10.7808364657;繪,-8.09525912045;拭,-7.54871541408;矯,-8.24186259464;棱,-8.54724424419;轩,-7.8904647078;跳,-11.1863015738;绵,-9.04623541031;順,-6.46334835216;偶,-9.48155348157;數,-7.48499959969;移,-8.44546154988;放,-7.43679749787;忿,-9.80000721268;贻,-10.4931543932;应,-6.33037266947;私,-9.93353860531;王,-9.48155348157;血,-6.95219506921;饭,-10.2700108419;躊,-7.98762845625;舍,-7.80191131046;掌,-9.93353860531;咎,-8.88371648081;树,-8.14177913608;這,-10.2700108419;镂,-11.1863015738;北,-10.2700108419;迅,-8.62135221634;紛,-7.63095351231;怡,-9.04623541031;冠,-7.78510419214;锣,-8.4782513727;頑,-11.8794487544;春,-7.33615397209;欧,-11.1863015738;梦,-7.67475613497;帝,-8.6605729295;脫,-6.20956783138;爭,-6.6064491958;平,-5.73956420214;報,-8.05080735787;蠱,-8.4782513727;踵,-10.2700108419;悶,-7.94762312164;吹,-8.11824863867;輿,-8.88371648081;沾,-7.98762845625;遁,-9.24039142475;拂,-8.35308822975;见,-6.06531822254;珍,-8.16587668766;克,-8.14177913608;今,-7.46060814657;前,-5.17014441411;双,-8.54724424419;郊,-10.7808364657;话,-7.40211193989;駐,-11.1863015738;浓,-8.44546154988;红,-8.00824774346;幕,-11.1863015738;返,-8.62135221634;南,-7.24471976613;相,-5.54794690447;轟,-6.56132876052;脚,-7.44863195552;萍,-9.24039142475;几,-9.24039142475;散,-8.9350097752;勢,-6.33037266947;遐,-10.2700108419;巨,-8.88371648081;八,-7.57538366116;仪,-8.98907699647;扭,-9.57686366137;召,-10.4931543932;杯,-7.720565671;瓮,-9.17139855326;称,-8.14177913608;卷,-6.62717532632;惶,-7.42510145811;固,-8.24186259464;遥,-7.23505785522;貧,-9.17139855326;泾,-9.3144993969;刀,-6.93068886399;麻,-7.37963908403;各,-6.15586365241;丈,-10.7808364657;贊,-8.19056930025;再,-7.00425143116;而,-9.39454210458;鮑,-11.1863015738;褒,-8.9350097752;涕,-11.8794487544;尔,-8.6605729295;化,-6.89584213266;嘘,-9.24039142475;甚,-8.26853084172;删,-10.4931543932;睚,-9.93353860531;醇,-10.2700108419;義,-6.60133409513;篝,-11.8794487544;劫,-8.51215292438;洪,-8.16587668766;騰,-8.41371285156;纲,-10.0876892851;水,-5.68504336326;傷,-7.60278263535;猶,-7.33615397209;絞,-8.44546154988;格,-7.42510145811;岿,-9.80000721268;輾,-8.19056930025;所,-6.092551373;病,-8.41371285156;摄,-11.1863015738;筆,-10.2700108419;溘,-11.8794487544;悍,-11.8794487544;拋,-7.83639748653;重,-6.5371145024;賣,-7.85409706363;李,-10.7808364657;仓,-10.2700108419;饒,-11.8794487544;卖,-7.85409706363;知,-6.90963545479;櫛,-11.1863015738;画,-7.8904647078;糟,-9.68222417703;除,-8.88371648081;握,-9.3144993969;監,-10.2700108419;兢,-7.76857489019;日,-6.04756627708;瑤,-10.4931543932;学,-8.07278626459;翩,-8.62135221634;浪,-8.6605729295;凭,-10.0876892851;恬,-9.17139855326;沁,-8.70139492402;驰,-6.95219506921;绳,-8.24186259464;怒,-6.43703104384;淵,-11.8794487544;捶,-8.16587668766;褴,-11.1863015738;持,-8.26853084172;犀,-11.1863015738;憂,-6.59118172367;咄,-7.26432823752;标,-8.44546154988;載,-8.4782513727;予,-11.8794487544;评,-9.57686366137;越,-8.98907699647;脍,-7.73631402797;霄,-11.8794487544;雾,-9.10686003212;笑,-7.27427856838;专,-7.64534224977;妒,-10.7808364657;缘,-10.4931543932;愿,-11.1863015738;颜,-11.1863015738;紋,-7.60278263535;從,-5.95787033472;匡,-11.1863015738;加,-8.41371285156;冢,-11.1863015738;锥,-11.8794487544;適,-7.3151005629;灰,-7.44863195552;缩,-8.62135221634;纨,-9.3144993969;别,-6.40298520243;鄭,-7.53564333251;催,-8.78840630101;鬱,-7.43679749787;誰,-8.9350097752;能,-7.32557186276;貴,-8.98907699647;燈,-8.26853084172;源,-6.2304745162;訪,-10.2700108419;觀,-9.93353860531;晴,-8.41371285156;十,-6.33427130988;戮,-9.24039142475;故,-7.83639748653;哄,-7.83639748653;密,-10.2700108419;轉,-6.59118172367;终,-10.4931543932;手,-5.97136581619;緊,-7.23505785522;免,-10.4931543932;背,-6.84249615195;集,-9.3144993969;城,-9.3144993969;孑,-9.17139855326;蠢,-7.49742211969;絕,-7.67475613497;捏,-11.8794487544;遗,-8.98907699647;取,-6.41986324022;臉,-9.93353860531;盘,-8.54724424419;補,-10.4931543932;江,-7.96742574894;贤,-9.68222417703;荡,-7.58898931322;癣,-9.93353860531;略,-7.92820503578;铤,-7.76857489019;顧,-7.09195701158;實,-6.45891375509;彩,-11.8794487544;黨,-8.88371648081;扫,-9.93353860531;六,-7.28432890423;瑯,-9.48155348157;乳,-10.0876892851;绿,-8.51215292438;偷,-6.72615715987;叶,-9.48155348157;睹,-9.48155348157;書,-8.09525912045;驻,-11.1863015738;好,-6.57118105696;犁,-10.7808364657;适,-7.3151005629;钦,-7.11727481957;妇,-8.26853084172;争,-6.6064491958;压,-10.2700108419;尊,-9.68222417703;傍,-10.2700108419;疏,-9.10686003212;明,-6.12370654078;骑,-9.80000721268;谆,-9.80000721268;掂,-11.8794487544;純,-11.1863015738;團,-8.21588710823;烘,-11.8794487544;條,-9.57686366137;夜,-7.43679749787;鸞,-11.8794487544;匠,-9.80000721268;逢,-7.48499959969;撥,-7.87211556913;與,-5.92880620178;莫,-5.69118463128;覆,-8.88371648081;斯,-9.93353860531;班,-10.0876892851;诸,-7.96742574894;冷,-7.61676887732;戶,-11.8794487544;携,-10.7808364657;礼,-7.61676887732;綿,-9.04623541031;举,-5.40710245986;污,-9.39454210458;触,-6.88901616759;擅,-9.80000721268;婆,-8.11824863867;廉,-10.4931543932;彈,-7.42510145811;父,-11.8794487544;慌,-8.21588710823;藏,-8.26853084172;虎,-6.96679386863;子,-8.41371285156;離,-7.44863195552;法,-9.80000721268;赔,-9.93353860531;剖,-11.8794487544;雙,-8.54724424419;毛,-7.1087641299;裝,-6.99664683178;鏤,-11.1863015738;狡,-9.68222417703;趨,-7.42510145811;聰,-7.42510145811;婦,-8.26853084172;叫,-8.32410069287;汪,-8.09525912045;热,-6.65909292929;公,-6.77350328046;普,-7.96742574894;諱,-8.26853084172;議,-7.44863195552;浴,-8.44546154988;懷,-8.41371285156;扶,-7.46060814657;曹,-10.4931543932;輕,-5.85358278054;寻,-7.8904647078;渾,-7.75231436932;壽,-8.51215292438;奼,-8.88371648081;粉,-6.88901616759;幾,-9.24039142475;刁,-8.98907699647;掀,-11.8794487544;邂,-9.48155348157;琅,-9.48155348157;善,-7.22548840421;备,-10.0876892851;三,-5.34857112664;視,-7.01963635;逍,-8.62135221634;心,-4.37066158373;缓,-7.75231436932;遂,-11.1863015738;药,-9.93353860531;抖,-7.98762845625;昙,-7.5100009019;講,-9.93353860531;森,-11.8794487544;榜,-11.1863015738;负,-7.98762845625;庞,-7.63095351231;掠,-11.1863015738;营,-9.80000721268;斤,-8.51215292438;大,-3.82970246341;温,-7.16991855305;猫,-11.1863015738;貪,-6.45010312541;腳,-7.44863195552;唯,-8.3829411929;暮,-9.80000721268;稱,-8.14177913608;记,-7.720565671;盲,-9.93353860531;鶴,-8.29592981591;靜,-10.2700108419;靈,-7.08365820877;牵,-7.68979401234;贿,-9.57686366137;玩,-7.52273992767;权,-7.58898931322;烂,-9.39454210458;奇,-6.66996260152;义,-6.60133409513;糊,-9.17139855326;恍,-6.78569855356;里,-7.8904647078;問,-7.42510145811;潛,-8.26853084172;体,-8.58361188836;棒,-11.8794487544;鲁,-10.7808364657;拖,-8.6605729295;起,-7.25447594108;據,-7.52273992767;衝,-7.30473777586;姜,-11.8794487544;纤,-9.48155348157;叠,-10.7808364657;嗤,-8.58361188836;奧,-9.80000721268;歐,-11.1863015738;繩,-8.24186259464;虽,-10.0876892851;捫,-9.17139855326;泪,-7.76857489019;恭,-10.2700108419;目,-5.66084863467;話,-7.40211193989;贩,-9.48155348157;佳,-11.8794487544;飲,-8.78840630101;具,-11.1863015738;曾,-8.54724424419;铺,-6.96679386863;顽,-11.8794487544;滾,-9.04623541031;肃,-8.11824863867;蜂,-7.85409706363;紆,-11.8794487544;權,-7.58898931322;融,-8.83492631664;针,-7.25447594108;财,-8.32410069287;暗,-7.60278263535;錯,-6.62195338234;熙,-7.49742211969;疮,-9.68222417703;依,-6.99664683178;东,-6.13965584218;患,-7.64534224977;接,-6.54191067466;判,-8.29592981591;座,-8.88371648081;妩,-10.0876892851;咫,-9.3144993969;枭,-9.48155348157;琳,-7.8904647078;犯,-8.83492631664;綱,-10.0876892851;掉,-7.42510145811;梳,-9.24039142475;玲,-8.35308822975;宵,-8.98907699647;賞,-7.57538366116;收,-6.94497482123;耸,-7.98762845625;治,-8.51215292438;挺,-7.53564333251;羽,-9.24039142475;調,-7.96742574894;夾,-9.80000721268;旁,-7.27427856838;杂,-7.48499959969;雞,-6.95946782854;仇,-10.7808364657;秉,-9.48155348157;案,-11.8794487544;擋,-11.1863015738;豺,-11.8794487544;遭,-11.1863015738;慎,-11.1863015738;豐,-6.53234122365;壓,-10.2700108419;归,-6.82320294902;毕,-7.33615397209;盗,-11.1863015738;泥,-8.88371648081;泛,-8.4782513727;博,-7.05916718876;保,-9.48155348157;神,-5.84636253256;龇,-8.44546154988;面,-5.73098045845;鉤,-9.80000721268;继,-9.24039142475;秩,-8.62135221634;表,-8.88371648081;歪,-8.4782513727;短,-7.98762845625;噬,-11.1863015738;雲,-9.10686003212;己,-10.0876892851;寵,-9.3144993969;穴,-11.1863015738;雷,-7.70506148447;當,-5.86085553987;缺,-8.02930115265;選,-10.0876892851;忽,-11.8794487544;幼,-11.8794487544;逃,-8.54724424419;垂,-6.69206294852;包,-8.26853084172;万,-5.55329928121;瓦,-11.8794487544;殊,-8.58361188836;圍,-8.74395453843;沐,-10.0876892851;頓,-10.0876892851;徒,-7.65994104919;嘗,-11.1863015738;鄙,-11.1863015738;肘,-9.48155348157;厚,-7.720565671;绣,-9.80000721268;溜,-8.62135221634;發,-7.04316684741;贪,-6.45010312541;連,-7.76857489019;焚,-8.41371285156;挥,-7.81900574382;片,-8.16587668766;丧,-7.09195701158;天,-4.81468972657;墨,-8.98907699647;含,-7.07542770963;箪,-9.93353860531;石,-7.96742574894;贱,-9.48155348157;遲,-9.39454210458;鳞,-8.54724424419;莺,-9.68222417703;食,-8.21588710823;運,-8.05080735787;赴,-8.74395453843;哀,-8.24186259464;偃,-7.73631402797;奉,-9.24039142475;遊,-7.32557186276;野,-8.02930115265;浑,-7.75231436932;索,-9.3144993969;體,-8.58361188836;煙,-7.28432890423;惘,-10.4931543932;揚,-6.89584213266;络,-7.15206093565;機,-8.32410069287;擠,-8.41371285156;恣,-10.0876892851;矢,-8.21588710823;鍥,-8.83492631664;勤,-8.54724424419;左,-6.31492834704;磨,-9.17139855326;迫,-5.76355662888;良,-7.49742211969;統,-7.92820503578;峰,-8.29592981591;毒,-10.0876892851;豁,-7.76857489019;时,-7.05113501706;兹,-10.0876892851;胸,-6.86216891755;虾,-9.93353860531;载,-8.4782513727;身,-5.69529986343;穿,-8.88371648081;黔,-9.93353860531;攀,-9.3144993969;昂,-9.17139855326;銅,-8.44546154988;徇,-8.74395453843;将,-6.75548477496;避,-7.92820503578;喋,-8.32410069287;蚍,-10.0876892851;搬,-10.0876892851;鱗,-8.54724424419;留,-8.83492631664;撫,-9.10686003212;笔,-10.2700108419;搖,-6.12054698049;備,-10.0876892851;刚,-7.49742211969;蛊,-8.4782513727;报,-8.05080735787;挤,-8.41371285156;侧,-9.57686366137;谦,-8.62135221634;碩,-8.83492631664;赞,-8.19056930025;横,-6.50881072624;本,-7.32557186276;難,-6.05050313675;舆,-8.88371648081;細,-7.8904647078;馳,-6.95219506921;串,-9.24039142475;点,-8.54724424419;脸,-9.93353860531;似,-7.16094988307;访,-10.2700108419;破,-6.40298520243;品,-9.3144993969;燃,-7.92820503578;時,-7.05113501706;担,-8.16587668766;过,-7.10032526125;豆,-9.80000721268;旋,-11.8794487544;雍,-8.4782513727;描,-11.1863015738;偎,-11.8794487544;結,-8.21588710823;孔,-10.7808364657;送,-10.0876892851;慘,-7.17896838857;绝,-7.67475613497;作,-7.07542770963;察,-7.98762845625;塞,-9.80000721268;我,-8.3829411929;釣,-11.8794487544;拥,-8.62135221634;忧,-6.59118172367;綽,-7.96742574894;秦,-10.4931543932;鼓,-9.39454210458;可,-6.33818520921;遮,-8.24186259464;泱,-9.80000721268;走,-6.51347273934;干,-8.00824774346;嫵,-10.0876892851;執,-7.90915684081;瑶,-10.4931543932;價,-7.57538366116;酸,-8.70139492402;添,-8.21588710823;挾,-9.93353860531;彼,-9.10686003212;寿,-8.51215292438;顾,-7.09195701158;門,-6.96679386863;蚂,-11.1863015738;玄,-10.2700108419;沆,-8.98907699647;栉,-11.1863015738;锋,-9.04623541031;鋃,-9.10686003212;独,-5.34420748335;少,-7.87211556913;餓,-9.39454210458;互,-8.21588710823;朗,-9.57686366137;怙,-10.4931543932;膘,-9.39454210458;洛,-11.1863015738;抚,-9.10686003212;丝,-9.39454210458;袞,-10.0876892851;饱,-7.41354063571;暢,-7.70506148447;別,-6.40298520243;栩,-7.27427856838;說,-6.6324246822;昭,-9.93353860531;瞬,-7.94762312164;匯,-10.4931543932;炮,-9.04623541031;就,-7.80191131046;默,-7.36858924785;亲,-8.00824774346;貌,-9.10686003212;活,-8.29592981591;踽,-10.2700108419;更,-6.86216891755;驷,-9.24039142475;潇,-11.8794487544;竊,-7.83639748653;降,-9.17139855326;协,-9.93353860531;胎,-9.48155348157;軒,-7.8904647078;評,-9.57686366137;比,-7.134516626;铸,-9.39454210458;遙,-7.23505785522;赛,-8.9350097752;九,-7.07542770963;远,-6.93068886399;孟,-11.8794487544;飞,-6.78569855356;无,-3.78110990817;酣,-9.04623541031;团,-8.21588710823;古,-6.88901616759;额,-9.80000721268;畫,-7.8904647078;韬,-8.32410069287;卯,-10.0876892851;狼,-6.94497482123;山,-6.64300679153;女,-8.78840630101;说,-6.6324246822;懸,-6.77350328046;骁,-8.83492631664;茫,-10.0876892851;葬,-9.68222417703;极,-8.6605729295;骤,-11.8794487544;劃,-10.7808364657;點,-8.54724424419;内,-7.05916718876;耄,-10.2700108419;漆,-8.78840630101;安,-6.15586365241;計,-8.83492631664;養,-7.33615397209;同,-5.76135155632;渐,-9.17139855326;誓,-8.83492631664;支,-7.87211556913;圖,-9.04623541031;战,-6.6809517231;愚,-8.29592981591;盛,-7.30473777586;梟,-9.48155348157;針,-7.25447594108;劣,-11.8794487544;冥,-8.70139492402;沧,-7.92820503578;弦,-8.41371285156;太,-7.94762312164;断,-6.28102679537;听,-7.134516626;炯,-8.16587668766;丰,-6.53234122365;悲,-7.24471976613;烟,-7.28432890423;鳴,-7.90915684081;瑕,-10.2700108419;音,-8.98907699647;萬,-5.55329928121;勃,-7.54871541408;渊,-11.8794487544;但,-10.4931543932;鯉,-9.57686366137;雨,-7.63095351231;烏,-7.17896838857;华,-8.83492631664;近,-7.29448127569;乐,-7.30473777586;畢,-7.33615397209;駕,-9.17139855326;哗,-8.6605729295;党,-8.88371648081;川,-8.11824863867;棟,-9.39454210458;锱,-9.68222417703;敢,-7.85409706363;臥,-8.29592981591;糧,-10.7808364657;车,-8.26853084172;審,-8.05080735787;長,-5.87063556892;囫,-10.2700108419;奪,-7.76857489019;旭,-11.1863015738;經,-6.93068886399;看,-9.17139855326;据,-7.52273992767;买,-10.0876892851;雜,-7.48499959969;戒,-8.07278626459;叹,-7.78510419214;黼,-11.8794487544;任,-7.25447594108;鱼,-6.98160895441;省,-8.58361188836;斂,-9.68222417703;脅,-11.1863015738;將,-6.75548477496;來,-6.28473737476;嬉,-8.4782513727;窈,-9.57686366137;和,-6.5467299611;怏,-9.93353860531;掎,-9.39454210458;休,-7.63095351231;庐,-9.93353860531;娓,-9.24039142475;夕,-11.8794487544;飯,-10.2700108419;錙,-9.68222417703;折,-9.80000721268;丛,-10.7808364657;鲜,-7.61676887732;蠟,-11.8794487544;实,-6.45891375509;蜡,-11.8794487544;鸚,-9.80000721268;鹰,-11.1863015738;誨,-9.39454210458;親,-8.00824774346;咬,-6.4327113827;鎮,-8.83492631664;弱,-8.32410069287;蹉,-11.1863015738;稳,-8.00824774346;絲,-9.39454210458;鼠,-9.3144993969;匹,-8.19056930025;芸,-8.98907699647;宾,-10.2700108419;瓊,-9.3144993969;充,-8.54724424419;汇,-10.4931543932;等,-7.33615397209;遍,-7.83639748653;晋,-11.8794487544;色,-7.85409706363;偏,-9.17139855326;揎,-11.1863015738;潑,-10.7808364657;淒,-9.3144993969;饕,-10.7808364657;畏,-8.11824863867;著,-8.29592981591;鵝,-9.3144993969;電,-9.80000721268;条,-9.57686366137;因,-6.02437683216;扣,-8.9350097752;既,-7.37963908403;入,-7.25447594108;蕭,-10.4931543932;当,-5.86085553987;息,-6.90271501194;揮,-7.81900574382;影,-7.96742574894;仰,-8.44546154988;極,-8.6605729295;勸,-11.1863015738;出,-5.13774805971;泼,-10.7808364657;顿,-10.0876892851;闔,-11.1863015738;蜀,-11.1863015738;掃,-9.93353860531;肅,-8.11824863867;涇,-9.3144993969;膏,-10.7808364657;戎,-8.3829411929;云,-9.10686003212;斗,-8.14177913608;嘖,-9.10686003212;芙,-11.8794487544;供,-6.68649190347;倚,-8.4782513727;眠,-11.8794487544;肥,-11.8794487544;愤,-7.39081238463;灭,-7.64534224977;並,-7.92820503578;笨,-10.2700108419;株,-10.2700108419;真,-6.6809517231;刮,-7.49742211969;害,-8.9350097752;头,-6.10800763123;喷,-9.17139855326;犹,-7.33615397209;债,-8.19056930025;沽,-8.70139492402;贼,-8.6605729295;雁,-11.8794487544;杀,-6.23400185672;參,-7.80191131046;僅,-10.0876892851;兄,-10.7808364657;玉,-7.80191131046;揠,-10.2700108419;嫉,-8.74395453843;埋,-9.3144993969;响,-9.57686366137;敌,-11.1863015738;量,-7.56196064083;扎,-11.1863015738;滑,-11.8794487544;齐,-7.24471976613;寓,-9.93353860531;奔,-8.41371285156;旗,-7.35766017731;进,-7.29448127569;做,-8.98907699647;离,-7.44863195552;駟,-9.24039142475;詞,-10.4931543932;盡,-6.33818520921;靠,-8.19056930025;口,-6.64834013751;渺,-9.24039142475;照,-9.17139855326;巧,-7.35766017731;书,-8.09525912045;荷,-8.83492631664;矫,-8.24186259464;哭,-7.37963908403;敬,-8.05080735787;凯,-9.68222417703;鬼,-6.60133409513;潰,-8.24186259464;篳,-10.7808364657;汲,-11.1863015738;奴,-9.10686003212;嗷,-8.83492631664;晶,-8.62135221634;狹,-8.88371648081;卸,-10.2700108419;翻,-6.3111042506;遺,-8.98907699647;賽,-8.9350097752;鮮,-7.61676887732;驾,-9.17139855326;郁,-7.43679749787;質,-10.0876892851;怅,-8.98907699647;崇,-7.58898931322;了,-7.28432890423;守,-7.58898931322;國,-6.55643877523;名,-5.31841808847;意,-6.12687611554;丑,-9.80000721268;龐,-7.63095351231;沒,-6.61675856546;豈,-7.73631402797;銘,-9.3144993969;诛,-11.1863015738;滅,-7.64534224977;蛮,-9.93353860531;尝,-11.1863015738;罄,-9.93353860531;瘡,-9.68222417703;瞠,-9.17139855326;急,-6.25543124818;冤,-8.9350097752;紧,-7.23505785522;亦,-8.35308822975;讨,-7.134516626;喬,-8.54724424419;縱,-6.94497482123;瀟,-11.8794487544;男,-6.93068886399;礙,-8.74395453843;為,-6.25182764067;尽,-6.33818520921;秋,-7.3151005629;魔,-10.0876892851;千,-4.71009873769;擂,-10.7808364657;凄,-9.3144993969;绞,-8.44546154988;仆,-11.1863015738;苍,-11.1863015738;閃,-9.04623541031;磊,-11.8794487544;旌,-11.8794487544;蹑,-11.1863015738;忐,-7.29448127569;硕,-8.83492631664;委,-8.58361188836;敗,-8.4782513727;曖,-10.7808364657;牙,-11.8794487544;变,-6.69766520407;佛,-10.7808364657;死,-5.58602947552;襟,-10.4931543932;郑,-7.53564333251;荣,-7.5100009019;擢,-11.8794487544;恥,-11.8794487544;凤,-8.24186259464;穩,-8.00824774346;乱,-6.66996260152;述,-10.7808364657;塵,-7.2066199199;敷,-9.04623541031;零,-9.39454210458;批,-11.8794487544;司,-7.85409706363;彻,-8.02930115265;惺,-9.10686003212;西,-10.2700108419;罔,-9.68222417703;要,-9.3144993969;沃,-9.04623541031;謂,-11.1863015738;待,-7.96742574894;诗,-8.29592981591;閉,-7.52273992767;合,-7.02741849044;軟,-7.94762312164;琴,-8.98907699647;纏,-9.80000721268;崎,-8.98907699647;憑,-10.0876892851;耐,-7.46060814657;钓,-11.8794487544;漂,-9.68222417703;枕,-9.48155348157;嘔,-8.54724424419;窗,-9.3144993969;外,-9.48155348157;尘,-7.2066199199;席,-7.81900574382;美,-7.73631402797;鑼,-8.4782513727;欢,-6.98909962614;两,-7.04316684741;焦,-7.39081238463;斩,-6.74365031731;未,-6.84249615195;箭,-8.44546154988;纯,-11.1863015738;熱,-6.65909292929;咳,-11.1863015738;網,-8.83492631664;嘴,-11.1863015738;尸,-8.35308822975;傻,-10.4931543932;强,-7.1087641299;唾,-8.16587668766;槁,-11.1863015738;桀,-8.4782513727;魂,-7.21600966025;必,-7.34684926121;勇,-8.51215292438;鞍,-8.51215292438;棋,-9.3144993969;母,-9.48155348157;经,-6.93068886399;济,-9.48155348157;胶,-10.4931543932;茹,-9.24039142475;荒,-7.53564333251;祖,-8.62135221634;滥,-9.57686366137;開,-6.32648916944;剜,-11.8794487544;速,-8.58361188836;啞,-7.96742574894;疑,-8.14177913608;泣,-7.52273992767;止,-10.4931543932;迥,-7.27427856838;鹤,-8.29592981591;腦,-9.93353860531;早,-8.44546154988;周,-7.85409706363;士,-11.8794487544;语,-7.07542770963;马,-6.62195338234;黯,-8.07278626459;浮,-8.6605729295;凱,-9.68222417703;恰,-7.16094988307;言,-6.02151559988;噴,-9.17139855326;饶,-11.8794487544;鷹,-11.1863015738;惻,-7.8904647078;潺,-10.2700108419;魑,-9.57686366137;替,-7.68979401234;调,-7.96742574894;切,-8.24186259464;唉,-7.57538366116;狭,-8.88371648081;栋,-9.39454210458;踏,-9.10686003212;涎,-11.8794487544;脑,-9.93353860531;香,-9.48155348157;搓,-11.8794487544;排,-7.63095351231;蜕,-9.24039142475;隔,-8.62135221634;稗,-11.1863015738;妖,-8.4782513727;紙,-8.41371285156;猝,-7.34684926121;酩,-9.3144993969;星,-6.85556823352;飄,-8.88371648081;販,-9.48155348157;颠,-7.32557186276;氣,-5.59531459329;躡,-11.1863015738;弥,-8.54724424419;交,-7.26432823752;枪,-8.62135221634;駭,-7.73631402797;脱,-6.20956783138;草,-7.87211556913;吳,-9.68222417703;厲,-9.24039142475;嚴,-7.24471976613;直,-6.44136944544;费,-8.70139492402;沸,-6.94497482123;耻,-11.8794487544;阿,-8.9350097752;疾,-8.44546154988;襁,-10.2700108419;責,-8.32410069287;滄,-7.92820503578;扇,-10.7808364657;恶,-7.05113501706;嫌,-10.0876892851;鹏,-10.7808364657;颂,-11.8794487544;插,-8.32410069287;遏,-11.8794487544;畸,-11.1863015738;陟,-11.1863015738;网,-8.83492631664;黄,-8.51215292438;寢,-11.1863015738;令,-7.42510145811;执,-7.90915684081;燦,-9.3144993969;填,-11.1863015738;賊,-8.6605729295;差,-8.09525912045;共,-8.88371648081;味,-9.80000721268;史,-7.60278263535;围,-8.74395453843;穷,-6.64300679153;恻,-7.8904647078;拼,-9.80000721268;梁,-11.1863015738;老,-6.37006041774;樂,-7.30473777586;弄,-7.26432823752;率,-10.7808364657;逆,-7.90915684081;鞭,-8.4782513727;見,-6.06531822254;認,-9.93353860531;嬌,-8.54724424419;划,-10.7808364657;蚕,-11.1863015738;算,-10.7808364657;沙,-11.1863015738;鳥,-8.3829411929;军,-8.35308822975;业,-11.8794487544;劝,-11.1863015738;设,-8.6605729295;吞,-6.84249615195;涣,-11.8794487544;伤,-7.60278263535;谁,-8.9350097752;钩,-9.80000721268;用,-7.25447594108;損,-7.58898931322;辯,-11.8794487544;铜,-8.44546154988;鵲,-10.2700108419;朴,-8.11824863867;殷,-9.80000721268;蠶,-11.1863015738;油,-7.21600966025;为,-6.25182764067;抽,-10.7808364657;壁,-11.8794487544;睡,-9.39454210458;跃,-7.5100009019;仅,-10.0876892851;纷,-7.63095351231;恆,-11.8794487544;驍,-8.83492631664;始,-7.1087641299;洶,-8.62135221634;歌,-7.63095351231;惑,-11.8794487544;翘,-8.74395453843;雕,-8.11824863867;训,-7.49742211969;逸,-11.1863015738;煥,-7.70506148447;勝,-8.83492631664;費,-8.70139492402;裡,-7.8904647078;闭,-7.52273992767;緣,-10.4931543932;驢,-11.1863015738;以,-5.86818157996;铩,-9.04623541031;韦,-11.8794487544;竭,-7.44863195552;俯,-8.19056930025;惱,-8.07278626459;腰,-9.10686003212;割,-11.8794487544;请,-9.3144993969;顶,-7.56196064083;击,-9.68222417703;響,-9.57686366137;清,-6.51347273934;指,-6.61675856546;肆,-7.18810087213;吉,-8.09525912045;稍,-8.24186259464;完,-7.56196064083;漏,-9.10686003212;蓬,-8.09525912045;憐,-8.74395453843;魚,-6.98160895441;芒,-10.2700108419;灯,-8.26853084172;袖,-7.68979401234;毅,-8.98907699647;愛,-7.33615397209;初,-7.81900574382;土,-7.35766017731;责,-8.32410069287;严,-7.24471976613;群,-7.85409706363;绰,-7.96742574894;靡,-11.8794487544;夫,-9.57686366137;設,-8.6605729295;伯,-9.68222417703;粮,-10.7808364657;週,-7.85409706363;冰,-7.48499959969;期,-9.39454210458;涸,-10.7808364657;人,-4.91436840876;爽,-10.7808364657;蓋,-9.48155348157;秀,-9.39454210458;荊,-11.8794487544;久,-6.83602363744;熠,-8.70139492402;葉,-9.48155348157;奋,-7.42510145811;囊,-9.3144993969;積,-7.64534224977;富,-6.86881346027;拒,-8.98907699647;晕,-8.58361188836;柔,-10.4931543932;字,-7.40211193989;腾,-8.41371285156;滚,-9.04623541031;束,-6.74955003944;雄,-7.16094988307;卧,-8.29592981591;摩,-7.58898931322;门,-6.96679386863;盪,-7.58898931322;詭,-9.17139855326;寬,-8.00824774346;软,-7.94762312164;柴,-8.78840630101;歷,-7.30473777586;论,-8.83492631664;汹,-8.62135221634;鷸,-9.10686003212;养,-7.33615397209;建,-8.05080735787;牽,-7.68979401234;陽,-8.4782513727;板,-8.98907699647;抱,-7.40211193989;宁,-7.61676887732;稀,-8.11824863867;溃,-8.24186259464;超,-8.78840630101;谄,-11.8794487544;枉,-9.93353860531;禍,-7.73631402797;頌,-11.8794487544;鼎,-7.94762312164;成,-5.72459066035;皓,-9.68222417703;迟,-9.39454210458;搔,-10.0876892851;龙,-7.29448127569;力,-6.64834013751;怜,-8.74395453843;钟,-9.57686366137;审,-8.05080735787;稠,-9.93353860531;夢,-7.67475613497;錦,-7.10032526125;违,-8.19056930025;漸,-9.17139855326;戰,-6.6809517231;吴,-9.68222417703;徹,-8.02930115265;常,-11.1863015738;饞,-9.24039142475;膽,-6.65909292929;逼,-8.58361188836;咿,-10.7808364657;眾,-5.70358148426;毁,-8.05080735787;婀,-8.9350097752;黃,-8.51215292438;扑,-7.52273992767;迂,-8.29592981591;荆,-11.8794487544;陈,-8.78840630101;立,-6.77350328046;姍,-8.35308822975;行,-6.73195427755;鳏,-10.4931543932;低,-7.54871541408;发,-7.04316684741;兒,-9.04623541031;藕,-8.98907699647;規,-11.8794487544;鏡,-9.93353860531;綸,-9.80000721268;忙,-8.83492631664;乘,-7.36858924785;招,-6.93068886399;騎,-9.80000721268;跋,-8.9350097752;停,-7.5100009019;杞,-8.70139492402;寡,-7.98762845625;代,-8.62135221634;工,-9.10686003212;層,-6.79185241913;僧,-8.78840630101;器,-9.68222417703;踌,-7.98762845625;识,-8.62135221634;置,-6.53234122365;叱,-8.32410069287;艰,-6.81685372134;翹,-8.74395453843;幸,-7.3151005629;慷,-6.70329902179;精,-5.70983802187;恼,-8.07278626459;铿,-9.10686003212;七,-6.10489720882;如,-4.93055153205;紅,-8.00824774346;历,-7.30473777586;有,-4.79690018501;暈,-8.58361188836;程,-11.8794487544;喊,-10.7808364657;碌,-8.98907699647;小,-5.35588644821;癬,-9.93353860531;挑,-8.21588710823;髀,-10.2700108419;易,-8.41371285156;冒,-8.14177913608;甕,-9.17139855326;蒔,-11.8794487544;栗,-11.1863015738;鴻,-9.93353860531;亘,-10.2700108419;创,-10.0876892851;饮,-8.78840630101;淋,-7.35766017731;吟,-10.2700108419;瞞,-8.35308822975;深,-5.49932621746;鸣,-7.90915684081;通,-6.65370208065;津,-7.05113501706;鲤,-9.57686366137;性,-10.7808364657;隨,-6.41986324022;喪,-7.09195701158;微,-6.19586898703;阳,-8.4782513727;冲,-7.30473777586;电,-9.80000721268;家,-6.18908930004;弹,-7.42510145811;庸,-9.48155348157;刻,-6.79804438938;鈞,-11.1863015738;炼,-10.4931543932;鋪,-6.96679386863;纡,-11.8794487544;益,-11.1863015738;浅,-10.2700108419;泄,-9.80000721268;假,-8.51215292438;张,-6.81054455214;才,-7.78510419214;屏,-9.80000721268;迎,-7.04316684741;卑,-9.10686003212;拐,-8.3829411929;噓,-9.24039142475;舐,-11.1863015738;擔,-8.16587668766;塗,-9.3144993969;余,-9.93353860531;付,-7.92820503578;剛,-7.49742211969;淚,-7.76857489019;餘,-9.93353860531;惜,-10.0876892851;歡,-6.98909962614;賤,-9.48155348157;另,-7.2066199199;革,-10.0876892851;追,-7.96742574894;橫,-6.50881072624;闪,-9.04623541031;業,-11.8794487544;修,-9.48155348157;危,-6.70896475933;陳,-8.78840630101;懲,-9.68222417703;敵,-11.1863015738;拿,-9.93353860531;顷,-7.87211556913;寶,-10.4931543932;處,-8.19056930025;淺,-10.2700108419;象,-10.7808364657;胼,-10.7808364657;鑿,-11.8794487544;蟾,-10.4931543932;突,-5.97955140078;謀,-9.3144993969;侃,-7.98762845625;堂,-7.3151005629;約,-7.54871541408;赌,-8.88371648081;分,-6.35001966685;月,-7.96742574894;残,-7.65994104919;吊,-8.58361188836;碍,-8.74395453843;与,-5.92880620178;抑,-8.19056930025;錐,-11.8794487544;螓,-11.1863015738;倒,-7.87211556913;亙,-10.2700108419;优,-7.94762312164;掛,-11.8794487544;尚,-8.88371648081;肝,-7.2066199199;欠,-11.8794487544;绚,-8.09525912045;粥,-11.8794487544;崤,-11.8794487544;铁,-7.3151005629;在,-6.38228052907;殫,-9.10686003212;琪,-10.2700108419;讳,-8.26853084172;鶯,-9.68222417703;縮,-8.62135221634;励,-7.94762312164;螳,-10.7808364657;進,-7.29448127569;風,-4.84330026061;纹,-7.60278263535;伸,-7.76857489019;去,-9.57686366137;尺,-10.4931543932;谋,-9.3144993969;显,-6.34211448735;嫁,-8.16587668766;促,-9.48155348157;桂,-11.8794487544;斷,-6.28102679537;袍,-11.8794487544;牆,-9.3144993969;曉,-8.26853084172;服,-11.8794487544;毋,-8.74395453843;告,-9.17139855326;獐,-10.0876892851;恒,-11.8794487544;姗,-8.35308822975;仙,-10.4931543932;嗟,-10.7808364657;驴,-11.1863015738;峥,-10.4931543932;赤,-6.92362169676;貽,-10.4931543932;毫,-8.70139492402;路,-8.26853084172;湮,-9.68222417703;英,-7.92820503578;柳,-8.32410069287;聲,-6.15260100678;闷,-7.94762312164;整,-8.24186259464;潸,-8.70139492402;項,-9.3144993969;決,-7.26432823752;烽,-11.8794487544;兼,-7.5100009019;百,-5.49932621746;威,-7.4727295071;讀,-10.7808364657;弃,-8.62135221634;雪,-7.16991855305;嶄,-7.98762845625;砍,-10.4931543932;于,-8.78840630101;刑,-8.14177913608;掐,-10.2700108419;求,-7.52273992767;渙,-11.8794487544;情,-6.12370654078;思,-7.32557186276;醜,-9.80000721268;生,-5.60468673312;模,-7.98762845625;宠,-9.3144993969;鰥,-10.4931543932;艺,-10.7808364657;嘩,-8.6605729295;頭,-6.10800763123;馬,-6.62195338234;贯,-11.8794487544;爱,-7.33615397209;拉,-9.93353860531;傲,-8.83492631664;鐵,-7.3151005629;丹,-9.48155348157;辞,-11.1863015738;韋,-11.8794487544;政,-11.1863015738;难,-6.05050313675;毀,-8.05080735787;裂,-11.1863015738;居,-6.87550244842;捷,-8.3829411929;兇,-7.29448127569;晉,-11.8794487544;操,-8.14177913608;筋,-8.35308822975;擊,-9.68222417703;額,-9.80000721268;赏,-7.57538366116;从,-5.95787033472;剑,-8.07278626459;提,-7.14325030597;胡,-5.80410272328;呕,-8.54724424419;约,-7.54871541408;套,-11.1863015738;論,-8.83492631664;忘,-7.26432823752;釜,-8.41371285156;回,-6.79185241913;黑,-7.42510145811;飢,-7.96742574894;履,-10.4931543932;內,-7.05916718876;苦,-6.82959274711;恃,-9.10686003212;艱,-6.81685372134;杳,-8.35308822975;痴,-8.14177913608;梨,-10.4931543932;幹,-8.00824774346;忸,-10.7808364657;卻,-9.57686366137;聽,-7.134516626;长,-5.87063556892;图,-9.04623541031;趁,-7.78510419214;鏗,-9.10686003212;异,-6.18908930004;皇,-9.10686003212;戀,-8.05080735787;醉,-8.07278626459;龍,-7.29448127569;希,-9.68222417703;斑,-11.1863015738;吐,-9.93353860531;鹿,-9.68222417703;識,-8.62135221634;妙,-7.94762312164;禮,-7.61676887732;枝,-8.24186259464;功,-6.6064491958;由,-9.17139855326;聚,-7.68979401234;疊,-10.7808364657;皮,-7.8904647078;暧,-10.7808364657;锦,-7.10032526125;怨,-7.68979401234;貫,-11.8794487544;匪,-7.83639748653;辭,-11.1863015738;諂,-11.8794487544;傳,-7.80191131046;戴,-9.04623541031;康,-8.9350097752;师,-9.24039142475;砸,-9.3144993969;钻,-10.0876892851;欺,-7.720565671;昼,-9.80000721268;势,-6.33037266947;局,-8.58361188836;寅,-9.57686366137;曇,-7.5100009019;應,-6.33037266947;醍,-9.48155348157;半,-5.85117023413;忍,-6.62195338234;乌,-7.17896838857;青,-6.82959274711;剔,-11.8794487544;仗,-8.07278626459;願,-11.1863015738;腥,-10.0876892851;筚,-10.7808364657;缠,-9.80000721268;苟,-7.56196064083;煞,-8.19056930025;淡,-9.04623541031;籠,-8.35308822975;罢,-8.54724424419;形,-6.56132876052;寥,-7.30473777586;爐,-8.51215292438;恨,-7.94762312164;鹦,-9.80000721268;鹬,-9.10686003212;奮,-7.42510145811;想,-6.82959274711;鉴,-10.4931543932;价,-7.57538366116;赶,-8.74395453843;姹,-8.88371648081;趕,-8.74395453843;孺,-11.8794487544;濫,-9.57686366137;勿,-9.80000721268;气,-5.59531459329;洁,-8.70139492402;暴,-7.1087641299;頃,-7.87211556913;骄,-8.24186259464;盤,-8.54724424419;焉,-9.24039142475;铭,-9.3144993969;尋,-7.8904647078;挖,-8.24186259464;二,-7.49742211969;瞒,-8.35308822975;夙,-10.2700108419;君,-9.93353860531;殚,-9.10686003212;朝,-6.90271501194;抛,-7.83639748653;諄,-9.80000721268;負,-7.98762845625;茅,-9.04623541031;蔚,-8.9350097752;萎,-8.24186259464;誤,-8.83492631664;轰,-6.56132876052;飽,-7.41354063571;措,-6.76145494195;躬,-9.93353860531;榮,-7.5100009019;唱,-11.1863015738;煉,-10.4931543932;耳,-6.73778519786;揪,-11.1863015738;雖,-10.0876892851;夹,-9.80000721268;霁,-11.1863015738;殺,-6.23400185672;朽,-11.1863015738;节,-7.96742574894;膾,-7.73631402797;流,-6.95946782854;管,-9.68222417703;桃,-8.9350097752;珊,-11.8794487544;旷,-7.98762845625;光,-6.05936582401;烈,-10.7808364657;關,-10.7808364657;及,-10.7808364657;位,-9.68222417703;救,-7.41354063571;道,-7.44863195552;单,-7.52273992767;拔,-7.64534224977;訓,-7.49742211969;歸,-6.82320294902;飘,-8.88371648081;诚,-7.41354063571;漠,-8.41371285156;絡,-7.15206093565;賠,-9.93353860531;衣,-7.11727481957;鬥,-8.14177913608;步,-7.68979401234;兩,-7.04316684741;惨,-7.17896838857;只,-6.95946782854;廬,-9.93353860531;螞,-11.1863015738;辩,-11.8794487544;聳,-7.98762845625;習,-7.54871541408;捕,-7.92820503578;披,-7.00425143116;承,-7.90915684081;花,-6.45891375509;岁,-9.68222417703;市,-9.3144993969;誅,-11.1863015738;酒,-7.83639748653;理,-6.01015184123;炉,-8.51215292438;趋,-7.42510145811;舊,-8.70139492402;躍,-7.5100009019;邯,-9.93353860531;锐,-9.80000721268;阒,-10.7808364657;投,-6.93068886399;得,-6.04756627708;尖,-9.48155348157;墙,-9.3144993969;蠅,-9.93353860531;濃,-8.44546154988;蜜,-11.1863015738;原,-7.26432823752;逞,-11.1863015738;没,-6.61675856546;素,-8.05080735787;丢,-8.83492631664;窥,-11.1863015738;否,-8.74395453843;肩,-11.1863015738;眉,-6.58113138782;刪,-10.4931543932;亭,-8.88371648081;驟,-11.8794487544;盜,-11.1863015738;决,-7.26432823752;防,-7.58898931322;猴,-11.8794487544;德,-7.41354063571;夸,-8.02930115265;朋,-9.68222417703;倾,-7.134516626;魄,-10.0876892851;變,-6.69766520407;呆,-8.16587668766;先,-6.44136944544;巋,-9.80000721268;削,-9.3144993969;軍,-8.35308822975;彌,-8.54724424419;每,-8.09525912045;哑,-7.96742574894;動,-7.44863195552;協,-9.93353860531;俗,-10.0876892851;游,-7.32557186276;退,-8.78840630101;痛,-6.66996260152;驚,-5.44811767243;杜,-11.1863015738;聞,-6.94497482123;秣,-10.7808364657;童,-10.0876892851;孤,-6.26632064798;戛,-7.67475613497;惩,-9.68222417703;全,-5.75695594485;巫,-11.1863015738;剪,-10.0876892851;彬,-8.16587668766;误,-8.83492631664;衮,-10.0876892851;数,-7.48499959969;至,-6.98909962614;霽,-11.1863015738;勵,-7.94762312164;却,-9.57686366137;迷,-9.04623541031;裹,-9.04623541031;祸,-7.73631402797;闻,-6.94497482123;空,-6.73778519786;国,-6.55643877523;車,-8.26853084172;封,-8.70139492402;鸾,-11.8794487544;亂,-6.66996260152;震,-7.02741849044;倉,-10.2700108419;洋,-7.83639748653;把,-11.8794487544;不,-2.96630221521;後,-6.00733096489;碎,-8.88371648081;向,-11.8794487544;罪,-6.55157258557;众,-5.70358148426;殘,-7.65994104919;骚,-10.7808364657;果,-7.43679749787;挟,-9.93353860531;鑄,-9.39454210458;綠,-8.51215292438;亢,-9.04623541031;认,-9.93353860531;霧,-9.10686003212;泰,-8.26853084172;遣,-11.1863015738;贫,-9.17139855326;中,-7.29448127569;木,-7.73631402797;斜,-11.1863015738;新,-6.34605926564;強,-7.1087641299;根,-7.39081238463;攻,-7.65994104919;窺,-11.1863015738;請,-9.3144993969;傾,-7.134516626;屁,-8.83492631664;寄,-8.4782513727;蝇,-9.93353860531;鞠,-8.58361188836;槍,-8.62135221634;风,-4.84330026061;鑑,-10.4931543932;腹,-7.80191131046;幅,-8.6605729295;秘,-9.04623541031;敛,-9.68222417703;晝,-9.80000721268;韜,-8.32410069287;损,-7.58898931322;憤,-7.39081238463;屡,-7.09195701158;廢,-8.9350097752;語,-7.07542770963;货,-7.73631402797;爛,-9.39454210458;擦,-11.8794487544;恩,-8.62135221634;臨,-7.68979401234;赫,-7.92820503578;度,-8.54724424419;结,-8.21588710823;魯,-10.7808364657;壮,-8.54724424419;呱,-10.0876892851;痰,-10.2700108419;关,-10.7808364657;曲,-8.26853084172;創,-10.0876892851;罷,-8.54724424419;项,-9.3144993969;觸,-6.88901616759;華,-8.83492631664;白,-6.49955140082;餐,-10.2700108419;卿,-9.68222417703;苛,-8.35308822975;一,-3.04220311047;窃,-7.83639748653;销,-7.81900574382;厉,-9.24039142475;興,-5.91330201524;事,-6.31492834704;鋒,-9.04623541031;斬,-6.74365031731;这,-10.2700108419;抓,-8.41371285156;锒,-9.10686003212;粗,-7.75231436932;記,-7.720565671;多,-6.79185241913;搜,-9.17139855326;御,-11.8794487544;鸠,-10.7808364657;崢,-10.4931543932;頤,-7.90915684081;钧,-11.1863015738;掩,-8.07278626459;刨,-9.10686003212;溫,-7.16991855305;優,-7.94762312164;維,-9.68222417703;蒼,-11.1863015738;劳,-7.68979401234;锲,-8.83492631664;買,-10.0876892851;伶,-9.68222417703;容,-8.02930115265;樸,-8.11824863867;夺,-7.76857489019;施,-11.8794487544;琼,-9.3144993969;慨,-10.7808364657;种,-8.58361188836;诡,-9.17139855326;終,-10.4931543932;擇,-9.17139855326;纶,-9.80000721268;巍,-9.48155348157;廣,-9.17139855326;慢,-7.8904647078;燕,-10.4931543932;達,-7.80191131046;藥,-9.93353860531;四,-5.61224820582;楚,-7.85409706363;藝,-10.7808364657;鼻,-9.57686366137;惟,-7.92820503578;信,-6.6064491958;习,-7.54871541408;嫣,-8.21588710823;絢,-8.09525912045;觥,-9.17139855326;坦,-8.6605729295;落,-6.79185241913;壯,-8.54724424419;陰,-6.77350328046;拳,-8.11824863867;敲,-7.57538366116;側,-9.57686366137;佶,-10.2700108419;对,-7.63095351231;蛻,-9.24039142475;呼,-6.90271501194;漁,-8.98907699647;涂,-9.3144993969;辗,-8.19056930025;騷,-10.7808364657;激,-9.48155348157;按,-6.10179643114;劈,-7.94762312164;下,-8.32410069287;熊,-9.68222417703;岌,-7.68979401234;蝦,-9.93353860531;炙,-7.87211556913;閒,-7.94762312164;焕,-7.70506148447;悔,-7.83639748653;悵,-8.98907699647;謙,-8.62135221634;攝,-11.1863015738;借,-7.40211193989;现,-8.44546154988;萧,-10.4931543932;动,-7.44863195552;師,-9.24039142475;细,-7.8904647078;崭,-7.98762845625;肺,-8.44546154988;议,-7.44863195552;朱,-10.4931543932;齜,-8.44546154988;疲,-8.00824774346;谷,-10.2700108419;謹,-8.09525912045;嘻,-9.57686366137;撼,-9.80000721268;耿,-7.76857489019;財,-8.32410069287;裊,-8.9350097752;棄,-8.62135221634;摇,-6.12054698049;捉,-7.40211193989;拈,-8.88371648081;之,-9.57686366137;顏,-11.1863015738;打,-6.40717808069;饥,-7.96742574894;汗,-7.25447594108;高,-5.82032555878;虛,-6.65909292929;敝,-11.1863015738;瓜,-8.6605729295;鹑,-11.1863015738;奥,-9.80000721268;摧,-8.74395453843;运,-8.05080735787;拨,-7.87211556913;自,-4.53861320024;读,-10.7808364657;顯,-6.34211448735;鸦,-7.29448127569;東,-6.13965584218;困,-9.57686366137;闲,-7.94762312164;兵,-6.27732993348;惴,-7.90915684081;諸,-7.96742574894;登,-8.11824863867;灿,-9.3144993969;現,-8.44546154988;开,-6.32648916944;殃,-10.7808364657;截,-6.52286247969;袅,-8.9350097752;处,-8.19056930025;文,-6.93780633175;嘆,-7.78510419214;例,-8.14177913608;盖,-9.48155348157;鲍,-11.1863015738;布,-11.8794487544;福,-8.98907699647;討,-7.134516626;金,-5.88798420726;概,-10.0876892851;世,-7.76857489019;苗,-11.8794487544;攜,-10.7808364657;熟,-8.70139492402;舞,-9.80000721268;亡,-7.98762845625;传,-7.80191131046;谢,-7.75231436932;喧,-9.10686003212;助,-8.62135221634;挨,-8.11824863867;怪,-8.83492631664;種,-8.58361188836;隱,-7.81900574382;地,-7.2066199199;莳,-11.8794487544;債,-8.19056930025;瞻,-8.29592981591;纖,-9.48155348157;爾,-8.6605729295;仁,-7.48499959969;层,-6.79185241913;装,-6.99664683178;奄,-7.49742211969;忠,-6.79185241913;勉,-8.58361188836;聊,-9.17139855326;正,-6.59118172367;监,-10.2700108419;坐,-6.27732993348;瓢,-8.78840630101;僕,-11.1863015738;兔,-8.83492631664;湖,-8.14177913608;存,-11.8794487544;塚,-11.1863015738;镜,-9.93353860531;營,-9.80000721268;满,-6.27732993348;你,-7.33615397209;屢,-7.09195701158;鸟,-8.3829411929;襤,-11.1863015738;旧,-8.70139492402;择,-9.17139855326;獨,-5.34420748335;快,-8.07278626459;聪,-7.42510145811;賭,-8.88371648081;鵬,-10.7808364657;积,-7.64534224977;眼,-7.03526166791;詩,-8.29592981591;茶,-8.98907699647;兴,-5.91330201524;混,-6.94497482123;并,-7.92820503578;隐,-7.81900574382;學,-8.07278626459;顺,-6.46334835216;首,-6.3579878365;啼,-8.78840630101;凿,-11.8794487544;丁,-10.0876892851;擁,-8.62135221634;節,-7.96742574894;岂,-7.73631402797;堅,-6.12054698049;妄,-8.88371648081;唇,-8.44546154988;皆,-8.19056930025;舉,-5.40710245986;授,-9.39454210458;對,-7.63095351231;撒,-9.93353860531;洗,-8.26853084172;庖,-10.7808364657;標,-8.44546154988;官,-7.94762312164;望,-6.44136944544;喜,-5.7813744722;感,-6.70896475933;鸡,-6.95946782854;侠,-10.2700108419;欣,-7.58898931322;砥,-11.8794487544;利,-8.83492631664;推,-6.54191067466;漫,-6.72039345515;邪,-9.93353860531;窮,-6.64300679153;词,-10.4931543932;撲,-7.52273992767;怵,-10.7808364657;慈,-9.57686366137;樹,-8.14177913608;蜻,-9.3144993969;羞,-10.7808364657;搽,-11.1863015738;於,-8.78840630101;儿,-9.04623541031;繁,-7.54871541408;挡,-11.1863015738;歃,-9.80000721268;规,-11.8794487544;镇,-8.83492631664;誠,-7.41354063571;惊,-5.44811767243;屍,-8.35308822975;特,-8.24186259464;卓,-7.30473777586;擒,-9.57686366137;違,-8.19056930025;他,-9.68222417703;败,-8.4782513727;過,-7.10032526125;嗜,-11.8794487544;勞,-7.68979401234;繡,-9.80000721268;俠,-10.2700108419;季,-10.7808364657;波,-8.02930115265;补,-10.4931543932;啧,-9.10686003212;物,-7.08365820877;鑽,-10.0876892851;鹅,-9.3144993969;珠,-8.35308822975;即,-10.0876892851;擲,-9.24039142475;灵,-7.08365820877;饿,-9.39454210458;海,-7.11727481957;延,-8.32410069287;寸,-7.44863195552;拾,-9.04623541031;命,-11.8794487544;勾,-8.3829411929;
+B,jn:東,-0.405465108108;產,-1.09861228867;东,-0.405465108108;产,-1.09861228867;
+B,j:退,-9.30870880761;專,-8.21009651894;伊,-10.2642202526;預,-9.67643358773;抗,-7.06963712034;废,-11.8736581651;洞,-9.67643358773;礦,-7.43100690858;伪,-8.69560433472;河,-9.38875151528;徵,-7.34105867192;临,-9.92774801601;机,-9.04044482101;线,-9.57107307208;附,-7.84830647433;反,-6.71460286586;科,-6.63191115001;乔,-9.30870880761;兖,-11.8736581651;统,-8.50636233508;遠,-11.1805109845;班,-10.0818986958;年,-4.18520280852;滿,-10.7750458764;吃,-10.0818986958;厂,-7.55617005153;沈,-9.57107307208;個,-6.60065860651;引,-7.45481755727;五,-4.79954134887;無,-9.79421662339;貨,-9.57107307208;户,-7.41931086882;改,-7.36279865855;参,-8.31831010358;视,-11.8736581651;運,-8.57782129907;毒,-10.7750458764;黔,-8.9292191859;教,-7.46693891781;衛,-8.31831010358;艺,-9.79421662339;秦,-7.45481755727;火,-6.4531231658;独,-7.1029735406;声,-9.04044482101;维,-5.99872743422;萨,-10.7750458764;基,-8.69560433472;广,-6.08064455669;儀,-8.29013922661;順,-9.23460083545;上,-3.29480559327;后,-7.46693891781;經,-5.80755007497;演,-11.8736581651;甘,-11.8736581651;股,-6.82380215782;质,-7.26848797908;醫,-5.5951367409;个,-6.60065860651;足,-7.15515929377;离,-10.7750458764;晚,-11.8736581651;少,-8.21009651894;數,-6.1435583821;智,-11.1805109845;老,-7.24868535179;冀,-9.57107307208;节,-9.92774801601;消,-7.96163515964;掌,-6.62663409291;北,-4.52442734046;冠,-9.92774801601;春,-7.68400342304;欧,-4.6301451904;涨,-6.27153934419;纪,-6.13708586759;讼,-11.8736581651;偷,-9.04044482101;汉,-6.15007306312;車,-6.09910661953;前,-7.06963712034;双,-7.62516292302;塑,-10.7750458764;南,-5.02565289049;几,-11.1805109845;編,-7.73052343868;八,-6.10846706228;仪,-8.29013922661;糾,-10.0818986958;鄂,-7.59699204605;师,-7.77931360285;再,-11.8736581651;锚,-8.54145365489;採,-11.8736581651;箱,-11.8736581651;纳,-7.26848797908;水,-7.83060689724;茶,-9.67643358773;格,-11.8736581651;貿,-8.73816394914;病,-8.04501676858;重,-6.98330903685;职,-8.34729764045;译,-9.38875151528;结,-9.16560796397;光,-5.74460795501;鏡,-8.98328640717;監,-8.31831010358;日,-4.44949288403;武,-5.98478020674;廳,-10.0818986958;噸,-11.8736581651;技,-7.00612371461;越,-8.04501676858;专,-8.21009651894;加,-11.1805109845;鄭,-7.88467411851;尿,-9.47576289227;十,-4.19486916687;轉,-8.26274025243;廈,-11.8736581651;手,-9.92774801601;城,-5.56920936265;取,-9.04044482101;风,-11.8736581651;補,-11.1805109845;江,-5.07348809677;彩,-9.79421662339;黨,-6.4226197115;扫,-11.1805109845;六,-6.00154037559;平,-8.29013922661;職,-8.34729764045;書,-9.16560796397;妇,-7.5042103126;王,-10.0818986958;疏,-9.92774801601;明,-7.44284136623;输,-11.1805109845;團,-8.29013922661;條,-10.0818986958;夜,-9.92774801601;撥,-11.8736581651;亩,-9.16560796397;嬰,-11.8736581651;澳,-9.79421662339;粵,-9.38875151528;冷,-8.98328640717;戶,-7.41931086882;區,-10.2642202526;埃,-10.4873638039;友,-11.1805109845;父,-8.78261571171;藏,-10.4873638039;歐,-4.6301451904;離,-10.7750458764;法,-7.37384849474;雙,-7.62516292302;毛,-9.38875151528;裝,-11.1805109845;婦,-7.5042103126;热,-10.7750458764;公,-7.96163515964;普,-10.2642202526;扶,-10.2642202526;輕,-6.09910661953;幾,-11.1805109845;會,-6.85637832825;三,-4.26578009179;首,-8.6547823402;魯,-7.4916315304;资,-11.1805109845;大,-5.34132387285;温,-9.16560796397;侨,-10.0818986958;錫,-10.2642202526;沪,-5.03739888779;冬,-7.27853831494;支,-8.50636233508;记,-10.7750458764;滲,-11.8736581651;贿,-8.6547823402;权,-9.92774801601;体,-7.98183786696;展,-10.7750458764;兗,-11.8736581651;珠,-6.73199460857;奧,-5.4375077967;卫,-8.31831010358;質,-7.26848797908;飲,-9.57107307208;巴,-6.93201574246;死,-8.57782129907;厅,-10.0818986958;權,-9.92774801601;融,-10.2642202526;东,-4.81576022766;接,-7.66896554568;产,-3.79963194895;学,-8.87792589152;漲,-6.27153934419;收,-9.04044482101;治,-8.98328640717;区,-10.2642202526;辽,-7.55617005153;調,-11.8736581651;社,-5.99872743422;滇,-7.17317779928;案,-10.7750458764;苏,-5.46842970704;泛,-7.34105867192;博,-10.2642202526;保,-7.22926726593;浦,-8.3771506036;短,-10.2642202526;雲,-6.68627235923;深,-3.82104334625;署,-8.23607200534;婴,-11.8736581651;幼,-9.47576289227;考,-10.0818986958;万,-9.47576289227;戏,-10.4873638039;刘,-9.57107307208;府,-10.7750458764;訟,-11.8736581651;黄,-6.48003061872;锡,-10.2642202526;丧,-11.8736581651;天,-6.57035325701;風,-11.8736581651;柳,-8.29013922661;農,-4.56981493979;孕,-8.69560433472;體,-7.98183786696;機,-9.04044482101;勤,-9.79421662339;左,-7.66896554568;統,-8.50636233508;閩,-7.86632497984;胸,-9.79421662339;乾,-8.13598854679;综,-4.92764417397;開,-10.0818986958;林,-8.11245804938;訪,-10.7750458764;本,-8.87792589152;环,-3.39147058285;串,-10.7750458764;访,-10.7750458764;铁,-11.1805109845;燃,-11.1805109845;結,-9.16560796397;乒,-8.23607200534;作,-7.7627843009;塞,-9.67643358773;院,-11.8736581651;执,-9.16560796397;華,-7.39632135059;干,-6.76167037671;執,-9.16560796397;牺,-11.1805109845;門,-8.3771506036;炎,-8.87792589152;民,-6.11160678229;蘭,-11.1805109845;邮,-7.23892917684;銀,-8.02351056336;活,-7.27853831494;亞,-5.98201395324;總,-7.03737625812;协,-8.69560433472;評,-10.7750458764;九,-6.79225380009;远,-11.1805109845;葡,-9.92774801601;无,-9.79421662339;团,-8.29013922661;药,-8.18477871096;山,-9.16560796397;女,-8.13598854679;仲,-9.92774801601;银,-8.02351056336;鹽,-6.64254954822;极,-10.7750458764;内,-7.69927089517;安,-6.43557885615;計,-7.06963712034;養,-9.30870880761;同,-2.93814945357;研,-4.49840238706;战,-8.98328640717;產,-3.79963194895;貧,-7.29894718657;太,-5.03847357892;萬,-9.47576289227;尼,-10.4873638039;資,-11.1805109845;藍,-5.1766239174;烏,-9.57107307208;华,-7.39632135059;近,-7.04534442777;駕,-7.34105867192;托,-11.8736581651;党,-6.4226197115;川,-7.52985274322;糧,-6.82380215782;车,-6.09910661953;審,-11.8736581651;奪,-11.1805109845;省,-5.72092547037;妊,-10.7750458764;訓,-10.4873638039;減,-7.62516292302;贝,-11.8736581651;辦,-8.73816394914;鎮,-9.79421662339;網,-9.47576289227;主,-7.4916315304;證,-4.40514489357;晋,-6.48458643525;网,-9.47576289227;条,-10.0818986958;入,-11.1805109845;聯,-5.58394259416;影,-11.8736581651;極,-10.7750458764;出,-6.72036657057;最,-10.4873638039;掃,-11.1805109845;鞋,-11.8736581651;云,-6.68627235923;管,-7.2886906864;供,-9.04044482101;通,-3.42260477616;貝,-11.8736581651;蔬,-8.21009651894;參,-8.31831010358;减,-7.62516292302;代,-10.4873638039;进,-8.43967096058;煤,-6.05061226959;书,-9.16560796397;罰,-9.67643358773;晶,-9.79421662339;驾,-7.34105867192;國,-3.82359274215;名,-7.73052343868;意,-10.0818986958;皖,-8.73816394914;綜,-4.92764417397;钢,-11.8736581651;急,-11.8736581651;冤,-8.9292191859;货,-9.57107307208;喬,-9.30870880761;男,-8.04501676858;船,-8.43967096058;运,-8.57782129907;委,-7.14627034636;郑,-7.88467411851;長,-6.30531366131;特,-6.76167037671;司,-9.79421662339;轻,-6.09910661953;汽,-7.90336625152;西,-6.38472043891;禁,-11.8736581651;劇,-10.0818986958;合,-8.31831010358;軟,-7.07786761947;外,-6.68627235923;会,-6.85637832825;两,-4.93926095514;犧,-11.1805109845;薩,-10.7750458764;吨,-11.8736581651;被,-8.34729764045;训,-10.4873638039;熱,-10.7750458764;强,-11.8736581651;放,-9.23460083545;私,-8.3771506036;血,-8.16008609837;棋,-11.8736581651;母,-10.2642202526;经,-5.80755007497;金,-8.26274025243;罚,-9.67643358773;早,-9.10106944283;马,-7.62516292302;调,-11.8736581651;排,-10.0818986958;視,-11.8736581651;客,-7.69927089517;交,-4.92284339663;咨,-8.50636233508;港,-6.32458208017;吳,-9.67643358773;嚴,-9.79421662339;貸,-10.7750458764;总,-7.03737625812;阿,-9.92774801601;籃,-10.7750458764;组,-9.79421662339;准,-11.1805109845;哈,-7.83060689724;浙,-11.1805109845;剧,-10.0818986958;湯,-11.1805109845;共,-7.45481755727;直,-9.47576289227;鋼,-11.8736581651;逆,-9.79421662339;認,-11.8736581651;军,-5.83340345379;业,-7.79612072116;控,-11.8736581651;戲,-10.4873638039;油,-7.4792090104;贸,-8.73816394914;裁,-11.8736581651;恆,-6.15334638846;僑,-10.0818986958;瑞,-6.11475639119;以,-7.69927089517;兰,-11.1805109845;矿,-7.43100690858;清,-6.36426982844;吉,-10.2642202526;亚,-5.98201395324;初,-9.92774801601;土,-11.1805109845;校,-9.92774801601;责,-9.92774801601;严,-9.79421662339;群,-10.2642202526;粮,-6.82380215782;申,-11.1805109845;期,-7.12872603671;人,-4.52571434192;俄,-6.39301924173;升,-10.4873638039;住,-9.92774801601;處,-11.8736581651;廚,-10.7750458764;摩,-9.10106944283;门,-8.3771506036;软,-7.07786761947;养,-9.30870880761;建,-4.75645266191;超,-8.26274025243;成,-7.77931360285;龙,-10.0818986958;计,-7.06963712034;尤,-11.1805109845;违,-9.30870880761;戰,-8.98328640717;儲,-10.4873638039;吴,-9.67643358773;边,-9.04044482101;常,-6.03011374804;眾,-9.30870880761;证,-4.40514489357;黃,-6.48003061872;立,-6.48916310228;种,-11.8736581651;行,-5.54037853693;低,-8.04501676858;发,-6.58035334035;兒,-10.4873638039;福,-9.23460083545;湘,-5.37990432522;招,-5.64317671749;非,-7.22926726593;廣,-6.08064455669;工,-4.07760019075;汤,-11.1805109845;僧,-8.00245715416;給,-8.73816394914;磷,-10.0818986958;函,-9.92774801601;遼,-7.55617005153;松,-10.2642202526;七,-8.78261571171;概,-11.8736581651;紅,-6.89005154336;有,-9.47576289227;复,-8.98328640717;小,-9.67643358773;美,-4.36596808725;创,-5.57287237041;縣,-8.9292191859;津,-7.43100690858;粤,-9.38875151528;厦,-11.8736581651;暨,-8.82913572735;喪,-11.8736581651;微,-7.34105867192;电,-7.04534442777;家,-4.42299736886;炼,-9.04044482101;賄,-8.6547823402;假,-8.43967096058;迎,-11.8736581651;街,-9.30870880761;線,-9.57107307208;革,-6.96838338663;業,-7.79612072116;危,-10.4873638039;陕,-6.64791149136;分,-7.96163515964;月,-5.39055081361;残,-10.0818986958;逃,-11.1805109845;甬,-11.8736581651;肝,-11.8736581651;花,-9.30870880761;進,-8.43967096058;輸,-11.1805109845;玻,-9.79421662339;显,-9.57107307208;心,-8.98328640717;桂,-9.57107307208;組,-9.79421662339;采,-11.8736581651;恒,-6.15334638846;给,-8.73816394914;英,-5.3589454742;印,-7.20082933061;石,-4.44830027804;聲,-9.04044482101;百,-9.57107307208;刑,-5.57287237041;圓,-10.2642202526;农,-4.56981493979;生,-6.25325729935;馬,-7.62516292302;鐵,-11.1805109845;医,-5.5951367409;政,-5.2156471192;節,-9.92774801601;居,-7.3093099736;拆,-10.2642202526;晉,-6.48458643525;內,-7.69927089517;台,-6.19348555605;幹,-6.76167037671;偽,-8.69560433472;长,-6.30531366131;境,-11.1805109845;龍,-10.0818986958;漢,-6.15007306312;猪,-11.8736581651;央,-3.29273928277;傳,-9.92774801601;核,-7.62516292302;钻,-8.82913572735;局,-8.13598854679;商,-6.38059672173;乌,-9.57107307208;青,-5.63728857487;淡,-11.1805109845;饮,-9.57107307208;旱,-8.98328640717;矽,-9.79421662339;發,-6.58035334035;蘇,-5.46842970704;二,-5.66506813897;渗,-11.8736581651;朝,-7.81321515452;音,-9.30870880761;储,-10.4873638039;京,-6.24964065888;環,-3.39147058285;房,-2.93722846146;流,-11.1805109845;审,-11.8736581651;煉,-9.04044482101;道,-5.71456277658;步,-11.1805109845;兩,-4.93926095514;部,-6.36426982844;豫,-9.47576289227;滬,-5.03739888779;曼,-10.0818986958;鲁,-7.4916315304;紀,-6.13708586759;市,-6.73785972802;理,-11.1805109845;肉,-11.8736581651;刊,-11.1805109845;投,-6.92489827469;原,-9.57107307208;財,-5.63924743935;航,-7.21021907096;田,-10.2642202526;防,-6.00436125194;德,-5.43911164628;县,-8.9292191859;呆,-9.16560796397;先,-9.38875151528;軍,-5.83340345379;動,-5.61982935349;協,-8.69560433472;婚,-6.77379173725;解,-11.8736581651;孤,-11.8736581651;全,-7.92241444649;转,-8.26274025243;确,-9.67643358773;数,-6.1435583821;空,-7.84830647433;国,-3.82359274215;封,-9.67643358773;稅,-7.98183786696;倉,-7.13745971668;洋,-9.04044482101;後,-7.46693891781;众,-9.30870880761;旅,-8.61556162705;果,-8.08946853115;红,-6.89005154336;认,-11.8736581651;贫,-7.29894718657;中,-2.33942433868;新,-7.06963712034;強,-11.8736581651;评,-10.7750458764;魏,-5.43430779397;灌,-9.04044482101;陝,-6.64791149136;廢,-11.8736581651;臨,-9.92774801601;仓,-7.13745971668;譯,-9.38875151528;森,-8.11245804938;关,-7.68400342304;盲,-9.79421662339;創,-5.57287237041;征,-7.34105867192;一,-3.51194987649;圆,-10.2642202526;興,-7.29894718657;脊,-11.1805109845;编,-7.73052343868;記,-10.7750458764;多,-10.4873638039;财,-5.63924743935;溫,-9.16560796397;維,-5.99872743422;劳,-9.92774801601;甲,-11.1805109845;夺,-11.1805109845;介,-10.0818986958;籌,-11.8736581651;联,-5.58394259416;藥,-8.18477871096;四,-4.21213108371;藝,-9.79421662339;信,-10.2642202526;坦,-10.7750458764;警,-8.9292191859;豬,-11.8736581651;電,-7.04534442777;闽,-7.86632497984;呼,-8.02351056336;企,-8.34729764045;预,-9.67643358773;納,-7.26848797908;纠,-10.0818986958;动,-5.61982935349;師,-7.77931360285;責,-9.92774801601;草,-11.8736581651;村,-6.70317417003;盐,-6.64254954822;打,-8.87792589152;陸,-7.46693891781;高,-5.10977325651;畝,-9.16560796397;廠,-7.55617005153;奥,-5.4375077967;拨,-11.8736581651;自,-8.6547823402;顯,-9.57107307208;篮,-10.7750458764;東,-4.81576022766;筹,-11.8736581651;开,-10.0818986958;处,-11.8736581651;文,-5.68334275922;昆,-8.16008609837;劉,-9.57107307208;律,-11.8736581651;布,-10.7750458764;規,-10.2642202526;税,-7.98183786696;世,-6.23175109413;舞,-9.30870880761;传,-9.92774801601;宣,-8.87792589152;助,-9.23460083545;錨,-8.54145365489;種,-11.8736581651;地,-6.68627235923;装,-11.1805109845;陆,-7.46693891781;拉,-6.1969043628;午,-11.8736581651;监,-8.31831010358;湖,-10.7750458764;站,-10.4873638039;存,-7.62516292302;蓝,-5.1766239174;镜,-8.98328640717;满,-10.7750458764;獨,-7.1029735406;快,-9.67643358773;郵,-7.23892917684;兴,-7.29894718657;混,-10.0818986958;學,-8.87792589152;顺,-9.23460083545;唇,-11.1805109845;邊,-9.04044482101;夏,-8.34729764045;洗,-10.4873638039;準,-11.1805109845;殘,-10.0818986958;办,-8.73816394914;厨,-10.7750458764;贷,-10.7750458764;確,-9.67643358773;儿,-10.4873638039;硅,-9.79421662339;规,-10.2642202526;镇,-9.79421662339;集,-9.10106944283;批,-11.8736581651;違,-9.30870880761;關,-7.68400342304;勞,-9.92774801601;正,-9.38875151528;波,-10.7750458764;补,-11.1805109845;物,-8.78261571171;諮,-8.50636233508;哲,-10.7750458764;海,-6.4226197115;鑽,-8.82913572735;
+B,ln:人,0.0;
+B,l:怀,-8.32623553169;挂,-10.3277155319;誇,-11.9371534443;谈,-8.17595332864;随,-6.38419385941;預,-10.3277155319;抗,-6.51661844506;蜚,-10.1453939751;亟,-8.71827761946;贞,-8.67905690631;造,-6.95354682262;猢,-11.9371534443;礦,-10.3277155319;河,-8.2995672846;欲,-7.29276254519;临,-9.85771190265;銷,-9.37220408687;吸,-8.0251304389;類,-9.85771190265;宽,-9.16456472209;线,-7.58044461764;談,-8.17595332864;反,-7.18356325322;姑,-9.73992886699;摘,-10.1453939751;话,-8.47141754153;軟,-6.61903345049;赞,-8.99271446516;凡,-11.2440062638;遠,-7.70304693973;身,-7.54270428966;知,-6.93320713838;除,-7.00989975917;緩,-9.99124329527;罪,-10.1453939751;揭,-9.04678168643;扬,-10.1453939751;歲,-10.3277155319;其,-8.75909961398;闹,-8.50316623984;绿,-7.91180175359;渔,-10.1453939751;愁,-10.3277155319;沈,-9.45224679454;個,-7.34203359419;颐,-9.45224679454;引,-6.76666944929;应,-8.13049095456;丟,-8.47141754153;無,-4.08160876641;循,-7.19222131597;抬,-8.67905690631;是,-4.8289093046;讲,-9.73992886699;视,-11.2440062638;賈,-10.3277155319;運,-6.59004591361;寒,-9.16456472209;教,-9.53925817153;衛,-11.2440062638;也,-4.71824373671;睥,-11.9371534443;秦,-10.3277155319;滴,-10.3277155319;须,-8.75909961398;基,-6.09071466927;广,-6.92651815023;巾,-11.9371534443;沉,-9.45224679454;上,-5.34547971232;后,-7.98590972575;經,-5.38037508817;底,-8.47141754153;蒙,-6.76666944929;攘,-8.67905690631;键,-8.75909961398;枯,-9.73992886699;妻,-9.04678168643;媽,-10.5508590832;笼,-11.9371534443;绕,-11.9371534443;敘,-9.37220408687;虚,-11.9371534443;寧,-11.2440062638;号,-8.8016592284;啸,-9.53925817153;老,-6.76100371176;膀,-9.53925817153;节,-7.85961600042;构,-6.62394746529;消,-6.17825167045;躊,-10.1453939751;頑,-9.10394010027;這,-4.86898144394;貞,-8.67905690631;冠,-7.29276254519;鬧,-8.50316623984;脫,-9.63456835134;纪,-9.22910324323;吹,-9.99124329527;精,-7.98590972575;汉,-10.8385411557;車,-9.53925817153;前,-6.53447606246;双,-9.29809611471;坏,-9.99124329527;轟,-10.1453939751;几,-7.35218596566;勢,-8.38180538284;巨,-11.9371534443;扭,-6.88090763898;卷,-8.44064588286;固,-5.17326853577;遥,-7.29276254519;齿,-9.99124329527;贊,-8.99271446516;再,-7.49450218784;挖,-11.2440062638;蔚,-8.15296381041;嚣,-8.89263100661;碧,-9.45224679454;義,-6.36880894057;披,-9.37220408687;分,-6.27767122857;躲,-8.53595606267;水,-5.40773460607;傷,-8.47141754153;猶,-8.32623553169;所,-7.22762324302;重,-6.76666944929;灌,-10.1453939751;坎,-9.73992886699;结,-6.79548988783;饒,-7.94816939777;難,-6.01022741836;学,-7.56770559186;翩,-9.99124329527;臭,-11.9371534443;诱,-9.37220408687;递,-9.53925817153;陸,-8.04533314622;持,-10.5508590832;技,-7.06961899387;标,-8.64131657832;越,-8.67905690631;瞎,-11.2440062638;笑,-7.79401871794;鴕,-10.5508590832;辞,-9.37220408687;加,-7.87671043378;纨,-10.5508590832;誰,-10.1453939751;贵,-9.99124329527;貴,-9.99124329527;故,-8.89263100661;蓄,-7.79401871794;謠,-11.9371534443;轉,-7.10883970703;免,-11.2440062638;城,-8.56985761434;絕,-7.4485170746;江,-11.9371534443;连,-5.80592695485;略,-9.22910324323;顧,-8.0251304389;實,-6.67446325542;彩,-7.98590972575;黨,-8.56985761434;扫,-8.35363450587;賴,-7.60642010404;偷,-9.85771190265;叶,-11.9371534443;相,-4.56189766632;好,-5.30120688864;争,-7.42629393781;王,-8.32623553169;球,-9.16456472209;疏,-8.60494893415;條,-7.14966170155;趟,-11.9371534443;花,-7.79401871794;逢,-7.81001905928;莫,-6.86824924211;冷,-9.22910324323;制,-9.99124329527;霸,-9.10394010027;飞,-8.75909961398;綿,-9.85771190265;酌,-11.9371534443;子,-8.24827399022;離,-9.73992886699;毛,-9.73992886699;裝,-8.19948382605;玻,-7.77827036097;占,-8.41079291971;婦,-8.15296381041;普,-9.99124329527;議,-10.8385411557;寻,-8.35363450587;飽,-8.94142117078;幾,-7.35218596566;會,-10.3277155319;薄,-9.73992886699;三,-5.73664427029;濃,-7.98590972575;階,-6.21030569674;娑,-11.2440062638;缓,-9.99124329527;抖,-10.3277155319;講,-9.73992886699;榜,-8.35363450587;负,-8.99271446516;大,-4.79908041028;挫,-11.9371534443;支,-10.1453939751;暮,-8.99271446516;记,-7.49450218784;扁,-8.8016592284;权,-10.1453939751;义,-6.36880894057;鍋,-9.53925817153;賊,-9.53925817153;凌,-11.9371534443;問,-7.55512680966;当,-8.56985761434;飒,-10.1453939751;拖,-10.8385411557;衝,-9.73992886699;牡,-10.5508590832;嫦,-9.29809611471;恭,-9.99124329527;蛮,-9.29809611471;話,-8.47141754153;具,-9.99124329527;哺,-8.47141754153;顽,-9.10394010027;權,-10.1453939751;颓,-11.9371534443;依,-6.78386184983;东,-7.82627958016;那,-7.31218063105;訴,-9.53925817153;区,-9.73992886699;羽,-11.9371534443;社,-4.94874026233;旁,-9.73992886699;胃,-8.8016592284;杂,-8.08700584262;壓,-8.04533314622;归,-7.73246082494;泛,-11.9371534443;保,-7.37280525286;面,-6.37263303701;句,-9.63456835134;深,-6.8619796291;雷,-9.22910324323;當,-8.56985761434;凹,-8.2735917982;選,-9.45224679454;系,-6.96734014475;忽,-7.82627958016;幼,-8.67905690631;抄,-9.73992886699;万,-6.61414346519;殊,-10.1453939751;圍,-9.04678168643;徒,-9.73992886699;英,-8.15296381041;連,-5.80592695485;天,-5.50100307596;風,-6.67446325542;音,-8.8016592284;農,-5.87803024875;论,-9.53925817153;捅,-10.8385411557;雌,-6.33873148533;燎,-9.37220408687;體,-8.56985761434;旖,-10.1453939751;揚,-10.1453939751;機,-7.22762324302;遣,-10.5508590832;豺,-10.8385411557;勤,-7.71764573915;左,-8.64131657832;磨,-10.5508590832;良,-8.13049095456;泰,-11.9371534443;陷,-8.8016592284;类,-9.85771190265;综,-6.56187503665;穿,-9.85771190265;攀,-11.9371534443;昂,-8.94142117078;谆,-9.53925817153;開,-5.87104535423;萬,-6.61414346519;笔,-9.73992886699;林,-9.29809611471;搖,-8.04533314622;碩,-9.63456835134;本,-9.22910324323;串,-11.2440062638;吶,-8.89263100661;点,-8.44064588286;擁,-8.71827761946;時,-5.94819202744;过,-6.02095138172;雍,-9.53925817153;過,-6.02095138172;結,-6.79548988783;答,-8.2995672846;潜,-11.9371534443;釣,-10.8385411557;鋥,-10.3277155319;華,-9.16456472209;走,-6.31675257861;蹲,-11.9371534443;執,-8.35363450587;價,-6.62888574693;彼,-9.63456835134;顾,-8.0251304389;炎,-11.9371534443;少,-5.91856022983;餓,-10.5508590832;丝,-6.52550739247;賢,-9.85771190265;別,-7.48280614808;蔫,-9.73992886699;振,-9.22910324323;醜,-11.2440062638;亲,-6.98839355395;總,-7.07734103997;韌,-8.94142117078;郎,-10.1453939751;驕,-9.73992886699;赛,-11.2440062638;獎,-11.2440062638;九,-9.37220408687;远,-7.70304693973;团,-9.04678168643;古,-8.10851204784;药,-11.2440062638;说,-3.94861046159;银,-9.85771190265;凸,-9.85771190265;繽,-11.9371534443;計,-6.0936090273;同,-6.94672085755;邏,-8.19948382605;战,-8.94142117078;愚,-10.1453939751;產,-5.93573856637;冥,-7.64669400318;太,-6.93320713838;断,-10.5508590832;搬,-10.8385411557;丰,-8.64131657832;食,-6.8619796291;資,-8.44064588286;但,-11.2440062638;诉,-9.53925817153;楊,-11.9371534443;像,-8.64131657832;华,-9.16456472209;駕,-11.9371534443;杖,-11.2440062638;托,-10.8385411557;棟,-10.8385411557;糧,-6.09942299716;旭,-9.85771190265;买,-9.29809611471;鱼,-8.89263100661;悄,-7.37280525286;來,-8.64131657832;和,-7.1331323996;透,-7.81001905928;娓,-9.29809611471;夕,-8.71827761946;減,-10.5508590832;骨,-8.50316623984;宾,-11.2440062638;汇,-8.56985761434;證,-8.99271446516;偏,-10.1453939751;网,-9.85771190265;因,-9.29809611471;入,-8.8016592284;蓬,-9.22910324323;聯,-5.89689873305;揮,-8.10851204784;仰,-6.89372832741;出,-5.99173283572;闔,-11.9371534443;最,-7.02449855859;掃,-8.35363450587;誉,-10.8385411557;忘,-10.8385411557;供,-6.38419385941;樞,-9.10394010027;琢,-9.29809611471;窩,-9.85771190265;笨,-8.94142117078;澆,-11.9371534443;喷,-9.73992886699;阶,-6.21030569674;犹,-8.32623553169;债,-11.2440062638;杀,-7.59334802248;情,-6.30594166251;减,-10.5508590832;黑,-7.18356325322;齐,-8.10851204784;寓,-9.85771190265;进,-11.9371534443;聚,-7.26432460987;离,-9.73992886699;盡,-6.03999957669;靠,-8.50316623984;口,-7.84280888211;照,-10.5508590832;敬,-8.94142117078;鬼,-9.16456472209;轰,-10.1453939751;闷,-8.24827399022;陶,-10.8385411557;獸,-11.2440062638;翻,-7.38327655273;遺,-11.9371534443;驾,-11.9371534443;了,-8.2735917982;看,-7.38327655273;名,-6.8745584113;徐,-9.99124329527;粒,-10.1453939751;語,-10.8385411557;瞠,-8.0251304389;钢,-9.53925817153;冤,-9.53925817153;紧,-7.27371435022;度,-10.5508590832;末,-9.73992886699;搭,-9.22910324323;男,-7.14966170155;鼻,-9.10394010027;為,-5.57240268748;尽,-6.03999957669;间,-8.10851204784;浇,-11.9371534443;苍,-9.63456835134;硕,-9.63456835134;委,-9.45224679454;敗,-10.5508590832;潛,-11.9371534443;健,-9.99124329527;穩,-6.92651815023;乱,-8.35363450587;長,-4.73151826792;零,-10.8385411557;特,-8.44064588286;彻,-9.63456835134;雾,-10.1453939751;饿,-10.5508590832;潔,-11.9371534443;要,-8.15296381041;逐,-9.53925817153;钓,-10.8385411557;会,-10.3277155319;被,-8.35363450587;尸,-10.1453939751;傻,-8.32623553169;强,-5.79511603874;见,-6.79548988783;惡,-6.78386184983;经,-5.38037508817;金,-7.0026795112;鹤,-11.9371534443;周,-8.41079291971;语,-10.8385411557;浮,-6.90671552294;聰,-9.37220408687;晴,-8.47141754153;奶,-10.1453939751;鷹,-11.9371534443;叽,-11.9371534443;调,-11.9371534443;與,-6.76100371176;撈,-9.16456472209;验,-10.3277155319;香,-9.04678168643;隔,-7.47124532567;視,-11.2440062638;星,-8.75909961398;颠,-11.9371534443;客,-10.1453939751;弥,-8.56985761434;纤,-8.0251304389;甩,-9.85771190265;港,-11.9371534443;脱,-9.63456835134;暴,-8.44064588286;逻,-8.19948382605;號,-8.8016592284;寢,-7.91180175359;燦,-9.53925817153;胰,-9.16456472209;摳,-11.9371534443;更,-6.05104941288;穷,-9.22910324323;鋼,-9.53925817153;樂,-8.71827761946;雞,-8.10851204784;嬌,-11.9371534443;間,-8.10851204784;划,-10.3277155319;业,-9.53925817153;搞,-10.8385411557;夠,-9.37220408687;缤,-11.9371534443;用,-5.53689599902;领,-7.2458055621;謬,-11.2440062638;侯,-10.8385411557;吾,-11.9371534443;跃,-10.5508590832;仅,-6.80135500728;秋,-7.9298202591;雕,-10.3277155319;诗,-9.63456835134;驢,-11.9371534443;陪,-11.2440062638;譬,-7.85961600042;俯,-10.3277155319;腰,-9.10394010027;顶,-9.63456835134;矿,-10.3277155319;清,-6.45235651084;指,-7.66048732531;稍,-8.24827399022;完,-9.45224679454;袖,-9.63456835134;愛,-8.32623553169;群,-7.06961899387;險,-8.94142117078;應,-8.13049095456;觀,-7.38327655273;久,-7.25502221721;迄,-6.57117742931;胆,-8.75909961398;葉,-11.9371534443;奋,-8.35363450587;積,-7.89410217649;富,-8.2735917982;灑,-9.45224679454;滚,-8.15296381041;束,-10.5508590832;忤,-10.1453939751;卧,-8.2995672846;门,-11.9371534443;盪,-10.5508590832;软,-6.61903345049;柴,-9.99124329527;养,-8.06595243342;建,-9.10394010027;牽,-9.73992886699;链,-8.17595332864;言,-8.35363450587;超,-8.22358137762;蜀,-11.2440062638;禍,-10.5508590832;鼎,-10.1453939751;儒,-11.9371534443;抛,-10.8385411557;管,-8.0251304389;夢,-9.99124329527;戰,-8.94142117078;徹,-9.63456835134;常,-5.96589160454;值,-7.31218063105;眾,-8.56985761434;毁,-11.9371534443;立,-8.13049095456;种,-7.85961600042;发,-3.78265326918;兒,-7.91180175359;这,-4.86898144394;乘,-8.10851204784;招,-7.19222131597;寡,-8.75909961398;廣,-6.92651815023;奢,-10.5508590832;工,-5.49302218763;層,-9.85771190265;烧,-8.64131657832;器,-11.2440062638;潮,-9.22910324323;艰,-8.53595606267;翹,-11.2440062638;幸,-8.41079291971;勻,-9.53925817153;七,-7.82627958016;概,-10.1453939751;有,-3.61305968288;暈,-11.2440062638;阖,-11.9371534443;复,-7.66048732531;小,-6.73865641306;美,-8.2735917982;醒,-11.2440062638;甕,-8.60494893415;饮,-8.2735917982;辛,-10.5508590832;鸣,-9.22910324323;隨,-6.38419385941;喪,-10.1453939751;胳,-9.99124329527;砷,-11.2440062638;家,-6.153328262;弹,-8.24827399022;纸,-10.1453939751;观,-7.38327655273;泄,-10.1453939751;屏,-11.9371534443;卑,-9.10394010027;燒,-8.64131657832;余,-9.53925817153;付,-7.4485170746;扛,-11.2440062638;淚,-7.15802995122;胜,-7.91180175359;另,-8.19948382605;雨,-8.44064588286;橫,-8.06595243342;業,-9.53925817153;修,-8.56985761434;懲,-10.3277155319;敵,-8.32623553169;擴,-8.8016592284;寶,-11.9371534443;兽,-11.2440062638;鑿,-11.9371534443;侃,-10.3277155319;堪,-11.2440062638;月,-11.2440062638;宋,-10.1453939751;碍,-10.1453939751;倒,-7.40455395118;优,-7.41536486728;掛,-10.3277155319;在,-8.53595606267;抱,-9.04678168643;螳,-9.73992886699;去,-9.99124329527;促,-11.9371534443;资,-8.44064588286;銹,-9.10394010027;仙,-9.73992886699;毫,-5.02441062384;路,-9.63456835134;拱,-9.63456835134;柳,-9.53925817153;聲,-7.89410217649;整,-7.21865457303;編,-8.41079291971;兼,-10.3277155319;百,-6.8619796291;刑,-7.9298202591;圓,-6.96734014475;炒,-10.5508590832;铮,-10.8385411557;思,-7.71764573915;酚,-10.3277155319;宠,-11.2440062638;贯,-11.9371534443;亮,-8.53595606267;悲,-8.32623553169;夷,-8.44064588286;难,-6.01022741836;毀,-11.9371534443;拆,-9.63456835134;量,-6.77236747041;論,-9.53925817153;乙,-7.89410217649;还,-8.2995672846;飢,-8.64131657832;內,-9.99124329527;癩,-10.1453939751;哪,-8.60494893415;艱,-8.53595606267;杳,-11.9371534443;競,-8.71827761946;幹,-8.0251304389;獻,-11.9371534443;災,-9.45224679454;长,-4.73151826792;图,-8.75909961398;趁,-9.45224679454;龍,-10.5508590832;希,-8.50316623984;疑,-9.10394010027;吐,-11.2440062638;唱,-8.8016592284;貫,-11.9371534443;猪,-10.5508590832;辭,-9.37220408687;戴,-8.35363450587;纷,-10.1453939751;势,-8.38180538284;臉,-8.19948382605;呐,-8.89263100661;青,-7.70304693973;赖,-7.60642010404;巡,-7.94816939777;籠,-11.9371534443;形,-6.51220342685;迭,-8.64131657832;旱,-8.2735917982;想,-5.24011919666;發,-3.78265326918;勿,-10.5508590832;洁,-11.9371534443;脉,-9.99124329527;铭,-8.99271446516;尋,-8.35363450587;莊,-11.9371534443;舟,-9.85771190265;储,-8.94142117078;躬,-9.45224679454;榮,-11.2440062638;耳,-9.29809611471;夹,-8.75909961398;流,-5.54022378911;諄,-9.53925817153;道,-9.45224679454;单,-8.38180538284;棘,-8.24827399022;诚,-7.70304693973;絡,-7.77827036097;兩,-6.92651815023;只,-8.35363450587;擰,-9.53925817153;沁,-11.9371534443;贪,-9.99124329527;肉,-9.10394010027;愈,-6.8745584113;舊,-9.85771190265;宏,-9.85771190265;锐,-9.29809611471;辗,-10.8385411557;眨,-9.45224679454;雜,-8.08700584262;德,-11.9371534443;夸,-11.9371534443;眼,-7.06195612113;倾,-11.9371534443;摆,-8.71827761946;彌,-8.56985761434;哑,-10.1453939751;動,-6.60927727554;意,-5.85951120098;俗,-6.19095025379;裙,-10.5508590832;杜,-11.2440062638;聞,-6.62394746529;童,-10.5508590832;孤,-7.37280525286;韧,-8.94142117078;全,-6.61903345049;转,-7.10883970703;误,-9.29809611471;数,-6.45235651084;至,-6.02095138172;祸,-10.5508590832;闻,-6.62394746529;空,-6.95354682262;国,-5.64743787342;逼,-9.99124329527;灾,-9.45224679454;谁,-10.1453939751;亂,-8.35363450587;把,-11.9371534443;後,-7.98590972575;众,-8.56985761434;簡,-6.79548988783;綠,-7.91180175359;红,-7.14136289873;霧,-10.1453939751;贫,-8.17595332864;中,-5.95070143904;新,-6.91327292348;強,-5.79511603874;頹,-11.9371534443;画,-9.73992886699;傾,-11.9371534443;评,-10.3277155319;蝇,-9.10394010027;风,-6.67446325542;晝,-8.56985761434;屡,-7.76276617443;適,-8.0053278116;赫,-9.45224679454;曲,-9.16456472209;白,-8.24827399022;一,-3.66407211066;掉,-10.8385411557;興,-7.48280614808;脊,-5.67375518174;記,-7.49450218784;索,-11.2440062638;頤,-9.45224679454;玩,-9.73992886699;溫,-8.75909961398;吆,-9.45224679454;谬,-11.2440062638;悉,-9.99124329527;脈,-9.99124329527;示,-10.5508590832;戊,-7.59334802248;擇,-9.99124329527;限,-10.3277155319;燕,-11.9371534443;達,-9.63456835134;藥,-11.2440062638;藝,-9.53925817153;捞,-9.16456472209;嫣,-11.2440062638;絢,-11.2440062638;睦,-8.41079291971;拥,-8.71827761946;警,-10.8385411557;豬,-10.5508590832;敲,-8.0053278116;懵,-8.53595606267;对,-4.71897660593;電,-6.03725609075;呼,-7.68865820228;漁,-10.1453939751;按,-7.03187866589;隐,-7.82627958016;閒,-8.17595332864;謙,-10.8385411557;誘,-9.37220408687;莞,-8.50316623984;动,-6.60927727554;购,-9.99124329527;責,-10.8385411557;议,-10.8385411557;財,-8.75909961398;棄,-9.10394010027;摇,-8.04533314622;捉,-8.56985761434;顏,-11.9371534443;坑,-8.04533314622;踢,-9.99124329527;汗,-9.63456835134;虛,-11.9371534443;祥,-9.63456835134;東,-7.82627958016;艳,-9.53925817153;登,-7.89410217649;灿,-9.53925817153;現,-11.2440062638;茁,-9.10394010027;文,-5.00959553805;福,-9.45224679454;世,-5.22177005799;攜,-9.45224679454;舞,-11.9371534443;鼠,-11.2440062638;瘦,-8.53595606267;助,-8.8016592284;仁,-11.2440062638;求,-8.50316623984;装,-8.19948382605;拉,-7.42629393781;坐,-7.94816939777;兔,-10.5508590832;湖,-11.9371534443;識,-8.44064588286;臟,-10.5508590832;屢,-7.76276617443;獨,-7.10087153738;濫,-8.84611099097;并,-7.05435152174;竹,-8.94142117078;學,-7.56770559186;顺,-8.2995672846;凿,-11.9371534443;蠅,-9.10394010027;舉,-7.27371435022;對,-4.71897660593;夏,-11.9371534443;熔,-9.99124329527;洗,-8.64131657832;準,-9.63456835134;標,-8.64131657832;殘,-8.67905690631;望,-9.10394010027;萝,-10.5508590832;感,-6.52998167287;鸡,-8.10851204784;利,-8.8016592284;漫,-9.16456472209;邪,-9.73992886699;撲,-7.9298202591;確,-8.99271446516;儿,-7.91180175359;激,-7.50633664549;规,-7.3024244561;惊,-8.04533314622;屍,-10.1453939751;卓,-10.8385411557;違,-7.19222131597;他,-6.06503565485;幡,-10.1453939751;忠,-8.71827761946;季,-5.62541863518;啧,-8.89263100661;物,-5.46945471822;慎,-8.41079291971;寸,-7.94816939777;命,-8.75909961398;退,-7.3024244561;專,-6.20705366136;舌,-10.8385411557;貓,-10.3277155319;且,-7.23667307854;羅,-8.8016592284;宝,-11.9371534443;鋤,-11.2440062638;驚,-8.04533314622;爬,-9.73992886699;售,-6.77236747041;方,-8.67905690631;机,-7.22762324302;贾,-10.3277155319;齊,-8.10851204784;賓,-11.2440062638;狗,-8.64131657832;飛,-8.75909961398;坚,-10.8385411557;寝,-7.91180175359;统,-5.47881516098;查,-9.73992886699;班,-10.3277155319;年,-6.21030569674;慶,-11.2440062638;摸,-7.03931364438;滿,-6.37647181331;吃,-6.25017808799;的,-8.94142117078;娇,-11.9371534443;昏,-7.4485170746;輕,-8.60494893415;五,-7.08512318041;悠,-9.99124329527;探,-9.99124329527;洩,-10.1453939751;貨,-5.50260692554;倫,-9.53925817153;识,-8.44064588286;嘯,-9.53925817153;單,-8.38180538284;失,-10.1453939751;碰,-8.06595243342;憶,-9.04678168643;改,-11.9371534443;蠻,-9.29809611471;参,-9.04678168643;雄,-8.15296381041;毒,-11.2440062638;何,-8.8016592284;滔,-9.99124329527;留,-8.84611099097;顛,-11.9371534443;来,-8.64131657832;触,-9.22910324323;浩,-9.63456835134;火,-7.48280614808;独,-7.10087153738;问,-7.55512680966;饱,-8.94142117078;声,-7.89410217649;罵,-8.60494893415;艷,-9.53925817153;譽,-10.8385411557;儀,-8.67905690631;宇,-6.61903345049;順,-8.2995672846;紈,-10.5508590832;憋,-11.2440062638;井,-11.9371534443;甘,-10.8385411557;窝,-9.85771190265;龟,-10.5508590832;股,-6.40772435682;质,-9.99124329527;个,-7.34203359419;碱,-8.2995672846;纵,-11.2440062638;获,-9.10394010027;饶,-7.94816939777;便,-10.3277155319;阴,-7.7474987023;捡,-10.5508590832;雅,-8.99271446516;拍,-9.63456835134;佔,-8.41079291971;受,-5.91613009498;孜,-8.94142117078;胡,-8.44064588286;缺,-9.16456472209;绵,-9.85771190265;恶,-6.78386184983;數,-6.45235651084;送,-9.37220408687;锃,-10.3277155319;垄,-7.35218596566;血,-5.92834025889;掌,-11.2440062638;树,-9.29809611471;北,-6.79548988783;膠,-9.45224679454;蔣,-10.5508590832;抢,-9.10394010027;春,-7.91180175359;欧,-8.32623553169;梦,-9.99124329527;爭,-7.42629393781;報,-8.0251304389;鸵,-10.5508590832;悶,-8.24827399022;沾,-10.8385411557;啃,-10.8385411557;狂,-9.16456472209;才,-8.44064588286;杏,-10.8385411557;桑,-11.9371534443;浓,-7.98590972575;南,-6.54808171451;跨,-11.2440062638;八,-7.63308835113;仪,-8.67905690631;瓮,-8.60494893415;称,-8.99271446516;胶,-9.45224679454;使,-6.61903345049;刀,-10.8385411557;各,-4.95243712421;颇,-8.17595332864;师,-11.2440062638;祖,-8.35363450587;而,-11.9371534443;气,-8.10851204784;化,-5.20018648633;斥,-9.45224679454;辩,-7.89410217649;劫,-10.1453939751;洪,-8.24827399022;騰,-8.67905690631;茶,-9.85771190265;压,-8.04533314622;輾,-10.8385411557;病,-9.29809611471;壇,-9.29809611471;筆,-9.73992886699;拋,-10.8385411557;职,-10.5508590832;卖,-7.91180175359;慢,-8.94142117078;日,-7.87671043378;武,-5.25755425848;浪,-8.32623553169;驰,-11.9371534443;銀,-9.85771190265;锅,-9.53925817153;脍,-11.9371534443;专,-6.20705366136;颜,-11.9371534443;從,-5.6400441244;抠,-11.9371534443;别,-7.48280614808;催,-10.5508590832;启,-7.25502221721;达,-9.63456835134;十,-5.80810323427;憨,-10.5508590832;畅,-10.3277155319;密,-7.32203292749;手,-7.94816939777;緊,-7.27371435022;背,-10.8385411557;遗,-11.9371534443;取,-9.73992886699;静,-7.28319309417;嗚,-7.67447356729;荡,-10.5508590832;淪,-9.85771190265;平,-6.67446325542;鳴,-9.22910324323;職,-10.5508590832;書,-11.9371534443;匀,-9.53925817153;适,-8.0053278116;锄,-11.2440062638;妇,-8.15296381041;尊,-10.1453939751;明,-6.20058114685;输,-7.82627958016;團,-9.04678168643;夜,-7.49450218784;携,-9.45224679454;举,-7.27371435022;區,-9.73992886699;婆,-11.9371534443;廉,-8.22358137762;彈,-8.24827399022;父,-8.71827761946;藏,-10.1453939751;虎,-9.53925817153;歐,-8.32623553169;法,-9.29809611471;赔,-8.2995672846;雙,-9.29809611471;繞,-11.9371534443;汪,-9.29809611471;热,-6.28466426406;公,-6.98839355395;闯,-9.73992886699;孰,-8.04533314622;懷,-8.32623553169;扶,-9.22910324323;渾,-7.89410217649;楼,-10.8385411557;善,-10.1453939751;很,-6.59961536463;耍,-7.61966533079;袒,-11.2440062638;营,-8.17595332864;温,-8.75909961398;猫,-10.3277155319;貪,-9.99124329527;冬,-7.98590972575;唯,-7.02449855859;皮,-8.22358137762;稱,-8.99271446516;雲,-8.10851204784;鶴,-11.9371534443;栽,-8.44064588286;烂,-10.5508590832;谣,-11.9371534443;体,-8.56985761434;硝,-7.77827036097;點,-8.44064588286;藤,-8.13049095456;陽,-9.63456835134;卫,-11.2440062638;泪,-7.15802995122;目,-8.84611099097;飲,-8.2735917982;巴,-7.3024244561;虹,-11.2440062638;死,-7.64669400318;擺,-8.71827761946;滾,-8.15296381041;須,-8.75909961398;蒋,-10.5508590832;融,-7.37280525286;錚,-10.8385411557;接,-6.11115333695;产,-5.93573856637;咫,-9.37220408687;犯,-8.41079291971;厉,-10.8385411557;收,-8.60494893415;治,-8.13049095456;調,-11.9371534443;腎,-7.04680431611;跑,-7.55512680966;豐,-8.64131657832;盗,-9.73992886699;博,-8.08700584262;神,-5.24506970182;表,-10.1453939751;寵,-11.2440062638;驴,-11.9371534443;追,-8.71827761946;璀,-9.85771190265;包,-8.64131657832;岗,-11.2440062638;嘗,-10.8385411557;黄,-7.11687187872;枢,-9.10394010027;挥,-8.10851204784;丧,-10.1453939751;润,-11.9371534443;梨,-10.8385411557;含,-9.63456835134;掺,-10.8385411557;獅,-10.8385411557;奉,-11.2440062638;浑,-7.89410217649;闖,-9.73992886699;煙,-8.44064588286;彝,-11.9371534443;络,-7.77827036097;擠,-9.85771190265;統,-5.47881516098;时,-5.94819202744;胸,-10.3277155319;享,-8.10851204784;销,-9.37220408687;優,-7.41536486728;驗,-10.3277155319;徇,-9.73992886699;蚍,-11.9371534443;怎,-8.60494893415;报,-8.0251304389;挤,-9.85771190265;谦,-10.8385411557;横,-8.06595243342;銳,-9.29809611471;环,-7.89410217649;細,-7.76276617443;馳,-11.9371534443;搶,-9.10394010027;脸,-8.19948382605;似,-7.56770559186;铁,-8.44064588286;旋,-10.5508590832;绝,-7.4485170746;察,-11.9371534443;塞,-9.63456835134;若,-10.8385411557;鼓,-8.64131657832;可,-4.15184826179;遮,-9.29809611471;干,-8.0251304389;惹,-8.38180538284;添,-8.71827761946;艺,-9.53925817153;門,-11.9371534443;妈,-10.5508590832;民,-6.07636722086;互,-7.71764573915;候,-6.93994117057;紛,-10.1453939751;龜,-10.5508590832;增,-9.99124329527;暢,-10.3277155319;沦,-9.85771190265;說,-3.94861046159;瞬,-9.85771190265;匯,-8.56985761434;就,-9.16456472209;活,-6.72766729149;围,-9.04678168643;囂,-8.89263100661;竊,-9.73992886699;捏,-8.56985761434;評,-10.3277155319;比,-5.15496138832;遙,-7.29276254519;釘,-8.2995672846;壞,-9.99124329527;无,-4.08160876641;畫,-9.73992886699;山,-7.10883970703;女,-8.32623553169;茫,-9.04678168643;劃,-10.3277155319;内,-9.99124329527;安,-7.89410217649;養,-8.06595243342;洒,-9.45224679454;圖,-8.75909961398;焚,-10.8385411557;四,-6.90020084192;映,-8.47141754153;貧,-8.17595332864;伦,-9.53925817153;听,-9.53925817153;献,-11.9371534443;破,-7.58044461764;款,-11.9371534443;勃,-9.04678168643;近,-4.48881958343;乐,-8.71827761946;叙,-9.37220408687;党,-8.56985761434;壟,-7.35218596566;敢,-9.45224679454;臥,-8.2995672846;车,-9.53925817153;科,-8.94142117078;闭,-7.87671043378;鹰,-11.9371534443;絲,-6.52550739247;任,-9.22910324323;省,-9.99124329527;還,-8.2995672846;嬉,-9.45224679454;樓,-10.8385411557;飯,-11.9371534443;猙,-11.2440062638;銘,-8.99271446516;鲜,-9.45224679454;实,-6.67446325542;侦,-8.89263100661;親,-6.98839355395;咬,-7.82627958016;稳,-6.92651815023;網,-9.85771190265;主,-7.32203292749;充,-8.94142117078;忆,-9.04678168643;等,-8.2735917982;里,-8.99271446516;鵝,-11.2440062638;条,-7.14966170155;既,-11.2440062638;叮,-9.99124329527;影,-8.89263100661;購,-9.99124329527;戎,-10.8385411557;云,-8.10851204784;辯,-7.89410217649;嘖,-8.89263100661;通,-4.70514311266;肥,-10.8385411557;愤,-10.3277155319;並,-7.05435152174;刮,-11.2440062638;头,-7.31218063105;斷,-10.5508590832;贼,-9.53925817153;雁,-10.8385411557;參,-9.04678168643;僅,-6.80135500728;兄,-11.9371534443;操,-6.83120797043;敌,-8.32623553169;滑,-8.50316623984;楔,-8.10851204784;做,-11.2440062638;渺,-10.3277155319;书,-11.9371534443;抽,-7.36244246583;哭,-7.59334802248;國,-5.64743787342;奴,-6.59481919236;晶,-10.3277155319;賽,-11.2440062638;質,-9.99124329527;庆,-11.2440062638;守,-8.47141754153;脏,-10.5508590832;丑,-11.2440062638;沒,-3.68757829433;蠕,-11.2440062638;则,-9.73992886699;尝,-10.8385411557;綜,-6.56187503665;够,-9.37220408687;急,-7.41536486728;憤,-10.3277155319;货,-5.50260692554;讨,-8.71827761946;縱,-11.2440062638;船,-10.3277155319;千,-7.49450218784;酷,-11.2440062638;细,-7.76276617443;婉,-9.04678168643;运,-6.59004591361;雖,-10.5508590832;牙,-11.9371534443;变,-6.52105304212;竞,-8.71827761946;荣,-11.2440062638;詩,-9.63456835134;狮,-10.8385411557;批,-9.10394010027;轻,-8.60494893415;惺,-9.37220408687;西,-8.08700584262;禁,-10.8385411557;待,-10.3277155319;閉,-7.87671043378;合,-6.48183232897;耐,-7.53043419707;枕,-11.2440062638;外,-8.2735917982;鮮,-9.45224679454;欢,-8.08700584262;两,-6.92651815023;未,-8.99271446516;箭,-11.9371534443;熱,-6.28466426406;嘴,-10.1453939751;永,-7.81001905928;放,-6.58529531085;私,-9.53925817153;魂,-9.04678168643;必,-5.53689599902;勇,-10.3277155319;荒,-8.71827761946;奖,-11.2440062638;滥,-8.84611099097;啞,-10.1453939751;賣,-7.91180175359;止,-9.37220408687;迥,-10.5508590832;拧,-9.53925817153;腦,-7.70304693973;早,-9.45224679454;士,-9.29809611471;马,-8.13049095456;黯,-8.8016592284;蒼,-9.63456835134;獲,-9.10394010027;噴,-9.73992886699;扼,-10.8385411557;庄,-11.9371534443;切,-6.86824924211;针,-8.32623553169;栋,-10.8385411557;踏,-10.8385411557;脑,-7.70304693973;排,-8.2995672846;首,-9.16456472209;紙,-10.1453939751;氣,-8.10851204784;交,-5.65301928326;枪,-11.2440062638;草,-6.78386184983;厲,-10.8385411557;嚴,-8.60494893415;费,-8.10851204784;总,-7.07734103997;蘿,-10.5508590832;寂,-10.5508590832;组,-4.537755361;則,-9.73992886699;准,-9.63456835134;哈,-5.84358367428;乏,-8.67905690631;插,-10.1453939751;穗,-7.96686153078;令,-5.75506853761;执,-8.35363450587;填,-11.9371534443;差,-4.55752129172;共,-6.18776045842;史,-9.85771190265;直,-7.16646881986;拼,-7.437343774;率,-10.5508590832;逆,-10.8385411557;钉,-8.2995672846;锈,-9.10394010027;見,-6.79548988783;舒,-8.89263100661;算,-7.02449855859;军,-6.49041607266;猜,-10.8385411557;吞,-8.84611099097;伤,-8.47141754153;控,-9.99124329527;怦,-8.84611099097;第,-5.70864244074;油,-7.32203292749;为,-5.57240268748;羞,-10.3277155319;壁,-9.53925817153;構,-6.62394746529;漏,-8.99271446516;饥,-8.64131657832;勝,-7.91180175359;費,-8.10851204784;裡,-8.99271446516;以,-6.02907050616;潤,-11.9371534443;蕨,-7.9298202591;竭,-8.99271446516;僱,-7.0026795112;夾,-8.75909961398;骂,-8.60494893415;吉,-9.04678168643;伏,-11.2440062638;蔓,-11.9371534443;初,-6.33503462345;土,-6.34244206473;责,-10.8385411557;严,-8.60494893415;夫,-11.9371534443;粮,-6.09942299716;週,-8.41079291971;闲,-8.17595332864;真,-6.8495571091;人,-4.39759461503;秀,-11.9371534443;鹅,-11.2440062638;升,-7.48280614808;囊,-9.53925817153;拒,-8.06595243342;晕,-11.2440062638;柔,-8.75909961398;绚,-11.2440062638;捧,-9.16456472209;寬,-9.16456472209;齒,-9.99124329527;避,-10.8385411557;歷,-7.67447356729;宁,-11.2440062638;稀,-7.20095499593;射,-10.5508590832;成,-6.62888574693;龙,-10.5508590832;力,-8.71827761946;霞,-10.5508590832;计,-6.0936090273;违,-7.19222131597;到,-5.66805716062;儲,-8.94142117078;游,-8.47141754153;膽,-8.75909961398;撿,-10.5508590832;黃,-7.11687187872;槍,-11.2440062638;行,-7.37280525286;低,-8.15296381041;忙,-9.37220408687;凝,-10.3277155319;停,-9.85771190265;非,-6.73865641306;代,-7.91180175359;硬,-6.62394746529;置,-8.99271446516;布,-8.53595606267;如,-5.94568889722;紅,-7.14136289873;历,-7.67447356729;植,-7.1331323996;挑,-8.75909961398;易,-8.8016592284;頗,-8.17595332864;爛,-10.5508590832;次,-10.1453939751;誠,-7.70304693973;败,-10.5508590832;性,-10.3277155319;微,-6.11707051398;阳,-9.63456835134;冲,-9.73992886699;电,-6.03725609075;益,-8.75909961398;假,-8.32623553169;传,-7.70304693973;橋,-10.5508590832;迎,-7.89410217649;默,-7.22762324302;牛,-8.8016592284;線,-7.58044461764;歡,-8.08700584262;饭,-11.9371534443;鹼,-8.2995672846;狰,-11.2440062638;處,-8.47141754153;頂,-9.63456835134;爆,-10.8385411557;残,-8.67905690631;吊,-8.53595606267;与,-6.76100371176;抑,-9.63456835134;怒,-9.99124329527;撕,-7.73246082494;尚,-10.3277155319;欠,-9.99124329527;贤,-9.85771190265;木,-8.06595243342;宫,-8.8016592284;帮,-9.99124329527;進,-11.9371534443;輸,-7.82627958016;显,-9.45224679454;心,-6.38032538263;變,-6.52105304212;組,-4.537755361;毋,-7.25502221721;告,-6.74419659344;捐,-9.63456835134;癞,-10.1453939751;泥,-9.85771190265;赤,-10.1453939751;杨,-11.9371534443;石,-10.8385411557;決,-9.99124329527;能,-8.10851204784;威,-10.3277155319;简,-6.79548988783;弃,-9.10394010027;雪,-11.2440062638;于,-8.67905690631;我,-9.37220408687;逝,-10.8385411557;农,-5.87803024875;生,-4.25928994365;模,-7.73246082494;頭,-7.31218063105;馬,-8.13049095456;累,-9.85771190265;爱,-8.32623553169;现,-11.2440062638;傲,-10.1453939751;鐵,-8.44064588286;丹,-11.9371534443;政,-6.76100371176;節,-7.85961600042;居,-6.71679761925;从,-5.6400441244;扑,-7.9298202591;提,-9.73992886699;套,-8.75909961398;翘,-11.2440062638;啟,-7.25502221721;回,-8.71827761946;橡,-11.9371534443;慧,-11.2440062638;苦,-9.22910324323;痴,-10.8385411557;聽,-9.53925817153;异,-8.06595243342;踌,-10.1453939751;妙,-11.9371534443;領,-7.2458055621;功,-7.91180175359;漢,-10.8385411557;徭,-11.2440062638;傳,-7.70304693973;核,-7.22762324302;欺,-9.73992886699;昼,-8.56985761434;雇,-7.0026795112;商,-6.02907050616;半,-6.98132638673;魚,-8.89263100661;煞,-7.85961600042;淡,-9.73992886699;奮,-8.35363450587;价,-6.62888574693;拿,-7.61966533079;腾,-8.67905690631;恪,-8.8016592284;骄,-9.73992886699;鄉,-8.2735917982;二,-6.39981917731;撐,-10.8385411557;礙,-10.1453939751;君,-6.83728701651;定,-6.63384853627;負,-8.99271446516;誤,-9.29809611471;您,-6.74976763849;措,-11.9371534443;由,-6.08208152213;環,-7.89410217649;殺,-7.59334802248;膾,-11.9371534443;魅,-11.9371534443;光,-6.81318946493;烈,-10.8385411557;位,-9.37220408687;救,-7.28319309417;苔,-8.08700584262;飘,-9.37220408687;野,-10.3277155319;盜,-9.73992886699;牟,-8.2735917982;賠,-8.2995672846;衣,-8.17595332864;步,-8.60494893415;鍵,-8.75909961398;裸,-7.12496908896;摻,-10.8385411557;承,-10.5508590832;岁,-10.3277155319;紀,-9.22910324323;市,-7.04680431611;理,-8.04533314622;躍,-10.5508590832;撑,-10.8385411557;投,-9.53925817153;得,-7.61966533079;尖,-8.8016592284;餘,-9.53925817153;稚,-10.3277155319;原,-5.7265533673;逞,-9.22910324323;没,-3.68757829433;丢,-8.47141754153;肩,-8.56985761434;田,-7.84280888211;决,-9.99124329527;防,-6.72766729149;猴,-9.85771190265;先,-9.53925817153;削,-10.1453939751;軍,-6.49041607266;每,-7.98590972575;志,-10.5508590832;痛,-8.47141754153;婚,-8.99271446516;靜,-7.28319309417;遞,-9.53925817153;泡,-8.50316623984;解,-8.04533314622;此,-7.59334802248;惩,-10.3277155319;慨,-10.8385411557;确,-8.99271446516;異,-8.06595243342;迷,-7.60642010404;藻,-8.47141754153;封,-5.42096036829;证,-8.99271446516;咆,-9.63456835134;选,-9.45224679454;洋,-10.8385411557;不,-3.31200311141;溢,-8.2735917982;膨,-8.2995672846;紫,-8.8016592284;攻,-9.85771190265;肾,-7.04680431611;乍,-9.63456835134;罗,-8.8016592284;糖,-9.37220408687;秘,-9.85771190265;象,-7.82627958016;擦,-7.49450218784;臨,-9.85771190265;壮,-9.45224679454;关,-8.67905690631;酒,-9.37220408687;牵,-9.73992886699;觸,-9.22910324323;虽,-10.5508590832;窃,-9.73992886699;圆,-6.96734014475;玉,-9.53925817153;事,-4.08782962629;抓,-10.8385411557;粗,-8.99271446516;编,-8.41079291971;多,-5.70667199675;喝,-8.56985761434;苛,-10.5508590832;财,-8.75909961398;掩,-9.99124329527;針,-8.32623553169;颯,-10.1453939751;嘰,-11.9371534443;劳,-5.72454734858;甲,-6.52998167287;買,-9.29809611471;哇,-10.8385411557;滋,-10.1453939751;联,-5.89689873305;盛,-8.0251304389;呜,-7.67447356729;烟,-8.44064588286;信,-9.37220408687;菩,-8.75909961398;壯,-9.45224679454;陰,-7.7474987023;惰,-11.2440062638;预,-10.3277155319;劈,-9.16456472209;下,-5.50904817164;貌,-10.1453939751;险,-8.94142117078;借,-7.51831283653;師,-11.2440062638;宮,-8.8016592284;疲,-7.66048732531;谷,-8.99271446516;鏈,-8.17595332864;撼,-10.8385411557;耿,-10.8385411557;飄,-9.37220408687;村,-8.89263100661;打,-5.98391011004;慕,-9.45224679454;高,-5.29076292948;煽,-9.10394010027;幫,-9.99124329527;自,-3.80532865932;顯,-9.45224679454;困,-8.13049095456;嗲,-9.53925817153;兵,-7.49450218784;諸,-7.58044461764;开,-5.87104535423;处,-8.47141754153;規,-7.3024244561;討,-8.71827761946;熟,-9.22910324323;亡,-10.5508590832;漠,-10.8385411557;魔,-11.9371534443;挨,-10.5508590832;怪,-7.89410217649;種,-7.85961600042;隱,-7.82627958016;地,-6.91987360751;債,-11.2440062638;层,-9.85771190265;奄,-10.3277155319;陆,-8.04533314622;遊,-8.47141754153;摒,-11.9371534443;腔,-8.47141754153;站,-8.06595243342;存,-11.2440062638;營,-8.17595332864;满,-6.37647181331;你,-5.82568610483;旧,-9.85771190265;择,-9.99124329527;快,-9.99124329527;聪,-9.37220408687;积,-7.89410217649;剩,-3.91294595855;兴,-7.48280614808;混,-8.0251304389;歸,-7.73246082494;找,-11.9371534443;堅,-10.8385411557;唇,-9.29809611471;炊,-10.8385411557;撒,-8.0251304389;崗,-11.2440062638;纖,-8.0251304389;官,-7.50633664549;喜,-8.67905690631;推,-9.73992886699;窮,-9.22910324323;樹,-9.29809611471;遵,-8.60494893415;落,-7.48280614808;於,-8.67905690631;繁,-9.16456472209;起,-8.94142117078;集,-7.12496908896;又,-7.4485170746;跌,-7.98590972575;擒,-8.94142117078;恕,-10.8385411557;廖,-11.2440062638;坛,-9.29809611471;關,-8.67905690631;勞,-5.72454734858;乡,-8.2735917982;正,-7.4485170746;波,-7.3024244561;桥,-10.5508590832;扩,-8.8016592284;即,-10.3277155319;偵,-8.89263100661;海,-6.73865641306;诸,-7.58044461764;拾,-8.99271446516;孔,-9.16456472209;
+B,mq:十,-4.91746489982;一,-2.40383096039;千,-6.54343211421;半,-6.15665913911;万,-5.82288595946;陆,-7.92972647533;三,-1.09717378446;上,-7.92972647533;二,-6.19512541994;双,-9.4338038721;少,-8.74065669154;成,-10.1269510527;百,-7.35436233042;五,-5.15713775309;這,-1.07186196596;这,-1.07186196596;臘,-8.33519158343;四,-1.97446497688;多,-6.57160299117;几,-7.18251207349;正,-7.82436595967;那,-2.96455355531;此,-5.08352593574;八,-7.18251207349;哪,-5.39956323395;六,-8.51751314023;第,-10.1269510527;雙,-9.4338038721;腊,-8.33519158343;零,-5.30666948706;陸,-7.92972647533;拾,-8.33519158343;好,-10.1269510527;萬,-5.82288595946;幾,-7.18251207349;
+B,m:极,-8.5474140678;一,-0.92069372263;市,-11.6883283512;纳,-9.41106106619;億,-3.2753296888;倆,-8.64380591347;韩,-13.7677698929;見,-9.15264937604;上,-8.32535218236;同,-11.2028205354;萬,-3.15957721095;余,-5.34907194821;百,-5.07243051608;挂,-13.7677698929;世,-10.1042082467;餘,-5.34907194821;些,-8.63787117795;多,-3.32070883012;條,-13.7677698929;诸,-6.82851594684;許,-4.12707669729;两,-2.71877056259;整,-7.09194667124;贰,-10.0541978262;輩,-12.6691576042;个,-10.0788904388;第,-2.7107084936;有,-8.16934793388;澳,-10.3020339901;甲,-8.32969058395;場,-13.7677698929;辈,-12.6691576042;点,-10.548894068;马,-10.6767274395;场,-13.7677698929;亿,-3.2753296888;眾,-5.7031334171;叁,-11.8218597438;裡,-11.6883283512;埃,-13.7677698929;层,-10.1568519802;摄,-9.04927102158;无,-6.44196239028;伍,-9.96110740311;立,-8.96374884814;半,-4.5121693895;捌,-13.0746227123;华,-13.0746227123;里,-11.6883283512;韓,-13.7677698929;法,-10.0788904388;雙,-6.02363326525;若,-6.10061163756;四,-4.15143122163;坚,-13.7677698929;绝,-6.2595311182;仟,-12.3814755318;辛,-8.95558553751;凡,-12.1583319804;日,-8.78416327117;層,-10.1568519802;週,-7.37752922581;成,-10.3337826884;俩,-8.64380591347;全,-4.70871763512;毫,-5.48908772991;公,-5.90219813519;華,-13.0746227123;己,-10.2124218314;佰,-13.0746227123;絲,-7.1397285167;便,-8.37869816306;见,-9.15264937604;周,-7.37752922581;壹,-10.4719330269;數,-4.8497891829;系,-7.66521129826;廿,-9.49110377386;幾,-3.19315073384;丁,-9.8165261743;英,-7.61079090729;七,-5.13796255709;堅,-13.7677698929;列,-12.6691576042;万,-3.15957721095;辆,-13.0746227123;三,-3.26486908253;很,-4.76605398612;個,-10.0788904388;首,-4.65868735298;不,-4.60242688683;二,-3.94978576396;小,-9.06728952709;美,-5.13796255709;少,-5.38616735577;終,-7.7251370592;癸,-10.2712623314;五,-4.27820813937;众,-5.7031334171;玖,-11.9760104236;丙,-10.1568519802;厘,-6.3837804349;輛,-13.0746227123;庚,-9.59338262298;丝,-7.1397285167;掛,-13.7677698929;組,-13.7677698929;無,-6.44196239028;加,-10.2414093683;肚,-13.7677698929;大,-3.89727051617;兰,-13.7677698929;天,-13.7677698929;攝,-9.04927102158;蘭,-13.7677698929;馬,-10.6767274395;港,-7.11361737269;微,-8.73081729046;分,-6.37204828428;架,-10.9951811706;戊,-9.91762229117;许,-4.12707669729;人,-9.34892928508;年,-8.92358280642;十,-3.59635664626;千,-4.4022222566;卅,-11.3698746201;组,-13.7677698929;片,-6.45055748452;光,-9.6568960287;终,-7.7251370592;克,-10.8233309137;双,-6.02363326525;對,-11.0597196918;盎,-10.9345565488;对,-11.0597196918;柒,-11.9760104236;絕,-6.2595311182;比,-11.5705453155;拖,-13.7677698929;乙,-10.2414093683;姚,-9.42396447102;九,-5.52949726824;點,-10.548894068;条,-13.7677698929;几,-3.19315073384;納,-9.41106106619;貳,-10.0541978262;左,-4.43317855856;兩,-2.71877056259;仨,-11.1287125633;八,-5.15635802622;六,-4.97887158353;壬,-9.62463516649;良,-8.32969058395;台,-13.0746227123;平,-7.03080293488;極,-8.5474140678;海,-8.44475991374;零,-7.8900341111;批,-11.9760104236;諸,-6.82851594684;出,-8.73733197149;好,-6.08023112668;数,-4.8497891829;
+B,nrfg:羅,-6.56037764019;趙,-4.89122049305;鐘,-8.71986188954;贞,-5.42402502354;錢,-6.45117834822;薩,-8.71986188954;萨,-8.71986188954;方,-6.38448697372;永,-5.81114099298;放,-4.47136664749;苇,-9.81847417821;齊,-6.56037764019;经,-9.81847417821;金,-3.41655698148;乔,-7.42057890541;苗,-8.71986188954;祖,-5.7409367343;卢,-6.48626966803;周,-4.64799018317;马,-4.47136664749;慶,-9.12532699765;滿,-9.81847417821;庄,-5.44902632574;沈,-8.20903626578;羊,-9.81847417821;应,-8.20903626578;龚,-9.81847417821;謝,-5.30761467169;單,-9.12532699765;吳,-4.98219227126;厲,-8.02671470898;張,-2.54468786036;嚴,-6.64042034786;费,-9.12532699765;祁,-9.81847417821;黄,-4.7247239774;則,-8.02671470898;賈,-6.5226373122;晏,-9.81847417821;何,-6.41727679655;董,-6.77395174049;彥,-7.62124960087;令,-8.43217981709;秦,-6.56037764019;火,-9.12532699765;景,-9.81847417821;史,-8.71986188954;梁,-5.50098606467;古,-7.73903263653;經,-9.81847417821;舒,-9.81847417821;蒙,-6.15491253208;侯,-8.71986188954;朴,-8.71986188954;连,-5.23350669954;瞿,-6.48626966803;郁,-7.33356752842;郑,-3.58406345249;卜,-8.43217981709;迟,-9.81847417821;胡,-4.31314264228;向,-6.1049021115;寧,-4.63669062792;翦,-6.64042034786;柯,-7.51588908522;聶,-6.03428454429;贾,-6.5226373122;老,-5.31866450788;树,-9.81847417821;龔,-9.81847417821;肖,-8.71986188954;愛,-9.81847417821;貞,-5.42402502354;蔣,-6.98526083415;严,-6.64042034786;欧,-5.86723045963;陳,-3.86004948518;週,-4.64799018317;申,-9.12532699765;尹,-9.81847417821;葉,-7.04588545597;富,-6.87403519904;桑,-8.43217981709;字,-9.81847417821;郦,-8.43217981709;雪,-9.81847417821;建,-5.98983278172;宁,-4.63669062792;刀,-8.71986188954;肇,-9.81847417821;成,-7.73903263653;鄒,-6.45117834822;龙,-5.90645117278;傅,-7.11042397711;力,-7.87256402915;钟,-8.71986188954;管,-9.12532699765;尤,-7.73903263653;洪,-6.92810242031;琴,-9.81847417821;边,-9.12532699765;常,-6.92810242031;贺,-5.9266538801;宋,-4.75587914518;黃,-4.7247239774;陈,-3.86004948518;立,-8.20903626578;行,-9.12532699765;李,-1.19206790182;阎,-7.62124960087;代,-9.81847417821;汤,-7.42057890541;学,-7.33356752842;韩,-4.58736556135;陸,-9.81847417821;程,-7.33356752842;小,-8.71986188954;易,-6.92810242031;鸣,-9.12532699765;鄭,-3.58406345249;鬱,-7.33356752842;汉,-7.33356752842;龐,-9.81847417821;余,-5.25412598674;牛,-9.81847417821;祝,-7.73903263653;江,-4.86264712061;俞,-9.12532699765;章,-7.42057890541;顧,-6.77395174049;六,-9.12532699765;平,-9.81847417821;赵,-4.89122049305;鳴,-9.12532699765;叶,-7.04588545597;南,-9.12532699765;王,-3.35856972383;明,-8.02671470898;崔,-9.12532699765;茅,-8.71986188954;尚,-7.42057890541;额,-5.0910863595;蘇,-6.01181168844;莫,-7.33356752842;阮,-9.81847417821;花,-6.1049021115;區,-3.37434292151;聂,-6.03428454429;资,-9.81847417821;穆,-8.43217981709;霍,-8.71986188954;虎,-9.81847417821;子,-9.12532699765;韓,-4.58736556135;潘,-6.98526083415;毛,-8.43217981709;郝,-9.81847417821;虞,-7.87256402915;臧,-7.73903263653;杨,-4.30504543204;汪,-6.38448697372;郭,-7.25352482075;英,-9.12532699765;石,-6.82274190466;遲,-9.81847417821;曹,-6.32196661674;都,-9.12532699765;楼,-8.71986188954;刁,-9.12532699765;简,-8.43217981709;薄,-7.04588545597;荀,-9.81847417821;于,-4.14172037594;桂,-8.71986188954;庞,-9.81847417821;鄧,-6.87403519904;馬,-4.47136664749;爱,-9.81847417821;鐵,-9.81847417821;冼,-8.02671470898;額,-5.0910863595;凌,-8.71986188954;黎,-9.81847417821;展,-7.62124960087;乙,-7.73903263653;姜,-8.20903626578;回,-8.43217981709;歐,-5.86723045963;孫,-4.30504543204;姬,-9.81847417821;惲,-9.81847417821;恽,-9.81847417821;长,-7.25352482075;曾,-6.18088801848;皇,-9.81847417821;蒋,-6.98526083415;龍,-5.90645117278;邓,-6.87403519904;香,-9.81847417821;馮,-6.98526083415;东,-6.82274190466;漢,-7.33356752842;安,-6.77395174049;段,-8.71986188954;戴,-7.17941684859;康,-4.73087784298;費,-9.12532699765;区,-3.37434292151;仇,-9.81847417821;應,-8.20903626578;蓋,-7.62124960087;苏,-6.01181168844;毕,-8.20903626578;譚,-7.17941684859;保,-6.01181168844;盧,-6.48626966803;浦,-9.12532699765;司,-6.48626966803;包,-8.43217981709;万,-7.73903263653;莊,-5.44902632574;伍,-9.81847417821;蔡,-8.43217981709;連,-5.23350669954;天,-7.33356752842;柳,-6.23495523975;榮,-8.71986188954;由,-8.71986188954;哈,-9.81847417821;賀,-5.9266538801;光,-8.02671470898;習,-6.98526083415;单,-9.12532699765;葛,-8.20903626578;牟,-9.12532699765;左,-5.52801473706;杭,-6.56037764019;时,-3.89421838079;曼,-7.62124960087;鲁,-5.21330399222;岑,-8.43217981709;唐,-6.72743172485;林,-4.54035951898;餘,-5.25412598674;戚,-9.12532699765;钱,-6.45117834822;田,-4.89849325238;德,-9.81847417821;邹,-6.45117834822;閻,-7.62124960087;弼,-9.81847417821;吴,-4.98219227126;铁,-9.81847417821;時,-3.89421838079;酈,-8.43217981709;孔,-4.76861817096;志,-7.62124960087;杜,-6.56037764019;聞,-6.41727679655;解,-8.20903626578;葦,-9.81847417821;華,-5.88664854548;闻,-6.41727679655;顾,-6.77395174049;彭,-9.12532699765;少,-9.81847417821;湯,-7.42057890541;簡,-8.43217981709;席,-9.81847417821;就,-5.32983780848;新,-8.20903626578;範,-5.70760031404;魏,-8.71986188954;罗,-6.56037764019;孟,-9.12532699765;大,-9.81847417821;魯,-5.21330399222;关,-6.38448697372;项,-9.81847417821;竺,-9.81847417821;白,-5.72412961599;袁,-6.98526083415;厉,-8.02671470898;戈,-9.81847417821;刘,-3.41489998027;許,-6.38448697372;萬,-7.73903263653;甲,-9.81847417821;樸,-8.71986188954;施,-6.64042034786;資,-9.81847417821;介,-8.71986188954;楊,-4.30504543204;藍,-9.81847417821;华,-5.88664854548;盛,-6.82274190466;楚,-9.81847417821;习,-6.98526083415;畢,-8.20903626578;彦,-7.62124960087;武,-8.02671470898;任,-4.64799018317;樓,-8.71986188954;萧,-6.59959835334;朱,-4.9981926126;耿,-9.12532699765;孙,-4.30504543204;高,-4.29302123908;姚,-6.48626966803;祥,-7.11042397711;韦,-9.81847417821;蕭,-6.59959835334;東,-6.82274190466;裴,-8.71986188954;諸,-8.71986188954;梅,-9.12532699765;文,-5.75803116766;劉,-3.41489998027;福,-8.02671470898;辛,-9.12532699765;张,-2.54468786036;谢,-5.30761467169;倪,-9.81847417821;冯,-6.98526083415;邵,-8.71986188954;陆,-9.81847417821;韋,-9.81847417821;季,-8.71986188954;齐,-6.56037764019;存,-9.81847417821;蓝,-9.81847417821;满,-9.81847417821;陶,-7.25352482075;學,-7.33356752842;艾,-7.42057890541;丁,-7.51588908522;范,-5.70760031404;項,-9.81847417821;庆,-9.12532699765;邊,-9.12532699765;夏,-7.73903263653;徐,-5.02268363261;则,-8.02671470898;鞠,-9.12532699765;谭,-7.17941684859;喬,-7.42057890541;樹,-9.81847417821;许,-6.38448697372;於,-4.14172037594;海,-7.87256402915;盖,-7.62124960087;關,-6.38448697372;荣,-8.71986188954;長,-7.25352482075;詹,-6.41727679655;诸,-8.71986188954;
+B,nrt:怀,-7.43275390264;沃,-6.95733020593;茂,-7.52372568085;羅,-5.13890248962;誇,-4.92103599541;合,-9.46963582991;伊,-4.89149431631;琴,-8.26566302558;织,-10.5682481186;耐,-9.6519573867;外,-9.0641707218;趙,-9.31548515008;谘,-11.2613952991;顺,-5.77245757298;会,-8.00329876111;宝,-5.51200231323;娜,-6.81874404264;麟,-9.46963582991;洞,-9.46963582991;錢,-7.52372568085;两,-10.5682481186;银,-9.31548515008;涩,-9.87510093801;氨,-9.87510093801;未,-8.1259010832;靜,-9.0641707218;熱,-7.67787636068;岳,-9.6519573867;茲,-7.10251221577;临,-6.81874404264;須,-11.2613952991;方,-10.1627830105;永,-7.2183440313;派,-8.21687286141;裡,-4.95512001219;必,-9.87510093801;湄,-10.1627830105;楠,-11.2613952991;融,-10.5682481186;齊,-8.95881020614;珍,-8.31695631997;寶,-5.51200231323;科,-5.03881903106;茹,-8.69644594167;蓓,-10.5682481186;荒,-10.1627830105;乔,-6.666275449;閩,-9.87510093801;祖,-9.18195375745;飛,-10.1627830105;坚,-10.1627830105;赞,-7.31015158055;凡,-8.48880657689;遠,-9.31548515008;禦,-6.90468647244;卢,-7.08700802924;查,-6.01437122697;鹤,-8.62233796952;早,-11.2613952991;周,-7.65047738649;士,-9.46963582991;坪,-9.46963582991;揭,-11.2613952991;扬,-9.31548515008;凱,-5.26245873719;恰,-11.2613952991;鳳,-8.62233796952;獲,-9.31548515008;晴,-10.1627830105;席,-9.0641707218;淹,-9.6519573867;绿,-6.80704800288;濾,-10.5682481186;炀,-6.57926407201;切,-6.85467605187;雅,-5.96307793259;香,-7.15052143496;莒,-9.46963582991;五,-5.63377418544;列,-6.25744899319;妖,-11.2613952991;错,-8.86350002634;衮,-11.2613952991;謝,-7.45473280936;沛,-10.1627830105;星,-10.1627830105;涞,-10.1627830105;滤,-10.5682481186;弥,-10.1627830105;交,-9.6519573867;異,-11.2613952991;倫,-7.08700802924;芬,-6.78405848466;吳,-11.2613952991;色,-8.48880657689;張,-9.0641707218;隴,-8.55334509803;紹,-8.86350002634;欽,-8.77648864935;蘿,-9.87510093801;翠,-11.2613952991;片,-11.2613952991;姆,-7.54782323243;蕉,-8.95881020614;哈,-4.44028782688;俊,-11.2613952991;契,-9.87510093801;磐,-9.6519573867;何,-8.95881020614;仔,-9.6519573867;教,-10.1627830105;衛,-7.45473280936;孝,-7.18385785523;拜,-6.84255469134;惠,-8.62233796952;黄,-9.18195375745;王,-9.18195375745;来,-9.18195375745;令,-3.40934509187;秦,-7.73503477452;嵩,-10.5682481186;迪,-6.79548718048;独,-9.46963582991;湯,-8.42818195508;差,-9.87510093801;薩,-5.89541928411;米,-5.23071003887;史,-8.31695631997;直,-8.86350002634;萨,-5.89541928411;泸,-7.50019518344;须,-11.2613952991;基,-5.67040831862;鋼,-8.86350002634;广,-7.43275390264;梁,-7.82740809465;樂,-7.65047738649;宇,-10.1627830105;門,-7.32956966641;上,-6.09660932521;劍,-11.2613952991;后,-7.92919078896;傑,-6.65622511315;缪,-9.46963582991;舒,-8.00329876111;井,-8.42818195508;宗,-10.5682481186;默,-6.93066195885;沙,-6.70751840753;甘,-6.31263540876;龟,-10.1627830105;澄,-9.0641707218;麥,-6.13743131973;岩,-8.62233796952;豪,-6.01437122697;昌,-8.04251947427;河,-7.67787636068;侯,-7.50019518344;铜,-6.59795620502;足,-11.2613952991;露,-8.42818195508;朴,-8.77648864935;殷,-10.5682481186;妈,-11.2613952991;为,-5.94818932009;媽,-11.2613952991;石,-10.5682481186;吾,-10.5682481186;维,-5.27243388224;計,-10.5682481186;恆,-9.46963582991;始,-7.86019791747;苍,-7.82740809465;歌,-6.63642248585;柏,-11.2613952991;芳,-11.2613952991;毗,-7.20095228859;聖,-6.13149658421;奥,-5.01917203368;富,-6.71810051686;费,-5.78075637579;費,-5.78075637579;濟,-8.26566302558;瑞,-6.37859337655;胡,-9.6519573867;少,-8.69644594167;溫,-7.41124769742;绥,-8.21687286141;坤,-11.2613952991;寧,-8.04251947427;桦,-9.0641707218;辽,-7.73503477452;韦,-6.97093585799;闖,-2.77672529942;細,-8.86350002634;柯,-8.26566302558;兰,-5.58807203196;淳,-7.62380913941;割,-7.597833653;順,-5.77245757298;桶,-10.1627830105;數,-9.6519573867;贾,-9.0641707218;老,-7.29110338558;清,-6.89194744667;朗,-6.78405848466;吉,-5.12799725614;舍,-7.36957500102;完,-7.2360436084;邁,-5.93351913034;钱,-7.52372568085;杭,-9.87510093801;帕,-6.41720821268;北,-7.15052143496;肖,-9.46963582991;愛,-6.67642782046;亚,-4.78442293624;宜,-8.26566302558;土,-7.36957500102;怡,-9.87510093801;東,-7.18385785523;庚,-11.2613952991;春,-8.69644594167;澤,-7.50019518344;欧,-6.0909113041;梦,-7.79565939633;帝,-8.08334146879;夫,-7.41124769742;纪,-11.2613952991;陳,-9.6519573867;伯,-6.46560475354;龜,-10.1627830105;週,-7.65047738649;冰,-7.89409946915;申,-10.1627830105;阵,-8.1259010832;真,-7.43275390264;肅,-10.5682481186;爽,-9.6519573867;鹽,-8.21687286141;精,-8.55334509803;秀,-10.1627830105;久,-8.95881020614;升,-6.98472918012;汉,-5.89075727101;克,-4.56066418959;今,-9.6519573867;前,-8.31695631997;双,-8.95881020614;塑,-10.1627830105;勒,-6.14340148672;皆,-11.2613952991;柔,-7.82740809465;南,-5.0959774449;僖,-8.26566302558;瑙,-9.0641707218;慧,-6.50780510803;济,-8.26566302558;束,-9.46963582991;衡,-9.46963582991;金,-5.90953716566;淺,-8.62233796952;摩,-5.43834940365;巨,-8.37102354124;八,-11.2613952991;邦,-7.79565939633;賓,-8.69644594167;蓮,-7.32956966641;称,-9.18195375745;青,-8.21687286141;柴,-9.31548515008;捷,-10.5682481186;养,-9.87510093801;固,-9.31548515008;秋,-8.26566302558;紫,-8.55334509803;板,-8.1259010832;織,-10.5682481186;宁,-8.04251947427;涅,-8.95881020614;射,-11.2613952991;肇,-8.69644594167;辉,-9.46963582991;师,-10.5682481186;贊,-7.31015158055;再,-6.98472918012;而,-7.50019518344;鮑,-9.31548515008;成,-8.17035284578;库,-5.23071003887;褒,-9.87510093801;尔,-5.67414664073;化,-7.86019791747;龙,-6.7615856288;丘,-9.46963582991;力,-9.0641707218;沟,-7.2540621139;採,-8.77648864935;纣,-7.2540621139;夢,-7.79565939633;尤,-7.45473280936;錦,-8.69644594167;義,-9.18195375745;莱,-5.22591386661;纳,-6.46560475354;吴,-11.2613952991;常,-9.31548515008;格,-5.25504213953;所,-7.62380913941;黃,-9.18195375745;萊,-5.22591386661;荆,-10.5682481186;陈,-9.6519573867;立,-7.41124769742;嵊,-8.77648864935;重,-9.0641707218;彩,-8.55334509803;坎,-6.3561205207;仓,-11.2613952991;换,-5.90953716566;綏,-8.21687286141;棗,-8.26566302558;策,-11.2613952991;黛,-11.2613952991;鷹,-10.1627830105;明,-7.597833653;钢,-8.86350002634;非,-6.63642248585;鏡,-10.5682481186;代,-8.31695631997;日,-6.30556824153;汤,-8.42818195508;学,-9.18195375745;韩,-9.0641707218;浦,-9.0641707218;潮,-8.86350002634;汴,-7.01290005708;培,-9.87510093801;鹰,-10.1627830105;遼,-7.73503477452;松,-7.39019428823;銀,-9.31548515008;布,-4.6724688216;荣,-11.2613952991;历,-9.18195375745;班,-7.62380913941;越,-9.31548515008;植,-10.1627830105;碌,-9.31548515008;小,-5.74796655297;美,-7.62380913941;易,-10.5682481186;沔,-7.597833653;鎖,-9.6519573867;觉,-8.31695631997;玛,-6.14340148672;次,-11.2613952991;加,-5.35876196573;鸣,-8.86350002634;津,-10.1627830105;亨,-4.75860525322;别,-7.73503477452;涪,-8.42818195508;启,-9.0641707218;葉,-7.92919078896;阳,-7.597833653;憲,-7.08700802924;电,-9.46963582991;貴,-7.79565939633;家,-8.37102354124;刻,-9.31548515008;达,-4.38616321186;囊,-10.5682481186;浅,-8.62233796952;雷,-6.85467605187;密,-7.79565939633;杉,-10.5682481186;橋,-9.6519573867;慶,-9.6519573867;邓,-9.87510093801;城,-8.95881020614;勐,-9.46963582991;晓,-10.1627830105;余,-8.37102354124;盘,-7.79565939633;牛,-8.86350002634;风,-11.2613952991;江,-6.81874404264;连,-7.32956966641;卡,-4.83329002645;桑,-7.96555843313;陣,-8.1259010832;略,-10.1627830105;佩,-6.3487404134;橫,-9.87510093801;静,-9.0641707218;修,-8.69644594167;平,-7.39019428823;赵,-9.31548515008;措,-9.18195375745;顷,-8.86350002634;叶,-7.92919078896;役,-9.46963582991;滸,-9.46963582991;旺,-8.1259010832;莫,-6.09660932521;俾,-6.46560475354;堂,-9.31548515008;約,-4.90702525834;分,-9.31548515008;宋,-8.42818195508;尊,-10.5682481186;頃,-8.86350002634;疏,-9.87510093801;嘎,-10.1627830105;酒,-9.6519573867;优,-8.69644594167;宛,-8.69644594167;尚,-8.42818195508;额,-8.69644594167;夜,-9.18195375745;肌,-9.18195375745;花,-8.55334509803;枣,-8.26566302558;蘇,-7.01290005708;在,-6.33414161398;宫,-6.29855066887;梭,-8.62233796952;斯,-4.77981816986;抱,-10.5682481186;澳,-9.87510093801;冷,-8.95881020614;制,-8.62233796952;玻,-6.58856646467;埃,-5.99353714007;遂,-9.87510093801;资,-8.62233796952;采,-8.77648864935;婆,-7.11826057274;曉,-10.1627830105;霍,-7.15052143496;友,-9.6519573867;訶,-10.1627830105;藏,-8.1259010832;虎,-8.95881020614;子,-7.86019791747;韓,-9.0641707218;恒,-9.46963582991;法,-6.24411546232;仙,-11.2613952991;潘,-8.95881020614;換,-5.90953716566;哥,-7.86019791747;赤,-7.86019791747;燧,-10.1627830105;沐,-10.1627830105;杨,-11.2613952991;汪,-9.87510093801;热,-7.67787636068;公,-9.18195375745;路,-5.64826719275;普,-5.91906104717;英,-6.4573742544;印,-11.2613952991;柳,-7.57251584502;懷,-7.43275390264;门,-7.32956966641;能,-9.87510093801;楼,-11.2613952991;湾,-9.87510093801;威,-4.75860525322;雁,-8.42818195508;會,-8.00329876111;雪,-8.86350002634;薄,-11.2613952991;三,-4.96060950447;鋯,-8.77648864935;于,-8.26566302558;孚,-7.32956966641;求,-11.2613952991;吕,-8.77648864935;思,-7.96555843313;农,-9.6519573867;亞,-4.78442293624;圣,-6.13149658421;营,-11.2613952991;大,-4.92103599541;温,-7.41124769742;輝,-9.46963582991;錫,-8.86350002634;沪,-8.77648864935;冬,-7.65047738649;皮,-6.69704710767;爱,-6.67642782046;章,-10.5682481186;曲,-8.95881020614;鐵,-7.82740809465;鶴,-8.62233796952;愷,-11.2613952991;靈,-7.39019428823;丹,-7.2540621139;珀,-7.54782323243;居,-8.1259010832;歷,-9.18195375745;奇,-8.26566302558;义,-9.18195375745;迈,-5.93351913034;瓊,-6.20514949379;額,-8.69644594167;凌,-11.2613952991;界,-5.06903280966;剑,-11.2613952991;提,-8.26566302558;賴,-7.62380913941;留,-10.1627830105;啟,-9.0641707218;雞,-9.87510093801;建,-6.00912187109;藤,-7.82740809465;內,-6.23751477829;歐,-6.0909113041;陽,-7.597833653;卫,-7.45473280936;哪,-6.75053579262;姬,-11.2613952991;雙,-8.95881020614;台,-10.5682481186;葵,-9.18195375745;巴,-4.52918459267;阿,-3.61599759971;風,-11.2613952991;獻,-6.87936866446;郾,-7.29110338558;长,-4.95694649671;图,-5.42075364176;肃,-10.5682481186;异,-11.2613952991;襄,-7.597833653;锆,-8.77648864935;札,-9.31548515008;芒,-9.46963582991;希,-5.42075364176;骏,-11.2613952991;吐,-9.18195375745;梓,-8.31695631997;宕,-9.6519573867;麗,-7.76488773767;妙,-9.87510093801;瀘,-7.50019518344;岛,-10.1627830105;榮,-11.2613952991;依,-10.5682481186;东,-7.18385785523;那,-8.26566302558;漢,-5.89075727101;锦,-8.69644594167;瀨,-11.2613952991;琳,-6.33414161398;铁,-7.82740809465;玉,-8.17035284578;睚,-11.2613952991;莲,-7.32956966641;戴,-7.79565939633;康,-7.32956966641;興,-8.55334509803;熹,-8.17035284578;朵,-9.0641707218;治,-11.2613952991;羽,-9.87510093801;隋,-11.2613952991;汀,-9.31548515008;坂,-10.5682481186;滇,-6.40158289477;凉,-6.31975287652;蓋,-6.13149658421;荊,-10.5682481186;乌,-5.99353714007;苏,-7.01290005708;奎,-7.73503477452;淑,-9.6519573867;豐,-9.31548515008;归,-8.21687286141;毕,-10.5682481186;赖,-7.62380913941;塘,-11.2613952991;博,-6.4573742544;保,-5.49620419635;神,-11.2613952991;池,-8.31695631997;旧,-9.31548515008;盧,-7.08700802924;敦,-11.2613952991;比,-5.18375305578;迭,-9.18195375745;端,-9.31548515008;雲,-8.62233796952;深,-10.1627830105;鉴,-7.73503477452;廷,-9.31548515008;计,-10.5682481186;孺,-9.6519573867;拿,-9.87510093801;锁,-9.6519573867;考,-7.597833653;瑪,-6.14340148672;万,-7.07174055711;鄉,-10.5682481186;伍,-8.86350002634;二,-3.21196824202;煬,-6.57926407201;岐,-9.87510093801;頓,-10.1627830105;闯,-2.77672529942;君,-7.67787636068;定,-6.24411546232;朝,-10.1627830105;府,-8.1259010832;舟,-9.18195375745;雄,-11.2613952991;贡,-10.1627830105;連,-7.32956966641;天,-5.33981687949;墨,-7.01290005708;含,-9.6519573867;宪,-7.08700802924;圭,-9.87510093801;京,-8.86350002634;妮,-8.21687286141;洱,-8.95881020614;奉,-7.96555843313;農,-9.6519573867;粟,-11.2613952991;賈,-9.0641707218;伽,-7.15052143496;奴,-9.31548515008;理,-7.62380913941;管,-8.55334509803;達,-4.38616321186;菊,-10.1627830105;獅,-10.1627830105;狄,-11.2613952991;陇,-8.55334509803;光,-7.73503477452;珊,-9.6519573867;龍,-6.7615856288;野,-8.17035284578;道,-7.05670267974;索,-7.18385785523;歸,-8.21687286141;裘,-11.2613952991;揚,-9.31548515008;蒙,-6.93066195885;灣,-9.87510093801;恺,-11.2613952991;左,-8.48880657689;兩,-10.5682481186;賽,-7.57251584502;锡,-8.86350002634;彭,-9.31548515008;滬,-8.77648864935;良,-8.26566302558;泰,-6.08524556656;穆,-5.14329810109;时,-9.0641707218;兹,-7.10251221577;寺,-10.5682481186;鳴,-8.86350002634;曼,-7.47720566522;黔,-8.86350002634;鲁,-6.68668432063;紀,-11.2613952991;太,-4.72036529994;銅,-6.59795620502;将,-10.5682481186;開,-6.80704800288;舊,-9.31548515008;宏,-11.2613952991;唐,-6.97093585799;蒂,-6.72879580598;華,-6.55186509782;得,-10.5682481186;餘,-8.37102354124;溝,-7.2540621139;岡,-7.57251584502;素,-10.1627830105;芥,-8.62233796952;横,-9.87510093801;革,-9.46963582991;本,-6.97093585799;岱,-8.04251947427;嘉,-8.04251947427;德,-4.93883005921;夸,-4.92103599541;马,-4.94423061239;樺,-9.0641707218;纽,-7.597833653;水,-6.29158199956;品,-10.5682481186;時,-9.0641707218;育,-9.18195375745;買,-8.77648864935;雾,-11.2613952991;奈,-8.04251947427;绍,-8.86350002634;彌,-10.1627830105;孔,-8.95881020614;志,-8.21687286141;蘭,-5.58807203196;杜,-7.597833653;察,-7.50019518344;塞,-5.68166547315;若,-6.67642782046;钦,-8.77648864935;龐,-7.76488773767;全,-9.46963582991;鼓,-9.18195375745;可,-7.96555843313;琼,-6.20514949379;数,-9.6519573867;迷,-10.5682481186;汶,-9.46963582991;渝,-9.87510093801;国,-6.85467605187;彼,-5.6194882282;封,-10.1627830105;喀,-11.2613952991;厄,-7.79565939633;倉,-11.2613952991;冈,-7.57251584502;不,-6.71810051686;後,-7.92919078896;炎,-6.83057850029;向,-7.76488773767;斐,-9.6519573867;弗,-5.35603345108;洛,-5.35059865509;淮,-10.1627830105;丝,-7.86019791747;果,-8.37102354124;袞,-11.2613952991;綠,-6.80704800288;別,-7.73503477452;霧,-11.2613952991;諾,-4.57055302172;甫,-11.2613952991;努,-5.75200696251;中,-4.49290208749;木,-7.89409946915;錯,-8.86350002634;新,-5.07313117605;菲,-5.54766249362;鸿,-11.2613952991;根,-8.17035284578;鴻,-11.2613952991;庞,-7.76488773767;丽,-7.76488773767;墾,-9.18195375745;鸡,-9.87510093801;元,-7.50019518344;範,-11.2613952991;均,-11.2613952991;淶,-10.1627830105;魏,-7.08700802924;灌,-8.55334509803;鑑,-7.73503477452;腓,-6.05738861206;貢,-10.1627830105;叔,-9.6519573867;罗,-5.13890248962;鄧,-9.87510093801;赛,-7.57251584502;李,-10.1627830105;九,-10.5682481186;远,-9.31548515008;孟,-7.54782323243;飞,-10.1627830105;象,-8.77648864935;近,-7.45473280936;诺,-4.57055302172;古,-6.24411546232;瓦,-5.54766249362;恩,-6.37859337655;臨,-6.81874404264;赫,-6.53400748042;麦,-6.13743131973;魯,-6.68668432063;森,-8.62233796952;山,-4.59826260314;觀,-11.2613952991;仲,-11.2613952991;鹿,-9.6519573867;島,-10.1627830105;莉,-7.92919078896;勺,-9.87510093801;白,-6.95733020593;桔,-10.5682481186;极,-9.6519573867;一,-7.16705073691;紂,-7.2540621139;内,-6.23751477829;鲇,-11.2613952991;安,-5.3949272422;戈,-6.81874404264;皋,-9.87510093801;養,-9.87510093801;同,-6.86694614446;馬,-4.94423061239;市,-11.2613952991;冕,-8.00329876111;圖,-5.42075364176;宙,-6.1862214839;刘,-7.39019428823;多,-4.02938496747;盛,-11.2613952991;御,-6.90468647244;稱,-9.18195375745;楚,-8.17035284578;伦,-7.08700802924;庫,-5.23071003887;優,-8.69644594167;維,-5.27243388224;萬,-7.07174055711;肯,-7.50019518344;献,-6.87936866446;都,-8.26566302558;丰,-9.31548515008;劳,-8.1259010832;甲,-9.6519573867;观,-11.2613952991;容,-8.00329876111;樸,-8.77648864935;麻,-9.87510093801;示,-11.2613952991;施,-6.43308156183;尼,-5.28758568726;陀,-6.86694614446;勃,-7.67787636068;資,-8.62233796952;但,-7.05670267974;滋,-10.5682481186;楊,-11.2613952991;藍,-11.2613952991;廣,-7.43275390264;烏,-5.99353714007;华,-6.55186509782;濑,-11.2613952991;乐,-7.65047738649;浒,-9.46963582991;塔,-5.19065757113;泗,-10.1627830105;托,-5.44428413917;四,-5.30038995951;昭,-5.73993438127;川,-7.89409946915;盤,-7.79565939633;信,-8.95881020614;畢,-10.5682481186;灤,-9.87510093801;坦,-8.00329876111;長,-4.95694649671;武,-9.0641707218;旭,-7.89409946915;涼,-6.31975287652;买,-8.77648864935;絲,-7.86019791747;電,-9.46963582991;闽,-9.87510093801;呼,-8.77648864935;林,-7.04188759396;將,-10.5682481186;來,-9.18195375745;下,-9.46963582991;納,-6.46560475354;和,-6.7727589294;透,-11.2613952991;莎,-10.5682481186;休,-8.08334146879;源,-7.70604723764;樓,-11.2613952991;贝,-5.57103584481;鲜,-9.6519573867;益,-7.32956966641;尧,-10.1627830105;垦,-9.18195375745;師,-10.5682481186;集,-7.45473280936;毛,-9.0641707218;堯,-10.1627830105;宮,-6.29855066887;朱,-7.65047738649;晉,-7.2360436084;谷,-10.1627830105;匹,-11.2613952991;主,-7.86019791747;覺,-8.31695631997;蒼,-7.82740809465;齐,-8.95881020614;宾,-8.69644594167;什,-7.82740809465;草,-7.31015158055;晋,-7.2360436084;里,-4.95512001219;盐,-8.21687286141;芽,-11.2613952991;高,-5.48374297591;黎,-8.69644594167;瓜,-7.18385785523;珞,-9.87510093801;瑟,-9.18195375745;因,-9.31548515008;入,-6.61700439999;迦,-8.77648864935;自,-5.81465792747;蓬,-10.5682481186;影,-9.87510093801;已,-5.08969470172;極,-9.6519573867;登,-6.4573742544;出,-8.62233796952;顿,-10.1627830105;开,-6.80704800288;梅,-6.44921094376;文,-6.65622511315;昆,-8.21687286141;劉,-7.39019428823;芭,-10.1627830105;盖,-6.13149658421;鲍,-9.31548515008;福,-6.50780510803;第,-8.21687286141;云,-8.62233796952;芙,-5.35331236097;睿,-7.96555843313;辛,-8.48880657689;通,-6.85467605187;貝,-5.57103584481;张,-9.0641707218;谢,-7.45473280936;肥,-9.46963582991;猗,-10.5682481186;田,-7.15052143496;茨,-8.55334509803;垫,-8.86350002634;紐,-7.597833653;地,-6.39386084868;陶,-11.2613952991;梵,-10.5682481186;沽,-8.77648864935;鎮,-6.99871542209;爾,-5.67414664073;仁,-8.55334509803;诃,-10.1627830105;呂,-8.77648864935;磅,-8.86350002634;获,-9.31548515008;繆,-9.46963582991;拉,-4.09977329619;韋,-6.97093585799;耶,-7.02728879454;正,-8.21687286141;扎,-6.6266663109;黑,-6.61700439999;佐,-7.36957500102;奔,-9.6519573867;旗,-9.31548515008;鮎,-11.2613952991;蓝,-11.2613952991;镜,-10.5682481186;營,-11.2613952991;奧,-5.01917203368;巧,-9.46963582991;狩,-8.37102354124;獨,-9.46963582991;鸟,-11.2613952991;凯,-5.26245873719;杰,-6.65622511315;右,-8.69644594167;兴,-8.55334509803;噶,-6.38619797593;竹,-7.92919078896;學,-9.18195375745;尾,-9.46963582991;泽,-7.50019518344;鮮,-9.6519573867;駿,-11.2613952991;艾,-6.7727589294;丁,-10.5682481186;澀,-9.87510093801;范,-11.2613952991;峪,-7.96555843313;堅,-10.1627830105;崇,-3.43575056691;庆,-9.6519573867;昂,-7.70604723764;守,-9.6519573867;國,-6.85467605187;墊,-8.86350002634;名,-11.2613952991;夏,-8.95881020614;徐,-8.86350002634;撒,-6.49922136434;贵,-7.79565939633;庖,-9.31548515008;官,-8.04251947427;諮,-11.2613952991;萝,-9.87510093801;喜,-9.31548515008;渡,-11.2613952991;欣,-9.31548515008;岢,-10.1627830105;洧,-11.2613952991;约,-4.90702525834;利,-5.68544619599;喬,-6.666275449;辰,-8.95881020614;蒲,-9.87510093801;慈,-4.5855720775;船,-8.08334146879;為,-5.94818932009;於,-8.26566302558;繁,-9.46963582991;起,-9.6519573867;镇,-6.99871542209;细,-8.86350002634;旌,-10.5682481186;詹,-9.0641707218;卓,-9.46963582991;廖,-11.2613952991;佛,-7.62380913941;勞,-8.1259010832;乡,-10.5682481186;忠,-9.46963582991;季,-9.18195375745;波,-6.31975287652;桥,-9.6519573867;凤,-8.62233796952;荔,-8.37102354124;滦,-9.87510093801;鳥,-11.2613952991;狮,-10.1627830105;翰,-11.2613952991;荷,-6.7615856288;哲,-7.70604723764;灵,-7.39019428823;海,-4.87283389359;延,-6.71810051686;特,-4.8204487585;司,-7.79565939633;曾,-9.87510093801;西,-4.89836719559;勾,-6.99871542209;
+B,nr:養,-7.10465903323;怀,-7.35471003747;沃,-6.86920222168;茂,-11.4265817438;羅,-4.78221347437;谈,-8.47631184436;範,-6.052847738;伊,-6.08797585837;厍,-10.9847489916;耐,-10.4457524908;欒,-9.02868647104;趙,-4.64149642208;鐘,-7.17967506447;席,-8.66797926357;宝,-4.94483447419;贞,-9.83961668725;楚,-6.15016921268;錢,-5.53371053799;焦,-7.41723039445;薩,-5.86333929196;萨,-5.86333929196;缪,-8.74860899797;靜,-7.69156113372;熱,-13.6238063212;醉,-9.21708707391;岳,-6.68649223995;翟,-8.78752441422;芷,-11.8320468519;方,-5.84853047469;永,-7.69955052376;强,-7.87760313063;稼,-9.91023425447;贾,-4.91797821091;雁,-8.1515356475;裡,-7.65509876119;铃,-8.89641850246;黛,-6.70709130082;竇,-7.14837360447;酆,-10.2226089395;呈,-12.0143684087;齊,-6.3990529154;母,-7.23524491563;经,-7.71844447312;寶,-4.94483447419;科,-6.44755178916;日,-8.05928591385;賓,-8.50581250876;乔,-6.46841001928;狗,-10.9157561201;祖,-6.95430823132;员,-11.3212212282;飛,-8.6539930216;翠,-7.87123368235;凡,-8.72596652122;遠,-9.19298952233;卢,-5.73247556351;查,-6.89997388035;巩,-8.13900938768;周,-4.7421089147;士,-7.07272598613;揭,-11.0588569637;扬,-8.2719481877;浮,-9.96024467504;凱,-7.15300681739;恰,-12.9306591406;鳳,-5.82077967754;念,-9.79516492468;年,-9.2293571665;其,-13.6238063212;闫,-8.15997451615;滿,-6.99444306774;庄,-6.36609864401;切,-12.2375119601;雅,-7.7716038414;沈,-6.19369218261;羊,-8.05928591385;熙,-11.0588569637;观,-8.75627187072;五,-8.99883350789;列,-7.2169263351;计,-7.950483054;畅,-10.0402873827;龚,-6.90238062038;謝,-5.83476591952;沛,-10.8512175989;丟,-10.7905929771;飄,-12.2375119601;無,-8.59336839978;探,-7.55306859317;倫,-8.00703522351;嘯,-13.6238063212;單,-6.50822419499;脱,-9.46492323781;邰,-10.8512175989;吳,-4.23448329367;厲,-8.8116219658;張,-3.69694409732;嚴,-6.29471258493;户,-9.96024467504;憶,-10.291601811;紹,-12.2375119601;咸,-8.06312469016;晋,-6.87974713486;阿,-4.67509048733;允,-9.14646950669;郜,-11.8320468519;释,-8.11037757501;黄,-4.41817702893;片,-10.5327638678;姆,-13.6238063212;哈,-6.31392483535;俊,-10.5792838834;晏,-8.77177605725;契,-9.71178331574;寒,-8.10234540331;何,-5.77799881854;杭,-5.56105842009;進,-12.0143684087;衛,-6.77474003854;迎,-8.84468282806;孝,-11.6778961721;拜,-11.1388996714;闞,-10.0684582597;惠,-6.38459134739;董,-5.63255239133;叢,-8.03281934066;来,-7.96781451035;令,-9.93492686706;牧,-7.80967578935;秦,-5.09448694996;鮮,-8.4197996341;火,-12.5251940325;迪,-5.57629681019;独,-10.0128884085;景,-6.74960782572;曲,-7.30303802692;米,-6.73931966913;史,-5.74149140219;更,-11.3212212282;须,-7.99259453935;基,-7.61009116513;阴,-7.18285978054;广,-6.57715904332;闾,-10.0684582597;梁,-5.40098419036;儀,-9.01863613518;樂,-6.65307624303;宇,-7.16077686425;上,-7.45628983028;劍,-12.9306591406;鸠,-7.61009116513;侏,-9.38969981658;后,-7.69156113372;傑,-7.70222790153;女,-9.41911370178;經,-7.71844447312;舒,-7.62735423255;井,-7.90349454457;宗,-6.06999546916;盘,-8.17706894951;沙,-5.78664667117;清,-7.64745541187;阚,-10.0684582597;牛,-5.62614319415;辟,-8.66797926357;溥,-8.77961923471;璩,-12.2375119601;妫,-11.3212212282;昌,-7.56234940224;河,-7.64239210992;侯,-6.20023787691;胜,-12.2375119601;邱,-7.45002021727;尉,-7.45419558868;朴,-8.21663454971;殷,-6.86107681424;耶,-6.56935666304;韜,-12.2375119601;连,-6.64001635591;鈄,-11.5443647795;鬼,-10.2226089395;瞿,-8.27669879046;鈴,-8.89641850246;郁,-8.19885630369;計,-7.950483054;寇,-8.21663454971;王,-3.49342226845;苍,-8.07084673625;歌,-13.6238063212;柏,-7.1812661547;掌,-8.38736435834;郑,-5.4632880737;闢,-8.66797926357;滕,-8.38205930611;佔,-7.5415874108;诗,-8.99883350789;聖,-9.65351440762;祥,-10.5792838834;费,-6.36328372308;勝,-12.2375119601;卜,-7.90349454457;濟,-11.1388996714;瑞,-7.57407286594;胡,-4.77214289581;少,-8.83631457839;溫,-6.23486022355;以,-10.6280740476;寧,-6.50174643954;鳩,-7.61009116513;边,-7.48176891559;郏,-12.9306591406;細,-11.5443647795;柯,-7.13308278667;兰,-6.57628909982;淳,-9.46492323781;仵,-11.8320468519;聶,-8.06697825947;啸,-13.6238063212;智,-7.47533802526;应,-7.81566383119;冀,-8.59336839978;帅,-7.97835942353;吉,-6.03244927447;舍,-12.9306591406;完,-9.10201774412;伏,-7.00240066941;魚,-7.28521224297;芒,-13.6238063212;帕,-6.68455237513;龔,-6.90238062038;北,-6.12826437729;肖,-6.30063560323;愛,-6.811461227;亚,-6.75791524629;初,-8.43084947028;宜,-8.99883350789;土,-10.679367342;貞,-9.83961668725;筱,-13.6238063212;蔣,-5.57629681019;严,-6.29471258493;澤,-8.6539930216;欧,-6.36469019308;梦,-8.44202277088;昝,-13.6238063212;脫,-9.46492323781;纪,-7.02666061929;陳,-4.13590997304;伯,-6.19487912637;辜,-8.78752441422;週,-4.7421089147;冰,-8.56756051582;申,-7.10761324513;真,-7.68100694605;屈,-7.66022697755;尹,-7.57643414213;龐,-6.73727467864;賴,-7.68891212555;秀,-10.5792838834;荊,-7.69955052376;久,-11.8320468519;汉,-5.97126062848;克,-6.21527575428;今,-7.8937065382;才,-10.2565104912;双,-6.7589585432;桑,-6.87036840258;暢,-10.0402873827;南,-5.91854384631;相,-7.23692700181;帥,-7.97835942353;济,-11.1388996714;佟,-7.80967578935;衡,-8.6539930216;金,-4.48625171892;淺,-9.63482227461;桐,-11.4265817438;摩,-9.71178331574;巨,-6.89997388035;仪,-9.01863613518;泮,-11.8320468519;青,-7.07845666084;柴,-7.15146002667;捷,-12.0143684087;荆,-7.69955052376;养,-7.10465903323;建,-8.92332595538;秋,-7.02393582196;钮,-9.65351440762;宁,-6.50174643954;言,-7.04733675212;鄂,-7.27641711152;超,-13.6238063212;苗,-7.61745316157;师,-5.97649748882;敖,-8.94167509405;鮑,-7.26769866048;成,-6.2560977488;亓,-10.291601811;盼,-8.67504643079;迟,-9.59845463044;尔,-6.66821371278;化,-7.8937065382;龙,-6.23300779944;丘,-7.34904429993;曉,-7.25219447394;粟,-8.54240195619;約,-10.9847489916;採,-8.09041683245;夢,-8.44202277088;尤,-6.70511110215;碧,-8.30079634203;符,-8.35594816211;義,-13.6238063212;洪,-5.80779248201;蒯,-9.96024467504;莱,-9.10201774412;戰,-7.62486975923;纳,-6.59206506241;儲,-7.8937065382;涵,-10.3657097832;吴,-4.23448329367;澹,-9.38969981658;常,-6.55904729338;町,-12.9306591406;格,-6.18131359838;蔚,-9.69198068845;练,-8.80352475557;郇,-11.8320468519;池,-8.6539930216;么,-11.1388996714;立,-7.27816996034;种,-7.62735423255;行,-8.40887056356;李,-3.3337986557;仓,-8.67504643079;止,-9.59845463044;闕,-9.37531107912;郗,-10.7334345633;招,-7.77448154123;明,-5.35353720974;凝,-9.33334688002;蓟,-7.63735431589;非,-12.5251940325;代,-7.29765684802;工,-12.9306591406;汤,-6.4278690947;僧,-10.7905929771;武,-5.45872706237;翩,-9.86260620548;早,-12.9306591406;淵,-12.5251940325;矯,-9.65351440762;培,-12.9306591406;幸,-7.63484490428;櫻,-11.5443647795;松,-7.01850840022;檀,-9.48067159478;七,-10.8512175989;如,-9.46492323781;紅,-5.88097036574;历,-7.50350890222;有,-7.41320624415;班,-7.38939559545;程,-6.68552183716;薊,-7.63735431589;植,-9.00868580433;小,-4.81439137726;美,-7.06987291715;笑,-10.7905929771;易,-6.14225061926;栗,-8.52393989335;觉,-12.2375119601;玛,-7.23861192218;韬,-12.2375119601;從,-6.84048112057;匡,-8.89641850246;加,-6.2797334706;慧,-5.92260614032;宦,-8.67504643079;亨,-10.9847489916;别,-7.49912293028;鄭,-5.4632880737;邬,-8.15997451615;鬱,-8.19885630369;莹,-12.5251940325;阳,-6.50741217708;家,-8.25316829305;訪,-12.2375119601;綺,-13.6238063212;釋,-8.11037757501;达,-6.79834628492;乃,-12.9306591406;益,-7.27466732979;浅,-9.63482227461;雷,-5.91449798779;遇,-13.6238063212;密,-10.4049304963;杉,-9.88613670289;终,-8.42530928991;橋,-10.9157561201;慶,-11.5443647795;富,-6.83034018859;晓,-7.25219447394;隆,-7.208709362;塗,-8.13074487783;余,-6.67394986617;付,-8.17706894951;剛,-9.49667193613;祝,-7.8126653282;惜,-9.01863613518;江,-6.17430831579;俞,-7.72665245354;卡,-6.1046563635;章,-6.73319720103;幣,-12.9306591406;邦,-13.6238063212;顧,-5.72391099803;佩,-7.98545165184;滨,-11.4265817438;橫,-11.6778961721;静,-7.69156113372;修,-7.30664163443;危,-8.81978527644;平,-6.01692178995;雒,-10.7334345633;赵,-4.64149642208;绿,-8.19008431762;梅,-6.09064751372;叶,-5.40017914537;書,-10.4883121052;旺,-9.30631820764;莫,-6.36187922847;甄,-8.32548895462;月,-9.404298616;宋,-4.3779057738;萊,-9.10201774412;麥,-6.43917716846;譚,-7.07129843414;嘎,-13.6238063212;崔,-7.06419108368;弘,-7.48176891559;宛,-8.40345049609;尚,-6.66821371278;邝,-10.1580704184;夜,-10.1580704184;花,-6.27779611126;談,-8.47631184436;蘇,-5.65203019829;連,-6.64001635591;木,-6.47388948504;宫,-6.48335327807;閆,-8.15997451615;斯,-5.29825801401;阮,-6.44831660755;励,-10.4457524908;鄢,-9.58075505334;诸,-5.88662624334;束,-8.81978527644;冷,-7.26596405466;戶,-9.96024467504;庹,-11.8320468519;颜,-6.90721154765;显,-8.66797926357;區,-8.63337373439;埃,-6.76419141752;桂,-7.19408684313;采,-8.09041683245;穆,-6.66821371278;廉,-8.45902034725;服,-11.1388996714;友,-9.8171438314;藏,-8.07862887669;續,-7.97483208301;苑,-8.74100439859;子,-5.78941401826;韓,-5.47247298327;法,-6.69624841489;雍,-8.55490211895;雙,-6.7589585432;佘,-9.73198602306;毛,-5.89715265633;郝,-6.60719663728;虞,-7.94022655383;占,-7.5415874108;龍,-6.23300779944;哥,-8.61986001523;赤,-9.8171438314;臧,-8.8116219658;杨,-4.2735301089;汪,-6.46063393033;热,-13.6238063212;公,-5.99334505939;路,-7.13917108554;普,-6.50174643954;英,-7.208709362;印,-7.96432410541;柳,-6.31727492223;遲,-9.59845463044;懷,-7.35471003747;扶,-8.39805964746;曹,-4.90285629224;寻,-7.44793905107;訾,-11.2259110484;壽,-7.55769823107;楼,-8.2032713219;乾,-7.00240066941;刁,-9.14646950669;简,-7.8126653282;门,-7.82471366671;雪,-7.03763466632;薄,-8.03281934066;荀,-7.7831646638;三,-8.45332232613;韩,-5.47247298327;倍,-11.2259110484;心,-7.98545165184;于,-5.26936738106;刑,-8.11847478524;麗,-8.40887056356;圓,-10.5327638678;聂,-8.06697825947;吕,-5.68536077001;閔,-8.49390760625;阙,-9.37531107912;笛,-9.10201774412;思,-7.8937065382;农,-7.29586953744;生,-7.11206099153;亞,-6.75791524629;圣,-9.65351440762;邢,-7.29586953744;大,-6.02942507862;窦,-7.14837360447;温,-6.23486022355;水,-6.5353975425;陆,-5.63900293144;冬,-9.31974122797;支,-8.02909494157;皮,-6.85187076533;樱,-11.5443647795;宰,-8.18138861065;傲,-10.4049304963;鐵,-6.94420713533;星,-8.71853154273;香,-7.02802580721;靈,-7.05995079464;丹,-6.84274869524;冼,-10.9847489916;额,-8.62659404741;庾,-8.86163238638;婁,-8.35080676261;贡,-7.59794034735;权,-6.62895633534;访,-12.2375119601;居,-6.91816722631;歷,-7.50350890222;义,-13.6238063212;骆,-7.93344686685;瓊,-11.2259110484;額,-8.62659404741;凌,-7.28875206967;問,-9.29307298089;从,-6.84048112057;剑,-12.9306591406;项,-7.37576344666;体,-7.71030331553;展,-8.48214276467;还,-12.2375119601;虎,-12.9306591406;姜,-6.59029983689;黑,-6.27844148076;藤,-8.53005612037;內,-7.85861521839;歐,-6.36469019308;陽,-6.50741217708;卫,-6.77474003854;姬,-8.61986001523;绮,-13.6238063212;賁,-11.1388996714;台,-9.21708707391;靳,-8.86163238638;惲,-10.2226089395;巴,-5.77058993302;墨,-7.27466732979;幹,-7.68100694605;卻,-8.82801577558;恽,-10.2226089395;长,-8.33553929048;图,-9.77365871946;娄,-8.35080676261;皇,-9.15789820252;冉,-8.2211289393;須,-7.99259453935;蒋,-5.57629681019;權,-6.62895633534;侍,-7.09438748291;希,-6.71405303953;吐,-9.75260531027;邓,-5.57597696372;赖,-7.68891212555;潘,-6.58941839126;妙,-8.2211289393;岛,-12.2375119601;馮,-5.19151763685;依,-8.17276786761;东,-5.61643925319;那,-5.89671183639;漢,-5.97126062848;座,-12.2375119601;瀨,-12.5251940325;漆,-8.86163238638;媯,-11.3212212282;铁,-6.94420713533;安,-5.45645433412;麦,-6.43917716846;段,-7.10613504826;戴,-6.30195660738;康,-5.87190098809;興,-9.91023425447;禹,-7.950483054;逸,-13.6238063212;費,-6.36328372308;区,-8.63337373439;羽,-9.25435846871;暴,-7.99978881499;荣,-6.6663089503;坂,-10.679367342;菅,-11.4265817438;仇,-8.51181853282;商,-6.87621979434;應,-7.81566383119;蓋,-7.37190243801;半,-9.05945812971;乌,-6.07419715602;苏,-5.65203019829;慎,-9.26709749448;罗,-4.78221347437;豐,-7.52124772656;归,-8.38205930611;毕,-7.57880100714;岸,-11.5443647795;鳥,-12.9306591406;博,-6.59294884506;保,-7.24707937327;乜,-11.3212212282;苟,-9.93492686706;神,-7.59072009937;屠,-8.73345719295;越,-7.81867135226;盧,-5.73247556351;浦,-8.08254277601;恨,-9.54626887727;若,-7.41723039445;库,-6.90117652632;端,-10.291601811;雲,-6.40562948277;緱,-12.9306591406;鄒,-7.01176528634;鸿,-10.679367342;廷,-12.9306591406;幼,-8.44202277088;拿,-11.8320468519;腾,-10.4457524908;祁,-8.12663809588;考,-10.8512175989;瑪,-7.23861192218;包,-6.96195158063;万,-6.40930190702;賀,-6.72307565713;郭,-4.97804402896;尋,-7.44793905107;莊,-6.36609864401;伍,-7.24029968629;二,-9.09120682802;賽,-8.34569166194;黃,-4.41817702893;战,-7.62486975923;君,-12.2375119601;肯,-9.30631820764;朝,-11.0588569637;蔡,-6.30991948954;茅,-7.96781451035;愚,-11.2259110484;綦,-10.9847489916;天,-6.40051064161;储,-7.8937065382;含,-8.70382539534;措,-13.6238063212;石,-5.48670293153;榮,-6.6663089503;由,-6.80052019882;鞏,-8.13900938768;農,-7.29586953744;结,-9.37531107912;钟,-7.17967506447;賈,-4.91797821091;邸,-10.291601811;伽,-8.51786084727;麼,-11.1388996714;房,-7.2504865316;管,-7.15610759507;狄,-7.39332487359;渠,-9.28000089932;光,-7.99618520748;關,-5.92941351854;位,-9.12399665084;轩,-8.49984234177;濮,-9.44941905128;野,-11.1388996714;桓,-7.4012300531;索,-6.35488619298;单,-6.50822419499;體,-7.71030331553;芦,-8.19885630369;裘,-8.04407649519;葛,-7.29765684802;揚,-8.2719481877;牟,-7.81867135226;衣,-7.76302009771;步,-8.2672200465;左,-5.96227923981;能,-7.80076042569;弦,-9.93492686706;彭,-6.20562549845;道,-7.63484490428;良,-13.6238063212;饶,-8.4197996341;泰,-6.63816450353;習,-8.14316739783;暨,-10.7905929771;时,-7.55538073293;隗,-10.5792838834;百,-12.0143684087;曼,-7.75733826424;承,-7.72940348691;鲁,-5.58368165672;威,-9.65351440762;币,-12.9306591406;市,-13.6238063212;理,-10.0402873827;閭,-10.0684582597;斋,-12.2375119601;樊,-7.715723383;融,-8.23931125838;萬,-6.40930190702;岑,-8.29108752791;唐,-4.83918478633;覓,-11.5443647795;第,-10.5792838834;林,-5.12538828508;飘,-12.2375119601;餘,-6.67394986617;斛,-13.6238063212;刚,-9.49667193613;原,-7.03763466632;禄,-8.23473459136;岡,-11.2259110484;丢,-10.7905929771;騰,-10.4457524908;駱,-7.93344686685;庆,-11.5443647795;本,-8.67504643079;钱,-5.53371053799;嘉,-6.15130557644;嬴,-11.0588569637;德,-6.30063560323;邹,-7.01176528634;喻,-8.54863250594;宿,-7.60035872821;栾,-9.02868647104;品,-12.0143684087;時,-7.55538073293;过,-7.92671283467;豆,-9.34714020216;慈,-7.08133436067;绍,-12.2375119601;過,-7.92671283467;蘆,-8.19885630369;結,-9.37531107912;羿,-10.9157561201;孔,-5.55854111228;志,-9.43415157915;游,-7.83384615028;蘭,-6.57628909982;仝,-10.5792838834;杜,-5.85823724008;塞,-7.44378966752;員,-11.3212212282;解,-6.88092568538;蔺,-11.2259110484;童,-6.28102713184;孤,-8.44202277088;郦,-9.75260531027;全,-7.10761324513;巫,-8.36631094915;黨,-8.31060034213;续,-7.97483208301;弓,-7.67838571257;華,-5.60814870662;琼,-11.2259110484;干,-7.68100694605;勵,-10.4457524908;却,-8.82801577558;裨,-13.6238063212;闻,-6.79617708667;空,-7.47533802526;国,-6.39687030268;寿,-7.55769823107;顾,-5.72391099803;封,-6.16331601535;門,-7.82471366671;玄,-5.74565098467;倉,-8.67504643079;冈,-11.2259110484;不,-12.5251940325;後,-7.69156113372;向,-6.14507149561;霍,-6.17082399171;終,-8.42530928991;鈕,-9.65351440762;湯,-6.4278690947;弗,-7.09292869345;莘,-10.7334345633;候,-8.83631457839;洛,-7.33223718161;问,-9.29307298089;帝,-7.29052669303;果,-9.54626887727;簡,-7.8126653282;綠,-8.19008431762;亢,-10.1580704184;別,-7.49912293028;黎,-6.96195158063;諾,-8.27669879046;紫,-7.04455510916;努,-12.9306591406;中,-8.00340545546;振,-9.28000089932;新,-7.9713171409;菲,-11.4265817438;強,-7.87760313063;陈,-4.13590997304;銀,-5.73472191414;鴻,-10.679367342;庞,-6.73727467864;丽,-8.40887056356;维,-6.88446969382;元,-6.24105987143;許,-6.50013353597;葉,-5.40017914537;寄,-10.8512175989;藍,-6.20863121156;魏,-5.30726160324;郎,-7.62239144321;軒,-8.49984234177;比,-6.99708857192;樓,-8.2032713219;鄧,-5.57597696372;赛,-8.34569166194;九,-8.62659404741;远,-9.19298952233;孟,-6.27200645212;飞,-8.6539930216;阎,-6.74034373476;无,-8.59336839978;诺,-8.27669879046;古,-5.94965339989;橘,-12.9306591406;瓦,-6.7821908447;恩,-7.80372339082;默,-10.7334345633;赫,-6.72610137804;约,-10.9847489916;廓,-9.512932457;魯,-5.58368165672;森,-8.57395031392;山,-5.8693247737;关,-5.92941351854;仲,-7.99259453935;鹿,-5.99480243152;島,-12.2375119601;詹,-6.84958243482;竺,-9.54626887727;白,-4.74294271131;卿,-8.82801577558;達,-6.79834628492;袁,-5.33225981129;一,-8.44202277088;内,-7.85861521839;逄,-11.1388996714;圆,-10.5327638678;厉,-8.8116219658;戈,-7.10761324513;隋,-6.95304000033;银,-5.73472191414;紀,-7.02666061929;同,-7.93683096483;馬,-4.31679306194;昂,-9.63482227461;圖,-9.77365871946;厙,-10.9847489916;刘,-3.96264513937;多,-7.87441333526;盛,-6.70511110215;鲜,-8.4197996341;映,-9.93492686706;奚,-8.54863250594;伦,-8.00703522351;庫,-6.90117652632;太,-6.29865736322;維,-6.88446969382;听,-9.44941905128;梯,-10.4457524908;都,-7.31935751875;丰,-7.52124772656;劳,-7.31935751875;贲,-11.1388996714;况,-9.31974122797;郟,-12.9306591406;買,-10.5327638678;容,-7.35471003747;樸,-8.21663454971;麻,-7.01580569588;鄺,-10.1580704184;施,-6.86687393193;尼,-6.66156285691;翁,-7.49475611111;勃,-9.98622016145;渊,-12.5251940325;觅,-11.5443647795;但,-7.92002384652;扈,-8.8116219658;介,-9.2293571665;楊,-4.2735301089;巍,-12.9306591406;廣,-6.57715904332;烏,-6.07419715602;华,-5.60814870662;濑,-12.5251940325;乐,-6.65307624303;拓,-7.65765958205;燕,-6.46762968369;塔,-7.24707937327;靖,-8.55490211895;托,-6.91939196621;四,-10.7334345633;党,-8.31060034213;川,-7.92336274778;盤,-8.17706894951;卞,-8.64019969946;信,-7.11951814764;习,-8.14316739783;畢,-7.57880100714;马,-4.31679306194;车,-7.1639018668;旭,-13.6238063212;濱,-11.4265817438;买,-10.5327638678;任,-5.97602027573;谌,-10.0684582597;呼,-7.36805627942;扁,-9.98622016145;涂,-8.13074487783;還,-12.2375119601;來,-7.96781451035;蘅,-12.5251940325;熊,-6.73421501282;毋,-9.67256260259;和,-5.57853860457;莎,-8.28626824147;缑,-12.9306591406;蒙,-6.43087209996;娓,-12.9306591406;老,-5.25372199479;藺,-11.2259110484;甘,-7.17018132228;折,-8.71853154273;丛,-8.03281934066;贝,-6.09816634613;薛,-6.10194706897;戚,-7.88723402369;萧,-6.63816450353;陰,-7.18285978054;師,-5.97649748882;逯,-10.3279694552;宮,-6.48335327807;朱,-4.83186433272;晉,-6.87974713486;邴,-11.8320468519;谷,-6.68455237513;茹,-8.27669879046;闵,-8.49390760625;覺,-12.2375119601;蒼,-8.07084673625;耿,-7.84925477563;宾,-8.50581250876;雨,-7.77736754612;饒,-8.4197996341;郄,-12.9306591406;忆,-10.291601811;草,-13.6238063212;之,-10.3279694552;春,-7.49475611111;顏,-6.90721154765;車,-7.1639018668;村,-10.7905929771;慕,-7.21857786314;红,-5.88097036574;陸,-5.63900293144;孙,-4.50601993081;高,-4.98758642334;湛,-9.79516492468;姚,-6.31392483535;糜,-8.19446069222;曠,-8.33553929048;巢,-8.48800788412;奥,-5.83766988339;韦,-6.78647350649;蕭,-6.63816450353;蓬,-8.68216389856;顯,-8.66797926357;鱼,-7.28521224297;東,-5.61643925319;仰,-8.64019969946;朽,-9.98622016145;裴,-7.60035872821;韶,-9.33334688002;諸,-5.88662624334;幻,-9.83961668725;横,-11.6778961721;傅,-6.74960782572;文,-5.84685191785;昆,-11.5443647795;劉,-3.96264513937;盖,-7.37190243801;鲍,-7.26769866048;布,-5.54635917184;福,-6.39179598951;戎,-8.32548895462;云,-6.40562948277;宓,-9.36112644413;鄔,-8.15997451615;世,-7.31753103422;辛,-7.29944735879;通,-6.6606163353;貝,-6.09816634613;张,-3.69694409732;宣,-6.13048907231;谢,-5.83476591952;田,-5.38210316144;里,-7.65509876119;倪,-8.11037757501;钭,-11.5443647795;冯,-5.19151763685;種,-7.62735423255;地,-7.74327333477;殳,-12.9306591406;邵,-6.46919096426;爾,-6.66821371278;仁,-7.37769955569;呂,-5.68536077001;觀,-8.75627187072;玉,-5.65306593117;繆,-8.74860899797;拉,-6.19606748064;納,-6.59206506241;韋,-6.78647350649;遊,-7.83384615028;操,-7.98189925023;正,-8.92332595538;扎,-9.91023425447;滑,-8.2211289393;佐,-10.9847489916;进,-12.0143684087;練,-8.80352475557;蓝,-6.20863121156;閻,-6.74034373476;满,-6.99444306774;齐,-6.3990529154;胥,-8.24852791349;奧,-5.83766988339;巧,-7.13917108554;书,-10.4883121052;獨,-10.0128884085;矫,-9.65351440762;鸟,-12.9306591406;敬,-7.27292060446;凯,-7.15300681739;杰,-7.70222790153;汲,-8.81978527644;兴,-9.91023425447;旷,-8.33553929048;陶,-6.70907542845;竹,-11.4265817438;歸,-8.38205930611;忻,-9.65351440762;泽,-8.6539930216;孫,-4.50601993081;艾,-6.29668302891;丁,-5.29149796895;況,-9.31974122797;范,-6.052847738;爱,-6.811461227;項,-7.37576344666;瑩,-12.5251940325;了,-10.5792838834;守,-12.5251940325;國,-6.39687030268;邊,-7.48176891559;名,-11.3212212282;夏,-5.39857099707;徐,-4.85461004976;聞,-6.79617708667;撒,-10.7905929771;官,-6.86107681424;望,-7.101713523;語,-9.44941905128;渡,-12.0143684087;鞠,-10.291601811;貢,-7.59794034735;亦,-9.59845463044;利,-6.34794172063;覃,-9.83961668725;谭,-7.07129843414;喬,-6.46841001928;芮,-9.41911370178;蒲,-6.86687393193;堵,-9.26709749448;酈,-9.75260531027;语,-9.44941905128;许,-6.50013353597;褚,-7.989016718;於,-8.57395031392;痴,-10.3279694552;晁,-7.75733826424;贺,-6.72307565713;千,-8.96984597102;長,-8.33553929048;嵇,-9.26709749448;细,-11.5443647795;又,-11.8320468519;齋,-12.2375119601;諶,-10.0684582597;籍,-9.44941905128;虹,-13.6238063212;卓,-7.53023655113;廖,-7.32118734543;津,-12.9306591406;汝,-6.67586925256;荻,-12.5251940325;勞,-7.31935751875;忠,-12.9306591406;季,-7.20055935764;波,-7.05432490076;桥,-10.9157561201;凤,-5.82077967754;詩,-8.99883350789;聽,-9.44941905128;荷,-11.8320468519;灵,-7.05995079464;西,-5.23649405061;海,-5.97840862174;延,-7.22687666596;特,-6.57455147992;司,-5.58078543587;曾,-6.42936947007;祿,-8.23473459136;勾,-8.45902034725;
+B,ns:怀,-8.07744714933;茂,-8.56877354805;蘄,-10.2874107524;誇,-10.9064499609;耀,-9.88194564434;涉,-11.1476120177;伊,-5.41662714834;随,-9.15105813579;芗,-12.8523601099;洞,-8.37502329543;錢,-7.42520987152;般,-12.1592129293;河,-3.91068380455;侵,-12.1592129293;临,-6.23295379236;類,-12.8523601099;宽,-10.0191467659;线,-11.936069378;珍,-8.981159099;牌,-12.1592129293;姑,-9.09115999421;筒,-12.8523601099;織,-10.2496704245;苗,-10.5009848527;赞,-8.40970885342;凡,-8.17022888278;遠,-7.56915638117;卢,-7.50287445678;知,-12.8523601099;巩,-8.57569399089;揭,-9.32599958529;扬,-6.55433040335;闹,-12.1592129293;磻,-12.4468950018;绿,-10.980557933;渔,-11.936069378;榆,-7.72542436011;沈,-6.71247555768;個,-9.06817047599;颐,-8.20796921077;应,-9.11469049162;謝,-11.4660657488;涞,-10.2496704245;無,-6.91482390482;禦,-12.1592129293;循,-10.2496704245;芬,-7.40132165634;讲,-10.980557933;咸,-6.72877140987;砻,-13.5455072905;贞,-12.1592129293;鸿,-12.4468950018;闊,-12.8523601099;賈,-11.4660657488;運,-8.84502692467;契,-6.94291939828;磐,-12.8523601099;寒,-9.99015922898;黔,-8.13833551901;衛,-9.88194564434;也,-8.90111639132;叢,-12.1592129293;盤,-8.79191709936;秦,-6.15532586224;嵩,-7.83177448496;峨,-7.85177515166;景,-7.62125149305;轵,-13.5455072905;滴,-11.7537478212;畹,-10.2133027803;须,-11.5995971414;基,-7.64287395706;广,-4.31135274039;輪,-9.90792113074;門,-9.96198835201;上,-3.74150863643;劍,-8.15643556065;鞏,-8.57569399089;后,-8.01607820295;碑,-12.8523601099;經,-9.76131765655;底,-8.47660308825;蒙,-5.34467003209;剛,-8.0240463726;厄,-8.26230356173;岩,-9.80783767218;鴨,-8.0944688369;椰,-13.5455072905;甸,-11.5995971414;离,-8.72522572486;媽,-9.65368699236;尾,-8.85415940824;泉,-7.43848440272;绕,-11.5995971414;聖,-6.62879227011;敘,-7.47708170222;濟,-6.59949329937;郡,-7.96577746448;坤,-8.15187974411;寧,-5.91942453239;淳,-9.57521537691;潴,-11.2429221975;贾,-11.4660657488;老,-7.00592133485;节,-11.936069378;儋,-9.90792113074;帕,-8.01607820295;龔,-13.5455072905;肖,-11.5995971414;濮,-8.24220238241;贛,-7.46100787739;貞,-12.1592129293;冠,-12.1592129293;鬧,-12.1592129293;精,-8.09018617511;歇,-10.5497750169;汉,-6.05107707543;克,-6.87727904205;車,-8.00032984599;前,-9.31140078587;双,-8.10742798154;駐,-8.36935755789;幕,-11.0606006407;几,-7.80571437829;巨,-10.111520086;蓮,-8.74971674487;卷,-10.7122939464;闸,-9.65368699236;固,-8.35812148463;仁,-8.31439867361;脂,-11.4660657488;澉,-9.85662783635;蘭,-6.75653554747;贊,-8.40970885342;库,-7.73436629749;尔,-12.4468950018;蔚,-9.48506427992;沟,-11.2429221975;鄢,-11.3482827131;碧,-10.5497750169;符,-10.5009848527;義,-8.17953127544;亳,-9.22801917693;统,-13.5455072905;猶,-9.67430627956;町,-13.5455072905;所,-9.7388448007;旅,-8.31976061675;濉,-10.6551355326;浊,-12.1592129293;重,-5.6341832715;灌,-10.048999729;坎,-9.78430717477;结,-11.7537478212;饒,-11.936069378;潞,-9.57521537691;鏡,-9.0022125082;監,-9.90792113074;瑤,-10.6551355326;学,-10.9064499609;鲤,-13.5455072905;耒,-10.4100130745;汴,-7.93603549528;陸,-7.59486473788;墾,-10.7122939464;溈,-11.936069378;越,-6.45793358491;吏,-10.1443099088;馒,-12.4468950018;岔,-10.7122939464;掖,-10.980557933;加,-5.58169933723;贵,-5.82726633851;貴,-5.82726633851;稻,-13.5455072905;碼,-12.1592129293;故,-8.01607820295;城,-5.78461409462;江,-4.3412855995;连,-7.73736480049;卡,-7.38852830488;略,-10.6010683113;顧,-12.1592129293;黨,-10.7729185682;乳,-9.99015922898;赵,-9.16348065579;黿,-11.5995971414;遷,-10.3266314656;叶,-7.85177515166;相,-9.35585254844;驻,-8.36935755789;好,-8.38072131654;王,-7.77406616734;疏,-9.76131765655;嘎,-13.5455072905;窑,-11.2429221975;條,-11.4660657488;涟,-9.63348428504;务,-12.4468950018;花,-7.47939920036;垣,-10.7122939464;莫,-6.33468883699;斯,-6.58137167805;澳,-5.24497868427;冷,-9.52015559973;霸,-9.40237256407;礼,-10.4100130745;綿,-8.35812148463;績,-10.7122939464;聂,-11.4660657488;友,-9.1387880432;子,-8.872678456;離,-8.72522572486;毛,-8.10742798154;乞,-10.6551355326;哥,-5.98282604374;绩,-10.7122939464;普,-7.50763637054;輕,-10.8374570894;寻,-11.1476120177;壽,-7.95825863207;幾,-7.80571437829;會,-8.48291225744;三,-5.90346288759;逍,-12.4468950018;册,-12.8523601099;娑,-12.8523601099;弓,-13.5455072905;尕,-11.2429221975;講,-10.980557933;亞,-4.96853689501;圣,-6.62879227011;邢,-8.83597708915;大,-4.4277209001;樱,-10.2874107524;漳,-7.96577746448;靈,-7.45419740839;义,-8.17953127544;迈,-9.96198835201;泊,-11.5995971414;凌,-9.37112002057;当,-8.33057153286;柘,-10.4544648371;衝,-8.90111639132;牡,-8.56190066876;珠,-6.64881295884;郢,-10.8374570894;奧,-6.28287868949;恭,-9.83193522376;佳,-8.92053447718;棲,-9.78430717477;铺,-8.66270536788;肃,-10.4100130745;蜂,-13.5455072905;鞍,-8.52162676962;潘,-8.9605398118;沛,-9.46796984656;依,-9.61368165774;东,-4.33977753105;那,-7.16538475357;撫,-7.6511044562;段,-11.2429221975;羽,-9.93458937782;夾,-9.96198835201;旁,-8.72522572486;杂,-13.5455072905;滇,-8.30906532764;浆,-10.1443099088;归,-9.7388448007;敖,-11.2429221975;泛,-11.936069378;保,-6.79090319098;櫟,-12.1592129293;睢,-9.96198835201;句,-10.1782114605;深,-4.98257620738;雷,-8.25724025977;當,-8.33057153286;幼,-9.5565232439;考,-11.3482827131;茅,-8.88206819635;万,-7.03079459959;圍,-12.4468950018;岐,-9.18879846378;頓,-8.981159099;徒,-11.5995971414;輝,-9.57521537691;樟,-10.1443099088;锡,-7.55905528518;英,-4.17859061145;連,-7.73736480049;綦,-10.5497750169;天,-4.92864977594;墨,-6.75092070959;宪,-12.8523601099;札,-10.980557933;洱,-9.04569762014;農,-10.048999729;野,-13.5455072905;軹,-13.5455072905;顓,-12.1592129293;習,-11.936069378;揚,-6.55433040335;機,-12.4468950018;灣,-9.43463342629;勤,-10.5497750169;左,-9.26884117145;葫,-9.7388448007;杭,-5.60991990488;良,-9.09115999421;泰,-5.99853317295;郸,-10.3266314656;类,-12.8523601099;驿,-11.5995971414;攀,-8.81811947175;昂,-11.3482827131;開,-6.19949708055;樊,-8.44564086264;隍,-11.936069378;岑,-13.5455072905;紐,-5.94460483092;笔,-10.4544648371;林,-8.18421512476;戚,-11.2429221975;溝,-11.2429221975;館,-8.73332293509;本,-8.74148624573;沱,-8.83597708915;串,-10.7729185682;湟,-8.41560857554;邹,-9.99015922898;刺,-10.9064499609;纽,-5.94460483092;宿,-8.49565128322;時,-11.1476120177;过,-9.41837290542;豆,-11.936069378;棉,-9.99015922898;雍,-9.40237256407;過,-9.41837290542;嵐,-9.99015922898;孔,-9.48506427992;潜,-9.05687092073;員,-12.8523601099;釣,-8.67797284001;院,-10.9064499609;壩,-10.4544648371;驪,-9.71686589398;華,-4.96028168866;瑶,-10.6551355326;彼,-8.36935755789;寿,-7.95825863207;顾,-12.1592129293;蚂,-12.4468950018;炎,-10.9064499609;少,-9.176059438;麒,-11.4660657488;朗,-10.8374570894;洛,-5.30196178254;抚,-7.6511044562;渝,-9.90792113074;澜,-8.0240463726;鄣,-13.5455072905;別,-12.4468950018;窪,-11.2429221975;昭,-9.09115999421;振,-11.2429221975;鴻,-12.4468950018;總,-12.1592129293;碾,-11.5995971414;潇,-8.54156098452;郏,-10.5497750169;赛,-10.8374570894;九,-6.49192156327;远,-7.56915638117;近,-13.5455072905;团,-9.34081467108;古,-6.19114496004;柬,-7.7494495397;药,-11.5995971414;仲,-10.6010683113;鹿,-8.94033710448;银,-7.50525257919;鹽,-7.96201098168;翼,-9.61368165774;极,-11.936069378;皋,-11.0606006407;同,-7.52691407597;徑,-11.7537478212;叙,-7.47708170222;垡,-11.936069378;太,-5.01362255031;萬,-7.03079459959;肯,-8.01607820295;丰,-8.23723959307;鐵,-8.43351950211;麻,-9.45116272824;綽,-10.9064499609;尼,-6.33987211406;資,-8.67030996727;犍,-9.76131765655;楊,-8.40970885342;烏,-5.77528408631;华,-4.96028168866;塔,-6.44713165188;托,-8.90111639132;淝,-10.4544648371;汜,-12.8523601099;畢,-9.93458937782;灤,-8.36935755789;奪,-13.5455072905;旭,-11.936069378;濱,-7.95452030996;巽,-11.1476120177;鱼,-9.93458937782;來,-8.95038744033;和,-7.29940052498;瀏,-8.37502329543;庐,-7.82519551386;夕,-11.936069378;折,-11.0606006407;丛,-12.1592129293;贝,-7.69330481069;尧,-10.7122939464;禪,-12.1592129293;鵲,-10.0797713877;匹,-8.48926148512;宾,-9.12666668267;汇,-12.8523601099;偏,-10.7729185682;网,-11.4660657488;麦,-7.58450195084;湛,-8.05656956431;滎,-8.42751347805;坡,-11.4660657488;因,-11.5995971414;入,-7.37799079958;蕭,-8.74971674487;蓬,-8.61825360531;息,-10.0191467659;仰,-9.176059438;極,-11.936069378;韶,-8.58266266021;顿,-8.981159099;蜀,-7.8687534882;悅,-11.4660657488;涇,-8.43351950211;鞋,-13.5455072905;甌,-9.5565232439;夔,-10.7729185682;斗,-9.71686589398;芙,-8.45175708966;辛,-9.25504784932;貝,-7.69330481069;眠,-11.4660657488;嶧,-12.8523601099;带,-12.8523601099;枫,-9.88194564434;堪,-8.74148624573;播,-9.45116272824;蔬,-12.8523601099;梵,-8.84502692467;喷,-12.4468950018;犹,-9.67430627956;雞,-8.95038744033;杀,-11.936069378;淇,-10.5009848527;韋,-10.3266314656;响,-10.5009848527;界,-10.5009848527;黑,-5.80701916797;齐,-8.78333335567;拙,-10.6010683113;进,-12.8523601099;聚,-9.83193522376;口,-8.88206819635;煤,-12.8523601099;嫩,-8.52822745365;噶,-9.09115999421;忻,-9.1387880432;峽,-10.3674534601;范,-10.7122939464;蒂,-10.5009848527;者,-13.5455072905;溆,-11.5995971414;國,-8.72522572486;名,-9.34081467108;徐,-6.66204470405;蔗,-11.7537478212;暖,-10.4544648371;莘,-12.1592129293;語,-13.5455072905;约,-7.78031618768;芮,-10.7122939464;辰,-11.936069378;荃,-13.5455072905;擂,-12.4468950018;委,-8.02005435133;潛,-9.05687092073;汝,-8.47660308825;陡,-10.3674534601;健,-11.7537478212;凤,-7.26324054357;旬,-10.980557933;乱,-11.5995971414;濰,-8.74971674487;長,-4.34693590209;特,-8.26739263124;司,-10.5497750169;雾,-9.37112002057;祿,-9.57521537691;沃,-9.176059438;遞,-12.8523601099;阔,-12.8523601099;趙,-9.16348065579;会,-8.48291225744;岣,-12.8523601099;焦,-7.45873256355;閩,-7.45419740839;圪,-10.048999729;洮,-9.01290779731;邻,-12.8523601099;湄,-8.8005751621;苇,-12.8523601099;经,-9.76131765655;金,-5.84747812019;蛟,-10.5497750169;鹤,-8.55507470369;周,-7.49577383523;坪,-9.76131765655;语,-13.5455072905;浮,-10.0797713877;恰,-9.71686589398;晴,-12.1592129293;奶,-13.5455072905;鷹,-11.4660657488;调,-10.048999729;麗,-8.22249731133;與,-12.4468950018;撈,-12.1592129293;香,-5.03775855788;隔,-11.936069378;芜,-7.93603549528;星,-9.83193522376;弥,-11.936069378;港,-9.80783767218;莲,-8.74971674487;稷,-10.9064499609;紹,-7.1353324085;阿,-4.74268413072;滄,-7.79930409993;扇,-12.8523601099;筍,-12.8523601099;鹏,-13.5455072905;浙,-5.19201019172;拜,-9.5565232439;湯,-8.17486926234;淮,-5.81797217999;菲,-7.10775564073;狼,-9.176059438;梁,-6.89652274044;樂,-7.59226395618;昊,-10.7729185682;傑,-10.9064499609;栖,-9.78430717477;沙,-6.49365166751;渚,-13.5455072905;芝,-7.63200428483;麥,-7.58450195084;瀦,-11.2429221975;阪,-11.4660657488;邳,-9.53817410523;侯,-9.34081467108;跃,-11.7537478212;恆,-8.97079631196;蓉,-11.3482827131;始,-10.6551355326;郑,-4.54576450064;驢,-12.8523601099;绥,-8.04424907992;腰,-11.3482827131;色,-8.9605398118;蝴,-10.6551355326;顶,-12.8523601099;響,-10.5009848527;清,-7.22294205054;澄,-9.15105813579;薈,-13.5455072905;完,-10.3266314656;聯,-7.96955818732;愛,-6.79557609668;亚,-4.96853689501;群,-11.936069378;邦,-11.5995971414;設,-10.8374570894;漯,-8.48291225744;肅,-10.4100130745;尹,-12.1592129293;纺,-11.5995971414;觀,-8.84502692467;久,-13.5455072905;俄,-4.92017744045;葉,-7.85177515166;積,-10.0191467659;富,-8.06071035698;勒,-9.65368699236;陕,-5.38813684928;埔,-11.4660657488;菜,-10.2874107524;卧,-7.93603549528;门,-9.96198835201;雪,-9.31140078587;潯,-9.96198835201;柴,-7.87218402329;壶,-9.35585254844;养,-13.5455072905;建,-7.53424011606;涅,-10.3674534601;肇,-8.95038744033;鼎,-10.0191467659;爐,-13.5455072905;鄒,-9.99015922898;丘,-10.7729185682;管,-8.48926148512;魚,-9.93458937782;尤,-9.93458937782;錦,-7.28210902787;莱,-6.77014119953;常,-6.74422425599;淅,-9.5565232439;荆,-6.29132944401;立,-8.20796921077;种,-12.8523601099;題,-13.5455072905;发,-12.1592129293;酒,-8.18892101579;棗,-9.1387880432;湘,-6.23028890071;招,-10.5009848527;浚,-9.5565232439;蓟,-8.80930884207;杞,-8.08592177632;廣,-4.31135274039;工,-9.78430717477;郧,-8.45175708966;韩,-6.16151783249;諫,-12.1592129293;番,-7.91429550864;潮,-7.68757413598;菱,-11.936069378;幸,-12.4468950018;遼,-5.5177044421;檀,-9.71686589398;七,-7.64560993688;莆,-9.38662420711;薊,-8.80930884207;复,-10.3266314656;碌,-12.8523601099;小,-7.08091898678;美,-3.31429997845;甕,-9.18879846378;戛,-9.176059438;枞,-11.0606006407;縣,-13.5455072905;粤,-8.2776491314;厦,-6.95109383072;圩,-11.2429221975;隨,-9.15105813579;谯,-13.5455072905;憲,-12.8523601099;家,-10.9064499609;嶺,-9.65368699236;琿,-9.52015559973;乃,-10.048999729;观,-8.84502692467;浅,-10.9064499609;杉,-12.1592129293;屏,-9.41837290542;卑,-10.3266314656;勐,-10.6010683113;街,-11.4660657488;余,-8.00424374531;胜,-11.1476120177;柞,-13.5455072905;章,-9.93458937782;革,-12.8523601099;雨,-9.93458937782;橫,-7.41863810635;並,-8.67030996727;修,-8.60386486786;寶,-7.11096077168;鷺,-11.936069378;矾,-13.5455072905;较,-11.5995971414;沅,-8.58968023287;月,-9.69535968876;宋,-9.88194564434;萊,-6.77014119953;颍,-9.37112002057;綏,-8.04424907992;倒,-11.1476120177;梭,-12.8523601099;抱,-12.4468950018;鄉,-13.5455072905;鰲,-11.4660657488;缸,-13.5455072905;玻,-8.55507470369;桂,-7.03524894994;资,-8.67030996727;曉,-10.6010683113;韓,-6.16151783249;仙,-8.07323661679;佘,-12.8523601099;虞,-10.1443099088;筠,-12.4468950018;鳥,-12.4468950018;偃,-8.78333335567;瑪,-8.11616166151;路,-7.44968272803;拱,-9.78430717477;柳,-7.78345590769;蕴,-12.4468950018;都,-7.60533603775;百,-7.87562636749;較,-11.5995971414;谅,-10.2133027803;笋,-12.8523601099;圓,-8.50855468805;呂,-8.81811947175;吕,-8.81811947175;閔,-9.29701204842;思,-9.34081467108;君,-7.90006039282;鄧,-8.18421512476;育,-11.4660657488;夷,-9.59426357188;医,-10.7122939464;淄,-8.20796921077;晉,-6.8874962446;額,-8.22249731133;黎,-8.2031730385;剑,-8.15643556065;还,-12.1592129293;內,-5.85476412692;闪,-12.4468950018;浯,-12.8523601099;葵,-12.8523601099;幹,-10.6010683113;裕,-10.7729185682;獻,-9.93458937782;偽,-9.69535968876;凼,-10.5497750169;长,-4.34693590209;图,-8.38072131654;龍,-6.40188968776;希,-5.94961737275;吐,-6.75428582774;邓,-8.18421512476;馮,-10.9064499609;枝,-9.21477395018;碣,-12.1592129293;锦,-7.28210902787;瀨,-10.6010683113;辉,-9.57521537691;戴,-12.8523601099;康,-8.24718992392;禹,-8.91077830224;汀,-9.53817410523;橄,-11.7537478212;蛇,-10.4100130745;應,-9.11469049162;荊,-6.29132944401;奎,-10.111520086;郓,-8.78333335567;青,-5.3722138515;屠,-13.5455072905;盧,-7.50287445678;褒,-12.1592129293;發,-12.1592129293;蘇,-4.51752847608;尋,-11.1476120177;莊,-8.15187974411;朝,-5.67419608714;舟,-8.3470102592;紡,-11.5995971414;鬥,-9.71686589398;京,-5.94111094167;榮,-9.96198835201;酉,-10.8374570894;夹,-9.96198835201;流,-9.59426357188;賀,-8.05244584713;桃,-7.98098688314;位,-12.8523601099;屋,-13.5455072905;菊,-11.4660657488;道,-8.47660308825;单,-11.4660657488;葛,-8.43351950211;兩,-7.2447214958;賽,-10.8374570894;豫,-7.14691235593;潭,-11.2429221975;滬,-10.5009848527;寺,-10.7122939464;沁,-7.66777150869;枇,-12.8523601099;悉,-8.61103335734;舊,-8.18421512476;宏,-11.3482827131;唐,-7.27074526922;澗,-10.111520086;薛,-13.5455072905;岡,-8.47033347523;素,-10.4100130745;爪,-8.10742798154;亭,-12.4468950018;德,-4.5794064331;夸,-10.9064499609;喻,-12.8523601099;县,-13.5455072905;水,-7.81865954288;慈,-9.52015559973;绍,-7.1353324085;彌,-11.936069378;杜,-8.91077830224;聞,-10.2133027803;峡,-10.3674534601;孤,-10.6551355326;龐,-12.1592129293;全,-10.6010683113;闻,-10.2133027803;空,-10.5497750169;国,-8.72522572486;亂,-11.5995971414;樅,-11.0606006407;羌,-8.86337606334;向,-9.16348065579;果,-10.1443099088;簡,-13.5455072905;綠,-10.980557933;红,-7.06853492758;霧,-9.37112002057;钦,-9.43463342629;努,-10.0191467659;中,-2.05143850035;新,-4.62538553859;淀,-10.0797713877;筏,-12.4468950018;风,-11.4660657488;鑑,-10.111520086;衙,-9.65368699236;荟,-13.5455072905;瓦,-8.84502692467;赫,-9.04569762014;鋪,-8.66270536788;森,-13.5455072905;曲,-7.48405037154;島,-11.4660657488;迁,-10.3266314656;白,-5.98178762205;郾,-12.4468950018;一,-7.81540750749;戈,-10.6010683113;閬,-10.111520086;鞑,-13.5455072905;冕,-10.4100130745;御,-12.1592129293;索,-8.00817302345;妥,-13.5455072905;堤,-13.5455072905;璧,-11.4660657488;溫,-6.90824925918;芳,-11.5995971414;岷,-8.12055727298;容,-10.1782114605;夺,-13.5455072905;琼,-8.14734458895;濁,-12.1592129293;擇,-12.8523601099;扈,-10.980557933;巍,-10.6010683113;燕,-6.72004725421;達,-7.37799079958;泗,-8.29323386242;橘,-12.4468950018;楚,-7.35929866657;捞,-12.1592129293;翡,-12.4468950018;姥,-13.5455072905;硤,-11.7537478212;坦,-8.2776491314;蕲,-10.2874107524;对,-12.4468950018;電,-12.4468950018;闽,-7.45419740839;呼,-7.53424011606;漁,-11.936069378;涂,-11.2429221975;納,-8.64023251203;鄰,-12.8523601099;垦,-10.7122939464;朱,-10.1443099088;潁,-9.37112002057;什,-9.96198835201;草,-11.0606006407;鳌,-11.4660657488;盐,-7.96201098168;歙,-9.40237256407;廠,-12.4468950018;巢,-8.52162676962;奥,-6.28287868949;壤,-13.5455072905;韦,-10.3266314656;東,-4.33977753105;登,-7.85853193413;避,-9.93458937782;梅,-7.93970522417;文,-7.44518833845;昆,-6.03179804263;福,-5.17310868395;騎,-10.3674534601;邕,-9.83193522376;佛,-6.93078169026;舞,-9.69535968876;张,-6.94427717174;宣,-7.80571437829;瘦,-10.6551355326;沭,-9.1387880432;帶,-12.8523601099;爾,-12.4468950018;滁,-9.52015559973;襄,-6.44713165188;拉,-6.34210176938;聊,-9.06817047599;监,-9.90792113074;湖,-4.9621518968;蓝,-8.28801191844;獨,-8.50855468805;杰,-10.9064499609;巷,-11.0606006407;并,-8.67030996727;竹,-9.90792113074;學,-10.9064499609;瀾,-8.0240463726;丁,-10.1443099088;澀,-12.4468950018;沂,-8.69347702655;弋,-10.1443099088;對,-12.4468950018;夏,-7.94338846959;蠡,-10.6010683113;準,-7.46328838009;望,-8.56190066876;鸡,-8.95038744033;利,-7.25393815091;厨,-12.1592129293;漫,-10.980557933;蒲,-9.48506427992;確,-9.37112002057;齋,-11.5995971414;卓,-10.980557933;翠,-9.78430717477;延,-6.43236518176;壺,-9.35585254844;範,-10.7122939464;貓,-10.2874107524;欒,-10.6010683113;且,-9.45116272824;鄖,-8.45175708966;鐘,-8.67797284001;颛,-12.1592129293;宝,-7.11096077168;撣,-10.8374570894;枥,-12.4468950018;涩,-12.4468950018;伪,-9.69535968876;堰,-9.5565232439;岳,-8.19364915699;芷,-10.5497750169;方,-8.92053447718;机,-12.4468950018;派,-12.8523601099;屈,-11.7537478212;齊,-8.78333335567;桐,-7.589669921;賓,-9.12666668267;乔,-9.32599958529;狗,-13.5455072905;兖,-8.24718992392;员,-12.8523601099;飛,-9.52015559973;廟,-8.48291225744;查,-10.0191467659;汨,-10.0191467659;郫,-10.5009848527;班,-9.48506427992;钓,-8.67797284001;駱,-10.0797713877;鳳,-7.26324054357;念,-10.1443099088;年,-10.1443099088;慶,-8.5482950167;滿,-6.32367146518;厂,-12.4468950018;的,-9.46796984656;馆,-8.73332293509;鴉,-12.8523601099;羊,-8.75801554768;漕,-10.2133027803;五,-6.8521836222;列,-8.45791095523;错,-12.1592129293;鸟,-12.4468950018;倫,-5.87881709039;單,-11.4660657488;礱,-13.5455072905;張,-6.94427717174;户,-10.5497750169;终,-9.93458937782;改,-12.8523601099;蒸,-13.5455072905;螺,-11.7537478212;欽,-9.43463342629;雄,-10.1443099088;何,-12.4468950018;留,-9.71686589398;孝,-8.18421512476;渤,-8.3470102592;惠,-7.87218402329;董,-12.1592129293;婺,-8.78333335567;来,-8.95038744033;浩,-9.57521537691;火,-8.85415940824;迪,-5.53947311172;独,-8.50855468805;米,-7.55154586316;维,-6.8608955628;邁,-9.96198835201;儀,-9.09115999421;閃,-12.4468950018;堆,-11.7537478212;芍,-12.8523601099;茌,-12.4468950018;井,-7.9287361928;甘,-5.99747832053;龟,-8.028054394;沩,-11.936069378;醫,-10.7122939464;个,-9.06817047599;获,-10.5009848527;耶,-8.24718992392;攸,-10.7729185682;便,-11.5995971414;郁,-12.8523601099;雅,-6.53429330312;鹊,-10.0797713877;苍,-9.04569762014;柏,-6.76558538299;後,-8.01607820295;滕,-12.1592129293;受,-12.8523601099;胡,-10.2133027803;桦,-10.2496704245;鉛,-9.80783767218;轩,-11.4660657488;绵,-8.35812148463;聶,-11.4660657488;智,-7.79930409993;汾,-8.16101222768;冀,-7.42520987152;尉,-10.2133027803;舍,-13.5455072905;树,-10.1782114605;北,-3.63748005789;閘,-9.65368699236;宜,-6.73646798442;怡,-12.8523601099;膠,-8.06904373853;蔣,-13.5455072905;抢,-12.1592129293;春,-10.5009848527;欧,-4.6646436806;溪,-8.92053447718;鹳,-11.1476120177;報,-11.1476120177;漿,-10.1443099088;沾,-10.6010683113;净,-12.1592129293;廊,-9.5565232439;才,-12.4468950018;杏,-9.22801917693;桑,-8.36372374017;槐,-13.5455072905;諒,-10.2133027803;南,-3.9866955319;淨,-12.1592129293;八,-8.15187974411;仪,-9.09115999421;瓮,-9.18879846378;称,-13.5455072905;絳,-11.2429221975;捷,-6.96348215157;胶,-8.06904373853;秋,-12.4468950018;泾,-8.43351950211;鄂,-7.03822957808;各,-11.4660657488;渭,-7.21222766233;椒,-10.5497750169;邗,-8.981159099;化,-10.7729185682;採,-10.2133027803;梧,-8.72522572486;洪,-7.32890118938;箱,-11.1476120177;騰,-8.66270536788;纳,-8.64023251203;茶,-9.18879846378;格,-7.34702857397;沿,-10.7122939464;漾,-10.9064499609;壇,-13.5455072905;筆,-10.4544648371;嵊,-9.67430627956;李,-9.37112002057;仓,-10.5497750169;骑,-10.3674534601;日,-4.08807249302;武,-5.34907047923;浪,-11.2429221975;凭,-9.85662783635;瓯,-9.5565232439;櫻,-10.2874107524;銀,-7.50525257919;沔,-11.936069378;鎖,-12.8523601099;递,-12.8523601099;從,-9.29701204842;亨,-11.5995971414;别,-12.4468950018;涪,-8.6856948861;鄭,-4.54576450064;启,-8.8005751621;鬱,-12.8523601099;达,-7.37799079958;十,-8.38645199125;硇,-11.5995971414;密,-7.07161659411;廈,-6.95109383072;手,-13.5455072905;饶,-11.936069378;角,-9.1387880432;魏,-8.56190066876;静,-9.04569762014;盘,-8.79191709936;驛,-11.5995971414;祝,-12.4468950018;佩,-10.9064499609;滨,-7.95452030996;六,-7.35519188461;瑯,-10.980557933;平,-6.28639116237;峴,-11.1476120177;書,-9.38662420711;旺,-13.5455072905;俾,-9.90792113074;明,-8.10742798154;输,-9.45116272824;團,-9.34081467108;宛,-9.41837290542;额,-8.22249731133;夜,-10.7122939464;挠,-11.1476120177;枣,-9.1387880432;炭,-12.4468950018;粵,-8.2776491314;戶,-10.5497750169;暹,-9.10285603398;涿,-8.58968023287;渾,-8.23230131142;埃,-5.82548935003;遂,-8.63285240473;铅,-9.80783767218;婆,-10.3266314656;廉,-11.936069378;藏,-10.5497750169;虎,-7.79611430456;歐,-4.6646436806;法,-4.50039539786;浔,-9.96198835201;雙,-8.10742798154;繞,-11.5995971414;叫,-11.5995971414;豪,-13.5455072905;热,-8.10742798154;公,-9.18879846378;莒,-10.0797713877;懷,-8.07744714933;扶,-8.20796921077;曹,-8.92053447718;楼,-8.82700841917;湾,-9.43463342629;圃,-11.1476120177;琅,-10.980557933;善,-10.980557933;骆,-10.0797713877;縉,-9.88194564434;韃,-13.5455072905;漓,-9.21477395018;庞,-12.1592129293;营,-8.47660308825;温,-6.90824925918;猫,-10.2874107524;穆,-13.5455072905;冬,-10.1782114605;唯,-12.8523601099;皮,-10.4100130745;稱,-13.5455072905;鶴,-8.55507470369;珀,-10.9064499609;奇,-10.0797713877;项,-9.37112002057;棒,-12.8523601099;汕,-8.15187974411;兗,-8.24718992392;姜,-11.3482827131;藤,-11.1476120177;陽,-7.14857763525;卫,-9.88194564434;目,-13.5455072905;飲,-13.5455072905;巴,-4.37411566863;虹,-8.74971674487;死,-13.5455072905;崆,-9.61368165774;須,-11.5995971414;蒋,-13.5455072905;融,-8.45791095523;昌,-7.69330481069;涑,-10.6010683113;梓,-12.8523601099;錯,-12.1592129293;瀘,-7.68187611487;岛,-11.4660657488;溧,-9.57521537691;簰,-11.1476120177;興,-6.86842382922;治,-8.45175708966;辽,-5.5177044421;調,-10.048999729;隴,-7.74037232155;坂,-13.5455072905;织,-10.2496704245;蓋,-9.15105813579;苏,-4.51752847608;跑,-11.2429221975;豐,-8.23723959307;毕,-9.93458937782;詔,-11.0606006407;博,-7.44518833845;竟,-9.78430717477;神,-7.65940325902;浦,-7.07316099597;驴,-12.8523601099;锁,-12.8523601099;包,-7.98867922877;郭,-9.99015922898;蚌,-8.74971674487;府,-8.47660308825;蔡,-13.5455072905;润,-9.12666668267;梨,-10.980557933;含,-11.7537478212;圭,-8.89154694031;伽,-10.4544648371;哀,-9.7388448007;灃,-10.7729185682;獅,-9.21477395018;奉,-7.55905528518;浑,-8.23230131142;桓,-10.5009848527;煙,-7.57679973048;彝,-12.4468950018;頤,-8.20796921077;荥,-8.42751347805;湧,-11.5995971414;鳴,-10.2874107524;統,-13.5455072905;峰,-11.936069378;时,-11.1476120177;乾,-9.83193522376;郟,-10.5497750169;享,-11.1476120177;銅,-7.9107176873;将,-11.2429221975;斋,-11.5995971414;邙,-9.90792113074;刚,-8.0240463726;报,-11.1476120177;澧,-9.20170186861;横,-7.41863810635;环,-8.45175708966;苜,-13.5455072905;岱,-10.048999729;細,-12.4468950018;搶,-12.1592129293;栾,-10.6010683113;铁,-8.43351950211;陂,-13.5455072905;奈,-9.40237256407;菏,-9.02371871342;察,-8.94033710448;塞,-6.94836158858;若,-9.93458937782;鼓,-10.3674534601;可,-9.83193522376;遮,-12.4468950018;干,-10.6010683113;潼,-7.18420481289;喀,-6.4315511809;皂,-11.936069378;玄,-7.71362481318;妈,-9.65368699236;骊,-9.71686589398;民,-8.39221569597;霍,-8.58968023287;互,-11.7537478212;帝,-10.980557933;龜,-8.028054394;增,-10.1782114605;匯,-12.8523601099;炮,-9.80783767218;珲,-9.52015559973;丽,-8.22249731133;直,-7.1386273044;元,-8.31439867361;盂,-11.936069378;楓,-9.88194564434;軒,-11.4660657488;比,-6.74980151529;孟,-7.54905520185;飞,-9.52015559973;葡,-7.04722514099;无,-6.91482390482;櫪,-12.4468950018;山,-4.41811383931;女,-10.9064499609;濼,-13.5455072905;袁,-11.2429221975;沪,-10.5009848527;内,-5.85476412692;安,-5.14193082584;養,-13.5455072905;萌,-10.7729185682;榕,-10.4544648371;圖,-8.38072131654;刘,-8.774822666;四,-5.12196565513;墟,-12.1592129293;許,-6.94156346587;沧,-7.79930409993;伦,-5.87881709039;让,-13.5455072905;邯,-7.8687534882;献,-9.93458937782;破,-10.7729185682;勃,-9.24144219726;蘊,-12.4468950018;鯉,-13.5455072905;藍,-8.28801191844;濑,-10.6010683113;乐,-7.59226395618;浒,-10.980557933;靖,-8.63285240473;珙,-11.7537478212;绛,-11.2429221975;党,-10.7729185682;川,-7.43182511063;臥,-7.93603549528;车,-8.00032984599;科,-6.77357173463;郯,-10.1443099088;鹰,-11.4660657488;舒,-11.936069378;任,-10.5497750169;還,-12.1592129293;將,-11.2429221975;蘋,-10.980557933;莎,-8.95038744033;休,-9.26884117145;源,-11.936069378;樓,-8.82700841917;鸛,-11.1476120177;鲜,-12.4468950018;鎮,-6.8484730428;網,-11.4660657488;架,-11.7537478212;设,-10.8374570894;雀,-10.9064499609;等,-9.48506427992;晋,-6.8874962446;里,-6.89652274044;鵝,-9.63348428504;条,-11.4660657488;迦,-8.29323386242;灯,-10.3674534601;绰,-10.9064499609;鷲,-10.111520086;磴,-11.1476120177;傅,-12.1592129293;鄄,-10.6551355326;枋,-11.7537478212;云,-5.40490024761;讓,-13.5455072905;通,-6.96903772142;肥,-9.63348428504;涧,-10.111520086;渦,-9.80783767218;垫,-12.1592129293;株,-8.45791095523;甬,-10.0797713877;冯,-10.9064499609;陶,-10.2874107524;头,-11.4660657488;沽,-12.4468950018;洼,-11.2429221975;雁,-8.15643556065;剡,-11.5995971414;冊,-12.8523601099;叠,-12.4468950018;扎,-7.90006039282;滑,-8.86337606334;佐,-9.7388448007;棕,-9.85662783635;務,-12.4468950018;胥,-12.1592129293;书,-9.38662420711;荷,-6.37538774702;凯,-9.45116272824;彰,-8.83597708915;苹,-10.980557933;泽,-10.1443099088;磁,-9.29701204842;崇,-8.03611895384;庆,-8.5482950167;墊,-12.1592129293;萍,-9.41837290542;薌,-12.8523601099;意,-5.52457957148;渑,-9.48506427992;皖,-8.41560857554;亦,-11.5995971414;喬,-9.32599958529;鄯,-8.9605398118;船,-10.111520086;掸,-10.8374570894;涼,-9.04569762014;練,-11.936069378;千,-8.90111639132;细,-12.4468950018;旌,-10.8374570894;运,-8.84502692467;盖,-9.15105813579;牙,-8.47660308825;蟠,-10.5497750169;荣,-9.96198835201;滦,-8.36935755789;狮,-9.21477395018;轻,-10.8374570894;汽,-12.1592129293;西,-4.0693470929;諾,-8.54156098452;禁,-10.980557933;砀,-9.24144219726;羅,-5.2855316307;鄆,-8.78333335567;合,-7.04271724455;憑,-9.85662783635;撓,-11.1476120177;昔,-11.3482827131;外,-8.06904373853;邛,-9.24144219726;鮮,-12.4468950018;沣,-10.7729185682;欢,-8.94033710448;两,-7.2447214958;薩,-7.69330481069;萨,-7.69330481069;未,-10.048999729;箭,-9.96198835201;熱,-8.10742798154;阴,-7.99254770554;永,-6.03507673409;莽,-12.4468950018;放,-13.5455072905;呈,-12.4468950018;棋,-11.7537478212;坊,-12.1592129293;滏,-9.52015559973;济,-6.59949329937;荒,-10.980557933;祖,-11.5995971414;藩,-8.49565128322;士,-12.4468950018;马,-5.32672013486;凱,-9.45116272824;獲,-10.5009848527;噴,-12.4468950018;菽,-12.1592129293;礁,-12.4468950018;缅,-6.96764593275;庄,-8.15187974411;切,-10.0191467659;黟,-10.4544648371;踏,-12.8523601099;排,-11.2429221975;首,-9.26884117145;岘,-11.1476120177;瀛,-9.67430627956;龚,-13.5455072905;交,-9.11469049162;鄱,-7.78031618768;吳,-7.47016125938;嚴,-8.64023251203;费,-7.89653305231;总,-12.1592129293;祁,-7.36756317642;黄,-4.67386162296;准,-7.46328838009;哈,-6.21444698525;插,-13.5455072905;棠,-13.5455072905;硫,-13.5455072905;共,-9.65368699236;史,-10.111520086;围,-12.4468950018;泸,-7.68187611487;弄,-12.8523601099;譙,-13.5455072905;戒,-11.7537478212;朔,-9.57521537691;宗,-11.0606006407;军,-9.25504784932;吞,-11.5995971414;第,-9.02371871342;铜,-7.9107176873;邱,-12.4468950018;吉,-6.09600928508;讷,-9.78430717477;油,-11.5995971414;壁,-12.8523601099;歌,-11.936069378;豎,-12.4468950018;硖,-11.7537478212;祥,-9.03464778395;勝,-11.1476120177;費,-7.89653305231;瑞,-5.92725619259;裡,-6.89652274044;楠,-12.8523601099;以,-6.94291939828;潤,-9.12666668267;徽,-11.7537478212;兰,-6.75653554747;社,-11.4660657488;柿,-12.8523601099;码,-12.1592129293;藁,-10.8374570894;径,-11.7537478212;琉,-8.63285240473;伏,-7.2859258264;芒,-10.3266314656;土,-6.43236518176;校,-13.5455072905;严,-8.64023251203;澤,-10.1443099088;悦,-11.4660657488;夫,-8.59674740009;週,-7.49577383523;冰,-8.49565128322;申,-10.3674534601;氹,-10.5497750169;人,-8.29323386242;秀,-9.65368699236;鹅,-9.63348428504;升,-12.1592129293;囊,-13.5455072905;拒,-9.99015922898;字,-13.5455072905;渥,-10.1443099088;廚,-12.1592129293;衡,-7.67621037733;赣,-7.46100787739;摩,-7.1552666234;寬,-10.0191467659;陵,-8.88206819635;歷,-8.91077830224;板,-9.11469049162;宁,-5.91942453239;稀,-9.61368165774;射,-9.90792113074;成,-5.85065921808;伯,-7.90715262113;龙,-6.40188968776;钟,-8.67797284001;霞,-10.8374570894;蘆,-10.2874107524;鄲,-10.3266314656;琴,-12.4468950018;贺,-8.05244584713;练,-11.936069378;陈,-9.06817047599;桌,-10.3674534601;面,-13.5455072905;策,-11.3482827131;遜,-13.5455072905;非,-5.68725310828;代,-10.8374570894;汤,-8.17486926234;蕪,-7.93603549528;秭,-9.41837290542;闵,-9.29701204842;松,-6.49973071359;布,-6.39559045433;如,-8.56190066876;紅,-7.06853492758;历,-8.91077830224;眉,-9.50245602263;疊,-12.4468950018;谏,-12.1592129293;澎,-8.5482950167;易,-8.73332293509;缙,-9.88194564434;順,-8.01607820295;次,-13.5455072905;渣,-10.8374570894;津,-8.36372374017;暨,-11.936069378;微,-9.65368699236;阳,-7.14857763525;冲,-8.90111639132;电,-12.4468950018;魁,-8.86337606334;益,-8.5482950167;峄,-12.8523601099;盈,-10.2874107524;橋,-9.80783767218;镶,-10.4100130745;迎,-11.5995971414;晓,-10.6010683113;敕,-10.6551355326;塗,-11.2429221975;默,-13.5455072905;牛,-8.16101222768;線,-11.936069378;瑟,-13.5455072905;歡,-8.94033710448;壬,-13.5455072905;屯,-8.83597708915;危,-8.82700841917;陳,-9.06817047599;滸,-10.980557933;淺,-10.9064499609;突,-8.24718992392;頂,-12.8523601099;鲅,-10.980557933;約,-7.78031618768;分,-9.05687092073;圈,-9.5565232439;吊,-11.2429221975;与,-12.4468950018;怒,-8.31976061675;庙,-8.48291225744;玛,-8.11616166151;尚,-10.0191467659;木,-9.46796984656;宫,-10.048999729;碭,-9.24144219726;礬,-13.5455072905;進,-12.8523601099;輸,-9.45116272824;显,-11.5995971414;采,-10.2133027803;牆,-12.8523601099;遵,-8.00032984599;告,-11.3482827131;恒,-8.97079631196;衢,-9.03464778395;泥,-10.6551355326;赤,-7.30913770026;杨,-8.40970885342;緯,-10.4544648371;印,-4.4523751194;石,-5.98178762205;滹,-8.62552636464;能,-13.5455072905;威,-6.78741278604;简,-13.5455072905;嘉,-6.76331523446;于,-7.93237918408;猛,-10.9064499609;岚,-9.99015922898;农,-10.048999729;漣,-9.63348428504;芦,-10.2874107524;陆,-7.59486473788;頭,-11.4660657488;馬,-5.32672013486;累,-11.936069378;爱,-6.79557609668;琵,-10.980557933;丹,-6.34210176938;政,-9.80783767218;婁,-9.57521537691;節,-11.936069378;居,-8.35255043958;瓊,-8.14734458895;浏,-8.37502329543;从,-9.29701204842;提,-10.8374570894;竖,-12.4468950018;釜,-9.71686589398;啟,-8.8005751621;回,-7.74641463601;苦,-11.4660657488;孫,-10.3674534601;台,-4.84565926447;呵,-11.5995971414;風,-11.4660657488;泺,-13.5455072905;曾,-8.64023251203;鮁,-10.980557933;宅,-13.5455072905;娄,-9.57521537691;皇,-7.85514783614;醉,-10.980557933;斑,-12.8523601099;店,-10.2496704245;崖,-11.7537478212;妙,-10.6551355326;超,-10.7122939464;阜,-7.78031618768;鄞,-9.83193522376;涡,-9.80783767218;漢,-6.05107707543;岫,-9.65368699236;挪,-6.89264426111;窯,-11.2429221975;炳,-10.4100130745;露,-13.5455072905;商,-6.27519440439;凉,-9.04569762014;半,-9.29701204842;乌,-5.77528408631;塘,-8.70922538351;孚,-12.8523601099;淡,-11.5995971414;池,-9.93458937782;潢,-9.96198835201;敦,-6.8978189169;端,-9.69535968876;饮,-13.5455072905;鉴,-10.111520086;拿,-10.8374570894;腾,-8.66270536788;焉,-7.90715262113;伍,-11.5995971414;二,-6.83864495386;题,-13.5455072905;琛,-11.936069378;定,-7.41428080098;贡,-9.16348065579;措,-12.1592129293;纬,-10.4544648371;禮,-10.4100130745;環,-8.45175708966;殺,-11.936069378;房,-8.31976061675;陇,-7.74037232155;光,-9.31140078587;潍,-8.74971674487;蟒,-11.0606006407;苔,-13.5455072905;坝,-10.4544648371;雜,-13.5455072905;牟,-10.5497750169;衣,-13.5455072905;顺,-8.01607820295;彭,-8.47033347523;廬,-7.82519551386;淶,-10.2496704245;诺,-8.54156098452;曼,-7.51964131664;承,-8.12055727298;鲁,-7.90006039282;市,-9.61368165774;理,-10.3266314656;炉,-13.5455072905;躍,-11.7537478212;栎,-12.1592129293;得,-8.64766749052;尖,-9.24144219726;墙,-12.8523601099;餘,-8.00424374531;原,-9.10285603398;航,-12.4468950018;钱,-7.42520987152;田,-8.56190066876;防,-9.10285603398;猴,-13.5455072905;錫,-7.55905528518;樺,-10.2496704245;鼋,-11.5995971414;吴,-7.47016125938;先,-11.2429221975;軍,-9.25504784932;诏,-11.0606006407;荔,-10.5009848527;志,-10.3674534601;靜,-9.04569762014;灞,-11.3482827131;浠,-11.3482827131;解,-9.59426357188;葦,-12.8523601099;巫,-8.41560857554;彬,-10.5009848527;确,-9.37112002057;汶,-8.95038744033;封,-10.2874107524;震,-12.8523601099;倉,-10.5497750169;冈,-8.47033347523;洋,-8.6856948861;不,-7.67057655961;黃,-4.67386162296;斐,-9.18879846378;弗,-8.33057153286;訥,-9.78430717477;紫,-7.69906851541;鸭,-8.0944688369;根,-10.6551355326;寄,-12.1592129293;均,-9.88194564434;燈,-10.3674534601;乍,-8.48291225744;行,-11.5995971414;腓,-9.29701204842;罗,-5.2855316307;秘,-7.46557409537;陝,-5.38813684928;象,-8.981159099;淠,-10.4544648371;恩,-8.74148624573;臨,-6.23295379236;鹭,-11.936069378;魯,-7.90006039282;关,-6.44713165188;雲,-5.40490024761;崂,-9.45116272824;禅,-12.1592129293;圆,-8.50855468805;玉,-6.94699826185;岗,-10.048999729;多,-7.03822957808;喝,-10.1782114605;渠,-10.111520086;庫,-7.73436629749;維,-6.8608955628;劳,-10.5009848527;甲,-11.5995971414;伶,-10.3674534601;施,-10.9064499609;翁,-10.8374570894;終,-9.93458937782;版,-10.8374570894;介,-10.048999729;联,-7.96955818732;盛,-8.49565128322;烟,-7.57679973048;信,-7.41863810635;习,-11.936069378;菩,-12.1592129293;陰,-7.99254770554;下,-7.47016125938;熊,-10.9064499609;轮,-9.90792113074;瀟,-8.54156098452;萧,-8.74971674487;集,-9.25504784932;堯,-10.7122939464;宮,-10.048999729;隰,-11.3482827131;谷,-8.16101222768;澶,-9.88194564434;蒼,-9.04569762014;耿,-11.7537478212;饅,-12.4468950018;之,-6.93078169026;泌,-10.6551355326;村,-9.61368165774;打,-12.8523601099;慕,-7.82847958906;孙,-10.3674534601;高,-6.12193884621;姚,-11.7537478212;瓜,-9.21477395018;珞,-12.8523601099;鹫,-10.111520086;自,-8.92053447718;顯,-11.5995971414;鸦,-12.8523601099;兵,-10.2496704245;郴,-9.37112002057;諸,-8.47660308825;开,-6.19949708055;喇,-13.5455072905;阆,-10.111520086;劉,-8.774822666;匈,-7.08873763489;逊,-13.5455072905;嶗,-9.45116272824;漠,-8.981159099;谢,-11.4660657488;茨,-10.3674534601;怪,-13.5455072905;岭,-9.65368699236;種,-12.8523601099;地,-6.57102837944;邵,-9.02371871342;磅,-13.5455072905;忠,-10.5009848527;勉,-13.5455072905;午,-7.90360021953;藥,-11.5995971414;站,-12.1592129293;镜,-9.0022125082;營,-8.47660308825;满,-6.32367146518;旧,-8.18421512476;择,-12.8523601099;快,-13.5455072905;鵬,-13.5455072905;积,-10.0191467659;盱,-9.12666668267;右,-9.10285603398;鑲,-10.4100130745;兴,-6.86842382922;歸,-9.7388448007;艾,-9.76131765655;項,-9.37112002057;禄,-9.57521537691;隆,-8.56877354805;涌,-11.5995971414;撒,-8.40970885342;崗,-10.048999729;官,-8.01211780174;喜,-7.54162022336;渡,-8.86337606334;澠,-9.48506427992;貢,-9.16348065579;醴,-9.34081467108;樹,-10.1782114605;许,-6.94156346587;螞,-12.4468950018;落,-9.41837290542;於,-7.93237918408;繁,-10.5497750169;镇,-6.8484730428;盆,-10.0191467659;鸣,-10.2874107524;坛,-13.5455072905;關,-6.44713165188;勞,-10.5009848527;乡,-13.5455072905;濠,-12.4468950018;正,-7.82847958906;波,-5.34220326367;桥,-9.80783767218;結,-11.7537478212;緬,-6.96764593275;即,-9.38662420711;哲,-9.53817410523;灵,-7.45419740839;海,-5.2532091834;詹,-12.1592129293;诸,-8.47660308825;
+B,nt:沃,-10.4463785432;羅,-7.92064989891;皇,-11.1395257238;罗,-7.92064989891;合,-7.7722298938;济,-8.50046839417;伊,-7.45064626967;鞍,-10.4463785432;希,-7.45064626967;芬,-9.0600841821;财,-3.90534854403;抗,-7.1882820052;外,-4.93496796121;香,-5.08743655486;超,-8.94230114645;鎮,-9.75323136266;宝,-6.68517842753;东,-4.74760861039;漢,-8.19508674462;焦,-10.4463785432;閩,-7.26832471287;长,-5.67146558265;撫,-9.0600841821;挪,-7.92064989891;央,-7.84368885778;铁,-6.27971331942;辉,-8.74163045098;岳,-8.19508674462;網,-8.30631237973;临,-8.94230114645;康,-7.26832471287;興,-8.74163045098;方,-10.0409134351;永,-9.19361557473;强,-9.75323136266;辽,-7.22750271835;社,-6.05192938855;臨,-8.94230114645;商,-3.61065646714;觉,-9.19361557473;龍,-8.00403150785;默,-9.34776625455;齊,-10.4463785432;反,-11.1395257238;乌,-7.96147189343;经,-6.72068511599;昌,-10.4463785432;科,-7.67378982098;豐,-8.09500328606;賓,-8.24915396589;青,-5.61009663627;陆,-7.1882820052;乔,-10.0409134351;杜,-8.83694063079;兖,-11.1395257238;飛,-8.74163045098;博,-11.1395257238;保,-8.57457636632;质,-8.04848327042;统,-7.84368885778;煤,-8.94230114645;遠,-7.7722298938;苏,-5.18628238949;覺,-9.19361557473;知,-9.75323136266;鹤,-10.4463785432;敦,-8.36693700154;早,-8.09500328606;稅,-7.88142918576;语,-9.19361557473;马,-8.30631237973;苯,-10.0409134351;深,-4.18298028063;鋼,-11.1395257238;壳,-8.74163045098;溫,-10.4463785432;阿,-6.50479673555;慶,-11.1395257238;达,-9.75323136266;绿,-8.94230114645;馬,-8.30631237973;包,-8.43147552268;麗,-7.35533608986;万,-8.50046839417;雀,-9.34776625455;沈,-7.7722298938;霍,-7.58417766229;二,-8.65461907399;戏,-10.4463785432;金,-7.52860781114;五,-9.75323136266;列,-8.30631237973;首,-7.42595365708;衛,-5.41921394717;厚,-11.1395257238;朝,-6.36040223067;瑞,-6.10257312137;波,-6.08327991843;無,-11.1395257238;英,-3.88181804662;交,-5.06188348043;网,-8.30631237973;天,-5.64235749849;墨,-8.57457636632;倫,-6.39459359542;宪,-7.55600678533;圭,-10.4463785432;京,-6.84906628263;搜,-11.1395257238;環,-9.75323136266;吳,-10.4463785432;莲,-7.47596407765;音,-5.90841710693;冶,-10.4463785432;紹,-11.1395257238;总,-9.53008781135;運,-9.75323136266;房,-10.0409134351;理,-8.94230114645;達,-9.75323136266;参,-10.0409134351;滄,-9.34776625455;光,-6.2567238012;哈,-5.45594595644;洪,-9.19361557473;救,-10.0409134351;道,-9.34776625455;索,-9.19361557473;晉,-6.87684584674;黔,-7.7722298938;教,-8.94230114645;葛,-8.36693700154;拜,-7.42595365708;也,-10.4463785432;惠,-9.34776625455;衣,-11.1395257238;空,-7.96147189343;邯,-11.1395257238;秦,-8.19508674462;防,-7.7055385193;火,-7.7055385193;迪,-7.67378982098;杭,-8.30631237973;廬,-11.1395257238;劉,-8.30631237973;淮,-10.4463785432;共,-7.06198827988;泰,-7.92064989891;米,-9.34776625455;菲,-8.65461907399;獵,-8.57457636632;直,-7.96147189343;时,-8.43147552268;贵,-6.98064264042;基,-7.01239133874;披,-11.1395257238;广,-5.06188348043;鲁,-8.09500328606;攀,-11.1395257238;昂,-9.75323136266;喀,-11.1395257238;悉,-8.94230114645;開,-8.19508674462;上,-3.7518164847;劍,-5.94656887289;唐,-8.65461907399;經,-6.72068511599;第,-6.59623094151;宗,-10.4463785432;高,-6.27199127333;沙,-8.83694063079;甘,-10.0409134351;军,-5.95774217349;刚,-11.1395257238;芝,-5.89250165162;牛,-5.98623412928;長,-5.67146558265;財,-3.90534854403;綜,-8.09500328606;用,-10.4463785432;赞,-11.1395257238;航,-7.37832560809;河,-4.9229196227;环,-9.75323136266;沱,-10.4463785432;嘉,-8.83694063079;戲,-10.4463785432;機,-7.7055385193;德,-5.377474341;耶,-6.77007787131;纽,-5.44243223728;石,-6.45739449666;水,-8.04848327042;税,-7.88142918576;時,-8.43147552268;雅,-11.1395257238;恆,-9.75323136266;绍,-11.1395257238;柏,-10.4463785432;郑,-5.38378351019;協,-7.84368885778;聖,-10.4463785432;敘,-9.19361557473;富,-6.6621889093;蘭,-7.88142918576;勝,-7.42595365708;作,-9.19361557473;濟,-8.50046839417;塞,-9.53008781135;裡,-9.34776625455;民,-4.79564528966;解,-6.98064264042;机,-7.7055385193;以,-6.87684584674;寧,-8.83694063079;全,-4.38725534764;可,-8.24915396589;格,-6.82203761025;兰,-7.88142918576;绵,-11.1395257238;智,-8.94230114645;国,-2.55355301697;布,-10.4463785432;老,-9.75323136266;冀,-7.26832471287;清,-4.99964117156;厄,-9.0600841821;吉,-6.46669688932;柯,-9.53008781135;黃,-6.05192938855;伏,-9.34776625455;少,-8.65461907399;北,-3.57684447706;黎,-7.7722298938;愛,-6.98064264042;亚,-5.77354970876;渝,-7.35533608986;洛,-7.61316519917;土,-8.65461907399;怡,-10.4463785432;東,-4.74760861039;抚,-9.0600841821;春,-9.75323136266;群,-11.1395257238;欧,-4.4205125694;紫,-6.87684584674;中,-1.39744007779;伯,-7.7055385193;粮,-9.0600841821;冰,-7.67378982098;申,-9.53008781135;韓,-6.37735178898;真,-11.1395257238;強,-9.75323136266;人,-4.43022138352;丽,-7.35533608986;殼,-8.74163045098;精,-10.4463785432;林,-9.53008781135;俄,-5.72342532158;湘,-7.31088432729;綠,-8.94230114645;汉,-8.19508674462;重,-6.5145529105;克,-7.50193956406;韶,-9.53008781135;前,-11.1395257238;双,-8.65461907399;住,-8.65461907399;郎,-9.75323136266;桑,-10.4463785432;駐,-10.4463785432;红,-6.02153191137;陕,-7.07908271324;比,-8.74163045098;南,-4.79388936295;秘,-8.83694063079;李,-9.53008781135;九,-6.79572030193;远,-7.7722298938;孟,-11.1395257238;飞,-8.74163045098;葡,-8.50046839417;无,-11.1395257238;团,-8.57457636632;語,-9.19361557473;古,-7.64301816232;摩,-9.75323136266;巨,-9.75323136266;八,-7.16923381023;柬,-8.19508674462;药,-6.74507656911;曼,-8.24915396589;山,-6.10257312137;温,-10.4463785432;关,-6.21227203862;粤,-9.0600841821;創,-7.13219253855;捷,-9.75323136266;银,-9.53008781135;非,-7.4018561055;固,-11.1395257238;白,-8.74163045098;联,-3.61065646714;宁,-8.83694063079;一,-7.26832471287;鄂,-9.19361557473;内,-6.67361760513;射,-10.0409134351;最,-6.12889042969;安,-7.13219253855;爭,-11.1395257238;贊,-11.1395257238;同,-6.94987098176;猎,-8.57457636632;成,-7.42595365708;库,-11.1395257238;匯,-5.97473974986;化,-8.94230114645;龙,-8.00403150785;刘,-8.30631237973;邮,-8.94230114645;招,-4.72606676661;坚,-10.4463785432;沧,-9.34776625455;伦,-6.39459359542;義,-8.43147552268;庫,-11.1395257238;太,-7.04518116156;維,-8.14379345023;萬,-8.50046839417;肯,-8.30631237973;莱,-8.30631237973;丰,-8.09500328606;劳,-7.28937812207;甲,-10.0409134351;吴,-10.4463785432;猶,-11.1395257238;麻,-7.09647445595;神,-7.84368885778;施,-9.0600841821;尼,-8.57457636632;缅,-8.19508674462;旅,-9.0600841821;築,-9.34776625455;藍,-10.0409134351;監,-10.4463785432;烏,-7.96147189343;华,-4.8151667614;兒,-7.92064989891;燕,-5.95213991794;塔,-8.30631237973;叙,-9.19361557473;日,-4.48666269443;四,-5.43908215039;党,-5.03920677176;钢,-11.1395257238;烟,-8.65461907399;杞,-10.4463785432;信,-6.93483310439;廣,-5.06188348043;工,-10.0409134351;糧,-9.0600841821;坦,-11.1395257238;韩,-6.37735178898;總,-9.53008781135;武,-5.97473974986;硬,-10.0409134351;纳,-11.1395257238;维,-8.14379345023;政,-8.09500328606;華,-4.8151667614;对,-8.24915396589;陸,-7.1882820052;電,-9.75323136266;闽,-7.26832471287;呼,-10.4463785432;松,-8.94230114645;銀,-9.53008781135;七,-8.00403150785;浪,-10.4463785432;紅,-6.02153191137;得,-8.94230114645;弗,-8.04848327042;蘋,-8.65461907399;熊,-11.1395257238;复,-5.95774217349;和,-10.4463785432;小,-11.1395257238;美,-2.97387779848;休,-10.4463785432;庐,-11.1395257238;易,-9.19361557473;浦,-5.44579358498;创,-7.13219253855;贝,-8.74163045098;辛,-10.0409134351;瀟,-10.4463785432;实,-11.1395257238;加,-6.34373517819;渣,-6.46669688932;津,-9.53008781135;潇,-10.4463785432;厦,-6.08966971653;暨,-6.94987098176;鄭,-5.38378351019;微,-8.00403150785;朱,-9.75323136266;新,-3.85059802926;阳,-8.04848327042;憲,-7.55600678533;电,-9.75323136266;貴,-6.98064264042;嶺,-8.09500328606;齐,-10.4463785432;宾,-8.24915396589;十,-10.0409134351;狀,-11.1395257238;越,-7.52860781114;汇,-5.97473974986;密,-9.0600841821;杉,-7.88142918576;廈,-6.08966971653;晋,-6.87684584674;城,-7.45064626967;筑,-9.34776625455;协,-7.84368885778;货,-8.43147552268;剛,-11.1395257238;风,-9.19361557473;胜,-7.42595365708;江,-6.78281689709;卡,-10.0409134351;奥,-7.96147189343;實,-11.1395257238;黨,-5.03920677176;自,-7.02865185961;聯,-3.61065646714;遼,-7.22750271835;危,-10.0409134351;平,-6.2567238012;兵,-7.92064989891;寶,-6.68517842753;風,-9.19361557473;驻,-10.4463785432;現,-8.65461907399;开,-8.19508674462;約,-10.0409134351;文,-5.59044963889;昆,-7.58417766229;争,-11.1395257238;匈,-9.75323136266;宋,-9.0600841821;萊,-8.30631237973;娃,-8.36693700154;福,-5.80680693052;明,-10.4463785432;云,-5.90841710693;酒,-9.19361557473;世,-4.86476370254;團,-8.57457636632;供,-8.36693700154;通,-6.12224588697;貝,-8.74163045098;蘇,-5.18628238949;舞,-9.19361557473;切,-9.19361557473;田,-9.75323136266;陝,-7.07908271324;莫,-6.33550467905;株,-10.0409134351;岭,-8.09500328606;斯,-6.70870892494;花,-5.73235395232;地,-7.61316519917;澳,-6.46669688932;進,-8.83694063079;梵,-11.1395257238;犹,-11.1395257238;粵,-9.0600841821;玻,-10.4463785432;蒙,-7.52860781114;阜,-11.1395257238;綿,-11.1395257238;衡,-11.1395257238;參,-10.0409134351;桂,-11.1395257238;珠,-10.4463785432;拉,-10.0409134351;納,-11.1395257238;友,-10.0409134351;黑,-7.55600678533;监,-10.4463785432;佐,-10.4463785432;藥,-6.74507656911;恒,-9.75323136266;法,-5.35878220799;奔,-8.57457636632;紐,-5.44243223728;湖,-6.23425094534;仙,-10.4463785432;貨,-8.43147552268;进,-8.83694063079;黄,-6.05192938855;蓝,-10.0409134351;哥,-5.83622081572;奧,-7.96147189343;意,-7.24770542567;公,-5.88725229574;普,-6.82203761025;拱,-8.94230114645;印,-5.99203124697;柳,-10.0409134351;郵,-8.94230114645;兴,-8.74163045098;扶,-11.1395257238;苹,-8.65461907399;赫,-8.19508674462;百,-8.74163045098;威,-7.88142918576;综,-8.09500328606;堅,-10.4463785432;崇,-8.30631237973;庆,-11.1395257238;三,-6.43904535799;國,-2.55355301697;農,-5.3997328116;對,-8.24915396589;埃,-7.84368885778;夏,-8.83694063079;徐,-10.4463785432;魯,-8.09500328606;標,-9.0600841821;猛,-11.1395257238;蓮,-7.47596407765;浙,-5.90308376095;农,-5.3997328116;亞,-5.77354970876;圣,-10.4463785432;诺,-8.14379345023;大,-5.12336856408;约,-10.0409134351;利,-8.43147552268;輝,-8.74163045098;穆,-7.55600678533;喬,-10.0409134351;爱,-6.98064264042;现,-8.65461907399;雲,-5.90841710693;鐵,-6.27971331942;鶴,-10.4463785432;男,-11.1395257238;状,-11.1395257238;丹,-8.09500328606;儿,-7.92064989891;致,-7.55600678533;隔,-11.1395257238;荷,-7.15054167722;镇,-9.75323136266;义,-8.43147552268;軍,-5.95774217349;零,-10.4463785432;里,-9.34776625455;标,-9.0600841821;統,-7.84368885778;剑,-5.94656887289;运,-9.75323136266;汕,-9.75323136266;委,-10.0409134351;兗,-11.1395257238;牙,-9.53008781135;佛,-9.19361557473;關,-6.21227203862;勞,-7.28937812207;牡,-9.75323136266;濠,-11.1395257238;正,-9.53008781135;建,-4.58987498155;健,-10.0409134351;內,-6.67361760513;歐,-4.4205125694;陽,-8.04848327042;卫,-5.41921394717;質,-8.04848327042;緬,-8.19508674462;雙,-8.65461907399;台,-6.79572030193;佳,-8.65461907399;巴,-6.27199127333;海,-4.11398740914;延,-7.73832834212;特,-8.24915396589;司,-7.80732121361;煙,-8.65461907399;西,-5.18628238949;諾,-8.14379345023;
+B,nz:怀,-10.1263577332;挂,-8.78262298645;誇,-11.2249700218;耀,-8.62228033638;谈,-11.9181172024;伊,-4.33029998239;預,-9.35316784492;茂,-11.9181172024;抗,-4.51933092696;萘,-11.2249700218;仡,-7.98629156966;贞,-6.33086854398;錢,-8.87359476466;般,-9.72089262505;作,-8.69924137751;河,-8.15691708669;侵,-10.1263577332;临,-9.27905987277;喹,-10.3086792899;吸,-7.98629156966;宽,-11.9181172024;线,-9.35316784492;談,-11.9181172024;反,-7.33314972371;雏,-11.2249700218;科,-7.42948083265;院,-11.2249700218;苗,-6.59510722324;軟,-8.74006337203;赞,-10.8195049137;遠,-9.43321055259;铣,-10.5318228413;卢,-8.69924137751;知,-11.2249700218;除,-7.30299668554;緩,-10.1263577332;扬,-6.5428387947;衰,-11.9181172024;歲,-11.2249700218;其,-8.02629690427;闹,-11.2249700218;绿,-7.56140837569;覆,-9.97220705333;沈,-6.50647115053;颐,-9.35316784492;引,-10.5318228413;应,-7.21763683659;枚,-11.2249700218;謝,-10.8195049137;無,-6.08038675522;鎢,-11.2249700218;鲨,-11.9181172024;循,-10.8195049137;芬,-8.36276914089;溴,-9.21006700128;刷,-11.9181172024;咸,-8.58591269221;砻,-10.3086792899;鸿,-8.78262298645;運,-7.33314972371;俊,-9.43321055259;鍍,-11.2249700218;契,-10.1263577332;寒,-11.2249700218;蕙,-11.9181172024;衛,-7.62765776123;盤,-11.9181172024;秦,-8.22923774827;景,-6.86187139703;滴,-10.8195049137;铸,-10.3086792899;基,-4.38602905884;孽,-9.72089262505;广,-4.86539615315;巾,-11.9181172024;門,-7.80724333821;醋,-9.61553210939;上,-6.24136340011;劍,-9.97220705333;后,-7.39632862533;频,-11.2249700218;經,-10.8195049137;底,-9.72089262505;蒙,-5.36703686734;榛,-10.3086792899;鉛,-11.2249700218;鴨,-9.27905987277;螯,-9.27905987277;足,-8.82707474902;离,-10.8195049137;尾,-11.2249700218;釋,-9.8386756607;聖,-6.98364326925;虚,-9.72089262505;濟,-9.14552848014;寧,-8.45238129958;柯,-6.90748190829;棱,-8.1804475841;淳,-7.92913315582;該,-8.22923774827;轴,-8.66002066436;偶,-11.9181172024;移,-10.8195049137;老,-8.25455555625;节,-11.2249700218;消,-8.20454513568;頑,-9.02774544449;帕,-9.08490385833;贛,-8.78262298645;伟,-7.68401069779;貞,-6.33086854398;冠,-8.15691708669;鬧,-11.2249700218;脫,-10.5318228413;吹,-11.9181172024;精,-7.22676932015;汉,-3.99948854904;珍,-7.92913315582;克,-6.3086454072;車,-7.9668734838;前,-7.87506593455;双,-5.84277117129;塑,-8.92238492883;翔,-9.97220705333;編,-10.5318228413;扭,-11.9181172024;鲁,-7.31294701639;蓮,-8.36276914089;卷,-8.62228033638;固,-8.62228033638;齿,-8.69924137751;辉,-9.02774544449;丈,-9.35316784492;贊,-10.8195049137;库,-11.9181172024;頂,-9.72089262505;挖,-10.5318228413;碧,-11.2249700218;義,-6.99813627655;披,-9.97220705333;水,-6.06591472261;猶,-5.94430759051;菁,-10.8195049137;旅,-7.71342458299;摄,-11.2249700218;勋,-10.1263577332;浊,-11.9181172024;重,-6.90083736557;灌,-11.9181172024;结,-10.5318228413;潞,-7.71342458299;監,-9.8386756607;瑤,-7.35376901091;学,-9.21006700128;鸽,-10.8195049137;诱,-9.72089262505;烷,-10.8195049137;鍶,-10.8195049137;培,-10.1263577332;癸,-10.3086792899;硼,-10.8195049137;标,-8.78262298645;載,-10.1263577332;越,-7.08183529543;缘,-10.8195049137;氟,-7.60062908885;加,-7.61405210918;悬,-9.43321055259;贵,-7.9668734838;貴,-7.9668734838;霹,-11.9181172024;稻,-8.66002066436;故,-8.33459826393;识,-10.8195049137;轉,-9.35316784492;免,-10.8195049137;城,-6.79415322298;筑,-9.43321055259;補,-7.61405210918;江,-6.48003789346;连,-8.00609419695;卡,-5.84507266828;實,-8.62228033638;罩,-10.8195049137;黨,-6.50647115053;乳,-9.43321055259;槲,-11.9181172024;仿,-9.35316784492;叶,-9.43321055259;相,-9.61553210939;好,-7.32299735225;飼,-8.97367822322;鱿,-10.5318228413;王,-9.97220705333;疏,-11.9181172024;嘎,-9.43321055259;純,-8.87359476466;蜘,-9.21006700128;條,-10.8195049137;莫,-8.5508213724;斯,-7.13899370927;澳,-7.98629156966;贴,-10.3086792899;冷,-8.62228033638;制,-8.25455555625;礼,-10.8195049137;友,-9.02774544449;子,-10.8195049137;糕,-11.2249700218;诺,-5.09048796788;曙,-7.98629156966;毛,-7.98629156966;裝,-9.35316784492;玻,-9.14552848014;跟,-9.61553210939;哥,-7.15594326758;啤,-11.2249700218;普,-5.78906699232;泵,-11.2249700218;饼,-10.8195049137;會,-9.97220705333;薄,-8.30719928974;三,-4.395716971;倍,-9.97220705333;濃,-11.9181172024;階,-7.72846246036;缓,-10.1263577332;亞,-6.82436700158;圣,-6.98364326925;邢,-10.8195049137;大,-3.45095494457;支,-8.51691982072;樱,-11.9181172024;记,-9.35316784492;漳,-8.45238129958;状,-10.8195049137;鴿,-10.8195049137;权,-9.97220705333;义,-6.99813627655;迈,-9.27905987277;鍋,-11.2249700218;凌,-8.82707474902;盎,-8.20454513568;展,-11.2249700218;拖,-8.69924137751;衝,-8.69924137751;牡,-10.5318228413;珠,-6.1560658196;奧,-5.28611542499;繩,-10.8195049137;佳,-7.72846246036;铺,-9.97220705333;顽,-9.02774544449;權,-9.97220705333;鞍,-10.8195049137;鼎,-11.9181172024;茚,-10.3086792899;依,-9.02774544449;东,-5.03670589874;礱,-10.3086792899;傣,-7.10593284701;座,-9.72089262505;撫,-9.8386756607;氰,-9.35316784492;梳,-9.8386756607;漲,-10.1263577332;锶,-10.8195049137;熹,-8.42160964092;区,-11.2249700218;夾,-10.3086792899;胃,-8.82707474902;杂,-11.9181172024;舷,-11.2249700218;滇,-10.5318228413;浆,-8.1804475841;煎,-10.8195049137;壓,-8.42160964092;归,-9.61553210939;敖,-10.5318228413;泛,-10.1263577332;保,-5.76325910837;頻,-11.2249700218;面,-8.87359476466;給,-10.1263577332;苯,-8.51691982072;深,-5.14275111145;雷,-9.8386756607;镶,-10.8195049137;凹,-8.33459826393;選,-8.5508213724;系,-8.22923774827;忽,-9.21006700128;鹼,-9.61553210939;茅,-7.98629156966;万,-4.61562077866;變,-7.85767419184;圍,-11.2249700218;輝,-9.02774544449;锡,-7.0353152798;钠,-7.74372993249;連,-8.00609419695;天,-4.01748058936;風,-9.43321055259;蚬,-8.45238129958;農,-5.76325910837;禾,-8.36276914089;苄,-11.2249700218;呋,-10.5318228413;轩,-11.9181172024;野,-7.25467810827;孕,-8.25455555625;體,-10.3086792899;揚,-6.5428387947;機,-9.02774544449;左,-9.97220705333;磨,-8.30719928974;葫,-9.8386756607;杭,-9.8386756607;曬,-11.9181172024;良,-11.9181172024;泰,-5.71154127566;综,-10.3086792899;穿,-10.1263577332;茄,-11.9181172024;開,-5.45508774546;訊,-11.9181172024;笔,-11.9181172024;林,-7.71342458299;搖,-9.35316784492;銥,-11.9181172024;本,-6.36128914068;沱,-8.28053104266;点,-8.97367822322;刺,-10.3086792899;時,-9.27905987277;过,-6.92090492862;豆,-11.2249700218;棉,-7.37482242011;雍,-8.66002066436;過,-6.92090492862;結,-10.5318228413;魔,-11.9181172024;蘭,-6.97647477977;潜,-9.72089262505;購,-9.8386756607;卤,-10.1263577332;華,-3.69074169555;執,-9.35316784492;瑶,-7.35376901091;烹,-11.2249700218;酸,-7.92913315582;搁,-9.35316784492;炎,-9.61553210939;少,-9.02774544449;朗,-11.2249700218;耙,-9.97220705333;洛,-7.21763683659;抚,-9.8386756607;丝,-7.40725769587;遵,-7.91078401715;吡,-10.5318228413;別,-8.13392756846;妨,-9.8386756607;昭,-7.71342458299;振,-7.69860949721;鯉,-7.85767419184;鴻,-8.78262298645;總,-9.21006700128;桉,-11.2249700218;降,-10.8195049137;协,-6.98364326925;像,-10.1263577332;赛,-6.04599941291;九,-6.19453210043;远,-9.43321055259;離,-10.8195049137;剥,-11.9181172024;古,-6.87469208546;柬,-11.2249700218;药,-9.52022192958;滲,-11.2249700218;银,-6.57578295042;鹽,-8.33459826393;飾,-10.3086792899;极,-11.9181172024;計,-10.5318228413;同,-6.62481237766;徑,-10.8195049137;帐,-10.8195049137;研,-8.97367822322;战,-7.74372993249;產,-9.27905987277;太,-5.53292280338;断,-10.5318228413;萬,-4.61562077866;肯,-8.82707474902;丰,-5.9316651971;麻,-10.8195049137;尼,-7.91078401715;資,-9.35316784492;楊,-8.5508213724;烏,-7.01284242394;华,-3.69074169555;駕,-7.26415685223;塔,-6.62985017169;托,-8.33459826393;畢,-9.97220705333;糧,-11.2249700218;審,-11.2249700218;瓷,-9.72089262505;靶,-11.9181172024;鉸,-9.97220705333;鱼,-9.52022192958;來,-8.82707474902;和,-3.4702740891;透,-9.08490385833;庐,-9.08490385833;夕,-10.8195049137;折,-9.61553210939;減,-9.43321055259;贝,-6.83052086715;蠟,-10.1263577332;鈣,-10.5318228413;骨,-7.91078401715;禪,-10.3086792899;液,-8.74006337203;龟,-7.69860949721;匹,-11.9181172024;宾,-11.2249700218;汇,-5.6604496145;證,-9.43321055259;哌,-11.9181172024;偏,-8.78262298645;网,-8.36276914089;麦,-6.48877157343;睡,-8.82707474902;因,-10.5318228413;烤,-10.5318228413;聯,-6.02371436812;極,-11.9181172024;韶,-9.35316784492;勸,-9.02774544449;幻,-9.52022192958;出,-9.08490385833;蜀,-8.25455555625;悅,-7.98629156966;鞋,-9.97220705333;锌,-10.1263577332;熏,-9.35316784492;斗,-8.30719928974;輸,-9.43321055259;湘,-8.42160964092;辛,-5.74850646989;貝,-6.83052086715;樞,-9.02774544449;带,-8.42160964092;枫,-10.5318228413;蔬,-11.2249700218;梵,-6.36904111749;喷,-8.20454513568;阶,-7.72846246036;犹,-5.94430759051;雞,-7.79098281734;杀,-7.77498247599;情,-10.5318228413;淇,-10.8195049137;韋,-11.9181172024;界,-6.22775774806;减,-9.43321055259;绑,-10.8195049137;齐,-6.51995450086;奔,-9.02774544449;进,-10.1263577332;聚,-8.04691619147;妻,-10.8195049137;呢,-10.8195049137;內,-10.3086792899;噶,-10.5318228413;獸,-9.61553210939;驾,-7.26415685223;范,-11.9181172024;者,-10.5318228413;國,-3.89064067152;名,-8.74006337203;徐,-11.9181172024;粒,-10.3086792899;暖,-9.61553210939;語,-11.9181172024;钢,-8.4841299979;紧,-11.2249700218;约,-7.08980346508;辰,-9.52022192958;鼻,-10.1263577332;潛,-9.72089262505;汝,-9.27905987277;健,-8.11145471261;凤,-7.62765776123;穩,-8.87359476466;辦,-10.8195049137;長,-5.53630118498;特,-7.4407803879;司,-10.8195049137;沃,-6.49758220311;辅,-7.57431178053;脆,-11.9181172024;纏,-10.8195049137;障,-11.2249700218;会,-9.97220705333;羥,-8.51691982072;焦,-10.8195049137;閩,-8.66002066436;贮,-11.2249700218;尸,-10.1263577332;邻,-8.15691708669;强,-8.08947580589;血,-9.02774544449;迅,-9.21006700128;蹄,-10.8195049137;经,-10.8195049137;金,-4.13739631626;癔,-10.8195049137;鹤,-9.97220705333;周,-6.02371436812;语,-11.9181172024;浮,-9.97220705333;晴,-6.11902454792;鷹,-8.25455555625;调,-7.08183529543;验,-11.2249700218;隔,-7.80724333821;星,-6.80012338997;客,-10.8195049137;弥,-8.82707474902;纤,-11.9181172024;饰,-10.3086792899;甩,-11.9181172024;咨,-11.9181172024;跳,-11.9181172024;港,-10.5318228413;脱,-10.5318228413;莲,-8.36276914089;朵,-10.5318228413;紹,-8.11145471261;阿,-5.72167307459;检,-10.5318228413;扇,-11.2249700218;鹏,-9.52022192958;盔,-9.97220705333;浙,-7.05058275193;拜,-8.92238492883;燦,-9.43321055259;衫,-10.1263577332;湯,-8.15691708669;淮,-7.04291987918;惰,-11.9181172024;菲,-6.86826119513;更,-11.2249700218;穷,-10.8195049137;絹,-11.9181172024;鋼,-8.4841299979;樂,-8.30719928974;昊,-9.97220705333;間,-9.43321055259;沙,-6.29771633667;业,-11.9181172024;芝,-10.8195049137;麥,-6.48877157343;用,-8.4841299979;氮,-11.2249700218;戲,-8.51691982072;裁,-9.35316784492;恆,-5.50138491987;秋,-7.87506593455;僑,-8.92238492883;诗,-11.2249700218;緣,-10.8195049137;绥,-11.2249700218;濯,-11.2249700218;胱,-11.9181172024;腰,-11.9181172024;色,-9.8386756607;顶,-9.72089262505;清,-6.94830390281;澄,-8.97367822322;指,-9.97220705333;完,-10.3086792899;愛,-6.44584652871;亚,-6.82436700158;堡,-11.9181172024;群,-11.9181172024;邦,-10.1263577332;伯,-9.72089262505;燉,-11.2249700218;纺,-9.97220705333;爽,-7.80724333821;钾,-8.22923774827;觀,-8.69924137751;久,-10.3086792899;俄,-6.87469208546;胆,-9.43321055259;葉,-9.43321055259;奋,-9.97220705333;富,-6.51094543092;勒,-11.9181172024;陕,-9.43321055259;鋸,-8.58591269221;淘,-11.2249700218;滚,-8.92238492883;菜,-11.2249700218;束,-11.9181172024;瑩,-11.9181172024;门,-7.80724333821;雪,-6.82436700158;软,-8.74006337203;泮,-11.9181172024;魷,-10.5318228413;养,-9.97220705333;建,-5.10577210821;牽,-7.60062908885;链,-11.9181172024;言,-10.5318228413;超,-7.54866934992;肇,-11.9181172024;缎,-11.2249700218;爐,-7.65543732534;皓,-8.62228033638;儒,-7.87506593455;丘,-11.9181172024;审,-11.2249700218;夢,-8.11145471261;尤,-9.27905987277;錦,-7.87506593455;貯,-11.2249700218;莱,-8.04691619147;戰,-7.74372993249;脲,-9.52022192958;常,-9.08490385833;眾,-8.11145471261;证,-9.43321055259;压,-8.42160964092;塌,-11.2249700218;发,-7.38551770923;兒,-9.43321055259;这,-8.58591269221;乘,-8.08947580589;招,-9.43321055259;绣,-9.08490385833;工,-7.07393011592;層,-8.5508213724;僧,-9.97220705333;韩,-7.18191875399;番,-9.72089262505;轮,-11.9181172024;菱,-8.74006337203;曳,-10.8195049137;磷,-7.06608693846;遼,-7.85767419184;七,-6.53821984884;有,-8.74006337203;复,-7.0353152798;小,-6.24479393521;美,-4.68755404897;粤,-8.69924137751;厦,-8.92238492883;氯,-7.04291987918;侮,-10.3086792899;家,-6.30498909599;纸,-9.52022192958;炼,-9.97220705333;观,-8.69924137751;杉,-7.46376990613;屏,-8.33459826393;燒,-11.9181172024;街,-8.11145471261;胜,-9.21006700128;革,-6.78821848746;橫,-7.94782528883;闪,-9.61553210939;業,-11.9181172024;修,-9.61553210939;擴,-10.5318228413;寶,-5.31417337778;鉻,-10.1263577332;兽,-9.61553210939;月,-8.58591269221;萊,-8.04691619147;颍,-8.04691619147;綏,-11.2249700218;銑,-10.5318228413;优,-9.8386756607;掛,-8.78262298645;肝,-11.9181172024;鈦,-7.79098281734;梭,-10.1263577332;花,-7.61405210918;螳,-9.27905987277;缸,-11.9181172024;去,-8.42160964092;促,-9.52022192958;桂,-8.92238492883;资,-9.35316784492;韓,-7.18191875399;仙,-8.30719928974;潘,-9.02774544449;換,-5.58483757424;鳥,-8.97367822322;牦,-11.9181172024;瑪,-7.82377264016;路,-6.73633365209;英,-4.27511356682;柳,-10.3086792899;聲,-11.9181172024;整,-7.62765776123;巨,-7.33314972371;都,-8.36276914089;百,-5.71355943981;讀,-9.43321055259;刑,-9.27905987277;圓,-9.02774544449;丙,-8.74006337203;思,-7.05830479802;膜,-10.5318228413;咪,-9.8386756607;亮,-9.52022192958;育,-11.2249700218;医,-11.9181172024;难,-10.3086792899;荷,-8.82707474902;晉,-7.2931443891;筋,-11.9181172024;黎,-7.85767419184;剑,-9.97220705333;痔,-10.8195049137;論,-6.50647115053;乙,-7.39632862533;还,-8.25455555625;黑,-7.38551770923;照,-11.2249700218;幹,-7.28338821415;长,-5.53630118498;图,-10.1263577332;漂,-10.5318228413;龍,-6.14356565684;希,-6.3159983815;吐,-8.87359476466;園,-11.9181172024;锦,-7.87506593455;猪,-8.74006337203;測,-6.67637018732;浜,-11.2249700218;戴,-7.85767419184;康,-6.81217172848;钻,-11.9181172024;應,-7.21763683659;忍,-11.2249700218;青,-6.94138345996;剔,-11.9181172024;煤,-7.57431178053;巡,-8.25455555625;论,-6.50647115053;盧,-8.69924137751;矽,-6.77062272557;發,-7.38551770923;洁,-8.87359476466;蘇,-6.80612941403;渗,-11.2249700218;朝,-5.99119117641;紡,-9.97220705333;鬥,-8.30719928974;音,-9.61553210939;储,-10.8195049137;氫,-9.97220705333;京,-4.93432723712;榮,-8.08947580589;光,-7.33314972371;耳,-10.5318228413;夹,-10.3086792899;流,-9.43321055259;屋,-8.51691982072;陶,-9.43321055259;軌,-8.5508213724;道,-5.39602440421;单,-7.4407803879;卸,-9.35316784492;葛,-10.5318228413;诚,-9.52022192958;兩,-9.61553210939;部,-11.9181172024;豫,-10.3086792899;滬,-8.15691708669;盼,-11.2249700218;肉,-10.1263577332;戊,-8.62228033638;宏,-6.36515761746;唐,-9.35316784492;侗,-7.69860949721;蜜,-10.8195049137;岡,-8.15691708669;讯,-11.9181172024;德,-5.77178794471;夸,-11.2249700218;眼,-7.17318507402;绍,-8.11145471261;彌,-8.82707474902;哑,-11.2249700218;動,-11.2249700218;協,-6.98364326925;曝,-8.82707474902;杜,-7.57431178053;聞,-10.5318228413;童,-11.2249700218;龐,-11.9181172024;全,-5.41682753184;剪,-9.72089262505;转,-9.35316784492;擱,-9.35316784492;数,-11.2249700218;至,-6.53821984884;闻,-10.5318228413;空,-8.20454513568;国,-3.89064067152;把,-10.5318228413;羌,-7.30299668554;碎,-9.61553210939;向,-9.02774544449;众,-8.11145471261;果,-9.8386756607;簡,-10.5318228413;綠,-7.56140837569;红,-5.10797475227;中,-3.07855069872;新,-3.89982106387;強,-8.08947580589;画,-9.8386756607;评,-8.92238492883;风,-9.43321055259;鑑,-9.8386756607;叔,-10.5318228413;柜,-11.2249700218;绢,-11.9181172024;瓦,-8.74006337203;赫,-8.66002066436;鋪,-9.97220705333;譯,-11.9181172024;森,-10.5318228413;曲,-11.2249700218;白,-6.07457278535;一,-7.0353152798;蜆,-8.45238129958;戈,-8.92238492883;記,-9.35316784492;搜,-6.66062183035;索,-7.24528836792;頤,-9.35316784492;玩,-10.8195049137;刨,-11.9181172024;溫,-11.2249700218;優,-9.8386756607;氬,-10.5318228413;悉,-10.3086792899;芳,-8.87359476466;岷,-10.3086792899;容,-10.5318228413;琼,-7.57431178053;濁,-11.9181172024;櫃,-11.2249700218;擇,-11.9181172024;杆,-8.22923774827;難,-10.3086792899;限,-10.3086792899;燕,-5.72371181128;達,-7.61405210918;藥,-9.52022192958;楚,-8.87359476466;藝,-8.82707474902;荞,-11.2249700218;坦,-10.3086792899;珩,-11.9181172024;仫,-8.00609419695;警,-9.97220705333;豬,-8.74006337203;靈,-10.8195049137;柱,-6.92090492862;敲,-9.21006700128;对,-8.30719928974;電,-7.07393011592;闽,-8.66002066436;呼,-8.51691982072;涂,-10.1263577332;納,-5.39749607482;誘,-9.72089262505;攝,-11.2249700218;动,-11.2249700218;购,-9.8386756607;朱,-11.9181172024;阻,-10.5318228413;钼,-10.5318228413;潁,-8.04691619147;摇,-9.35316784492;草,-8.51691982072;盐,-8.33459826393;陸,-9.52022192958;虛,-9.72089262505;巢,-9.72089262505;祥,-8.97367822322;韦,-11.9181172024;東,-5.03670589874;登,-6.38472771366;灿,-9.43321055259;梅,-7.72846246036;文,-4.85849957409;昆,-11.2249700218;舒,-11.2249700218;福,-5.52285560427;税,-11.2249700218;世,-6.40468845622;攜,-8.51691982072;缠,-10.8195049137;瘦,-8.39175667777;助,-11.2249700218;帶,-8.42160964092;仁,-11.9181172024;求,-8.42160964092;装,-9.35316784492;襄,-8.58591269221;蟠,-9.61553210939;拉,-5.75480239835;聊,-8.42160964092;嵌,-10.1263577332;监,-9.8386756607;坐,-11.2249700218;兔,-11.9181172024;湖,-5.62654806282;識,-10.8195049137;蓝,-8.20454513568;獨,-7.30299668554;竹,-7.22676932015;學,-9.21006700128;顺,-7.60062908885;丁,-9.97220705333;授,-10.3086792899;對,-8.30719928974;夏,-7.32299735225;熔,-11.2249700218;洗,-7.05830479802;準,-8.4841299979;標,-8.78262298645;殘,-11.2249700218;望,-9.27905987277;斜,-10.5318228413;感,-8.69924137751;鸡,-7.79098281734;利,-7.35376901091;儿,-9.43321055259;激,-10.1263577332;规,-9.27905987277;屍,-10.1263577332;卓,-10.5318228413;他,-10.5318228413;橙,-11.9181172024;繡,-9.08490385833;季,-9.43321055259;物,-7.31294701639;淬,-9.61553210939;諮,-11.9181172024;致,-7.85767419184;延,-7.5873838621;磺,-8.00609419695;鑽,-11.9181172024;退,-11.9181172024;專,-7.75923411902;宝,-5.31417337778;麟,-9.97220705333;氨,-9.02774544449;炫,-9.72089262505;輪,-11.9181172024;售,-11.2249700218;堰,-9.8386756607;岳,-11.2249700218;徵,-11.9181172024;方,-6.16554456356;机,-9.02774544449;亿,-8.92238492883;派,-8.39175667777;铃,-9.72089262505;齊,-6.51995450086;蕎,-11.2249700218;桐,-8.92238492883;賓,-11.2249700218;乔,-9.52022192958;狗,-9.35316784492;兖,-7.68401069779;飛,-5.96227983292;统,-10.3086792899;换,-5.58483757424;查,-11.9181172024;班,-7.33314972371;鉬,-10.5318228413;駱,-10.1263577332;鳳,-7.62765776123;年,-9.97220705333;拷,-11.9181172024;慶,-6.99086351723;滿,-5.6876357548;球,-10.8195049137;鎂,-8.78262298645;雛,-11.2249700218;鴉,-6.05733097892;羊,-8.69924137751;輕,-9.8386756607;五,-5.57952312418;鸟,-8.97367822322;探,-9.8386756607;貨,-8.97367822322;單,-7.4407803879;失,-10.8195049137;張,-6.45005706125;户,-8.51691982072;廈,-8.92238492883;改,-9.08490385833;蒸,-10.5318228413;螺,-11.2249700218;参,-9.02774544449;雄,-10.5318228413;配,-7.57431178053;毒,-11.9181172024;何,-11.2249700218;留,-11.9181172024;孝,-8.42160964092;緞,-11.2249700218;惠,-7.5873838621;董,-10.3086792899;来,-8.82707474902;触,-9.02774544449;浩,-9.52022192958;注,-10.1263577332;火,-8.69924137751;迪,-6.80012338997;独,-7.30299668554;声,-11.9181172024;米,-7.69860949721;维,-5.36846646015;邁,-9.27905987277;儀,-7.87506593455;閃,-9.61553210939;宇,-7.11409615765;順,-7.60062908885;粉,-9.61553210939;芍,-10.3086792899;褐,-11.2249700218;井,-9.61553210939;輔,-7.57431178053;钙,-10.5318228413;甘,-8.22923774827;羟,-8.51691982072;股,-10.5318228413;质,-9.02774544449;醫,-11.9181172024;碱,-9.61553210939;选,-8.5508213724;纵,-11.9181172024;耶,-9.43321055259;郁,-11.9181172024;雅,-6.41278566645;顆,-8.02629690427;懋,-10.8195049137;柏,-8.97367822322;後,-7.39632862533;潔,-8.87359476466;胡,-7.87506593455;桦,-9.35316784492;矯,-9.61553210939;彩,-8.04691619147;數,-11.2249700218;送,-10.8195049137;冀,-11.9181172024;瞄,-6.78821848746;床,-9.52022192958;舍,-8.74006337203;树,-9.8386756607;北,-5.2821706467;炖,-11.2249700218;宜,-8.39175667777;怡,-7.89276551165;膠,-7.84057975848;抢,-9.8386756607;春,-7.28338821415;欧,-6.12815703149;梦,-8.11145471261;氩,-10.5318228413;涨,-10.1263577332;報,-9.97220705333;紳,-9.61553210939;殼,-7.92913315582;漿,-8.1804475841;净,-11.9181172024;桑,-8.11145471261;鸦,-6.05733097892;浓,-11.9181172024;南,-5.67007432787;祛,-9.97220705333;歧,-10.1263577332;淨,-11.9181172024;八,-7.40725769587;仪,-7.87506593455;鹵,-10.1263577332;捷,-7.31294701639;胶,-7.84057975848;鄂,-7.74372993249;气,-9.02774544449;化,-9.61553210939;採,-8.22923774827;洪,-7.19961833109;箱,-9.97220705333;騰,-9.61553210939;纳,-5.39749607482;茶,-8.33459826393;格,-5.56374716159;貿,-9.21006700128;鉀,-8.22923774827;病,-10.3086792899;鑄,-10.3086792899;筆,-11.9181172024;职,-11.2249700218;李,-9.02774544449;译,-11.9181172024;仓,-8.97367822322;卖,-9.8386756607;糟,-11.2249700218;握,-8.42160964092;慢,-8.11145471261;日,-6.50647115053;武,-7.04291987918;浪,-7.84057975848;驰,-9.72089262505;绳,-10.8195049137;饲,-8.97367822322;蟹,-9.61553210939;櫻,-11.9181172024;槽,-9.61553210939;銀,-6.57578295042;锅,-11.2249700218;肌,-10.1263577332;专,-7.75923411902;鎖,-9.35316784492;撤,-11.2249700218;别,-8.13392756846;鄭,-11.9181172024;催,-9.43321055259;启,-8.97367822322;鬱,-11.9181172024;帳,-10.8195049137;興,-7.60062908885;薺,-10.1263577332;补,-7.61405210918;达,-7.61405210918;十,-5.92915578549;狀,-10.8195049137;密,-8.39175667777;终,-11.9181172024;手,-7.38551770923;緊,-11.2249700218;背,-9.72089262505;角,-9.52022192958;取,-9.97220705333;静,-8.69924137751;盘,-11.9181172024;佩,-11.9181172024;六,-8.15691708669;平,-6.27621013144;職,-11.2249700218;書,-10.1263577332;濾,-8.06796960067;犁,-9.52022192958;薏,-11.9181172024;明,-6.48877157343;输,-9.43321055259;薯,-8.74006337203;夜,-11.2249700218;撥,-11.9181172024;玫,-9.27905987277;炭,-9.97220705333;嬰,-11.9181172024;粵,-8.69924137751;戶,-8.51691982072;携,-8.51691982072;勁,-10.8195049137;區,-11.2249700218;埃,-7.64145108337;铅,-11.2249700218;婆,-9.72089262505;腌,-10.5318228413;藏,-5.33470798022;虎,-7.84057975848;歐,-6.12815703149;法,-5.78906699232;釉,-9.8386756607;荠,-10.1263577332;試,-11.2249700218;轨,-8.5508213724;豪,-10.5318228413;热,-7.61405210918;公,-8.4841299979;懷,-10.1263577332;扶,-11.2249700218;曹,-11.9181172024;读,-9.43321055259;乾,-8.06796960067;鋁,-9.14552848014;备,-8.92238492883;骆,-10.1263577332;首,-7.60062908885;庞,-11.9181172024;营,-9.52022192958;温,-11.2249700218;侨,-8.92238492883;錫,-7.0353152798;沪,-8.15691708669;冬,-9.21006700128;唯,-10.8195049137;皮,-10.1263577332;宰,-11.9181172024;雲,-6.63491347364;鶴,-9.97220705333;枸,-9.97220705333;珀,-9.61553210939;烂,-10.3086792899;奇,-6.3086454072;体,-10.3086792899;兗,-7.68401069779;硝,-9.27905987277;點,-8.97367822322;藤,-10.8195049137;陽,-8.82707474902;卫,-7.62765776123;質,-9.02774544449;巴,-6.60491122334;钨,-11.2249700218;滾,-8.92238492883;昌,-7.4407803879;雙,-5.84277117129;熙,-6.91417089644;瀘,-10.8195049137;接,-7.98629156966;产,-9.27905987277;碳,-8.06796960067;收,-7.69860949721;治,-8.58591269221;辽,-7.85767419184;調,-7.08183529543;坂,-11.9181172024;蓋,-10.3086792899;苏,-6.80612941403;腎,-8.69924137751;跑,-10.3086792899;豐,-5.9316651971;毕,-9.97220705333;博,-8.58591269221;神,-5.7825523113;浦,-11.2249700218;表,-10.8195049137;短,-8.92238492883;己,-11.9181172024;壳,-7.92913315582;婴,-11.9181172024;追,-11.2249700218;锁,-9.35316784492;逃,-11.9181172024;包,-7.69860949721;戏,-8.51691982072;沐,-8.51691982072;檔,-10.8195049137;焙,-10.3086792899;厚,-7.30299668554;缝,-8.36276914089;蔡,-11.9181172024;枢,-9.02774544449;护,-6.59999720854;润,-7.68401069779;梨,-10.5318228413;含,-9.21006700128;掺,-10.8195049137;镁,-8.78262298645;哀,-8.62228033638;鯊,-11.9181172024;佛,-4.18706405838;煙,-7.4407803879;彝,-6.6977613773;擠,-9.97220705333;鑫,-9.14552848014;統,-10.3086792899;峰,-7.77498247599;穆,-4.70877694578;孵,-11.9181172024;时,-9.27905987277;载,-10.1263577332;醃,-10.5318228413;銅,-9.08490385833;驗,-11.2249700218;備,-8.92238492883;报,-9.97220705333;挤,-9.97220705333;侧,-8.5508213724;横,-7.94782528883;环,-6.99086351723;細,-8.51691982072;馳,-9.72089262505;搶,-9.8386756607;铁,-8.02629690427;镀,-11.2249700218;鋅,-10.1263577332;祈,-9.72089262505;旋,-9.43321055259;塞,-9.27905987277;荤,-10.3086792899;园,-11.9181172024;鼓,-9.43321055259;可,-7.08980346508;遮,-9.27905987277;干,-7.28338821415;艺,-8.82707474902;份,-8.33459826393;硫,-8.20454513568;喀,-6.87469208546;皂,-11.9181172024;厄,-10.5318228413;民,-6.59999720854;互,-11.9181172024;咖,-10.8195049137;這,-8.58591269221;龜,-7.69860949721;增,-8.15691708669;酱,-11.9181172024;匯,-5.6604496145;邮,-11.9181172024;就,-11.2249700218;活,-9.61553210939;丽,-9.61553210939;軋,-11.2249700218;直,-7.84057975848;元,-5.96227983292;捏,-11.9181172024;胎,-10.5318228413;楓,-10.5318228413;軒,-11.9181172024;評,-8.92238492883;比,-10.3086792899;块,-10.1263577332;孟,-8.33459826393;飞,-5.96227983292;葡,-7.56140837569;无,-6.08038675522;轧,-11.2249700218;畫,-9.8386756607;韬,-11.9181172024;獯,-11.9181172024;山,-6.64511764382;女,-5.82907232694;懸,-9.43321055259;锂,-7.54866934992;内,-10.3086792899;安,-5.4900119297;養,-9.97220705333;萌,-10.3086792899;醬,-11.9181172024;榕,-11.9181172024;锯,-8.58591269221;圖,-10.1263577332;刘,-9.52022192958;四,-6.45853168824;許,-8.33459826393;听,-11.9181172024;莹,-11.9181172024;勃,-7.36424031078;築,-9.43321055259;蛋,-11.9181172024;藍,-8.20454513568;近,-8.62228033638;乐,-8.30719928974;靖,-9.61553210939;党,-6.50647115053;川,-7.51139795512;食,-10.5318228413;车,-7.9668734838;烯,-9.61553210939;鹰,-8.25455555625;絲,-7.40725769587;蝶,-8.74006337203;省,-8.69924137751;酪,-8.74006337203;還,-8.25455555625;簇,-10.8195049137;蘋,-10.3086792899;休,-8.06796960067;源,-8.58591269221;飯,-11.2249700218;鲜,-9.43321055259;实,-8.62228033638;蜡,-10.1263577332;氧,-11.9181172024;侦,-11.9181172024;鎮,-8.51691982072;稳,-8.87359476466;網,-8.36276914089;架,-10.5318228413;貼,-10.3086792899;雀,-8.51691982072;充,-9.52022192958;等,-11.2249700218;晋,-7.2931443891;里,-8.02629690427;潑,-11.2249700218;鵝,-9.14552848014;条,-10.8195049137;癫,-11.9181172024;铬,-10.1263577332;灯,-11.9181172024;葷,-10.3086792899;泼,-11.2249700218;桿,-8.22923774827;億,-8.92238492883;云,-6.63491347364;通,-7.17318507402;肥,-9.21006700128;鄰,-8.15691708669;垫,-11.2249700218;甬,-11.9181172024;刮,-10.1263577332;纱,-11.2249700218;害,-11.2249700218;头,-7.61405210918;斷,-10.5318228413;雁,-10.3086792899;參,-9.02774544449;塊,-10.1263577332;扎,-10.5318228413;滑,-8.87359476466;毓,-8.36276914089;裕,-7.1306254596;书,-10.1263577332;矫,-9.61553210939;哭,-10.1263577332;畬,-7.92913315582;凯,-6.77062272557;晶,-8.02629690427;苹,-10.3086792899;賽,-6.04599941291;磁,-8.30719928974;崇,-7.98629156966;庆,-6.99086351723;朋,-11.2249700218;墊,-11.2249700218;意,-7.71342458299;辐,-10.3086792899;沒,-9.52022192958;皖,-7.2931443891;綜,-10.3086792899;急,-10.5318228413;货,-8.97367822322;喬,-9.52022192958;縱,-11.9181172024;輻,-10.3086792899;涼,-8.66002066436;練,-11.9181172024;千,-9.52022192958;嵇,-10.5318228413;细,-8.51691982072;运,-7.33314972371;盖,-10.3086792899;牙,-10.1263577332;变,-7.85767419184;柠,-10.5318228413;荣,-8.08947580589;詩,-11.2249700218;睫,-9.27905987277;酯,-11.2249700218;翰,-6.21767362899;敷,-9.97220705333;轻,-9.8386756607;胺,-8.4841299979;汽,-9.8386756607;西,-5.21370284742;諾,-5.09048796788;禁,-11.9181172024;羅,-7.46376990613;喉,-9.8386756607;合,-7.68401069779;耐,-6.56153092771;枕,-10.8195049137;外,-7.71342458299;两,-9.61553210939;薩,-8.1804475841;萨,-8.1804475841;未,-9.97220705333;纯,-8.87359476466;熱,-7.61405210918;咳,-8.5508213724;永,-5.87311188835;伺,-9.97220705333;放,-11.9181172024;必,-9.35316784492;兆,-8.92238492883;济,-9.14552848014;恐,-8.78262298645;啞,-11.2249700218;賣,-9.8386756607;止,-11.2249700218;腦,-11.9181172024;早,-10.8195049137;士,-9.35316784492;马,-6.35359679506;凱,-6.77062272557;灰,-9.27905987277;噴,-8.20454513568;替,-10.5318228413;缅,-10.3086792899;切,-8.51691982072;针,-9.52022192958;脑,-11.9181172024;写,-11.9181172024;搓,-11.9181172024;排,-6.70318144477;妖,-8.39175667777;紙,-9.52022192958;粘,-9.02774544449;瀛,-10.3086792899;羚,-10.5318228413;氣,-9.02774544449;交,-8.30719928974;枪,-11.9181172024;隴,-6.83052086715;费,-9.52022192958;沸,-11.9181172024;总,-9.21006700128;籃,-11.2249700218;黄,-6.75333122846;片,-7.49927659459;准,-8.4841299979;哈,-6.27976253305;那,-8.00609419695;插,-9.43321055259;穗,-8.74006337203;滤,-8.06796960067;执,-9.35316784492;填,-9.8386756607;差,-9.02774544449;共,-7.65543732534;味,-9.72089262505;史,-9.72089262505;围,-11.2249700218;泸,-10.8195049137;拼,-11.9181172024;逆,-11.2249700218;認,-7.75923411902;戒,-10.8195049137;朔,-11.9181172024;宗,-10.1263577332;砖,-8.82707474902;军,-11.9181172024;劝,-9.02774544449;控,-9.21006700128;第,-4.14200172528;铜,-9.08490385833;吉,-7.18191875399;油,-7.4407803879;贸,-9.21006700128;抽,-9.14552848014;壁,-11.9181172024;绅,-9.61553210939;歌,-9.27905987277;腐,-9.8386756607;伏,-8.33459826393;奥,-5.28611542499;勝,-9.21006700128;費,-9.52022192958;瑞,-7.64145108337;裡,-8.02629690427;以,-7.41830753205;佤,-7.92913315582;兰,-6.97647477977;靴,-9.72089262505;浸,-10.3086792899;社,-11.2249700218;径,-10.8195049137;琉,-8.39175667777;漏,-8.06796960067;庚,-8.92238492883;初,-11.9181172024;土,-5.84277117129;校,-9.8386756607;檢,-10.5318228413;悦,-7.98629156966;粮,-11.2249700218;週,-6.02371436812;冰,-9.08490385833;申,-5.45197247815;劲,-10.8195049137;真,-7.74372993249;人,-5.24355581057;鹅,-9.14552848014;升,-8.82707474902;益,-7.32299735225;住,-8.4841299979;拒,-10.1263577332;字,-9.61553210939;剝,-11.9181172024;赣,-8.78262298645;摩,-4.49693967379;寬,-11.9181172024;齒,-8.69924137751;護,-6.59999720854;试,-11.2249700218;板,-7.89276551165;宁,-8.45238129958;稀,-8.5508213724;射,-11.9181172024;成,-7.04291987918;碗,-10.8195049137;龙,-6.14356565684;力,-6.34977269862;霞,-11.9181172024;计,-10.5318228413;蘆,-11.2249700218;儲,-10.8195049137;边,-11.9181172024;丸,-11.9181172024;膽,-9.43321055259;练,-11.9181172024;鈷,-10.8195049137;陈,-10.8195049137;槍,-11.9181172024;桌,-9.8386756607;低,-8.11145471261;凝,-9.35316784492;遜,-9.52022192958;非,-8.13392756846;代,-9.61553210939;汤,-8.15691708669;硬,-8.97367822322;置,-6.70318144477;松,-8.28053104266;布,-6.32713022187;如,-10.8195049137;紅,-5.10797475227;韭,-11.2249700218;植,-8.69924137751;芐,-11.2249700218;易,-7.23598597526;创,-6.8367128374;次,-9.72089262505;誠,-9.52022192958;渣,-7.61405210918;津,-7.57431178053;微,-9.21006700128;阳,-8.82707474902;冲,-8.69924137751;电,-7.07393011592;钴,-10.8195049137;假,-11.2249700218;张,-6.45005706125;盈,-8.4841299979;橋,-8.82707474902;谢,-10.8195049137;塗,-10.1263577332;默,-10.1263577332;牛,-9.52022192958;線,-9.35316784492;酚,-8.25455555625;饭,-11.2249700218;危,-8.00609419695;鋰,-7.54866934992;陳,-10.8195049137;軸,-8.66002066436;突,-7.89276551165;砂,-10.1263577332;約,-7.08980346508;醇,-9.02774544449;分,-8.74006337203;圈,-10.5318228413;残,-11.2249700218;吊,-8.04691619147;抑,-8.58591269221;怒,-8.5508213724;攔,-10.3086792899;弘,-10.5318228413;玛,-7.82377264016;尚,-10.8195049137;沥,-11.9181172024;木,-8.30719928974;進,-10.1263577332;伸,-11.9181172024;显,-7.28338821415;心,-8.02629690427;采,-8.22923774827;牆,-10.1263577332;霍,-11.9181172024;染,-9.21006700128;恒,-5.50138491987;给,-10.1263577332;赤,-8.02629690427;杨,-8.5508213724;寫,-11.9181172024;印,-5.52955579684;石,-6.99086351723;能,-9.72089262505;威,-6.91417089644;简,-10.5318228413;嘉,-6.17511401457;創,-6.8367128374;贏,-10.5318228413;我,-8.4841299979;瀝,-11.9181172024;农,-5.76325910837;生,-8.33459826393;模,-8.87359476466;涤,-11.9181172024;芦,-11.2249700218;頭,-7.61405210918;馬,-6.35359679506;爱,-6.44584652871;鐵,-8.02629690427;丹,-7.68401069779;政,-7.17318507402;節,-11.2249700218;瓊,-7.57431178053;衍,-11.9181172024;提,-11.9181172024;套,-9.43321055259;啟,-8.97367822322;回,-5.61733140772;橡,-10.5318228413;慧,-11.9181172024;拦,-10.3086792899;孫,-7.57431178053;台,-9.35316784492;间,-9.43321055259;聽,-11.9181172024;綁,-10.8195049137;异,-8.15691708669;宅,-11.2249700218;皇,-7.41830753205;醉,-11.9181172024;麗,-9.61553210939;香,-7.13899370927;钛,-7.79098281734;功,-8.15691708669;漢,-3.99948854904;岫,-10.8195049137;挪,-10.3086792899;傳,-8.00609419695;露,-9.02774544449;鈴,-9.72089262505;局,-11.9181172024;商,-9.35316784492;凉,-8.66002066436;半,-10.8195049137;乌,-7.01284242394;魚,-9.52022192958;酞,-9.72089262505;该,-8.22923774827;端,-8.42160964092;奮,-9.97220705333;鉴,-9.8386756607;腾,-9.61553210939;颗,-8.02629690427;傈,-7.49927659459;二,-6.38078293536;碘,-8.66002066436;君,-5.30742115766;定,-11.9181172024;犛,-11.9181172024;禮,-10.8195049137;環,-6.99086351723;殺,-7.77498247599;房,-7.42948083265;管,-7.89276551165;陇,-6.83052086715;煉,-9.97220705333;烈,-10.3086792899;滌,-11.9181172024;雌,-9.8386756607;捕,-9.61553210939;雜,-11.9181172024;档,-10.8195049137;步,-7.41830753205;廬,-9.08490385833;铰,-9.97220705333;摻,-10.8195049137;艾,-10.5318228413;曼,-10.3086792899;承,-9.21006700128;岁,-11.2249700218;市,-11.2249700218;理,-8.74006337203;炉,-7.65543732534;投,-7.39632862533;得,-9.14552848014;墙,-10.1263577332;霜,-10.3086792899;原,-7.68401069779;没,-9.52022192958;航,-9.52022192958;钱,-8.87359476466;防,-7.16452701128;猴,-6.61979983583;樺,-9.35316784492;先,-10.1263577332;淋,-10.8195049137;軍,-11.9181172024;每,-9.8386756607;晒,-11.9181172024;荔,-11.9181172024;志,-11.2249700218;婚,-11.9181172024;靜,-8.69924137751;鏟,-9.97220705333;泡,-8.02629690427;解,-5.63211910787;此,-9.27905987277;铱,-11.9181172024;異,-8.15691708669;癲,-11.9181172024;迷,-10.1263577332;藻,-11.2249700218;封,-8.97367822322;稅,-11.2249700218;震,-7.92913315582;倉,-8.97367822322;冈,-8.15691708669;洋,-11.9181172024;不,-6.71962017112;黃,-6.75333122846;弗,-10.8195049137;认,-7.75923411902;膨,-9.97220705333;紫,-7.62765776123;鸭,-9.27905987277;喜,-9.43321055259;郑,-11.9181172024;攻,-11.2249700218;立,-7.85767419184;肾,-8.69924137751;範,-11.9181172024;均,-7.49927659459;偉,-7.68401069779;燈,-11.9181172024;测,-6.67637018732;行,-8.04691619147;腓,-7.54866934992;罗,-7.46376990613;糖,-9.08490385833;陝,-9.43321055259;韜,-11.9181172024;污,-11.2249700218;擦,-11.9181172024;恩,-8.28053104266;臨,-9.27905987277;魯,-7.31294701639;壮,-6.75333122846;痰,-11.9181172024;关,-8.42160964092;酒,-8.4841299979;牵,-7.60062908885;觸,-9.02774544449;征,-11.9181172024;禅,-10.3086792899;圆,-9.02774544449;玉,-6.55682503667;焊,-10.5318228413;抓,-8.78262298645;编,-10.5318228413;多,-6.26914296422;針,-9.52022192958;庫,-11.9181172024;維,-5.36846646015;劳,-8.36276914089;甲,-6.21100693763;施,-10.5318228413;潤,-7.68401069779;終,-11.9181172024;版,-11.9181172024;滋,-11.9181172024;廣,-4.86539615315;虐,-10.5318228413;拓,-9.02774544449;联,-6.02371436812;许,-8.33459826393;盛,-8.04691619147;烟,-7.4407803879;信,-6.16554456356;赢,-10.5318228413;烧,-11.9181172024;壯,-6.75333122846;勳,-10.1263577332;畲,-7.92913315582;側,-8.5508213724;娃,-7.15594326758;餅,-10.8195049137;预,-9.35316784492;劈,-11.2249700218;下,-10.1263577332;熊,-11.9181172024;速,-9.97220705333;縫,-8.36276914089;鮮,-9.43321055259;鲤,-7.85767419184;谷,-8.97367822322;檸,-10.5318228413;释,-9.8386756607;泌,-8.13392756846;打,-8.15691708669;腕,-9.61553210939;孙,-7.57431178053;高,-5.70350910396;瓜,-9.72089262505;珞,-8.13392756846;拨,-11.9181172024;自,-7.48730040354;顯,-7.28338821415;篮,-11.2249700218;酵,-11.9181172024;开,-5.45508774546;劉,-9.52022192958;匈,-9.97220705333;逊,-9.52022192958;規,-9.27905987277;甜,-9.97220705333;传,-8.00609419695;氢,-9.97220705333;茨,-9.61553210939;地,-5.61733140772;层,-8.5508213724;陆,-9.52022192958;材,-11.2249700218;存,-11.9181172024;铝,-9.14552848014;畜,-11.2249700218;營,-9.52022192958;满,-5.6876357548;择,-11.9181172024;快,-7.5873838621;鵬,-9.52022192958;右,-10.8195049137;鑲,-10.8195049137;郵,-11.9181172024;兴,-7.60062908885;混,-8.5508213724;歸,-9.61553210939;找,-10.8195049137;唇,-7.71342458299;隆,-8.51691982072;鈉,-7.74372993249;邊,-11.9181172024;蘑,-10.1263577332;撒,-7.46376990613;耕,-9.97220705333;紗,-11.2249700218;纖,-11.9181172024;官,-7.37482242011;爛,-10.3086792899;办,-10.8195049137;渡,-8.15691708669;欣,-8.13392756846;推,-8.28053104266;窮,-10.8195049137;奈,-10.1263577332;樹,-9.8386756607;偵,-11.9181172024;落,-11.2249700218;繁,-11.9181172024;硅,-6.77062272557;起,-7.39632862533;镇,-8.51691982072;集,-7.17318507402;鏈,-11.9181172024;擒,-10.3086792899;磚,-8.82707474902;關,-8.42160964092;勞,-8.36276914089;正,-6.3159983815;波,-5.57423676826;桥,-8.82707474902;扩,-10.5318228413;緬,-10.3086792899;即,-11.9181172024;铲,-9.97220705333;灵,-10.8195049137;海,-4.29741211554;棺,-11.9181172024;
+B,n:怀,-9.27678883272;挂,-10.0485791406;蘄,-13.7682302534;誇,-10.8237912742;耀,-12.0634821611;涉,-11.2325512782;氈,-10.9276908692;伊,-10.7914259897;鲜,-8.27157445444;嚏,-14.4613774339;铜,-7.91495076758;預,-7.46905125351;茂,-15.1545246145;谯,-13.2827224376;抗,-8.36611609315;脖,-8.59916772269;料,-11.4409525478;萘,-11.72053741;蜚,-13.4497765223;洞,-8.25985457507;造,-7.99639979795;钣,-13.5450867021;猢,-11.3150723019;瘤,-12.8519395215;礦,-6.7734948479;黝,-13.4497765223;般,-11.2425016091;蚯,-10.9060293725;攮,-14.2382338826;逮,-13.3627651453;河,-6.44861369879;欲,-9.52690350081;侵,-9.61916079147;临,-9.72298840417;銷,-7.82150160012;谈,-10.9131978619;喹,-12.1340997284;吸,-8.6868258884;场,-7.52966151752;宽,-8.97658050045;娼,-11.3368122885;线,-7.68373084031;飙,-15.8476717951;铡,-12.1587923409;黴,-10.2418697288;黛,-13.5450867021;談,-10.9131978619;鴯,-12.8519395215;豈,-15.1545246145;反,-7.84531224881;牌,-8.74599582344;雏,-10.0305606351;姑,-7.01013574896;鼹,-12.9573000372;筒,-11.1202839764;幔,-14.2382338826;拗,-10.8709380526;纸,-8.03408024211;蟑,-11.3703349806;摘,-10.5246618159;窗,-8.65774962432;爽,-12.8519395215;话,-7.80883703728;爻,-12.4136845906;軟,-8.11223844256;荤,-12.0634821611;凡,-10.1110994976;遠,-8.33069457046;瓣,-11.599176553;卢,-10.1339389896;知,-7.10525721254;噤,-13.2086144654;鸾,-13.2827224376;巩,-12.3819358923;胫,-12.5154672849;罪,-8.23335964861;揭,-11.1655405679;扬,-10.2418697288;觱,-13.5450867021;衰,-12.1100021768;泳,-11.9356487896;歲,-9.25737074687;蹴,-13.7682302534;其,-11.4409525478;痹,-13.3627651453;鯽,-11.5038663732;驼,-10.2345436887;绿,-7.5892493326;愁,-10.9350169093;芗,-14.7490595064;榆,-10.9276908692;雅,-10.1606964387;沈,-13.5450867021;個,-6.09692757979;辊,-14.7490595064;匍,-13.0750830728;繃,-11.2937949035;阏,-13.3627651453;餑,-11.7872287845;观,-6.88540824095;引,-8.52714483279;应,-9.23563076023;计,-6.2880134756;遮,-12.2641528566;謝,-11.7701343512;檜,-13.7682302534;賄,-12.0410093053;無,-7.4925270556;鳜,-12.8031493573;厢,-9.89963680588;遇,-11.9158461623;禦,-8.65925905857;崩,-11.7872287845;箝,-14.7490595064;循,-12.4803759651;茭,-12.2100856353;抬,-12.589575257;是,-9.63707171804;蝉,-12.0190303986;殲,-10.6491747638;溴,-11.7872287845;刷,-11.6429791757;冶,-8.79495074583;咸,-10.1240866931;砻,-15.8476717951;贞,-11.5436067019;鸿,-10.3464135845;綾,-13.2827224376;阡,-12.5154672849;琉,-10.2164600132;闊,-8.95097746344;视,-7.66959433121;饞,-12.9573000372;運,-6.14458830687;俊,-12.3511642336;鍍,-10.6886164958;嗎,-11.4532226404;契,-8.96934532677;烹,-11.584991918;寒,-8.32419048249;录,-9.39247323172;黔,-13.2086144654;锡,-10.0516140443;煸,-14.2382338826;教,-6.11319478526;衛,-7.73334708591;柚,-11.599176553;諜,-12.3511642336;行,-5.01454302628;瑣,-11.7045370687;叢,-9.24372797046;盤,-8.31880253842;姦,-9.65530930559;嵩,-14.7490595064;峨,-12.9573000372;括,-10.8504595213;景,-7.76372609277;旮,-12.4136845906;滴,-9.93687515102;凶,-10.1539396563;铸,-9.68646447337;须,-10.167499186;基,-4.57481988863;孽,-12.1587923409;广,-7.57637914208;巾,-13.901761646;锰,-11.0193580578;漪,-14.4613774339;門,-7.00738112597;沉,-8.82748108675;贈,-11.4050205386;醋,-10.4723933874;上,-6.55023671624;劍,-10.0335412632;辮,-10.4139497915;后,-6.42804341806;碑,-9.44907686053;餐,-8.90841784902;經,-4.53352659133;蚂,-9.9868855716;底,-8.20084040363;缔,-9.98120373813;鑰,-9.58618011074;默,-14.2382338826;蒙,-9.47435200549;榛,-11.6135652905;蘚,-14.7490595064;牛,-7.69489774232;辟,-15.1545246145;玄,-9.73177966958;鐘,-9.12986710004;疣,-13.7682302534;頰,-13.2086144654;岩,-7.66204290392;鴨,-10.0099413479;芭,-9.50203543423;粳,-11.3478621247;枯,-9.75184723263;椰,-9.93146973246;足,-8.83735992776;伴,-10.3880862809;馈,-14.7490595064;頂,-8.41223377525;甸,-12.7121775791;妻,-7.74055432431;瘺,-13.2827224376;媽,-7.97980030467;笼,-10.5005642643;尾,-8.20084040363;胁,-12.9032328159;旃,-13.6504472177;框,-9.03752934495;泉,-9.83395663902;赈,-13.7682302534;釋,-10.8437254891;蹊,-13.901761646;狍,-11.8773798815;疹,-13.5450867021;鷓,-8.95300175563;軼,-11.7872287845;绕,-11.1114733467;聖,-7.80208351426;敘,-10.5746722365;晚,-8.11969625296;譜,-10.8172338737;濟,-13.139621594;汞,-11.2833236036;郡,-9.89963680588;趨,-7.0005994825;嗣,-14.7490595064;牢,-10.1951826148;盥,-13.6504472177;坤,-14.0559123258;寧,-11.094081604;絨,-9.89442846078;犟,-13.3627651453;繪,-8.64055293886;蟯,-13.0750830728;稼,-13.014458451;棱,-10.5295518012;革,-9.07116480269;跳,-10.0887700212;該,-12.9032328159;仵,-13.3627651453;轴,-9.16807260922;号,-8.67524721794;偶,-9.69493910036;啸,-12.8031493573;姻,-10.8107191926;韬,-11.584991918;识,-11.2627043164;忿,-15.8476717951;态,-7.15837574705;膀,-9.62311336579;节,-7.28206946444;构,-8.05904572944;梆,-10.7417263212;消,-6.24414134585;刍,-13.7682302534;厌,-12.589575257;璎,-12.9573000372;堑,-12.3819358923;這,-11.9158461623;媒,-7.44454355993;鸕,-12.5154672849;羔,-11.3590354253;黿,-15.1545246145;悖,-11.0354874397;贛,-13.7682302534;伟,-10.3302188986;貞,-11.5436067019;倡,-10.6886164958;冠,-8.71198444803;锣,-10.00123302;犢,-13.014458451;邊,-7.33649667597;鬧,-10.4183261661;踝,-13.139621594;脫,-10.2831513877;纪,-7.88665032918;术,-9.97555400559;撮,-13.2086144654;锋,-10.62731597;課,-8.3946894656;鱈,-12.2923237336;吹,-10.7177730801;皺,-9.94230994701;稽,-11.658017053;精,-6.60699622329;翅,-9.67806106257;臀,-9.99834701512;蕃,-14.2382338826;拂,-13.3627651453;柄,-15.8476717951;歇,-11.2425016091;裆,-14.2382338826;汉,-7.52771077318;珍,-8.81504753403;克,-10.5695571358;今,-10.4052540845;前,-6.58540333023;双,-6.65896372321;坏,-8.94996685193;塑,-8.39063970594;姐,-7.70531751821;鵓,-12.0634821611;幕,-9.07917858341;靜,-8.69383799348;胖,-7.36011340878;轟,-9.56353763399;賞,-9.60739594989;几,-8.50554006448;赊,-15.1545246145;勢,-7.49511742559;缧,-14.2382338826;巨,-8.076604709;腫,-8.81769888336;绪,-14.0559123258;扭,-10.1881895793;杯,-9.61130220486;蓮,-8.73208966888;卷,-9.03973685136;馨,-12.7121775791;闸,-10.4271367958;固,-8.51334244476;閹,-10.7978157878;导,-6.85885129328;腈,-12.6287959702;糾,-9.01141251779;戀,-10.6547149442;脂,-8.32257104894;鮫,-14.2382338826;苗,-9.76089706815;侉,-14.2382338826;丈,-8.05326058934;贊,-10.2755177629;再,-11.3590354253;咏,-12.1340997284;鈷,-14.7490595064;鮑,-11.7872287845;库,-7.74206239276;砂,-8.97450796085;尔,-13.014458451;挖,-9.87386218319;蘘,-15.1545246145;蔚,-12.9573000372;沟,-9.44907686053;伞,-9.77462726096;删,-14.7490595064;體,-6.17353451575;鄢,-12.9573000372;疥,-12.589575257;碧,-9.89442846078;符,-8.81064418038;義,-7.45061440489;篝,-11.0113898881;披,-10.181245107;爆,-9.51261754356;褲,-9.01679756042;涵,-10.60592478;水,-5.09915323522;傷,-8.20658754589;猶,-9.56540504817;瘸,-12.0190303986;赞,-10.2755177629;禽,-10.1986975569;箋,-11.5436067019;箴,-12.3213112704;菁,-14.4613774339;所,-6.51158021778;旅,-7.94296788119;摄,-8.83375632025;勋,-9.5766833632;浊,-10.4227217776;凍,-9.57102830572;灌,-8.61133245231;坎,-11.4782239426;结,-5.57320706488;邮,-8.54248357967;鱔,-12.7566293417;渎,-15.8476717951;贻,-12.1100021768;佞,-12.8519395215;鏡,-8.81769888336;銑,-11.6281640899;監,-8.02482650478;瑤,-11.0354874397;学,-5.51744699914;翩,-15.1545246145;總,-5.36953910605;苫,-13.3627651453;鵪,-11.5436067019;臭,-9.47435200549;罹,-15.8476717951;蓯,-13.7682302534;蝮,-12.0410093053;诱,-10.2128821919;緩,-10.4677744415;耒,-13.4497765223;淵,-10.1709179928;烷,-10.3966333415;鸳,-9.39562284063;培,-10.0577116242;噸,-11.0854978603;碾,-11.2833236036;秽,-12.1841101489;硼,-11.2226989818;持,-8.58504319409;技,-5.91895518848;憂,-10.2793272913;鲁,-13.6504472177;标,-6.30014515573;钽,-13.4497765223;伉,-13.0750830728;溈,-15.1545246145;越,-10.2022248974;吏,-9.21172523938;瞎,-9.71644530558;笑,-7.97636059174;骐,-14.4613774339;妒,-13.6504472177;紕,-12.1100021768;岔,-11.0034847086;耗,-9.9868855716;缘,-9.03532670089;訛,-12.0864716794;鼯,-13.014458451;袜,-10.4540442487;氟,-10.711873358;辞,-10.0607744137;加,-8.33505425039;甥,-14.0559123258;钤,-13.7682302534;砧,-11.5301836815;宦,-9.38620361871;弩,-11.5169384548;纨,-12.8031493573;悬,-9.07230570413;遺,-7.10286505766;贵,-7.41342552447;貴,-7.41342552447;膨,-11.8223201043;霹,-10.5644680663;隸,-11.1655405679;稻,-8.99542922601;雲,-8.13657054322;碼,-8.82124498636;尿,-8.92011388878;晃,-14.7490595064;臂,-10.6327360375;故,-7.15099440167;蓄,-9.40672525443;謠,-9.80029961602;轉,-8.18051353974;酶,-12.9573000372;免,-9.38152707083;辣,-9.1643108493;第,-9.26012178024;城,-5.88224284099;孑,-11.3817636764;闹,-10.4183261661;秒,-10.3880862809;絕,-8.60558943581;鳔,-14.7490595064;菖,-12.6287959702;蝙,-10.38383999;橛,-13.5450867021;楝,-13.901761646;補,-8.10787733665;江,-7.84933639911;舷,-12.4803759651;卡,-9.12504200021;陣,-8.06195089853;啥,-15.8476717951;瓤,-13.2086144654;顧,-8.07323628476;實,-5.98996643518;彩,-8.00500032008;诽,-12.8519395215;扫,-9.92609337542;腭,-13.7682302534;胬,-15.1545246145;摯,-11.2833236036;乳,-8.0061788706;槲,-12.6696179647;赵,-13.5450867021;滿,-8.48629636609;偷,-12.7566293417;叶,-8.0702981924;相,-8.01169721334;驻,-8.58434217759;痺,-13.3627651453;好,-7.29356824963;箫,-13.901761646;鱿,-11.9975241934;简,-9.04638876059;螃,-11.0273902295;邀,-12.0634821611;争,-8.89112635191;袭,-12.589575257;压,-6.75307903163;球,-8.07113676688;疏,-10.2272709293;阎,-10.6771878;窑,-9.36456444361;砒,-10.711873358;純,-9.3095319713;镯,-11.3150723019;或,-14.0559123258;蜘,-10.2679419691;縮,-9.40354053836;條,-6.06465839599;渤,-9.05532736759;涟,-12.0410093053;丞,-8.76680389837;务,-12.4136845906;匠,-10.8042466781;鞣,-12.1841101489;钥,-9.58618011074;锤,-11.3933244988;麩,-12.6696179647;缨,-13.014458451;莫,-11.955851497;簪,-11.3150723019;螳,-11.5436067019;斯,-9.93146973246;澳,-9.69069280948;栲,-11.4782239426;贴,-9.95879383673;冷,-8.04505373162;制,-6.16951768991;眸,-11.571005676;琺,-11.658017053;礼,-7.60412628713;綿,-10.1472282217;績,-9.89963680588;苁,-13.7682302534;藠,-14.4613774339;友,-8.94091701641;汊,-12.0634821611;兌,-12.6696179647;噎,-13.2086144654;髑,-14.7490595064;子,-7.03200497012;硒,-15.8476717951;糕,-11.1748429606;鱘,-12.7121775791;漸,-10.6886164958;曙,-10.1847113149;毛,-7.45400308993;煉,-9.97837488193;玻,-8.04546247882;跟,-10.6886164958;乞,-10.5149530018;狡,-14.0559123258;占,-9.91277759944;哥,-7.84967247708;啤,-9.15558805256;秧,-10.7237078157;婦,-7.58022283676;绩,-9.89963680588;胭,-10.6165631782;普,-8.43611550725;議,-7.20896918625;俳,-12.4464744134;泵,-11.6429791757;浴,-10.2455529742;蠑,-12.1340997284;囹,-13.0750830728;輕,-8.27465453901;寻,-13.2827224376;壽,-8.55806127361;饼,-10.837036501;幾,-8.50554006448;會,-6.09564687173;蠹,-13.5450867021;搅,-11.9975241934;薄,-8.9601192234;三,-7.0741324115;辈,-9.98404061946;倍,-9.71427375207;册,-11.9158461623;嚎,-14.2382338826;娑,-14.7490595064;父,-6.60360655369;弓,-9.66146317116;墒,-14.2382338826;癩,-11.8773798815;铝,-8.95503015389;昙,-13.139621594;講,-8.32041587569;栝,-13.2086144654;榜,-9.48809792639;负,-7.23498662219;亞,-7.83499086536;圣,-7.80208351426;琥,-10.6943802006;疤,-11.2325512782;大,-4.34365590272;窦,-12.9573000372;鸩,-12.589575257;挫,-10.2093171257;粪,-10.1339389896;踩,-15.8476717951;支,-6.92848618502;暮,-10.3262108772;樱,-10.0099413479;记,-5.97490121519;漳,-15.1545246145;滲,-10.2345436887;谵,-11.8964280765;鏊,-12.7121775791;状,-6.6692349721;齡,-13.4497765223;鴿,-10.3382834584;玩,-8.49330946464;扁,-9.92877794079;权,-6.54466108825;义,-7.45061440489;鍋,-9.41312527628;泊,-10.1143305182;遍,-11.599176553;凌,-13.7682302534;問,-5.56448148564;雎,-15.8476717951;齐,-10.2057647241;当,-7.67522497672;莢,-12.0410093053;展,-9.2908934389;巔,-11.2729608166;拖,-9.39720137292;鸦,-9.41956652238;據,-10.8172338737;衝,-8.55669701692;滞,-10.9060293725;牡,-9.53412374879;叠,-11.3933244988;督,-9.79323244879;跨,-9.69281370105;痤,-11.6887887117;奧,-9.37532550056;嫦,-10.5644680663;繩,-9.09891224757;鹽,-8.03691367853;荫,-12.8519395215;驢,-10.5695571358;恭,-11.6732845252;蛮,-10.9350169093;橱,-11.2226989818;诰,-12.1100021768;佳,-9.44907686053;棲,-11.9158461623;具,-12.1100021768;鲨,-10.2831513877;矸,-12.2923237336;哺,-9.58047124652;除,-10.3262108772;肃,-12.5154672849;蜂,-9.13958771121;阀,-11.1291729238;榉,-14.2382338826;栈,-10.62731597;權,-6.54466108825;芒,-10.5493544285;嘌,-11.9356487896;芬,-10.9801373446;绉,-13.901761646;墓,-8.0859268104;箕,-14.4613774339;暗,-8.65925905857;鐐,-12.589575257;耘,-15.8476717951;挚,-11.2833236036;依,-7.91746558838;东,-6.26019720475;吠,-12.6287959702;傣,-12.5154672849;判,-9.85121970644;座,-8.60845682128;崦,-15.8476717951;长,-6.44563726005;撫,-11.658017053;嬪,-11.3703349806;枭,-12.7121775791;芯,-10.2947122101;駕,-8.94593458841;铁,-6.39509137608;氰,-11.6429791757;梳,-11.094081604;漲,-6.85660746287;段,-10.4183261661;訴,-11.184232701;遭,-8.5404694803;稈,-13.0750830728;逸,-11.6135652905;区,-6.61694073344;徽,-9.94777444148;鲱,-12.4803759651;夾,-9.29231490325;旁,-10.7662674301;胃,-8.91230134905;杂,-7.46859190578;熊,-9.26842058305;爷,-8.75343694914;仇,-9.47094484716;浆,-10.1777908721;觉,-10.3505035698;案,-7.79314918553;鴇,-12.0190303986;癌,-9.83151463536;煎,-12.1587923409;壓,-6.75307903163;归,-9.76773859997;敖,-13.014458451;聘,-11.2833236036;泛,-11.4656451604;罢,-14.7490595064;保,-6.3342682486;頻,-8.17631087187;櫟,-13.5450867021;楞,-12.5518349291;面,-5.98620487179;句,-10.0950991562;鉤,-11.2325512782;继,-8.89494315044;渐,-10.6886164958;秩,-8.60344427946;硨,-12.3511642336;孪,-13.901761646;虬,-12.0190303986;苯,-9.65530930559;腮,-11.2425016091;深,-7.76156925939;潲,-15.1545246145;诵,-14.4613774339;荐,-14.7490595064;雷,-7.8683328998;當,-7.67522497672;凹,-10.595398367;選,-8.28395212665;峻,-12.5154672849;幼,-8.31558365152;竿,-12.7121775791;饾,-15.1545246145;考,-8.33232722388;茅,-8.40576506701;抄,-10.6112298322;万,-7.97712395056;袈,-10.4770337669;殊,-11.2833236036;圍,-8.78205843147;鞍,-9.9868855716;睛,-14.7490595064;頓,-12.8031493573;徒,-9.02874772979;緯,-9.51795088954;馄,-11.6281640899;肘,-11.3368122885;氛,-9.63908176897;遥,-10.2381999999;蛇,-9.88666645544;溜,-14.7490595064;樟,-10.48169578;雄,-8.95097746344;赋,-9.15682951764;英,-7.76588758813;連,-8.11881597121;脚,-7.51970393676;退,-10.0793507993;锌,-12.9573000372;天,-5.75125250662;墨,-9.02984122361;宪,-8.117057729;札,-11.6135652905;音,-7.14615904419;贱,-10.5246618159;鞏,-12.3819358923;農,-5.59868147559;鳞,-9.79088778183;炸,-8.58855566697;鰻,-11.1381415938;玺,-12.7121775791;缽,-11.6887887117;聋,-11.184232701;稿,-9.75410202502;禾,-10.4052540845;蕁,-12.0864716794;擀,-12.3511642336;跆,-12.9573000372;呋,-11.7533272328;诊,-10.711873358;轩,-11.9356487896;燎,-13.6504472177;鐵,-6.39509137608;顓,-11.3703349806;產,-5.22167245334;孕,-9.40832142396;嫔,-11.3703349806;陂,-13.2086144654;汛,-15.8476717951;揚,-10.2418697288;佝,-11.5436067019;機,-4.93447602996;瓠,-14.2382338826;灣,-12.0410093053;矢,-10.3262108772;勤,-10.0700194718;鹧,-8.95300175563;左,-8.20084040363;通,-6.63204541866;磨,-9.42442483153;葫,-9.27678883272;鯪,-13.014458451;杭,-10.9131978619;曬,-11.8773798815;良,-8.41105452983;泰,-9.46585577766;访,-11.9356487896;陷,-9.91013558998;嗶,-12.9573000372;兹,-15.1545246145;类,-7.26675291277;虾,-10.9204181099;综,-8.51530258913;穿,-9.58618011074;滔,-14.2382338826;攀,-12.4136845906;讼,-12.9032328159;礪,-15.8476717951;茄,-10.7978157878;澇,-11.8773798815;氆,-12.3819358923;開,-7.05892591312;樊,-12.6696179647;萬,-7.97712395056;鲑,-12.1587923409;紐,-10.012861058;妓,-10.0731202495;颂,-11.4288311873;笔,-7.6229722331;林,-7.7998424376;搖,-10.0157893178;鱉,-13.0750830728;涛,-12.6287959702;戚,-15.8476717951;溝,-9.44907686053;輜,-10.7978157878;钡,-12.3213112704;瘢,-11.8773798815;銥,-14.4613774339;羧,-10.7914259897;墩,-11.6732845252;館,-9.74064890732;颗,-9.46247739607;銹,-11.4532226404;本,-6.91916397075;鸲,-15.1545246145;沱,-13.0750830728;贰,-13.7682302534;串,-11.0854978603;吶,-11.8964280765;点,-8.43430445937;刺,-8.31130785666;纽,-10.012861058;笋,-11.2937949035;宿,-8.90358458683;破,-9.0157182295;擁,-11.2729608166;時,-4.63766387519;担,-9.51261754356;过,-6.17902089243;豆,-7.81012860994;棉,-7.52625020816;雍,-9.60156502958;郧,-14.4613774339;過,-6.17902089243;結,-5.57320706488;姓,-8.78376783359;鏢,-14.2382338826;髕,-13.2086144654;孔,-9.0157182295;飓,-11.2833236036;爸,-8.4397474725;慘,-9.65122766727;跛,-11.8223201043;蘭,-10.1372447777;作,-5.45695483262;诟,-11.5169384548;員,-8.45564022755;鈑,-13.5450867021;釣,-11.5038663732;院,-6.95327580526;卤,-10.0335412632;忧,-10.2793272913;壩,-9.96713880866;票,-8.13567528802;茉,-10.6886164958;秦,-9.28947399225;蛭,-11.9764707842;霓,-11.2226989818;華,-7.65289015662;走,-6.94657767345;槳,-12.1841101489;蹲,-13.7682302534;鲤,-10.3302188986;執,-8.80189521818;瑶,-11.0354874397;價,-5.20482163817;典,-7.71115354295;牺,-11.1114733467;彼,-10.5849816062;寿,-8.55806127361;塾,-12.9032328159;艇,-12.2100856353;暂,-11.0601800523;舅,-9.47605994783;沆,-15.1545246145;轆,-12.2641528566;誊,-15.8476717951;嘍,-10.3754011214;瞌,-13.7682302534;炎,-9.65735638921;少,-7.21786445928;餓,-11.2032808959;麒,-10.8848271648;箔,-12.6287959702;朗,-13.901761646;耙,-13.139621594;膘,-15.1545246145;洛,-10.6715220625;抚,-11.658017053;丝,-8.60344427946;煩,-12.2923237336;吡,-10.8437254891;別,-8.74434973254;弧,-9.68646447337;逝,-12.8031493573;窪,-9.40832142396;昭,-13.2827224376;顽,-10.590176423;振,-9.93146973246;醜,-9.95051792743;谱,-10.8172338737;亲,-7.08863106754;樵,-11.8223201043;眷,-10.6602859892;銀,-5.52583581525;踺,-14.2382338826;鴻,-10.3464135845;帽,-9.28664112917;墾,-11.4288311873;許,-9.99259987286;縛,-13.014458451;桉,-12.0190303986;芥,-10.8437254891;锢,-13.7682302534;降,-7.49135182923;韌,-9.96713880866;协,-6.82161490319;郎,-9.92877794079;绒,-9.89442846078;婕,-14.7490595064;烏,-8.1670343675;蝗,-10.6219251213;蓖,-11.7045370687;恙,-13.6504472177;臘,-10.5394040977;赛,-9.61916079147;獎,-8.51726658322;九,-9.02221175881;远,-8.33069457046;近,-8.89303293018;酣,-13.901761646;团,-7.50411796006;剥,-10.9956415311;古,-6.79996800656;镜,-8.81769888336;讖,-11.3590354253;姨,-9.35543196004;柬,-13.7682302534;药,-6.86599015509;驿,-9.87386218319;仲,-11.1563239128;说,-7.82346430928;坷,-14.2382338826;瓶,-9.34788475441;凸,-10.8437254891;誑,-13.0750830728;勺,-11.3933244988;幽,-9.06095484446;翼,-10.3342430489;孿,-13.901761646;衔,-13.7682302534;极,-8.05738941436;隴,-11.2627043164;耄,-14.7490595064;漆,-9.86373551438;殉,-11.9356487896;計,-6.2880134756;航,-6.48049862906;谦,-13.5450867021;同,-6.48796359144;邏,-8.25379395046;猎,-8.83106211117;徑,-8.56148008036;帐,-9.1154610886;研,-7.07366819486;战,-5.49703351293;愚,-10.711873358;涝,-11.8773798815;谜,-10.5594047644;梟,-12.7121775791;舱,-9.9532689608;劣,-10.1078788829;唢,-10.7978157878;冥,-10.8918447375;弦,-10.6112298322;箩,-11.9356487896;緝,-13.6504472177;暫,-11.0601800523;太,-6.09262624789;断,-8.66304264235;搬,-12.4136845906;肯,-11.8964280765;質,-6.98901882551;都,-7.77053515652;丰,-10.4958136616;檳,-10.8303919582;洲,-12.4803759651;食,-6.55197975599;券,-7.58305096565;麻,-8.21091968263;儺,-13.2086144654;綽,-10.4052540845;尼,-9.62311336579;鼓,-8.91132905923;餾,-11.4782239426;渊,-10.1709179928;資,-4.50869503723;但,-13.7682302534;诉,-11.184232701;橈,-13.2827224376;楊,-9.88924710203;鹿,-9.79323244879;鑌,-13.2827224376;像,-11.1471914293;华,-7.65289015662;騰,-14.0559123258;镢,-11.6429791757;秕,-15.1545246145;塔,-9.98404061946;托,-9.50379136094;距,-7.73035933346;棟,-12.589575257;埡,-11.8046205272;噠,-14.2382338826;畢,-9.65530930559;燥,-12.0864716794;糧,-7.39086575366;審,-10.2093171257;旭,-12.6696179647;葬,-10.5594047644;惯,-8.77609843085;据,-10.8172338737;俱,-9.33295910419;买,-8.55806127361;瓷,-9.05532736759;靶,-10.5295518012;叹,-14.0559123258;鉸,-12.4136845906;籼,-12.3213112704;签,-9.99546931529;蚀,-15.8476717951;襪,-10.4540442487;脅,-12.9032328159;悄,-12.3511642336;还,-10.6547149442;來,-6.88604922552;瘋,-9.93687515102;和,-7.28512290193;瀏,-12.1340997284;庐,-12.1100021768;夕,-10.3796116539;胯,-13.4497765223;搗,-13.139621594;折,-8.69775495893;丛,-9.24372797046;膚,-10.8778584955;贝,-9.18071500263;蠟,-9.29802105283;濱,-9.27819037465;鈣,-10.6547149442;尧,-11.658017053;鹰,-10.7296779826;甾,-11.9356487896;禪,-9.49504239874;蔭,-12.8519395215;撬,-13.2086144654;怯,-12.1587923409;掮,-13.0750830728;漱,-15.8476717951;液,-7.86867542421;险,-10.0607744137;龟,-10.2947122101;鼠,-10.2793272913;蟈,-12.9573000372;匹,-11.7045370687;崽,-11.9764707842;宾,-9.27120222601;蛀,-11.8964280765;駟,-13.5450867021;汇,-7.54590203195;歉,-11.094081604;陋,-11.7533272328;鎦,-13.6504472177;哌,-12.9573000372;偏,-8.29438518946;車,-6.4035249236;网,-6.67784096642;緒,-14.0559123258;饕,-12.2367538824;赏,-9.60739594989;著,-7.777703646;拘,-11.658017053;赝,-12.5518349291;诞,-11.7367979309;坡,-9.42280277116;因,-6.52767016888;痢,-11.3817636764;入,-9.40832142396;烤,-9.86878603016;孩,-6.69411343719;虫,-9.60156502958;蕭,-13.014458451;擬,-11.7367979309;息,-9.57479478852;揮,-11.1937114449;轱,-12.9573000372;仰,-12.0864716794;詳,-10.3382834584;極,-8.05738941436;鯿,-14.0559123258;鑷,-12.8519395215;韶,-14.4613774339;卹,-13.5450867021;勸,-12.8519395215;幻,-8.87319288404;出,-7.354156731;醫,-6.0711089361;顿,-12.8031493573;篾,-12.7566293417;蚁,-11.4656451604;最,-8.11223844256;掃,-9.92609337542;搂,-15.1545246145;独,-8.51595682534;饗,-15.1545246145;檉,-12.0864716794;型,-8.86666605434;竖,-10.5101337154;甌,-14.7490595064;熏,-12.3819358923;茬,-12.8519395215;馱,-12.2641528566;夔,-14.0559123258;斗,-9.69920349915;翘,-12.2641528566;芙,-9.90225118646;供,-7.77832942825;豪,-8.73534435035;樞,-8.40576506701;眠,-15.8476717951;簇,-15.8476717951;带,-9.44244333703;窩,-9.75862691962;笨,-12.0410093053;枫,-11.3703349806;堪,-12.8519395215;播,-10.8989119047;蔬,-8.51464878068;趵,-12.3819358923;鷯,-15.1545246145;估,-7.32748309467;梵,-12.589575257;椴,-12.2100856353;喷,-9.67597119765;阶,-6.50674185338;犹,-9.56540504817;纵,-8.80626013127;债,-6.4278811989;粽,-10.6381856422;禿,-11.094081604;騾,-9.18453909907;杀,-9.0837868865;情,-5.39329210955;获,-10.181245107;埋,-15.1545246145;响,-9.26842058305;界,-8.43732469724;减,-9.65530930559;剎,-10.4183261661;绑,-11.6281640899;罐,-9.29659146002;寓,-9.95602758324;鱒,-13.4497765223;壕,-10.8107191926;奔,-12.1841101489;旗,-7.52746719748;拙,-13.3627651453;进,-7.38261435807;聚,-8.56148008036;离,-8.3678076639;槟,-10.8303919582;詞,-8.462440872;坠,-11.5572123539;口,-6.89403175793;呢,-11.0113898881;煤,-6.88861728035;巧,-10.48169578;鹦,-10.5197956263;嫩,-10.595398367;苦,-8.3678076639;敬,-10.7060082386;扮,-12.6696179647;潰,-10.3222188559;诳,-13.0750830728;棵,-13.139621594;闷,-10.9204181099;噶,-12.3819358923;狹,-12.1841101489;獸,-9.5561026555;翻,-10.4586000652;簾,-10.0950991562;峽,-9.00926659422;蜉,-12.4464744134;姿,-8.76764529514;驾,-8.94593458841;齲,-12.0864716794;范,-6.80279586281;蒂,-14.7490595064;鍵,-10.7539215943;了,-14.4613774339;遼,-12.8031493573;國,-4.62691846782;名,-6.20502966102;骠,-11.5301836815;徐,-13.0750830728;鬓,-11.2129428068;粒,-8.39063970594;蔗,-10.3024943506;暖,-8.99120981047;掘,-12.5518349291;肚,-8.59349394861;鮭,-12.1587923409;減,-9.65530930559;語,-6.85548743289;瘡,-11.4909629684;鞠,-13.7682302534;匣,-10.2831513877;钢,-6.75645285399;冤,-9.74735284304;紧,-9.7384242123;度,-10.0275888647;護,-8.32419048249;末,-8.36611609315;搭,-11.4050205386;脯,-14.2382338826;狙,-12.0410093053;辰,-12.3511642336;贗,-12.5518349291;榴,-9.70134253739;男,-6.75453962399;隶,-11.1655405679;刹,-10.4183261661;鞭,-9.13714868561;鼻,-7.87658604156;為,-9.80503896138;簽,-9.99546931529;餿,-12.5154672849;间,-8.47304277984;擂,-12.4464744134;驴,-10.5695571358;饷,-12.2367538824;浇,-14.0559123258;仆,-9.00072865548;苍,-9.44741434975;餖,-15.1545246145;闌,-12.0864716794;镏,-13.6504472177;硕,-9.72517898555;委,-6.76561944339;敗,-9.41956652238;曖,-13.6504472177;艙,-9.9532689608;佛,-8.22500784374;胚,-8.95198909731;汝,-11.4909629684;飯,-8.30970913529;襟,-11.6281640899;陡,-10.5295518012;埠,-13.7682302534;豇,-12.2100856353;瓢,-11.5301836815;健,-10.00123302;凤,-9.16556319761;绦,-11.5169384548;穩,-8.59420141238;寨,-10.0216716877;纏,-13.6504472177;辦,-6.71345681348;旬,-12.2923237336;拮,-12.4803759651;乱,-9.58047124652;述,-13.0750830728;粗,-9.28947399225;酥,-11.5038663732;長,-6.44563726005;窨,-12.8031493573;特,-6.04444666447;司,-6.97728972899;彻,-13.0750830728;盾,-10.3754011214;籽,-11.955851497;祿,-12.0410093053;潔,-12.3819358923;要,-7.38789587452;栀,-12.5154672849;沃,-11.6281640899;芫,-12.4803759651;辅,-10.0856204123;脆,-11.0034847086;箍,-15.1545246145;序,-8.74847005151;障,-8.2954345075;逐,-12.7121775791;钓,-11.5038663732;缂,-12.4464744134;飞,-6.94114287747;阔,-8.95097746344;趙,-13.5450867021;氘,-15.8476717951;肛,-10.2831513877;会,-6.09564687173;舜,-14.2382338826;鲣,-12.6696179647;虚,-8.82569537199;羥,-10.4449944132;犧,-11.1114733467;焦,-8.23089598636;閩,-11.8586877485;吨,-11.0854978603;被,-7.88316843151;圪,-10.0275888647;训,-9.8242242021;躯,-9.49330175427;洮,-12.9573000372;茲,-15.1545246145;迟,-12.9032328159;骷,-11.0354874397;餶,-15.8476717951;尸,-8.10396853689;傻,-9.23697575035;强,-7.09588090229;唾,-9.95879383673;槁,-14.4613774339;桀,-14.2382338826;迅,-13.014458451;湄,-12.1841101489;拇,-10.6828858211;龍,-7.4376184792;论,-7.42588878845;经,-4.53352659133;金,-5.32651520314;遐,-13.901761646;卒,-12.7566293417;癔,-13.014458451;锱,-14.7490595064;飘,-12.3819358923;佚,-11.5038663732;菝,-14.7490595064;蛟,-11.72053741;敞,-13.4497765223;孢,-9.30232213473;鯧,-12.589575257;琐,-11.7045370687;嗩,-10.7978157878;周,-6.95602268241;坪,-14.7490595064;语,-6.85548743289;詬,-11.5169384548;滯,-10.9060293725;浮,-8.79581617211;聰,-10.8107191926;輝,-10.2679419691;柵,-10.9204181099;晴,-10.1709179928;奶,-7.86150693473;鷹,-10.7296779826;鱸,-11.5169384548;僻,-12.0864716794;編,-7.18412970731;调,-8.82302276461;鹪,-15.1545246145;顫,-12.0864716794;麗,-11.8046205272;與,-11.4168549962;撈,-14.4613774339;錙,-14.7490595064;验,-11.9356487896;帏,-14.7490595064;香,-7.51680818184;隔,-9.87896423508;樗,-15.1545246145;視,-7.66959433121;魏,-13.2086144654;芜,-13.6504472177;星,-7.50031838294;餡,-11.1381415938;颠,-12.7566293417;鰣,-11.5038663732;客,-6.50823484975;弥,-10.2492498361;纤,-8.18004570348;陨,-9.85620724795;甩,-13.6504472177;咨,-10.7478053672;鸷,-14.4613774339;港,-7.57484579141;涮,-12.6696179647;脱,-10.2831513877;證,-5.7320611945;莲,-8.73208966888;朵,-13.0750830728;暴,-8.27260009556;軸,-9.16807260922;紹,-12.1100021768;岸,-9.91277759944;逻,-8.25379395046;銼,-13.139621594;阿,-7.57051402263;疾,-7.62484966425;襁,-11.8586877485;检,-8.7329023467;毂,-12.9032328159;轅,-10.7478053672;仄,-14.0559123258;扇,-9.38308349137;臆,-14.7490595064;蕉,-12.8031493573;镍,-11.5038663732;鈕,-12.4464744134;灶,-10.5246618159;筍,-11.2937949035;嫌,-9.22360656726;兑,-12.6696179647;呓,-13.2086144654;漢,-7.52771077318;盔,-10.8172338737;畸,-9.32557899689;浙,-12.3511642336;俚,-11.72053741;拜,-11.2032808959;號,-8.67524721794;齑,-12.4136845906;寢,-10.2566848146;剧,-7.53897987822;哨,-9.79323244879;桫,-12.5154672849;黏,-10.6006477229;湯,-10.0793507993;淮,-12.6287959702;腱,-13.2086144654;惰,-11.3590354253;菲,-12.8519395215;杵,-14.4613774339;更,-10.9573226668;穷,-9.40832142396;絹,-11.5572123539;狼,-10.1573123407;豌,-10.286990164;闾,-13.014458451;梁,-12.7566293417;老,-5.43784868403;樂,-7.83830871843;雞,-8.44217613186;耆,-11.9356487896;馋,-12.9573000372;蘊,-10.0577116242;窍,-10.48169578;嬌,-11.6429791757;導,-6.85885129328;傑,-10.5493544285;儐,-13.901761646;間,-8.47304277984;划,-11.4168549962;隕,-9.85620724795;栖,-11.9158461623;沙,-7.14333535657;膛,-12.4803759651;业,-5.72212127483;芝,-9.81939327483;茜,-12.4136845906;螟,-12.5154672849;搞,-14.4613774339;閱,-10.4405000236;麥,-8.75926301639;鎧,-11.0034847086;倦,-12.3819358923;钩,-11.2325512782;用,-6.74502799854;榫,-13.2086144654;瘪,-13.901761646;謬,-10.8709380526;侯,-11.6135652905;氮,-9.97555400559;肱,-13.3627651453;鈾,-10.9350169093;戲,-7.66875246221;朴,-10.5394040977;冻,-9.57102830572;瞿,-15.8476717951;裁,-9.40195197568;睡,-9.70563438948;跃,-13.5450867021;滅,-11.8586877485;纷,-10.7356840067;菇,-14.4613774339;恆,-8.70247566007;效,-6.6025435976;始,-9.8169865348;酰,-10.6165631782;孌,-12.9032328159;忏,-13.3627651453;屎,-13.6504472177;僑,-10.1847113149;嗓,-8.94191851875;闢,-15.1545246145;雕,-8.40987667339;毗,-12.7121775791;赘,-12.0864716794;钎,-13.139621594;奠,-10.0919295815;緣,-9.03532670089;婢,-12.1100021768;绥,-14.2382338826;彤,-12.8519395215;讲,-8.32041587569;噪,-9.40195197568;諭,-10.4315713929;俯,-12.4803759651;蘼,-13.7682302534;胱,-14.0559123258;慰,-11.8223201043;色,-7.58743750346;蝴,-9.89963680588;篷,-13.2827224376;顶,-8.41223377525;击,-12.8519395215;獼,-10.2604231367;矿,-6.7734948479;鈐,-13.7682302534;清,-6.98038527107;侄,-9.24102160886;指,-5.69194801701;肖,-10.3382834584;騍,-14.4613774339;完,-10.7177730801;式,-10.2604231367;蓬,-14.2382338826;瀑,-9.07459141941;魚,-7.56746756178;犒,-12.2641528566;聯,-7.19176068433;袖,-9.50203543423;氙,-12.0634821611;愛,-7.86116685651;亚,-7.83499086536;莜,-12.4136845906;期,-6.56037038195;撞,-12.3511642336;堡,-10.2566848146;帥,-12.4803759651;群,-6.76778185247;邦,-11.599176553;吩,-15.8476717951;铠,-11.0034847086;險,-10.0607744137;設,-6.65835079031;伯,-9.03422719555;沮,-14.2382338826;燉,-12.9032328159;鲛,-14.2382338826;昵,-13.4497765223;缟,-12.9032328159;嬷,-11.0354874397;颶,-11.2833236036;鰹,-12.6696179647;綸,-13.901761646;纺,-7.61337215937;刽,-11.4168549962;費,-7.57919640608;钾,-10.4139497915;桁,-11.4909629684;觀,-6.88540824095;赃,-10.9956415311;俄,-10.0246258996;胆,-8.44644053065;葉,-8.0702981924;奋,-14.7490595064;積,-7.90958306817;富,-8.01684879993;齏,-12.4136845906;鹌,-11.5436067019;灑,-13.6504472177;鯨,-11.584991918;勒,-10.9204181099;陕,-12.5518349291;狸,-11.2425016091;淘,-12.1100021768;滚,-10.3342430489;菜,-8.60130371496;束,-12.0190303986;蕲,-13.7682302534;卧,-9.588090331;烦,-12.2923237336;痨,-12.4803759651;盪,-13.6504472177;詭,-11.094081604;诬,-13.6504472177;软,-8.11223844256;購,-8.72641934182;谩,-14.7490595064;青,-6.79585833131;柴,-8.63022836337;筷,-9.65735638921;壶,-12.589575257;鷸,-15.8476717951;养,-8.68217832;建,-6.12955042951;剽,-15.8476717951;链,-9.15682951764;言,-8.40050343546;溃,-10.3222188559;褂,-11.094081604;超,-8.19086170358;肇,-11.5572123539;蜀,-11.2425016091;蔊,-15.1545246145;妍,-15.8476717951;砌,-12.1841101489;缎,-11.094081604;爐,-9.78621487613;皓,-13.901761646;儒,-8.72238870355;鼎,-12.589575257;梗,-12.589575257;邵,-12.2641528566;丘,-7.97980030467;抛,-11.0769871706;膝,-9.62311336579;审,-10.2093171257;稠,-13.4497765223;夢,-8.99437270188;尤,-12.3213112704;傧,-13.901761646;錦,-8.72319353257;貯,-11.658017053;牵,-10.2345436887;戰,-5.49703351293;苟,-15.1545246145;徹,-13.0750830728;常,-7.5321053115;銻,-13.901761646;值,-9.74511320045;眾,-7.3401249807;毁,-11.184232701;跡,-8.32743723859;淅,-15.1545246145;迂,-14.7490595064;捆,-14.4613774339;立,-8.35491149414;种,-6.95932892595;塌,-14.4613774339;鳏,-13.901761646;彎,-10.4052540845;发,-6.39839326587;囓,-11.8773798815;兒,-6.76108223052;痕,-9.40195197568;蹦,-14.4613774339;棗,-10.2492498361;这,-11.9158461623;乘,-8.64426627398;招,-8.1767769637;赚,-13.0750830728;杞,-14.2382338826;寡,-9.09540141892;廣,-7.57637914208;奢,-10.3302188986;工,-4.88327382104;層,-8.1661114325;僧,-8.97450796085;卦,-14.4613774339;矩,-10.1472282217;器,-7.54689483421;諫,-14.4613774339;畦,-15.8476717951;衬,-9.80266648103;潮,-8.70011252387;菱,-10.3262108772;扰,-13.2086144654;曳,-12.1340997284;螯,-13.901761646;輿,-8.98491388201;磷,-8.98700812361;翹,-12.2641528566;幸,-10.4449944132;勻,-15.1545246145;函,-8.23731417675;灼,-12.0634821611;睾,-10.3880862809;檀,-10.5295518012;七,-9.86121978978;概,-6.84423259885;販,-11.1381415938;饭,-8.30970913529;莆,-13.6504472177;有,-6.46337811596;暈,-15.8476717951;程,-6.56166751917;阖,-14.4613774339;复,-8.39584955853;碌,-12.4136845906;小,-5.21978067232;美,-7.08800312403;冒,-10.6165631782;咔,-13.901761646;栗,-10.8778584955;殖,-8.26493330615;伙,-8.58925964447;亘,-12.4136845906;舛,-14.4613774339;饮,-7.81368906038;牝,-14.4613774339;辛,-11.7872287845;枞,-13.4497765223;窠,-12.5518349291;縣,-7.10398068452;瀚,-12.6287959702;诈,-12.0864716794;粤,-11.5436067019;厦,-14.0559123258;圩,-11.4409525478;貝,-9.18071500263;喪,-9.96993601328;椭,-9.10243544558;胳,-8.79063481336;氯,-9.28240682503;侮,-13.4497765223;茱,-13.014458451;詢,-15.8476717951;憲,-8.117057729;纖,-8.18004570348;蒴,-10.711873358;砷,-11.8586877485;家,-6.15342488867;弹,-7.45740329722;庸,-11.6887887117;刻,-9.718621585;嶺,-9.97555400559;炼,-9.97837488193;乃,-11.9356487896;绊,-12.2923237336;浅,-9.15682951764;泄,-11.9764707842;籠,-10.5005642643;杉,-10.595398367;譙,-13.2827224376;霸,-9.33147871902;屏,-8.87132372462;翎,-11.7045370687;卑,-9.90225118646;狐,-9.99546931529;噓,-12.9573000372;燒,-9.08725710398;哔,-12.9573000372;街,-8.357142393;余,-8.27877613166;付,-11.3817636764;淚,-8.46866366743;餘,-8.27877613166;胜,-8.65925905857;摟,-15.1545246145;柞,-10.579813636;章,-9.1383674548;幣,-10.3670328717;駢,-11.0193580578;另,-11.0436507503;坩,-12.1100021768;雨,-8.31987780734;橫,-8.88164760796;渦,-9.49678607835;業,-5.72212127483;修,-8.83735992776;懲,-11.4050205386;敵,-7.06888386596;擴,-10.3342430489;鲸,-11.584991918;寶,-7.27959539333;役,-11.8586877485;绸,-10.181245107;鉻,-11.599176553;裤,-9.01679756042;兽,-9.5561026555;螫,-13.5450867021;鑿,-11.8046205272;矾,-15.1545246145;檁,-13.5450867021;謀,-9.84873523312;较,-12.9032328159;駿,-10.6491747638;舆,-8.98491388201;珙,-11.3703349806;月,-6.22059672272;宋,-10.2793272913;萊,-11.8223201043;驕,-11.571005676;餌,-10.8989119047;綏,-14.2382338826;劑,-9.84131863546;錐,-10.1777908721;酒,-7.27239839257;倒,-9.47948460871;钕,-14.2382338826;锔,-14.7490595064;亙,-12.4136845906;优,-7.0797198853;掛,-10.0485791406;谚,-11.0518812495;肝,-8.49330946464;骄,-11.571005676;骡,-9.18453909907;鲥,-11.5038663732;鈦,-13.2827224376;瞄,-13.7682302534;在,-11.2833236036;貧,-8.84278980535;梭,-10.2831513877;抱,-10.7356840067;枳,-12.7121775791;鰲,-11.7872287845;鬼,-8.67218208144;陰,-7.37673198816;纹,-9.55795622415;缸,-11.7367979309;去,-9.02874772979;尺,-8.60702210081;瘾,-13.6504472177;促,-10.785076762;桂,-9.77924620682;资,-4.50869503723;懇,-14.2382338826;曉,-14.2382338826;蝈,-12.9573000372;摊,-9.64919307857;镣,-12.589575257;獐,-11.6887887117;韓,-12.3819358923;镔,-13.2827224376;願,-9.26150014021;茸,-11.955851497;仙,-8.80538562312;潘,-14.2382338826;換,-10.8640651734;豚,-12.7566293417;虞,-13.2086144654;嫡,-11.1027396667;锑,-13.901761646;塢,-15.8476717951;鳥,-8.4544087003;燧,-12.1100021768;牦,-10.1306440937;坨,-12.9573000372;毫,-10.1606964387;瑪,-10.310337528;鵲,-12.8031493573;路,-7.32808147905;贼,-10.0856204123;拱,-10.2345436887;柳,-9.49678607835;聲,-6.496005487;膂,-12.9573000372;整,-6.85337523729;婶,-9.60156502958;猕,-10.2604231367;烽,-10.60592478;兼,-12.6287959702;痿,-13.6504472177;百,-6.84104006176;樁,-13.2086144654;讀,-8.62000929633;較,-12.9032328159;鉭,-13.4497765223;嬋,-13.2086144654;胰,-9.46924561141;砍,-11.4909629684;刑,-8.64129450359;圓,-7.82773010739;炒,-10.6381856422;吕,-13.139621594;酵,-10.7478053672;题,-7.39768735334;丙,-9.45408104111;辘,-12.2641528566;思,-6.63085245699;膜,-11.8773798815;酚,-12.0634821611;宠,-10.590176423;鰥,-13.901761646;饽,-11.7872287845;鄧,-11.3817636764;苘,-13.4497765223;咪,-11.9975241934;贯,-13.3627651453;亮,-9.00498851282;羈,-11.72053741;悲,-8.98910676027;萵,-12.2367538824;夷,-13.139621594;骶,-13.901761646;医,-6.0711089361;唿,-12.2367538824;难,-8.05079145228;酋,-9.91013558998;毀,-11.184232701;佃,-9.69920349915;裂,-8.92109476184;荷,-9.10125966649;拆,-11.584991918;晉,-13.014458451;蓍,-13.3627651453;筋,-9.94503846166;擊,-12.8519395215;額,-7.95559337381;黎,-11.2325512782;剑,-10.0335412632;珐,-11.658017053;靓,-12.6287959702;瑕,-11.658017053;痔,-12.1340997284;論,-7.42588878845;乙,-8.16888279686;俘,-9.52152232191;蛞,-13.014458451;黑,-6.90691166017;选,-8.28395212665;飢,-8.92502790359;履,-10.0305606351;瘧,-10.8504595213;內,-5.90055020551;鋦,-14.7490595064;噩,-10.2418697288;驽,-15.8476717951;譫,-11.8964280765;篓,-11.8964280765;艱,-12.6696179647;虯,-12.0190303986;頑,-10.590176423;葵,-11.0436507503;軲,-12.9573000372;祷,-13.5450867021;競,-8.38430874954;幹,-6.86347948342;磕,-14.4613774339;獻,-12.1841101489;琵,-9.85871037817;偽,-9.36916215285;畿,-11.1202839764;图,-6.98646345785;梃,-14.7490595064;漂,-11.658017053;舀,-15.8476717951;韩,-12.3819358923;铲,-11.2729608166;邸,-13.7682302534;希,-9.88666645544;骏,-10.6491747638;礎,-15.8476717951;疑,-8.48312478081;吐,-10.6112298322;猝,-13.7682302534;園,-8.357142393;厕,-9.6035048944;鈔,-10.5197956263;贖,-11.599176553;謾,-14.7490595064;禮,-7.60412628713;枝,-9.28381626853;萄,-15.8476717951;由,-10.8709380526;碣,-12.2367538824;缢,-13.139621594;鎢,-11.1291729238;隧,-9.00712526577;锦,-8.72319353257;沫,-12.8031493573;匪,-11.0436507503;辭,-10.0607744137;測,-10.2947122101;辉,-10.2679419691;麦,-8.75926301639;舴,-15.1545246145;康,-8.41518798715;零,-8.32797939095;妹,-8.32311056878;頸,-9.79793833983;钻,-9.06095484446;笺,-11.5436067019;势,-7.49511742559;腋,-11.4909629684;汀,-12.589575257;轂,-12.9032328159;毅,-11.1748429606;橄,-9.92877794079;曇,-13.139621594;靠,-10.2381999999;應,-9.23563076023;醍,-13.2086144654;铀,-10.9350169093;荊,-10.6943802006;忍,-11.9158461623;幌,-11.4288311873;奎,-11.658017053;呐,-11.8964280765;貫,-13.3627651453;剔,-12.9573000372;赖,-11.8403386098;苋,-12.8031493573;拟,-11.7367979309;巡,-8.27260009556;屠,-10.6165631782;形,-5.74148832648;蜗,-10.2831513877;盧,-10.1339389896;啦,-14.7490595064;釩,-14.7490595064;鞋,-9.20258082556;若,-11.8964280765;迭,-13.4497765223;纓,-13.014458451;旱,-9.15310973654;想,-8.39759222526;蝲,-14.4613774339;廷,-11.2325512782;孺,-12.5154672849;矽,-9.43093951255;發,-6.39839326587;勿,-12.1340997284;縐,-13.901761646;洁,-12.3819358923;檄,-11.1027396667;蘇,-9.11189178082;髯,-13.139621594;脉,-8.95401544046;铭,-9.97555400559;尋,-13.2827224376;莊,-8.58714919697;續,-10.4009344234;騏,-14.4613774339;馎,-15.8476717951;甑,-15.8476717951;垒,-12.3213112704;匕,-11.1381415938;渗,-10.2345436887;瘘,-13.2827224376;朝,-7.16632101748;蚜,-11.5038663732;舟,-11.4288311873;紡,-7.61337215937;砣,-15.1545246145;锚,-11.9975241934;鬥,-9.69920349915;骤,-11.8586877485;嘧,-11.8964280765;轰,-9.56353763399;储,-7.84598181696;氫,-8.99015773252;京,-8.58154301551;樯,-15.1545246145;榮,-9.01033898038;撰,-11.5038663732;耳,-7.86354983636;茵,-12.7566293417;芴,-15.8476717951;帷,-10.1916799842;夹,-9.29231490325;吻,-14.0559123258;霽,-15.1545246145;嚼,-12.5518349291;饴,-13.2086144654;流,-6.15059359485;賀,-11.4909629684;桃,-9.1432574401;珊,-8.8638818298;屋,-8.15419015423;菊,-9.81939327483;軌,-7.88316843151;道,-6.59599755959;单,-6.42262335059;訓,-9.8242242021;淖,-15.8476717951;棘,-11.6429791757;葛,-12.1340997284;诚,-9.95879383673;絡,-11.4782239426;糠,-11.9158461623;貳,-13.7682302534;颧,-11.599176553;痦,-13.6504472177;兩,-7.59418376672;賽,-9.61916079147;豫,-11.1114733467;只,-13.5450867021;潭,-11.72053741;滬,-10.3262108772;恳,-14.2382338826;艦,-8.02562778688;拴,-13.7682302534;限,-8.6156614634;鸨,-12.0190303986;磺,-11.571005676;寺,-8.91035771384;盼,-12.5518349291;花,-6.67846596645;沁,-13.4497765223;贪,-10.3302188986;輔,-10.0856204123;欄,-9.59962892055;枇,-11.3590354253;肉,-8.15601497225;脈,-8.95401544046;載,-8.93095677471;戊,-11.4656451604;宏,-7.29125789049;貉,-13.7682302534;唐,-10.0731202495;侗,-13.7682302534;氖,-13.6504472177;濃,-8.63537732656;蜜,-9.42442483153;岡,-14.4613774339;素,-8.30598869518;鸢,-12.5154672849;窥,-14.2382338826;嬤,-11.0354874397;否,-11.7872287845;傩,-13.2086144654;刪,-14.7490595064;亭,-10.1014686045;漬,-13.2086144654;殯,-11.7872287845;雜,-7.46859190578;膳,-10.4910855204;抵,-10.0824806923;茴,-12.2641528566;德,-9.25874531753;夸,-10.8237912742;閻,-10.6771878;看,-8.06569856063;县,-7.10398068452;倾,-8.39006250535;況,-14.7490595064;颊,-13.2086144654;賣,-9.20128128022;摆,-10.5594047644;慈,-11.1381415938;緋,-11.7045370687;绍,-12.1100021768;彌,-10.2492498361;顎,-13.7682302534;哑,-9.48120134733;镐,-13.901761646;動,-5.88964870988;協,-6.82161490319;俗,-9.70994474098;裙,-10.1916799842;耕,-8.56835295965;訣,-12.0864716794;曝,-13.5450867021;杜,-9.81219036254;菟,-12.2100856353;聞,-12.2100856353;峡,-9.00926659422;姣,-15.1545246145;鲳,-12.589575257;童,-9.13958771121;孤,-9.30519983456;韧,-9.96713880866;龐,-15.8476717951;烩,-11.3703349806;全,-5.01535247916;淫,-10.7001773182;剪,-9.72080261095;转,-8.18051353974;毯,-11.6281640899;蠼,-15.8476717951;数,-5.58051382408;至,-11.1655405679;貿,-9.79323244879;部,-5.15062627603;訊,-11.5572123539;奸,-9.65530930559;闻,-12.2100856353;婺,-13.139621594;国,-4.62691846782;灾,-8.30651933993;亂,-9.58047124652;樅,-13.4497765223;紋,-9.55795622415;把,-8.94996685193;後,-6.42804341806;碎,-8.90165780396;向,-9.21698840942;難,-8.05079145228;醒,-12.8031493573;众,-7.3401249807;莘,-13.901761646;病,-6.66388075832;頭,-6.73516478344;闖,-12.5518349291;果,-7.92215281528;詔,-9.66972768101;簡,-9.04638876059;綠,-7.5892493326;红,-6.61743076138;娥,-13.4497765223;室,-9.72298840417;闪,-9.42930685913;钦,-10.7662674301;倩,-12.7121775791;熨,-12.589575257;贫,-8.84278980535;中,-5.16325514858;聳,-12.9032328159;鋅,-12.9573000372;萱,-13.2086144654;新,-5.75741426133;醬,-10.4271367958;蟲,-9.60156502958;舵,-11.8046205272;莴,-12.2367538824;強,-7.09588090229;鲶,-12.9032328159;頹,-10.8640651734;獵,-8.83106211117;画,-7.63591739769;窺,-14.2382338826;瞼,-13.7682302534;匿,-12.4136845906;傾,-8.39006250535;汁,-11.1563239128;淀,-9.95879383673;滂,-14.7490595064;评,-8.03327216126;蝇,-13.6504472177;蛾,-11.955851497;重,-6.11473534372;忌,-13.7682302534;筏,-11.4532226404;风,-5.59949585113;鑑,-11.0193580578;盒,-10.0824806923;叔,-8.84642617299;衙,-8.31451298761;蝎,-10.9350169093;晝,-9.718621585;柜,-9.80980087514;损,-7.64464155335;胞,-11.6281640899;締,-9.98120373813;廢,-8.58084444754;關,-5.77334502284;鯤,-11.3043770128;爛,-10.7914259897;瓦,-9.29659146002;適,-9.87896423508;约,-9.63506569931;譯,-9.25462726092;森,-7.69460984826;葱,-10.7978157878;腳,-7.51970393676;曲,-7.96422544093;援,-9.95602758324;罷,-14.7490595064;島,-8.53511829696;塹,-12.3819358923;秸,-11.8964280765;白,-6.32756990549;一,-5.9967941928;紀,-7.88665032918;戈,-9.96713880866;麋,-11.8964280765;脊,-8.86573711791;鋒,-10.62731597;閬,-14.0559123258;鞑,-10.3712082431;锒,-14.4613774339;冕,-14.7490595064;途,-8.50295274091;细,-6.66019071723;諢,-12.589575257;猪,-8.97037572357;搜,-11.4782239426;悟,-12.2100856353;謄,-15.8476717951;御,-8.65925905857;鸱,-12.7566293417;索,-9.97837488193;妥,-14.0559123258;堤,-9.94230994701;咧,-15.1545246145;厩,-13.4497765223;刨,-11.3368122885;享,-11.8773798815;優,-7.0797198853;氬,-14.7490595064;梯,-9.1481714549;襠,-14.2382338826;芳,-9.4342128379;鳟,-13.4497765223;鲷,-13.2827224376;容,-8.28811229906;示,-9.95051792743;喽,-10.3754011214;吼,-11.6281640899;匾,-11.1471914293;濁,-10.4227217776;菡,-14.0559123258;櫃,-9.80980087514;舊,-8.32527156368;桄,-14.7490595064;擇,-13.901761646;杆,-9.2091040059;肅,-12.5154672849;扈,-11.7045370687;腊,-10.5394040977;籌,-9.52152232191;肋,-10.8572392083;爹,-10.0425368261;燕,-9.16681711627;達,-9.80029961602;泗,-14.7490595064;橘,-11.1655405679;蛛,-11.1937114449;楚,-9.40992014533;藝,-6.93843651587;捞,-14.4613774339;翡,-10.310337528;竣,-15.8476717951;姥,-10.6943802006;铧,-14.0559123258;坦,-7.61682823086;叩,-12.8031493573;警,-7.59861952089;豬,-8.97037572357;靈,-8.04832839685;柱,-9.38152707083;拳,-9.03203180499;敲,-11.2833236036;对,-6.64920159566;驸,-10.181245107;電,-5.08091461263;饺,-10.0246258996;闽,-11.8586877485;呼,-9.07116480269;獾,-14.7490595064;企,-5.55861576613;肄,-15.1545246145;涂,-10.0335412632;椅,-8.85557536765;闺,-9.61719034748;按,-10.0887700212;燭,-10.2345436887;隱,-8.62073577657;納,-8.96216212503;鄰,-8.77355497887;鮎,-11.9975241934;隐,-8.62073577657;閒,-8.93791851342;儕,-14.7490595064;炔,-14.0559123258;谗,-11.9158461623;璽,-12.7121775791;謙,-13.5450867021;誘,-10.2128821919;攝,-8.83375632025;蒜,-11.325883218;庠,-13.7682302534;鱖,-12.8031493573;綢,-10.181245107;夥,-8.58925964447;颤,-12.0864716794;吧,-14.0559123258;垦,-11.4288311873;猩,-11.4656451604;动,-5.88964870988;丫,-8.39063970594;冪,-12.2923237336;购,-8.72641934182;绳,-9.09891224757;议,-7.20896918625;朱,-9.81219036254;蚰,-11.6429791757;戳,-13.2827224376;襲,-12.589575257;肴,-12.6287959702;簷,-13.7682302534;羶,-12.9573000372;领,-5.87788165327;阻,-8.76933021551;钼,-11.955851497;什,-10.48169578;棄,-12.2923237336;摇,-10.0157893178;草,-6.92581381571;臊,-11.9158461623;糌,-13.2827224376;顏,-8.06319855933;坑,-9.60739594989;盐,-8.03691367853;烧,-9.08725710398;汗,-9.18453909907;陸,-7.60834236716;歙,-12.9573000372;鎬,-13.901761646;虛,-8.82569537199;苎,-10.9350169093;敝,-14.7490595064;霉,-10.2418697288;笤,-11.9764707842;罡,-15.8476717951;廠,-7.96234255579;巢,-11.1114733467;奥,-9.37532550056;壤,-11.3150723019;阆,-14.0559123258;赭,-12.0410093053;賬,-7.75024549647;颞,-12.3213112704;東,-6.26019720475;扳,-10.9573226668;胴,-12.9573000372;鱷,-11.5572123539;筹,-9.52152232191;噻,-11.7367979309;哼,-13.6504472177;偿,-11.7533272328;現,-6.13208131365;躁,-13.4497765223;爪,-10.4586000652;梅,-8.98700812361;文,-5.2502373818;昆,-8.58925964447;舒,-10.3342430489;律,-8.50037209432;鲍,-11.7872287845;福,-8.3543545462;税,-7.61896099627;炻,-14.7490595064;炕,-10.4863796294;讯,-11.5572123539;世,-5.25949775288;攜,-11.4909629684;舞,-7.79092802009;张,-10.8437254891;宣,-8.22696670822;錮,-13.7682302534;喧,-12.8031493573;瘦,-10.4095924861;助,-8.82213348042;錨,-11.9975241934;辫,-10.4139497915;篩,-11.2325512782;贬,-12.8031493573;暱,-13.4497765223;疝,-13.0750830728;莳,-15.1545246145;防,-8.18379453636;帶,-9.44244333703;嬸,-9.60156502958;瞻,-15.1545246145;砺,-15.8476717951;咽,-9.54322299264;爾,-13.014458451;仁,-9.69706902662;求,-11.3933244988;装,-6.67016458018;襄,-14.7490595064;蟠,-11.5436067019;拉,-9.1226381529;聊,-12.589575257;糍,-13.6504472177;嵌,-13.4497765223;穎,-12.8031493573;监,-8.02482650478;坐,-8.83826286235;鉑,-11.9975241934;鏤,-15.1545246145;僕,-9.00072865548;兔,-9.74064890732;跗,-12.3511642336;乖,-10.837036501;識,-11.2627043164;練,-11.1202839764;蓝,-8.13076565976;臟,-9.38464233814;診,-10.711873358;狩,-9.84873523312;獨,-8.51595682534;濫,-12.6287959702;賭,-9.75862691962;眼,-6.12295212112;蛱,-13.4497765223;杰,-10.5493544285;馒,-9.45575468167;巷,-10.3302188986;并,-10.2455529742;竹,-8.23681900467;學,-5.51744699914;韻,-9.77693406706;顺,-8.68993631081;啼,-12.6696179647;凿,-11.8046205272;丁,-9.80029961602;澀,-13.7682302534;沂,-13.014458451;栅,-10.9204181099;舉,-7.97331297033;授,-11.7872287845;弋,-12.4803759651;莖,-11.7045370687;對,-6.64920159566;夏,-9.5468860004;馏,-11.4782239426;阑,-12.0864716794;咒,-10.8042466781;瀕,-15.8476717951;熔,-8.86573711791;洗,-9.33592646542;準,-8.35268556111;標,-6.30014515573;殘,-8.31826533723;望,-9.42118333761;萝,-10.0669282793;斜,-9.15558805256;感,-6.8240225124;需,-6.70443322663;鸡,-8.44217613186;鬣,-11.8046205272;鲢,-12.8031493573;唧,-13.901761646;利,-5.79421371595;厨,-9.04527703174;漫,-10.3382834584;身,-6.34810055064;颜,-8.06319855933;魷,-11.9975241934;撲,-11.0601800523;耵,-14.7490595064;庶,-10.4227217776;页,-9.91542660761;確,-9.85371036776;钒,-14.7490595064;疼,-8.85465667213;儿,-6.76108223052;激,-7.60570523483;桅,-11.184232701;规,-5.35695328756;蛆,-12.0190303986;扉,-12.589575257;黍,-13.5450867021;齋,-11.7045370687;惊,-10.3923506797;屍,-8.10396853689;奏,-9.04973138209;罌,-10.579813636;卓,-12.0634821611;哒,-14.2382338826;稱,-8.63096230835;诏,-9.66972768101;他,-9.58427353247;橙,-10.534465816;锥,-10.1777908721;棚,-10.4770337669;睑,-13.7682302534;轻,-8.27465453901;苞,-11.2129428068;繡,-10.6828858211;忠,-8.84642617299;季,-6.22112421845;鹅,-10.6491747638;秤,-11.9764707842;啧,-15.1545246145;剩,-9.47264697523;鏨,-14.7490595064;跬,-15.8476717951;襯,-9.80266648103;諮,-10.7478053672;虱,-11.0193580578;缩,-9.40354053836;擲,-12.8031493573;致,-9.98973864058;延,-10.3262108772;穹,-10.7237078157;寸,-11.6887887117;壺,-12.589575257;命,-7.11681989154;痼,-12.1841101489;酿,-12.1340997284;勾,-9.77924620682;倀,-15.1545246145;蛴,-13.3627651453;祠,-10.0669282793;锯,-10.3382834584;專,-6.29020189199;範,-6.80279586281;弊,-10.004127378;舌,-9.01141251779;蠐,-13.3627651453;蝨,-11.0193580578;謂,-11.325883218;辕,-10.7478053672;渔,-8.06111998863;髖,-12.6696179647;焖,-15.1545246145;疙,-10.0731202495;羅,-8.97347329961;颛,-11.3703349806;宝,-7.27959539333;废,-8.58084444754;怠,-12.9032328159;撣,-13.6504472177;驚,-10.3923506797;涩,-13.7682302534;氨,-9.03863248902;炫,-13.6504472177;伪,-9.36916215285;厭,-12.589575257;爬,-10.2566848146;售,-9.27959388365;禱,-13.5450867021;堰,-15.8476717951;岳,-9.3095319713;徵,-9.38933351172;方,-4.8621248672;机,-4.93447602996;讽,-12.1100021768;亿,-13.901761646;派,-8.86018154806;铃,-10.5053375431;附,-8.79668234799;竇,-12.9573000372;骨,-7.64985776284;屈,-9.64311403249;齊,-10.2057647241;解,-8.60130371496;蛏,-13.7682302534;蕎,-10.7417263212;桐,-10.7417263212;賓,-9.27120222601;濕,-9.19351927488;乔,-9.69281370105;狗,-9.4342128379;痙,-12.9573000372;员,-8.45564022755;飛,-6.94114287747;坚,-10.4449944132;寝,-10.2566848146;廟,-9.19351927488;絞,-10.3262108772;换,-10.8640651734;查,-13.6504472177;諧,-10.1143305182;楦,-13.901761646;題,-7.39768735334;豨,-15.8476717951;烫,-14.4613774339;鋸,-10.3382834584;叭,-14.4613774339;鉬,-11.955851497;鸞,-13.2827224376;啮,-11.8773798815;駱,-9.70994474098;鳳,-9.16556319761;筲,-15.1545246145;念,-9.01356305625;年,-5.72842790965;拷,-11.4909629684;慶,-10.2381999999;鮮,-8.27157445444;摸,-9.83885860962;響,-9.26842058305;毽,-13.7682302534;仿,-11.0113898881;频,-8.17631087187;鬢,-11.2129428068;傀,-10.8237912742;吃,-10.1405615303;厂,-7.96234255579;雛,-10.0305606351;的,-10.5246618159;娇,-11.6429791757;妆,-11.8773798815;鴉,-9.41956652238;静,-8.69383799348;羊,-8.1424093202;昏,-11.6429791757;輪,-7.94444498633;谓,-11.325883218;讒,-11.9158461623;漕,-10.8918447375;五,-7.79856407374;列,-8.60273024873;错,-7.99019100812;略,-11.5169384548;鸟,-8.4544087003;肠,-9.1743738273;探,-8.62219032228;蜥,-11.0193580578;镰,-11.1027396667;洩,-11.9764707842;貨,-6.01423124084;倫,-9.27120222601;侪,-14.7490595064;瘌,-15.1545246145;犬,-10.837036501;嘯,-12.8031493573;單,-6.42262335059;失,-8.53511829696;碰,-13.014458451;張,-10.8437254891;户,-8.15921643851;憶,-14.4613774339;改,-9.58618011074;撸,-14.7490595064;蠻,-10.9350169093;螺,-8.46120094623;欽,-10.7662674301;馍,-11.7045370687;趾,-12.5518349291;允,-13.7682302534;参,-7.33027862364;迷,-9.75636191299;姆,-13.7682302534;配,-8.7048443939;恋,-10.6547149442;捍,-14.7490595064;離,-8.3678076639;髓,-12.3213112704;毒,-7.93268878921;何,-9.80980087514;仔,-13.0750830728;鉗,-11.3590354253;祸,-9.66765514141;留,-9.98973864058;腧,-10.6943802006;顛,-12.7566293417;孝,-9.72517898555;州,-9.09540141892;魑,-14.4613774339;董,-7.3642422338;王,-6.69157643794;来,-6.88604922552;蛤,-10.8042466781;触,-9.47264697523;浩,-11.4532226404;注,-8.73779233199;火,-6.29971698189;迪,-12.8031493573;災,-8.30651933993;噯,-12.9032328159;问,-5.56448148564;饱,-11.7367979309;声,-6.496005487;米,-9.02765543039;駒,-14.4613774339;罵,-11.3703349806;维,-8.24776983585;艷,-11.2627043164;懶,-11.1471914293;蕹,-14.4613774339;薤,-14.0559123258;譽,-13.7682302534;阴,-7.37673198816;湿,-9.19351927488;儀,-7.6157635515;閃,-9.42930685913;霪,-15.8476717951;霄,-12.9573000372;宇,-8.51464878068;堆,-10.2418697288;粉,-8.78891364254;紈,-12.8031493573;縊,-13.139621594;芍,-11.2129428068;非,-9.03093591447;萎,-12.2100856353;褐,-9.3182529568;涓,-12.9032328159;井,-9.70563438948;演,-8.00578586608;飾,-10.3262108772;钙,-10.6547149442;甘,-8.4276918714;贮,-11.658017053;窝,-9.75862691962;羟,-10.4449944132;股,-4.77799119004;愠,-13.2086144654;鶴,-11.6135652905;舢,-11.068548302;沩,-15.1545246145;质,-6.98901882551;谣,-9.80029961602;个,-6.09692757979;钳,-11.3590354253;鐮,-11.1027396667;碱,-9.19868724504;瀉,-11.3933244988;靚,-12.6287959702;庵,-13.2086144654;缴,-14.7490595064;掷,-12.8031493573;耶,-12.4803759651;榻,-13.901761646;连,-8.11881597121;绷,-11.2937949035;便,-9.94503846166;瘴,-12.5154672849;郁,-10.837036501;兀,-13.5450867021;剂,-9.84131863546;盅,-14.4613774339;寇,-15.8476717951;顆,-9.46247739607;渍,-13.2086144654;懋,-13.3627651453;鹊,-12.8031493573;拍,-10.3923506797;柏,-10.7978157878;羌,-12.7566293417;仕,-10.3024943506;佔,-9.91277759944;受,-8.43671991948;簸,-11.4782239426;铙,-13.014458451;照,-7.942230146;邻,-8.77355497887;孜,-13.7682302534;属,-8.73127765097;惡,-8.70880479512;腠,-12.8031493573;缺,-8.08805764437;蝤,-14.4613774339;桦,-10.9276908692;鉛,-9.58047124652;篦,-13.5450867021;狭,-12.1841101489;獬,-13.3627651453;矯,-12.4464744134;罩,-11.72053741;绵,-10.1472282217;恶,-8.70880479512;數,-5.58051382408;智,-7.83731220614;莎,-11.7872287845;歼,-10.6491747638;汾,-11.7872287845;送,-11.658017053;冀,-13.014458451;跪,-12.9573000372;阅,-10.4405000236;垄,-10.9573226668;血,-6.79796976905;尉,-12.589575257;床,-8.1100555122;戍,-13.3627651453;掌,-8.49266987396;树,-7.35559130446;贓,-10.9956415311;魂,-10.7417263212;辔,-12.2641528566;北,-7.47112093345;炖,-12.9032328159;喘,-15.1545246145;餛,-11.6281640899;宜,-11.4288311873;弟,-7.67296891259;蹄,-10.1014686045;怡,-12.3213112704;膠,-8.81769888336;蔣,-14.2382338826;抢,-11.4168549962;春,-7.75941706794;苇,-10.5746722365;欧,-8.20947355078;梦,-8.99437270188;氩,-14.7490595064;涨,-6.85660746287;溪,-9.72080261095;爭,-8.89112635191;繳,-14.7490595064;緞,-11.094081604;钮,-12.4464744134;報,-6.50964206195;痉,-12.9573000372;紳,-10.48169578;鸵,-11.6732845252;悶,-10.9204181099;樽,-14.4613774339;殼,-10.8172338737;漿,-10.1777908721;賴,-11.8403386098;遁,-14.7490595064;净,-6.68704701533;狂,-9.1432574401;际,-11.4782239426;遷,-9.92609337542;筇,-13.901761646;飆,-15.8476717951;屉,-14.0559123258;词,-8.462440872;態,-7.15837574705;廊,-10.8303919582;才,-9.26012178024;菌,-9.93958885689;杏,-10.1438893204;擎,-13.0750830728;桑,-9.80741708379;槐,-10.5644680663;浓,-8.63537732656;溢,-8.82035728102;返,-12.0864716794;南,-7.93744808797;鲟,-12.7121775791;瑙,-12.4803759651;痘,-13.2827224376;祛,-12.1340997284;囚,-9.97555400559;齟,-12.7566293417;糞,-10.1339389896;萍,-13.014458451;散,-8.14918900718;藺,-12.4464744134;霧,-10.2164600132;歧,-11.0769871706;淨,-6.68704701533;八,-7.46652744811;仪,-7.6157635515;迁,-9.92609337542;召,-11.5301836815;坯,-11.8403386098;哮,-10.7296779826;顱,-11.0273902295;称,-8.63096230835;絳,-12.9032328159;荒,-8.28395212665;鹵,-10.0335412632;捷,-10.7417263212;胶,-8.81769888336;摹,-11.8586877485;蛺,-13.4497765223;秋,-9.13714868561;使,-7.96724545077;刀,-8.46120094623;鄂,-13.4497765223;笆,-14.4613774339;閣,-10.2093171257;师,-7.06045146643;芋,-12.0864716794;祖,-7.53897987822;錾,-14.7490595064;鷙,-14.4613774339;椒,-14.0559123258;涕,-12.3511642336;气,-5.89050130561;化,-6.27005289636;嘘,-12.9573000372;透,-9.29802105283;甚,-13.4497765223;妝,-11.8773798815;頜,-11.4168549962;粟,-12.3511642336;锄,-11.3817636764;採,-9.38933351172;斥,-13.139621594;萤,-10.2022248974;梧,-10.8504595213;辩,-9.46585577766;劫,-10.9724744719;洪,-8.44522027424;蹬,-13.7682302534;箱,-9.05645033234;躉,-12.9573000372;纳,-8.96216212503;盟,-8.97554369372;茶,-7.24301732788;蔺,-12.4464744134;犊,-13.014458451;格,-7.55487293686;沿,-9.70778724284;鉀,-10.4139497915;嗅,-10.3342430489;鑄,-9.68646447337;壇,-11.4909629684;筆,-7.6229722331;駁,-10.9276908692;鹈,-12.8519395215;拋,-11.0769871706;輩,-9.98404061946;臍,-11.599176553;职,-6.63593240217;李,-10.1143305182;译,-9.25462726092;牲,-8.95300175563;仓,-7.70125247196;閏,-11.5436067019;卖,-9.20128128022;谐,-10.1143305182;畚,-14.7490595064;駝,-10.2345436887;锻,-10.9648698725;糟,-11.7872287845;鹤,-11.6135652905;握,-14.7490595064;蟬,-12.0190303986;慢,-10.2566848146;日,-6.48564090985;鐲,-11.3150723019;棧,-10.62731597;武,-6.71216273371;浪,-8.87976259326;凭,-9.92877794079;瓯,-14.7490595064;篱,-11.4288311873;藩,-10.8572392083;廳,-9.70563438948;頒,-15.8476717951;猿,-11.0034847086;蟹,-11.5572123539;櫻,-10.0099413479;蕺,-14.4613774339;槽,-11.3478621247;犀,-10.4631767323;锅,-9.41312527628;堇,-13.901761646;缉,-13.6504472177;纈,-14.0559123258;磐,-12.1340997284;肌,-8.2123679088;马,-6.97252447821;檐,-13.7682302534;专,-6.29020189199;貔,-14.2382338826;逗,-12.589575257;鎖,-10.6327360375;递,-12.8519395215;隘,-11.2627043164;娛,-10.0516140443;蹺,-11.6281640899;鼬,-12.5154672849;墜,-11.5572123539;從,-10.7177730801;挡,-10.9350169093;镊,-12.8519395215;蔥,-10.7978157878;漩,-11.0601800523;别,-8.74434973254;铆,-12.8031493573;催,-9.33444168415;启,-10.62731597;鬱,-10.837036501;骰,-11.4050205386;帳,-9.1154610886;趟,-14.4613774339;興,-7.9956215878;韵,-9.77693406706;薺,-12.4464744134;椽,-12.7566293417;补,-8.10787733665;达,-9.80029961602;十,-8.9449290579;狀,-6.6692349721;癃,-12.9573000372;畅,-12.4464744134;哄,-13.2827224376;硇,-14.4613774339;密,-7.57740268363;廈,-14.0559123258;手,-5.85874076071;緊,-9.7384242123;慍,-13.2086144654;背,-7.30578599106;蟎,-14.7490595064;角,-7.22377898499;泔,-12.2923237336;遗,-7.10286505766;取,-9.93687515102;臉,-7.70096274286;盘,-8.31880253842;驛,-9.87386218319;祝,-12.0190303986;龄,-13.4497765223;荡,-13.6504472177;苔,-10.3505035698;鳊,-14.0559123258;階,-6.50674185338;桧,-13.7682302534;详,-10.3382834584;佩,-11.0113898881;滨,-9.27819037465;淪,-12.6287959702;六,-9.35846686374;矮,-10.8303919582;平,-6.34399039278;蕙,-14.7490595064;職,-6.63593240217;書,-6.53739559447;錠,-12.4464744134;旺,-9.91277759944;濾,-10.7478053672;犁,-11.3478621247;匀,-15.1545246145;垃,-9.1154610886;适,-9.87896423508;罗,-8.97347329961;妇,-7.58022283676;弈,-13.0750830728;赎,-11.599176553;尊,-9.20779596124;悍,-12.4136845906;薏,-11.955851497;明,-7.62673062678;檑,-15.8476717951;输,-8.89781534006;薯,-10.711873358;冗,-12.1100021768;秘,-7.28130755964;隙,-12.8031493573;團,-7.50411796006;额,-7.95559337381;夜,-8.45133650126;縞,-12.9032328159;芡,-12.1100021768;挠,-12.2923237336;枣,-10.2492498361;撥,-13.014458451;攤,-9.64919307857;榧,-13.901761646;骑,-8.00854014679;亩,-13.4497765223;陝,-12.5518349291;玫,-9.63908176897;傭,-9.53231379354;疯,-9.93687515102;嬰,-8.99966652049;班,-8.45749036684;粵,-11.5436067019;戶,-8.15921643851;馓,-13.901761646;携,-11.4909629684;涿,-12.0410093053;举,-7.97331297033;勁,-9.36151100612;區,-6.61694073344;埃,-12.5518349291;遂,-12.2641528566;铅,-9.58047124652;啄,-11.5572123539;婆,-8.54248357967;廉,-10.2985957102;彈,-7.45740329722;届,-13.901761646;骒,-14.4613774339;腌,-12.1841101489;族,-9.39720137292;虎,-9.21041376378;歐,-8.20947355078;瓔,-12.9573000372;绢,-11.5572123539;法,-5.98282112614;赔,-9.89442846078;剖,-10.5197956263;釉,-10.6715220625;鯛,-13.2827224376;瑚,-15.8476717951;象,-9.33741345454;繞,-11.1114733467;荠,-12.4464744134;恢,-11.4288311873;量,-8.91132905923;蕤,-14.7490595064;試,-8.62073577657;滩,-9.98120373813;轨,-7.88316843151;叫,-9.3037599495;汪,-10.2309006974;热,-6.62411909161;公,-4.2689492263;闯,-12.5518349291;癮,-13.6504472177;懷,-9.27678883272;扶,-10.6602859892;曹,-14.2382338826;蜕,-14.0559123258;读,-8.62000929633;摺,-15.1545246145;楼,-7.48060406222;乾,-10.8989119047;刁,-12.5154672849;鋁,-8.95503015389;鰉,-13.7682302534;鋪,-9.59962892055;善,-9.2518912811;备,-9.94230994701;釀,-12.1340997284;縉,-10.9276908692;很,-14.4613774339;首,-6.56808525035;韃,-10.3712082431;鼢,-13.4497765223;閥,-11.1291729238;財,-5.96561218994;谕,-10.4315713929;茯,-10.7787675928;鞘,-11.8964280765;笛,-10.2793272913;砝,-11.6429791757;鴟,-12.7566293417;庞,-15.8476717951;掠,-12.3819358923;蜣,-12.7566293417;肢,-10.0485791406;营,-7.08612165593;斤,-12.4136845906;誦,-14.4613774339;温,-7.03810754171;侨,-10.1847113149;猫,-10.0099413479;沪,-10.3262108772;倭,-10.4052540845;冬,-9.439143004;唯,-8.90938731105;皮,-7.02844993749;娱,-10.0516140443;宰,-9.13958771121;碲,-14.4613774339;綴,-15.1545246145;點,-8.43430445937;枸,-10.837036501;蒺,-12.4464744134;栽,-12.5154672849;贿,-12.0410093053;珀,-15.8476717951;烂,-10.7914259897;痄,-14.4613774339;奇,-8.38201648493;芤,-15.1545246145;糊,-10.579813636;臌,-15.1545246145;敏,-11.4656451604;鹼,-9.19868724504;潛,-7.70241222855;项,-6.29289101682;体,-6.17353451575;棒,-10.012861058;汕,-14.7490595064;藏,-9.0837868865;輥,-14.7490595064;筛,-11.2325512782;硝,-9.27120222601;姜,-11.8586877485;绞,-10.3262108772;菠,-9.94777444148;藤,-9.95879383673;筐,-12.3819358923;陽,-7.68401561889;卫,-7.73334708591;泪,-8.46866366743;灭,-11.8586877485;诺,-10.8572392083;篆,-10.4360257432;目,-6.12295212112;賁,-12.8031493573;寰,-12.1340997284;彳,-15.1545246145;飲,-7.81368906038;巴,-9.37997306896;钨,-11.1291729238;虹,-11.2325512782;馴,-9.77462726096;死,-7.7258943759;擺,-10.5594047644;滾,-10.3342430489;羁,-11.72053741;厅,-9.70563438948;庇,-13.5450867021;鴆,-12.589575257;馉,-15.8476717951;須,-10.167499186;蒋,-14.2382338826;笊,-12.9032328159;融,-9.79793833983;昌,-12.9573000372;豹,-10.6219251213;蛙,-11.6887887117;梓,-13.901761646;蓴,-13.3627651453;讕,-14.4613774339;錯,-7.99019100812;写,-9.1922314447;馅,-11.1381415938;岛,-8.53511829696;窟,-10.1438893204;患,-7.77864246629;接,-8.95808048671;产,-5.22167245334;账,-7.75024549647;裝,-6.67016458018;咫,-12.5518349291;垭,-11.8046205272;琳,-13.7682302534;犯,-9.51261754356;綱,-8.99648686757;玉,-7.49088212514;墳,-9.33295910419;宵,-12.6696179647;收,-5.76620543517;耸,-12.9032328159;治,-9.22360656726;挺,-13.901761646;辽,-12.8031493573;調,-8.82302276461;皴,-13.4497765223;荣,-9.01033898038;烃,-11.8046205272;騷,-12.0864716794;织,-9.04750172676;獠,-11.8773798815;秉,-11.1748429606;擋,-10.9350169093;豺,-12.1100021768;贲,-12.8031493573;苏,-9.11189178082;腎,-8.0140715714;淑,-11.8964280765;豐,-10.4958136616;毕,-9.65530930559;衡,-12.2100856353;盗,-9.50731249134;貸,-6.92328166269;燙,-14.4613774339;灘,-9.98120373813;博,-7.4939391528;耻,-10.4183261661;神,-6.46304203799;该,-12.9032328159;赦,-12.9032328159;桨,-12.1841101489;谍,-12.3511642336;歪,-11.9356487896;短,-8.31024175848;噬,-11.6887887117;鋯,-12.2367538824;酮,-12.1340997284;己,-10.1847113149;鋼,-6.75645285399;壳,-10.8172338737;署,-12.0634821611;寵,-10.590176423;婴,-8.99966652049;见,-8.63611506175;泻,-11.3933244988;閾,-11.658017053;追,-9.75862691962;蹼,-14.7490595064;唁,-15.1545246145;逃,-11.2226989818;垂,-9.61719034748;包,-7.92396146109;犄,-11.7045370687;餉,-12.2367538824;颈,-9.79793833983;编,-7.18412970731;服,-7.579452915;蚌,-11.5301836815;戏,-7.66875246221;酬,-11.4409525478;栓,-10.534465816;檔,-8.6390714571;嘗,-13.2086144654;疖,-14.0559123258;焙,-15.1545246145;傘,-9.77462726096;厚,-8.71357807387;缝,-9.44575459834;府,-9.46247739607;妞,-11.2937949035;枢,-8.40576506701;挥,-11.1937114449;护,-8.32419048249;丧,-9.96993601328;润,-10.1273600185;梨,-10.3262108772;含,-7.69807005933;圭,-12.1100021768;萜,-12.8031493573;龅,-15.1545246145;掺,-13.7682302534;伽,-11.9356487896;谢,-11.7701343512;镁,-12.4464744134;哀,-10.9350169093;偃,-13.6504472177;埂,-14.7490595064;獅,-9.08263281828;奉,-11.6429791757;魍,-13.2086144654;鯊,-10.2831513877;誣,-13.6504472177;髌,-13.2086144654;浑,-8.64874055437;盹,-13.0750830728;術,-9.97555400559;濒,-15.8476717951;織,-9.04750172676;煙,-7.65759474534;烘,-13.3627651453;彝,-15.8476717951;络,-11.4782239426;驟,-11.8586877485;擠,-14.2382338826;苤,-15.8476717951;湧,-10.8640651734;鳴,-11.2325512782;裨,-12.6287959702;迫,-9.75862691962;副,-8.37630870688;統,-7.9878726145;峰,-8.73697567208;顳,-12.3213112704;孵,-12.8519395215;时,-4.63766387519;箜,-12.3819358923;胸,-8.0284373412;湾,-12.0410093053;载,-8.93095677471;溫,-7.03810754171;雾,-10.2164600132;销,-7.82150160012;醃,-12.1841101489;鋤,-11.3817636764;銅,-7.91495076758;錄,-9.39247323172;将,-6.76312142914;碉,-11.2833236036;斋,-11.7045370687;蚍,-15.8476717951;蜃,-13.2827224376;谬,-10.8709380526;誕,-11.7367979309;詐,-12.0864716794;吖,-15.8476717951;備,-9.94230994701;刚,-9.1506375474;麝,-10.7001773182;蚱,-13.6504472177;报,-6.50964206195;挤,-14.2382338826;侧,-9.45241019695;氦,-12.589575257;疫,-8.07787079906;横,-8.88164760796;銳,-10.5849816062;环,-6.31895042189;苜,-11.6429791757;岱,-14.0559123258;細,-6.66019071723;縲,-14.2382338826;枷,-11.4909629684;搶,-11.4168549962;饰,-10.3262108772;脸,-7.70096274286;溽,-13.7682302534;殿,-9.64109586834;品,-6.43227037932;镀,-10.6886164958;燃,-7.70969134061;療,-8.79149651096;育,-12.589575257;獄,-10.7356840067;屆,-13.901761646;奈,-14.4613774339;旋,-8.85465667213;婊,-10.8640651734;杌,-15.8476717951;描,-12.0410093053;賑,-13.7682302534;槓,-8.86480904359;乒,-10.9878593907;鲮,-13.014458451;鸸,-12.8519395215;烙,-10.6491747638;鉚,-12.8031493573;绝,-8.60558943581;移,-9.03752934495;察,-11.3150723019;塞,-11.0518812495;臣,-9.20258082556;餺,-15.8476717951;拥,-11.2729608166;牧,-8.19988574962;滕,-13.4497765223;黨,-7.6229722331;园,-8.357142393;缓,-10.4677744415;可,-7.21572236635;琼,-11.9356487896;干,-6.86347948342;葶,-14.4613774339;腸,-9.1743738273;添,-10.3628748616;艺,-6.93843651587;份,-8.10310198571;佼,-11.584991918;喀,-13.139621594;皂,-11.1202839764;豉,-15.8476717951;厄,-11.0518812495;妈,-7.97980030467;统,-7.9878726145;民,-5.88549089619;互,-8.44156841383;咖,-9.13350126515;候,-9.41634071313;紛,-10.7356840067;靡,-14.7490595064;帝,-7.3464047542;龜,-10.2947122101;增,-6.74669996014;酱,-10.4271367958;暢,-12.4464744134;蓇,-12.589575257;沦,-12.6287959702;榨,-10.2947122101;說,-7.82346430928;瞬,-14.7490595064;匯,-7.54590203195;炮,-7.65206222777;就,-11.2937949035;餳,-15.8476717951;纲,-8.99648686757;宴,-9.67180452496;铣,-11.6281640899;活,-7.63456109747;丽,-11.8046205272;滋,-9.37997306896;直,-7.43007796887;元,-7.44948739023;酊,-14.2382338826;篇,-10.1306440937;驷,-13.5450867021;莠,-15.8476717951;秈,-12.3213112704;竊,-12.1841101489;鲈,-11.5169384548;胎,-8.83645780771;楓,-11.3703349806;軒,-11.9356487896;評,-8.03327216126;比,-6.5283873361;块,-9.74287856265;遙,-10.2381999999;釘,-10.4052540845;絛,-11.5169384548;孟,-10.2164600132;壞,-8.94996685193;葡,-8.19370261458;无,-7.4925270556;慣,-8.77609843085;轧,-11.4409525478;賦,-9.15682951764;桩,-13.2086144654;畫,-7.63591739769;矬,-13.7682302534;卯,-14.7490595064;僮,-12.5518349291;山,-5.87863061179;巰,-13.014458451;女,-5.97613941377;绲,-15.1545246145;婵,-13.2086144654;辨,-14.0559123258;鳕,-12.2923237336;懸,-9.07230570413;錫,-10.0516140443;瘀,-12.5518349291;劃,-11.4168549962;貪,-10.3302188986;内,-5.90055020551;鲇,-11.9975241934;缆,-11.184232701;安,-8.64277928486;娈,-12.9032328159;養,-8.68217832;疮,-11.4909629684;钞,-10.5197956263;挎,-11.3590354253;辑,-12.8031493573;丐,-15.1545246145;誓,-10.6547149442;洒,-13.6504472177;榕,-11.5301836815;蠔,-14.2382338826;钗,-15.1545246145;圖,-6.98646345785;刘,-11.8964280765;焚,-11.0193580578;盛,-8.50101663189;碟,-11.1471914293;映,-12.2100856353;攢,-13.901761646;沧,-10.9801373446;伦,-9.27120222601;让,-14.7490595064;骸,-12.5518349291;逆,-9.32852450712;閭,-13.014458451;听,-8.97969738609;邯,-15.1545246145;献,-12.1841101489;媳,-8.48820415681;闰,-11.5436067019;場,-7.52966151752;锈,-11.4532226404;踪,-9.64109586834;荞,-10.7417263212;款,-9.35846686374;韁,-10.5053375431;陀,-10.3302188986;勃,-13.7682302534;镂,-15.1545246145;鳇,-13.7682302534;蹠,-14.4613774339;鯉,-10.3302188986;蛋,-7.85641786522;藍,-8.13076565976;俑,-14.2382338826;乐,-7.83830871843;犍,-13.2827224376;鷂,-12.4136845906;桔,-11.0436507503;叙,-10.5746722365;绛,-12.9032328159;党,-7.6229722331;川,-10.4095924861;屜,-14.0559123258;壟,-10.9573226668;锐,-10.5849816062;苣,-15.8476717951;敢,-8.30651933993;臥,-9.588090331;恤,-13.5450867021;车,-6.4035249236;科,-6.03323405936;睦,-11.9764707842;闭,-10.9724744719;烯,-10.7724979798;级,-8.74188566558;絲,-8.60344427946;顴,-11.599176553;蝶,-11.2937949035;任,-7.19245730575;腺,-10.0365308021;绫,-13.2827224376;省,-7.04319661122;刃,-12.7566293417;酪,-13.139621594;算,-9.00498851282;將,-6.76312142914;嬉,-14.4613774339;骈,-11.0193580578;蘋,-8.96728771288;馊,-12.5154672849;随,-9.2518912811;籬,-11.4288311873;休,-10.1847113149;源,-8.98700812361;樓,-7.48060406222;苓,-15.8476717951;梔,-12.5154672849;吗,-11.4532226404;匙,-13.7682302534;銘,-9.97555400559;帛,-11.4532226404;鴝,-15.1545246145;醛,-12.9032328159;砟,-15.1545246145;实,-5.98996643518;蜡,-9.29802105283;肤,-10.8778584955;氧,-8.56559813697;侦,-9.70778724284;羞,-11.1655405679;瘫,-15.1545246145;親,-7.08863106754;锭,-12.4464744134;咬,-11.068548302;鎮,-9.12986710004;弱,-8.69305643815;纰,-12.1100021768;稳,-8.59420141238;網,-6.67784096642;碴,-14.0559123258;架,-9.39090213949;挹,-12.9032328159;芸,-11.3478621247;主,-5.07462878755;洽,-11.8403386098;沼,-8.76764529514;设,-6.65835079031;睁,-13.4497765223;雀,-11.5169384548;剃,-11.2833236036;賊,-10.0856204123;充,-8.88637574915;簍,-11.8964280765;忆,-14.4613774339;等,-7.94444498633;晋,-13.014458451;姊,-9.76089706815;里,-8.55329449577;潑,-11.1202839764;畏,-13.6504472177;勘,-12.6287959702;鵝,-10.6491747638;糜,-14.4613774339;条,-6.06465839599;曠,-10.9276908692;扣,-10.8303919582;既,-11.599176553;腥,-11.2325512782;莧,-12.8031493573;迦,-13.0750830728;癫,-11.0034847086;铬,-11.599176553;灯,-8.0208296969;鑼,-10.00123302;影,-7.44499199044;绰,-10.4052540845;驳,-10.9276908692;已,-13.0750830728;饵,-10.8989119047;飴,-13.2086144654;葷,-12.0634821611;蟶,-13.7682302534;鹭,-12.3213112704;懺,-13.3627651453;泼,-11.1202839764;桿,-9.2091040059;课,-8.3946894656;漁,-8.06111998863;億,-13.901761646;還,-10.6547149442;帆,-10.0485791406;鳖,-13.0750830728;鼴,-12.9573000372;澆,-14.0559123258;訃,-12.2641528566;膏,-10.3302188986;戎,-11.1202839764;云,-8.13657054322;伐,-13.2827224376;讓,-14.7490595064;辯,-9.46585577766;疗,-8.79149651096;嘖,-15.1545246145;錘,-11.3933244988;倚,-15.8476717951;饲,-9.21830854163;稞,-15.8476717951;錢,-9.02656432281;肥,-8.84188277581;愤,-13.2086144654;並,-10.2455529742;檩,-13.5450867021;队,-7.58614534667;垫,-11.3150723019;株,-11.6135652905;甬,-10.8989119047;刮,-11.4656451604;纱,-9.41634071313;缰,-10.5053375431;害,-9.60739594989;陶,-8.32473087699;头,-6.73516478344;斷,-8.66304264235;麾,-10.1640920277;抹,-11.1114733467;硫,-8.75177857397;鸽,-10.3382834584;貽,-12.1100021768;洼,-9.40832142396;榿,-13.7682302534;雁,-11.955851497;着,-9.89963680588;參,-7.33027862364;呂,-13.139621594;兄,-7.28914474015;珠,-8.97347329961;蟋,-11.0601800523;塊,-9.74287856265;操,-9.47605994783;敌,-7.06888386596;扎,-13.0750830728;滑,-9.33890265809;佐,-10.9350169093;棕,-9.14694068551;楔,-11.2627043164;癖,-12.3819358923;務,-12.4136845906;鍘,-12.1587923409;做,-8.39237330938;鳝,-12.7566293417;鵜,-12.8519395215;租,-8.77101797962;杠,-8.86480904359;蕪,-13.6504472177;胥,-15.8476717951;饧,-15.8476717951;书,-6.53739559447;隨,-9.2518912811;芽,-10.837036501;矫,-12.4464744134;哭,-9.41795231702;凯,-10.6491747638;罰,-10.3262108772;篳,-13.5450867021;奴,-7.42215539222;旷,-10.9276908692;晶,-8.28136078029;苹,-8.96728771288;荸,-12.0190303986;鈍,-13.6504472177;泽,-11.571005676;阁,-10.2093171257;磁,-7.73995173315;咂,-13.3627651453;熄,-12.0410093053;崇,-12.3819358923;庆,-10.2381999999;豁,-11.4050205386;守,-9.34788475441;朋,-7.55012826571;墊,-11.3150723019;損,-7.64464155335;薌,-14.7490595064;意,-5.91118476426;釬,-13.139621594;丑,-9.95051792743;辐,-9.76545288469;駐,-8.58434217759;沒,-11.5572123539;蠕,-11.1655405679;榔,-13.3627651453;皖,-10.8709380526;厘,-13.4497765223;弛,-12.4136845906;尝,-13.2086144654;綜,-8.51530258913;轄,-9.80503896138;話,-7.80883703728;急,-8.51138613504;憤,-13.2086144654;货,-6.01423124084;鯰,-12.9032328159;躺,-11.9356487896;讨,-11.7872287845;喬,-9.69281370105;銮,-12.1841101489;縱,-8.80626013127;羰,-11.1114733467;鲲,-11.3043770128;堵,-15.1545246145;速,-7.00002443935;蔷,-10.5543669703;蚶,-14.2382338826;船,-7.35784980044;掸,-13.6504472177;輻,-9.76545288469;肺,-8.79408606787;涼,-9.36609466579;椿,-12.2367538824;檾,-13.4497765223;千,-8.89973472645;铂,-11.9975241934;酷,-10.3628748616;纠,-9.01141251779;婉,-15.1545246145;旌,-10.837036501;拎,-13.5450867021;运,-6.14458830687;阉,-10.7978157878;賒,-15.1545246145;鄖,-14.4613774339;镗,-12.6287959702;盖,-9.89442846078;牙,-8.54450174383;变,-7.48877118264;僚,-11.1202839764;酸,-8.60059121048;竞,-8.38430874954;骗,-10.2604231367;柠,-10.4052540845;捣,-13.139621594;铺,-9.59962892055;恥,-10.4183261661;萧,-13.014458451;詩,-7.21020977126;诨,-12.589575257;睫,-10.8778584955;鑭,-13.139621594;酯,-13.0750830728;狮,-9.08263281828;翰,-10.2309006974;塵,-9.26150014021;饋,-14.7490595064;敷,-13.5450867021;銨,-12.7121775791;批,-8.96934532677;舍,-9.88666645544;汽,-6.41442790058;縫,-9.44575459834;西,-6.92261637094;諾,-10.8572392083;禁,-8.80976583162;醪,-13.3627651453;待,-9.20779596124;诗,-7.21020977126;劇,-7.53897987822;喉,-9.31388295713;合,-6.79949747368;袋,-10.5246618159;亏,-10.6381856422;責,-7.27959539333;憑,-9.92877794079;耐,-9.70994474098;撓,-12.2923237336;枕,-9.77693406706;潜,-7.70241222855;外,-5.87200312557;鯡,-12.4803759651;尘,-9.26150014021;缚,-13.014458451;骇,-13.3627651453;鳙,-14.4613774339;欢,-10.3966333415;两,-7.59418376672;答,-8.5431558486;银,-5.52583581525;薩,-10.5295518012;萨,-10.5295518012;未,-9.61719034748;箭,-9.9532689608;舳,-13.6504472177;纯,-9.3095319713;熱,-6.62411909161;雹,-12.2641528566;咳,-12.7566293417;嘴,-8.0682048276;褶,-9.26288040268;永,-9.96156776361;莽,-12.6696179647;放,-8.50813409966;私,-7.73334708591;础,-15.8476717951;謊,-10.7600754598;必,-9.73177966958;勇,-9.00819535683;兆,-11.5436067019;嗉,-13.6504472177;呈,-12.3511642336;棋,-9.43093951255;坊,-10.9131978619;母,-7.05846870059;济,-13.139621594;恐,-9.69493910036;蓓,-13.2827224376;穢,-12.1841101489;虔,-12.8031493573;霖,-14.4613774339;奖,-8.51726658322;緙,-12.4464744134;滥,-12.6287959702;烛,-10.2345436887;罚,-10.3262108772;囟,-13.6504472177;啞,-9.48120134733;桠,-15.8476717951;泣,-14.7490595064;止,-10.595398367;苧,-10.9350169093;腦,-7.49558912371;早,-8.43611550725;士,-7.76465187589;颓,-10.8640651734;绯,-11.7045370687;絮,-12.2641528566;凱,-10.6491747638;灰,-8.20227409563;鹩,-15.1545246145;獲,-10.181245107;跋,-13.6504472177;噴,-9.67597119765;諷,-12.1100021768;蕨,-11.2525519449;淹,-14.0559123258;镧,-13.139621594;菽,-15.1545246145;閘,-10.4271367958;替,-10.2831513877;蕾,-14.7490595064;礁,-11.184232701;陪,-9.88409245144;缅,-14.2382338826;庄,-8.58714919697;切,-9.74064890732;軀,-9.49330175427;锉,-13.139621594;针,-8.36442737899;栋,-12.589575257;踏,-10.8172338737;涎,-12.3511642336;脑,-7.49558912371;熙,-14.7490595064;搓,-14.0559123258;排,-7.92504822085;朕,-13.3627651453;稗,-13.901761646;妖,-8.46741600664;紙,-8.03408024211;粘,-8.34548530846;瀛,-14.2382338826;羚,-10.2418697288;匝,-12.5154672849;銜,-13.7682302534;瘟,-10.3342430489;簿,-11.1381415938;褡,-11.8403386098;氣,-5.89050130561;订,-8.72319353257;伥,-15.1545246145;交,-5.41050183662;腰,-8.62000929633;鸭,-10.0099413479;枪,-8.1245517028;蛹,-15.8476717951;吳,-10.579813636;厲,-11.5436067019;嚴,-9.79793833983;费,-7.57919640608;沸,-9.45408104111;总,-5.36953910605;挽,-11.2627043164;押,-10.7787675928;蘿,-10.0669282793;祁,-11.7533272328;籃,-9.38776734069;释,-10.8437254891;罅,-14.0559123258;组,-7.1681897006;片,-9.1999834215;准,-8.35268556111;哈,-10.2093171257;麸,-12.6696179647;那,-12.8031493573;鳌,-11.7872287845;插,-9.31243052405;蝕,-15.8476717951;蛔,-11.3817636764;穗,-11.7533272328;空,-6.11520983958;癟,-13.901761646;痞,-11.8046205272;驗,-11.9356487896;棠,-13.901761646;黄,-6.31539286196;询,-15.8476717951;佥,-13.2086144654;令,-10.0305606351;执,-8.80189521818;懦,-12.3819358923;癱,-15.1545246145;填,-11.325883218;蟪,-15.8476717951;錛,-15.1545246145;差,-7.0847128743;共,-7.03408459059;味,-8.56628613149;史,-7.6112512678;围,-8.78205843147;鎂,-12.4464744134;腕,-11.0193580578;鑾,-12.1841101489;拼,-11.0601800523;颁,-15.8476717951;頁,-9.91542660761;弄,-10.5644680663;率,-13.7682302534;瀆,-15.8476717951;钉,-10.4052540845;瞭,-13.901761646;見,-8.63611506175;瘊,-13.901761646;認,-9.34938964559;侏,-11.584991918;谎,-10.7600754598;脐,-11.599176553;戒,-9.25462726092;蚕,-9.40672525443;朔,-10.9423970166;宗,-7.169891539;砖,-8.8638818298;顾,-8.07323628476;军,-5.54940940563;鸚,-10.5197956263;劝,-12.8519395215;吞,-10.2793272913;趣,-10.4227217776;伤,-8.20658754589;控,-9.20779596124;谰,-14.4613774339;礱,-15.8476717951;碳,-8.72722742267;羯,-13.901761646;瓜,-9.53593698591;鴕,-11.6732845252;焰,-11.2937949035;疳,-13.014458451;殷,-10.6715220625;蠶,-9.40672525443;油,-6.78559943976;贸,-9.79323244879;膻,-12.9573000372;为,-9.80503896138;抽,-10.0731202495;茼,-13.4497765223;壁,-8.40342314557;祀,-15.1545246145;蚊,-10.0305606351;绅,-10.48169578;黠,-11.9356487896;構,-8.05904572944;諍,-13.2827224376;歌,-7.86286840533;俏,-12.7121775791;豎,-10.5101337154;腐,-9.97555400559;藓,-14.7490595064;扒,-12.4803759651;蓋,-9.89442846078;漏,-9.93416878942;糙,-12.1340997284;祥,-15.1545246145;跖,-14.4613774339;勝,-8.65925905857;卜,-11.1937114449;域,-11.0854978603;瑞,-10.6602859892;裡,-8.55329449577;楠,-10.837036501;橢,-9.10243544558;以,-11.2129428068;潤,-10.1273600185;羽,-9.18453909907;秫,-12.6287959702;髭,-12.5518349291;孬,-12.9573000372;籮,-11.9356487896;僱,-9.63306369664;兰,-10.1372447777;嗳,-12.9032328159;割,-11.72053741;靴,-10.7177730801;请,-9.94777444148;浸,-12.1340997284;舶,-14.2382338826;社,-5.51071493801;柿,-10.6771878;鼾,-11.0601800523;码,-8.82124498636;禀,-11.4050205386;骂,-11.3703349806;帅,-12.4803759651;径,-8.56148008036;吉,-8.59561784321;椋,-13.5450867021;隊,-7.58614534667;伏,-10.0638466127;蔓,-12.8519395215;抒,-10.6491747638;顯,-9.1506375474;颖,-12.8031493573;庚,-13.2086144654;初,-8.45072319244;脛,-12.5154672849;土,-5.90352226081;璞,-13.2086144654;校,-7.5105626655;艳,-11.2627043164;责,-7.27959539333;檢,-8.7329023467;严,-9.79793833983;滇,-12.1587923409;茧,-11.6429791757;夫,-7.00016816914;絆,-12.2923237336;箬,-15.8476717951;弯,-10.4052540845;粮,-7.39086575366;週,-6.95602268241;冰,-7.39044094482;申,-10.004127378;劲,-9.36151100612;阵,-8.06195089853;真,-7.41277384637;蚝,-14.2382338826;趸,-12.9573000372;人,-4.35209596843;莼,-13.3627651453;秀,-9.65122766727;嫂,-8.92897657604;幅,-7.61390308585;升,-9.01356305625;痈,-12.8519395215;囊,-11.0193580578;住,-7.22918635216;陌,-10.4863796294;晕,-15.8476717951;柔,-10.0638466127;字,-7.42040331117;諸,-8.61061276894;鏜,-12.6287959702;駑,-15.8476717951;廚,-9.04527703174;剝,-10.9956415311;登,-9.59000420718;坟,-9.33295910419;澤,-11.571005676;桡,-13.2827224376;跑,-9.91277759944;浣,-12.7121775791;翠,-11.0273902295;濤,-12.6287959702;荧,-9.58237058233;摩,-8.69462016013;旨,-9.95051792743;驭,-15.1545246145;寬,-8.97658050045;蓼,-15.1545246145;禍,-9.66765514141;齒,-9.88409245144;陵,-9.34338362153;避,-10.2200506814;歷,-6.01133951771;閨,-9.61719034748;汹,-11.6135652905;试,-8.62073577657;腻,-15.8476717951;礫,-10.00123302;板,-6.51308046075;擾,-13.2086144654;宁,-11.094081604;稀,-9.07917858341;射,-7.89716936025;缀,-15.1545246145;阈,-11.658017053;镖,-14.2382338826;伎,-11.4409525478;成,-5.65514059744;輯,-12.8031493573;碗,-10.3880862809;龙,-7.4376184792;帘,-10.0950991562;力,-6.53171094122;級,-8.74188566558;钟,-9.12986710004;霞,-11.1202839764;殡,-11.7872287845;荚,-12.0410093053;氤,-12.2923237336;蝰,-14.2382338826;违,-10.6828858211;攪,-11.9975241934;馭,-15.1545246145;砬,-13.2827224376;鳶,-12.5154672849;到,-10.7662674301;儲,-7.84598181696;疵,-13.4497765223;吴,-10.579813636;袷,-14.7490595064;蛲,-13.0750830728;边,-7.33649667597;丸,-10.9350169093;芻,-13.7682302534;贺,-11.4909629684;膽,-8.44644053065;龋,-12.0864716794;蒿,-11.9764707842;蜾,-14.0559123258;驍,-11.8223201043;练,-11.1202839764;巅,-11.2729608166;陈,-9.91013558998;請,-9.94777444148;啊,-13.4497765223;槍,-8.1245517028;桌,-8.52913224649;低,-7.35108955755;鰱,-12.8031493573;藕,-11.955851497;摔,-15.8476717951;策,-7.5377488058;忙,-13.7682302534;騎,-8.00854014679;凝,-10.0187261775;停,-10.0700194718;坞,-15.8476717951;毡,-10.9276908692;詠,-12.1340997284;代,-6.08476902334;溺,-13.3627651453;汤,-10.0793507993;惧,-12.2641528566;鰾,-14.7490595064;晨,-9.5976965528;給,-10.0919295815;駭,-13.3627651453;硬,-8.43611550725;糯,-10.7417263212;置,-9.30664179587;煲,-13.014458451;骆,-9.70994474098;表,-6.9029911115;迹,-8.32743723859;松,-8.59845673795;窀,-15.8476717951;布,-7.56443035368;如,-9.79088778183;紅,-6.61743076138;历,-6.01133951771;眉,-8.60630551174;韭,-10.7662674301;喊,-9.87640995527;植,-6.75341590211;氏,-9.07230570413;澎,-11.5436067019;挑,-10.4863796294;易,-9.96993601328;髂,-14.7490595064;蒔,-15.1545246145;砗,-12.3511642336;缙,-10.9276908692;繅,-12.589575257;创,-6.0216053895;順,-8.68993631081;次,-8.35825971155;誠,-9.95879383673;渣,-11.584991918;津,-10.1405615303;性,-6.38075309569;钝,-13.6504472177;薪,-9.4342128379;微,-7.6112512678;犰,-13.3627651453;阳,-7.68401561889;冲,-8.55669701692;电,-5.08091461263;钴,-14.7490595064;样,-7.20719958749;悼,-12.589575257;穴,-10.4271367958;魁,-11.2525519449;幃,-14.7490595064;益,-10.7724979798;鳄,-11.5572123539;假,-7.99795803746;漠,-10.4139497915;囈,-13.2086144654;橋,-8.80363889779;镶,-12.7121775791;迎,-12.1587923409;類,-7.26675291277;拐,-8.89303293018;晓,-14.2382338826;懒,-11.1471914293;敕,-11.1291729238;擔,-9.51261754356;塗,-10.0335412632;齙,-15.1545246145;绘,-8.64055293886;剛,-9.1506375474;線,-7.68373084031;系,-6.06144866269;歡,-10.3966333415;貼,-9.95879383673;鴛,-9.39562284063;賤,-10.5246618159;钧,-11.599176553;祭,-9.29802105283;壬,-15.8476717951;屯,-9.71644530558;繼,-8.89494315044;危,-6.72856990352;陳,-9.91013558998;狒,-12.6287959702;钱,-9.02656432281;衷,-11.7533272328;處,-7.88282090762;淺,-9.15682951764;胼,-12.5518349291;蟾,-10.6715220625;突,-8.46306141189;锁,-10.6327360375;龃,-12.7566293417;堂,-9.11308013509;鲅,-13.2086144654;約,-9.63506569931;醇,-12.4464744134;分,-6.03575143605;圈,-9.31388295713;残,-8.31826533723;吊,-9.06774988759;袍,-10.8918447375;与,-11.4168549962;抑,-10.8437254891;怒,-9.53412374879;攔,-11.5436067019;蟊,-13.7682302534;庙,-9.19351927488;弘,-12.0190303986;玛,-10.310337528;尚,-8.31934002836;疟,-10.8504595213;餚,-12.6287959702;欠,-10.8778584955;侣,-15.1545246145;蠢,-11.0436507503;沥,-10.2381999999;贤,-9.2383225519;霰,-12.3213112704;蚩,-12.0410093053;木,-6.99429212214;宫,-7.44096333682;搪,-11.2833236036;辖,-9.80503896138;礬,-15.1545246145;帮,-9.72737437611;励,-11.8046205272;瞳,-10.7724979798;進,-7.38261435807;钵,-11.6887887117;伸,-12.1340997284;肽,-15.8476717951;艄,-11.6281640899;显,-9.1506375474;嫁,-11.1291729238;孀,-15.1545246145;心,-6.08258461226;變,-7.48877118264;組,-7.1681897006;采,-9.38933351172;牆,-8.60130371496;雉,-12.2641528566;霍,-11.4532226404;告,-10.310337528;棍,-9.86121978978;赣,-13.7682302534;苑,-12.9573000372;捐,-11.2833236036;染,-8.80189521818;恒,-8.70247566007;笸,-12.7121775791;给,-10.0919295815;叛,-9.50907771686;兜,-11.5301836815;癞,-11.8773798815;諡,-11.8046205272;轿,-8.41459644616;泥,-7.95223578812;赤,-8.28603004947;臧,-15.1545246145;扦,-14.7490595064;杨,-9.88924710203;寫,-9.1922314447;蠓,-13.5450867021;巯,-13.014458451;狱,-10.7356840067;印,-7.6125762978;石,-6.10711502153;遲,-12.9032328159;铵,-12.7121775791;骁,-11.8223201043;门,-7.00738112597;項,-6.29289101682;決,-7.17741422792;能,-5.83273231723;藿,-12.0864716794;晾,-15.8476717951;威,-8.4667927595;滁,-13.3627651453;弃,-12.2923237336;雪,-8.24626946048;嘉,-10.1640920277;逍,-12.7566293417;詮,-15.1545246145;蠍,-10.9350169093;輸,-8.89781534006;贏,-10.8237912742;我,-6.31865953395;鄙,-13.6504472177;薔,-10.5543669703;猛,-9.7495975129;瀝,-10.2381999999;农,-5.59868147559;生,-5.59595990459;模,-6.77901020142;漣,-12.0410093053;梢,-11.6732845252;谥,-11.8046205272;涤,-11.2627043164;愧,-13.6504472177;芦,-8.55397407446;螨,-14.7490595064;陆,-7.60834236716;砭,-14.7490595064;馬,-6.97252447821;累,-11.7872287845;纜,-11.184232701;爱,-7.86116685651;现,-6.13208131365;傲,-12.3819358923;吵,-13.139621594;訟,-12.9032328159;丹,-9.92074576909;政,-4.8041581345;婁,-12.8031493573;節,-7.28206946444;居,-7.04229665615;緄,-15.1545246145;兇,-10.1539396563;钠,-11.72053741;瓊,-11.9356487896;衍,-10.3754011214;浏,-12.1340997284;从,-10.7177730801;扑,-11.0601800523;提,-8.52120618122;胡,-7.93781512779;螢,-10.2022248974;套,-8.08635261411;嫖,-12.3819358923;忘,-13.139621594;鍛,-10.9648698725;鎳,-11.5038663732;覆,-9.18966074919;燜,-15.1545246145;啟,-10.62731597;回,-7.70881504437;橡,-8.38373519059;诠,-15.1545246145;佣,-9.53231379354;淤,-10.3880862809;慧,-12.0634821611;拦,-11.5436067019;牽,-10.2345436887;孫,-9.17690547422;雙,-6.65896372321;台,-7.9878726145;呵,-12.3213112704;痴,-10.9801373446;楷,-10.5394040977;風,-5.59949585113;俸,-10.544366887;捻,-10.9878593907;賺,-13.0750830728;聽,-8.97969738609;懼,-12.2641528566;曾,-10.6381856422;綁,-11.6281640899;鮁,-13.2086144654;境,-8.64650091178;异,-7.69001477987;宅,-9.588090331;娄,-12.8031493573;皇,-5.95990720299;锆,-12.2367538824;醉,-10.4271367958;饿,-11.2032808959;鋃,-14.4613774339;湖,-7.52188126918;侍,-8.42589600142;诀,-12.0864716794;椎,-11.0354874397;斑,-9.21830854163;蜒,-15.1545246145;店,-8.58925964447;崖,-10.7724979798;妙,-9.98404061946;領,-5.87788165327;钛,-13.2827224376;功,-6.57360573221;涡,-9.49678607835;伢,-13.5450867021;疊,-11.3933244988;暧,-13.6504472177;膩,-15.8476717951;怨,-10.0700194718;鲫,-11.5038663732;挪,-12.0634821611;徭,-10.2492498361;鸬,-12.5154672849;窯,-9.36456444361;畜,-8.38087232004;疱,-11.2937949035;傳,-6.35894239755;露,-9.53412374879;鈴,-10.5053375431;洶,-11.6135652905;核,-6.73230166068;欺,-11.8964280765;螽,-13.7682302534;昼,-9.718621585;抿,-15.8476717951;脾,-8.70880479512;局,-6.89675003027;罂,-10.579813636;寅,-14.7490595064;雇,-9.63306369664;商,-5.49266286266;凉,-9.36609466579;偈,-12.9573000372;半,-7.51825501112;乌,-8.1670343675;頌,-11.4288311873;靛,-13.3627651453;貓,-10.0099413479;駙,-10.181245107;塘,-11.8773798815;筚,-13.5450867021;馆,-9.74064890732;缠,-13.6504472177;募,-12.3213112704;煞,-12.0864716794;淡,-8.46306141189;池,-9.95602758324;棣,-15.1545246145;記,-5.97490121519;褒,-12.9573000372;敦,-11.325883218;恨,-13.0750830728;高,-5.69471039597;鹬,-15.8476717951;端,-9.22893281155;奮,-14.7490595064;痱,-12.4464744134;瑰,-11.8046205272;鏵,-14.0559123258;鉴,-11.0193580578;价,-5.20482163817;茎,-11.7045370687;柽,-12.0864716794;虼,-13.2086144654;拿,-9.63506569931;腾,-14.0559123258;窄,-13.6504472177;阇,-15.8476717951;疆,-9.35089680488;鄉,-7.85034497206;谋,-9.84873523312;伍,-15.1545246145;二,-7.30793463921;蔑,-13.7682302534;撐,-12.2367538824;夙,-12.1340997284;碘,-11.4656451604;君,-8.10050682854;定,-7.35477129622;犛,-10.1306440937;贡,-7.60834236716;負,-7.23498662219;誤,-8.94895726073;薦,-14.7490595064;訂,-8.72319353257;飽,-11.7367979309;簫,-13.901761646;措,-7.08252537342;纬,-9.51795088954;妮,-12.0190303986;唱,-9.43585352735;環,-6.31895042189;鑲,-12.7121775791;郵,-8.54248357967;霁,-15.1545246145;殺,-9.0837868865;房,-6.42617948462;憾,-13.6504472177;管,-7.14749060231;飼,-9.21830854163;魅,-9.76773859997;跷,-11.6281640899;陇,-11.2627043164;光,-6.4998329099;烈,-8.95401544046;及,-11.4050205386;位,-7.27107826037;滌,-11.2627043164;雌,-9.36151100612;救,-8.61710864165;蟒,-11.599176553;捕,-10.5695571358;拔,-14.2382338826;壘,-12.3213112704;野,-7.79251406324;坝,-9.96713880866;盜,-9.50731249134;滤,-10.7478053672;赡,-13.3627651453;賠,-9.89442846078;档,-8.6390714571;步,-7.4206221535;虧,-10.6381856422;旦,-12.2367538824;魔,-8.70247566007;惨,-9.65122766727;廬,-12.1100021768;驯,-9.77462726096;理,-5.97887921232;铰,-12.4136845906;習,-7.5631675678;卵,-8.95808048671;狴,-13.6504472177;楹,-14.0559123258;裸,-11.8223201043;摻,-13.7682302534;艾,-9.52152232191;鋇,-12.3213112704;曼,-12.2367538824;承,-9.0331288978;裘,-12.1340997284;岁,-9.25737074687;渾,-8.64874055437;妃,-10.2831513877;市,-4.41806272377;骅,-14.7490595064;吆,-12.4803759651;炉,-9.78621487613;趋,-7.0005994825;刊,-9.76317238199;躍,-13.5450867021;鬃,-12.2367538824;栎,-13.5450867021;撑,-12.2367538824;貂,-11.3817636764;投,-5.92007716718;鹞,-12.4136845906;得,-9.42280277116;尖,-9.4374969131;墙,-8.60130371496;蠅,-13.6504472177;稚,-11.8223201043;圜,-13.4497765223;原,-5.40020434623;禄,-12.0410093053;没,-11.5572123539;莱,-11.8223201043;踢,-13.4497765223;誥,-12.1100021768;舰,-8.02562778688;肩,-8.62583596977;截,-10.1573123407;庭,-9.70134253739;缬,-14.0559123258;碩,-9.72517898555;田,-8.27311331086;决,-7.17741422792;嘲,-15.8476717951;蘆,-8.55397407446;猴,-9.35543196004;谶,-11.3590354253;樺,-10.9276908692;鼋,-15.1545246145;琴,-9.87640995527;秃,-11.094081604;幂,-12.2923237336;竅,-10.48169578;魄,-10.8572392083;呆,-9.66352290413;僉,-13.2086144654;先,-6.36982654807;淋,-9.24916276645;削,-13.2827224376;軍,-5.54940940563;遣,-12.8031493573;每,-13.5450867021;桎,-12.1587923409;蓑,-11.9975241934;羹,-13.7682302534;晒,-11.8773798815;苕,-14.0559123258;荔,-10.3670328717;志,-9.00072865548;游,-7.26319385684;磙,-14.7490595064;痛,-9.91013558998;婚,-7.88490786489;睜,-13.4497765223;鏟,-11.2729608166;遞,-12.8519395215;泡,-8.15419015423;赠,-11.4050205386;滄,-10.9801373446;櫥,-11.2226989818;葦,-10.5746722365;惩,-11.4050205386;巫,-10.1743485279;鷦,-15.1545246145;续,-10.4009344234;驱,-9.44244333703;确,-9.85371036776;铱,-14.4613774339;異,-7.69001477987;凳,-10.2200506814;癲,-11.0034847086;勵,-11.8046205272;臼,-11.2729608166;飨,-15.1545246145;裹,-12.6287959702;楸,-13.901761646;藻,-10.1743485279;蝼,-11.7367979309;聾,-11.184232701;封,-7.99601061717;证,-5.7320611945;餃,-10.0246258996;麂,-12.8031493573;稅,-7.61896099627;紗,-9.41634071313;震,-9.87896423508;咆,-13.6504472177;倉,-7.70125247196;冈,-14.4613774339;洋,-8.29753645257;劊,-11.4168549962;不,-5.44165292159;黃,-6.31539286196;鱼,-7.56746756178;脓,-10.1143305182;牯,-13.014458451;锛,-15.1545246145;媚,-11.9764707842;亢,-14.7490595064;軋,-11.4409525478;认,-9.34938964559;憨,-14.2382338826;紫,-8.12410932278;荆,-10.6943802006;席,-8.93592449481;闔,-14.4613774339;薜,-13.7682302534;吱,-14.7490595064;疰,-14.2382338826;谏,-14.4613774339;爵,-9.93416878942;貶,-12.8031493573;根,-7.85641786522;筵,-10.0455534197;攻,-9.06095484446;髋,-12.6696179647;肾,-8.0140715714;屁,-9.12986710004;饃,-11.7045370687;廂,-9.89963680588;驅,-9.44244333703;寄,-9.47435200549;均,-8.77355497887;炭,-10.3628748616;偉,-10.3302188986;燈,-8.0208296969;测,-10.2947122101;湍,-10.6112298322;蝸,-10.2831513877;糨,-12.9573000372;腹,-8.31024175848;腓,-13.0750830728;貢,-7.60834236716;彗,-10.534465816;糖,-8.11180147511;姘,-13.014458451;畛,-13.7682302534;轎,-8.41459644616;噝,-14.7490595064;韜,-11.584991918;蜈,-9.79558262614;污,-8.94895726073;袁,-13.6504472177;诤,-13.2827224376;擦,-11.5572123539;恩,-9.35694826056;臨,-9.72298840417;繭,-11.6429791757;魯,-13.6504472177;壮,-9.718621585;痰,-12.9032328159;关,-5.77334502284;盲,-9.47948460871;創,-6.0216053895;莪,-15.1545246145;莨,-12.4464744134;蒸,-8.69854019651;觸,-9.47264697523;諺,-11.0518812495;征,-9.38933351172;窃,-12.1841101489;邪,-10.0365308021;禅,-9.49504239874;璇,-14.0559123258;圆,-7.82773010739;厉,-11.5436067019;键,-10.7539215943;事,-5.47721646682;焊,-11.6281640899;謎,-10.5594047644;抓,-11.094081604;攒,-13.901761646;怔,-12.0190303986;岗,-9.2130384372;湘,-10.7914259897;骚,-12.0864716794;娘,-7.96384858017;際,-11.4782239426;多,-7.82117485612;喝,-12.6287959702;苛,-12.1841101489;猞,-11.8403386098;澡,-11.4532226404;渠,-8.10483583963;檣,-15.1545246145;财,-5.96561218994;朦,-15.1545246145;掩,-10.9276908692;針,-8.36442737899;庫,-7.74206239276;維,-8.24776983585;誉,-13.7682302534;遜,-10.9498319951;瘰,-12.8031493573;劳,-7.27239839257;甲,-7.66204290392;况,-14.7490595064;買,-8.55806127361;讹,-12.0864716794;樸,-10.5394040977;贩,-11.1381415938;施,-10.2831513877;萼,-11.1937114449;肿,-8.81769888336;翁,-13.7682302534;诡,-11.094081604;終,-8.04668972381;叉,-11.7045370687;版,-8.51203781314;介,-8.77864836848;纶,-13.901761646;绣,-10.6828858211;芹,-11.2129428068;柑,-9.59384298349;虐,-14.0559123258;拓,-10.1078788829;祢,-12.8031493573;联,-7.19176068433;鳗,-11.1381415938;许,-9.99259987286;四,-7.7258943759;嗝,-13.901761646;瑜,-10.785076762;烟,-7.65759474534;信,-5.60464528453;习,-7.5631675678;赢,-10.8237912742;桤,-13.7682302534;蝦,-10.9204181099;菩,-8.60702210081;艨,-13.139621594;盈,-7.35068131096;屬,-8.73127765097;壯,-9.718621585;閼,-13.3627651453;癰,-12.8519395215;勳,-9.5766833632;釵,-15.1545246145;側,-9.45241019695;轶,-11.7872287845;蛻,-14.0559123258;鹁,-12.0634821611;娃,-8.90358458683;番,-10.1472282217;餅,-10.837036501;预,-7.46905125351;劈,-12.0410093053;下,-6.97420373973;冊,-11.9158461623;贍,-13.3627651453;栏,-9.59962892055;悔,-13.0750830728;笙,-12.4464744134;窘,-11.3368122885;轮,-7.94444498633;借,-8.37630870688;樣,-7.20719958749;褥,-11.599176553;簧,-12.6696179647;终,-8.04668972381;芨,-13.5450867021;師,-7.06045146643;集,-6.06347466372;岬,-11.9158461623;堯,-11.658017053;宮,-7.44096333682;皰,-11.2937949035;疲,-11.599176553;遑,-13.2086144654;谷,-8.14466411258;侶,-15.1545246145;檸,-10.4052540845;覺,-10.3505035698;蒼,-9.44741434975;耿,-14.7490595064;驃,-11.5301836815;郊,-11.571005676;饅,-9.45575468167;飄,-12.3819358923;鐃,-13.014458451;鷺,-12.3213112704;籍,-11.3478621247;之,-9.94777444148;蕴,-10.0577116242;泌,-10.7914259897;村,-7.15787073904;蛐,-12.2367538824;打,-9.07344790871;慕,-14.7490595064;饥,-8.92502790359;鱗,-9.79088778183;孙,-9.17690547422;嫘,-14.4613774339;陛,-8.31290913803;畝,-13.4497765223;狻,-12.3511642336;齿,-9.88409245144;癤,-14.0559123258;轡,-12.2641528566;煽,-13.2086144654;摧,-14.7490595064;拨,-13.014458451;幫,-9.72737437611;自,-6.72256256745;衣,-7.16683031212;硯,-11.8223201043;篮,-9.38776734069;困,-9.1743738273;闲,-8.93791851342;兵,-7.00074329496;烴,-11.8046205272;閉,-10.9724744719;歹,-10.6327360375;櫸,-14.2382338826;蝾,-12.1340997284;擼,-14.7490595064;开,-7.05892591312;訪,-11.9356487896;颅,-11.0273902295;处,-7.88282090762;喇,-8.81416531078;嘆,-14.0559123258;劉,-11.8964280765;匈,-8.56353698887;例,-8.74024632095;逊,-10.9498319951;規,-5.35695328756;討,-11.7872287845;暑,-11.8964280765;颌,-11.4168549962;帖,-10.0950991562;贅,-12.0864716794;垛,-12.0864716794;砚,-11.8223201043;咝,-14.7490595064;甜,-9.17311040325;熟,-9.42767686692;鈞,-11.599176553;亡,-10.4723933874;传,-6.35894239755;讣,-12.2641528566;氢,-8.99015773252;斧,-10.4315713929;怪,-9.01248720892;岭,-9.97555400559;妯,-12.3819358923;種,-6.95932892595;皱,-9.94230994701;地,-4.38850582094;玳,-11.5572123539;吲,-12.0864716794;債,-6.4278811989;誹,-12.8519395215;螻,-11.7367979309;蒽,-12.5518349291;膿,-10.1143305182;舾,-15.1545246145;廁,-9.6035048944;层,-8.1661114325;磅,-13.901761646;症,-8.11486426464;癆,-12.4803759651;午,-9.49156413437;鸥,-14.0559123258;遊,-7.26319385684;赌,-9.75862691962;鏈,-9.15682951764;材,-7.04514929678;藥,-6.86599015509;賢,-9.2383225519;霜,-10.2947122101;腔,-11.0854978603;鷗,-14.0559123258;鸣,-11.2325512782;站,-8.89973472645;存,-7.79473875827;矛,-10.4723933874;辎,-10.7978157878;違,-10.6828858211;啜,-13.6504472177;營,-7.08612165593;满,-8.48629636609;你,-12.4803759651;爺,-8.75343694914;蒲,-10.5053375431;旧,-8.32527156368;晦,-14.7490595064;择,-13.901761646;荨,-12.0864716794;快,-8.96523432406;聪,-10.8107191926;峭,-10.1505783086;积,-7.90958306817;驮,-12.2641528566;物,-5.9455351546;右,-8.25480150722;熒,-9.58237058233;僵,-9.52510655514;兴,-7.9956215878;混,-8.17911068705;歸,-9.76773859997;蟻,-11.4656451604;砾,-10.00123302;懿,-11.3368122885;找,-11.4532226404;币,-10.3670328717;往,-9.75636191299;邓,-11.3817636764;岂,-15.1545246145;堅,-10.4449944132;妄,-11.7045370687;唇,-10.5053375431;隆,-11.3368122885;鈉,-11.72053741;炊,-10.2755177629;氍,-12.589575257;涌,-10.8640651734;椏,-15.8476717951;蘑,-10.0793507993;撒,-10.590176423;怕,-13.5450867021;崗,-9.2130384372;庖,-13.0750830728;騙,-10.2604231367;官,-6.13292636712;颚,-13.7682302534;吝,-13.139621594;喜,-8.54114039612;償,-11.7533272328;办,-6.71345681348;渡,-9.40832142396;侠,-11.8403386098;欣,-13.3627651453;艰,-12.6696179647;推,-8.57111539234;缫,-12.589575257;綬,-13.2086144654;夯,-11.2627043164;窮,-9.40832142396;錳,-11.0193580578;脏,-9.38464233814;醴,-13.6504472177;贷,-6.92328166269;溶,-8.1866154127;樹,-7.35559130446;灵,-8.04832839685;蜻,-10.9878593907;螞,-9.9868855716;落,-8.47555376673;愿,-9.26150014021;繁,-10.004127378;驊,-14.7490595064;硅,-9.43093951255;起,-7.5631675678;镇,-9.12986710004;盆,-7.64765814689;又,-9.09423387647;绶,-13.2086144654;跌,-7.81856474044;蝌,-10.2755177629;驹,-14.4613774339;擒,-15.8476717951;误,-8.94895726073;败,-9.41956652238;坛,-11.4909629684;磚,-8.8638818298;嗜,-10.9350169093;秆,-13.0750830728;勞,-7.27239839257;乡,-7.85034497206;俠,-11.8403386098;正,-7.28321341118;波,-7.8510179196;桥,-8.80363889779;扩,-10.3342430489;鑽,-9.06095484446;釹,-14.2382338826;緬,-14.2382338826;噱,-11.7045370687;眩,-13.901761646;即,-12.1587923409;哲,-7.42676926396;偵,-9.70778724284;燴,-11.3703349806;海,-5.59155748143;件,-12.8519395215;诸,-8.61061276894;棺,-8.38545685529;腿,-10.1709179928;拾,-15.1545246145;
+B,o:丁,-4.40465332485;喀,-4.79485096082;喃,-2.85872881813;噗,-3.86951039343;嘀,-5.87099039364;劈,-4.94145443502;飕,-5.53451815702;嗖,-4.66701758931;嘎,-3.79991710163;吐,-6.27645550175;咕,-2.62839804215;咔,-3.91560150063;嘖,-4.79485096082;沙,-6.49959905306;咚,-3.46705280639;潑,-7.19274623362;嘟,-4.53598932691;咣,-4.89016114063;哼,-6.63313044569;鏗,-6.96960268231;嚦,-6.96960268231;吧,-4.89016114063;噼,-4.03574581247;嘩,-3.34259863191;骨,-8.57904059474;咪,-6.78728112551;吭,-5.02369253325;咯,-3.11098045361;吱,-4.59005654818;嘰,-3.98392074461;喳,-5.48799814138;撲,-2.81698921196;梵,-6.49959905306;咴,-8.57904059474;刷,-6.63313044569;刺,-6.78728112551;阿,-8.57904059474;咿,-4.81784047905;滴,-4.27497550154;啁,-5.63460161558;颼,-5.53451815702;嘁,-4.94145443502;淅,-6.49959905306;哇,-3.40289086217;哈,-2.12227093917;扑,-2.81698921196;哐,-5.02369253325;当,-5.32094405672;乒,-5.63460161558;隆,-3.33201652258;哗,-3.34259863191;呖,-6.96960268231;淙,-5.24683608457;剝,-7.88589341418;轟,-3.52279478939;嗡,-3.15409057726;怦,-3.68120079479;泼,-7.19274623362;剥,-7.88589341418;唧,-4.27497550154;哧,-7.19274623362;汩,-4.64721496202;忽,-5.40098676439;啪,-4.75039919825;叭,-7.19274623362;叮,-3.88769271251;呱,-4.50150315084;轰,-3.52279478939;嘿,-3.06561184858;嗷,-4.70783958383;當,-5.32094405672;啧,-4.79485096082;潺,-6.96960268231;叽,-3.98392074461;呼,-3.86054172345;铿,-6.96960268231;
+B,p:趁,-5.57824191098;较,-6.5371853628;順,-5.09125273536;随,-2.41330007809;憑,-4.78822843281;經,-2.57738361167;缘,-7.11940098266;通,-1.71564310365;依,-5.41465289042;本,-6.49346255179;边,-9.64512962696;为,-2.31578985799;沿,-4.76422343954;经,-2.57738361167;乘,-7.00607229735;針,-3.80776367771;靠,-5.98799887117;緣,-7.11940098266;以,-7.25866304999;除,-3.28059403956;凭,-4.78822843281;至,-3.82023632656;鉴,-4.94692457501;當,-5.59117312565;对,-2.13032986648;顺,-5.09125273536;較,-6.5371853628;按,-2.74654123581;针,-3.80776367771;邊,-9.64512962696;對,-2.13032986648;向,-5.91044063682;朝,-5.74063488796;借,-5.80836910604;連,-5.45547488494;隨,-2.41330007809;冲,-5.95625017285;根,-2.12550501256;為,-2.31578985799;及,-6.52607413738;鑑,-4.94692457501;当,-5.59117312565;每,-5.55915331441;衝,-5.95625017285;關,-2.63526912505;连,-5.45547488494;因,-10.1151332562;自,-4.14285152852;关,-2.63526912505;基,-4.37534034403;比,-7.4341117275;
+B,qe:兆,0.0;
+B,q:一,-8.54905170513;市,-8.70320238496;处,-9.80181467362;誇,-9.80181467362;分,-4.3274453633;安,-7.35946763826;圈,-7.09376447252;開,-6.50597780762;萬,-6.68829936441;库,-10.4949618542;尔,-6.91144291573;圖,-9.39634956552;團,-8.70320238496;会,-4.82853516607;开,-6.50597780762;股,-5.38901638028;簇,-6.9396137927;伦,-10.4949618542;吨,-8.88552394175;庫,-10.4949618542;个,-4.33164705015;架,-8.19237676119;样,-8.88552394175;澳,-6.60314155607;蒲,-7.60459009629;段,-9.80181467362;場,-7.78691165308;戶,-7.85590452457;点,-7.40391940083;夸,-9.80181467362;马,-4.71421833839;场,-7.78691165308;個,-4.33164705015;爾,-6.91144291573;品,-8.70320238496;层,-4.79786836768;摄,-7.93001249672;过,-7.93001249672;兆,-5.36506313926;先,-7.09376447252;立,-3.5952387469;塊,-7.45043941646;种,-3.01509772302;华,-8.70320238496;歐,-10.4949618542;团,-8.70320238496;法,-5.83152276007;日,-7.55052287502;毛,-5.66664811688;坚,-10.4949618542;瑞,-10.4949618542;裡,-6.83140020806;卢,-8.29773727685;句,-5.77646298289;層,-4.79786836768;盧,-8.29773727685;周,-5.69094080945;毫,-2.78969937932;短,-7.23686531616;公,-2.20241334021;華,-8.70320238496;普,-6.52466994063;英,-4.10640044864;兰,-8.19237676119;過,-7.93001249672;絲,-9.80181467362;年,-4.91901275104;噸,-8.88552394175;系,-3.10478042596;種,-3.01509772302;會,-4.82853516607;堅,-10.4949618542;万,-6.68829936441;阵,-4.84247267392;辈,-6.80608240007;下,-7.66174851013;輩,-6.80608240007;千,-3.37532621617;伏,-6.11293521951;美,-1.53321105485;列,-10.4949618542;厘,-4.21269510729;丛,-7.78691165308;丝,-9.80181467362;嘟,-7.93001249672;組,-7.19912498818;次,-7.19912498818;加,-5.6121599316;樣,-8.88552394175;大,-6.73376173849;声,-6.85737569446;天,-3.38100574462;攝,-7.93001249672;倫,-10.4949618542;蘭,-8.19237676119;馬,-4.71421833839;微,-5.81283062706;週,-5.69094080945;聲,-6.85737569446;朵,-7.09376447252;户,-7.85590452457;家,-5.41978803895;刻,-8.88552394175;人,-5.56048792105;流,-9.39634956552;元,-9.80181467362;居,-6.15115643233;组,-7.19912498818;片,-9.80181467362;光,-6.83140020806;重,-8.88552394175;克,-4.99370364364;里,-6.83140020806;盎,-3.69367881971;角,-9.39634956552;處,-9.80181467362;块,-7.45043941646;牛,-5.27460602911;坎,-7.93001249672;點,-7.40391940083;卡,-6.48762866895;陣,-4.84247267392;叢,-7.78691165308;步,-5.43871604884;欧,-10.4949618542;瓦,-7.35946763826;艘,-10.4949618542;赫,-6.06414505534;焦,-6.11293521951;杯,-9.80181467362;台,-9.80181467362;平,-1.60579139882;海,-4.84951495654;航,-10.4949618542;图,-9.39634956552;
+B,rr:您,-2.23952695703;其,-0.112618878108;
+B,rz:这,0.0;這,0.0;
+B,r:老,-8.43668883874;一,-4.45938794061;它,-4.42185293878;如,-3.61188420974;餘,-9.42345282727;各,-2.97255620644;自,-2.80251227213;三,-7.74650462331;個,-9.02329277139;二,-6.88950409242;后,-5.68540535144;我,-2.63125092862;这,-1.54603156382;洒,-9.55925436843;尔,-13.5665875537;缘,-9.22278213181;這,-1.54603156382;爺,-11.487146012;多,-4.57253925805;该,-4.69438079763;那,-2.57980441657;甚,-6.87326388539;別,-4.5577515579;两,-6.37140023348;大,-4.31875873728;亦,-10.5220651159;爾,-13.5665875537;在,-8.62494513105;别,-4.5577515579;个,-9.02329277139;本,-3.62397544644;是,-11.487146012;咱,-4.71335078892;有,-3.47927956821;足,-8.63211362053;诸,-6.82725092631;贵,-11.9571496412;貴,-11.9571496412;爷,-11.487146012;鄙,-9.63476192094;您,-8.98162007499;为,-4.57552322147;咋,-8.78746406055;吾,-9.85301548696;旁,-8.20061153864;什,-2.96665825362;几,-7.97560057315;之,-4.00284759588;前,-6.03610755842;每,-3.54092661717;同,-8.27328272894;灑,-9.55925436843;某,-4.58817923903;何,-5.38851008981;他,-2.69431170029;余,-9.42345282727;若,-8.75440319829;怎,-3.50797836426;敝,-12.467975265;誰,-7.53830903343;你,-3.99710528318;緣,-9.22278213181;為,-4.57552322147;啥,-9.23585421338;此,-3.81345788272;兩,-6.37140023348;哪,-4.53537384758;己,-10.4755451003;谁,-7.53830903343;該,-4.69438079763;其,-2.77650588099;她,-5.31596747149;諸,-6.82725092631;任,-4.52230176602;俺,-7.62905134858;後,-5.68540535144;彼,-6.31950696908;虎,-11.7748280844;幾,-7.97560057315;
+B,s:一,-3.07939276023;境,-3.58421766002;内,-4.18194269034;怀,-5.37088716653;營,-7.88564677946;頭,-4.6840624517;袋,-8.33763190321;爐,-10.4376927321;園,-6.40345209394;枕,-7.46727826652;研,-9.45686347908;岗,-9.05139837097;外,-6.04530331038;丘,-12.2294522013;岛,-5.70295734175;会,-10.1500106596;东,-3.22909239413;沟,-7.46727826652;江,-5.89795035142;堤,-7.77510490506;现,-4.39426844605;身,-3.04658580634;太,-6.53909274699;陌,-9.5903948717;箱,-9.28501322215;河,-5.58436123181;嘴,-4.86048179912;傷,-9.18492976359;零,-7.77510490506;边,-4.84360112319;頸,-8.73294463985;区,-6.69606271259;辽,-8.73294463985;沿,-8.29762656859;櫃,-10.4376927321;舷,-9.66450284386;郊,-5.75556150496;遠,-5.20302539262;臉,-3.98774904159;半,-6.2892809486;桌,-4.9528957986;低,-6.61268110365;近,-5.47251981207;船,-5.14438790736;陆,-6.29720701387;院,-6.87759406784;胸,-5.73267721113;塘,-9.52140200021;窗,-4.7969683934;党,-6.32136926315;輻,-10.6200142889;凡,-8.82825481965;池,-9.5903948717;面,-5.41271632072;车,-5.58957636749;高,-5.96225165278;班,-7.40917063571;深,-5.0372701426;机,-6.72006386469;當,-4.0066300705;对,-6.65729816914;炕,-7.92538710811;系,-8.64593326286;遼,-8.73294463985;途,-5.82422374329;省,-7.28069231094;暗,-9.52140200021;眉,-8.59186604159;颈,-8.73294463985;崖,-10.032227624;牆,-5.44726014531;樓,-5.16897583532;隔,-6.42130971134;橋,-6.74051447516;丛,-10.8431578402;队,-10.6200142889;实,-9.09395798539;片,-7.7185926948;野,-6.75718152765;陰,-7.69685270816;天,-5.22185158736;宮,-5.20391388668;耳,-6.1025830172;網,-3.67034960682;户,-6.92614729326;家,-3.65154027487;岸,-5.60538697352;总,-11.1308399126;嶺,-8.22211901608;手,-3.32563698959;房,-5.25497329029;籃,-9.45686347908;車,-5.58957636749;懷,-5.37088716653;汇,-8.67410413983;屋,-4.57975957761;背,-9.52140200021;城,-4.06893395384;村,-6.78271482965;拐,-8.73294463985;道,-6.91624622227;角,-10.2835420523;腕,-8.42278971155;體,-4.75865842712;街,-4.78053609877;陸,-6.29720701387;盘,-4.84982004871;線,-7.88564677946;坝,-7.98095695927;機,-6.72006386469;攤,-9.13840974796;坡,-12.2294522013;网,-3.67034960682;陣,-6.74881327797;叢,-10.8431578402;盤,-4.84982004871;實,-9.09395798539;黨,-6.32136926315;關,-6.8403804715;六,-11.5363050208;当,-4.0066300705;篮,-9.45686347908;東,-3.22909239413;隊,-10.6200142889;敵,-6.95133754209;腹,-6.87286592664;書,-7.24584557961;寺,-7.05896820628;阴,-7.69685270816;現,-4.39426844605;最,-9.05139837097;市,-4.08535373798;颅,-7.86000434885;宇,-10.2835420523;分,-9.5903948717;炉,-10.4376927321;上,-6.1069593918;后,-10.2835420523;云,-9.83155692852;井,-7.20557168047;林,-6.26074464133;世,-5.65020098931;墙,-5.44726014531;長,-10.6200142889;军,-5.55236874007;溝,-7.46727826652;原,-9.18492976359;畫,-11.5363050208;伤,-9.18492976359;田,-7.45032870821;肩,-6.28403159271;敝,-9.66450284386;宫,-5.20391388668;岭,-8.22211901608;架,-7.27362514372;远,-5.20302539262;地,-3.3132144696;文,-7.10548822191;头,-4.6840624517;戶,-6.92614729326;脸,-3.98774904159;洋,-7.66510400985;殿,-7.40917063571;場,-5.30189429504;壁,-6.78703449079;區,-6.69606271259;心,-2.59208094332;邊,-4.84360112319;獄,-6.41234104135;屆,-11.5363050208;對,-6.65729816914;届,-11.5363050208;軍,-5.55236874007;敌,-6.95133754209;藏,-7.23901961454;罐,-8.42278971155;湖,-5.70883107376;站,-6.12242931357;兜,-7.67557530972;域,-9.23371992776;塞,-6.94624847258;胡,-12.2294522013;口,-5.25310413087;场,-5.30189429504;此,-5.1277762297;书,-7.24584557961;壩,-7.98095695927;左,-6.84955484778;园,-6.40345209394;路,-4.2680819996;眼,-4.72121342664;狱,-6.41234104135;右,-6.96676201241;线,-7.88564677946;巷,-7.5020643826;空,-4.61464683661;国,-2.52197953271;楼,-5.16897583532;門,-3.52329291039;會,-10.1500106596;崗,-9.05139837097;三,-9.5903948717;國,-2.52197953271;辖,-9.23371992776;不,-6.64972237533;後,-10.2835420523;树,-5.7372123663;辐,-10.6200142889;北,-5.43262848304;轄,-9.23371992776;校,-8.05506493142;顱,-7.86000434885;营,-7.88564677946;室,-5.36669428827;大,-8.00994449614;水,-4.37740199405;溪,-10.2835420523;中,-7.89871886103;匯,-8.67410413983;舱,-7.09365376427;冰,-7.72964253099;阵,-6.74881327797;鼻,-8.9713556633;樹,-5.7372123663;画,-11.5363050208;總,-11.1308399126;摊,-9.13840974796;海,-3.44974091111;腋,-7.83500304664;囊,-7.58506130218;前,-4.94737854322;超,-8.18640093348;界,-8.67410413983;体,-4.75865842712;幕,-6.81335179911;南,-6.2330001127;他,-8.86215637133;艙,-7.09365376427;鄉,-6.17266818809;棚,-8.51588013461;九,-8.5405727472;柜,-10.4376927321;乡,-6.17266818809;桥,-6.74051447516;內,-4.18194269034;门,-3.52329291039;八,-10.4376927321;雪,-9.92686710832;杯,-8.42278971155;山,-4.09821565162;台,-5.31770490107;关,-6.8403804715;雲,-9.83155692852;长,-10.6200142889;卷,-10.4376927321;島,-5.70295734175;舍,-8.5405727472;西,-2.95098600029;
+B,t:怀,-9.58714817941;戌,-11.8558317207;預,-12.2612968288;昔,-6.80597571348;会,-5.8139909663;驚,-9.86340155604;两,-8.69176413236;未,-3.61018481986;阴,-11.345006097;方,-7.01427275668;永,-8.26309612717;见,-11.8558317207;母,-10.6518589164;金,-8.04178912366;狗,-12.9544440094;遠,-7.64123803036;除,-8.21824556101;早,-4.2400406487;周,-3.99359116408;班,-11.0085338603;马,-10.6518589164;歲,-7.48217333573;年,-3.72390893014;其,-6.70061519783;滿,-9.37092507094;羊,-12.9544440094;排,-9.73556818453;五,-5.35354154986;首,-5.01528519144;星,-6.28621576098;無,-7.14031347758;探,-12.2612968288;交,-9.2408719427;咨,-12.9544440094;是,-7.18300288627;嚴,-8.86009944718;黄,-6.23301830861;寒,-8.48853589075;教,-10.3894946519;衛,-12.2612968288;来,-6.10643873482;盤,-12.9544440094;秦,-6.3397184092;火,-10.3894946519;更,-12.9544440094;须,-7.70217058135;基,-9.06262371129;广,-10.8750024677;順,-6.64999520698;見,-11.8558317207;上,-3.47728775765;侏,-8.0792466862;后,-3.83545167688;朔,-8.69176413236;剛,-4.77889641338;亥,-11.8558317207;第,-6.18365458549;枯,-8.34927382341;殷,-9.58714817941;抽,-11.8558317207;鬼,-11.8558317207;便,-10.7572194321;秋,-5.80531241084;伏,-9.29088236327;聖,-7.05454665582;晚,-4.29940375129;勝,-12.9544440094;迟,-11.0085338603;民,-8.92909231867;嗣,-8.57241737473;以,-5.72098859078;巳,-11.8558317207;數,-10.1212306653;老,-7.00640902022;节,-5.41701397281;清,-4.60024044648;饭,-7.60258587592;漏,-11.5681496483;芒,-10.0640722515;北,-4.96998127714;愛,-12.2612968288;初,-5.55688247388;期,-7.06556605107;严,-8.86009944718;术,-7.86069380859;週,-3.99359116408;冰,-7.073911023;申,-11.345006097;課,-8.67777789038;土,-11.8558317207;拂,-8.66398456825;久,-9.55324662774;汉,-5.57856186119;今,-2.31419917218;前,-5.21247610958;双,-9.34352609676;幼,-7.09365778593;處,-10.8750024677;南,-5.01564176125;春,-5.26233066981;八,-6.03476015955;雪,-9.21677439112;课,-8.67777789038;开,-9.42808348478;师,-12.2612968288;残,-10.6518589164;而,-7.50340555583;霎,-10.2463938083;成,-8.09463160504;趕,-12.2612968288;龙,-12.2612968288;文,-11.1626845402;昨,-3.4723223145;劫,-10.1818552872;洪,-7.46550628324;戰,-5.78048568964;王,-12.9544440094;黃,-6.23301830861;立,-7.95723173564;重,-7.33767291173;行,-8.74975139001;发,-8.87690656549;兒,-8.67777789038;这,-11.5681496483;廣,-10.8750024677;慢,-10.6518589164;日,-4.86588220412;学,-12.2612968288;晨,-9.12580261291;遼,-8.41114922713;持,-9.77639017905;七,-6.38076384244;如,-3.92898847662;复,-9.31685784967;小,-8.0792466862;團,-11.8558317207;從,-6.36827235455;次,-5.08313280608;深,-6.67030984833;电,-12.2612968288;十,-5.11688964852;假,-7.02751798343;鼠,-10.1818552872;轉,-7.71269699434;當,-2.7255451676;忌,-10.0100050302;絕,-9.90992157168;盘,-12.9544440094;牛,-8.57241737473;酝,-11.0085338603;胜,-12.9544440094;實,-11.1626845402;雨,-7.52509838045;六,-6.61232259068;繼,-11.5681496483;平,-4.9024659305;顷,-7.75594697813;月,-5.07250652013;宋,-5.37578715881;傍,-6.79746502382;頃,-7.75594697813;閏,-10.5565487366;明,-3.16088293624;酒,-7.67632935017;弘,-8.28161517494;夜,-4.81500348753;九,-6.11496757117;花,-8.7203375048;冷,-9.37092507094;父,-11.1626845402;去,-4.24053338091;礼,-9.29088236327;虎,-8.51179275291;子,-8.98415209585;雙,-9.34352609676;恢,-9.39909594791;泥,-8.39009581793;公,-4.68391891435;石,-8.41114922713;遲,-11.0085338603;畴,-11.5681496483;懷,-9.58714817941;乾,-7.11963327234;會,-5.8139909663;嘉,-6.4851936926;圓,-9.42808348478;隋,-6.19634950497;猛,-8.76478926737;醜,-11.8558317207;生,-6.60705479974;圣,-7.05454665582;营,-11.345006097;大,-7.21144082159;頭,-8.81130928301;冬,-4.94774316396;暮,-8.86009944718;爱,-12.2612968288;现,-2.67224608607;午,-5.74658413797;節,-5.41701397281;权,-12.9544440094;晉,-8.31971502117;凌,-6.67968198816;从,-6.36827235455;当,-2.7255451676;雞,-12.2612968288;建,-8.03446308357;卫,-12.2612968288;目,-2.83661149991;佳,-10.5565487366;酷,-12.2612968288;幹,-10.8750024677;須,-7.70217058135;權,-12.9544440094;龍,-12.2612968288;东,-5.17038700676;那,-6.79746502382;漢,-5.57856186119;产,-9.14778151963;猪,-12.2612968288;傳,-12.9544440094;康,-11.8558317207;收,-11.8558317207;辽,-8.41114922713;昼,-9.86340155604;寅,-10.3894946519;商,-6.37519279739;半,-6.72988558013;晌,-7.8011524149;青,-7.84245622104;酉,-11.8558317207;淡,-10.8750024677;继,-11.5681496483;端,-7.6917538205;旱,-10.3153866798;赶,-12.2612968288;發,-8.87690656549;考,-10.5565487366;万,-6.55086981147;服,-12.9544440094;二,-6.25125589616;醞,-11.0085338603;天,-7.16754662803;禮,-9.29088236327;環,-10.4695373596;光,-12.2612968288;術,-7.86069380859;孕,-7.84245622104;體,-12.2612968288;汛,-7.5383436072;旦,-8.74975139001;兩,-8.69176413236;道,-8.67777789038;良,-12.9544440094;孵,-9.04242100397;时,-7.9438087153;岁,-7.48217333573;将,-5.46335641587;肉,-11.5681496483;斋,-9.86340155604;舊,-6.69486254534;唐,-4.99307380768;誕,-12.2612968288;刚,-4.77889641338;霜,-9.81894979347;素,-12.2612968288;本,-4.44186143054;环,-10.4695373596;三,-6.03278582525;猴,-11.8558317207;眼,-4.60377776888;逾,-11.8558317207;時,-7.9438087153;过,-3.61852881452;先,-5.87694595583;雍,-10.8750024677;過,-3.61852881452;志,-8.91139274157;婚,-7.42899107027;绝,-9.90992157168;潜,-8.50009671315;解,-7.44911247347;童,-7.23413223279;此,-4.21891882367;转,-7.71269699434;数,-10.1212306653;干,-10.8750024677;国,-6.10643873482;彼,-7.95049770346;封,-9.29088236327;稅,-8.76478926737;震,-8.35932415927;不,-6.72790734011;後,-3.83545167688;向,-10.1818552872;這,-11.5681496483;中,-4.35991947505;瞬,-6.21274331475;新,-7.43699111294;活,-10.4695373596;元,-4.44306770331;燈,-9.19324389371;翌,-6.64634556789;魏,-12.9544440094;臘,-7.60258587592;赛,-8.7800567395;晝,-9.86340155604;远,-7.64123803036;孟,-12.2612968288;无,-7.14031347758;团,-11.8558317207;古,-4.3945745437;卯,-11.1626845402;壮,-9.12580261291;闰,-10.5565487366;仲,-9.02261837668;白,-5.96787754999;一,-4.57009673132;圆,-9.42808348478;安,-9.39909594791;事,-6.40622490664;同,-8.15042296467;馬,-10.6518589164;战,-5.78048568964;愚,-11.1626845402;盛,-8.07164208681;產,-9.14778151963;宰,-10.3153866798;萬,-6.55086981147;劳,-10.3894946519;甲,-11.8558317207;破,-10.3894946519;開,-9.42808348478;戊,-12.9544440094;腊,-7.60258587592;近,-3.59723656161;四,-6.49453955502;豬,-12.2612968288;壯,-9.12580261291;陰,-11.345006097;闲,-9.37092507094;電,-12.2612968288;预,-12.2612968288;將,-5.46335641587;來,-6.10643873482;下,-4.1240472083;妊,-7.87927019417;和,-9.10429640769;休,-9.95871173585;閒,-9.37092507094;飯,-7.60258587592;实,-11.1626845402;師,-12.2612968288;谷,-9.45793644793;晋,-8.31971502117;潑,-9.69634747138;麥,-11.5681496483;黎,-6.89065880071;诞,-12.2612968288;既,-9.10429640769;体,-12.2612968288;灯,-9.19324389371;東,-5.17038700676;已,-9.55324662774;泼,-9.69634747138;現,-2.67224608607;最,-4.76909378622;处,-10.8750024677;疇,-11.5681496483;税,-8.76478926737;暑,-8.15042296467;世,-6.2010060908;舞,-11.5681496483;传,-12.9544440094;宣,-7.41318046424;夤,-10.0640722515;地,-12.2612968288;头,-8.81130928301;情,-9.45793644793;植,-12.9544440094;季,-12.9544440094;剎,-7.02485486601;兔,-12.9544440094;營,-11.345006097;满,-9.37092507094;旧,-6.69486254534;晦,-11.8558317207;學,-12.2612968288;顺,-6.64999520698;賽,-8.7800567395;丁,-11.5681496483;往,-5.28728575408;崇,-10.0100050302;隆,-6.45165396348;國,-6.10643873482;夏,-4.38998562552;丑,-11.8558317207;殘,-10.6518589164;望,-12.9544440094;感,-8.41114922713;鸡,-12.2612968288;麦,-11.5681496483;末,-7.86684767417;辰,-11.8558317207;刹,-7.02485486601;儿,-8.67777789038;齋,-9.86340155604;惊,-9.86340155604;潛,-8.50009671315;勞,-10.3894946519;正,-6.3877715796;諮,-12.9544440094;即,-7.31965440623;起,-11.8558317207;零,-10.8750024677;命,-11.8558317207;西,-5.00218070074;
+B,u:极,-4.65576346373;一,-1.18058314491;的,-2.67902235634;與,-4.97908060023;來,-1.32315133932;開,-10.7379823741;而,-2.59825009439;与,-4.97908060023;云,-10.7379823741;则,-8.34008710131;开,-10.7379823741;在,-3.08591162799;般,-3.3108382407;為,-3.76163430366;似,-2.44493323434;恁,-6.73064918888;則,-8.34008710131;等,-2.6156111307;矣,-8.94622290488;为,-3.76163430366;来,-1.32315133932;雲,-10.7379823741;極,-4.65576346373;起,-8.09892504449;
+B,vd:持,-0.137510455466;往,-4.7251043999;严,-8.60666819784;狡,-5.66222921868;逆,-3.67219426471;閉,-4.91778874373;自,-8.60666819784;闭,-4.91778874373;同,-2.58929226895;超,-6.90192010561;足,-8.60666819784;倒,-7.91352101728;冒,-6.40944362051;嚴,-8.60666819784;偷,-7.22037383672;堅,-5.89861799674;宛,-6.66075804879;坚,-5.89861799674;
+B,vi:等,0.0;
+B,vn:怀,-10.0988886393;誇,-12.9321019834;涉,-8.24535181038;谈,-5.41621289814;随,-10.0143312513;預,-4.10566094158;抗,-6.10122774871;洞,-11.6793390149;造,-6.75001707664;廝,-11.2273538911;作,-10.0143312513;河,-12.5266368753;侵,-6.7285548323;临,-6.75312106258;銷,-4.57778072492;吸,-9.04028168525;宽,-9.63626511736;黴,-12.5266368753;談,-5.41621289814;反,-4.81523711595;織,-10.2579533339;摘,-9.98766300419;赞,-9.19443236508;遠,-12.5266368753;知,-9.33478972277;除,-9.88757954564;緩,-9.79660776743;扬,-11.1403425141;衰,-8.66942210632;闹,-10.9171989628;绿,-7.91813889917;覆,-11.1403425141;沈,-8.59481124253;個,-10.5807267262;引,-10.0417302255;应,-4.91495934254;賄,-12.5266368753;無,-8.93390128169;遇,-13.6252491639;禦,-12.2389548028;崩,-11.3226640709;循,-5.85671586299;械,-12.5266368753;讲,-10.2930446537;冶,-10.734877406;视,-13.6252491639;運,-4.25058149852;契,-11.6793390149;录,-10.7920358199;教,-4.80366428649;盤,-9.12543949359;恫,-9.88757954564;滴,-12.2389548028;凶,-12.9321019834;铸,-10.0417302255;广,-6.71949588761;沉,-8.59481124253;贈,-12.9321019834;上,-7.89514938095;后,-6.92574882376;經,-4.71587875872;缔,-13.6252491639;默,-11.4280245866;蒙,-10.1287416025;惜,-13.6252491639;伴,-11.5458076222;离,-7.94849536165;渴,-13.6252491639;赈,-10.2579533339;釋,-9.65495725037;绕,-12.2389548028;敘,-9.46636608056;虚,-9.93636970981;繪,-11.8334896947;跳,-7.52717488175;偶,-13.6252491639;移,-5.86520848304;老,-10.9861918343;节,-7.34860567458;构,-8.40489333884;消,-4.3960870377;厌,-9.91167709722;冠,-13.6252491639;鬧,-10.9171989628;脫,-8.48945072687;撮,-11.1403425141;蠱,-11.6793390149;吹,-9.40574145874;稽,-11.4280245866;精,-11.0602998065;珍,-12.2389548028;克,-11.6793390149;駐,-8.19590353497;轟,-10.0988886393;賞,-10.9861918343;巨,-9.81858667415;腫,-11.5458076222;卷,-12.9321019834;固,-11.8334896947;导,-9.06090097245;糾,-11.8334896947;贊,-9.19443236508;再,-12.5266368753;錯,-10.2930446537;邮,-10.8526604417;删,-12.2389548028;符,-11.3226640709;義,-13.6252491639;爆,-8.32693179737;水,-10.3671526259;傷,-7.21179020675;旅,-5.70226320521;摄,-12.9321019834;重,-4.94203318868;灌,-6.40341333863;结,-6.37319521207;監,-4.49742121352;学,-11.6793390149;诱,-7.71988731587;詰,-12.5266368753;递,-9.33478972277;践,-12.5266368753;培,-6.51373704742;墾,-8.54384479894;憂,-7.85692816813;标,-7.93827380758;載,-8.98085826478;越,-8.581824047;妒,-13.6252491639;訛,-12.2389548028;加,-5.19798068003;缩,-9.61791597869;悬,-12.9321019834;贵,-11.5458076222;貴,-11.5458076222;蓄,-10.9171989628;识,-10.3294122979;轉,-6.26514519093;免,-7.33553359301;筑,-9.79660776743;絕,-9.77510156221;補,-5.98512599122;连,-7.23165840997;陣,-10.0988886393;實,-5.41295202569;扫,-9.58219789609;偷,-9.93636970981;相,-10.6295168904;驻,-8.19590353497;争,-6.09155545407;压,-7.48968427284;疏,-8.90675029262;頒,-8.79693542662;縮,-9.61791597869;贴,-7.89514938095;冷,-7.78170474689;制,-6.37816857933;兌,-11.0602998065;離,-7.94849536165;輸,-7.95192589675;蛙,-10.2240517823;裝,-8.15718902278;跟,-11.4280245866;乞,-12.5266368753;占,-11.3226640709;普,-8.0607287566;議,-9.6934235312;浴,-12.9321019834;寻,-10.734877406;壽,-13.6252491639;會,-8.08398561876;搅,-12.0158112515;三,-10.734877406;濃,-10.4063733391;缓,-9.79660776743;抖,-11.3226640709;講,-10.2930446537;负,-7.14981644722;大,-7.18909879555;支,-5.72276172676;记,-9.63626511736;仲,-8.42124247684;靈,-12.5266368753;义,-13.6252491639;凌,-10.8526604417;問,-8.2592731489;当,-8.74244724133;展,-7.84142398159;拖,-9.96168751779;衝,-5.3409973663;滞,-11.6793390149;叠,-10.4063733391;督,-9.33478972277;鹽,-10.7920358199;恭,-12.2389548028;贩,-10.1912619594;哺,-12.2389548028;肃,-9.65495725037;暗,-8.87165897281;依,-10.2930446537;东,-9.73342886581;判,-6.95448284307;撫,-9.91167709722;梳,-13.6252491639;漲,-9.88757954564;訴,-6.21853843374;区,-10.1912619594;夾,-11.1403425141;旁,-13.6252491639;杂,-8.03426218341;仇,-11.5458076222;觉,-10.0417302255;煎,-9.86404904823;壓,-7.48968427284;归,-7.00384351216;泛,-12.9321019834;保,-6.41516953575;闡,-12.5266368753;继,-8.48945072687;給,-10.734877406;當,-8.74244724133;凹,-11.1403425141;選,-9.02007897793;系,-12.9321019834;繼,-8.48945072687;考,-5.32050689428;抄,-12.5266368753;變,-3.81201460036;圍,-9.96168751779;頓,-12.5266368753;遥,-8.3319443392;連,-7.23165840997;風,-10.734877406;诊,-10.0143312513;野,-10.3671526259;體,-7.48752210983;揚,-11.1403425141;機,-7.79630354631;磨,-9.29451582363;扯,-13.6252491639;综,-5.01602388706;穿,-10.6808101848;攀,-11.8334896947;開,-7.19230907118;訊,-12.9321019834;笔,-12.0158112515;搖,-11.1403425141;唠,-11.2273538911;串,-9.59989747318;吶,-10.2930446537;点,-12.2389548028;刺,-13.6252491639;擁,-10.9171989628;担,-6.32275274019;过,-7.42271364673;過,-7.42271364673;結,-6.37319521207;答,-7.6642438243;慘,-11.4280245866;潜,-9.36256928688;忧,-7.85692816813;走,-8.02313034304;執,-6.42706558682;烹,-9.14791234944;典,-11.4280245866;款,-11.8334896947;寿,-13.6252491639;暂,-13.6252491639;朗,-11.8334896947;抚,-9.91167709722;煩,-12.0158112515;振,-7.91813889917;亲,-13.6252491639;眷,-10.9171989628;總,-12.9321019834;碾,-9.58219789609;降,-8.2361774341;协,-7.73914513247;赛,-11.2273538911;远,-12.5266368753;团,-12.5266368753;剥,-10.9861918343;鏤,-10.5342067106;滲,-12.5266368753;说,-10.4471953336;凸,-12.0158112515;幽,-10.9171989628;极,-8.42675213265;計,-7.94166939658;同,-7.84450564813;猎,-12.5266368753;研,-3.53002617123;战,-5.47680349768;產,-6.64796782229;冥,-10.3294122979;暫,-13.6252491639;順,-11.4280245866;断,-9.91167709722;搬,-9.77510156221;辱,-11.4280245866;丰,-11.0602998065;麻,-9.21852991666;資,-8.64164254221;诉,-6.21853843374;獎,-7.40864306283;托,-9.51437529975;篩,-9.03012931379;奪,-12.2389548028;惯,-11.3226640709;審,-6.34731059097;輔,-6.57425971685;毀,-11.5458076222;和,-7.62136209681;瀏,-10.5342067106;折,-8.26866288925;減,-5.97033211607;蠟,-9.88757954564;鈣,-12.5266368753;买,-9.04028168525;液,-8.15297849025;匹,-9.75404815301;汇,-7.04322402503;歉,-9.91167709722;偏,-10.5342067106;浏,-10.5342067106;著,-11.6793390149;拘,-11.4280245866;賜,-10.3671526259;睡,-9.42055654453;因,-12.2389548028;入,-9.33478972277;擬,-13.6252491639;聯,-7.59456390366;揮,-12.9321019834;仰,-11.1403425141;極,-8.42675213265;勸,-8.27339103044;出,-4.68632389193;顿,-12.5266368753;掃,-9.58219789609;肅,-9.65495725037;熏,-8.76543675956;斗,-5.38618383215;供,-5.12968827263;带,-11.5458076222;來,-12.9321019834;播,-10.5342067106;估,-12.5266368753;喷,-9.25580131145;杀,-8.6485154215;埋,-11.2273538911;减,-5.97033211607;绑,-12.2389548028;奔,-10.9861918343;进,-4.3314871838;聚,-9.05053818542;坠,-13.6252491639;口,-8.10378824606;呢,-13.6252491639;照,-10.0143312513;巧,-12.5266368753;敬,-10.1595132611;轰,-10.0988886393;陶,-12.2389548028;翻,-10.3671526259;遺,-6.34938456337;看,-9.21852991666;殡,-12.2389548028;紧,-7.00251283997;约,-6.09423283184;搭,-10.3294122979;簽,-10.6808101848;间,-12.9321019834;诈,-8.63481657714;委,-8.36255897501;敗,-12.2389548028;潛,-9.36256928688;透,-10.3671526259;健,-8.24535181038;侦,-10.0988886393;長,-12.0158112515;零,-6.26578152566;特,-9.75404815301;彻,-12.0158112515;要,-11.8334896947;辅,-6.57425971685;嘔,-10.2240517823;会,-8.08398561876;焦,-9.6934235312;被,-8.47775468711;训,-5.91638956287;贮,-9.63626511736;邻,-12.2389548028;强,-6.9074444689;见,-13.6252491639;磋,-8.2592731489;经,-4.71587875872;遐,-10.9861918343;周,-7.6850779112;滯,-11.6793390149;浮,-7.79043842686;调,-3.54688436148;验,-7.76731600944;隔,-7.46615377543;視,-13.6252491639;颠,-9.54771172001;甩,-13.6252491639;咨,-6.08995246148;脱,-8.48945072687;暴,-8.46619386471;騷,-10.1912619594;检,-4.94798002466;臆,-12.2389548028;兑,-11.0602998065;剧,-10.734877406;更,-9.14791234944;訂,-8.53765282869;導,-9.06090097245;間,-12.9321019834;划,-12.0158112515;沙,-11.6793390149;用,-7.42069140135;辯,-8.31204318488;戲,-12.9321019834;裁,-8.28291491195;跃,-12.9321019834;忏,-10.9861918343;雕,-13.6252491639;毗,-12.2389548028;陪,-9.88757954564;慰,-11.3226640709;击,-10.8526604417;清,-6.97367729033;指,-5.79283823673;肆,-12.2389548028;完,-12.2389548028;愛,-9.32118407072;期,-10.2579533339;撞,-10.0417302255;群,-11.1403425141;吩,-9.45086189402;設,-4.67044641107;輯,-13.6252491639;纺,-10.7920358199;爽,-10.9171989628;觀,-6.3584218164;奋,-12.9321019834;蛊,-11.6793390149;積,-9.23080000925;富,-9.54771172001;滚,-10.3671526259;束,-8.53149896311;卧,-12.5266368753;烦,-12.0158112515;詭,-12.9321019834;诬,-11.0602998065;趨,-11.8334896947;养,-6.41738929249;建,-4.20659465488;剽,-13.6252491639;超,-10.4471953336;肇,-9.03012931379;抛,-9.26854033723;怜,-10.5807267262;审,-6.34731059097;貯,-9.63626511736;戰,-5.47680349768;徹,-12.0158112515;常,-8.27339103044;值,-8.01944709762;毁,-11.5458076222;立,-6.45589914725;塌,-12.2389548028;发,-2.75049039118;乘,-11.8334896947;招,-7.05717125251;绣,-13.6252491639;奢,-10.7920358199;工,-3.54282076275;烧,-9.67400544534;器,-11.4280245866;轮,-9.01012864708;扰,-8.14878561199;磷,-9.88757954564;函,-10.7920358199;有,-4.27924218052;复,-7.12395949338;小,-11.3226640709;美,-8.66942210632;冒,-9.96168751779;殖,-8.42675213265;饮,-11.1403425141;縣,-11.6793390149;通,-5.33270064994;隨,-10.0143312513;弹,-9.02007897793;刻,-10.9861918343;炼,-7.75878110699;观,-6.3584218164;浅,-11.6793390149;泄,-10.4063733391;燒,-9.67400544534;街,-11.4280245866;余,-12.9321019834;付,-11.3226640709;胜,-5.60959154936;革,-4.62094943536;修,-7.83835178255;懲,-8.78106207746;擴,-8.46619386471;煽,-12.2389548028;謀,-11.6793390149;较,-10.3294122979;倒,-10.9171989628;优,-5.705529403;在,-7.30628105017;娶,-9.36256928688;玻,-13.6252491639;促,-7.62383428596;资,-8.64164254221;換,-8.62130285797;聲,-11.4280245866;整,-6.30273872992;編,-10.5342067106;都,-10.4471953336;兼,-10.5342067106;較,-10.3294122979;砍,-11.4280245866;炒,-9.48211443753;思,-9.58219789609;育,-8.53765282869;医,-8.93390128169;诀,-13.6252491639;裂,-9.75404815301;拆,-9.58219789609;晉,-11.5458076222;擊,-10.8526604417;呕,-10.2240517823;量,-11.5458076222;論,-6.90986577759;还,-9.93636970981;履,-10.489754948;內,-9.45086189402;祷,-11.8334896947;競,-5.21564118318;幹,-8.83775742114;长,-12.0158112515;图,-11.4280245866;漂,-11.6793390149;希,-11.1403425141;園,-13.6252491639;贖,-7.41665913782;測,-5.36501487231;康,-9.96168751779;钻,-10.7920358199;應,-4.91495934254;忍,-13.6252491639;呐,-10.2930446537;拟,-13.6252491639;巡,-8.51326137556;屠,-7.90493738731;罢,-10.734877406;迭,-10.4471953336;旱,-9.40574145874;想,-11.1403425141;發,-2.75049039118;尋,-10.734877406;續,-9.26854033723;渗,-12.5266368753;朝,-11.5458076222;紡,-10.7920358199;鬥,-5.38618383215;骤,-10.1912619594;储,-5.64146809494;光,-9.42055654453;耳,-9.13661279419;夹,-11.1403425141;流,-4.52639916798;賀,-9.21852991666;迂,-10.3671526259;兩,-11.8334896947;部,-13.6252491639;剿,-12.5266368753;刪,-12.2389548028;殯,-12.2389548028;雜,-8.03426218341;抵,-6.24874103759;夸,-12.9321019834;國,-5.5388388886;县,-11.6793390149;倾,-10.6295168904;蹂,-10.7920358199;摆,-11.4280245866;動,-10.1912619594;協,-7.73914513247;全,-8.04175285514;淫,-12.0158112515;剪,-8.3319443392;转,-6.26514519093;误,-10.0417302255;数,-8.63481657714;空,-9.33478972277;国,-5.5388388886;後,-6.92574882376;向,-12.5266368753;簡,-12.5266368753;綠,-7.91813889917;红,-12.2389548028;贫,-7.97980226628;中,-7.89840141633;新,-8.56265413089;強,-6.9074444689;锻,-12.9321019834;匿,-11.1403425141;傾,-10.6295168904;评,-5.6975641183;忌,-10.489754948;风,-10.734877406;鑑,-6.87297878778;损,-8.89786134521;締,-13.6252491639;廢,-9.67400544534;適,-12.2389548028;度,-10.0143312513;廓,-12.9321019834;援,-6.60505845561;罷,-10.734877406;白,-13.6252491639;一,-6.98276236255;阐,-12.5266368753;記,-9.63626511736;搜,-7.80813800396;御,-12.2389548028;索,-11.4280245866;玩,-12.9321019834;享,-11.0602998065;吆,-12.2389548028;容,-11.8334896947;示,-7.38692453888;吼,-12.9321019834;馴,-11.2273538911;迁,-9.29451582363;擇,-10.9171989628;籌,-10.1595132611;限,-9.09264967077;武,-11.5458076222;对,-5.42386320868;電,-6.54186131629;呼,-9.28144374207;企,-11.6793390149;涂,-13.6252491639;按,-8.43786335808;隐,-11.4280245866;閒,-12.5266368753;誘,-7.71988731587;攝,-12.9321019834;纠,-11.8334896947;颤,-12.2389548028;垦,-8.54384479894;动,-10.1912619594;购,-7.03494811572;責,-10.0988886393;议,-9.6934235312;阻,-8.89786134521;摇,-11.1403425141;捉,-11.4280245866;懊,-9.43559442189;盐,-10.7920358199;虛,-9.93636970981;東,-9.73342886581;艳,-12.2389548028;筹,-10.1595132611;登,-7.83835178255;偿,-10.3671526259;現,-6.25564844339;躁,-11.6793390149;截,-9.5309046017;文,-12.5266368753;抉,-9.45086189402;讯,-12.9321019834;世,-7.5897677314;舞,-9.19443236508;宣,-5.97698613302;喧,-9.42055654453;助,-7.88867686644;贬,-10.2579533339;防,-5.72276172676;帶,-11.5458076222;瞻,-13.6252491639;求,-9.04028168525;装,-8.15718902278;拉,-12.5266368753;嵌,-12.2389548028;监,-4.49742121352;坐,-10.6808101848;識,-10.3294122979;獨,-8.0879148969;濫,-13.6252491639;賭,-11.4280245866;漚,-11.4280245866;并,-8.21360311206;學,-11.6793390149;顺,-11.4280245866;啼,-10.6808101848;舉,-11.0602998065;授,-9.59989747318;對,-5.42386320868;咒,-10.7920358199;瀕,-9.81858667415;熔,-11.6793390149;洗,-9.98766300419;準,-9.23080000925;標,-7.93827380758;殘,-9.10346058687;感,-8.28291491195;砥,-10.9171989628;利,-13.6252491639;漫,-8.78896725697;羞,-12.0158112515;淋,-9.81858667415;激,-10.1912619594;规,-8.53149896311;惊,-10.2579533339;違,-5.81530207744;他,-9.25580131145;诘,-12.5266368753;繡,-13.6252491639;季,-12.5266368753;物,-10.9861918343;淬,-9.06090097245;諮,-6.08995246148;致,-8.58829656151;延,-11.8334896947;命,-12.0158112515;酿,-7.19230907118;退,-8.12399095338;專,-6.51782368981;舌,-13.6252491639;羅,-12.9321019834;废,-9.67400544534;驚,-10.2579533339;輪,-9.01012864708;厭,-9.91167709722;爬,-12.9321019834;售,-9.67400544534;禱,-11.8334896947;徵,-7.44523251027;机,-7.79630354631;讽,-8.51326137556;附,-7.08421916473;痙,-8.09185967519;飛,-7.44938189381;统,-4.86951162461;换,-8.62130285797;查,-10.2579533339;拷,-10.9861918343;慶,-11.3226640709;诽,-13.6252491639;仿,-10.0417302255;昏,-9.19443236508;輕,-9.48211443753;五,-10.6295168904;列,-8.14878561199;错,-10.2930446537;探,-7.14673952171;洩,-10.4063733391;貨,-9.46636608056;失,-6.40560712379;碰,-7.95882247581;憶,-11.0602998065;改,-4.36630912211;蒸,-10.2579533339;参,-8.37822509176;配,-5.83042601174;拌,-11.1403425141;毒,-12.5266368753;留,-9.91167709722;顛,-9.54771172001;孝,-12.0158112515;来,-12.9321019834;触,-11.5458076222;浩,-11.6793390149;注,-12.9321019834;火,-12.9321019834;独,-8.0879148969;问,-8.2592731489;饱,-8.78106207746;声,-11.4280245866;维,-7.00384351216;艷,-12.2389548028;儀,-12.9321019834;堆,-8.86307522912;粉,-12.9321019834;演,-6.94188821815;钙,-12.5266368753;販,-10.1912619594;质,-10.1912619594;醫,-8.93390128169;个,-10.5807267262;选,-9.02007897793;缴,-11.1403425141;获,-8.05690466016;便,-9.73342886581;佔,-11.3226640709;受,-9.1143896574;属,-12.0158112515;胡,-11.8334896947;缺,-8.79693542662;矯,-9.86404904823;數,-8.63481657714;智,-11.5458076222;送,-10.1912619594;駁,-10.7920358199;跪,-12.9321019834;阅,-8.187169855;领,-6.38173618925;掌,-9.71322615849;喘,-10.1912619594;膠,-11.1403425141;抢,-13.6252491639;春,-10.5342067106;谩,-12.2389548028;涨,-9.88757954564;爭,-6.09155545407;繳,-11.1403425141;報,-7.21507428195;釀,-7.19230907118;狂,-10.9861918343;遷,-9.29451582363;浓,-10.4063733391;返,-12.0158112515;南,-7.54990313283;囚,-12.0158112515;散,-9.91167709722;歧,-10.4063733391;跨,-7.49619895386;仪,-12.9321019834;召,-10.2579533339;称,-12.2389548028;胶,-11.1403425141;师,-12.0158112515;祖,-9.14791234944;褒,-12.0158112515;气,-10.9861918343;化,-9.54771172001;採,-5.97555654021;辩,-8.31204318488;劫,-10.2240517823;貿,-4.59284000044;病,-9.77510156221;鑄,-10.0417302255;筆,-12.0158112515;拋,-9.26854033723;职,-10.6808101848;詐,-8.63481657714;仓,-9.29451582363;卖,-9.79660776743;糟,-13.6252491639;日,-12.9321019834;警,-7.15755043782;燭,-13.6252491639;缉,-11.6793390149;搏,-10.3671526259;专,-6.51782368981;娛,-6.91350876886;墜,-13.6252491639;從,-9.46636608056;挡,-12.0158112515;撤,-8.92476879813;催,-8.71259427818;启,-7.50275635441;畅,-12.0158112515;哄,-9.29451582363;密,-9.98766300419;緊,-7.00251283997;背,-10.2240517823;角,-11.3226640709;遗,-6.34938456337;取,-8.84612567081;静,-9.30776105038;盘,-9.12543949359;祝,-8.43229231303;淪,-12.0158112515;平,-8.23162161757;鳴,-10.1287416025;職,-10.6808101848;适,-12.2389548028;甄,-13.6252491639;尊,-11.3226640709;明,-9.23080000925;输,-7.95192589675;團,-12.5266368753;夜,-12.5266368753;亩,-9.59989747318;嘮,-11.2273538911;举,-11.0602998065;區,-10.1912619594;彈,-9.02007897793;藏,-11.8334896947;法,-10.4471953336;赔,-12.5266368753;剖,-10.4471953336;繞,-12.2389548028;試,-5.64146809494;叫,-10.5807267262;热,-9.02007897793;公,-7.94166939658;懷,-10.0988886393;扶,-8.98085826478;刁,-12.9321019834;鋪,-9.91167709722;备,-8.32693179737;羈,-10.9171989628;掠,-10.9171989628;营,-5.41458113276;辨,-10.489754948;冬,-12.0158112515;娱,-6.91350876886;創,-5.41702978042;栽,-6.61855393708;贿,-12.5266368753;奇,-12.5266368753;糊,-13.6252491639;谣,-12.5266368753;体,-7.48752210983;殺,-8.6485154215;筛,-9.03012931379;點,-12.2389548028;質,-10.1912619594;目,-13.6252491639;驱,-7.24343314651;飲,-11.1403425141;練,-10.734877406;死,-10.734877406;擺,-11.4280245866;滾,-10.3671526259;征,-7.44523251027;融,-5.00802965844;写,-9.71322615849;斡,-10.9171989628;接,-8.38880720109;产,-6.64796782229;鞭,-11.6793390149;犯,-6.05893814915;收,-6.45666926666;治,-9.30776105038;調,-3.54688436148;织,-10.2579533339;擋,-12.0158112515;跑,-12.5266368753;豐,-11.0602998065;试,-5.64146809494;盗,-8.6485154215;博,-8.56900335857;耻,-12.0158112515;神,-10.9861918343;赦,-13.6252491639;表,-5.98801477513;歪,-12.9321019834;短,-12.5266368753;追,-10.1595132611;逃,-12.9321019834;包,-7.37914239844;服,-4.54946928534;戏,-12.9321019834;酬,-12.0158112515;嘗,-8.76543675956;鄙,-11.6793390149;缝,-13.6252491639;挥,-12.9321019834;护,-8.31204318488;润,-8.69799547876;含,-8.93390128169;悸,-11.0602998065;欠,-12.2389548028;哀,-10.3671526259;奉,-10.5807267262;濒,-9.81858667415;烘,-12.9321019834;驟,-10.1912619594;擠,-9.61791597869;飽,-8.78106207746;統,-4.86951162461;孵,-10.5807267262;腹,-11.6793390149;胸,-10.9861918343;载,-8.98085826478;销,-4.57778072492;優,-5.705529403;錄,-10.7920358199;備,-8.32693179737;报,-7.21507428195;挤,-9.61791597869;侧,-9.54771172001;訪,-9.01012864708;細,-9.51437529975;搶,-13.6252491639;访,-9.01012864708;品,-10.9861918343;描,-12.5266368753;賑,-10.2579533339;赐,-10.3671526259;蹒,-13.6252491639;绝,-9.77510156221;察,-12.9321019834;夺,-12.2389548028;拥,-10.9171989628;牧,-11.5458076222;园,-13.6252491639;鼓,-11.4280245866;可,-8.10378824606;遮,-11.1403425141;干,-8.83775742114;添,-10.1287416025;顫,-12.2389548028;馈,-10.2930446537;民,-10.734877406;互,-10.4063733391;候,-12.2389548028;增,-8.62803689016;暢,-12.0158112515;沦,-12.0158112515;榨,-11.8334896947;說,-10.4471953336;匯,-7.04322402503;炮,-11.6793390149;就,-11.5458076222;活,-4.03798034198;围,-9.96168751779;竊,-12.9321019834;評,-5.6975641183;比,-5.8382821613;遙,-8.3319443392;飞,-7.44938189381;无,-8.93390128169;慣,-11.3226640709;懸,-12.9321019834;劃,-12.0158112515;内,-9.45086189402;安,-10.6295168904;養,-6.41738929249;萌,-12.9321019834;辑,-13.6252491639;踐,-12.5266368753;圖,-11.4280245866;焚,-13.6252491639;稱,-12.2389548028;貧,-7.97980226628;让,-9.3485830449;逆,-10.4063733391;听,-10.6808101848;破,-9.08195438165;謾,-12.2389548028;勃,-8.46619386471;镂,-10.5342067106;築,-9.79660776743;近,-11.2273538911;叙,-9.46636608056;緝,-11.6793390149;食,-13.6252491639;臥,-12.5266368753;闭,-10.5807267262;翱,-11.5458076222;戒,-10.8526604417;任,-9.81858667415;省,-11.0602998065;喂,-10.0988886393;還,-9.93636970981;嬉,-12.9321019834;妊,-9.96168751779;休,-7.91151635841;訓,-5.91638956287;实,-5.41295202569;蜡,-9.88757954564;氧,-10.2579533339;辦,-7.01859897772;親,-13.6252491639;咬,-10.2579533339;厮,-11.2273538911;餵,-10.0988886393;架,-9.24322252925;主,-6.12195953324;洽,-11.8334896947;貼,-7.89514938095;设,-4.67044641107;剃,-8.87165897281;充,-11.4280245866;忆,-11.0602998065;等,-9.08195438165;晋,-11.5458076222;勘,-7.14981644722;糜,-12.2389548028;扣,-12.0158112515;影,-3.4840053477;驳,-10.7920358199;已,-10.8526604417;懺,-10.9861918343;購,-7.03494811572;需,-10.7920358199;伐,-11.6793390149;讓,-9.3485830449;签,-10.6808101848;掣,-12.9321019834;肥,-10.3294122979;愤,-9.51437529975;並,-8.21360311206;株,-10.2240517823;刮,-10.5807267262;斷,-9.91167709722;鎮,-8.7732189;着,-11.6793390149;參,-8.37822509176;操,-13.6252491639;扎,-9.19443236508;滑,-8.1828314534;佐,-10.9171989628;矫,-9.86404904823;哭,-10.8526604417;罰,-13.6252491639;奴,-10.0699011024;賽,-11.2273538911;熄,-12.2389548028;庆,-11.3226640709;守,-10.734877406;損,-8.89786134521;意,-8.85456453945;沒,-11.4280245866;厘,-9.96168751779;尝,-8.76543675956;綜,-5.01602388706;急,-9.23080000925;憤,-9.51437529975;货,-9.46636608056;诰,-10.734877406;讨,-9.98766300419;堵,-12.5266368753;速,-9.67400544534;船,-9.21852991666;涼,-12.9321019834;细,-9.51437529975;运,-4.25058149852;牙,-10.2579533339;变,-3.81201460036;竞,-5.21564118318;铺,-9.91167709722;恥,-12.0158112515;饋,-10.2930446537;敷,-12.5266368753;批,-7.06421849802;轻,-9.48211443753;縫,-13.6252491639;禁,-9.08195438165;待,-9.54771172001;劇,-10.734877406;閉,-10.5807267262;合,-4.76930062987;亏,-5.96231131346;耐,-11.8334896947;外,-8.34713450469;欢,-10.9171989628;两,-11.8334896947;未,-10.0699011024;熱,-9.02007897793;永,-13.6252491639;伺,-9.46636608056;放,-8.42124247684;私,-8.04175285514;必,-8.91571896261;痉,-8.09185967519;赎,-7.41665913782;荒,-12.2389548028;奖,-7.40864306283;烛,-13.6252491639;罚,-13.6252491639;賣,-9.79660776743;止,-8.99052017569;早,-12.2389548028;獲,-8.05690466016;噴,-9.25580131145;諷,-8.51326137556;扼,-12.5266368753;替,-10.4471953336;切,-8.78106207746;针,-13.6252491639;踏,-10.5807267262;排,-7.38692453888;首,-8.56900335857;粘,-9.36256928688;氣,-10.9861918343;订,-8.53765282869;交,-5.47825046653;枪,-9.46636608056;草,-9.39114265932;嚴,-13.6252491639;总,-12.9321019834;押,-13.6252491639;组,-11.8334896947;准,-9.23080000925;插,-10.5342067106;驗,-7.76731600944;执,-6.42706558682;填,-12.0158112515;差,-9.88757954564;共,-9.43559442189;直,-8.5563449617;拼,-10.8526604417;颁,-8.79693542662;缄,-12.9321019834;瀆,-10.3671526259;見,-13.6252491639;認,-6.59616159977;舒,-8.78896725697;算,-11.5458076222;军,-11.0602998065;劝,-8.27339103044;猜,-7.26567529525;吞,-8.99052017569;伤,-7.21179020675;控,-7.29019491242;耦,-8.53765282869;鄰,-12.2389548028;油,-12.2389548028;贸,-4.59284000044;抽,-9.54771172001;磁,-10.3294122979;構,-8.40489333884;扒,-13.6252491639;漏,-10.9861918343;勝,-5.60959154936;滥,-13.6252491639;潤,-8.69799547876;僱,-9.24322252925;割,-9.86404904823;请,-10.4471953336;浸,-10.6295168904;社,-6.60863948003;伏,-12.5266368753;憐,-10.5807267262;抒,-9.45086189402;嬗,-12.2389548028;初,-9.19443236508;土,-12.5266368753;校,-10.0988886393;责,-10.0988886393;檢,-4.94798002466;严,-13.6252491639;週,-7.6850779112;申,-10.0143312513;阵,-10.0988886393;人,-9.30776105038;繅,-12.0158112515;升,-6.24624103629;住,-11.8334896947;處,-6.6611135515;緘,-12.9321019834;剝,-10.9861918343;捧,-11.8334896947;摩,-7.573159995;寬,-9.63626511736;避,-9.06090097245;護,-8.31204318488;擾,-8.14878561199;稀,-10.4063733391;射,-6.38102164832;成,-7.28136872979;计,-7.94166939658;违,-5.81530207744;攪,-12.0158112515;到,-6.44289705203;儲,-5.64146809494;游,-6.53934769955;贺,-9.21852991666;练,-10.734877406;請,-10.4471953336;槍,-9.46636608056;行,-5.09435032545;摔,-11.2273538911;策,-8.43229231303;凝,-12.2389548028;停,-9.5309046017;非,-9.33478972277;诡,-12.9321019834;代,-6.38030761758;硬,-10.8526604417;置,-9.93636970981;布,-11.1403425141;紅,-12.2389548028;霉,-12.5266368753;喊,-10.3294122979;植,-11.5458076222;挑,-6.21550720984;易,-10.8526604417;创,-5.41702978042;吟,-12.2389548028;败,-12.2389548028;沤,-11.4280245866;性,-8.5563449617;微,-6.41443071045;冲,-5.3409973663;电,-6.54186131629;悼,-11.4280245866;假,-8.81306480855;传,-5.46931282595;迎,-8.51326137556;擔,-6.32275274019;塗,-13.6252491639;绘,-11.8334896947;歡,-10.9171989628;蹣,-13.6252491639;祭,-11.1403425141;屯,-11.8334896947;淺,-11.6793390149;突,-5.19122021376;約,-6.09423283184;分,-3.78422229273;圈,-9.67400544534;残,-9.10346058687;吊,-11.2273538911;渎,-10.3671526259;抑,-10.9171989628;怒,-11.8334896947;攔,-12.9321019834;謠,-12.5266368753;帮,-11.8334896947;進,-4.3314871838;伸,-11.2273538911;心,-10.2930446537;組,-11.8334896947;采,-5.97555654021;遵,-13.6252491639;告,-12.0158112515;染,-10.5342067106;给,-10.734877406;叛,-9.96168751779;寫,-9.71322615849;印,-7.43493375807;決,-8.24075410113;威,-6.06412757439;简,-12.5266368753;嘉,-10.2930446537;猛,-10.734877406;生,-2.99310250982;模,-10.5342067106;累,-8.98085826478;爱,-9.32118407072;现,-6.25564844339;吵,-10.8526604417;政,-11.4280245866;節,-7.34860567458;居,-9.10346058687;兇,-12.9321019834;衍,-7.38887957372;赏,-10.9861918343;从,-9.46636608056;提,-7.60909200422;套,-10.5807267262;嫖,-11.6793390149;鍛,-12.9321019834;啟,-7.50275635441;回,-6.2149020661;囑,-9.6934235312;拦,-12.9321019834;牽,-8.14878561199;呵,-9.14791234944;痴,-11.4280245866;聽,-10.6808101848;綁,-12.2389548028;异,-10.6295168904;領,-6.38173618925;功,-10.3294122979;讥,-10.489754948;怨,-10.4471953336;閱,-8.187169855;傳,-5.46931282595;核,-7.77881038886;欺,-8.43229231303;雇,-9.24322252925;商,-8.5563449617;凉,-12.9321019834;半,-13.6252491639;募,-9.73342886581;淡,-13.6252491639;敦,-12.2389548028;奮,-12.9321019834;鉴,-6.87297878778;迫,-11.0602998065;谋,-11.6793390149;蔑,-11.8334896947;定,-5.59809905709;負,-7.14981644722;誤,-10.0417302255;措,-9.63626511736;唱,-12.2389548028;郵,-10.8526604417;论,-6.90986577759;房,-12.2389548028;管,-3.8261781283;煉,-7.75878110699;救,-6.37390418055;捕,-10.3294122979;拔,-11.0602998065;飘,-10.3294122979;盜,-8.6485154215;赡,-11.6793390149;賠,-12.5266368753;虧,-5.96231131346;惨,-11.4280245866;驯,-11.2273538911;獵,-12.5266368753;裸,-12.9321019834;承,-7.64383495267;理,-9.98766300419;趋,-11.8334896947;躍,-12.9321019834;投,-3.05208778701;得,-13.6252491639;尖,-12.5266368753;餘,-12.9321019834;原,-9.09264967077;没,-11.4280245866;誥,-10.734877406;航,-8.46046319;田,-13.6252491639;决,-8.24075410113;嘲,-10.4063733391;診,-10.0143312513;跋,-11.6793390149;軍,-11.0602998065;痛,-12.0158112515;婚,-9.05053818542;靜,-9.30776105038;遞,-9.33478972277;赠,-12.9321019834;解,-7.70904710131;惩,-8.78106207746;慨,-12.2389548028;续,-9.26854033723;逼,-11.1403425141;異,-10.6295168904;迷,-11.5458076222;封,-8.82945861832;震,-6.40853967721;倉,-9.29451582363;不,-8.48358560742;戕,-11.6793390149;骚,-10.1912619594;认,-6.59616159977;貶,-10.2579533339;根,-12.9321019834;攻,-7.34860567458;驅,-7.24343314651;寄,-8.15297849025;均,-10.2930446537;测,-5.36501487231;譏,-10.489754948;罗,-12.9321019834;污,-6.18041589003;恩,-9.18259790743;臨,-6.75312106258;关,-6.62309320952;盲,-12.2389548028;牵,-8.14878561199;觸,-11.5458076222;羁,-10.9171989628;窃,-12.9321019834;焊,-10.9861918343;抓,-13.6252491639;编,-10.5342067106;多,-7.47251646922;喝,-9.19443236508;苛,-12.9321019834;誣,-11.0602998065;掩,-8.71259427818;針,-13.6252491639;維,-7.00384351216;劳,-4.51993602981;買,-9.04028168525;讹,-12.2389548028;施,-6.34180093516;肿,-11.5458076222;滋,-10.8526604417;廣,-6.71949588761;联,-7.59456390366;信,-7.96576694816;屬,-12.0158112515;疼,-13.6252491639;側,-9.54771172001;预,-4.10566094158;劈,-12.9321019834;下,-8.32693179737;贍,-11.6793390149;悔,-12.0158112515;潮,-11.4280245866;借,-8.62130285797;訣,-13.6252491639;師,-12.0158112515;覺,-10.0417302255;飄,-10.3294122979;释,-9.65495725037;村,-11.1403425141;打,-8.25461113579;高,-10.5807267262;畝,-9.59989747318;摧,-10.4063733391;幫,-11.8334896947;自,-5.84913368682;闲,-12.5266368753;兵,-12.2389548028;开,-7.19230907118;处,-6.6611135515;例,-9.03012931379;規,-8.53149896311;討,-9.98766300419;漠,-12.9321019834;斧,-12.5266368753;隱,-11.4280245866;地,-13.6252491639;誹,-13.6252491639;疊,-10.4063733391;磅,-11.6793390149;遊,-6.53934769955;赌,-11.4280245866;鸣,-10.1287416025;存,-7.38108226326;營,-5.41458113276;择,-10.9171989628;快,-9.56480615337;积,-9.23080000925;剩,-8.31204318488;僵,-10.734877406;混,-6.16360877171;歸,-7.00384351216;往,-6.6850266948;妄,-10.9861918343;隆,-10.3671526259;耕,-7.4703910699;官,-12.5266368753;喜,-12.5266368753;償,-10.3671526259;办,-7.01859897772;推,-7.46193435989;缫,-12.0158112515;嘱,-9.6934235312;偵,-10.0988886393;落,-9.17090186767;繁,-11.2273538911;海,-7.91482214654;镇,-8.7732189;集,-7.58499445264;跌,-12.0158112515;關,-6.62309320952;勞,-4.51993602981;正,-8.09185967519;波,-5.49932236121;补,-5.98512599122;扩,-8.46619386471;鑽,-10.7920358199;灵,-12.5266368753;起,-7.11946510379;
+B,vq:去,-0.348742329213;出,-1.2227306814;
+B,v:涉,-6.93765750452;谈,-7.51983879756;伊,-10.5724584455;預,-5.47472596059;亟,-10.4079090585;洞,-10.0763751035;礦,-11.2415080745;河,-11.6469731826;临,-7.21163148917;吸,-6.44966075168;類,-7.35781922468;捂,-10.1697070433;談,-7.51983879756;反,-5.36346110554;姑,-10.8520433077;筒,-14.6914956203;織,-9.102376054;拗,-11.9189068981;赞,-7.64267490107;遠,-7.80649732847;知,-5.2375426252;除,-7.96586191814;緩,-7.62374960504;彪,-13.4387326518;扬,-9.05849332774;闹,-8.88035462736;覆,-7.91898749076;颐,-12.6120540787;缕,-15.3846428009;应,-5.56475427223;謝,-8.19396676656;丟,-8.52502789724;禦,-9.66433102429;崩,-8.57009990363;是,-5.91935018109;讲,-7.53259259363;冶,-9.15023207517;運,-6.77505276021;鍍,-10.7895229508;契,-11.0151949484;录,-8.58447273259;教,-8.59792585029;叢,-10.1271474289;囤,-10.278697327;姦,-10.2488443638;滴,-10.1376187287;须,-10.5094454777;广,-9.44447154817;斃,-10.7402519018;沉,-7.05667494259;贈,-9.3047096058;上,-4.3285915346;后,-7.98524471756;經,-7.1890332336;蒙,-9.38075573379;攘,-12.8196934434;辟,-10.6224688661;岩,-13.9983484398;枯,-9.55276032361;伴,-7.65754831611;玷,-11.210255531;离,-6.3842829937;鬼,-11.8011238624;尾,-10.4501688678;胁,-10.4501688678;框,-12.8997361511;凋,-10.6572549822;湊,-9.32318588196;罔,-13.5928833317;虚,-8.82078727436;譜,-11.2902982387;濟,-10.7118139664;盥,-13.1874182236;裱,-11.7210811548;跳,-7.92127975537;潴,-11.2902982387;号,-8.25294429043;畸,-13.9983484398;节,-7.26286538173;躊,-9.82012239357;厌,-8.92317462454;紓,-12.8196934434;媒,-15.3846428009;悖,-13.1874182236;訝,-13.0820577079;輟,-10.9419915444;倡,-8.75132436761;鬧,-8.88035462736;纪,-8.46991190817;龜,-11.4928225028;課,-11.8011238624;稽,-10.153534184;蕃,-13.5928833317;拂,-11.1505362963;克,-8.34060990362;前,-6.63776748132;坏,-10.0001477381;塑,-8.9994484019;賞,-9.0285351402;几,-15.3846428009;巨,-12.2065889705;腫,-9.57350180792;卷,-9.1881986731;糾,-8.3190294373;丈,-10.9658021931;贊,-7.64267490107;较,-9.67421578352;錯,-9.36848564119;挖,-8.28709395028;符,-7.26583980391;披,-7.0460979209;涵,-9.51534588776;谴,-9.25341631141;鼾,-13.4387326518;所,-6.90307678712;摄,-8.1577067824;凍,-8.23865833318;灌,-9.2512447579;廓,-12.0173469709;櫛,-12.494271043;監,-8.41579242255;学,-6.80110022893;翩,-14.2860305122;臭,-11.2902982387;诱,-8.60358517496;递,-8.0794545855;践,-9.98196541902;培,-7.37494744315;持,-6.12952028614;标,-8.73565825087;予,-8.07275663682;越,-9.01474181806;笑,-9.1760527748;妒,-11.0805777077;岔,-10.8413480186;耗,-8.39715255389;訛,-12.0173469709;匡,-11.8011238624;誰,-8.46991190817;覲,-10.9187346822;貴,-11.210255531;隸,-8.74869624521;懂,-8.36534614718;擄,-10.5248303965;毆,-10.4217981706;轉,-5.18245905464;免,-7.1057067986;補,-6.91517034569;连,-7.36141811618;略,-8.27394667791;實,-5.07402486093;關,-5.79408675506;乳,-10.7306824507;偷,-8.76190647694;相,-4.83182934735;驻,-8.28132073837;好,-6.48055588695;疏,-8.37072732608;頒,-7.81008431669;或,-11.8881352394;务,-9.33255363197;鞣,-12.3889105273;簪,-12.8196934434;蠲,-12.1265462629;贴,-8.46991190817;制,-5.5759055849;霸,-10.1806361138;飞,-7.07128084976;綿,-9.82396116988;友,-11.6234426852;乞,-10.0140047728;狡,-13.7752048885;占,-6.43696673839;普,-8.802617662;諱,-11.51344179;浴,-12.0173469709;寻,-6.88683632328;飽,-9.04076236677;會,-7.46020861601;搅,-9.37582961545;誆,-12.3401203632;侈,-13.5928833317;册,-10.2371483241;嚎,-10.8307659093;缓,-7.62374960504;抖,-9.63524981498;講,-7.53259259363;负,-6.89811502379;大,-6.48942421713;羨,-9.45771677492;挫,-9.97747102943;支,-5.7276314;记,-6.39295607496;趴,-9.16803669981;揀,-11.7737248882;义,-11.1651350957;泊,-12.2936003475;遍,-8.25294429043;問,-6.70278298792;当,-6.83944541307;展,-6.85809351455;叠,-9.71131953372;督,-8.74085306775;嗤,-13.5928833317;荫,-12.2065889705;話,-12.0888059349;棲,-8.802617662;具,-5.52406274937;顽,-11.1799501815;蜂,-10.219856827;謊,-11.3773096157;弒,-12.3401203632;依,-6.86027540573;座,-11.0941833597;撫,-8.41673359909;枭,-12.3401203632;梳,-9.06928479937;訴,-9.29333291882;逸,-13.1874182236;区,-8.42429507179;羽,-11.1505362963;夾,-8.802617662;杂,-10.3542048795;仇,-10.7306824507;浆,-11.6957633468;觉,-6.14019089929;案,-10.3740075068;煎,-10.4358829105;壓,-7.25753361555;聘,-8.97941434286;泛,-8.68514246073;乜,-12.2936003475;面,-6.31448445952;鉤,-12.3401203632;继,-5.47140295691;秩,-15.3846428009;汰,-13.9983484398;诵,-10.1751566481;雷,-9.7788407346;當,-6.83944541307;凹,-10.121952612;峻,-13.4387326518;忽,-8.25694910155;繼,-5.47140295691;變,-5.83234526206;徒,-10.5724584455;谛,-11.7210811548;輝,-11.4726197955;溜,-10.6484443525;連,-7.36141811618;天,-8.38613315864;農,-10.4217981706;拄,-12.8997361511;淆,-13.4387326518;坍,-10.4010361792;燎,-11.7210811548;習,-9.71131953372;孕,-9.72168232076;機,-9.31390507289;勤,-10.121952612;左,-13.3052012592;飨,-15.3846428009;曬,-10.8628542238;良,-15.3846428009;陷,-7.64702651803;综,-10.4719879152;驿,-10.7499138127;訊,-11.9189068981;搖,-7.41079842495;串,-9.41593524091;吶,-9.55864269351;点,-6.70635168913;綻,-10.4868030009;刺,-6.59940917728;時,-8.90000756526;过,-5.82006044222;結,-5.70906011677;答,-7.11950717096;作,-5.03467616416;卤,-10.8960064312;觳,-13.7752048885;執,-6.42494565393;牺,-8.27803666317;黽,-14.2860305122;搁,-9.99101525454;栉,-12.494271043;誊,-11.6957633468;蜗,-12.8997361511;耙,-13.9983484398;抚,-8.41673359909;別,-8.62538753023;攫,-10.3032384359;昭,-10.4942936727;振,-7.60685017455;亲,-8.23237394486;樵,-13.3052012592;讴,-11.210255531;眷,-10.8520433077;總,-7.59105599752;墾,-10.9073059864;佇,-11.0026161662;降,-6.46425374081;协,-6.99596503171;远,-7.80649732847;团,-9.87931126496;古,-9.70788899862;药,-15.3846428009;滲,-8.30545840628;幽,-10.5248303965;极,-10.3542048795;殉,-9.23831354322;計,-6.55030582688;同,-6.68880145805;战,-7.95988103907;愚,-11.0941833597;劣,-13.7752048885;產,-5.75592109554;冥,-13.1874182236;暫,-8.50425871871;断,-7.52214560366;萬,-13.4387326518;丰,-9.61320167776;食,-8.37976081118;資,-9.47928095284;诉,-9.29333291882;像,-7.80957110139;獎,-9.90400387755;駕,-7.89802948775;篩,-9.64807050341;奪,-7.64789911844;据,-7.4267654424;俱,-10.7118139664;諳,-11.7737248882;叹,-8.52397912944;签,-6.69517838854;蚀,-12.3401203632;肄,-11.3592911102;來,-5.44883327689;瘋,-10.3157385987;和,-9.11934158816;瀏,-10.7695222841;颔,-11.2575084158;折,-7.30906016422;丛,-10.1271474289;殞,-12.2065889705;鈣,-10.9901936462;鬩,-14.6914956203;禪,-11.2415080745;怯,-13.7752048885;漱,-11.0671546874;證,-6.74399380555;偏,-8.05554906465;賜,-10.254744086;诞,-8.49403368075;睡,-7.58407014622;因,-10.8099318224;闢,-10.6224688661;煥,-10.7025115738;擬,-8.70881957926;聯,-5.75644772316;揮,-8.09776638914;轱,-13.1874182236;詳,-9.89570507474;幻,-10.4793680225;顿,-9.74985319772;掃,-8.10739507426;熏,-11.600453167;还,-5.63116451568;供,-7.9070385577;琢,-9.09122352205;播,-8.40178004942;估,-7.13637535345;嘶,-10.8099318224;犹,-8.75527954746;禿,-11.9506555964;杀,-7.03091015863;埋,-7.85577354425;响,-7.96886582548;界,-10.0327846674;减,-5.62542985751;寓,-11.1799501815;聚,-7.35716627003;盡,-8.98106860296;坠,-9.64163961308;呢,-12.3889105273;敬,-8.32588464837;扮,-8.74738476961;潰,-9.16008437162;汲,-10.219856827;嗷,-12.3401203632;了,-6.4500559305;看,-4.71355015688;徐,-14.6914956203;暖,-11.1505362963;掘,-9.07290799174;伛,-13.9983484398;瞠,-12.0888059349;约,-8.54302732442;搭,-8.05227359496;男,-12.6120540787;隶,-8.74869624521;簽,-6.69517838854;釋,-7.78474084168;媾,-10.9419915444;擂,-10.2028592506;狎,-12.7455854713;敗,-8.72791627671;潛,-8.18795623006;穩,-9.10424696193;鯨,-12.165766976;辦,-7.21643987066;拮,-12.0524382907;乱,-8.78069897629;長,-7.63963999738;雾,-12.3889105273;饿,-9.18413362685;箍,-12.8997361511;纏,-9.3092967698;逐,-10.219856827;嘔,-9.07654435938;鎮,-7.73828907845;焦,-11.3592911102;溯,-11.1505362963;贮,-8.63120488229;尸,-10.5404557144;强,-6.41599189752;唾,-11.1651350957;见,-6.56586463186;摈,-11.7210811548;黏,-12.2065889705;凑,-9.32318588196;周,-8.61845108623;语,-11.7470566412;浮,-8.49607034133;恰,-9.97299674904;晴,-12.249148585;叽,-13.3052012592;囿,-13.7752048885;验,-9.08202382515;隔,-8.92787314532;酩,-13.9983484398;弥,-8.32588464837;纤,-11.4333990823;瞪,-11.040837379;朵,-15.3846428009;鲸,-12.165766976;检,-7.58694076538;兑,-8.3105259847;牧,-10.4793680225;铨,-12.7455854713;更,-7.09837334811;訂,-8.33019314276;溅,-12.5514294568;蘊,-8.88485576024;嬌,-11.4528171682;導,-6.30897733224;划,-7.18820598966;栖,-8.802617662;搞,-9.35395754063;麥,-12.0524382907;瀦,-11.2902982387;钩,-12.3401203632;用,-5.89909787798;瘪,-14.6914956203;謬,-13.7752048885;裁,-8.50015614885;跃,-8.73955183139;仅,-8.50941071362;效,-9.02506893222;始,-8.06942441114;忏,-10.7794726149;僑,-10.7794726149;雕,-9.62574102702;毗,-9.68086032624;赘,-12.6120540787;奠,-8.14758377477;緣,-13.7752048885;驢,-13.9983484398;绥,-10.9419915444;陪,-8.75395941525;俯,-8.81797037109;慰,-9.59468263;击,-7.40701770211;響,-7.96886582548;清,-7.63359768292;指,-5.61502955691;肆,-10.5094454777;薈,-10.9419915444;稍,-11.307105357;完,-5.8128588729;謗,-15.3846428009;谙,-11.7737248882;撞,-8.94689115116;頡,-12.6765925998;群,-10.4148295013;吩,-7.76983743618;逡,-12.7455854713;久,-9.17003470247;奋,-8.83070939687;束,-9.57950783198;忤,-12.6120540787;门,-10.2847763731;雪,-11.5560014044;詭,-11.9189068981;佯,-10.5971510581;屹,-11.0539094606;养,-7.88025124173;剽,-12.2936003475;言,-9.21085669699;溃,-9.16008437162;谄,-11.3956587543;枉,-11.51344179;禍,-11.8881352394;頌,-10.6139581764;鼎,-10.7306824507;怜,-9.59162919251;审,-6.54507629723;常,-8.02836292434;值,-7.13167560589;证,-6.74399380555;捆,-9.95529717194;发,-3.9390437396;囓,-12.3401203632;闕,-15.3846428009;乘,-8.41861861379;招,-6.54725194535;赚,-8.73695442733;篡,-9.95969278341;躑,-12.6765925998;绣,-10.341217684;奢,-10.9419915444;層,-15.3846428009;烧,-7.84561574507;器,-10.5404557144;諫,-10.8099318224;潮,-10.9901936462;扰,-9.66433102429;函,-11.8011238624;灼,-11.0151949484;有,-5.32770481364;迭,-11.0279339742;程,-10.6932949187;冒,-8.47090545023;殖,-9.12506133683;伙,-11.0671546874;鸣,-10.0519240076;通,-6.52627416458;氯,-10.4942936727;侮,-9.86318188303;家,-9.89158135755;庸,-13.0820577079;乃,-8.72534888121;泄,-8.74476696707;蝉,-11.2737689367;屏,-9.72516058513;狐,-10.254744086;噓,-14.2860305122;燒,-7.84561574507;诖,-15.3846428009;付,-7.78774836275;扛,-13.1874182236;胜,-9.31159826679;摟,-11.040837379;另,-10.953826002;闪,-7.93689152084;懲,-8.6347116071;擴,-5.83071272453;役,-11.1949880589;绸,-12.9867475281;鑿,-11.0671546874;謀,-8.07208930279;碍,-11.6234426852;綏,-10.9419915444;倒,-7.12002197148;眨,-10.0186667859;踮,-14.6914956203;抱,-8.1389877333;撵,-12.0888059349;娶,-11.0941833597;儼,-10.0423085489;促,-6.48682379138;摊,-10.0233506352;換,-7.68570660108;诫,-13.9983484398;路,-8.69131913262;湮,-10.9187346822;整,-6.71868483621;究,-14.2860305122;都,-10.7499138127;讀,-8.07811140195;砍,-9.60081761856;尥,-13.5928833317;嘩,-10.7596699876;覬,-10.953826002;亮,-8.96791051838;育,-9.11934158816;难,-7.59518823481;毀,-8.58335976642;拆,-7.7757721717;擊,-7.40701770211;呕,-9.07654435938;論,-8.21221822377;俘,-9.79739414249;飢,-13.0820577079;照,-7.19013729113;譫,-14.2860305122;競,-8.11641977973;幹,-6.89523199049;卻,-7.94861498454;偽,-9.27761991315;长,-7.63963999738;希,-6.54304995409;疑,-8.50323149725;吐,-9.50690701911;園,-14.6914956203;芟,-13.3052012592;纷,-10.5563290636;诅,-10.0471047212;蛇,-12.8997361511;臉,-9.69091066209;忍,-7.54906355422;赖,-10.4942936727;虜,-13.1874182236;拟,-8.70881957926;屠,-10.0616328218;形,-5.42861023769;遨,-11.7470566412;蹦,-11.1651350957;俭,-12.4402038217;胳,-14.2860305122;黷,-13.1874182236;發,-3.9390437396;洁,-13.3052012592;铭,-11.1079766819;垒,-12.3401203632;鬥,-9.93360434733;躬,-9.16008437162;縷,-15.3846428009;嚼,-12.8196934434;道,-9.33963748686;单,-10.7118139664;诚,-10.4079090585;絡,-11.8582822763;煩,-11.7210811548;部,-7.91784332587;只,-6.25118347325;擰,-12.7455854713;聳,-9.87525446426;拴,-15.3846428009;呻,-9.71821611278;盼,-9.39819079561;剿,-9.41849606177;沁,-12.8997361511;謄,-11.6957633468;舊,-13.9983484398;唐,-11.8011238624;辗,-9.77517100571;素,-9.08019399847;殯,-11.1219629239;抵,-7.45731844058;夸,-8.58447273259;倾,-7.69481413216;摆,-7.03421282735;動,-7.01108905968;曝,-9.37337562649;聞,-8.368033117;孤,-9.21294220348;全,-10.3542048795;剪,-10.1323693728;误,-8.5778134405;数,-9.74985319772;至,-9.38322792293;祸,-11.8881352394;闻,-8.368033117;空,-8.00688389266;国,-8.86255000272;亂,-8.78069897629;後,-7.98524471756;果,-13.4387326518;綠,-12.6120540787;红,-9.86718990443;霧,-12.3889105273;熨,-11.5560014044;薰,-13.9983484398;画,-10.4868030009;傾,-7.69481413216;豁,-9.76787170323;蝇,-13.0820577079;重,-6.17031040765;鑑,-9.42621810786;敛,-11.1079766819;损,-7.51792051576;廢,-7.9563096067;寤,-14.6914956203;鋪,-8.98106860296;譯,-9.76062529471;腳,-10.219856827;曲,-11.4333990823;援,-9.42621810786;彷,-11.0805777077;陽,-9.87931126496;一,-7.87640402621;撇,-8.98106860296;掉,-9.18413362685;興,-6.69114612501;瞑,-11.4333990823;阐,-8.06809462371;途,-10.4288157433;搜,-7.94156442654;挞,-13.3052012592;御,-9.66433102429;索,-9.21712631;妥,-9.32785878766;咧,-11.1799501815;鎩,-13.9983484398;溫,-11.0805777077;谬,-13.7752048885;夺,-7.64789911844;吼,-10.532612537;迁,-7.70677930021;觅,-10.0567666321;籌,-7.71141967977;毙,-10.7402519018;惟,-9.08385700623;竣,-9.34677188097;坦,-9.35395754063;珩,-13.3052012592;敲,-8.58002828083;对,-6.11612786487;電,-9.79365582038;漁,-14.2860305122;按,-8.56244541027;納,-7.80700896829;隐,-7.84827886249;閒,-8.80400366361;焕,-10.7025115738;謙,-10.8520433077;纠,-8.3190294373;綢,-12.9867475281;夥,-11.0671546874;吧,-13.3052012592;責,-8.46991190817;议,-7.63144853101;戳,-11.5560014044;棄,-11.1799501815;草,-10.3476901985;拈,-11.0026161662;懊,-10.0140047728;坑,-11.4726197955;盐,-11.6234426852;汗,-15.3846428009;艳,-11.6234426852;偿,-8.3943863004;現,-7.15273455733;殃,-11.8582822763;文,-13.0820577079;抉,-9.76062529471;福,-13.4387326518;騎,-8.508378189;攜,-8.2601645384;缠,-9.3092967698;宣,-6.38058886316;喧,-9.53820402584;助,-8.98771314568;贬,-8.14112982623;掳,-10.5248303965;帶,-5.69583472126;瞻,-11.1505362963;求,-7.44548398294;装,-6.9402353792;囑,-8.74476696707;僕,-13.7752048885;識,-8.47989203093;狩,-11.5560014044;迫,-7.88688110027;賭,-8.73565825087;巷,-11.4726197955;逾,-10.0567666321;哽,-9.51817474396;凿,-11.0671546874;咒,-10.9187346822;瀕,-9.4133809611;準,-6.25724934974;殘,-8.38066866417;斜,-10.3157385987;鸡,-10.7895229508;唧,-15.3846428009;利,-6.16494633399;漫,-10.254744086;蹁,-13.5928833317;激,-7.35195792493;齋,-10.6841624351;惊,-7.56862896173;屍,-10.5404557144;奏,-9.46038700348;卓,-12.5514294568;偕,-11.1505362963;他,-14.6914956203;诘,-12.249148585;慟,-12.0888059349;繡,-10.341217684;忠,-9.51252501142;物,-9.8874745756;叨,-11.6710707342;淬,-13.4387326518;襯,-10.4719879152;擲,-13.3052012592;命,-8.02517516264;酿,-9.64807050341;退,-6.34106564679;瞅,-10.9419915444;專,-7.94097911778;舌,-12.494271043;废,-7.9563096067;怠,-9.79365582038;氨,-13.9983484398;炫,-10.0327846674;售,-9.13659992638;禱,-10.6484443525;狗,-13.4387326518;坚,-6.94002030231;统,-5.85664901797;查,-7.14399393752;锐,-10.121952612;念,-8.54089285189;慶,-8.75925043288;摸,-8.90613315868;诽,-10.5971510581;仿,-8.68637474678;邀,-8.48896010314;妆,-12.4402038217;昏,-9.02334032332;漕,-9.47655986272;列,-7.60308684166;错,-9.36848564119;窜,-11.9189068981;鸟,-10.1806361138;悠,-13.0820577079;探,-6.84568811769;贩,-9.57350180792;單,-10.7118139664;改,-5.35487508245;蒸,-8.59679781858;欽,-9.93790542923;允,-7.75078924121;呃,-12.3401203632;配,-6.3572641906;拌,-11.0026161662;虏,-13.1874182236;毒,-9.95529717194;何,-8.94849243252;留,-6.26368024007;来,-5.44883327689;触,-7.99384427916;浩,-11.040837379;独,-6.55234694145;饱,-9.04076236677;维,-6.34201127334;艷,-11.6234426852;懶,-10.2429792444;譽,-8.84073095533;蹿,-11.9834454192;堆,-8.2879214224;粉,-8.93733693835;萎,-8.38430834062;輔,-8.73955183139;钙,-10.9901936462;甘,-9.33020345462;龟,-11.4928225028;股,-11.600453167;愠,-12.2936003475;販,-9.57350180792;钳,-11.5344951992;吮,-11.5779803111;碱,-12.0173469709;纵,-7.93514479551;掷,-13.3052012592;阴,-9.53531802095;郁,-10.9073059864;雅,-13.0820577079;潔,-13.3052012592;属,-6.93615680749;惡,-8.73955183139;凫,-13.5928833317;恶,-8.73955183139;數,-9.74985319772;智,-9.83168321597;歼,-8.91384329711;垄,-7.92242786112;领,-7.76197884957;戍,-10.7118139664;树,-9.00282678349;北,-9.03900644006;炖,-13.9983484398;抢,-7.59809099446;梦,-9.61009125535;谩,-11.4143508873;涨,-7.15726729406;爭,-7.03800071067;眯,-11.1799501815;媲,-10.3220477679;漿,-11.6957633468;遁,-11.1361475588;啃,-15.3846428009;狂,-9.14631817585;遷,-7.70677930021;绊,-11.4333990823;擎,-11.9834454192;祛,-10.2028592506;囚,-10.3806964949;鳞,-14.6914956203;散,-7.53492904329;歧,-9.73566856273;跨,-8.24339767854;称,-5.85941869904;鹵,-10.8960064312;使,-5.46267702711;各,-11.6234426852;师,-9.33963748686;而,-10.2908926001;褒,-10.4868030009;涕,-12.3889105273;甚,-10.7212037068;妝,-12.4402038217;辩,-8.69131913262;洪,-15.3846428009;騰,-9.31159826679;纳,-7.80700896829;沿,-8.66804802737;輾,-9.77517100571;嗅,-10.7695222841;筆,-11.4143508873;译,-9.76062529471;仓,-11.0539094606;卖,-7.58940787189;噘,-13.0820577079;糟,-9.99557107108;握,-8.802617662;日,-8.75792505164;警,-7.93050172275;凭,-10.8099318224;捶,-11.2902982387;咄,-15.3846428009;缉,-10.6055193078;肌,-11.7737248882;搏,-9.55864269351;逗,-9.67090999538;羞,-9.82012239357;抠,-13.9983484398;撤,-7.32221000931;輩,-11.4528171682;催,-8.1909569825;垮,-10.3942102141;达,-5.81613859393;十,-12.0524382907;狀,-11.2902982387;终,-8.18795623006;緊,-8.14902365983;取,-5.72987305079;嗚,-10.0863254343;祝,-9.32085759221;锤,-11.6710707342;捡,-12.165766976;详,-9.89570507474;跪,-8.08282045875;矮,-12.2936003475;平,-7.42536684078;職,-10.4793680225;揶,-11.4726197955;書,-9.46306438125;旺,-11.3415915331;濾,-11.0941833597;犁,-11.4143508873;适,-6.33060542331;锄,-12.3401203632;尊,-7.98892119229;宛,-10.1751566481;挠,-11.3773096157;攤,-10.0233506352;亩,-12.9867475281;炭,-12.9867475281;疯,-10.3157385987;嘮,-10.8413480186;举,-6.33941294898;勁,-11.0805777077;铅,-11.0539094606;廉,-10.0375352702;慌,-12.9867475281;藏,-9.31159826679;歐,-12.2065889705;剖,-9.61945169811;試,-7.30812747334;叫,-7.21163148917;豪,-10.8099318224;闯,-9.40575703599;扶,-8.31222090036;读,-8.07811140195;摺,-13.5928833317;邂,-11.5344951992;善,-8.30125495327;首,-7.95334312574;攏,-13.7752048885;袒,-10.8307659093;趔,-11.040837379;阙,-15.3846428009;掠,-8.70504361505;营,-8.33886622401;踩,-9.97747102943;猫,-12.9867475281;冬,-9.90400387755;稱,-5.85941869904;宰,-10.7794726149;栽,-9.50410981449;剁,-12.9867475281;烂,-11.600453167;奇,-7.70770565507;糊,-10.5248303965;酌,-12.494271043;体,-6.88744825598;棒,-12.8997361511;筛,-9.64807050341;硝,-11.6469731826;點,-6.70635168913;諦,-11.7210811548;俨,-10.0423085489;卫,-12.165766976;質,-7.87805102082;遭,-7.11539827971;目,-9.01817235316;驱,-7.97369092531;練,-8.6548187304;擺,-7.03421282735;滾,-9.05492189537;須,-10.5094454777;写,-7.21643987066;产,-5.75592109554;瞭,-10.3157385987;犯,-8.81375983855;碳,-11.4333990823;耸,-9.87525446426;治,-6.38144960715;絆,-11.4333990823;蓋,-9.84337925573;苏,-10.5248303965;慎,-10.6224688661;跑,-9.39819079561;试,-7.30812747334;盗,-8.68760855323;燙,-10.8848331306;博,-8.60018573826;竟,-8.69008074237;赦,-10.3476901985;表,-4.59291425793;煮,-10.6055193078;署,-10.5248303965;寵,-9.56455987054;穴,-11.1651350957;恸,-12.0888059349;賻,-14.6914956203;追,-6.41484649491;咀,-9.86318188303;垂,-7.81574713749;服,-7.36010792929;戏,-9.74273572995;嘗,-8.48491969361;鄙,-9.81629829713;护,-8.05292783117;丧,-8.19321347086;润,-9.96410780162;偃,-15.3846428009;奉,-7.98892119229;濒,-9.4133809611;闖,-9.40575703599;煙,-11.6234426852;黜,-13.9983484398;恣,-12.1265462629;湧,-7.77082411608;孵,-9.59162919251;时,-8.90000756526;腹,-8.92317462454;载,-8.98438535558;身,-7.70770565507;詿,-15.3846428009;销,-9.61945169811;錄,-8.58447273259;将,-10.7596699876;斋,-10.6841624351;掏,-8.3105259847;備,-8.11293909401;挤,-8.54195951865;侧,-9.01817235316;横,-8.06147208295;环,-8.53663752632;逮,-8.85376517317;踉,-10.4646618751;辈,-11.4528171682;脸,-9.69091066209;殿,-10.6841624351;品,-9.16803669981;療,-10.3673629641;祈,-9.02506893222;賑,-10.121952612;矗,-10.5171083504;鉚,-12.5514294568;绝,-8.09776638914;塞,-10.6661439296;拥,-6.56320544873;嗫,-10.8307659093;园,-14.6914956203;鼓,-7.31123983191;可,-4.09712595056;跻,-10.0863254343;顫,-8.73695442733;門,-10.2847763731;馈,-11.6234426852;民,-10.3157385987;互,-7.8841133155;候,-10.4079090585;崛,-8.54302732442;暢,-9.3660495864;沦,-8.802617662;榨,-9.69091066209;邮,-10.7895229508;宴,-10.2847763731;活,-6.95649942631;竊,-10.1014390722;荏,-13.7752048885;評,-6.82113870661;比,-6.90806329236;釘,-15.3846428009;壞,-10.0001477381;慣,-10.4868030009;賦,-8.69131913262;山,-11.0151949484;女,-12.249148585;懸,-8.30967960293;嘀,-10.4646618751;養,-7.88025124173;萌,-8.88185275498;踐,-9.98196541902;焚,-8.66442264576;映,-9.45239761344;攢,-11.9506555964;貧,-10.4573891157;让,-8.40085283563;听,-5.955166899;匮,-10.3476901985;撷,-12.8997361511;謾,-11.4143508873;勃,-12.1265462629;捎,-11.0151949484;近,-8.61385337698;緝,-10.6055193078;拣,-11.7737248882;车,-10.1972569951;闭,-8.23472596476;任,-7.23043010598;省,-8.99608139535;喂,-9.67090999538;還,-5.63116451568;簇,-9.55569718328;妊,-9.47113979525;踟,-12.2936003475;瘫,-9.6841992275;甭,-12.3889105273;咬,-9.54691235373;厮,-9.13081398932;蹉,-12.5514294568;稳,-9.10424696193;挹,-15.3846428009;洽,-10.4646618751;貼,-8.46991190817;设,-6.22896983026;剃,-11.6957633468;充,-6.97481212781;佑,-14.2860305122;勘,-9.61320167776;条,-12.494271043;扣,-8.35999377044;影,-10.4430003783;驳,-9.91658265976;懺,-10.7794726149;泼,-10.9658021931;需,-5.64138268768;伐,-11.1219629239;谒,-13.7752048885;愤,-8.97282453318;株,-11.3592911102;唬,-12.2065889705;刮,-10.2847763731;头,-9.58252442552;斷,-7.52214560366;抹,-10.2084930683;沽,-11.7210811548;囁,-10.8307659093;着,-7.1506085932;參,-5.45363736232;僅,-8.50941071362;嫉,-9.71131953372;敌,-11.2902982387;扎,-9.67753253614;诓,-12.3401203632;狙,-10.5806217562;做,-6.33353265449;租,-7.939809527;揣,-9.79739414249;书,-9.46306438125;哭,-8.85814794132;凯,-10.532612537;罰,-9.03375708418;籲,-12.3889105273;賽,-10.1861457696;咂,-11.7210811548;庆,-8.75925043288;守,-7.7937906772;墊,-10.953826002;損,-7.51792051576;意,-7.07792375769;辐,-7.9439090935;尝,-8.48491969361;綜,-10.4719879152;够,-11.2737689367;憤,-8.97282453318;喬,-12.7455854713;縱,-7.93514479551;馴,-9.81629829713;酷,-9.87931126496;细,-8.41861861379;婉,-12.2065889705;旌,-13.5928833317;蹑,-13.1874182236;牙,-13.5928833317;变,-5.83234526206;捣,-9.57350180792;铺,-8.98106860296;恥,-11.1949880589;孳,-11.7210811548;塵,-12.2065889705;轻,-8.72534888121;西,-9.87525446426;禁,-7.54827304035;羅,-10.3476901985;儆,-14.2860305122;合,-6.06814223309;憑,-10.8099318224;耐,-10.2028592506;撓,-11.3773096157;枕,-12.9867475281;骗,-10.2141588059;欢,-7.51524108832;未,-7.38462870721;纯,-9.38819071227;熱,-7.93108092925;嘴,-11.7737248882;伺,-9.2255474124;駁,-9.91658265976;鳃,-12.2065889705;必,-8.43862880979;勇,-10.2847763731;济,-10.7118139664;恐,-10.7499138127;奖,-9.90400387755;烛,-12.249148585;阻,-7.2872165023;盟,-13.0820577079;泣,-12.0888059349;拧,-12.7455854713;腦,-12.9867475281;早,-8.95653752821;絮,-11.8582822763;凱,-10.532612537;灰,-11.0151949484;獲,-5.83504835092;諷,-9.52957087869;扼,-9.90817924896;缅,-11.2415080745;针,-10.0093643932;搓,-12.0524382907;粘,-9.38819071227;逛,-10.4430003783;羚,-14.6914956203;嘟,-10.3283969955;谣,-11.1651350957;枪,-9.99557107108;厲,-12.2936003475;嚴,-8.16793331418;总,-7.59105599752;挽,-8.86402167333;组,-5.41733573564;乏,-13.5928833317;插,-8.54089285189;蝕,-12.3401203632;穗,-14.6914956203;癟,-14.6914956203;询,-7.82560454545;执,-6.42494565393;填,-8.58447273259;共,-7.47258591271;直,-6.85473083707;濺,-12.5514294568;拼,-8.70630068624;弄,-9.37828964129;率,-7.59975350524;逆,-9.08385700623;锈,-12.165766976;谎,-11.3773096157;舒,-10.3094689857;军,-11.1799501815;劝,-8.15118738227;猜,-8.27068669133;躥,-11.9834454192;鄰,-8.92317462454;蠶,-11.0805777077;油,-10.6572549822;为,-5.79299341069;抽,-7.42257549214;壁,-12.0173469709;諍,-14.6914956203;歌,-8.96464787275;俏,-13.7752048885;扒,-10.4793680225;卜,-11.4528171682;詢,-7.82560454545;滥,-9.54109838386;僱,-8.90921008419;请,-7.24520227902;浸,-8.87885874076;码,-11.8881352394;骂,-10.0001477381;漏,-9.66761509949;嬗,-12.3401203632;初,-8.66442264576;土,-10.7402519018;蠡,-14.6914956203;责,-8.46991190817;檢,-7.58694076538;严,-8.16793331418;冰,-10.1323693728;申,-6.16267034469;劲,-11.0805777077;人,-10.2908926001;升,-6.52088560929;益,-11.9506555964;住,-8.69131913262;拒,-7.66285102408;處,-5.7482506872;柔,-14.6914956203;捧,-10.8413480186;摩,-8.7820549087;陵,-13.4387326518;避,-6.94131145807;護,-8.05292783117;腻,-11.5560014044;擾,-9.66433102429;射,-9.14631817585;沏,-11.2575084158;颗,-14.6914956203;力,-7.97732509042;钟,-10.4646618751;计,-6.55030582688;氤,-13.7752048885;违,-7.72499984633;攪,-9.37582961545;到,-6.91014836401;儲,-9.00621661724;贺,-10.6397106725;撿,-12.165766976;黃,-12.1265462629;請,-7.24520227902;摔,-9.47655986272;停,-6.31138296946;非,-10.9419915444;遏,-8.89240296587;詠,-11.4333990823;躺,-11.1505362963;惧,-9.93360434733;硬,-9.59162919251;置,-8.11502605128;叱,-11.4726197955;恼,-10.0763751035;松,-9.00791585299;如,-7.23561893284;紅,-9.86718990443;历,-7.62716403431;喊,-8.60131760029;植,-10.0423085489;挑,-7.98341153648;易,-8.93575340675;頗,-9.53244032112;创,-5.64067866887;吟,-9.78993142129;瞞,-11.8582822763;败,-8.72791627671;微,-8.83213491386;冲,-7.39203614849;电,-9.79365582038;讶,-13.0820577079;趺,-13.5928833317;假,-8.00065334291;鼠,-13.0820577079;盈,-11.1505362963;痊,-10.3220477679;拐,-10.5806217562;懒,-10.2429792444;擔,-6.20044108653;默,-9.38819071227;瑟,-12.0173469709;歡,-7.51524108832;賤,-11.9506555964;屯,-9.05670601716;危,-8.18347191761;陳,-8.57009990363;淺,-12.0888059349;突,-7.45804020171;頂,-9.11554651719;分,-4.86082072539;圈,-9.71476187791;残,-8.38066866417;吊,-9.55864269351;与,-9.53820402584;抑,-7.75758538387;撕,-9.17003470247;缘,-13.7752048885;喟,-12.9867475281;誡,-13.9983484398;欠,-9.06207756097;搪,-10.9419915444;帮,-6.97748771469;進,-4.35736266116;伸,-7.23330946299;嫁,-9.89158135755;心,-7.59311998174;組,-5.41733573564;采,-5.50105188007;诋,-11.6234426852;跏,-14.6914956203;捐,-8.63237242475;给,-7.06468177901;兜,-10.4288157433;泥,-13.5928833317;赤,-11.1799501815;寫,-7.21643987066;獰,-12.2936003475;決,-5.9453358643;能,-6.09900944488;晾,-11.0279339742;颂,-10.6139581764;嶄,-14.2860305122;窖,-11.8011238624;逝,-9.07472452267;涤,-13.4387326518;累,-7.22784575422;爱,-8.6347116071;傲,-11.8881352394;政,-8.89543786957;節,-7.26286538173;居,-7.24549412201;兇,-11.5560014044;衍,-8.48794846927;赏,-9.0285351402;提,-4.45962200779;嫖,-11.6469731826;忘,-7.85846388755;回,-4.63988983234;诠,-10.4217981706;苦,-8.43382803245;呵,-10.0567666321;痴,-11.0026161662;聽,-5.955166899;懼,-9.93360434733;綁,-9.7788407346;异,-10.1271474289;皇,-14.2860305122;唆,-10.9073059864;踌,-9.82012239357;舔,-13.5928833317;漢,-10.9419915444;讥,-9.86718990443;膩,-11.5560014044;怨,-10.219856827;挪,-9.37092764485;央,-10.3740075068;露,-7.70400537333;撻,-13.3052012592;雇,-8.90921008419;凉,-11.9834454192;扔,-9.38075573379;願,-7.26942082833;魚,-12.3401203632;淡,-9.3047096058;叵,-11.307105357;二,-11.1079766819;君,-12.494271043;措,-10.1323693728;缭,-10.4148295013;论,-8.21221822377;朽,-11.6710707342;房,-10.5094454777;竄,-11.9189068981;光,-8.33886622401;位,-6.03636824283;滌,-13.4387326518;拔,-8.802617662;壘,-12.3401203632;雜,-10.3542048795;牟,-10.4793680225;賠,-8.15118738227;步,-8.51355150628;驯,-9.81629829713;鍵,-12.8997361511;曼,-14.6914956203;懾,-12.6765925998;市,-8.54516636266;瞇,-11.1799501815;吆,-9.44447154817;刊,-8.5956710579;撑,-9.82781473919;投,-6.01610281424;得,-5.52746100123;原,-7.57876076066;肩,-10.4942936727;截,-6.61934031214;嘲,-9.07290799174;診,-7.85041447462;跋,-10.6055193078;軍,-11.1799501815;桎,-14.2860305122;晒,-10.8628542238;痛,-8.40456686033;婚,-13.0820577079;靜,-8.45904760378;遞,-8.0794545855;泡,-10.1271474289;赠,-9.3047096058;惩,-8.6347116071;确,-6.02226827306;異,-10.1271474289;勵,-13.3052012592;迷,-8.2929006858;裹,-11.0026161662;藻,-13.1874182236;稅,-14.2860305122;咆,-10.2488443638;瀉,-12.0524382907;洋,-10.4430003783;戕,-12.6765925998;溢,-10.1014390722;憨,-12.7455854713;墮,-9.76424193518;貶,-8.14112982623;根,-10.1482008381;攻,-6.74895571543;肾,-10.7118139664;驅,-7.97369092531;均,-10.5806217562;赋,-8.69131913262;譏,-9.86718990443;罗,-10.3476901985;姘,-13.9983484398;韜,-13.1874182236;污,-10.6139581764;诤,-14.6914956203;恩,-10.7596699876;臨,-7.21163148917;呱,-12.8997361511;关,-5.79408675506;盲,-11.600453167;創,-5.64067866887;羁,-10.1482008381;窃,-10.1014390722;禅,-11.2415080745;圆,-10.6841624351;玉,-12.494271043;刈,-15.3846428009;抓,-7.38496422139;编,-7.18820598966;喝,-7.55381980576;渠,-12.2936003475;誣,-9.64163961308;針,-10.0093643932;維,-6.34201127334;遜,-11.3592911102;嘰,-13.3052012592;施,-7.66862753425;開,-4.35538185163;終,-8.18795623006;叉,-10.7118139664;介,-6.50127988398;盛,-7.66551295999;奚,-11.0805777077;呜,-10.0863254343;烟,-11.6234426852;濡,-11.9506555964;习,-9.71131953372;赢,-8.88035462736;揩,-12.0524382907;壯,-8.94849243252;蛻,-10.3347867936;预,-5.47472596059;劈,-11.040837379;冊,-10.2371483241;貌,-10.7996753222;借,-7.2754178478;訣,-11.9506555964;抨,-9.4133809611;縫,-10.0001477381;鮮,-10.4217981706;傴,-13.9983484398;覺,-6.14019089929;泌,-12.0888059349;忖,-12.2936003475;高,-6.69047565901;畝,-12.9867475281;摧,-8.91694407479;幫,-6.97748771469;自,-5.99481822694;顯,-5.56448251095;兵,-10.0423085489;違,-7.72499984633;开,-4.35538185163;处,-5.7482506872;嘆,-8.52397912944;逊,-11.3592911102;討,-7.2284194777;钝,-11.9834454192;亡,-8.9927256875;漠,-11.3241997903;挨,-8.95977377699;怪,-10.3740075068;皱,-9.93360434733;地,-8.51666839192;壅,-11.51344179;勉,-8.38430834062;摒,-10.8737832944;站,-8.08484543413;存,-5.95886852067;啜,-11.51344179;營,-8.33886622401;满,-6.72716606403;豢,-11.7470566412;旧,-13.9983484398;择,-9.7715146945;快,-11.2257597175;僵,-9.93360434733;歸,-7.16585564529;找,-7.08635216653;往,-8.04575466705;笃,-11.210255531;岂,-8.95815434344;妄,-9.47928095284;隆,-9.17003470247;邊,-11.7210811548;怕,-12.8997361511;纖,-11.4333990823;騙,-10.2141588059;吝,-11.7470566412;償,-8.3943863004;推,-5.08392394518;缫,-10.4573891157;樹,-9.00282678349;许,-8.64886278665;搽,-14.6914956203;愿,-7.26942082833;镇,-7.73828907845;盆,-13.0820577079;擒,-10.532612537;過,-5.82006044222;嗜,-11.3415915331;勞,-9.36361945154;正,-6.59361294385;扩,-5.83071272453;鑽,-8.36534614718;緬,-11.2415080745;饯,-10.7499138127;即,-7.82196155417;偵,-7.85684881317;起,-4.88849160637;拾,-10.2726550125;怀,-7.22269700142;挂,-7.60392191477;誇,-8.58447273259;随,-8.45806576767;抗,-7.36634666238;料,-8.57339842229;蜚,-11.2902982387;造,-6.14193204889;瞥,-10.5094454777;欲,-10.9073059864;侵,-6.99006932302;渴,-8.92944423755;銷,-9.61945169811;閹,-11.3956587543;眺,-10.7306824507;宽,-9.17003470247;豈,-8.95815434344;珍,-9.31390507289;科,-11.2415080745;翕,-13.4387326518;摘,-9.31853471079;话,-12.0888059349;軟,-9.83946535641;铣,-13.3052012592;酬,-10.5404557144;巩,-8.1418448781;揭,-7.53492904329;衰,-7.44299154796;绿,-12.6120540787;萃,-10.36076228;掂,-11.210255531;沈,-7.05667494259;個,-10.3874305271;匍,-10.6055193078;鰓,-12.2065889705;引,-5.53719663924;攙,-9.66105769894;無,-5.75034273817;遇,-7.14241290952;循,-11.8582822763;抬,-7.18793039368;械,-12.3889105273;殲,-8.91384329711;刷,-8.98438535558;頻,-9.83168321597;綾,-11.4333990823;胀,-11.9189068981;视,-7.93922524419;寒,-9.71131953372;酸,-11.6710707342;擘,-13.7752048885;衛,-12.165766976;盤,-7.61695552371;景,-11.5779803111;凶,-11.5560014044;铸,-8.81937783086;基,-9.72865099007;輪,-8.55268923533;醋,-13.5928833317;鞏,-8.1418448781;频,-9.83168321597;缔,-9.29559792545;撙,-14.6914956203;键,-12.8997361511;足,-7.9161295294;亵,-11.3773096157;笼,-9.01132301132;泉,-12.249148585;赈,-10.121952612;绕,-8.76456959436;敘,-8.49913313086;晚,-10.7596699876;迟,-9.68754931439;牢,-10.7118139664;寧,-10.6932949187;繪,-9.42106345727;拭,-11.9506555964;該,-9.51252501142;偶,-12.494271043;啸,-13.3052012592;移,-8.08416998662;老,-9.67753253614;构,-6.4497924606;消,-6.19053344203;刍,-12.9867475281;頑,-11.1799501815;窒,-10.0093643932;冠,-10.6224688661;脫,-7.21163148917;撮,-11.307105357;蠱,-12.0888059349;吹,-8.60699620726;皺,-9.93360434733;精,-7.69070547538;蟄,-11.0539094606;歇,-9.11365436903;汉,-10.9419915444;車,-10.1972569951;双,-11.6469731826;駐,-8.28132073837;繕,-11.9506555964;轟,-8.55268923533;編,-7.18820598966;慫,-10.4430003783;扭,-7.98524471756;固,-8.7766421756;导,-6.30897733224;戀,-9.02161469735;辉,-11.4726197955;再,-6.9316681818;咏,-11.4333990823;库,-13.7752048885;沟,-8.27068669133;伞,-12.0888059349;删,-8.90000756526;義,-11.1651350957;躲,-8.40829473044;水,-9.31390507289;傷,-8.16573309327;猶,-8.75527954746;旅,-9.00961798106;蹈,-13.3052012592;赊,-11.4528171682;结,-5.70906011677;饒,-10.0423085489;難,-7.59518823481;嗥,-12.9867475281;擯,-11.7210811548;詰,-12.249148585;襲,-8.45512603013;陸,-12.2936003475;技,-12.8997361511;憂,-9.31853471079;殆,-9.96854239869;載,-8.98438535558;瞎,-9.8998458674;辞,-8.14830345814;加,-4.92308350899;宦,-15.3846428009;缩,-7.32948506907;悬,-8.30967960293;贵,-11.210255531;皸,-11.9834454192;碼,-11.8881352394;尿,-10.7794726149;晃,-9.72865099007;故,-10.2726550125;蓄,-8.47389201293;识,-8.47989203093;城,-8.45121977516;筑,-9.25341631141;絕,-8.09776638914;揖,-13.4387326518;詛,-10.0471047212;襝,-13.9983484398;卡,-10.7794726149;狠,-10.8737832944;陣,-9.81248876871;顧,-8.57229770672;彩,-11.9834454192;扫,-8.10739507426;賴,-10.4942936727;飼,-8.81516138048;怂,-10.4430003783;争,-7.03800071067;压,-7.25753361555;骑,-8.508378189;純,-9.38819071227;條,-12.494271043;逢,-11.9189068981;唤,-9.64807050341;莫,-9.1212445383;馆,-13.9983484398;冷,-8.07208930279;礼,-10.1642869758;擅,-8.93575340675;詆,-11.6234426852;兌,-8.3105259847;噎,-11.2415080745;離,-6.3842829937;輸,-7.03043923797;诛,-10.1271474289;裝,-6.9402353792;跟,-7.08934394139;鏤,-11.0941833597;黩,-13.1874182236;議,-7.63144853101;赴,-9.83946535641;幾,-15.3846428009;掀,-8.47389201293;三,-10.8960064312;倍,-9.91658265976;唏,-11.4143508873;弓,-13.3052012592;茫,-12.7455854713;憬,-14.6914956203;許,-8.64886278665;軲,-13.1874182236;谵,-14.2860305122;状,-11.2902982387;纾,-12.8196934434;扁,-12.3889105273;权,-9.96410780162;迈,-8.82928590908;凌,-9.92505728675;畏,-9.38819071227;拖,-8.10947048144;據,-7.4267654424;衝,-7.39203614849;滞,-8.85522396263;鹽,-11.6234426852;恭,-9.30242389052;蛮,-12.7455854713;哺,-10.19168595;黾,-14.2860305122;搀,-9.66105769894;肃,-9.86718990443;莅,-11.8582822763;咋,-11.0805777077;權,-9.96410780162;暗,-8.06676660227;东,-9.1760527748;判,-6.89543764602;氰,-13.0820577079;漲,-7.15726729406;嚷,-10.36076228;旁,-10.1806361138;陌,-14.6914956203;归,-7.16585564529;保,-4.96132033043;闡,-8.06809462371;給,-7.06468177901;拯,-9.41593524091;深,-6.77068594104;镶,-9.46038700348;選,-5.95838492269;系,-10.3942102141;鹼,-12.0173469709;考,-6.10086611084;抄,-9.41083318902;万,-13.4387326518;殊,-10.8848331306;圍,-7.11565459139;頓,-9.74985319772;猥,-12.2065889705;風,-9.06207756097;贱,-11.9506555964;炸,-9.84730853387;捅,-13.4387326518;诊,-7.85041447462;雌,-14.2860305122;野,-12.8196934434;體,-6.88744825598;揚,-9.05849332774;佝,-11.2575084158;遣,-8.9927256875;矢,-11.9189068981;磨,-8.77799261469;扯,-10.5643612353;类,-7.35781922468;穿,-7.63963999738;攀,-8.0902655016;昂,-10.4430003783;喋,-12.8196934434;笔,-11.4143508873;林,-9.79739414249;溝,-8.27068669133;唠,-10.8413480186;館,-13.9983484398;本,-11.0671546874;阉,-11.3956587543;渲,-10.1861457696;宿,-10.7895229508;擁,-6.56320544873;担,-6.20044108653;偎,-12.3401203632;慘,-9.57350180792;跛,-12.9867475281;潜,-8.18795623006;诟,-13.9983484398;釣,-9.7715146945;忧,-9.31853471079;票,-13.5928833317;走,-5.6903958945;蹲,-9.87121405473;譴,-9.25341631141;烹,-9.95969278341;典,-10.153534184;绽,-10.4868030009;顾,-8.57229770672;暂,-8.50425871871;瞌,-10.5563290636;少,-9.1861640844;餓,-9.18413362685;朗,-10.0863254343;辜,-9.85918986176;妨,-9.32318588196;蘭,-14.6914956203;醜,-12.7455854713;谱,-11.2902982387;殴,-10.4217981706;碾,-11.040837379;览,-14.2860305122;畋,-13.3052012592;赛,-10.1861457696;拚,-10.7025115738;酣,-11.0671546874;剥,-7.67309382126;蟬,-11.2737689367;仲,-9.25559259083;说,-5.29008044657;凸,-8.9153924841;飾,-11.1361475588;怄,-12.249148585;猎,-10.4573891157;研,-7.38563558765;掙,-7.88854545572;脚,-10.219856827;梟,-12.3401203632;太,-13.4387326518;搬,-8.1255266728;肯,-6.97681814653;辱,-10.532612537;鐵,-11.2415080745;麻,-8.96464787275;但,-9.78993142129;烏,-13.0820577079;托,-8.33712557954;畢,-7.47920115183;鳧,-13.5928833317;審,-6.54507629723;葬,-10.7402519018;惯,-10.4868030009;买,-6.46907625518;鉸,-12.4402038217;鱼,-12.3401203632;斂,-11.1079766819;脅,-10.4501688678;澆,-9.94222509037;阋,-14.6914956203;透,-6.91202865287;弑,-12.3401203632;搗,-9.57350180792;減,-5.62542985751;骨,-9.57350180792;蔭,-12.2065889705;撬,-11.1361475588;匹,-8.95331171896;蛀,-13.9983484398;汇,-7.60392191477;歉,-12.8196934434;觊,-10.953826002;网,-10.7025115738;著,-7.1506085932;拘,-8.86993011002;入,-6.5901209491;烤,-10.8202946094;息,-10.4942936727;仰,-9.0285351402;極,-10.3542048795;勸,-8.15118738227;出,-4.0098076762;最,-9.7570216872;搂,-11.040837379;肅,-9.86718990443;饗,-15.3846428009;誉,-8.84073095533;斗,-9.93360434733;带,-5.69583472126;窩,-11.3415915331;堪,-9.395681384;攬,-10.7212037068;讳,-11.51344179;喷,-8.03476909615;銹,-12.165766976;雞,-10.7895229508;情,-9.49023996663;镌,-11.040837379;剎,-11.6710707342;绑,-9.7788407346;齐,-9.00621661724;磕,-9.09307366133;奔,-7.72076554219;进,-4.35736266116;口,-8.97611400983;煤,-11.6469731826;巧,-9.71131953372;轰,-8.55268923533;陶,-10.0047454474;卸,-9.08937679945;翻,-7.22755901586;遺,-8.77260176606;驾,-7.89802948775;撂,-11.0539094606;國,-8.86255000272;名,-7.73304722704;堕,-9.76424193518;肚,-13.1874182236;語,-11.7470566412;鞠,-10.7402519018;钢,-13.9983484398;冤,-9.79739414249;紧,-8.14902365983;度,-8.45512603013;斬,-9.21712631;踱,-10.9779235536;謳,-11.210255531;刹,-11.6710707342;鼻,-10.8628542238;為,-5.79299341069;尽,-8.98106860296;浇,-9.94222509037;仆,-13.7752048885;诈,-10.1014390722;裊,-15.3846428009;闌,-12.8196934434;委,-7.79429585529;陡,-11.9189068981;瓢,-13.0820577079;健,-8.56571873562;述,-10.4430003783;零,-12.1265462629;特,-8.55268923533;司,-13.3052012592;要,-5.7912192717;辅,-8.73955183139;愆,-14.6914956203;钓,-9.7715146945;会,-7.46020861601;犧,-8.27803666317;被,-8.20001364818;训,-9.71131953372;傻,-11.0026161662;缺,-7.02550791413;血,-11.4528171682;辍,-10.9419915444;经,-7.1890332336;遐,-11.5560014044;卒,-13.9983484398;敞,-9.96410780162;詬,-13.9983484398;滯,-8.85522396263;饶,-10.0423085489;调,-6.64526651926;與,-9.53820402584;撈,-11.1079766819;吓,-8.94529242979;視,-7.93922524419;星,-11.5560014044;颠,-8.931017802;客,-10.8737832944;甩,-9.72865099007;踯,-12.6765925998;涮,-15.3846428009;脱,-7.21163148917;暴,-7.34451813644;騷,-9.00113616601;阿,-12.2065889705;疾,-10.2141588059;扇,-11.9189068981;臆,-11.600453167;嫌,-10.6572549822;囔,-13.9983484398;赙,-14.6914956203;拜,-8.0714224138;號,-8.25294429043;剧,-10.36076228;摳,-13.9983484398;菲,-12.8196934434;穷,-10.8960064312;鋼,-13.9983484398;樂,-9.25995941;間,-9.44447154817;隕,-12.0888059349;沙,-10.8960064312;夠,-11.2737689367;辯,-8.69131913262;氮,-12.6765925998;戲,-9.74273572995;冻,-8.23865833318;滅,-8.2731306844;轄,-11.7210811548;聆,-10.4719879152;秋,-10.5724584455;诗,-14.6914956203;酥,-12.9867475281;铩,-13.9983484398;譬,-9.53820402584;濯,-14.2860305122;惱,-10.0763751035;腰,-11.0671546874;色,-13.7752048885;顶,-9.11554651719;矿,-11.2415080745;澄,-9.50690701911;式,-11.9834454192;犒,-11.210255531;愛,-8.6347116071;期,-7.59767579828;蒞,-11.8582822763;褫,-13.3052012592;險,-12.6120540787;設,-6.22896983026;輯,-10.7025115738;纺,-9.56455987054;觀,-6.71730695105;諂,-11.3956587543;胆,-10.5888522553;蛊,-12.0888059349;積,-7.45731844058;富,-7.66108032861;灑,-10.6397106725;勒,-9.65454301792;淘,-8.6300387014;滚,-9.05492189537;卧,-10.0280565262;烦,-11.7210811548;盪,-10.0001477381;诬,-9.64163961308;建,-5.37337765618;牽,-7.93805770174;超,-5.58412972398;肇,-12.8997361511;砌,-11.0941833597;梗,-10.1116432423;抛,-7.99817195206;管,-7.80139527659;夢,-9.61009125535;錦,-14.6914956203;瞩,-9.82396116988;貯,-8.63120488229;戰,-7.95988103907;毁,-8.58335976642;立,-7.69207315282;种,-7.58611974727;塌,-9.73215362062;彎,-8.64412344129;兒,-13.4387326518;苛,-11.2737689367;寡,-12.0173469709;廣,-9.44447154817;工,-11.6710707342;衬,-10.4719879152;泯,-12.0888059349;轮,-8.55268923533;曳,-13.4387326518;翹,-10.4573891157;幸,-9.54400114352;謁,-13.7752048885;概,-8.56462643622;贅,-12.6120540787;釀,-9.64807050341;暈,-10.1376187287;复,-5.91795623677;小,-7.38630740494;美,-9.42880543143;饮,-8.36893038041;辛,-9.02161469735;眩,-10.0047454474;隨,-8.45806576767;喪,-8.19321347086;頷,-11.2575084158;弹,-8.65960915873;刻,-8.53134370771;炼,-8.73955183139;观,-6.71730695105;浅,-12.0888059349;賄,-9.62574102702;余,-9.89570507474;惜,-10.4010361792;革,-9.93790542923;橫,-8.06147208295;修,-6.49258117535;敵,-11.2902982387;罹,-11.2257597175;煽,-9.76787170323;侃,-15.3846428009;洄,-10.5483608939;銑,-13.3052012592;咕,-10.254744086;优,-7.23100531451;掛,-7.60392191477;斟,-9.44974860527;在,-6.3165574765;袭,-8.45512603013;花,-8.48089554331;去,-7.80752087002;濃,-10.1697070433;泅,-11.9189068981;资,-9.47928095284;懇,-9.59162919251;曉,-8.21683361658;仙,-12.7455854713;嫡,-12.9867475281;鳥,-10.1806361138;毫,-8.0754304352;拱,-9.102376054;聲,-8.78613377228;蕴,-8.88485576024;驶,-9.08202382515;兼,-7.24753941125;較,-9.67421578352;谅,-10.1642869758;刑,-12.8997361511;圓,-10.6841624351;炒,-7.57957575663;渙,-11.1949880589;挛,-12.5514294568;思,-7.66862753425;膜,-11.7737248882;宠,-9.56455987054;謫,-11.8881352394;贯,-8.04640465083;掰,-11.4143508873;悲,-10.9779235536;夷,-11.7210811548;医,-10.1972569951;诀,-11.9506555964;裂,-9.19843417699;晉,-9.51534588776;嗔,-11.1361475588;蹙,-11.9834454192;履,-8.2537439706;內,-8.50015614885;险,-12.6120540787;杳,-15.3846428009;祷,-10.6484443525;獻,-8.01315350568;图,-10.532612537;漂,-8.84505684528;攆,-12.0888059349;喑,-12.3889105273;贖,-8.40085283563;锦,-14.6914956203;貫,-8.04640465083;辭,-8.14830345814;測,-7.41079842495;戴,-12.8997361511;康,-10.0375352702;砸,-10.2666489885;钻,-8.36534614718;靠,-8.49607034133;應,-5.56475427223;呐,-9.55864269351;青,-8.79022934114;剔,-9.14827321069;仗,-12.6120540787;苟,-10.5404557144;巡,-8.08416998662;籠,-9.01132301132;罢,-8.45024559096;蹬,-12.4402038217;想,-5.92595907658;绷,-10.9187346822;蘇,-10.5248303965;尋,-6.88683632328;續,-9.88338459035;瞒,-11.8582822763;渗,-8.30545840628;朝,-8.98938120278;紡,-9.56455987054;骤,-9.97747102943;储,-9.00621661724;榮,-9.49576484256;撰,-8.78477230168;耳,-9.73566856273;夹,-8.802617662;吻,-9.76424193518;流,-5.93379058344;賀,-10.6397106725;迂,-10.1697070433;闷,-11.8582822763;兩,-11.3241997903;恳,-9.59162919251;誅,-10.1271474289;肉,-12.4402038217;愈,-9.73919590325;宏,-15.3846428009;飘,-8.36982844962;窥,-9.69766744455;瞧,-8.55484906338;否,-7.96047751985;刪,-8.90000756526;讯,-11.9189068981;喻,-11.4928225028;眼,-8.05161978651;蹂,-10.6841624351;彌,-8.32588464837;協,-6.99596503171;俗,-8.77125858251;杜,-9.89570507474;淫,-11.2257597175;转,-5.18245905464;擱,-9.99101525454;奸,-10.2488443638;谁,-8.46991190817;把,-7.42048708205;碎,-10.8960064312;向,-6.75895401332;攛,-11.0539094606;挟,-10.219856827;簡,-7.08934394139;钦,-9.93790542923;贫,-10.4573891157;努,-11.2737689367;中,-7.07496590491;新,-7.01386362793;強,-6.41599189752;锻,-8.69628808695;窺,-9.69766744455;匿,-11.0539094606;评,-6.82113870661;忌,-9.59162919251;风,-9.06207756097;荟,-10.9419915444;締,-9.29559792545;篤,-11.210255531;瓦,-9.29333291882;適,-6.33060542331;麦,-12.0524382907;罷,-8.45024559096;白,-9.56159690541;銓,-12.7455854713;記,-6.39295607496;悟,-11.1949880589;羡,-9.45771677492;頤,-12.6120540787;玩,-8.99776348153;刨,-13.3052012592;享,-7.18572835591;優,-7.23100531451;容,-8.68268243489;示,-8.47389201293;蹀,-13.4387326518;擇,-9.7715146945;揉,-10.953826002;限,-6.86645010914;達,-5.81613859393;藝,-13.3052012592;捞,-11.1079766819;叩,-8.51770951643;拳,-12.3401203632;懵,-11.7737248882;呼,-7.10367840034;企,-8.11293909401;涂,-9.62890058731;辖,-11.7210811548;誘,-8.60358517496;攝,-8.1577067824;莞,-13.7752048885;颤,-8.73695442733;垦,-10.9073059864;动,-7.01108905968;购,-6.64031403689;嘻,-11.0026161662;摇,-7.41079842495;捉,-9.03201340457;踢,-10.6932949187;虛,-8.82078727436;饥,-13.0820577079;東,-9.1760527748;蛰,-11.0539094606;扳,-10.7695222841;筹,-7.71141967977;登,-6.76941586921;哼,-10.278697327;躁,-11.6710707342;袅,-15.3846428009;律,-13.0820577079;税,-14.2860305122;世,-11.2902982387;舞,-10.1116432423;张,-7.9634652723;夤,-13.5928833317;錨,-13.9983484398;防,-6.41255961804;咽,-10.2606788215;襄,-12.7455854713;拉,-7.08461108911;聊,-9.48200946749;嵌,-10.5248303965;监,-8.41579242255;坐,-6.38034307233;遥,-9.53820402584;獨,-6.55234694145;濫,-9.54109838386;詮,-10.4217981706;并,-6.64686934057;學,-6.80110022893;顺,-8.71641455248;啼,-10.1588961272;丁,-13.5928833317;澀,-14.2860305122;蠅,-13.0820577079;舉,-6.33941294898;授,-7.62417577168;對,-6.11612786487;夏,-12.5514294568;阑,-12.8196934434;熔,-9.32318588196;洗,-7.49293814156;標,-8.73565825087;望,-8.11851402134;感,-5.8429145242;砥,-12.3889105273;伫,-11.0026161662;撲,-9.31621721265;確,-6.02226827306;疼,-10.6224688661;儿,-13.4387326518;歃,-13.0820577079;规,-7.38261798268;籍,-11.5560014044;剩,-7.44548398294;致,-7.24257951779;延,-6.64350637799;寸,-14.2860305122;勾,-8.70128185513;貓,-12.9867475281;渔,-14.2860305122;鐘,-10.4646618751;驚,-7.56862896173;涩,-14.2860305122;谨,-10.6932949187;伪,-9.27761991315;厭,-8.92317462454;爬,-9.18008503832;馱,-11.3773096157;徵,-6.82343272406;机,-9.31390507289;讽,-9.52957087869;派,-7.66996532709;附,-8.36982844962;屈,-9.23831354322;齊,-9.00621661724;濕,-8.24418975779;乔,-12.7455854713;飛,-7.07128084976;睚,-13.5928833317;絞,-10.9187346822;换,-7.68570660108;晤,-12.8196934434;烫,-10.8848331306;班,-10.8307659093;盯,-9.39819079561;啮,-12.3401203632;年,-8.27558066521;拷,-10.5094454777;滿,-6.72716606403;阔,-11.4928225028;吃,-7.24695461592;娇,-11.4528171682;殒,-12.2065889705;輕,-8.72534888121;肠,-12.8997361511;洩,-8.74476696707;倫,-13.5928833317;嘯,-13.3052012592;失,-6.10375077297;碰,-7.87093355305;張,-7.9634652723;憶,-11.9834454192;蠻,-12.7455854713;参,-5.45363736232;雄,-11.1505362963;恋,-9.02161469735;捍,-9.95969278341;晏,-13.3052012592;鉗,-11.5344951992;顛,-8.931017802;矚,-9.82396116988;孝,-9.73919590325;惠,-11.1079766819;注,-5.77411790525;火,-8.91849807666;问,-6.70278298792;声,-8.78613377228;罵,-10.0001477381;黴,-11.3773096157;湿,-8.24418975779;邁,-8.82928590908;閃,-7.93689152084;鏖,-10.9302955046;井,-10.0567666321;演,-6.65072662597;窝,-11.3415915331;质,-7.87805102082;醫,-10.1972569951;个,-10.3874305271;选,-5.95838492269;缴,-8.20457292659;获,-5.83504835092;攸,-11.3773096157;便,-7.24871002889;顆,-14.6914956203;拍,-7.43979608989;佔,-6.43696673839;受,-5.64249839877;駛,-9.08202382515;邻,-8.92317462454;胡,-8.76190647694;矯,-10.2606788215;饰,-11.1361475588;绵,-9.82396116988;送,-6.84061295552;阅,-7.09109328583;瞄,-8.98938120278;舍,-8.62307003209;掌,-7.30999372583;喘,-9.31853471079;宜,-10.2666489885;怡,-12.2936003475;膠,-10.4793680225;攣,-12.5514294568;骚,-9.00113616601;春,-10.8960064312;欧,-12.2065889705;趨,-7.98830750709;報,-6.14445240695;悶,-11.8582822763;褻,-11.3773096157;沾,-9.69428334657;净,-9.26875067541;飆,-9.13659992638;才,-8.77394675617;觐,-10.9187346822;浓,-10.1697070433;諒,-10.1642869758;返,-7.76197884957;南,-9.34438808962;拢,-13.7752048885;淨,-9.26875067541;召,-6.65282221793;铮,-14.2860305122;捷,-13.9983484398;胶,-10.4793680225;摹,-11.2737689367;颇,-9.53244032112;縈,-11.2257597175;趕,-6.97927542466;气,-9.19843417699;化,-7.64050617326;嘘,-14.2860305122;锚,-13.9983484398;採,-5.50105188007;斥,-9.48748893326;劫,-9.81248876871;贪,-8.98106860296;咯,-11.3415915331;覽,-14.2860305122;格,-10.9073059864;病,-8.33973768376;鑄,-8.81937783086;拋,-7.99817195206;职,-10.4793680225;詐,-10.1014390722;慢,-10.6310526098;藥,-15.3846428009;武,-8.05423758905;浪,-9.00113616601;燭,-12.249148585;驰,-9.06747811415;饲,-8.81516138048;专,-7.94097911778;鎖,-9.01989204404;喚,-9.64807050341;墜,-9.64163961308;從,-6.77250313217;挡,-9.07836751394;亨,-12.8196934434;别,-8.62538753023;铆,-12.5514294568;启,-7.18545344181;鬱,-10.9073059864;耷,-10.6751125996;畅,-9.3660495864;哄,-10.0093643932;密,-8.46891935226;手,-7.76197884957;慍,-12.2936003475;背,-7.65578697704;角,-9.92932168554;遗,-8.77260176606;静,-8.45904760378;盘,-7.61695552371;驛,-10.7499138127;荡,-10.0001477381;佩,-9.06747811415;淪,-8.802617662;繳,-8.20457292659;鳴,-10.0519240076;甄,-10.8960064312;明,-6.50364017664;输,-7.03043923797;團,-9.87931126496;夜,-9.85521371338;撥,-8.4261944076;谪,-11.8881352394;携,-8.2601645384;趿,-12.0888059349;區,-8.42429507179;遂,-10.4217981706;啄,-11.8582822763;彈,-8.65960915873;届,-11.3956587543;腌,-11.2737689367;虎,-11.6234426852;法,-11.4143508873;赔,-8.15118738227;雙,-11.6469731826;繞,-8.76456959436;恢,-6.65298359936;量,-8.75000944303;热,-7.93108092925;公,-6.2422601221;孰,-12.6765925998;懷,-7.22269700142;蝸,-12.8997361511;刁,-11.8881352394;备,-8.11293909401;羈,-10.1482008381;耍,-10.4573891157;戡,-13.1874182236;肢,-11.9834454192;誦,-10.1751566481;温,-11.0805777077;侨,-10.7794726149;貪,-8.98106860296;熬,-10.3874305271;唯,-9.13466755863;雲,-9.45771677492;撺,-11.0539094606;贿,-9.62574102702;捋,-13.5928833317;恍,-11.1799501815;酗,-10.7499138127;绞,-10.9187346822;灭,-8.2731306844;飲,-8.36893038041;巴,-9.34438808962;死,-7.07718347388;庇,-10.0375352702;融,-7.74982212315;趑,-15.3846428009;倘,-14.6914956203;錚,-14.2860305122;餞,-10.7499138127;斡,-11.4143508873;患,-8.98604786636;接,-5.38639067191;鞭,-10.2371483241;宵,-12.3889105273;收,-5.39805567919;費,-9.76424193518;挺,-8.95492332285;躋,-10.0863254343;調,-6.64526651926;织,-9.102376054;秉,-9.55864269351;擋,-9.07836751394;腎,-10.7118139664;豐,-9.61320167776;毕,-7.47920115183;神,-9.80869369775;歪,-10.0763751035;短,-9.17404272387;驴,-13.9983484398;泻,-12.0524382907;蹼,-12.8196934434;锁,-9.01989204404;逃,-7.00648181817;包,-5.35012698595;暌,-13.0820577079;憎,-10.0567666321;沐,-9.94656349197;焙,-11.3773096157;傘,-12.0888059349;厚,-11.2902982387;缝,-10.0001477381;挥,-8.09776638914;含,-7.44762531138;讪,-11.9834454192;脹,-11.9189068981;掺,-9.835566716;哀,-9.36119520793;烘,-10.1323693728;络,-11.8582822763;驟,-9.97747102943;擠,-8.54195951865;統,-5.85664901797;醃,-11.2737689367;鋤,-12.3401203632;徇,-11.8881352394;颉,-12.6765925998;覓,-10.0567666321;誕,-8.49403368075;炙,-13.3052012592;报,-6.14445240695;谦,-10.8520433077;訪,-7.95452866233;銳,-10.121952612;細,-8.41861861379;馳,-9.06747811415;搶,-7.59809099446;访,-7.95452866233;镀,-10.7895229508;燃,-8.08282045875;屆,-11.3956587543;奈,-9.54109838386;旋,-8.37162701125;描,-7.17397476973;赐,-10.254744086;蹒,-11.1651350957;廝,-9.13081398932;察,-8.8436128017;臣,-10.5248303965;若,-11.0671546874;遮,-8.52083940944;干,-6.89523199049;惹,-10.153534184;腸,-12.8997361511;添,-9.16206653282;艺,-13.3052012592;吁,-12.3889105273;皂,-12.6765925998;訕,-11.9834454192;紛,-10.5563290636;徜,-12.2936003475;增,-4.43527588634;愣,-9.80114649211;說,-5.29008044657;匯,-7.60392191477;炮,-10.0375352702;就,-6.60770415572;蜷,-10.6932949187;贻,-10.5483608939;軋,-10.4288157433;捏,-10.6055193078;遙,-9.53820402584;无,-5.75034273817;轧,-10.4288157433;畫,-10.4868030009;韬,-13.1874182236;辨,-8.70128185513;劃,-7.18820598966;内,-8.50015614885;安,-6.17971706162;辑,-10.7025115738;渐,-10.0093643932;誓,-11.1361475588;洒,-10.6397106725;圖,-10.532612537;伦,-13.5928833317;褪,-10.7025115738;献,-8.01315350568;破,-6.40296116092;款,-10.2141588059;镂,-11.0941833597;築,-9.25341631141;乐,-9.25995941;衔,-9.51534588776;哗,-10.7596699876;叙,-8.49913313086;壟,-7.92242786112;敢,-9.16008437162;臥,-10.0280565262;翱,-11.3241997903;擷,-12.8997361511;刃,-14.6914956203;將,-10.7596699876;嬉,-10.5094454777;休,-7.21078534612;源,-8.42050718847;訓,-9.71131953372;銘,-11.1079766819;鲜,-10.4217981706;实,-5.07402486093;氧,-8.40642905826;侦,-7.85684881317;親,-8.23237394486;弱,-10.2313512064;網,-10.7025115738;餵,-9.67090999538;架,-8.95492332285;主,-6.93658534831;遴,-11.1505362963;雀,-12.8196934434;煅,-12.249148585;忆,-11.9834454192;等,-6.53512883541;晋,-9.51534588776;潑,-10.9658021931;糜,-10.3740075068;曠,-13.5928833317;叮,-9.38819071227;已,-7.02761836163;購,-6.64031403689;课,-11.8011238624;傅,-15.3846428009;戎,-12.2936003475;云,-9.45771677492;讓,-8.40085283563;疗,-10.3673629641;錘,-11.6710707342;倚,-9.97299674904;掣,-10.6751125996;並,-6.64686934057;垫,-10.953826002;害,-7.67219896662;貽,-10.5483608939;操,-6.37165640854;滑,-8.5778134405;佐,-11.5560014044;務,-9.33255363197;矫,-10.2606788215;彰,-10.7499138127;奴,-10.0963757702;旷,-13.5928833317;鈍,-11.9834454192;熄,-9.52101162529;崇,-8.23159116596;丑,-12.7455854713;沒,-4.35975459806;蠕,-9.78252398001;厘,-12.4402038217;挣,-7.88854545572;急,-8.29206908492;亦,-9.33963748686;讨,-7.2284194777;吭,-9.49023996663;堵,-8.54516636266;速,-10.2606788215;輻,-7.9439090935;涼,-11.9834454192;哂,-12.4402038217;运,-6.77505276021;賒,-11.4528171682;盖,-9.84337925573;竞,-8.11641977973;荣,-9.49576484256;擢,-11.3773096157;赧,-14.2860305122;詩,-14.6914956203;敷,-9.76787170323;批,-6.77104911519;汽,-11.3241997903;待,-9.13466755863;劇,-10.36076228;閉,-8.23472596476;亏,-9.27317546139;外,-8.00750908806;尘,-12.2065889705;两,-11.3241997903;斩,-9.21712631;咳,-8.64294210624;永,-10.2028592506;放,-5.56938554975;私,-9.53531802095;兆,-15.3846428009;呈,-7.30595457166;棋,-12.5514294568;赎,-8.40085283563;荒,-10.6055193078;罚,-9.03375708418;賣,-7.58940787189;止,-8.229246499;噴,-8.03476909615;淹,-9.03375708418;惻,-13.7752048885;揽,-10.7212037068;替,-8.18795623006;切,-7.55461471836;唉,-13.9983484398;踏,-8.93892298151;涎,-12.8196934434;脑,-12.9867475281;排,-6.07500022784;蜕,-10.3347867936;妖,-12.8997361511;猝,-11.0941833597;銜,-9.51534588776;氣,-9.19843417699;订,-8.33019314276;交,-5.87813148907;皴,-12.9867475281;费,-9.76424193518;沸,-9.87121405473;耻,-11.1949880589;押,-9.6841992275;寂,-12.5514294568;黄,-12.1265462629;片,-13.9983484398;准,-6.25724934974;哈,-13.3052012592;慑,-12.6765925998;驗,-9.08202382515;遛,-12.6765925998;滤,-11.0941833597;硫,-10.4079090585;差,-9.58555014643;围,-7.11565459139;恻,-13.7752048885;颁,-7.81008431669;缄,-11.6469731826;瀆,-13.4387326518;钉,-15.3846428009;見,-6.56586463186;認,-4.85254658893;戒,-9.51817474396;蚕,-11.0805777077;算,-7.16585564529;瞟,-12.2936003475;吞,-8.57892024748;涣,-11.1949880589;伤,-8.16573309327;控,-5.85229139614;撩,-10.4148295013;磁,-10.0714368219;構,-6.4497924606;豎,-9.51252501142;惑,-12.5514294568;腐,-8.72663175502;繚,-10.4148295013;勝,-9.31159826679;以,-6.74505500126;潤,-9.96410780162;竭,-11.5560014044;兰,-14.6914956203;割,-8.37342881354;荼,-12.6120540787;禀,-8.32674486348;伏,-9.59468263;憐,-9.59162919251;蔓,-9.13273891773;抒,-9.2150320684;真,-13.0820577079;校,-9.11176579435;弯,-8.64412344129;週,-8.61845108623;阵,-9.81248876871;酵,-13.3052012592;溺,-10.5888522553;蜿,-9.87525446426;繅,-10.4573891157;囊,-10.6397106725;晕,-10.1376187287;緘,-11.6469731826;剝,-7.67309382126;衡,-8.74738476961;惦,-9.94222509037;旨,-8.77934487994;寬,-9.17003470247;歷,-7.62716403431;汹,-10.3157385987;宁,-10.6932949187;稀,-9.40070652021;成,-4.68056721754;搔,-12.165766976;殡,-11.1219629239;谤,-15.3846428009;缮,-11.9506555964;边,-11.7210811548;游,-7.53492904329;芻,-12.9867475281;膽,-10.5888522553;练,-8.6548187304;陈,-8.57009990363;槍,-9.99557107108;行,-6.6778214775;低,-6.67616831131;策,-8.77529355773;忙,-9.66433102429;凝,-8.05751950863;诡,-11.9189068981;代,-7.24228852404;晨,-12.6765925998;布,-7.74307835963;霉,-11.3773096157;皈,-10.0186667859;疊,-9.71131953372;谏,-10.8099318224;澎,-11.0026161662;爛,-11.600453167;順,-8.71641455248;次,-9.57650031091;誠,-10.4079090585;性,-12.2936003475;夭,-10.5171083504;匱,-10.3476901985;阳,-9.87931126496;悼,-11.0279339742;躡,-13.1874182236;繃,-10.9187346822;闊,-11.4928225028;迎,-7.28448135396;晓,-8.21683361658;塗,-9.62890058731;绘,-9.42106345727;鉛,-11.0539094606;酝,-9.15810613161;蹣,-11.1651350957;祭,-8.49403368075;跺,-10.0813378928;約,-8.54302732442;爆,-6.73607053142;渎,-13.4387326518;怒,-9.96410780162;攔,-8.23865833318;弘,-10.5643612353;尚,-8.04575466705;謠,-11.1651350957;蠢,-13.3052012592;沥,-14.2860305122;憧,-10.2371483241;縮,-7.32948506907;励,-13.3052012592;漸,-10.0093643932;显,-5.56448251095;孀,-13.7752048885;糅,-11.9189068981;靈,-11.5779803111;告,-6.09641589026;荐,-11.4528171682;染,-8.98771314568;叛,-8.54945821475;嗟,-11.0671546874;臧,-12.8997361511;扦,-11.0941833597;印,-8.34761518621;石,-11.600453167;遲,-9.68754931439;威,-9.7788407346;简,-7.08934394139;弃,-11.1799501815;嘉,-11.2575084158;贏,-8.88035462736;掐,-10.8960064312;软,-9.83946535641;徘,-9.03725359124;猛,-8.94689115116;瀝,-14.2860305122;农,-10.4217981706;生,-5.83213217118;模,-8.24102519819;愧,-11.5560014044;頭,-9.58252442552;现,-7.15273455733;吵,-9.15810613161;耽,-8.62075789233;浏,-10.7695222841;从,-6.77250313217;扑,-9.31621721265;套,-8.47688752191;竖,-9.51252501142;翘,-10.4573891157;鍛,-8.69628808695;啟,-7.18545344181;淤,-9.55276032361;拦,-8.23865833318;间,-9.44447154817;迸,-10.6661439296;捻,-13.7752048885;賺,-8.73695442733;鐫,-11.040837379;饋,-11.6234426852;嚇,-8.94529242979;醉,-10.1065281417;侍,-8.95653752821;搐,-13.9983484398;崖,-13.7752048885;領,-7.76197884957;犟,-12.8997361511;憩,-12.2936003475;閱,-7.09109328583;傳,-6.16782346282;洶,-10.3157385987;核,-8.25534525196;欺,-8.40270812374;局,-9.22766381531;商,-7.08113800202;燉,-13.9983484398;半,-11.4928225028;乌,-13.0820577079;募,-7.32157988957;煞,-12.0888059349;裣,-13.9983484398;该,-9.51252501142;敦,-10.3220477679;恨,-11.8582822763;端,-9.00452026399;奮,-8.83070939687;鉴,-9.42621810786;赶,-6.97927542466;拿,-7.24520227902;腾,-9.31159826679;儉,-12.4402038217;谋,-8.07208930279;蔑,-10.3740075068;撐,-9.82781473919;礙,-11.6234426852;题,-9.46306438125;定,-6.94692581098;障,-13.0820577079;醞,-9.15810613161;負,-6.89811502379;誤,-8.5778134405;薦,-11.4528171682;禮,-10.1642869758;唱,-8.68884388383;環,-8.53663752632;鑲,-9.46038700348;郵,-10.7895229508;殺,-7.03091015863;嗆,-14.6914956203;煉,-8.73955183139;及,-10.6841624351;救,-7.77626832651;捕,-8.01441215909;呛,-14.6914956203;盜,-8.68760855323;赡,-11.3415915331;虧,-9.27317546139;惨,-9.57350180792;揪,-11.6957633468;铰,-12.4402038217;獵,-10.4573891157;裸,-9.52670964641;摻,-9.835566716;承,-6.1211408808;紀,-8.46991190817;理,-6.43722685024;趋,-7.98830750709;躍,-8.73955183139;尖,-9.91658265976;餘,-9.89570507474;霜,-14.6914956203;逞,-10.5018408783;没,-4.35975459806;丢,-8.52502789724;萦,-11.2257597175;航,-8.13329781752;庭,-10.7212037068;田,-12.5514294568;决,-5.9453358643;秃,-11.9506555964;矇,-11.8011238624;呆,-11.5344951992;先,-8.5063163326;淋,-10.2028592506;削,-8.15843379079;每,-9.67090999538;志,-11.3773096157;飙,-9.13659992638;鏟,-10.6139581764;解,-5.38689106997;此,-13.4387326518;慨,-11.0279339742;续,-9.88338459035;逼,-8.24102519819;却,-7.94861498454;封,-7.79328575419;纂,-11.1219629239;震,-6.46518963232;倉,-11.0539094606;不,-3.84790315782;媚,-14.2860305122;亢,-10.8737832944;认,-4.85254658893;膨,-8.60018573826;席,-10.0375352702;吱,-10.7402519018;皲,-11.9834454192;寄,-8.32073883942;哆,-9.67753253614;测,-7.41079842495;題,-9.46306438125;藐,-10.953826002;糖,-12.8196934434;秘,-12.2936003475;矜,-14.2860305122;象,-7.96586191814;擦,-9.74628813156;壮,-8.94849243252;酒,-11.6234426852;牵,-7.93805770174;觸,-7.99384427916;征,-6.82343272406;厉,-12.2936003475;事,-9.31621721265;焊,-9.66761509949;攒,-11.9506555964;怔,-10.7996753222;粗,-10.7794726149;多,-7.88743557769;掩,-8.12693512373;庫,-13.7752048885;劳,-9.36361945154;買,-6.46907625518;讹,-12.0173469709;肿,-9.57350180792;挾,-10.219856827;滋,-8.8436128017;虐,-10.6224688661;拓,-8.3414828849;联,-5.75644772316;四,-9.42363746127;信,-7.31969190914;绫,-11.4333990823;慪,-12.249148585;屬,-6.93615680749;陰,-9.53531802095;側,-9.01817235316;陨,-12.0888059349;下,-4.54275083624;贍,-11.3415915331;悔,-10.2429792444;師,-9.33963748686;崭,-14.2860305122;疲,-9.97299674904;謹,-10.6932949187;蔽,-11.6957633468;撼,-11.3415915331;飄,-8.36982844962;释,-7.78474084168;村,-14.6914956203;打,-5.19842290563;慕,-11.6710707342;鱗,-14.6914956203;瓜,-9.79739414249;拨,-8.4261944076;困,-9.20049390996;闲,-8.80400366361;諸,-9.21085669699;例,-6.8533494851;規,-7.38261798268;熟,-7.68208668762;传,-6.16782346282;谢,-8.19396676656;耪,-14.6914956203;種,-7.58611974727;隱,-7.84827886249;誹,-10.5971510581;层,-15.3846428009;磅,-12.2065889705;陆,-12.2936003475;午,-10.7695222841;遊,-7.53492904329;赌,-8.73565825087;畜,-12.3889105273;恪,-10.7695222841;积,-7.45731844058;驮,-11.3773096157;醒,-9.19023740979;兴,-6.69114612501;混,-8.06147208295;铁,-11.2415080745;堅,-6.94002030231;涌,-7.77082411608;析,-10.3874305271;撒,-8.89240296587;耕,-8.88485576024;官,-10.8202946094;喜,-6.80203647093;办,-7.21643987066;渡,-8.79847114604;欣,-8.90459823897;夯,-10.4430003783;窮,-10.8960064312;嘱,-8.74476696707;溶,-8.1671993692;遵,-7.83135619529;落,-6.73466849824;繁,-7.39643920387;集,-6.13961118913;郊,-11.9506555964;跌,-7.95571560609;恕,-10.5171083504;狞,-12.2936003475;波,-9.71131953372;补,-6.91517034569;癱,-9.6841992275;铲,-10.6139581764;灵,-11.5779803111;海,-9.3660495864;诸,-9.21085669699;
+B,y:著,-4.68572558273;着,-4.68572558273;罢,-1.34463212513;来,-4.26191133595;便,-4.68572558273;罷,-1.34463212513;來,-4.26191133595;而,-1.08461536847;也,-1.01012839309;哎,-5.37887276329;
+B,z:骇,-7.07618648372;邋,-9.1345746162;随,-6.69222758083;料,-8.98042393637;微,-6.63587464428;黝,-6.48368282894;般,-8.15374536319;方,-7.83529163207;宽,-7.39997356081;齊,-6.59560074514;濕,-5.6482194262;飛,-5.49698845648;軟,-6.0063531596;遠,-5.22255161077;諧,-7.74828025508;緩,-8.28727675581;年,-6.62226899223;闹,-6.54430745076;摸,-8.36138472797;滿,-5.88290896851;娇,-7.46059818263;沈,-5.40487316757;昏,-5.45827394429;疙,-7.88181164771;缕,-6.79919970038;错,-6.7366793434;無,-3.78113795043;悠,-5.51916231397;刷,-8.44142743564;胀,-8.98042393637;参,-6.97509036685;雄,-6.06652168107;俊,-8.44142743564;毒,-10.2331869049;仔,-7.70745826056;顛,-9.54003972431;来,-6.53188493076;浩,-7.88181164771;火,-4.7864495332;罵,-7.34281514697;维,-8.72910950809;凶,-9.1345746162;湿,-5.6482194262;閃,-5.22255161077;順,-7.88181164771;沉,-5.40487316757;上,-7.09769268894;涓,-7.52513670377;井,-9.1345746162;蒙,-6.7366793434;枯,-7.21276201873;逶,-6.8832828176;郁,-6.90098239469;靄,-8.62374899244;釋,-7.42982652396;湊,-9.54003972431;苍,-5.58399983347;潔,-5.2879794161;虚,-7.88181164771;迟,-6.84879664152;胡,-9.82772179676;絨,-10.2331869049;實,-5.40888118897;狭,-5.04023005398;跳,-9.1345746162;绵,-6.13884234265;恶,-5.9918601523;老,-6.02105930699;锃,-7.37098602394;梆,-9.316896173;霏,-8.72910950809;喘,-7.34281514697;皚,-7.83529163207;怡,-8.44142743564;熠,-7.09769268894;鬧,-6.54430745076;爭,-7.2627724393;悶,-7.49234688094;皺,-7.83529163207;精,-7.31541617279;净,-7.55903825544;浓,-6.48368282894;胖,-6.24420285831;轟,-8.52843881263;鳞,-10.9263340854;金,-5.82038861153;淨,-7.55903825544;扭,-8.36138472797;铮,-8.98042393637;惶,-6.70682638025;各,-8.21828388433;堂,-5.4625022804;气,-5.39690499792;甚,-6.19013563704;碧,-5.8637390524;水,-6.64966796641;猶,-7.55903825544;病,-8.36138472797;筆,-5.73894827959;重,-4.7864495332;坎,-9.1345746162;结,-5.8387377502;嘎,-10.9263340854;慢,-5.6482194262;日,-8.62374899244;翩,-8.28727675581;臭,-8.36138472797;恬,-9.316896173;笑,-4.61459927628;黯,-6.30136127215;羞,-7.70745826056;蔥,-6.32116389944;别,-8.52843881263;鬱,-6.90098239469;晴,-10.2331869049;十,-4.83728920998;晃,-7.46059818263;畅,-9.1345746162;密,-5.30593321971;緊,-7.98189510626;絕,-7.23745463132;静,-4.35685266502;连,-5.87647807818;荡,-9.82772179676;狠,-9.82772179676;详,-8.36138472797;瑯,-10.9263340854;矮,-6.84879664152;平,-5.21260127992;绿,-6.66365420839;好,-5.46674857129;匀,-10.9263340854;争,-7.2627724393;疏,-8.62374899244;明,-5.45406341176;團,-9.54003972431;涟,-7.88181164771;疯,-7.42982652396;嘮,-7.7908398695;冷,-5.33534710492;綿,-6.13884234265;渾,-6.21680388412;區,-7.34281514697;婆,-7.03451378732;慌,-6.02105930699;虎,-10.2331869049;毛,-6.4376977157;汪,-6.7366793434;热,-5.19948633784;普,-6.66365420839;扶,-8.09312074137;輕,-4.17289616683;琅,-10.9263340854;薄,-5.76154811151;备,-7.88181164771;踉,-6.67783884338;皎,-6.78319935904;缓,-8.28727675581;葱,-6.32116389944;大,-4.38386212492;温,-6.79919970038;茫,-5.07126216323;支,-10.2331869049;扁,-7.55903825544;烂,-6.66365420839;奇,-9.54003972431;賊,-8.03596232753;恍,-7.01431108;盎,-6.8832828176;体,-8.72910950809;飒,-6.95604217188;拖,-8.52843881263;衝,-6.09802034813;叠,-7.83529163207;幽,-6.07430382151;泪,-6.51961483817;恭,-6.04353216284;巴,-10.2331869049;死,-5.74455053514;滾,-4.77786578951;肃,-10.9263340854;咋,-8.84689254375;融,-7.7908398695;谐,-7.74828025508;颓,-6.50749347763;暗,-8.52843881263;熙,-8.03596232753;錚,-8.98042393637;依,-3.49089606562;区,-7.34281514697;杂,-10.2331869049;神,-7.49234688094;黧,-7.2887479257;歪,-6.53188493076;短,-4.14074644042;深,-8.52843881263;忽,-5.75018435286;璀,-6.72164146604;垂,-7.01431108;服,-8.28727675581;索,-8.09312074137;厚,-5.27384490516;溜,-6.93735003887;連,-5.87647807818;墨,-7.93060181188;含,-7.21276201873;霭,-8.62374899244;脹,-8.98042393637;哀,-7.83529163207;浑,-6.21680388412;習,-7.63049721943;體,-8.72910950809;煙,-9.54003972431;惘,-8.03596232753;擠,-10.2331869049;勤,-8.15374536319;磨,-7.52513670377;良,-7.23745463132;泰,-5.97050702783;时,-8.21828388433;滔,-5.90245356458;昂,-8.62374899244;開,-9.82772179676;笔,-5.73894827959;搖,-5.98469166282;備,-7.88181164771;唠,-7.7908398695;挤,-10.2331869049;本,-10.2331869049;細,-4.35545112309;刺,-6.69222758083;铁,-5.85742988321;時,-8.21828388433;雍,-7.11967159566;結,-5.8387377502;慘,-5.2879794161;绝,-7.23745463132;癢,-10.9263340854;鋥,-7.37098602394;嗫,-9.316896173;鼓,-6.84879664152;可,-6.7366793434;泱,-8.98042393637;干,-5.15801308964;酸,-6.41547457891;炎,-7.2887479257;少,-10.9263340854;朗,-6.56962525874;紛,-7.01431108;丝,-7.74828025508;愣,-8.52843881263;暢,-9.1345746162;別,-8.52843881263;栩,-10.2331869049;蔫,-7.66823754741;昭,-8.84689254375;錯,-6.7366793434;亲,-7.2887479257;活,-5.8387377502;踽,-8.44142743564;滴,-7.21276201873;潇,-7.52513670377;懶,-6.48368282894;绒,-10.2331869049;遙,-6.93735003887;远,-5.22255161077;飞,-5.49698845648;无,-3.78113795043;团,-9.54003972431;古,-8.72910950809;恹,-8.44142743564;繽,-6.93735003887;嘀,-8.03596232753;内,-10.9263340854;漆,-4.79076919435;安,-5.76727878622;战,-6.7366793434;太,-8.84689254375;炯,-6.86589107488;粉,-8.09312074137;破,-7.16513396974;麻,-6.72164146604;勃,-6.54430745076;藍,-7.83529163207;烏,-5.77304249093;乐,-7.11967159566;哗,-7.03451378732;絲,-7.74828025508;悄,-4.37525375039;簇,-7.42982652396;來,-6.53188493076;瘋,-7.42982652396;和,-7.93060181188;怏,-6.8832828176;鲜,-5.59845791664;蠟,-6.84879664152;实,-5.40888118897;蜡,-6.84879664152;骨,-8.21828388433;親,-7.2887479257;怯,-6.62226899223;稳,-7.23745463132;芸,-9.316896173;粼,-8.36138472797;糊,-6.47198678918;等,-6.46042596678;偏,-8.03596232753;淒,-6.40454550838;奕,-8.84689254375;著,-9.54003972431;湛,-7.18866446715;煥,-9.54003972431;蕭,-6.1223130407;蓬,-9.1345746162;詳,-8.36138472797;棒,-10.9263340854;最,-3.43524649189;肅,-10.9263340854;辛,-6.37245719383;通,-4.68216718477;肥,-9.316896173;刮,-9.1345746162;褴,-7.7908398695;喷,-7.55903825544;犹,-7.55903825544;茸,-8.36138472797;贼,-8.03596232753;禿,-10.9263340854;囁,-9.316896173;着,-9.54003972431;參,-6.97509036685;殷,-7.59412957525;响,-7.63049721943;扎,-7.39997356081;滑,-8.15374536319;齐,-6.59560074514;磕,-8.03596232753;奔,-6.41547457891;嫩,-8.15374536319;哭,-6.69222758083;轰,-8.52843881263;闷,-7.49234688094;狹,-5.04023005398;娉,-8.15374536319;脏,-7.7908398695;徐,-8.44142743564;蠕,-9.316896173;暖,-5.24616147641;急,-4.50633915728;紧,-7.98189510626;涼,-7.21276201873;凄,-6.40454550838;细,-4.35545112309;婉,-8.62374899244;裊,-6.34136660676;蹑,-6.63587464428;透,-6.79919970038;遥,-6.93735003887;穩,-7.23745463132;乱,-5.33908542703;長,-4.56330598189;零,-6.95604217188;特,-6.09005217848;轻,-4.17289616683;惺,-9.1345746162;諾,-8.62374899244;脆,-8.98042393637;纏,-9.82772179676;嶙,-7.39997356081;欢,-7.98189510626;两,-6.40454550838;焦,-6.76745100207;熱,-5.19948633784;阴,-6.38303930316;永,-5.23260194663;傻,-6.83198952321;莽,-7.39997356081;惡,-5.9918601523;迅,-7.7908398695;凑,-9.54003972431;啞,-8.21828388433;绯,-6.93735003887;絮,-7.55903825544;灰,-5.20930638402;噴,-7.55903825544;潺,-6.90098239469;颀,-7.46059818263;切,-8.09312074137;踏,-7.49234688094;妖,-9.316896173;粘,-8.21828388433;嘟,-7.66823754741;颠,-9.54003972431;氣,-5.39690499792;客,-7.16513396974;缥,-9.54003972431;嚴,-6.4376977157;岸,-10.9263340854;寂,-6.54430745076;黄,-6.99450845271;哈,-8.03596232753;癟,-9.82772179676;燦,-9.54003972431;顫,-6.02105930699;直,-5.4625022804;樂,-7.11967159566;鱗,-10.9263340854;認,-7.63049721943;嬌,-7.46059818263;舒,-7.31541617279;缤,-6.93735003887;怦,-8.72910950809;瘪,-9.82772179676;朴,-9.54003972431;讷,-7.34281514697;油,-6.01367919969;抽,-8.72910950809;俏,-10.2331869049;酥,-9.82772179676;凛,-6.26289499132;挺,-8.15374536319;哩,-9.54003972431;顶,-10.2331869049;響,-7.63049721943;骂,-7.34281514697;清,-4.64219992436;澄,-7.70745826056;完,-7.37098602394;土,-8.84689254375;严,-6.4376977157;弯,-6.35162310693;冰,-4.70177565615;真,-7.66823754741;蜿,-8.21828388433;秀,-7.74828025508;久,-6.09802034813;胆,-9.82772179676;晕,-7.98189510626;柔,-8.98042393637;滚,-4.77786578951;迤,-6.44899727095;荧,-8.03596232753;摩,-8.21828388433;盪,-9.82772179676;寬,-7.39997356081;软,-6.0063531596;汹,-7.23745463132;腻,-9.82772179676;稀,-5.67406065738;超,-8.52843881263;匆,-3.85221726923;枉,-7.74828025508;嘈,-8.72910950809;鼎,-5.54643673189;儒,-7.05513307452;戰,-6.7366793434;徹,-7.46059818263;常,-9.54003972431;膽,-9.82772179676;逼,-8.21828388433;黃,-6.99450845271;淅,-8.84689254375;彎,-6.35162310693;忙,-7.14214445151;凝,-9.1345746162;停,-10.9263340854;非,-5.04580109903;工,-8.44142743564;層,-6.99450845271;駭,-7.07618648372;硬,-6.55688623296;潮,-9.82772179676;勻,-10.9263340854;灼,-5.68458707037;松,-7.88181164771;如,-6.49551728659;紅,-5.52365670356;暈,-7.98189510626;疊,-7.83529163207;小,-3.85306436797;美,-8.09312074137;挑,-9.1345746162;冒,-7.46059818263;爛,-6.66365420839;隨,-6.69222758083;妥,-9.1345746162;冲,-6.09802034813;庸,-8.36138472797;浅,-6.99450845271;假,-7.7908398695;漠,-6.3312142353;盈,-7.05513307452;懒,-6.48368282894;默,-4.168239581;淚,-6.51961483817;瑟,-6.34136660676;歡,-7.98189510626;闪,-5.22255161077;淺,-6.99450845271;頂,-10.2331869049;醇,-10.2331869049;残,-9.82772179676;怒,-7.66823754741;优,-3.86414245314;皱,-7.83529163207;辣,-8.98042393637;木,-6.66365420839;花,-5.51023368323;瀲,-9.1345746162;濃,-6.48368282894;峥,-7.09769268894;赤,-5.61806638803;遲,-6.84879664152;整,-6.11414973006;潸,-8.52843881263;简,-7.37098602394;雪,-4.91752089999;圓,-5.97050702783;悒,-8.62374899244;模,-6.31121356859;漣,-7.88181164771;嘩,-7.03451378732;累,-6.16416015063;亮,-6.15564946096;拉,-10.2331869049;悲,-7.7908398695;鐵,-5.85742988321;縹,-9.54003972431;羸,-7.93060181188;兇,-9.1345746162;蓊,-8.98042393637;从,-8.72910950809;扑,-7.2627724393;凜,-6.26289499132;黑,-4.31968389923;內,-10.9263340854;嵯,-7.55903825544;痴,-5.6688387134;幹,-5.15801308964;长,-4.56330598189;雾,-6.8832828176;漂,-8.52843881263;醉,-7.66823754741;斑,-5.42916586014;香,-6.58252866358;枝,-10.2331869049;膩,-9.82772179676;纷,-7.01431108;洶,-7.23745463132;凉,-7.21276201873;半,-7.63049721943;乌,-5.77304249093;青,-6.24420285831;煞,-6.25350525097;淡,-4.43409425041;寥,-6.22585371964;敦,-9.1345746162;端,-7.34281514697;瑰,-6.70682638025;洁,-5.2879794161;窄,-7.55903825544;脉,-8.28727675581;茵,-8.62374899244;縷,-6.79919970038;流,-8.98042393637;光,-5.52817138391;烈,-7.88181164771;飘,-7.21276201873;雜,-10.2331869049;泠,-9.82772179676;迢,-7.74828025508;兩,-6.40454550838;惨,-5.2879794161;诺,-8.62374899244;脈,-8.28727675581;頎,-7.46059818263;倾,-8.21828388433;秃,-10.9263340854;呆,-5.51916231397;緋,-6.93735003887;哑,-8.21828388433;痛,-6.81546022126;靜,-4.35685266502;姣,-7.63049721943;孤,-6.18140195707;迷,-6.17274389432;空,-5.13027633466;亂,-5.33908542703;倉,-7.03451378732;洋,-8.03596232753;不,-4.48858243569;碎,-10.2331869049;斐,-7.23745463132;簡,-7.37098602394;綠,-6.66365420839;红,-5.52365670356;訥,-7.34281514697;认,-7.63049721943;霧,-6.8832828176;憨,-9.82772179676;紫,-9.1345746162;頹,-6.50749347763;傾,-8.21828388433;哆,-10.9263340854;低,-7.18866446715;篤,-7.34281514697;瓦,-8.52843881263;恩,-8.84689254375;懨,-8.44142743564;赫,-5.32421526455;仓,-7.03451378732;森,-7.74828025508;呱,-8.28727675581;曲,-6.70682638025;白,-4.89324786363;圆,-5.97050702783;興,-5.92912181167;簌,-6.44899727095;粗,-10.9263340854;多,-5.52817138391;崢,-7.09769268894;馥,-7.52513670377;朦,-6.76745100207;溫,-6.79919970038;優,-3.86414245314;維,-8.72910950809;颯,-6.95604217188;芳,-10.9263340854;樸,-9.54003972431;巍,-5.71139832782;烟,-9.54003972431;习,-7.63049721943;嫣,-8.44142743564;坦,-8.52843881263;陰,-6.38303930316;懵,-8.84689254375;呼,-7.14214445151;熊,-6.27237373527;岌,-10.9263340854;隐,-4.33055357147;焕,-9.54003972431;瀟,-7.52513670377;颤,-6.02105930699;萧,-6.1223130407;猩,-7.16513396974;鮮,-5.59845791664;嘻,-6.93735003887;蒼,-5.58399983347;飄,-7.21276201873;摇,-5.98469166282;释,-7.42982652396;痒,-10.9263340854;汗,-7.70745826056;高,-5.01825114726;虛,-7.88181164771;血,-5.50138406795;自,-7.66823754741;惴,-7.59412957525;哼,-8.72910950809;灿,-9.54003972431;开,-9.82772179676;袅,-6.34136660676;文,-6.75194681553;規,-7.03451378732;皑,-7.83529163207;甜,-6.36198589396;躡,-6.63587464428;缠,-9.82772179676;瘦,-6.07430382151;怪,-7.70745826056;隱,-4.33055357147;层,-6.99450845271;奄,-8.72910950809;勉,-8.09312074137;乖,-7.59412957525;健,-8.98042393637;蓝,-7.83529163207;臟,-7.7908398695;满,-5.88290896851;襤,-7.7908398695;晦,-7.18866446715;快,-6.02105930699;熒,-8.03596232753;僵,-7.14214445151;兴,-5.92912181167;混,-9.82772179676;顺,-7.88181164771;笃,-7.34281514697;殘,-9.82772179676;喜,-6.37245719383;利,-8.72910950809;漫,-6.05113676223;撲,-7.2627724393;溶,-8.28727675581;從,-8.72910950809;规,-7.03451378732;潋,-9.1345746162;跌,-6.47198678918;卓,-7.42982652396;彻,-7.46059818263;翠,-6.66365420839;正,-3.46757139305;勾,-8.84689254375;
+E,ad:极,-2.71450742625;匀,-7.52138672939;肃,-6.55253366743;肅,-6.55253366743;率,-8.95647125468;分,-3.08210247945;厉,-4.87442422027;興,-11.6645214558;開,-3.05712199648;跃,-6.27089390943;明,-9.46729687845;經,-8.2972256258;底,-3.9387500142;气,-11.6645214558;搖,-7.95094938908;力,-3.56012014786;开,-3.05712199648;軟,-10.9713742752;稱,-7.75249845036;诚,-10.0550835434;接,-2.46888871268;愤,-9.71861130673;观,-10.5659091671;身,-11.6645214558;横,-9.87276198656;断,-7.14273287874;劳,-9.26662618299;細,-3.78902216334;决,-4.35664867502;臟,-10.0550835434;斷,-7.14273287874;然,-2.39846259505;脸,-7.36045636258;强,-11.6645214558;膽,-4.90642695136;格,-3.58707430645;便,-4.70797601263;裁,-6.94602258449;着,-7.79332044488;促,-7.65718827055;時,-3.51002128063;礼,-10.9713742752;要,-8.83130811173;穆,-10.2782270947;勉,-7.29507360332;躍,-6.27089390943;配,-10.0550835434;重,-8.2305342513;慌,-7.53738707074;经,-8.2972256258;動,-3.88380056967;意,-5.22517108469;忙,-5.16925589985;略,-6.61466544854;统,-9.87276198656;神,-11.6645214558;闲,-11.6645214558;口,-8.61999901806;面,-3.21453701406;韧,-11.6645214558;巧,-10.5659091671;緩,-8.36868458978;全,-2.46090362957;快,-9.58507991411;苦,-6.98239022866;俭,-9.26662618299;壯,-10.2782270947;奮,-8.52902723986;聲,-4.74187756431;兴,-11.6645214558;闷,-10.9713742752;慨,-6.86050041105;幸,-7.63916976505;勻,-7.52138672939;智,-10.2782270947;狽,-6.80470905142;迫,-11.6645214558;速,-2.91732827226;亂,-9.87276198656;善,-5.8715078474;切,-3.6558232728;儉,-9.26662618299;狈,-6.80470905142;勃,-7.69422954223;式,-2.95654262916;缓,-8.36868458978;杂,-11.6645214558;则,-10.2782270947;猛,-8.44564563092;疚,-10.2782270947;心,-4.95888236093;真,-3.94140136352;实,-3.19820059474;統,-9.87276198656;氣,-11.6645214558;憤,-9.71861130673;胆,-4.90642695136;目,-5.30321897821;利,-4.20403114996;动,-3.88380056967;细,-3.78902216334;累,-10.0550835434;禮,-10.9713742752;弱,-7.00108236167;臉,-7.36045636258;厲,-4.87442422027;閒,-11.6645214558;暴,-9.46729687845;強,-11.6645214558;悶,-10.9713742752;誠,-10.0550835434;確,-3.36997194064;脏,-10.0550835434;理,-8.72008247662;觀,-10.5659091671;狂,-10.5659091671;久,-9.26662618299;皇,-6.61466544854;則,-10.2782270947;密,-4.95156525511;婉,-8.95647125468;烈,-7.3078126291;奋,-8.52902723986;时,-3.51002128063;前,-9.71861130673;韌,-11.6645214558;契,-10.9713742752;称,-7.75249845036;量,-6.92832300739;著,-7.79332044488;遙,-9.09957209832;遍,-3.10025385698;惚,-8.44564563092;雜,-11.6645214558;驟,-7.57017689356;勞,-9.26662618299;衡,-9.02546412617;正,-10.5659091671;決,-4.35664867502;健,-5.84741029582;勤,-9.09957209832;實,-3.19820059474;白,-9.179614806;橫,-9.87276198656;软,-10.9713742752;壮,-10.2782270947;乱,-9.87276198656;声,-4.74187756431;确,-3.36997194064;極,-2.71450742625;惶,-8.52902723986;骤,-7.57017689356;固,-9.179614806;摇,-7.95094938908;遥,-9.09957209832;
+E,an:險,-2.56979748452;颇,-6.54603000961;愎,-7.0481219534;疑,-10.1836161693;琐,-7.18788389578;气,-4.70297724599;妙,-9.49046898877;尬,-9.08500388066;熱,-8.10417462765;傷,-5.65101667618;樸,-10.1836161693;費,-8.3918567001;濁,-9.08500388066;凉,-6.2715931639;浊,-9.08500388066;耻,-10.1836161693;軟,-9.49046898877;淡,-10.1836161693;遠,-7.69870951954;難,-1.90062747659;惧,-3.82750850864;峻,-6.5200545232;恼,-6.1582644786;阔,-7.00556233899;贅,-5.87955107613;貌,-4.81297814121;险,-2.56979748452;頗,-6.54603000961;定,-4.89031134461;氣,-4.70297724599;败,-3.09771470497;动,-8.5741782569;怯,-7.69870951954;微,-5.99396142731;费,-8.3918567001;蠻,-10.1836161693;哀,-5.41293154487;寂,-6.57269825669;狈,-5.75279937049;闊,-7.00556233899;乏,-6.96474034446;道,-9.49046898877;寒,-4.51373524635;愤,-10.1836161693;荡,-4.04373161711;瑣,-7.18788389578;煩,-3.60575481161;毒,-6.00922889944;穷,-5.51078733487;曼,-8.5741782569;适,-6.19463212277;悅,-10.1836161693;怆,-7.29324441144;悍,-6.31241515843;得,-6.05648178429;辛,-9.08500388066;伤,-5.65101667618;愴,-7.29324441144;粹,-10.1836161693;洼,-10.1836161693;朴,-10.1836161693;情,-10.1836161693;慌,-3.96701006825;動,-8.5741782569;赘,-5.87955107613;痛,-9.49046898877;惡,-10.1836161693;全,-1.43293313455;烦,-3.60575481161;热,-8.10417462765;惱,-6.1582644786;慰,-10.1836161693;恶,-10.1836161693;酸,-6.23237245075;狽,-5.75279937049;亂,-10.1836161693;清,-9.49046898877;厄,-7.69870951954;碎,-8.3918567001;丑,-10.1836161693;暖,-3.22042618346;雅,-8.3918567001;猛,-9.08500388066;媚,-6.78241878767;醜,-10.1836161693;感,-8.3918567001;疚,-7.18788389578;憤,-10.1836161693;悦,-10.1836161693;馨,-9.49046898877;茫,-9.49046898877;窪,-10.1836161693;窮,-5.51078733487;生,-2.66067525126;涼,-6.2715931639;难,-1.90062747659;敗,-3.09771470497;远,-7.69870951954;恥,-10.1836161693;苦,-2.5663483557;適,-6.19463212277;盪,-4.04373161711;软,-9.49046898877;蛮,-10.1836161693;乱,-10.1836161693;致,-7.35040282528;懼,-3.82750850864;盾,-2.02538625237;
+E,a:要,-3.28971326336;怀,-10.6547175652;沃,-7.28550785904;茂,-8.36330577281;誕,-8.5614827014;耀,-8.5892622655;閉,-11.1471940503;合,-10.6547175652;舌,-10.6006503439;序,-7.1872470566;耐,-9.40195459671;沓,-9.41795493806;漂,-11.3478647458;阔,-5.9705308389;外,-5.92144737659;近,-7.29511408085;微,-6.89351744952;娜,-10.2869927851;废,-9.32558161793;洞,-9.26842320409;怠,-8.50813672069;虚,-7.31657831951;蔼,-9.18838049642;愦,-10.9060319935;涩,-7.48830530988;谨,-7.26282257621;伪,-8.48249429008;厭,-12.158794962;矫,-13.5450893231;纯,-6.43684518337;靜,-5.19607812493;熱,-5.91559940671;題,-11.599179174;贵,-5.52449017321;嘴,-11.0601826733;犷,-8.74106827837;然,-5.7498543941;方,-7.75512915221;永,-10.0793534203;傻,-11.3478647458;场,-11.0601826733;莽,-9.10243806661;放,-9.05645295337;槁,-10.9801399656;馴,-10.6006503439;谈,-10.7725006009;勇,-7.17347747587;腆,-8.88165022899;藉,-10.0485817616;屈,-9.57479740955;讶,-7.03334399346;珍,-11.7533298539;解,-8.37460532807;经,-7.87176605593;济,-8.58224469285;凑,-8.30334230805;恐,-7.3713032192;诚,-6.60777524188;卒,-10.1111021186;濕,-7.08518486873;纏,-10.1438919414;拗,-8.9703783446;鷙,-11.1471940503;飘,-10.6547175652;话,-7.99601323821;统,-7.63429267906;啞,-8.12013930562;凡,-8.29806525094;遠,-5.43797185235;覺,-6.8999983536;知,-7.96535949712;诧,-8.52780948629;緊,-6.88964897274;煦,-10.5005668854;早,-9.51973763237;周,-10.1111021186;惫,-9.12624871531;齪,-9.6738883122;锐,-6.44341335149;扬,-8.75759758032;滯,-8.66228740052;浮,-9.26842320409;灰,-11.9356514107;溫,-8.61061538997;變,-9.4675518792;腥,-8.25682229241;慨,-7.29126051153;痹,-10.2492524571;飒,-13.5450893231;僻,-7.89611508494;錢,-7.29898255762;滿,-6.04954737922;稔,-10.5493570496;愁,-8.21237052984;吃,-7.67297153363;庄,-8.47618512088;切,-5.56028593337;沈,-6.83213312243;龊,-9.6738883122;湃,-13.5450893231;转,-8.61061538997;脑,-12.8519421425;香,-9.21435598282;观,-5.16922930781;缕,-12.8519421425;戗,-10.837039122;視,-8.88165022899;错,-5.83309281606;浅,-8.73290496773;确,-4.94135153029;芜,-8.62510839728;星,-8.36330577281;铄,-10.6547175652;棱,-13.5450893231;氣,-5.84842224158;客,-10.0485817616;戧,-10.837039122;異,-5.92487455253;瞪,-11.1471940503;芬,-11.7533298539;單,-5.11803968154;失,-9.29659408106;等,-6.22390076637;厲,-8.1837971574;張,-5.44492787617;嚴,-6.50806170842;冶,-11.1471940503;费,-10.9801399656;岸,-10.6547175652;耻,-7.91746820941;贞,-10.2128848129;顸,-11.1471940503;允,-8.47618512088;胀,-13.5450893231;饶,-8.61783563795;寂,-8.30334230805;迷,-9.96157038465;則,-7.78618754923;准,-8.85374144088;祟,-10.4540468697;運,-7.43140714327;俊,-8.46368495812;嫌,-10.711875979;乏,-7.60491807038;旎,-11.0601826733;契,-8.36893959053;惹,-12.158794962;濘,-13.5450893231;寒,-7.70154490607;罕,-10.6006503439;驗,-9.28240944606;俚,-11.599179174;孝,-8.81770150439;癟,-9.93417141046;铮,-10.711875979;惠,-7.93928725681;瑣,-8.46991550787;空,-9.18838049642;来,-13.5450893231;级,-5.82462762851;执,-8.76596582999;懦,-9.26842320409;哨,-10.711875979;火,-7.478981233;忪,-11.2425042301;括,-9.93417141046;癯,-10.837039122;差,-6.8530055806;惰,-9.4675518792;味,-8.48884351776;痒,-8.13791755164;直,-7.31855265382;穷,-8.39759484629;懶,-9.48464631256;絕,-10.1111021186;恻,-11.4656477814;绰,-9.29659408106;譽,-11.7533298539;广,-7.97293529093;邁,-8.6034469005;老,-5.99337710775;樂,-6.27616919491;郁,-6.84929040605;率,-7.64519196952;怆,-9.59384560452;沉,-6.83213312243;見,-5.54139198401;嬌,-13.5450893231;后,-6.11854025071;静,-5.19607812493;經,-7.87176605593;暂,-7.08362114675;朔,-13.5450893231;算,-8.54787704934;怖,-6.83456621365;蒙,-9.80741970482;甘,-11.599179174;虛,-7.31657831951;辟,-9.04527965277;吞,-12.158794962;夠,-6.27060976433;綣,-11.1471940503;伤,-7.28550785904;豐,-12.8519421425;倦,-7.55863731782;驰,-10.5493570496;用,-5.6002426121;損,-11.0601826733;瘪,-9.93417141046;骨,-9.45074476088;謬,-8.28759395108;辯,-10.6547175652;胜,-11.9356514107;足,-4.92227564983;露,-12.4464770344;殘,-9.03422981659;朴,-7.17861887537;讷,-10.1438919414;腴,-9.71644792662;粹,-7.79251668428;离,-9.40195459671;渺,-10.0187287985;便,-5.4301663489;渴,-9.6738883122;裁,-7.95410234259;靡,-8.39759484629;跃,-13.5450893231;讀,-13.5450893231;雅,-6.62047692706;辩,-10.6547175652;哉,-9.63306631768;效,-4.75710592691;始,-5.8939691474;湊,-8.30334230805;苍,-13.5450893231;俏,-8.7248077575;惑,-7.73095879128;腐,-9.11427252426;潔,-6.08230016569;受,-7.14151512517;聖,-7.21893984995;糙,-7.66176693462;祥,-9.12624871531;碎,-7.92831822544;勝,-11.9356514107;譜,-9.41795493806;濟,-8.58224469285;瑞,-9.59384560452;惡,-6.92501611657;少,-7.40305191752;緣,-11.7533298539;强,-6.20037026896;驁,-11.1471940503;潤,-7.36300441639;寧,-7.62083352569;犟,-9.88152767698;噪,-9.50203805527;狭,-9.71644792662;矯,-13.5450893231;惱,-6.79632977561;慰,-7.9503779435;缘,-11.7533298539;绵,-8.80015719474;調,-8.22207934397;恶,-6.92501611657;數,-8.05202787976;智,-7.5996687145;詫,-8.52780948629;響,-13.5450893231;态,-11.0601826733;炼,-9.93417141046;清,-8.27723116404;朗,-6.36959960948;肆,-8.7248077575;钻,-9.76089968919;鈍,-8.3301535655;厌,-12.158794962;式,-7.93561752792;钱,-7.29898255762;頑,-9.50203805527;憐,-8.35213247221;魂,-9.8315172564;顯,-4.10618014317;颖,-7.90318225217;财,-10.1111021186;愛,-6.60971887709;矮,-8.50813672069;訝,-7.03334399346;宜,-6.35743215899;伟,-6.94794362122;撞,-9.38620623975;逆,-12.158794962;唣,-11.2425042301;鬥,-10.0793534203;严,-6.50806170842;群,-10.0485817616;鬧,-6.50630578172;悦,-7.03185921219;涨,-7.44926476067;脫,-8.82659045181;險,-7.22792463636;詳,-8.55465673633;澜,-11.9356514107;週,-10.1111021186;臉,-8.64724952315;劲,-5.59811796541;昵,-10.1438919414;真,-7.30481347793;悶,-7.03632018613;綸,-13.5450893231;儻,-10.9060319935;人,-5.68683514092;爽,-7.32449915301;賴,-10.1777934931;净,-6.17674963679;狂,-6.11438224056;久,-6.06918335374;親,-10.1438919414;菲,-8.92996880626;见,-5.54139198401;克,-10.6547175652;囊,-9.02330074606;前,-7.29898255762;富,-4.81197862547;住,-8.50813672069;灑,-8.26697466387;暢,-6.89869880826;晕,-10.6006503439;柔,-7.09461890096;獗,-8.45749298787;胖,-7.73095879128;慧,-8.61783563795;窘,-10.5005668854;登,-9.41795493806;束,-8.92011650982;泞,-13.5450893231;衡,-5.11084305251;懑,-9.11427252426;散,-7.44926476067;勢,-12.8519421425;烦,-7.10414278247;瑩,-8.26188559437;巨,-8.21721315432;對,-7.22252408318;盪,-8.22696932926;扭,-8.4211253437;杯,-11.4656477814;遂,-10.837039122;骜,-11.1471940503;称,-6.87179135534;鑿,-9.13837007584;捷,-7.15989492411;惶,-8.74929877751;腻,-7.40736226902;固,-6.56687558047;贫,-8.75759758032;使,-9.12624871531;宁,-7.62083352569;稀,-7.96159301432;說,-8.65474019488;超,-8.35770351726;靠,-6.59140511223;妍,-12.8519421425;成,-9.90750316338;适,-5.78206801409;气,-5.84842224158;梗,-13.5450893231;化,-9.37070205321;稚,-8.34659229184;肅,-6.94794362122;力,-5.6879954582;甚,-9.53775613787;怜,-8.35213247221;採,-10.6006503439;稠,-8.7167755858;嚣,-13.5450893231;文,-8.80889087471;梧,-8.93991913712;義,-8.5892622655;鮮,-6.63933604679;娆,-10.0793534203;到,-7.56115304242;簡,-12.8519421425;軟,-6.26646038078;傷,-7.28550785904;徹,-8.82659045181;常,-4.37859635091;骇,-8.62510839728;敞,-8.11136731955;冽,-9.4675518792;值,-9.09074202685;眾,-9.12624871531;证,-8.08125751808;仃,-10.6006503439;逊,-8.2368216257;駁,-13.5450893231;立,-11.3478647458;浊,-7.97293529093;种,-8.791499132;塌,-12.4464770344;瓏,-8.83555912179;低,-5.61632300148;发,-12.158794962;詐,-8.57527602353;廓,-12.158794962;兒,-8.92011650982;規,-7.3588806992;忙,-7.25352018355;乘,-11.9356514107;苛,-9.98974126162;凝,-13.5450893231;遜,-8.2368216257;佞,-13.5450893231;脚,-10.2492524571;廣,-7.97293529093;奢,-10.7725006009;工,-10.9801399656;層,-13.5450893231;惧,-7.65898529165;学,-8.48884351776;矩,-12.8519421425;器,-10.0187287985;贱,-8.25682229241;浪,-9.96157038465;臭,-9.50203805527;偬,-10.6006503439;识,-12.8519421425;緩,-7.00839772551;怒,-7.94297050223;幸,-7.38811033752;勻,-6.80930930886;秽,-7.78303794032;恼,-6.79632977561;松,-5.21398477505;持,-8.91036033488;如,-8.14241194123;頇,-11.1471940503;殆,-10.5005668854;有,-7.50483461183;暈,-10.6006503439;越,-6.60486685399;复,-9.48464631256;碌,-7.61816329713;小,-5.51957293662;美,-5.63156830582;挑,-10.0187287985;易,-4.7397141842;憒,-10.9060319935;畅,-6.89869880826;端,-10.1438919414;弘,-10.4540468697;觉,-6.8999983536;隘,-8.9912124315;娛,-10.4095951072;慮,-7.70444766573;碜,-13.5450893231;順,-7.52406597376;羞,-8.56835558068;深,-6.98123379657;通,-5.17269071659;败,-10.1111021186;適,-5.78206801409;性,-8.80015719474;銳,-6.44341335149;别,-6.18498535012;喪,-7.77053777756;臊,-9.40195459671;垮,-10.9801399656;鬱,-6.84929040605;莹,-8.26188559437;能,-7.68430309964;貴,-5.52449017321;样,-8.4211253437;家,-10.5493570496;庸,-8.28759395108;刻,-6.07886176689;奋,-8.05615159695;达,-5.21615528115;晃,-11.3478647458;懂,-9.10243806661;故,-11.4656477814;蓄,-8.32473349803;假,-7.40952443202;密,-5.55858438455;轉,-8.61061538997;才,-9.57479740955;手,-7.66735354133;當,-5.12926462608;配,-8.39759484629;背,-11.2425042301;集,-6.35516715236;诞,-8.5614827014;卑,-8.80889087471;藹,-9.18838049642;色,-6.63334202285;懒,-9.48464631256;涂,-6.97280678041;跷,-8.18850304843;塗,-6.97280678041;取,-9.53775613787;余,-7.40305191752;默,-6.42707311864;剛,-10.7725006009;风,-9.48464631256;惜,-8.36330577281;荡,-8.22696932926;狠,-8.80889087471;略,-8.55465673633;賤,-8.25682229241;實,-5.04199505607;彩,-6.91837157386;橫,-7.89611508494;淪,-12.4464770344;馋,-10.5493570496;摯,-8.02362840524;發,-12.158794962;危,-8.56835558068;平,-6.01460932786;绿,-9.98974126162;職,-9.57479740955;木,-10.5493570496;相,-9.32558161793;旺,-8.1837971574;好,-4.21830013849;慈,-8.88165022899;蹺,-8.18850304843;匀,-6.80930930886;堂,-10.3262134982;約,-8.6698919999;醇,-9.96157038465;分,-8.16059426032;缈,-9.37070205321;残,-9.03422981659;悍,-8.35213247221;调,-8.22207934397;疏,-7.38811033752;明,-5.14713021961;缺,-7.62351090346;謐,-9.26842320409;倒,-10.1438919414;純,-6.43684518337;冗,-11.2425042301;團,-9.59384560452;烘,-12.158794962;尚,-7.99212973818;條,-7.42040593221;的,-13.5450893231;辣,-7.77989822032;蠢,-8.2075512434;娇,-13.5450893231;鏘,-9.25462988196;蛮,-7.73995435419;在,-10.4540468697;菜,-13.5450893231;花,-10.4540468697;愉,-9.76089968919;進,-5.55113177553;贴,-10.1111021186;冷,-6.68757526056;制,-11.0601826733;韌,-8.1837971574;炽,-10.9060319935;礼,-8.38603402389;綿,-8.80015719474;愴,-9.59384560452;勁,-5.59811796541;象,-7.21003507161;促,-7.14982772499;莊,-8.47618512088;懇,-8.29806525094;穆,-8.19798179239;廉,-7.81824157552;靈,-7.92468845739;轻,-5.62864646298;慌,-7.24430352844;藏,-13.5450893231;乎,-8.86295809598;子,-10.9060319935;廢,-9.32558161793;法,-6.30874998035;錚,-10.711875979;篤,-11.9356514107;遢,-10.0485817616;蕤,-11.9356514107;緲,-9.37070205321;豪,-8.19798179239;惭,-9.40195459671;公,-8.5892622655;路,-11.4656477814;癮,-9.35543458108;详,-8.55465673633;獰,-8.90069842396;秀,-6.02485476663;整,-5.75439329193;懷,-10.6547175652;淨,-6.17674963679;荣,-7.33448924608;读,-13.5450893231;显,-4.10618014317;壽,-8.27723116404;腫,-9.41795493806;简,-12.8519421425;门,-7.80851702563;验,-9.28240944606;善,-6.75386786038;备,-7.0665796809;痺,-10.2492524571;嘉,-9.98974126162;侈,-8.06862577117;耍,-10.4540468697;心,-5.20821968582;麗,-5.59882567952;圓,-9.2410242299;悒,-11.3478647458;练,-6.95616284557;软,-6.26646038078;驳,-13.5450893231;猛,-6.83700523925;森,-9.01248982995;思,-7.13986086507;醜,-13.5450893231;生,-7.18898166241;硬,-6.60874658727;宠,-9.38620623975;圣,-7.21893984995;定,-4.04836772441;采,-10.6006503439;大,-2.70548880375;温,-8.61061538997;疼,-8.00775505609;茫,-7.98056891578;頭,-8.50166420619;熬,-9.01248982995;累,-7.95410234259;亮,-5.7548069424;娱,-10.4095951072;拉,-12.8519421425;饥,-10.711875979;傲,-7.32251305503;縟,-10.2128848129;谬,-8.28759395108;锵,-9.25462988196;说,-8.65474019488;稽,-8.37460532807;警,-8.91036033488;烂,-7.50008400907;獷,-8.74106827837;奇,-6.00075721505;义,-8.5892622655;迈,-8.6034469005;泊,-11.1471940503;恍,-12.4464770344;敏,-7.42919719762;煌,-7.11860086565;体,-4.8717474492;棒,-12.4464770344;展,-9.90750316338;套,-6.56222657164;忘,-9.40195459671;據,-9.50203805527;滞,-8.66228740052;黑,-10.0187287985;建,-5.75687776526;昧,-7.76126414078;內,-11.599179174;苦,-6.58379327719;噩,-12.158794962;白,-6.92102409531;質,-11.0601826733;恭,-9.06775250863;目,-7.83797905836;話,-7.99601323821;點,-12.158794962;佳,-8.68527691874;呵,-13.5450893231;巴,-9.28240944606;酷,-6.62244543163;幹,-8.82659045181;糕,-7.89611508494;死,-8.75759758032;偽,-8.48249429008;懼,-7.65898529165;长,-6.08805723398;級,-5.82462762851;肃,-6.94794362122;异,-5.92487455253;皇,-9.48464631256;言,-11.3478647458;融,-10.3262134982;離,-9.40195459671;疑,-6.66162673669;琐,-8.46991550787;惻,-11.4656477814;暗,-6.46759126954;識,-12.8519421425;妙,-6.29161894042;沛,-7.32848322202;挚,-8.02362840524;功,-4.73806636718;脱,-8.82659045181;闹,-6.50630578172;皮,-7.60228994798;座,-10.1111021186;膩,-7.40736226902;怨,-9.48464631256;貫,-8.92011650982;訥,-10.1438919414;贺,-9.85620986899;安,-5.58023843566;漲,-7.44926476067;康,-5.30946360314;逸,-8.98074113164;費,-10.9801399656;挺,-8.24178441505;談,-10.7725006009;势,-12.8519421425;暴,-7.42040593221;盡,-8.39179772861;胃,-9.80741970482;杂,-5.16257103502;毅,-8.04383111256;鸷,-11.1471940503;淺,-8.73290496773;凉,-6.81646071002;忍,-8.10701001418;苏,-12.8519421425;慎,-5.69498577793;淑,-10.0793534203;短,-8.69305905919;青,-9.40195459671;赖,-10.1777934931;泛,-5.01893639032;博,-8.65474019488;缠,-10.1438919414;募,-6.08402380875;神,-7.96159301432;淡,-6.47521519465;鑠,-10.6547175652;磣,-13.5450893231;形,-13.5450893231;寥,-9.71644792662;旧,-7.36300441639;恨,-8.24178441505;歪,-11.0601826733;俭,-8.61783563795;蹬,-10.837039122;狯,-10.2492524571;奮,-8.05615159695;旱,-6.35970230752;汰,-11.7533298539;想,-12.8519421425;餒,-9.71644792662;寵,-9.38620623975;价,-7.89964242546;澄,-12.158794962;凹,-10.837039122;恸,-9.69494172139;峻,-6.51423184699;熾,-10.9060319935;忽,-12.158794962;幼,-11.4656477814;洁,-6.08230016569;包,-11.1471940503;窄,-6.81885592075;蘇,-12.8519421425;賀,-9.85620986899;儉,-8.61783563795;热,-5.91559940671;殊,-5.11825857177;服,-7.04831433292;續,-4.72542397376;憎,-10.1111021186;辙,-11.7533298539;頓,-9.05645295337;黃,-11.1471940503;記,-11.0601826733;鄙,-8.51465140171;题,-11.599179174;厚,-5.75439329193;溜,-9.43421545893;諧,-6.64335211645;雄,-10.711875979;愚,-11.9356514107;猥,-12.8519421425;丧,-7.77053777756;润,-7.36300441639;風,-9.48464631256;视,-8.88165022899;榮,-7.33448924608;由,-5.09339511392;煉,-9.93417141046;耳,-8.05615159695;行,-5.6620199718;縷,-12.8519421425;脹,-13.5450893231;殺,-10.3262134982;朽,-8.05202787976;憾,-7.08989075976;流,-7.71320684582;哀,-8.73290496773;混,-9.8315172564;瘠,-8.89112897295;光,-9.88152767698;烈,-4.53259031958;瑋,-13.5450893231;究,-11.7533298539;轍,-11.7533298539;軌,-10.6547175652;野,-9.40195459671;浑,-12.158794962;道,-7.40520477088;索,-8.82659045181;单,-5.11803968154;拔,-8.78291538831;虎,-9.01248982995;妥,-7.34458014906;揚,-8.75759758032;漠,-8.18850304843;絡,-9.80741970482;擠,-7.84130684845;決,-9.71644792662;勤,-7.73095879128;湧,-11.0601826733;嗦,-10.1777934931;煩,-7.10414278247;惨,-7.52406597376;豫,-6.74826560483;迫,-7.40090368898;良,-5.8826215079;統,-7.63429267906;泰,-13.5450893231;恳,-8.29806525094;毒,-8.25178449838;姿,-9.51973763237;限,-5.6887697517;时,-7.40305191752;蝕,-10.6006503439;曼,-11.3478647458;穿,-11.2425042301;體,-4.8717474492;鲁,-8.92011650982;渾,-12.158794962;昂,-7.86833552084;敬,-7.40520477088;遥,-8.81770150439;舊,-7.36300441639;躍,-13.5450893231;笨,-9.25462988196;宏,-10.2128848129;尬,-6.99115591908;唐,-7.8020861353;飄,-10.6547175652;窕,-10.2128848129;肯,-10.0793534203;得,-6.43848318538;尖,-9.16306268843;備,-7.0665796809;餘,-7.40305191752;驚,-6.99830391234;刚,-10.7725006009;蜜,-8.26188559437;薄,-6.85673460916;財,-10.1111021186;素,-7.78303794032;睦,-9.28240944606;挤,-7.84130684845;戰,-9.37070205321;碩,-8.80889087471;横,-7.89611508494;本,-3.78443341968;络,-9.80741970482;沱,-11.0601826733;細,-5.9011273741;决,-9.71644792662;德,-9.31098281851;澈,-8.1289889209;点,-12.158794962;脸,-8.64724952315;似,-5.72464980784;瀾,-11.9356514107;焦,-9.22760120957;面,-7.50960789058;燃,-9.76089968919;時,-7.40305191752;魄,-9.22760120957;过,-7.48830530988;私,-8.6034469005;奈,-9.34039670371;削,-8.76596582999;過,-7.48830530988;哑,-8.12013930562;結,-6.50718335966;動,-5.01005621356;脏,-8.36893959053;俗,-6.42626307404;愧,-7.86150955577;慘,-7.52406597376;痛,-6.42545368509;颯,-13.5450893231;绝,-10.1111021186;作,-9.96157038465;塞,-10.5005668854;懣,-9.11427252426;癢,-8.13791755164;忧,-11.1471940503;錯,-5.83309281606;全,-6.96722796538;淫,-9.57479740955;婪,-7.88909751229;续,-4.72542397376;漓,-12.8519421425;華,-6.31307899144;格,-10.6006503439;数,-8.05202787976;干,-8.82659045181;執,-8.76596582999;磨,-8.6034469005;價,-7.89964242546;酸,-7.8280616217;闻,-9.73842683333;猾,-8.29281589506;份,-10.837039122;寿,-8.27723116404;門,-7.80851702563;亂,-5.64371196931;洋,-12.158794962;準,-8.85374144088;後,-6.11854025071;独,-7.6424559897;向,-8.4391438492;驯,-10.6006503439;众,-9.12624871531;岖,-8.32473349803;崛,-10.6547175652;媚,-7.8479958366;望,-6.27269093053;瘾,-9.35543458108;綠,-9.98974126162;亢,-8.90069842396;別,-6.18498535012;朧,-6.75050274223;沦,-12.4464770344;怩,-10.1111021186;憨,-11.3478647458;紫,-9.76089968919;窪,-8.12013930562;中,-8.11574369415;顽,-9.50203805527;振,-8.08550380896;谱,-9.41795493806;新,-5.41120843516;亲,-10.1438919414;感,-6.26646038078;強,-6.20037026896;活,-6.04345486522;丽,-5.59882567952;黴,-7.73095879128;豁,-11.0601826733;穎,-7.90318225217;囂,-13.5450893231;艷,-7.35682520002;均,-4.22921844992;偉,-6.94794362122;懈,-9.02330074606;饞,-10.5493570496;態,-11.0601826733;捏,-10.2492524571;职,-9.57479740955;屑,-11.3478647458;裸,-9.38620623975;遙,-8.81770150439;秘,-6.25958277458;敛,-10.2492524571;譎,-9.48464631256;矜,-11.2425042301;损,-11.0601826733;污,-11.0601826733;珑,-8.83555912179;邃,-8.51465140171;团,-9.59384560452;古,-12.158794962;爛,-7.50008400907;虐,-11.4656477814;聩,-10.5005668854;赫,-8.2823991342;约,-8.6698919999;黠,-9.38620623975;结,-6.50718335966;魯,-8.92011650982;壮,-6.81765759825;腳,-10.2492524571;曲,-10.5493570496;湿,-7.08518486873;坷,-8.6698919999;羨,-13.5450893231;幽,-9.71644792662;漫,-7.34864519531;馨,-8.33560317026;极,-7.44701504094;一,-6.52847963921;邪,-9.13837007584;内,-11.599179174;圆,-9.2410242299;厉,-8.1837971574;興,-5.41473577567;事,-7.4336219836;惘,-8.86295809598;同,-3.53342023772;洒,-8.26697466387;贯,-8.92011650982;粗,-11.2425042301;战,-9.37070205321;远,-5.43797185235;多,-7.15149856915;喝,-10.1111021186;悟,-11.0601826733;羡,-13.5450893231;爱,-6.60971887709;劣,-6.93304828827;楚,-5.00496116041;冥,-9.6738883122;貧,-8.75759758032;记,-11.0601826733;玩,-9.50203805527;暫,-7.08362114675;理,-5.18595443635;断,-7.81824157552;听,-7.86150955577;傯,-10.6006503439;丰,-12.8519421425;劳,-6.58949671471;悲,-7.97293529093;場,-11.0601826733;容,-7.46974329202;樸,-7.17861887537;麻,-9.6738883122;致,-5.12198705509;綽,-9.29659408106;開,-11.2425042301;肿,-9.41795493806;款,-11.9356514107;濁,-7.97293529093;陀,-11.0601826733;勃,-8.4034257666;顶,-13.5450893231;扈,-9.15064016843;纶,-13.5450893231;藍,-10.0187287985;難,-6.50630578172;像,-9.00179454083;华,-6.31307899144;忑,-9.48464631256;乐,-6.27616919491;拓,-11.0601826733;慢,-6.0996717664;達,-5.21615528115;長,-6.08805723398;盛,-5.94368698852;慚,-9.40195459671;着,-7.16666313945;信,-7.17518834028;韵,-9.40195459671;敢,-7.07428981932;燥,-6.34541097741;胧,-6.75050274223;坦,-6.94385920438;科,-11.599179174;落,-7.99601323821;盈,-8.30864736027;武,-8.01963638397;闭,-11.1471940503;禮,-8.38603402389;壯,-6.81765759825;据,-9.50203805527;忱,-11.599179174;晰,-6.51334806434;雜,-5.16257103502;舒,-11.7533298539;闲,-8.3301535655;叹,-9.76089968919;竭,-10.4540468697;绻,-11.1471940503;难,-6.50630578172;誠,-6.60777524188;韧,-8.1837971574;省,-12.158794962;蚀,-10.6006503439;斂,-10.2492524571;來,-13.5450893231;駭,-8.62510839728;下,-6.77659611146;憊,-9.12624871531;和,-5.60095183199;透,-8.6698919999;恬,-12.4464770344;閒,-8.3301535655;愕,-8.85374144088;险,-7.22792463636;折,-6.87813253068;规,-7.3588806992;鲜,-6.63933604679;益,-7.4336219836;实,-5.04199505607;樣,-8.4211253437;戚,-10.1438919414;谐,-6.64335211645;袤,-9.45074476088;谧,-9.26842320409;爆,-6.56780798147;动,-5.01005621356;牢,-10.711875979;怯,-7.6288872605;玮,-13.5450893231;弱,-5.57676982309;稳,-5.79404420513;悴,-8.19323118963;鑽,-9.76089968919;羶,-10.5493570496;謹,-7.26282257621;主,-5.75150251973;搞,-11.3478647458;蔽,-7.32648920341;蒼,-13.5450893231;稱,-6.87179135534;糊,-6.70347384663;轨,-10.6547175652;歉,-8.53445402901;遍,-8.4034257666;陋,-7.49300015418;獪,-10.2492524571;趣,-6.81407122262;潑,-7.36714520905;对,-7.22252408318;淒,-10.711875979;走,-11.0601826733;著,-7.16666313945;闊,-5.9705308389;高,-4.5835949998;湛,-8.23188334406;腦,-12.8519421425;敝,-9.35543458108;寞,-7.48363240418;条,-7.42040593221;曠,-8.77440469864;輕,-5.62864646298;闢,-9.04527965277;奥,-8.93991913712;运,-7.43140714327;派,-7.83466230573;穢,-7.78303794032;当,-5.12926462608;息,-9.43421545893;灼,-8.93991913712;重,-4.13499685927;困,-6.87179135534;艳,-7.35682520002;已,-8.02362840524;極,-7.44701504094;质,-11.0601826733;国,-6.38502011551;幻,-9.76089968919;出,-5.27073231635;泼,-7.36714520905;顿,-9.05645295337;躁,-6.82125688228;开,-11.2425042301;悅,-7.03185921219;嶇,-8.32473349803;嘆,-9.76089968919;誉,-11.7533298539;嬈,-10.0793534203;渥,-11.4656477814;洌,-12.4464770344;福,-6.20620118927;憂,-11.1471940503;遽,-9.88152767698;饒,-8.61783563795;斗,-10.0793534203;帖,-9.35543458108;脆,-7.98056891578;辛,-8.59632943273;瀚,-9.71644792662;钝,-8.3301535655;甜,-8.45749298787;熟,-5.53042295264;张,-5.44492787617;傥,-10.9060319935;愤,-7.22252408318;看,-6.96168010095;瘦,-7.91029971994;助,-10.6006503439;挨,-10.6547175652;堪,-10.2492524571;熳,-12.158794962;種,-8.791499132;暱,-10.1438919414;霉,-7.73095879128;害,-6.07714699082;谲,-9.48464631256;悵,-8.94996947297;头,-8.50166420619;斷,-7.81824157552;纵,-10.4540468697;狞,-8.90069842396;洼,-8.12013930562;缓,-7.00839772551;戾,-9.73842683333;仁,-11.0601826733;杀,-10.3262134982;层,-13.5450893231;情,-5.80660120061;觀,-5.16922930781;嗇,-9.28240944606;翠,-10.1111021186;勉,-9.93417141046;貞,-10.2128848129;聊,-8.13344327125;响,-13.5450893231;般,-3.79504436781;量,-7.89964242546;沌,-8.12455432383;滑,-7.06504476118;齐,-6.98831096695;飢,-10.711875979;裕,-6.22854114592;蠻,-7.73995435419;拙,-8.43310153475;存,-9.15064016843;进,-5.55113177553;練,-6.95616284557;蓝,-10.0187287985;膻,-10.5493570496;臟,-8.36893959053;满,-6.04954737922;笑,-7.40090368898;口,-7.72797816314;蕪,-8.62510839728;奧,-8.93991913712;巧,-6.88579540342;晦,-9.2410242299;嫩,-7.61019512749;獨,-7.6424559897;快,-5.57676982309;髦,-8.57527602353;峭,-7.88909751229;啬,-9.28240944606;眼,-6.61851228988;彰,-11.599179174;醒,-6.81168743127;僵,-10.7725006009;兴,-5.41473577567;旷,-8.77440469864;狹,-9.71644792662;學,-8.48884351776;韻,-9.40195459671;顺,-7.52406597376;恥,-7.91746820941;凿,-9.13837007584;找,-9.50203805527;瘁,-11.7533298539;澀,-7.48830530988;笃,-11.9356514107;怅,-8.94996947297;妄,-9.00179454083;隆,-9.16306268843;守,-6.92235299916;國,-6.38502011551;馳,-10.5493570496;名,-4.74061413926;涌,-11.0601826733;意,-6.48977647977;丑,-13.5450893231;聞,-9.73842683333;怕,-6.40384420075;洗,-12.8519421425;暖,-8.01963638397;则,-7.78618754923;板,-8.46368495812;弛,-7.76126414078;悚,-10.1111021186;吝,-10.3670354928;喜,-6.88579540342;够,-6.27060976433;垠,-10.4540468697;欣,-9.85620986899;疚,-8.1289889209;急,-5.41945833463;憤,-7.22252408318;紧,-6.88964897274;度,-6.11854025071;利,-5.03754250874;末,-10.6547175652;身,-8.86295809598;證,-8.08125751808;窮,-8.39759484629;縱,-10.4540468697;速,-8.92996880626;庶,-8.66228740052;聵,-10.5005668854;鼻,-9.25462988196;確,-4.94135153029;尽,-8.39179772861;涼,-6.81646071002;儿,-8.92011650982;痴,-12.158794962;繁,-6.24057337664;激,-9.20128390125;蹊,-10.5005668854;凄,-10.711875979;馁,-9.71644792662;细,-5.9011273741;婉,-8.12455432383;诈,-8.57527602353;惊,-6.99830391234;籍,-11.2425042301;缛,-10.2128848129;頂,-13.5450893231;虑,-7.70444766573;俐,-8.91036033488;硕,-8.80889087471;敗,-10.1111021186;牙,-12.158794962;变,-9.4675518792;惚,-8.38030334918;彻,-8.82659045181;慟,-9.69494172139;勞,-6.58949671471;碧,-10.837039122;忠,-9.98974126162;正,-6.53839409627;健,-6.47776947445;赧,-11.0601826733;穩,-5.79404420513;聽,-7.86150955577;貼,-10.1111021186;草,-9.93417141046;齊,-6.98831096695;乱,-5.64371196931;黄,-11.1471940503;哲,-12.8519421425;灵,-7.92468845739;怪,-7.369222053;起,-8.05202787976;延,-12.4464770344;特,-5.8667629666;寸,-9.98974126162;佻,-10.1777934931;闷,-7.03632018613;命,-8.84460895731;淼,-10.9801399656;
+E,b:要,-1.61184063239;專,-9.14320006914;舌,-12.362075894;抗,-12.362075894;料,-9.14320006914;微,-8.57788626009;宝,-8.08540977499;造,-6.291338166;礦,-7.62587744561;輪,-10.416165745;般,-11.6689287134;然,-4.54445045095;方,-7.16911904312;吸,-9.47170413611;场,-8.89633999121;线,-6.6683437552;派,-6.3557227344;反,-7.79772770254;牌,-7.06375852746;科,-8.60087577831;濕,-8.86556833254;織,-6.79373139025;飛,-11.6689287134;统,-9.27103344065;遠,-7.33163797261;瓣,-9.18402206366;烫,-10.7526379816;班,-10.9757815329;年,-9.10397935598;其,-12.362075894;绿,-7.01021776053;的,-6.28903135991;妆,-11.2634636053;個,-3.31472515052;谓,-7.89616777535;列,-5.63944609915;错,-11.2634636053;無,-7.71768499486;密,-7.90772859775;張,-9.36634362045;蒸,-12.362075894;頻,-6.52143423663;视,-6.1257063038;寒,-6.73445478032;留,-10.059490801;来,-6.1676705029;触,-10.2826343523;火,-7.5337621567;声,-7.88473907953;秒,-11.2634636053;湿,-8.86556833254;上,-7.81878111174;后,-7.20878429951;频,-6.52143423663;經,-5.76356686539;底,-8.75115798136;质,-4.89871284849;醫,-12.362075894;个,-3.31472515052;足,-10.5703164248;紋,-8.5119282923;篇,-6.4458738314;受,-9.10397935598;譜,-9.27103344065;濟,-9.6540256929;属,-6.6417641174;机,-4.92900054511;棱,-8.60087577831;饰,-9.96418062121;号,-7.44209496818;智,-8.99478006402;节,-9.47170413611;领,-8.92808868952;饭,-9.87716924422;戍,-8.4702555959;肖,-8.2845384501;冠,-9.96418062121;术,-9.6540256929;讼,-10.9757815329;际,-6.25505300626;裆,-10.2826343523;珍,-6.91533852234;克,-12.362075894;車,-7.39226259443;前,-7.08396123478;幕,-8.99478006402;編,-9.6540256929;卷,-8.89633999121;胶,-11.6689287134;导,-6.69911541387;使,-11.6689287134;砂,-10.7526379816;化,-8.31902462617;妝,-11.2634636053;義,-6.24177847506;分,-9.36634362045;箱,-10.9757815329;亲,-8.33672420327;水,-6.44857288837;格,-10.9757815329;貿,-9.87716924422;浊,-11.6689287134;重,-5.7169849245;职,-7.58295240089;译,-9.31755345628;難,-8.72448973428;日,-6.34105254466;绳,-12.362075894;銀,-8.75115798136;載,-6.10249442994;专,-9.14320006914;岔,-9.52886254995;耗,-9.47170413611;优,-7.09421773494;蔥,-6.74167502829;额,-5.27868804638;狀,-6.90249037986;臂,-10.059490801;识,-10.9757815329;手,-6.98679748632;背,-10.059490801;角,-8.72448973428;海,-8.99478006402;補,-7.42760196088;實,-10.1648513167;彩,-7.28067152902;平,-6.49844471841;職,-7.58295240089;在,-5.22320889406;相,-7.34479605719;压,-8.23494150896;條,-9.6540256929;夜,-6.56601814324;务,-5.12286092023;禧,-10.416165745;冷,-8.75115798136;制,-6.32420497408;携,-8.77855695555;礼,-9.18402206366;區,-7.33163797261;铅,-10.1648513167;友,-12.362075894;届,-6.91965818348;藏,-11.6689287134;法,-5.39040728928;毛,-8.2845384501;裝,-6.45127924997;轨,-7.59990195921;热,-11.2634636053;公,-11.2634636053;普,-7.39226259443;扶,-8.60087577831;读,-8.5119282923;壽,-10.7526379816;善,-10.7526379816;备,-6.60633368042;倍,-9.58948717177;弓,-11.2634636053;资,-8.72448973428;肢,-10.5703164248;营,-4.85219283285;大,-4.17283136827;温,-8.5119282923;腳,-11.6689287134;皮,-8.83571536939;状,-6.90249037986;义,-6.24177847506;敏,-8.77855695555;体,-5.98534894611;點,-10.7526379816;繩,-12.362075894;陽,-9.18402206366;質,-4.89871284849;目,-10.9757815329;棲,-6.32420497408;巴,-11.2634636053;死,-10.1648513167;融,-7.85121638749;写,-8.77855695555;接,-5.32680729473;产,-5.30849016681;綱,-11.6689287134;梳,-8.99478006402;逸,-9.066239028;区,-7.33163797261;羽,-9.02987138383;帼,-9.41763691484;夾,-12.362075894;杂,-8.45005288858;织,-6.79373139025;壓,-8.23494150896;齒,-8.86556833254;燙,-10.7526379816;面,-5.13078888968;表,-8.6485038273;腮,-11.2634636053;深,-6.23739250311;選,-8.14256818883;系,-5.84884578309;抄,-9.22658167808;變,-9.87716924422;圍,-10.7526379816;檔,-5.99560544627;厚,-10.1648513167;缝,-8.86556833254;府,-8.2845384501;訟,-10.9757815329;黄,-6.2959678039;片,-8.83571536939;墨,-9.72301856439;秆,-10.7526379816;農,-7.48687857081;緯,-6.62550359653;術,-9.6540256929;體,-5.98534894611;煙,-9.14320006914;機,-4.92900054511;遣,-7.96762673933;左,-8.77855695555;副,-7.18592616143;統,-9.27103344065;毒,-9.02987138383;时,-4.13898534284;类,-5.47963842301;载,-6.10249442994;溫,-8.5119282923;搖,-8.11358065196;備,-6.60633368042;薄,-9.72301856439;本,-6.0723603231;环,-7.52579398705;細,-9.10397935598;点,-10.7526379816;品,-7.31221988676;燃,-7.68924705954;時,-4.13898534284;屆,-6.91965818348;姓,-7.33819537316;孔,-7.44942100827;作,-10.5703164248;察,-6.6126829081;類,-5.47963842301;干,-11.6689287134;價,-9.41763691484;典,-5.47656622397;份,-6.25505300626;寿,-10.7526379816;門,-9.58948717177;候,-8.5119282923;丝,-11.6689287134;榨,-10.7526379816;錯,-11.2634636053;谱,-9.27103344065;纲,-11.6689287134;總,-8.45005288858;直,-12.362075894;元,-7.38534215159;九,-11.2634636053;远,-7.33163797261;飞,-11.6689287134;无,-7.71768499486;古,-11.2634636053;畫,-12.362075894;女,-11.6689287134;银,-8.75115798136;翼,-9.96418062121;飾,-9.96418062121;极,-9.10397935598;劃,-10.059490801;内,-7.5337621567;稈,-10.7526379816;徑,-7.51788880755;战,-6.68532209174;脚,-11.6689287134;劣,-9.79712653654;產,-5.30849016681;貧,-8.96087851234;場,-8.89633999121;款,-7.31865077709;資,-8.72448973428;藍,-7.29948086098;乐,-10.416165745;托,-8.33672420327;食,-9.066239028;车,-7.39226259443;審,-9.47170413611;闭,-8.26773133178;絲,-11.6689287134;任,-6.08731387276;宗,-7.35144059991;來,-6.1676705029;和,-12.362075894;源,-8.2845384501;飯,-9.87716924422;鲜,-9.6540256929;实,-10.1648513167;氧,-8.25120202983;辦,-8.12796938941;親,-8.33672420327;设,-9.36634362045;等,-4.33950694702;畏,-10.416165745;条,-9.6540256929;酥,-10.2826343523;擬,-7.48687857081;息,-5.46134522996;極,-9.10397935598;幻,-9.47170413611;出,-9.87716924422;桿,-10.2826343523;踪,-9.47170413611;型,-2.98292144859;供,-11.6689287134;带,-9.52886254995;害,-9.066239028;头,-6.17792700307;喷,-9.79712653654;銹,-8.45005288858;界,-7.04395590016;量,-6.96844834765;黑,-8.18768862411;粹,-7.3784692723;棕,-9.52886254995;務,-5.12286092023;进,-11.2634636053;盡,-10.9757815329;口,-10.1648513167;了,-10.9757815329;國,-5.59819098544;名,-8.83571536939;意,-8.09939601696;暖,-9.14320006914;则,-11.6689287134;急,-8.83571536939;度,-7.11505182185;斬,-11.6689287134;銮,-12.362075894;鼻,-11.6689287134;尽,-10.9757815329;细,-9.10397935598;变,-9.87716924422;襟,-9.72301856439;述,-3.67261148165;页,-10.9757815329;長,-7.67994466688;批,-8.83571536939;籽,-10.2826343523;禁,-8.89633999121;謂,-7.89616777535;羅,-8.89633999121;閉,-8.26773133178;合,-7.70811554385;外,-6.00944649769;斩,-11.6689287134;熱,-11.2634636053;褶,-10.5703164248;强,-7.20878429951;放,-8.60087577831;私,-8.11358065196;血,-8.60087577831;魂,-8.75115798136;蹄,-9.96418062121;勇,-8.86556833254;经,-5.76356686539;济,-9.6540256929;金,-8.08540977499;浮,-10.5703164248;灰,-8.75115798136;噴,-9.79712653654;针,-8.96087851234;验,-10.416165745;香,-9.02987138383;視,-6.1257063038;粘,-9.87716924422;星,-9.14320006914;餡,-12.362075894;交,-5.77452587918;总,-8.45005288858;组,-12.362075894;則,-11.6689287134;准,-9.87716924422;驗,-10.416165745;號,-7.44209496818;级,-3.24056673574;共,-4.50073409841;味,-9.87716924422;史,-10.9757815329;围,-10.7526379816;樂,-10.416165745;率,-6.78992186183;锈,-8.45005288858;導,-6.69911541387;划,-10.059490801;算,-9.6540256929;栖,-6.32420497408;业,-5.6215565344;龄,-7.24408208159;控,-6.44318203973;用,-4.35337771102;油,-10.5703164248;贸,-9.87716924422;效,-6.04130759976;始,-10.416165745;勝,-8.4908748831;襠,-10.2826343523;緣,-9.18402206366;腰,-9.87716924422;色,-4.83428190628;篷,-9.14320006914;顶,-8.45005288858;击,-6.88143697066;矿,-7.62587744561;鑾,-12.362075894;頁,-10.9757815329;清,-6.05215761578;径,-7.51788880755;式,-4.08288611681;袖,-8.86556833254;愛,-7.03906591487;初,-6.21789025988;真,-7.77710841534;校,-7.44209496818;險,-12.362075894;設,-9.36634362045;期,-3.28070590333;人,-4.8598894074;久,-6.69564920589;膠,-11.6689287134;處,-9.36634362045;字,-9.6540256929;束,-9.066239028;衡,-10.059490801;门,-9.58948717177;歷,-12.362075894;建,-8.41083217542;链,-9.47170413611;言,-7.91942463752;射,-7.94323528621;残,-12.362075894;砌,-8.43025026128;成,-6.57211572311;力,-7.19159189897;級,-3.24056673574;管,-11.6689287134;戰,-6.68532209174;边,-6.74894778762;常,-5.00197192102;值,-12.362075894;眾,-8.31902462617;黃,-6.2959678039;立,-5.56973146654;种,-5.59588417935;行,-5.32504827932;低,-7.65254569269;发,-6.83662295487;兒,-11.2634636053;針,-8.96087851234;寡,-9.87716924422;代,-7.35812958806;纺,-6.87727896052;層,-5.94208096586;烧,-8.39178398045;器,-10.5703164248;糯,-11.2634636053;轮,-10.416165745;紅,-5.59588417935;历,-12.362075894;有,-2.9776141618;程,-5.75542570781;小,-4.10080774343;易,-8.62440627572;殖,-8.80672783252;幅,-7.43482220885;创,-12.362075894;次,-6.23520670989;性,-3.97453591082;辮,-12.362075894;阳,-9.18402206366;电,-6.6190727062;样,-8.26773133178;家,-8.01827047215;张,-9.36634362045;燒,-8.39178398045;余,-6.47043168218;付,-11.2634636053;鉛,-10.1648513167;線,-6.6683437552;胜,-8.4908748831;雨,-10.7526379816;業,-5.6215565344;寶,-8.08540977499;役,-6.30529188078;頂,-8.45005288858;爆,-9.10397935598;宋,-8.96087851234;碍,-8.86556833254;缘,-9.18402206366;辣,-9.72301856439;木,-10.5703164248;梭,-12.362075894;花,-8.03134255372;進,-11.2634636053;纹,-8.5119282923;缸,-9.41763691484;炽,-11.2634636053;心,-6.63849079205;組,-12.362075894;續,-9.02987138383;染,-8.75115798136;寫,-8.77855695555;路,-8.67319643989;英,-10.416165745;印,-10.5703164248;音,-8.86556833254;聲,-7.88473907953;決,-9.52886254995;能,-5.67372118006;讀,-8.5119282923;我,-8.96087851234;农,-7.48687857081;生,-4.33101571377;模,-4.58806081676;頭,-6.17792700307;贯,-7.11505182185;亮,-10.059490801;爱,-7.03906591487;医,-12.362075894;难,-8.72448973428;節,-9.47170413611;居,-11.6689287134;荷,-9.47170413611;擊,-6.88143697066;額,-5.27868804638;提,-7.44942100827;套,-6.97758083122;回,-10.7526379816;內,-7.5337621567;罐,-10.9757815329;险,-12.362075894;台,-10.5703164248;齿,-8.86556833254;幹,-11.6689287134;长,-7.67994466688;腔,-7.71768499486;宅,-10.416165745;妙,-9.96418062121;領,-8.92808868952;枝,-12.362075894;貫,-7.11505182185;傳,-7.63468807529;核,-9.066239028;青,-8.5119282923;願,-12.362075894;拟,-7.48687857081;形,-5.78979335131;端,-7.72734690578;价,-9.41763691484;發,-6.83662295487;二,-8.17242115198;垒,-9.72301856439;礙,-8.86556833254;定,-4.49804023493;障,-10.1648513167;紡,-6.87727896052;纬,-6.62550359653;禮,-9.18402206366;環,-7.52579398705;夹,-12.362075894;房,-9.27103344065;熾,-11.2634636053;流,-5.66504164634;审,-9.47170413611;光,-7.88473907953;烈,-9.58948717177;位,-7.45680111557;軌,-7.59990195921;幗,-9.41763691484;壘,-9.72301856439;雜,-8.45005288858;档,-5.99560544627;部,-9.066239028;市,-7.98004925933;肉,-7.49454144355;舊,-8.00536706732;得,-8.72448973428;尖,-9.79712653654;餘,-6.47043168218;霜,-12.362075894;原,-8.43025026128;肩,-11.6689287134;决,-9.52886254995;防,-6.81299980911;抵,-11.2634636053;眼,-10.9757815329;倾,-7.15258974116;削,-9.52886254995;衣,-10.7526379816;動,-5.06025355187;泡,-9.10397935598;续,-9.02987138383;空,-8.75115798136;国,-5.59819098544;封,-12.362075894;稅,-9.41763691484;选,-8.14256818883;洋,-6.55393340403;後,-7.20878429951;向,-6.00944649769;众,-8.31902462617;綠,-7.01021776053;红,-5.59588417935;紫,-9.72301856439;中,-9.52886254995;新,-5.36814291878;償,-10.416165745;強,-7.20878429951;画,-12.362075894;傾,-7.15258974116;罗,-8.89633999121;胞,-7.49454144355;譯,-9.31755345628;壮,-9.96418062121;葱,-6.74167502829;关,-9.87716924422;曲,-10.2826343523;創,-12.362075894;项,-5.58556890163;觸,-10.2826343523;白,-6.63849079205;一,-3.70790724756;馅,-12.362075894;興,-4.29995831125;事,-5.03101558879;焊,-10.5703164248;途,-6.15751813144;编,-9.6540256929;際,-6.25505300626;多,-10.5703164248;身,-7.82947640085;優,-7.09421773494;甲,-4.97560504518;濁,-11.6689287134;杆,-10.2826343523;叉,-8.99478006402;版,-7.67072801178;盛,-7.68924705954;烟,-9.14320006914;屬,-6.6417641174;壯,-9.96418062121;儿,-11.2634636053;電,-6.6190727062;下,-5.6005031252;速,-8.2845384501;樣,-8.26773133178;动,-5.06025355187;縫,-8.86556833254;鮮,-9.6540256929;摇,-8.11358065196;草,-9.14320006914;高,-6.79755548668;齡,-7.24408208159;困,-8.43025026128;偿,-10.416165745;处,-9.36634362045;律,-10.1648513167;規,-7.35812958806;税,-9.41763691484;世,-7.7873649155;攜,-8.77855695555;熟,-11.6689287134;传,-7.63468807529;助,-8.39178398045;辫,-12.362075894;種,-5.59588417935;地,-9.18402206366;帶,-9.52886254995;层,-5.94208096586;装,-6.45127924997;季,-7.33163797261;氏,-8.18768862411;識,-10.9757815329;蓝,-7.29948086098;營,-4.85219283285;贫,-8.96087851234;你,-7.94323528621;旧,-8.00536706732;快,-9.72301856439;右,-9.72301856439;兴,-4.29995831125;混,-10.416165745;項,-5.58556890163;妄,-8.6485038273;隆,-9.31755345628;邊,-6.74894778762;洗,-7.82947640085;準,-9.87716924422;殘,-12.362075894;望,-8.77855695555;感,-8.03134255372;办,-8.12796938941;利,-9.18402206366;推,-9.41763691484;溶,-10.2826343523;愿,-12.362075894;规,-7.35812958806;鏈,-9.47170413611;籍,-8.07161645286;奏,-8.75115798136;關,-9.87716924422;正,-10.416165745;补,-7.42760196088;物,-9.72301856439;起,-12.362075894;命,-8.18768862411;
+E,c:宁,-8.82679785341;要,-4.14052451426;言,-7.40244393046;而,-3.10552554335;且,-2.9463611922;外,-3.18807510849;管,-3.63931573165;肯,-11.5009465028;况,-5.82762323566;然,-2.94843443129;见,-7.11579974083;但,-5.04456938898;么,-6.62193965122;反,-8.03521060004;以,-3.05326417418;话,-9.19836140984;惟,-7.93141380635;非,-6.13147194197;面,-4.25671898723;當,-7.52126484893;如,-6.47706598199;來,-5.71098633194;有,-4.81539771435;徒,-12.1940936834;次,-5.04614109853;是,-2.10250961462;單,-8.05892712665;讲,-9.99686910606;论,-4.49379847998;麼,-6.62193965122;則,-4.85455598799;光,-7.02360968836;之,-5.10902938944;及,-2.89290762812;免,-6.43519190952;单,-8.05892712665;著,-4.56508979374;来,-5.71098633194;令,-7.73394926946;只,-8.7283577806;独,-9.62914432593;曰,-9.99686910606;时,-2.8328364261;其,-4.22976412709;見,-7.11579974083;后,-3.71616120593;或,-6.83280151769;为,-2.77930340255;便,-5.3116562124;況,-5.82762323566;着,-4.56508979374;時,-2.8328364261;僅,-3.97841107237;过,-3.3380738862;奈,-8.65313435936;過,-3.3380738862;若,-5.25969647347;此,-3.01215278594;寧,-8.82679785341;獨,-9.62914432593;至,-5.34981082737;幾,-9.33189280247;者,-3.96564980039;看,-8.89825681739;不,-8.25251187573;後,-3.71616120593;于,-2.72996416999;怕,-6.25655747831;则,-4.85455598799;仅,-3.97841107237;講,-9.99686910606;果,-2.80330851464;真,-8.79289630173;末,-5.9053061868;說,-4.60324155971;為,-2.77930340255;於,-2.72996416999;致,-6.0694102925;当,-7.52126484893;論,-4.49379847998;乎,-9.42150496116;几,-9.33189280247;話,-9.19836140984;述,-7.81833666173;说,-4.60324155971;使,-4.46854291929;
+E,df:要,0.0;
+E,d:禁,-6.30521259961;怀,-10.8019310774;蜂,-9.44380759321;劇,-7.01144815647;稀,-8.9216182108;冉,-8.68835652932;合,-10.919714113;權,-11.7463926862;離,-9.58142897109;亏,-7.82583477833;疑,-6.06232712823;戶,-10.3600983251;輒,-8.65535023285;且,-7.5632526252;暗,-7.23239838089;外,-6.60139301318;料,-8.19104462472;暇,-8.81710551206;级,-8.64887771834;长,-11.3897177423;貫,-7.91155931947;未,-5.02668963873;般,-8.25422352634;犯,-9.61476539136;嘴,-11.2073961855;纷,-5.46894393578;气,-9.03834248511;方,-7.48774507269;悻,-9.23795553901;场,-7.34842240114;势,-7.18651877513;私,-10.6477803975;盡,-7.23553317969;必,-5.1013017167;勇,-8.81710551206;應,-7.90847765293;默,-7.64021366634;半,-7.37333472152;舊,-6.59310109171;经,-2.97844077644;慎,-8.79446303531;归,-8.78702805682;真,-7.91775128972;若,-12.5936905466;泛,-9.95463321698;坚,-12.9991556547;保,-11.7463926862;頻,-7.28542284919;竟,-5.06894944802;凡,-8.09018401438;遠,-5.28024796197;面,-5.39600572262;句,-11.6128612936;旧,-6.59310109171;继,-6.11979985024;渐,-4.54650098442;早,-5.13051876052;為,-4.23956545505;迭,-9.10733535659;马,-7.71088862401;端,-8.91317934215;麼,-5.98299450188;深,-6.66943474918;恰,-7.24183241312;言,-10.3964659693;年,-5.45191771975;价,-10.3964659693;其,-4.83806614186;装,-12.0828649228;摸,-8.9216182108;较,-4.3400289674;忽,-9.45819633067;幼,-7.30710843626;勿,-8.91317934215;昔,-11.900543366;計,-8.98277263395;頃,-9.00095495303;的,-5.30544614557;切,-9.61476539136;自,-5.22535086028;针,-10.919714113;個,-7.25615246689;續,-6.06038632219;睛,-8.76504915011;排,-8.9216182108;輕,-6.27292225234;应,-7.90847765293;嘗,-7.78150619122;首,-11.4950782579;厚,-10.3600983251;力,-5.29592226406;星,-8.93012890046;無,-10.2265669325;氣,-9.03834248511;甚,-9.97873076856;腰,-9.22639471661;天,-7.06956651131;是,-3.57527772156;單,-8.39899801054;由,-7.45202699009;草,-8.96491501655;耳,-8.4452787631;該,-8.19924139192;嚴,-8.63605702991;户,-10.3600983251;紧,-5.54212356558;费,-10.0547166755;总,-10.3964659693;手,-6.10956434635;整,-7.06691046725;流,-10.1369547738;计,-8.98277263395;緊,-5.54212356558;諄,-10.7478638561;准,-10.2265669325;究,-7.71341707036;位,-12.0828649228;繼,-6.11979985024;道,-5.4595968254;何,-9.09718298513;迫,-6.30027126775;煙,-9.38823774206;诚,-9.64925156743;也,-6.07356045759;来,-4.01571588292;盤,-8.66186491387;剧,-7.01144815647;旦,-5.31967309504;字,-11.2944075625;都,-5.81604395296;軸,-12.0828649228;只,-10.6477803975;独,-6.42268608565;共,-6.72911284939;声,-5.2161399934;味,-7.78150619122;直,-4.16656795227;穷,-8.1708419174;时,-4.22832850497;单,-8.39899801054;须,-4.31729584173;身,-7.38238455704;體,-7.06691046725;谆,-10.7478638561;码,-7.65443191534;欄,-10.3250070053;率,-10.6477803975;将,-5.54501457656;愈,-7.6688552423;見,-8.26295720631;上,-4.63639651659;近,-6.84748735605;后,-4.54917121298;频,-7.28542284919;經,-2.97844077644;划,-9.80048253715;底,-5.5490760849;稍,-7.58527994752;得,-5.46172561812;高,-8.66842231442;項,-10.0813849226;趋,-7.16580797569;刚,-5.48517366719;長,-11.3897177423;没,-8.30780777247;素,-9.01017160814;肩,-9.06733002198;用,-6.38913278403;个,-7.25615246689;庭,-9.66695114453;本,-6.58405869553;細,-7.84010035549;足,-8.4505558202;防,-9.01017160814;抵,-8.77232190943;機,-6.00110273774;点,-5.50862625264;脸,-6.92380962361;离,-9.58142897109;为,-4.23956545505;積,-7.60099295318;眼,-6.27893549957;便,-6.21074713335;時,-4.22832850497;仅,-5.69329562202;过,-6.84535969568;先,-4.51531244297;始,-9.7033187887;然,-2.93369807329;每,-8.36442666647;豎,-8.62970780224;敢,-4.78645165405;動,-5.77914764933;易,-6.74725177154;愧,-9.3228549828;步,-3.82563488087;痛,-9.63185982472;晚,-7.84875841823;睜,-8.62339863304;迟,-7.72615609614;裡,-7.71341707036;少,-4.87396855171;机,-6.00110273774;以,-4.98813227552;此,-4.51087647345;续,-6.06038632219;確,-6.63440489785;可,-6.80271152691;确,-6.63440489785;数,-7.67614567556;至,-4.44130048157;色,-11.3897177423;囵,-9.34849741341;轴,-12.0828649228;顶,-13.6923028353;價,-10.3964659693;數,-7.67614567556;空,-8.85602092831;顾,-7.5632526252;封,-11.3897177423;见,-8.26295720631;亂,-7.84297805532;興,-8.87202126966;辄,-8.65535023285;圇,-9.34849741341;肆,-7.8458640602;隊,-12.9991556547;不,-4.70773446595;後,-4.54917121298;式,-10.919714113;向,-6.02748704998;互,-5.57947535651;众,-8.66186491387;候,-7.1440837325;紛,-5.46894393578;初,-6.1291022429;期,-4.43269622198;統,-8.01897956809;严,-8.63605702991;妨,-9.90811320134;名,-10.4734270104;說,-8.46119421841;中,-6.1939869645;瞬,-10.919714113;斜,-12.9991556547;就,-6.02234083979;新,-4.9471775758;劲,-10.919714113;須,-4.31729584173;生,-7.25615246689;根,-9.86366143877;活,-8.07190196955;總,-10.3964659693;齊,-6.53378883793;久,-7.50403871218;衷,-8.84027257134;均,-9.00095495303;胆,-9.82110182435;怪,-7.65443191534;词,-10.2911054536;今,-5.62798087435;前,-8.31240548172;住,-7.51228618161;處,-5.63714510344;比,-11.900543366;块,-7.17610975922;胸,-11.4950782579;別,-3.67548659742;远,-5.28024796197;屡,-8.46655616155;几,-10.6012603819;勢,-7.18651877513;古,-7.13410503245;额,-11.2073961855;门,-5.56283307048;對,-4.31061759721;度,-4.29291358574;顷,-9.00095495303;腳,-10.9842526342;齒,-11.7463926862;说,-8.46119421841;捷,-11.4950782579;趨,-7.16580797569;项,-10.0813849226;啻,-11.3897177423;白,-8.53324753605;翼,-12.5936905466;齿,-11.7463926862;一,-6.98421875141;劃,-9.80048253715;内,-8.359584042;匆,-8.60470650003;统,-8.01897956809;席,-10.8590894912;事,-8.67502299845;再,-5.18718222508;同,-4.94972859759;成,-12.9991556547;頂,-13.6923028353;尔,-7.0190048675;粗,-9.78027982983;化,-13.6923028353;些,-7.48976731807;多,-5.7163944751;而,-5.71776999113;約,-5.64351455173;管,-13.6923028353;級,-8.64887771834;針,-10.919714113;终,-4.68285540567;優,-9.59795827304;断,-4.42529861617;肯,-8.64244682801;場,-7.34842240114;边,-5.05626051001;常,-3.66553626657;致,-6.13901622966;膽,-9.82110182435;律,-6.9672691931;连,-6.30583198643;眾,-8.66186491387;练,-12.9991556547;終,-4.68285540567;病,-9.48761021587;資,-12.0828649228;筆,-8.82476838481;么,-5.98299450188;重,-8.78702805682;行,-6.03643881765;像,-8.8481157488;发,-6.30088760059;兒,-6.4602925036;忙,-5.60804872896;日,-6.50238066452;川,-12.5936905466;停,-6.52141435675;烟,-9.38823774206;非,-6.69288036775;脚,-10.9842526342;算,-6.61143493857;慢,-5.972728846;工,-9.80048253715;層,-10.2265669325;番,-8.1510392901;間,-7.48774507269;緩,-6.97934663459;費,-10.0547166755;愿,-8.37909685622;对,-4.31061759721;幸,-9.17051425821;难,-6.91011077926;誠,-9.64925156743;笔,-8.82476838481;概,-5.78759892139;悄,-7.04202378668;將,-5.54501457656;來,-4.01571588292;有,-7.28872863733;下,-5.90078001611;或,-8.80195370704;复,-5.94039750218;碌,-10.0813849226;小,-6.18956462451;美,-10.1659423106;源,-9.74105911668;娓,-11.4950782579;團,-8.66186491387;觉,-6.8037303757;幅,-4.56861027001;理,-10.1957952738;间,-7.48774507269;速,-4.79448382575;实,-4.77660201631;次,-4.8406394099;加,-4.89445218633;樣,-5.01810589504;通,-10.3250070053;性,-6.52295281859;动,-5.77914764933;别,-3.67548659742;牢,-7.8751916753;微,-6.0473834903;样,-5.01810589504;家,-7.88716786635;隙,-10.4342062972;庸,-9.42962295822;刻,-5.23273875668;覺,-6.8037303757;碼,-7.65443191534;齐,-6.53378883793;睁,-8.62339863304;益,-5.94773302591;故,-8.42961264636;识,-9.44380759321;等,-7.90847765293;才,-7.02534604283;之,-6.53534647065;當,-5.27958166544;免,-6.53301093047;偏,-7.19854899541;里,-7.71341707036;打,-12.9991556547;啕,-9.41563671625;著,-8.99182246947;臉,-6.92380962361;盘,-8.66186491387;剛,-5.48517366719;腦,-12.0828649228;粹,-7.95250992308;条,-10.1659423106;狠,-7.35018141654;略,-8.58635736136;顧,-7.5632526252;實,-4.77660201631;带,-11.2073961855;途,-7.38602754831;当,-5.27958166544;發,-6.30088760059;已,-5.50778908223;滿,-12.5936905466;偷,-7.37875478899;歹,-11.2073961855;相,-5.65185595396;好,-4.62191442371;偿,-7.84010035549;最,-9.07718231842;侃,-10.6012603819;堂,-11.4950782579;处,-5.63714510344;分,-4.48808114429;月,-8.34519530455;例,-7.67858767922;明,-6.57024295363;倒,-7.13268759777;冗,-12.9991556547;世,-9.90811320134;脆,-6.88547347487;优,-9.59795827304;荷,-9.58142897109;條,-10.1659423106;夜,-6.67479669232;愤,-9.13842594366;並,-8.2412643817;助,-10.0547166755;在,-4.75824311301;莫,-8.59855263446;历,-10.0813849226;地,-5.74144797754;難,-6.91011077926;头,-7.34491362561;斷,-4.42529861617;帶,-11.2073961855;漸,-4.54650098442;點,-5.50862625264;程,-8.82476838481;举,-6.11979985024;勁,-10.919714113;着,-8.99182246947;心,-6.54395709136;层,-10.2265669325;僅,-5.69329562202;资,-12.0828649228;要,-4.69527945378;无,-10.2265669325;塊,-7.17610975922;量,-6.3405029662;乎,-4.17124769172;子,-10.0287411891;团,-8.66186491387;法,-6.52218329181;栏,-10.3250070053;願,-8.37909685622;乖,-9.21496602078;識,-9.44380759321;遲,-7.72615609614;裝,-12.0828649228;詞,-10.2911054536;满,-12.5936905466;脑,-12.0828649228;口,-7.77879982962;屢,-8.46655616155;巧,-7.76537680929;獨,-6.42268608565;快,-4.77244846307;公,-9.97873076856;积,-7.60099295318;舉,-6.11979985024;聲,-5.2161399934;兴,-8.87202126966;懷,-10.8019310774;并,-8.2412643817;歸,-8.78702805682;爾,-7.0190048675;能,-7.10200178707;兼,-11.2073961855;幾,-10.6012603819;丁,-9.3228549828;往,-5.24167688812;較,-4.3400289674;袂,-9.03834248511;堅,-12.9991556547;了,-8.18291449863;三,-7.50403871218;邊,-5.05626051001;倍,-8.23271732112;越,-5.20145361919;意,-5.29029605366;于,-4.81729534921;我,-11.1273534778;徐,-8.6950905615;缓,-6.97934663459;沒,-8.30780777247;怕,-5.89173018059;準,-10.2265669325;情,-7.81456705348;皇,-11.6128612936;尝,-7.78150619122;喜,-10.1957952738;償,-7.84010035549;虧,-7.82583477833;模,-9.56516845022;该,-8.19924139192;定,-3.82066721218;憤,-9.13842594366;大,-5.79947730901;亦,-11.3897177423;頭,-7.34491362561;馬,-7.71088862401;贯,-7.91155931947;窮,-8.1708419174;許,-4.69342450983;队,-12.9991556547;奈,-7.01019423781;许,-4.69342450983;從,-8.1748499388;尽,-7.23553317969;於,-4.81729534921;儿,-6.4602925036;練,-12.9991556547;权,-11.7463926862;歷,-10.0813849226;细,-7.84010035549;競,-13.6923028353;額,-11.2073961855;連,-6.30583198643;从,-8.1748499388;門,-5.56283307048;体,-7.06691046725;第,-11.3897177423;约,-5.64351455173;竖,-8.62970780224;佛,-6.09792159271;過,-6.84535969568;轻,-6.27292225234;竞,-13.6923028353;正,-4.84021007179;內,-8.359584042;苦,-7.67614567556;乱,-7.84297805532;台,-11.3897177423;即,-4.84021007179;巴,-9.09718298513;起,-10.0813849226;件,-8.56833885586;批,-8.30323110545;截,-11.6128612936;死,-7.53744474125;命,-7.80342487693;腿,-9.90811320134;曾,-6.33283519701;
+E,e:呀,-0.653027186771;哈,-2.50260622689;饗,-4.91852000519;伙,-2.86439627149;哟,-1.37466632312;塞,-6.52795791762;夥,-2.86439627149;飨,-4.91852000519;喲,-1.37466632312;嘻,-6.52795791762;呼,-2.55766600407;
+E,f:内,-4.15847266003;街,-7.97870013536;隅,-8.5176966361;來,-3.02662129073;頭,-4.76567472417;下,-3.07288537928;上,-2.80537925899;圍,-4.04157809588;後,-1.81995716978;后,-1.81995716978;向,-6.59762771822;間,-2.34450594751;夕,-6.28538073895;路,-7.87960923272;北,-3.86953538116;外,-3.77198841146;线,-6.54411176488;缘,-7.43710285293;際,-5.16779254882;间,-2.34450594751;东,-5.84108796083;期,-2.9850132125;邊,-3.46042769646;侧,-4.0836961351;末,-9.24721146083;中,-3.86663162987;週,-5.29099437498;湖,-8.98770026534;段,-6.33849056426;头,-4.76567472417;方,-3.56413572576;岸,-5.22185977009;部,-2.1627987843;儿,-10.5971381778;围,-4.04157809588;旁,-5.52464652776;层,-6.32047205876;际,-5.16779254882;过,-9.54731605328;葉,-8.19924290498;遍,-11.1567539657;遊,-4.94515037631;半,-8.43217446266;前,-2.7672805159;緣,-7.43710285293;過,-9.54731605328;近,-3.66902020427;边,-3.46042769646;兒,-10.5971381778;南,-4.03894037496;游,-4.94515037631;年,-10.058141677;線,-6.54411176488;远,-10.145153054;江,-6.69372354688;裡,-6.74395567237;遠,-10.145153054;代,-8.12420771903;面,-2.70255382362;来,-3.02662129073;層,-6.32047205876;內,-4.15847266003;周,-5.29099437498;麓,-6.10529667709;端,-5.75633137623;東,-5.84108796083;至,-8.71440693034;角,-6.43380074407;側,-4.0836961351;海,-4.51361548625;叶,-8.19924290498;里,-6.74395567237;首,-7.70676641988;翼,-11.8499011463;西,-5.77340634998;
+E,h:低,0.0;
+E,in:患,0.0;
+E,i:倀,-8.74395453843;挂,-7.73631402797;志,-6.68649190347;怀,-7.54871541408;涉,-7.98762845625;氈,-8.41371285156;饮,-9.57686366137;弊,-7.16094988307;舌,-6.55643877523;随,-9.10686003212;炬,-8.51215292438;谈,-6.11112775857;茂,-8.00824774346;帔,-9.80000721268;抗,-8.44546154988;喙,-11.1863015738;鐘,-8.19056930025;顺,-6.34605926564;曠,-11.8794487544;宝,-6.57118105696;废,-7.64534224977;造,-9.24039142475;璣,-10.7808364657;錢,-11.8794487544;枥,-10.2700108419;膻,-10.7808364657;涩,-9.93353860531;缪,-7.14325030597;厭,-8.19056930025;爬,-8.62135221634;靜,-7.4727295071;辈,-8.70139492402;岳,-10.7808364657;憲,-10.7808364657;徵,-9.17139855326;渴,-7.78510419214;銷,-8.4782513727;然,-5.01564536291;方,-6.11739737158;场,-8.09525912045;宽,-9.3144993969;娼,-9.93353860531;线,-8.44546154988;贾,-9.3144993969;餚,-9.93353860531;铃,-9.24039142475;附,-10.0876892851;談,-6.11112775857;屈,-7.75231436932;齊,-7.3151005629;反,-7.28432890423;牌,-8.83492631664;雏,-11.8794487544;科,-8.98907699647;賓,-8.58361188836;虢,-11.1863015738;序,-8.3829411929;狗,-7.85409706363;员,-10.7808364657;飛,-6.81685372134;坚,-10.4931543932;寝,-8.70139492402;统,-8.83492631664;赞,-9.57686366137;凡,-8.9350097752;遠,-7.1087641299;换,-8.21588710823;知,-5.14485709439;除,-8.41371285156;諧,-10.4931543932;耐,-8.14177913608;緩,-7.15206093565;罪,-6.84249615195;揭,-9.93353860531;扬,-6.17566627971;炼,-8.9350097752;阖,-8.98907699647;衰,-8.35308822975;鳳,-8.58361188836;歲,-9.93353860531;念,-9.93353860531;年,-6.94497482123;席,-8.78840630101;闹,-8.9350097752;摸,-7.17896838857;皇,-7.134516626;鯽,-9.93353860531;淫,-10.0876892851;滿,-7.54871541408;昔,-9.39454210458;愁,-9.48155348157;吃,-9.17139855326;雛,-11.8794487544;的,-8.09525912045;娇,-9.93353860531;榆,-10.4931543932;沈,-7.98762845625;羊,-8.78840630101;昏,-9.48155348157;睬,-11.8794487544;料,-6.19247339802;殒,-9.93353860531;引,-9.68222417703;五,-10.4931543932;错,-6.48582120801;畅,-11.8794487544;謝,-6.37006041774;窜,-8.32410069287;鸟,-8.29592981591;無,-8.74395453843;肠,-7.94762312164;厢,-11.8794487544;遇,-7.19731752724;異,-6.2269595741;崩,-11.8794487544;貨,-8.6605729295;倫,-8.78840630101;循,-9.68222417703;犬,-9.04623541031;嘯,-10.2700108419;疮,-9.93353860531;失,-6.15913697776;張,-7.37963908403;户,-6.28473737476;盈,-8.70139492402;改,-8.70139492402;讼,-10.4931543932;誼,-9.80000721268;鸿,-10.7808364657;胀,-9.39454210458;雄,-7.92820503578;迟,-8.32410069287;秋,-7.94762312164;賈,-9.3144993969;聋,-7.78510419214;晏,-10.7808364657;旎,-9.80000721268;烹,-10.7808364657;寒,-8.11824863867;何,-5.59345065985;论,-5.93927750164;祸,-6.87550244842;教,-8.35308822975;衛,-10.7808364657;矚,-8.19056930025;孝,-8.9350097752;也,-7.43679749787;惠,-9.68222417703;鑣,-8.11824863867;艺,-8.29592981591;来,-5.14485709439;盤,-8.4782513727;姦,-8.19056930025;注,-7.16991855305;火,-6.17233848961;忪,-9.39454210458;独,-10.4931543932;景,-8.24186259464;问,-7.39081238463;銳,-8.19056930025;声,-5.82735958544;米,-11.8794487544;燒,-8.41371285156;罵,-7.39081238463;滴,-7.75231436932;緒,-8.24186259464;懶,-9.17139855326;须,-11.8794487544;聾,-7.78510419214;譽,-8.6605729295;广,-7.96742574894;巾,-10.2700108419;片,-8.88371648081;儀,-10.4931543932;斃,-7.96742574894;賢,-10.4931543932;圄,-8.78840630101;宇,-10.0876892851;門,-6.85556823352;沉,-7.98762845625;训,-10.7808364657;醋,-7.48499959969;上,-5.68708626489;劍,-7.70506148447;后,-6.18908930004;碑,-8.98907699647;静,-7.4727295071;經,-6.51815658865;井,-8.70139492402;演,-9.39454210458;怖,-8.83492631664;蒙,-11.8794487544;攘,-7.63095351231;牛,-9.68222417703;辟,-10.4931543932;转,-6.65909292929;股,-11.1863015738;閣,-8.51215292438;線,-8.44546154988;箧,-11.8794487544;质,-8.4782513727;醫,-10.0876892851;踪,-7.05113501706;河,-7.11727481957;胜,-6.18235526786;碱,-11.8794487544;选,-10.7808364657;足,-5.75695594485;欲,-6.80427493913;纵,-9.04623541031;掷,-7.53564333251;献,-8.70139492402;妻,-9.10686003212;媽,-8.24186259464;鬼,-7.48499959969;便,-8.83492631664;尾,-6.17566627971;雅,-7.39081238463;寇,-10.4931543932;章,-6.29971892838;泉,-10.0876892851;釋,-11.1863015738;湊,-9.80000721268;苍,-8.6605729295;壑,-9.10686003212;奐,-9.93353860531;仕,-9.80000721268;佔,-11.8794487544;受,-7.36858924785;永,-10.7808364657;敘,-10.2700108419;脉,-7.05916718876;晚,-10.0876892851;邻,-9.93353860531;濟,-6.93068886399;属,-9.57686366137;惡,-7.96742574894;民,-7.29448127569;机,-6.73195427755;坤,-9.3144993969;寧,-7.5100009019;讽,-8.70139492402;详,-7.42510145811;跳,-7.12585856326;良,-8.29592981591;轴,-11.8794487544;号,-9.39454210458;偶,-7.42510145811;啸,-10.2700108419;移,-6.72615715987;智,-7.25447594108;应,-6.93780633175;见,-5.70983802187;节,-7.32557186276;轨,-8.88371648081;血,-7.27427856838;饭,-8.00824774346;舍,-6.11425765158;厌,-8.19056930025;咎,-8.05080735787;树,-9.48155348157;般,-7.96742574894;媒,-8.9350097752;颜,-9.3144993969;北,-6.97417397593;悖,-9.39454210458;鐙,-10.0876892851;喘,-8.19056930025;皚,-9.3144993969;宜,-6.44136944544;弟,-8.78840630101;蹄,-7.58898931322;怡,-8.54724424419;冠,-9.17139855326;锣,-10.7808364657;骚,-8.02930115265;春,-8.70139492402;鬧,-8.9350097752;梦,-7.42510145811;帝,-8.74395453843;纪,-8.07278626459;爭,-7.14325030597;掬,-8.07278626459;术,-8.88371648081;辜,-9.10686003212;報,-7.98762845625;肴,-9.93353860531;踵,-8.98907699647;词,-6.43703104384;风,-6.32262069266;吹,-10.7808364657;皺,-8.83492631664;稽,-11.1863015738;殼,-9.10686003212;漿,-8.88371648081;沾,-11.8794487544;净,-7.34684926121;狂,-8.00824774346;际,-6.78569855356;柄,-9.48155348157;汉,-8.83492631664;珍,-8.4782513727;克,-8.6605729295;今,-8.58361188836;前,-6.55157258557;双,-8.32410069287;坏,-7.05113501706;塑,-9.39454210458;姐,-8.98907699647;溢,-8.9350097752;经,-6.51815658865;相,-7.94762312164;迭,-8.74395453843;鄉,-6.98160895441;觑,-7.01191430391;糞,-11.1863015738;几,-6.80427493913;散,-6.2626776567;勢,-6.33427130988;霧,-7.81900574382;淨,-7.34684926121;八,-7.34684926121;仪,-10.4931543932;杯,-11.8794487544;瓮,-9.39454210458;續,-6.58113138782;荒,-7.83639748653;豆,-9.3144993969;卷,-10.0876892851;惶,-7.83639748653;固,-7.42510145811;渔,-9.24039142475;导,-8.35308822975;使,-7.78510419214;刀,-8.54724424419;辉,-8.54724424419;丈,-7.36858924785;紊,-7.78510419214;再,-7.80191131046;頂,-8.54724424419;涕,-8.29592981591;尔,-8.11824863867;化,-7.05113501706;骛,-10.7808364657;甚,-8.21588710823;粟,-9.3144993969;採,-6.87550244842;镫,-10.0876892851;罚,-10.2700108419;轍,-7.09195701158;義,-5.88051219242;话,-7.27427856838;劫,-8.26853084172;騰,-6.6064491958;纳,-11.1863015738;躲,-10.4931543932;水,-5.84396732184;傷,-7.46060814657;眈,-7.75231436932;舵,-8.54724424419;格,-7.33615397209;沿,-10.0876892851;所,-7.3151005629;谊,-9.80000721268;病,-8.83492631664;疑,-6.07431378545;筆,-9.39454210458;蹈,-7.60278263535;凍,-8.41371285156;职,-7.87211556913;瓏,-7.80191131046;李,-9.57686366137;篑,-8.44546154988;蠹,-11.8794487544;仓,-8.6605729295;饒,-8.3829411929;卖,-9.17139855326;韙,-8.62135221634;虚,-7.67475613497;画,-8.29592981591;糟,-6.86216891755;握,-9.10686003212;難,-6.3579878365;兢,-6.8822364806;日,-5.51297830663;学,-8.32410069287;俩,-10.4931543932;浪,-6.99664683178;凭,-8.54724424419;偬,-8.98907699647;诱,-9.24039142475;驰,-7.83639748653;廳,-10.2700108419;怒,-7.05916718876;淵,-9.3144993969;秽,-8.78840630101;持,-10.4931543932;技,-8.58361188836;昃,-11.8794487544;憂,-6.68649190347;锅,-10.2700108419;诛,-8.9350097752;殆,-9.17139855326;載,-7.90915684081;班,-8.19056930025;越,-8.19056930025;吏,-7.48499959969;笑,-6.13644556655;齪,-10.4931543932;缘,-8.21588710823;訛,-9.57686366137;喚,-8.6605729295;墜,-7.24471976613;從,-6.39051102821;挡,-8.19056930025;加,-7.83639748653;蔥,-8.16587668766;宦,-10.7808364657;茲,-10.7808364657;额,-7.58898931322;别,-6.50881072624;悬,-9.17139855326;誰,-9.80000721268;帳,-10.2700108419;贵,-6.49037702455;貴,-6.49037702455;燈,-10.0876892851;源,-7.43679749787;訪,-7.75231436932;补,-9.10686003212;达,-6.55643877523;十,-6.92362169676;狀,-7.3151005629;懂,-8.9350097752;故,-6.56132876052;蓄,-8.41371285156;密,-8.14177913608;轉,-6.65909292929;廈,-8.29592981591;手,-6.49495369157;慶,-8.24186259464;免,-6.97417397593;枣,-10.2700108419;城,-7.49742211969;筑,-8.29592981591;秒,-8.6605729295;絕,-5.79722984399;遗,-8.32410069287;取,-8.6605729295;臉,-6.55643877523;盘,-8.4782513727;胎,-11.8794487544;需,-9.10686003212;補,-9.10686003212;江,-9.39454210458;连,-7.90915684081;荡,-7.25447594108;狠,-11.1863015738;陣,-7.32557186276;略,-7.81900574382;顧,-6.72615715987;實,-5.85358278054;彩,-6.41561694934;鏤,-11.8794487544;六,-11.8794487544;平,-6.30729472219;赵,-8.44546154988;绿,-8.62135221634;偷,-10.7808364657;叶,-8.14177913608;睹,-6.8822364806;書,-8.41371285156;旺,-9.10686003212;好,-7.64534224977;访,-7.75231436932;與,-11.8794487544;忾,-8.51215292438;重,-5.77242586662;綸,-8.6605729295;妇,-8.88371648081;娆,-10.4931543932;争,-7.14325030597;缈,-8.35308822975;王,-8.16587668766;尊,-8.83492631664;悍,-8.98907699647;萃,-7.80191131046;疏,-8.6605729295;明,-5.89803454311;骑,-11.8794487544;输,-9.10686003212;谏,-9.93353860531;隙,-10.7808364657;團,-7.80191131046;條,-8.09525912045;夜,-6.8822364806;踞,-9.93353860531;务,-8.32410069287;匠,-8.70139492402;垣,-9.17139855326;逢,-7.26432823752;钥,-10.2700108419;唤,-8.6605729295;覆,-7.81900574382;炭,-8.44546154988;鳖,-9.17139855326;冷,-8.29592981591;制,-8.83492631664;霸,-8.83492631664;飞,-6.81685372134;礼,-7.19731752724;邑,-9.93353860531;举,-6.41561694934;勁,-10.7808364657;區,-10.7808364657;遂,-11.1863015738;啄,-10.7808364657;界,-7.24471976613;婆,-11.8794487544;廉,-10.7808364657;彈,-8.05080735787;友,-7.76857489019;届,-10.7808364657;鎖,-10.2700108419;煌,-7.18810087213;族,-10.2700108419;虎,-6.95946782854;子,-6.19247339802;離,-6.17233848961;法,-6.01015184123;剖,-10.7808364657;蛙,-9.57686366137;毛,-8.02930115265;象,-8.41371285156;繞,-9.39454210458;占,-11.8794487544;矣,-8.35308822975;恢,-10.2700108419;婦,-8.88371648081;緲,-8.35308822975;叫,-6.87550244842;惭,-8.83492631664;公,-7.8904647078;闯,-11.1863015738;諱,-7.68979401234;議,-6.01015184123;赴,-7.3151005629;懷,-7.54871541408;缕,-7.61676887732;寻,-9.80000721268;壽,-8.41371285156;楼,-7.35766017731;粉,-8.70139492402;幾,-6.80427493913;會,-7.12585856326;善,-7.63095351231;备,-7.52273992767;三,-6.6064491958;侈,-10.0876892851;首,-6.70896475933;倍,-8.14177913608;册,-9.57686366137;嚎,-8.41371285156;父,-10.0876892851;弓,-8.58361188836;练,-9.93353860531;药,-7.15206093565;阙,-11.8794487544;驚,-5.77689015975;金,-7.60278263535;榜,-9.57686366137;负,-7.65994104919;隆,-8.6605729295;莠,-11.1863015738;圣,-10.4931543932;门,-6.85556823352;营,-7.33615397209;采,-6.87550244842;大,-6.05050313675;视,-8.21588710823;辩,-8.98907699647;虫,-9.80000721268;挫,-8.21588710823;粪,-11.1863015738;腳,-6.2304745162;支,-8.83492631664;暮,-9.39454210458;鶴,-9.17139855326;记,-9.39454210458;雲,-6.90963545479;队,-7.17896838857;状,-7.3151005629;鴦,-11.1863015738;钺,-10.4931543932;贿,-10.0876892851;权,-10.2700108419;烂,-8.07278626459;奇,-6.71466278044;醜,-11.1863015738;义,-5.88051219242;腸,-7.94762312164;鍋,-10.2700108419;賊,-9.24039142475;簣,-8.44546154988;問,-7.39081238463;酌,-8.24186259464;寐,-8.78840630101;体,-6.94497482123;棒,-8.3829411929;展,-7.39081238463;藏,-8.98907699647;起,-5.89551247368;據,-8.83492631664;衝,-6.49495369157;點,-7.81900574382;珠,-8.02930115265;获,-7.52273992767;荐,-9.24039142475;繩,-11.8794487544;陽,-9.57686366137;卫,-10.7808364657;泪,-8.83492631664;恭,-7.96742574894;臬,-10.0876892851;目,-5.0335688791;話,-7.27427856838;寰,-8.9350097752;飲,-9.57686366137;巴,-9.68222417703;具,-11.1863015738;虹,-8.58361188836;馴,-8.51215292438;死,-6.05640285888;哺,-8.70139492402;衽,-11.8794487544;豕,-11.8794487544;羁,-8.16587668766;灶,-8.9350097752;厅,-10.2700108419;須,-11.8794487544;權,-10.2700108419;融,-8.05080735787;昌,-10.0876892851;戶,-6.28473737476;墓,-10.0876892851;是,-5.73311949669;暗,-8.16587668766;錯,-6.48582120801;写,-7.76857489019;依,-9.80000721268;帜,-7.25447594108;窟,-9.68222417703;吠,-10.4931543932;患,-6.88901616759;接,-7.49742211969;煩,-7.92820503578;产,-7.57538366116;账,-9.80000721268;騁,-9.10686003212;霆,-8.24186259464;鞭,-8.78840630101;犯,-7.54871541408;铁,-6.73778519786;掉,-9.17139855326;雾,-7.81900574382;段,-7.85409706363;訴,-8.78840630101;賞,-8.51215292438;收,-8.4782513727;逸,-8.02930115265;治,-7.41354063571;区,-10.7808364657;鼐,-10.7808364657;調,-8.29592981591;暴,-8.78840630101;杂,-6.6115905953;仇,-8.02930115265;浆,-8.88371648081;觉,-5.80640422026;案,-8.83492631664;擋,-8.19056930025;遭,-10.7808364657;慎,-7.09195701158;跑,-9.68222417703;豐,-10.7808364657;归,-6.45891375509;试,-7.57538366116;盗,-8.21588710823;沸,-8.09525912045;要,-10.7808364657;博,-9.10686003212;违,-8.05080735787;鹜,-8.11824863867;神,-6.13324556382;面,-6.31492834704;句,-8.02930115265;鉤,-10.4931543932;继,-7.04316684741;渐,-9.93353860531;表,-8.51215292438;歪,-7.56196064083;短,-6.68649190347;噬,-11.1863015738;兮,-9.24039142475;己,-6.33427130988;鋼,-9.04623541031;壳,-9.10686003212;寵,-8.6605729295;穴,-8.54724424419;雷,-7.94762312164;當,-6.62195338234;選,-10.7808364657;追,-8.54724424419;幼,-8.09525912045;竿,-9.48155348157;锁,-10.2700108419;逃,-7.1087641299;包,-8.16587668766;万,-6.37819054382;讹,-9.57686366137;热,-6.76746096601;殊,-9.04623541031;服,-7.33615397209;戏,-8.32410069287;憎,-10.4931543932;頓,-9.17139855326;徒,-7.60278263535;檔,-11.8794487544;記,-9.39454210458;肘,-8.02930115265;厚,-7.16991855305;缝,-8.29592981591;府,-10.2700108419;訟,-10.4931543932;黄,-8.88371648081;連,-7.90915684081;垢,-9.10686003212;挥,-8.54724424419;扇,-9.3144993969;润,-10.4931543932;天,-5.48085381983;墨,-9.04623541031;宪,-10.7808364657;石,-7.26432823752;贱,-9.93353860531;農,-10.2700108419;茫,-9.68222417703;顱,-9.17139855326;鶩,-8.11824863867;脹,-9.39454210458;悸,-7.83639748653;食,-6.79804438938;運,-10.0876892851;妾,-9.48155348157;恃,-11.8794487544;蹇,-11.1863015738;遊,-9.17139855326;认,-7.85409706363;燎,-7.57538366116;術,-8.88371648081;產,-7.57538366116;輕,-7.65994104919;闖,-11.1863015738;煙,-8.05080735787;揚,-6.17566627971;读,-11.1863015738;機,-6.73195427755;柢,-10.2700108419;勤,-10.7808364657;湧,-7.23505785522;磐,-10.2700108419;绕,-9.39454210458;磨,-8.83492631664;弦,-8.44546154988;曬,-8.98907699647;副,-10.7808364657;職,-7.87211556913;統,-8.83492631664;泰,-9.68222417703;毒,-9.3144993969;晷,-11.8794487544;时,-6.25904788865;兹,-10.7808364657;录,-11.8794487544;类,-7.04316684741;载,-7.90915684081;身,-6.59624502563;婿,-9.80000721268;攀,-8.70139492402;昂,-7.16991855305;錄,-11.8794487544;将,-7.06726439899;開,-6.86881346027;訊,-10.2700108419;較,-8.11824863867;萬,-6.37819054382;锥,-11.1863015738;留,-8.4782513727;炯,-8.4782513727;林,-7.65994104919;搖,-7.42510145811;備,-7.52273992767;刚,-8.44546154988;顛,-10.4931543932;薄,-9.10686003212;报,-7.98762845625;侧,-7.5100009019;筝,-10.7808364657;艷,-10.0876892851;横,-9.93353860531;本,-8.19056930025;环,-7.23505785522;粱,-10.4931543932;細,-7.96742574894;馳,-7.83639748653;幟,-7.25447594108;羈,-8.16587668766;点,-7.81900574382;脸,-6.55643877523;綻,-8.4782513727;弼,-10.2700108419;宿,-8.70139492402;破,-7.43679749787;品,-11.8794487544;燃,-8.41371285156;時,-6.25904788865;獄,-8.98907699647;过,-8.24186259464;屆,-10.7808364657;奈,-7.87211556913;過,-8.24186259464;結,-9.24039142475;姓,-7.22548840421;孔,-8.24186259464;慘,-10.4931543932;貸,-7.80191131046;階,-10.4931543932;绝,-5.79722984399;作,-6.45010312541;塞,-10.4931543932;員,-10.7808364657;我,-8.62135221634;臣,-6.98909962614;癢,-8.62135221634;拥,-7.98762845625;忧,-6.68649190347;票,-8.58361188836;黨,-8.88371648081;漓,-7.63095351231;可,-6.4327113827;質,-8.4782513727;走,-8.11824863867;干,-7.34684926121;價,-7.12585856326;典,-9.04623541031;渝,-8.51215292438;猾,-8.83492631664;绽,-8.4782513727;彼,-7.4727295071;寿,-8.41371285156;顾,-6.72615715987;吁,-6.90271501194;迁,-7.96742574894;韪,-8.62135221634;舅,-11.8794487544;玄,-10.2700108419;妈,-8.24186259464;少,-6.77958232654;餓,-9.24039142475;镂,-11.8794487544;朗,-8.00824774346;耙,-9.80000721268;紛,-6.69766520407;丝,-10.7808364657;澜,-6.92362169676;增,-7.70506148447;酱,-10.4931543932;愣,-10.7808364657;暢,-11.8794487544;別,-6.50881072624;逝,-7.4727295071;說,-6.15913697776;蘭,-11.8794487544;振,-7.16991855305;炮,-9.80000721268;就,-6.82320294902;诉,-8.78840630101;亲,-7.12585856326;眷,-10.2700108419;背,-7.94762312164;貌,-8.26853084172;活,-6.52286247969;丽,-8.58361188836;直,-9.17139855326;元,-10.4931543932;篇,-10.7808364657;穷,-6.44136944544;縛,-9.80000721268;矢,-8.35308822975;藍,-10.0876892851;降,-7.39081238463;荏,-9.93353860531;籌,-7.35766017731;屑,-11.1863015738;驕,-11.1863015738;比,-7.01963635;块,-8.78840630101;恙,-7.67475613497;釘,-8.98907699647;远,-7.1087641299;壞,-7.05113501706;无,-8.74395453843;慣,-7.92820503578;团,-7.80191131046;剥,-9.57686366137;古,-8.9350097752;桩,-9.17139855326;畫,-8.29592981591;櫪,-10.2700108419;蟬,-8.88371648081;卯,-10.0876892851;惮,-7.16991855305;山,-5.72459066035;女,-7.27427856838;讀,-11.1863015738;说,-6.15913697776;臂,-7.720565671;瓶,-8.14177913608;懸,-9.17139855326;幽,-9.17139855326;翼,-5.85842540501;詐,-8.21588710823;達,-6.55643877523;极,-7.70506148447;内,-9.39454210458;间,-6.3660200082;漆,-9.3144993969;安,-5.5786629597;計,-5.85842540501;養,-8.54724424419;同,-5.35295389479;醬,-10.4931543932;徑,-8.6605729295;帐,-10.2700108419;誓,-8.58361188836;洒,-8.9350097752;贯,-9.10686003212;钗,-10.7808364657;圖,-7.15206093565;战,-5.94455455874;愚,-9.57686366137;盛,-8.44546154988;霄,-10.0876892851;映,-8.29592981591;慚,-8.83492631664;貧,-9.04623541031;伦,-8.78840630101;让,-7.56196064083;順,-6.34605926564;断,-5.98229488673;听,-6.9166041241;傯,-8.98907699647;匮,-11.8794487544;辱,-8.41371285156;丰,-10.7808364657;悲,-7.81900574382;場,-8.09525912045;观,-7.10032526125;券,-9.93353860531;麻,-7.41354063571;綽,-7.96742574894;音,-7.68979401234;鼓,-6.21302206625;磋,-11.8794487544;韁,-9.80000721268;忡,-6.89584213266;勃,-6.0186625309;渊,-9.3144993969;資,-10.2700108419;築,-8.29592981591;認,-7.85409706363;楊,-9.57686366137;痍,-9.93353860531;烏,-9.48155348157;华,-7.53564333251;乐,-6.52759062089;髓,-9.17139855326;塔,-9.68222417703;杖,-10.2700108419;叙,-10.2700108419;牘,-9.39454210458;党,-8.88371648081;川,-8.78840630101;繼,-7.04316684741;棟,-8.35308822975;示,-9.48155348157;燥,-11.8794487544;糧,-8.9350097752;车,-8.32410069287;奪,-7.90915684081;聽,-6.9166041241;惯,-7.92820503578;据,-8.83492631664;忱,-11.1863015738;雜,-6.6115905953;絲,-10.7808364657;蝶,-11.1863015738;叹,-7.53564333251;底,-6.52759062089;任,-7.65994104919;鱼,-7.90915684081;省,-8.41371285156;蚀,-9.80000721268;刃,-8.70139492402;斂,-8.07278626459;算,-7.28432890423;將,-7.06726439899;來,-5.14485709439;嬉,-10.2700108419;和,-7.28432890423;透,-7.73631402797;休,-7.43679749787;庐,-8.29592981591;樓,-7.35766017731;夕,-7.09195701158;飯,-8.00824774346;折,-7.23505785522;帛,-9.93353860531;憚,-7.16991855305;鲜,-7.26432823752;臆,-8.9350097752;实,-5.85358278054;蜡,-9.80000721268;肤,-8.98907699647;尧,-11.8794487544;辦,-8.16587668766;骨,-6.35399581523;牢,-8.41371285156;蔭,-9.57686366137;弱,-8.24186259464;稳,-8.41371285156;液,-10.0876892851;诫,-9.80000721268;鼠,-8.62135221634;架,-10.4931543932;主,-5.45134348168;膺,-8.05080735787;宾,-8.58361188836;睁,-9.68222417703;雀,-8.98907699647;阁,-8.51215292438;等,-8.58361188836;額,-7.58898931322;色,-4.78272737587;遏,-7.70506148447;車,-8.32410069287;网,-7.49742211969;淒,-11.8794487544;奕,-8.54724424419;敏,-10.7808364657;著,-9.24039142475;寞,-8.78840630101;条,-8.09525912045;因,-8.00824774346;扣,-7.44863195552;闢,-10.4931543932;入,-6.37411721843;縫,-8.29592981591;聚,-9.10686003212;穢,-8.78840630101;換,-8.21588710823;当,-6.62195338234;息,-5.99612636588;揮,-8.54724424419;影,-6.58113138782;绰,-7.96742574894;詳,-7.42510145811;已,-6.67544206729;極,-7.70506148447;詩,-11.1863015738;隱,-8.41371285156;瑕,-10.0876892851;幻,-8.78840630101;出,-5.31700466067;顿,-9.17139855326;闔,-8.98907699647;蜀,-10.0876892851;簧,-10.2700108419;臭,-10.2700108419;誉,-8.6605729295;嬈,-10.4931543932;鞋,-9.10686003212;論,-5.93927750164;膏,-8.58361188836;戎,-9.10686003212;云,-6.90963545479;伐,-8.32410069287;讓,-7.56196064083;涂,-7.65994104919;辯,-8.98907699647;斗,-6.96679386863;还,-10.2700108419;輸,-9.10686003212;供,-8.14177913608;倚,-8.44546154988;紜,-7.67475613497;還,-10.2700108419;眠,-9.17139855326;掣,-8.29592981591;琢,-9.04623541031;傥,-8.70139492402;簇,-8.41371285156;带,-9.24039142475;里,-6.31492834704;堪,-7.81900574382;攬,-8.74395453843;缰,-9.80000721268;害,-7.68979401234;头,-6.41561694934;斷,-5.98229488673;嘶,-8.83492631664;抹,-8.24186259464;雞,-7.94762312164;沽,-9.48155348157;贼,-9.24039142475;缓,-7.15206093565;雁,-9.80000721268;杀,-8.21588710823;呂,-10.7808364657;情,-6.2026949521;纏,-8.6605729295;繆,-7.14325030597;畏,-7.98762845625;塊,-8.78840630101;响,-7.19731752724;敌,-6.5761438463;减,-7.68979401234;扎,-8.83492631664;滑,-9.57686366137;齐,-7.3151005629;裕,-11.1863015738;務,-8.32410069287;进,-6.68649190347;做,-7.68979401234;离,-6.17233848961;詞,-6.43703104384;盡,-5.86329159467;坠,-7.24471976613;口,-6.41561694934;渺,-8.70139492402;照,-7.96742574894;巧,-8.44546154988;书,-8.41371285156;苦,-6.59118172367;哭,-8.26853084172;敬,-7.00425143116;剮,-8.32410069287;彰,-7.92820503578;籲,-6.90271501194;饴,-10.0876892851;旷,-11.8794487544;獸,-7.24471976613;翻,-8.74395453843;遺,-8.32410069287;泽,-9.93353860531;荫,-9.57686366137;姿,-7.8904647078;瘁,-7.78510419214;裁,-7.70506148447;蒂,-9.48155348157;者,-9.93353860531;了,-8.16587668766;守,-7.25447594108;國,-6.71466278044;名,-5.98229488673;意,-4.88459876853;丑,-11.1863015738;鬓,-11.8794487544;沒,-6.26632064798;暖,-8.41371285156;则,-8.51215292438;厘,-10.0876892851;弛,-10.2700108419;肚,-8.21588710823;減,-7.68979401234;語,-5.14843065388;瘡,-9.93353860531;垠,-10.2700108419;膚,-8.98907699647;急,-6.03590433733;冤,-9.24039142475;货,-8.6605729295;度,-6.53234122365;讨,-9.10686003212;末,-7.92820503578;鈍,-9.68222417703;縱,-9.04623541031;蓉,-9.48155348157;貲,-11.8794487544;堵,-9.93353860531;蠟,-9.80000721268;船,-9.68222417703;鼻,-8.58361188836;殞,-9.93353860531;尽,-5.86329159467;涼,-8.78840630101;練,-9.93353860531;千,-7.94762312164;擂,-8.32410069287;凄,-11.8794487544;仆,-8.11824863867;诈,-8.21588710823;閃,-8.26853084172;毫,-7.46060814657;俐,-8.19056930025;類,-7.04316684741;敗,-9.80000721268;牙,-7.83639748653;变,-5.94455455874;佛,-8.4782513727;惚,-7.87211556913;鬢,-11.8794487544;祟,-7.54871541408;蟠,-11.1863015738;荣,-7.720565671;擺,-8.24186259464;恥,-7.28432890423;凤,-8.58361188836;腐,-11.1863015738;穩,-8.41371285156;寨,-8.32410069287;睫,-7.21600966025;臼,-10.4931543932;乱,-5.71403090013;蹶,-11.8794487544;塵,-8.58361188836;酥,-11.1863015738;長,-5.85117023413;零,-7.81900574382;司,-10.2700108419;轻,-7.65994104919;惺,-9.57686366137;淼,-11.1863015738;祿,-9.80000721268;潔,-9.48155348157;禁,-6.5467299611;親,-7.12585856326;待,-5.53030976298;喉,-10.0876892851;合,-6.09870523857;袋,-9.48155348157;聖,-10.4931543932;軟,-8.6605729295;亏,-10.0876892851;責,-8.58361188836;憑,-8.54724424419;扮,-8.16587668766;撓,-7.73631402797;枕,-9.68222417703;嘔,-9.10686003212;窗,-10.7808364657;外,-5.61224820582;趙,-8.44546154988;尘,-8.58361188836;悛,-10.4931543932;会,-7.12585856326;鑼,-10.7808364657;欢,-8.35308822975;两,-7.64534224977;焦,-11.1863015738;箭,-8.58361188836;躯,-8.70139492402;熱,-6.76746096601;腮,-8.21588710823;給,-11.1863015738;嘴,-8.24186259464;尸,-8.98907699647;傻,-10.2700108419;强,-7.44863195552;邦,-8.78840630101;放,-6.83602363744;私,-7.34684926121;燭,-8.88371648081;謊,-10.7808364657;必,-7.98762845625;幄,-8.19056930025;勇,-7.2066199199;兆,-8.21588710823;藉,-8.21588710823;呈,-8.51215292438;棋,-9.80000721268;牲,-8.58361188836;母,-10.7808364657;律,-7.80191131046;济,-6.93068886399;凑,-9.80000721268;恐,-7.14325030597;卒,-7.87211556913;角,-6.56132876052;祖,-8.51215292438;滥,-10.2700108419;烛,-8.88371648081;佚,-11.1863015738;盟,-8.16587668766;啞,-8.58361188836;斑,-10.4931543932;泣,-8.70139492402;止,-6.41138861323;鹤,-9.17139855326;腦,-6.4722769829;周,-11.1863015738;士,-7.05113501706;语,-5.14843065388;马,-5.97681542096;浮,-10.4931543932;灰,-7.92820503578;獲,-7.52273992767;變,-5.94455455874;晴,-9.24039142475;諷,-8.70139492402;饶,-8.3829411929;惻,-9.80000721268;设,-10.0876892851;揽,-8.74395453843;替,-9.10686003212;调,-8.29592981591;顫,-9.68222417703;麗,-8.58361188836;切,-6.59118172367;軀,-8.70139492402;针,-8.09525912045;栋,-8.35308822975;速,-8.88371648081;脑,-6.4722769829;香,-7.76857489019;隔,-8.70139492402;視,-8.21588710823;逛,-11.8794487544;座,-9.48155348157;星,-8.41371285156;颠,-10.4931543932;氣,-5.61035247066;客,-7.46060814657;伥,-8.74395453843;交,-6.6115905953;慰,-10.2700108419;枪,-8.44546154988;魄,-6.22345694354;鸯,-11.1863015738;證,-9.39454210458;厲,-6.98909962614;嚴,-7.41354063571;騷,-8.02930115265;费,-9.3144993969;岸,-9.57686366137;耻,-7.28432890423;阿,-8.6605729295;疾,-8.78840630101;寂,-8.35308822975;驱,-8.51215292438;則,-8.51215292438;准,-11.1863015738;哈,-10.2700108419;恶,-7.96742574894;筍,-8.02930115265;乏,-8.51215292438;腑,-7.5100009019;蝕,-9.80000721268;數,-5.93402814576;拜,-8.24186259464;號,-9.39454210458;脚,-6.2304745162;寢,-8.70139492402;令,-7.85409706363;鮮,-7.26432823752;填,-10.4931543932;锦,-8.9350097752;湯,-9.3144993969;差,-8.16587668766;共,-8.11824863867;遷,-7.96742574894;味,-6.45449873688;史,-8.88371648081;杵,-11.8794487544;更,-7.94762312164;婷,-8.9350097752;恻,-9.80000721268;牍,-9.39454210458;貫,-9.10686003212;梁,-8.98907699647;态,-7.09195701158;樂,-6.52759062089;倆,-10.4931543932;钉,-8.98907699647;見,-5.70983802187;軸,-11.8794487544;窍,-8.54724424419;嬌,-9.93353860531;導,-8.35308822975;傑,-9.48155348157;斓,-8.62135221634;戒,-8.9350097752;宗,-8.41371285156;高,-7.12585856326;沙,-8.29592981591;鳥,-8.29592981591;军,-7.56196064083;业,-6.40298520243;猜,-10.2700108419;吞,-11.1863015738;趣,-8.62135221634;伤,-7.46060814657;谁,-9.80000721268;倦,-8.62135221634;钩,-10.4931543932;用,-6.79185241913;損,-8.21588710823;领,-8.44546154988;第,-8.58361188836;侯,-10.0876892851;鄰,-9.93353860531;戲,-8.32410069287;朴,-10.7808364657;油,-7.92820503578;冻,-8.41371285156;为,-5.55329928121;鈴,-9.24039142475;壁,-6.84249615195;靡,-8.51215292438;跃,-10.4931543932;隊,-7.17896838857;滅,-7.05916718876;恆,-8.26853084172;哉,-9.17139855326;效,-6.72039345515;始,-7.720565671;洶,-7.15206093565;歌,-8.16587668766;俏,-8.83492631664;掌,-6.70896475933;罰,-10.2700108419;芳,-10.7808364657;雕,-8.24186259464;漏,-8.58361188836;诗,-11.1863015738;嵘,-10.2700108419;凛,-7.73631402797;勝,-6.18235526786;費,-9.3144993969;裡,-6.31492834704;緣,-8.21588710823;挺,-9.57686366137;以,-8.19056930025;潤,-10.4931543932;間,-6.3660200082;噪,-9.39454210458;竭,-6.82959274711;贓,-10.2700108419;兰,-11.8794487544;割,-8.35308822975;请,-11.1863015738;顶,-8.54724424419;击,-6.2269595741;脾,-8.78840630101;荼,-7.05916718876;響,-7.19731752724;腫,-10.7808364657;骂,-7.39081238463;清,-7.68979401234;径,-8.6605729295;指,-6.79804438938;肆,-9.57686366137;吉,-7.52273992767;肖,-8.14177913608;伏,-6.56624277532;擬,-8.51215292438;逑,-10.7808364657;憐,-7.78510419214;魚,-7.90915684081;芒,-9.48155348157;灯,-10.0876892851;袖,-10.7808364657;愛,-8.19056930025;初,-9.10686003212;土,-7.1087641299;撞,-8.09525912045;鈞,-8.9350097752;责,-8.58361188836;严,-7.41354063571;澤,-9.93353860531;曰,-11.8794487544;夫,-8.54724424419;險,-7.30473777586;設,-10.0876892851;弯,-9.80000721268;粮,-8.9350097752;週,-11.1863015738;冰,-8.14177913608;唳,-8.44546154988;劲,-10.7808364657;阵,-7.32557186276;期,-8.05080735787;嶸,-10.2700108419;儻,-8.70139492402;人,-5.07372620095;爽,-7.52273992767;鹽,-8.83492631664;飴,-10.0876892851;秀,-6.33818520921;赃,-10.2700108419;久,-6.9166041241;升,-10.7808364657;胆,-6.31876712335;葉,-8.14177913608;奋,-9.57686366137;囊,-8.41371285156;富,-10.0876892851;住,-7.06726439899;灑,-8.9350097752;筹,-7.35766017731;拒,-8.98907699647;晕,-11.1863015738;字,-7.56196064083;腾,-6.6064491958;剝,-9.57686366137;菜,-10.4931543932;束,-8.24186259464;擞,-7.83639748653;衡,-7.18810087213;諢,-9.10686003212;卧,-11.1863015738;烦,-7.92820503578;旨,-9.80000721268;盪,-7.25447594108;寬,-9.3144993969;软,-8.6605729295;眺,-10.4931543932;镳,-8.11824863867;齒,-6.29595244558;柴,-8.58361188836;護,-9.93353860531;趨,-6.92362169676;汹,-7.15206093565;养,-8.54724424419;牽,-10.2700108419;板,-10.0876892851;擾,-9.57686366137;宁,-7.5100009019;稀,-7.83639748653;溃,-9.04623541031;射,-8.9350097752;邇,-8.98907699647;匆,-9.48155348157;苟,-7.64534224977;骋,-9.10686003212;赖,-8.24186259464;禍,-6.87550244842;真,-7.32557186276;鼎,-7.8904647078;玑,-10.7808364657;成,-5.95519295695;老,-6.93068886399;儒,-8.88371648081;斕,-8.62135221634;梗,-10.0876892851;辙,-7.09195701158;丘,-11.1863015738;力,-5.23957292054;膝,-8.78840630101;怜,-7.78510419214;钟,-8.19056930025;霞,-11.8794487544;管,-8.98907699647;夢,-7.42510145811;尤,-8.70139492402;錦,-8.9350097752;瞩,-8.19056930025;蘆,-9.93353860531;榭,-10.7808364657;申,-8.11824863867;漸,-9.93353860531;到,-6.5467299611;準,-11.1863015738;琴,-9.04623541031;羹,-11.1863015738;常,-6.12687611554;膽,-6.31876712335;值,-8.09525912045;眾,-6.32262069266;证,-9.39454210458;仃,-8.83492631664;奂,-9.93353860531;盾,-7.70506148447;臥,-11.1863015738;立,-6.90271501194;槍,-8.44546154988;行,-5.64700073781;低,-8.44546154988;发,-4.97570149678;剐,-8.32410069287;兒,-8.51215292438;闕,-11.8794487544;規,-8.58361188836;棗,-10.2700108419;策,-6.6809517231;忙,-6.70896475933;乘,-8.16587668766;招,-9.39454210458;討,-9.10686003212;針,-8.09525912045;遜,-8.88371648081;應,-6.93780633175;非,-5.94985961097;寡,-9.57686366137;代,-6.79185241913;工,-7.60278263535;汤,-9.3144993969;惧,-8.11824863867;卦,-10.7808364657;矩,-8.4782513727;器,-8.4782513727;諫,-9.93353860531;番,-9.10686003212;硬,-10.0876892851;识,-6.69766520407;潮,-8.07278626459;扰,-9.57686366137;雳,-8.41371285156;迹,-6.78569855356;幸,-9.10686003212;精,-8.16587668766;布,-6.99664683178;如,-7.98762845625;紅,-8.26853084172;觀,-7.10032526125;有,-5.03463327516;暈,-11.1863015738;程,-9.04623541031;喊,-8.62135221634;复,-7.36858924785;小,-9.80000721268;美,-7.18810087213;谎,-10.7808364657;易,-6.45010312541;醒,-7.76857489019;甕,-9.39454210458;栗,-7.56196064083;鴻,-10.7808364657;幅,-9.93353860531;爛,-8.07278626459;慮,-6.41138861323;辛,-9.10686003212;吟,-9.80000721268;次,-7.29448127569;深,-6.88901616759;鸣,-7.34684926121;通,-6.4284103008;津,-8.51215292438;颦,-10.2700108419;性,-8.58361188836;厦,-8.29592981591;眩,-7.720565671;隨,-9.10686003212;薪,-7.58898931322;夭,-8.44546154988;饱,-9.24039142475;微,-6.97417397593;匱,-11.8794487544;鱉,-9.17139855326;阳,-9.57686366137;冲,-6.49495369157;财,-7.54871541408;样,-6.28102679537;家,-6.73778519786;弹,-8.05080735787;诵,-10.0876892851;刻,-6.22345694354;嶺,-7.34684926121;阔,-7.58898931322;態,-7.09195701158;驴,-10.2700108419;湃,-7.96742574894;益,-7.67475613497;浅,-7.98762845625;賄,-10.0876892851;假,-7.52273992767;张,-7.37963908403;蝉,-8.88371648081;才,-7.5100009019;橋,-8.83492631664;闊,-7.58898931322;俎,-10.7808364657;卑,-8.6605729295;晓,-7.46060814657;懒,-9.17139855326;塗,-7.65994104919;余,-6.98909962614;肥,-9.68222417703;剛,-8.44546154988;淚,-8.83492631664;惜,-8.62135221634;瑟,-10.4931543932;歡,-8.35308822975;桑,-8.41371285156;賤,-9.93353860531;槐,-8.9350097752;雨,-5.96055490009;橫,-9.93353860531;钧,-8.9350097752;業,-6.40298520243;迩,-8.98907699647;發,-4.97570149678;危,-6.90963545479;臠,-11.1863015738;敵,-6.5761438463;瓴,-9.57686366137;腰,-9.93353860531;寶,-6.57118105696;役,-9.48155348157;處,-6.33037266947;淺,-7.98762845625;兽,-7.24471976613;鑿,-8.29592981591;返,-8.21588710823;突,-10.7808364657;謀,-7.48499959969;较,-8.11824863867;堂,-7.94762312164;約,-8.88371648081;分,-7.43679749787;月,-6.74365031731;残,-11.8794487544;吊,-10.7808364657;碍,-10.4931543932;与,-11.8794487544;缺,-8.16587668766;錐,-11.1863015738;酒,-8.6605729295;倒,-7.48499959969;戰,-5.94455455874;騖,-10.7808364657;优,-8.02930115265;掛,-7.73631402797;尚,-10.7808364657;肝,-10.7808364657;骄,-11.1863015738;誡,-9.80000721268;笠,-11.8794487544;辣,-8.05080735787;贤,-10.4931543932;在,-6.58614392964;梭,-11.1863015738;讳,-7.68979401234;涯,-8.02930115265;花,-6.41561694934;焉,-7.25447594108;進,-6.68649190347;覷,-7.01191430391;娶,-8.83492631664;伸,-9.57686366137;去,-5.91586941075;尺,-6.95219506921;魉,-9.57686366137;谋,-7.48499959969;礴,-7.56196064083;嫁,-8.78840630101;心,-4.92767658996;桂,-9.80000721268;賅,-8.4782513727;资,-10.2700108419;胖,-10.0876892851;牆,-8.41371285156;曉,-7.46060814657;霍,-10.2700108419;篋,-11.8794487544;告,-8.78840630101;乎,-6.93780633175;捐,-10.7808364657;染,-7.48499959969;恒,-8.26853084172;赅,-8.4782513727;仙,-9.10686003212;叛,-11.1863015738;遲,-8.32410069287;樁,-9.17139855326;泥,-8.83492631664;赤,-7.78510419214;杨,-9.57686366137;寫,-7.76857489019;险,-7.30473777586;路,-6.21302206625;狱,-8.98907699647;印,-8.54724424419;柳,-9.10686003212;聲,-5.82735958544;編,-11.8794487544;決,-6.69766520407;能,-7.26432823752;兼,-11.1863015738;赦,-8.4782513727;百,-7.43679749787;威,-7.54871541408;简,-9.17139855326;弃,-7.76857489019;绪,-8.24186259464;着,-9.24039142475;笋,-8.02930115265;红,-8.26853084172;刑,-9.10686003212;圓,-8.54724424419;吕,-10.7808364657;思,-6.68649190347;农,-10.2700108419;生,-5.02720618531;宠,-8.6605729295;梢,-8.98907699647;愧,-7.12585856326;芦,-9.93353860531;瘩,-10.7808364657;輝,-8.54724424419;頭,-6.41561694934;馬,-5.97681542096;累,-8.44546154988;亮,-11.1863015738;爱,-8.19056930025;拉,-11.1863015738;傲,-8.6605729295;鐵,-6.73778519786;舟,-7.07542770963;夷,-8.16587668766;丹,-10.4931543932;医,-10.0876892851;辞,-6.81685372134;政,-7.33615397209;难,-6.3579878365;節,-7.32557186276;裂,-6.80427493913;居,-8.44546154988;捷,-10.2700108419;擊,-6.2269595741;衍,-9.24039142475;赏,-8.51215292438;从,-6.39051102821;剑,-7.70506148447;提,-8.41371285156;呕,-9.10686003212;量,-7.70506148447;套,-9.04623541031;竖,-10.7808364657;忘,-7.16094988307;凜,-7.73631402797;回,-7.57538366116;焚,-7.11727481957;黑,-8.35308822975;飢,-10.0876892851;履,-9.3144993969;昧,-8.98907699647;內,-9.39454210458;材,-8.29592981591;噩,-11.8794487544;孫,-7.76857489019;薦,-9.24039142475;艱,-8.98907699647;台,-9.68222417703;萌,-9.93353860531;痴,-8.29592981591;風,-6.32262069266;幹,-7.34684926121;惕,-9.80000721268;獻,-8.70139492402;災,-7.56196064083;懼,-8.11824863867;长,-5.85117023413;图,-7.15206093565;护,-9.93353860531;境,-7.35766017731;异,-6.2269595741;暇,-7.720565671;言,-5.75476536347;醉,-7.96742574894;饿,-9.24039142475;龍,-7.83639748653;喑,-10.0876892851;吐,-6.93068886399;肓,-8.70139492402;鹿,-10.4931543932;識,-6.69766520407;妙,-5.94985961097;領,-8.44546154988;禮,-7.19731752724;枝,-8.07278626459;功,-7.04316684741;鉞,-10.4931543932;漢,-8.83492631664;讥,-8.54724424419;皮,-8.16587668766;環,-7.23505785522;怨,-8.05080735787;沫,-9.17139855326;辭,-6.81685372134;測,-6.68649190347;傳,-6.98160895441;露,-7.83639748653;戴,-9.48155348157;纷,-6.69766520407;师,-7.44863195552;欺,-11.8794487544;势,-6.33427130988;愾,-8.51215292438;腋,-11.8794487544;局,-8.29592981591;贊,-9.57686366137;蛇,-7.70506148447;靠,-7.75231436932;凉,-8.78840630101;峋,-9.68222417703;半,-8.11824863867;忍,-7.75231436932;乌,-9.48155348157;揖,-8.83492631664;衷,-6.90963545479;青,-8.4782513727;仗,-9.68222417703;炸,-8.88371648081;願,-6.53234122365;譚,-7.98762845625;馆,-10.4931543932;缠,-8.6605729295;拟,-8.51215292438;煞,-8.21588710823;跡,-6.78569855356;屠,-9.57686366137;形,-7.34684926121;恨,-7.85409706363;若,-7.52273992767;俭,-10.7808364657;端,-7.29448127569;奮,-9.57686366137;鑰,-10.2700108419;想,-5.6275448712;餒,-11.1863015738;鉴,-7.28432890423;价,-7.12585856326;賴,-8.24186259464;擻,-7.83639748653;濫,-10.2700108419;气,-5.61035247066;洁,-9.48155348157;窄,-9.48155348157;疆,-8.44546154988;儉,-10.7808364657;西,-8.14177913608;尋,-9.80000721268;二,-6.05050313675;拙,-8.24186259464;龙,-7.83639748653;垒,-8.6605729295;黃,-8.88371648081;迎,-8.62135221634;礙,-10.4931543932;题,-10.4931543932;君,-10.0876892851;定,-5.91074119438;朝,-10.4931543932;戟,-9.17139855326;負,-7.65994104919;茅,-7.2066199199;蔚,-10.7808364657;鬥,-6.96679386863;誤,-9.39454210458;挠,-7.73631402797;潰,-9.04623541031;飽,-9.24039142475;措,-5.71403090013;裘,-10.2700108419;榮,-7.720565671;煉,-8.9350097752;耳,-6.87550244842;試,-7.57538366116;茵,-9.3144993969;縷,-7.61676887732;殺,-8.21588710823;朽,-8.41371285156;憾,-9.10686003212;流,-6.13324556382;计,-5.85842540501;珊,-10.7808364657;竄,-8.32410069287;光,-7.61676887732;烈,-6.23754168343;屋,-10.7808364657;及,-5.7702011716;位,-9.57686366137;绌,-8.3829411929;軌,-8.88371648081;救,-8.09525912045;道,-5.25140737818;鲫,-9.93353860531;騎,-11.8794487544;拔,-7.68979401234;訓,-10.7808364657;歸,-6.45891375509;壘,-8.6605729295;野,-7.16094988307;盜,-8.21588710823;档,-11.8794487544;迢,-7.63095351231;步,-7.01191430391;虧,-10.0876892851;旦,-7.08365820877;兩,-7.64534224977;惨,-10.4931543932;只,-9.68222417703;潭,-10.7808364657;廬,-8.29592981591;驯,-8.51215292438;理,-5.71824143267;穿,-8.35308822975;習,-11.1863015738;卵,-9.10686003212;诺,-9.68222417703;睽,-7.92820503578;盼,-8.29592981591;承,-7.78510419214;體,-6.94497482123;岁,-9.93353860531;紀,-8.07278626459;市,-7.61676887732;誅,-8.9350097752;靈,-7.64534224977;澀,-9.93353860531;肉,-7.65994104919;脈,-7.05916718876;趋,-6.92362169676;舊,-7.81900574382;躍,-10.4931543932;箏,-10.7808364657;貉,-9.48155348157;锐,-8.19056930025;豎,-10.7808364657;投,-8.88371648081;得,-5.80640422026;棘,-9.39454210458;墙,-8.41371285156;蠅,-8.98907699647;霜,-6.95946782854;原,-7.60278263535;逞,-11.1863015738;没,-6.26632064798;素,-7.05916718876;妣,-9.80000721268;踢,-8.11824863867;窥,-11.8794487544;魂,-9.48155348157;否,-7.60278263535;肩,-9.24039142475;眉,-9.57686366137;庆,-8.24186259464;庭,-7.3151005629;讯,-10.2700108419;鏡,-10.0876892851;钱,-11.8794487544;田,-7.98762845625;决,-6.69766520407;嘲,-11.8794487544;猴,-10.2700108419;德,-6.74365031731;疵,-9.57686366137;喻,-6.50881072624;朋,-10.7808364657;艰,-8.98907699647;倾,-9.80000721268;況,-11.8794487544;絀,-8.3829411929;邊,-9.3144993969;竅,-8.54724424419;賣,-9.17139855326;呆,-6.43703104384;先,-7.48499959969;淋,-9.80000721268;軍,-7.56196064083;衣,-8.54724424419;哑,-8.58361188836;边,-9.3144993969;晒,-8.98907699647;動,-4.85925804605;俗,-7.01191430391;游,-9.17139855326;裙,-11.8794487544;退,-8.41371285156;痛,-8.44546154988;婚,-9.93353860531;睜,-9.68222417703;聞,-5.86329159467;解,-6.50881072624;菊,-11.8794487544;童,-9.48155348157;此,-7.46060814657;全,-6.77958232654;巫,-8.9350097752;续,-6.58113138782;彬,-8.51215292438;误,-9.39454210458;确,-7.60278263535;数,-5.93402814576;至,-6.56624277532;迷,-8.51215292438;奸,-8.19056930025;闻,-5.86329159467;空,-6.66996260152;国,-6.71466278044;杼,-10.7808364657;灾,-7.56196064083;封,-9.3144993969;靂,-8.41371285156;亂,-5.71403090013;稅,-8.35308822975;倉,-8.6605729295;洋,-6.86881346027;把,-8.4782513727;後,-6.18908930004;碎,-7.40211193989;向,-6.98160895441;扯,-8.78840630101;众,-6.32262069266;媚,-9.10686003212;果,-7.14325030597;簡,-9.17139855326;綠,-8.62135221634;亢,-8.62135221634;室,-9.10686003212;闪,-8.26853084172;群,-8.26853084172;紫,-8.62135221634;龊,-10.4931543932;中,-7.27427856838;木,-6.97417397593;新,-6.3579878365;興,-11.8794487544;蟲,-9.80000721268;爵,-8.58361188836;感,-8.83492631664;強,-7.44863195552;根,-7.92820503578;攻,-8.24186259464;窺,-11.8794487544;雪,-7.61676887732;請,-11.1863015738;猿,-10.2700108419;傾,-9.80000721268;汁,-8.44546154988;廂,-11.8794487544;驅,-8.51215292438;陷,-8.74395453843;蝇,-8.98907699647;懈,-7.56196064083;测,-6.68649190347;雙,-8.32410069287;忌,-7.8904647078;譏,-8.54724424419;題,-10.4931543932;鑑,-7.28432890423;腹,-7.68979401234;钢,-9.04623541031;胸,-8.32410069287;敛,-8.07278626459;彎,-9.80000721268;柜,-8.54724424419;损,-8.21588710823;污,-8.51215292438;珑,-7.80191131046;廢,-7.64534224977;驥,-9.04623541031;豹,-10.2700108419;玉,-7.39081238463;瓦,-9.57686366137;聩,-9.39454210458;约,-8.88371648081;结,-9.24039142475;壮,-6.45449873688;葱,-8.16587668766;关,-6.76145494195;殿,-9.17139855326;牵,-10.2700108419;援,-8.21588710823;華,-7.53564333251;白,-6.74365031731;餐,-9.17139855326;卿,-10.7808364657;征,-9.17139855326;一,-6.81685372134;邪,-8.41371285156;鹼,-11.8794487544;隅,-10.0876892851;圆,-8.54724424419;厉,-6.98909962614;戈,-8.74395453843;事,-5.16164405934;抓,-11.8794487544;途,-8.70139492402;粗,-8.3829411929;编,-11.8794487544;肺,-8.88371648081;際,-6.78569855356;多,-7.23505785522;喝,-10.0876892851;悟,-6.5467299611;索,-7.15206093565;堤,-10.4931543932;璧,-9.39454210458;辰,-9.80000721268;掩,-9.39454210458;享,-9.68222417703;優,-8.02930115265;隐,-8.41371285156;尬,-10.4931543932;劳,-6.67544206729;甲,-9.10686003212;况,-11.8794487544;容,-7.43679749787;樸,-10.7808364657;夺,-7.90915684081;施,-6.94497482123;吼,-10.7808364657;肿,-10.7808364657;慨,-9.24039142475;种,-7.29448127569;毡,-8.41371285156;櫃,-8.54724424419;終,-6.80427493913;扈,-8.41371285156;廣,-7.96742574894;魎,-9.57686366137;虐,-9.17139855326;鳴,-7.34684926121;搏,-11.1863015738;毙,-7.96742574894;藥,-7.15206093565;四,-6.64834013751;楚,-8.83492631664;藝,-8.29592981591;瑜,-10.7808364657;烟,-8.05080735787;信,-6.62717532632;习,-11.1863015738;為,-5.55329928121;烧,-8.41371285156;睦,-10.4931543932;武,-7.96742574894;屬,-9.57686366137;壯,-6.45449873688;柱,-7.46060814657;翩,-8.88371648081;拳,-7.98762845625;敲,-11.8794487544;釵,-10.7808364657;側,-7.5100009019;给,-11.1863015738;对,-6.80427493913;呼,-7.67475613497;笔,-9.39454210458;漁,-9.24039142475;院,-8.88371648081;嶂,-9.10686003212;按,-11.8794487544;劈,-10.7808364657;下,-4.82672770513;冊,-9.57686366137;納,-11.1863015738;沌,-10.4931543932;苒,-9.39454210458;炙,-10.2700108419;閒,-7.81900574382;悔,-9.04623541031;餘,-6.98909962614;誘,-9.24039142475;置,-8.78840630101;借,-11.1863015738;现,-6.48582120801;樣,-6.28102679537;谐,-10.4931543932;颤,-9.68222417703;终,-6.80427493913;动,-4.85925804605;師,-7.44863195552;细,-7.96742574894;绳,-11.8794487544;堯,-11.8794487544;议,-6.01015184123;擁,-7.98762845625;阶,-10.4931543932;疲,-8.32410069287;網,-7.49742211969;谷,-8.3829411929;羶,-10.7808364657;骸,-9.04623541031;阻,-7.39081238463;覺,-5.80640422026;蒼,-8.6605729295;耿,-7.15206093565;財,-7.54871541408;棄,-7.76857489019;摇,-7.42510145811;顰,-10.2700108419;草,-7.94762312164;籍,-11.8794487544;之,-5.28093972575;释,-11.1863015738;销,-8.4782513727;顏,-9.3144993969;驢,-10.2700108419;酬,-9.68222417703;盐,-8.83492631664;打,-7.25447594108;痒,-8.62135221634;饥,-10.0876892851;孙,-7.76857489019;骥,-9.04623541031;虛,-7.67475613497;敝,-10.4931543932;瓜,-8.21588710823;齿,-6.29595244558;詣,-9.39454210458;巢,-10.7808364657;祥,-9.57686366137;壤,-8.6605729295;摧,-8.3829411929;运,-10.0876892851;賬,-9.80000721268;困,-7.98762845625;艳,-10.0876892851;闲,-7.81900574382;兵,-6.89584213266;館,-10.4931543932;歹,-7.25447594108;登,-8.11824863867;偿,-7.57538366116;現,-6.48582120801;躁,-9.39454210458;开,-6.86881346027;爪,-7.85409706363;颅,-9.17139855326;处,-6.33037266947;文,-7.61676887732;嘆,-7.53564333251;纭,-7.67475613497;例,-7.35766017731;逊,-8.88371648081;福,-7.46060814657;税,-8.35308822975;皑,-9.3144993969;脔,-11.1863015738;世,-6.2199665386;骗,-8.83492631664;钝,-9.68222417703;甜,-9.80000721268;熟,-7.90915684081;舞,-6.66996260152;亡,-6.28102679537;传,-6.98160895441;宣,-7.65994104919;谢,-6.37006041774;斧,-7.90915684081;瘦,-7.8904647078;助,-7.90915684081;怪,-6.06531822254;岭,-7.34684926121;種,-7.29448127569;皱,-8.83492631664;地,-4.5715759736;防,-6.86216891755;誦,-10.0876892851;帶,-9.24039142475;瞻,-8.83492631664;咽,-7.83639748653;爾,-8.11824863867;仁,-6.73195427755;迫,-7.34684926121;求,-6.37006041774;奄,-9.24039142475;症,-8.19056930025;愿,-6.53234122365;勉,-10.2700108419;聊,-10.2700108419;灭,-7.05916718876;囑,-10.2700108419;坐,-7.08365820877;瓢,-10.4931543932;僕,-8.11824863867;兔,-8.54724424419;湖,-9.48155348157;存,-7.19731752724;矛,-11.8794487544;蓝,-10.0876892851;镜,-10.0876892851;營,-7.33615397209;贫,-9.04623541031;满,-7.54871541408;诣,-9.39454210458;旧,-7.81900574382;晦,-8.09525912045;獨,-10.4931543932;快,-7.33615397209;峭,-9.80000721268;眼,-6.74365031731;杰,-9.48155348157;右,-9.68222417703;僵,-9.39454210458;兴,-11.8794487544;巷,-7.1087641299;诨,-9.10686003212;竹,-6.84901083297;學,-8.32410069287;瀾,-6.92362169676;凿,-8.29592981591;艾,-7.43679749787;丁,-8.62135221634;往,-6.15586365241;堅,-10.4931543932;禄,-9.80000721268;赀,-11.8794487544;舉,-6.41561694934;炊,-8.98907699647;對,-6.80427493913;涌,-7.23505785522;析,-7.8904647078;怕,-8.16587668766;洗,-8.3829411929;庖,-8.98907699647;騙,-8.83492631664;殘,-11.8794487544;望,-6.86216891755;喜,-7.23505785522;償,-7.57538366116;办,-8.16587668766;鸡,-7.94762312164;利,-6.49037702455;推,-10.0876892851;漫,-8.70139492402;摆,-8.24186259464;谭,-7.98762845625;綬,-11.1863015738;窮,-6.44136944544;嘱,-10.2700108419;贷,-7.80191131046;纶,-8.6605729295;樹,-9.48155348157;聵,-9.39454210458;確,-7.60278263535;落,-5.8487634941;儿,-8.51215292438;规,-8.58361188836;馁,-11.1863015738;集,-7.60278263535;看,-7.16094988307;株,-11.8794487544;惊,-5.77689015975;屍,-8.98907699647;奏,-9.39454210458;虑,-6.41138861323;擒,-8.98907699647;違,-8.05080735787;败,-9.80000721268;睛,-6.62717532632;關,-6.76145494195;勞,-6.67544206729;乡,-6.98160895441;翠,-11.8794487544;正,-6.84901083297;波,-7.83639748653;桥,-8.83492631664;物,-6.24109408503;缚,-9.80000721268;輩,-8.70139492402;即,-9.17139855326;擲,-7.53564333251;灵,-7.64534224977;致,-6.73195427755;海,-6.16242105296;绶,-11.1863015738;寸,-11.8794487544;諾,-9.68222417703;命,-5.72459066035;拾,-7.41354063571;
+E,jn:量,-1.09861228867;西,-0.405465108108;
+E,j:退,-10.0818986958;專,-7.15515929377;渔,-7.26848797908;骧,-10.0818986958;礦,-6.75566435265;伪,-7.68400342304;售,-9.47576289227;河,-7.24868535179;徵,-9.10106944283;銷,-9.38875151528;方,-6.71460286586;场,-8.54145365489;宽,-8.11245804938;线,-5.67112264788;反,-8.3771506036;牌,-9.57107307208;科,-6.25325729935;桐,-8.82913572735;織,-7.94183253235;员,-9.38875151528;飛,-6.92489827469;话,-8.3771506036;统,-7.40775004642;遠,-9.92774801601;緩,-9.23460083545;班,-10.0818986958;年,-6.05061226959;滿,-7.51694933838;球,-9.04044482101;厂,-9.47576289227;馆,-11.1805109845;沈,-8.73816394914;輕,-9.67643358773;五,-10.4873638039;列,-8.0669956753;無,-8.16008609837;貨,-8.23607200534;是,-8.9292191859;單,-7.02162790115;讲,-9.47576289227;户,-9.92774801601;冶,-5.53860391357;改,-6.35219724721;頻,-10.4873638039;胀,-3.47795487124;参,-8.82913572735;视,-5.75776603959;運,-5.80292043707;毒,-8.61556162705;录,-10.0818986958;黔,-7.65415045989;教,-5.61599057719;衛,-7.0614738097;州,-9.30870880761;惠,-8.98328640717;火,-11.8736581651;独,-8.6547823402;维,-10.4873638039;基,-9.47576289227;广,-6.04765805769;輪,-8.04501676858;后,-7.46693891781;频,-10.4873638039;餐,-10.0818986958;經,-6.24964065888;輔,-9.92774801601;甘,-6.93918423194;股,-10.0818986958;醫,-7.55617005153;足,-9.47576289227;纵,-10.2642202526;後,-7.46693891781;潔,-10.4873638039;濟,-9.79421662339;属,-10.0818986958;民,-8.98328640717;机,-7.84830647433;寧,-7.2886906864;偶,-10.2642202526;智,-10.4873638039;老,-7.90336625152;冀,-8.02351056336;节,-8.16008609837;北,-7.39632135059;弟,-8.78261571171;冠,-9.67643358773;抢,-9.16560796397;春,-7.44284136623;欧,-6.97581836512;帝,-9.47576289227;纪,-9.92774801601;爭,-11.8736581651;术,-8.61556162705;報,-7.17317779928;課,-11.8736581651;稽,-11.8736581651;殼,-9.79421662339;汉,-6.1969043628;今,-10.2642202526;双,-9.04044482101;塑,-10.7750458764;综,-11.1805109845;南,-7.09453467196;散,-8.61556162705;編,-7.58319872392;杯,-10.2642202526;称,-9.47576289227;荷,-9.23460083545;固,-8.73816394914;导,-7.04534442777;鄂,-6.60065860651;师,-7.74652378002;库,-8.87792589152;气,-7.88467411851;化,-3.95685067413;邮,-9.67643358773;採,-8.57782129907;分,-9.57107307208;褲,-9.38875151528;水,-7.37384849474;貿,-5.39055081361;所,-3.9641686724;病,-9.38875151528;壇,-11.8736581651;重,-6.64791149136;职,-7.96163515964;译,-11.8736581651;结,-9.16560796397;內,-8.18477871096;監,-8.31831010358;日,-10.4873638039;学,-6.58539113438;陸,-9.38875151528;技,-8.02351056336;标,-5.94940236766;越,-9.67643358773;专,-7.15515929377;加,-11.8736581651;缩,-6.68627235923;警,-5.29718859602;稻,-11.8736581651;碼,-10.0818986958;轉,-8.98328640717;配,-8.40792226227;城,-10.7750458764;乓,-8.23607200534;角,-6.87644589131;補,-9.67643358773;江,-7.06963712034;连,-8.04501676858;卡,-10.2642202526;陣,-8.82913572735;黨,-7.66896554568;平,-9.10106944283;職,-7.96163515964;好,-8.78261571171;妇,-8.87792589152;争,-11.8736581651;压,-10.0818986958;输,-8.18477871096;團,-8.16008609837;縮,-6.68627235923;务,-7.1029735406;澳,-6.50768215005;冷,-9.38875151528;戶,-9.92774801601;鋁,-8.00245715416;區,-5.83578724515;彈,-10.2642202526;友,-8.13598854679;制,-6.41833704971;藏,-6.56045218603;歐,-6.97581836512;法,-6.92489827469;雙,-9.04044482101;裝,-7.98183786696;啤,-6.13708586759;試,-8.40792226227;公,-6.78606182984;普,-11.1805109845;議,-8.50636233508;浴,-9.57107307208;读,-8.78261571171;會,-3.48771326026;三,-8.61556162705;首,-9.67643358773;册,-10.7750458764;缓,-9.23460083545;魯,-10.0818986958;講,-9.47576289227;负,-8.02351056336;亞,-7.29894718657;大,-2.71503222878;温,-9.67643358773;侨,-9.67643358773;沪,-7.74652378002;支,-8.98328640717;稱,-9.47576289227;记,-10.2642202526;队,-7.39632135059;权,-6.44431253612;届,-6.38886123158;体,-6.05061226959;展,-5.86239099067;族,-8.04501676858;拖,-8.11245804938;點,-11.1805109845;珠,-10.2642202526;督,-9.92774801601;奧,-9.67643358773;卫,-7.0614738097;話,-8.3771506036;佳,-7.07786761947;權,-6.44431253612;墓,-6.61096797616;写,-9.67643358773;岛,-8.78261571171;患,-7.81321515452;产,-3.02788090988;账,-9.16560796397;铁,-6.76771269117;段,-11.1805109845;收,-7.62516292302;逸,-11.8736581651;治,-9.57107307208;区,-5.83578724515;辽,-11.8736581651;調,-8.47246078341;社,-6.89005154336;旁,-9.04044482101;杂,-11.8736581651;织,-7.94183253235;案,-8.57782129907;壓,-10.0818986958;试,-8.40792226227;博,-8.61556162705;保,-3.71829604474;面,-9.57107307208;浦,-7.43100690858;婦,-8.87792589152;短,-9.30870880761;壳,-9.79421662339;選,-8.23607200534;幼,-7.4916315304;考,-8.61556162705;包,-8.87792589152;變,-8.21009651894;服,-9.04044482101;戏,-10.2642202526;檔,-9.67643358773;黄,-7.27853831494;連,-8.04501676858;風,-10.4873638039;宪,-6.48916310228;農,-6.81106313204;脹,-3.47795487124;稿,-9.92774801601;诊,-8.3771506036;野,-9.16560796397;術,-8.61556162705;财,-7.25853764823;體,-6.05061226959;機,-7.84830647433;勤,-8.23607200534;副,-8.98328640717;統,-7.40775004642;峰,-8.78261571171;时,-7.63955166047;庫,-8.87792589152;销,-9.38875151528;銅,-9.23460083545;錄,-10.0818986958;開,-8.9292191859;訊,-10.7750458764;林,-6.62138473702;报,-7.17317779928;館,-11.1805109845;訪,-7.84830647433;搶,-9.16560796397;点,-11.1805109845;访,-7.84830647433;品,-6.26053005868;療,-11.1805109845;屆,-6.38886123158;棉,-8.50636233508;結,-9.16560796397;乒,-11.8736581651;作,-8.43967096058;塞,-10.4873638039;員,-9.38875151528;院,-5.09146610906;拥,-10.4873638039;园,-8.13598854679;華,-5.9547643108;走,-10.2642202526;干,-8.47246078341;價,-11.8736581651;艺,-9.16560796397;門,-8.82913572735;少,-10.0818986958;箔,-10.7750458764;贛,-6.93918423194;渝,-9.79421662339;蘭,-8.87792589152;匯,-9.16560796397;炮,-8.08946853115;銀,-6.0330165077;總,-9.23460083545;軋,-10.7750458764;协,-5.28610815024;郎,-7.94183253235;評,-8.50636233508;比,-2.61433717087;赛,-8.34729764045;獎,-11.8736581651;九,-9.23460083545;远,-9.92774801601;飞,-6.92489827469;无,-8.16008609837;团,-8.16008609837;轧,-10.7750458764;药,-6.58539113438;山,-10.7750458764;桑,-10.7750458764;银,-6.0330165077;翼,-8.9292191859;极,-9.47576289227;劃,-8.47246078341;内,-8.18477871096;安,-10.7750458764;同,-10.2642202526;研,-7.90336625152;圖,-8.31831010358;战,-5.20416007521;劣,-8.57782129907;產,-3.02788090988;太,-8.82913572735;洲,-6.77990796426;場,-8.54145365489;麻,-8.61556162705;款,-7.45481755727;資,-6.38886123158;华,-5.9547643108;托,-10.7750458764;党,-7.66896554568;食,-11.8736581651;糧,-6.05654700511;车,-7.39632135059;審,-9.38875151528;省,-5.36936999153;和,-7.07786761947;透,-8.08946853115;休,-9.92774801601;源,-10.2642202526;訓,-8.31831010358;侦,-8.26274025243;鎮,-7.36279865855;網,-10.0818986958;设,-9.16560796397;汇,-9.16560796397;證,-3.45739089224;晋,-5.30417674466;車,-7.39632135059;网,-10.0818986958;勘,-9.67643358773;入,-7.55617005153;聯,-5.43271162444;影,-8.6547823402;極,-9.47576289227;購,-11.8736581651;课,-11.8736581651;企,-5.15706339155;型,-8.69560433472;伐,-5.84057194327;疗,-11.1805109845;通,-7.74652378002;带,-9.67643358773;蔬,-8.08946853115;害,-9.79421662339;參,-8.82913572735;界,-8.23607200534;量,-7.38502179534;黑,-9.92774801601;代,-7.02947107861;務,-7.1029735406;进,-7.27853831494;口,-8.04501676858;煤,-6.95367723924;嫩,-10.2642202526;晶,-9.79421662339;賽,-8.34729764045;者,-7.81321515452;國,-8.13598854679;丑,-11.8736581651;皖,-7.36279865855;綜,-11.1805109845;钢,-6.52180003159;货,-8.23607200534;约,-5.55830016355;縱,-10.2642202526;堵,-9.92774801601;船,-7.17317779928;运,-5.80292043707;委,-4.55843977532;变,-8.21009651894;辦,-5.83340345379;旬,-9.23460083545;乱,-11.1805109845;長,-8.54145365489;特,-9.67643358773;司,-9.92774801601;轻,-9.67643358773;汽,-5.02459188244;西,-6.19348555605;禁,-11.8736581651;辅,-9.92774801601;合,-6.74375945015;軟,-9.10106944283;外,-5.16924381011;会,-3.48771326026;閩,-9.92774801601;训,-8.31831010358;贮,-9.47576289227;强,-8.50636233508;私,-9.10106944283;血,-11.8736581651;勇,-11.8736581651;醜,-11.8736581651;母,-9.23460083545;经,-6.24964065888;济,-9.79421662339;金,-6.89692442265;荒,-11.1805109845;奖,-11.8736581651;盟,-4.65915375092;啞,-9.79421662339;周,-10.2642202526;灰,-11.1805109845;调,-8.47246078341;针,-7.83060689724;排,-8.61556162705;視,-5.75776603959;星,-9.47576289227;氣,-7.88467411851;客,-7.07786761947;交,-10.7750458764;咨,-11.1805109845;港,-9.10106944283;费,-10.0818986958;貸,-5.24694041582;总,-9.23460083545;检,-5.78461328962;组,-9.23460083545;准,-11.1805109845;浙,-6.37239995452;询,-10.0818986958;级,-8.16008609837;牧,-6.28267118456;淮,-5.34278053734;共,-4.59158450698;胰,-11.8736581651;史,-11.1805109845;直,-6.55553817123;穷,-10.4873638039;鋼,-6.52180003159;率,-7.68400342304;逆,-9.23460083545;導,-7.04534442777;傑,-10.7750458764;間,-8.04501676858;划,-8.47246078341;算,-9.04044482101;拘,-8.0669956753;军,-4.15987354847;业,-4.01540398288;控,-5.3589454742;戲,-10.2642202526;油,-6.40559802393;贸,-5.39055081361;磁,-10.7750458764;蓉,-11.8736581651;效,-9.38875151528;僑,-9.67643358773;式,-10.7750458764;勝,-9.92774801601;費,-10.0818986958;詢,-10.0818986958;绥,-8.02351056336;陪,-9.23460083545;兰,-8.87792589152;资,-6.38886123158;矿,-6.75566435265;码,-10.0818986958;清,-10.7750458764;指,-4.21025050018;隊,-7.39632135059;伏,-6.08369799417;愛,-10.2642202526;亚,-7.29894718657;初,-11.8736581651;土,-9.23460083545;校,-5.4375077967;责,-10.7750458764;檢,-5.78461328962;群,-7.63955166047;險,-6.34026867634;設,-9.16560796397;粮,-6.05654700511;週,-10.2642202526;申,-11.8736581651;阵,-8.82913572735;期,-4.55048744713;人,-7.15515929377;觀,-10.0818986958;幅,-6.27153934419;俄,-7.21969781491;益,-9.38875151528;住,-8.69560433472;赣,-6.93918423194;门,-8.82913572735;寬,-8.11245804938;软,-9.10106944283;陵,-8.43967096058;柴,-11.8736581651;建,-5.24297477943;板,-10.2642202526;宁,-7.2886906864;超,-8.82913572735;梗,-10.2642202526;龙,-8.98328640717;力,-10.2642202526;級,-8.16008609837;审,-9.38875151528;违,-10.2642202526;貯,-9.47576289227;戰,-5.20416007521;儲,-4.17835503011;边,-10.4873638039;游,-6.6975084325;值,-8.69560433472;眾,-8.00245715416;证,-3.45739089224;黃,-7.27853831494;种,-8.04501676858;行,-2.68229675969;低,-9.38875151528;发,-4.42299736886;兒,-9.67643358773;湘,-8.87792589152;招,-8.0669956753;針,-7.83060689724;非,-9.92774801601;廣,-6.04765805769;纺,-4.37589646445;工,-5.52626895541;層,-8.50636233508;器,-10.7750458764;硬,-7.63955166047;轮,-8.04501676858;遼,-11.8736581651;有,-10.0818986958;程,-9.57107307208;小,-5.058018175;美,-5.97376081149;创,-7.59699204605;津,-7.40775004642;性,-8.50636233508;阳,-11.8736581651;憲,-6.48916310228;电,-4.13169026525;弹,-10.2642202526;嶺,-9.23460083545;观,-10.0818986958;假,-9.92774801601;拐,-10.0818986958;線,-5.67112264788;胜,-9.92774801601;章,-9.92774801601;幣,-9.04044482101;革,-6.56539046767;業,-4.01540398288;修,-8.34729764045;難,-11.8736581651;突,-11.8736581651;堂,-7.46693891781;約,-5.55830016355;爆,-10.0818986958;残,-8.78261571171;綏,-8.02351056336;优,-8.00245715416;木,-9.30870880761;帮,-7.08616642229;進,-7.27853831494;輸,-8.18477871096;促,-11.8736581651;桂,-7.4916315304;組,-9.23460083545;采,-8.57782129907;牆,-10.7750458764;告,-9.92774801601;寫,-9.67643358773;路,-11.8736581651;石,-10.7750458764;跨,-11.8736581651;能,-3.88817380834;百,-7.23892917684;讀,-8.78261571171;嘉,-8.13598854679;农,-6.81106313204;生,-7.00612371461;模,-8.78261571171;爱,-10.2642202526;现,-9.04044482101;育,-10.4873638039;鐵,-6.76771269117;医,-7.55617005153;政,-6.75566435265;难,-11.8736581651;節,-8.16008609837;裂,-11.1805109845;居,-7.84830647433;卷,-10.2642202526;晉,-5.30417674466;照,-7.35186958802;险,-6.34026867634;台,-8.02351056336;间,-8.04501676858;幹,-8.47246078341;偽,-7.68400342304;长,-8.54145365489;图,-8.31831010358;境,-7.09453467196;龍,-8.98328640717;園,-8.13598854679;漢,-6.1969043628;測,-9.16560796397;局,-5.52626895541;商,-6.86302287097;青,-9.57107307208;願,-9.79421662339;驤,-10.0818986958;端,-8.26274025243;价,-11.8736581651;發,-4.42299736886;洁,-10.4873638039;疆,-11.1805109845;二,-8.04501676858;定,-8.57782129907;朝,-7.23892917684;障,-11.1805109845;紡,-4.37589646445;負,-8.02351056336;储,-4.17835503011;京,-9.67643358773;唱,-11.1805109845;房,-8.23607200534;流,-7.26848797908;管,-5.52977773094;光,-9.79421662339;位,-11.8736581651;道,-11.1805109845;单,-7.02162790115;雜,-11.8736581651;档,-9.67643358773;旦,-9.10106944283;部,-5.41845960173;豫,-7.09453467196;滬,-7.74652378002;鲁,-10.0818986958;紀,-9.92774801601;市,-4.3394298388;理,-6.32069858015;肉,-11.8736581651;舊,-7.59699204605;唐,-7.14627034636;投,-5.08468642208;尖,-10.7750458764;墙,-10.7750458764;原,-10.2642202526;財,-7.25853764823;航,-4.02005335197;庭,-11.1805109845;讯,-10.7750458764;田,-9.16560796397;防,-9.67643358773;德,-8.47246078341;診,-8.3771506036;先,-10.7750458764;軍,-4.15987354847;哑,-9.79421662339;協,-5.28610815024;解,-9.04044482101;童,-11.8736581651;转,-8.98328640717;空,-7.22926726593;国,-8.13598854679;亂,-11.1805109845;稅,-6.17992602627;选,-8.23607200534;不,-8.82913572735;羌,-10.7750458764;向,-6.91783110747;众,-8.00245715416;旅,-6.4709807832;果,-8.21009651894;室,-9.57107307208;中,-5.37236849453;新,-6.72616368826;強,-8.50636233508;评,-8.50636233508;均,-3.35346946467;测,-9.16560796397;风,-10.4873638039;度,-9.47576289227;譯,-11.8736581651;壮,-10.2642202526;关,-10.4873638039;創,-7.59699204605;援,-10.7750458764;島,-8.78261571171;陽,-11.8736581651;征,-9.10106944283;一,-7.29894718657;玉,-10.7750458764;事,-9.04044482101;途,-10.2642202526;编,-7.58319872392;記,-10.2642202526;多,-9.23460083545;索,-10.2642202526;溫,-9.67643358773;優,-8.00245715416;維,-10.4873638039;劳,-10.4873638039;甲,-9.79421662339;介,-7.74652378002;籌,-5.07907158419;限,-11.8736581651;联,-5.43271162444;藥,-6.58539113438;四,-8.73816394914;藝,-9.16560796397;信,-5.21180342452;武,-7.92241444649;屬,-10.0818986958;壯,-10.2642202526;儿,-9.67643358773;電,-4.13169026525;闽,-9.92774801601;漁,-7.26848797908;冊,-10.7750458764;師,-7.74652378002;购,-11.8736581651;責,-10.7750458764;议,-8.50636233508;高,-7.43100690858;铜,-9.23460083545;廠,-9.47576289227;奥,-9.67643358773;裤,-9.38875151528;幫,-7.08616642229;自,-9.30870880761;賬,-9.16560796397;困,-11.1805109845;兵,-7.86632497984;筹,-5.07907158419;現,-9.04044482101;开,-8.9292191859;文,-7.84830647433;昆,-10.4873638039;規,-10.7750458764;税,-6.17992602627;世,-7.1029735406;宣,-10.7750458764;岭,-9.23460083545;種,-8.04501676858;地,-7.69927089517;帶,-9.67643358773;层,-8.50636233508;装,-7.98183786696;症,-10.4873638039;陆,-9.38875151528;拉,-8.61556162705;遊,-6.6975084325;监,-8.31831010358;材,-10.4873638039;湖,-8.82913572735;站,-8.26274025243;铝,-8.00245715416;畜,-8.16008609837;满,-7.51694933838;旧,-7.59699204605;獨,-8.6547823402;快,-9.30870880761;杰,-10.7750458764;右,-10.7750458764;郵,-9.67643358773;混,-9.30870880761;學,-6.58539113438;币,-9.04044482101;擁,-10.4873638039;邊,-10.4873638039;時,-7.63955166047;怕,-10.7750458764;準,-11.1805109845;標,-5.94940236766;殘,-8.78261571171;办,-5.83340345379;利,-9.38875151528;窮,-10.4873638039;贷,-5.24694041582;愿,-9.79421662339;规,-10.7750458764;镇,-7.36279865855;集,-8.11245804938;郊,-8.13598854679;籍,-8.69560433472;違,-10.2642202526;坛,-11.8736581651;關,-10.4873638039;勞,-10.4873638039;季,-8.26274025243;补,-9.67643358773;物,-5.58394259416;諮,-11.1805109845;哲,-9.30870880761;偵,-8.26274025243;海,-7.73052343868;件,-7.84830647433;腿,-11.8736581651;
+E,ln:权,0.0;權,0.0;
+E,l:怀,-8.89263100661;茂,-8.89263100661;誇,-11.2440062638;涉,-10.5508590832;谈,-8.71827761946;随,-11.9371534443;料,-4.94966319733;洞,-10.1453939751;造,-7.70304693973;錢,-9.29809611471;瘤,-6.7007114815;礦,-11.2440062638;般,-6.93320713838;河,-8.89263100661;临,-11.9371534443;銷,-8.38180538284;然,-6.66929528527;吸,-7.87671043378;场,-6.48183232897;宽,-11.9371534443;娼,-9.99124329527;线,-6.20381216743;談,-8.71827761946;反,-9.45224679454;牌,-8.53595606267;科,-8.41079291971;院,-5.40919552671;織,-6.60443465106;话,-4.92774451162;滟,-9.85771190265;赞,-8.89263100661;凡,-7.70304693973;遠,-7.10883970703;知,-6.27072675622;噤,-10.8385411557;罪,-8.10851204784;衰,-7.94816939777;泳,-9.53925817153;歲,-9.22910324323;酶,-8.2735917982;闹,-8.08700584262;绿,-9.85771190265;愁,-10.8385411557;沈,-9.99124329527;颐,-9.29809611471;应,-5.7717355901;鐘,-7.82627958016;謝,-10.3277155319;無,-8.10851204784;遇,-7.38327655273;是,-4.73822220364;械,-8.64131657832;讲,-8.99271446516;刷,-8.60494893415;胀,-4.77553144139;视,-6.21356834238;賈,-9.04678168643;運,-9.29809611471;寒,-9.16456472209;教,-8.8016592284;衛,-8.99271446516;也,-11.9371534443;盤,-10.8385411557;景,-8.2995672846;诲,-10.8385411557;滴,-10.8385411557;鹿,-10.1453939751;斃,-10.1453939751;沉,-9.99124329527;上,-3.75711272084;劍,-8.89263100661;后,-6.15640992854;餐,-8.35363450587;經,-5.84358367428;底,-6.21684166772;怖,-9.22910324323;蒙,-10.3277155319;閣,-8.32623553169;跚,-8.99271446516;岩,-9.85771190265;惜,-9.37220408687;足,-9.04678168643;离,-8.94142117078;鬼,-8.71827761946;簾,-8.47141754153;泉,-10.8385411557;赈,-9.63456835134;湊,-11.9371534443;壑,-11.9371534443;绕,-11.2440062638;晚,-6.28817920617;譜,-7.77827036097;濟,-7.27371435022;跳,-7.66048732531;号,-9.22910324323;偶,-9.85771190265;啸,-9.29809611471;移,-11.9371534443;贾,-9.04678168643;态,-6.06503565485;膀,-11.9371534443;节,-7.64669400318;构,-7.04680431611;消,-7.7474987023;厌,-9.99124329527;咎,-9.29809611471;堑,-9.99124329527;媒,-8.17595332864;肖,-8.84611099097;褛,-8.99271446516;伟,-10.5508590832;冠,-11.2440062638;犢,-9.22910324323;鬧,-8.08700584262;丝,-9.37220408687;脫,-9.99124329527;纪,-9.85771190265;掬,-10.5508590832;术,-6.28817920617;辜,-8.84611099097;稽,-9.73992886699;精,-8.22358137762;汉,-9.04678168643;今,-7.51831283653;前,-7.21865457303;坏,-9.10394010027;賞,-8.99271446516;几,-7.64669400318;勢,-7.70304693973;腫,-8.08700584262;绪,-10.1453939751;导,-9.85771190265;齿,-8.35363450587;糾,-9.37220408687;脂,-8.15296381041;辉,-10.5508590832;丈,-11.2440062638;贊,-8.89263100661;库,-9.29809611471;頂,-10.3277155319;錯,-10.8385411557;閥,-6.80135500728;符,-10.8385411557;義,-5.16178735339;爆,-9.37220408687;躲,-10.5508590832;水,-7.08512318041;傷,-8.64131657832;所,-10.8385411557;么,-4.74949628021;凍,-10.5508590832;结,-8.94142117078;鏡,-7.67447356729;難,-6.96041970191;学,-4.31400037585;翩,-8.94142117078;递,-9.29809611471;淵,-9.22910324323;培,-9.85771190265;陸,-8.71827761946;技,-9.85771190265;憂,-7.71764573915;标,-7.94816939777;袅,-9.73992886699;笑,-5.4571088824;耗,-9.22910324323;辞,-9.16456472209;加,-8.06595243342;缩,-7.25502221721;贵,-8.17595332864;貴,-8.17595332864;碼,-7.38327655273;懂,-7.7474987023;故,-9.04678168643;毆,-10.1453939751;轉,-8.06595243342;免,-5.60743253881;城,-8.8016592284;筑,-6.95354682262;絕,-7.0026795112;江,-11.9371534443;连,-9.63456835134;陣,-8.41079291971;略,-10.5508590832;顧,-8.2995672846;實,-7.23667307854;罩,-9.16456472209;賴,-9.53925817153;叶,-9.53925817153;睹,-7.63308835113;相,-9.04678168643;好,-5.07439553128;争,-6.17510206155;王,-9.53925817153;球,-9.73992886699;疏,-10.1453939751;條,-7.20095499593;务,-6.59961536463;匠,-11.2440062638;垣,-10.5508590832;禧,-10.8385411557;斯,-10.8385411557;制,-7.06961899387;霸,-10.5508590832;飞,-8.60494893415;礼,-9.10394010027;綿,-8.84611099097;績,-8.64131657832;友,-7.32203292749;兌,-11.9371534443;子,-4.71531761904;離,-8.94142117078;輸,-9.73992886699;毛,-8.75909961398;裝,-7.50633664549;占,-10.8385411557;绩,-8.64131657832;谓,-6.71679761925;諱,-8.94142117078;議,-6.56187503665;飽,-9.73992886699;幾,-7.64669400318;會,-5.16064645196;薄,-8.99271446516;三,-9.85771190265;辈,-8.2995672846;倍,-9.22910324323;册,-8.53595606267;弓,-9.99124329527;講,-8.99271446516;负,-8.44064588286;大,-6.83728701651;挫,-10.3277155319;支,-10.3277155319;状,-9.37220408687;权,-7.10883970703;义,-5.16178735339;鍋,-9.37220408687;遍,-10.5508590832;里,-6.63384853627;問,-5.76128617422;当,-6.8495571091;展,-7.67447356729;拖,-8.53595606267;據,-7.49450218784;仞,-10.3277155319;叠,-10.8385411557;繩,-9.10394010027;荫,-9.63456835134;話,-4.92774451162;具,-5.94319201702;蜂,-9.22910324323;阀,-6.80135500728;權,-7.10883970703;宕,-9.10394010027;暗,-8.2735917982;沛,-9.04678168643;依,-8.47141754153;东,-9.63456835134;判,-8.89263100661;座,-9.04678168643;铁,-8.50316623984;漲,-9.99124329527;段,-10.5508590832;区,-7.37280525286;社,-6.38032538263;杂,-9.99124329527;仇,-8.75909961398;觉,-7.59334802248;案,-9.29809611471;壓,-10.1453939751;归,-7.84280888211;保,-11.9371534443;面,-5.89689873305;句,-9.37220408687;鉤,-11.2440062638;继,-11.2440062638;踐,-8.84611099097;慮,-10.3277155319;深,-8.50316623984;汰,-8.0053278116;雷,-9.37220408687;當,-6.8495571091;系,-5.43586377379;繼,-11.2440062638;考,-6.96734014475;万,-10.5508590832;殊,-8.2735917982;圍,-8.67905690631;頓,-7.98590972575;徒,-10.5508590832;蘗,-10.8385411557;輝,-10.5508590832;溜,-11.9371534443;訟,-7.82627958016;連,-9.63456835134;愚,-11.9371534443;印,-11.2440062638;天,-6.66415388577;風,-6.24005995782;音,-9.99124329527;贱,-9.45224679454;農,-8.94142117078;麼,-4.74949628021;稿,-11.2440062638;燎,-8.8016592284;體,-5.91856022983;機,-5.88271409806;勤,-10.8385411557;磨,-9.85771190265;扯,-8.60494893415;类,-7.77827036097;穿,-9.99124329527;開,-7.4485170746;紐,-6.46488277066;颂,-10.8385411557;笔,-11.9371534443;林,-6.99551102172;搖,-8.71827761946;戚,-11.2440062638;本,-3.95064850578;沱,-9.22910324323;点,-7.54270428966;刺,-11.2440062638;纽,-6.46488277066;宿,-7.53043419707;場,-6.48183232897;時,-6.8619796291;担,-10.8385411557;过,-6.12901095435;豆,-11.9371534443;偎,-11.9371534443;結,-8.94142117078;姓,-9.10394010027;答,-8.32623553169;作,-6.13503506895;員,-6.73314675725;癢,-10.1453939751;忧,-7.71764573915;票,-8.53595606267;華,-8.84611099097;走,-7.66048732531;價,-8.47141754153;酸,-9.04678168643;顾,-8.2995672846;锋,-9.73992886699;少,-5.89214813029;朗,-10.5508590832;渝,-9.37220408687;煩,-7.68865820228;別,-9.85771190265;馨,-11.9371534443;窪,-8.22358137762;振,-6.95354682262;谱,-7.77827036097;亲,-8.41079291971;殴,-10.1453939751;總,-9.45224679454;黴,-9.53925817153;降,-9.53925817153;郎,-9.45224679454;恙,-9.37220408687;九,-7.68865820228;远,-7.10883970703;团,-8.08700584262;古,-9.99124329527;姨,-9.99124329527;蟬,-10.3277155319;药,-8.22358137762;说,-3.64060692403;银,-10.8385411557;計,-6.31675257861;皋,-11.9371534443;同,-6.15950112111;猎,-11.9371534443;徑,-8.35363450587;战,-6.35742361834;脚,-7.22762324302;劣,-11.9371534443;產,-4.97680571523;断,-6.58056716966;萬,-10.5508590832;辱,-9.73992886699;丰,-9.99124329527;悲,-8.75909961398;眶,-7.4485170746;券,-7.51831283653;麻,-8.17595332864;尼,-11.2440062638;渊,-9.22910324323;資,-6.13201847541;轆,-8.64131657832;华,-8.84611099097;燥,-8.2995672846;奪,-9.85771190265;据,-7.49450218784;买,-9.85771190265;瓷,-8.99271446516;叹,-11.9371534443;鱼,-7.98590972575;签,-9.37220408687;來,-3.64786512133;瘋,-9.53925817153;和,-9.99124329527;透,-9.29809611471;夕,-9.85771190265;折,-8.19948382605;減,-10.8385411557;蠟,-10.8385411557;骨,-8.32623553169;蔭,-9.63456835134;液,-8.41079291971;粼,-9.99124329527;宾,-11.2440062638;汇,-10.3277155319;歉,-8.08700584262;車,-6.59004591361;网,-11.2440062638;緒,-10.1453939751;著,-5.30779019089;睡,-8.60494893415;入,-6.74419659344;虫,-11.2440062638;聯,-9.99124329527;揮,-9.85771190265;仰,-10.5508590832;勸,-9.45224679454;幻,-9.45224679454;出,-7.22762324302;顿,-7.98590972575;蚁,-8.53595606267;誉,-8.56985761434;鞋,-9.85771190265;斗,-8.50316623984;蘖,-10.8385411557;樞,-8.44064588286;眠,-8.99271446516;窩,-10.8385411557;堪,-7.27371435022;播,-8.64131657832;攬,-8.71827761946;讳,-8.94142117078;债,-8.38180538284;杀,-11.9371534443;情,-6.95354682262;諉,-9.45224679454;响,-6.63883607778;界,-8.47141754153;减,-10.8385411557;绑,-7.91180175359;罐,-9.29809611471;旗,-11.2440062638;进,-6.45235651084;妻,-9.53925817153;詞,-8.64131657832;盡,-7.12496908896;口,-6.51220342685;內,-8.67905690631;嫩,-11.9371534443;敬,-8.99271446516;獸,-11.2440062638;尾,-9.63456835134;姿,-9.22910324323;范,-9.63456835134;蒂,-10.3277155319;者,-10.5508590832;了,-4.65852450201;看,-7.04680431611;名,-6.90020084192;肚,-11.9371534443;語,-7.06195612113;垠,-9.22910324323;紧,-6.39981917731;约,-8.84611099097;末,-11.2440062638;鼻,-9.45224679454;為,-6.74976763849;簽,-9.37220408687;裊,-9.73992886699;敗,-9.10394010027;襟,-11.2440062638;瓢,-11.9371534443;遥,-9.22910324323;穩,-9.10394010027;寨,-11.9371534443;乱,-7.56770559186;述,-8.04533314622;長,-7.21865457303;司,-6.42372469816;图,-8.35363450587;祿,-8.53595606267;潔,-8.99271446516;要,-5.81028426022;謂,-6.71679761925;序,-5.80158855325;会,-5.16064645196;虚,-10.3277155319;躯,-8.22358137762;迟,-7.14136289873;傻,-10.3277155319;强,-8.64131657832;见,-6.26039964206;血,-8.22358137762;蹄,-9.73992886699;藉,-9.10394010027;经,-5.84358367428;凑,-11.9371534443;语,-7.06195612113;晴,-9.53925817153;奶,-10.5508590832;调,-7.15802995122;验,-9.73992886699;香,-10.3277155319;隔,-9.63456835134;視,-6.21356834238;星,-8.41079291971;颠,-10.5508590832;客,-9.10394010027;璨,-11.2440062638;港,-11.9371534443;脱,-9.99124329527;朵,-9.99124329527;騷,-11.2440062638;岸,-10.8385411557;灶,-9.99124329527;嫌,-9.85771190265;兑,-11.9371534443;拜,-8.47141754153;號,-9.22910324323;屣,-11.9371534443;燦,-9.63456835134;湯,-10.1453939751;穷,-8.06595243342;梁,-9.10394010027;老,-9.22910324323;樂,-8.64131657832;窍,-9.99124329527;導,-9.85771190265;傑,-9.45224679454;間,-6.34616646382;划,-7.81001905928;嚕,-11.9371534443;沙,-8.56985761434;业,-5.11604597207;钩,-11.2440062638;用,-5.01845822531;侯,-11.9371534443;肱,-11.2440062638;戲,-7.82627958016;冻,-10.5508590832;跃,-8.94142117078;滅,-8.75909961398;效,-8.99271446516;始,-10.5508590832;牒,-8.22358137762;诗,-8.22358137762;緣,-9.53925817153;驢,-10.8385411557;陪,-10.8385411557;惱,-9.37220408687;腰,-8.35363450587;色,-6.01289764691;顶,-10.3277155319;击,-7.91180175359;矿,-11.2440062638;清,-6.03452011093;指,-11.9371534443;式,-5.18371552573;息,-6.91987360751;愛,-7.68865820228;级,-5.53027345826;撞,-9.29809611471;群,-8.24827399022;險,-7.06195612113;設,-6.53899074281;輯,-7.39385866206;臉,-6.91327292348;輟,-10.3277155319;綸,-10.8385411557;費,-10.5508590832;觀,-6.14109569356;久,-7.437343774;葉,-9.53925817153;奋,-8.41079291971;積,-7.437343774;富,-7.34203359419;鋒,-9.73992886699;滚,-9.04678168643;菜,-9.99124329527;卧,-9.73992886699;烦,-7.68865820228;门,-7.19222131597;盪,-8.99271446516;养,-10.5508590832;建,-10.3277155319;言,-6.28116163351;禍,-7.81001905928;砌,-10.3277155319;鼎,-8.06595243342;爐,-9.99124329527;儒,-11.9371534443;辙,-10.8385411557;膝,-11.9371534443;管,-8.0053278116;夢,-8.94142117078;錦,-10.8385411557;戰,-6.35742361834;常,-7.58044461764;值,-4.10831891674;眾,-8.04533314622;跡,-11.2440062638;立,-9.45224679454;种,-6.6438486196;題,-7.32203292749;彎,-8.94142117078;发,-7.07734103997;兒,-5.91370585137;乘,-10.1453939751;招,-9.45224679454;赚,-11.9371534443;寡,-9.73992886699;工,-7.19222131597;層,-6.78965896752;烧,-8.60494893415;矩,-8.44064588286;器,-5.60743253881;諫,-8.67905690631;番,-8.75909961398;泯,-10.5508590832;潮,-11.9371534443;扰,-7.63308835113;饭,-7.51831283653;有,-6.80725472941;程,-5.03441070717;复,-7.82627958016;小,-6.80725472941;美,-9.73992886699;冒,-11.2440062638;殖,-6.38419385941;伙,-9.73992886699;舛,-9.37220408687;縣,-10.5508590832;通,-6.56187503665;眩,-11.2440062638;隨,-11.9371534443;家,-3.80151354097;弹,-7.18356325322;纸,-10.8385411557;刻,-7.35218596566;嶺,-8.24827399022;炼,-10.8385411557;湃,-11.9371534443;观,-6.14109569356;浅,-8.06595243342;蝉,-10.3277155319;噓,-10.3277155319;燒,-8.60494893415;余,-8.53595606267;淚,-9.37220408687;胜,-8.0053278116;章,-11.2440062638;幣,-9.29809611471;革,-6.61903345049;雨,-6.91327292348;橫,-8.15296381041;闪,-7.96686153078;業,-5.11604597207;修,-8.53595606267;敵,-10.3277155319;顷,-9.53925817153;寶,-9.04678168643;兽,-11.2440062638;鑿,-8.99271446516;謀,-8.99271446516;月,-8.04533314622;倒,-9.10394010027;咕,-9.04678168643;訖,-11.9371534443;优,-10.8385411557;肝,-9.73992886699;粥,-10.8385411557;在,-6.36499941215;讫,-11.9371534443;涯,-10.1453939751;抱,-10.5508590832;鄉,-7.42629393781;娶,-8.99271446516;去,-6.06503565485;尺,-9.16456472209;瘾,-11.9371534443;濃,-11.9371534443;资,-6.13201847541;曉,-8.53595606267;摊,-9.29809611471;遒,-11.9371534443;仙,-11.9371534443;換,-9.99124329527;鳥,-9.45224679454;路,-5.8874199891;聲,-7.50633664549;整,-9.99124329527;究,-7.21865457303;百,-9.04678168643;讀,-9.10394010027;刑,-5.85493453395;圓,-8.99271446516;辘,-8.64131657832;思,-5.92588626993;瘩,-8.15296381041;亮,-8.64131657832;育,-4.88184060099;医,-8.44064588286;难,-6.96041970191;荷,-11.9371534443;擊,-7.91180175359;剑,-8.89263100661;量,-5.65301928326;論,-6.83728701651;还,-11.2440062638;黑,-8.17595332864;飢,-11.2440062638;履,-8.53595606267;照,-8.84611099097;齐,-11.2440062638;险,-7.06195612113;艱,-8.08700584262;幹,-6.69540642927;卻,-9.45224679454;災,-8.60494893415;燼,-8.35363450587;长,-7.21865457303;盾,-7.35218596566;龍,-10.3277155319;礎,-6.61414346519;疑,-6.81915963191;枝,-11.9371534443;唱,-10.3277155319;锦,-10.8385411557;辭,-9.16456472209;測,-7.77827036097;康,-7.87671043378;师,-8.44064588286;钻,-10.5508590832;势,-7.70304693973;蛇,-10.5508590832;應,-5.7717355901;峋,-8.53595606267;忍,-8.2995672846;青,-9.10394010027;剔,-8.47141754153;仗,-9.16456472209;赖,-9.53925817153;形,-8.2735917982;迭,-9.99124329527;旱,-10.5508590832;想,-8.24827399022;發,-7.07734103997;洁,-8.99271446516;脉,-7.29276254519;莊,-11.2440062638;續,-8.75909961398;咐,-9.22910324323;朝,-7.08512318041;鬥,-8.50316623984;骤,-7.70304693973;榮,-8.60494893415;光,-7.98590972575;耳,-7.51831283653;流,-7.71764573915;桃,-10.8385411557;轍,-10.8385411557;道,-5.48984758179;诚,-11.2440062638;絡,-9.73992886699;兩,-10.8385411557;豫,-6.75536989404;潭,-11.9371534443;蟲,-11.2440062638;花,-10.8385411557;誅,-11.9371534443;肉,-8.64131657832;脈,-7.29276254519;舊,-8.84611099097;宏,-9.73992886699;素,-5.98911845515;瞧,-7.91180175359;騰,-9.99124329527;德,-10.8385411557;夸,-11.2440062638;眼,-6.60927727554;县,-10.5508590832;況,-6.38419385941;賣,-8.15296381041;雾,-9.73992886699;動,-4.34377925121;俗,-11.2440062638;聞,-8.53595606267;童,-7.84280888211;孤,-10.3277155319;全,-7.84280888211;淫,-11.9371534443;佬,-8.50316623984;误,-9.63456835134;格,-7.58044461764;数,-5.41506064616;至,-8.22358137762;祸,-7.81001905928;闻,-8.53595606267;空,-7.22762324302;国,-7.4485170746;灾,-8.60494893415;亂,-7.56770559186;把,-9.22910324323;後,-6.15640992854;向,-9.99124329527;众,-8.04533314622;果,-10.3277155319;綠,-9.85771190265;红,-5.98391011004;霧,-9.73992886699;贫,-8.84611099097;中,-5.96334383246;新,-7.09296635787;強,-8.64131657832;画,-9.73992886699;评,-9.16456472209;懈,-9.63456835134;忌,-8.35363450587;魏,-11.2440062638;风,-6.24005995782;损,-9.10394010027;胞,-7.20095499593;灩,-9.85771190265;赫,-8.94142117078;度,-5.20613534385;譯,-10.1453939751;葱,-9.99124329527;腳,-7.22762324302;曲,-8.94142117078;援,-9.85771190265;塹,-9.99124329527;白,-6.15025606296;一,-5.86180741324;撇,-10.3277155319;戈,-8.84611099097;搜,-11.9371534443;悟,-10.1453939751;索,-8.8016592284;頤,-9.29809611471;溫,-10.3277155319;優,-10.8385411557;芳,-11.2440062638;愈,-9.04678168643;容,-8.15296381041;夺,-9.85771190265;觅,-9.73992886699;擇,-7.0171725185;籌,-8.94142117078;限,-11.9371534443;達,-7.84280888211;毙,-10.1453939751;藥,-8.22358137762;楚,-6.30953233064;藝,-8.75909961398;睦,-10.1453939751;尽,-7.12496908896;涼,-8.2735917982;敲,-9.29809611471;对,-7.71764573915;電,-6.66415388577;呼,-9.53925817153;涂,-11.9371534443;膊,-11.9371534443;纠,-9.37220408687;夥,-9.73992886699;颤,-11.9371534443;吧,-11.2440062638;动,-4.34377925121;責,-7.70304693973;议,-6.56187503665;悴,-10.1453939751;践,-8.84611099097;阻,-9.45224679454;軀,-8.22358137762;摇,-8.71827761946;草,-7.96686153078;顏,-11.9371534443;坑,-10.3277155319;痒,-10.1453939751;汗,-7.25502221721;虛,-10.3277155319;霉,-9.53925817153;饥,-11.2440062638;运,-9.29809611471;賬,-8.22358137762;東,-9.63456835134;曰,-9.73992886699;艳,-8.71827761946;筹,-8.94142117078;噻,-10.8385411557;灿,-9.63456835134;現,-9.99124329527;躁,-9.85771190265;梅,-10.8385411557;蘆,-8.99271446516;律,-6.34616646382;福,-7.96686153078;税,-8.24827399022;響,-6.63883607778;世,-6.7007114815;舞,-7.64669400318;张,-7.49450218784;瘦,-11.9371534443;助,-10.5508590832;倪,-9.45224679454;贬,-10.8385411557;防,-11.2440062638;瞻,-9.99124329527;咽,-7.64669400318;求,-6.4606898924;装,-7.50633664549;拉,-11.9371534443;湖,-8.38180538284;識,-7.16646881986;蓝,-11.9371534443;濫,-8.2735917982;賭,-8.89263100661;杰,-9.45224679454;巷,-9.16456472209;學,-4.31400037585;凿,-8.99271446516;丁,-10.5508590832;舉,-7.81001905928;授,-10.8385411557;對,-7.71764573915;洗,-10.1453939751;標,-7.94816939777;望,-7.84280888211;感,-8.99271446516;利,-5.7305775176;漫,-8.19948382605;纶,-10.8385411557;疼,-10.5508590832;儿,-5.91370585137;激,-9.53925817153;规,-9.73992886699;惊,-7.68865820228;他,-9.29809611471;棚,-9.73992886699;翠,-11.2440062638;季,-7.20976562562;物,-3.96055803501;致,-8.71827761946;寸,-10.1453939751;命,-6.35742361834;退,-7.38327655273;璃,-7.91180175359;專,-10.3277155319;弊,-10.5508590832;舌,-7.79401871794;羅,-11.9371534443;宝,-9.04678168643;驚,-7.68865820228;厭,-9.99124329527;售,-10.8385411557;徵,-11.9371534443;方,-8.24827399022;机,-5.88271409806;派,-9.85771190265;铃,-11.9371534443;屈,-11.9371534443;齊,-11.2440062638;賓,-11.2440062638;濕,-9.45224679454;溏,-10.1453939751;狗,-9.99124329527;员,-6.73314675725;飛,-8.60494893415;坚,-11.2440062638;统,-5.2701966519;絞,-9.10394010027;换,-9.99124329527;查,-6.85574907934;烫,-10.5508590832;叭,-10.8385411557;念,-8.89263100661;年,-6.5665154162;摸,-9.99124329527;吃,-8.53595606267;的,-4.49700676367;羊,-7.2458055621;转,-8.06595243342;氓,-9.63456835134;臂,-9.37220408687;輕,-10.1453939751;五,-8.08700584262;列,-8.17595332864;错,-10.8385411557;鸟,-9.45224679454;肠,-8.15296381041;倫,-9.85771190265;识,-7.16646881986;犬,-11.9371534443;嘯,-9.29809611471;失,-7.87671043378;張,-7.49450218784;户,-7.10087153738;憶,-9.99124329527;改,-9.73992886699;允,-9.45224679454;雄,-9.04678168643;配,-7.85961600042;毒,-6.61414346519;何,-5.25254171666;论,-6.83728701651;顛,-10.5508590832;孝,-10.1453939751;来,-3.64786512133;触,-8.2995672846;注,-7.79401871794;火,-7.47124532567;问,-5.76128617422;饱,-9.73992886699;声,-7.50633664549;米,-10.1453939751;罵,-9.45224679454;维,-5.69104667885;艷,-8.71827761946;懶,-11.2440062638;譽,-8.56985761434;湿,-9.45224679454;閃,-7.96686153078;隅,-10.3277155319;堆,-7.25502221721;粉,-8.89263100661;窝,-10.8385411557;股,-9.29809611471;质,-6.09071466927;醫,-8.44064588286;碱,-8.08700584262;缴,-11.2440062638;便,-8.47141754153;阴,-8.60494893415;雅,-10.5508590832;篇,-10.8385411557;拍,-9.63456835134;佔,-10.8385411557;受,-7.73246082494;邻,-9.63456835134;属,-6.69012937217;惡,-10.1453939751;缺,-7.20095499593;彩,-7.76276617443;绵,-8.84611099097;恶,-10.1453939751;數,-5.41506064616;智,-9.16456472209;駁,-8.8016592284;领,-9.10394010027;舍,-9.99124329527;掌,-10.5508590832;树,-9.45224679454;北,-6.96041970191;宜,-9.73992886699;弟,-7.9298202591;膠,-9.53925817153;春,-8.0053278116;梦,-8.94142117078;涨,-9.99124329527;爭,-6.17510206155;繳,-11.2440062638;報,-8.94142117078;紳,-9.10394010027;讼,-7.82627958016;净,-8.22358137762;狂,-9.73992886699;际,-5.5655415971;词,-8.64131657832;態,-6.06503565485;才,-8.19948382605;菌,-7.35218596566;桑,-10.1453939751;浓,-11.9371534443;返,-7.87671043378;南,-8.50316623984;金,-6.02095138172;散,-7.94816939777;淨,-8.22358137762;铮,-9.63456835134;捷,-7.91180175359;胶,-9.53925817153;轿,-9.53925817153;刀,-9.04678168643;颇,-11.2440062638;縈,-10.3277155319;趕,-9.45224679454;气,-5.95573923307;化,-6.11410754885;嘘,-10.3277155319;骛,-10.1453939751;採,-11.2440062638;辩,-8.8016592284;劫,-9.63456835134;溉,-9.29809611471;茶,-9.99124329527;压,-10.1453939751;病,-8.38180538284;筆,-11.9371534443;职,-8.44064588286;李,-10.5508590832;译,-10.1453939751;卖,-8.15296381041;握,-7.37280525286;慢,-7.03931364438;日,-6.48611499076;迩,-9.10394010027;浪,-7.49450218784;绳,-9.10394010027;銀,-10.8385411557;锅,-9.37220408687;肌,-10.5508590832;搏,-11.2440062638;专,-10.3277155319;颜,-11.9371534443;蔥,-9.99124329527;輩,-8.2995672846;别,-9.85771190265;興,-6.09651178696;赋,-8.94142117078;达,-7.84280888211;十,-9.99124329527;狀,-9.37220408687;终,-8.41079291971;手,-7.17497950953;緊,-6.39981917731;背,-8.2995672846;角,-8.60494893415;取,-7.59334802248;静,-7.76276617443;盘,-10.8385411557;荡,-8.99271446516;佩,-9.85771190265;六,-9.45224679454;烬,-8.35363450587;平,-7.59334802248;鳴,-8.32623553169;職,-8.44064588286;書,-7.76276617443;旺,-8.99271446516;重,-6.4318219084;适,-11.9371534443;尊,-10.1453939751;明,-6.6796580723;输,-9.73992886699;隙,-11.9371534443;團,-8.08700584262;夜,-7.47124532567;挠,-10.3277155319;攤,-9.29809611471;炭,-11.2440062638;疯,-9.53925817153;戶,-7.10087153738;举,-7.81001905928;勁,-9.22910324323;區,-7.37280525286;遂,-8.67905690631;婆,-11.9371534443;廉,-7.47124532567;彈,-7.18356325322;族,-10.8385411557;虎,-8.71827761946;法,-6.41569252647;繞,-11.2440062638;恢,-11.9371534443;豪,-8.89263100661;热,-7.55512680966;公,-8.84611099097;癮,-11.9371534443;適,-11.9371534443;懷,-8.89263100661;读,-9.10394010027;善,-8.99271446516;备,-7.49450218784;羈,-10.1453939751;漓,-8.06595243342;鞘,-10.8385411557;掠,-8.84611099097;营,-7.36244246583;温,-10.3277155319;辨,-8.84611099097;冬,-8.64131657832;皮,-6.74976763849;雲,-7.71764573915;烂,-8.75909961398;奇,-8.75909961398;糊,-8.04533314622;敏,-9.37220408687;鹼,-8.08700584262;体,-5.91856022983;藏,-8.50316623984;绞,-9.10394010027;陽,-9.16456472209;卫,-8.99271446516;泪,-9.37220408687;灭,-8.75909961398;目,-6.50343144078;寰,-10.8385411557;巴,-9.85771190265;慷,-10.8385411557;死,-6.95354682262;滾,-9.04678168643;征,-11.9371534443;錚,-9.63456835134;诛,-11.9371534443;患,-11.9371534443;接,-10.8385411557;产,-4.97680571523;账,-8.22358137762;鞭,-11.2440062638;犯,-9.37220408687;碳,-9.73992886699;收,-7.55512680966;治,-6.78965896752;調,-7.15802995122;织,-6.60443465106;蓋,-8.94142117078;慎,-7.76276617443;跑,-9.73992886699;豐,-9.99124329527;燙,-10.5508590832;博,-8.2735917982;耻,-9.10394010027;神,-8.32623553169;赦,-11.9371534443;表,-7.27371435022;歪,-10.8385411557;短,-9.10394010027;兮,-11.2440062638;己,-8.24827399022;署,-9.37220408687;穴,-10.1453939751;泻,-10.3277155319;追,-11.2440062638;逃,-10.3277155319;包,-8.75909961398;岗,-11.9371534443;服,-7.7474987023;戏,-7.82627958016;酬,-8.19948382605;厚,-8.32623553169;缝,-8.75909961398;纜,-9.99124329527;枢,-8.44064588286;挥,-9.85771190265;片,-7.41536486728;润,-7.16646881986;脹,-4.77553144139;術,-6.28817920617;煙,-10.8385411557;络,-9.73992886699;驟,-7.70304693973;湧,-8.38180538284;統,-5.2701966519;峰,-11.2440062638;时,-6.8619796291;胸,-8.89263100661;身,-8.2735917982;销,-8.38180538284;将,-9.29809611471;覓,-9.73992886699;備,-7.49450218784;报,-8.94142117078;疫,-9.37220408687;横,-8.15296381041;环,-10.1453939751;細,-11.9371534443;脸,-6.91327292348;品,-6.22012574292;療,-11.2440062638;奈,-11.2440062638;賑,-9.63456835134;绝,-7.0026795112;察,-8.94142117078;類,-7.77827036097;臣,-10.3277155319;示,-11.2440062638;若,-11.9371534443;鼓,-7.9298202591;可,-8.08700584262;遮,-9.16456472209;干,-6.69540642927;腸,-8.15296381041;艺,-8.75909961398;诿,-9.45224679454;門,-7.19222131597;民,-7.35218596566;候,-5.05266679229;增,-10.3277155319;說,-3.64060692403;匯,-10.3277155319;炮,-6.69540642927;就,-9.22910324323;活,-8.67905690631;胎,-8.13049095456;評,-9.16456472209;比,-10.8385411557;遙,-9.22910324323;釘,-9.45224679454;壞,-9.10394010027;无,-8.10851204784;賦,-8.94142117078;畫,-9.73992886699;卯,-9.10394010027;山,-7.32203292749;女,-6.91327292348;茫,-9.22910324323;瘀,-7.87671043378;劃,-7.81001905928;内,-8.67905690631;缆,-9.99124329527;安,-6.81915963191;養,-10.5508590832;辑,-7.39385866206;渐,-10.1453939751;圖,-8.35363450587;焚,-11.2440062638;四,-11.9371534443;貧,-8.84611099097;伦,-9.85771190265;让,-7.84280888211;破,-8.41079291971;款,-7.68865820228;勃,-8.19948382605;築,-6.95354682262;藍,-11.9371534443;近,-11.2440062638;乐,-8.64131657832;川,-8.50316623984;食,-8.60494893415;臥,-9.73992886699;车,-6.59004591361;絲,-9.37220408687;任,-5.07544210385;腺,-7.67447356729;省,-10.1453939751;嚀,-11.2440062638;還,-11.2440062638;將,-9.29809611471;休,-7.35218596566;源,-5.65863202016;飯,-7.51831283653;鲜,-9.63456835134;酉,-9.85771190265;实,-7.23667307854;蜡,-10.8385411557;辦,-11.2440062638;誨,-10.8385411557;親,-8.41079291971;弱,-7.1331323996;稳,-9.10394010027;網,-11.2440062638;碴,-9.45224679454;主,-8.50316623984;设,-6.53899074281;雀,-11.2440062638;忆,-9.99124329527;等,-7.68865820228;潑,-7.98590972575;畏,-8.89263100661;条,-7.20095499593;扣,-8.84611099097;灯,-10.1453939751;影,-9.04678168643;驳,-8.8016592284;已,-7.00989975917;泼,-7.98590972575;需,-8.99271446516;帆,-11.2440062638;膏,-9.85771190265;云,-7.71764573915;伐,-11.2440062638;讓,-7.84280888211;辯,-8.8016592284;疗,-11.2440062638;倚,-10.5508590832;肥,-11.9371534443;愤,-8.44064588286;鄰,-9.63456835134;株,-6.99551102172;害,-6.05104941288;头,-6.18141123074;斷,-6.58056716966;點,-7.54270428966;洼,-8.22358137762;着,-5.30779019089;珠,-9.99124329527;操,-8.06595243342;敌,-10.3277155319;滑,-11.2440062638;務,-6.59961536463;做,-9.85771190265;租,-6.88090763898;书,-7.76276617443;哭,-8.8016592284;國,-7.4485170746;彰,-11.9371534443;阁,-8.32623553169;質,-6.09071466927;守,-8.71827761946;損,-9.10394010027;意,-6.08208152213;则,-10.5508590832;弛,-10.1453939751;急,-9.53925817153;憤,-8.44064588286;吭,-6.54352589798;船,-7.58044461764;肺,-7.79401871794;秋,-10.1453939751;千,-10.8385411557;细,-11.9371534443;俐,-11.9371534443;盖,-8.94142117078;牙,-8.13049095456;变,-7.04680431611;荣,-8.60494893415;恥,-9.10394010027;詩,-8.22358137762;酯,-10.8385411557;塵,-9.73992886699;轻,-10.1453939751;縫,-8.75909961398;西,-9.45224679454;諾,-8.32623553169;待,-10.5508590832;喉,-11.2440062638;合,-8.17595332864;袋,-9.73992886699;亏,-7.61966533079;耐,-11.9371534443;撓,-10.3277155319;枕,-10.8385411557;骗,-10.1453939751;外,-5.5655415971;尘,-9.73992886699;渴,-9.04678168643;鮮,-9.63456835134;欢,-8.60494893415;两,-10.8385411557;箭,-6.72766729149;熱,-7.55512680966;嘴,-8.2735917982;放,-5.92343828829;私,-8.08700584262;础,-6.61414346519;魂,-10.3277155319;勇,-8.10851204784;呈,-9.16456472209;棋,-8.94142117078;母,-7.82627958016;济,-7.27371435022;荒,-10.8385411557;盟,-7.10883970703;泣,-9.22910324323;止,-5.73867472784;腦,-6.8495571091;早,-6.81318946493;士,-8.60494893415;马,-6.88090763898;灰,-8.89263100661;揽,-8.71827761946;替,-9.73992886699;庄,-11.2440062638;切,-8.38180538284;针,-10.8385411557;脑,-6.8495571091;首,-9.22910324323;紙,-10.8385411557;队,-8.60494893415;氣,-5.95573923307;交,-8.0053278116;枪,-6.30236384116;割,-7.26432460987;嚴,-8.53595606267;费,-10.5508590832;总,-9.45224679454;則,-10.5508590832;腑,-11.9371534443;驗,-9.73992886699;令,-8.47141754153;顫,-11.9371534443;差,-8.22358137762;共,-8.50316623984;味,-7.35218596566;史,-8.24827399022;围,-8.67905690631;腕,-9.85771190265;率,-8.0053278116;钉,-9.45224679454;見,-6.26039964206;認,-9.16456472209;斓,-9.04678168643;戒,-10.3277155319;算,-6.72221768672;军,-8.94142117078;劝,-9.45224679454;趣,-8.60494893415;伤,-8.64131657832;第,-9.63456835134;焰,-8.89263100661;油,-8.17595332864;为,-6.74976763849;壁,-10.3277155319;绅,-9.10394010027;哉,-8.35363450587;構,-7.04680431611;惑,-8.19948382605;腐,-9.45224679454;勝,-8.0053278116;卜,-10.3277155319;域,-6.65394971559;裡,-6.63384853627;滥,-8.2735917982;潤,-7.16646881986;牲,-9.10394010027;拽,-10.1453939751;码,-7.38327655273;骂,-9.45224679454;径,-8.35363450587;吉,-10.8385411557;隊,-8.60494893415;伏,-7.61966533079;芒,-11.2440062638;庚,-9.99124329527;初,-8.22358137762;土,-9.99124329527;校,-5.55027412497;责,-7.70304693973;严,-8.53595606267;茧,-10.3277155319;夫,-9.29809611471;弯,-8.94142117078;劲,-9.22910324323;阵,-8.41079291971;真,-8.67905690631;人,-5.55364680945;升,-7.31218063105;益,-7.51831283653;住,-7.68865820228;苒,-11.2440062638;處,-6.19095025379;柔,-11.9371534443;字,-6.44821571817;衡,-9.85771190265;寬,-11.9371534443;凰,-9.99124329527;齒,-8.35363450587;歷,-11.2440062638;豹,-10.8385411557;板,-9.63456835134;擾,-7.63308835113;稀,-9.37220408687;射,-6.96734014475;邇,-9.10394010027;成,-6.93320713838;斕,-9.04678168643;碗,-10.8385411557;龙,-10.3277155319;帘,-8.47141754153;力,-4.98921637571;級,-5.53027345826;钟,-7.82627958016;霞,-10.8385411557;计,-6.31675257861;到,-4.0065875901;琴,-9.45224679454;边,-8.94142117078;游,-8.64131657832;陈,-8.67905690631;槍,-6.30236384116;行,-6.66929528527;低,-9.63456835134;摔,-10.1453939751;策,-7.73246082494;忙,-8.35363450587;針,-10.8385411557;停,-8.84611099097;非,-8.0251304389;代,-7.14966170155;汤,-10.1453939751;迹,-11.2440062638;恼,-9.37220408687;蓿,-10.1453939751;松,-10.5508590832;布,-9.99124329527;如,-9.16456472209;紅,-5.98391011004;历,-11.2440062638;眉,-10.5508590832;疊,-10.8385411557;植,-11.2440062638;谏,-8.67905690631;易,-5.04960087266;頗,-11.2440062638;爛,-8.75909961398;次,-7.81001905928;誠,-11.2440062638;津,-7.98590972575;性,-6.79548988783;薪,-11.9371534443;微,-7.91180175359;阳,-9.16456472209;电,-6.66415388577;样,-4.8371262777;驴,-10.8385411557;假,-8.32623553169;鼠,-10.1453939751;盈,-6.89372832741;橋,-9.37220408687;迎,-8.56985761434;拐,-10.8385411557;晓,-8.53595606267;懒,-11.2440062638;擔,-10.8385411557;塗,-11.9371534443;牛,-10.3277155319;線,-6.20381216743;歡,-8.60494893415;賤,-9.45224679454;祭,-9.85771190265;幼,-8.56985761434;危,-9.85771190265;陳,-8.67905690631;淺,-8.06595243342;堂,-7.77827036097;約,-8.84611099097;分,-4.46124747496;圈,-11.2440062638;騖,-10.1453939751;缘,-9.53925817153;辣,-9.16456472209;贤,-9.16456472209;憧,-10.5508590832;木,-11.9371534443;宫,-9.16456472209;縮,-7.25502221721;励,-11.2440062638;進,-6.45235651084;漸,-10.1453939751;心,-5.51228442042;變,-7.04680431611;采,-11.2440062638;牆,-9.53925817153;靈,-9.63456835134;告,-8.75909961398;棍,-9.45224679454;乎,-7.54270428966;染,-10.1453939751;泥,-9.53925817153;獰,-8.94142117078;石,-10.3277155319;遲,-7.14136289873;決,-7.437343774;能,-7.73246082494;威,-8.8016592284;雪,-7.28319309417;于,-6.33503462345;逝,-8.99271446516;农,-8.94142117078;生,-6.62888574693;模,-6.57117742931;梢,-8.44064588286;愧,-10.8385411557;芦,-8.99271446516;頭,-6.18141123074;馬,-6.88090763898;累,-7.07734103997;府,-5.29597127459;爱,-7.68865820228;现,-9.99124329527;傲,-11.9371534443;鐵,-8.50316623984;政,-9.37220408687;節,-7.64669400318;居,-8.84611099097;赏,-8.99271446516;提,-7.55512680966;套,-8.84611099097;忘,-9.99124329527;回,-8.19948382605;淤,-11.2440062638;慧,-9.45224679454;苦,-7.87671043378;孫,-9.99124329527;姬,-9.10394010027;台,-7.60642010404;间,-6.34616646382;楷,-9.16456472209;賺,-11.9371534443;綁,-7.91180175359;境,-6.048275486;异,-7.68865820228;醉,-8.8016592284;辍,-10.3277155319;斑,-7.67447356729;妙,-9.63456835134;領,-9.10394010027;咛,-11.2440062638;功,-9.04678168643;漢,-9.04678168643;怨,-11.9371534443;央,-11.9371534443;傳,-6.81318946493;露,-10.3277155319;鈴,-11.9371534443;局,-8.38180538284;商,-10.3277155319;凉,-8.2735917982;頌,-10.8385411557;願,-8.99271446516;魚,-7.98590972575;噜,-11.9371534443;淡,-9.37220408687;池,-8.32623553169;恨,-11.9371534443;端,-8.35363450587;奮,-8.41079291971;价,-8.47141754153;赶,-9.45224679454;腾,-9.99124329527;頃,-9.53925817153;疆,-11.9371534443;焉,-10.5508590832;谋,-8.99271446516;伍,-11.9371534443;二,-9.10394010027;题,-7.32203292749;君,-7.77827036097;定,-4.80865749865;負,-8.44064588286;誤,-9.63456835134;禮,-9.10394010027;由,-7.55512680966;環,-10.1453939751;殺,-11.9371534443;房,-9.45224679454;憾,-11.2440062638;魅,-10.8385411557;煉,-10.8385411557;烈,-6.8745584113;及,-8.24827399022;位,-7.76276617443;野,-8.99271446516;雜,-9.99124329527;迢,-10.8385411557;步,-6.63384853627;虧,-7.61966533079;獵,-11.9371534443;诺,-8.32623553169;承,-7.85961600042;岁,-9.22910324323;紀,-9.85771190265;市,-9.29809611471;理,-6.01557502469;炉,-9.99124329527;躍,-8.94142117078;得,-5.78868514841;尖,-7.7474987023;墙,-9.53925817153;餘,-8.53595606267;原,-10.5508590832;財,-7.71764573915;萦,-10.3277155319;肩,-8.56985761434;庭,-7.68865820228;钱,-9.29809611471;田,-8.99271446516;决,-7.437343774;嘲,-9.45224679454;褸,-8.99271446516;竅,-9.99124329527;魄,-9.45224679454;先,-7.2458055621;淋,-10.3277155319;軍,-8.94142117078;志,-8.64131657832;痛,-8.22358137762;婚,-9.22910324323;靜,-7.76276617443;遞,-9.29809611471;泡,-9.63456835134;解,-6.00490825688;此,-5.29206247482;续,-8.75909961398;異,-7.68865820228;凳,-8.94142117078;勵,-11.2440062638;却,-9.45224679454;裹,-9.99124329527;封,-10.8385411557;稅,-8.24827399022;震,-9.04678168643;瀉,-10.3277155319;洋,-8.89263100661;犊,-9.22910324323;不,-4.75100913981;良,-9.99124329527;骚,-11.2440062638;溢,-8.32623553169;认,-9.16456472209;席,-8.19948382605;貶,-10.8385411557;範,-9.63456835134;偉,-10.5508590832;燈,-10.1453939751;测,-7.77827036097;罗,-11.9371534443;轎,-9.53925817153;象,-6.61903345049;擦,-9.16456472209;恩,-7.28319309417;臨,-11.9371534443;繭,-10.3277155319;壮,-9.73992886699;关,-6.32402533794;酒,-9.29809611471;觸,-8.2995672846;羁,-10.1453939751;圆,-8.99271446516;事,-5.9943540692;抓,-8.75909961398;粗,-8.8016592284;娘,-8.32623553169;際,-5.5655415971;多,-4.39600098919;喝,-7.58044461764;财,-7.71764573915;掩,-10.5508590832;庫,-9.29809611471;維,-5.69104667885;劳,-8.84611099097;甲,-8.67905690631;况,-6.38419385941;買,-9.85771190265;施,-7.67447356729;肿,-8.08700584262;終,-8.41079291971;叉,-9.45224679454;版,-11.2440062638;联,-9.99124329527;盛,-8.8016592284;祚,-8.94142117078;烟,-10.8385411557;信,-8.0053278116;屬,-6.69012937217;壯,-9.73992886699;陰,-8.60494893415;下,-4.87667707833;冊,-8.53595606267;貌,-9.85771190265;悔,-8.94142117078;樣,-4.8371262777;艰,-8.08700584262;師,-8.44064588286;宮,-9.16456472209;覺,-7.59334802248;蔽,-10.8385411557;之,-6.69540642927;村,-9.53925817153;打,-7.73246082494;慕,-8.84611099097;孙,-9.99124329527;高,-7.51831283653;兵,-8.99271446516;开,-7.4485170746;处,-6.19095025379;嘆,-11.9371534443;例,-10.3277155319;規,-9.73992886699;暑,-9.85771190265;甜,-8.89263100661;熟,-8.38180538284;亡,-7.81001905928;传,-6.81318946493;谢,-10.3277155319;魔,-9.53925817153;怪,-8.22358137762;岭,-8.24827399022;種,-6.6438486196;地,-5.22541304927;債,-8.38180538284;勞,-8.84611099097;层,-6.78965896752;症,-8.71827761946;陆,-8.71827761946;午,-11.2440062638;遊,-8.64131657832;赌,-8.89263100661;材,-9.29809611471;賢,-9.16456472209;腔,-9.85771190265;站,-8.2995672846;存,-7.22762324302;镜,-7.67447356729;營,-7.36244246583;你,-9.85771190265;旧,-8.84611099097;择,-7.0171725185;快,-7.4485170746;峭,-11.2440062638;积,-7.437343774;剩,-7.48280614808;右,-8.2995672846;醒,-7.61966533079;兴,-6.09651178696;歸,-7.84280888211;蟻,-8.53595606267;币,-9.29809611471;往,-7.9298202591;堅,-11.2440062638;禄,-8.53595606267;隆,-9.63456835134;邊,-8.94142117078;涌,-8.38180538284;析,-6.66929528527;怕,-8.64131657832;崗,-11.9371534443;騙,-10.1453939751;官,-6.52550739247;喜,-7.49450218784;办,-11.2440062638;渡,-11.2440062638;推,-7.76276617443;窮,-8.06595243342;樹,-9.45224679454;落,-6.42372469816;於,-6.33503462345;愿,-8.99271446516;繁,-9.10394010027;起,-6.59481919236;盆,-8.60494893415;鸣,-8.32623553169;虑,-10.3277155319;败,-9.10394010027;過,-6.12901095435;關,-6.32402533794;狞,-8.94142117078;乡,-7.42629393781;正,-11.2440062638;波,-8.94142117078;桥,-9.37220408687;鑽,-10.5508590832;灵,-9.63456835134;海,-9.29809611471;件,-6.24679399001;拾,-10.5508590832;腿,-9.04678168643;孔,-9.45224679454;
+E,mq:一,-4.69322904911;會,-4.36175994988;挂,-7.29373770861;億,-7.92972647533;分,-3.5787319499;三,-9.02833876399;月,-7.64204440287;下,-9.02833876399;紀,-5.78314563081;点,-3.65306035631;伏,-8.18104090361;付,-7.18251207349;伙,-4.90659522758;鐘,-5.69613425382;掛,-7.29373770861;会,-4.36175994988;丝,-6.51603314002;船,-8.51751314023;星,-6.99145683673;次,-4.18677979994;樣,-10.1269510527;級,-8.33519158343;夥,-4.90659522758;室,-8.04750951098;级,-8.33519158343;度,-0.683596009576;初,-7.35436233042;纪,-5.78314563081;本,-10.1269510527;帮,-5.18530863005;安,-10.1269510527;朝,-5.17819116228;色,-5.20697012683;場,-2.82041965372;样,-10.1269510527;方,-7.48789372305;點,-3.65306035631;场,-2.82041965372;例,-7.35436233042;亿,-7.92972647533;年,-7.23657929477;条,-3.48576888292;千,-10.1269510527;時,-5.22167627422;升,-10.1269510527;轴,-8.74065669154;等,-5.2827639662;袋,-6.75965522267;时,-5.22167627422;位,-5.39956323395;口,-6.99145683673;輛,-5.00895724024;行,-7.29373770861;发,-9.02833876399;根,-4.69760542371;道,-5.3562664282;兒,-6.46338940653;陆,-9.4338038721;期,-9.4338038721;軸,-8.74065669154;乘,-7.23657929477;钟,-5.69613425382;辆,-5.00895724024;回,-3.5787319499;卡,-10.1269510527;池,-8.18104090361;代,-6.19512541994;面,-3.19450316109;條,-3.48576888292;摩,-7.82436595967;幫,-5.18530863005;陸,-9.4338038721;路,-8.33519158343;台,-7.92972647533;腳,-3.85975050412;絲,-6.51603314002;儿,-6.46338940653;件,-2.25716715013;特,-7.72905577986;斤,-8.51751314023;脚,-3.85975050412;份,-3.34816615498;發,-9.02833876399;百,-10.1269510527;
+E,m:則,-7.25009861997;袋,-8.43505109961;伊,-12.3814755318;戌,-10.2124218314;沓,-9.26796022255;鐘,-5.93337758997;会,-7.18021987805;两,-5.8520566935;吨,-5.01566269455;未,-10.877398135;方,-5.90990233355;场,-5.57381686931;亿,-6.20405022446;派,-7.64747247393;兆,-11.6883283512;齊,-13.7677698929;盏,-7.40819602421;金,-9.74241820214;员,-6.80268954728;周,-5.63125164076;士,-8.34723489361;班,-7.57132576508;歲,-5.27241339607;年,-2.86567456598;廿,-13.0746227123;栋,-8.51027452085;排,-7.17609616087;缕,-8.16934793388;五,-6.06566555283;列,-5.47898408245;首,-6.81122444973;紙,-8.30393808785;枚,-6.98444469227;星,-11.5705453155;枪,-7.2861927636;朵,-7.41688417616;户,-6.23193943008;组,-6.92295441367;片,-5.24479345671;顶,-7.69703216488;號,-6.92189001761;叢,-10.8233309137;盤,-7.58982577883;声,-4.73202103163;味,-8.57481304199;角,-7.12528309151;维,-6.91870361024;輪,-6.00050589612;倆,-12.1583319804;餐,-8.75049005606;間,-6.32879830048;宗,-5.99123486469;股,-4.4938915001;亥,-10.3020339901;个,-1.86401253158;第,-10.4004740629;尾,-8.78416327117;壁,-9.21389300128;隊,-6.91236109427;篇,-6.37389160277;框,-11.8218597438;歌,-8.84051620772;摞,-9.41106106619;裡,-4.65515260943;机,-11.6883283512;巳,-10.7232474552;线,-6.98218224787;号,-6.92189001761;桶,-7.27856496155;數,-4.41332917693;響,-8.14014877919;頁,-6.99126290051;节,-7.14237752487;床,-8.94748832727;伏,-9.34892928508;阕,-11.0597196918;级,-6.90187881799;期,-6.58998747668;群,-6.49190529233;輯,-10.0541978262;撮,-10.0541978262;週,-5.63125164076;申,-9.89656888197;阵,-5.27671535907;幅,-6.91552732383;升,-8.14014877919;葉,-7.97780972198;克,-6.33587797607;車,-7.9596274029;双,-6.13294921513;處,-5.72442772244;束,-8.21094183118;几,-8.27470844954;门,-6.45721973434;對,-5.76373838503;杯,-6.36776037572;顿,-6.58162558836;卷,-5.73768579861;刀,-7.38764735598;丈,-6.91658496538;成,-5.98496263004;頂,-7.69703216488;碗,-6.6987464663;級,-6.90187881799;钟,-5.93337758997;億,-6.20405022446;箱,-8.72434477596;圈,-6.60614788994;叁,-13.7677698929;所,-6.67852673785;筆,-6.6570737699;槍,-7.2861927636;行,-6.4558837288;发,-7.66969561071;兒,-5.6112596668;招,-8.27883216672;代,-5.8835699592;日,-4.99888456674;層,-5.59560544077;俩,-12.1583319804;番,-6.1392522663;轮,-6.00050589612;噸,-5.01566269455;七,-6.83532200131;載,-7.65630255338;程,-8.71152408753;疊,-7.90130183594;玖,-13.7677698929;伙,-7.80934519985;久,-5.52081186031;次,-3.29962215395;輩,-8.69259607764;微,-10.9345565488;帳,-10.877398135;样,-6.41725372104;家,-4.39846188981;纸,-8.30393808785;刻,-6.12957164859;十,-5.61874602483;手,-6.28227828485;秒,-8.12232299523;擔,-8.34723489361;余,-6.15050207925;盘,-7.58982577883;線,-6.98218224787;锤,-9.64063550783;章,-5.75873920781;陣,-5.27671535907;仨,-13.7677698929;六,-6.31885379033;顷,-6.16437055314;叶,-7.97780972198;幕,-7.57745448702;重,-7.11619801929;堂,-8.84051620772;分,-4.31880639874;月,-5.48680549232;尊,-7.87336705861;團,-6.99240380194;條,-4.40978567899;夜,-6.26337833372;趟,-6.92295441367;錠,-8.88496797029;攤,-8.79103615046;亩,-6.70215652928;帮,-8.30393808785;戶,-6.23193943008;尺,-6.77383691765;個,-1.86401253158;組,-6.92295441367;服,-9.09494105842;摊,-8.79103615046;筐,-9.76043670765;雙,-6.13294921513;兜,-11.2828632431;毫,-7.03436800104;汪,-10.1842509544;路,-5.54494776206;聲,-4.73202103163;整,-9.89656888197;八,-6.400692833;幾,-8.27470844954;樁,-8.10828767712;會,-7.18021987805;三,-4.84791552069;辈,-8.69259607764;倍,-5.96148060361;册,-8.2225924484;銖,-10.1568519802;醜,-9.47731045173;生,-7.97780972198;斤,-6.02103698512;頭,-5.97500817206;支,-5.51506321631;許,-7.97171214211;记,-8.48965523365;队,-6.91236109427;節,-7.14237752487;届,-5.34885127073;遍,-6.084826723;里,-4.65515260943;套,-5.81621056172;盞,-7.40819602421;叠,-7.90130183594;子,-5.4385944508;胎,-9.01417970177;目,-7.98702637709;台,-6.48569623478;间,-6.32879830048;具,-7.34777496473;幹,-6.43083297917;盾,-12.1583319804;枝,-7.5372884453;座,-5.35527077258;貫,-9.33695309403;芯,-11.2028205354;段,-5.32594700849;張,-5.42302713846;羽,-10.9345565488;局,-8.64380591347;寅,-10.5096733549;臉,-7.3078654385;案,-8.16196782658;半,-5.55764548771;晌,-7.22963006911;面,-6.09315239551;句,-4.72124340614;端,-7.88723690648;發,-7.66969561071;頃,-6.16437055314;包,-7.77380846557;颗,-6.07520024481;万,-4.75368774343;鄉,-8.68017355765;鎊,-7.11232954251;伍,-11.9760104236;二,-4.92863814033;頓,-6.58162558836;檔,-8.61447829838;溜,-8.62610633638;鬥,-8.20708826186;扇,-7.77880847599;帧,-10.6322756769;天,-3.91842178644;縷,-8.16934793388;卅,-10.6767274395;酉,-10.1042082467;位,-4.24283778314;镑,-7.11232954251;道,-5.67859421404;柒,-13.7677698929;機,-11.6883283512;档,-8.61447829838;步,-5.10284658944;兩,-5.8520566935;部,-4.19056665058;只,-4.419408223;副,-6.34003105235;峰,-8.36960719136;时,-8.18804006689;类,-5.73119648317;百,-5.95701177635;载,-7.65630255338;岁,-5.27241339607;開,-7.60867450439;笔,-6.6570737699;餘,-6.15050207925;垧,-13.0746227123;截,-8.03442861598;本,-6.75565459857;串,-7.64967269484;点,-4.29168635597;脸,-7.3078654385;眼,-5.50057770695;品,-6.5725825727;時,-8.18804006689;担,-8.34723489361;屆,-5.34885127073;名,-4.82910701921;闋,-11.0597196918;類,-5.73119648317;員,-6.80268954728;幢,-8.37869816306;票,-8.68017355765;数,-4.41332917693;干,-6.43083297917;壹,-12.6691576042;份,-5.50676010685;封,-6.71073291118;門,-6.45721973434;把,-5.44488987111;少,-4.98713609338;朗,-10.4355653827;丝,-6.84315749683;捆,-8.92358280642;席,-8.20708826186;米,-4.0516968442;根,-5.83289832693;滴,-7.9271282355;元,-2.92378691977;种,-3.30901886715;桌,-8.19942538912;盒,-8.52602287782;块,-5.28062362281;九,-6.9261544164;团,-6.99240380194;瓦,-6.54374508459;桩,-8.10828767712;卯,-10.2414093683;曲,-8.008868119;瓶,-7.61716712443;项,-5.48528688915;勺,-9.51927465083;一,-4.48158020862;點,-4.29168635597;撇,-9.42396447102;安,-10.9345565488;戈,-13.0746227123;辑,-10.0541978262;帐,-10.877398135;贯,-9.33695309403;記,-8.48965523365;些,-3.76262868662;多,-3.52264489498;索,-11.0597196918;身,-7.21955079012;堆,-7.30474043596;維,-6.91870361024;萬,-4.75368774343;場,-5.57381686931;款,-6.55032646118;幀,-10.6322756769;杆,-8.64977608046;駕,-8.58038408704;艘,-6.78397992762;四,-5.43449953962;世,-10.6767274395;棟,-8.51027452085;车,-7.9596274029;柱,-9.00559595808;拳,-8.12941522354;絲,-6.84315749683;对,-5.76373838503;任,-7.63654340339;簇,-10.8233309137;辆,-5.6300817079;下,-4.51619161289;冊,-8.2225924484;折,-7.99944889708;丛,-10.8233309137;樣,-6.41725372104;夥,-7.80934519985;集,-8.67401969207;锭,-8.88496797029;架,-6.63847234395;匹,-6.64813425486;齐,-13.7677698929;等,-6.94014065838;之,-11.2028205354;打,-8.14375238669;著,-7.90413871728;姚,-12.1583319804;畝,-6.70215652928;条,-4.40978567899;幫,-8.30393808785;出,-6.68103195837;桿,-8.64977608046;开,-7.60867450439;处,-5.72442772244;文,-7.39786891005;例,-8.02476670507;茬,-9.19305891437;斗,-8.20708826186;帖,-9.93912849639;錘,-9.64063550783;通,-7.76635501492;张,-5.42302713846;株,-7.510102305;種,-3.30901886715;头,-5.97500817206;抹,-8.68017355765;回,-5.6639731799;着,-7.90413871728;层,-5.59560544077;磅,-9.41106106619;拉,-10.9951811706;午,-9.21389300128;塊,-5.28062362281;响,-8.14014877919;量,-4.57742816741;罐,-9.83594426015;篓,-10.6767274395;铢,-10.1568519802;腔,-8.87742076466;站,-7.70398468419;口,-5.5174109414;郎,-9.26796022255;佰,-13.0746227123;右,-4.4127232999;棵,-7.03080293488;驾,-8.58038408704;項,-5.48528688915;遭,-7.70631297395;簍,-10.6767274395;丑,-9.47731045173;粒,-7.75161273318;则,-7.25009861997;輛,-5.6300817079;度,-6.41340756246;顆,-6.07520024481;辰,-10.4004740629;堵,-8.74388937203;许,-7.97171214211;儿,-5.6112596668;千,-5.92942657732;盆,-8.25031699641;零,-9.89656888197;捌,-13.7677698929;批,-5.00841514431;司,-9.74241820214;乡,-8.68017355765;季,-6.27724049082;瓢,-9.37332073821;旬,-9.42396447102;页,-6.99126290051;起,-6.47067888772;件,-5.16311542569;特,-12.1583319804;寸,-7.18990853516;
+E,nrfg:怀,-7.87256402915;耀,-9.81847417821;渔,-8.71986188954;宝,-8.71986188954;贞,-7.17941684859;骧,-9.81847417821;輪,-9.12532699765;河,-5.07354204985;徵,-9.12532699765;临,-8.71986188954;然,-7.62124960087;方,-8.43217981709;派,-9.12532699765;珍,-8.71986188954;科,-9.81847417821;飛,-6.48626966803;赞,-6.64042034786;遠,-4.65941887899;知,-6.87403519904;巩,-7.51588908522;彪,-8.02671470898;扬,-8.20903626578;雯,-9.81847417821;年,-6.18088801848;其,-9.81847417821;驼,-9.81847417821;滿,-9.81847417821;的,-3.35544472129;沈,-9.12532699765;羊,-8.43217981709;颐,-6.87403519904;五,-7.17941684859;枚,-7.62124960087;檜,-6.72743172485;倫,-9.12532699765;嘯,-8.71986188954;鸿,-6.56037764019;珂,-9.12532699765;雄,-9.81847417821;何,-7.73903263653;也,-7.42057890541;来,-7.04588545597;秦,-8.71986188954;嵩,-9.12532699765;迪,-9.81847417821;括,-9.12532699765;声,-7.33356752842;维,-8.43217981709;艷,-8.43217981709;基,-8.43217981709;广,-6.98526083415;邁,-7.33356752842;儀,-9.81847417821;順,-5.0910863595;沉,-9.12532699765;渊,-9.81847417821;劍,-9.12532699765;鞏,-7.51588908522;蒙,-9.81847417821;榛,-9.81847417821;劭,-8.20903626578;甸,-6.87403519904;柏,-8.20903626578;潔,-7.87256402915;聖,-9.81847417821;晚,-8.43217981709;坤,-8.71986188954;寧,-5.31866450788;绵,-9.12532699765;啸,-8.71986188954;智,-9.81847417821;节,-8.71986188954;树,-7.73903263653;丕,-9.81847417821;傖,-9.12532699765;宜,-9.81847417821;伟,-6.87403519904;貞,-7.17941684859;春,-4.93567225562;蕃,-6.82274190466;飆,-9.12532699765;汉,-7.25352482075;克,-7.11042397711;今,-9.81847417821;前,-6.23495523975;双,-7.42057890541;翔,-7.25352482075;南,-7.62124960087;仪,-9.81847417821;铮,-8.71986188954;捷,-9.81847417821;渭,-6.41727679655;贊,-6.64042034786;咏,-7.42057890541;化,-9.81847417821;梧,-7.87256402915;義,-8.02671470898;洪,-9.81847417821;涵,-7.62124960087;摄,-8.71986188954;重,-9.12532699765;嘎,-8.20903626578;駝,-9.81847417821;兢,-8.20903626578;日,-6.77395174049;学,-8.43217981709;丽,-9.12532699765;恬,-6.15491253208;绳,-8.43217981709;淵,-9.81847417821;锅,-9.81847417821;載,-6.38448697372;予,-9.81847417821;越,-7.73903263653;鎖,-7.73903263653;贵,-7.62124960087;貴,-7.62124960087;达,-4.89849325238;畅,-8.71986188954;慶,-6.64042034786;城,-7.04588545597;角,-8.43217981709;静,-7.87256402915;驛,-6.87403519904;江,-4.7247239774;桧,-6.72743172485;實,-8.71986188954;瑯,-7.62124960087;平,-5.07354204985;鳴,-9.12532699765;遷,-6.64042034786;書,-7.87256402915;旺,-9.81847417821;好,-8.71986188954;犁,-9.81847417821;适,-8.02671470898;王,-7.42057890541;明,-3.68724768873;謐,-9.81847417821;丞,-8.02671470898;菊,-8.71986188954;綿,-9.12532699765;举,-9.81847417821;穆,-8.43217981709;友,-8.71986188954;虎,-5.75803116766;子,-9.12532699765;法,-7.17941684859;伸,-9.81847417821;雙,-7.42057890541;裝,-8.43217981709;闯,-8.71986188954;普,-9.81847417821;懷,-7.87256402915;楼,-8.20903626578;应,-7.73903263653;琅,-7.62124960087;备,-4.6709797014;縉,-8.20903626578;榜,-9.81847417821;亞,-9.12532699765;圣,-9.81847417821;大,-5.50098606467;婆,-7.33356752842;芜,-6.23495523975;鶴,-9.81847417821;权,-4.53527044947;奇,-8.71986188954;义,-8.02671470898;迈,-7.33356752842;鍋,-9.81847417821;里,-6.01181168844;敏,-9.12532699765;衝,-5.36412688196;珠,-9.81847417821;繩,-8.43217981709;陽,-7.51588908522;恭,-9.81847417821;寰,-9.81847417821;練,-9.12532699765;軾,-9.81847417821;權,-4.53527044947;融,-6.98526083415;昌,-5.82949013164;梓,-7.33356752842;熙,-6.18088801848;耘,-9.81847417821;岛,-7.73903263653;錚,-8.71986188954;东,-5.86723045963;綱,-8.02671470898;莲,-9.81847417821;治,-8.43217981709;挺,-8.43217981709;羽,-8.43217981709;社,-8.71986188954;蓋,-5.9683265765;慎,-8.71986188954;豐,-8.20903626578;博,-9.12532699765;深,-4.97428709175;凹,-9.81847417821;選,-9.12532699765;锁,-7.73903263653;参,-7.33356752842;娟,-6.98526083415;蔡,-9.12532699765;天,-7.11042397711;風,-7.51588908522;羲,-8.71986188954;玺,-9.12532699765;瑋,-7.62124960087;野,-9.81847417821;闖,-8.71986188954;揚,-8.20903626578;良,-9.81847417821;峰,-8.71986188954;时,-6.59959835334;乾,-9.81847417821;载,-6.38448697372;驿,-6.87403519904;昂,-9.12532699765;墉,-9.81847417821;開,-7.25352482075;華,-4.63108837237;林,-5.0910863595;備,-4.6709797014;涛,-9.81847417821;刚,-6.48626966803;谦,-6.72743172485;本,-7.42057890541;环,-9.81847417821;岱,-4.96644391429;三,-5.58436767361;弼,-8.43217981709;時,-6.59959835334;姓,-5.38765737937;若,-8.71986188954;可,-7.25352482075;浩,-9.81847417821;干,-9.12532699765;添,-9.81847417821;艺,-9.81847417821;轼,-9.81847417821;锋,-9.12532699765;民,-5.38765737937;朗,-7.42057890541;澜,-5.35256605955;暢,-8.71986188954;伧,-9.12532699765;說,-3.88888503482;蘭,-6.03428454429;纲,-8.02671470898;箴,-9.12532699765;鴻,-6.56037764019;總,-9.81847417821;元,-4.68267574116;远,-4.65941887899;孟,-9.81847417821;飞,-6.48626966803;韬,-7.73903263653;山,-5.50098606467;女,-9.12532699765;说,-3.88888503482;翼,-9.81847417821;极,-9.81847417821;劃,-8.43217981709;沪,-9.81847417821;安,-8.02671470898;皋,-9.81847417821;同,-7.11042397711;渐,-9.81847417821;圖,-7.33356752842;战,-6.48626966803;沧,-9.81847417821;伦,-9.12532699765;太,-5.52801473706;炯,-5.9266538801;丰,-8.20903626578;楊,-8.02671470898;华,-4.63108837237;近,-7.62124960087;乐,-9.12532699765;靖,-9.81847417821;川,-8.71986188954;邑,-8.02671470898;旭,-8.43217981709;任,-7.73903263653;來,-7.04588545597;和,-4.10804716083;源,-7.87256402915;樓,-8.20903626578;实,-8.71986188954;谧,-9.81847417821;玮,-7.62124960087;芸,-8.71986188954;胄,-9.81847417821;晋,-9.12532699765;佑,-6.41727679655;坡,-9.81847417821;因,-9.81847417821;極,-9.81847417821;帆,-9.12532699765;云,-7.42057890541;箓,-8.71986188954;斗,-9.12532699765;通,-9.12532699765;眠,-9.81847417821;參,-7.33356752842;佐,-9.81847417821;晖,-7.73903263653;进,-4.31721596766;书,-7.87256402915;敬,-9.12532699765;凯,-8.20903626578;晶,-9.81847417821;庆,-6.64042034786;國,-4.86264712061;名,-9.81847417821;斌,-9.81847417821;徐,-5.21330399222;弛,-7.73903263653;骞,-7.73903263653;阡,-9.12532699765;钢,-7.51588908522;為,-4.71860775038;千,-7.51588908522;磊,-7.17941684859;委,-9.81847417821;盖,-5.9683265765;荣,-8.02671470898;健,-7.62124960087;詩,-9.81847417821;長,-6.87403519904;图,-7.33356752842;淼,-9.81847417821;合,-9.12532699765;序,-9.81847417821;冑,-9.81847417821;耐,-9.81847417821;了,-8.71986188954;鎮,-9.12532699765;永,-7.73903263653;强,-4.52015681166;莽,-5.42402502354;放,-7.42057890541;见,-9.12532699765;勇,-6.98526083415;金,-7.73903263653;虔,-7.62124960087;祖,-9.12532699765;敞,-8.71986188954;鹤,-9.81847417821;周,-5.47466875636;士,-7.04588545597;凱,-8.20903626578;聰,-9.81847417821;庄,-8.20903626578;沛,-9.12532699765;星,-9.12532699765;弥,-9.81847417821;琳,-9.81847417821;玲,-9.81847417821;岸,-9.81847417821;总,-9.81847417821;滄,-9.81847417821;准,-8.71986188954;鹏,-8.43217981709;棠,-5.38765737937;淮,-7.62124960087;菲,-9.81847417821;鋼,-7.51588908522;梁,-8.71986188954;樂,-9.12532699765;見,-9.12532699765;昊,-9.81847417821;傑,-8.02671470898;划,-8.43217981709;朔,-6.82274190466;宗,-9.81847417821;军,-4.43397911542;业,-9.81847417821;芝,-8.43217981709;焰,-6.20755626556;朴,-9.12532699765;为,-4.71860775038;吾,-8.71986188954;跃,-9.81847417821;恆,-9.81847417821;诗,-9.81847417821;勝,-8.20903626578;瑞,-8.71986188954;裡,-6.01181168844;楠,-9.81847417821;彤,-6.18088801848;兰,-6.03428454429;臻,-6.03428454429;清,-6.32196661674;龄,-9.12532699765;吉,-9.81847417821;颖,-8.43217981709;亚,-9.12532699765;初,-8.20903626578;真,-9.81847417821;群,-9.81847417821;邦,-9.81847417821;夫,-9.81847417821;伯,-6.29211365359;週,-5.47466875636;冰,-7.51588908522;人,-4.26551459329;秀,-9.12532699765;升,-7.73903263653;奋,-6.48626966803;富,-9.81847417821;鋒,-9.12532699765;籙,-8.71986188954;衡,-8.43217981709;濤,-9.81847417821;雪,-5.86723045963;建,-6.38448697372;睿,-6.41727679655;宁,-5.31866450788;言,-7.17941684859;超,-6.87403519904;頌,-8.02671470898;成,-1.28304821853;皓,-6.1295947241;儒,-9.12532699765;辙,-9.12532699765;力,-7.87256402915;霞,-6.48626966803;文,-5.39963357041;戰,-6.48626966803;琴,-8.71986188954;边,-6.98526083415;练,-9.12532699765;立,-7.51588908522;行,-8.20903626578;发,-9.12532699765;浚,-6.98526083415;非,-9.81847417821;詠,-7.42057890541;廣,-6.98526083415;工,-7.87256402915;器,-7.62124960087;蕪,-6.23495523975;潮,-9.12532699765;松,-7.87256402915;如,-7.17941684859;紅,-6.32196661674;有,-7.62124960087;程,-9.12532699765;复,-7.04588545597;美,-8.20903626578;缙,-8.20903626578;吟,-8.02671470898;誠,-8.43217981709;鸣,-9.12532699765;津,-9.81847417821;圩,-8.71986188954;騫,-7.73903263653;阳,-7.51588908522;冲,-5.36412688196;家,-3.27025507545;庸,-6.72743172485;綺,-7.73903263653;魁,-7.17941684859;传,-9.81847417821;才,-6.77395174049;橋,-7.62124960087;晓,-9.81847417821;剛,-6.48626966803;胜,-8.20903626578;章,-7.73903263653;雨,-5.29668560116;業,-9.81847417821;修,-5.90645117278;危,-9.81847417821;寶,-8.71986188954;蟾,-6.1049021115;謀,-8.43217981709;堂,-9.81847417821;暉,-7.73903263653;月,-6.59959835334;优,-8.43217981709;在,-9.81847417821;琪,-9.81847417821;花,-9.81847417821;進,-4.31721596766;漸,-9.81847417821;心,-8.20903626578;曉,-9.81847417821;靈,-8.71986188954;恒,-9.81847417821;煜,-5.70760031404;筠,-9.81847417821;燧,-9.81847417821;杨,-8.02671470898;路,-7.87256402915;英,-6.32196661674;石,-8.43217981709;聲,-7.33356752842;烽,-9.81847417821;威,-9.81847417821;颂,-8.02671470898;圓,-8.43217981709;丙,-7.73903263653;蓮,-9.81847417821;思,-9.81847417821;生,-5.65959109485;亮,-6.38448697372;政,-7.17941684859;節,-8.71986188954;晉,-9.12532699765;衍,-9.81847417821;黎,-7.62124960087;剑,-9.12532699765;孫,-8.71986188954;姬,-9.81847417821;绮,-7.73903263653;台,-7.62124960087;幹,-9.12532699765;长,-6.87403519904;曾,-8.02671470898;醉,-6.56037764019;龍,-5.9472731673;麗,-9.12532699765;香,-9.81847417821;功,-4.64232444564;漢,-7.25352482075;傳,-9.81847417821;禹,-9.81847417821;汀,-7.25352482075;毅,-8.02671470898;應,-7.73903263653;青,-5.54180805919;巡,-8.02671470898;驤,-9.81847417821;奮,-6.48626966803;孺,-7.51588908522;發,-9.12532699765;拿,-9.12532699765;洁,-7.87256402915;恪,-6.1295947241;谋,-8.43217981709;莊,-8.20903626578;二,-7.62124960087;禎,-9.81847417821;龙,-5.9472731673;舟,-9.81847417821;鬥,-9.12532699765;京,-7.25352482075;榮,-8.02671470898;由,-8.02671470898;環,-9.81847417821;及,-8.02671470898;光,-7.51588908522;烈,-9.12532699765;珊,-7.62124960087;轍,-9.12532699765;道,-8.43217981709;诚,-8.43217981709;彭,-8.71986188954;滬,-9.81847417821;鲁,-6.48626966803;妃,-9.12532699765;理,-9.12532699765;愈,-5.67533945182;躍,-9.81847417821;宏,-9.81847417821;唐,-9.81847417821;得,-7.51588908522;稚,-7.73903263653;航,-9.81847417821;田,-9.12532699765;德,-6.64042034786;瀾,-5.35256605955;先,-6.98526083415;軍,-4.43397911542;彌,-9.81847417821;荔,-9.81847417821;志,-9.12532699765;飙,-9.12532699765;靜,-7.87256402915;聞,-8.20903626578;全,-7.17941684859;彬,-6.20755626556;至,-7.73903263653;闻,-8.20903626578;国,-4.86264712061;震,-7.25352482075;选,-9.12532699765;洋,-6.26312611672;仃,-7.87256402915;果,-8.71986188954;红,-6.32196661674;泰,-9.81847417821;中,-4.36315306285;新,-5.77542291037;強,-4.52015681166;偉,-6.87403519904;风,-7.51588908522;佗,-5.88664854548;韜,-7.73903263653;適,-8.02671470898;臨,-8.71986188954;魯,-6.48626966803;雲,-7.42057890541;援,-7.11042397711;島,-7.73903263653;白,-6.48626966803;卿,-7.25352482075;征,-9.12532699765;一,-5.08227572981;璇,-8.20903626578;圆,-8.43217981709;玉,-8.02671470898;興,-6.5226373122;多,-6.41727679655;頤,-6.87403519904;璧,-7.33356752842;身,-7.87256402915;優,-8.43217981709;維,-8.43217981709;芳,-7.42057890541;樸,-9.12532699765;迁,-6.64042034786;巍,-9.81847417821;燕,-7.73903263653;達,-4.89849325238;藝,-9.81847417821;瑜,-8.43217981709;信,-5.36412688196;嫣,-3.68074712412;姥,-5.1550350841;武,-7.73903263653;柱,-9.81847417821;晨,-8.43217981709;漁,-8.71986188954;謙,-6.72743172485;轮,-9.12532699765;攝,-8.71986188954;之,-4.91319939977;村,-7.33356752842;孙,-8.71986188954;高,-8.02671470898;齡,-9.12532699765;祥,-6.45117834822;東,-5.86723045963;艳,-8.43217981709;兵,-7.87256402915;开,-7.25352482075;梅,-9.12532699765;薇,-9.81847417821;昆,-8.43217981709;福,-8.20903626578;漠,-9.81847417821;璽,-9.12532699765;装,-8.43217981709;穎,-8.43217981709;存,-8.43217981709;满,-9.81847417821;聪,-9.81847417821;鵬,-8.43217981709;杰,-8.02671470898;兴,-6.5226373122;學,-8.43217981709;顺,-5.0910863595;丁,-9.81847417821;舉,-9.81847417821;邊,-6.98526083415;夏,-5.65959109485;準,-8.71986188954;喜,-8.71986188954;渡,-8.71986188954;欣,-9.81847417821;利,-7.25352482075;樹,-7.73903263653;海,-6.64042034786;镇,-9.12532699765;飚,-9.12532699765;忠,-8.20903626578;正,-3.58996317462;波,-6.92810242031;桥,-7.62124960087;祯,-9.81847417821;哲,-9.81847417821;灵,-8.71986188954;起,-6.05727406252;
+E,nrt:伊,-5.83204967018;宝,-5.86323259762;娜,-5.72406103212;錢,-10.1627830105;缪,-9.18195375745;河,-6.27778867743;然,-9.46963582991;机,-8.17035284578;贾,-9.6519573867;附,-9.87510093801;齊,-7.2360436084;珍,-9.18195375745;牌,-9.87510093801;科,-5.27745901845;賓,-7.597833653;乔,-8.21687286141;飛,-11.2613952991;统,-8.95881020614;赞,-8.86350002634;凡,-7.29110338558;遠,-6.17999093415;卢,-8.42818195508;查,-9.87510093801;班,-7.597833653;扬,-7.70604723764;鳳,-9.18195375745;慶,-8.21687286141;逋,-10.5682481186;缕,-11.2613952991;華,-7.15052143496;列,-8.42818195508;謝,-6.81874404264;厢,-11.2613952991;倫,-6.21797018221;芬,-7.82740809465;單,-10.1627830105;失,-9.31548515008;户,-9.46963582991;欽,-11.2613952991;鸿,-10.5682481186;雄,-10.1627830105;姆,-5.33981687949;赉,-9.87510093801;賈,-9.6519573867;晏,-10.1627830105;契,-9.18195375745;罕,-6.41720821268;衛,-6.83057850029;州,-5.48684375359;惠,-10.5682481186;来,-5.15437241139;盤,-11.2613952991;峨,-10.5682481186;火,-6.85467605187;迪,-7.45473280936;声,-9.31548515008;米,-5.17235042369;维,-6.87936866446;须,-10.5682481186;基,-5.31075274655;阴,-7.11826057274;广,-9.87510093801;儀,-10.1627830105;隅,-7.73503477452;宇,-11.2613952991;順,-6.98472918012;上,-7.96555843313;井,-7.16705073691;蒙,-6.55186509782;甘,-9.87510093801;岩,-11.2613952991;岳,-9.87510093801;纵,-7.82740809465;耶,-7.2540621139;甸,-8.62233796952;妻,-10.5682481186;羿,-8.21687286141;尾,-6.38619797593;雅,-6.29158199956;寇,-7.82740809465;泉,-8.62233796952;苍,-10.1627830105;柏,-9.87510093801;滕,-10.1627830105;虚,-7.29110338558;孜,-8.48880657689;俟,-9.6519573867;胡,-11.2613952991;民,-5.94818932009;寧,-5.63018351731;鳩,-7.73503477452;柯,-10.5682481186;巳,-9.6519573867;智,-11.2613952991;构,-8.86350002634;饭,-11.2613952991;舍,-7.15052143496;树,-8.95881020614;帕,-8.04251947427;北,-7.89409946915;宜,-9.31548515008;春,-9.6519573867;欧,-8.77648864935;梦,-8.77648864935;帝,-4.53396357428;脫,-7.08700802924;溪,-6.91758987728;袞,-4.44795069962;鳴,-8.00329876111;汉,-7.73503477452;克,-3.84863128171;車,-9.46963582991;前,-7.39019428823;桑,-6.91758987728;翔,-11.2613952991;南,-5.7849317472;瑙,-8.42818195508;几,-9.87510093801;仪,-10.1627830105;捷,-11.2613952991;固,-8.37102354124;儂,-10.1627830105;各,-6.53400748042;颇,-8.17035284578;丈,-9.18195375745;贊,-8.86350002634;库,-8.77648864935;尔,-3.47525886135;化,-10.5682481186;媛,-10.5682481186;沟,-9.18195375745;採,-7.67787636068;梧,-7.82740809465;義,-8.55334509803;洪,-9.6519573867;纳,-5.50249352526;水,-6.16764509833;猶,-8.17035284578;格,-5.02502570893;所,-9.46963582991;坎,-8.86350002634;仓,-8.62233796952;鴻,-10.5682481186;日,-4.80305701579;武,-6.7615856288;浪,-9.18195375745;淵,-10.1627830105;鎖,-10.1627830105;颜,-7.2360436084;加,-6.42511339218;冢,-8.48880657689;亨,-10.5682481186;鄭,-7.62380913941;达,-4.82524493076;密,-6.58856646467;手,-10.1627830105;城,-5.36975108731;角,-8.26566302558;取,-10.5682481186;盘,-11.2613952991;祝,-7.92919078896;江,-6.53400748042;连,-9.6519573867;卡,-6.14340148672;略,-8.31695631997;佩,-10.5682481186;滨,-9.18195375745;六,-7.62380913941;平,-6.44111373353;賴,-9.46963582991;叶,-7.76488773767;相,-11.2613952991;旺,-9.31548515008;比,-5.3029706061;钦,-11.2613952991;王,-2.71697612146;明,-7.36957500102;條,-8.37102354124;务,-9.18195375745;垣,-7.89409946915;禧,-4.5855720775;莫,-7.47720566522;斯,-3.30107166999;嬰,-9.6519573867;澳,-10.1627830105;戶,-9.46963582991;霸,-10.5682481186;礼,-9.46963582991;區,-10.5682481186;埃,-8.69644594167;穆,-10.1627830105;廉,-5.7849317472;友,-11.2613952991;父,-7.57251584502;虎,-9.87510093801;歐,-8.77648864935;法,-8.95881020614;诺,-6.40158289477;毛,-8.1259010832;祜,-7.96555843313;滩,-9.46963582991;豪,-11.2613952991;热,-7.76488773767;公,-8.95881020614;普,-5.77245757298;楼,-10.5682481186;湾,-8.08334146879;善,-9.87510093801;榜,-11.2613952991;亞,-4.74372402622;营,-8.62233796952;大,-7.86019791747;温,-8.42818195508;錫,-10.5682481186;皮,-7.65047738649;許,-8.55334509803;宰,-7.29110338558;雲,-7.96555843313;珀,-7.05670267974;权,-10.5682481186;奇,-5.52160238695;义,-8.55334509803;里,-3.88676628391;当,-7.54782323243;馮,-9.18195375745;珠,-10.1627830105;藤,-9.0641707218;奧,-5.7849317472;子,-7.20095228859;陽,-6.13149658421;卫,-6.83057850029;峪,-10.5682481186;目,-11.2613952991;佳,-10.1627830105;巴,-6.12559686208;須,-10.5682481186;權,-10.5682481186;昌,-5.9781915704;熙,-7.57251584502;岛,-5.598434819;东,-5.97312826844;那,-6.79548718048;莉,-9.31548515008;興,-6.75053579262;治,-6.79548718048;区,-10.5682481186;羽,-9.87510093801;社,-8.21687286141;坂,-9.87510093801;蓋,-8.21687286141;苏,-7.08700802924;豐,-7.31015158055;灘,-9.46963582991;博,-7.89409946915;保,-8.55334509803;神,-9.87510093801;浦,-8.48880657689;深,-8.48880657689;婴,-9.6519573867;雷,-6.4573742544;當,-7.54782323243;锁,-10.1627830105;考,-11.2613952991;钗,-5.51519210859;万,-5.88611689145;霍,-8.69644594167;岐,-9.18195375745;頓,-5.36149794555;徒,-8.08334146879;府,-9.87510093801;娟,-11.2613952991;锡,-10.5682481186;連,-9.6519573867;風,-7.2183440313;石,-8.69644594167;農,-7.57251584502;野,-8.00329876111;揚,-7.70604723764;機,-8.17035284578;灣,-8.08334146879;勤,-9.18195375745;湧,-9.18195375745;左,-8.86350002634;都,-6.7615856288;杭,-9.18195375745;曬,-9.87510093801;良,-8.55334509803;統,-8.95881020614;峰,-7.62380913941;时,-7.62380913941;兹,-7.34937229371;幾,-9.87510093801;庫,-8.77648864935;昂,-7.57251584502;開,-10.1627830105;紐,-10.5682481186;林,-5.47449791777;溝,-9.18195375745;谦,-10.5682481186;墩,-9.46963582991;本,-7.07174055711;纽,-10.5682481186;铁,-7.43275390264;時,-7.62380913941;过,-10.5682481186;奈,-11.2613952991;過,-10.5682481186;嵐,-10.1627830105;孔,-8.95881020614;察,-10.5682481186;塞,-6.98472918012;臣,-8.86350002634;院,-8.48880657689;壩,-9.87510093801;园,-8.77648864935;可,-6.68668432063;干,-7.57251584502;麗,-6.85467605187;艺,-11.2613952991;潼,-8.31695631997;門,-6.29855066887;厄,-8.21687286141;少,-11.2613952991;朗,-7.13426091409;洛,-6.69704710767;丝,-7.82740809465;增,-9.18195375745;蘭,-5.81035684557;匯,-7.08700802924;樵,-9.31548515008;宴,-10.5682481186;活,-10.5682481186;丽,-6.85467605187;元,-7.2360436084;郎,-8.62233796952;像,-11.2613952991;臘,-9.87510093801;赛,-9.46963582991;远,-6.17999093415;孟,-11.2613952991;飞,-11.2613952991;古,-7.13426091409;山,-5.11720966501;鹿,-8.37102354124;内,-5.91906104717;漆,-10.5682481186;安,-4.90528763844;計,-9.0641707218;踐,-6.99871542209;蒗,-9.0641707218;圖,-6.46560475354;战,-6.98472918012;四,-7.31015158055;伦,-6.21797018221;让,-8.42818195508;萬,-5.88611689145;肯,-7.86019791747;丰,-7.31015158055;洲,-10.1627830105;破,-6.71810051686;尼,-4.84466301662;陀,-7.32956966641;勃,-11.2613952991;渊,-10.1627830105;烏,-8.77648864935;华,-7.15052143496;濑,-10.5682481186;乐,-7.16705073691;塔,-5.38646456828;靖,-9.18195375745;托,-5.59151437615;川,-5.64099443342;邑,-11.2613952991;彦,-10.1627830105;车,-9.46963582991;濱,-9.18195375745;鹰,-11.2613952991;絲,-7.82740809465;底,-7.79565939633;省,-7.47720566522;來,-5.15437241139;和,-6.42511339218;莎,-7.02728879454;源,-7.08700802924;樓,-10.5682481186;匙,-9.6519573867;渭,-9.87510093801;贝,-7.89409946915;尧,-11.2613952991;蔭,-8.95881020614;茜,-11.2613952991;匹,-10.5682481186;主,-10.1627830105;沼,-10.5682481186;宾,-7.597833653;汇,-7.08700802924;等,-8.95881020614;麦,-6.46560475354;湛,-10.1627830105;条,-8.37102354124;因,-6.25744899319;迦,-9.87510093801;顿,-5.36149794555;戎,-8.77648864935;云,-7.96555843313;讓,-8.42818195508;芙,-8.37102354124;辛,-7.16705073691;通,-8.26566302558;貝,-7.89409946915;賚,-9.87510093801;涧,-9.46963582991;带,-8.55334509803;播,-7.65047738649;冯,-9.18195375745;估,-10.1627830105;陶,-7.67787636068;头,-8.95881020614;犹,-8.17035284578;呂,-9.87510093801;繆,-9.18195375745;韋,-7.92919078896;剎,-8.95881020614;仑,-10.1627830105;佐,-9.6519573867;奔,-7.92919078896;務,-9.18195375745;进,-11.2613952991;口,-6.47390355635;凯,-9.87510093801;奴,-7.16705073691;晶,-7.79565939633;泽,-7.86019791747;荫,-8.95881020614;蒂,-6.37104617091;庆,-8.21687286141;國,-5.68544619599;度,-8.62233796952;喬,-8.21687286141;縱,-7.82740809465;刹,-8.95881020614;硕,-7.31015158055;盖,-8.21687286141;牙,-8.77648864935;佛,-7.47720566522;荣,-9.6519573867;凤,-9.18195375745;寨,-6.75053579262;翰,-5.33981687949;特,-3.39390673043;司,-11.2613952991;彻,-9.87510093801;图,-6.46560475354;西,-4.54359060411;諾,-6.40158289477;沃,-7.70604723764;羅,-4.37793271272;合,-9.46963582991;崎,-8.62233796952;外,-9.46963582991;鎮,-6.31975287652;厝,-9.46963582991;薩,-6.30556824153;萨,-6.30556824153;熱,-7.76488773767;茲,-7.34937229371;濟,-9.87510093801;永,-8.37102354124;强,-7.76488773767;见,-8.95881020614;翅,-9.0641707218;济,-9.87510093801;金,-6.37859337655;祖,-6.43308156183;周,-9.31548515008;士,-8.69644594167;坪,-8.95881020614;马,-5.49620419635;浮,-11.2613952991;凱,-9.87510093801;恰,-10.1627830105;鷹,-11.2613952991;缅,-10.1627830105;庄,-11.2613952991;切,-9.87510093801;针,-8.08334146879;崙,-10.1627830105;客,-7.15052143496;淳,-6.99871542209;脱,-7.08700802924;琳,-5.32385909405;费,-8.95881020614;岸,-7.96555843313;阿,-8.17035284578;喾,-8.08334146879;黄,-8.1259010832;哈,-5.69687489181;穗,-8.95881020614;拜,-7.76488773767;村,-6.86694614446;询,-11.2613952991;彥,-10.1627830105;令,-9.18195375745;哨,-11.2613952991;淮,-9.6519573867;菲,-6.48227180602;更,-10.5682481186;婷,-11.2613952991;絹,-7.89409946915;梁,-9.6519573867;樂,-7.16705073691;見,-8.95881020614;傑,-7.82740809465;間,-8.69644594167;舒,-11.2613952991;宗,-4.59316705072;沙,-7.79565939633;军,-10.5682481186;业,-8.62233796952;芝,-6.10810370464;猜,-10.1627830105;麥,-6.46560475354;第,-7.16705073691;氮,-9.87510093801;坡,-9.0641707218;構,-8.86350002634;歌,-9.31548515008;郑,-7.62380913941;雕,-9.0641707218;祥,-9.46963582991;勝,-10.5682481186;卜,-10.1627830105;域,-8.69644594167;瑞,-7.27241125257;裡,-3.88676628391;詢,-11.2613952991;绥,-8.95881020614;佤,-9.87510093801;辽,-9.46963582991;兰,-5.81035684557;清,-8.69644594167;吉,-6.40158289477;式,-8.55334509803;芒,-11.2613952991;愛,-9.87510093801;亚,-4.74372402622;土,-9.46963582991;堡,-5.9832806399;庚,-7.79565939633;澤,-7.86019791747;邦,-9.87510093801;夫,-4.33090053318;伯,-7.32956966641;週,-9.31548515008;真,-7.70604723764;人,-2.72400740043;俄,-9.46963582991;升,-8.86350002634;葉,-7.76488773767;積,-8.48880657689;富,-7.15052143496;勒,-4.66835076499;摩,-6.31975287652;门,-6.29855066887;雪,-8.95881020614;婭,-8.00329876111;陵,-7.16705073691;豹,-11.2613952991;建,-7.73503477452;板,-9.87510093801;宁,-5.63018351731;涅,-7.73503477452;成,-4.95694649671;龙,-6.31263540876;丘,-8.48880657689;力,-6.09660932521;计,-9.0641707218;夢,-8.77648864935;尤,-9.87510093801;榭,-8.86350002634;莱,-6.21153929188;戰,-6.98472918012;嚳,-8.08334146879;琴,-11.2613952991;徹,-9.87510093801;游,-9.46963582991;贺,-10.1627830105;黃,-8.1259010832;池,-9.31548515008;立,-8.77648864935;行,-10.1627830105;发,-8.77648864935;兒,-8.48880657689;規,-10.1627830105;策,-11.2613952991;針,-8.08334146879;遜,-6.0909113041;非,-8.86350002634;廣,-9.87510093801;工,-10.5682481186;僧,-8.04251947427;置,-9.6519573867;迹,-11.2613952991;遼,-9.46963582991;松,-7.10251221577;布,-5.77659836564;紅,-11.2613952991;复,-7.50019518344;氏,-7.54782323243;美,-7.70604723764;易,-6.42511339218;頗,-8.17035284578;縣,-7.10251221577;津,-6.666275449;阳,-6.13149658421;家,-9.46963582991;庸,-8.1259010832;嶺,-4.89664454228;杉,-11.2613952991;橋,-7.36957500102;屏,-8.48880657689;塗,-8.62233796952;默,-8.86350002634;胜,-10.5682481186;瑟,-6.36355549918;章,-9.87510093801;革,-11.2613952991;雨,-10.1627830105;業,-8.62233796952;修,-7.89409946915;危,-10.5682481186;寶,-5.86323259762;蟾,-8.55334509803;堂,-10.5682481186;約,-7.73503477452;醇,-9.18195375745;分,-8.21687286141;月,-8.31695631997;萊,-6.21153929188;颍,-7.96555843313;綏,-8.95881020614;玛,-5.83204967018;尚,-7.597833653;贤,-6.97093585799;木,-7.29110338558;宫,-7.92919078896;琪,-11.2613952991;梭,-8.37102354124;進,-11.2613952991;心,-7.89409946915;桂,-9.18195375745;采,-7.67787636068;靈,-8.77648864935;苑,-9.18195375745;潘,-8.21687286141;赤,-9.31548515008;瑪,-5.83204967018;路,-5.92867650587;英,-6.31975287652;柳,-8.48880657689;聲,-9.31548515008;能,-10.5682481186;威,-10.1627830105;嘉,-9.18195375745;于,-7.50019518344;我,-10.1627830105;吕,-9.87510093801;岚,-10.1627830105;思,-6.98472918012;农,-7.57251584502;生,-5.81035684557;模,-10.1627830105;頭,-8.95881020614;馬,-5.49620419635;爱,-9.87510093801;育,-9.0641707218;鐵,-7.43275390264;丹,-8.55334509803;政,-9.46963582991;居,-6.61700439999;瓊,-9.46963582991;提,-8.08334146879;扎,-7.47720566522;黑,-6.54289642784;內,-5.91906104717;齐,-7.2360436084;姬,-11.2613952991;台,-7.41124769742;间,-8.69644594167;幹,-7.57251584502;畿,-8.21687286141;曾,-6.48227180602;宅,-10.1627830105;皇,-11.2613952991;龍,-6.31263540876;希,-6.48227180602;園,-8.77648864935;店,-11.2613952991;香,-8.26566302558;榮,-9.6519573867;阜,-9.87510093801;功,-9.0641707218;漢,-7.73503477452;瀨,-10.5682481186;測,-7.597833653;央,-8.1259010832;傳,-9.0641707218;露,-8.77648864935;康,-8.42818195508;汀,-7.57251584502;乌,-8.77648864935;青,-8.86350002634;赖,-9.46963582991;塘,-7.89409946915;跡,-11.2613952991;屠,-10.5682481186;盧,-8.42818195508;敦,-8.48880657689;端,-9.46963582991;廷,-9.0641707218;發,-8.77648864935;拿,-9.31548515008;蘇,-7.08700802924;鄉,-8.69644594167;莊,-11.2613952991;禎,-3.46657214695;君,-6.78405848466;贡,-8.21687286141;京,-7.39019428823;妮,-7.2183440313;耳,-10.1627830105;茵,-10.5682481186;縷,-11.2613952991;賀,-10.1627830105;光,-7.86019791747;珊,-9.6519573867;道,-7.54782323243;单,-10.1627830105;坝,-9.87510093801;賽,-9.46963582991;彭,-10.5682481186;寺,-8.86350002634;曼,-5.25012812473;鲁,-6.73960672208;市,-7.65047738649;理,-6.1862214839;唐,-11.2613952991;澗,-9.46963582991;原,-6.67642782046;岡,-7.41124769742;素,-10.5682481186;亭,-8.04251947427;钱,-10.1627830105;田,-7.11826057274;膳,-6.90468647244;防,-11.2613952991;德,-3.56654722675;县,-7.10251221577;先,-11.2613952991;軍,-10.5682481186;边,-8.08334146879;晒,-9.87510093801;荔,-7.92919078896;志,-10.5682481186;常,-6.91758987728;杜,-9.46963582991;童,-10.5682481186;衮,-4.44795069962;部,-8.77648864935;空,-9.18195375745;国,-5.68544619599;娅,-8.00329876111;倉,-8.62233796952;潭,-8.21687286141;羌,-7.27241125257;向,-7.50019518344;弗,-8.00329876111;果,-9.31548515008;红,-11.2613952991;室,-8.86350002634;泰,-6.80704800288;努,-10.1627830105;中,-4.57179602995;侬,-10.1627830105;新,-7.73503477452;強,-7.76488773767;根,-6.56091493334;廂,-11.2613952991;测,-7.597833653;风,-7.2183440313;叔,-8.48880657689;罗,-4.37793271272;绢,-7.89409946915;瓦,-5.96809047441;恩,-6.07961174884;赫,-6.87936866446;约,-7.73503477452;结,-9.0641707218;魯,-6.73960672208;森,-6.44921094376;曲,-7.92919078896;島,-5.598434819;白,-8.48880657689;一,-6.5700474169;玉,-7.76488773767;戈,-7.11826057274;岗,-9.6519573867;多,-5.68544619599;悟,-8.21687286141;鸠,-7.73503477452;索,-6.68668432063;馥,-11.2613952991;堤,-9.87510093801;溫,-8.42818195508;維,-6.87936866446;劳,-8.04251947427;容,-9.6519573867;施,-9.18195375745;琼,-9.46963582991;翁,-11.2613952991;哇,-8.37102354124;腊,-9.87510093801;代,-7.597833653;燕,-8.95881020614;達,-4.82524493076;泗,-8.77648864935;盛,-9.0641707218;楚,-9.6519573867;藝,-11.2613952991;信,-7.2360436084;坦,-6.40158289477;学,-6.68668432063;禮,-9.46963582991;飯,-11.2613952991;陰,-7.11826057274;費,-8.95881020614;釵,-5.51519210859;娃,-7.92919078896;涂,-8.62233796952;得,-5.87232356932;下,-7.76488773767;熊,-7.70604723764;納,-5.50249352526;謙,-10.5682481186;璜,-11.2613952991;堯,-11.2613952991;宮,-7.92919078896;谷,-7.76488773767;践,-6.99871542209;蒼,-10.1627830105;潁,-7.96555843313;什,-5.22352437921;草,-7.34937229371;顏,-7.2360436084;坑,-9.31548515008;汗,-9.0641707218;高,-5.39776412354;虛,-7.29110338558;瓜,-10.1627830105;奥,-5.7849317472;韦,-7.92919078896;寮,-11.2613952991;東,-5.97312826844;碩,-7.31015158055;登,-6.03564862542;冈,-7.41124769742;开,-10.1627830105;梅,-8.77648864935;文,-6.84255469134;逊,-6.0909113041;福,-5.98839574057;吒,-6.75053579262;世,-4.05501800766;传,-9.0641707218;谢,-6.81874404264;茨,-5.05481937241;岭,-4.89664454228;地,-6.0249533363;帶,-8.55334509803;爾,-3.47525886135;仁,-9.31548515008;襄,-9.31548515008;拉,-3.57661135561;遊,-9.46963582991;賢,-6.97093585799;小,-5.7560637632;湖,-10.1627830105;塚,-8.48880657689;營,-8.62233796952;积,-8.48880657689;杰,-7.82740809465;右,-10.1627830105;兴,-6.75053579262;竹,-11.2613952991;學,-6.68668432063;顺,-6.98472918012;丁,-5.70456723743;隆,-7.76488773767;邊,-8.08334146879;涌,-9.18195375745;夏,-8.37102354124;撒,-6.99871542209;崗,-9.6519573867;官,-9.18195375745;望,-9.0641707218;喜,-11.2613952991;渡,-10.1627830105;貢,-8.21687286141;利,-4.76462030895;蒲,-7.29110338558;慈,-8.77648864935;樹,-8.95881020614;许,-8.55334509803;於,-7.50019518344;儿,-8.48880657689;规,-10.1627830105;镇,-6.31975287652;珈,-10.1627830105;鸣,-8.00329876111;某,-11.2613952991;勞,-8.04251947427;乡,-8.69644594167;季,-10.1627830105;波,-7.15052143496;桥,-7.36957500102;結,-9.0641707218;物,-7.82740809465;緬,-10.1627830105;祯,-3.46657214695;灵,-8.77648864935;海,-5.95312760173;
+E,nr:怀,-7.14529667896;挂,-11.1388996714;蘄,-13.6238063212;誇,-10.9847489916;耀,-7.7516885317;涉,-10.9157561201;谈,-11.3212212282;伊,-7.73216210935;厍,-13.6238063212;随,-9.52946175895;預,-9.98622016145;茂,-7.16233814482;舰,-9.59845463044;抗,-9.75260531027;脖,-12.5251940325;料,-9.8171438314;萘,-11.8320468519;亟,-12.9306591406;洞,-7.0973114616;造,-9.14646950669;咣,-12.5251940325;錢,-10.1272987597;嘤,-13.6238063212;媧,-12.5251940325;礦,-10.0684582597;悫,-12.9306591406;缪,-10.7905929771;戬,-9.63482227461;潜,-8.26251415546;河,-5.67013654252;欲,-8.86163238638;侵,-10.6280740476;临,-7.47320355273;銷,-12.2375119601;然,-7.37383107891;緩,-10.4457524908;鑾,-10.3657097832;场,-12.9306591406;宽,-7.97835942353;线,-8.20770591897;輊,-13.6238063212;黛,-10.1898191167;談,-11.3212212282;豈,-11.3212212282;珍,-6.1405619051;牌,-10.5792838834;雏,-10.3279694552;姑,-8.01800425488;筒,-11.6778961721;織,-9.83961668725;苗,-8.97941542203;镖,-11.5443647795;摘,-12.2375119601;话,-10.6280740476;爻,-10.6280740476;仟,-13.6238063212;浞,-10.9157561201;凡,-8.01800425488;遠,-6.74960782572;铣,-11.1388996714;卢,-8.10635342471;知,-7.74048393268;除,-10.7905929771;鐓,-12.5251940325;巩,-9.77365871946;彪,-6.98917296331;扬,-7.8126653282;衰,-10.5792838834;泳,-10.6280740476;歲,-10.7334345633;其,-7.45210572376;闹,-10.2565104912;祥,-5.515484031;绿,-7.82774857041;渔,-9.46492323781;愁,-12.0143684087;萃,-11.1388996714;驪,-11.0588569637;暄,-11.0588569637;訇,-13.6238063212;榆,-9.56336331063;雅,-7.09292869345;沈,-10.4049304963;逋,-13.6238063212;鄖,-12.9306591406;湃,-10.8512175989;嘏,-11.1388996714;閎,-10.2565104912;鮒,-11.1388996714;引,-7.208709362;应,-8.88760787278;鐘,-8.2211289393;攙,-12.9306591406;枚,-10.6280740476;謝,-8.25783030615;檜,-8.89641850246;涞,-12.2375119601;儡,-13.6238063212;吣,-11.8320468519;厢,-9.61647313594;皤,-12.9306591406;禦,-8.71853154273;循,-10.0402873827;芬,-6.6606163353;蝉,-10.0402873827;氳,-13.6238063212;讲,-12.0143684087;溟,-10.6280740476;爷,-5.92396391378;冶,-9.52946175895;锹,-13.6238063212;咸,-8.97941542203;砻,-12.5251940325;贞,-7.75450940804;媼,-11.3212212282;琏,-6.99444306774;闊,-8.96984597102;曄,-9.31974122797;视,-9.88613670289;赉,-12.0143684087;賈,-8.77961923471;運,-8.29593015238;俊,-6.67490909886;璣,-11.1388996714;契,-8.71115143544;烹,-13.6238063212;寒,-8.71115143544;录,-8.40345049609;黔,-10.9157561201;锡,-7.90677861977;教,-8.2211289393;衛,-6.6018298981;跫,-12.5251940325;也,-10.3279694552;淞,-9.13516995144;瑣,-11.4265817438;叢,-8.75627187072;靥,-13.6238063212;盤,-8.28626824147;婧,-9.404298616;狐,-10.1580704184;嵩,-8.24390896763;黽,-11.5443647795;括,-9.06992942957;景,-7.65765958205;轼,-12.0143684087;诲,-11.4265817438;滴,-10.9157561201;铸,-8.88760787278;须,-10.4883121052;基,-6.2164886107;广,-7.67316376859;巾,-8.74860899797;片,-11.4265817438;萁,-11.4265817438;漪,-10.9157561201;殇,-13.6238063212;蠆,-13.6238063212;沉,-9.54626887727;贈,-11.3212212282;上,-9.79516492468;劍,-6.94798309954;鞏,-9.77365871946;后,-5.86376564029;碑,-9.61647313594;經,-8.08647205415;底,-8.76399391681;怖,-13.6238063212;蒙,-6.96067362518;鈹,-12.9306591406;牛,-8.22564361966;辟,-13.6238063212;玄,-7.61745316157;閣,-6.49691551227;跚,-13.6238063212;砦,-11.8320468519;岩,-6.00703051247;憫,-11.8320468519;貳,-11.8320468519;枯,-10.679367342;胜,-6.44221437656;椰,-13.6238063212;足,-9.18115506468;鬲,-12.9306591406;伴,-11.1388996714;鲸,-8.33553929048;钹,-12.9306591406;妻,-9.04909534267;媽,-6.86687393193;笼,-10.7905929771;羿,-10.8512175989;尾,-10.0684582597;旃,-11.6778961721;骊,-11.0588569637;框,-12.9306591406;泉,-6.77474003854;浈,-11.4265817438;釋,-9.404298616;湊,-11.5443647795;埏,-12.9306591406;壑,-10.5792838834;奐,-10.9847489916;绕,-10.1580704184;罔,-12.5251940325;聖,-7.23524491563;敘,-9.96024467504;晚,-9.88613670289;譜,-8.68216389856;濟,-7.54387312608;汞,-12.9306591406;郡,-6.74034373476;谑,-12.5251940325;嗣,-7.98545165184;牢,-10.0974457966;坤,-12.9306591406;寧,-5.57246538788;絨,-9.77365871946;犟,-12.9306591406;繪,-10.2226089395;跳,-9.79516492468;柯,-9.01863613518;棱,-9.49667193613;淳,-7.46682733559;該,-12.0143684087;轴,-10.7905929771;号,-9.46492323781;偶,-10.9847489916;啸,-9.73198602306;移,-10.0402873827;贾,-8.77961923471;态,-10.4883121052;节,-8.18572701225;蘅,-10.7905929771;构,-9.06992942957;謇,-9.37531107912;梆,-12.5251940325;消,-10.9847489916;儋,-10.9157561201;爍,-12.0143684087;厌,-13.6238063212;霏,-12.9306591406;咎,-12.0143684087;頑,-11.2259110484;紓,-10.7334345633;媒,-13.6238063212;帕,-8.51181853282;羔,-12.9306591406;茗,-10.9157561201;肖,-9.69198068845;濮,-12.9306591406;讜,-12.9306591406;伟,-6.01940997238;貞,-7.75450940804;倡,-10.9847489916;冠,-8.61986001523;锣,-11.6778961721;劢,-11.8320468519;鬧,-10.2565104912;鋰,-10.2226089395;鰩,-12.0143684087;渝,-9.43415157915;愫,-12.0143684087;纪,-7.42940093007;术,-7.96432410541;辜,-11.0588569637;洳,-12.9306591406;課,-12.0143684087;猷,-8.91427611986;吹,-10.4883121052;皺,-10.0128884085;稽,-10.9157561201;精,-8.86163238638;臀,-12.9306591406;拂,-12.5251940325;柄,-10.1272987597;歇,-9.79516492468;菲,-7.54387312608;汉,-6.26116105076;克,-5.20864585532;今,-9.12399665084;前,-7.94022655383;双,-8.96984597102;坏,-13.6238063212;铎,-8.4476565886;塑,-10.0402873827;姐,-6.06685574916;嫒,-13.6238063212;幕,-10.4457524908;翔,-7.56468312559;靜,-7.02939286142;胖,-10.7334345633;湍,-11.2259110484;遥,-10.0402873827;佟,-12.9306591406;賞,-9.34714020216;几,-11.3212212282;勢,-9.21708707391;巨,-9.63482227461;慫,-12.9306591406;廪,-12.2375119601;賓,-7.7516885317;杯,-10.6280740476;蓮,-6.63170989376;卷,-9.73198602306;鞒,-12.5251940325;固,-8.43084947028;导,-8.96036722706;齿,-9.75260531027;糾,-12.5251940325;戀,-9.93492686706;窪,-10.2226089395;鮫,-11.3212212282;狗,-8.24852791349;辉,-6.78005637217;丈,-10.0974457966;贊,-7.57171715225;再,-9.28000089932;遜,-6.99974109337;钏,-10.5327638678;袄,-12.5251940325;库,-7.989016718;砂,-11.5443647795;尔,-4.43775864177;挖,-12.0143684087;蔚,-8.66797926357;沟,-9.05945812971;伞,-9.93492686706;删,-12.5251940325;嚣,-11.0588569637;鄢,-11.4265817438;碧,-9.19298952233;符,-8.37678224901;義,-5.77097850889;披,-12.2375119601;爆,-12.0143684087;亳,-13.6238063212;纲,-6.99708857192;涵,-9.12399665084;水,-6.22440823784;傷,-10.679367342;猶,-10.5327638678;釹,-12.5251940325;赞,-7.57171715225;禽,-10.5792838834;箋,-10.2565104912;菁,-9.93492686706;所,-9.93492686706;旅,-10.1580704184;歆,-9.10201774412;濉,-11.6778961721;么,-12.2375119601;勋,-7.03350527298;浊,-11.1388996714;凍,-12.5251940325;偌,-13.6238063212;瓏,-11.8320468519;坎,-8.98907733294;煳,-12.5251940325;结,-8.82801577558;饒,-9.79516492468;胗,-13.6238063212;柙,-13.6238063212;櫛,-12.2375119601;贻,-12.5251940325;潞,-10.679367342;鏡,-8.81978527644;芑,-12.9306591406;監,-6.7758010466;闥,-11.3212212282;呤,-13.6238063212;学,-7.50570912313;翩,-9.86260620548;鸽,-10.9157561201;襦,-13.6238063212;臭,-11.3212212282;蓯,-11.8320468519;鲤,-10.9847489916;綰,-10.679367342;襲,-9.75260531027;淵,-7.27466732979;汴,-10.9157561201;烷,-10.5792838834;鍶,-13.6238063212;培,-7.42127080398;癸,-12.0143684087;碾,-12.9306591406;硼,-11.4265817438;酈,-11.3212212282;持,-7.19731786372;技,-11.4265817438;憂,-9.36112644413;鲁,-6.93545160723;馗,-12.5251940325;标,-7.8216879458;伉,-11.6778961721;予,-8.62659404741;越,-7.12854076524;酃,-12.5251940325;吏,-8.72596652122;笑,-7.04316718389;骐,-12.5251940325;岔,-12.9306591406;耗,-11.4265817438;缘,-8.00340545546;氟,-12.2375119601;辞,-9.09120682802;匡,-10.0402873827;加,-7.32118734543;蓁,-10.7905929771;冢,-12.2375119601;锥,-11.6778961721;潇,-8.92332595538;砧,-13.6238063212;宦,-10.9847489916;弩,-9.29307298089;舫,-10.9847489916;悬,-10.2565104912;誰,-12.9306591406;覲,-12.0143684087;洵,-9.67256260259;薟,-13.6238063212;隸,-9.58075505334;稻,-11.8320468519;尿,-9.77365871946;晃,-8.59992580033;懂,-12.0143684087;蓄,-11.3212212282;謠,-11.2259110484;轉,-8.30079634203;酶,-11.5443647795;免,-11.1388996714;城,-6.06633341956;筑,-9.8171438314;姒,-12.9306591406;絕,-10.7905929771;揖,-9.52946175895;蓀,-10.5327638678;補,-10.679367342;江,-5.26093049014;俞,-10.679367342;卡,-7.21527753011;陣,-7.40720022009;略,-7.90677861977;顧,-10.3657097832;實,-7.33594776101;彩,-8.18138861065;黨,-8.48800788412;鶚,-9.65351440762;摯,-10.2565104912;乳,-10.1898191167;赵,-8.03281934066;滿,-7.41521629508;遷,-7.67056298689;叶,-6.95557807276;相,-7.17018132228;驻,-10.9847489916;好,-8.83631457839;箫,-10.9847489916;屿,-9.19298952233;綸,-9.10201774412;怂,-12.9306591406;钦,-7.35471003747;榇,-12.0143684087;邀,-11.1388996714;争,-8.16422080703;袭,-9.75260531027;王,-5.27054482144;谊,-6.92430598101;傍,-11.3212212282;球,-8.40345049609;喏,-10.679367342;嘎,-10.1272987597;窑,-9.30631820764;遙,-10.0402873827;鎂,-10.3657097832;崔,-13.6238063212;或,-9.28000089932;轟,-10.9157561201;縮,-10.9157561201;條,-11.2259110484;务,-9.65351440762;匠,-9.93492686706;垣,-9.20496571338;逢,-9.71178331574;钥,-10.8512175989;唤,-7.27117692485;禧,-8.49984234177;缨,-9.65351440762;莫,-8.61317102708;覆,-9.86260620548;斯,-4.50700769361;澳,-10.0402873827;诸,-8.34060259243;贴,-11.1388996714;冷,-8.04407649519;制,-8.02538436217;隹,-11.6778961721;霸,-7.76873439897;鐺,-12.9306591406;渴,-13.6238063212;綿,-9.61647313594;績,-8.37153289313;苁,-11.8320468519;荀,-10.8512175989;恂,-9.69198068845;覷,-13.6238063212;友,-7.70222790153;衿,-12.9306591406;鎖,-9.46492323781;兌,-10.9847489916;子,-4.41596907941;離,-8.89641850246;漸,-8.77961923471;毛,-7.8126653282;葚,-13.6238063212;煉,-9.404298616;玻,-11.1388996714;跟,-12.9306591406;湞,-11.4265817438;占,-9.37531107912;矣,-11.0588569637;哥,-6.32468485846;秧,-13.6238063212;婦,-8.89641850246;廩,-12.2375119601;惭,-12.5251940325;谓,-9.38969981658;旯,-13.6238063212;普,-6.49771904787;諱,-10.7334345633;議,-8.88760787278;俳,-12.5251940325;衲,-12.2375119601;泵,-12.5251940325;浴,-9.16945902492;釷,-13.6238063212;缕,-10.9157561201;寻,-9.09120682802;壽,-7.21363143921;镫,-12.9306591406;幾,-11.3212212282;會,-6.30063560323;搅,-11.6778961721;薄,-9.61647313594;三,-7.69156113372;侈,-13.6238063212;倍,-11.0588569637;册,-10.5327638678;嚎,-12.9306591406;箐,-12.5251940325;弓,-8.90530744988;墒,-13.6238063212;抖,-11.6778961721;講,-12.0143684087;榜,-9.61647313594;负,-13.6238063212;亞,-5.89583077907;圣,-7.23524491563;葶,-12.2375119601;采,-9.41911370178;大,-7.33223718161;窦,-9.8171438314;羨,-10.9847489916;茫,-11.6778961721;支,-9.15789820252;暮,-11.1388996714;樱,-10.6280740476;蛉,-12.9306591406;漳,-12.0143684087;滲,-10.8512175989;儷,-12.2375119601;状,-8.51181853282;钺,-9.79516492468;齡,-7.57407286594;鴿,-10.9157561201;庾,-12.5251940325;扁,-10.4049304963;無,-9.44941905128;权,-6.88210562652;肠,-11.8320468519;义,-5.77097850889;迈,-9.30631820764;鍋,-13.6238063212;泊,-9.31974122797;凌,-8.91427611986;問,-8.47051472668;雎,-10.0684582597;穑,-13.6238063212;当,-10.0128884085;玢,-12.9306591406;展,-7.93683096483;巔,-11.8320468519;拖,-10.9847489916;柘,-11.8320468519;衝,-6.89997388035;缗,-13.6238063212;仞,-12.0143684087;剡,-12.5251940325;叠,-10.679367342;督,-8.85312169671;郢,-10.8512175989;奧,-7.74607053939;竦,-12.5251940325;繩,-9.96024467504;鹽,-9.49667193613;荫,-9.67256260259;峪,-8.71115143544;恭,-8.051652289;蛮,-9.21708707391;話,-10.6280740476;佳,-8.21216026932;棲,-9.16945902492;具,-10.9847489916;锦,-8.1515356475;飾,-10.679367342;顽,-11.2259110484;鞅,-8.6539930216;绾,-10.679367342;搀,-12.9306591406;肃,-8.16422080703;蜂,-9.58075505334;榉,-12.9306591406;栈,-10.4457524908;璋,-7.09292869345;權,-6.88210562652;鞍,-11.5443647795;銃,-11.6778961721;粑,-12.9306591406;犬,-9.01863613518;颓,-11.5443647795;稔,-13.6238063212;暗,-12.5251940325;鼎,-7.00774113604;耘,-11.6778961721;沛,-9.48067159478;挚,-10.2565104912;依,-6.18131359838;东,-5.25836668498;那,-8.32548895462;厥,-10.5327638678;判,-12.5251940325;座,-9.12399665084;鴦,-11.3212212282;长,-7.58593540125;撫,-7.99618520748;嬪,-8.06312469016;谳,-11.5443647795;芯,-10.0402873827;趱,-13.6238063212;梳,-12.0143684087;漲,-10.2226089395;段,-10.8512175989;訴,-12.5251940325;锶,-13.6238063212;熹,-8.18138861065;缵,-12.0143684087;区,-7.76017514557;徽,-8.72596652122;隋,-11.6778961721;夾,-11.0588569637;旁,-9.49667193613;髡,-11.4265817438;胃,-10.4883121052;熊,-9.21708707391;舷,-13.6238063212;仇,-10.4883121052;浆,-12.2375119601;觉,-8.76399391681;案,-11.6778961721;铋,-13.6238063212;陌,-11.3212212282;蹇,-12.9306591406;归,-8.95097748671;願,-10.679367342;敖,-10.2226089395;聘,-10.1272987597;泛,-9.73198602306;罢,-10.1272987597;保,-5.94316889361;乜,-12.9306591406;櫟,-9.16945902492;赤,-7.97835942353;闡,-10.7334345633;辑,-9.54626887727;睢,-11.3212212282;鉤,-10.5792838834;继,-8.77177605725;渐,-8.77961923471;秩,-9.83961668725;拯,-9.8171438314;慮,-10.3657097832;深,-7.57643414213;裳,-11.0588569637;轲,-10.0402873827;诵,-10.679367342;鸿,-6.94924492936;雷,-6.53957989907;當,-10.0128884085;凹,-11.1388996714;灸,-11.6778961721;峻,-9.01863613518;鍺,-12.9306591406;忽,-9.65351440762;幼,-10.1580704184;竿,-12.2375119601;騮,-12.5251940325;考,-8.96984597102;茅,-9.00868580433;抄,-11.4265817438;万,-7.7716038414;殊,-9.30631820764;圍,-9.56336331063;睛,-10.0974457966;岐,-9.49667193613;頓,-6.67586925256;徒,-8.06697825947;緯,-9.59845463044;肯,-8.24852791349;輝,-6.78005637217;溜,-11.2259110484;赋,-8.26251415546;英,-5.58982358649;連,-7.80076042569;垢,-12.9306591406;帧,-10.9157561201;獰,-13.6238063212;天,-6.83483457818;墨,-8.86163238638;宪,-8.11037757501;札,-11.4265817438;音,-8.19008431762;贱,-12.9306591406;農,-8.15997451615;鳞,-9.86260620548;炸,-11.5443647795;玺,-8.83631457839;缽,-11.1388996714;聋,-13.6238063212;禾,-9.29307298089;擀,-13.6238063212;恃,-10.9847489916;苄,-12.2375119601;乇,-12.9306591406;瑋,-8.73345719295;驶,-12.5251940325;轩,-5.79457378363;燎,-12.5251940325;鵑,-7.9133793038;鳐,-12.0143684087;忒,-10.4883121052;孕,-12.2375119601;嫔,-8.06312469016;晗,-9.04909534267;轸,-10.1272987597;汛,-10.0974457966;揚,-7.8126653282;機,-7.93683096483;啡,-13.6238063212;瓠,-12.9306591406;灣,-7.08277632198;矢,-9.69198068845;镌,-13.6238063212;勤,-8.12254811063;左,-10.5792838834;通,-5.982722072;篪,-11.5443647795;杭,-8.88760787278;曬,-12.5251940325;良,-6.27393261643;泰,-6.69624841489;访,-9.98622016145;鮑,-12.0143684087;兹,-6.99841395316;罕,-8.61986001523;类,-9.31974122797;虾,-9.56336331063;综,-9.77365871946;婿,-12.0143684087;滔,-9.05945812971;攀,-9.69198068845;赚,-11.2259110484;昂,-7.92671283467;軻,-10.0402873827;辇,-11.6778961721;開,-8.23473459136;樊,-11.1388996714;缃,-12.2375119601;鎏,-10.7334345633;琬,-9.58075505334;岑,-9.43415157915;紐,-11.4265817438;颂,-9.65351440762;窕,-12.9306591406;笔,-10.8512175989;林,-5.15328553796;搖,-8.8116219658;涛,-6.46296041451;戚,-10.0128884085;溝,-9.05945812971;钡,-11.1388996714;銥,-12.9306591406;墩,-9.54626887727;筝,-11.8320468519;斫,-13.6238063212;本,-7.40919822275;贰,-11.8320468519;串,-11.6778961721;湟,-12.2375119601;吶,-12.0143684087;点,-8.86163238638;綻,-12.0143684087;刺,-10.679367342;纽,-11.4265817438;弼,-7.65765958205;宿,-9.16945902492;破,-9.88613670289;擁,-9.71178331574;時,-8.16422080703;担,-12.0143684087;过,-11.4265817438;豆,-8.98907733294;棉,-10.0974457966;賽,-7.97483208301;闋,-13.6238063212;雍,-8.26251415546;鑣,-8.37678224901;珏,-9.93492686706;偎,-12.2375119601;嵐,-8.54240195619;姓,-10.1898191167;糴,-12.2375119601;孔,-8.36111613227;鈸,-12.9306591406;慘,-13.6238063212;蘭,-5.73622228951;仝,-8.07084673625;作,-9.69198068845;員,-9.83961668725;釣,-11.3212212282;院,-8.02168750029;忧,-9.36112644413;壩,-8.31060034213;票,-11.6778961721;婪,-12.5251940325;蛭,-11.6778961721;華,-5.43012965522;泱,-13.6238063212;走,-10.4883121052;槳,-12.9306591406;執,-9.12399665084;瑶,-5.963692002;價,-9.67256260259;典,-8.10234540331;猗,-13.6238063212;绽,-12.0143684087;彼,-11.4265817438;寿,-7.21363143921;顾,-10.3657097832;搁,-12.9306591406;暂,-13.6238063212;舅,-9.8171438314;掄,-11.6778961721;陀,-12.0143684087;栉,-12.2375119601;锋,-7.72665245354;誊,-13.6238063212;垌,-12.9306591406;炎,-7.78899558411;少,-9.52946175895;朗,-6.331469145;洛,-7.07845666084;抚,-7.99618520748;丝,-8.15997451615;澜,-10.8512175989;袞,-7.86806410759;別,-9.56336331063;馨,-8.25316829305;媪,-11.3212212282;昭,-7.25390533834;振,-7.98189925023;醜,-9.8171438314;谱,-8.68216389856;鯉,-10.9847489916;亲,-8.25316829305;锟,-8.48800788412;銀,-6.89040442934;鴻,-6.94924492936;總,-7.383530476;墾,-11.5443647795;許,-8.81978527644;佇,-13.6238063212;览,-8.74860899797;畋,-9.75260531027;降,-9.37531107912;韌,-10.1898191167;协,-9.2293571665;郎,-7.24199030377;绒,-9.77365871946;婕,-7.18925980239;貴,-7.15146002667;臘,-8.52393989335;赛,-7.97483208301;獎,-10.6280740476;九,-8.49390760625;远,-6.74960782572;歟,-12.5251940325;近,-12.5251940325;酣,-12.9306591406;团,-9.20496571338;剥,-11.5443647795;古,-7.09877666333;镜,-8.81978527644;峦,-11.8320468519;姨,-8.28147206921;柬,-11.8320468519;药,-9.88613670289;騷,-12.2375119601;瘩,-12.5251940325;仲,-7.68100694605;说,-11.4265817438;瓶,-10.291601811;凸,-12.9306591406;勺,-9.29307298089;幽,-10.4457524908;翼,-7.89046504428;衔,-10.2565104912;极,-8.95097748671;昀,-9.8171438314;锬,-13.6238063212;轢,-13.6238063212;計,-9.31974122797;皋,-7.78899558411;同,-7.59072009937;猎,-9.93492686706;徑,-9.37531107912;珙,-10.7905929771;舂,-13.6238063212;馕,-12.9306591406;研,-9.96024467504;蒗,-12.9306591406;掙,-12.9306591406;战,-8.38205930611;些,-12.5251940325;愚,-7.2169263351;阗,-9.75260531027;谜,-11.5443647795;產,-9.96024467504;冥,-10.3657097832;弦,-8.66096169091;箩,-12.5251940325;暫,-13.6238063212;太,-6.76209498069;断,-10.8512175989;搬,-12.5251940325;悯,-11.8320468519;辱,-11.2259110484;丰,-7.66796895171;洲,-7.36422485711;爸,-13.6238063212;麻,-8.77177605725;綽,-9.69198068845;尼,-5.17703559405;萬,-7.7716038414;迅,-7.37383107891;渊,-7.27466732979;資,-10.291601811;诉,-12.5251940325;雋,-9.59845463044;楊,-6.97871535167;烏,-8.93245843894;华,-5.43012965522;駕,-8.95097748671;塔,-7.01445707801;杖,-10.7905929771;托,-7.34341048221;慚,-12.5251940325;汜,-9.77365871946;棟,-8.74860899797;埡,-12.2375119601;频,-9.79516492468;畢,-10.5792838834;燥,-9.88613670289;灤,-12.5251940325;糧,-9.86260620548;彦,-7.61009116513;審,-12.2375119601;奪,-9.75260531027;旭,-7.78899558411;俱,-11.1388996714;诩,-9.56336331063;櫳,-12.9306591406;瓷,-9.61647313594;靶,-13.6238063212;叹,-8.66096169091;鉸,-13.6238063212;镦,-12.5251940325;巽,-10.7334345633;鱼,-8.47051472668;签,-11.1388996714;驁,-10.291601811;斂,-11.4265817438;悄,-12.5251940325;來,-6.48097892001;阋,-12.9306591406;和,-7.61499313573;庐,-9.20496571338;娓,-12.5251940325;谧,-10.2226089395;夕,-10.0974457966;锘,-13.6238063212;折,-9.73198602306;丛,-8.75627187072;膚,-12.0143684087;贝,-7.81566383119;讞,-11.5443647795;濱,-9.21708707391;鈣,-13.6238063212;尧,-8.19008431762;鹰,-7.54846029008;鬩,-12.9306591406;骨,-8.56121128815;禪,-8.66797926357;蔭,-9.67256260259;漱,-12.2375119601;液,-10.2565104912;褵,-13.6238063212;钾,-12.2375119601;匹,-10.3657097832;帻,-12.2375119601;宾,-7.7516885317;耐,-10.2226089395;胄,-10.4049304963;汇,-8.48800788412;證,-7.62239144321;額,-9.52946175895;槊,-11.0588569637;镍,-12.2375119601;灏,-9.86260620548;車,-9.73198602306;网,-9.43415157915;巒,-11.8320468519;磔,-13.6238063212;著,-8.23473459136;頻,-9.79516492468;湛,-10.0684582597;滎,-11.2259110484;賜,-8.68933238804;翮,-11.3212212282;坡,-7.2625038436;因,-8.49984234177;闢,-13.6238063212;入,-7.62984489387;翦,-9.91023425447;孩,-10.8512175989;虫,-8.64019969946;阵,-7.40720022009;蕭,-9.8171438314;蓬,-9.31974122797;息,-6.87504677368;揮,-9.31974122797;仰,-9.2293571665;詳,-9.79516492468;極,-8.95097748671;裴,-11.5443647795;呷,-12.2375119601;矶,-10.679367342;勸,-9.46492323781;幻,-11.0588569637;出,-10.5792838834;醫,-8.58038120425;顿,-6.67586925256;最,-11.6778961721;悅,-8.14316739783;祗,-11.4265817438;檉,-12.9306591406;型,-8.77961923471;栊,-12.9306591406;钍,-13.6238063212;甌,-10.5327638678;熏,-10.5792838834;鼐,-7.31570787966;宓,-10.4049304963;閂,-13.6238063212;夔,-9.43415157915;斗,-8.55490211895;翘,-9.69198068845;供,-11.5443647795;琮,-9.512932457;貝,-7.81566383119;還,-11.8320468519;眠,-10.4049304963;駿,-7.97483208301;琢,-10.679367342;簇,-10.4883121052;嶧,-12.2375119601;带,-9.29307298089;笨,-12.9306591406;枫,-9.12399665084;堪,-8.64707257875;播,-10.5792838834;攬,-11.1388996714;鷯,-12.9306591406;估,-12.9306591406;殳,-13.6238063212;氲,-13.6238063212;鲂,-10.2565104912;喷,-11.4265817438;阶,-7.94022655383;犹,-10.5327638678;纵,-12.0143684087;雞,-10.1272987597;岽,-13.6238063212;虏,-10.2565104912;情,-8.96984597102;淇,-9.98622016145;韋,-8.08254277601;响,-10.1898191167;界,-8.32050141311;量,-8.43642051533;剎,-11.3212212282;廑,-11.5443647795;齐,-7.40720022009;寓,-12.0143684087;鄄,-12.2375119601;奔,-8.90530744988;旗,-6.9657952753;晖,-8.06312469016;拙,-10.8512175989;进,-7.15610759507;恚,-12.9306591406;离,-8.89641850246;詞,-9.26709749448;盡,-9.36112644413;靠,-11.4265817438;口,-7.65509876119;呢,-12.9306591406;煤,-10.0974457966;巧,-8.47051472668;嫩,-9.71178331574;敬,-7.64492055627;艮,-10.8512175989;佰,-10.9157561201;汲,-11.3212212282;棵,-11.4265817438;噶,-10.4049304963;獸,-8.6539930216;忻,-10.8512175989;簾,-11.1388996714;峽,-8.59336839978;姿,-10.3657097832;驾,-8.95097748671;驰,-9.11294681466;郁,-9.49667193613;范,-8.14316739783;撂,-11.8320468519;者,-7.3102582749;了,-12.5251940325;國,-5.9918898081;名,-8.77961923471;銎,-12.0143684087;徐,-8.47631184436;鬓,-11.2259110484;粒,-10.1580704184;堕,-12.9306591406;蔗,-12.9306591406;暖,-9.8171438314;莘,-11.3212212282;悚,-13.6238063212;鸛,-12.0143684087;語,-7.03350527298;垠,-10.9847489916;钢,-7.58117348749;篇,-11.4265817438;紧,-10.8512175989;度,-8.21663454971;護,-8.71853154273;末,-8.32548895462;搭,-11.0588569637;脯,-12.0143684087;芮,-10.4883121052;辰,-8.30079634203;榴,-12.5251940325;唷,-12.9306591406;嚶,-13.6238063212;刹,-11.3212212282;鼻,-8.84468282806;為,-6.25043201126;尽,-9.36112644413;嶼,-9.19298952233;间,-9.26709749448;晁,-10.7334345633;荃,-9.75260531027;浇,-11.6778961721;仆,-7.21198805346;苍,-10.679367342;鹂,-13.6238063212;闌,-11.6778961721;鹑,-13.6238063212;繹,-9.63482227461;峒,-12.9306591406;硕,-8.47051472668;委,-7.52124772656;敗,-9.38969981658;艙,-12.9306591406;佛,-7.73216210935;汝,-8.80352475557;飯,-10.9157561201;襟,-12.5251940325;櫞,-12.5251940325;卣,-12.5251940325;瓢,-12.5251940325;健,-7.05432490076;凤,-7.21857786314;穩,-9.83961668725;寨,-7.00373311464;辦,-9.79516492468;摭,-12.9306591406;旬,-12.0143684087;燼,-13.6238063212;乱,-12.9306591406;述,-9.16945902492;酥,-12.2375119601;長,-7.58593540125;零,-10.7905929771;特,-5.16360685128;司,-7.14683395828;彻,-8.96036722706;盾,-8.87021613007;籽,-12.2375119601;祿,-7.02666061929;潔,-7.44793905107;要,-12.9306591406;沃,-8.66797926357;謂,-9.38969981658;辅,-7.99618520748;鏗,-10.679367342;锭,-13.6238063212;娌,-13.6238063212;序,-9.49667193613;崎,-11.5443647795;冑,-10.4049304963;钓,-11.3212212282;飞,-6.1035717647;阔,-8.96984597102;趙,-8.03281934066;谘,-11.8320468519;会,-6.30063560323;舜,-8.96984597102;鑼,-11.6778961721;虚,-8.19885630369;皇,-6.92061820793;焦,-9.83961668725;閩,-10.5792838834;琨,-9.58075505334;训,-8.55490211895;溯,-10.9847489916;贮,-12.9306591406;醉,-6.84161426517;薇,-8.1515356475;茲,-6.99841395316;昴,-12.9306591406;尸,-9.41911370178;傻,-12.2375119601;强,-6.37601373941;皿,-12.2375119601;锾,-11.8320468519;槁,-13.6238063212;桀,-10.0128884085;賃,-12.9306591406;猊,-10.1580704184;俅,-11.0588569637;蹄,-11.5443647795;苇,-10.4457524908;藉,-12.2375119601;輦,-11.6778961721;穌,-7.61991925407;经,-8.08647205415;凑,-11.5443647795;赣,-11.2259110484;卒,-8.96036722706;埕,-12.2375119601;諗,-12.9306591406;襖,-12.5251940325;飘,-10.7905929771;佚,-10.3657097832;縻,-12.9306591406;蛟,-8.48800788412;敞,-11.0588569637;翥,-11.3212212282;馮,-8.87021613007;煦,-9.58075505334;闩,-13.6238063212;周,-6.76629225863;坪,-9.11294681466;语,-7.03350527298;浮,-9.8171438314;恰,-10.3657097832;柵,-10.0128884085;晴,-7.59072009937;奶,-9.29307298089;緹,-11.8320468519;鱸,-10.8512175989;椁,-8.99883350789;调,-9.8171438314;輅,-10.6280740476;麗,-6.58502277978;與,-11.0588569637;堋,-12.9306591406;验,-10.7905929771;邐,-11.2259110484;吓,-9.18115506468;隔,-10.2565104912;視,-9.88613670289;洙,-10.9157561201;怛,-12.9306591406;辚,-13.6238063212;謬,-12.2375119601;鹭,-9.77365871946;星,-6.01344870286;颠,-13.6238063212;祚,-8.45902034725;客,-6.74239501753;弥,-10.0684582597;纤,-10.9847489916;饰,-10.679367342;甩,-11.5443647795;璨,-12.9306591406;鏑,-12.0143684087;驕,-10.5792838834;檬,-12.5251940325;港,-8.03655766277;脱,-9.02868647104;莲,-6.63170989376;朵,-8.96036722706;暴,-10.4883121052;稷,-10.5327638678;紹,-7.36040805858;岸,-7.80372339082;耜,-9.83961668725;鬼,-8.98907733294;瘿,-12.5251940325;喾,-10.679367342;检,-10.4883121052;郜,-13.6238063212;毂,-13.6238063212;轅,-12.9306591406;艇,-10.4049304963;臆,-13.6238063212;蕉,-10.8512175989;鈕,-12.2375119601;灶,-10.9847489916;筍,-10.4457524908;嫌,-11.5443647795;鹏,-6.5353975425;兑,-10.9847489916;領,-7.40321615107;浙,-9.93492686706;讥,-12.5251940325;拜,-9.01863613518;晟,-8.50581250876;寢,-11.1388996714;彥,-7.61009116513;牧,-8.23473459136;燦,-8.40345049609;聃,-12.2375119601;哨,-10.5792838834;衫,-9.21708707391;賡,-10.1898191167;櫬,-12.0143684087;湯,-8.57395031392;淮,-8.29593015238;葳,-13.6238063212;緒,-9.37531107912;杵,-12.5251940325;更,-11.6778961721;婷,-7.96781451035;絹,-9.56336331063;狼,-8.90530744988;裔,-9.8171438314;梁,-7.19408684313;老,-7.42329714713;樂,-6.96323117133;跡,-10.4457524908;耆,-10.9847489916;昊,-8.87887419281;嬌,-9.11294681466;導,-8.96036722706;傑,-6.42114512465;間,-9.26709749448;划,-10.5327638678;溆,-12.9306591406;窯,-9.30631820764;栖,-9.16945902492;沙,-7.31570787966;饶,-9.79516492468;业,-7.10761324513;芝,-11.0588569637;茜,-10.2226089395;瞄,-11.6778961721;夠,-12.9306591406;庥,-10.4049304963;逦,-11.2259110484;璩,-10.9847489916;用,-7.97835942353;阪,-9.98622016145;炳,-6.16908637181;侯,-6.77156375212;雌,-13.6238063212;戲,-13.6238063212;朴,-8.74860899797;粹,-10.7905929771;冻,-12.5251940325;龄,-7.57407286594;瞿,-11.2259110484;吾,-8.12254811063;裁,-9.61647313594;睡,-10.4049304963;跃,-8.94167509405;仅,-11.8320468519;菇,-13.6238063212;恆,-7.64239210992;蓉,-7.989016718;效,-9.98622016145;始,-10.2565104912;筌,-10.6280740476;羡,-10.9847489916;僑,-11.4265817438;禹,-8.09041683245;牒,-10.4457524908;雕,-8.88760787278;诗,-7.89046504428;煥,-8.54240195619;钎,-13.6238063212;鐳,-12.5251940325;奠,-12.2375119601;緣,-8.00340545546;驢,-10.0128884085;绥,-10.3657097832;珧,-12.9306591406;哩,-10.4049304963;迦,-8.70382539534;諭,-9.01863613518;俯,-11.8320468519;轻,-10.1580704184;慰,-8.57395031392;色,-7.94022655383;篷,-13.6238063212;顶,-8.87887419281;击,-10.0974457966;幺,-12.2375119601;矿,-10.0684582597;瑾,-7.68891212555;清,-6.25168829284;澄,-8.6539930216;指,-10.0402873827;肆,-12.9306591406;蚊,-11.8320468519;完,-11.3212212282;式,-7.84306280538;們,-12.9306591406;锓,-12.9306591406;轂,-13.6238063212;阕,-13.6238063212;聯,-8.23473459136;袖,-10.1580704184;愛,-7.45002021727;亚,-5.89583077907;期,-8.84468282806;撞,-11.3212212282;堡,-7.14991562482;骢,-8.72596652122;帥,-6.90721154765;群,-7.18445595007;邦,-6.6089919699;靡,-11.0588569637;險,-12.0143684087;設,-9.48067159478;伯,-6.45831284611;臉,-9.54626887727;鲛,-11.3212212282;鷲,-12.2375119601;昵,-12.5251940325;缟,-11.5443647795;嬷,-9.404298616;尹,-8.50581250876;嶸,-9.83961668725;纺,-11.5443647795;爽,-8.72596652122;費,-9.56336331063;邹,-11.5443647795;觀,-7.35850510844;久,-8.08647205415;瑷,-13.6238063212;熠,-13.6238063212;葉,-6.95557807276;奋,-10.5327638678;韶,-9.06992942957;積,-8.6539930216;富,-7.19247523924;灑,-10.679367342;镓,-12.9306591406;勒,-6.07156903361;陕,-10.1898191167;埔,-11.2259110484;狸,-12.5251940325;贛,-11.2259110484;淘,-11.4265817438;滚,-11.6778961721;菜,-10.4883121052;束,-10.5792838834;卧,-10.291601811;烦,-10.1580704184;瑩,-9.14646950669;门,-7.01311027646;楫,-12.2375119601;盪,-10.291601811;潯,-12.5251940325;泮,-11.1388996714;违,-10.679367342;眺,-11.8320468519;柴,-11.8320468519;壶,-9.46492323781;屹,-9.16945902492;瑜,-7.51901308876;养,-9.37531107912;建,-7.17175736674;牽,-9.48067159478;脫,-9.02868647104;链,-10.3657097832;言,-7.27117692485;涅,-8.68216389856;肇,-9.73198602306;蜀,-10.0402873827;枉,-11.3212212282;爭,-8.16422080703;骋,-12.2375119601;妍,-8.24390896763;頌,-9.65351440762;缎,-10.7905929771;玑,-11.1388996714;爐,-9.98622016145;儒,-7.54846029008;眯,-10.4049304963;欖,-12.0143684087;辙,-10.5792838834;丘,-7.90677861977;膝,-10.9847489916;怜,-10.679367342;秦,-7.87123368235;审,-12.2375119601;稠,-10.0128884085;夢,-8.62659404741;尤,-9.79516492468;郦,-11.3212212282;錦,-8.1515356475;唪,-13.6238063212;榭,-11.3212212282;貯,-12.9306591406;莱,-7.06419108368;戰,-8.38205930611;饔,-12.9306591406;徹,-8.96036722706;常,-7.96432410541;銻,-13.6238063212;冽,-10.6280740476;值,-9.8171438314;钿,-9.86260620548;眾,-8.57395031392;毁,-10.9157561201;緡,-13.6238063212;仃,-13.6238063212;迂,-13.6238063212;籠,-10.7905929771;立,-6.51229420468;蕊,-8.99883350789;姍,-10.8512175989;題,-10.5792838834;彎,-11.5443647795;发,-7.39529531758;兒,-5.10361762078;痕,-10.1580704184;蹦,-12.9306591406;乘,-8.87021613007;招,-9.404298616;浚,-9.16945902492;蓟,-11.4265817438;杞,-12.9306591406;脚,-10.7334345633;廣,-7.67316376859;奢,-10.0684582597;工,-7.51901308876;層,-9.71178331574;僧,-6.2560977488;卦,-9.52946175895;矩,-8.96984597102;器,-7.88401340899;諫,-8.78752441422;畦,-12.0143684087;衬,-12.0143684087;泯,-12.9306591406;潮,-6.87270485224;菱,-7.59552780094;扰,-11.5443647795;螯,-12.9306591406;磷,-10.5792838834;翹,-9.69198068845;幸,-8.95097748671;勻,-11.6778961721;函,-10.0128884085;灼,-11.0588569637;铿,-10.679367342;謁,-11.3212212282;檀,-8.17276786761;七,-8.48214276467;概,-11.8320468519;贅,-12.9306591406;饭,-10.9157561201;釀,-12.0143684087;有,-8.45902034725;暈,-12.0143684087;程,-7.45419558868;薊,-11.4265817438;复,-7.41521629508;小,-8.66096169091;美,-7.20218405337;冒,-13.6238063212;髯,-11.4265817438;栗,-8.91427611986;伙,-10.679367342;饮,-10.8512175989;肜,-13.6238063212;颉,-10.4457524908;嬡,-13.6238063212;骠,-11.4265817438;縣,-7.43349091532;瀚,-8.95097748671;粤,-9.98622016145;厦,-10.7905929771;眩,-13.6238063212;隨,-9.52946175895;菏,-13.6238063212;澮,-13.6238063212;憲,-8.11037757501;砷,-11.4265817438;家,-7.34341048221;弹,-9.41911370178;鏵,-12.2375119601;刻,-10.291601811;嶺,-6.86920222168;炼,-9.404298616;琿,-11.1388996714;鉴,-8.39269770432;乃,-8.08647205415;观,-7.35850510844;浅,-10.0684582597;锵,-12.0143684087;揆,-9.93492686706;杉,-7.93344686685;鉍,-13.6238063212;屏,-8.62659404741;翎,-9.63482227461;卑,-10.9847489916;勐,-11.5443647795;鑰,-10.8512175989;街,-8.78752441422;余,-9.29307298089;付,-10.4049304963;淚,-11.8320468519;餘,-9.29307298089;惜,-9.67256260259;靨,-13.6238063212;章,-5.83600944299;幣,-11.1388996714;麦,-7.03076178703;顼,-10.0684582597;峤,-8.47631184436;酆,-13.6238063212;另,-11.4265817438;革,-8.61317102708;雨,-6.95177337571;橫,-8.38736435834;闪,-9.54626887727;業,-7.10761324513;赓,-10.1898191167;修,-7.36613873329;諒,-8.76399391681;敵,-10.0128884085;擴,-6.86687393193;顷,-11.3212212282;寶,-5.93443521364;役,-9.93492686706;绸,-11.6778961721;鉻,-11.8320468519;鐵,-7.9133793038;兽,-8.6539930216;鑿,-11.5443647795;檁,-13.6238063212;謀,-8.38205930611;侃,-9.56336331063;沅,-10.0974457966;葩,-12.5251940325;暉,-8.06312469016;月,-8.051652289;宋,-7.33594776101;萊,-7.06419108368;颍,-10.4049304963;隶,-9.58075505334;綏,-10.3657097832;蔬,-12.0143684087;劑,-10.9157561201;錐,-11.6778961721;酒,-9.14646950669;递,-10.1580704184;钕,-12.5251940325;优,-9.63482227461;掛,-11.1388996714;悝,-9.8171438314;斟,-12.0143684087;笠,-10.9157561201;铁,-7.9133793038;鈦,-12.2375119601;在,-9.37531107912;琪,-7.56702230794;梭,-8.90530744988;讳,-10.7334345633;涯,-11.3212212282;抱,-9.86260620548;焉,-9.73198602306;鰲,-9.21708707391;趲,-13.6238063212;邈,-9.41911370178;纹,-8.31553862377;缸,-11.4265817438;去,-10.1580704184;尺,-8.11441798454;炽,-10.4883121052;體,-7.42940093007;促,-12.9306591406;桂,-6.07630463836;薷,-12.9306591406;燠,-12.9306591406;曉,-7.85548532538;摊,-11.2259110484;颯,-12.9306591406;芹,-8.85312169671;韓,-8.00703522351;畔,-10.3657097832;鈐,-10.679367342;茸,-12.5251940325;仙,-7.02529729256;潘,-8.96984597102;換,-10.4457524908;虞,-8.99883350789;铀,-12.9306591406;筠,-9.34714020216;峥,-9.96024467504;釧,-10.5327638678;鉦,-12.2375119601;跞,-13.6238063212;貽,-12.5251940325;毫,-11.2259110484;瑪,-6.69428955041;路,-7.35660577263;拱,-11.2259110484;柳,-8.53620998594;聲,-7.07989447561;整,-10.7905929771;究,-12.9306591406;都,-8.44202277088;兼,-9.79516492468;百,-9.02868647104;樁,-11.6778961721;讀,-11.6778961721;绪,-9.37531107912;谅,-8.76399391681;螈,-12.2375119601;笋,-10.4457524908;魑,-13.6238063212;阿,-8.04785721803;芊,-12.0143684087;圓,-7.99259453935;炒,-11.8320468519;吕,-8.58038120425;閔,-9.48067159478;级,-9.91023425447;丙,-10.3279694552;郅,-11.2259110484;思,-6.1008654031;琛,-9.13516995144;宠,-9.71178331574;颢,-9.41911370178;鄧,-8.40345049609;銦,-13.6238063212;嘩,-11.5443647795;謫,-12.9306591406;咪,-12.9306591406;結,-8.82801577558;亮,-6.15187424293;舱,-12.9306591406;悲,-13.6238063212;舟,-8.89641850246;夷,-8.03655766277;医,-8.58038120425;难,-9.46492323781;酋,-12.0143684087;毀,-10.9157561201;佃,-11.1388996714;棂,-12.2375119601;荷,-8.63337373439;拆,-12.0143684087;晉,-7.58832488865;铍,-12.9306591406;筋,-11.8320468519;擊,-10.0974457966;塍,-12.5251940325;绎,-9.63482227461;剑,-6.94798309954;靓,-10.6280740476;論,-8.95097748671;乙,-9.02868647104;还,-11.8320468519;賚,-12.0143684087;穡,-13.6238063212;滑,-11.3212212282;履,-8.28626824147;內,-8.43642051533;险,-12.0143684087;哪,-13.6238063212;浯,-13.6238063212;艱,-12.5251940325;杳,-12.9306591406;惲,-11.6778961721;競,-9.91023425447;幹,-8.37678224901;裕,-7.58117348749;獻,-8.67504643079;偽,-10.9847489916;凼,-12.5251940325;畿,-10.0974457966;图,-6.95939730082;趁,-10.4049304963;阴,-8.96984597102;漂,-10.7334345633;暇,-11.5443647795;舀,-11.8320468519;韩,-8.00703522351;铲,-12.5251940325;鲋,-11.1388996714;龍,-5.63322943943;希,-7.25905556432;骏,-7.97483208301;礎,-10.1272987597;疑,-9.59845463044;吐,-10.8512175989;邓,-8.40345049609;園,-7.11206099153;鈔,-9.00868580433;禮,-6.85072594552;枝,-8.32548895462;抟,-10.9847489916;萄,-11.8320468519;由,-10.7905929771;碣,-10.0128884085;聚,-9.2417796865;宥,-12.9306591406;钰,-9.83961668725;貫,-6.71006897051;匪,-12.9306591406;辭,-9.09120682802;測,-9.01863613518;赜,-11.8320468519;閏,-9.71178331574;戴,-10.1580704184;康,-6.46218431823;縈,-12.2375119601;妹,-7.90022121922;钻,-10.291601811;笺,-10.2565104912;势,-9.21708707391;紊,-13.6238063212;毅,-7.02121842898;縷,-10.9157561201;蛇,-9.46492323781;蝠,-12.9306591406;應,-8.88760787278;酿,-12.0143684087;峋,-13.6238063212;荊,-10.1580704184;忍,-9.56336331063;奎,-7.75450940804;呐,-12.0143684087;青,-6.07630463836;仗,-10.3657097832;赖,-9.93492686706;譚,-9.37531107912;虜,-10.2565104912;苟,-11.0588569637;巡,-9.404298616;屠,-10.0684582597;形,-9.83961668725;驤,-9.49667193613;盧,-8.10635342471;啦,-11.5443647795;釩,-11.6778961721;鞋,-10.291601811;若,-7.46471093268;俭,-7.93344686685;纓,-9.65351440762;旱,-11.8320468519;想,-8.84468282806;杲,-8.09041683245;鈿,-9.86260620548;廷,-7.15921801748;賴,-9.93492686706;矽,-12.2375119601;發,-7.39529531758;勿,-10.9847489916;谔,-9.61647313594;洁,-7.44793905107;赁,-12.9306591406;辂,-10.6280740476;蘇,-7.89046504428;脉,-8.61317102708;铭,-7.30303802692;尋,-9.09120682802;莊,-6.35349343509;續,-9.34714020216;騏,-12.5251940325;禎,-7.989016718;甑,-12.9306591406;璐,-9.49667193613;垒,-9.77365871946;錕,-8.48800788412;渗,-10.8512175989;騁,-12.2375119601;朝,-6.77368015503;戟,-9.30631820764;紡,-11.5443647795;鬥,-8.55490211895;骤,-10.4049304963;嘧,-13.6238063212;轰,-10.9157561201;储,-10.9157561201;氫,-10.6280740476;翻,-10.3657097832;京,-7.20707403866;樯,-12.2375119601;榮,-6.52213034955;撰,-10.8512175989;耳,-7.41120022542;轔,-13.6238063212;茵,-9.88613670289;帷,-12.5251940325;夹,-11.0588569637;吻,-13.6238063212;霽,-10.4049304963;隼,-12.0143684087;爿,-12.5251940325;熾,-10.4883121052;流,-8.11847478524;賀,-8.76399391681;桃,-9.01863613518;濂,-9.93492686706;旆,-12.9306591406;轍,-10.5792838834;屋,-10.6280740476;菊,-8.48214276467;軌,-10.1272987597;镑,-13.6238063212;道,-6.59826800653;埒,-12.9306591406;单,-9.49667193613;訓,-8.55490211895;淖,-10.9847489916;棘,-11.4265817438;葛,-8.61317102708;诚,-6.36187922847;曜,-9.0805115389;絡,-11.3212212282;糠,-12.2375119601;遺,-10.9157561201;孥,-13.6238063212;兩,-12.5251940325;烨,-9.21708707391;豫,-8.78752441422;只,-9.75260531027;潭,-9.30631820764;们,-12.9306591406;擰,-13.6238063212;聳,-10.9157561201;蟲,-8.64019969946;拴,-9.61647313594;限,-10.679367342;鐮,-11.8320468519;寺,-6.8048822559;盼,-9.41911370178;燾,-8.73345719295;沁,-9.05945812971;阁,-6.49691551227;覃,-12.2375119601;輔,-7.99618520748;欄,-10.0974457966;雾,-9.8171438314;悉,-10.7905929771;愈,-9.25435846871;戊,-10.9157561201;缌,-13.6238063212;宏,-7.87441333526;唐,-7.47320355273;蒂,-7.31570787966;钯,-12.9306591406;侗,-10.4049304963;裘,-10.2226089395;斛,-10.9157561201;濃,-10.9847489916;蜜,-9.404298616;岡,-12.5251940325;素,-6.75271502656;鸢,-13.6238063212;窥,-12.0143684087;嬤,-9.404298616;瞧,-12.5251940325;否,-10.679367342;涫,-12.9306591406;刪,-12.5251940325;亭,-6.3954178696;讯,-9.61647313594;褲,-12.2375119601;牟,-10.4457524908;德,-4.95853801169;夸,-10.9847489916;喻,-9.77365871946;隽,-9.59845463044;看,-10.9157561201;县,-7.43349091532;倾,-12.2375119601;況,-10.4457524908;鵡,-11.5443647795;炷,-11.1388996714;葆,-12.0143684087;慈,-8.28626824147;绍,-7.36040805858;彌,-10.0684582597;硎,-12.9306591406;镐,-9.88613670289;動,-8.87887419281;協,-9.2293571665;俗,-10.7905929771;裙,-10.4883121052;曝,-12.9306591406;杜,-8.39805964746;聞,-7.49040827818;峡,-8.59336839978;鵠,-10.9157561201;秣,-12.0143684087;幢,-12.5251940325;琐,-11.4265817438;孤,-9.79516492468;韧,-10.1898191167;辐,-13.6238063212;烩,-13.6238063212;全,-7.16546803783;淫,-12.9306591406;剪,-12.0143684087;佬,-12.2375119601;误,-10.679367342;衮,-7.86806410759;擱,-12.9306591406;数,-8.79549258387;至,-8.02909494157;貿,-12.9306591406;部,-8.29593015238;壹,-11.4265817438;闻,-7.49040827818;空,-7.29944735879;国,-5.9918898081;灾,-12.2375119601;谁,-12.9306591406;亂,-12.9306591406;殄,-12.5251940325;鉀,-12.2375119601;紋,-8.31553862377;把,-13.6238063212;後,-10.9157561201;笏,-12.5251940325;滬,-8.87887419281;向,-10.0974457966;焓,-11.6778961721;躲,-11.4265817438;醒,-9.36112644413;众,-8.57395031392;誚,-12.9306591406;果,-8.1515356475;簡,-8.87021613007;嶠,-8.47631184436;红,-6.71805304486;娥,-12.0143684087;室,-8.73345719295;钩,-10.5792838834;璦,-13.6238063212;倩,-8.68933238804;荆,-10.1580704184;努,-8.60652648436;中,-6.47153746514;侬,-10.3279694552;鋅,-9.2293571665;新,-7.10465903323;舵,-12.2375119601;強,-6.37601373941;蹈,-12.2375119601;頹,-11.5443647795;鍵,-8.6539930216;画,-9.8171438314;窺,-12.0143684087;匿,-10.9157561201;傾,-12.2375119601;汁,-9.37531107912;评,-10.0974457966;蝇,-10.3279694552;鞠,-11.6778961721;重,-8.48800788412;嵋,-12.2375119601;忌,-10.3657097832;筏,-13.6238063212;灌,-9.56336331063;鑑,-8.39269770432;闐,-9.75260531027;叔,-6.27586249802;佗,-9.28000089932;敛,-11.4265817438;蝎,-10.9157561201;晝,-10.0402873827;柜,-9.38969981658;损,-10.0402873827;绢,-9.56336331063;驥,-8.98907733294;篤,-10.3657097832;爛,-11.6778961721;瓦,-7.47107362647;適,-8.95097748671;默,-8.22564361966;繒,-13.6238063212;约,-8.81978527644;譯,-8.68216389856;森,-6.00801524914;葱,-10.1580704184;腳,-10.7334345633;曲,-8.31060034213;鷗,-9.8171438314;援,-10.1898191167;罷,-10.1272987597;島,-7.12401928052;迁,-7.67056298689;竺,-9.34714020216;白,-6.75064248696;卿,-6.62529667892;郾,-12.5251940325;一,-7.40321615107;莉,-6.99444306774;戈,-8.13074487783;脊,-10.1272987597;风,-6.48811897414;閬,-12.9306591406;鄂,-8.24852791349;阐,-10.7334345633;銓,-9.2417796865;冕,-10.1898191167;途,-10.2226089395;细,-10.1898191167;猪,-10.3657097832;褚,-9.88613670289;悟,-11.0588569637;謄,-13.6238063212;御,-8.71853154273;崢,-9.96024467504;妥,-11.4265817438;堤,-9.28000089932;钧,-6.38387372985;玩,-11.2259110484;爨,-12.5251940325;享,-10.7334345633;優,-9.63482227461;谬,-12.2375119601;梯,-9.8171438314;肉,-10.9157561201;芳,-6.0050639435;岷,-9.8171438314;脈,-8.61317102708;容,-7.14683395828;夺,-9.75260531027;吼,-10.9847489916;释,-9.404298616;錾,-11.8320468519;俁,-11.3212212282;櫃,-9.38969981658;舊,-9.79516492468;觅,-11.5443647795;男,-8.31553862377;擇,-10.679367342;杆,-11.0588569637;揉,-10.7334345633;扈,-11.6778961721;慊,-13.6238063212;巍,-7.93007418237;籌,-8.29108752791;爹,-8.15997451615;镒,-10.9847489916;燕,-6.95177337571;箏,-11.8320468519;泗,-9.75260531027;藥,-9.88613670289;楚,-7.7831646638;藝,-7.95737963306;惟,-9.44941905128;瑤,-5.963692002;钜,-12.5251940325;竣,-11.5443647795;邺,-8.47051472668;姥,-8.33050149645;硤,-12.5251940325;铧,-12.2375119601;坦,-7.26077821763;叩,-13.6238063212;簽,-11.1388996714;軫,-10.1272987597;警,-12.5251940325;豬,-10.3657097832;靈,-6.75375290937;柱,-6.72610137804;晰,-12.2375119601;拳,-9.67256260259;蕲,-13.6238063212;懵,-12.2375119601;对,-12.9306591406;電,-10.5792838834;祺,-8.89641850246;闽,-10.5792838834;呼,-9.83961668725;鍾,-11.8320468519;企,-9.25435846871;萦,-12.2375119601;涂,-10.9847489916;椅,-11.2259110484;澗,-9.21708707391;萇,-10.1580704184;按,-10.679367342;燭,-9.88613670289;谖,-12.0143684087;崍,-13.6238063212;鄰,-8.68933238804;隐,-7.23188920778;珈,-13.6238063212;閒,-9.96024467504;焕,-8.54240195619;璽,-8.83631457839;謙,-6.89040442934;薛,-10.2565104912;莞,-12.0143684087;缡,-13.6238063212;庠,-11.0588569637;娣,-10.7905929771;綢,-11.6778961721;夥,-10.679367342;吧,-12.0143684087;垦,-11.5443647795;猩,-12.5251940325;动,-8.87887419281;丫,-10.7334345633;冪,-12.2375119601;绳,-9.96024467504;议,-8.88760787278;朱,-7.93683096483;肴,-12.9306591406;簷,-11.8320468519;诈,-11.3212212282;践,-10.4883121052;嘻,-10.291601811;禺,-9.88613670289;钼,-11.4265817438;籴,-12.2375119601;潁,-10.4049304963;什,-8.58685371876;棄,-9.88613670289;摇,-8.8116219658;蟆,-9.93492686706;草,-7.73216210935;苈,-13.6238063212;销,-12.2375119601;鳌,-9.21708707391;顏,-7.73216210935;坑,-12.0143684087;盐,-9.49667193613;兕,-13.6238063212;汗,-7.00506733766;陸,-8.02909494157;歙,-12.2375119601;骥,-8.98907733294;虛,-8.19885630369;餌,-11.2259110484;罡,-9.71178331574;廠,-10.1580704184;巢,-8.93245843894;奥,-7.74607053939;费,-9.56336331063;砰,-12.9306591406;运,-8.29593015238;阆,-12.9306591406;湫,-11.6778961721;琦,-7.97483208301;诮,-12.9306591406;東,-5.25836668498;曰,-10.1898191167;艳,-7.95737963306;贄,-9.96024467504;筹,-8.29108752791;登,-7.61745316157;轾,-13.6238063212;铼,-12.9306591406;灿,-8.40345049609;現,-9.48067159478;锺,-11.8320468519;爪,-10.1898191167;梅,-5.40474966011;文,-5.55822689389;昆,-8.14734276924;舒,-7.88401340899;律,-7.66538162814;鲍,-12.0143684087;贽,-9.96024467504;福,-6.413726693;騎,-9.404298616;吒,-12.0143684087;邕,-9.15789820252;儔,-12.5251940325;世,-6.62621033819;攜,-12.0143684087;舞,-9.12399665084;纡,-12.9306591406;张,-7.57171715225;宣,-7.80372339082;队,-10.2226089395;夤,-11.5443647795;喧,-11.6778961721;锰,-11.2259110484;助,-9.43415157915;倪,-11.0588569637;沭,-12.2375119601;熳,-13.6238063212;暱,-12.5251940325;載,-9.16945902492;莳,-13.6238063212;防,-9.65351440762;嶷,-10.2565104912;帶,-9.29307298089;瞻,-10.0684582597;砺,-11.1388996714;咽,-12.0143684087;骚,-12.2375119601;爾,-4.43775864177;仁,-6.30394139136;诃,-10.3279694552;求,-8.96036722706;装,-10.679367342;襄,-8.2032713219;鳥,-9.0805115389;拉,-6.20083507012;嵌,-11.1388996714;穎,-8.49984234177;监,-6.7758010466;坐,-10.1272987597;鉑,-10.1580704184;铢,-13.6238063212;僕,-7.21198805346;兔,-10.0684582597;乖,-12.0143684087;識,-9.73198602306;蓝,-8.61986001523;閻,-13.6238063212;臟,-12.2375119601;绡,-12.2375119601;齠,-12.5251940325;鍔,-9.58075505334;獨,-10.2565104912;眼,-9.8171438314;杰,-6.42114512465;巷,-9.88613670289;并,-12.9306591406;竹,-7.55076178707;學,-7.50570912313;韻,-8.82801577558;瀾,-10.8512175989;啼,-12.5251940325;凿,-11.5443647795;丁,-6.73116468;賁,-10.0974457966;沂,-11.6778961721;栅,-10.0128884085;榄,-12.0143684087;霈,-12.9306591406;舉,-8.11847478524;授,-9.43415157915;弋,-10.8512175989;莖,-9.29307298089;對,-12.9306591406;夏,-7.24199030377;阑,-11.6778961721;蠡,-9.63482227461;瀕,-10.5792838834;熔,-12.0143684087;洗,-9.96024467504;準,-8.64707257875;標,-7.8216879458;望,-7.20055935764;鋮,-7.30303802692;萝,-11.4265817438;薜,-12.0143684087;感,-9.67256260259;需,-11.8320468519;鸡,-10.1272987597;岢,-12.5251940325;砥,-12.2375119601;妤,-10.9157561201;利,-5.87018277461;伫,-13.6238063212;身,-9.37531107912;谭,-9.37531107912;昱,-9.44941905128;枰,-12.5251940325;蒲,-10.291601811;谟,-8.80352475557;纶,-9.10201774412;稹,-9.512932457;宸,-5.72316970815;圻,-10.291601811;確,-10.5792838834;钒,-11.6778961721;跋,-7.58832488865;儿,-5.10361762078;劾,-11.3212212282;激,-10.9847489916;桅,-12.9306591406;规,-8.8116219658;軍,-4.83979724999;齋,-6.62804016487;惊,-9.06992942957;屍,-9.41911370178;奏,-8.39805964746;頂,-8.87887419281;卓,-7.80967578935;瓒,-9.00868580433;稱,-10.3657097832;诏,-9.05945812971;麼,-9.96024467504;橙,-10.7905929771;棚,-10.1898191167;藜,-12.9306591406;苞,-9.86260620548;幡,-12.0143684087;忠,-5.72613817045;季,-8.48800788412;鳴,-7.65765958205;顥,-9.41911370178;逑,-12.9306591406;剩,-13.6238063212;鏨,-11.8320468519;讦,-13.6238063212;襯,-12.0143684087;諮,-11.8320468519;缩,-10.9157561201;致,-9.77365871946;延,-6.41891381097;驹,-9.83961668725;藩,-7.55769823107;壺,-9.46492323781;命,-7.9133793038;闼,-11.3212212282;睐,-12.5251940325;勾,-10.291601811;退,-13.6238063212;璃,-11.4265817438;瞅,-9.75260531027;祠,-8.83631457839;鶉,-13.6238063212;專,-9.56336331063;範,-8.14316739783;舌,-11.6778961721;炬,-11.8320468519;貓,-9.49667193613;欒,-12.9306591406;辕,-12.9306591406;且,-11.0588569637;焖,-12.9306591406;羅,-6.18072794682;宝,-5.93443521364;娜,-6.35628089334;麟,-7.32485707432;龀,-11.6778961721;怠,-12.5251940325;枥,-12.2375119601;谨,-9.512932457;炫,-10.0684582597;伪,-10.9847489916;厭,-13.6238063212;键,-8.6539930216;堰,-9.63482227461;岳,-6.8892146612;贵,-7.15146002667;徵,-6.7485742339;鏟,-12.5251940325;芷,-10.679367342;方,-6.75687303671;萸,-12.2375119601;机,-7.93683096483;讽,-12.9306591406;亿,-11.2259110484;派,-7.48607926709;燁,-9.21708707391;詹,-11.6778961721;铃,-9.00868580433;附,-12.9306591406;竇,-9.8171438314;赠,-11.3212212282;屈,-11.6778961721;齊,-7.40720022009;觑,-13.6238063212;桐,-8.32548895462;泓,-9.88613670289;濕,-10.5327638678;乔,-7.13156648615;勗,-10.2226089395;兖,-13.6238063212;员,-9.83961668725;飛,-6.1035717647;坚,-7.25219447394;寝,-11.1388996714;廟,-7.88401340899;膑,-9.69198068845;换,-10.4457524908;查,-9.00868580433;晤,-11.5443647795;櫧,-12.9306591406;楦,-13.6238063212;班,-8.43642051533;鉬,-11.4265817438;雯,-8.79549258387;駱,-12.5251940325;鳳,-7.21857786314;念,-8.82801577558;年,-7.38743673097;慶,-6.23981686319;藹,-8.85312169671;摸,-10.7334345633;腊,-8.52393989335;橼,-12.5251940325;仿,-11.5443647795;鬢,-11.2259110484;炀,-13.6238063212;吃,-11.3212212282;厂,-10.1580704184;雛,-10.3279694552;的,-9.512932457;娇,-9.11294681466;妆,-11.6778961721;鲈,-10.8512175989;羊,-7.9713171409;昏,-13.6238063212;转,-8.30079634203;骘,-11.8320468519;輪,-10.7334345633;氓,-11.6778961721;臂,-10.9847489916;輕,-10.1580704184;五,-8.61986001523;列,-8.56121128815;锷,-9.58075505334;错,-8.83631457839;骜,-10.291601811;鸟,-9.0805115389;悠,-11.3212212282;探,-10.1272987597;镰,-11.8320468519;贩,-13.6238063212;貨,-10.6280740476;倫,-6.54884312321;识,-9.73198602306;劬,-13.6238063212;嘯,-9.73198602306;單,-9.49667193613;礱,-12.5251940325;碰,-12.0143684087;癲,-9.43415157915;張,-7.57171715225;户,-10.291601811;憶,-7.78899558411;改,-9.41911370178;蒸,-10.9157561201;蠻,-9.21708707391;螺,-10.1580704184;欽,-7.35471003747;誼,-6.92430598101;允,-8.51181853282;参,-8.86163238638;雄,-6.49691551227;迟,-8.28147206921;姆,-6.66726087802;配,-10.291601811;恋,-9.93492686706;翊,-9.71178331574;苌,-10.1580704184;晏,-8.99883350789;诒,-10.4457524908;何,-8.11847478524;仔,-8.56121128815;鉗,-11.6778961721;留,-8.4197996341;進,-7.15610759507;顛,-13.6238063212;埚,-12.9306591406;孝,-7.37769955569;幟,-11.1388996714;州,-5.95571261209;惠,-8.05928591385;董,-9.77365871946;来,-6.48097892001;蛤,-11.8320468519;触,-11.6778961721;浩,-7.73492836284;注,-8.76399391681;火,-8.71853154273;俪,-12.2375119601;災,-12.2375119601;问,-8.47051472668;饱,-12.0143684087;声,-7.07989447561;米,-7.53703159426;秒,-10.7905929771;酉,-11.8320468519;维,-6.25736117285;艷,-7.95737963306;濁,-11.1388996714;譽,-9.01863613518;諼,-12.0143684087;湿,-10.5327638678;邁,-9.30631820764;儀,-6.78647350649;喃,-13.6238063212;隅,-12.9306591406;霄,-8.09041683245;宇,-6.46373711358;堆,-9.36112644413;粉,-8.97941542203;涓,-12.9306591406;井,-8.59336839978;演,-9.98622016145;逖,-10.0974457966;钙,-13.6238063212;甘,-9.25435846871;骝,-12.5251940325;龟,-9.69198068845;股,-7.25905556432;邢,-10.9847489916;闕,-9.10201774412;震,-6.48176974647;販,-13.6238063212;质,-8.35594816211;谣,-11.2259110484;豪,-8.16848520582;劭,-10.3279694552;吮,-12.9306591406;选,-9.02868647104;靚,-10.6280740476;娲,-12.5251940325;庵,-7.93007418237;获,-9.71178331574;耶,-7.74327333477;濞,-10.2565104912;便,-8.08254277601;锻,-12.2375119601;烁,-12.0143684087;兀,-10.2226089395;剂,-10.9157561201;盅,-12.0143684087;靄,-10.0128884085;寇,-10.3279694552;懋,-10.0128884085;鹊,-9.48067159478;拍,-10.6280740476;捌,-12.9306591406;柏,-7.76873439897;羌,-9.11294681466;號,-9.46492323781;詒,-10.4457524908;仕,-8.94167509405;佔,-9.37531107912;受,-11.2259110484;哙,-10.7905929771;照,-8.23931125838;駛,-12.5251940325;邻,-8.68933238804;翟,-10.3279694552;属,-8.88760787278;惡,-10.3279694552;缺,-10.9847489916;桦,-9.77365871946;鉛,-11.3212212282;鍬,-13.6238063212;矯,-10.7334345633;罩,-11.4265817438;巳,-11.1388996714;绵,-9.61647313594;恶,-10.3279694552;翁,-8.36111613227;數,-8.79549258387;智,-6.73218042412;諧,-10.4049304963;送,-10.1898191167;冀,-9.8171438314;阅,-10.3279694552;垄,-12.2375119601;血,-10.6280740476;尉,-7.08133436067;魔,-9.75260531027;戍,-11.4265817438;掌,-9.33334688002;树,-7.25905556432;般,-12.2375119601;魂,-10.8512175989;丕,-8.77177605725;侔,-8.53620998594;北,-7.67838571257;鐙,-12.9306591406;翅,-10.7905929771;铨,-9.2417796865;宜,-8.71853154273;弟,-7.21527753011;怡,-8.83631457839;蔣,-8.21216026932;抢,-9.88613670289;春,-6.02942507862;鋇,-11.1388996714;欧,-8.87021613007;梦,-8.62659404741;涨,-10.2226089395;溪,-7.13917108554;刭,-13.6238063212;鎬,-9.88613670289;圯,-10.5792838834;钮,-12.2375119601;報,-9.43415157915;樽,-12.9306591406;殼,-9.71178331574;漿,-12.2375119601;沾,-10.4457524908;遁,-12.0143684087;净,-9.33334688002;狂,-11.5443647795;际,-11.0588569637;筇,-13.6238063212;綠,-7.82774857041;见,-7.12703133099;词,-9.26709749448;態,-10.4883121052;廊,-9.73198602306;才,-6.1003250086;菌,-9.86260620548;杏,-8.09437723366;擎,-8.11037757501;桑,-7.89046504428;槐,-9.09120682802;浓,-10.9847489916;溢,-9.93492686706;返,-11.4265817438;南,-6.56504816865;僖,-12.0143684087;雉,-11.0588569637;迭,-9.75260531027;鄉,-9.09120682802;认,-11.3212212282;萍,-6.84274869524;金,-6.47310486358;散,-9.00868580433;拢,-11.6778961721;霧,-9.8171438314;歧,-9.93492686706;遐,-12.0143684087;淨,-9.33334688002;八,-10.1580704184;仪,-6.78647350649;召,-8.51786084727;铮,-12.0143684087;称,-10.3657097832;絳,-11.0588569637;獒,-11.0588569637;捷,-8.03281934066;摹,-11.6778961721;秋,-6.68164961547;贫,-11.8320468519;使,-8.13900938768;賾,-11.8320468519;刀,-9.25435846871;鹩,-12.9306591406;儂,-10.3279694552;各,-9.02868647104;颇,-11.2259110484;师,-6.33419579972;祖,-6.66251027526;而,-9.86260620548;訐,-13.6238063212;椒,-10.291601811;涕,-13.6238063212;气,-9.65351440762;邗,-12.2375119601;化,-7.43759769727;媛,-9.36112644413;甚,-9.86260620548;妝,-11.6778961721;砜,-12.2375119601;粟,-9.77365871946;锄,-12.5251940325;採,-9.41911370178;蚣,-12.5251940325;薰,-10.3279694552;辩,-9.54626887727;劫,-9.93492686706;洪,-6.40489661355;倬,-11.6778961721;咯,-13.6238063212;騰,-8.31553862377;纳,-6.08477926535;茶,-7.73492836284;蘸,-12.9306591406;蔺,-11.6778961721;覽,-8.74860899797;格,-6.54377982125;沿,-10.1580704184;漾,-10.4049304963;叁,-13.6238063212;剀,-9.38969981658;病,-8.74860899797;鑄,-8.88760787278;壇,-9.43415157915;筆,-10.8512175989;駁,-10.9847489916;懍,-12.5251940325;职,-10.4883121052;李,-7.16546803783;译,-8.68216389856;詐,-11.3212212282;仓,-7.02121842898;疏,-9.52946175895;郗,-13.6238063212;韙,-12.9306591406;阎,-13.6238063212;姝,-11.5443647795;瘤,-11.5443647795;鹤,-7.73216210935;菡,-10.1898191167;蟬,-10.0402873827;慢,-10.9157561201;日,-8.70382539534;棧,-10.4457524908;武,-5.74678842555;迩,-12.0143684087;浪,-8.96036722706;凭,-10.4883121052;瓯,-10.5327638678;穰,-12.0143684087;廳,-9.38969981658;頒,-11.3212212282;猿,-9.10201774412;櫻,-10.6280740476;槽,-10.0974457966;純,-7.27292060446;錁,-12.5251940325;犀,-10.1898191167;锅,-13.6238063212;纈,-10.0128884085;磐,-10.1272987597;悌,-10.9847489916;搏,-10.9157561201;檐,-11.8320468519;专,-9.56336331063;绂,-12.0143684087;沔,-11.5443647795;逗,-11.1388996714;玖,-10.9157561201;娛,-11.3212212282;喚,-7.27117692485;颜,-7.73216210935;從,-11.2259110484;鵝,-12.0143684087;蔥,-10.1580704184;撤,-10.7905929771;聰,-8.56121128815;亨,-7.90677861977;别,-9.56336331063;鄭,-8.82801577558;催,-13.6238063212;启,-7.65509876119;鬱,-9.49667193613;順,-6.0632051584;龐,-10.4883121052;妲,-12.2375119601;踐,-10.4883121052;響,-10.1898191167;耷,-10.4457524908;莶,-13.6238063212;興,-6.89517770809;鸞,-9.12399665084;椽,-12.5251940325;补,-10.679367342;达,-5.76942511052;十,-10.679367342;狀,-8.51181853282;畅,-9.96024467504;哄,-11.1388996714;密,-7.05152377848;廈,-10.7905929771;手,-10.0402873827;緊,-10.8512175989;背,-9.38969981658;鞭,-9.58075505334;鷹,-7.54846029008;角,-9.48067159478;隆,-6.18248593146;魏,-6.97482177115;遗,-10.9157561201;取,-8.90530744988;静,-7.02939286142;盘,-8.28626824147;嗚,-11.5443647795;祝,-9.75260531027;籟,-12.0143684087;锤,-8.89641850246;荡,-10.291601811;苠,-13.6238063212;苔,-9.61647313594;桧,-8.89641850246;详,-9.79516492468;佩,-8.60652648436;滨,-9.21708707391;六,-9.19298952233;烬,-13.6238063212;筱,-12.2375119601;平,-5.21799171774;峴,-10.4883121052;職,-10.4883121052;書,-7.30664163443;鸝,-13.6238063212;旺,-7.86175493839;裼,-12.9306591406;濾,-12.5251940325;犁,-9.61647313594;匀,-11.6778961721;谪,-12.9306591406;甄,-11.8320468519;妇,-8.89641850246;弈,-11.4265817438;尊,-8.86163238638;明,-4.94960938095;鏘,-12.0143684087;謐,-10.2226089395;输,-11.5443647795;皙,-9.83961668725;團,-9.20496571338;宛,-6.99974109337;琚,-12.0143684087;祉,-12.5251940325;夜,-9.28000089932;縞,-11.5443647795;抡,-11.6778961721;撥,-9.86260620548;攤,-11.2259110484;骑,-9.404298616;陝,-10.1898191167;锌,-9.2293571665;耿,-9.69198068845;阮,-10.9157561201;嬰,-9.21708707391;難,-9.46492323781;岵,-13.6238063212;崴,-11.5443647795;憷,-13.6238063212;戶,-10.291601811;暹,-10.3657097832;粵,-9.98622016145;携,-12.0143684087;祈,-11.3212212282;举,-8.11847478524;勁,-9.98622016145;區,-7.76017514557;埃,-8.46475102196;遂,-8.04785721803;铅,-11.3212212282;婆,-7.27117692485;廉,-8.50581250876;彈,-9.41911370178;父,-8.14316739783;族,-7.24029968629;虎,-6.9391945935;歐,-8.87021613007;法,-6.70610071134;浔,-12.5251940325;釗,-8.41432016833;剖,-13.6238063212;釉,-10.2565104912;鶴,-7.73216210935;瑚,-11.0588569637;象,-8.48800788412;祜,-10.0974457966;繞,-10.1580704184;苡,-12.9306591406;趨,-11.2259110484;恢,-10.0974457966;試,-11.2259110484;滩,-8.49984234177;轨,-10.1272987597;叫,-9.67256260259;汪,-10.4457524908;热,-10.2565104912;公,-5.5778975789;闯,-8.24852791349;礼,-6.85072594552;嫱,-11.8320468519;翳,-11.1388996714;懷,-7.14529667896;扶,-9.13516995144;曹,-9.25435846871;读,-11.6778961721;渾,-9.14646950669;楼,-7.96781451035;乾,-8.32050141311;刁,-12.5251940325;鋁,-11.0588569637;圃,-10.1898191167;善,-7.7716038414;备,-7.62486975923;骆,-12.5251940325;縉,-10.3279694552;羈,-11.6778961721;鸥,-9.8171438314;攏,-11.6778961721;漓,-12.5251940325;聂,-12.5251940325;谕,-9.01863613518;涔,-11.8320468519;犖,-10.2226089395;阙,-9.10201774412;笛,-9.19298952233;咚,-12.5251940325;堝,-12.9306591406;雪,-6.90479316679;庞,-10.4883121052;戡,-11.6778961721;莠,-13.6238063212;营,-6.59383340947;誦,-10.679367342;温,-7.15766159694;侨,-11.4265817438;猫,-9.49667193613;沪,-8.87887419281;處,-10.9157561201;冬,-8.14734276924;唯,-8.49390760625;皮,-8.69655263602;娱,-11.3212212282;宰,-8.61986001523;雲,-5.81873927691;綴,-12.5251940325;愷,-8.82801577558;牵,-9.48067159478;栽,-11.8320468519;额,-9.52946175895;烂,-11.6778961721;奇,-5.98850243491;駒,-9.83961668725;鹉,-11.5443647795;鳶,-13.6238063212;恍,-12.0143684087;懌,-13.6238063212;敏,-5.81223783183;煌,-9.404298616;潛,-8.26251415546;项,-12.0143684087;体,-7.42940093007;棒,-10.3657097832;汕,-11.3212212282;藏,-7.88723402369;兗,-13.6238063212;勖,-10.2226089395;噙,-12.2375119601;孛,-12.2375119601;哚,-13.6238063212;姜,-9.54626887727;點,-8.86163238638;藤,-8.66797926357;筐,-12.5251940325;迨,-13.6238063212;卫,-6.6018298981;泪,-11.8320468519;灭,-8.90530744988;釬,-13.6238063212;目,-8.12254811063;驱,-9.98622016145;飲,-10.8512175989;巴,-7.48392176895;慷,-12.5251940325;虹,-8.05546181741;馴,-9.86260620548;死,-8.39805964746;滾,-11.6778961721;羁,-11.6778961721;邃,-11.6778961721;厅,-9.38969981658;鈄,-13.6238063212;庇,-12.0143684087;紆,-12.9306591406;須,-10.4883121052;蒋,-8.21216026932;融,-8.57395031392;昌,-5.90245770855;芏,-13.6238063212;谐,-10.4049304963;梓,-12.9306591406;隗,-10.5792838834;錯,-8.83631457839;写,-10.7905929771;岛,-7.12401928052;錚,-12.0143684087;帜,-11.1388996714;搠,-13.6238063212;蜢,-13.6238063212;接,-9.69198068845;煩,-10.1580704184;产,-9.96024467504;裝,-10.679367342;钫,-13.6238063212;霆,-9.69198068845;垭,-12.2375119601;琳,-7.57643414213;犯,-11.0588569637;綱,-6.99708857192;玉,-4.65757780695;玲,-6.92800740411;宵,-9.77365871946;收,-8.95097748671;耸,-10.9157561201;治,-7.34904429993;挺,-8.04407649519;辽,-8.57395031392;锑,-13.6238063212;調,-9.8171438314;隴,-9.88613670289;呀,-10.8512175989;烃,-10.7905929771;靂,-12.5251940325;剄,-13.6238063212;织,-9.83961668725;秉,-9.18115506468;蓋,-7.70222790153;黾,-11.5443647795;晌,-12.9306591406;苏,-7.89046504428;慎,-9.36112644413;豐,-7.66796895171;毕,-10.5792838834;詔,-9.05945812971;啖,-13.6238063212;灘,-8.49984234177;博,-6.56332995517;忝,-12.9306591406;耻,-12.5251940325;竟,-10.0402873827;神,-7.32485707432;菥,-13.6238063212;浦,-8.71853154273;桨,-12.9306591406;铫,-11.8320468519;歪,-11.3212212282;兮,-9.67256260259;己,-8.93245843894;绩,-8.37153289313;壳,-9.71178331574;署,-11.0588569637;寵,-9.71178331574;婴,-9.21708707391;疾,-9.09120682802;追,-10.9847489916;锁,-9.46492323781;垂,-9.46492323781;包,-10.5792838834;粗,-11.6778961721;遇,-8.73345719295;郭,-8.94167509405;服,-8.88760787278;戏,-13.6238063212;煬,-13.6238063212;沐,-11.1388996714;栓,-10.9157561201;檔,-11.3212212282;嘗,-11.5443647795;煨,-11.5443647795;焙,-12.2375119601;傘,-9.93492686706;厚,-7.76017514557;府,-6.3424206576;娟,-13.6238063212;妞,-10.679367342;蔡,-10.679367342;餚,-12.9306591406;挥,-9.31974122797;护,-8.71853154273;润,-7.64745541187;梨,-8.91427611986;含,-9.33334688002;圭,-9.2293571665;紱,-12.0143684087;躬,-10.8512175989;羲,-6.20023787691;鐸,-8.4476565886;莺,-10.2565104912;韫,-10.4457524908;赘,-12.9306591406;赴,-13.6238063212;镁,-10.3657097832;哀,-9.59845463044;灃,-10.0684582597;埂,-12.0143684087;獅,-10.291601811;狄,-8.59992580033;繇,-9.44941905128;奉,-8.02909494157;鵲,-9.48067159478;飒,-12.9306591406;浑,-9.14646950669;泐,-13.6238063212;桓,-7.9133793038;濒,-10.5792838834;闖,-8.24852791349;煙,-9.04909534267;烘,-12.9306591406;彝,-9.25435846871;络,-11.3212212282;驟,-10.4049304963;葺,-13.6238063212;荥,-11.2259110484;湧,-9.75260531027;淦,-10.6280740476;飽,-12.0143684087;鑫,-7.74048393268;燮,-8.94167509405;統,-7.68891212555;峰,-5.83311029;穆,-7.7716038414;豁,-13.6238063212;时,-8.16422080703;腹,-9.75260531027;鹳,-12.0143684087;湾,-7.08277632198;载,-9.16945902492;溫,-7.15766159694;璁,-11.3212212282;鈁,-13.6238063212;鋤,-12.5251940325;銅,-8.54240195619;錄,-8.40345049609;将,-9.38969981658;墉,-10.9847489916;斋,-6.62804016487;掏,-12.0143684087;麇,-12.5251940325;覓,-11.5443647795;謔,-12.5251940325;吖,-13.6238063212;備,-7.62486975923;焘,-8.73345719295;刚,-6.167351766;鍰,-11.8320468519;适,-8.95097748671;报,-9.43415157915;澧,-11.5443647795;谦,-6.89040442934;横,-8.38736435834;銳,-8.37153289313;环,-7.80967578935;粱,-10.7334345633;細,-10.1898191167;禳,-12.9306591406;嬴,-12.2375119601;搶,-9.88613670289;熵,-12.9306591406;似,-10.0128884085;殿,-6.84844023024;栾,-12.9306591406;品,-8.78752441422;燃,-10.1580704184;育,-9.18115506468;奈,-8.86163238638;旋,-8.83631457839;驊,-12.0143684087;描,-11.2259110484;赐,-8.68933238804;槓,-11.0588569637;乒,-13.6238063212;霜,-8.45332232613;烙,-12.0143684087;階,-7.94022655383;绝,-10.7905929771;页,-12.2375119601;察,-8.16422080703;塞,-7.98545165184;臣,-6.15586398889;示,-9.18115506468;拥,-9.71178331574;滕,-10.0684582597;楨,-9.01863613518;园,-7.11206099153;缓,-10.4457524908;可,-7.54846029008;琼,-7.50131351166;干,-8.37678224901;魴,-10.2565104912;摶,-10.9847489916;惹,-11.8320468519;腸,-11.8320468519;添,-9.0388388425;艺,-7.95737963306;潼,-12.0143684087;衾,-13.6238063212;吁,-10.679367342;喀,-8.87887419281;韪,-12.9306591406;厄,-10.1580704184;缇,-11.8320468519;鲆,-12.2375119601;妈,-6.86687393193;銖,-13.6238063212;统,-7.68891212555;民,-5.67048797461;霍,-8.58038120425;互,-12.9306591406;候,-9.0388388425;銚,-11.8320468519;帝,-5.43262031653;龜,-9.69198068845;鬟,-12.0143684087;增,-8.25316829305;搡,-13.6238063212;索,-7.27816996034;暢,-9.96024467504;榨,-12.5251940325;甫,-7.13764553223;說,-11.4265817438;匯,-8.48800788412;炮,-7.9470525189;就,-10.8512175989;珉,-11.2259110484;珲,-11.1388996714;宴,-9.93492686706;魚,-8.47051472668;活,-10.0128884085;丽,-6.58502277978;滋,-9.91023425447;直,-8.03281934066;瑁,-9.2293571665;元,-6.66345859207;囂,-11.0588569637;鉅,-12.5251940325;穷,-11.3212212282;鈾,-12.9306591406;荏,-13.6238063212;胎,-10.5792838834;楓,-9.12399665084;軒,-5.79457378363;評,-10.0974457966;比,-9.38969981658;铖,-7.30303802692;胡,-7.22854472306;釘,-10.1898191167;孟,-8.40345049609;壞,-13.6238063212;无,-9.44941905128;轧,-13.6238063212;賦,-8.26251415546;桩,-11.6778961721;槨,-8.99883350789;畫,-9.8171438314;櫪,-12.2375119601;癭,-12.5251940325;苓,-8.88760787278;鋼,-7.58117348749;山,-4.91038866779;巰,-13.6238063212;女,-8.44202277088;绲,-12.9306591406;贯,-6.71006897051;辨,-10.1272987597;懸,-10.2565104912;闾,-11.3212212282;錫,-7.90677861977;達,-5.76942511052;独,-10.2565104912;袁,-10.0974457966;劃,-10.5327638678;锂,-10.2226089395;内,-8.43642051533;缆,-13.6238063212;安,-5.60748842267;稈,-12.9306591406;蚋,-13.6238063212;養,-9.37531107912;萌,-8.43084947028;熬,-10.8512175989;侑,-11.4265817438;丐,-12.5251940325;誓,-10.5327638678;洒,-10.679367342;榕,-10.679367342;钗,-7.19086622843;圖,-6.95939730082;厙,-13.6238063212;刘,-7.90022121922;焚,-11.4265817438;盛,-6.99841395316;碟,-13.6238063212;笞,-12.9306591406;映,-10.1272987597;攢,-12.2375119601;貧,-11.8320468519;伦,-6.54884312321;让,-8.66797926357;樨,-12.5251940325;閭,-11.3212212282;听,-8.06312469016;献,-8.67504643079;钉,-10.1898191167;媳,-12.9306591406;場,-12.9306591406;錸,-12.9306591406;莹,-9.14646950669;舸,-12.9306591406;款,-11.8320468519;濡,-12.5251940325;勃,-8.64707257875;蘊,-10.0684582597;蹠,-13.6238063212;築,-9.8171438314;蛋,-8.96984597102;藍,-8.61986001523;俑,-11.1388996714;乐,-6.96323117133;櫓,-11.5443647795;浒,-10.4049304963;桔,-11.2259110484;哗,-11.5443647795;靖,-7.8937065382;叙,-9.96024467504;绛,-11.0588569637;党,-8.48800788412;川,-6.6344710552;壟,-12.2375119601;锐,-8.37153289313;邑,-8.12663809588;敢,-9.73198602306;臥,-10.291601811;麥,-7.03076178703;车,-9.73198602306;科,-6.15700684615;餮,-13.6238063212;睦,-10.6280740476;聽,-8.06312469016;烯,-9.56336331063;卮,-12.9306591406;忱,-10.3657097832;珩,-10.0402873827;絲,-8.15997451615;蝶,-9.48067159478;菹,-13.6238063212;任,-7.85861521839;纾,-10.7334345633;酌,-11.6778961721;省,-9.14646950669;刃,-10.5327638678;喂,-11.0588569637;算,-10.7905929771;將,-9.38969981658;菀,-12.5251940325;嬉,-11.5443647795;過,-11.4265817438;莎,-11.1388996714;休,-8.28147206921;源,-6.79293208653;樓,-7.96781451035;磯,-10.679367342;銘,-7.30303802692;帛,-9.13516995144;醚,-12.5251940325;鲜,-9.8171438314;实,-7.33594776101;針,-9.8171438314;渚,-11.4265817438;肤,-12.0143684087;氧,-11.5443647795;侦,-11.8320468519;誨,-11.4265817438;钇,-13.6238063212;親,-8.25316829305;甭,-12.0143684087;咬,-10.1272987597;玮,-8.73345719295;弱,-10.2565104912;艿,-12.2375119601;稳,-9.83961668725;網,-9.43415157915;餵,-11.0588569637;架,-11.2259110484;茹,-9.38969981658;芸,-11.8320468519;主,-7.30303802692;膺,-9.75260531027;洽,-11.4265817438;沼,-10.7334345633;设,-9.48067159478;睁,-12.9306591406;雀,-11.2259110484;痂,-13.6238063212;充,-7.93007418237;忆,-7.78899558411;晋,-7.58832488865;姊,-12.9306591406;里,-6.68068389835;潑,-11.0588569637;畏,-9.73198602306;瑗,-11.0588569637;纥,-12.9306591406;蛎,-13.6238063212;嵝,-13.6238063212;糜,-12.2375119601;寞,-12.0143684087;条,-11.2259110484;曠,-9.30631820764;扣,-10.679367342;既,-10.9157561201;胤,-8.13074487783;俦,-12.5251940325;櫨,-13.6238063212;癫,-9.43415157915;镭,-12.5251940325;铬,-11.8320468519;灯,-9.65351440762;叮,-11.5443647795;影,-8.07862887669;绰,-9.69198068845;驳,-10.9847489916;已,-10.9157561201;饵,-11.2259110484;隱,-7.23188920778;風,-6.48811897414;泼,-11.0588569637;桿,-11.0588569637;课,-12.0143684087;漁,-9.46492323781;傅,-8.33050149645;億,-11.2259110484;霖,-6.38100839838;帆,-6.44831660755;笈,-10.8512175989;枋,-11.1388996714;頊,-10.0684582597;澆,-11.6778961721;戎,-8.74100439859;云,-5.81873927691;伐,-8.88760787278;讓,-8.66797926357;谒,-11.3212212282;辯,-9.54626887727;錘,-8.89641850246;倚,-9.93492686706;粝,-13.6238063212;稞,-12.9306591406;瓚,-9.00868580433;肥,-10.0128884085;该,-12.0143684087;涧,-9.21708707391;並,-12.9306591406;檩,-13.6238063212;謨,-8.80352475557;株,-11.5443647795;钭,-13.6238063212;甬,-11.6778961721;冯,-8.87021613007;纱,-9.63482227461;財,-9.61647313594;害,-10.5792838834;陶,-8.69655263602;头,-7.88723402369;斷,-10.8512175989;昶,-9.86260620548;抹,-10.3279694552;硫,-10.9847489916;沽,-11.4265817438;洼,-10.2226089395;覿,-12.5251940325;樾,-10.0974457966;雁,-7.75733826424;址,-10.0974457966;參,-8.86163238638;呂,-8.58038120425;僅,-11.8320468519;兄,-7.57171715225;珠,-7.38939559545;納,-6.08477926535;操,-5.93443521364;敌,-10.0128884085;臏,-9.69198068845;扎,-9.18115506468;仑,-9.28000089932;佐,-8.06697825947;毓,-9.52946175895;棕,-9.88613670289;務,-9.65351440762;做,-11.6778961721;杠,-11.0588569637;揣,-11.8320468519;渺,-12.0143684087;胥,-9.05945812971;书,-7.30664163443;芽,-8.77961923471;矫,-10.7334345633;髦,-10.4457524908;哭,-10.7905929771;畬,-12.2375119601;凯,-5.97697492974;彰,-9.93492686706;籲,-10.679367342;奴,-8.40345049609;旷,-9.30631820764;晶,-7.41320624415;恺,-8.82801577558;泽,-7.05713389137;槿,-11.4265817438;镛,-10.5792838834;鞀,-13.6238063212;質,-8.35594816211;瀅,-10.2226089395;崇,-8.2719481877;庆,-6.23981686319;守,-8.06697825947;朋,-9.65351440762;損,-10.0402873827;斌,-6.8892146612;意,-7.88080313336;芎,-13.6238063212;丑,-9.8171438314;笙,-9.06992942957;駐,-10.9847489916;沒,-12.5251940325;锗,-12.9306591406;皖,-10.1898191167;则,-8.53005612037;滅,-8.90530744988;弛,-10.7905929771;尝,-11.5443647795;綜,-9.77365871946;够,-12.9306591406;骞,-8.87021613007;鎰,-10.9847489916;挣,-12.9306591406;洧,-12.5251940325;亦,-7.61009116513;聆,-13.6238063212;吭,-13.6238063212;喬,-7.13156648615;焯,-11.1388996714;銮,-10.3657097832;縱,-12.0143684087;铉,-9.16945902492;笳,-11.1388996714;速,-9.56336331063;船,-9.36112644413;輻,-13.6238063212;涼,-7.7516885317;椿,-9.93492686706;練,-9.65351440762;千,-10.1272987597;铂,-10.1580704184;酷,-11.0588569637;嵇,-13.6238063212;纠,-12.5251940325;婉,-11.0588569637;閃,-9.54626887727;磊,-7.6499967093;稣,-7.61991925407;拎,-12.0143684087;俐,-9.91023425447;類,-9.31974122797;镗,-12.2375119601;盖,-7.70222790153;牙,-7.66280098155;变,-9.98622016145;竞,-9.91023425447;鼗,-13.6238063212;蟠,-8.22564361966;荣,-6.52213034955;擢,-11.4265817438;恥,-12.5251940325;萧,-9.8171438314;赧,-12.9306591406;滦,-12.5251940325;詩,-7.89046504428;瑭,-9.41911370178;嗬,-13.6238063212;狮,-10.291601811;翰,-8.36111613227;糲,-13.6238063212;塵,-8.98907733294;敷,-10.2565104912;舍,-9.33334688002;胺,-11.5443647795;西,-5.76787412145;諾,-6.57890120404;禁,-9.79516492468;砀,-13.6238063212;待,-11.1388996714;儆,-13.6238063212;合,-7.68627011609;袋,-10.7334345633;軟,-10.7905929771;洎,-12.0143684087;憑,-10.4883121052;糙,-13.6238063212;觐,-12.0143684087;枕,-10.5327638678;昔,-10.5327638678;窗,-10.8512175989;外,-8.25316829305;尘,-8.98907733294;邛,-12.9306591406;鮮,-9.8171438314;锞,-12.5251940325;沣,-10.0684582597;欢,-8.33050149645;两,-12.5251940325;答,-9.63482227461;银,-6.89040442934;薩,-7.05572840976;萨,-7.05572840976;未,-8.8116219658;箭,-8.96984597102;纯,-7.27292060446;熱,-10.2565104912;钳,-11.6778961721;嘴,-8.39805964746;褶,-11.2259110484;永,-7.20055935764;莽,-8.41432016833;放,-7.88401340899;私,-10.6280740476;础,-10.1272987597;謊,-12.5251940325;必,-8.96984597102;鹄,-10.9157561201;勇,-6.63354982068;兆,-8.93245843894;呈,-9.52946175895;棋,-8.66096169091;坊,-9.56336331063;母,-6.19191440437;滏,-13.6238063212;济,-7.54387312608;恐,-9.65351440762;荒,-13.6238063212;晔,-9.31974122797;奖,-10.6280740476;迪,-6.54209773507;烛,-9.88613670289;阻,-9.96024467504;盟,-9.2417796865;泣,-13.6238063212;止,-10.0128884085;迥,-10.9157561201;拧,-13.6238063212;早,-9.38969981658;士,-6.59118206014;杪,-13.6238063212;马,-6.37957880557;絮,-11.3212212282;凱,-5.97697492974;灰,-9.88613670289;铳,-11.6778961721;獲,-9.71178331574;韵,-8.82801577558;噴,-11.4265817438;諷,-12.9306591406;淹,-9.11294681466;揽,-11.1388996714;蕾,-8.64707257875;礁,-9.71178331574;墀,-8.53620998594;陪,-9.404298616;庄,-6.35349343509;切,-9.28000089932;针,-9.8171438314;栋,-8.74860899797;锖,-13.6238063212;龆,-12.5251940325;熙,-11.0588569637;排,-11.3212212282;朕,-9.93492686706;首,-10.4457524908;崙,-9.28000089932;岘,-10.4883121052;瀛,-9.75260531027;龚,-12.9306591406;匝,-12.5251940325;銜,-10.2565104912;嘟,-12.2375119601;頡,-10.4457524908;氣,-9.65351440762;交,-9.404298616;枪,-9.37531107912;记,-8.92332595538;鸯,-11.3212212282;鯨,-8.33553929048;焱,-10.5327638678;邰,-13.6238063212;吳,-7.96781451035;厲,-9.91023425447;鈀,-12.9306591406;嚴,-9.0805115389;鋈,-13.6238063212;洹,-12.2375119601;貸,-8.91427611986;总,-7.383530476;脏,-12.2375119601;押,-10.8512175989;蘿,-11.4265817438;祁,-9.512932457;責,-10.9847489916;籃,-11.2259110484;寂,-10.1272987597;组,-11.1388996714;則,-8.53005612037;准,-8.64707257875;啉,-12.5251940325;哈,-8.1515356475;穗,-9.54626887727;陟,-11.2259110484;驗,-10.7905929771;棠,-10.9157561201;黄,-7.76587316669;询,-9.58075505334;佥,-10.0128884085;令,-7.79192384389;执,-9.12399665084;填,-11.2259110484;錛,-12.2375119601;差,-9.54626887727;共,-10.5792838834;味,-9.43415157915;史,-7.31388804295;围,-9.56336331063;腕,-13.6238063212;俺,-12.0143684087;拼,-12.9306591406;虿,-13.6238063212;颁,-11.3212212282;綃,-12.2375119601;笪,-12.9306591406;缄,-12.9306591406;率,-8.72596652122;逆,-10.4883121052;璉,-6.99444306774;锈,-12.2375119601;見,-7.12703133099;軸,-10.7905929771;認,-11.3212212282;谎,-12.5251940325;斓,-10.8512175989;戒,-12.5251940325;蚕,-9.71178331574;朔,-9.46492323781;宗,-5.3609893835;砖,-9.44941905128;踅,-11.2259110484;军,-4.83979724999;劝,-9.46492323781;猜,-11.2259110484;邮,-11.5443647795;趣,-11.6778961721;溥,-8.68933238804;伤,-10.679367342;遼,-8.57395031392;妫,-12.2375119601;第,-7.06136222748;铜,-8.54240195619;邱,-10.7905929771;焰,-12.5251940325;瀑,-11.4265817438;鎊,-13.6238063212;殷,-9.06992942957;蠶,-9.71178331574;油,-9.73198602306;贸,-12.9306591406;鷂,-12.9306591406;为,-6.25043201126;羞,-10.6280740476;壁,-8.12663809588;祀,-10.4883121052;罄,-12.9306591406;哉,-9.65351440762;畈,-13.6238063212;構,-9.06992942957;諍,-11.6778961721;歌,-7.96781451035;俏,-11.0588569637;惑,-11.6778961721;腐,-12.2375119601;扒,-12.2375119601;硖,-12.5251940325;峙,-9.93492686706;嵘,-9.83961668725;跖,-13.6238063212;繚,-9.67256260259;勝,-6.44221437656;卜,-8.56121128815;域,-7.63987004049;瑞,-6.34724991845;裡,-6.68068389835;楠,-8.37153289313;詢,-9.58075505334;以,-12.0143684087;潤,-7.64745541187;鸾,-9.12399665084;羽,-6.82141155785;韦,-8.08254277601;竭,-12.5251940325;籮,-12.5251940325;兰,-5.73622228951;闳,-10.2565104912;芒,-9.52946175895;请,-10.4049304963;绶,-9.75260531027;臻,-10.5792838834;社,-8.19008431762;拽,-12.5251940325;鹫,-12.2375119601;柿,-12.5251940325;頁,-12.2375119601;馀,-12.0143684087;崃,-13.6238063212;帅,-6.90721154765;径,-9.37531107912;吉,-6.92061820793;喈,-12.0143684087;椋,-13.6238063212;隊,-10.2226089395;伏,-8.64707257875;憐,-10.679367342;抒,-12.2375119601;昕,-8.85312169671;顯,-7.5835516099;颖,-8.49984234177;鐾,-12.9306591406;黎,-8.27669879046;庚,-7.62735423255;初,-7.25390533834;土,-8.30568632733;璞,-9.71178331574;校,-8.45332232613;责,-10.9847489916;檢,-10.4883121052;严,-9.0805115389;滇,-10.5792838834;茧,-10.7334345633;悦,-8.14316739783;薨,-13.6238063212;夫,-5.36408936015;騭,-11.8320468519;弯,-11.5443647795;粮,-9.86260620548;週,-6.76629225863;冰,-7.24368378427;申,-7.71300967713;劲,-9.98622016145;鈺,-9.83961668725;真,-6.82030106356;欷,-12.5251940325;氹,-12.5251940325;人,-5.67718875793;郴,-12.9306591406;秀,-6.22869877461;嫂,-7.42736219338;鹅,-12.0143684087;升,-6.37459126406;闈,-11.6778961721;囊,-9.67256260259;住,-10.0128884085;鼓,-9.73198602306;苒,-13.6238063212;晕,-12.0143684087;柔,-9.404298616;字,-9.8171438314;諸,-8.34060259243;緘,-12.9306591406;剝,-11.5443647795;鏜,-12.2375119601;澤,-7.05713389137;衡,-7.12101627526;槠,-12.9306591406;浣,-13.6238063212;翠,-7.60521310668;濤,-6.46296041451;捧,-10.1898191167;惦,-12.5251940325;摩,-8.62659404741;旨,-8.64707257875;婭,-8.99883350789;寬,-7.97835942353;凰,-11.1388996714;镳,-8.37678224901;齒,-9.75260531027;陵,-6.76839752256;避,-10.6280740476;歷,-8.37678224901;豹,-9.02868647104;试,-11.2259110484;艽,-10.9847489916;陽,-5.76323553563;板,-8.72596652122;擾,-11.5443647795;宁,-5.57246538788;稀,-9.73198602306;射,-9.59845463044;邇,-12.0143684087;匆,-12.9306591406;訊,-9.61647313594;蕖,-12.9306591406;栌,-13.6238063212;伎,-11.2259110484;成,-5.34741161631;谂,-12.9306591406;斕,-10.8512175989;缯,-13.6238063212;碗,-11.8320468519;遘,-13.6238063212;龙,-5.63322943943;帘,-11.1388996714;力,-6.41668746497;級,-9.91023425447;缀,-12.5251940325;倜,-9.61647313594;钟,-8.2211289393;霞,-6.52957147525;计,-9.31974122797;疇,-6.47546057727;昨,-11.6778961721;攪,-11.6778961721;资,-10.291601811;到,-13.6238063212;嚳,-10.679367342;儲,-10.9157561201;吴,-7.96781451035;边,-8.29593015238;丸,-9.2417796865;贺,-8.76399391681;膽,-9.13516995144;蒿,-9.52946175895;篁,-12.5251940325;练,-9.65351440762;奂,-10.9847489916;巅,-11.8320468519;陈,-8.04407649519;請,-10.4049304963;啊,-10.9847489916;槍,-9.37531107912;行,-7.05152377848;面,-9.46492323781;藕,-10.0128884085;策,-6.24729819485;忙,-8.40345049609;幘,-12.2375119601;凝,-9.36112644413;停,-9.54626887727;哟,-12.5251940325;睞,-12.5251940325;代,-7.23692700181;躺,-11.8320468519;淥,-12.0143684087;汤,-8.57395031392;胧,-12.5251940325;荦,-10.2226089395;晨,-7.83998113884;給,-13.6238063212;塬,-10.1898191167;賠,-12.0143684087;雳,-12.5251940325;闵,-9.48067159478;逸,-8.32548895462;紇,-12.9306591406;表,-8.18572701225;迹,-10.4457524908;炅,-10.9157561201;松,-6.85646319591;布,-6.52377915454;如,-7.76017514557;紅,-6.71805304486;历,-8.37678224901;眉,-7.53476144573;喊,-9.44941905128;植,-8.52393989335;氏,-5.24956013908;澎,-10.5327638678;芐,-12.2375119601;易,-7.950483054;蒔,-13.6238063212;頗,-11.2259110484;缙,-10.3279694552;纘,-12.0143684087;创,-9.06992942957;煮,-12.2375119601;炜,-9.01863613518;吟,-9.20496571338;迄,-13.6238063212;次,-12.5251940325;誠,-6.36187922847;渣,-11.4265817438;津,-7.56002111249;鍇,-10.2565104912;性,-7.45419558868;暨,-12.9306591406;騫,-8.87021613007;胆,-9.13516995144;夭,-11.2259110484;微,-7.5415874108;阳,-5.76323553563;冲,-6.89997388035;电,-10.5792838834;财,-9.61647313594;样,-8.21663454971;驴,-10.0128884085;鹃,-7.9133793038;益,-6.0518178718;峄,-12.2375119601;假,-10.7905929771;鼠,-10.3279694552;盈,-7.84615399795;橋,-7.1422291919;镶,-10.5792838834;迎,-9.06992942957;荑,-11.8320468519;拐,-10.679367342;晓,-7.85548532538;谢,-8.25783030615;敕,-10.4049304963;擔,-12.0143684087;塗,-10.9847489916;選,-9.02868647104;绘,-10.2226089395;剛,-6.167351766;線,-8.20770591897;系,-8.50581250876;瑟,-8.53005612037;韞,-10.4457524908;歡,-8.33050149645;貼,-11.1388996714;賤,-12.9306591406;祭,-11.2259110484;磬,-10.5792838834;屯,-8.49984234177;繼,-8.77177605725;危,-9.33334688002;勰,-9.86260620548;陳,-8.04407649519;鋒,-7.72665245354;茨,-9.2417796865;轹,-13.6238063212;滸,-10.4049304963;淺,-10.0684582597;突,-10.5327638678;堂,-6.44984800142;約,-8.81978527644;醇,-9.21708707391;分,-8.37153289313;圈,-10.4883121052;与,-11.0588569637;抑,-12.2375119601;怒,-8.48800788412;攔,-13.6238063212;妗,-13.6238063212;庙,-7.88401340899;弘,-7.93007418237;玛,-6.69428955041;尚,-7.96781451035;欠,-11.3212212282;辣,-11.2259110484;蠢,-12.0143684087;沥,-11.3212212282;贤,-6.62987334595;木,-6.77686318159;宫,-6.61801730192;碭,-13.6238063212;鶯,-10.2565104912;帮,-9.29307298089;励,-10.5327638678;麓,-9.52946175895;瀲,-12.9306591406;钵,-11.1388996714;锴,-10.2565104912;榷,-12.9306591406;訶,-10.3279694552;伸,-9.44941905128;番,-10.4883121052;显,-7.5835516099;钞,-9.00868580433;心,-7.39135830462;變,-9.98622016145;鳅,-11.8320468519;組,-11.1388996714;凇,-11.8320468519;牆,-9.61647313594;薪,-7.950483054;遵,-9.49667193613;毋,-13.6238063212;告,-9.10201774412;虢,-10.9847489916;乎,-9.61647313594;苑,-8.29108752791;荐,-10.0128884085;染,-10.3279694552;恒,-7.64239210992;姗,-10.8512175989;给,-13.6238063212;彘,-13.6238063212;逾,-12.0143684087;郝,-10.3657097832;兜,-10.7334345633;諡,-12.2375119601;俣,-11.3212212282;桢,-9.01863613518;泥,-9.49667193613;荧,-12.0143684087;臧,-11.8320468519;艦,-9.59845463044;杨,-6.97871535167;寫,-10.7905929771;蔻,-13.6238063212;巯,-13.6238063212;勱,-11.8320468519;印,-8.45902034725;石,-5.55509012846;遲,-8.28147206921;畴,-6.47546057727;潸,-13.6238063212;項,-12.0143684087;決,-9.96024467504;能,-7.83998113884;晾,-12.9306591406;威,-6.55478289459;简,-8.87021613007;弃,-9.88613670289;聶,-12.5251940325;嶄,-13.6238063212;嘉,-6.89997388035;钊,-8.41432016833;蠍,-10.9157561201;輸,-11.5443647795;贏,-9.31974122797;于,-8.20770591897;我,-11.3212212282;鄙,-11.8320468519;蜓,-13.6238063212;软,-10.7905929771;赔,-12.0143684087;猛,-8.21663454971;岚,-8.54240195619;瀝,-11.3212212282;农,-8.15997451615;生,-5.18112118193;模,-7.85236519804;梢,-9.93492686706;谥,-12.2375119601;涤,-11.3212212282;愧,-11.8320468519;芦,-10.8512175989;蘩,-12.9306591406;陆,-8.02909494157;頭,-7.88723402369;馬,-6.37957880557;累,-9.38969981658;纜,-13.6238063212;爱,-7.45002021727;现,-9.48067159478;傲,-9.93492686706;吵,-10.8512175989;香,-6.31660400641;輯,-9.54626887727;丹,-6.5304016953;貺,-13.6238063212;耽,-10.1272987597;政,-6.20442573825;暾,-11.6778961721;婁,-11.0588569637;節,-8.18572701225;郑,-8.82801577558;居,-8.10635342471;緄,-12.9306591406;钠,-11.1388996714;術,-7.96432410541;瓊,-7.50131351166;衍,-8.40887056356;觌,-12.5251940325;赏,-9.34714020216;从,-11.2259110484;藺,-11.6778961721;提,-8.18572701225;杓,-12.5251940325;套,-10.7334345633;忘,-12.9306591406;鍛,-12.2375119601;灝,-9.86260620548;燜,-12.9306591406;啟,-7.65509876119;回,-8.61317102708;詡,-9.56336331063;淤,-12.5251940325;慧,-6.35210261429;拦,-13.6238063212;孫,-6.57715904332;躒,-13.6238063212;姬,-8.85312169671;雙,-8.96984597102;台,-8.15997451615;靳,-13.6238063212;呵,-10.4883121052;痴,-11.2259110484;楷,-9.34714020216;諶,-10.7334345633;俸,-12.9306591406;荻,-12.2375119601;賺,-11.2259110484;恽,-11.6778961721;臼,-11.8320468519;曾,-6.61620570722;嶁,-13.6238063212;境,-8.49984234177;异,-8.01433452599;宅,-8.96984597102;娄,-11.0588569637;嚇,-9.18115506468;冉,-8.64019969946;霭,-10.0128884085;湖,-6.55478289459;澍,-7.46682733559;渌,-12.0143684087;钤,-10.679367342;崖,-8.80352475557;妙,-9.12399665084;超,-6.2888244423;钛,-12.2375119601;功,-7.20544138524;谠,-12.9306591406;漢,-6.26116105076;疊,-10.679367342;憩,-12.9306591406;铝,-11.0588569637;岫,-10.8512175989;錆,-13.6238063212;媯,-12.2375119601;央,-9.44941905128;閱,-10.3279694552;琰,-9.93492686706;傳,-7.9470525189;露,-8.56756051582;鎵,-12.9306591406;鈴,-9.00868580433;贶,-13.6238063212;核,-9.31974122797;昼,-10.0402873827;抿,-11.5443647795;脾,-10.7905929771;局,-8.87021613007;寅,-9.54626887727;驄,-8.72596652122;商,-7.75733826424;凉,-7.7516885317;偈,-12.5251940325;半,-10.5327638678;乌,-8.93245843894;邸,-10.2226089395;塘,-9.69198068845;铛,-12.9306591406;孚,-8.08254277601;馆,-9.16945902492;鋟,-12.9306591406;煞,-13.6238063212;淡,-10.6280740476;池,-8.17276786761;潢,-12.2375119601;記,-8.92332595538;褒,-10.2565104912;敦,-8.53005612037;赫,-7.23356565411;高,-6.89637459632;荪,-10.5327638678;忭,-13.6238063212;端,-7.98189925023;奮,-10.5327638678;闱,-11.6778961721;瑰,-10.2565104912;鄒,-11.5443647795;籁,-12.0143684087;剴,-9.38969981658;价,-9.67256260259;茎,-9.29307298089;柽,-12.9306591406;虼,-12.5251940325;拿,-9.52946175895;腾,-8.31553862377;頃,-11.3212212282;骄,-10.5792838834;疆,-7.97483208301;儉,-7.93344686685;傈,-12.9306591406;谋,-8.38205930611;謖,-10.1898191167;伍,-9.28000089932;二,-7.38743673097;鵬,-6.5353975425;撐,-11.8320468519;黃,-7.76587316669;题,-10.5792838834;君,-6.5463082676;定,-7.5835516099;贡,-7.97483208301;負,-13.6238063212;蠣,-13.6238063212;誤,-10.679367342;昧,-11.6778961721;薦,-10.0128884085;您,-13.6238063212;簫,-10.9847489916;措,-10.6280740476;缭,-9.67256260259;纬,-9.59845463044;妮,-10.6280740476;唱,-10.679367342;環,-7.80967578935;鑲,-10.5792838834;犴,-10.7905929771;椹,-10.4457524908;霁,-10.4049304963;论,-8.95097748671;房,-8.61317102708;管,-8.81978527644;跷,-12.5251940325;陇,-9.88613670289;光,-5.68251075027;烈,-7.18285978054;疃,-11.8320468519;及,-8.96984597102;位,-9.67256260259;滌,-11.3212212282;槎,-12.9306591406;柒,-13.6238063212;拔,-9.15789820252;鹗,-9.65351440762;壘,-9.77365871946;瑛,-9.44941905128;野,-8.25783030615;坝,-8.31060034213;滤,-12.5251940325;泠,-11.8320468519;档,-11.3212212282;顺,-6.0632051584;步,-10.0402873827;諤,-9.61647313594;旦,-8.34060259243;腩,-12.9306591406;惨,-13.6238063212;彭,-9.61647313594;廬,-9.20496571338;驯,-9.86260620548;理,-7.17808650179;铰,-13.6238063212;習,-9.79516492468;獵,-9.93492686706;淶,-12.2375119601;楹,-11.2259110484;龔,-12.9306591406;诺,-6.57890120404;蝽,-13.6238063212;曼,-6.02641000096;承,-7.44172141446;臾,-13.6238063212;岁,-10.7334345633;紀,-7.42940093007;妃,-7.30844831965;市,-9.512932457;骅,-12.0143684087;瞇,-10.4049304963;吆,-12.9306591406;炉,-9.98622016145;趋,-11.2259110484;刊,-10.4049304963;躍,-8.94167509405;肅,-8.16422080703;栎,-9.16945902492;撑,-11.8320468519;繆,-10.7905929771;貂,-12.9306591406;鹞,-12.9306591406;得,-7.66022697755;尖,-10.1580704184;墙,-9.61647313594;蠅,-10.3279694552;圜,-12.9306591406;原,-7.17650045863;逞,-12.2375119601;没,-12.5251940325;欤,-12.5251940325;爰,-11.6778961721;肩,-11.6778961721;愨,-12.9306591406;航,-8.2211289393;庭,-7.27292060446;缬,-10.0128884085;钱,-10.1272987597;田,-6.30460386241;决,-9.96024467504;鎮,-6.63079119824;猴,-10.7905929771;樺,-9.77365871946;蹺,-12.5251940325;琴,-7.46049151714;峁,-10.3279694552;礪,-11.1388996714;幂,-12.2375119601;魄,-12.9306591406;呆,-9.88613670289;僉,-10.0128884085;先,-7.208709362;淋,-9.77365871946;削,-11.3212212282;仍,-10.4883121052;每,-12.9306591406;蘆,-10.8512175989;羹,-12.9306591406;晒,-12.5251940325;志,-6.76734433658;游,-8.43084947028;奘,-8.33050149645;痛,-12.0143684087;驚,-9.06992942957;睜,-12.9306591406;叟,-10.291601811;遞,-10.1580704184;泡,-10.0128884085;浠,-11.6778961721;解,-8.80352475557;舶,-10.8512175989;此,-11.0588569637;葦,-10.4457524908;慨,-13.6238063212;巫,-11.1388996714;緦,-13.6238063212;续,-9.34714020216;确,-10.5792838834;铱,-12.9306591406;異,-8.01433452599;凳,-10.1580704184;噲,-10.7905929771;勵,-10.5327638678;迷,-9.63482227461;汶,-10.2226089395;棹,-12.9306591406;藻,-8.19008431762;杼,-12.2375119601;聾,-13.6238063212;封,-8.13900938768;证,-7.62239144321;纂,-10.6280740476;娅,-8.99883350789;紗,-9.63482227461;眇,-12.9306591406;軾,-12.0143684087;倉,-7.02121842898;冈,-12.5251940325;洋,-8.14316739783;澌,-13.6238063212;欏,-12.2375119601;斐,-8.49984234177;弗,-8.45902034725;鐫,-13.6238063212;锛,-12.2375119601;媚,-10.0128884085;鰍,-11.8320468519;錟,-13.6238063212;谡,-10.1898191167;亢,-10.9847489916;軋,-13.6238063212;殤,-13.6238063212;朧,-12.5251940325;憨,-12.5251940325;紫,-8.63337373439;芪,-13.6238063212;席,-9.93492686706;墮,-12.9306591406;吱,-13.6238063212;爵,-7.208709362;根,-7.13612230269;攻,-8.76399391681;屁,-10.6280740476;廂,-9.61647313594;驅,-9.98622016145;寄,-11.0588569637;均,-8.23017877482;偉,-6.01940997238;燈,-9.65351440762;测,-9.01863613518;藶,-13.6238063212;乍,-12.0143684087;譏,-12.5251940325;銹,-12.2375119601;葑,-11.2259110484;鹿,-7.58832488865;貢,-7.97483208301;菔,-13.6238063212;罗,-6.18072794682;糖,-8.51786084727;秘,-8.15574618004;畛,-13.6238063212;噝,-13.6238063212;矜,-11.2259110484;污,-13.6238063212;珑,-11.8320468519;楣,-11.8320468519;滢,-10.2226089395;诤,-11.6778961721;恩,-6.26880440007;臨,-7.47320355273;繭,-10.7334345633;魯,-6.93545160723;壮,-8.47051472668;闰,-9.71178331574;关,-8.02909494157;煒,-9.01863613518;創,-9.06992942957;莪,-13.6238063212;觸,-11.6778961721;櫺,-12.2375119601;漫,-10.0402873827;征,-6.7485742339;邪,-9.25435846871;禅,-8.66797926357;璇,-9.88613670289;圆,-7.99259453935;厉,-9.91023425447;刈,-13.6238063212;事,-10.0402873827;焊,-12.9306591406;谌,-10.7334345633;謎,-11.5443647795;攒,-12.2375119601;领,-7.40321615107;怔,-11.2259110484;岗,-8.12663809588;湘,-8.13486859502;宙,-9.58075505334;娘,-6.43087209996;際,-11.0588569637;多,-8.87887419281;喝,-9.404298616;渠,-7.97835942353;檣,-12.2375119601;緞,-10.7905929771;朦,-12.9306591406;童,-8.61317102708;庫,-7.989016718;維,-6.25736117285;蒼,-10.679367342;誉,-9.01863613518;笮,-12.5251940325;贲,-10.0974457966;劳,-9.02868647104;甲,-7.29408541565;况,-10.4457524908;铟,-13.6238063212;货,-10.6280740476;樸,-8.74860899797;非,-7.95737963306;施,-8.06697825947;连,-7.80076042569;种,-11.2259110484;幀,-10.9157561201;終,-10.0402873827;塄,-13.6238063212;叉,-8.84468282806;介,-9.18115506468;煊,-8.77961923471;绣,-9.88613670289;拓,-9.25435846871;联,-8.23473459136;花,-7.5324964391;许,-8.81978527644;四,-8.19008431762;奚,-10.9157561201;蕙,-8.87021613007;呜,-11.5443647795;烟,-9.04909534267;卞,-11.3212212282;信,-6.2231857438;习,-9.79516492468;赢,-9.31974122797;郧,-12.9306591406;蝦,-9.56336331063;揩,-11.1388996714;落,-10.3657097832;屬,-8.88760787278;壯,-8.47051472668;陰,-8.96984597102;勳,-7.03350527298;畲,-12.2375119601;釵,-7.19086622843;佶,-10.0128884085;骧,-9.49667193613;弁,-10.2226089395;娃,-7.36040805858;嶂,-12.0143684087;餅,-11.5443647795;预,-9.98622016145;下,-9.63482227461;冊,-10.5327638678;貌,-10.4049304963;栏,-10.0974457966;硬,-11.4265817438;邙,-13.6238063212;黑,-8.05546181741;悔,-12.9306591406;齔,-11.6778961721;嬙,-11.8320468519;窘,-12.9306591406;轮,-10.7334345633;璜,-9.512932457;瀟,-8.92332595538;樣,-8.21663454971;袤,-11.6778961721;簧,-13.6238063212;终,-10.0402873827;師,-6.33419579972;集,-8.31060034213;崭,-13.6238063212;堯,-8.19008431762;宮,-6.61801730192;隰,-13.6238063212;喲,-12.5251940325;谷,-7.67838571257;澶,-12.9306591406;謹,-9.512932457;覺,-8.76399391681;撼,-13.6238063212;怿,-13.6238063212;驃,-11.4265817438;郊,-8.87887419281;飄,-10.7905929771;鷺,-9.77365871946;卉,-10.8512175989;籍,-8.91427611986;之,-5.85696578409;蕴,-10.0684582597;浍,-13.6238063212;鏢,-11.5443647795;村,-6.69919392512;打,-10.4457524908;慕,-10.3657097832;鱗,-9.86260620548;孙,-6.57715904332;芥,-11.4265817438;姚,-7.91007351566;镝,-12.0143684087;瓜,-10.679367342;鏞,-10.5792838834;詣,-12.0143684087;裤,-12.2375119601;摧,-13.6238063212;拨,-9.86260620548;幫,-9.29307298089;自,-8.41432016833;衣,-9.25435846871;硯,-9.75260531027;篮,-11.2259110484;碩,-8.47051472668;闲,-9.96024467504;兵,-5.93810325994;烴,-10.7905929771;館,-9.16945902492;櫸,-12.9306591406;虻,-13.6238063212;錠,-13.6238063212;恿,-12.5251940325;釔,-13.6238063212;开,-8.23473459136;鮃,-12.2375119601;訪,-9.98622016145;墅,-12.5251940325;处,-10.9157561201;喇,-8.87887419281;嘆,-8.66096169091;劉,-7.90022121922;例,-13.6238063212;逊,-6.99974109337;洌,-13.6238063212;規,-8.8116219658;暑,-11.5443647795;莓,-13.6238063212;帖,-9.44941905128;垛,-11.2259110484;砚,-9.75260531027;咝,-13.6238063212;甜,-7.28875206967;熟,-10.1580704184;鈞,-6.38387372985;传,-7.9470525189;氢,-10.6280740476;椤,-12.2375119601;斧,-9.71178331574;芩,-11.3212212282;挨,-11.2259110484;怪,-9.98622016145;岭,-6.86920222168;馳,-9.11294681466;種,-11.2259110484;皱,-10.0128884085;地,-8.25316829305;鎳,-12.2375119601;渲,-12.9306591406;邵,-10.4457524908;鄴,-8.47051472668;狞,-13.6238063212;蒽,-12.5251940325;蔼,-8.85312169671;銑,-11.1388996714;馥,-9.91023425447;繡,-9.88613670289;层,-9.71178331574;磅,-12.5251940325;門,-7.01311027646;濠,-10.6280740476;勉,-9.69198068845;午,-9.13516995144;辛,-8.01067821478;遊,-8.43084947028;鏈,-10.3657097832;材,-8.29108752791;賢,-6.62987334595;惕,-10.6280740476;谏,-8.78752441422;緗,-12.2375119601;脸,-9.54626887727;站,-9.43415157915;存,-8.051652289;矛,-10.4883121052;塚,-12.2375119601;違,-10.679367342;畜,-13.6238063212;營,-6.59383340947;鉞,-9.79516492468;满,-7.41521629508;你,-9.83961668725;诣,-12.0143684087;爺,-5.92396391378;旧,-9.79516492468;择,-10.679367342;快,-10.5327638678;聪,-8.56121128815;峭,-10.9847489916;嵬,-10.679367342;积,-8.6539930216;物,-8.36111613227;右,-9.0388388425;熒,-12.0143684087;郵,-11.5443647795;兴,-6.89517770809;混,-10.291601811;歸,-8.95097748671;菽,-12.0143684087;懿,-7.84925477563;艾,-8.31553862377;币,-11.1388996714;往,-9.56336331063;笃,-10.3657097832;岂,-11.3212212282;堅,-7.25219447394;禄,-7.02666061929;唇,-8.66096169091;皆,-8.4197996341;鈉,-11.1388996714;邊,-8.29593015238;涌,-9.75260531027;檎,-12.9306591406;析,-10.291601811;撒,-9.73198602306;耕,-7.88401340899;崗,-8.12663809588;纖,-10.9847489916;官,-6.91939196621;碚,-10.679367342;吝,-13.6238063212;喜,-7.28344701745;办,-9.79516492468;渡,-8.54240195619;侠,-7.15300681739;欣,-7.64745541187;艰,-12.5251940325;戩,-9.63482227461;推,-9.63482227461;綬,-9.75260531027;夯,-8.72596652122;窮,-11.3212212282;錳,-11.2259110484;钲,-12.2375119601;逵,-6.52708494268;贷,-8.91427611986;溶,-8.34569166194;樹,-7.25905556432;灵,-6.75375290937;搽,-13.6238063212;於,-11.6778961721;愿,-10.679367342;芾,-9.88613670289;繁,-9.86260620548;硅,-12.2375119601;起,-8.35080676261;镇,-6.63079119824;盆,-10.4883121052;鉉,-9.16945902492;又,-9.56336331063;潋,-12.9306591406;烊,-12.9306591406;鸣,-7.65765958205;虑,-10.3657097832;某,-6.217095591;擒,-9.91023425447;恕,-10.0128884085;懔,-12.5251940325;廖,-12.9306591406;败,-9.38969981658;坛,-9.43415157915;磚,-9.44941905128;關,-8.02909494157;秆,-12.9306591406;勞,-9.02868647104;乡,-9.09120682802;俠,-7.15300681739;正,-5.33426683655;波,-6.331469145;桥,-7.1422291919;曦,-8.51786084727;扩,-6.86687393193;鑽,-10.291601811;饼,-11.5443647795;祯,-7.989016718;哲,-8.47051472668;偵,-11.8320468519;燴,-13.6238063212;海,-5.76942511052;件,-11.8320468519;橹,-11.5443647795;澈,-11.2259110484;腿,-11.5443647795;拾,-11.6778961721;
+E,ns:要,-10.7122939464;怀,-10.5497750169;沃,-9.76131765655;羅,-7.16708110681;黨,-8.84502692467;合,-8.8005751621;袋,-12.4468950018;伊,-9.63348428504;琴,-10.8374570894;随,-9.57521537691;崎,-9.04569762014;音,-11.3482827131;遞,-13.5455072905;枕,-12.4468950018;外,-9.01290779731;料,-11.2429221975;辅,-11.4660657488;舊,-9.18879846378;会,-9.22801917693;宝,-10.8374570894;娜,-13.5455072905;洞,-7.43848440272;觉,-12.4468950018;造,-10.3674534601;梓,-11.1476120177;礦,-9.38662420711;薩,-7.00015763013;萨,-7.00015763013;被,-12.4468950018;箭,-13.5455072905;坜,-11.7537478212;熱,-12.1592129293;堰,-8.55507470369;岳,-8.28281710156;茲,-7.83177448496;徵,-9.29701204842;临,-6.53971827121;方,-9.59426357188;永,-11.2429221975;场,-7.0160884522;放,-12.4468950018;泡,-11.4660657488;祠,-9.09115999421;坊,-8.17022888278;母,-11.5995971414;车,-7.94338846959;经,-12.1592129293;济,-8.64766749052;姑,-11.0606006407;桐,-10.7729185682;賓,-6.91614403703;荒,-9.37112002057;祖,-10.048999729;開,-9.32599958529;坚,-13.5455072905;村,-6.78046831369;廟,-7.36549063681;潤,-10.9064499609;凡,-9.26884117145;遠,-8.2127884972;卢,-9.12666668267;查,-11.3482827131;鹘,-7.79930409993;周,-8.90111639132;士,-6.49105763233;坪,-8.36935755789;班,-9.28282741343;扬,-9.53817410523;浮,-10.1443099088;凱,-11.5995971414;恰,-12.8523601099;鳳,-10.2133027803;溫,-11.4660657488;年,-9.96198835201;其,-6.72658322519;达,-6.52889760657;滿,-11.936069378;礁,-10.1782114605;球,-9.83193522376;厂,-8.69347702655;庄,-6.72439981821;切,-10.6010683113;榆,-10.7122939464;沈,-10.3674534601;羊,-8.59674740009;謨,-10.7729185682;趙,-10.4544648371;观,-9.46796984656;应,-9.43463342629;列,-6.97742937905;首,-9.41837290542;崙,-7.90360021953;岘,-12.8523601099;挝,-8.15187974411;芜,-9.41837290542;星,-11.1476120177;颠,-7.84172481581;觀,-9.46796984656;貨,-12.1592129293;倫,-7.72246139498;循,-12.1592129293;邡,-11.3482827131;芬,-11.5995971414;港,-4.81594842091;單,-9.80783767218;礱,-11.2429221975;吳,-7.33893136374;莲,-9.76131765655;張,-8.92053447718;户,-8.2127884972;冶,-8.981159099;紹,-9.53817410523;岸,-10.3674534601;砻,-11.2429221975;螺,-11.936069378;欽,-10.7122939464;罘,-10.7729185682;菱,-13.5455072905;錯,-8.85415940824;饶,-9.24144219726;滄,-10.048999729;則,-9.5565232439;姆,-8.75801554768;哈,-8.42751347805;神,-11.4660657488;筍,-12.8523601099;背,-11.1476120177;契,-13.5455072905;罕,-9.61368165774;仔,-11.3482827131;留,-10.980557933;蓥,-11.4660657488;拜,-5.6070617393;陟,-13.5455072905;州,-3.283716121;惠,-10.3674534601;黄,-9.99015922898;来,-6.86465261168;令,-9.52015559973;牧,-12.8523601099;秦,-9.99015922898;鮮,-5.81621161616;火,-13.5455072905;迪,-9.15105813579;独,-11.7537478212;景,-9.52015559973;淮,-10.9064499609;米,-11.0606006407;史,-12.8523601099;酉,-11.4660657488;围,-11.936069378;基,-7.84506371708;狼,-9.85662783635;广,-13.5455072905;梁,-8.57569399089;脂,-9.06817047599;樂,-7.102967124;弄,-10.5009848527;雞,-8.20796921077;堆,-10.1443099088;翔,-8.774822666;上,-7.09030872713;碑,-11.1476120177;經,-12.1592129293;节,-9.11469049162;井,-8.06071035698;朔,-9.24144219726;栖,-11.1476120177;沙,-6.30270936767;业,-11.3482827131;劝,-11.936069378;牛,-8.85415940824;耆,-7.93237918408;閣,-8.33602113762;顯,-13.5455072905;麥,-6.91218885719;驛,-8.8005751621;岩,-7.24288831472;用,-8.04833906517;阪,-8.72522572486;河,-3.95406281129;侯,-10.1443099088;邱,-12.1592129293;足,-10.4544648371;庵,-10.1782114605;瑟,-12.4468950018;頂,-9.28282741343;甸,-6.90171755732;麗,-8.67797284001;为,-8.2031730385;石,-7.55654587358;吾,-9.99015922898;壁,-8.41560857554;条,-11.3482827131;维,-9.40237256407;雅,-7.65386307864;廠,-8.69347702655;泉,-7.64835342283;效,-12.8523601099;始,-9.80783767218;苍,-11.2429221975;柏,-9.71686589398;郑,-7.83508027309;禹,-13.5455072905;聖,-6.82287749561;峙,-11.4660657488;祥,-9.32599958529;富,-10.6551355326;虚,-10.7122939464;勝,-8.63285240473;孜,-9.16348065579;域,-6.64982459272;隐,-11.936069378;裡,-5.7087425072;树,-7.8930181102;强,-11.7537478212;绥,-11.5995971414;坤,-10.2133027803;寧,-5.77359703403;辽,-8.41560857554;間,-8.38645199125;韦,-8.59674740009;達,-6.52889760657;棱,-13.5455072905;兰,-4.78223557645;色,-9.34081467108;順,-7.51482203021;顶,-9.28282741343;贾,-12.4468950018;矿,-9.38662420711;汾,-8.31439867361;老,-11.7537478212;崃,-10.5009848527;湾,-4.97686081746;清,-8.53487199637;猗,-10.980557933;吉,-8.56877354805;業,-11.3482827131;舍,-10.2496704245;隨,-9.57521537691;們,-10.5497750169;芒,-13.5455072905;帕,-10.7729185682;聯,-5.17010810467;北,-4.53924340709;肖,-13.5455072905;閘,-10.4544648371;亚,-3.92226288128;宜,-11.5995971414;土,-11.7537478212;堡,-6.11480020792;春,-7.04421761993;澤,-8.8005751621;欧,-5.94360533059;邦,-7.87218402329;夫,-7.15694588492;溪,-7.24288831472;陳,-11.1476120177;伯,-6.23095445814;粮,-10.8374570894;報,-11.3482827131;應,-9.43463342629;申,-11.936069378;肅,-6.31277415429;輿,-11.4660657488;撾,-8.15187974411;秀,-12.4468950018;蕃,-7.16031289147;齊,-7.65940325902;久,-12.8523601099;俄,-7.66218490198;升,-11.0606006407;汉,-5.97043559096;克,-5.72546930101;寶,-10.8374570894;前,-8.17953127544;双,-12.4468950018;幌,-11.2429221975;桑,-9.78430717477;姐,-12.8523601099;勒,-7.48638409488;處,-12.8523601099;埔,-8.51506936907;南,-3.57712190635;瑙,-13.5455072905;赶,-12.8523601099;坟,-12.4468950018;群,-9.67430627956;科,-6.56171732521;勢,-12.8523601099;烦,-12.8523601099;摩,-8.40970885342;门,-5.22749701292;盪,-10.9064499609;召,-10.4544648371;杯,-12.1592129293;蓮,-9.76131765655;絳,-11.0606006407;青,-10.5497750169;豆,-11.4660657488;顿,-6.40822885321;歷,-9.90792113074;闸,-10.4544648371;固,-10.111520086;紫,-13.5455072905;板,-9.35585254844;泾,-9.69535968876;宁,-5.77359703403;鎮,-5.84793194366;澗,-10.7729185682;窪,-11.0606006407;涅,-13.5455072905;各,-9.09115999421;茆,-12.4468950018;辉,-10.3674534601;师,-8.90111639132;莫,-11.5995971414;鼎,-13.5455072905;成,-8.03611895384;库,-9.29701204842;椒,-11.3482827131;趕,-12.8523601099;尔,-5.41928476101;灘,-7.8687534882;化,-6.63775201148;龙,-6.57009336301;丘,-7.29167847889;力,-12.8523601099;當,-10.5009848527;沟,-6.59086842559;霞,-10.2496704245;审,-12.8523601099;週,-8.90111639132;魚,-11.0606006407;涇,-9.69535968876;碧,-13.5455072905;錦,-9.65368699236;義,-7.46100787739;陘,-9.5565232439;洪,-9.96198835201;榭,-10.9064499609;莱,-8.26739263124;纳,-6.42183450526;鄲,-7.96577746448;吴,-7.33893136374;月,-12.8523601099;边,-7.66218490198;常,-9.93458937782;町,-10.5497750169;格,-8.08592177632;沿,-12.1592129293;篁,-12.1592129293;所,-7.80250410266;黃,-9.99015922898;眠,-11.0606006407;壇,-8.90111639132;逊,-10.6551355326;陈,-11.1476120177;行,-8.17022888278;坎,-12.4468950018;发,-10.5497750169;仓,-8.2725077319;饒,-9.24144219726;陉,-9.5565232439;棗,-12.1592129293;湘,-8.45791095523;明,-6.79792076364;遜,-10.6551355326;坞,-8.12497229119;廣,-13.5455072905;日,-10.0191467659;学,-12.4468950018;韩,-10.5009848527;浦,-7.46786504712;塬,-12.4468950018;瓯,-9.96198835201;潮,-11.2429221975;篱,-11.7537478212;廳,-9.41837290542;淵,-9.88194564434;培,-12.1592129293;陸,-7.18247918693;勻,-9.80783767218;謀,-11.1476120177;遼,-8.41560857554;松,-9.99015922898;七,-8.29848321831;如,-12.4468950018;紅,-13.5455072905;历,-9.90792113074;眉,-8.88206819635;程,-13.5455072905;越,-8.55507470369;植,-11.0606006407;小,-13.5455072905;美,-6.45626413544;易,-13.5455072905;岔,-11.7537478212;栗,-11.1476120177;掖,-8.56190066876;眙,-9.22801917693;贡,-8.70922538351;玛,-11.1476120177;谟,-10.7729185682;次,-9.71686589398;加,-6.60335058477;縣,-4.06865741127;津,-5.61422252894;粤,-10.9064499609;厦,-9.67430627956;圩,-10.6551355326;暨,-9.99015922898;别,-11.0606006407;鄭,-7.83508027309;微,-13.5455072905;葉,-10.6010683113;阳,-4.33097571387;冲,-8.97079631196;能,-10.2874107524;家,-6.80498793086;源,-7.12388502266;隸,-7.33691726437;嶺,-5.84340295042;酋,-7.97335325829;建,-6.0247308754;廊,-10.980557933;雷,-9.53817410523;密,-7.66777150869;廈,-9.67430627956;橋,-6.48331565818;慶,-5.47023574417;枣,-12.1592129293;屏,-11.5995971414;城,-4.38846221555;腳,-8.26739263124;角,-8.40970885342;絕,-8.13833551901;塗,-10.2133027803;余,-9.35585254844;盘,-11.5995971414;剛,-13.5455072905;郎,-11.2429221975;祝,-12.4468950018;胜,-8.63285240473;江,-3.79546233517;濞,-10.9064499609;卡,-7.55905528518;章,-9.93458937782;略,-10.6010683113;革,-9.34081467108;滨,-7.2576487303;六,-11.4660657488;屯,-8.28281710156;平,-5.7400326652;赵,-10.4544648371;峴,-12.8523601099;遷,-9.76131765655;叶,-10.6010683113;役,-12.1592129293;書,-11.936069378;旺,-10.111520086;嘴,-8.0240463726;屿,-10.1782114605;柔,-9.65368699236;犁,-7.73137675864;匀,-9.80783767218;堂,-7.93970522417;約,-6.06226287439;舆,-11.4660657488;圈,-10.980557933;王,-9.34081467108;萊,-8.26739263124;綏,-11.5995971414;嘎,-10.7729185682;窑,-9.52015559973;递,-13.5455072905;庙,-7.36549063681;長,-10.4544648371;宛,-8.46410292548;條,-11.3482827131;匠,-13.5455072905;垣,-9.24144219726;蘇,-5.59782871916;木,-7.40994239938;宫,-6.8583986826;馆,-7.64287395706;陕,-12.1592129293;闻,-13.5455072905;斯,-4.67892563716;花,-8.70922538351;鄉,-6.87855049804;澳,-9.04569762014;進,-9.52015559973;粵,-10.9064499609;崴,-10.2133027803;冷,-8.25220246574;戶,-8.2127884972;钵,-12.8523601099;番,-7.97335325829;礼,-12.1592129293;显,-13.5455072905;區,-4.36614172279;埃,-7.32293102239;金,-7.87908060235;界,-8.67030996727;婆,-12.8523601099;圍,-11.936069378;友,-12.8523601099;父,-12.8523601099;煌,-7.01317299824;藏,-6.21510207862;虎,-11.0606006407;苑,-8.5482950167;子,-7.61061309485;韓,-10.5009848527;恒,-10.7729185682;法,-10.1443099088;浔,-11.5995971414;風,-8.54156098452;霸,-10.980557933;仙,-11.5995971414;潘,-12.8523601099;黑,-7.76785496724;虞,-9.31140078587;塢,-8.12497229119;哥,-6.09950579214;滩,-7.8687534882;坨,-12.8523601099;汪,-10.6551355326;热,-12.1592129293;公,-10.7729185682;路,-6.10947947411;普,-8.39221569597;狱,-13.5455072905;柳,-12.1592129293;蕴,-11.7537478212;懷,-10.5497750169;曹,-10.8374570894;荣,-10.6551355326;叻,-11.7537478212;壽,-8.16560993693;楼,-7.7106965534;乾,-12.4468950018;威,-6.72986730039;會,-9.22801917693;鋪,-9.24144219726;善,-8.29848321831;嘉,-9.05687092073;笋,-12.8523601099;心,-9.38662420711;阿,-8.59674740009;错,-8.85415940824;弓,-13.5455072905;潯,-11.5995971414;岚,-12.4468950018;思,-12.8523601099;农,-10.5497750169;生,-9.99015922898;亞,-3.92226288128;琛,-11.5995971414;圣,-6.82287749561;营,-7.40346988488;大,-5.82061885114;鹿,-9.80783767218;温,-11.4660657488;輝,-10.3674534601;錫,-7.14691235593;牆,-12.8523601099;砭,-11.936069378;女,-13.5455072905;支,-10.2874107524;皮,-10.980557933;圳,-5.24921017782;雲,-7.18766502396;鐵,-11.7537478212;夷,-8.15187974411;靈,-8.91077830224;丹,-6.09542772066;陵,-6.42183450526;知,-11.4660657488;权,-10.9064499609;居,-9.22801917693;殿,-8.67797284001;奇,-9.1387880432;义,-7.46100787739;迈,-10.2874107524;泊,-8.67030996727;塍,-12.8523601099;凌,-10.6551355326;敏,-9.71686589398;片,-12.1592129293;藺,-12.8523601099;提,-8.82700841917;当,-10.5009848527;賴,-11.1476120177;汕,-9.11469049162;约,-6.06226287439;套,-10.048999729;拖,-12.1592129293;衝,-8.97079631196;荡,-10.9064499609;仞,-12.4468950018;珠,-10.6010683113;壢,-11.7537478212;內,-8.12055727298;歐,-5.94360533059;繩,-9.71686589398;烽,-11.1476120177;卫,-8.82700841917;峪,-10.2133027803;目,-8.42751347805;台,-6.51111936055;棲,-11.1476120177;巴,-7.16708110681;梨,-11.936069378;幹,-7.88951547965;铺,-9.24144219726;臼,-9.61368165774;长,-10.4544648371;图,-8.58968023287;嶁,-12.8523601099;极,-7.21222766233;肃,-6.31277415429;厅,-9.41837290542;皇,-12.8523601099;權,-10.9064499609;龍,-6.57009336301;昌,-5.76478640435;风,-8.54156098452;雙,-12.4468950018;墓,-11.7537478212;園,-6.57759808866;顛,-7.84172481581;店,-7.14359009374;崖,-9.40237256407;盤,-11.5995971414;岛,-4.97306862482;禮,-12.1592129293;依,-10.0191467659;东,-4.12855933582;窟,-8.12940688826;那,-7.06087205483;漢,-5.97043559096;阜,-8.872678456;锦,-9.65368699236;翠,-12.8523601099;瀨,-13.5455072905;賈,-12.4468950018;琳,-11.5995971414;窯,-9.52015559973;央,-13.5455072905;玉,-11.5995971414;墳,-12.4468950018;露,-10.3266314656;康,-7.80250410266;興,-6.3098881494;砂,-12.4468950018;朵,-10.1443099088;治,-8.72522572486;区,-4.36614172279;徽,-6.26687834815;势,-12.8523601099;社,-9.176059438;汀,-9.46796984656;坂,-10.1782114605;騷,-10.9064499609;凉,-9.35585254844;崮,-10.7122939464;蓋,-10.2874107524;乌,-9.03464778395;苏,-5.59782871916;奎,-12.8523601099;跑,-9.80783767218;豐,-6.97742937905;归,-9.57521537691;毕,-10.7729185682;畔,-9.53817410523;赖,-11.1476120177;塘,-7.60533603775;博,-8.64766749052;保,-11.1476120177;楞,-11.936069378;池,-7.40562273824;棣,-11.936069378;形,-9.78430717477;盧,-9.12666668267;敦,-5.85156996496;泰,-8.2031730385;麓,-11.1476120177;街,-6.86968406883;雩,-13.5455072905;穴,-10.2496704245;廷,-7.24839797053;杨,-11.0606006407;發,-10.5497750169;拿,-10.3674534601;咀,-12.1592129293;考,-9.24144219726;瑪,-11.1476120177;茅,-10.2874107524;万,-12.4468950018;疆,-5.72627283661;脉,-6.57665691212;郭,-12.1592129293;谋,-11.1476120177;莊,-6.72439981821;伍,-12.8523601099;二,-12.1592129293;頓,-6.40822885321;鲁,-7.37589655797;阗,-8.24718992392;君,-9.31140078587;定,-6.96071589808;朝,-13.5455072905;府,-7.67338950099;樟,-11.4660657488;雄,-7.8687534882;蔡,-9.57521537691;英,-11.2429221975;連,-6.9361580473;脚,-8.26739263124;护,-10.7729185682;润,-10.9064499609;天,-7.88951547965;墨,-9.45116272824;莪,-12.4468950018;圭,-8.00817302345;京,-3.66744011528;榮,-10.6551355326;洱,-9.78430717477;環,-7.78345590769;農,-10.5497750169;茵,-8.06071035698;珊,-9.43463342629;烈,-9.20170186861;邸,-13.5455072905;缽,-12.8523601099;房,-9.04569762014;禾,-12.4468950018;流,-8.20796921077;賀,-10.0797713877;桃,-13.5455072905;埂,-11.1476120177;獅,-9.90792113074;光,-8.33057153286;洮,-9.34081467108;屋,-8.12055727298;及,-6.00435483533;野,-8.35812148463;道,-7.40132165634;索,-7.75554711957;单,-9.80783767218;歸,-9.57521537691;葛,-10.048999729;揚,-9.53817410523;坝,-7.83177448496;漠,-7.84172481581;牟,-8.33057153286;灣,-4.97686081746;顺,-7.51482203021;步,-11.7537478212;勤,-10.8374570894;湧,-13.5455072905;左,-9.93458937782;煩,-12.8523601099;泽,-8.8005751621;锡,-7.14691235593;杭,-8.82700841917;们,-10.5497750169;良,-9.25504784932;峰,-6.97043144987;穆,-10.048999729;时,-7.04572024981;兹,-7.83177448496;郸,-7.96577746448;寺,-6.47818744181;鳴,-12.8523601099;曼,-7.7283961305;驿,-8.8005751621;臾,-12.1592129293;沁,-9.93458937782;阁,-8.33602113762;市,-3.77389535924;骅,-9.90792113074;欄,-11.0606006407;理,-7.61591814708;維,-9.40237256407;斋,-11.2429221975;樊,-8.61103335734;華,-7.78660551659;宏,-10.7122939464;萬,-12.4468950018;唐,-11.4660657488;蒂,-11.7537478212;投,-10.2874107524;肯,-12.8523601099;得,-8.57569399089;尖,-12.8523601099;墙,-12.8523601099;項,-11.4660657488;刚,-13.5455072905;溝,-6.59086842559;衛,-8.82700841917;原,-4.624717402;岡,-7.79611430456;素,-9.69535968876;报,-11.3482827131;澧,-11.4660657488;墩,-10.8374570894;館,-7.64287395706;隆,-7.02194498432;亭,-9.12666668267;本,-4.13075776523;环,-7.78345590769;岱,-12.1592129293;田,-6.94836158858;甲,-8.00424374531;德,-6.50497090025;蒙,-8.48291225744;马,-4.9478407149;县,-4.06865741127;水,-5.88350973156;铁,-11.7537478212;時,-7.04572024981;绛,-11.0606006407;獄,-13.5455072905;过,-9.06817047599;棠,-13.5455072905;棉,-9.88194564434;奈,-11.2429221975;茶,-11.4660657488;绍,-9.53817410523;過,-9.06817047599;嵐,-12.4468950018;姓,-9.22801917693;答,-9.01290779731;志,-7.30718266543;游,-10.2133027803;蘭,-4.78223557645;绝,-8.13833551901;作,-7.62392887082;察,-11.3482827131;塞,-9.25504784932;峡,-6.60722280645;臣,-9.76131765655;蔺,-12.8523601099;钦,-10.7122939464;壩,-7.83177448496;全,-10.7122939464;旦,-8.40384373396;园,-6.57759808866;可,-11.1476120177;至,-7.7586099091;干,-7.88951547965;部,-9.83193522376;惹,-10.980557933;典,-6.30270936767;藻,-12.8523601099;国,-1.62970673526;潼,-9.40237256407;寿,-8.16560993693;封,-7.33691726437;迁,-9.76131765655;厄,-10.980557933;倉,-8.2725077319;冈,-7.79611430456;洋,-5.28217462303;廬,-10.048999729;民,-8.49565128322;霍,-12.1592129293;覺,-12.4468950018;朗,-6.70603085224;官,-9.21477395018;蘊,-11.7537478212;洛,-8.48926148512;骚,-10.9064499609;丝,-10.5009848527;果,-7.94708533147;增,-10.980557933;甌,-9.96198835201;红,-13.5455072905;別,-11.0606006407;陽,-4.33097571387;黎,-5.70126657232;沭,-12.8523601099;甫,-11.936069378;努,-10.6551355326;中,-5.48876351549;匯,-8.12497229119;邮,-8.81811947175;新,-7.79611430456;菲,-11.5995971414;宴,-11.0606006407;強,-11.7537478212;根,-6.23028890071;丽,-8.67797284001;直,-10.980557933;淀,-9.12666668267;元,-8.60386486786;腊,-5.66319237149;均,-13.5455072905;燈,-10.9064499609;陆,-7.18247918693;盟,-7.33691726437;欣,-12.8523601099;沱,-10.7122939464;闐,-8.24718992392;腓,-11.936069378;雒,-12.8523601099;比,-7.96201098168;罗,-7.16708110681;遙,-10.048999729;臘,-5.66319237149;赛,-8.31439867361;李,-9.80783767218;陝,-12.1592129293;远,-8.2127884972;孟,-12.8523601099;象,-11.4660657488;诺,-8.61103335734;古,-5.13367461471;雀,-13.5455072905;瓦,-7.17560630764;恩,-9.25504784932;臨,-6.53971827121;赫,-11.7537478212;璧,-10.980557933;魯,-7.37589655797;森,-9.99015922898;山,-3.61635199118;关,-5.71389001411;曲,-8.61825360531;鸡,-8.20796921077;島,-4.97306862482;项,-11.4660657488;竺,-8.24718992392;白,-8.26230356173;翼,-12.8523601099;联,-5.17010810467;征,-9.29701204842;邁,-10.2874107524;内,-8.12055727298;安,-5.06104392367;戈,-10.6010683113;皋,-8.774822666;同,-7.19987092964;馬,-4.9478407149;昂,-8.25220246574;岗,-8.00032984599;圖,-8.58968023287;刘,-12.8523601099;多,-7.53179213442;盛,-11.4660657488;悟,-13.5455072905;渠,-9.02371871342;楚,-11.936069378;堤,-10.8374570894;沧,-10.048999729;伦,-7.72246139498;让,-10.7122939464;庫,-9.29701204842;太,-9.25504784932;断,-10.3266314656;漳,-9.69535968876;梯,-11.1476120177;都,-5.33783286611;丰,-6.97742937905;劳,-11.0606006407;洲,-3.78820224811;場,-7.0160884522;買,-8.93038677363;脈,-6.57665691212;容,-9.90792113074;麻,-12.1592129293;非,-6.08042455407;施,-9.26884117145;尼,-7.20514798674;连,-6.9361580473;翁,-10.5009848527;陀,-8.64023251203;渊,-9.88194564434;哇,-8.39221569597;杆,-9.80783767218;隍,-9.11469049162;滋,-10.048999729;楊,-11.0606006407;烏,-9.03464778395;华,-7.78660551659;濑,-13.5455072905;乐,-7.102967124;燕,-12.8523601099;塔,-8.35255043958;泗,-13.5455072905;靖,-9.1387880432;托,-8.79191709936;四,-8.73332293509;党,-8.84502692467;川,-5.15002985773;鼻,-9.96198835201;信,-11.7537478212;邑,-8.92053447718;畢,-10.7729185682;灤,-9.176059438;糧,-10.8374570894;坦,-6.30127977486;審,-12.8523601099;武,-8.32515146539;籬,-11.7537478212;磯,-8.0987699188;涼,-9.35585254844;柱,-11.1476120177;买,-8.93038677363;宿,-11.3482827131;底,-8.58968023287;粒,-12.1592129293;鱼,-11.0606006407;輔,-11.4660657488;省,-4.16407484365;浪,-10.3674534601;林,-5.68763973113;來,-6.86465261168;下,-8.55507470369;崍,-10.5009848527;和,-7.51242106867;栏,-11.0606006407;莎,-9.96198835201;休,-10.4544648371;庐,-10.048999729;樓,-7.7106965534;賽,-8.31439867361;餘,-9.35585254844;嘛,-11.936069378;渭,-13.5455072905;鲜,-5.81621161616;益,-10.7122939464;淄,-8.67797284001;濱,-7.2576487303;渚,-9.85662783635;陰,-7.47476956246;窝,-10.3266314656;師,-8.90111639132;集,-8.59674740009;绳,-9.71686589398;宮,-6.8583986826;晉,-10.8374570894;絲,-10.5009848527;谷,-7.7077768433;架,-9.67430627956;茹,-13.5455072905;主,-12.1592129293;禺,-8.38645199125;蒼,-11.2429221975;宾,-6.91614403703;什,-7.41863810635;充,-9.21477395018;汇,-8.12497229119;草,-12.8523601099;院,-7.85853193413;晋,-10.8374570894;顏,-12.1592129293;車,-7.94338846959;坑,-9.59426357188;打,-11.1476120177;慕,-13.5455072905;麦,-6.91218885719;汗,-6.8621463447;孙,-9.29701204842;高,-12.4468950018;虛,-10.7122939464;姚,-8.5482950167;嵝,-12.8523601099;瓜,-8.99163039887;坡,-6.30056574413;因,-11.2429221975;奥,-11.0606006407;壤,-8.70132020401;迦,-10.2496704245;自,-10.4100130745;蓬,-9.10285603398;灯,-10.9064499609;寮,-11.1476120177;東,-4.12855933582;極,-7.21222766233;矶,-8.0987699188;勸,-11.936069378;登,-8.70132020401;桿,-9.80783767218;开,-9.32599958529;梅,-9.43463342629;处,-12.8523601099;文,-8.82700841917;昆,-12.4468950018;劉,-12.8523601099;庭,-8.15187974411;律,-8.82700841917;盖,-10.2874107524;陡,-12.8523601099;布,-7.9107176873;福,-7.72542436011;第,-10.8374570894;云,-7.18766502396;朐,-10.5009848527;讓,-10.7122939464;涂,-10.2133027803;濟,-8.64766749052;香,-11.7537478212;世,-8.84502692467;辛,-11.2429221975;通,-7.42520987152;坛,-8.90111639132;熟,-8.54156098452;张,-8.92053447718;鎣,-11.4660657488;蟠,-11.936069378;肥,-7.589669921;涧,-10.7729185682;窩,-10.3266314656;茨,-8.80930884207;里,-5.7087425072;堪,-11.5995971414;岭,-5.84340295042;隱,-11.936069378;地,-6.22829488211;邵,-12.8523601099;头,-6.85590802129;斷,-10.3266314656;回,-11.7537478212;沽,-8.33602113762;洼,-11.0606006407;爾,-5.41928476101;仁,-9.53817410523;址,-10.6010683113;襄,-9.7388448007;門,-5.22749701292;忠,-12.8523601099;拉,-6.35107043937;納,-6.42183450526;韋,-8.59674740009;遊,-10.2133027803;正,-11.1476120177;郡,-8.3470102592;扎,-10.4100130745;仑,-7.90360021953;齐,-7.65940325902;壕,-12.4468950018;氏,-11.3482827131;旗,-7.52935013077;湖,-5.09189308069;站,-8.46410292548;遥,-10.048999729;进,-9.52015559973;浜,-10.7122939464;營,-7.40346988488;满,-11.936069378;杠,-12.1592129293;口,-5.63454990762;蕪,-9.41837290542;奧,-11.0606006407;旧,-9.18879846378;书,-11.936069378;嫩,-8.47033347523;獨,-11.7537478212;潭,-7.84172481581;凯,-11.5995971414;郵,-8.81811947175;兴,-6.3098881494;巷,-10.1443099088;陶,-10.980557933;竹,-8.47033347523;學,-12.4468950018;尾,-8.40970885342;峽,-6.60722280645;孫,-9.29701204842;丁,-11.0606006407;節,-9.11469049162;沂,-8.61103335734;堅,-13.5455072905;禄,-11.4660657488;庆,-5.47023574417;莞,-7.6511044562;國,-1.62970673526;邊,-7.66218490198;名,-9.1387880432;涌,-13.5455072905;夏,-6.91878954122;陂,-9.88194564434;徐,-11.936069378;聞,-13.5455072905;撒,-8.78333335567;崗,-8.00032984599;则,-9.5565232439;厘,-9.02371871342;望,-11.1476120177;肚,-9.96198835201;喜,-10.2874107524;感,-9.29701204842;阴,-7.47476956246;渡,-9.07959917181;匣,-9.20170186861;貢,-8.70922538351;货,-12.1592129293;度,-4.71759932749;利,-5.0128345282;護,-10.7729185682;末,-9.52015559973;恆,-10.7729185682;颜,-12.1592129293;辰,-11.5995971414;隶,-7.33691726437;樹,-7.8930181102;圻,-9.69535968876;為,-8.2031730385;落,-12.8523601099;嶼,-10.1782114605;间,-8.38645199125;贺,-10.0797713877;驊,-9.90792113074;起,-8.5482950167;镇,-5.84793194366;盆,-9.24144219726;齋,-11.2429221975;郊,-8.60386486786;鸣,-12.8523601099;峒,-10.6010683113;頭,-6.85590802129;他,-9.02371871342;牙,-5.40606676859;佛,-9.71686589398;棚,-12.4468950018;關,-5.71389001411;勞,-11.0606006407;乡,-6.87855049804;埠,-8.82700841917;季,-13.5455072905;波,-6.92944210533;桥,-6.48331565818;凤,-10.2133027803;滦,-9.176059438;寨,-7.12714235453;槓,-12.1592129293;狮,-9.90792113074;翰,-9.63348428504;灵,-8.91077830224;西,-4.05435841498;海,-3.49437589602;延,-12.1592129293;特,-6.10184360735;司,-9.50245602263;坻,-10.7729185682;鶻,-7.79930409993;祿,-11.4660657488;諾,-8.61103335734;
+E,nt:璃,-7.16923381023;厅,-5.73235395232;安,-8.50046839417;專,-10.4463785432;事,-9.19361557473;馬,-8.94230114645;院,-2.53340632317;门,-10.4463785432;園,-11.1395257238;尔,-6.08327991843;店,-6.98064264042;化,-7.15054167722;药,-6.03965929596;力,-7.84368885778;会,-2.60252990507;东,-7.06198827988;聯,-5.88725229574;礦,-8.50046839417;輪,-7.7055385193;央,-3.67903541796;舰,-8.83694063079;纳,-8.83694063079;貿,-9.34776625455;場,-9.19361557473;师,-7.04518116156;方,-8.74163045098;券,-4.70337535541;区,-5.01047551372;线,-8.50046839417;派,-10.4463785432;局,-3.20895986955;際,-6.18369866618;旅,-9.75323136266;連,-9.19361557473;织,-4.10778446502;商,-9.19361557473;立,-9.75323136266;乌,-9.34776625455;烏,-9.34776625455;华,-7.7722298938;发,-6.65088935405;乐,-10.4463785432;酒,-7.45064626967;塔,-10.4463785432;藥,-6.03965929596;党,-3.452445568;藝,-9.0600841821;盟,-5.5300539286;信,-5.90308376095;代,-9.34776625455;工,-7.96147189343;学,-2.3401656406;科,-8.43147552268;器,-6.79572030193;腦,-7.84368885778;马,-8.94230114645;潮,-7.84368885778;菱,-10.0409134351;廳,-5.73235395232;署,-6.67361760513;廷,-11.1395257238;慶,-9.19361557473;系,-6.50479673555;館,-5.27873950032;發,-6.65088935405;气,-6.2567238012;省,-6.83546063058;技,-7.52860781114;球,-9.53008781135;厂,-5.88203035175;馆,-5.27873950032;社,-3.70526834165;下,-11.1395257238;納,-8.83694063079;小,-10.4463785432;美,-9.19361557473;脑,-7.84368885778;源,-9.34776625455;专,-10.4463785432;排,-8.65461907399;路,-7.11417403305;視,-8.19508674462;轮,-7.7055385193;府,-2.56500746575;星,-10.0409134351;氣,-6.2567238012;通,-5.66306217185;津,-9.0600841821;纤,-9.0600841821;厦,-7.61316519917;天,-9.19361557473;动,-8.83694063079;師,-7.04518116156;议,-7.33286323401;阳,-9.75323136266;網,-7.7722298938;电,-7.64301816232;谷,-7.22750271835;運,-9.19361557473;达,-6.60692623063;籃,-8.83694063079;组,-9.19361557473;视,-8.19508674462;光,-9.75323136266;廈,-7.61316519917;手,-9.19361557473;车,-6.30324381683;网,-7.7722298938;廣,-10.4463785432;教,-8.04848327042;牛,-9.75323136266;線,-8.50046839417;電,-7.64301816232;行,-1.98269161933;连,-9.19361557473;廠,-5.88203035175;空,-7.09647445595;运,-9.19361557473;国,-3.81043198754;鑫,-8.94230114645;業,-5.87683553488;息,-8.14379345023;篮,-8.83694063079;東,-7.06198827988;泰,-9.0600841821;险,-7.92064989891;兵,-6.90541921918;組,-9.19361557473;用,-5.95774217349;役,-10.4463785432;處,-6.31924415818;鋼,-8.19508674462;广,-10.4463785432;體,-6.14231345002;堂,-7.24770542567;处,-6.31924415818;宇,-10.4463785432;順,-9.19361557473;訊,-5.77823355807;范,-11.1395257238;递,-7.96147189343;投,-8.09500328606;讯,-5.77823355807;林,-8.43147552268;團,-3.58519090006;军,-3.43742138373;业,-5.87683553488;原,-8.24915396589;樂,-10.4463785432;报,-6.26432840058;田,-6.13557941784;木,-11.1395257238;航,-7.58417766229;庭,-7.73832834212;斯,-10.0409134351;强,-6.84906628263;足,-9.34776625455;德,-10.4463785432;達,-6.60692623063;油,-8.50046839417;贸,-9.34776625455;县,-10.4463785432;爾,-6.08327991843;區,-5.01047551372;埃,-7.33286323401;獄,-10.4463785432;棉,-10.0409134351;顺,-9.19361557473;構,-7.80732121361;軍,-3.43742138373;藏,-8.50046839417;所,-3.82430733403;子,-7.09647445595;動,-8.83694063079;協,-5.07574051509;旗,-9.19361557473;聖,-8.30631237973;站,-6.27199127333;遞,-7.96147189343;场,-9.19361557473;泥,-7.07908271324;艦,-8.83694063079;能,-8.65461907399;黨,-3.452445568;园,-11.1395257238;樓,-11.1395257238;華,-7.7722298938;狱,-10.4463785432;議,-7.33286323401;兴,-8.36693700154;部,-2.74201737531;學,-2.3401656406;眾,-6.20505179065;份,-6.53435553779;楼,-11.1395257238;矿,-8.50046839417;門,-10.4463785432;會,-2.60252990507;节,-9.75323136266;興,-8.36693700154;构,-7.80732121361;庆,-9.19361557473;國,-3.81043198754;隊,-3.97171653947;心,-5.18628238949;景,-9.34776625455;众,-6.20505179065;纖,-9.0600841821;金,-8.30631237973;办,-7.84368885778;校,-5.46620245661;圣,-8.30631237973;钢,-8.19508674462;室,-7.04518116156;大,-5.85632199504;邦,-5.11850237443;利,-9.75323136266;險,-7.92064989891;中,-7.20770009106;队,-3.97171653947;報,-6.26432840058;速,-9.0600841821;強,-6.84906628263;政,-9.75323136266;節,-9.75323136266;际,-6.18369866618;範,-11.1395257238;克,-6.40332727539;車,-6.30324381683;縣,-10.4463785432;协,-5.07574051509;胎,-7.7722298938;虹,-5.96337599121;体,-6.14231345002;展,-5.23416387573;委,-4.08421288044;拖,-11.1395257238;關,-6.65088935405;珠,-7.7055385193;正,-10.4463785432;团,-3.58519090006;货,-8.19508674462;材,-8.57457636632;物,-5.26740793431;艺,-9.0600841821;辦,-7.84368885778;联,-5.88725229574;山,-8.83694063079;台,-5.34346797302;关,-6.65088935405;陵,-8.50046839417;貨,-8.19508674462;特,-9.75323136266;司,-3.32512608998;汽,-10.0409134351;陽,-9.75323136266;織,-4.10778446502;
+E,nz:挂,-11.9181172024;谈,-7.92913315582;伊,-9.27905987277;茂,-9.21006700128;抗,-10.1263577332;料,-6.9276846156;萘,-11.9181172024;贞,-8.69924137751;璣,-9.97220705333;錢,-9.35316784492;礦,-7.54866934992;河,-5.49975226645;临,-11.2249700218;然,-11.2249700218;吸,-9.72089262505;场,-11.9181172024;线,-5.61366839996;談,-7.92913315582;珍,-11.2249700218;牌,-6.80612941403;盏,-9.97220705333;科,-4.83305290843;筒,-10.8195049137;織,-7.0353152798;苗,-11.9181172024;话,-10.1263577332;遠,-6.61481229432;铣,-9.97220705333;卢,-11.9181172024;罪,-7.19072938367;扬,-10.8195049137;酶,-9.14552848014;绿,-10.8195049137;覆,-9.43321055259;辊,-10.5318228413;引,-10.8195049137;应,-8.36276914089;厢,-8.00609419695;鲨,-9.35316784492;芬,-10.8195049137;是,-8.42160964092;鈷,-11.2249700218;頻,-9.43321055259;鸿,-11.9181172024;视,-10.8195049137;運,-7.68401069779;录,-8.97367822322;黔,-8.69924137751;酸,-6.20108950098;教,-3.12450513079;衛,-7.46376990613;盤,-8.22923774827;秦,-10.8195049137;景,-9.72089262505;基,-6.3459631702;广,-5.61733140772;醋,-8.58591269221;劍,-7.66962196033;碑,-8.82707474902;經,-6.45428539736;底,-10.3086792899;蒙,-9.97220705333;鉛,-8.5508213724;閣,-8.45238129958;岩,-7.69860949721;鴨,-9.08490385833;伴,-11.9181172024;笼,-11.9181172024;簾,-10.3086792899;框,-9.8386756607;泉,-5.37276754205;聖,-7.69860949721;虚,-11.2249700218;譜,-9.27905987277;濟,-7.2931443891;汞,-9.43321055259;坤,-9.27905987277;寧,-6.43332026889;絨,-8.82707474902;柯,-9.21006700128;淳,-10.3086792899;轴,-7.85767419184;号,-6.58539840912;偶,-11.2249700218;膀,-10.8195049137;节,-9.35316784492;帕,-10.8195049137;貞,-8.69924137751;冠,-10.3086792899;锣,-11.9181172024;脫,-11.9181172024;纪,-6.28332759921;皺,-9.52022192958;精,-7.27372630324;柄,-10.5318228413;汉,-6.91417089644;克,-4.62987280136;車,-7.65543732534;前,-11.9181172024;双,-11.9181172024;塑,-8.74006337203;翔,-8.33459826393;軸,-7.85767419184;勢,-9.21006700128;杯,-6.80012338997;蓮,-10.3086792899;卷,-7.94782528883;固,-9.08490385833;齿,-9.8386756607;脂,-8.66002066436;辉,-9.43321055259;库,-6.28332759921;砂,-10.3086792899;尔,-5.13140025178;伞,-10.3086792899;閥,-9.27905987277;符,-8.30719928974;義,-5.72167307459;褲,-10.1263577332;水,-6.52448965603;砼,-11.2249700218;菁,-9.72089262505;所,-7.92913315582;旅,-10.1263577332;结,-11.9181172024;鏡,-6.47137983072;銑,-9.97220705333;呤,-11.9181172024;学,-7.45220908373;鸽,-9.97220705333;臭,-10.5318228413;烷,-7.14743257792;鍶,-10.5318228413;陸,-7.27372630324;硼,-9.8386756607;技,-5.93923143748;憂,-6.87469208546;标,-11.9181172024;班,-7.46376990613;越,-7.10593284701;吏,-11.2249700218;袜,-11.2249700218;氟,-11.9181172024;辞,-8.45238129958;加,-6.39266426325;锥,-8.97367822322;缩,-9.8386756607;晃,-9.97220705333;配,-9.35316784492;城,-7.77498247599;江,-5.99922334811;连,-10.1263577332;卡,-7.74372993249;陣,-10.8195049137;實,-8.11145471261;彩,-7.47546594589;黨,-7.87506593455;扫,-10.8195049137;乳,-7.07393011592;叶,-7.89276551165;相,-7.94782528883;争,-3.80528972363;王,-4.99350480633;谊,-6.73073139654;嘎,-11.2249700218;窑,-7.72846246036;粕,-9.02774544449;純,-9.72089262505;帮,-10.8195049137;條,-9.72089262505;錠,-9.08490385833;垣,-11.9181172024;锤,-11.9181172024;禧,-8.78262298645;缨,-11.2249700218;莫,-10.3086792899;斯,-4.94551095108;澳,-10.8195049137;贴,-10.1263577332;制,-7.13899370927;霸,-7.80724333821;礼,-6.45005706125;友,-7.53609056771;子,-5.42587736736;硒,-10.8195049137;糕,-10.3086792899;毛,-9.35316784492;裝,-8.08947580589;哥,-7.69860949721;普,-7.37482242011;議,-6.0950713069;泵,-9.72089262505;壽,-9.97220705333;饼,-11.9181172024;會,-4.73424648732;三,-7.51139795512;册,-11.2249700218;弓,-7.5873838621;榜,-11.9181172024;亞,-5.0807843877;圣,-7.69860949721;大,-5.16351310289;支,-7.68401069779;记,-6.86187139703;状,-5.66621331922;鬻,-11.9181172024;鴿,-9.97220705333;权,-8.13392756846;义,-5.72167307459;迈,-11.9181172024;银,-5.39162234281;凌,-10.8195049137;問,-7.23598597526;鎢,-9.8386756607;展,-6.9276846156;衝,-9.72089262505;叠,-9.52022192958;督,-11.9181172024;奧,-8.42160964092;繩,-8.66002066436;話,-10.1263577332;佳,-7.9668734838;具,-10.1263577332;铺,-9.21006700128;權,-8.13392756846;依,-7.28338821415;东,-7.4407803879;那,-8.42160964092;座,-6.96229014478;芯,-10.8195049137;氰,-11.9181172024;梳,-10.3086792899;锶,-10.5318228413;熹,-9.02774544449;逸,-11.9181172024;区,-7.48730040354;徽,-8.45238129958;夾,-11.9181172024;杂,-10.3086792899;浆,-11.2249700218;壓,-7.35376901091;齒,-9.8386756607;保,-6.81825077456;面,-8.51691982072;鉤,-8.78262298645;继,-9.52022192958;苯,-8.58591269221;深,-10.5318228413;雷,-11.9181172024;啶,-11.9181172024;選,-9.72089262505;系,-7.26415685223;鍺,-11.9181172024;繼,-9.52022192958;變,-5.82004292022;圍,-11.2249700218;頓,-8.92238492883;輝,-9.43321055259;锡,-9.72089262505;英,-6.64000254315;連,-10.1263577332;天,-5.91670232442;風,-7.22676932015;音,-6.80612941403;農,-6.08330646532;稿,-9.8386756607;禾,-9.35316784492;蓀,-9.08490385833;苄,-8.92238492883;野,-8.87359476466;體,-6.62985017169;揚,-10.8195049137;機,-5.90930401694;灣,-8.66002066436;勤,-9.8386756607;磨,-11.2249700218;良,-8.11145471261;泰,-4.22145012086;兹,-8.51691982072;罕,-8.66002066436;类,-7.68401069779;穿,-11.9181172024;昂,-8.87359476466;開,-9.8386756607;訊,-3.54156634077;笔,-9.72089262505;林,-4.66111449529;涛,-11.9181172024;钡,-9.97220705333;館,-8.97367822322;本,-11.2249700218;串,-10.8195049137;点,-8.92238492883;刺,-11.9181172024;豆,-9.21006700128;棉,-9.72089262505;結,-11.9181172024;答,-11.2249700218;院,-5.90685002798;卤,-11.9181172024;忧,-6.87469208546;壩,-9.97220705333;華,-3.66306829963;槳,-9.61553210939;薩,-11.2249700218;價,-6.55214118736;典,-10.8195049137;寿,-9.97220705333;陀,-8.82707474902;榈,-9.27905987277;炎,-7.84057975848;朗,-9.43321055259;洛,-9.35316784492;丝,-8.11145471261;澜,-9.14552848014;窪,-10.5318228413;蘭,-6.31231513609;谱,-9.27905987277;亲,-10.8195049137;鴻,-11.9181172024;帽,-8.69924137751;墾,-10.8195049137;韌,-10.5318228413;郎,-10.8195049137;屑,-9.61553210939;绒,-8.82707474902;烏,-8.74006337203;臘,-10.5318228413;赛,-7.75923411902;华,-3.66306829963;九,-9.8386756607;远,-6.61481229432;团,-7.32299735225;古,-10.3086792899;药,-6.47137983072;滲,-9.8386756607;鹿,-7.37482242011;瓶,-10.8195049137;勺,-10.5318228413;鹽,-7.36424031078;翼,-9.02774544449;飾,-10.5318228413;漆,-8.4841299979;計,-7.87506593455;同,-9.8386756607;战,-4.1415821742;產,-11.9181172024;太,-5.91423013528;肯,-9.21006700128;丰,-5.42587736736;洲,-7.66962196033;券,-7.05058275193;麻,-9.72089262505;尼,-6.35359679506;資,-8.00609419695;楊,-7.87506593455;像,-11.2249700218;獎,-4.98957938422;塔,-7.02027740243;托,-9.97220705333;距,-8.15691708669;频,-9.43321055259;篩,-10.1263577332;俱,-10.3086792899;瓷,-7.77498247599;鱼,-7.45220908373;蚀,-7.57431178053;來,-8.42160964092;和,-4.93432723712;透,-6.97647477977;膚,-10.8195049137;贝,-8.82707474902;蠟,-9.43321055259;鈣,-8.22923774827;簧,-11.9181172024;液,-7.08183529543;汇,-7.80724333821;證,-7.65543732534;网,-5.10138132179;麦,-9.61553210939;著,-10.8195049137;坡,-9.21006700128;因,-8.97367822322;烤,-10.3086792899;虫,-7.80724333821;蓬,-10.8195049137;聯,-5.95453785876;顿,-8.92238492883;掃,-10.8195049137;誉,-9.72089262505;型,-6.55682503667;锌,-9.52022192958;熏,-9.72089262505;斗,-9.97220705333;芙,-10.3086792899;貝,-8.82707474902;带,-8.30719928974;辆,-11.9181172024;播,-9.72089262505;喷,-8.28053104266;雞,-9.43321055259;杀,-9.27905987277;界,-6.86187139703;量,-7.91078401715;黑,-9.02774544449;罐,-9.8386756607;奔,-11.9181172024;旗,-9.43321055259;进,-7.20858700107;聚,-8.97367822322;坠,-10.1263577332;口,-9.08490385833;煤,-10.3086792899;拦,-11.9181172024;陶,-10.5318228413;卸,-9.14552848014;翻,-8.62228033638;姿,-10.3086792899;者,-7.65543732534;國,-6.58539840912;名,-9.97220705333;粒,-11.9181172024;輛,-11.9181172024;語,-3.54641231772;钢,-7.82377264016;紧,-8.87359476466;约,-9.8386756607;斬,-11.9181172024;辰,-8.39175667777;為,-7.51139795512;委,-10.3086792899;敗,-11.9181172024;殺,-9.27905987277;佛,-9.02774544449;健,-8.62228033638;凤,-9.02774544449;寨,-8.30719928974;乱,-9.27905987277;长,-8.5508213724;長,-8.5508213724;特,-5.56723148567;司,-11.9181172024;盾,-10.5318228413;籽,-11.9181172024;祿,-9.8386756607;沃,-6.48003789346;脆,-10.1263577332;箍,-10.1263577332;会,-4.73424648732;舜,-11.2249700218;晚,-8.04691619147;焦,-9.97220705333;被,-9.52022192958;茲,-8.51691982072;强,-8.45238129958;见,-11.9181172024;血,-8.92238492883;藉,-11.2249700218;经,-6.45428539736;金,-5.60456915611;孢,-8.51691982072;鹤,-8.97367822322;坪,-9.97220705333;语,-3.54641231772;浮,-10.1263577332;聰,-8.78262298645;柵,-11.9181172024;奶,-7.80724333821;鷹,-7.79098281734;调,-7.21763683659;鐓,-11.2249700218;視,-10.8195049137;星,-4.56760103055;餡,-10.5318228413;客,-9.52022192958;纤,-9.08490385833;饰,-10.5318228413;钨,-9.8386756607;港,-7.74372993249;脱,-11.9181172024;莲,-10.3086792899;騷,-11.2249700218;岸,-11.9181172024;阿,-10.8195049137;扇,-10.8195049137;筍,-10.8195049137;鹏,-8.5508213724;浙,-7.66962196033;號,-6.58539840912;剧,-9.08490385833;衫,-9.35316784492;湯,-7.74372993249;菲,-10.1263577332;婷,-8.36276914089;狼,-8.82707474902;梁,-9.21006700128;樂,-6.68700858553;昊,-10.1263577332;傑,-11.9181172024;間,-10.3086792899;划,-7.51139795512;沙,-7.33314972371;业,-5.1246510698;芝,-8.51691982072;纥,-7.20858700107;钩,-8.78262298645;用,-6.90748190829;氮,-8.42160964092;戲,-9.43321055259;滅,-11.9181172024;恆,-11.9181172024;蓉,-11.2249700218;效,-11.2249700218;始,-7.69860949721;酐,-8.13392756846;雕,-10.8195049137;诗,-11.2249700218;緣,-9.61553210939;腰,-11.9181172024;色,-9.8386756607;击,-9.61553210939;矿,-7.54866934992;清,-11.2249700218;指,-5.67007432787;式,-5.70952717629;魚,-7.45220908373;息,-7.9668734838;袖,-8.82707474902;愛,-10.8195049137;亚,-5.0807843877;期,-7.51139795512;堡,-7.98629156966;帥,-10.5318228413;群,-11.2249700218;邦,-6.76482560788;伯,-7.30299668554;尹,-9.35316784492;綸,-8.1804475841;纺,-9.02774544449;钾,-7.92913315582;觀,-6.28332759921;葉,-7.89276551165;富,-5.62100788245;镓,-9.27905987277;勒,-5.78471915939;菜,-9.97220705333;门,-7.31294701639;雪,-10.8195049137;泮,-11.2249700218;柴,-8.30719928974;建,-7.68401069779;链,-10.1263577332;言,-8.92238492883;涅,-9.72089262505;馍,-8.36276914089;鼎,-7.92913315582;玑,-9.97220705333;爐,-8.20454513568;丘,-9.97220705333;管,-7.46376990613;夢,-6.66062183035;錦,-11.2249700218;莱,-9.35316784492;戰,-4.1415821742;脲,-11.9181172024;羹,-11.9181172024;銻,-10.3086792899;鞋,-9.27905987277;眾,-10.8195049137;证,-7.65543732534;捆,-11.9181172024;立,-7.53609056771;发,-4.92143571421;兒,-7.56140837569;乘,-6.3159983815;绣,-9.52022192958;工,-7.12232665679;層,-9.97220705333;僧,-7.08183529543;器,-5.44422650603;镦,-11.2249700218;衬,-10.3086792899;潮,-9.61553210939;菱,-6.04882028925;磷,-8.5508213724;七,-10.1263577332;有,-7.71342458299;程,-7.28338821415;美,-5.58661535249;殖,-9.08490385833;鸣,-9.97220705333;粤,-11.2249700218;厦,-10.5318228413;氯,-7.89276551165;家,-6.18801741941;纸,-6.67109313022;嶺,-8.36276914089;炼,-9.14552848014;观,-6.28332759921;籠,-11.9181172024;杉,-7.46376990613;屏,-10.8195049137;翎,-10.5318228413;狐,-6.66062183035;胜,-7.77498247599;章,-9.97220705333;幣,-11.2249700218;革,-8.66002066436;雨,-9.08490385833;橫,-9.61553210939;嗪,-11.2249700218;業,-5.1246510698;寶,-5.38723957466;役,-6.13121982102;鉻,-10.3086792899;鷺,-11.9181172024;月,-7.05830479802;萊,-9.35316784492;劑,-6.45853168824;錐,-8.97367822322;掛,-11.9181172024;肝,-11.9181172024;粥,-10.3086792899;鈦,-9.8386756607;梭,-9.61553210939;花,-6.64511764382;纹,-8.42160964092;缸,-8.33459826393;濃,-10.5318228413;桂,-10.5318228413;资,-8.00609419695;曉,-9.61553210939;仙,-9.61553210939;锑,-10.3086792899;鳥,-10.8195049137;瑪,-8.78262298645;路,-4.93711146166;拱,-9.72089262505;聲,-8.20454513568;都,-6.84921300016;百,-7.05830479802;笋,-10.8195049137;圓,-8.92238492883;呂,-10.5318228413;吕,-10.5318228413;丙,-11.9181172024;思,-9.43321055259;膜,-7.75923411902;銦,-9.97220705333;夷,-7.94782528883;筋,-9.61553210939;擊,-9.61553210939;額,-7.51139795512;剑,-7.66962196033;論,-9.02774544449;乙,-11.9181172024;內,-6.27267030474;幹,-8.82707474902;卻,-10.5318228413;畿,-7.27372630324;图,-6.96229014478;鈀,-11.9181172024;龍,-5.08400846357;希,-8.02629690427;園,-9.14552848014;禮,-6.45005706125;锦,-11.2249700218;辭,-8.45238129958;康,-6.82436700158;禹,-6.57578295042;钻,-10.8195049137;势,-9.21006700128;汀,-8.92238492883;蛇,-11.9181172024;靠,-11.9181172024;應,-8.36276914089;青,-8.87359476466;屠,-9.72089262505;形,-8.5508213724;盧,-11.9181172024;啦,-10.8195049137;纓,-11.2249700218;想,-8.5508213724;矽,-8.42160964092;發,-4.92143571421;洁,-9.21006700128;脉,-8.69924137751;莊,-8.36276914089;唑,-8.66002066436;垒,-10.1263577332;渗,-9.8386756607;舟,-7.66962196033;紡,-9.02774544449;鬥,-9.97220705333;储,-8.58591269221;氫,-9.72089262505;京,-5.7015111013;榮,-10.3086792899;光,-5.60456915611;夹,-11.9181172024;流,-10.1263577332;桃,-9.27905987277;屋,-8.15691708669;菊,-11.9181172024;道,-6.86826119513;诚,-9.52022192958;曜,-11.2249700218;絡,-10.1263577332;糠,-11.9181172024;泽,-8.15691708669;蟲,-7.80724333821;寺,-6.99086351723;盼,-11.2249700218;沁,-9.35316784492;肉,-10.1263577332;脈,-8.69924137751;戊,-10.8195049137;宏,-8.92238492883;唐,-5.9805809973;钯,-11.9181172024;岡,-9.21006700128;素,-6.81217172848;琦,-10.5318228413;亭,-7.87506593455;讯,-3.54156634077;膳,-9.8386756607;德,-6.13429202005;瀾,-9.14552848014;雾,-10.8195049137;慈,-11.9181172024;動,-5.23977508773;裙,-9.8386756607;聞,-8.11145471261;童,-8.5508213724;韧,-10.5318228413;全,-7.91078401715;佬,-7.85767419184;毯,-9.8386756607;格,-6.58057912268;数,-6.3383873764;部,-7.85767419184;闻,-8.11145471261;空,-7.89276551165;国,-6.58539840912;亂,-9.27905987277;紋,-8.42160964092;把,-7.28338821415;碎,-8.58591269221;向,-8.02629690427;众,-10.8195049137;果,-7.18191875399;綠,-10.8195049137;红,-7.02027740243;室,-7.21763683659;霧,-10.8195049137;中,-6.40066430592;薰,-10.5318228413;強,-8.45238129958;画,-10.5318228413;汁,-8.4841299979;风,-7.22676932015;鑑,-10.8195049137;盒,-9.61553210939;櫚,-9.27905987277;柜,-8.97367822322;瓦,-8.4841299979;赫,-8.69924137751;度,-8.13392756846;森,-7.30299668554;葱,-11.9181172024;島,-8.08947580589;项,-6.84921300016;白,-8.25455555625;一,-9.52022192958;興,-6.65025904332;記,-6.86187139703;肟,-10.8195049137;索,-10.3086792899;妥,-9.8386756607;堤,-10.1263577332;溫,-6.88116459997;梯,-11.9181172024;芳,-10.3086792899;容,-9.43321055259;匾,-11.9181172024;櫃,-8.97367822322;杆,-9.08490385833;腊,-10.5318228413;達,-4.6970121042;藥,-6.47137983072;藝,-8.74006337203;坦,-7.54866934992;柱,-10.8195049137;拳,-8.58591269221;電,-6.05164914545;鑼,-11.9181172024;涂,-10.1263577332;椅,-9.72089262505;納,-6.90748190829;吧,-11.9181172024;垦,-10.8195049137;动,-5.23977508773;绳,-8.66002066436;议,-6.0950713069;钼,-8.97367822322;什,-10.1263577332;草,-7.11409615765;顏,-11.9181172024;盐,-7.36424031078;虛,-11.2249700218;巢,-8.51691982072;祥,-9.02774544449;湫,-9.72089262505;東,-7.4407803879;登,-8.11145471261;梅,-8.08947580589;文,-4.15679802143;律,-9.21006700128;福,-5.75269934815;税,-9.35316784492;頡,-9.08490385833;世,-9.35316784492;鼠,-11.9181172024;锰,-9.52022192958;帶,-8.30719928974;爾,-5.13140025178;仁,-7.42948083265;求,-10.5318228413;装,-8.08947580589;拉,-6.2482362794;湖,-9.35316784492;蓝,-9.21006700128;绡,-11.9181172024;狩,-7.57431178053;杰,-11.9181172024;巷,-9.52022192958;學,-7.45220908373;顺,-5.39749607482;丁,-6.75333122846;栅,-11.9181172024;夏,-9.52022192958;熔,-11.2249700218;洗,-9.97220705333;標,-11.9181172024;望,-7.53609056771;斜,-11.9181172024;感,-10.1263577332;鸡,-9.43321055259;利,-4.64989418122;厨,-8.92238492883;颜,-11.9181172024;纶,-8.1804475841;儿,-7.56140837569;齋,-8.42160964092;橙,-10.5318228413;繡,-9.52022192958;秤,-10.8195049137;物,-7.41830753205;襯,-10.3086792899;致,-9.14552848014;命,-4.65408705948;勾,-11.9181172024;璃,-9.72089262505;貓,-8.66002066436;鐘,-9.8386756607;宝,-5.38723957466;娜,-8.1804475841;麟,-10.5318228413;輪,-7.24528836792;堰,-10.5318228413;岳,-10.5318228413;徵,-9.02774544449;方,-6.25515672225;机,-5.90930401694;派,-8.30719928974;铃,-7.49927659459;濕,-8.87359476466;狗,-10.3086792899;飛,-8.42160964092;统,-8.58591269221;蓣,-8.82707474902;叭,-10.5318228413;鉬,-8.97367822322;雯,-6.11902454792;鳳,-9.02774544449;年,-7.72846246036;苷,-8.87359476466;慶,-7.39632862533;球,-8.20454513568;鎂,-8.97367822322;的,-5.43348196675;馆,-8.97367822322;羊,-9.8386756607;輕,-9.72089262505;五,-9.61553210939;甙,-11.9181172024;鸟,-10.8195049137;貨,-7.37482242011;倫,-8.62228033638;户,-9.8386756607;蒸,-9.52022192958;誼,-6.73073139654;参,-9.43321055259;姆,-8.97367822322;毒,-6.80012338997;鉗,-11.9181172024;州,-6.1099747124;惠,-8.1804475841;来,-8.42160964092;浩,-10.8195049137;注,-7.37482242011;火,-8.97367822322;迪,-5.7015111013;问,-7.23598597526;声,-8.20454513568;米,-9.97220705333;维,-6.36515761746;譽,-9.72089262505;湿,-8.87359476466;邁,-11.9181172024;儀,-6.54747917426;霄,-11.9181172024;宇,-8.51691982072;堆,-11.9181172024;粉,-7.07393011592;井,-8.42160964092;演,-10.5318228413;钙,-8.22923774827;龟,-10.8195049137;股,-7.68401069779;质,-7.13899370927;踪,-10.1263577332;碱,-10.1263577332;选,-9.72089262505;纵,-8.66002066436;便,-9.97220705333;阴,-11.2249700218;剂,-6.45853168824;雅,-8.51691982072;柏,-11.9181172024;潔,-9.21006700128;孜,-7.85767419184;惡,-11.2249700218;桦,-10.8195049137;罩,-10.3086792899;恶,-11.2249700218;數,-6.3383873764;智,-9.8386756607;送,-11.2249700218;领,-11.2249700218;床,-6.57100967167;掌,-8.92238492883;树,-11.9181172024;北,-8.22923774827;喘,-8.5508213724;宜,-11.9181172024;膠,-9.21006700128;春,-8.33459826393;欧,-10.5318228413;梦,-6.66062183035;溪,-7.87506593455;爭,-3.80528972363;報,-5.01738653834;紳,-9.8386756607;殼,-8.13392756846;漿,-11.2249700218;净,-10.5318228413;狂,-10.1263577332;际,-7.52366804771;菌,-11.9181172024;杏,-10.5318228413;桑,-10.5318228413;浓,-10.5318228413;南,-7.47546594589;痘,-10.3086792899;淨,-10.5318228413;八,-11.9181172024;仪,-6.54747917426;坯,-11.9181172024;鹵,-11.9181172024;捷,-7.48730040354;胶,-9.21006700128;使,-9.43321055259;刀,-9.61553210939;鄂,-10.3086792899;颇,-8.11145471261;师,-10.8195049137;椒,-11.2249700218;气,-6.70318144477;化,-5.96227983292;砜,-9.8386756607;新,-5.84277117129;洪,-11.9181172024;咯,-9.72089262505;箱,-8.13392756846;騰,-11.9181172024;纳,-6.90748190829;茶,-8.66002066436;压,-7.35376901091;鉀,-7.92913315582;壇,-9.97220705333;筆,-9.72089262505;职,-8.02629690427;仓,-8.92238492883;卖,-11.9181172024;锻,-10.5318228413;日,-5.76538450768;武,-8.45238129958;浪,-5.50794232042;驰,-9.08490385833;廳,-10.8195049137;蟹,-11.2249700218;槽,-9.52022192958;銀,-5.39162234281;鎖,-9.72089262505;墜,-10.1263577332;蔥,-11.9181172024;順,-5.39749607482;达,-4.6970121042;十,-11.9181172024;狀,-5.66621331922;密,-11.9181172024;廈,-10.5318228413;手,-11.2249700218;緊,-8.87359476466;角,-6.80012338997;静,-9.27905987277;盘,-8.22923774827;轩,-10.5318228413;淪,-11.9181172024;六,-9.97220705333;平,-5.92665265527;鳴,-9.97220705333;職,-8.02629690427;書,-6.87469208546;明,-5.29671155062;團,-7.32299735225;宛,-7.94782528883;额,-7.51139795512;夜,-8.87359476466;粵,-11.2249700218;戶,-9.8386756607;鋁,-8.00609419695;區,-7.48730040354;铅,-8.5508213724;父,-10.5318228413;族,-3.24238298284;虎,-6.56625906891;歐,-10.5318228413;法,-5.99386140497;雙,-11.9181172024;瑚,-8.92238492883;滩,-11.9181172024;豪,-9.97220705333;热,-8.39175667777;公,-9.35316784492;扶,-9.97220705333;楼,-10.8195049137;湾,-8.66002066436;鋪,-9.21006700128;备,-9.35316784492;紙,-6.67109313022;温,-6.88116459997;猫,-8.66002066436;醬,-10.5318228413;皮,-7.9668734838;雲,-7.5873838621;鶴,-8.97367822322;奇,-8.08947580589;敏,-8.4841299979;体,-6.62985017169;棒,-8.82707474902;藏,-9.61553210939;筛,-10.1263577332;硝,-9.72089262505;點,-8.92238492883;藤,-9.21006700128;陽,-6.71411051531;卫,-7.46376990613;質,-7.13899370927;灭,-11.9181172024;目,-10.8195049137;飲,-10.5318228413;巴,-7.82377264016;虹,-7.05058275193;厅,-10.8195049137;融,-8.66002066436;昌,-8.15691708669;熙,-6.81217172848;岛,-8.08947580589;产,-11.9181172024;鞭,-11.9181172024;碳,-7.27372630324;戈,-11.2249700218;治,-6.56153092771;調,-7.21763683659;织,-7.0353152798;蓋,-10.5318228413;豐,-5.42587736736;灘,-11.9181172024;博,-8.25455555625;神,-6.90083736557;浦,-7.64145108337;表,-7.92913315582;短,-9.02774544449;鋯,-10.5318228413;酮,-7.87506593455;壳,-8.13392756846;锁,-9.72089262505;包,-9.08490385833;服,-8.15691708669;戏,-9.43321055259;傘,-10.3086792899;纜,-10.1263577332;护,-9.61553210939;润,-6.58057912268;梨,-10.8195049137;铈,-11.9181172024;莺,-10.3086792899;镁,-8.97367822322;獅,-9.08490385833;鯊,-9.35316784492;煙,-7.80724333821;络,-10.1263577332;湧,-8.51691982072;鑫,-9.8386756607;統,-8.58591269221;峰,-6.99813627655;身,-8.4841299979;銅,-9.08490385833;錄,-8.97367822322;颉,-9.08490385833;斋,-8.42160964092;備,-9.35316784492;报,-5.01738653834;横,-9.61553210939;銳,-10.5318228413;环,-7.66962196033;細,-10.3086792899;馳,-9.08490385833;殿,-7.77498247599;品,-8.5508213724;燃,-10.3086792899;鋅,-9.52022192958;醌,-9.52022192958;塞,-11.9181172024;臣,-10.8195049137;若,-10.5318228413;园,-9.14552848014;鼓,-9.72089262505;可,-9.61553210939;干,-8.82707474902;艺,-8.74006337203;份,-4.67746750813;門,-7.31294701639;民,-8.5508213724;候,-11.9181172024;帝,-8.33459826393;龜,-10.8195049137;沦,-11.9181172024;甫,-10.8195049137;匯,-7.80724333821;直,-9.61553210939;元,-5.01537446522;胎,-8.92238492883;軒,-10.5318228413;比,-8.69924137751;块,-9.72089262505;釘,-9.61553210939;飞,-8.42160964092;賦,-10.8195049137;畫,-10.5318228413;鋼,-7.82377264016;山,-6.19780542578;女,-11.2249700218;錫,-9.72089262505;阀,-9.27905987277;劃,-7.51139795512;锂,-7.98629156966;内,-6.27267030474;缆,-10.1263577332;安,-4.47973367234;圖,-6.96229014478;四,-8.22923774827;映,-11.9181172024;伦,-8.62228033638;場,-11.9181172024;款,-8.87359476466;癀,-7.92913315582;勃,-7.71342458299;蛋,-10.5318228413;藍,-9.21006700128;乐,-6.68700858553;浒,-8.78262298645;靖,-7.75923411902;党,-7.87506593455;川,-7.37482242011;食,-11.9181172024;锐,-10.5318228413;车,-7.65543732534;襪,-11.2249700218;烯,-7.42948083265;鹰,-7.79098281734;絲,-8.11145471261;莎,-8.87359476466;休,-10.1263577332;源,-6.01275535433;樓,-10.8195049137;醚,-8.5508213724;醛,-8.1804475841;实,-8.11145471261;蜡,-9.43321055259;肤,-10.8195049137;辦,-9.27905987277;親,-10.8195049137;锭,-9.08490385833;網,-5.10138132179;架,-8.13392756846;貼,-10.1263577332;里,-8.04691619147;佑,-8.08947580589;麥,-9.61553210939;鵝,-7.19961833109;糜,-11.9181172024;条,-9.72089262505;扣,-9.61553210939;迦,-10.5318228413;铬,-10.3086792899;灯,-8.30719928974;桿,-9.08490385833;傅,-8.08947580589;帆,-6.69237052867;膏,-8.06796960067;云,-7.5873838621;錘,-11.9181172024;通,-4.26462229272;垫,-10.8195049137;纱,-11.2249700218;头,-7.09783563678;洼,-10.5318228413;雁,-11.2249700218;參,-9.43321055259;冊,-11.2249700218;珠,-7.06608693846;塊,-9.72089262505;仑,-9.27905987277;佐,-11.9181172024;裕,-6.91417089644;楔,-11.9181172024;书,-6.87469208546;凯,-8.92238492883;晶,-11.2249700218;賽,-7.75923411902;阁,-8.45238129958;磁,-8.58591269221;紇,-7.20858700107;庆,-7.39632862533;墊,-10.8195049137;意,-9.43321055259;辐,-11.2249700218;锗,-11.9181172024;鎘,-10.3086792899;货,-7.37482242011;縱,-8.66002066436;船,-7.4407803879;輻,-11.2249700218;细,-10.3086792899;运,-7.68401069779;類,-7.68401069779;盖,-10.5318228413;牙,-9.02774544449;变,-5.82004292022;荣,-10.3086792899;詩,-11.2249700218;酯,-7.09783563678;狮,-9.08490385833;翰,-10.1263577332;塵,-9.52022192958;蕷,-8.82707474902;銨,-8.87359476466;轻,-9.72089262505;胺,-6.56153092771;西,-7.41830753205;諾,-7.18191875399;羅,-6.16554456356;劇,-9.08490385833;合,-8.1804475841;袋,-7.89276551165;枕,-11.9181172024;窗,-9.08490385833;外,-9.02774544449;尘,-9.52022192958;斩,-11.9181172024;萨,-11.2249700218;未,-10.8195049137;纯,-9.72089262505;熱,-8.39175667777;钳,-11.9181172024;嘴,-8.51691982072;莽,-7.31294701639;放,-9.97220705333;鋇,-9.97220705333;兆,-7.22676932015;坊,-8.02629690427;母,-8.97367822322;济,-7.2931443891;奖,-4.98957938422;盟,-9.52022192958;賣,-11.9181172024;腦,-8.69924137751;早,-11.9181172024;士,-7.35376901091;马,-5.09483108003;凱,-8.92238492883;噴,-8.28053104266;替,-10.5318228413;庄,-8.36276914089;切,-10.5318228413;针,-8.87359476466;踏,-8.33459826393;脑,-8.69924137751;崙,-9.27905987277;粘,-11.9181172024;队,-7.80724333821;氣,-6.70318144477;輥,-10.5318228413;酰,-11.9181172024;枪,-8.15691708669;吳,-11.2249700218;嚴,-10.8195049137;费,-8.22923774827;籃,-8.5508213724;黄,-7.74372993249;片,-7.05058275193;镉,-10.3086792899;哈,-7.14743257792;蝕,-7.57431178053;穗,-9.61553210939;令,-10.8195049137;硫,-8.92238492883;酱,-10.5318228413;味,-7.25467810827;史,-7.0353152798;围,-11.2249700218;綃,-11.9181172024;率,-5.4304331839;钉,-9.61553210939;見,-11.9181172024;蚕,-10.3086792899;朔,-9.72089262505;宗,-5.97269659378;砖,-9.72089262505;军,-9.72089262505;控,-9.72089262505;第,-7.49927659459;羯,-11.9181172024;蠶,-10.3086792899;油,-6.54747917426;为,-7.51139795512;抽,-9.97220705333;壁,-8.1804475841;绅,-9.8386756607;歌,-8.39175667777;腐,-8.39175667777;奥,-8.42160964092;勝,-7.77498247599;費,-8.22923774827;瑞,-6.39665628452;裡,-8.04691619147;以,-9.97220705333;潤,-6.58057912268;兰,-6.31231513609;靴,-8.45238129958;桶,-10.8195049137;社,-9.35316784492;帅,-10.5318228413;吉,-11.9181172024;隊,-7.80724333821;漏,-11.9181172024;庚,-9.97220705333;初,-7.9668734838;土,-7.79098281734;严,-10.8195049137;澤,-8.15691708669;夫,-7.64145108337;申,-10.1263577332;阵,-10.8195049137;真,-6.00191513978;人,-5.63959577822;秀,-7.31294701639;鹅,-7.19961833109;升,-7.9668734838;囊,-9.97220705333;處,-7.33314972371;字,-5.46922780824;廚,-8.92238492883;衡,-8.28053104266;濤,-11.9181172024;摩,-7.80724333821;凰,-10.1263577332;陵,-9.27905987277;歷,-6.13737368659;豹,-7.77498247599;板,-6.45005706125;宁,-6.43332026889;稀,-10.5318228413;射,-7.47546594589;成,-6.53821984884;脒,-11.9181172024;龙,-5.08400846357;帘,-10.3086792899;力,-5.09265716613;钟,-9.8386756607;计,-7.87506593455;鈰,-11.9181172024;儲,-8.58591269221;琴,-8.13392756846;边,-11.2249700218;丸,-8.5508213724;黃,-7.74372993249;槍,-8.15691708669;桌,-11.9181172024;策,-8.39175667777;針,-8.87359476466;遜,-6.65025904332;铟,-9.97220705333;代,-10.1263577332;汤,-7.74372993249;晨,-6.42094897709;置,-10.1263577332;煲,-9.8386756607;桨,-9.61553210939;松,-8.66002066436;布,-7.40725769587;紅,-7.02027740243;历,-6.13737368659;疊,-9.52022192958;氏,-8.92238492883;芐,-8.92238492883;易,-6.68167523955;頗,-8.11145471261;创,-7.10593284701;吟,-11.9181172024;誠,-9.52022192958;渣,-10.5318228413;败,-11.9181172024;性,-7.07393011592;微,-8.69924137751;阳,-6.71411051531;冲,-9.72089262505;电,-6.05164914545;钴,-11.2249700218;肼,-10.5318228413;益,-10.5318228413;盈,-9.97220705333;橋,-6.80612941403;晓,-9.61553210939;塗,-10.1263577332;默,-8.69924137751;牛,-6.56625906891;線,-5.61366839996;峻,-11.9181172024;瑟,-10.1263577332;鹼,-10.1263577332;鋰,-7.98629156966;滸,-8.78262298645;突,-9.21006700128;堂,-7.46376990613;約,-9.8386756607;醇,-7.19961833109;爆,-7.51139795512;圈,-7.62765776123;撕,-11.9181172024;攔,-11.9181172024;缘,-9.61553210939;玛,-8.78262298645;沥,-10.8195049137;贤,-10.3086792899;木,-7.53609056771;宫,-8.58591269221;鶯,-10.3086792899;縮,-9.8386756607;進,-7.20858700107;肽,-10.8195049137;显,-8.58591269221;心,-7.21763683659;牆,-8.69924137751;靈,-8.78262298645;苑,-9.8386756607;染,-8.66002066436;恒,-11.9181172024;兜,-11.2249700218;泥,-8.87359476466;杨,-7.87506593455;印,-8.1804475841;石,-6.69237052867;铵,-8.87359476466;能,-6.45428539736;虾,-10.3086792899;威,-7.45220908373;嘉,-7.60062908885;瀝,-10.8195049137;农,-6.08330646532;生,-5.83818400729;模,-11.2249700218;頭,-7.09783563678;馬,-5.09483108003;爱,-10.8195049137;鐵,-7.62765776123;丹,-10.5318228413;節,-9.35316784492;居,-9.43321055259;護,-9.61553210939;钠,-6.79415322298;提,-9.27905987277;套,-7.02027740243;鍛,-10.5318228413;盞,-9.97220705333;苦,-11.9181172024;台,-7.69860949721;间,-10.3086792899;境,-11.2249700218;异,-8.22923774827;皇,-7.38551770923;锆,-10.5318228413;醉,-11.9181172024;店,-7.69860949721;崖,-10.8195049137;香,-8.28053104266;領,-11.2249700218;钛,-9.8386756607;功,-9.97220705333;漢,-6.91417089644;窯,-7.72846246036;镜,-6.47137983072;傳,-6.99086351723;露,-7.80724333821;鎵,-9.27905987277;鈴,-7.49927659459;局,-8.97367822322;商,-7.49927659459;乌,-8.74006337203;孚,-7.98629156966;池,-9.21006700128;荪,-9.08490385833;饮,-10.5318228413;僳,-8.00609419695;鉴,-10.8195049137;价,-6.55214118736;腾,-11.9181172024;鄉,-8.15691708669;二,-10.5318228413;碘,-10.5318228413;君,-8.69924137751;定,-6.68700858553;妮,-11.2249700218;環,-7.66962196033;论,-9.02774544449;房,-8.1804475841;煉,-9.14552848014;位,-11.2249700218;拔,-10.8195049137;壘,-10.1263577332;坝,-9.97220705333;雜,-10.3086792899;泠,-10.5318228413;衣,-8.66002066436;步,-9.35316784492;旦,-7.53609056771;彭,-11.2249700218;诺,-7.18191875399;曼,-8.58591269221;承,-9.72089262505;鲁,-6.41278566645;紀,-6.28332759921;妃,-11.2249700218;理,-9.43321055259;炉,-8.20454513568;刊,-11.2249700218;得,-7.54866934992;墙,-8.69924137751;霜,-7.08183529543;原,-8.04691619147;財,-11.9181172024;肩,-10.8195049137;航,-8.4841299979;庭,-9.72089262505;钱,-9.35316784492;田,-5.72575471291;防,-9.08490385833;樺,-10.8195049137;吴,-11.2249700218;削,-11.2249700218;軍,-9.72089262505;荔,-11.9181172024;志,-9.97220705333;游,-8.20454513568;靜,-9.27905987277;酚,-7.84057975848;彬,-8.39175667777;異,-8.22923774827;却,-10.5318228413;迷,-8.4841299979;汶,-9.02774544449;楸,-9.97220705333;稅,-9.35316784492;倉,-8.92238492883;冈,-9.21006700128;洋,-6.08330646532;弗,-8.33459826393;骚,-11.2249700218;鸭,-9.08490385833;根,-4.84994520199;饃,-8.36276914089;廂,-8.00609419695;燈,-8.30719928974;赋,-10.8195049137;行,-8.25455555625;罗,-6.16554456356;象,-8.78262298645;恩,-9.14552848014;臨,-11.2249700218;鹭,-11.9181172024;魯,-6.41278566645;酒,-8.30719928974;創,-7.10593284701;征,-9.02774544449;馅,-10.5318228413;圆,-8.92238492883;玉,-8.42160964092;事,-7.74372993249;焊,-10.5318228413;際,-7.52366804771;多,-8.66002066436;渠,-9.35316784492;财,-11.9181172024;庫,-6.28332759921;維,-6.36515761746;劳,-7.9668734838;甲,-10.1263577332;施,-11.2249700218;叉,-9.72089262505;版,-9.61553210939;滋,-11.2249700218;廣,-5.61733140772;拓,-10.8195049137;联,-5.95453785876;盛,-5.56200954169;烟,-7.80724333821;信,-4.72217997591;蝦,-10.3086792899;陰,-11.2249700218;镲,-11.9181172024;娃,-10.1263577332;餅,-11.9181172024;下,-9.21006700128;熊,-10.1263577332;貌,-6.87469208546;轮,-7.24528836792;速,-6.78821848746;褥,-10.5318228413;師,-10.8195049137;集,-9.27905987277;宮,-8.58591269221;谷,-9.08490385833;村,-7.24528836792;打,-7.61405210918;高,-7.85767419184;铜,-9.08490385833;裤,-10.1263577332;幫,-10.8195049137;自,-9.8386756607;顯,-8.58591269221;篮,-8.5508213724;兵,-6.92090492862;开,-9.8386756607;处,-7.33314972371;逊,-6.65025904332;坛,-9.97220705333;传,-6.99086351723;氢,-9.72089262505;斧,-7.80724333821;茨,-9.97220705333;怪,-8.92238492883;岭,-8.36276914089;皱,-9.52022192958;地,-5.52285560427;层,-9.97220705333;症,-7.04291987918;陆,-7.27372630324;遊,-8.20454513568;材,-8.25455555625;波,-9.08490385833;站,-7.19961833109;铝,-8.00609419695;畜,-10.3086792899;聪,-8.78262298645;鵬,-8.5508213724;兴,-6.65025904332;币,-11.2249700218;铁,-7.62765776123;項,-6.84921300016;禄,-9.8386756607;隆,-7.9668734838;鈉,-6.79415322298;邊,-11.2249700218;涌,-8.51691982072;蘑,-10.5318228413;析,-9.43321055259;紗,-11.2249700218;纖,-9.08490385833;喜,-11.2249700218;办,-9.27905987277;渡,-8.82707474902;錳,-9.52022192958;溶,-8.5508213724;樹,-11.9181172024;硅,-8.42160964092;盆,-10.3086792899;鏈,-10.1263577332;睛,-8.97367822322;磚,-9.72089262505;勞,-7.9668734838;乡,-8.15691708669;正,-5.81332396997;賢,-10.3086792899;桥,-6.80612941403;鑽,-10.8195049137;灵,-8.78262298645;海,-5.52118754717;件,-7.5873838621;腿,-8.1804475841;孔,-10.1263577332;
+E,n:怀,-10.0793507993;挂,-10.544366887;螅,-11.6281640899;耀,-12.7121775791;氈,-11.8773798815;伊,-11.5572123539;嚏,-11.0518812495;馑,-12.3511642336;鹆,-15.1545246145;龕,-11.4656451604;帔,-13.6504472177;抗,-11.1114733467;脖,-12.3819358923;料,-5.71908260951;辮,-11.6429791757;洞,-7.98363613599;造,-8.22451872659;璣,-12.8519395215;錢,-7.96913759892;瞥,-10.9801373446;瘤,-8.62073577657;媧,-11.4168549962;礦,-7.37610378167;鶩,-15.8476717951;绝,-11.6887887117;肫,-15.1545246145;缪,-15.8476717951;般,-13.5450867021;河,-7.16955093954;欲,-9.40672525443;渴,-11.3478621247;銷,-9.17311040325;然,-9.63306369664;喹,-14.0559123258;吸,-12.1841101489;场,-4.42983753387;宽,-10.9498319951;娼,-13.3627651453;线,-5.71513814556;飙,-10.9724744719;黴,-11.4909629684;黛,-12.9032328159;談,-10.6165631782;珍,-11.7701343512;牌,-7.0786309842;盏,-11.2325512782;姑,-8.29806262991;鼹,-13.3627651453;筒,-8.67678331655;幔,-10.5543669703;苗,-8.04056850494;纸,-7.97827008249;摘,-11.5436067019;篌,-12.3819358923;话,-6.46834843073;爻,-15.1545246145;軟,-11.4656451604;荤,-13.7682302534;遠,-11.8223201043;瓣,-9.55056247513;卢,-11.1202839764;知,-7.51970393676;噤,-12.5518349291;酬,-8.99120981047;罪,-9.49156413437;扬,-13.139621594;衰,-10.3342430489;泳,-10.5695571358;歲,-8.85925861306;其,-13.2086144654;痹,-12.7121775791;驼,-9.66146317116;绿,-10.4586000652;愁,-13.014458451;萃,-13.901761646;訇,-11.4909629684;榆,-12.9032328159;沈,-12.5518349291;個,-11.3368122885;辊,-12.8031493573;蝎,-12.589575257;餑,-11.7872287845;观,-6.5408401229;引,-9.95602758324;应,-7.44566501346;鐘,-9.18071500263;儡,-10.8778584955;厢,-9.39404679617;遇,-7.70241222855;铯,-15.8476717951;崩,-10.9498319951;鲨,-13.0750830728;鶓,-12.8519395215;芬,-15.8476717951;是,-5.55827579197;薮,-13.2086144654;械,-7.05588177074;氳,-12.2923237336;麟,-10.8918447375;刷,-11.7367979309;冶,-14.2382338826;锹,-11.7872287845;讼,-13.2086144654;頻,-9.27538925237;贞,-11.1027396667;骼,-9.69706902662;琏,-15.8476717951;胀,-12.0190303986;蛄,-12.2641528566;橇,-11.6135652905;视,-8.04546247882;賈,-11.0193580578;運,-7.43472862502;俊,-12.9573000372;鍍,-14.4613774339;契,-11.7045370687;寒,-9.46585577766;录,-7.76991423133;绔,-13.3627651453;酸,-7.38704895513;教,-7.07832008726;擘,-12.9573000372;衛,-8.58925964447;柚,-11.9975241934;諜,-10.8107191926;叢,-8.86295547494;靥,-13.4497765223;囤,-15.1545246145;姦,-9.8242242021;景,-6.65906591523;轼,-10.4677744415;棰,-15.1545246145;滴,-9.95051792743;凶,-10.3262108772;铸,-12.0410093053;须,-9.70348616094;基,-8.26595215494;孽,-10.8709380526;广,-14.0559123258;巾,-8.95198909731;片,-6.52328870705;萁,-14.2382338826;漪,-12.4464744134;殇,-12.9573000372;蠆,-15.8476717951;沉,-12.5518349291;醋,-10.837036501;上,-6.61400559778;劍,-8.92798794522;后,-7.46790327956;碑,-8.85282180923;餐,-8.94794868778;經,-6.70582441953;底,-7.75054986414;鑰,-11.3933244988;默,-13.0750830728;蒙,-11.6732845252;鈹,-13.6504472177;蘚,-10.6943802006;牛,-8.32743723859;玄,-14.7490595064;疣,-13.139621594;鷚,-15.8476717951;砦,-13.901761646;岩,-7.29956150101;鴨,-10.3880862809;鸪,-8.95503015389;粳,-14.4613774339;袱,-9.56540504817;椰,-13.901761646;足,-9.76089706815;伴,-8.50037209432;馈,-12.2923237336;钹,-12.9032328159;燹,-12.3819358923;妻,-8.50295274091;瘺,-13.139621594;媽,-7.48246496064;笼,-9.2051849937;尾,-9.14940374095;胁,-12.2100856353;框,-10.2717226919;泉,-8.38833289984;釋,-10.2200506814;壑,-11.0193580578;疹,-9.5957679119;绕,-12.8031493573;聖,-11.4050205386;敘,-12.7566293417;槛,-9.04638876059;晚,-10.4677744415;譜,-8.46306141189;濟,-4.85096982955;汞,-11.8964280765;郡,-10.6327360375;飩,-11.6281640899;嗣,-11.9356487896;牢,-10.8437254891;坤,-10.9276908692;寧,-11.3590354253;鳩,-11.4168549962;絨,-9.92074576909;鏈,-8.37573971682;繪,-10.5746722365;餓,-9.85121970644;柯,-12.5154672849;稼,-9.61719034748;棱,-13.0750830728;跳,-12.4464744134;轴,-9.02112657151;号,-6.55253082139;偶,-9.48809792639;啸,-10.3064082499;姻,-8.57388547722;贾,-11.0193580578;竽,-15.8476717951;态,-6.11224792757;膀,-8.68760258747;节,-6.83055216075;构,-5.43637315792;消,-15.1545246145;厌,-13.2086144654;钎,-12.4464744134;堑,-12.0190303986;馐,-12.4136845906;媒,-9.57102830572;帕,-10.2272709293;羔,-11.8403386098;茗,-13.7682302534;肖,-12.1841101489;貞,-11.1027396667;冠,-8.88732406596;锣,-11.5572123539;犢,-11.8586877485;邊,-7.93965235043;踝,-12.0634821611;愫,-13.139621594;纪,-5.99437288411;术,-5.51695764264;辜,-10.4052540845;洳,-14.2382338826;課,-9.91542660761;踵,-14.7490595064;鱈,-13.901761646;疸,-11.0769871706;皺,-9.2908934389;精,-8.42709288965;鹩,-15.1545246145;議,-5.74181499043;柄,-9.79558262614;歇,-10.8918447375;菲,-13.0750830728;汉,-8.07155631796;克,-7.56140234228;今,-9.85871037817;前,-12.7566293417;坏,-10.6658882448;铎,-14.2382338826;塑,-9.28805655757;姐,-7.48877118264;嫒,-14.2382338826;幕,-8.24576983519;雏,-12.4464744134;胖,-14.0559123258;泞,-11.094081604;几,-10.3796116539;镣,-12.2641528566;勢,-5.33645879402;編,-9.57102830572;腫,-9.12865864068;廪,-12.3511642336;杯,-8.89877457275;蓮,-9.50379136094;卷,-9.00712526577;鑹,-14.2382338826;闸,-10.0425368261;固,-14.7490595064;导,-6.55861266838;齿,-8.57249947561;織,-6.93722103865;戀,-12.2100856353;脂,-8.40342314557;鮫,-13.6504472177;萄,-9.27819037465;辉,-9.9532689608;丈,-10.3024943506;贊,-10.7296779826;倌,-11.6732845252;咏,-12.0634821611;库,-7.84130422741;砂,-9.64513627787;尔,-9.19351927488;邮,-13.4497765223;沟,-8.95198909731;伞,-10.3262108772;鰱,-13.4497765223;嚣,-13.5450867021;閥,-9.02547440444;碧,-12.6287959702;符,-9.21172523938;義,-5.51487240794;鸨,-12.2923237336;披,-13.2086144654;爆,-13.5450867021;蜮,-13.901761646;褲,-9.63506569931;涵,-9.97837488193;水,-5.98386105968;傷,-8.73942765533;誼,-9.50555037634;赞,-10.7296779826;禽,-9.5957679119;误,-8.076604709;菁,-12.8031493573;所,-6.50507584397;旅,-9.95879383673;么,-15.8476717951;勋,-10.3628748616;浊,-13.901761646;凍,-10.7914259897;灌,-11.5038663732;坎,-11.0193580578;廓,-9.59962892055;鱔,-11.3703349806;蟥,-12.0190303986;佞,-12.3511642336;鏡,-7.76033886859;監,-7.61896099627;嗥,-12.6696179647;呤,-11.6429791757;磧,-11.3703349806;学,-4.82139980189;總,-9.95602758324;苫,-15.1545246145;饦,-15.8476717951;臭,-10.4910855204;淵,-10.4910855204;烷,-9.75184723263;鍶,-13.901761646;噸,-14.0559123258;髻,-11.0769871706;秽,-11.7701343512;硼,-12.9032328159;持,-11.2425016091;技,-7.26863120032;憂,-10.5246618159;鲁,-12.4803759651;标,-6.35886670018;載,-10.7662674301;班,-8.54990351253;越,-10.9573226668;吏,-8.56697459968;瞎,-13.5450867021;笑,-10.0856204123;盂,-10.9724744719;鴕,-15.8476717951;岔,-12.1340997284;耗,-8.91035771384;莖,-9.15434812679;訛,-13.7682302534;袜,-10.9956415311;氟,-14.0559123258;辞,-9.48982952855;加,-11.0601800523;冢,-12.589575257;甥,-10.6112298322;砧,-14.7490595064;宦,-10.6547149442;弩,-12.2367538824;舫,-12.589575257;贵,-10.0275888647;貴,-10.0275888647;圹,-14.4613774339;隸,-8.48312478081;稻,-8.49523069482;碼,-7.4925270556;尿,-9.91013558998;臂,-8.72722742267;故,-7.84130422741;蓄,-8.70089961561;謠,-10.2679419691;轉,-12.2100856353;酶,-9.91808265167;配,-12.8031493573;辣,-14.7490595064;城,-6.86247697707;筑,-7.09509032592;秒,-12.6696179647;絕,-11.6887887117;鳔,-14.4613774339;楝,-13.014458451;補,-13.4497765223;江,-9.1214383927;舷,-11.5436067019;卡,-8.47492542866;鹜,-15.8476717951;癣,-11.4656451604;略,-6.6082581756;瓤,-13.7682302534;顧,-11.4168549962;實,-6.93681620766;彩,-8.06195089853;黨,-6.60622042806;艫,-13.6504472177;腭,-13.014458451;乳,-9.76317238199;滿,-13.014458451;偷,-10.9423970166;叶,-7.33931755231;相,-7.37736058955;痺,-12.7121775791;好,-8.85741529457;箫,-12.7121775791;屿,-8.75012294445;榇,-14.4613774339;争,-6.74113759181;压,-7.41494776027;谊,-9.50555037634;球,-5.93339268145;疏,-10.1505783086;阎,-15.1545246145;窑,-9.83395663902;鎂,-11.3703349806;粕,-9.74735284304;镯,-11.2325512782;縮,-15.1545246145;條,-7.93561490688;涟,-15.1545246145;丞,-10.9498319951;务,-5.46621244363;匠,-8.65925905857;垣,-10.9060293725;钥,-11.3933244988;锤,-10.5493544285;禧,-15.8476717951;連,-9.99834701512;麩,-12.8031493573;缨,-12.4464744134;簪,-12.0190303986;斯,-8.63022836337;鴉,-10.0246258996;贴,-8.37801762213;冷,-11.1471914293;制,-6.17077121562;眸,-11.9158461623;鐺,-11.8586877485;礼,-8.23138823348;綿,-10.7001773182;績,-6.37666089988;友,-6.82269761007;汊,-12.3511642336;子,-3.95024612446;離,-7.59262289231;糕,-10.0485791406;鱘,-12.1100021768;蛙,-10.0157893178;毛,-7.81823895448;葚,-13.139621594;裝,-7.62673062678;跟,-10.0516140443;乞,-14.7490595064;哥,-7.02431830995;啤,-14.7490595064;秧,-13.2086144654;婦,-7.41930981735;廩,-12.3511642336;谓,-10.7356840067;旯,-12.4136845906;普,-10.7237078157;衩,-12.5154672849;泵,-10.5594047644;浴,-11.2129428068;雹,-10.6943802006;脚,-8.33943302038;壽,-9.15558805256;镫,-12.0864716794;幾,-10.3796116539;绁,-14.2382338826;會,-4.74800674279;薄,-11.4288311873;三,-9.93146973246;辈,-9.00819535683;倍,-14.7490595064;册,-9.43257483589;锏,-11.3368122885;嚎,-13.2827224376;父,-7.49700555454;弓,-11.0034847086;紗,-9.11665369458;榜,-9.98120373813;负,-9.65326640396;亞,-11.2525519449;圣,-11.4050205386;疤,-11.0034847086;大,-9.18198807728;窦,-11.955851497;羨,-15.1545246145;粪,-11.2032808959;饳,-15.8476717951;支,-7.82707264517;暮,-12.3819358923;許,-12.2367538824;蛉,-13.0750830728;儷,-12.7121775791;状,-6.92049040681;垸,-13.2827224376;钺,-12.6696179647;鴿,-10.9801373446;玩,-10.4540442487;菀,-14.4613774339;权,-5.91108801504;肠,-8.70880479512;义,-5.51487240794;迈,-14.4613774339;鍋,-9.24780129585;泊,-8.51008405152;凌,-11.6135652905;問,-7.97293266989;雎,-14.0559123258;穑,-13.014458451;当,-9.03203180499;莢,-12.1100021768;展,-9.9868855716;巔,-11.4409525478;鸦,-10.0246258996;據,-6.06810482445;衝,-9.08494228813;鹄,-13.901761646;滞,-12.1841101489;叠,-13.4497765223;督,-7.79187934409;跨,-12.3819358923;奧,-13.6504472177;荐,-14.2382338826;繩,-9.21567001767;荫,-10.7177730801;驢,-10.3754011214;臬,-14.0559123258;蛮,-11.3590354253;橱,-11.72053741;轳,-12.2100856353;具,-6.96514128663;铺,-8.71757328494;除,-13.3627651453;蜂,-9.56540504817;阀,-9.02547440444;榉,-12.5518349291;栈,-10.3423402591;權,-5.91108801504;鞍,-10.7978157878;瘌,-14.0559123258;銬,-11.4168549962;墓,-8.11355049173;箕,-11.4288311873;暗,-9.52510655514;鼎,-10.2566848146;耘,-15.8476717951;疮,-9.97555400559;依,-14.7490595064;东,-6.73252161009;疡,-10.1606964387;吠,-12.0864716794;那,-11.3703349806;厥,-9.12624609427;判,-10.2381999999;座,-8.42112272267;鴦,-9.40036593252;撫,-8.95401544046;嬪,-10.8709380526;枭,-13.901761646;芯,-11.2032808959;梳,-12.5518349291;雾,-8.66531968318;段,-6.18110983131;訴,-15.8476717951;賞,-10.8709380526;锶,-13.901761646;鮃,-14.7490595064;区,-5.07115598071;徽,-10.1240866931;窿,-9.95051792743;夾,-11.0518812495;旁,-11.9975241934;胃,-9.83885860962;杂,-13.7682302534;熊,-9.82664844571;爷,-6.91361207281;仇,-11.1202839764;浆,-8.71357807387;觉,-7.00203853872;案,-6.4278811989;铋,-15.8476717951;癌,-9.14694068551;煎,-14.2382338826;屐,-12.3819358923;壓,-7.41494776027;归,-10.837036501;荚,-12.1100021768;保,-10.5493544285;櫟,-11.2525519449;楞,-12.2641528566;面,-5.02069945007;句,-9.1383674548;鉤,-11.1114733467;給,-13.7682302534;苯,-10.3796116539;慮,-9.33741345454;深,-8.73452968636;裳,-9.52510655514;诵,-15.1545246145;鸿,-12.0634821611;雷,-8.46991288683;啶,-10.6943802006;凹,-11.6887887117;灸,-10.3423402591;系,-5.63761908307;獺,-10.9204181099;幼,-10.3464135845;竿,-10.5594047644;騮,-14.7490595064;考,-11.4168549962;螂,-10.6327360375;茅,-11.0436507503;抄,-12.3213112704;殊,-12.7566293417;圍,-6.83249508789;睛,-6.83030956007;徒,-7.91315833118;鷯,-15.1545246145;蘗,-12.2100856353;肘,-11.7367979309;氛,-8.58855566697;輝,-9.9532689608;溜,-11.5572123539;樟,-12.8519395215;赋,-9.55056247513;英,-9.1420327002;瀣,-15.1545246145;垢,-10.9956415311;帧,-12.3819358923;鎮,-7.69922612882;天,-7.47227260926;墨,-9.13958771121;宪,-11.2937949035;札,-11.2833236036;音,-6.5648247323;贱,-11.6429791757;栳,-13.7682302534;農,-8.64277928486;结,-9.457431128;碟,-10.9131978619;鳞,-10.8042466781;炸,-11.3368122885;鰻,-12.0190303986;玺,-11.658017053;缽,-12.1841101489;稿,-9.13350126515;妾,-9.9868855716;论,-6.04196246545;襉,-13.7682302534;究,-10.6886164958;野,-8.37858791014;鵑,-10.8107191926;習,-10.1078788829;孕,-11.7701343512;嫔,-10.8709380526;陂,-12.9032328159;汛,-10.8989119047;揚,-13.139621594;機,-5.13998775819;觞,-12.6696179647;啡,-9.37532550056;灣,-8.67986261075;矢,-12.9573000372;勤,-9.27819037465;奩,-12.3511642336;磨,-11.0854978603;輦,-12.4136845906;良,-10.5394040977;泰,-11.6429791757;访,-10.837036501;陷,-9.14694068551;兹,-15.8476717951;类,-6.04212788686;婿,-9.59192175331;昂,-12.3511642336;茄,-10.5695571358;澇,-10.4863796294;開,-10.0824806923;訊,-7.63131346268;粑,-12.7566293417;紐,-8.76344537296;妓,-11.325883218;颂,-14.4613774339;笔,-8.50813409966;林,-6.62807440182;脘,-12.2923237336;涛,-10.1743485279;戚,-8.75592967997;溝,-8.95198909731;钡,-12.7566293417;墩,-10.9956415311;筝,-10.4271367958;本,-5.38679951298;串,-9.71427375207;吶,-10.8640651734;点,-5.25745762977;贯,-11.1027396667;綻,-11.7533272328;刺,-10.0793507993;纽,-8.76344537296;笋,-10.4677744415;宿,-10.1640920277;破,-15.1545246145;時,-7.11021920751;担,-8.61421637644;过,-10.1505783086;豆,-7.69662684938;棉,-9.26150014021;认,-12.6696179647;闋,-15.1545246145;鰾,-14.4613774339;過,-10.1505783086;嵐,-15.1545246145;姓,-7.22359924202;鏢,-11.184232701;孔,-8.03894248832;爸,-8.37573971682;蝥,-14.7490595064;作,-6.83249508789;盤,-6.42553197347;員,-5.28441288979;釣,-15.1545246145;癢,-13.2827224376;卤,-12.589575257;忧,-10.5246618159;壩,-9.33890265809;票,-5.92668819491;蛭,-13.2086144654;霓,-13.6504472177;華,-9.17311040325;走,-12.3511642336;槳,-10.2604231367;執,-12.9032328159;價,-5.6463785869;典,-7.78083648065;绽,-11.7533272328;寿,-9.15558805256;塾,-10.7417263212;艇,-7.65565488053;舅,-9.26703265778;榈,-11.1563239128;锋,-8.52516136107;瘍,-10.1606964387;炎,-7.96121452409;少,-10.9573226668;礓,-14.4613774339;箔,-11.3478621247;朗,-11.4050205386;耙,-13.2827224376;抚,-8.95401544046;丝,-8.33015094446;澜,-10.6381856422;疠,-12.7566293417;別,-7.20296528335;弧,-10.1986975569;裰,-11.1291729238;馨,-12.2641528566;窪,-11.8773798815;蘭,-9.50203543423;螬,-13.3627651453;振,-9.7384242123;醜,-10.9878593907;谱,-8.46306141189;鯉,-13.3627651453;褳,-11.8403386098;亲,-6.48736089651;樵,-13.3627651453;眷,-10.0577116242;銀,-8.41993295453;鴻,-12.0634821611;帽,-8.97347329961;墾,-11.1748429606;绡,-13.2086144654;桉,-15.8476717951;览,-10.7237078157;降,-10.3880862809;协,-11.6429791757;郎,-8.4241033508;屑,-9.7384242123;绒,-9.92074576909;驕,-13.0750830728;烏,-11.8586877485;蝗,-11.4409525478;恙,-13.7682302534;臘,-11.5169384548;赛,-8.57180719452;獎,-8.49715562323;九,-11.5169384548;远,-11.8223201043;近,-9.68646447337;团,-6.02257830995;古,-9.36609466579;镜,-7.76033886859;峦,-10.4052540845;姨,-10.4910855204;柬,-12.2641528566;药,-6.59782228999;仲,-10.7001773182;说,-6.4664922034;瓶,-9.36609466579;凸,-11.6429791757;勺,-10.9956415311;鹽,-8.19750309422;翼,-8.35046457186;馏,-12.6287959702;衔,-9.44409759713;极,-8.02522706557;隴,-14.0559123258;漆,-9.53231379354;計,-8.00854014679;同,-7.63727553996;猎,-9.5976965528;徑,-7.25629920547;帐,-9.75636191299;研,-8.99860551243;靼,-10.3712082431;战,-7.39256679596;愚,-12.9573000372;涝,-10.4863796294;谜,-11.571005676;梟,-13.901761646;霄,-11.0518812495;劣,-10.62731597;產,-5.64470947801;弦,-9.58237058233;箩,-12.4464744134;緝,-15.1545246145;太,-7.59861952089;断,-10.0669282793;肯,-13.2086144654;辱,-9.7495975129;檳,-11.8964280765;洲,-7.9987380687;食,-6.99643789222;眶,-10.2947122101;券,-5.59733743691;麻,-8.49203069209;尼,-9.72737437611;餾,-12.6287959702;渊,-10.4910855204;資,-6.77981707138;轆,-12.0864716794;诉,-15.8476717951;楊,-9.90225118646;痍,-13.901761646;像,-7.54243496557;华,-9.17311040325;髓,-9.18453909907;鵒,-15.1545246145;秕,-13.7682302534;塔,-8.21043740627;杖,-9.49156413437;托,-8.63022836337;距,-8.24726946056;猻,-11.3150723019;裟,-10.4770337669;频,-9.27538925237;畢,-12.7566293417;燥,-12.0410093053;糧,-8.61061276894;彦,-14.2382338826;審,-9.96993601328;饪,-11.7533272328;葬,-9.43585352735;惯,-7.9496321043;据,-6.06810482445;濱,-9.5957679119;篩,-12.4803759651;瓷,-8.49330946464;靶,-13.3627651453;籼,-15.8476717951;飿,-15.8476717951;签,-10.4227217776;蚀,-10.8303919582;脅,-12.2100856353;氇,-12.3819358923;來,-9.9532689608;瘋,-14.7490595064;和,-8.27208714351;透,-13.901761646;庐,-11.0113898881;裂,-11.3478621247;夕,-11.1748429606;折,-9.09891224757;丛,-8.86295547494;膚,-7.85607951299;贝,-8.98596045458;蠟,-10.4958136616;鈣,-10.3222188559;尧,-15.8476717951;鹰,-9.83395663902;骝,-14.7490595064;妪,-12.7566293417;蔭,-10.7177730801;液,-7.19997679558;匹,-9.48636931749;犸,-13.139621594;崽,-13.014458451;宾,-9.53412374879;胄,-11.1114733467;汇,-7.86491409305;證,-7.67635492034;額,-6.18963731076;镍,-12.0410093053;哌,-15.8476717951;偏,-13.2827224376;車,-5.56001086989;网,-7.03795825455;巒,-10.4052540845;磔,-14.4613774339;著,-8.49779809032;賜,-9.83640462066;诞,-11.8403386098;坡,-8.28343331989;因,-6.40677541206;痢,-13.6504472177;入,-6.40091632958;鱧,-13.5450867021;孩,-8.18379453636;虫,-7.31874768077;頦,-12.6287959702;蓬,-12.589575257;息,-5.89149692025;揮,-10.6547149442;仰,-9.0157182295;極,-8.02522706557;狸,-9.84873523312;幻,-10.2492498361;出,-8.10483583963;篾,-12.3213112704;蚁,-9.78621487613;蜀,-10.9878593907;踪,-10.7978157878;祗,-11.9975241934;誉,-8.16380781481;型,-6.05355277958;蠊,-13.4497765223;甌,-11.8403386098;茬,-11.9764707842;庑,-12.9032328159;箓,-12.2367538824;閂,-11.5301836815;斗,-9.13958771121;濘,-11.094081604;供,-11.8223201043;貝,-8.98596045458;樞,-9.63506569931;眠,-13.5450867021;簇,-14.0559123258;带,-6.25179695047;窩,-8.90165780396;枫,-13.6504472177;辆,-7.98980423573;播,-12.5154672849;蔬,-11.6135652905;估,-14.7490595064;氲,-12.2923237336;椴,-13.0750830728;喷,-14.4613774339;嘶,-12.1100021768;銹,-12.0864716794;债,-7.6229722331;禿,-13.7682302534;騾,-12.9573000372;杀,-11.4782239426;情,-5.44997592458;韋,-11.6887887117;响,-8.43914122817;界,-5.59440804028;訟,-13.2086144654;剎,-10.8504595213;黑,-11.3478621247;罐,-9.81219036254;寓,-10.1405615303;鱒,-12.9573000372;壕,-10.7724979798;旗,-7.97712395056;晖,-11.8586877485;进,-11.2729608166;莎,-13.139621594;浜,-13.6504472177;槟,-11.8964280765;詞,-7.90958306817;囡,-13.3627651453;坠,-12.0864716794;口,-5.73469346767;呢,-11.2833236036;煤,-9.06321473243;巧,-9.16181084799;訓,-8.77355497887;艮,-12.6696179647;闷,-11.9764707842;陶,-10.6112298322;獸,-8.74270634679;翻,-11.7367979309;簾,-9.57857551136;峽,-8.52384122886;姿,-10.3182427076;驾,-11.0601800523;范,-8.81152330131;蒂,-11.4168549962;者,-4.57879436552;鍵,-7.49370366475;了,-12.0864716794;國,-5.14272091848;名,-6.96375432385;帑,-15.1545246145;龐,-10.5644680663;鬓,-11.5301836815;粒,-8.65473757385;馔,-12.6287959702;蔗,-9.27120222601;暖,-11.0769871706;雅,-11.0518812495;輛,-7.98980423573;肚,-11.3150723019;鸛,-12.0634821611;語,-7.42369098537;瘡,-9.97555400559;鞠,-13.7682302534;匣,-10.4631767323;钢,-7.73484431631;冤,-13.139621594;紧,-12.0864716794;度,-4.63808364215;末,-9.11070483706;脯,-9.88924710203;鲜,-11.0113898881;辰,-8.92502790359;榴,-10.5543669703;男,-11.7533272328;隶,-8.48312478081;刹,-10.8504595213;飥,-15.8476717951;鼻,-12.1100021768;為,-6.88182630031;尽,-12.4136845906;嶼,-8.75012294445;间,-5.10906018307;蟀,-11.0601800523;蜗,-12.4136845906;仆,-9.57290977382;苍,-11.9975241934;鹂,-12.589575257;鹑,-11.4782239426;孓,-13.901761646;委,-6.95629778558;敗,-9.68857640657;艙,-8.69071543045;佛,-9.39404679617;胚,-12.9032328159;襟,-9.7384242123;櫞,-13.6504472177;埠,-10.7296779826;瓢,-12.8519395215;健,-9.72517898555;凤,-10.6715220625;寨,-8.59490937701;飪,-11.7533272328;乱,-8.96934532677;述,-9.4374969131;觴,-12.6696179647;長,-5.24321771291;訣,-10.4095924861;特,-10.1606964387;司,-4.45560408787;盾,-11.0769871706;籽,-9.70563438948;祿,-10.3587340689;要,-9.10951930047;禪,-10.6381856422;辅,-8.5471989808;盞,-11.2325512782;愆,-13.5450867021;蜊,-13.139621594;箍,-12.5518349291;娌,-12.3819358923;序,-7.16107343879;冑,-11.1114733467;钓,-15.1545246145;檗,-12.2100856353;蕘,-14.4613774339;肛,-12.7566293417;会,-4.74800674279;舜,-11.658017053;虚,-10.310337528;賊,-8.4397474725;焦,-10.4631767323;吨,-14.0559123258;被,-8.1730542977;训,-8.77355497887;躯,-10.2022248974;薇,-10.4095924861;茲,-15.8476717951;尸,-8.51268991619;邻,-10.2755177629;强,-9.01895972342;皿,-10.4586000652;见,-7.22990954872;胡,-10.2057647241;猊,-12.3511642336;蹄,-10.0335412632;苇,-9.8169865348;龍,-8.31237509262;痣,-12.3213112704;经,-6.70582441953;金,-4.45751301352;卒,-9.71427375207;襖,-10.181245107;胛,-12.1340997284;佚,-12.8031493573;孢,-11.3368122885;鯧,-13.3627651453;鐐,-12.2641528566;闩,-11.5301836815;周,-9.21567001767;坪,-10.7662674301;语,-7.42369098537;滯,-12.1841101489;浮,-13.3627651453;柵,-10.6771878;晴,-14.7490595064;奶,-7.91818527175;鷹,-9.83395663902;鱸,-15.1545246145;館,-7.21911613579;叽,-12.7566293417;囿,-12.6287959702;椁,-9.90225118646;调,-7.51296017324;麗,-12.1841101489;撈,-13.901761646;验,-7.33529016064;鍬,-11.7872287845;香,-8.41341441293;隔,-9.66146317116;視,-8.04546247882;芜,-13.7682302534;星,-6.53721463175;蚶,-13.3627651453;餡,-12.2923237336;客,-7.47921065745;弥,-11.8586877485;纤,-9.4342128379;饰,-8.43009139265;钨,-13.3627651453;檬,-11.0518812495;港,-8.55329449577;魉,-13.2086144654;莲,-9.50379136094;朵,-8.30017011225;暴,-8.9683159906;稷,-9.78854859948;紹,-15.1545246145;岸,-7.42919457659;銼,-15.1545246145;瘿,-12.4464744134;疾,-9.71427375207;检,-13.6504472177;毂,-11.7533272328;轅,-9.93958885689;仄,-12.4136845906;扇,-9.02656432281;臆,-12.9032328159;蕉,-9.35998777658;塋,-12.2923237336;灶,-10.2418697288;筍,-10.4677744415;嫌,-12.6696179647;鹏,-11.068548302;呓,-12.8031493573;盔,-9.96156776361;离,-7.59262289231;拜,-10.1472282217;號,-6.55253082139;屣,-14.7490595064;寢,-11.1748429606;彥,-14.2382338826;剧,-7.05012330658;镩,-14.2382338826;哨,-10.3587340689;衫,-9.2739916281;櫬,-14.4613774339;湯,-9.36303655943;腱,-11.3368122885;葳,-14.7490595064;緒,-7.32588915131;杵,-13.6504472177;絹,-10.8640651734;偻,-12.4136845906;狼,-9.93146973246;裔,-9.18966074919;梁,-8.52384122886;老,-8.38144423885;樂,-7.43228986979;躅,-15.8476717951;雞,-8.5878521847;蘊,-11.0113898881;窍,-11.0854978603;嬌,-13.3627651453;導,-6.55861266838;傑,-10.2985957102;間,-5.10906018307;划,-6.22867142408;嚕,-11.5572123539;蕴,-11.0113898881;沙,-8.51923444217;膛,-9.7384242123;业,-4.15109232806;芝,-10.9204181099;螟,-12.1100021768;螄,-12.8519395215;碡,-12.4136845906;疱,-11.72053741;麥,-7.90176219645;钩,-11.1114733467;用,-5.67507355566;榫,-15.1545246145;领,-7.21768577617;謬,-13.3627651453;侯,-9.03642741646;氮,-11.1381415938;肱,-12.0864716794;戲,-8.09490698621;朴,-11.6135652905;粹,-10.1339389896;冻,-10.7914259897;裁,-8.47241601705;跃,-14.7490595064;纷,-9.2051849937;菇,-9.51973501133;蓉,-9.77002955171;效,-7.99601061717;始,-11.8046205272;酰,-11.8586877485;屎,-11.8586877485;僑,-10.004127378;酐,-11.0354874397;嗓,-14.2382338826;牒,-10.9573226668;雕,-8.81240319578;毗,-13.6504472177;酥,-12.9032328159;荜,-14.2382338826;祠,-12.0190303986;緣,-7.64382042288;婢,-9.05532736759;哩,-14.7490595064;噪,-13.7682302534;諭,-10.0638466127;胱,-10.1175720121;猪,-9.42767686692;色,-5.62951949875;篷,-9.4374969131;顶,-7.91674642258;击,-11.1471914293;幺,-15.8476717951;矿,-7.37610378167;清,-9.51261754356;侄,-10.62731597;指,-6.94385658334;肆,-11.4050205386;薈,-12.5154672849;蚊,-11.6887887117;式,-5.41588222446;饿,-9.85121970644;們,-6.48169613156;醐,-13.2086144654;阕,-15.1545246145;聯,-9.31533750284;袖,-8.41105452983;愛,-9.62708162496;亚,-11.2525519449;期,-5.87218921536;撞,-12.9573000372;堡,-9.38620361871;鴣,-8.95503015389;帥,-8.15921643851;群,-7.65870493141;邦,-8.05532287095;吩,-12.8519395215;閨,-13.139621594;險,-5.99964409973;設,-9.65530930559;伯,-9.1605631872;臉,-9.07688237115;鲛,-13.6504472177;鷲,-12.589575257;嬷,-11.0354874397;尹,-11.571005676;綸,-9.84378472796;纺,-11.2729608166;钾,-10.6491747638;觀,-6.5408401229;赃,-14.0559123258;久,-15.8476717951;胆,-10.1640920277;葉,-7.33931755231;奋,-12.7566293417;積,-6.23607515975;富,-7.7995226934;阶,-8.77949979467;镓,-11.9356487896;勒,-10.012861058;陕,-12.2100856353;鋸,-12.3213112704;滚,-12.5518349291;菜,-7.39961434248;束,-9.26150014021;卧,-12.4464744134;痨,-13.014458451;楫,-12.2923237336;囪,-10.7237078157;软,-11.4656451604;購,-11.571005676;青,-9.48636931749;柴,-9.588090331;筷,-11.1563239128;壶,-9.23563076023;养,-7.90886954691;建,-9.48982952855;鉍,-15.8476717951;链,-8.37573971682;言,-6.71615820363;褂,-10.5746722365;需,-8.04342041153;禍,-9.51616994517;頌,-14.4613774339;缎,-10.1606964387;玑,-12.8519395215;爐,-8.56835295965;儒,-11.8223201043;梗,-11.3043770128;欖,-10.7600754598;辙,-10.7177730801;丘,-8.83016565212;膝,-11.9356487896;耜,-13.4497765223;审,-9.96993601328;纣,-14.2382338826;夢,-9.69281370105;尤,-11.9764707842;錦,-10.4139497915;垩,-10.6886164958;榭,-11.7872287845;癜,-12.0190303986;莱,-13.139621594;戰,-7.39256679596;脲,-13.0750830728;谛,-11.4909629684;羹,-12.1100021768;常,-10.2985957102;紺,-11.8403386098;值,-5.44848240891;钿,-12.7566293417;圾,-9.28664112917;证,-7.67635492034;跡,-7.21911613579;楂,-11.0854978603;籠,-9.2051849937;立,-13.4497765223;蕊,-9.66972768101;种,-6.62629257597;題,-5.34049688851;彎,-10.6165631782;发,-7.71203189171;兒,-5.97665578267;痕,-9.44079180899;棗,-9.718621585;乘,-11.1471914293;招,-10.7478053672;蓟,-13.7682302534;杞,-11.3933244988;寡,-10.9131978619;廣,-14.0559123258;工,-6.30243185103;層,-6.61195611676;僧,-9.45575468167;卦,-10.3182427076;矩,-8.6156614634;器,-5.68193536933;畦,-13.6504472177;衬,-11.72053741;潮,-7.81791327462;艰,-12.6287959702;蛳,-12.8519395215;輿,-11.8046205272;磷,-11.184232701;翹,-12.2367538824;幸,-8.93194834643;鲑,-14.7490595064;函,-10.5295518012;遼,-11.9158461623;睾,-11.5572123539;檀,-11.2226989818;七,-12.4464744134;概,-10.6112298322;饭,-8.30917679565;釀,-12.4803759651;蜉,-15.8476717951;暈,-10.6828858211;程,-5.49400074073;薊,-13.7682302534;复,-11.3590354253;颌,-10.0157893178;小,-7.45944898494;美,-9.83885860962;冒,-12.2100856353;甕,-13.0750830728;髯,-12.2641528566;栗,-10.6006477229;殖,-11.7367979309;伙,-8.50295274091;饮,-10.0246258996;辛,-12.3213112704;嬡,-14.2382338826;窠,-14.7490595064;縣,-8.46554742933;鲤,-13.3627651453;厦,-9.37997306896;嚨,-9.86625758381;裆,-11.6887887117;氯,-11.6887887117;侮,-12.2100856353;豉,-12.589575257;憲,-11.2937949035;砷,-13.7682302534;家,-4.63464944284;弹,-6.68253801592;庸,-10.8237912742;刻,-7.81466229647;嶺,-8.90841784902;腋,-11.5169384548;绊,-11.72053741;浅,-10.9648698725;绷,-15.1545246145;杉,-9.26981043734;牍,-11.1202839764;霸,-11.4168549962;屏,-9.87386218319;翎,-13.901761646;卑,-9.07116480269;狐,-11.6732845252;噓,-13.139621594;燒,-10.9878593907;街,-8.42052766165;余,-9.26842058305;付,-10.1078788829;淚,-8.11574107311;餘,-9.26842058305;胜,-9.63908176897;章,-7.44791170054;幣,-5.77044104151;革,-9.04084243467;雨,-7.94888943809;腎,-11.068548302;嗪,-11.584991918;業,-4.15109232806;修,-14.4613774339;懲,-11.599176553;敵,-9.34788475441;鲸,-10.8504595213;寶,-8.13746660063;役,-7.62163336558;绸,-9.47435200549;鉻,-11.3933244988;鷺,-12.2100856353;兽,-8.74270634679;鑿,-13.4497765223;矾,-11.584991918;謀,-8.48375829366;貅,-14.2382338826;舆,-11.8046205272;暉,-11.8586877485;月,-7.74690355199;箋,-11.3150723019;萊,-13.139621594;碍,-8.38545685529;餌,-10.9573226668;劑,-7.28780232937;錐,-10.9276908692;酒,-7.62592406672;倒,-12.9032328159;訖,-13.2827224376;优,-12.6287959702;掛,-10.544366887;谚,-11.599176553;肝,-8.95706267492;薟,-15.8476717951;骄,-13.0750830728;骡,-12.9573000372;笠,-11.3043770128;粥,-10.7296779826;鈦,-12.4464744134;在,-8.63464013523;讫,-13.2827224376;鈸,-12.9032328159;梭,-12.1841101489;涯,-9.51795088954;抱,-10.2755177629;鬼,-8.84824932755;娶,-12.4464744134;纹,-8.39410992342;缸,-10.004127378;去,-13.3627651453;尺,-9.84131863546;體,-4.79800475943;瘾,-11.4050205386;促,-12.8519395215;桂,-11.4050205386;薷,-13.2827224376;曉,-14.0559123258;杈,-11.2833236036;摊,-10.9878593907;饌,-12.6287959702;韓,-13.901761646;畔,-9.588090331;願,-8.63096230835;仙,-8.86852651999;潘,-14.2382338826;豚,-10.6658882448;胝,-12.5518349291;塢,-10.9498319951;鳥,-8.58434217759;燧,-11.8586877485;靨,-13.4497765223;毫,-11.1471914293;鹞,-12.4803759651;鵲,-11.1114733467;路,-5.74414556493;贼,-8.4397474725;拱,-12.9032328159;柳,-9.97837488193;聲,-6.60428356904;整,-14.0559123258;婶,-10.2345436887;黹,-13.0750830728;鱺,-11.584991918;都,-7.93049980622;樁,-10.7417263212;讀,-12.1587923409;绪,-7.32588915131;氅,-13.0750830728;着,-10.0070301377;螈,-12.1340997284;嬋,-15.8476717951;鏃,-12.4464744134;阿,-14.7490595064;刑,-8.82569537199;圓,-9.24102160886;炒,-13.2086144654;吕,-13.7682302534;疔,-15.8476717951;辘,-12.0864716794;挛,-15.1545246145;思,-7.28627034898;膜,-7.83764426658;酚,-10.6491747638;宠,-12.7121775791;饽,-11.7872287845;銦,-14.2382338826;瘩,-10.0187261775;咪,-12.1587923409;結,-9.457431128;亮,-8.92798794522;舱,-8.69071543045;項,-7.87038980831;悲,-11.72053741;舟,-10.2164600132;夷,-10.8437254891;鸹,-12.4803759651;医,-8.44888551964;难,-8.32743723859;詁,-10.8504595213;诀,-10.4095924861;佃,-15.8476717951;棂,-11.5436067019;荷,-8.65548973635;拆,-13.7682302534;晉,-10.2831513877;蟈,-13.2086144654;筋,-9.62113512578;擊,-11.1471914293;塍,-15.1545246145;剑,-8.92798794522;瑕,-15.1545246145;痔,-13.4497765223;論,-6.04196246545;乙,-12.3213112704;俘,-10.6381856422;荛,-14.4613774339;骤,-9.85371036776;穡,-13.014458451;滑,-11.7701343512;选,-9.65940767198;履,-11.4782239426;內,-8.49908426414;闪,-12.8519395215;险,-5.99964409973;篓,-11.5572123539;艱,-12.6287959702;葵,-10.5493544285;轿,-11.2627043164;饷,-10.167499186;幹,-8.20370984606;獻,-7.37987895394;偽,-10.8303919582;燼,-10.9060293725;长,-5.24321771291;图,-7.3592896855;漂,-11.72053741;暇,-10.7787675928;鈀,-14.4613774339;韩,-13.901761646;邸,-10.5101337154;礎,-6.42869255798;疑,-10.2641754863;吐,-11.9158461623;園,-7.02844993749;厕,-11.0769871706;鈔,-10.8303919582;禮,-8.23138823348;枝,-8.58925964447;由,-7.8683328998;碣,-12.3819358923;宥,-13.4497765223;鎢,-13.3627651453;隧,-13.7682302534;锦,-10.4139497915;沫,-8.16288785154;匪,-9.52870368132;辭,-9.48982952855;測,-13.6504472177;薹,-12.9573000372;麦,-7.90176219645;戴,-10.7978157878;康,-9.86878603016;妹,-7.9451843579;頸,-9.1226381529;钻,-12.0864716794;笺,-11.3150723019;势,-5.33645879402;汀,-13.2086144654;轂,-11.7533272328;蛇,-9.18709664522;蝠,-10.3064082499;應,-7.44566501346;荊,-11.3368122885;髏,-11.0113898881;呐,-10.8640651734;貫,-11.1027396667;仗,-9.38464233814;赖,-9.91277759944;错,-9.90487241994;虜,-9.52152232191;屠,-12.8519395215;飣,-15.1545246145;形,-6.39650513692;篥,-12.8519395215;盧,-11.1202839764;啦,-15.1545246145;釩,-13.0750830728;鞋,-8.79928538634;鍪,-12.6287959702;迭,-14.7490595064;纓,-12.4464744134;旱,-10.4677744415;想,-6.61890228762;廷,-7.28168843948;孺,-12.3511642336;矽,-9.73177966958;發,-7.71203189171;洁,-12.9573000372;蠃,-14.0559123258;蘇,-11.5301836815;脉,-7.61231115131;莊,-8.59278698499;續,-8.91132905923;唑,-11.3817636764;垒,-9.17311040325;瘘,-13.139621594;朝,-7.70793951535;蚜,-13.3627651453;戟,-10.785076762;紡,-11.2729608166;鲠,-13.901761646;砣,-13.4497765223;鬥,-9.13958771121;陇,-14.0559123258;瘧,-13.014458451;储,-11.599176553;氫,-9.90750054234;京,-10.6491747638;樯,-13.901761646;榮,-11.0354874397;鋼,-7.73484431631;耳,-9.23160660993;茵,-14.4613774339;鲟,-12.1100021768;帷,-15.1545246145;夹,-11.0518812495;吻,-10.2022248974;輞,-13.2086144654;隼,-13.139621594;鈿,-12.7566293417;饴,-15.1545246145;流,-6.13867960025;桃,-8.77017374149;轍,-10.7177730801;屋,-7.71967673929;菊,-11.3703349806;鲡,-11.584991918;铐,-11.4168549962;道,-5.75306813805;单,-7.66791130136;飞,-11.7367979309;淖,-12.9573000372;棘,-10.8778584955;葛,-10.8303919582;诚,-12.5518349291;艟,-13.139621594;絡,-7.53063831857;糠,-12.3511642336;遺,-11.1381415938;癧,-12.8031493573;兩,-10.0793507993;賽,-8.57180719452;螋,-15.8476717951;只,-8.9590993355;潭,-10.7539215943;们,-6.48169613156;辩,-12.2923237336;蟲,-7.31874768077;拴,-15.1545246145;限,-7.360525525;磺,-11.0436507503;寺,-9.10243544558;銫,-15.8476717951;花,-6.62451391938;贪,-14.0559123258;誅,-12.7566293417;欄,-9.48464369152;肉,-7.50292904065;脈,-7.61231115131;舊,-10.4095924861;箏,-10.4271367958;锐,-12.3819358923;钯,-14.4613774339;澗,-10.6658882448;裘,-12.7566293417;斛,-13.2086144654;蜜,-9.89702924248;岡,-11.8964280765;素,-5.89130720293;鸢,-14.4613774339;骥,-14.4613774339;嬤,-11.0354874397;否,-15.1545246145;爪,-10.6715220625;亭,-10.1472282217;漬,-11.2129428068;讯,-7.63131346268;雜,-13.7682302534;鍁,-11.571005676;膳,-12.2367538824;抵,-12.6287959702;德,-7.91530964072;喻,-10.4863796294;看,-15.8476717951;县,-8.46554742933;瀾,-10.6381856422;況,-5.57524481577;鵡,-11.0854978603;颊,-9.70563438948;賣,-12.9573000372;摆,-11.0193580578;腈,-11.72053741;绍,-15.1545246145;彌,-11.8586877485;顎,-11.6281640899;哑,-12.7566293417;镐,-13.014458451;動,-6.3203332963;協,-11.6429791757;俗,-8.23237345524;裙,-9.87386218319;育,-8.73127765097;菟,-12.3213112704;聞,-7.15116155587;峡,-8.52384122886;鵠,-13.901761646;秣,-11.9764707842;幢,-12.4464744134;童,-8.02162778154;孤,-13.4497765223;烩,-12.8031493573;全,-11.325883218;剪,-12.8031493573;佬,-12.1100021768;毯,-9.41473170232;数,-5.38262748235;至,-12.8519395215;貿,-8.82480370898;部,-5.57680182869;奸,-9.8242242021;闻,-7.15116155587;空,-6.92942320403;国,-5.14272091848;豫,-12.4136845906;灾,-9.16807260922;靂,-10.6715220625;亂,-8.96934532677;蜇,-12.2100856353;膈,-12.6287959702;紋,-8.39410992342;把,-9.53775351684;後,-7.46790327956;碎,-12.0410093053;向,-6.48049862906;閾,-13.2827224376;鈕,-10.8989119047;众,-6.714536494;鎘,-13.0750830728;果,-5.94338456236;簡,-10.3628748616;綠,-10.4586000652;红,-8.39353071692;娥,-10.38383999;室,-6.70454017278;霧,-8.66531968318;洫,-12.9032328159;中,-8.02442610438;队,-5.7270185229;萱,-14.0559123258;新,-10.6602859892;醬,-10.3342430489;舵,-11.9764707842;強,-9.01895972342;蹈,-8.75842864004;鳖,-12.9032328159;獵,-9.5976965528;画,-7.20613932939;瞼,-10.8237912742;猿,-10.6165631782;汁,-9.13228840873;淀,-11.3703349806;评,-9.83395663902;蝇,-9.96993601328;蛾,-10.6602859892;重,-7.31756237838;嵋,-13.2827224376;忌,-9.61522377851;筏,-10.1405615303;风,-6.75848262465;鑑,-10.1606964387;盒,-9.4374969131;叔,-8.83645780771;衙,-10.9573226668;櫚,-11.1563239128;晝,-10.8107191926;柜,-9.1605631872;损,-11.1114733467;胞,-7.03945212994;廢,-12.2923237336;驥,-14.4613774339;爛,-10.6547149442;瓦,-10.1606964387;约,-6.91982696885;滓,-12.8519395215;蝈,-13.2086144654;葱,-10.7177730801;腳,-8.33943302038;曲,-7.51825501112;援,-10.7539215943;島,-7.37422152659;塹,-12.0190303986;秸,-11.0034847086;白,-8.06444777873;卿,-10.2309006974;一,-8.84642617299;莉,-11.5301836815;戈,-11.4656451604;酞,-14.7490595064;脊,-9.80503896138;鋒,-8.52516136107;冕,-11.72053741;途,-8.01526086787;記,-6.82970331573;萜,-13.014458451;悟,-10.4095924861;羡,-15.1545246145;鸠,-11.4168549962;索,-8.62876208744;妥,-15.1545246145;堤,-9.22893281155;璧,-12.1587923409;厩,-12.4803759651;刨,-13.7682302534;溫,-7.28245063464;優,-12.6287959702;谬,-13.3627651453;梯,-8.80102451721;襠,-11.6887887117;芳,-11.1471914293;鳟,-12.9573000372;鲷,-13.7682302534;容,-6.60932722668;示,-8.51464878068;疽,-11.1655405679;吼,-14.7490595064;匾,-12.2923237336;濁,-13.901761646;櫃,-9.1605631872;擇,-15.1545246145;杆,-8.1442127472;躍,-14.7490595064;腊,-11.5169384548;籌,-11.2525519449;魎,-13.2086144654;爹,-9.88409245144;燕,-10.6165631782;達,-8.21915416849;橘,-9.52331283268;蛛,-10.3423402591;楚,-10.579813636;藝,-7.42919457659;葜,-14.7490595064;捞,-13.901761646;忡,-12.0190303986;姥,-10.9131978619;塤,-14.2382338826;铧,-12.6696179647;簽,-10.4227217776;警,-8.72641934182;豬,-9.42767686692;靈,-8.35212985118;柱,-8.31826533723;迩,-13.901761646;拳,-9.19739274648;費,-7.22467818476;鹨,-15.8476717951;对,-11.1381415938;穸,-15.8476717951;電,-7.27599041836;饺,-12.3213112704;呼,-10.2309006974;獾,-12.6696179647;企,-10.8848271648;涂,-10.48169578;椅,-8.71917584938;袄,-10.181245107;按,-10.4405000236;燭,-9.33444168415;膊,-8.87039045343;納,-10.534465816;鄰,-10.2755177629;閒,-11.1563239128;儕,-13.7682302534;炔,-11.0854978603;璽,-11.658017053;蒜,-9.1154610886;綢,-9.47435200549;夥,-8.50295274091;颤,-11.7872287845;吧,-9.92609337542;垦,-11.1748429606;猩,-11.2129428068;动,-6.3203332963;丫,-12.1841101489;冪,-15.8476717951;购,-11.571005676;绳,-9.21567001767;议,-5.74181499043;朱,-15.1545246145;蚰,-15.1545246145;戳,-12.1340997284;肴,-10.00123302;簷,-9.97274106421;诈,-14.4613774339;媸,-15.8476717951;阻,-9.71644530558;什,-11.955851497;龙,-8.31237509262;蟆,-10.7978157878;草,-7.43695084816;鹋,-12.8519395215;臊,-15.8476717951;鳌,-11.7872287845;顏,-10.5746722365;坑,-9.48292103821;盐,-8.19750309422;痒,-13.2827224376;汗,-9.46247739607;陸,-7.35970146232;鎬,-13.014458451;虛,-10.310337528;霉,-11.4909629684;罡,-12.589575257;廠,-6.80918793003;巢,-9.48636931749;奥,-13.6504472177;壤,-7.78650043537;韦,-11.6887887117;賬,-9.92074576909;顼,-11.3703349806;東,-6.73252161009;扳,-14.2382338826;頊,-11.3703349806;筹,-11.2525519449;噻,-14.7490595064;骑,-9.44079180899;現,-15.8476717951;殃,-13.5450867021;航,-9.65530930559;梅,-9.64919307857;文,-6.6773204313;蘆,-9.22893281155;舒,-15.1545246145;律,-6.30286118914;福,-9.90487241994;税,-7.39940004911;鰨,-13.901761646;炕,-10.9276908692;響,-8.43914122817;世,-7.81823895448;颏,-12.6287959702;舞,-9.04194924165;张,-7.45332443365;錮,-12.7566293417;颥,-13.0750830728;瘦,-12.3511642336;助,-10.8504595213;錨,-13.2086144654;辫,-11.6429791757;倪,-11.1202839764;蚱,-11.6281640899;帶,-6.25179695047;嬸,-10.2345436887;瞻,-11.2226989818;咽,-12.4803759651;爾,-9.19351927488;仁,-9.64919307857;求,-6.64274605579;装,-7.62673062678;盡,-12.4136845906;拉,-9.53593698591;鳍,-8.8675958545;囑,-10.2418697288;坐,-11.658017053;铢,-13.139621594;僕,-9.57290977382;兔,-10.4495090935;乖,-11.1471914293;識,-6.95671058228;蓝,-10.9131978619;閻,-15.1545246145;臟,-8.02122865961;廡,-12.9032328159;診,-10.8778584955;滨,-9.5957679119;饤,-15.1545246145;痧,-14.4613774339;濫,-14.4613774339;眼,-7.91136910186;杰,-10.2985957102;腴,-12.8519395215;巷,-10.0638466127;并,-12.4136845906;竹,-9.28381626853;學,-4.82139980189;韻,-9.73620445556;顺,-15.1545246145;啼,-12.1841101489;凿,-13.4497765223;丁,-9.07688237115;賁,-12.5154672849;貂,-11.4532226404;栅,-10.6771878;榄,-10.7600754598;舉,-9.59000420718;授,-7.28359501775;對,-11.1381415938;夏,-7.87935229505;咒,-11.5169384548;熔,-13.2827224376;洗,-12.5518349291;準,-6.75870840925;標,-6.35886670018;殘,-12.9032328159;望,-8.29964282513;萝,-10.1405615303;斜,-11.3368122885;感,-7.24246772632;鸡,-8.5878521847;鲢,-13.4497765223;妤,-14.7490595064;利,-6.37812598863;厨,-12.0864716794;漫,-10.3628748616;身,-6.8151431644;颜,-10.5746722365;撲,-10.5493544285;庶,-12.9032328159;页,-9.72080261095;羞,-14.4613774339;跋,-11.8223201043;儿,-5.97665578267;激,-13.7682302534;桅,-13.3627651453;规,-7.96838030998;扉,-12.0410093053;黍,-13.2086144654;齋,-11.5572123539;零,-13.901761646;屍,-8.51268991619;奏,-8.45934393549;頂,-7.91674642258;他,-11.599176553;橙,-11.7872287845;锥,-10.9276908692;棚,-9.28947399225;睑,-10.8237912742;藜,-11.8773798815;苞,-13.139621594;幡,-12.0864716794;忠,-12.6287959702;季,-8.53378496343;鳢,-13.5450867021;秤,-11.7367979309;物,-4.93211071528;襯,-11.72053741;虱,-12.3213112704;缩,-15.1545246145;致,-9.5561026555;延,-10.6165631782;穹,-11.8223201043;寸,-8.90551508936;壺,-9.23563076023;命,-6.94236313387;酿,-12.4803759651;勾,-14.7490595064;禁,-11.2937949035;璃,-8.17027136455;骇,-13.5450867021;鶉,-11.4782239426;專,-11.325883218;肋,-11.7701343512;弊,-10.595398367;舌,-10.310337528;磙,-12.589575257;蝨,-12.3213112704;謂,-10.7356840067;辕,-9.93958885689;渔,-13.5450867021;羅,-10.0762306719;碛,-11.3703349806;宝,-8.13746660063;废,-12.2923237336;氨,-11.2525519449;伪,-10.8303919582;厭,-13.2086144654;键,-7.49370366475;堰,-11.8964280765;岳,-10.3302188986;徵,-7.2433838968;鏟,-11.8046205272;芷,-12.5518349291;方,-5.4734933495;萸,-11.9356487896;机,-5.13998775819;袋,-7.77864246629;派,-7.13129992979;铃,-9.96434940657;竇,-11.955851497;骨,-7.94888943809;屈,-11.7533272328;蛏,-13.139621594;蕎,-14.7490595064;桐,-9.66972768101;賓,-9.53412374879;濕,-10.1539396563;纏,-10.8640651734;狗,-9.50203543423;员,-5.28441288979;飛,-11.7367979309;坚,-11.3703349806;寝,-11.1748429606;廟,-8.48502652464;查,-13.139621594;櫧,-12.6696179647;楦,-13.901761646;烫,-14.0559123258;叭,-9.96993601328;鳳,-10.6715220625;念,-6.84165322016;年,-6.63723142809;苷,-11.4782239426;慶,-9.22493547111;橼,-13.6504472177;仿,-11.2032808959;鬢,-11.5301836815;獁,-13.139621594;吃,-11.0854978603;厂,-6.80918793003;的,-7.05375637143;娇,-13.3627651453;妆,-10.7177730801;紉,-12.1340997284;鲈,-15.1545246145;耋,-14.7490595064;羊,-8.74847005151;昏,-15.8476717951;转,-12.2100856353;輪,-8.03488897649;氓,-10.1986975569;五,-7.97636059174;列,-8.22061437804;甙,-15.8476717951;鸟,-8.58434217759;悠,-14.7490595064;探,-10.4586000652;蜥,-13.2086144654;蚤,-11.5572123539;镰,-13.014458451;贩,-10.0395293051;貨,-6.51396400914;倫,-11.2129428068;侪,-13.7682302534;犬,-10.1143305182;嘯,-10.3064082499;單,-7.66791130136;失,-7.61736099593;陲,-11.9975241934;張,-7.45332443365;户,-6.30422197717;憶,-9.1432574401;蒸,-15.8476717951;蠻,-11.3590354253;螺,-9.85371036776;艋,-15.1545246145;趾,-10.8572392083;参,-9.44244333703;雄,-8.10787733665;姆,-9.65530930559;恋,-12.2100856353;拌,-14.4613774339;虏,-9.52152232191;毒,-8.08295125029;何,-8.94091701641;仔,-10.8504595213;鉗,-12.0864716794;祸,-9.51616994517;留,-14.7490595064;埚,-12.1100021768;孝,-11.5572123539;幟,-9.7495975129;州,-8.21964066813;惠,-11.7701343512;董,-10.2755177629;王,-6.70208330032;来,-9.9532689608;蛤,-12.3819358923;触,-10.3546103517;注,-10.2164600132;火,-7.67805223334;俪,-12.7121775791;獭,-10.9204181099;災,-9.16807260922;问,-7.97293266989;饱,-11.6281640899;声,-6.60428356904;米,-7.7140843774;駒,-9.99546931529;罵,-14.4613774339;维,-7.87831405305;懶,-12.7566293417;譽,-8.16380781481;阴,-9.68015530417;湿,-10.1539396563;邁,-14.4613774339;儀,-8.40987667339;喃,-11.3478621247;隅,-11.0273902295;圄,-13.0750830728;宇,-9.3037599495;堆,-8.92897657604;粉,-8.20084040363;鮭,-14.7490595064;蓠,-13.2827224376;芍,-11.8046205272;褐,-11.0113898881;井,-8.42112272267;演,-8.46991288683;飾,-8.43009139265;咙,-9.86625758381;窝,-8.90165780396;荆,-11.3368122885;龟,-10.2200506814;股,-5.87195660853;鶴,-10.2381999999;闕,-13.0750830728;販,-10.0395293051;质,-5.64515430138;醫,-8.44888551964;个,-11.3368122885;猬,-11.0854978603;鞯,-13.5450867021;鐮,-13.014458451;碱,-8.96216212503;瀉,-11.6281640899;娲,-11.4168549962;庵,-12.0864716794;缴,-12.9032328159;获,-13.6504472177;耶,-14.7490595064;榻,-11.2129428068;蘺,-13.2827224376;便,-9.5672759561;瘴,-14.7490595064;郁,-12.8519395215;痃,-15.8476717951;剂,-7.28780232937;盅,-11.1381415938;靄,-12.0864716794;寇,-9.51261754356;馓,-14.4613774339;鹊,-11.1114733467;拍,-10.8918447375;陣,-9.19868724504;柏,-10.0070301377;羌,-12.3213112704;仕,-10.8107191926;潔,-12.9573000372;照,-8.44217613186;酋,-13.6504472177;膦,-12.2923237336;属,-6.67888285024;惡,-9.61719034748;缺,-11.6135652905;桦,-11.1114733467;鉛,-13.0750830728;篦,-13.2827224376;第,-10.0455534197;魘,-12.3213112704;罩,-9.52510655514;绵,-10.7001773182;恶,-9.61719034748;數,-5.38262748235;智,-9.37842147827;送,-14.0559123258;冀,-14.4613774339;阅,-14.7490595064;垄,-13.3627651453;血,-8.35881883933;尉,-8.64799344937;床,-8.04709914039;戍,-13.901761646;掌,-8.9807385106;树,-7.39491046381;贓,-14.0559123258;北,-10.3302188986;鐙,-12.0864716794;喘,-10.48169578;宜,-8.9429210251;弟,-6.79714812454;鲞,-14.7490595064;膠,-8.01130203452;攣,-15.1545246145;春,-9.49853280368;鋇,-12.7566293417;欧,-11.4050205386;梦,-9.69281370105;锡,-13.139621594;溪,-10.2128821919;爭,-6.74113759181;繳,-12.9032328159;緞,-10.1606964387;钮,-10.8989119047;報,-6.15416480731;紳,-9.3008863843;鸵,-15.8476717951;悶,-11.9764707842;殼,-8.14060913969;漿,-8.71357807387;賴,-9.91277759944;净,-15.1545246145;狂,-13.2827224376;际,-5.64530261982;魇,-12.3213112704;飆,-10.9724744719;屉,-10.579813636;词,-7.90958306817;態,-6.11224792757;廊,-8.73942765533;才,-7.42522894019;菌,-7.8790060946;杏,-10.4910855204;擎,-9.81458557326;桑,-10.0275888647;槐,-11.2032808959;返,-12.6287959702;南,-9.15310973654;蛸,-13.7682302534;瑙,-10.2831513877;痘,-12.1100021768;囚,-11.599176553;罟,-15.8476717951;糞,-11.2032808959;萍,-12.1841101489;臠,-15.1545246145;散,-10.5493544285;闺,-13.139621594;歧,-8.96728771288;淨,-15.1545246145;八,-10.3182427076;仪,-8.40987667339;坯,-10.62731597;瓮,-13.0750830728;顱,-10.2755177629;称,-7.41603649201;銃,-11.2425016091;荒,-10.004127378;鹵,-12.589575257;捷,-10.6658882448;胶,-8.01130203452;襻,-14.4613774339;秋,-8.14782938767;诼,-14.0559123258;使,-7.95671507892;刀,-8.13299432126;碇,-15.1545246145;笆,-11.6135652905;閣,-8.05284864288;师,-6.14636162803;芋,-10.6886164958;祖,-8.68993631081;鹃,-10.8107191926;門,-5.73068706826;椒,-8.84369765834;涕,-10.3712082431;气,-5.6066411509;化,-6.36516916229;嘘,-13.139621594;骛,-14.7490595064;锚,-13.2086144654;妝,-10.7177730801;砜,-13.901761646;粟,-10.6943802006;採,-10.2057647241;蚣,-9.80029961602;萤,-13.6504472177;侩,-13.0750830728;劫,-11.599176553;洪,-11.4050205386;咯,-12.6287959702;蹬,-11.5572123539;箱,-8.08380050724;騰,-10.595398367;纳,-10.534465816;茶,-8.4856612438;檻,-9.04638876059;镞,-12.4464744134;覽,-10.7237078157;格,-5.43715581901;沿,-10.643665108;鉀,-10.6491747638;病,-6.6165488839;鑄,-12.0410093053;壇,-7.61363758737;筆,-8.50813409966;駁,-13.6504472177;苋,-12.5518349291;臍,-11.8586877485;职,-8.43551146012;李,-9.38152707083;译,-9.89702924248;蠹,-15.1545246145;仓,-10.0157893178;卖,-12.9573000372;埙,-14.2382338826;癘,-12.7566293417;駝,-9.66146317116;锻,-13.5450867021;糟,-12.0190303986;鹤,-10.2381999999;蟬,-14.0559123258;慢,-10.9498319951;日,-6.80303187886;棧,-10.3423402591;武,-8.88827328293;俩,-10.3262108772;浪,-8.82658783077;凭,-11.1748429606;瓯,-11.8403386098;篱,-11.4288311873;藩,-12.9032328159;廳,-7.76557851688;縐,-14.7490595064;蟹,-10.3464135845;槽,-10.0275888647;猁,-11.8403386098;犀,-12.0190303986;锅,-9.24780129585;诛,-12.7566293417;堇,-13.7682302534;缉,-15.1545246145;鈷,-14.2382338826;肌,-9.45074213985;搏,-11.0034847086;马,-6.73197182724;檐,-9.97274106421;专,-11.325883218;鎖,-10.2679419691;隘,-10.8042466781;娛,-12.6287959702;墜,-12.0864716794;從,-9.35998777658;挡,-10.8303919582;鵝,-9.8918344256;蔥,-10.7177730801;轤,-12.2100856353;輩,-9.00819535683;亨,-12.2923237336;别,-7.20296528335;炬,-11.3817636764;鬱,-12.8519395215;順,-15.1545246145;帳,-9.75636191299;莶,-15.8476717951;興,-10.2164600132;薺,-12.0190303986;补,-13.4497765223;达,-8.21915416849;十,-12.2923237336;狀,-6.92049040681;哄,-15.8476717951;密,-7.8925975218;廈,-9.37997306896;手,-6.64224346745;緊,-12.0864716794;背,-8.99966652049;蟎,-13.5450867021;角,-7.29897993659;遗,-11.1381415938;静,-8.93592449481;盘,-6.42553197347;祝,-13.3627651453;籟,-11.5038663732;龄,-8.076604709;荡,-11.8046205272;苔,-10.5053375431;佩,-11.599176553;仨,-15.1545246145;六,-14.2382338826;烬,-10.9060293725;瑯,-11.658017053;矮,-12.7566293417;平,-6.19952820707;鳴,-11.6281640899;職,-8.43551146012;書,-6.26714812912;鸝,-12.589575257;旺,-14.7490595064;濾,-12.9032328159;犁,-12.9573000372;垃,-12.9573000372;锄,-15.8476717951;妇,-7.41930981735;炭,-7.33770464874;尊,-10.7600754598;明,-7.0593833348;薯,-8.96728771288;隙,-8.62802975493;團,-6.02257830995;铍,-13.6504472177;祉,-11.955851497;夜,-8.29753645257;挠,-12.2367538824;枣,-9.718621585;攤,-10.9878593907;榧,-12.6287959702;亩,-11.184232701;隨,-12.1587923409;玫,-14.0559123258;傭,-12.9573000372;疯,-14.7490595064;嬰,-10.6771878;難,-8.32743723859;鲵,-11.4168549962;荟,-12.5154672849;戶,-6.30422197717;举,-9.59000420718;勁,-10.5746722365;區,-5.07115598071;埃,-10.1777908721;遂,-14.4613774339;铅,-13.0750830728;婆,-7.77146726782;廉,-11.7367979309;彈,-6.68253801592;届,-14.4613774339;慌,-15.1545246145;族,-6.02311923061;虎,-8.88070465645;諑,-14.0559123258;歐,-11.4050205386;绢,-10.8640651734;法,-5.22600304425;牖,-13.4497765223;釉,-11.4782239426;鯛,-13.7682302534;瑚,-9.33444168415;象,-5.97459190495;繞,-12.8031493573;苡,-12.8031493573;荠,-12.0190303986;量,-4.81975801897;骸,-9.95602758324;試,-10.1273600185;滩,-8.83916661298;轨,-9.93687515102;豪,-8.86202997742;热,-8.84097656823;公,-7.688011058;癮,-11.4050205386;翳,-13.5450867021;鶿,-12.4803759651;懷,-10.0793507993;连,-9.99834701512;曹,-11.8964280765;蝸,-12.4136845906;读,-12.1587923409;渾,-10.9060293725;楼,-7.53578223683;湾,-8.67986261075;鋁,-10.0275888647;圃,-11.184232701;鋪,-8.71757328494;琅,-11.658017053;善,-11.7701343512;备,-6.50964206195;鼴,-13.3627651453;鹭,-12.2100856353;首,-8.46991288683;耍,-11.9158461623;紙,-7.97827008249;谕,-10.0638466127;譯,-9.89702924248;銖,-13.139621594;阙,-13.0750830728;鞘,-10.5594047644;笛,-10.7356840067;堝,-12.1100021768;雪,-7.61390308585;庞,-10.5644680663;肢,-8.68217832;营,-7.9207082502;斤,-12.6696179647;誦,-15.1545246145;温,-7.28245063464;侨,-10.004127378;猫,-9.15931708112;貪,-14.0559123258;處,-7.19280579852;冬,-10.5197956263;锯,-12.3213112704;皮,-7.29376102071;娱,-12.6287959702;绉,-14.7490595064;雲,-8.11311295071;綴,-11.3933244988;霾,-10.9498319951;栽,-12.2367538824;驹,-9.99546931529;额,-6.18963731076;珀,-10.8303919582;僂,-12.4136845906;奇,-9.34488174915;鹉,-11.0854978603;齦,-11.4782239426;糊,-10.9498319951;聍,-14.7490595064;谣,-10.2679419691;敏,-13.2827224376;蛎,-11.0436507503;项,-7.87038980831;体,-4.79800475943;棒,-9.03973685136;藏,-8.12588001825;筛,-12.4803759651;哚,-12.0864716794;硝,-11.1114733467;姜,-10.7001773182;點,-5.25745762977;蝣,-12.4464744134;諺,-11.599176553;藤,-10.9648698725;筐,-11.3590354253;陽,-7.36984332717;卫,-8.58925964447;泪,-8.11574107311;遭,-11.7367979309;釬,-12.4464744134;篆,-11.571005676;目,-5.89149692025;驱,-10.0335412632;寰,-13.2827224376;磲,-12.3511642336;巴,-7.98133287202;虹,-9.83395663902;鳕,-13.901761646;死,-9.37687229128;擺,-11.0193580578;衽,-13.7682302534;滾,-12.5518349291;厅,-7.76557851688;庇,-12.9573000372;須,-9.70348616094;融,-6.12949024836;駕,-11.0601800523;梓,-11.9764707842;錯,-9.90487241994;写,-10.0099413479;馅,-12.2923237336;岛,-7.37422152659;饉,-12.3511642336;帜,-9.7495975129;窟,-8.92305939901;餞,-11.6429791757;患,-9.02112657151;蜢,-13.6504472177;接,-10.4586000652;产,-5.64470947801;账,-9.92074576909;霆,-11.4532226404;鞭,-10.8709380526;犯,-8.68527429771;綱,-9.52870368132;墳,-10.4910855204;宵,-10.2566848146;鱉,-12.9032328159;收,-8.42709288965;治,-6.59965035612;锌,-10.595398367;辽,-11.9158461623;調,-7.51296017324;蚴,-12.0864716794;呀,-13.4497765223;烃,-9.94503846166;坂,-12.3819358923;騷,-10.6112298322;织,-6.93722103865;絆,-11.72053741;擋,-10.8303919582;贲,-12.5154672849;苏,-11.5301836815;慎,-12.5154672849;淑,-13.6504472177;汐,-10.167499186;毕,-12.7566293417;詔,-10.1143305182;盗,-9.3037599495;镖,-11.184232701;燙,-14.0559123258;灘,-8.83916661298;耻,-10.9648698725;神,-6.83030956007;桨,-10.2604231367;短,-9.8918344256;癬,-11.4656451604;鋯,-13.7682302534;酮,-10.6219251213;己,-10.6112298322;绩,-6.37666089988;壳,-8.14060913969;署,-8.94392453748;寵,-12.7121775791;婴,-10.6771878;輔,-8.5471989808;泻,-11.6281640899;渦,-10.0187261775;蹼,-13.7682302534;锁,-10.2679419691;垂,-11.8046205272;包,-7.99678913025;粗,-12.5154672849;餉,-10.167499186;郭,-11.068548302;服,-7.41625438067;蚌,-12.2367538824;戏,-8.09490698621;憎,-12.1841101489;栓,-10.2793272913;诂,-10.8504595213;檔,-10.6828858211;傘,-10.3262108772;厚,-10.7662674301;缝,-8.95097746344;府,-5.64782740489;娟,-13.2086144654;妞,-13.2086144654;枢,-9.63506569931;挥,-10.6547149442;护,-9.83395663902;润,-6.61410329697;梨,-10.7001773182;含,-12.3819358923;圭,-14.0559123258;镉,-13.0750830728;羲,-14.4613774339;鐸,-14.2382338826;脹,-12.0190303986;悸,-13.901761646;莺,-12.2100856353;伽,-10.8107191926;镁,-11.3703349806;铀,-12.6287959702;埂,-12.1100021768;獅,-11.3043770128;鹇,-12.1841101489;奉,-12.9032328159;鯊,-13.0750830728;浑,-10.9060293725;蛹,-13.0750830728;桓,-11.6887887117;煙,-8.19797917135;络,-7.53063831857;驟,-9.85371036776;腑,-9.75862691962;湧,-11.5436067019;飽,-11.6281640899;副,-11.1655405679;饼,-8.93095677471;統,-5.61390974369;峰,-7.47805096811;筵,-12.6696179647;晷,-12.1587923409;时,-7.11021920751;腹,-8.9601192234;胸,-10.2128821919;载,-10.7662674301;纫,-12.1340997284;销,-9.17311040325;阂,-11.3368122885;銅,-8.79322213693;錄,-7.76991423133;鲳,-13.3627651453;将,-7.17501450102;斋,-11.5572123539;誕,-11.8403386098;詐,-14.4613774339;備,-6.50964206195;刚,-9.85121970644;堞,-13.139621594;蒡,-14.0559123258;报,-6.15416480731;侧,-9.59000420718;氦,-12.0190303986;疫,-9.64109586834;訪,-10.837036501;銳,-12.3819358923;环,-8.77864836848;粱,-9.77002955171;細,-9.78621487613;枷,-15.1545246145;龈,-11.4782239426;熵,-14.7490595064;殿,-8.25631474836;品,-4.83002674252;镀,-14.4613774339;療,-7.7606463244;鋅,-10.595398367;獄,-8.74929615647;屆,-14.4613774339;奈,-11.3933244988;旋,-8.9369210071;描,-10.4958136616;醌,-11.8964280765;赐,-9.83640462066;槓,-10.62731597;鯢,-11.4168549962;齒,-8.57249947561;烙,-13.4497765223;階,-8.77949979467;廝,-9.80741708379;移,-10.5543669703;察,-8.82302276461;塞,-9.16306006739;懣,-15.8476717951;若,-11.2032808959;牧,-10.00123302;痫,-11.1027396667;园,-7.02844993749;鼓,-8.9369210071;可,-9.78388658638;干,-8.20370984606;魴,-13.014458451;腸,-8.70880479512;艺,-7.42919457659;份,-5.71537676159;蒲,-11.6732845252;喀,-12.2367538824;皂,-10.3024943506;厄,-13.7682302534;鲆,-14.7490595064;妈,-7.48246496064;统,-5.61390974369;民,-5.37716733911;褓,-11.8586877485;候,-5.72256184758;紛,-9.2051849937;帝,-6.83663638492;龜,-10.2200506814;鬟,-10.1986975569;酱,-10.3342430489;甫,-11.8046205272;說,-6.4664922034;匯,-7.86491409305;炮,-7.49323285495;就,-8.26137548791;纲,-9.52870368132;宴,-9.03422719555;活,-9.09657032613;丽,-12.1841101489;直,-12.1340997284;瑁,-11.571005676;元,-7.02963354467;囂,-13.5450867021;篇,-9.73620445556;秈,-15.8476717951;竊,-15.8476717951;胎,-8.35046457186;楓,-13.6504472177;評,-9.83395663902;比,-8.69854019651;块,-6.42149450029;釘,-10.4271367958;壞,-10.6658882448;葡,-15.8476717951;慣,-7.9496321043;賦,-9.55056247513;桩,-10.7417263212;槨,-9.90225118646;畫,-7.20613932939;癭,-12.4464744134;卯,-13.4497765223;僮,-12.2367538824;山,-6.79106552303;女,-6.62332990345;婵,-15.8476717951;杷,-11.4050205386;聹,-14.7490595064;闾,-11.5169384548;錫,-13.139621594;裾,-12.9573000372;瘀,-11.8586877485;劃,-6.22867142408;锂,-14.2382338826;内,-8.49908426414;缆,-9.71210690398;安,-7.78115030459;稈,-10.9276908692;養,-7.90886954691;茎,-9.15434812679;辑,-7.48037169322;丐,-10.62731597;誓,-11.4909629684;钗,-13.901761646;圖,-7.3592896855;鸭,-10.3880862809;雛,-12.4464744134;墟,-9.8169865348;稱,-7.41603649201;貧,-15.8476717951;伦,-11.2129428068;让,-15.8476717951;樨,-13.5450867021;逆,-11.0518812495;閭,-11.5169384548;听,-10.6165631782;献,-7.37987895394;钉,-10.4271367958;媳,-9.83395663902;紲,-14.2382338826;場,-4.42983753387;锈,-12.0864716794;荞,-14.7490595064;款,-6.39172212706;陀,-10.3966333415;勃,-11.9975241934;蹠,-12.4803759651;築,-7.09509032592;蛋,-8.59208052081;藍,-10.9131978619;俑,-10.8640651734;乐,-7.43228986979;櫓,-15.1545246145;浒,-11.3478621247;桔,-12.0634821611;叙,-12.7566293417;牘,-11.1202839764;廛,-13.4497765223;党,-6.60622042806;川,-7.9878726145;屜,-10.579813636;壟,-13.3627651453;蝉,-14.0559123258;邑,-10.8778584955;苣,-12.589575257;臥,-12.4464744134;车,-5.56001086989;科,-7.22413856788;餮,-12.2367538824;襪,-10.9956415311;闭,-11.955851497;烯,-8.89494315044;忱,-11.8403386098;级,-6.57238673445;絲,-8.33015094446;蝶,-9.89702924248;任,-6.45334458697;腺,-8.44339267703;省,-7.23680612778;刃,-10.4540442487;酪,-10.9878593907;算,-8.14692400055;將,-7.17501450102;蠖,-13.014458451;随,-12.1587923409;籬,-11.4288311873;休,-12.3819358923;源,-5.53612250857;樓,-7.53578223683;烂,-10.6547149442;锨,-11.571005676;飯,-8.30917679565;匙,-9.46585577766;銘,-11.0113898881;帛,-11.0193580578;醚,-9.93687515102;醛,-10.0762306719;实,-6.93681620766;蜡,-10.4958136616;肤,-7.85607951299;氧,-10.3342430489;辦,-9.39090213949;瘫,-11.7701343512;親,-6.48736089651;锭,-10.3423402591;咬,-14.4613774339;厮,-9.80741708379;弱,-10.2164600132;艿,-14.4613774339;網,-7.03795825455;碴,-13.0750830728;架,-7.75390403713;茹,-14.2382338826;主,-6.67513713782;沼,-10.5005642643;设,-9.65530930559;雀,-9.2091040059;痂,-13.7682302534;簍,-11.5572123539;忆,-9.1432574401;等,-10.579813636;晋,-10.2831513877;里,-7.2132290436;潑,-15.1545246145;畏,-13.2086144654;幛,-13.2086144654;絝,-13.3627651453;糜,-12.0634821611;条,-7.93561490688;扣,-9.60156502958;腥,-12.8031493573;莧,-12.5518349291;櫨,-13.7682302534;铬,-11.3933244988;灯,-7.89999322376;鑼,-11.5572123539;影,-7.09224941491;驳,-13.6504472177;已,-14.4613774339;饵,-10.9573226668;飴,-15.1545246145;葷,-13.7682302534;蟶,-13.139621594;泼,-15.1545246145;桿,-8.1442127472;课,-9.91542660761;漁,-13.5450867021;傅,-8.64948821796;霖,-13.014458451;帆,-11.1937114449;笈,-12.6696179647;枋,-14.4613774339;堊,-10.6886164958;稃,-13.6504472177;膏,-9.19480876571;戎,-12.8519395215;云,-8.11311295071;伐,-8.78633742815;讓,-15.8476717951;辯,-12.2923237336;疗,-7.7606463244;脆,-12.9573000372;錘,-10.5493544285;龛,-11.4656451604;通,-6.85362349945;粝,-13.6504472177;稞,-10.7662674301;肥,-8.76764529514;愤,-10.6006477229;涧,-10.6658882448;並,-12.4136845906;垫,-9.87132088576;株,-10.0950991562;臣,-7.06045146643;刮,-14.7490595064;纱,-9.11665369458;茉,-14.7490595064;害,-8.29438518946;鰲,-11.7872287845;头,-5.60172993423;斷,-10.0669282793;芹,-14.7490595064;茸,-11.0193580578;鸽,-10.9801373446;洼,-11.8773798815;蜴,-11.1202839764;雁,-10.7237078157;址,-7.50602317616;參,-9.44244333703;呂,-13.7682302534;兄,-7.91638703354;珠,-8.17351887378;魈,-13.0750830728;塊,-6.42149450029;操,-9.81219036254;敌,-9.34788475441;扎,-11.2129428068;仑,-9.50379136094;佐,-12.9032328159;棕,-11.8586877485;楔,-14.0559123258;癖,-12.2367538824;務,-5.46621244363;鳝,-11.3703349806;鼠,-8.46058155941;租,-8.4525642485;杠,-10.62731597;祧,-14.0559123258;书,-6.26714812912;諦,-11.4909629684;铭,-11.0113898881;罰,-9.68646447337;奴,-8.27826000261;晶,-8.36049810085;泽,-8.28239651316;槿,-13.6504472177;阁,-8.05284864288;磁,-9.12504200021;質,-5.64515430138;熄,-13.014458451;鴇,-12.2923237336;庆,-9.22493547111;守,-9.11189178082;朋,-11.584991918;墊,-9.87132088576;損,-11.1114733467;意,-6.78201043446;芎,-12.2641528566;丑,-10.9878593907;辐,-14.2382338826;榔,-10.9878593907;锗,-15.1545246145;则,-6.68117882287;厘,-13.3627651453;龉,-12.7566293417;轄,-11.1202839764;話,-6.46834843073;急,-11.9158461623;憤,-10.6006477229;货,-6.51396400914;疬,-12.8031493573;飲,-10.0246258996;蕈,-12.4464744134;船,-7.44476775005;輻,-14.2382338826;肺,-10.5644680663;涼,-13.901761646;椿,-12.5154672849;練,-9.76089706815;千,-11.4168549962;鷴,-12.1841101489;细,-9.78621487613;閃,-12.8519395215;旌,-15.1545246145;运,-7.43472862502;類,-6.04212788686;桕,-11.2425016091;盖,-8.86295547494;牙,-9.20258082556;变,-8.39584955853;僚,-8.50037209432;祟,-12.5518349291;鱼,-7.63429005803;荣,-11.0354874397;恥,-10.9648698725;鐧,-11.3368122885;詩,-8.23089598636;睫,-14.0559123258;酯,-10.0485791406;狮,-11.3043770128;糲,-13.6504472177;塵,-8.96626049142;銨,-11.2627043164;批,-12.5154672849;舍,-8.67218208144;胺,-9.26703265778;汽,-9.55795622415;縫,-8.95097746344;西,-6.53405307363;諾,-11.9158461623;妁,-13.2827224376;待,-10.9956415311;诗,-8.23089598636;劇,-7.05012330658;喉,-9.78854859948;合,-8.32365037986;蘖,-12.1340997284;殍,-12.8519395215;亏,-10.711873358;責,-9.00072865548;憑,-11.1748429606;耐,-10.711873358;撓,-12.2367538824;枕,-11.8403386098;昔,-13.2827224376;窗,-8.96114015253;外,-8.92700029081;尘,-8.96626049142;鮮,-11.0113898881;欢,-10.9724744719;两,-10.0793507993;银,-8.41993295453;薩,-8.7127809435;萨,-8.7127809435;箭,-8.25581008017;鷂,-12.4803759651;熱,-8.84097656823;咳,-12.5154672849;嘴,-9.81219036254;褶,-11.6732845252;顫,-11.7872287845;莽,-11.8586877485;放,-15.8476717951;私,-9.73398961523;础,-6.42869255798;魂,-8.67601497229;翅,-11.658017053;幄,-13.139621594;勇,-11.8964280765;兆,-9.67388569116;呈,-12.1841101489;棋,-9.8462569171;坊,-8.81504753403;母,-6.98448045437;鹕,-12.8519395215;济,-4.85096982955;懑,-15.8476717951;恐,-11.2425016091;穢,-11.7701343512;嫗,-12.7566293417;奖,-8.49715562323;滥,-14.4613774339;烛,-9.33444168415;罚,-9.68646447337;盟,-7.98171638113;啞,-12.7566293417;桠,-11.7045370687;泣,-14.2382338826;止,-10.0546581867;腦,-7.63918004332;早,-13.139621594;士,-5.63471621675;碓,-14.0559123258;茛,-12.1100021768;絮,-11.0113898881;灰,-9.06661416913;铳,-11.2425016091;獲,-13.6504472177;韵,-9.73620445556;噴,-14.4613774339;蕨,-14.2382338826;淹,-12.0634821611;豸,-12.9573000372;閘,-10.0425368261;替,-11.584991918;蕾,-10.0546581867;礁,-9.67597119765;墀,-12.4136845906;陪,-13.3627651453;庄,-8.59278698499;切,-11.5169384548;軀,-10.2022248974;锉,-15.1545246145;针,-8.1739836658;脑,-7.63918004332;熙,-8.45317868784;排,-9.83395663902;蜕,-12.4803759651;稗,-15.8476717951;妖,-12.2923237336;崙,-9.50379136094;瀛,-14.0559123258;羚,-11.094081604;匝,-15.1545246145;銜,-9.44409759713;瘟,-12.9032328159;簿,-11.0273902295;氣,-5.6066411509;輥,-12.8031493573;交,-8.28811229906;腰,-10.1143305182;枪,-7.68259253626;记,-6.82970331573;鸯,-9.40036593252;鯨,-10.8504595213;牲,-11.5038663732;眵,-15.8476717951;嚴,-10.0246258996;费,-7.22467818476;貸,-7.17074354553;总,-9.95602758324;押,-13.139621594;蘿,-10.1405615303;奁,-12.3511642336;閡,-11.3368122885;籃,-10.181245107;组,-7.55964022729;則,-6.68117882287;准,-6.75870840925;啉,-11.9356487896;哈,-12.7566293417;麸,-12.8031493573;慑,-11.9158461623;饈,-12.4136845906;插,-13.014458451;蝕,-10.8303919582;穗,-11.3043770128;痞,-11.9158461623;驗,-7.33529016064;棠,-10.8918447375;黄,-9.17311040325;蹺,-12.9032328159;令,-6.63823182833;执,-12.9032328159;髅,-11.0113898881;硫,-10.9276908692;差,-7.40908900423;共,-15.8476717951;味,-7.59652965597;史,-5.88681196267;围,-6.83249508789;腕,-9.99546931529;荽,-12.8031493573;拼,-15.8476717951;虿,-15.8476717951;頁,-9.72080261095;綃,-13.2086144654;弄,-12.2641528566;率,-5.27090819161;倆,-10.3262108772;璉,-15.8476717951;螭,-13.3627651453;見,-7.22990954872;軸,-9.02112657151;認,-12.6696179647;脐,-11.8586877485;戒,-8.30333968701;蚕,-10.0187261775;宗,-8.65548973635;砖,-9.89963680588;顾,-11.4168549962;军,-5.34735524964;帚,-10.7177730801;吞,-14.7490595064;趣,-8.07491907859;伤,-8.73942765533;控,-10.6658882448;芘,-13.2086144654;镝,-13.6504472177;碳,-8.83735992776;铜,-8.79322213693;焰,-9.26703265778;疳,-13.7682302534;蠶,-10.0187261775;油,-6.21474702317;贸,-8.82480370898;雉,-11.3478621247;为,-6.88182630031;芽,-10.0607744137;壁,-7.94555424879;齡,-8.076604709;绅,-9.3008863843;構,-5.43637315792;歌,-8.04955916623;惑,-13.5450867021;腐,-9.16932968041;藓,-10.6943802006;扒,-14.7490595064;蓋,-8.86295547494;漏,-10.8640651734;鯗,-14.7490595064;祥,-10.4052540845;鹚,-12.4803759651;勝,-9.63908176897;卜,-9.57102830572;域,-6.03099563951;瑞,-14.7490595064;裡,-7.2132290436;瀑,-11.6429791757;以,-15.1545246145;潤,-6.61410329697;羽,-10.5197956263;竭,-11.0193580578;籮,-12.4464744134;兰,-9.50203543423;割,-11.4288311873;靴,-10.8989119047;资,-6.77981707138;桶,-9.78621487613;浸,-11.9975241934;舶,-8.61493865889;社,-7.65040842365;鹫,-12.589575257;柿,-11.1563239128;码,-7.4925270556;骂,-14.4613774339;帅,-8.15921643851;径,-7.25629920547;吉,-12.1340997284;隊,-5.7270185229;萏,-14.0559123258;伏,-13.3627651453;蔓,-11.325883218;芒,-9.66558688835;顯,-14.4613774339;鳎,-13.901761646;鶘,-12.8519395215;土,-6.72082173359;钞,-10.8303919582;校,-6.91466720348;责,-9.00072865548;檢,-13.6504472177;严,-10.0246258996;澤,-8.28239651316;茧,-10.590176423;夫,-6.82861300125;蚪,-10.2755177629;騭,-12.7121775791;弯,-10.6165631782;粮,-8.61061276894;週,-9.21567001767;冰,-10.6828858211;劲,-10.5746722365;阵,-9.19868724504;真,-10.6547149442;人,-4.13460941343;甸,-9.25462726092;秀,-11.2129428068;嫂,-9.49853280368;幅,-6.25650059594;鱷,-11.5038663732;升,-13.901761646;闈,-12.2100856353;囊,-8.64352250303;陌,-12.4464744134;晕,-10.6828858211;字,-6.62332990345;籙,-12.2367538824;鸥,-10.9204181099;廚,-12.0864716794;登,-13.4497765223;坟,-10.4910855204;衡,-10.4227217776;槠,-12.6696179647;翠,-10.2272709293;濤,-10.1743485279;葩,-12.7121775791;旨,-8.46182071694;寬,-10.9498319951;凰,-9.51439216692;狲,-11.3150723019;陵,-7.92686211577;歷,-7.68658228222;豹,-9.72517898555;试,-10.1273600185;腻,-10.9060293725;艽,-15.8476717951;礫,-10.5594047644;板,-5.79378344186;宁,-11.3590354253;稀,-12.6287959702;射,-9.99546931529;邇,-13.901761646;缀,-11.3933244988;阈,-13.2827224376;栌,-13.7682302534;伎,-12.3213112704;成,-8.62802975493;蚓,-10.9060293725;脒,-15.1545246145;輯,-7.48037169322;碗,-9.37687229128;徙,-10.0793507993;帘,-9.57857551136;力,-4.65398787145;級,-6.57238673445;钟,-9.18071500263;霞,-10.1472282217;计,-8.00854014679;疇,-9.06095484446;鳶,-14.4613774339;儲,-11.599176553;疵,-11.658017053;琴,-8.47178964685;边,-7.93965235043;丸,-9.35998777658;襞,-13.139621594;膽,-10.1640920277;辋,-13.2086144654;蒿,-12.1340997284;篁,-14.7490595064;练,-9.76089706815;巅,-11.4409525478;韉,-13.5450867021;陈,-11.2325512782;槍,-7.68259253626;桌,-8.89589963066;低,-8.82302276461;藕,-11.8586877485;摔,-13.2086144654;策,-5.61596021476;忙,-11.4532226404;珥,-12.4464744134;騎,-9.44079180899;凝,-14.7490595064;停,-14.4613774339;铟,-14.2382338826;坞,-10.9498319951;毡,-11.8773798815;詠,-12.0634821611;代,-5.88097472913;溺,-15.1545246145;汤,-9.36303655943;脏,-8.02122865961;柩,-11.4050205386;髫,-14.2382338826;蕪,-13.7682302534;駭,-13.5450867021;顬,-13.0750830728;识,-6.95671058228;置,-6.86460850568;雳,-10.6715220625;煲,-13.014458451;颅,-10.2755177629;表,-6.23320053799;迹,-7.21911613579;蓿,-11.658017053;松,-8.15145915572;布,-7.78052275515;如,-12.9032328159;紅,-8.39353071692;历,-7.68658228222;眉,-10.0824806923;疊,-13.4497765223;氏,-9.57102830572;挑,-14.4613774339;易,-6.23667787198;鹅,-9.8918344256;创,-7.71056840542;腮,-14.4613774339;吟,-13.7682302534;次,-8.39817378968;誠,-12.5518349291;渣,-10.1539396563;津,-12.6696179647;性,-4.69682154356;薪,-10.4227217776;簧,-10.0335412632;阳,-7.36984332717;冲,-9.08494228813;电,-7.27599041836;钴,-14.2382338826;样,-7.97636059174;舻,-13.6504472177;肼,-12.7566293417;穴,-8.57180719452;魁,-10.9573226668;繃,-15.1545246145;益,-6.15725370827;鳄,-11.5038663732;假,-8.49394946466;漠,-7.96989546179;囈,-12.8031493573;橋,-8.11881597121;當,-9.03203180499;俎,-13.7682302534;拐,-13.0750830728;晓,-14.0559123258;懒,-12.7566293417;擔,-8.61421637644;塗,-10.48169578;選,-9.65940767198;绘,-10.5746722365;剛,-9.85121970644;線,-5.71513814556;瑟,-13.2827224376;歡,-10.9724744719;貼,-8.37801762213;鍺,-15.1545246145;賤,-11.6429791757;钳,-12.0864716794;藪,-13.2086144654;祭,-14.0559123258;磬,-13.2086144654;屯,-11.5301836815;鹼,-8.96216212503;危,-10.6165631782;鋰,-14.2382338826;陳,-11.2325512782;狒,-12.6287959702;衷,-10.1472282217;滸,-11.3478621247;淺,-10.9648698725;袢,-14.7490595064;突,-10.7417263212;堂,-7.37568519648;約,-6.91982696885;醇,-8.64724690212;分,-5.60660547548;圈,-8.27826000261;残,-12.9032328159;吊,-11.7367979309;袍,-9.1226381529;怒,-11.4909629684;馗,-12.1587923409;騖,-14.7490595064;庙,-8.48502652464;缘,-7.64382042288;尚,-7.90070043737;疟,-13.014458451;餚,-10.00123302;欠,-10.7978157878;侣,-9.8169865348;沥,-15.1545246145;贤,-10.4723933874;木,-7.29723726987;宫,-7.46675662194;辖,-11.1202839764;礬,-11.584991918;鶯,-12.2100856353;帮,-10.7237078157;麓,-9.55056247513;進,-11.2729608166;钵,-12.1841101489;颈,-9.1226381529;伸,-13.7682302534;肽,-11.8964280765;显,-14.4613774339;嫁,-10.9648698725;孀,-12.4464744134;心,-5.52550680295;變,-8.39584955853;鳅,-11.6429791757;組,-7.55964022729;凇,-13.6504472177;牆,-8.17911068705;術,-5.51695764264;蜍,-10.9131978619;告,-6.19046848628;棍,-9.66972768101;苑,-10.7787675928;捐,-13.3627651453;染,-11.1471914293;给,-13.7682302534;兜,-10.9878593907;驴,-10.3754011214;衢,-11.8223201043;泥,-8.13657054322;赤,-11.4782239426;艦,-7.89928650995;杨,-9.90225118646;寫,-10.0099413479;緯,-9.06547973906;狱,-8.74929615647;印,-9.22095404581;石,-6.32801017553;铵,-11.2627043164;畴,-9.06095484446;门,-5.73068706826;薛,-12.1587923409;鈾,-12.6287959702;能,-5.98547509694;虾,-9.88409245144;威,-8.69149515758;简,-10.3628748616;盪,-11.8046205272;蠍,-12.589575257;邪,-11.1202839764;贏,-11.2729608166;于,-9.34938964559;我,-10.5295518012;蜓,-10.9276908692;窖,-10.1709179928;帙,-13.139621594;猛,-12.8519395215;岚,-15.1545246145;瀝,-15.1545246145;农,-8.64277928486;生,-5.60155244359;模,-6.49141454819;漣,-15.1545246145;梢,-10.1405615303;芦,-9.22893281155;螨,-13.5450867021;陆,-7.35970146232;頭,-5.60172993423;馬,-6.73197182724;累,-12.4136845906;纜,-9.71210690398;爱,-9.62708162496;现,-15.8476717951;鐵,-7.20296528335;疴,-12.589575257;丹,-9.65940767198;政,-6.27567888794;婁,-12.9032328159;節,-6.83055216075;遊,-7.5949651185;居,-8.57527340249;護,-9.83395663902;兇,-10.3262108772;钠,-9.80266648103;院,-5.9734071012;槌,-11.1291729238;赏,-10.8709380526;从,-9.35998777658;扑,-10.5493544285;提,-8.26391549436;蝓,-13.014458451;螢,-13.6504472177;套,-8.62729795834;翘,-12.2367538824;鍛,-13.5450867021;覆,-12.3511642336;釜,-15.8476717951;回,-13.2827224376;监,-7.61896099627;佣,-12.9573000372;裢,-11.8403386098;淤,-13.901761646;慧,-9.25462726092;苦,-10.3754011214;孫,-8.82302276461;姬,-12.0864716794;台,-6.63323980518;坳,-11.7045370687;痴,-11.5169384548;楷,-12.0410093053;風,-6.75848262465;俸,-12.7121775791;捻,-13.3627651453;聽,-10.6165631782;臼,-12.3511642336;腔,-8.23138823348;饋,-12.2923237336;境,-6.28463438052;异,-8.06070479245;宅,-8.16565028424;娄,-12.9032328159;皇,-8.60630551174;锆,-13.7682302534;跑,-11.4050205386;霭,-12.0864716794;湖,-8.2099553624;侍,-10.2022248974;锢,-12.7566293417;椎,-10.2418697288;斑,-9.23967116977;肓,-13.139621594;蜒,-11.6429791757;店,-7.45649544423;崖,-9.3270506675;妙,-11.2525519449;領,-7.21768577617;钛,-12.4464744134;阜,-14.4613774339;功,-8.66531968318;涡,-10.0187261775;漢,-8.07155631796;蚧,-12.4803759651;膩,-10.9060293725;怨,-10.3754011214;窯,-9.83395663902;央,-6.79761755302;喱,-14.7490595064;傳,-9.0017919198;露,-10.3796116539;鎵,-11.9356487896;鈴,-9.96434940657;核,-8.69540293903;鉞,-12.6696179647;昼,-10.8107191926;脾,-12.1100021768;局,-6.21043103426;頰,-9.70563438948;商,-6.30207421002;凉,-13.901761646;馍,-11.7045370687;半,-11.9975241934;乌,-11.8586877485;靛,-13.0750830728;貓,-9.15931708112;塘,-9.37378109871;铛,-11.8586877485;魚,-7.63429005803;馆,-7.21911613579;噜,-11.5572123539;煞,-13.901761646;淡,-11.9356487896;池,-7.89014439283;棣,-13.7682302534;潢,-11.7533272328;敦,-11.584991918;恨,-10.0335412632;高,-7.85845038625;端,-7.11746619953;奮,-12.7566293417;闱,-12.2100856353;瑰,-10.0187261775;籁,-11.5038663732;鉴,-10.1606964387;价,-5.6463785869;禾,-11.5169384548;拿,-12.4803759651;腾,-10.595398367;窄,-11.6732845252;疆,-10.1078788829;鄉,-7.80948261509;谋,-8.48375829366;謖,-12.589575257;伍,-8.26289871745;二,-9.83885860962;撐,-13.901761646;礙,-8.38545685529;题,-5.34049688851;君,-9.27120222601;定,-6.31184791341;障,-8.52516136107;贡,-12.7566293417;負,-9.65326640396;蠣,-11.0436507503;誤,-8.076604709;昧,-11.9975241934;薦,-14.2382338826;脩,-15.1545246145;簫,-12.7121775791;措,-9.11784772457;纬,-9.06547973906;妮,-11.571005676;唱,-10.2908437334;環,-8.77864836848;犴,-13.6504472177;椹,-15.8476717951;郵,-13.4497765223;殺,-11.4782239426;朽,-11.7367979309;房,-6.44020335898;憾,-11.584991918;管,-7.10127346095;诊,-10.8778584955;魅,-11.9975241934;跷,-12.9032328159;癇,-11.1027396667;光,-6.34982436595;烈,-10.9060293725;及,-11.5169384548;位,-5.47737320418;軌,-9.93687515102;槎,-13.2086144654;救,-13.0750830728;蟒,-11.9356487896;捕,-11.8403386098;拔,-7.38198244651;壘,-9.17311040325;坝,-9.33890265809;盜,-9.3037599495;滤,-12.9032328159;赡,-14.7490595064;档,-10.6828858211;步,-8.16242818709;虧,-10.711873358;旦,-10.4360257432;腩,-14.2382338826;菪,-12.4464744134;廬,-11.0113898881;鸶,-12.5154672849;卵,-10.3024943506;诺,-11.9158461623;曼,-11.7533272328;承,-10.3182427076;懾,-11.9158461623;岁,-8.85925861306;紀,-5.99437288411;妃,-9.03422719555;市,-5.3601546265;理,-5.59289376886;炉,-8.56835295965;儈,-13.0750830728;刊,-8.25480150722;亍,-15.1545246145;栎,-11.2525519449;撑,-13.901761646;繆,-15.8476717951;谈,-10.6165631782;茔,-12.2923237336;得,-9.01033898038;尖,-9.13714868561;墙,-8.17911068705;蠅,-9.96993601328;稚,-13.7682302534;霜,-10.0669282793;原,-6.49037801013;禄,-10.3587340689;財,-9.83885860962;舰,-7.89928650995;肩,-10.8640651734;截,-14.0559123258;庭,-7.13261183552;鼬,-12.0410093053;钱,-7.96913759892;田,-7.8201952642;防,-8.22598679634;猴,-9.63707171804;樺,-11.1114733467;峁,-12.9032328159;秃,-13.7682302534;幂,-15.8476717951;竅,-11.0854978603;魄,-10.1573123407;呆,-14.2382338826;先,-9.11784772457;淋,-12.7566293417;削,-14.2382338826;軍,-5.34735524964;诏,-10.1143305182;苕,-12.6287959702;荔,-13.7682302534;志,-6.71745746757;游,-7.5949651185;壙,-14.4613774339;痛,-8.23188072303;婚,-10.3222188559;靜,-8.93592449481;叟,-12.9573000372;鋤,-15.8476717951;泡,-9.25325833531;解,-8.99648686757;櫥,-11.72053741;葦,-9.8169865348;惩,-11.599176553;慨,-14.7490595064;巫,-12.2367538824;续,-8.91132905923;齬,-12.7566293417;異,-8.06070479245;凳,-9.95879383673;钒,-13.0750830728;迷,-10.1208240475;汶,-12.6287959702;裹,-9.8242242021;楸,-12.1100021768;藻,-9.37842147827;眾,-6.714536494;杼,-13.901761646;封,-10.2381999999;鯁,-13.901761646;餃,-12.3213112704;麂,-13.6504472177;稅,-7.39940004911;宄,-13.2086144654;震,-8.35491149414;軾,-10.4677744415;倉,-10.0157893178;冈,-11.8964280765;洋,-7.30871711187;犊,-11.8586877485;渍,-11.2129428068;黃,-9.17311040325;欏,-12.5154672849;骚,-10.6112298322;鰍,-11.6429791757;谡,-12.589575257;亢,-12.3819358923;殤,-12.9573000372;紫,-12.589575257;芪,-10.8107191926;席,-6.83407650055;爵,-9.01895972342;根,-8.44644053065;頜,-10.0157893178;蔻,-11.8964280765;钙,-10.3222188559;肾,-11.068548302;屁,-11.584991918;饃,-11.7045370687;廂,-9.39404679617;驅,-10.0335412632;範,-8.81152330131;燈,-7.89999322376;测,-13.6504472177;湍,-13.5450867021;行,-5.65412998593;鹿,-9.07688237115;菔,-14.7490595064;罗,-10.0762306719;糖,-7.97407400538;秘,-9.95602758324;轎,-11.2627043164;陝,-12.2100856353;污,-10.9276908692;鏑,-13.6504472177;楣,-12.4464744134;擦,-13.901761646;恩,-10.2717226919;嵫,-15.8476717951;采,-10.2057647241;繭,-10.590176423;魯,-12.4803759651;壮,-14.4613774339;痰,-12.6287959702;关,-7.1418436848;盲,-10.7060082386;創,-7.71056840542;觸,-10.3546103517;蕻,-13.2086144654;櫺,-11.5436067019;征,-7.2433838968;窃,-15.8476717951;紂,-14.2382338826;禅,-10.6381856422;圆,-9.24102160886;玉,-9.38152707083;事,-5.62725895161;焊,-12.2367538824;氌,-12.3819358923;梏,-12.1587923409;謎,-11.571005676;岗,-10.6602859892;编,-9.57102830572;宙,-8.88448180919;娘,-6.9212871138;際,-5.64530261982;多,-10.590176423;喝,-13.0750830728;澡,-12.6696179647;渠,-9.68857640657;檣,-13.901761646;财,-9.83885860962;辇,-12.4136845906;針,-8.1739836658;庫,-7.84130422741;維,-7.87831405305;遜,-14.4613774339;嘰,-12.7566293417;劳,-9.70563438948;甲,-8.67678331655;况,-5.57524481577;伶,-12.2923237336;讹,-13.7682302534;樸,-11.6135652905;非,-9.62311336579;施,-6.73351198156;萼,-11.3703349806;肿,-9.12865864068;翁,-9.62509552699;幀,-12.3819358923;叉,-9.97274106421;版,-9.41312527628;介,-8.66077077465;纶,-9.84378472796;绣,-9.79558262614;柑,-12.5154672849;苓,-10.6886164958;联,-9.31533750284;鳗,-12.0190303986;篙,-11.9975241934;鷥,-12.5154672849;四,-10.2093171257;嗝,-13.014458451;烟,-8.19797917135;信,-7.74720690403;习,-10.1078788829;葖,-12.589575257;赢,-11.2729608166;烧,-10.9878593907;蝦,-9.88409245144;衣,-7.75910998979;盈,-12.8519395215;屬,-6.67888285024;壯,-14.4613774339;筮,-12.2641528566;陰,-9.68015530417;勳,-10.3628748616;釵,-13.901761646;側,-9.59000420718;毹,-12.589575257;蛻,-12.4803759651;饨,-11.6281640899;弁,-13.3627651453;鏵,-12.6696179647;娃,-8.80713540485;嶂,-12.8031493573;餅,-8.93095677471;缠,-10.8640651734;劈,-12.2923237336;下,-6.58644821277;冊,-9.43257483589;贍,-14.7490595064;貌,-7.88734816591;栏,-9.48464369152;笙,-12.7566293417;骘,-12.7121775791;嘛,-9.42767686692;轮,-8.03488897649;璜,-14.4613774339;速,-7.08627830981;樣,-7.97636059174;阱,-10.0455534197;褥,-10.7724979798;芨,-13.6504472177;師,-6.14636162803;集,-7.88734816591;堯,-15.8476717951;宮,-7.46675662194;皰,-11.72053741;谷,-7.44431942007;侶,-9.8169865348;锰,-12.4803759651;覺,-7.00203853872;蔽,-10.4863796294;蒼,-11.9975241934;绀,-11.8403386098;郊,-9.93958885689;卉,-9.94503846166;籍,-7.74629712383;之,-10.8778584955;释,-10.2200506814;泌,-9.84873523312;村,-7.17467215251;蛐,-12.6287959702;打,-9.90750054234;旒,-14.7490595064;慕,-12.8031493573;鱗,-10.8042466781;孙,-8.82302276461;芥,-11.8586877485;畝,-11.184232701;瓜,-8.52450107712;珞,-12.3213112704;詣,-10.7662674301;裤,-9.63506569931;幫,-10.7237078157;硯,-11.2226989818;篮,-10.181245107;闲,-11.1563239128;兵,-6.22621564347;烴,-9.94503846166;閉,-11.955851497;歹,-9.97555400559;櫸,-12.5518349291;虻,-12.6287959702;錠,-10.3423402591;开,-10.0824806923;它,-14.7490595064;墅,-9.40354053836;处,-7.19280579852;喇,-14.0559123258;例,-6.56445277767;逊,-14.4613774339;規,-7.96838030998;暑,-10.8172338737;莓,-11.094081604;脔,-15.1545246145;帖,-9.62907167537;垛,-11.1937114449;砚,-11.2226989818;甜,-13.014458451;熟,-11.3590354253;亡,-10.4586000652;传,-9.0017919198;氢,-9.90750054234;椤,-12.5154672849;斧,-11.5301836815;鴰,-12.4803759651;芩,-12.1340997284;怪,-9.69069280948;岭,-8.90841784902;種,-6.62629257597;皱,-9.2908934389;地,-5.00195289665;鎳,-12.0410093053;鐲,-11.2325512782;債,-7.6229722331;酊,-15.1545246145;廁,-11.0769871706;繡,-9.79558262614;层,-6.61195611676;磅,-11.3368122885;症,-7.89893334025;癆,-13.014458451;午,-12.589575257;琶,-9.90225118646;蛑,-14.4613774339;材,-6.41059433626;藥,-6.59782228999;賢,-10.4723933874;狳,-13.3627651453;鷗,-10.9204181099;脸,-9.07688237115;站,-6.97771128454;存,-7.93818230239;矛,-11.3368122885;塚,-12.589575257;铝,-10.0275888647;畜,-8.84369765834;營,-7.9207082502;贫,-15.8476717951;满,-13.014458451;诣,-10.7662674301;爺,-6.91361207281;裥,-13.7682302534;旧,-10.4095924861;择,-15.1545246145;快,-11.8046205272;鵬,-11.068548302;积,-6.23607515975;囱,-10.7237078157;右,-11.2627043164;閱,-14.7490595064;僵,-14.7490595064;兴,-10.2164600132;混,-13.7682302534;歸,-10.837036501;蟻,-9.78621487613;砾,-10.5594047644;蓽,-14.2382338826;艾,-13.2086144654;币,-5.77044104151;铁,-7.20296528335;鬃,-11.7872287845;鲂,-13.014458451;堅,-11.3703349806;妄,-12.3511642336;唇,-8.76093386055;隆,-12.4136845906;鈉,-9.80266648103;炊,-12.5518349291;谍,-10.8107191926;涌,-11.5436067019;椏,-11.7045370687;檎,-14.4613774339;蘑,-12.7121775791;析,-11.6135652905;撒,-12.6696179647;耕,-12.3511642336;崗,-10.6602859892;纖,-9.4342128379;官,-6.60225389647;颚,-11.6281640899;喜,-9.09774060127;办,-9.39090213949;渡,-10.8172338737;侠,-10.8918447375;貢,-12.7566293417;莨,-14.7490595064;肪,-8.86110533566;鰭,-8.8675958545;綬,-11.9764707842;嘱,-10.2418697288;錳,-12.4803759651;铲,-11.8046205272;贷,-7.17074354553;溶,-11.4288311873;樹,-7.39491046381;许,-12.2367538824;落,-7.62002908716;於,-9.34938964559;愿,-8.63096230835;魃,-11.6887887117;硅,-9.73177966958;起,-11.7045370687;镇,-7.69922612882;盆,-8.98910676027;珈,-14.4613774339;绶,-11.9764707842;鸣,-11.6281640899;虑,-9.33741345454;某,-13.5450867021;败,-9.68857640657;坛,-7.61363758737;磚,-9.89963680588;關,-7.1418436848;秆,-10.9276908692;勞,-9.70563438948;乡,-7.80948261509;俠,-10.8918447375;正,-9.58427353247;波,-7.77989559928;桥,-8.11881597121;曦,-12.1841101489;鑽,-12.0864716794;鹳,-12.0634821611;饯,-11.6429791757;癱,-11.7701343512;哲,-12.6287959702;灵,-8.35212985118;燴,-12.8031493573;海,-7.38219303933;件,-5.59910628443;橹,-15.1545246145;蝻,-14.2382338826;棺,-11.1291729238;腿,-8.88070465645;魔,-9.78388658638;
+E,o:答,-5.48799814138;喃,-2.85872881813;唄,-6.49959905306;喇,-6.78728112551;隆,-2.70410986389;嚕,-4.02516370314;嗖,-4.66701758931;怦,-3.68120079479;嚏,-8.57904059474;嘎,-4.22233176805;嚓,-3.58182832098;咕,-3.5750942888;唔,-7.48042830607;嘖,-4.79485096082;沙,-6.49959905306;咚,-2.90571732757;瀝,-6.01409123728;溜,-6.78728112551;嘟,-3.66638570901;通,-2.94425099157;沥,-6.01409123728;吧,-6.78728112551;嚦,-6.96960268231;咪,-6.78728112551;冬,-6.63313044569;咯,-3.6737658163;吱,-4.20959274228;嘰,-4.77237810497;喳,-3.89690936762;锵,-6.96960268231;唷,-8.57904059474;嗒,-4.24830725446;颼,-5.53451815702;儿,-8.57904059474;巴,-6.63313044569;呀,-4.28858115359;嗷,-4.70783958383;啄,-7.88589341418;哇,-3.68869146652;拉,-6.09413394495;哈,-2.12227093917;零,-5.14505339026;剌,-7.19274623362;郎,-8.57904059474;乓,-5.63460161558;兒,-8.57904059474;飕,-5.53451815702;噔,-4.42015751138;呗,-6.49959905306;呖,-6.96960268231;淙,-5.24683608457;鏘,-6.96960268231;噜,-4.02516370314;嗤,-6.38181601741;嗡,-3.15409057726;噠,-4.53598932691;唧,-4.30237447573;哧,-3.22718246127;啦,-2.6682439507;汩,-4.64721496202;哨,-5.58330832119;啪,-4.09040422501;叭,-6.96960268231;当,-3.5750942888;呱,-4.59005654818;哒,-4.53598932691;嘿,-3.06561184858;啷,-4.72889299303;當,-3.5750942888;啧,-4.79485096082;潺,-6.96960268231;叽,-4.77237810497;啾,-5.63460161558;
+E,p:著,-2.00128741693;了,-2.02620308158;對,-3.80776367771;同,-5.45547488494;于,-1.45710044246;借,-4.9526356128;從,-4.19462779804;由,-6.52607413738;於,-1.45710044246;沿,-9.64512962696;着,-2.00128741693;过,-1.36902122262;之,-6.56551586943;及,-7.4341117275;从,-4.19462779804;打,-7.12945131851;南,-7.25866304999;據,-2.12550501256;過,-1.36902122262;照,-2.6977931229;自,-9.93281169942;当,-5.55915331441;据,-2.12550501256;至,-6.52607413738;當,-5.55915331441;对,-3.80776367771;
+E,qe:位,0.0;
+E,q:安,-7.72237313194;戈,-10.4949618542;鐘,-4.56006765857;钟,-4.56006765857;錢,-5.37696804177;吨,-6.62376084328;茲,-6.06414505534;場,-7.78691165308;方,-4.10640044864;场,-7.78691165308;格,-6.91144291573;样,-8.88552394175;种,-3.01509772302;金,-9.10866749306;兒,-4.60608389585;句,-5.77646298289;噜,-7.93001249672;日,-7.55052287502;層,-4.79786836768;柱,-8.29773727685;歲,-10.4949618542;年,-4.41502865909;培,-7.49922958063;噸,-6.62376084328;頃,-4.74238921536;簇,-6.9396137927;個,-4.33164705015;鎊,-4.93044144686;頓,-5.27460602911;列,-3.10478042596;崙,-6.30530711216;丛,-7.78691165308;贝,-6.05231059769;次,-6.43451884364;樣,-8.88552394175;天,-3.38100574462;脱,-8.4155203125;耳,-5.90999437551;朵,-7.09376447252;户,-7.85590452457;家,-5.41978803895;组,-7.19912498818;姆,-10.4949618542;镑,-4.93044144686;秒,-6.45191058635;擔,-10.4949618542;畝,-4.80460239986;卡,-6.20450241304;陣,-4.94978440971;叢,-7.78691165308;步,-5.43871604884;令,-7.09376447252;声,-6.85737569446;米,-1.53964277242;顷,-4.74238921536;时,-6.08824260692;兹,-6.06414505534;顿,-5.27460602911;岁,-10.4949618542;处,-9.80181467362;文,-6.50597780762;分,-5.22196229562;明,-9.39634956552;嚕,-7.93001249672;貝,-6.05231059769;亩,-4.80460239986;个,-4.33164705015;種,-3.01509772302;钱,-5.37696804177;地,-7.23686531616;戶,-7.85590452457;点,-10.4949618542;尺,-6.10051269951;琴,-10.4949618542;時,-6.08824260692;担,-10.4949618542;組,-7.19912498818;拉,-4.58145884855;仑,-6.30530711216;子,-4.96157236546;裡,-1.68973665155;聲,-6.85737569446;份,-5.96236236103;伏,-6.88404394154;层,-4.79786836768;弗,-10.4949618542;厘,-6.6663204577;斤,-4.60055901992;度,-7.93001249672;脫,-8.4155203125;阵,-4.94978440971;儿,-4.60608389585;元,-1.53796654226;升,-6.05231059769;重,-8.88552394175;克,-3.70711687188;里,-1.68973665155;郎,-8.54905170513;處,-9.80181467362;比,-8.29773727685;司,-3.69367881971;點,-10.4949618542;瓦,-5.31881212161;赫,-5.93061366272;杯,-9.80181467362;巴,-8.54905170513;特,-5.47108133334;寸,-7.27608602932;
+E,rr:們,-2.23952695703;人,-0.112618878108;们,-2.23952695703;
+E,rz:位,0.0;
+E,r:級,-6.23815020077;一,-4.08538070216;内,-9.37693281164;劇,-8.67623842544;言,-8.27832052297;强,-11.6206774046;师,-12.1802931925;事,-5.75017056997;雙,-7.69446976419;園,-11.9571496412;港,-8.91262720351;店,-9.33248104907;战,-10.0700799922;些,-2.71449697979;会,-7.25666927544;欄,-9.17213839899;週,-7.21395815734;级,-6.23815020077;礦,-10.0700799922;身,-4.62060342883;理,-9.61534383508;般,-6.76530451919;戰,-10.0700799922;段,-7.83973980608;場,-7.84627577706;然,-10.5220651159;方,-6.3880420699;区,-7.27687198275;見,-10.4755451003;款,-9.31809231161;见,-10.4755451003;局,-8.23871138487;必,-10.7333742096;样,-2.97632306757;筆,-6.96671705445;么,-2.19026103861;輩,-8.26827018711;种,-2.88043209463;行,-6.46491158204;獎,-10.7939988314;科,-7.67494334184;兒,-4.64713438509;奖,-10.7939988314;藥,-10.5220651159;四,-9.24909944013;党,-8.13724192471;话,-5.9149919798;棟,-9.42345282727;信,-10.7939988314;為,-8.68378563108;日,-5.77176440148;车,-7.37422506419;俩,-6.86831949955;周,-7.21395815734;班,-10.7939988314;轮,-7.42025829599;己,-2.93094847697;机,-8.44859374125;署,-12.467975265;年,-5.08419286779;表,-11.7748280844;系,-9.92900139394;着,-7.87961219732;省,-6.2694965485;厂,-9.24909944013;庄,-10.927530224;切,-4.45938794061;馆,-9.02329277139;鄉,-9.03398806051;社,-9.63476192094;下,-7.31854467915;莊,-10.927530224;二,-7.13848228098;栏,-9.17213839899;輪,-7.42025829599;樓,-10.3084910156;儕,-12.8734403731;餘,-5.43211998339;伙,-7.38864343961;幅,-9.26252246046;君,-12.8734403731;队,-8.66874775371;次,-3.9148359468;樣,-2.97632306757;多,-10.165390172;夥,-7.38864343961;天,-4.89701668183;風,-10.4310933377;師,-12.1802931925;侪,-12.8734403731;是,-6.70487621318;鎮,-8.37920174782;衲,-9.47224299144;張,-9.28992143465;户,-8.63211362053;家,-3.97268690897;刻,-6.36616266072;麼,-2.19026103861;流,-8.86610718787;组,-9.11224025741;片,-8.83919973495;等,-6.82252836735;院,-8.18669020012;位,-5.87950739788;城,-8.53614963227;村,-7.73470507638;秒,-8.33547893681;何,-3.64349347149;著,-7.87961219732;余,-5.43211998339;畝,-8.52963495125;機,-8.44859374125;州,-7.47076299123;卡,-11.9571496412;廠,-9.24909944013;啥,-7.78276237133;剧,-8.67623842544;某,-8.38480400337;国,-4.72803576344;自,-5.72942790366;業,-10.0112394922;们,-1.73469212721;縣,-7.24761943992;已,-9.01271066206;鳴,-11.7748280844;栋,-9.42345282727;时,-4.05629074836;套,-9.75992506389;書,-6.15987682348;类,-5.27353841389;寺,-10.5708552801;条,-8.84808868237;它,-6.24473783987;市,-7.25303950739;处,-6.0906815843;文,-6.97628650547;倆,-6.86831949955;月,-6.64394366219;型,-8.57615496688;刊,-8.41909307685;隊,-8.66874775371;邑,-12.467975265;餐,-11.0816809039;間,-7.42670300144;如,-8.19594952553;笔,-6.96671705445;團,-8.92219665452;业,-10.0112394922;條,-8.84808868237;的,-4.38094979433;股,-5.76478715175;张,-9.28992143465;报,-5.75340028614;亩,-8.52963495125;用,-8.69905310321;里,-3.37035576308;个,-2.64380151918;本,-7.92823288433;種,-2.88043209463;地,-5.00614332025;戶,-8.63211362053;妻,-9.24909944013;为,-8.68378563108;個,-2.64380151918;县,-7.24761943992;举,-7.19668657083;品,-11.9571496412;區,-7.27687198275;心,-8.27328272894;時,-4.05629074836;情,-9.69538654275;組,-9.11224025741;篇,-10.1992917237;埠,-12.467975265;塊,-6.73032827639;界,-7.30318929107;族,-7.12564101303;子,-7.68326516517;法,-7.84955985226;鸣,-11.7748280844;站,-8.98162007499;晚,-8.86610718787;類,-5.27353841389;裡,-3.37035576308;少,-4.71793466745;场,-7.84627577706;此,-4.27826814037;书,-6.15987682348;黨,-8.13724192471;园,-11.9571496412;公,-10.6762157958;路,-7.47527767158;舉,-7.19668657083;色,-8.1112664383;桶,-7.55043039396;曹,-13.5665875537;項,-5.52678520993;派,-8.19594952553;份,-9.52353628583;楼,-10.3084910156;矿,-10.0700799922;幾,-10.2343830435;老,-7.80768577979;門,-8.64660662783;會,-7.25666927544;者,-4.70736616005;部,-6.45344544496;版,-10.0112394922;所,-8.91262720351;三,-7.47981282675;辈,-8.26827018711;國,-4.72803576344;邊,-6.05670449251;式,-8.76256650893;們,-1.73469212721;父,-7.88641494465;候,-6.48487896756;病,-7.6107501842;初,-10.3477117288;期,-7.03279871573;校,-7.51921537462;妨,-9.92900139394;末,-12.1802931925;屆,-7.05930984128;中,-3.4742166865;支,-10.6762157958;報,-5.75340028614;章,-6.86831949955;生,-9.28992143465;強,-11.6206774046;案,-7.22799347546;人,-3.70147707025;儿,-4.64713438509;我,-6.5348462949;届,-7.05930984128;久,-6.95052236853;長,-7.86614398027;镇,-8.37920174782;株,-11.3693629763;車,-7.37422506419;双,-7.69446976419;风,-10.4310933377;役,-9.45571368949;边,-6.05670449251;盒,-11.9571496412;處,-6.0906815843;块,-6.73032827639;他,-3.8150281526;乡,-9.03398806051;几,-10.2343830435;季,-9.43945316862;团,-8.92219665452;內,-9.37693281164;物,-8.06941932837;门,-8.64660662783;药,-10.5220651159;話,-5.9149919798;台,-10.0700799922;间,-7.42670300144;卷,-10.3885337233;瓶,-10.5708552801;项,-5.52678520993;館,-9.02329277139;长,-7.86614398027;
+E,s:境,-5.2940817553;内,-2.18724672947;中,-2.22652663657;麓,-9.52140200021;頂,-10.032227624;途,-8.76371629852;外,-2.61973186489;厅,-8.37930459961;东,-7.46727826652;場,-4.38992661961;方,-3.2666761552;区,-4.26773338534;线,-5.44273525071;旁,-5.45637182566;口,-4.09880423316;兒,-9.5903948717;端,-8.76371629852;濱,-9.92686710832;廳,-8.37930459961;側,-8.64593326286;陸,-5.67980145908;疆,-6.25564258945;下,-3.32224600635;排,-7.1860270844;颠,-11.1308399126;南,-3.99727796493;環,-8.59186604159;岸,-4.33476135089;城,-7.38526511486;道,-9.33908044342;角,-8.18640093348;街,-7.39317029437;顛,-11.1308399126;線,-5.44273525071;灣,-9.18492976359;滨,-9.92686710832;東,-7.46727826652;场,-4.38992661961;堂,-10.1500106596;处,-3.99887498417;上,-1.63762902522;后,-5.71325912527;間,-5.64190218649;底,-6.02086217522;缘,-11.5363050208;侧,-8.64593326286;庭,-9.5903948717;环,-8.59186604159;地,-3.37492999756;头,-4.62755024144;壁,-6.42130971134;區,-4.26773338534;心,-6.34057424298;陆,-5.67980145908;塊,-5.82587800338;边,-3.41988794796;畔,-10.6200142889;裡,-2.1102486133;緣,-11.5363050208;院,-7.38526511486;陲,-8.59186604159;沿,-6.36582102572;顶,-10.032227624;空,-4.8374206338;国,-8.35825119041;湾,-9.18492976359;門,-8.82825481965;國,-8.35825119041;邊,-3.41988794796;後,-5.71325912527;北,-3.37222170711;頭,-4.62755024144;部,-10.6200142889;儿,-9.5903948717;海,-6.42733382594;郊,-5.30976835147;前,-4.29386481573;里,-2.1102486133;處,-3.99887498417;块,-5.82587800338;內,-2.18724672947;门,-8.82825481965;台,-9.39623885726;荒,-10.4376927321;间,-5.64190218649;起,-3.14717249941;翼,-8.86215637133;西,-8.73294463985;
+E,t:龍,-11.8558317207;了,-7.89819820405;昔,-8.5356034016;外,-9.31685784967;熙,-9.6586071434;那,-7.49912289404;漢,-4.74649706835;猪,-11.8558317207;露,-9.12580261291;宵,-9.77639017905;治,-6.46220417438;寅,-12.9544440094;蛇,-11.8558317207;商,-9.86340155604;凉,-9.95871173585;半,-8.79556092604;晌,-8.45463433907;金,-8.11025692294;狗,-11.8558317207;统,-8.81130928301;早,-6.05371334536;周,-3.80842884798;马,-11.5681496483;深,-8.39009581793;歲,-9.62223949923;年,-2.0556327577;慶,-5.69321891743;滿,-10.3894946519;個,-7.51202629888;羊,-12.2612968288;二,-5.54773327922;昏,-6.28876029162;趙,-8.50009671315;五,-5.60392783757;首,-9.73556818453;朝,-4.07845811807;天,-2.86364735856;之,-9.55324662774;點,-10.8750024677;光,-8.67777789038;寒,-9.45793644793;拜,-11.345006097;来,-2.99684713122;秦,-6.29003498905;国,-6.50081901051;統,-8.81130928301;更,-6.99860663994;时,-3.14873467978;臾,-7.70217058135;岁,-9.62223949923;紀,-5.15428093901;樂,-8.26309612717;順,-9.26556455529;上,-4.42690452593;后,-3.50887342498;唐,-5.70451847268;間,-4.87296896926;底,-4.27105864312;朔,-11.8558317207;餘,-10.3894946519;个,-7.51202629888;猴,-11.345006097;德,-7.04364736536;点,-10.8750024677;段,-6.80384124095;眼,-9.86340155604;尾,-9.06262371129;時,-3.14873467978;先,-7.76148715851;秋,-6.56252689601;晚,-4.84974054103;裡,-5.8803271932;楨,-10.0100050302;旦,-7.47798045747;走,-12.2612968288;至,-7.58380598127;份,-7.58380598127;节,-5.29527264173;清,-6.10220144035;蜇,-12.9544440094;後,-3.50887342498;伏,-8.96545996284;候,-9.00320029082;初,-4.2347998899;期,-3.53806555401;春,-6.97302979815;纪,-5.15428093901;中,-6.63727932265;瞬,-8.4005671178;週,-3.80842884798;元,-7.72869733569;齊,-6.89532081382;久,-7.34131590301;蟄,-9.90992157168;汉,-4.74649706835;今,-3.7620639628;才,-4.67728623697;魏,-6.17225195339;九,-8.11025692294;古,-6.66844591489;限,-8.89400099885;八,-8.01280158679;绪,-12.2612968288;关,-8.30048365924;馬,-11.5681496483;歷,-6.55252681267;陽,-7.40536792451;一,-5.27380658184;内,-5.82514646047;霎,-9.81894979347;化,-8.17532051629;龙,-11.8558317207;降,-10.0640722515;常,-6.97302979815;終,-7.30546977124;种,-10.0640722515;近,-4.76909378622;乐,-8.26309612717;兒,-5.97529873433;靖,-6.75799988161;四,-6.10750086982;楚,-9.45793644793;代,-2.82449840458;日,-2.58039048576;武,-7.56994894661;晨,-5.4011574038;番,-7.9986169518;豬,-11.8558317207;誕,-7.69694863737;七,-8.96545996284;來,-2.99684713122;下,-5.23842874276;夕,-7.72333539255;次,-6.27484482356;启,-7.32682289571;葉,-5.62929505145;阳,-7.40536792451;刻,-10.2463938083;十,-8.63695589586;假,-7.88553980718;终,-7.30546977124;晋,-5.74658413797;晓,-8.66398456825;緒,-12.2612968288;隆,-7.11963327234;余,-10.3894946519;牛,-11.8558317207;诞,-7.69694863737;雨,-9.45793644793;六,-6.89065880071;息,-9.6586071434;蛰,-9.90992157168;赵,-8.50009671315;叶,-5.62929505145;文,-8.04916923096;分,-8.47710719492;月,-3.61404075313;宋,-5.05603291659;明,-6.69486254534;暑,-9.17025437548;世,-6.95302913144;夜,-4.97613303953;鼠,-11.8558317207;在,-2.940892022;历,-6.55252681267;種,-10.0640722515;去,-3.66160241591;雞,-11.8558317207;曉,-8.66398456825;午,-4.06541143753;季,-4.55648490591;子,-8.48853589075;兔,-11.8558317207;满,-10.3894946519;桢,-10.0100050302;顺,-9.26556455529;往,-5.66415112695;庆,-5.69321891743;三,-6.02884881229;國,-6.50081901051;夏,-7.2607118706;丑,-11.8558317207;望,-8.91139274157;醜,-11.8558317207;生,-8.01280158679;鸡,-11.8558317207;度,-10.0640722515;末,-4.53398200694;冬,-7.0993720872;暮,-10.2463938083;涼,-9.95871173585;儿,-5.97529873433;節,-5.29527264173;晉,-5.74658413797;里,-5.8803271932;關,-8.30048365924;啟,-7.32682289571;回,-8.02719032424;正,-10.1818552872;內,-5.82514646047;齐,-6.89532081382;旬,-5.33178005808;间,-4.87296896926;前,-2.22279772965;
+E,u:言,-2.66582706592;内,-3.08591162799;的,-2.27672481502;了,-4.65576346373;看,-2.28075152386;云,-10.7379823741;气,-10.0448351935;外,-6.76769046056;甚,-8.34008710131;樣,-1.18072450765;否,-4.97908060023;說,-1.81146486426;般,-6.73064918888;等,-2.6156111307;雲,-10.7379823741;样,-1.18072450765;论,-5.6442321733;地,-3.8825735755;见,-8.09892504449;着,-7.30399516962;哉,-8.94622290488;氣,-10.0448351935;著,-7.30399516962;論,-5.6442321733;话,-2.67902235634;止,-3.76163430366;內,-3.08591162799;話,-2.67902235634;已,-8.54075779677;说,-1.81146486426;見,-8.09892504449;
+E,vd:加,-8.60666819784;勢,-3.67219426471;步,-2.58929226895;額,-6.81490872862;辭,-5.89861799674;辩,-5.66222921868;复,-4.7251043999;闲,-7.22037383672;名,-6.40944362051;續,-0.137510455466;辯,-5.66222921868;目,-4.91778874373;班,-7.91352101728;閒,-7.22037383672;量,-9.2998153784;然,-6.66075804879;续,-0.137510455466;主,-8.60666819784;额,-6.81490872862;势,-3.67219426471;辞,-5.89861799674;
+E,vi:於,0.0;于,0.0;
+E,vn:怀,-8.0607287566;挂,-10.6808101848;涉,-11.1403425141;谈,-7.53167939387;預,-8.83775742114;抗,-6.76984036531;料,-8.78106207746;造,-5.86350417926;錢,-11.8334896947;礦,-9.29451582363;作,-3.13881999814;河,-12.5266368753;銷,-6.13416157038;吸,-9.67400544534;场,-11.6793390149;宽,-11.6793390149;娼,-11.6793390149;线,-7.75313137444;談,-7.53167939387;反,-9.65495725037;織,-11.8334896947;苗,-11.6793390149;摘,-12.2389548028;话,-6.14482085785;遠,-12.2389548028;知,-8.45476516888;除,-12.9321019834;罪,-6.05842068471;揭,-8.5563449617;扬,-10.5342067106;泳,-7.26394668635;歲,-9.21852991666;痹,-10.1912619594;覆,-12.2389548028;沈,-12.0158112515;引,-8.25461113579;应,-4.54171995881;謝,-8.34713450469;賄,-12.5266368753;遇,-13.6252491639;械,-13.6252491639;殲,-12.2389548028;刷,-7.43084377282;冶,-12.2389548028;頻,-8.97128881376;胀,-12.2389548028;视,-9.5309046017;運,-6.88709666932;鍍,-12.2389548028;寒,-9.75404815301;录,-10.2579533339;教,-9.14791234944;衛,-7.72809529628;盤,-9.20640855612;景,-10.1595132611;基,-12.5266368753;沉,-12.0158112515;贈,-10.2930446537;劍,-9.5309046017;频,-8.97128881376;餐,-9.86404904823;經,-9.43559442189;底,-10.7920358199;默,-11.4280245866;蒙,-9.01012864708;辟,-11.6793390149;憫,-10.5807267262;惜,-12.9321019834;足,-10.9861918343;离,-7.35994795118;笼,-8.78896725697;尾,-12.0158112515;胁,-6.08835203435;釋,-9.73342886581;湊,-12.9321019834;譜,-11.8334896947;迟,-11.8334896947;繪,-8.43229231303;跳,-10.2579533339;号,-11.8334896947;移,-7.32998316248;态,-11.1403425141;节,-5.9404652204;构,-11.2273538911;饭,-12.0158112515;鬧,-10.1912619594;脫,-12.5266368753;纪,-9.14791234944;課,-11.5458076222;稽,-12.9321019834;精,-10.3671526259;拂,-12.2389548028;克,-11.6793390149;車,-9.01012864708;前,-12.5266368753;塑,-11.2273538911;翔,-10.9861918343;賞,-10.6295168904;編,-8.0645675329;卷,-11.6793390149;闸,-9.09264967077;固,-8.44909943135;导,-5.52751859026;戀,-9.54771172001;錯,-10.6295168904;嚣,-9.54771172001;義,-8.072289579;分,-8.78106207746;涵,-10.6295168904;水,-6.54102274182;傷,-8.13631143776;禽,-10.8526604417;凍,-8.581824047;灌,-11.8334896947;结,-9.43559442189;監,-10.7920358199;学,-8.27339103044;诱,-12.2389548028;襲,-7.14367203464;培,-6.64796782229;持,-10.0143312513;标,-12.9321019834;載,-7.97627492576;予,-10.3671526259;笑,-6.35007684447;耗,-10.0417302255;掖,-12.9321019834;辞,-9.63626511736;加,-8.07617307902;缩,-6.95321621846;覲,-11.5458076222;碼,-11.8334896947;识,-11.2273538911;轉,-6.92945024686;免,-9.63626511736;城,-10.8526604417;闹,-10.1912619594;補,-9.75404815301;连,-9.1143896574;卡,-12.0158112515;陣,-12.9321019834;略,-7.85692816813;顧,-11.2273538911;實,-12.9321019834;彩,-9.24322252925;黨,-11.1403425141;扫,-12.9321019834;乳,-12.2389548028;遷,-7.26914150322;相,-10.6808101848;痺,-10.1912619594;好,-12.5266368753;争,-4.6658090203;压,-7.43288667444;谊,-12.2389548028;窑,-12.9321019834;頒,-13.6252491639;純,-11.8334896947;务,-4.55428580841;逢,-10.3294122979;唤,-10.0699011024;馆,-9.49811477887;贴,-10.9861918343;冷,-9.01012864708;制,-5.99430258303;霸,-10.9861918343;礼,-10.0417302255;友,-12.9321019834;兌,-8.6079693271;锢,-11.8334896947;裝,-7.33739060376;占,-10.0699011024;秧,-11.8334896947;諱,-10.489754948;議,-6.71749388494;浴,-9.75404815301;會,-12.0158112515;講,-11.2273538911;负,-11.1403425141;大,-9.05053818542;羨,-12.2389548028;支,-10.4471953336;許,-11.3226640709;状,-12.2389548028;权,-9.13661279419;义,-8.072289579;泊,-12.5266368753;凌,-10.9861918343;問,-7.72535181034;展,-2.79409582149;據,-10.0143312513;衝,-7.91813889917;滞,-9.88757954564;叠,-12.0158112515;督,-5.92450136941;捐,-9.59989747318;話,-6.14482085785;贩,-13.6252491639;權,-9.13661279419;墓,-10.1912619594;依,-10.7920358199;判,-5.75737767352;级,-5.94738566324;撫,-9.37675392187;梳,-12.2389548028;讲,-11.2273538911;段,-11.5458076222;訴,-7.54531596882;嚷,-12.5266368753;区,-13.6252491639;社,-11.6793390149;杂,-11.5458076222;仇,-10.734877406;浆,-10.4471953336;觉,-9.32118407072;案,-9.51437529975;癌,-8.7732189;壓,-7.43288667444;归,-13.6252491639;聘,-10.5807267262;保,-5.80360603768;面,-10.3294122979;继,-8.78106207746;給,-5.9483120181;慮,-7.85692816813;诵,-11.6793390149;雷,-9.79660776743;選,-7.5204559315;忽,-10.489754948;繼,-8.78106207746;考,-8.80496759831;抄,-13.6252491639;變,-7.06989227211;頓,-12.2389548028;肘,-12.9321019834;訟,-6.30075918457;連,-9.1143896574;天,-12.5266368753;風,-8.58829656151;宪,-9.04028168525;音,-9.12543949359;農,-10.2930446537;炸,-11.3226640709;聋,-9.17090186767;稿,-12.9321019834;诊,-13.6252491639;野,-8.75771471346;習,-7.62383428596;孕,-8.69799547876;體,-11.8334896947;汛,-9.84105953;揚,-10.5342067106;機,-6.6442434232;遣,-10.7920358199;勤,-9.10346058687;磨,-8.93390128169;良,-10.0988886393;陷,-10.5342067106;类,-5.80320515573;穿,-12.0158112515;澇,-11.5458076222;訊,-10.5342067106;悯,-10.5807267262;搖,-10.5342067106;館,-9.49811477887;本,-11.6793390149;串,-10.5342067106;点,-6.98015819441;刺,-8.51326137556;宿,-11.6793390149;破,-5.17419577501;時,-11.0602998065;結,-9.43559442189;姓,-12.5266368753;孔,-10.9861918343;潜,-7.54074975084;員,-10.734877406;院,-12.9321019834;票,-9.28144374207;華,-8.59481124253;走,-9.84105953;價,-5.76159789847;酸,-12.9321019834;顾,-11.2273538911;锋,-10.489754948;炎,-9.30776105038;抚,-9.37675392187;丝,-12.0158112515;別,-9.28144374207;谱,-11.8334896947;亲,-9.06090097245;總,-10.9861918343;墾,-10.1912619594;览,-7.76446294045;降,-7.76161798832;赛,-5.53914662825;华,-8.59481124253;远,-12.2389548028;離,-7.35994795118;剥,-10.7920358199;古,-6.95321621846;药,-10.9861918343;滲,-13.6252491639;说,-9.06090097245;银,-10.8526604417;飾,-11.4280245866;計,-4.64394466896;同,-7.89840141633;邏,-9.79660776743;猎,-10.1912619594;研,-7.07131575989;战,-5.98560687606;涝,-11.5458076222;產,-3.49398879169;礪,-12.2389548028;断,-8.32693179737;肯,-12.2389548028;辱,-10.5807267262;鐵,-11.2273538911;資,-2.95313596965;诉,-7.54531596882;像,-8.16141735889;獎,-7.43288667444;駕,-13.6252491639;托,-8.56265413089;距,-10.6295168904;糧,-12.9321019834;審,-7.86005806113;奪,-10.9171989628;葬,-11.4280245866;据,-10.0143312513;买,-10.5807267262;靶,-12.9321019834;叹,-11.6793390149;签,-11.6793390149;蚀,-8.30712917008;斂,-9.73342886581;脅,-6.08835203435;來,-5.8832812641;和,-8.39414054707;透,-10.6808101848;折,-7.97980226628;減,-8.89786134521;液,-11.6793390149;宾,-10.9171989628;汇,-10.4471953336;證,-7.13149532407;网,-11.5458076222;賜,-10.2579533339;睡,-9.19443236508;闢,-11.6793390149;入,-8.2270864624;烤,-11.8334896947;虫,-12.9321019834;擬,-9.59989747318;聯,-6.97367729033;仰,-9.86404904823;卹,-10.6808101848;出,-7.58261633024;顿,-12.2389548028;掃,-12.9321019834;誉,-9.26854033723;型,-6.60149020918;斗,-5.50139490081;管,-4.92656809646;眠,-8.91571896261;带,-10.0417302255;播,-5.41024273116;戮,-10.8526604417;估,-6.33495628147;讳,-10.489754948;銹,-12.2389548028;债,-6.99061580606;杀,-7.39280114737;情,-8.40489333884;埋,-9.04028168525;响,-3.48361122796;界,-12.2389548028;减,-8.89786134521;旗,-10.5807267262;进,-8.64164254221;聚,-10.9171989628;口,-4.27210799331;內,-11.4280245866;陶,-9.06090097245;卸,-8.39414054707;翻,-10.6295168904;驾,-13.6252491639;范,-7.45773267303;了,-12.9321019834;國,-7.11350383428;名,-9.09264967077;暖,-10.6808101848;掘,-12.2389548028;钢,-11.2273538911;约,-9.29451582363;為,-12.9321019834;簽,-11.6793390149;诈,-8.58829656151;敗,-9.20640855612;潛,-7.54074975084;偽,-8.51326137556;乱,-8.71259427818;述,-6.84305710791;零,-11.1403425141;謂,-12.5266368753;序,-9.42055654453;逐,-11.1403425141;会,-12.0158112515;嚇,-9.42055654453;焦,-8.48945072687;训,-6.51373704742;溯,-13.6252491639;贮,-9.51437529975;簸,-10.3294122979;邻,-12.2389548028;缺,-12.9321019834;血,-7.87585617801;藉,-11.3226640709;经,-9.43559442189;凑,-12.9321019834;滯,-9.88757954564;浮,-11.4280245866;奶,-13.6252491639;调,-8.81306480855;撈,-10.4471953336;验,-4.81359691577;吓,-9.42055654453;視,-9.5309046017;客,-10.7920358199;脱,-12.5266368753;岸,-8.38880720109;逻,-9.79660776743;检,-10.2240517823;兑,-8.6079693271;拜,-12.5266368753;號,-11.8334896947;牧,-8.90675029262;鋼,-11.2273538911;老,-7.25022434409;樂,-6.78898988664;雞,-12.2389548028;導,-5.52751859026;間,-12.9321019834;划,-9.48211443753;沙,-11.5458076222;业,-5.58094375693;用,-4.51031897675;辯,-9.91167709722;冻,-8.581824047;裁,-7.476780868;坡,-13.6252491639;跃,-8.2270864624;滅,-10.8526604417;轄,-12.0158112515;效,-11.6793390149;始,-9.5309046017;奠,-12.5266368753;緣,-9.88757954564;噪,-11.4280245866;惱,-12.9321019834;慰,-11.2273538911;色,-9.43559442189;顶,-10.0699011024;击,-5.34758300307;矿,-9.29451582363;清,-8.43229231303;指,-12.9321019834;息,-9.65495725037;謗,-13.6252491639;愛,-9.51437529975;期,-4.2006849028;撞,-7.86950695033;群,-13.6252491639;險,-9.51437529975;設,-4.19104549971;輯,-9.51437529975;應,-4.54171995881;觀,-8.37297573587;赃,-10.1912619594;奋,-13.6252491639;積,-7.6903549683;鋒,-10.489754948;束,-6.26450926086;卧,-13.6252491639;门,-11.5458076222;盪,-6.49515065379;养,-8.83775742114;建,-10.7920358199;言,-13.6252491639;超,-12.9321019834;怜,-13.6252491639;审,-7.86005806113;娠,-9.96168751779;貯,-9.51437529975;戰,-5.98560687606;常,-12.0158112515;值,-8.2592731489;眾,-10.489754948;证,-7.13149532407;立,-9.28144374207;种,-8.28291491195;塌,-11.3226640709;彎,-11.0602998065;发,-6.6850266948;酒,-7.3637574796;乘,-12.5266368753;招,-12.2389548028;工,-4.87250965447;烧,-13.6252491639;卦,-11.3226640709;諫,-10.0699011024;扰,-8.37822509176;幸,-12.0158112515;勻,-10.7920358199;灼,-9.98766300419;有,-5.43406315928;程,-10.8526604417;复,-7.5204559315;碌,-12.9321019834;美,-7.39673816033;冒,-8.65543586434;栗,-12.2389548028;殖,-6.17808080432;伙,-13.6252491639;鸣,-9.3485830449;喪,-9.13661279419;侮,-12.9321019834;憲,-9.04028168525;家,-9.40574145874;弹,-9.71322615849;纸,-8.38880720109;刻,-11.0602998065;炼,-10.3671526259;观,-8.37297573587;泄,-11.8334896947;噓,-13.6252491639;燒,-13.6252491639;街,-12.5266368753;余,-8.13218772058;付,-5.71870193155;跚,-13.6252491639;胜,-13.6252491639;章,-9.61791597869;幣,-12.2389548028;革,-4.58049123273;雨,-8.75005184072;業,-5.58094375693;修,-6.90021552175;敵,-8.75771471346;擴,-13.6252491639;役,-8.17421071035;謀,-10.6295168904;月,-12.9321019834;递,-9.20640855612;优,-13.6252491639;掛,-10.6808101848;袭,-7.14367203464;花,-9.93636970981;头,-8.79693542662;资,-2.95313596965;曉,-12.9321019834;摊,-9.40574145874;換,-8.5072553515;诫,-11.5458076222;路,-9.15934104527;聲,-11.2273538911;整,-4.17888850282;究,-3.53234031747;都,-11.5458076222;讀,-8.96181006981;谅,-11.0602998065;刑,-10.7920358199;挛,-8.09185967519;思,-10.9171989628;宠,-9.59989747318;謫,-10.2579533339;育,-4.4180136069;医,-11.6793390149;难,-9.36256928688;裂,-9.39114265932;擊,-5.34758300307;剑,-9.5309046017;量,-5.90434391198;論,-6.86136425536;俘,-10.0143312513;照,-11.8334896947;险,-9.51437529975;幹,-12.5266368753;卻,-8.88905071553;災,-8.01577736873;图,-8.75771471346;疑,-9.61791597869;吐,-8.75771471346;園,-11.8334896947;鈔,-11.5458076222;匪,-12.5266368753;辭,-9.63626511736;測,-5.05831388061;戴,-11.1403425141;臉,-11.6793390149;青,-10.5807267262;拟,-9.59989747318;煤,-9.58219789609;巡,-12.9321019834;籠,-8.78896725697;形,-10.5807267262;迭,-9.5309046017;旱,-9.56480615337;想,-6.6405328438;發,-6.6850266948;續,-6.99853141467;咐,-9.45086189402;渗,-13.6252491639;倒,-10.2930446537;鬥,-5.50139490081;储,-7.54303025354;光,-7.91813889917;流,-5.9566880559;軌,-9.18259790743;诚,-12.9321019834;絡,-8.00847806625;蟲,-12.9321019834;盼,-13.6252491639;剿,-11.8334896947;贪,-11.0602998065;欄,-12.5266368753;舊,-10.4471953336;騰,-10.489754948;讯,-10.5342067106;雜,-11.5458076222;喻,-11.4280245866;賣,-9.93636970981;摆,-12.5266368753;衣,-10.2930446537;動,-2.99216196882;淫,-11.3226640709;剪,-9.93636970981;转,-6.92945024686;误,-7.59938319009;空,-6.42856259309;国,-7.11350383428;灾,-8.01577736873;亂,-8.71259427818;碎,-11.8334896947;向,-9.15934104527;众,-10.489754948;誚,-12.5266368753;挟,-11.8334896947;贫,-9.00027635064;中,-10.9171989628;新,-7.61398198952;獵,-10.1912619594;画,-12.5266368753;匿,-13.6252491639;淀,-10.4063733391;评,-9.49811477887;重,-9.98766300419;忌,-10.9861918343;风,-8.58829656151;鑑,-11.5458076222;敛,-9.73342886581;损,-5.93131183841;廢,-9.09264967077;度,-7.77017724172;譯,-10.734877406;曲,-12.5266368753;援,-7.37142035234;白,-10.6295168904;一,-4.91248918896;興,-7.53393928184;悟,-11.4280245866;羡,-12.2389548028;索,-7.79336668664;身,-7.48536461169;優,-13.6252491639;容,-7.92815567741;示,-6.9570209155;迁,-7.26914150322;赂,-12.5266368753;擇,-9.45086189402;難,-9.36256928688;達,-10.9171989628;藥,-10.9861918343;捞,-10.4471953336;睦,-12.2389548028;武,-12.9321019834;柱,-10.9171989628;对,-10.7920358199;電,-5.90257164745;呼,-11.0602998065;企,-12.9321019834;涂,-9.63626511736;納,-9.75404815301;閒,-8.5072553515;辖,-12.0158112515;誘,-12.2389548028;夥,-13.6252491639;颤,-10.734877406;垦,-10.1912619594;动,-2.99216196882;购,-5.96137190522;責,-9.75404815301;议,-6.71749388494;阻,-10.9861918343;棄,-10.0143312513;摇,-10.5342067106;草,-11.3226640709;賬,-10.5342067106;诮,-12.5266368753;偿,-6.32275274019;現,-8.79693542662;航,-8.57539315667;文,-11.6793390149;律,-10.734877406;福,-8.43229231303;税,-8.97128881376;殯,-13.6252491639;世,-12.0158112515;舞,-11.5458076222;张,-8.7732189;助,-5.82426709266;防,-8.20029914644;帶,-10.0417302255;砺,-12.2389548028;求,-8.74244724133;装,-7.33739060376;拉,-9.6934235312;监,-10.7920358199;坐,-13.6252491639;識,-11.2273538911;痧,-10.5807267262;迫,-7.95192589675;賭,-11.4280245866;并,-12.0158112515;學,-8.27339103044;顺,-12.0158112515;舉,-13.6252491639;授,-10.7920358199;對,-10.7920358199;夏,-10.7920358199;洗,-8.04930006077;標,-12.9321019834;殘,-8.97128881376;望,-8.53149896311;感,-12.9321019834;鸡,-12.2389548028;利,-5.60959154936;撲,-11.0602998065;激,-12.0158112515;賂,-12.5266368753;衅,-10.734877406;规,-6.92945024686;籍,-13.6252491639;奏,-8.88031703556;叨,-11.2273538911;命,-4.64507695819;退,-10.734877406;弊,-10.3671526259;废,-9.09264967077;伪,-8.51326137556;售,-4.35966331772;徵,-10.734877406;方,-12.2389548028;机,-6.6442434232;讽,-10.3671526259;派,-9.37675392187;釁,-10.734877406;附,-10.0988886393;屈,-9.49811477887;賓,-10.9171989628;员,-10.734877406;飛,-10.9171989628;坚,-9.51437529975;换,-8.5072553515;查,-4.30292029;班,-7.86634739004;念,-10.8526604417;年,-12.5266368753;摸,-12.5266368753;邀,-12.5266368753;球,-10.4063733391;妆,-12.5266368753;羊,-11.6793390149;谓,-12.5266368753;列,-12.9321019834;错,-10.6295168904;肠,-12.9321019834;探,-7.42880503613;洩,-11.8334896947;貨,-7.86950695033;失,-7.30448086967;張,-8.7732189;户,-11.0602998065;改,-9.98766300419;蒸,-9.46636608056;誼,-12.2389548028;允,-12.9321019834;配,-5.45195572495;恋,-9.54771172001;拌,-11.6793390149;毒,-7.37334528075;留,-7.50275635441;惠,-5.70953596454;来,-5.8832812641;触,-9.28144374207;注,-11.3226640709;火,-8.92476879813;迪,-9.86404904823;问,-7.72535181034;声,-11.2273538911;米,-9.58219789609;罵,-10.2240517823;维,-12.2389548028;譽,-9.26854033723;喃,-13.6252491639;順,-12.0158112515;粉,-13.6252491639;寄,-11.0602998065;演,-6.22891387012;甘,-10.8526604417;股,-7.21836917785;讧,-11.1403425141;販,-13.6252491639;质,-9.54771172001;醫,-11.6793390149;踪,-11.8334896947;碱,-13.6252491639;瀉,-12.0158112515;纵,-12.9321019834;缴,-11.6793390149;拍,-12.9321019834;佔,-10.0699011024;受,-11.6793390149;属,-6.5277003133;惡,-11.1403425141;饰,-11.4280245866;恶,-11.1403425141;歼,-12.2389548028;送,-10.0417302255;冀,-11.1403425141;阅,-10.1912619594;床,-6.75208532971;舍,-10.1595132611;树,-12.5266368753;贓,-10.1912619594;閘,-9.09264967077;膠,-10.9171989628;攣,-8.09185967519;春,-8.62803689016;欧,-11.6793390149;躪,-10.7920358199;爭,-4.6658090203;報,-5.83869735749;讼,-6.30075918457;漿,-10.4471953336;际,-11.4280245866;態,-11.1403425141;才,-10.2579533339;觐,-11.5458076222;諒,-11.0602998065;金,-12.2389548028;散,-8.0879148969;拢,-13.6252491639;召,-11.3226640709;称,-10.9171989628;胶,-10.9171989628;师,-12.9321019834;祖,-12.2389548028;訐,-9.79660776743;气,-8.75005184072;化,-3.55075381449;嘘,-13.6252491639;妝,-12.5266368753;採,-11.6793390149;斥,-9.46636608056;辩,-9.91167709722;劫,-10.9171989628;洪,-8.11991762799;溉,-6.40707232552;纳,-9.75404815301;茶,-11.5458076222;覽,-7.76446294045;病,-8.7349000357;駁,-10.734877406;职,-8.19152716037;译,-10.734877406;詐,-8.58829656151;卖,-9.93636970981;骑,-12.9321019834;慢,-10.489754948;日,-6.36613303582;警,-7.89840141633;浪,-9.96168751779;驰,-11.1403425141;槽,-13.6252491639;銀,-10.8526604417;缉,-11.8334896947;逗,-12.0158112515;鎖,-7.2299875658;喚,-10.0699011024;從,-13.6252491639;讦,-9.79660776743;别,-9.28144374207;达,-10.9171989628;狀,-12.2389548028;哄,-12.9321019834;密,-8.34713450469;终,-13.6252491639;手,-11.2273538911;取,-10.734877406;盘,-9.20640855612;荡,-6.49515065379;繳,-11.6793390149;鳴,-9.3485830449;職,-8.19152716037;書,-7.75595225079;匀,-10.7920358199;弈,-8.59481124253;尊,-9.86404904823;明,-11.8334896947;输,-5.08219331298;撥,-12.5266368753;攤,-9.40574145874;谪,-10.2579533339;傭,-9.24322252925;戶,-11.0602998065;举,-13.6252491639;區,-13.6252491639;彈,-9.71322615849;藏,-9.28144374207;歐,-11.6793390149;法,-5.31729661865;赔,-10.0143312513;試,-5.72017631442;轨,-9.18259790743;叫,-9.09264967077;热,-8.51930369002;公,-7.09583032566;懷,-8.0607287566;读,-8.96181006981;备,-5.56250126283;攏,-13.6252491639;掠,-11.3226640709;营,-4.56794342811;誦,-11.6793390149;辨,-9.59989747318;貪,-11.0602998065;熬,-9.86404904823;皮,-13.6252491639;稱,-10.9171989628;贿,-12.5266368753;烂,-12.2389548028;奇,-12.5266368753;糊,-11.5458076222;敏,-10.6295168904;体,-11.8334896947;殺,-7.39280114737;點,-6.98015819441;陽,-12.5266368753;卫,-7.72809529628;質,-9.54771172001;灭,-10.8526604417;目,-13.6252491639;練,-5.89551383253;死,-10.2579533339;擺,-12.5266368753;融,-12.0158112515;写,-11.2273538911;接,-8.35739100486;产,-3.49398879169;账,-10.5342067106;犯,-12.5266368753;收,-8.11586082729;費,-4.32735589494;調,-8.81306480855;织,-11.8334896947;蓋,-12.2389548028;跑,-11.2273538911;试,-5.72017631442;盗,-8.51930369002;博,-11.4280245866;赦,-12.9321019834;表,-9.51437529975;寵,-9.59989747318;泻,-12.0158112515;唁,-12.9321019834;逃,-11.8334896947;包,-12.2389548028;服,-7.86319778114;檔,-12.2389548028;缝,-9.21852991666;护,-7.08855756633;丧,-9.13661279419;润,-11.6793390149;脹,-12.2389548028;獅,-13.6252491639;煙,-9.45086189402;络,-8.00847806625;擠,-12.2389548028;时,-11.0602998065;载,-7.97627492576;销,-6.13416157038;錄,-10.2579533339;備,-5.56250126283;报,-5.83869735749;挤,-12.2389548028;頭,-8.79693542662;疫,-7.05998419388;訪,-10.2930446537;环,-5.85671586299;馳,-11.1403425141;脸,-11.6793390149;访,-10.2930446537;铁,-11.2273538911;镀,-12.2389548028;燃,-11.8334896947;療,-9.45086189402;獄,-10.5807267262;旋,-8.56900335857;赐,-10.2579533339;察,-7.2955282584;塞,-8.9431179368;夺,-10.9171989628;园,-11.8334896947;睬,-12.5266368753;可,-7.6903549683;干,-12.5266368753;腸,-12.9321019834;門,-11.5458076222;民,-8.42675213265;候,-8.42675213265;增,-13.6252491639;榨,-10.4471953336;說,-9.06090097245;匯,-10.4471953336;邮,-9.25580131145;活,-3.98059710928;介,-12.9321019834;囂,-9.54771172001;竊,-12.5266368753;胎,-9.67400544534;評,-9.49811477887;比,-8.55007534869;飞,-10.9171989628;轧,-11.4280245866;畫,-12.5266368753;山,-7.86005806113;劃,-9.48211443753;内,-11.4280245866;安,-12.9321019834;養,-8.83775742114;辑,-9.51437529975;訂,-13.6252491639;圖,-8.75771471346;映,-12.9321019834;貧,-9.00027635064;让,-11.8334896947;听,-9.54771172001;錮,-11.8334896947;場,-11.6793390149;款,-9.81858667415;近,-12.2389548028;乐,-6.78898988664;衔,-12.5266368753;党,-11.1403425141;緝,-11.8334896947;食,-11.2273538911;臥,-13.6252491639;恤,-10.6808101848;车,-9.01012864708;闭,-9.61791597869;絲,-12.0158112515;任,-11.6793390149;省,-11.1403425141;休,-8.84612567081;源,-11.4280245866;訓,-6.51373704742;縛,-8.53149896311;鲜,-9.86404904823;实,-12.9321019834;氧,-8.95242032946;辦,-8.71259427818;瘫,-12.9321019834;親,-9.06090097245;網,-11.5458076222;架,-10.3671526259;貼,-10.9861918343;设,-4.19104549971;充,-12.0158112515;等,-10.9171989628;佑,-12.9321019834;畏,-10.734877406;灯,-9.77510156221;影,-8.44909943135;驳,-10.734877406;購,-5.96137190522;课,-11.5458076222;需,-12.2389548028;伐,-11.0602998065;讓,-11.8334896947;疗,-9.45086189402;通,-4.95122317848;肥,-9.5309046017;愤,-10.6295168904;並,-12.0158112515;纱,-10.7920358199;害,-9.39114265932;礴,-11.6793390149;斷,-8.32693179737;址,-11.5458076222;嫉,-13.6252491639;操,-12.2389548028;敌,-8.75771471346;扎,-12.9321019834;滑,-8.64164254221;務,-4.55428580841;租,-10.6808101848;书,-7.75595225079;哭,-10.6808101848;罰,-6.56049013613;賽,-5.53914662825;崇,-11.3226640709;守,-7.3098911624;損,-5.93131183841;意,-9.96168751779;弛,-9.67400544534;急,-7.45354856651;憤,-10.6295168904;货,-7.86950695033;讨,-9.42055654453;縱,-12.9321019834;堵,-11.2273538911;速,-9.33478972277;船,-7.18589879282;运,-6.88709666932;類,-5.80320515573;盖,-12.2389548028;变,-7.06989227211;狮,-13.6252491639;塵,-10.5342067106;批,-11.6793390149;師,-12.9321019834;禁,-7.77592438397;待,-10.4063733391;閉,-9.61791597869;合,-4.5116399809;訌,-11.1403425141;躏,-10.7920358199;骗,-8.55007534869;外,-5.76854237082;尘,-10.5342067106;缚,-8.53149896311;欢,-9.96168751779;箭,-8.24535181038;纯,-11.8334896947;熱,-8.51930369002;咳,-9.1143896574;放,-10.1912619594;私,-8.00123165773;奖,-7.43288667444;罚,-6.56049013613;盟,-10.8526604417;泣,-12.5266368753;止,-8.98085826478;马,-11.3226640709;諷,-10.3671526259;替,-11.0602998065;切,-8.30223918478;踏,-12.5266368753;排,-6.02434670438;紙,-8.38880720109;銜,-12.5266368753;队,-13.6252491639;氣,-8.75005184072;订,-13.6252491639;交,-7.52717488175;费,-4.32735589494;貸,-8.50128518452;总,-10.9861918343;押,-7.23333205053;籃,-10.7920358199;组,-4.86291612332;片,-9.77510156221;慑,-9.84105953;蝕,-8.30712917008;驗,-4.81359691577;询,-6.09102083765;顫,-10.734877406;差,-10.6295168904;味,-12.9321019834;響,-3.48361122796;颁,-13.6252491639;弄,-10.734877406;率,-13.6252491639;逆,-10.9861918343;锈,-12.2389548028;戒,-8.01212105753;算,-5.95249126728;军,-8.38880720109;猜,-13.6252491639;伤,-8.13631143776;控,-5.76390736832;鄰,-12.2389548028;油,-8.34204543518;为,-12.9321019834;芽,-11.0602998065;構,-11.2273538911;歌,-12.2389548028;惑,-7.82313078854;腐,-11.0602998065;漏,-10.734877406;勝,-13.6252491639;治,-6.42781380982;詢,-6.09102083765;潤,-11.6793390149;割,-11.6793390149;码,-11.8334896947;骂,-10.2240517823;隊,-13.6252491639;伏,-11.2273538911;憐,-13.6252491639;真,-9.96168751779;钞,-11.5458076222;校,-11.2273538911;责,-9.75404815301;檢,-10.2240517823;弯,-11.0602998065;粮,-12.9321019834;冰,-8.99052017569;阵,-12.9321019834;土,-9.51437529975;酵,-10.2579533339;人,-7.16847950835;升,-11.1403425141;益,-9.1143896574;住,-9.3485830449;處,-10.4063733391;字,-9.05053818542;剝,-10.7920358199;衡,-10.734877406;捧,-13.6252491639;摩,-10.6295168904;寬,-11.6793390149;歷,-13.6252491639;擾,-8.37822509176;射,-7.87267652509;成,-7.53620428847;力,-8.99052017569;級,-5.94738566324;计,-4.64394466896;谤,-13.6252491639;到,-8.13218772058;儲,-7.54303025354;边,-13.6252491639;游,-5.66213710494;练,-5.89551383253;行,-4.94169443529;策,-11.6793390149;騎,-12.9321019834;凝,-9.33478972277;停,-12.5266368753;代,-10.0988886393;置,-5.89069031957;恼,-12.9321019834;松,-9.13661279419;布,-11.6793390149;历,-13.6252491639;疊,-12.0158112515;植,-12.9321019834;谏,-10.0699011024;易,-4.59284000044;创,-8.0645675329;誠,-12.9321019834;败,-9.20640855612;性,-8.51930369002;微,-9.61791597869;阳,-12.5266368753;冲,-7.91813889917;电,-5.90257164745;样,-10.1912619594;悼,-10.6808101848;假,-10.4471953336;盈,-12.9321019834;迎,-11.2273538911;晓,-12.9321019834;塗,-9.63626511736;绘,-8.43229231303;牛,-12.9321019834;線,-7.75313137444;歡,-9.96168751779;祭,-12.9321019834;鹼,-13.6252491639;危,-9.77510156221;衷,-10.5342067106;突,-6.36121902102;锁,-7.2299875658;頂,-10.0699011024;約,-9.29451582363;爆,-11.3226640709;残,-8.97128881376;抑,-11.8334896947;缘,-9.88757954564;喟,-11.8334896947;誡,-11.5458076222;木,-12.2389548028;縮,-6.95321621846;励,-7.40864306283;進,-8.64164254221;輸,-5.08219331298;心,-10.0988886393;組,-4.86291612332;采,-11.6793390149;告,-9.77510156221;乎,-12.0158112515;荐,-7.6850779112;染,-6.15104435742;给,-5.9483120181;叛,-9.77510156221;寫,-11.2273538911;狱,-10.5807267262;印,-10.1595132611;石,-11.0602998065;遲,-11.8334896947;決,-6.60774302098;能,-7.94166939658;威,-10.0699011024;弃,-10.0143312513;雪,-8.92476879813;逝,-9.49811477887;农,-10.2930446537;生,-6.79870394036;涤,-11.3226640709;愧,-13.6252491639;砭,-13.6252491639;馬,-11.3226640709;累,-9.96168751779;爱,-9.51437529975;现,-8.79693542662;吵,-9.71322615849;政,-9.3485830449;節,-5.9404652204;居,-10.1287416025;護,-7.08855756633;衍,-13.6252491639;赏,-10.6295168904;从,-13.6252491639;扑,-11.0602998065;提,-12.2389548028;忘,-11.6793390149;回,-7.38692453888;佣,-9.24322252925;跤,-11.4280245866;苦,-11.0602998065;间,-12.9321019834;聽,-9.54771172001;境,-7.24174252904;异,-11.6793390149;皇,-10.2240517823;醉,-9.45086189402;功,-9.81858667415;憩,-11.6793390149;窯,-12.9321019834;閱,-10.1912619594;傳,-5.60300824711;露,-10.9861918343;核,-6.91961006906;商,-6.96595524424;願,-11.2273538911;募,-9.65495725037;恨,-9.15934104527;奮,-13.6252491639;鉴,-11.5458076222;价,-5.76159789847;拿,-10.6808101848;腾,-10.489754948;鄉,-12.2389548028;谋,-10.6295168904;蔑,-11.6793390149;撐,-12.9321019834;定,-6.39323883226;障,-7.18430262329;負,-11.1403425141;誤,-7.59938319009;薦,-7.6850779112;禮,-10.0417302255;唱,-8.20471416465;環,-5.85671586299;论,-6.86136425536;房,-7.17005060058;殡,-13.6252491639;煉,-10.3671526259;位,-6.24125970594;滌,-11.3226640709;救,-8.95242032946;捕,-11.8334896947;飘,-12.2389548028;盜,-8.51930369002;賠,-10.0143312513;档,-12.2389548028;步,-5.92949117337;卵,-8.5563449617;承,-11.0602998065;懾,-9.84105953;岁,-9.21852991666;紀,-9.14791234944;市,-13.6252491639;理,-3.77242352619;躍,-8.2270864624;撑,-12.9321019834;投,-12.0158112515;得,-11.8334896947;餘,-8.13218772058;原,-9.59989747318;截,-12.5266368753;钱,-11.8334896947;决,-6.60774302098;嘲,-11.6793390149;診,-13.6252491639;先,-6.3917937453;削,-11.3226640709;軍,-8.38880720109;痛,-9.06090097245;婚,-9.24322252925;遞,-9.20640855612;泡,-12.5266368753;赠,-10.2930446537;解,-7.23165840997;续,-6.99853141467;逼,-12.9321019834;異,-11.6793390149;勵,-7.40864306283;却,-8.88905071553;迷,-11.4280245866;聾,-9.17090186767;封,-9.42055654453;稅,-8.97128881376;崗,-8.63481657714;震,-9.43559442189;选,-7.5204559315;洋,-12.2389548028;溢,-10.489754948;喜,-10.3671526259;根,-13.6252491639;攻,-5.87592669926;範,-7.45773267303;燈,-9.77510156221;测,-5.05831388061;污,-9.98766300419;擦,-7.57080981765;关,-4.27697460585;創,-8.0645675329;觸,-9.28144374207;征,-10.734877406;窃,-12.5266368753;事,-8.30223918478;焊,-10.3294122979;岗,-8.63481657714;编,-8.0645675329;際,-11.4280245866;喝,-12.2389548028;掩,-12.2389548028;維,-12.2389548028;劳,-13.6252491639;買,-10.5807267262;施,-11.8334896947;挾,-11.8334896947;終,-13.6252491639;叉,-9.19443236508;版,-8.80496759831;軋,-11.4280245866;虐,-12.2389548028;联,-6.97367729033;烟,-9.45086189402;信,-5.87722063949;习,-7.62383428596;屬,-6.5277003133;飯,-12.0158112515;预,-8.83775742114;下,-7.54990313283;栏,-12.5266368753;悔,-10.9861918343;借,-12.9321019834;樣,-10.1912619594;縫,-9.21852991666;鮮,-9.86404904823;覺,-9.32118407072;蔽,-11.1403425141;飄,-12.2389548028;蹋,-13.6252491639;释,-9.73342886581;村,-12.5266368753;打,-11.1403425141;慕,-11.0602998065;高,-13.6252491639;拨,-12.5266368753;篮,-10.7920358199;困,-10.5342067106;闲,-8.5072553515;兵,-7.05576774351;处,-10.4063733391;嘆,-11.6793390149;例,-13.6252491639;規,-6.92945024686;討,-9.42055654453;暑,-12.5266368753;熟,-11.4280245866;亡,-7.37720628941;传,-5.60300824711;谢,-8.34713450469;種,-8.28291491195;地,-9.71322615849;債,-6.99061580606;喊,-9.84105953;遊,-5.66213710494;赌,-11.4280245866;站,-13.6252491639;存,-8.03800050552;營,-4.56794342811;旧,-10.4471953336;择,-9.45086189402;积,-7.6903549683;醒,-9.96168751779;郵,-9.25580131145;兴,-7.53393928184;歸,-13.6252491639;币,-12.2389548028;往,-6.54438126723;堅,-9.51437529975;邊,-13.6252491639;析,-4.22619106764;耕,-9.96168751779;紗,-10.7920358199;騙,-8.55007534869;爛,-12.2389548028;償,-6.32275274019;办,-8.71259427818;渡,-10.3294122979;推,-7.97627492576;夯,-11.8334896947;贷,-8.50128518452;樹,-12.5266368753;许,-11.3226640709;落,-8.17421071035;愿,-11.2273538911;海,-9.20640855612;集,-7.73084632965;虑,-7.85692816813;恕,-13.6252491639;關,-4.27697460585;勞,-13.6252491639;乡,-12.2389548028;正,-10.0417302255;补,-9.75404815301;扩,-13.6252491639;癱,-12.9321019834;起,-8.20029914644;答,-9.79660776743;
+E,vq:过,0.0;過,0.0;
+E,v:耀,-8.97941434286;茂,-12.9867475281;涉,-8.09298659172;谈,-7.81368421772;預,-8.68884388383;洞,-11.2902982387;礦,-9.14436695572;缪,-12.9867475281;河,-8.95331171896;临,-6.65556925044;吸,-7.9161295294;场,-7.73019957442;娼,-11.8582822763;线,-9.65454301792;談,-7.81368421772;反,-7.04945121746;牌,-7.27031809174;雏,-11.6469731826;織,-6.26938263517;拗,-11.3592911102;赞,-8.90613315868;遠,-10.1482008381;知,-5.8415513931;除,-6.2333096095;緩,-8.09571510637;扬,-7.21134936193;歲,-11.51344179;闹,-8.98438535558;愁,-9.81248876871;覆,-9.79739414249;颐,-13.9983484398;应,-5.91780147395;枚,-12.6765925998;謝,-7.31061658477;禦,-7.65315077165;崩,-10.4719879152;是,-5.59589292583;氳,-13.7752048885;讲,-8.18870557442;冶,-11.5560014044;咸,-13.4387326518;運,-7.41321180312;鍍,-11.1949880589;契,-12.5514294568;录,-7.23014262574;教,-7.61231122572;姦,-10.1065281417;括,-5.49647195247;须,-10.278697327;孽,-10.7118139664;广,-7.99384427916;斃,-9.67421578352;沉,-9.15023207517;贈,-9.00113616601;上,-5.69193800997;后,-8.1577067824;碑,-15.3846428009;餐,-9.54691235373;經,-7.57510147624;蒙,-10.2606788215;攘,-12.3889105273;辟,-8.14974438058;閣,-9.78993142129;岩,-11.9506555964;憫,-10.2666489885;茬,-12.0173469709;枯,-11.0151949484;伴,-9.02680053438;离,-6.68163416343;鬼,-9.82781473919;尾,-10.1014390722;胁,-11.1651350957;釋,-6.85967987221;湊,-11.0671546874;壑,-14.6914956203;聖,-10.5643612353;虚,-9.50690701911;譜,-11.0539094606;濟,-9.34438808962;裱,-11.51344179;跳,-9.24260539531;号,-9.27317546139;灶,-11.5560014044;畸,-11.4333990823;姻,-10.6841624351;态,-8.54516636266;节,-8.71260985543;爍,-9.34438808962;厌,-9.40070652021;咎,-10.7794726149;媒,-11.0671546874;茗,-12.2936003475;悖,-11.1505362963;訝,-11.5560014044;輟,-13.5928833317;倡,-8.70128185513;锣,-12.0524382907;鬧,-8.98438535558;纪,-12.7455854713;术,-8.02390289783;課,-8.9153924841;稽,-12.7455854713;拂,-11.0151949484;克,-8.78749709901;前,-6.77395926639;坏,-7.09084319205;塑,-10.8413480186;幕,-8.71260985543;翔,-9.38819071227;胖,-11.600453167;賞,-7.91727173398;勢,-8.33278717794;腫,-9.47113979525;卷,-9.56159690541;齿,-10.7499138127;脂,-12.2065889705;萄,-13.5928833317;贊,-8.90613315868;较,-9.44710659581;纓,-12.5514294568;餒,-13.7752048885;尔,-13.7752048885;挖,-9.92932168554;嚣,-10.8099318224;符,-9.32085759221;披,-10.3347867936;涵,-10.7596699876;鼾,-12.3889105273;所,-6.81239340373;摄,-8.87438446037;勋,-14.2860305122;浊,-11.6234426852;凍,-9.08569355404;灌,-10.4288157433;哏,-13.5928833317;監,-11.8881352394;酢,-12.6765925998;学,-7.29577401173;翩,-13.5928833317;臭,-11.4726197955;诱,-10.0047454474;递,-8.04835714087;践,-7.61737880414;培,-12.4402038217;持,-4.90822844636;标,-7.67758014552;予,-6.91035711049;越,-7.72594324262;笑,-6.94109614964;妒,-9.85918986176;岔,-12.249148585;耗,-8.20153109915;掖,-12.165766976;覲,-10.532612537;隸,-13.9983484398;稻,-12.2936003475;懂,-9.97747102943;毆,-11.2902982387;轉,-6.55220100931;免,-6.93465835917;秒,-13.7752048885;補,-7.92588010851;连,-7.98769419827;略,-7.84668014112;實,-6.88256324729;罩,-9.25777361678;黨,-9.69766744455;乳,-10.4942936727;遷,-7.88799036272;相,-8.38157734211;驻,-8.60131760029;痺,-10.3094689857;好,-6.39619676083;溉,-11.6710707342;王,-9.56159690541;谊,-12.4402038217;疏,-13.1874182236;窑,-11.8292947394;趟,-13.3052012592;务,-13.7752048885;缨,-12.5514294568;贴,-9.04781706975;制,-5.22090860909;霸,-9.89158135755;飞,-8.39900098325;綿,-12.5514294568;鸾,-14.2860305122;友,-10.7895229508;毛,-10.8848331306;乞,-11.8881352394;占,-7.74982212315;秧,-11.9834454192;绩,-12.9867475281;諱,-9.76424193518;浴,-9.52385657743;寻,-9.1861640844;壽,-10.6310526098;會,-5.48727392936;搅,-10.7794726149;薄,-11.6234426852;册,-7.97853941966;嚎,-11.7470566412;缓,-8.09571510637;墒,-12.5514294568;抖,-8.57670785719;講,-8.18870557442;榜,-9.33490934566;负,-7.8424293377;圣,-10.5643612353;疤,-13.9983484398;大,-5.67183160953;羨,-11.0151949484;挫,-8.5281808163;粪,-14.6914956203;支,-9.20669868684;记,-7.31467465183;揀,-11.7210811548;义,-7.33681344343;鍋,-10.953826002;泊,-9.37828964129;遍,-9.6038992851;問,-6.81561646084;当,-6.92190579527;展,-6.60508534501;叠,-8.92317462454;髦,-12.6765925998;繩,-11.6234426852;荫,-11.9506555964;話,-6.42661735753;佳,-11.0026161662;具,-8.2862671623;蜂,-12.3889105273;璋,-15.3846428009;謊,-9.73919590325;依,-9.395681384;厥,-10.0001477381;座,-9.30014338782;撫,-8.84217084039;段,-10.7794726149;訴,-6.22223296267;逸,-10.4501688678;区,-10.4217981706;羽,-13.9983484398;餾,-9.82012239357;胃,-10.5643612353;杂,-8.93892298151;仇,-9.04958854939;浆,-10.9419915444;觉,-7.6984804974;案,-7.96706239848;癌,-10.6310526098;煎,-10.953826002;壓,-7.22441030853;聘,-8.82644499808;泛,-13.4387326518;荚,-12.5514294568;面,-7.5167713105;鉤,-9.10799931155;继,-10.9073059864;慮,-6.44100609498;汰,-8.80539158888;诵,-9.08937679945;雷,-9.06028383851;當,-6.92190579527;忽,-9.87525446426;繼,-10.9073059864;變,-5.84528649297;徒,-11.4528171682;蘗,-12.5514294568;輝,-11.2902982387;溜,-11.9506555964;訟,-12.0888059349;連,-7.98769419827;天,-8.33452028062;農,-10.1588961272;麼,-8.65840939853;稿,-9.47384615685;妾,-12.494271043;蹇,-15.3846428009;淆,-10.4217981706;坍,-13.3052012592;習,-6.76074999082;孕,-8.57229770672;汛,-13.1874182236;機,-8.44248609519;觞,-13.5928833317;勤,-10.7895229508;左,-11.6234426852;曬,-10.0140047728;良,-8.96464787275;陷,-8.01693422852;婿,-13.0820577079;澇,-10.953826002;訊,-9.16405263079;搖,-8.95977377699;戚,-13.1874182236;串,-11.1949880589;点,-8.229246499;刺,-8.50425871871;弼,-12.9867475281;時,-8.3458592595;过,-5.29866703878;結,-6.67040365728;姓,-10.1972569951;答,-6.76724234906;作,-5.68781048217;院,-8.91694407479;華,-8.18645922379;執,-9.22766381531;價,-6.51215561861;煸,-15.3846428009;寿,-10.6310526098;搁,-9.46306438125;抚,-8.84217084039;丝,-9.87931126496;別,-7.40052084219;振,-9.33963748686;亲,-8.75395941525;總,-10.1167846418;墾,-9.35395754063;揄,-11.4726197955;降,-5.88567080743;协,-9.32318588196;屑,-10.2028592506;绒,-13.3052012592;臘,-14.2860305122;远,-10.1482008381;团,-9.95529717194;古,-9.8998458674;药,-8.20229068901;惮,-11.51344179;滲,-11.600453167;鹿,-12.8997361511;瓶,-12.6765925998;幽,-14.6914956203;翼,-14.2860305122;极,-9.28881823846;計,-5.23484219502;同,-7.05957910726;帐,-11.4333990823;战,-5.99289795919;劣,-13.9983484398;產,-6.41892501191;冥,-15.3846428009;礪,-11.6957633468;断,-6.1510743028;悯,-10.2666489885;丰,-10.8960064312;鼓,-9.4313994666;資,-7.19985014673;诉,-6.22223296267;像,-6.94131145807;獎,-8.6358832534;髓,-15.3846428009;駕,-9.20255789418;噠,-12.8997361511;糧,-9.57650031091;篩,-13.7752048885;奪,-7.50119644676;据,-7.73781140946;諳,-10.8737832944;叹,-8.03927796048;签,-9.36119520793;蚀,-7.98097251088;來,-3.85319003131;瘋,-10.2371483241;和,-7.41286667801;庐,-13.3052012592;折,-8.92317462454;憚,-11.51344179;贝,-12.6120540787;蠟,-11.4726197955;禪,-11.2415080745;怯,-12.2065889705;漱,-10.8848331306;縻,-10.6484443525;醺,-13.5928833317;宾,-12.0173469709;證,-6.50364017664;偏,-12.6765925998;緒,-10.0714368219;賜,-9.92932168554;睡,-8.70755933965;因,-12.5514294568;闢,-8.14974438058;虫,-10.066522807;擬,-8.27803666317;聯,-8.94051154419;揮,-6.4611848212;詳,-9.27761991315;卹,-10.7996753222;幻,-11.0539094606;顿,-8.21683361658;掃,-9.19023740979;悅,-11.1651350957;熏,-11.6234426852;刎,-10.9073059864;还,-7.87585563026;供,-5.99173090337;貝,-12.6120540787;眠,-8.41673359909;琢,-10.8737832944;播,-9.54400114352;估,-8.28296682927;犹,-14.2860305122;债,-8.37704218694;杀,-7.34419591959;諉,-11.1651350957;埋,-10.0763751035;响,-8.77934487994;界,-9.35155657909;减,-7.52754893599;黑,-8.84940152988;罐,-14.2860305122;寓,-11.6710707342;旗,-11.6234426852;拙,-13.0820577079;聚,-8.07075596926;詞,-10.2371483241;盡,-8.15988939512;坠,-10.9901936462;敬,-8.58002828083;扮,-8.69255905839;潰,-8.61729967563;闷,-9.38570623895;獸,-13.0820577079;蒂,-12.8196934434;了,-6.84392841444;看,-5.83184812062;暖,-7.93922524419;掘,-7.68118375303;约,-7.12285812138;娩,-10.0963757702;搭,-10.9073059864;隶,-13.9983484398;簽,-9.36119520793;媾,-12.3401203632;擂,-13.4387326518;敗,-6.76471253203;潛,-10.7402519018;穩,-9.10612137673;辦,-6.71730695105;乱,-7.77033065444;長,-4.88821521821;彻,-8.47788802224;雾,-11.2415080745;饿,-11.5344951992;謂,-6.95518852378;纏,-9.52957087869;逐,-8.40085283563;嘔,-12.2065889705;焦,-9.69766744455;溯,-9.24691574681;贮,-12.4402038217;尸,-10.5404557144;强,-5.93844010519;见,-5.27499510208;賃,-9.05849332774;藉,-10.8960064312;凑,-11.0671546874;佚,-10.3542048795;周,-14.2860305122;语,-8.63237242475;浮,-8.79571632336;晴,-12.0524382907;验,-7.65931276298;隔,-8.88786781071;餡,-12.6765925998;纤,-12.494271043;港,-11.2257597175;紹,-6.83169643977;岸,-9.47384615685;检,-8.51147896668;轅,-13.3052012592;兑,-9.52101162529;寢,-11.307105357;牧,-8.88335313035;哨,-10.6932949187;更,-8.0902655016;偻,-11.1949880589;梁,-11.2575084158;訂,-6.88785641925;溅,-10.4217981706;掇,-10.4868030009;蘊,-15.3846428009;窍,-10.6841624351;嬌,-10.9901936462;導,-7.17234566266;划,-8.06081223469;膛,-11.7470566412;搞,-11.8292947394;麥,-12.0524382907;钩,-9.10799931155;用,-4.55751161544;榫,-15.3846428009;瘪,-15.3846428009;吾,-10.3806964949;裁,-9.08202382515;跃,-7.32821603337;菇,-15.3846428009;恆,-10.2028592506;效,-7.81111153815;始,-5.16233794697;忏,-13.9983484398;赘,-11.1799501815;奠,-10.532612537;緣,-8.91229650639;驢,-15.3846428009;觫,-13.7752048885;噪,-10.3157385987;諭,-10.5643612353;慰,-8.18645922379;击,-6.10524289299;響,-8.77934487994;清,-7.7142142787;辄,-13.5928833317;指,-8.8250275634;肆,-12.249148585;完,-7.72358641853;謗,-10.4719879152;谙,-10.8737832944;撞,-9.21294220348;帥,-10.6932949187;群,-9.50410981449;昵,-11.4333990823;爽,-11.7470566412;赃,-10.4501688678;久,-12.7455854713;奋,-7.79076495629;菜,-9.78622084189;束,-6.73012541861;忤,-14.6914956203;门,-6.98263601929;雪,-9.1821072837;佯,-14.6914956203;柴,-10.8848331306;养,-6.85059249241;言,-7.4895793028;溃,-8.61729967563;枉,-9.87121405473;禍,-10.5483608939;頌,-9.16206653282;鼎,-11.3415915331;辙,-12.6765925998;膝,-10.5248303965;怜,-8.39346591377;审,-8.66683810587;常,-9.68086032624;值,-6.67682924987;证,-6.50364017664;捆,-13.7752048885;发,-5.23433423369;囓,-13.4387326518;乘,-9.91658265976;招,-11.1079766819;赚,-11.3592911102;绣,-13.7752048885;層,-10.4358829105;烧,-7.68208668762;卦,-9.93790542923;器,-11.3241997903;諫,-10.6751125996;潮,-9.65454301792;扰,-7.72972575304;勻,-11.5344951992;函,-11.3241997903;灼,-12.9867475281;有,-3.63041957403;程,-9.33255363197;瘓,-9.89158135755;冒,-9.00282678349;殖,-7.95156745199;伙,-8.51044430544;鸣,-8.69878185382;通,-6.89235724518;侮,-10.4646618751;家,-7.07398189499;庸,-13.9983484398;嶺,-13.4387326518;乃,-11.0279339742;車,-7.02106709814;泄,-8.6347116071;屏,-12.8997361511;狐,-15.3846428009;噓,-10.4217981706;燒,-7.68208668762;啕,-12.494271043;付,-6.79345592957;跚,-11.1651350957;胜,-7.52677524156;摟,-12.8196934434;雨,-9.12889275914;闪,-10.1271474289;懲,-10.1697070433;役,-8.12482319053;兽,-13.0820577079;鑿,-9.39317825378;謀,-9.34200996721;碍,-8.38066866417;匐,-10.6055193078;倒,-7.51485889836;亙,-10.5248303965;肝,-11.6957633468;梭,-10.5724584455;涯,-13.0820577079;抱,-9.11365436903;娶,-10.953826002;尺,-13.7752048885;促,-8.55593072925;桂,-13.7752048885;杈,-14.6914956203;摊,-10.6661439296;換,-6.28389410555;虞,-11.1079766819;诫,-9.71131953372;路,-7.66152270863;整,-8.0621323669;究,-7.96886582548;都,-8.35113631661;樁,-12.1265462629;讀,-6.72352244067;袂,-14.6914956203;趄,-11.0279339742;砍,-11.8011238624;酵,-9.52957087869;嘩,-10.3542048795;亮,-8.23237394486;育,-7.48215536373;难,-8.36893038041;毀,-7.89299732729;佃,-10.2084930683;拆,-10.2847763731;擊,-6.10524289299;額,-8.46003040484;绎,-9.08937679945;剑,-10.4942936727;呕,-12.2065889705;論,-6.97726447548;俘,-9.1881986731;飢,-11.0026161662;照,-7.87695272307;饷,-12.165766976;競,-12.2936003475;幹,-8.96139583736;卻,-8.77394675617;偽,-11.0026161662;长,-4.88821521821;谀,-11.9506555964;躬,-10.7402519018;疑,-7.3458080431;吐,-8.65243209443;園,-11.8582822763;缢,-10.4010361792;宥,-12.1265462629;猪,-10.4793680225;頸,-12.0524382907;诅,-13.4387326518;蛇,-13.9983484398;臉,-9.02161469735;忍,-8.61385337698;嗑,-13.3052012592;赖,-7.8345074584;虜,-11.1505362963;拟,-8.27803666317;磣,-11.4726197955;形,-8.09708216058;迭,-11.4928225028;發,-5.23433423369;勿,-11.4333990823;洁,-10.9419915444;莊,-12.0173469709;咐,-7.46093246692;垒,-11.3773096157;褙,-14.2860305122;舟,-11.4143508873;鬥,-8.43191415627;氫,-11.1361475588;京,-8.69380052347;飚,-14.6914956203;嚼,-9.83946535641;赁,-9.05849332774;屋,-9.86718990443;道,-4.71575717609;单,-9.6163218051;诚,-10.4358829105;絡,-8.88185275498;嗦,-9.59774541953;煩,-9.55569718328;部,-10.7596699876;豫,-13.9983484398;聳,-10.1806361138;盼,-9.78252398001;剿,-9.27096062106;悉,-7.03114570215;脈,-10.8848331306;舊,-9.34677188097;素,-11.8881352394;殯,-11.3241997903;抵,-9.5013204124;夸,-11.1949880589;摆,-9.37092764485;哑,-12.3889105273;動,-5.12803662062;聞,-9.82012239357;孤,-11.6710707342;全,-8.14830345814;剪,-10.7402519018;误,-8.45708489461;数,-9.10799931155;至,-6.39345395896;祸,-10.5483608939;闻,-9.82012239357;空,-8.2370835297;国,-7.00763164008;灾,-10.6055193078;亂,-7.77033065444;後,-8.1577067824;众,-9.23831354322;果,-9.86718990443;綠,-9.23617450498;红,-8.50425871871;霧,-11.2415080745;蹈,-10.8413480186;画,-8.5956710579;淀,-9.70447019188;懈,-12.8997361511;鑑,-9.08385700623;敛,-9.22132799686;损,-8.17013838674;廢,-9.50971207004;哦,-11.7470566412;鋪,-12.2936003475;蹭,-11.3773096157;譯,-8.05817718705;腳,-9.03900644006;曲,-8.14399310664;援,-7.83661383096;项,-10.2488443638;啻,-11.8582822763;陽,-9.70106303355;一,-8.41767566228;掉,-7.26643575149;興,-8.10532396548;途,-14.2860305122;挞,-11.3956587543;御,-7.65315077165;索,-7.44834010769;妥,-12.494271043;眦,-13.5928833317;溫,-8.33973768376;夺,-7.50119644676;吼,-11.0279339742;迁,-7.88799036272;觅,-10.1588961272;杆,-13.9983484398;籌,-9.1212445383;毙,-9.67421578352;惟,-13.9983484398;竣,-13.3052012592;晰,-10.3806964949;敲,-10.278697327;对,-6.29342385982;電,-7.60643132638;嗽,-8.67900370603;漁,-12.7455854713;膊,-13.0820577079;納,-7.46710644695;隐,-10.8099318224;閒,-10.219856827;夥,-8.51044430544;責,-6.7882688116;议,-6.97347701412;戳,-13.7752048885;棄,-7.34162191559;草,-9.07109475462;顏,-12.6765925998;坑,-11.1079766819;盐,-10.6572549822;痒,-10.3032384359;汗,-9.395681384;廠,-9.46038700348;巢,-10.6932949187;祥,-13.3052012592;壤,-9.82781473919;曰,-10.5248303965;艳,-13.7752048885;偿,-8.22147041005;現,-4.03308398837;殃,-11.1361475588;梅,-13.4387326518;文,-8.62075789233;福,-9.58858505013;騎,-12.7455854713;吒,-12.2065889705;炕,-15.3846428009;攜,-11.5779803111;缠,-9.52957087869;喧,-12.9867475281;助,-6.4556048944;贬,-11.4928225028;暱,-11.4333990823;帶,-7.8520191821;仁,-10.2606788215;求,-5.49901376666;装,-6.81542658141;囑,-9.71131953372;睐,-8.79296906888;乖,-11.8582822763;識,-6.66418228817;懟,-13.9983484398;痧,-15.3846428009;迫,-8.18123727981;賭,-10.3157385987;凿,-9.39317825378;牾,-13.4387326518;貂,-15.3846428009;咒,-9.68754931439;準,-6.70159624539;殘,-9.92081099587;斜,-8.27394667791;鸡,-11.1079766819;唧,-12.2936003475;利,-7.65622702105;漫,-9.3047096058;怵,-11.7470566412;劾,-9.46844073829;激,-6.52969248439;衅,-10.4430003783;齋,-10.9779235536;惊,-8.60585790321;屍,-10.5404557144;奏,-8.11016324212;違,-10.1376187287;他,-11.6710707342;诘,-12.3889105273;苞,-13.7752048885;繡,-13.7752048885;忠,-9.70447019188;物,-8.81937783086;叨,-9.95969278341;襯,-10.8628542238;擲,-10.0763751035;命,-6.92741195065;酿,-9.12889275914;退,-7.05812597065;阄,-11.2902982387;弊,-10.6751125996;舌,-10.7695222841;且,-11.9189068981;焖,-13.7752048885;宝,-11.4726197955;废,-9.50971207004;售,-6.88439233021;禱,-9.5013204124;閉,-7.52445774342;方,-9.65454301792;釁,-10.4430003783;铃,-14.6914956203;觑,-10.6841624351;賓,-12.0173469709;躏,-10.6841624351;狗,-13.4387326518;员,-8.35644136883;坚,-12.6120540787;统,-10.1116432423;查,-7.47920115183;念,-7.73304722704;慶,-10.2141588059;摸,-8.5679069203;诽,-12.6765925998;仿,-8.80400366361;邀,-9.81629829713;球,-8.74476696707;厂,-9.46038700348;妆,-9.33727062185;紉,-13.1874182236;徊,-9.0285351402;昏,-10.4288157433;列,-7.30224054697;错,-8.48190006373;窜,-10.1428957858;鸟,-13.9983484398;悠,-10.3874305271;探,-8.39070982567;單,-9.6163218051;户,-8.5956710579;改,-7.64007299154;蒸,-15.3846428009;誼,-12.4402038217;允,-10.5971510581;配,-7.42536684078;聋,-12.8997361511;拌,-10.1323693728;虏,-11.1505362963;毒,-7.69116116006;何,-9.54109838386;留,-6.86087129412;来,-3.85319003131;触,-7.65754831611;迪,-12.8997361511;独,-12.494271043;饱,-12.8196934434;维,-11.040837379;艷,-13.7752048885;懶,-11.2902982387;譽,-10.2028592506;儀,-12.0173469709;霄,-13.9983484398;堆,-10.1014390722;粉,-10.5018408783;萎,-10.8307659093;輔,-10.2726550125;甘,-10.0963757702;股,-6.45932138395;讧,-10.5643612353;吮,-11.2257597175;纵,-8.20838826888;掷,-10.0763751035;榻,-10.8737832944;阴,-11.4143508873;郁,-12.3889105273;仕,-11.2902982387;潔,-10.9419915444;属,-7.48883442381;惡,-9.01303095366;恶,-9.01303095366;數,-9.10799931155;智,-11.4528171682;歼,-10.1642869758;冀,-11.3592911102;领,-6.55614867143;床,-7.99014969367;戍,-11.4143508873;树,-10.4010361792;辔,-12.2936003475;北,-11.210255531;炖,-12.9867475281;抢,-10.3283969955;梦,-9.47655986272;涨,-5.69968446212;爭,-8.80678144317;讼,-12.0888059349;漿,-10.9419915444;遁,-11.1219629239;狂,-11.8011238624;际,-11.3415915331;魇,-14.6914956203;绊,-13.5928833317;鸦,-13.3052012592;蹕,-10.7402519018;囚,-11.6234426852;散,-6.97548035369;跨,-10.3094689857;仪,-12.0173469709;坯,-13.9983484398;顱,-13.7752048885;称,-6.0861999807;使,-6.76597664055;刀,-9.82781473919;师,-8.69628808695;褒,-14.6914956203;涕,-11.1949880589;妝,-9.33727062185;辩,-9.30242389052;洪,-9.73215362062;箱,-11.6957633468;騰,-7.98463328373;纳,-7.46710644695;茶,-8.36624100182;蘸,-13.5928833317;壇,-15.3846428009;筆,-9.0302727601;译,-8.05817718705;仓,-7.55461471836;卖,-6.87065474043;握,-6.95649942631;日,-9.86718990443;棧,-14.2860305122;警,-9.10612137673;凭,-9.90817924896;蟹,-14.2860305122;銀,-13.4387326518;缉,-10.5171083504;搏,-10.5248303965;逗,-11.3241997903;娛,-11.8582822763;碜,-11.4726197955;羞,-11.7210811548;撤,-10.1271474289;随,-7.32599908868;垮,-9.99101525454;达,-6.69114612501;十,-11.1651350957;狀,-9.34916136837;终,-9.17404272387;緊,-7.59892190436;取,-5.64715080255;祝,-9.3660495864;捡,-13.4387326518;详,-9.27761991315;跪,-10.4793680225;平,-8.12131318342;職,-7.37262456173;書,-7.56621252882;濾,-9.69428334657;犁,-14.6914956203;匀,-11.5344951992;适,-12.165766976;锄,-15.3846428009;弈,-9.13081398932;尊,-9.89158135755;额,-8.46003040484;芡,-13.4387326518;挠,-9.82012239357;攤,-10.6661439296;炭,-10.9658021931;疯,-10.2371483241;嘮,-13.9983484398;嬰,-12.5514294568;憷,-12.7455854713;举,-7.38731597789;勁,-8.9994484019;廉,-13.4387326518;慌,-12.5514294568;藏,-7.26197477755;歐,-12.9867475281;剖,-10.0963757702;試,-8.03028047047;滩,-12.0888059349;轨,-9.93360434733;叫,-7.32315593402;闯,-13.5928833317;癮,-11.0941833597;扶,-9.47928095284;读,-6.72352244067;楼,-8.84940152988;善,-6.40850692759;攏,-8.94689115116;漓,-10.6055193078;袒,-11.2737689367;掠,-9.50690701911;营,-7.98892119229;冬,-9.35395754063;稱,-6.0861999807;宰,-9.71131953372;栽,-11.8881352394;烂,-8.99776348153;奇,-12.7455854713;糊,-9.651301524;酌,-9.70447019188;体,-9.12889275914;棒,-13.3052012592;筛,-13.7752048885;點,-8.229246499;卫,-7.85846388755;質,-9.2512447579;遭,-9.69766744455;目,-8.63120488229;驱,-10.7212037068;練,-9.053140951;拶,-15.3846428009;擺,-9.37092764485;衽,-12.9867475281;滾,-9.98196541902;須,-10.278697327;谐,-11.8582822763;梓,-14.2860305122;輒,-13.5928833317;錯,-8.48190006373;写,-7.27121616095;产,-6.41892501191;犯,-8.15698030216;綱,-11.5560014044;耸,-10.1806361138;治,-6.4273898566;絆,-13.5928833317;蓋,-7.56259879271;晌,-13.3052012592;苏,-6.37997449932;跑,-8.06875929638;试,-8.03028047047;盗,-10.7596699876;燙,-11.5560014044;博,-9.48474544731;竟,-12.494271043;饞,-11.9834454192;赦,-10.5806217562;表,-6.92911226987;煮,-10.7895229508;己,-11.8011238624;壳,-11.6710707342;署,-7.2572382382;寵,-10.6661439296;穴,-11.3241997903;捺,-12.0888059349;追,-10.4288157433;垂,-9.46574894662;颈,-12.0524382907;服,-7.10114867473;戏,-8.94369626026;栓,-13.4387326518;嘗,-9.49576484256;护,-5.92978885187;丧,-10.0423085489;润,-8.0621323669;醮,-11.8011238624;奉,-8.1671993692;術,-8.02390289783;闖,-13.5928833317;煙,-8.58558693883;黜,-10.1428957858;頤,-13.9983484398;湧,-9.39819079561;飽,-12.8196934434;副,-10.7596699876;时,-8.3458592595;腹,-10.8413480186;载,-6.71937449141;身,-6.15351988973;销,-6.8807375038;錄,-7.23014262574;将,-11.1651350957;斋,-10.9779235536;謔,-11.4928225028;備,-5.77848369786;挤,-9.15023207517;侧,-12.165766976;疫,-8.90153544944;横,-9.06387450664;脸,-9.02161469735;似,-6.98961724345;品,-10.4793680225;療,-6.78017160137;獄,-8.86993011002;矗,-14.6914956203;绝,-7.26286538173;塞,-8.32932995755;拥,-9.28208420628;荤,-12.0888059349;园,-11.8582822763;睬,-10.2313512064;可,-6.47446202288;份,-13.9983484398;顫,-9.90400387755;诿,-11.1651350957;門,-6.98263601929;馈,-9.02506893222;民,-8.44248609519;互,-10.0567666321;候,-7.49743421508;帝,-8.82928590908;暢,-12.494271043;伧,-13.0820577079;沦,-11.3241997903;榨,-10.5643612353;邮,-13.1874182236;宴,-9.7788407346;活,-8.02136321393;元,-9.66105769894;竊,-9.82396116988;評,-7.69893973966;比,-6.54493142219;壞,-7.09084319205;慣,-10.9779235536;賦,-12.6120540787;桩,-12.1265462629;卯,-12.0173469709;山,-7.86820949798;懸,-10.7025115738;養,-6.85059249241;踐,-7.61737880414;焚,-10.5404557144;笞,-11.8881352394;映,-6.64670894278;攢,-10.8307659093;貧,-10.9658021931;让,-6.59681197163;听,-7.34774602821;錮,-10.9779235536;場,-7.73019957442;撷,-12.8997361511;韁,-12.494271043;蛋,-9.90400387755;近,-6.40510019917;靖,-10.9419915444;党,-9.69766744455;緝,-10.5171083504;拣,-11.7210811548;车,-7.02106709814;闭,-7.52445774342;絲,-9.87931126496;任,-6.10030874901;省,-8.91229650639;嚀,-10.9658021931;喂,-12.2936003475;還,-7.87585563026;簇,-13.1874182236;樓,-8.84940152988;吗,-9.8874745756;帛,-12.4402038217;蜡,-11.4726197955;瘫,-11.51344179;咬,-10.8307659093;鎮,-10.3157385987;稳,-9.10612137673;膺,-11.3241997903;洽,-10.1642869758;貼,-9.04781706975;设,-7.24520227902;痂,-12.1265462629;充,-7.23302115392;佑,-9.48474544731;勘,-10.0863254343;条,-11.210255531;扣,-9.73215362062;啭,-13.4387326518;鑼,-12.0524382907;影,-8.81797037109;驳,-9.54983206383;葷,-12.0888059349;懺,-13.9983484398;泼,-11.3956587543;需,-8.25294429043;帆,-11.4528171682;伐,-8.78069897629;殓,-10.6310526098;谒,-10.5643612353;肥,-9.13853603541;愤,-11.6710707342;唬,-10.0280565262;刮,-10.6932949187;纱,-9.63524981498;头,-5.84033332251;斷,-6.1510743028;抹,-10.0093643932;贼,-13.0820577079;着,-5.3941980395;繆,-12.9867475281;嫉,-12.249148585;敌,-8.60018573826;扎,-7.72972575304;做,-7.39677870481;租,-8.91229650639;揣,-11.8292947394;书,-7.56621252882;哭,-8.27068669133;凯,-13.1874182236;罰,-8.98438535558;籲,-8.97446791893;賽,-10.1271474289;瘁,-13.5928833317;庆,-10.2141588059;守,-7.08784693512;墊,-13.5928833317;損,-8.17013838674;意,-5.58302187476;则,-10.4868030009;尝,-9.49576484256;够,-6.14028755033;憤,-11.6710707342;货,-8.65840939853;銮,-12.5514294568;縱,-8.20838826888;肺,-11.6234426852;千,-12.3401203632;细,-11.8011238624;牙,-9.36848564119;变,-5.84528649297;祟,-11.4143508873;捣,-11.0539094606;铺,-12.2936003475;恥,-12.8196934434;诨,-13.3052012592;狮,-12.7455854713;塵,-10.8520433077;轻,-8.23865833318;西,-12.6120540787;禁,-6.99892597226;羅,-9.14631817585;合,-5.13792021678;訌,-10.5643612353;憑,-9.90817924896;耐,-9.61009125535;撓,-9.82012239357;枕,-12.165766976;骗,-8.95331171896;缚,-9.6038992851;欢,-6.9235967701;箭,-10.7794726149;纯,-10.7212037068;熱,-7.54708844001;嘴,-8.56681222944;伺,-11.5560014044;駁,-9.54983206383;础,-13.3052012592;勇,-13.3052012592;词,-10.2371483241;济,-9.34438808962;恐,-9.38570623895;奖,-8.6358832534;烛,-11.4928225028;盟,-8.97941434286;啞,-12.3889105273;泣,-9.07290799174;腦,-12.2065889705;早,-10.0913379762;士,-11.3241997903;颓,-12.4402038217;絮,-14.2860305122;凱,-13.1874182236;灰,-12.2936003475;獲,-7.68752148361;諷,-9.83946535641;跹,-13.1874182236;礁,-12.5514294568;庄,-12.0173469709;针,-11.1079766819;搓,-11.0805777077;逛,-10.4217981706;队,-8.67533846063;谣,-10.5404557144;枪,-9.50690701911;嚴,-10.9073059864;貸,-8.83499205866;总,-10.1167846418;组,-10.2371483241;則,-10.4868030009;乏,-7.33139164734;插,-9.78993142129;蝕,-7.98097251088;穗,-12.3401203632;癟,-15.3846428009;询,-8.82928590908;令,-7.68933966593;执,-9.22766381531;填,-9.62574102702;共,-9.54400114352;味,-9.35395754063;直,-7.83766868338;濺,-10.4217981706;拼,-10.254744086;弄,-8.54945821475;率,-9.01474181806;逆,-9.80869369775;锈,-10.9901936462;谎,-9.73919590325;宗,-11.3241997903;砖,-12.165766976;军,-7.50724561454;劝,-9.80114649211;猜,-10.6751125996;龄,-11.3415915331;趣,-10.7212037068;鄰,-8.84505684528;油,-8.47389201293;为,-3.79990843318;壁,-10.7118139664;祀,-8.92473834652;罄,-11.0026161662;諍,-12.6765925998;歌,-9.03550380951;俏,-13.5928833317;卜,-9.95969278341;詢,-8.82928590908;滥,-9.49023996663;僱,-10.6661439296;牲,-8.27803666317;请,-6.78237343712;桶,-12.8997361511;浸,-9.90400387755;臻,-12.8997361511;码,-10.8202946094;骂,-8.77529355773;径,-12.4402038217;隊,-8.67533846063;漏,-9.3092967698;芒,-15.3846428009;嬗,-13.1874182236;初,-11.600453167;土,-8.16426896417;责,-6.7882688116;檢,-8.51147896668;严,-10.9073059864;澤,-11.210255531;悦,-11.1651350957;礫,-13.7752048885;冰,-9.91658265976;申,-9.11744225235;劲,-8.9994484019;人,-7.22727235971;秀,-11.6234426852;升,-5.46616811855;益,-7.6452835982;住,-5.80204945501;拒,-9.47384615685;處,-7.38765239506;廚,-12.0173469709;諢,-13.3052012592;捧,-8.95009628211;摩,-8.802617662;驭,-10.19168595;齒,-10.7499138127;陵,-14.2860305122;避,-7.75224167429;護,-5.92978885187;擾,-7.72972575304;射,-6.27423326754;徙,-10.6224688661;力,-7.18380554251;級,-7.76688322428;钟,-12.5514294568;计,-5.23484219502;违,-10.1376187287;攪,-10.7794726149;到,-3.89712745586;儲,-9.09122352205;贺,-9.19637867781;龋,-14.2860305122;撿,-13.4387326518;黃,-10.4646618751;請,-6.78237343712;桌,-11.0539094606;停,-7.29179177335;非,-7.37927573358;遏,-11.8011238624;詠,-11.8011238624;躺,-11.1505362963;惧,-9.47655986272;硬,-11.210255531;置,-6.36509980419;叱,-13.1874182236;迹,-9.63843961035;恼,-10.2970464657;松,-8.87289747125;如,-6.02304163508;紅,-8.50425871871;历,-7.6717518394;眉,-10.3094689857;喊,-8.28296682927;植,-7.44157008361;挑,-12.2936003475;易,-11.7470566412;创,-7.97490084681;吟,-8.73695442733;瞞,-9.55276032361;败,-6.76471253203;微,-10.2908926001;冲,-8.77799261469;电,-7.60643132638;样,-9.69091066209;讶,-11.5560014044;趺,-14.6914956203;魁,-12.5514294568;假,-8.45219490932;鼠,-11.6957633468;盈,-11.4528171682;拐,-13.1874182236;懒,-11.2902982387;擔,-7.58284239898;默,-9.25995941;牛,-9.95529717194;歡,-6.9235967701;賤,-11.8292947394;饭,-7.54787801763;屯,-11.8292947394;危,-10.2908926001;陳,-10.2847763731;衷,-10.3283969955;淺,-10.7695222841;突,-11.4928225028;堂,-10.1116432423;分,-7.07349025289;圈,-12.0888059349;残,-9.92081099587;吊,-9.59162919251;与,-6.48368492835;抑,-9.1760527748;缘,-8.91229650639;誡,-9.71131953372;欠,-9.92081099587;木,-9.53244032112;箫,-12.1265462629;搪,-13.0820577079;帮,-10.6484443525;瞳,-13.3052012592;進,-5.45290798542;榷,-11.210255531;伸,-8.09639839987;嫁,-9.02506893222;心,-5.82413863659;組,-10.2371483241;采,-8.19774178048;牆,-11.1799501815;霍,-10.5404557144;湎,-11.6957633468;捐,-13.4387326518;恒,-10.2028592506;给,-6.50586672919;兜,-15.3846428009;泥,-10.8960064312;寫,-7.27121616095;飭,-10.6484443525;音,-9.29786807398;決,-6.24913373954;能,-4.37535220855;颂,-9.16206653282;于,-4.12080709775;我,-11.5344951992;逝,-9.57950783198;梢,-12.5514294568;涤,-10.4010361792;砭,-12.4402038217;馬,-7.39001048946;累,-7.38899919661;爱,-7.48474747775;傲,-12.3401203632;政,-7.68616001301;節,-8.71260985543;居,-6.89894027657;兇,-10.7118139664;衍,-9.3660495864;槌,-13.3052012592;赏,-7.91727173398;提,-9.41083318902;忘,-9.34200996721;回,-6.33271216566;跤,-10.5724584455;苦,-8.39254637348;痴,-12.6765925998;風,-7.81162554484;聽,-7.34774602821;懼,-9.47655986272;綁,-9.86318188303;异,-9.12315111657;唆,-10.6751125996;蜒,-9.87525446426;店,-10.6055193078;香,-9.17404272387;咛,-10.9658021931;功,-8.69753419303;漢,-15.3846428009;怨,-8.52712873835;挪,-11.0805777077;窯,-11.8292947394;炳,-13.4387326518;露,-6.15636428379;鈴,-14.6914956203;撻,-11.3956587543;雇,-10.6661439296;凉,-10.0813378928;願,-7.9456712085;魚,-8.73049028071;噜,-11.6957633468;淡,-10.0047454474;闱,-13.7752048885;价,-6.51215561861;龙,-12.3401203632;君,-10.8520433077;贡,-10.0047454474;簫,-12.1265462629;措,-9.82012239357;由,-8.84940152988;论,-6.97726447548;朽,-13.4387326518;房,-8.40829473044;竄,-10.1428957858;光,-7.75758538387;烈,-15.3846428009;珊,-12.8196934434;位,-7.06176277912;滌,-10.4010361792;拔,-8.49607034133;壘,-11.3773096157;雜,-8.93892298151;賠,-9.36119520793;档,-10.6397106725;步,-7.9403941514;卵,-8.83785739013;懾,-10.3157385987;市,-5.44097345872;炉,-9.68754931439;刊,-9.395681384;撑,-7.10266574202;投,-8.33365335382;得,-4.49390291755;墙,-11.1799501815;原,-8.70630068624;財,-7.29362775918;誥,-13.9983484398;搦,-13.9983484398;肩,-10.8960064312;截,-9.2150320684;嘲,-10.7402519018;診,-8.36088384615;跋,-15.3846428009;仍,-11.1219629239;晒,-10.0140047728;痛,-8.99105204694;婚,-7.28934902405;靜,-9.78993142129;遞,-8.04835714087;泡,-9.61320167776;赠,-9.00113616601;惩,-10.1697070433;異,-9.12315111657;癲,-12.0524382907;勵,-7.40086173192;迷,-8.19849849637;裹,-10.6572549822;稅,-7.93108092925;瀉,-9.24907790981;洋,-11.51344179;渍,-11.600453167;溢,-9.82781473919;爵,-10.2488443638;貶,-11.4928225028;根,-9.78622084189;攻,-7.27842989827;肾,-10.4501688678;屁,-10.36076228;饃,-11.4143508873;驅,-10.7212037068;範,-7.21445714801;燈,-9.19432739504;赋,-12.6120540787;罗,-9.14631817585;污,-9.23617450498;诤,-12.6765925998;恩,-8.63940645141;臨,-6.65556925044;魯,-15.3846428009;呱,-12.9867475281;痰,-10.121952612;关,-5.98707625279;盲,-11.3241997903;創,-7.97490084681;羁,-11.5560014044;窃,-9.82396116988;禅,-11.2415080745;圆,-10.3283969955;梏,-14.2860305122;謎,-12.0524382907;抓,-10.1116432423;岗,-9.90817924896;编,-7.72452848172;際,-11.3415915331;喝,-8.92473834652;誣,-13.5928833317;針,-11.1079766819;纫,-13.1874182236;維,-11.040837379;鬮,-11.2902982387;施,-6.43514784741;終,-9.17404272387;叉,-9.06028383851;版,-7.05329737605;介,-9.57051226907;盛,-11.307105357;烟,-8.58558693883;习,-6.76074999082;赢,-10.6841624351;壯,-10.4358829105;勳,-14.2860305122;预,-8.68884388383;劈,-12.8997361511;冊,-7.97853941966;栏,-10.9901936462;愕,-11.2415080745;窘,-12.0524382907;借,-9.23404003245;訣,-12.8997361511;縫,-10.8737832944;宮,-9.01645561454;覺,-7.6984804974;之,-9.6038992851;泌,-8.25775199199;腕,-12.2065889705;忖,-10.278697327;高,-5.64343891141;捩,-13.1874182236;幫,-10.6484443525;自,-6.6778214775;顯,-9.08019399847;篮,-11.6234426852;兵,-7.10291881048;开,-5.25653279116;处,-7.38765239506;嘆,-8.03927796048;討,-7.95988103907;暑,-9.6841992275;垛,-15.3846428009;亡,-6.83595094242;漠,-11.2737689367;氢,-11.1361475588;魔,-12.0524382907;怪,-7.59518823481;皱,-13.9983484398;地,-7.25017523062;廁,-15.3846428009;勉,-11.5344951992;材,-9.59468263;站,-10.8307659093;存,-6.53828975758;镜,-11.7210811548;營,-7.98892119229;满,-7.09384845351;旧,-9.34677188097;择,-6.39769601149;快,-7.1303740308;聪,-12.5514294568;重,-6.56778956027;右,-12.4402038217;僵,-11.8292947394;跷,-13.3052012592;歸,-7.63747783437;找,-7.37561211582;往,-6.9130747875;隆,-11.0805777077;邊,-10.1806361138;怕,-7.15246856451;崗,-9.90817924896;纖,-12.494271043;騙,-8.95331171896;吝,-12.0524382907;償,-8.22147041005;推,-10.1588961272;樹,-10.4010361792;许,-7.45084592608;愿,-7.9456712085;镇,-10.3157385987;盆,-12.8196934434;烊,-13.3052012592;淌,-10.3032384359;虑,-6.44100609498;擒,-10.4358829105;過,-5.29866703878;關,-5.98707625279;勞,-9.42106345727;正,-7.39068525332;賢,-10.9302955046;桥,-9.54400114352;鑽,-13.9983484398;即,-10.0763751035;偵,-13.9983484398;起,-5.16099388516;棺,-12.3401203632;腿,-10.1065281417;拾,-7.96766317951;怀,-9.00282678349;挂,-8.17456317272;誇,-11.1949880589;嚏,-11.1651350957;徕,-11.1949880589;抗,-7.61949789796;料,-8.12061265799;造,-5.73475800716;錢,-7.46856470459;欲,-9.47928095284;侵,-8.25534525196;渴,-9.93790542923;銷,-6.8807375038;然,-9.33963748686;眺,-10.8307659093;宽,-8.62654829647;科,-11.9506555964;苗,-10.1482008381;摘,-10.3283969955;话,-6.42661735753;軟,-10.8737832944;凡,-11.3773096157;惫,-10.0471047212;罪,-7.78574234402;揭,-10.4079090585;衰,-10.5563290636;泳,-11.8292947394;痹,-10.3094689857;绿,-9.23617450498;萃,-10.8520433077;暄,-10.2908926001;沈,-9.15023207517;引,-7.17778637249;無,-7.47075608604;眥,-13.5928833317;遇,-8.66201300604;循,-8.73436375231;抬,-12.2065889705;械,-11.6957633468;殲,-10.1642869758;刷,-8.86108049474;頻,-10.6841624351;胀,-8.31476867243;视,-6.29726133632;嗎,-9.8874745756;寒,-9.95529717194;罕,-9.98196541902;酸,-10.8848331306;衛,-7.85846388755;盤,-6.69181704083;景,-10.6751125996;诲,-10.5483608939;凶,-10.7118139664;铸,-10.4646618751;基,-9.59468263;醋,-11.7210811548;劍,-10.4942936727;频,-10.6841624351;底,-8.65243209443;缔,-10.3942102141;鴨,-12.7455854713;足,-6.98286046099;亵,-11.8011238624;妻,-11.0941833597;笼,-9.19637867781;簾,-13.0820577079;绕,-7.6588713593;敘,-10.7499138127;迟,-8.95331171896;嗣,-12.494271043;牢,-9.81248876871;寧,-14.2860305122;絨,-13.3052012592;繪,-8.58447273259;拭,-10.4010361792;棱,-13.7752048885;該,-5.94581319128;轴,-12.7455854713;偶,-10.6055193078;啸,-9.94656349197;移,-7.0192031647;老,-9.49576484256;构,-9.93360434733;消,-7.53531898285;刍,-11.6469731826;羔,-13.3052012592;冠,-11.4143508873;颦,-15.3846428009;脫,-7.36141811618;踵,-11.7737248882;吹,-9.56753164093;皺,-13.9983484398;精,-9.50971207004;歇,-9.33963748686;汉,-15.3846428009;今,-13.4387326518;双,-11.6957633468;駐,-8.60131760029;繕,-10.6841624351;轟,-10.9658021931;噥,-10.0001477381;編,-7.72452848172;绪,-10.0714368219;扭,-11.8582822763;杯,-10.1642869758;闸,-10.2970464657;固,-7.80700896829;导,-7.17234566266;戀,-8.74738476961;辉,-11.2902982387;咏,-11.8011238624;库,-10.7118139664;頂,-10.0616328218;沟,-11.8881352394;伞,-10.8202946094;删,-12.2936003475;義,-7.33681344343;躲,-12.4402038217;水,-6.70159624539;傷,-7.14584163502;猶,-14.2860305122;旅,-13.4387326518;么,-8.65840939853;结,-6.67040365728;饒,-10.5171083504;諛,-11.9506555964;鏡,-11.7210811548;難,-8.36893038041;詰,-12.3889105273;襲,-8.28957842361;陸,-7.87038814808;技,-13.3052012592;憂,-7.80649732847;載,-6.71937449141;瞎,-14.2860305122;辞,-8.48290559424;加,-5.18740412988;咤,-12.2065889705;缩,-7.15486505081;悬,-10.7025115738;碼,-10.8202946094;尿,-9.28881823846;晃,-9.2255474124;臂,-11.7470566412;故,-9.42363746127;蓄,-11.0151949484;识,-6.66418228817;城,-7.99137970613;筑,-8.41203654959;絕,-7.26286538173;揖,-10.6572549822;詛,-13.4387326518;卡,-10.4430003783;狠,-11.2415080745;陣,-9.053140951;顧,-7.33489650994;彩,-10.4010361792;扫,-9.19023740979;賴,-7.8345074584;睹,-10.0047454474;飼,-11.8011238624;争,-8.80678144317;压,-7.22441030853;傍,-12.0888059349;喏,-12.1265462629;骑,-12.7455854713;純,-10.7212037068;條,-11.210255531;踞,-9.99557107108;錠,-15.3846428009;逢,-8.74869624521;唤,-8.47090545023;馆,-11.8881352394;冷,-10.5806217562;父,-11.210255531;眸,-11.9189068981;礼,-8.33192175166;績,-12.9867475281;擅,-11.8011238624;兌,-9.52101162529;噎,-11.7210811548;子,-8.48491969361;離,-6.68163416343;輸,-10.2847763731;诛,-12.6120540787;裝,-6.81542658141;跟,-10.3220477679;鏤,-12.494271043;議,-6.97347701412;赴,-9.28432384887;盹,-11.3773096157;饼,-12.8997361511;弓,-11.3773096157;躞,-13.4387326518;徨,-11.0805777077;憬,-10.2371483241;許,-7.45084592608;輳,-12.7455854713;状,-9.34916136837;权,-7.30008038566;賊,-13.0820577079;凌,-10.9302955046;畏,-9.66105769894;寐,-12.1265462629;拖,-13.0820577079;據,-7.73781140946;衝,-8.77799261469;滞,-8.84505684528;鹽,-10.6572549822;恭,-13.3052012592;诰,-13.9983484398;哺,-12.5514294568;肃,-10.9187346822;躇,-9.81248876871;栈,-14.2860305122;權,-7.30008038566;墓,-9.29333291882;宕,-11.2415080745;暗,-10.4148295013;耘,-11.3241997903;沛,-13.0820577079;东,-11.7210811548;吠,-12.8997361511;判,-7.60852732379;级,-7.76688322428;漲,-5.69968446212;嚷,-9.59162919251;社,-11.1219629239;归,-7.63747783437;保,-7.52253058923;楞,-13.7752048885;睢,-14.2860305122;句,-12.0524382907;給,-6.50586672919;深,-9.21712631;镶,-13.3052012592;選,-6.49258117535;系,-6.78090500808;卺,-12.6120540787;幼,-14.6914956203;竿,-13.4387326518;考,-7.28691222723;抄,-10.121952612;圍,-7.84295970101;頓,-8.21683361658;肘,-10.6751125996;垢,-13.4387326518;墨,-10.3032384359;宪,-11.6469731826;贱,-11.8292947394;炸,-7.91727173398;鰻,-13.4387326518;恃,-10.5806217562;诊,-8.36088384615;野,-9.89158135755;體,-9.12889275914;揚,-7.21134936193;遣,-8.54516636266;磨,-8.19698563678;扯,-9.30700055754;类,-11.0539094606;穿,-8.17087449277;攀,-11.8292947394;開,-5.25653279116;妓,-12.2065889705;笔,-9.0302727601;林,-9.34438808962;溝,-11.8881352394;唠,-13.9983484398;館,-11.8881352394;本,-9.11934158816;宿,-9.14827321069;砾,-13.7752048885;擁,-9.28208420628;担,-7.58284239898;豆,-13.9983484398;棉,-12.8196934434;偎,-11.1079766819;孔,-9.69428334657;潜,-10.7402519018;員,-8.35644136883;釣,-12.0524382907;癢,-10.3032384359;忧,-7.80649732847;壩,-11.8881352394;票,-8.44055559266;走,-6.9155899848;槳,-12.0888059349;典,-11.8011238624;顾,-7.33489650994;锋,-9.33255363197;炎,-10.8848331306;少,-6.34485353011;餓,-11.5344951992;膘,-13.9983484398;妨,-8.38796131272;蔫,-13.9983484398;醜,-11.1219629239;谱,-11.0539094606;殴,-11.2902982387;帽,-10.7118139664;览,-8.67533846063;蝗,-13.7752048885;赛,-10.1271474289;剥,-10.8202946094;说,-5.88867246059;银,-13.4387326518;勺,-13.5928833317;飾,-7.92070619642;漆,-12.8196934434;閃,-10.1271474289;邏,-9.52957087869;猎,-9.09492722998;徑,-12.4402038217;研,-9.31390507289;掙,-12.165766976;脚,-9.03900644006;涝,-10.953826002;谜,-12.0524382907;锢,-10.9779235536;弦,-10.6572549822;順,-9.13466755863;搬,-11.2257597175;肯,-7.41597710043;辱,-9.10988077965;眶,-13.4387326518;鐵,-9.99557107108;麻,-10.8202946094;轆,-13.1874182236;华,-8.18645922379;杖,-12.8997361511;托,-7.58161615726;距,-9.2234354792;畢,-8.40922887344;審,-8.66683810587;葬,-8.26662659643;惯,-10.9779235536;买,-6.89873389952;靶,-13.0820577079;躕,-12.3889105273;鱼,-8.73049028071;斂,-9.22132799686;脅,-11.1651350957;透,-8.35644136883;搗,-11.0539094606;減,-7.52754893599;膚,-10.7212037068;蹰,-12.3889105273;蹋,-10.4868030009;骨,-10.3157385987;蔭,-11.9506555964;液,-11.0279339742;蛀,-13.0820577079;汇,-9.35877682707;歉,-9.78252398001;网,-7.77626832651;著,-5.3941980395;拘,-10.8307659093;坡,-9.79739414249;入,-4.54322044842;烤,-10.6484443525;息,-6.26916270994;仰,-8.94369626026;極,-9.28881823846;勸,-9.80114649211;出,-4.09466090723;搂,-12.8196934434;肅,-10.9187346822;誉,-10.2028592506;型,-8.61614958924;斗,-8.43191415627;蘖,-12.5514294568;鐮,-14.2860305122;带,-7.8520191821;窩,-12.8997361511;堪,-8.79571632336;攬,-9.47384615685;戮,-9.7715146945;讳,-9.76424193518;氲,-13.7752048885;喷,-10.0567666321;銹,-10.9901936462;雞,-11.1079766819;情,-7.64093954272;剎,-13.9983484398;绑,-9.86318188303;齐,-10.4793680225;奔,-8.33019314276;进,-5.45290798542;口,-7.76295780217;煤,-9.78993142129;巧,-13.0820577079;轰,-10.9658021931;陶,-10.7025115738;卸,-9.80114649211;翻,-8.42429507179;遺,-10.4217981706;驾,-9.20255789418;范,-7.21445714801;國,-7.00763164008;名,-6.03575861947;粒,-11.8011238624;肚,-11.2415080745;語,-8.63237242475;钢,-9.95969278341;冤,-10.1642869758;紧,-7.59892190436;度,-8.85961314305;斬,-10.6661439296;刹,-13.9983484398;鼻,-10.4646618751;為,-3.79990843318;尽,-8.15988939512;诈,-10.7895229508;闌,-14.2860305122;委,-12.8997361511;艙,-13.5928833317;佛,-9.34200996721;健,-10.3220477679;述,-6.73888050868;觴,-13.5928833317;零,-10.7118139664;司,-10.2488443638;籽,-12.9867475281;要,-5.34540132738;辅,-10.2726550125;颃,-12.6765925998;序,-9.92081099587;钓,-12.0524382907;会,-5.48727392936;被,-13.3052012592;训,-9.88338459035;躯,-12.165766976;挲,-11.3773096157;簸,-10.4010361792;傻,-11.8292947394;缺,-8.55918276464;血,-7.47002509185;辍,-13.5928833317;磋,-11.4528171682;经,-7.57510147624;卒,-13.3052012592;滯,-8.84505684528;聰,-12.5514294568;奶,-10.6397106725;调,-6.05483192894;麗,-13.7752048885;與,-6.48368492835;撈,-9.39317825378;吓,-9.72516058513;視,-6.29726133632;星,-11.5560014044;颠,-15.3846428009;客,-8.87885874076;涮,-12.2936003475;脱,-7.36141811618;暴,-11.4726197955;騷,-11.2575084158;逻,-9.52957087869;扇,-12.6765925998;嫌,-8.76723982292;囔,-10.9187346822;拜,-8.09845108619;號,-9.27317546139;剧,-8.26339034765;湯,-11.6469731826;穷,-11.8582822763;鋼,-9.95969278341;樂,-9.17806687417;躅,-12.6765925998;馋,-11.9834454192;間,-9.36119520793;嚕,-11.6957633468;沙,-11.2575084158;业,-6.12237433606;夠,-6.14028755033;倦,-10.7596699876;辯,-9.30242389052;戲,-8.94369626026;冻,-9.08569355404;靡,-10.7996753222;滅,-7.13454504832;轄,-7.87147925566;秋,-12.2065889705;屎,-11.0279339742;诗,-9.67753253614;濯,-12.8997361511;惱,-10.2970464657;腰,-9.28208420628;色,-8.08214637717;顶,-10.0616328218;矿,-9.14436695572;鑾,-12.5514294568;袖,-12.2065889705;愛,-7.48474747775;躚,-13.1874182236;期,-7.35618763678;邦,-13.4387326518;險,-8.22379689423;設,-7.24520227902;輯,-13.3052012592;耱,-13.9983484398;纺,-11.5560014044;觀,-8.29456596512;胆,-10.6751125996;積,-7.32536657759;富,-9.28656851873;灑,-10.3094689857;勒,-10.7306824507;鋸,-11.3773096157;滚,-9.98196541902;擞,-11.7470566412;卧,-9.90817924896;烦,-9.55569718328;盪,-6.47351741718;诬,-13.5928833317;壶,-12.8997361511;建,-6.20661903039;牽,-13.3052012592;超,-10.6055193078;骋,-10.8413480186;妍,-13.3052012592;砌,-10.7212037068;爐,-9.68754931439;梗,-12.1265462629;管,-7.22956791308;娠,-9.47113979525;夢,-9.47655986272;尤,-12.9867475281;錦,-14.2860305122;貯,-12.4402038217;戰,-5.99289795919;徹,-8.47788802224;鞋,-10.8848331306;眾,-9.23831354322;毁,-7.89299732729;荆,-12.6120540787;立,-4.80764970805;种,-7.50724561454;塌,-9.00282678349;彎,-9.60081761856;兒,-9.06928479937;浚,-10.1376187287;寡,-11.4928225028;廣,-7.99384427916;工,-7.08138568004;番,-9.90400387755;衬,-10.8628542238;曳,-10.2847763731;幸,-9.55864269351;謁,-10.5643612353;贅,-11.1799501815;釀,-9.12889275914;暈,-9.1561317973;复,-6.04494222361;碌,-11.4143508873;小,-7.53531898285;美,-9.38819071227;栗,-10.5171083504;亘,-10.5248303965;饮,-9.86718990443;縣,-13.1874182236;眩,-11.2902982387;隨,-7.32599908868;喪,-10.0423085489;憲,-11.6469731826;弹,-6.81106927604;纸,-8.53240023184;刻,-9.43660781171;炼,-7.90760432857;湃,-11.0026161662;观,-8.29456596512;浅,-10.7695222841;賄,-9.40575703599;街,-9.43660781171;余,-8.86402167333;淚,-8.68514246073;餘,-8.86402167333;惜,-7.66773666559;章,-10.6224688661;幣,-11.1799501815;革,-10.19168595;橫,-9.06387450664;痪,-9.89158135755;業,-6.12237433606;修,-7.80394304867;敵,-8.60018573826;寶,-11.4726197955;侃,-10.8413480186;月,-9.651301524;劑,-10.8520433077;咕,-10.3476901985;訖,-12.7455854713;优,-11.1949880589;掛,-8.17456317272;粥,-14.2860305122;在,-5.17400148572;讫,-12.7455854713;袭,-8.28957842361;花,-8.73825228605;缸,-13.1874182236;去,-5.09619901688;瘾,-11.0941833597;资,-7.19985014673;曉,-8.83642369813;矓,-11.6234426852;仙,-12.1265462629;鳥,-13.9983484398;睨,-11.9189068981;毫,-12.249148585;拱,-11.8011238624;聲,-7.7580725946;蕴,-15.3846428009;驶,-7.69161705247;兼,-11.8881352394;痿,-10.3476901985;較,-9.44710659581;谅,-9.08569355404;刑,-8.59005622002;圓,-10.3283969955;炒,-8.51875172601;辘,-13.1874182236;挛,-13.7752048885;思,-7.86278354869;膜,-12.6765925998;宠,-10.6661439296;贯,-8.61845108623;舱,-13.5928833317;掰,-14.6914956203;悲,-13.9983484398;夷,-10.5404557144;医,-9.51252501142;诀,-12.8997361511;裂,-7.16882500906;跄,-10.4646618751;筋,-10.3283969955;嗔,-12.249148585;內,-12.3401203632;险,-8.22379689423;祷,-9.5013204124;繹,-9.08937679945;獻,-9.1660426812;災,-10.6055193078;图,-7.26882309968;龍,-12.3401203632;礎,-13.3052012592;厕,-15.3846428009;枝,-12.6765925998;锦,-14.2860305122;貫,-8.61845108623;匪,-10.8520433077;辭,-8.48290559424;測,-6.72786159527;戴,-8.88335313035;钻,-13.9983484398;势,-8.33278717794;靠,-7.39949886969;應,-5.91780147395;荊,-12.6120540787;青,-11.0805777077;剔,-10.7996753222;仗,-8.57560349485;巡,-10.6397106725;籠,-9.19637867781;罢,-9.57350180792;蹬,-14.2860305122;旱,-11.6234426852;想,-6.443882666;謅,-11.7737248882;蘇,-6.37997449932;脉,-10.8848331306;尋,-9.1861640844;續,-5.45412390931;瞒,-9.55276032361;渗,-11.600453167;朝,-9.94656349197;紡,-11.5560014044;储,-9.09122352205;榮,-8.13756221631;撰,-10.254744086;耳,-11.1505362963;吻,-10.2666489885;流,-7.57713275868;賀,-9.19637867781;轍,-12.6765925998;糠,-11.4143508873;蟲,-10.066522807;誅,-12.6120540787;欄,-10.9901936462;肉,-10.7794726149;愈,-9.11934158816;飘,-11.1361475588;蜜,-13.3052012592;窥,-11.9834454192;瞧,-8.9200544972;否,-6.31632692895;刪,-12.2936003475;漬,-11.600453167;讯,-9.16405263079;膳,-10.8737832944;德,-10.2726550125;喻,-10.5563290636;眼,-8.43382803245;县,-13.1874182236;葆,-13.7752048885;绍,-6.83169643977;協,-9.32318588196;俗,-10.6310526098;淫,-9.69428334657;转,-6.55220100931;擱,-9.46306438125;奸,-10.1065281417;把,-10.4148295013;碎,-8.31222090036;向,-6.20837640925;誚,-12.8196934434;挟,-10.4358829105;簡,-10.6661439296;室,-12.0524382907;贫,-10.9658021931;中,-6.23447715195;新,-6.46171787025;舵,-11.0151949484;強,-5.93844010519;頹,-12.4402038217;锻,-13.9983484398;窺,-11.9834454192;匿,-9.80114649211;汁,-12.8997361511;评,-7.69893973966;忌,-9.66433102429;风,-7.81162554484;柜,-12.8196934434;締,-10.3942102141;瓦,-15.3846428009;適,-12.165766976;麦,-12.0524382907;罷,-9.57350180792;白,-6.54841422937;鲁,-15.3846428009;戈,-10.7402519018;冕,-10.5563290636;記,-7.31467465183;悟,-9.17806687417;羡,-11.0151949484;堤,-10.7596699876;璧,-13.3052012592;玩,-9.47655986272;享,-8.51770951643;優,-11.1949880589;芳,-11.8582822763;容,-7.37163069052;示,-4.71280783523;濁,-11.6234426852;櫃,-12.8196934434;赂,-9.65454301792;擇,-6.39769601149;腊,-14.2860305122;限,-7.90421449482;達,-6.69114612501;藝,-9.94656349197;捞,-9.39317825378;叩,-12.8997361511;豬,-10.4793680225;拳,-10.2084930683;呼,-7.61568675635;涂,-11.8292947394;憊,-10.0471047212;頏,-12.6765925998;辖,-7.87147925566;誘,-10.0047454474;攝,-8.87438446037;蒜,-12.1265462629;颤,-9.90400387755;垦,-9.35395754063;动,-5.12803662062;购,-5.94295264106;殮,-10.6310526098;阻,-8.60585790321;軀,-12.165766976;饪,-11.1079766819;摇,-8.95977377699;捉,-8.89088896104;臊,-15.3846428009;虛,-9.50690701911;齡,-11.3415915331;饥,-11.0026161662;賬,-9.07290799174;诮,-12.8196934434;東,-11.7210811548;筹,-9.1212445383;登,-8.91229650639;哼,-10.4217981706;挈,-12.0888059349;律,-9.82781473919;馏,-9.82012239357;税,-7.93108092925;世,-7.24724697084;舞,-8.42809735774;纡,-14.6914956203;张,-7.26494654794;錨,-11.6469731826;防,-7.46310716876;砺,-11.6957633468;咽,-8.73825228605;爾,-13.7752048885;拉,-9.3047096058;聊,-10.4719879152;嵌,-9.59774541953;监,-11.8881352394;坐,-8.2253508961;兔,-13.5928833317;湖,-12.165766976;獨,-12.494271043;濫,-9.49023996663;并,-7.31530043408;學,-7.29577401173;顺,-9.13466755863;丁,-12.1265462629;澀,-12.9867475281;飪,-11.1079766819;舉,-7.38731597789;授,-8.92161334397;弋,-11.8582822763;對,-6.29342385982;夏,-11.7210811548;阑,-14.2860305122;熔,-13.5928833317;洗,-8.67047227098;標,-7.67758014552;望,-5.60807994193;感,-8.54516636266;徠,-11.1949880589;厨,-12.0173469709;邪,-10.5888522553;颜,-12.6765925998;撲,-10.4868030009;疼,-9.33020345462;儿,-9.06928479937;賂,-9.65454301792;规,-9.17203670514;軍,-7.50724561454;籍,-11.3592911102;哒,-12.8997361511;棚,-12.2065889705;翠,-12.8997361511;季,-12.2065889705;秤,-13.5928833317;剩,-7.71002530353;致,-6.31840377289;延,-8.23551120234;寸,-14.2860305122;壺,-12.8997361511;辕,-13.3052012592;渔,-12.7455854713;鐘,-12.5514294568;驚,-8.60585790321;枥,-15.3846428009;涩,-12.9867475281;伪,-11.0026161662;厭,-9.40070652021;爬,-10.0186667859;徵,-7.42886701936;机,-8.44248609519;讽,-9.83946535641;派,-8.6358832534;附,-8.45024559096;屈,-8.89240296587;惋,-13.5928833317;齊,-10.4793680225;揍,-12.4402038217;濕,-9.58555014643;飛,-8.39900098325;寝,-11.307105357;换,-6.28389410555;晤,-9.74985319772;諧,-11.8582822763;烫,-11.5560014044;班,-8.02772455854;啮,-13.4387326518;顰,-15.3846428009;年,-8.86402167333;葸,-12.6120540787;毽,-15.3846428009;滿,-7.09384845351;阔,-9.21712631;吃,-8.59117666831;的,-9.24045716677;娇,-10.9901936462;鴉,-13.3052012592;羊,-10.4646618751;谓,-6.95518852378;輕,-8.23865833318;肠,-10.8960064312;莢,-12.5514294568;覦,-10.953826002;洩,-8.6347116071;貨,-8.65840939853;倫,-12.8196934434;嘯,-9.94656349197;失,-6.9434670959;碰,-10.8520433077;張,-7.26494654794;憶,-8.60472089342;雄,-11.1079766819;恋,-8.74738476961;顛,-15.3846428009;孝,-10.4793680225;幟,-11.9506555964;惠,-9.88338459035;注,-6.05927875235;火,-7.68570660108;问,-6.81561646084;声,-7.7580725946;米,-12.0888059349;罵,-8.77529355773;黴,-11.307105357;湿,-9.58555014643;喃,-12.3889105273;嚅,-10.8307659093;縊,-10.4010361792;井,-10.3874305271;演,-7.35260748649;窝,-12.8997361511;质,-9.2512447579;醫,-9.51252501142;踪,-7.80649732847;选,-6.49258117535;缴,-9.14047590023;获,-7.68752148361;便,-8.93575340675;烁,-9.34438808962;兀,-10.4010361792;剂,-10.8520433077;篇,-13.0820577079;拍,-9.02334032332;佔,-7.74982212315;受,-5.7717749648;駛,-7.69161705247;邻,-8.84505684528;饰,-7.92070619642;绵,-12.5514294568;送,-7.11539827971;阅,-8.47888952458;舍,-9.96854239869;掌,-8.97941434286;贓,-10.4501688678;傖,-13.0820577079;喘,-11.6710707342;宜,-7.84031069284;攣,-13.7752048885;骚,-11.2575084158;春,-10.4793680225;欧,-12.9867475281;躪,-10.6841624351;報,-6.77541752403;悶,-9.38570623895;褻,-11.8011238624;殼,-11.6710707342;净,-9.54109838386;態,-8.54516636266;才,-10.4793680225;菌,-9.40575703599;觐,-10.532612537;諒,-9.08569355404;返,-8.76323714913;痘,-13.3052012592;糞,-14.6914956203;金,-8.76991720069;拢,-8.94689115116;淨,-9.54109838386;召,-8.70881957926;哮,-10.2488443638;捷,-10.4573891157;摹,-10.7695222841;徉,-12.2936003475;鸭,-12.7455854713;趕,-8.67533846063;气,-7.40804739158;化,-5.05018484984;嘘,-10.4217981706;锚,-11.6469731826;採,-8.19774178048;斥,-8.29456596512;劫,-8.52712873835;覽,-8.67533846063;格,-8.21529278422;漾,-10.7118139664;病,-7.38664348291;鑄,-10.4646618751;职,-7.37262456173;蝎,-15.3846428009;詐,-10.7895229508;慢,-8.98771314568;藥,-8.20229068901;武,-9.80491297491;浪,-9.87121405473;燭,-11.4928225028;驰,-8.90153544944;绳,-11.6234426852;饲,-11.8011238624;槽,-11.4143508873;锅,-10.953826002;鎖,-8.88786781071;喚,-8.47090545023;墜,-10.9901936462;從,-6.94411469441;挡,-8.62075789233;别,-7.40052084219;启,-8.71514471103;鬱,-12.3889105273;帳,-11.4333990823;畅,-12.494271043;哄,-10.7212037068;密,-9.16008437162;手,-6.21606236316;饶,-10.5171083504;背,-9.19228031142;角,-12.494271043;遗,-10.4217981706;静,-9.78993142129;盘,-6.69181704083;荡,-6.47351741718;佩,-9.79739414249;淪,-11.3241997903;繳,-9.14047590023;鳴,-8.69878185382;明,-5.54708139847;输,-10.2847763731;團,-9.95529717194;夜,-9.52957087869;鸞,-14.2860305122;撥,-9.03550380951;傭,-9.57950783198;戶,-8.5956710579;携,-11.5779803111;渾,-13.3052012592;區,-10.4217981706;遂,-10.7499138127;婆,-14.2860305122;彈,-6.81106927604;届,-11.3415915331;族,-11.1361475588;法,-6.34948949681;赔,-9.36119520793;雙,-11.6957633468;繞,-7.6588713593;量,-6.68896875207;热,-7.54708844001;公,-11.0151949484;翳,-14.6914956203;懷,-9.00282678349;葺,-11.1949880589;刁,-12.8997361511;备,-5.77848369786;羈,-11.5560014044;耍,-10.2371483241;谕,-10.5643612353;鞘,-11.51344179;笛,-12.6120540787;肢,-11.5560014044;誦,-9.08937679945;温,-8.33973768376;辨,-9.15810613161;倭,-12.0888059349;熬,-10.341217684;锯,-11.3773096157;皮,-9.65454301792;娱,-11.8582822763;雲,-10.0471047212;綴,-9.96854239869;贿,-9.40575703599;僂,-11.1949880589;敏,-9.66433102429;乩,-12.2065889705;泪,-8.68514246073;灭,-7.13454504832;飲,-9.86718990443;巴,-10.4010361792;死,-6.61918426939;庇,-10.8520433077;紆,-14.6914956203;融,-9.36848564119;帜,-11.9506555964;患,-11.0151949484;接,-6.80222382456;账,-9.07290799174;鞭,-10.8202946094;墳,-11.6957633468;收,-6.26357089667;費,-7.31561347212;挺,-12.494271043;調,-6.05483192894;织,-6.26938263517;擋,-8.62075789233;腎,-10.4501688678;豐,-10.8960064312;毕,-8.40922887344;灘,-12.0888059349;神,-8.8436128017;桨,-12.0888059349;短,-8.40178004942;噬,-9.98196541902;齲,-14.2860305122;婴,-12.5514294568;泻,-9.24907790981;唁,-11.600453167;逃,-8.79571632336;包,-8.80956696029;餉,-12.165766976;酬,-10.0913379762;沐,-13.5928833317;檔,-10.6397106725;焙,-12.9867475281;傘,-10.8202946094;厚,-11.3241997903;缝,-10.8737832944;妞,-13.9983484398;挥,-6.4611848212;含,-7.38429330557;讪,-11.1505362963;脹,-8.31476867243;悸,-10.1588961272;哀,-11.1219629239;獅,-12.7455854713;浑,-13.3052012592;桓,-11.0026161662;络,-8.88185275498;擠,-9.15023207517;統,-10.1116432423;峰,-12.5514294568;胸,-10.9302955046;鋤,-15.3846428009;覓,-10.1588961272;炙,-12.9867475281;报,-6.77541752403;訪,-6.97481212781;眬,-11.6234426852;細,-11.8011238624;馳,-8.90153544944;搶,-10.3283969955;访,-6.97481212781;镀,-11.1949880589;燃,-8.82078727436;屆,-11.3415915331;奈,-14.6914956203;旋,-8.46891935226;描,-9.61009125535;赐,-9.92932168554;槓,-11.7470566412;察,-6.4243034344;臣,-10.5971510581;若,-10.8520433077;干,-8.96139583736;惹,-10.4719879152;腸,-10.8960064312;添,-9.00113616601;艺,-9.94656349197;吁,-8.97446791893;谑,-11.4928225028;訕,-11.1505362963;增,-6.83556342061;搡,-11.1651350957;愣,-11.3592911102;說,-5.88867246059;匯,-9.35877682707;炮,-9.92081099587;就,-8.52293146041;纲,-11.5560014044;丽,-13.7752048885;軋,-9.63843961035;囂,-10.8099318224;捏,-11.6234426852;胎,-10.2313512064;块,-11.5560014044;无,-7.47075608604;轧,-9.63843961035;畫,-8.5956710579;櫪,-15.3846428009;瘀,-12.249148585;劃,-8.06081223469;内,-12.3401203632;安,-8.55701356639;辑,-13.3052012592;誓,-9.26434538194;洒,-10.3094689857;圖,-7.26882309968;伦,-12.8196934434;献,-9.1660426812;破,-7.14637017626;款,-7.66462486046;镂,-12.494271043;築,-8.41203654959;乐,-9.17806687417;衔,-11.1799501815;哗,-10.3542048795;叙,-10.7499138127;食,-7.8424293377;敢,-9.46844073829;臥,-9.90817924896;恤,-10.7996753222;诩,-11.5560014044;擷,-12.8997361511;刃,-15.3846428009;將,-11.1651350957;休,-8.34673683745;源,-8.97941434286;訓,-9.88338459035;飯,-7.54787801763;縛,-9.6038992851;鲜,-11.8292947394;实,-6.88256324729;肤,-10.7212037068;氧,-10.4358829105;侦,-13.9983484398;誨,-10.5483608939;親,-8.75395941525;锭,-15.3846428009;弱,-7.85792523954;網,-7.77626832651;餵,-12.2936003475;碴,-13.9983484398;架,-8.59342133817;主,-6.00751761127;囀,-13.4387326518;忆,-8.60472089342;等,-7.7474084121;潑,-11.3956587543;癫,-12.0524382907;灯,-9.19432739504;已,-8.98604786636;購,-5.94295264106;桿,-13.9983484398;课,-8.9153924841;笈,-13.4387326518;戎,-13.3052012592;云,-10.0471047212;讓,-6.59681197163;疗,-6.78017160137;倚,-11.9506555964;掣,-15.3846428009;並,-7.31530043408;垫,-13.5928833317;缰,-12.494271043;害,-6.67451787357;礴,-12.2065889705;址,-10.2371483241;塊,-11.5560014044;操,-11.8582822763;滑,-7.5522318737;佐,-9.7715146945;務,-13.7752048885;杠,-11.7470566412;彰,-9.86718990443;泽,-11.210255531;阁,-9.78993142129;逅,-11.5344951992;熄,-15.3846428009;崇,-9.43922219229;丑,-11.1219629239;沒,-8.23472596476;挣,-12.165766976;急,-9.89570507474;讨,-7.95988103907;吭,-13.4387326518;堵,-9.74273572995;速,-7.30285859396;船,-8.65840939853;涼,-10.0813378928;运,-7.41321180312;類,-11.0539094606;盖,-7.56259879271;竞,-12.2936003475;荣,-8.13756221631;擢,-12.0888059349;詩,-9.67753253614;敷,-11.0671546874;批,-7.87695272307;諾,-7.63488939462;馁,-13.7752048885;待,-6.31230092707;劇,-8.26339034765;喉,-12.8997361511;亏,-8.85376517317;窗,-11.1651350957;外,-7.76983743618;尘,-10.8520433077;鮮,-11.8292947394;斩,-10.6661439296;咳,-11.1799501815;放,-5.98674460533;私,-10.7025115738;魂,-10.6055193078;翅,-11.0671546874;呈,-10.8628542238;棋,-10.3220477679;荒,-9.27317546139;祖,-10.9302955046;罚,-8.98438535558;賣,-6.87065474043;止,-6.02803992194;马,-7.39001048946;噴,-10.0567666321;淹,-14.6914956203;揽,-9.47384615685;閘,-10.2970464657;替,-7.41183201677;陪,-10.5248303965;切,-9.44184342577;踏,-8.99105204694;涎,-11.2415080745;脑,-12.2065889705;排,-6.99528298099;首,-7.62417577168;紙,-8.53240023184;銜,-11.1799501815;氣,-7.40804739158;订,-6.88785641925;交,-6.56291041996;窬,-15.3846428009;费,-7.31561347212;沸,-10.6224688661;耻,-12.8196934434;押,-8.41579242255;籃,-11.6234426852;寂,-9.64163961308;黄,-10.4646618751;片,-9.71821611278;准,-6.70159624539;哈,-13.0820577079;跎,-12.5514294568;慑,-10.3157385987;驗,-7.65931276298;遛,-15.3846428009;滤,-9.69428334657;硫,-10.7695222841;差,-8.54089285189;史,-11.4143508873;围,-7.84295970101;瀆,-11.1079766819;見,-5.27499510208;認,-6.63475184536;辏,-12.7455854713;戒,-9.85918986176;算,-5.97807796695;吞,-10.1065281417;伤,-7.14584163502;控,-8.18870557442;第,-10.8960064312;芽,-9.09492722998;磁,-12.8196934434;構,-9.93360434733;惑,-8.49607034133;腐,-10.1323693728;峙,-9.53820402584;勝,-7.52677524156;瑞,-15.3846428009;以,-4.62910441555;潤,-8.0621323669;竭,-9.16803669981;割,-7.83188071668;蹺,-13.3052012592;禀,-10.8960064312;帅,-10.6932949187;吉,-13.1874182236;伏,-7.61484180489;憐,-8.39346591377;蔓,-13.9983484398;庚,-13.7752048885;真,-8.97776281482;校,-9.66761509949;夫,-10.4430003783;弯,-9.60081761856;粮,-9.57650031091;週,-14.2860305122;阵,-9.053140951;涸,-10.1751566481;溺,-11.4726197955;闈,-13.7752048885;囊,-12.8997361511;诌,-11.7737248882;苒,-13.7752048885;晕,-9.1561317973;字,-8.66925941456;剝,-10.8202946094;坟,-11.6957633468;衡,-8.58893702572;旨,-10.0471047212;寬,-8.62654829647;歷,-7.6717518394;跸,-10.7402519018;板,-9.76787170323;宁,-14.2860305122;稀,-13.1874182236;成,-4.1470888288;碗,-15.3846428009;帘,-13.0820577079;殡,-11.3241997903;谤,-10.4719879152;馭,-10.19168595;缮,-10.6841624351;琴,-10.5483608939;边,-10.1806361138;游,-8.58447273259;芻,-11.6469731826;膽,-10.6751125996;怼,-13.9983484398;练,-9.053140951;陈,-10.2847763731;槍,-9.50690701911;行,-4.03176872407;低,-6.64654857072;策,-8.907670438;忙,-8.82786444473;凝,-12.9867475281;睞,-8.79296906888;代,-7.24783193722;汤,-11.6469731826;布,-4.9099497386;霉,-11.307105357;疊,-8.92317462454;谏,-10.6751125996;爛,-8.99776348153;次,-10.4719879152;誠,-10.4358829105;津,-11.0941833597;性,-9.43660781171;薪,-10.9187346822;阳,-9.70106303355;悼,-11.0026161662;驴,-15.3846428009;橋,-9.54400114352;闊,-9.21712631;迎,-7.88910085701;晓,-8.83642369813;塗,-11.8292947394;绘,-8.58447273259;線,-9.65454301792;祭,-10.7118139664;鋒,-9.33255363197;軸,-12.7455854713;锁,-8.88786781071;砂,-15.3846428009;約,-7.12285812138;爆,-9.80114649211;渎,-11.1079766819;怒,-8.02708659998;攔,-9.60081761856;尚,-9.95529717194;謠,-10.5404557144;贤,-10.9302955046;宫,-9.01645561454;縮,-7.15486505081;励,-7.40086173192;覷,-10.6841624351;显,-9.08019399847;糅,-12.7455854713;靈,-9.94222509037;告,-7.30595457166;乎,-7.95928491387;荐,-6.88296942113;染,-7.54708844001;聒,-13.1874182236;叛,-9.25995941;嗟,-14.6914956203;饬,-10.6484443525;狱,-8.86993011002;印,-8.47588802158;石,-10.7996753222;遲,-8.95331171896;威,-9.56753164093;简,-10.6661439296;弃,-7.34162191559;蠍,-15.3846428009;贏,-10.6841624351;软,-10.8737832944;农,-10.1588961272;生,-4.77516588278;模,-14.2860305122;愧,-9.73919590325;頭,-5.84033332251;现,-4.03308398837;吵,-10.3094689857;丹,-10.4430003783;从,-6.94411469441;扑,-10.4868030009;套,-10.7996753222;鍛,-13.9983484398;燜,-13.7752048885;啟,-8.71514471103;詡,-11.5560014044;佣,-9.57950783198;淤,-12.6765925998;拦,-9.60081761856;台,-7.23071766888;间,-9.36119520793;賺,-11.3592911102;臼,-12.6765925998;饋,-9.02506893222;境,-9.4313994666;嚇,-9.72516058513;醉,-8.931017802;侍,-9.02680053438;搐,-9.96410780162;魘,-14.6914956203;領,-6.55614867143;憩,-11.1651350957;閱,-8.47888952458;傳,-7.36470111322;核,-8.24418975779;欺,-11.6957633468;局,-10.1861457696;商,-7.25842027143;燉,-12.9867475281;馍,-11.4143508873;半,-9.44184342577;蹌,-10.4646618751;募,-9.20255789418;煞,-12.3401203632;跡,-9.63843961035;池,-14.2860305122;潢,-15.3846428009;该,-5.94581319128;恨,-8.59005622002;端,-11.8011238624;奮,-7.79076495629;鉴,-9.08385700623;赶,-8.67533846063;擻,-11.7470566412;拿,-9.02334032332;腾,-7.98463328373;窄,-11.5560014044;疆,-12.9867475281;鄉,-8.45904760378;谋,-9.34200996721;伍,-9.53244032112;蔑,-9.85521371338;撐,-7.10266574202;礙,-8.38066866417;题,-10.3942102141;定,-4.82446460481;障,-7.38899919661;負,-7.8424293377;誤,-8.45708489461;薦,-6.88296942113;弭,-11.8582822763;禮,-8.33192175166;唱,-8.42145281502;鑲,-13.3052012592;郵,-13.1874182236;殺,-7.34419591959;憾,-12.5514294568;嗆,-12.1265462629;煉,-7.90760432857;及,-6.2708133293;軌,-9.93360434733;觎,-10.953826002;救,-7.35749269406;捕,-7.92818824572;呛,-12.1265462629;坝,-11.8881352394;盜,-10.7596699876;衣,-9.26875067541;虧,-8.85376517317;旦,-12.9867475281;廬,-13.3052012592;獵,-9.09492722998;诺,-7.63488939462;承,-7.54708844001;岁,-11.51344179;紀,-12.7455854713;笄,-14.6914956203;理,-5.67032016763;躍,-7.32821603337;尖,-10.9187346822;項,-10.2488443638;逞,-10.6139581764;没,-8.23472596476;航,-7.66285102408;庭,-9.92932168554;钱,-7.46856470459;田,-9.76424193518;决,-6.24913373954;猴,-12.5514294568;竅,-10.6841624351;呆,-9.97747102943;先,-8.24418975779;削,-8.2370835297;志,-9.82781473919;解,-5.62675922222;慨,-9.46038700348;续,-5.45412390931;逼,-9.43660781171;镰,-14.2860305122;却,-8.77394675617;聾,-12.8997361511;封,-7.52099153544;纂,-9.32785878766;震,-10.9901936462;倉,-7.55461471836;脓,-11.1219629239;媚,-10.8099318224;亢,-13.5928833317;认,-6.63475184536;席,-8.03028047047;寄,-10.9073059864;睇,-15.3846428009;测,-6.72786159527;題,-10.3942102141;糖,-9.28208420628;秘,-9.58858505013;矜,-15.3846428009;象,-7.70492916093;擦,-9.00621661724;壮,-10.4358829105;酒,-7.48660311013;牵,-13.3052012592;觸,-7.65754831611;征,-7.42886701936;馅,-12.6765925998;事,-6.12095125342;焊,-13.9983484398;攒,-10.8307659093;怔,-11.4528171682;娘,-11.7470566412;多,-7.88632693013;澡,-9.56159690541;财,-7.29362775918;掩,-9.95529717194;庫,-10.7118139664;劳,-9.42106345727;甲,-11.0279339742;買,-6.89873389952;漶,-14.2860305122;肿,-9.47113979525;挾,-10.4358829105;酊,-13.9983484398;虐,-10.1014390722;拓,-8.81375983855;联,-8.94051154419;鳗,-13.4387326518;雛,-11.6469731826;祚,-14.2860305122;嗝,-12.2936003475;信,-6.49809538838;屬,-7.48883442381;陰,-11.4143508873;側,-12.165766976;餅,-12.8997361511;下,-5.55782033329;熊,-14.6914956203;悔,-8.42809735774;樣,-9.69091066209;師,-8.69628808695;谷,-12.0524382907;蔽,-9.7715146945;撼,-9.68754931439;飄,-11.1361475588;释,-6.85967987221;村,-11.1079766819;打,-7.59394676972;慕,-9.00621661724;轡,-12.2936003475;騁,-10.8413480186;拨,-9.03550380951;困,-9.34916136837;闲,-10.219856827;諸,-10.1588961272;恿,-10.4430003783;缀,-9.96854239869;颅,-13.7752048885;例,-9.76787170323;規,-9.17203670514;帖,-12.165766976;熟,-9.6163218051;传,-7.36470111322;谢,-7.31061658477;岭,-13.4387326518;種,-7.50724561454;隱,-10.8099318224;債,-8.37704218694;誹,-12.6765925998;膿,-11.1219629239;层,-10.4358829105;磅,-12.0888059349;症,-10.4148295013;陆,-7.87038814808;遊,-8.58447273259;赌,-10.3157385987;惕,-8.9200544972;腔,-10.4501688678;哝,-10.0001477381;畜,-11.7470566412;晦,-13.1874182236;积,-7.32536657759;醒,-7.3336205927;兴,-8.10532396548;混,-10.8202946094;币,-11.1799501815;铁,-9.99557107108;堅,-12.6120540787;炊,-12.5514294568;涌,-9.39819079561;析,-8.92630451755;撒,-10.7402519018;耕,-9.64807050341;紗,-9.63524981498;官,-8.58224803757;喜,-8.25855552759;办,-6.71730695105;渡,-7.70123911984;貢,-10.0047454474;窮,-11.8582822763;嘱,-9.71131953372;瞰,-9.93790542923;贷,-8.83499205866;溶,-11.7210811548;落,-6.40939205125;於,-4.12080709775;集,-6.3286197893;跌,-6.07699424645;恕,-10.1428957858;坛,-15.3846428009;磚,-12.165766976;乡,-8.45904760378;波,-9.64484988871;补,-7.92588010851;癱,-11.51344179;灵,-9.94222509037;海,-8.48089554331;件,-12.5514294568;诸,-10.1588961272;
+E,y:已,-1.08461536847;呀,-5.37887276329;呢,-4.68572558273;著,-4.26191133595;罷,-2.15114732314;了,-1.30984600905;罢,-2.15114732314;好,-1.39504602573;着,-4.26191133595;
+E,z:怀,-9.1345746162;茂,-10.9263340854;娜,-7.55903825544;洞,-6.49551728659;绝,-7.7908398695;般,-8.15374536319;然,-3.48267040231;方,-7.11967159566;齊,-6.28194318629;濕,-7.14214445151;滟,-9.1345746162;凡,-4.69585263785;遠,-5.96348945517;緩,-8.44142743564;烫,-6.34136660676;扬,-10.2331869049;盯,-8.72910950809;闹,-6.93735003887;滿,-10.2331869049;的,-2.44145749549;沈,-5.20274898348;缕,-6.47198678918;悠,-4.79946490132;倫,-7.23745463132;單,-6.90098239469;失,-7.46059818263;張,-5.95652078585;刷,-6.69222758083;雄,-7.2627724393;滔,-6.18140195707;顛,-8.15374536319;叢,-10.2331869049;峨,-5.85742988321;火,-7.34281514697;声,-8.62374899244;滴,-7.49234688094;艷,-7.14214445151;湿,-7.14214445151;邁,-6.62226899223;閃,-5.1122035536;嚅,-9.316896173;沉,-5.20274898348;上,-7.21276201873;經,-9.82772179676;底,-10.9263340854;蒙,-5.98469166282;攘,-8.03596232753;憫,-8.44142743564;枯,-9.54003972431;足,-4.83728920998;甸,-6.56962525874;便,-6.69222758083;郁,-6.07430382151;雅,-7.05513307452;靄,-8.62374899244;苍,-6.70682638025;潔,-6.84879664152;孜,-7.88181164771;绵,-5.27034227461;节,-10.2331869049;梆,-8.84689254375;爍,-7.66823754741;霏,-8.72910950809;喘,-9.316896173;褛,-7.7908398695;皚,-7.66823754741;熠,-7.09769268894;鬧,-6.93735003887;脫,-7.59412957525;眯,-6.06652168107;净,-5.43327264209;际,-7.63049721943;绊,-8.62374899244;坏,-10.2331869049;浓,-8.36138472797;胖,-6.95604217188;鳞,-10.9263340854;散,-8.72910950809;淨,-5.43327264209;扭,-7.18866446715;赳,-7.83529163207;捷,-6.05113676223;惶,-7.2887479257;糾,-8.52843881263;颇,-8.03596232753;頂,-6.81546022126;气,-6.47198678918;嘘,-9.1345746162;碧,-10.9263340854;分,-10.2331869049;騰,-6.02105930699;軟,-6.58252866358;重,-5.54183902264;结,-10.2331869049;糟,-6.60884597189;難,-6.40454550838;兢,-6.7366793434;踽,-8.44142743564;腦,-8.52843881263;臭,-9.316896173;漉,-6.11414973006;越,-8.62374899244;蔥,-9.1345746162;垮,-7.93060181188;鬱,-6.07430382151;耷,-9.82772179676;颼,-7.70745826056;晃,-5.36565245441;懂,-8.84689254375;哄,-5.89589616404;絕,-7.7908398695;静,-6.66365420839;荡,-5.87008828008;狠,-6.02105930699;實,-5.01825114726;彩,-9.316896173;平,-5.93590149865;绿,-5.23597463111;好,-3.47567328922;匀,-10.9263340854;撅,-10.9263340854;缈,-9.82772179676;压,-6.16416015063;疏,-7.63049721943;明,-6.09005217848;遙,-6.93735003887;皙,-7.37098602394;條,-6.70682638025;涟,-7.66823754741;贴,-10.9263340854;冷,-5.23260194663;綿,-5.27034227461;渾,-6.36198589396;區,-7.34281514697;绉,-7.55903825544;慌,-8.03596232753;遢,-9.1345746162;叫,-8.28727675581;汪,-5.88290896851;热,-4.79728387537;懷,-9.1345746162;澈,-7.70745826056;濃,-8.36138472797;娑,-7.03451378732;缓,-8.44142743564;涔,-10.9263340854;抖,-7.74828025508;咚,-7.88181164771;莠,-8.44142743564;大,-8.52843881263;猝,-7.03451378732;茫,-4.63476494587;冬,-9.82772179676;曲,-6.55688623296;星,-8.09312074137;揀,-9.1345746162;烂,-6.3312142353;迈,-6.62226899223;糊,-5.24616147641;凌,-9.82772179676;当,-6.46042596678;飒,-7.09769268894;展,-8.72910950809;衝,-5.60821409159;點,-8.62374899244;叠,-6.48368282894;佳,-3.42194252627;巴,-5.30593321971;死,-7.98189510626;滾,-5.07126216323;融,-7.21276201873;暗,-6.05879963497;依,-6.2349862032;嚷,-7.93060181188;逸,-7.14214445151;区,-7.34281514697;杂,-6.79919970038;絆,-8.62374899244;苏,-10.9263340854;煎,-8.84689254375;壓,-6.16416015063;燙,-6.34136660676;博,-9.82772179676;楞,-10.2331869049;面,-8.72910950809;歪,-8.62374899244;短,-4.75463348802;兮,-7.23745463132;當,-6.46042596678;峻,-7.05513307452;忽,-7.46059818263;變,-5.72232739835;服,-7.34281514697;厚,-10.9263340854;溜,-5.69522546858;黄,-5.0374561271;润,-10.9263340854;天,-5.04580109903;霭,-8.62374899244;燎,-8.72910950809;浑,-6.36198589396;忒,-10.2331869049;嗖,-9.1345746162;烘,-6.40454550838;揚,-10.2331869049;良,-3.86414245314;综,-7.39997356081;昂,-7.18866446715;謔,-7.74828025508;蘢,-7.66823754741;墩,-8.21828388433;細,-7.2887479257;点,-8.62374899244;結,-10.2331869049;答,-7.70745826056;慘,-8.15374536319;黝,-7.16513396974;癢,-8.84689254375;若,-7.66823754741;鼓,-7.66823754741;華,-10.9263340854;泱,-8.98042393637;干,-8.62374899244;吁,-7.49234688094;茏,-7.66823754741;炎,-7.2887479257;谑,-7.74828025508;朗,-6.50749347763;紛,-6.20783521413;悯,-8.44142743564;丝,-7.74828025508;愣,-7.88181164771;蔫,-8.09312074137;昭,-8.84689254375;丽,-5.82646765761;穷,-6.18140195707;潇,-7.63049721943;捏,-8.36138472797;比,-4.49984562797;恙,-7.23745463132;远,-5.96348945517;壞,-10.2331869049;酣,-7.37098602394;古,-8.09312074137;坷,-9.1345746162;恹,-8.09312074137;幽,-5.97050702783;漆,-6.59560074514;安,-7.46059818263;縐,-7.55903825544;洒,-8.72910950809;脚,-6.50749347763;伦,-7.23745463132;炯,-6.86589107488;莹,-7.70745826056;麻,-5.77304249093;綽,-10.9263340854;勃,-6.70682638025;藍,-6.50749347763;烏,-7.98189510626;华,-10.9263340854;乐,-9.316896173;拣,-9.1345746162;坦,-9.82772179676;涓,-7.52513670377;絲,-7.74828025508;悄,-5.52817138391;簇,-10.9263340854;和,-9.1345746162;怏,-6.86589107488;折,-7.49234688094;丛,-10.2331869049;蠟,-9.1345746162;实,-5.01825114726;蜡,-9.1345746162;骨,-6.32116389944;怯,-7.05513307452;弱,-6.93735003887;稳,-7.46059818263;芸,-9.316896173;醺,-7.66823754741;粼,-8.36138472797;潑,-8.52843881263;淒,-10.9263340854;奕,-8.84689254375;条,-6.70682638025;曠,-10.2331869049;酥,-9.316896173;癫,-7.83529163207;蕭,-6.63587464428;蓬,-7.2887479257;绰,-10.9263340854;驳,-6.90098239469;緲,-9.82772179676;泼,-8.52843881263;云,-6.49551728659;通,-6.49551728659;紜,-7.37098602394;刮,-10.9263340854;喷,-6.84879664152;茸,-6.38303930316;禿,-6.62226899223;殷,-7.59412957525;黑,-4.20852939041;齐,-6.28194318629;飕,-7.70745826056;透,-10.9263340854;盡,-7.55903825544;蹦,-8.98042393637;嫩,-8.15374536319;敬,-6.04353216284;籲,-7.49234688094;旷,-10.2331869049;晶,-6.84879664152;烁,-7.66823754741;徐,-10.9263340854;蠕,-9.316896173;綜,-7.39997356081;急,-8.03596232753;约,-4.98616283271;搭,-8.09312074137;速,-4.84183467235;尽,-7.55903825544;涼,-5.46674857129;凄,-10.9263340854;细,-7.2887479257;婉,-7.83529163207;裊,-6.69222758083;变,-5.72232739835;惚,-7.16513396974;遥,-6.93735003887;穩,-7.46059818263;長,-4.16244917687;零,-6.4265244151;惺,-7.7908398695;脆,-9.316896173;合,-9.54003972431;熱,-4.79728387537;簸,-9.54003972431;强,-8.09312074137;莽,-7.70745826056;放,-6.41547457891;駁,-6.90098239469;经,-9.82772179676;潤,-10.9263340854;疑,-6.84879664152;煦,-9.82772179676;貼,-10.9263340854;噴,-6.84879664152;潺,-6.90098239469;切,-7.21276201873;脑,-8.52843881263;邐,-6.44899727095;匝,-7.63049721943;嘟,-9.316896173;颠,-8.15374536319;氣,-6.47198678918;璨,-6.72164146604;瞪,-7.83529163207;脱,-7.59412957525;疾,-7.7908398695;寂,-7.42982652396;仄,-8.21828388433;片,-7.31541617279;哈,-6.64966796641;囔,-7.66823754741;癟,-10.9263340854;燦,-6.9190009002;哨,-8.44142743564;直,-5.73894827959;婷,-8.15374536319;樂,-9.316896173;斓,-6.78319935904;嚕,-10.2331869049;吞,-6.53188493076;逦,-6.44899727095;瘪,-10.9263340854;朴,-9.54003972431;讷,-7.34281514697;油,-7.05513307452;渺,-9.82772179676;纷,-6.20783521413;恆,-5.23260194663;秋,-9.316896173;糙,-9.82772179676;嵘,-7.09769268894;凛,-7.14214445151;挺,-6.4376977157;彤,-7.52513670377;色,-9.82772179676;顶,-6.81546022126;浸,-10.2331869049;清,-6.69222758083;澄,-7.55903825544;吉,-7.2627724393;愛,-8.84689254375;真,-7.63049721943;撞,-6.4376977157;邦,-7.16513396974;弯,-8.72910950809;冰,-6.56962525874;嶸,-7.09769268894;爽,-7.93060181188;秀,-8.15374536319;囊,-7.70745826056;蹌,-6.67783884338;灑,-8.72910950809;處,-8.21828388433;滚,-5.07126216323;迤,-6.8832828176;荧,-8.03596232753;瑩,-7.70745826056;盪,-5.87008828008;软,-6.58252866358;汹,-7.07618648372;腻,-8.28727675581;板,-9.82772179676;言,-10.9263340854;匆,-3.92782444318;斕,-6.78319935904;边,-5.17694109952;常,-7.42982652396;黃,-5.0374561271;楂,-10.9263340854;塌,-8.72910950809;彎,-8.72910950809;兒,-6.17274389432;忙,-5.54643673189;乘,-7.09769268894;淥,-8.72910950809;層,-8.03596232753;胧,-6.9190009002;矩,-7.03451378732;硬,-7.88181164771;艰,-8.72910950809;曳,-9.82772179676;勻,-10.9263340854;灼,-6.70682638025;松,-7.14214445151;紅,-4.11069409536;疊,-6.48368282894;碌,-6.70682638025;小,-4.20732093104;美,-9.54003972431;挑,-10.9263340854;熒,-8.03596232753;頗,-8.03596232753;爛,-6.3312142353;吟,-6.10605251982;瀚,-8.98042393637;津,-7.98189510626;微,-6.49551728659;冲,-5.60821409159;繃,-8.36138472797;益,-8.72910950809;浅,-8.52843881263;张,-5.95652078585;盈,-6.51961483817;噓,-9.1345746162;塗,-5.9918601523;瑟,-6.02105930699;闪,-5.1122035536;危,-7.01431108;淺,-8.52843881263;堂,-5.40487316757;約,-4.98616283271;爆,-9.1345746162;倒,-10.9263340854;咕,-8.03596232753;辣,-5.63302926071;沥,-8.84689254375;在,-5.40888118897;花,-5.92912181167;去,-7.46059818263;心,-8.72910950809;懇,-8.15374536319;靈,-7.59412957525;乎,-5.21922382068;恒,-5.23260194663;赤,-10.9263340854;聲,-8.62374899244;整,-7.37098602394;潸,-9.1345746162;嶄,-8.98042393637;圓,-5.93590149865;悒,-10.2331869049;瀝,-8.84689254375;生,-5.48391637491;漣,-7.66823754741;瘩,-7.88181164771;累,-6.39373459228;亮,-5.37337450051;爱,-8.84689254375;现,-8.09312074137;难,-6.40454550838;節,-10.2331869049;跄,-6.67783884338;扑,-7.23745463132;瑕,-7.2627724393;凜,-7.14214445151;回,-7.03451378732;滑,-7.83529163207;苦,-6.32116389944;噩,-7.98189510626;艱,-8.72910950809;呵,-6.79919970038;痴,-7.7908398695;幹,-8.62374899244;长,-4.16244917687;异,-5.97757419505;皇,-10.2331869049;渌,-8.72910950809;斑,-6.56962525874;蜒,-8.21828388433;麗,-5.82646765761;香,-8.09312074137;膩,-8.28727675581;康,-8.98042393637;洶,-7.07618648372;咻,-7.88181164771;凉,-5.46674857129;峋,-7.39997356081;乌,-7.98189510626;青,-5.60332410629;噜,-10.2331869049;淡,-4.90774087093;寥,-6.34136660676;啦,-7.74828025508;端,-6.20783521413;绷,-8.36138472797;腾,-6.02105930699;洁,-6.84879664152;蘇,-10.9263340854;脉,-8.28727675581;定,-7.34281514697;茵,-8.09312074137;縷,-6.47198678918;朽,-5.90905424861;光,-6.09005217848;烈,-7.88181164771;道,-9.54003972431;单,-6.90098239469;飘,-7.01431108;雜,-6.79919970038;迢,-7.74828025508;嗦,-10.9263340854;惨,-8.15374536319;豫,-7.55903825544;恳,-8.15374536319;習,-7.63049721943;裸,-6.37245719383;瞇,-6.06652168107;脈,-8.28727675581;舊,-3.55736368324;宏,-8.21828388433;蜜,-8.03596232753;纭,-7.37098602394;褸,-7.7908398695;秃,-6.62226899223;呆,-5.99908040027;淋,-5.5556960573;靜,-6.66365420839;幢,-9.82772179676;全,-7.46059818263;異,-5.97757419505;至,-7.88181164771;癲,-7.83529163207;迷,-9.1345746162;空,-6.08214699897;洋,-5.79053564838;碎,-8.21828388433;綠,-5.23597463111;红,-4.11069409536;訥,-7.34281514697;朧,-6.9190009002;喜,-8.03596232753;新,-7.46059818263;強,-8.09312074137;懈,-6.4376977157;秘,-8.21828388433;低,-8.03596232753;黢,-8.21828388433;篤,-8.09312074137;灩,-9.1345746162;懨,-8.09312074137;赫,-6.78319935904;蹭,-7.52513670377;廓,-8.44142743564;森,-6.63587464428;葱,-9.1345746162;腳,-6.50749347763;雲,-6.49551728659;白,-3.68855589351;圆,-5.93590149865;興,-6.60884597189;簌,-6.08214699897;怔,-9.316896173;粗,-7.46059818263;際,-7.63049721943;多,-7.70745826056;索,-7.39997356081;妥,-10.9263340854;咧,-6.2349862032;朦,-8.72910950809;颯,-7.09769268894;伶,-9.54003972431;容,-6.93735003887;樸,-9.54003972431;滋,-6.69222758083;巍,-5.9918601523;虐,-9.82772179676;盛,-5.54643673189;楚,-5.01825114726;习,-7.63049721943;睦,-9.54003972431;呼,-6.30136127215;涂,-5.9918601523;熊,-6.27237373527;沌,-9.82772179676;隐,-5.06554786196;閒,-6.44899727095;瀟,-7.63049721943;纠,-8.52843881263;萧,-6.63587464428;醪,-10.2331869049;崭,-8.98042393637;嘻,-5.44569516209;蒼,-6.70682638025;飄,-7.01431108;痒,-8.84689254375;鱗,-10.9263340854;高,-7.21276201873;祥,-5.50138406795;艳,-7.14214445151;闲,-6.44899727095;惴,-7.74828025508;登,-10.2331869049;哼,-7.07618648372;灿,-6.9190009002;現,-8.09312074137;躁,-10.9263340854;袅,-6.69222758083;处,-8.21828388433;皑,-7.66823754741;呱,-10.9263340854;帖,-8.28727675581;熟,-7.14214445151;漠,-7.2887479257;瘦,-6.26289499132;挨,-10.2331869049;怪,-9.1345746162;隱,-5.06554786196;地,-2.653763477;戾,-8.44142743564;层,-8.03596232753;奄,-8.72910950809;拉,-7.2627724393;蓝,-6.50749347763;满,-10.2331869049;旧,-3.55736368324;快,-5.25990739732;峭,-8.98042393637;僵,-10.9263340854;兴,-6.60884597189;啼,-6.69222758083;笃,-8.09312074137;隆,-8.52843881263;邊,-5.17694109952;斜,-7.03451378732;唧,-9.54003972431;漫,-7.55903825544;窮,-6.18140195707;撲,-7.23745463132;溶,-8.28727675581;落,-6.2916050972;疼,-7.59412957525;儿,-6.17274389432;盆,-8.21828388433;卓,-9.54003972431;橙,-10.9263340854;翠,-6.69222758083;正,-6.86589107488;叨,-6.97509036685;灵,-7.59412957525;致,-10.2331869049;命,-7.7908398695;勾,-7.11967159566;
+M,ad:經,-3.49650756147;確,-0.749236647211;規,-3.71965111278;實,-0.749236647211;规,-3.71965111278;确,-0.749236647211;经,-3.49650756147;实,-0.749236647211;
+M,a:要,-4.26625051239;合,-2.1517176509;成,-5.11354837278;管,-7.31077295011;谱,-6.46347508973;玩,-5.70133503768;理,-7.02309087766;边,-8.40938523878;臉,-6.10680014579;像,-4.49736223335;济,-4.60272274901;面,-5.77032790917;為,-4.64818512309;耐,-2.51774102696;周,-7.31077295011;罪,-4.64818512309;想,-5.92447858899;週,-7.31077295011;當,-5.51901348089;如,-4.28225085374;紅,-6.10680014579;閒,-7.31077295011;君,-5.27389102285;誠,-8.40938523878;动,-5.70133503768;含,-6.21216066145;稳,-5.51901348089;光,-6.10680014579;手,-7.71623805822;道,-5.00818785712;诚,-8.40938523878;火,-6.10680014579;自,-7.31077295011;景,-3.34048103656;恳,-8.40938523878;闲,-7.31077295011;出,-4.29851137461;好,-2.04981137011;曼,-5.51901348089;分,-4.85403717729;上,-6.61762576955;規,-2.644194136;經,-3.48213155362;得,-2.54859901532;尖,-6.61762576955;没,-5.63679651654;趣,-6.3299436971;瞧,-8.40938523878;笨,-7.71623805822;头,-7.71623805822;脸,-6.10680014579;为,-4.64818512309;眼,-6.3299436971;勁,-4.9753980343;心,-6.61762576955;过,-6.21216066145;名,-6.61762576955;過,-6.21216066145;動,-5.70133503768;譜,-6.46347508973;濟,-4.60272274901;口,-7.31077295011;慨,-8.40938523878;快,-7.02309087766;闷,-5.84443588132;門,-7.71623805822;蒂,-5.51901348089;邊,-8.40938523878;不,-2.21702274931;意,-2.00415678075;沒,-5.63679651654;愛,-5.27389102285;生,-8.40938523878;红,-6.10680014579;懇,-8.40938523878;大,-8.40938523878;頭,-7.71623805822;味,-8.40938523878;爱,-5.27389102285;劲,-4.9753980343;真,-6.46347508973;悶,-5.84443588132;人,-4.55923763707;爽,-7.02309087766;规,-2.644194136;当,-5.51901348089;经,-3.48213155362;穩,-5.51901348089;门,-7.71623805822;起,-4.14670536174;
+M,b:羅,-8.06098200759;合,-2.94538627786;序,-8.57180763136;預,-6.96236971892;料,-8.2841255589;宝,-7.59097837834;造,-8.97727273946;吨,-5.37996047888;輪,-8.57180763136;键,-8.97727273946;熱,-6.96236971892;專,-6.78004816213;方,-5.93275030174;吸,-8.97727273946;强,-8.06098200759;线,-3.79268413824;放,-5.77859962191;铃,-8.2841255589;坊,-9.67041992002;珍,-8.57180763136;经,-5.90921980433;济,-9.67041992002;凑,-5.51153683666;筒,-7.03136259041;織,-7.72450977097;员,-9.67041992002;统,-7.72450977097;遠,-7.03136259041;马,-5.98154046591;念,-7.59097837834;噴,-8.2841255589;摸,-7.8786604508;沈,-8.57180763136;踏,-8.57180763136;輕,-9.67041992002;列,-8.97727273946;星,-4.47746306913;無,-7.72450977097;氣,-4.87462937443;走,-7.59097837834;循,-8.57180763136;港,-9.67041992002;單,-8.97727273946;械,-5.30097206756;張,-6.83720657597;片,-8.2841255589;毒,-8.57180763136;教,-8.2841255589;號,-9.67041992002;来,-9.67041992002;座,-6.37458305402;触,-6.37458305402;景,-7.18551327024;饱,-8.57180763136;直,-9.67041992002;沉,-8.57180763136;上,-5.28839328535;導,-7.8786604508;碑,-6.0328337603;經,-5.90921980433;划,-6.89783119778;算,-6.08690098157;军,-6.89783119778;业,-7.18551327024;用,-8.2841255589;油,-8.97727273946;贸,-5.93275030174;离,-7.59097837834;鈴,-8.2841255589;磁,-7.36783482703;跃,-6.37458305402;湊,-5.51153683666;诗,-8.06098200759;濟,-9.67041992002;属,-7.36783482703;机,-4.65314008321;号,-9.67041992002;智,-8.2841255589;节,-5.98154046591;龄,-6.57937746667;賬,-5.43631341543;级,-9.67041992002;春,-8.97727273946;群,-8.97727273946;术,-8.97727273946;钮,-8.97727273946;阵,-8.97727273946;风,-9.67041992002;人,-8.57180763136;爽,-8.97727273946;精,-7.59097837834;际,-6.72598094086;歇,-6.89783119778;屉,-7.72450977097;克,-6.412323382;菌,-7.36783482703;住,-7.72450977097;浓,-8.97727273946;處,-7.03136259041;字,-6.57937746667;胖,-8.97727273946;科,-7.8786604508;散,-8.2841255589;歧,-8.06098200759;巨,-8.57180763136;八,-7.03136259041;歷,-8.2841255589;养,-7.10547056256;导,-7.8786604508;射,-7.47319534269;师,-7.72450977097;而,-7.10547056256;气,-4.87462937443;力,-7.8786604508;級,-9.67041992002;计,-7.36783482703;儲,-8.97727273946;水,-8.2841255589;常,-4.86639887529;貿,-5.93275030174;证,-7.8786604508;立,-7.10547056256;重,-7.8786604508;职,-7.47319534269;低,-6.49236608968;发,-6.72598094086;遜,-6.33821540985;代,-9.67041992002;慢,-6.5349257041;日,-9.67041992002;層,-3.8562893882;学,-6.23643271554;器,-8.97727273946;浪,-6.45154409516;识,-8.2841255589;置,-7.72450977097;廳,-6.37458305402;噸,-5.37996047888;松,-8.2841255589;持,-8.06098200759;技,-5.60997690948;布,-5.82027231831;紅,-6.67468764647;标,-7.18551327024;历,-8.2841255589;有,-5.42192467797;程,-6.26922253836;疊,-5.70012800647;复,-6.26922253836;小,-3.96663744537;专,-6.78004816213;鎖,-8.2841255589;縣,-7.59097837834;缩,-6.96236971892;启,-9.67041992002;电,-6.5349257041;样,-9.67041992002;家,-3.93384762255;年,-3.51132453153;故,-7.47319534269;密,-6.83720657597;轉,-6.11507185853;盈,-7.59097837834;手,-7.47319534269;筑,-5.7385942873;遗,-9.67041992002;線,-3.79268413824;陣,-8.97727273946;彩,-9.67041992002;黨,-8.2841255589;業,-7.18551327024;平,-8.2841255589;職,-7.47319534269;寶,-7.59097837834;約,-5.77859962191;明,-6.96236971892;團,-7.72450977097;务,-9.67041992002;縮,-6.96236971892;抱,-7.47319534269;制,-4.78761799744;携,-5.30097206756;區,-7.59097837834;濃,-8.97727273946;斷,-7.27252464723;阶,-6.6258974823;族,-6.78004816213;子,-6.0328337603;染,-9.67041992002;離,-7.59097837834;法,-8.57180763136;裝,-7.59097837834;尺,-6.89783119778;热,-6.96236971892;公,-5.02602902088;石,-8.2841255589;泵,-9.67041992002;究,-9.67041992002;能,-5.66308673479;湾,-8.57180763136;薄,-9.67041992002;三,-9.67041992002;倍,-7.47319534269;心,-6.78004816213;階,-6.6258974823;农,-5.13782042687;生,-4.95192104873;营,-5.5760753578;大,-4.49993592499;金,-5.15956041351;馬,-5.98154046591;现,-6.45154409516;政,-5.51153683666;節,-5.98154046591;奇,-7.59097837834;提,-7.03136259041;体,-5.64506822929;藏,-8.57180763136;論,-9.67041992002;啟,-9.67041992002;回,-8.57180763136;叠,-5.70012800647;台,-7.36783482703;巴,-8.57180763136;風,-9.67041992002;长,-4.9882886929;綁,-7.72450977097;异,-8.57180763136;厅,-6.37458305402;務,-9.67041992002;店,-7.47319534269;識,-8.2841255589;功,-3.53919343054;接,-7.47319534269;产,-5.21607262377;账,-5.43631341543;央,-7.72450977097;傳,-6.45154409516;訴,-8.2841255589;收,-7.18551327024;核,-6.33821540985;治,-6.96236971892;区,-7.59097837834;局,-6.30312409004;织,-7.72450977097;商,-6.412323382;拟,-6.96236971892;越,-4.91682972892;短,-5.98154046591;穴,-6.5349257041;价,-8.2841255589;系,-4.09447081688;發,-6.72598094086;锁,-8.2841255589;變,-9.67041992002;檔,-7.8786604508;定,-5.45091221485;障,-5.64506822929;負,-6.78004816213;鬥,-9.67041992002;天,-4.12915637487;储,-8.97727273946;由,-7.03136259041;環,-7.27252464723;農,-5.13782042687;炸,-6.67468764647;论,-9.67041992002;流,-6.83720657597;及,-8.2841255589;術,-8.97727273946;单,-8.97727273946;體,-5.64506822929;络,-7.8786604508;機,-4.65314008321;絡,-7.8786604508;档,-7.8786604508;部,-6.45154409516;道,-9.67041992002;統,-7.72450977097;鍵,-8.97727273946;时,-4.25877386817;载,-6.5349257041;承,-8.57180763136;市,-5.93275030174;理,-4.65978462593;肉,-6.96236971892;載,-6.5349257041;躍,-6.37458305402;范,-8.06098200759;林,-9.67041992002;搖,-7.72450977097;原,-8.97727273946;庭,-7.36783482703;本,-6.96236971892;环,-7.27252464723;細,-4.80288546957;点,-6.96236971892;县,-7.59097837834;品,-8.06098200759;燃,-8.97727273946;時,-4.25877386817;先,-8.97727273946;旋,-6.5349257041;軍,-6.89783119778;灣,-8.57180763136;動,-4.1174603351;志,-9.67041992002;作,-9.67041992002;令,-7.03136259041;員,-9.67041992002;院,-7.72450977097;全,-9.67041992002;转,-6.11507185853;毯,-7.18551327024;異,-8.57180763136;價,-8.2841255589;艺,-8.97727273946;国,-4.86639887529;封,-4.89973529556;稅,-7.03136259041;洋,-9.67041992002;不,-8.2841255589;向,-5.17061024969;鈕,-8.97727273946;弗,-6.33821540985;增,-9.67041992002;红,-6.67468764647;武,-6.57937746667;中,-3.51556182601;新,-6.14405939541;负,-6.78004816213;強,-8.06098200759;画,-8.06098200759;範,-8.06098200759;均,-7.36783482703;行,-4.49993592499;罗,-8.06098200759;远,-7.03136259041;污,-6.05950200738;无,-7.72450977097;团,-7.72450977097;畫,-8.06098200759;关,-6.6258974823;银,-5.79921890912;觸,-6.37458305402;联,-8.57180763136;一,-3.26353993395;劃,-6.89783119778;計,-7.36783482703;養,-7.10547056256;同,-8.97727273946;記,-9.67041992002;際,-6.72598094086;鸭,-7.72450977097;產,-5.21607262377;记,-9.67041992002;断,-7.27252464723;梯,-5.51153683666;洲,-7.59097837834;夺,-8.2841255589;開,-6.37458305402;杆,-8.06098200759;築,-5.7385942873;藍,-7.8786604508;近,-8.06098200759;拓,-9.67041992002;塔,-6.72598094086;工,-6.17391235856;四,-6.72598094086;党,-8.2841255589;藝,-8.97727273946;屜,-7.72450977097;信,-8.2841255589;奪,-8.2841255589;屬,-7.36783482703;对,-5.66308673479;電,-6.5349257041;企,-7.27252464723;预,-6.96236971892;來,-9.67041992002;下,-6.412323382;尖,-8.06098200759;和,-8.57180763136;源,-5.11654302842;轮,-8.57180763136;樣,-9.67041992002;诉,-8.2841255589;动,-4.1174603351;師,-7.72450977097;集,-7.8786604508;鎮,-8.57180763136;稳,-8.97727273946;架,-9.67041992002;主,-6.412323382;雀,-8.57180763136;摇,-7.72450977097;等,-5.5760753578;高,-4.27679237367;齡,-6.57937746667;巢,-8.97727273946;入,-7.10547056256;自,-4.58282358479;擬,-6.96236971892;聯,-8.57180763136;鴨,-7.72450977097;桿,-8.06098200759;現,-6.45154409516;开,-6.37458305402;墅,-8.57180763136;处,-7.03136259041;文,-8.57180763136;銀,-5.79921890912;例,-7.03136259041;逊,-6.33821540985;規,-1.89388489184;税,-7.03136259041;斗,-9.67041992002;通,-7.18551327024;攜,-5.30097206756;传,-6.45154409516;带,-4.59524610479;助,-7.8786604508;播,-8.97727273946;地,-6.37458305402;喷,-8.2841255589;帶,-4.59524610479;點,-6.96236971892;层,-3.8562893882;装,-7.59097837834;珠,-7.36783482703;拉,-8.2841255589;界,-4.94303210131;量,-4.8183896561;绑,-7.72450977097;寓,-8.97727273946;裕,-9.67041992002;站,-5.7385942873;存,-7.59097837834;蓝,-7.8786604508;營,-5.5760753578;你,-7.18551327024;口,-4.53462148297;詩,-8.06098200759;殿,-7.10547056256;學,-6.23643271554;遺,-9.67041992002;壁,-7.03136259041;季,-6.78004816213;授,-8.06098200759;國,-4.86639887529;對,-5.66308673479;张,-6.83720657597;意,-9.67041992002;耕,-8.97727273946;標,-7.18551327024;官,-5.98154046591;约,-5.77859962191;利,-5.79921890912;肪,-8.57180763136;證,-7.8786604508;激,-9.67041992002;规,-1.89388489184;镇,-8.57180763136;细,-4.80288546957;郊,-9.67041992002;委,-8.57180763136;变,-9.67041992002;關,-6.6258974823;正,-3.75152606575;健,-9.67041992002;穩,-8.97727273946;飽,-8.57180763136;長,-4.9882886929;特,-5.23960312118;司,-9.67041992002;轻,-9.67041992002;西,-6.49236608968;
+M,c:一,-2.10340461182;言,-4.7803811763;上,-5.04419576735;同,-2.51570364935;甚,-6.39952790286;接,-3.95612098398;地,-7.22272821167;然,-4.62003852623;方,-1.48257809284;看,-7.27988662551;所,-2.6508850298;过,-6.07004870173;對,-5.82264052842;而,-4.06572779052;话,-4.48547885588;句,-4.48547885588;此,-2.2032433023;可,-4.34165884644;恰,-5.26106970565;至,-4.23816923871;其,-6.24189895866;对,-5.82264052842;如,-4.37652767209;者,-3.66105101513;的,-3.89649386848;來,-4.4363461673;有,-6.39952790286;下,-3.71118277284;不,-3.74662952183;果,-3.47191779983;加,-6.97760575364;說,-6.6165924081;是,-3.87477534453;就,-4.83498531034;论,-3.78516318584;之,-4.09694280987;前,-9.41995278901;体,-4.5916390517;體,-4.5916390517;論,-3.78516318584;過,-6.07004870173;因,-3.6705598031;来,-4.4363461673;話,-4.48547885588;说,-6.6165924081;起,-8.32134050034;相,-5.26106970565;
+M,d:一,-1.38016742729;怪,-7.84883617966;内,-8.13651825212;匆,-5.53382856667;负,-6.51055103773;計,-6.72960460379;見,-5.4797613454;而,-8.13651825212;規,-6.49429051686;明,-7.25412907192;得,-2.92748757639;外,-9.23513054078;記,-7.40254907704;際,-2.16313281841;会,-6.13278853217;條,-5.48562646485;股,-9.92827772134;由,-3.71968769525;怀,-8.54198336022;带,-10.6214249019;窩,-6.37292965985;挨,-9.01198698947;身,-7.22022752024;个,-4.85937351912;骨,-7.01050698926;本,-3.10553581669;地,-5.27909064994;悵,-9.23513054078;头,-5.54002053692;冷,-9.92827772134;制,-10.6214249019;容,-5.49152618698;悻,-7.1556889991;夺,-9.01198698947;個,-4.85937351912;勁,-5.14496134997;時,-3.62382891892;仅,-3.93931630445;际,-2.16313281841;过,-4.97245066374;陆,-6.88375528362;奈,-6.02630505177;塊,-4.41686713933;續,-6.88375528362;方,-7.40254907704;面,-4.53011501983;昏,-8.54198336022;忙,-8.67551475285;遥,-9.92827772134;距,-6.51055103773;睜,-5.55252069968;跟,-5.92094453611;脚,-10.6214249019;口,-7.18743769742;形,-5.89403708319;顧,-7.28922039173;早,-8.42420032457;奪,-9.01198698947;续,-6.88375528362;转,-6.750223891;可,-3.89279628882;确,-7.53038244854;深,-7.22022752024;至,-4.33356634174;懷,-8.54198336022;其,-6.14408808743;陸,-6.88375528362;能,-4.0547524721;顾,-7.28922039173;老,-7.03790596345;见,-5.4797613454;會,-6.13278853217;怅,-9.23513054078;的,-7.53038244854;标,-9.01198698947;來,-1.94705703612;三,-9.52281261324;下,-5.61078960781;或,-5.01930608102;不,-2.67941809341;二,-6.59607321117;意,-5.82563435631;马,-8.54198336022;標,-9.01198698947;準,-10.6214249019;则,-4.93106544758;僅,-3.93931630445;定,-6.0675480103;溜,-6.3173598087;生,-7.78821155785;实,-9.52281261324;次,-4.51440201416;負,-6.51055103773;欣,-9.01198698947;多,-5.01930608102;踏,-5.62421262814;大,-10.6214249019;天,-6.37292965985;窝,-6.37292965985;頭,-5.54002053692;馬,-8.54198336022;就,-6.33096546075;记,-7.40254907704;劲,-5.14496134997;真,-7.98236757229;根,-5.73862297932;確,-7.53038244854;点,-4.66558753244;睁,-5.55252069968;计,-6.72960460379;幅,-3.8809055423;规,-6.49429051686;則,-4.93106544758;准,-10.6214249019;轉,-6.750223891;門,-9.01198698947;体,-5.20088990263;體,-5.20088990263;块,-4.41686713933;遙,-9.92827772134;過,-4.97245066374;點,-4.66558753244;条,-5.48562646485;狠,-8.13651825212;正,-8.42420032457;来,-1.94705703612;古,-9.01198698947;內,-8.13651825212;實,-9.52281261324;门,-9.01198698947;自,-6.37292965985;道,-7.25412907192;帶,-10.6214249019;腳,-10.6214249019;巴,-6.02630505177;时,-3.62382891892;
+M,e:家,0.0;
+M,f:内,-4.81633530473;下,-3.81536148562;上,-3.65028173527;對,-5.05117489581;後,-3.67969562047;后,-3.67969562047;間,-6.96809750799;北,-0.854857903954;脚,-3.94280643219;东,-4.14671862158;中,-4.37284280103;週,-5.63309644126;边,-7.88438823986;邊,-7.88438823986;前,-4.74889402393;当,-5.86948521932;南,-1.16356513023;內,-4.81633530473;周,-5.63309644126;東,-4.14671862158;腳,-3.94280643219;间,-6.96809750799;當,-5.86948521932;对,-5.05117489581;西,-2.20421563085;
+M,in:腹,-0.69314718056;大,-0.69314718056;
+M,i:耀,-9.49052051153;涉,-9.63712398572;谈,-7.72175056052;伊,-12.5815629649;預,-10.1836676921;洞,-8.91800131876;骧,-11.8884157843;般,-8.00685198638;河,-8.03826818262;临,-6.92557115407;吸,-10.3843383876;场,-8.89268351077;线,-10.5021214232;談,-7.72175056052;反,-6.67892963149;姑,-12.5815629649;織,-9.2142671349;遠,-7.13914525436;知,-5.50237857028;除,-8.07070345837;緩,-9.08505540342;胫,-9.1475757604;扬,-6.5976266842;歲,-9.58583069133;愁,-9.40350913454;覆,-6.71793178929;缕,-9.18036558322;应,-6.46346576685;枚,-9.2142671349;謝,-8.18711381021;崩,-7.51896793186;是,-6.71226605175;讲,-12.5815629649;運,-7.52531715954;磐,-10.1836676921;录,-10.9721250525;绔,-10.0166136074;教,-8.55621127415;叢,-10.7898034957;姦,-9.08505540342;括,-11.8884157843;滴,-10.6356528158;须,-8.68974266678;孽,-10.0966563151;广,-7.26835698584;沉,-7.72953270097;上,-5.66981566463;后,-6.72936048511;碑,-10.1836676921;餐,-9.40350913454;經,-6.4503364754;攘,-8.1389117084;辟,-8.34745646029;閣,-11.8884157843;岩,-11.8884157843;憫,-10.5021214232;枯,-9.0262149034;离,-6.67892963149;鬼,-7.10929229121;尾,-9.05520244027;胁,-10.7898034957;凋,-11.1952686038;壑,-11.1952686038;罔,-8.57422977965;聖,-10.0966563151;虚,-7.04422869787;濟,-7.388606114;跳,-8.47068910071;号,-8.39190822286;畸,-11.8884157843;姻,-10.9721250525;忿,-10.9721250525;态,-8.08175329456;节,-8.97064505224;爍,-9.74834962083;厌,-8.10422615041;咎,-10.0966563151;紓,-10.5021214232;媒,-9.28572609888;褛,-11.8884157843;伟,-11.1952686038;熠,-9.40350913454;锣,-8.01721477342;犢,-11.4829506762;术,-9.80897424265;稽,-8.91800131876;拂,-12.5815629649;克,-9.94250563527;前,-6.62572559542;坏,-12.5815629649;塑,-10.5021214232;胖,-10.5021214232;賞,-10.0966563151;几,-9.1475757604;勢,-6.27894398914;巨,-8.18711381021;腫,-10.5021214232;卷,-8.71036195398;齿,-8.73141536318;脂,-8.82036284919;丈,-9.80897424265;尔,-7.9763927789;嚣,-8.73141536318;符,-9.32346642686;披,-9.18036558322;蜮,-11.1952686038;禽,-8.2508296246;所,-4.53213590778;摄,-10.9721250525;浊,-10.3843383876;凍,-10.2789778719;灌,-9.87351276378;櫛,-9.18036558322;兢,-7.23922871292;学,-7.64708903176;翩,-9.44606874896;丽,-7.7940712221;臭,-9.63712398572;恬,-10.9721250525;持,-7.46356915247;标,-10.2789778719;予,-9.80897424265;越,-8.71036195398;笑,-6.70102997849;妒,-10.6356528158;耗,-11.8884157843;訛,-10.2789778719;匡,-11.4829506762;锥,-10.0966563151;弩,-8.10422615041;誰,-9.24935845471;貴,-7.77754192015;簿,-9.80897424265;懂,-9.63712398572;轉,-6.67076632085;免,-10.6356528158;秒,-10.0966563151;補,-8.2248541382;江,-7.23445543417;连,-7.10092404154;略,-8.8438933466;實,-6.84177005271;黨,-9.40350913454;乳,-10.1836676921;偷,-7.73737587843;相,-5.09382920345;痺,-8.99804402643;好,-6.70944517541;王,-8.30489684587;疏,-9.0262149034;务,-7.41677699096;垣,-11.4829506762;斯,-8.59257891832;贴,-10.0966563151;制,-6.96116209917;霸,-9.58583069133;鐺,-9.80897424265;綿,-9.1475757604;鸾,-11.1952686038;友,-10.7898034957;毛,-7.57761665894;乞,-9.69119120699;占,-9.05520244027;婦,-9.63712398572;諱,-9.11582706209;囹,-9.49052051153;寻,-7.23445543417;壽,-8.86799089818;會,-7.74528105793;搅,-9.36268714002;薄,-7.96644244805;辈,-10.6356528158;缓,-9.08505540342;抖,-8.53851169705;講,-12.5815629649;榜,-9.87351276378;负,-8.04896347173;圣,-10.0966563151;大,-4.78386092937;窦,-10.7898034957;鸩,-9.80897424265;羨,-12.5815629649;支,-7.65430927973;揀,-9.69119120699;旄,-11.1952686038;义,-7.08439473959;鍋,-9.53704052716;泊,-12.5815629649;遍,-8.05977438784;問,-7.47561749099;盎,-10.1836676921;当,-6.09845561343;叠,-9.80897424265;荫,-9.94250563527;驢,-10.3843383876;話,-6.64931777744;佳,-8.40717569499;具,-8.09292659515;顽,-8.8438933466;蜂,-11.8884157843;箕,-11.4829506762;依,-7.14784096133;那,-10.9721250525;厥,-10.5021214232;撫,-12.5815629649;訴,-11.1952686038;逸,-7.90873413042;羽,-9.28572609888;帼,-9.36268714002;夾,-8.91800131876;杂,-8.33306772284;菅,-9.80897424265;仇,-7.89943173776;浆,-10.6356528158;案,-8.30489684587;壓,-9.05520244027;鳥,-8.91800131876;鑠,-11.8884157843;面,-6.00509339584;继,-8.42267988153;慮,-9.18036558322;雷,-7.85417514617;當,-6.09845561343;峻,-7.89943173776;忽,-9.05520244027;繼,-8.42267988153;變,-8.10422615041;徒,-10.2789778719;輝,-7.45166424996;溜,-12.5815629649;連,-7.10092404154;天,-4.91909514969;農,-11.8884157843;缽,-11.8884157843;淆,-9.63712398572;習,-11.4829506762;機,-6.48348868272;勤,-11.1952686038;左,-10.6356528158;葫,-10.1836676921;曬,-9.80897424265;良,-8.26407485135;泰,-7.89943173776;陷,-8.02768607329;兹,-11.4829506762;综,-7.59795634318;谆,-10.5021214232;訊,-8.8438933466;窕,-10.2789778719;搖,-7.29835923615;戚,-9.58583069133;串,-11.8884157843;吶,-9.32346642686;点,-7.68372316494;綻,-11.8884157843;刺,-10.5021214232;時,-6.24650871339;过,-6.85146318191;結,-6.56296975039;姓,-9.2142671349;答,-9.63712398572;作,-5.69503132236;婪,-11.4829506762;華,-7.61174966531;執,-8.08175329456;瑶,-10.9721250525;價,-7.01321846113;牺,-9.28572609888;寿,-8.86799089818;栉,-9.18036558322;抚,-12.5815629649;丝,-6.57029579048;澜,-8.73141536318;別,-7.71402851443;昭,-8.59257891832;振,-8.12721566863;躲,-9.94250563527;眷,-10.2789778719;降,-11.4829506762;协,-7.96644244805;屑,-8.66953995946;驕,-9.94250563527;臘,-10.6356528158;远,-7.13914525436;团,-7.98644311475;古,-7.39417715905;峦,-9.80897424265;药,-10.7898034957;鹿,-9.36268714002;鹽,-9.69119120699;翼,-6.56540580519;极,-7.31370480582;殉,-10.7898034957;計,-6.37498703816;同,-5.87592387003;战,-6.87113594751;愚,-11.8884157843;劣,-11.4829506762;冥,-10.0166136074;断,-6.97944414401;萬,-5.57034897754;悯,-10.5021214232;丰,-9.18036558322;綽,-8.03826818262;诉,-11.1952686038;雋,-11.4829506762;楊,-10.0966563151;像,-11.4829506762;忑,-7.99659548622;駕,-8.47068910071;棟,-9.94250563527;燥,-10.0166136074;糧,-9.40350913454;篩,-11.4829506762;奪,-7.41677699096;据,-9.74834962083;俱,-6.57767589778;叹,-8.2508296246;黻,-12.5815629649;來,-5.99263648735;瘋,-10.9721250525;和,-8.30489684587;折,-7.50638914965;丛,-10.7898034957;贝,-12.5815629649;鬩,-11.4829506762;宾,-9.80897424265;證,-9.69119120699;陋,-9.2142671349;槊,-12.5815629649;偏,-8.45442857984;緒,-10.5021214232;奕,-9.24935845471;賜,-10.1836676921;诞,-9.05520244027;因,-8.48721840266;闢,-8.34745646029;煥,-8.30489684587;虫,-9.74834962083;蕭,-10.7898034957;聯,-9.32346642686;揮,-9.58583069133;狸,-10.3843383876;幻,-8.99804402643;顿,-7.99659548622;掃,-8.27749787168;悅,-7.98644311475;芙,-10.1836676921;辛,-7.96644244805;貝,-12.5815629649;樞,-12.5815629649;琢,-12.5815629649;播,-12.5815629649;蔬,-12.5815629649;嘶,-8.39190822286;犹,-7.82797277378;债,-11.8884157843;杀,-7.96644244805;埋,-8.42267988153;减,-8.29110352374;黑,-7.87203276357;旗,-7.20166561135;拙,-11.1952686038;聚,-9.58583069133;詞,-8.55621127415;盡,-6.19974694748;坠,-10.5021214232;敬,-9.49052051153;险,-8.45442857984;嗷,-9.53704052716;獸,-8.7529215684;姿,-8.01721477342;蒂,-7.91812387077;了,-6.4459980738;看,-8.86799089818;徐,-11.8884157843;馔,-12.5815629649;暖,-9.18036558322;掘,-10.7898034957;悚,-8.05977438784;倥,-9.69119120699;约,-7.36120713981;末,-8.52111995434;搭,-11.4829506762;辰,-9.58583069133;男,-8.79737333097;釋,-7.94683397666;敗,-6.7496804876;潛,-11.8884157843;铢,-10.3843383876;凤,-8.94397680516;穩,-9.28572609888;鯨,-11.8884157843;乱,-6.38920047541;長,-6.3790274477;彻,-8.66953995946;雾,-10.6356528158;沃,-12.5815629649;脆,-10.1836676921;纏,-9.69119120699;逐,-8.07070345837;阔,-7.69121383666;焦,-12.5815629649;溯,-10.9721250525;茲,-11.4829506762;尸,-8.50402552098;强,-6.85146318191;见,-5.83868232909;桀,-11.4829506762;金,-7.37207681204;鹤,-9.05520244027;周,-7.24402488519;语,-8.48721840266;浮,-9.63712398572;僻,-9.36268714002;验,-10.0166136074;隔,-9.80897424265;弥,-9.69119120699;瞪,-7.13914525436;紹,-11.4829506762;岸,-8.82036284919;毂,-12.5815629649;轅,-9.49052051153;滄,-8.8438933466;魍,-10.2789778719;盔,-10.3843383876;寢,-9.58583069133;衫,-12.5815629649;更,-7.37755627781;婷,-9.63712398572;狼,-7.94683397666;梁,-7.73737587843;窍,-8.68974266678;嬌,-9.53704052716;划,-8.36205525971;芝,-10.9721250525;麥,-10.1836676921;缤,-8.05977438784;用,-7.6987610423;謬,-10.1836676921;悱,-10.5021214232;吾,-10.9721250525;裁,-10.7898034957;跃,-8.26407485135;仅,-8.73141536318;蓉,-12.5815629649;效,-9.58583069133;始,-7.82797277378;雕,-8.45442857984;荜,-11.8884157843;頑,-8.8438933466;緣,-8.23775754303;婢,-9.94250563527;击,-9.18036558322;清,-7.54461036247;辄,-9.94250563527;指,-7.1970679021;肆,-12.5815629649;薈,-10.3843383876;完,-9.11582706209;醐,-10.1836676921;脛,-9.1475757604;撞,-9.40350913454;群,-7.5001585999;嶸,-11.1952686038;赃,-8.94397680516;久,-7.1970679021;葉,-8.59257891832;奋,-7.26344297104;瑩,-9.32346642686;门,-6.8547152173;雪,-7.53813784797;詭,-8.45442857984;软,-10.2789778719;聱,-10.9721250525;柴,-9.63712398572;屹,-10.1836676921;养,-7.98644311475;言,-5.10452449257;谄,-11.8884157843;枉,-8.55621127415;禍,-7.72953270097;頌,-8.79737333097;鼎,-7.61174966531;皓,-9.74834962083;儒,-11.1952686038;膝,-10.1836676921;怜,-12.5815629649;稠,-9.63712398572;榭,-12.5815629649;羹,-10.9721250525;常,-7.93717206575;值,-8.57422977965;证,-9.69119120699;姍,-9.05520244027;发,-6.6519738215;乘,-8.15074616604;招,-8.09292659515;绣,-9.69119120699;奢,-8.61127105133;層,-10.0966563151;烧,-8.50402552098;矩,-12.5815629649;器,-11.8884157843;諫,-9.44606874896;潮,-8.89268351077;扰,-10.7898034957;函,-12.5815629649;灼,-9.74834962083;有,-4.82152228401;程,-9.24935845471;冒,-8.7529215684;窠,-11.1952686038;鸣,-8.52111995434;倚,-12.5815629649;家,-5.95617059688;庸,-8.59257891832;乃,-11.4829506762;車,-7.56428312807;泄,-8.18711381021;蝉,-9.80897424265;屏,-10.3843383876;卑,-9.32346642686;狐,-8.94397680516;燒,-8.50402552098;付,-9.94250563527;胜,-6.80391064166;另,-12.5815629649;雨,-6.6309204123;闪,-8.97064505224;懲,-9.24935845471;绸,-7.84536451649;兽,-8.7529215684;鑿,-8.86799089818;謀,-6.84822168799;碍,-9.44606874896;錐,-10.0966563151;倒,-6.85797786293;肝,-9.28572609888;眨,-9.24935845471;琪,-11.8884157843;涯,-8.77490047512;抱,-8.97064505224;纹,-12.5815629649;尺,-9.44606874896;促,-9.28572609888;換,-7.04422869787;虞,-9.36268714002;路,-7.59113037811;英,-8.99804402643;整,-8.64973733216;究,-9.40350913454;都,-10.6356528158;百,-5.9274104447;讀,-12.5815629649;袂,-11.8884157843;砍,-11.8884157843;丙,-11.8884157843;嘩,-9.58583069133;亮,-9.80897424265;育,-10.3843383876;縹,-9.05520244027;难,-5.96952193005;毀,-11.4829506762;拆,-9.63712398572;擊,-9.18036558322;绎,-7.85417514617;剑,-8.73141536318;靓,-11.8884157843;論,-7.49396662965;还,-7.14348365596;飢,-8.82036284919;照,-8.50402552098;艱,-9.63712398572;競,-11.8884157843;幹,-7.77754192015;卻,-8.61127105133;偽,-10.3843383876;长,-6.3790274477;谀,-9.63712398572;暇,-9.32346642686;京,-12.5815629649;疑,-8.55621127415;吐,-7.21092493676;園,-10.3843383876;猪,-10.9721250525;纷,-7.11773115986;蛇,-7.66158203906;臉,-9.32346642686;忍,-8.23775754303;赖,-10.0166136074;屠,-10.6356528158;形,-6.81324196909;驤,-11.8884157843;书,-7.83663083652;俭,-8.48721840266;黷,-9.74834962083;發,-6.6519738215;勿,-9.1475757604;洁,-11.1952686038;铭,-8.53851169705;莊,-9.11582706209;垒,-12.5815629649;舟,-8.66953995946;鬥,-8.34745646029;躬,-8.17484371762;縷,-9.18036558322;嚼,-9.1475757604;屋,-9.24935845471;道,-6.7585170694;单,-8.97064505224;飞,-6.77944458951;裘,-11.8884157843;诚,-7.57761665894;絡,-9.05520244027;煩,-8.52111995434;部,-8.89268351077;豫,-8.03826818262;只,-9.63712398572;聳,-8.1389117084;呻,-10.5021214232;盼,-10.0966563151;脈,-8.26407485135;舊,-9.08505540342;素,-9.69119120699;骥,-10.9721250525;夸,-9.28572609888;逾,-8.89268351077;摆,-9.58583069133;慈,-8.59257891832;動,-5.46354676042;曝,-12.5815629649;聞,-7.04029941973;鵠,-11.4829506762;秣,-10.1836676921;童,-9.40350913454;孤,-8.48721840266;全,-6.57029579048;误,-11.4829506762;数,-8.43842823849;至,-7.12197745074;祸,-7.72953270097;闻,-7.04029941973;空,-6.81012184176;国,-7.1970679021;灾,-7.66890807915;亂,-6.38920047541;紋,-12.5815629649;後,-6.72936048511;笏,-12.5815629649;众,-6.82899032606;果,-8.79737333097;綠,-9.0262149034;红,-7.64708903176;霧,-10.6356528158;倩,-10.9721250525;渭,-10.0166136074;蹈,-8.11565484623;画,-7.74528105793;猿,-10.0166136074;傾,-9.40350913454;懈,-9.1475757604;魏,-9.49052051153;鑑,-8.8438933466;损,-11.4829506762;廢,-9.44606874896;赫,-8.40717569499;鋪,-10.9721250525;森,-8.68974266678;葱,-8.86799089818;旰,-9.69119120699;腳,-7.24402488519;曲,-7.82797277378;援,-11.1952686038;齷,-11.1952686038;塹,-10.9721250525;陽,-8.19953633021;卿,-10.3843383876;一,-4.04319553824;興,-7.22497669021;脊,-11.8884157843;瞑,-8.82036284919;途,-7.2536867961;挞,-9.94250563527;索,-9.08505540342;咧,-9.18036558322;眦,-10.5021214232;溫,-10.7898034957;谬,-10.1836676921;夺,-7.41677699096;迁,-11.8884157843;觅,-9.58583069133;籌,-7.84536451649;泗,-12.5815629649;惟,-8.99804402643;坦,-11.1952686038;敲,-9.18036558322;对,-8.45442857984;電,-8.86799089818;漁,-10.5021214232;膊,-10.7898034957;納,-8.77490047512;岌,-8.39190822286;隐,-7.59113037811;閒,-8.43842823849;焕,-8.30489684587;谗,-11.8884157843;謙,-10.6356528158;綢,-7.84536451649;責,-10.9721250525;朱,-10.9721250525;簷,-9.63712398572;棄,-8.61127105133;草,-7.03638552041;拈,-10.1836676921;顏,-7.05611002575;坑,-9.53704052716;盐,-9.69119120699;汗,-10.3843383876;敝,-11.8884157843;罡,-12.5815629649;巢,-10.5021214232;祥,-8.86799089818;壤,-8.66953995946;运,-7.52531715954;曰,-11.8884157843;艳,-9.1475757604;惴,-8.61127105133;偿,-8.66953995946;現,-10.6356528158;殃,-9.40350913454;梅,-9.05520244027;文,-6.83855977708;蘆,-11.1952686038;福,-8.77490047512;騎,-11.4829506762;皑,-10.0166136074;吒,-9.0262149034;鏘,-9.80897424265;攜,-8.94397680516;缠,-9.69119120699;宣,-10.2789778719;喧,-8.91800131876;瘦,-9.18036558322;助,-7.84536451649;贬,-9.80897424265;帶,-8.03826818262;瞻,-8.89268351077;仁,-7.89943173776;求,-6.63876358976;装,-7.98644311475;穎,-7.60482922247;僕,-8.16272235709;乖,-11.8884157843;識,-7.37207681204;杰,-10.7898034957;巷,-8.91800131876;韻,-10.6356528158;倾,-9.40350913454;凿,-8.86799089818;咒,-9.58583069133;準,-12.5815629649;殘,-7.57761665894;鸡,-7.87203276357;利,-6.70663223403;激,-7.63992054228;惊,-6.06389169197;屍,-8.50402552098;卓,-8.6303192463;偕,-10.3843383876;他,-11.1952686038;苞,-10.0166136074;繡,-9.69119120699;忠,-8.66953995946;物,-7.91812387077;擲,-9.53704052716;驹,-11.1952686038;命,-7.82797277378;退,-7.69121383666;瞅,-12.5815629649;專,-9.40350913454;舌,-9.74834962083;沓,-8.8438933466;且,-8.89268351077;宝,-7.9763927789;废,-9.44606874896;方,-6.47454007714;铃,-10.0966563151;賓,-9.80897424265;狗,-7.82797277378;员,-9.36268714002;坚,-9.58583069133;统,-8.91800131876;查,-10.3843383876;鳳,-8.94397680516;念,-7.37755627781;藹,-9.40350913454;摸,-7.41677699096;妆,-8.57422977965;昏,-8.01721477342;讒,-11.8884157843;五,-6.60267719999;列,-7.66158203906;错,-8.2508296246;鸟,-8.91800131876;探,-9.08505540342;單,-8.97064505224;户,-7.10092404154;改,-8.79737333097;蒸,-8.99804402643;允,-11.4829506762;配,-11.1952686038;聋,-8.91800131876;毒,-9.24935845471;何,-7.19249123507;滔,-7.89021508266;留,-8.86799089818;州,-11.1952686038;来,-5.99263648735;触,-6.33158772263;浩,-7.24884417162;迪,-9.63712398572;独,-6.55328444466;饱,-8.97064505224;维,-8.8438933466;艷,-9.1475757604;懶,-10.2789778719;譽,-10.0966563151;儀,-10.3843383876;霄,-9.18036558322;順,-8.45442857984;粉,-10.0966563151;輔,-8.26407485135;甘,-7.04422869787;龟,-12.5815629649;纵,-8.7529215684;掷,-9.53704052716;阴,-8.97064505224;郁,-8.12721566863;寇,-11.8884157843;苍,-8.71036195398;龌,-11.1952686038;潔,-11.1952686038;孜,-9.74834962083;惡,-6.96479186722;恶,-6.96479186722;數,-8.43842823849;智,-7.96644244805;领,-8.27749787168;床,-8.94397680516;树,-7.88108259909;辔,-11.8884157843;北,-8.1389117084;皚,-10.0166136074;弟,-10.6356528158;抢,-8.94397680516;梦,-7.9565901516;涨,-8.02768607329;爭,-7.9565901516;樽,-11.8884157843;漿,-10.6356528158;啃,-11.8884157843;狂,-8.97064505224;际,-9.63712398572;遷,-11.8884157843;腋,-10.0966563151;擎,-12.5815629649;祛,-10.0166136074;鳞,-8.73141536318;散,-7.90873413042;歧,-9.53704052716;八,-5.62311457159;仪,-10.3843383876;称,-8.33306772284;惶,-7.35045434803;使,-8.30489684587;刀,-7.13052451132;各,-9.18036558322;师,-8.03826818262;而,-4.04221696883;涕,-8.57422977965;闷,-8.64973733216;骛,-9.87351276378;甚,-7.92760261473;妝,-8.57422977965;洪,-10.9721250525;箱,-9.2142671349;騰,-7.55112504349;纳,-8.77490047512;尴,-11.1952686038;茶,-9.94250563527;壇,-11.8884157843;筆,-8.19953633021;臍,-11.8884157843;李,-9.44606874896;卖,-8.45442857984;日,-6.19468364552;棧,-10.2789778719;凭,-9.87351276378;捶,-11.8884157843;蟹,-10.6356528158;銀,-8.07070345837;咄,-7.96644244805;肌,-9.40350913454;羞,-8.43842823849;蔥,-8.86799089818;輩,-10.6356528158;达,-7.88108259909;十,-8.00685198638;终,-7.81087834042;緊,-11.4829506762;取,-7.35581629117;嗚,-9.44606874896;籟,-9.05520244027;锤,-8.99804402643;六,-7.11773115986;平,-6.47454007714;職,-8.48721840266;書,-7.83663083652;重,-6.03048262984;适,-8.40717569499;尊,-8.17484371762;隙,-9.24935845471;挠,-9.11582706209;疯,-10.9721250525;举,-6.82899032606;勁,-10.7898034957;埃,-7.90873413042;廉,-8.73141536318;慌,-6.62313827186;藏,-9.05520244027;試,-9.28572609888;叫,-9.74834962083;豪,-9.0262149034;郭,-10.0966563151;闯,-9.36268714002;扶,-9.40350913454;读,-12.5815629649;楼,-8.03826818262;琅,-8.40717569499;善,-7.11350282375;首,-7.48781276408;漓,-8.05977438784;掠,-10.3843383876;营,-8.3768703455;斤,-8.94397680516;猫,-10.9721250525;冬,-10.6356528158;稱,-8.33306772284;宰,-9.74834962083;鶴,-9.05520244027;烂,-7.62573590729;奇,-7.55768244404;鹉,-10.5021214232;糊,-7.94683397666;体,-7.49396662965;棒,-10.7898034957;豕,-11.4829506762;筛,-11.4829506762;點,-7.68372316494;藤,-9.40350913454;卫,-10.9721250525;質,-9.2142671349;目,-5.67280818557;驱,-8.43842823849;練,-8.1389117084;虹,-9.44606874896;擺,-9.58583069133;滾,-8.73141536318;鴆,-9.80897424265;須,-8.68974266678;輒,-9.94250563527;錯,-8.2508296246;写,-11.4829506762;岛,-11.4829506762;犯,-8.79737333097;綱,-9.36268714002;耸,-8.1389117084;治,-7.94683397666;隴,-11.1952686038;蓋,-7.26344297104;慎,-8.79737333097;跑,-11.1952686038;试,-9.28572609888;盗,-9.05520244027;博,-9.24935845471;竟,-10.6356528158;赦,-9.36268714002;表,-8.79737333097;煮,-11.1952686038;己,-7.64708903176;寵,-8.57422977965;穴,-8.6303192463;捺,-8.04896347173;追,-8.55621127415;咀,-12.5815629649;垂,-8.64973733216;服,-8.16272235709;蚌,-9.80897424265;戏,-9.80897424265;嘗,-8.86799089818;鄙,-11.1952686038;枢,-12.5815629649;丧,-7.59795634318;莺,-11.8884157843;奉,-8.50402552098;術,-9.80897424265;闖,-9.36268714002;煙,-7.76937860951;黜,-9.24935845471;恣,-10.5021214232;钧,-8.52111995434;湧,-9.28572609888;裨,-9.24935845471;副,-7.33453889273;时,-6.24650871339;腹,-7.6987610423;载,-7.69121383666;享,-9.74834962083;销,-11.1952686038;錄,-10.9721250525;将,-7.43989940838;備,-8.34745646029;挤,-9.32346642686;侧,-9.58583069133;横,-7.08030475434;环,-12.5815629649;粱,-10.7898034957;枷,-10.9721250525;脸,-9.32346642686;似,-7.78577241929;品,-10.0166136074;獄,-11.8884157843;绝,-7.27825805683;塞,-9.08505540342;拥,-7.80243947177;园,-10.3843383876;鼓,-7.00561386174;可,-4.47293969653;份,-11.4829506762;顫,-10.9721250525;門,-6.8547152173;妈,-8.94397680516;骊,-11.8884157843;民,-6.58262640294;互,-11.8884157843;鴛,-11.8884157843;帝,-11.1952686038;鬟,-12.5815629649;酱,-9.69119120699;暢,-9.74834962083;榨,-11.8884157843;活,-7.54461036247;竊,-8.40717569499;荏,-10.0966563151;評,-10.0966563151;比,-7.51265876267;釘,-7.71402851443;壞,-12.5815629649;慣,-9.18036558322;賦,-11.1952686038;卯,-10.2789778719;山,-5.87714860992;女,-7.5001585999;懸,-8.94397680516;養,-7.98644311475;钗,-12.5815629649;映,-9.58583069133;攢,-11.8884157843;貧,-8.7529215684;听,-6.94677336172;炯,-8.31888308785;匮,-9.24935845471;場,-8.89268351077;舸,-11.8884157843;韁,-11.8884157843;勃,-6.77342047491;蛋,-10.0966563151;藍,-10.7898034957;近,-7.50638914965;靖,-11.8884157843;党,-9.40350913454;拣,-9.69119120699;车,-7.56428312807;闭,-10.0166136074;絲,-6.57029579048;任,-8.00685198638;省,-8.50402552098;還,-7.14348365596;怏,-10.6356528158;樓,-8.03826818262;咬,-8.47068910071;厮,-10.0966563151;稳,-9.28572609888;芸,-9.69119120699;貼,-10.0966563151;设,-7.07623142895;充,-9.28572609888;里,-6.6283196306;淒,-10.9721250525;絝,-10.0166136074;条,-7.78577241929;鑼,-8.01721477342;影,-6.85797786293;绰,-8.03826818262;驳,-11.8884157843;泼,-9.40350913454;帆,-8.05977438784;伐,-8.73141536318;瀚,-11.1952686038;肥,-8.77490047512;愤,-7.83663083652;株,-9.58583069133;刮,-9.94250563527;鰲,-9.1475757604;头,-5.16278208214;斷,-6.97944414401;抹,-8.33306772284;沽,-12.5815629649;贼,-8.47068910071;雁,-12.5815629649;着,-8.03826818262;參,-8.91800131876;僅,-8.73141536318;嫉,-9.53704052716;敌,-7.43989940838;扎,-8.6303192463;裕,-10.0966563151;做,-8.53851169705;蹦,-10.0166136074;哭,-8.07070345837;罰,-9.0262149034;籲,-7.39417715905;賽,-10.3843383876;守,-7.66158203906;朋,-8.99804402643;損,-11.4829506762;意,-5.73568308962;则,-8.66953995946;尝,-8.86799089818;綜,-7.59795634318;憤,-7.83663083652;货,-9.32346642686;縱,-8.7529215684;肺,-10.6356528158;千,-6.29370440472;细,-7.53813784797;磊,-8.47068910071;雖,-10.7898034957;牙,-6.72077674142;变,-8.10422615041;祟,-8.2508296246;蟠,-10.9721250525;捣,-10.0966563151;恥,-8.86799089818;狮,-11.4829506762;塵,-7.42250766567;轻,-6.47009562538;惺,-8.94397680516;西,-7.06010204702;禁,-8.61127105133;羅,-7.2062845572;儆,-8.97064505224;合,-6.72649104268;殍,-11.8884157843;憑,-9.87351276378;耐,-9.80897424265;撓,-9.11582706209;枕,-8.57422977965;嶙,-10.3843383876;缚,-12.5815629649;欢,-7.67628818645;未,-5.87837485165;箭,-8.43842823849;纯,-9.2142671349;熱,-8.31888308785;嘴,-7.75324922758;駁,-11.8884157843;必,-6.9684348585;勇,-7.96644244805;词,-8.55621127415;济,-7.388606114;恐,-7.61174966531;烛,-9.69119120699;盟,-11.1952686038;泣,-9.49052051153;腦,-7.69121383666;早,-8.99804402643;士,-8.79737333097;灰,-8.05977438784;獲,-8.34745646029;韵,-10.6356528158;諷,-10.3843383876;潺,-10.9721250525;庄,-9.11582706209;针,-7.93717206575;栋,-9.94250563527;谣,-10.1836676921;枪,-7.70636564169;厲,-8.31888308785;嚴,-9.36268714002;挽,-8.2508296246;則,-8.66953995946;乏,-9.49052051153;腑,-9.1475757604;插,-9.36268714002;令,-8.17484371762;执,-8.08175329456;填,-8.73141536318;共,-6.87445270014;味,-7.76128139928;直,-6.48573840245;拼,-9.69119120699;弄,-7.7940712221;率,-11.8884157843;逆,-7.54461036247;脐,-11.8884157843;宗,-8.18711381021;砖,-9.63712398572;军,-6.54130825361;猜,-11.1952686038;趣,-9.18036558322;亥,-12.5815629649;鄰,-8.48721840266;油,-8.50402552098;贸,-11.8884157843;为,-4.85402785441;抽,-9.24935845471;壁,-7.65430927973;哉,-10.1836676921;歌,-8.39190822286;扒,-10.3843383876;嵘,-11.1952686038;卜,-10.0166136074;滥,-8.34745646029;囵,-10.9721250525;请,-8.8438933466;臻,-9.87351276378;骂,-8.8438933466;径,-7.96644244805;漏,-9.80897424265;芒,-8.77490047512;初,-8.40717569499;土,-6.38308424839;璞,-10.5021214232;蠡,-11.1952686038;责,-10.9721250525;严,-9.36268714002;澤,-9.94250563527;茧,-10.5021214232;悦,-7.98644311475;冰,-9.24935845471;劲,-10.7898034957;人,-4.41933189941;秀,-9.44606874896;鹅,-10.6356528158;升,-8.89268351077;痈,-11.1952686038;益,-7.63280307451;住,-8.61127105133;處,-7.69121383666;柔,-8.02768607329;捧,-9.74834962083;摩,-11.8884157843;驭,-10.7898034957;齒,-8.73141536318;避,-8.43842823849;豹,-11.8884157843;擾,-10.7898034957;射,-10.9721250525;匆,-10.1836676921;伎,-10.1836676921;徙,-11.4829506762;力,-5.98033284616;級,-9.18036558322;钟,-8.68974266678;计,-6.37498703816;违,-10.9721250525;攪,-9.36268714002;到,-6.57767589778;鄲,-10.6356528158;丸,-9.2142671349;鯁,-10.7898034957;黃,-7.71402851443;請,-8.8438933466;鹘,-12.5815629649;停,-8.29110352374;非,-6.82899032606;駭,-8.47068910071;硬,-9.28572609888;置,-6.80391064166;迹,-8.1389117084;如,-4.82665269286;紅,-7.64708903176;历,-8.36205525971;眉,-6.592601548;喊,-7.76128139928;挑,-8.89268351077;易,-6.55811537193;頗,-11.1952686038;创,-10.6356528158;吟,-10.9721250525;瞞,-11.4829506762;败,-6.7496804876;微,-8.61127105133;冲,-7.39977941459;电,-8.86799089818;样,-9.40350913454;魁,-8.33306772284;遇,-10.3843383876;鼠,-8.12721566863;盈,-10.5021214232;釜,-8.66953995946;懒,-10.2789778719;擔,-11.8884157843;默,-7.39417715905;牛,-7.76128139928;歡,-7.67628818645;賤,-10.5021214232;饭,-8.91800131876;屯,-10.3843383876;危,-7.71402851443;陳,-6.77642799597;衷,-8.08175329456;淺,-9.36268714002;突,-7.64708903176;堂,-7.08030475434;分,-6.07877291897;残,-7.57761665894;吊,-7.86306409359;与,-7.49396662965;缘,-8.23775754303;欠,-10.0966563151;木,-7.40541323231;進,-8.39190822286;伸,-12.5815629649;心,-4.42361945778;采,-7.22027079918;牆,-8.48721840266;霍,-9.58583069133;湎,-9.87351276378;捐,-8.52111995434;给,-7.93717206575;泥,-8.8438933466;赤,-10.7898034957;寫,-11.4829506762;音,-9.32346642686;畴,-12.5815629649;決,-9.18036558322;能,-6.46346576685;颂,-8.79737333097;于,-5.87960259888;我,-7.10092404154;涤,-11.4829506762;砭,-9.74834962083;馬,-5.85652932272;累,-8.33306772284;爱,-10.1836676921;傲,-9.49052051153;政,-10.5021214232;驁,-9.32346642686;節,-8.97064505224;居,-7.51896793186;兇,-8.09292659515;瓊,-10.5021214232;衍,-9.74834962083;槌,-12.5815629649;赏,-10.0966563151;提,-7.72953270097;忘,-7.65430927973;凜,-8.03826818262;回,-7.00940893271;慧,-11.1952686038;苦,-6.60267719999;孫,-9.36268714002;呵,-8.94397680516;痴,-9.69119120699;風,-5.44190262892;聽,-6.94677336172;曾,-8.48721840266;异,-7.35581629117;皇,-8.09292659515;斑,-9.32346642686;麗,-7.7940712221;妙,-7.63992054228;功,-6.52712361862;漢,-9.69119120699;怨,-8.94397680516;挪,-11.8884157843;餮,-11.4829506762;炳,-11.4829506762;露,-7.2062845572;鈴,-10.0966563151;撻,-9.94250563527;願,-7.88108259909;魚,-8.33306772284;淡,-7.61174966531;叵,-9.08505540342;价,-7.01321846113;骄,-9.94250563527;焉,-8.99804402643;二,-6.75261734728;龙,-6.81951158211;君,-7.61174966531;缭,-7.98644311475;馮,-11.1952686038;由,-6.00928042219;论,-7.49396662965;朽,-12.5815629649;房,-8.17484371762;魅,-10.2789778719;陇,-11.1952686038;光,-6.4503364754;烈,-7.42827137039;珊,-12.5815629649;位,-10.0966563151;滌,-11.4829506762;拔,-7.99659548622;壘,-12.5815629649;雜,-8.33306772284;迢,-8.33306772284;步,-7.09262523873;菪,-12.5815629649;曼,-11.8884157843;市,-8.47068910071;炉,-9.63712398572;投,-7.04029941973;得,-5.98305393627;墙,-8.48721840266;原,-8.42267988153;財,-7.68372316494;肩,-9.40350913454;截,-7.2062845572;嘲,-9.40350913454;褸,-11.8884157843;跋,-8.18711381021;軍,-6.54130825361;蓑,-12.5815629649;晒,-9.80897424265;痛,-7.23445543417;婚,-9.69119120699;靜,-8.47068910071;泡,-9.24935845471;惩,-9.24935845471;巫,-9.63712398572;異,-7.35581629117;迷,-7.54461036247;裹,-10.5021214232;瀉,-9.49052051153;洋,-6.9980666561;弗,-10.7898034957;紫,-9.2142671349;墮,-11.4829506762;貶,-9.80897424265;根,-7.16102796561;攻,-8.26407485135;屁,-10.6356528158;驅,-8.43842823849;均,-8.91800131876;偉,-11.1952686038;燈,-7.82797277378;赋,-11.1952686038;乍,-8.71036195398;罗,-7.2062845572;韜,-11.8884157843;污,-7.9565901516;恩,-7.55768244404;臨,-6.92557115407;呱,-10.7898034957;关,-7.37207681204;創,-10.6356528158;虽,-10.7898034957;窃,-8.40717569499;圆,-9.05520244027;玉,-7.32928953684;编,-12.5815629649;際,-9.63712398572;喝,-8.99804402643;渠,-8.36205525971;誣,-12.5815629649;針,-7.93717206575;維,-8.8438933466;伶,-8.47068910071;施,-8.2508296246;開,-6.49025308281;終,-7.81087834042;介,-10.0166136074;盛,-8.8438933466;呜,-9.44606874896;烟,-7.76937860951;濡,-8.94397680516;习,-11.4829506762;籬,-9.18036558322;壯,-7.82797277378;癰,-11.1952686038;釵,-12.5815629649;预,-10.1836676921;貌,-8.39190822286;速,-8.07070345837;萧,-10.7898034957;縫,-9.87351276378;宮,-10.9721250525;蒼,-8.71036195398;狈,-8.66953995946;之,-4.03190258333;高,-5.94038079515;铜,-12.5815629649;摧,-11.8884157843;自,-4.91768570618;顯,-8.64973733216;兵,-6.42670487087;違,-10.9721250525;开,-6.49025308281;处,-7.69121383666;疇,-12.5815629649;嘆,-8.2508296246;討,-9.24935845471;暑,-11.8884157843;甜,-9.40350913454;亡,-8.99804402643;魔,-8.42267988153;挨,-8.53851169705;怪,-7.36120713981;皱,-11.8884157843;地,-5.76702006763;蔼,-9.40350913454;材,-9.58583069133;存,-7.42250766567;矛,-8.42267988153;镜,-9.87351276378;營,-8.3768703455;满,-6.81012184176;旧,-9.08505540342;择,-8.12721566863;快,-8.3768703455;聪,-8.64973733216;峭,-8.40717569499;右,-7.01704255756;歸,-7.00940893271;蟻,-10.6356528158;蓽,-11.8884157843;往,-7.13482559322;妄,-7.47561749099;邊,-7.77754192015;怕,-8.1389117084;吝,-10.1836676921;償,-8.66953995946;推,-8.57422977965;樹,-7.88108259909;许,-9.1475757604;愿,-7.88108259909;盆,-9.74834962083;虑,-9.18036558322;擒,-9.05520244027;過,-6.85146318191;關,-7.37207681204;勞,-7.66890807915;正,-6.08780912503;賢,-8.02768607329;桥,-9.80897424265;鑽,-9.69119120699;即,-6.09692772925;起,-6.15184348685;棺,-10.3843383876;拾,-10.0966563151;怀,-7.94683397666;挂,-8.40717569499;誇,-9.28572609888;随,-7.9763927789;抗,-8.94397680516;料,-8.11565484623;蜚,-8.8438933466;贞,-9.18036558322;造,-8.23775754303;錢,-8.15074616604;欲,-6.17633450686;渴,-10.2789778719;銷,-11.1952686038;然,-5.09494965175;宽,-10.9721250525;珍,-9.44606874896;科,-9.05520244027;苗,-10.3843383876;摘,-10.9721250525;话,-6.64931777744;軟,-10.2789778719;凡,-8.68974266678;罪,-9.74834962083;揭,-12.5815629649;衰,-11.8884157843;蹴,-8.12721566863;其,-4.77690366783;痹,-8.99804402643;绿,-9.0262149034;驪,-11.8884157843;沈,-7.72953270097;引,-9.53704052716;無,-3.88288189742;厢,-8.26407485135;眥,-10.5021214232;假,-7.80243947177;循,-7.81938903009;抬,-8.71036195398;麟,-9.36268714002;頻,-10.0966563151;鸿,-9.11582706209;视,-7.22027079918;俊,-8.89268351077;寒,-7.32928953684;罕,-9.08505540342;酸,-10.7898034957;衛,-10.9721250525;俎,-9.69119120699;也,-10.7898034957;盤,-8.19953633021;秦,-10.9721250525;捭,-9.69119120699;景,-7.93717206575;诲,-10.9721250525;凶,-8.09292659515;基,-10.6356528158;巾,-10.5021214232;輪,-10.0966563151;渊,-9.74834962083;劍,-8.73141536318;频,-10.0966563151;底,-8.71036195398;鴨,-10.9721250525;足,-5.79823776428;妻,-9.2142671349;媽,-8.94397680516;簾,-8.97064505224;泉,-9.36268714002;蹊,-9.58583069133;绕,-11.1952686038;晚,-8.64973733216;迟,-11.4829506762;牢,-9.80897424265;寧,-9.08505540342;鳩,-12.5815629649;繪,-8.79737333097;柯,-9.63712398572;棱,-8.59257891832;該,-8.94397680516;移,-8.61127105133;竽,-11.4829506762;老,-6.76148003453;消,-8.01721477342;堑,-10.9721250525;肖,-9.74834962083;貞,-9.18036558322;冠,-8.34745646029;脫,-8.31888308785;踵,-8.1389117084;吹,-7.32928953684;皺,-11.8884157843;精,-6.68440909725;汉,-9.69119120699;今,-7.41677699096;牍,-12.5815629649;双,-8.09292659515;轟,-7.34512100206;編,-12.5815629649;绪,-10.5021214232;扭,-10.5021214232;固,-11.8884157843;戀,-8.7529215684;辉,-7.45166424996;再,-7.70636564169;頂,-8.47068910071;沟,-9.24935845471;靚,-11.8884157843;疥,-10.6356528158;碧,-8.08175329456;義,-7.08439473959;亲,-7.86306409359;水,-6.21509251715;傷,-8.3768703455;猶,-7.82797277378;么,-12.5815629649;瓏,-9.05520244027;结,-6.56296975039;諛,-9.63712398572;鏡,-9.87351276378;難,-5.96952193005;瑤,-10.9721250525;襲,-7.89021508266;淵,-9.74834962083;陸,-8.97064505224;秽,-11.4829506762;技,-9.24935845471;憂,-7.16991691303;載,-7.69121383666;瞎,-8.77490047512;辞,-7.91812387077;加,-7.02473490319;咤,-9.0262149034;缩,-8.59257891832;悬,-8.94397680516;贵,-7.77754192015;霹,-9.11582706209;尿,-9.53704052716;晃,-8.34745646029;臂,-8.26407485135;故,-7.9565901516;蓄,-9.1475757604;识,-7.37207681204;城,-7.84536451649;駒,-11.1952686038;絕,-7.27825805683;狠,-9.05520244027;陣,-8.3768703455;顧,-6.39535434099;彩,-7.50638914965;扫,-8.27749787168;賴,-10.0166136074;叶,-8.59257891832;睹,-10.7898034957;闺,-9.44606874896;忾,-11.8884157843;争,-7.9565901516;压,-9.05520244027;傍,-8.82036284919;骑,-11.4829506762;純,-9.2142671349;條,-7.78577241929;踞,-10.9721250525;匠,-9.40350913454;逢,-7.87203276357;唤,-8.31888308785;莫,-7.07217462826;冷,-9.24935845471;父,-10.0166136074;眸,-9.74834962083;礼,-7.86306409359;噎,-9.53704052716;子,-6.8811193915;離,-6.67892963149;诛,-8.91800131876;裝,-7.98644311475;鏤,-12.5815629649;獠,-10.1836676921;哥,-9.40350913454;黩,-9.74834962083;惭,-9.49052051153;赴,-9.0262149034;饼,-10.7898034957;幾,-9.1475757604;蜃,-8.48721840266;三,-6.08780912503;倍,-11.1952686038;弓,-8.73141536318;茫,-10.3843383876;暮,-8.53851169705;許,-9.1475757604;鬻,-9.32346642686;纾,-10.5021214232;权,-7.45759898548;賊,-8.47068910071;凌,-8.61127105133;畏,-8.15074616604;寐,-8.6303192463;飒,-9.80897424265;拖,-10.7898034957;據,-9.74834962083;衝,-7.39977941459;滞,-8.21211511242;珠,-9.69119120699;捫,-12.5815629649;恭,-7.66158203906;蛮,-9.36268714002;铺,-10.9721250525;躇,-8.68974266678;栈,-10.2789778719;權,-7.45759898548;颓,-11.1952686038;暗,-7.7940712221;沛,-9.08505540342;东,-7.90873413042;吠,-11.4829506762;级,-9.18036558322;漲,-8.02768607329;旁,-7.70636564169;归,-7.00940893271;保,-8.8438933466;句,-8.94397680516;給,-7.93717206575;深,-6.62055762526;系,-9.94250563527;幼,-10.9721250525;竿,-8.12721566863;考,-10.5021214232;茅,-9.0262149034;万,-5.57034897754;圍,-10.1836676921;頓,-7.99659548622;肘,-12.5815629649;瀣,-9.69119120699;垢,-8.99804402643;墨,-9.05520244027;贱,-10.5021214232;恃,-8.42267988153;雌,-8.99804402643;野,-8.68974266678;體,-7.49396662965;旖,-10.5021214232;揚,-6.5976266842;遣,-9.05520244027;矢,-9.0262149034;磨,-8.73141536318;扯,-11.4829506762;郸,-10.6356528158;类,-8.39190822286;穿,-9.32346642686;昂,-9.36268714002;喋,-9.0262149034;笔,-8.19953633021;林,-9.32346642686;涛,-8.79737333097;溝,-9.24935845471;本,-6.84177005271;鶻,-12.5815629649;宿,-11.1952686038;擁,-7.80243947177;担,-11.8884157843;豆,-9.80897424265;偎,-12.5815629649;孔,-8.71036195398;慘,-10.0166136074;潜,-11.8884157843;員,-9.36268714002;釣,-9.32346642686;忧,-7.16991691303;泱,-10.5021214232;走,-6.76445180492;烹,-11.8884157843;典,-8.55621127415;绽,-11.8884157843;彼,-7.27329526749;顾,-6.39535434099;锋,-7.51265876267;炎,-9.0262149034;少,-9.0262149034;朗,-9.69119120699;袞,-10.7898034957;蘭,-12.5815629649;醜,-10.1836676921;鴻,-9.11582706209;览,-8.91800131876;韌,-9.80897424265;郎,-8.97064505224;赛,-10.3843383876;九,-7.57092767079;酣,-10.2789778719;剥,-10.5021214232;蟬,-9.80897424265;仲,-10.3843383876;说,-6.49934405451;银,-8.07070345837;凸,-11.8884157843;繽,-8.05977438784;飾,-10.0166136074;漆,-10.5021214232;閃,-8.97064505224;猎,-11.4829506762;徑,-7.96644244805;掙,-9.53704052716;脚,-7.24402488519;弦,-8.36205525971;太,-7.98644311475;搬,-10.0966563151;辱,-7.88108259909;眶,-8.71036195398;麻,-9.63712398572;痍,-10.3843383876;烏,-8.15074616604;华,-7.61174966531;托,-8.94397680516;慚,-9.49052051153;畢,-7.6987610423;葬,-8.91800131876;惯,-9.18036558322;买,-8.43842823849;鱼,-8.33306772284;脅,-10.7898034957;澆,-8.89268351077;阋,-11.4829506762;透,-11.1952686038;娓,-9.94250563527;夕,-8.30489684587;搗,-10.0966563151;減,-8.29110352374;膚,-10.0966563151;骨,-7.37207681204;蔭,-9.94250563527;液,-10.6356528158;匹,-8.86799089818;汇,-11.8884157843;网,-8.18711381021;巒,-9.80897424265;著,-8.03826818262;拘,-8.19953633021;靡,-8.19953633021;入,-6.22893356857;蓬,-9.32346642686;息,-6.93965589395;仰,-8.42267988153;極,-7.31370480582;鋸,-12.5815629649;出,-5.90826499712;蚁,-10.6356528158;誉,-10.0966563151;斗,-8.34745646029;带,-8.03826818262;窩,-12.5815629649;堪,-6.99057598438;攬,-10.7898034957;戮,-10.0966563151;讳,-9.11582706209;喷,-8.99804402643;雞,-7.87203276357;情,-6.0448713673;齐,-7.42250766567;奔,-7.77754192015;进,-8.39190822286;口,-5.55336153283;巧,-7.62573590729;轰,-7.34512100206;陶,-10.2789778719;卸,-11.4829506762;翻,-8.39190822286;遺,-8.02768607329;驾,-8.47068910071;者,-7.58435069112;國,-7.1970679021;名,-5.72615416628;鬓,-9.94250563527;堕,-11.4829506762;肚,-10.9721250525;語,-8.48721840266;瘡,-8.77490047512;冤,-9.58583069133;紧,-11.4829506762;度,-7.80243947177;斬,-8.73141536318;鼻,-8.6303192463;為,-4.85402785441;尽,-6.19974694748;浇,-8.89268351077;仆,-8.16272235709;诈,-8.66953995946;裊,-9.63712398572;闌,-11.4829506762;委,-9.63712398572;佛,-10.7898034957;襟,-8.05977438784;健,-9.80897424265;零,-8.59257891832;特,-8.94397680516;司,-9.28572609888;要,-8.2248541382;辅,-8.26407485135;序,-8.01721477342;钓,-9.32346642686;会,-7.74528105793;鬢,-9.94250563527;犧,-9.28572609888;被,-10.2789778719;傻,-10.6356528158;缺,-8.55621127415;槁,-12.5815629649;血,-6.91860248475;磋,-12.5815629649;经,-6.4503364754;遐,-9.63712398572;卒,-9.69119120699;滯,-8.21211511242;聰,-8.64973733216;调,-8.27749787168;與,-7.49396662965;撈,-9.24935845471;香,-8.33306772284;吓,-10.9721250525;視,-7.22027079918;星,-7.81087834042;颠,-8.7529215684;客,-9.80897424265;缥,-9.05520244027;脱,-8.31888308785;暴,-7.56428312807;阿,-11.1952686038;疾,-7.72175056052;扇,-10.9721250525;遏,-11.1952686038;拜,-9.28572609888;號,-8.39190822286;燦,-9.0262149034;湯,-9.32346642686;菲,-10.9721250525;杵,-12.5815629649;穷,-7.86306409359;闾,-11.1952686038;樂,-6.67620111683;傑,-10.7898034957;間,-9.87351276378;沙,-8.59257891832;业,-8.40717569499;戲,-9.80897424265;朴,-9.94250563527;冻,-10.2789778719;滅,-8.42267988153;秋,-7.9565901516;诗,-11.8884157843;穢,-11.4829506762;色,-6.66266911061;顶,-8.47068910071;幺,-12.5815629649;狽,-8.66953995946;式,-11.8884157843;袖,-8.7529215684;愛,-10.1836676921;期,-8.16272235709;邦,-10.0166136074;閨,-9.44606874896;險,-8.45442857984;設,-7.07623142895;綸,-10.9721250525;觀,-7.22497669021;浃,-9.44606874896;諂,-11.8884157843;胆,-7.69121383666;積,-7.37755627781;富,-6.62313827186;灑,-9.0262149034;勒,-8.2508296246;淘,-11.8884157843;滚,-8.73141536318;擞,-8.68974266678;卧,-8.66953995946;烦,-8.52111995434;盪,-7.18340026337;诬,-12.5815629649;壶,-10.3843383876;建,-9.94250563527;牽,-8.6303192463;超,-12.5815629649;爐,-9.63712398572;丘,-10.1836676921;管,-9.28572609888;纣,-10.0966563151;夢,-7.9565901516;尤,-9.2142671349;錦,-8.57422977965;瞩,-7.02860337996;戰,-6.87113594751;徹,-8.66953995946;眾,-6.82899032606;毁,-11.4829506762;荆,-9.24935845471;立,-6.06685027401;种,-10.9721250525;塌,-7.48781276408;彎,-8.57422977965;珑,-9.05520244027;兒,-9.08505540342;寡,-7.04029941973;廣,-7.26835698584;工,-8.16272235709;僧,-11.8884157843;番,-8.79737333097;轮,-10.0966563151;艰,-9.63712398572;曳,-12.5815629649;幸,-10.6356528158;遼,-9.36268714002;七,-6.9980666561;概,-8.82036284919;蜉,-10.7898034957;暈,-8.08175329456;复,-6.45251275483;碌,-9.69119120699;小,-5.95087957924;美,-7.98644311475;栗,-11.4829506762;饮,-9.53704052716;厦,-10.5021214232;眩,-11.1952686038;隨,-7.9763927789;喪,-7.59795634318;弹,-8.82036284919;纸,-8.07070345837;刻,-8.30489684587;炼,-10.2789778719;观,-7.22497669021;浅,-9.36268714002;街,-7.44576452784;毖,-10.3843383876;余,-7.35045434803;淚,-8.21211511242;惜,-8.79737333097;章,-9.28572609888;革,-9.80897424265;橫,-7.08030475434;業,-8.40717569499;修,-9.2142671349;敵,-7.43989940838;寶,-7.9763927789;侃,-8.68974266678;月,-7.44576452784;优,-10.1836676921;掛,-8.40717569499;斟,-8.94397680516;粥,-9.49052051153;在,-5.42772916331;袭,-7.89021508266;花,-5.88206262472;鄉,-8.10422615041;去,-6.50392072154;濃,-10.7898034957;饌,-12.5815629649;仙,-9.53704052716;胝,-11.4829506762;峥,-10.9721250525;睨,-11.8884157843;毫,-8.3768703455;拱,-10.7898034957;柳,-9.0262149034;聲,-5.60521489444;兼,-7.9565901516;刑,-8.94397680516;圓,-9.05520244027;吕,-11.1952686038;渙,-9.63712398572;思,-5.76045549263;膜,-9.24935845471;宠,-8.57422977965;贯,-7.14348365596;悲,-8.86799089818;夷,-8.40717569499;医,-9.40350913454;裂,-11.8884157843;晉,-12.5815629649;筋,-9.36268714002;嗔,-10.3843383876;蹙,-11.8884157843;履,-8.6303192463;內,-10.0966563151;噩,-12.5815629649;繹,-7.85417514617;獻,-9.63712398572;災,-7.66890807915;图,-7.71402851443;漂,-12.5815629649;龍,-6.81951158211;贖,-9.1475757604;枝,-7.20166561135;锦,-8.57422977965;倨,-11.8884157843;貫,-7.14348365596;辭,-7.91812387077;測,-9.87351276378;戴,-7.7940712221;康,-9.87351276378;钻,-9.69119120699;势,-6.27894398914;轂,-12.5815629649;靠,-10.3843383876;應,-6.46346576685;荊,-9.24935845471;呐,-9.32346642686;青,-8.43842823849;剔,-8.48721840266;仗,-10.5021214232;苟,-8.6303192463;巡,-12.5815629649;罢,-8.52111995434;寥,-8.09292659515;想,-6.5062169338;孺,-9.49052051153;脉,-8.26407485135;尋,-7.23445543417;續,-7.32928953684;瞒,-11.4829506762;匕,-12.5815629649;朝,-6.6982405764;戟,-10.6356528158;鲠,-10.7898034957;骤,-8.77490047512;榮,-8.47068910071;耳,-6.98685158528;帷,-8.89268351077;夹,-8.91800131876;霽,-11.8884157843;流,-6.16483068237;桃,-8.68974266678;諄,-10.5021214232;鵡,-10.5021214232;糠,-10.2789778719;兩,-6.42670487087;潭,-9.28572609888;蟲,-9.74834962083;睽,-8.6303192463;誅,-8.91800131876;肉,-7.24884417162;愈,-8.79737333097;宏,-9.0262149034;飘,-8.57422977965;蜜,-9.11582706209;窥,-10.3843383876;否,-9.18036558322;亭,-9.74834962083;讯,-8.8438933466;德,-9.0262149034;喻,-8.39190822286;隽,-11.4829506762;眼,-6.32965908172;瀾,-8.73141536318;況,-8.45442857984;绍,-11.4829506762;彌,-9.69119120699;協,-7.96644244805;俗,-8.10422615041;杜,-10.6356528158;韧,-9.80897424265;淫,-8.40717569499;转,-6.67076632085;衮,-10.7898034957;奸,-9.08505540342;谁,-9.24935845471;殄,-10.3843383876;把,-10.7898034957;碎,-7.58435069112;向,-7.54461036247;簡,-8.31888308785;室,-9.80897424265;贫,-8.7529215684;中,-6.01489053508;新,-7.47561749099;強,-6.85146318191;頹,-11.1952686038;窺,-10.3843383876;匿,-8.53851169705;汁,-9.53704052716;评,-10.0966563151;忌,-7.59113037811;风,-5.44190262892;荟,-10.3843383876;驥,-10.9721250525;瓦,-8.10422615041;適,-8.40717569499;麦,-10.1836676921;罷,-8.52111995434;島,-11.4829506762;白,-7.39977941459;戈,-8.45442857984;冕,-8.57422977965;羡,-12.5815629649;鸠,-12.5815629649;崢,-10.9721250525;璧,-9.44606874896;玩,-8.79737333097;身,-5.9158792471;優,-10.1836676921;芳,-9.28572609888;容,-6.20144042799;示,-8.82036284919;琼,-10.5021214232;濁,-10.3843383876;赂,-10.2789778719;擇,-8.12721566863;揉,-9.40350913454;腊,-10.6356528158;限,-9.80897424265;燕,-9.44606874896;達,-7.88108259909;楚,-8.27749787168;藝,-10.6356528158;捞,-9.24935845471;忡,-7.59795634318;嫣,-9.58583069133;睦,-9.2142671349;豬,-10.9721250525;柱,-10.7898034957;拳,-8.36205525971;呼,-7.12624184953;企,-10.3843383876;涂,-7.66890807915;攝,-10.9721250525;蒜,-9.40350913454;颤,-10.9721250525;动,-5.46354676042;尷,-11.1952686038;阻,-10.2789778719;摇,-7.29835923615;捉,-8.01721477342;鳌,-9.1475757604;虛,-7.04422869787;饥,-8.82036284919;東,-7.90873413042;筹,-7.84536451649;登,-8.23775754303;哼,-10.9721250525;灿,-9.0262149034;袅,-9.63712398572;挈,-11.1952686038;律,-10.6356528158;世,-6.02905507785;舞,-7.36662720728;张,-6.8811193915;防,-10.0166136074;爾,-7.9763927789;拉,-8.79737333097;聊,-8.21211511242;坐,-9.05520244027;兔,-10.3843383876;湖,-9.2142671349;遥,-8.12721566863;蓝,-10.7898034957;臟,-8.30489684587;獨,-6.55328444466;濫,-8.34745646029;并,-7.22497669021;竹,-8.50402552098;學,-7.64708903176;顺,-8.45442857984;啼,-11.8884157843;丁,-9.74834962083;舉,-6.82899032606;授,-8.73141536318;對,-8.45442857984;阑,-11.4829506762;洗,-11.1952686038;標,-10.2789778719;望,-6.84822168799;感,-8.57422977965;砥,-8.61127105133;邪,-8.82036284919;颜,-7.05611002575;撲,-9.74834962083;纶,-10.9721250525;疼,-9.63712398572;儿,-9.08505540342;賂,-10.2789778719;规,-8.61127105133;翠,-10.6356528158;啧,-9.80897424265;剩,-8.36205525971;致,-6.93611606724;延,-8.8438933466;寸,-7.99659548622;壺,-10.3843383876;勾,-9.18036558322;骇,-8.47068910071;貓,-10.9721250525;辕,-9.49052051153;渔,-10.5021214232;疙,-11.4829506762;鐘,-8.68974266678;娜,-9.63712398572;驚,-6.06389169197;谨,-7.82797277378;伪,-10.3843383876;厭,-8.10422615041;徵,-7.72175056052;机,-6.48348868272;讽,-10.3843383876;派,-9.94250563527;附,-7.7940712221;竇,-10.7898034957;屈,-7.45759898548;齊,-7.42250766567;飛,-6.77944458951;寝,-9.58583069133;换,-7.04422869787;年,-6.56784780884;滿,-6.81012184176;吃,-6.54369204496;的,-8.8438933466;娇,-9.53704052716;耋,-10.9721250525;羊,-9.08505540342;輕,-6.47009562538;骜,-9.32346642686;縟,-9.58583069133;铄,-11.8884157843;肠,-8.07070345837;洩,-8.18711381021;貨,-9.32346642686;倫,-7.43406848807;犬,-8.34745646029;疮,-8.77490047512;失,-6.23944154617;張,-6.8811193915;憶,-8.52111995434;蠻,-9.36268714002;参,-8.91800131876;雄,-9.1475757604;恋,-8.7529215684;晏,-10.9721250525;顛,-8.7529215684;矚,-7.02860337996;孝,-10.5021214232;幟,-8.71036195398;惠,-11.1952686038;注,-6.6309204123;火,-5.98578245093;问,-7.47561749099;声,-5.60521489444;米,-7.82797277378;罵,-8.8438933466;喃,-8.3768703455;隅,-9.0262149034;宇,-9.18036558322;井,-7.61174966531;窝,-12.5815629649;震,-9.74834962083;质,-9.2142671349;醫,-9.40350913454;踪,-9.44606874896;获,-8.34745646029;攸,-9.08505540342;便,-9.53704052716;烁,-9.74834962083;篇,-8.34745646029;鹊,-9.49052051153;拍,-9.0262149034;佔,-9.05520244027;受,-7.80243947177;邻,-8.48721840266;胡,-9.80897424265;饰,-10.0166136074;绵,-9.1475757604;送,-8.82036284919;舍,-10.2789778719;掌,-8.89268351077;贓,-8.94397680516;喘,-7.56428312807;宜,-8.66953995946;膠,-10.0166136074;春,-7.61871833463;報,-7.6987610423;悶,-8.64973733216;沾,-8.66953995946;净,-8.86799089818;態,-8.08175329456;才,-7.16991691303;杏,-10.9721250525;桑,-8.45442857984;浓,-10.7898034957;返,-9.44606874896;南,-7.58435069112;淨,-8.86799089818;捷,-11.1952686038;胶,-10.0166136074;颇,-11.1952686038;鸭,-10.9721250525;趕,-9.24935845471;气,-5.5784975061;化,-7.12624184953;採,-7.22027079918;斥,-9.80897424265;劫,-8.17484371762;贪,-9.53704052716;覽,-8.91800131876;格,-8.59257891832;貿,-11.8884157843;病,-7.56428312807;职,-8.48721840266;詐,-8.66953995946;慢,-9.74834962083;藥,-10.7898034957;武,-7.63992054228;迩,-10.9721250525;浪,-7.81087834042;燭,-9.69119120699;篱,-9.18036558322;驰,-8.47068910071;犀,-10.2789778719;锅,-9.53704052716;檐,-9.63712398572;专,-9.40350913454;鎖,-9.80897424265;喚,-8.31888308785;墜,-10.5021214232;從,-7.2062845572;亨,-9.94250563527;别,-7.71402851443;炬,-12.5815629649;启,-8.55621127415;鬱,-8.12721566863;鸳,-11.8884157843;畅,-9.74834962083;哄,-8.48721840266;密,-7.61174966531;廈,-10.5021214232;手,-5.43952639018;背,-7.9763927789;角,-8.66953995946;遗,-8.02768607329;静,-8.47068910071;盘,-8.19953633021;荡,-7.18340026337;轩,-9.24935845471;瑯,-8.40717569499;鳴,-8.52111995434;妇,-9.63712398572;明,-6.42035564319;團,-7.98644311475;夜,-7.35045434803;鸞,-11.1952686038;撥,-9.58583069133;戶,-7.10092404154;携,-8.94397680516;渾,-11.1952686038;遂,-9.94250563527;婆,-8.2248541382;彈,-8.82036284919;虎,-6.75556285751;法,-7.09262523873;雙,-8.09292659515;繞,-11.1952686038;恢,-10.9721250525;量,-8.86799089818;汪,-9.05520244027;热,-8.31888308785;公,-7.20166561135;懷,-7.94683397666;曹,-10.2789778719;乾,-9.49052051153;备,-8.34745646029;銖,-10.3843383876;莠,-8.97064505224;肢,-10.9721250525;温,-10.7898034957;辨,-10.0166136074;貪,-9.53704052716;唯,-9.32346642686;皮,-8.50402552098;雲,-6.40986236748;捋,-11.8884157843;恍,-8.57422977965;泪,-8.21211511242;灭,-8.42267988153;飲,-9.53704052716;巴,-9.2142671349;慷,-10.0166136074;死,-5.76921787071;融,-9.63712398572;昌,-9.44606874896;愎,-9.36268714002;熙,-8.40717569499;帜,-8.71036195398;患,-8.66953995946;接,-7.21092493676;咫,-8.21211511242;霆,-9.80897424265;鞭,-10.3843383876;墳,-10.7898034957;宵,-9.44606874896;收,-7.37207681204;費,-8.71036195398;挺,-12.5815629649;辽,-9.36268714002;調,-8.27749787168;呀,-11.4829506762;织,-9.2142671349;秉,-12.5815629649;淑,-10.2789778719;豐,-9.18036558322;毕,-7.6987610423;鲸,-11.8884157843;神,-6.01068000255;歪,-11.4829506762;短,-8.55621127415;驴,-10.3843383876;泻,-9.49052051153;锁,-9.80897424265;逃,-8.55621127415;包,-8.73141536318;憎,-9.58583069133;沐,-11.8884157843;厚,-8.19953633021;缝,-9.87351276378;府,-9.58583069133;挥,-9.58583069133;含,-10.5021214232;圭,-10.7898034957;哀,-8.64973733216;獅,-11.4829506762;浑,-11.1952686038;络,-9.05520244027;驟,-8.77490047512;擠,-9.32346642686;統,-8.91800131876;峰,-9.11582706209;胸,-8.45442857984;銅,-12.5815629649;徇,-10.2789778719;覓,-9.58583069133;誕,-9.05520244027;炙,-8.43842823849;刚,-11.1952686038;报,-7.6987610423;谦,-10.6356528158;細,-7.53813784797;馳,-8.47068910071;搶,-8.94397680516;奈,-6.32007128057;旋,-8.82036284919;描,-8.47068910071;赐,-10.1836676921;廝,-10.0966563151;察,-8.48721840266;臣,-9.74834962083;若,-6.16974469718;遮,-9.94250563527;干,-7.77754192015;惹,-9.28572609888;腸,-8.07070345837;添,-7.75324922758;艺,-10.6356528158;吁,-7.39417715905;皂,-10.0166136074;玄,-9.2142671349;褓,-10.9721250525;紛,-7.11773115986;龜,-12.5815629649;增,-8.31888308785;栩,-7.9763927789;說,-6.49934405451;瞬,-9.28572609888;匯,-11.8884157843;炮,-9.69119120699;就,-7.10092404154;纲,-9.36268714002;踽,-10.9721250525;囂,-8.73141536318;驷,-12.5815629649;捏,-10.7898034957;胎,-8.79737333097;軒,-9.24935845471;块,-12.5815629649;遙,-8.12721566863;无,-3.88288189742;畫,-7.74528105793;韬,-11.8884157843;劃,-8.36205525971;内,-10.0966563151;安,-7.01321846113;醬,-9.69119120699;渐,-8.33306772284;誓,-8.42267988153;洒,-9.0262149034;锯,-12.5815629649;圖,-7.71402851443;沧,-8.8438933466;伦,-7.43406848807;閭,-11.1952686038;献,-9.63712398572;破,-6.77642799597;莹,-9.32346642686;镂,-12.5815629649;遄,-12.5815629649;乐,-6.67620111683;衔,-10.3843383876;哗,-9.58583069133;牘,-12.5815629649;川,-11.8884157843;食,-7.53813784797;敢,-8.55621127415;臥,-8.66953995946;潦,-9.63712398572;鵲,-9.49052051153;霁,-11.8884157843;刃,-8.08175329456;將,-7.43989940838;源,-7.14784096133;飯,-8.91800131876;銘,-8.53851169705;縛,-12.5815629649;鲜,-8.52111995434;实,-6.84177005271;肤,-10.0966563151;誨,-10.9721250525;親,-7.86306409359;弱,-8.79737333097;網,-8.18711381021;架,-9.28572609888;茹,-9.36268714002;主,-10.0166136074;睁,-11.4829506762;雀,-7.91812387077;忆,-8.52111995434;等,-10.0966563151;晋,-12.5815629649;潑,-9.40350913454;鵝,-10.6356528158;曠,-9.24935845471;既,-7.48781276408;腥,-10.2789778719;灯,-7.82797277378;叮,-10.9721250525;已,-7.99659548622;飴,-12.5815629649;傅,-10.9721250525;嶇,-9.69119120699;膏,-9.11582706209;戎,-9.49052051153;云,-6.40986236748;嘖,-9.80897424265;錘,-8.99804402643;通,-6.73512418983;並,-7.22497669021;冯,-11.1952686038;缰,-11.8884157843;害,-8.50402552098;呂,-11.1952686038;塊,-12.5815629649;操,-10.1836676921;滑,-9.69119120699;毓,-11.8884157843;務,-7.41677699096;駟,-12.5815629649;饴,-12.5815629649;旷,-9.24935845471;泽,-9.94250563527;阁,-11.8884157843;逅,-10.1836676921;崇,-11.1952686038;脏,-8.30489684587;丑,-10.1836676921;沒,-7.45759898548;厘,-12.5815629649;缛,-9.58583069133;挣,-9.53704052716;急,-7.03638552041;亦,-8.11565484623;讨,-9.24935845471;吭,-10.1836676921;借,-11.8884157843;船,-8.02768607329;凄,-10.9721250525;俐,-10.3843383876;類,-8.39190822286;盖,-7.26344297104;竞,-11.8884157843;荣,-8.47068910071;詩,-11.8884157843;敷,-8.89268351077;諾,-10.7898034957;待,-7.28324559834;閉,-10.0166136074;亏,-8.73141536318;昔,-9.11582706209;窗,-9.74834962083;外,-6.67076632085;尘,-7.42250766567;鮮,-8.52111995434;两,-6.42670487087;斩,-8.73141536318;瘴,-9.1475757604;永,-9.94250563527;放,-7.13482559322;私,-7.32928953684;魂,-7.10929229121;翅,-9.58583069133;鹄,-11.4829506762;呈,-10.3843383876;棋,-7.45166424996;母,-12.5815629649;赎,-9.1475757604;荒,-7.66890807915;祖,-9.0262149034;罚,-9.0262149034;賣,-8.45442857984;止,-8.59257891832;马,-5.85652932272;噴,-8.99804402643;揽,-10.7898034957;切,-7.16991691303;踏,-8.59257891832;涎,-8.77490047512;脑,-7.69121383666;排,-9.28572609888;妖,-10.7898034957;紙,-8.07070345837;銜,-10.3843383876;氣,-5.5784975061;交,-6.32581292313;玲,-8.50402552098;费,-8.71036195398;沸,-7.27825805683;耻,-8.86799089818;寂,-9.44606874896;黄,-7.71402851443;片,-8.36205525971;准,-12.5815629649;跎,-11.8884157843;驗,-10.0166136074;差,-6.96479186722;史,-9.40350913454;围,-10.1836676921;浹,-9.44606874896;稂,-11.8884157843;缄,-9.69119120699;钉,-7.71402851443;見,-5.83868232909;認,-11.4829506762;戒,-9.63712398572;朔,-8.23775754303;算,-8.94397680516;帚,-11.8884157843;吞,-6.97576089859;涣,-9.63712398572;伤,-8.3768703455;第,-11.1952686038;焰,-9.74834962083;渺,-10.3843383876;豎,-8.39190822286;惑,-7.99659548622;腐,-9.94250563527;凛,-8.03826818262;繚,-7.98644311475;勝,-6.80391064166;裡,-6.6283196306;跣,-11.4829506762;以,-5.28176559813;竭,-8.91800131876;兰,-12.5815629649;割,-9.87351276378;靴,-10.3843383876;吉,-8.31888308785;伏,-8.82036284919;憐,-12.5815629649;抒,-8.94397680516;颖,-7.60482922247;真,-7.16991691303;夫,-7.70636564169;弯,-8.57422977965;粮,-9.40350913454;週,-7.24402488519;阵,-8.3768703455;囊,-8.79737333097;晕,-8.08175329456;字,-7.55112504349;緘,-9.69119120699;剝,-10.5021214232;坟,-10.7898034957;衡,-9.18036558322;濤,-8.79737333097;寬,-10.9721250525;凰,-10.9721250525;歷,-8.36205525971;汹,-7.85417514617;板,-8.40717569499;宁,-9.08505540342;稀,-9.87351276378;邇,-10.9721250525;成,-5.41684258611;搔,-10.3843383876;碗,-10.7898034957;帘,-8.97064505224;倜,-9.40350913454;霞,-10.1836676921;馭,-10.7898034957;琴,-11.8884157843;边,-7.77754192015;游,-8.91800131876;膽,-7.69121383666;练,-8.1389117084;陈,-6.77642799597;槍,-7.70636564169;行,-6.25006111499;低,-10.3843383876;策,-10.5021214232;忙,-7.78577241929;凝,-10.5021214232;诡,-8.45442857984;代,-6.51545487478;汤,-9.32346642686;晨,-10.0166136074;布,-9.36268714002;疊,-9.80897424265;谏,-9.44606874896;澎,-8.66953995946;爛,-7.62573590729;次,-8.79737333097;誠,-7.57761665894;津,-7.75324922758;性,-7.388606114;薪,-8.89268351077;夭,-9.1475757604;匱,-9.24935845471;阳,-8.19953633021;锵,-9.80897424265;橋,-9.80897424265;闊,-7.69121383666;迎,-10.7898034957;塗,-7.66890807915;绘,-8.79737333097;剛,-11.1952686038;線,-10.5021214232;鋒,-7.51265876267;砂,-9.80897424265;約,-7.36120713981;醇,-12.5815629649;眈,-8.45442857984;袍,-10.1836676921;怒,-7.49396662965;騖,-9.87351276378;尚,-9.18036558322;謠,-10.1836676921;蠢,-8.19953633021;沥,-8.97064505224;贤,-8.02768607329;宫,-10.9721250525;鶯,-11.8884157843;縮,-8.59257891832;钵,-11.8884157843;漸,-8.33306772284;显,-8.64973733216;靈,-8.40717569499;毋,-10.0166136074;告,-7.67628818645;棍,-10.1836676921;乎,-7.07623142895;姗,-9.05520244027;叛,-8.64973733216;嗟,-12.5815629649;臧,-11.8884157843;杨,-10.0966563151;緯,-10.3843383876;狱,-11.8884157843;印,-12.5815629649;石,-7.27329526749;遲,-11.4829506762;威,-8.94397680516;简,-8.31888308785;弃,-8.61127105133;蜓,-10.0166136074;猛,-8.00685198638;瀝,-8.97064505224;农,-11.8884157843;生,-5.4774188719;模,-6.99057598438;愧,-10.3843383876;芦,-11.1952686038;頭,-5.16278208214;现,-10.6356528158;鐵,-8.11565484623;丹,-8.89268351077;从,-7.2062845572;扑,-9.74834962083;套,-11.8884157843;竖,-8.39190822286;啟,-8.55621127415;台,-8.7529215684;间,-9.87351276378;蛾,-10.9721250525;境,-8.82036284919;宅,-9.53704052716;嚇,-10.9721250525;醉,-8.47068910071;崖,-7.81087834042;領,-8.27749787168;傳,-8.64973733216;洶,-7.85417514617;欺,-8.09292659515;愾,-11.8884157843;局,-10.2789778719;商,-9.53704052716;半,-6.67620111683;乌,-8.15074616604;铛,-9.80897424265;煞,-10.9721250525;跡,-8.1389117084;池,-10.1836676921;该,-8.94397680516;敦,-9.80897424265;恨,-10.2789778719;端,-9.94250563527;奮,-7.26344297104;鉴,-8.8438933466;赶,-9.24935845471;擻,-8.68974266678;拿,-8.73141536318;腾,-7.55112504349;疆,-9.18036558322;儉,-8.48721840266;谋,-6.84822168799;礙,-9.44606874896;题,-8.23775754303;定,-6.85146318191;障,-11.1952686038;負,-8.04896347173;誤,-11.4829506762;昧,-8.97064505224;飽,-8.97064505224;纬,-10.3843383876;禮,-7.86306409359;唱,-9.32346642686;環,-12.5815629649;殺,-7.96644244805;煉,-10.2789778719;及,-6.56540580519;救,-7.81087834042;幗,-9.36268714002;盜,-9.05520244027;衣,-7.58435069112;虧,-8.73141536318;旦,-7.94683397666;惨,-10.0166136074;獵,-11.4829506762;裸,-8.86799089818;诺,-10.7898034957;承,-11.1952686038;臾,-11.1952686038;岁,-9.58583069133;理,-6.90139035587;躍,-8.26407485135;尖,-10.9721250525;餘,-7.35045434803;霜,-9.44606874896;逞,-10.0166136074;没,-7.45759898548;庭,-7.84536451649;钱,-8.15074616604;田,-10.7898034957;决,-9.18036558322;猴,-10.1836676921;竅,-8.68974266678;魄,-8.73141536318;呆,-10.3843383876;先,-6.9720911697;淋,-8.21211511242;志,-8.43842823849;睜,-11.4829506762;叟,-12.5815629649;解,-7.56428312807;此,-6.49934405451;慨,-7.23922871292;扪,-12.5815629649;续,-7.32928953684;彬,-8.33306772284;逼,-7.59795634318;却,-8.61127105133;聾,-8.91800131876;封,-9.18036558322;圇,-10.9721250525;犊,-11.4829506762;不,-2.98168363535;岖,-9.69119120699;媚,-9.69119120699;亢,-9.80897424265;认,-11.4829506762;怩,-11.4829506762;席,-8.47068910071;蔻,-10.5021214232;籁,-9.05520244027;廂,-8.26407485135;测,-9.87351276378;題,-8.23775754303;糖,-12.5815629649;象,-9.58583069133;擦,-8.43842823849;繭,-10.5021214232;壮,-7.82797277378;酒,-7.94683397666;牵,-8.6303192463;觸,-6.33158772263;征,-7.72175056052;紂,-10.0966563151;厉,-8.31888308785;事,-5.88452871722;攒,-11.8884157843;粗,-12.5815629649;多,-5.86739243498;财,-7.68372316494;掩,-9.2142671349;颯,-9.80897424265;劳,-7.66890807915;甲,-8.59257891832;况,-8.45442857984;買,-8.43842823849;讹,-10.2789778719;樸,-9.94250563527;肿,-10.5021214232;翁,-8.91800131876;酊,-10.0166136074;拓,-9.1475757604;联,-9.32346642686;四,-7.27329526749;瑜,-11.8884157843;信,-6.84499066741;陰,-8.97064505224;側,-9.58583069133;餅,-10.7898034957;下,-6.49706355181;熊,-9.87351276378;沌,-11.1952686038;悔,-8.61127105133;樣,-9.40350913454;師,-8.03826818262;疲,-7.73737587843;谷,-9.2142671349;謹,-7.82797277378;蔽,-8.7529215684;撼,-8.82036284919;耿,-7.42250766567;飄,-8.57422977965;释,-7.94683397666;打,-6.40154631123;鱗,-8.73141536318;孙,-9.36268714002;瓜,-8.82036284919;轡,-11.8884157843;拨,-9.58583069133;困,-8.04896347173;闲,-8.43842823849;歹,-9.87351276378;諸,-9.1475757604;它,-11.4829506762;規,-8.61127105133;帖,-9.80897424265;熟,-7.50638914965;鈞,-8.52111995434;传,-8.64973733216;谢,-8.18711381021;斧,-9.49052051153;種,-10.9721250525;隱,-7.59113037811;債,-11.8884157843;层,-10.0966563151;磅,-8.26407485135;奄,-8.03826818262;症,-9.58583069133;陆,-8.97064505224;遊,-8.91800131876;惕,-12.5815629649;腔,-8.11565484623;畜,-11.8884157843;晦,-10.2789778719;积,-7.37755627781;兴,-7.22497669021;混,-8.47068910071;蹶,-8.33306772284;艾,-10.0966563151;铁,-8.11565484623;堅,-9.58583069133;唇,-9.0262149034;皆,-6.9575454587;涌,-9.28572609888;析,-12.5815629649;撒,-10.6356528158;耕,-7.83663083652;官,-7.20166561135;喜,-7.30344830566;渡,-9.69119120699;欣,-8.26407485135;莨,-12.5815629649;窮,-7.86306409359;落,-6.57520980528;於,-11.8884157843;繁,-7.82797277378;集,-11.4829506762;又,-8.82036284919;坛,-11.8884157843;磚,-9.63712398572;乡,-8.10422615041;波,-6.98314100589;补,-8.2248541382;哲,-10.0166136074;灵,-8.40717569499;海,-7.26344297104;件,-12.5815629649;诸,-9.1475757604;
+M,jn:销,-1.09861228867;中,-0.405465108108;銷,-1.09861228867;
+M,j:禁,-9.42168121117;要,-8.72853403061;閉,-9.42168121117;合,-7.57585452067;預,-10.5202934998;渔,-7.47577106212;外,-6.05438538118;宝,-9.42168121117;两,-6.15084564737;礦,-6.51296031461;被,-8.91085558741;伪,-7.81224329874;训,-10.5202934998;售,-7.81224329874;熱,-9.82714631928;河,-7.38479928391;銷,-6.31560088045;專,-6.2576136228;场,-10.5202934998;放,-10.5202934998;谈,-10.5202934998;談,-10.5202934998;反,-8.12239822704;经,-6.60827049441;济,-8.3230689225;科,-5.06497238448;濕,-9.13399913872;员,-7.62992174194;统,-9.82714631928;凡,-7.57585452067;换,-8.03538685005;年,-8.21770840685;调,-8.91085558741;個,-7.02378593837;羊,-10.5202934998;排,-6.78262388156;五,-6.75909338415;視,-9.13399913872;错,-7.57585452067;客,-8.03538685005;交,-2.68313384984;貨,-6.44275605593;港,-8.12239822704;單,-8.44085195816;證,-5.57865107723;讲,-9.42168121117;改,-8.3230689225;貸,-6.24362738082;总,-8.91085558741;检,-6.00943399332;籃,-10.5202934998;组,-5.84746466538;视,-9.13399913872;配,-9.42168121117;聋,-8.44085195816;教,-6.99393297522;衛,-9.82714631928;行,-10.5202934998;渤,-8.12239822704;董,-10.5202934998;艺,-9.82714631928;来,-8.3230689225;牧,-5.21698859178;火,-10.5202934998;淮,-8.3230689225;共,-5.21202580244;史,-7.38479928391;直,-8.72853403061;基,-8.12239822704;广,-10.5202934998;樂,-10.5202934998;上,-7.57585452067;后,-6.17648807799;經,-6.60827049441;甘,-6.67014589813;军,-8.03538685005;伤,-7.95534414238;用,-8.44085195816;醫,-9.82714631928;个,-7.02378593837;足,-8.03538685005;油,-10.5202934998;贸,-8.03538685005;离,-10.5202934998;裁,-8.44085195816;秋,-7.30141767497;砸,-7.95534414238;奥,-7.68708015578;晚,-6.13826686517;濟,-8.3230689225;惡,-10.5202934998;少,-8.3230689225;机,-7.81224329874;寧,-8.12239822704;资,-8.21770840685;恶,-10.5202934998;漁,-7.47577106212;智,-8.44085195816;虫,-10.5202934998;矿,-6.51296031461;老,-6.73610386592;冀,-5.74117000673;腭,-9.82714631928;漏,-8.03538685005;北,-4.94056367385;修,-8.12239822704;初,-10.5202934998;附,-7.15299766985;责,-8.57438335078;亚,-8.57438335078;春,-8.21770840685;群,-7.95534414238;纪,-6.2028053863;粮,-8.72853403061;阵,-10.5202934998;人,-4.97121741494;精,-9.42168121117;际,-8.44085195816;胆,-10.5202934998;双,-8.57438335078;坏,-7.81224329874;檢,-6.00943399332;幕,-9.42168121117;南,-5.96641660824;八,-10.5202934998;养,-10.5202934998;建,-7.42925104648;宁,-8.12239822704;鄂,-7.47577106212;师,-7.88123617022;成,-5.99850492279;化,-4.70915250686;审,-5.21698859178;錦,-7.18808898966;贪,-6.64909248893;到,-10.5202934998;儲,-6.33063875781;水,-9.42168121117;傷,-7.95534414238;边,-9.13399913872;游,-10.5202934998;膽,-10.5202934998;貿,-8.03538685005;眾,-6.40941963567;证,-5.57865107723;黃,-9.82714631928;病,-7.47577106212;重,-6.83141404573;灌,-7.95534414238;低,-5.63749157725;发,-6.40941963567;结,-7.34223966949;兒,-10.5202934998;停,-8.91085558741;非,-7.81224329874;寡,-10.5202934998;廣,-10.5202934998;日,-9.42168121117;学,-6.17648807799;硬,-6.56904978126;陸,-7.02378593837;技,-7.38479928391;七,-9.82714631928;紅,-7.26219696182;标,-9.82714631928;植,-4.26646468826;小,-2.66707711168;美,-5.77536137148;专,-6.2576136228;冒,-7.81224329874;优,-9.13399913872;创,-8.91085558741;加,-8.91085558741;粤,-9.13399913872;电,-6.53130945328;家,-6.53130945328;弹,-8.12239822704;十,-9.82714631928;假,-7.57585452067;轉,-9.42168121117;免,-8.12239822704;城,-4.58012224712;拐,-10.5202934998;住,-7.88123617022;取,-8.03538685005;牛,-10.5202934998;风,-8.57438335078;江,-8.91085558741;连,-7.68708015578;陣,-10.5202934998;顧,-8.72853403061;革,-9.82714631928;六,-7.26219696182;發,-6.40941963567;危,-10.5202934998;平,-8.91085558741;擴,-6.07764224335;職,-7.88123617022;寶,-9.42168121117;處,-7.7477047776;旺,-9.82714631928;難,-9.82714631928;残,-10.5202934998;逃,-8.44085195816;疏,-7.7477047776;明,-7.57585452067;團,-8.12239822704;务,-8.57438335078;帮,-9.13399913872;澳,-6.99393297522;進,-7.26219696182;粵,-9.13399913872;制,-7.18808898966;心,-8.03538685005;組,-5.84746466538;彈,-8.12239822704;父,-7.95534414238;子,-7.81224329874;離,-10.5202934998;法,-6.60827049441;雙,-8.57438335078;換,-8.03538685005;热,-9.82714631928;公,-7.15299766985;路,-6.56904978126;英,-6.69165210335;印,-9.13399913872;石,-4.3569786958;究,-9.42168121117;決,-8.3230689225;兼,-10.5202934998;百,-6.96494543835;三,-4.78050058766;促,-8.21770840685;講,-9.42168121117;农,-6.477242232;生,-6.03165713011;亞,-8.57438335078;大,-6.78262388156;温,-9.82714631928;貪,-6.64909248893;支,-5.52308122608;障,-10.5202934998;现,-5.69197976254;鐵,-8.91085558741;医,-9.82714631928;政,-5.43888913485;援,-5.88556451161;权,-9.42168121117;提,-10.5202934998;体,-10.5202934998;乙,-9.82714631928;奧,-7.68708015578;卫,-9.82714631928;台,-7.57585452067;風,-8.57438335078;幹,-7.57585452067;偽,-7.81224329874;长,-3.3563468155;權,-9.42168121117;融,-5.6076386141;園,-10.5202934998;东,-10.5202934998;患,-6.71363101007;接,-8.72853403061;产,-5.22197613329;锦,-7.18808898966;央,-7.95534414238;收,-6.22983405869;核,-10.5202934998;治,-10.5202934998;調,-8.91085558741;社,-7.57585452067;局,-7.88123617022;商,-3.93136702231;案,-9.13399913872;半,-8.91085558741;青,-6.12584434517;泛,-6.40941963567;博,-6.2028053863;保,-6.71363101007;巡,-8.3230689225;短,-4.95961186882;幼,-9.82714631928;考,-9.42168121117;胀,-6.33063875781;二,-6.88270734011;記,-9.42168121117;府,-8.21770840685;黄,-9.82714631928;連,-7.68708015578;储,-6.33063875781;京,-10.5202934998;環,-6.9093755872;農,-6.477242232;脹,-6.33063875781;運,-4.19057259432;管,-5.35550752592;光,-8.3230689225;位,-8.44085195816;救,-9.13399913872;道,-7.88123617022;财,-7.95534414238;单,-8.44085195816;體,-10.5202934998;學,-6.17648807799;煙,-10.5202934998;诚,-8.3230689225;機,-7.81224329874;衣,-8.03538685005;步,-7.7477047776;勤,-7.15299766985;兩,-6.15084564737;部,-10.5202934998;豫,-6.24362738082;副,-5.3498095048;統,-9.82714631928;蟲,-10.5202934998;鲁,-5.88556451161;紀,-6.2028053863;優,-9.13399913872;理,-5.32179646857;舊,-9.13399913872;投,-5.86633314968;林,-5.54355975742;没,-8.3230689225;戰,-8.44085195816;航,-8.3230689225;环,-6.9093755872;决,-8.3230689225;防,-8.44085195816;品,-8.91085558741;先,-7.15299766985;軍,-8.03538685005;結,-7.34223966949;協,-8.3230689225;常,-8.72853403061;察,-6.64909248893;聞,-7.18808898966;員,-7.62992174194;解,-6.56904978126;院,-5.62994437162;全,-4.42446893741;园,-10.5202934998;转,-9.42168121117;可,-10.5202934998;干,-7.57585452067;闻,-7.18808898966;空,-5.98769400669;国,-5.97699871757;聾,-8.44085195816;稅,-5.74960887537;震,-10.5202934998;不,-9.82714631928;後,-6.17648807799;民,-6.44275605593;互,-7.52456122629;監,-2.99411458649;众,-6.40941963567;官,-10.5202934998;果,-8.12239822704;增,-8.44085195816;红,-7.26219696182;贫,-9.13399913872;中,-3.56279612896;錯,-7.57585452067;邮,-8.12239822704;新,-5.77536137148;總,-8.91085558741;评,-10.5202934998;降,-9.13399913872;协,-8.3230689225;职,-7.88123617022;評,-10.5202934998;壞,-7.81224329874;污,-10.5202934998;团,-8.12239822704;古,-8.91085558741;魯,-5.88556451161;女,-7.30141767497;創,-8.91085558741;湿,-9.13399913872;银,-5.14965547171;一,-4.81651102518;内,-5.70810914447;销,-6.31560088045;安,-7.62992174194;興,-7.88123617022;事,-8.57438335078;養,-10.5202934998;市,-8.57438335078;研,-6.40941963567;岗,-9.42168121117;战,-8.44085195816;際,-8.44085195816;產,-5.22197613329;貧,-9.13399913872;记,-9.42168121117;溫,-9.82714631928;太,-5.14965547171;場,-10.5202934998;容,-9.13399913872;券,-9.42168121117;資,-8.21770840685;介,-8.12239822704;藍,-9.42168121117;代,-6.9093755872;乐,-10.5202934998;联,-2.95917191031;工,-5.85685440573;四,-6.88270734011;藝,-9.82714631928;烟,-10.5202934998;信,-8.57438335078;竣,-10.5202934998;灤,-9.82714631928;糧,-8.72853403061;審,-5.21698859178;武,-9.42168121117;闭,-9.42168121117;俱,-10.5202934998;電,-6.53130945328;难,-9.82714631928;企,-2.97068433468;预,-10.5202934998;來,-8.3230689225;下,-4.81651102518;休,-10.5202934998;源,-9.82714631928;訓,-10.5202934998;鲜,-8.12239822704;辦,-7.62992174194;師,-7.88123617022;責,-8.57438335078;鮮,-8.12239822704;弱,-7.47577106212;洽,-8.72853403061;財,-7.95534414238;草,-10.5202934998;释,-8.91085558741;高,-6.67014589813;入,-5.48334089743;幫,-9.13399913872;聯,-2.95917191031;篮,-10.5202934998;東,-10.5202934998;兵,-6.13826686517;出,-6.96494543835;現,-5.69197976254;省,-7.95534414238;处,-7.7477047776;文,-8.44085195816;銀,-5.14965547171;税,-5.74960887537;供,-7.95534414238;通,-7.7477047776;宣,-6.45985048929;並,-8.91085558741;助,-10.5202934998;地,-1.6647726513;情,-10.5202934998;兄,-7.42925104648;陆,-7.02378593837;遊,-10.5202934998;赌,-10.5202934998;监,-2.99411458649;湖,-7.38479928391;務,-8.57438335078;进,-7.26219696182;蓝,-9.42168121117;口,-8.57438335078;內,-5.70810914447;旧,-9.13399913872;賭,-10.5202934998;扩,-6.07764224335;右,-7.08630629535;郵,-8.12239822704;兴,-7.88123617022;并,-8.91085558741;卸,-9.82714631928;铁,-8.91085558741;國,-5.97699871757;邊,-9.13399913872;沒,-8.3230689225;崗,-9.42168121117;暖,-7.7477047776;標,-9.82714631928;殘,-10.5202934998;办,-7.62992174194;急,-7.02378593837;货,-6.44275605593;贷,-6.24362738082;釋,-8.91085558741;儿,-10.5202934998;長,-3.3563468155;誠,-8.3230689225;跌,-4.91817467896;运,-4.19057259432;委,-3.71235855614;顾,-8.72853403061;滦,-9.82714631928;物,-8.44085195816;海,-6.39315911479;特,-6.73610386592;司,-10.5202934998;西,-4.80656069433;
+M,ln:民,-0.69314718056;政,-0.69314718056;
+M,l:怀,-8.23151094446;璃,-8.36308730225;挂,-9.882913056;锤,-10.1240751128;退,-11.1356760245;涉,-9.26387384759;專,-7.65443593516;肋,-10.5760602366;伊,-11.1356760245;戌,-8.17816496376;随,-8.12752123094;預,-8.60994738018;貓,-9.882913056;茂,-11.8288232051;且,-9.08798318113;抗,-8.76077026992;脖,-10.1240751128;料,-6.78539808813;羅,-9.52623811206;蜉,-12.5219703856;曠,-12.5219703856;废,-9.05623448281;洞,-10.3247458083;怠,-11.1356760245;猢,-9.882913056;媧,-10.5760602366;礦,-7.35718441169;鶩,-11.4233580969;伪,-9.30309456074;厭,-10.7302109164;爬,-9.22613351961;售,-9.95702102815;辈,-8.6718227839;題,-9.81392018451;河,-9.52623811206;欲,-7.66994012169;侵,-9.95702102815;临,-9.34391655526;膠,-11.8288232051;然,-4.93668930697;方,-5.4352324511;吸,-7.51133509152;场,-7.4850177832;宽,-11.8288232051;稼,-12.5219703856;亿,-9.38647616968;派,-9.30309456074;釁,-9.34391655526;铃,-10.0370637358;談,-8.69332898912;齊,-8.71530789584;反,-6.29148893803;牌,-10.7302109164;舌,-8.78430076733;姑,-10.5760602366;賓,-10.9125324732;筒,-10.0370637358;濕,-8.12752123094;序,-7.77703825725;狗,-11.1356760245;纸,-10.9125324732;员,-9.81392018451;飛,-7.62413058566;坚,-10.9125324732;烏,-10.4425288439;统,-7.41602491171;此,-5.82493613795;凡,-8.995609861;遠,-8.73778075169;瓣,-12.5219703856;换,-6.95362588185;查,-9.15467455563;除,-8.71530789584;諧,-10.4425288439;逐,-9.30309456074;惫,-8.2453042666;罪,-8.995609861;班,-7.72617984002;扬,-10.0370637358;衰,-8.42762582339;鳳,-10.5760602366;歲,-9.63159862772;念,-9.63159862772;年,-4.9121081847;其,-6.7789671978;銀,-12.5219703856;摸,-9.52623811206;錢,-10.3247458083;滿,-6.76939774679;渔,-10.7302109164;愁,-10.0370637358;吃,-7.57321049523;厂,-11.4233580969;的,-5.62123972157;妆,-11.8288232051;鴉,-10.7302109164;沈,-8.02216071528;個,-7.7945825669;羊,-10.4425288439;鹃,-11.8288232051;昏,-8.73778075169;疙,-8.73778075169;耕,-8.09115358677;臂,-10.9125324732;引,-7.70168882001;五,-8.27347514356;列,-9.47744794789;鐘,-11.1356760245;错,-9.52623811206;畅,-11.8288232051;謝,-9.63159862772;窜,-10.7302109164;鸟,-10.9125324732;覽,-8.76077026992;無,-4.9904180042;悠,-11.1356760245;厢,-10.7302109164;遇,-8.73778075169;苞,-10.2193852926;異,-6.64423460383;贩,-10.4425288439;貨,-5.27346631324;识,-7.04969971194;抬,-10.1240751128;是,-5.21745443915;單,-8.13994375094;失,-7.28552842278;械,-8.11525113835;讲,-9.882913056;張,-8.96662232412;爷,-11.1356760245;冶,-11.4233580969;改,-6.98463611859;咸,-10.1240751128;蠻,-11.8288232051;贞,-10.3247458083;欽,-10.7302109164;鸿,-12.5219703856;胀,-8.47891911778;邁,-12.5219703856;参,-7.40998259726;身,-6.49610441179;姆,-8.91105247297;配,-12.5219703856;恋,-8.76077026992;辮,-11.8288232051;拌,-10.9125324732;旎,-10.7302109164;惹,-11.4233580969;寒,-11.1356760245;何,-6.53551838033;滔,-12.5219703856;祸,-9.68875704156;教,-5.62023317896;進,-6.86948120534;衛,-9.26387384759;矚,-8.02216071528;孝,-10.0370637358;也,-8.73778075169;潢,-11.4233580969;铮,-9.95702102815;惠,-8.76077026992;叢,-9.08798318113;来,-6.27199514335;汹,-8.96662232412;姦,-11.1356760245;浩,-9.22613351961;注,-7.94725940711;火,-6.45123265761;饮,-9.15467455563;晓,-9.57753140645;景,-8.6301500875;问,-7.580327963;銳,-11.4233580969;声,-6.03886303416;米,-9.81392018451;滴,-11.4233580969;緒,-12.5219703856;凶,-11.4233580969;铸,-9.52623811206;须,-11.8288232051;基,-6.94602128247;轰,-11.8288232051;广,-8.28786388101;巾,-8.53298633905;片,-9.22613351961;儀,-11.1356760245;閃,-8.04463357113;輪,-8.85840873948;門,-6.14184784871;沉,-8.02216071528;醋,-10.5760602366;上,-5.7511809617;劍,-11.4233580969;非,-6.92725900601;后,-6.39292017555;频,-10.7302109164;静,-12.5219703856;經,-5.64777189016;蚂,-9.12077300395;井,-10.2193852926;演,-7.15133235748;飾,-10.9125324732;蒙,-7.7428468925;甘,-8.15252253315;諄,-10.1240751128;蘚,-8.6718227839;窝,-9.57753140645;牛,-8.6301500875;辟,-9.08798318113;股,-8.49661869488;鶴,-11.8288232051;線,-7.98937089246;販,-10.4425288439;螂,-10.9125324732;醫,-8.71530789584;个,-7.7945825669;躲,-8.88438422589;胜,-7.307034628;瀉,-9.57753140645;足,-7.61669560717;娲,-10.5760602366;纵,-8.19123704533;籟,-10.7302109164;頂,-10.7302109164;攸,-11.8288232051;妻,-10.0370637358;饶,-10.2193852926;媽,-6.64985259614;鬼,-8.03333401588;便,-7.83062250338;锻,-10.9125324732;郁,-10.9125324732;荡,-8.71530789584;剂,-11.8288232051;雅,-10.5760602366;銷,-9.18976587544;篇,-6.06677182227;釋,-8.995609861;蹊,-9.08798318113;拍,-9.882913056;蹣,-9.57753140645;绕,-12.5219703856;潔,-8.6301500875;受,-8.6507693747;聖,-8.91105247297;敘,-10.4425288439;晚,-11.1356760245;孜,-9.52623811206;濟,-5.98383056184;属,-8.05606226696;惡,-9.63159862772;民,-5.08241107648;机,-5.92755692586;寧,-11.1356760245;鉛,-11.8288232051;级,-6.37993298002;节,-7.70168882001;棱,-10.7302109164;饰,-10.9125324732;跳,-10.4425288439;绵,-8.16526155892;线,-7.98937089246;号,-9.81392018451;偶,-11.1356760245;數,-6.53551838033;移,-10.2193852926;智,-8.69332898912;詫,-10.3247458083;应,-7.49153246422;膀,-9.68875704156;王,-7.52475811185;弗,-10.5760602366;血,-7.84914155115;消,-8.42762582339;床,-8.93845144716;舍,-10.7302109164;厌,-10.7302109164;咎,-9.38647616968;树,-7.82149001982;般,-6.57132783302;北,-7.1606782199;轮,-8.85840873948;宜,-8.03333401588;伟,-8.34758311572;貞,-10.3247458083;倡,-8.6718227839;冠,-10.5760602366;規,-6.10197545747;抢,-9.18976587544;春,-8.80839831891;鬧,-8.6718227839;梦,-8.69332898912;帝,-9.95702102815;脫,-12.5219703856;纪,-7.82149001982;爭,-7.7428468925;平,-7.1328986558;术,-7.78577193722;報,-8.51463720038;词,-10.3247458083;逻,-7.97867560334;吹,-8.93845144716;殼,-8.16526155892;輿,-12.5219703856;賴,-12.5219703856;净,-9.882913056;啃,-10.7302109164;狂,-10.3247458083;議,-10.2193852926;職,-8.07931912912;飆,-11.8288232051;汉,-8.41109652144;珍,-8.17816496376;克,-10.9125324732;今,-6.35865558158;前,-6.98070684045;双,-8.96662232412;坏,-9.30309456074;塑,-8.96662232412;逾,-9.68875704156;浓,-11.8288232051;红,-6.72591263485;幕,-11.8288232051;经,-5.64777189016;南,-7.21866547755;相,-6.3502697882;迭,-9.74938166337;鄉,-8.995609861;遥,-8.06762308936;轟,-11.8288232051;賞,-8.10312977782;几,-8.8330909315;散,-10.9125324732;勢,-8.23151094446;霧,-9.08798318113;歧,-8.44443294171;遐,-9.68875704156;淨,-9.882913056;八,-6.79187060264;仪,-11.1356760245;扭,-10.7302109164;杯,-11.4233580969;哮,-10.2193852926;續,-8.09115358677;称,-9.02546282415;荒,-11.1356760245;豆,-9.18976587544;卷,-8.17816496376;胶,-11.8288232051;固,-8.71530789584;秋,-8.8330909315;导,-8.8330909315;使,-9.81392018451;織,-8.91105247297;刀,-8.8330909315;說,-6.72287773115;各,-5.41127426263;丈,-9.81392018451;祖,-9.18976587544;再,-8.78430076733;而,-5.08006365756;瞬,-9.18976587544;褒,-11.4233580969;尔,-9.08798318113;化,-5.5836859016;嘘,-12.5219703856;甚,-8.02216071528;妝,-11.8288232051;伞,-8.0111108791;採,-12.5219703856;谱,-8.47891911778;罚,-10.0370637358;斥,-12.5219703856;碧,-10.9125324732;符,-12.5219703856;義,-9.52623811206;话,-6.13005327222;劫,-9.74938166337;洪,-8.60994738018;韶,-7.70168882001;騰,-10.7302109164;纳,-10.5760602366;纲,-11.8288232051;樓,-11.8288232051;水,-6.45818517692;傷,-11.8288232051;月,-9.38647616968;敞,-9.882913056;犊,-11.1356760245;格,-8.76077026992;貿,-6.2138719441;所,-5.57499439348;萊,-11.1356760245;病,-10.1240751128;鑄,-9.52623811206;壇,-9.882913056;筆,-9.18976587544;么,-8.78430076733;凍,-11.1356760245;灌,-9.02546282415;译,-8.995609861;頹,-11.1356760245;仓,-9.882913056;饒,-10.2193852926;邮,-9.81392018451;卖,-9.12077300395;知,-6.93472172721;虚,-8.33231564359;画,-9.63159862772;鹤,-11.8288232051;鏡,-10.5760602366;抑,-12.5219703856;難,-6.4171771532;慢,-8.995609861;日,-6.14354420196;学,-5.18764103531;翩,-9.26387384759;帽,-8.73778075169;浪,-7.88724139738;凭,-11.4233580969;顰,-9.52623811206;绳,-11.8288232051;怒,-8.47891911778;淵,-8.8330909315;培,-8.76077026992;陸,-11.4233580969;褴,-9.57753140645;持,-11.4233580969;技,-9.47744794789;憂,-11.8288232051;锅,-8.8330909315;标,-9.30309456074;載,-7.44679657038;予,-11.8288232051;越,-9.68875704156;肌,-10.5760602366;搏,-10.7302109164;瞎,-9.52623811206;笑,-7.51802407967;檐,-11.1356760245;专,-7.65443593516;滂,-9.81392018451;岔,-9.74938166337;耗,-10.9125324732;缘,-10.0370637358;喚,-11.4233580969;颜,-9.12077300395;從,-7.90684986877;挡,-9.81392018451;加,-8.10312977782;蔥,-11.4233580969;聰,-10.3247458083;缩,-8.93845144716;额,-12.5219703856;别,-8.85840873948;警,-9.26387384759;悬,-8.85840873948;启,-9.38647616968;鬱,-10.9125324732;誰,-9.81392018451;贵,-9.30309456074;貴,-9.30309456074;耷,-10.3247458083;燈,-10.5760602366;興,-7.83983915849;隸,-7.18443230591;稻,-8.78430076733;见,-7.17486285489;碼,-9.882913056;达,-5.02476316241;十,-6.9309834051;狀,-6.22670438417;懂,-8.33231564359;故,-11.4233580969;密,-9.47744794789;轉,-7.7945825669;终,-9.81392018451;手,-6.81154336824;緊,-6.81486012086;免,-8.6718227839;背,-10.3247458083;集,-9.63159862772;城,-11.8288232051;闹,-8.6718227839;角,-7.93700290694;絕,-7.69365664831;捏,-11.8288232051;遗,-10.7302109164;取,-8.06762308936;臉,-8.80839831891;盘,-8.42762582339;嗚,-8.44443294171;需,-9.882913056;補,-7.307034628;江,-7.80347151432;连,-7.94725940711;卡,-9.81392018451;狠,-9.05623448281;陣,-7.29086176876;略,-9.882913056;顧,-8.34758311572;實,-4.381071925;彩,-8.21790529241;醬,-10.5760602366;扫,-10.4425288439;淪,-12.5219703856;六,-9.22613351961;乳,-9.05623448281;绿,-9.74938166337;偷,-10.5760602366;叶,-12.5219703856;睹,-10.7302109164;書,-9.882913056;旺,-8.85840873948;好,-7.18443230591;與,-8.85840873948;重,-6.1267087875;妇,-10.5760602366;争,-7.7428468925;压,-9.05623448281;尊,-10.4425288439;明,-7.3744759088;遙,-8.06762308936;谆,-10.1240751128;疯,-10.9125324732;或,-7.90684986877;團,-8.07931912912;縮,-8.93845144716;條,-7.18443230591;夜,-7.94725940711;务,-6.85208946263;匠,-10.9125324732;垣,-11.1356760245;逢,-10.4425288439;唤,-11.4233580969;莫,-7.84914155115;覆,-9.34391655526;傭,-7.58749645248;犢,-11.1356760245;斯,-12.5219703856;诸,-7.75979645081;贴,-11.4233580969;冷,-7.70978603024;制,-6.39292017555;霸,-10.0370637358;携,-11.8288232051;礼,-8.47891911778;綿,-8.16526155892;举,-8.28786388101;區,-9.95702102815;遂,-12.5219703856;铅,-11.8288232051;界,-5.94133124833;送,-9.74938166337;廉,-9.43092793225;彈,-10.1240751128;友,-8.93845144716;届,-11.8288232051;鎖,-7.96809349401;慌,-11.8288232051;族,-7.83983915849;虎,-8.8330909315;子,-5.75577867095;離,-10.1240751128;法,-5.5865999396;剖,-11.8288232051;蛙,-12.5219703856;毛,-10.5760602366;賺,-11.4233580969;裝,-5.82247004545;玻,-8.49661869488;跟,-9.57753140645;繞,-12.5219703856;趨,-10.1240751128;恢,-10.2193852926;阋,-12.5219703856;婦,-10.5760602366;轨,-9.22613351961;叫,-9.57753140645;瓦,-10.9125324732;热,-7.42210395779;公,-6.04807968926;孰,-9.52623811206;系,-5.78737872564;懷,-8.23151094446;扶,-12.5219703856;曹,-12.5219703856;缕,-12.5219703856;寻,-7.98937089246;渾,-12.5219703856;壽,-12.5219703856;楼,-11.8288232051;粉,-12.5219703856;幾,-8.8330909315;刁,-11.8288232051;會,-5.2235252841;鋪,-9.882913056;善,-8.23151094446;备,-8.39483600057;三,-6.33165497976;侈,-11.1356760245;視,-9.74938166337;倍,-11.8288232051;濃,-11.8288232051;攏,-9.18976587544;階,-6.10687342644;娑,-12.5219703856;父,-9.02546282415;鼓,-8.995609861;財,-8.42762582339;药,-10.1240751128;青,-8.16526155892;講,-9.882913056;森,-10.0370637358;榜,-9.81392018451;负,-7.60198945978;組,-7.25928019671;掠,-10.7302109164;圣,-8.91105247297;营,-9.95702102815;斤,-11.4233580969;大,-5.0033631688;温,-7.93700290694;羨,-9.43092793225;猫,-9.882913056;處,-7.2962237119;冬,-8.85840873948;唯,-8.8330909315;皮,-6.71985201024;稱,-9.02546282415;记,-8.2453042666;雲,-8.33231564359;队,-7.70168882001;状,-6.22670438417;牵,-10.5760602366;栽,-9.81392018451;辅,-10.2193852926;说,-6.72287773115;权,-6.79838528366;烂,-8.85840873948;奇,-9.26387384759;肠,-7.60198945978;义,-9.52623811206;迈,-12.5219703856;鍋,-8.8330909315;泊,-10.3247458083;遍,-9.38647616968;凌,-10.9125324732;問,-7.580327963;盎,-8.995609861;齐,-8.71530789584;项,-8.96662232412;体,-6.12837963166;探,-9.38647616968;展,-5.17983865503;藏,-9.81392018451;懸,-8.85840873948;起,-5.52163592534;鸦,-10.7302109164;據,-9.02546282415;鹄,-12.5219703856;纤,-6.4171771532;叠,-10.9125324732;藤,-11.8288232051;蘋,-10.9125324732;繩,-11.8288232051;虽,-11.1356760245;卫,-9.26387384759;泪,-7.56614332801;恭,-11.1356760245;目,-7.19896040647;話,-6.13005327222;佳,-10.7302109164;棲,-8.25929050857;巴,-8.55167847206;具,-6.50094703626;席,-7.31796369854;死,-7.69365664831;擺,-7.307034628;滾,-8.76077026992;蜂,-11.4233580969;躇,-10.7302109164;須,-11.8288232051;權,-6.79838528366;融,-9.34391655526;昌,-7.7428468925;腔,-9.30309456074;犬,-11.1356760245;给,-9.30309456074;颓,-11.1356760245;宕,-8.57072666703;暗,-8.85840873948;錯,-9.52623811206;爺,-11.1356760245;錚,-9.95702102815;依,-10.1240751128;东,-7.97867560334;迎,-9.882913056;吠,-11.8288232051;患,-8.96662232412;接,-8.11525113835;煩,-9.74938166337;产,-4.65256867304;碰,-9.47744794789;犯,-9.22613351961;綱,-11.8288232051;殉,-11.4233580969;漲,-11.4233580969;段,-7.32901353472;訴,-8.41109652144;收,-7.73447864283;耸,-9.63159862772;治,-5.81266604535;区,-9.95702102815;帼,-12.5219703856;調,-7.44056602063;夾,-8.80839831891;旁,-8.17816496376;胃,-10.9125324732;杂,-8.93845144716;雞,-9.882913056;织,-8.91105247297;觉,-8.21790529241;案,-9.52623811206;擋,-9.81392018451;韵,-10.1240751128;煎,-12.5219703856;跑,-9.26387384759;豐,-10.0370637358;壓,-9.05623448281;归,-9.74938166337;试,-9.63159862772;鳥,-10.9125324732;泛,-8.85840873948;博,-12.5219703856;保,-7.16538411094;耻,-10.4425288439;神,-6.32756499451;辑,-8.78430076733;面,-6.51808331851;句,-10.5760602366;鉤,-12.5219703856;給,-9.30309456074;表,-8.91105247297;歪,-10.5760602366;短,-8.78430076733;噬,-9.43092793225;兮,-9.95702102815;己,-9.02546282415;汰,-12.5219703856;壳,-8.16526155892;洒,-11.8288232051;雷,-8.60994738018;當,-6.89434927192;凹,-10.4425288439;選,-7.3744759088;峻,-9.57753140645;渦,-11.1356760245;忽,-6.98070684045;幼,-9.47744794789;竿,-10.4425288439;锁,-7.96809349401;璀,-11.8288232051;考,-10.5760602366;垂,-9.34391655526;包,-8.28786388101;粗,-10.7302109164;万,-6.9309834051;殊,-9.74938166337;圍,-9.22613351961;戏,-10.0370637358;酬,-11.4233580969;睛,-11.8288232051;沐,-10.4425288439;頓,-10.9125324732;徒,-6.42614582318;檔,-10.2193852926;嘗,-11.1356760245;記,-8.2453042666;鄙,-9.68875704156;傘,-8.0111108791;厚,-9.74938166337;绣,-10.9125324732;溜,-9.12077300395;發,-6.27974712016;赋,-9.52623811206;連,-7.94725940711;枢,-7.04969971194;挥,-10.7302109164;护,-8.85840873948;丧,-8.10312977782;獰,-11.8288232051;天,-5.95952629192;墨,-8.8330909315;含,-10.5760602366;宪,-10.9125324732;石,-8.19123704533;贱,-10.9125324732;農,-8.69332898912;茫,-10.5760602366;脹,-8.47891911778;炸,-7.8585312915;食,-6.41272280285;谢,-9.63159862772;禾,-10.9125324732;哀,-10.0370637358;淆,-10.9125324732;奉,-9.22613351961;遊,-7.60198945978;诊,-11.8288232051;雌,-8.93845144716;燎,-11.1356760245;浑,-12.5219703856;鐵,-8.05606226696;術,-7.78577193722;產,-4.65256867304;蹦,-8.85840873948;體,-6.12837963166;煙,-7.72617984002;烘,-11.1356760245;揚,-10.0370637358;络,-10.4425288439;機,-5.92755692586;葺,-10.2193852926;勤,-11.8288232051;左,-8.57072666703;磨,-9.15467455563;葫,-9.52623811206;副,-8.36308730225;統,-7.41602491171;泰,-11.4233580969;毒,-7.47854526869;时,-5.3148515294;腹,-9.68875704156;录,-10.4425288439;类,-7.3744759088;载,-7.44679657038;溫,-7.93700290694;穿,-10.5760602366;雾,-9.08798318113;攀,-11.8288232051;鸡,-9.882913056;錄,-10.4425288439;澇,-8.96662232412;将,-9.95702102815;避,-6.18691613411;斋,-11.1356760245;訊,-10.3247458083;較,-11.8288232051;怎,-7.01258204898;留,-8.09115358677;覓,-10.3247458083;誕,-10.3247458083;笔,-9.18976587544;林,-8.73778075169;搖,-9.22613351961;備,-8.39483600057;涛,-8.91105247297;刚,-10.3247458083;薄,-8.995609861;报,-8.51463720038;館,-11.4233580969;横,-8.41109652144;本,-6.01469267323;环,-6.35655253138;苜,-10.7302109164;粱,-11.1356760245;細,-7.55912575535;文,-5.89525263636;串,-9.34391655526;搶,-9.18976587544;点,-8.49661869488;脸,-8.80839831891;刺,-8.71530789584;似,-8.96662232412;访,-8.73778075169;破,-8.71530789584;品,-6.61388744744;燃,-8.85840873948;時,-5.3148515294;担,-8.03333401588;过,-5.9302966536;屆,-11.8288232051;奈,-9.52623811206;骤,-10.4425288439;過,-5.9302966536;結,-7.08389107669;蹒,-9.57753140645;齒,-10.0370637358;绝,-7.69365664831;作,-4.90617931358;察,-10.7302109164;盤,-8.42762582339;員,-9.81392018451;釣,-9.74938166337;癢,-10.9125324732;拥,-11.1356760245;执,-10.4425288439;忧,-11.8288232051;票,-9.882913056;触,-11.4233580969;可,-4.91857104587;遮,-9.95702102815;走,-8.09115358677;干,-7.41602491171;執,-10.4425288439;薩,-9.30309456074;價,-4.59320406399;腸,-7.60198945978;添,-10.5760602366;牺,-9.68875704156;份,-6.98858089688;彼,-8.6718227839;寿,-12.5219703856;顾,-8.34758311572;翁,-10.7302109164;皂,-8.85840873948;饭,-8.93845144716;妈,-6.64985259614;锋,-9.12077300395;炎,-11.8288232051;少,-7.68568847866;餓,-10.7302109164;互,-5.68035490913;朗,-9.18976587544;辘,-9.15467455563;這,-8.25929050857;紛,-9.68875704156;丝,-9.22613351961;澜,-8.57072666703;增,-9.95702102815;酱,-10.5760602366;暢,-11.8288232051;別,-8.85840873948;弧,-12.5219703856;沦,-12.5219703856;拢,-9.18976587544;窪,-8.76077026992;昭,-12.5219703856;摳,-12.5219703856;匯,-8.59014475289;炮,-9.30309456074;就,-5.25724020768;默,-8.36308730225;亲,-7.95762219414;宴,-10.9125324732;貌,-9.74938166337;活,-6.693024768;丽,-11.8288232051;滋,-8.57072666703;更,-10.7302109164;元,-7.24385572638;腊,-9.22613351961;艷,-9.95702102815;賦,-9.52623811206;览,-8.76077026992;竊,-10.5760602366;降,-9.74938166337;协,-9.43092793225;籌,-8.25929050857;还,-8.13994375094;比,-6.51070321121;块,-11.1356760245;應,-7.49153246422;臘,-9.22613351961;赛,-10.3247458083;獎,-11.4233580969;九,-9.47744794789;远,-8.73778075169;壞,-9.30309456074;无,-4.9904180042;慣,-12.5219703856;团,-8.07931912912;剥,-10.9125324732;古,-6.14184784871;峦,-11.8288232051;畫,-9.63159862772;银,-12.5219703856;卯,-10.4425288439;鋼,-9.882913056;山,-6.419411791;女,-7.8124401843;軲,-11.8288232051;贯,-11.4233580969;湿,-8.12752123094;坷,-10.3247458083;瓶,-9.68875704156;凸,-8.85840873948;瑜,-10.5760602366;鹽,-8.8330909315;翼,-12.5219703856;達,-5.02476316241;极,-7.71794934088;嘀,-9.63159862772;劃,-7.00854163945;點,-8.49661869488;内,-8.60994738018;雄,-6.78862910871;恥,-10.4425288439;安,-8.41109652144;計,-8.30246268044;養,-7.53153779883;紀,-7.82149001982;同,-6.25666917287;邏,-7.97867560334;猎,-12.5219703856;徑,-8.6718227839;渐,-10.3247458083;誓,-12.5219703856;樂,-7.05391024448;支,-10.7302109164;圖,-8.57072666703;战,-6.75364938982;脚,-9.74938166337;涝,-8.96662232412;盛,-7.72617984002;澈,-9.74938166337;劣,-8.30246268044;攢,-8.60994738018;冥,-8.23151094446;沧,-10.5760602366;让,-10.0370637358;太,-10.4425288439;断,-7.60198945978;听,-9.43092793225;献,-9.68875704156;丰,-10.0370637358;媳,-12.5219703856;育,-7.90684986877;場,-7.4850177832;券,-10.3247458083;麻,-8.11525113835;綽,-9.68875704156;尼,-10.3247458083;萬,-6.9309834051;款,-10.0370637358;勃,-8.23151094446;渊,-8.8330909315;資,-3.99443090214;轆,-9.15467455563;诉,-8.41109652144;蛋,-6.82823824681;像,-9.22613351961;华,-11.1356760245;近,-8.27347514356;乐,-7.05391024448;酰,-8.6718227839;塔,-12.5219703856;叙,-10.4425288439;党,-8.96662232412;距,-9.26387384759;猻,-9.81392018451;视,-9.74938166337;示,-8.76077026992;敢,-7.42210395779;蘆,-12.5219703856;灤,-9.30309456074;糧,-11.8288232051;潦,-10.7302109164;科,-5.36657408372;奪,-8.85840873948;闭,-9.52623811206;聽,-9.43092793225;惯,-12.5219703856;据,-9.02546282415;俱,-7.88724139738;买,-8.39483600057;諳,-10.3247458083;戒,-11.1356760245;羡,-9.43092793225;靈,-9.05623448281;叹,-8.53298633905;底,-9.05623448281;任,-9.30309456074;腺,-7.42210395779;誠,-10.5760602366;鱼,-9.18976587544;缔,-7.64677306241;省,-11.1356760245;嚀,-9.81392018451;臟,-10.7302109164;還,-8.13994375094;將,-9.95702102815;來,-6.27199514335;頁,-10.4425288439;瘋,-10.9125324732;砖,-11.1356760245;和,-9.30309456074;透,-9.05623448281;豬,-11.1356760245;休,-9.15467455563;庐,-11.1356760245;娓,-9.882913056;飯,-8.93845144716;猙,-9.52623811206;折,-9.95702102815;丛,-9.08798318113;间,-6.93847407683;醛,-10.9125324732;臆,-10.5760602366;实,-4.381071925;辦,-8.39483600057;鬩,-12.5219703856;骨,-8.2453042666;萝,-10.5760602366;蔭,-11.4233580969;咬,-10.1240751128;缺,-10.4425288439;弱,-8.36308730225;稳,-12.5219703856;絲,-9.22613351961;袴,-11.1356760245;架,-9.02546282415;主,-6.72287773115;粼,-10.5760602366;宾,-10.9125324732;雀,-8.78430076733;雨,-8.41109652144;糊,-8.03333401588;充,-8.93845144716;汇,-8.59014475289;顿,-10.9125324732;等,-6.06050220926;晋,-10.9125324732;韻,-10.1240751128;偏,-9.05623448281;車,-10.2193852926;潑,-10.7302109164;巒,-11.8288232051;敏,-9.63159862772;著,-6.31539445889;頻,-10.7302109164;腳,-9.74938166337;黎,-8.04463357113;鵝,-10.7302109164;賜,-10.2193852926;诞,-10.3247458083;坡,-8.69332898912;因,-8.78430076733;扣,-10.4425288439;闢,-9.08798318113;入,-7.11929300374;聚,-9.882913056;当,-6.89434927192;息,-8.69332898912;叮,-9.68875704156;影,-8.28786388101;仰,-9.95702102815;已,-7.19896040647;極,-7.71794934088;詩,-10.7302109164;质,-8.49661869488;風,-5.90456740764;幻,-9.68875704156;出,-7.12834283926;泼,-10.7302109164;桿,-7.91680019962;蚁,-12.5219703856;漁,-10.7302109164;掃,-10.4425288439;踪,-10.7302109164;傅,-11.8288232051;億,-9.38647616968;臭,-11.4233580969;蚀,-10.7302109164;型,-8.44443294171;拖,-9.08798318113;熏,-8.96662232412;云,-8.33231564359;轎,-9.52623811206;讓,-10.0370637358;斗,-6.63864799712;嘖,-9.47744794789;錘,-10.1240751128;供,-7.5383637639;通,-6.45354479737;豪,-8.96662232412;紜,-12.5219703856;賀,-11.4233580969;樞,-7.04969971194;眠,-9.68875704156;掣,-9.95702102815;肥,-8.28786388101;灭,-11.1356760245;並,-8.57072666703;窩,-9.57753140645;笨,-9.52623811206;里,-7.21370268821;堪,-8.93845144716;攬,-6.51315720017;鴻,-12.5219703856;估,-9.43092793225;害,-10.5760602366;头,-5.81633129075;喷,-10.9125324732;薪,-12.5219703856;抹,-9.81392018451;债,-9.57753140645;洼,-8.76077026992;杀,-8.60994738018;參,-7.40998259726;熊,-11.1356760245;僅,-7.11479861415;兄,-9.18976587544;玉,-10.9125324732;珠,-10.7302109164;塊,-11.1356760245;操,-8.80839831891;敌,-8.995609861;量,-7.86801003545;剎,-8.8330909315;滑,-12.5219703856;罐,-9.52623811206;船,-10.4425288439;磕,-11.4233580969;奔,-8.96662232412;旗,-9.34391655526;務,-6.85208946263;进,-6.86948120534;做,-8.31727776622;离,-10.1240751128;租,-8.15252253315;詞,-10.3247458083;盡,-7.38617194856;鬢,-10.7302109164;口,-7.44679657038;慧,-9.81392018451;巧,-10.3247458083;书,-9.882913056;郎,-9.38647616968;荷,-11.1356760245;苦,-8.06762308936;哭,-9.68875704156;敬,-9.95702102815;野,-9.63159862772;扮,-9.52623811206;铁,-8.05606226696;總,-9.57753140645;棵,-10.9125324732;旷,-12.5219703856;陶,-9.15467455563;苹,-10.9125324732;翻,-8.91105247297;遺,-10.7302109164;峽,-12.5219703856;荫,-11.4233580969;姿,-8.60994738018;磁,-8.09115358677;范,-12.5219703856;質,-8.49661869488;者,-7.45306618339;熄,-9.52623811206;崇,-9.08798318113;了,-6.89075860379;守,-8.78430076733;國,-4.23645707653;名,-6.58707618999;意,-5.87039851202;丑,-9.68875704156;徐,-10.9125324732;鬓,-10.7302109164;沒,-7.09702036813;暖,-8.44443294171;则,-8.37883565922;滅,-11.1356760245;皇,-9.95702102815;肚,-8.47891911778;尝,-11.1356760245;够,-11.8288232051;語,-8.28786388101;驱,-9.47744794789;钢,-9.882913056;急,-7.39800640621;冤,-10.0370637358;紧,-6.81486012086;亦,-8.76077026992;護,-8.85840873948;末,-8.91105247297;搭,-9.63159862772;斬,-9.95702102815;縱,-8.19123704533;辰,-11.8288232051;笳,-10.2193852926;飲,-9.15467455563;堵,-11.8288232051;速,-8.6507693747;男,-7.92685053548;隶,-7.18443230591;刹,-8.8330909315;輻,-12.5219703856;為,-5.27988802636;尽,-7.38617194856;構,-9.68875704156;練,-11.8288232051;千,-7.55215708604;酷,-9.74938166337;细,-7.55912575535;苍,-9.81392018451;裊,-10.3247458083;驟,-10.4425288439;旌,-9.81392018451;运,-5.72068735114;類,-7.3744759088;委,-7.52475811185;敗,-7.78577193722;盖,-10.2193852926;牙,-8.12752123094;变,-4.97341440644;佛,-9.30309456074;僚,-8.09115358677;汝,-12.5219703856;酸,-9.68875704156;竞,-9.38647616968;荣,-9.18976587544;瓢,-10.1240751128;健,-8.46152737507;凤,-10.5760602366;滦,-9.30309456074;穩,-12.5219703856;災,-6.68423993845;纏,-10.7302109164;藓,-8.6718227839;飽,-9.47744794789;乱,-7.63162125739;塵,-10.5760602366;長,-7.95762219414;零,-9.63159862772;批,-9.15467455563;轻,-8.46152737507;惺,-9.95702102815;汽,-7.60931549988;縫,-11.1356760245;西,-7.26447501358;諾,-8.91105247297;禁,-8.19123704533;親,-7.95762219414;待,-7.52475811185;劇,-8.13994375094;脆,-10.4425288439;閉,-9.52623811206;合,-5.55594619851;軟,-9.95702102815;亏,-7.45937535259;憑,-11.4233580969;耐,-9.81392018451;钓,-9.74938166337;飞,-7.62413058566;阔,-10.0370637358;外,-5.50895459597;嶙,-9.12077300395;尘,-10.5760602366;舊,-8.47891911778;会,-5.2235252841;鑼,-8.69332898912;聯,-7.68568847866;欢,-8.995609861;两,-7.87757948647;犧,-9.68875704156;焦,-11.8288232051;斩,-9.95702102815;萨,-9.30309456074;未,-7.00451748915;箭,-9.63159862772;溯,-9.34391655526;譜,-8.47891911778;熱,-7.42210395779;腮,-8.36308730225;鹜,-11.4233580969;網,-8.93845144716;嘴,-9.38647616968;永,-9.68875704156;邻,-8.93845144716;强,-7.03717345212;放,-8.30246268044;私,-8.80839831891;础,-7.92685053548;必,-6.87299614745;谈,-8.69332898912;勇,-10.5760602366;醜,-9.68875704156;论,-5.8077998557;母,-8.71530789584;律,-10.1240751128;济,-5.98383056184;金,-7.20876440657;恐,-9.74938166337;独,-7.90684986877;奖,-11.4233580969;編,-8.91105247297;滥,-11.8288232051;烛,-10.5760602366;礎,-7.92685053548;啞,-11.8288232051;疑,-6.47933755193;賣,-9.12077300395;止,-8.42762582339;诧,-10.3247458083;拧,-11.1356760245;腦,-6.98070684045;早,-8.28786388101;周,-8.31727776622;士,-10.9125324732;语,-8.28786388101;马,-8.13994375094;浮,-9.05623448281;灰,-8.39483600057;辩,-9.68875704156;言,-6.01469267323;噴,-10.9125324732;奶,-10.3247458083;淹,-10.4425288439;设,-11.8288232051;揽,-6.51315720017;扼,-9.05623448281;替,-10.4425288439;调,-7.44056602063;切,-8.19123704533;针,-10.5760602366;铺,-9.882913056;脑,-6.98070684045;香,-9.57753140645;排,-8.78430076733;隔,-7.77703825725;振,-8.995609861;紙,-10.9125324732;蹿,-9.22613351961;座,-10.7302109164;星,-8.51463720038;飄,-10.3247458083;氣,-5.77673403613;客,-8.53298633905;弥,-8.6301500875;交,-8.07931912912;腰,-10.1240751128;璨,-10.4425288439;枪,-10.4425288439;脱,-12.5219703856;證,-7.66215798125;色,-7.01258204898;朵,-9.38647616968;嚴,-12.5219703856;直,-8.76077026992;费,-6.97289430072;总,-9.57753140645;脏,-10.7302109164;蘿,-10.5760602366;烹,-11.8288232051;籃,-10.4425288439;滄,-10.5760602366;則,-8.37883565922;准,-7.65443593516;蕉,-10.9125324732;哈,-6.37136761717;恶,-9.63159862772;那,-9.47744794789;贅,-11.8288232051;插,-9.882913056;蝕,-10.7302109164;赴,-11.4233580969;荏,-11.8288232051;臻,-10.4425288439;號,-9.81392018451;村,-10.3247458083;黄,-8.25929050857;令,-7.89699757233;剧,-8.13994375094;燦,-10.2193852926;衫,-9.57753140645;湯,-10.7302109164;差,-7.53153779883;共,-6.72287773115;遷,-10.3247458083;味,-9.95702102815;史,-6.97679294113;围,-9.22613351961;穷,-11.8288232051;熔,-12.5219703856;狼,-8.93845144716;梁,-11.4233580969;态,-7.63162125739;挪,-12.5219703856;弄,-12.5219703856;率,-8.995609861;逆,-9.68875704156;钉,-10.1240751128;辭,-8.47891911778;見,-7.17486285489;軸,-8.39483600057;認,-7.55215708604;導,-8.8330909315;間,-6.93847407683;划,-7.00854163945;蚕,-12.5219703856;算,-9.882913056;栖,-8.25929050857;沙,-10.2193852926;军,-6.98463611859;业,-6.02973055059;鈴,-10.0370637358;构,-9.68875704156;夠,-11.8288232051;趣,-9.95702102815;亥,-11.4233580969;伤,-11.8288232051;谁,-9.81392018451;氰,-11.4233580969;钩,-12.5219703856;用,-6.65833921001;損,-9.30309456074;领,-6.86948120534;第,-7.83983915849;辯,-9.68875704156;鄰,-8.93845144716;戲,-10.0370637358;朴,-11.1356760245;麼,-8.78430076733;蠶,-12.5219703856;油,-7.95762219414;贸,-6.2138719441;冻,-11.1356760245;为,-5.27988802636;芽,-10.4425288439;吾,-12.5219703856;壁,-11.1356760245;条,-7.18443230591;跃,-7.84914155115;仅,-7.11479861415;恆,-9.34391655526;哉,-11.8288232051;效,-8.00018180856;始,-7.35718441169;洶,-8.96662232412;歌,-7.55215708604;掌,-10.1240751128;惑,-9.15467455563;腐,-8.41109652144;翘,-11.1356760245;芳,-12.5219703856;式,-6.92354842661;诗,-10.7302109164;砸,-11.4233580969;郊,-11.1356760245;赘,-11.8288232051;勝,-7.307034628;卜,-10.3247458083;裡,-7.21370268821;緣,-10.0370637358;挺,-9.34391655526;以,-4.98560644721;哩,-12.5219703856;噪,-8.91105247297;雙,-8.96662232412;俯,-11.1356760245;猪,-11.1356760245;割,-8.59014475289;请,-10.9125324732;顶,-10.7302109164;浸,-12.5219703856;击,-7.76838019451;社,-6.08262001451;虫,-12.5219703856;矿,-7.35718441169;码,-9.882913056;腫,-7.27494631345;清,-6.75052926248;径,-8.6718227839;指,-7.09702036813;肆,-10.3247458083;吉,-11.8288232051;隊,-7.70168882001;完,-7.60931549988;伏,-8.88438422589;蓬,-12.5219703856;們,-8.93845144716;憐,-11.4233580969;魚,-9.18976587544;灯,-10.5760602366;袖,-10.1240751128;谙,-10.3247458083;毅,-12.5219703856;愛,-9.57753140645;揮,-10.7302109164;初,-10.5760602366;土,-7.03303265946;轱,-11.8288232051;责,-5.71403544191;严,-12.5219703856;群,-7.71794934088;绰,-9.68875704156;夫,-8.80839831891;險,-10.0370637358;設,-11.8288232051;弯,-9.63159862772;粮,-11.8288232051;約,-8.85840873948;冰,-11.4233580969;闲,-7.44679657038;阵,-7.29086176876;弟,-12.5219703856;運,-5.72068735114;人,-4.92658310676;爽,-10.7302109164;蓋,-10.2193852926;觀,-7.83983915849;久,-7.23370335492;升,-11.8288232051;胆,-8.21790529241;葉,-12.5219703856;奋,-9.34391655526;益,-8.53298633905;積,-8.09115358677;富,-8.34758311572;住,-8.42762582339;灑,-11.8288232051;拒,-9.95702102815;晕,-11.4233580969;柔,-12.5219703856;字,-6.22855110677;腾,-10.7302109164;淘,-10.1240751128;滚,-8.76077026992;剝,-10.9125324732;菜,-11.8288232051;束,-11.1356760245;衡,-10.7302109164;翠,-11.8288232051;齋,-11.1356760245;濤,-8.91105247297;烦,-9.74938166337;摩,-9.34391655526;门,-6.14184784871;盪,-8.71530789584;寬,-11.8288232051;软,-9.95702102815;購,-9.08798318113;狲,-9.81392018451;灿,-10.2193852926;歷,-9.74938166337;涨,-11.4233580969;屹,-11.8288232051;养,-7.53153779883;建,-5.58271643957;牽,-10.5760602366;陽,-7.75979645081;板,-9.08798318113;链,-10.7302109164;宁,-11.1356760245;稀,-8.03333401588;射,-8.10312977782;蜀,-10.5760602366;枉,-10.3247458083;骋,-12.5219703856;赖,-12.5219703856;禍,-9.68875704156;真,-6.94602128247;鼎,-8.49661869488;成,-4.83351502906;老,-6.64703965476;迟,-8.73778075169;輯,-8.78430076733;碗,-10.1240751128;龙,-8.60994738018;力,-5.66340535082;級,-6.37993298002;膝,-10.9125324732;怜,-11.4233580969;钟,-11.1356760245;霞,-11.4233580969;管,-6.10687342644;週,-8.31727776622;釘,-10.1240751128;夢,-8.69332898912;尤,-10.9125324732;瞩,-8.02216071528;昆,-12.5219703856;资,-3.99443090214;莱,-11.1356760245;到,-5.46838465842;琴,-10.1240751128;羹,-10.5760602366;常,-8.09115358677;贺,-11.4233580969;膽,-8.21790529241;值,-7.04550683368;眾,-7.00854163945;毁,-11.1356760245;跡,-9.68875704156;练,-11.8288232051;扑,-9.34391655526;立,-9.30309456074;蕊,-11.4233580969;槍,-10.4425288439;行,-6.60039196597;低,-9.34391655526;发,-6.27974712016;輕,-8.46152737507;兒,-7.02890894227;痕,-9.05623448281;膏,-11.4233580969;忙,-8.93845144716;乘,-12.5219703856;招,-9.68875704156;赚,-11.4233580969;針,-10.5760602366;停,-11.1356760245;睞,-8.88438422589;寡,-8.85840873948;代,-7.20385039177;躺,-11.1356760245;工,-5.12440885009;層,-7.32347335435;僧,-10.4425288439;器,-7.3744759088;硬,-7.64677306241;潮,-8.80839831891;艰,-10.4425288439;曳,-11.4233580969;维,-7.23370335492;翹,-11.1356760245;幸,-12.5219703856;函,-8.46152737507;七,-10.4425288439;如,-4.63626499437;紅,-6.72591263485;疗,-9.15467455563;历,-9.74938166337;有,-4.99256392778;暈,-11.4233580969;程,-8.76077026992;喊,-9.43092793225;复,-6.09710136171;碌,-12.5219703856;小,-5.65712260764;澎,-12.5219703856;挑,-8.96662232412;易,-7.97867560334;冒,-9.12077300395;甕,-9.18976587544;殖,-10.1240751128;幅,-12.5219703856;创,-8.53298633905;慮,-9.15467455563;辛,-10.2193852926;順,-9.95702102815;瞞,-8.37883565922;次,-8.47891911778;深,-7.46572458026;鸣,-9.30309456074;津,-10.0370637358;颦,-9.52623811206;性,-5.59834175747;隨,-8.12752123094;喪,-8.10312977782;饱,-9.47744794789;微,-9.47744794789;阳,-7.75979645081;憲,-10.9125324732;电,-5.92618987165;财,-8.42762582339;样,-5.91127434089;家,-6.1217129403;弹,-10.1240751128;庸,-7.78577193722;刻,-8.13994375094;鈞,-12.5219703856;態,-7.63162125739;乃,-10.2193852926;观,-7.83983915849;浅,-9.15467455563;廷,-9.38647616968;假,-8.16526155892;张,-8.96662232412;才,-9.81392018451;车,-10.2193852926;屏,-11.4233580969;菌,-8.78430076733;卑,-12.5219703856;拐,-10.1240751128;噓,-12.5219703856;燒,-10.9125324732;啕,-9.38647616968;擔,-8.03333401588;街,-7.96809349401;余,-4.49384132618;付,-8.27347514356;剛,-10.3247458083;淚,-7.56614332801;惜,-10.5760602366;歡,-8.995609861;章,-7.83062250338;幣,-6.11674192758;賤,-10.9125324732;革,-6.90519928795;追,-8.42762582339;橫,-8.41109652144;带,-8.33231564359;業,-6.02973055059;修,-10.2193852926;危,-7.02071217507;狰,-9.52623811206;諒,-10.7302109164;敵,-8.995609861;拿,-9.81392018451;役,-9.52623811206;绸,-7.11032433376;淺,-9.15467455563;象,-8.47891911778;鑿,-12.5219703856;返,-9.26387384759;謀,-8.59014475289;较,-11.8288232051;堂,-8.34758311572;洄,-10.0370637358;分,-5.46924933638;圈,-8.6301500875;残,-10.5760602366;吊,-10.4425288439;碍,-10.5760602366;与,-8.85840873948;劑,-11.8288232051;錐,-7.73447864283;酒,-10.0370637358;倒,-8.31727776622;咕,-12.5219703856;戰,-6.75364938982;迷,-7.31796369854;优,-8.60994738018;掛,-9.882913056;尚,-7.92685053548;肝,-8.995609861;蒼,-9.81392018451;辣,-10.1240751128;粥,-11.4233580969;贤,-9.08798318113;憧,-11.1356760245;蛮,-11.8288232051;在,-6.26814157404;貧,-8.41109652144;涯,-9.95702102815;帮,-9.95702102815;抱,-10.3247458083;脉,-7.29086176876;瀲,-10.4425288439;泻,-9.57753140645;伸,-11.4233580969;去,-7.89699757233;尺,-9.95702102815;谋,-8.59014475289;賊,-9.81392018451;显,-8.59014475289;嫁,-9.57753140645;心,-6.15206940278;變,-4.97341440644;邦,-12.5219703856;斷,-7.60198945978;采,-12.5219703856;牆,-10.0370637358;曉,-9.57753140645;服,-7.32347335435;告,-7.68568847866;棍,-11.1356760245;乎,-7.14207303207;犹,-7.1328986558;染,-9.38647616968;恒,-9.34391655526;仙,-10.3247458083;換,-6.95362588185;遲,-8.73778075169;兜,-8.91105247297;轿,-9.52623811206;泥,-11.4233580969;赤,-12.5219703856;睨,-12.5219703856;毫,-10.3247458083;路,-5.9524889652;贼,-9.81392018451;英,-9.26387384759;印,-9.18976587544;柳,-12.5219703856;聲,-6.03886303416;整,-10.9125324732;究,-11.4233580969;決,-7.54523664319;能,-6.46753103934;兼,-8.51463720038;百,-6.88006331467;威,-8.25929050857;简,-12.5219703856;弃,-9.95702102815;绪,-12.5219703856;谅,-10.7302109164;着,-6.31539445889;选,-7.3744759088;砍,-11.8288232051;于,-5.89525263636;我,-6.95362588185;掐,-11.4233580969;圓,-8.71530789584;求,-8.53298633905;帙,-9.68875704156;情,-7.06238487147;猛,-7.95762219414;瓮,-9.18976587544;思,-7.60931549988;农,-8.69332898912;生,-5.16059495663;模,-7.47854526869;际,-7.89699757233;造,-6.64143739921;梢,-10.3247458083;艺,-6.11344159455;愧,-10.5760602366;芦,-12.5219703856;缝,-11.1356760245;风,-5.90456740764;陆,-11.4233580969;頭,-5.81633129075;馬,-8.13994375094;累,-8.20448227208;亮,-12.5219703856;爱,-9.57753140645;现,-8.53298633905;悲,-11.8288232051;吵,-9.57753140645;丹,-11.1356760245;医,-8.71530789584;辞,-8.47891911778;政,-5.61421510663;难,-6.4171771532;毀,-11.1356760245;裂,-8.73778075169;居,-9.47744794789;捷,-10.9125324732;兇,-11.4233580969;晉,-10.9125324732;筋,-9.12077300395;擊,-7.76838019451;額,-12.5219703856;赏,-8.10312977782;从,-7.90684986877;剑,-11.4233580969;提,-8.07931912912;胡,-7.98937089246;约,-8.85840873948;嫖,-9.47744794789;忘,-9.26387384759;鍛,-10.9125324732;腻,-11.4233580969;啟,-9.38647616968;回,-6.40607826013;橡,-10.1240751128;黑,-8.85840873948;佣,-7.58749645248;飢,-11.1356760245;履,-8.88438422589;淤,-11.4233580969;內,-8.60994738018;材,-8.03333401588;险,-10.0370637358;孫,-9.52623811206;顺,-9.95702102815;艱,-10.4425288439;台,-9.57753140645;痴,-10.3247458083;競,-9.38647616968;幹,-7.41602491171;裕,-9.57753140645;獻,-9.68875704156;琵,-10.3247458083;偽,-9.30309456074;长,-7.95762219414;图,-8.57072666703;阴,-9.68875704156;异,-6.64423460383;暇,-12.5219703856;戀,-8.76077026992;醉,-10.0370637358;饿,-10.7302109164;耍,-11.8288232051;龍,-8.60994738018;希,-11.8288232051;椎,-6.31741262304;斑,-8.93845144716;吐,-9.81392018451;麗,-11.8288232051;識,-7.04969971194;妙,-10.4425288439;領,-6.86948120534;咛,-9.81392018451;禮,-8.47891911778;枝,-10.2193852926;阜,-10.9125324732;功,-7.93700290694;涡,-11.1356760245;由,-7.59471670045;漢,-8.41109652144;疊,-10.9125324732;膩,-11.4233580969;怨,-8.93845144716;沫,-9.08798318113;匪,-8.59014475289;徭,-9.52623811206;測,-11.4233580969;傳,-7.89699757233;露,-8.73778075169;戴,-12.5219703856;纷,-9.68875704156;师,-8.88438422589;禹,-9.30309456074;核,-8.12752123094;势,-8.23151094446;脾,-10.4425288439;局,-11.4233580969;舆,-12.5219703856;寅,-9.68875704156;蛇,-9.57753140645;商,-7.64677306241;凉,-10.2193852926;半,-7.08389107669;忍,-8.20448227208;乌,-10.4425288439;轴,-8.39483600057;貫,-11.4233580969;仗,-11.1356760245;良,-7.75979645081;願,-11.8288232051;孚,-11.1356760245;馆,-11.4233580969;缠,-10.7302109164;苟,-9.95702102815;淡,-10.7302109164;池,-9.95702102815;形,-6.23040124605;恨,-9.15467455563;高,-6.27780348495;若,-9.15467455563;俭,-8.47891911778;端,-8.91105247297;奮,-9.34391655526;旱,-11.8288232051;想,-4.7615033564;籁,-10.7302109164;鉴,-11.8288232051;价,-4.59320406399;茎,-12.5219703856;濫,-11.8288232051;勿,-12.5219703856;气,-5.77673403613;洁,-8.6301500875;暴,-7.56614332801;疆,-12.5219703856;儉,-8.47891911778;尋,-7.98937089246;逼,-10.4425288439;二,-6.56096504599;瞒,-8.37883565922;黃,-8.25929050857;礙,-10.5760602366;题,-9.81392018451;君,-11.4233580969;定,-5.55406118381;朝,-8.76077026992;竄,-10.7302109164;負,-7.60198945978;鬥,-6.63864799712;誤,-9.882913056;罰,-10.0370637358;音,-7.72617984002;您,-11.1356760245;榮,-9.18976587544;唱,-10.0370637358;環,-6.35655253138;耳,-9.52623811206;試,-9.63159862772;雖,-11.1356760245;縷,-12.5219703856;夹,-8.80839831891;郵,-9.81392018451;殺,-8.60994738018;朽,-10.3247458083;嚼,-9.63159862772;房,-11.4233580969;流,-6.30936428986;计,-8.30246268044;桃,-10.9125324732;膊,-10.5760602366;混,-9.26387384759;光,-7.32347335435;烈,-9.882913056;及,-9.26387384759;位,-7.75128576115;軌,-9.22613351961;救,-8.0111108791;道,-6.58972519816;单,-8.13994375094;拔,-9.74938166337;幗,-12.5219703856;歸,-9.74938166337;棘,-12.5219703856;葛,-10.3247458083;诚,-10.5760602366;雜,-8.93845144716;絡,-10.4425288439;鵑,-11.8288232051;档,-10.2193852926;迢,-11.4233580969;步,-6.43066050353;虧,-7.45937535259;旦,-10.4425288439;兩,-7.87757948647;賽,-10.3247458083;豫,-9.18976587544;们,-8.93845144716;螞,-9.12077300395;理,-5.84362827096;擰,-11.1356760245;聳,-9.63159862772;蟲,-12.5219703856;卵,-10.9125324732;限,-5.71403544191;捕,-10.9125324732;诺,-8.91105247297;盼,-11.1356760245;承,-9.18976587544;臾,-10.1240751128;岁,-9.63159862772;币,-6.11674192758;市,-7.26969695757;輔,-10.2193852926;欄,-10.9125324732;吆,-11.4233580969;肉,-7.83062250338;愈,-7.45937535259;趋,-10.1240751128;刊,-9.882913056;躍,-7.84914155115;宏,-11.1356760245;锣,-8.69332898912;锐,-11.4233580969;豎,-10.4425288439;投,-9.30309456074;得,-5.74889000996;尖,-10.0370637358;墙,-10.0370637358;項,-8.96662232412;蜜,-10.1240751128;原,-9.43092793225;没,-7.09702036813;素,-10.5760602366;否,-9.12077300395;肩,-8.12752123094;眉,-8.44443294171;庭,-8.76077026992;讯,-10.3247458083;钱,-10.3247458083;田,-7.4039765732;决,-7.54523664319;防,-7.86801003545;抵,-9.02546282415;猴,-12.5219703856;德,-11.1356760245;喻,-10.7302109164;診,-11.8288232051;朋,-8.03333401588;倾,-9.68875704156;況,-9.30309456074;邊,-8.47891911778;摆,-7.307034628;先,-8.46152737507;淋,-8.6507693747;猶,-7.1328986558;軍,-6.98463611859;彌,-8.6301500875;每,-9.02546282415;哑,-11.8288232051;边,-8.47891911778;锥,-7.73447864283;動,-4.64837259593;協,-9.43092793225;俗,-9.34391655526;游,-7.60198945978;飙,-11.8288232051;痛,-10.7302109164;驚,-7.91680019962;靜,-12.5219703856;聞,-9.18976587544;峡,-12.5219703856;鵠,-12.5219703856;解,-7.22866556089;蛤,-10.7302109164;童,-8.53298633905;孤,-11.1356760245;辐,-12.5219703856;費,-6.97289430072;全,-7.88724139738;续,-8.09115358677;转,-7.7945825669;误,-9.882913056;确,-8.6301500875;数,-6.53551838033;至,-7.07523301395;粒,-8.73778075169;虐,-11.4233580969;部,-5.13984601987;奸,-11.1356760245;闻,-9.18976587544;空,-6.83499502927;国,-4.23645707653;茶,-12.5219703856;灾,-6.68423993845;封,-8.49661869488;证,-7.66215798125;亂,-7.63162125739;洗,-10.1240751128;震,-8.8330909315;倉,-9.882913056;洋,-6.74431806239;把,-7.3744759088;不,-3.01978163231;後,-6.39292017555;廬,-11.1356760245;向,-7.34582065304;扯,-9.18976587544;众,-7.00854163945;殘,-10.5760602366;骚,-11.4233580969;黨,-8.96662232412;果,-8.6718227839;簡,-12.5219703856;綠,-9.74938166337;溢,-9.95702102815;娥,-9.882913056;认,-7.55215708604;闪,-8.04463357113;钦,-10.7302109164;膨,-5.36034838267;贫,-8.41109652144;努,-8.78430076733;中,-4.84503323979;木,-7.49153246422;斜,-9.52623811206;新,-8.15252253315;鼻,-9.15467455563;感,-6.80494268421;強,-7.03717345212;根,-7.71794934088;獵,-12.5219703856;攻,-11.4233580969;雪,-9.95702102815;請,-10.9125324732;傾,-9.68875704156;屁,-9.882913056;淀,-12.5219703856;廂,-10.7302109164;驅,-9.47744794789;範,-12.5219703856;均,-7.75128576115;蛾,-10.5760602366;偉,-8.34758311572;懈,-8.85840873948;测,-11.4233580969;职,-8.07931912912;鑑,-11.8288232051;罗,-9.52623811206;胸,-11.1356760245;秘,-8.93845144716;彎,-9.63159862772;损,-9.30309456074;屡,-9.43092793225;締,-7.64677306241;组,-7.25928019671;廢,-9.05623448281;货,-5.27346631324;爛,-8.85840873948;擦,-10.4425288439;恩,-10.4425288439;臨,-9.34391655526;度,-9.08798318113;结,-7.08389107669;譯,-8.995609861;壮,-7.83983915849;葱,-11.4233580969;关,-5.37756320529;曲,-8.46152737507;創,-8.53298633905;讨,-10.3247458083;迁,-10.3247458083;觸,-11.4233580969;華,-11.1356760245;白,-7.05391024448;卿,-12.5219703856;一,-4.35206773825;窃,-10.5760602366;撇,-11.8288232051;圆,-8.71530789584;掉,-8.88438422589;戈,-11.4233580969;事,-6.23411182545;焊,-12.5219703856;鋒,-9.12077300395;这,-8.25929050857;抓,-8.73778075169;攒,-8.60994738018;途,-7.69365664831;岗,-10.3247458083;编,-8.91105247297;宙,-7.20385039177;娘,-8.93845144716;際,-7.89699757233;多,-6.19046853572;喝,-8.39483600057;搜,-12.5219703856;照,-8.51463720038;索,-9.05623448281;堤,-12.5219703856;钧,-12.5219703856;享,-10.7302109164;優,-8.60994738018;維,-7.23370335492;梯,-11.8288232051;遜,-9.81392018451;劳,-5.6385077992;甲,-10.9125324732;况,-9.30309456074;買,-8.39483600057;伶,-12.5219703856;容,-5.77086891668;樸,-11.1356760245;夺,-8.85840873948;施,-11.4233580969;開,-6.53300896872;肿,-7.27494631345;慨,-8.93845144716;种,-5.86524386143;終,-9.81392018451;觅,-10.3247458083;杆,-7.91680019962;叉,-10.2193852926;版,-9.68875704156;介,-8.60994738018;溶,-8.995609861;廣,-8.28786388101;纖,-6.4171771532;拓,-9.63159862772;鳴,-9.30309456074;联,-7.68568847866;花,-6.05738208192;藥,-10.1240751128;四,-7.26969695757;藝,-6.11344159455;呜,-8.44443294171;烟,-7.72617984002;汤,-10.7302109164;信,-7.33458457977;肺,-12.5219703856;烧,-10.9125324732;坦,-11.1356760245;菩,-12.5219703856;衣,-9.52623811206;盈,-7.72617984002;武,-6.21023557646;屬,-8.05606226696;壯,-7.83983915849;涼,-10.2193852926;晰,-8.6301500875;拳,-10.4425288439;敲,-10.9125324732;懵,-9.12077300395;愿,-11.8288232051;对,-5.80658699928;電,-5.92618987165;呼,-7.31796369854;企,-7.84914155115;预,-8.60994738018;騷,-11.4233580969;按,-12.5219703856;燭,-10.5760602366;下,-5.3163352092;憊,-8.2453042666;納,-10.5760602366;漸,-10.3247458083;栏,-10.9125324732;論,-5.8077998557;閒,-7.44679657038;悔,-9.30309456074;餘,-4.49384132618;置,-7.71794934088;借,-10.3247458083;樣,-5.91127434089;綢,-7.11032433376;谐,-10.4425288439;动,-4.64837259593;師,-8.88438422589;盆,-9.882913056;购,-9.08798318113;責,-5.71403544191;议,-10.2193852926;擁,-11.1356760245;阶,-6.10687342644;簷,-11.1356760245;鏈,-10.7302109164;覺,-8.21790529241;蔽,-11.4233580969;撼,-12.5219703856;耿,-11.4233580969;什,-5.42029441399;惊,-7.91680019962;棄,-9.95702102815;摇,-9.22613351961;蟆,-10.7302109164;草,-8.41109652144;院,-10.3247458083;之,-4.56479306215;释,-8.995609861;销,-9.18976587544;顏,-9.12077300395;坑,-8.80839831891;盐,-8.8330909315;打,-7.06664927025;痒,-10.9125324732;腕,-11.4233580969;饥,-11.1356760245;汗,-8.80839831891;孙,-9.52623811206;芥,-10.9125324732;虛,-8.33231564359;敝,-12.5219703856;瓜,-11.8288232051;齿,-10.0370637358;廠,-11.4233580969;騁,-12.5219703856;巢,-8.6507693747;祥,-9.95702102815;迹,-9.68875704156;幫,-9.95702102815;自,-6.85900990548;顯,-8.59014475289;篮,-10.4425288439;東,-7.97867560334;困,-10.3247458083;艳,-9.95702102815;嗲,-10.1240751128;兵,-8.93845144716;筹,-8.25929050857;諸,-7.75979645081;登,-10.7302109164;偿,-10.3247458083;現,-8.53298633905;开,-6.53300896872;訪,-8.73778075169;袅,-10.3247458083;处,-7.2962237119;喇,-11.4233580969;嘆,-8.53298633905;纭,-12.5219703856;例,-7.63162125739;逊,-9.81392018451;布,-9.81392018451;福,-11.1356760245;討,-10.3247458083;暑,-10.7302109164;概,-9.882913056;竖,-10.4425288439;世,-7.10586998341;睿,-11.1356760245;攜,-11.8288232051;熟,-9.68875704156;舞,-9.63159862772;亡,-10.4425288439;传,-7.89699757233;宣,-9.18976587544;胚,-11.4233580969;助,-8.96662232412;辫,-11.8288232051;怪,-8.96662232412;種,-5.86524386143;隱,-8.96662232412;地,-6.28560079541;債,-9.57753140645;帶,-8.33231564359;狞,-11.8288232051;咽,-8.39483600057;爾,-9.08798318113;仁,-11.1356760245;繡,-10.9125324732;植,-5.98527878802;层,-7.32347335435;装,-5.82247004545;奄,-10.9125324732;要,-5.95670541558;忠,-10.7302109164;拉,-7.71794934088;午,-10.4425288439;琶,-10.3247458083;正,-8.69332898912;谷,-11.1356760245;囑,-9.81392018451;坐,-8.09115358677;賢,-9.08798318113;兔,-11.1356760245;湖,-9.74938166337;存,-7.05391024448;矛,-7.93700290694;美,-7.26969695757;镜,-10.5760602366;營,-9.95702102815;满,-6.76939774679;你,-8.44443294171;屢,-9.43092793225;襤,-9.57753140645;旧,-8.47891911778;獨,-7.90684986877;快,-8.2453042666;聪,-10.3247458083;积,-8.09115358677;眼,-6.11179550365;物,-6.57393539643;右,-8.80839831891;醒,-10.9125324732;僵,-9.43092793225;兴,-7.83983915849;巷,-10.9125324732;并,-8.57072666703;隐,-8.96662232412;學,-5.18764103531;蟻,-12.5219703856;瀾,-8.57072666703;首,-9.30309456074;啼,-11.8288232051;凿,-12.5219703856;找,-9.02546282415;丁,-10.2193852926;往,-9.08798318113;節,-7.70168882001;堅,-10.9125324732;妄,-10.7302109164;唇,-10.4425288439;皆,-8.995609861;舉,-8.28786388101;授,-8.36308730225;莖,-12.5219703856;對,-5.80658699928;夏,-8.23151094446;析,-8.02216071528;療,-9.15467455563;怕,-7.18925159235;憔,-10.7302109164;崗,-10.3247458083;準,-7.65443593516;標,-9.30309456074;官,-8.23151094446;望,-9.15467455563;网,-8.93845144716;喜,-8.13994375094;償,-10.3247458083;办,-8.39483600057;渡,-9.74938166337;侠,-11.1356760245;闊,-10.0370637358;利,-5.80054468482;推,-8.6507693747;漫,-9.81392018451;葆,-11.4233580969;陰,-9.68875704156;窮,-11.8288232051;嘱,-9.81392018451;撲,-9.34391655526;慈,-9.63159862772;樹,-7.82149001982;页,-10.4425288439;確,-8.6301500875;落,-7.26969695757;於,-5.89525263636;儿,-7.02890894227;致,-7.62413058566;繁,-12.5219703856;激,-7.66215798125;躥,-9.22613351961;衅,-9.34391655526;规,-6.10197545747;抠,-12.5219703856;看,-7.92685053548;又,-7.07093193205;潋,-10.4425288439;延,-9.18976587544;跌,-8.21790529241;虑,-9.15467455563;特,-6.86597857479;擒,-10.3247458083;期,-5.66025904513;他,-8.85840873948;败,-7.78577193722;坛,-9.882913056;磚,-11.1356760245;關,-5.37756320529;勞,-5.6385077992;乡,-8.995609861;俠,-11.1356760245;季,-8.76077026992;波,-9.63159862772;补,-7.307034628;啧,-9.47744794789;赐,-10.2193852926;剩,-10.5760602366;鹅,-10.7302109164;貼,-11.4233580969;疾,-8.53298633905;跬,-11.8288232051;脈,-7.29086176876;輩,-8.6718227839;即,-9.22613351961;灵,-9.05623448281;腿,-9.95702102815;海,-7.7428468925;件,-7.27494631345;寸,-9.63159862772;飘,-10.3247458083;棺,-10.5760602366;命,-7.63162125739;睐,-8.88438422589;
+M,mq:十,-7.00734201555;一,-8.26010498405;七,-7.85463987594;万,-5.93282727846;分,-4.02238183898;三,-7.16149269538;月,-6.12003882055;下,-8.5477870565;上,-9.64639934517;行,-6.81318600111;二,-6.81318600111;發,-8.5477870565;发,-8.5477870565;季,-0.203044302083;道,-4.8757147207;世,-5.30259392332;丝,-6.03548143252;星,-8.95325216461;點,-6.24520196351;次,-7.00734201555;几,-9.64639934517;代,-5.8397368554;面,-7.44917476783;版,-9.64639934517;九,-6.75602758727;萬,-5.93282727846;千,-6.93834914407;口,-5.69515562659;絲,-6.03548143252;点,-6.24520196351;年,-7.85463987594;样,-9.64639934517;樣,-9.64639934517;方,-2.72572784092;刻,-5.98283769904;部,-3.10681338955;份,-7.24850407237;之,-4.1996619735;幾,-9.64639934517;
+M,m:挂,-11.5505102253;戌,-9.35328564796;会,-4.35720013488;两,-4.87028309595;吨,-10.2977472568;貫,-9.94107231286;未,-11.1450451172;貳,-12.2436574059;方,-3.6986545138;场,-9.19913496813;亿,-4.10567695141;见,-10.6342194934;寅,-9.75875075607;半,-5.71569948823;晌,-8.74714984439;坚,-12.2436574059;仟,-10.1642158642;面,-9.84576213306;句,-9.60460007624;周,-6.75059596252;马,-8.41501600937;年,-9.53560720476;系,-4.18090950477;忽,-9.06560357551;廿,-11.1450451172;万,-3.50300071432;鄉,-11.5505102253;個,-3.45247546912;伍,-9.53560720476;二,-2.66596924789;檔,-9.60460007624;列,-12.2436574059;首,-7.5708285714;星,-9.94107231286;無,-12.2436574059;数,-5.23334553855;天,-7.59926650672;港,-5.68262673996;單,-10.8573630447;酉,-9.94107231286;朵,-8.91145289568;之,-5.94287161119;卅,-11.5505102253;组,-10.8573630447;片,-7.66894642735;光,-8.50598778757;柒,-12.2436574059;单,-10.8573630447;档,-9.60460007624;叢,-9.29921842669;步,-7.23971109991;左,-5.91393650033;兩,-4.87028309595;部,-3.2132813711;良,-11.5505102253;声,-8.03896478647;滴,-9.1526149525;时,-10.6342194934;幾,-3.98990906253;市,-12.2436574059;倆,-12.2436574059;見,-10.6342194934;上,-8.68830934437;間,-11.1450451172;宗,-10.8573630447;餘,-4.1862799173;亥,-10.2977472568;个,-3.45247546912;第,-7.5896970557;贰,-12.2436574059;辈,-4.91719179202;点,-4.90932805556;便,-10.2977472568;時,-10.6342194934;篇,-11.5505102253;對,-8.80967020137;捌,-12.2436574059;绝,-11.1450451172;裡,-10.1642158642;若,-11.1450451172;全,-9.02478158099;華,-8.48245729016;兰,-10.8573630447;巳,-11.1450451172;干,-5.84008320792;壹,-12.2436574059;數,-5.23334553855;把,-9.53560720476;不,-8.71729688124;伏,-11.5505102253;少,-6.32207898621;众,-10.4518979366;庚,-12.2436574059;丝,-10.8573630447;蘭,-10.8573630447;瞬,-7.50745895746;撮,-11.1450451172;週,-6.75059596252;申,-9.10816318993;阵,-5.66858156526;人,-6.45983222353;维,-10.6342194934;久,-7.54317704007;克,-10.0464328285;家,-9.75875075607;處,-9.19913496813;比,-10.4518979366;九,-4.12813652431;无,-12.2436574059;瓦,-7.23302211176;八,-3.80248170087;卯,-10.2977472568;五,-3.52974677736;一,-2.33220168367;成,-9.75875075607;些,-6.32745534325;多,-3.1113866893;处,-9.19913496813;維,-10.6342194934;萬,-3.50300071432;纳,-11.1450451172;甲,-9.84576213306;場,-9.19913496813;眾,-10.4518979366;叁,-12.2436574059;終,-10.6342194934;摄,-8.98556086784;立,-4.87342676405;种,-8.45946777194;华,-8.48245729016;兒,-7.66894642735;四,-3.54547688066;代,-8.58009575973;日,-6.36033501737;層,-7.46453391275;俩,-12.2436574059;番,-9.84576213306;韩,-10.0464328285;絲,-10.8573630447;对,-8.80967020137;噸,-10.2977472568;七,-4.04227145062;簇,-9.29921842669;辆,-12.2436574059;有,-9.84576213306;下,-4.47978611804;疊,-8.63273949321;納,-11.1450451172;氏,-7.3164037207;美,-3.39313978411;丛,-9.29921842669;攝,-8.98556086784;次,-7.05627160002;加,-9.19913496813;樣,-9.84576213306;輩,-4.91719179202;微,-9.35328564796;样,-9.84576213306;架,-9.53560720476;刻,-7.33838262742;十,-2.00871015852;终,-10.6342194934;手,-8.98556086784;双,-7.25322481908;絕,-11.1450451172;癸,-11.1450451172;余,-4.1862799173;陣,-5.66858156526;六,-3.82938326845;平,-4.38578984653;出,-7.93959231265;好,-7.82481679806;截,-9.1526149525;億,-4.10567695141;分,-4.82607700344;世,-8.53008533915;掛,-11.5505102253;種,-8.45946777194;澳,-8.02414970068;头,-8.98556086784;层,-7.46453391275;組,-10.8573630447;几,-3.98990906253;拉,-10.1642158642;午,-9.4104440618;量,-7.19380139861;子,-6.96045367712;韓,-10.0464328285;法,-8.33163440043;小,-8.27336549231;雙,-7.25322481908;兜,-12.2436574059;毫,-7.59926650672;公,-3.93078601151;路,-7.75502103613;英,-6.18220048693;佰,-10.1642158642;右,-6.45369723496;聲,-8.03896478647;整,-6.76301848252;百,-3.11735102949;丁,-9.10816318993;會,-4.35720013488;堅,-12.2436574059;三,-3.02743437072;很,-8.45946777194;倍,-11.5505102253;丑,-9.94107231286;杯,-10.8573630447;厘,-7.23971109991;輛,-12.2436574059;肚,-6.95539037516;醜,-9.94107231286;生,-10.1642158642;大,-4.65129127734;度,-10.8573630447;頭,-8.98556086784;馬,-8.41501600937;贯,-9.94107231286;許,-6.8099354023;辰,-10.8573630447;许,-6.8099354023;儿,-7.66894642735;千,-3.36112689742;里,-10.1642158642;盎,-8.58009575973;幹,-5.84008320792;套,-12.2436574059;拖,-10.2977472568;點,-4.90932805556;乡,-11.5505102253;叠,-8.63273949321;旬,-10.6342194934;台,-12.2436574059;间,-11.1450451172;海,-8.77792150306;零,-6.07195680845;批,-7.55230952363;
+M,nrfg:耀,-8.04825566035;羅,-9.14686794902;怀,-8.45372076846;鐘,-7.20095779997;宝,-6.94964337168;未,-7.35510847979;纯,-9.14686794902;靜,-9.14686794902;冲,-4.97248067912;方,-5.92799212415;永,-5.81466343885;强,-8.04825566035;稼,-5.65036038755;兆,-7.20095779997;豈,-8.45372076846;齊,-4.41948013031;经,-7.53743003659;济,-5.81466343885;金,-7.7605735879;苗,-9.14686794902;祖,-8.45372076846;鹤,-9.14686794902;士,-9.14686794902;马,-5.81466343885;泳,-7.53743003659;其,-6.43881774792;仿,-8.04825566035;应,-9.14686794902;首,-9.14686794902;星,-7.35510847979;無,-9.14686794902;是,-7.35510847979;莲,-8.04825566035;冶,-8.04825566035;紹,-8.45372076846;岸,-8.04825566035;雄,-9.14686794902;則,-7.7605735879;俊,-7.7605735879;鹏,-7.53743003659;教,-8.45372076846;衛,-9.14686794902;孝,-6.66196129923;空,-8.04825566035;独,-9.14686794902;铸,-7.7605735879;广,-7.53743003659;宇,-8.45372076846;順,-8.04825566035;渊,-6.74897267622;劍,-8.45372076846;經,-7.53743003659;演,-9.14686794902;宗,-4.43733774771;岩,-9.14686794902;用,-6.94964337168;朴,-8.04825566035;恆,-9.14686794902;秋,-4.36774445591;佔,-9.14686794902;富,-8.04825566035;勝,-7.06742640734;卜,-6.31365460496;濟,-5.81466343885;民,-9.14686794902;嗣,-7.35510847979;以,-7.7605735879;绵,-8.45372076846;智,-4.54169776303;清,-9.14686794902;树,-9.14686794902;北,-9.14686794902;毅,-5.19562423044;亚,-7.7605735879;伟,-7.35510847979;冠,-7.53743003659;春,-9.14686794902;伯,-5.45798849491;仲,-9.14686794902;秉,-8.45372076846;鳴,-8.04825566035;秀,-7.35510847979;汉,-6.94964337168;克,-5.6205074244;益,-9.14686794902;才,-9.14686794902;双,-6.74897267622;相,-7.7605735879;散,-9.14686794902;雪,-8.45372076846;蓮,-8.04825566035;陵,-8.45372076846;建,-5.00373322263;板,-6.94964337168;肇,-7.35510847979;而,-9.14686794902;咏,-9.14686794902;鼎,-7.35510847979;成,-3.87386839046;儒,-9.14686794902;尔,-4.41948013031;化,-8.45372076846;力,-6.66196129923;钟,-7.20095779997;计,-7.7605735879;錦,-7.35510847979;鑄,-7.7605735879;立,-6.66196129923;重,-7.7605735879;行,-9.14686794902;发,-7.53743003659;橐,-9.14686794902;非,-9.14686794902;詠,-9.14686794902;廣,-7.53743003659;日,-7.35510847979;学,-8.45372076846;淵,-6.74897267622;有,-4.0779637468;小,-6.43881774792;美,-7.7605735879;易,-8.45372076846;鸣,-8.04825566035;启,-7.35510847979;阳,-5.17657603547;憲,-8.04825566035;贵,-8.45372076846;貴,-8.45372076846;家,-6.84428285603;綺,-9.14686794902;达,-6.66196129923;魁,-9.14686794902;浅,-9.14686794902;橋,-6.31365460496;城,-9.14686794902;筑,-9.14686794902;晓,-4.98798486566;静,-9.14686794902;海,-5.08642493847;胜,-7.06742640734;繼,-8.04825566035;平,-6.74897267622;绿,-6.58191859156;寶,-6.94964337168;書,-8.04825566035;淺,-9.14686794902;侃,-9.14686794902;适,-9.14686794902;王,-9.14686794902;明,-8.45372076846;純,-9.14686794902;弘,-7.7605735879;务,-9.14686794902;木,-5.43329588232;斯,-4.31855421172;進,-8.45372076846;綿,-8.45372076846;显,-9.14686794902;心,-7.06742640734;遂,-9.14686794902;組,-6.58191859156;曉,-4.98798486566;虎,-7.7605735879;子,-5.888771411;恒,-9.14686794902;曙,-9.14686794902;占,-9.14686794902;叫,-6.94964337168;公,-7.06742640734;英,-6.84428285603;柳,-8.45372076846;懷,-8.45372076846;三,-7.53743003659;階,-9.14686794902;圓,-8.04825566035;桂,-7.53743003659;思,-9.14686794902;亞,-7.7605735879;斤,-8.04825566035;大,-5.53595003638;沪,-9.14686794902;冬,-8.45372076846;贯,-7.20095779997;育,-9.14686794902;鐵,-7.7605735879;鶴,-9.14686794902;愷,-6.15113567547;政,-8.45372076846;居,-2.936267872;凌,-9.14686794902;剑,-8.45372076846;展,-7.20095779997;乙,-9.14686794902;衝,-4.97248067912;啟,-7.35510847979;荫,-8.45372076846;绮,-9.14686794902;雙,-6.74897267622;佳,-9.14686794902;长,-4.56190047035;鞍,-7.35510847979;仙,-8.45372076846;麗,-8.04825566035;熙,-5.25504765091;东,-8.45372076846;漢,-6.94964337168;锦,-7.35510847979;貫,-7.20095779997;玉,-6.37427922678;炳,-9.14686794902;計,-7.7605735879;治,-6.15113567547;徽,-9.14686794902;寅,-5.43329588232;應,-9.14686794902;忍,-9.14686794902;奎,-8.04825566035;淑,-6.20242896985;青,-7.7605735879;棣,-5.96881411867;继,-8.04825566035;敦,-6.20242896985;發,-7.53743003659;万,-8.45372076846;鄉,-8.45372076846;岐,-8.45372076846;君,-7.06742640734;定,-9.14686794902;朝,-6.84428285603;娟,-9.14686794902;组,-6.58191859156;天,-4.98798486566;風,-9.14686794902;宪,-8.04825566035;京,-8.45372076846;榮,-5.3626783151;羲,-6.05582549566;光,-5.2150423163;道,-5.01973356398;顺,-8.04825566035;步,-5.43329588232;滬,-9.14686794902;良,-7.7605735879;时,-8.45372076846;承,-7.7605735879;妃,-6.20242896985;愈,-7.7605735879;宏,-8.45372076846;林,-9.14686794902;稚,-7.06742640734;庭,-9.14686794902;本,-6.37427922678;岱,-7.53743003659;德,-6.31365460496;弼,-5.96881411867;铁,-7.7605735879;時,-8.45372076846;绍,-8.45372076846;志,-5.85103108302;于,-9.14686794902;作,-5.92799212415;聞,-8.45372076846;解,-8.45372076846;全,-5.77957211903;華,-6.37427922678;闻,-8.45372076846;艺,-7.7605735879;国,-4.95721320699;玄,-7.35510847979;震,-7.20095779997;向,-5.34020545925;綠,-6.58191859156;甫,-9.14686794902;中,-6.94964337168;振,-8.04825566035;新,-4.41066950063;強,-8.04825566035;丽,-8.04825566035;元,-8.04825566035;偉,-7.35510847979;风,-9.14686794902;叔,-8.45372076846;罗,-9.14686794902;九,-8.45372076846;韜,-5.81466343885;无,-9.14686794902;適,-9.14686794902;韬,-5.81466343885;山,-5.34020545925;雲,-6.50781061941;陽,-5.17657603547;一,-5.74567056736;圆,-8.04825566035;安,-8.45372076846;興,-7.20095779997;馬,-5.81466343885;黛,-9.14686794902;馥,-9.14686794902;萬,-8.45372076846;樸,-8.04825566035;築,-9.14686794902;代,-9.14686794902;华,-6.37427922678;近,-6.31365460496;達,-6.66196129923;盛,-9.14686794902;楚,-7.7605735879;藝,-7.7605735879;姥,-4.48342885491;旭,-5.6205074244;柱,-6.66196129923;省,-7.20095779997;和,-7.7605735879;源,-8.45372076846;焕,-9.14686794902;蔭,-8.45372076846;谷,-6.58191859156;芸,-8.04825566035;高,-3.06464903864;煥,-9.14686794902;自,-0.759327965831;顯,-9.14686794902;東,-8.45372076846;聿,-6.20242896985;文,-4.32658638342;福,-7.06742640734;云,-6.50781061941;世,-5.50928178929;阶,-9.14686794902;爾,-4.41948013031;正,-5.53595003638;齐,-4.41948013031;裕,-6.94964337168;務,-9.14686794902;进,-8.45372076846;巧,-7.06742640734;书,-8.04825566035;獨,-9.14686794902;鵬,-7.53743003659;右,-7.06742640734;汲,-9.14686794902;兴,-7.20095779997;學,-8.45372076846;恺,-6.15113567547;卫,-9.14686794902;季,-9.14686794902;岂,-8.45372076846;禄,-6.1023455113;隆,-9.14686794902;守,-8.04825566035;國,-4.95721320699;则,-7.7605735879;望,-8.45372076846;欣,-9.14686794902;利,-6.94964337168;樹,-9.14686794902;於,-9.14686794902;千,-9.14686794902;起,-9.14686794902;卓,-7.7605735879;汝,-7.7605735879;乡,-8.45372076846;忠,-8.45372076846;荣,-5.3626783151;桥,-6.31365460496;述,-8.04825566035;哲,-7.53743003659;致,-8.45372076846;長,-4.56190047035;延,-8.04825566035;祿,-6.1023455113;
+M,nrt:怀,-8.18692831587;沃,-8.03277763604;茂,-7.49378113531;羅,-4.35828691938;袋,-8.88007549643;伊,-4.89728342011;废,-8.03277763604;薩,-6.00839587155;萨,-6.00839587155;未,-7.5807925123;卜,-5.08833865688;熱,-8.59239342398;河,-9.9786877851;茲,-6.93416534738;方,-7.0883160272;裡,-2.83191560565;齊,-8.59239342398;科,-5.23375565674;郡,-7.67610269211;賓,-7.0883160272;濕,-5.91824477455;乔,-7.14547444104;苗,-7.5807925123;赞,-9.9786877851;凡,-7.67610269211;卢,-7.03424880593;查,-7.20609906286;士,-4.20724666197;班,-8.88007549643;扬,-7.20609906286;凱,-8.59239342398;年,-6.02744406652;缅,-9.9786877851;庄,-7.5807925123;切,-6.80063395475;華,-8.36924987266;列,-5.68822834395;错,-9.28554060454;謝,-7.33963045548;兰,-5.00887448552;倫,-6.45232726048;琳,-9.28554060454;费,-7.33963045548;蘿,-9.28554060454;則,-9.28554060454;姆,-6.17202529533;哈,-5.0228607275;契,-6.21748766941;罕,-3.98472635779;孝,-5.62197895841;迪,-5.22509759399;景,-9.9786877851;米,-4.79130197926;史,-8.59239342398;维,-4.31920556934;基,-6.15004638861;湿,-5.91824477455;邁,-6.17202529533;門,-7.03424880593;上,-8.18692831587;后,-8.88007549643;傑,-9.9786877851;底,-6.34110162537;沙,-7.5807925123;窝,-8.88007549643;第,-9.9786877851;瑟,-5.1034904619;耶,-5.86781392093;雅,-6.75981196023;始,-7.78146320776;滕,-8.88007549643;诗,-8.03277763604;聖,-9.9786877851;勝,-8.59239342398;孜,-8.03277763604;瑞,-8.88007549643;胡,-9.9786877851;寧,-7.20609906286;腰,-8.18692831587;聶,-7.5807925123;頁,-6.08686748699;清,-9.9786877851;朗,-5.31524869099;吉,-6.31512613897;舍,-7.5807925123;树,-9.28554060454;帕,-5.8043005152;北,-6.68285091909;愛,-9.28554060454;亚,-5.06603289936;真,-9.9786877851;邦,-6.75981196023;夫,-4.30536451793;伯,-4.96140794828;申,-8.88007549643;肅,-9.9786877851;人,-8.88007549643;費,-7.33963045548;歇,-9.9786877851;汉,-7.41373842764;克,-3.60707593787;才,-9.28554060454;富,-9.9786877851;桑,-9.9786877851;勒,-5.62197895841;南,-7.0883160272;僖,-9.9786877851;瑙,-9.9786877851;金,-5.85155340005;散,-7.89924624342;摩,-7.89924624342;门,-7.03424880593;陵,-7.41373842764;歷,-6.68285091909;睿,-8.03277763604;宁,-7.20609906286;涅,-5.97135459987;各,-6.84319356917;蘭,-5.00887448552;贊,-9.9786877851;成,-7.67610269211;库,-6.68285091909;尔,-2.09599557881;丘,-9.9786877851;力,-8.88007549643;纣,-9.28554060454;尤,-9.9786877851;義,-9.9786877851;莱,-5.4039768066;纳,-5.73019254305;吴,-8.59239342398;徹,-7.5807925123;格,-4.72641435705;坎,-8.03277763604;策,-9.9786877851;遜,-7.78146320776;代,-6.57749040344;日,-6.48218022363;武,-5.53603652861;松,-9.28554060454;布,-4.38770080459;历,-6.68285091909;小,-8.36924987266;马,-3.80074367105;易,-5.28733990287;加,-6.17202529533;升,-8.88007549643;别,-8.88007549643;憲,-9.9786877851;贵,-9.9786877851;貴,-9.9786877851;家,-9.28554060454;达,-5.2601889138;十,-5.47887811477;密,-7.89924624342;城,-5.02992789472;静,-7.41373842764;默,-3.97727290714;胜,-8.59239342398;江,-9.28554060454;连,-7.0883160272;卡,-5.4248108935;略,-9.28554060454;佩,-8.18692831587;六,-7.20609906286;平,-8.18692831587;賴,-7.14547444104;莫,-5.75918007992;約,-8.36924987266;萊,-5.4039768066;明,-6.93416534738;玛,-7.89924624342;蘇,-6.61139195511;木,-7.67610269211;宫,-7.20609906286;斯,-2.58850635687;花,-8.88007549643;澳,-6.93416534738;显,-9.9786877851;埃,-6.19449815118;聂,-7.5807925123;穆,-7.33963045548;廉,-6.21748766941;霍,-8.59239342398;藏,-8.03277763604;虎,-9.9786877851;子,-8.36924987266;法,-7.270637584;潘,-9.9786877851;哥,-6.06666477967;瑪,-7.89924624342;热,-8.59239342398;路,-7.20609906286;普,-5.36356726826;英,-8.18692831587;锤,-9.9786877851;懷,-8.18692831587;都,-9.28554060454;威,-7.0883160272;吕,-7.33963045548;思,-9.9786877851;庞,-9.9786877851;圣,-9.9786877851;大,-6.45232726048;馬,-3.80074367105;皮,-6.42333972361;爱,-9.28554060454;育,-9.9786877851;靜,-7.41373842764;靈,-9.28554060454;珀,-9.28554060454;淄,-8.59239342398;奇,-6.84319356917;义,-9.9786877851;迈,-6.17202529533;里,-2.83191560565;提,-7.14547444104;当,-6.21748766941;奧,-5.5598471773;齐,-8.59239342398;孫,-8.88007549643;台,-9.28554060454;巴,-4.31572730496;幹,-8.36924987266;图,-6.24101816682;肃,-9.9786877851;皇,-6.31512613897;希,-6.5129518823;吐,-9.9786877851;麗,-5.77399516571;岛,-9.9786877851;依,-7.20609906286;东,-6.19449815118;那,-6.64648327492;漢,-7.41373842764;吳,-8.59239342398;玉,-8.03277763604;康,-9.28554060454;治,-6.68285091909;徽,-9.28554060454;觉,-6.26511571839;乌,-6.34110162537;苏,-6.61139195511;奎,-8.88007549643;豐,-9.9786877851;赖,-7.14547444104;博,-8.36924987266;神,-8.88007549643;面,-7.20609906286;盧,-7.03424880593;阿,-5.57196853783;雷,-5.08833865688;當,-6.21748766941;考,-9.28554060454;茅,-7.33963045548;万,-7.89924624342;鄉,-9.9786877851;莊,-7.5807925123;伍,-8.03277763604;徒,-7.67610269211;連,-7.0883160272;宪,-9.9786877851;妮,-8.88007549643;偃,-7.5807925123;光,-5.57196853783;烈,-6.45232726048;屋,-8.59239342398;珊,-8.36924987266;揚,-7.20609906286;良,-8.88007549643;泰,-6.28980833099;兹,-6.93416534738;诺,-5.32472743494;曼,-6.5129518823;鲁,-5.97135459987;昂,-7.5807925123;開,-8.88007549643;唐,-6.48218022363;得,-6.08686748699;岡,-9.9786877851;素,-7.49378113531;爪,-6.93416534738;本,-8.03277763604;田,-9.9786877851;德,-4.22611514627;纽,-9.28554060454;琴,-9.9786877851;答,-8.59239342398;杜,-5.14240587815;塞,-6.21748766941;可,-7.41373842764;干,-8.36924987266;迷,-8.03277763604;空,-8.03277763604;国,-9.9786877851;彼,-6.88764533174;喀,-8.88007549643;厄,-7.33963045548;冈,-9.9786877851;不,-8.88007549643;後,-8.88007549643;斐,-9.9786877851;弗,-6.34110162537;洛,-4.63158025438;丝,-9.9786877851;果,-8.03277763604;別,-8.88007549643;甫,-9.28554060454;努,-7.270637584;昭,-9.28554060454;錯,-9.28554060454;新,-6.26511571839;菲,-5.0228607275;根,-6.84319356917;亞,-5.06603289936;丽,-5.77399516571;郎,-7.89924624342;比,-5.8043005152;罗,-4.35828691938;衙,-6.88764533174;臘,-9.9786877851;赛,-6.21748766941;孟,-8.03277763604;廢,-8.03277763604;古,-4.88493758429;瓦,-4.91609275207;恩,-4.89728342011;赫,-6.88764533174;魯,-5.97135459987;森,-7.78146320776;山,-6.75981196023;島,-9.9786877851;莉,-9.28554060454;幽,-9.28554060454;達,-5.2601889138;一,-6.93416534738;紂,-9.28554060454;内,-6.61139195511;安,-7.33963045548;戈,-6.34110162537;圖,-6.24101816682;娘,-7.78146320776;多,-4.0981547987;索,-6.98295551155;伦,-6.45232726048;庫,-6.68285091909;太,-5.20800316063;維,-4.31920556934;萬,-7.89924624342;肯,-7.78146320776;丰,-9.9786877851;劳,-5.86781392093;買,-7.49378113531;施,-8.88007549643;尼,-4.62682965162;扈,-6.93416534738;腊,-9.9786877851;烏,-6.34110162537;华,-8.36924987266;塔,-5.51277966644;托,-5.28733990287;祚,-9.9786877851;坦,-5.81980470174;捷,-7.89924624342;买,-7.49378113531;絲,-9.9786877851;林,-5.86781392093;納,-5.73019254305;莎,-6.93416534738;蒙,-6.84319356917;贝,-4.89109144987;尧,-9.9786877851;堯,-9.9786877851;宮,-7.20609906286;覺,-6.26511571839;宾,-7.0883160272;什,-4.71082962604;村,-7.67610269211;孙,-8.88007549643;高,-7.20609906286;瓜,-8.59239342398;因,-6.17202529533;奥,-5.5598471773;韦,-6.00839587155;顯,-9.9786877851;東,-6.19449815118;登,-8.03277763604;开,-8.88007549643;梅,-7.41373842764;文,-4.56704173324;逊,-7.78146320776;福,-6.34110162537;世,-9.28554060454;芙,-8.88007549643;錘,-9.9786877851;辛,-7.5807925123;貝,-4.89109144987;宣,-9.9786877851;谢,-7.33963045548;窩,-8.88007549643;茨,-6.02744406652;紐,-9.28554060454;爾,-2.09599557881;仁,-9.28554060454;呂,-7.33963045548;襄,-7.20609906286;拉,-3.16964847906;韋,-6.00839587155;扎,-7.270637584;佐,-9.28554060454;內,-6.61139195511;凯,-8.59239342398;杰,-9.9786877851;賽,-6.21748766941;丁,-7.67610269211;蒂,-5.7445812805;隆,-8.59239342398;國,-9.9786877851;夏,-6.57749040344;龐,-9.9786877851;撒,-8.18692831587;则,-9.28554060454;望,-8.36924987266;萝,-9.28554060454;渡,-9.9786877851;约,-8.36924987266;利,-4.36191668743;末,-5.95333609436;喬,-7.14547444104;詹,-9.9786877851;樹,-9.28554060454;页,-6.08686748699;某,-9.9786877851;廖,-8.88007549643;佛,-9.9786877851;勞,-5.86781392093;乡,-9.9786877851;季,-8.59239342398;波,-5.54787098626;赧,-9.9786877851;詩,-8.03277763604;緬,-9.9786877851;翰,-6.61139195511;灵,-9.28554060454;致,-9.28554060454;海,-7.49378113531;特,-3.83450215097;彻,-7.5807925123;諾,-5.32472743494;西,-4.78573093421;孔,-9.28554060454;
+M,nr:怀,-7.30796045383;茂,-7.73695605935;蘄,-12.0499898225;誇,-10.5095447816;耀,-7.17989455122;涉,-10.5095447816;谈,-11.7623077501;伊,-6.91419138549;随,-9.2984545095;預,-10.0575596578;徕,-11.356842642;舰,-10.7507068384;抗,-9.41093249292;溟,-13.1486021112;洞,-8.44812174541;瀠,-13.1486021112;璣,-13.1486021112;錢,-9.81639760103;媧,-12.4554549306;礦,-9.4350300445;缪,-9.36441247729;戬,-11.7623077501;潜,-9.2567818131;河,-7.32851918085;欲,-9.45972265709;临,-8.28106766075;然,-9.0710646673;吸,-11.5391641988;鑾,-10.3153887672;场,-10.5095447816;宽,-8.58425391974;线,-8.87193599219;臁,-13.1486021112;捂,-13.1486021112;談,-11.7623077501;豈,-11.2026919622;珍,-8.07342829597;剌,-8.44812174541;盏,-12.4554549306;姑,-8.53348159436;虢,-12.0499898225;織,-10.9513775339;拗,-12.4554549306;若,-6.20258812011;话,-10.2582303533;軟,-10.5836527537;赞,-7.65554066787;凡,-8.61600261805;遠,-7.53913031602;铣,-13.1486021112;卢,-7.55018015221;知,-7.3196564936;巩,-11.0691605695;彪,-9.0710646673;扬,-8.67126529673;泳,-10.6636954614;歲,-12.4554549306;其,-6.81710026131;祥,-6.91812066363;绿,-6.96858545755;愁,-10.376013389;萃,-11.2026919622;驪,-11.356842642;訇,-13.1486021112;榆,-9.51101595148;沈,-9.81639760103;個,-12.0499898225;湃,-13.1486021112;閎,-12.0499898225;引,-8.11816418981;应,-7.08714519228;鐘,-7.732501709;枚,-11.5391641988;謝,-8.97421484131;檜,-9.65209454974;涞,-11.2026919622;無,-7.89110673918;玢,-11.0691605695;遇,-8.63774260469;禦,-7.38028111541;崩,-10.7507068384;循,-10.1528698377;芬,-8.28106766075;是,-9.68286620841;蝉,-10.1528698377;氳,-11.0691605695;麟,-8.81786877092;爷,-10.204163132;冶,-8.75415295653;锹,-13.1486021112;咸,-8.95894736918;砻,-12.4554549306;贞,-6.47151864996;媼,-13.1486021112;琏,-8.5738911327;闊,-10.204163132;曄,-10.6636954614;造,-10.1528698377;赉,-10.5836527537;賈,-8.19984222083;運,-7.83048211736;俊,-5.64310983647;契,-8.54343192522;磐,-11.5391641988;寒,-8.51387312298;录,-9.14126892597;绔,-13.1486021112;教,-7.94459542413;衛,-6.99799934276;柚,-10.0131078953;也,-8.91449560661;淞,-8.58425391974;瑣,-11.7623077501;叢,-9.8527652452;盤,-8.85814267006;婧,-10.0575596578;狐,-9.2774011003;嵩,-8.87193599219;景,-6.70288229182;旮,-13.1486021112;诲,-13.1486021112;滴,-13.1486021112;铸,-10.7507068384;须,-8.98971902785;基,-6.73023717527;广,-6.63834377068;巾,-8.23594722547;片,-10.5095447816;漪,-9.65209454974;殇,-12.0499898225;門,-7.79674397773;沉,-10.9513775339;贈,-11.0691605695;上,-7.10596927752;劍,-7.22970825693;鞏,-11.0691605695;后,-8.12472159036;碑,-10.7507068384;經,-7.23780546717;底,-12.4554549306;怖,-11.356842642;蒙,-7.34950945675;攘,-9.51101595148;牛,-8.36947861809;辟,-10.0131078953;玄,-6.94404434864;閣,-8.51387312298;砰,-13.1486021112;岩,-7.27648432173;憫,-12.0499898225;鸪,-10.7507068384;胜,-7.40239892067;椰,-13.1486021112;足,-9.19735839262;伴,-11.2026919622;頂,-9.2567818131;离,-9.2567818131;媽,-8.91449560661;笼,-11.7623077501;羿,-13.1486021112;尾,-8.87193599219;胁,-11.7623077501;泉,-8.36947861809;浈,-13.1486021112;釋,-10.5836527537;壑,-10.7507068384;奐,-13.1486021112;绕,-10.7507068384;聖,-6.78213166347;敘,-9.51101595148;晚,-10.2582303533;譜,-10.1040796735;俟,-11.2026919622;郡,-7.71925648225;嗣,-6.26309244117;牢,-9.71461490672;寧,-6.50872627738;絨,-10.1040796735;鏈,-11.356842642;繪,-11.0691605695;柯,-8.75415295653;棱,-9.78130628122;淳,-9.45972265709;該,-11.5391641988;号,-12.4554549306;偶,-10.204163132;啸,-9.34193962144;姻,-12.4554549306;贾,-8.19984222083;态,-11.7623077501;釁,-11.2026919622;节,-9.56508317275;蘅,-10.7507068384;构,-10.3153887672;梆,-11.5391641988;消,-10.0575596578;爍,-13.1486021112;霏,-12.4554549306;頑,-10.1040796735;紓,-11.2026919622;帕,-7.53183101354;龔,-11.2026919622;茗,-10.376013389;肖,-9.14126892597;濮,-12.0499898225;讜,-12.4554549306;伟,-7.10834739993;貞,-6.47151864996;倡,-11.7623077501;冠,-7.87560255264;锣,-13.1486021112;鏗,-11.7623077501;垤,-13.1486021112;狰,-13.1486021112;渝,-11.5391641988;愫,-12.4554549306;纪,-6.96858545755;掬,-12.4554549306;术,-8.55348226107;撮,-12.4554549306;洳,-12.4554549306;猷,-10.9513775339;吹,-10.2582303533;稽,-10.9513775339;精,-7.39285989762;拂,-10.5095447816;柄,-10.0575596578;歇,-8.48516301709;菲,-6.49832306262;汉,-6.53521789283;克,-4.60652120428;今,-9.03772824703;前,-7.84033441381;双,-7.24870475762;铎,-10.9513775339;塑,-11.5391641988;姐,-6.66396687557;幕,-10.7507068384;翔,-9.71461490672;靜,-7.58792048019;胖,-9.23657910578;遥,-11.7623077501;飒,-12.4554549306;賞,-10.0575596578;几,-7.87048745198;勢,-9.74740472954;筧,-13.1486021112;巨,-8.17186836879;廪,-12.4554549306;賓,-7.50315521356;鲁,-5.60798058255;蓮,-5.99086662696;卷,-10.4405519101;固,-8.97421484131;导,-9.65209454974;戀,-10.9513775339;窪,-10.6636954614;狗,-8.07969790899;辉,-8.75415295653;丈,-10.7507068384;贊,-7.65554066787;再,-8.11164950879;钏,-8.68269399255;鮑,-10.3153887672;库,-8.15816952443;砂,-13.1486021112;尔,-4.14540891746;蔚,-8.88592223416;沟,-9.2984545095;伞,-11.7623077501;靚,-10.4405519101;碧,-6.8795058275;符,-9.81639760103;義,-6.07110405764;披,-10.5836527537;爆,-12.0499898225;蒯,-12.4554549306;涵,-9.38740199551;水,-6.37666655537;傷,-11.2026919622;猶,-11.2026919622;锺,-13.1486021112;菁,-11.356842642;所,-9.0710646673;旅,-13.1486021112;歆,-9.78130628122;么,-9.00546738481;勋,-8.65996574147;浊,-10.5836527537;凍,-10.7507068384;灌,-8.90010686916;坎,-9.4350300445;结,-8.92909440603;饒,-10.8460170182;櫛,-13.1486021112;贻,-9.78130628122;潞,-9.92972628634;鏡,-7.83048211736;監,-6.23785132324;嗥,-13.1486021112;瑤,-8.04873568338;学,-5.44019144395;翩,-12.4554549306;總,-8.04873568338;臭,-11.7623077501;獸,-10.1528698377;诱,-13.1486021112;緩,-9.08815910066;襲,-10.7507068384;淵,-7.59564252628;汴,-8.62681353416;烷,-10.5095447816;培,-7.77332370352;癸,-12.0499898225;嫻,-11.356842642;硼,-12.4554549306;酈,-13.1486021112;持,-9.10555084337;技,-10.6636954614;罪,-11.5391641988;撄,-11.356842642;标,-9.53768419856;載,-9.38740199551;予,-8.29657184729;越,-8.06719774622;吏,-9.19735839262;瞎,-6.59040430839;笑,-8.3283205456;骐,-12.4554549306;馒,-13.1486021112;耗,-11.2026919622;缘,-9.53768419856;谟,-9.12325042047;辞,-10.5836527537;匡,-8.11816418981;加,-6.57352627061;蓁,-12.4554549306;冢,-9.48504046508;钤,-11.7623077501;宦,-11.356842642;舫,-13.1486021112;悬,-11.5391641988;誰,-12.4554549306;覲,-11.0691605695;洵,-11.7623077501;貴,-6.46649351376;霹,-12.4554549306;隸,-8.74188286394;稻,-9.78130628122;雲,-5.85354569474;簿,-13.1486021112;晃,-9.21677647848;臂,-10.5095447816;故,-10.8460170182;蓄,-11.5391641988;謠,-13.1486021112;轉,-8.68269399255;眉,-8.88592223416;免,-13.1486021112;城,-7.33149095124;筑,-9.89050557318;秒,-12.4554549306;揖,-8.38642817641;蝙,-12.4554549306;需,-12.0499898225;補,-9.41093249292;江,-6.1186291995;俞,-9.78130628122;卡,-6.52056073503;陣,-9.21677647848;略,-9.4350300445;顧,-9.78130628122;實,-8.11816418981;彩,-7.98954681199;黨,-11.5391641988;摯,-11.7623077501;鸝,-13.1486021112;赵,-7.80149458049;滿,-6.99799934276;遷,-9.14126892597;叶,-7.63921377458;睹,-13.1486021112;相,-6.62064419358;好,-9.17831019765;箫,-11.5391641988;屿,-11.356842642;翠,-8.13132227439;綸,-10.5095447816;钦,-7.47527884403;榇,-13.1486021112;炀,-8.12472159036;争,-7.96121630537;袭,-10.7507068384;王,-6.12841140289;谊,-8.08600707818;骚,-11.7623077501;疏,-10.9513775339;嘎,-8.67126529673;骑,-9.81639760103;遙,-11.7623077501;鎂,-10.5836527537;崔,-10.204163132;條,-9.68286620841;丞,-8.06100577597;务,-8.91449560661;花,-7.73695605935;垣,-10.9513775339;逢,-8.97421484131;钥,-12.0499898225;唤,-10.7507068384;禧,-7.37716098808;缨,-10.4405519101;莫,-7.95564526032;斯,-4.45460254368;澳,-9.71461490672;贴,-11.7623077501;冷,-9.21677647848;制,-8.95894736918;隹,-13.1486021112;霸,-8.81786877092;鐺,-13.1486021112;渴,-12.4554549306;綿,-9.14126892597;績,-9.92972628634;荀,-10.5095447816;恂,-12.0499898225;仉,-12.4554549306;友,-7.41202981373;衿,-13.1486021112;鎖,-8.58425391974;煌,-9.41093249292;子,-4.70699490675;離,-9.2567818131;漸,-9.74740472954;曙,-7.21901296782;毛,-8.09874610396;裝,-10.8460170182;跟,-10.3153887672;湞,-13.1486021112;占,-8.21412817808;哥,-7.32851918085;秧,-12.4554549306;婦,-11.2026919622;廩,-12.4554549306;蜈,-12.0499898225;普,-6.50091373764;諱,-12.0499898225;議,-9.2567818131;浴,-10.8460170182;寻,-9.78130628122;壽,-7.22434631379;幾,-7.87048745198;會,-7.81588331794;薄,-9.62224158659;三,-5.23033742511;澈,-11.7623077501;倍,-9.92972628634;册,-10.376013389;锏,-13.1486021112;蟬,-10.1528698377;弓,-10.0575596578;抖,-12.4554549306;榜,-12.0499898225;负,-10.8460170182;亞,-5.42548201894;圣,-6.78213166347;邢,-10.7507068384;采,-8.1927750536;大,-4.18826274471;窦,-11.356842642;羨,-9.48504046508;粪,-13.1486021112;支,-9.41093249292;暮,-10.2582303533;樱,-11.356842642;记,-9.48504046508;漳,-12.4554549306;儷,-13.1486021112;状,-9.23657910578;钺,-10.7507068384;齡,-9.74740472954;鴿,-11.5391641988;庾,-11.7623077501;扁,-10.6636954614;揀,-12.4554549306;权,-7.76410704842;肠,-9.81639760103;义,-6.07110405764;迈,-8.48516301709;鍋,-13.1486021112;泊,-9.21677647848;凌,-8.46647088408;問,-9.23657910578;当,-9.4350300445;莢,-11.5391641988;展,-7.62714119334;拖,-11.0691605695;柘,-10.7507068384;據,-13.1486021112;衝,-7.96121630537;仞,-11.5391641988;牡,-10.6636954614;叠,-10.6636954614;督,-8.90010686916;郢,-13.1486021112;奧,-7.2324000486;嫦,-11.5391641988;繩,-8.3950119201;鹽,-9.45972265709;荫,-8.98971902785;峪,-9.41093249292;恭,-8.48516301709;話,-10.2582303533;佳,-8.0548519104;棲,-8.81786877092;具,-9.92972628634;哺,-13.1486021112;顽,-10.1040796735;肃,-8.34458106647;蜂,-9.8527652452;罗,-5.69272542371;璋,-9.4350300445;權,-7.76410704842;鞍,-10.4405519101;碓,-13.1486021112;宕,-13.1486021112;暗,-9.12325042047;攖,-11.356842642;鼎,-8.18575748095;耘,-12.4554549306;沛,-9.38740199551;挚,-11.7623077501;依,-5.92530643164;东,-5.95191554037;迎,-7.76870475767;閡,-12.4554549306;礱,-12.4554549306;那,-8.85814267006;厥,-10.204163132;判,-10.5095447816;座,-11.0691605695;鴦,-13.1486021112;妩,-13.1486021112;长,-5.70904280207;撫,-6.90249534572;嬪,-11.356842642;芯,-10.5095447816;铁,-6.62210725164;梳,-11.7623077501;漲,-10.5836527537;段,-13.1486021112;逸,-8.51387312298;区,-11.5391641988;徽,-8.17186836879;社,-9.2567818131;杂,-13.1486021112;熊,-9.34193962144;仇,-10.7507068384;觉,-8.34458106647;陌,-13.1486021112;煎,-12.4554549306;蔹,-13.1486021112;归,-9.08815910066;願,-12.0499898225;敖,-10.3153887672;聘,-11.0691605695;泛,-9.31996071472;荚,-11.5391641988;保,-6.45156786354;乜,-13.1486021112;櫟,-10.1528698377;赤,-8.79189328452;闡,-11.356842642;辑,-10.6636954614;面,-9.31996071472;继,-6.44296301635;渐,-9.74740472954;秩,-10.7507068384;拯,-11.5391641988;慮,-10.5095447816;深,-8.40366998284;裳,-12.4554549306;轲,-11.0691605695;诵,-11.5391641988;鸿,-5.16823634609;雷,-6.38125898594;當,-9.4350300445;釹,-13.1486021112;選,-9.71461490672;峻,-9.53768419856;鍺,-13.1486021112;忽,-9.0710646673;幼,-8.65996574147;竿,-10.9513775339;考,-8.50421121206;茅,-9.92972628634;万,-7.20056712203;殊,-10.204163132;圍,-10.1040796735;睛,-9.65209454974;岐,-9.21677647848;頓,-9.65209454974;徒,-7.82072594242;笕,-13.1486021112;肯,-9.10555084337;輝,-8.75415295653;溜,-10.6636954614;赋,-10.1528698377;英,-5.82082157278;連,-7.02610930169;脚,-10.8460170182;帧,-13.1486021112;鎮,-7.71052280228;天,-4.88966164822;墨,-8.19984222083;宪,-7.68901659706;札,-9.2774011003;音,-8.43907190989;贱,-10.9513775339;農,-8.70595085472;碟,-11.5391641988;珊,-11.0691605695;閶,-13.1486021112;炸,-11.7623077501;鰻,-13.1486021112;玺,-10.4405519101;缽,-10.376013389;麼,-11.7623077501;禾,-9.59325404972;论,-11.0691605695;聃,-13.1486021112;瑋,-9.97054828086;轩,-9.68286620841;燎,-12.4554549306;鵑,-13.1486021112;顓,-12.4554549306;忒,-9.92972628634;孕,-12.4554549306;嫔,-11.356842642;晗,-11.5391641988;轸,-13.1486021112;汛,-10.7507068384;揚,-8.67126529673;機,-10.0131078953;灣,-9.34193962144;镌,-12.4554549306;勤,-8.47577327674;左,-9.10555084337;通,-8.23594722547;磨,-10.6636954614;杭,-9.8527652452;曬,-12.0499898225;良,-5.81623290528;泰,-6.93599601545;访,-10.6636954614;兹,-7.21106590612;罕,-10.1040796735;类,-10.3153887672;虾,-10.9513775339;综,-10.9513775339;滔,-10.6636954614;攀,-9.48504046508;昂,-8.94390949182;軻,-11.0691605695;澇,-12.4554549306;開,-6.01132367395;樊,-11.356842642;缃,-13.1486021112;鎏,-11.356842642;琬,-11.0691605695;岑,-10.3153887672;紐,-9.4350300445;颂,-10.204163132;笔,-10.4405519101;林,-5.80259190129;搖,-7.1571375641;谅,-10.5836527537;涛,-10.0575596578;戚,-10.7507068384;溝,-9.2984545095;钡,-11.2026919622;墩,-10.4405519101;筝,-13.1486021112;斫,-12.4554549306;雏,-11.356842642;本,-6.85149279127;渲,-12.4554549306;湟,-13.1486021112;吶,-12.4554549306;点,-8.74188286394;贯,-8.07969790899;刺,-10.3153887672;纽,-9.4350300445;弼,-9.8527652452;宿,-9.78130628122;破,-9.05425754898;擁,-9.65209454974;時,-6.32640472059;过,-8.97421484131;豆,-8.83111399767;棉,-10.8460170182;賽,-7.42175436362;雍,-8.26580018862;鑣,-11.2026919622;珏,-11.5391641988;過,-8.97421484131;嵐,-9.97054828086;姓,-8.77915425874;孔,-7.91216014838;蘭,-5.7846886098;仝,-9.78130628122;作,-7.12273613738;員,-7.86033508051;院,-8.90010686916;煬,-8.12472159036;馮,-9.78130628122;高,-5.13824252229;秦,-8.55348226107;華,-6.47277888957;泱,-13.1486021112;走,-13.1486021112;槳,-12.0499898225;執,-8.81786877092;瑶,-8.04873568338;價,-10.7507068384;典,-8.70595085472;彼,-9.4350300445;寿,-7.22434631379;顾,-9.78130628122;暂,-12.4554549306;栉,-13.1486021112;锋,-9.8527652452;嘍,-13.1486021112;匏,-11.7623077501;炎,-8.09874610396;少,-5.73946566729;麒,-9.68286620841;朗,-7.04828315919;洛,-6.10981856982;抚,-6.90249534572;丝,-8.49464176105;煩,-11.2026919622;袞,-12.0499898225;別,-9.19735839262;馨,-10.7507068384;媪,-13.1486021112;昭,-6.82066532748;振,-6.5932452194;醜,-11.5391641988;谱,-10.1040796735;鯉,-11.2026919622;亲,-7.41526083431;锟,-11.5391641988;銀,-7.27648432173;鴻,-5.16823634609;帽,-10.9513775339;許,-9.68286620841;潇,-9.62224158659;览,-10.7507068384;降,-8.94390949182;韌,-12.4554549306;协,-10.0575596578;郎,-8.03060829879;绒,-10.1040796735;婕,-8.98971902785;烏,-8.03060829879;臘,-8.5738911327;赛,-7.42175436362;獎,-13.1486021112;九,-5.98079292689;远,-7.53913031602;酣,-13.1486021112;团,-10.1040796735;古,-6.91027748617;峦,-11.5391641988;姨,-6.78385135435;柬,-10.6636954614;药,-7.16215010592;仲,-6.63983297423;说,-12.0499898225;瓶,-11.5391641988;凸,-11.7623077501;勺,-10.1040796735;幽,-9.0710646673;翼,-8.70595085472;衔,-9.71461490672;极,-10.3153887672;昀,-11.0691605695;钪,-12.0499898225;計,-10.6636954614;皋,-11.5391641988;同,-7.16215010592;猎,-10.2582303533;徑,-10.3153887672;珙,-11.7623077501;舂,-13.1486021112;研,-10.4405519101;战,-8.90010686916;愚,-10.8460170182;涝,-12.4554549306;黛,-7.22167608524;劣,-12.4554549306;產,-10.5836527537;冥,-10.3153887672;弦,-9.74740472954;箩,-12.4554549306;暫,-12.4554549306;太,-4.73145027397;断,-12.4554549306;萬,-7.20056712203;悯,-12.0499898225;丰,-8.30441502475;洲,-9.62224158659;食,-9.36441247729;爸,-13.1486021112;麻,-7.83539613216;綽,-11.2026919622;尼,-5.79937128659;鼓,-9.71461490672;迅,-8.74188286394;渊,-7.59564252628;資,-9.92972628634;潆,-13.1486021112;雋,-10.9513775339;楊,-7.93911595836;苣,-11.7623077501;像,-12.0499898225;华,-6.47277888957;駕,-10.1040796735;塔,-6.36414504857;杖,-10.204163132;托,-6.9958694165;汜,-9.56508317275;棟,-9.21677647848;埡,-10.9513775339;频,-10.3153887672;畢,-8.68269399255;灤,-11.0691605695;糧,-11.0691605695;彦,-7.12757876186;審,-9.00546738481;奪,-9.81639760103;旭,-7.46162675487;胯,-13.1486021112;据,-13.1486021112;俱,-10.8460170182;买,-9.48504046508;瓷,-10.9513775339;巽,-10.1528698377;鱼,-9.51101595148;签,-11.5391641988;斂,-10.7507068384;脅,-11.7623077501;悄,-12.0499898225;來,-7.1422489516;瘋,-9.48504046508;和,-6.50741994147;透,-11.2026919622;庐,-10.5095447816;娓,-13.1486021112;裂,-10.8460170182;夕,-11.0691605695;郯,-13.1486021112;折,-9.68286620841;丛,-9.8527652452;贝,-6.70129624867;濱,-9.08815910066;尧,-8.85814267006;骨,-8.79189328452;禪,-9.02146772616;蔭,-8.98971902785;漱,-9.45972265709;宾,-7.50315521356;胄,-13.1486021112;汇,-8.69425481495;證,-8.75415295653;槊,-12.0499898225;灏,-12.4554549306;車,-9.71461490672;网,-10.376013389;巒,-11.5391641988;麦,-7.74143033975;著,-10.7507068384;頻,-10.3153887672;湛,-10.3153887672;滎,-10.0131078953;賜,-7.76410704842;因,-7.41202981373;闢,-10.0131078953;入,-8.1927750536;孩,-9.65209454974;虫,-10.0575596578;蕭,-8.75415295653;蓬,-10.1040796735;息,-9.62224158659;揮,-10.376013389;仰,-10.3153887672;詳,-10.9513775339;極,-10.3153887672;裴,-10.9513775339;瑷,-12.4554549306;韶,-9.2984545095;勸,-11.0691605695;幻,-12.4554549306;出,-9.97054828086;顿,-9.65209454974;最,-11.356842642;悅,-9.65209454974;誉,-10.9513775339;型,-10.4405519101;锌,-11.7623077501;熏,-11.356842642;鼐,-8.75415295653;宓,-11.0691605695;斗,-9.2984545095;芙,-9.92972628634;辛,-8.69425481495;鐮,-11.7623077501;豪,-7.54648329033;還,-10.3153887672;眠,-11.2026919622;駿,-9.92972628634;琢,-9.89050557318;猗,-12.4554549306;带,-9.89050557318;窩,-9.59325404972;枫,-9.59325404972;堪,-10.204163132;攬,-13.1486021112;估,-11.5391641988;讳,-12.0499898225;氲,-11.0691605695;喷,-10.5836527537;嘶,-10.4405519101;犹,-11.2026919622;纵,-10.3153887672;盞,-12.4554549306;缓,-9.08815910066;杀,-10.376013389;情,-9.81639760103;淇,-11.0691605695;韋,-8.08600707818;响,-11.356842642;界,-8.88592223416;量,-9.89050557318;黑,-8.69425481495;罐,-12.0499898225;寓,-11.356842642;奔,-10.0575596578;旗,-8.22862118538;晖,-9.56508317275;进,-6.70606194474;聚,-8.65996574147;赜,-11.356842642;纶,-10.5095447816;盡,-9.10555084337;口,-8.01870339628;照,-8.37791748674;巧,-8.62681353416;鹦,-11.0691605695;嫩,-9.8527652452;苦,-10.2582303533;敬,-6.39750064227;艮,-11.5391641988;佰,-10.376013389;汲,-11.356842642;棵,-11.2026919622;陶,-7.89632868316;卸,-9.4350300445;忻,-11.2026919622;遺,-10.5095447816;峽,-10.2582303533;姿,-10.6636954614;驾,-10.1040796735;郁,-10.0131078953;范,-9.10555084337;蒂,-6.57771914887;者,-9.56508317275;鍵,-9.12325042047;洇,-13.1486021112;了,-9.53768419856;國,-4.75992434203;名,-6.79423207041;銎,-12.4554549306;徐,-8.15138983744;粒,-9.78130628122;炅,-10.5836527537;暖,-7.38341100842;掘,-10.3153887672;鸛,-12.4554549306;語,-8.79189328452;垠,-13.1486021112;钢,-8.07969790899;紧,-10.9513775339;度,-8.91449560661;末,-7.77332370352;芮,-13.1486021112;辰,-9.41093249292;韫,-12.0499898225;貲,-12.4554549306;男,-9.68286620841;隶,-8.74188286394;爹,-12.0499898225;鼻,-12.0499898225;為,-6.20741205614;尽,-9.10555084337;嶼,-11.356842642;间,-9.81639760103;晁,-10.9513775339;荃,-10.5836527537;释,-10.5836527537;仆,-8.63774260469;苍,-10.5095447816;闌,-12.0499898225;繹,-10.8460170182;硕,-8.42121429249;委,-10.1040796735;敗,-10.2582303533;菘,-13.1486021112;佛,-8.0548519104;汝,-5.96549040946;獻,-5.40663421139;襟,-13.1486021112;埠,-9.53768419856;健,-7.5576151307;凤,-6.4466417452;穩,-10.2582303533;寨,-8.41240366281;纏,-10.7507068384;辦,-12.4554549306;葭,-10.0575596578;旬,-12.0499898225;述,-9.05425754898;酥,-13.1486021112;長,-5.70904280207;零,-11.2026919622;特,-5.34843904081;司,-7.19276474174;彻,-9.53768419856;盾,-13.1486021112;籽,-10.6636954614;祿,-7.70186473954;潔,-9.0710646673;要,-10.2582303533;栀,-12.0499898225;沃,-7.98954681199;謂,-9.4350300445;辅,-8.08600707818;璦,-12.4554549306;鍇,-13.1486021112;娌,-13.1486021112;序,-10.3153887672;崎,-10.8460170182;冑,-13.1486021112;飞,-7.00441647708;阔,-10.204163132;趙,-7.80149458049;会,-7.81588331794;舜,-8.70595085472;鑼,-13.1486021112;虚,-8.29657184729;皇,-5.94817721826;焦,-10.376013389;閩,-10.204163132;琨,-11.7623077501;被,-9.97054828086;训,-9.71461490672;溯,-10.5836527537;醉,-7.34950945675;薇,-9.56508317275;茲,-7.21106590612;濟,-6.78557400767;傻,-11.7623077501;强,-9.21677647848;皿,-13.1486021112;见,-6.72535514767;桀,-11.356842642;俅,-11.2026919622;苇,-10.7507068384;藉,-13.1486021112;澍,-9.48504046508;经,-7.23780546717;金,-5.32056407908;遐,-12.0499898225;卒,-10.8460170182;諗,-13.1486021112;锱,-12.4554549306;飘,-9.97054828086;佚,-13.1486021112;蛟,-12.0499898225;敞,-11.2026919622;翥,-11.5391641988;鹤,-7.89632868316;煦,-9.92972628634;周,-7.62714119334;坪,-10.1528698377;语,-8.79189328452;浮,-10.3153887672;恰,-9.78130628122;柵,-11.7623077501;晴,-8.95894736918;奶,-8.79189328452;緹,-13.1486021112;僻,-13.1486021112;椁,-10.5095447816;调,-7.71925648225;輅,-11.5391641988;麗,-5.46519843015;與,-8.2069596886;錙,-12.4554549306;验,-11.7623077501;香,-6.43807900175;吓,-11.356842642;樗,-12.4554549306;領,-8.69425481495;洙,-12.4554549306;辚,-13.1486021112;鹭,-13.1486021112;星,-7.44815853782;客,-8.92909440603;弥,-8.72976150341;纤,-11.356842642;鈧,-12.0499898225;陨,-13.1486021112;鋅,-11.7623077501;驕,-12.4554549306;跳,-11.5391641988;港,-10.0131078953;脱,-9.78130628122;莲,-5.99086662696;朵,-10.0131078953;暴,-10.8460170182;稷,-11.5391641988;紹,-6.94202618448;岸,-8.70595085472;阿,-6.77699026397;检,-10.6636954614;饶,-10.8460170182;轅,-9.59325404972;滄,-13.1486021112;扇,-12.0499898225;敉,-13.1486021112;灶,-10.9513775339;嫌,-11.7623077501;鹏,-8.28878970684;遏,-10.6636954614;浙,-9.56508317275;拜,-8.62681353416;晟,-10.204163132;彥,-7.12757876186;剧,-12.4554549306;燦,-9.81639760103;铨,-11.2026919622;衫,-8.3950119201;锦,-6.8405036697;櫬,-13.1486021112;湯,-8.79189328452;淮,-8.63774260469;緒,-9.03772824703;杵,-13.1486021112;更,-8.17186836879;婷,-7.97811811617;絹,-10.0575596578;狼,-9.65209454974;裔,-10.3153887672;梁,-8.11164950879;老,-6.02654222958;樂,-7.58408170388;溅,-13.1486021112;雞,-10.1040796735;昊,-9.56508317275;嬌,-9.38740199551;導,-9.65209454974;傑,-6.97899137871;間,-9.81639760103;划,-12.4554549306;隕,-13.1486021112;栖,-8.81786877092;沙,-7.71925648225;膛,-8.72976150341;业,-8.50421121206;茜,-10.5836527537;夠,-11.356842642;庥,-12.4554549306;璩,-13.1486021112;用,-7.38655072843;领,-8.69425481495;炳,-7.33149095124;侯,-6.87572510466;朴,-9.36441247729;粹,-9.92972628634;冻,-10.7507068384;瞿,-11.5391641988;吾,-8.48516301709;裁,-11.0691605695;跃,-7.92285543749;仅,-12.0499898225;恆,-8.63774260469;蓉,-8.94390949182;效,-9.14126892597;始,-7.19795955862;孌,-10.7507068384;羡,-9.48504046508;僑,-12.4554549306;禹,-8.77915425874;诗,-7.8859119223;煥,-8.87193599219;奠,-10.9513775339;緣,-9.53768419856;驢,-11.356842642;绥,-9.59325404972;珧,-12.4554549306;陪,-11.0691605695;諭,-9.53768419856;濯,-12.4554549306;胱,-10.9513775339;慰,-8.65996574147;色,-8.3950119201;蝴,-10.376013389;顶,-9.2567818131;击,-9.74740472954;幺,-9.00546738481;矿,-9.4350300445;瑾,-9.36441247729;清,-6.03383266284;澄,-9.19735839262;指,-9.74740472954;肆,-12.0499898225;薈,-13.1486021112;蚊,-12.0499898225;完,-9.00546738481;式,-7.31379137414;瀑,-13.1486021112;魚,-9.51101595148;聯,-7.85529728648;袖,-11.7623077501;愛,-5.9022340311;亚,-5.42548201894;期,-10.4405519101;堡,-9.05425754898;鴣,-10.7507068384;骢,-13.1486021112;帥,-8.65996574147;群,-8.17878881163;邦,-6.88711042689;險,-9.53768419856;設,-8.60530732894;伯,-5.55674039632;臉,-9.62224158659;鷲,-11.0691605695;嬷,-8.92909440603;尹,-10.0131078953;嶸,-12.4554549306;爽,-9.2567818131;費,-9.00546738481;邹,-11.2026919622;觀,-8.23594722547;浃,-13.1486021112;久,-8.03060829879;俄,-10.5836527537;荇,-11.7623077501;熠,-13.1486021112;葉,-7.63921377458;奋,-10.5095447816;積,-8.31232020425;富,-6.70129624867;灑,-12.0499898225;镓,-12.4554549306;勒,-6.37666655537;陕,-10.204163132;埔,-10.376013389;狸,-13.1486021112;淘,-9.97054828086;滚,-11.0691605695;菜,-9.71461490672;束,-10.7507068384;忤,-12.4554549306;烦,-11.2026919622;瑩,-9.81639760103;门,-7.79674397773;楫,-13.1486021112;盪,-10.7507068384;詭,-12.4554549306;潯,-12.0499898225;泮,-13.1486021112;违,-12.4554549306;眺,-11.5391641988;青,-6.59609422417;柴,-11.7623077501;屹,-11.0691605695;瑜,-8.81786877092;养,-7.70186473954;建,-5.45238947186;脫,-9.78130628122;链,-11.356842642;言,-8.17878881163;铜,-8.92909440603;涅,-7.85028474466;肇,-8.74188286394;蜀,-8.70595085472;骋,-11.7623077501;妍,-11.7623077501;頌,-10.204163132;鎬,-11.2026919622;玑,-13.1486021112;爐,-12.0499898225;儒,-7.95564526032;梗,-10.7507068384;欖,-11.356842642;辙,-13.1486021112;丘,-7.79201583653;怜,-11.0691605695;审,-9.00546738481;夢,-6.95828670535;尤,-8.91449560661;錦,-6.8405036697;榭,-11.7623077501;莱,-6.13109596826;戰,-8.90010686916;徹,-9.53768419856;常,-7.65966438505;紺,-11.5391641988;值,-10.8460170182;钿,-12.0499898225;眾,-8.67126529673;证,-8.75415295653;跡,-9.68286620841;迂,-12.0499898225;籠,-11.7623077501;立,-5.88737701923;蕊,-9.71461490672;姍,-10.9513775339;发,-6.9727348411;兒,-7.29927733126;闕,-10.2582303533;棗,-11.356842642;乘,-9.34193962144;招,-9.97054828086;浚,-9.62224158659;蓟,-11.0691605695;寡,-10.5836527537;廣,-6.63834377068;工,-9.68286620841;層,-10.5836527537;僧,-7.19276474174;矩,-13.1486021112;器,-9.92972628634;諫,-9.65209454974;番,-10.6636954614;衬,-11.7623077501;泯,-11.7623077501;潮,-9.31996071472;菱,-8.97421484131;扰,-13.1486021112;磷,-11.2026919622;翹,-10.7507068384;幸,-9.34193962144;勻,-10.6636954614;函,-10.376013389;灼,-12.0499898225;哿,-12.4554549306;謁,-11.2026919622;檀,-8.64879244088;七,-7.67213855927;麥,-7.74143033975;有,-5.87273751066;迭,-10.5095447816;程,-9.2567818131;薊,-11.0691605695;复,-6.63240903516;小,-4.5973940412;美,-6.47277888957;熒,-11.5391641988;甕,-11.2026919622;髯,-9.81639760103;栗,-9.65209454974;伙,-10.8460170182;饮,-12.0499898225;颉,-9.10555084337;縣,-8.43907190989;瀚,-10.5095447816;粤,-9.89050557318;厦,-10.7507068384;貝,-6.70129624867;谯,-11.0691605695;憲,-7.68901659706;家,-4.87603150278;庸,-12.4554549306;嶺,-8.29657184729;炼,-10.376013389;術,-8.55348226107;鉴,-9.59325404972;乃,-7.54648329033;观,-8.23594722547;浅,-10.0575596578;泄,-10.7507068384;锵,-12.4554549306;杉,-10.6636954614;屏,-9.48504046508;翎,-11.2026919622;勐,-11.5391641988;燒,-10.5095447816;镕,-9.71461490672;街,-10.4405519101;余,-9.48504046508;付,-9.41093249292;惜,-10.5095447816;章,-8.17186836879;幣,-12.4554549306;峤,-11.356842642;另,-12.0499898225;革,-10.0131078953;雨,-7.48911989545;橫,-9.14126892597;闪,-10.3153887672;業,-8.50421121206;赓,-12.4554549306;修,-7.58792048019;諒,-10.5836527537;顷,-9.97054828086;寶,-5.92822827448;役,-10.0575596578;绸,-10.8460170182;鷺,-13.1486021112;兽,-10.1528698377;謀,-8.97421484131;侃,-10.0575596578;沅,-10.8460170182;洄,-11.356842642;暉,-9.56508317275;月,-7.23509910557;宋,-7.5576151307;萊,-6.13109596826;颍,-9.59325404972;綏,-9.59325404972;銑,-13.1486021112;垓,-12.0499898225;倒,-11.0691605695;钕,-13.1486021112;訖,-13.1486021112;优,-10.1040796735;斟,-12.4554549306;蘞,-13.1486021112;蒼,-10.5095447816;鈦,-11.2026919622;在,-7.53913031602;讫,-13.1486021112;琪,-8.85814267006;梭,-10.6636954614;涯,-13.1486021112;抱,-10.0575596578;焉,-10.6636954614;纹,-8.67126529673;去,-8.59472521961;鳞,-9.51101595148;炽,-10.5836527537;濃,-10.6636954614;桂,-6.83505406493;资,-9.92972628634;曉,-5.50655770833;阶,-9.78130628122;銹,-13.1486021112;韓,-9.02146772616;畔,-11.7623077501;鈐,-11.7623077501;茸,-12.0499898225;仙,-6.67935179441;潘,-9.2774011003;換,-9.78130628122;虞,-8.55348226107;筠,-11.0691605695;峥,-10.1040796735;釧,-8.68269399255;貽,-9.78130628122;毫,-12.0499898225;瑪,-6.98108562032;路,-7.66380517772;湮,-13.1486021112;拱,-9.21677647848;柳,-7.97245237863;聲,-8.79189328452;整,-10.7507068384;婶,-10.4405519101;屺,-11.5391641988;都,-7.90685509615;兼,-9.92972628634;百,-6.35513597863;讀,-10.2582303533;绪,-9.03772824703;氅,-13.1486021112;着,-10.8460170182;嬋,-13.1486021112;鏃,-12.4554549306;刑,-10.9513775339;圓,-7.92824628613;炒,-12.4554549306;吕,-7.96121630537;閔,-10.7507068384;丙,-9.2774011003;郅,-13.1486021112;铮,-11.7623077501;思,-5.50272628602;琛,-11.2026919622;钜,-11.7623077501;宠,-9.65209454974;颢,-12.4554549306;鄧,-9.08815910066;嘩,-11.356842642;咪,-12.4554549306;結,-8.92909440603;亮,-8.24332733277;羈,-12.0499898225;掰,-11.7623077501;悲,-9.48504046508;舟,-9.74740472954;夷,-8.42121429249;魈,-12.0499898225;医,-9.71461490672;难,-9.59325404972;佃,-12.0499898225;棂,-11.0691605695;荷,-8.94390949182;拆,-12.4554549306;晉,-7.71488010765;擊,-9.74740472954;額,-9.03772824703;绎,-10.8460170182;剑,-7.22970825693;靓,-10.4405519101;楗,-11.356842642;論,-11.0691605695;乙,-8.59472521961;还,-10.3153887672;賚,-10.5836527537;滑,-12.0499898225;履,-8.844537018;內,-7.57265300806;齐,-7.89632868316;险,-9.53768419856;哪,-11.7623077501;浯,-12.4554549306;杳,-12.4554549306;惲,-12.4554549306;葵,-12.4554549306;祷,-13.1486021112;競,-9.97054828086;幹,-8.04873568338;裕,-7.57644807903;卻,-11.356842642;偽,-11.7623077501;凼,-11.2026919622;畿,-11.356842642;图,-7.34950945675;趁,-11.7623077501;漂,-11.7623077501;鈀,-13.1486021112;韩,-9.02146772616;龍,-6.54195192501;希,-6.09328926787;骏,-9.92972628634;礎,-12.4554549306;疑,-11.0691605695;吐,-10.3153887672;邓,-9.08815910066;園,-8.28106766075;鈔,-9.89050557318;禮,-6.82963399746;枝,-8.70595085472;由,-7.25972415287;钰,-10.6636954614;沫,-8.13132227439;猪,-11.356842642;辭,-10.5836527537;測,-11.7623077501;戴,-9.68286620841;康,-7.13244495151;縈,-9.38740199551;妹,-8.13796681711;钻,-10.6636954614;詞,-9.62224158659;势,-9.74740472954;毅,-7.76870475767;蛇,-9.48504046508;應,-7.08714519228;铀,-12.4554549306;荊,-9.2984545095;忍,-10.8460170182;奎,-8.41240366281;呐,-12.4554549306;貫,-8.07969790899;赖,-8.67126529673;譚,-10.376013389;柝,-13.1486021112;苟,-12.4554549306;巡,-9.36441247729;屠,-9.8527652452;形,-9.8527652452;寥,-13.1486021112;驤,-12.0499898225;盧,-7.55018015221;遨,-13.1486021112;俭,-10.3153887672;纓,-10.4405519101;旱,-12.0499898225;想,-10.3153887672;杲,-9.53768419856;鈿,-12.0499898225;廷,-6.29635954215;賴,-8.67126529673;孺,-12.4554549306;發,-6.9727348411;勿,-9.97054828086;洁,-9.0710646673;辂,-11.5391641988;蘇,-7.49611293094;脉,-9.68286620841;铭,-8.11164950879;尋,-9.78130628122;莊,-7.72365209372;續,-9.92972628634;騏,-12.4554549306;禎,-9.8527652452;璐,-10.4405519101;垒,-10.3153887672;錕,-11.5391641988;梘,-13.1486021112;朝,-6.03139660804;戟,-12.0499898225;笥,-12.4554549306;储,-9.59325404972;氫,-10.9513775339;翻,-10.1040796735;京,-7.37716098808;榮,-6.91027748617;煉,-10.376013389;耳,-8.14465580526;轔,-13.1486021112;茵,-9.89050557318;帷,-13.1486021112;霽,-10.1528698377;隼,-11.7623077501;爿,-13.1486021112;熾,-10.5836527537;流,-8.35281156561;賀,-8.60530732894;桃,-9.34193962144;濂,-11.356842642;轍,-13.1486021112;屋,-10.1040796735;菊,-8.43010323991;道,-5.99320580931;单,-9.21677647848;訓,-9.71461490672;淖,-11.2026919622;棘,-11.2026919622;葛,-6.7367838435;诚,-8.28106766075;曜,-9.89050557318;絡,-9.68286620841;糠,-11.5391641988;兩,-9.34193962144;烨,-12.0499898225;豫,-8.52362929792;锡,-6.70765557057;潭,-9.48504046508;滬,-9.51101595148;聳,-11.0691605695;蟲,-10.0575596578;拴,-11.2026919622;寺,-8.17186836879;盼,-10.1040796735;苔,-9.59325404972;沁,-9.78130628122;覃,-13.1486021112;輔,-8.08600707818;欄,-11.2026919622;雾,-10.1040796735;页,-12.4554549306;悉,-10.0575596578;愈,-9.92972628634;戊,-10.0131078953;宏,-6.47656916575;唐,-7.64734390066;钯,-13.1486021112;侗,-10.9513775339;裘,-11.5391641988;薛,-9.45972265709;蜜,-10.5095447816;韬,-12.4554549306;素,-7.27086632943;骥,-9.92972628634;嬤,-8.92909440603;琦,-5.52789702437;涫,-12.4554549306;溆,-12.4554549306;亭,-7.52098099752;讯,-13.1486021112;德,-4.50936829388;夸,-10.5095447816;喻,-11.7623077501;隽,-10.9513775339;看,-12.4554549306;县,-8.43907190989;倾,-10.376013389;況,-12.0499898225;赀,-12.4554549306;葆,-9.45972265709;慈,-8.67126529673;绍,-6.94202618448;彌,-8.72976150341;镐,-11.2026919622;動,-10.0131078953;協,-10.0575596578;俗,-10.5095447816;裙,-11.5391641988;耕,-8.83111399767;杜,-7.82559213207;聞,-8.15816952443;峡,-10.2582303533;鵠,-11.0691605695;秣,-12.4554549306;琐,-11.7623077501;孤,-10.0131078953;韧,-12.4554549306;龐,-8.37791748674;烩,-13.1486021112;全,-7.59564252628;剪,-11.0691605695;转,-8.68269399255;衮,-12.0499898225;数,-10.0131078953;至,-7.31087166404;部,-8.71778531236;壹,-13.1486021112;闻,-8.15816952443;空,-10.204163132;国,-4.75992434203;谁,-12.4554549306;紋,-8.67126529673;把,-11.356842642;後,-8.12472159036;笏,-12.4554549306;碎,-10.0131078953;向,-6.59040430839;焓,-13.1486021112;鈕,-12.4554549306;鎔,-9.71461490672;众,-8.67126529673;莘,-13.1486021112;果,-8.51387312298;簡,-9.10555084337;嶠,-11.356842642;红,-6.30591882897;室,-9.05425754898;霧,-10.1040796735;咦,-13.1486021112;倩,-9.97054828086;熨,-12.4554549306;努,-7.42501700925;中,-5.12373996092;队,-10.7507068384;新,-5.8866750185;舵,-10.9513775339;強,-9.21677647848;獵,-10.2582303533;画,-9.89050557318;傾,-10.376013389;汁,-10.2582303533;稱,-7.94459542413;评,-11.356842642;鞠,-11.0691605695;重,-6.75167245599;嵋,-13.1486021112;筏,-13.1486021112;风,-7.48911989545;鑑,-9.59325404972;闐,-9.53768419856;盒,-11.356842642;叔,-6.87008068704;衙,-11.7623077501;敛,-10.7507068384;蝎,-10.5836527537;损,-11.0691605695;廢,-8.97421484131;驥,-9.92972628634;篤,-10.3153887672;爛,-9.53768419856;瓦,-6.55145640932;適,-9.2774011003;默,-7.89632868316;赫,-7.01087505712;约,-8.35281156561;滓,-13.1486021112;譯,-9.92972628634;森,-7.05503234116;葱,-10.376013389;腳,-10.8460170182;曲,-9.2774011003;援,-8.12472159036;島,-8.80479668935;迁,-9.14126892597;啻,-12.4554549306;竺,-9.56508317275;白,-6.88711042689;卿,-9.00546738481;一,-5.26440217753;莉,-8.97421484131;戈,-7.63921377458;脊,-10.3153887672;閬,-12.0499898225;阐,-11.356842642;銓,-11.2026919622;冕,-10.8460170182;記,-9.48504046508;褚,-9.36441247729;搜,-11.5391641988;悟,-7.81588331794;挞,-13.1486021112;御,-7.38028111541;崢,-10.1040796735;馥,-10.7507068384;堤,-10.4405519101;咧,-13.1486021112;玩,-11.0691605695;享,-10.2582303533;優,-10.1040796735;梯,-9.51101595148;肉,-10.8460170182;芳,-7.02610930169;岷,-10.2582303533;脈,-9.68286620841;容,-7.60342466673;软,-10.5836527537;夺,-9.81639760103;喽,-13.1486021112;琼,-8.98971902785;匾,-13.1486021112;俁,-10.6636954614;菡,-13.1486021112;驴,-11.356842642;舊,-13.1486021112;觅,-11.7623077501;锷,-11.356842642;擇,-9.92972628634;杆,-10.1528698377;肅,-8.34458106647;扈,-13.1486021112;腊,-8.5738911327;巍,-7.79674397773;籌,-7.59952602631;限,-10.5095447816;燕,-7.52458460502;箏,-13.1486021112;泗,-10.1040796735;藥,-7.16215010592;楚,-6.98318425697;藝,-8.09235630586;惟,-8.77915425874;翡,-12.4554549306;嫣,-12.0499898225;邺,-10.1528698377;姥,-7.85529728648;铧,-13.1486021112;坦,-7.36170472984;叩,-10.9513775339;簽,-11.5391641988;軫,-13.1486021112;警,-10.9513775339;豬,-11.356842642;靈,-7.15215002259;趼,-12.0499898225;柱,-8.04265663731;蕲,-12.0499898225;对,-10.0131078953;電,-10.5095447816;祺,-7.57644807903;闽,-10.204163132;呼,-10.0131078953;鍾,-13.1486021112;企,-8.67126529673;涂,-10.9513775339;椅,-12.0499898225;澗,-10.0131078953;萇,-10.3153887672;按,-9.59325404972;燭,-10.8460170182;崍,-13.1486021112;鄰,-10.0575596578;隐,-9.2984545095;閒,-10.7507068384;儕,-13.1486021112;餘,-9.48504046508;謙,-5.75042801824;誘,-13.1486021112;莞,-11.2026919622;綢,-10.8460170182;夥,-10.8460170182;鐧,-13.1486021112;驰,-10.376013389;猩,-12.0499898225;动,-10.0131078953;丫,-7.59952602631;绳,-8.3950119201;议,-9.2567818131;朱,-8.1649954895;戳,-12.4554549306;媸,-12.0499898225;嘻,-10.9513775339;禺,-12.4554549306;钼,-12.4554549306;潁,-9.59325404972;什,-10.7507068384;棄,-8.85814267006;摇,-7.1571375641;草,-8.11816418981;苈,-11.7623077501;顏,-8.0069385547;盐,-9.45972265709;烧,-10.5095447816;汗,-9.62224158659;陸,-8.15816952443;譙,-11.0691605695;虛,-8.29657184729;罡,-12.0499898225;廠,-10.5095447816;巢,-8.98971902785;奥,-7.2324000486;运,-7.83048211736;湫,-11.5391641988;萦,-9.38740199551;顼,-11.5391641988;東,-5.95191554037;曰,-9.65209454974;艳,-7.97245237863;筹,-7.59952602631;登,-6.9958694165;灿,-9.81639760103;現,-9.92972628634;躁,-13.1486021112;航,-10.1528698377;梅,-7.35558850282;文,-4.63883643562;昆,-8.23594722547;舒,-8.36111036842;律,-6.58052419979;鲍,-10.3153887672;福,-5.2369115905;税,-10.1528698377;頡,-9.10555084337;炕,-12.4554549306;響,-11.356842642;世,-4.97700263086;攜,-12.4554549306;舞,-10.1528698377;纡,-12.0499898225;张,-7.5576151307;宣,-6.55282159724;喧,-12.0499898225;瘦,-11.7623077501;助,-10.5836527537;倪,-11.7623077501;轻,-9.78130628122;莳,-11.7623077501;帶,-9.89050557318;嬸,-10.4405519101;瞻,-10.6636954614;砺,-11.0691605695;璽,-10.4405519101;爾,-4.14540891746;仁,-6.31664854564;诃,-8.58425391974;求,-9.2567818131;装,-10.8460170182;襄,-8.11164950879;拉,-5.21301472562;聊,-13.1486021112;穎,-8.49464176105;监,-6.23785132324;坐,-12.4554549306;鉑,-11.356842642;僕,-8.63774260469;兔,-10.8460170182;乖,-12.0499898225;識,-10.5836527537;蓝,-8.62681353416;閻,-8.61600261805;绡,-13.1486021112;獨,-7.70618440068;眼,-9.48504046508;漚,-13.1486021112;杰,-6.97899137871;巷,-11.2026919622;并,-11.0691605695;竹,-8.03661432285;學,-5.44019144395;韻,-9.05425754898;顺,-6.35401553033;丁,-7.30216333615;澀,-12.0499898225;沂,-10.9513775339;栅,-11.7623077501;榄,-11.356842642;舉,-9.0710646673;授,-10.2582303533;弋,-9.2984545095;莖,-10.4405519101;對,-10.0131078953;夏,-8.1927750536;阑,-12.0499898225;蠡,-9.15961806464;瀕,-11.5391641988;熔,-11.2026919622;洗,-11.356842642;準,-10.6636954614;標,-9.53768419856;殘,-10.6636954614;望,-8.13796681711;萝,-12.4554549306;斜,-10.2582303533;鸡,-10.1040796735;徠,-11.356842642;岢,-11.356842642;砥,-10.8460170182;妤,-12.4554549306;利,-5.37922350169;漫,-8.72976150341;身,-9.62224158659;谭,-10.376013389;昱,-10.1528698377;茳,-13.1486021112;撲,-11.5391641988;庶,-12.4554549306;宸,-10.376013389;圻,-13.1486021112;儿,-7.29927733126;劾,-11.5391641988;激,-10.7507068384;桅,-13.1486021112;规,-10.2582303533;軍,-6.35850487569;齋,-9.8527652452;惊,-10.2582303533;奏,-9.74740472954;罌,-11.2026919622;卓,-8.22862118538;瓒,-10.8460170182;偕,-12.0499898225;诏,-9.23657910578;他,-10.8460170182;橙,-12.0499898225;棚,-11.0691605695;藜,-12.0499898225;幡,-11.2026919622;忠,-6.59895136897;季,-7.83048211736;顥,-12.4554549306;剩,-12.4554549306;襯,-11.7623077501;致,-8.43907190989;延,-6.39516419261;驹,-10.2582303533;寸,-11.356842642;命,-8.55348226107;鍔,-11.356842642;退,-10.6636954614;瞅,-13.1486021112;祠,-9.65209454974;專,-9.41093249292;範,-9.10555084337;铷,-13.1486021112;炬,-11.2026919622;貓,-10.0131078953;欒,-11.7623077501;辕,-9.59325404972;渔,-10.3153887672;疙,-12.0499898225;羅,-5.69272542371;颛,-12.4554549306;宝,-5.92822827448;娜,-8.27340478801;废,-8.97421484131;涩,-12.0499898225;谨,-9.97054828086;炫,-10.6636954614;伪,-11.7623077501;键,-9.12325042047;禱,-13.1486021112;堰,-11.356842642;岳,-8.22134842605;贵,-6.46649351376;徵,-7.84529720315;芷,-10.5836527537;方,-5.67212973004;萸,-13.1486021112;机,-10.0131078953;亿,-10.7507068384;派,-9.59325404972;燁,-12.0499898225;賡,-12.4554549306;铃,-9.97054828086;錆,-13.1486021112;附,-11.0691605695;竇,-11.356842642;赠,-11.0691605695;屈,-10.7507068384;齊,-7.89632868316;桐,-9.48504046508;泓,-10.0575596578;雉,-12.0499898225;乔,-7.85529728648;勗,-13.1486021112;兖,-13.1486021112;员,-7.86033508051;飛,-7.00441647708;坚,-8.38642817641;廟,-9.4350300445;换,-9.78130628122;查,-8.55348226107;晤,-11.356842642;楦,-13.1486021112;烫,-13.1486021112;班,-8.75415295653;鉬,-12.4554549306;雯,-9.53768419856;駱,-13.1486021112;鳳,-6.4466417452;念,-8.60530732894;年,-9.89050557318;慶,-6.31557037842;藹,-9.05425754898;仿,-10.4405519101;傀,-13.1486021112;球,-9.92972628634;厂,-10.5095447816;雛,-11.356842642;的,-9.23657910578;娇,-9.38740199551;妆,-10.6636954614;紉,-13.1486021112;羊,-7.69328099585;昏,-11.2026919622;輪,-12.4554549306;谓,-9.4350300445;輕,-9.78130628122;五,-7.77332370352;列,-7.10596927752;骜,-12.0499898225;鸟,-9.89050557318;悠,-11.356842642;探,-9.68286620841;镰,-11.7623077501;洩,-10.7507068384;倫,-6.28062770224;侪,-13.1486021112;嘯,-9.34193962144;單,-9.21677647848;失,-10.6636954614;碰,-12.0499898225;張,-7.5576151307;户,-9.74740472954;憶,-9.48504046508;改,-7.97811811617;蒸,-13.1486021112;螺,-10.4405519101;欽,-7.47527884403;誼,-8.08600707818;允,-8.36947861809;参,-8.80479668935;雄,-7.83048211736;迟,-8.58425391974;姆,-6.23685481095;配,-10.6636954614;恋,-10.9513775339;翊,-6.18163497259;苌,-10.3153887672;晏,-10.0131078953;诒,-10.6636954614;何,-9.00546738481;仔,-10.1040796735;留,-7.74592472933;孝,-6.39633173506;幟,-13.1486021112;州,-6.90249534572;惠,-6.79423207041;董,-9.2567818131;来,-7.1422489516;蛤,-9.45972265709;触,-12.4554549306;浩,-8.31232020425;注,-10.1040796735;火,-8.77915425874;俪,-13.1486021112;独,-7.70618440068;谏,-9.65209454974;问,-9.23657910578;声,-8.79189328452;米,-6.93800203418;駒,-10.2582303533;维,-5.7031845545;艷,-7.97245237863;懶,-12.4554549306;濁,-10.5836527537;譽,-10.9513775339;阴,-8.58425391974;邁,-8.48516301709;儀,-8.25825298298;喃,-13.1486021112;霄,-10.0575596578;宇,-7.56135345281;順,-6.35401553033;粉,-9.51101595148;莩,-13.1486021112;涓,-12.4554549306;井,-8.13796681711;演,-8.29657184729;逖,-11.5391641988;甘,-8.87193599219;窝,-9.59325404972;铿,-11.7623077501;龟,-9.12325042047;股,-10.376013389;翱,-13.1486021112;质,-9.34193962144;醫,-9.71461490672;个,-12.0499898225;劭,-10.8460170182;琮,-10.4405519101;选,-9.71461490672;娲,-12.4554549306;庵,-9.62224158659;缴,-12.0499898225;获,-13.1486021112;耶,-7.27930519807;连,-7.02610930169;便,-10.5836527537;锻,-12.0499898225;烁,-13.1486021112;兀,-9.21677647848;芊,-13.1486021112;雅,-7.28781588774;靄,-11.5391641988;寇,-9.97054828086;顆,-11.7623077501;懋,-9.59325404972;拍,-12.4554549306;柏,-7.05729222913;號,-12.4554549306;詒,-10.6636954614;仕,-8.63774260469;佔,-8.21412817808;受,-9.48504046508;镘,-13.1486021112;邻,-10.0575596578;属,-9.74740472954;惡,-10.5836527537;桦,-10.7507068384;鉛,-10.6636954614;鍬,-13.1486021112;矯,-11.0691605695;罩,-10.9513775339;巳,-11.7623077501;绵,-9.14126892597;恶,-10.5836527537;數,-10.0131078953;智,-7.16215010592;汾,-12.4554549306;送,-12.0499898225;冀,-10.204163132;阅,-11.2026919622;垄,-12.0499898225;纥,-13.1486021112;尉,-8.06719774622;戍,-12.4554549306;掌,-8.52362929792;树,-6.50221159636;般,-10.7507068384;丕,-8.64879244088;北,-7.17225120191;翅,-8.58425391974;宜,-7.82559213207;弟,-9.2567818131;怡,-9.10555084337;蔣,-9.53768419856;抢,-12.4554549306;春,-6.15926684523;鋇,-11.2026919622;欧,-9.74740472954;梦,-6.95828670535;邀,-12.0499898225;涨,-10.5836527537;溪,-7.71925648225;爭,-7.96121630537;繳,-12.0499898225;眯,-12.4554549306;钮,-12.4554549306;報,-10.3153887672;樽,-11.5391641988;沾,-10.6636954614;净,-10.2582303533;狂,-11.7623077501;际,-9.36441247729;綠,-6.96858545755;词,-9.62224158659;態,-11.7623077501;才,-7.86539838247;杏,-8.83111399767;擎,-10.0131078953;桑,-8.27340478801;槐,-10.6636954614;浓,-10.6636954614;溢,-9.89050557318;南,-6.27543827699;僖,-10.0131078953;鄉,-9.21677647848;糞,-13.1486021112;萍,-9.31996071472;散,-9.02146772616;藺,-12.0499898225;歧,-9.81639760103;淨,-10.2582303533;八,-8.26580018862;仪,-8.25825298298;召,-8.62681353416;瓮,-11.2026919622;称,-7.94459542413;絳,-10.6636954614;捷,-8.0069385547;摹,-11.7623077501;秋,-5.52887789742;使,-9.41093249292;賾,-11.356842642;刀,-9.4350300445;鄂,-9.4350300445;各,-9.31996071472;驍,-13.1486021112;师,-5.99164574659;祖,-7.11073119128;而,-8.67126529673;衅,-11.2026919622;亓,-12.0499898225;椒,-10.4405519101;气,-7.92824628613;邗,-12.0499898225;化,-7.04604351659;媛,-10.1528698377;甚,-11.356842642;妝,-10.6636954614;粟,-12.0499898225;锄,-12.0499898225;採,-8.1927750536;薰,-10.8460170182;劫,-11.5391641988;洪,-6.5819296814;倬,-12.4554549306;咯,-13.1486021112;蹬,-11.7623077501;箱,-10.6636954614;騰,-8.17186836879;纳,-6.47530414344;茶,-7.65143388591;蘸,-12.0499898225;蔺,-12.0499898225;覽,-10.7507068384;格,-5.36246567342;沿,-9.12325042047;漾,-11.7623077501;剀,-12.4554549306;鑄,-10.7507068384;壇,-10.4405519101;筆,-10.4405519101;职,-10.4405519101;李,-6.8405036697;译,-9.92972628634;仓,-8.2069596886;閏,-11.2026919622;卖,-9.19735839262;韙,-11.356842642;阎,-8.61600261805;姝,-12.4554549306;蔻,-13.1486021112;握,-13.1486021112;慢,-10.9513775339;日,-7.43817509383;武,-6.27233749932;浪,-9.10555084337;凭,-11.0691605695;穰,-11.7623077501;廳,-10.5836527537;頒,-10.9513775339;櫻,-11.356842642;槽,-10.2582303533;純,-9.02146772616;錁,-10.8460170182;犀,-11.7623077501;锅,-13.1486021112;纈,-10.8460170182;愍,-11.2026919622;悌,-12.0499898225;搏,-13.1486021112;专,-9.41093249292;逗,-11.356842642;玖,-11.5391641988;隘,-12.4554549306;娛,-12.4554549306;喚,-10.7507068384;颜,-8.0069385547;從,-7.54648329033;鵝,-10.6636954614;蔥,-10.376013389;聰,-9.71461490672;亨,-8.21412817808;别,-9.19735839262;鄭,-9.19735839262;催,-11.5391641988;启,-6.52586578726;鬱,-10.0131078953;鸳,-12.0499898225;妲,-13.1486021112;踐,-9.78130628122;興,-6.71888263317;椽,-12.0499898225;补,-9.41093249292;达,-6.35850487569;十,-7.96681856091;狀,-9.23657910578;畅,-11.7623077501;哄,-11.356842642;密,-7.13978892576;廈,-10.7507068384;手,-10.376013389;緊,-10.9513775339;背,-10.0131078953;鷹,-9.45972265709;角,-9.34193962144;隆,-7.43817509383;魏,-7.4055989234;遗,-10.5095447816;取,-9.12325042047;静,-7.58792048019;盘,-8.85814267006;嗚,-12.0499898225;祝,-9.36441247729;籟,-10.6636954614;荡,-10.7507068384;桧,-9.65209454974;详,-10.9513775339;佩,-6.98318425697;滨,-9.08815910066;六,-7.88074395214;筱,-9.4350300445;平,-6.40572147541;鳴,-8.47577327674;職,-10.4405519101;書,-6.78041492486;錠,-13.1486021112;旺,-8.74188286394;裼,-11.7623077501;犁,-10.7507068384;匀,-10.6636954614;适,-9.2774011003;甄,-12.4554549306;妇,-11.2026919622;弈,-12.0499898225;尊,-8.18575748095;明,-5.16721052963;鏘,-12.4554549306;謐,-11.7623077501;输,-10.5095447816;皙,-12.4554549306;團,-10.1040796735;宛,-9.97054828086;额,-9.03772824703;夜,-10.204163132;鸞,-10.7507068384;枣,-11.356842642;隨,-9.2984545095;玫,-9.78130628122;傭,-12.4554549306;疯,-9.48504046508;阮,-10.5836527537;嬰,-10.7507068384;難,-9.59325404972;粵,-9.89050557318;崴,-11.5391641988;戶,-9.74740472954;携,-12.4554549306;祈,-10.0131078953;举,-9.0710646673;勁,-8.79189328452;區,-11.5391641988;埃,-7.9336663536;遂,-8.41240366281;铅,-10.6636954614;婆,-7.1422489516;廉,-8.69425481495;父,-9.34193962144;族,-9.92972628634;虎,-6.84232682426;歐,-9.74740472954;绢,-10.0575596578;法,-7.21106590612;浔,-12.0499898225;釗,-10.1528698377;剖,-13.1486021112;雙,-7.24870475762;瑚,-13.1486021112;祜,-10.7507068384;繞,-10.7507068384;恢,-9.81639760103;滩,-10.1528698377;叫,-10.204163132;汪,-10.204163132;热,-9.2984545095;公,-5.55926628804;闯,-7.3196564936;礼,-6.82963399746;嫱,-12.4554549306;馗,-12.4554549306;懷,-7.30796045383;扶,-9.97054828086;曹,-8.59472521961;读,-10.2582303533;渾,-10.3153887672;藩,-9.65209454974;楼,-8.64879244088;乾,-7.48217542309;鈁,-13.1486021112;鋁,-9.53768419856;圃,-10.7507068384;善,-7.62314917207;备,-8.23594722547;骆,-13.1486021112;縉,-10.3153887672;很,-12.4554549306;聂,-11.356842642;谕,-9.53768419856;涔,-10.5095447816;犖,-12.0499898225;阙,-10.2582303533;笛,-9.41093249292;咚,-12.0499898225;雪,-6.74007332015;庞,-8.37791748674;戡,-13.1486021112;营,-8.3202883739;誦,-11.5391641988;温,-7.53913031602;侨,-12.4554549306;猫,-10.0131078953;沪,-9.51101595148;冬,-8.00110763439;唯,-9.02146772616;皮,-7.63114921474;娱,-12.4554549306;宰,-9.59325404972;盲,-11.356842642;嶴,-13.1486021112;愷,-9.48504046508;枸,-12.4554549306;財,-9.4350300445;栽,-12.0499898225;烂,-9.53768419856;奇,-7.37405056566;恍,-13.1486021112;谣,-13.1486021112;敏,-7.27367138035;蛎,-13.1486021112;潛,-9.2567818131;项,-10.6636954614;体,-6.92206544192;棒,-10.5095447816;汕,-12.4554549306;藏,-8.91449560661;兗,-13.1486021112;勖,-13.1486021112;筛,-11.2026919622;瓚,-10.8460170182;硝,-10.8460170182;姜,-8.68269399255;點,-8.74188286394;藤,-8.0069385547;筐,-11.7623077501;陽,-6.3870293424;卫,-6.99799934276;質,-9.34193962144;目,-8.91449560661;賁,-10.4405519101;寰,-13.1486021112;飲,-12.0499898225;巴,-6.39750064227;慷,-12.4554549306;虹,-10.0575596578;死,-10.5095447816;滾,-11.0691605695;羁,-12.0499898225;厅,-10.5836527537;鈄,-13.1486021112;庇,-9.56508317275;紆,-12.0499898225;須,-8.98971902785;蒋,-9.53768419856;融,-8.98971902785;昌,-7.00656470562;芏,-13.1486021112;蛙,-10.1528698377;隗,-11.7623077501;锖,-13.1486021112;写,-12.4554549306;岛,-8.80479668935;錚,-11.7623077501;帜,-13.1486021112;搠,-13.1486021112;接,-9.68286620841;产,-10.5836527537;钫,-13.1486021112;霆,-10.0131078953;垭,-10.9513775339;琳,-9.03772824703;綱,-9.74740472954;玉,-5.07769602242;玲,-7.97245237863;宵,-11.356842642;娴,-11.356842642;收,-9.81639760103;耸,-11.0691605695;治,-7.22434631379;挺,-9.36441247729;辽,-8.0548519104;調,-7.71925648225;隴,-9.51101595148;呀,-11.7623077501;烃,-13.1486021112;坂,-10.4405519101;騷,-11.7623077501;织,-10.9513775339;秉,-5.15802522946;蓋,-8.17186836879;苏,-7.49611293094;慎,-9.02146772616;豐,-8.30441502475;毕,-8.68269399255;詔,-9.23657910578;鲸,-9.19735839262;燙,-13.1486021112;灘,-10.1528698377;博,-6.46900292536;忝,-13.1486021112;竟,-10.5095447816;神,-7.46842950219;菥,-12.4554549306;浦,-8.74188286394;桨,-12.0499898225;铫,-13.1486021112;歪,-12.0499898225;短,-11.2026919622;兮,-10.6636954614;己,-11.0691605695;绩,-9.92972628634;署,-10.3153887672;寵,-9.65209454974;婴,-10.7507068384;追,-10.6636954614;锁,-8.58425391974;垂,-9.21677647848;包,-9.92972628634;郭,-9.17831019765;服,-9.31996071472;憎,-13.1486021112;沐,-11.2026919622;栓,-12.0499898225;嘗,-10.0575596578;焙,-10.9513775339;傘,-11.7623077501;厚,-8.40366998284;府,-7.48564163107;妞,-12.0499898225;蔡,-9.19735839262;挥,-10.376013389;护,-8.14465580526;润,-7.03935452844;梨,-9.15961806464;含,-8.90010686916;圭,-9.78130628122;醮,-13.1486021112;蕉,-9.08815910066;羲,-8.37791748674;鐸,-10.9513775339;莺,-9.89050557318;閆,-11.2026919622;谢,-8.97421484131;赴,-11.7623077501;镁,-10.5836527537;哀,-8.90010686916;灃,-11.5391641988;埂,-10.6636954614;獅,-9.19735839262;狄,-8.79189328452;繇,-10.3153887672;奉,-8.01870339628;浑,-10.3153887672;桓,-7.71925648225;濒,-11.5391641988;闖,-7.3196564936;煙,-9.23657910578;烘,-13.1486021112;彝,-9.00546738481;络,-9.68286620841;荥,-10.0131078953;钧,-8.1649954895;湧,-10.7507068384;淦,-10.2582303533;鑫,-8.69425481495;副,-10.1040796735;燮,-9.81639760103;統,-7.81588331794;峰,-8.36111036842;穆,-7.25144824357;时,-6.32640472059;胸,-11.356842642;湾,-9.34193962144;载,-9.38740199551;溫,-7.53913031602;璁,-12.4554549306;阂,-12.4554549306;銅,-8.92909440603;錄,-9.14126892597;将,-7.1546406839;墉,-10.6636954614;斋,-9.8527652452;怎,-11.356842642;覓,-11.7623077501;備,-8.23594722547;刚,-8.07342829597;蘢,-13.1486021112;报,-10.3153887672;侧,-10.0575596578;谦,-5.75042801824;横,-9.14126892597;銳,-8.18575748095;环,-8.61600261805;粱,-11.356842642;細,-8.97421484131;禳,-12.0499898225;嬴,-10.9513775339;搶,-12.4554549306;脸,-9.62224158659;似,-8.90010686916;殿,-8.31232020425;栾,-11.7623077501;品,-9.34193962144;燃,-11.5391641988;騁,-11.7623077501;育,-7.70618440068;奈,-8.12472159036;旋,-9.89050557318;赐,-7.76410704842;槓,-12.0499898225;烙,-13.1486021112;階,-9.78130628122;移,-9.53768419856;察,-9.03772824703;塞,-6.88330089847;臣,-7.71488010765;示,-10.376013389;拥,-9.65209454974;牧,-8.10517699429;滕,-9.59325404972;楨,-11.7623077501;闫,-11.2026919622;园,-8.28106766075;睬,-13.1486021112;可,-5.82279460861;遮,-13.1486021112;干,-8.04873568338;嫵,-13.1486021112;惹,-11.5391641988;腸,-9.81639760103;添,-10.1040796735;艺,-8.09235630586;潼,-12.4554549306;吁,-13.1486021112;喀,-8.06719774622;韪,-11.356842642;厄,-8.95894736918;缇,-13.1486021112;砉,-11.356842642;妈,-8.91449560661;骊,-11.356842642;统,-7.81588331794;茏,-13.1486021112;民,-7.62314917207;霍,-8.38642817641;候,-9.36441247729;熘,-13.1486021112;鴛,-12.0499898225;銚,-13.1486021112;帝,-6.71405559242;龜,-9.12325042047;鬟,-12.0499898225;增,-6.47404071939;暢,-11.7623077501;甫,-8.10517699429;說,-12.0499898225;匯,-8.69425481495;就,-10.8460170182;纲,-9.74740472954;宴,-10.2582303533;活,-10.3153887672;丽,-5.46519843015;滋,-10.1528698377;直,-8.21412817808;元,-5.37374634454;盂,-10.8460170182;鉅,-11.7623077501;穷,-12.4554549306;鈾,-12.4554549306;楓,-9.59325404972;軒,-9.68286620841;評,-11.356842642;比,-6.912232521;胡,-7.65143388591;釘,-11.7623077501;嵛,-12.4554549306;孟,-7.41850232823;碩,-8.42121429249;葡,-11.7623077501;无,-7.89110673918;轧,-12.0499898225;賦,-10.1528698377;槨,-10.5095447816;畫,-9.89050557318;苓,-13.1486021112;鋼,-8.07969790899;山,-6.16111186421;女,-8.67126529673;婵,-13.1486021112;懸,-11.5391641988;骁,-13.1486021112;闾,-11.7623077501;濼,-12.4554549306;達,-6.35850487569;袁,-8.3202883739;劃,-12.4554549306;内,-7.57265300806;安,-6.1788114413;娈,-10.7507068384;養,-7.70186473954;萌,-10.1528698377;茎,-10.4405519101;侑,-13.1486021112;丐,-11.2026919622;誓,-11.0691605695;洒,-12.0499898225;榕,-11.356842642;钗,-7.84529720315;圖,-7.34950945675;刘,-7.31671963392;焚,-11.356842642;盛,-7.61917302369;墟,-10.7507068384;笞,-13.1486021112;映,-9.89050557318;祚,-8.11164950879;沧,-13.1486021112;伦,-6.28062770224;让,-9.34193962144;閭,-11.7623077501;听,-9.62224158659;献,-5.40663421139;钉,-11.7623077501;媳,-9.2567818131;銣,-13.1486021112;場,-10.5095447816;莹,-9.81639760103;舸,-13.1486021112;鶴,-7.89632868316;韁,-12.0499898225;濡,-11.356842642;勃,-8.15816952443;蘊,-9.81639760103;築,-9.89050557318;蛋,-10.8460170182;藍,-8.62681353416;近,-8.88592223416;乐,-7.58408170388;櫓,-11.7623077501;浒,-11.356842642;桔,-13.1486021112;哗,-11.356842642;靖,-8.52362929792;叙,-9.51101595148;绛,-10.6636954614;党,-11.5391641988;川,-7.53547400482;壟,-12.0499898225;锐,-8.18575748095;邑,-8.90010686916;拣,-12.4554549306;敢,-10.376013389;车,-9.71461490672;科,-6.38587260427;餮,-13.1486021112;睦,-9.59325404972;聽,-9.62224158659;烯,-10.204163132;忱,-13.1486021112;鹰,-9.45972265709;絲,-8.49464176105;蝶,-10.0131078953;任,-8.71778531236;纾,-11.2026919622;省,-10.0131078953;刃,-10.376013389;算,-11.2026919622;將,-7.1546406839;菀,-12.0499898225;嬉,-11.0691605695;窈,-12.4554549306;蘋,-13.1486021112;莎,-8.43010323991;休,-9.15961806464;源,-7.33746111823;樓,-8.64879244088;梔,-12.0499898225;猙,-13.1486021112;銘,-8.11164950879;帛,-9.65209454974;鲜,-10.0575596578;实,-8.11816418981;針,-10.3153887672;渚,-10.4405519101;氧,-12.0499898225;侦,-13.1486021112;誨,-13.1486021112;親,-7.41526083431;锭,-13.1486021112;咬,-10.4405519101;玮,-9.97054828086;弱,-11.356842642;稳,-10.2582303533;網,-10.376013389;茹,-10.3153887672;芸,-11.356842642;主,-7.90157803905;膺,-12.4554549306;洽,-10.5095447816;沼,-11.0691605695;设,-8.60530732894;睁,-12.0499898225;雀,-8.98971902785;充,-9.4350300445;忆,-9.48504046508;等,-9.62224158659;晋,-7.71488010765;姊,-9.81639760103;里,-5.49986232225;潑,-9.97054828086;畏,-10.8460170182;勘,-12.0499898225;絝,-13.1486021112;条,-9.68286620841;曠,-10.5095447816;扣,-12.0499898225;既,-10.5836527537;胤,-9.89050557318;迦,-8.50421121206;镭,-13.1486021112;灯,-10.376013389;叮,-12.4554549306;影,-9.14126892597;绰,-11.2026919622;已,-10.5836527537;風,-7.48911989545;泼,-9.97054828086;桿,-10.1528698377;漁,-10.3153887672;傅,-9.38740199551;億,-10.7507068384;霖,-9.81639760103;帆,-8.90010686916;枋,-10.8460170182;頊,-11.5391641988;逋,-12.0499898225;戎,-9.81639760103;云,-5.85354569474;伐,-8.43907190989;讓,-9.34193962144;谒,-11.2026919622;倚,-10.7507068384;肥,-10.9513775339;涧,-10.0131078953;並,-11.0691605695;謨,-9.12325042047;株,-11.356842642;钭,-13.1486021112;甬,-10.7507068384;冯,-9.78130628122;纱,-9.2774011003;缰,-12.0499898225;头,-8.72976150341;斷,-12.4554549306;昶,-11.5391641988;芹,-10.8460170182;索,-7.11551588941;鸽,-11.5391641988;沽,-12.4554549306;洼,-10.6636954614;榿,-12.4554549306;樾,-12.4554549306;雁,-6.7907598447;址,-12.0499898225;參,-8.80479668935;呂,-7.96121630537;僅,-12.0499898225;兄,-7.33149095124;珠,-8.42121429249;納,-6.47530414344;操,-11.7623077501;扎,-7.51739032938;仑,-9.92972628634;佐,-8.08600707818;毓,-8.95894736918;棕,-10.5095447816;務,-8.91449560661;做,-12.4554549306;杠,-12.0499898225;渺,-13.1486021112;胥,-9.4350300445;书,-6.78041492486;矫,-11.0691605695;髦,-11.2026919622;哭,-13.1486021112;啬,-12.0499898225;凯,-7.47872118823;彰,-9.59325404972;籲,-13.1486021112;奴,-9.14126892597;旷,-10.5095447816;晶,-8.79189328452;苹,-13.1486021112;焕,-8.87193599219;恺,-9.48504046508;泽,-5.55321483235;槿,-10.9513775339;阁,-8.51387312298;磁,-10.2582303533;瀅,-13.1486021112;熄,-13.1486021112;崇,-6.56243045635;庆,-6.31557037842;守,-6.67780260742;朋,-9.71461490672;損,-11.0691605695;斌,-9.2774011003;意,-9.2774011003;丑,-11.5391641988;笙,-12.4554549306;沒,-10.7507068384;锗,-13.1486021112;皖,-10.2582303533;则,-7.22970825693;厘,-9.78130628122;尝,-10.0575596578;綜,-10.9513775339;够,-11.356842642;骞,-9.51101595148;驱,-10.6636954614;洧,-13.1486021112;亦,-7.27367138035;聆,-13.1486021112;喬,-7.85529728648;焯,-13.1486021112;銮,-10.3153887672;縱,-10.3153887672;铉,-11.356842642;笳,-10.8460170182;堵,-12.4554549306;速,-9.10555084337;蔷,-12.0499898225;船,-10.5095447816;涼,-8.17186836879;椿,-9.81639760103;練,-10.204163132;千,-8.58425391974;铂,-11.356842642;嵇,-13.1486021112;细,-8.97421484131;婉,-7.97811811617;閃,-10.3153887672;磊,-11.0691605695;俐,-11.2026919622;類,-10.3153887672;盖,-8.17186836879;变,-8.31232020425;竞,-9.97054828086;蟠,-9.10555084337;荣,-6.91027748617;赧,-10.6636954614;滦,-11.0691605695;詩,-7.8859119223;瑭,-12.0499898225;狮,-9.19735839262;翰,-8.41240366281;塵,-10.6636954614;敷,-10.9513775339;舍,-8.36947861809;胺,-13.1486021112;西,-5.86928327579;諾,-6.47530414344;禁,-9.36441247729;待,-9.34193962144;劇,-12.4554549306;合,-7.92285543749;責,-11.356842642;憑,-11.0691605695;耐,-9.2567818131;觐,-11.0691605695;枕,-10.5836527537;昔,-8.91449560661;窗,-11.2026919622;外,-9.2774011003;尘,-10.6636954614;鮮,-10.0575596578;锞,-10.8460170182;沣,-11.5391641988;欢,-8.83111399767;两,-9.34193962144;答,-10.4405519101;银,-7.27648432173;薩,-6.73514315404;萨,-6.73514315404;未,-8.72976150341;箭,-9.97054828086;纯,-9.02146772616;熱,-9.2984545095;腮,-10.6636954614;嘴,-10.2582303533;褶,-11.7623077501;永,-5.42814041661;莽,-9.51101595148;放,-9.12325042047;础,-12.4554549306;魂,-10.7507068384;必,-7.79674397773;鹄,-11.0691605695;勇,-8.31232020425;兆,-6.20837964209;呈,-8.77915425874;棋,-10.2582303533;坊,-9.97054828086;母,-7.59952602631;济,-6.78557400767;恐,-10.5836527537;蓓,-13.1486021112;荒,-10.4405519101;晔,-10.6636954614;奖,-13.1486021112;迪,-6.87761367935;烛,-10.8460170182;鏝,-13.1486021112;盟,-10.8460170182;镞,-12.4554549306;賣,-9.19735839262;止,-10.1528698377;迥,-12.0499898225;早,-9.81639760103;士,-5.25242150259;杪,-13.1486021112;马,-5.67837797531;絮,-7.31671963392;凱,-7.47872118823;灰,-11.7623077501;獲,-13.1486021112;韵,-9.05425754898;噴,-10.5836527537;惻,-13.1486021112;揽,-13.1486021112;替,-10.9513775339;蕾,-9.81639760103;礁,-10.8460170182;庄,-7.72365209372;切,-8.28878970684;针,-10.3153887672;栋,-9.21677647848;踏,-11.5391641988;莒,-13.1486021112;朕,-10.6636954614;稗,-13.1486021112;首,-8.62681353416;崙,-9.92972628634;瀛,-8.74188286394;龚,-11.2026919622;銜,-9.71461490672;嘟,-12.0499898225;氣,-7.92824628613;交,-9.71461490672;鸯,-13.1486021112;鯨,-9.19735839262;焱,-12.4554549306;邰,-13.1486021112;吳,-8.17878881163;厲,-9.41093249292;嚴,-8.28106766075;费,-9.00546738481;沸,-10.4405519101;总,-8.04873568338;挽,-11.356842642;押,-9.59325404972;蘿,-12.4554549306;祁,-9.68286620841;寂,-12.0499898225;组,-9.68286620841;則,-7.22970825693;准,-10.6636954614;哈,-6.82963399746;穗,-10.0575596578;陟,-10.5095447816;驗,-11.7623077501;黄,-8.08600707818;询,-10.4405519101;令,-7.76870475767;执,-8.81786877092;懦,-13.1486021112;填,-11.2026919622;錛,-12.0499898225;共,-8.68269399255;味,-10.2582303533;史,-8.27340478801;围,-10.1040796735;浹,-13.1486021112;恻,-13.1486021112;濺,-13.1486021112;拼,-13.1486021112;颁,-10.9513775339;綃,-13.1486021112;弄,-10.3153887672;率,-8.67126529673;逆,-10.5836527537;璉,-8.5738911327;锈,-13.1486021112;見,-6.72535514767;阊,-13.1486021112;斓,-11.0691605695;戒,-11.7623077501;蚕,-9.92972628634;朔,-10.204163132;宗,-4.50759963406;砖,-10.5095447816;岙,-13.1486021112;鳥,-9.89050557318;军,-6.35850487569;鸚,-11.0691605695;劝,-11.0691605695;龄,-9.74740472954;趣,-13.1486021112;溥,-9.51101595148;伤,-11.2026919622;第,-9.14126892597;瓜,-9.71461490672;邱,-9.74740472954;琉,-10.8460170182;殷,-10.1040796735;蠶,-9.92972628634;油,-9.97054828086;为,-6.20741205614;芽,-10.1040796735;壁,-8.48516301709;祀,-12.0499898225;哉,-12.0499898225;構,-10.3153887672;歌,-9.41093249292;俏,-12.4554549306;豎,-11.7623077501;惑,-11.356842642;峙,-11.356842642;嵘,-12.4554549306;凛,-13.1486021112;勝,-7.40239892067;卜,-7.60733856605;域,-9.65209454974;瑞,-6.01291476418;裡,-5.49986232225;楠,-10.3153887672;詢,-10.4405519101;以,-6.25291941346;潤,-7.03935452844;羽,-8.83111399767;韦,-8.08600707818;籮,-12.4554549306;兰,-5.7846886098;闳,-12.0499898225;请,-10.4405519101;绶,-7.71488010765;浸,-11.2026919622;臻,-12.0499898225;鹫,-11.0691605695;柿,-10.376013389;頁,-12.4554549306;馀,-12.0499898225;崃,-13.1486021112;帅,-8.65996574147;径,-10.3153887672;吉,-5.80776655708;椋,-12.4554549306;隊,-10.7507068384;伏,-8.62681353416;憐,-11.0691605695;芒,-9.92972628634;昕,-11.356842642;顯,-7.52098099752;颖,-8.49464176105;鐾,-12.0499898225;黎,-8.26580018862;庚,-7.96121630537;初,-8.01870339628;土,-8.43010323991;璞,-10.7507068384;校,-8.00110763439;责,-11.356842642;檢,-10.6636954614;严,-8.28106766075;滇,-10.376013389;茧,-12.4554549306;悦,-9.65209454974;夫,-5.51040386692;粮,-11.0691605695;週,-7.62714119334;冰,-6.32640472059;申,-9.14126892597;劲,-8.79189328452;阵,-9.21677647848;真,-6.90443521054;氹,-11.2026919622;人,-6.94606659402;郴,-13.1486021112;秀,-6.12306379657;嫂,-9.34193962144;幅,-13.1486021112;升,-8.07969790899;闈,-11.7623077501;益,-7.21370791559;住,-11.5391641988;拒,-11.5391641988;處,-8.0548519104;柔,-9.21677647848;字,-8.88592223416;篩,-11.2026919622;鸥,-10.7507068384;澤,-5.55321483235;衡,-9.12325042047;浣,-13.1486021112;纫,-13.1486021112;濤,-10.0575596578;捧,-12.4554549306;摩,-6.10719044741;旨,-9.51101595148;婭,-10.9513775339;寬,-8.58425391974;凰,-11.7623077501;镳,-11.2026919622;陵,-7.32555621572;聿,-10.3153887672;歷,-9.71461490672;豹,-13.1486021112;艽,-12.4554549306;板,-9.53768419856;擾,-13.1486021112;宁,-6.50872627738;稀,-10.2582303533;黔,-9.62224158659;射,-10.4405519101;匆,-12.4554549306;成,-6.18446649879;谂,-13.1486021112;斕,-11.0691605695;詹,-11.7623077501;碗,-10.5095447816;龙,-6.54195192501;力,-6.31126929652;倜,-12.4554549306;钟,-7.732501709;霞,-7.86033508051;计,-10.6636954614;疇,-12.4554549306;昨,-11.356842642;蘆,-10.6636954614;到,-9.89050557318;儲,-9.59325404972;吴,-8.17878881163;边,-9.65209454974;丸,-9.78130628122;贺,-8.60530732894;膽,-9.92972628634;蒿,-11.2026919622;避,-11.5391641988;练,-10.204163132;奂,-13.1486021112;陈,-7.8859119223;請,-10.4405519101;啊,-13.1486021112;桌,-10.3153887672;藕,-7.82559213207;策,-8.59472521961;忙,-11.0691605695;騎,-9.81639760103;凝,-9.97054828086;停,-11.0691605695;非,-8.03661432285;诡,-12.4554549306;代,-7.27930519807;淥,-12.0499898225;汤,-8.79189328452;惧,-9.89050557318;荦,-12.0499898225;晨,-8.71778531236;給,-11.2026919622;塬,-12.0499898225;识,-10.5836527537;置,-7.75953038139;闵,-10.7507068384;紇,-13.1486021112;表,-9.08815910066;迹,-9.68286620841;邕,-10.5836527537;苻,-10.204163132;松,-7.0824940211;布,-6.16296029357;如,-7.0778643832;紅,-6.30591882897;历,-9.71461490672;圉,-12.0499898225;韭,-13.1486021112;喊,-12.4554549306;植,-9.59325404972;氏,-6.53521789283;澎,-11.0691605695;挑,-11.356842642;易,-7.98954681199;蒔,-11.7623077501;缙,-10.3153887672;鹅,-10.6636954614;创,-9.97054828086;煮,-10.9513775339;炜,-9.81639760103;吟,-10.1528698377;次,-8.98971902785;誠,-8.28106766075;渣,-11.7623077501;津,-7.56135345281;沤,-13.1486021112;性,-8.71778531236;暨,-13.1486021112;騫,-9.51101595148;胆,-9.92972628634;夭,-11.7623077501;微,-7.67213855927;阳,-6.3870293424;冲,-7.96121630537;电,-10.5095447816;样,-9.51101595148;悼,-9.8527652452;穴,-9.51101595148;魁,-13.1486021112;鹃,-13.1486021112;假,-11.356842642;缠,-10.7507068384;盈,-7.36477692888;橋,-8.844537018;镶,-10.6636954614;俎,-13.1486021112;荑,-13.1486021112;拐,-11.2026919622;晓,-5.50655770833;懒,-12.4554549306;塗,-10.9513775339;绘,-11.0691605695;剛,-8.07342829597;線,-8.87193599219;系,-9.34193962144;瑟,-8.22134842605;韞,-12.0499898225;歡,-8.83111399767;貼,-11.7623077501;賤,-10.9513775339;祭,-10.204163132;磬,-11.2026919622;屯,-8.59472521961;繼,-6.44296301635;危,-11.356842642;勰,-12.4554549306;陳,-7.8859119223;鋒,-9.8527652452;谧,-11.7623077501;滸,-11.356842642;淺,-10.0575596578;突,-10.9513775339;堂,-8.72976150341;約,-8.35281156561;醇,-11.5391641988;分,-8.67126529673;圈,-10.0131078953;残,-10.6636954614;吊,-10.8460170182;与,-8.2069596886;抑,-10.6636954614;怒,-10.2582303533;攔,-10.5836527537;妗,-13.1486021112;庙,-9.4350300445;弘,-7.58025760745;玛,-6.98108562032;尚,-7.08714519228;欠,-12.0499898225;辣,-9.62224158659;蠢,-12.0499898225;沥,-11.7623077501;贤,-7.90157803905;木,-6.39750064227;宫,-7.74143033975;鶯,-9.89050557318;帮,-11.7623077501;励,-11.0691605695;麓,-9.97054828086;進,-6.70606194474;钵,-10.376013389;锴,-13.1486021112;訶,-8.58425391974;伸,-10.376013389;显,-7.52098099752;钞,-9.89050557318;心,-6.49316176084;變,-8.31232020425;組,-9.68286620841;凇,-13.1486021112;薪,-10.6636954614;遵,-8.68269399255;毋,-11.5391641988;告,-11.356842642;赣,-10.2582303533;乎,-10.5836527537;苑,-10.204163132;荐,-11.7623077501;染,-12.0499898225;恒,-8.63774260469;姗,-10.9513775339;给,-11.2026919622;郝,-11.5391641988;迤,-10.6636954614;俣,-10.6636954614;桢,-11.7623077501;泥,-9.89050557318;荧,-11.5391641988;艦,-10.7507068384;杨,-7.93911595836;寫,-12.4554549306;郦,-13.1486021112;緯,-6.64731244067;印,-9.08815910066;石,-6.90443521054;遲,-8.58425391974;畴,-12.4554549306;荟,-13.1486021112;潸,-13.1486021112;項,-10.6636954614;決,-10.8460170182;能,-5.90866951989;晾,-11.7623077501;威,-6.96033798812;简,-9.10555084337;弃,-8.85814267006;聶,-11.356842642;阗,-9.53768419856;嘉,-5.36039055336;逍,-12.4554549306;钊,-10.1528698377;蠍,-10.5836527537;輸,-10.5095447816;贏,-9.92972628634;于,-7.15215002259;我,-11.5391641988;薔,-12.0499898225;帙,-13.1486021112;猛,-9.97054828086;岚,-9.97054828086;瀝,-11.7623077501;农,-8.70595085472;生,-6.54195192501;模,-9.41093249292;梢,-8.81786877092;涤,-10.376013389;愧,-12.4554549306;芦,-10.6636954614;陆,-8.15816952443;頭,-8.72976150341;馬,-5.67837797531;爱,-5.9022340311;现,-9.92972628634;傲,-11.2026919622;鐵,-6.62210725164;輯,-10.6636954614;丹,-7.22702369156;政,-6.31234283393;驁,-12.0499898225;節,-9.56508317275;居,-4.99755716552;護,-8.14465580526;钠,-11.7623077501;瓊,-8.98971902785;衍,-8.74188286394;赏,-10.0575596578;从,-7.54648329033;扑,-11.5391641988;提,-7.71488010765;杓,-12.0499898225;霭,-11.5391641988;套,-11.5391641988;竖,-11.7623077501;翘,-10.7507068384;鍛,-12.0499898225;灝,-12.4554549306;凜,-13.1486021112;啟,-6.52586578726;回,-9.00546738481;詡,-10.4405519101;佣,-12.4554549306;淤,-10.6636954614;慧,-6.93800203418;拦,-10.5836527537;诩,-10.4405519101;孫,-6.49316176084;姬,-9.74740472954;台,-8.01870339628;靳,-11.5391641988;呵,-12.4554549306;痴,-11.7623077501;楷,-11.0691605695;諶,-12.4554549306;俸,-10.5095447816;荻,-11.2026919622;泺,-12.4554549306;恽,-12.4554549306;懼,-9.89050557318;曾,-8.77915425874;境,-9.71461490672;异,-8.53348159436;宅,-9.65209454974;鷗,-10.7507068384;嚇,-11.356842642;冉,-8.50421121206;眭,-13.1486021112;湖,-8.23594722547;侍,-8.15816952443;渌,-12.0499898225;斑,-11.7623077501;店,-13.1486021112;崖,-9.2984545095;妙,-9.17831019765;超,-7.63921377458;钛,-11.2026919622;功,-9.00546738481;谠,-12.4554549306;漢,-6.53521789283;疊,-10.6636954614;铝,-9.53768419856;岫,-10.376013389;挪,-12.4554549306;央,-9.23657910578;閱,-11.2026919622;琰,-11.2026919622;傳,-5.88457196831;露,-9.00546738481;鎵,-12.4554549306;鈴,-9.97054828086;核,-10.376013389;撻,-13.1486021112;贛,-10.2582303533;罂,-11.2026919622;寅,-9.51101595148;驄,-13.1486021112;商,-8.14465580526;凉,-8.17186836879;半,-9.03772824703;乌,-8.03060829879;塘,-8.65996574147;铛,-13.1486021112;孚,-9.92972628634;煞,-12.4554549306;淡,-9.62224158659;池,-9.59325404972;潢,-12.4554549306;该,-11.5391641988;敦,-8.71778531236;恨,-11.356842642;稅,-10.1528698377;端,-8.17878881163;奮,-10.5095447816;闱,-11.7623077501;鑰,-12.0499898225;鄒,-11.2026919622;籁,-10.6636954614;剴,-12.4554549306;价,-10.7507068384;拿,-9.71461490672;腾,-8.17186836879;頃,-9.97054828086;颗,-11.7623077501;疆,-10.7507068384;儉,-10.3153887672;邈,-12.4554549306;谋,-8.97421484131;謖,-10.5836527537;伍,-9.14126892597;二,-5.77397309599;黃,-8.08600707818;君,-6.57492194425;定,-6.67162974832;贡,-9.68286620841;負,-10.8460170182;蠣,-13.1486021112;薦,-11.7623077501;簫,-11.5391641988;措,-11.7623077501;纬,-6.64731244067;妮,-11.356842642;唱,-13.1486021112;環,-8.61600261805;鑲,-10.6636954614;霁,-10.1528698377;殺,-10.376013389;房,-8.85814267006;管,-8.42121429249;陇,-9.51101595148;光,-5.5653545869;烈,-8.3950119201;及,-8.91449560661;位,-11.2026919622;滌,-10.376013389;救,-10.1528698377;拔,-7.79201583653;壘,-10.3153887672;瑛,-10.5095447816;野,-8.90010686916;雜,-13.1486021112;牟,-10.6636954614;泠,-12.4554549306;衣,-8.72976150341;鬥,-9.2984545095;步,-8.10517699429;旦,-9.2984545095;彭,-9.45972265709;廬,-10.5095447816;習,-9.62224158659;卵,-10.1528698377;淶,-11.2026919622;楹,-10.9513775339;诺,-6.47530414344;曼,-7.4315744098;承,-5.42548201894;體,-6.92206544192;岁,-12.4554549306;紀,-6.96858545755;妃,-12.0499898225;市,-8.53348159436;酒,-10.0575596578;瞇,-12.4554549306;理,-7.51024744187;炉,-12.0499898225;刊,-10.8460170182;躍,-7.92285543749;栎,-10.1528698377;繆,-9.36441247729;貂,-10.9513775339;投,-10.2582303533;得,-6.43200733769;尖,-9.68286620841;鈺,-10.6636954614;霜,-9.97054828086;原,-7.73695605935;逞,-11.0691605695;没,-10.7507068384;枧,-13.1486021112;爰,-12.4554549306;肩,-10.0131078953;截,-12.4554549306;庭,-8.01280367416;缬,-10.8460170182;钱,-9.81639760103;田,-6.83686730205;决,-10.8460170182;防,-10.5836527537;猴,-9.68286620841;錫,-6.70765557057;樺,-10.7507068384;琴,-8.85814267006;峁,-11.5391641988;礪,-11.0691605695;鹂,-13.1486021112;魄,-13.1486021112;呆,-10.8460170182;先,-5.7528805026;淋,-11.356842642;削,-11.5391641988;仍,-13.1486021112;每,-13.1486021112;羹,-10.7507068384;晒,-12.0499898225;志,-5.79487978081;游,-9.89050557318;奘,-9.0710646673;驚,-10.2582303533;睜,-12.0499898225;叟,-12.4554549306;鋤,-12.0499898225;泡,-10.7507068384;浠,-12.0499898225;解,-8.70595085472;此,-12.4554549306;葦,-10.7507068384;慨,-12.4554549306;巫,-10.204163132;续,-9.92972628634;逼,-11.0691605695;異,-8.53348159436;勵,-11.0691605695;却,-11.356842642;迷,-11.356842642;汶,-10.1040796735;裹,-12.0499898225;楸,-11.7623077501;藻,-10.1040796735;杼,-12.0499898225;封,-8.40366998284;鸾,-10.7507068384;娅,-10.9513775339;紗,-9.2774011003;震,-7.27930519807;倉,-8.2069596886;洋,-9.0710646673;不,-8.03060829879;澌,-13.1486021112;萑,-12.4554549306;斐,-7.86033508051;弗,-7.38970033733;鐫,-12.4554549306;锛,-12.0499898225;媚,-8.56363463254;践,-9.78130628122;谡,-10.5836527537;亢,-11.356842642;軋,-12.0499898225;殤,-12.0499898225;憨,-11.356842642;紫,-7.48564163107;荆,-9.2984545095;席,-10.6636954614;鬯,-12.4554549306;薜,-11.5391641988;郑,-9.19735839262;爵,-8.63774260469;根,-7.71925648225;攻,-9.0710646673;屁,-10.1040796735;驅,-10.6636954614;寄,-6.65939717988;均,-8.59472521961;偉,-7.10834739993;燈,-10.376013389;测,-11.7623077501;藶,-11.7623077501;湍,-12.4554549306;行,-6.92206544192;葑,-9.62224158659;鹿,-7.22434631379;彗,-13.1486021112;糖,-9.8527652452;秘,-8.98971902785;畛,-13.1486021112;陝,-10.204163132;矜,-12.0499898225;象,-7.29066895672;楣,-13.1486021112;滢,-13.1486021112;恩,-6.19396324633;臨,-8.28106766075;繭,-12.4554549306;魯,-5.60798058255;壮,-7.95564526032;闰,-11.2026919622;关,-7.69756365764;煒,-9.81639760103;創,-9.97054828086;觸,-12.4554549306;蕻,-12.4554549306;櫺,-11.0691605695;征,-7.84529720315;禅,-9.02146772616;璇,-10.1040796735;圆,-7.92824628613;厉,-9.41093249292;事,-8.58425391974;谌,-12.4554549306;岗,-8.43907190989;湘,-7.2324000486;宙,-9.81639760103;娘,-6.42236870885;際,-9.36441247729;多,-6.96239348731;渠,-9.74740472954;财,-9.4350300445;朦,-12.4554549306;掩,-13.1486021112;童,-8.58425391974;庫,-8.15816952443;維,-5.7031845545;颯,-12.4554549306;遜,-8.74188286394;贲,-10.4405519101;劳,-7.71052280228;甲,-7.47872118823;况,-12.0499898225;買,-9.48504046508;伶,-12.4554549306;樸,-9.36441247729;施,-7.24051917304;翁,-9.74740472954;幀,-13.1486021112;訊,-13.1486021112;叉,-10.2582303533;介,-5.89938705409;煊,-11.7623077501;绣,-9.23657910578;柑,-13.1486021112;拓,-10.6636954614;联,-7.85529728648;鳗,-13.1486021112;许,-9.68286620841;四,-6.22202507798;奚,-11.7623077501;蕙,-11.7623077501;呜,-12.0499898225;烟,-9.23657910578;卞,-12.4554549306;信,-6.79946311983;习,-9.62224158659;赢,-9.92972628634;桤,-12.4554549306;蝦,-10.9513775339;落,-9.81639760103;屬,-9.74740472954;壯,-7.95564526032;陰,-8.58425391974;勳,-8.65996574147;釵,-7.84529720315;側,-10.0575596578;佶,-12.0499898225;骧,-12.0499898225;骄,-12.4554549306;鏵,-13.1486021112;娃,-9.68286620841;预,-10.0575596578;垆,-10.9513775339;下,-8.28106766075;冊,-10.376013389;貌,-11.0691605695;栏,-11.2026919622;悔,-11.7623077501;嬙,-12.4554549306;窘,-13.1486021112;轮,-12.4554549306;璜,-11.7623077501;瀟,-9.62224158659;樣,-9.51101595148;萧,-8.75415295653;鐳,-13.1486021112;麈,-13.1486021112;師,-5.99164574659;集,-8.53348159436;堯,-8.85814267006;宮,-7.74143033975;鲤,-11.2026919622;谷,-8.14465580526;珈,-12.4554549306;謹,-9.97054828086;锰,-13.1486021112;覺,-8.34458106647;蔽,-12.4554549306;撼,-12.4554549306;耿,-9.62224158659;珮,-13.1486021112;绀,-11.5391641988;饅,-13.1486021112;飄,-9.97054828086;卉,-12.0499898225;之,-5.30514570683;蕴,-9.81639760103;村,-8.61600261805;打,-10.4405519101;逡,-13.1486021112;慕,-8.53348159436;鱗,-9.51101595148;孙,-6.49316176084;芥,-13.1486021112;韜,-12.4554549306;姚,-10.1040796735;狻,-9.65209454974;詣,-13.1486021112;澧,-13.1486021112;血,-10.3153887672;幫,-11.7623077501;自,-5.85830922876;硯,-8.95894736918;遼,-8.0548519104;困,-13.1486021112;闲,-10.7507068384;兵,-7.27086632943;烴,-13.1486021112;諸,-8.07342829597;蓼,-12.0499898225;恿,-13.1486021112;开,-6.01132367395;訪,-10.6636954614;处,-8.0548519104;喇,-9.71461490672;阆,-12.0499898225;劉,-7.31671963392;逊,-8.74188286394;洌,-12.4554549306;規,-10.2582303533;暑,-10.5836527537;莓,-11.356842642;砚,-8.95894736918;苗,-9.92972628634;甜,-9.74740472954;鈞,-8.1649954895;传,-5.88457196831;氢,-10.9513775339;魔,-9.68286620841;芩,-13.1486021112;茨,-8.79189328452;岭,-8.29657184729;馳,-10.376013389;隱,-9.2984545095;地,-7.65143388591;邵,-10.6636954614;鄴,-10.1528698377;蔼,-9.05425754898;繡,-9.23657910578;层,-10.5836527537;嗇,-12.0499898225;濠,-11.0691605695;勉,-9.8527652452;午,-8.844537018;遊,-9.89050557318;材,-10.376013389;賢,-7.90157803905;惕,-11.7623077501;腔,-10.204163132;緗,-13.1486021112;鸣,-8.47577327674;站,-13.1486021112;存,-7.20843085849;矛,-11.7623077501;塚,-9.48504046508;違,-12.4554549306;镜,-7.83048211736;營,-8.3202883739;鉞,-10.7507068384;满,-6.99799934276;你,-9.78130628122;诣,-13.1486021112;爺,-10.204163132;蒲,-10.7507068384;旧,-13.1486021112;择,-9.92972628634;快,-11.0691605695;聪,-9.71461490672;峭,-13.1486021112;鵬,-8.28878970684;积,-8.31232020425;物,-8.65996574147;右,-8.74188286394;醒,-9.89050557318;僵,-11.7623077501;兴,-6.71888263317;混,-10.7507068384;歸,-9.08815910066;菽,-12.4554549306;懿,-8.25825298298;艾,-8.10517699429;币,-12.4554549306;往,-10.2582303533;笃,-10.3153887672;岂,-11.2026919622;堅,-8.38642817641;禄,-7.70186473954;唇,-10.2582303533;皆,-9.2774011003;鈉,-11.7623077501;邊,-9.65209454974;涌,-10.7507068384;析,-10.6636954614;撒,-9.92972628634;磚,-10.5095447816;崗,-8.43907190989;纖,-11.356842642;官,-6.95215798341;碚,-13.1486021112;喜,-7.71925648225;办,-12.4554549306;渡,-8.3950119201;侠,-11.356842642;欣,-8.18575748095;貢,-9.68286620841;戩,-11.7623077501;莨,-11.7623077501;綬,-7.71488010765;窮,-12.4554549306;錳,-13.1486021112;溶,-10.4405519101;樹,-6.50221159636;灵,-7.15215002259;搽,-13.1486021112;於,-10.9513775339;愿,-12.0499898225;繁,-9.68286620841;起,-7.61521262248;镇,-7.71052280228;盆,-10.376013389;鉉,-11.356842642;又,-8.06719774622;烊,-12.0499898225;淌,-12.0499898225;虑,-10.5095447816;某,-8.72976150341;擒,-10.0131078953;恕,-10.7507068384;廖,-9.31996071472;败,-10.2582303533;坛,-10.4405519101;壚,-10.9513775339;關,-7.69756365764;勞,-7.71052280228;乡,-9.21677647848;俠,-11.356842642;正,-5.943709601;波,-6.86820627225;桥,-8.844537018;曦,-9.89050557318;鑽,-10.6636954614;鹳,-12.4554549306;祯,-9.8527652452;即,-10.1040796735;哲,-7.97245237863;偵,-13.1486021112;燴,-13.1486021112;海,-5.6202703445;件,-11.0691605695;橹,-11.7623077501;诸,-8.07342829597;棺,-9.4350300445;腿,-10.2582303533;拾,-13.1486021112;
+M,ns:怀,-10.4299240238;茂,-10.8353891319;伊,-6.85882760536;抗,-11.9340014206;料,-12.6271486012;洞,-9.13064103969;錢,-10.3245635082;礦,-10.4299240238;河,-5.1321623672;临,-10.6812384521;然,-8.91357653445;场,-9.33131173515;线,-11.9340014206;牌,-11.5285363125;姑,-8.86594848546;筒,-11.9340014206;織,-10.6812384521;苗,-7.49724988623;遠,-8.08385381888;卢,-8.48401387476;知,-10.1422419514;扬,-8.77700099944;泳,-12.6271486012;其,-6.7410445697;绿,-7.15068504922;愁,-11.24085424;榆,-9.73677684326;沈,-11.5285363125;应,-12.6271486012;謝,-12.6271486012;厢,-11.24085424;循,-11.5285363125;芬,-8.75594759024;爷,-10.3245635082;冶,-9.7939352571;咸,-9.7939352571;砻,-8.1728013049;视,-12.6271486012;赉,-11.24085424;賈,-8.84295896723;運,-6.63318717385;契,-12.6271486012;罕,-9.6314163276;黔,-11.24085424;教,-9.68270962199;衛,-8.18449734466;也,-6.3281993543;淞,-9.29494409098;盤,-7.08981433413;秦,-10.6812384521;峨,-11.9340014206;景,-8.08385381888;棰,-11.9340014206;须,-9.22595121949;基,-6.17195003781;广,-7.37487517311;門,-5.47487974512;上,-8.43749385913;后,-10.0621992437;碑,-10.5477070595;經,-8.48401387476;底,-7.62320229521;蒙,-4.9981447115;剛,-9.29494409098;邡,-12.6271486012;閣,-11.0177106887;岩,-8.39304209656;鴨,-8.84295896723;足,-9.36905206313;頂,-7.05119949801;甸,-9.49165438522;尾,-10.0621992437;泉,-7.05880409739;聖,-9.25985277117;敘,-11.9340014206;虚,-10.6812384521;濟,-8.08385381888;牢,-8.82048611138;坤,-9.91909840005;寧,-5.39441546497;柯,-10.1422419514;棱,-9.53610614779;淳,-10.2292533284;轴,-12.6271486012;灶,-10.1422419514;老,-9.01623068851;节,-9.01623068851;帕,-8.82048611138;肖,-10.4299240238;冠,-11.9340014206;锣,-11.5285363125;脫,-7.99241961292;纪,-8.39304209656;术,-8.77700099944;稽,-9.49165438522;歇,-7.72187382271;汉,-6.54264918808;克,-4.78369219678;車,-8.20830799336;前,-8.84295896723;双,-7.46809330194;翔,-10.8353891319;科,-7.27056232648;勢,-11.5285363125;蓮,-9.40827277628;卷,-10.2292533284;固,-10.1422419514;脂,-9.29494409098;萄,-6.12886645168;辉,-10.3245635082;昭,-7.95431976669;库,-7.03989994275;堂,-9.91909840005;尔,-3.59318747651;邮,-10.4299240238;沟,-7.83965685837;義,-6.81900611117;披,-11.9340014206;水,-6.04928724343;猶,-10.4299240238;町,-10.5477070595;所,-10.6812384521;重,-11.9340014206;结,-10.0621992437;饒,-9.19316139667;鏡,-10.6812384521;監,-12.6271486012;瑤,-8.11628909464;学,-9.91909840005;總,-9.98809127154;淵,-9.7939352571;汴,-10.2292533284;培,-8.82048611138;陸,-10.3245635082;髻,-11.24085424;技,-9.07180053966;越,-11.0177106887;雾,-8.84295896723;岔,-8.75594759024;掖,-10.4299240238;谟,-10.4299240238;加,-4.56692436071;贵,-7.76733619679;貴,-7.76733619679;碼,-10.2292533284;故,-8.42245598176;配,-12.6271486012;城,-5.61053891726;駒,-11.24085424;江,-4.60951144124;连,-6.18460843468;卡,-6.99593681933;略,-8.50001421611;彩,-10.8353891319;賴,-10.2292533284;遷,-9.85455987891;叶,-10.4299240238;相,-9.07180053966;屿,-9.49165438522;争,-11.9340014206;王,-7.02502978027;谊,-8.20830799336;嘎,-8.88947898287;窑,-9.4490947708;條,-8.25770074869;垣,-8.35048248214;莫,-9.40827277628;斯,-3.6128231131;澳,-8.35048248214;冷,-11.0177106887;霸,-11.5285363125;聂,-8.50001421611;友,-9.7939352571;汊,-10.4299240238;煌,-8.50001421611;子,-6.93678914683;曙,-10.8353891319;毛,-10.4299240238;占,-8.86594848546;哥,-6.49158371007;普,-6.88735568897;議,-9.85455987891;輕,-10.4299240238;壽,-9.6314163276;幾,-8.01202808431;會,-7.65733530158;三,-5.66301298873;鼓,-8.86594848546;尕,-12.6271486012;亞,-5.10096968781;圣,-9.25985277117;大,-3.69348442245;窦,-10.2292533284;支,-7.22898589963;許,-11.5285363125;漳,-10.0621992437;廓,-12.6271486012;靈,-8.25770074869;庾,-8.98956244143;权,-10.1422419514;义,-6.81900611117;迈,-9.6314163276;泊,-6.79526612387;凌,-8.40764089598;当,-8.1728013049;展,-9.85455987891;柘,-10.8353891319;據,-8.12733893082;衝,-11.5285363125;珠,-8.05243762265;奧,-8.3786533591;繩,-9.33131173515;荫,-10.8353891319;峪,-8.05243762265;棲,-11.5285363125;具,-11.9340014206;铺,-10.5477070595;肃,-6.82805594669;權,-10.1422419514;鞍,-7.93580071892;依,-8.53280403893;东,-4.7681216214;傣,-8.19633180231;座,-9.7939352571;撫,-8.58409733332;徽,-6.63818718426;社,-9.98809127154;旁,-9.49165438522;觉,-11.5285363125;归,-9.98809127154;保,-7.79883486385;楞,-8.91357653445;面,-9.49165438522;句,-7.97318825099;給,-8.29641526087;慮,-11.24085424;深,-12.6271486012;雷,-7.699894916;當,-8.1728013049;峻,-11.24085424;考,-9.13064103969;茅,-9.19316139667;万,-8.77700099944;圍,-11.24085424;頓,-8.58409733332;徒,-9.85455987891;輝,-10.3245635082;锡,-8.07327170955;連,-6.18460843468;天,-7.18041122949;墨,-9.19316139667;音,-7.84802510804;洱,-9.6314163276;農,-8.19633180231;野,-9.85455987891;體,-9.10078807654;揚,-8.77700099944;機,-7.14650967781;灣,-5.77384950797;勤,-11.0177106887;左,-8.75594759024;磨,-11.5285363125;杭,-9.29494409098;良,-9.22595121949;泰,-6.85570747802;兹,-6.7217867531;郸,-9.33131173515;驿,-11.5285363125;昂,-10.6812384521;開,-7.66430397089;樊,-9.36905206313;隍,-8.46826551779;林,-5.61143618067;溝,-7.83965685837;碩,-12.6271486012;本,-5.33617382301;沱,-7.60326808031;琶,-10.0621992437;爺,-10.3245635082;宿,-10.1422419514;時,-11.24085424;棉,-10.5477070595;雍,-8.46826551779;結,-10.0621992437;孔,-11.24085424;作,-8.58409733332;員,-12.6271486012;釣,-11.9340014206;院,-8.02197841516;壩,-9.10078807654;票,-11.5285363125;華,-4.688346353;走,-10.0621992437;執,-10.6812384521;瑶,-8.11628909464;典,-10.0621992437;彼,-6.81900611117;寿,-9.6314163276;榈,-8.93826914704;锋,-11.0177106887;少,-10.3245635082;朗,-7.30413862201;洛,-5.3908092584;抚,-8.58409733332;丝,-11.24085424;遵,-11.24085424;別,-6.45128133105;窪,-11.9340014206;蘭,-5.22530702241;振,-12.6271486012;樵,-10.4299240238;帽,-12.6271486012;墾,-12.6271486012;览,-9.91909840005;郎,-8.79850720466;臘,-8.24512196648;赛,-8.53280403893;九,-9.73677684326;远,-8.08385381888;古,-5.3750946493;药,-11.9340014206;鹿,-7.08588505599;瓶,-10.1422419514;鹽,-8.91357653445;翼,-9.49165438522;极,-7.59671067976;皋,-11.24085424;同,-8.01202808431;研,-11.0177106887;蒗,-11.9340014206;战,-10.4299240238;產,-12.6271486012;太,-6.9233661265;断,-7.33384377643;萬,-8.77700099944;肯,-8.77700099944;都,-6.09627097343;丰,-7.83965685837;洲,-6.45963211026;券,-10.2292533284;麻,-10.0621992437;尼,-4.22873894573;渊,-9.7939352571;但,-9.33131173515;楊,-8.88947898287;烏,-8.07327170955;华,-4.688346353;塔,-6.42866988466;杖,-11.9340014206;托,-7.27529046768;灤,-11.5285363125;糧,-10.1422419514;彦,-8.61981541592;審,-9.53610614779;葬,-10.6812384521;据,-8.12733893082;濱,-7.85646397669;买,-7.93580071892;鱼,-7.58372348423;來,-5.99778534772;和,-4.43596259651;庐,-9.7939352571;夕,-8.3786533591;贝,-7.5151608128;尧,-11.0177106887;骨,-9.91909840005;禪,-9.91909840005;蔭,-10.8353891319;鵲,-11.9340014206;匹,-9.53610614779;宾,-8.56670559061;汇,-8.56670559061;證,-10.2292533284;麦,-7.65733530158;湛,-12.6271486012;坡,-8.14981178667;因,-8.98956244143;烤,-10.8353891319;蓬,-11.0177106887;聯,-6.41855857506;極,-7.59671067976;矶,-9.58262616343;勸,-9.91909840005;顿,-8.58409733332;蚁,-11.5285363125;肅,-6.82805594669;涇,-10.5477070595;型,-9.01623068851;甌,-11.9340014206;斗,-10.8353891319;辛,-7.95431976669;貝,-7.5151608128;鎣,-8.69532296843;鸦,-11.9340014206;窩,-11.9340014206;堪,-8.1728013049;犹,-10.4299240238;雞,-9.01623068851;杀,-11.24085424;韋,-9.36905206313;界,-9.6314163276;量,-10.1422419514;剎,-9.4490947708;黑,-7.66430397089;齐,-7.13408715781;奔,-8.06280040968;旗,-8.86594848546;进,-9.0436296627;聚,-10.8353891319;口,-6.28855452295;照,-8.63816455459;嫩,-7.83135805556;敬,-11.24085424;棵,-8.01202808431;噶,-6.57505943223;忻,-11.24085424;遺,-9.53610614779;峽,-8.30966048762;范,-12.6271486012;蒂,-7.67132154355;者,-11.9340014206;國,-5.68983451993;名,-8.45276133126;徐,-12.6271486012;蔗,-11.9340014206;阡,-9.33131173515;钢,-11.5285363125;约,-7.09771951364;末,-11.24085424;刹,-9.4490947708;鼻,-10.5477070595;為,-10.8353891319;嶼,-9.49165438522;仆,-11.5285363125;峒,-9.16141269835;硕,-12.6271486012;艙,-12.6271486012;佛,-7.72187382271;飯,-8.6568566876;埠,-9.10078807654;遥,-10.4299240238;凤,-10.3245635082;寨,-7.2335210548;长,-7.59019599874;長,-7.59019599874;特,-5.0212586001;司,-9.85455987891;彻,-7.71449371542;图,-7.85646397669;要,-10.0621992437;沃,-8.2833431793;崎,-9.53610614779;钓,-11.9340014206;会,-7.65733530158;鑼,-11.5285363125;训,-12.6271486012;洮,-10.5477070595;茲,-6.7217867531;强,-10.8353891319;迅,-10.3245635082;蹄,-11.24085424;经,-8.48401387476;金,-6.62079544155;鹤,-11.24085424;周,-10.8353891319;坪,-8.82048611138;浮,-9.4490947708;恰,-11.0177106887;柵,-10.3245635082;饶,-9.19316139667;鷹,-12.6271486012;麗,-8.6568566876;撈,-9.40827277628;視,-12.6271486012;挝,-11.0177106887;芜,-10.0621992437;星,-8.05243762265;客,-11.5285363125;弥,-11.24085424;跳,-8.91357653445;港,-7.00674773544;脱,-7.99241961292;莲,-9.40827277628;紹,-8.75594759024;岸,-10.2292533284;阿,-6.67911361197;轅,-10.5477070595;滄,-7.15487792748;鹏,-11.9340014206;領,-11.9340014206;拜,-7.87355841005;彥,-8.61981541592;剧,-8.63816455459;湯,-10.4299240238;淮,-7.04365229237;菲,-9.40827277628;狼,-12.6271486012;闾,-9.91909840005;梁,-8.1053600241;樂,-7.10169566202;耆,-10.6812384521;蘊,-11.5285363125;邑,-9.19316139667;間,-9.33131173515;栖,-11.5285363125;沙,-5.51890446142;业,-8.82048611138;芝,-9.29494409098;麥,-7.65733530158;阪,-10.6812384521;侯,-9.6314163276;吾,-7.15068504922;蓉,-7.53339840035;始,-8.3786533591;僑,-11.9340014206;毗,-11.9340014206;绥,-9.7939352571;色,-5.97557672756;顶,-7.05119949801;矿,-10.4299240238;鑾,-9.01623068851;清,-7.08588505599;猗,-11.24085424;指,-8.25770074869;瀑,-9.68270962199;魚,-7.58372348423;愛,-8.094549108;亚,-5.10096968781;堡,-8.63816455459;群,-6.3947005846;邦,-7.05880409739;設,-8.60179691042;伯,-5.65923939935;觀,-7.75195127795;久,-12.6271486012;俄,-6.28326816703;葉,-10.4299240238;積,-11.24085424;富,-5.95132537952;勒,-5.59540734239;陕,-12.6271486012;埔,-6.74661561475;菜,-11.5285363125;卧,-12.6271486012;烦,-12.6271486012;门,-5.47487974512;盪,-8.6568566876;潯,-12.6271486012;購,-11.5285363125;柴,-9.58262616343;壶,-10.8353891319;建,-6.36756713709;言,-11.5285363125;涅,-8.48401387476;鼎,-11.9340014206;欖,-9.73677684326;丘,-8.03202875102;审,-9.53610614779;夢,-11.5285363125;尤,-12.6271486012;錦,-9.16141269835;榭,-10.2292533284;莱,-6.71906566298;戰,-10.4299240238;徹,-7.71449371542;常,-11.24085424;眾,-9.0436296627;证,-10.2292533284;仃,-9.22595121949;荆,-7.34903394192;立,-7.83965685837;种,-12.6271486012;发,-8.1053600241;兒,-7.72187382271;乘,-12.6271486012;招,-10.2292533284;绣,-11.0177106887;工,-9.19316139667;烧,-8.56670559061;卦,-10.2292533284;韩,-10.5477070595;器,-11.9340014206;番,-9.16141269835;勻,-10.4299240238;遼,-9.36905206313;七,-7.98275770201;小,-10.6812384521;美,-5.39369318253;栗,-9.91909840005;伙,-10.3245635082;亘,-11.24085424;縣,-9.0436296627;鲤,-11.5285363125;谯,-12.6271486012;家,-5.29477939522;庸,-7.59671067976;嶺,-7.69267466802;酋,-8.60179691042;乃,-10.3245635082;观,-7.75195127795;杉,-7.27529046768;屏,-9.16141269835;卑,-7.08588505599;燒,-8.56670559061;街,-8.91357653445;余,-9.49165438522;胜,-8.54961115725;章,-10.4299240238;革,-7.89976078244;業,-8.82048611138;修,-10.1422419514;寶,-8.18449734466;役,-11.5285363125;謀,-9.7939352571;舆,-9.73677684326;月,-8.04218112248;宋,-10.8353891319;萊,-6.71906566298;颍,-9.85455987891;綏,-9.7939352571;亙,-11.24085424;花,-5.97299608097;纹,-12.6271486012;尺,-12.6271486012;濃,-12.6271486012;桂,-10.5477070595;几,-8.01202808431;韓,-10.5477070595;仙,-8.20830799336;潘,-10.8353891319;虞,-8.82048611138;塢,-12.6271486012;瑪,-6.74382621266;路,-6.72725124757;英,-8.53280403893;柳,-8.88947898287;聲,-8.84295896723;蕴,-11.5285363125;叻,-12.6271486012;烽,-10.5477070595;百,-10.1422419514;吕,-10.8353891319;思,-10.3245635082;亮,-10.5477070595;舱,-12.6271486012;育,-9.36905206313;夷,-7.20661360188;难,-11.24085424;淄,-11.0177106887;晉,-9.98809127154;黎,-6.58214328712;賚,-11.24085424;仑,-6.10947732824;壢,-11.24085424;內,-5.51237915279;幹,-6.33929004099;卻,-12.6271486012;畿,-10.3245635082;盾,-11.5285363125;龍,-5.07911963122;希,-6.18142878177;吐,-10.8353891319;園,-6.67131123169;枝,-8.06280040968;碣,-12.6271486012;锦,-9.16141269835;戴,-8.67590488257;康,-8.01202808431;势,-11.5285363125;汀,-10.3245635082;蛇,-12.6271486012;應,-12.6271486012;荊,-7.34903394192;幌,-11.9340014206;青,-8.56670559061;赖,-10.2292533284;屠,-11.24085424;形,-8.71512559572;盧,-8.48401387476;迭,-9.73677684326;廷,-9.7939352571;矽,-10.8353891319;發,-8.1053600241;蘇,-5.59452434012;莊,-7.79883486385;垒,-10.8353891319;朝,-7.5151608128;舟,-11.9340014206;鬥,-10.8353891319;京,-5.13717770232;榮,-10.1422419514;耳,-5.59452434012;茵,-7.699894916;流,-5.67346439028;賀,-11.24085424;桃,-8.54961115725;及,-6.64826283625;屋,-9.6314163276;陶,-7.45099886858;道,-7.3288312346;单,-9.16141269835;訓,-12.6271486012;淖,-8.73532830304;葛,-10.1422419514;煩,-12.6271486012;賽,-8.53280403893;豫,-10.2292533284;只,-12.6271486012;潭,-8.03202875102;滬,-11.24085424;寺,-11.5285363125;沁,-8.24512196648;欄,-10.6812384521;悉,-11.24085424;舊,-10.1422419514;宏,-9.33131173515;唐,-9.0436296627;澗,-11.0177106887;蜜,-11.9340014206;岡,-7.28961052145;素,-9.6314163276;爪,-12.6271486012;亭,-9.10078807654;德,-5.4111735985;眼,-11.0177106887;县,-9.0436296627;葆,-10.5477070595;慈,-12.6271486012;绍,-8.75594759024;彌,-11.24085424;動,-9.40827277628;杜,-10.0621992437;聞,-11.24085424;峡,-8.30966048762;童,-10.2292533284;孤,-10.5477070595;龐,-10.0621992437;全,-11.5285363125;佬,-10.6812384521;至,-10.4299240238;部,-11.9340014206;闻,-11.24085424;空,-10.4299240238;国,-5.68983451993;靼,-12.6271486012;紋,-12.6271486012;羌,-8.1053600241;们,-8.30966048762;众,-9.0436296627;果,-8.06280040968;綠,-7.15068504922;红,-9.58262616343;娥,-9.25985277117;霧,-8.84295896723;钦,-11.5285363125;努,-8.86594848546;中,-5.27791777654;新,-6.62326153405;強,-10.8353891319;画,-12.6271486012;淀,-9.10078807654;风,-7.67838871077;櫚,-8.93826914704;胞,-11.24085424;瓦,-6.40061193187;赫,-8.54961115725;度,-5.28826046731;滓,-9.91909840005;森,-7.20219858367;曲,-8.56670559061;島,-7.02872664215;白,-6.4145425054;卿,-9.10078807654;一,-8.51627473698;興,-6.01108341602;脊,-10.8353891319;悟,-11.9340014206;索,-7.10969570469;璧,-12.6271486012;溫,-9.25985277117;梯,-12.6271486012;容,-9.85455987891;示,-12.6271486012;琼,-10.4299240238;迁,-9.85455987891;扈,-9.33131173515;腊,-8.24512196648;難,-11.24085424;達,-5.50589614791;泗,-11.5285363125;藥,-11.9340014206;楚,-9.07180053966;藝,-9.73677684326;捞,-9.40827277628;姥,-11.5285363125;坦,-6.53810372571;仫,-10.6812384521;涼,-7.97318825099;柱,-10.0621992437;電,-10.8353891319;呼,-10.3245635082;漁,-10.0621992437;涂,-10.0621992437;侗,-9.4490947708;崍,-9.0436296627;隐,-8.22042935389;謙,-12.6271486012;莞,-8.73532830304;夥,-10.3245635082;垦,-12.6271486012;动,-9.40827277628;丫,-11.5285363125;购,-11.5285363125;议,-9.85455987891;朱,-12.6271486012;禺,-7.98275770201;潁,-9.85455987891;什,-6.47654583271;草,-7.72187382271;顏,-8.75594759024;坑,-12.6271486012;盐,-8.91357653445;汗,-9.58262616343;譙,-12.6271486012;虛,-10.6812384521;齡,-11.24085424;廠,-9.98809127154;巢,-10.8353891319;祥,-9.85455987891;壤,-10.8353891319;韦,-9.36905206313;東,-4.7681216214;登,-8.45276133126;避,-9.53610614779;現,-11.0177106887;梅,-9.36905206313;文,-7.15068504922;蘆,-8.82048611138;律,-6.21205164198;福,-6.63318717385;税,-12.6271486012;世,-11.24085424;张,-10.6812384521;助,-10.8353891319;沭,-8.79850720466;嶷,-11.24085424;爾,-3.59318747651;仁,-8.18449734466;求,-8.33668916;襄,-11.5285363125;拉,-3.80232366198;监,-12.6271486012;僕,-11.5285363125;湖,-6.78650694378;獨,-9.73677684326;巷,-12.6271486012;竹,-8.58409733332;學,-9.91909840005;顺,-7.91761839984;丁,-6.18939695142;沂,-8.39304209656;栅,-10.3245635082;榄,-9.73677684326;弋,-11.24085424;夏,-7.41766244831;望,-10.5477070595;斜,-11.5285363125;感,-9.58262616343;鸡,-9.01623068851;利,-3.73001325886;漫,-11.24085424;圻,-10.6812384521;儿,-7.72187382271;卓,-9.49165438522;偕,-10.8353891319;他,-8.48401387476;繡,-11.0177106887;翠,-11.5285363125;季,-11.24085424;物,-6.2589614148;延,-10.4299240238;驹,-11.24085424;坻,-10.2292533284;磺,-12.6271486012;命,-7.89976078244;璃,-8.51627473698;骇,-10.6812384521;舌,-8.42245598176;辕,-10.5477070595;渔,-10.0621992437;鐘,-9.58262616343;宝,-8.18449734466;娜,-11.9340014206;麟,-10.5477070595;靜,-10.4299240238;堰,-8.91357653445;岳,-8.51627473698;徵,-10.6812384521;方,-7.59671067976;机,-7.14650967781;贾,-8.84295896723;附,-10.5477070595;竇,-10.2292533284;齊,-7.13408715781;桐,-10.8353891319;賓,-8.56670559061;乔,-11.5285363125;员,-12.6271486012;飛,-10.8353891319;坚,-9.13064103969;廟,-10.8353891319;查,-9.22595121949;晤,-8.86594848546;班,-4.9187379339;鳳,-10.3245635082;念,-8.39304209656;年,-9.25985277117;慶,-6.45544800374;滿,-8.07327170955;球,-8.84295896723;厂,-9.98809127154;的,-6.24533258375;鴉,-11.9340014206;羊,-8.60179691042;漕,-11.9340014206;五,-8.3786533591;列,-6.61343344511;错,-12.6271486012;貨,-10.4299240238;倫,-5.45933941684;單,-9.16141269835;礱,-8.1728013049;張,-10.6812384521;户,-9.13064103969;螺,-10.6812384521;欽,-11.5285363125;誼,-8.20830799336;参,-9.29494409098;雄,-7.86497466635;姆,-7.54574423617;晏,-11.0177106887;何,-9.49165438522;仔,-9.6314163276;留,-10.5477070595;孝,-12.6271486012;州,-4.08000833337;惠,-11.9340014206;董,-11.5285363125;来,-5.99778534772;浩,-7.21997682969;火,-8.56670559061;迪,-7.43419175026;独,-9.73677684326;声,-8.84295896723;米,-6.08611860196;维,-5.17011651203;邁,-9.6314163276;儀,-12.6271486012;隅,-9.16141269835;霄,-11.24085424;宇,-10.5477070595;堆,-10.8353891319;井,-9.16141269835;甘,-7.59019599874;窝,-11.9340014206;龟,-11.5285363125;质,-9.98809127154;耶,-8.98956244143;便,-9.73677684326;阴,-7.77511833723;雅,-7.14650967781;鹊,-11.9340014206;柏,-6.93678914683;後,-10.0621992437;滕,-11.9340014206;佔,-8.86594848546;孜,-8.1053600241;属,-7.91761839984;胡,-8.91357653445;聶,-8.50001421611;汾,-9.36905206313;冀,-9.53610614779;领,-11.9340014206;舍,-9.40827277628;树,-7.41766244831;北,-4.71399341522;宜,-8.07327170955;春,-7.15908846002;欧,-9.98809127154;梦,-11.5285363125;溪,-7.99241961292;爭,-11.9340014206;輿,-9.73677684326;净,-8.88947898287;际,-8.60179691042;才,-8.77700099944;桑,-6.72451526775;槐,-9.33131173515;浓,-12.6271486012;南,-3.95757772932;瑙,-7.15068504922;藺,-12.6271486012;淨,-8.88947898287;八,-8.88947898287;仪,-12.6271486012;召,-9.49165438522;絳,-11.24085424;捷,-9.40827277628;泾,-10.5477070595;刀,-11.24085424;鄂,-11.5285363125;各,-7.65041485873;颇,-9.4490947708;师,-8.75594759024;气,-8.46826551779;化,-6.94017324481;梧,-10.6812384521;洪,-8.73532830304;騰,-8.88947898287;纳,-5.93630632373;茶,-10.8353891319;蔺,-12.6271486012;覽,-9.91909840005;格,-5.08387525445;貿,-9.6314163276;壇,-10.0621992437;李,-10.8353891319;仓,-9.53610614779;陘,-9.73677684326;日,-6.40457233308;武,-6.40457233308;浪,-9.19316139667;瓯,-11.9340014206;绳,-9.33131173515;銀,-9.13064103969;眙,-10.6812384521;颜,-8.75594759024;亨,-9.73677684326;别,-6.45128133105;鄭,-8.13851223142;达,-5.50589614791;十,-10.4299240238;畅,-10.8353891319;密,-8.03202875102;手,-11.24085424;角,-5.87137967917;遗,-9.53610614779;取,-12.6271486012;静,-10.4299240238;盘,-7.08981433413;驛,-11.5285363125;祝,-10.8353891319;荡,-8.6568566876;佩,-7.93580071892;滨,-7.85646397669;六,-7.54574423617;平,-4.42603695671;鳴,-9.85455987891;書,-11.5285363125;旺,-8.1728013049;犁,-7.38540158609;匀,-10.4299240238;明,-6.29386897301;宛,-11.5285363125;炭,-11.24085424;戶,-9.13064103969;埃,-7.75195127795;穆,-7.20661360188;廉,-10.5477070595;族,-5.25754788063;虎,-8.79850720466;歐,-9.98809127154;法,-7.36445841225;浔,-12.6271486012;雙,-7.46809330194;祜,-9.7939352571;蓥,-8.69532296843;滩,-10.4299240238;汪,-10.2292533284;热,-8.00217578787;公,-6.76351742555;懷,-10.4299240238;楼,-11.24085424;湾,-5.77384950797;鋪,-10.5477070595;善,-8.36446872411;涔,-10.4299240238;鞘,-9.4490947708;庞,-10.0621992437;营,-9.22595121949;温,-9.25985277117;侨,-11.9340014206;錫,-8.07327170955;沪,-11.24085424;冬,-10.5477070595;皮,-9.91909840005;宰,-10.2292533284;雲,-6.28855452295;鶴,-11.24085424;珀,-11.9340014206;奇,-11.0177106887;敏,-8.98956244143;体,-9.10078807654;汕,-10.4299240238;藏,-5.35822847296;陽,-4.81436578257;卫,-8.18449734466;質,-9.98809127154;目,-7.82312755642;巴,-5.57615915408;虹,-9.73677684326;須,-9.22595121949;融,-9.91909840005;昌,-6.85882760536;梓,-12.6271486012;錯,-12.6271486012;熙,-12.6271486012;岛,-7.02872664215;斡,-8.19633180231;产,-12.6271486012;戈,-8.40764089598;治,-4.85608151509;辽,-9.36905206313;隴,-10.8353891319;坂,-8.82048611138;织,-10.6812384521;蓋,-10.1422419514;苏,-5.59452434012;跑,-11.9340014206;豐,-7.83965685837;灘,-10.4299240238;博,-6.4145425054;神,-9.25985277117;浦,-6.55872301291;表,-12.6271486012;穴,-10.6812384521;豪,-11.5285363125;包,-11.5285363125;郭,-8.01202808431;蚌,-9.25985277117;府,-7.60986876434;蔡,-8.61981541592;护,-9.7939352571;润,-11.5285363125;梨,-11.5285363125;圭,-9.16141269835;埂,-11.9340014206;獅,-11.0177106887;狄,-8.84295896723;術,-8.77700099944;彝,-7.7908666942;湧,-11.5285363125;峰,-7.36965322912;时,-11.24085424;銅,-10.1422419514;将,-12.6271486012;刚,-9.29494409098;谦,-12.6271486012;环,-8.14981178667;岱,-11.9340014206;細,-6.79526612387;殿,-12.6271486012;品,-9.53610614779;陂,-10.8353891319;奈,-8.93826914704;旋,-11.24085424;驊,-10.2292533284;察,-8.1053600241;塞,-5.6286389589;臣,-9.98809127154;若,-11.24085424;园,-6.67131123169;可,-8.48401387476;遮,-7.80686703555;干,-6.33929004099;惹,-9.73677684326;艺,-9.73677684326;份,-11.9340014206;潼,-9.22595121949;喀,-6.75785168802;民,-4.71253089211;帝,-6.53583871907;龜,-11.5285363125;暢,-10.8353891319;匯,-8.56670559061;炮,-12.6271486012;活,-9.91909840005;丽,-8.6568566876;直,-8.56670559061;元,-8.30966048762;比,-4.90447108468;遙,-10.4299240238;嵛,-9.91909840005;孟,-10.4299240238;飞,-10.8353891319;畫,-12.6271486012;鋼,-11.5285363125;山,-4.38729119013;女,-9.85455987891;杷,-11.9340014206;内,-5.51237915279;安,-4.88909630346;圖,-7.85646397669;刘,-12.6271486012;鸭,-8.84295896723;四,-8.22042935389;沧,-7.15487792748;伦,-5.45933941684;让,-12.6271486012;閭,-9.91909840005;場,-9.33131173515;陀,-7.83135805556;勃,-10.0621992437;鯉,-11.5285363125;俑,-11.0177106887;乐,-7.10169566202;衔,-10.6812384521;靖,-8.82048611138;叙,-11.9340014206;绛,-11.24085424;川,-5.43346278276;食,-11.9340014206;臥,-12.6271486012;车,-8.20830799336;鹰,-12.6271486012;絲,-11.24085424;蝶,-9.73677684326;省,-7.76733619679;將,-12.6271486012;莎,-10.5477070595;休,-10.2292533284;源,-7.16331679613;樓,-11.24085424;磯,-9.58262616343;渭,-11.9340014206;鲜,-7.24725124761;渚,-9.36905206313;鎮,-9.58262616343;架,-8.77700099944;茹,-11.9340014206;主,-6.89704881818;设,-8.60179691042;雀,-8.51627473698;充,-10.3245635082;晋,-9.98809127154;里,-4.51132889994;潑,-12.6271486012;鵝,-9.19316139667;条,-8.25770074869;迦,-9.49165438522;壺,-10.8353891319;影,-10.6812384521;泼,-12.6271486012;云,-6.28855452295;伐,-6.36565691683;讓,-12.6271486012;通,-7.81496424578;肥,-8.6568566876;涧,-11.0177106887;謨,-10.4299240238;甬,-10.3245635082;头,-6.9035634992;斷,-7.33384377643;沽,-9.13064103969;洼,-11.9340014206;雁,-9.91909840005;址,-11.0177106887;參,-9.29494409098;呂,-10.8353891319;納,-5.93630632373;扎,-7.67132154355;滑,-12.6271486012;佐,-9.98809127154;裕,-9.6314163276;书,-11.5285363125;荷,-9.0436296627;畬,-10.6812384521;凯,-8.82048611138;奴,-9.58262616343;泽,-6.97817436299;阁,-11.0177106887;磁,-11.5285363125;庆,-6.45544800374;守,-11.24085424;意,-6.33003928122;皖,-10.4299240238;则,-9.13064103969;厘,-9.29494409098;货,-10.4299240238;喬,-11.5285363125;銮,-9.01623068851;堵,-11.9340014206;秋,-12.6271486012;練,-12.6271486012;千,-12.6271486012;细,-6.79526612387;运,-6.63318717385;盖,-10.1422419514;牙,-6.00974562318;郑,-8.13851223142;荣,-10.1422419514;滦,-11.5285363125;狮,-11.0177106887;翰,-9.16141269835;批,-11.0177106887;轻,-10.4299240238;汽,-11.9340014206;西,-3.82733613163;諾,-7.12998037586;羅,-3.99823516013;劇,-8.63816455459;合,-7.38012452899;鮮,-7.24725124761;厝,-10.6812384521;渤,-8.3786533591;银,-9.13064103969;薩,-5.63873541915;萨,-5.63873541915;箭,-12.6271486012;熱,-8.00217578787;嘴,-8.84295896723;永,-12.6271486012;放,-8.86594848546;必,-9.10078807654;坊,-8.75594759024;母,-9.22595121949;济,-8.08385381888;荒,-12.6271486012;祖,-10.0621992437;盟,-9.19316139667;佤,-9.6314163276;士,-5.94003999329;马,-5.06342893274;凱,-8.82048611138;灰,-11.9340014206;豸,-12.6271486012;庄,-7.79883486385;切,-10.2292533284;排,-11.9340014206;首,-8.93826914704;崙,-6.10947732824;銜,-10.6812384521;氣,-8.46826551779;交,-9.13064103969;鄱,-11.24085424;捉,-12.6271486012;琳,-9.98809127154;嚴,-10.5477070595;总,-9.98809127154;籃,-11.9340014206;黄,-7.90864972986;則,-9.13064103969;哈,-5.0177820632;那,-7.02872664215;穗,-11.5285363125;陟,-9.91909840005;令,-9.22595121949;执,-10.6812384521;共,-4.60885246264;味,-11.5285363125;史,-7.65041485873;围,-11.24085424;弄,-11.9340014206;瀆,-11.24085424;朔,-10.4299240238;宗,-11.0177106887;军,-8.79850720466;劝,-9.91909840005;吞,-10.6812384521;亥,-7.59019599874;第,-6.62079544155;铜,-10.1422419514;邱,-11.0177106887;讷,-11.9340014206;油,-9.49165438522;贸,-9.6314163276;为,-10.8353891319;壁,-8.82048611138;歌,-10.1422419514;腐,-11.0177106887;扒,-10.8353891319;峙,-10.3245635082;奥,-8.3786533591;勝,-8.54961115725;卜,-9.98809127154;瑞,-7.03243722155;裡,-4.51132889994;們,-8.30966048762;潤,-11.5285363125;兰,-5.22530702241;码,-10.2292533284;崃,-9.0436296627;龄,-11.24085424;吉,-6.0004308519;伏,-11.0177106887;芒,-11.5285363125;土,-6.34488185426;严,-10.5477070595;澤,-6.97817436299;夫,-7.99241961292;粮,-10.1422419514;週,-10.8353891319;冰,-7.10969570469;真,-9.98809127154;人,-4.76119318722;撾,-11.0177106887;秀,-9.4490947708;鹅,-9.19316139667;囊,-12.6271486012;柔,-10.5477070595;字,-9.7939352571;摩,-7.69267466802;凰,-7.66430397089;陵,-6.46594127946;歷,-6.34488185426;板,-9.68270962199;宁,-5.39441546497;成,-8.36446872411;碗,-9.29494409098;龙,-5.07911963122;力,-8.24512196648;钟,-9.58262616343;霞,-8.18449734466;昆,-8.05243762265;鄲,-9.33131173515;琴,-7.70716767532;边,-7.21997682969;游,-8.71512559572;贺,-11.24085424;练,-12.6271486012;行,-6.5495063578;遜,-10.4299240238;坞,-12.6271486012;代,-8.30966048762;汤,-10.4299240238;蕪,-10.0621992437;駭,-10.6812384521;蓿,-12.6271486012;松,-8.45276133126;布,-5.33685571871;紅,-9.58262616343;历,-6.34488185426;眉,-7.50915478874;植,-11.0177106887;氏,-8.33668916;易,-7.77511833723;頗,-9.4490947708;順,-7.91761839984;次,-8.30966048762;津,-6.38882397611;暨,-10.1422419514;微,-11.5285363125;阳,-4.81436578257;冲,-11.5285363125;电,-10.8353891319;益,-10.4299240238;遇,-11.24085424;橋,-7.80686703555;镶,-12.6271486012;塗,-10.0621992437;默,-8.93826914704;牛,-7.01402049476;線,-11.9340014206;瑟,-11.24085424;饭,-8.6568566876;屯,-8.3786533591;危,-11.24085424;鋒,-11.0177106887;軸,-12.6271486012;砂,-11.9340014206;約,-7.09771951364;渎,-11.24085424;怒,-9.98809127154;庙,-10.8353891319;玛,-6.74382621266;尚,-9.91909840005;沥,-12.6271486012;贤,-10.1422419514;木,-5.42821736046;宫,-7.59671067976;帮,-11.0177106887;進,-9.0436296627;心,-8.51627473698;霍,-9.98809127154;苑,-10.0621992437;给,-8.29641526087;罘,-10.0621992437;泥,-9.40827277628;赤,-11.5285363125;杨,-8.88947898287;石,-6.60855538666;威,-6.35238657991;雪,-7.92666823536;嘉,-8.11628909464;瀝,-12.6271486012;农,-8.19633180231;生,-8.75594759024;芦,-8.82048611138;陆,-10.3245635082;頭,-6.9035634992;馬,-5.06342893274;累,-7.84802510804;爱,-8.094549108;现,-11.0177106887;圳,-5.6213595819;鐵,-8.3786533591;丹,-6.84025121979;政,-8.18449734466;婁,-9.53610614779;節,-9.01623068851;居,-9.7939352571;護,-9.7939352571;陉,-9.73677684326;瓊,-10.4299240238;提,-8.1053600241;回,-7.28481434919;慧,-10.3245635082;苦,-11.24085424;孫,-7.93580071892;台,-5.96019180872;间,-9.33131173515;風,-7.67838871077;臼,-12.6271486012;娄,-9.53610614779;皇,-6.7410445697;店,-8.03202875102;崖,-12.6271486012;香,-7.25187019347;超,-9.7939352571;阜,-9.33131173515;功,-9.10078807654;漢,-6.54264918808;窯,-9.4490947708;央,-7.45666460611;邳,-11.9340014206;露,-9.91909840005;局,-11.9340014206;商,-8.60179691042;凉,-7.97318825099;半,-5.64893485852;乌,-8.07327170955;塘,-6.8070656708;孚,-12.6271486012;淡,-11.9340014206;池,-8.094549108;棣,-11.9340014206;敦,-8.69532296843;僳,-9.85455987891;拿,-5.10908441992;腾,-8.88947898287;疆,-6.66100186203;鄉,-6.89380732425;傈,-9.85455987891;谋,-9.7939352571;伍,-10.6812384521;二,-8.79850720466;鵬,-11.9340014206;君,-8.43749385913;定,-6.68697734843;贡,-8.1728013049;莪,-11.9340014206;由,-10.5477070595;環,-8.14981178667;殺,-11.24085424;房,-7.60986876434;陇,-10.8353891319;光,-9.10078807654;烈,-10.0621992437;珊,-12.6271486012;救,-11.0177106887;蟒,-11.9340014206;壘,-10.8353891319;坝,-9.10078807654;牟,-8.1053600241;衣,-12.6271486012;步,-10.6812384521;旦,-9.0436296627;廬,-9.7939352571;诺,-7.12998037586;曼,-6.25042165325;鲁,-5.24067775232;紀,-8.39304209656;市,-6.63318717385;骅,-10.2292533284;理,-8.1053600241;投,-9.13064103969;得,-5.96146488337;尖,-11.9340014206;餘,-9.49165438522;原,-6.42461308396;航,-10.6812384521;庭,-9.07180053966;钱,-10.3245635082;田,-7.06646697014;軍,-8.79850720466;荔,-11.0177106887;志,-8.32308350795;坜,-11.24085424;巫,-9.7939352571;却,-12.6271486012;汶,-8.30966048762;藻,-11.5285363125;封,-6.47868030523;稅,-12.6271486012;倉,-9.53610614779;冈,-7.28961052145;洋,-6.61588142675;不,-6.6949034137;黃,-7.90864972986;弗,-10.2292533284;訥,-11.9340014206;席,-10.1422419514;根,-6.07606826611;廂,-11.24085424;範,-12.6271486012;罗,-3.99823516013;陝,-12.6271486012;象,-10.1422419514;恩,-9.91909840005;臨,-10.6812384521;魯,-5.24067775232;壮,-7.12181706522;关,-6.77207667895;酒,-10.4299240238;征,-10.6812384521;禅,-9.91909840005;玉,-9.91909840005;事,-10.2292533284;岗,-9.07180053966;湘,-11.0177106887;娘,-9.85455987891;際,-8.60179691042;多,-5.73653948101;渠,-9.49165438522;庫,-7.03989994275;維,-5.17011651203;劳,-8.42245598176;甲,-8.35048248214;買,-7.93580071892;伶,-10.8353891319;非,-7.98275770201;施,-9.13064103969;翁,-10.0621992437;哇,-8.56670559061;版,-7.56455356813;滋,-12.6271486012;廣,-7.37487517311;联,-6.41855857506;篙,-12.6271486012;盛,-6.4368331953;信,-12.6271486012;屬,-7.91761839984;壯,-7.12181706522;陰,-7.77511833723;畲,-10.6812384521;下,-7.66430397089;栏,-10.6812384521;嘛,-12.6271486012;速,-9.68270962199;師,-8.75594759024;集,-9.49165438522;堯,-11.0177106887;宮,-7.59671067976;谷,-8.77700099944;覺,-11.5285363125;之,-11.9340014206;村,-8.73532830304;打,-11.9340014206;慕,-8.56670559061;孙,-7.93580071892;高,-5.05310359578;姚,-9.68270962199;瓜,-7.48548504465;幫,-11.0177106887;自,-4.88474657934;硯,-10.5477070595;篮,-11.9340014206;兵,-8.2833431793;諸,-7.83965685837;开,-7.66430397089;墅,-9.68270962199;喇,-7.88221647279;劉,-12.6271486012;逊,-10.4299240238;暑,-8.54961115725;朐,-11.0177106887;砚,-10.5477070595;熟,-10.1422419514;谢,-12.6271486012;茨,-7.53339840035;岭,-7.69267466802;種,-12.6271486012;隱,-8.22042935389;地,-3.95671943384;邵,-12.6271486012;忠,-10.6812384521;遊,-8.71512559572;賢,-10.1422419514;鸣,-9.85455987891;站,-12.6271486012;镜,-10.6812384521;營,-9.22595121949;满,-8.07327170955;旧,-10.1422419514;嵬,-10.5477070595;积,-11.24085424;右,-9.07180053966;鑲,-12.6271486012;郵,-10.4299240238;兴,-6.01108341602;歸,-9.98809127154;蟻,-11.5285363125;艾,-8.18449734466;铁,-8.3786533591;鬃,-9.19316139667;堅,-9.13064103969;隆,-7.3288312346;邊,-7.21997682969;涌,-11.5285363125;撒,-7.138210875;崗,-9.07180053966;官,-7.94501737403;碚,-11.9340014206;喜,-9.0436296627;渡,-8.48401387476;貢,-8.1728013049;樹,-7.41766244831;许,-11.5285363125;落,-12.6271486012;硅,-10.8353891319;镇,-9.58262616343;盆,-5.77808231852;珈,-11.9340014206;郊,-9.98809127154;淌,-10.6812384521;虑,-11.24085424;廖,-12.6271486012;坛,-10.0621992437;關,-6.77207667895;勞,-8.42245598176;乡,-6.89380732425;正,-11.9340014206;波,-7.07807251626;桥,-7.80686703555;灵,-8.25770074869;海,-4.20955477496;诸,-7.83965685837;答,-7.60326808031;
+M,nt:養,-12.1985997932;耀,-8.22830787964;沃,-11.5054526126;羅,-7.50725191096;劇,-7.10484959238;牧,-11.5054526126;合,-4.5351921283;伊,-8.26677416047;軟,-9.06310557726;肃,-10.5891618808;障,-9.42601107095;預,-10.8123054321;貓,-11.5054526126;渔,-9.55954246358;抗,-10.2526896441;外,-5.93139924465;料,-9.63365043573;会,-5.25934584715;宝,-10.5891618808;舜,-10.2526896441;贞,-10.8123054321;造,-8.97972396832;两,-10.1191582515;礦,-9.7136931434;薩,-10.0013752159;萨,-10.0013752159;輪,-8.41441015927;箭,-8.6432517317;類,-12.1985997932;杜,-9.20286751964;河,-7.79188054593;茲,-10.1191582515;徵,-11.0999875045;临,-7.72126297871;銷,-9.42601107095;專,-8.90276292719;方,-6.34352787099;贵,-11.0999875045;场,-9.63365043573;宽,-12.1985997932;线,-9.55954246358;放,-5.67210493362;峡,-7.8678664529;铃,-10.8123054321;迅,-9.80070452039;附,-9.80070452039;鞍,-10.8123054321;棋,-10.406840324;齊,-9.80070452039;牌,-9.55954246358;律,-7.9939071738;昌,-10.0013752159;科,-4.65162567567;日,-7.62388881469;賓,-9.15407735547;究,-5.92007836903;織,-7.92193367418;真,-11.5054526126;员,-4.74041363585;飛,-8.53503814706;坚,-11.5054526126;话,-8.8313039632;盟,-6.80952806337;遠,-8.3699583967;賣,-9.30822803529;查,-8.28657678776;晤,-9.49054959209;緊,-12.1985997932;腦,-11.5054526126;早,-10.406840324;士,-7.43642585839;班,-8.58768188055;马,-8.30677949508;泳,-11.0999875045;溫,-10.2526896441;念,-11.0999875045;年,-6.4981562198;其,-9.7136931434;銀,-3.09551061196;设,-5.29988525886;滿,-11.5054526126;蕾,-8.97972396832;球,-8.15554852536;庄,-10.2526896441;與,-8.39193730342;馆,-10.5891618808;詢,-10.2526896441;羊,-9.10755733983;验,-8.97972396832;脑,-11.5054526126;香,-9.55954246358;排,-10.406840324;輕,-10.8123054321;五,-9.36538644913;列,-8.76461258871;視,-6.6495237083;挝,-10.8123054321;芜,-11.0999875045;星,-7.67681121614;蓄,-10.8123054321;無,-11.0999875045;氣,-7.36231788624;客,-9.49054959209;交,-4.56184768076;饰,-10.5891618808;咨,-10.2526896441;倫,-6.73476798817;识,-8.6432517317;港,-6.0739164023;阜,-12.1985997932;脱,-12.1985997932;械,-8.61508085474;吳,-8.67223926857;莊,-10.2526896441;冶,-10.2526896441;改,-10.5891618808;岸,-10.0013752159;总,-5.80835912613;誼,-9.7136931434;阿,-10.2526896441;疾,-10.5891618808;检,-7.54463944303;籃,-11.5054526126;参,-8.0554650668;组,-5.10519516732;片,-7.4801009219;准,-8.70209223172;哈,-7.24983990281;運,-8.56101363346;烹,-9.63365043573;录,-11.5054526126;驗,-8.97972396832;教,-6.6495237083;進,-7.43642585839;衛,-6.64177173149;移,-9.36538644913;也,-9.30822803529;州,-5.68983065622;饪,-9.63365043573;网,-8.50972033908;铜,-9.80070452039;艺,-7.22878649362;来,-11.5054526126;令,-10.5891618808;剧,-7.10484959238;秦,-12.1985997932;浩,-11.5054526126;国,-2.39769882943;火,-9.10755733983;迪,-8.67223926857;独,-11.0999875045;湯,-12.1985997932;问,-8.10425523097;共,-4.0685407532;声,-9.80070452039;味,-8.53503814706;史,-7.26412586006;围,-11.0999875045;基,-6.13017420495;鋼,-6.15122761414;广,-6.95685277813;儀,-10.2526896441;樂,-6.12555525909;宇,-8.8313039632;順,-10.1191582515;训,-10.2526896441;上,-8.67223926857;劍,-8.19126660796;后,-9.42601107095;經,-6.13249170309;划,-7.89453469999;井,-10.406840324;演,-10.8123054321;宗,-12.1985997932;沙,-9.30822803529;甘,-10.8123054321;军,-4.76198252796;业,-4.14375957209;劝,-10.5891618808;鈴,-10.8123054321;長,-6.65342234871;股,-6.9103327625;麥,-9.02054596284;控,-10.8123054321;岩,-12.1985997932;用,-6.80497224684;询,-10.2526896441;阪,-12.1985997932;芭,-8.97972396832;第,-7.44500960208;羽,-9.55954246358;碱,-10.8123054321;足,-7.5934296072;戲,-7.88111167965;纵,-10.5891618808;消,-8.8313039632;油,-6.23502044957;甸,-9.25416081402;为,-9.42601107095;抽,-10.8123054321;锋,-9.80070452039;吾,-10.2526896441;裁,-11.5054526126;条,-12.1985997932;维,-7.42791516873;雅,-11.0999875045;朝,-10.2526896441;泉,-10.2526896441;王,-6.66917070568;然,-8.39193730342;拍,-10.8123054321;歌,-8.48502772649;柏,-9.42601107095;僑,-9.06310557726;芳,-12.1985997932;车,-6.34066663871;潔,-11.5054526126;漁,-9.55954246358;聖,-8.61508085474;奥,-7.47121197448;费,-9.63365043573;費,-9.63365043573;濟,-6.46202749571;属,-9.63365043573;裡,-8.26677416047;少,-9.02054596284;机,-7.44500960208;潤,-8.79740241153;寧,-7.27861886736;级,-7.03954449398;間,-10.5891618808;繪,-12.1985997932;達,-8.53503814706;盲,-12.1985997932;兰,-6.21718558194;跳,-9.63365043573;色,-8.41441015927;资,-6.48486698768;顶,-12.1985997932;數,-9.25416081402;击,-10.5891618808;派,-10.406840324;矿,-9.7136931434;老,-10.5891618808;冀,-7.90814035204;直,-11.5054526126;清,-8.32739878228;径,-9.42601107095;指,-9.7136931434;础,-12.1985997932;吉,-10.1191582515;業,-4.14375957209;酵,-12.1985997932;戍,-10.2526896441;式,-11.0999875045;黨,-6.14181577996;民,-3.82782062023;媒,-10.8123054321;聯,-4.75904048406;北,-6.16551357139;陣,-9.36538644913;愛,-8.8313039632;亚,-5.83902592452;土,-7.27861886736;貞,-10.8123054321;堡,-7.79188054593;東,-5.67797866563;责,-8.8313039632;檢,-7.54463944303;春,-8.8313039632;欧,-8.26677416047;梦,-11.5054526126;夫,-8.86639528302;溪,-11.0999875045;設,-5.29988525886;田,-7.9939071738;伯,-8.0554650668;粮,-8.39193730342;報,-7.7559485367;冰,-11.5054526126;边,-11.5054526126;编,-11.5054526126;阵,-9.36538644913;弟,-10.8123054321;肅,-10.5891618808;極,-9.10755733983;省,-5.26420258326;人,-4.3638116858;殼,-11.5054526126;撾,-10.8123054321;校,-10.5891618808;議,-6.4302787974;俄,-9.06310557726;歇,-10.0013752159;汉,-7.35441270673;克,-7.06870107827;寶,-10.5891618808;前,-10.406840324;富,-11.0999875045;住,-12.1985997932;塑,-10.8123054321;給,-11.5054526126;勒,-7.97909208802;處,-12.1985997932;埔,-7.22878649362;南,-5.11857329327;諸,-12.1985997932;渥,-12.1985997932;济,-6.46202749571;认,-11.5054526126;赫,-11.5054526126;番,-11.0999875045;舶,-9.55954246358;難,-10.8123054321;摩,-9.80070452039;編,-11.5054526126;八,-8.48502772649;仪,-10.2526896441;寬,-12.1985997932;软,-9.06310557726;青,-6.46850001022;陵,-9.63365043573;柴,-9.49054959209;歷,-8.10425523097;养,-12.1985997932;建,-5.78842491122;导,-10.1191582515;使,-8.6432517317;泾,-11.5054526126;宁,-7.27861886736;言,-10.406840324;纪,-8.0554650668;射,-9.25416081402;最,-7.95010455114;师,-6.70553834985;赖,-9.02054596284;成,-12.1985997932;库,-9.7136931434;頂,-12.1985997932;尔,-6.48817277582;灘,-9.7136931434;化,-6.1186665981;龙,-8.70209223172;丘,-10.1191582515;力,-7.50725191096;級,-7.03954449398;等,-9.25416081402;約,-6.18488463715;审,-10.0013752159;脫,-12.1985997932;夢,-11.5054526126;涇,-11.5054526126;義,-7.37831822759;鮮,-7.4801009219;洪,-11.5054526126;莱,-8.34845219148;戰,-6.0001210767;纳,-9.20286751964;儲,-7.58347927635;吴,-8.67223926857;月,-11.0999875045;徹,-9.06310557726;常,-5.8424921325;神,-11.5054526126;值,-9.80070452039;貿,-6.46525851629;眾,-7.8678664529;证,-4.48794646969;黃,-9.80070452039;谊,-9.7136931434;旅,-7.8418909665;摄,-10.8123054321;壇,-7.48906959188;蹈,-9.80070452039;立,-8.90276292719;音,-6.81870243965;重,-8.30677949508;行,-6.73053965206;汽,-6.01239116929;发,-5.14847727292;结,-9.63365043573;兒,-9.15407735547;規,-9.49054959209;卖,-9.30822803529;湘,-10.5891618808;明,-7.76778299435;瘤,-11.5054526126;芝,-8.34845219148;非,-7.89453469999;鏡,-11.5054526126;代,-6.87558981405;纺,-11.0999875045;工,-4.57251703512;汤,-12.1985997932;脏,-11.5054526126;学,-4.10483203526;韩,-10.2526896441;器,-8.0242125233;浦,-8.03971670983;硬,-12.1985997932;潮,-11.5054526126;菱,-10.2526896441;驰,-9.63365043573;钞,-11.5054526126;莞,-11.0999875045;陸,-6.23502044957;精,-8.50972033908;函,-12.1985997932;松,-11.0999875045;技,-7.22186605077;七,-8.41441015927;荣,-12.1985997932;紅,-5.98799971617;标,-8.61508085474;历,-8.10425523097;有,-6.73476798817;语,-9.42601107095;程,-7.61363231452;复,-7.92193367418;小,-9.80070452039;美,-6.93074163413;预,-10.8123054321;专,-8.90276292719;际,-5.30089485006;创,-9.55954246358;辛,-9.02054596284;陕,-11.5054526126;评,-9.80070452039;加,-6.35795813582;渣,-10.2526896441;津,-6.39950713873;别,-9.15407735547;警,-7.89453469999;想,-8.0242125233;葉,-11.0999875045;阳,-7.62388881469;电,-4.95723350987;貴,-11.0999875045;家,-4.50102444639;隸,-9.02054596284;稻,-8.86639528302;嶺,-11.5054526126;炼,-10.406840324;达,-8.53503814706;十,-8.03971670983;遊,-7.92193367418;观,-12.1985997932;廷,-9.20286751964;假,-11.5054526126;密,-9.36538644913;杉,-8.48502772649;橋,-6.73053965206;慶,-6.97285311948;城,-7.82915194072;筑,-9.30822803529;狐,-12.1985997932;乓,-10.1191582515;角,-11.5054526126;隆,-9.30822803529;遗,-11.0999875045;取,-12.1985997932;余,-9.7136931434;绘,-12.1985997932;牛,-8.30677949508;線,-9.55954246358;遜,-12.1985997932;江,-6.69326825726;连,-7.95010455114;卡,-12.1985997932;桑,-10.1191582515;幣,-6.36086934603;邦,-6.75618208267;顧,-8.10425523097;實,-8.61508085474;佩,-7.45366766483;滨,-8.97972396832;六,-9.30822803529;鹼,-10.8123054321;平,-8.0554650668;鋒,-9.80070452039;敵,-10.406840324;賴,-9.02054596284;叶,-11.0999875045;書,-6.0310833023;驻,-8.67223926857;好,-9.49054959209;莫,-11.5054526126;慈,-12.1985997932;柔,-12.1985997932;謀,-9.63365043573;堂,-10.2526896441;字,-8.53503814706;妇,-8.86639528302;分,-7.72126297871;播,-7.40280924759;残,-9.7136931434;萊,-8.34845219148;调,-9.42601107095;与,-8.39193730342;骑,-11.0999875045;输,-8.48502772649;臘,-8.53503814706;團,-6.77806479392;玛,-10.1191582515;條,-12.1985997932;务,-4.18459479841;陝,-11.5054526126;在,-12.1985997932;宫,-10.8123054321;炭,-9.8960147002;斯,-5.71243900425;远,-8.3699583967;花,-8.17324810246;澳,-11.0999875045;诸,-12.1985997932;制,-6.92048513396;輸,-8.48502772649;玻,-8.22830787964;飞,-8.53503814706;财,-6.46850001022;举,-11.0999875045;鋁,-10.406840324;區,-7.38641543782;促,-8.08772592902;桂,-8.86639528302;組,-5.10519516732;穆,-11.5054526126;廉,-12.1985997932;服,-10.2526896441;友,-8.6432517317;届,-8.56101363346;煌,-9.25416081402;族,-7.76778299435;虎,-11.5054526126;子,-8.08772592902;韓,-10.2526896441;法,-5.6165746543;願,-7.52577095873;诺,-8.39193730342;给,-11.5054526126;毛,-9.63365043573;裝,-7.9939071738;哥,-6.5709786795;啤,-7.85479437134;意,-7.52577095873;婦,-8.86639528302;滩,-9.7136931434;瑪,-10.1191582515;公,-4.24633648453;路,-7.68774028667;普,-7.88111167965;英,-12.1985997932;印,-6.99459310611;石,-6.80952806337;聲,-9.80070452039;整,-12.1985997932;扶,-9.80070452039;读,-12.1985997932;壽,-10.8123054321;腫,-11.5054526126;湾,-7.60347994306;威,-8.26677416047;讀,-12.1985997932;會,-5.25934584715;善,-12.1985997932;备,-7.24277273559;三,-7.55420889405;風,-10.2526896441;紐,-9.06310557726;首,-10.0013752159;册,-9.30822803529;刑,-10.2526896441;孚,-9.42601107095;譯,-11.0999875045;装,-7.9939071738;金,-5.25547737037;浙,-11.0999875045;农,-5.71549244173;生,-4.94089211603;亞,-5.83902592452;纤,-11.0999875045;圣,-8.61508085474;门,-6.95157572103;营,-12.1985997932;大,-3.20641543102;艇,-11.5054526126;温,-10.2526896441;侨,-9.06310557726;猫,-11.5054526126;頭,-8.58768188055;女,-8.53503814706;累,-12.1985997932;纜,-12.1985997932;爱,-8.8313039632;现,-10.1191582515;圳,-5.67503748704;曲,-9.80070452039;鐵,-6.09828084117;鶴,-12.1985997932;夷,-10.2526896441;丹,-10.0013752159;医,-6.0001210767;辞,-10.5891618808;齡,-10.1191582515;政,-3.16834348307;难,-10.8123054321;酋,-10.406840324;知,-8.76461258871;权,-8.32739878228;裂,-8.61508085474;居,-11.5054526126;護,-10.8123054321;义,-7.37831822759;擊,-10.5891618808;里,-8.26677416047;問,-8.10425523097;界,-6.02065567914;剑,-8.19126660796;提,-10.5891618808;体,-7.18796449909;展,-6.65733624803;藏,-8.26677416047;論,-9.80070452039;起,-10.1191582515;留,-11.5054526126;辆,-11.5054526126;回,-12.1985997932;珠,-8.39193730342;督,-6.63407938587;魯,-7.01121398735;內,-8.56101363346;歐,-8.26677416047;险,-8.61508085474;陽,-7.62388881469;卫,-6.64177173149;質,-8.4373996775;話,-8.8313039632;台,-9.10755733983;佳,-12.1985997932;巴,-7.30825066497;貨,-6.12095754984;虹,-9.8960147002;席,-9.25416081402;獻,-8.6432517317;飾,-10.5891618808;雷,-10.1191582515;长,-6.65342234871;图,-7.54463944303;极,-9.10755733983;境,-8.17324810246;皇,-6.7014315679;權,-8.32739878228;融,-7.41947630008;希,-11.5054526126;礎,-12.1985997932;導,-10.1191582515;吐,-11.0999875045;鄂,-12.1985997932;鈔,-11.5054526126;識,-8.6432517317;熙,-12.1985997932;領,-10.8123054321;岛,-6.76925416424;隶,-9.02054596284;依,-10.1191582515;东,-5.67797866563;功,-10.8123054321;萄,-9.55954246358;由,-7.73269167454;那,-9.80070452039;漢,-7.35441270673;产,-4.76139342632;環,-8.00894505116;潜,-12.1985997932;撫,-10.2526896441;缆,-12.1985997932;辭,-10.5891618808;測,-9.42601107095;央,-3.92322341835;铁,-6.09828084117;玉,-11.5054526126;傳,-7.90814035204;農,-5.71549244173;臟,-11.5054526126;康,-7.9939071738;計,-6.02065567914;核,-7.57362697991;治,-5.59736967446;区,-7.38641543782;徽,-9.15407735547;調,-9.42601107095;社,-5.6165746543;局,-8.15554852536;杂,-10.406840324;熊,-12.1985997932;雞,-11.5054526126;织,-7.92193367418;商,-4.59719745861;案,-8.03971670983;部,-6.75186242152;癌,-12.1985997932;苏,-7.44500960208;跑,-12.1985997932;豐,-6.9103327625;归,-10.5891618808;试,-12.1985997932;仗,-10.5891618808;敖,-9.42601107095;泥,-11.0999875045;博,-11.0999875045;保,-7.06280135614;质,-8.4373996775;煤,-8.26677416047;面,-7.74425249694;敦,-7.18131995638;表,-7.11719542821;艦,-6.72632911952;经,-6.13249170309;麓,-9.25416081402;雲,-10.8123054321;汇,-6.21214778791;壳,-11.5054526126;篮,-11.5054526126;鹤,-12.1985997932;鉴,-11.5054526126;价,-9.42601107095;選,-12.1985997932;系,-9.10755733983;發,-5.14847727292;拿,-8.61508085474;气,-7.36231788624;洁,-11.5054526126;考,-10.5891618808;蘇,-7.44500960208;疆,-7.90814035204;鄉,-12.1985997932;谋,-9.63365043573;殊,-11.0999875045;圍,-11.0999875045;二,-7.38641543782;戏,-7.88111167965;頓,-7.18796449909;垒,-11.0999875045;檔,-8.03971670983;記,-7.39457874846;君,-8.76461258871;定,-8.8313039632;心,-10.0013752159;府,-7.61363231452;黄,-9.80070452039;紡,-11.0999875045;連,-7.95010455114;挥,-9.8960147002;护,-10.8123054321;润,-8.79740241153;天,-6.88047979935;储,-7.58347927635;姆,-11.0999875045;圭,-10.8123054321;京,-4.55751554402;榮,-12.1985997932;唱,-10.5891618808;煉,-10.406840324;耳,-9.25416081402;試,-12.1985997932;风,-10.2526896441;算,-8.34845219148;论,-9.80070452039;食,-8.8313039632;房,-11.0999875045;流,-9.80070452039;管,-5.70484595334;電,-4.95723350987;光,-7.8418909665;瑞,-9.55954246358;屋,-11.5054526126;及,-8.86639528302;位,-8.61508085474;龍,-8.70209223172;野,-7.8418909665;術,-6.33496861759;索,-10.8123054321;體,-7.18796449909;歸,-10.5891618808;煙,-11.5054526126;壘,-11.0999875045;注,-9.30822803529;坝,-9.80070452039;络,-8.8313039632;機,-7.44500960208;絡,-8.8313039632;泠,-9.49054959209;档,-8.03971670983;顺,-10.1191582515;勤,-9.42601107095;左,-12.1985997932;兩,-10.1191582515;能,-7.69879012286;豫,-12.1985997932;锡,-12.1985997932;潭,-10.2526896441;道,-7.21499317148;良,-11.5054526126;統,-6.18244263349;泰,-8.13815678264;蟲,-11.0999875045;限,-6.80043709167;时,-7.51646856607;兹,-10.1191582515;郸,-12.1985997932;类,-12.1985997932;百,-8.73286389039;飪,-9.63365043573;曼,-9.15407735547;鲁,-7.01121398735;币,-6.36086934603;市,-4.83026010688;銅,-9.80070452039;酒,-8.28657678776;理,-5.29084451421;開,-6.38148863323;訊,-8.50972033908;宏,-12.1985997932;唐,-12.1985997932;投,-7.1681618718;華,-4.66170266362;得,-11.5054526126;備,-7.24277273559;者,-8.6432517317;原,-7.8418909665;岡,-12.1985997932;素,-10.2526896441;诚,-10.406840324;报,-7.7559485367;舰,-6.72632911952;館,-10.5891618808;疫,-12.1985997932;航,-6.40254204243;革,-6.17757644384;本,-5.52025767854;环,-8.00894505116;雜,-10.406840324;嘉,-9.49054959209;馳,-9.63365043573;甲,-11.5054526126;邮,-8.8313039632;德,-8.0242125233;蒙,-8.73286389039;点,-8.53503814706;纽,-9.06310557726;眼,-12.1985997932;县,-12.1985997932;水,-6.72213624126;品,-6.39648141781;時,-7.51646856607;育,-7.18131995638;屆,-8.56101363346;棉,-12.1985997932;先,-9.80070452039;茶,-11.0999875045;軍,-4.76198252796;灣,-7.60347994306;結,-9.63365043573;乒,-9.7136931434;動,-7.45366766483;協,-5.26031530917;志,-6.80952806337;游,-7.92193367418;蘭,-6.21718558194;作,-6.79142802173;察,-7.11100345796;塞,-9.80070452039;員,-4.74041363585;解,-5.7640532744;院,-6.27167376722;童,-8.41441015927;执,-9.10755733983;壩,-9.80070452039;全,-6.65733624803;旦,-6.95157572103;可,-9.02054596284;格,-6.63791816218;数,-9.25416081402;執,-9.10755733983;汶,-10.8123054321;價,-9.42601107095;典,-7.8678664529;闻,-7.60347994306;空,-6.02065567914;份,-7.63425160172;寿,-10.8123054321;票,-11.5054526126;封,-10.406840324;門,-6.95157572103;稅,-7.96449328859;震,-10.406840324;选,-12.1985997932;冈,-12.1985997932;洋,-6.36965417558;皖,-12.1985997932;统,-6.18244263349;後,-9.42601107095;向,-11.5054526126;互,-9.42601107095;監,-5.55091141963;众,-7.8678664529;殘,-9.7136931434;候,-10.8123054321;病,-11.5054526126;洛,-9.06310557726;抚,-10.2526896441;帝,-8.4373996775;果,-9.49054959209;埃,-7.8418909665;红,-5.98799971617;別,-9.15407735547;室,-12.1985997932;黎,-7.90814035204;紫,-10.8123054321;說,-10.8123054321;中,-4.15205043591;木,-9.25416081402;匯,-6.21214778791;炮,-8.70209223172;新,-7.27134610803;菲,-10.8123054321;访,-10.406840324;根,-8.13815678264;画,-8.32739878228;庞,-11.5054526126;總,-5.80835912613;墾,-10.406840324;淀,-11.0999875045;元,-12.1985997932;範,-7.10484959238;测,-9.42601107095;协,-5.26031530917;籌,-10.406840324;鑑,-11.5054526126;評,-9.80070452039;比,-6.80952806337;罗,-7.50725191096;糖,-7.40280924759;秘,-10.5891618808;九,-9.42601107095;视,-6.6495237083;孟,-11.5054526126;胞,-10.5891618808;象,-8.39193730342;无,-11.0999875045;团,-6.77806479392;語,-9.42601107095;古,-7.39457874846;瓦,-9.42601107095;恩,-8.46093017491;臨,-7.72126297871;畫,-8.32739878228;约,-6.18488463715;银,-3.09551061196;药,-7.18131995638;森,-9.06310557726;山,-6.51162443685;关,-8.58768188055;仲,-11.5054526126;創,-9.55954246358;说,-10.8123054321;島,-6.76925416424;白,-7.28594490746;錫,-12.1985997932;联,-4.75904048406;征,-11.0999875045;一,-7.1681618718;劃,-7.89453469999;點,-8.53503814706;内,-8.56101363346;紀,-8.0554650668;安,-5.73713161684;興,-6.51162443685;事,-5.96223020299;策,-8.46093017491;同,-6.39648141781;馬,-8.30677949508;徑,-9.42601107095;研,-5.91074123303;岗,-11.5054526126;圖,-7.54463944303;战,-6.0001210767;際,-5.30089485006;多,-9.02054596284;黑,-10.1191582515;盛,-7.64472290159;悟,-10.2526896441;錄,-11.5054526126;觀,-12.1985997932;產,-4.76139342632;貧,-9.80070452039;伦,-6.73476798817;藝,-7.22878649362;庫,-9.7136931434;太,-7.14874378594;維,-7.42791516873;龄,-10.1191582515;肯,-12.1985997932;献,-8.6432517317;都,-7.43642585839;丰,-6.9103327625;劳,-7.35441270673;洲,-5.63474426666;况,-12.1985997932;場,-9.63365043573;買,-10.5891618808;货,-6.12095754984;券,-5.16951222904;麻,-9.15407735547;尼,-6.68517104703;肿,-11.5054526126;騎,-11.0999875045;顾,-8.10425523097;术,-6.33496861759;資,-6.48486698768;築,-9.30822803529;版,-5.87963167944;腊,-8.53503814706;廣,-6.95685277813;华,-4.66170266362;近,-9.20286751964;乐,-6.12555525909;潛,-12.1985997932;塔,-9.49054959209;托,-8.3699583967;四,-8.0554650668;党,-6.14181577996;川,-6.48817277582;烟,-11.5054526126;信,-4.94867425647;领,-10.8123054321;灤,-9.63365043573;糧,-8.39193730342;坦,-7.23575516293;審,-10.0013752159;武,-8.03971670983;屬,-9.63365043573;磯,-9.49054959209;俱,-10.1191582515;买,-10.5891618808;愿,-7.52577095873;晨,-11.5054526126;对,-9.49054959209;任,-8.50972033908;醫,-6.0001210767;企,-9.36538644913;娃,-11.5054526126;浪,-8.90276292719;林,-6.39045730321;來,-11.5054526126;下,-9.20286751964;冊,-9.30822803529;納,-9.20286751964;和,-6.64177173149;莎,-10.2526896441;駐,-8.67223926857;源,-7.00010276193;訓,-10.2526896441;夕,-8.70209223172;餘,-9.7136931434;轮,-8.41441015927;攝,-10.8123054321;鲜,-7.4801009219;速,-12.1985997932;实,-8.61508085474;濱,-8.97972396832;垦,-10.406840324;动,-7.45366766483;師,-6.70553834985;集,-4.67403856691;責,-8.8313039632;枝,-12.1985997932;宮,-10.8123054321;晉,-11.5054526126;網,-8.50972033908;赤,-10.5891618808;匹,-8.79740241153;主,-5.85121058354;齐,-9.80070452039;宾,-9.15407735547;財,-6.46850001022;泊,-10.406840324;朗,-10.1191582515;卉,-11.5054526126;晋,-11.5054526126;销,-9.42601107095;車,-6.34066663871;村,-11.0999875045;鄲,-12.1985997932;打,-7.4624013448;慕,-10.2526896441;麦,-9.02054596284;高,-6.18244263349;湛,-9.55954246358;隧,-12.1985997932;鵝,-12.1985997932;瓜,-10.2526896441;计,-6.02065567914;坡,-8.39193730342;记,-7.39457874846;巢,-10.406840324;入,-11.5054526126;血,-12.1985997932;韦,-10.5891618808;輛,-11.5054526126;虫,-11.0999875045;自,-6.99459310611;译,-11.0999875045;息,-7.4801009219;揮,-9.8960147002;影,-7.02245006062;兵,-8.30677949508;矶,-9.49054959209;筹,-10.406840324;勸,-10.5891618808;登,-8.67223926857;出,-5.72009015098;议,-6.4302787974;顿,-7.18796449909;現,-10.1191582515;开,-6.38148863323;訪,-10.406840324;梅,-9.36538644913;处,-12.1985997932;文,-6.02273252309;昆,-11.0999875045;型,-11.5054526126;逊,-12.1985997932;布,-10.0013752159;福,-6.5927977269;税,-7.96449328859;云,-10.8123054321;讯,-8.50972033908;世,-7.8678664529;供,-12.1985997932;通,-5.22880912329;貝,-8.58768188055;坛,-7.48906959188;舞,-8.19126660796;传,-7.90814035204;宣,-7.96449328859;肥,-8.73286389039;带,-12.1985997932;茨,-12.1985997932;株,-11.0999875045;岭,-11.5054526126;關,-8.58768188055;地,-8.07146540815;防,-6.59648097231;債,-9.63365043573;头,-8.58768188055;認,-11.5054526126;帶,-12.1985997932;债,-9.63365043573;纖,-11.0999875045;蘋,-11.5054526126;爾,-6.48817277582;仁,-8.86639528302;參,-8.0554650668;求,-10.406840324;情,-9.06310557726;兄,-10.8123054321;陆,-6.23502044957;拉,-7.27134610803;植,-10.5891618808;韋,-10.5891618808;耶,-8.32739878228;操,-11.0999875045;敌,-10.406840324;量,-8.90276292719;监,-5.55091141963;材,-10.8123054321;藥,-7.18131995638;氏,-10.2526896441;旗,-6.74756133963;湖,-9.30822803529;務,-4.18459479841;桥,-6.73053965206;进,-7.43642585839;铝,-10.406840324;镜,-11.5054526126;營,-12.1985997932;贫,-9.80070452039;满,-11.5054526126;口,-5.9799996735;蕪,-11.0999875045;奧,-7.47121197448;书,-6.0310833023;嫩,-9.49054959209;獨,-11.0999875045;快,-9.02054596284;易,-4.89072701243;險,-8.61508085474;郵,-8.8313039632;兴,-6.51162443685;苹,-11.5054526126;學,-4.10483203526;遺,-11.0999875045;峽,-7.8678664529;贸,-6.46525851629;丁,-8.58768188055;況,-12.1985997932;范,-7.10484959238;蒂,-12.1985997932;堅,-11.5054526126;庆,-6.97285311948;舉,-11.0999875045;授,-12.1985997932;國,-2.39769882943;邊,-11.5054526126;對,-9.49054959209;夏,-7.26412586006;龐,-11.5054526126;聞,-7.60347994306;崗,-11.5054526126;準,-8.70209223172;標,-8.61508085474;官,-10.2526896441;望,-11.0999875045;綜,-10.8123054321;办,-7.60347994306;鸡,-11.5054526126;钢,-6.15122761414;急,-12.1985997932;紧,-12.1985997932;度,-7.03954449398;利,-6.05013149727;贝,-8.58768188055;豆,-11.5054526126;證,-4.48794646969;縱,-10.5891618808;辰,-11.5054526126;男,-9.30822803529;奈,-7.89453469999;船,-8.34845219148;综,-10.8123054321;為,-9.42601107095;儿,-9.15407735547;间,-10.5891618808;规,-9.49054959209;誠,-10.406840324;籍,-8.30677949508;縣,-12.1985997932;运,-8.56101363346;米,-10.406840324;委,-4.47503732091;期,-7.30825066497;他,-12.1985997932;牙,-8.12106234929;佛,-6.43654841041;轻,-10.8123054321;勞,-7.35441270673;乡,-12.1985997932;正,-10.2526896441;波,-9.30822803529;健,-10.8123054321;滦,-9.63365043573;物,-7.24983990281;寨,-9.36538644913;鹅,-12.1985997932;辦,-7.60347994306;草,-9.10755733983;破,-12.1985997932;諮,-10.2526896441;翰,-9.25416081402;哲,-9.25416081402;致,-9.7136931434;海,-4.41871467812;骨,-10.8123054321;特,-6.97285311948;司,-9.80070452039;彻,-9.06310557726;命,-6.20214770457;西,-6.56381019002;諾,-8.39193730342;
+M,nz:怀,-11.61597832;挂,-9.67006817097;谈,-8.84338959779;伊,-6.82848657724;茂,-9.67006817097;抗,-11.61597832;料,-9.8242188508;萘,-10.5173660314;造,-9.67006817097;錢,-10.9228311395;作,-9.13107167024;河,-7.9783921603;侵,-10.9228311395;临,-7.60864513479;銷,-9.41875374269;然,-7.39647061485;场,-8.97692099041;线,-9.13107167024;黴,-9.13107167024;談,-8.84338959779;反,-8.21478093836;科,-5.23925137213;筒,-9.67006817097;織,-7.47284359363;话,-8.97692099041;赞,-10.0065404076;遠,-9.13107167024;卢,-9.41875374269;除,-8.4804841041;衰,-10.9228311395;泳,-10.9228311395;其,-8.24868249004;驼,-9.8242188508;绿,-9.41875374269;沈,-7.78733692354;個,-10.2296839589;引,-7.25926949334;应,-10.5173660314;無,-7.5216337578;厢,-7.24653046756;禦,-11.61597832;械,-9.13107167024;溴,-9.67006817097;刷,-11.61597832;頻,-10.0065404076;鸿,-8.52493586667;胀,-9.67006817097;视,-9.21808304723;運,-4.3134818963;寒,-11.61597832;录,-9.31339322703;黔,-10.2296839589;酸,-5.51790403786;教,-9.8242188508;衛,-6.48017988298;諜,-10.9228311395;盤,-10.5173660314;秦,-6.75616591566;嵩,-10.2296839589;括,-9.41875374269;景,-7.90240625332;滴,-10.0065404076;须,-10.9228311395;基,-5.44219221612;广,-6.26412018655;門,-6.68872463487;醋,-10.2296839589;上,-10.5173660314;后,-10.2296839589;频,-10.0065404076;經,-5.71061647197;底,-9.21808304723;蒙,-11.61597832;键,-11.61597832;鉛,-11.61597832;椰,-8.67153934086;甸,-10.0065404076;离,-7.45709523667;框,-11.61597832;泉,-9.8242188508;绕,-10.5173660314;晚,-9.21808304723;譜,-9.31339322703;濟,-5.97053142238;寧,-7.64568640647;繪,-11.61597832;柯,-8.84338959779;棱,-10.9228311395;跳,-11.61597832;轴,-7.74477730912;号,-10.2296839589;偶,-10.2296839589;姻,-10.9228311395;态,-10.9228311395;节,-9.67006817097;构,-10.9228311395;帕,-8.08961779541;贛,-7.13864150555;冠,-9.8242188508;丝,-9.31339322703;脫,-10.0065404076;纪,-7.02085846989;术,-10.0065404076;稽,-9.67006817097;精,-7.9524166739;汉,-6.71070354159;克,-4.9490215276;車,-8.67153934086;前,-8.78276497597;双,-10.9228311395;坏,-10.9228311395;塑,-6.91549795423;翔,-10.9228311395;軸,-7.74477730912;別,-7.44159105013;賞,-10.5173660314;巨,-10.2296839589;杯,-10.5173660314;蓮,-9.8242188508;固,-8.32014145402;导,-10.0065404076;齿,-9.8242188508;戀,-8.43792448968;萄,-7.48884393498;辉,-8.62024604647;贊,-10.0065404076;再,-10.9228311395;库,-10.9228311395;堂,-10.9228311395;尔,-4.2032143026;沟,-8.39710249516;義,-6.71813852008;分,-8.72560656213;水,-5.9847665382;傷,-8.90792811892;禽,-10.2296839589;旅,-8.11947075856;凍,-11.61597832;灌,-11.61597832;结,-7.55553530948;監,-9.05102896256;学,-5.25467584245;鸽,-9.21808304723;诱,-10.2296839589;襲,-8.43792448968;烷,-9.21808304723;培,-9.05102896256;陸,-9.31339322703;硼,-10.9228311395;技,-8.90792811892;載,-11.61597832;雾,-10.5173660314;氟,-7.7039553146;加,-7.31191322682;缩,-9.67006817097;稻,-10.0065404076;碼,-10.9228311395;尿,-7.72415802192;臂,-10.5173660314;轉,-8.97692099041;辣,-8.90792811892;城,-7.6841526873;補,-11.61597832;江,-5.72710036169;连,-7.6841526873;卡,-6.79569675442;陣,-8.62024604647;實,-6.63237169832;彩,-11.61597832;黨,-7.72415802192;扫,-10.2296839589;乳,-11.61597832;叶,-8.39710249516;相,-10.5173660314;好,-10.2296839589;王,-8.39710249516;谊,-8.97692099041;窑,-8.72560656213;條,-8.72560656213;务,-8.39710249516;锤,-11.61597832;莫,-8.52493586667;簪,-9.67006817097;斯,-3.32167871117;鴉,-8.43792448968;冷,-8.15024241723;制,-7.44159105013;霸,-8.5714558823;綿,-11.61597832;友,-7.9783921603;子,-6.54707411781;離,-7.45709523667;毛,-8.97692099041;裝,-8.67153934086;占,-9.53653677835;哥,-10.5173660314;婦,-7.92709886591;普,-6.26887078931;浴,-8.11947075856;飽,-6.7256291918;饼,-10.5173660314;會,-5.76377584025;薄,-10.9228311395;三,-5.2703419592;倍,-10.0065404076;尕,-11.61597832;负,-9.8242188508;亞,-5.91553474664;大,-3.24635749308;許,-10.2296839589;记,-6.09451740216;仲,-9.21808304723;状,-9.67006817097;鴿,-9.21808304723;权,-7.29849020649;义,-6.71813852008;泊,-8.28377380985;凌,-10.9228311395;当,-7.60864513479;鎢,-11.61597832;展,-9.05102896256;衝,-9.13107167024;叠,-7.59062662929;督,-4.32432211085;奧,-7.85477820433;恭,-8.43792448968;話,-8.97692099041;具,-8.62024604647;铺,-10.9228311395;權,-7.29849020649;嘌,-11.61597832;依,-7.6841526873;东,-6.41197163295;那,-8.84338959779;厥,-7.60864513479;判,-10.9228311395;座,-8.84338959779;芯,-11.61597832;氰,-7.05163012856;訴,-9.8242188508;区,-9.41875374269;社,-10.5173660314;壓,-8.15024241723;齒,-9.8242188508;保,-9.67006817097;面,-6.59869848321;继,-8.39710249516;秩,-11.61597832;苯,-7.13864150555;深,-7.48884393498;雷,-8.78276497597;當,-7.60864513479;選,-10.5173660314;系,-8.28377380985;繼,-8.39710249516;竿,-10.2296839589;考,-8.32014145402;螂,-8.97692099041;茅,-8.90792811892;万,-7.41128570064;殊,-11.61597832;頓,-8.4804841041;輝,-8.62024604647;樟,-10.9228311395;锡,-8.84338959779;钠,-10.0065404076;連,-7.6841526873;天,-5.76377584025;風,-6.84529369556;宪,-7.20925907276;音,-9.67006817097;農,-6.95253922591;擀,-11.61597832;苄,-10.9228311395;呋,-11.61597832;驶,-6.96201796987;雌,-11.61597832;野,-9.8242188508;鵑,-11.61597832;習,-10.0065404076;孕,-11.61597832;體,-8.4804841041;機,-6.13118138654;啡,-10.5173660314;灣,-6.6959973942;勤,-10.5173660314;能,-6.553383287;葫,-10.9228311395;輦,-8.84338959779;杭,-5.95301783989;曬,-10.9228311395;良,-8.90792811892;泰,-7.07268353776;访,-10.5173660314;类,-10.9228311395;综,-11.61597832;昂,-8.67153934086;茄,-9.41875374269;辇,-8.84338959779;開,-7.39647061485;訊,-10.9228311395;紐,-8.18199111554;笔,-7.7039553146;林,-5.04090247943;溝,-8.39710249516;本,-7.48884393498;点,-10.9228311395;刺,-11.61597832;纽,-8.18199111554;時,-6.30771062263;过,-9.67006817097;豆,-7.07268353776;棉,-9.8242188508;過,-9.67006817097;結,-7.55553530948;孔,-11.61597832;潜,-8.4804841041;卤,-9.05102896256;華,-6.1065899834;價,-9.67006817097;典,-7.6841526873;彼,-9.31339322703;榈,-9.67006817097;朗,-7.17332706354;洛,-6.74844386957;渝,-8.11947075856;吡,-9.31339322703;卅,-7.76583071832;弧,-9.53653677835;蘭,-4.27709018619;振,-8.32014145402;醜,-10.9228311395;谱,-9.31339322703;鴻,-8.52493586667;總,-8.08961779541;碾,-11.61597832;览,-11.61597832;降,-10.5173660314;韌,-10.2296839589;协,-6.1778990111;臘,-6.29296834089;赛,-7.09418974298;华,-6.1065899834;九,-7.13864150555;远,-9.13107167024;团,-6.71813852008;古,-5.25467584245;药,-6.42302146914;滲,-10.5173660314;鹿,-7.64568640647;瓶,-9.21808304723;凸,-8.4804841041;翼,-9.8242188508;飾,-10.9228311395;极,-10.0065404076;漆,-10.5173660314;計,-7.17332706354;同,-8.06063025854;邏,-7.48884393498;研,-9.05102896256;战,-3.37059385191;產,-6.90644811871;太,-5.83523480423;萬,-7.41128570064;肯,-11.61597832;辱,-10.0065404076;丰,-9.67006817097;洲,-7.44159105013;券,-9.13107167024;麻,-10.9228311395;尼,-5.52693344458;資,-7.60864513479;诉,-9.8242188508;楊,-9.41875374269;像,-8.90792811892;獎,-9.53653677835;塔,-7.01080813404;托,-6.87977987163;距,-7.03101084136;燥,-8.24868249004;糧,-10.0065404076;彦,-10.2296839589;俱,-11.61597832;买,-11.61597832;鉸,-11.61597832;鱼,-9.67006817097;签,-10.2296839589;來,-7.25926949334;和,-5.8383259968;透,-8.67153934086;減,-11.61597832;膚,-7.47284359363;贝,-4.98134496216;濱,-8.90792811892;骨,-8.357881782;漱,-11.61597832;液,-10.5173660314;匹,-5.91219584537;宾,-8.97692099041;汇,-6.70332343429;證,-6.56612231278;哌,-10.2296839589;偏,-11.61597832;网,-9.8242188508;麦,-8.08961779541;著,-9.05102896256;拘,-9.31339322703;因,-11.61597832;入,-8.4804841041;孩,-7.13864150555;虫,-10.2296839589;擬,-9.41875374269;聯,-6.78766458272;揮,-10.9228311395;極,-10.0065404076;幻,-11.61597832;出,-9.05102896256;顿,-8.4804841041;掃,-10.2296839589;踪,-9.31339322703;型,-8.97692099041;斗,-6.9812493318;芙,-10.5173660314;辛,-10.9228311395;貝,-4.98134496216;樞,-9.05102896256;眠,-11.61597832;带,-10.9228311395;窩,-8.5714558823;堪,-10.5173660314;播,-11.61597832;蔬,-9.67006817097;銹,-9.8242188508;杀,-8.62024604647;情,-9.21808304723;淇,-10.9228311395;界,-3.85551129081;减,-11.61597832;剎,-10.5173660314;黑,-10.9228311395;壕,-10.9228311395;旗,-8.84338959779;晖,-10.5173660314;进,-7.9524166739;聚,-6.89747944873;口,-7.66473460144;內,-6.31267341197;訓,-8.5714558823;艮,-7.19713771223;佰,-11.61597832;噶,-10.2296839589;峽,-6.96201796987;駿,-8.67153934086;蒂,-8.78276497597;國,-4.13273390395;粒,-7.72415802192;蔗,-10.5173660314;暖,-7.59062662929;掘,-10.9228311395;語,-9.67006817097;瘡,-10.5173660314;钢,-5.76953954497;紧,-8.67153934086;约,-9.67006817097;鲜,-6.11472010948;男,-9.8242188508;刹,-10.5173660314;鼻,-10.2296839589;簽,-10.2296839589;仆,-8.18199111554;诈,-8.90792811892;委,-10.9228311395;潛,-8.4804841041;櫞,-9.67006817097;健,-7.80931583026;凤,-9.05102896256;寨,-10.9228311395;乱,-11.61597832;長,-7.03101084136;特,-5.54755273178;司,-8.39710249516;盾,-7.6841526873;佔,-9.53653677835;沃,-10.9228311395;辅,-7.92709886591;序,-11.61597832;逐,-10.9228311395;会,-5.76377584025;羥,-11.61597832;训,-8.5714558823;溯,-10.9228311395;尸,-10.9228311395;强,-8.84338959779;甾,-10.5173660314;见,-9.67006817097;血,-7.53844087612;迅,-10.5173660314;蹄,-9.31339322703;论,-7.83178868611;经,-5.71061647197;金,-5.29881363328;孢,-8.52493586667;语,-9.67006817097;浮,-8.78276497597;鷹,-9.21808304723;调,-10.0065404076;戈,-7.5216337578;麗,-9.31339322703;與,-8.72560656213;验,-9.41875374269;視,-9.21808304723;挝,-10.0065404076;芜,-9.67006817097;星,-8.84338959779;客,-10.0065404076;纤,-9.21808304723;咨,-11.61597832;檬,-10.2296839589;港,-6.90644811871;脱,-10.0065404076;莲,-9.8242188508;逻,-7.48884393498;疾,-10.9228311395;检,-11.61597832;拜,-10.9228311395;號,-10.2296839589;彥,-10.2296839589;剧,-10.5173660314;淮,-10.9228311395;菲,-9.31339322703;更,-8.4804841041;鋼,-5.76953954497;梁,-9.67006817097;老,-10.5173660314;樂,-5.93580571101;導,-10.0065404076;傑,-10.9228311395;間,-7.16163102377;划,-11.61597832;沙,-9.31339322703;业,-6.250002305;芝,-8.84338959779;麥,-8.08961779541;用,-7.78733692354;氮,-11.61597832;戲,-11.61597832;冻,-11.61597832;吾,-5.62201689272;跃,-7.57292705219;菇,-9.8242188508;恆,-6.81195727529;效,-9.21808304723;秋,-10.9228311395;嗓,-8.97692099041;毗,-9.8242188508;緣,-10.5173660314;哩,-10.2296839589;噪,-8.11947075856;色,-7.7039553146;清,-8.72560656213;指,-6.12704059387;薈,-10.9228311395;式,-10.2296839589;們,-10.5173660314;魚,-9.67006817097;息,-6.73317639744;愛,-10.9228311395;级,-9.41875374269;期,-8.78276497597;堡,-8.72560656213;邦,-10.5173660314;險,-8.357881782;伯,-5.657553627;綸,-11.61597832;纺,-6.7256291918;钾,-9.8242188508;觀,-10.0065404076;葉,-8.39710249516;奋,-10.5173660314;富,-8.72560656213;勒,-7.90240625332;埔,-10.9228311395;淘,-9.8242188508;菜,-9.53653677835;门,-6.68872463487;盪,-11.61597832;养,-7.74477730912;建,-6.48017988298;链,-10.9228311395;言,-11.61597832;肇,-9.21808304723;鼎,-10.2296839589;辙,-10.2296839589;丘,-9.67006817097;管,-8.21478093836;稠,-8.84338959779;夢,-10.5173660314;莱,-6.71070354159;戰,-3.37059385191;常,-9.13107167024;值,-9.41875374269;眾,-6.31766095348;毁,-11.61597832;立,-9.41875374269;种,-10.9228311395;題,-11.61597832;发,-5.60226316398;兒,-7.33931220101;湘,-9.8242188508;招,-11.61597832;绣,-11.61597832;工,-6.61203201408;矩,-8.62024604647;器,-10.9228311395;潮,-8.24868249004;菱,-6.28810215124;扰,-8.62024604647;磷,-9.31339322703;勻,-9.67006817097;睾,-11.61597832;七,-6.74844386957;有,-9.05102896256;程,-8.357881782;复,-8.5714558823;小,-11.61597832;美,-6.90644811871;殖,-9.53653677835;粤,-8.72560656213;厦,-8.08961779541;喪,-11.61597832;氯,-6.94314948556;憲,-7.20925907276;家,-5.75519209656;弹,-8.97692099041;纸,-7.24653046756;嶺,-7.76583071832;炼,-9.41875374269;观,-10.0065404076;卑,-10.2296839589;街,-6.91549795423;余,-9.05102896256;胜,-9.21808304723;革,-4.23074739696;雨,-9.21808304723;闪,-11.61597832;業,-6.250002305;修,-7.74477730912;敵,-10.0065404076;寶,-7.90240625332;鉻,-10.9228311395;象,-10.5173660314;矾,-11.61597832;较,-11.61597832;暉,-10.5173660314;月,-5.97407124909;萊,-6.71070354159;碍,-10.9228311395;攬,-10.9228311395;倒,-10.9228311395;掛,-9.67006817097;肝,-11.61597832;在,-10.9228311395;袭,-8.43792448968;涯,-10.0065404076;花,-7.57292705219;纹,-11.61597832;玻,-9.05102896256;尺,-10.5173660314;桂,-8.90792811892;资,-7.60864513479;仙,-8.5714558823;潘,-11.61597832;換,-8.15024241723;瑪,-9.41875374269;路,-7.426323578;英,-8.18199111554;柳,-10.0065404076;聲,-9.41875374269;整,-10.0065404076;編,-10.0065404076;都,-7.12734195029;百,-6.9812493318;讀,-10.5173660314;較,-11.61597832;刑,-9.8242188508;鏈,-10.9228311395;题,-11.61597832;丙,-7.62699427346;思,-9.05102896256;酚,-10.9228311395;咪,-10.5173660314;亮,-10.0065404076;育,-10.0065404076;医,-6.73317639744;毀,-11.61597832;拆,-8.84338959779;筋,-9.31339322703;黎,-10.9228311395;瑕,-9.41875374269;量,-8.18199111554;論,-7.83178868611;乙,-6.02872966163;照,-8.72560656213;险,-8.357881782;葵,-11.61597832;幹,-10.9228311395;裕,-7.66473460144;卻,-9.31339322703;长,-7.03101084136;图,-7.74477730912;龍,-6.49798450761;希,-6.20880654857;骏,-8.67153934086;園,-9.41875374269;唱,-11.61597832;沫,-9.41875374269;猪,-9.67006817097;測,-10.0065404076;康,-7.64568640647;頸,-10.5173660314;钻,-8.72560656213;汀,-11.61597832;應,-10.5173660314;青,-9.31339322703;虜,-7.1161686497;拟,-9.41875374269;煤,-7.38187181543;巡,-8.4804841041;屠,-8.97692099041;罢,-8.357881782;盧,-9.41875374269;啦,-10.0065404076;釩,-9.31339322703;鞋,-10.9228311395;迭,-10.0065404076;矽,-8.28377380985;發,-5.60226316398;洁,-8.90792811892;蘇,-8.08961779541;脉,-9.67006817097;莊,-10.0065404076;續,-8.32014145402;唑,-9.8242188508;垒,-11.61597832;渗,-10.5173660314;朝,-8.32014145402;紡,-6.7256291918;鬥,-6.9812493318;储,-11.61597832;氫,-7.57292705219;京,-6.39562249495;光,-6.39562249495;耳,-7.31191322682;流,-8.43792448968;桃,-9.31339322703;及,-7.90240625332;轍,-10.2296839589;菊,-8.97692099041;道,-9.8242188508;葛,-9.13107167024;絡,-10.0065404076;糠,-9.05102896256;兩,-10.2296839589;賽,-7.09418974298;潭,-8.78276497597;滬,-7.15007020137;蟲,-10.2296839589;輔,-7.92709886591;肉,-8.18199111554;脈,-9.67006817097;戊,-8.5714558823;宏,-8.90792811892;唐,-6.20880654857;蜜,-9.41875374269;素,-10.5173660314;爪,-10.5173660314;讯,-10.9228311395;德,-6.80379396465;眼,-8.00506040738;倾,-11.61597832;摆,-10.5173660314;慈,-9.53653677835;動,-5.70247531439;意,-7.60864513479;杜,-7.80931583026;聞,-9.53653677835;峡,-6.96201796987;童,-9.67006817097;韧,-10.2296839589;全,-6.47431476352;淫,-9.53653677835;剪,-10.2296839589;佬,-7.85477820433;格,-5.98118871686;数,-10.2296839589;至,-10.0065404076;貿,-7.29849020649;闻,-9.53653677835;空,-8.72560656213;国,-4.13273390395;亂,-11.61597832;紋,-11.61597832;把,-10.9228311395;後,-10.2296839589;们,-10.5173660314;向,-9.41875374269;众,-6.31766095348;果,-9.13107167024;綠,-9.41875374269;红,-7.13864150555;霧,-10.5173660314;中,-6.34297876146;新,-5.39937221894;強,-8.84338959779;锻,-10.0065404076;傾,-11.61597832;蝇,-9.67006817097;重,-6.68872463487;风,-6.84529369556;佗,-10.9228311395;櫚,-9.67006817097;荟,-10.9228311395;瓦,-7.57292705219;赫,-8.18199111554;度,-5.63456410877;森,-10.9228311395;曲,-7.9524166739;援,-8.32014145402;罷,-8.357881782;島,-9.21808304723;项,-8.21478093836;白,-9.05102896256;一,-4.51347896425;興,-9.21808304723;記,-6.09451740216;御,-11.61597832;索,-8.67153934086;妥,-9.8242188508;玩,-8.72560656213;溫,-8.21478093836;梯,-7.426323578;芳,-10.5173660314;容,-11.61597832;示,-8.4804841041;琼,-5.28269869189;腊,-6.29296834089;限,-11.61597832;達,-5.04229815307;藥,-6.42302146914;蛛,-8.90792811892;藝,-8.5714558823;坦,-7.78733692354;豬,-9.67006817097;对,-10.2296839589;電,-4.84175443367;漁,-10.2296839589;納,-8.43792448968;炔,-10.9228311395;誘,-10.2296839589;动,-5.70247531439;购,-6.94314948556;責,-10.2296839589;阻,-10.5173660314;禺,-11.61597832;什,-8.11947075856;草,-8.08961779541;廠,-10.9228311395;奥,-7.85477820433;壤,-10.2296839589;東,-6.41197163295;偿,-9.31339322703;現,-10.5173660314;截,-10.0065404076;梅,-9.13107167024;文,-5.85078721724;昆,-7.83178868611;律,-11.61597832;福,-10.9228311395;税,-8.24868249004;世,-3.71571228326;佛,-7.19713771223;张,-10.9228311395;宣,-8.67153934086;助,-10.5173660314;帶,-10.9228311395;钽,-9.31339322703;爾,-4.2032143026;仁,-8.08961779541;装,-8.67153934086;拉,-5.17503177939;监,-9.05102896256;僕,-8.18199111554;湖,-7.19713771223;臟,-8.97692099041;杰,-10.9228311395;竹,-10.0065404076;學,-5.25467584245;韻,-9.21808304723;顺,-10.5173660314;丁,-5.98835720634;蠅,-9.67006817097;舉,-9.8242188508;對,-10.2296839589;夏,-7.04126734152;钒,-9.31339322703;洗,-11.61597832;準,-6.42302146914;殘,-9.31339322703;望,-10.9228311395;感,-10.9228311395;鸡,-8.15024241723;利,-5.38353030348;漫,-10.0065404076;身,-9.67006817097;蒲,-10.2296839589;纶,-11.61597832;宸,-10.5173660314;儿,-7.33931220101;激,-10.0065404076;规,-10.5173660314;齋,-8.15024241723;籍,-9.67006817097;釔,-9.53653677835;他,-9.67006817097;橙,-10.9228311395;繡,-11.61597832;物,-6.57255320311;諮,-11.61597832;磺,-10.9228311395;命,-5.73265593154;協,-6.1778990111;璃,-7.72415802192;戌,-8.32014145402;渔,-10.2296839589;羅,-6.20880654857;宝,-7.90240625332;氨,-7.76583071832;輪,-8.03245938157;售,-10.9228311395;馱,-11.61597832;閉,-10.9228311395;徵,-10.5173660314;方,-6.0630187351;机,-6.13118138654;附,-8.72560656213;賓,-8.97692099041;濕,-9.53653677835;乔,-8.4804841041;狗,-11.61597832;统,-6.91549795423;换,-8.15024241723;查,-9.05102896256;諧,-11.61597832;班,-6.61876604626;鳳,-9.05102896256;念,-8.52493586667;年,-8.32014145402;苷,-10.2296839589;慶,-6.57902571761;摸,-9.05102896256;橼,-9.67006817097;滿,-9.13107167024;球,-7.78733692354;厂,-10.9228311395;的,-9.41875374269;妆,-10.9228311395;紉,-11.61597832;羊,-9.53653677835;转,-8.97692099041;輕,-9.31339322703;五,-7.85477820433;列,-11.61597832;肠,-9.41875374269;貨,-9.41875374269;倫,-7.9783921603;疮,-10.5173660314;張,-10.9228311395;户,-8.5714558823;憶,-11.61597832;改,-8.5714558823;蒸,-9.05102896256;誼,-8.97692099041;雄,-8.52493586667;姆,-7.09418974298;恋,-8.43792448968;拌,-10.9228311395;虏,-7.1161686497;毒,-8.62024604647;何,-10.9228311395;仔,-7.62699427346;州,-6.20880654857;董,-10.5173660314;来,-7.25926949334;触,-8.357881782;注,-7.23395168535;火,-7.39647061485;迪,-6.23148325724;饱,-6.7256291918;声,-9.41875374269;米,-6.13951476809;维,-6.37423130497;湿,-9.53653677835;喃,-10.2296839589;宇,-8.84338959779;順,-10.5173660314;粉,-8.72560656213;井,-7.85477820433;演,-6.71813852008;甘,-8.97692099041;窝,-8.5714558823;羟,-11.61597832;股,-4.31011828734;质,-10.5173660314;醫,-6.73317639744;个,-10.2296839589;碱,-8.28377380985;纵,-10.9228311395;获,-9.41875374269;耶,-10.9228311395;郁,-10.2296839589;雅,-7.55553530948;滕,-9.05102896256;潔,-8.90792811892;受,-9.13107167024;駛,-6.96201796987;碎,-10.0065404076;孜,-6.97158742088;属,-6.57902571761;缺,-10.2296839589;饰,-10.9228311395;绵,-11.61597832;數,-10.2296839589;汾,-8.00506040738;送,-10.9228311395;床,-10.2296839589;树,-9.8242188508;北,-7.9524166739;翅,-11.61597832;膠,-9.31339322703;春,-7.85477820433;梦,-10.5173660314;溪,-7.9524166739;鹳,-10.2296839589;報,-9.8242188508;净,-7.7039553146;际,-6.46848384321;屉,-10.9228311395;態,-10.9228311395;菌,-7.9783921603;桑,-11.61597832;鸦,-8.43792448968;南,-5.56860614098;散,-10.2296839589;淨,-7.7039553146;八,-6.76394805611;鉭,-9.31339322703;鹵,-9.05102896256;荷,-8.32014145402;胶,-9.31339322703;刀,-10.0065404076;鄂,-8.39710249516;颇,-8.03245938157;师,-7.78733692354;祖,-11.61597832;气,-8.357881782;化,-4.480290973;妝,-10.9228311395;採,-9.21808304723;洪,-8.67153934086;纳,-8.43792448968;茶,-10.0065404076;覽,-11.61597832;压,-8.15024241723;沿,-11.61597832;鉀,-9.8242188508;壇,-9.41875374269;筆,-7.7039553146;詐,-8.90792811892;卖,-9.53653677835;駝,-9.8242188508;日,-4.07482586489;浪,-7.92709886591;驰,-11.61597832;廳,-8.5714558823;蟹,-9.67006817097;銀,-8.62024604647;搏,-8.97692099041;别,-7.44159105013;炬,-7.39647061485;鬱,-10.2296839589;薺,-9.8242188508;补,-11.61597832;达,-5.04229815307;十,-7.17332706354;狀,-9.67006817097;密,-10.0065404076;廈,-8.08961779541;手,-5.26683932865;緊,-8.67153934086;背,-10.2296839589;角,-8.67153934086;取,-10.9228311395;静,-9.8242188508;盘,-10.5173660314;荡,-11.61597832;滨,-8.90792811892;六,-9.13107167024;平,-5.97407124909;書,-6.77969641307;濾,-8.43792448968;匀,-9.67006817097;妇,-7.92709886591;明,-7.27217289817;输,-9.8242188508;團,-6.71813852008;宛,-9.21808304723;炭,-11.61597832;嬰,-11.61597832;粵,-8.72560656213;戶,-8.5714558823;举,-9.8242188508;鋁,-8.11947075856;區,-9.41875374269;埃,-9.53653677835;铅,-11.61597832;婆,-10.2296839589;彈,-8.97692099041;父,-10.9228311395;族,-6.87104619166;虎,-10.5173660314;形,-10.9228311395;法,-6.66015126243;赔,-8.78276497597;雙,-10.9228311395;祜,-7.78733692354;繞,-10.5173660314;荠,-9.8242188508;試,-9.13107167024;滩,-10.0065404076;热,-7.60864513479;公,-6.57255320311;懷,-11.61597832;扶,-11.61597832;读,-10.5173660314;楼,-6.37423130497;湾,-6.6959973942;鋪,-10.9228311395;备,-9.41875374269;温,-8.21478093836;錫,-8.84338959779;穆,-9.05102896256;冬,-11.61597832;皮,-9.53653677835;雲,-7.9783921603;届,-6.90644811871;奇,-8.18199111554;敏,-11.61597832;体,-8.4804841041;棒,-9.31339322703;藏,-6.56612231278;硝,-8.78276497597;點,-10.9228311395;陽,-5.80483732705;卫,-6.48017988298;質,-10.5173660314;镯,-10.5173660314;驱,-8.5714558823;巴,-6.358482948;钨,-11.61597832;虹,-11.61597832;死,-9.21808304723;擺,-10.5173660314;厅,-8.5714558823;庇,-11.61597832;須,-10.9228311395;融,-6.358482948;昌,-6.86238812892;谐,-11.61597832;写,-10.9228311395;岛,-9.21808304723;斡,-8.06063025854;接,-8.08961779541;产,-6.90644811871;琳,-8.97692099041;碳,-10.0065404076;收,-8.357881782;治,-6.08654923251;調,-10.0065404076;靂,-11.61597832;织,-7.47284359363;苏,-8.08961779541;跑,-11.61597832;豐,-9.67006817097;试,-9.13107167024;盗,-10.5173660314;灘,-10.0065404076;博,-8.62024604647;神,-8.06063025854;浦,-7.16163102377;表,-4.88257642819;短,-9.8242188508;煮,-11.61597832;己,-7.80931583026;婴,-11.61597832;逃,-10.5173660314;包,-9.21808304723;颈,-10.5173660314;服,-9.53653677835;戏,-11.61597832;酬,-10.0065404076;缝,-9.13107167024;府,-10.9228311395;黄,-8.67153934086;枢,-9.05102896256;挥,-10.9228311395;护,-9.13107167024;丧,-11.61597832;润,-8.28377380985;梨,-9.05102896256;脹,-9.67006817097;伽,-9.67006817097;獅,-9.8242188508;狄,-10.5173660314;術,-10.0065404076;煙,-9.41875374269;络,-10.0065404076;鑫,-8.4804841041;統,-6.91549795423;峰,-9.41875374269;时,-6.30771062263;腹,-11.61597832;载,-11.61597832;庫,-10.9228311395;销,-9.41875374269;銅,-7.24653046756;錄,-9.31339322703;斋,-8.15024241723;備,-9.41875374269;蒡,-10.9228311395;报,-9.8242188508;訪,-10.5173660314;环,-7.31191322682;粱,-10.5173660314;細,-9.13107167024;馳,-11.61597832;殿,-10.9228311395;品,-8.90792811892;燃,-9.13107167024;療,-11.61597832;屆,-6.90644811871;移,-9.8242188508;察,-8.90792811892;塞,-7.87830870174;牧,-8.52493586667;痫,-11.61597832;园,-9.41875374269;可,-8.08961779541;干,-10.9228311395;腸,-9.41875374269;艺,-8.5714558823;喀,-11.61597832;民,-4.58689075588;候,-10.5173660314;帝,-7.76583071832;榨,-10.0065404076;甫,-10.9228311395;匯,-6.70332343429;邮,-8.43792448968;丽,-9.31339322703;軋,-9.41875374269;元,-8.06063025854;豌,-11.61597832;比,-7.87830870174;块,-8.90792811892;壞,-10.9228311395;无,-7.5216337578;轧,-9.41875374269;山,-4.97349151866;女,-11.61597832;劃,-11.61597832;沪,-7.15007020137;内,-6.31267341197;安,-5.79293242454;養,-7.74477730912;圖,-7.74477730912;四,-5.88913057244;伦,-7.9783921603;让,-9.67006817097;場,-8.97692099041;款,-8.15024241723;蛋,-10.9228311395;乐,-5.93580571101;浒,-7.10511881351;党,-7.72415802192;川,-7.5216337578;屜,-10.9228311395;食,-8.97692099041;车,-8.67153934086;睦,-11.61597832;闭,-10.9228311395;烯,-6.99100550674;鹰,-9.21808304723;絲,-9.31339322703;省,-11.61597832;蘋,-10.2296839589;莎,-10.0065404076;源,-6.59209779918;樓,-6.37423130497;鸛,-10.2296839589;醛,-10.2296839589;实,-6.63237169832;肤,-7.47284359363;氧,-6.27364406806;侦,-8.97692099041;鎮,-9.41875374269;弱,-10.9228311395;網,-9.8242188508;架,-10.5173660314;主,-4.69530681578;忆,-11.61597832;等,-8.97692099041;里,-7.07268353776;鵝,-8.15024241723;条,-8.72560656213;腥,-10.9228311395;铬,-10.9228311395;灯,-8.72560656213;影,-10.9228311395;已,-11.61597832;購,-6.94314948556;企,-7.426323578;膏,-10.5173660314;云,-7.9783921603;伐,-6.66015126243;讓,-9.67006817097;疗,-11.61597832;錘,-11.61597832;通,-8.4804841041;肥,-9.13107167024;害,-8.4804841041;陶,-8.67153934086;头,-8.357881782;着,-9.05102896256;珠,-7.18516152118;塊,-8.90792811892;敌,-10.0065404076;滑,-9.13107167024;棕,-8.5714558823;務,-8.39710249516;租,-11.61597832;书,-6.77969641307;晶,-8.15024241723;苹,-10.2296839589;泽,-11.61597832;庆,-6.57902571761;脏,-8.97692099041;丑,-10.9228311395;辐,-7.17332706354;綜,-11.61597832;急,-10.9228311395;货,-9.41875374269;喬,-8.4804841041;縱,-10.9228311395;船,-8.78276497597;輻,-7.17332706354;千,-8.15024241723;细,-9.13107167024;閃,-11.61597832;运,-4.3134818963;類,-10.9228311395;牙,-6.31267341197;变,-7.55553530948;酯,-10.9228311395;狮,-9.8242188508;翰,-6.86238812892;塵,-10.2296839589;轻,-9.31339322703;胺,-9.21808304723;汽,-8.97692099041;縫,-9.13107167024;西,-5.86658533412;諾,-7.39647061485;禁,-9.13107167024;待,-10.2296839589;劇,-10.5173660314;喉,-10.5173660314;合,-6.22235077367;外,-7.9783921603;尘,-10.2296839589;欢,-11.61597832;两,-10.2296839589;银,-8.62024604647;薩,-6.33277459129;萨,-6.33277459129;箭,-10.2296839589;崮,-9.21808304723;熱,-7.60864513479;咳,-11.61597832;放,-5.50895543228;魂,-10.9228311395;必,-7.9524166739;兆,-9.05102896256;坊,-11.61597832;母,-9.67006817097;济,-5.97053142238;奖,-9.53653677835;盟,-7.90240625332;賣,-9.53653677835;腦,-10.2296839589;早,-10.5173660314;士,-5.22573765296;马,-5.96348913976;灰,-8.39710249516;獲,-9.41875374269;韵,-9.21808304723;揽,-10.9228311395;替,-9.41875374269;庄,-10.0065404076;切,-10.0065404076;脑,-10.2296839589;首,-10.2296839589;紙,-7.24653046756;粘,-9.8242188508;氣,-8.357881782;交,-6.00650652484;酰,-7.12734195029;吳,-8.52493586667;牲,-11.61597832;嚴,-8.00506040738;费,-10.0065404076;总,-8.08961779541;挽,-11.61597832;籃,-10.9228311395;组,-11.61597832;片,-5.68108412441;准,-6.42302146914;哈,-6.80379396465;乏,-10.2296839589;驗,-9.41875374269;询,-10.5173660314;滤,-8.43792448968;硫,-7.41128570064;共,-6.36895424787;味,-7.59062662929;史,-11.61597832;率,-9.53653677835;锈,-9.8242188508;見,-9.67006817097;舒,-10.9228311395;算,-10.9228311395;军,-9.21808304723;猜,-8.5714558823;亥,-5.48258027703;伤,-8.90792811892;控,-7.47284359363;第,-7.31191322682;羯,-10.0065404076;铜,-7.24653046756;油,-8.39710249516;贸,-7.29849020649;芽,-10.0065404076;壁,-11.61597832;構,-10.9228311395;腐,-7.29849020649;祥,-8.72560656213;勝,-9.21808304723;費,-10.0065404076;瑞,-7.5216337578;裡,-7.07268353776;詢,-10.5173660314;潤,-8.28377380985;兰,-4.27709018619;割,-11.61597832;靴,-11.61597832;请,-10.5173660314;码,-10.9228311395;吉,-6.7256291918;芒,-9.41875374269;庚,-10.5173660314;初,-8.24868249004;土,-7.9524166739;校,-11.61597832;责,-10.2296839589;檢,-11.61597832;严,-8.00506040738;澤,-11.61597832;夫,-5.2862574145;粮,-10.0065404076;申,-10.5173660314;阵,-8.62024604647;真,-7.31191322682;人,-5.48910913591;撾,-10.0065404076;鹅,-8.15024241723;升,-10.9228311395;益,-9.21808304723;處,-10.9228311395;柔,-10.9228311395;字,-8.18199111554;衡,-9.13107167024;赣,-7.13864150555;摩,-7.78733692354;凰,-7.32551887888;陵,-7.9524166739;歷,-11.61597832;板,-9.13107167024;擾,-8.62024604647;宁,-7.64568640647;稀,-11.61597832;射,-7.41128570064;成,-5.20744952897;碗,-10.0065404076;龙,-6.49798450761;力,-6.70332343429;級,-9.41875374269;霞,-9.41875374269;计,-7.17332706354;蘆,-9.31339322703;到,-10.0065404076;儲,-11.61597832;吴,-8.52493586667;边,-9.67006817097;游,-8.90792811892;黃,-8.67153934086;陈,-11.61597832;請,-10.5173660314;行,-6.74078099683;策,-10.0065404076;凝,-10.5173660314;非,-9.53653677835;代,-4.86137422054;晨,-7.01080813404;蕪,-9.67006817097;置,-8.78276497597;雳,-11.61597832;松,-10.5173660314;布,-11.61597832;紅,-7.13864150555;历,-11.61597832;霉,-9.13107167024;疊,-7.59062662929;氏,-8.39710249516;芐,-10.9228311395;易,-6.99100550674;頗,-8.03245938157;创,-7.62699427346;酮,-9.67006817097;次,-3.7979503815;津,-7.47284359363;性,-8.67153934086;蚨,-10.0065404076;微,-8.84338959779;阳,-5.80483732705;冲,-9.13107167024;电,-4.84175443367;样,-9.8242188508;鹃,-11.61597832;盈,-11.61597832;橋,-7.83178868611;啶,-11.61597832;绘,-11.61597832;牛,-7.7039553146;線,-9.13107167024;歡,-11.61597832;鹼,-8.28377380985;陳,-11.61597832;滸,-7.10511881351;蟾,-11.61597832;砂,-10.2296839589;約,-9.67006817097;醇,-8.03245938157;爆,-7.66473460144;残,-9.31339322703;与,-8.72560656213;抑,-10.2296839589;缘,-10.5173660314;玛,-9.41875374269;尚,-8.62024604647;侣,-10.5173660314;木,-8.18199111554;礬,-11.61597832;縮,-9.67006817097;進,-7.9524166739;輸,-9.8242188508;心,-9.53653677835;變,-7.55553530948;組,-11.61597832;采,-9.21808304723;靈,-10.5173660314;告,-8.4804841041;荐,-10.5173660314;染,-8.90792811892;恒,-6.81195727529;泥,-10.9228311395;赤,-9.53653677835;艦,-8.39710249516;杨,-9.41875374269;寫,-10.9228311395;印,-8.78276497597;石,-7.80931583026;決,-10.9228311395;亚,-5.91553474664;威,-10.0065404076;嘉,-8.62024604647;农,-6.95253922591;生,-5.96348913976;涤,-10.9228311395;芦,-9.31339322703;頭,-8.357881782;馬,-5.96348913976;爱,-10.9228311395;现,-10.5173660314;鐵,-4.62388189261;丹,-5.8383259968;政,-7.02085846989;節,-9.67006817097;居,-7.9524166739;護,-9.13107167024;瓊,-5.28269869189;衍,-8.08961779541;赏,-10.5173660314;提,-11.61597832;鍛,-10.0065404076;雞,-8.15024241723;台,-7.74477730912;间,-7.16163102377;异,-10.9228311395;斑,-10.9228311395;店,-10.5173660314;香,-7.28524497974;漢,-6.71070354159;窯,-8.72560656213;喱,-10.2296839589;傳,-9.31339322703;露,-8.62024604647;核,-11.61597832;商,-5.89895061862;塘,-9.13107167024;孚,-8.90792811892;池,-9.31339322703;恨,-8.357881782;奮,-10.5173660314;僳,-8.11947075856;价,-9.67006817097;拿,-7.32551887888;疆,-8.90792811892;鄉,-8.00506040738;二,-4.14518454583;撐,-10.2296839589;礙,-10.9228311395;碘,-11.61597832;君,-8.62024604647;定,-8.00506040738;障,-10.9228311395;負,-9.8242188508;薦,-10.5173660314;由,-9.67006817097;環,-7.31191322682;椹,-11.61597832;殺,-8.62024604647;房,-10.2296839589;癇,-11.61597832;煉,-9.41875374269;珊,-8.62024604647;位,-10.0065404076;滌,-10.9228311395;救,-7.5216337578;壘,-11.61597832;盜,-10.5173660314;賠,-8.78276497597;衣,-9.21808304723;步,-7.45709523667;铰,-11.61597832;鍵,-11.61597832;诺,-7.39647061485;曼,-8.43792448968;承,-11.61597832;鲁,-7.60864513479;紀,-7.02085846989;市,-7.44159105013;理,-5.98118871686;刊,-11.61597832;躍,-7.57292705219;撑,-10.2296839589;投,-7.72415802192;得,-9.53653677835;餘,-9.05102896256;霜,-9.8242188508;原,-9.53653677835;財,-11.61597832;舰,-8.39710249516;航,-7.7039553146;钱,-10.9228311395;田,-6.91549795423;决,-10.9228311395;淋,-11.61597832;削,-10.5173660314;軍,-9.21808304723;晒,-10.9228311395;志,-7.9524166739;痛,-10.9228311395;婚,-10.9228311395;靜,-9.8242188508;泡,-9.13107167024;解,-7.90240625332;续,-8.32014145402;異,-10.9228311395;却,-9.31339322703;磨,-8.67153934086;藻,-10.9228311395;封,-11.61597832;证,-6.56612231278;稅,-8.24868249004;选,-10.5173660314;洋,-6.68872463487;不,-7.7039553146;弗,-11.61597832;根,-5.81992056926;廂,-7.24653046756;驅,-8.5714558823;均,-8.15024241723;燈,-8.72560656213;测,-10.0065404076;菔,-10.5173660314;罗,-6.20880654857;糖,-8.03245938157;污,-10.5173660314;臨,-7.60864513479;魯,-7.60864513479;关,-8.32014145402;酒,-10.0065404076;創,-7.62699427346;觸,-8.357881782;征,-10.5173660314;钇,-9.53653677835;玉,-11.61597832;事,-5.44011104992;编,-10.0065404076;宙,-10.0065404076;際,-6.46848384321;多,-7.13864150555;澡,-10.0065404076;财,-11.61597832;掩,-8.90792811892;纫,-11.61597832;維,-6.37423130497;劳,-9.8242188508;甲,-6.3226734953;買,-11.61597832;伶,-11.61597832;施,-10.5173660314;介,-10.5173660314;廣,-6.26412018655;联,-6.78766458272;许,-10.2296839589;盛,-8.06063025854;烟,-9.41875374269;信,-7.16163102377;习,-10.0065404076;屬,-6.57902571761;餅,-10.5173660314;下,-11.61597832;熊,-10.2296839589;轮,-8.03245938157;速,-7.31191322682;樣,-9.8242188508;師,-7.78733692354;鮮,-6.11472010948;谷,-8.11947075856;侶,-10.5173660314;屍,-10.9228311395;之,-7.39647061485;泌,-9.21808304723;村,-11.61597832;打,-10.9228311395;慕,-10.2296839589;高,-5.56153897376;瓜,-9.53653677835;自,-6.12291687669;篮,-10.9228311395;兵,-7.1161686497;开,-7.39647061485;处,-10.9228311395;規,-10.5173660314;莓,-11.61597832;熟,-11.61597832;亡,-7.76583071832;传,-9.31339322703;氢,-7.57292705219;茨,-7.18516152118;岭,-7.76583071832;種,-10.9228311395;地,-5.78409584274;鐲,-10.5173660314;症,-11.61597832;陆,-9.31339322703;午,-6.13951476809;遊,-8.90792811892;材,-7.78733692354;存,-9.53653677835;铝,-8.11947075856;满,-9.13107167024;驮,-11.61597832;郵,-8.43792448968;兴,-9.21808304723;混,-8.32014145402;铁,-4.62388189261;項,-8.21478093836;隆,-8.67153934086;鈉,-10.0065404076;邊,-9.67006817097;谍,-10.9228311395;析,-9.41875374269;纖,-9.21808304723;官,-9.8242188508;喜,-11.61597832;償,-9.31339322703;渡,-8.43792448968;侠,-9.53653677835;推,-8.32014145402;溶,-8.15024241723;樹,-9.8242188508;偵,-8.97692099041;硅,-8.28377380985;起,-6.1735606095;镇,-9.41875374269;集,-7.05163012856;又,-9.41875374269;坛,-9.41875374269;關,-8.32014145402;勞,-9.8242188508;乡,-8.00506040738;俠,-9.53653677835;正,-6.18225631647;波,-7.39647061485;桥,-7.83178868611;鑽,-8.72560656213;哲,-8.43792448968;灵,-10.5173660314;海,-5.51565936801;件,-10.2296839589;腿,-10.5173660314;
+M,n:耀,-13.947443674;茂,-10.651606808;涉,-9.61671033374;谈,-8.15138592326;預,-10.9029212363;洞,-9.62995556049;瘤,-9.99619995544;礦,-6.45023645082;般,-9.35232382389;河,-7.64665787936;临,-10.7693898437;疹,-13.947443674;吸,-7.72090700474;场,-6.36216259539;娼,-13.947443674;线,-6.69751813731;談,-8.15138592326;反,-7.25412000576;牌,-9.2653124469;姑,-7.93372851798;筒,-9.2653124469;織,-6.37237197452;遠,-7.56393703914;瓣,-10.7285678492;卢,-10.8564012207;知,-7.79046468844;除,-9.42565509698;緩,-13.947443674;扬,-11.4625370242;歲,-10.0556233759;闹,-10.4817077712;覆,-12.8488313854;缕,-13.2542964935;应,-6.28215895555;枚,-9.97715176047;謝,-9.27461483956;儡,-11.8680021323;禦,-7.86522476365;崩,-10.9517114005;芬,-9.60363825217;是,-11.7502190967;讲,-9.8530991118;爷,-8.9707099316;骼,-9.97715176047;運,-6.85403904816;鍍,-10.651606808;契,-10.8119494581;录,-7.97363406216;教,-6.40099740028;諜,-11.2393934729;叢,-10.0762426631;姦,-10.689347136;括,-9.74275105463;滴,-10.2338716073;须,-10.1407811843;广,-10.7285678492;門,-6.50377999091;贈,-11.11423033;上,-7.12089845047;后,-8.22713189742;餐,-9.62995556049;經,-5.18198514252;怖,-9.32247086074;蒙,-11.4625370242;閣,-8.5768056459;岩,-11.0570719161;茬,-11.2393934729;枯,-10.689347136;伴,-9.74275105463;馈,-13.947443674;离,-6.77578685126;鬼,-10.2585642199;尾,-7.68977608614;胁,-10.5134564695;框,-10.8564012207;釋,-9.09541341011;壑,-11.1748549518;聖,-10.7285678492;槛,-11.644858581;虚,-11.11423033;譜,-8.8475772462;濟,-4.94992530429;跳,-10.1862435583;号,-8.04754632044;姻,-9.72793596885;态,-7.61594182413;节,-7.02184847691;厌,-12.5611493129;媒,-9.00580125142;倡,-10.8119494581;犢,-11.4625370242;鬧,-10.4817077712;纪,-7.38641300813;术,-6.01795715071;課,-11.644858581;稽,-11.4625370242;蕃,-12.001533525;克,-6.30780138617;前,-8.99868378365;坏,-8.93016383721;塑,-8.46264674053;幕,-8.26046831769;翔,-9.74275105463;胖,-9.56541703935;賞,-9.67077755501;几,-11.8680021323;勢,-8.75448682313;巨,-10.0762426631;腫,-10.8119494581;卷,-9.67077755501;齿,-8.72708784895;脂,-8.95023140026;萄,-6.66605801045;丈,-8.79415207953;纓,-11.0030046949;尔,-7.16072672342;挖,-13.947443674;嚣,-12.5611493129;符,-8.3829232667;褲,-10.7285678492;涵,-12.5611493129;禽,-11.1748549518;所,-8.04481034062;摄,-11.7502190967;浊,-11.644858581;凍,-9.47010685955;灌,-10.4817077712;監,-7.77783294153;呤,-13.947443674;磧,-11.0030046949;学,-4.16855608972;翩,-13.2542964935;臭,-11.8680021323;蓯,-10.5134564695;递,-10.3639247356;践,-10.0762426631;培,-12.1556842048;硼,-11.4625370242;持,-6.82699930163;标,-6.82457701543;予,-13.947443674;越,-8.64912630748;笑,-9.83656980985;妒,-13.947443674;耗,-8.60510942206;訛,-12.5611493129;锥,-8.96383705232;弩,-10.0762426631;覲,-11.3824943166;貴,-11.644858581;隸,-7.37796225361;稻,-10.9029212363;懂,-13.947443674;轉,-7.27288228221;酶,-10.3098575143;免,-9.88700066348;秒,-12.3380057616;菖,-11.3083863444;楝,-10.8119494581;補,-10.0762426631;江,-8.73250791642;连,-8.05028980639;略,-6.84906803543;實,-6.98614762811;黨,-6.82861742496;乳,-7.59133601333;遷,-9.16832018091;相,-7.83155154854;痺,-11.644858581;好,-8.54476629215;溉,-10.3920956125;王,-7.35303021428;谊,-10.0156180413;疏,-10.9517114005;阎,-11.644858581;窑,-11.3083863444;务,-5.24443503656;鞣,-13.947443674;钥,-11.4625370242;缨,-11.0030046949;斯,-7.33809443086;贴,-10.580147844;制,-6.39783450887;霸,-9.43658416751;飞,-8.24700010063;綿,-9.8530991118;苁,-10.5134564695;友,-9.86990623012;煌,-9.74275105463;毛,-7.61061794288;占,-8.01519848658;啤,-11.3824943166;秧,-10.9029212363;婦,-9.51662687518;绩,-9.43658416751;普,-7.90243835999;浴,-12.3380057616;壽,-8.99868378365;會,-5.02932901455;薄,-12.5611493129;侈,-8.46264674053;册,-8.98459904377;階,-5.64517787915;缓,-13.947443674;講,-9.8530991118;榜,-13.947443674;负,-8.56294861124;圣,-10.7285678492;大,-5.76042260668;窦,-10.3639247356;粪,-10.580147844;支,-8.14230870511;樱,-12.3380057616;记,-7.31149711834;揀,-12.5611493129;义,-6.38268666112;鍋,-9.18526973923;泊,-11.0570719161;遍,-9.17675904956;問,-9.02018998887;当,-9.97715176047;展,-7.08364028257;叠,-9.78856059067;督,-7.50809330292;繩,-12.3380057616;荫,-11.3824943166;話,-7.42388136788;佳,-12.001533525;棲,-11.3824943166;具,-8.89119786868;矸,-11.3824943166;顽,-11.8680021323;蜂,-10.1407811843;謊,-12.5611493129;嘌,-11.0570719161;那,-9.88700066348;厥,-11.5495484012;座,-9.78856059067;撫,-11.2393934729;梳,-13.2542964935;段,-7.29458064467;訴,-8.52690867475;区,-7.45672013952;羽,-13.947443674;窿,-12.001533525;夾,-11.11423033;胃,-11.1748549518;杂,-8.18225257124;鈷,-12.5611493129;仇,-10.651606808;浆,-9.07224635082;觉,-9.55299451935;案,-7.92399608106;癌,-10.580147844;煎,-11.8680021323;壓,-7.26033506616;聘,-9.22005585531;泛,-10.1188022775;面,-6.22875817883;鉤,-11.5495484012;继,-9.64337858082;苯,-9.04216889559;慮,-11.0030046949;汰,-10.651606808;诵,-12.001533525;雷,-7.9215777002;當,-9.97715176047;灸,-10.689347136;峻,-12.1556842048;獺,-12.8488313854;繼,-9.64337858082;變,-8.51809804507;徒,-11.7502190967;輝,-10.5134564695;溜,-13.2542964935;訟,-8.83545588567;锡,-10.3365257614;連,-8.05028980639;天,-6.46139105616;洱,-10.0972960723;農,-7.55888226848;稿,-10.3098575143;呋,-11.0030046949;驶,-7.07324517857;鵑,-9.39356678242;習,-7.45672013952;孕,-8.89758766678;汛,-13.2542964935;機,-6.00082611078;灣,-10.2338716073;勤,-9.52860306623;葫,-9.61671033374;鯪,-13.2542964935;曬,-11.0030046949;良,-8.72169700031;泰,-10.580147844;陷,-10.5134564695;综,-8.36771384804;茄,-10.2838820279;訊,-6.83348756446;搖,-13.947443674;戚,-9.97715176047;钡,-13.2542964935;墩,-12.8488313854;沱,-12.8488313854;串,-11.4625370242;吶,-11.644858581;点,-8.23371086852;刺,-9.74275105463;時,-6.6295674754;过,-8.15138592326;雍,-13.2542964935;結,-7.61238942253;姓,-10.5462462924;答,-11.1748549518;作,-5.0399666965;院,-7.87670594602;卤,-11.644858581;華,-6.19039253199;執,-9.03478878829;價,-6.6328908417;寿,-8.99868378365;瘍,-10.8119494581;抚,-11.2393934729;丝,-7.65772810312;澜,-13.947443674;吡,-13.947443674;別,-8.41010940701;弧,-11.11423033;窪,-10.4509361126;振,-8.66423994529;亲,-8.89758766678;總,-6.81654484373;墾,-11.0570719161;降,-8.4140541853;协,-8.91049107161;屑,-8.63423769498;绒,-9.51662687518;臘,-8.06691068762;远,-7.56393703914;近,-9.757788932;团,-6.73073418732;古,-6.22388120175;姨,-10.3920956125;药,-7.45066868384;滲,-10.4509361126;坷,-11.3824943166;瓶,-9.52860306623;幽,-11.1748549518;翼,-10.2097740557;极,-6.94165465477;計,-6.50027531442;同,-6.53649179844;帐,-13.947443674;战,-6.64967539149;產,-4.06896628449;断,-8.13033251406;萬,-8.94349736808;丰,-12.1556842048;檳,-10.4509361126;食,-8.09811889408;券,-6.41321534775;尼,-7.6018073132;資,-3.84322179169;诉,-8.52690867475;楊,-9.22005585531;像,-7.58441557048;獎,-8.56294861124;髓,-9.37273269552;燥,-11.1748549518;糧,-7.37936576261;齦,-12.8488313854;奪,-7.63389562775;据,-6.75150644755;叹,-9.60363825217;籼,-10.8119494581;签,-7.27414570626;蚀,-8.98459904377;來,-7.60005446437;瘋,-13.947443674;和,-6.12740568457;折,-8.49212255867;丛,-10.0762426631;贝,-10.3365257614;蠟,-9.69894843198;鈣,-8.85369347322;窨,-10.3365257614;禪,-11.0570719161;漱,-12.5611493129;宾,-8.75448682313;證,-6.36623384783;偏,-10.3639247356;緒,-8.58615150832;賜,-13.947443674;诞,-9.71333716943;睡,-11.8680021323;因,-9.90439240619;虫,-7.79684090558;擬,-10.7693898437;聯,-6.40258260537;揮,-6.73588694071;轱,-11.8680021323;卹,-10.580147844;狸,-10.3365257614;幻,-11.0030046949;顿,-10.3098575143;蜀,-11.7502190967;掃,-12.1556842048;悅,-13.947443674;涇,-11.7502190967;锌,-9.61671033374;还,-12.5611493129;芙,-10.7693898437;供,-9.28400457991;貝,-10.3365257614;樞,-8.35273229442;眠,-9.42565509698;播,-8.29846943586;估,-9.47010685955;梵,-12.5611493129;阶,-5.64517787915;犹,-12.3380057616;债,-7.79471097932;禿,-13.947443674;杀,-9.59073484734;埋,-11.3083863444;响,-6.78117769989;界,-6.49214518834;减,-11.3083863444;黑,-8.884848641;罐,-9.42565509698;寓,-11.3824943166;旗,-10.8119494581;聚,-8.08097561709;槟,-10.4509361126;詞,-10.2585642199;坠,-10.689347136;潰,-10.2097740557;獸,-11.3083863444;峽,-9.45880730429;姿,-12.001533525;蒂,-12.3380057616;了,-13.2542964935;蔗,-11.11423033;暖,-9.55299451935;掘,-8.70569665897;輛,-10.9029212363;匣,-9.95845962746;约,-7.42682254647;娩,-11.8680021323;末,-9.97715176047;搭,-11.0030046949;男,-9.61671033374;隶,-7.37796225361;簽,-7.27414570626;敗,-9.19385348292;潛,-7.71107408382;胚,-10.2097740557;铢,-9.757788932;凤,-9.94011048879;穩,-9.02018998887;寨,-11.2393934729;辦,-7.6375253958;乱,-11.7502190967;長,-5.55536029365;雾,-11.11423033;饿,-11.5495484012;箍,-8.79415207953;逐,-8.13033251406;阔,-10.7693898437;焦,-9.33232315718;贮,-10.5134564695;尸,-9.95845962746;强,-8.59085739935;见,-7.57071672613;賃,-9.55299451935;苇,-10.580147844;穌,-11.5495484012;金,-5.11748562979;孢,-12.3380057616;鹤,-11.4625370242;周,-5.70732237595;语,-7.56901749037;浮,-9.3127146858;鷹,-11.0570719161;僻,-12.8488313854;验,-6.74701878108;隔,-10.6152391638;弥,-8.61956750524;纤,-8.56754632048;瞪,-11.2393934729;港,-8.29846943586;莲,-8.73250791642;朵,-11.1748549518;紹,-9.39356678242;岸,-7.58441557048;瘿,-13.947443674;检,-9.27461483956;艇,-13.947443674;蕉,-9.74275105463;兑,-13.2542964935;牧,-6.81016523676;哨,-12.001533525;衫,-12.5611493129;葳,-12.8488313854;更,-11.644858581;偻,-10.1862435583;狼,-9.35232382389;梁,-9.41484418087;訂,-9.17675904956;嬌,-13.947443674;導,-5.34922364397;划,-7.88365846534;栖,-11.3824943166;膛,-11.3824943166;芝,-10.1188022775;螟,-13.947443674;麥,-9.51662687518;钩,-11.5495484012;用,-5.74249850901;榫,-13.2542964935;謬,-11.8680021323;粹,-8.87226985879;裁,-8.44618546348;跃,-10.0556233759;菇,-11.3083863444;恆,-9.09541341011;效,-6.69893960165;始,-6.81334995283;僑,-9.45880730429;嗓,-10.9029212363;雕,-13.2542964935;頑,-11.8680021323;緣,-8.79994919721;驢,-11.2393934729;珧,-13.947443674;噪,-12.8488313854;胱,-10.0556233759;慰,-11.7502190967;击,-6.02627095244;響,-6.78117769989;清,-8.58615150832;侄,-12.3380057616;指,-7.1252462834;蚊,-12.1556842048;謗,-10.9517114005;撞,-10.4210831494;堡,-11.644858581;鴣,-12.3380057616;帥,-8.77695967899;群,-10.2838820279;吩,-13.947443674;爽,-13.2542964935;钾,-13.947443674;久,-8.30553660309;葉,-6.51023730715;奋,-8.81164523697;菜,-8.03664702998;束,-8.40618012887;门,-6.50377999091;雪,-8.99868378365;软,-12.8488313854;柴,-10.4509361126;养,-7.27541072856;言,-6.50553694597;溃,-10.2097740557;枉,-10.6152391638;禍,-13.2542964935;鼎,-11.0570719161;儒,-12.3380057616;欖,-8.483611869;怜,-10.3365257614;审,-8.86603930904;稠,-11.0030046949;垩,-8.55381612767;脲,-12.8488313854;常,-7.36127201917;值,-6.74701878108;圾,-9.06464175144;证,-6.36623384783;楂,-11.7502190967;捆,-13.2542964935;发,-5.5892462141;棗,-12.1556842048;乘,-10.2585642199;招,-10.0972960723;躑,-13.947443674;绣,-13.947443674;層,-8.16054629266;烧,-8.44211213809;卦,-9.82030928898;器,-7.36680453674;潮,-9.77305640413;扰,-9.41484418087;函,-9.92209198329;灼,-11.11423033;睾,-10.8119494581;有,-5.4596792933;程,-6.46983943083;薊,-12.8488313854;颌,-9.44763400369;冒,-10.3098575143;殖,-7.0497387309;伙,-7.03569637377;鸣,-8.56294861124;氯,-8.45850594787;辮,-11.3824943166;砷,-12.5611493129;家,-6.01651830154;庸,-12.1556842048;嶺,-8.56754632048;乃,-9.3127146858;車,-6.4496819734;泄,-9.69894843198;翎,-12.3380057616;卑,-11.0570719161;狐,-10.1407811843;噓,-11.2393934729;燒,-8.44211213809;付,-9.07990922357;胜,-6.54134029279;雨,-7.53234671485;嗪,-12.8488313854;懲,-13.947443674;擴,-10.6152391638;役,-9.10325658757;绸,-11.1748549518;鉻,-12.1556842048;兽,-11.3083863444;矾,-9.2560957918;謀,-7.08155259914;箋,-11.7502190967;碍,-8.66423994529;餌,-13.947443674;匐,-11.1748549518;倒,-9.94011048879;肝,-8.94349736808;琪,-11.1748549518;梭,-11.7502190967;纹,-7.62129420087;玻,-9.2653124469;尺,-10.5134564695;炽,-9.43658416751;桂,-11.8680021323;摊,-9.74275105463;獐,-13.2542964935;換,-8.59558554055;锑,-11.3824943166;坨,-13.2542964935;路,-6.51851647922;英,-8.34532485315;整,-8.81164523697;究,-5.22063806558;都,-8.40226622955;百,-6.20677927211;樁,-13.2542964935;讀,-9.77305640413;丙,-8.55381612767;亮,-11.0570719161;育,-6.44746713307;骶,-11.0570719161;难,-8.30908900469;毀,-12.8488313854;佃,-11.2393934729;拆,-9.80430894763;擊,-6.02627095244;額,-8.33431556764;绎,-11.1748549518;剑,-12.1556842048;論,-7.26533507658;俘,-11.5495484012;照,-8.31982256033;闪,-9.41484418087;競,-13.947443674;幹,-7.58786980535;卻,-9.80430894763;偽,-11.5495484012;长,-5.55536029365;盾,-9.97715176047;躬,-11.8680021323;疑,-7.78412886999;吐,-8.36019501562;園,-8.27412040685;鈔,-10.689347136;隧,-10.689347136;沫,-9.92209198329;猪,-9.97715176047;纷,-11.7502190967;頸,-8.69517024598;汀,-13.947443674;橄,-10.689347136;蛇,-10.3365257614;臉,-10.3365257614;忍,-11.5495484012;赖,-8.41801458651;虜,-13.2542964935;拟,-10.7693898437;屠,-9.64337858082;形,-7.65033435409;盧,-10.8564012207;啦,-12.3380057616;蹦,-13.2542964935;廷,-10.7285678492;發,-5.5892462141;洁,-8.62443369489;莊,-10.3365257614;垒,-11.3083863444;舟,-13.947443674;鬥,-6.5809985257;嘧,-10.5462462924;氫,-8.92356315318;京,-7.40930385026;縷,-13.2542964935;嚼,-12.5611493129;赁,-9.55299451935;屋,-10.651606808;道,-6.54073294385;单,-9.56541703935;跖,-11.3824943166;诚,-11.0030046949;絡,-8.41801458651;煩,-10.9517114005;部,-5.3629657358;只,-12.8488313854;轭,-10.2838820279;聳,-11.0030046949;脈,-8.91049107161;舊,-9.56541703935;箏,-11.7502190967;唐,-9.8530991118;氖,-13.2542964935;岡,-12.8488313854;素,-9.11912993672;爪,-11.3083863444;茴,-11.3824943166;夸,-12.001533525;倾,-8.68475348512;摆,-13.947443674;哑,-10.651606808;動,-4.09519678568;聞,-7.51611259209;童,-9.27461483956;全,-6.82377088882;误,-12.3380057616;数,-6.31989928354;至,-10.8119494581;祸,-13.2542964935;闻,-7.51611259209;空,-6.20200806375;国,-4.98223687125;灾,-9.33232315718;亂,-11.7502190967;膈,-13.947443674;紋,-7.62129420087;後,-8.22713189742;众,-8.81164523697;果,-7.70716782885;綠,-7.38924587121;红,-6.83511622931;霧,-11.11423033;熨,-10.580147844;画,-8.28101698591;猿,-10.1407811843;傾,-8.68475348512;淀,-10.3365257614;重,-7.27667735318;嵋,-12.3380057616;鑑,-11.11423033;盒,-11.4625370242;损,-9.24696330823;胞,-7.19634220509;廢,-9.52860306623;赫,-10.0156180413;鋪,-11.8680021323;譯,-8.5050259635;森,-12.8488313854;葱,-12.3380057616;腳,-8.31265407086;曲,-7.49697325188;援,-9.94011048879;塹,-13.947443674;竺,-12.3380057616;陽,-6.4196496863;一,-6.60531194344;撇,-9.94011048879;興,-9.00580125142;脊,-9.83656980985;途,-10.1862435583;肟,-13.947443674;御,-7.86522476365;索,-8.96383705232;妥,-12.5611493129;咧,-13.2542964935;溫,-8.01519848658;谬,-11.8680021323;梯,-9.09541341011;夺,-7.63389562775;吼,-12.001533525;俁,-11.3824943166;杆,-9.38309548256;籌,-7.29329115384;泗,-10.7285678492;坦,-8.57216526634;酪,-12.3380057616;晰,-10.2097740557;对,-6.59756996929;電,-5.41437713345;嗽,-13.947443674;漁,-11.5495484012;椅,-10.9029212363;按,-11.3083863444;膊,-10.5134564695;納,-8.82347969462;隐,-11.7502190967;閒,-10.2838820279;綢,-11.1748549518;夥,-7.03569637377;吧,-12.8488313854;責,-5.91378524614;议,-6.60790597862;朱,-13.2542964935;簷,-12.3380057616;骸,-12.3380057616;钼,-11.4625370242;棄,-9.55299451935;草,-7.73083757294;坑,-12.5611493129;盐,-8.61956750524;汗,-9.59073484734;陸,-6.94619805196;廠,-8.17912267823;巢,-10.3920956125;祥,-8.91049107161;壤,-9.48153555537;艳,-13.2542964935;噻,-13.947443674;偿,-8.72169700031;現,-7.67268165278;梅,-10.2338716073;文,-5.87685013408;蘆,-10.1862435583;福,-9.61671033374;騎,-10.580147844;攜,-12.8488313854;助,-8.21087137655;帶,-7.35303021428;嬸,-10.689347136;瞻,-9.04216889559;鈾,-13.2542964935;仁,-11.3824943166;求,-7.83376149419;装,-7.24671256448;鳍,-10.4509361126;穎,-12.001533525;囑,-11.644858581;識,-6.60920552396;迫,-8.82944986161;巷,-11.0570719161;韻,-9.55299451935;貂,-11.8680021323;栅,-10.689347136;簍,-12.8488313854;準,-7.8906596608;殘,-10.3098575143;萝,-7.87670594602;斜,-10.1862435583;鸡,-9.22894480273;利,-5.11631603901;漫,-7.76329478309;庶,-12.5611493129;页,-8.98459904377;激,-7.6070843703;衅,-12.001533525;惊,-12.1556842048;屍,-9.95845962746;奏,-7.74693449998;他,-9.16832018091;藜,-12.5611493129;苞,-13.947443674;繡,-13.947443674;物,-5.09721270844;绶,-11.644858581;驹,-13.2542964935;磺,-10.6152391638;命,-6.61311432372;退,-10.8119494581;璃,-7.65217767259;專,-10.689347136;弊,-11.7502190967;舌,-9.57799582156;宝,-7.89771021879;废,-9.52860306623;氨,-8.0557994622;售,-6.53226856441;禱,-13.947443674;閉,-7.1893491696;方,-6.19769026775;釁,-12.001533525;铃,-7.96099166874;桐,-9.71333716943;賓,-8.75448682313;狗,-11.5495484012;痙,-13.2542964935;员,-5.08227325437;坚,-10.0156180413;统,-7.09520110497;查,-7.66330951295;叭,-9.0274627482;駱,-13.2542964935;鳳,-9.94011048879;念,-6.33956560075;苷,-9.35232382389;慶,-10.8564012207;摸,-11.1748549518;仿,-10.7693898437;球,-6.76205665844;厂,-8.17912267823;妆,-7.93128651433;紉,-9.12716210842;昏,-13.947443674;转,-7.27288228221;氓,-11.8680021323;五,-9.45880730429;列,-7.12415755167;错,-10.7285678492;鸟,-9.72793596885;悠,-12.8488313854;探,-9.24696330823;贩,-9.10325658757;單,-9.56541703935;户,-7.61416404589;改,-9.97715176047;蒸,-9.07990922357;螺,-8.94349736808;誼,-10.0156180413;趾,-9.54072442676;秆,-12.8488313854;配,-8.49640522046;拌,-9.99619995544;虏,-13.2542964935;毒,-7.85161911159;何,-8.22713189742;留,-8.53134327182;筝,-11.7502190967;州,-8.27756275104;来,-7.60005446437;蛤,-10.2097740557;触,-9.92209198329;浩,-10.1188022775;迪,-10.4210831494;独,-10.5462462924;饱,-13.947443674;维,-7.69361486245;艷,-13.2542964935;譽,-9.03478878829;儀,-9.86990623012;順,-13.947443674;粉,-8.83545588567;萎,-12.5611493129;褐,-7.71893267043;輔,-11.8680021323;钙,-8.85369347322;甘,-9.94011048879;龟,-10.3920956125;股,-7.35303021428;販,-9.10325658757;钳,-12.1556842048;碱,-8.581467659;纵,-9.88700066348;耶,-11.3824943166;榻,-12.001533525;阴,-9.57799582156;郁,-9.82030928898;雅,-8.47938353289;苍,-11.0570719161;潔,-8.62443369489;属,-7.64849442717;惡,-10.8564012207;恶,-10.8564012207;數,-6.31989928354;智,-9.23791347271;垄,-11.11423033;领,-8.11556119674;床,-10.2338716073;戍,-11.5495484012;树,-8.40226622955;北,-7.23935959017;弟,-9.29348332387;抢,-11.5495484012;鋇,-13.2542964935;梦,-9.35232382389;涨,-11.8680021323;溪,-10.7285678492;爭,-6.59756996929;讼,-8.83545588567;漿,-9.07224635082;狂,-11.4625370242;际,-6.94984769104;鱉,-12.5611493129;擎,-11.5495484012;瑙,-12.8488313854;囚,-11.644858581;鳞,-10.4817077712;散,-7.9119622415;歧,-12.1556842048;八,-8.4140541853;仪,-9.86990623012;坯,-11.0030046949;顱,-13.947443674;称,-8.47098012209;鹵,-11.644858581;荷,-10.689347136;使,-9.00580125142;泾,-11.7502190967;刀,-9.62995556049;各,-11.5495484012;师,-8.15443006564;而,-8.0046442989;妝,-7.93128651433;蚣,-13.2542964935;侩,-13.2542964935;洪,-9.17675904956;箱,-10.0762426631;騰,-12.001533525;纳,-8.82347969462;茶,-9.71333716943;檻,-11.644858581;沿,-12.8488313854;壇,-12.5611493129;筆,-9.13525931865;臍,-11.1748549518;李,-9.17675904956;译,-8.5050259635;仓,-7.59655795731;卖,-7.99420033974;镚,-13.947443674;糟,-12.1556842048;握,-12.5611493129;日,-7.56901749037;警,-8.3944840891;凭,-12.5611493129;銀,-7.96855790912;缉,-10.2585642199;肌,-8.73795752118;搏,-10.7693898437;逗,-12.8488313854;娛,-11.8680021323;疚,-13.2542964935;羞,-10.9029212363;蔥,-12.3380057616;輩,-11.2393934729;达,-8.37149457088;十,-8.581467659;狀,-7.35439913988;终,-11.0570719161;緊,-11.4625370242;乓,-9.10325658757;泔,-13.947443674;取,-9.30305277488;祝,-13.2542964935;锤,-9.45880730429;六,-10.8564012207;矮,-9.757788932;平,-6.47153770466;職,-9.00580125142;書,-5.59654122233;濾,-9.51662687518;犁,-10.2585642199;适,-8.34164160773;弈,-10.8564012207;尊,-9.20251154566;宛,-11.644858581;额,-8.33431556764;攤,-9.74275105463;炭,-8.70041960186;疯,-13.947443674;嬰,-10.3098575143;舶,-9.77305640413;举,-8.23371086852;勁,-10.0972960723;埃,-12.3380057616;铅,-10.8564012207;慌,-9.42565509698;藏,-7.37097410498;歐,-8.22713189742;剖,-8.54476629215;試,-8.49212255867;滩,-11.11423033;轨,-10.2585642199;叫,-9.11116176707;豪,-9.57799582156;郭,-11.7502190967;癮,-11.5495484012;扶,-9.50479241753;读,-9.77305640413;楼,-9.51662687518;湾,-10.2338716073;琅,-11.8680021323;善,-10.0762426631;骆,-13.2542964935;龈,-12.8488313854;首,-10.2338716073;掠,-10.4210831494;营,-6.39678243092;斤,-10.651606808;猫,-12.8488313854;冬,-11.11423033;稱,-8.47098012209;宰,-10.1632540401;鶴,-11.4625370242;蒺,-10.8119494581;珀,-10.8564012207;烂,-11.4625370242;奇,-8.93680837993;鹉,-10.1862435583;糊,-9.67077755501;项,-9.22894480273;体,-6.63823130833;棒,-10.689347136;硝,-9.22894480273;點,-8.23371086852;菠,-11.3824943166;藤,-11.3083863444;卫,-6.57030996119;質,-6.26865467583;目,-8.46264674053;驱,-9.51662687518;練,-7.99420033974;虹,-9.61671033374;擺,-13.947443674;滾,-10.7693898437;須,-10.1407811843;錯,-10.7285678492;写,-9.83656980985;岛,-8.05028980639;产,-4.06896628449;犯,-10.1632540401;綱,-9.30305277488;碳,-9.04960387407;耸,-11.0030046949;治,-5.21530040632;蓋,-7.24671256448;苏,-9.60363825217;跑,-9.45880730429;汐,-10.3639247356;试,-8.49212255867;盗,-10.580147844;博,-8.07814676089;赦,-11.3824943166;表,-5.91866251154;鋯,-13.947443674;己,-9.61671033374;壳,-8.74343698695;署,-12.001533525;穴,-11.1748549518;追,-11.8680021323;垂,-9.83656980985;颈,-8.69517024598;服,-8.15138592326;戏,-9.757788932;栓,-11.5495484012;纜,-11.11423033;枢,-8.35273229442;护,-5.81650137179;丧,-11.7502190967;润,-6.69255886395;梨,-10.651606808;铈,-12.8488313854;莺,-12.3380057616;镁,-9.90439240619;奉,-11.4625370242;術,-6.01795715071;煙,-7.97109276473;飽,-13.947443674;副,-9.28400457991;时,-6.6295674754;腹,-9.44763400369;载,-9.47010685955;身,-7.83376149419;销,-6.53588738621;錄,-7.97363406216;将,-7.76123505012;備,-6.55911581445;侧,-13.2542964935;疫,-7.72884355433;横,-9.8530991118;环,-8.42199073489;粱,-10.3920956125;辈,-11.2393934729;脸,-10.3365257614;似,-9.15995193124;品,-6.04163336137;療,-7.96350739334;鋅,-9.61671033374;獄,-11.7502190967;烙,-13.947443674;绝,-13.2542964935;塞,-8.8475772462;园,-8.27412040685;鼓,-8.82944986161;可,-7.67645524217;份,-6.84329958104;顫,-13.947443674;迁,-9.16832018091;妈,-8.49212255867;民,-4.06257844562;互,-9.88700066348;候,-8.689948302;鴛,-12.8488313854;帝,-7.40497171352;酱,-11.0570719161;邮,-9.47010685955;活,-7.01890585586;元,-6.49214518834;秈,-10.8119494581;竊,-9.74275105463;評,-9.37273269552;比,-8.3829232667;釘,-12.001533525;絛,-11.4625370242;壞,-8.93016383721;慣,-9.21124522563;桩,-13.2542964935;山,-6.65442599425;女,-7.74288591146;懸,-11.0030046949;養,-7.27541072856;踐,-10.0762426631;钗,-11.5495484012;映,-9.38309548256;貧,-13.2542964935;让,-8.01519848658;听,-9.65698423288;場,-6.36216259539;韁,-12.1556842048;蛋,-7.69746843177;藍,-8.42199073489;俑,-10.3639247356;靖,-12.3380057616;党,-6.82861742496;緝,-10.2585642199;拣,-12.5611493129;车,-6.4496819734;襪,-12.3380057616;闭,-7.1893491696;絲,-7.65772810312;任,-6.94437821524;省,-11.11423033;還,-12.5611493129;樓,-9.51662687518;吗,-13.947443674;匙,-11.1748549518;醛,-10.3098575143;蜡,-9.69894843198;咬,-11.3824943166;鎮,-9.10325658757;稳,-9.02018998887;洽,-12.5611493129;貼,-10.580147844;设,-8.3162318922;剃,-13.947443674;充,-10.0762426631;勘,-11.0570719161;条,-7.52257465012;扣,-11.11423033;迦,-9.35232382389;影,-7.05785236567;驳,-11.11423033;饵,-13.947443674;泼,-13.2542964935;需,-8.74894664276;帆,-10.1862435583;堊,-8.55381612767;伐,-8.68475348512;稞,-10.9517114005;肥,-8.93016383721;愤,-11.1748549518;渦,-13.947443674;刮,-10.6152391638;纱,-8.58615150832;陶,-11.644858581;头,-6.45190173014;斷,-8.13033251406;沽,-11.0030046949;贼,-13.2542964935;着,-9.40414889175;參,-8.34902171503;敌,-11.2393934729;扎,-11.4625370242;仑,-10.5134564695;裕,-12.5611493129;做,-12.8488313854;租,-6.91747076232;蝠,-12.8488313854;书,-5.59654122233;凯,-12.5611493129;罰,-9.22894480273;籲,-11.8680021323;晶,-7.18587090522;賽,-9.09541341011;咂,-11.4625370242;庆,-10.8564012207;守,-7.9119622415;朋,-7.61061794288;墊,-9.72793596885;損,-9.24696330823;意,-6.80145920631;辐,-8.581467659;则,-9.77305640413;綜,-8.36771384804;憤,-11.1748549518;货,-6.98330806161;銮,-10.0156180413;縱,-9.88700066348;肺,-12.1556842048;椿,-11.644858581;千,-10.7693898437;酷,-11.0570719161;细,-6.4956214375;牙,-7.60884959582;变,-8.51809804507;僚,-9.65698423288;恥,-10.651606808;酯,-11.4625370242;狮,-10.9029212363;塵,-9.8530991118;轻,-6.99758721902;西,-6.5988561431;禁,-7.73083757294;羅,-7.65217767259;合,-5.05442017963;憑,-12.5611493129;耐,-10.9029212363;骗,-9.39356678242;缚,-13.947443674;欢,-9.44763400369;薩,-8.45027544873;未,-10.3920956125;箭,-7.55051401881;纯,-10.3920956125;熱,-6.30491953979;嘴,-9.95845962746;褶,-11.644858581;駁,-11.11423033;础,-8.32704280831;鳃,-11.3824943166;必,-9.39356678242;勇,-9.72793596885;词,-10.2585642199;济,-4.94992530429;奖,-8.56294861124;盟,-7.4844142171;啞,-10.651606808;泣,-10.3920956125;腦,-8.64912630748;士,-7.59655795731;凱,-12.5611493129;灰,-6.78349698968;獲,-9.78856059067;韵,-9.55299451935;庄,-10.3365257614;针,-10.1188022775;崙,-10.5134564695;粘,-9.10325658757;羚,-11.4625370242;队,-7.70911904899;褡,-11.3083863444;酰,-8.76005786818;枪,-9.07224635082;嚴,-10.9029212363;貸,-8.16670015823;总,-6.81654484373;组,-7.44315550049;則,-9.77305640413;乏,-10.2097740557;插,-11.5495484012;蝕,-8.98459904377;穗,-10.9517114005;询,-9.39356678242;令,-6.10163617139;执,-9.03478878829;填,-12.3380057616;共,-7.21523296756;味,-8.10100489897;直,-9.13525931865;拼,-9.90439240619;率,-9.12716210842;逆,-9.47010685955;锈,-8.80578011752;谎,-12.5611493129;脐,-11.1748549518;舒,-13.947443674;宗,-13.947443674;砖,-10.6152391638;军,-7.55888226848;龄,-8.87226985879;趣,-11.7502190967;鄰,-11.5495484012;蠶,-9.74275105463;油,-6.4956214375;贸,-8.42999077756;为,-8.91049107161;壁,-9.22894480273;祀,-10.9029212363;歌,-10.3639247356;俏,-13.2542964935;糙,-10.689347136;卜,-8.56754632048;襠,-11.0570719161;詢,-9.39356678242;僱,-11.8680021323;牲,-9.21124522563;请,-8.1697913508;桶,-12.5611493129;浸,-12.5611493129;餾,-10.3365257614;码,-8.94349736808;骂,-11.0570719161;径,-10.5462462924;琉,-12.8488313854;隊,-7.70911904899;漏,-13.2542964935;芒,-13.2542964935;初,-10.0762426631;土,-7.63027898728;责,-5.91378524614;檢,-9.27461483956;严,-10.9029212363;澤,-8.01519848658;茧,-12.3380057616;悦,-13.947443674;礫,-10.2585642199;鲮,-13.2542964935;冰,-8.75448682313;申,-10.689347136;劲,-10.0972960723;人,-4.89364015987;秀,-9.45880730429;鹅,-10.3098575143;升,-6.78815176923;益,-5.75376700807;住,-7.93128651433;處,-8.7826577001;柔,-11.5495484012;浣,-13.947443674;摩,-10.4817077712;驭,-12.5611493129;齒,-8.72708784895;陵,-7.94355660692;避,-13.2542964935;護,-5.81650137179;豹,-13.947443674;擾,-9.41484418087;射,-6.01544052166;颗,-12.8488313854;龙,-7.71499565747;力,-5.89419252048;級,-7.30105315918;钟,-11.0570719161;计,-6.50027531442;到,-11.2393934729;儲,-8.15748350313;丸,-12.3380057616;贺,-13.947443674;黃,-7.29716462544;請,-8.1697913508;桌,-10.3098575143;停,-8.27068987176;非,-10.0156180413;毡,-12.1556842048;詠,-13.947443674;躺,-13.2542964935;惧,-10.1407811843;蕪,-13.947443674;硬,-9.09541341011;置,-8.16670015823;雳,-11.8680021323;迹,-13.947443674;蓿,-13.947443674;松,-9.34227348804;如,-12.1556842048;紅,-6.83511622931;历,-9.57799582156;眉,-11.8680021323;喊,-9.37273269552;植,-7.20220732454;氏,-10.1188022775;芐,-13.947443674;易,-4.91958487164;创,-8.47098012209;败,-9.19385348292;暨,-12.5611493129;微,-7.8859867551;冲,-9.23791347271;电,-5.41437713345;钴,-12.5611493129;样,-8.21087137655;鹃,-9.39356678242;假,-9.56541703935;鼠,-8.7826577001;盈,-5.96059877286;拐,-11.0030046949;擔,-9.24696330823;默,-10.0354206686;牛,-8.52249365654;瑟,-9.59073484734;歡,-9.44763400369;饭,-9.60363825217;鹼,-8.581467659;危,-12.3380057616;陳,-10.8564012207;衷,-10.9029212363;突,-10.2338716073;堂,-9.94011048879;分,-5.31051380101;圈,-9.34227348804;残,-10.3098575143;吊,-11.5495484012;与,-7.79471097932;抑,-12.001533525;庙,-13.947443674;缘,-8.79994919721;侣,-13.947443674;木,-7.74288591146;帮,-9.71333716943;瞳,-13.947443674;進,-7.13290077677;伸,-11.7502190967;嫁,-11.3083863444;心,-6.22609506141;組,-7.44315550049;采,-9.04960387407;牆,-10.580147844;霍,-13.2542964935;苑,-13.947443674;捐,-11.8680021323;恒,-9.09541341011;给,-8.34164160773;兜,-10.689347136;泥,-8.27412040685;赤,-12.8488313854;寫,-9.83656980985;音,-7.02381504589;決,-7.9215777002;能,-5.78806893725;于,-9.62995556049;我,-9.61671033374;薔,-12.001533525;梢,-13.947443674;涤,-9.80430894763;馬,-6.69114643433;累,-10.0556233759;爱,-13.2542964935;政,-4.83802922064;節,-7.02184847691;居,-8.1948710352;瓊,-12.8488313854;衍,-13.947443674;赏,-9.67077755501;提,-7.18587090522;忘,-8.67444411546;回,-8.72708784895;橡,-8.58615150832;苦,-11.0570719161;孫,-8.79415207953;痴,-11.644858581;風,-6.82216058251;聽,-9.65698423288;懼,-10.1407811843;异,-8.07814676089;皇,-8.77695967899;唆,-11.3083863444;斑,-9.28400457991;店,-9.99619995544;妙,-12.8488313854;钛,-11.8680021323;功,-7.08573233354;漢,-9.30305277488;怨,-11.3083863444;窯,-11.3083863444;央,-6.77655519551;疱,-10.9029212363;露,-11.5495484012;鈴,-7.96099166874;脾,-10.7285678492;雇,-11.8680021323;凉,-10.3920956125;願,-7.5724188542;魚,-9.22894480273;淡,-13.947443674;瑰,-8.89119786868;价,-6.6328908417;二,-7.38641300813;碘,-11.3083863444;君,-9.69894843198;贡,-12.1556842048;蠣,-13.947443674;措,-13.2542964935;妮,-12.1556842048;由,-6.91217507474;论,-7.26533507658;朽,-12.001533525;房,-7.42535087585;光,-6.95995342702;烈,-11.5495484012;珊,-12.8488313854;位,-7.11333493521;滌,-9.80430894763;拔,-11.4625370242;壘,-11.3083863444;雜,-8.18225257124;牟,-9.36247619535;賠,-11.4625370242;步,-7.36265228164;菪,-11.4625370242;卵,-8.483611869;曼,-8.91049107161;懾,-10.5134564695;市,-6.5696847658;炉,-10.4210831494;儈,-13.2542964935;刊,-10.5134564695;撑,-9.49309637777;投,-10.3639247356;得,-6.69185239977;墙,-10.580147844;稚,-11.1748549518;原,-7.08468576097;財,-11.5495484012;鈰,-12.8488313854;肩,-11.8680021323;截,-9.92209198329;锰,-9.61671033374;鄲,-13.947443674;診,-8.91049107161;僉,-10.7693898437;軍,-7.55888226848;诏,-13.947443674;晒,-11.0030046949;痛,-9.47010685955;婚,-8.38676204301;靜,-8.99868378365;遞,-10.3639247356;泡,-10.4509361126;赠,-11.11423033;酚,-11.0570719161;葦,-10.580147844;惩,-13.947443674;确,-6.67019594739;異,-8.07814676089;癲,-12.5611493129;勵,-10.9517114005;裹,-13.2542964935;藻,-9.95845962746;稅,-7.29200332366;瀉,-11.8680021323;冈,-12.8488313854;洋,-7.11011085934;渍,-12.3380057616;弗,-12.3380057616;溢,-11.2393934729;紫,-9.59073484734;根,-9.15165312843;攻,-8.81164523697;肾,-12.001533525;屁,-11.644858581;驅,-9.51662687518;範,-7.48910539068;均,-7.52907873809;燈,-9.67077755501;罗,-7.65217767259;鳖,-12.5611493129;轎,-9.757788932;污,-8.37528964185;恩,-9.33232315718;臨,-10.7693898437;魯,-7.63389562775;痰,-12.3380057616;关,-7.03072865367;盲,-10.0354206686;創,-8.47098012209;窃,-9.74275105463;禅,-11.0570719161;圆,-7.50331241732;玉,-11.11423033;岗,-7.36127201917;编,-8.68475348512;宙,-8.59085739935;際,-6.94984769104;喝,-10.5134564695;渠,-9.94011048879;針,-10.1188022775;纫,-9.12716210842;維,-7.69361486245;施,-11.3824943166;萼,-12.8488313854;終,-11.0570719161;哇,-10.2097740557;叉,-7.43569834438;版,-7.35714262583;介,-8.49212255867;苓,-12.1556842048;盛,-10.2338716073;烟,-7.97109276473;习,-7.45672013952;赢,-12.8488313854;蝦,-13.947443674;壯,-9.44763400369;釵,-11.5495484012;预,-10.9029212363;冊,-8.98459904377;貌,-9.95845962746;栏,-9.62995556049;嘛,-9.24696330823;借,-10.5134564695;褥,-10.8119494581;縫,-8.33431556764;宮,-9.07224635082;侶,-13.947443674;覺,-9.55299451935;蒼,-11.0570719161;绀,-12.5611493129;驃,-11.3824943166;卉,-12.5611493129;之,-7.40209401369;泌,-8.08381249843;腕,-10.5462462924;高,-6.28732935485;姚,-10.651606808;铜,-7.85613379195;裤,-10.7285678492;捩,-12.8488313854;幫,-9.71333716943;自,-7.96602946277;顯,-9.40414889175;篮,-10.7693898437;兵,-7.00915919001;开,-8.29145186321;处,-8.7826577001;嘆,-9.60363825217;討,-8.20765076185;暑,-10.8119494581;垛,-11.11423033;咝,-12.8488313854;亡,-8.27756275104;漠,-9.90439240619;氢,-8.92356315318;地,-6.5988561431;玳,-13.947443674;廁,-12.1556842048;嗇,-11.3083863444;材,-6.81494612236;站,-9.74275105463;存,-7.82714625507;矛,-13.2542964935;镜,-9.38309548256;營,-6.39678243092;满,-9.55299451935;你,-12.8488313854;旧,-9.56541703935;择,-8.00202306542;快,-10.5462462924;聪,-12.3380057616;右,-9.22005585531;僵,-12.5611493129;跷,-9.72793596885;歸,-8.54928097251;蟻,-10.5134564695;笃,-12.001533525;隆,-10.2097740557;邊,-8.42598275616;鯨,-11.7502190967;崗,-7.36127201917;纖,-8.56754632048;騙,-9.39356678242;償,-8.72169700031;推,-8.95701108725;樹,-8.40226622955;许,-10.3920956125;愿,-7.5724188542;镇,-9.10325658757;盆,-11.644858581;虑,-11.0030046949;關,-7.03072865367;勞,-8.92356315318;俠,-9.95845962746;正,-8.07251294317;桥,-10.7693898437;扩,-10.6152391638;鑽,-12.8488313854;偵,-13.947443674;起,-8.42199073489;腿,-9.44763400369;挂,-12.1556842048;誇,-12.001533525;氈,-12.1556842048;随,-9.10325658757;抗,-8.17912267823;脖,-11.2393934729;料,-7.33271807382;贞,-11.0030046949;造,-5.78264886978;錢,-8.28101698591;欲,-10.3920956125;侵,-10.3098575143;銷,-6.53588738621;然,-5.35607108443;稼,-8.1333131422;珍,-10.2585642199;盏,-11.7502190967;科,-6.7060773907;苗,-11.644858581;摘,-13.2542964935;话,-7.42388136788;軟,-12.8488313854;凡,-13.947443674;惫,-13.2542964935;罪,-8.33797187884;衰,-8.689948302;泳,-9.10325658757;其,-8.11263293696;痹,-11.644858581;驼,-11.1748549518;绿,-7.38924587121;個,-7.95348224672;鰓,-11.3824943166;引,-6.88610930711;無,-9.3127146858;鎢,-9.8530991118;遇,-10.4817077712;鲨,-13.947443674;循,-8.99868378365;抬,-12.001533525;械,-7.96602946277;麟,-12.001533525;刷,-8.13930118404;頻,-9.68476379698;鸿,-13.947443674;胀,-8.87226985879;视,-6.38788417802;嗎,-13.947443674;寒,-9.39356678242;罕,-12.3380057616;酸,-6.40311156597;衛,-6.57030996119;盤,-5.8141498128;秦,-12.5611493129;景,-7.36680453674;铸,-11.644858581;基,-6.7103846479;巾,-10.9029212363;輪,-7.44615400348;醋,-11.11423033;劍,-12.1556842048;频,-9.68476379698;底,-8.1697913508;键,-8.25035018752;鉛,-10.8564012207;頦,-11.5495484012;鴨,-10.651606808;鸪,-12.3380057616;袱,-13.947443674;椰,-11.0030046949;足,-6.9025385569;甸,-10.2838820279;妻,-8.79994919721;媽,-8.49212255867;笼,-10.0762426631;簾,-9.2560957918;旃,-10.9029212363;泉,-8.68475348512;绕,-12.5611493129;敘,-11.11423033;晚,-11.11423033;迟,-12.3380057616;牢,-11.0030046949;寧,-8.76566012373;絨,-9.51662687518;繪,-11.8680021323;荬,-13.947443674;柯,-12.1556842048;棱,-10.1632540401;轴,-9.22005585531;偶,-10.3639247356;移,-11.4625370242;老,-6.95259368819;构,-6.88696730803;梆,-9.64337858082;消,-8.17600255089;刍,-11.5495484012;堑,-13.947443674;羔,-12.8488313854;貞,-11.0030046949;冠,-10.0354206686;踝,-13.2542964935;脫,-12.1556842048;吹,-10.8119494581;精,-8.35645669351;歇,-8.43401492786;裆,-11.0570719161;汉,-9.30305277488;今,-12.3380057616;牍,-13.2542964935;双,-13.2542964935;姐,-10.689347136;編,-8.68475348512;绪,-8.58615150832;杯,-9.80430894763;蓮,-8.73250791642;闸,-9.41484418087;固,-7.70133690854;导,-5.34922364397;戀,-10.6152391638;辉,-10.5134564695;再,-12.3380057616;咏,-13.947443674;库,-9.21124522563;頂,-8.95023140026;沟,-10.7285678492;伞,-12.1556842048;鏰,-13.947443674;義,-6.38268666112;水,-5.25797926167;傷,-8.28101698591;猶,-12.3380057616;旅,-11.3083863444;蹈,-9.40414889175;坎,-11.5495484012;结,-7.61238942253;饒,-12.5611493129;鏡,-9.38309548256;難,-8.30908900469;襲,-11.1748549518;烷,-11.4625370242;鸳,-12.8488313854;噸,-8.35645669351;技,-6.40152552282;憂,-12.5611493129;載,-9.47010685955;瞎,-11.2393934729;袜,-12.3380057616;氟,-9.2653124469;辞,-9.80430894763;加,-6.53951935147;甥,-9.8530991118;缩,-8.25371153522;悬,-11.0030046949;贵,-11.644858581;碼,-8.94349736808;尿,-6.914819413;晃,-13.947443674;臂,-9.72793596885;故,-11.0570719161;蓄,-8.63917597662;识,-6.60920552396;辣,-10.9029212363;城,-7.66892224986;筑,-6.52327839298;駒,-13.2542964935;絕,-13.2542964935;卡,-8.63917597662;陣,-10.1188022775;瓤,-12.1556842048;顧,-11.3824943166;彩,-9.3127146858;扫,-12.1556842048;賴,-8.41801458651;叶,-6.51023730715;睹,-13.947443674;闺,-11.4625370242;飼,-10.4817077712;争,-6.59756996929;压,-7.26033506616;骑,-10.580147844;鎂,-9.90439240619;純,-10.3920956125;蜘,-11.3824943166;條,-7.52257465012;丞,-8.51372167047;匠,-10.1188022775;唤,-12.3380057616;莫,-11.3083863444;馆,-8.73250791642;薯,-12.3380057616;冷,-9.40414889175;父,-9.17675904956;礼,-8.93680837993;績,-9.43658416751;兌,-13.2542964935;子,-5.15292182224;離,-6.77578685126;輸,-6.98047653541;裝,-7.24671256448;跟,-9.60363825217;哥,-8.581467659;議,-6.60790597862;衲,-10.7285678492;饼,-11.5495484012;幾,-11.8680021323;三,-7.28814975434;倍,-8.73250791642;弓,-11.2393934729;亞,-7.69746843177;暮,-12.8488313854;許,-10.3920956125;状,-7.35439913988;扁,-12.8488313854;权,-6.77348535427;賊,-13.2542964935;里,-6.88439551064;拖,-9.50479241753;據,-6.75150644755;衝,-9.23791347271;滞,-10.1862435583;珠,-8.10680201665;奧,-11.644858581;鹽,-8.61956750524;蛮,-10.4817077712;铺,-11.8680021323;肃,-10.3098575143;權,-6.77348535427;鞍,-11.5495484012;瘌,-12.5611493129;墓,-8.09524119425;暗,-10.5462462924;耘,-12.8488313854;东,-7.6018073132;疡,-10.8119494581;判,-8.00990746894;级,-7.30105315918;鴦,-12.1556842048;芯,-11.11423033;氰,-10.2585642199;漲,-11.8680021323;徽,-13.947443674;社,-6.88183031043;旁,-10.689347136;归,-8.54928097251;保,-6.14196904875;楞,-11.3083863444;句,-12.8488313854;給,-8.34164160773;腮,-12.8488313854;深,-10.7285678492;啶,-13.2542964935;選,-7.7328355756;系,-7.55385292007;幼,-9.19385348292;竿,-11.1748549518;考,-8.44211213809;茅,-10.2838820279;抄,-9.97715176047;万,-8.94349736808;殊,-8.7110017112;圍,-9.71333716943;頓,-10.3098575143;墨,-9.62995556049;宪,-8.76566012373;炸,-7.43867453705;苄,-13.947443674;诊,-8.91049107161;雌,-12.8488313854;野,-8.87226985879;體,-6.63823130833;揚,-11.4625370242;啡,-8.46264674053;遣,-9.78856059067;磨,-8.98459904377;郸,-13.947443674;类,-7.55888226848;穿,-11.3824943166;喋,-12.1556842048;笔,-9.13525931865;林,-7.28814975434;溝,-10.7285678492;羧,-12.8488313854;館,-8.73250791642;本,-4.76694414406;琶,-11.11423033;爺,-8.9707099316;宿,-10.3098575143;砾,-10.2585642199;担,-9.24696330823;豆,-8.28448319389;棉,-9.68476379698;過,-8.15138592326;孔,-9.60363825217;潜,-7.71107408382;員,-5.08227325437;忧,-12.5611493129;壩,-10.7693898437;票,-8.37528964185;走,-8.33431556764;典,-7.93863048858;顾,-11.3824943166;舅,-10.0762426631;榈,-8.46264674053;锋,-7.85613379195;炎,-11.1748549518;少,-7.67268165278;餓,-11.5495484012;箔,-13.947443674;朗,-10.8119494581;洛,-9.13525931865;辜,-11.7502190967;馨,-12.5611493129;蔫,-12.8488313854;蘭,-7.15847193103;茯,-12.3380057616;谱,-8.8475772462;鴻,-13.947443674;帽,-9.61671033374;碾,-12.5611493129;览,-7.30235270452;韌,-11.0030046949;郎,-8.64413876597;赛,-9.09541341011;九,-10.3639247356;軲,-11.8680021323;说,-8.34902171503;银,-7.96855790912;凸,-13.2542964935;勺,-13.2542964935;飾,-8.17289212848;漆,-11.8680021323;閃,-9.41484418087;邏,-9.30305277488;猎,-9.8530991118;徑,-10.5462462924;研,-8.74343698695;脚,-8.31265407086;弦,-8.4140541853;太,-5.69996166974;辱,-10.3639247356;洲,-7.19751248024;鐵,-7.22241003186;麻,-8.08097561709;烏,-11.4625370242;华,-6.19039253199;塔,-10.2097740557;托,-6.96922993139;軛,-10.2838820279;距,-8.28796145827;畢,-13.2542964935;審,-8.86603930904;葬,-8.24033340928;惯,-9.21124522563;濱,-11.8680021323;买,-7.9095727541;瓷,-9.69894843198;靶,-13.947443674;鱼,-9.22894480273;脅,-10.5134564695;悄,-10.4509361126;澆,-10.1862435583;透,-7.79684090558;夕,-12.3380057616;減,-11.3083863444;膚,-8.49212255867;簧,-9.18526973923;骨,-7.34893464541;蔭,-11.3824943166;液,-9.61671033374;匹,-9.69894843198;犸,-10.580147844;崽,-10.0972960723;蛀,-13.947443674;汇,-7.69940079952;哌,-11.8680021323;网,-8.0072724213;著,-10.580147844;坡,-8.80578011752;痢,-11.5495484012;入,-7.70716782885;烤,-11.4625370242;孩,-6.78195019896;蓬,-12.3380057616;息,-6.91835610988;仰,-10.5134564695;極,-6.94165465477;鋸,-10.5462462924;出,-7.45066868384;蚁,-10.5134564695;踪,-11.5495484012;肅,-10.3098575143;誉,-9.03478878829;型,-7.72090700474;斗,-6.5809985257;带,-7.35303021428;窩,-9.12716210842;辆,-10.9029212363;喷,-11.0030046949;銹,-8.80578011752;雞,-9.22894480273;情,-7.55552656063;淇,-10.8564012207;篓,-12.8488313854;鱒,-11.8680021323;进,-7.13290077677;口,-5.87404070504;煤,-9.0570945458;巧,-10.5462462924;嫩,-11.644858581;噶,-10.3365257614;卸,-10.0972960723;翻,-13.947443674;遺,-9.07224635082;范,-7.48910539068;者,-8.63423769498;國,-4.98223687125;名,-7.20574297937;粒,-8.42598275616;莘,-12.001533525;肚,-9.16832018091;語,-7.56901749037;瘡,-12.8488313854;钢,-7.88133558392;紧,-11.4625370242;度,-6.72926683562;斬,-13.947443674;脯,-12.1556842048;榴,-7.92642032468;鼻,-9.38309548256;為,-8.91049107161;浇,-10.1862435583;诈,-11.0030046949;委,-6.40523021083;佛,-8.37909917026;健,-8.18225257124;绦,-11.4625370242;述,-9.51662687518;零,-13.947443674;特,-7.27921542561;司,-6.88696730803;籽,-9.19385348292;祿,-13.947443674;要,-7.12307000398;辅,-11.8680021323;序,-9.09541341011;会,-5.02932901455;羥,-12.8488313854;吨,-8.35645669351;锆,-13.947443674;训,-8.91049107161;螵,-11.8680021323;邻,-11.5495484012;缺,-9.64337858082;甾,-12.8488313854;血,-6.23634242218;蹄,-7.95848225714;拇,-8.34902171503;经,-5.18198514252;胛,-10.689347136;滯,-10.1862435583;聰,-12.3380057616;柵,-10.689347136;奶,-8.39061561233;调,-8.47517300035;麗,-10.3920956125;與,-7.79471097932;撈,-11.0570719161;香,-8.36019501562;吓,-10.8119494581;視,-6.38788417802;芜,-13.947443674;星,-7.72486740595;客,-8.581467659;钨,-9.8530991118;檬,-9.30305277488;踯,-13.947443674;脱,-12.1556842048;暴,-9.29348332387;逻,-9.30305277488;阿,-13.2542964935;疾,-7.66704783506;扇,-13.2542964935;拜,-9.34227348804;號,-8.04754632044;剧,-7.43125059798;湯,-10.580147844;胰,-13.2542964935;菲,-12.8488313854;穷,-9.65698423288;絹,-13.947443674;鋼,-7.88133558392;樂,-6.16547043959;間,-6.91570241526;蠖,-13.947443674;沙,-7.75917955094;业,-3.75345303185;閱,-12.1556842048;侯,-8.21087137655;氮,-9.90439240619;肱,-12.001533525;戲,-9.757788932;冻,-9.47010685955;靡,-12.8488313854;滅,-8.92356315318;轄,-6.97109560358;秋,-10.651606808;屎,-12.8488313854;酐,-12.1556842048;诗,-10.580147844;酥,-12.1556842048;哩,-13.2542964935;腰,-10.1632540401;色,-6.17090864584;篷,-10.3920956125;顶,-8.95023140026;矿,-6.45023645082;鑾,-10.0156180413;式,-8.60510942206;們,-9.42565509698;袖,-10.9029212363;愛,-13.2542964935;亚,-7.69746843177;期,-6.94893403177;邦,-8.52690867475;閨,-11.4625370242;險,-6.43318902121;設,-8.3162318922;伯,-7.54221521599;釉,-11.3083863444;鲛,-10.8564012207;綸,-12.001533525;纺,-7.62847556028;觀,-7.63570886487;俄,-11.7502190967;胆,-10.7285678492;積,-6.23768680957;富,-9.3127146858;勒,-9.27461483956;埔,-12.5611493129;淘,-12.1556842048;滚,-10.7693898437;卧,-12.1556842048;烦,-10.9517114005;盪,-9.95845962746;筷,-12.5611493129;建,-7.06398108761;爐,-10.4210831494;梗,-9.07224635082;丘,-8.29846943586;管,-6.37083390705;夢,-9.35232382389;尤,-12.1556842048;錦,-10.8119494581;貯,-10.5134564695;戰,-6.64967539149;銻,-11.3824943166;紺,-12.5611493129;鞋,-10.6152391638;眾,-8.81164523697;毁,-12.8488313854;荆,-11.7502190967;立,-6.86657577733;蕊,-13.947443674;种,-7.88133558392;塌,-13.947443674;彎,-10.6152391638;兒,-6.92993753108;蓟,-12.8488313854;杞,-9.95845962746;寡,-10.689347136;廣,-10.7285678492;工,-5.30379405866;僧,-12.8488313854;番,-9.28400457991;轮,-7.44615400348;曳,-12.5611493129;磷,-9.62995556049;翹,-12.3380057616;幸,-12.8488313854;檀,-10.3639247356;七,-9.65698423288;暈,-12.8488313854;复,-8.46264674053;小,-6.42072611267;美,-8.79415207953;栗,-12.001533525;戛,-10.0354206686;饮,-9.51662687518;辛,-11.3824943166;骠,-11.3824943166;縣,-9.55299451935;隨,-9.10325658757;喪,-11.7502190967;茱,-10.4509361126;憲,-8.76566012373;弹,-7.65958511386;纸,-8.47938353289;刻,-9.04960387407;炼,-9.41484418087;观,-7.63570886487;賄,-9.42565509698;杉,-9.90439240619;街,-10.1407811843;余,-7.70716782885;淚,-10.7693898437;餘,-7.70716782885;章,-10.689347136;幣,-8.1697913508;革,-7.03072865367;橫,-9.8530991118;業,-3.75345303185;修,-8.5768056459;敵,-11.2393934729;寶,-7.89771021879;较,-9.64337858082;月,-8.13033251406;宋,-12.1556842048;劑,-10.2338716073;优,-9.69894843198;掛,-12.1556842048;鈦,-11.8680021323;在,-6.99567150963;袭,-11.1748549518;花,-6.42342225882;缸,-11.7502190967;去,-10.2097740557;瘾,-11.5495484012;濃,-9.80430894763;资,-3.84322179169;曉,-11.644858581;蝈,-12.5611493129;仙,-8.7826577001;鳥,-9.72793596885;瑪,-10.2097740557;拱,-10.8119494581;柳,-10.9517114005;聲,-7.74490815684;婶,-10.689347136;較,-9.64337858082;刑,-10.0972960723;圓,-7.50331241732;炒,-12.3380057616;挛,-10.8564012207;思,-6.73588694071;膜,-8.89758766678;瘩,-12.3380057616;咪,-13.2542964935;贯,-10.2097740557;医,-7.74896495753;裂,-8.20124048348;蟈,-12.5611493129;筋,-13.947443674;黎,-12.3380057616;量,-7.26533507658;乙,-7.86980143068;履,-11.7502190967;內,-6.195968356;险,-6.43318902121;轿,-9.757788932;祷,-13.947443674;繹,-11.1748549518;獻,-8.45850594787;災,-9.33232315718;图,-8.7826577001;漂,-12.8488313854;龍,-7.71499565747;礎,-8.32704280831;厕,-12.1556842048;枝,-9.42565509698;锦,-10.8119494581;貫,-10.2097740557;匪,-13.947443674;辭,-9.80430894763;測,-7.26283194636;戴,-13.2542964935;康,-9.45880730429;妹,-9.90439240619;钻,-12.8488313854;笺,-11.7502190967;势,-8.75448682313;靠,-8.05856571569;應,-6.28215895555;荊,-11.7502190967;呐,-11.644858581;青,-7.97109276473;仗,-10.5462462924;籠,-10.0762426631;蹬,-13.947443674;旱,-9.14342262929;想,-7.55888226848;矽,-10.3365257614;蘇,-9.60363825217;脉,-8.91049107161;續,-6.39415706842;唑,-11.1748549518;璐,-11.1748549518;渗,-10.4509361126;朝,-9.97715176047;蚜,-13.947443674;戟,-10.3920956125;紡,-7.62847556028;瘧,-12.3380057616;储,-8.15748350313;榮,-9.36247619535;撰,-12.5611493129;耳,-7.79471097932;茵,-13.2542964935;帷,-12.8488313854;夹,-11.11423033;吻,-12.5611493129;熾,-9.43658416751;流,-6.09539346676;賀,-13.947443674;桃,-8.66423994529;菊,-11.11423033;棘,-12.3380057616;鵡,-10.1862435583;兩,-8.54928097251;潭,-12.1556842048;们,-9.42565509698;辩,-9.39356678242;蟲,-7.79684090558;欄,-9.62995556049;肉,-9.27461483956;愈,-11.2393934729;戊,-9.94011048879;蜜,-10.3098575143;窥,-10.2585642199;否,-12.3380057616;亭,-12.3380057616;漬,-12.3380057616;讯,-6.83348756446;德,-9.22005585531;閻,-11.644858581;眼,-7.56224927503;县,-9.55299451935;瀾,-13.947443674;況,-11.0570719161;腈,-11.5495484012;绍,-9.39356678242;彌,-8.61956750524;協,-8.91049107161;俗,-9.2653124469;峡,-9.45880730429;韧,-11.0030046949;佬,-13.2542964935;毯,-11.5495484012;奸,-10.689347136;蜇,-12.1556842048;把,-8.61956750524;碎,-10.3098575143;向,-6.93622968667;室,-10.8119494581;贫,-13.2542964935;努,-13.2542964935;中,-6.63555750995;新,-6.78970818978;舵,-10.8119494581;強,-8.59085739935;鍵,-8.25035018752;窺,-10.2585642199;匿,-12.8488313854;汁,-10.7693898437;评,-9.37273269552;忌,-10.2585642199;筏,-12.001533525;风,-6.82216058251;叔,-10.7285678492;衙,-12.8488313854;櫚,-8.46264674053;柜,-9.29348332387;绢,-13.947443674;篤,-12.001533525;瓦,-8.78838837481;適,-8.34164160773;麦,-9.51662687518;島,-8.05028980639;白,-6.08918949184;鲁,-7.63389562775;莉,-9.2653124469;戈,-11.8680021323;颏,-11.5495484012;冕,-11.5495484012;記,-7.31149711834;萜,-12.8488313854;悟,-13.947443674;玩,-11.7502190967;刨,-12.8488313854;享,-11.7502190967;優,-9.69894843198;容,-7.38924587121;示,-7.43421356311;琼,-12.8488313854;濁,-11.644858581;櫃,-9.29348332387;赂,-10.9517114005;擇,-8.00202306542;腊,-8.06691068762;限,-4.86755373143;燕,-11.7502190967;達,-8.37149457088;蛛,-10.4817077712;楚,-10.7285678492;藝,-6.84989482341;捞,-11.0570719161;豬,-9.97715176047;柱,-8.28796145827;拳,-11.0570719161;呼,-9.10325658757;企,-7.42977240111;涂,-9.52860306623;茉,-11.7502190967;憊,-13.2542964935;辖,-6.97109560358;攝,-11.7502190967;稣,-11.5495484012;颤,-13.947443674;垦,-11.0570719161;猩,-10.2097740557;动,-4.09519678568;丫,-10.1862435583;购,-7.69746843177;阻,-9.18526973923;禺,-13.2542964935;什,-9.45880730429;摇,-13.947443674;蟆,-12.001533525;苈,-12.5611493129;虛,-11.11423033;齡,-8.87226985879;奥,-11.644858581;賬,-10.9517114005;東,-7.6018073132;筹,-7.29329115384;登,-11.5495484012;薇,-12.8488313854;律,-7.82495086451;馏,-10.3365257614;税,-7.29200332366;世,-6.49852757148;舞,-8.51809804507;张,-8.36394736524;辫,-11.3824943166;防,-7.07324517857;咽,-10.9029212363;爾,-7.16072672342;襄,-12.3380057616;拉,-6.26958017335;聊,-12.5611493129;嵌,-10.4817077712;监,-7.77783294153;坐,-9.33232315718;兔,-10.580147844;湖,-8.85369347322;遥,-10.8564012207;蓝,-8.42199073489;臟,-7.8953545051;獨,-10.5462462924;并,-9.35232382389;竹,-9.47010685955;學,-4.16855608972;顺,-13.947443674;丁,-7.7408677473;澀,-13.947443674;沂,-12.8488313854;榄,-8.483611869;舉,-8.23371086852;授,-11.3824943166;對,-6.59756996929;夏,-10.1188022775;熔,-13.2542964935;洗,-9.83656980985;標,-6.82457701543;望,-8.11849805641;感,-7.59481427771;撲,-9.64337858082;纶,-12.001533525;確,-6.67019594739;疼,-11.3083863444;儿,-6.92993753108;賂,-10.9517114005;规,-8.38676204301;蛆,-13.947443674;籍,-10.4509361126;棚,-13.2542964935;翠,-10.9029212363;季,-9.07990922357;秤,-12.001533525;啧,-13.2542964935;致,-8.95023140026;延,-11.5495484012;寸,-12.001533525;戌,-10.9029212363;貓,-12.8488313854;渔,-11.5495484012;疙,-10.689347136;鐘,-11.0570719161;碛,-11.0030046949;撣,-11.4625370242;驚,-12.1556842048;涩,-13.947443674;谨,-12.3380057616;伪,-11.5495484012;厭,-12.5611493129;爬,-11.7502190967;徵,-7.8906596608;机,-6.00082611078;派,-8.49212255867;附,-9.67077755501;竇,-10.3639247356;屈,-13.2542964935;濕,-8.483611869;飛,-8.24700010063;廟,-13.947443674;絞,-9.45880730429;换,-8.59558554055;晤,-9.82030928898;班,-7.23327314412;鉬,-11.4625370242;年,-6.16923219951;滿,-9.55299451935;吃,-9.74275105463;的,-7.37656071169;娇,-13.947443674;羊,-8.9707099316;輕,-6.99758721902;肠,-8.24700010063;蚤,-12.1556842048;洩,-9.69894843198;貨,-6.98330806161;倫,-11.5495484012;犬,-9.06464175144;疮,-12.8488313854;失,-9.17675904956;碰,-12.8488313854;張,-8.36394736524;憶,-8.30199677638;蠻,-10.4817077712;参,-8.34902171503;雄,-8.66932901479;姆,-9.51662687518;恋,-10.6152391638;仔,-9.38309548256;鉗,-12.1556842048;孝,-11.8680021323;惠,-9.11116176707;董,-11.4625370242;注,-8.36394736524;火,-7.13840436798;獭,-12.8488313854;问,-9.02018998887;声,-7.74490815684;米,-7.70327677336;罵,-11.0570719161;黴,-7.89771021879;湿,-8.483611869;喃,-10.8564012207;井,-8.90401855711;演,-8.25035018752;窝,-9.12716210842;羟,-12.8488313854;质,-6.26865467583;醫,-7.74896495753;个,-7.95348224672;选,-7.7328355756;缴,-11.2393934729;获,-9.78856059067;便,-9.67077755501;兀,-11.644858581;剂,-10.2338716073;篇,-7.73885364793;顆,-12.8488313854;拍,-9.37273269552;柏,-13.2542964935;佔,-8.01519848658;受,-8.09811889408;駛,-7.07324517857;胡,-8.72708784895;桦,-11.0030046949;饰,-8.17289212848;绵,-9.8530991118;送,-8.1636184917;鮫,-10.8564012207;阅,-12.1556842048;舍,-9.50479241753;掌,-9.61671033374;喘,-9.95845962746;宜,-10.9517114005;膠,-9.20251154566;攣,-10.8564012207;春,-9.39356678242;欧,-8.22713189742;趨,-13.2542964935;報,-7.25535993152;殼,-8.74343698695;净,-8.42999077756;態,-7.61594182413;才,-10.3365257614;菌,-8.03936073586;杏,-9.8530991118;桑,-10.7693898437;觐,-11.3824943166;浓,-9.80430894763;返,-13.947443674;南,-6.39783450887;痘,-12.5611493129;糞,-10.580147844;淨,-8.42999077756;召,-9.39356678242;哮,-11.7502190967;捷,-11.2393934729;胶,-9.20251154566;笆,-12.8488313854;鸭,-10.651606808;椒,-9.90439240619;趕,-12.5611493129;气,-6.07957218363;化,-5.06297195589;嘘,-11.2393934729;頜,-9.44763400369;粟,-10.580147844;採,-9.04960387407;斥,-11.3824943166;梧,-11.5495484012;劫,-10.2838820279;咯,-12.8488313854;覽,-7.30235270452;格,-7.67834739032;貿,-8.42999077756;鉀,-13.947443674;病,-7.36680453674;鑄,-11.644858581;职,-9.00580125142;蝎,-10.8119494581;詐,-11.0030046949;駝,-11.1748549518;鳟,-11.8680021323;慢,-10.1862435583;藥,-7.45066868384;武,-6.66537001593;浪,-8.37149457088;绳,-12.3380057616;饲,-10.4817077712;櫻,-12.3380057616;槽,-11.11423033;犀,-11.3083863444;锅,-9.18526973923;檐,-12.3380057616;专,-10.689347136;鎖,-8.8475772462;隘,-12.8488313854;喚,-12.3380057616;墜,-10.689347136;從,-10.8564012207;挡,-12.1556842048;别,-8.41010940701;炬,-12.3380057616;鬱,-9.82030928898;帳,-13.947443674;獁,-10.580147844;密,-7.21285201405;手,-6.77578685126;饶,-12.5611493129;背,-9.95845962746;蟎,-11.644858581;角,-6.44857394005;遗,-9.07224635082;静,-8.99868378365;盘,-5.8141498128;荡,-9.95845962746;滨,-11.8680021323;瑯,-11.8680021323;繳,-11.2393934729;鳴,-8.56294861124;妇,-9.51662687518;明,-6.45079123586;输,-6.98047653541;團,-6.73073418732;夜,-9.51662687518;枣,-12.1556842048;撥,-10.3920956125;傭,-9.34227348804;戶,-7.61416404589;携,-12.8488313854;區,-7.45672013952;遂,-12.3380057616;婆,-8.22713189742;彈,-7.65958511386;族,-6.99854645171;虎,-9.04216889559;法,-6.51555175722;赔,-11.4625370242;雙,-13.2542964935;瑚,-7.94355660692;繞,-12.5611493129;热,-6.30491953979;公,-4.25245739607;刁,-12.8488313854;鋁,-11.3824943166;圃,-13.947443674;备,-6.55911581445;銖,-9.757788932;鞘,-12.1556842048;笛,-10.8119494581;肢,-9.36247619535;誦,-12.001533525;温,-8.01519848658;侨,-9.45880730429;錫,-10.3365257614;唯,-8.28101698591;皮,-7.30495687266;娱,-11.8680021323;雲,-8.70569665897;贿,-9.42565509698;僂,-10.1862435583;敏,-8.10100489897;蛎,-13.947443674;绞,-9.45880730429;泪,-10.7693898437;灭,-8.92356315318;飲,-9.51662687518;巴,-7.20692431442;死,-6.33609595662;庇,-13.947443674;融,-6.41054654446;昌,-9.54072442676;窟,-11.3083863444;患,-10.3639247356;接,-8.02051764805;账,-10.9517114005;鞭,-10.1407811843;墳,-13.2542964935;收,-6.42558442182;費,-5.35774379182;調,-8.47517300035;呀,-11.5495484012;靂,-11.8680021323;织,-6.37237197452;擋,-12.1556842048;腎,-12.001533525;豐,-12.1556842048;毕,-13.2542964935;詔,-13.947443674;鲸,-11.7502190967;灘,-11.11423033;神,-6.89385794683;短,-9.74275105463;酮,-10.1407811843;婴,-10.3098575143;泻,-11.8680021323;锁,-8.8475772462;逃,-12.001533525;包,-7.71499565747;酬,-10.9029212363;傘,-12.1556842048;厚,-10.2097740557;缝,-8.33431556764;府,-7.44765663337;妞,-11.8680021323;挥,-6.73588694071;含,-11.3083863444;圭,-11.4625370242;脹,-8.87226985879;伽,-12.8488313854;铀,-13.2542964935;獅,-10.9029212363;鯊,-13.947443674;络,-8.41801458651;牯,-12.8488313854;統,-7.09520110497;峰,-8.39836758913;藶,-12.5611493129;胸,-9.37273269552;銅,-7.85613379195;誕,-9.71333716943;刚,-8.2570842197;报,-7.25535993152;訪,-8.22713189742;銳,-11.644858581;細,-6.4956214375;搶,-11.5495484012;访,-8.22713189742;镀,-10.651606808;燃,-8.05304083976;旋,-7.85161911159;描,-9.82030928898;赐,-13.947443674;察,-6.1493310452;痫,-11.3083863444;干,-7.58786980535;腸,-8.24700010063;艺,-6.84989482341;佼,-9.68476379698;吁,-11.8680021323;皂,-10.689347136;玄,-13.947443674;紛,-11.7502190967;龜,-10.3920956125;增,-9.78856059067;說,-8.34902171503;匯,-7.69940079952;炮,-9.21124522563;就,-9.94011048879;纲,-9.30305277488;丽,-10.3920956125;軋,-11.3083863444;囂,-12.5611493129;胎,-8.98459904377;块,-10.8119494581;遙,-10.8564012207;孟,-11.1748549518;葡,-9.88700066348;无,-9.3127146858;轧,-11.3083863444;畫,-8.28101698591;癭,-13.947443674;杷,-12.5611493129;辨,-8.57216526634;瘀,-11.7502190967;劃,-7.88365846534;内,-6.195968356;缆,-11.11423033;安,-6.53891310713;稈,-12.8488313854;醬,-11.0570719161;辑,-8.16054629266;誓,-12.8488313854;锯,-10.5462462924;圖,-8.7826577001;碟,-12.5611493129;伦,-11.5495484012;献,-8.45850594787;媳,-8.34164160773;破,-7.29587180044;款,-7.5775426912;陀,-8.4140541853;蹠,-11.3824943166;築,-6.52327839298;乐,-6.16547043959;衔,-12.5611493129;叙,-11.11423033;牘,-13.2542964935;川,-10.0972960723;壟,-11.11423033;锐,-11.644858581;敢,-11.8680021323;臥,-12.1556842048;恤,-10.580147844;烯,-8.93680837993;鹰,-11.0570719161;蝶,-9.72793596885;腺,-8.18225257124;刃,-9.68476379698;將,-7.76123505012;休,-9.44763400369;源,-7.3695823163;訓,-8.91049107161;飯,-9.60363825217;縛,-13.947443674;鲜,-8.65917664333;实,-6.98614762811;肤,-8.49212255867;氧,-6.26726803359;侦,-13.947443674;親,-8.89758766678;弱,-9.90439240619;網,-8.0072724213;碴,-12.001533525;架,-8.9707099316;主,-3.94334185146;雀,-9.78856059067;忆,-8.30199677638;等,-7.24917561991;姊,-12.8488313854;潑,-13.2542964935;鵝,-10.3098575143;腥,-10.0156180413;癫,-12.5611493129;铬,-12.1556842048;灯,-9.67077755501;已,-10.4509361126;購,-7.69746843177;桿,-9.38309548256;课,-11.644858581;膏,-9.62995556049;云,-8.70569665897;讓,-8.01519848658;辯,-9.39356678242;疗,-7.96350739334;嘖,-13.2542964935;錘,-9.45880730429;通,-6.09461586174;並,-9.35232382389;垫,-9.72793596885;缰,-12.1556842048;害,-7.53398471686;洼,-10.4509361126;址,-13.2542964935;兄,-8.67958551496;塊,-10.8119494581;操,-9.36247619535;滑,-7.93617649962;棕,-11.0570719161;務,-5.24443503656;啬,-11.3083863444;彰,-11.644858581;奴,-8.46264674053;泽,-8.01519848658;槿,-13.2542964935;阁,-8.5768056459;熄,-11.8680021323;脏,-7.8953545051;沒,-12.1556842048;厘,-12.5611493129;急,-10.7693898437;讨,-8.20765076185;堵,-12.8488313854;速,-6.26357969377;蔷,-12.001533525;船,-8.21087137655;掸,-11.4625370242;輻,-8.581467659;涼,-10.3920956125;运,-6.85403904816;類,-7.55888226848;桕,-12.8488313854;盖,-7.24671256448;竞,-13.947443674;荣,-9.36247619535;詩,-10.580147844;睫,-10.1862435583;敷,-12.1556842048;批,-9.64337858082;胺,-10.5134564695;汽,-7.81839346396;諾,-9.38309548256;待,-7.84265044161;劇,-7.43125059798;喉,-10.4509361126;袋,-9.02018998887;外,-6.93893849194;尘,-9.8530991118;鮮,-8.65917664333;两,-8.54928097251;斩,-13.947443674;萨,-8.45027544873;咳,-11.8680021323;莽,-10.651606808;放,-6.0295430877;私,-8.87226985879;魂,-9.59073484734;翅,-8.59085739935;幄,-12.8488313854;兆,-12.5611493129;痉,-13.2542964935;棋,-11.3824943166;坊,-11.5495484012;母,-7.38358814749;荒,-10.6152391638;祖,-7.48285537034;開,-8.29145186321;罚,-9.22894480273;賣,-7.99420033974;止,-9.14342262929;马,-6.69114643433;噴,-11.0030046949;閘,-9.41484418087;替,-11.644858581;蕾,-9.08763126966;陪,-12.1556842048;切,-9.44763400369;踏,-10.0156180413;涎,-11.3824943166;脑,-8.64912630748;排,-10.8564012207;妖,-10.8119494581;紙,-8.47938353289;銜,-12.5611493129;瘟,-11.8680021323;氣,-6.07957218363;订,-9.17675904956;交,-5.52610080827;鸯,-12.1556842048;费,-5.35774379182;耻,-10.651606808;押,-8.99161661642;蘿,-7.87670594602;籃,-10.7693898437;寂,-12.3380057616;黄,-7.29716462544;片,-8.42199073489;准,-7.8906596608;哈,-8.33431556764;慑,-10.5134564695;蛔,-13.947443674;驗,-6.74701878108;痞,-12.8488313854;棠,-10.8119494581;佥,-10.7693898437;滤,-9.51662687518;硫,-9.65698423288;差,-10.2097740557;史,-6.53528333908;围,-9.71333716943;钉,-12.001533525;見,-7.57071672613;認,-10.7285678492;戒,-9.27461483956;蚕,-9.74275105463;算,-5.79323097911;帚,-11.644858581;吞,-11.5495484012;伤,-8.28101698591;控,-8.8475772462;第,-7.4582387427;焰,-9.41484418087;芽,-9.12716210842;磁,-6.91835610988;構,-6.88696730803;惑,-9.80430894763;腐,-8.5050259635;勝,-6.54134029279;域,-8.03394066839;瑞,-12.5611493129;裡,-6.88439551064;以,-10.0156180413;潤,-6.69255886395;竭,-13.947443674;兰,-7.15847193103;割,-9.72793596885;蹺,-9.72793596885;荼,-12.3380057616;頁,-8.98459904377;帅,-8.77695967899;吉,-10.1632540401;伏,-11.1748549518;憐,-10.3365257614;蔓,-12.001533525;颖,-12.001533525;庚,-11.7502190967;真,-7.79258558001;钞,-10.689347136;校,-7.82276028313;夫,-7.94602879606;弯,-10.6152391638;粮,-7.37936576261;週,-5.70732237595;阵,-10.1188022775;酵,-9.99619995544;嫂,-10.0972960723;囊,-9.34227348804;晕,-12.8488313854;字,-6.42450275595;坟,-13.2542964935;衡,-8.63917597662;旨,-11.3083863444;凰,-12.1556842048;歷,-9.57799582156;板,-7.09625874653;宁,-8.76566012373;稀,-13.947443674;成,-6.47380656553;搔,-13.947443674;碗,-10.1188022775;帘,-9.2560957918;谤,-10.9517114005;馭,-12.5611493129;琴,-8.63917597662;边,-8.42598275616;游,-6.73146867137;芻,-11.5495484012;膽,-10.7285678492;练,-7.99420033974;陈,-10.8564012207;槍,-9.07224635082;行,-4.76787183572;低,-7.6429948716;策,-7.45672013952;忙,-12.001533525;凝,-7.31940229785;代,-6.53287079267;汤,-10.580147844;胧,-13.2542964935;颅,-13.947443674;布,-6.77042490812;霉,-7.89771021879;皈,-12.8488313854;疊,-9.78856059067;爛,-11.4625370242;次,-9.55299451935;誠,-11.0030046949;渣,-11.0030046949;津,-10.5134564695;性,-6.73073418732;薪,-9.88700066348;阳,-6.4196496863;悼,-9.43658416751;驴,-11.2393934729;橋,-10.7693898437;闊,-10.7693898437;迎,-11.8680021323;晓,-11.644858581;塗,-9.52860306623;绘,-11.8680021323;剛,-8.2570842197;線,-6.69751813731;鋒,-7.85613379195;桷,-13.947443674;軸,-9.22005585531;砂,-9.49309637777;約,-7.42682254647;醇,-11.644858581;爆,-9.12716210842;袍,-12.5611493129;怒,-13.947443674;玛,-10.2097740557;尚,-11.7502190967;疟,-12.3380057616;沥,-12.8488313854;霰,-12.3380057616;宫,-9.07224635082;礬,-9.2560957918;鶯,-12.3380057616;縮,-8.25371153522;励,-10.9517114005;肽,-13.947443674;显,-9.40414889175;靈,-9.06464175144;告,-6.94528771962;棍,-9.62995556049;荐,-8.05304083976;染,-6.92457558794;叛,-10.9029212363;俣,-11.3824943166;杨,-9.22005585531;緯,-7.85613379195;狱,-11.7502190967;印,-8.36019501562;石,-6.54804559069;遲,-12.3380057616;虾,-13.947443674;威,-8.24033340928;弃,-9.55299451935;嘉,-12.001533525;蠍,-10.8119494581;贏,-12.8488313854;瀝,-12.8488313854;农,-7.55888226848;生,-5.00642169048;模,-9.82030928898;芦,-10.1862435583;螨,-11.644858581;頭,-6.45190173014;现,-7.67268165278;圳,-12.001533525;吵,-11.644858581;輯,-8.16054629266;丹,-8.85984733879;从,-10.8564012207;扑,-9.64337858082;套,-9.49309637777;翘,-12.3380057616;盞,-11.7502190967;佣,-9.34227348804;台,-7.65033435409;间,-6.91570241526;捻,-13.2542964935;臼,-10.5462462924;饋,-13.947443674;境,-8.79994919721;宅,-8.76566012373;嚇,-10.8119494581;醉,-9.65698423288;侍,-13.2542964935;椎,-9.82030928898;崖,-13.2542964935;領,-8.11556119674;涡,-13.947443674;喱,-13.2542964935;傳,-6.6827134961;核,-8.20444048622;局,-9.14342262929;商,-6.83919953429;半,-7.22481387917;乌,-11.4625370242;錐,-8.96383705232;癜,-9.55299451935;募,-11.8680021323;跡,-13.947443674;池,-9.48153555537;恨,-12.8488313854;端,-10.5134564695;奮,-8.81164523697;鑰,-11.4625370242;鉴,-11.11423033;赶,-12.5611493129;拿,-9.68476379698;腾,-12.001533525;疆,-10.5462462924;鄉,-8.884848641;谋,-7.08155259914;伍,-9.90439240619;撐,-9.49309637777;礙,-8.66423994529;题,-9.04216889559;定,-5.44050285907;障,-7.69746843177;負,-8.56294861124;誤,-12.3380057616;昧,-11.1748549518;薦,-8.05304083976;纬,-7.85613379195;禮,-8.93680837993;唱,-8.29145186321;環,-8.42199073489;郵,-9.47010685955;殺,-9.59073484734;癇,-11.3083863444;煉,-9.41484418087;及,-9.07990922357;軌,-10.2585642199;救,-9.34227348804;捕,-10.6152391638;苔,-13.947443674;坝,-10.7693898437;盜,-10.580147844;衣,-7.35303021428;旦,-10.0762426631;獵,-9.8530991118;诺,-9.38309548256;承,-7.52419671049;岁,-10.0556233759;紀,-7.38641300813;妃,-11.7502190967;理,-4.70125364916;趋,-13.2542964935;躍,-10.0556233759;尖,-8.82944986161;項,-9.22894480273;霜,-13.947443674;没,-12.1556842048;踢,-12.3380057616;航,-7.29200332366;庭,-8.15443006564;钱,-8.28101698591;田,-9.3127146858;决,-7.9215777002;猴,-9.10325658757;樺,-11.0030046949;秃,-13.947443674;呆,-9.68476379698;先,-7.82714625507;淋,-13.947443674;削,-9.12716210842;荔,-11.0570719161;志,-7.96350739334;解,-6.79048730941;续,-6.39415706842;却,-9.80430894763;封,-9.03478878829;纂,-11.1748549518;震,-8.26386390669;倉,-7.59655795731;犊,-11.4625370242;不,-7.55051401881;脓,-9.0570945458;认,-10.7285678492;朧,-13.2542964935;膨,-8.93680837993;席,-7.97873611404;吱,-12.8488313854;寄,-10.2097740557;测,-7.26283194636;題,-9.04216889559;彗,-10.6152391638;糖,-8.14532529865;秘,-9.00580125142;噝,-12.8488313854;象,-6.99950660541;擦,-9.0274627482;繭,-12.3380057616;壮,-9.44763400369;酒,-8.02854981975;觸,-9.92209198329;征,-7.8906596608;事,-4.89586459443;焊,-11.4625370242;娘,-8.58615150832;多,-9.22894480273;澡,-10.7693898437;财,-11.5495484012;庫,-9.21124522563;劳,-8.92356315318;甲,-6.91393718974;况,-11.0570719161;買,-7.9095727541;讹,-12.5611493129;肿,-10.8119494581;滋,-7.70522040857;豌,-12.3380057616;虐,-13.947443674;拓,-9.3127146858;蕒,-13.947443674;联,-6.40258260537;四,-7.6375253958;信,-7.39066531787;菩,-10.8564012207;屬,-7.64849442717;陰,-9.57799582156;側,-13.2542964935;娃,-9.48153555537;餅,-11.5495484012;下,-6.15056333124;熊,-8.54476629215;悔,-10.8119494581;樣,-8.21087137655;芨,-11.644858581;師,-8.15443006564;皰,-10.9029212363;谷,-8.4380553374;謹,-12.3380057616;蔽,-9.32247086074;撼,-11.5495484012;释,-9.09541341011;村,-9.48153555537;蛐,-11.4625370242;打,-9.48153555537;鱗,-10.4817077712;孙,-8.79415207953;瓜,-9.2653124469;拨,-10.3920956125;困,-9.09541341011;闲,-10.2838820279;墅,-11.0030046949;喇,-9.43658416751;例,-9.16832018091;規,-8.38676204301;帖,-12.8488313854;熟,-8.95023140026;传,-6.6827134961;谢,-9.27461483956;斧,-9.90439240619;茨,-13.2542964935;岭,-8.56754632048;種,-7.88133558392;隱,-11.7502190967;債,-7.79471097932;膿,-9.0570945458;层,-8.16054629266;陆,-6.94619805196;午,-8.99161661642;遊,-6.73146867137;惕,-10.3365257614;腔,-9.47010685955;铝,-11.3824943166;畜,-10.3098575143;积,-6.23768680957;醒,-13.2542964935;兴,-9.00580125142;混,-12.8488313854;币,-8.1697913508;铁,-7.22241003186;堅,-10.0156180413;禄,-13.947443674;唇,-10.0556233759;谍,-11.2393934729;析,-6.01149857067;撒,-10.9029212363;耕,-8.72169700031;紗,-8.58615150832;官,-9.17675904956;喜,-9.86990623012;办,-7.6375253958;渡,-8.0046442989;侠,-9.95845962746;貢,-12.1556842048;莨,-11.4625370242;肪,-7.75712826817;鰭,-10.4509361126;綬,-11.644858581;夯,-13.2542964935;窮,-9.65698423288;嘱,-11.644858581;瞰,-12.8488313854;錳,-9.61671033374;贷,-8.16670015823;溶,-7.93128651433;蜻,-11.8680021323;落,-8.23041597262;於,-9.62995556049;繁,-11.644858581;硅,-10.3365257614;集,-7.2236112332;郊,-11.3824943166;跌,-11.4625370242;坛,-12.5611493129;磚,-10.6152391638;乡,-8.884848641;波,-7.87209764294;补,-10.0762426631;灵,-9.06464175144;海,-7.55888226848;件,-8.54476629215;
+M,o:嘁,-3.44664026237;鏗,-5.47478850966;喇,-5.69793206098;嘎,-4.31163769986;嚓,-4.88700184476;咕,-3.75202191192;呼,-3.78838955609;咯,-3.94873220617;嘰,-3.23407882039;喳,-2.65340962325;咿,-3.99318396874;呀,-3.82612988408;拉,-5.69793206098;乒,-4.13978744293;答,-3.99318396874;哗,-3.55786589748;噜,-3.71693059211;裡,-3.3230263064;噠,-7.0842264221;哧,-3.78838955609;啦,-2.23219615818;啪,-2.65340962325;叭,-5.47478850966;轰,-4.13978744293;當,-4.03970398437;嚕,-3.71693059211;叽,-3.23407882039;噼,-3.44664026237;铿,-5.47478850966;丁,-4.88700184476;隆,-2.61831830344;劈,-4.59931977231;咚,-3.86535059723;嘟,-4.88700184476;唧,-5.47478850966;嘩,-3.55786589748;冬,-5.98561413343;吱,-3.25558502561;锵,-5.47478850966;咴,-7.0842264221;儿,-7.0842264221;哈,-2.24794451515;里,-3.3230263064;当,-4.03970398437;哒,-7.0842264221;鏘,-5.47478850966;轟,-4.13978744293;乓,-4.13978744293;叮,-4.44516909248;呱,-6.39107924154;兒,-7.0842264221;滴,-3.99318396874;零,-5.69793206098;
+M,p:之,-2.54944517093;借,-0.081345639454;
+M,q:一,-7.72208711055;分,-9.51384657977;小,-6.62347482188;尔,-5.52486253321;厘,-4.63104465719;攬,-9.51384657977;微,-7.90440866734;士,-9.51384657977;德,-6.94889722231;方,-0.624951910403;格,-8.41523429111;爾,-5.52486253321;千,-1.55842149086;里,-8.41523429111;法,-9.51384657977;式,-6.62347482188;九,-7.72208711055;汞,-7.31662200244;裡,-8.41523429111;瓦,-5.14439872731;八,-7.72208711055;公,-1.52462517096;路,-5.50651339454;英,-5.85028493365;米,-7.31662200244;海,-8.82069939921;揽,-9.51384657977;毫,-6.46932414205;氏,-6.94889722231;
+M,rr:他,0.0;
+M,r:一,-4.18423426076;會,-2.39331266339;門,-5.922191024;個,-4.17922171894;伙,-4.30705509045;会,-2.39331266339;夥,-4.30705509045;个,-4.17922171894;許,-8.09124472437;阵,-8.78439190493;家,-5.52629536691;点,-6.9926324357;许,-8.09124472437;麼,-1.47083824005;什,-0.787065081929;時,-2.39583049938;么,-1.47083824005;陣,-8.78439190493;何,-2.89412986333;他,-3.82154727467;點,-6.9926324357;口,-7.07964381269;早,-5.98103152402;门,-5.922191024;时,-2.39583049938;
+M,s:内,-0.743377450382;块,-5.52637191607;合,-5.78873618054;同,-8.09132127353;后,-4.53597321204;底,-2.93802967903;途,-6.99270898486;脚,-4.03087826298;射,-6.4818833611;地,-4.15949564081;阴,-5.69342600073;所,-5.31873255129;过,-8.09132127353;泉,-4.40244181942;塊,-5.52637191607;低,-4.0482700057;遠,-2.51159144754;形,-5.45226394392;路,-5.45226394392;陰,-5.69342600073;究,-5.31873255129;門,-3.74751585168;後,-4.53597321204;岔,-5.45226394392;北,-3.94818654714;風,-6.4818833611;中,-2.32926989075;落,-6.14541112448;流,-4.53597321204;之,-4.35365165525;郊,-6.2995618043;前,-4.83322473551;风,-6.4818833611;道,-8.09132127353;寒,-5.00027882017;南,-4.53597321204;過,-8.09132127353;远,-2.51159144754;江,-6.4818833611;內,-0.743377450382;门,-3.74751585168;山,-6.99270898486;腳,-4.03087826298;角,-4.59481371206;陵,-8.09132127353;海,-2.79300390698;白,-5.78873618054;西,-4.79548440753;
+M,t:禁,-10.1818387272;境,-7.69693207746;羅,-5.30664140405;那,-4.46810592174;产,-9.08322643858;河,-9.08322643858;宵,-5.47230852593;然,-5.99218398522;放,-4.67650719131;商,-7.34862538319;半,-1.64249273119;经,-7.13731628952;金,-5.70450191277;旱,-8.10239718557;年,-2.88882104747;慶,-4.55062694543;球,-9.48869154669;個,-4.42926608842;二,-4.29296076891;戏,-9.48869154669;頓,-9.48869154669;五,-5.32202632288;際,-8.79554436613;星,-7.09079627389;貨,-9.08322643858;禮,-8.57240081481;割,-9.08322643858;准,-6.29001842914;產,-9.08322643858;孕,-6.81454289726;穗,-8.39007925802;留,-6.13878745941;拜,-6.51827708112;询,-10.1818387272;習,-7.98461414991;旦,-5.76299811945;毒,-10.1818387272;卵,-6.96296290238;时,-4.04844068425;紀,-3.42840080865;樂,-9.48869154669;銅,-7.61688936978;斋,-7.34862538319;上,-6.44416910896;后,-7.13731628952;經,-7.13731628952;戒,-8.79554436613;誕,-5.02854713275;備,-9.48869154669;军,-8.39007925802;业,-8.57240081481;霜,-4.36770819542;个,-4.42926608842;戲,-9.48869154669;冻,-6.15648703651;眼,-5.26185780142;時,-4.04844068425;秋,-5.06384491483;軍,-8.39007925802;動,-6.88600186124;集,-9.48869154669;聖,-10.1818387272;晚,-7.78394345445;孜,-8.79554436613;树,-10.1818387272;詢,-10.1818387272;童,-10.1818387272;全,-8.79554436613;華,-9.08322643858;牲,-7.54278139763;清,-4.58712734764;把,-7.87925363425;不,-4.56871062086;後,-7.13731628952;伏,-5.55686591396;民,-9.08322643858;北,-3.72664016391;初,-5.60712774874;果,-8.57240081481;期,-3.51361047883;春,-5.17120343315;邦,-7.54278139763;纪,-3.42840080865;中,-8.57240081481;瞬,-7.04634451132;新,-5.11924369422;亲,-7.40925000501;阵,-6.00745145735;活,-6.54425256752;人,-6.51827708112;釀,-8.23592857819;元,-1.90799179446;久,-4.38274607279;葉,-10.1818387272;益,-10.1818387272;前,-7.23739974808;罗,-5.30664140405;九,-8.39007925802;古,-5.62796183565;恩,-5.63854394498;八,-8.10239718557;女,-8.57240081481;歷,-8.57240081481;建,-8.79554436613;陽,-5.48135836145;一,-3.34129219796;圆,-9.08322643858;师,-7.78394345445;霎,-6.81454289726;尔,-7.54278139763;化,-6.15648703651;些,-4.75249309829;多,-5.01135473221;娠,-5.10666491201;索,-9.48869154669;冰,-8.10239718557;垩,-8.10239718557;劳,-9.48869154669;水,-5.34555682029;货,-9.08322643858;蹈,-8.79554436613;凍,-6.15648703651;行,-7.04634451132;华,-9.08322643858;乐,-9.48869154669;兒,-4.66037780938;四,-4.10190553215;川,-8.23592857819;习,-7.98461414991;日,-9.08322643858;武,-9.48869154669;器,-4.46810592174;如,-6.26981572182;历,-8.57240081481;有,-7.0037848969;下,-5.54710973902;疊,-4.79276699743;复,-6.62649066576;休,-7.0037848969;易,-6.54425256752;夕,-7.29146696935;际,-8.79554436613;褥,-7.04634451132;性,-7.87925363425;輩,-7.23739974808;动,-6.88600186124;師,-7.78394345445;親,-7.40925000501;阳,-5.48135836145;刻,-4.98334169598;假,-5.01135473221;當,-7.78394345445;铜,-7.61688936978;诞,-5.02854713275;陣,-6.00745145735;刹,-5.16455889043;業,-8.57240081481;息,-6.42063861155;影,-9.48869154669;叶,-10.1818387272;顿,-9.48869154669;梅,-9.08322643858;妇,-8.57240081481;月,-3.9813295532;王,-10.1818387272;堊,-8.10239718557;明,-5.38604818165;世,-3.35855260489;夜,-6.37517623748;务,-10.1818387272;眠,-7.34862538319;炭,-5.63854394498;地,-9.08322643858;头,-9.08322643858;阶,-4.44204581507;礼,-8.57240081481;爾,-7.54278139763;越,-9.08322643858;情,-7.34862538319;午,-5.67097922073;告,-8.10239718557;剎,-5.16455889043;染,-10.1818387272;務,-10.1818387272;存,-7.61688936978;裝,-10.1818387272;婦,-8.57240081481;石,-4.51195780427;整,-6.71610282445;备,-9.48869154669;庆,-4.55062694543;三,-4.04411167316;辈,-7.23739974808;名,-9.08322643858;階,-4.44204581507;丑,-10.1818387272;圓,-9.08322643858;準,-6.29001842914;装,-10.1818387272;醜,-10.1818387272;生,-4.34410828008;圣,-10.1818387272;大,-4.90372406802;利,-10.1818387272;末,-5.01135473221;頭,-9.08322643858;冬,-6.39764909333;辰,-9.48869154669;育,-6.88600186124;樹,-10.1818387272;儿,-4.66037780938;盆,-5.61749053578;齋,-7.34862538319;当,-7.78394345445;勞,-9.48869154669;叠,-4.79276699743;正,-10.1818387272;酿,-8.23592857819;
+M,u:個,0.0;个,0.0;
+M,vi:同,0.0;
+M,vn:极,-6.34541703853;退,-4.33888226766;市,-5.93995193043;处,-5.40443369407;文,-6.07348332305;理,-5.53448682232;合,-6.22763400288;事,-7.50856784834;球,-3.5458517286;規,-4.77420033892;明,-8.01939347211;園,-9.11800576077;底,-9.11800576077;气,-4.03660139579;飽,-9.11800576077;團,-9.11800576077;社,-6.07348332305;业,-2.16146031762;构,-8.42485858021;漠,-7.73171139965;產,-5.48041960105;产,-5.48041960105;田,-9.11800576077;義,-8.42485858021;用,-7.73171139965;等,-5.98251154484;本,-4.13439913907;停,-9.11800576077;熱,-9.11800576077;地,-7.73171139965;害,-7.32624629155;盟,-9.11800576077;制,-5.93995193043;常,-3.92504890988;区,-8.42485858021;國,-5.85990922275;放,-9.11800576077;區,-8.42485858021;心,-8.01939347211;級,-9.11800576077;织,-7.32624629155;案,-6.92078118344;構,-8.42485858021;牌,-7.03856421909;族,-7.03856421909;金,-7.50856784834;子,-5.7858012506;结,-6.92078118344;動,-2.80990731926;織,-7.32624629155;俗,-7.73171139965;热,-9.11800576077;作,-7.73171139965;域,-5.68401855629;代,-1.74840504025;龄,-6.47894843116;型,-7.32624629155;园,-9.11800576077;公,-6.07348332305;格,-6.55305640331;晰,-8.01939347211;想,-8.01939347211;維,-9.11800576077;約,-5.12902171421;年,-5.59164523616;号,-6.81542066778;门,-5.26785815906;酸,-5.38033614249;系,-7.50856784834;眾,-8.01939347211;国,-5.85990922275;鹼,-6.28479241672;范,-4.08105315836;活,-7.17209561172;币,-4.95912267741;門,-5.26785815906;會,-3.78046768107;質,-4.95912267741;列,-8.42485858021;有,-6.28479241672;守,-9.11800576077;下,-7.73171139965;殊,-9.11800576077;轉,-6.28479241672;式,-8.01939347211;转,-6.28479241672;民,-6.07348332305;冒,-8.01939347211;众,-8.01939347211;準,-3.43442599343;级,-9.11800576077;際,-4.95912267741;规,-4.77420033892;模,-6.92078118344;氣,-4.03660139579;会,-3.78046768107;別,-5.40443369407;大,-9.11800576077;度,-7.50856784834;利,-5.311343271;动,-2.80990731926;别,-5.40443369407;视,-6.22763400288;中,-5.89912993591;催,-8.01939347211;單,-8.42485858021;由,-4.76129693408;械,-3.33418057844;电,-7.73171139965;行,-9.11800576077;靜,-6.92078118344;極,-6.34541703853;主,-6.12227348722;立,-5.89912993591;维,-9.11800576077;元,-2.98244086969;處,-5.40443369407;际,-4.95912267741;範,-4.08105315836;朗,-4.85532588373;准,-3.43442599343;义,-8.42485858021;遍,-5.7858012506;富,-9.11800576077;胎,-8.42485858021;体,-2.41236666591;单,-8.42485858021;體,-2.41236666591;字,-4.12757317399;視,-6.22763400288;静,-6.92078118344;付,-8.01939347211;僚,-8.01939347211;電,-7.73171139965;號,-6.81542066778;齡,-6.47894843116;幣,-4.95912267741;团,-9.11800576077;性,-5.50708784813;結,-6.92078118344;能,-5.62149819931;约,-5.12902171421;業,-2.16146031762;息,-3.69305574329;饱,-9.11800576077;困,-9.11800576077;兵,-8.01939347211;滴,-8.01939347211;捷,-7.50856784834;质,-4.95912267741;法,-5.71680837911;出,-2.37985326618;命,-6.34541703853;碱,-6.28479241672;
+M,v:退,-10.3233978251;挂,-10.3233978251;俗,-7.02756095907;谈,-8.93710346396;舌,-7.88105078971;脖,-8.07210602647;洞,-11.0165450056;錢,-11.0165450056;般,-8.2439562834;然,-8.37748767602;方,-7.52003744417;场,-4.18351327285;談,-8.93710346396;齊,-10.3233978251;反,-7.97202256791;科,-11.0165450056;織,-8.8193204283;若,-8.37748767602;廟,-8.45159564817;知,-6.92220044341;扬,-9.63025064452;歲,-9.22478553641;念,-7.72070813963;年,-5.20840251566;拷,-9.07063485658;其,-7.61534762397;闹,-7.25534488994;毽,-8.45159564817;滿,-11.0165450056;吃,-9.63025064452;厂,-7.52003744417;馆,-8.93710346396;個,-8.30849480453;羊,-10.3233978251;輕,-7.04625309208;应,-8.2439562834;列,-6.81185238624;错,-8.53163835585;数,-6.02611241886;密,-10.3233978251;是,-9.63025064452;單,-7.23235537172;失,-5.79618918056;碰,-7.06530128705;恋,-6.47325022337;毒,-7.27887538735;录,-10.3233978251;论,-6.79703730046;衛,-9.63025064452;来,-6.22905326285;浩,-7.79766918077;注,-11.0165450056;火,-11.0165450056;独,-9.63025064452;问,-11.0165450056;维,-7.06530128705;懶,-8.37748767602;基,-8.93710346396;阴,-9.91793271697;堆,-8.45159564817;上,-4.04206609461;后,-8.07210602647;經,-11.0165450056;蒙,-7.68434049546;鉛,-11.0165450056;质,-8.8193204283;个,-8.30849480453;茬,-8.93710346396;足,-5.05039826651;鬼,-8.93710346396;便,-7.97202256791;尾,-7.58255780115;不,-1.59910916677;拍,-9.22478553641;疹,-9.91793271697;潔,-8.8193204283;受,-9.91793271697;聖,-8.8193204283;譜,-9.22478553641;濟,-9.91793271697;胡,-8.2439562834;牢,-6.88941062059;跳,-8.18333166158;轴,-8.93710346396;數,-6.02611241886;态,-8.07210602647;饭,-11.0165450056;舍,-11.0165450056;悖,-8.02081273208;喘,-9.4071070932;宜,-9.4071070932;鬧,-7.25534488994;脫,-10.3233978251;纪,-6.27161287727;爭,-11.0165450056;术,-8.45159564817;悶,-8.07210602647;賴,-6.28915718692;际,-4.73614916668;歇,-11.0165450056;汉,-9.63025064452;克,-8.8193204283;前,-8.93710346396;鐵,-8.93710346396;散,-8.12617324774;绪,-8.71395991264;固,-10.3233978251;使,-9.63025064452;刀,-6.82689026361;而,-7.83849117529;气,-7.27887538735;沟,-9.91793271697;義,-8.93710346396;统,-6.88941062059;圈,-7.0092118204;格,-7.20988251587;结,-6.1112702272;卖,-8.93710346396;鏡,-7.40562709299;日,-10.3233978251;警,-7.18790360915;往,-6.67273958378;技,-9.4071070932;锅,-8.61864973284;标,-10.3233978251;笑,-9.91793271697;岔,-8.53163835585;缘,-7.37895884591;從,-9.4071070932;加,-6.01933273187;缩,-7.97202256791;别,-6.14901055518;稻,-10.3233978251;十,-11.0165450056;识,-9.4071070932;轉,-8.12617324774;手,-6.95610199509;免,-9.63025064452;背,-10.3233978251;角,-8.93710346396;絕,-10.3233978251;风,-6.92220044341;補,-7.83849117529;江,-7.32766555152;荡,-6.67273958378;扫,-8.8193204283;平,-8.07210602647;绿,-8.93710346396;好,-11.0165450056;鱿,-9.22478553641;争,-11.0165450056;球,-9.91793271697;明,-7.30297293893;骑,-11.0165450056;掂,-8.93710346396;團,-7.64924917565;條,-9.4071070932;趟,-11.0165450056;攤,-8.12617324774;斯,-9.4071070932;冷,-7.43302606718;制,-5.5400814537;礼,-8.61864973284;举,-9.91793271697;勁,-9.91793271697;象,-7.23235537172;铅,-11.0165450056;彈,-7.72070813963;鎖,-9.07063485658;族,-7.32766555152;虎,-9.22478553641;子,-6.05370037538;法,-6.50568549912;毛,-8.30849480453;裝,-9.07063485658;跟,-7.97202256791;秧,-9.4071070932;試,-7.0092118204;热,-5.88074656859;公,-8.61864973284;盹,-8.45159564817;會,-11.0165450056;薄,-9.63025064452;區,-9.07063485658;三,-11.0165450056;階,-9.91793271697;桂,-10.3233978251;趔,-9.07063485658;亞,-5.99266448479;圣,-8.8193204283;营,-7.49018448102;大,-5.51937678034;冬,-9.63025064452;支,-7.20988251587;皮,-9.07063485658;记,-9.4071070932;贿,-11.0165450056;烂,-9.91793271697;义,-8.93710346396;鍋,-8.61864973284;糊,-7.49018448102;遍,-10.3233978251;畏,-7.97202256791;当,-3.5221147906;展,-11.0165450056;藏,-8.71395991264;筛,-11.0165450056;據,-8.8193204283;衝,-9.91793271697;點,-3.82060777916;卫,-9.63025064452;質,-8.8193204283;灭,-8.53163835585;巴,-7.83849117529;具,-11.0165450056;死,-7.97202256791;擺,-6.9734937378;瞪,-8.53163835585;写,-9.91793271697;产,-7.58255780115;械,-5.07637375292;铁,-8.93710346396;嚷,-7.46119694415;治,-7.64924917565;区,-9.07063485658;調,-7.20988251587;社,-9.22478553641;胃,-9.4071070932;杂,-6.76804976359;织,-8.8193204283;跑,-9.4071070932;豐,-9.63025064452;试,-7.0092118204;神,-9.91793271697;面,-6.93900756173;短,-8.12617324774;當,-3.5221147906;锁,-9.07063485658;殊,-8.2439562834;戏,-7.92550255228;酬,-11.0165450056;檔,-9.63025064452;缝,-8.45159564817;天,-6.08929132048;風,-6.92220044341;武,-10.3233978251;運,-6.37215410649;雌,-9.07063485658;術,-8.45159564817;體,-6.41137481965;揚,-9.63025064452;络,-7.25534488994;機,-7.97202256791;統,-6.88941062059;掩,-7.35298335951;时,-8.30849480453;腹,-7.72070813963;錄,-10.3233978251;開,-7.18790360915;林,-10.3233978251;搖,-4.07632253652;溝,-9.91793271697;顛,-11.0165450056;善,-9.4071070932;館,-8.93710346396;横,-8.8193204283;細,-6.64709715317;点,-3.82060777916;刺,-9.22478553641;似,-10.3233978251;破,-8.45159564817;品,-6.90567114146;時,-8.30849480453;体,-6.41137481965;过,-6.79703730046;豆,-8.45159564817;過,-6.79703730046;結,-6.1112702272;答,-9.4071070932;绝,-10.3233978251;作,-6.45219681417;塞,-9.63025064452;拥,-7.83849117529;牧,-11.0165450056;可,-7.27887538735;遮,-7.61534762397;走,-7.32766555152;份,-8.71395991264;門,-7.64924917565;厄,-9.91793271697;锋,-11.0165450056;瞌,-7.14534399473;民,-6.81185238624;搡,-8.45159564817;別,-6.14901055518;說,-5.68866883685;錯,-8.53163835585;谱,-9.22478553641;躲,-8.71395991264;活,-6.65983617895;帽,-8.8193204283;黴,-9.07063485658;元,-8.37748767602;降,-10.3233978251;郎,-10.3233978251;比,-8.07210602647;釘,-9.07063485658;葡,-9.22478553641;慣,-5.97311988872;团,-7.64924917565;畫,-9.22478553641;女,-10.3233978251;说,-5.68866883685;极,-8.93710346396;劃,-8.37748767602;計,-7.97202256791;養,-8.18333166158;同,-9.07063485658;谜,-11.0165450056;瘠,-9.91793271697;產,-7.58255780115;太,-6.5279086359;断,-9.91793271697;听,-8.93710346396;献,-8.12617324774;丰,-9.63025064452;場,-4.18351327285;券,-5.88664629071;麻,-9.4071070932;勃,-9.91793271697;乐,-8.45159564817;托,-6.1112702272;敢,-11.0165450056;臥,-9.4071070932;篩,-11.0165450056;闭,-11.0165450056;惯,-5.97311988872;据,-8.8193204283;省,-7.46119694415;來,-6.22905326285;休,-7.06530128705;源,-4.57719463454;飯,-11.0165450056;搗,-8.53163835585;折,-6.79703730046;骨,-8.93710346396;咬,-6.88941062059;鎮,-4.76079496388;網,-8.71395991264;碴,-11.0165450056;架,-9.4071070932;主,-6.47325022337;充,-9.91793271697;等,-9.22478553641;网,-8.71395991264;緒,-8.71395991264;問,-11.0165450056;著,-6.39157219235;条,-9.4071070932;因,-6.55063688698;入,-11.0165450056;孩,-9.91793271697;擬,-10.3233978251;聯,-9.63025064452;影,-8.8193204283;極,-8.93710346396;出,-5.68382621237;泼,-9.91793271697;需,-8.71395991264;掃,-8.8193204283;型,-6.1112702272;斗,-11.0165450056;琢,-11.0165450056;害,-8.8193204283;头,-7.23235537172;斷,-9.91793271697;阶,-9.91793271697;抹,-9.22478553641;杀,-8.71395991264;情,-9.22478553641;埋,-9.4071070932;水,-9.63025064452;量,-6.39157219235;麦,-9.63025064452;齐,-10.3233978251;磕,-8.30849480453;进,-6.43157752697;做,-5.83476145534;詞,-10.3233978251;靠,-8.8193204283;口,-7.25534488994;蹦,-8.37748767602;國,-7.40562709299;漏,-9.22478553641;了,-7.37895884591;朋,-8.45159564817;損,-7.61534762397;意,-5.42183362603;沒,-3.76024776595;肚,-7.35298335951;語,-8.71395991264;度,-6.60982575837;鼻,-7.58255780115;秋,-7.97202256791;擂,-8.93710346396;细,-6.64709715317;运,-6.37215410649;敗,-7.79766918077;变,-8.53163835585;捣,-8.53163835585;乱,-7.92550255228;長,-8.61864973284;零,-8.61864973284;司,-8.71395991264;轻,-7.04625309208;闷,-8.07210602647;縫,-8.45159564817;西,-9.07063485658;禁,-9.22478553641;劇,-7.61534762397;儆,-9.4071070932;閉,-11.0165450056;合,-7.83849117529;軟,-9.91793271697;序,-6.57389374915;外,-6.62209585096;会,-11.0165450056;欢,-7.32766555152;两,-10.3233978251;熱,-5.88074656859;嘴,-11.0165450056;放,-9.22478553641;见,-5.52760727948;必,-6.15673260127;勇,-11.0165450056;词,-10.3233978251;经,-11.0165450056;济,-9.91793271697;啞,-9.63025064452;賣,-8.93710346396;腦,-6.68581166535;语,-8.71395991264;马,-7.37895884591;噴,-6.79703730046;调,-7.20988251587;针,-8.07210602647;脑,-6.68581166535;排,-9.63025064452;紙,-8.45159564817;餡,-11.0165450056;颠,-11.0165450056;氣,-7.27887538735;交,-5.3535845255;枪,-11.0165450056;涮,-9.91793271697;脱,-10.3233978251;證,-7.08471937291;费,-11.0165450056;貸,-10.3233978251;黄,-9.63025064452;片,-11.0165450056;准,-6.18026309868;哈,-7.72070813963;潑,-9.91793271697;级,-8.61864973284;剧,-7.61534762397;味,-2.89833795623;直,-11.0165450056;老,-5.97311988872;樂,-8.45159564817;钉,-9.07063485658;見,-5.52760727948;認,-6.78243850104;間,-9.4071070932;划,-8.37748767602;算,-7.64924917565;军,-9.22478553641;业,-4.99067903181;阄,-11.0165450056;趣,-8.2439562834;麥,-9.63025064452;用,-7.12472470753;戲,-7.92550255228;殷,-7.49018448102;吾,-7.20988251587;滅,-8.53163835585;效,-9.63025064452;始,-7.23235537172;腐,-8.2439562834;嗓,-11.0165450056;伏,-8.02081273208;費,-11.0165450056;域,-9.07063485658;緣,-7.37895884591;滥,-10.3233978251;腰,-8.02081273208;色,-8.30849480453;龄,-6.38181601741;指,-7.18790360915;式,-6.04673170606;憐,-7.02756095907;息,-5.07374563051;亚,-5.99266448479;土,-7.18790360915;群,-9.22478553641;弯,-7.43302606718;劲,-9.91793271697;期,-6.82689026361;人,-6.29804613434;久,-8.45159564817;益,-4.86168691162;富,-10.3233978251;住,-6.62209585096;鋒,-11.0165450056;處,-6.01933273187;字,-6.87341027924;菜,-11.0165450056;衡,-10.3233978251;卧,-9.4071070932;门,-7.64924917565;盪,-6.67273958378;软,-9.91793271697;魷,-9.22478553641;养,-8.18333166158;板,-9.63025064452;稀,-8.30849480453;射,-8.61864973284;成,-6.72608556449;力,-11.0165450056;級,-8.61864973284;怜,-7.02756095907;计,-7.97202256791;边,-6.49475642859;游,-7.32766555152;值,-8.8193204283;眾,-6.95610199509;证,-7.08471937291;黃,-9.63025064452;立,-11.0165450056;种,-11.0165450056;行,-6.11870520568;彎,-7.43302606718;发,-9.4071070932;形,-10.3233978251;招,-5.60489895378;針,-8.07210602647;停,-5.60937323418;代,-7.20988251587;工,-8.02081273208;層,-9.4071070932;器,-8.8193204283;潮,-10.3233978251;机,-7.97202256791;如,-8.45159564817;眉,-6.28915718692;程,-9.22478553641;复,-8.12617324774;小,-6.28034655724;挑,-8.2439562834;殖,-7.97202256791;伙,-10.3233978251;爛,-9.91793271697;次,-4.13616092345;败,-7.79766918077;性,-5.13601201924;辮,-9.07063485658;冲,-9.91793271697;电,-4.33193327797;样,-4.72312572679;家,-7.75844846761;弹,-7.72070813963;纸,-8.45159564817;態,-8.07210602647;賄,-11.0165450056;懒,-8.37748767602;牛,-7.37895884591;歡,-7.32766555152;革,-7.72070813963;橫,-8.8193204283;業,-4.99067903181;修,-8.61864973284;衷,-6.06778511526;軸,-8.93710346396;跺,-8.71395991264;約,-9.4071070932;分,-7.58255780115;月,-6.68581166535;碍,-8.8193204283;酒,-8.71395991264;倒,-10.3233978251;庙,-8.45159564817;优,-5.04528316585;掛,-10.3233978251;尚,-9.22478553641;贤,-9.63025064452;地,-6.47325022337;在,-5.41442618476;宫,-7.43302606718;縮,-7.97202256791;進,-6.43157752697;尺,-9.63025064452;显,-10.3233978251;心,-8.53163835585;變,-8.53163835585;喷,-6.79703730046;摊,-8.12617324774;寫,-9.91793271697;決,-5.04783744565;能,-5.72827797494;雪,-8.53163835585;趄,-9.07063485658;着,-6.39157219235;圓,-11.0165450056;层,-9.4071070932;猛,-9.91793271697;生,-4.18675126812;模,-6.57389374915;愧,-6.78243850104;頭,-7.23235537172;馬,-7.37895884591;现,-9.91793271697;吵,-6.92220044341;政,-10.3233978251;婁,-9.22478553641;遊,-7.32766555152;拆,-8.8193204283;从,-9.4071070932;套,-11.0165450056;論,-6.79703730046;雞,-9.4071070932;黑,-8.53163835585;飢,-8.61864973284;苦,-9.22478553641;台,-10.3233978251;呵,-9.07063485658;间,-9.4071070932;獻,-8.12617324774;聽,-8.93710346396;长,-8.61864973284;境,-7.88105078971;异,-5.93514064065;娄,-9.22478553641;戀,-6.47325022337;功,-6.31606463984;由,-8.2439562834;漢,-9.63025064452;沫,-6.84215773574;露,-11.0165450056;核,-7.64924917565;脾,-6.17235791918;蛇,-11.0165450056;應,-8.2439562834;半,-8.93710346396;赖,-6.28915718692;願,-7.27887538735;拟,-10.3233978251;罢,-7.64924917565;端,-8.93710346396;旱,-9.07063485658;想,-7.37895884591;鉴,-8.71395991264;發,-9.4071070932;洁,-8.8193204283;礙,-8.8193204283;君,-10.3233978251;定,-6.90567114146;鬥,-11.0165450056;誤,-10.3233978251;禮,-8.61864973284;唱,-11.0165450056;殺,-8.71395991264;流,-8.71395991264;嗷,-7.97202256791;光,-8.61864973284;及,-9.63025064452;道,-9.91793271697;单,-7.23235537172;飘,-9.63025064452;雜,-6.76804976359;絡,-7.25534488994;档,-9.63025064452;步,-8.8193204283;兩,-10.3233978251;部,-9.07063485658;只,-11.0165450056;承,-10.3233978251;岁,-9.22478553641;紀,-6.27161287727;市,-4.79198657636;理,-7.75844846761;锐,-7.40562709299;得,-3.61531374122;原,-7.79766918077;没,-3.76024776595;否,-6.46266811404;庭,-9.4071070932;漬,-7.25534488994;钱,-11.0165450056;决,-5.04783744565;猴,-11.0165450056;德,-11.0165450056;眼,-5.69842501179;倾,-4.6832653775;摆,-6.9734937378;軍,-9.22478553641;哑,-9.63025064452;動,-5.59159498815;志,-7.64924917565;常,-8.18333166158;解,-9.91793271697;转,-8.12617324774;误,-10.3233978251;确,-8.37748767602;異,-5.93514064065;粒,-10.3233978251;空,-6.11870520568;国,-7.40562709299;亂,-7.92550255228;震,-9.22478553641;洋,-8.45159564817;把,-6.38181601741;渍,-7.25534488994;後,-8.07210602647;众,-6.95610199509;綠,-8.93710346396;认,-6.78243850104;中,-8.37748767602;根,-8.02081273208;画,-9.22478553641;傾,-4.6832653775;屁,-9.91793271697;均,-6.49475642859;哆,-7.79766918077;槍,-11.0165450056;霉,-9.07063485658;桌,-6.84215773574;鑑,-8.71395991264;秘,-7.72070813963;损,-7.61534762397;污,-8.71395991264;约,-9.4071070932;壮,-11.0165450056;关,-8.30849480453;兒,-9.63025064452;罷,-7.64924917565;白,-9.22478553641;一,-6.30701480432;馅,-11.0165450056;圆,-11.0165450056;事,-6.27161287727;謎,-11.0165450056;記,-9.4071070932;際,-4.73614916668;玩,-5.00773182019;身,-10.3233978251;優,-5.04528316585;維,-7.06530128705;鬮,-11.0165450056;銳,-7.40562709299;容,-9.91793271697;施,-9.4071070932;限,-9.4071070932;联,-9.63025064452;嗝,-10.3233978251;学,-6.87341027924;壯,-11.0165450056;陰,-9.91793271697;儿,-9.63025064452;对,-7.61534762397;電,-4.33193327797;呼,-8.12617324774;下,-4.72682943473;閒,-8.45159564817;速,-9.4071070932;樣,-4.72312572679;夥,-10.3233978251;动,-5.59159498815;丫,-8.61864973284;宮,-7.43302606718;戳,-9.91793271697;蔽,-11.0165450056;什,-4.28791639255;飄,-9.63025064452;摇,-4.07632253652;之,-4.2831431138;打,-7.64924917565;腕,-11.0165450056;高,-8.30849480453;齡,-6.38181601741;廠,-7.52003744417;饥,-8.61864973284;自,-7.72070813963;顯,-10.3233978251;困,-8.53163835585;闲,-8.45159564817;兵,-6.67273958378;避,-9.63025064452;現,-9.91793271697;开,-7.18790360915;处,-6.01933273187;文,-6.73987888662;律,-8.45159564817;規,-9.91793271697;騎,-11.0165450056;世,-7.88105078971;漠,-6.65983617895;助,-3.78598185223;辫,-9.07063485658;怪,-8.8193204283;種,-11.0165450056;有,-5.74354544707;求,-7.97202256791;装,-9.07063485658;聊,-8.53163835585;識,-9.4071070932;镜,-7.40562709299;營,-7.49018448102;满,-11.0165450056;獨,-9.63025064452;濫,-10.3233978251;蹶,-9.22478553641;竹,-8.8193204283;學,-6.87341027924;擁,-7.83849117529;唇,-9.63025064452;舉,-9.91793271697;邊,-6.49475642859;對,-7.61534762397;蘑,-11.0165450056;洗,-9.4071070932;準,-6.18026309868;標,-10.3233978251;官,-6.59770439784;喜,-8.93710346396;感,-7.88105078971;鸡,-9.4071070932;利,-2.94345380594;推,-8.45159564817;贷,-10.3233978251;確,-8.37748767602;落,-8.8193204283;愿,-7.27887538735;规,-9.91793271697;镇,-4.76079496388;看,-8.2439562834;關,-8.30849480453;賢,-9.63025064452;补,-7.83849117529;致,-7.55080910284;起,-4.86594223719;命,-7.68434049546;腿,-9.91793271697;魔,-8.53163835585;
+M,y:呀,0.0;
+M,z:漂,-7.94355684594;皇,-9.64830493817;稀,-6.18256903538;合,-8.95515775761;咋,-8.26201057706;融,-7.45108036084;渌,-8.1442275414;纏,-9.24283983007;斑,-7.50823877468;轻,-3.64318406462;外,-10.3414521187;疙,-7.29692968101;顺,-7.34571984518;微,-5.95942548406;枝,-9.64830493817;娜,-7.77650276127;重,-4.81999120087;洞,-5.91063531989;脱,-7.00924760856;欢,-7.39701313957;膩,-7.50823877468;长,-3.84921228371;圆,-5.58786192763;孜,-7.29692968101;熱,-5.8416424484;阴,-8.54969264951;嚷,-7.34571984518;洶,-8.39554196968;方,-6.13675949934;簸,-8.95515775761;傻,-9.24283983007;强,-7.50823877468;宽,-7.39701313957;邋,-8.54969264951;駁,-8.39554196968;胡,-7.94355684594;杂,-7.63340191763;縷,-7.16339828839;絆,-8.03886702574;凉,-7.94355684594;默,-3.79466670797;半,-8.26201057706;乌,-7.39701313957;苏,-10.3414521187;煎,-8.26201057706;凑,-8.95515775761;壓,-5.57927818394;青,-7.94355684594;濕,-7.77650276127;随,-6.10734561414;飘,-5.852815749;绉,-6.97415628875;彤,-6.94025473707;凡,-9.24283983007;疑,-6.26391467483;醺,-7.08335558071;啦,-8.95515775761;緩,-7.70239478912;赫,-8.03886702574;高,-4.49212733879;歪,-5.83059261222;短,-5.04814729401;扬,-9.64830493817;盯,-8.1442275414;兮,-6.65257266462;深,-7.94355684594;洒,-8.1442275414;噴,-6.23057825456;绷,-7.77650276127;當,-5.87554400008;闹,-6.24710755651;摸,-7.77650276127;磨,-6.94025473707;忽,-6.15179737671;滿,-5.31757159789;气,-6.2984008509;茵,-8.39554196968;顫,-6.97415628875;窄,-7.00924760856;切,-6.28100910819;沈,-4.82399922227;服,-6.42942911331;繃,-7.77650276127;昏,-6.09295687669;香,-7.34571984518;缕,-7.16339828839;葱,-10.3414521187;妖,-8.7320142063;粘,-10.3414521187;彎,-5.55396037595;厚,-4.71024033691;匝,-7.04561525273;溜,-5.07876192983;嘟,-6.84494455727;飄,-5.852815749;悠,-5.21155340381;氣,-6.2984008509;客,-6.58025200304;缥,-10.3414521187;瘟,-9.64830493817;润,-10.3414521187;里,-4.85665518524;含,-6.62788005203;瞪,-7.25040966538;跳,-8.54969264951;單,-6.316100428;失,-6.94025473707;癲,-7.25040966538;張,-5.8416424484;嚴,-5.852815749;刷,-6.10734561414;紧,-8.7320142063;脹,-9.24283983007;穩,-6.06478599972;艳,-6.90746491425;整,-5.27885708571;流,-8.39554196968;胀,-9.24283983007;酸,-7.08335558071;混,-9.24283983007;片,-6.73053420609;光,-7.77650276127;哈,-6.06478599972;神,-7.39701313957;隱,-5.1709681237;莽,-8.1442275414;浑,-7.45108036084;道,-8.95515775761;忒,-9.64830493817;单,-6.316100428;仔,-7.12257629387;嗖,-8.54969264951;烘,-5.81966354169;顛,-7.34571984518;揚,-9.64830493817;雜,-7.63340191763;癟,-8.95515775761;擠,-9.64830493817;黄,-7.50823877468;叢,-9.64830493817;来,-5.94700296406;勤,-7.5688633965;燦,-6.3341189335;颠,-7.34571984518;哨,-8.95515775761;火,-6.58025200304;声,-8.03886702574;恳,-7.5688633965;罵,-6.75793318028;滴,-6.90746491425;婷,-8.03886702574;时,-7.63340191763;裸,-5.78757522713;诺,-8.03886702574;白,-4.61786701678;湿,-7.77650276127;囔,-7.08335558071;岌,-10.3414521187;老,-5.4361773403;閃,-5.63192191742;昂,-6.60378250045;嚅,-8.7320142063;著,-8.95515775761;瞇,-5.48163971437;順,-7.34571984518;沉,-4.82399922227;開,-9.24283983007;認,-7.04561525273;嬌,-10.3414521187;裊,-7.77650276127;黢,-7.63340191763;郁,-7.50823877468;裡,-4.85665518524;舒,-6.75793318028;底,-10.3414521187;然,-10.3414521187;搖,-5.39980969613;蒙,-6.03738702553;驳,-8.39554196968;虛,-7.5688633965;吞,-5.94700296406;贴,-10.3414521187;唠,-7.20595790281;睦,-8.95515775761;挤,-9.64830493817;墩,-7.63340191763;鬧,-6.24710755651;瘪,-8.95515775761;本,-9.64830493817;蓊,-10.3414521187;細,-4.79237603384;虚,-7.5688633965;朴,-9.24283983007;油,-6.44963182062;甸,-5.88710482248;惨,-7.5688633965;抽,-8.1442275414;便,-6.10734561414;烁,-7.08335558071;歡,-7.39701313957;秃,-6.28100910819;時,-7.63340191763;康,-8.39554196968;颼,-7.12257629387;呆,-4.81999120087;爍,-7.08335558071;淋,-4.97081409061;湊,-8.95515775761;苍,-6.81509159412;徹,-10.3414521187;答,-7.12257629387;樸,-9.24283983007;糙,-9.24283983007;慘,-7.5688633965;痛,-6.23057825456;煦,-9.24283983007;連,-8.03886702574;咻,-7.29692968101;迟,-6.26391467483;絨,-9.64830493817;惡,-8.95515775761;艷,-6.90746491425;秘,-7.04561525273;幢,-9.24283983007;孤,-7.77650276127;哩,-8.95515775761;全,-6.87571621594;嗫,-8.7320142063;详,-7.77650276127;节,-9.64830493817;缓,-7.70239478912;漆,-6.01071877845;干,-4.8649885668;绵,-6.40962648601;迷,-5.537431074;恶,-8.95515775761;浸,-9.64830493817;空,-7.94355684594;豫,-6.97415628875;涔,-10.3414521187;吁,-6.90746491425;亂,-8.7320142063;清,-4.14094294469;澄,-6.97415628875;梆,-8.26201057706;猶,-6.97415628875;洋,-5.30449951632;抖,-7.16339828839;不,-7.39701313957;完,-6.78610405725;碎,-7.50823877468;少,-10.3414521187;憐,-6.15179737671;朗,-8.7320142063;喘,-8.7320142063;愛,-8.26201057706;皚,-8.95515775761;丝,-6.47025110783;紛,-6.28100910819;土,-8.26201057706;撞,-5.852815749;簡,-6.78610405725;綠,-5.66862328427;愣,-7.04561525273;红,-5.68749176858;严,-5.852815749;认,-7.04561525273;朧,-6.3341189335;潤,-10.3414521187;栩,-9.64830493817;憨,-9.24283983007;脫,-7.00924760856;木,-8.54969264951;弯,-5.55396037595;斜,-6.44963182062;冰,-5.98474329205;亲,-6.70386595901;閒,-10.3414521187;真,-6.37116020518;強,-7.50823877468;悶,-6.90746491425;滾,-7.39701313957;皺,-8.95515775761;爽,-7.77650276127;直,-5.78757522713;净,-4.84839067539;面,-8.1442275414;穷,-6.05099267759;潇,-9.24283983007;哆,-10.3414521187;藍,-8.39554196968;囊,-7.12257629387;坏,-10.3414521187;蹌,-6.09295687669;灑,-8.1442275414;浓,-6.06478599972;绒,-9.64830493817;晕,-7.85654546895;柔,-8.39554196968;靜,-4.01351533501;胖,-5.98474329205;別,-7.94355684594;坎,-8.54969264951;远,-4.63766964408;轟,-7.94355684594;壞,-10.3414521187;碌,-6.12194441356;薄,-5.31757159789;散,-8.1442275414;团,-8.95515775761;古,-7.85654546895;爛,-6.58025200304;恩,-8.26201057706;懨,-8.7320142063;八,-9.24283983007;盪,-5.2662783035;扭,-6.3341189335;寬,-7.39701313957;森,-6.05099267759;呱,-7.63340191763;嘩,-7.34571984518;赳,-7.25040966538;曲,-5.68749176858;暖,-4.98959398526;坷,-8.54969264951;惶,-7.85654546895;恹,-8.7320142063;腻,-7.50823877468;幽,-7.16339828839;蔫,-10.3414521187;板,-9.24283983007;糾,-7.94355684594;嘀,-7.45108036084;扎,-6.81509159412;匆,-5.81966354169;安,-5.55396037595;嘈,-8.1442275414;頭,-7.94355684594;簌,-6.81509159412;縐,-6.97415628875;樂,-8.7320142063;怔,-8.7320142063;嘘,-8.54969264951;多,-7.50823877468;而,-9.24283983007;怜,-6.15179737671;約,-5.27885708571;體,-8.1442275414;索,-7.25040966538;妥,-8.39554196968;咧,-5.65010423651;朦,-6.3341189335;袅,-7.77650276127;溫,-7.45108036084;太,-8.26201057706;骂,-6.75793318028;騰,-5.4361773403;撲,-6.65257266462;破,-6.58025200304;伶,-8.95515775761;容,-8.1442275414;常,-6.97415628875;麻,-5.05318508804;楞,-9.64830493817;綽,-10.3414521187;鼓,-5.91063531989;淡,-4.4721552056;勃,-7.85654546895;楂,-10.3414521187;淅,-8.26201057706;遠,-4.63766964408;热,-5.8416424484;滋,-6.10734561414;巍,-5.89880086224;塌,-8.1442275414;烏,-7.39701313957;低,-6.24710755651;乐,-8.7320142063;结,-5.24158569091;慢,-7.70239478912;規,-6.44963182062;哗,-7.34571984518;忙,-4.77693171141;淥,-8.1442275414;楚,-4.43336918057;停,-10.3414521187;糟,-6.0239640052;拣,-8.54969264951;兢,-6.15179737671;工,-7.85654546895;層,-7.45108036084;胧,-6.3341189335;坦,-8.03886702574;矩,-6.44963182062;敦,-9.64830493817;疼,-8.26201057706;陰,-8.54969264951;曳,-9.24283983007;絲,-6.47025110783;懵,-8.26201057706;闲,-10.3414521187;跄,-6.09295687669;精,-9.64830493817;呼,-5.35784549703;瀟,-9.24283983007;松,-6.28100910819;沌,-9.24283983007;羞,-7.63340191763;涂,-7.63340191763;紅,-5.68749176858;悄,-3.51599208248;來,-5.94700296406;漉,-5.52926776336;暈,-7.85654546895;瘋,-7.25040966538;疊,-6.81509159412;和,-7.08335558071;小,-3.29046267167;美,-9.64830493817;挑,-8.03886702574;挺,-6.37116020518;冒,-6.87571621594;端,-5.34423984497;折,-6.90746491425;丛,-9.64830493817;絮,-6.97415628875;吟,-5.52117055313;实,-3.91658309483;蜡,-8.54969264951;纠,-7.94355684594;嘣,-10.3414521187;通,-5.89880086224;津,-7.39701313957;窮,-6.05099267759;爆,-8.54969264951;隨,-6.10734561414;别,-7.94355684594;親,-6.70386595901;崭,-8.39554196968;怯,-9.24283983007;垮,-7.34571984518;鬱,-7.50823877468;莹,-7.12257629387;稳,-6.06478599972;冲,-5.02333212489;闷,-6.90746491425;耷,-9.24283983007;興,-6.0239640052;庸,-8.1442275414;嘻,-4.6578723514;纷,-6.28100910819;蒼,-6.81509159412;蠟,-8.54969264951;踏,-6.90746491425;晃,-4.66469831647;绊,-8.03886702574;浅,-6.26391467483;哄,-5.31101419734;摇,-5.39980969613;密,-4.76929808656;眯,-5.48163971437;盈,-6.81509159412;手,-5.92261151094;緊,-8.7320142063;跌,-5.88710482248;潑,-7.94355684594;颤,-6.97415628875;噓,-8.54969264951;淒,-7.85654546895;蜜,-7.45108036084;捏,-7.77650276127;塗,-7.63340191763;缠,-9.24283983007;肥,-9.24283983007;湛,-9.64830493817;聲,-8.03886702574;连,-8.03886702574;条,-6.12194441356;曠,-9.64830493817;輕,-3.64318406462;淨,-4.84839067539;酥,-8.26201057706;邦,-6.58025200304;實,-3.91658309483;彩,-7.50823877468;癫,-7.25040966538;闪,-5.63192191742;静,-4.01351533501;当,-5.87554400008;瑯,-10.3414521187;矮,-7.50823877468;绰,-10.3414521187;平,-5.26004775375;緲,-10.3414521187;惴,-8.95515775761;挨,-9.64830493817;處,-7.63340191763;登,-9.64830493817;淺,-6.26391467483;好,-5.59651999037;哼,-6.316100428;灿,-6.3341189335;躁,-10.3414521187;开,-9.24283983007;堂,-7.45108036084;撅,-10.3414521187;处,-7.63340191763;文,-9.64830493817;分,-9.64830493817;缈,-10.3414521187;压,-5.57927818394;疏,-7.77650276127;明,-5.4361773403;皑,-8.95515775761;踉,-6.09295687669;倒,-10.3414521187;咕,-6.67789047261;致,-9.64830493817;帖,-7.70239478912;脆,-8.95515775761;團,-8.95515775761;辛,-5.78757522713;嘮,-7.20595790281;條,-6.12194441356;甜,-6.28100910819;涟,-8.95515775761;躡,-6.05099267759;张,-5.8416424484;辣,-5.23550664483;滚,-7.39701313957;沥,-8.26201057706;娇,-10.3414521187;瘦,-6.81509159412;在,-4.82399922227;瘩,-7.70239478912;怪,-7.12257629387;疯,-7.25040966538;刮,-8.39554196968;皱,-8.95515775761;綿,-6.40962648601;头,-7.94355684594;冷,-5.57927818394;犹,-6.97415628875;茸,-5.94700296406;去,-6.87571621594;點,-8.03886702574;禿,-6.28100910819;渾,-7.45108036084;囁,-8.7320142063;着,-8.95515775761;心,-8.1442275414;层,-7.45108036084;喷,-6.23057825456;懇,-7.5688633965;勉,-7.50823877468;靈,-7.00924760856;慌,-5.31101419734;黝,-6.58025200304;乎,-4.64100854534;黑,-7.34571984518;点,-8.03886702574;温,-7.45108036084;磕,-7.45108036084;怏,-10.3414521187;腾,-5.4361773403;錚,-8.39554196968;毛,-7.63340191763;遲,-6.26391467483;蓝,-8.39554196968;病,-8.7320142063;詳,-7.77650276127;满,-5.31757159789;齐,-5.69706121959;赤,-10.3414521187;蹦,-8.39554196968;嫩,-7.77650276127;快,-6.16706484884;汪,-5.852815749;哭,-6.10734561414;敬,-5.45865019615;蓬,-6.70386595901;普,-6.07877224169;瑩,-7.12257629387;籲,-6.90746491425;僵,-10.3414521187;兴,-6.0239640052;旷,-9.64830493817;晶,-6.26391467483;隐,-5.1709681237;蹑,-6.05099267759;狠,-5.4361773403;啼,-6.10734561414;黃,-7.50823877468;简,-6.78610405725;節,-9.64830493817;琅,-10.3414521187;嶄,-8.39554196968;隆,-6.78610405725;娉,-8.03886702574;蹭,-6.94025473707;濃,-6.06478599972;圓,-5.58786192763;泼,-7.94355684594;大,-3.8753073945;铮,-8.39554196968;瀝,-8.26201057706;喜,-7.45108036084;生,-4.89903440821;模,-5.72633160189;绿,-5.66862328427;漣,-8.95515775761;急,-5.48942185482;唧,-10.3414521187;约,-5.27885708571;利,-8.1442275414;茫,-5.59651999037;搭,-7.50823877468;累,-7.16339828839;亮,-6.58025200304;爱,-8.26201057706;拉,-6.62788005203;蘇,-10.3414521187;悲,-8.54969264951;星,-7.50823877468;縹,-10.3414521187;灵,-7.00924760856;苦,-5.78757522713;從,-8.1442275414;落,-5.71647930545;涼,-7.94355684594;痴,-6.47025110783;扁,-8.1442275414;揀,-8.54969264951;烂,-6.58025200304;凄,-7.85654546895;细,-4.79237603384;糊,-4.27999519981;恍,-6.42942911331;凌,-9.24283983007;从,-8.1442275414;扑,-6.65257266462;汹,-8.39554196968;体,-8.1442275414;展,-8.1442275414;拖,-7.94355684594;橙,-10.3414521187;蔥,-10.3414521187;惚,-6.58025200304;衝,-5.02333212489;死,-5.32417228192;透,-9.64830493817;回,-6.44963182062;叠,-6.81509159412;正,-6.26391467483;健,-8.39554196968;轰,-7.94355684594;花,-5.0633374595;結,-5.24158569091;噩,-7.39701313957;叨,-6.39020840015;貼,-10.3414521187;恭,-5.45865019615;规,-6.44963182062;齊,-5.69706121959;乱,-8.7320142063;諾,-8.03886702574;呵,-6.21431773369;巴,-4.78077048772;長,-3.84921228371;零,-5.37860748847;幹,-4.8649885668;飕,-7.12257629387;彻,-10.3414521187;惺,-7.20595790281;荡,-5.2662783035;勾,-6.37116020518;
+S,ad:素,-7.08002649992;堅,-6.38687931936;嶄,-3.22987889821;奇,-5.98141421125;悉,-1.75701652078;惨,-5.13411635087;濫,-2.0111222977;崭,-3.22987889821;罕,-0.957533690408;痴,-5.98141421125;慎,-6.38687931936;僵,-5.47058858749;巧,-2.00485268469;暗,-3.8219299619;甘,-3.8219299619;慘,-5.13411635087;坚,-6.38687931936;迥,-2.66118589213;滥,-2.0111222977;暴,-5.98141421125;
+S,ag:邃,-8.11764388374;异,-8.52310899185;骏,-8.23542691939;琐,-5.38761477592;麗,-6.9826639509;赘,-6.03820234206;沛,-5.75052026961;挚,-5.38039452794;废,-7.60681825997;怠,-4.67651379174;锦,-9.21625617241;倨,-6.84913255827;悫,-9.21625617241;饥,-8.11764388374;纷,-5.07312144601;逸,-5.80400895456;莽,-8.52310899185;私,-3.21072436809;褊,-7.27034602335;迅,-5.88405166223;勇,-7.91697318828;陌,-5.33813471865;慎,-7.67581113146;豐,-3.76951880074;迥,-7.82996181129;諧,-4.56229582225;敦,-10.3148684611;俭,-6.02440901993;灰,-5.88405166223;惻,-7.60681825997;憾,-8.01228336808;幼,-4.22129869103;洁,-4.65887665025;豪,-3.8997715019;庄,-9.21625617241;儉,-6.02440901993;竭,-6.22052389885;莊,-9.21625617241;憎,-10.3148684611;鄙,-4.94889244605;弥,-5.88405166223;彰,-5.04701030201;榮,-3.89813617856;厲,-9.21625617241;頻,-4.86813108941;鸿,-6.5082059713;疾,-9.62172128051;哀,-8.70543054864;寂,-5.59636958978;蹇,-9.62172128051;晏,-10.3148684611;寒,-3.70014286087;罕,-6.12521371905;瑣,-5.38761477592;貧,-4.07070156041;燦,-5.48655472377;浩,-4.98214966781;惰,-6.23733101717;裸,-4.22582358563;恻,-7.60681825997;孽,-5.26501245382;曼,-4.41223512767;飢,-8.11764388374;黢,-8.70543054864;傑,-9.62172128051;舒,-10.3148684611;趣,-10.3148684611;碩,-4.54342733794;愨,-9.21625617241;渺,-6.03820234206;烁,-6.46472085936;兀,-3.53154326047;臃,-6.22052389885;雅,-3.73284332218;恆,-6.30753527584;慈,-4.42322424925;彌,-5.88405166223;潔,-4.65887665025;煥,-9.21625617241;韧,-5.69974794423;慨,-8.92857409995;淫,-4.71644650208;懦,-5.22727212584;狭,-4.37733225599;矯,-7.91697318828;異,-8.52310899185;淳,-5.27144334415;智,-10.3148684611;洋,-3.58743673622;爍,-6.46472085936;頑,-4.37469720835;朗,-8.11764388374;紛,-5.07312144601;悦,-9.62172128051;憨,-10.3148684611;贫,-4.07070156041;昭,-8.92857409995;鴻,-6.5082059713;爽,-10.3148684611;秀,-3.11369757779;惭,-6.22052389885;湍,-4.99185848194;韌,-5.69974794423;遑,-6.48622706458;驕,-5.25862265573;遙,-4.73513863509;燠,-8.11764388374;酣,-5.75052026961;廢,-7.60681825997;篤,-4.36422590849;歧,-5.78226896792;遐,-8.01228336808;適,-5.9204193064;巨,-3.71228056888;詭,-5.53574496796;森,-9.62172128051;凸,-4.99185848194;幽,-5.22727212584;羁,-6.28951677034;厉,-9.21625617241;紊,-6.46472085936;蔚,-6.94757263109;瘠,-6.40284545565;劣,-7.82996181129;馥,-7.17937424514;碧,-7.27034602335;錦,-9.21625617241;優,-3.27784084639;丰,-3.76951880074;芳,-7.17937424514;濁,-8.11764388374;诡,-5.53574496796;勃,-4.8425977874;衰,-3.92462779401;浊,-8.11764388374;虐,-5.8375316466;詘,-6.70395054843;慚,-6.22052389885;寡,-4.52797107971;频,-4.86813108941;奢,-5.57867001268;燥,-4.48592284346;武,-6.53067882716;翩,-8.23542691939;丽,-6.9826639509;睦,-4.19457104212;糯,-10.3148684611;艰,-6.48622706458;峻,-4.65190798094;灼,-8.23542691939;贅,-6.03820234206;焕,-9.21625617241;谐,-4.56229582225;聰,-5.7715736788;微,-6.65130681494;阳,-9.62172128051;欹,-7.48165511702;洽,-9.62172128051;歉,-6.44366745017;陋,-6.46472085936;诎,-6.70395054843;卑,-4.59128335912;淒,-5.79307988402;僻,-4.92579673126;寞,-8.52310899185;祥,-7.31913618752;详,-3.89487353293;摯,-5.38039452794;危,-6.81836089961;詳,-3.89487353293;歹,-6.22052389885;灿,-5.48655472377;适,-5.9204193064;悅,-9.62172128051;醇,-4.01041965865;明,-5.86052116482;暑,-5.98413512079;冗,-5.9328418264;优,-3.27784084639;骄,-5.25862265573;贤,-9.62172128051;喧,-9.62172128051;邈,-7.31913618752;炽,-5.94542060861;仁,-10.3148684611;嗇,-6.5082059713;廉,-4.34616090109;煌,-4.72015708147;恒,-6.30753527584;拙,-5.27144334415;忤,-6.36362474249;恢,-4.04577217737;赤,-5.30423316698;矫,-7.91697318828;聪,-5.7715736788;峭,-5.33813471865;啬,-6.5082059713;普,-8.36895831202;杰,-9.62172128051;腴,-7.60681825997;陶,-8.52310899185;狹,-4.37733225599;駿,-8.23542691939;笃,-4.36422590849;善,-6.46472085936;崇,-9.21625617241;隆,-8.92857409995;羈,-6.28951677034;莠,-7.91697318828;茫,-4.62789310473;暮,-6.44366745017;悲,-6.67728230135;夷,-10.3148684611;凄,-5.79307988402;奇,-2.89010669925;婉,-6.30753527584;熾,-5.94542060861;敏,-3.39025606503;硕,-4.54342733794;翠,-8.52310899185;荣,-3.89813617856;賢,-9.62172128051;遥,-4.73513863509;陽,-9.62172128051;恭,-4.19237565156;艱,-6.48622706458;杳,-6.81836089961;顽,-4.37469720835;
+S,an:濁,-0.808290199597;浊,-0.808290199597;悲,-0.985877219309;竭,-1.70777381315;
+S,a:稀,-6.56937116614;茂,-7.39761457356;圆,-10.080916605;笨,-7.87631192034;軟,-5.82011642773;老,-3.4638701968;迟,-6.38291224308;倔,-8.9823043163;暗,-7.40447174328;妙,-6.82796146645;鮮,-7.10538703873;骚,-8.35815000723;犟,-9.00477717215;稠,-8.12082182092;劣,-8.46483414982;欢,-6.78879031836;妥,-7.26950789088;焦,-7.25953771856;涩,-7.87631192034;颠,-11.5362038376;脆,-7.52627661717;纯,-6.15105368141;靜,-7.72321221275;熱,-4.44922704005;銳,-8.0056504347;渴,-7.58496011899;傻,-6.43025836368;强,-4.2402749476;宽,-4.99455560035;馋,-8.71142936217;暴,-10.1862771206;满,-4.79636015367;黃,-4.9982707749;杂,-7.45142872637;釅,-10.080916605;凉,-12.0958196255;羶,-10.3040601563;藍,-6.07237203255;難,-4.22108050034;黏,-8.85714117335;低,-3.64369843084;近,-3.96098555349;乐,-5.86238977285;齊,-6.14909097225;癢,-7.77500372188;濕,-6.53225753163;拗,-8.34045043013;坚,-7.44185927535;糟,-8.90740300813;賊,-10.1499094765;淡,-6.3235999893;遠,-4.46973686744;廣,-5.34267346476;慢,-5.89988479236;旧,-5.05178672824;早,-4.15372394788;長,-3.38466455614;绵,-7.65906809115;歪,-12.7889668061;短,-4.9280104412;硬,-5.59716104087;疼,-7.43948115295;旱,-6.97334484966;灰,-9.26260628146;腥,-7.54986879918;獨,-6.9763299265;凹,-7.10538703873;勻,-12.7889668061;精,-5.71315794209;誠,-7.12600632594;濫,-8.81867489252;滿,-4.79636015367;阔,-6.68752740576;紅,-4.42620766796;窄,-5.9966223786;娇,-9.4390627188;臭,-6.85804875883;粗,-5.79733004311;馊,-9.1646258731;小,-2.96206336572;香,-5.36093074455;易,-5.30628497792;迂,-9.59029368852;輕,-5.20571928177;畅,-7.41137625863;爛,-7.85449287294;厚,-5.68605601232;鲜,-7.10538703873;实,-5.08821901156;深,-3.97107660513;奇,-8.58427418668;陰,-6.05496985322;密,-5.65367762747;蔭,-7.95268489912;怯,-7.29384986355;微,-6.50950773533;弱,-5.40094820891;醜,-7.09355258109;稳,-6.06093645804;疲,-7.83313974847;贵,-5.64811764492;嚴,-6.07418966407;騷,-8.35815000723;紧,-5.67176130291;脹,-7.33578472896;咸,-7.73911079882;蠻,-9.98560642517;齐,-6.14909097225;瘪,-8.79998275951;胀,-7.33578472896;緊,-5.67176130291;浅,-5.99718370334;难,-4.22108050034;假,-5.54831711182;准,-5.60623482714;饞,-8.71142936217;烈,-6.52747512175;俊,-7.63567521157;乏,-13.4821139866;野,-7.81568729852;浑,-7.35088749715;寒,-7.19984723974;偏,-5.88321352976;酸,-10.3466197707;闊,-6.68752740576;高,-2.68997414953;顛,-11.5362038376;诚,-7.12600632594;雜,-7.45142872637;癟,-8.79998275951;歡,-6.78879031836;曠,-8.18379662008;黄,-4.9982707749;顺,-6.70789010027;累,-6.57736321667;勤,-7.49566198135;姦,-7.66500282667;煩,-12.383501698;惨,-7.3862894242;瘦,-6.56837663597;静,-7.72321221275;独,-6.9763299265;良,-7.50069977538;差,-4.94747388161;饱,-7.21301770293;艳,-7.54457778155;懒,-7.52627661717;绿,-5.66087190311;穷,-6.23931606384;凶,-6.51044538191;旺,-6.76915778595;好,-2.63881450718;阴,-6.05496985322;广,-5.34267346476;匀,-12.7889668061;樂,-5.86238977285;順,-6.70789010027;残,-6.44508637195;舊,-5.05178672824;酽,-10.080916605;嬌,-9.4390627188;明,-4.91213860978;锐,-8.0056504347;红,-4.42620766796;純,-6.15105368141;尖,-6.24938085045;帅,-7.67097299365;钝,-7.9487244979;甜,-6.94397416286;熟,-6.51987052237;薄,-5.80656798409;素,-10.1148181566;辣,-9.63196638492;蠢,-8.38836378582;肥,-9.92676592514;倦,-8.38836378582;木,-8.32882239213;怪,-6.20624938609;禳,-9.29245924461;細,-5.39293830779;痒,-7.77500372188;纵,-13.4821139866;鬼,-8.36412017421;冷,-5.23332325294;膻,-10.3040601563;洼,-8.27262783379;禿,-7.38403970447;渾,-7.35088749715;濃,-6.5844090435;臊,-8.74591553824;狠,-13.4821139866;靈,-6.21668426338;响,-12.7889668061;慌,-6.75348537355;俏,-8.60691666343;黑,-4.60125037676;腐,-7.47576082703;邪,-6.33376824273;昏,-13.4821139866;俗,-6.78138287708;乖,-7.93303790174;糙,-9.20544786762;慘,-7.3862894242;痛,-5.97937577588;蓝,-6.07237203255;險,-6.33849638393;臟,-6.96149285907;賤,-7.37955539202;惡,-6.26834567851;少,-4.06883277066;牢,-6.67639143321;滥,-8.81867489252;孤,-6.62881489345;巧,-7.01596926239;嫩,-7.46839883059;全,-4.13131626196;快,-3.95966725829;實,-5.08821901156;热,-4.44922704005;贼,-10.1499094765;险,-6.33849638393;遲,-6.38291224308;僵,-7.80194137761;綿,-7.65906809115;旷,-8.18379662008;恶,-6.26834567851;奸,-7.66500282667;空,-4.80093294511;飽,-7.21301770293;荫,-7.95268489912;響,-12.7889668061;刁,-9.26260628146;澀,-7.87631192034;堅,-7.44185927535;玄,-7.31250325414;準,-5.60623482714;鈍,-7.9487244979;秃,-7.38403970447;脏,-6.96149285907;碎,-7.03322459248;丑,-7.09355258109;贱,-7.37955539202;圓,-10.080916605;暖,-4.75806924068;殘,-6.44508637195;猛,-8.51230068706;矮,-7.27755622406;斜,-9.89859504818;綠,-5.66087190311;暢,-7.41137625863;严,-6.07418966407;大,-2.02499725849;紫,-6.26467055494;窪,-8.27262783379;煳,-8.69462224385;弯,-10.2240174486;窮,-6.23931606384;縱,-13.4821139866;新,-2.81957447865;傲,-8.4195189536;強,-4.2402749476;活,-12.7889668061;羞,-13.4821139866;涼,-12.0958196255;餿,-9.1646258731;痴,-8.06601358443;扁,-6.77037359158;净,-5.20038999622;烂,-7.85449287294;久,-5.01390097744;艷,-7.54457778155;兇,-6.51044538191;细,-5.39293830779;重,-4.27930188108;清,-4.39348937334;懶,-7.52627661717;富,-5.68482271308;坏,-5.49153710489;糨,-12.0958196255;浓,-6.5844090435;棒,-6.45302642248;柔,-9.79323453252;貴,-5.64811764492;胖,-6.74514702863;帥,-7.67097299365;彎,-10.2240174486;远,-4.46973686744;壞,-5.49153710489;陡,-7.14883435849;淺,-5.99718370334;古,-4.94747388161;烦,-12.383501698;穩,-6.06093645804;淨,-5.20038999622;慎,-8.79998275951;寬,-4.99455560035;软,-5.82011642773;蛮,-9.98560642517;足,-5.10028243315;佳,-6.11630114942;青,-5.60055406957;灵,-6.21668426338;湿,-6.53225753163;酥,-7.79513863029;苦,-5.65009980613;轻,-5.20571928177;白,-4.64894285361;长,-3.38466455614;
+S,bg:橙,-1.94591014906;赝,-0.154150679827;贗,-0.154150679827;
+S,b:洋,-7.84095411173;复,-5.35913865451;閏,-8.57184162027;褐,-5.24514676591;原,-1.92875325482;女,-2.05076744026;阳,-4.46349300996;男,-2.93540502249;总,-1.38785418504;總,-1.38785418504;雄,-4.58001262157;母,-3.53839164841;雌,-4.33550794326;野,-4.42262044782;金,-1.98949690747;仔,-6.10635305634;绛,-5.91643515265;公,-4.84893241757;副,-1.67506951303;闰,-8.57184162027;絳,-5.91643515265;陽,-4.46349300996;
+S,c:复,-6.46400013159;和,-0.748747095955;且,-4.29271920113;或,-2.49305781151;倘,-6.96011298433;傥,-10.5785103634;並,-2.46594929379;暨,-7.49762028151;縱,-11.8594442089;纵,-11.8594442089;惟,-8.78675089418;然,-11.8594442089;儻,-10.5785103634;故,-4.62859145221;但,-2.25078419694;及,-2.87713430978;而,-1.99937577045;雖,-4.61150928847;苟,-11.5229719722;既,-4.48544234952;若,-4.23258164765;并,-2.46594929379;虽,-4.61150928847;
+S,dg:善,-4.42883070087;复,-3.61543439216;倏,-4.92130718597;輒,-4.8511029273;弗,-2.43488653135;甚,-0.464215245324;猝,-6.15605164896;辄,-4.8511029273;务,-6.36369101374;素,-5.56134454122;匪,-4.92130718597;婉,-4.38534558893;疾,-5.93290809765;勉,-8.23549319064;益,-5.52744298954;协,-6.28958304159;姑,-6.44373372141;卒,-7.31920245877;協,-6.28958304159;務,-6.36369101374;煞,-6.5307450984;俱,-1.67871483448;幸,-5.70976454633;
+S,d:宁,-11.9064945395;最,-3.90349374415;较,-3.97096678594;未,-4.91524099168;預,-7.08151970342;約,-4.30313676334;颇,-6.37938295009;将,-2.8614809569;尚,-6.0707096182;專,-6.66651274993;莫,-6.90422749504;再,-3.93540878596;明,-6.87496788633;渐,-6.73838077545;邊,-5.16548278731;岂,-6.87062477419;还,-2.85149305295;宛,-10.6778291225;业,-13.6982540087;虛,-7.02495604092;亟,-9.76642837597;還,-2.85149305295;务,-7.84318208649;尤,-6.97442156787;越,-5.20781555458;谨,-8.10354262909;暫,-7.24857378809;太,-4.7095583119;驟,-8.88606965332;迭,-8.54785677222;决,-7.06427789699;欲,-6.22859983576;讵,-12.4454910402;竟,-6.07607941387;极,-5.5818369359;愈,-7.20072515492;犹,-7.83320338644;常,-5.39128814332;挺,-7.14005620588;似,-6.89752730247;便,-4.27171413963;蠻,-7.80522953439;胡,-9.24390671244;終,-7.16519217915;仅,-5.03315818735;勇,-12.7819632768;先,-4.80749925818;旋,-7.43580858085;猶,-7.83320338644;仍,-4.49252424927;彌,-8.83071955823;詎,-12.4454910402;恐,-7.05316303918;齊,-7.36319975719;永,-7.45214724321;務,-7.84318208649;虚,-7.02495604092;绝,-6.67538592261;微,-7.26772840404;惟,-7.85181523363;非,-6.33592604749;凡,-6.63392242267;屢,-7.50486954672;皆,-5.80095753609;寧,-11.9064945395;边,-5.16548278731;獨,-7.7130590746;毫,-9.58738014452;絕,-6.67538592261;苟,-9.96058439041;頗,-6.37938295009;才,-3.99590392721;恰,-7.84175044702;徒,-7.54552131399;却,-4.06894017858;偶,-8.3703778399;遂,-6.23661361648;決,-7.06427789699;忽,-6.31457515795;突,-7.5286432762;勿,-7.88861114333;較,-3.97096678594;亂,-5.94098903152;妄,-8.65482889177;將,-2.8614809569;历,-9.04429365853;很,-3.80863721184;殊,-8.92756938422;不,-2.17074046899;漸,-6.73838077545;预,-7.08151970342;专,-6.66651274993;互,-7.45408710803;豈,-6.87062477419;则,-4.26521018223;僅,-5.03315818735;猛,-6.95891738133;确,-7.05251305541;真,-5.23256466014;共,-4.96144347574;刚,-5.70632348884;別,-5.50250651988;均,-4.63902726638;紧,-7.30717476715;亦,-5.4365984364;别,-5.50250651988;甭,-8.8901429787;唯,-7.93463153368;單,-5.83942017235;就,-2.3515720479;概,-8.69095761586;殆,-10.9574139848;终,-7.16519217915;謹,-8.10354262909;稍,-6.4565296233;確,-7.05251305541;毋,-10.2170139194;直,-5.26716351633;必,-5.89563594525;没,-4.1320940585;复,-6.67627758562;狂,-7.67844498857;酷,-8.89833974591;則,-4.26521018223;又,-2.9866178829;究,-9.10313415856;乍,-8.94036273568;偏,-6.39205823654;忒,-8.74595429161;单,-5.83942017235;约,-4.30313676334;暂,-7.24857378809;弥,-8.83071955823;剛,-5.70632348884;须,-6.28337996787;也,-2.21440726122;骤,-8.88606965332;屡,-7.50486954672;狠,-7.94409532671;正,-4.18906909706;緊,-7.30717476715;略,-6.29732804118;齐,-7.36319975719;都,-2.68812812914;須,-6.28337996787;只,-3.46253534325;業,-13.6982540087;独,-7.7130590746;良,-8.90246346309;蛮,-7.80522953439;乱,-5.94098903152;已,-3.72437789243;極,-5.5818369359;更,-3.93604204351;歷,-9.04429365853;特,-6.09585267302;相,-4.98237390639;卻,-4.06894017858;沒,-4.1320940585;甫,-9.04906693728;曾,-4.5659292337;
+S,e:吁,-5.84078699565;嚯,-5.25300033075;嗄,-4.38217197295;哦,-1.59730429542;唉,-1.66102955558;喏,-3.50864310041;哎,-2.04529780648;噓,-7.45022490808;誒,-5.17295762307;呔,-5.84078699565;猗,-7.45022490808;嘖,-8.14337208864;嘘,-7.45022490808;噢,-4.79346800137;啧,-8.14337208864;呦,-4.12698906789;嗳,-3.4989811895;嗨,-3.10967152162;噫,-5.00787787271;咦,-3.17355878907;嗬,-3.53820190265;嗯,-1.78293354201;噯,-3.4989811895;咳,-7.04475979997;籲,-5.84078699565;诶,-5.17295762307;欹,-8.14337208864;呸,-3.47522710349;嘻,-4.96531825829;於,-6.27156991174;嘿,-3.63802223794;喔,-5.22560135656;
+S,f:内,-3.05361781637;下,-2.34536859098;上,-1.47945374377;後,-2.07056458489;后,-2.07056458489;間,-3.97115306523;底,-4.76116440355;北,-4.26869732831;外,-3.50092845955;初,-4.36045312443;东,-4.25339221727;末,-4.85484988763;中,-1.54204470598;旁,-5.71921973191;前,-2.70325208049;里,-2.67739197593;南,-4.00715350972;裡,-2.67739197593;內,-3.05361781637;左,-5.19759173726;東,-4.25339221727;右,-5.31832724037;间,-3.97115306523;西,-4.186658096;
+S,g:蘄,-6.98967910946;厍,-6.19042542291;锎,-8.10332927549;帔,-8.24993274968;萘,-6.68351222233;溟,-7.89853486285;璣,-8.89178663586;鰨,-5.69311351831;肫,-7.76038452437;弪,-11.1943717289;戬,-9.2484615798;榱,-8.79647645605;鄶,-8.62942237139;臁,-6.3268372784;畎,-8.48632152775;硐,-6.64049483725;鳓,-8.1986394553;腖,-7.45670211057;屨,-9.11493018717;惫,-7.36573033236;蹴,-6.98967910946;暄,-8.10332927549;逋,-7.16902003812;劌,-8.89178663586;嘏,-7.76038452437;閎,-7.10002716663;鮒,-7.06723734381;檜,-7.38770923908;涞,-5.59966034925;眥,-7.43317161316;皤,-9.11493018717;怫,-8.55531439924;薮,-6.9039122877;谳,-7.36573033236;媼,-7.45670211057;曄,-7.24312801027;橇,-6.54041137869;赉,-7.66801120424;獍,-8.3611583848;钣,-7.36573033236;擘,-8.14984929113;湟,-6.50302384662;淞,-6.02958575493;鑣,-7.10002716663;靥,-7.16902003812;婧,-7.48079966215;嵩,-5.79620902733;潼,-7.82707589886;裰,-7.89853486285;豳,-7.82707589886;轵,-8.79647645605;蠆,-7.43317161316;毖,-7.53081008272;邡,-8.99714715152;疣,-6.25272930624;箧,-7.55678556912;砦,-7.26254609613;鲩,-8.62942237139;憫,-7.03548864549;袱,-7.50549227474;褰,-7.00471698682;瘺,-7.00471698682;旃,-6.59925187872;浈,-7.72863582605;埏,-10.5012245483;飑,-8.10332927549;奐,-7.32317071794;罔,-6.7284636102;蕘,-10.5012245483;槛,-6.22455842928;櫝,-9.58493381642;铹,-8.99714715152;竽,-6.82492387638;謇,-6.43219779405;儋,-7.6108527904;爍,-7.93627519083;砑,-7.50549227474;馐,-5.56315994703;紓,-6.52154289439;忮,-10.0957594402;讜,-6.54998082971;逡,-7.82707589886;劢,-8.55531439924;垤,-8.79647645605;颦,-7.26254609613;鰩,-7.30255143074;愫,-7.82707589886;贳,-11.1943717289;踵,-7.30255143074;猷,-7.93627519083;邶,-7.97549590398;恁,-5.68498339222;牍,-6.71703491437;镎,-7.86216721868;泞,-10.5012245483;筧,-7.2240798153;籩,-7.43317161316;廪,-7.00471698682;鑹,-9.80807736773;篼,-8.14984929113;澉,-9.2484615798;倌,-6.91770560984;洄,-8.05887751292;靚,-7.45670211057;耬,-8.05887751292;蜮,-8.62942237139;趵,-8.3611583848;歆,-7.26254609613;濉,-6.15094661193;篑,-11.1943717289;胗,-7.86216721868;柙,-7.72863582605;櫛,-6.48484152754;潞,-6.0585732918;酢,-6.54998082971;嗥,-7.76038452437;磧,-6.51224050173;鹨,-7.53081008272;徼,-8.1986394553;汴,-5.18555854341;髻,-6.12546752663;顼,-9.40261225962;罾,-7.79317434719;昃,-8.79647645605;撄,-8.48632152775;溈,-7.89853486285;琏,-6.10677539362;骐,-8.30399997096;鲔,-9.2484615798;谟,-5.81909332117;銠,-6.86363838857;醢,-8.24993274968;箦,-9.80807736773;舫,-8.1986394553;覲,-7.41018209493;洵,-8.62942237139;厶,-7.45670211057;魑,-6.08238394049;姒,-7.36573033236;蛘,-6.91770560984;镥,-9.2484615798;绨,-7.58345381621;艫,-7.15132046102;忾,-9.2484615798;攄,-10.0957594402;榇,-7.72863582605;粕,-6.53093263474;殛,-8.14984929113;禧,-8.0163178985;纩,-8.79647645605;悭,-9.2484615798;蠲,-7.6108527904;鲈,-6.2965319289;隹,-7.45670211057;夼,-9.2484615798;恂,-7.93627519083;觇,-8.05887751292;煌,-6.40687998607;湞,-7.72863582605;铥,-9.40261225962;镤,-9.2484615798;廩,-7.00471698682;罨,-7.89853486285;虮,-6.96026522425;衲,-7.20538768229;鹾,-7.55678556912;澈,-7.36573033236;貊,-7.93627519083;醌,-7.53081008272;锏,-5.43862951526;箐,-9.40261225962;枘,-8.89178663586;儷,-8.05887751292;紿,-7.93627519083;纾,-6.52154289439;胂,-6.9039122877;摅,-10.0957594402;旄,-7.26254609613;雎,-7.93627519083;柘,-7.15132046102;觜,-8.70946507906;郢,-6.7284636102;祧,-9.80807736773;竦,-5.83778545418;峪,-5.84251359538;埸,-11.1943717289;筻,-9.2484615798;悃,-9.2484615798;舄,-9.40261225962;璋,-6.35018464239;瞍,-10.0957594402;嘌,-7.03548864549;碓,-7.58345381621;箕,-5.40135812047;彘,-6.91770560984;茚,-7.32317071794;疡,-8.05887751292;眢,-8.79647645605;嬪,-6.21076510714;螭,-7.18703854362;趱,-6.91770560984;鲻,-7.82707589886;藁,-7.69786416738;赆,-9.11493018717;铋,-6.48484152754;鋏,-9.80807736773;酎,-7.76038452437;屐,-7.89853486285;襞,-8.89178663586;珥,-8.79647645605;曩,-8.42178300661;燹,-11.1943717289;灸,-6.10062152804;獺,-6.44078153774;嚌,-8.89178663586;鲐,-7.58345381621;笕,-7.2240798153;躜,-9.58493381642;瞢,-10.0957594402;鮪,-9.2484615798;蚬,-6.79992257418;貰,-11.1943717289;鄹,-8.70946507906;尻,-7.01998445896;蓀,-7.76038452437;聃,-8.70946507906;颛,-9.40261225962;鳐,-7.30255143074;顓,-9.40261225962;嫔,-6.21076510714;晗,-8.0163178985;腙,-8.70946507906;瓠,-7.45670211057;緦,-6.25989779572;奩,-7.00471698682;篪,-9.58493381642;黼,-6.04687725204;辇,-5.63754366715;疋,-7.20538768229;隍,-8.1986394553;鎏,-6.98967910946;琬,-8.99714715152;粑,-6.65107694658;螗,-9.2484615798;脘,-6.850566307;簦,-7.03548864549;鈺,-8.3611583848;弼,-6.52154289439;裉,-7.15132046102;盍,-7.97549590398;坌,-8.55531439924;珏,-11.1943717289;繒,-7.05123700246;胙,-7.18703854362;艚,-7.82707589886;屦,-9.11493018717;驪,-6.45817328046;蛭,-5.88610403145;馗,-7.97549590398;呶,-6.71703491437;鉺,-8.99714715152;萁,-7.86216721868;栉,-6.48484152754;瘍,-8.05887751292;垌,-10.0957594402;撖,-11.1943717289;怙,-8.24993274968;袞,-7.2240798153;疠,-8.99714715152;鄣,-6.45817328046;砩,-7.24312801027;媪,-7.45670211057;溲,-7.55678556912;瀹,-6.47587285756;羼,-8.89178663586;揄,-8.3611583848;畋,-8.30399997096;祓,-9.40261225962;廒,-8.3611583848;鯔,-7.82707589886;峦,-6.91770560984;敫,-7.63902366736;螨,-5.52449080587;昀,-7.63902366736;皋,-6.55964274062;骓,-7.66801120424;馕,-6.70573535912;蒗,-9.11493018717;垡,-7.82707589886;銣,-6.96026522425;锢,-5.63369009784;鲧,-7.38770923908;悯,-7.03548864549;钷,-8.62942237139;儺,-6.6725831518;笾,-7.43317161316;柁,-9.80807736773;詈,-6.2965319289;痍,-10.5012245483;髓,-5.50739637251;軛,-6.20393914207;淝,-6.34234146493;汜,-6.6617722357;埡,-6.56939891557;彦,-4.700617889;饪,-7.38770923908;櫳,-7.06723734381;桴,-8.05887751292;铷,-6.96026522425;黻,-8.05887751292;巽,-6.44943960049;谇,-7.24312801027;阋,-7.06723734381;锍,-7.55678556912;缑,-8.0163178985;讞,-7.36573033236;鬩,-7.06723734381;妪,-8.48632152775;趲,-6.91770560984;褵,-6.27439080302;縻,-7.15132046102;醺,-7.55678556912;鲼,-7.58345381621;扃,-11.1943717289;胄,-6.3268372784;槊,-6.86363838857;灏,-7.10002716663;齑,-7.69786416738;绐,-7.93627519083;巒,-6.91770560984;磔,-7.76038452437;苘,-9.80807736773;臚,-5.94734765669;雠,-6.46698391014;鱧,-8.55531439924;矶,-5.63754366715;栊,-7.06723734381;刎,-8.89178663586;鼐,-5.81447437531;厣,-6.82492387638;嶧,-7.28234872342;龆,-6.69456205852;溱,-10.0957594402;谲,-8.1986394553;錸,-7.66801120424;岽,-8.14984929113;紼,-8.0163178985;淇,-6.43219779405;甍,-9.11493018717;桊,-8.79647645605;铍,-6.47587285756;廑,-9.40261225962;饔,-5.59225290797;恚,-6.25989779572;赜,-6.81234509418;酤,-8.3611583848;硪,-6.39035068412;艮,-6.65107694658;毳,-8.99714715152;蒂,-5.35956099179;溆,-7.06723734381;銎,-7.6108527904;縑,-6.86363838857;鲒,-9.80807736773;馔,-6.35018464239;悚,-7.50549227474;谝,-5.30272751703;椟,-9.58493381642;箨,-8.10332927549;脯,-7.45670211057;貲,-6.65107694658;锷,-6.83766290216;鈹,-6.47587285756;邺,-5.41982018331;鶼,-7.97549590398;荃,-7.53081008272;嗌,-7.06723734381;峒,-7.55678556912;駔,-9.58493381642;菘,-8.05887751292;諞,-5.30272751703;卣,-6.33455932449;釤,-8.14984929113;飪,-7.38770923908;葭,-7.43317161316;燼,-8.42178300661;齔,-6.58920154286;愆,-7.26254609613;朊,-7.79317434719;冑,-6.3268372784;錒,-7.00471698682;氘,-7.01998445896;悛,-10.0957594402;舜,-5.40135812047;堠,-8.42178300661;岣,-6.15741912644;琨,-8.89178663586;枵,-8.89178663586;昴,-7.30255143074;甾,-6.6617722357;槁,-7.93627519083;穌,-7.41018209493;獒,-7.2240798153;埕,-8.62942237139;陔,-8.89178663586;諗,-7.50549227474;襖,-5.41054654652;帻,-7.41018209493;翥,-9.40261225962;緹,-6.22455842928;鱸,-6.2965319289;椁,-5.20290718174;殂,-9.40261225962;輅,-6.850566307;镬,-7.86216721868;蒈,-11.1943717289;堋,-6.59925187872;鐓,-9.80807736773;樗,-7.10002716663;洙,-8.89178663586;貘,-7.32317071794;怛,-7.06723734381;簣,-11.1943717289;鈧,-6.59925187872;璨,-9.11493018717;蚴,-6.35018464239;稷,-6.3268372784;瘿,-6.78765248159;喾,-7.26254609613;诂,-8.10332927549;敉,-8.10332927549;蟊,-7.79317434719;郐,-8.62942237139;觖,-11.1943717289;晟,-6.9458764868;屣,-8.70946507906;鯢,-7.28234872342;彥,-4.700617889;镩,-9.80807736773;铨,-7.32317071794;櫬,-7.72863582605;蹯,-10.5012245483;揲,-8.89178663586;嗾,-7.89853486285;掇,-6.81234509418;怆,-7.66801120424;渚,-6.60940425018;颡,-8.48632152775;庥,-7.28234872342;炳,-7.2240798153;谮,-8.24993274968;鐾,-7.34422412714;蕈,-7.6108527904;孌,-8.99714715152;酐,-8.10332927549;牒,-6.26711804369;黥,-7.30255143074;珧,-10.5012245483;铩,-6.35018464239;镨,-9.2484615798;俦,-7.6108527904;阼,-9.80807736773;鹺,-7.55678556912;鑾,-6.75172047236;辄,-9.58493381642;茇,-9.58493381642;缏,-7.01998445896;鲎,-6.39858118325;逑,-7.18703854362;锓,-7.26254609613;瘕,-8.48632152775;謗,-6.97486402368;骢,-8.79647645605;耱,-9.80807736773;鲞,-9.2484615798;浃,-8.48632152775;齏,-7.69786416738;鳎,-5.69311351831;镓,-6.57925121201;埔,-6.9458764868;棖,-10.0957594402;僦,-7.69786416738;殁,-6.75172047236;玑,-8.89178663586;謖,-6.30402260063;憝,-9.58493381642;耜,-7.79317434719;撟,-10.5012245483;娠,-9.40261225962;鶥,-8.55531439924;匦,-6.07040774945;垩,-8.79647645605;檫,-7.93627519083;唪,-9.80807736773;榭,-6.44943960049;脲,-7.28234872342;搴,-6.64049483725;鬈,-7.93627519083;紺,-7.72863582605;冽,-8.48632152775;钿,-6.93169185181;霾,-6.43219779405;頊,-9.40261225962;齦,-6.87688361532;齎,-5.87136174971;鏑,-9.40261225962;潢,-7.00471698682;呔,-9.80807736773;譖,-8.24993274968;祢,-7.93627519083;郧,-7.20538768229;櫫,-8.99714715152;槭,-6.10677539362;哿,-8.24993274968;餍,-7.50549227474;簏,-9.2484615798;锕,-7.00471698682;钔,-8.30399997096;肜,-7.97549590398;瀧,-8.30399997096;澮,-7.79317434719;芰,-5.57760063118;蒴,-6.83766290216;爻,-6.7400244326;琿,-6.63002353738;揆,-7.24312801027;鉍,-6.48484152754;勐,-7.05123700246;啕,-10.5012245483;诖,-6.54998082971;慝,-10.0957594402;嫠,-7.55678556912;鹣,-7.97549590398;峤,-7.38770923908;嗪,-7.38770923908;贄,-8.24993274968;颍,-5.53837991803;垓,-6.7400244326;钕,-7.58345381621;锔,-7.79317434719;訖,-5.85203747689;莛,-9.58493381642;氚,-7.20538768229;悝,-10.0957594402;崤,-6.83766290216;讫,-5.85203747689;琪,-7.2240798153;騶,-8.1986394553;閿,-6.93169185181;篋,-7.55678556912;饌,-6.35018464239;鹎,-8.48632152775;哕,-6.79992257418;髡,-6.44943960049;筠,-9.40261225962;鉦,-8.55531439924;雩,-8.62942237139;靨,-7.16902003812;榿,-7.08349786468;黹,-9.58493381642;叻,-7.43317161316;屺,-8.3611583848;痿,-7.82707589886;氅,-7.36573033236;鈑,-7.36573033236;蔟,-8.89178663586;缣,-6.86363838857;颢,-8.79647645605;钪,-6.59925187872;莰,-9.11493018717;窶,-7.43317161316;鲺,-9.58493381642;锿,-7.86216721868;詁,-8.10332927549;棂,-6.82492387638;塍,-9.80807736773;绎,-8.30399997096;靓,-7.45670211057;楗,-7.34422412714;濘,-10.5012245483;荛,-10.5012245483;賚,-7.66801120424;鋦,-7.79317434719;铪,-7.48079966215;浯,-7.55678556912;菰,-7.20538768229;繹,-8.30399997096;凼,-6.79992257418;畿,-6.37409016325;谀,-6.50302384662;暇,-6.00698592301;鲋,-7.06723734381;脞,-9.2484615798;缢,-6.59925187872;宥,-6.98967910946;倨,-8.99714715152;咻,-8.10332927549;瞽,-7.79317434719;瘼,-9.40261225962;蕆,-11.1943717289;郓,-6.58920154286;柝,-8.89178663586;镦,-9.80807736773;泫,-9.11493018717;獪,-11.1943717289;艴,-11.1943717289;廷,-4.36782650529;埽,-6.21763798643;辂,-6.850566307;誄,-6.71703491437;掊,-9.80807736773;鼍,-6.56939891557;騏,-8.30399997096;禎,-7.24312801027;钐,-8.14984929113;鞒,-6.6725831518;錕,-7.93627519083;褙,-9.58493381642;梘,-9.11493018717;笥,-6.71703491437;谫,-10.0957594402;芴,-7.72863582605;輞,-8.55531439924;隼,-5.77827132665;鈿,-6.93169185181;濂,-7.45670211057;旆,-6.76355493001;绌,-7.76038452437;黌,-9.58493381642;埒,-8.30399997096;淖,-5.21043544816;曜,-6.63002353738;孥,-7.93627519083;蓐,-9.40261225962;僨,-8.42178300661;轭,-6.20393914207;緶,-7.01998445896;睽,-9.11493018717;鉿,-7.48079966215;鞀,-7.26254609613;跖,-7.89853486285;缌,-6.25989779572;阒,-7.00471698682;谖,-6.55964274062;暝,-8.1986394553;妣,-9.80807736773;傩,-6.6725831518;涫,-7.05123700246;碹,-10.5012245483;赀,-6.65107694658;硎,-6.28171684312;铑,-6.86363838857;鍔,-6.83766290216;帑,-7.45670211057;秣,-7.34422412714;繢,-7.53081008272;衮,-7.2240798153;驺,-8.1986394553;坼,-9.11493018717;偾,-8.42178300661;殄,-8.30399997096;笏,-7.08349786468;焓,-6.89030663565;覘,-8.05887751292;誚,-6.56939891557;嶠,-7.38770923908;洫,-10.0957594402;侬,-6.78765248159;砹,-7.20538768229;阽,-9.80807736773;瞼,-7.00471698682;邾,-7.58345381621;嵋,-4.56633035267;苊,-7.69786416738;闐,-6.97486402368;佗,-7.26254609613;泖,-8.55531439924;旰,-7.89853486285;慳,-9.2484615798;啻,-7.16902003812;郾,-7.26254609613;蒇,-11.1943717289;蜆,-6.79992257418;庋,-5.782725677;銓,-7.32317071794;陘,-7.53081008272;萜,-6.87688361532;肟,-6.76355493001;挞,-7.30255143074;骣,-9.80807736773;眦,-7.43317161316;鎩,-6.35018464239;爨,-7.6108527904;岷,-6.38218737348;疽,-7.01998445896;猾,-8.42178300661;蹀,-9.58493381642;衄,-7.1339287183;绋,-8.0163178985;慊,-6.2965319289;煢,-9.11493018717;詘,-8.70946507906;曛,-7.66801120424;硤,-7.36573033236;珩,-8.79647645605;軫,-7.89853486285;晰,-8.3611583848;蕲,-6.98967910946;祺,-8.1986394553;獾,-5.27279330921;袄,-5.41054654652;膊,-6.02958575493;崍,-7.26254609613;捃,-9.11493018717;儕,-10.0957594402;缡,-6.27439080302;庠,-7.01998445896;稣,-7.41018209493;夥,-5.43232034607;鐧,-5.43862951526;渫,-8.1986394553;蜱,-7.26254609613;肴,-6.71703491437;媸,-6.91770560984;禺,-8.79647645605;潁,-5.53837991803;鳌,-5.09629744669;睑,-7.00471698682;兕,-8.48632152775;歙,-7.05123700246;绠,-7.69786416738;鋨,-7.1339287183;湫,-6.97486402368;诮,-6.56939891557;慵,-7.10002716663;铼,-7.66801120424;谂,-7.50549227474;薇,-4.75342518822;挈,-7.26254609613;怊,-10.5012245483;岍,-9.40261225962;吒,-7.76038452437;儔,-7.6108527904;纡,-7.58345381621;碥,-11.1943717289;夤,-7.38770923908;愴,-7.66801120424;嶷,-7.36573033236;縶,-9.58493381642;诃,-6.3580898219;睐,-8.62942237139;懟,-6.27439080302;绡,-7.43317161316;齠,-6.69456205852;噦,-6.79992257418;觯,-6.65107694658;腴,-10.5012245483;髹,-7.66801120424;铽,-9.58493381642;糁,-7.03548864549;榄,-7.10002716663;摭,-8.24993274968;缋,-7.53081008272;鐿,-9.40261225962;龠,-9.80807736773;粢,-8.05887751292;昱,-7.38770923908;宸,-5.72210105518;圻,-8.10332927549;劾,-5.99036504177;蹁,-10.5012245483;衅,-6.3268372784;艉,-7.34422412714;铒,-8.99714715152;釔,-7.1339287183;藜,-6.56939891557;慟,-7.66801120424;鳢,-8.55531439924;塥,-11.1943717289;轫,-7.16902003812;跬,-8.42178300661;諮,-6.87688361532;柰,-9.11493018717;聵,-9.2484615798;絷,-9.58493381642;坻,-9.40261225962;闼,-7.1339287183;鰈,-7.58345381621;踔,-6.64049483725;鄖,-7.20538768229;碛,-6.51224050173;崞,-8.0163178985;挢,-10.5012245483;枥,-8.1986394553;漪,-8.14984929113;嬲,-7.41018209493;徵,-6.850566307;釁,-6.3268372784;迕,-8.62942237139;湔,-7.89853486285;勗,-7.69786416738;兖,-6.19042542291;睚,-10.0957594402;鯝,-8.10332927549;黟,-8.99714715152;醑,-9.80807736773;櫧,-8.05887751292;襦,-7.82707589886;顰,-7.26254609613;筲,-9.2484615798;藹,-6.45817328046;葸,-11.1943717289;炀,-7.89853486285;紉,-6.9458764868;岈,-9.58493381642;耋,-10.5012245483;躔,-9.80807736773;谘,-6.87688361532;甙,-6.56939891557;骜,-11.1943717289;縟,-7.48079966215;蚤,-6.79992257418;侪,-10.0957594402;匭,-6.07040774945;劬,-6.78765248159;餱,-8.3611583848;陲,-8.3611583848;缵,-9.2484615798;糈,-10.0957594402;翊,-6.78765248159;藎,-6.81234509418;诒,-6.9458764868;軔,-7.16902003812;埚,-8.24993274968;嫜,-8.79647645605;俪,-8.05887751292;獭,-6.44078153774;癯,-8.3611583848;鐨,-6.53093263474;諼,-6.55964274062;疃,-6.58920154286;縊,-6.59925187872;椐,-9.58493381642;逖,-8.0163178985;锘,-7.18703854362;骝,-8.48632152775;讧,-8.55531439924;沩,-7.89853486285;劭,-8.1986394553;猬,-8.10332927549;琮,-7.45670211057;蒹,-8.62942237139;烁,-7.93627519083;闃,-7.00471698682;鯇,-8.62942237139;懋,-7.53081008272;詒,-6.9458764868;鬏,-9.80807736773;哙,-8.3611583848;镘,-9.80807736773;埯,-11.1943717289;罴,-7.34422412714;廨,-6.87688361532;綈,-7.58345381621;纊,-8.79647645605;蒎,-7.79317434719;丕,-6.22455842928;侔,-7.50549227474;鐙,-6.54041137869;缟,-6.36605799155;粞,-7.97549590398;刭,-9.11493018717;圯,-8.1986394553;刿,-8.89178663586;隳,-7.38770923908;氡,-6.97486402368;筇,-7.48079966215;觐,-7.41018209493;蹕,-7.06723734381;僖,-7.28234872342;罟,-7.82707589886;臠,-8.99714715152;棼,-9.80807736773;诼,-7.55678556912;潿,-7.05123700246;賾,-6.81234509418;鈀,-5.16128550705;儂,-6.78765248159;碇,-7.28234872342;訐,-8.05887751292;邗,-8.1986394553;瘘,-7.00471698682;骛,-8.24993274968;砜,-7.50549227474;鲟,-7.82707589886;侩,-8.89178663586;銫,-6.71703491437;醭,-7.82707589886;倬,-8.48632152775;钯,-5.16128550705;圮,-7.79317434719;庳,-9.80807736773;肷,-7.36573033236;檻,-6.22455842928;顥,-8.79647645605;鲽,-7.58345381621;嵊,-6.82492387638;懍,-7.1339287183;滓,-8.05887751292;汔,-11.1943717289;癘,-8.99714715152;姝,-7.93627519083;迩,-7.6108527904;铯,-6.71703491437;穰,-7.48079966215;鲕,-8.10332927549;佾,-9.58493381642;錁,-7.03548864549;阃,-6.93169185181;鼉,-6.56939891557;纈,-6.61966075035;愍,-7.43317161316;悌,-7.2240798153;沔,-7.32317071794;眙,-11.1943717289;疚,-7.76038452437;簟,-6.97486402368;讦,-8.05887751292;炬,-7.34422412714;妲,-9.2484615798;鲴,-8.10332927549;癃,-9.80807736773;拊,-7.50549227474;镅,-6.78765248159;蟎,-5.52449080587;湓,-7.41018209493;赕,-9.80807736773;豸,-10.5012245483;鱟,-6.39858118325;桧,-7.38770923908;烬,-8.42178300661;筱,-8.89178663586;鹳,-7.53081008272;峴,-8.10332927549;裼,-7.63902366736;檑,-11.1943717289;謐,-7.06723734381;刖,-6.86363838857;皙,-8.62942237139;镛,-9.80807736773;縞,-6.36605799155;氪,-6.850566307;骱,-6.89030663565;岵,-7.41018209493;憷,-7.15132046102;鲵,-7.28234872342;镄,-6.53093263474;黉,-9.58493381642;胍,-6.6617722357;諑,-7.55678556912;迓,-7.86216721868;釗,-6.98967910946;牖,-7.55678556912;鯛,-7.10002716663;祜,-7.30255143074;幞,-7.58345381621;苡,-6.79992257418;蟣,-6.96026522425;槧,-10.0957594402;僭,-5.16609320862;煬,-7.89853486285;餼,-6.22455842928;嫱,-7.97549590398;翳,-7.43317161316;嵴,-6.81234509418;蛹,-5.43862951526;葺,-9.40261225962;鈁,-7.32317071794;窆,-8.05887751292;縉,-6.60940425018;龈,-6.87688361532;怍,-8.55531439924;氕,-9.40261225962;涔,-6.2965319289;犖,-8.24993274968;瘙,-11.1943717289;堝,-8.24993274968;鴟,-7.10002716663;舡,-8.48632152775;莠,-10.5012245483;薤,-9.11493018717;缳,-10.5012245483;碲,-6.86363838857;嶴,-8.89178663586;愷,-6.6725831518;嗄,-8.79647645605;懌,-8.79647645605;蛎,-7.66801120424;裒,-8.62942237139;豕,-7.28234872342;兗,-6.19042542291;勖,-7.69786416738;孛,-5.69311351831;迨,-6.7284636102;獫,-10.5012245483;拶,-8.05887751292;衽,-8.0163178985;軾,-9.80807736773;喁,-8.55531439924;麇,-8.0163178985;崆,-7.63902366736;脎,-9.80807736773;涑,-6.15741912644;氐,-5.18801856925;輒,-9.58493381642;鲛,-5.59594976985;羝,-7.03548864549;戤,-10.0957594402;溧,-7.45670211057;钫,-7.32317071794;垭,-6.56939891557;饜,-7.50549227474;剄,-9.11493018717;汐,-9.11493018717;遘,-9.80807736773;艤,-9.2484615798;铫,-8.3611583848;埭,-7.89853486285;劓,-7.2240798153;狯,-11.1943717289;酮,-5.11443853376;緱,-8.0163178985;曷,-7.38770923908;恸,-7.66801120424;綆,-7.69786416738;瘗,-9.11493018717;殪,-9.80807736773;醮,-6.71703491437;紱,-8.79647645605;鲰,-11.1943717289;羲,-7.24312801027;艏,-7.50549227474;泐,-9.2484615798;桓,-5.01022283791;痖,-9.40261225962;柢,-8.14984929113;荥,-7.24312801027;毪,-11.1943717289;坭,-8.99714715152;燮,-7.69786416738;晷,-7.36573033236;詿,-6.54998082971;璁,-6.51224050173;瘂,-9.40261225962;墉,-8.99714715152;飧,-5.87136174971;贐,-9.11493018717;謔,-5.65703746183;邙,-7.6108527904;堞,-8.30399997096;膣,-11.1943717289;閫,-6.93169185181;圬,-10.0957594402;倮,-8.79647645605;鸲,-7.69786416738;媵,-9.80807736773;嬴,-7.18703854362;熵,-5.99036504177;畀,-8.1986394553;鲷,-7.10002716663;饈,-5.56315994703;杌,-7.18703854362;懣,-8.48632152775;鮐,-7.58345381621;楨,-8.05887751292;魴,-6.46698391014;轼,-9.80807736773;衾,-6.69456205852;缇,-6.22455842928;鲆,-6.53093263474;骊,-6.45817328046;谑,-5.65703746183;銚,-8.3611583848;鬟,-8.24993274968;锫,-8.79647645605;酃,-7.58345381621;盂,-6.38218737348;鉅,-7.76038452437;荏,-11.1943717289;诔,-6.71703491437;铖,-7.79317434719;嵛,-7.97549590398;槨,-5.20290718174;镫,-6.54041137869;櫪,-8.1986394553;癭,-6.78765248159;巰,-8.48632152775;驵,-9.58493381642;濼,-7.58345381621;歿,-6.75172047236;瘀,-5.69311351831;醅,-9.11493018717;娈,-8.99714715152;蚋,-7.10002716663;侑,-8.05887751292;丐,-7.82707589886;厙,-6.19042542291;纛,-7.24312801027;嶝,-9.58493381642;輦,-5.63754366715;弳,-11.1943717289;錮,-5.63369009784;窳,-7.55678556912;紲,-8.48632152775;舸,-8.10332927549;狃,-11.1943717289;灄,-8.89178663586;糇,-8.3611583848;浒,-7.76038452437;铗,-9.80807736773;珙,-8.3611583848;牘,-6.71703491437;廛,-8.89178663586;籜,-8.10332927549;賧,-9.80807736773;诩,-6.38218737348;郯,-7.48079966215;卮,-6.38218737348;菹,-8.14984929113;跽,-9.58493381642;譾,-10.0957594402;羆,-7.34422412714;禊,-9.40261225962;掎,-10.0957594402;躐,-9.2484615798;錙,-9.2484615798;鸛,-7.53081008272;鴝,-7.69786416738;岜,-7.50549227474;鮞,-8.10332927549;舣,-9.2484615798;谧,-7.06723734381;钇,-7.1339287183;挹,-8.62942237139;贽,-8.24993274968;囀,-8.1986394553;臌,-10.5012245483;瑗,-9.2484615798;鹛,-8.55531439924;嵝,-7.53081008272;寞,-10.5012245483;胤,-4.8575459977;迦,-5.64141214393;啭,-8.1986394553;衿,-7.34422412714;缁,-5.67691883239;炅,-7.97549590398;鄄,-6.55964274062;鶇,-7.76038452437;笈,-6.21076510714;枋,-6.83766290216;堊,-8.79647645605;瀚,-8.89178663586;粝,-7.36573033236;謨,-5.81909332117;鞫,-6.68351222233;锬,-8.0163178985;醯,-6.56939891557;鰲,-5.09629744669;昶,-8.48632152775;覿,-8.14984929113;樾,-7.48079966215;憊,-7.36573033236;郅,-7.58345381621;緇,-5.67691883239;蓍,-8.48632152775;臏,-8.48632152775;仑,-7.30255143074;毓,-6.69456205852;糝,-7.03548864549;韫,-8.48632152775;髦,-5.76942171137;啬,-8.89178663586;牮,-11.1943717289;篳,-10.0957594402;恺,-6.6725831518;浼,-6.3580898219;瞀,-9.2484615798;猃,-10.5012245483;瀅,-9.58493381642;渑,-8.14984929113;鄆,-6.58920154286;缛,-7.48079966215;骞,-6.61966075035;諛,-6.50302384662;洧,-8.48632152775;躦,-9.58493381642;鄯,-7.26254609613;銮,-6.75172047236;鸱,-7.10002716663;笳,-7.34422412714;莸,-7.18703854362;趼,-8.24993274968;椿,-6.6725831518;檾,-9.80807736773;娣,-7.18703854362;筌,-9.40261225962;桕,-8.48632152775;鱝,-7.58345381621;祟,-7.43317161316;晡,-8.3611583848;擢,-5.81909332117;赧,-8.0163178985;坫,-9.80807736773;瑭,-8.10332927549;鋮,-7.79317434719;鹱,-7.55678556912;糲,-7.36573033236;佻,-9.58493381642;砀,-7.76038452437;儆,-7.00471698682;圊,-10.5012245483;訌,-8.55531439924;溏,-6.98967910946;洎,-10.0957594402;膑,-8.48632152775;邛,-6.78765248159;锞,-7.03548864549;覡,-8.89178663586;愦,-7.82707589886;紆,-7.58345381621;崮,-7.55678556912;悴,-6.850566307;幄,-7.63902366736;滏,-7.6108527904;阌,-6.93169185181;懑,-8.48632152775;晔,-7.24312801027;嫗,-8.48632152775;鱘,-7.82707589886;郛,-8.1986394553;愎,-7.72863582605;鏝,-9.80807736773;飫,-7.01998445896;杪,-8.48632152775;陴,-10.5012245483;宕,-6.68351222233;轺,-8.79647645605;墀,-8.48632152775;攖,-8.48632152775;莒,-7.66801120424;朕,-3.55424855616;崙,-7.30255143074;岘,-8.10332927549;瀛,-6.15094661193;膦,-9.2484615798;窬,-7.01998445896;焱,-7.08349786468;眵,-8.89178663586;洹,-6.11919791362;奁,-7.00471698682;浍,-7.79317434719;腑,-6.10062152804;鳘,-9.2484615798;陟,-7.82707589886;佥,-6.44943960049;繯,-10.5012245483;珲,-6.63002353738;觶,-6.65107694658;浹,-8.48632152775;虿,-7.43317161316;綃,-7.43317161316;稂,-8.62942237139;璉,-6.10677539362;岙,-8.89178663586;椠,-10.0957594402;妫,-6.11296736387;窭,-7.43317161316;炱,-7.6108527904;祀,-5.97401590377;齄,-9.40261225962;黠,-8.42178300661;铉,-9.40261225962;觋,-8.89178663586;鯗,-9.2484615798;硖,-7.36573033236;跣,-7.1339287183;髭,-7.38770923908;甓,-7.89853486285;捩,-9.58493381642;闳,-7.10002716663;馀,-6.35018464239;崃,-7.26254609613;昕,-6.43219779405;蠡,-7.03548864549;薨,-7.66801120424;騭,-8.55531439924;缯,-7.05123700246;唳,-8.0163178985;瘵,-10.5012245483;垴,-9.80807736773;氹,-6.79992257418;鍇,-8.99714715152;闈,-6.98967910946;屙,-6.7284636102;瓞,-11.1943717289;槠,-8.05887751292;饫,-7.01998445896;镳,-7.10002716663;埴,-11.1943717289;跸,-7.06723734381;軺,-8.79647645605;邇,-7.6108527904;脒,-8.30399997096;嬖,-6.57925121201;谤,-6.97486402368;砬,-8.89178663586;爰,-6.43219779405;嚳,-7.26254609613;怼,-6.27439080302;篁,-8.24993274968;奂,-7.32317071794;鍆,-8.30399997096;幘,-7.41018209493;睞,-8.62942237139;淥,-6.04687725204;荦,-8.24993274968;嫫,-8.0163178985;秭,-9.80807736773;酲,-9.58493381642;圉,-6.70573535912;隈,-9.11493018717;陬,-8.05887751292;茑,-9.58493381642;憒,-7.82707589886;缙,-6.60940425018;纘,-9.2484615798;檠,-8.24993274968;踣,-10.5012245483;耧,-8.05887751292;蜩,-8.70946507906;騫,-6.61966075035;猱,-8.10332927549;舻,-7.15132046102;趺,-7.55678556912;肼,-7.53081008272;搿,-6.60940425018;髀,-7.6108527904;峄,-7.28234872342;荑,-8.10332927549;釹,-7.58345381621;蕕,-7.18703854362;鯖,-7.79317434719;鷚,-7.53081008272;韞,-8.48632152775;卺,-10.5012245483;恧,-10.5012245483;藪,-6.9039122877;翮,-8.99714715152;勰,-7.30255143074;瓴,-8.42178300661;桷,-8.99714715152;轹,-10.5012245483;滸,-7.76038452437;霈,-10.5012245483;琊,-7.2240798153;芑,-7.43317161316;妗,-6.45817328046;騖,-8.24993274968;喟,-7.53081008272;瘞,-9.11493018717;鮫,-5.59594976985;碭,-7.76038452437;锴,-8.99714715152;榷,-5.51419911983;訶,-6.3580898219;髁,-6.46698391014;鑊,-7.86216721868;罘,-8.24993274968;桢,-8.05887751292;蛩,-6.44943960049;鯫,-11.1943717289;飭,-5.8960543623;饬,-5.8960543623;巯,-8.48632152775;勱,-8.55531439924;畴,-6.52154289439;軹,-8.79647645605;轸,-7.89853486285;缃,-7.34422412714;阗,-6.97486402368;儇,-9.40261225962;钊,-6.98967910946;鲚,-7.41018209493;锟,-7.93627519083;蘩,-7.97549590398;枨,-10.0957594402;笫,-6.82492387638;疴,-9.11493018717;誶,-7.24312801027;貺,-9.40261225962;暾,-8.14984929113;驁,-11.1943717289;鯀,-7.38770923908;陉,-7.53081008272;铊,-7.16902003812;觌,-8.14984929113;滎,-7.24312801027;杓,-6.34234146493;祗,-7.20538768229;灝,-7.10002716663;詡,-6.38218737348;腧,-7.97549590398;鵯,-8.48632152775;坳,-7.03548864549;泺,-7.58345381621;嶁,-7.53081008272;簀,-9.80807736773;澍,-8.42178300661;渌,-6.04687725204;搐,-8.62942237139;嘜,-10.5012245483;鄞,-7.43317161316;谠,-6.54998082971;蔦,-9.58493381642;耨,-7.82707589886;岫,-6.21763798643;媯,-6.11296736387;琰,-8.14984929113;邳,-6.87688361532;鎵,-6.57925121201;溷,-8.99714715152;贶,-9.40261225962;撻,-7.30255143074;愾,-9.2484615798;籀,-7.58345381621;驄,-8.79647645605;偈,-6.3580898219;諏,-7.05123700246;筚,-10.0957594402;埝,-8.42178300661;癜,-8.99714715152;鋟,-7.26254609613;酞,-9.80807736773;轢,-10.5012245483;荪,-7.76038452437;忭,-9.40261225962;闱,-6.98967910946;徂,-8.79647645605;欖,-7.10002716663;茕,-9.11493018717;琛,-6.64049483725;鮚,-9.80807736773;蠣,-7.66801120424;锱,-9.2484615798;钰,-8.3611583848;擐,-8.89178663586;瑛,-8.62942237139;篚,-9.40261225962;胨,-7.45670211057;镱,-9.40261225962;淶,-5.59966034925;蝽,-7.45670211057;笄,-7.1339287183;儈,-8.89178663586;簖,-10.5012245483;枧,-9.11493018717;搦,-6.31156980626;缬,-6.61966075035;峁,-5.51079196151;絀,-7.76038452437;僉,-6.44943960049;奘,-7.86216721868;叟,-6.93169185181;浠,-5.4707866269;胩,-7.6108527904;饩,-6.22455842928;噲,-8.3611583848;汶,-6.91770560984;棹,-7.05123700246;楸,-6.89030663565;杼,-8.0163178985;纂,-5.89106682079;騅,-7.66801120424;眇,-8.62942237139;钆,-8.42178300661;澌,-9.80807736773;萑,-7.97549590398;鼗,-7.26254609613;堙,-7.66801120424;馘,-9.40261225962;唛,-10.5012245483;錟,-8.0163178985;谡,-6.30402260063;涠,-7.05123700246;墚,-9.80807736773;耩,-8.99714715152;鬯,-7.97549590398;颮,-8.10332927549;厴,-6.82492387638;绂,-8.79647645605;裎,-8.48632152775;葑,-5.86649556006;岢,-6.21076510714;顙,-8.48632152775;畛,-7.6108527904;淠,-6.9039122877;楣,-7.30255143074;滢,-9.58493381642;橥,-8.99714715152;聩,-9.2484615798;櫺,-6.82492387638;崂,-6.23854467125;璇,-6.86363838857;霆,-7.93627519083;梏,-9.80807736773;宙,-7.24312801027;餚,-6.71703491437;纫,-6.9458764868;笮,-6.60940425018;醵,-8.10332927549;瀵,-7.45670211057;塄,-7.28234872342;鉈,-7.16902003812;譎,-8.1986394553;糗,-9.2484615798;彖,-8.14984929113;祚,-6.96026522425;蹠,-7.89853486285;桤,-7.08349786468;磯,-5.63754366715;筮,-7.53081008272;泷,-8.30399997096;佶,-9.40261225962;诹,-7.05123700246;髫,-8.79647645605;弁,-7.06723734381;庀,-6.54998082971;稃,-8.48632152775;嶂,-6.77553112105;礅,-8.70946507906;垆,-8.48632152775;讎,-6.46698391014;嬙,-7.97549590398;骘,-8.55531439924;锝,-6.96026522425;钜,-7.76038452437;袤,-8.48632152775;麈,-8.3611583848;鸫,-7.76038452437;隰,-7.34422412714;刳,-8.89178663586;澶,-6.38218737348;怿,-8.79647645605;掾,-6.60940425018;绀,-7.72863582605;鋈,-6.41524823574;赍,-5.87136174971;诎,-8.70946507906;闥,-7.1339287183;旒,-7.6108527904;嫘,-8.0163178985;镝,-9.40261225962;哜,-8.89178663586;鏞,-9.80807736773;滠,-8.89178663586;荩,-6.81234509418;寮,-6.08842625495;瓿,-7.05123700246;虻,-5.782725677;燔,-8.79647645605;鮃,-6.53093263474;疇,-6.52154289439;辋,-8.55531439924;洌,-6.38218737348;朐,-7.45670211057;莓,-8.62942237139;脔,-8.99714715152;嶗,-6.23854467125;鲭,-7.79317434719;騮,-8.48632152775;鄴,-5.41982018331;蒽,-7.76038452437;蔼,-6.45817328046;戾,-7.30255143074;绁,-8.48632152775;壅,-6.53093263474;嗇,-8.89178663586;惕,-7.82707589886;緗,-7.34422412714;筘,-9.11493018717;嵬,-7.38770923908;酴,-10.5012245483;蹶,-7.6108527904;懿,-5.02058562495;龀,-6.58920154286;鲂,-6.46698391014;锇,-7.1339287183;碚,-7.79317434719;澠,-8.14984929113;戩,-9.2484615798;阱,-8.79647645605;瞰,-8.24993274968;钲,-8.55531439924;逵,-7.45670211057;鉉,-9.40261225962;珈,-8.70946507906;遄,-7.36573033236;懔,-7.1339287183;壚,-8.48632152775;濠,-6.37409016325;胪,-5.94734765669;鱭,-7.41018209493;祯,-7.24312801027;
+S,h:非,0.0;
+S,j:宁,-4.89891000787;綏,-6.86627861995;沪,-3.26274605546;羅,-4.43837640756;娄,-7.91385942861;蜀,-4.79538133006;涉,-11.0199397593;绥,-6.86627861995;蒋,-6.38197975052;伊,-5.03600347865;希,-5.70673378029;芬,-6.95949674879;鄂,-6.31945939354;儒,-6.76669391452;榕,-8.62204448653;渔,-6.16012735497;湘,-4.77254183809;沅,-7.92889730597;枝,-11.0199397593;豫,-5.35120892274;傣,-7.33942855489;楚,-5.39833189287;焦,-8.45499040187;薩,-6.72948031818;萨,-6.72948031818;伪,-5.66492704911;維,-6.00486986817;申,-10.7322576869;韶,-9.47949471839;纳,-7.2433547248;濟,-5.22388200857;康,-5.68883256996;赞,-7.5438410695;徽,-6.86627861995;尼,-4.88581891182;貿,-12.118552048;贊,-7.5438410695;滇,-5.44399065619;荆,-6.72492450165;凉,-9.7206567752;荊,-6.72492450165;乌,-5.09123753396;烏,-5.09123753396;华,-3.82075942162;昆,-6.12708750089;陆,-9.92132747066;塔,-4.47602791377;泗,-6.9945880686;隸,-6.12209995938;塘,-5.81960280114;博,-7.28227014105;川,-4.63081828656;瑤,-6.27500763097;廣,-8.38088242972;卢,-6.44867112502;日,-2.75944690276;灤,-7.66420475175;盧,-6.44867112502;坦,-6.24362131715;韩,-4.3589378973;敦,-7.85587217096;瓯,-7.66420475175;畲,-6.66323093264;陸,-9.92132747066;藏,-3.97010638176;遼,-4.27588057302;企,-7.30636769263;技,-7.77474662615;缅,-10.1726418989;蘇,-4.66036589066;疆,-6.98865333308;沈,-6.46957780984;納,-7.2433547248;澎,-9.47949471839;索,-6.91454536092;贝,-5.9447659441;府,-5.21580931084;瀟,-10.1726418989;莞,-8.6528161452;津,-5.58621775578;粤,-5.35929677734;厦,-6.47664497706;宪,-7.82809260685;圭,-7.48382305977;京,-3.84394010179;港,-4.10025590949;辽,-4.27588057302;汉,-3.5833224941;阳,-9.92132747066;憲,-7.82809260685;隴,-6.31341707908;廈,-6.47664497706;楷,-9.81596695501;欽,-6.45559156786;阿,-4.21606461084;籃,-7.08159944559;参,-6.62138382271;陇,-6.31341707908;篆,-7.33106030522;哈,-4.74329626999;晋,-4.83923321259;顏,-8.89967622313;漢,-3.5833224941;孕,-6.46957780984;黔,-5.79419308562;穗,-10.0391105063;浙,-5.35582254107;魯,-8.68456484352;湛,-9.34596332576;彝,-6.15754670838;监,-4.91217475653;奥,-4.10653380884;牧,-5.64775254422;旦,-7.19129836284;闽,-5.60532193709;摩,-4.91143319179;錦,-6.48019737867;杭,-4.99085834865;滬,-3.26274605546;淮,-4.9924647747;危,-7.8844455434;泰,-4.86154934091;菲,-5.88807060042;维,-6.00486986817;叶,-5.09568396192;陕,-5.99605923849;基,-12.118552048;广,-8.38088242972;篮,-7.08159944559;鲁,-8.68456484352;漁,-6.16012735497;挪,-10.0391105063;梅,-10.5091141356;妇,-6.4248199092;喀,-5.53514282584;匈,-6.71138027654;甌,-7.66420475175;宏,-7.50343153116;導,-7.65264392935;唐,-5.38753394752;邕,-8.14826013445;朔,-6.2380190616;侗,-6.68483004445;甘,-6.79067587921;轎,-6.01375881559;貝,-5.9447659441;澄,-9.02750959464;澧,-8.00767818383;蚩,-8.04101460409;昌,-6.60512330184;甬,-8.12956800144;斯,-6.4248199092;羽,-7.97541732161;嘉,-4.12493205317;澳,-5.13661737084;粵,-5.35929677734;德,-3.57666624399;耶,-5.60978291103;贸,-12.118552048;玻,-6.22139818036;沽,-6.39824027139;颜,-8.89967622313;閩,-5.60532193709;參,-6.62138382271;桂,-6.16271467854;襄,-4.5439935638;穆,-7.52343219787;蓉,-7.26652178408;霍,-7.14181830558;雍,-7.89904434282;菏,-7.5438410695;羌,-6.57728850284;僑,-8.62204448653;歐,-4.5409182154;韓,-4.3589378973;乒,-7.77474662615;法,-2.55347861632;浔,-7.55420385653;紐,-6.21865469442;聖,-4.2510634793;洪,-9.12281977445;美,-2.85419708772;察,-5.17542962518;瑞,-4.97414486768;峡,-5.54907062759;哥,-9.12281977445;佤,-8.28991065151;寧,-4.89891000787;婦,-6.4248199092;靖,-7.92889730597;纽,-6.21865469442;秦,-7.1627249904;畬,-6.66323093264;華,-3.82075942162;格,-4.9631557461;英,-3.75544287197;兰,-5.29309201175;石,-7.37361991964;瑶,-6.27500763097;渝,-6.23244801655;智,-6.61322051207;峽,-5.54907062759;琼,-6.44522878083;乾,-4.97889171204;冀,-6.65896653386;沂,-6.9652604535;厄,-6.520130089;吉,-5.02017640941;埃,-6.01599345339;意,-7.85587217096;緬,-10.1726418989;丑,-12.118552048;斐,-6.72948031818;漓,-9.12281977445;監,-4.91217475653;皖,-5.71995711347;洛,-5.47606524663;亚,-3.87684888827;帝,-4.73642768226;贛,-5.88414132228;亞,-3.87684888827;冠,-11.0199397593;圣,-4.2510634793;欧,-4.5409182154;沭,-8.00767818383;侨,-8.62204448653;武,-6.3285918771;蘭,-5.29309201175;醜,-12.118552048;郑,-9.92132747066;承,-7.08811412661;漳,-6.74327364032;隶,-6.12209995938;丹,-6.2549208724;浦,-7.04964784578;涼,-9.7206567752;郴,-8.53503310954;婁,-7.91385942861;鄭,-9.92132747066;葉,-5.09568396192;俄,-4.23510569386;潇,-10.1726418989;晉,-4.83923321259;瓊,-6.44522878083;苏,-4.66036589066;蔣,-6.38197975052;黎,-6.5617239863;汕,-7.91385942861;委,-4.5373422218;罗,-4.43837640756;秘,-6.88211008517;济,-5.22388200857;陝,-5.99605923849;孟,-5.64466135165;葡,-6.78583325474;珠,-6.7024516458;赣,-5.88414132228;波,-4.19484171403;奧,-4.10653380884;滦,-7.66420475175;恩,-6.8558618591;陽,-9.92132747066;钦,-6.45559156786;柬,-7.08811412661;潯,-7.55420385653;荷,-7.80106393446;巴,-4.30982274126;捷,-5.7834977965;延,-5.6744207913;锦,-6.48019737867;固,-4.99891640998;偽,-5.66492704911;导,-7.65264392935;轿,-6.01375881559;
+S,k:們,-0.956927984642;儀,-6.29695583977;者,-1.43434803524;界,-5.4942901334;器,-7.42373900541;型,-1.40313183141;仪,-6.29695583977;们,-0.956927984642;式,-2.08345743976;炎,-7.15044567041;
+S,mg:乙,-3.72378926925;巳,-0.981252892078;甲,-3.49017441807;寅,-2.28620161374;辰,-4.58878670674;丙,-1.52656469191;癸,-2.32442282656;戊,-1.94084042971;
+S,m:則,-8.81582032003;袋,-11.0845038613;两,-3.56693772192;吨,-5.76352847091;輪,-8.56546420519;貳,-8.17578296478;方,-9.42627578474;场,-8.53897258974;亿,-4.81524976181;派,-9.93182435141;兆,-6.96682261895;盏,-12.8762633306;员,-11.4899689695;仟,-10.5736782376;周,-6.53238289645;班,-9.61816679255;歲,-5.0663162441;年,-1.74874302659;廿,-11.6235003621;栋,-9.45853664696;排,-9.23867717085;缕,-13.5694105111;五,-4.902935617;列,-9.27895106999;首,-5.33989939217;紙,-11.9599725987;枚,-6.56634505235;队,-9.88053105702;枪,-10.5248880734;朵,-9.23867717085;户,-7.49406448005;组,-8.43361207409;片,-8.57219823737;顶,-11.1715152383;號,-5.4390569637;级,-6.92301999629;声,-11.9599725987;味,-11.4899689695;秒,-7.22905120741;维,-8.974290661;倆,-6.15183010872;餐,-11.7776510419;間,-8.53245790872;宗,-9.04762193409;股,-5.71774933325;个,-3.41050584674;第,-5.55408320211;尾,-10.3113139731;隊,-9.88053105702;篇,-7.34287384185;顆,-7.78558532881;捌,-9.5620773259;裡,-8.59267676872;线,-9.45853664696;号,-5.4390569637;桶,-10.0140624496;數,-4.82094688119;響,-11.4899689695;頁,-6.68799920749;节,-7.16418205311;肆,-8.23187243143;床,-12.4707982225;阕,-13.5694105111;期,-7.14778824333;群,-11.6235003621;輯,-9.59911859758;週,-6.53238289645;阵,-13.5694105111;幅,-8.6641357327;葉,-10.0729029497;克,-6.07609326227;車,-9.67759021303;双,-5.27761340609;處,-7.7029424542;束,-12.18311615;几,-5.64606229921;门,-7.24864221689;八,-5.38183311554;杯,-9.76274802137;顿,-12.18311615;卷,-6.04377053609;刀,-11.4899689695;丈,-10.7361971671;成,-7.70862428767;堂,-12.18311615;碗,-10.2021146811;級,-6.92301999629;億,-4.81524976181;箱,-11.1715152383;圈,-10.0140624496;叁,-10.2735736451;所,-7.22027151976;筆,-8.63493657801;槍,-10.5248880734;桌,-11.6235003621;发,-7.05915217061;招,-11.6235003621;代,-8.28114348044;日,-2.57011459726;層,-7.53632428934;俩,-6.15183010872;番,-12.8762633306;轮,-8.56546420519;噸,-5.76352847091;七,-5.60629845216;載,-10.1036746083;程,-13.5694105111;玖,-8.71738024722;次,-5.69201332478;輩,-12.8762633306;样,-11.7776510419;家,-4.29113115615;纸,-11.9599725987;十,-5.34283703616;手,-7.07868697663;角,-9.63758487841;擔,-12.8762633306;余,-5.17145140764;盘,-10.1036746083;線,-9.45853664696;攤,-12.4707982225;章,-7.44036030108;陣,-13.5694105111;仨,-9.41052742778;六,-5.37104612117;顷,-10.0430499865;叶,-10.0729029497;幕,-9.01553361954;重,-11.1715152383;頂,-11.1715152383;分,-5.8892348707;月,-2.20469507333;尊,-10.1036746083;團,-8.35447475353;條,-6.27299724236;夜,-10.1354233067;趟,-11.0845038613;錠,-13.5694105111;锤,-13.5694105111;亩,-7.44472712024;帮,-12.8762633306;戶,-7.49406448005;尺,-9.42627578474;個,-3.41050584674;組,-8.43361207409;服,-12.8762633306;摊,-12.4707982225;雙,-5.27761340609;兜,-12.8762633306;汪,-13.5694105111;路,-7.88923790212;聲,-11.9599725987;整,-6.93477715327;百,-5.99536550576;樁,-13.5694105111;三,-3.4130652773;辈,-12.8762633306;倍,-4.87457335248;册,-8.89658167667;銖,-12.4707982225;斤,-8.56546420519;頭,-9.69820950023;支,-7.79485896559;許,-6.13633516224;记,-12.8762633306;節,-7.16418205311;届,-7.83931072816;遍,-11.3721859338;里,-8.59267676872;套,-6.82770981648;乙,-10.3913566808;盞,-12.8762633306;遭,-12.8762633306;目,-9.0807741414;台,-6.95468491093;间,-8.53245790872;具,-8.18491544835;盾,-11.7776510419;枝,-11.0845038613;座,-6.59212916951;段,-9.0807741414;張,-7.85898349376;羽,-13.5694105111;局,-9.50896750059;案,-12.18311615;半,-4.90121444618;面,-9.5440588204;句,-9.90584886501;胎,-10.7968217889;端,-13.5694105111;發,-7.05915217061;頃,-10.0430499865;包,-9.69820950023;颗,-7.78558532881;万,-3.90000107497;鄉,-11.2668254181;鎊,-5.70230501082;伍,-8.62776808853;二,-3.82082391982;頓,-12.18311615;檔,-9.30673063409;鬥,-12.18311615;扇,-10.9303531815;帧,-11.7776510419;天,-5.44200594844;馮,-8.21755237766;縷,-13.5694105111;卅,-10.4339162952;位,-6.11064781875;镑,-5.70230501082;道,-8.6567556254;柒,-11.3721859338;档,-9.30673063409;步,-9.03681101798;兩,-3.56693772192;部,-6.79290351876;只,-4.53378073295;彭,-9.61816679255;副,-10.4783680578;峰,-11.1715152383;类,-7.25405250961;幾,-5.64606229921;载,-10.1036746083;岁,-5.0663162441;開,-7.87905105681;笔,-8.63493657801;餘,-5.17145140764;垧,-12.8762633306;本,-8.87806262891;贰,-8.17578296478;点,-4.04469745145;眼,-10.6790387532;品,-10.4783680578;担,-12.8762633306;屆,-7.83931072816;對,-7.34089950754;闋,-13.5694105111;盤,-10.1036746083;員,-11.4899689695;幢,-10.4339162952;票,-9.44227612609;数,-4.82094688119;壹,-10.0430499865;份,-7.6805325528;封,-10.4783680578;門,-7.24864221689;把,-9.98589157268;丝,-12.18311615;捆,-13.5694105111;席,-8.6641357327;米,-4.39604537528;根,-7.91341870032;滴,-10.5248880734;元,-3.69278041277;种,-5.1598025304;行,-8.61358345353;盒,-10.6790387532;块,-7.48719160076;九,-5.70115624562;团,-8.35447475353;瓦,-8.80723657634;桩,-13.5694105111;曲,-11.3721859338;瓶,-10.3113139731;项,-6.77035464908;勺,-11.1715152383;一,-2.01917962756;點,-4.04469745145;辑,-9.59911859758;記,-12.8762633306;些,-12.4707982225;多,-2.45090636206;身,-11.3721859338;維,-8.974290661;萬,-3.90000107497;甲,-9.58042646457;場,-8.53897258974;款,-6.98600128898;幀,-11.7776510419;杆,-12.18311615;駕,-12.18311615;艘,-6.1985503446;四,-4.41765309659;棟,-9.45853664696;车,-9.67759021303;柱,-12.18311615;絲,-12.18311615;对,-7.34089950754;任,-9.61816679255;辆,-6.31170283398;下,-8.62776808853;冊,-8.89658167667;折,-7.22027151976;樣,-11.7776510419;锭,-13.5694105111;架,-6.11353382364;匹,-8.91545016098;等,-7.3041092984;打,-11.7776510419;著,-10.86136031;陸,-7.14941558299;姚,-8.6641357327;畝,-7.44472712024;条,-6.27299724236;幫,-12.8762633306;出,-10.1682131295;桿,-12.18311615;开,-7.87905105681;处,-7.7029424542;文,-10.0729029497;例,-7.4557283313;斗,-12.18311615;帖,-13.5694105111;錘,-13.5694105111;通,-10.2735736451;张,-7.85898349376;株,-10.3913566808;冯,-8.21755237766;種,-5.1598025304;头,-9.69820950023;回,-8.87806262891;着,-10.86136031;层,-7.53632428934;磅,-7.57295842252;陆,-7.14941558299;塊,-7.48719160076;响,-11.4899689695;罐,-13.5694105111;站,-11.2668254181;口,-9.37975576911;佰,-11.0044611537;棵,-10.6790387532;驾,-12.18311615;項,-6.77035464908;名,-5.38127709663;粒,-9.30673063409;则,-8.81582032003;輛,-6.31170283398;度,-7.0240608508;框,-12.4707982225;许,-6.13633516224;千,-6.28527570494;集,-9.32091526909;件,-7.30031422743;歌,-11.0044611537;類,-7.25405250961;乡,-11.2668254181;季,-9.42627578474;铢,-12.4707982225;页,-6.68799920749;起,-7.63187430605;零,-6.30888791305;批,-9.44227612609;寸,-8.74912894553;拾,-12.4707982225;
+S,ng:栀,-10.2771604446;薪,-10.2200020308;辅,-7.38352604109;阄,-9.30371129891;喉,-6.98132357862;氈,-7.32963027289;弊,-7.01005483666;餐,-7.27264334151;钬,-9.19835078325;裙,-6.98350460456;枕,-11.7240794276;渔,-9.70917640702;窗,-6.47180599951;脖,-7.88462711496;喙,-7.63810311501;尘,-6.50507586773;眚,-11.3186143194;麟,-8.65602649242;鉚,-10.3377850664;瘤,-11.5009358762;焦,-12.4172266081;鶩,-10.0193313353;阳,-6.60908411814;躯,-7.9342240561;譜,-8.14752915842;堰,-7.88462711496;岳,-11.1644636396;鬲,-9.1591300701;褶,-7.66363641701;尸,-5.49064957489;机,-4.80168187184;龄,-7.7585156552;础,-7.54585338135;铃,-7.25244063419;翅,-6.07071343882;谷,-5.60818730207;苇,-8.29009222307;兆,-11.1644636396;鞍,-7.10895891072;坊,-6.7860148263;母,-7.87393182585;雏,-8.54602559721;金,-4.65633341227;桐,-8.17589985555;陆,-8.1616138983;卒,-4.86682828075;乔,-10.4023235876;祖,-8.09973849458;烛,-7.29326262871;坚,-13.1103737887;寝,-8.06051778143;盟,-8.93598651878;荤,-7.72587872589;泣,-7.78736380954;身,-4.29797688341;楦,-10.6254671389;藩,-6.85462374692;士,-5.79316138032;坪,-10.5454244312;语,-5.5019993143;鉬,-7.39664098317;蒼,-10.4023235876;凱,-10.2771604446;铳,-8.50520360269;柵,-7.77283570898;痹,-8.28206005138;龕,-7.80210609128;菽,-9.64463788588;蕾,-12.4172266081;萃,-9.23917277777;庄,-9.01602922646;妆,-7.58094470117;臂,-9.42149433456;莺,-7.48997292296;稗,-9.34917367298;霭,-8.86187854663;鳄,-7.69872773682;餡,-8.18312010352;谣,-8.69153318088;厢,-8.19039286285;纤,-7.49724568229;倫,-9.19835078325;犬,-6.70184499762;歉,-8.3228820459;莲,-6.07598585876;溴,-7.80706888062;爷,-5.37406669213;犀,-8.30635274394;咸,-13.1103737887;頻,-7.12895957742;螺,-6.96618815455;欽,-9.12138974211;誼,-8.41902590645;鸿,-9.10304060345;疾,-6.55359543252;籃,-12.4172266081;雄,-6.96404453101;艇,-12.0117615;秆,-8.03519997344;蕉,-7.57698429995;塋,-10.2771604446;筍,-13.1103737887;虏,-6.34995909759;契,-7.02132891323;磐,-8.57777429552;鬢,-8.07342118626;仔,-7.48275267499;奸,-11.3186143194;蕙,-8.8908660835;柚,-8.728347154;孝,-5.87187694778;幟,-9.21855349057;緞,-7.17547959306;惠,-7.61320556338;叢,-9.67638658419;蛤,-8.58858521163;牧,-13.1103737887;姦,-11.3186143194;哨,-5.93411925666;衫,-7.25244063419;景,-6.04561476089;胰,-7.99838600032;味,-5.92954258963;史,-4.61522172814;杵,-12.0117615;维,-12.4172266081;腕,-7.76803953671;基,-4.88621027604;譽,-7.83225912945;巾,-7.4404928657;儀,-6.33272719504;隅,-7.79716780964;宇,-9.85227725066;耆,-8.1616138983;貉,-8.6330369742;渊,-7.29326262871;窍,-7.66795607816;辏,-8.87626728408;谎,-7.39334608727;傑,-9.10304060345;脐,-8.51525393854;鹜,-10.0193313353;芯,-6.87204916364;膛,-7.19417172607;业,-5.1265927197;龟,-13.1103737887;径,-5.92802167679;趣,-7.8900179636;麥,-6.15764514405;頦,-8.69153318088;岩,-7.85810036063;质,-4.93341992045;醫,-8.40084358737;踪,-7.3999467713;茬,-10.7124785159;侯,-8.42824256155;鐮,-7.93988979364;构,-7.96871023217;庵,-6.41953151126;籟,-9.28173239219;粹,-10.2200020308;贸,-13.1103737887;妻,-6.2026185097;石,-4.74098479203;搏,-8.49525327184;尾,-10.8077886957;壁,-5.94488031362;剂,-6.18871560453;盅,-9.47278762895;靄,-8.86187854663;寇,-9.03283634477;恆,-8.76656836682;泉,-8.26618670222;效,-6.83749678213;構,-7.96871023217;锶,-8.29009222307;苍,-10.4023235876;柏,-8.20509901024;僑,-7.78249761989;鱷,-7.69872773682;嗓,-9.93231995833;饥,-7.45438197786;钎,-9.85227725066;卜,-8.71592463401;域,-10.5454244312;瑞,-11.030932247;胡,-13.1103737887;祠,-7.13656417681;嗣,-6.75600374788;牢,-12.4172266081;鴿,-8.45641343852;羽,-9.81453692267;噪,-8.43754495422;諭,-6.51459327472;籮,-8.8908660835;棱,-7.20501194062;兰,-10.8077886957;色,-4.86919763818;靴,-7.5651963442;畸,-8.83370766966;智,-5.72700564169;柿,-7.59694504251;羔,-9.47278762895;态,-8.728347154;帅,-13.1103737887;垄,-8.20509901024;肆,-9.49945587603;鰉,-11.5009358762;蚊,-7.65933533511;式,-5.98992941629;咎,-8.52540631001;瀑,-8.27409188173;臆,-10.3377850664;贓,-8.90568116929;媒,-7.4404928657;帕,-6.99448166319;硯,-8.01050736085;茗,-7.77283570898;袖,-11.5009358762;脛,-8.40989342289;璞,-10.3377850664;堡,-6.56790182817;责,-6.3453348119;犢,-8.77964044839;帥,-13.1103737887;澤,-9.30371129891;茧,-7.26682937165;邦,-6.11827736126;夫,-8.22002466046;溪,-10.9131492113;鎬,-10.1659348095;伯,-7.80706888062;龜,-13.1103737887;锋,-8.96723906229;阵,-5.73136566105;隶,-9.23917277777;钞,-6.73364684078;樽,-8.80630869547;殼,-10.6254671389;校,-5.90103353207;赃,-8.90568116929;嫂,-6.85270620079;际,-6.57803949646;柄,-11.7240794276;葉,-10.9131492113;珍,-7.35463157509;態,-8.728347154;囊,-5.99560434031;杏,-7.25530186648;鹊,-7.31128113422;塑,-7.5651963442;槐,-9.34917367298;钽,-8.14752915842;鋒,-8.96723906229;菇,-8.39187491738;鸥,-8.53566281017;廚,-7.7585156552;鉻,-11.7240794276;辰,-7.16495318007;勢,-4.85298813295;濤,-11.5009358762;贿,-8.50520360269;葩,-11.7240794276;巨,-6.7370539991;楫,-9.74307795869;仪,-6.33272719504;鉭,-8.14752915842;召,-8.42824256155;蓮,-6.07598585876;顱,-7.96287931186;凰,-8.30635274394;軌,-7.08692619572;筒,-7.23544305783;陵,-6.09376410478;筷,-9.06732252084;壶,-7.44394710057;豹,-11.5009358762;板,-4.66060327358;链,-6.28600011863;稀,-12.4172266081;纪,-8.1616138983;涅,-7.14936844905;辉,-9.04993077813;师,-4.27603681466;伎,-7.89543803107;爐,-12.4172266081;纓,-8.21253398873;儒,-7.57698429995;涕,-8.87626728408;术,-7.03502775759;灘,-6.73194760503;丘,-10.065851351;妝,-7.58094470117;粟,-10.4713164591;霞,-9.42149433456;碧,-6.50914366995;錦,-6.53251243096;義,-5.16907821777;洪,-8.90568116929;鳶,-10.1659348095;舰,-5.50299236304;褲,-7.22984080228;蛟,-7.99838600032;羹,-7.83737423011;丸,-7.28142817107;銻,-7.28732789319;镞,-8.02277745345;禽,-7.39664098317;貿,-13.1103737887;眾,-4.4976886158;巅,-8.86187854663;壇,-7.1623387995;籠,-11.3186143194;綬,-8.74092593621;勋,-7.13402287938;蕊,-8.38298596997;臍,-8.51525393854;桌,-6.99448166319;坎,-6.97264673459;仓,-5.59448470346;兒,-9.55502572719;痕,-7.44741330854;策,-5.99723167997;埙,-9.37270417039;浚,-7.58492084955;坞,-7.3802740057;毡,-7.32963027289;窑,-13.1103737887;監,-7.00112620591;僧,-10.3377850664;武,-8.41902590645;矩,-8.07342118626;鸽,-8.45641343852;辫,-8.25056138432;燭,-7.29326262871;塬,-7.62143606252;糯,-7.71674624233;菱,-7.1728375836;绳,-7.03502775759;淵,-7.29326262871;颅,-7.96287931186;鍶,-8.29009222307;蟹,-6.90379786195;幸,-7.19957714464;櫻,-9.30371129891;槽,-6.11552380284;胫,-8.40989342289;技,-7.79225379483;憂,-10.5454244312;臀,-7.63810311501;鈷,-7.44741330854;帖,-7.69872773682;脍,-10.7124785159;棧,-8.1199412019;吏,-6.54229587727;砧,-8.9994999245;檐,-7.26682937165;栗,-9.06732252084;錘,-7.22705140019;隘,-9.10304060345;鶚,-8.02277745345;袜,-8.44693469457;钼,-7.39664098317;冢,-6.96618815455;鲤,-7.47916200686;性,-8.49525327184;厦,-11.7240794276;弩,-7.39006201207;喪,-8.6330369742;夭,-9.04993077813;裳,-8.87626728408;辮,-8.25056138432;帳,-6.97697574568;憲,-10.5454244312;纖,-7.49724568229;钴,-7.44741330854;样,-7.89543803107;圹,-11.030932247;隸,-9.23917277777;稻,-6.77177971047;嶺,-12.0117615;椽,-8.81991434753;肢,-7.3022312987;簿,-6.98569039778;穴,-6.39620325877;鍁,-11.5009358762;狀,-4.52309498969;酊,-10.7124785159;廊,-6.97697574568;賄,-8.50520360269;篆,-7.2382559992;杉,-6.91596839757;廈,-11.7240794276;屏,-6.76473742785;翎,-8.8908660835;狐,-8.74092593621;鑰,-8.58858521163;敕,-7.14166622869;遗,-7.99838600032;钥,-8.58858521163;郎,-6.05075616039;瑟,-7.91741693779;锤,-7.22705140019;桑,-7.48997292296;陣,-5.73136566105;涧,-7.50090199349;彩,-6.21570374924;滨,-6.90379786195;業,-5.1265927197;磬,-8.92071904665;屯,-10.2771604446;危,-8.64446567002;乳,-6.71845667528;軒,-9.7781692785;敵,-5.15987135387;職,-5.01112322688;叶,-10.9131492113;役,-5.74392864035;绸,-7.57303952166;蠅,-7.46492689103;痺,-8.28206005138;兽,-6.41953151126;箫,-8.05412798333;屿,-7.97457535163;翠,-7.05593444241;檁,-11.5009358762;堂,-10.5454244312;妇,-6.97264673459;梭,-7.79225379483;骏,-7.8900179636;谊,-8.41902590645;袍,-6.63957428489;餌,-8.23517646548;劑,-6.18871560453;涯,-8.59951428216;臘,-7.33272146545;隙,-7.2697321313;务,-8.83370766966;匠,-6.81142454182;垣,-8.19039286285;沥,-8.49525327184;贤,-6.3169076561;木,-7.05593444241;宫,-6.34188057703;榆,-7.70769640681;傭,-7.9342240561;斯,-10.4713164591;嬰,-7.9342240561;钵,-7.38352604109;父,-5.58797355729;纹,-5.95497748678;肽,-7.58891287082;績,-8.48540097539;象,-7.82717005994;桂,-10.065851351;资,-5.68859799503;婆,-6.82997794972;雉,-7.76326625796;友,-7.0701190774;舶,-8.69153318088;棍,-6.65832483424;族,-4.9978460252;苑,-7.30523881976;子,-3.81983687471;恒,-8.76656836682;糕,-7.78736380954;畔,-7.11143722673;仙,-5.45972923724;蹄,-7.4404928657;虞,-8.8908660835;塢,-7.3802740057;婦,-6.97264673459;滩,-6.73194760503;轨,-7.08692619572;毫,-11.1644636396;公,-5.00597248076;緯,-6.59418071263;狱,-6.78243700495;俳,-8.64446567002;釷,-8.22757186609;旨,-5.67493576886;盹,-9.01602922646;壽,-7.83225912945;乾,-8.61056411835;威,-6.54792969498;廁,-8.56707900641;圃,-7.62973486534;绪,-8.25834352476;鹭,-8.90568116929;笋,-13.1103737887;蠍,-8.05412798333;甏,-10.065851351;階,-6.01613894275;胁,-7.7585156552;缨,-8.21253398873;墒,-7.93988979364;谕,-6.51459327472;阙,-9.85227725066;笛,-8.69153318088;瀝,-8.49525327184;农,-5.76759459935;襄,-10.4023235876;模,-6.60160465171;梢,-6.40106944842;涤,-8.69153318088;温,-9.97487957275;侨,-7.78249761989;遺,-7.99838600032;倭,-7.43361998641;障,-7.80210609128;樱,-9.30371129891;靶,-12.4172266081;輳,-8.87626728408;夷,-6.20964312463;状,-4.52309498969;丹,-8.66772253219;垸,-10.1146415151;医,-8.40084358737;钺,-8.61056411835;政,-5.71281225315;謠,-8.69153318088;诀,-7.60098545205;荷,-6.05161563616;义,-5.16907821777;泊,-6.47442723299;凌,-13.1103737887;体,-4.98711246956;客,-5.26222070248;展,-10.4023235876;巔,-8.86187854663;鴨,-6.46919161894;鹄,-7.70769640681;珠,-5.81192868717;佣,-7.9342240561;飢,-7.45438197786;履,-8.80630869547;跤,-8.1616138983;慧,-7.14166622869;繩,-7.03502775759;陽,-6.60908411814;荫,-9.7781692785;質,-4.93341992045;釬,-9.85227725066;目,-4.94217085844;橱,-9.42149433456;瓤,-8.71592463401;轿,-6.290357424;楷,-10.065851351;棕,-6.75426612798;鑑,-8.70365454141;邑,-6.69855552097;臼,-8.17589985555;腔,-11.030932247;境,-4.96685638288;蜂,-11.7240794276;宅,-6.57658495074;镉,-10.4713164591;皇,-5.2409720761;鴆,-8.26618670222;栈,-8.1199412019;钋,-8.90568116929;謊,-7.39334608727;芒,-7.24958756521;頰,-7.31128113422;礎,-7.54585338135;疑,-7.40659131402;蛙,-7.01229950651;園,-5.90771259215;厕,-8.56707900641;鈔,-6.73364684078;崖,-6.55786590164;鼎,-6.51459327472;馅,-8.18312010352;枝,-11.1644636396;帜,-9.21855349057;窟,-6.3453348119;碣,-9.85227725066;龛,-7.80210609128;隧,-9.52685485022;锦,-6.53251243096;匪,-6.98788097916;鞭,-12.4172266081;窯,-13.1103737887;镜,-6.05592413054;闕,-9.85227725066;纬,-6.59418071263;碳,-9.93231995833;鈴,-7.25244063419;稈,-8.03519997344;頸,-6.290357424;鹞,-9.17854815595;徽,-8.9994999245;昼,-8.1616138983;势,-4.85298813295;腋,-8.07342118626;菅,-12.4172266081;舷,-8.13364004626;案,-5.35417844473;詔,-5.79249759005;鲸,-7.22705140019;釙,-8.90568116929;塘,-9.61386622721;博,-7.9063671016;馆,-5.9541971512;虜,-6.34995909759;櫟,-7.44741330854;跡,-6.94705898464;池,-6.84697552609;形,-4.54725166537;畦,-10.1146415151;秩,-7.3483224059;艦,-5.50299236304;麓,-7.24958756521;髯,-7.80706888062;绩,-8.48540097539;壳,-10.6254671389;椒,-7.20229085051;籁,-9.28173239219;婴,-7.9342240561;榕,-9.97487957275;禾,-7.26393501362;幼,-7.57698429995;竿,-7.58094470117;脉,-5.58581256239;颈,-6.290357424;簋,-8.93598651878;莊,-9.01602922646;酬,-7.45438197786;锑,-7.28732789319;岐,-8.86187854663;栓,-8.19771890294;檔,-12.0117615;蘗,-10.0193313353;帘,-7.78736380954;肘,-7.55354572698;君,-10.6254671389;輝,-9.04993077813;府,-5.12727484797;戟,-7.29029085833;妞,-8.59951428216;贡,-8.9994999245;垢,-7.98640980927;丧,-8.6330369742;膝,-6.75426612798;簫,-8.05412798333;宪,-10.5454244312;札,-8.24283933822;柳,-6.97697574568;樯,-9.19835078325;躬,-8.13364004626;農,-5.76759459935;茵,-9.64463788588;碟,-7.79225379483;帷,-8.29818943331;鰻,-8.40989342289;玺,-8.728347154;缽,-7.38352604109;稿,-6.42701284291;憾,-9.06732252084;埂,-8.01662358787;獅,-9.97487957275;狄,-9.17854815595;祉,-11.1644636396;菊,-6.97264673459;檣,-9.19835078325;槎,-9.12138974211;雹,-8.44693469457;術,-7.03502775759;習,-13.1103737887;孕,-8.70365454141;苔,-6.68550476477;鹗,-8.02277745345;棘,-7.0281548783;汛,-8.86187854663;機,-4.80168187184;档,-12.0117615;矢,-7.20501194062;旦,-8.37417534028;泽,-9.30371129891;廬,-7.50090199349;良,-12.4172266081;峰,-10.8077886957;獵,-7.31736018029;駿,-7.8900179636;时,-1.96320725959;腹,-5.97787623702;胸,-5.9249867731;寺,-5.25057460812;综,-7.36417059814;婿,-8.39187491738;體,-4.98711246956;紀,-8.1616138983;炉,-12.4172266081;脈,-5.58581256239;斋,-5.98509069717;刊,-7.29326262871;鬃,-8.56707900641;栎,-7.44741330854;馓,-9.47278762895;袂,-9.39680172197;茔,-10.2771604446;林,-5.1060082237;栅,-7.77283570898;涛,-11.5009358762;素,-8.12676716697;鸢,-10.1659348095;銥,-10.2771604446;墩,-10.7124785159;館,-5.9541971512;疫,-8.34819985388;爪,-6.56502412834;亭,-5.63390140751;芳,-8.98323940363;讯,-5.18413226551;膳,-6.79140567493;猴,-6.34303066341;喻,-10.3377850664;爺,-5.37406669213;朋,-8.3228820459;殿,-11.030932247;況,-10.8077886957;時,-1.96320725959;竅,-7.66795607816;獄,-6.78243700495;棉,-6.15097527654;祈,-9.85227725066;跋,-7.45788460841;黍,-8.33125029557;膾,-10.7124785159;诏,-5.79249759005;镐,-10.1659348095;寢,-8.06051778143;魔,-6.3169076561;壙,-11.030932247;婚,-5.93871696591;峡,-13.1103737887;鵠,-7.70769640681;臣,-11.7240794276;櫥,-9.42149433456;孤,-7.48997292296;忧,-10.5454244312;葦,-8.29009222307;慨,-9.7781692785;巫,-9.64463788588;园,-5.90771259215;佬,-7.14679444506;铱,-10.2771604446;镰,-7.93988979364;凳,-7.40659131402;典,-6.36044259489;藻,-6.62573855304;艺,-7.1914799344;寿,-7.83225912945;韁,-8.15454673108;餃,-8.52540631001;舅,-11.030932247;倉,-5.59448470346;紋,-5.95497748678;犊,-8.77964044839;阍,-9.37270417039;釋,-6.8642670232;炎,-6.66624253198;民,-4.70344199152;赂,-9.26022618697;众,-4.4976886158;膘,-9.19835078325;帝,-6.64112347188;果,-5.39124394777;警,-7.3802740057;鳇,-11.5009358762;钦,-9.12138974211;憨,-7.62143606252;蘭,-10.8077886957;綜,-7.36417059814;谱,-8.14752915842;爵,-6.93242967463;宴,-7.00112620591;氏,-5.50597743988;銀,-4.55646301433;鴻,-9.10304060345;帽,-8.79288567514;猿,-6.95764109397;汁,-6.93450651857;廂,-8.19039286285;範,-11.1644636396;蝇,-7.46492689103;垠,-11.3186143194;筏,-8.01662358787;职,-5.01112322688;屑,-9.81453692267;楓,-10.0193313353;盒,-8.64446567002;遙,-7.79716780964;秘,-7.14679444506;蝎,-8.05412798333;晝,-8.1616138983;柜,-7.10648672157;污,-7.79716780964;柑,-8.54602559721;诺,-8.25056138432;驥,-11.030932247;雀,-7.3999467713;恩,-6.90178376258;繭,-7.26682937165;腠,-10.6254671389;鸩,-8.26618670222;盲,-7.77283570898;閣,-6.09197198961;银,-4.55646301433;荒,-7.35780114985;勺,-9.17854815595;幽,-7.31128113422;翼,-6.11644081345;卿,-7.77283570898;裾,-9.34917367298;銃,-8.50520360269;禅,-6.45493343831;魄,-8.24283933822;戈,-9.52685485022;脊,-6.65203550533;颏,-8.69153318088;猎,-7.31736018029;徑,-5.92802167679;帐,-6.97697574568;冕,-8.728347154;途,-6.93658768478;钗,-8.25056138432;際,-6.57803949646;鸭,-6.46919161894;黛,-8.1199412019;墟,-7.17547959306;澡,-8.36544166031;劣,-11.7240794276;索,-9.28173239219;冥,-7.36098080277;伦,-9.19835078325;箩,-8.8908660835;溫,-9.97487957275;礪,-8.71592463401;維,-12.4172266081;谬,-10.2771604446;梯,-6.89177366899;鬮,-9.30371129891;辱,-7.6854237712;媳,-8.51525393854;洲,-6.80592498626;况,-10.8077886957;铆,-10.3377850664;眶,-8.39187491738;券,-6.40595943371;閽,-9.37270417039;琼,-9.89149796381;翁,-6.87400419847;鏡,-6.05592413054;櫃,-7.10648672157;訊,-5.18413226551;資,-5.68859799503;鯉,-7.47916200686;介,-9.1591300701;腊,-7.33272146545;俑,-7.59694504251;櫓,-7.61731234534;燕,-10.4023235876;桔,-10.9131492113;鳗,-8.40989342289;杖,-6.83938535682;篙,-8.83370766966;雛,-8.54602559721;藝,-7.1914799344;鼻,-5.95185979135;壟,-8.20509901024;习,-13.1103737887;骡,-7.67229447975;塤,-9.37270417039;褐,-7.95708219418;衣,-5.47121261702;襪,-8.44693469457;胯,-8.24283933822;忱,-9.39680172197;酋,-8.21253398873;勳,-7.13402287938;鵲,-7.31128113422;釵,-8.25056138432;署,-6.68875152087;瓷,-6.44851904813;蝶,-8.15454673108;饺,-8.52540631001;馨,-8.36544166031;輔,-7.38352604109;企,-4.99874571037;刃,-7.32654860635;椅,-7.19687078304;澗,-7.50090199349;簇,-7.84251562961;貌,-6.93035713502;鳳,-7.41328030217;瓣,-8.29818943331;庐,-7.50090199349;梔,-10.2771604446;銘,-7.78736380954;丛,-9.67638658419;膚,-7.75378751401;益,-9.10304060345;濱,-6.90379786195;樣,-7.89543803107;帚,-8.80630869547;肤,-7.75378751401;骨,-5.17442868532;丫,-9.61386622721;禪,-6.45493343831;蔭,-9.7781692785;責,-6.3453348119;宮,-6.34188057703;褂,-7.17020253596;液,-5.8477451877;簷,-7.26682937165;沼,-7.99237997626;軀,-7.9342240561;轩,-9.7781692785;瓊,-9.89149796381;鷺,-8.90568116929;卉,-9.64463788588;籍,-6.43834084322;频,-7.12895957742;释,-6.8642670232;铌,-8.1616138983;顏,-8.1405604891;槌,-7.61731234534;迹,-6.94705898464;緒,-8.25834352476;慕,-9.19835078325;鷂,-9.17854815595;陸,-8.1616138983;骥,-11.030932247;觚,-9.44681214255;阁,-6.09197198961;齡,-7.7585156552;祥,-8.34819985388;裤,-7.22984080228;孩,-8.8908660835;铬,-11.7240794276;息,-10.9131492113;篮,-12.4172266081;影,-9.30371129891;滌,-8.69153318088;饵,-8.23517646548;葷,-7.72587872589;锨,-11.5009358762;幻,-10.4023235876;偿,-9.37270417039;蚁,-7.2104764351;漁,-9.70917640702;航,-6.15478118028;梅,-7.25530186648;文,-4.66081724598;檀,-8.83370766966;誉,-7.83225912945;庭,-7.1623387995;律,-7.35780114985;钍,-8.22757186609;娃,-5.73888449346;規,-6.56934378949;謬,-10.2771604446;庑,-7.43020117966;概,-11.3186143194;世,-4.70344199152;缎,-7.17547959306;脅,-7.7585156552;轎,-6.290357424;砚,-8.01050736085;睛,-8.22002466046;鼠,-9.97487957275;愤,-10.8077886957;斧,-6.99448166319;椰,-9.23917277777;檩,-11.5009358762;枫,-10.0193313353;岭,-12.0117615;蔬,-9.47278762895;鈮,-8.1616138983;缰,-8.15454673108;阶,-6.01613894275;芹,-11.5009358762;砺,-8.71592463401;璽,-8.728347154;騾,-7.67229447975;仁,-6.71011634337;址,-7.3514720148;鏃,-8.02277745345;鶯,-7.48997292296;兄,-5.4985313891;症,-6.20161900936;埠,-7.9342240561;闌,-8.37417534028;敌,-5.15987135387;肌,-6.30243884498;监,-7.00112620591;材,-7.81205642213;篓,-10.0193313353;賢,-6.3169076561;僕,-6.37459377444;兔,-6.82810704178;鷗,-8.53566281017;癖,-8.92071904665;務,-8.83370766966;塚,-6.96618815455;畜,-6.88978361858;鉞,-8.61056411835;廡,-7.43020117966;源,-5.1486549727;铭,-7.78736380954;凯,-10.2771604446;笼,-11.3186143194;壑,-7.97457535163;杰,-9.10304060345;奴,-6.43077460283;巷,-6.94285729779;晶,-9.93231995833;竹,-5.7637186255;獸,-6.41953151126;蟻,-7.2104764351;簾,-7.78736380954;峽,-13.1103737887;姿,-7.9342240561;丁,-10.4023235876;磁,-6.09018308037;范,-11.1644636396;堅,-13.1103737887;禄,-7.98047507375;唇,-6.51459327472;弋,-9.37270417039;颊,-7.31128113422;簍,-10.0193313353;意,-4.50370559083;阑,-8.37417534028;辐,-8.1405604891;鬓,-8.07342118626;鯨,-7.22705140019;蔗,-8.29009222307;庖,-7.91187675741;鎘,-10.4713164591;肚,-6.95339480309;帛,-7.58492084955;償,-9.37270417039;語,-5.5019993143;侠,-9.47278762895;鬣,-9.26022618697;貢,-8.9994999245;砥,-9.61386622721;憤,-10.8077886957;麦,-6.15764514405;厨,-7.7585156552;鉴,-8.70365454141;喬,-10.4023235876;颜,-8.1405604891;枰,-8.20509901024;速,-5.68680534442;逆,-7.50457172238;輻,-8.1405604891;嶼,-7.97457535163;儿,-9.55502572719;賂,-9.26022618697;桅,-8.28206005138;规,-6.56934378949;仆,-6.37459377444;鏈,-6.28600011863;齋,-5.98509069717;郊,-7.77765499541;屍,-5.49064957489;訣,-7.60098545205;驹,-8.65602649242;綢,-7.57303952166;委,-11.030932247;駒,-8.65602649242;橙,-7.87393182585;坛,-7.1623387995;苞,-7.43361998641;幡,-8.16873136607;俠,-9.47278762895;季,-6.18871560453;棺,-5.94797629132;遥,-7.79716780964;凤,-7.41328030217;物,-4.31827985917;寨,-5.02365586837;旬,-10.3377850664;酯,-7.28142817107;狮,-9.97487957275;蘖,-10.0193313353;翰,-7.88462711496;哲,-10.065851351;塵,-6.50507586773;绶,-8.74092593621;橹,-7.61731234534;司,-5.23944419192;壺,-7.44394710057;籽,-8.21253398873;師,-4.27603681466;祿,-7.98047507375;諾,-8.25056138432;
+S,nr:沃,-7.01537573904;閏,-7.28652850954;娄,-8.19872925616;冉,-7.19270975432;眭,-9.78796446128;蒋,-6.79724472955;鞠,-7.80009011313;侍,-5.34179000678;昌,-6.82269139521;郁,-7.37205068298;邓,-5.78976375961;欒,-9.60564290449;谯,-7.49542970414;阎,-6.97255574186;潘,-6.51081972829;趙,-4.69421426047;玮,-6.15565535866;矛,-12.0905495543;贞,-6.45219488494;阮,-6.30672437194;楚,-5.31976013037;焦,-8.30635992036;薩,-6.08666248717;萨,-6.08666248717;貫,-5.67381727176;笪,-8.17852654885;琳,-7.9796756901;杜,-6.45933777245;辉,-6.04791672059;玲,-7.9796756901;康,-6.38676707962;禹,-6.58929134373;鐸,-7.32837561948;鬱,-7.37205068298;羽,-5.75549530278;霞,-12.0905495543;贾,-4.96687676907;燁,-8.99950710092;桀,-7.88585693488;毅,-7.06011163288;仇,-12.0905495543;酆,-7.53667266267;泠,-8.12025764072;奎,-7.41772071981;豐,-6.94305507746;賓,-10.7042551932;毕,-10.7042551932;乔,-6.42412286616;咸,-7.8710418491;胥,-8.10156550771;博,-5.2782044601;乜,-8.24040195256;苟,-10.1446394052;池,-7.07326971746;卢,-6.79724472955;寥,-8.01301211037;釧,-8.26190815779;盧,-6.79724472955;敦,-7.17789466854;巩,-8.45296339455;周,-3.47206411138;锐,-7.11381581185;雯,-7.90089481225;楮,-9.20017779638;凱,-6.32849817149;鳳,-6.74344202356;杲,-8.42698790814;鉴,-6.63522843892;饶,-11.3974023737;闫,-7.38101935296;蕾,-7.59073988394;鐃,-7.99620499205;瑪,-5.85222492924;茅,-6.49212759528;庄,-5.11794330297;閆,-7.38101935296;傈,-9.20017779638;莊,-5.11794330297;伍,-8.40167010016;鵬,-5.59679571442;甑,-7.42711046016;璐,-8.50703061582;矯,-6.97255574186;刘,-4.09221415832;衛,-10.298790085;龚,-7.47542903743;輝,-6.04791672059;府,-4.61464358491;雄,-6.44157531611;蔡,-5.39351530661;莢,-7.12770492401;綦,-10.298790085;倫,-6.40696978694;宪,-7.16329586912;弭,-8.37697748757;榮,-7.73384072759;岑,-8.26190815779;邰,-9.25733621022;吳,-3.43550929617;厲,-7.29475900868;麴,-9.04602711655;紹,-6.12440281515;勵,-8.65656234979;薛,-6.24700513724;欽,-6.15301334919;鑑,-6.63522843892;韋,-6.16629375686;祁,-7.88585693488;灃,-7.39006918848;睢,-6.78724464622;狄,-6.64813184375;蹇,-7.48537936829;賈,-4.96687676907;瑋,-6.15565535866;俊,-5.69029210897;沣,-7.39006918848;晏,-7.55795006112;苌,-7.88585693488;荚,-7.12770492401;寒,-6.88106340143;鹏,-5.59679571442;裘,-7.45582056604;葛,-6.98460408037;牟,-6.80734582554;闞,-10.0111080126;镡,-10.4811116418;惠,-6.46292844058;威,-5.63221127093;叢,-6.09409746566;牧,-6.93725795978;淦,-7.6132127398;浩,-6.48474748798;泽,-6.07195633978;葫,-11.3974023737;符,-12.0905495543;彭,-5.57880422463;良,-6.94305507746;峰,-5.38981844473;習,-12.0905495543;鄔,-6.39010598088;维,-5.8502737091;隗,-9.09481728072;智,-6.08666248717;郟,-7.55795006112;承,-5.48525163333;燾,-7.75981621399;袁,-4.81192061195;刁,-10.1446394052;覃,-10.298790085;缪,-8.42698790814;骅,-10.0111080126;霄,-8.13930583569;宇,-6.78228185687;蒉,-10.7042551932;鍾,-7.55795006112;昊,-7.31142606116;茌,-9.60564290449;宏,-6.29753594589;傑,-6.27343839431;唐,-4.55045923413;繆,-8.42698790814;舒,-6.67890350242;雍,-6.86480288056;焘,-7.75981621399;涛,-7.37205068298;戚,-6.63951110071;茜,-8.24040195256;禄,-6.81243489504;邢,-6.14775017915;戢,-8.95505533835;溥,-8.53520149279;苻,-6.65682755072;琦,-7.6961003996;岩,-4.73682722388;航,-6.77734357523;謬,-7.47542903743;侯,-5.34649036796;郜,-10.0111080126;粱,-7.59073988394;尉,-6.31289723105;贲,-8.30635992036;朴,-6.89759270338;殷,-6.44864248334;邹,-8.08321636904;喻,-7.46557674099;樺,-6.79724472955;鈄,-9.52560019681;锋,-6.36370180669;瞿,-8.08321636904;栾,-9.60564290449;況,-6.63522843892;褚,-6.93149425506;鹂,-9.45149222466;寇,-6.47014868856;恆,-5.32666464571;酈,-9.89332497694;王,-2.67996585087;驊,-10.0111080126;绍,-6.12440281515;董,-5.88397362755;柏,-7.41772071981;羌,-6.27046662392;僑,-10.9919372656;嵐,-8.06519786354;滕,-7.57969004776;孔,-6.82785936537;铙,-7.99620499205;煦,-8.87167372941;仝,-8.7583450441;卜,-5.81956112242;翟,-7.29475900868;迮,-10.298790085;胡,-4.58891509639;楠,-9.78796446128;肃,-5.57140226633;虢,-7.37205068298;童,-6.14251456509;鸾,-6.89205252301;桦,-6.79724472955;莽,-7.52620136281;巫,-6.74344202356;秦,-4.23539254839;柯,-10.298790085;琼,-7.46557674099;兰,-8.17852654885;仵,-10.1446394052;烨,-8.99950710092;臻,-7.91616228438;幺,-6.3539772568;麗,-6.49956257376;鑫,-6.2383470745;寿,-6.18518770622;瑾,-7.88585693488;冀,-7.6961003996;迪,-6.49212759528;帅,-7.6132127398;泮,-9.78796446128;倉,-4.15246082738;洋,-6.84352548211;颖,-6.34754636647;後,-5.14549849055;崢,-8.91249572393;霍,-7.07991426018;鈕,-8.19872925616;龔,-7.47542903743;朗,-5.53946921923;肖,-6.94888599777;菁,-8.01301211037;菅,-9.52560019681;贛,-10.9919372656;庚,-7.547254772;昝,-9.60564290449;辜,-7.91616228438;伟,-6.21281377249;璞,-7.63620225802;簡,-8.65656234979;蔣,-6.79724472955;亢,-7.1207362547;帥,-7.6132127398;勇,-10.298790085;钦,-6.15301334919;倩,-9.20017779638;鸝,-9.45149222466;爽,-6.60161182812;纪,-6.04554424024;蘭,-8.17852654885;陳,-3.8517483884;伯,-5.41598816246;钮,-8.19872925616;週,-3.47206411138;鸿,-6.08666248717;宴,-7.62464143562;肅,-5.57140226633;扈,-8.17852654885;尹,-6.39681741547;鍵,-9.38249935317;鴻,-6.08666248717;貞,-6.45219488494;丽,-6.49956257376;龐,-7.30305781149;頡,-7.13472249667;荊,-7.01537573904;辛,-6.12697021066;範,-6.00377482736;賡,-9.09481728072;偉,-6.21281377249;巍,-6.71065220073;陆,-7.01537573904;益,-6.10158813738;魏,-4.87237271587;铎,-7.32837561948;桑,-6.84880253921;槐,-6.81754999571;楓,-7.1417896639;軒,-6.33480734069;陕,-7.1207362547;翔,-7.34561742591;呙,-9.20017779638;邸,-6.29753594589;慎,-8.21934854337;陝,-7.1207362547;佟,-6.90316374843;澤,-6.07195633978;衡,-6.90316374843;赣,-10.9919372656;诺,-5.38981844473;驥,-9.20017779638;濤,-7.37205068298;郦,-9.89332497694;恩,-5.38858918827;赫,-6.82269139521;芦,-7.28652850954;召,-5.2257017763;魯,-12.0905495543;森,-6.17434749167;闰,-7.28652850954;仲,-6.7386914208;鹿,-8.42698790814;羨,-7.77306144074;闕,-6.85944093742;竺,-7.9796756901;艽,-7.52620136281;卿,-5.51407998523;颜,-7.1001169675;鲁,-12.0905495543;逄,-9.69265428148;肇,-7.51583857577;紀,-6.04554424024;厉,-7.29475900868;戈,-7.13472249667;隋,-5.33245504985;敖,-7.7085229196;妍,-6.96658557487;萌,-8.68935217261;钏,-8.26190815779;鮑,-7.42711046016;亓,-7.81388343526;鄒,-8.08321636904;尔,-4.23927755716;霖,-8.56418902966;丘,-6.06952620493;芮,-8.72325372429;粟,-6.64813184375;逯,-8.30635992036;羡,-7.77306144074;坚,-6.53372149258;伦,-6.40696978694;義,-5.24148327164;韦,-6.16629375686;洪,-5.84638265361;維,-5.8502737091;谬,-7.47542903743;蒯,-9.52560019681;韶,-8.50703061582;丰,-6.94305507746;芳,-6.05506812175;蒲,-5.6337798987;况,-6.63522843892;吴,-3.43550929617;莹,-8.30635992036;樸,-6.89759270338;蔺,-9.52560019681;律,-5.09753443134;蒿,-7.04069354703;翁,-6.22408149734;樊,-7.84205431223;郇,-9.31796083203;荆,-7.01537573904;珉,-10.9919372656;么,-4.37008785967;介,-6.83827612623;楊,-3.83966840957;姍,-8.99950710092;郏,-7.55795006112;李,-3.33623101402;麼,-4.37008785967;仓,-4.15246082738;煒,-8.56418902966;燕,-5.38002644482;桔,-8.12025764072;郗,-12.0905495543;靖,-7.51583857577;骆,-7.59073988394;奚,-6.80228252358;瑜,-6.27343839431;蓟,-6.82785936537;卞,-8.13930583569;习,-12.0905495543;畢,-10.7042551932;蘆,-7.28652850954;赓,-9.09481728072;麥,-6.40357419793;武,-5.13495694588;韩,-12.0905495543;晨,-6.26454944689;浦,-7.35435110588;旭,-7.25426764732;於,-6.56112046676;绳,-6.70605449149;闵,-7.34561742591;陸,-7.01537573904;櫻,-6.93149425506;谌,-7.09333728051;崔,-6.31289723105;晁,-6.57309665781;萇,-7.88585693488;鄺,-9.14611057511;伉,-10.0111080126;薊,-6.82785936537;复,-6.88106340143;澎,-10.298790085;栗,-7.39920167205;甘,-6.10409754899;謙,-6.77242956043;丛,-6.09409746566;炜,-8.56418902966;颉,-7.13472249667;銳,-7.11381581185;匡,-8.35287993599;駱,-7.59073988394;雒,-6.84352548211;阚,-10.0111080126;嵇,-9.31796083203;尧,-6.60991063093;宦,-6.79724472955;亨,-6.00150467883;鄭,-4.95805200261;邬,-6.39010598088;堯,-6.60991063093;宮,-4.58836306767;朱,-4.69482794567;葉,-7.84205431223;瘳,-12.0905495543;憲,-7.16329586912;邴,-10.7042551932;谷,-6.42412286616;阳,-6.46292844058;茹,-8.42698790814;鞏,-8.45296339455;茆,-9.78796446128;洽,-7.93166647091;蒼,-7.6132127398;耿,-7.74674413242;宾,-10.7042551932;磊,-7.77306144074;郄,-9.09481728072;譙,-7.49542970414;顏,-7.1001169675;俎,-8.37697748757;狐,-6.71065220073;饒,-11.3974023737;萧,-6.01981182627;慕,-6.75301147457;裔,-6.81243489504;蕢,-10.7042551932;孙,-4.2211478417;骥,-9.20017779638;湛,-9.14611057511;姚,-7.24636246782;糜,-7.1207362547;江,-4.0290626874;俞,-7.60191318454;曠,-8.17852654885;麦,-6.40357419793;祥,-6.55716006555;鲍,-7.42711046016;翦,-7.82786967723;轩,-6.33480734069;玛,-5.85222492924;谦,-6.77242956043;蕭,-6.01981182627;蓬,-10.9919372656;濮,-7.67170894648;危,-6.89759270338;璩,-9.60564290449;键,-9.38249935317;鋒,-6.36370180669;赵,-4.69421426047;裴,-6.48843073339;梅,-6.47377845661;叶,-7.84205431223;郑,-4.95805200261;聂,-8.10156550771;藺,-9.52560019681;枫,-7.1417896639;鐔,-10.4811116418;锺,-7.55795006112;傅,-6.3801225369;甄,-8.21934854337;喇,-6.4172262871;檀,-6.47742144789;劉,-4.09221415832;宋,-4.05689112639;聶,-8.10156550771;譚,-7.34561742591;戎,-6.19339568664;宓,-7.28652850954;夔,-6.90876600398;弘,-6.86480288056;宛,-7.65973275543;琚,-7.94741482788;邝,-9.14611057511;鸞,-6.89205252301;邱,-6.64381218261;宣,-5.8981870648;芩,-8.2838870645;宫,-4.58836306767;倪,-7.32837561948;钭,-9.52560019681;冯,-6.41037694526;闾,-7.26223581697;励,-8.65656234979;鄢,-7.6132127398;殳,-8.19872925616;陶,-5.91260544022;邵,-7.14890713167;沈,-6.56112046676;庹,-9.45149222466;索,-6.17975291023;爾,-4.23927755716;荀,-7.49542970414;呂,-5.51966659194;蔚,-7.57969004776;忠,-4.77799605617;仉,-8.45296339455;閭,-7.26223581697;毋,-11.3974023737;荣,-7.73384072759;暉,-7.64789829778;穎,-6.34754636647;苑,-6.64813184375;芹,-8.08321636904;韓,-12.0905495543;恒,-5.32666464571;裕,-6.16096041088;姗,-8.99950710092;晖,-7.64789829778;佘,-8.79471268827;毛,-3.98494015197;郝,-6.74821530231;閻,-6.97255574186;虞,-7.51583857577;峥,-8.91249572393;臧,-7.5055820756;稽,-6.35720827738;杨,-3.83966840957;矫,-6.97255574186;汪,-8.30635992036;郭,-5.67218461834;馮,-6.41037694526;凯,-6.32849817149;普,-4.60843063072;杰,-6.27343839431;羿,-8.91249572393;旷,-8.17852654885;晶,-5.80269099411;曹,-4.8946123278;忻,-7.99620499205;訾,-9.52560019681;壽,-6.18518770622;孫,-4.2211478417;艾,-6.38676707962;丁,-4.76936099754;简,-8.65656234979;范,-6.00377482736;斯,-5.39104921411;堅,-6.53372149258;瑩,-8.30635992036;崇,-5.90846464756;隆,-5.81390606493;萍,-6.89205252301;斌,-7.39006918848;臬,-8.47963164163;徐,-4.93359318966;桂,-6.94305507746;吕,-5.51966659194;閔,-7.34561742591;陈,-3.8517483884;阙,-6.85944093742;莘,-8.72325372429;岚,-8.06519786354;薜,-8.19872925616;庞,-7.30305781149;侠,-7.59073988394;欣,-6.96658557487;貢,-5.91676345037;鄧,-5.78976375961;窦,-5.99023060225;侨,-10.9919372656;穆,-7.36316173556;谭,-7.34561742591;喬,-6.42412286616;贯,-5.67381727176;璜,-8.83245301625;樱,-6.93149425506;惲,-8.99950710092;丹,-5.53235175146;竇,-5.99023060225;冼,-9.45149222466;庾,-7.93166647091;婁,-8.19872925616;贡,-5.91676345037;奇,-7.27026798867;义,-5.24148327164;苍,-7.6132127398;瓊,-7.46557674099;凌,-7.11381581185;蓼,-7.32837561948;卓,-6.56908863641;瓒,-7.6132127398;恕,-6.84880253921;廖,-6.45219488494;瓚,-7.6132127398;汝,-6.36696445232;荻,-10.4811116418;俠,-7.59073988394;季,-10.1446394052;健,-5.59982601977;凤,-6.74344202356;曦,-6.99679935347;繩,-6.70605449149;陽,-6.46292844058;卫,-10.298790085;耽,-7.63620225802;姬,-6.58116121765;賁,-8.30635992036;靳,-9.31796083203;哲,-6.7339632796;遵,-6.0060501412;楷,-8.19872925616;諶,-7.09333728051;詹,-5.86203855068;俸,-6.28541458536;祖,-5.65760946154;恽,-8.99950710092;祿,-6.81243489504;諾,-5.38981844473;
+S,nt:逄,-2.32238772029;義,-0.420280193893;义,-0.420280193893;唐,-1.79175946923;鄒,-2.83321334406;陶,-3.93182563272;邹,-2.83321334406;
+S,nz:宏,0.0;
+S,n:肋,-8.2840576344;舌,-6.97367223647;貓,-7.15284418436;料,-6.61062959679;鐘,-6.71580728038;宝,-6.16695698961;洞,-5.74093724738;錢,-4.50740564082;瘤,-8.10027515697;礦,-6.39265572096;氨,-7.89035736788;键,-7.50414277126;河,-5.34393698397;薹,-9.99173398642;线,-5.14071229546;牌,-6.39089282936;姑,-7.65896391709;賓,-8.23554598298;苗,-7.30103780001;员,-8.97720481496;话,-4.24074991028;廟,-6.69231929907;鍤,-10.1676246529;罪,-6.17864060632;班,-6.453583653;酶,-7.14438946044;仿,-13.4257211909;球,-6.47730393021;厂,-6.40956003808;羊,-6.6852018313;鰓,-7.93265974757;错,-6.48453113584;鸟,-6.34275289437;肠,-7.51899787225;鎢,-7.81624939572;貨,-6.64579928343;疮,-8.65928285732;锹,-9.16304131387;参,-6.88758136714;毒,-6.74549406156;酸,-6.63337676344;筝,-9.70002776367;州,-5.17679967842;铜,-5.58836416599;鏢,-10.4812822117;火,-5.52360364463;秒,-7.4193680313;黴,-8.86659494342;鹿,-6.95260239733;堆,-10.2270480734;粉,-7.16232292831;醋,-7.61757870093;劍,-6.56505751946;碑,-7.35729560266;井,-7.13230191206;耖,-12.1729582224;钙,-7.17381730774;窝,-6.80498153983;鉛,-7.10855650416;龟,-7.70377141229;淚,-6.96973677291;岳,-7.91835919742;螯,-9.29858680586;碱,-7.30542377196;钹,-10.206845366;锸,-10.1676246529;榻,-7.98114131738;媽,-6.16029146765;笼,-9.07544325455;尾,-6.21084892683;泉,-7.26980208883;仕,-8.22722415964;汞,-7.79271889831;郡,-6.0742420917;痣,-9.18439443834;絨,-8.50574026508;鍬,-9.16304131387;柯,-9.58626887831;轴,-6.91620717494;灶,-7.72527761752;态,-7.0139029232;节,-6.09794065248;饭,-5.86148271574;床,-6.61008120083;掌,-7.21813770742;閘,-7.99418498057;弟,-6.44007937327;膠,-7.08271987772;锣,-8.16822581888;勇,-7.52719463946;梦,-6.40776711963;氩,-9.28258646451;溪,-7.39744267068;鎬,-8.98306993442;報,-4.95028793374;課,-6.95183049455;皺,-8.31977571701;殼,-6.49767320866;漿,-8.11745349351;柄,-7.09333005683;鱉,-8.79585839233;態,-7.0139029232;車,-4.89068808136;菌,-7.10675307716;姐,-7.16997114915;幕,-11.3462796492;糞,-7.92650588199;科,-5.51954235051;散,-12.509430459;坯,-9.03746400648;瓮,-8.61353683553;鹵,-8.62993064531;胶,-7.08271987772;闸,-7.99418498057;齿,-7.0792080216;刀,-6.19443418658;狗,-6.29602308119;库,-7.10495289666;气,-4.90284418302;锚,-9.26683810755;沟,-6.71519808145;伞,-7.38308835722;閥,-8.94271863889;劫,-8.93708482117;水,-4.38593192013;茶,-5.12954880542;砼,-11.9216437941;貿,-9.19888744564;鉀,-7.65428006778;病,-5.36061312823;藥,-5.82356951196;浪,-7.07833198125;廳,-6.69828946606;烷,-9.02511817066;硼,-8.49124725778;锅,-6.94184960556;标,-13.4257211909;莖,-7.19918452162;氟,-8.10760119706;蔥,-8.13745416021;輩,-7.55642427777;尿,-6.80232019428;鍁,-9.54415739296;臂,-7.53684323257;故,-9.19888744564;手,-4.47895581604;城,-4.79110058261;角,-7.13045518947;鳔,-10.0413309276;卡,-6.68638456355;癣,-10.3122058817;黨,-5.57776336;叶,-6.59161245209;書,-4.710169065;犁,-8.02304380903;撅,-11.1231360979;鳖,-8.79585839233;窑,-7.08271987772;鎂,-7.80170368472;團,-6.25023147728;额,-6.5703123923;枣,-8.09784502212;耢,-12.509430459;攤,-7.99857095252;炭,-8.37586518366;棚,-8.26666589169;霸,-8.11993180952;礼,-6.00424448505;鋁,-6.77414931732;區,-5.03477172606;铅,-7.10855650416;友,-8.50574026508;虎,-6.19371085924;筐,-9.06262256612;塒,-10.7866638613;釉,-8.33812485567;哥,-6.14674724254;秧,-10.684881167;癮,-9.39148055275;衩,-10.1485764579;泵,-8.44554510429;楼,-5.96638229569;勁,-7.18642047989;辈,-7.55642427777;弓,-8.54671433929;笛,-8.29286826409;钚,-9.43673714434;榜,-7.24054190318;营,-5.72226214304;疤,-9.08843045007;錫,-7.07309179459;粪,-7.92650588199;醬,-8.5974074536;锯,-12.0394268298;皮,-6.12964696265;雲,-5.97186967408;队,-6.20279027516;璺,-10.3122058817;权,-5.56553613343;鍋,-6.94184960556;賊,-6.0211377978;体,-5.82882675276;埘,-10.7866638613;硝,-8.88775975461;姜,-7.94508226756;藤,-8.11498130436;泪,-6.96973677291;話,-4.24074991028;硒,-9.00087455905;虹,-8.82055100492;蜂,-7.9143106089;厅,-6.69828946606;權,-5.56553613343;墓,-5.9586358791;岛,-6.01446706354;账,-7.48818498582;缆,-9.82840893032;鞭,-7.71861092616;綱,-6.64864423557;墳,-7.32540223889;訴,-8.23276434002;区,-5.03477172606;暴,-8.02304380903;烃,-8.78133029177;坂,-10.4052963048;仇,-8.0644290252;浆,-8.11745349351;癌,-8.20266630886;腎,-6.72930441779;齒,-7.0792080216;镖,-10.4812822117;鳥,-6.34275289437;神,-5.44689612626;面,-4.97991659558;鉤,-7.49613204752;桨,-8.58547888274;癬,-10.3122058817;苯,-7.58507953353;腮,-8.10760119706;壳,-6.49767320866;驴,-7.32204465319;雷,-7.05496440999;泻,-12.1729582224;捺,-10.3346787375;蹼,-9.55452018;戏,-6.41045770421;蠓,-9.54415739296;檔,-7.59091045384;傘,-7.38308835722;缝,-9.97573364507;纜,-9.82840893032;锡,-7.07309179459;钠,-7.51763825274;扇,-10.7866638613;墨,-7.42430631295;柳,-6.95105918715;妾,-7.5894495332;镁,-7.80170368472;铀,-7.71529417353;獅,-8.43869576245;體,-5.82882675276;煙,-6.19334939168;饼,-8.11745349351;胸,-12.0394268298;銅,-5.58836416599;溝,-6.71519808145;钡,-8.08338693894;报,-4.95028793374;氦,-8.95408239754;脸,-5.37008738195;殿,-6.13850260636;铁,-5.52749578188;鋅,-6.78193145776;豆,-7.05839200547;孔,-6.85343864821;爸,-6.90510006335;員,-8.97720481496;臣,-5.74439148225;院,-5.98118018649;卤,-8.62993064531;壩,-7.64035872926;票,-6.45077466238;鼓,-11.4108181704;槳,-8.58547888274;價,-5.51935813756;腸,-7.51899787225;門,-4.83193739733;舅,-8.3319709901;妈,-6.16029146765;耙,-8.7765341195;丝,-7.06614732223;龜,-7.70377141229;弧,-8.08578214967;錯,-6.48453113584;炮,-6.29362308003;纲,-6.64864423557;活,-5.88589658087;帽,-7.79810007722;癍,-10.4553067253;屑,-8.41175810672;绒,-8.50574026508;题,-6.92743904143;团,-6.25023147728;賦,-9.348183747;桩,-8.81556346341;姨,-8.47342147382;蟬,-8.65928285732;药,-5.82356951196;鋼,-6.03553976268;山,-4.7091035348;瓶,-7.20712107121;鹽,-5.91885472329;猫,-7.15284418436;阀,-8.94271863889;锂,-7.84599136492;漆,-7.86889312921;茎,-7.19918452162;蠔,-10.0584253609;圖,-5.22118605801;脚,-5.77960638854;谜,-7.80713356231;党,-5.57776336;弦,-7.31314581805;鈸,-10.206845366;麻,-7.36776690253;音,-6.55152269545;款,-6.62833896941;诉,-8.23276434002;蛋,-6.83062397045;獎,-6.7555887845;酚,-8.93148256563;糧,-6.34107574513;车,-4.89068808136;鹰,-7.63576102001;絲,-7.06614732223;鱼,-5.74485294973;省,-4.9228297842;閂,-10.3122058817;樓,-5.96638229569;醚,-9.20621348573;醛,-8.52415699186;蠟,-7.99857095252;蜡,-7.99857095252;鈣,-7.17381730774;簧,-8.5020972738;鎮,-5.89658329759;網,-5.326622524;主,-5.02113694387;宾,-8.23554598298;痂,-10.0935166807;證,-5.71215991323;姊,-9.2590559671;镍,-7.70377141229;网,-5.326622524;鵝,-8.23276434002;坡,-6.68225110623;剑,-6.56505751946;虫,-6.52348109261;镭,-9.51369818548;铬,-8.18662318402;灯,-6.3133937462;罱,-11.553919014;鷲,-10.7866638613;鋸,-12.0394268298;课,-6.95183049455;帆,-8.08099745154;鞋,-7.0792080216;锌,-6.78193145776;云,-5.97186967408;肥,-7.70213608895;窩,-6.80498153983;纱,-7.58799074374;头,-4.37543220708;銹,-9.76215954478;债,-5.74047758293;贼,-6.0211377978;雁,-8.26954359152;參,-6.88758136714;情,-5.77009383168;操,-12.509430459;界,-6.29642364198;量,-4.86738605616;旗,-6.36782325349;詞,-6.06022465925;煤,-5.860964178;书,-4.710169065;鬼,-6.1508951918;鰾,-10.0413309276;國,-4.31172653472;锗,-9.05627333844;鎘,-8.8458688129;瘡,-8.65928285732;钢,-6.03553976268;货,-6.64579928343;船,-5.60167518005;肺,-6.98000137152;铂,-8.32890820057;艙,-7.36309944948;佛,-6.50209256277;屎,-8.09058985124;襟,-9.26683810755;瓢,-9.17722594886;氧,-7.14158702984;詩,-5.74762623553;狮,-8.43869576245;司,-7.56351147966;胺,-8.49485086528;縫,-9.97573364507;劇,-7.30652327729;序,-7.34464448511;箭,-6.46869967062;嘴,-5.90765700967;血,-5.67834026499;鳃,-7.93265974757;魂,-7.55360340143;鋇,-8.08338693894;棋,-7.78204264032;词,-6.06022465925;奖,-6.7555887845;盟,-7.7086934895;鹤,-8.15272163234;腦,-6.52448712891;闩,-10.3122058817;马,-4.62651194867;灰,-6.89922633134;韵,-7.60861003094;奶,-7.21813770742;鷹,-7.63576102001;礁,-7.86503955989;锉,-10.4052963048;针,-6.68402049625;脑,-6.52448712891;紙,-6.27032488901;星,-6.21268953107;氣,-4.90284418302;钨,-7.81624939572;枪,-5.83866413819;鐳,-9.51369818548;皴,-10.0079945073;岸,-6.91695205393;銼,-10.4052963048;组,-9.46490802131;艇,-7.5706492687;镉,-8.8458688129;铈,-10.56352031;偶,-8.35681698869;筍,-9.22102857152;穗,-8.34431682592;坑,-7.26556927828;剧,-7.30652327729;硫,-7.44304514983;湯,-6.58037337205;酱,-8.5974074536;絹,-8.07149619242;狼,-6.81704602933;梁,-6.93121120735;鱗,-7.33102338916;锈,-9.76215954478;蚕,-8.43189301513;砖,-7.16327576307;沙,-6.34864516731;军,-4.46217689891;业,-8.94271863889;钩,-7.49613204752;锨,-9.54415739296;碳,-5.59589193529;氮,-7.71529417353;戲,-6.41045770421;蠶,-8.43189301513;油,-5.95322044617;贸,-9.19888744564;芽,-7.98114131738;歌,-6.53460355308;豎,-10.8999925466;诗,-5.74762623553;域,-8.03209364455;楠,-9.33974487835;緣,-7.15473275905;驢,-7.32204465319;腰,-6.41766819061;篷,-9.20621348573;社,-6.24147118511;矿,-6.39265572096;隊,-6.20279027516;胃,-7.00817224849;息,-6.84438881269;土,-5.46208716584;影,-7.18544534574;夫,-6.69351048444;弯,-9.64153155699;粮,-6.34107574513;冰,-6.80698220739;劲,-7.18642047989;人,-2.21258411838;钾,-7.65428006778;鹅,-8.23276434002;胆,-7.41200603486;葉,-6.59161245209;處,-4.63827188086;字,-4.84189791719;菜,-6.40642453719;坟,-7.32540223889;门,-4.83193739733;雪,-6.18614734398;圈,-8.68952274251;柴,-7.33328072646;豹,-8.31674999609;禍,-7.50012938795;爐,-7.19327317436;碗,-11.4798110419;辙,-10.1676246529;力,-5.44347556538;钟,-6.71580728038;霞,-8.6721309998;夢,-6.40776711963;鈰,-10.56352031;琴,-7.51899787225;膽,-7.41200603486;值,-5.645418103;眾,-13.4257211909;证,-5.71215991323;槍,-5.83866413819;題,-6.92743904143;彎,-9.64153155699;酒,-5.40890836539;藕,-8.20807172743;棗,-8.09784502212;招,-7.04052679191;針,-6.68402049625;铟,-10.1870427387;工,-5.86355955968;汤,-6.58037337205;僧,-6.86610595341;卦,-7.19819686722;器,-6.40553048259;潮,-6.92819233713;磷,-7.32204465319;表,-5.68462210087;函,-8.2244655372;布,-6.1804228203;眉,-7.49480314367;程,-7.13045518947;甕,-8.61353683553;窠,-9.45542927735;縣,-4.7859564471;性,-4.86451111407;薪,-8.07861366019;氯,-7.96401027745;电,-5.26434616771;砷,-8.34121604824;纸,-6.27032488901;嶺,-6.85975224337;蝉,-8.65928285732;橋,-6.15228167383;腳,-5.77960638854;街,-6.35925422077;牛,-5.6859267325;線,-5.14071229546;幣,-7.92446298036;鍺,-9.05627333844;雨,-6.13474641276;業,-8.94271863889;鹼,-11.553919014;鋰,-7.84599136492;硷,-11.553919014;寶,-6.16695698961;軸,-6.91620717494;鉻,-8.18662318402;砂,-7.46471585128;月,-4.1942065837;庙,-6.69231929907;缘,-7.15473275905;肝,-6.74549406156;粥,-7.81624939572;鈦,-8.00740103196;木,-6.53714873134;風,-5.33915708126;缸,-7.68914889343;鳞,-7.33102338916;瘾,-9.39148055275;心,-4.67227080903;組,-9.46490802131;牆,-6.49767320866;杈,-9.80138025793;摊,-7.99857095252;铕,-11.8162832785;兜,-12.7325740103;泥,-6.68048484142;路,-4.85016475619;石,-8.39528326951;虾,-7.41813726192;樁,-8.81556346341;简,-7.64806886768;笋,-9.22102857152;刑,-7.07483547419;圓,-7.55360340143;窖,-8.51674955059;膜,-6.70610435404;銦,-10.1870427387;頭,-4.37543220708;馬,-4.62651194867;舱,-7.36309944948;鐵,-5.52749578188;節,-6.09794065248;筋,-8.06913491623;額,-6.5703123923;鉑,-8.32890820057;竖,-10.8999925466;乙,-7.92242424367;鶴,-8.15272163234;雞,-6.49229816518;梨,-7.73705235406;荻,-10.62236081;災,-7.33781074553;图,-5.22118605801;龍,-5.62473911965;斑,-7.51763825274;店,-6.22828583681;钛,-8.00740103196;功,-6.25368041728;猪,-6.50702597189;窯,-7.08271987772;疱,-10.290226975;妹,-8.27822671409;核,-6.26448716081;脾,-7.49215062222;局,-6.18614734398;蛇,-6.85764327949;商,-5.93212558435;臉,-5.37008738195;剔,-10.290226975;仗,-6.79306086887;魚,-5.74485294973;籠,-9.07544325455;釩,-8.68514636791;价,-5.51935813756;矽,-7.30213249087;鄉,-6.07713365998;龙,-5.62473911965;碘,-8.42177488496;君,-6.33940140401;舟,-7.75411761461;氫,-7.26874220532;禮,-6.00424448505;耳,-6.24298921197;房,-5.64688177289;桃,-7.8785925263;光,-5.27136474554;屋,-6.59107438375;轍,-10.1676246529;坝,-7.64035872926;糠,-9.06901236422;档,-7.59091045384;潭,-7.8669644883;蟲,-6.52348109261;卵,-6.84231196875;鲁,-7.33894646399;市,-4.59737357085;欄,-8.22722415964;理,-6.02296483851;炉,-7.19327317436;箏,-9.70002776367;墙,-6.49767320866;蚝,-10.0584253609;蜜,-8.34121604824;財,-6.29003384388;素,-6.36395809945;肩,-7.34122177783;钱,-4.50740564082;田,-5.74185721065;眼,-5.4752187561;县,-4.7859564471;幂,-9.49389555818;雾,-6.9495183548;軍,-4.46217689891;镐,-8.98306993442;志,-6.3182957168;泡,-10.535349433;童,-8.55052386771;格,-7.72695125807;铱,-9.85618849443;祸,-7.50012938795;国,-4.31172653472;灾,-7.33781074553;稅,-6.29242523601;崗,-7.39744267068;瀉,-12.1729582224;脓,-8.45244168335;众,-13.4257211909;旅,-6.67754798175;簡,-7.64806886768;室,-6.31420907441;霧,-6.9495183548;銪,-11.8162832785;舵,-8.46989413331;鍵,-7.50414277126;肾,-6.72930441779;屁,-8.10760119706;燈,-6.3133937462;赋,-9.348183747;风,-5.33915708126;叔,-6.68697645466;糖,-6.55930887546;象,-5.51476380806;绢,-8.07149619242;瓦,-7.04221455602;魯,-7.33894646399;葱,-8.13745416021;痰,-7.44178491022;关,-9.52374852133;兒,-4.87316085565;島,-6.01446706354;撇,-9.66452107521;圆,-7.55360340143;玉,-6.10156086378;事,-3.86669772492;謎,-7.80713356231;岗,-7.39744267068;娘,-6.04796228268;渠,-7.4974627197;财,-6.29003384388;堤,-7.69724610366;庫,-7.10495289666;氬,-9.28258646451;肉,-5.99442151575;甲,-5.77056731653;匾,-8.45938615571;叉,-7.57639641096;版,-6.38737634222;爹,-6.30245138777;盆,-7.8310098113;烟,-6.19334939168;信,-5.22214345397;蝦,-7.41813726192;豬,-6.50702597189;飯,-5.86148271574;柱,-7.05496440999;拳,-7.88249878126;镲,-12.509430459;電,-5.26434616771;鑼,-8.16822581888;餅,-8.11745349351;熊,-7.35729560266;栏,-8.22722415964;笙,-8.98896965654;蒜,-7.79630313154;丫,-9.26683810755;冪,-9.49389555818;霜,-7.52994189393;皰,-10.290226975;草,-5.84476636917;村,-5.72587878351;盐,-5.91885472329;汗,-6.21011363268;銥,-9.85618849443;瓜,-7.51763825274;廠,-6.40956003808;巢,-7.93471948053;鹫,-10.7866638613;賬,-7.48818498582;兵,-4.7672020634;烴,-8.78133029177;处,-4.63827188086;例,-6.53003849316;福,-6.42812520792;税,-6.29242523601;牙,-6.48018854759;炕,-7.18349792545;鼠,-7.58507953353;氢,-7.26874220532;锰,-7.61908133081;錨,-9.26683810755;岭,-6.85975224337;皱,-8.31977571701;霉,-8.86659494342;鎳,-7.70377141229;債,-5.74047758293;膿,-8.45244168335;鈾,-7.71529417353;彀,-8.99490439206;磅,-10.535349433;鳍,-7.8310098113;材,-7.84222488212;湖,-5.94501091669;矛,-8.43869576245;铝,-6.77414931732;畜,-11.1231360979;營,-5.72226214304;竹,-13.4257211909;韻,-7.60861003094;币,-7.92446298036;貂,-8.62993064531;鈉,-7.51763825274;钒,-8.68514636791;紗,-7.58799074374;標,-13.4257211909;官,-5.06576677592;鸡,-6.49229816518;利,-5.98822040331;鰭,-7.8310098113;夯,-8.75289235644;錳,-7.61908133081;儿,-4.87316085565;繁,-8.2840576344;硅,-7.30213249087;镇,-5.89658329759;蛆,-9.348183747;渣,-8.88775975461;磚,-7.16327576307;關,-9.52374852133;乡,-6.07713365998;波,-8.44554510429;桥,-6.15228167383;秤,-8.70276796926;海,-5.29580943716;命,-5.22228029968;腿,-6.09302502732;
+S,o:吁,-8.71997075678;喀,-5.54191692643;噗,-3.53818720649;梆,-4.28915395793;砉,-5.08238459705;嘭,-4.53031601475;羋,-5.10905284413;嘎,-2.77455014817;嚓,-3.96638056567;咕,-3.57830720027;咔,-3.90778640141;橐,-4.01044055547;嘖,-5.31877337512;咚,-3.25191061564;咝,-3.82962162856;嘟,-4.11480057079;咣,-4.32552160211;鏗,-5.42413389077;嘤,-3.26038524263;怦,-7.11053284434;咩,-5.10905284413;咭,-4.53031601475;鏜,-5.13645181832;吱,-2.91483578786;嘰,-4.20911125026;喳,-4.71263757155;籲,-8.71997075678;喵,-5.28598355229;殷,-7.62135846811;嘶,-7.33367639566;锵,-4.80794775135;嘻,-3.02623861797;鐺,-5.67544831905;芈,-5.10905284413;颼,-5.10905284413;砰,-3.23933183344;嚶,-3.26038524263;嘣,-4.05653166267;噌,-4.93578112286;哐,-4.01949039099;乓,-4.01044055547;哒,-3.37286322606;飕,-5.10905284413;噔,-4.32552160211;哗,-6.41738566378;嗖,-3.98377230838;镗,-5.13645181832;鏘,-4.80794775135;铛,-5.67544831905;嗚,-2.30160582084;噝,-3.82962162856;呜,-2.30160582084;哞,-5.82959899888;嗡,-3.7501574572;噠,-3.37286322606;啧,-5.31877337512;哧,-3.86794049286;哦,-7.33367639566;啪,-2.68448932425;叭,-3.24770008311;嘩,-6.41738566378;嗒,-3.86015835242;嗵,-3.86015835242;叽,-4.20911125026;铿,-5.42413389077;喔,-5.08238459705;
+S,p:趁,-9.59838622084;同,-4.35766079862;与,-2.76784359359;憑,-6.54554426757;經,-4.8115525893;缘,-12.2551431275;在,-1.30428395054;被,-3.26629142696;为,-2.10521550715;沿,-6.4166840829;经,-4.8115525893;乎,-9.06672651017;给,-3.7077845218;距,-6.56014915893;跟,-4.94442587068;緣,-12.2551431275;以,-2.94585148532;除,-5.0374246053;給,-3.7077845218;凭,-6.54554426757;据,-4.79091986692;至,-3.85836768961;當,-4.24237939239;对,-2.63217171751;替,-6.21936269667;往,-4.94844395745;與,-2.76784359359;按,-4.76768936052;把,-3.18288735547;對,-2.63217171751;于,-3.1004079645;向,-3.71320854425;朝,-5.29717013241;從,-3.05853410046;由,-3.68621174073;為,-2.10521550715;於,-3.1004079645;繇,-10.2074502842;靶,-8.67859285841;从,-3.05853410046;当,-4.24237939239;比,-4.26974386634;據,-4.79091986692;因,-4.29560514726;自,-4.33942992817;用,-3.59460745502;
+S,qg:秩,0.0;
+S,q:刀,-11.7492438458;駕,-10.4274880058;點,-3.66337217706;撇,-11.3437787377;丈,-7.03521925492;犋,-11.0560966653;辑,-6.92493812992;帐,-5.73797667142;沓,-8.15193158523;園,-9.83970134094;钧,-7.34557803604;輯,-6.92493812992;碗,-5.70601736415;艘,-6.649377418;盤,-4.08033233191;丘,-7.50791709325;些,-3.85390095308;級,-4.80034662351;枝,-6.23380100028;帜,-9.5246202943;碟,-8.17971114934;瞥,-12.0369259183;座,-4.76614921029;吨,-4.80926341954;堆,-8.2302634285;維,-7.57101779962;锭,-8.18677831656;梯,-10.0444957536;箱,-6.44469592952;洲,-7.99973976989;段,-4.89620877904;場,-5.09605828784;炷,-8.53036802095;月,-7.22745526877;方,-4.09231555802;丸,-7.56338417476;场,-5.09605828784;羽,-7.43175573228;袋,-6.48525915835;锾,-8.41703933564;幀,-7.61407728908;片,-5.06057784782;萊,-6.52888802074;样,-5.95394626233;壇,-7.68021709158;杆,-6.50882045769;架,-5.65793396374;种,-4.32687014483;晌,-8.26034088374;盏,-6.6509029713;泓,-8.80480486665;筒,-7.05331929656;闕,-8.61374962989;顆,-6.51813522897;员,-5.96927223281;轮,-5.16929843038;棟,-8.35641471383;穴,-7.32140767511;巡,-7.14407365983;池,-9.09248693911;代,-5.03811190834;面,-11.0560966653;句,-5.23787005621;層,-4.80443365889;卦,-12.4423910264;龄,-8.09211309002;周,-9.63903064547;彪,-7.65074127345;莱,-6.52888802074;柱,-11.7492438458;簾,-7.57871014524;朵,-7.65074127345;歲,-6.19241578412;维,-7.57101779962;側,-11.7492438458;靶,-9.95748437659;噸,-4.80926341954;截,-12.4423910264;頃,-9.05800076303;番,-5.87150806404;窗,-10.6506315572;程,-7.55204189816;辆,-6.86644192323;磅,-8.30722446964;個,-2.64704563246;冊,-6.86266120039;篓,-9.70155100245;溜,-9.5246202943;輪,-5.16929843038;頓,-5.98014190504;廂,-7.24389399511;缕,-7.8523344782;檔,-8.06663400472;帘,-7.57871014524;伙,-6.4943560372;丛,-8.59224342467;枚,-7.14908620166;匝,-8.47209911283;斛,-8.39060607858;次,-4.68384399776;樣,-5.95394626233;厢,-7.24389399511;夥,-6.4943560372;扇,-6.13794222396;帧,-7.61407728908;天,-3.44338916027;類,-3.83902013872;絞,-11.0560966653;集,-5.03780763328;札,-7.61808531047;绺,-8.09211309002;簍,-9.70155100245;帳,-5.73797667142;絲,-6.51546500041;張,-4.00370006312;户,-5.20389418549;家,-3.31336917558;匹,-6.79517890321;碼,-10.3629494847;爿,-8.64690183721;年,-2.72661955495;籃,-9.12820502171;组,-5.69892094171;乇,-8.45340697982;錠,-8.18677831656;位,-4.3666528808;镑,-7.84223338222;芯,-8.90143170234;道,-2.4356702192;秒,-6.55212898478;度,-4.85761794877;綹,-8.09211309002;盘,-4.08033233191;聲,-4.22333436532;畝,-6.8607761857;幟,-9.5246202943;铢,-11.0560966653;条,-4.64736196459;章,-5.86313981437;档,-8.06663400472;叢,-8.59224342467;步,-5.5104310587;垧,-12.4423910264;旦,-8.63572853661;哨,-7.90442959009;筆,-5.76028242893;盞,-6.6509029713;蓬,-10.6506315572;篮,-9.12820502171;墩,-10.4274880058;米,-3.89923773329;角,-5.79017336652;滴,-9.35134857302;顷,-9.05800076303;叶,-11.1896280579;楹,-8.80480486665;軸,-10.4274880058;类,-3.83902013872;驾,-10.4274880058;桿,-6.50882045769;擔,-7.83722084039;岁,-6.19241578412;樁,-7.66326753327;堂,-5.46604295593;套,-5.34857120432;分,-3.48327222985;圈,-6.66319191244;宋,-7.8125282278;尊,-5.97236581609;劑,-7.2383843393;缪,-10.4274880058;繆,-10.4274880058;笔,-5.76028242893;宗,-5.4244369551;帖,-6.33092368688;錘,-10.4274880058;垛,-10.4964808773;條,-4.64736196459;趟,-7.53711624794;鈞,-7.34557803604;股,-2.58220249199;张,-4.00370006312;芥,-9.07509519639;簇,-8.02959273304;侧,-11.7492438458;亩,-6.8607761857;颗,-6.51813522897;个,-2.64704563246;梭,-9.1101865162;茬,-7.98804373013;種,-4.32687014483;脉,-7.25500522054;镒,-8.96115093704;串,-12.4423910264;鎊,-7.84223338222;筐,-12.0369259183;戶,-5.20389418549;庹,-10.3023248629;蔸,-10.6506315572;尺,-7.20861218097;栋,-8.35641471383;宿,-8.40815038823;尾,-7.8125282278;壁,-8.21555728111;齡,-8.09211309002;埃,-8.93084558755;剂,-7.2383843393;担,-7.83722084039;組,-5.69892094171;篇,-5.96618819027;屆,-7.70619257799;名,-3.97417801719;闋,-9.18429448836;塊,-5.28777566947;灣,-9.35134857302;族,-7.39574529476;號,-4.48468863071;点,-3.66337217706;嗓,-9.63903064547;瓢,-13.1355382069;腔,-6.13794222396;脈,-7.25500522054;摞,-10.245166449;員,-5.96927223281;口,-3.95534781191;幢,-7.36721721115;樘,-10.3629494847;哩,-8.8180500934;坨,-9.76824237695;毫,-8.20828452178;汪,-11.1896280579;园,-9.83970134094;鍰,-8.41703933564;锤,-10.4274880058;粒,-6.60174936901;棵,-6.8702369942;轴,-10.4274880058;号,-4.48468863071;桶,-6.5702732369;畦,-8.94588346491;份,-5.43298209367;链,-7.52973614064;湾,-9.35134857302;封,-4.67639794697;榀,-11.7492438458;項,-5.89776001502;瓣,-7.44180606814;盅,-8.04178800613;頁,-7.23017635889;倍,-6.17994559854;册,-6.86266120039;伏,-10.245166449;縷,-7.8523344782;阙,-8.61374962989;鏈,-7.52973614064;层,-4.80443365889;阕,-9.18429448836;缗,-8.64690183721;銖,-11.0560966653;帙,-9.80333369676;厘,-7.26342041746;輛,-6.86644192323;级,-4.80034662351;丝,-6.51546500041;期,-4.34740226708;斤,-6.97433088524;声,-4.22333436532;緡,-8.64690183721;框,-10.1398059334;席,-6.26964713206;支,-5.2150917018;撮,-8.71669759914;週,-9.63903064547;鎰,-8.96115093704;畈,-9.83970134094;根,-5.2464537999;部,-4.11128647833;罐,-7.14657679005;磴,-7.00431171746;元,-4.23090810993;届,-7.70619257799;幅,-6.37976928496;绞,-11.0560966653;盆,-7.16683064695;葉,-11.1896280579;株,-6.94932958304;克,-5.2604189259;壶,-6.7725101034;遍,-6.37165329838;桌,-8.97665512358;项,-5.89776001502;码,-10.3629494847;盒,-7.16172859507;幕,-6.33648234488;块,-5.28777566947;坛,-7.68021709158;束,-7.67170640191;仞,-9.87744166892;季,-8.40815038823;壺,-6.7725101034;瓦,-12.4423910264;桩,-7.66326753327;赫,-8.35641471383;峰,-7.66326753327;胎,-6.49566237311;旬,-8.06036439171;杯,-6.29178825793;目,-10.1398059334;群,-4.77406359052;台,-4.5581910927;曲,-5.53363624706;页,-7.23017635889;顿,-5.98014190504;卷,-5.58120338321;件,-5.414632955;批,-5.21909534682;寸,-7.76956219192;勺,-7.58257862202;盾,-7.13660164499;
+S,rg:兹,-0.84993986985;茲,-0.84993986985;汝,-6.63068338564;斯,-0.55994565764;
+S,r:该,-3.79372275746;谁,-4.31174502823;它,-3.34947073184;各,-3.91913499403;焉,-13.8943383741;己,-7.00576591454;咋,-6.61295271054;然,-6.34630940417;汝,-7.18503403385;偌,-10.3389903126;每,-4.41290273329;怎,-6.06909308268;我,-1.79333184313;某,-5.4057504397;何,-5.81379140829;他,-1.51510264957;这,-2.00226439824;啥,-5.81286333397;敝,-8.16423859114;誰,-4.31174502823;诸,-5.49165856948;你,-2.19480057093;那,-2.92741676126;厥,-8.26671726042;此,-3.75712347672;另,-4.46494279673;您,-5.29372357455;這,-2.00226439824;哪,-5.19866432529;公,-11.0039666162;斯,-7.21725491286;咱,-5.58097642298;孰,-8.52370034598;該,-3.79372275746;本,-4.36438131115;其,-3.00641557797;她,-2.65027322735;諸,-5.49165856948;俺,-6.17077590183;彼,-7.03682431156;吾,-5.90953498438;
+S,tg:宋,-5.67259954722;夏,-2.67588091817;暑,-6.50682532604;唐,-4.74583751548;夕,-5.46537145121;昔,-4.90651989717;夜,-2.94242742903;春,-2.5136413573;昨,-5.00950471173;冬,-3.50279424967;暮,-4.91573655227;现,-2.0540649119;宵,-5.97798119677;昼,-10.0033328875;午,-4.03718614838;秋,-3.47537496988;今,-0.820363712326;晌,-5.82894561761;魏,-9.31018570695;昏,-8.1315307106;晚,-2.26702579096;晝,-10.0033328875;隋,-8.90472059884;晨,-6.61894262416;現,-2.0540649119;
+S,t:蜀,-1.15745278869;虞,-0.377294231141;
+S,ud:得,0.0;
+S,ug:过,0.0;過,0.0;
+S,uj:的,0.0;
+S,ul:了,0.0;
+S,uv:地,0.0;
+S,uz:着,0.0;著,0.0;
+S,u:所,-1.85020464099;等,-0.656774403487;之,-1.30259026258;嘍,-8.53397466838;連,-3.04822064437;惟,-12.485218387;连,-3.04822064437;樣,-11.3866060983;般,-5.34081120664;样,-11.3866060983;喽,-8.53397466838;
+S,vg:馁,-8.88755853812;耀,-9.49369434169;沃,-10.5923066304;异,-4.35691599275;莅,-8.10739998057;庇,-6.3764821706;涉,-5.55373196757;蔭,-9.20601226924;賀,-5.58000605694;鞠,-8.6463964813;侍,-7.501264177;窃,-5.84737450199;躬,-7.0087876919;疑,-5.83013269556;逐,-8.00830907793;颓,-7.40389001297;弒,-7.98961694491;肃,-8.51286508868;渔,-10.8799887028;麗,-9.8991594498;耘,-7.95324930074;殮,-7.41425280001;驶,-6.46921265485;眠,-5.85173180736;閡,-8.54461378699;吠,-6.55806599221;貢,-8.84310677555;鉚,-9.33954366186;讥,-7.51269287282;骧,-9.8991594498;憩,-8.54461378699;撫,-4.94157337679;厭,-6.72110561945;踬,-11.2854538109;溯,-6.90342717624;央,-4.25902700222;禱,-7.09579906889;殉,-6.58043828996;侵,-5.02300838308;濟,-6.57142922002;縈,-8.34101483175;耸,-5.8963820811;慑,-7.31516189737;讽,-7.5965743568;贊,-8.68276412547;兆,-7.30577215702;秉,-6.55806599221;摈,-9.33954366186;憶,-11.9786009915;珍,-7.42472409988;济,-6.57142922002;遏,-7.37343080549;卒,-6.86661320312;毕,-4.41436251631;杜,-8.42325292999;啖,-8.24093137319;賅,-9.58070571868;佚,-6.42952490658;寝,-7.0087876919;募,-4.19997084415;赞,-8.68276412547;巡,-7.22501080037;薦,-6.03318038287;泣,-8.00830907793;晤,-7.66111287794;继,-4.324631811;踐,-7.52425369522;鑑,-9.67601589848;遨,-10.1868415222;詢,-7.37343080549;噬,-6.92235518613;拯,-8.36768307883;啮,-8.34101483175;汰,-8.45224046686;泳,-7.66111287794;餒,-8.88755853812;诵,-6.07051805331;鉴,-9.67601589848;拷,-7.05134730632;慶,-4.48639794886;賻,-9.8991594498;扼,-6.63626673951;囿,-8.10739998057;稔,-8.93407855375;萃,-9.27055079038;謅,-8.17193850171;铣,-6.98138871771;妆,-8.08678069337;諭,-7.32464064132;徊,-6.78010396021;暌,-8.61130516149;憎,-8.10739998057;沐,-7.64786765119;谓,-9.33954366186;观,-4.25947115057;蜕,-6.91600595845;視,-4.36824337316;贍,-6.63626673951;匝,-7.93554972364;諷,-7.5965743568;訟,-6.78010396021;棄,-4.99945571641;贡,-8.84310677555;缚,-5.6542420291;弥,-8.61130516149;丧,-5.67781519681;異,-4.35691599275;洩,-5.16186511088;储,-9.8991594498;鐫,-7.15028725418;循,-5.85391760058;覆,-5.26807788202;諉,-7.70193487246;撰,-5.12953470884;殲,-6.15555509599;冶,-6.02795843889;沸,-6.94816307008;霁,-8.10739998057;欽,-8.6463964813;膾,-11.2854538109;允,-5.50935067468;哀,-6.00989343149;恃,-6.50213743955;参,-10.5923066304;视,-4.36824337316;诊,-6.27149072673;滌,-9.03416201231;乏,-11.9786009915;契,-8.45224046686;濒,-6.39887116549;孕,-8.93407855375;滔,-8.10739998057;赙,-9.8991594498;揚,-5.17620622815;盜,-4.71317126822;牟,-9.33954366186;监,-6.7582451664;惠,-10.8799887028;遣,-4.78566677026;寢,-7.0087876919;臻,-8.21740087578;牧,-9.8991594498;旦,-9.27055079038;飨,-7.26010212018;聳,-5.8963820811;習,-8.98286871792;獵,-8.0273572729;维,-10.369163079;陶,-10.8799887028;航,-10.8799887028;酹,-9.58070571868;敕,-7.53594973499;綻,-6.78010396021;譽,-8.88755853812;炫,-7.66111287794;承,-6.04370679586;懾,-7.31516189737;颁,-6.57592360961;瘁,-9.78137641414;颔,-8.08678069337;昂,-8.57740360982;眄,-10.5923066304;徇,-8.31503934535;逆,-5.50471029513;悉,-7.0298411011;刊,-7.73010574943;躍,-5.69260289697;覓,-10.1868415222;舒,-8.0273572729;隕,-7.18281044588;輔,-5.6294620001;怖,-8.45224046686;攘,-6.88485079067;窺,-6.72632756343;逞,-6.81954569226;閱,-6.00989343149;窥,-6.72632756343;购,-5.14126817679;否,-5.79858433782;阐,-7.39363351281;斫,-7.36348047464;慮,-5.89182626457;辯,-6.1263985117;悱,-10.0326908424;决,-9.78137641414;嘲,-8.17193850171;授,-4.82554935654;瞵,-11.9786009915;喻,-9.03416201231;診,-6.27149072673;似,-4.81388061271;訴,-9.41365163402;胁,-7.95324930074;赡,-6.63626673951;燃,-5.88052670931;療,-7.05134730632;育,-5.99214898619;罄,-6.98138871771;聆,-8.14995959499;馳,-5.49396575584;奈,-5.38692725947;凋,-7.93554972364;諍,-7.15831942587;彌,-8.61130516149;辍,-7.12657072756;羡,-9.78137641414;惑,-10.1868415222;腐,-9.67601589848;询,-7.37343080549;協,-5.41757032558;競,-5.732494226;峙,-6.90969678926;駛,-6.46921265485;婚,-11.9786009915;曝,-7.04412705835;卜,-8.00830907793;察,-7.55976038368;诿,-7.70193487246;奠,-7.11878858712;孚,-7.22501080037;欺,-8.06657798605;阂,-8.54461378699;惩,-7.05862006565;噪,-9.49369434169;拭,-6.61262497646;濯,-8.19441135756;慰,-6.70048633225;泄,-5.16186511088;癲,-8.21740087578;勵,-10.5923066304;譴,-6.98138871771;賄,-10.0326908424;谕,-7.32464064132;击,-4.62232111493;绽,-6.78010396021;歼,-6.15555509599;寿,-9.41365163402;吁,-6.84870227655;帅,-10.0326908424;构,-5.77606547429;诲,-7.68814155033;肖,-9.27055079038;戍,-7.01575636122;厌,-6.72110561945;憐,-6.79681744119;抒,-8.10739998057;聯,-4.41540039912;飼,-7.08825186326;悖,-6.65559101234;媚,-6.62201471681;宜,-4.17109094926;輟,-7.12657072756;蒞,-8.10739998057;倡,-6.80811699644;影,-9.20601226924;規,-9.78137641414;抚,-4.94157337679;帥,-10.0326908424;殤,-8.45224046686;悦,-6.11781476801;逝,-6.21340988869;昭,-5.44626669926;振,-7.97126780624;綜,-9.33954366186;藉,-7.06594610574;謂,-9.33954366186;昵,-7.97126780624;感,-4.05997233814;肅,-8.51286508868;頹,-7.40389001297;趸,-6.83693743497;贻,-8.21740087578;溺,-7.11878858712;丽,-9.8991594498;讼,-6.78010396021;匿,-7.32464064132;擴,-4.79094382736;遁,-6.78010396021;怡,-6.93517587456;囂,-7.93554972364;讒,-7.57188174421;迄,-11.9786009915;佇,-9.03416201231;铆,-9.33954366186;懈,-7.15831942587;奋,-7.00186724906;益,-9.41365163402;噍,-10.1868415222;诌,-8.17193850171;协,-5.41757032558;塑,-11.9786009915;辅,-5.6294620001;銑,-6.98138871771;拒,-5.28033293736;緘,-7.93554972364;敛,-6.07051805331;囚,-6.68529616675;矜,-8.36768307883;妝,-8.08678069337;涤,-9.03416201231;污,-9.41365163402;浣,-6.72110561945;诺,-8.80054716113;诤,-7.15831942587;適,-5.49855642955;頒,-6.57592360961;慫,-6.76911483864;钦,-8.6463964813;驅,-5.51713281512;召,-7.04412705835;联,-4.41540039912;惮,-8.45224046686;违,-6.3951046827;娩,-7.95324930074;觀,-4.25947115057;盲,-8.51286508868;創,-4.18914642539;援,-5.64000691327;歷,-9.49369434169;辨,-5.66143630473;屹,-7.85146660643;凸,-7.03695856887;固,-6.54487898792;幽,-8.98286871792;謫,-7.81971790812;糾,-6.96796569738;言,-3.30628616319;溃,-5.91714407255;涅,-7.46774148496;盗,-4.71317126822;圆,-4.5616213701;枉,-6.19477580915;刈,-7.31516189737;骋,-7.54778419263;敖,-9.78137641414;頌,-7.60915313901;躉,-6.83693743497;猎,-8.0273572729;辑,-8.26502892477;舐,-7.33421009234;誓,-5.85610818196;适,-5.49855642955;輯,-8.26502892477;霽,-8.10739998057;徙,-5.73832514631;战,-3.51967270819;際,-8.19441135756;焚,-6.1526008841;喝,-3.30235487021;怜,-6.79681744119;悟,-11.2854538109;笞,-7.25121317277;御,-4.15096144511;娱,-7.93554972364;嚣,-7.93554972364;博,-7.05134730632;斥,-6.19170361011;殇,-8.45224046686;符,-10.5923066304;辩,-6.1263985117;忝,-7.88425642926;享,-8.48209343001;礪,-8.88755853812;維,-10.369163079;滯,-5.79445210054;誉,-8.88755853812;匮,-7.62189216479;辱,-8.31503934535;戰,-3.51967270819;儲,-9.8991594498;涵,-8.42325292999;谴,-6.98138871771;撷,-8.98286871792;徹,-6.54052168255;祷,-7.09579906889;示,-5.68333499004;覽,-8.6463964813;泯,-7.97126780624;貿,-8.61130516149;殴,-7.53594973499;谦,-8.31503934535;驰,-5.49396575584;蘊,-7.28725310925;觅,-10.1868415222;摄,-5.12003595669;镌,-7.15028725418;诉,-9.41365163402;蹈,-7.67453589827;介,-10.1868415222;竣,-10.0326908424;囓,-8.34101483175;鈐,-6.95472047063;疏,-5.65783269723;哗,-5.67598201573;诙,-7.26907079017;凝,-6.02017629845;遜,-6.28824153715;驤,-9.8991594498;濡,-7.33421009234;习,-8.98286871792;監,-6.7582451664;畢,-4.41436251631;缄,-7.93554972364;叩,-5.40771802914;闡,-7.39363351281;諫,-5.65783269723;釃,-11.2854538109;葬,-5.19867908401;擯,-9.33954366186;诱,-6.23239780094;钤,-6.95472047063;绳,-11.2854538109;谒,-6.18254324071;践,-7.52425369522;逸,-6.42952490658;擷,-8.98286871792;陨,-7.18281044588;幸,-6.57142922002;蛻,-6.91600595845;構,-5.77606547429;灼,-5.86713365197;竊,-5.84737450199;漁,-10.8799887028;萦,-8.34101483175;斂,-6.07051805331;脅,-7.95324930074;历,-9.49369434169;嬉,-7.62189216479;予,-6.19170361011;栖,-5.70383897024;复,-9.58070571868;搏,-7.05862006565;扬,-5.17620622815;弑,-7.98961694491;焕,-6.94816307008;悔,-6.14671851419;谗,-7.57188174421;甘,-7.14231908453;謙,-8.31503934535;誘,-6.23239780094;创,-4.18914642539;喚,-4.67005819394;攝,-5.12003595669;规,-9.78137641414;匡,-11.2854538109;纠,-6.96796569738;鸣,-7.32464064132;貫,-8.80054716113;睇,-10.5923066304;侦,-6.91600595845;眩,-7.28725310925;誨,-7.68814155033;拘,-6.31217430336;喪,-5.67781519681;夭,-7.81971790812;侮,-7.53594973499;匱,-7.62189216479;遺,-6.06509798584;饲,-7.08825186326;頷,-8.08678069337;览,-8.6463964813;匹,-10.1868415222;膺,-7.64786765119;釋,-7.74449448688;悼,-7.62189216479;逭,-8.93407855375;务,-10.8799887028;泊,-7.09579906889;赅,-9.58070571868;擄,-6.45714007362;忆,-11.9786009915;盈,-5.28156674381;释,-7.74449448688;衍,-6.56250058927;霸,-7.91815798093;眺,-9.14538764742;晓,-6.03318038287;慕,-9.33954366186;譏,-7.51269287282;遗,-6.06509798584;揖,-5.87157810374;勘,-6.28824153715;恕,-5.69446683041;惜,-6.03842973876;愤,-8.68276412547;靡,-6.64588219821;虑,-5.89182626457;騁,-7.54778419263;誣,-6.94164838906;煥,-6.94816307008;摧,-7.48996462175;锻,-7.11878858712;革,-5.46092971857;癫,-8.21740087578;奮,-7.00186724906;息,-10.1868415222;繼,-4.324631811;危,-8.36768307883;曰,-2.79224598225;乳,-8.26502892477;懲,-7.05862006565;敵,-9.8991594498;措,-7.04412705835;睹,-9.58070571868;展,-5.35453576368;幻,-6.44917190397;酾,-11.2854538109;購,-5.14126817679;偿,-7.15831942587;俾,-7.26907079017;謁,-6.18254324071;殃,-8.36768307883;怂,-6.76911483864;悅,-6.11781476801;蚀,-6.08419815721;抉,-9.03416201231;弈,-8.75972516661;律,-8.14995959499;逊,-6.28824153715;溉,-8.21740087578;抑,-5.90325496039;蹙,-6.65559101234;殓,-7.41425280001;怒,-4.69859273859;谏,-5.65783269723;疗,-7.05134730632;祛,-7.07332621304;踞,-7.13441390502;亡,-4.91213402134;暱,-7.97126780624;唤,-4.67005819394;喧,-7.01575636122;堪,-9.78137641414;讳,-7.09579906889;覯,-9.78137641414;励,-10.5923066304;掳,-6.45714007362;渲,-7.07332621304;损,-6.29842838246;嘶,-6.52756253791;索,-6.87265551758;瞻,-7.15028725418;砺,-8.88755853812;貽,-8.21740087578;祈,-7.66111287794;阅,-6.00989343149;參,-10.5923066304;擅,-5.40213142243;襄,-9.27055079038;蟠,-7.0298411011;勉,-7.60915313901;脍,-11.2854538109;敌,-9.8991594498;觏,-9.78137641414;囑,-6.58497344513;佐,-5.46685566183;寓,-6.69033396078;摒,-8.93407855375;裕,-11.2854538109;繩,-11.2854538109;谪,-7.81971790812;務,-10.8799887028;逾,-4.77000065352;違,-6.3951046827;啜,-8.04677535875;諡,-6.09527860299;豢,-6.71074283241;赤,-4.80464267172;睨,-8.31503934535;迫,-5.59003958593;铭,-8.88755853812;酬,-8.21740087578;毆,-7.53594973499;諱,-7.09579906889;潰,-5.91714407255;籲,-6.84870227655;浴,-7.70193487246;究,-6.68529616675;決,-9.78137641414;壽,-9.41365163402;贸,-8.61130516149;牾,-9.8991594498;丁,-8.28972153736;综,-9.33954366186;弃,-4.99945571641;颂,-7.60915313901;崇,-8.26502892477;庆,-4.48639794886;侈,-8.08678069337;炊,-6.78010396021;損,-6.29842838246;跃,-5.69260289697;诬,-6.94164838906;析,-5.63121178182;圓,-4.5616213701;袒,-7.95324930074;瀕,-6.39887116549;銘,-8.88755853812;糅,-9.8991594498;弛,-7.70193487246;吝,-9.03416201231;娛,-7.93554972364;償,-7.15831942587;戡,-9.49369434169;际,-8.19441135756;欣,-6.86661320312;憚,-8.45224046686;谥,-6.09527860299;憤,-8.68276412547;愧,-6.80811699644;誦,-6.07051805331;嘩,-5.67598201573;羨,-9.78137641414;伫,-9.03416201231;葆,-8.6463964813;砭,-8.75972516661;贯,-8.80054716113;嘱,-6.58497344513;嫉,-6.60796296335;躓,-11.2854538109;悲,-6.68028362493;怵,-7.95324930074;澡,-10.8799887028;遵,-6.86661320312;鬻,-8.0273572729;始,-4.05924480082;贿,-10.0326908424;繁,-8.84310677555;贺,-5.58000605694;哂,-6.86060717906;慷,-7.44600149832;集,-5.34791760584;擊,-4.62232111493;恍,-6.25501588952;凌,-9.78137641414;畏,-5.74615297493;酌,-6.94816307008;曉,-6.03318038287;寐,-7.21642705668;偕,-6.97465468553;委,-8.84310677555;饗,-7.26010212018;詼,-7.26907079017;鍛,-7.11878858712;縛,-5.6542420291;嗜,-6.04106478639;滞,-5.79445210054;忠,-7.22501080037;督,-5.06685369123;鳴,-7.32464064132;履,-6.86661320312;嗤,-6.65072482269;竞,-5.732494226;荐,-6.03318038287;扩,-4.79094382736;荫,-9.20601226924;禦,-4.15096144511;酡,-9.78137641414;驱,-5.51713281512;述,-5.53446973478;棲,-5.70383897024;偵,-6.91600595845;具,-3.52990079651;延,-7.62189216479;彻,-6.54052168255;哺,-7.05134730632;蝕,-6.08419815721;蕴,-7.28725310925;諾,-8.80054716113;
+S,vn:戀,-7.67740043051;損,-2.02491125025;疏,-1.03361069737;瞎,-6.06796251808;伐,-6.98425324995;褒,-6.57878814185;瞥,-6.98425324995;愤,-2.51261445659;怨,-4.49934660017;谭,-2.68018815675;昏,-6.06796251808;诈,-7.67740043051;欺,-1.7425062349;朽,-6.98425324995;傍,-6.06796251808;恋,-7.67740043051;詐,-7.67740043051;伏,-6.98425324995;赛,-2.81758802615;譚,-2.68018815675;损,-2.02491125025;憤,-2.51261445659;淤,-5.88564096129;祭,-5.19249378073;扳,-7.67740043051;浴,-2.35439045138;賽,-2.81758802615;
+S,v:怀,-8.12628297391;挂,-6.97809664191;誇,-9.218104065;耀,-10.144598967;谈,-6.98433056913;随,-6.46231170659;抗,-7.35848039257;料,-11.2054709277;造,-7.39470165601;瞥,-9.18564178885;掭,-13.2485448252;攮,-12.3040832164;临,-7.61938327479;銷,-8.51109402853;閹,-9.86173618103;吸,-7.69669327367;捂,-8.97784887321;談,-6.98433056913;反,-6.2435332095;剌,-8.65921370328;織,-8.6577633767;摘,-8.57838978916;題,-13.2485448252;浞,-10.7518037178;知,-6.49861363145;緩,-8.02587507703;揭,-8.51737151305;扬,-12.997230397;闹,-7.1994854516;驼,-9.51770117203;愁,-8.61381583701;掂,-10.0296690004;沈,-7.9339323762;引,-6.83719582079;应,-5.47555153621;戗,-11.1691032836;攙,-9.41680265107;謝,-7.91789857158;丟,-7.82045311494;無,-5.21734528189;吣,-11.6680944497;滤,-9.43871276071;崩,-9.32515806116;抬,-7.41331646445;是,-2.15524714443;讲,-6.25382578945;刷,-8.81263895689;砻,-10.6094874956;運,-7.22475139102;鍍,-10.651160192;录,-8.01058425923;教,-6.62088144944;衛,-8.11695692073;囤,-9.33366875083;括,-9.64149538937;棰,-11.5308933282;滴,-8.46942133213;铸,-8.52495688444;斃,-10.0296690004;舂,-10.9603484697;沉,-7.9339323762;贈,-9.23344963467;默,-9.4137114585;蒙,-7.71064828663;辟,-8.3120175033;枯,-9.10314509222;伴,-8.4563024797;离,-6.44805664019;笼,-9.14944966026;渴,-12.4218662521;框,-9.83786869962;湊,-8.43519970363;绕,-7.81732126146;敘,-8.64910531396;譜,-7.96606652272;繪,-8.87368668004;裱,-11.0048002323;跳,-6.56876618673;啸,-10.5993351242;移,-7.53811780786;膀,-11.1691032836;消,-8.35712215961;冠,-8.23410724519;鬧,-7.1994854516;脫,-7.37281184805;掬,-10.9177888553;术,-7.80427354607;撮,-8.88090692802;吹,-7.22821519774;皺,-9.10541009885;拂,-9.38331398132;歇,-8.05717653703;駐,-7.12573878158;靜,-8.05162757313;轟,-8.79419752899;賞,-7.95094199963;編,-7.40086817092;腫,-8.59322485557;扭,-8.31407089211;闸,-14.5013077937;导,-8.42941599751;舀,-9.97951921669;薅,-11.2432112557;贊,-8.82626778794;頂,-7.01750110607;錯,-7.74321328931;挖,-7.74553887175;邮,-8.81433243739;删,-10.0945885465;符,-8.79253777757;披,-8.28570019498;躲,-7.84201387405;傷,-7.27219391594;瘸,-10.2246416747;赞,-8.82626778794;赊,-10.8377461476;凍,-8.46942133213;灌,-8.36899493804;结,-7.50051764879;饒,-8.60828331944;学,-6.12268725218;苫,-9.73913385894;襲,-7.51013090661;培,-10.1130506093;墾,-9.54548073613;持,-6.2850845691;憂,-8.0060422378;标,-7.9947766286;漉,-12.4864047732;予,-9.84259684082;瞎,-8.13569682178;笑,-5.42250081172;紕,-14.0958426856;岔,-9.90115014957;耗,-9.19800288568;掖,-9.71381605095;訛,-10.2891801959;辞,-8.12458084584;加,-6.46570510082;锥,-8.9758548546;缩,-8.29978493486;悬,-8.04453813816;碼,-8.91969295305;尿,-10.3346425699;晃,-8.65631515053;懂,-7.55673854163;蓄,-9.45145178649;识,-8.08375885132;轉,-6.34608927935;免,-8.08457551122;筑,-7.9770115426;跷,-10.2386279167;補,-7.3463018881;卡,-11.7287190715;顧,-7.8719445403;罩,-8.68270964465;扫,-8.05162757313;賴,-8.57705199632;偷,-7.85686723076;叶,-8.56641359812;睹,-10.8769668608;驻,-7.12573878158;撅,-10.4069632315;争,-7.66076126445;压,-7.06380700613;傍,-9.38932000538;骑,-7.14982869453;帮,-7.28129978837;花,-6.26052708251;鞣,-10.2966151743;逢,-8.08866884481;贴,-7.68020032148;制,-6.33765161757;兌,-7.98216050579;噎,-10.3269205238;輸,-7.9438194624;裝,-6.78395652155;跟,-7.10007652932;占,-5.28976814118;秧,-12.7965597015;議,-7.43270998964;泵,-13.1150134326;赴,-7.20489452496;寻,-7.52076684503;飽,-9.32798691736;掀,-9.21051869361;會,-4.0841436852;搅,-8.6577633767;誆,-10.2599810412;嚎,-10.2246416747;弓,-8.90473940339;抖,-8.34221240524;講,-6.25382578945;负,-7.29753031803;挫,-8.65054312873;許,-11.8271591443;记,-6.70586703989;趴,-9.78728320283;揀,-8.93678738641;迈,-8.76312389236;問,-5.1702553466;拖,-7.60562509599;衝,-6.76500069719;剡,-12.1034125209;叠,-9.0610569313;饧,-10.8903898811;铺,-7.72252289605;绾,-10.0885095004;搀,-9.41680265107;缒,-10.144598967;暗,-7.73973502493;依,-7.16795803535;礱,-10.6094874956;判,-8.36142324151;梳,-9.31392198789;漲,-6.0183955363;嚷,-8.47182517944;夾,-7.88190147619;杂,-7.98216050579;浆,-12.7095483245;觉,-7.54001174782;煎,-8.92346654244;壓,-7.06380700613;归,-6.85974335247;聘,-9.25428372157;泛,-8.18324098694;保,-6.77333225163;鉤,-11.3026346762;潲,-12.997230397;镶,-9.13533177871;選,-6.81170787943;系,-6.12085112589;鹼,-12.7095483245;考,-7.59605564497;抄,-8.0985617532;變,-6.21478642005;眍,-13.4026955051;頓,-12.4864047732;溜,-8.42366555039;炸,-8.36899493804;聋,-10.0411633798;擀,-10.740107678;捅,-8.96004424858;拄,-9.67700207783;坍,-10.475956103;燎,-10.8124283396;習,-8.97784887321;揚,-12.997230397;觞,-11.6979474128;灣,-8.16006704438;鋤,-9.68506663767;磨,-8.13140681091;曬,-8.5136002955;扯,-7.61171648538;陷,-8.11864611032;穿,-6.31637571817;攀,-8.74240601986;昂,-9.4044948034;澇,-9.92145541573;開,-5.28354503594;搖,-7.60968189668;唠,-11.8986181083;墩,-9.81455762075;串,-8.70373143979;刺,-7.56593734772;宿,-8.97386480419;擁,-7.9123813162;担,-8.16891665966;汆,-12.2500159951;偎,-10.5892847883;結,-7.50051764879;姓,-6.92444191202;答,-7.80242340678;潜,-7.77988209294;铡,-9.99595794303;釣,-10.0469604975;卤,-10.2456950839;忧,-8.0060422378;走,-4.73745594154;蹲,-8.35390844501;執,-8.134837346;烹,-10.0885095004;煸,-12.1499325366;顾,-7.8719445403;搁,-8.83661270779;掄,-9.64149538937;誊,-11.1871217891;餓,-8.27378347005;耙,-12.2500159951;蔫,-10.7518037178;振,-8.19594533204;谱,-7.96606652272;亲,-6.8996556153;碾,-9.67700207783;摁,-10.7756143665;览,-9.65319142914;降,-6.56822802185;赛,-8.54936400479;離,-6.44805664019;剥,-8.6320108806;滲,-9.36845486691;说,-3.29513849396;飾,-8.68568583732;怄,-11.3232539634;漆,-10.475956103;計,-7.09035591815;研,-8.5313222783;掙,-8.6221724316;愚,-9.22064536243;涝,-9.92145541573;產,-6.65139912335;順,-8.29877227655;断,-6.85734584473;搬,-7.64695329148;肯,-7.83753673194;鐵,-11.5568688146;麻,-11.0513202479;綽,-10.0645562594;鼓,-7.68896269956;餾,-12.0589607584;嗍,-10.8506495524;像,-5.29026766664;駕,-7.87923658454;托,-7.58112999475;篩,-9.42926387151;奪,-7.84844476438;惯,-8.71134762284;審,-8.74873515491;叹,-7.43954470227;鉸,-10.2599810412;煺,-11.8986181083;签,-8.3777190937;來,-3.73014218925;瘋,-8.52877125651;透,-7.79811968049;搗,-9.39536231983;折,-7.55529380264;減,-7.79873336569;买,-6.12303190151;窨,-10.9897623549;撬,-9.40144136591;漱,-10.5216261398;蛀,-10.4069632315;汇,-6.72204996567;著,-6.90065536545;賜,-7.7496217004;睡,-6.79514482354;闢,-8.3120175033;入,-5.80974121537;烤,-9.00824635039;蓬,-9.78280892244;揮,-7.88056814266;仰,-8.55327280455;呷,-9.90115014957;勸,-7.35808521375;出,-4.41875397713;顿,-12.4864047732;掃,-8.05162757313;搂,-8.67383384674;嫖,-10.9317750973;熏,-9.22830823517;閂,-11.7932575926;斗,-7.36085475063;忘,-7.20218633102;供,-6.80965097092;琢,-10.0586565372;带,-5.4312645073;窩,-10.2966151743;螫,-10.8377461476;澆,-9.09189637968;播,-9.12141044019;攬,-9.18073981825;估,-9.7096580408;喷,-8.47062253347;銹,-11.6680944497;缓,-8.02587507703;杀,-6.11753171576;获,-6.44885212189;埋,-7.77687457188;响,-7.17123028958;减,-7.79873336569;剎,-9.79177759242;绑,-8.74240601986;齐,-13.4026955051;磕,-8.82970421744;奔,-7.38694493208;进,-5.55538880064;聚,-7.76197116638;盡,-6.63056905489;坠,-9.00619085121;敬,-8.55066524115;扮,-9.59974359469;轰,-8.79419752899;诳,-10.1130506093;汲,-10.475956103;闷,-8.43404028321;卸,-8.5878047881;翻,-7.18376343516;驾,-7.87923658454;撂,-9.51428236528;洇,-13.1150134326;看,-4.38470682392;堕,-10.231610344;掘,-8.23315892838;伛,-15.1944549743;語,-8.66503613603;钢,-14.5013077937;冤,-9.53846316347;護,-8.07643876983;搭,-7.72765549928;斬,-7.92692954647;踱,-9.51428236528;刹,-9.79177759242;簽,-8.3777190937;擂,-10.0885095004;浇,-9.09189637968;诈,-9.64149538937;敗,-7.57669539769;潛,-7.77988209294;健,-9.25956077868;穩,-8.0166725581;觴,-11.6979474128;饿,-8.27378347005;要,-3.85551391693;謂,-8.36250140873;箍,-9.13767096107;纏,-8.47544181991;逐,-8.69918941836;钓,-10.0469604975;会,-4.0841436852;攆,-9.40144136591;训,-8.89366917963;贮,-9.50747961795;邻,-8.52242202883;缺,-7.73569228191;唾,-10.4237703498;见,-4.80103862371;賃,-10.8377461476;腆,-11.1871217891;絎,-12.7095483245;凑,-8.43519970363;敞,-9.56324319247;闩,-11.7932575926;坪,-9.57043746811;语,-8.66503613603;浮,-7.7810876386;晴,-9.07856284881;饶,-8.60828331944;调,-6.78306684178;攉,-12.1499325366;撈,-8.55327280455;验,-9.31392198789;吓,-7.46780130945;隔,-7.48469810984;領,-6.58013507215;充,-8.39428490599;颠,-9.46760722671;甩,-8.72056427794;瞪,-8.07078218909;涮,-10.6301067828;脱,-7.37281184805;銼,-11.9755791494;检,-8.88635653279;扇,-10.7058186046;嫌,-8.15129505831;兑,-7.98216050579;拜,-7.04485323856;摳,-9.66900203516;杵,-10.694645304;鋼,-14.5013077937;樂,-11.3443073726;溅,-9.48072216879;嬌,-9.7096580408;導,-8.42941599751;焐,-10.5993351242;划,-8.06595902861;搞,-7.09642021812;夠,-7.4288858932;钩,-11.3026346762;冻,-8.46942133213;裁,-8.9121882274;滅,-7.35650605827;轄,-7.35966686691;雕,-8.83315249672;摞,-10.9177888553;陪,-7.63333338476;俯,-9.40755759293;惱,-8.75032371759;顶,-7.01750110607;響,-7.17123028958;踅,-8.93870493254;澄,-10.0764611619;指,-5.91589536334;完,-6.44155744952;擬,-7.18475961655;鞔,-11.1871217891;袖,-9.05241756871;愛,-6.14828194853;撞,-7.71572014873;設,-6.31930765744;凉,-7.9947766286;纺,-9.48072216879;迄,-9.92145541573;葉,-8.56641359812;積,-7.69337285003;灑,-9.06322848481;勒,-8.03671949004;鋸,-9.80082742794;淘,-8.54417592571;滚,-7.84201387405;束,-8.93487351023;卧,-8.55196817293;烦,-8.50485570512;盪,-8.80086422034;趨,-7.9970196202;养,-7.55963429655;建,-6.41059907765;牽,-8.06917188278;叼,-9.95801301146;超,-6.71330355423;滗,-13.5850170619;砌,-9.15420026302;梗,-9.51428236528;抛,-7.77148372325;审,-8.74873515491;锪,-12.1499325366;貯,-9.50747961795;值,-12.6295056168;毁,-8.31304367065;捆,-8.8092605753;立,-6.60419721202;硌,-10.0824671859;彎,-8.47062253347;发,-5.8764267969;剐,-10.0183052417;乘,-7.45640267661;招,-9.33938305209;赚,-7.33118825029;绣,-8.40211054682;烧,-7.33697418735;衬,-9.62230094212;扰,-9.09863041186;翹,-9.22830823517;勻,-9.27019917688;有,-2.70899077791;暈,-8.84356925758;冒,-6.89417478444;鸣,-8.91969295305;通,-6.51820885302;隨,-6.46231170659;弹,-7.09794205679;刻,-7.84073264389;炼,-8.71287784502;乃,-7.01189571023;籠,-9.14944966026;噓,-10.4153314812;燒,-7.33697418735;付,-8.2484409832;扛,-8.68867091417;胜,-7.62246652492;摟,-8.67383384674;橫,-7.56205384769;闪,-7.78653065174;修,-7.40458641524;硷,-12.7095483245;寶,-12.4864047732;鑿,-8.8092605753;謀,-7.94240102244;侃,-11.1001104121;堪,-9.20049354699;箋,-9.64149538937;碍,-9.71799142236;錐,-8.9758548546;倒,-5.72993760842;掛,-6.97809664191;斟,-9.32798691736;眨,-8.63625717148;袭,-7.51013090661;踮,-10.9317750973;抱,-7.17221405749;撵,-9.40144136591;娶,-8.12798800416;去,-4.04579029601;促,-8.51989358248;泅,-12.3040832164;摊,-9.33652181981;換,-6.85256800478;坨,-10.7058186046;湮,-13.1150134326;拱,-7.53198715909;垒,-9.24641998511;整,-8.9310567117;驶,-14.0958426856;兼,-6.78195585399;讀,-7.36960928327;谅,-10.0183052417;趄,-13.2485448252;砍,-8.03671949004;圓,-11.0048002323;炒,-7.65277187441;思,-7.80180745357;宠,-9.36257249701;亮,-7.14790561701;掰,-9.74341652073;医,-8.71594533209;毀,-8.31304367065;佃,-9.78280892244;裂,-8.27378347005;拆,-8.56906260629;晉,-11.0835811101;論,-6.61091240234;俘,-9.41990342875;照,-7.17057498156;幹,-5.94913363342;獻,-7.36244079379;趁,-8.19868881799;漂,-9.31671919251;戀,-9.47086987234;希,-9.56324319247;吐,-7.75901695448;贖,-9.24121164001;抟,-11.4102653404;辭,-8.12458084584;測,-7.95739594817;戴,-7.23867919276;砸,-7.88390481576;钻,-7.82800982597;笺,-9.64149538937;靠,-6.58031657682;應,-5.47555153621;忍,-8.26103194856;嗑,-11.2054709277;剔,-11.0355718909;仗,-11.6391069128;赖,-8.57705199632;拟,-7.18475961655;屠,-10.1318599413;罢,-6.78284454545;若,-15.1944549743;蹬,-9.29730110666;想,-4.7451318608;绷,-9.31671919251;發,-5.8764267969;赁,-10.8377461476;尋,-7.52076684503;續,-8.64337463925;瞒,-8.40211054682;渗,-9.36845486691;搛,-12.997230397;紡,-9.48072216879;砣,-11.3877924845;鬥,-7.36085475063;储,-8.64194708726;夹,-7.88190147619;吻,-8.57571599078;嚼,-8.87729028755;流,-6.19805067288;铐,-11.2241630607;絡,-9.25691876921;糠,-10.8769668608;煩,-8.50485570512;擰,-8.86473406877;拴,-8.8092605753;盼,-8.7408299754;剿,-8.75670332456;沁,-10.0527914178;謄,-11.1871217891;飘,-8.57438176776;瞧,-7.45640267661;刪,-10.0945885465;漬,-10.3741734087;抵,-8.01210286241;夸,-9.218104065;倾,-8.32960719632;摆,-7.32352537754;哑,-9.34801619924;啐,-10.1972427005;動,-6.23014302617;聞,-7.20965158456;烩,-11.1514037065;煨,-10.6726663972;剪,-8.74240601986;转,-6.34608927935;误,-8.3171589028;擱,-8.83661270779;闻,-7.20965158456;空,-9.86173618103;蜇,-11.6391069128;碎,-8.78922651626;醒,-7.7661217801;挟,-9.4137114585;倩,-11.1169175304;熨,-10.9749472691;努,-9.51770117203;薰,-10.3346425699;掴,-11.9363584363;画,-6.82785214151;傾,-8.32960719632;豁,-10.3041058461;评,-8.93678738641;忌,-8.90473940339;廢,-7.65171142893;瓦,-12.1987227007;鋪,-7.72252289605;蹭,-9.76510934534;譯,-8.09031088131;罷,-6.78284454545;糶,-10.863721634;撇,-9.5960330153;掉,-6.72246837572;興,-7.53906432947;記,-6.70586703989;搜,-8.73142551737;悟,-8.58107075592;咧,-8.78922651626;玩,-7.64221768673;刨,-9.57405410858;溫,-7.17319879415;理,-8.54159194494;容,-7.96461619614;騸,-12.0164011439;夺,-7.84844476438;吼,-8.69918941836;錾,-10.7518037178;迁,-7.37562253049;觅,-9.94218154625;桄,-14.5013077937;擇,-9.10995556122;揉,-8.63059944776;籌,-8.75990845551;限,-7.12824740629;達,-5.29653288023;毙,-10.0296690004;捞,-8.55327280455;尽,-6.63056905489;拳,-11.6680944497;敲,-7.9255348461;懵,-10.5500640752;呼,-8.05638194025;涂,-8.44335350536;縋,-10.144598967;隱,-8.39763125602;納,-7.98437534612;隐,-8.39763125602;閒,-8.28270767404;辖,-7.35966686691;颤,-8.7252046575;垦,-9.54548073613;动,-6.23014302617;议,-7.43270998964;戳,-8.77609003836;阻,-8.77935801512;摇,-7.60968189668;捉,-7.9487999067;拈,-9.28365833025;坑,-15.1944549743;踢,-8.2522982686;巢,-10.5793344575;扳,-9.63377334328;筹,-8.75990845551;登,-7.81794684797;哼,-8.14780769645;避,-8.18504604159;躁,-10.3424247104;馏,-12.0589607584;騎,-7.14982869453;攜,-8.65631515053;舞,-7.97627813589;缠,-8.47544181991;助,-8.22937462869;贬,-9.20049354699;載,-7.62762649509;帶,-5.4312645073;咽,-8.36574290265;求,-7.12323643432;装,-6.78395652155;拉,-6.14416599047;聊,-9.09189637968;嵌,-8.84182557798;坐,-6.08947511798;識,-8.08375885132;賭,-8.51989358248;漚,-10.6197439958;學,-6.12268725218;顺,-8.29877227655;哽,-11.2626293416;啼,-9.99595794303;凿,-8.8092605753;閘,-14.5013077937;舉,-6.99060360211;咒,-9.36845486691;熔,-9.93176478539;洗,-7.46736048951;標,-7.9947766286;望,-6.324213407;斜,-7.9103201681;唧,-12.5553976447;漫,-9.16858900047;撲,-7.46559915044;疼,-8.2041984738;激,-9.0332476526;惊,-6.98950980928;奏,-7.1507916219;繡,-8.40211054682;剩,-8.02356649578;鏨,-10.7518037178;襯,-9.62230094212;擲,-8.80086422034;致,-7.57571259662;命,-12.7965597015;酿,-10.3822706189;勾,-8.80421430723;退,-6.76434588979;瞅,-7.94452943758;貓,-10.6197439958;焖,-10.8769668608;宝,-12.4864047732;废,-7.65171142893;耠,-14.5013077937;撣,-10.0704909949;爬,-7.36960928327;售,-7.42128129381;馱,-9.01030608336;徵,-7.54905727487;派,-6.08769891857;附,-7.93322988232;屈,-9.31952424344;齊,-13.4026955051;揍,-10.2891801959;觑,-9.7096580408;濕,-9.00619085121;飛,-6.86552093234;统,-7.83244442303;絞,-9.26752894832;换,-6.85256800478;查,-7.52917025582;烫,-8.89000617187;盯,-7.8110868273;念,-7.49642580402;摸,-7.28386436204;仿,-8.95417912912;邀,-8.97784887321;吃,-5.33241461167;娇,-9.7096580408;昏,-9.02275437688;谓,-8.36250140873;列,-7.30387243964;错,-7.74321328931;窜,-9.39536231983;悠,-10.5031070921;探,-7.78774424412;贩,-9.29182164089;銬,-11.2241630607;嘯,-10.5993351242;失,-7.67151405622;碰,-8.1203381581;憶,-9.95270795923;改,-6.24729920317;蒸,-8.91969295305;烀,-12.7965597015;配,-7.27291934216;恋,-9.47086987234;拌,-9.17343162495;毒,-13.4026955051;鉗,-10.1575023719;留,-6.86190603504;顛,-9.46760722671;来,-3.73014218925;触,-8.26591715613;注,-7.7661217801;问,-5.1702553466;饱,-9.32798691736;罵,-6.95538964253;黴,-10.8000058196;湿,-9.00619085121;邁,-8.76312389236;閃,-7.78653065174;堆,-8.00152075308;粉,-12.7965597015;憋,-8.85762924315;萎,-11.5835370617;鑷,-11.5308933282;演,-8.08049886473;窝,-10.2966151743;販,-9.29182164089;醫,-8.71594533209;钳,-10.1575023719;吮,-10.2386279167;碱,-14.5013077937;选,-6.81170787943;纵,-7.95452238297;缴,-9.23087563068;掷,-8.80086422034;荡,-8.80086422034;拍,-7.26785237511;佔,-5.28976814118;受,-5.43610880743;駛,-14.0958426856;属,-5.49953028976;饰,-8.68568583732;送,-6.24457068852;瞄,-9.64927752982;领,-6.58013507215;舍,-8.35927038815;掌,-8.71902225759;树,-7.03136859871;炖,-9.67700207783;喘,-8.85586089609;膠,-12.7965597015;抢,-7.49144729182;涨,-6.0183955363;爭,-7.66076126445;繳,-9.23087563068;眯,-9.32798691736;悶,-8.43404028321;漿,-12.7095483245;沾,-8.61798540525;釀,-10.3822706189;啃,-9.14001562803;遷,-7.37562253049;绊,-9.81917656661;擎,-10.1705744534;諒,-10.0183052417;返,-8.40660999199;散,-7.04658784437;拢,-8.86651819057;跨,-7.75783770906;称,-5.16932517578;鹵,-10.2456950839;胶,-12.7965597015;摹,-8.71902225759;襻,-12.0164011439;使,-4.64708927001;犁,-12.4864047732;褒,-10.4670671556;趕,-7.19578361328;化,-6.63056905489;嘘,-10.4153314812;採,-7.79322370988;劫,-9.01443832064;贪,-8.85409567057;咯,-10.0527914178;騰,-8.04062117272;纳,-7.98437534612;蘸,-9.57043746811;覽,-9.65319142914;漾,-10.787735727;嗅,-9.34225249452;鑄,-8.52495688444;拋,-7.77148372325;译,-8.09031088131;詐,-9.64149538937;卖,-6.42292969011;噘,-10.9039955331;駝,-9.51770117203;糟,-9.52457405131;握,-8.07724947113;籴,-10.7171181598;捶,-9.24381242171;逗,-9.52802828618;鎖,-7.93463536393;递,-7.89263263216;墜,-9.00619085121;羞,-9.08298763479;挡,-8.16536741014;抠,-9.66900203516;攥,-9.54548073613;撤,-8.01514700479;催,-8.30384585415;启,-8.35283949782;垮,-9.42301385116;赋,-8.24364020585;达,-5.29653288023;哄,-8.48515063404;背,-6.46911004938;取,-6.4876336509;静,-8.05162757313;祝,-8.87548686055;捡,-8.46343687381;擤,-11.5568688146;佩,-9.83786869962;醬,-10.3502678878;跪,-7.53339859193;矮,-9.99044828722;平,-6.63842575909;糴,-10.7171181598;濾,-9.43871276071;劁,-12.1499325366;匀,-9.27019917688;锄,-9.68506663767;誑,-10.1130506093;输,-7.9438194624;熗,-10.694645304;抡,-9.64149538937;挠,-9.0248442418;耢,-13.8081606132;撥,-7.7293722379;攤,-9.33652181981;疯,-8.52877125651;嘮,-11.8986181083;崴,-11.2054709277;携,-8.65631515053;趿,-11.6391069128;举,-6.99060360211;遂,-9.64927752982;啄,-10.1575023719;彈,-7.09794205679;腌,-10.1382091689;藏,-8.44218459815;赔,-8.7408299754;剖,-10.144598967;繞,-7.81732126146;試,-7.56885990216;叫,-5.22926103232;汪,-8.93487351023;闯,-7.70280950069;懷,-8.12628297391;扶,-7.82674640192;读,-7.36960928327;摺,-9.78280892244;湾,-8.16006704438;善,-7.4288858932;备,-7.62504318184;耍,-8.28071762363;攏,-8.86651819057;掠,-8.69016680076;营,-14.5013077937;温,-7.17319879415;猫,-10.6197439958;貪,-8.85409567057;熬,-8.50610026035;锯,-9.80082742794;稱,-5.16932517578;宰,-8.89000617187;綴,-9.59974359469;栽,-8.75191480783;剁,-9.74771760263;睃,-11.0355718909;烂,-8.51485578845;捋,-9.54900807665;糊,-9.30281076247;慌,-8.67383384674;殺,-6.11753171576;噙,-9.91634031506;筛,-9.42926387151;硝,-13.8081606132;绞,-9.26752894832;卫,-8.11695692073;灭,-7.35650605827;锩,-11.2432112557;飲,-7.70392557223;練,-8.31509916983;死,-5.44155778039;擺,-7.32352537754;滾,-7.84201387405;融,-8.47786020077;写,-6.12108045739;骟,-12.0164011439;搠,-9.86657880551;患,-8.0007691559;接,-6.61184864433;产,-6.65139912335;鞭,-10.3192576511;嘬,-11.0048002323;犯,-7.61784520732;缲,-14.5013077937;收,-6.11240262262;治,-6.79717207955;挺,-8.76634970161;調,-6.78306684178;织,-8.6577633767;絆,-9.81917656661;蓋,-7.23413134515;遭,-7.42086050693;跑,-6.04982714568;试,-7.56885990216;燙,-8.89000617187;歪,-8.34010047204;煮,-8.01134327255;寵,-9.36257249701;泻,-9.21304076304;捺,-11.4808829076;追,-7.32926702011;锁,-7.93463536393;逃,-7.30424676118;垂,-8.10188125832;包,-7.25600942313;搋,-14.0958426856;服,-7.37642703576;嘗,-9.06540476423;焙,-10.1192811591;缝,-8.40098884171;纜,-12.8918698813;挥,-7.88056814266;护,-8.07643876983;润,-7.91789857158;含,-6.77929450844;掺,-10.012671424;奉,-7.32390712979;術,-7.80427354607;闖,-7.70280950069;烘,-9.82847895927;络,-9.25691876921;擠,-7.86733168204;湧,-8.19048083757;鳴,-8.91969295305;統,-7.83244442303;孵,-10.3269205238;载,-7.62762649509;享,-8.97784887321;销,-8.51109402853;醃,-10.1382091689;錄,-8.01058425923;龇,-10.3041058461;掏,-8.93678738641;覓,-9.94218154625;備,-7.62504318184;挤,-7.86733168204;侧,-7.30125610475;訪,-8.69166492838;环,-7.3408501612;逮,-9.218104065;搶,-7.49144729182;访,-8.69166492838;品,-7.48111708542;镀,-10.651160192;描,-9.95270795923;赐,-7.7496217004;槓,-10.4408647832;烙,-10.1007047735;齜,-10.3041058461;塞,-7.70616145914;拥,-7.9123813162;睬,-10.5597259861;可,-4.13052339699;遮,-8.63909808248;干,-5.94913363342;摶,-11.4102653404;惹,-8.38431252418;添,-7.85816931427;顫,-8.7252046575;候,-8.37116885194;熘,-11.6109360358;增,-6.22720579144;搡,-11.2432112557;愣,-8.02818900016;戥,-12.5553976447;榨,-10.1192811591;說,-3.29513849396;匯,-6.72204996567;炮,-10.8903898811;綰,-10.0885095004;餳,-10.8903898811;蜷,-10.7756143665;活,-8.40323351157;軋,-10.0183052417;捏,-8.29372431025;評,-8.93678738641;釘,-8.65631515053;飞,-6.86552093234;无,-5.21734528189;慣,-8.71134762284;轧,-10.0183052417;賦,-8.24364020585;畫,-6.82785214151;踩,-8.25133255148;绲,-10.1575023719;懸,-8.04453813816;劃,-8.06595902861;缆,-12.8918698813;安,-6.38533871617;養,-7.55963429655;萌,-10.4322810395;挎,-10.1130506093;洒,-9.06322848481;映,-9.22064536243;攢,-9.21556920939;让,-4.81423647176;褪,-8.98787904757;听,-5.18202333477;献,-7.36244079379;破,-6.49861363145;築,-7.9770115426;捎,-8.70525004297;乐,-11.3443073726;衔,-8.68717726191;叙,-8.64910531396;食,-6.99169859264;拣,-8.93678738641;敢,-6.72037807395;臥,-8.55196817293;闭,-7.75783770906;繰,-14.5013077937;任,-5.78477206119;喂,-8.29574043996;休,-7.66719905492;訓,-8.89366917963;粜,-10.863721634;辦,-6.48070864384;瘫,-10.0239709793;親,-6.8996556153;甭,-9.66502588678;咬,-7.53057771559;纰,-14.0958426856;稳,-8.0166725581;餵,-8.29574043996;貼,-7.68020032148;设,-6.31930765744;睁,-7.7496217004;剃,-9.2054935574;煅,-11.3658135778;忆,-9.95270795923;晋,-11.0835811101;揎,-12.1499325366;潑,-8.71134762284;漤,-14.5013077937;扣,-8.38984045423;叮,-9.65319142914;罱,-12.3040832164;绰,-10.0645562594;驳,-9.67299405643;泼,-8.71134762284;需,-6.45140192407;膏,-9.47742727289;伐,-8.41112977369;讓,-4.81423647176;作,-5.5462468431;倚,-8.78922651626;掣,-9.44825178375;肥,-10.7171181598;垫,-8.74873515491;唬,-8.75830460593;刮,-8.22843078719;害,-7.82170860789;斷,-6.85734584473;抹,-8.17426426598;操,-7.41081437807;扎,-7.69006341513;滑,-8.2426828099;诓,-10.2599810412;楔,-10.740107678;鍘,-9.99595794303;做,-4.89410588512;租,-7.66236683075;杠,-10.4408647832;揣,-9.52802828618;蹦,-9.24903436569;哭,-6.64035142886;剮,-10.0183052417;绱,-10.3116530517;罰,-8.43985087481;賽,-8.54936400479;咂,-10.4069632315;熄,-10.4322810395;守,-6.99224653786;墊,-8.74873515491;尝,-9.06540476423;够,-7.4288858932;挣,-8.6221724316;急,-6.42821659404;讨,-7.79261339555;吭,-9.66900203516;焯,-11.2432112557;縱,-7.95452238297;堵,-8.75032371759;馴,-10.1771751375;掸,-10.0704909949;氽,-13.4026955051;涼,-7.9947766286;拎,-9.17100738133;蹑,-11.456785356;运,-7.22475139102;賒,-10.8377461476;盖,-7.23413134515;变,-6.21478642005;捣,-9.39536231983;恥,-10.3269205238;敷,-9.29182164089;禁,-8.0351630695;待,-6.66257023414;閉,-7.75783770906;合,-6.61372376207;亏,-7.98363652082;耐,-8.19503250679;撓,-9.0248442418;枕,-9.45466206212;骗,-8.64337463925;斩,-7.92692954647;咳,-9.08743208655;放,-6.119132814;駁,-9.67299405643;呈,-6.49310857126;赎,-9.24121164001;荒,-8.75990845551;罚,-8.43985087481;剜,-10.3904339296;啞,-9.34801619924;賣,-6.42292969011;止,-7.58014282784;拧,-8.86473406877;絮,-10.1771751375;獲,-6.44885212189;噴,-8.47062253347;淹,-9.77835457209;揽,-9.18073981825;替,-13.8081606132;缅,-9.0353595858;切,-7.77988209294;锉,-11.9755791494;踏,-8.32129114008;搓,-8.99394580025;排,-7.37965154481;粘,-8.44335350536;逛,-9.38932000538;銜,-8.68717726191;瘟,-10.5123237472;订,-8.60828331944;交,-6.88971270465;戧,-11.1691032836;皴,-12.7965597015;费,-7.68786319422;貸,-7.84201387405;耻,-10.3269205238;挽,-8.89366917963;押,-8.29978493486;乏,-9.75637566537;插,-7.63177372757;驗,-9.31392198789;遛,-10.740107678;令,-6.38012455166;执,-8.134837346;填,-8.5428831007;酱,-10.3502678878;围,-7.53859095668;濺,-9.48072216879;拼,-8.68122486338;墁,-13.8081606132;弄,-6.85998341969;率,-6.34179004659;钉,-8.65631515053;锈,-11.6680944497;見,-4.80103862371;認,-7.89804170552;戒,-8.84182557798;算,-6.66909522021;劝,-7.35808521375;猜,-7.89668669176;瞟,-9.61095866551;吞,-8.49372386475;躥,-9.03747598871;伤,-7.27219391594;控,-8.18324098694;撩,-9.62230094212;鄰,-8.52242202883;抽,-7.55770286186;驂,-14.0958426856;俏,-10.4322810395;豎,-8.82798452656;惑,-9.94743090213;扒,-8.92346654244;漏,-8.90288583474;繚,-10.5892847883;勝,-7.62246652492;費,-7.68786319422;潤,-7.91789857158;僱,-9.00004958319;割,-8.16891665966;请,-5.74022768987;浸,-9.28909312624;蹺,-10.2386279167;拽,-8.21717363266;码,-8.91969295305;骂,-6.95538964253;伏,-7.9213623783;校,-11.8622504641;檢,-8.88635653279;弯,-8.47062253347;申,-8.69466793364;躺,-7.51427933386;戽,-13.4026955051;擋,-8.16536741014;升,-6.56572040815;住,-5.40206659428;晕,-8.84356925758;柔,-9.15897354177;剝,-8.6320108806;捧,-7.92066865645;惦,-11.0835811101;摩,-12.1987227007;歷,-8.69466793364;腻,-9.09638069213;擾,-9.09863041186;射,-7.26857465756;开,-5.28354503594;沏,-10.2108483526;成,-4.99870833981;搔,-10.6094874956;计,-7.09035591815;攪,-8.6577633767;到,-3.48988488107;儲,-8.64194708726;游,-7.20049742672;抻,-11.1169175304;撿,-8.46343687381;练,-8.31509916983;請,-5.74022768987;镊,-11.5308933282;行,-5.49002830256;摔,-8.27279679014;忙,-6.549220433;停,-6.53229601263;惧,-9.15658405437;置,-6.64615078785;煲,-10.5500640752;恼,-8.75032371759;松,-7.36721407254;布,-15.1944549743;如,-4.79624069258;历,-8.69466793364;霉,-10.8000058196;疊,-9.0610569313;植,-8.94062616272;挑,-7.79689343877;爛,-8.51485578845;吟,-9.34225249452;瞞,-8.40211054682;败,-7.57669539769;沤,-10.6197439958;冲,-6.76500069719;躡,-11.456785356;繃,-9.31671919251;遇,-7.61835763367;迎,-7.25708027813;拐,-8.51737151305;擔,-8.16891665966;塗,-8.44335350536;绘,-8.87368668004;祭,-8.15918637501;屯,-8.68867091417;跺,-9.79177759242;耪,-11.2432112557;爆,-8.86117534615;圈,-8.89000617187;吊,-8.36682573979;撕,-8.90103569545;攔,-8.6041539261;炝,-10.694645304;欠,-8.25326491923;辣,-9.27556112002;搪,-11.3443073726;縮,-8.29978493486;進,-5.55538880064;覷,-9.7096580408;伸,-8.02510495762;显,-7.22440566932;嫁,-8.0343857667;采,-7.79322370988;圍,-7.53859095668;告,-7.36801183884;捐,-8.86473406877;染,-8.54159194494;兜,-9.00619085121;泥,-13.5850170619;寫,-6.12108045739;印,-7.45683869144;決,-9.12141044019;能,-4.27492185675;晾,-9.66502588678;颂,-9.31392198789;阉,-9.86173618103;贏,-7.81982595908;掐,-9.28909312624;骖,-14.0958426856;錛,-9.56324319247;生,-5.69129574576;袢,-11.3443073726;累,-8.81433243739;爱,-6.14828194853;吵,-8.67974228342;踹,-10.1318599413;居,-6.6001155737;緄,-10.1575023719;赏,-7.95094199963;扑,-7.46559915044;提,-6.42076082791;竖,-8.82798452656;翘,-9.22830823517;燜,-10.8769668608;啟,-8.35283949782;回,-5.50626681905;淤,-8.9959762578;拦,-8.6041539261;呵,-8.90845687979;迸,-9.64927752982;捻,-9.12371724629;賺,-7.33118825029;聽,-5.18202333477;懼,-9.15658405437;綁,-8.74240601986;嚇,-7.46780130945;醉,-8.0603612531;舔,-9.41990342875;砘,-11.9363584363;膩,-9.09638069213;怨,-8.52877125651;挪,-8.85057454017;傳,-6.54168248864;露,-7.82296567908;抿,-9.53846316347;雇,-9.00004958319;燉,-9.67700207783;頌,-9.31392198789;扔,-7.78350309871;绗,-12.7095483245;願,-6.89616433994;煞,-9.36257249701;恨,-7.39511157608;端,-7.0065995306;饮,-7.70392557223;赶,-7.19578361328;拿,-5.88101664431;腾,-8.04062117272;焉,-9.41990342875;谋,-7.94240102244;撐,-8.4563024797;礙,-9.71799142236;题,-13.2485448252;君,-10.2528125517;定,-6.11035832889;負,-7.29753031803;誤,-8.3171589028;昧,-9.58498317911;訂,-8.60828331944;缭,-10.5892847883;唱,-7.12448682523;環,-7.3408501612;鑲,-9.13533177871;论,-6.61091240234;朽,-10.787735727;管,-6.25828832475;竄,-9.39536231983;嗆,-9.28095196866;煉,-8.71287784502;救,-7.11514678224;捕,-8.86651819057;拔,-7.93463536393;壘,-9.24641998511;呛,-9.28095196866;雜,-7.98216050579;賠,-8.7408299754;虧,-7.98363652082;揪,-8.66212068207;驯,-10.1771751375;铰,-10.2599810412;摻,-10.012671424;瞇,-9.32798691736;吆,-10.1838196802;趋,-7.9970196202;撑,-8.4563024797;投,-6.39403964115;丢,-7.82045311494;肩,-15.1944549743;截,-8.54676660073;决,-9.12141044019;防,-7.61426555635;呆,-7.6731369941;淋,-9.36257249701;削,-8.85057454017;晒,-8.5136002955;驚,-6.98950980928;睜,-7.7496217004;鏟,-8.91969295305;遞,-7.89263263216;泡,-8.16271371553;赠,-9.23344963467;解,-7.07535413666;续,-8.64337463925;逼,-7.71177314614;迷,-8.22184872299;裹,-8.57304932253;怕,-6.41366750596;聾,-10.0411633798;震,-8.04140333936;瀉,-9.21304076304;渍,-10.3741734087;锛,-9.56324319247;溢,-9.80995991151;认,-7.89804170552;墮,-10.231610344;貶,-9.20049354699;攻,-7.27947196845;寄,-7.56642384736;测,-7.95739594817;乍,-9.9061879436;塌,-8.84531598291;摑,-11.9363584363;擦,-7.76850131722;臨,-7.61938327479;壮,-8.29070771671;关,-6.80169186126;牵,-8.06917188278;觸,-8.26591715613;征,-7.54905727487;圆,-11.0048002323;焊,-10.1972427005;抓,-7.22129954085;攒,-9.21556920939;怔,-8.37991207703;编,-7.40086817092;掩,-8.50734636643;劳,-8.82113518472;甲,-11.0200677044;買,-6.12303190151;讹,-10.2891801959;施,-8.45867496005;肿,-8.59322485557;挾,-9.4137114585;叉,-9.20299042719;滋,-9.30557701596;蹿,-9.03747598871;拓,-8.9310567117;盛,-7.46603919445;习,-8.97784887321;赢,-7.81982595908;揩,-9.39839722353;搽,-10.8506495524;慪,-11.3232539634;屬,-5.49953028976;壯,-8.29070771671;側,-7.30125610475;劈,-9.08077279446;窘,-10.6197439958;借,-7.17090258189;縫,-8.40098884171;傴,-15.1944549743;覺,-7.54001174782;蔽,-10.1068586391;撼,-10.3822706189;飄,-8.57438176776;蹋,-10.5597259861;跌,-6.4150513764;打,-5.38714798023;詣,-11.2432112557;拨,-7.7293722379;幫,-7.28129978837;顯,-7.22440566932;困,-8.58107075592;闲,-8.28270767404;缀,-9.59974359469;横,-7.56205384769;嘆,-7.43954470227;錈,-11.2432112557;討,-7.79261339555;垛,-10.6618554811;熟,-8.28370418633;亡,-9.26752894832;传,-6.54168248864;谢,-7.91789857158;挨,-8.33904617568;怪,-7.61733304342;皱,-9.10541009885;喊,-6.97971914091;磅,-12.6295056168;遊,-7.20049742672;赌,-8.51989358248;站,-5.80421263704;存,-7.24712994728;營,-14.5013077937;诣,-11.2432112557;择,-9.10995556122;积,-7.69337285003;驮,-9.01030608336;呲,-11.3658135778;郵,-8.81433243739;兴,-7.53906432947;混,-7.81919919628;歸,-6.85974335247;找,-5.79946243019;铁,-11.5568688146;涌,-8.19048083757;撒,-8.02818900016;耕,-8.88817968735;騙,-8.64337463925;喜,-7.05384793144;办,-6.48070864384;渡,-8.31099238788;推,-6.80418647645;夯,-12.7095483245;贷,-7.84201387405;溶,-8.95417912912;樹,-7.03136859871;许,-11.8271591443;落,-6.74233377962;愿,-6.89616433994;淌,-9.39839722353;擒,-8.73142551737;關,-6.80169186126;勞,-8.82113518472;补,-7.3463018881;鑽,-7.82800982597;緬,-9.0353595858;癱,-10.0239709793;即,-5.11198476623;铲,-8.91969295305;燴,-11.1514037065;起,-4.73338226559;拾,-8.67678370138;
+S,x:璃,-7.0573240493;缂,-6.21002618892;螅,-4.08976265272;躇,-8.56140144608;榉,-6.6518589412;猊,-7.75047122986;殍,-9.25454862664;娌,-5.88725279665;犏,-7.2396456061;褳,-6.90317336948;馑,-5.643630714;蠐,-5.7733085373;肓,-5.97740389365;蜒,-5.69920056515;徕,-7.38274644974;戔,-8.56140144608;檗,-8.33825789477;锖,-5.99645208862;鞅,-6.11905441071;咛,-6.21002618892;綮,-8.84908351853;娜,-3.01038172598;頏,-9.9476958072;礞,-8.33825789477;瀠,-8.84908351853;蜢,-7.64511071421;媧,-5.82056142216;崦,-7.00325682803;胝,-6.85665335384;惝,-9.25454862664;霪,-9.9476958072;氳,-4.66449207846;餮,-6.05587550909;喱,-7.11448246314;莉,-5.20276367884;挲,-7.11448246314;螵,-8.84908351853;舴,-6.45118824573;芷,-5.83682194303;鰷,-7.75047122986;萸,-7.00325682803;炻,-7.0573240493;茺,-8.56140144608;螽,-8.33825789477;蘼,-6.51370860272;皿,-7.17510708496;蜊,-7.64511071421;俅,-4.32367830101;蝥,-9.9476958072;祆,-5.42590723015;醍,-9.25454862664;峋,-6.21002618892;閶,-6.03567280177;噌,-9.9476958072;髏,-6.72881998233;氌,-9.25454862664;蔹,-8.15593633797;芏,-5.69920056515;蕖,-6.18649569151;緙,-6.21002618892;菝,-7.17510708496;滟,-8.33825789477;蕞,-6.95196353365;磣,-6.45118824573;睢,-9.9476958072;篥,-9.25454862664;輊,-9.9476958072;硨,-6.18649569151;鍪,-4.98485117694;袼,-7.17510708496;飩,-5.40440102493;僳,-8.56140144608;轲,-6.25881635309;毵,-8.33825789477;剴,-7.11448246314;狷,-8.00178565815;啶,-7.11448246314;跹,-6.18649569151;擻,-5.22919693591;柽,-7.2396456061;橼,-7.64511071421;啾,-5.3938189156;蠃,-8.56140144608;螂,-7.11448246314;蘅,-5.97740389365;訇,-8.15593633797;萋,-7.2396456061;徊,-9.9476958072;蜍,-8.00178565815;驃,-6.2341237405;迤,-5.45905943747;荬,-9.25454862664;唑,-5.61696246691;咐,-6.39234774571;氓,-6.95196353365;鷯,-7.0573240493;蘗,-8.33825789477;蠛,-6.33677789456;辚,-7.46278915741;挝,-5.45905943747;蛄,-5.94036262197;儡,-8.84908351853;蛱,-6.36417686874;玢,-7.46278915741;鹇,-6.85665335384;嘧,-6.2341237405;缧,-5.63020769366;莪,-6.33677789456;漭,-9.25454862664;檬,-5.23816560589;鸯,-6.76964197685;尜,-8.84908351853;饉,-5.643630714;栳,-9.9476958072;鞲,-6.01587017448;犴,-7.86825426552;苈,-6.31010964747;椹,-7.30863847759;囵,-9.25454862664;蔞,-7.38274644974;骼,-6.33677789456;啁,-6.95196353365;鹂,-9.25454862664;毂,-5.69920056515;筅,-7.30863847759;苄,-5.49334851095;癇,-6.72881998233;姆,-3.14641277273;啉,-6.39234774571;魍,-6.33677789456;鏵,-6.45118824573;旎,-6.28413416107;鵑,-4.75473895631;礤,-9.9476958072;颃,-9.9476958072;觎,-8.56140144608;跫,-5.28425671309;艟,-7.38274644974;跞,-6.85665335384;啡,-6.28413416107;蓠,-9.9476958072;睥,-9.25454862664;蚧,-4.81189737015;癧,-8.84908351853;嗦,-4.78864050799;腩,-6.90317336948;蓽,-8.00178565815;蟪,-6.31010964747;忪,-8.84908351853;葳,-8.84908351853;狴,-9.9476958072;婷,-5.1519052616;舨,-6.85665335384;窀,-7.30863847759;偻,-6.54649842554;荽,-7.11448246314;艿,-4.50961649828;绔,-7.17510708496;愀,-7.00325682803;嚅,-6.68959926918;圄,-9.9476958072;萆,-7.11448246314;阊,-6.03567280177;亍,-4.73820965436;斓,-4.51835017825;窕,-6.03567280177;吖,-6.90317336948;咙,-7.64511071421;瘅,-9.25454862664;龉,-5.36272832853;圜,-5.7135893026;螄,-6.14103331743;碡,-9.25454862664;綣,-4.55862407738;蘢,-5.72818810202;纥,-6.68959926918;羧,-5.78881272384;逦,-6.07649479629;襝,-7.38274644974;鶓,-7.5498005344;鸪,-6.14103331743;纭,-5.35257595707;鞯,-4.29872156904;軻,-6.25881635309;鴰,-5.97740389365;熳,-6.68959926918;娲,-5.82056142216;蜴,-9.9476958072;榈,-5.7733085373;褸,-8.56140144608;鶻,-5.45905943747;蘺,-9.9476958072;隽,-4.76031000136;蓁,-8.56140144608;鵡,-7.46278915741;痃,-8.84908351853;芊,-5.43683630068;髅,-6.72881998233;鰍,-5.54097655994;鴣,-6.14103331743;欏,-5.06489388461;嵘,-6.18649569151;芎,-5.85335124498;荜,-8.00178565815;俟,-4.6394281098;灞,-5.24721544141;陧,-7.75047122986;箢,-6.81220159127;朧,-5.57824795473;哩,-7.11448246314;饨,-5.40440102493;痫,-6.72881998233;婪,-6.81220159127;獬,-5.41509631405;胱,-5.3938189156;酰,-4.82970199478;觳,-5.56566917253;仵,-9.9476958072;蒌,-7.38274644974;葶,-7.75047122986;虺,-6.28413416107;狽,-5.67102968818;靼,-6.14103331743;毿,-8.33825789477;劂,-9.25454862664;娅,-6.07649479629;宄,-6.25881635309;圇,-9.25454862664;癀,-8.33825789477;喈,-8.56140144608;椋,-4.91074320479;岖,-8.56140144608;匏,-6.25881635309;胬,-6.4819599044;礓,-8.56140144608;躒,-6.85665335384;傖,-7.75047122986;鹃,-4.75473895631;鶘,-6.45118824573;褛,-8.56140144608;蟮,-4.20790289502;爝,-9.9476958072;鸺,-5.94036262197;唣,-8.56140144608;躚,-6.18649569151;黽,-5.3938189156;伧,-7.75047122986;璦,-5.38334761573;怩,-8.33825789477;鸝,-9.25454862664;芪,-5.48178768855;舭,-7.75047122986;洳,-6.09754820549;鞴,-5.7733085373;欷,-7.17510708496;嶸,-6.18649569151;蔻,-8.00178565815;菪,-6.11905441071;撾,-5.45905943747;瑁,-5.78881272384;諤,-5.50504455071;鶉,-5.82056142216;荇,-7.64511071421;鳆,-9.9476958072;豉,-8.00178565815;藶,-6.31010964747;篌,-8.84908351853;蹌,-7.00325682803;鵂,-5.94036262197;嫒,-6.58039997721;婕,-5.72818810202;菔,-6.28413416107;獗,-5.63020769366;蛸,-6.68959926918;葙,-8.33825789477;耥,-9.9476958072;櫚,-5.7733085373;俜,-6.25881635309;卟,-5.29373545704;擞,-5.22919693591;珑,-7.46278915741;蟀,-6.51370860272;噥,-5.36272832853;埤,-9.25454862664;灩,-8.33825789477;嵫,-6.6518589412;囪,-6.61549129703;婭,-6.07649479629;獯,-6.01587017448;聱,-9.9476958072;凰,-9.9476958072;赳,-6.58039997721;狲,-5.16857231409;詵,-5.1193820699;杷,-6.95196353365;莨,-6.85665335384;聹,-9.25454862664;狺,-8.00178565815;艽,-9.9476958072;鹕,-6.45118824573;蚪,-6.61549129703;萄,-6.45118824573;錆,-5.99645208862;徉,-8.33825789477;裣,-7.38274644974;榍,-7.2396456061;栌,-6.76964197685;閬,-5.68501593016;瘐,-8.00178565815;蚓,-5.72818810202;斕,-4.51835017825;谔,-5.50504455071;鹘,-5.45905943747;貅,-9.25454862664;媛,-5.08788340284;倜,-6.72881998233;蜞,-9.9476958072;蚣,-6.4819599044;闶,-5.68501593016;馇,-7.11448246314;謦,-9.9476958072;莩,-7.46278915741;樨,-9.9476958072;阆,-5.68501593016;尬,-6.85665335384;傯,-7.30863847759;鲡,-8.84908351853;隉,-7.75047122986;亳,-5.59098698051;袷,-5.95871176064;漶,-9.25454862664;镆,-5.69920056515;蠼,-6.01587017448;圾,-8.15593633797;俁,-5.02044212204;剀,-7.11448246314;仃,-6.36417686874;楂,-6.72881998233;骺,-6.11905441071;潆,-8.84908351853;韉,-4.29872156904;雋,-4.76031000136;煊,-5.72818810202;蓣,-9.25454862664;瓏,-7.46278915741;魎,-6.01587017448;忑,-8.84908351853;苓,-6.81220159127;蕒,-9.25454862664;鹩,-7.0573240493;茏,-5.72818810202;疸,-8.56140144608;韙,-6.90317336948;菥,-7.64511071421;葜,-7.46278915741;裟,-6.51370860272;忡,-7.5498005344;噠,-5.97740389365;苣,-5.82056142216;蚺,-6.95196353365;鷥,-6.85665335384;呤,-6.18649569151;胧,-5.57824795473;蝤,-8.84908351853;艨,-6.76964197685;偬,-7.30863847759;烯,-4.86629144222;蹰,-9.9476958072;仳,-9.25454862664;鰒,-9.9476958072;坶,-6.16350617328;毹,-9.9476958072;穸,-5.90464453937;狻,-4.76591225691;蕺,-7.00325682803;蓿,-6.81220159127;轾,-9.9476958072;猁,-9.9476958072;嚀,-6.21002618892;齪,-5.7135893026;氇,-9.25454862664;菀,-5.67102968818;戋,-8.56140144608;蠖,-5.72818810202;沌,-8.00178565815;苒,-7.75047122986;玎,-7.64511071421;芐,-5.49334851095;瘓,-5.36272832853;蒔,-6.76964197685;砗,-6.18649569151;鼙,-5.80456108081;芘,-7.38274644974;瘛,-5.44788613687;碜,-6.45118824573;躅,-9.25454862664;跄,-7.00325682803;嬡,-6.58039997721;骠,-6.2341237405;咤,-7.38274644974;轤,-9.25454862664;嚨,-7.64511071421;榪,-5.80456108081;缈,-7.0573240493;哳,-7.0573240493;缱,-4.35670882669;鹉,-7.46278915741;舳,-6.90317336948;咴,-6.07649479629;轂,-5.69920056515;莶,-8.00178565815;犸,-9.9476958072;墼,-7.17510708496;獁,-9.9476958072;蒡,-9.9476958072;湃,-5.97740389365;苷,-4.60058827648;蟆,-4.8417503333;魉,-6.01587017448;狈,-5.67102968818;艋,-6.2341237405;轳,-9.25454862664;阢,-9.9476958072;硗,-5.95871176064;菡,-7.38274644974;跚,-6.90317336948;絝,-7.17510708496;绻,-4.55862407738;濞,-6.4819599044;罡,-5.88725279665;鹑,-5.82056142216;縲,-5.63020769366;杩,-5.80456108081;櫨,-6.76964197685;痪,-5.36272832853;眈,-6.85665335384;僬,-7.38274644974;虼,-4.81779709228;鵒,-5.7135893026;緲,-7.0573240493;瑷,-5.38334761573;櫸,-6.6518589412;蓯,-5.28425671309;恿,-5.42590723015;綸,-5.87015836329;墅,-5.95871176064;嶇,-8.56140144608;娆,-6.76964197685;檉,-7.2396456061;嬈,-6.76964197685;螋,-8.15593633797;蠊,-5.75804106517;喏,-6.76964197685;匐,-6.31010964747;吒,-7.38274644974;駘,-8.00178565815;鏌,-5.69920056515;鹋,-7.5498005344;紜,-5.35257595707;薟,-8.00178565815;蘞,-8.15593633797;鲦,-7.75047122986;椤,-5.06489388461;蛴,-5.7733085373;倪,-8.33825789477;肭,-6.6518589412;脬,-8.33825789477;诜,-5.1193820699;莳,-6.76964197685;吲,-6.95196353365;礴,-9.25454862664;薷,-6.76964197685;鸶,-6.85665335384;暹,-5.94036262197;氲,-4.66449207846;蛞,-5.95871176064;唼,-8.00178565815;鶿,-7.0573240493;狁,-6.01587017448;蟥,-9.9476958072;柃,-9.9476958072;龊,-5.7135893026;鳅,-5.54097655994;凇,-5.17701118273;鹆,-5.7135893026;蛉,-5.47035899272;魈,-6.68959926918;琶,-6.03567280177;跏,-6.25881635309;湎,-5.65723636605;蛑,-5.83682194303;裢,-6.90317336948;萏,-8.00178565815;蟛,-5.48178768855;瑚,-7.2396456061;哝,-5.36272832853;剞,-9.25454862664;蝠,-5.90464453937;俣,-5.02044212204;遢,-8.33825789477;蕤,-7.5498005344;邐,-6.07649479629;麽,-4.1577356363;躏,-8.84908351853;旯,-7.30863847759;囱,-6.61549129703;衩,-9.9476958072;噶,-4.56320074441;鹚,-7.0573240493;鱺,-8.84908351853;磽,-5.95871176064;槿,-6.54649842554;繾,-4.35670882669;玀,-9.25454862664;铞,-8.56140144608;逅,-7.0573240493;跎,-5.88725279665;紇,-6.68959926918;嚆,-9.9476958072;螈,-5.92234411647;氍,-8.84908351853;閌,-5.68501593016;檎,-8.00178565815;蜓,-6.54649842554;陂,-5.90464453937;茛,-8.84908351853;栝,-8.15593633797;躪,-8.84908351853;苁,-5.28425671309;徠,-7.38274644974;倥,-7.75047122986;妤,-8.84908351853;瘩,-8.84908351853;徨,-7.86825426552;肪,-5.34252562121;疬,-8.84908351853;阏,-6.31010964747;骀,-8.00178565815;羰,-6.36417686874;耵,-8.84908351853;蛳,-6.14103331743;唷,-5.1519052616;纶,-5.87015836329;鸹,-5.97740389365;鴦,-6.76964197685;猻,-5.16857231409;傺,-7.75047122986;閼,-6.31010964747;唿,-6.2341237405;芾,-5.69920056515;齬,-5.36272832853;猡,-9.25454862664;魃,-5.83682194303;僂,-6.54649842554;蕷,-9.25454862664;癉,-9.25454862664;铧,-6.45118824573;潋,-8.84908351853;烊,-5.57824795473;聍,-9.25454862664;臾,-8.15593633797;穑,-5.3938189156;俐,-7.75047122986;哒,-5.97740389365;槔,-6.4819599044;韪,-6.90317336948;瀲,-8.84908351853;惚,-6.72881998233;櫞,-7.64511071421;穡,-5.3938189156;蝣,-9.25454862664;蛺,-6.36417686874;蘧,-7.75047122986;躕,-9.9476958072;乩,-5.19410561609;覦,-8.56140144608;硭,-7.2396456061;嵯,-6.31010964747;彳,-7.30863847759;磲,-9.25454862664;鷴,-6.85665335384;啷,-5.87015836329;蚨,-5.94036262197;黾,-5.3938189156;轔,-7.46278915741;
+S,yg:尔,0.0;爾,0.0;
+S,y:呀,-2.55355888711;呃,-6.66015866972;呗,-6.12523549437;哇,-4.89031788619;哉,-5.48087847798;么,-3.60946099045;啊,-2.04206423275;嘍,-6.37859282428;矣,-3.98966119693;乎,-4.92269228285;呐,-5.7071519223;噢,-5.0187180262;呕,-6.45506318827;唔,-5.75861021958;吗,-1.97367079182;嘛,-3.6375549177;嗎,-1.97367079182;哟,-5.09222048819;唄,-6.12523549437;猗,-7.78346357097;呢,-1.62035931542;欤,-6.51651596749;吧,-1.45080580578;否,-5.6915995093;哩,-3.14172040475;耶,-7.16827793188;啦,-3.1238051997;咯,-10.3737307364;兮,-5.60871184949;焉,-9.86290511265;喲,-5.09222048819;呵,-5.20514247655;歟,-6.51651596749;吶,-5.7071519223;啵,-6.5895411025;嘞,-7.41190001454;喽,-6.37859282428;麼,-3.60946099045;嘔,-6.45506318827;
+S,zg:冉,0.0;
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/prob_start.utf8 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/prob_start.utf8
new file mode 100644
index 0000000000..433750d56b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/prob_start.utf8
@@ -0,0 +1,259 @@
+#初始状态的概率
+#格式
+#状态:概率
+B,a:-4.7623052146
+B,ad:-6.68006603678
+B,ag:-3.14e+100
+B,an:-8.69708322302
+B,b:-5.01837436211
+B,bg:-3.14e+100
+B,c:-3.42388018495
+B,d:-3.97504752976
+B,df:-8.88897423083
+B,dg:-3.14e+100
+B,e:-8.56355183039
+B,en:-3.14e+100
+B,f:-5.49163041848
+B,g:-3.14e+100
+B,h:-13.53336513
+B,i:-6.11578472756
+B,in:-3.14e+100
+B,j:-5.05761912847
+B,jn:-3.14e+100
+B,k:-3.14e+100
+B,l:-4.90588358466
+B,ln:-3.14e+100
+B,m:-3.6524299819
+B,mg:-3.14e+100
+B,mq:-6.7869530014
+B,n:-1.69662577975
+B,ng:-3.14e+100
+B,nr:-2.23104959138
+B,nrfg:-5.87372217541
+B,nrt:-4.98564273352
+B,ns:-2.8228438315
+B,nt:-4.84609166818
+B,nz:-3.94698846058
+B,o:-8.43349870215
+B,p:-4.20098413209
+B,q:-6.99812385896
+B,qe:-3.14e+100
+B,qg:-3.14e+100
+B,r:-3.40981877908
+B,rg:-3.14e+100
+B,rr:-12.4347528413
+B,rz:-7.94611647157
+B,s:-5.52267359084
+B,t:-3.36474790945
+B,tg:-3.14e+100
+B,u:-9.1639172775
+B,ud:-3.14e+100
+B,ug:-3.14e+100
+B,uj:-3.14e+100
+B,ul:-3.14e+100
+B,uv:-3.14e+100
+B,uz:-3.14e+100
+B,v:-2.67405848743
+B,vd:-9.04472876024
+B,vg:-3.14e+100
+B,vi:-12.4347528413
+B,vn:-4.33156108902
+B,vq:-12.1470707689
+B,w:-3.14e+100
+B,x:-3.14e+100
+B,y:-9.84448567586
+B,yg:-3.14e+100
+B,z:-7.04568111149
+B,zg:-3.14e+100
+E,a:-3.14e+100
+E,ad:-3.14e+100
+E,ag:-3.14e+100
+E,an:-3.14e+100
+E,b:-3.14e+100
+E,bg:-3.14e+100
+E,c:-3.14e+100
+E,d:-3.14e+100
+E,df:-3.14e+100
+E,dg:-3.14e+100
+E,e:-3.14e+100
+E,en:-3.14e+100
+E,f:-3.14e+100
+E,g:-3.14e+100
+E,h:-3.14e+100
+E,i:-3.14e+100
+E,in:-3.14e+100
+E,j:-3.14e+100
+E,jn:-3.14e+100
+E,k:-3.14e+100
+E,l:-3.14e+100
+E,ln:-3.14e+100
+E,m:-3.14e+100
+E,mg:-3.14e+100
+E,mq:-3.14e+100
+E,n:-3.14e+100
+E,ng:-3.14e+100
+E,nr:-3.14e+100
+E,nrfg:-3.14e+100
+E,nrt:-3.14e+100
+E,ns:-3.14e+100
+E,nt:-3.14e+100
+E,nz:-3.14e+100
+E,o:-3.14e+100
+E,p:-3.14e+100
+E,q:-3.14e+100
+E,qe:-3.14e+100
+E,qg:-3.14e+100
+E,r:-3.14e+100
+E,rg:-3.14e+100
+E,rr:-3.14e+100
+E,rz:-3.14e+100
+E,s:-3.14e+100
+E,t:-3.14e+100
+E,tg:-3.14e+100
+E,u:-3.14e+100
+E,ud:-3.14e+100
+E,ug:-3.14e+100
+E,uj:-3.14e+100
+E,ul:-3.14e+100
+E,uv:-3.14e+100
+E,uz:-3.14e+100
+E,v:-3.14e+100
+E,vd:-3.14e+100
+E,vg:-3.14e+100
+E,vi:-3.14e+100
+E,vn:-3.14e+100
+E,vq:-3.14e+100
+E,w:-3.14e+100
+E,x:-3.14e+100
+E,y:-3.14e+100
+E,yg:-3.14e+100
+E,z:-3.14e+100
+E,zg:-3.14e+100
+M,a:-3.14e+100
+M,ad:-3.14e+100
+M,ag:-3.14e+100
+M,an:-3.14e+100
+M,b:-3.14e+100
+M,bg:-3.14e+100
+M,c:-3.14e+100
+M,d:-3.14e+100
+M,df:-3.14e+100
+M,dg:-3.14e+100
+M,e:-3.14e+100
+M,en:-3.14e+100
+M,f:-3.14e+100
+M,g:-3.14e+100
+M,h:-3.14e+100
+M,i:-3.14e+100
+M,in:-3.14e+100
+M,j:-3.14e+100
+M,jn:-3.14e+100
+M,k:-3.14e+100
+M,l:-3.14e+100
+M,ln:-3.14e+100
+M,m:-3.14e+100
+M,mg:-3.14e+100
+M,mq:-3.14e+100
+M,n:-3.14e+100
+M,ng:-3.14e+100
+M,nr:-3.14e+100
+M,nrfg:-3.14e+100
+M,nrt:-3.14e+100
+M,ns:-3.14e+100
+M,nt:-3.14e+100
+M,nz:-3.14e+100
+M,o:-3.14e+100
+M,p:-3.14e+100
+M,q:-3.14e+100
+M,qe:-3.14e+100
+M,qg:-3.14e+100
+M,r:-3.14e+100
+M,rg:-3.14e+100
+M,rr:-3.14e+100
+M,rz:-3.14e+100
+M,s:-3.14e+100
+M,t:-3.14e+100
+M,tg:-3.14e+100
+M,u:-3.14e+100
+M,ud:-3.14e+100
+M,ug:-3.14e+100
+M,uj:-3.14e+100
+M,ul:-3.14e+100
+M,uv:-3.14e+100
+M,uz:-3.14e+100
+M,v:-3.14e+100
+M,vd:-3.14e+100
+M,vg:-3.14e+100
+M,vi:-3.14e+100
+M,vn:-3.14e+100
+M,vq:-3.14e+100
+M,w:-3.14e+100
+M,x:-3.14e+100
+M,y:-3.14e+100
+M,yg:-3.14e+100
+M,z:-3.14e+100
+M,zg:-3.14e+100
+S,a:-3.90253968313
+S,ad:-11.0484584802
+S,ag:-6.95411391796
+S,an:-12.8402179494
+S,b:-6.47288876397
+S,bg:-3.14e+100
+S,c:-4.78696679586
+S,d:-3.90391976418
+S,df:-3.14e+100
+S,dg:-8.9483976513
+S,e:-5.94251300628
+S,en:-3.14e+100
+S,f:-5.19482024998
+S,g:-6.50782681533
+S,h:-8.65056320738
+S,i:-3.14e+100
+S,in:-3.14e+100
+S,j:-4.91199211964
+S,jn:-3.14e+100
+S,k:-6.94032059583
+S,l:-3.14e+100
+S,ln:-3.14e+100
+S,m:-3.26920065212
+S,mg:-10.8253149289
+S,mq:-3.14e+100
+S,n:-3.85514838976
+S,ng:-4.9134348611
+S,nr:-4.48366310396
+S,nrfg:-3.14e+100
+S,nrt:-3.14e+100
+S,ns:-3.14e+100
+S,nt:-12.1470707689
+S,nz:-3.14e+100
+S,o:-8.46446092775
+S,p:-2.98684018136
+S,q:-4.88865861826
+S,qe:-3.14e+100
+S,qg:-3.14e+100
+S,r:-2.76353367841
+S,rg:-10.2752685919
+S,rr:-3.14e+100
+S,rz:-3.14e+100
+S,s:-3.14e+100
+S,t:-3.14e+100
+S,tg:-6.27284253188
+S,u:-6.94032059583
+S,ud:-7.72823016105
+S,ug:-7.53940370266
+S,uj:-6.85251045118
+S,ul:-8.41537131755
+S,uv:-8.15808672229
+S,uz:-9.29925862537
+S,v:-3.05329230341
+S,vd:-3.14e+100
+S,vg:-5.94301818437
+S,vi:-3.14e+100
+S,vn:-11.4539235883
+S,vq:-3.14e+100
+S,w:-3.14e+100
+S,x:-8.42741965607
+S,y:-6.19707946995
+S,yg:-13.53336513
+S,z:-3.14e+100
+S,zg:-3.14e+100
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/prob_trans.utf8 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/prob_trans.utf8
new file mode 100644
index 0000000000..87e5ac5ca7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/pos_dict/prob_trans.utf8
@@ -0,0 +1,5222 @@
+#状态转移概率
+#格式
+#状态1:状态2:概率
+#状态1 转移到 状态2 的概率
+B,ad:E,ad:-0.000747901397848
+B,ad:M,ad:-7.19861333713
+B,a:E,a:-0.00506484530696
+B,a:M,a:-5.28796303711
+B,an:E,an:0.0
+B,b:E,b:-0.067539177158
+B,b:M,b:-2.72862697875
+B,c:E,c:-0.0444273816395
+B,c:M,c:-3.13603074686
+B,d:E,d:-0.0467730952155
+B,df:E,df:0.0
+B,d:M,d:-3.0857425241
+B,e:E,e:-0.0587076008268
+B,e:M,e:-2.86439627149
+B,f:E,f:-0.0191403231531
+B,f:M,f:-3.96551290641
+B,h:E,h:0.0
+B,i:E,i:-7.5100009019
+B,i:M,i:-0.000547730571859
+B,in:M,in:0.0
+B,j:E,j:-0.254320737406
+B,j:M,j:-1.49362592274
+B,jn:M,jn:0.0
+B,l:E,l:-3.6805460997
+B,l:M,l:-0.0255323995577
+B,ln:M,ln:0.0
+B,m:E,m:-0.186159279362
+B,m:M,m:-1.77278871764
+B,mq:E,mq:-0.931622800806
+B,mq:M,mq:-0.50073330223
+B,n:E,n:-0.138697076603
+B,n:M,n:-2.04401015914
+B,nr:E,nr:-0.918799475432
+B,nrfg:E,nrfg:-0.689886308105
+B,nrfg:M,nrfg:-0.696418721101
+B,nr:M,nr:-0.509156617805
+B,nrt:E,nrt:-0.198890468074
+B,nrt:M,nrt:-1.71279856874
+B,ns:E,ns:-0.30583032091
+B,ns:M,ns:-1.33374585682
+B,nt:E,nt:-5.85632199504
+B,nt:M,nt:-0.00286585251536
+B,nz:E,nz:-0.511652858514
+B,nz:M,nz:-0.915051161433
+B,o:E,o:-0.156158082797
+B,o:M,o:-1.93394962524
+B,p:E,p:-0.000518055038744
+B,p:M,p:-7.56568808528
+B,qe:E,qe:0.0
+B,q:E,q:-0.233275519342
+B,q:M,q:-1.56990643006
+B,r:E,r:-0.0168762530045
+B,r:M,r:-4.0902740524
+B,rr:E,rr:-2.23952695703
+B,rr:M,rr:-0.112618878108
+B,rz:E,rz:0.0
+B,s:E,s:-0.0154659511181
+B,s:M,s:-4.1768373825
+B,t:E,t:-0.0619844827287
+B,t:M,t:-2.81170336382
+B,u:E,u:-2.17049215918e-05
+B,u:M,u:-10.7379823741
+B,vd:E,vd:0.0
+B,v:E,v:-0.0124092665146
+B,vi:M,vi:0.0
+B,v:M,v:-4.39551000291
+B,vn:E,vn:-0.0110264918405
+B,vn:M,vn:-4.51296273242
+B,vq:E,vq:0.0
+B,y:E,y:-0.00462369177184
+B,y:M,y:-5.37887276329
+B,z:E,z:-0.554344029774
+B,z:M,z:-0.854370382922
+E,a:B,a:-3.43015094949
+E,a:B,ad:-6.53035936987
+E,a:B,an:-6.90589027016
+E,a:B,b:-5.52598355893
+E,a:B,c:-4.06937061749
+E,a:B,d:-4.11726131205
+E,a:B,df:-9.96526780887
+E,a:B,e:-11.323391293
+E,a:B,f:-5.71758922673
+E,a:B,i:-6.03849694681
+E,a:B,j:-6.10483889494
+E,a:B,l:-5.52295274334
+E,a:B,m:-4.43663268726
+E,a:B,mq:-8.36156057115
+E,a:B,n:-1.47940607564
+E,a:B,nr:-4.83165663609
+E,a:B,nrfg:-8.45171166814
+E,a:B,nrt:-7.19446639721
+E,a:B,ns:-5.32170142537
+E,a:B,nt:-7.64288008858
+E,a:B,nz:-6.51937024829
+E,a:B,o:-9.78294625208
+E,a:B,p:-6.09585410854
+E,a:B,q:-7.90748776397
+E,a:B,r:-4.47975980638
+E,a:B,rr:-13.5206158704
+E,a:B,rz:-9.96526780887
+E,a:B,s:-6.18824666443
+E,a:B,t:-5.03946445029
+E,a:B,u:-6.33220313386
+E,a:B,v:-2.20689772766
+E,a:B,vd:-8.58614193723
+E,a:B,vi:-11.5747057213
+E,a:B,vn:-3.35480251563
+E,a:B,vq:-12.8274686898
+E,a:B,y:-8.45802083733
+E,a:B,z:-6.33069369961
+E,ad:B,a:-3.66949066308
+E,ad:B,ad:-5.57742156407
+E,ad:B,an:-7.40885951711
+E,ad:B,b:-6.44241900155
+E,ad:B,c:-5.34199675764
+E,ad:B,d:-4.55815301561
+E,ad:B,df:-9.17244810937
+E,ad:B,f:-6.62040215675
+E,ad:B,i:-5.89216365638
+E,ad:B,j:-6.86156421357
+E,ad:B,l:-5.9978725434
+E,ad:B,m:-5.59589784023
+E,ad:B,mq:-8.82414141511
+E,ad:B,n:-2.67190947154
+E,ad:B,nr:-5.99092807105
+E,ad:B,nrfg:-9.25945948636
+E,ad:B,nrt:-7.74533175373
+E,ad:B,ns:-6.24570870731
+E,ad:B,nt:-8.94930455806
+E,ad:B,nz:-7.48296748927
+E,ad:B,o:-9.57791321748
+E,ad:B,p:-5.43676458906
+E,ad:B,q:-9.25945948636
+E,ad:B,r:-5.405450876
+E,ad:B,s:-7.06223490903
+E,ad:B,t:-6.15202322323
+E,ad:B,u:-6.37924009993
+E,ad:B,v:-0.698701882478
+E,ad:B,vd:-9.01829742955
+E,ad:B,vi:-10.9642075786
+E,ad:B,vn:-3.06468310657
+E,ad:B,y:-9.71144461011
+E,ad:B,z:-7.85069226939
+E,ad:S,a:-5.55479616455
+E,ad:S,ad:-9.86559528993
+E,ad:S,ag:-9.17244810937
+E,ad:S,b:-8.88476603692
+E,ad:S,c:-4.48800474249
+E,ad:S,d:-3.53587438441
+E,ad:S,dg:-10.271060398
+E,ad:S,e:-10.9642075786
+E,ad:S,f:-5.48356865526
+E,ad:S,g:-8.71291578
+E,ad:S,h:-9.86559528993
+E,ad:S,j:-7.72552912644
+E,ad:S,k:-7.27532812449
+E,ad:S,m:-5.53705734021
+E,ad:S,n:-5.82547228188
+E,ad:S,ng:-6.82904102186
+E,ad:S,nr:-7.74533175373
+E,ad:S,o:-9.17244810937
+E,ad:S,p:-3.22615528091
+E,ad:S,q:-6.01544768822
+E,ad:S,r:-5.27723222226
+E,ad:S,tg:-9.17244810937
+E,ad:S,u:-7.21470350267
+E,ad:S,ud:-7.38068864015
+E,ad:S,ug:-7.96847530505
+E,ad:S,uj:-2.78332663661
+E,ad:S,ul:-5.25709731385
+E,ad:S,uv:-3.67459705715
+E,ad:S,uz:-8.88476603692
+E,ad:S,v:-2.24497190578
+E,ad:S,vg:-6.30076848449
+E,ad:S,x:-9.71144461011
+E,ad:S,y:-7.30064593247
+E,an:B,a:-3.60523675167
+E,an:B,ad:-5.9328784245
+E,an:B,an:-5.82008293035
+E,an:B,b:-5.47413194978
+E,an:B,c:-3.35424584328
+E,an:B,d:-3.24087671227
+E,an:B,df:-9.03895875522
+E,an:B,f:-4.96708704885
+E,an:B,i:-5.84711160274
+E,an:B,j:-5.97868796053
+E,an:B,l:-5.42804084258
+E,an:B,m:-4.79046351317
+E,an:B,mq:-7.94034646655
+E,an:B,n:-1.62962043384
+E,an:B,nr:-4.68224992853
+E,an:B,nrfg:-8.19166089483
+E,an:B,nrt:-7.30435769983
+E,an:B,ns:-5.35007930111
+E,an:B,nt:-7.57262168643
+E,an:B,nz:-6.64106348242
+E,an:B,o:-10.1375710439
+E,an:B,p:-5.44622316166
+E,an:B,q:-8.34581157466
+E,an:B,r:-4.10448482209
+E,an:B,s:-6.35338140997
+E,an:B,t:-4.84930401319
+E,an:B,u:-6.73637366223
+E,an:B,v:-2.14868879058
+E,an:B,vd:-9.03895875522
+E,an:B,vi:-9.44442386333
+E,an:B,vn:-3.01068023499
+E,an:B,y:-8.19166089483
+E,an:B,z:-6.14858699732
+E,an:S,a:-5.09414592697
+E,an:S,ad:-10.1375710439
+E,an:S,ag:-8.05812950221
+E,an:S,b:-7.30435769983
+E,an:S,c:-2.72843459997
+E,an:S,d:-2.93490984737
+E,an:S,dg:-8.75127668277
+E,an:S,e:-7.83498595089
+E,an:S,f:-4.56541701171
+E,an:S,g:-7.6526643941
+E,an:S,h:-9.44442386333
+E,an:S,j:-6.52665313124
+E,an:S,k:-7.49851371427
+E,an:S,m:-4.69949173497
+E,an:S,n:-4.6404028186
+E,an:S,ng:-5.10061844148
+E,an:S,nr:-6.95951721354
+E,an:S,p:-3.52418682551
+E,an:S,q:-5.8068377036
+E,an:S,r:-3.51350581609
+E,an:S,tg:-6.64106348242
+E,an:S,u:-4.47808882813
+E,an:S,ud:-6.01043665884
+E,an:S,ug:-7.36498232165
+E,an:S,uj:-2.07892733167
+E,an:S,ul:-4.36301949834
+E,an:S,uv:-4.27110298696
+E,an:S,uz:-6.64106348242
+E,an:S,v:-3.07195768029
+E,an:S,vg:-6.02669717972
+E,an:S,x:-9.44442386333
+E,an:S,y:-5.22491615815
+E,a:S,a:-4.84130382947
+E,a:S,ad:-10.8125656693
+E,a:S,ag:-7.86812669009
+E,a:S,an:-10.8125656693
+E,a:S,b:-7.36575777634
+E,a:S,c:-3.54457512514
+E,a:S,d:-3.37842642759
+E,a:S,dg:-9.64941485945
+E,a:S,e:-9.03197950063
+E,a:S,f:-5.15564189192
+E,a:S,g:-7.75229487457
+E,a:S,h:-9.73642623644
+E,a:S,j:-6.56121735823
+E,a:S,k:-6.49596683991
+E,a:S,m:-4.73967475679
+E,a:S,mg:-11.5747057213
+E,a:S,n:-4.19107125091
+E,a:S,ng:-4.93482988748
+E,a:S,nr:-6.35899386742
+E,a:S,o:-10.6302441125
+E,a:S,p:-3.68685360032
+E,a:S,q:-4.9846009247
+E,a:S,r:-3.94771789129
+E,a:S,rg:-12.8274686898
+E,a:S,tg:-7.77761268255
+E,a:S,u:-4.92387240019
+E,a:S,ud:-5.81625470245
+E,a:S,ug:-7.62897165853
+E,a:S,uj:-1.513488188
+E,a:S,ul:-4.42624767464
+E,a:S,uv:-3.47732289813
+E,a:S,uz:-7.2706406281
+E,a:S,v:-3.15481039812
+E,a:S,vg:-6.3809555344
+E,a:S,vn:-9.99425534574
+E,a:S,x:-9.23015642921
+E,a:S,y:-5.50694172753
+E,b:B,a:-4.70767330257
+E,b:B,ad:-7.80015013342
+E,b:B,an:-6.28328929702
+E,b:B,b:-4.55755778193
+E,b:B,c:-6.21846213394
+E,b:B,d:-5.57752003265
+E,b:B,f:-5.62899338285
+E,b:B,h:-12.354027025
+E,b:B,i:-7.34339173092
+E,b:B,j:-5.48293573041
+E,b:B,l:-5.22472947609
+E,b:B,ln:-12.354027025
+E,b:B,m:-4.71102338946
+E,b:B,mq:-8.50387942331
+E,b:B,n:-0.748850600346
+E,b:B,nr:-5.46443571667
+E,b:B,nrfg:-9.17597319467
+E,b:B,nrt:-7.65354665923
+E,b:B,ns:-4.89353671919
+E,b:B,nt:-6.74455522984
+E,b:B,nz:-5.69730050084
+E,b:B,o:-11.6608798445
+E,b:B,p:-6.15149150783
+E,b:B,q:-7.81073224275
+E,b:B,r:-5.39367929592
+E,b:B,rz:-10.9677326639
+E,b:B,s:-6.10212314185
+E,b:B,t:-6.11570239998
+E,b:B,u:-6.61423411284
+E,b:B,v:-2.30224878607
+E,b:B,vd:-9.86912037523
+E,b:B,vn:-2.88270796343
+E,b:B,vq:-11.6608798445
+E,b:B,y:-10.408116876
+E,b:B,z:-7.75890717489
+E,b:S,a:-4.85737458685
+E,b:S,ag:-8.16437228299
+E,b:S,b:-5.64961267006
+E,b:S,bg:-12.354027025
+E,b:S,c:-4.68033889575
+E,b:S,d:-4.70767330257
+E,b:S,dg:-10.2745854833
+E,b:S,f:-4.60341229225
+E,b:S,g:-7.74885683903
+E,b:S,h:-8.21089229863
+E,b:S,j:-6.21629997093
+E,b:S,k:-6.42443788163
+E,b:S,m:-4.80599805509
+E,b:S,n:-3.63634497285
+E,b:S,ng:-4.00194435367
+E,b:S,nr:-7.27885320979
+E,b:S,o:-10.9677326639
+E,b:S,p:-3.90382870243
+E,b:S,q:-4.4288695128
+E,b:S,r:-5.68834330724
+E,b:S,tg:-8.32867533429
+E,b:S,u:-5.63139723016
+E,b:S,ud:-8.8276665004
+E,b:S,ug:-8.69046537889
+E,b:S,uj:-2.51246806911
+E,b:S,ul:-7.4636778968
+E,b:S,uv:-6.06431145411
+E,b:S,uz:-8.02329368473
+E,b:S,v:-2.72563442943
+E,b:S,vg:-5.93566208908
+E,b:S,vn:-9.46365526712
+E,b:S,x:-8.85751946355
+E,b:S,y:-8.4222013923
+E,b:S,yg:-12.354027025
+E,c:B,a:-4.31650578773
+E,c:B,ad:-5.65771320636
+E,c:B,an:-7.8109278427
+E,c:B,b:-4.97404476976
+E,c:B,c:-4.09644155987
+E,c:B,d:-3.4848930232
+E,c:B,df:-8.5686135444
+E,c:B,e:-12.1929544774
+E,c:B,f:-5.18309397546
+E,c:B,h:-12.8861016579
+E,c:B,i:-5.37786288326
+E,c:B,in:-12.8861016579
+E,c:B,j:-5.21894340262
+E,c:B,l:-5.07656033328
+E,c:B,m:-3.73891410096
+E,c:B,mq:-6.46936937542
+E,c:B,n:-1.84588748462
+E,c:B,nr:-3.86402043542
+E,c:B,nrfg:-7.30260534915
+E,c:B,nrt:-6.29855164311
+E,c:B,ns:-3.89217751652
+E,c:B,nt:-5.97734687862
+E,c:B,nz:-5.65989264783
+E,c:B,o:-9.66722583307
+E,c:B,p:-4.47160586476
+E,c:B,q:-6.47264270077
+E,c:B,r:-2.85540893116
+E,c:B,rr:-10.9401915089
+E,c:B,rz:-8.3974652882
+E,c:B,s:-5.15944799309
+E,c:B,t:-3.67286548285
+E,c:B,u:-8.50407502326
+E,c:B,v:-1.93340216703
+E,c:B,vd:-8.49165250326
+E,c:B,vn:-4.15848547961
+E,c:B,vq:-12.8861016579
+E,c:B,y:-12.8861016579
+E,c:B,z:-7.00556867153
+E,c:S,a:-4.5545154143
+E,c:S,ad:-10.8066601163
+E,c:S,ag:-7.93734176756
+E,c:S,an:-11.7874893693
+E,c:S,b:-6.74621710571
+E,c:S,c:-5.59308397816
+E,c:S,d:-2.59003162312
+E,c:S,dg:-10.0528883139
+E,c:S,e:-9.94166267877
+E,c:S,f:-5.5485139144
+E,c:S,g:-7.76213767853
+E,c:S,h:-8.2513726697
+E,c:S,j:-5.77377421322
+E,c:S,k:-8.8607499672
+E,c:S,m:-4.50679217388
+E,c:S,mg:-11.7874893693
+E,c:S,n:-4.45294246213
+E,c:S,ng:-5.84819569449
+E,c:S,nr:-5.76727540887
+E,c:S,nt:-12.8861016579
+E,c:S,o:-9.55389714776
+E,c:S,p:-2.48362829644
+E,c:S,q:-5.58562884367
+E,c:S,r:-2.53648701557
+E,c:S,rg:-12.1929544774
+E,c:S,tg:-7.47000125573
+E,c:S,u:-6.28623115872
+E,c:S,ud:-7.79235145713
+E,c:S,ug:-7.81719745571
+E,c:S,uj:-6.15986825558
+E,c:S,ul:-8.80856421403
+E,c:S,uv:-8.30113417926
+E,c:S,uz:-9.75060744201
+E,c:S,v:-2.22456909326
+E,c:S,vg:-6.44356149147
+E,c:S,vn:-10.2470443283
+E,c:S,x:-9.2225400118
+E,c:S,y:-8.24171075879
+E,d:B,a:-2.80173873214
+E,d:B,ad:-4.9767258062
+E,d:B,an:-6.51755450339
+E,d:B,b:-6.08857674593
+E,d:B,c:-5.38994736874
+E,d:B,d:-3.81237359769
+E,d:B,df:-8.52519310659
+E,d:B,e:-11.6105375388
+E,d:B,f:-6.38950626625
+E,d:B,i:-4.68445130317
+E,d:B,j:-6.95538742054
+E,d:B,l:-5.46957598058
+E,d:B,m:-4.50721547631
+E,d:B,mq:-8.6465539636
+E,d:B,n:-2.89340801244
+E,d:B,nr:-5.09268164486
+E,d:B,nrfg:-8.67934378642
+E,d:B,nrt:-7.03325255634
+E,d:B,ns:-5.89268780697
+E,d:B,nt:-8.17252618405
+E,d:B,nz:-7.13889874547
+E,d:B,o:-8.73415202292
+E,d:B,p:-5.72686702154
+E,d:B,q:-8.23039356637
+E,d:B,r:-4.51298868822
+E,d:B,rz:-10.1636185559
+E,d:B,s:-6.54636147781
+E,d:B,t:-5.61657611153
+E,d:B,u:-6.99418016346
+E,d:B,v:-1.09927348396
+E,d:B,vd:-7.59190479835
+E,d:B,vi:-12.0805411681
+E,d:B,vn:-4.06514778923
+E,d:B,vq:-9.70099503395
+E,d:B,y:-10.694246807
+E,d:B,z:-6.32860365154
+E,df:B,a:-4.68663776923
+E,df:B,ad:-5.14211329791
+E,df:B,an:-7.30159754726
+E,df:B,b:-7.01391547481
+E,df:B,c:-5.62762111369
+E,df:B,d:-3.95755857944
+E,df:B,df:-5.56699649187
+E,df:B,f:-7.70706265537
+E,df:B,i:-4.3748581452
+E,df:B,j:-8.40020983593
+E,df:B,l:-5.76115250632
+E,df:B,m:-4.93447393313
+E,df:B,mq:-7.70706265537
+E,df:B,n:-3.45856741332
+E,df:B,nr:-4.7366481898
+E,df:B,nrfg:-7.70706265537
+E,df:B,nrt:-8.40020983593
+E,df:B,ns:-7.01391547481
+E,df:B,p:-6.00231456313
+E,df:B,q:-8.40020983593
+E,df:B,r:-3.3376148029
+E,df:B,s:-6.09762474294
+E,df:B,t:-6.45429968688
+E,df:B,u:-7.01391547481
+E,df:B,v:-1.86062388031
+E,df:B,vd:-8.40020983593
+E,df:B,vn:-4.68663776923
+E,df:B,z:-7.30159754726
+E,df:S,a:-3.9004001656
+E,df:S,ag:-8.40020983593
+E,df:S,b:-7.70706265537
+E,df:S,c:-4.90370227446
+E,df:S,d:-2.27771702642
+E,df:S,f:-5.45577085676
+E,df:S,j:-8.40020983593
+E,df:S,m:-4.24132675257
+E,df:S,n:-4.4881868305
+E,df:S,ng:-7.01391547481
+E,df:S,nr:-6.6084503667
+E,df:S,p:-2.72688656876
+E,df:S,q:-6.45429968688
+E,df:S,r:-2.55377106087
+E,df:S,u:-5.06800532576
+E,df:S,uj:-4.87384931131
+E,df:S,ul:-3.61271809315
+E,df:S,uv:-8.40020983593
+E,df:S,v:-1.1229621093
+E,df:S,vg:-5.62762111369
+E,df:S,y:-5.45577085676
+E,d:S,a:-3.96144033045
+E,d:S,ad:-10.4711032556
+E,d:S,ag:-7.94697589271
+E,d:S,b:-8.06596157433
+E,d:S,c:-5.22492164352
+E,d:S,d:-2.73327766195
+E,d:S,dg:-9.57910521634
+E,d:S,e:-9.56284469547
+E,d:S,f:-5.4999020308
+E,d:S,g:-7.88786070514
+E,d:S,h:-9.73873536194
+E,d:S,j:-7.1204976601
+E,d:S,k:-9.47047137534
+E,d:S,m:-4.67553194536
+E,d:S,mg:-11.2920838077
+E,d:S,n:-5.03302394673
+E,d:S,ng:-6.3273338101
+E,d:S,nr:-6.90892145458
+E,d:S,o:-9.51559181062
+E,d:S,p:-2.66618298123
+E,d:S,q:-5.61377455328
+E,d:S,r:-4.30107420062
+E,d:S,rg:-13.6899790805
+E,d:S,tg:-7.62852216159
+E,d:S,u:-6.08657974078
+E,d:S,ud:-7.0792830358
+E,d:S,ug:-7.31665929094
+E,d:S,uj:-3.66365461802
+E,d:S,ul:-7.1121177228
+E,d:S,uv:-4.3798838754
+E,d:S,uz:-8.39166171397
+E,d:S,v:-1.68075499966
+E,d:S,vg:-5.70347414196
+E,d:S,vn:-11.4927545032
+E,d:S,x:-10.0523929208
+E,d:S,y:-7.48340315379
+E,e:B,a:-6.49828214948
+E,e:B,c:-5.11198778836
+E,e:B,d:-3.66506880542
+E,e:B,e:-3.13098631949
+E,e:B,j:-6.49828214948
+E,e:B,l:-5.11198778836
+E,e:B,m:-2.71409251556
+E,e:B,mq:-6.49828214948
+E,e:B,n:-2.29358953009
+E,e:B,nr:-3.45375971175
+E,e:B,ns:-5.80513496892
+E,e:B,nz:-5.80513496892
+E,e:B,p:-6.49828214948
+E,e:B,q:-6.49828214948
+E,e:B,r:-2.80940269536
+E,e:B,rz:-6.49828214948
+E,e:B,s:-6.49828214948
+E,e:B,t:-4.70652268025
+E,e:B,v:-3.93333279201
+E,e:B,vn:-6.49828214948
+E,e:S,a:-2.83472050335
+E,e:S,b:-5.80513496892
+E,e:S,c:-5.80513496892
+E,e:S,d:-3.20244528347
+E,e:S,e:-5.39966986081
+E,e:S,j:-4.30105757214
+E,e:S,m:-3.93333279201
+E,e:S,n:-3.72569342724
+E,e:S,ng:-4.30105757214
+E,e:S,nr:-4.30105757214
+E,e:S,p:-4.30105757214
+E,e:S,q:-5.80513496892
+E,e:S,r:-1.46784422808
+E,e:S,u:-5.11198778836
+E,e:S,ug:-5.80513496892
+E,e:S,uj:-5.11198778836
+E,e:S,ul:-4.4188406078
+E,e:S,uv:-4.01337549969
+E,e:S,v:-2.43783913893
+E,e:S,vg:-4.55237200042
+E,e:S,y:-3.55384317031
+E,f:B,a:-4.33738477882
+E,f:B,ad:-5.93008475076
+E,f:B,an:-6.99262098296
+E,f:B,b:-5.07581417183
+E,f:B,c:-4.41353817718
+E,f:B,d:-3.4622158466
+E,f:B,df:-9.06421934718
+E,f:B,f:-4.53397477521
+E,f:B,i:-5.74098350698
+E,f:B,j:-5.41844313348
+E,f:B,l:-5.68727196774
+E,f:B,m:-3.36398482574
+E,f:B,mq:-7.88556435083
+E,f:B,n:-1.78390962354
+E,f:B,nr:-4.02483463979
+E,f:B,nrfg:-7.34817169968
+E,f:B,nrt:-6.30341858069
+E,f:B,ns:-3.51977459292
+E,f:B,nt:-6.39007069775
+E,f:B,nz:-5.6936959727
+E,f:B,o:-8.46951223943
+E,f:B,p:-5.25270752334
+E,f:B,q:-6.81292754857
+E,f:B,r:-3.80250113308
+E,f:B,rr:-12.52995525
+E,f:B,rz:-9.23411838397
+E,f:B,s:-5.20151789708
+E,f:B,t:-5.09984111141
+E,f:B,u:-7.26209709091
+E,f:B,v:-2.03809786928
+E,f:B,vd:-7.95524427147
+E,f:B,vn:-4.27334790535
+E,f:B,vq:-11.8368080694
+E,f:B,y:-10.9205173375
+E,f:B,z:-6.26275470143
+E,f:S,a:-4.30579173734
+E,f:S,ad:-10.7381957807
+E,f:S,ag:-7.90498243669
+E,f:S,an:-11.8368080694
+E,f:S,b:-6.84978264096
+E,f:S,c:-4.00538930423
+E,f:S,d:-2.67613074246
+E,f:S,dg:-8.97460718849
+E,f:S,e:-10.5840451009
+E,f:S,f:-4.9181128504
+E,f:S,g:-7.38246077316
+E,f:S,h:-9.06421934718
+E,f:S,j:-5.64342360745
+E,f:S,k:-7.60270156482
+E,f:S,m:-4.19909163675
+E,f:S,mg:-10.5840451009
+E,f:S,n:-4.34935430238
+E,f:S,ng:-5.23557795069
+E,f:S,nr:-5.80013117949
+E,f:S,o:-9.31107942511
+E,f:S,p:-3.06118140591
+E,f:S,q:-5.03330281181
+E,f:S,r:-3.49230298583
+E,f:S,rg:-11.8368080694
+E,f:S,t:-12.52995525
+E,f:S,tg:-7.60270156482
+E,f:S,u:-5.48243802862
+E,f:S,ud:-8.55966333642
+E,f:S,ug:-8.11111464218
+E,f:S,uj:-2.07747961258
+E,f:S,ul:-6.65502451912
+E,f:S,uv:-7.16866308427
+E,f:S,uz:-9.82190504887
+E,f:S,v:-2.34268070096
+E,f:S,vg:-6.12969780467
+E,f:S,vn:-11.8368080694
+E,f:S,x:-9.58551627081
+E,f:S,y:-7.14088352016
+E,h:B,d:-4.44265125649
+E,h:B,n:-0.299516530099
+E,h:B,nz:-3.74950407593
+E,h:B,v:-3.05635689537
+E,h:S,b:-4.44265125649
+E,h:S,n:-2.83321334406
+E,h:S,uj:-2.24542667915
+E,i:B,a:-4.71147680001
+E,i:B,ad:-5.81338398457
+E,i:B,an:-8.34906295973
+E,i:B,b:-6.24264483035
+E,i:B,c:-3.46602432274
+E,i:B,d:-3.15871367225
+E,i:B,df:-9.24984950507
+E,i:B,e:-10.7161865739
+E,i:B,f:-4.89610364351
+E,i:B,i:-3.38076991238
+E,i:B,j:-6.79751902572
+E,i:B,l:-4.5835118582
+E,i:B,m:-4.37055021304
+E,i:B,mq:-7.62514412051
+E,i:B,n:-2.78814097299
+E,i:B,nr:-3.80610067954
+E,i:B,nrfg:-7.36045156628
+E,i:B,nrt:-6.49667886869
+E,i:B,ns:-5.14023747072
+E,i:B,nt:-7.62514412051
+E,i:B,nz:-6.36376040897
+E,i:B,o:-8.31829130107
+E,i:B,p:-5.52322972297
+E,i:B,q:-7.70392499836
+E,i:B,r:-3.72808094223
+E,i:B,rz:-9.86888871348
+E,i:B,s:-5.68357237305
+E,i:B,t:-4.362976626
+E,i:B,u:-5.7697935485
+E,i:B,v:-2.46009844005
+E,i:B,vd:-9.73535732085
+E,i:B,vn:-5.56097005096
+E,i:B,y:-7.10526866122
+E,i:B,z:-6.20899679624
+E,in:B,d:-2.03688192726
+E,in:B,m:-3.13549421593
+E,in:B,n:-3.13549421593
+E,in:B,nr:-3.13549421593
+E,in:B,nrt:-2.03688192726
+E,in:B,nz:-2.44234703537
+E,in:S,c:-3.13549421593
+E,in:S,d:-2.03688192726
+E,in:S,p:-1.74919985481
+E,in:S,tg:-3.13549421593
+E,in:S,v:-2.44234703537
+E,in:S,y:-3.13549421593
+E,i:S,a:-4.7603492044
+E,i:S,ad:-9.04221014029
+E,i:S,ag:-7.70392499836
+E,i:S,an:-11.121651682
+E,i:S,b:-6.90952408409
+E,i:S,c:-3.60821524821
+E,i:S,d:-2.81209785533
+E,i:S,dg:-8.63674503218
+E,i:S,e:-8.00813637276
+E,i:S,f:-4.9170939194
+E,i:S,g:-7.16083851237
+E,i:S,h:-8.51896199653
+E,i:S,j:-6.28536977502
+E,i:S,k:-6.29333794467
+E,i:S,m:-4.69516322451
+E,i:S,n:-4.6485328884
+E,i:S,ng:-5.29417773497
+E,i:S,nr:-5.68574865247
+E,i:S,o:-9.32989221274
+E,i:S,p:-3.35163955961
+E,i:S,q:-5.31802387235
+E,i:S,r:-3.09091675787
+E,i:S,rg:-11.8147988625
+E,i:S,tg:-6.94726441208
+E,i:S,u:-4.26308664718
+E,i:S,ud:-7.45809003584
+E,i:S,ug:-7.40807961527
+E,i:S,uj:-1.63686646433
+E,i:S,ul:-4.02534429645
+E,i:S,uv:-2.55044390225
+E,i:S,uz:-7.61010624314
+E,i:S,v:-2.64872390685
+E,i:S,vg:-5.7865203423
+E,i:S,vn:-10.7161865739
+E,i:S,x:-9.41690358973
+E,i:S,y:-4.79550220882
+E,j:B,a:-4.81738115028
+E,j:B,ad:-5.71856911397
+E,j:B,an:-7.64539066646
+E,j:B,b:-5.0929628158
+E,j:B,c:-5.27872671678
+E,j:B,d:-3.96908999455
+E,j:B,df:-11.8648983716
+E,j:B,f:-5.03186663885
+E,j:B,i:-6.7897245564
+E,j:B,j:-3.69245155329
+E,j:B,l:-6.13479858866
+E,j:B,m:-4.10571093313
+E,j:B,mq:-7.80445536109
+E,j:B,n:-1.18832093587
+E,j:B,nr:-4.74042010914
+E,j:B,nrfg:-8.49760254165
+E,j:B,nrt:-7.03658463434
+E,j:B,ns:-4.2223742374
+E,j:B,nt:-6.03595275403
+E,j:B,nz:-5.05035547438
+E,j:B,o:-11.1717511911
+E,j:B,p:-5.97325415981
+E,j:B,q:-7.35403886512
+E,j:B,r:-5.15072784173
+E,j:B,rz:-9.15684817054
+E,j:B,s:-5.76010513922
+E,j:B,t:-4.53580463539
+E,j:B,u:-6.57159354691
+E,j:B,v:-1.76621416984
+E,j:B,vd:-7.50818954495
+E,j:B,vn:-2.99944554588
+E,j:B,vq:-11.8648983716
+E,j:B,y:-11.8648983716
+E,j:B,z:-8.68684454129
+E,jn:B,n:-0.916290731874
+E,jn:B,vn:-1.60943791243
+E,jn:S,m:-1.60943791243
+E,jn:S,uj:-1.60943791243
+E,j:S,a:-4.73640242596
+E,j:S,ad:-10.766286083
+E,j:S,ag:-8.28137943318
+E,j:S,b:-5.30812001548
+E,j:S,c:-3.88077641293
+E,j:S,d:-3.30694718775
+E,j:S,dg:-9.29994901418
+E,j:S,e:-10.766286083
+E,j:S,f:-4.40325797943
+E,j:S,g:-8.30955031015
+E,j:S,h:-10.2554604592
+E,j:S,j:-5.28703701392
+E,j:S,k:-7.19206953718
+E,j:S,m:-4.07089928213
+E,j:S,n:-3.58089906739
+E,j:S,ng:-5.04270098102
+E,j:S,nr:-6.74093439223
+E,j:S,o:-11.8648983716
+E,j:S,p:-3.57084873154
+E,j:S,q:-3.77265896491
+E,j:S,r:-5.33547953338
+E,j:S,tg:-5.9984303147
+E,j:S,u:-4.49655868533
+E,j:S,ud:-8.56906150563
+E,j:S,ug:-8.25398045899
+E,j:S,uj:-3.07189328034
+E,j:S,ul:-6.90907131404
+E,j:S,uv:-7.85756518641
+E,j:S,uz:-8.43091116715
+E,j:S,v:-2.84076710318
+E,j:S,vg:-5.65229227589
+E,j:S,vn:-10.766286083
+E,j:S,x:-10.0731389024
+E,j:S,y:-8.05823588187
+E,j:S,yg:-11.8648983716
+E,l:B,a:-4.28199430821
+E,l:B,ad:-5.63135541429
+E,l:B,an:-7.78197323443
+E,l:B,b:-5.20698615154
+E,l:B,c:-3.64877582831
+E,l:B,d:-3.43032130853
+E,l:B,df:-9.49495182581
+E,l:B,e:-10.2834091862
+E,l:B,f:-4.84359225735
+E,l:B,h:-11.8928470986
+E,l:B,i:-4.81282059869
+E,l:B,j:-5.72323636612
+E,l:B,l:-4.48856798057
+E,l:B,m:-4.23273277943
+E,l:B,mq:-7.2294080045
+E,l:B,n:-1.98746134879
+E,l:B,nr:-4.18309023415
+E,l:B,nrfg:-7.63016722157
+E,l:B,nrt:-6.78085931025
+E,l:B,ns:-4.47166957001
+E,l:B,nt:-6.677911341
+E,l:B,nz:-5.98205045457
+E,l:B,o:-9.18479689751
+E,l:B,p:-5.11976672295
+E,l:B,q:-7.33897020701
+E,l:B,r:-3.59854748975
+E,l:B,rz:-8.89711482505
+E,l:B,s:-5.79252814659
+E,l:B,t:-4.40735549058
+E,l:B,u:-5.91649618931
+E,l:B,v:-2.24683577647
+E,l:B,vd:-9.12025837637
+E,l:B,vi:-11.8928470986
+E,l:B,vn:-3.87323430421
+E,l:B,y:-8.45885989412
+E,l:B,z:-6.84299109136
+E,ln:B,a:-3.66356164613
+E,ln:B,d:-2.97041446557
+E,ln:B,n:-1.46633706879
+E,ln:B,ns:-3.66356164613
+E,ln:B,nt:-3.66356164613
+E,ln:B,t:-3.66356164613
+E,ln:B,v:-1.58412010445
+E,ln:S,c:-3.66356164613
+E,ln:S,d:-2.27726728501
+E,ln:S,f:-3.66356164613
+E,ln:S,n:-2.56494935746
+E,ln:S,p:-2.97041446557
+E,ln:S,uj:-2.27726728501
+E,ln:S,v:-3.66356164613
+E,l:S,a:-4.58430430107
+E,l:S,ad:-10.7942348099
+E,l:S,ag:-8.25526093888
+E,l:S,b:-6.49468439709
+E,l:S,c:-3.28563040454
+E,l:S,d:-2.81649536663
+E,l:S,dg:-9.49495182581
+E,l:S,e:-8.39633953714
+E,l:S,f:-4.15348789592
+E,l:S,g:-7.74971237222
+E,l:S,h:-9.18479689751
+E,l:S,j:-6.02637904167
+E,l:S,k:-6.68884041153
+E,l:S,m:-4.3332876026
+E,l:S,mg:-11.8928470986
+E,l:S,n:-4.06840116773
+E,l:S,ng:-5.24645658376
+E,l:S,nr:-6.01791636776
+E,l:S,o:-9.81340555693
+E,l:S,p:-3.0200795687
+E,l:S,q:-4.84359225735
+E,l:S,r:-3.14501849012
+E,l:S,tg:-7.42693897995
+E,l:S,u:-4.56703959601
+E,l:S,ud:-7.24845619947
+E,l:S,ug:-7.21071587148
+E,l:S,uj:-1.99940988193
+E,l:S,ul:-4.66736562583
+E,l:S,uv:-4.09555582506
+E,l:S,uz:-7.8153096547
+E,l:S,v:-2.59339755156
+E,l:S,vg:-6.43752598325
+E,l:S,vn:-10.5065527375
+E,l:S,x:-10.1010876294
+E,l:S,y:-5.23355317892
+E,m:B,a:-3.43129818524
+E,m:B,ad:-6.00682118068
+E,m:B,an:-7.1102401205
+E,m:B,b:-4.5609797564
+E,m:B,c:-4.73922297904
+E,m:B,d:-3.94441582615
+E,m:B,df:-8.87733902791
+E,m:B,e:-11.0368232773
+E,m:B,f:-4.38121134145
+E,m:B,h:-13.0517262978
+E,m:B,i:-5.17850924294
+E,m:B,j:-4.91872607922
+E,m:B,l:-5.34331563055
+E,m:B,m:-3.99617013963
+E,m:B,mq:-8.14645151937
+E,m:B,n:-1.24284185863
+E,m:B,nr:-4.13642835269
+E,m:B,nrfg:-8.17271944619
+E,m:B,nrt:-6.70258730643
+E,m:B,ns:-4.44542393132
+E,m:B,nt:-6.70084058109
+E,m:B,nz:-5.53257634014
+E,m:B,o:-8.86207155578
+E,m:B,p:-6.04186579589
+E,m:B,q:-6.60046629804
+E,m:B,r:-4.2749419141
+E,m:B,rr:-13.0517262978
+E,m:B,rz:-10.3775776484
+E,m:B,s:-5.70346056897
+E,m:B,t:-4.52053158675
+E,m:B,u:-8.03114067286
+E,m:B,v:-2.28679498303
+E,m:B,vd:-9.22308490132
+E,m:B,vn:-4.1368313889
+E,m:B,vq:-11.547648901
+E,m:B,y:-8.885061074
+E,m:B,z:-5.45458088714
+E,mq:B,a:-4.10208154472
+E,mq:B,ad:-6.25190388317
+E,mq:B,an:-7.41505469297
+E,mq:B,b:-5.13949827237
+E,mq:B,c:-5.01111710572
+E,mq:B,d:-3.8926234465
+E,mq:B,f:-4.30005899859
+E,mq:B,i:-5.69228809523
+E,mq:B,j:-4.47061571381
+E,mq:B,l:-5.59050540092
+E,mq:B,m:-4.919098207
+E,mq:B,mq:-8.33134542485
+E,mq:B,n:-1.15751482717
+E,mq:B,nr:-4.919098207
+E,mq:B,nrfg:-9.42995771351
+E,mq:B,nrt:-7.41505469297
+E,mq:B,ns:-4.50633379641
+E,mq:B,nt:-7.03206244072
+E,mq:B,nz:-6.13412084751
+E,mq:B,o:-9.42995771351
+E,mq:B,p:-6.19127926135
+E,mq:B,q:-8.17719474502
+E,mq:B,r:-4.48475022474
+E,mq:B,s:-5.26329248971
+E,mq:B,t:-6.08005362624
+E,mq:B,u:-6.51218698143
+E,mq:B,v:-2.27027708179
+E,mq:B,vd:-7.41505469297
+E,mq:B,vn:-3.3307604666
+E,mq:B,y:-10.1231048941
+E,mq:B,z:-6.38543527579
+E,mq:S,a:-3.87120101091
+E,mq:S,ag:-6.98761067814
+E,mq:S,b:-6.48551873435
+E,mq:S,c:-4.63416716792
+E,mq:S,d:-3.21135759382
+E,mq:S,dg:-9.42995771351
+E,mq:S,f:-3.20144670992
+E,mq:S,g:-8.51366698164
+E,mq:S,h:-8.51366698164
+E,mq:S,j:-5.99597050903
+E,mq:S,k:-9.02449260541
+E,mq:S,m:-4.59765195494
+E,mq:S,n:-2.23928167918
+E,mq:S,ng:-5.1326723073
+E,mq:S,nr:-6.59674436946
+E,mq:S,o:-10.1231048941
+E,mq:S,p:-3.84458346991
+E,mq:S,q:-4.86560952205
+E,mq:S,r:-4.27378011413
+E,mq:S,tg:-8.73681053295
+E,mq:S,u:-5.9035971889
+E,mq:S,ud:-7.82051980108
+E,mq:S,ug:-8.17719474502
+E,mq:S,uj:-2.77002297356
+E,mq:S,ul:-7.72520962128
+E,mq:S,uv:-6.3164424043
+E,mq:S,uz:-10.1231048941
+E,mq:S,v:-2.92866804297
+E,mq:S,vg:-6.40953282737
+E,mq:S,x:-10.1231048941
+E,mq:S,y:-8.17719474502
+E,m:S,a:-3.50277312471
+E,m:S,ad:-11.1799241209
+E,m:S,ag:-7.36814653047
+E,m:S,an:-11.3469782056
+E,m:S,b:-6.0559601415
+E,m:S,bg:-13.7448734784
+E,m:S,c:-4.43242788345
+E,m:S,d:-3.08158527471
+E,m:S,dg:-9.13970329238
+E,m:S,e:-9.1805252869
+E,m:S,f:-4.02831809518
+E,m:S,g:-7.0577648705
+E,m:S,h:-8.34219609649
+E,m:S,j:-5.93655042797
+E,m:S,k:-7.64904891593
+E,m:S,m:-4.2760996343
+E,m:S,mg:-11.9531140091
+E,m:S,n:-2.5840477254
+E,m:S,ng:-4.60517018599
+E,m:S,nr:-6.03198251687
+E,m:S,nt:-12.3585791172
+E,m:S,o:-9.23401397185
+E,m:S,p:-3.46816856527
+E,m:S,q:-4.53024232497
+E,m:S,r:-4.08722252769
+E,m:S,rg:-13.7448734784
+E,m:S,tg:-7.01624486528
+E,m:S,u:-5.66711591463
+E,m:S,ud:-8.39776594765
+E,m:S,ug:-8.04109100371
+E,m:S,uj:-3.35066097377
+E,m:S,ul:-5.75159115026
+E,m:S,uv:-6.29421268215
+E,m:S,uz:-8.56308992807
+E,m:S,v:-2.58918025545
+E,m:S,vg:-5.72296069938
+E,m:S,vn:-10.1072873186
+E,m:S,x:-8.82489255254
+E,m:S,y:-6.2809368739
+E,n:B,a:-3.97808073968
+E,n:B,ad:-5.66511002885
+E,n:B,an:-7.2264054233
+E,n:B,b:-5.18063661993
+E,n:B,c:-4.19034282982
+E,n:B,d:-3.49447590362
+E,n:B,df:-9.74741161798
+E,n:B,e:-11.8291652994
+E,n:B,f:-4.73057541993
+E,n:B,h:-14.0263898768
+E,n:B,i:-5.89104292785
+E,n:B,in:-15.818149346
+E,n:B,j:-5.76848568329
+E,n:B,l:-5.67489714111
+E,n:B,ln:-13.7387078043
+E,n:B,m:-4.31542574349
+E,n:B,mq:-8.0212690032
+E,n:B,n:-1.56818526684
+E,n:B,nr:-4.17603063455
+E,n:B,nrfg:-7.85747673759
+E,n:B,nrt:-6.49707293241
+E,n:B,ns:-4.62730418018
+E,n:B,nt:-6.56983904275
+E,n:B,nz:-5.82450121374
+E,n:B,o:-9.08118238798
+E,n:B,p:-5.5646741598
+E,n:B,q:-6.87125382209
+E,n:B,r:-4.23762130887
+E,n:B,rr:-13.4202540732
+E,n:B,rz:-10.2013782483
+E,n:B,s:-5.680815719
+E,n:B,t:-4.82077733002
+E,n:B,u:-5.92002615594
+E,n:B,v:-1.95768167489
+E,n:B,vd:-7.83539164397
+E,n:B,vi:-12.3216417845
+E,n:B,vn:-3.44326262701
+E,n:B,vq:-11.9469483351
+E,n:B,y:-8.97120620639
+E,n:B,z:-6.49144917289
+E,nr:B,a:-4.85106776264
+E,nr:B,ad:-5.77305194641
+E,nr:B,an:-8.93792404005
+E,nr:B,b:-6.21725537499
+E,nr:B,c:-4.94735395033
+E,nr:B,d:-3.48492552216
+E,nr:B,df:-10.0083654518
+E,nr:B,e:-10.5008419369
+E,nr:B,f:-5.05371279241
+E,nr:B,i:-5.35255496231
+E,nr:B,in:-13.5918843902
+E,nr:B,j:-6.55222404035
+E,nr:B,l:-5.93177007104
+E,nr:B,m:-4.24047857795
+E,nr:B,mq:-8.0624553027
+E,nr:B,n:-2.21592478031
+E,nr:B,nr:-3.09294517959
+E,nr:B,nrfg:-6.73017304973
+E,nr:B,nrt:-5.01793286497
+E,nr:B,ns:-4.29408274246
+E,nr:B,nt:-7.53276119463
+E,nr:B,nz:-5.8136729157
+E,nr:B,o:-8.29356702366
+E,nr:B,p:-6.00204287803
+E,nr:B,q:-8.03120275919
+E,nr:B,r:-4.44416438021
+E,nr:B,rr:-12.8987372096
+E,nr:B,rz:-9.27439627667
+E,nr:B,s:-5.0031150003
+E,nr:B,t:-4.54535790347
+E,nr:B,u:-6.35698596989
+E,nr:B,v:-2.09901878562
+E,nr:B,vd:-10.647445411
+E,nr:B,vn:-5.1543839677
+E,nr:B,vq:-11.0269350327
+E,nr:B,y:-9.54883312237
+E,nr:B,z:-6.2523466948
+E,nrfg:B,a:-4.72230191263
+E,nrfg:B,ad:-5.21419952651
+E,nrfg:B,an:-7.98678824875
+E,nrfg:B,b:-5.65141333294
+E,nrfg:B,c:-4.42196144331
+E,nrfg:B,d:-3.08398565946
+E,nrfg:B,df:-9.77854771798
+E,nrfg:B,f:-4.88070791803
+E,nrfg:B,i:-5.06004884669
+E,nrfg:B,j:-5.39652108331
+E,nrfg:B,l:-5.16342720114
+E,nrfg:B,m:-3.82530438369
+E,nrfg:B,mq:-7.83263756892
+E,nrfg:B,n:-2.14276085658
+E,nrfg:B,nr:-2.72064978057
+E,nrfg:B,nrfg:-4.88070791803
+E,nrfg:B,nrt:-6.11498607185
+E,nrfg:B,ns:-4.4032693103
+E,nrfg:B,nt:-5.84672208526
+E,nrfg:B,nz:-5.88672741987
+E,nrfg:B,o:-8.39225335686
+E,nrfg:B,p:-5.77121453275
+E,nrfg:B,q:-9.77854771798
+E,nrfg:B,r:-4.24121345096
+E,nrfg:B,rz:-8.16910980555
+E,nrfg:B,s:-4.75466719713
+E,nrfg:B,t:-4.33181034631
+E,nrfg:B,u:-6.73402528026
+E,nrfg:B,v:-1.92533132982
+E,nrfg:B,vd:-9.08540053742
+E,nrfg:B,vn:-4.97452667325
+E,nrfg:B,y:-9.77854771798
+E,nrfg:B,z:-6.3445605135
+E,nrfg:S,a:-4.43144018726
+E,nrfg:S,ag:-7.98678824875
+E,nrfg:S,b:-6.55967189311
+E,nrfg:S,c:-4.50043305875
+E,nrfg:S,d:-3.16114474001
+E,nrfg:S,dg:-9.08540053742
+E,nrfg:S,e:-9.77854771798
+E,nrfg:S,f:-4.0387548058
+E,nrfg:S,g:-5.32420042173
+E,nrfg:S,h:-9.08540053742
+E,nrfg:S,j:-5.75319602725
+E,nrfg:S,k:-7.6991061763
+E,nrfg:S,m:-4.16541961159
+E,nrfg:S,mg:-9.77854771798
+E,nrfg:S,n:-3.7920957127
+E,nrfg:S,ng:-4.88819858976
+E,nrfg:S,nr:-5.1535749047
+E,nrfg:S,p:-2.7818662298
+E,nrfg:S,q:-4.08481557918
+E,nrfg:S,r:-3.9525476106
+E,nrfg:S,tg:-6.0408780997
+E,nrfg:S,u:-4.51585752908
+E,nrfg:S,ud:-7.83263756892
+E,nrfg:S,ug:-6.78281544443
+E,nrfg:S,uj:-2.35796881257
+E,nrfg:S,ul:-5.75319602725
+E,nrfg:S,uv:-9.08540053742
+E,nrfg:S,uz:-8.39225335686
+E,nrfg:S,v:-2.23898888868
+E,nrfg:S,vg:-4.9910559752
+E,nrfg:S,vn:-9.08540053742
+E,nrfg:S,x:-9.08540053742
+E,nrfg:S,y:-6.48271085198
+E,nr:S,a:-4.39371781917
+E,nr:S,ad:-10.25967988
+E,nr:S,ag:-6.77953929603
+E,nr:S,an:-11.6459742412
+E,nr:S,b:-6.16593073313
+E,nr:S,c:-3.55325424373
+E,nr:S,d:-2.74977726032
+E,nr:S,dg:-8.43859279571
+E,nr:S,e:-8.49201796239
+E,nr:S,f:-4.17762406189
+E,nr:S,g:-5.99248305679
+E,nr:S,h:-9.58455120498
+E,nr:S,j:-4.79721098883
+E,nr:S,k:-6.77405381876
+E,nr:S,m:-4.19133696717
+E,nr:S,mg:-10.819295668
+E,nr:S,n:-3.26103978315
+E,nr:S,ng:-4.04972545029
+E,nr:S,nr:-4.33599720328
+E,nr:S,nt:-13.5918843902
+E,nr:S,o:-9.07009581316
+E,nr:S,p:-2.65315042463
+E,nr:S,q:-3.88703071996
+E,nr:S,r:-4.15377119854
+E,nr:S,rg:-8.25434631051
+E,nr:S,t:-10.25967988
+E,nr:S,tg:-5.89068420935
+E,nr:S,u:-3.62584466302
+E,nr:S,ud:-7.17678743104
+E,nr:S,ug:-7.49605982778
+E,nr:S,uj:-2.72112786103
+E,nr:S,ul:-5.4376716953
+E,nr:S,uv:-7.2100683728
+E,nr:S,uz:-6.72912647716
+E,nr:S,v:-2.02182273387
+E,nr:S,vg:-4.54925286266
+E,nr:S,vn:-10.647445411
+E,nr:S,x:-6.95593783452
+E,nr:S,y:-6.38699188
+E,nr:S,yg:-12.8987372096
+E,nr:S,zg:-12.2055900291
+E,nrt:B,a:-4.10314976838
+E,nrt:B,ad:-6.16977062164
+E,nrt:B,an:-7.82481904532
+E,nrt:B,b:-5.90789643314
+E,nrt:B,c:-4.91609814876
+E,nrt:B,d:-3.72382994038
+E,nrt:B,df:-10.5328692464
+E,nrt:B,f:-4.70392362881
+E,nrt:B,i:-4.88919069584
+E,nrt:B,j:-6.10205244758
+E,nrt:B,l:-5.87415829351
+E,nrt:B,m:-4.04747094322
+E,nrt:B,mq:-8.51796622588
+E,nrt:B,n:-1.76297370145
+E,nrt:B,nr:-2.65471390992
+E,nrt:B,nrfg:-7.11514256281
+E,nrt:B,nrt:-3.53710309012
+E,nrt:B,ns:-3.74333459883
+E,nrt:B,nt:-7.21868324175
+E,nrt:B,nz:-4.78826477725
+E,nrt:B,o:-9.28010627793
+E,nrt:B,p:-6.03863062114
+E,nrt:B,q:-6.51648622567
+E,nrt:B,r:-4.61532038227
+E,nrt:B,rz:-9.43425695776
+E,nrt:B,s:-5.17864424794
+E,nrt:B,t:-4.74443929771
+E,nrt:B,u:-6.93555698584
+E,nrt:B,v:-2.1201480766
+E,nrt:B,vd:-10.5328692464
+E,nrt:B,vn:-4.81255746982
+E,nrt:B,vq:-10.5328692464
+E,nrt:B,y:-10.1274041383
+E,nrt:B,z:-6.81929717972
+E,nrt:S,a:-4.55905963455
+E,nrt:S,ad:-10.1274041383
+E,nrt:S,ag:-6.30603550116
+E,nrt:S,an:-11.226016427
+E,nrt:S,b:-6.74867961251
+E,nrt:S,c:-3.89823588856
+E,nrt:S,d:-3.1538611188
+E,nrt:S,dg:-8.18149398926
+E,nrt:S,e:-8.33564466909
+E,nrt:S,f:-4.38546989769
+E,nrt:S,g:-6.35081910378
+E,nrt:S,h:-9.43425695776
+E,nrt:S,j:-4.20493246269
+E,nrt:S,k:-6.22880415322
+E,nrt:S,m:-3.98751958609
+E,nrt:S,mg:-11.226016427
+E,nrt:S,n:-3.07554851536
+E,nrt:S,ng:-4.07688482843
+E,nrt:S,nr:-4.84759024333
+E,nrt:S,o:-10.5328692464
+E,nrt:S,p:-3.10216216388
+E,nrt:S,q:-3.88453257462
+E,nrt:S,r:-4.27233221611
+E,nrt:S,rg:-7.61509851434
+E,nrt:S,tg:-5.31251342135
+E,nrt:S,u:-4.40490895473
+E,nrt:S,ud:-7.67066836549
+E,nrt:S,ug:-9.28010627793
+E,nrt:S,uj:-2.97252839864
+E,nrt:S,ul:-5.94790176775
+E,nrt:S,uv:-7.61509851434
+E,nrt:S,uz:-7.56245478085
+E,nrt:S,v:-2.43361868463
+E,nrt:S,vg:-5.30981436438
+E,nrt:S,vn:-11.226016427
+E,nrt:S,x:-7.69965590237
+E,nrt:S,y:-6.84398979231
+E,nrt:S,yg:-11.226016427
+E,n:S,a:-4.46356332146
+E,n:S,ad:-10.8483360464
+E,n:S,ag:-8.01267472071
+E,n:S,an:-11.6750146196
+E,n:S,b:-6.35277923383
+E,ns:B,a:-4.5333457812
+E,ns:B,ad:-6.41735082401
+E,ns:B,an:-8.63265313277
+E,ns:B,b:-4.86264086502
+E,ns:B,c:-5.34152606907
+E,ns:B,d:-4.46333033042
+E,ns:B,df:-11.9210550203
+E,ns:B,e:-13.5304929327
+E,ns:B,f:-3.57631226587
+E,ns:B,i:-6.79590127275
+E,ns:B,j:-4.44040113334
+E,ns:B,l:-5.75437745562
+E,ns:B,ln:-12.8373457522
+E,ns:B,m:-4.20673459371
+E,ns:B,mq:-8.64769101013
+E,ns:B,n:-1.27881614538
+E,ns:B,nr:-3.6954448334
+E,ns:B,nrfg:-7.9698113017
+E,ns:B,nrt:-5.33681626676
+E,ns:B,ns:-2.19337429157
+E,ns:B,nt:-5.63096846069
+E,ns:B,nz:-4.61130732267
+E,ns:B,o:-10.8914356031
+E,ns:B,p:-6.81027277758
+E,ns:B,q:-7.71636240089
+E,ns:B,r:-4.8225141061
+E,ns:B,rz:-11.1325976599
+E,ns:B,s:-4.32395979909
+E,ns:B,t:-4.30359047244
+E,ns:B,u:-6.90775660877
+E,ns:B,v:-2.50847609167
+E,ns:B,vd:-9.61846992729
+E,ns:B,vi:-13.5304929327
+E,ns:B,vn:-4.31805476266
+E,ns:B,vq:-10.8224427316
+E,ns:B,y:-10.6401211748
+E,ns:B,z:-7.50221441249
+E,n:S,c:-3.26915388505
+E,n:S,d:-2.84379885658
+E,n:S,dg:-8.43851719337
+E,n:S,e:-9.5604817581
+E,n:S,f:-3.29921311055
+E,n:S,g:-7.39307144347
+E,n:S,h:-9.07881271862
+E,n:S,j:-6.05157031071
+E,n:S,k:-5.57722573573
+E,n:S,m:-4.13935357366
+E,n:S,mg:-11.4614405193
+E,n:S,n:-4.00258177004
+E,n:S,ng:-4.86751825315
+E,n:S,nr:-5.8868520928
+E,n:S,nt:-13.515564253
+E,n:S,o:-9.60554325023
+E,n:S,p:-3.02036718444
+E,n:S,q:-4.60990292031
+E,n:S,r:-4.08861362527
+E,n:S,rg:-12.450853516
+E,ns:S,a:-4.64893444408
+E,ns:S,ad:-10.9655435753
+E,ns:S,ag:-7.71338177276
+E,ns:S,b:-6.52379770588
+E,ns:S,c:-3.69887739242
+E,ns:S,d:-3.75705711954
+E,ns:S,dg:-9.94697399426
+E,ns:S,e:-11.1325976599
+E,ns:S,f:-3.94734839487
+E,ns:S,g:-6.93744839858
+E,ns:S,h:-9.68034533101
+E,ns:S,j:-4.97119856528
+E,ns:S,k:-7.50462695889
+E,ns:S,m:-4.05678879594
+E,ns:S,mg:-13.5304929327
+E,ns:S,n:-3.17985465059
+E,ns:S,ng:-4.43489023821
+E,ns:S,nr:-5.39426737781
+E,ns:S,o:-10.8914356031
+E,ns:S,p:-3.4220257995
+E,ns:S,q:-4.60903535377
+E,ns:S,r:-4.92951021557
+E,ns:S,rg:-11.9210550203
+E,ns:S,t:-13.5304929327
+E,ns:S,tg:-5.45833762453
+E,ns:S,u:-4.13417104312
+E,ns:S,ud:-9.13604377805
+E,ns:S,ug:-8.6401438045
+E,ns:S,uj:-2.91646042245
+E,ns:S,ul:-7.49740671092
+E,ns:S,uv:-6.88800613135
+E,ns:S,uz:-8.46789789969
+E,ns:S,v:-3.07205761338
+E,ns:S,vg:-6.22664970744
+E,ns:S,vn:-10.5860539536
+E,ns:S,x:-8.56067963314
+E,ns:S,y:-7.77792029389
+E,n:S,t:-15.818149346
+E,n:S,tg:-7.51439693042
+E,n:S,u:-4.43940691448
+E,n:S,ud:-8.51094703122
+E,n:S,ug:-7.7500597197
+E,n:S,uj:-2.60417535099
+E,n:S,ul:-6.19848465557
+E,n:S,uv:-7.01984562749
+E,n:S,uz:-8.13982298947
+E,n:S,v:-2.56783964345
+E,n:S,vg:-6.18502798813
+E,n:S,vn:-10.3333524125
+E,n:S,x:-9.15374032563
+E,n:S,y:-6.12587677389
+E,nt:B,a:-4.97247952844
+E,nt:B,ad:-5.26088180258
+E,nt:B,an:-7.9747123666
+E,nt:B,b:-4.26008041638
+E,nt:B,c:-5.23527585168
+E,nt:B,d:-3.88109270474
+E,nt:B,df:-11.1102065825
+E,nt:B,f:-5.44032565955
+E,nt:B,i:-7.28156518604
+E,nt:B,j:-4.86603968187
+E,nt:B,l:-6.06035057528
+E,nt:B,ln:-11.1102065825
+E,nt:B,m:-3.77980137069
+E,nt:B,mq:-7.34900646684
+E,nt:B,n:-1.26742490511
+E,nt:B,nr:-4.84111029882
+E,nt:B,nrfg:-8.54525722507
+E,nt:B,nrt:-6.77947324224
+E,nt:B,ns:-3.53154973194
+E,nt:B,nt:-3.51834486764
+E,nt:B,nz:-4.70994913722
+E,nt:B,p:-4.5605558403
+E,nt:B,q:-9.5007686701
+E,nt:B,r:-5.29906558955
+E,nt:B,rz:-11.1102065825
+E,nt:B,s:-5.8320919233
+E,nt:B,t:-4.0775823215
+E,nt:B,u:-6.53549560403
+E,nt:B,v:-1.7587139308
+E,nt:B,vd:-8.40215638143
+E,nt:B,vn:-3.89423157988
+E,nt:B,y:-11.1102065825
+E,nt:B,z:-9.03076504085
+E,nt:S,a:-5.61303835724
+E,nt:S,ag:-10.417059402
+E,nt:S,b:-3.60857212465
+E,nt:S,c:-3.4648088831
+E,nt:S,d:-3.29419274337
+E,nt:S,dg:-10.417059402
+E,nt:S,e:-11.1102065825
+E,nt:S,f:-4.83356309319
+E,nt:S,g:-11.1102065825
+E,nt:S,h:-9.72391222141
+E,nt:S,j:-6.35661639142
+E,nt:S,k:-8.91298200519
+E,nt:S,m:-3.55482463829
+E,nt:S,n:-4.60143744556
+E,nt:S,ng:-6.14039328295
+E,nt:S,nr:-7.17838094981
+E,nt:S,p:-3.04180362396
+E,nt:S,q:-4.13479265507
+E,nt:S,r:-5.44724610239
+E,nt:S,rg:-8.47114925291
+E,nt:S,tg:-7.42132712842
+E,nt:S,u:-4.32236160022
+E,nt:S,ud:-9.72391222141
+E,nt:S,ug:-11.1102065825
+E,nt:S,uj:-2.84250091777
+E,nt:S,ul:-8.80762148954
+E,nt:S,uv:-9.72391222141
+E,nt:S,uz:-9.72391222141
+E,nt:S,v:-3.56270489972
+E,nt:S,vg:-7.81436971653
+E,nt:S,x:-10.417059402
+E,nt:S,y:-8.80762148954
+E,nz:B,a:-4.9490278736
+E,nz:B,ad:-6.25349221647
+E,nz:B,an:-8.84375938192
+E,nz:B,b:-4.6983596489
+E,nz:B,c:-5.10949692196
+E,nz:B,d:-4.32820135462
+E,nz:B,df:-11.1951346391
+E,nz:B,f:-4.12738862379
+E,nz:B,i:-6.60001478895
+E,nz:B,j:-5.38100410726
+E,nz:B,l:-6.35094755262
+E,nz:B,m:-3.64027611804
+E,nz:B,mq:-7.86293012891
+E,nz:B,n:-1.17146692629
+E,nz:B,nr:-3.89028250166
+E,nz:B,nrfg:-8.01708080873
+E,nz:B,nrt:-5.80150709273
+E,nz:B,ns:-3.91134306268
+E,nz:B,nt:-5.90686760839
+E,nz:B,nz:-3.33186791507
+E,nz:B,o:-10.0965223504
+E,nz:B,p:-5.96402602223
+E,nz:B,q:-7.54447639779
+E,nz:B,r:-5.02239074476
+E,nz:B,rz:-10.789669531
+E,nz:B,s:-5.84802710836
+E,nz:B,t:-4.57706343522
+E,nz:B,u:-6.62559163074
+E,nz:B,v:-2.33463547147
+E,nz:B,vd:-9.1156930974
+E,nz:B,vi:-11.8882818196
+E,nz:B,vn:-3.89263821535
+E,nz:B,y:-10.5019874585
+E,nz:B,z:-7.05199991269
+E,nz:S,a:-4.48157108946
+E,nz:S,ad:-11.8882818196
+E,nz:S,ag:-7.19693393741
+E,nz:S,an:-11.8882818196
+E,nz:S,b:-6.12309071686
+E,nz:S,c:-3.63583572939
+E,nz:S,d:-3.5768835412
+E,nz:S,dg:-10.2788439072
+E,nz:S,e:-10.789669531
+E,nz:S,f:-3.47467294448
+E,nz:S,g:-6.89784923286
+E,nz:S,h:-8.84375938192
+E,nz:S,j:-4.73444801806
+E,nz:S,k:-6.3952203763
+E,nz:S,m:-4.0413008375
+E,nz:S,mg:-10.5019874585
+E,nz:S,n:-3.3175478613
+E,nz:S,ng:-4.06543652936
+E,nz:S,nr:-5.61918553594
+E,nz:S,o:-10.0965223504
+E,nz:S,p:-3.31982533429
+E,nz:S,q:-4.20257875841
+E,nz:S,r:-4.67010498124
+E,nz:S,rg:-10.0965223504
+E,nz:S,tg:-6.54117428892
+E,nz:S,u:-4.10505780331
+E,nz:S,ud:-7.7611474346
+E,nz:S,ug:-8.30476288119
+E,nz:S,uj:-3.02764077787
+E,nz:S,ul:-6.80687745466
+E,nz:S,uv:-7.02074736919
+E,nz:S,uz:-8.55607730947
+E,nz:S,v:-2.85062955549
+E,nz:S,vg:-5.93763926705
+E,nz:S,vn:-9.18023161854
+E,nz:S,x:-8.15061220136
+E,nz:S,y:-7.04409473318
+E,o:B,a:-5.79034236085
+E,o:B,ad:-8.56293108309
+E,o:B,an:-8.56293108309
+E,o:B,b:-8.56293108309
+E,o:B,c:-6.36570650575
+E,o:B,d:-4.67111078498
+E,o:B,e:-8.56293108309
+E,o:B,f:-7.46431879442
+E,o:B,i:-6.2603459901
+E,o:B,j:-6.2603459901
+E,o:B,l:-5.99798172563
+E,o:B,m:-2.24576639634
+E,o:B,mq:-7.46431879442
+E,o:B,n:-3.46918088228
+E,o:B,nr:-4.71278348138
+E,o:B,nrt:-7.86978390253
+E,o:B,ns:-6.36570650575
+E,o:B,nz:-7.46431879442
+E,o:B,o:-2.69081329361
+E,o:B,p:-8.56293108309
+E,o:B,q:-8.56293108309
+E,o:B,r:-4.89936943696
+E,o:B,s:-6.2603459901
+E,o:B,t:-6.16503581029
+E,o:B,v:-2.54677392339
+E,o:B,vn:-7.46431879442
+E,o:B,z:-6.77117161386
+E,o:S,a:-5.23072657291
+E,o:S,ag:-7.86978390253
+E,o:S,c:-5.79034236085
+E,o:S,d:-3.24972510405
+E,o:S,dg:-8.56293108309
+E,o:S,e:-5.92387375347
+E,o:S,f:-5.51840864537
+E,o:S,j:-4.59263916954
+E,o:S,m:-3.15128503124
+E,o:S,n:-4.51987981526
+E,o:S,ng:-6.48348954141
+E,o:S,nr:-5.92387375347
+E,o:S,o:-3.32648912026
+E,o:S,p:-4.63110545037
+E,o:S,q:-3.5324931617
+E,o:S,r:-3.98822010459
+E,o:S,tg:-7.86978390253
+E,o:S,u:-5.03657055847
+E,o:S,ud:-7.46431879442
+E,o:S,ug:-8.56293108309
+E,o:S,uj:-2.34035481502
+E,o:S,ul:-5.30483454507
+E,o:S,uv:-1.77734343808
+E,o:S,uz:-4.84935901639
+E,o:S,v:-1.95493045779
+E,o:S,vg:-5.03657055847
+E,o:S,x:-4.3582384637
+E,o:S,y:-5.0075830216
+E,p:B,a:-3.70768693873
+E,p:B,ad:-5.17160349803
+E,p:B,an:-7.44601771406
+E,p:B,b:-4.26046889331
+E,p:B,c:-6.47041040503
+E,p:B,d:-3.93737865053
+E,p:B,f:-4.92921770049
+E,p:B,i:-5.74887422121
+E,p:B,j:-4.46992141502
+E,p:B,l:-5.15601140327
+E,p:B,m:-3.36683379207
+E,p:B,mq:-5.90557267311
+E,p:B,n:-1.26720951977
+E,p:B,nr:-3.70768693873
+E,p:B,nrfg:-7.05924473896
+E,p:B,nrt:-5.97011119425
+E,p:B,ns:-3.43038572601
+E,p:B,nt:-4.6201844773
+E,p:B,nz:-4.96924591448
+E,p:B,o:-9.52545925574
+E,p:B,p:-5.84494805129
+E,p:B,q:-6.41441613567
+E,p:B,r:-2.95426510622
+E,p:B,rr:-9.93092436385
+E,p:B,rz:-8.05912218694
+E,p:B,s:-4.69625702437
+E,p:B,t:-3.53594104596
+E,p:B,u:-8.54463000273
+E,p:B,v:-1.82571749753
+E,p:B,vd:-7.98501421479
+E,p:B,vn:-3.40467355553
+E,p:B,z:-7.11751364709
+E,p:S,a:-4.23103835947
+E,p:S,ag:-8.11176592043
+E,p:S,b:-6.56939223858
+E,p:S,c:-5.69923624011
+E,p:S,d:-4.62596245458
+E,p:S,dg:-9.77677368402
+E,p:S,f:-5.16165316718
+E,p:S,g:-7.20089525603
+E,p:S,h:-7.85148282217
+E,p:S,j:-5.36831379228
+E,p:S,k:-9.01463363197
+E,p:S,m:-4.00089205626
+E,p:S,mg:-11.7226838331
+E,p:S,n:-4.11579930185
+E,p:S,ng:-5.31086556536
+E,p:S,nr:-5.60458663503
+E,p:S,nt:-11.0295366525
+E,p:S,o:-10.1132459206
+E,p:S,p:-3.54939039411
+E,p:S,q:-5.18165383388
+E,p:S,r:-3.18216481635
+E,p:S,tg:-7.69733214234
+E,p:S,u:-6.79543014792
+E,p:S,ud:-8.63164137972
+E,p:S,ug:-9.32478856028
+E,p:S,uj:-4.73796751296
+E,p:S,ul:-4.6536604065
+E,p:S,uv:-8.08509767335
+E,p:S,uz:-9.01463363197
+E,p:S,v:-3.30332400201
+E,p:S,vg:-6.40947785403
+E,p:S,vn:-10.6240715444
+E,p:S,x:-9.23777718329
+E,p:S,y:-9.08362650346
+E,q:B,a:-3.70315281918
+E,q:B,ad:-6.54326274229
+E,q:B,an:-6.64644697853
+E,q:B,b:-4.91056796769
+E,q:B,c:-4.97383016447
+E,q:B,d:-4.13472907129
+E,q:B,f:-3.57637384069
+E,q:B,i:-5.70440375055
+E,q:B,j:-5.38133817421
+E,q:B,l:-5.92121148342
+E,q:B,m:-3.64962833876
+E,q:B,mq:-8.86565046258
+E,q:B,n:-1.25173306596
+E,q:B,nr:-4.46873521541
+E,q:B,nrfg:-9.37647608635
+E,q:B,nrt:-6.06836912775
+E,q:B,ns:-4.20032635377
+E,q:B,nt:-7.64187503096
+E,q:B,nz:-6.04427157617
+E,q:B,o:-8.68332890579
+E,q:B,p:-6.43203710718
+E,q:B,q:-4.35699117698
+E,q:B,r:-4.43960694249
+E,q:B,s:-5.28213152413
+E,q:B,t:-4.47367349706
+E,q:B,u:-7.25621255015
+E,q:B,v:-2.14905568906
+E,q:B,vd:-5.92121148342
+E,q:B,vn:-4.20032635377
+E,q:B,y:-10.475088375
+E,q:B,z:-7.216991837
+E,qe:B,n:-0.69314718056
+E,qe:S,q:-0.69314718056
+E,q:S,a:-4.08317126162
+E,q:S,ag:-7.53064939585
+E,q:S,b:-6.31620529166
+E,q:S,c:-4.11724610851
+E,q:S,d:-3.21316128231
+E,q:S,dg:-9.37647608635
+E,q:S,f:-4.49115209433
+E,q:S,g:-8.17250328202
+E,q:S,h:-8.86565046258
+E,q:S,j:-5.13275412305
+E,q:S,k:-8.39564683334
+E,q:S,m:-3.73220773922
+E,q:S,n:-3.32517153888
+E,q:S,ng:-5.06344232316
+E,q:S,nr:-6.27039575563
+E,q:S,o:-10.475088375
+E,q:S,p:-3.12843321184
+E,q:S,q:-4.20788782648
+E,q:S,r:-4.92601229012
+E,q:S,rg:-9.37647608635
+E,q:S,tg:-6.91974031353
+E,q:S,u:-5.52632848464
+E,q:S,ud:-9.37647608635
+E,q:S,ug:-8.27786379768
+E,q:S,uj:-2.72878771279
+E,q:S,ul:-8.39564683334
+E,q:S,uv:-7.17925150901
+E,q:S,uz:-10.475088375
+E,q:S,v:-2.54812483015
+E,q:S,vg:-5.98645200528
+E,q:S,vn:-9.37647608635
+E,q:S,x:-9.0887940139
+E,q:S,y:-6.91974031353
+E,r:B,a:-3.54661150451
+E,r:B,ad:-5.60599800441
+E,r:B,an:-6.69442583279
+E,r:B,b:-5.16119452917
+E,r:B,c:-4.89241164608
+E,r:B,d:-3.47823705295
+E,r:B,df:-8.34015374663
+E,r:B,e:-12.4564772156
+E,r:B,f:-5.40519895984
+E,r:B,h:-13.5550895042
+E,r:B,i:-4.81219603273
+E,r:B,j:-6.07353380233
+E,r:B,l:-5.27564601653
+E,r:B,m:-3.80527774431
+E,r:B,mq:-7.86473004992
+E,r:B,n:-1.49788236305
+E,r:B,nr:-4.52591136134
+E,r:B,nrfg:-8.0620280609
+E,r:B,nrt:-6.96616302671
+E,r:B,ns:-5.04451818913
+E,r:B,nt:-7.40023141022
+E,r:B,nz:-6.18927666703
+E,r:B,o:-9.1242727054
+E,r:B,p:-5.91112755524
+E,r:B,q:-7.88866281613
+E,r:B,r:-3.91530711477
+E,r:B,rr:-11.9456515918
+E,r:B,rz:-9.47755206033
+E,r:B,s:-5.03410351458
+E,r:B,t:-4.62023916395
+E,r:B,u:-6.71027402503
+E,r:B,v:-2.02282230248
+E,r:B,vd:-9.02249001109
+E,r:B,vn:-4.04501497879
+E,r:B,vq:-10.7218761602
+E,r:B,y:-8.72677576694
+E,r:B,z:-6.1842293377
+E,rr:B,a:-5.1059454739
+E,rr:B,b:-5.1059454739
+E,rr:B,c:-4.41279829334
+E,rr:B,d:-3.02650393222
+E,rr:B,df:-5.1059454739
+E,rr:B,f:-4.41279829334
+E,rr:B,i:-5.1059454739
+E,rr:B,m:-5.1059454739
+E,rr:B,nr:-5.1059454739
+E,rr:B,nrt:-5.1059454739
+E,rr:B,ns:-5.1059454739
+E,rr:B,r:-3.16003532485
+E,rr:B,rr:-5.1059454739
+E,rr:B,s:-5.1059454739
+E,rr:B,u:-4.41279829334
+E,rr:B,v:-2.33335675166
+E,rr:B,vn:-4.41279829334
+E,rr:B,z:-5.1059454739
+E,rr:S,a:-3.49650756147
+E,rr:S,b:-5.1059454739
+E,rr:S,c:-3.49650756147
+E,rr:S,d:-2.16150649473
+E,rr:S,m:-4.41279829334
+E,rr:S,n:-5.1059454739
+E,rr:S,nr:-5.1059454739
+E,rr:S,p:-2.54099611644
+E,rr:S,r:-3.49650756147
+E,rr:S,uj:-1.17411984118
+E,rr:S,ul:-5.1059454739
+E,rr:S,v:-2.7080502011
+E,r:S,a:-3.96180233559
+E,r:S,ad:-10.5593572307
+E,r:S,ag:-7.80569651833
+E,r:S,an:-12.8619423237
+E,r:S,b:-6.57315482708
+E,r:S,c:-5.01691790644
+E,r:S,d:-2.51021757119
+E,r:S,dg:-8.83659063294
+E,r:S,e:-9.22435616395
+E,r:S,f:-5.63609701607
+E,r:S,g:-7.68579259111
+E,r:S,h:-8.03763660777
+E,r:S,j:-6.36592176582
+E,r:S,k:-9.03330092719
+E,r:S,m:-4.26852910635
+E,r:S,mg:-12.1687951431
+E,r:S,n:-3.44808984234
+E,r:S,ng:-5.31312294401
+E,r:S,nr:-6.33033609847
+E,r:S,nt:-13.5550895042
+E,r:S,o:-9.68388849333
+E,r:S,p:-3.27838459115
+E,r:S,q:-4.6297680873
+E,r:S,r:-3.89731069268
+E,r:S,rg:-12.8619423237
+E,r:S,t:-13.5550895042
+E,r:S,tg:-7.57115322355
+E,r:S,u:-5.49202659291
+E,r:S,ud:-7.55863741562
+E,r:S,ug:-7.486663916
+E,r:S,uj:-2.55109146575
+E,r:S,ul:-5.81268748242
+E,r:S,uv:-7.20071946344
+E,r:S,uz:-8.57835576182
+E,r:S,v:-2.1862538333
+E,r:S,vg:-6.45341353262
+E,r:S,vn:-10.3362136794
+E,r:S,x:-9.32098299964
+E,r:S,y:-5.44256174076
+E,rz:B,a:-2.99385551354
+E,rz:B,ad:-6.97041704011
+E,rz:B,an:-6.68273496766
+E,rz:B,b:-5.23581598472
+E,rz:B,c:-5.9895877871
+E,rz:B,d:-4.24038793229
+E,rz:B,f:-5.67113405598
+E,rz:B,i:-3.73829598849
+E,rz:B,j:-5.87180475144
+E,rz:B,l:-5.36097912767
+E,rz:B,m:-4.77319246277
+E,rz:B,n:-0.767206986637
+E,rz:B,nr:-2.8928795962
+E,rz:B,nrfg:-6.12311917972
+E,rz:B,nrt:-6.27726985955
+E,rz:B,ns:-3.66231008151
+E,rz:B,nt:-6.45959141634
+E,rz:B,nz:-5.67113405598
+E,rz:B,p:-8.06902932877
+E,rz:B,r:-6.68273496766
+E,rz:B,rz:-8.06902932877
+E,rz:B,s:-5.76644423578
+E,rz:B,t:-4.17720903066
+E,rz:B,v:-2.98143299354
+E,rz:B,vn:-4.7368248186
+E,rz:B,z:-5.50407997131
+E,rz:S,a:-2.81675590073
+E,rz:S,ag:-6.45959141634
+E,rz:S,b:-4.24038793229
+E,rz:S,c:-6.97041704011
+E,rz:S,d:-4.04367763804
+E,rz:S,f:-5.02450689105
+E,rz:S,g:-8.06902932877
+E,rz:S,j:-5.23581598472
+E,rz:S,m:-4.85015350391
+E,rz:S,n:-4.17720903066
+E,rz:S,ng:-4.43144316905
+E,rz:S,nr:-4.40546768265
+E,rz:S,p:-3.6870026941
+E,rz:S,q:-4.81093279075
+E,rz:S,qg:-8.06902932877
+E,rz:S,r:-6.45959141634
+E,rz:S,tg:-8.06902932877
+E,rz:S,u:-7.37588214822
+E,rz:S,ud:-7.37588214822
+E,rz:S,uj:-8.06902932877
+E,rz:S,v:-2.99385551354
+E,rz:S,vg:-5.76644423578
+E,s:B,a:-4.1166984961
+E,s:B,ad:-5.95928730054
+E,s:B,an:-7.41924679669
+E,s:B,b:-5.04954386723
+E,s:B,c:-4.76263489107
+E,s:B,d:-3.41658264623
+E,s:B,df:-9.9124522493
+E,s:B,e:-11.5218901617
+E,s:B,f:-5.1341694456
+E,s:B,i:-5.30129999163
+E,s:B,j:-5.85028658544
+E,s:B,l:-5.55446219245
+E,s:B,m:-3.94323331114
+E,s:B,mq:-8.0719026159
+E,s:B,n:-1.63214662699
+E,s:B,nr:-4.49457564769
+E,s:B,nrfg:-8.20770415706
+E,s:B,nrt:-6.97859537946
+E,s:B,ns:-4.68509397169
+E,s:B,nt:-7.63006986362
+E,s:B,nz:-6.35996542009
+E,s:B,o:-6.86317920881
+E,s:B,p:-6.25145799867
+E,s:B,q:-6.48169606539
+E,s:B,r:-4.22853240374
+E,s:B,rz:-9.81714206949
+E,s:B,s:-4.7637956573
+E,s:B,t:-5.37128739328
+E,s:B,u:-7.07923890524
+E,s:B,v:-1.84120246958
+E,s:B,vd:-10.017812765
+E,s:B,vn:-3.84333245762
+E,s:B,vq:-9.57598001268
+E,s:B,y:-9.81714206949
+E,s:B,z:-5.62886568744
+E,s:S,a:-4.3312141274
+E,s:S,ad:-11.1164250536
+E,s:S,ag:-7.68243784914
+E,s:S,an:-11.1164250536
+E,s:S,b:-6.56959044465
+E,s:S,c:-4.37511798228
+E,s:S,d:-2.78684740746
+E,s:S,dg:-8.12069278007
+E,s:S,e:-8.99616151742
+E,s:S,f:-4.65704238376
+E,s:S,g:-7.33984001909
+E,s:S,h:-9.07954312636
+E,s:S,j:-6.38903723491
+E,s:S,k:-8.15459433174
+E,s:S,m:-4.1538659826
+E,s:S,n:-3.94144554409
+E,s:S,ng:-5.03649185853
+E,s:S,nr:-6.33450435589
+E,s:S,nt:-12.2150373423
+E,s:S,o:-8.12069278007
+E,s:S,p:-3.57121149994
+E,s:S,q:-5.26710027368
+E,s:S,r:-3.83733612969
+E,s:S,tg:-6.89691734845
+E,s:S,u:-5.26614011998
+E,s:S,ud:-8.24474542874
+E,s:S,ug:-7.32468821407
+E,s:S,uj:-2.2744948818
+E,s:S,ul:-5.7380649794
+E,s:S,uv:-7.28778365713
+E,s:S,uz:-7.64032636379
+E,s:S,v:-1.96230236164
+E,s:S,vg:-6.16059799602
+E,s:S,vn:-9.9124522493
+E,s:S,x:-8.81383996063
+E,s:S,y:-6.52467788797
+E,t:B,a:-4.41155928669
+E,t:B,ad:-5.93113321822
+E,t:B,an:-7.98669038703
+E,t:B,b:-5.37395036573
+E,t:B,c:-5.01789099584
+E,t:B,d:-3.59535407534
+E,t:B,df:-9.85849256393
+E,t:B,e:-12.2563878367
+E,t:B,f:-3.72509452094
+E,t:B,h:-11.3400971049
+E,t:B,i:-5.98351083018
+E,t:B,in:-11.8509227286
+E,t:B,j:-4.96882719642
+E,t:B,l:-5.82184131794
+E,t:B,ln:-12.9495350173
+E,t:B,m:-3.32794629245
+E,t:B,mq:-5.8686671206
+E,t:B,n:-1.73926990795
+E,t:B,nr:-3.7356011098
+E,t:B,nrfg:-7.14440004837
+E,t:B,nrt:-6.42891388973
+E,t:B,ns:-3.65522121154
+E,t:B,nt:-5.78018500062
+E,t:B,nz:-5.33177544068
+E,t:B,o:-10.8700934756
+E,t:B,p:-5.60159119414
+E,t:B,q:-6.98338827817
+E,t:B,r:-3.8574152767
+E,t:B,rr:-12.9495350173
+E,t:B,rz:-8.70103977524
+E,t:B,s:-5.11950693476
+E,t:B,t:-3.38558439275
+E,t:B,u:-5.78018500062
+E,t:B,v:-2.07805652129
+E,t:B,vd:-7.91258241488
+E,t:B,vn:-4.35427029045
+E,t:B,vq:-10.5516397445
+E,t:B,y:-10.4646283675
+E,t:B,z:-7.18434391451
+E,t:S,a:-4.4813220081
+E,t:S,ad:-11.1577755481
+E,t:S,ag:-8.231036146
+E,t:S,an:-12.9495350173
+E,t:S,b:-6.91884975703
+E,t:S,c:-4.68646018149
+E,t:S,d:-2.61976717027
+E,t:S,dg:-9.07833400638
+E,t:S,e:-9.65369815129
+E,t:S,f:-4.00864394951
+E,t:S,g:-7.47307146536
+E,t:S,h:-9.90501257957
+E,t:S,j:-5.27120866078
+E,t:S,k:-9.01770938457
+E,t:S,m:-3.35822716881
+E,t:S,mg:-9.81404080136
+E,t:S,n:-4.31118670432
+E,t:S,ng:-3.93180899159
+E,t:S,nr:-5.61847471207
+E,t:S,nt:-12.9495350173
+E,t:S,o:-10.0591632594
+E,t:S,p:-3.22738950143
+E,t:S,q:-4.68285657398
+E,t:S,r:-3.44205741409
+E,t:S,t:-11.0036248682
+E,t:S,tg:-6.46185099881
+E,t:S,u:-5.42984261317
+E,t:S,ud:-7.62652503815
+E,t:S,ug:-7.68684482839
+E,t:S,uj:-2.66197624933
+E,t:S,ul:-5.66129061627
+E,t:S,uv:-8.24000481598
+E,t:S,uz:-9.33861710465
+E,t:S,v:-2.63228355383
+E,t:S,vg:-6.02197711101
+E,t:S,vn:-10.2414848162
+E,t:S,x:-9.77148118694
+E,t:S,y:-7.11765254001
+E,u:B,a:-3.59155256022
+E,u:B,ad:-5.40474731016
+E,u:B,an:-7.09214676407
+E,u:B,b:-5.00262110332
+E,u:B,c:-3.39117851263
+E,u:B,d:-2.93284147255
+E,u:B,df:-9.31677031559
+E,u:B,e:-10.7030646767
+E,u:B,f:-5.48270885163
+E,u:B,i:-4.91616729535
+E,u:B,j:-5.85887759025
+E,u:B,l:-5.09726261042
+E,u:B,m:-4.12659510766
+E,u:B,mq:-6.32103804204
+E,u:B,n:-2.10613651728
+E,u:B,nr:-4.17656981714
+E,u:B,nrfg:-7.75862569755
+E,u:B,nrt:-6.55992995032
+E,u:B,ns:-4.4550218022
+E,u:B,nt:-6.69573149148
+E,u:B,nz:-5.84325227235
+E,u:B,o:-6.8318636658
+E,u:B,p:-4.93787357393
+E,u:B,q:-6.21442830698
+E,u:B,r:-3.09667728694
+E,u:B,rz:-8.21815802692
+E,u:B,s:-5.5850708643
+E,u:B,t:-3.89845015665
+E,u:B,u:-6.11809719804
+E,u:B,v:-2.22087709449
+E,u:B,vd:-9.60445238804
+E,u:B,vn:-4.74463998368
+E,u:B,y:-8.91130520748
+E,u:B,z:-5.40975985199
+E,u:S,a:-4.04120993617
+E,u:S,ag:-7.48418885184
+E,u:S,an:-10.7030646767
+E,u:S,b:-6.67771298598
+E,u:S,c:-4.29288979475
+E,u:S,d:-2.47355355775
+E,u:S,dg:-8.62362313503
+E,u:S,e:-8.0640073471
+E,u:S,f:-5.78308375088
+E,u:S,g:-7.65854223899
+E,u:S,h:-10.0099174962
+E,u:S,j:-6.04910432655
+E,u:S,k:-8.62362313503
+E,u:S,m:-4.42079792982
+E,u:S,mg:-10.7030646767
+E,u:S,n:-4.37512789298
+E,u:S,ng:-5.41479764602
+E,u:S,nr:-6.23715655806
+E,u:S,o:-7.70733240316
+E,u:S,p:-3.02520117603
+E,u:S,q:-5.51567887087
+E,u:S,r:-2.69237313758
+E,u:S,tg:-7.99501447561
+E,u:S,u:-6.15976989444
+E,u:S,ud:-7.86985133266
+E,u:S,ug:-8.13811531925
+E,u:S,uj:-2.62966170773
+E,u:S,ul:-5.00262110332
+E,u:S,uv:-5.27371904776
+E,u:S,v:-2.23632302879
+E,u:S,vg:-5.78308375088
+E,u:S,vn:-10.7030646767
+E,u:S,x:-9.09362676428
+E,u:S,y:-5.63416047449
+E,v:B,a:-3.89896021699
+E,v:B,ad:-5.66419668154
+E,v:B,an:-7.24124187231
+E,v:B,b:-4.98302865774
+E,v:B,c:-4.33801169038
+E,v:B,d:-3.87455226797
+E,v:B,df:-10.0321687005
+E,v:B,e:-11.3169936015
+E,v:B,f:-4.94316498979
+E,v:B,h:-12.4156058901
+E,v:B,i:-5.68836327865
+E,v:B,in:-14.2614325806
+E,v:B,j:-5.39508599467
+E,v:B,l:-5.49016580793
+E,v:B,ln:-12.9621495965
+E,v:B,m:-3.53068225059
+E,v:B,mq:-7.02509323787
+E,v:B,n:-1.60399985514
+E,v:B,nr:-4.01908279265
+E,v:B,nrfg:-7.42481532948
+E,v:B,nrt:-6.38239346148
+E,v:B,ns:-3.74488777854
+E,v:B,nt:-6.0795256627
+E,v:B,nz:-5.51016908621
+E,v:B,o:-9.35369170969
+E,v:B,p:-5.6489898173
+E,v:B,q:-7.20353464321
+E,v:B,qe:-15.3600448693
+E,v:B,r:-3.56696056052
+E,v:B,rr:-11.6964832232
+E,v:B,rz:-8.95316488322
+E,v:B,s:-5.1843188858
+E,v:B,t:-4.3422685487
+E,v:B,u:-7.17052275855
+E,v:B,v:-2.08133436887
+E,v:B,vd:-8.04615803766
+E,v:B,vi:-13.0574597763
+E,v:B,vn:-3.75989638307
+E,v:B,vq:-11.0833787503
+E,v:B,y:-8.85575669576
+E,v:B,z:-6.9857986872
+E,vd:B,a:-3.30641602926
+E,vd:B,ad:-6.72540295248
+E,vd:B,an:-6.98776721695
+E,vd:B,b:-6.03225577192
+E,vd:B,c:-5.35852667722
+E,vd:B,d:-3.62739182981
+E,vd:B,df:-9.29035230995
+E,vd:B,f:-6.65129498033
+E,vd:B,i:-7.34444216089
+E,vd:B,j:-6.51776358771
+E,vd:B,l:-6.65129498033
+E,vd:B,m:-3.42105539681
+E,vd:B,n:-2.40177985038
+E,vd:B,nr:-6.80544566016
+E,vd:B,nrt:-8.59720512939
+E,vd:B,ns:-6.65129498033
+E,vd:B,nt:-8.59720512939
+E,vd:B,nz:-8.59720512939
+E,vd:B,p:-7.34444216089
+E,vd:B,q:-9.29035230995
+E,vd:B,r:-4.74705752768
+E,vd:B,s:-7.09312773261
+E,vd:B,t:-6.19930985659
+E,vd:B,u:-9.29035230995
+E,vd:B,v:-0.765389381265
+E,vd:B,vd:-8.19174002128
+E,vd:B,vn:-2.34819560425
+E,vd:B,y:-9.29035230995
+E,vd:B,z:-7.34444216089
+E,vd:S,a:-4.33452525234
+E,vd:S,c:-4.40000318172
+E,vd:S,d:-3.88318053849
+E,vd:S,f:-6.29462003639
+E,vd:S,g:-9.29035230995
+E,vd:S,j:-9.29035230995
+E,vd:S,k:-9.29035230995
+E,vd:S,m:-4.27971701585
+E,vd:S,n:-5.6794343973
+E,vd:S,ng:-6.98776721695
+E,vd:S,nr:-7.68091439751
+E,vd:S,p:-4.13129701073
+E,vd:S,q:-5.35852667722
+E,vd:S,r:-6.15485809402
+E,vd:S,u:-6.58230210884
+E,vd:S,ud:-7.49859284072
+E,vd:S,ug:-7.68091439751
+E,vd:S,uj:-2.92732420641
+E,vd:S,ul:-4.16045359502
+E,vd:S,uv:-5.37832930452
+E,vd:S,uz:-7.34444216089
+E,vd:S,v:-2.89676155599
+E,vd:S,vg:-7.34444216089
+E,vd:S,y:-8.59720512939
+E,vi:B,a:-2.25129179861
+E,vi:B,b:-2.94443897917
+E,vi:B,d:-3.16758253048
+E,vi:B,i:-3.86072971104
+E,vi:B,m:-2.47443534992
+E,vi:B,n:-1.0881409888
+E,vi:B,ns:-4.5538768916
+E,vi:B,r:-2.76211742237
+E,vi:B,s:-4.5538768916
+E,vi:B,t:-3.86072971104
+E,vi:B,v:-3.86072971104
+E,vi:B,vn:-3.45526460293
+E,vi:S,a:-3.86072971104
+E,vi:S,d:-4.5538768916
+E,vi:S,f:-4.5538768916
+E,vi:S,j:-3.45526460293
+E,vi:S,n:-3.45526460293
+E,vi:S,p:-3.16758253048
+E,vi:S,q:-3.86072971104
+E,vi:S,r:-4.5538768916
+E,vi:S,v:-3.86072971104
+E,vn:B,a:-4.23566433677
+E,vn:B,ad:-5.52439245395
+E,vn:B,an:-7.49117622615
+E,vn:B,b:-5.16887624055
+E,vn:B,c:-4.04307248901
+E,vn:B,d:-3.78951526989
+E,vn:B,df:-10.6492958416
+E,vn:B,e:-13.5937348208
+E,vn:B,f:-5.05988118846
+E,vn:B,h:-13.5937348208
+E,vn:B,i:-6.63623744989
+E,vn:B,j:-5.61131847394
+E,vn:B,jn:-13.5937348208
+E,vn:B,l:-5.68204430006
+E,vn:B,m:-4.59189572337
+E,vn:B,mq:-8.06430573325
+E,vn:B,n:-1.029872353
+E,vn:B,nr:-4.8745808573
+E,vn:B,nrfg:-8.28052884172
+E,vn:B,nrt:-7.00480834323
+E,vn:B,ns:-4.76202290294
+E,vn:B,nt:-6.74679168118
+E,vn:B,nz:-6.08330426439
+E,vn:B,o:-11.0287854633
+E,vn:B,p:-5.74753600527
+E,vn:B,q:-8.12567467963
+E,vn:B,r:-4.43890715872
+E,vn:B,rr:-13.5937348208
+E,vn:B,rz:-10.0102158823
+E,vn:B,s:-6.08439955475
+E,vn:B,t:-4.9117053869
+E,vn:B,u:-6.93315967093
+E,vn:B,v:-2.22588137169
+E,vn:B,vd:-8.10067337743
+E,vn:B,vn:-3.06870350653
+E,vn:B,vq:-12.9005876402
+E,vn:B,y:-9.27624670723
+E,vn:B,z:-8.27561482692
+E,vn:S,a:-4.91340289197
+E,vn:S,ad:-11.8019753515
+E,vn:S,ag:-8.96876200748
+E,vn:S,b:-7.02285185843
+E,vn:S,c:-3.11335304449
+E,vn:S,d:-3.35699449424
+E,vn:S,dg:-8.60330223399
+E,vn:S,e:-10.549212383
+E,vn:S,f:-3.66443333334
+E,vn:S,g:-8.28052884172
+E,vn:S,h:-9.51619737686
+E,vn:S,j:-6.08330426439
+E,vn:S,k:-6.6525447657
+E,vn:S,m:-4.49869307315
+E,vn:S,mg:-12.2074404596
+E,vn:S,n:-4.16137152514
+E,vn:S,ng:-5.00906991423
+E,vn:S,nr:-6.99386432155
+E,vn:S,o:-11.9842969083
+E,vn:S,p:-3.30087766729
+E,vn:S,q:-5.20847430061
+E,vn:S,r:-4.3502498502
+E,vn:S,rg:-12.2074404596
+E,vn:S,t:-12.9005876402
+E,vn:S,tg:-8.16438919181
+E,vn:S,u:-4.58771624586
+E,vn:S,ud:-7.33224313644
+E,vn:S,ug:-6.92296849992
+E,vn:S,uj:-2.52165814788
+E,vn:S,ul:-4.94691786156
+E,vn:S,uv:-7.53695080754
+E,vn:S,uz:-6.59157886636
+E,vn:S,v:-3.202127482
+E,vn:S,vg:-7.04694941001
+E,vn:S,vn:-11.195839548
+E,vn:S,x:-9.787072331
+E,vn:S,y:-6.88687248416
+E,vq:B,a:-4.94164242261
+E,vq:B,ad:-6.32793678373
+E,vq:B,an:-6.32793678373
+E,vq:B,b:-5.63478960317
+E,vq:B,c:-4.24849524205
+E,vq:B,d:-4.7184988713
+E,vq:B,f:-4.5361773145
+E,vq:B,i:-5.22932449506
+E,vq:B,l:-6.32793678373
+E,vq:B,m:-2.09383027913
+E,vq:B,n:-2.25039933982
+E,vq:B,nr:-3.03209991772
+E,vq:B,nrfg:-6.32793678373
+E,vq:B,ns:-2.03747734258
+E,vq:B,nt:-6.32793678373
+E,vq:B,nz:-6.32793678373
+E,vq:B,q:-6.32793678373
+E,vq:B,r:-2.47778918202
+E,vq:B,s:-6.32793678373
+E,vq:B,t:-4.7184988713
+E,vq:B,v:-3.84303013394
+E,vq:B,vn:-6.32793678373
+E,vq:B,y:-6.32793678373
+E,vq:S,a:-3.1924425678
+E,vq:S,c:-5.63478960317
+E,vq:S,d:-3.55534806149
+E,vq:S,f:-5.22932449506
+E,vq:S,j:-5.63478960317
+E,vq:S,m:-4.02535169074
+E,vq:S,n:-2.74441784527
+E,vq:S,ng:-5.63478960317
+E,vq:S,nr:-4.7184988713
+E,vq:S,p:-4.94164242261
+E,vq:S,q:-4.38202663467
+E,vq:S,r:-2.74441784527
+E,vq:S,tg:-5.22932449506
+E,vq:S,ug:-6.32793678373
+E,vq:S,uj:-2.77258872224
+E,vq:S,ul:-3.38349780456
+E,vq:S,v:-3.33220451018
+E,vq:S,y:-4.5361773145
+E,v:S,a:-4.39710174329
+E,v:S,ad:-11.2491710051
+E,v:S,ag:-7.83872688909
+E,v:S,an:-11.9588474876
+E,v:S,b:-6.8009422748
+E,v:S,bg:-14.6668976887
+E,v:S,c:-3.84375507005
+E,v:S,d:-3.43503624391
+E,v:S,dg:-8.82916724157
+E,v:S,e:-9.24194767125
+E,v:S,f:-4.21734285909
+E,v:S,g:-7.32314809661
+E,v:S,h:-8.63982471416
+E,v:S,j:-5.62072466297
+E,v:S,k:-6.62403748472
+E,v:S,m:-4.03113840095
+E,v:S,mg:-11.6711654152
+E,v:S,n:-3.93027277844
+E,v:S,ng:-4.673089657
+E,v:S,nr:-5.77696921383
+E,v:S,nt:-12.9621495965
+E,v:S,o:-9.6267035924
+E,v:S,p:-3.04583107764
+E,v:S,q:-4.80202103533
+E,v:S,r:-3.37085416991
+E,v:S,rg:-12.3155224316
+E,v:S,t:-13.5682854001
+E,v:S,tg:-7.42947901506
+E,v:S,u:-5.27648829502
+E,v:S,ud:-6.6060419358
+E,v:S,ug:-6.06224322155
+E,v:S,uj:-2.7223489109
+E,v:S,ul:-3.050243038
+E,v:S,uv:-6.11491667183
+E,v:S,uz:-5.11371257063
+E,v:S,v:-2.68146236274
+E,v:S,vg:-6.13688699361
+E,v:S,vn:-10.397200239
+E,v:S,x:-9.1636007415
+E,v:S,y:-5.86437519045
+E,y:B,a:-4.60395732956
+E,y:B,ad:-6.71417052991
+E,y:B,an:-8.10046489103
+E,y:B,b:-6.71417052991
+E,y:B,c:-2.67551487355
+E,y:B,d:-2.75813063906
+E,y:B,f:-5.79787979804
+E,y:B,i:-4.80462802503
+E,y:B,j:-7.40731771047
+E,y:B,l:-4.4369032449
+E,y:B,m:-4.07511320029
+E,y:B,mq:-6.4910269786
+E,y:B,n:-2.40673275223
+E,y:B,nr:-2.92431515846
+E,y:B,nrfg:-8.10046489103
+E,y:B,nrt:-6.71417052991
+E,y:B,ns:-4.76826038085
+E,y:B,nt:-8.10046489103
+E,y:B,nz:-6.71417052991
+E,y:B,o:-8.10046489103
+E,y:B,p:-4.69926750937
+E,y:B,q:-8.10046489103
+E,y:B,r:-2.84819146298
+E,y:B,rz:-8.10046489103
+E,y:B,s:-5.90324031369
+E,y:B,t:-3.55717010876
+E,y:B,u:-8.10046489103
+E,y:B,v:-2.60329666574
+E,y:B,vn:-5.15602591186
+E,y:B,y:-4.60395732956
+E,y:B,z:-7.40731771047
+E,y:S,a:-4.05741362319
+E,y:S,ag:-5.90324031369
+E,y:S,b:-5.90324031369
+E,y:S,c:-3.38196601973
+E,y:S,d:-2.33214389524
+E,y:S,dg:-8.10046489103
+E,y:S,e:-6.4910269786
+E,y:S,f:-5.79787979804
+E,y:S,g:-7.40731771047
+E,y:S,j:-5.53551553357
+E,y:S,m:-5.15602591186
+E,y:S,n:-4.00612032881
+E,y:S,ng:-5.61555824124
+E,y:S,nr:-4.66647768654
+E,y:S,p:-3.27215115373
+E,y:S,q:-5.61555824124
+E,y:S,r:-2.12411398173
+E,y:S,tg:-6.02102334935
+E,y:S,u:-5.53551553357
+E,y:S,ud:-6.15455474197
+E,y:S,ug:-7.40731771047
+E,y:S,uj:-6.3087054218
+E,y:S,ul:-7.40731771047
+E,y:S,uv:-7.40731771047
+E,y:S,uz:-7.40731771047
+E,y:S,v:-2.52451578788
+E,y:S,vg:-5.79787979804
+E,y:S,x:-7.00185260236
+E,y:S,y:-4.66647768654
+E,z:B,a:-3.78471845948
+E,z:B,ad:-6.98058652611
+E,z:B,an:-7.06226455712
+E,z:B,b:-6.1083911141
+E,z:B,c:-5.10727718991
+E,z:B,d:-4.3584787548
+E,z:B,e:-10.9124121588
+E,z:B,f:-5.86898704191
+E,z:B,i:-4.9696127837
+E,z:B,j:-7.06226455712
+E,z:B,l:-5.77074860233
+E,z:B,m:-3.66390808646
+E,z:B,mq:-8.60982706584
+E,z:B,n:-1.92434072076
+E,z:B,nr:-4.77468510474
+E,z:B,nrfg:-9.3029742464
+E,z:B,nrt:-7.10574966906
+E,z:B,ns:-5.58453599004
+E,z:B,nt:-9.1206526896
+E,z:B,nz:-6.92342811227
+E,z:B,o:-8.42750550904
+E,z:B,p:-6.66391691678
+E,z:B,q:-8.27335482921
+E,z:B,r:-4.97487595375
+E,z:B,rz:-9.81379987016
+E,z:B,s:-5.71391512756
+E,z:B,t:-5.48746214135
+E,z:B,u:-8.13982343659
+E,z:B,v:-2.0855308147
+E,z:B,vd:-8.71518758149
+E,z:B,vn:-5.10426966885
+E,z:B,y:-9.81379987016
+E,z:B,z:-4.50223727686
+E,z:S,a:-4.40066682918
+E,z:S,ag:-7.22353270472
+E,z:S,an:-10.9124121588
+E,z:S,b:-5.55111999312
+E,z:S,c:-4.22032841632
+E,z:S,d:-3.68329828104
+E,z:S,dg:-8.71518758149
+E,z:S,e:-7.86788972111
+E,z:S,f:-5.48746214135
+E,z:S,g:-7.44667625603
+E,z:S,h:-10.9124121588
+E,z:S,j:-6.53038552416
+E,z:S,k:-7.15121204314
+E,z:S,m:-4.47626179046
+E,z:S,n:-3.99371693981
+E,z:S,ng:-4.79211473988
+E,z:S,nr:-6.15023822403
+E,z:S,nt:-10.9124121588
+E,z:S,o:-9.3029742464
+E,z:S,p:-3.66818464323
+E,z:S,q:-5.01800932456
+E,z:S,r:-4.24164583798
+E,z:S,tg:-7.44667625603
+E,z:S,u:-5.10426966885
+E,z:S,ud:-7.58020764865
+E,z:S,ug:-7.86788972111
+E,z:S,uj:-1.51046018315
+E,z:S,ul:-5.4030238222
+E,z:S,uv:-2.41440178683
+E,z:S,uz:-6.81806759661
+E,z:S,v:-2.14726573719
+E,z:S,vg:-5.52791709604
+E,z:S,vn:-9.52611779771
+E,z:S,x:-8.60982706584
+E,z:S,y:-6.83487471492
+M,ad:E,ad:-0.640037355246
+M,ad:M,ad:-0.749236647211
+M,a:E,a:-0.152258952785
+M,a:M,a:-1.95733628434
+M,b:E,b:-0.0369710047673
+M,b:M,b:-3.31604987923
+M,c:E,c:-0.361889852475
+M,c:M,c:-1.19190941332
+M,d:E,d:-0.0148645907356
+M,d:M,d:-4.21619644387
+M,e:E,e:0.0
+M,f:E,f:0.0
+M,i:E,i:-0.702661941094
+M,i:M,i:-0.683722098098
+M,in:E,in:-0.69314718056
+M,in:M,in:-0.69314718056
+M,j:E,j:-0.140261257514
+M,j:M,j:-2.03355951591
+M,jn:E,jn:0.0
+M,l:E,l:-0.610349340841
+M,l:M,l:-0.783424439453
+M,ln:E,ln:-0.69314718056
+M,ln:M,ln:-0.69314718056
+M,m:E,m:-0.248676230617
+M,m:M,m:-1.51336628795
+M,mq:E,mq:-0.0201815947373
+M,mq:M,mq:-3.91305806827
+M,n:E,n:-0.143782038098
+M,n:M,n:-2.01048653137
+M,nr:E,nr:-0.0339524078378
+M,nrfg:E,nrfg:-0.024812491912
+M,nrfg:M,nrfg:-3.7087886401
+M,nr:M,nr:-3.3997236769
+M,nrt:E,nrt:-0.430091054708
+M,nrt:M,nrt:-1.05110828126
+M,ns:E,ns:-0.415387167505
+M,ns:M,ns:-1.07905871559
+M,nt:E,nt:-1.06193992192
+M,nt:M,nt:-0.424318264124
+M,nz:E,nz:-0.612912279077
+M,nz:M,nz:-0.780385743322
+M,o:E,o:-0.439135452592
+M,o:M,o:-1.03449296687
+M,p:E,p:0.0
+M,q:E,q:-0.588791155651
+M,q:M,q:-0.809676020028
+M,r:E,r:-0.00122558422082
+M,r:M,r:-6.70495036325
+M,rr:E,rr:0.0
+M,s:E,s:-0.0387064547148
+M,s:M,s:-3.27103970793
+M,t:E,t:-0.039098081663
+M,t:M,t:-3.261167223
+M,u:E,u:0.0
+M,v:E,v:-0.0274122076559
+M,vi:E,vi:0.0
+M,v:M,v:-3.6104416244
+M,vn:E,vn:-0.00571932927259
+M,vn:M,vn:-5.16676204219
+M,y:E,y:0.0
+M,z:E,z:-0.269488416227
+M,z:M,z:-1.44294990909
+S,a:B,a:-4.88226815617
+S,a:B,ad:-7.26639576964
+S,a:B,an:-8.09423645801
+S,a:B,b:-5.93815692478
+S,a:B,c:-4.57501489836
+S,a:B,d:-4.51889036131
+S,a:B,df:-10.0308872816
+S,a:B,e:-12.078580125
+S,a:B,f:-5.70696827778
+S,a:B,i:-6.60421081469
+S,a:B,in:-13.4648744861
+S,a:B,j:-5.85550794818
+S,a:B,l:-6.16507711938
+S,a:B,m:-3.64032192169
+S,a:B,mq:-8.39597028391
+S,a:B,n:-1.52137512692
+S,a:B,nr:-4.00837740854
+S,a:B,nrfg:-8.31158289164
+S,a:B,nrt:-6.7494910998
+S,a:B,ns:-4.60764399193
+S,a:B,nt:-8.21785041397
+S,a:B,nz:-5.94247425475
+S,a:B,o:-9.33774010109
+S,a:B,p:-6.7890512645
+S,a:B,q:-6.28328254152
+S,a:B,r:-4.90903767113
+S,a:B,rz:-10.8999251287
+S,a:B,s:-5.73601866228
+S,a:B,t:-5.07710684216
+S,a:B,u:-7.54061868872
+S,a:B,v:-2.85836368237
+S,a:B,vd:-9.04603387834
+S,a:B,vn:-4.33390204954
+S,a:B,y:-9.10816565945
+S,a:B,z:-6.9010189596
+S,ad:B,a:-5.97211181859
+S,ad:B,ad:-6.3775769267
+S,ad:B,b:-7.07072410726
+S,ad:B,c:-6.3775769267
+S,ad:B,d:-4.5057747498
+S,ad:B,f:-6.3775769267
+S,ad:B,i:-5.97211181859
+S,ad:B,j:-6.3775769267
+S,ad:B,l:-7.07072410726
+S,ad:B,m:-4.29813538502
+S,ad:B,mq:-7.07072410726
+S,ad:B,n:-4.18035234936
+S,ad:B,nr:-4.58581745747
+S,ad:B,nrt:-4.2375107632
+S,ad:B,ns:-5.1248139582
+S,ad:B,nz:-5.97211181859
+S,ad:B,p:-7.07072410726
+S,ad:B,r:-3.81262756924
+S,ad:B,s:-5.1248139582
+S,ad:B,t:-5.68442974614
+S,ad:B,u:-6.3775769267
+S,ad:B,v:-2.66400486
+S,ad:B,vn:-7.07072410726
+S,ad:B,z:-7.07072410726
+S,ad:S,a:-3.77488724126
+S,ad:S,ad:-5.1248139582
+S,ad:S,ag:-5.46128619483
+S,ad:S,c:-4.58581745747
+S,ad:S,d:-3.28653447334
+S,ad:S,dg:-7.07072410726
+S,ad:S,f:-5.68442974614
+S,ad:S,g:-3.26406161749
+S,ad:S,h:-5.97211181859
+S,ad:S,j:-5.68442974614
+S,ad:S,k:-6.3775769267
+S,ad:S,m:-4.12628512809
+S,ad:S,n:-3.81262756924
+S,ad:S,ng:-3.85184828239
+S,ad:S,nr:-4.67282883446
+S,ad:S,p:-2.61637681101
+S,ad:S,q:-3.06339092203
+S,ad:S,r:-4.29813538502
+S,ad:S,tg:-5.68442974614
+S,ad:S,u:-4.87349952992
+S,ad:S,ud:-7.07072410726
+S,ad:S,uj:-4.18035234936
+S,ad:S,ul:-5.97211181859
+S,ad:S,uv:-6.3775769267
+S,ad:S,v:-0.97040515524
+S,ad:S,vg:-2.94358972222
+S,ad:S,x:-4.58581745747
+S,ad:S,y:-7.07072410726
+S,ag:B,a:-4.57717540593
+S,ag:B,ad:-6.89628980087
+S,ag:B,an:-9.60434000198
+S,ag:B,b:-6.06338067794
+S,ag:B,c:-5.22858298031
+S,ag:B,d:-4.84644872897
+S,ag:B,df:-10.2974871825
+S,ag:B,f:-6.00702774139
+S,ag:B,i:-6.21994973863
+S,ag:B,j:-6.83175127974
+S,ag:B,l:-6.71396824408
+S,ag:B,m:-4.88138678033
+S,ag:B,mq:-8.91119282142
+S,ag:B,n:-2.39610982874
+S,ag:B,nr:-3.29169816328
+S,ag:B,nrfg:-7.89959190974
+S,ag:B,nrt:-4.56738739956
+S,ag:B,ns:-4.89031541107
+S,ag:B,nz:-5.90303802786
+S,ag:B,o:-8.50572771331
+S,ag:B,p:-7.16199296661
+S,ag:B,q:-7.89959190974
+S,ag:B,r:-5.2223133673
+S,ag:B,rz:-9.60434000198
+S,ag:B,s:-6.10783244051
+S,ag:B,t:-5.34872729216
+S,ag:B,u:-7.65842985292
+S,ag:B,v:-3.1475703464
+S,ag:B,vd:-9.19887489387
+S,ag:B,vn:-5.59700681674
+S,ag:B,y:-7.89959190974
+S,ag:B,z:-6.38546417711
+S,ag:S,a:-3.3640641568
+S,ag:S,ad:-9.60434000198
+S,ag:S,ag:-3.47528979191
+S,ag:S,an:-10.2974871825
+S,ag:S,b:-5.77569860549
+S,ag:S,bg:-9.60434000198
+S,ag:S,c:-4.31607297128
+S,ag:S,d:-3.27819052882
+S,ag:S,dg:-7.73253782507
+S,ag:S,e:-7.89959190974
+S,ag:S,f:-4.58706016516
+S,ag:S,g:-3.47747081786
+S,ag:S,h:-8.91119282142
+S,ag:S,j:-4.15760263031
+S,ag:S,k:-5.29354087659
+S,ag:S,m:-4.71775735655
+S,ag:S,mg:-7.65842985292
+S,ag:S,n:-2.23002451552
+S,ag:S,ng:-2.31917621267
+S,ag:S,nr:-3.87586491473
+S,ag:S,o:-6.40566688442
+S,ag:S,p:-4.01335302146
+S,ag:S,q:-3.49731711423
+S,ag:S,r:-4.09292941997
+S,ag:S,rg:-8.35157703348
+S,ag:S,tg:-4.58706016516
+S,ag:S,u:-4.6555801116
+S,ag:S,ud:-6.89628980087
+S,ag:S,ug:-7.73253782507
+S,ag:S,uj:-3.69897815392
+S,ag:S,ul:-5.25406206562
+S,ag:S,uv:-6.04899194049
+S,ag:S,uz:-6.65990102281
+S,ag:S,v:-1.83855889925
+S,ag:S,vg:-3.61412623677
+S,ag:S,x:-4.36789803915
+S,ag:S,y:-4.93151116751
+S,ag:S,yg:-9.60434000198
+S,ag:S,zg:-10.2974871825
+S,an:B,a:-4.5279805473
+S,an:B,an:-6.47389069635
+S,an:B,c:-4.27666611902
+S,an:B,d:-3.90894133889
+S,an:B,i:-5.78074351579
+S,an:B,l:-5.78074351579
+S,an:B,m:-5.37527840768
+S,an:B,n:-2.62374309464
+S,an:B,nr:-4.27666611902
+S,an:B,ns:-6.47389069635
+S,an:B,nz:-6.47389069635
+S,an:B,r:-4.5279805473
+S,an:B,t:-5.78074351579
+S,an:B,v:-2.48490664979
+S,an:B,vn:-5.78074351579
+S,an:B,y:-6.47389069635
+S,an:B,z:-6.47389069635
+S,an:S,a:-3.58351893846
+S,an:S,ag:-5.78074351579
+S,an:S,an:-5.08759633523
+S,an:S,b:-6.47389069635
+S,an:S,c:-3.58351893846
+S,an:S,d:-2.39635325245
+S,an:S,f:-3.76584049525
+S,an:S,g:-4.27666611902
+S,an:S,j:-5.37527840768
+S,an:S,k:-4.5279805473
+S,an:S,m:-5.37527840768
+S,an:S,n:-2.39635325245
+S,an:S,ng:-2.78501124224
+S,an:S,nr:-4.27666611902
+S,an:S,p:-3.83483336674
+S,an:S,q:-3.58351893846
+S,an:S,r:-3.76584049525
+S,an:S,tg:-5.78074351579
+S,an:S,u:-3.90894133889
+S,an:S,ug:-6.47389069635
+S,an:S,uj:-2.8903717579
+S,an:S,ul:-5.37527840768
+S,an:S,uv:-6.47389069635
+S,an:S,v:-1.72030050525
+S,an:S,vg:-3.90894133889
+S,an:S,y:-4.5279805473
+S,a:S,a:-3.44859410612
+S,a:S,ad:-10.9799678363
+S,a:S,ag:-6.04011272431
+S,a:S,an:-9.09542663367
+S,a:S,b:-6.46271853173
+S,a:S,c:-4.12922392319
+S,a:S,d:-3.36619028434
+S,a:S,dg:-8.63656074883
+S,a:S,e:-9.02222322964
+S,a:S,f:-4.87183198244
+S,a:S,g:-5.62024184167
+S,a:S,h:-8.13215569287
+S,a:S,j:-4.82493282946
+S,a:S,k:-6.46636484388
+S,a:S,m:-4.08016072721
+S,a:S,mg:-9.63623308965
+S,a:S,n:-2.50350983766
+S,a:S,ng:-3.3855446554
+S,a:S,nr:-4.72198101462
+S,a:S,nt:-12.7717273056
+S,a:S,o:-9.02222322964
+S,a:S,p:-3.52679228883
+S,a:S,q:-3.52630940699
+S,a:S,r:-4.24161788889
+S,a:S,rg:-11.2676499088
+S,a:S,t:-12.3662621975
+S,a:S,tg:-6.80814796196
+S,a:S,u:-5.47599223283
+S,a:S,ud:-5.13040293153
+S,a:S,ug:-6.744654331
+S,a:S,uj:-2.59062695601
+S,a:S,ul:-3.71862571003
+S,a:S,uv:-5.67417845496
+S,a:S,uz:-5.99010230374
+S,a:S,v:-2.01883696671
+S,a:S,vg:-4.90538838253
+S,a:S,vn:-8.35288669778
+S,a:S,x:-6.41388503907
+S,a:S,y:-5.13136377715
+S,a:S,zg:-13.4648744861
+S,b:B,a:-5.55015797216
+S,b:B,ad:-8.42560407984
+S,b:B,an:-9.05421273926
+S,b:B,b:-6.10321635955
+S,b:B,c:-6.20640059579
+S,b:B,d:-5.49174721001
+S,b:B,df:-9.52421636851
+S,b:B,e:-11.1336542809
+S,b:B,f:-6.10321635955
+S,b:B,i:-6.72693503368
+S,b:B,j:-6.38872215258
+S,b:B,l:-6.19918034781
+S,b:B,m:-5.2014090935
+S,b:B,mq:-9.34189481172
+S,b:B,n:-0.808041179407
+S,b:B,nr:-4.84393871004
+S,b:B,nrfg:-11.1336542809
+S,b:B,nrt:-7.03930971872
+S,b:B,ns:-5.03109568633
+S,b:B,nt:-6.85698816193
+S,b:B,nz:-6.40626646223
+S,b:B,o:-11.1336542809
+S,b:B,p:-8.13792200739
+S,b:B,q:-8.83106918795
+S,b:B,r:-5.27572112646
+S,b:B,rz:-11.1336542809
+S,b:B,s:-6.59035949867
+S,b:B,t:-6.56930608948
+S,b:B,u:-8.42560407984
+S,b:B,v:-2.95277333895
+S,b:B,vd:-10.4405071004
+S,b:B,vn:-3.89228799762
+S,b:B,y:-11.1336542809
+S,b:B,z:-7.91477845608
+S,bg:B,n:-2.4159137783
+S,bg:B,nr:-4.02535169074
+S,bg:S,a:-2.92673940207
+S,bg:S,ag:-2.63905732962
+S,bg:S,c:-4.02535169074
+S,bg:S,dg:-3.33220451018
+S,bg:S,f:-4.02535169074
+S,bg:S,g:-2.23359222151
+S,bg:S,j:-2.92673940207
+S,bg:S,n:-3.33220451018
+S,bg:S,ng:-2.63905732962
+S,bg:S,nr:-4.02535169074
+S,bg:S,q:-3.33220451018
+S,bg:S,r:-4.02535169074
+S,bg:S,v:-1.38629436112
+S,bg:S,vg:-2.92673940207
+S,bg:S,x:-3.33220451018
+S,bg:S,y:-4.02535169074
+S,b:S,a:-4.34806663594
+S,b:S,ad:-11.1336542809
+S,b:S,ag:-7.32699179117
+S,b:S,b:-3.77737440439
+S,b:S,c:-5.03333532892
+S,b:S,d:-3.9437321102
+S,b:S,dg:-8.93642970361
+S,b:S,e:-11.1336542809
+S,b:S,f:-4.17901541606
+S,b:S,g:-5.53153546006
+S,b:S,h:-7.66791837814
+S,b:S,j:-5.24201006912
+S,b:S,k:-6.80292094066
+S,b:S,m:-4.70393480291
+S,b:S,mg:-9.34189481172
+S,b:S,n:-2.21206321738
+S,b:S,ng:-3.58457157013
+S,b:S,nr:-5.52418248576
+S,b:S,o:-8.3610655587
+S,b:S,p:-3.53225194636
+S,b:S,q:-4.26672099648
+S,b:S,r:-5.16239244115
+S,b:S,rg:-11.1336542809
+S,b:S,tg:-6.76420642848
+S,b:S,u:-5.50963677476
+S,b:S,ud:-8.30044093689
+S,b:S,ug:-10.0350419923
+S,b:S,uj:-3.73242301653
+S,b:S,ul:-7.99816006502
+S,b:S,uv:-8.13792200739
+S,b:S,uz:-8.42560407984
+S,b:S,v:-2.24241785143
+S,b:S,vg:-5.86579612188
+S,b:S,vn:-9.05421273926
+S,b:S,x:-6.82958918774
+S,b:S,y:-7.73245689928
+S,b:S,zg:-10.0350419923
+S,c:B,a:-3.74988876584
+S,c:B,ad:-5.75121218011
+S,c:B,an:-6.83918607057
+S,c:B,b:-4.51397528214
+S,c:B,c:-4.92573196281
+S,c:B,d:-3.86342707379
+S,c:B,df:-8.9454388697
+S,c:B,f:-4.9516355367
+S,c:B,h:-12.0809330856
+S,c:B,i:-5.97168550287
+S,c:B,j:-5.12557882785
+S,c:B,l:-4.9739171958
+S,c:B,m:-3.98754719657
+S,c:B,mq:-7.39188141566
+S,c:B,n:-1.32481370933
+S,c:B,nr:-3.34512658899
+S,c:B,nrfg:-8.22020337459
+S,c:B,nrt:-6.24466142793
+S,c:B,ns:-3.25284190871
+S,c:B,nt:-5.61829372039
+S,c:B,nz:-5.08470915866
+S,c:B,o:-10.6946387245
+S,c:B,p:-5.30471119661
+S,c:B,q:-7.16460847101
+S,c:B,r:-3.72121275304
+S,c:B,rr:-10.982320797
+S,c:B,rz:-9.30834436339
+S,c:B,s:-5.16372264788
+S,c:B,t:-4.30062999772
+S,c:B,u:-9.38969000285
+S,c:B,v:-1.8979878131
+S,c:B,vd:-8.06005567529
+S,c:B,vn:-3.38179340775
+S,c:B,vq:-12.7740802662
+S,c:B,y:-13.4672274468
+S,c:B,z:-7.10075699902
+S,c:S,a:-4.14624055469
+S,c:S,ad:-10.5768556889
+S,c:S,ag:-7.06531025002
+S,c:S,an:-10.0660300651
+S,c:S,b:-6.54065041353
+S,c:S,bg:-12.7740802662
+S,c:S,c:-5.97002022355
+S,c:S,d:-2.98155220771
+S,c:S,dg:-9.66056495698
+S,c:S,e:-12.7740802662
+S,c:S,f:-5.02088599631
+S,c:S,g:-6.60971338421
+S,c:S,h:-6.67825570376
+S,c:S,j:-5.47326989918
+S,c:S,k:-7.2892833327
+S,c:S,m:-4.23414758781
+S,c:S,mg:-10.422705009
+S,c:S,n:-3.77150234349
+S,c:S,ng:-5.15019397026
+S,c:S,nr:-5.53918184588
+S,c:S,nt:-13.4672274468
+S,c:S,o:-10.4714951732
+S,c:S,p:-3.09846618342
+S,c:S,q:-5.17768796213
+S,c:S,r:-3.44942954804
+S,c:S,rg:-11.069332174
+S,c:S,t:-13.4672274468
+S,c:S,tg:-7.45107028705
+S,c:S,u:-6.66483268343
+S,c:S,ud:-7.20573576243
+S,c:S,ug:-7.32519004116
+S,c:S,uj:-6.23956494802
+S,c:S,ul:-9.2187322047
+S,c:S,uv:-7.90654581574
+S,c:S,uz:-8.48362082504
+S,c:S,v:-2.53529974352
+S,c:S,vg:-5.49925426709
+S,c:S,vn:-9.38969000285
+S,c:S,x:-8.59203012355
+S,c:S,y:-9.55520444132
+S,d:B,a:-3.24746087327
+S,d:B,ad:-5.18036877293
+S,d:B,an:-7.23313152651
+S,d:B,b:-6.14156427676
+S,d:B,c:-5.8544715374
+S,d:B,d:-3.38446209711
+S,d:B,df:-7.41482925296
+S,d:B,e:-11.7502508344
+S,d:B,f:-6.9049395207
+S,d:B,h:-14.389308164
+S,d:B,i:-5.29696335025
+S,d:B,j:-7.6288934729
+S,d:B,l:-5.48277924639
+S,d:B,m:-4.44669605677
+S,d:B,mq:-8.90866924064
+S,d:B,n:-3.55833280148
+S,d:B,nr:-4.90020033695
+S,d:B,nrfg:-9.27732037563
+S,d:B,nrt:-7.26322089069
+S,d:B,ns:-6.28793349276
+S,d:B,nt:-9.30171182875
+S,d:B,nz:-7.56602204163
+S,d:B,o:-8.71255436172
+S,d:B,p:-6.00359133536
+S,d:B,q:-6.97172776157
+S,d:B,r:-4.80581928538
+S,d:B,rz:-11.5560948199
+S,d:B,s:-6.96038096918
+S,d:B,t:-5.80221584519
+S,d:B,u:-6.73533898351
+S,d:B,v:-1.55270071524
+S,d:B,vd:-7.7867202718
+S,d:B,vi:-11.2538139481
+S,d:B,vn:-5.25844399351
+S,d:B,vq:-9.37202832717
+S,d:B,y:-8.63991517808
+S,d:B,z:-6.51077396785
+S,dg:B,a:-3.08477618394
+S,dg:B,ad:-5.97514794183
+S,dg:B,an:-6.97367677194
+S,dg:B,b:-8.22643974044
+S,dg:B,c:-6.28052959138
+S,dg:B,d:-4.65690704396
+S,dg:B,f:-7.12782745177
+S,dg:B,i:-5.87506448328
+S,dg:B,j:-7.53329255988
+S,dg:B,l:-6.84014537932
+S,dg:B,m:-6.14699819876
+S,dg:B,n:-2.98734173355
+S,dg:B,nr:-4.18338847261
+S,dg:B,nrt:-5.74153309065
+S,dg:B,ns:-6.14699819876
+S,dg:B,nz:-7.12782745177
+S,dg:B,o:-8.919586921
+S,dg:B,p:-8.919586921
+S,dg:B,r:-5.58738241082
+S,dg:B,s:-7.53329255988
+S,dg:B,t:-5.92385464745
+S,dg:B,v:-3.07894526363
+S,dg:B,vn:-5.92385464745
+S,dg:B,z:-6.5216916482
+S,dg:S,a:-1.67750456174
+S,dg:S,ag:-3.90230708418
+S,dg:S,an:-8.919586921
+S,dg:S,b:-7.82097463233
+S,dg:S,c:-5.18191730272
+S,dg:S,d:-3.26010470524
+S,dg:S,dg:-6.61700182801
+S,dg:S,e:-8.919586921
+S,dg:S,f:-5.623750055
+S,dg:S,g:-4.70007921582
+S,dg:S,h:-7.53329255988
+S,dg:S,j:-4.23745569388
+S,dg:S,k:-8.22643974044
+S,dg:S,m:-2.89130840077
+S,dg:S,n:-3.3248755414
+S,dg:S,ng:-3.85699188797
+S,dg:S,nr:-4.02174712105
+S,dg:S,o:-8.919586921
+S,dg:S,p:-3.24626365383
+S,dg:S,q:-3.94285317858
+S,dg:S,r:-4.3448759425
+S,dg:S,tg:-7.12782745177
+S,dg:S,u:-3.01150398283
+S,dg:S,ud:-5.18191730272
+S,dg:S,ug:-8.22643974044
+S,dg:S,uj:-4.76070383764
+S,dg:S,ul:-5.87506448328
+S,dg:S,uv:-5.70071109613
+S,dg:S,uz:-7.31014900857
+S,dg:S,v:-1.61171414024
+S,dg:S,vg:-3.81972049318
+S,dg:S,x:-3.81972049318
+S,dg:S,y:-5.33606798254
+S,dg:S,yg:-8.919586921
+S,d:S,a:-2.84959472226
+S,d:S,ad:-10.7783902513
+S,d:S,ag:-6.71422630627
+S,d:S,b:-7.68244582738
+S,d:S,bg:-14.389308164
+S,d:S,c:-5.70677003998
+S,d:S,d:-2.67198984847
+S,d:S,dg:-7.65590627215
+S,d:S,e:-9.99485900931
+S,d:S,f:-5.23226308907
+S,d:S,g:-6.92766777178
+S,d:S,h:-8.58417319507
+S,d:S,j:-6.65474931963
+S,d:S,k:-8.43347079452
+S,d:S,m:-3.98993605155
+S,d:S,mg:-12.4433980149
+S,d:S,n:-4.25332096521
+S,d:S,ng:-5.50608393371
+S,d:S,nr:-6.59654644317
+S,d:S,o:-9.20752461369
+S,d:S,p:-2.53748483518
+S,d:S,q:-5.08647977257
+S,d:S,r:-4.81030499043
+S,d:S,rg:-12.086723071
+S,d:S,t:-11.3447857263
+S,d:S,tg:-6.87997289797
+S,d:S,u:-6.02363578021
+S,d:S,ud:-5.28244120049
+S,d:S,ug:-5.80109748533
+S,d:S,uj:-5.99225077381
+S,d:S,ul:-6.47871755173
+S,d:S,uv:-8.18273223726
+S,d:S,uz:-7.00718379825
+S,d:S,v:-1.13703293661
+S,d:S,vg:-4.91745003958
+S,d:S,vn:-10.7004287099
+S,d:S,x:-8.31166592064
+S,d:S,y:-8.2734160385
+S,d:S,yg:-12.7798702516
+S,e:B,a:-5.07593572003
+S,e:B,ad:-7.1800698743
+S,e:B,an:-8.78950778674
+S,e:B,b:-6.99774831751
+S,e:B,c:-4.45877444645
+S,e:B,d:-3.19852080623
+S,e:B,df:-7.1800698743
+S,e:B,e:-6.84359763768
+S,e:B,f:-6.08145758563
+S,e:B,i:-5.42221195675
+S,e:B,l:-4.54101254469
+S,e:B,m:-4.37066717894
+S,e:B,mq:-7.40321342562
+S,e:B,n:-2.64962323451
+S,e:B,nr:-3.23267972504
+S,e:B,nrfg:-6.71006624506
+S,e:B,nrt:-6.08145758563
+S,e:B,ns:-5.61145395639
+S,e:B,nz:-6.22455842928
+S,e:B,o:-6.5922832094
+S,e:B,p:-6.0169190645
+S,e:B,r:-2.86525198932
+S,e:B,rz:-7.69089549807
+S,e:B,s:-6.22455842928
+S,e:B,t:-4.13554743658
+S,e:B,u:-8.09636060618
+S,e:B,v:-2.88961043315
+S,e:B,vn:-6.15045045712
+S,e:B,y:-7.69089549807
+S,e:B,z:-6.39161251394
+S,e:S,a:-3.6190237917
+S,e:S,ad:-8.78950778674
+S,e:S,ag:-5.57063196187
+S,e:S,b:-6.84359763768
+S,e:S,c:-5.95629444268
+S,e:S,d:-2.96646189125
+S,e:S,e:-2.77091457224
+S,e:S,f:-6.22455842928
+S,e:S,g:-4.02733385194
+S,e:S,j:-4.87748478131
+S,e:S,k:-8.09636060618
+S,e:S,m:-4.81921587318
+S,e:S,n:-4.03591759563
+S,e:S,ng:-4.31217097226
+S,e:S,nr:-4.02733385194
+S,e:S,o:-7.1800698743
+S,e:S,p:-4.300871417
+S,e:S,q:-4.45877444645
+S,e:S,r:-1.65541406554
+S,e:S,tg:-6.48692269374
+S,e:S,u:-6.08145758563
+S,e:S,ud:-7.69089549807
+S,e:S,ug:-8.78950778674
+S,e:S,uj:-5.07593572003
+S,e:S,ul:-3.28824957619
+S,e:S,uv:-4.93936018503
+S,e:S,uz:-5.84506880757
+S,e:S,v:-2.45978688121
+S,e:S,vg:-4.81921587318
+S,e:S,vn:-8.78950778674
+S,e:S,x:-5.02830767104
+S,e:S,y:-3.21735375456
+S,f:B,a:-4.51893800504
+S,f:B,ad:-5.56856839337
+S,f:B,an:-8.63088627168
+S,f:B,b:-5.2951750367
+S,f:B,c:-4.82952011426
+S,f:B,d:-3.47041874232
+S,f:B,df:-9.39185604858
+S,f:B,e:-12.3362950277
+S,f:B,f:-5.59538173471
+S,f:B,i:-5.54357655875
+S,f:B,j:-5.5313110268
+S,f:B,l:-5.76447879422
+S,f:B,m:-3.29252098062
+S,f:B,mq:-5.55788942079
+S,f:B,n:-2.28333916918
+S,f:B,nr:-4.00655654524
+S,f:B,nrfg:-7.86656281265
+S,f:B,nrt:-6.5261525371
+S,f:B,ns:-4.00816607399
+S,f:B,nt:-6.47931470802
+S,f:B,nz:-5.85471789847
+S,f:B,o:-8.13658994987
+S,f:B,p:-5.52138629913
+S,f:B,q:-7.39465260514
+S,f:B,r:-4.09108555306
+S,f:B,rr:-13.4349073164
+S,f:B,rz:-9.5430870183
+S,f:B,s:-5.52468360932
+S,f:B,t:-4.94159706546
+S,f:B,u:-7.07533344774
+S,f:B,v:-1.87264897743
+S,f:B,vd:-8.59072022996
+S,f:B,vi:-12.3362950277
+S,f:B,vn:-4.58639801553
+S,f:B,vq:-10.4391750429
+S,f:B,y:-10.2994131005
+S,f:B,z:-6.2427252577
+S,f:S,a:-4.34166271631
+S,f:S,ad:-10.4904683372
+S,f:S,ag:-7.38517386118
+S,f:S,an:-11.825469404
+S,f:S,b:-6.24876301189
+S,f:S,c:-4.69441058648
+S,f:S,d:-2.61935796133
+S,f:S,dg:-8.89161253414
+S,f:S,e:-9.96917141362
+S,f:S,f:-4.2429346018
+S,f:S,g:-6.3373584658
+S,f:S,h:-9.24525257439
+S,f:S,j:-4.71444680369
+S,f:S,k:-7.59426565904
+S,f:S,m:-4.0177153899
+S,f:S,mg:-11.3554657747
+S,f:S,n:-3.20622516717
+S,f:S,ng:-4.36647619062
+S,f:S,nr:-5.35839198886
+S,f:S,o:-8.47908025881
+S,f:S,p:-3.13090019816
+S,f:S,q:-4.12020692911
+S,f:S,r:-3.77661722472
+S,f:S,rg:-10.9500006666
+S,f:S,tg:-6.72316692136
+S,f:S,u:-5.22641556467
+S,f:S,ud:-7.29934242533
+S,f:S,ug:-7.56278952694
+S,f:S,uj:-2.44268947507
+S,f:S,ul:-4.53326838411
+S,f:S,uv:-7.59426565904
+S,f:S,uz:-8.17221712751
+S,f:S,v:-1.92935899578
+S,f:S,vg:-5.14964618235
+S,f:S,vn:-8.98056002016
+S,f:S,x:-8.10703114763
+S,f:S,y:-7.29072168229
+S,f:S,yg:-13.4349073164
+S,g:B,a:-5.47626696413
+S,g:B,ad:-7.22211673206
+S,g:B,an:-8.9761358733
+S,g:B,b:-6.49122922351
+S,g:B,c:-5.60501594688
+S,g:B,d:-4.53610241935
+S,g:B,df:-10.4802132701
+S,g:B,f:-5.7934630971
+S,g:B,i:-6.60901225917
+S,g:B,j:-7.77216306898
+S,g:B,l:-7.24153481791
+S,g:B,m:-4.95078418257
+S,g:B,mq:-9.38160098141
+S,g:B,n:-2.92771354976
+S,g:B,nr:-3.59419248324
+S,g:B,nrfg:-7.99530662029
+S,g:B,nrt:-5.59741134749
+S,g:B,ns:-5.12362699541
+S,g:B,nt:-9.22745030158
+S,g:B,nz:-6.28301132242
+S,g:B,o:-9.38160098141
+S,g:B,p:-7.26133744521
+S,g:B,q:-7.99530662029
+S,g:B,r:-5.35327752029
+S,g:B,rz:-11.1733604506
+S,g:B,s:-5.7053003095
+S,g:B,t:-5.60884004332
+S,g:B,u:-7.64699992602
+S,g:B,v:-3.26020526471
+S,g:B,vn:-5.82625291992
+S,g:B,y:-10.4802132701
+S,g:B,z:-6.93925394604
+S,g:S,a:-3.55069649932
+S,g:S,ad:-7.50979880451
+S,g:S,ag:-4.37989431806
+S,g:S,b:-5.60120641846
+S,g:S,bg:-8.77546517784
+S,g:S,c:-4.35772046056
+S,g:S,d:-3.36381912599
+S,g:S,dg:-6.93925394604
+S,g:S,e:-6.56819026465
+S,g:S,f:-4.15944497583
+S,g:S,g:-2.45616951742
+S,g:S,h:-8.34014710658
+S,g:S,j:-3.83317361532
+S,g:S,k:-6.04939647124
+S,g:S,m:-4.53610241935
+S,g:S,mg:-7.56244253799
+S,g:S,n:-2.15684757564
+S,g:S,ng:-2.45551474574
+S,g:S,nr:-3.5575693786
+S,g:S,nt:-9.78706608952
+S,g:S,o:-6.0028764556
+S,g:S,p:-3.66841838224
+S,g:S,q:-3.51513292448
+S,g:S,r:-4.27363734335
+S,g:S,rg:-8.60841109318
+S,g:S,tg:-5.26799860258
+S,g:S,u:-4.42460090315
+S,g:S,ud:-7.64699992602
+S,g:S,ug:-7.80606462065
+S,g:S,uj:-4.07333328401
+S,g:S,ul:-6.2680856722
+S,g:S,uv:-5.81677417597
+S,g:S,uz:-6.88290100949
+S,g:S,v:-1.78629750027
+S,g:S,vg:-3.24892626575
+S,g:S,vn:-8.9761358733
+S,g:S,x:-3.42879064128
+S,g:S,y:-5.65993170447
+S,g:S,zg:-8.87077535764
+S,h:B,a:-4.29491955933
+S,h:B,ad:-2.95439361666
+S,h:B,an:-7.0570369817
+S,h:B,b:-3.95095665098
+S,h:B,c:-5.29344838944
+S,h:B,d:-3.9584473227
+S,h:B,f:-5.67074262058
+S,h:B,i:-4.33793694441
+S,h:B,j:-5.23787853828
+S,h:B,l:-4.87850453737
+S,h:B,m:-4.57213033191
+S,h:B,mq:-8.15564927037
+S,h:B,n:-0.85450146451
+S,h:B,nr:-3.63386069332
+S,h:B,nrfg:-6.45090117813
+S,h:B,nrt:-6.14074624982
+S,h:B,ns:-4.18535735681
+S,h:B,nt:-6.45090117813
+S,h:B,nz:-4.68991336757
+S,h:B,p:-8.15564927037
+S,h:B,q:-5.2112102912
+S,h:B,r:-4.13926624961
+S,h:B,rz:-8.84879645093
+S,h:B,s:-5.2112102912
+S,h:B,t:-4.72166206588
+S,h:B,u:-8.15564927037
+S,h:B,v:-4.07811182646
+S,h:B,vd:-7.0570369817
+S,h:B,vn:-3.26906662494
+S,h:B,z:-6.20973912131
+S,h:S,a:-5.2112102912
+S,h:S,ad:-8.84879645093
+S,h:S,ag:-6.07620772869
+S,h:S,b:-7.23935853849
+S,h:S,c:-4.95697615282
+S,h:S,d:-4.19483610077
+S,h:S,dg:-7.46250208981
+S,h:S,e:-8.84879645093
+S,h:S,f:-5.44759906926
+S,h:S,g:-5.44759906926
+S,h:S,h:-6.65157187359
+S,h:S,j:-3.76120011569
+S,h:S,k:-7.0570369817
+S,h:S,m:-4.55833700978
+S,h:S,n:-3.18931423517
+S,h:S,ng:-3.54549154287
+S,h:S,nr:-4.7544518887
+S,h:S,p:-4.11259800253
+S,h:S,q:-3.79894044368
+S,h:S,r:-3.49221017625
+S,h:S,rg:-6.76935490925
+S,h:S,tg:-6.76935490925
+S,h:S,u:-4.87850453737
+S,h:S,ud:-8.15564927037
+S,h:S,ug:-7.23935853849
+S,h:S,uj:-4.38288833227
+S,h:S,ul:-6.65157187359
+S,h:S,uv:-6.65157187359
+S,h:S,uz:-8.15564927037
+S,h:S,v:-4.24362626494
+S,h:S,vg:-4.77125900702
+S,h:S,x:-8.84879645093
+S,h:S,y:-6.90288630187
+S,j:B,a:-5.17247397926
+S,j:B,ad:-6.872837168
+S,j:B,an:-8.00960122264
+S,j:B,b:-5.89334570783
+S,j:B,c:-5.57306815713
+S,j:B,d:-4.60840384097
+S,j:B,df:-11.4107986043
+S,j:B,e:-10.7176514237
+S,j:B,f:-4.90875846468
+S,j:B,i:-6.8569217127
+S,j:B,j:-5.33545257321
+S,j:B,l:-6.57849284573
+S,j:B,m:-4.73308561832
+S,j:B,mq:-9.46488845524
+S,j:B,n:-1.94554473292
+S,j:B,nr:-3.30866641466
+S,j:B,nrfg:-7.9450627015
+S,j:B,nrt:-4.64864729918
+S,j:B,ns:-3.5537047394
+S,j:B,nt:-6.93346178982
+S,j:B,nz:-4.89238905155
+S,j:B,o:-8.39037371815
+S,j:B,p:-6.52799668171
+S,j:B,q:-8.31975615094
+S,j:B,r:-5.25064669167
+S,j:B,rz:-10.0245042432
+S,j:B,s:-5.09815676561
+S,j:B,t:-5.26768650758
+S,j:B,u:-7.58215720781
+S,j:B,v:-2.87497994876
+S,j:B,vd:-9.70605051206
+S,j:B,vn:-4.61509282913
+S,j:B,y:-11.0053334962
+S,j:B,z:-7.6380376662
+S,j:S,a:-3.09596642501
+S,j:S,ad:-7.99307192069
+S,j:S,ag:-5.8160872247
+S,j:S,an:-10.7176514237
+S,j:S,b:-5.41808483779
+S,j:S,bg:-11.4107986043
+S,j:S,c:-3.75801552288
+S,j:S,d:-3.38937823402
+S,j:S,dg:-7.91429104283
+S,j:S,e:-9.46488845524
+S,j:S,f:-3.65610267158
+S,j:S,g:-4.71006749475
+S,j:S,h:-6.77606961607
+S,j:S,j:-2.55108010455
+S,j:S,k:-6.51669712646
+S,j:S,m:-4.04025315059
+S,j:S,mg:-9.90672120752
+S,j:S,n:-2.17347556099
+S,j:S,ng:-3.27750474308
+S,j:S,nr:-4.03773821685
+S,j:S,nz:-12.1039457849
+S,j:S,o:-7.55006889326
+S,j:S,p:-3.53510936029
+S,j:S,q:-3.52246410356
+S,j:S,r:-4.57884503873
+S,j:S,rg:-8.63820988206
+S,j:S,tg:-5.92186087814
+S,j:S,u:-4.29278239983
+S,j:S,ud:-6.6746001559
+S,j:S,ug:-8.84584924684
+S,j:S,uj:-3.91220576358
+S,j:S,ul:-7.30815523926
+S,j:S,uv:-5.61019194501
+S,j:S,uz:-7.99307192069
+S,j:S,v:-2.29548345273
+S,j:S,vg:-4.72743765853
+S,j:S,vn:-10.3121863156
+S,j:S,x:-5.33430380801
+S,j:S,y:-6.71945072207
+S,j:S,yg:-9.80136069186
+S,k:B,a:-4.43007247428
+S,k:B,ad:-5.73275269536
+S,k:B,an:-8.13064796816
+S,k:B,b:-4.66859531078
+S,k:B,c:-4.51023631332
+S,k:B,d:-3.05107209153
+S,k:B,df:-7.56266393055
+S,k:B,f:-5.34709021455
+S,k:B,h:-10.9638613122
+S,k:B,i:-4.80476592372
+S,k:B,j:-6.34874079538
+S,k:B,l:-5.10023013662
+S,k:B,m:-4.01304654377
+S,k:B,mq:-8.56596603942
+S,k:B,n:-1.66167128661
+S,k:B,nr:-4.86578703005
+S,k:B,nrfg:-8.25581111111
+S,k:B,nrt:-7.07204101411
+S,k:B,ns:-5.77647550638
+S,k:B,nt:-7.30029966609
+S,k:B,nz:-5.83989733281
+S,k:B,o:-8.39891195476
+S,k:B,p:-5.59322328409
+S,k:B,q:-6.63312797193
+S,k:B,r:-4.17827366721
+S,k:B,s:-4.96244643426
+S,k:B,t:-5.12321965484
+S,k:B,u:-6.18473781911
+S,k:B,v:-2.01009201767
+S,k:B,vd:-9.5775669511
+S,k:B,vn:-4.71969441155
+S,k:B,vq:-10.9638613122
+S,k:B,y:-9.86524902355
+S,k:B,z:-6.43126181906
+S,k:S,a:-4.41851165188
+S,k:S,ad:-9.01795116316
+S,k:S,ag:-7.11371371051
+S,k:S,b:-6.74435360704
+S,k:S,c:-3.62237745985
+S,k:S,d:-2.33960904851
+S,k:S,dg:-6.72975480762
+S,k:S,e:-10.2707141317
+S,k:S,f:-4.67600275206
+S,k:S,g:-6.72975480762
+S,k:S,h:-8.47895466243
+S,k:S,j:-6.28173008509
+S,k:S,k:-5.68065758348
+S,k:S,m:-4.05111849172
+S,k:S,mg:-10.9638613122
+S,k:S,n:-3.96443884471
+S,k:S,ng:-4.85239397271
+S,k:S,nr:-6.50951401596
+S,k:S,o:-8.88441977054
+S,k:S,p:-2.89201816261
+S,k:S,q:-4.90707729899
+S,k:S,r:-4.3451223287
+S,k:S,tg:-7.03203567949
+S,k:S,u:-5.1587263433
+S,k:S,ud:-7.38034237376
+S,k:S,ug:-7.59656548223
+S,k:S,uj:-2.5749561411
+S,k:S,ul:-7.30029966609
+S,k:S,uv:-8.07348955432
+S,k:S,uz:-8.66127621922
+S,k:S,v:-2.08188612797
+S,k:S,vg:-5.55221526036
+S,k:S,vn:-10.2707141317
+S,k:S,x:-7.87281885886
+S,k:S,y:-6.50951401596
+S,m:B,a:-4.68146757907
+S,m:B,ad:-6.24878673589
+S,m:B,an:-8.34941116733
+S,m:B,b:-5.11322742876
+S,m:B,c:-5.25460883989
+S,m:B,d:-4.75338634681
+S,m:B,df:-10.6034692194
+S,m:B,e:-12.4492959099
+S,m:B,f:-4.30123589738
+S,m:B,h:-12.854761018
+S,m:B,i:-7.05415435875
+S,m:B,j:-5.18084046576
+S,m:B,l:-6.37165366658
+S,m:B,ln:-13.5479081986
+S,m:B,m:-4.31404663158
+S,m:B,mq:-6.71379945979
+S,m:B,n:-1.69216637784
+S,m:B,nr:-4.03605681624
+S,m:B,nrfg:-8.4239442192
+S,m:B,nrt:-6.33340378445
+S,m:B,ns:-3.82792289961
+S,m:B,nt:-5.44350689068
+S,m:B,nz:-5.29026324039
+S,m:B,o:-10.7753194764
+S,m:B,p:-6.04959232783
+S,m:B,q:-5.52271887671
+S,m:B,qe:-13.5479081986
+S,m:B,r:-4.77995628884
+S,m:B,rz:-10.908850869
+S,m:B,s:-5.97078626772
+S,m:B,t:-4.27713145782
+S,m:B,u:-7.65350536434
+S,m:B,v:-2.30423567061
+S,m:B,vd:-9.50485693077
+S,m:B,vn:-4.72573343765
+S,m:B,y:-10.908850869
+S,m:B,z:-7.76101081723
+S,mg:B,a:-5.26914598925
+S,mg:B,b:-6.65544035037
+S,mg:B,c:-5.04600243793
+S,mg:B,d:-4.70953020131
+S,mg:B,i:-6.65544035037
+S,mg:B,l:-5.26914598925
+S,mg:B,m:-5.5568280617
+S,mg:B,n:-2.68514843682
+S,mg:B,nr:-4.01638302075
+S,mg:B,nrt:-5.5568280617
+S,mg:B,ns:-4.45821577303
+S,mg:B,nt:-6.65544035037
+S,mg:B,nz:-4.45821577303
+S,mg:B,o:-6.65544035037
+S,mg:B,p:-5.96229316981
+S,mg:B,r:-5.96229316981
+S,mg:B,s:-5.96229316981
+S,mg:B,t:-5.5568280617
+S,mg:B,v:-3.18970444757
+S,mg:S,a:-4.35285525737
+S,mg:S,ag:-4.70953020131
+S,mg:S,b:-5.96229316981
+S,mg:S,c:-5.5568280617
+S,mg:S,d:-3.76506859247
+S,mg:S,dg:-6.65544035037
+S,mg:S,f:-3.76506859247
+S,mg:S,g:-2.91777073208
+S,mg:S,j:-4.17053370058
+S,mg:S,k:-4.86368088114
+S,mg:S,m:-3.47738652002
+S,mg:S,mg:-5.04600243793
+S,mg:S,n:-1.96409246814
+S,mg:S,ng:-1.98261151591
+S,mg:S,nr:-3.18970444757
+S,mg:S,p:-3.47738652002
+S,mg:S,q:-3.32323584019
+S,mg:S,r:-3.12907982575
+S,mg:S,rg:-5.5568280617
+S,mg:S,tg:-4.35285525737
+S,mg:S,u:-3.35960348436
+S,mg:S,ud:-6.65544035037
+S,mg:S,uj:-5.5568280617
+S,mg:S,uv:-5.26914598925
+S,mg:S,v:-2.57790290646
+S,mg:S,vg:-3.94739014927
+S,mg:S,x:-3.82222700631
+S,m:S,a:-3.64417067731
+S,m:S,ad:-11.1500129258
+S,m:S,ag:-7.29600431543
+S,m:S,an:-13.5479081986
+S,m:S,b:-6.34673731532
+S,m:S,bg:-13.5479081986
+S,m:S,c:-4.53662870742
+S,m:S,d:-3.69350585375
+S,m:S,dg:-9.88434655247
+S,m:S,e:-10.4124139827
+S,m:S,f:-4.30577850413
+S,m:S,g:-6.65729907845
+S,m:S,h:-8.63525331286
+S,m:S,j:-5.06138042149
+S,m:S,k:-6.69249939999
+S,m:S,m:-2.07154298894
+S,m:S,mg:-10.7753194764
+S,m:S,n:-2.51324436652
+S,m:S,ng:-3.78632989225
+S,m:S,nr:-5.66408498371
+S,m:S,nt:-13.5479081986
+S,m:S,o:-10.7146948545
+S,m:S,p:-3.20182033129
+S,m:S,q:-4.09188031087
+S,m:S,r:-4.73640494844
+S,m:S,rg:-9.76371856468
+S,m:S,tg:-5.92916582093
+S,m:S,u:-6.09841019322
+S,m:S,ud:-7.77025587538
+S,m:S,ug:-7.85754874428
+S,m:S,uj:-3.41192099983
+S,m:S,ul:-5.48075915869
+S,m:S,uv:-6.32315479283
+S,m:S,uz:-10.1467108169
+S,m:S,v:-2.13273890243
+S,m:S,vg:-5.23063043238
+S,m:S,vn:-10.1139209941
+S,m:S,x:-7.96817837261
+S,m:S,y:-6.60093220646
+S,n:B,a:-4.68634040376
+S,n:B,ad:-6.37612317601
+S,n:B,an:-8.58096598424
+S,n:B,b:-5.65177153003
+S,n:B,c:-4.49420747844
+S,n:B,d:-3.69856286524
+S,n:B,df:-9.42691522675
+S,n:B,e:-11.1459153417
+S,n:B,f:-4.76561440858
+S,n:B,h:-14.0903543209
+S,n:B,i:-5.7411065203
+S,n:B,in:-14.0903543209
+S,n:B,j:-5.96917107879
+S,n:B,l:-5.91340045264
+S,n:B,m:-4.2331725212
+S,n:B,mq:-8.45556471769
+S,n:B,n:-2.13954173453
+S,n:B,nr:-3.83836009406
+S,n:B,nrfg:-7.92493646663
+S,n:B,nrt:-6.19827589962
+S,n:B,ns:-4.48973016278
+S,n:B,nt:-7.39455540381
+S,n:B,nz:-5.80383294718
+S,n:B,o:-8.4308721051
+S,n:B,p:-6.17976370861
+S,n:B,q:-7.63988389872
+S,n:B,r:-4.29925189892
+S,n:B,rz:-10.4794364082
+S,n:B,s:-5.14828562782
+S,n:B,t:-4.80212741023
+S,n:B,u:-6.12968171248
+S,n:B,v:-2.349035111
+S,n:B,vd:-9.1275096906
+S,n:B,vi:-13.3972071403
+S,n:B,vn:-4.82922578206
+S,n:B,vq:-11.2571409768
+S,n:B,y:-8.79704949614
+S,n:B,z:-6.37300304868
+S,ng:B,a:-4.69787160669
+S,ng:B,ad:-6.3043640089
+S,ng:B,an:-8.94568634515
+S,ng:B,b:-5.64281957321
+S,ng:B,c:-4.70128108835
+S,ng:B,d:-3.77754998098
+S,ng:B,df:-9.09983702497
+S,ng:B,e:-11.2970616023
+S,ng:B,f:-4.78854088168
+S,ng:B,i:-5.83889553482
+S,ng:B,j:-6.20433441949
+S,ng:B,l:-6.11621482024
+S,ng:B,m:-4.32195924987
+S,ng:B,mq:-8.4444301724
+S,ng:B,n:-2.11410955643
+S,ng:B,nr:-3.55973610166
+S,ng:B,nrfg:-7.79050370499
+S,ng:B,nrt:-5.90192005113
+S,ng:B,ns:-4.44870253328
+S,ng:B,nt:-7.30499588921
+S,ng:B,nz:-5.63990496899
+S,ng:B,o:-8.8261411945
+S,ng:B,p:-6.20740976789
+S,ng:B,q:-7.79050370499
+S,ng:B,r:-4.43954753976
+S,ng:B,rr:-13.0888210715
+S,ng:B,rz:-9.42525942541
+S,ng:B,s:-5.46566800306
+S,ng:B,t:-4.88633862496
+S,ng:B,u:-6.75022699333
+S,ng:B,v:-2.36636899776
+S,ng:B,vd:-10.3162323493
+S,ng:B,vn:-4.99535879704
+S,ng:B,vq:-11.7025267104
+S,ng:B,y:-8.92993798818
+S,ng:B,z:-6.51235150249
+S,ng:S,a:-3.74929624118
+S,ng:S,ad:-9.09983702497
+S,ng:S,ag:-5.77028152297
+S,ng:S,an:-11.4793831591
+S,ng:S,b:-6.07490559673
+S,ng:S,bg:-12.395673891
+S,ng:S,c:-3.8173856002
+S,ng:S,d:-2.83823932422
+S,ng:S,dg:-7.67717501968
+S,ng:S,e:-8.55622157838
+S,ng:S,f:-3.37504229423
+S,ng:S,g:-4.51524754668
+S,ng:S,h:-9.01128362763
+S,ng:S,j:-4.62502865685
+S,ng:S,k:-5.85392265122
+S,ng:S,m:-4.08501298507
+S,ng:S,mg:-9.95332685561
+S,ng:S,n:-2.65261920998
+S,ng:S,ng:-2.98292342807
+S,ng:S,nr:-4.49078549228
+S,ng:S,nt:-12.395673891
+S,ng:S,o:-8.25253916459
+S,ng:S,p:-3.05408598239
+S,ng:S,q:-3.71968368781
+S,ng:S,r:-3.73498659992
+S,ng:S,rg:-10.0442986338
+S,ng:S,t:-13.0888210715
+S,ng:S,tg:-6.05973350739
+S,ng:S,u:-4.316830635
+S,ng:S,ud:-7.28067858156
+S,ng:S,ug:-7.16992721726
+S,ng:S,uj:-3.26162078717
+S,ng:S,ul:-6.3111744779
+S,ng:S,uv:-6.43081002567
+S,ng:S,uz:-7.46480356535
+S,ng:S,v:-1.99611908565
+S,ng:S,vg:-4.40104157955
+S,ng:S,vn:-9.11852915798
+S,ng:S,x:-5.68758980712
+S,ng:S,y:-6.05531458725
+S,ng:S,yg:-11.4793831591
+S,ng:S,zg:-11.7025267104
+S,nr:B,a:-5.22450520863
+S,nr:B,ad:-6.94812687269
+S,nr:B,an:-9.86889610777
+S,nr:B,b:-6.2024895095
+S,nr:B,c:-5.3740369426
+S,nr:B,d:-4.23887978335
+S,nr:B,df:-10.2743612159
+S,nr:B,e:-11.3729735045
+S,nr:B,f:-5.41713613508
+S,nr:B,i:-6.19400289563
+S,nr:B,j:-6.28846836188
+S,nr:B,l:-6.8034304962
+S,nr:B,m:-4.44247873859
+S,nr:B,mq:-9.02159824738
+S,nr:B,n:-1.74323224672
+S,nr:B,nr:-3.27038707915
+S,nr:B,nrfg:-7.80344080806
+S,nr:B,nrt:-4.95869521099
+S,nr:B,ns:-4.310353515
+S,nr:B,nt:-8.30492056941
+S,nr:B,nz:-5.67755927956
+S,nr:B,o:-9.50117132764
+S,nr:B,p:-6.89563669006
+S,nr:B,q:-8.37724123099
+S,nr:B,r:-5.03349642407
+S,nr:B,rr:-12.0661206851
+S,nr:B,rz:-9.98667914342
+S,nr:B,s:-5.43940293585
+S,nr:B,t:-4.79789766394
+S,nr:B,u:-6.98471632012
+S,nr:B,v:-2.73728641908
+S,nr:B,vd:-10.679826324
+S,nr:B,vn:-5.62997031673
+S,nr:B,y:-10.4566827727
+S,nr:B,z:-7.1102936275
+S,nr:S,a:-3.47419114757
+S,nr:S,ad:-9.358070484
+S,nr:S,ag:-5.86764196861
+S,nr:S,an:-12.0661206851
+S,nr:S,b:-5.18163403306
+S,nr:S,bg:-10.9675083964
+S,nr:S,c:-4.13304091322
+S,nr:S,d:-3.27737480316
+S,nr:S,dg:-8.66492330344
+S,nr:S,e:-8.56961312364
+S,nr:S,f:-4.13196545157
+S,nr:S,g:-4.12767513394
+S,nr:S,h:-8.45520277246
+S,nr:S,j:-4.00842649029
+S,nr:S,k:-6.44571981939
+S,nr:S,m:-4.30736014095
+S,nr:S,mg:-8.7702838191
+S,nr:S,n:-2.50357534466
+S,nr:S,ng:-3.14053334607
+S,nr:S,nr:-3.35599575778
+S,nr:S,nt:-11.3729735045
+S,nr:S,o:-8.19491967419
+S,nr:S,p:-3.0260942508
+S,nr:S,q:-3.84976235272
+S,nr:S,r:-4.06812136712
+S,nr:S,rg:-9.29353196286
+S,nr:S,t:-10.679826324
+S,nr:S,tg:-5.38903722386
+S,nr:S,u:-4.04914293834
+S,nr:S,ud:-6.77785365441
+S,nr:S,ug:-5.33390997864
+S,nr:S,uj:-3.56160754684
+S,nr:S,ul:-6.61508223154
+S,nr:S,uv:-6.62370297458
+S,nr:S,uz:-8.17430038699
+S,nr:S,v:-2.0323507623
+S,nr:S,vg:-3.92755594784
+S,nr:S,vn:-10.9675083964
+S,nr:S,x:-5.30802618067
+S,nr:S,y:-6.57718295895
+S,nr:S,yg:-11.3729735045
+S,nr:S,zg:-12.0661206851
+S,n:S,a:-3.86192503895
+S,n:S,ad:-10.1391106023
+S,n:S,ag:-6.61842224262
+S,n:S,an:-9.60171795113
+S,n:S,b:-5.90584056783
+S,n:S,bg:-13.3972071403
+S,n:S,c:-3.70219006706
+S,n:S,d:-2.71554215802
+S,n:S,dg:-7.95478942978
+S,n:S,e:-8.6436169492
+S,n:S,f:-3.30330586108
+S,n:S,g:-5.40663025856
+S,n:S,h:-8.88086816802
+S,n:S,j:-4.87413128573
+S,n:S,k:-6.11616565158
+S,n:S,m:-4.06398563895
+S,n:S,mg:-9.9314712375
+S,n:S,n:-2.56000159657
+S,n:S,ng:-3.38708738105
+S,n:S,nr:-4.65232076288
+S,n:S,nt:-12.9917420322
+S,n:S,o:-8.33461210728
+S,n:S,p:-3.14311553445
+S,n:S,q:-3.95104393986
+S,n:S,r:-3.70570685252
+S,n:S,rg:-10.9993118675
+S,n:S,tg:-6.09000482554
+S,n:S,u:-4.40334508177
+S,n:S,ud:-6.88471914445
+S,n:S,ug:-7.51110310885
+S,n:S,uj:-2.91079193097
+S,n:S,ul:-5.33951294549
+S,n:S,uv:-6.67157343811
+S,n:S,uz:-7.50005327267
+S,n:S,v:-1.97131123431
+S,n:S,vg:-4.84619240041
+S,n:S,vn:-8.83285894884
+S,n:S,x:-6.67457734545
+S,n:S,y:-5.38618376112
+S,n:S,zg:-13.3972071403
+S,nt:B,ns:-1.79175946923
+S,nt:B,vn:-3.93182563272
+S,nt:S,a:-3.93182563272
+S,nt:S,b:-3.93182563272
+S,nt:S,d:-4.62497281328
+S,nt:S,f:-4.62497281328
+S,nt:S,g:-3.23867845216
+S,nt:S,j:-0.497838428239
+S,nt:S,k:-4.62497281328
+S,nt:S,ng:-4.62497281328
+S,nt:S,p:-4.62497281328
+S,nt:S,q:-3.52636052462
+S,nt:S,v:-4.62497281328
+S,nt:S,vg:-4.62497281328
+S,nt:S,x:-3.52636052462
+S,nz:B,nz:0.0
+S,o:B,a:-6.40390526895
+S,o:B,ad:-8.01334318139
+S,o:B,b:-7.60787807328
+S,o:B,c:-5.33919453196
+S,o:B,d:-5.48761453708
+S,o:B,e:-8.70649036195
+S,o:B,f:-7.09705244951
+S,o:B,i:-7.09705244951
+S,o:B,j:-8.01334318139
+S,o:B,l:-6.76058021289
+S,o:B,m:-3.41822333125
+S,o:B,mq:-8.70649036195
+S,o:B,n:-3.46474334689
+S,o:B,nr:-4.96882074366
+S,o:B,nrt:-7.09705244951
+S,o:B,ns:-5.71075808839
+S,o:B,nz:-8.70649036195
+S,o:B,o:-4.33704250948
+S,o:B,p:-7.60787807328
+S,o:B,r:-5.76205138278
+S,o:B,s:-6.91473089272
+S,o:B,t:-6.50926578461
+S,o:B,v:-3.34990408727
+S,o:B,vn:-8.01334318139
+S,o:B,z:-7.32019600083
+S,o:S,a:-4.51683561992
+S,o:S,ad:-8.70649036195
+S,o:S,ag:-5.41065349594
+S,o:S,b:-7.32019600083
+S,o:S,c:-6.06743303233
+S,o:S,d:-4.10132017596
+S,o:S,e:-6.62704882027
+S,o:S,f:-5.41065349594
+S,o:S,g:-3.66953775953
+S,o:S,j:-4.62895291804
+S,o:S,k:-8.70649036195
+S,o:S,m:-4.89982787218
+S,o:S,n:-3.52470681165
+S,o:S,ng:-3.12299405316
+S,o:S,nr:-4.48698265677
+S,o:S,o:-1.31384284122
+S,o:S,p:-4.99291829524
+S,o:S,q:-3.94431642715
+S,o:S,r:-4.00600999615
+S,o:S,rg:-7.32019600083
+S,o:S,tg:-6.76058021289
+S,o:S,u:-6.40390526895
+S,o:S,ud:-7.60787807328
+S,o:S,ug:-8.01334318139
+S,o:S,uj:-2.35386096563
+S,o:S,ul:-5.12297142349
+S,o:S,uv:-2.21122480601
+S,o:S,uz:-5.71075808839
+S,o:S,v:-2.26713999085
+S,o:S,vg:-4.26383910546
+S,o:S,x:-4.1847017849
+S,o:S,y:-3.82368843936
+S,p:B,a:-4.05760152464
+S,p:B,ad:-6.28205247489
+S,p:B,an:-7.57571061001
+S,p:B,b:-4.49221055179
+S,p:B,c:-6.71519597042
+S,p:B,d:-4.51627689433
+S,p:B,df:-12.9451851709
+S,p:B,e:-13.6383323514
+S,p:B,f:-4.43270305919
+S,p:B,h:-13.2328672433
+S,p:B,i:-5.95423830101
+S,p:B,j:-5.07884624783
+S,p:B,jn:-14.331479532
+S,p:B,l:-5.36614495819
+S,p:B,m:-3.37680328914
+S,p:B,mq:-6.22195387225
+S,p:B,n:-1.38064496319
+S,p:B,nr:-3.1055030749
+S,p:B,nrfg:-7.28657441487
+S,p:B,nrt:-5.91565483497
+S,p:B,ns:-2.67207560065
+S,p:B,nt:-5.25158958941
+S,p:B,nz:-5.0021124536
+S,p:B,o:-9.78818474973
+S,p:B,p:-7.06116664592
+S,p:B,q:-6.44427094618
+S,p:B,r:-3.08788554627
+S,p:B,rr:-10.9302821503
+S,p:B,rz:-8.62436926725
+S,p:B,s:-3.78800826202
+S,p:B,t:-3.54383195434
+S,p:B,u:-9.23161310417
+S,p:B,v:-2.43980945962
+S,p:B,vd:-8.60463178441
+S,p:B,vi:-13.6383323514
+S,p:B,vn:-4.05718733162
+S,p:B,vq:-14.331479532
+S,p:B,y:-11.8465728822
+S,p:B,z:-6.72310505762
+S,p:S,a:-4.13078045679
+S,p:S,ad:-11.1534257017
+S,p:S,ag:-7.42472475335
+S,p:S,an:-11.3357472584
+S,p:S,b:-6.23588083062
+S,p:S,c:-5.60548515098
+S,p:S,d:-4.56650719932
+S,p:S,dg:-9.32753322605
+S,p:S,e:-11.1126037071
+S,p:S,f:-4.08305566443
+S,p:S,g:-6.48763089385
+S,p:S,h:-8.30320101177
+S,p:S,j:-4.95545524438
+S,p:S,k:-7.7248293458
+S,p:S,m:-3.2157385543
+S,p:S,mg:-10.3611876184
+S,p:S,n:-3.35594614126
+S,p:S,ng:-4.57805934073
+S,p:S,nr:-5.16362921164
+S,p:S,nt:-11.1959853161
+S,p:S,o:-10.0274144388
+S,p:S,p:-4.25985386718
+S,p:S,q:-4.43426159248
+S,p:S,r:-2.67866169838
+S,p:S,rg:-11.1126037071
+S,p:S,t:-12.7220416196
+S,p:S,tg:-6.01493481407
+S,p:S,u:-5.97963279317
+S,p:S,ud:-7.66198144214
+S,p:S,ug:-7.32659754229
+S,p:S,uj:-5.45647204595
+S,p:S,ul:-5.26882743292
+S,p:S,uv:-6.6176949154
+S,p:S,uz:-6.57400076541
+S,p:S,v:-3.16988616656
+S,p:S,vg:-5.69277692318
+S,p:S,vn:-9.5031657947
+S,p:S,x:-8.44537550055
+S,p:S,y:-7.88575971261
+S,p:S,yg:-14.331479532
+S,p:S,zg:-14.331479532
+S,q:B,a:-4.03044853864
+S,q:B,ad:-6.52241752556
+S,q:B,an:-7.86706718541
+S,q:B,b:-5.26554777511
+S,q:B,c:-4.87449780326
+S,q:B,d:-4.01167022781
+S,q:B,df:-9.24289024666
+S,q:B,e:-10.0695688198
+S,q:B,f:-4.54146335926
+S,q:B,i:-5.30576820718
+S,q:B,j:-5.95091886672
+S,q:B,l:-5.70495481365
+S,q:B,m:-4.12053967127
+S,q:B,mq:-7.841091699
+S,q:B,n:-1.62521261376
+S,q:B,nr:-3.96818274575
+S,q:B,nrfg:-7.94360726253
+S,q:B,nrt:-6.1855534394
+S,q:B,ns:-4.3402423723
+S,q:B,nt:-7.09306790822
+S,q:B,nz:-5.6593713082
+S,q:B,o:-9.14379934401
+S,q:B,p:-6.36533171008
+S,q:B,q:-7.38399147459
+S,q:B,r:-4.08132373536
+S,q:B,rr:-12.420944077
+S,q:B,rz:-9.3074287678
+S,q:B,s:-5.6501546531
+S,q:B,t:-4.70604351341
+S,q:B,u:-7.29400832721
+S,q:B,v:-2.45961223479
+S,q:B,vd:-8.68327445872
+S,q:B,vn:-4.66282421627
+S,q:B,vq:-11.3223317883
+S,q:B,y:-8.61428158724
+S,q:B,z:-6.31615084459
+S,qg:S,q:0.0
+S,q:S,a:-3.4753508062
+S,q:S,ad:-9.74679542758
+S,q:S,ag:-6.65106180065
+S,q:S,an:-10.6291846078
+S,q:S,b:-5.93783672555
+S,q:S,c:-4.03842578892
+S,q:S,d:-3.16086161314
+S,q:S,dg:-8.27780935062
+S,q:S,e:-7.83088752883
+S,q:S,f:-3.6236978403
+S,q:S,g:-5.46535146861
+S,q:S,h:-8.98695687252
+S,q:S,j:-4.88032254835
+S,q:S,k:-5.88063583895
+S,q:S,m:-3.79033291856
+S,q:S,mg:-10.0695688198
+S,q:S,n:-2.61253673072
+S,q:S,ng:-3.62961008371
+S,q:S,nr:-5.03354429174
+S,q:S,o:-8.73206462289
+S,q:S,p:-3.264479278
+S,q:S,q:-3.74035733868
+S,q:S,r:-3.46285428565
+S,q:S,rg:-10.9168666802
+S,q:S,t:-13.1140912576
+S,q:S,tg:-6.23885917029
+S,q:S,u:-4.99231383841
+S,q:S,ud:-7.2196884233
+S,q:S,ug:-7.45809944675
+S,q:S,uj:-3.23628055182
+S,q:S,ul:-5.2171666013
+S,q:S,uv:-6.23885917029
+S,q:S,uz:-6.59789818152
+S,q:S,v:-2.23589313303
+S,q:S,vg:-4.95100488198
+S,q:S,vn:-9.22227095946
+S,q:S,x:-6.75278877999
+S,q:S,y:-4.34567253071
+S,q:S,yg:-12.420944077
+S,r:B,a:-4.52493307698
+S,r:B,ad:-5.67987590637
+S,r:B,an:-8.30432653863
+S,r:B,b:-5.73303527465
+S,r:B,c:-4.91561276906
+S,r:B,d:-3.13773767961
+S,r:B,df:-7.4247933905
+S,r:B,e:-11.1797726463
+S,r:B,f:-5.10857313119
+S,r:B,h:-13.8878228474
+S,r:B,i:-5.25213576195
+S,r:B,in:-13.1946756669
+S,r:B,j:-6.923687235
+S,r:B,l:-5.58953221306
+S,r:B,m:-2.99143543564
+S,r:B,mq:-7.82403763873
+S,r:B,n:-2.26779338753
+S,r:B,nr:-4.62091312395
+S,r:B,nrfg:-8.37036995095
+S,r:B,nrt:-7.05694861277
+S,r:B,ns:-6.22723738571
+S,r:B,nt:-8.95334891429
+S,r:B,nz:-7.17851850716
+S,r:B,o:-8.65671423056
+S,r:B,p:-6.27104703872
+S,r:B,q:-6.13162750347
+S,r:B,r:-3.66843026348
+S,r:B,rr:-13.1946756669
+S,r:B,rz:-9.14289071905
+S,r:B,s:-4.76576739031
+S,r:B,t:-4.5216760243
+S,r:B,u:-6.71847283075
+S,r:B,v:-2.12108496563
+S,r:B,vd:-10.304303909
+S,r:B,vi:-12.0960633782
+S,r:B,vn:-5.17391221892
+S,r:B,vq:-9.86247115668
+S,r:B,y:-9.71343557752
+S,r:B,z:-6.1096113729
+S,rg:B,a:-4.98360662171
+S,rg:B,b:-4.98360662171
+S,rg:B,c:-4.64713438509
+S,rg:B,d:-4.39581995681
+S,rg:B,f:-5.89989735358
+S,rg:B,j:-6.59304453414
+S,rg:B,l:-5.89989735358
+S,rg:B,m:-4.51360299246
+S,rg:B,n:-2.4659101491
+S,rg:B,nr:-2.72184352323
+S,rg:B,nrfg:-6.59304453414
+S,rg:B,nrt:-2.66121890142
+S,rg:B,ns:-4.39581995681
+S,rg:B,nt:-5.89989735358
+S,rg:B,nz:-3.41499070379
+S,rg:B,p:-6.59304453414
+S,rg:B,q:-4.98360662171
+S,rg:B,s:-5.89989735358
+S,rg:B,t:-5.49443224547
+S,rg:B,u:-5.89989735358
+S,rg:B,v:-2.62275262059
+S,rg:B,vn:-4.98360662171
+S,rg:S,a:-3.45755031821
+S,rg:S,ag:-4.98360662171
+S,rg:S,b:-4.39581995681
+S,rg:S,c:-4.29045944115
+S,rg:S,d:-4.02809517668
+S,rg:S,f:-3.70267277625
+S,rg:S,g:-3.45755031821
+S,rg:S,j:-3.8204558119
+S,rg:S,k:-4.80128506491
+S,rg:S,m:-3.88499433304
+S,rg:S,n:-3.37416870927
+S,rg:S,ng:-2.01833355564
+S,rg:S,nr:-4.64713438509
+S,rg:S,p:-3.64860555498
+S,rg:S,q:-3.50200208078
+S,rg:S,r:-4.64713438509
+S,rg:S,tg:-5.89989735358
+S,rg:S,u:-4.29045944115
+S,rg:S,ud:-6.59304453414
+S,rg:S,uj:-3.59731226059
+S,rg:S,uv:-6.59304453414
+S,rg:S,v:-2.76440313765
+S,rg:S,vg:-3.59731226059
+S,rg:S,vn:-6.59304453414
+S,rg:S,x:-5.20675017302
+S,rg:S,y:-5.49443224547
+S,r:S,a:-4.5334687153
+S,r:S,ad:-11.2487655178
+S,r:S,ag:-7.77857526465
+S,r:S,an:-11.4029161976
+S,r:S,b:-6.15151575087
+S,r:S,c:-4.49050510711
+S,r:S,d:-2.25039033703
+S,r:S,dg:-9.53111402073
+S,r:S,e:-8.80022651218
+S,r:S,f:-5.34593704341
+S,r:S,g:-7.11818087056
+S,r:S,h:-9.20569162029
+S,r:S,j:-6.39952933226
+S,r:S,k:-6.22676646505
+S,r:S,m:-3.6704373803
+S,r:S,mg:-11.9419126984
+S,r:S,n:-3.58472060045
+S,r:S,ng:-4.85744681266
+S,r:S,nr:-6.35039281083
+S,r:S,nt:-13.1946756669
+S,r:S,o:-8.99747371919
+S,r:S,p:-2.98915944816
+S,r:S,q:-3.44681905586
+S,r:S,r:-3.75580627129
+S,r:S,rg:-13.1946756669
+S,r:S,tg:-7.31693988508
+S,r:S,u:-5.18067067208
+S,r:S,ud:-6.81794871896
+S,r:S,ug:-7.98792549383
+S,r:S,uj:-2.75769632005
+S,r:S,ul:-6.06858839356
+S,r:S,uv:-7.12163113276
+S,r:S,uz:-8.4896601459
+S,r:S,v:-1.71776087274
+S,r:S,vg:-5.93767295976
+S,r:S,vn:-9.74468812102
+S,r:S,x:-8.31566881524
+S,r:S,y:-5.56203232153
+S,t:B,f:-3.50655789732
+S,t:B,n:-3.50655789732
+S,t:B,nr:-2.65926003693
+S,t:B,ns:-4.60517018599
+S,t:B,nz:-3.91202300543
+S,t:B,r:-3.50655789732
+S,t:B,t:-4.60517018599
+S,t:B,v:-2.99573227355
+S,tg:B,a:-5.51066842458
+S,tg:B,ad:-7.35461364698
+S,tg:B,an:-8.48959357982
+S,tg:B,b:-6.3430127353
+S,tg:B,c:-5.97728795584
+S,tg:B,d:-4.78966428952
+S,tg:B,f:-5.85850441985
+S,tg:B,i:-6.75499252443
+S,tg:B,j:-6.18700848682
+S,tg:B,l:-7.25283095267
+S,tg:B,m:-4.15739931889
+S,tg:B,mq:-9.30052379603
+S,tg:B,n:-2.78063931676
+S,tg:B,nr:-3.56395149855
+S,tg:B,nrfg:-7.1032992187
+S,tg:B,nrt:-5.61791395493
+S,tg:B,ns:-1.35789506935
+S,tg:B,nt:-6.14352337488
+S,tg:B,nz:-5.71700485758
+S,tg:B,o:-10.6868181572
+S,tg:B,p:-7.19031059569
+S,tg:B,q:-8.20191150737
+S,tg:B,r:-5.51633416212
+S,tg:B,rz:-10.6868181572
+S,tg:B,s:-5.95943033844
+S,tg:B,t:-4.41205613591
+S,tg:B,u:-8.60737661547
+S,tg:B,v:-3.00895465648
+S,tg:B,vd:-9.99367097659
+S,tg:B,vn:-5.94188602879
+S,tg:B,vq:-10.6868181572
+S,tg:B,z:-7.42872161913
+S,tg:S,a:-3.71514955243
+S,tg:S,ad:-9.99367097659
+S,tg:S,ag:-6.66146646642
+S,tg:S,an:-10.6868181572
+S,tg:S,b:-6.64376688932
+S,tg:S,c:-4.89992077579
+S,tg:S,d:-2.99653213648
+S,tg:S,dg:-8.28892288436
+S,tg:S,e:-8.7409080081
+S,tg:S,f:-4.25387806441
+S,tg:S,g:-5.35894198836
+S,tg:S,h:-8.04776082754
+S,tg:S,j:-4.98637458376
+S,tg:S,k:-6.67948497192
+S,tg:S,m:-4.58649920513
+S,tg:S,mg:-9.30052379603
+S,tg:S,n:-2.65705963671
+S,tg:S,ng:-3.58679099052
+S,tg:S,nr:-5.07004705949
+S,tg:S,nt:-10.6868181572
+S,tg:S,o:-8.89505868793
+S,tg:S,p:-2.74090855854
+S,tg:S,q:-3.61779473058
+S,tg:S,r:-4.43298934558
+S,tg:S,rg:-10.6868181572
+S,tg:S,t:-10.6868181572
+S,tg:S,tg:-3.9910192401
+S,tg:S,u:-5.07734636197
+S,tg:S,ud:-6.75499252443
+S,tg:S,ug:-8.12186879969
+S,tg:S,uj:-4.11874024574
+S,tg:S,ul:-4.18853600768
+S,tg:S,uv:-7.1032992187
+S,tg:S,uz:-8.60737661547
+S,tg:S,v:-2.04510909104
+S,tg:S,vg:-4.69036606854
+S,tg:S,vn:-10.6868181572
+S,tg:S,x:-6.54368343076
+S,tg:S,y:-6.62637514661
+S,t:S,c:-4.60517018599
+S,t:S,d:-2.81341071676
+S,t:S,f:-4.60517018599
+S,t:S,g:-4.60517018599
+S,t:S,j:-4.60517018599
+S,t:S,k:-3.91202300543
+S,t:S,n:-2.30258509299
+S,t:S,nr:-3.21887582487
+S,t:S,p:-3.50655789732
+S,t:S,q:-2.65926003693
+S,t:S,r:-3.91202300543
+S,t:S,tg:-3.91202300543
+S,t:S,uj:-2.99573227355
+S,t:S,ul:-4.60517018599
+S,t:S,v:-1.237874356
+S,u:B,a:-4.06082093804
+S,u:B,ad:-6.70391324287
+S,u:B,an:-7.9441760486
+S,u:B,b:-4.50529201726
+S,u:B,c:-5.16414228351
+S,u:B,d:-4.61119544215
+S,u:B,df:-11.0796702645
+S,u:B,f:-5.87566357745
+S,u:B,i:-6.31749632973
+S,u:B,in:-11.7728174451
+S,u:B,j:-5.82870659437
+S,u:B,l:-5.69402906981
+S,u:B,m:-3.5922164975
+S,u:B,mq:-8.16189953245
+S,u:B,n:-1.60862084335
+S,u:B,nr:-4.19877243972
+S,u:B,nrfg:-8.09651677318
+S,u:B,nrt:-6.63408214837
+S,u:B,ns:-4.66498255439
+S,u:B,nt:-7.72103249729
+S,u:B,nz:-6.22959503545
+S,u:B,o:-10.5200544766
+S,u:B,p:-6.17624905474
+S,u:B,q:-7.33606591073
+S,u:B,r:-4.18550693907
+S,u:B,rr:-12.4659646257
+S,u:B,rz:-10.8565267132
+S,u:B,s:-5.83264619237
+S,u:B,t:-5.36841577504
+S,u:B,u:-7.61393436173
+S,u:B,v:-2.12939679797
+S,u:B,vd:-9.52152564648
+S,u:B,vn:-4.17291548588
+S,u:B,y:-10.2687400483
+S,u:B,z:-7.5681248257
+S,ud:B,a:-3.15185931372
+S,ud:B,ad:-5.88655976804
+S,ud:B,an:-8.76166405381
+S,ud:B,b:-6.81575390475
+S,ud:B,c:-6.34737497123
+S,ud:B,d:-2.96588266065
+S,ud:B,df:-9.55012141417
+S,ud:B,e:-9.77326496549
+S,ud:B,f:-5.96106229534
+S,ud:B,i:-3.18124835674
+S,ud:B,j:-7.09911631606
+S,ud:B,l:-4.43572688578
+S,ud:B,m:-3.779927174
+S,ud:B,mq:-7.75836194494
+S,ud:B,n:-2.75531089421
+S,ud:B,nr:-3.94579101849
+S,ud:B,nrfg:-7.69382342381
+S,ud:B,nrt:-6.29202487615
+S,ud:B,ns:-5.40065755273
+S,ud:B,nt:-9.36779985738
+S,ud:B,nz:-6.51516842746
+S,ud:B,o:-6.18974602703
+S,ud:B,p:-7.0820218827
+S,ud:B,q:-8.38697060437
+S,ud:B,r:-3.41715730479
+S,ud:B,rz:-9.08011778493
+S,ud:B,s:-5.47258397027
+S,ud:B,t:-5.80770119313
+S,ud:B,u:-8.38697060437
+S,ud:B,v:-2.50539068016
+S,ud:B,vn:-6.12912140521
+S,ud:B,vq:-11.1595593266
+S,ud:B,y:-9.21364917755
+S,ud:B,z:-3.74739899166
+S,ud:S,a:-2.92525969091
+S,ud:S,ag:-7.01642460021
+S,ud:S,b:-8.11503688888
+S,ud:S,c:-5.39436822382
+S,ud:S,d:-2.02426582895
+S,ud:S,dg:-7.2677390285
+S,ud:S,e:-8.96233474927
+S,ud:S,f:-4.41785863195
+S,ud:S,g:-6.88289320759
+S,ud:S,h:-10.466412146
+S,ud:S,j:-5.86625450188
+S,ud:S,k:-8.38697060437
+S,ud:S,m:-3.26561418837
+S,ud:S,mg:-10.466412146
+S,ud:S,n:-3.18674854248
+S,ud:S,ng:-4.8698437557
+S,ud:S,nr:-5.85625441855
+S,ud:S,o:-6.75284007934
+S,ud:S,p:-3.46744598701
+S,ud:S,q:-4.73631236307
+S,ud:S,r:-3.33231842485
+S,ud:S,rg:-11.1595593266
+S,ud:S,tg:-6.8554942334
+S,ud:S,u:-5.53193821292
+S,ud:S,ud:-7.24753632118
+S,ud:S,ug:-5.28744153713
+S,ud:S,uj:-4.79998545793
+S,ud:S,ul:-3.62106432719
+S,ud:S,uv:-7.75836194494
+S,ud:S,uz:-5.47938671759
+S,ud:S,v:-1.91452771484
+S,ud:S,vg:-6.10970331936
+S,ud:S,vn:-11.1595593266
+S,ud:S,x:-7.90146278858
+S,ud:S,y:-6.37206758382
+S,ug:B,a:-4.21204879257
+S,ug:B,ad:-6.35744830204
+S,ug:B,an:-7.50258060634
+S,ug:B,b:-5.9827548526
+S,ug:B,c:-4.81862795682
+S,ug:B,d:-4.45635893287
+S,ug:B,df:-10.141637936
+S,ug:B,f:-5.2818255316
+S,ug:B,i:-5.64182826563
+S,ug:B,j:-6.30218562336
+S,ug:B,l:-5.97497271216
+S,ug:B,m:-2.22683756183
+S,ug:B,mq:-6.58628987447
+S,ug:B,n:-2.21865197725
+S,ug:B,nr:-3.96265701518
+S,ug:B,nrfg:-7.36904921372
+S,ug:B,nrt:-6.24981763785
+S,ug:B,ns:-3.90624729835
+S,ug:B,nt:-7.40079791203
+S,ug:B,nz:-5.75961130128
+S,ug:B,o:-10.141637936
+S,ug:B,p:-6.5581189975
+S,ug:B,q:-7.33827755505
+S,ug:B,r:-2.92603037773
+S,ug:B,rz:-8.06219639428
+S,ug:B,s:-5.59303810146
+S,ug:B,t:-4.46659793017
+S,ug:B,u:-5.85117849481
+S,ug:B,v:-3.20821491023
+S,ug:B,vd:-9.22534720408
+S,ug:B,vn:-4.91589126224
+S,ug:B,y:-9.22534720408
+S,ug:B,z:-6.88354139794
+S,ug:S,a:-2.72315703821
+S,ug:S,ag:-6.69165039013
+S,ug:S,an:-10.8347851165
+S,ug:S,b:-7.02812262675
+S,ug:S,c:-4.8946138638
+S,ug:S,d:-3.79687915307
+S,ug:S,dg:-7.43358773485
+S,ug:S,e:-8.26983575906
+S,ug:S,f:-4.46488413369
+S,ug:S,g:-7.19719895679
+S,ug:S,h:-9.4484907554
+S,ug:S,j:-5.88602522614
+S,ug:S,k:-8.75534357484
+S,ug:S,m:-3.2893953669
+S,ug:S,mg:-9.73617282785
+S,ug:S,n:-2.82708510363
+S,ug:S,ng:-4.47175701298
+S,ug:S,nr:-4.92670217835
+S,ug:S,nt:-10.8347851165
+S,ug:S,o:-9.4484907554
+S,ug:S,p:-4.40023859773
+S,ug:S,q:-4.07321234771
+S,ug:S,r:-2.67169874093
+S,ug:S,tg:-5.99059803006
+S,ug:S,u:-6.11628624522
+S,ug:S,ud:-4.77099990783
+S,ug:S,ug:-7.50258060634
+S,ug:S,uj:-2.84862025618
+S,ug:S,ul:-2.54650207131
+S,ug:S,uv:-7.22386720387
+S,ug:S,uz:-5.25883601337
+S,ug:S,v:-2.6511085339
+S,ug:S,vg:-6.09858666812
+S,ug:S,vn:-10.141637936
+S,ug:S,x:-9.04302564729
+S,ug:S,y:-5.38374666295
+S,uj:B,a:-3.31741725644
+S,uj:B,ad:-5.95256905491
+S,uj:B,an:-5.99404684432
+S,uj:B,b:-4.24040704075
+S,uj:B,c:-5.04407602325
+S,uj:B,d:-4.40681760688
+S,uj:B,df:-11.2958996206
+S,uj:B,e:-11.9090040935
+S,uj:B,f:-5.3753270686
+S,uj:B,h:-11.0399662465
+S,uj:B,i:-5.74974609015
+S,uj:B,in:-13.0876590898
+S,uj:B,j:-5.48951041848
+S,uj:B,jn:-14.4739534509
+S,uj:B,l:-5.12428601375
+S,uj:B,ln:-12.3945119093
+S,uj:B,m:-3.43643820452
+S,uj:B,mq:-7.54737641773
+S,uj:B,n:-0.715203738807
+S,uj:B,nr:-4.29761831492
+S,uj:B,nrfg:-8.27750932315
+S,uj:B,nrt:-6.50701995254
+S,uj:B,ns:-4.27596959565
+S,uj:B,nt:-6.81101560049
+S,uj:B,nz:-5.47186801779
+S,uj:B,o:-9.58360432273
+S,uj:B,p:-6.92539747178
+S,uj:B,q:-7.27203713342
+S,uj:B,r:-4.32520866685
+S,uj:B,rr:-11.9090040935
+S,uj:B,rz:-9.3381550139
+S,uj:B,s:-5.16830289917
+S,uj:B,t:-5.27214941
+S,uj:B,u:-8.624628671
+S,uj:B,v:-2.39498716854
+S,uj:B,vd:-7.543458685
+S,uj:B,vn:-2.73996660087
+S,uj:B,y:-11.1417489408
+S,uj:B,z:-6.6999383737
+S,uj:S,a:-4.01563295865
+S,uj:S,ad:-12.171368358
+S,uj:S,ag:-7.51170998668
+S,uj:S,an:-10.8630355383
+S,uj:S,b:-6.08892116314
+S,uj:S,bg:-13.7808062704
+S,uj:S,c:-5.64194951969
+S,uj:S,d:-4.29773250276
+S,uj:S,dg:-10.396416007
+S,uj:S,e:-10.0313021945
+S,uj:S,f:-5.59587419482
+S,uj:S,g:-7.33667501369
+S,uj:S,h:-8.2939367973
+S,uj:S,j:-5.94206871079
+S,uj:S,k:-8.02823363156
+S,uj:S,m:-4.60754490665
+S,uj:S,mg:-12.0760581782
+S,uj:S,n:-3.11699197553
+S,uj:S,ng:-5.41130135187
+S,uj:S,nr:-5.92351892575
+S,uj:S,nt:-13.3753411623
+S,uj:S,o:-9.80112461649
+S,uj:S,p:-5.19231619709
+S,uj:S,q:-5.25882456224
+S,uj:S,r:-4.47388380057
+S,uj:S,rg:-11.7013647287
+S,uj:S,t:-13.7808062704
+S,uj:S,tg:-7.99390888902
+S,uj:S,u:-7.95628217804
+S,uj:S,ud:-9.81051435684
+S,uj:S,ug:-8.92877600647
+S,uj:S,uj:-7.96518431398
+S,uj:S,ul:-7.29160133906
+S,uj:S,uv:-7.65941055369
+S,uj:S,uz:-9.9413539578
+S,uj:S,v:-3.40681521357
+S,uj:S,vg:-6.50217732807
+S,uj:S,vn:-9.4500729301
+S,uj:S,x:-9.09867504327
+S,uj:S,y:-6.75083335868
+S,ul:B,a:-3.61675500732
+S,ul:B,ad:-5.79647774152
+S,ul:B,an:-7.38944081675
+S,ul:B,b:-4.99303209098
+S,ul:B,c:-4.17318279443
+S,ul:B,d:-3.67754399275
+S,ul:B,df:-9.8171890527
+S,ul:B,e:-10.1172936452
+S,ul:B,f:-5.14643922107
+S,ul:B,i:-5.31532388319
+S,ul:B,j:-5.47965626903
+S,ul:B,jn:-12.4198787381
+S,ul:B,l:-5.2235667693
+S,ul:B,ln:-11.5035880063
+S,ul:B,m:-1.94104266583
+S,ul:B,mq:-6.26078334965
+S,ul:B,n:-1.77779274215
+S,ul:B,nr:-3.36426421137
+S,ul:B,nrfg:-7.01046732409
+S,ul:B,nrt:-6.083053007
+S,ul:B,ns:-3.73556223369
+S,ul:B,nt:-6.33994554305
+S,ul:B,nz:-5.42640458376
+S,ul:B,o:-8.5383149402
+S,ul:B,p:-5.80113975463
+S,ul:B,q:-7.19413206443
+S,ul:B,r:-3.00582231252
+S,ul:B,rr:-11.5035880063
+S,ul:B,rz:-8.44019708424
+S,ul:B,s:-4.89343046453
+S,ul:B,t:-3.94736915436
+S,ul:B,u:-7.14176407892
+S,ul:B,v:-2.57986360857
+S,ul:B,vd:-8.79553780517
+S,ul:B,vn:-4.4672636265
+S,ul:B,y:-9.12404187214
+S,ul:B,z:-6.29191844645
+S,ul:S,a:-3.87848085803
+S,ul:S,ad:-11.7267315576
+S,ul:S,ag:-7.68807590123
+S,ul:S,an:-11.7267315576
+S,ul:S,b:-6.56767625837
+S,ul:S,c:-4.92572664855
+S,ul:S,d:-3.30137956984
+S,ul:S,dg:-9.2418249078
+S,ul:S,e:-7.70137986685
+S,ul:S,f:-5.37236151679
+S,ul:S,g:-7.13161170745
+S,ul:S,h:-8.87891941411
+S,ul:S,j:-5.5766619803
+S,ul:S,k:-8.68220911986
+S,ul:S,m:-3.52404365267
+S,ul:S,mg:-10.6281192689
+S,ul:S,n:-3.42266970736
+S,ul:S,ng:-5.0393112776
+S,ul:S,nr:-5.00169791542
+S,ul:S,nt:-11.7267315576
+S,ul:S,o:-8.85034604167
+S,ul:S,p:-3.94653294651
+S,ul:S,q:-3.92115506301
+S,ul:S,r:-2.47409827342
+S,ul:S,rg:-11.5035880063
+S,ul:S,tg:-7.26370113876
+S,ul:S,u:-6.61927207885
+S,ul:S,ud:-7.55619785701
+S,ul:S,ug:-8.00103813035
+S,ul:S,uj:-5.31286284831
+S,ul:S,ul:-8.82256647756
+S,ul:S,uv:-7.57569165169
+S,ul:S,uz:-9.50210800606
+S,ul:S,v:-2.89294090231
+S,ul:S,vg:-6.31732014353
+S,ul:S,vn:-10.4049757176
+S,ul:S,x:-8.95414283535
+S,ul:S,y:-4.94482298847
+S,ul:S,zg:-13.1130259187
+S,u:S,a:-3.81529004286
+S,u:S,ad:-11.367352337
+S,u:S,ag:-7.17769759496
+S,u:S,an:-9.57559286775
+S,u:S,b:-6.80300414551
+S,u:S,c:-4.96212387895
+S,u:S,d:-3.36443515953
+S,u:S,dg:-7.62177753919
+S,u:S,e:-10.8565267132
+S,u:S,f:-4.49903112725
+S,u:S,g:-6.52842842057
+S,u:S,h:-7.77461674342
+S,u:S,j:-4.90276403329
+S,u:S,k:-8.1755051845
+S,u:S,m:-3.66569997434
+S,u:S,mg:-11.7728174451
+S,u:S,n:-2.29631234725
+S,u:S,ng:-2.94205516027
+S,u:S,nr:-5.67362019818
+S,u:S,o:-11.367352337
+S,u:S,p:-3.52900902143
+S,u:S,q:-3.79125499636
+S,u:S,r:-3.96003462651
+S,u:S,tg:-6.32177899152
+S,u:S,u:-5.56422741899
+S,u:S,ud:-6.80648240989
+S,u:S,ug:-7.2348560088
+S,u:S,uj:-4.80820935452
+S,u:S,ul:-6.58264223716
+S,u:S,uv:-3.88654809105
+S,u:S,uz:-4.89089292614
+S,u:S,v:-2.07457213273
+S,u:S,vg:-4.23272712495
+S,u:S,vn:-9.33047040972
+S,u:S,x:-8.35509076148
+S,u:S,y:-7.82157372651
+S,u:S,zg:-12.4659646257
+S,uv:B,a:-4.62804196691
+S,uv:B,ad:-5.9205321059
+S,uv:B,an:-8.38438534649
+S,uv:B,b:-6.76664863124
+S,uv:B,c:-5.70165295337
+S,uv:B,d:-4.15269722276
+S,uv:B,df:-10.8692919963
+S,uv:B,e:-9.25985408385
+S,uv:B,f:-5.96772779724
+S,uv:B,i:-5.46661461441
+S,uv:B,j:-7.50199616629
+S,uv:B,l:-6.07350145068
+S,uv:B,m:-4.72403397599
+S,uv:B,mq:-8.92338184722
+S,uv:B,n:-3.19816409185
+S,uv:B,nr:-5.1151333143
+S,uv:B,nrfg:-8.61800019767
+S,uv:B,nrt:-7.80123906115
+S,uv:B,ns:-5.42255462461
+S,uv:B,nt:-9.95300126441
+S,uv:B,nz:-6.88030794972
+S,uv:B,o:-7.71229157513
+S,uv:B,p:-5.86870703804
+S,uv:B,q:-7.69123816593
+S,uv:B,r:-5.41825354271
+S,uv:B,s:-6.49984414381
+S,uv:B,t:-5.55855210973
+S,uv:B,u:-8.34356335197
+S,uv:B,v:-1.10820361054
+S,uv:B,vd:-8.56670690329
+S,uv:B,vi:-10.4638268882
+S,uv:B,vn:-4.12818179471
+S,uv:B,y:-10.8692919963
+S,uv:B,z:-6.75025482147
+S,uv:S,a:-4.62415469282
+S,uv:S,ad:-10.1761448157
+S,uv:S,ag:-7.25837408364
+S,uv:S,an:-9.95300126441
+S,uv:S,b:-7.89887753071
+S,uv:S,c:-4.84948297616
+S,uv:S,d:-3.5892837434
+S,uv:S,dg:-9.77067970761
+S,uv:S,e:-7.59214726329
+S,uv:S,f:-4.5935887985
+S,uv:S,g:-7.23170583655
+S,uv:S,h:-9.77067970761
+S,uv:S,j:-6.08597562491
+S,uv:S,k:-6.98772819834
+S,uv:S,m:-4.89548238441
+S,uv:S,mg:-10.8692919963
+S,uv:S,n:-3.9655447387
+S,uv:S,ng:-3.98480534424
+S,uv:S,nr:-6.11570180517
+S,uv:S,o:-8.38438534649
+S,uv:S,p:-2.61125821038
+S,uv:S,q:-4.2036082785
+S,uv:S,r:-4.96120905811
+S,uv:S,tg:-7.25837408364
+S,uv:S,u:-5.80353740296
+S,uv:S,ud:-8.7898504546
+S,uv:S,ug:-7.16799002217
+S,uv:S,uj:-4.40004167948
+S,uv:S,ul:-7.45156531267
+S,uv:S,uv:-7.20573035015
+S,uv:S,uz:-9.07753252705
+S,uv:S,v:-1.18144496333
+S,uv:S,vg:-5.53416065661
+S,uv:S,vn:-11.5624391768
+S,uv:S,x:-8.67206741894
+S,uv:S,y:-7.27197973569
+S,uz:B,a:-3.68479730574
+S,uz:B,ad:-6.29986794237
+S,uz:B,an:-7.0587665005
+S,uz:B,b:-5.51347883507
+S,uz:B,c:-5.40749739422
+S,uz:B,d:-3.79955035049
+S,uz:B,df:-9.20858883894
+S,uz:B,e:-9.74758533967
+S,uz:B,f:-5.4828954117
+S,uz:B,h:-11.6934954887
+S,uz:B,i:-5.14241515368
+S,uz:B,j:-6.29533278721
+S,uz:B,l:-5.52597899784
+S,uz:B,m:-2.50765274835
+S,uz:B,mq:-6.81829816552
+S,uz:B,n:-1.59320836021
+S,uz:B,nr:-3.28678703048
+S,uz:B,nrfg:-6.84146522481
+S,uz:B,nrt:-5.99976334992
+S,uz:B,ns:-4.6995625135
+S,uz:B,nt:-7.58262162455
+S,uz:B,nz:-6.05158841779
+S,uz:B,o:-7.74225177014
+S,uz:B,p:-7.23914819247
+S,uz:B,q:-7.10852801005
+S,uz:B,r:-3.12352011187
+S,uz:B,rr:-11.0003483082
+S,uz:B,rz:-7.88683299896
+S,uz:B,s:-4.80594291706
+S,uz:B,t:-4.95890382875
+S,uz:B,u:-8.16713496411
+S,uz:B,v:-2.67977845825
+S,uz:B,vd:-9.9017360195
+S,uz:B,vn:-5.23672583315
+S,uz:B,vq:-11.6934954887
+S,uz:B,y:-9.61405394705
+S,uz:B,z:-5.01264080994
+S,uz:S,a:-3.70427407991
+S,uz:S,ag:-7.23914819247
+S,uz:S,an:-10.3072011276
+S,uz:S,b:-6.70306290195
+S,uz:S,c:-5.6580140562
+S,uz:S,d:-3.451792329
+S,uz:S,dg:-8.92090676649
+S,uz:S,e:-8.39765862272
+S,uz:S,f:-5.55145808314
+S,uz:S,g:-6.76624180357
+S,uz:S,h:-9.49627091139
+S,uz:S,j:-5.81856475787
+S,uz:S,k:-9.05443815911
+S,uz:S,m:-4.43861067865
+S,uz:S,mg:-10.5948832001
+S,uz:S,n:-2.68563856537
+S,uz:S,ng:-4.96726208637
+S,uz:S,nr:-4.96846184656
+S,uz:S,o:-8.08257757608
+S,uz:S,p:-3.75862392278
+S,uz:S,q:-3.9819465091
+S,uz:S,r:-2.41989866711
+S,uz:S,tg:-7.65044422089
+S,uz:S,u:-6.38028950968
+S,uz:S,ud:-8.08257757608
+S,uz:S,ug:-7.88683299896
+S,uz:S,uj:-3.78989919911
+S,uz:S,ul:-5.03164074818
+S,uz:S,uv:-8.92090676649
+S,uz:S,uz:-9.05443815911
+S,uz:S,v:-2.23934656499
+S,uz:S,vg:-6.09507352973
+S,uz:S,vn:-10.0840575763
+S,uz:S,x:-8.5580012728
+S,uz:S,y:-4.91130343272
+S,v:B,a:-4.24428516019
+S,v:B,ad:-5.95251064843
+S,v:B,an:-7.75156726077
+S,v:B,b:-5.47472640201
+S,v:B,c:-5.08074135053
+S,v:B,d:-4.09727556309
+S,v:B,df:-8.67620628204
+S,v:B,e:-10.238852033
+S,v:B,f:-5.58332827971
+S,v:B,h:-14.487347275
+S,v:B,i:-5.43658897286
+S,v:B,in:-13.5710565431
+S,v:B,j:-5.97335921455
+S,v:B,jn:-15.1804944556
+S,v:B,l:-5.66392016575
+S,v:B,ln:-14.487347275
+S,v:B,m:-3.26569699667
+S,v:B,mq:-7.58863274068
+S,v:B,n:-2.0667602022
+S,v:B,nr:-3.64379387195
+S,v:B,nrfg:-7.59521337693
+S,v:B,nrt:-6.10746403456
+S,v:B,ns:-3.83253797787
+S,v:B,nt:-6.44095803301
+S,v:B,nz:-5.69426629103
+S,v:B,o:-9.08692468553
+S,v:B,p:-5.6879117799
+S,v:B,q:-7.2104451506
+S,v:B,r:-3.52433482252
+S,v:B,rr:-12.2360554764
+S,v:B,rz:-9.30275867379
+S,v:B,s:-5.43360223526
+S,v:B,t:-4.58298510507
+S,v:B,u:-7.6085060062
+S,v:B,v:-2.36746725084
+S,v:B,vd:-7.76893816776
+S,v:B,vn:-4.74658455553
+S,v:B,vq:-11.4428248373
+S,v:B,y:-9.19153303868
+S,v:B,z:-6.82629089265
+S,vg:B,a:-4.76610848395
+S,vg:B,ad:-7.05301576423
+S,vg:B,an:-8.86724808931
+S,vg:B,b:-5.93001202243
+S,vg:B,c:-5.18406665631
+S,vg:B,d:-4.38270589111
+S,vg:B,df:-10.3488526302
+S,vg:B,e:-10.859678254
+S,vg:B,f:-5.91565770898
+S,vg:B,i:-5.97940477776
+S,vg:B,j:-6.09465936707
+S,vg:B,l:-6.29533006253
+S,vg:B,m:-4.00251476113
+S,vg:B,mq:-8.66245367666
+S,vg:B,n:-2.1407967033
+S,vg:B,nr:-3.1965837742
+S,vg:B,nrfg:-7.01664812005
+S,vg:B,nrt:-5.7537327801
+S,vg:B,ns:-4.29160034258
+S,vg:B,nt:-7.57626390799
+S,vg:B,nz:-5.71996591762
+S,vg:B,o:-8.82279632674
+S,vg:B,p:-7.17916704955
+S,vg:B,q:-8.10814294095
+S,vg:B,r:-4.71334899633
+S,vg:B,rz:-11.2651433621
+S,vg:B,s:-5.6797691185
+S,vg:B,t:-4.67072990235
+S,vg:B,u:-7.83115615762
+S,vg:B,v:-2.94615723671
+S,vg:B,vd:-9.87884900098
+S,vg:B,vi:-11.9582905427
+S,vg:B,vn:-5.3846103757
+S,vg:B,vq:-11.9582905427
+S,vg:B,y:-9.3933411852
+S,vg:B,z:-6.98155680024
+S,vg:S,a:-3.60597199444
+S,vg:S,ad:-9.87884900098
+S,vg:S,ag:-5.13609315204
+S,vg:S,an:-9.31923321305
+S,vg:S,b:-6.15315557375
+S,vg:S,bg:-11.2651433621
+S,vg:S,c:-4.20983051876
+S,vg:S,d:-3.25445182297
+S,vg:S,dg:-7.33331772938
+S,vg:S,e:-8.24471847596
+S,vg:S,f:-4.15812747227
+S,vg:S,g:-3.98789563547
+S,vg:S,h:-7.73878283749
+S,vg:S,j:-4.21893133998
+S,vg:S,k:-5.72780909509
+S,vg:S,m:-4.1306509963
+S,vg:S,mg:-8.66245367666
+S,vg:S,n:-2.35557030213
+S,vg:S,ng:-2.60307090937
+S,vg:S,nr:-4.2516776287
+S,vg:S,nt:-11.2651433621
+S,vg:S,o:-7.37332306399
+S,vg:S,p:-3.38075512224
+S,vg:S,q:-3.48296155535
+S,vg:S,r:-3.32100587099
+S,vg:S,rg:-8.82279632674
+S,vg:S,t:-11.9582905427
+S,vg:S,tg:-5.37626540377
+S,vg:S,u:-4.3152869071
+S,vg:S,ud:-5.81410490854
+S,vg:S,ug:-6.34516243628
+S,vg:S,uj:-4.17966039534
+S,vg:S,ul:-4.09080197397
+S,vg:S,uv:-5.88986495442
+S,vg:S,uz:-5.09239946778
+S,vg:S,v:-1.943485254
+S,vg:S,vg:-3.85237934468
+S,vg:S,vn:-8.19709042697
+S,vg:S,x:-5.10288174405
+S,vg:S,y:-5.97940477776
+S,vg:S,yg:-10.859678254
+S,vg:S,zg:-10.5719961815
+S,vn:B,a:-5.46241837723
+S,vn:B,ad:-7.65964295456
+S,vn:B,b:-6.5610306659
+S,vn:B,c:-4.82642961051
+S,vn:B,d:-4.07612401611
+S,vn:B,f:-5.58020141288
+S,vn:B,i:-5.71373280551
+S,vn:B,j:-7.65964295456
+S,vn:B,m:-5.02058562495
+S,vn:B,n:-1.74344089196
+S,vn:B,nr:-3.97076350045
+S,vn:B,nrfg:-6.05020504213
+S,vn:B,nrt:-4.88705423232
+S,vn:B,ns:-5.86788348534
+S,vn:B,nz:-6.27334859344
+S,vn:B,p:-6.27334859344
+S,vn:B,r:-4.48158912422
+S,vn:B,s:-5.26174768177
+S,vn:B,t:-5.17473630478
+S,vn:B,v:-3.02491396634
+S,vn:B,vn:-5.58020141288
+S,vn:B,z:-6.966495774
+S,vn:S,a:-3.38297683555
+S,vn:S,ad:-6.966495774
+S,vn:S,ag:-5.35705786157
+S,vn:S,b:-5.58020141288
+S,vn:S,c:-2.8889583301
+S,vn:S,d:-2.89746901977
+S,vn:S,dg:-7.65964295456
+S,vn:S,f:-3.44013524939
+S,vn:S,g:-4.82642961051
+S,vn:S,j:-4.82642961051
+S,vn:S,k:-6.5610306659
+S,vn:S,m:-4.52414873864
+S,vn:S,n:-1.74884631052
+S,vn:S,ng:-3.36918351342
+S,vn:S,nr:-4.82642961051
+S,vn:S,p:-3.670658908
+S,vn:S,q:-4.2584455729
+S,vn:S,r:-3.68935104101
+S,vn:S,tg:-6.5610306659
+S,vn:S,u:-4.32743844439
+S,vn:S,ud:-6.966495774
+S,vn:S,ug:-6.966495774
+S,vn:S,uj:-3.65230976933
+S,vn:S,ul:-6.5610306659
+S,vn:S,uv:-7.65964295456
+S,vn:S,uz:-7.65964295456
+S,vn:S,v:-2.22156364564
+S,vn:S,vg:-4.4407671297
+S,vn:S,vn:-5.58020141288
+S,vn:S,x:-6.27334859344
+S,vn:S,y:-6.05020504213
+S,v:S,a:-3.7440829317
+S,v:S,ad:-9.34861197829
+S,v:S,ag:-6.84818610335
+S,v:S,an:-10.0565304762
+S,v:S,b:-6.13762643754
+S,v:S,bg:-12.541437126
+S,v:S,c:-5.00248606086
+S,v:S,d:-3.41279499797
+S,v:S,dg:-8.04719850068
+S,v:S,e:-8.3615703903
+S,v:S,f:-4.21214100567
+S,v:S,g:-5.68437381844
+S,v:S,h:-8.94608372986
+S,v:S,j:-5.00423544332
+S,v:S,k:-7.09009215898
+S,v:S,m:-3.97688336318
+S,v:S,mg:-10.5076656211
+S,v:S,n:-2.95245485992
+S,v:S,ng:-3.9627188779
+S,v:S,nr:-4.91573752967
+S,v:S,nt:-12.9832698782
+S,v:S,o:-8.69738710412
+S,v:S,p:-3.03108740416
+S,v:S,q:-3.70677770383
+S,v:S,r:-3.01414544964
+S,v:S,rg:-10.8900350144
+S,v:S,t:-12.2901226977
+S,v:S,tg:-6.84338532601
+S,v:S,u:-5.45159841377
+S,v:S,ud:-4.70056209226
+S,v:S,ug:-5.26147810142
+S,v:S,uj:-3.83695852759
+S,v:S,ul:-3.02785423284
+S,v:S,uv:-6.53702109825
+S,v:S,uz:-3.95421160348
+S,v:S,v:-2.01581324298
+S,v:S,vg:-5.01445034937
+S,v:S,vn:-9.27786112217
+S,v:S,x:-7.03031518589
+S,v:S,y:-5.530029933
+S,v:S,yg:-14.487347275
+S,v:S,zg:-13.5710565431
+S,x:B,a:-5.52756570248
+S,x:B,ad:-7.72479027981
+S,x:B,an:-9.22886767659
+S,x:B,b:-6.62617799115
+S,x:B,c:-5.91468167192
+S,x:B,d:-4.8721588499
+S,x:B,f:-6.23313540304
+S,x:B,i:-6.70313903228
+S,x:B,j:-9.92201485715
+S,x:B,l:-7.28295752753
+S,x:B,m:-5.13452311437
+S,x:B,mq:-8.82340256848
+S,x:B,n:-3.21515252055
+S,x:B,nr:-3.59765589477
+S,x:B,nrfg:-8.53572049603
+S,x:B,nrt:-5.68790835255
+S,x:B,ns:-5.97077113857
+S,x:B,nt:-9.22886767659
+S,x:B,nz:-7.08880151309
+S,x:B,o:-8.53572049603
+S,x:B,p:-7.52411958435
+S,x:B,q:-7.84257331547
+S,x:B,r:-5.51529560989
+S,x:B,s:-6.07186725544
+S,x:B,t:-6.36666679566
+S,x:B,u:-7.35706549969
+S,x:B,v:-3.56244098848
+S,x:B,vn:-6.28442869742
+S,x:B,z:-7.14942613491
+S,x:S,a:-3.40878474624
+S,x:S,ad:-7.28295752753
+S,x:S,ag:-4.12292220269
+S,x:S,an:-9.92201485715
+S,x:S,b:-5.59128151686
+S,x:S,bg:-7.84257331547
+S,x:S,c:-4.85311065493
+S,x:S,d:-3.59407807342
+S,x:S,dg:-6.7439610268
+S,x:S,e:-6.87749241943
+S,x:S,f:-4.75722888323
+S,x:S,g:-2.27518346572
+S,x:S,h:-8.82340256848
+S,x:S,j:-3.86289166157
+S,x:S,k:-6.11535236738
+S,x:S,m:-4.70165903207
+S,x:S,mg:-6.78652064122
+S,x:S,n:-2.42480763395
+S,x:S,ng:-2.47952213436
+S,x:S,nr:-3.18742319718
+S,x:S,o:-5.65933498011
+S,x:S,p:-3.79078836767
+S,x:S,q:-3.41026952751
+S,x:S,r:-4.24526105488
+S,x:S,rg:-6.66391831913
+S,x:S,tg:-5.631555416
+S,x:S,u:-5.03921293456
+S,x:S,ud:-7.28295752753
+S,x:S,ug:-8.31257694472
+S,x:S,uj:-4.09601474977
+S,x:S,ul:-6.11535236738
+S,x:S,uv:-5.91468167192
+S,x:S,uz:-6.36666679566
+S,x:S,v:-1.70754969639
+S,x:S,vg:-3.01126406919
+S,x:S,vn:-9.22886767659
+S,x:S,x:-2.75652138209
+S,x:S,y:-5.31684467116
+S,x:S,yg:-9.92201485715
+S,x:S,zg:-8.53572049603
+S,y:B,a:-5.03507004846
+S,y:B,ad:-6.57904492011
+S,y:B,an:-8.62921607949
+S,y:B,b:-6.25969150382
+S,y:B,c:-3.38584238656
+S,y:B,d:-3.24578015184
+S,y:B,df:-7.63881737546
+S,y:B,e:-7.97528961208
+S,y:B,f:-5.68073669078
+S,y:B,i:-5.92116587838
+S,y:B,j:-6.31136351436
+S,y:B,l:-4.9936562629
+S,y:B,m:-4.13368907095
+S,y:B,mq:-6.78744618968
+S,y:B,n:-2.26884402
+S,y:B,nr:-2.69127403024
+S,y:B,nrfg:-6.58899525096
+S,y:B,nrt:-5.84230730347
+S,y:B,ns:-4.505810723
+S,y:B,nt:-5.79600273543
+S,y:B,nz:-4.64881577661
+S,y:B,o:-7.01977816705
+S,y:B,p:-5.53817362613
+S,y:B,q:-8.79627016415
+S,y:B,r:-2.85275522549
+S,y:B,rz:-7.97528961208
+S,y:B,s:-5.80967037416
+S,y:B,t:-3.70699174273
+S,y:B,u:-7.40997580303
+S,y:B,v:-2.87298712946
+S,y:B,vd:-9.80787107583
+S,y:B,vn:-5.69699721165
+S,y:B,vq:-11.1941654369
+S,y:B,y:-8.99694085961
+S,y:B,z:-6.82471758448
+S,yg:B,n:-3.02042488614
+S,yg:B,nrt:-2.32727770558
+S,yg:B,nz:-3.7135720667
+S,yg:B,v:-3.7135720667
+S,yg:B,vn:-3.7135720667
+S,yg:S,a:-2.32727770558
+S,yg:S,d:-3.7135720667
+S,yg:S,g:-3.7135720667
+S,yg:S,j:-2.10413415427
+S,yg:S,m:-3.02042488614
+S,yg:S,n:-3.02042488614
+S,yg:S,ng:-3.02042488614
+S,yg:S,nr:-3.7135720667
+S,yg:S,p:-3.02042488614
+S,yg:S,q:-2.10413415427
+S,yg:S,r:-3.7135720667
+S,yg:S,tg:-3.7135720667
+S,yg:S,v:-2.10413415427
+S,y:S,a:-3.67718821234
+S,y:S,ad:-10.5010182564
+S,y:S,ag:-6.79971628228
+S,y:S,b:-6.34997835049
+S,y:S,c:-4.34934995774
+S,y:S,d:-2.87737630988
+S,y:S,dg:-8.55510810733
+S,y:S,e:-5.70936850346
+S,y:S,f:-5.46731768936
+S,y:S,g:-5.46082416005
+S,y:S,h:-8.36095209289
+S,y:S,j:-5.09834087452
+S,y:S,k:-9.40240596772
+S,y:S,m:-4.38182034277
+S,y:S,mg:-10.5010182564
+S,y:S,n:-3.87033487075
+S,y:S,ng:-4.70953020131
+S,y:S,nr:-4.20667518995
+S,y:S,nt:-9.58472752451
+S,y:S,o:-6.86343209666
+S,y:S,p:-3.75050175383
+S,y:S,q:-5.01829816684
+S,y:S,r:-1.64856785191
+S,y:S,tg:-6.11899162171
+S,y:S,u:-4.67501814901
+S,y:S,ud:-6.97465773177
+S,y:S,ug:-7.24292171837
+S,y:S,uj:-4.94226155378
+S,y:S,ul:-6.08821996305
+S,y:S,uv:-5.81888702926
+S,y:S,uz:-7.97528961208
+S,y:S,v:-2.36743083873
+S,y:S,vg:-5.50719008061
+S,y:S,vn:-11.1941654369
+S,y:S,x:-6.55943644872
+S,y:S,y:-4.47999490704
+S,zg:B,v:-3.7135720667
+S,zg:S,a:-3.7135720667
+S,zg:S,ag:-3.02042488614
+S,zg:S,d:-3.7135720667
+S,zg:S,f:-3.7135720667
+S,zg:S,g:-2.10413415427
+S,zg:S,j:-3.7135720667
+S,zg:S,n:-2.61495977804
+S,zg:S,ng:-2.61495977804
+S,zg:S,nr:-2.61495977804
+S,zg:S,o:-3.02042488614
+S,zg:S,q:-3.02042488614
+S,zg:S,tg:-3.02042488614
+S,zg:S,v:-1.63413052502
+S,zg:S,vg:-2.32727770558
+S,zg:S,x:-3.7135720667
+S,zg:S,y:-3.7135720667
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/stop_words.utf8 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/stop_words.utf8
new file mode 100644
index 0000000000..32ac9e67dc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/stop_words.utf8
@@ -0,0 +1,1534 @@
+"
+.
+。
+,
+、
+！
+？
+：
+；
+`
+﹑
+•
+＂
+^
+…
+‘
+’
+“
+”
+〝
+〞
+~
+\
+∕
+|
+¦
+‖
+—　
+(
+)
+〈
+〉
+﹞
+﹝
+「
+」
+‹
+›
+〖
+〗
+】
+【
+»
+«
+』
+『
+〕
+〔
+》
+《
+}
+{
+]
+[
+﹐
+¸
+﹕
+︰
+﹔
+;
+！
+¡
+？
+¿
+﹖
+﹌
+﹏
+﹋
+＇
+´
+ˊ
+ˋ
+-
+―
+﹫
+@
+︳
+︴
+_
+¯
+＿
+￣
+﹢
++
+﹦
+=
+﹤
+‐
+<
+­
+˜
+~
+﹟
+#
+﹩
+$
+﹠
+&
+﹪
+%
+﹡
+*
+﹨
+\
+﹍
+﹉
+﹎
+﹊
+ˇ
+︵
+︶
+︷
+︸
+︹
+︿
+﹀
+︺
+︽
+︾
+_
+ˉ
+﹁
+﹂
+﹃
+﹄
+︻
+︼
+的
+了
+the
+a
+an
+that
+those
+this
+that
+$
+0
+1
+2
+3
+4
+5
+6
+7
+8
+9
+?
+_
+“
+”
+、
+。
+《
+》
+一
+一些
+一何
+一切
+一则
+一方面
+一旦
+一来
+一样
+一般
+一转眼
+万一
+上
+上下
+下
+不
+不仅
+不但
+不光
+不单
+不只
+不外乎
+不如
+不妨
+不尽
+不尽然
+不得
+不怕
+不惟
+不成
+不拘
+不料
+不是
+不比
+不然
+不特
+不独
+不管
+不至于
+不若
+不论
+不过
+不问
+与
+与其
+与其说
+与否
+与此同时
+且
+且不说
+且说
+两者
+个
+个别
+临
+为
+为了
+为什么
+为何
+为止
+为此
+为着
+乃
+乃至
+乃至于
+么
+之
+之一
+之所以
+之类
+乌乎
+乎
+乘
+也
+也好
+也罢
+了
+二来
+于
+于是
+于是乎
+云云
+云尔
+些
+亦
+人
+人们
+人家
+什么
+什么样
+今
+介于
+仍
+仍旧
+从
+从此
+从而
+他
+他人
+他们
+以
+以上
+以为
+以便
+以免
+以及
+以故
+以期
+以来
+以至
+以至于
+以致
+们
+任
+任何
+任凭
+似的
+但
+但凡
+但是
+何
+何以
+何况
+何处
+何时
+余外
+作为
+你
+你们
+使
+使得
+例如
+依
+依据
+依照
+便于
+俺
+俺们
+倘
+倘使
+倘或
+倘然
+倘若
+借
+假使
+假如
+假若
+傥然
+像
+儿
+先不先
+光是
+全体
+全部
+兮
+关于
+其
+其一
+其中
+其二
+其他
+其余
+其它
+其次
+具体地说
+具体说来
+兼之
+内
+再
+再其次
+再则
+再有
+再者
+再者说
+再说
+冒
+冲
+况且
+几
+几时
+凡
+凡是
+凭
+凭借
+出于
+出来
+分别
+则
+则甚
+别
+别人
+别处
+别是
+别的
+别管
+别说
+到
+前后
+前此
+前者
+加之
+加以
+即
+即令
+即使
+即便
+即如
+即或
+即若
+却
+去
+又
+又及
+及
+及其
+及至
+反之
+反而
+反过来
+反过来说
+受到
+另
+另一方面
+另外
+另悉
+只
+只当
+只怕
+只是
+只有
+只消
+只要
+只限
+叫
+叮咚
+可
+可以
+可是
+可见
+各
+各个
+各位
+各种
+各自
+同
+同时
+后
+后者
+向
+向使
+向着
+吓
+吗
+否则
+吧
+吧哒
+吱
+呀
+呃
+呕
+呗
+呜
+呜呼
+呢
+呵
+呵呵
+呸
+呼哧
+咋
+和
+咚
+咦
+咧
+咱
+咱们
+咳
+哇
+哈
+哈哈
+哉
+哎
+哎呀
+哎哟
+哗
+哟
+哦
+哩
+哪
+哪个
+哪些
+哪儿
+哪天
+哪年
+哪怕
+哪样
+哪边
+哪里
+哼
+哼唷
+唉
+唯有
+啊
+啐
+啥
+啦
+啪达
+啷当
+喂
+喏
+喔唷
+喽
+嗡
+嗡嗡
+嗬
+嗯
+嗳
+嘎
+嘎登
+嘘
+嘛
+嘻
+嘿
+嘿嘿
+因
+因为
+因了
+因此
+因着
+因而
+固然
+在
+在下
+在于
+地
+基于
+处在
+多
+多么
+多少
+大
+大家
+她
+她们
+好
+如
+如上
+如上所述
+如下
+如何
+如其
+如同
+如是
+如果
+如此
+如若
+始而
+孰料
+孰知
+宁
+宁可
+宁愿
+宁肯
+它
+它们
+对
+对于
+对待
+对方
+对比
+将
+小
+尔
+尔后
+尔尔
+尚且
+就
+就是
+就是了
+就是说
+就算
+就要
+尽
+尽管
+尽管如此
+岂但
+己
+已
+已矣
+巴
+巴巴
+并
+并且
+并非
+庶乎
+庶几
+开外
+开始
+归
+归齐
+当
+当地
+当然
+当着
+彼
+彼时
+彼此
+往
+待
+很
+得
+得了
+怎
+怎么
+怎么办
+怎么样
+怎奈
+怎样
+总之
+总的来看
+总的来说
+总的说来
+总而言之
+恰恰相反
+您
+惟其
+慢说
+我
+我们
+或
+或则
+或是
+或曰
+或者
+截至
+所
+所以
+所在
+所幸
+所有
+才
+才能
+打
+打从
+把
+抑或
+拿
+按
+按照
+换句话说
+换言之
+据
+据此
+接着
+故
+故此
+故而
+旁人
+无
+无宁
+无论
+既
+既往
+既是
+既然
+时候
+是
+是以
+是的
+曾
+替
+替代
+最
+有
+有些
+有关
+有及
+有时
+有的
+望
+朝
+朝着
+本
+本人
+本地
+本着
+本身
+来
+来着
+来自
+来说
+极了
+果然
+果真
+某
+某个
+某些
+某某
+根据
+欤
+正值
+正如
+正巧
+正是
+此
+此地
+此处
+此外
+此时
+此次
+此间
+毋宁
+每
+每当
+比
+比及
+比如
+比方
+没奈何
+沿
+沿着
+漫说
+焉
+然则
+然后
+然而
+照
+照着
+犹且
+犹自
+甚且
+甚么
+甚或
+甚而
+甚至
+甚至于
+用
+用来
+由
+由于
+由是
+由此
+由此可见
+的
+的确
+的话
+直到
+相对而言
+省得
+看
+眨眼
+着
+着呢
+矣
+矣乎
+矣哉
+离
+竟而
+第
+等
+等到
+等等
+简言之
+管
+类如
+紧接着
+纵
+纵令
+纵使
+纵然
+经
+经过
+结果
+给
+继之
+继后
+继而
+综上所述
+罢了
+者
+而
+而且
+而况
+而后
+而外
+而已
+而是
+而言
+能
+能否
+腾
+自
+自个儿
+自从
+自各儿
+自后
+自家
+自己
+自打
+自身
+至
+至于
+至今
+至若
+致
+般的
+若
+若夫
+若是
+若果 
+若非
+莫不然
+莫如
+莫若
+虽
+虽则
+虽然
+虽说
+被
+要
+要不
+要不是
+要不然
+要么
+要是
+譬喻
+譬如
+让
+许多
+论
+设使
+设或
+设若
+诚如
+诚然
+该
+说来
+诸
+诸位
+诸如
+谁
+谁人
+谁料
+谁知
+贼死
+赖以
+赶
+起
+起见
+趁
+趁着
+越是
+距
+跟
+较
+较之
+边
+过
+还
+还是
+还有
+还要
+这
+这一来
+这个
+这么
+这么些
+这么样
+这么点儿
+这些
+这会儿
+这儿
+这就是说
+这时
+这样
+这次
+这般
+这边
+这里
+进而
+连
+连同
+逐步
+通过
+遵循
+遵照
+那
+那个
+那么
+那么些
+那么样
+那些
+那会儿
+那儿
+那时
+那样
+那般
+那边
+那里
+都
+鄙人
+鉴于
+针对
+阿
+除
+除了
+除外
+除开
+除此之外
+除非
+随
+随后
+随时
+随着
+难道说
+非但
+非徒
+非特
+非独
+靠
+顺
+顺着
+首先
+！
+，
+：
+；
+？
+to
+can
+could
+dare
+do
+did
+does
+may
+might
+would
+should
+must
+will
+ought
+shall
+need
+is
+a
+am
+are
+about
+according
+after
+against
+all
+almost
+also
+although
+among
+an
+and
+another
+any
+anything
+approximately
+as
+asked
+at
+back
+because
+before
+besides
+between
+both
+but
+by
+call
+called
+currently
+despite
+did
+do
+dr
+during
+each
+earlier
+eight
+even
+eventually
+every
+everything
+five
+for
+four
+from
+he
+her
+here
+his
+how
+however
+i
+if
+in
+indeed
+instead
+it
+its
+just
+last
+like
+major
+many
+may
+maybe
+meanwhile
+more
+moreover
+most
+mr
+mrs
+ms
+much
+my
+neither
+net
+never
+nevertheless
+nine
+no
+none
+not
+nothing
+now
+of
+on
+once
+one
+only
+or
+other
+our
+over
+partly
+perhaps
+prior
+regarding
+separately
+seven
+several
+she
+should
+similarly
+since
+six
+so
+some
+somehow
+still
+such
+ten
+that
+the
+their
+then
+there
+therefore
+these
+they
+this
+those
+though
+three
+to
+two
+under
+unless
+unlike
+until
+volume
+we
+what
+whatever
+whats
+when
+where
+which
+while
+why
+with
+without
+yesterday
+yet
+you
+your
+aboard
+about
+above
+according to
+across
+afore
+after
+against
+agin
+along
+alongside
+amid
+amidst
+among
+amongst
+anent
+around
+as
+aslant
+astride
+at
+athwart
+bar
+because of
+before
+behind
+below
+beneath
+beside
+besides
+between
+betwixt
+beyond
+but
+by
+circa
+despite
+down
+during
+due to
+ere
+except
+for
+from
+in
+inside
+into
+less
+like
+mid
+midst
+minus
+near
+next
+nigh
+nigher
+nighest
+notwithstanding
+of
+off
+on
+on to
+onto
+out
+out of
+outside
+over
+past
+pending
+per
+plus
+qua
+re
+round
+sans
+save
+since
+through
+throughout
+thru
+till
+to
+toward
+towards
+under
+underneath
+unlike
+until
+unto
+up
+upon
+versus
+via
+vice
+with
+within
+without
+he
+her
+herself
+hers
+him
+himself
+his
+I
+it
+its
+itself
+me
+mine
+my
+myself
+ours
+she
+their
+theirs
+them
+themselves
+they
+us
+we
+our
+ourselves
+you
+your
+yours
+yourselves
+yourself
+this
+that
+these
+those
+"
+'
+''
+(
+)
+*LRB*
+*RRB*
+<dquote>
+<ldquo>
+<lsquo>
+<rdquo>
+<rsquo>
+@
+&
+[
+]
+`
+``
+e.g.,
+{
+}
+&quot;
+&ldquo;
+&rdquo;
+-RRB-
+-LRB-
+--
+a
+about
+above
+across
+after
+afterwards
+again
+against
+all
+almost
+alone
+along
+already
+also
+although
+always
+am
+among
+amongst
+amoungst
+amount
+an
+and
+another
+any
+anyhow
+anyone
+anything
+anyway
+anywhere
+are
+around
+as
+at
+back
+be
+became
+because
+become
+becomes
+becoming
+been
+before
+beforehand
+behind
+being
+below
+beside
+besides
+between
+beyond
+bill
+both
+bottom
+but
+by
+call
+can
+cannot
+cant
+co
+computer
+con
+could
+couldnt
+cry
+de
+describe
+detail
+do
+done
+down
+due
+during
+each
+eg
+eight
+either
+eleven
+else
+elsewhere
+empty
+enough
+etc
+even
+ever
+every
+everyone
+everything
+everywhere
+except
+few
+fifteen
+fify
+fill
+find
+fire
+first
+five
+for
+former
+formerly
+forty
+found
+four
+from
+front
+full
+further
+get
+give
+go
+had
+has
+hasnt
+have
+he
+hence
+her
+here
+hereafter
+hereby
+herein
+hereupon
+hers
+herself
+him
+himself
+his
+how
+however
+hundred
+i
+ie
+if
+in
+inc
+indeed
+interest
+into
+is
+it
+its
+itself
+keep
+last
+latter
+latterly
+least
+less
+ltd
+made
+many
+may
+me
+meanwhile
+might
+mill
+mine
+more
+moreover
+most
+mostly
+move
+much
+must
+my
+myself
+name
+namely
+neither
+never
+nevertheless
+next
+nine
+no
+nobody
+none
+noone
+nor
+not
+nothing
+now
+nowhere
+of
+off
+often
+on
+once
+one
+only
+onto
+or
+other
+others
+otherwise
+our
+ours
+ourselves
+out
+over
+own
+part
+per
+perhaps
+please
+put
+rather
+re
+same
+see
+seem
+seemed
+seeming
+seems
+serious
+several
+she
+should
+show
+side
+since
+sincere
+six
+sixty
+so
+some
+somehow
+someone
+something
+sometime
+sometimes
+somewhere
+still
+such
+system
+take
+ten
+than
+that
+the
+their
+them
+themselves
+then
+thence
+there
+thereafter
+thereby
+therefore
+therein
+thereupon
+these
+they
+thick
+thin
+third
+this
+those
+though
+three
+through
+throughout
+thru
+thus
+to
+together
+too
+top
+toward
+towards
+twelve
+twenty
+two
+un
+under
+until
+up
+upon
+us
+very
+via
+was
+we
+well
+were
+what
+whatever
+when
+whence
+whenever
+where
+whereafter
+whereas
+whereby
+wherein
+whereupon
+wherever
+whether
+which
+while
+whither
+who
+whoever
+whole
+whom
+whose
+why
+will
+with
+within
+without
+would
+yet
+you
+your
+yours
+yourself
+yourselves
+ 
+	
+:
+/
+（
+>
+）
+<
+!
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/user.dict.utf8 b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/user.dict.utf8
new file mode 100644
index 0000000000..f4a1a4b8db
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/dict/user.dict.utf8
@@ -0,0 +1,10 @@
+云计算
+区块链 10 nz
+机器学习 10 n
+深度学习 10 n
+神经网络 10 n
+人工智能 10 n
+数据挖掘 10 n
+自然语言处理 10 n
+大模型 10 n
+大语言模型 10 n
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/DictTrie.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/DictTrie.hpp
new file mode 100644
index 0000000000..ea8916c1f6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/DictTrie.hpp
@@ -0,0 +1,280 @@
+#ifndef CPPJIEBA_DICT_TRIE_HPP
+#define CPPJIEBA_DICT_TRIE_HPP
+
+#include <algorithm>
+#include <fstream>
+#include <cstring>
+#include <cstdlib>
+#include <cmath>
+#include <deque>
+#include <set>
+#include <string>
+#include <unordered_set>
+#include "limonp/StringUtil.hpp"
+#include "limonp/Logging.hpp"
+#include "Unicode.hpp"
+#include "Trie.hpp"
+
+namespace cppjieba {
+
+const double MIN_DOUBLE = -3.14e+100;
+const double MAX_DOUBLE = 3.14e+100;
+const size_t DICT_COLUMN_NUM = 3;
+const char* const UNKNOWN_TAG = "";
+
+class DictTrie {
+ public:
+  enum UserWordWeightOption {
+    WordWeightMin,
+    WordWeightMedian,
+    WordWeightMax,
+  }; // enum UserWordWeightOption
+
+  DictTrie(const std::string& dict_path, const std::string& user_dict_paths = "", UserWordWeightOption user_word_weight_opt = WordWeightMedian) {
+    Init(dict_path, user_dict_paths, user_word_weight_opt);
+  }
+
+  ~DictTrie() {
+    delete trie_;
+  }
+
+  bool InsertUserWord(const std::string& word, const std::string& tag = UNKNOWN_TAG) {
+    DictUnit node_info;
+    if (!MakeNodeInfo(node_info, word, user_word_default_weight_, tag)) {
+      return false;
+    }
+    active_node_infos_.push_back(node_info);
+    trie_->InsertNode(node_info.word, &active_node_infos_.back());
+    return true;
+  }
+
+  bool InsertUserWord(const std::string& word,int freq, const std::string& tag = UNKNOWN_TAG) {
+    DictUnit node_info;
+    double weight = freq ? log(1.0 * freq / freq_sum_) : user_word_default_weight_ ;
+    if (!MakeNodeInfo(node_info, word, weight , tag)) {
+      return false;
+    }
+    active_node_infos_.push_back(node_info);
+    trie_->InsertNode(node_info.word, &active_node_infos_.back());
+    return true;
+  }
+
+  bool DeleteUserWord(const std::string& word, const std::string& tag = UNKNOWN_TAG) {
+    DictUnit node_info;
+    if (!MakeNodeInfo(node_info, word, user_word_default_weight_, tag)) {
+      return false;
+    }
+    trie_->DeleteNode(node_info.word, &node_info);
+    return true;
+  }
+
+  const DictUnit* Find(RuneStrArray::const_iterator begin, RuneStrArray::const_iterator end) const {
+    return trie_->Find(begin, end);
+  }
+
+  void Find(RuneStrArray::const_iterator begin,
+        RuneStrArray::const_iterator end,
+        std::vector<struct Dag>&res,
+        size_t max_word_len = MAX_WORD_LENGTH) const {
+    trie_->Find(begin, end, res, max_word_len);
+  }
+
+  bool Find(const std::string& word)
+  {
+    const DictUnit *tmp = NULL;
+    RuneStrArray runes;
+    if (!DecodeUTF8RunesInString(word, runes))
+    {
+      XLOG(ERROR) << "Decode failed.";
+    }
+    tmp = Find(runes.begin(), runes.end());
+    if (tmp == NULL)
+    {
+      return false;
+    }
+    else
+    {
+      return true;
+    }
+  }
+
+  bool IsUserDictSingleChineseWord(const Rune& word) const {
+    return IsIn(user_dict_single_chinese_word_, word);
+  }
+
+  double GetMinWeight() const {
+    return min_weight_;
+  }
+
+  void InserUserDictNode(const std::string& line) {
+    std::vector<std::string> buf;
+    DictUnit node_info;
+    limonp::Split(line, buf, " ");
+    if(buf.size() == 1){
+          MakeNodeInfo(node_info,
+                buf[0],
+                user_word_default_weight_,
+                UNKNOWN_TAG);
+        } else if (buf.size() == 2) {
+          MakeNodeInfo(node_info,
+                buf[0],
+                user_word_default_weight_,
+                buf[1]);
+        } else if (buf.size() == 3) {
+          int freq = atoi(buf[1].c_str());
+          assert(freq_sum_ > 0.0);
+          double weight = log(1.0 * freq / freq_sum_);
+          MakeNodeInfo(node_info, buf[0], weight, buf[2]);
+        }
+        static_node_infos_.push_back(node_info);
+        if (node_info.word.size() == 1) {
+          user_dict_single_chinese_word_.insert(node_info.word[0]);
+        }
+  }
+
+  void LoadUserDict(const std::vector<std::string>& buf) {
+    for (size_t i = 0; i < buf.size(); i++) {
+      InserUserDictNode(buf[i]);
+    }
+  }
+
+   void LoadUserDict(const std::set<std::string>& buf) {
+    std::set<std::string>::const_iterator iter;
+    for (iter = buf.begin(); iter != buf.end(); iter++){
+      InserUserDictNode(*iter);
+    }
+  }
+
+  void LoadUserDict(const std::string& filePaths) {
+    std::vector<std::string> files = limonp::Split(filePaths, "|;");
+    for (size_t i = 0; i < files.size(); i++) {
+      std::ifstream ifs(files[i].c_str());
+      XCHECK(ifs.is_open()) << "open " << files[i] << " failed";
+      std::string line;
+
+      while(getline(ifs, line)) {
+        if (line.size() == 0) {
+          continue;
+        }
+        InserUserDictNode(line);
+      }
+    }
+  }
+
+
+ private:
+  void Init(const std::string& dict_path, const std::string& user_dict_paths, UserWordWeightOption user_word_weight_opt) {
+    LoadDict(dict_path);
+    freq_sum_ = CalcFreqSum(static_node_infos_);
+    CalculateWeight(static_node_infos_, freq_sum_);
+    SetStaticWordWeights(user_word_weight_opt);
+
+    if (user_dict_paths.size()) {
+      LoadUserDict(user_dict_paths);
+    }
+    Shrink(static_node_infos_);
+    CreateTrie(static_node_infos_);
+  }
+
+  void CreateTrie(const std::vector<DictUnit>& dictUnits) {
+    assert(dictUnits.size());
+    std::vector<Unicode> words;
+    std::vector<const DictUnit*> valuePointers;
+    for (size_t i = 0 ; i < dictUnits.size(); i ++) {
+      words.push_back(dictUnits[i].word);
+      valuePointers.push_back(&dictUnits[i]);
+    }
+
+    trie_ = new Trie(words, valuePointers);
+  }
+
+  bool MakeNodeInfo(DictUnit& node_info,
+        const std::string& word,
+        double weight,
+        const std::string& tag) {
+    if (!DecodeUTF8RunesInString(word, node_info.word)) {
+      XLOG(ERROR) << "UTF-8 decode failed for dict word: " << word;
+      return false;
+    }
+    node_info.weight = weight;
+    node_info.tag = tag;
+    return true;
+  }
+
+  void LoadDict(const std::string& filePath) {
+    std::ifstream ifs(filePath.c_str());
+    XCHECK(ifs.is_open()) << "open " << filePath << " failed.";
+    std::string line;
+    std::vector<std::string> buf;
+
+    DictUnit node_info;
+    while (getline(ifs, line)) {
+      limonp::Split(line, buf, " ");
+      XCHECK(buf.size() == DICT_COLUMN_NUM) << "split result illegal, line:" << line;
+      MakeNodeInfo(node_info,
+            buf[0],
+            atof(buf[1].c_str()),
+            buf[2]);
+      static_node_infos_.push_back(node_info);
+    }
+  }
+
+  static bool WeightCompare(const DictUnit& lhs, const DictUnit& rhs) {
+    return lhs.weight < rhs.weight;
+  }
+
+  void SetStaticWordWeights(UserWordWeightOption option) {
+    XCHECK(!static_node_infos_.empty());
+    std::vector<DictUnit> x = static_node_infos_;
+    std::sort(x.begin(), x.end(), WeightCompare);
+    min_weight_ = x[0].weight;
+    max_weight_ = x[x.size() - 1].weight;
+    median_weight_ = x[x.size() / 2].weight;
+    switch (option) {
+     case WordWeightMin:
+       user_word_default_weight_ = min_weight_;
+       break;
+     case WordWeightMedian:
+       user_word_default_weight_ = median_weight_;
+       break;
+     default:
+       user_word_default_weight_ = max_weight_;
+       break;
+    }
+  }
+
+  double CalcFreqSum(const std::vector<DictUnit>& node_infos) const {
+    double sum = 0.0;
+    for (size_t i = 0; i < node_infos.size(); i++) {
+      sum += node_infos[i].weight;
+    }
+    return sum;
+  }
+
+  void CalculateWeight(std::vector<DictUnit>& node_infos, double sum) const {
+    assert(sum > 0.0);
+    for (size_t i = 0; i < node_infos.size(); i++) {
+      DictUnit& node_info = node_infos[i];
+      assert(node_info.weight > 0.0);
+      node_info.weight = log(double(node_info.weight)/sum);
+    }
+  }
+
+  void Shrink(std::vector<DictUnit>& units) const {
+    std::vector<DictUnit>(units.begin(), units.end()).swap(units);
+  }
+
+  std::vector<DictUnit> static_node_infos_;
+  std::deque<DictUnit> active_node_infos_; // must not be std::vector
+  Trie * trie_;
+
+  double freq_sum_;
+  double min_weight_;
+  double max_weight_;
+  double median_weight_;
+  double user_word_default_weight_;
+  std::unordered_set<Rune> user_dict_single_chinese_word_;
+};
+}
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/FullSegment.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/FullSegment.hpp
new file mode 100644
index 0000000000..79d5211ef4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/FullSegment.hpp
@@ -0,0 +1,93 @@
+#ifndef CPPJIEBA_FULLSEGMENT_H
+#define CPPJIEBA_FULLSEGMENT_H
+
+#include <algorithm>
+#include <set>
+#include <cassert>
+#include "limonp/Logging.hpp"
+#include "DictTrie.hpp"
+#include "SegmentBase.hpp"
+#include "Unicode.hpp"
+
+namespace cppjieba {
+class FullSegment: public SegmentBase {
+ public:
+  FullSegment(const string& dictPath) {
+    dictTrie_ = new DictTrie(dictPath);
+    isNeedDestroy_ = true;
+  }
+  FullSegment(const DictTrie* dictTrie)
+    : dictTrie_(dictTrie), isNeedDestroy_(false) {
+    assert(dictTrie_);
+  }
+  ~FullSegment() {
+    if (isNeedDestroy_) {
+      delete dictTrie_;
+    }
+  }
+  void Cut(const string& sentence, 
+        vector<string>& words) const {
+    vector<Word> tmp;
+    Cut(sentence, tmp);
+    GetStringsFromWords(tmp, words);
+  }
+  void Cut(const string& sentence, 
+        vector<Word>& words) const {
+    PreFilter pre_filter(symbols_, sentence);
+    PreFilter::Range range;
+    vector<WordRange> wrs;
+    wrs.reserve(sentence.size()/2);
+    while (pre_filter.HasNext()) {
+      range = pre_filter.Next();
+      Cut(range.begin, range.end, wrs);
+    }
+    words.clear();
+    words.reserve(wrs.size());
+    GetWordsFromWordRanges(sentence, wrs, words);
+  }
+  void Cut(RuneStrArray::const_iterator begin, 
+        RuneStrArray::const_iterator end, 
+        vector<WordRange>& res) const {
+    // result of searching in trie tree
+    LocalVector<pair<size_t, const DictUnit*> > tRes;
+
+    // max index of res's words
+    size_t maxIdx = 0;
+
+    // always equals to (uItr - begin)
+    size_t uIdx = 0;
+
+    // tmp variables
+    size_t wordLen = 0;
+    assert(dictTrie_);
+    vector<struct Dag> dags;
+    dictTrie_->Find(begin, end, dags);
+    for (size_t i = 0; i < dags.size(); i++) {
+      for (size_t j = 0; j < dags[i].nexts.size(); j++) {
+        size_t nextoffset = dags[i].nexts[j].first;
+        assert(nextoffset < dags.size());
+        const DictUnit* du = dags[i].nexts[j].second;
+        if (du == NULL) {
+          if (dags[i].nexts.size() == 1 && maxIdx <= uIdx) {
+            WordRange wr(begin + i, begin + nextoffset);
+            res.push_back(wr);
+          }
+        } else {
+          wordLen = du->word.size();
+          if (wordLen >= 2 || (dags[i].nexts.size() == 1 && maxIdx <= uIdx)) {
+            WordRange wr(begin + i, begin + nextoffset);
+            res.push_back(wr);
+          }
+        }
+        maxIdx = uIdx + wordLen > maxIdx ? uIdx + wordLen : maxIdx;
+      }
+      uIdx++;
+    }
+  }
+ private:
+  const DictTrie* dictTrie_;
+  bool isNeedDestroy_;
+};
+}
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/HMMModel.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/HMMModel.hpp
new file mode 100644
index 0000000000..3921faafd4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/HMMModel.hpp
@@ -0,0 +1,129 @@
+#ifndef CPPJIEBA_HMMMODEL_H
+#define CPPJIEBA_HMMMODEL_H
+
+#include "limonp/StringUtil.hpp"
+#include "Trie.hpp"
+
+namespace cppjieba {
+
+using namespace limonp;
+typedef unordered_map<Rune, double> EmitProbMap;
+
+struct HMMModel {
+  /*
+   * STATUS:
+   * 0: HMMModel::B, 1: HMMModel::E, 2: HMMModel::M, 3:HMMModel::S
+   * */
+  enum {B = 0, E = 1, M = 2, S = 3, STATUS_SUM = 4};
+
+  HMMModel(const string& modelPath) {
+    memset(startProb, 0, sizeof(startProb));
+    memset(transProb, 0, sizeof(transProb));
+    statMap[0] = 'B';
+    statMap[1] = 'E';
+    statMap[2] = 'M';
+    statMap[3] = 'S';
+    emitProbVec.push_back(&emitProbB);
+    emitProbVec.push_back(&emitProbE);
+    emitProbVec.push_back(&emitProbM);
+    emitProbVec.push_back(&emitProbS);
+    LoadModel(modelPath);
+  }
+  ~HMMModel() {
+  }
+  void LoadModel(const string& filePath) {
+    ifstream ifile(filePath.c_str());
+    XCHECK(ifile.is_open()) << "open " << filePath << " failed";
+    string line;
+    vector<string> tmp;
+    vector<string> tmp2;
+    //Load startProb
+    XCHECK(GetLine(ifile, line));
+    Split(line, tmp, " ");
+    XCHECK(tmp.size() == STATUS_SUM);
+    for (size_t j = 0; j< tmp.size(); j++) {
+      startProb[j] = atof(tmp[j].c_str());
+    }
+
+    //Load transProb
+    for (size_t i = 0; i < STATUS_SUM; i++) {
+      XCHECK(GetLine(ifile, line));
+      Split(line, tmp, " ");
+      XCHECK(tmp.size() == STATUS_SUM);
+      for (size_t j =0; j < STATUS_SUM; j++) {
+        transProb[i][j] = atof(tmp[j].c_str());
+      }
+    }
+
+    //Load emitProbB
+    XCHECK(GetLine(ifile, line));
+    XCHECK(LoadEmitProb(line, emitProbB));
+
+    //Load emitProbE
+    XCHECK(GetLine(ifile, line));
+    XCHECK(LoadEmitProb(line, emitProbE));
+
+    //Load emitProbM
+    XCHECK(GetLine(ifile, line));
+    XCHECK(LoadEmitProb(line, emitProbM));
+
+    //Load emitProbS
+    XCHECK(GetLine(ifile, line));
+    XCHECK(LoadEmitProb(line, emitProbS));
+  }
+  double GetEmitProb(const EmitProbMap* ptMp, Rune key, 
+        double defVal)const {
+    EmitProbMap::const_iterator cit = ptMp->find(key);
+    if (cit == ptMp->end()) {
+      return defVal;
+    }
+    return cit->second;
+  }
+  bool GetLine(ifstream& ifile, string& line) {
+    while (getline(ifile, line)) {
+      Trim(line);
+      if (line.empty()) {
+        continue;
+      }
+      if (StartsWith(line, "#")) {
+        continue;
+      }
+      return true;
+    }
+    return false;
+  }
+  bool LoadEmitProb(const string& line, EmitProbMap& mp) {
+    if (line.empty()) {
+      return false;
+    }
+    vector<string> tmp, tmp2;
+    Unicode unicode;
+    Split(line, tmp, ",");
+    for (size_t i = 0; i < tmp.size(); i++) {
+      Split(tmp[i], tmp2, ":");
+      if (2 != tmp2.size()) {
+        XLOG(ERROR) << "emitProb illegal.";
+        return false;
+      }
+      if (!DecodeUTF8RunesInString(tmp2[0], unicode) || unicode.size() != 1) {
+        XLOG(ERROR) << "TransCode failed.";
+        return false;
+      }
+      mp[unicode[0]] = atof(tmp2[1].c_str());
+    }
+    return true;
+  }
+
+  char statMap[STATUS_SUM];
+  double startProb[STATUS_SUM];
+  double transProb[STATUS_SUM][STATUS_SUM];
+  EmitProbMap emitProbB;
+  EmitProbMap emitProbE;
+  EmitProbMap emitProbM;
+  EmitProbMap emitProbS;
+  vector<EmitProbMap* > emitProbVec;
+}; // struct HMMModel
+
+} // namespace cppjieba
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/HMMSegment.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/HMMSegment.hpp
new file mode 100644
index 0000000000..d515c049c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/HMMSegment.hpp
@@ -0,0 +1,190 @@
+#ifndef CPPJIBEA_HMMSEGMENT_H
+#define CPPJIBEA_HMMSEGMENT_H
+
+#include <iostream>
+#include <fstream>
+#include <memory.h>
+#include <cassert>
+#include "HMMModel.hpp"
+#include "SegmentBase.hpp"
+
+namespace cppjieba {
+class HMMSegment: public SegmentBase {
+ public:
+  HMMSegment(const string& filePath)
+  : model_(new HMMModel(filePath)), isNeedDestroy_(true) {
+  }
+  HMMSegment(const HMMModel* model) 
+  : model_(model), isNeedDestroy_(false) {
+  }
+  ~HMMSegment() {
+    if (isNeedDestroy_) {
+      delete model_;
+    }
+  }
+
+  void Cut(const string& sentence, 
+        vector<string>& words) const {
+    vector<Word> tmp;
+    Cut(sentence, tmp);
+    GetStringsFromWords(tmp, words);
+  }
+  void Cut(const string& sentence, 
+        vector<Word>& words) const {
+    PreFilter pre_filter(symbols_, sentence);
+    PreFilter::Range range;
+    vector<WordRange> wrs;
+    wrs.reserve(sentence.size()/2);
+    while (pre_filter.HasNext()) {
+      range = pre_filter.Next();
+      Cut(range.begin, range.end, wrs);
+    }
+    words.clear();
+    words.reserve(wrs.size());
+    GetWordsFromWordRanges(sentence, wrs, words);
+  }
+  void Cut(RuneStrArray::const_iterator begin, RuneStrArray::const_iterator end, vector<WordRange>& res) const {
+    RuneStrArray::const_iterator left = begin;
+    RuneStrArray::const_iterator right = begin;
+    while (right != end) {
+      if (right->rune < 0x80) {
+        if (left != right) {
+          InternalCut(left, right, res);
+        }
+        left = right;
+        do {
+          right = SequentialLetterRule(left, end);
+          if (right != left) {
+            break;
+          }
+          right = NumbersRule(left, end);
+          if (right != left) {
+            break;
+          }
+          right ++;
+        } while (false);
+        WordRange wr(left, right - 1);
+        res.push_back(wr);
+        left = right;
+      } else {
+        right++;
+      }
+    }
+    if (left != right) {
+      InternalCut(left, right, res);
+    }
+  }
+ private:
+  // sequential letters rule
+  RuneStrArray::const_iterator SequentialLetterRule(RuneStrArray::const_iterator begin, RuneStrArray::const_iterator end) const {
+    Rune x = begin->rune;
+    if (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z')) {
+      begin ++;
+    } else {
+      return begin;
+    }
+    while (begin != end) {
+      x = begin->rune;
+      if (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z') || ('0' <= x && x <= '9')) {
+        begin ++;
+      } else {
+        break;
+      }
+    }
+    return begin;
+  }
+  //
+  RuneStrArray::const_iterator NumbersRule(RuneStrArray::const_iterator begin, RuneStrArray::const_iterator end) const {
+    Rune x = begin->rune;
+    if ('0' <= x && x <= '9') {
+      begin ++;
+    } else {
+      return begin;
+    }
+    while (begin != end) {
+      x = begin->rune;
+      if ( ('0' <= x && x <= '9') || x == '.') {
+        begin++;
+      } else {
+        break;
+      }
+    }
+    return begin;
+  }
+  void InternalCut(RuneStrArray::const_iterator begin, RuneStrArray::const_iterator end, vector<WordRange>& res) const {
+    vector<size_t> status;
+    Viterbi(begin, end, status);
+
+    RuneStrArray::const_iterator left = begin;
+    RuneStrArray::const_iterator right;
+    for (size_t i = 0; i < status.size(); i++) {
+      if (status[i] % 2) { //if (HMMModel::E == status[i] || HMMModel::S == status[i])
+        right = begin + i + 1;
+        WordRange wr(left, right - 1);
+        res.push_back(wr);
+        left = right;
+      }
+    }
+  }
+
+  void Viterbi(RuneStrArray::const_iterator begin, 
+        RuneStrArray::const_iterator end, 
+        vector<size_t>& status) const {
+    size_t Y = HMMModel::STATUS_SUM;
+    size_t X = end - begin;
+
+    size_t XYSize = X * Y;
+    size_t now, old, stat;
+    double tmp, endE, endS;
+
+    vector<int> path(XYSize);
+    vector<double> weight(XYSize);
+
+    //start
+    for (size_t y = 0; y < Y; y++) {
+      weight[0 + y * X] = model_->startProb[y] + model_->GetEmitProb(model_->emitProbVec[y], begin->rune, MIN_DOUBLE);
+      path[0 + y * X] = -1;
+    }
+
+    double emitProb;
+
+    for (size_t x = 1; x < X; x++) {
+      for (size_t y = 0; y < Y; y++) {
+        now = x + y*X;
+        weight[now] = MIN_DOUBLE;
+        path[now] = HMMModel::E; // warning
+        emitProb = model_->GetEmitProb(model_->emitProbVec[y], (begin+x)->rune, MIN_DOUBLE);
+        for (size_t preY = 0; preY < Y; preY++) {
+          old = x - 1 + preY * X;
+          tmp = weight[old] + model_->transProb[preY][y] + emitProb;
+          if (tmp > weight[now]) {
+            weight[now] = tmp;
+            path[now] = preY;
+          }
+        }
+      }
+    }
+
+    endE = weight[X-1+HMMModel::E*X];
+    endS = weight[X-1+HMMModel::S*X];
+    stat = 0;
+    if (endE >= endS) {
+      stat = HMMModel::E;
+    } else {
+      stat = HMMModel::S;
+    }
+
+    status.resize(X);
+    for (int x = X -1 ; x >= 0; x--) {
+      status[x] = stat;
+      stat = path[x + stat*X];
+    }
+  }
+
+  const HMMModel* model_;
+  bool isNeedDestroy_;
+}; // class HMMSegment
+
+} // namespace cppjieba
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/Jieba.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/Jieba.hpp
new file mode 100644
index 0000000000..01fea361b3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/Jieba.hpp
@@ -0,0 +1,169 @@
+#ifndef CPPJIEAB_JIEBA_H
+#define CPPJIEAB_JIEBA_H
+
+#include "QuerySegment.hpp"
+#include "KeywordExtractor.hpp"
+
+namespace cppjieba {
+
+class Jieba {
+ public:
+  Jieba(const string& dict_path = "", 
+        const string& model_path = "",
+        const string& user_dict_path = "", 
+        const string& idf_path = "", 
+        const string& stop_word_path = "") 
+    : dict_trie_(getPath(dict_path, "jieba.dict.utf8"), getPath(user_dict_path, "user.dict.utf8")),
+      model_(getPath(model_path, "hmm_model.utf8")),
+      mp_seg_(&dict_trie_),
+      hmm_seg_(&model_),
+      mix_seg_(&dict_trie_, &model_),
+      full_seg_(&dict_trie_),
+      query_seg_(&dict_trie_, &model_),
+      extractor(&dict_trie_, &model_, 
+                getPath(idf_path, "idf.utf8"), 
+                getPath(stop_word_path, "stop_words.utf8")) {
+  }
+  ~Jieba() {
+  }
+
+  struct LocWord {
+    string word;
+    size_t begin;
+    size_t end;
+  }; // struct LocWord
+
+  void Cut(const string& sentence, vector<string>& words, bool hmm = true) const {
+    mix_seg_.Cut(sentence, words, hmm);
+  }
+  void Cut(const string& sentence, vector<Word>& words, bool hmm = true) const {
+    mix_seg_.Cut(sentence, words, hmm);
+  }
+  void CutAll(const string& sentence, vector<string>& words) const {
+    full_seg_.Cut(sentence, words);
+  }
+  void CutAll(const string& sentence, vector<Word>& words) const {
+    full_seg_.Cut(sentence, words);
+  }
+  void CutForSearch(const string& sentence, vector<string>& words, bool hmm = true) const {
+    query_seg_.Cut(sentence, words, hmm);
+  }
+  void CutForSearch(const string& sentence, vector<Word>& words, bool hmm = true) const {
+    query_seg_.Cut(sentence, words, hmm);
+  }
+  void CutHMM(const string& sentence, vector<string>& words) const {
+    hmm_seg_.Cut(sentence, words);
+  }
+  void CutHMM(const string& sentence, vector<Word>& words) const {
+    hmm_seg_.Cut(sentence, words);
+  }
+  void CutSmall(const string& sentence, vector<string>& words, size_t max_word_len) const {
+    mp_seg_.Cut(sentence, words, max_word_len);
+  }
+  void CutSmall(const string& sentence, vector<Word>& words, size_t max_word_len) const {
+    mp_seg_.Cut(sentence, words, max_word_len);
+  }
+  
+  void Tag(const string& sentence, vector<pair<string, string> >& words) const {
+    mix_seg_.Tag(sentence, words);
+  }
+  string LookupTag(const string &str) const {
+    return mix_seg_.LookupTag(str);
+  }
+  bool InsertUserWord(const string& word, const string& tag = UNKNOWN_TAG) {
+    return dict_trie_.InsertUserWord(word, tag);
+  }
+
+  bool InsertUserWord(const string& word,int freq, const string& tag = UNKNOWN_TAG) {
+    return dict_trie_.InsertUserWord(word,freq, tag);
+  }
+
+  bool DeleteUserWord(const string& word, const string& tag = UNKNOWN_TAG) {
+    return dict_trie_.DeleteUserWord(word, tag);
+  }
+  
+  bool Find(const string& word)
+  {
+    return dict_trie_.Find(word);
+  }
+
+  void ResetSeparators(const string& s) {
+    //TODO
+    mp_seg_.ResetSeparators(s);
+    hmm_seg_.ResetSeparators(s);
+    mix_seg_.ResetSeparators(s);
+    full_seg_.ResetSeparators(s);
+    query_seg_.ResetSeparators(s);
+  }
+
+  const DictTrie* GetDictTrie() const {
+    return &dict_trie_;
+  } 
+  
+  const HMMModel* GetHMMModel() const {
+    return &model_;
+  }
+
+  void LoadUserDict(const vector<string>& buf)  {
+    dict_trie_.LoadUserDict(buf);
+  }
+
+  void LoadUserDict(const set<string>& buf)  {
+    dict_trie_.LoadUserDict(buf);
+  }
+
+  void LoadUserDict(const string& path)  {
+    dict_trie_.LoadUserDict(path);
+  }
+
+ private:
+  static string pathJoin(const string& dir, const string& filename) {
+    if (dir.empty()) {
+        return filename;
+    }
+    
+    char last_char = dir[dir.length() - 1];
+    if (last_char == '/' || last_char == '\\') {
+        return dir + filename;
+    } else {
+        #ifdef _WIN32
+        return dir + '\\' + filename;
+        #else
+        return dir + '/' + filename;
+        #endif
+    }
+  }
+
+  static string getCurrentDirectory() {
+    string path(__FILE__);
+    size_t pos = path.find_last_of("/\\");
+    return (pos == string::npos) ? "" : path.substr(0, pos);
+  }
+
+  static string getPath(const string& path, const string& default_file) {
+    if (path.empty()) {
+      string current_dir = getCurrentDirectory();
+      string parent_dir = current_dir.substr(0, current_dir.find_last_of("/\\"));
+      string grandparent_dir = parent_dir.substr(0, parent_dir.find_last_of("/\\"));
+      return pathJoin(pathJoin(grandparent_dir, "dict"), default_file);
+    }
+    return path;
+  }
+
+  DictTrie dict_trie_;
+  HMMModel model_;
+  
+  // They share the same dict trie and model
+  MPSegment mp_seg_;
+  HMMSegment hmm_seg_;
+  MixSegment mix_seg_;
+  FullSegment full_seg_;
+  QuerySegment query_seg_;
+
+ public:
+  KeywordExtractor extractor;
+}; // class Jieba
+
+} // namespace cppjieba
+
+#endif // CPPJIEAB_JIEBA_H
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/KeywordExtractor.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/KeywordExtractor.hpp
new file mode 100644
index 0000000000..24b2c40978
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/KeywordExtractor.hpp
@@ -0,0 +1,149 @@
+#ifndef CPPJIEBA_KEYWORD_EXTRACTOR_H
+#define CPPJIEBA_KEYWORD_EXTRACTOR_H
+
+#include <algorithm>
+#include <unordered_map>
+#include <unordered_set>
+#include "MixSegment.hpp"
+
+namespace cppjieba {
+
+/*utf8*/
+class KeywordExtractor {
+ public:
+  struct Word {
+    std::string word;
+    std::vector<size_t> offsets;
+    double weight;
+  }; // struct Word
+
+  KeywordExtractor(const std::string& dictPath, 
+        const std::string& hmmFilePath, 
+        const std::string& idfPath, 
+        const std::string& stopWordPath, 
+        const std::string& userDict = "") 
+    : segment_(dictPath, hmmFilePath, userDict) {
+    LoadIdfDict(idfPath);
+    LoadStopWordDict(stopWordPath);
+  }
+  KeywordExtractor(const DictTrie* dictTrie, 
+        const HMMModel* model,
+        const std::string& idfPath, 
+        const std::string& stopWordPath) 
+    : segment_(dictTrie, model) {
+    LoadIdfDict(idfPath);
+    LoadStopWordDict(stopWordPath);
+  }
+  ~KeywordExtractor() {
+  }
+
+  void Extract(const std::string& sentence, std::vector<std::string>& keywords, size_t topN) const {
+    std::vector<Word> topWords;
+    Extract(sentence, topWords, topN);
+    for (size_t i = 0; i < topWords.size(); i++) {
+      keywords.push_back(topWords[i].word);
+    }
+  }
+
+  void Extract(const std::string& sentence, std::vector<pair<std::string, double> >& keywords, size_t topN) const {
+    std::vector<Word> topWords;
+    Extract(sentence, topWords, topN);
+    for (size_t i = 0; i < topWords.size(); i++) {
+      keywords.push_back(pair<std::string, double>(topWords[i].word, topWords[i].weight));
+    }
+  }
+
+  void Extract(const std::string& sentence, std::vector<Word>& keywords, size_t topN) const {
+    std::vector<std::string> words;
+    segment_.Cut(sentence, words);
+
+    std::map<std::string, Word> wordmap;
+    size_t offset = 0;
+    for (size_t i = 0; i < words.size(); ++i) {
+      size_t t = offset;
+      offset += words[i].size();
+      if (IsSingleWord(words[i]) || stopWords_.find(words[i]) != stopWords_.end()) {
+        continue;
+      }
+      wordmap[words[i]].offsets.push_back(t);
+      wordmap[words[i]].weight += 1.0;
+    }
+    if (offset != sentence.size()) {
+      XLOG(ERROR) << "words illegal";
+      return;
+    }
+
+    keywords.clear();
+    keywords.reserve(wordmap.size());
+    for (std::map<std::string, Word>::iterator itr = wordmap.begin(); itr != wordmap.end(); ++itr) {
+      std::unordered_map<std::string, double>::const_iterator cit = idfMap_.find(itr->first);
+      if (cit != idfMap_.end()) {
+        itr->second.weight *= cit->second;
+      } else {
+        itr->second.weight *= idfAverage_;
+      }
+      itr->second.word = itr->first;
+      keywords.push_back(itr->second);
+    }
+    topN = min(topN, keywords.size());
+    std::partial_sort(keywords.begin(), keywords.begin() + topN, keywords.end(), Compare);
+    keywords.resize(topN);
+  }
+ private:
+  void LoadIdfDict(const std::string& idfPath) {
+    std::ifstream ifs(idfPath.c_str());
+    XCHECK(ifs.is_open()) << "open " << idfPath << " failed";
+    std::string line ;
+    std::vector<std::string> buf;
+    double idf = 0.0;
+    double idfSum = 0.0;
+    size_t lineno = 0;
+    for (; getline(ifs, line); lineno++) {
+      buf.clear();
+      if (line.empty()) {
+        XLOG(ERROR) << "lineno: " << lineno << " empty. skipped.";
+        continue;
+      }
+      limonp::Split(line, buf, " ");
+      if (buf.size() != 2) {
+        XLOG(ERROR) << "line: " << line << ", lineno: " << lineno << " empty. skipped.";
+        continue;
+      }
+      idf = atof(buf[1].c_str());
+      idfMap_[buf[0]] = idf;
+      idfSum += idf;
+
+    }
+
+    assert(lineno);
+    idfAverage_ = idfSum / lineno;
+    assert(idfAverage_ > 0.0);
+  }
+  void LoadStopWordDict(const std::string& filePath) {
+    std::ifstream ifs(filePath.c_str());
+    XCHECK(ifs.is_open()) << "open " << filePath << " failed";
+    std::string line ;
+    while (getline(ifs, line)) {
+      stopWords_.insert(line);
+    }
+    assert(stopWords_.size());
+  }
+
+  static bool Compare(const Word& lhs, const Word& rhs) {
+    return lhs.weight > rhs.weight;
+  }
+
+  MixSegment segment_;
+  std::unordered_map<std::string, double> idfMap_;
+  double idfAverage_;
+
+  std::unordered_set<std::string> stopWords_;
+}; // class KeywordExtractor
+
+inline std::ostream& operator << (std::ostream& os, const KeywordExtractor::Word& word) {
+  return os << "{\"word\": \"" << word.word << "\", \"offset\": " << word.offsets << ", \"weight\": " << word.weight << "}"; 
+}
+
+} // namespace cppjieba
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/MPSegment.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/MPSegment.hpp
new file mode 100644
index 0000000000..bcbfaba6ca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/MPSegment.hpp
@@ -0,0 +1,137 @@
+#ifndef CPPJIEBA_MPSEGMENT_H
+#define CPPJIEBA_MPSEGMENT_H
+
+#include <algorithm>
+#include <set>
+#include <cassert>
+#include "limonp/Logging.hpp"
+#include "DictTrie.hpp"
+#include "SegmentTagged.hpp"
+#include "PosTagger.hpp"
+
+namespace cppjieba {
+
+class MPSegment: public SegmentTagged {
+ public:
+  MPSegment(const string& dictPath, const string& userDictPath = "")
+    : dictTrie_(new DictTrie(dictPath, userDictPath)), isNeedDestroy_(true) {
+  }
+  MPSegment(const DictTrie* dictTrie)
+    : dictTrie_(dictTrie), isNeedDestroy_(false) {
+    assert(dictTrie_);
+  }
+  ~MPSegment() {
+    if (isNeedDestroy_) {
+      delete dictTrie_;
+    }
+  }
+
+  void Cut(const string& sentence, vector<string>& words) const {
+    Cut(sentence, words, MAX_WORD_LENGTH);
+  }
+
+  void Cut(const string& sentence,
+        vector<string>& words,
+        size_t max_word_len) const {
+    vector<Word> tmp;
+    Cut(sentence, tmp, max_word_len);
+    GetStringsFromWords(tmp, words);
+  }
+  void Cut(const string& sentence, 
+        vector<Word>& words, 
+        size_t max_word_len = MAX_WORD_LENGTH) const {
+    PreFilter pre_filter(symbols_, sentence);
+    PreFilter::Range range;
+    vector<WordRange> wrs;
+    wrs.reserve(sentence.size()/2);
+    while (pre_filter.HasNext()) {
+      range = pre_filter.Next();
+      Cut(range.begin, range.end, wrs, max_word_len);
+    }
+    words.clear();
+    words.reserve(wrs.size());
+    GetWordsFromWordRanges(sentence, wrs, words);
+  }
+  void Cut(RuneStrArray::const_iterator begin,
+           RuneStrArray::const_iterator end,
+           vector<WordRange>& words,
+           size_t max_word_len = MAX_WORD_LENGTH) const {
+    vector<Dag> dags;
+    dictTrie_->Find(begin, 
+          end, 
+          dags,
+          max_word_len);
+    CalcDP(dags);
+    CutByDag(begin, end, dags, words);
+  }
+
+  const DictTrie* GetDictTrie() const {
+    return dictTrie_;
+  }
+
+  bool Tag(const string& src, vector<pair<string, string> >& res) const {
+    return tagger_.Tag(src, res, *this);
+  }
+
+  bool IsUserDictSingleChineseWord(const Rune& value) const {
+    return dictTrie_->IsUserDictSingleChineseWord(value);
+  }
+ private:
+  void CalcDP(vector<Dag>& dags) const {
+    size_t nextPos;
+    const DictUnit* p;
+    double val;
+
+    for (vector<Dag>::reverse_iterator rit = dags.rbegin(); rit != dags.rend(); rit++) {
+      rit->pInfo = NULL;
+      rit->weight = MIN_DOUBLE;
+      assert(!rit->nexts.empty());
+      for (LocalVector<pair<size_t, const DictUnit*> >::const_iterator it = rit->nexts.begin(); it != rit->nexts.end(); it++) {
+        nextPos = it->first;
+        p = it->second;
+        val = 0.0;
+        if (nextPos + 1 < dags.size()) {
+          val += dags[nextPos + 1].weight;
+        }
+
+        if (p) {
+          val += p->weight;
+        } else {
+          val += dictTrie_->GetMinWeight();
+        }
+        if (val > rit->weight) {
+          rit->pInfo = p;
+          rit->weight = val;
+        }
+      }
+    }
+  }
+  void CutByDag(RuneStrArray::const_iterator begin, 
+        RuneStrArray::const_iterator /*end*/,
+        const vector<Dag>& dags, 
+        vector<WordRange>& words) const {
+    size_t i = 0;
+    while (i < dags.size()) {
+      const DictUnit* p = dags[i].pInfo;
+      if (p) {
+        assert(p->word.size() >= 1);
+        WordRange wr(begin + i, begin + i + p->word.size() - 1);
+        words.push_back(wr);
+        i += p->word.size();
+      } else { //single chinese word
+        WordRange wr(begin + i, begin + i);
+        words.push_back(wr);
+        i++;
+      }
+    }
+  }
+
+  const DictTrie* dictTrie_;
+  bool isNeedDestroy_;
+  PosTagger tagger_;
+
+}; // class MPSegment
+
+} // namespace cppjieba
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/MixSegment.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/MixSegment.hpp
new file mode 100644
index 0000000000..8fd24e90e9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/MixSegment.hpp
@@ -0,0 +1,109 @@
+#ifndef CPPJIEBA_MIXSEGMENT_H
+#define CPPJIEBA_MIXSEGMENT_H
+
+#include <cassert>
+#include "MPSegment.hpp"
+#include "HMMSegment.hpp"
+#include "limonp/StringUtil.hpp"
+#include "PosTagger.hpp"
+
+namespace cppjieba {
+class MixSegment: public SegmentTagged {
+ public:
+  MixSegment(const string& mpSegDict, const string& hmmSegDict, 
+        const string& userDict = "") 
+    : mpSeg_(mpSegDict, userDict), 
+      hmmSeg_(hmmSegDict) {
+  }
+  MixSegment(const DictTrie* dictTrie, const HMMModel* model) 
+    : mpSeg_(dictTrie), hmmSeg_(model) {
+  }
+  ~MixSegment() {
+  }
+
+  void Cut(const string& sentence, vector<string>& words) const {
+    Cut(sentence, words, true);
+  }
+  void Cut(const string& sentence, vector<string>& words, bool hmm) const {
+    vector<Word> tmp;
+    Cut(sentence, tmp, hmm);
+    GetStringsFromWords(tmp, words);
+  }
+  void Cut(const string& sentence, vector<Word>& words, bool hmm = true) const {
+    PreFilter pre_filter(symbols_, sentence);
+    PreFilter::Range range;
+    vector<WordRange> wrs;
+    wrs.reserve(sentence.size() / 2);
+    while (pre_filter.HasNext()) {
+      range = pre_filter.Next();
+      Cut(range.begin, range.end, wrs, hmm);
+    }
+    words.clear();
+    words.reserve(wrs.size());
+    GetWordsFromWordRanges(sentence, wrs, words);
+  }
+
+  void Cut(RuneStrArray::const_iterator begin, RuneStrArray::const_iterator end, vector<WordRange>& res, bool hmm) const {
+    if (!hmm) {
+      mpSeg_.Cut(begin, end, res);
+      return;
+    }
+    vector<WordRange> words;
+    assert(end >= begin);
+    words.reserve(end - begin);
+    mpSeg_.Cut(begin, end, words);
+
+    vector<WordRange> hmmRes;
+    hmmRes.reserve(end - begin);
+    for (size_t i = 0; i < words.size(); i++) {
+      //if mp Get a word, it's ok, put it into result
+      if (words[i].left != words[i].right || (words[i].left == words[i].right && mpSeg_.IsUserDictSingleChineseWord(words[i].left->rune))) {
+        res.push_back(words[i]);
+        continue;
+      }
+
+      // if mp Get a single one and it is not in userdict, collect it in sequence
+      size_t j = i;
+      while (j < words.size() && words[j].left == words[j].right && !mpSeg_.IsUserDictSingleChineseWord(words[j].left->rune)) {
+        j++;
+      }
+
+      // Cut the sequence with hmm
+      assert(j - 1 >= i);
+      // TODO
+      hmmSeg_.Cut(words[i].left, words[j - 1].left + 1, hmmRes);
+      //put hmm result to result
+      for (size_t k = 0; k < hmmRes.size(); k++) {
+        res.push_back(hmmRes[k]);
+      }
+
+      //clear tmp vars
+      hmmRes.clear();
+
+      //let i jump over this piece
+      i = j - 1;
+    }
+  }
+
+  const DictTrie* GetDictTrie() const {
+    return mpSeg_.GetDictTrie();
+  }
+
+  bool Tag(const string& src, vector<pair<string, string> >& res) const {
+    return tagger_.Tag(src, res, *this);
+  }
+
+  string LookupTag(const string &str) const {
+    return tagger_.LookupTag(str, *this);
+  }
+
+ private:
+  MPSegment mpSeg_;
+  HMMSegment hmmSeg_;
+  PosTagger tagger_;
+
+}; // class MixSegment
+
+} // namespace cppjieba
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/PosTagger.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/PosTagger.hpp
new file mode 100644
index 0000000000..15863306d2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/PosTagger.hpp
@@ -0,0 +1,77 @@
+#ifndef CPPJIEBA_POS_TAGGING_H
+#define CPPJIEBA_POS_TAGGING_H
+
+#include "limonp/StringUtil.hpp"
+#include "SegmentTagged.hpp"
+#include "DictTrie.hpp"
+
+namespace cppjieba {
+using namespace limonp;
+
+static const char* const POS_M = "m";
+static const char* const POS_ENG = "eng";
+static const char* const POS_X = "x";
+
+class PosTagger {
+ public:
+  PosTagger() {
+  }
+  ~PosTagger() {
+  }
+
+  bool Tag(const string& src, vector<pair<string, string> >& res, const SegmentTagged& segment) const {
+    vector<string> CutRes;
+    segment.Cut(src, CutRes);
+
+    for (vector<string>::iterator itr = CutRes.begin(); itr != CutRes.end(); ++itr) {
+      res.push_back(make_pair(*itr, LookupTag(*itr, segment)));
+    }
+    return !res.empty();
+  }
+
+  string LookupTag(const string &str, const SegmentTagged& segment) const {
+    const DictUnit *tmp = NULL;
+    RuneStrArray runes;
+    const DictTrie * dict = segment.GetDictTrie();
+    assert(dict != NULL);
+      if (!DecodeUTF8RunesInString(str, runes)) {
+        XLOG(ERROR) << "UTF-8 decode failed for word: " << str;
+        return POS_X;
+      }
+      tmp = dict->Find(runes.begin(), runes.end());
+      if (tmp == NULL || tmp->tag.empty()) {
+        return SpecialRule(runes);
+      } else {
+        return tmp->tag;
+      }
+  }
+
+ private:
+  const char* SpecialRule(const RuneStrArray& unicode) const {
+    size_t m = 0;
+    size_t eng = 0;
+    for (size_t i = 0; i < unicode.size() && eng < unicode.size() / 2; i++) {
+      if (unicode[i].rune < 0x80) {
+        eng ++;
+        if ('0' <= unicode[i].rune && unicode[i].rune <= '9') {
+          m++;
+        }
+      }
+    }
+    // ascii char is not found
+    if (eng == 0) {
+      return POS_X;
+    }
+    // all the ascii is number char
+    if (m == eng) {
+      return POS_M;
+    }
+    // the ascii chars contain english letter
+    return POS_ENG;
+  }
+
+}; // class PosTagger
+
+} // namespace cppjieba
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/PreFilter.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/PreFilter.hpp
new file mode 100644
index 0000000000..deb750b580
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/PreFilter.hpp
@@ -0,0 +1,54 @@
+#ifndef CPPJIEBA_PRE_FILTER_H
+#define CPPJIEBA_PRE_FILTER_H
+
+#include "Trie.hpp"
+#include "limonp/Logging.hpp"
+
+namespace cppjieba {
+
+class PreFilter {
+ public:
+  //TODO use WordRange instead of Range
+  struct Range {
+    RuneStrArray::const_iterator begin;
+    RuneStrArray::const_iterator end;
+  }; // struct Range
+
+  PreFilter(const unordered_set<Rune>& symbols, 
+        const string& sentence)
+    : symbols_(symbols) {
+    if (!DecodeUTF8RunesInString(sentence, sentence_)) {
+      XLOG(ERROR) << "UTF-8 decode failed for input sentence"; 
+    }
+    cursor_ = sentence_.begin();
+  }
+  ~PreFilter() {
+  }
+  bool HasNext() const {
+    return cursor_ != sentence_.end();
+  }
+  Range Next() {
+    Range range;
+    range.begin = cursor_;
+    while (cursor_ != sentence_.end()) {
+      if (IsIn(symbols_, cursor_->rune)) {
+        if (range.begin == cursor_) {
+          cursor_ ++;
+        }
+        range.end = cursor_;
+        return range;
+      }
+      cursor_ ++;
+    }
+    range.end = sentence_.end();
+    return range;
+  }
+ private:
+  RuneStrArray::const_iterator cursor_;
+  RuneStrArray sentence_;
+  const unordered_set<Rune>& symbols_;
+}; // class PreFilter
+
+} // namespace cppjieba
+
+#endif // CPPJIEBA_PRE_FILTER_H
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/QuerySegment.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/QuerySegment.hpp
new file mode 100644
index 0000000000..6be886ab56
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/QuerySegment.hpp
@@ -0,0 +1,89 @@
+#ifndef CPPJIEBA_QUERYSEGMENT_H
+#define CPPJIEBA_QUERYSEGMENT_H
+
+#include <algorithm>
+#include <set>
+#include <cassert>
+#include "limonp/Logging.hpp"
+#include "DictTrie.hpp"
+#include "SegmentBase.hpp"
+#include "FullSegment.hpp"
+#include "MixSegment.hpp"
+#include "Unicode.hpp"
+
+namespace cppjieba {
+class QuerySegment: public SegmentBase {
+ public:
+  QuerySegment(const string& dict, const string& model, const string& userDict = "")
+    : mixSeg_(dict, model, userDict),
+      trie_(mixSeg_.GetDictTrie()) {
+  }
+  QuerySegment(const DictTrie* dictTrie, const HMMModel* model)
+    : mixSeg_(dictTrie, model), trie_(dictTrie) {
+  }
+  ~QuerySegment() {
+  }
+
+  void Cut(const string& sentence, vector<string>& words) const {
+    Cut(sentence, words, true);
+  }
+  void Cut(const string& sentence, vector<string>& words, bool hmm) const {
+    vector<Word> tmp;
+    Cut(sentence, tmp, hmm);
+    GetStringsFromWords(tmp, words);
+  }
+  void Cut(const string& sentence, vector<Word>& words, bool hmm = true) const {
+    PreFilter pre_filter(symbols_, sentence);
+    PreFilter::Range range;
+    vector<WordRange> wrs;
+    wrs.reserve(sentence.size()/2);
+    while (pre_filter.HasNext()) {
+      range = pre_filter.Next();
+      Cut(range.begin, range.end, wrs, hmm);
+    }
+    words.clear();
+    words.reserve(wrs.size());
+    GetWordsFromWordRanges(sentence, wrs, words);
+  }
+  void Cut(RuneStrArray::const_iterator begin, RuneStrArray::const_iterator end, vector<WordRange>& res, bool hmm) const {
+    //use mix Cut first
+    vector<WordRange> mixRes;
+    mixSeg_.Cut(begin, end, mixRes, hmm);
+
+    vector<WordRange> fullRes;
+    for (vector<WordRange>::const_iterator mixResItr = mixRes.begin(); mixResItr != mixRes.end(); mixResItr++) {
+      if (mixResItr->Length() > 2) {
+        for (size_t i = 0; i + 1 < mixResItr->Length(); i++) {
+          WordRange wr(mixResItr->left + i, mixResItr->left + i + 1);
+          if (trie_->Find(wr.left, wr.right + 1) != NULL) {
+            res.push_back(wr);
+          }
+        }
+      }
+      if (mixResItr->Length() > 3) {
+        for (size_t i = 0; i + 2 < mixResItr->Length(); i++) {
+          WordRange wr(mixResItr->left + i, mixResItr->left + i + 2);
+          if (trie_->Find(wr.left, wr.right + 1) != NULL) {
+            res.push_back(wr);
+          }
+        }
+      }
+      res.push_back(*mixResItr);
+    }
+  }
+ private:
+  bool IsAllAscii(const Unicode& s) const {
+   for(size_t i = 0; i < s.size(); i++) {
+     if (s[i] >= 0x80) {
+       return false;
+     }
+   }
+   return true;
+  }
+  MixSegment mixSeg_;
+  const DictTrie* trie_;
+}; // QuerySegment
+
+} // namespace cppjieba
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/SegmentBase.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/SegmentBase.hpp
new file mode 100644
index 0000000000..130b2128e7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/SegmentBase.hpp
@@ -0,0 +1,46 @@
+#ifndef CPPJIEBA_SEGMENTBASE_H
+#define CPPJIEBA_SEGMENTBASE_H
+
+#include "limonp/Logging.hpp"
+#include "PreFilter.hpp"
+#include <cassert>
+
+
+namespace cppjieba {
+
+const char* const SPECIAL_SEPARATORS = " \t\n\xEF\xBC\x8C\xE3\x80\x82";
+
+using namespace limonp;
+
+class SegmentBase {
+ public:
+  SegmentBase() {
+    XCHECK(ResetSeparators(SPECIAL_SEPARATORS));
+  }
+  virtual ~SegmentBase() {
+  }
+
+  virtual void Cut(const string& sentence, vector<string>& words) const = 0;
+
+  bool ResetSeparators(const string& s) {
+    symbols_.clear();
+    RuneStrArray runes;
+    if (!DecodeUTF8RunesInString(s, runes)) {
+      XLOG(ERROR) << "UTF-8 decode failed for separators: " << s;
+      return false;
+    }
+    for (size_t i = 0; i < runes.size(); i++) {
+      if (!symbols_.insert(runes[i].rune).second) {
+        XLOG(ERROR) << s.substr(runes[i].offset, runes[i].len) << " already exists";
+        return false;
+      }
+    }
+    return true;
+  }
+ protected:
+  unordered_set<Rune> symbols_;
+}; // class SegmentBase
+
+} // cppjieba
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/SegmentTagged.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/SegmentTagged.hpp
new file mode 100644
index 0000000000..4d99a31afa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/SegmentTagged.hpp
@@ -0,0 +1,23 @@
+#ifndef CPPJIEBA_SEGMENTTAGGED_H
+#define CPPJIEBA_SEGMENTTAGGED_H
+
+#include "SegmentBase.hpp"
+
+namespace cppjieba {
+
+class SegmentTagged : public SegmentBase{
+ public:
+  SegmentTagged() {
+  }
+  virtual ~SegmentTagged() {
+  }
+
+  virtual bool Tag(const string& src, vector<pair<string, string> >& res) const = 0;
+
+  virtual const DictTrie* GetDictTrie() const = 0;
+
+}; // class SegmentTagged
+
+} // cppjieba
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/TextRankExtractor.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/TextRankExtractor.hpp
new file mode 100644
index 0000000000..292d0a8f9d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/TextRankExtractor.hpp
@@ -0,0 +1,190 @@
+#ifndef CPPJIEBA_TEXTRANK_EXTRACTOR_H
+#define CPPJIEBA_TEXTRANK_EXTRACTOR_H
+
+#include <cmath>
+#include "Jieba.hpp"
+
+namespace cppjieba {
+  using namespace limonp;
+  using namespace std;
+
+  class TextRankExtractor {
+  public:
+    typedef struct _Word {string word;vector<size_t> offsets;double weight;}    Word; // struct Word
+  private:
+    typedef std::map<string,Word> WordMap;
+  
+    class WordGraph{
+    private:
+      typedef double Score;
+      typedef string Node;
+      typedef std::set<Node> NodeSet;
+
+      typedef std::map<Node,double> Edges;
+      typedef std::map<Node,Edges> Graph;
+      //typedef std::unordered_map<Node,double> Edges;
+      //typedef std::unordered_map<Node,Edges> Graph;
+
+      double d;
+      Graph graph;
+      NodeSet nodeSet;
+    public:
+      WordGraph(): d(0.85) {};
+      WordGraph(double in_d): d(in_d) {};
+
+      void addEdge(Node start,Node end,double weight){
+        Edges temp;
+        Edges::iterator gotEdges;
+        nodeSet.insert(start);
+        nodeSet.insert(end);
+        graph[start][end]+=weight;
+        graph[end][start]+=weight;
+      }
+
+      void rank(WordMap &ws,size_t rankTime=10){
+        WordMap outSum;
+        Score wsdef, min_rank, max_rank;
+
+        if( graph.size() == 0)
+          return;
+
+        wsdef = 1.0 / graph.size();
+
+        for(Graph::iterator edges=graph.begin();edges!=graph.end();++edges){
+          // edges->first start节点；edge->first end节点；edge->second 权重
+          ws[edges->first].word=edges->first;
+          ws[edges->first].weight=wsdef;
+          outSum[edges->first].weight=0;
+          for(Edges::iterator edge=edges->second.begin();edge!=edges->second.end();++edge){
+            outSum[edges->first].weight+=edge->second;
+          }
+        }
+        //sort(nodeSet.begin(),nodeSet.end()); 是否需要排序?
+        for( size_t i=0; i<rankTime; i++ ){
+          for(NodeSet::iterator node = nodeSet.begin(); node != nodeSet.end(); node++ ){
+            double s = 0;
+            for( Edges::iterator edge= graph[*node].begin(); edge != graph[*node].end(); edge++ )
+              // edge->first end节点；edge->second 权重
+              s += edge->second / outSum[edge->first].weight * ws[edge->first].weight;
+            ws[*node].weight = (1 - d) + d * s;
+          }
+        }
+
+        min_rank=max_rank=ws.begin()->second.weight;
+        for(WordMap::iterator i = ws.begin(); i != ws.end(); i ++){
+          if( i->second.weight < min_rank ){
+            min_rank = i->second.weight;
+          }
+          if( i->second.weight > max_rank ){
+            max_rank = i->second.weight;
+          }
+        }
+        for(WordMap::iterator i = ws.begin(); i != ws.end(); i ++){
+          ws[i->first].weight = (i->second.weight - min_rank / 10.0) / (max_rank - min_rank / 10.0);
+        }
+      }
+    };
+
+  public: 
+  TextRankExtractor(const string& dictPath, 
+        const string& hmmFilePath, 
+        const string& stopWordPath, 
+        const string& userDict = "") 
+    : segment_(dictPath, hmmFilePath, userDict) {
+    LoadStopWordDict(stopWordPath);
+  }
+  TextRankExtractor(const DictTrie* dictTrie, 
+        const HMMModel* model,
+        const string& stopWordPath) 
+    : segment_(dictTrie, model) {
+    LoadStopWordDict(stopWordPath);
+  }
+    TextRankExtractor(const Jieba& jieba, const string& stopWordPath) : segment_(jieba.GetDictTrie(), jieba.GetHMMModel()) {
+        LoadStopWordDict(stopWordPath);
+    }
+    ~TextRankExtractor() {
+    }
+
+    void Extract(const string& sentence, vector<string>& keywords, size_t topN) const {
+      vector<Word> topWords;
+      Extract(sentence, topWords, topN);
+      for (size_t i = 0; i < topWords.size(); i++) {
+        keywords.push_back(topWords[i].word);
+      }
+    }
+
+    void Extract(const string& sentence, vector<pair<string, double> >& keywords, size_t topN) const {
+      vector<Word> topWords;
+      Extract(sentence, topWords, topN);
+      for (size_t i = 0; i < topWords.size(); i++) {
+        keywords.push_back(pair<string, double>(topWords[i].word, topWords[i].weight));
+      }
+    }
+
+    void Extract(const string& sentence, vector<Word>& keywords, size_t topN, size_t span=5,size_t rankTime=10) const {
+      vector<string> words;
+      segment_.Cut(sentence, words);
+
+      TextRankExtractor::WordGraph graph;
+      WordMap wordmap;
+      size_t offset = 0;
+
+      for(size_t i=0; i < words.size(); i++){
+        size_t t = offset;
+        offset += words[i].size();
+        if (IsSingleWord(words[i]) || stopWords_.find(words[i]) != stopWords_.end()) {
+          continue;
+        }
+        for(size_t j=i+1,skip=0;j<i+span+skip && j<words.size();j++){
+          if (IsSingleWord(words[j]) || stopWords_.find(words[j]) != stopWords_.end()) {
+            skip++;
+            continue;
+          }
+          graph.addEdge(words[i],words[j],1);
+        }
+        wordmap[words[i]].offsets.push_back(t);
+      }
+      if (offset != sentence.size()) {
+        XLOG(ERROR) << "words illegal";
+        return;
+      }
+
+      graph.rank(wordmap,rankTime);
+      
+      keywords.clear();
+      keywords.reserve(wordmap.size());
+      for (WordMap::iterator itr = wordmap.begin(); itr != wordmap.end(); ++itr) {
+        keywords.push_back(itr->second);
+      }
+      
+      topN = min(topN, keywords.size());
+      partial_sort(keywords.begin(), keywords.begin() + topN, keywords.end(), Compare);
+      keywords.resize(topN);
+    }
+  private:
+    void LoadStopWordDict(const string& filePath) {
+      ifstream ifs(filePath.c_str());
+      XCHECK(ifs.is_open()) << "open " << filePath << " failed";
+      string line ;
+      while (getline(ifs, line)) {
+        stopWords_.insert(line);
+      }
+      assert(stopWords_.size());
+    }
+
+    static bool Compare(const Word &x,const Word &y){
+      return x.weight > y.weight;
+    }
+
+    MixSegment segment_;
+    unordered_set<string> stopWords_;
+  }; // class TextRankExtractor
+  
+  inline ostream& operator << (ostream& os, const TextRankExtractor::Word& word) {
+    return os << "{\"word\": \"" << word.word << "\", \"offset\": " << word.offsets << ", \"weight\": " << word.weight << "}"; 
+  }
+} // namespace cppjieba
+
+#endif
+
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/Trie.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/Trie.hpp
new file mode 100644
index 0000000000..26663c967d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/Trie.hpp
@@ -0,0 +1,200 @@
+#ifndef CPPJIEBA_TRIE_HPP
+#define CPPJIEBA_TRIE_HPP
+
+#include <vector>
+#include <queue>
+#include "limonp/StdExtension.hpp"
+#include "Unicode.hpp"
+
+namespace cppjieba {
+
+using namespace std;
+
+const size_t MAX_WORD_LENGTH = 512;
+
+struct DictUnit {
+  Unicode word;
+  double weight;
+  string tag;
+}; // struct DictUnit
+
+// for debugging
+// inline ostream & operator << (ostream& os, const DictUnit& unit) {
+//   string s;
+//   s << unit.word;
+//   return os << StringFormat("%s %s %.3lf", s.c_str(), unit.tag.c_str(), unit.weight);
+// }
+
+struct Dag {
+  RuneStr runestr;
+  // [offset, nexts.first]
+  limonp::LocalVector<pair<size_t, const DictUnit*> > nexts;
+  const DictUnit * pInfo;
+  double weight;
+  size_t nextPos; // TODO
+  Dag():runestr(), pInfo(NULL), weight(0.0), nextPos(0) {
+  }
+}; // struct Dag
+
+typedef Rune TrieKey;
+
+class TrieNode {
+ public :
+  TrieNode(): next(NULL), ptValue(NULL) {
+  }
+ public:
+  typedef unordered_map<TrieKey, TrieNode*> NextMap;
+  NextMap *next;
+  const DictUnit *ptValue;
+};
+
+class Trie {
+ public:
+  Trie(const vector<Unicode>& keys, const vector<const DictUnit*>& valuePointers)
+   : root_(new TrieNode) {
+    CreateTrie(keys, valuePointers);
+  }
+  ~Trie() {
+    DeleteNode(root_);
+  }
+
+  const DictUnit* Find(RuneStrArray::const_iterator begin, RuneStrArray::const_iterator end) const {
+    if (begin == end) {
+      return NULL;
+    }
+
+    const TrieNode* ptNode = root_;
+    TrieNode::NextMap::const_iterator citer;
+    for (RuneStrArray::const_iterator it = begin; it != end; it++) {
+      if (NULL == ptNode->next) {
+        return NULL;
+      }
+      citer = ptNode->next->find(it->rune);
+      if (ptNode->next->end() == citer) {
+        return NULL;
+      }
+      ptNode = citer->second;
+    }
+    return ptNode->ptValue;
+  }
+
+  void Find(RuneStrArray::const_iterator begin,
+        RuneStrArray::const_iterator end,
+        vector<struct Dag>&res,
+        size_t max_word_len = MAX_WORD_LENGTH) const {
+    assert(root_ != NULL);
+    res.resize(end - begin);
+
+    const TrieNode *ptNode = NULL;
+    TrieNode::NextMap::const_iterator citer;
+    for (size_t i = 0; i < size_t(end - begin); i++) {
+      res[i].runestr = *(begin + i);
+
+      if (root_->next != NULL && root_->next->end() != (citer = root_->next->find(res[i].runestr.rune))) {
+        ptNode = citer->second;
+      } else {
+        ptNode = NULL;
+      }
+      if (ptNode != NULL) {
+        res[i].nexts.push_back(pair<size_t, const DictUnit*>(i, ptNode->ptValue));
+      } else {
+        res[i].nexts.push_back(pair<size_t, const DictUnit*>(i, static_cast<const DictUnit*>(NULL)));
+      }
+
+      for (size_t j = i + 1; j < size_t(end - begin) && (j - i + 1) <= max_word_len; j++) {
+        if (ptNode == NULL || ptNode->next == NULL) {
+          break;
+        }
+        citer = ptNode->next->find((begin + j)->rune);
+        if (ptNode->next->end() == citer) {
+          break;
+        }
+        ptNode = citer->second;
+        if (NULL != ptNode->ptValue) {
+          res[i].nexts.push_back(pair<size_t, const DictUnit*>(j, ptNode->ptValue));
+        }
+      }
+    }
+  }
+
+  void InsertNode(const Unicode& key, const DictUnit* ptValue) {
+    if (key.begin() == key.end()) {
+      return;
+    }
+
+    TrieNode::NextMap::const_iterator kmIter;
+    TrieNode *ptNode = root_;
+    for (Unicode::const_iterator citer = key.begin(); citer != key.end(); ++citer) {
+      if (NULL == ptNode->next) {
+        ptNode->next = new TrieNode::NextMap;
+      }
+      kmIter = ptNode->next->find(*citer);
+      if (ptNode->next->end() == kmIter) {
+        TrieNode *nextNode = new TrieNode;
+
+        ptNode->next->insert(make_pair(*citer, nextNode));
+        ptNode = nextNode;
+      } else {
+        ptNode = kmIter->second;
+      }
+    }
+    assert(ptNode != NULL);
+    ptNode->ptValue = ptValue;
+  }
+  void DeleteNode(const Unicode& key, const DictUnit* /*ptValue*/) {
+      if (key.begin() == key.end()) {
+        return;
+      }
+      //定义一个NextMap迭代器
+      TrieNode::NextMap::const_iterator kmIter;
+      //定义一个指向root的TrieNode指针
+      TrieNode *ptNode = root_;
+      for (Unicode::const_iterator citer = key.begin(); citer != key.end(); ++citer) {
+        //链表不存在元素
+        if (NULL == ptNode->next) {
+          return;
+        }
+        kmIter = ptNode->next->find(*citer);
+        //如果map中不存在,跳出循环
+        if (ptNode->next->end() == kmIter) {
+              break;
+        }
+        //从unordered_map中擦除该项
+        ptNode->next->erase(*citer);
+        //删除该node
+        ptNode = kmIter->second;
+        delete ptNode;
+        break;
+      }
+      return;
+ }
+ private:
+  void CreateTrie(const vector<Unicode>& keys, const vector<const DictUnit*>& valuePointers) {
+    if (valuePointers.empty() || keys.empty()) {
+      return;
+    }
+    assert(keys.size() == valuePointers.size());
+
+    for (size_t i = 0; i < keys.size(); i++) {
+      InsertNode(keys[i], valuePointers[i]);
+    }
+  }
+
+  void DeleteNode(TrieNode* node) {
+    if (NULL == node) {
+      return;
+    }
+    if (NULL != node->next) {
+      for (TrieNode::NextMap::iterator it = node->next->begin(); it != node->next->end(); ++it) {
+        DeleteNode(it->second);
+      }
+      delete node->next;
+    }
+    delete node;
+  }
+
+  TrieNode* root_;
+}; // class Trie
+} // namespace cppjieba
+
+#endif // CPPJIEBA_TRIE_HPP
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/Unicode.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/Unicode.hpp
new file mode 100644
index 0000000000..9adec2ca20
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/cppjieba/include/cppjieba/Unicode.hpp
@@ -0,0 +1,227 @@
+#ifndef CPPJIEBA_UNICODE_H
+#define CPPJIEBA_UNICODE_H
+
+#include <stdint.h>
+#include <stdlib.h>
+#include <string>
+#include <vector>
+#include <ostream>
+#include "limonp/LocalVector.hpp"
+
+namespace cppjieba {
+
+using std::string;
+using std::vector;
+
+typedef uint32_t Rune;
+
+struct Word {
+  string word;
+  uint32_t offset;
+  uint32_t unicode_offset;
+  uint32_t unicode_length;
+  Word(const string& w, uint32_t o)
+   : word(w), offset(o) {
+  }
+  Word(const string& w, uint32_t o, uint32_t unicode_offset, uint32_t unicode_length)
+          : word(w), offset(o), unicode_offset(unicode_offset), unicode_length(unicode_length) {
+  }
+}; // struct Word
+
+inline std::ostream& operator << (std::ostream& os, const Word& w) {
+  return os << "{\"word\": \"" << w.word << "\", \"offset\": " << w.offset << "}";
+}
+
+struct RuneStr {
+  Rune rune;
+  uint32_t offset;
+  uint32_t len;
+  uint32_t unicode_offset;
+  uint32_t unicode_length;
+  RuneStr(): rune(0), offset(0), len(0), unicode_offset(0), unicode_length(0) {
+  }
+  RuneStr(Rune r, uint32_t o, uint32_t l)
+    : rune(r), offset(o), len(l), unicode_offset(0), unicode_length(0) {
+  }
+  RuneStr(Rune r, uint32_t o, uint32_t l, uint32_t unicode_offset, uint32_t unicode_length)
+          : rune(r), offset(o), len(l), unicode_offset(unicode_offset), unicode_length(unicode_length) {
+  }
+}; // struct RuneStr
+
+inline std::ostream& operator << (std::ostream& os, const RuneStr& r) {
+  return os << "{\"rune\": \"" << r.rune << "\", \"offset\": " << r.offset << ", \"len\": " << r.len << "}";
+}
+
+typedef limonp::LocalVector<Rune> Unicode;
+typedef limonp::LocalVector<struct RuneStr> RuneStrArray;
+
+// [left, right]
+struct WordRange {
+  RuneStrArray::const_iterator left;
+  RuneStrArray::const_iterator right;
+  WordRange(RuneStrArray::const_iterator l, RuneStrArray::const_iterator r)
+   : left(l), right(r) {
+  }
+  size_t Length() const {
+    return right - left + 1;
+  }
+  bool IsAllAscii() const {
+    for (RuneStrArray::const_iterator iter = left; iter <= right; ++iter) {
+      if (iter->rune >= 0x80) {
+        return false;
+      }
+    }
+    return true;
+  }
+}; // struct WordRange
+
+struct RuneStrLite {
+  uint32_t rune;
+  uint32_t len;
+  RuneStrLite(): rune(0), len(0) {
+  }
+  RuneStrLite(uint32_t r, uint32_t l): rune(r), len(l) {
+  }
+}; // struct RuneStrLite
+
+inline RuneStrLite DecodeUTF8ToRune(const char* str, size_t len) {
+  RuneStrLite rp(0, 0);
+  if (str == NULL || len == 0) {
+    return rp;
+  }
+  if (!(str[0] & 0x80)) { // 0xxxxxxx
+    // 7bit, total 7bit
+    rp.rune = (uint8_t)(str[0]) & 0x7f;
+    rp.len = 1;
+  } else if ((uint8_t)str[0] <= 0xdf &&  1 < len) { 
+    // 110xxxxxx
+    // 5bit, total 5bit
+    rp.rune = (uint8_t)(str[0]) & 0x1f;
+
+    // 6bit, total 11bit
+    rp.rune <<= 6;
+    rp.rune |= (uint8_t)(str[1]) & 0x3f;
+    rp.len = 2;
+  } else if((uint8_t)str[0] <= 0xef && 2 < len) { // 1110xxxxxx
+    // 4bit, total 4bit
+    rp.rune = (uint8_t)(str[0]) & 0x0f;
+
+    // 6bit, total 10bit
+    rp.rune <<= 6;
+    rp.rune |= (uint8_t)(str[1]) & 0x3f;
+
+    // 6bit, total 16bit
+    rp.rune <<= 6;
+    rp.rune |= (uint8_t)(str[2]) & 0x3f;
+
+    rp.len = 3;
+  } else if((uint8_t)str[0] <= 0xf7 && 3 < len) { // 11110xxxx
+    // 3bit, total 3bit
+    rp.rune = (uint8_t)(str[0]) & 0x07;
+
+    // 6bit, total 9bit
+    rp.rune <<= 6;
+    rp.rune |= (uint8_t)(str[1]) & 0x3f;
+
+    // 6bit, total 15bit
+    rp.rune <<= 6;
+    rp.rune |= (uint8_t)(str[2]) & 0x3f;
+
+    // 6bit, total 21bit
+    rp.rune <<= 6;
+    rp.rune |= (uint8_t)(str[3]) & 0x3f;
+
+    rp.len = 4;
+  } else {
+    rp.rune = 0;
+    rp.len = 0;
+  }
+  return rp;
+}
+
+inline bool DecodeUTF8RunesInString(const char* s, size_t len, RuneStrArray& runes) {
+  runes.clear();
+  runes.reserve(len / 2);
+  for (uint32_t i = 0, j = 0; i < len;) {
+    RuneStrLite rp = DecodeUTF8ToRune(s + i, len - i);
+    if (rp.len == 0) {
+      runes.clear();
+      return false;
+    }
+    RuneStr x(rp.rune, i, rp.len, j, 1);
+    runes.push_back(x);
+    i += rp.len;
+    ++j;
+  }
+  return true;
+}
+
+inline bool DecodeUTF8RunesInString(const string& s, RuneStrArray& runes) {
+  return DecodeUTF8RunesInString(s.c_str(), s.size(), runes);
+}
+
+inline bool DecodeUTF8RunesInString(const char* s, size_t len, Unicode& unicode) {
+  unicode.clear();
+  RuneStrArray runes;
+  if (!DecodeUTF8RunesInString(s, len, runes)) {
+    return false;
+  }
+  unicode.reserve(runes.size());
+  for (size_t i = 0; i < runes.size(); i++) {
+    unicode.push_back(runes[i].rune);
+  }
+  return true;
+}
+
+inline bool IsSingleWord(const string& str) {
+  RuneStrLite rp = DecodeUTF8ToRune(str.c_str(), str.size());
+  return rp.len == str.size();
+}
+
+inline bool DecodeUTF8RunesInString(const string& s, Unicode& unicode) {
+  return DecodeUTF8RunesInString(s.c_str(), s.size(), unicode);
+}
+
+inline Unicode DecodeUTF8RunesInString(const string& s) {
+  Unicode result;
+  DecodeUTF8RunesInString(s, result);
+  return result;
+}
+
+
+// [left, right]
+inline Word GetWordFromRunes(const string& s, RuneStrArray::const_iterator left, RuneStrArray::const_iterator right) {
+  assert(right->offset >= left->offset);
+  uint32_t len = right->offset - left->offset + right->len;
+  uint32_t unicode_length = right->unicode_offset - left->unicode_offset + right->unicode_length;
+  return Word(s.substr(left->offset, len), left->offset, left->unicode_offset, unicode_length);
+}
+
+inline string GetStringFromRunes(const string& s, RuneStrArray::const_iterator left, RuneStrArray::const_iterator right) {
+  assert(right->offset >= left->offset);
+  uint32_t len = right->offset - left->offset + right->len;
+  return s.substr(left->offset, len);
+}
+
+inline void GetWordsFromWordRanges(const string& s, const vector<WordRange>& wrs, vector<Word>& words) {
+  for (size_t i = 0; i < wrs.size(); i++) {
+    words.push_back(GetWordFromRunes(s, wrs[i].left, wrs[i].right));
+  }
+}
+
+inline vector<Word> GetWordsFromWordRanges(const string& s, const vector<WordRange>& wrs) {
+  vector<Word> result;
+  GetWordsFromWordRanges(s, wrs, result);
+  return result;
+}
+
+inline void GetStringsFromWords(const vector<Word>& words, vector<string>& strs) {
+  strs.resize(words.size());
+  for (size_t i = 0; i < words.size(); ++i) {
+    strs[i] = words[i].word;
+  }
+}
+
+} // namespace cppjieba
+
+#endif // CPPJIEBA_UNICODE_H
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/fast_float/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fast_float/CMakeLists.txt
new file mode 100644
index 0000000000..28eaadc8c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fast_float/CMakeLists.txt
@@ -0,0 +1,3 @@
+add_library(fast_float INTERFACE)
+
+target_include_directories(fast_float INTERFACE include)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/fast_float/include/fast_float.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fast_float/include/fast_float.h
new file mode 100644
index 0000000000..d13884e8e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fast_float/include/fast_float.h
@@ -0,0 +1,2419 @@
+// duckdb_fast_float by Daniel Lemire
+// duckdb_fast_float by João Paulo Magalhaes
+
+
+// with contributions from Eugene Golushkov
+// with contributions from Maksim Kita
+// with contributions from Marcin Wojdyr
+// with contributions from Neal Richardson
+// with contributions from Tim Paine
+// with contributions from Fabio Pellacini
+
+
+// Permission is hereby granted, free of charge, to any
+// person obtaining a copy of this software and associated
+// documentation files (the "Software"), to deal in the
+// Software without restriction, including without
+// limitation the rights to use, copy, modify, merge,
+// publish, distribute, sublicense, and/or sell copies of
+// the Software, and to permit persons to whom the Software
+// is furnished to do so, subject to the following
+// conditions:
+//
+// The above copyright notice and this permission notice
+// shall be included in all copies or substantial portions
+// of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+// ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+// TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+// PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+// SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+// IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+// DEALINGS IN THE SOFTWARE.
+
+
+#ifndef FASTFLOAT_FAST_FLOAT_H
+#define FASTFLOAT_FAST_FLOAT_H
+
+#include <system_error>
+
+namespace lbug_fast_float {
+enum chars_format {
+    scientific = 1<<0,
+    fixed = 1<<2,
+    hex = 1<<3,
+    general = fixed | scientific
+};
+
+
+struct from_chars_result {
+    const char *ptr;
+    std::errc ec;
+};
+
+/**
+ * This function parses the character sequence [first,last) for a number. It parses floating-point numbers expecting
+ * a locale-indepent format equivalent to what is used by std::strtod in the default ("C") locale.
+ * The resulting floating-point value is the closest floating-point values (using either float or double),
+ * using the "round to even" convention for values that would otherwise fall right in-between two values.
+ * That is, we provide exact parsing according to the IEEE standard.
+ *
+ * Given a successful parse, the pointer (`ptr`) in the returned value is set to point right after the
+ * parsed number, and the `value` referenced is set to the parsed value. In case of error, the returned
+ * `ec` contains a representative error, otherwise the default (`std::errc()`) value is stored.
+ *
+ * The implementation does not throw and does not allocate memory (e.g., with `new` or `malloc`).
+ *
+ * Like the C++17 standard, the `duckdb_fast_float::from_chars` functions take an optional last argument of
+ * the type `duckdb_fast_float::chars_format`. It is a bitset value: we check whether
+ * `fmt & duckdb_fast_float::chars_format::fixed` and `fmt & duckdb_fast_float::chars_format::scientific` are set
+ * to determine whether we allowe the fixed point and scientific notation respectively.
+ * The default is  `duckdb_fast_float::chars_format::general` which allows both `fixed` and `scientific`.
+ */
+template<typename T>
+from_chars_result from_chars(const char *first, const char *last,
+    T &value,
+    const char decimal_separator = '.',
+    chars_format fmt = chars_format::general)  noexcept;
+
+}
+#endif // FASTFLOAT_FAST_FLOAT_H
+
+#ifndef FASTFLOAT_FLOAT_COMMON_H
+#define FASTFLOAT_FLOAT_COMMON_H
+
+#include <cfloat>
+#include <cstdint>
+#include <cassert>
+
+#if (defined(__x86_64) || defined(__x86_64__) || defined(_M_X64)   \
+       || defined(__amd64) || defined(__aarch64__) || defined(_M_ARM64) \
+       || defined(__MINGW64__)                                          \
+       || defined(__s390x__)                                            \
+       || (defined(__ppc64__) || defined(__PPC64__) || defined(__ppc64le__) || defined(__PPC64LE__)) \
+       || defined(__EMSCRIPTEN__))
+#define FASTFLOAT_64BIT
+#elif (defined(__i386) || defined(__i386__) || defined(_M_IX86)   \
+     || defined(__arm__) || defined(_M_ARM)                   \
+     || defined(__MINGW32__))
+#define FASTFLOAT_32BIT
+#else
+  // Need to check incrementally, since SIZE_MAX is a size_t, avoid overflow.
+// We can never tell the register width, but the SIZE_MAX is a good approximation.
+// UINTPTR_MAX and INTPTR_MAX are optional, so avoid them for max portability.
+#if SIZE_MAX == 0xffff
+#error Unknown platform (16-bit, unsupported)
+#elif SIZE_MAX == 0xffffffff
+#define FASTFLOAT_32BIT
+#elif SIZE_MAX == 0xffffffffffffffff
+#define FASTFLOAT_64BIT
+#else
+#error Unknown platform (not 32-bit, not 64-bit?)
+#endif
+#endif
+
+#if ((defined(_WIN32) || defined(_WIN64)) && !defined(__clang__))
+#include <intrin.h>
+#endif
+
+#if defined(_MSC_VER) && !defined(__clang__)
+#define FASTFLOAT_VISUAL_STUDIO 1
+#endif
+
+#ifdef _WIN32
+#define FASTFLOAT_IS_BIG_ENDIAN 0
+#else
+#if defined(__APPLE__) || defined(__FreeBSD__)
+#include <machine/endian.h>
+#elif defined(sun) || defined(__sun)
+#include <sys/byteorder.h>
+#elif defined(__MVS__)
+#include <sys/endian.h>
+#else
+#include <endian.h>
+#endif
+#
+#ifndef __BYTE_ORDER__
+// safe choice
+#define FASTFLOAT_IS_BIG_ENDIAN 0
+#endif
+#
+#ifndef __ORDER_LITTLE_ENDIAN__
+// safe choice
+#define FASTFLOAT_IS_BIG_ENDIAN 0
+#endif
+#
+#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
+#define FASTFLOAT_IS_BIG_ENDIAN 0
+#else
+#define FASTFLOAT_IS_BIG_ENDIAN 1
+#endif
+#endif
+
+#ifdef FASTFLOAT_VISUAL_STUDIO
+#define fastfloat_really_inline __forceinline
+#else
+#define fastfloat_really_inline inline __attribute__((always_inline))
+#endif
+
+namespace lbug_fast_float {
+
+// Compares two ASCII strings in a case insensitive manner.
+inline bool fastfloat_strncasecmp(const char *input1, const char *input2,
+    size_t length) {
+    char running_diff{0};
+    for (size_t i = 0; i < length; i++) {
+        running_diff |= (input1[i] ^ input2[i]);
+    }
+    return (running_diff == 0) || (running_diff == 32);
+}
+
+#ifndef FLT_EVAL_METHOD
+#error "FLT_EVAL_METHOD should be defined, please include cfloat."
+#endif
+
+namespace {
+constexpr uint32_t max_digits = 768;
+constexpr uint32_t max_digit_without_overflow = 19;
+constexpr int32_t decimal_point_range = 2047;
+} // namespace
+
+struct value128 {
+    uint64_t low;
+    uint64_t high;
+    value128(uint64_t _low, uint64_t _high) : low(_low), high(_high) {}
+    value128() : low(0), high(0) {}
+};
+
+/* result might be undefined when input_num is zero */
+fastfloat_really_inline int leading_zeroes(uint64_t input_num) {
+    assert(input_num > 0);
+#ifdef FASTFLOAT_VISUAL_STUDIO
+#if defined(_M_X64) || defined(_M_ARM64)
+    unsigned long leading_zero = 0;
+    // Search the mask data from most significant bit (MSB)
+    // to least significant bit (LSB) for a set bit (1).
+    _BitScanReverse64(&leading_zero, input_num);
+    return (int)(63 - leading_zero);
+#else
+    int last_bit = 0;
+    if(input_num & uint64_t(0xffffffff00000000)) input_num >>= 32, last_bit |= 32;
+    if(input_num & uint64_t(        0xffff0000)) input_num >>= 16, last_bit |= 16;
+    if(input_num & uint64_t(            0xff00)) input_num >>=  8, last_bit |=  8;
+    if(input_num & uint64_t(              0xf0)) input_num >>=  4, last_bit |=  4;
+    if(input_num & uint64_t(               0xc)) input_num >>=  2, last_bit |=  2;
+    if(input_num & uint64_t(               0x2)) input_num >>=  1, last_bit |=  1;
+    return 63 - last_bit;
+#endif
+#else
+    return __builtin_clzll(input_num);
+#endif
+}
+
+#ifdef FASTFLOAT_32BIT
+
+// slow emulation routine for 32-bit
+fastfloat_really_inline uint64_t emulu(uint32_t x, uint32_t y) {
+    return x * (uint64_t)y;
+}
+
+// slow emulation routine for 32-bit
+#if !defined(__MINGW64__)
+fastfloat_really_inline uint64_t _umul128(uint64_t ab, uint64_t cd,
+    uint64_t *hi) {
+    uint64_t ad = emulu((uint32_t)(ab >> 32), (uint32_t)cd);
+    uint64_t bd = emulu((uint32_t)ab, (uint32_t)cd);
+    uint64_t adbc = ad + emulu((uint32_t)ab, (uint32_t)(cd >> 32));
+    uint64_t adbc_carry = !!(adbc < ad);
+    uint64_t lo = bd + (adbc << 32);
+    *hi = emulu((uint32_t)(ab >> 32), (uint32_t)(cd >> 32)) + (adbc >> 32) +
+          (adbc_carry << 32) + !!(lo < bd);
+    return lo;
+}
+#endif // !__MINGW64__
+
+#endif // FASTFLOAT_32BIT
+
+
+// compute 64-bit a*b
+fastfloat_really_inline value128 full_multiplication(uint64_t a,
+    uint64_t b) {
+    value128 answer;
+#ifdef _M_ARM64
+    // ARM64 has native support for 64-bit multiplications, no need to emulate
+    answer.high = __umulh(a, b);
+    answer.low = a * b;
+#elif defined(FASTFLOAT_32BIT) || (defined(_WIN64) && !defined(__clang__))
+    answer.low = _umul128(a, b, &answer.high); // _umul128 not available on ARM64
+#elif defined(FASTFLOAT_64BIT)
+    __uint128_t r = ((__uint128_t)a) * b;
+    answer.low = uint64_t(r);
+    answer.high = uint64_t(r >> 64);
+#else
+#error Not implemented
+#endif
+    return answer;
+}
+
+
+struct adjusted_mantissa {
+    uint64_t mantissa{0};
+    int power2{0}; // a negative value indicates an invalid result
+    adjusted_mantissa() = default;
+    bool operator==(const adjusted_mantissa &o) const {
+        return mantissa == o.mantissa && power2 == o.power2;
+    }
+    bool operator!=(const adjusted_mantissa &o) const {
+        return mantissa != o.mantissa || power2 != o.power2;
+    }
+};
+
+struct decimal {
+    uint32_t num_digits{0};
+    int32_t decimal_point{0};
+    bool negative{false};
+    bool truncated{false};
+    uint8_t digits[max_digits];
+    decimal() = default;
+    // Copies are not allowed since this is a fat object.
+    decimal(const decimal &) = delete;
+    // Copies are not allowed since this is a fat object.
+    decimal &operator=(const decimal &) = delete;
+    // Moves are allowed:
+    decimal(decimal &&) = default;
+    decimal &operator=(decimal &&other) = default;
+};
+
+constexpr static double powers_of_ten_double[] = {
+    1e0,  1e1,  1e2,  1e3,  1e4,  1e5,  1e6,  1e7,  1e8,  1e9,  1e10, 1e11,
+    1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19, 1e20, 1e21, 1e22};
+constexpr static float powers_of_ten_float[] = {1e0, 1e1, 1e2, 1e3, 1e4, 1e5,
+    1e6, 1e7, 1e8, 1e9, 1e10};
+
+template <typename T> struct binary_format {
+    static inline constexpr int mantissa_explicit_bits();
+    static inline constexpr int minimum_exponent();
+    static inline constexpr int infinite_power();
+    static inline constexpr int sign_index();
+    static inline constexpr int min_exponent_fast_path();
+    static inline constexpr int max_exponent_fast_path();
+    static inline constexpr int max_exponent_round_to_even();
+    static inline constexpr int min_exponent_round_to_even();
+    static inline constexpr uint64_t max_mantissa_fast_path();
+    static inline constexpr int largest_power_of_ten();
+    static inline constexpr int smallest_power_of_ten();
+    static inline constexpr T exact_power_of_ten(int64_t power);
+};
+
+template <> inline constexpr int binary_format<double>::mantissa_explicit_bits() {
+    return 52;
+}
+template <> inline constexpr int binary_format<float>::mantissa_explicit_bits() {
+    return 23;
+}
+
+template <> inline constexpr int binary_format<double>::max_exponent_round_to_even() {
+    return 23;
+}
+
+template <> inline constexpr int binary_format<float>::max_exponent_round_to_even() {
+    return 10;
+}
+
+template <> inline constexpr int binary_format<double>::min_exponent_round_to_even() {
+    return -4;
+}
+
+template <> inline constexpr int binary_format<float>::min_exponent_round_to_even() {
+    return -17;
+}
+
+template <> inline constexpr int binary_format<double>::minimum_exponent() {
+    return -1023;
+}
+template <> inline constexpr int binary_format<float>::minimum_exponent() {
+    return -127;
+}
+
+template <> inline constexpr int binary_format<double>::infinite_power() {
+    return 0x7FF;
+}
+template <> inline constexpr int binary_format<float>::infinite_power() {
+    return 0xFF;
+}
+
+template <> inline constexpr int binary_format<double>::sign_index() { return 63; }
+template <> inline constexpr int binary_format<float>::sign_index() { return 31; }
+
+template <> inline constexpr int binary_format<double>::min_exponent_fast_path() {
+#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0)
+    return 0;
+#else
+    return -22;
+#endif
+}
+template <> inline constexpr int binary_format<float>::min_exponent_fast_path() {
+#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0)
+    return 0;
+#else
+    return -10;
+#endif
+}
+
+template <> inline constexpr int binary_format<double>::max_exponent_fast_path() {
+    return 22;
+}
+template <> inline constexpr int binary_format<float>::max_exponent_fast_path() {
+    return 10;
+}
+
+template <> inline constexpr uint64_t binary_format<double>::max_mantissa_fast_path() {
+    return uint64_t(2) << mantissa_explicit_bits();
+}
+template <> inline constexpr uint64_t binary_format<float>::max_mantissa_fast_path() {
+    return uint64_t(2) << mantissa_explicit_bits();
+}
+
+template <>
+inline constexpr double binary_format<double>::exact_power_of_ten(int64_t power) {
+    return powers_of_ten_double[power];
+}
+template <>
+inline constexpr float binary_format<float>::exact_power_of_ten(int64_t power) {
+
+    return powers_of_ten_float[power];
+}
+
+
+template <>
+inline constexpr int binary_format<double>::largest_power_of_ten() {
+    return 308;
+}
+template <>
+inline constexpr int binary_format<float>::largest_power_of_ten() {
+    return 38;
+}
+
+template <>
+inline constexpr int binary_format<double>::smallest_power_of_ten() {
+    return -342;
+}
+template <>
+inline constexpr int binary_format<float>::smallest_power_of_ten() {
+    return -65;
+}
+
+} // namespace lbug_fast_float
+
+// for convenience:
+template<class OStream>
+inline OStream& operator<<(OStream &out, const lbug_fast_float::decimal &d) {
+    out << "0.";
+    for (size_t i = 0; i < d.num_digits; i++) {
+        out << int32_t(d.digits[i]);
+    }
+    out << " * 10 ** " << d.decimal_point;
+    return out;
+}
+
+#endif
+
+
+#ifndef FASTFLOAT_ASCII_NUMBER_H
+#define FASTFLOAT_ASCII_NUMBER_H
+
+#include <cstdio>
+#include <cctype>
+#include <cstdint>
+#include <cstring>
+
+
+namespace lbug_fast_float {
+
+// Next function can be micro-optimized, but compilers are entirely
+// able to optimize it well.
+fastfloat_really_inline bool is_integer(char c)  noexcept  { return c >= '0' && c <= '9'; }
+
+fastfloat_really_inline uint64_t byteswap(uint64_t val) {
+    return (val & 0xFF00000000000000) >> 56
+           | (val & 0x00FF000000000000) >> 40
+           | (val & 0x0000FF0000000000) >> 24
+           | (val & 0x000000FF00000000) >> 8
+           | (val & 0x00000000FF000000) << 8
+           | (val & 0x0000000000FF0000) << 24
+           | (val & 0x000000000000FF00) << 40
+           | (val & 0x00000000000000FF) << 56;
+}
+
+fastfloat_really_inline uint64_t read_u64(const char *chars) {
+    uint64_t val;
+    ::memcpy(&val, chars, sizeof(uint64_t));
+#if FASTFLOAT_IS_BIG_ENDIAN == 1
+    // Need to read as-if the number was in little-endian order.
+    val = byteswap(val);
+#endif
+    return val;
+}
+
+fastfloat_really_inline void write_u64(uint8_t *chars, uint64_t val) {
+#if FASTFLOAT_IS_BIG_ENDIAN == 1
+    // Need to read as-if the number was in little-endian order.
+    val = byteswap(val);
+#endif
+    ::memcpy(chars, &val, sizeof(uint64_t));
+}
+
+// credit  @aqrit
+fastfloat_really_inline uint32_t  parse_eight_digits_unrolled(uint64_t val) {
+    const uint64_t mask = 0x000000FF000000FF;
+    const uint64_t mul1 = 0x000F424000000064; // 100 + (1000000ULL << 32)
+    const uint64_t mul2 = 0x0000271000000001; // 1 + (10000ULL << 32)
+    val -= 0x3030303030303030;
+    val = (val * 10) + (val >> 8); // val = (val * 2561) >> 8;
+    val = (((val & mask) * mul1) + (((val >> 16) & mask) * mul2)) >> 32;
+    return uint32_t(val);
+}
+
+fastfloat_really_inline uint32_t parse_eight_digits_unrolled(const char *chars)  noexcept  {
+    return parse_eight_digits_unrolled(read_u64(chars));
+}
+
+// credit @aqrit
+fastfloat_really_inline bool is_made_of_eight_digits_fast(uint64_t val)  noexcept  {
+    return !((((val + 0x4646464646464646) | (val - 0x3030303030303030)) &
+              0x8080808080808080));
+}
+
+fastfloat_really_inline bool is_made_of_eight_digits_fast(const char *chars)  noexcept  {
+    return is_made_of_eight_digits_fast(read_u64(chars));
+}
+
+struct parsed_number_string {
+    int64_t exponent;
+    uint64_t mantissa;
+    const char *lastmatch;
+    bool negative;
+    bool valid;
+    bool too_many_digits;
+};
+
+
+// Assuming that you use no more than 19 digits, this will
+// parse an ASCII string.
+fastfloat_really_inline
+    parsed_number_string parse_number_string(const char *p, const char *pend, const char decimal_separator, chars_format fmt) noexcept {
+    parsed_number_string answer;
+    answer.valid = false;
+    answer.too_many_digits = false;
+    answer.negative = (*p == '-');
+    if (*p == '-') { // C++17 20.19.3.(7.1) explicitly forbids '+' sign here
+        ++p;
+        if (p == pend) {
+            return answer;
+        }
+        if (!is_integer(*p) && (*p != decimal_separator)) { // a  sign must be followed by an integer or the dot
+            return answer;
+        }
+    }
+    const char *const start_digits = p;
+
+    uint64_t i = 0; // an unsigned int avoids signed overflows (which are bad)
+
+    while ((p != pend) && is_integer(*p)) {
+        // a multiplication by 10 is cheaper than an arbitrary integer
+        // multiplication
+        i = 10 * i +
+            uint64_t(*p - '0'); // might overflow, we will handle the overflow later
+        ++p;
+    }
+    const char *const end_of_integer_part = p;
+    int64_t digit_count = int64_t(end_of_integer_part - start_digits);
+    int64_t exponent = 0;
+    if ((p != pend) && (*p == decimal_separator)) {
+        ++p;
+        // Fast approach only tested under little endian systems
+        if ((p + 8 <= pend) && is_made_of_eight_digits_fast(p)) {
+            i = i * 100000000 + parse_eight_digits_unrolled(p); // in rare cases, this will overflow, but that's ok
+            p += 8;
+            if ((p + 8 <= pend) && is_made_of_eight_digits_fast(p)) {
+                i = i * 100000000 + parse_eight_digits_unrolled(p); // in rare cases, this will overflow, but that's ok
+                p += 8;
+            }
+        }
+        while ((p != pend) && is_integer(*p)) {
+            uint8_t digit = uint8_t(*p - '0');
+            ++p;
+            i = i * 10 + digit; // in rare cases, this will overflow, but that's ok
+        }
+        exponent = end_of_integer_part + 1 - p;
+        digit_count -= exponent;
+    }
+    // we must have encountered at least one integer!
+    if (digit_count == 0) {
+        return answer;
+    }
+    int64_t exp_number = 0;            // explicit exponential part
+    if ((fmt & chars_format::scientific) && (p != pend) && (('e' == *p) || ('E' == *p))) {
+        const char * location_of_e = p;
+        ++p;
+        bool neg_exp = false;
+        if ((p != pend) && ('-' == *p)) {
+            neg_exp = true;
+            ++p;
+        } else if ((p != pend) && ('+' == *p)) { // '+' on exponent is allowed by C++17 20.19.3.(7.1)
+            ++p;
+        }
+        if ((p == pend) || !is_integer(*p)) {
+            if(!(fmt & chars_format::fixed)) {
+                // We are in error.
+                return answer;
+            }
+            // Otherwise, we will be ignoring the 'e'.
+            p = location_of_e;
+        } else {
+            while ((p != pend) && is_integer(*p)) {
+                uint8_t digit = uint8_t(*p - '0');
+                if (exp_number < 0x10000) {
+                    exp_number = 10 * exp_number + digit;
+                }
+                ++p;
+            }
+            if(neg_exp) { exp_number = - exp_number; }
+            exponent += exp_number;
+        }
+    } else {
+        // If it scientific and not fixed, we have to bail out.
+        if((fmt & chars_format::scientific) && !(fmt & chars_format::fixed)) { return answer; }
+    }
+    answer.lastmatch = p;
+    answer.valid = true;
+
+    // If we frequently had to deal with long strings of digits,
+    // we could extend our code by using a 128-bit integer instead
+    // of a 64-bit integer. However, this is uncommon.
+    //
+    // We can deal with up to 19 digits.
+    if (digit_count > 19) { // this is uncommon
+        // It is possible that the integer had an overflow.
+        // We have to handle the case where we have 0.0000somenumber.
+        // We need to be mindful of the case where we only have zeroes...
+        // E.g., 0.000000000...000.
+        const char *start = start_digits;
+        while ((start != pend) && (*start == '0' || *start == decimal_separator)) {
+            if(*start == '0') { digit_count --; }
+            start++;
+        }
+        if (digit_count > 19) {
+            answer.too_many_digits = true;
+            // Let us start again, this time, avoiding overflows.
+            i = 0;
+            p = start_digits;
+            const uint64_t minimal_nineteen_digit_integer{1000000000000000000};
+            while((i < minimal_nineteen_digit_integer) && (p != pend) && is_integer(*p)) {
+                i = i * 10 + uint64_t(*p - '0');
+                ++p;
+            }
+            if (i >= minimal_nineteen_digit_integer) { // We have a big integers
+                exponent = end_of_integer_part - p + exp_number;
+            } else { // We have a value with a fractional component.
+                p++; // skip the decimal_separator
+                const char *first_after_period = p;
+                while((i < minimal_nineteen_digit_integer) && (p != pend) && is_integer(*p)) {
+                    i = i * 10 + uint64_t(*p - '0');
+                    ++p;
+                }
+                exponent = first_after_period - p + exp_number;
+            }
+            // We have now corrected both exponent and i, to a truncated value
+        }
+    }
+    answer.exponent = exponent;
+    answer.mantissa = i;
+    return answer;
+}
+
+
+// This should always succeed since it follows a call to parse_number_string
+// This function could be optimized. In particular, we could stop after 19 digits
+// and try to bail out. Furthermore, we should be able to recover the computed
+// exponent from the pass in parse_number_string.
+fastfloat_really_inline decimal parse_decimal(const char *p, const char *pend, const char decimal_separator = '.') noexcept {
+    decimal answer;
+    answer.num_digits = 0;
+    answer.decimal_point = 0;
+    answer.truncated = false;
+    answer.negative = (*p == '-');
+    if (*p == '-') { // C++17 20.19.3.(7.1) explicitly forbids '+' sign here
+        ++p;
+    }
+    // skip leading zeroes
+    while ((p != pend) && (*p == '0')) {
+        ++p;
+    }
+    while ((p != pend) && is_integer(*p)) {
+        if (answer.num_digits < max_digits) {
+            answer.digits[answer.num_digits] = uint8_t(*p - '0');
+        }
+        answer.num_digits++;
+        ++p;
+    }
+    if ((p != pend) && (*p == decimal_separator)) {
+        ++p;
+        const char *first_after_period = p;
+        // if we have not yet encountered a zero, we have to skip it as well
+        if(answer.num_digits == 0) {
+            // skip zeros
+            while ((p != pend) && (*p == '0')) {
+                ++p;
+            }
+        }
+        // We expect that this loop will often take the bulk of the running time
+        // because when a value has lots of digits, these digits often
+        while ((p + 8 <= pend) && (answer.num_digits + 8 < max_digits)) {
+            uint64_t val = read_u64(p);
+            if(! is_made_of_eight_digits_fast(val)) { break; }
+            // We have eight digits, process them in one go!
+            val -= 0x3030303030303030;
+            write_u64(answer.digits + answer.num_digits, val);
+            answer.num_digits += 8;
+            p += 8;
+        }
+        while ((p != pend) && is_integer(*p)) {
+            if (answer.num_digits < max_digits) {
+                answer.digits[answer.num_digits] = uint8_t(*p - '0');
+            }
+            answer.num_digits++;
+            ++p;
+        }
+        answer.decimal_point = int32_t(first_after_period - p);
+    }
+    // We want num_digits to be the number of significant digits, excluding
+    // leading *and* trailing zeros! Otherwise the truncated flag later is
+    // going to be misleading.
+    if(answer.num_digits > 0) {
+        // We potentially need the answer.num_digits > 0 guard because we
+        // prune leading zeros. So with answer.num_digits > 0, we know that
+        // we have at least one non-zero digit.
+        const char *preverse = p - 1;
+        int32_t trailing_zeros = 0;
+        while ((*preverse == '0') || (*preverse == decimal_separator)) {
+            if(*preverse == '0') { trailing_zeros++; };
+            --preverse;
+        }
+        answer.decimal_point += int32_t(answer.num_digits);
+        answer.num_digits -= uint32_t(trailing_zeros);
+    }
+    if(answer.num_digits > max_digits) {
+        answer.truncated = true;
+        answer.num_digits = max_digits;
+    }
+    if ((p != pend) && (('e' == *p) || ('E' == *p))) {
+        ++p;
+        bool neg_exp = false;
+        if ((p != pend) && ('-' == *p)) {
+            neg_exp = true;
+            ++p;
+        } else if ((p != pend) && ('+' == *p)) { // '+' on exponent is allowed by C++17 20.19.3.(7.1)
+            ++p;
+        }
+        int32_t exp_number = 0; // exponential part
+        while ((p != pend) && is_integer(*p)) {
+            uint8_t digit = uint8_t(*p - '0');
+            if (exp_number < 0x10000) {
+                exp_number = 10 * exp_number + digit;
+            }
+            ++p;
+        }
+        answer.decimal_point += (neg_exp ? -exp_number : exp_number);
+    }
+    // In very rare cases, we may have fewer than 19 digits, we want to be able to reliably
+    // assume that all digits up to max_digit_without_overflow have been initialized.
+    for(uint32_t i = answer.num_digits; i < max_digit_without_overflow; i++) { answer.digits[i] = 0; }
+
+    return answer;
+}
+} // namespace lbug_fast_float
+
+#endif
+
+
+#ifndef FASTFLOAT_FAST_TABLE_H
+#define FASTFLOAT_FAST_TABLE_H
+#include <cstdint>
+
+namespace lbug_fast_float {
+
+/**
+ * When mapping numbers from decimal to binary,
+ * we go from w * 10^q to m * 2^p but we have
+ * 10^q = 5^q * 2^q, so effectively
+ * we are trying to match
+ * w * 2^q * 5^q to m * 2^p. Thus the powers of two
+ * are not a concern since they can be represented
+ * exactly using the binary notation, only the powers of five
+ * affect the binary significand.
+ */
+
+/**
+ * The smallest non-zero float (binary64) is 2^−1074.
+ * We take as input numbers of the form w x 10^q where w < 2^64.
+ * We have that w * 10^-343  <  2^(64-344) 5^-343 < 2^-1076.
+ * However, we have that
+ * (2^64-1) * 10^-342 =  (2^64-1) * 2^-342 * 5^-342 > 2^−1074.
+ * Thus it is possible for a number of the form w * 10^-342 where
+ * w is a 64-bit value to be a non-zero floating-point number.
+ *********
+ * Any number of form w * 10^309 where w>= 1 is going to be
+ * infinite in binary64 so we never need to worry about powers
+ * of 5 greater than 308.
+ */
+template <class unused = void>
+struct powers_template {
+
+    constexpr static int smallest_power_of_five = binary_format<double>::smallest_power_of_ten();
+    constexpr static int largest_power_of_five = binary_format<double>::largest_power_of_ten();
+    constexpr static int number_of_entries = 2 * (largest_power_of_five - smallest_power_of_five + 1);
+    // Powers of five from 5^-342 all the way to 5^308 rounded toward one.
+    static const uint64_t power_of_five_128[number_of_entries];
+};
+
+template <class unused>
+const uint64_t powers_template<unused>::power_of_five_128[number_of_entries] = {
+    0xeef453d6923bd65a,0x113faa2906a13b3f,
+    0x9558b4661b6565f8,0x4ac7ca59a424c507,
+    0xbaaee17fa23ebf76,0x5d79bcf00d2df649,
+    0xe95a99df8ace6f53,0xf4d82c2c107973dc,
+    0x91d8a02bb6c10594,0x79071b9b8a4be869,
+    0xb64ec836a47146f9,0x9748e2826cdee284,
+    0xe3e27a444d8d98b7,0xfd1b1b2308169b25,
+    0x8e6d8c6ab0787f72,0xfe30f0f5e50e20f7,
+    0xb208ef855c969f4f,0xbdbd2d335e51a935,
+    0xde8b2b66b3bc4723,0xad2c788035e61382,
+    0x8b16fb203055ac76,0x4c3bcb5021afcc31,
+    0xaddcb9e83c6b1793,0xdf4abe242a1bbf3d,
+    0xd953e8624b85dd78,0xd71d6dad34a2af0d,
+    0x87d4713d6f33aa6b,0x8672648c40e5ad68,
+    0xa9c98d8ccb009506,0x680efdaf511f18c2,
+    0xd43bf0effdc0ba48,0x212bd1b2566def2,
+    0x84a57695fe98746d,0x14bb630f7604b57,
+    0xa5ced43b7e3e9188,0x419ea3bd35385e2d,
+    0xcf42894a5dce35ea,0x52064cac828675b9,
+    0x818995ce7aa0e1b2,0x7343efebd1940993,
+    0xa1ebfb4219491a1f,0x1014ebe6c5f90bf8,
+    0xca66fa129f9b60a6,0xd41a26e077774ef6,
+    0xfd00b897478238d0,0x8920b098955522b4,
+    0x9e20735e8cb16382,0x55b46e5f5d5535b0,
+    0xc5a890362fddbc62,0xeb2189f734aa831d,
+    0xf712b443bbd52b7b,0xa5e9ec7501d523e4,
+    0x9a6bb0aa55653b2d,0x47b233c92125366e,
+    0xc1069cd4eabe89f8,0x999ec0bb696e840a,
+    0xf148440a256e2c76,0xc00670ea43ca250d,
+    0x96cd2a865764dbca,0x380406926a5e5728,
+    0xbc807527ed3e12bc,0xc605083704f5ecf2,
+    0xeba09271e88d976b,0xf7864a44c633682e,
+    0x93445b8731587ea3,0x7ab3ee6afbe0211d,
+    0xb8157268fdae9e4c,0x5960ea05bad82964,
+    0xe61acf033d1a45df,0x6fb92487298e33bd,
+    0x8fd0c16206306bab,0xa5d3b6d479f8e056,
+    0xb3c4f1ba87bc8696,0x8f48a4899877186c,
+    0xe0b62e2929aba83c,0x331acdabfe94de87,
+    0x8c71dcd9ba0b4925,0x9ff0c08b7f1d0b14,
+    0xaf8e5410288e1b6f,0x7ecf0ae5ee44dd9,
+    0xdb71e91432b1a24a,0xc9e82cd9f69d6150,
+    0x892731ac9faf056e,0xbe311c083a225cd2,
+    0xab70fe17c79ac6ca,0x6dbd630a48aaf406,
+    0xd64d3d9db981787d,0x92cbbccdad5b108,
+    0x85f0468293f0eb4e,0x25bbf56008c58ea5,
+    0xa76c582338ed2621,0xaf2af2b80af6f24e,
+    0xd1476e2c07286faa,0x1af5af660db4aee1,
+    0x82cca4db847945ca,0x50d98d9fc890ed4d,
+    0xa37fce126597973c,0xe50ff107bab528a0,
+    0xcc5fc196fefd7d0c,0x1e53ed49a96272c8,
+    0xff77b1fcbebcdc4f,0x25e8e89c13bb0f7a,
+    0x9faacf3df73609b1,0x77b191618c54e9ac,
+    0xc795830d75038c1d,0xd59df5b9ef6a2417,
+    0xf97ae3d0d2446f25,0x4b0573286b44ad1d,
+    0x9becce62836ac577,0x4ee367f9430aec32,
+    0xc2e801fb244576d5,0x229c41f793cda73f,
+    0xf3a20279ed56d48a,0x6b43527578c1110f,
+    0x9845418c345644d6,0x830a13896b78aaa9,
+    0xbe5691ef416bd60c,0x23cc986bc656d553,
+    0xedec366b11c6cb8f,0x2cbfbe86b7ec8aa8,
+    0x94b3a202eb1c3f39,0x7bf7d71432f3d6a9,
+    0xb9e08a83a5e34f07,0xdaf5ccd93fb0cc53,
+    0xe858ad248f5c22c9,0xd1b3400f8f9cff68,
+    0x91376c36d99995be,0x23100809b9c21fa1,
+    0xb58547448ffffb2d,0xabd40a0c2832a78a,
+    0xe2e69915b3fff9f9,0x16c90c8f323f516c,
+    0x8dd01fad907ffc3b,0xae3da7d97f6792e3,
+    0xb1442798f49ffb4a,0x99cd11cfdf41779c,
+    0xdd95317f31c7fa1d,0x40405643d711d583,
+    0x8a7d3eef7f1cfc52,0x482835ea666b2572,
+    0xad1c8eab5ee43b66,0xda3243650005eecf,
+    0xd863b256369d4a40,0x90bed43e40076a82,
+    0x873e4f75e2224e68,0x5a7744a6e804a291,
+    0xa90de3535aaae202,0x711515d0a205cb36,
+    0xd3515c2831559a83,0xd5a5b44ca873e03,
+    0x8412d9991ed58091,0xe858790afe9486c2,
+    0xa5178fff668ae0b6,0x626e974dbe39a872,
+    0xce5d73ff402d98e3,0xfb0a3d212dc8128f,
+    0x80fa687f881c7f8e,0x7ce66634bc9d0b99,
+    0xa139029f6a239f72,0x1c1fffc1ebc44e80,
+    0xc987434744ac874e,0xa327ffb266b56220,
+    0xfbe9141915d7a922,0x4bf1ff9f0062baa8,
+    0x9d71ac8fada6c9b5,0x6f773fc3603db4a9,
+    0xc4ce17b399107c22,0xcb550fb4384d21d3,
+    0xf6019da07f549b2b,0x7e2a53a146606a48,
+    0x99c102844f94e0fb,0x2eda7444cbfc426d,
+    0xc0314325637a1939,0xfa911155fefb5308,
+    0xf03d93eebc589f88,0x793555ab7eba27ca,
+    0x96267c7535b763b5,0x4bc1558b2f3458de,
+    0xbbb01b9283253ca2,0x9eb1aaedfb016f16,
+    0xea9c227723ee8bcb,0x465e15a979c1cadc,
+    0x92a1958a7675175f,0xbfacd89ec191ec9,
+    0xb749faed14125d36,0xcef980ec671f667b,
+    0xe51c79a85916f484,0x82b7e12780e7401a,
+    0x8f31cc0937ae58d2,0xd1b2ecb8b0908810,
+    0xb2fe3f0b8599ef07,0x861fa7e6dcb4aa15,
+    0xdfbdcece67006ac9,0x67a791e093e1d49a,
+    0x8bd6a141006042bd,0xe0c8bb2c5c6d24e0,
+    0xaecc49914078536d,0x58fae9f773886e18,
+    0xda7f5bf590966848,0xaf39a475506a899e,
+    0x888f99797a5e012d,0x6d8406c952429603,
+    0xaab37fd7d8f58178,0xc8e5087ba6d33b83,
+    0xd5605fcdcf32e1d6,0xfb1e4a9a90880a64,
+    0x855c3be0a17fcd26,0x5cf2eea09a55067f,
+    0xa6b34ad8c9dfc06f,0xf42faa48c0ea481e,
+    0xd0601d8efc57b08b,0xf13b94daf124da26,
+    0x823c12795db6ce57,0x76c53d08d6b70858,
+    0xa2cb1717b52481ed,0x54768c4b0c64ca6e,
+    0xcb7ddcdda26da268,0xa9942f5dcf7dfd09,
+    0xfe5d54150b090b02,0xd3f93b35435d7c4c,
+    0x9efa548d26e5a6e1,0xc47bc5014a1a6daf,
+    0xc6b8e9b0709f109a,0x359ab6419ca1091b,
+    0xf867241c8cc6d4c0,0xc30163d203c94b62,
+    0x9b407691d7fc44f8,0x79e0de63425dcf1d,
+    0xc21094364dfb5636,0x985915fc12f542e4,
+    0xf294b943e17a2bc4,0x3e6f5b7b17b2939d,
+    0x979cf3ca6cec5b5a,0xa705992ceecf9c42,
+    0xbd8430bd08277231,0x50c6ff782a838353,
+    0xece53cec4a314ebd,0xa4f8bf5635246428,
+    0x940f4613ae5ed136,0x871b7795e136be99,
+    0xb913179899f68584,0x28e2557b59846e3f,
+    0xe757dd7ec07426e5,0x331aeada2fe589cf,
+    0x9096ea6f3848984f,0x3ff0d2c85def7621,
+    0xb4bca50b065abe63,0xfed077a756b53a9,
+    0xe1ebce4dc7f16dfb,0xd3e8495912c62894,
+    0x8d3360f09cf6e4bd,0x64712dd7abbbd95c,
+    0xb080392cc4349dec,0xbd8d794d96aacfb3,
+    0xdca04777f541c567,0xecf0d7a0fc5583a0,
+    0x89e42caaf9491b60,0xf41686c49db57244,
+    0xac5d37d5b79b6239,0x311c2875c522ced5,
+    0xd77485cb25823ac7,0x7d633293366b828b,
+    0x86a8d39ef77164bc,0xae5dff9c02033197,
+    0xa8530886b54dbdeb,0xd9f57f830283fdfc,
+    0xd267caa862a12d66,0xd072df63c324fd7b,
+    0x8380dea93da4bc60,0x4247cb9e59f71e6d,
+    0xa46116538d0deb78,0x52d9be85f074e608,
+    0xcd795be870516656,0x67902e276c921f8b,
+    0x806bd9714632dff6,0xba1cd8a3db53b6,
+    0xa086cfcd97bf97f3,0x80e8a40eccd228a4,
+    0xc8a883c0fdaf7df0,0x6122cd128006b2cd,
+    0xfad2a4b13d1b5d6c,0x796b805720085f81,
+    0x9cc3a6eec6311a63,0xcbe3303674053bb0,
+    0xc3f490aa77bd60fc,0xbedbfc4411068a9c,
+    0xf4f1b4d515acb93b,0xee92fb5515482d44,
+    0x991711052d8bf3c5,0x751bdd152d4d1c4a,
+    0xbf5cd54678eef0b6,0xd262d45a78a0635d,
+    0xef340a98172aace4,0x86fb897116c87c34,
+    0x9580869f0e7aac0e,0xd45d35e6ae3d4da0,
+    0xbae0a846d2195712,0x8974836059cca109,
+    0xe998d258869facd7,0x2bd1a438703fc94b,
+    0x91ff83775423cc06,0x7b6306a34627ddcf,
+    0xb67f6455292cbf08,0x1a3bc84c17b1d542,
+    0xe41f3d6a7377eeca,0x20caba5f1d9e4a93,
+    0x8e938662882af53e,0x547eb47b7282ee9c,
+    0xb23867fb2a35b28d,0xe99e619a4f23aa43,
+    0xdec681f9f4c31f31,0x6405fa00e2ec94d4,
+    0x8b3c113c38f9f37e,0xde83bc408dd3dd04,
+    0xae0b158b4738705e,0x9624ab50b148d445,
+    0xd98ddaee19068c76,0x3badd624dd9b0957,
+    0x87f8a8d4cfa417c9,0xe54ca5d70a80e5d6,
+    0xa9f6d30a038d1dbc,0x5e9fcf4ccd211f4c,
+    0xd47487cc8470652b,0x7647c3200069671f,
+    0x84c8d4dfd2c63f3b,0x29ecd9f40041e073,
+    0xa5fb0a17c777cf09,0xf468107100525890,
+    0xcf79cc9db955c2cc,0x7182148d4066eeb4,
+    0x81ac1fe293d599bf,0xc6f14cd848405530,
+    0xa21727db38cb002f,0xb8ada00e5a506a7c,
+    0xca9cf1d206fdc03b,0xa6d90811f0e4851c,
+    0xfd442e4688bd304a,0x908f4a166d1da663,
+    0x9e4a9cec15763e2e,0x9a598e4e043287fe,
+    0xc5dd44271ad3cdba,0x40eff1e1853f29fd,
+    0xf7549530e188c128,0xd12bee59e68ef47c,
+    0x9a94dd3e8cf578b9,0x82bb74f8301958ce,
+    0xc13a148e3032d6e7,0xe36a52363c1faf01,
+    0xf18899b1bc3f8ca1,0xdc44e6c3cb279ac1,
+    0x96f5600f15a7b7e5,0x29ab103a5ef8c0b9,
+    0xbcb2b812db11a5de,0x7415d448f6b6f0e7,
+    0xebdf661791d60f56,0x111b495b3464ad21,
+    0x936b9fcebb25c995,0xcab10dd900beec34,
+    0xb84687c269ef3bfb,0x3d5d514f40eea742,
+    0xe65829b3046b0afa,0xcb4a5a3112a5112,
+    0x8ff71a0fe2c2e6dc,0x47f0e785eaba72ab,
+    0xb3f4e093db73a093,0x59ed216765690f56,
+    0xe0f218b8d25088b8,0x306869c13ec3532c,
+    0x8c974f7383725573,0x1e414218c73a13fb,
+    0xafbd2350644eeacf,0xe5d1929ef90898fa,
+    0xdbac6c247d62a583,0xdf45f746b74abf39,
+    0x894bc396ce5da772,0x6b8bba8c328eb783,
+    0xab9eb47c81f5114f,0x66ea92f3f326564,
+    0xd686619ba27255a2,0xc80a537b0efefebd,
+    0x8613fd0145877585,0xbd06742ce95f5f36,
+    0xa798fc4196e952e7,0x2c48113823b73704,
+    0xd17f3b51fca3a7a0,0xf75a15862ca504c5,
+    0x82ef85133de648c4,0x9a984d73dbe722fb,
+    0xa3ab66580d5fdaf5,0xc13e60d0d2e0ebba,
+    0xcc963fee10b7d1b3,0x318df905079926a8,
+    0xffbbcfe994e5c61f,0xfdf17746497f7052,
+    0x9fd561f1fd0f9bd3,0xfeb6ea8bedefa633,
+    0xc7caba6e7c5382c8,0xfe64a52ee96b8fc0,
+    0xf9bd690a1b68637b,0x3dfdce7aa3c673b0,
+    0x9c1661a651213e2d,0x6bea10ca65c084e,
+    0xc31bfa0fe5698db8,0x486e494fcff30a62,
+    0xf3e2f893dec3f126,0x5a89dba3c3efccfa,
+    0x986ddb5c6b3a76b7,0xf89629465a75e01c,
+    0xbe89523386091465,0xf6bbb397f1135823,
+    0xee2ba6c0678b597f,0x746aa07ded582e2c,
+    0x94db483840b717ef,0xa8c2a44eb4571cdc,
+    0xba121a4650e4ddeb,0x92f34d62616ce413,
+    0xe896a0d7e51e1566,0x77b020baf9c81d17,
+    0x915e2486ef32cd60,0xace1474dc1d122e,
+    0xb5b5ada8aaff80b8,0xd819992132456ba,
+    0xe3231912d5bf60e6,0x10e1fff697ed6c69,
+    0x8df5efabc5979c8f,0xca8d3ffa1ef463c1,
+    0xb1736b96b6fd83b3,0xbd308ff8a6b17cb2,
+    0xddd0467c64bce4a0,0xac7cb3f6d05ddbde,
+    0x8aa22c0dbef60ee4,0x6bcdf07a423aa96b,
+    0xad4ab7112eb3929d,0x86c16c98d2c953c6,
+    0xd89d64d57a607744,0xe871c7bf077ba8b7,
+    0x87625f056c7c4a8b,0x11471cd764ad4972,
+    0xa93af6c6c79b5d2d,0xd598e40d3dd89bcf,
+    0xd389b47879823479,0x4aff1d108d4ec2c3,
+    0x843610cb4bf160cb,0xcedf722a585139ba,
+    0xa54394fe1eedb8fe,0xc2974eb4ee658828,
+    0xce947a3da6a9273e,0x733d226229feea32,
+    0x811ccc668829b887,0x806357d5a3f525f,
+    0xa163ff802a3426a8,0xca07c2dcb0cf26f7,
+    0xc9bcff6034c13052,0xfc89b393dd02f0b5,
+    0xfc2c3f3841f17c67,0xbbac2078d443ace2,
+    0x9d9ba7832936edc0,0xd54b944b84aa4c0d,
+    0xc5029163f384a931,0xa9e795e65d4df11,
+    0xf64335bcf065d37d,0x4d4617b5ff4a16d5,
+    0x99ea0196163fa42e,0x504bced1bf8e4e45,
+    0xc06481fb9bcf8d39,0xe45ec2862f71e1d6,
+    0xf07da27a82c37088,0x5d767327bb4e5a4c,
+    0x964e858c91ba2655,0x3a6a07f8d510f86f,
+    0xbbe226efb628afea,0x890489f70a55368b,
+    0xeadab0aba3b2dbe5,0x2b45ac74ccea842e,
+    0x92c8ae6b464fc96f,0x3b0b8bc90012929d,
+    0xb77ada0617e3bbcb,0x9ce6ebb40173744,
+    0xe55990879ddcaabd,0xcc420a6a101d0515,
+    0x8f57fa54c2a9eab6,0x9fa946824a12232d,
+    0xb32df8e9f3546564,0x47939822dc96abf9,
+    0xdff9772470297ebd,0x59787e2b93bc56f7,
+    0x8bfbea76c619ef36,0x57eb4edb3c55b65a,
+    0xaefae51477a06b03,0xede622920b6b23f1,
+    0xdab99e59958885c4,0xe95fab368e45eced,
+    0x88b402f7fd75539b,0x11dbcb0218ebb414,
+    0xaae103b5fcd2a881,0xd652bdc29f26a119,
+    0xd59944a37c0752a2,0x4be76d3346f0495f,
+    0x857fcae62d8493a5,0x6f70a4400c562ddb,
+    0xa6dfbd9fb8e5b88e,0xcb4ccd500f6bb952,
+    0xd097ad07a71f26b2,0x7e2000a41346a7a7,
+    0x825ecc24c873782f,0x8ed400668c0c28c8,
+    0xa2f67f2dfa90563b,0x728900802f0f32fa,
+    0xcbb41ef979346bca,0x4f2b40a03ad2ffb9,
+    0xfea126b7d78186bc,0xe2f610c84987bfa8,
+    0x9f24b832e6b0f436,0xdd9ca7d2df4d7c9,
+    0xc6ede63fa05d3143,0x91503d1c79720dbb,
+    0xf8a95fcf88747d94,0x75a44c6397ce912a,
+    0x9b69dbe1b548ce7c,0xc986afbe3ee11aba,
+    0xc24452da229b021b,0xfbe85badce996168,
+    0xf2d56790ab41c2a2,0xfae27299423fb9c3,
+    0x97c560ba6b0919a5,0xdccd879fc967d41a,
+    0xbdb6b8e905cb600f,0x5400e987bbc1c920,
+    0xed246723473e3813,0x290123e9aab23b68,
+    0x9436c0760c86e30b,0xf9a0b6720aaf6521,
+    0xb94470938fa89bce,0xf808e40e8d5b3e69,
+    0xe7958cb87392c2c2,0xb60b1d1230b20e04,
+    0x90bd77f3483bb9b9,0xb1c6f22b5e6f48c2,
+    0xb4ecd5f01a4aa828,0x1e38aeb6360b1af3,
+    0xe2280b6c20dd5232,0x25c6da63c38de1b0,
+    0x8d590723948a535f,0x579c487e5a38ad0e,
+    0xb0af48ec79ace837,0x2d835a9df0c6d851,
+    0xdcdb1b2798182244,0xf8e431456cf88e65,
+    0x8a08f0f8bf0f156b,0x1b8e9ecb641b58ff,
+    0xac8b2d36eed2dac5,0xe272467e3d222f3f,
+    0xd7adf884aa879177,0x5b0ed81dcc6abb0f,
+    0x86ccbb52ea94baea,0x98e947129fc2b4e9,
+    0xa87fea27a539e9a5,0x3f2398d747b36224,
+    0xd29fe4b18e88640e,0x8eec7f0d19a03aad,
+    0x83a3eeeef9153e89,0x1953cf68300424ac,
+    0xa48ceaaab75a8e2b,0x5fa8c3423c052dd7,
+    0xcdb02555653131b6,0x3792f412cb06794d,
+    0x808e17555f3ebf11,0xe2bbd88bbee40bd0,
+    0xa0b19d2ab70e6ed6,0x5b6aceaeae9d0ec4,
+    0xc8de047564d20a8b,0xf245825a5a445275,
+    0xfb158592be068d2e,0xeed6e2f0f0d56712,
+    0x9ced737bb6c4183d,0x55464dd69685606b,
+    0xc428d05aa4751e4c,0xaa97e14c3c26b886,
+    0xf53304714d9265df,0xd53dd99f4b3066a8,
+    0x993fe2c6d07b7fab,0xe546a8038efe4029,
+    0xbf8fdb78849a5f96,0xde98520472bdd033,
+    0xef73d256a5c0f77c,0x963e66858f6d4440,
+    0x95a8637627989aad,0xdde7001379a44aa8,
+    0xbb127c53b17ec159,0x5560c018580d5d52,
+    0xe9d71b689dde71af,0xaab8f01e6e10b4a6,
+    0x9226712162ab070d,0xcab3961304ca70e8,
+    0xb6b00d69bb55c8d1,0x3d607b97c5fd0d22,
+    0xe45c10c42a2b3b05,0x8cb89a7db77c506a,
+    0x8eb98a7a9a5b04e3,0x77f3608e92adb242,
+    0xb267ed1940f1c61c,0x55f038b237591ed3,
+    0xdf01e85f912e37a3,0x6b6c46dec52f6688,
+    0x8b61313bbabce2c6,0x2323ac4b3b3da015,
+    0xae397d8aa96c1b77,0xabec975e0a0d081a,
+    0xd9c7dced53c72255,0x96e7bd358c904a21,
+    0x881cea14545c7575,0x7e50d64177da2e54,
+    0xaa242499697392d2,0xdde50bd1d5d0b9e9,
+    0xd4ad2dbfc3d07787,0x955e4ec64b44e864,
+    0x84ec3c97da624ab4,0xbd5af13bef0b113e,
+    0xa6274bbdd0fadd61,0xecb1ad8aeacdd58e,
+    0xcfb11ead453994ba,0x67de18eda5814af2,
+    0x81ceb32c4b43fcf4,0x80eacf948770ced7,
+    0xa2425ff75e14fc31,0xa1258379a94d028d,
+    0xcad2f7f5359a3b3e,0x96ee45813a04330,
+    0xfd87b5f28300ca0d,0x8bca9d6e188853fc,
+    0x9e74d1b791e07e48,0x775ea264cf55347e,
+    0xc612062576589dda,0x95364afe032a819e,
+    0xf79687aed3eec551,0x3a83ddbd83f52205,
+    0x9abe14cd44753b52,0xc4926a9672793543,
+    0xc16d9a0095928a27,0x75b7053c0f178294,
+    0xf1c90080baf72cb1,0x5324c68b12dd6339,
+    0x971da05074da7bee,0xd3f6fc16ebca5e04,
+    0xbce5086492111aea,0x88f4bb1ca6bcf585,
+    0xec1e4a7db69561a5,0x2b31e9e3d06c32e6,
+    0x9392ee8e921d5d07,0x3aff322e62439fd0,
+    0xb877aa3236a4b449,0x9befeb9fad487c3,
+    0xe69594bec44de15b,0x4c2ebe687989a9b4,
+    0x901d7cf73ab0acd9,0xf9d37014bf60a11,
+    0xb424dc35095cd80f,0x538484c19ef38c95,
+    0xe12e13424bb40e13,0x2865a5f206b06fba,
+    0x8cbccc096f5088cb,0xf93f87b7442e45d4,
+    0xafebff0bcb24aafe,0xf78f69a51539d749,
+    0xdbe6fecebdedd5be,0xb573440e5a884d1c,
+    0x89705f4136b4a597,0x31680a88f8953031,
+    0xabcc77118461cefc,0xfdc20d2b36ba7c3e,
+    0xd6bf94d5e57a42bc,0x3d32907604691b4d,
+    0x8637bd05af6c69b5,0xa63f9a49c2c1b110,
+    0xa7c5ac471b478423,0xfcf80dc33721d54,
+    0xd1b71758e219652b,0xd3c36113404ea4a9,
+    0x83126e978d4fdf3b,0x645a1cac083126ea,
+    0xa3d70a3d70a3d70a,0x3d70a3d70a3d70a4,
+    0xcccccccccccccccc,0xcccccccccccccccd,
+    0x8000000000000000,0x0,
+    0xa000000000000000,0x0,
+    0xc800000000000000,0x0,
+    0xfa00000000000000,0x0,
+    0x9c40000000000000,0x0,
+    0xc350000000000000,0x0,
+    0xf424000000000000,0x0,
+    0x9896800000000000,0x0,
+    0xbebc200000000000,0x0,
+    0xee6b280000000000,0x0,
+    0x9502f90000000000,0x0,
+    0xba43b74000000000,0x0,
+    0xe8d4a51000000000,0x0,
+    0x9184e72a00000000,0x0,
+    0xb5e620f480000000,0x0,
+    0xe35fa931a0000000,0x0,
+    0x8e1bc9bf04000000,0x0,
+    0xb1a2bc2ec5000000,0x0,
+    0xde0b6b3a76400000,0x0,
+    0x8ac7230489e80000,0x0,
+    0xad78ebc5ac620000,0x0,
+    0xd8d726b7177a8000,0x0,
+    0x878678326eac9000,0x0,
+    0xa968163f0a57b400,0x0,
+    0xd3c21bcecceda100,0x0,
+    0x84595161401484a0,0x0,
+    0xa56fa5b99019a5c8,0x0,
+    0xcecb8f27f4200f3a,0x0,
+    0x813f3978f8940984,0x4000000000000000,
+    0xa18f07d736b90be5,0x5000000000000000,
+    0xc9f2c9cd04674ede,0xa400000000000000,
+    0xfc6f7c4045812296,0x4d00000000000000,
+    0x9dc5ada82b70b59d,0xf020000000000000,
+    0xc5371912364ce305,0x6c28000000000000,
+    0xf684df56c3e01bc6,0xc732000000000000,
+    0x9a130b963a6c115c,0x3c7f400000000000,
+    0xc097ce7bc90715b3,0x4b9f100000000000,
+    0xf0bdc21abb48db20,0x1e86d40000000000,
+    0x96769950b50d88f4,0x1314448000000000,
+    0xbc143fa4e250eb31,0x17d955a000000000,
+    0xeb194f8e1ae525fd,0x5dcfab0800000000,
+    0x92efd1b8d0cf37be,0x5aa1cae500000000,
+    0xb7abc627050305ad,0xf14a3d9e40000000,
+    0xe596b7b0c643c719,0x6d9ccd05d0000000,
+    0x8f7e32ce7bea5c6f,0xe4820023a2000000,
+    0xb35dbf821ae4f38b,0xdda2802c8a800000,
+    0xe0352f62a19e306e,0xd50b2037ad200000,
+    0x8c213d9da502de45,0x4526f422cc340000,
+    0xaf298d050e4395d6,0x9670b12b7f410000,
+    0xdaf3f04651d47b4c,0x3c0cdd765f114000,
+    0x88d8762bf324cd0f,0xa5880a69fb6ac800,
+    0xab0e93b6efee0053,0x8eea0d047a457a00,
+    0xd5d238a4abe98068,0x72a4904598d6d880,
+    0x85a36366eb71f041,0x47a6da2b7f864750,
+    0xa70c3c40a64e6c51,0x999090b65f67d924,
+    0xd0cf4b50cfe20765,0xfff4b4e3f741cf6d,
+    0x82818f1281ed449f,0xbff8f10e7a8921a4,
+    0xa321f2d7226895c7,0xaff72d52192b6a0d,
+    0xcbea6f8ceb02bb39,0x9bf4f8a69f764490,
+    0xfee50b7025c36a08,0x2f236d04753d5b4,
+    0x9f4f2726179a2245,0x1d762422c946590,
+    0xc722f0ef9d80aad6,0x424d3ad2b7b97ef5,
+    0xf8ebad2b84e0d58b,0xd2e0898765a7deb2,
+    0x9b934c3b330c8577,0x63cc55f49f88eb2f,
+    0xc2781f49ffcfa6d5,0x3cbf6b71c76b25fb,
+    0xf316271c7fc3908a,0x8bef464e3945ef7a,
+    0x97edd871cfda3a56,0x97758bf0e3cbb5ac,
+    0xbde94e8e43d0c8ec,0x3d52eeed1cbea317,
+    0xed63a231d4c4fb27,0x4ca7aaa863ee4bdd,
+    0x945e455f24fb1cf8,0x8fe8caa93e74ef6a,
+    0xb975d6b6ee39e436,0xb3e2fd538e122b44,
+    0xe7d34c64a9c85d44,0x60dbbca87196b616,
+    0x90e40fbeea1d3a4a,0xbc8955e946fe31cd,
+    0xb51d13aea4a488dd,0x6babab6398bdbe41,
+    0xe264589a4dcdab14,0xc696963c7eed2dd1,
+    0x8d7eb76070a08aec,0xfc1e1de5cf543ca2,
+    0xb0de65388cc8ada8,0x3b25a55f43294bcb,
+    0xdd15fe86affad912,0x49ef0eb713f39ebe,
+    0x8a2dbf142dfcc7ab,0x6e3569326c784337,
+    0xacb92ed9397bf996,0x49c2c37f07965404,
+    0xd7e77a8f87daf7fb,0xdc33745ec97be906,
+    0x86f0ac99b4e8dafd,0x69a028bb3ded71a3,
+    0xa8acd7c0222311bc,0xc40832ea0d68ce0c,
+    0xd2d80db02aabd62b,0xf50a3fa490c30190,
+    0x83c7088e1aab65db,0x792667c6da79e0fa,
+    0xa4b8cab1a1563f52,0x577001b891185938,
+    0xcde6fd5e09abcf26,0xed4c0226b55e6f86,
+    0x80b05e5ac60b6178,0x544f8158315b05b4,
+    0xa0dc75f1778e39d6,0x696361ae3db1c721,
+    0xc913936dd571c84c,0x3bc3a19cd1e38e9,
+    0xfb5878494ace3a5f,0x4ab48a04065c723,
+    0x9d174b2dcec0e47b,0x62eb0d64283f9c76,
+    0xc45d1df942711d9a,0x3ba5d0bd324f8394,
+    0xf5746577930d6500,0xca8f44ec7ee36479,
+    0x9968bf6abbe85f20,0x7e998b13cf4e1ecb,
+    0xbfc2ef456ae276e8,0x9e3fedd8c321a67e,
+    0xefb3ab16c59b14a2,0xc5cfe94ef3ea101e,
+    0x95d04aee3b80ece5,0xbba1f1d158724a12,
+    0xbb445da9ca61281f,0x2a8a6e45ae8edc97,
+    0xea1575143cf97226,0xf52d09d71a3293bd,
+    0x924d692ca61be758,0x593c2626705f9c56,
+    0xb6e0c377cfa2e12e,0x6f8b2fb00c77836c,
+    0xe498f455c38b997a,0xb6dfb9c0f956447,
+    0x8edf98b59a373fec,0x4724bd4189bd5eac,
+    0xb2977ee300c50fe7,0x58edec91ec2cb657,
+    0xdf3d5e9bc0f653e1,0x2f2967b66737e3ed,
+    0x8b865b215899f46c,0xbd79e0d20082ee74,
+    0xae67f1e9aec07187,0xecd8590680a3aa11,
+    0xda01ee641a708de9,0xe80e6f4820cc9495,
+    0x884134fe908658b2,0x3109058d147fdcdd,
+    0xaa51823e34a7eede,0xbd4b46f0599fd415,
+    0xd4e5e2cdc1d1ea96,0x6c9e18ac7007c91a,
+    0x850fadc09923329e,0x3e2cf6bc604ddb0,
+    0xa6539930bf6bff45,0x84db8346b786151c,
+    0xcfe87f7cef46ff16,0xe612641865679a63,
+    0x81f14fae158c5f6e,0x4fcb7e8f3f60c07e,
+    0xa26da3999aef7749,0xe3be5e330f38f09d,
+    0xcb090c8001ab551c,0x5cadf5bfd3072cc5,
+    0xfdcb4fa002162a63,0x73d9732fc7c8f7f6,
+    0x9e9f11c4014dda7e,0x2867e7fddcdd9afa,
+    0xc646d63501a1511d,0xb281e1fd541501b8,
+    0xf7d88bc24209a565,0x1f225a7ca91a4226,
+    0x9ae757596946075f,0x3375788de9b06958,
+    0xc1a12d2fc3978937,0x52d6b1641c83ae,
+    0xf209787bb47d6b84,0xc0678c5dbd23a49a,
+    0x9745eb4d50ce6332,0xf840b7ba963646e0,
+    0xbd176620a501fbff,0xb650e5a93bc3d898,
+    0xec5d3fa8ce427aff,0xa3e51f138ab4cebe,
+    0x93ba47c980e98cdf,0xc66f336c36b10137,
+    0xb8a8d9bbe123f017,0xb80b0047445d4184,
+    0xe6d3102ad96cec1d,0xa60dc059157491e5,
+    0x9043ea1ac7e41392,0x87c89837ad68db2f,
+    0xb454e4a179dd1877,0x29babe4598c311fb,
+    0xe16a1dc9d8545e94,0xf4296dd6fef3d67a,
+    0x8ce2529e2734bb1d,0x1899e4a65f58660c,
+    0xb01ae745b101e9e4,0x5ec05dcff72e7f8f,
+    0xdc21a1171d42645d,0x76707543f4fa1f73,
+    0x899504ae72497eba,0x6a06494a791c53a8,
+    0xabfa45da0edbde69,0x487db9d17636892,
+    0xd6f8d7509292d603,0x45a9d2845d3c42b6,
+    0x865b86925b9bc5c2,0xb8a2392ba45a9b2,
+    0xa7f26836f282b732,0x8e6cac7768d7141e,
+    0xd1ef0244af2364ff,0x3207d795430cd926,
+    0x8335616aed761f1f,0x7f44e6bd49e807b8,
+    0xa402b9c5a8d3a6e7,0x5f16206c9c6209a6,
+    0xcd036837130890a1,0x36dba887c37a8c0f,
+    0x802221226be55a64,0xc2494954da2c9789,
+    0xa02aa96b06deb0fd,0xf2db9baa10b7bd6c,
+    0xc83553c5c8965d3d,0x6f92829494e5acc7,
+    0xfa42a8b73abbf48c,0xcb772339ba1f17f9,
+    0x9c69a97284b578d7,0xff2a760414536efb,
+    0xc38413cf25e2d70d,0xfef5138519684aba,
+    0xf46518c2ef5b8cd1,0x7eb258665fc25d69,
+    0x98bf2f79d5993802,0xef2f773ffbd97a61,
+    0xbeeefb584aff8603,0xaafb550ffacfd8fa,
+    0xeeaaba2e5dbf6784,0x95ba2a53f983cf38,
+    0x952ab45cfa97a0b2,0xdd945a747bf26183,
+    0xba756174393d88df,0x94f971119aeef9e4,
+    0xe912b9d1478ceb17,0x7a37cd5601aab85d,
+    0x91abb422ccb812ee,0xac62e055c10ab33a,
+    0xb616a12b7fe617aa,0x577b986b314d6009,
+    0xe39c49765fdf9d94,0xed5a7e85fda0b80b,
+    0x8e41ade9fbebc27d,0x14588f13be847307,
+    0xb1d219647ae6b31c,0x596eb2d8ae258fc8,
+    0xde469fbd99a05fe3,0x6fca5f8ed9aef3bb,
+    0x8aec23d680043bee,0x25de7bb9480d5854,
+    0xada72ccc20054ae9,0xaf561aa79a10ae6a,
+    0xd910f7ff28069da4,0x1b2ba1518094da04,
+    0x87aa9aff79042286,0x90fb44d2f05d0842,
+    0xa99541bf57452b28,0x353a1607ac744a53,
+    0xd3fa922f2d1675f2,0x42889b8997915ce8,
+    0x847c9b5d7c2e09b7,0x69956135febada11,
+    0xa59bc234db398c25,0x43fab9837e699095,
+    0xcf02b2c21207ef2e,0x94f967e45e03f4bb,
+    0x8161afb94b44f57d,0x1d1be0eebac278f5,
+    0xa1ba1ba79e1632dc,0x6462d92a69731732,
+    0xca28a291859bbf93,0x7d7b8f7503cfdcfe,
+    0xfcb2cb35e702af78,0x5cda735244c3d43e,
+    0x9defbf01b061adab,0x3a0888136afa64a7,
+    0xc56baec21c7a1916,0x88aaa1845b8fdd0,
+    0xf6c69a72a3989f5b,0x8aad549e57273d45,
+    0x9a3c2087a63f6399,0x36ac54e2f678864b,
+    0xc0cb28a98fcf3c7f,0x84576a1bb416a7dd,
+    0xf0fdf2d3f3c30b9f,0x656d44a2a11c51d5,
+    0x969eb7c47859e743,0x9f644ae5a4b1b325,
+    0xbc4665b596706114,0x873d5d9f0dde1fee,
+    0xeb57ff22fc0c7959,0xa90cb506d155a7ea,
+    0x9316ff75dd87cbd8,0x9a7f12442d588f2,
+    0xb7dcbf5354e9bece,0xc11ed6d538aeb2f,
+    0xe5d3ef282a242e81,0x8f1668c8a86da5fa,
+    0x8fa475791a569d10,0xf96e017d694487bc,
+    0xb38d92d760ec4455,0x37c981dcc395a9ac,
+    0xe070f78d3927556a,0x85bbe253f47b1417,
+    0x8c469ab843b89562,0x93956d7478ccec8e,
+    0xaf58416654a6babb,0x387ac8d1970027b2,
+    0xdb2e51bfe9d0696a,0x6997b05fcc0319e,
+    0x88fcf317f22241e2,0x441fece3bdf81f03,
+    0xab3c2fddeeaad25a,0xd527e81cad7626c3,
+    0xd60b3bd56a5586f1,0x8a71e223d8d3b074,
+    0x85c7056562757456,0xf6872d5667844e49,
+    0xa738c6bebb12d16c,0xb428f8ac016561db,
+    0xd106f86e69d785c7,0xe13336d701beba52,
+    0x82a45b450226b39c,0xecc0024661173473,
+    0xa34d721642b06084,0x27f002d7f95d0190,
+    0xcc20ce9bd35c78a5,0x31ec038df7b441f4,
+    0xff290242c83396ce,0x7e67047175a15271,
+    0x9f79a169bd203e41,0xf0062c6e984d386,
+    0xc75809c42c684dd1,0x52c07b78a3e60868,
+    0xf92e0c3537826145,0xa7709a56ccdf8a82,
+    0x9bbcc7a142b17ccb,0x88a66076400bb691,
+    0xc2abf989935ddbfe,0x6acff893d00ea435,
+    0xf356f7ebf83552fe,0x583f6b8c4124d43,
+    0x98165af37b2153de,0xc3727a337a8b704a,
+    0xbe1bf1b059e9a8d6,0x744f18c0592e4c5c,
+    0xeda2ee1c7064130c,0x1162def06f79df73,
+    0x9485d4d1c63e8be7,0x8addcb5645ac2ba8,
+    0xb9a74a0637ce2ee1,0x6d953e2bd7173692,
+    0xe8111c87c5c1ba99,0xc8fa8db6ccdd0437,
+    0x910ab1d4db9914a0,0x1d9c9892400a22a2,
+    0xb54d5e4a127f59c8,0x2503beb6d00cab4b,
+    0xe2a0b5dc971f303a,0x2e44ae64840fd61d,
+    0x8da471a9de737e24,0x5ceaecfed289e5d2,
+    0xb10d8e1456105dad,0x7425a83e872c5f47,
+    0xdd50f1996b947518,0xd12f124e28f77719,
+    0x8a5296ffe33cc92f,0x82bd6b70d99aaa6f,
+    0xace73cbfdc0bfb7b,0x636cc64d1001550b,
+    0xd8210befd30efa5a,0x3c47f7e05401aa4e,
+    0x8714a775e3e95c78,0x65acfaec34810a71,
+    0xa8d9d1535ce3b396,0x7f1839a741a14d0d,
+    0xd31045a8341ca07c,0x1ede48111209a050,
+    0x83ea2b892091e44d,0x934aed0aab460432,
+    0xa4e4b66b68b65d60,0xf81da84d5617853f,
+    0xce1de40642e3f4b9,0x36251260ab9d668e,
+    0x80d2ae83e9ce78f3,0xc1d72b7c6b426019,
+    0xa1075a24e4421730,0xb24cf65b8612f81f,
+    0xc94930ae1d529cfc,0xdee033f26797b627,
+    0xfb9b7cd9a4a7443c,0x169840ef017da3b1,
+    0x9d412e0806e88aa5,0x8e1f289560ee864e,
+    0xc491798a08a2ad4e,0xf1a6f2bab92a27e2,
+    0xf5b5d7ec8acb58a2,0xae10af696774b1db,
+    0x9991a6f3d6bf1765,0xacca6da1e0a8ef29,
+    0xbff610b0cc6edd3f,0x17fd090a58d32af3,
+    0xeff394dcff8a948e,0xddfc4b4cef07f5b0,
+    0x95f83d0a1fb69cd9,0x4abdaf101564f98e,
+    0xbb764c4ca7a4440f,0x9d6d1ad41abe37f1,
+    0xea53df5fd18d5513,0x84c86189216dc5ed,
+    0x92746b9be2f8552c,0x32fd3cf5b4e49bb4,
+    0xb7118682dbb66a77,0x3fbc8c33221dc2a1,
+    0xe4d5e82392a40515,0xfabaf3feaa5334a,
+    0x8f05b1163ba6832d,0x29cb4d87f2a7400e,
+    0xb2c71d5bca9023f8,0x743e20e9ef511012,
+    0xdf78e4b2bd342cf6,0x914da9246b255416,
+    0x8bab8eefb6409c1a,0x1ad089b6c2f7548e,
+    0xae9672aba3d0c320,0xa184ac2473b529b1,
+    0xda3c0f568cc4f3e8,0xc9e5d72d90a2741e,
+    0x8865899617fb1871,0x7e2fa67c7a658892,
+    0xaa7eebfb9df9de8d,0xddbb901b98feeab7,
+    0xd51ea6fa85785631,0x552a74227f3ea565,
+    0x8533285c936b35de,0xd53a88958f87275f,
+    0xa67ff273b8460356,0x8a892abaf368f137,
+    0xd01fef10a657842c,0x2d2b7569b0432d85,
+    0x8213f56a67f6b29b,0x9c3b29620e29fc73,
+    0xa298f2c501f45f42,0x8349f3ba91b47b8f,
+    0xcb3f2f7642717713,0x241c70a936219a73,
+    0xfe0efb53d30dd4d7,0xed238cd383aa0110,
+    0x9ec95d1463e8a506,0xf4363804324a40aa,
+    0xc67bb4597ce2ce48,0xb143c6053edcd0d5,
+    0xf81aa16fdc1b81da,0xdd94b7868e94050a,
+    0x9b10a4e5e9913128,0xca7cf2b4191c8326,
+    0xc1d4ce1f63f57d72,0xfd1c2f611f63a3f0,
+    0xf24a01a73cf2dccf,0xbc633b39673c8cec,
+    0x976e41088617ca01,0xd5be0503e085d813,
+    0xbd49d14aa79dbc82,0x4b2d8644d8a74e18,
+    0xec9c459d51852ba2,0xddf8e7d60ed1219e,
+    0x93e1ab8252f33b45,0xcabb90e5c942b503,
+    0xb8da1662e7b00a17,0x3d6a751f3b936243,
+    0xe7109bfba19c0c9d,0xcc512670a783ad4,
+    0x906a617d450187e2,0x27fb2b80668b24c5,
+    0xb484f9dc9641e9da,0xb1f9f660802dedf6,
+    0xe1a63853bbd26451,0x5e7873f8a0396973,
+    0x8d07e33455637eb2,0xdb0b487b6423e1e8,
+    0xb049dc016abc5e5f,0x91ce1a9a3d2cda62,
+    0xdc5c5301c56b75f7,0x7641a140cc7810fb,
+    0x89b9b3e11b6329ba,0xa9e904c87fcb0a9d,
+    0xac2820d9623bf429,0x546345fa9fbdcd44,
+    0xd732290fbacaf133,0xa97c177947ad4095,
+    0x867f59a9d4bed6c0,0x49ed8eabcccc485d,
+    0xa81f301449ee8c70,0x5c68f256bfff5a74,
+    0xd226fc195c6a2f8c,0x73832eec6fff3111,
+    0x83585d8fd9c25db7,0xc831fd53c5ff7eab,
+    0xa42e74f3d032f525,0xba3e7ca8b77f5e55,
+    0xcd3a1230c43fb26f,0x28ce1bd2e55f35eb,
+    0x80444b5e7aa7cf85,0x7980d163cf5b81b3,
+    0xa0555e361951c366,0xd7e105bcc332621f,
+    0xc86ab5c39fa63440,0x8dd9472bf3fefaa7,
+    0xfa856334878fc150,0xb14f98f6f0feb951,
+    0x9c935e00d4b9d8d2,0x6ed1bf9a569f33d3,
+    0xc3b8358109e84f07,0xa862f80ec4700c8,
+    0xf4a642e14c6262c8,0xcd27bb612758c0fa,
+    0x98e7e9cccfbd7dbd,0x8038d51cb897789c,
+    0xbf21e44003acdd2c,0xe0470a63e6bd56c3,
+    0xeeea5d5004981478,0x1858ccfce06cac74,
+    0x95527a5202df0ccb,0xf37801e0c43ebc8,
+    0xbaa718e68396cffd,0xd30560258f54e6ba,
+    0xe950df20247c83fd,0x47c6b82ef32a2069,
+    0x91d28b7416cdd27e,0x4cdc331d57fa5441,
+    0xb6472e511c81471d,0xe0133fe4adf8e952,
+    0xe3d8f9e563a198e5,0x58180fddd97723a6,
+    0x8e679c2f5e44ff8f,0x570f09eaa7ea7648,};
+using powers = powers_template<>;
+
+}
+
+#endif
+
+#ifndef FASTFLOAT_DECIMAL_TO_BINARY_H
+#define FASTFLOAT_DECIMAL_TO_BINARY_H
+
+#include <cfloat>
+#include <cinttypes>
+#include <cmath>
+#include <cstdint>
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+
+namespace lbug_fast_float {
+
+// This will compute or rather approximate w * 5**q and return a pair of 64-bit words approximating
+// the result, with the "high" part corresponding to the most significant bits and the
+// low part corresponding to the least significant bits.
+//
+template <int bit_precision>
+fastfloat_really_inline
+    value128 compute_product_approximation(int64_t q, uint64_t w) {
+    const int index = 2 * int(q - powers::smallest_power_of_five);
+    // For small values of q, e.g., q in [0,27], the answer is always exact because
+    // The line value128 firstproduct = full_multiplication(w, power_of_five_128[index]);
+    // gives the exact answer.
+    value128 firstproduct = full_multiplication(w, powers::power_of_five_128[index]);
+    static_assert((bit_precision >= 0) && (bit_precision <= 64), " precision should  be in (0,64]");
+    constexpr uint64_t precision_mask = (bit_precision < 64) ?
+                                            (uint64_t(0xFFFFFFFFFFFFFFFF) >> bit_precision)
+                                            : uint64_t(0xFFFFFFFFFFFFFFFF);
+    if((firstproduct.high & precision_mask) == precision_mask) { // could further guard with  (lower + w < lower)
+        // regarding the second product, we only need secondproduct.high, but our expectation is that the compiler will optimize this extra work away if needed.
+        value128 secondproduct = full_multiplication(w, powers::power_of_five_128[index + 1]);
+        firstproduct.low += secondproduct.high;
+        if(secondproduct.high > firstproduct.low) {
+            firstproduct.high++;
+        }
+    }
+    return firstproduct;
+}
+
+namespace detail {
+/**
+ * For q in (0,350), we have that
+ *  f = (((152170 + 65536) * q ) >> 16);
+ * is equal to
+ *   floor(p) + q
+ * where
+ *   p = log(5**q)/log(2) = q * log(5)/log(2)
+ *
+ * For negative values of q in (-400,0), we have that
+ *  f = (((152170 + 65536) * q ) >> 16);
+ * is equal to
+ *   -ceil(p) + q
+ * where
+ *   p = log(5**-q)/log(2) = -q * log(5)/log(2)
+ */
+fastfloat_really_inline int power(int q)  noexcept  {
+    return (((152170 + 65536) * q) >> 16) + 63;
+}
+} // namespace detail
+
+
+// w * 10 ** q
+// The returned value should be a valid ieee64 number that simply need to be packed.
+// However, in some very rare cases, the computation will fail. In such cases, we
+// return an adjusted_mantissa with a negative power of 2: the caller should recompute
+// in such cases.
+template <typename binary>
+fastfloat_really_inline
+    adjusted_mantissa compute_float(int64_t q, uint64_t w)  noexcept  {
+    adjusted_mantissa answer;
+    if ((w == 0) || (q < binary::smallest_power_of_ten())) {
+        answer.power2 = 0;
+        answer.mantissa = 0;
+        // result should be zero
+        return answer;
+    }
+    if (q > binary::largest_power_of_ten()) {
+        // we want to get infinity:
+        answer.power2 = binary::infinite_power();
+        answer.mantissa = 0;
+        return answer;
+    }
+    // At this point in time q is in [powers::smallest_power_of_five, powers::largest_power_of_five].
+
+    // We want the most significant bit of i to be 1. Shift if needed.
+    int lz = leading_zeroes(w);
+    w <<= lz;
+
+    // The required precision is binary::mantissa_explicit_bits() + 3 because
+    // 1. We need the implicit bit
+    // 2. We need an extra bit for rounding purposes
+    // 3. We might lose a bit due to the "upperbit" routine (result too small, requiring a shift)
+
+    value128 product = compute_product_approximation<binary::mantissa_explicit_bits() + 3>(q, w);
+    if(product.low == 0xFFFFFFFFFFFFFFFF) { //  could guard it further
+        // In some very rare cases, this could happen, in which case we might need a more accurate
+        // computation that what we can provide cheaply. This is very, very unlikely.
+        //
+        const bool inside_safe_exponent = (q >= -27) && (q <= 55); // always good because 5**q <2**128 when q>=0,
+        // and otherwise, for q<0, we have 5**-q<2**64 and the 128-bit reciprocal allows for exact computation.
+        if(!inside_safe_exponent) {
+            answer.power2 = -1; // This (a negative value) indicates an error condition.
+            return answer;
+        }
+    }
+    // The "compute_product_approximation" function can be slightly slower than a branchless approach:
+    // value128 product = compute_product(q, w);
+    // but in practice, we can win big with the compute_product_approximation if its additional branch
+    // is easily predicted. Which is best is data specific.
+    int upperbit = int(product.high >> 63);
+
+    answer.mantissa = product.high >> (upperbit + 64 - binary::mantissa_explicit_bits() - 3);
+
+    answer.power2 = int(detail::power(int(q)) + upperbit - lz - binary::minimum_exponent());
+    if (answer.power2 <= 0) { // we have a subnormal?
+        // Here have that answer.power2 <= 0 so -answer.power2 >= 0
+        if(-answer.power2 + 1 >= 64) { // if we have more than 64 bits below the minimum exponent, you have a zero for sure.
+            answer.power2 = 0;
+            answer.mantissa = 0;
+            // result should be zero
+            return answer;
+        }
+        // next line is safe because -answer.power2 + 1 < 64
+        answer.mantissa >>= -answer.power2 + 1;
+        // Thankfully, we can't have both "round-to-even" and subnormals because
+        // "round-to-even" only occurs for powers close to 0.
+        answer.mantissa += (answer.mantissa & 1); // round up
+        answer.mantissa >>= 1;
+        // There is a weird scenario where we don't have a subnormal but just.
+        // Suppose we start with 2.2250738585072013e-308, we end up
+        // with 0x3fffffffffffff x 2^-1023-53 which is technically subnormal
+        // whereas 0x40000000000000 x 2^-1023-53  is normal. Now, we need to round
+        // up 0x3fffffffffffff x 2^-1023-53  and once we do, we are no longer
+        // subnormal, but we can only know this after rounding.
+        // So we only declare a subnormal if we are smaller than the threshold.
+        answer.power2 = (answer.mantissa < (uint64_t(1) << binary::mantissa_explicit_bits())) ? 0 : 1;
+        return answer;
+    }
+
+    // usually, we round *up*, but if we fall right in between and and we have an
+    // even basis, we need to round down
+    // We are only concerned with the cases where 5**q fits in single 64-bit word.
+    if ((product.low <= 1) &&  (q >= binary::min_exponent_round_to_even()) && (q <= binary::max_exponent_round_to_even()) &&
+        ((answer.mantissa & 3) == 1) ) { // we may fall between two floats!
+        // To be in-between two floats we need that in doing
+        //   answer.mantissa = product.high >> (upperbit + 64 - binary::mantissa_explicit_bits() - 3);
+        // ... we dropped out only zeroes. But if this happened, then we can go back!!!
+        if((answer.mantissa  << (upperbit + 64 - binary::mantissa_explicit_bits() - 3)) ==  product.high) {
+            answer.mantissa &= ~uint64_t(1);          // flip it so that we do not round up
+        }
+    }
+
+    answer.mantissa += (answer.mantissa & 1); // round up
+    answer.mantissa >>= 1;
+    if (answer.mantissa >= (uint64_t(2) << binary::mantissa_explicit_bits())) {
+        answer.mantissa = (uint64_t(1) << binary::mantissa_explicit_bits());
+        answer.power2++; // undo previous addition
+    }
+
+    answer.mantissa &= ~(uint64_t(1) << binary::mantissa_explicit_bits());
+    if (answer.power2 >= binary::infinite_power()) { // infinity
+        answer.power2 = binary::infinite_power();
+        answer.mantissa = 0;
+    }
+    return answer;
+}
+
+
+} // namespace lbug_fast_float
+
+#endif
+
+
+#ifndef FASTFLOAT_ASCII_NUMBER_H
+#define FASTFLOAT_ASCII_NUMBER_H
+
+#include <cstdio>
+#include <cctype>
+#include <cstdint>
+#include <cstring>
+
+
+namespace lbug_fast_float {
+
+// Next function can be micro-optimized, but compilers are entirely
+// able to optimize it well.
+fastfloat_really_inline bool is_integer(char c)  noexcept  { return c >= '0' && c <= '9'; }
+
+fastfloat_really_inline uint64_t byteswap(uint64_t val) {
+    return (val & 0xFF00000000000000) >> 56
+           | (val & 0x00FF000000000000) >> 40
+           | (val & 0x0000FF0000000000) >> 24
+           | (val & 0x000000FF00000000) >> 8
+           | (val & 0x00000000FF000000) << 8
+           | (val & 0x0000000000FF0000) << 24
+           | (val & 0x000000000000FF00) << 40
+           | (val & 0x00000000000000FF) << 56;
+}
+
+fastfloat_really_inline uint64_t read_u64(const char *chars) {
+    uint64_t val;
+    ::memcpy(&val, chars, sizeof(uint64_t));
+#if FASTFLOAT_IS_BIG_ENDIAN == 1
+    // Need to read as-if the number was in little-endian order.
+    val = byteswap(val);
+#endif
+    return val;
+}
+
+fastfloat_really_inline void write_u64(uint8_t *chars, uint64_t val) {
+#if FASTFLOAT_IS_BIG_ENDIAN == 1
+    // Need to read as-if the number was in little-endian order.
+    val = byteswap(val);
+#endif
+    ::memcpy(chars, &val, sizeof(uint64_t));
+}
+
+// credit  @aqrit
+fastfloat_really_inline uint32_t  parse_eight_digits_unrolled(uint64_t val) {
+    const uint64_t mask = 0x000000FF000000FF;
+    const uint64_t mul1 = 0x000F424000000064; // 100 + (1000000ULL << 32)
+    const uint64_t mul2 = 0x0000271000000001; // 1 + (10000ULL << 32)
+    val -= 0x3030303030303030;
+    val = (val * 10) + (val >> 8); // val = (val * 2561) >> 8;
+    val = (((val & mask) * mul1) + (((val >> 16) & mask) * mul2)) >> 32;
+    return uint32_t(val);
+}
+
+fastfloat_really_inline uint32_t parse_eight_digits_unrolled(const char *chars)  noexcept  {
+    return parse_eight_digits_unrolled(read_u64(chars));
+}
+
+// credit @aqrit
+fastfloat_really_inline bool is_made_of_eight_digits_fast(uint64_t val)  noexcept  {
+    return !((((val + 0x4646464646464646) | (val - 0x3030303030303030)) &
+              0x8080808080808080));
+}
+
+fastfloat_really_inline bool is_made_of_eight_digits_fast(const char *chars)  noexcept  {
+    return is_made_of_eight_digits_fast(read_u64(chars));
+}
+
+struct parsed_number_string {
+    int64_t exponent;
+    uint64_t mantissa;
+    const char *lastmatch;
+    bool negative;
+    bool valid;
+    bool too_many_digits;
+};
+
+
+// Assuming that you use no more than 19 digits, this will
+// parse an ASCII string.
+fastfloat_really_inline
+    parsed_number_string parse_number_string(const char *p, const char *pend, const char decimal_separator, chars_format fmt) noexcept {
+    parsed_number_string answer;
+    answer.valid = false;
+    answer.too_many_digits = false;
+    answer.negative = (*p == '-');
+    if (*p == '-') { // C++17 20.19.3.(7.1) explicitly forbids '+' sign here
+        ++p;
+        if (p == pend) {
+            return answer;
+        }
+        if (!is_integer(*p) && (*p != decimal_separator)) { // a  sign must be followed by an integer or the dot
+            return answer;
+        }
+    }
+    const char *const start_digits = p;
+
+    uint64_t i = 0; // an unsigned int avoids signed overflows (which are bad)
+
+    while ((p != pend) && is_integer(*p)) {
+        // a multiplication by 10 is cheaper than an arbitrary integer
+        // multiplication
+        i = 10 * i +
+            uint64_t(*p - '0'); // might overflow, we will handle the overflow later
+        ++p;
+    }
+    const char *const end_of_integer_part = p;
+    int64_t digit_count = int64_t(end_of_integer_part - start_digits);
+    int64_t exponent = 0;
+    if ((p != pend) && (*p == decimal_separator)) {
+        ++p;
+        // Fast approach only tested under little endian systems
+        if ((p + 8 <= pend) && is_made_of_eight_digits_fast(p)) {
+            i = i * 100000000 + parse_eight_digits_unrolled(p); // in rare cases, this will overflow, but that's ok
+            p += 8;
+            if ((p + 8 <= pend) && is_made_of_eight_digits_fast(p)) {
+                i = i * 100000000 + parse_eight_digits_unrolled(p); // in rare cases, this will overflow, but that's ok
+                p += 8;
+            }
+        }
+        while ((p != pend) && is_integer(*p)) {
+            uint8_t digit = uint8_t(*p - '0');
+            ++p;
+            i = i * 10 + digit; // in rare cases, this will overflow, but that's ok
+        }
+        exponent = end_of_integer_part + 1 - p;
+        digit_count -= exponent;
+    }
+    // we must have encountered at least one integer!
+    if (digit_count == 0) {
+        return answer;
+    }
+    int64_t exp_number = 0;            // explicit exponential part
+    if ((fmt & chars_format::scientific) && (p != pend) && (('e' == *p) || ('E' == *p))) {
+        const char * location_of_e = p;
+        ++p;
+        bool neg_exp = false;
+        if ((p != pend) && ('-' == *p)) {
+            neg_exp = true;
+            ++p;
+        } else if ((p != pend) && ('+' == *p)) { // '+' on exponent is allowed by C++17 20.19.3.(7.1)
+            ++p;
+        }
+        if ((p == pend) || !is_integer(*p)) {
+            if(!(fmt & chars_format::fixed)) {
+                // We are in error.
+                return answer;
+            }
+            // Otherwise, we will be ignoring the 'e'.
+            p = location_of_e;
+        } else {
+            while ((p != pend) && is_integer(*p)) {
+                uint8_t digit = uint8_t(*p - '0');
+                if (exp_number < 0x10000) {
+                    exp_number = 10 * exp_number + digit;
+                }
+                ++p;
+            }
+            if(neg_exp) { exp_number = - exp_number; }
+            exponent += exp_number;
+        }
+    } else {
+        // If it scientific and not fixed, we have to bail out.
+        if((fmt & chars_format::scientific) && !(fmt & chars_format::fixed)) { return answer; }
+    }
+    answer.lastmatch = p;
+    answer.valid = true;
+
+    // If we frequently had to deal with long strings of digits,
+    // we could extend our code by using a 128-bit integer instead
+    // of a 64-bit integer. However, this is uncommon.
+    //
+    // We can deal with up to 19 digits.
+    if (digit_count > 19) { // this is uncommon
+        // It is possible that the integer had an overflow.
+        // We have to handle the case where we have 0.0000somenumber.
+        // We need to be mindful of the case where we only have zeroes...
+        // E.g., 0.000000000...000.
+        const char *start = start_digits;
+        while ((start != pend) && (*start == '0' || *start == decimal_separator)) {
+            if(*start == '0') { digit_count --; }
+            start++;
+        }
+        if (digit_count > 19) {
+            answer.too_many_digits = true;
+            // Let us start again, this time, avoiding overflows.
+            i = 0;
+            p = start_digits;
+            const uint64_t minimal_nineteen_digit_integer{1000000000000000000};
+            while((i < minimal_nineteen_digit_integer) && (p != pend) && is_integer(*p)) {
+                i = i * 10 + uint64_t(*p - '0');
+                ++p;
+            }
+            if (i >= minimal_nineteen_digit_integer) { // We have a big integers
+                exponent = end_of_integer_part - p + exp_number;
+            } else { // We have a value with a fractional component.
+                p++; // skip the decimal_separator
+                const char *first_after_period = p;
+                while((i < minimal_nineteen_digit_integer) && (p != pend) && is_integer(*p)) {
+                    i = i * 10 + uint64_t(*p - '0');
+                    ++p;
+                }
+                exponent = first_after_period - p + exp_number;
+            }
+            // We have now corrected both exponent and i, to a truncated value
+        }
+    }
+    answer.exponent = exponent;
+    answer.mantissa = i;
+    return answer;
+}
+
+
+// This should always succeed since it follows a call to parse_number_string
+// This function could be optimized. In particular, we could stop after 19 digits
+// and try to bail out. Furthermore, we should be able to recover the computed
+// exponent from the pass in parse_number_string.
+fastfloat_really_inline decimal parse_decimal(const char *p, const char *pend, const char decimal_separator) noexcept {
+    decimal answer;
+    answer.num_digits = 0;
+    answer.decimal_point = 0;
+    answer.truncated = false;
+    answer.negative = (*p == '-');
+    if (*p == '-') { // C++17 20.19.3.(7.1) explicitly forbids '+' sign here
+        ++p;
+    }
+    // skip leading zeroes
+    while ((p != pend) && (*p == '0')) {
+        ++p;
+    }
+    while ((p != pend) && is_integer(*p)) {
+        if (answer.num_digits < max_digits) {
+            answer.digits[answer.num_digits] = uint8_t(*p - '0');
+        }
+        answer.num_digits++;
+        ++p;
+    }
+    if ((p != pend) && (*p == decimal_separator)) {
+        ++p;
+        const char *first_after_period = p;
+        // if we have not yet encountered a zero, we have to skip it as well
+        if(answer.num_digits == 0) {
+            // skip zeros
+            while ((p != pend) && (*p == '0')) {
+                ++p;
+            }
+        }
+        // We expect that this loop will often take the bulk of the running time
+        // because when a value has lots of digits, these digits often
+        while ((p + 8 <= pend) && (answer.num_digits + 8 < max_digits)) {
+            uint64_t val = read_u64(p);
+            if(! is_made_of_eight_digits_fast(val)) { break; }
+            // We have eight digits, process them in one go!
+            val -= 0x3030303030303030;
+            write_u64(answer.digits + answer.num_digits, val);
+            answer.num_digits += 8;
+            p += 8;
+        }
+        while ((p != pend) && is_integer(*p)) {
+            if (answer.num_digits < max_digits) {
+                answer.digits[answer.num_digits] = uint8_t(*p - '0');
+            }
+            answer.num_digits++;
+            ++p;
+        }
+        answer.decimal_point = int32_t(first_after_period - p);
+    }
+    // We want num_digits to be the number of significant digits, excluding
+    // leading *and* trailing zeros! Otherwise the truncated flag later is
+    // going to be misleading.
+    if(answer.num_digits > 0) {
+        // We potentially need the answer.num_digits > 0 guard because we
+        // prune leading zeros. So with answer.num_digits > 0, we know that
+        // we have at least one non-zero digit.
+        const char *preverse = p - 1;
+        int32_t trailing_zeros = 0;
+        while ((*preverse == '0') || (*preverse == decimal_separator)) {
+            if(*preverse == '0') { trailing_zeros++; };
+            --preverse;
+        }
+        answer.decimal_point += int32_t(answer.num_digits);
+        answer.num_digits -= uint32_t(trailing_zeros);
+    }
+    if(answer.num_digits > max_digits) {
+        answer.truncated = true;
+        answer.num_digits = max_digits;
+    }
+    if ((p != pend) && (('e' == *p) || ('E' == *p))) {
+        ++p;
+        bool neg_exp = false;
+        if ((p != pend) && ('-' == *p)) {
+            neg_exp = true;
+            ++p;
+        } else if ((p != pend) && ('+' == *p)) { // '+' on exponent is allowed by C++17 20.19.3.(7.1)
+            ++p;
+        }
+        int32_t exp_number = 0; // exponential part
+        while ((p != pend) && is_integer(*p)) {
+            uint8_t digit = uint8_t(*p - '0');
+            if (exp_number < 0x10000) {
+                exp_number = 10 * exp_number + digit;
+            }
+            ++p;
+        }
+        answer.decimal_point += (neg_exp ? -exp_number : exp_number);
+    }
+    // In very rare cases, we may have fewer than 19 digits, we want to be able to reliably
+    // assume that all digits up to max_digit_without_overflow have been initialized.
+    for(uint32_t i = answer.num_digits; i < max_digit_without_overflow; i++) { answer.digits[i] = 0; }
+
+    return answer;
+}
+} // namespace lbug_fast_float
+
+#endif
+
+
+#ifndef FASTFLOAT_GENERIC_DECIMAL_TO_BINARY_H
+#define FASTFLOAT_GENERIC_DECIMAL_TO_BINARY_H
+
+/**
+ * This code is meant to handle the case where we have more than 19 digits.
+ *
+ * It is based on work by Nigel Tao (at https://github.com/google/wuffs/)
+ * who credits Ken Thompson for the design (via a reference to the Go source
+ * code).
+ *
+ * Rob Pike suggested that this algorithm be called "Simple Decimal Conversion".
+ *
+ * It is probably not very fast but it is a fallback that should almost never
+ * be used in real life. Though it is not fast, it is "easily" understood and debugged.
+ **/
+#include <cstdint>
+
+namespace lbug_fast_float {
+
+namespace detail {
+
+// remove all final zeroes
+inline void trim(decimal &h) {
+    while ((h.num_digits > 0) && (h.digits[h.num_digits - 1] == 0)) {
+        h.num_digits--;
+    }
+}
+
+
+
+inline uint32_t number_of_digits_decimal_left_shift(const decimal &h, uint32_t shift) {
+    shift &= 63;
+    const static uint16_t number_of_digits_decimal_left_shift_table[65] = {
+        0x0000, 0x0800, 0x0801, 0x0803, 0x1006, 0x1009, 0x100D, 0x1812, 0x1817,
+        0x181D, 0x2024, 0x202B, 0x2033, 0x203C, 0x2846, 0x2850, 0x285B, 0x3067,
+        0x3073, 0x3080, 0x388E, 0x389C, 0x38AB, 0x38BB, 0x40CC, 0x40DD, 0x40EF,
+        0x4902, 0x4915, 0x4929, 0x513E, 0x5153, 0x5169, 0x5180, 0x5998, 0x59B0,
+        0x59C9, 0x61E3, 0x61FD, 0x6218, 0x6A34, 0x6A50, 0x6A6D, 0x6A8B, 0x72AA,
+        0x72C9, 0x72E9, 0x7B0A, 0x7B2B, 0x7B4D, 0x8370, 0x8393, 0x83B7, 0x83DC,
+        0x8C02, 0x8C28, 0x8C4F, 0x9477, 0x949F, 0x94C8, 0x9CF2, 0x051C, 0x051C,
+        0x051C, 0x051C,
+    };
+    uint32_t x_a = number_of_digits_decimal_left_shift_table[shift];
+    uint32_t x_b = number_of_digits_decimal_left_shift_table[shift + 1];
+    uint32_t num_new_digits = x_a >> 11;
+    uint32_t pow5_a = 0x7FF & x_a;
+    uint32_t pow5_b = 0x7FF & x_b;
+    const static uint8_t
+        number_of_digits_decimal_left_shift_table_powers_of_5[0x051C] = {
+            5, 2, 5, 1, 2, 5, 6, 2, 5, 3, 1, 2, 5, 1, 5, 6, 2, 5, 7, 8, 1, 2, 5, 3,
+            9, 0, 6, 2, 5, 1, 9, 5, 3, 1, 2, 5, 9, 7, 6, 5, 6, 2, 5, 4, 8, 8, 2, 8,
+            1, 2, 5, 2, 4, 4, 1, 4, 0, 6, 2, 5, 1, 2, 2, 0, 7, 0, 3, 1, 2, 5, 6, 1,
+            0, 3, 5, 1, 5, 6, 2, 5, 3, 0, 5, 1, 7, 5, 7, 8, 1, 2, 5, 1, 5, 2, 5, 8,
+            7, 8, 9, 0, 6, 2, 5, 7, 6, 2, 9, 3, 9, 4, 5, 3, 1, 2, 5, 3, 8, 1, 4, 6,
+            9, 7, 2, 6, 5, 6, 2, 5, 1, 9, 0, 7, 3, 4, 8, 6, 3, 2, 8, 1, 2, 5, 9, 5,
+            3, 6, 7, 4, 3, 1, 6, 4, 0, 6, 2, 5, 4, 7, 6, 8, 3, 7, 1, 5, 8, 2, 0, 3,
+            1, 2, 5, 2, 3, 8, 4, 1, 8, 5, 7, 9, 1, 0, 1, 5, 6, 2, 5, 1, 1, 9, 2, 0,
+            9, 2, 8, 9, 5, 5, 0, 7, 8, 1, 2, 5, 5, 9, 6, 0, 4, 6, 4, 4, 7, 7, 5, 3,
+            9, 0, 6, 2, 5, 2, 9, 8, 0, 2, 3, 2, 2, 3, 8, 7, 6, 9, 5, 3, 1, 2, 5, 1,
+            4, 9, 0, 1, 1, 6, 1, 1, 9, 3, 8, 4, 7, 6, 5, 6, 2, 5, 7, 4, 5, 0, 5, 8,
+            0, 5, 9, 6, 9, 2, 3, 8, 2, 8, 1, 2, 5, 3, 7, 2, 5, 2, 9, 0, 2, 9, 8, 4,
+            6, 1, 9, 1, 4, 0, 6, 2, 5, 1, 8, 6, 2, 6, 4, 5, 1, 4, 9, 2, 3, 0, 9, 5,
+            7, 0, 3, 1, 2, 5, 9, 3, 1, 3, 2, 2, 5, 7, 4, 6, 1, 5, 4, 7, 8, 5, 1, 5,
+            6, 2, 5, 4, 6, 5, 6, 6, 1, 2, 8, 7, 3, 0, 7, 7, 3, 9, 2, 5, 7, 8, 1, 2,
+            5, 2, 3, 2, 8, 3, 0, 6, 4, 3, 6, 5, 3, 8, 6, 9, 6, 2, 8, 9, 0, 6, 2, 5,
+            1, 1, 6, 4, 1, 5, 3, 2, 1, 8, 2, 6, 9, 3, 4, 8, 1, 4, 4, 5, 3, 1, 2, 5,
+            5, 8, 2, 0, 7, 6, 6, 0, 9, 1, 3, 4, 6, 7, 4, 0, 7, 2, 2, 6, 5, 6, 2, 5,
+            2, 9, 1, 0, 3, 8, 3, 0, 4, 5, 6, 7, 3, 3, 7, 0, 3, 6, 1, 3, 2, 8, 1, 2,
+            5, 1, 4, 5, 5, 1, 9, 1, 5, 2, 2, 8, 3, 6, 6, 8, 5, 1, 8, 0, 6, 6, 4, 0,
+            6, 2, 5, 7, 2, 7, 5, 9, 5, 7, 6, 1, 4, 1, 8, 3, 4, 2, 5, 9, 0, 3, 3, 2,
+            0, 3, 1, 2, 5, 3, 6, 3, 7, 9, 7, 8, 8, 0, 7, 0, 9, 1, 7, 1, 2, 9, 5, 1,
+            6, 6, 0, 1, 5, 6, 2, 5, 1, 8, 1, 8, 9, 8, 9, 4, 0, 3, 5, 4, 5, 8, 5, 6,
+            4, 7, 5, 8, 3, 0, 0, 7, 8, 1, 2, 5, 9, 0, 9, 4, 9, 4, 7, 0, 1, 7, 7, 2,
+            9, 2, 8, 2, 3, 7, 9, 1, 5, 0, 3, 9, 0, 6, 2, 5, 4, 5, 4, 7, 4, 7, 3, 5,
+            0, 8, 8, 6, 4, 6, 4, 1, 1, 8, 9, 5, 7, 5, 1, 9, 5, 3, 1, 2, 5, 2, 2, 7,
+            3, 7, 3, 6, 7, 5, 4, 4, 3, 2, 3, 2, 0, 5, 9, 4, 7, 8, 7, 5, 9, 7, 6, 5,
+            6, 2, 5, 1, 1, 3, 6, 8, 6, 8, 3, 7, 7, 2, 1, 6, 1, 6, 0, 2, 9, 7, 3, 9,
+            3, 7, 9, 8, 8, 2, 8, 1, 2, 5, 5, 6, 8, 4, 3, 4, 1, 8, 8, 6, 0, 8, 0, 8,
+            0, 1, 4, 8, 6, 9, 6, 8, 9, 9, 4, 1, 4, 0, 6, 2, 5, 2, 8, 4, 2, 1, 7, 0,
+            9, 4, 3, 0, 4, 0, 4, 0, 0, 7, 4, 3, 4, 8, 4, 4, 9, 7, 0, 7, 0, 3, 1, 2,
+            5, 1, 4, 2, 1, 0, 8, 5, 4, 7, 1, 5, 2, 0, 2, 0, 0, 3, 7, 1, 7, 4, 2, 2,
+            4, 8, 5, 3, 5, 1, 5, 6, 2, 5, 7, 1, 0, 5, 4, 2, 7, 3, 5, 7, 6, 0, 1, 0,
+            0, 1, 8, 5, 8, 7, 1, 1, 2, 4, 2, 6, 7, 5, 7, 8, 1, 2, 5, 3, 5, 5, 2, 7,
+            1, 3, 6, 7, 8, 8, 0, 0, 5, 0, 0, 9, 2, 9, 3, 5, 5, 6, 2, 1, 3, 3, 7, 8,
+            9, 0, 6, 2, 5, 1, 7, 7, 6, 3, 5, 6, 8, 3, 9, 4, 0, 0, 2, 5, 0, 4, 6, 4,
+            6, 7, 7, 8, 1, 0, 6, 6, 8, 9, 4, 5, 3, 1, 2, 5, 8, 8, 8, 1, 7, 8, 4, 1,
+            9, 7, 0, 0, 1, 2, 5, 2, 3, 2, 3, 3, 8, 9, 0, 5, 3, 3, 4, 4, 7, 2, 6, 5,
+            6, 2, 5, 4, 4, 4, 0, 8, 9, 2, 0, 9, 8, 5, 0, 0, 6, 2, 6, 1, 6, 1, 6, 9,
+            4, 5, 2, 6, 6, 7, 2, 3, 6, 3, 2, 8, 1, 2, 5, 2, 2, 2, 0, 4, 4, 6, 0, 4,
+            9, 2, 5, 0, 3, 1, 3, 0, 8, 0, 8, 4, 7, 2, 6, 3, 3, 3, 6, 1, 8, 1, 6, 4,
+            0, 6, 2, 5, 1, 1, 1, 0, 2, 2, 3, 0, 2, 4, 6, 2, 5, 1, 5, 6, 5, 4, 0, 4,
+            2, 3, 6, 3, 1, 6, 6, 8, 0, 9, 0, 8, 2, 0, 3, 1, 2, 5, 5, 5, 5, 1, 1, 1,
+            5, 1, 2, 3, 1, 2, 5, 7, 8, 2, 7, 0, 2, 1, 1, 8, 1, 5, 8, 3, 4, 0, 4, 5,
+            4, 1, 0, 1, 5, 6, 2, 5, 2, 7, 7, 5, 5, 5, 7, 5, 6, 1, 5, 6, 2, 8, 9, 1,
+            3, 5, 1, 0, 5, 9, 0, 7, 9, 1, 7, 0, 2, 2, 7, 0, 5, 0, 7, 8, 1, 2, 5, 1,
+            3, 8, 7, 7, 7, 8, 7, 8, 0, 7, 8, 1, 4, 4, 5, 6, 7, 5, 5, 2, 9, 5, 3, 9,
+            5, 8, 5, 1, 1, 3, 5, 2, 5, 3, 9, 0, 6, 2, 5, 6, 9, 3, 8, 8, 9, 3, 9, 0,
+            3, 9, 0, 7, 2, 2, 8, 3, 7, 7, 6, 4, 7, 6, 9, 7, 9, 2, 5, 5, 6, 7, 6, 2,
+            6, 9, 5, 3, 1, 2, 5, 3, 4, 6, 9, 4, 4, 6, 9, 5, 1, 9, 5, 3, 6, 1, 4, 1,
+            8, 8, 8, 2, 3, 8, 4, 8, 9, 6, 2, 7, 8, 3, 8, 1, 3, 4, 7, 6, 5, 6, 2, 5,
+            1, 7, 3, 4, 7, 2, 3, 4, 7, 5, 9, 7, 6, 8, 0, 7, 0, 9, 4, 4, 1, 1, 9, 2,
+            4, 4, 8, 1, 3, 9, 1, 9, 0, 6, 7, 3, 8, 2, 8, 1, 2, 5, 8, 6, 7, 3, 6, 1,
+            7, 3, 7, 9, 8, 8, 4, 0, 3, 5, 4, 7, 2, 0, 5, 9, 6, 2, 2, 4, 0, 6, 9, 5,
+            9, 5, 3, 3, 6, 9, 1, 4, 0, 6, 2, 5,
+        };
+    const uint8_t *pow5 =
+        &number_of_digits_decimal_left_shift_table_powers_of_5[pow5_a];
+    uint32_t i = 0;
+    uint32_t n = pow5_b - pow5_a;
+    for (; i < n; i++) {
+        if (i >= h.num_digits) {
+            return num_new_digits - 1;
+        } else if (h.digits[i] == pow5[i]) {
+            continue;
+        } else if (h.digits[i] < pow5[i]) {
+            return num_new_digits - 1;
+        } else {
+            return num_new_digits;
+        }
+    }
+    return num_new_digits;
+}
+
+inline uint64_t round(decimal &h) {
+    if ((h.num_digits == 0) || (h.decimal_point < 0)) {
+        return 0;
+    } else if (h.decimal_point > 18) {
+        return UINT64_MAX;
+    }
+    // at this point, we know that h.decimal_point >= 0
+    uint32_t dp = uint32_t(h.decimal_point);
+    uint64_t n = 0;
+    for (uint32_t i = 0; i < dp; i++) {
+        n = (10 * n) + ((i < h.num_digits) ? h.digits[i] : 0);
+    }
+    bool round_up = false;
+    if (dp < h.num_digits) {
+        round_up = h.digits[dp] >= 5; // normally, we round up
+        // but we may need to round to even!
+        if ((h.digits[dp] == 5) && (dp + 1 == h.num_digits)) {
+            round_up = h.truncated || ((dp > 0) && (1 & h.digits[dp - 1]));
+        }
+    }
+    if (round_up) {
+        n++;
+    }
+    return n;
+}
+
+// computes h * 2^-shift
+inline void decimal_left_shift(decimal &h, uint32_t shift) {
+    if (h.num_digits == 0) {
+        return;
+    }
+    uint32_t num_new_digits = number_of_digits_decimal_left_shift(h, shift);
+    int32_t read_index = int32_t(h.num_digits - 1);
+    uint32_t write_index = h.num_digits - 1 + num_new_digits;
+    uint64_t n = 0;
+
+    while (read_index >= 0) {
+        n += uint64_t(h.digits[read_index]) << shift;
+        uint64_t quotient = n / 10;
+        uint64_t remainder = n - (10 * quotient);
+        if (write_index < max_digits) {
+            h.digits[write_index] = uint8_t(remainder);
+        } else if (remainder > 0) {
+            h.truncated = true;
+        }
+        n = quotient;
+        write_index--;
+        read_index--;
+    }
+    while (n > 0) {
+        uint64_t quotient = n / 10;
+        uint64_t remainder = n - (10 * quotient);
+        if (write_index < max_digits) {
+            h.digits[write_index] = uint8_t(remainder);
+        } else if (remainder > 0) {
+            h.truncated = true;
+        }
+        n = quotient;
+        write_index--;
+    }
+    h.num_digits += num_new_digits;
+    if (h.num_digits > max_digits) {
+        h.num_digits = max_digits;
+    }
+    h.decimal_point += int32_t(num_new_digits);
+    trim(h);
+}
+
+// computes h * 2^shift
+inline void decimal_right_shift(decimal &h, uint32_t shift) {
+    uint32_t read_index = 0;
+    uint32_t write_index = 0;
+
+    uint64_t n = 0;
+
+    while ((n >> shift) == 0) {
+        if (read_index < h.num_digits) {
+            n = (10 * n) + h.digits[read_index++];
+        } else if (n == 0) {
+            return;
+        } else {
+            while ((n >> shift) == 0) {
+                n = 10 * n;
+                read_index++;
+            }
+            break;
+        }
+    }
+    h.decimal_point -= int32_t(read_index - 1);
+    if (h.decimal_point < -decimal_point_range) { // it is zero
+        h.num_digits = 0;
+        h.decimal_point = 0;
+        h.negative = false;
+        h.truncated = false;
+        return;
+    }
+    uint64_t mask = (uint64_t(1) << shift) - 1;
+    while (read_index < h.num_digits) {
+        uint8_t new_digit = uint8_t(n >> shift);
+        n = (10 * (n & mask)) + h.digits[read_index++];
+        h.digits[write_index++] = new_digit;
+    }
+    while (n > 0) {
+        uint8_t new_digit = uint8_t(n >> shift);
+        n = 10 * (n & mask);
+        if (write_index < max_digits) {
+            h.digits[write_index++] = new_digit;
+        } else if (new_digit > 0) {
+            h.truncated = true;
+        }
+    }
+    h.num_digits = write_index;
+    trim(h);
+}
+
+} // namespace detail
+
+template <typename binary>
+adjusted_mantissa compute_float(decimal &d) {
+    adjusted_mantissa answer;
+    if (d.num_digits == 0) {
+        // should be zero
+        answer.power2 = 0;
+        answer.mantissa = 0;
+        return answer;
+    }
+    // At this point, going further, we can assume that d.num_digits > 0.
+    //
+    // We want to guard against excessive decimal point values because
+    // they can result in long running times. Indeed, we do
+    // shifts by at most 60 bits. We have that log(10**400)/log(2**60) ~= 22
+    // which is fine, but log(10**299995)/log(2**60) ~= 16609 which is not
+    // fine (runs for a long time).
+    //
+    if(d.decimal_point < -324) {
+        // We have something smaller than 1e-324 which is always zero
+        // in binary64 and binary32.
+        // It should be zero.
+        answer.power2 = 0;
+        answer.mantissa = 0;
+        return answer;
+    } else if(d.decimal_point >= 310) {
+        // We have something at least as large as 0.1e310 which is
+        // always infinite.
+        answer.power2 = binary::infinite_power();
+        answer.mantissa = 0;
+        return answer;
+    }
+    static const uint32_t max_shift = 60;
+    static const uint32_t num_powers = 19;
+    static const uint8_t decimal_powers[19] = {
+        0,  3,  6,  9,  13, 16, 19, 23, 26, 29, //
+        33, 36, 39, 43, 46, 49, 53, 56, 59,     //
+    };
+    int32_t exp2 = 0;
+    while (d.decimal_point > 0) {
+        uint32_t n = uint32_t(d.decimal_point);
+        uint32_t shift = (n < num_powers) ? decimal_powers[n] : max_shift;
+        detail::decimal_right_shift(d, shift);
+        if (d.decimal_point < -decimal_point_range) {
+            // should be zero
+            answer.power2 = 0;
+            answer.mantissa = 0;
+            return answer;
+        }
+        exp2 += int32_t(shift);
+    }
+    // We shift left toward [1/2 ... 1].
+    while (d.decimal_point <= 0) {
+        uint32_t shift;
+        if (d.decimal_point == 0) {
+            if (d.digits[0] >= 5) {
+                break;
+            }
+            shift = (d.digits[0] < 2) ? 2 : 1;
+        } else {
+            uint32_t n = uint32_t(-d.decimal_point);
+            shift = (n < num_powers) ? decimal_powers[n] : max_shift;
+        }
+        detail::decimal_left_shift(d, shift);
+        if (d.decimal_point > decimal_point_range) {
+            // we want to get infinity:
+            answer.power2 = binary::infinite_power();
+            answer.mantissa = 0;
+            return answer;
+        }
+        exp2 -= int32_t(shift);
+    }
+    // We are now in the range [1/2 ... 1] but the binary format uses [1 ... 2].
+    exp2--;
+    constexpr int32_t minimum_exponent = binary::minimum_exponent();
+    while ((minimum_exponent + 1) > exp2) {
+        uint32_t n = uint32_t((minimum_exponent + 1) - exp2);
+        if (n > max_shift) {
+            n = max_shift;
+        }
+        detail::decimal_right_shift(d, n);
+        exp2 += int32_t(n);
+    }
+    if ((exp2 - minimum_exponent) >= binary::infinite_power()) {
+        answer.power2 = binary::infinite_power();
+        answer.mantissa = 0;
+        return answer;
+    }
+
+    const int mantissa_size_in_bits = binary::mantissa_explicit_bits() + 1;
+    detail::decimal_left_shift(d, mantissa_size_in_bits);
+
+    uint64_t mantissa = detail::round(d);
+    // It is possible that we have an overflow, in which case we need
+    // to shift back.
+    if(mantissa >= (uint64_t(1) << mantissa_size_in_bits)) {
+        detail::decimal_right_shift(d, 1);
+        exp2 += 1;
+        mantissa = detail::round(d);
+        if ((exp2 - minimum_exponent) >= binary::infinite_power()) {
+            answer.power2 = binary::infinite_power();
+            answer.mantissa = 0;
+            return answer;
+        }
+    }
+    answer.power2 = exp2  - binary::minimum_exponent();
+    if(mantissa < (uint64_t(1) << binary::mantissa_explicit_bits())) { answer.power2--; }
+    answer.mantissa = mantissa & ((uint64_t(1) << binary::mantissa_explicit_bits()) - 1);
+    return answer;
+}
+
+template <typename binary>
+adjusted_mantissa parse_long_mantissa(const char *first, const char* last) {
+    decimal d = parse_decimal(first, last);
+    return compute_float<binary>(d);
+}
+
+} // namespace lbug_fast_float
+#endif
+
+
+#ifndef FASTFLOAT_PARSE_NUMBER_H
+#define FASTFLOAT_PARSE_NUMBER_H
+
+#include <cassert>
+#include <cmath>
+#include <cstring>
+#include <limits>
+#include <system_error>
+
+namespace lbug_fast_float {
+
+
+namespace detail {
+/**
+ * Special case +inf, -inf, nan, infinity, -infinity.
+ * The case comparisons could be made much faster given that we know that the
+ * strings a null-free and fixed.
+ **/
+template <typename T>
+from_chars_result parse_infnan(const char *first, const char *last, T &value)  noexcept  {
+    from_chars_result answer;
+    answer.ptr = first;
+    answer.ec = std::errc(); // be optimistic
+    bool minusSign = false;
+    if (*first == '-') { // assume first < last, so dereference without checks; C++17 20.19.3.(7.1) explicitly forbids '+' here
+        minusSign = true;
+        ++first;
+    }
+    if (last - first >= 3) {
+        if (fastfloat_strncasecmp(first, "nan", 3)) {
+            answer.ptr = (first += 3);
+            value = minusSign ? -std::numeric_limits<T>::quiet_NaN() : std::numeric_limits<T>::quiet_NaN();
+            // Check for possible nan(n-char-seq-opt), C++17 20.19.3.7, C11 7.20.1.3.3. At least MSVC produces nan(ind) and nan(snan).
+            if(first != last && *first == '(') {
+                for(const char* ptr = first + 1; ptr != last; ++ptr) {
+                    if (*ptr == ')') {
+                        answer.ptr = ptr + 1; // valid nan(n-char-seq-opt)
+                        break;
+                    }
+                    else if(!(('a' <= *ptr && *ptr <= 'z') || ('A' <= *ptr && *ptr <= 'Z') || ('0' <= *ptr && *ptr <= '9') || *ptr == '_'))
+                        break; // forbidden char, not nan(n-char-seq-opt)
+                }
+            }
+            return answer;
+        }
+        if (fastfloat_strncasecmp(first, "inf", 3)) {
+            if ((last - first >= 8) && fastfloat_strncasecmp(first + 3, "inity", 5)) {
+                answer.ptr = first + 8;
+            } else {
+                answer.ptr = first + 3;
+            }
+            value = minusSign ? -std::numeric_limits<T>::infinity() : std::numeric_limits<T>::infinity();
+            return answer;
+        }
+    }
+    answer.ec = std::errc::invalid_argument;
+    return answer;
+}
+
+template<typename T>
+fastfloat_really_inline void to_float(bool negative, adjusted_mantissa am, T &value) {
+    uint64_t word = am.mantissa;
+    // NOLINTNEXTLINE
+    word |= uint64_t(am.power2) << binary_format<T>::mantissa_explicit_bits();
+    word = negative
+               ? word | (uint64_t(1) << binary_format<T>::sign_index()) : word;
+#if FASTFLOAT_IS_BIG_ENDIAN == 1
+    if (std::is_same<T, float>::value) {
+        ::memcpy(&value, (char *)&word + 4, sizeof(T)); // extract value at offset 4-7 if float on big-endian
+    } else {
+        ::memcpy(&value, &word, sizeof(T));
+    }
+#else
+    // For little-endian systems:
+    ::memcpy(&value, &word, sizeof(T));
+#endif
+}
+
+} // namespace detail
+
+
+
+template<typename T>
+from_chars_result from_chars(const char *first, const char *last,
+    T &value, const char decimal_separator, chars_format fmt
+    /*= chars_format::general*/)  noexcept  {
+    static_assert (std::is_same<T, double>::value || std::is_same<T, float>::value, "only float and double are supported");
+
+
+    from_chars_result answer;
+    if (first == last) {
+        answer.ec = std::errc::invalid_argument;
+        answer.ptr = first;
+        return answer;
+    }
+    parsed_number_string pns = parse_number_string(first, last, decimal_separator, fmt);
+    if (!pns.valid) {
+        return detail::parse_infnan(first, last, value);
+    }
+    answer.ec = std::errc(); // be optimistic
+    answer.ptr = pns.lastmatch;
+    // Next is Clinger's fast path.
+    if (binary_format<T>::min_exponent_fast_path() <= pns.exponent && pns.exponent <= binary_format<T>::max_exponent_fast_path() && pns.mantissa <=binary_format<T>::max_mantissa_fast_path() && !pns.too_many_digits) {
+        value = T(pns.mantissa);
+        if (pns.exponent < 0) { value = value / binary_format<T>::exact_power_of_ten(-pns.exponent); }
+        else { value = value * binary_format<T>::exact_power_of_ten(pns.exponent); }
+        if (pns.negative) { value = -value; }
+        return answer;
+    }
+    adjusted_mantissa am = compute_float<binary_format<T>>(pns.exponent, pns.mantissa);
+    if(pns.too_many_digits) {
+        if(am != compute_float<binary_format<T>>(pns.exponent, pns.mantissa + 1)) {
+            am.power2 = -1; // value is invalid.
+        }
+    }
+    // If we called compute_float<binary_format<T>>(pns.exponent, pns.mantissa) and we have an invalid power (am.power2 < 0),
+    // then we need to go the long way around again. This is very uncommon.
+    if(am.power2 < 0) { am = parse_long_mantissa<binary_format<T>>(first,last); }
+    detail::to_float(pns.negative, am, value);
+    return answer;
+}
+
+} // namespace lbug_fast_float
+
+#endif
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/CMakeLists.txt
new file mode 100644
index 0000000000..2e78a9b451
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/CMakeLists.txt
@@ -0,0 +1,6 @@
+add_library(fastpfor
+        STATIC
+        fastpfor/bitpacking.cpp)
+
+target_include_directories(fastpfor PUBLIC
+        ${CMAKE_CURRENT_SOURCE_DIR})
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/LICENSE
new file mode 100644
index 0000000000..37ec93a14f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/LICENSE
@@ -0,0 +1,191 @@
+Apache License
+Version 2.0, January 2004
+http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and
+distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright
+owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities
+that control, are controlled by, or are under common control with that entity.
+For the purposes of this definition, "control" means (i) the power, direct or
+indirect, to cause the direction or management of such entity, whether by
+contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the
+outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising
+permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including
+but not limited to software source code, documentation source, and configuration
+files.
+
+"Object" form shall mean any form resulting from mechanical transformation or
+translation of a Source form, including but not limited to compiled object code,
+generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made
+available under the License, as indicated by a copyright notice that is included
+in or attached to the work (an example is provided in the Appendix below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that
+is based on (or derived from) the Work and for which the editorial revisions,
+annotations, elaborations, or other modifications represent, as a whole, an
+original work of authorship. For the purposes of this License, Derivative Works
+shall not include works that remain separable from, or merely link (or bind by
+name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version
+of the Work and any modifications or additions to that Work or Derivative Works
+thereof, that is intentionally submitted to Licensor for inclusion in the Work
+by the copyright owner or by an individual or Legal Entity authorized to submit
+on behalf of the copyright owner. For the purposes of this definition,
+"submitted" means any form of electronic, verbal, or written communication sent
+to the Licensor or its representatives, including but not limited to
+communication on electronic mailing lists, source code control systems, and
+issue tracking systems that are managed by, or on behalf of, the Licensor for
+the purpose of discussing and improving the Work, but excluding communication
+that is conspicuously marked or otherwise designated in writing by the copyright
+owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf
+of whom a Contribution has been received by Licensor and subsequently
+incorporated within the Work.
+
+2. Grant of Copyright License.
+
+Subject to the terms and conditions of this License, each Contributor hereby
+grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,
+irrevocable copyright license to reproduce, prepare Derivative Works of,
+publicly display, publicly perform, sublicense, and distribute the Work and such
+Derivative Works in Source or Object form.
+
+3. Grant of Patent License.
+
+Subject to the terms and conditions of this License, each Contributor hereby
+grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,
+irrevocable (except as stated in this section) patent license to make, have
+made, use, offer to sell, sell, import, and otherwise transfer the Work, where
+such license applies only to those patent claims licensable by such Contributor
+that are necessarily infringed by their Contribution(s) alone or by combination
+of their Contribution(s) with the Work to which such Contribution(s) was
+submitted. If You institute patent litigation against any entity (including a
+cross-claim or counterclaim in a lawsuit) alleging that the Work or a
+Contribution incorporated within the Work constitutes direct or contributory
+patent infringement, then any patent licenses granted to You under this License
+for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution.
+
+You may reproduce and distribute copies of the Work or Derivative Works thereof
+in any medium, with or without modifications, and in Source or Object form,
+provided that You meet the following conditions:
+
+You must give any other recipients of the Work or Derivative Works a copy of
+this License; and
+You must cause any modified files to carry prominent notices stating that You
+changed the files; and
+You must retain, in the Source form of any Derivative Works that You distribute,
+all copyright, patent, trademark, and attribution notices from the Source form
+of the Work, excluding those notices that do not pertain to any part of the
+Derivative Works; and
+If the Work includes a "NOTICE" text file as part of its distribution, then any
+Derivative Works that You distribute must include a readable copy of the
+attribution notices contained within such NOTICE file, excluding those notices
+that do not pertain to any part of the Derivative Works, in at least one of the
+following places: within a NOTICE text file distributed as part of the
+Derivative Works; within the Source form or documentation, if provided along
+with the Derivative Works; or, within a display generated by the Derivative
+Works, if and wherever such third-party notices normally appear. The contents of
+the NOTICE file are for informational purposes only and do not modify the
+License. You may add Your own attribution notices within Derivative Works that
+You distribute, alongside or as an addendum to the NOTICE text from the Work,
+provided that such additional attribution notices cannot be construed as
+modifying the License.
+You may add Your own copyright statement to Your modifications and may provide
+additional or different license terms and conditions for use, reproduction, or
+distribution of Your modifications, or for any such Derivative Works as a whole,
+provided Your use, reproduction, and distribution of the Work otherwise complies
+with the conditions stated in this License.
+
+5. Submission of Contributions.
+
+Unless You explicitly state otherwise, any Contribution intentionally submitted
+for inclusion in the Work by You to the Licensor shall be under the terms and
+conditions of this License, without any additional terms or conditions.
+Notwithstanding the above, nothing herein shall supersede or modify the terms of
+any separate license agreement you may have executed with Licensor regarding
+such Contributions.
+
+6. Trademarks.
+
+This License does not grant permission to use the trade names, trademarks,
+service marks, or product names of the Licensor, except as required for
+reasonable and customary use in describing the origin of the Work and
+reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty.
+
+Unless required by applicable law or agreed to in writing, Licensor provides the
+Work (and each Contributor provides its Contributions) on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied,
+including, without limitation, any warranties or conditions of TITLE,
+NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are
+solely responsible for determining the appropriateness of using or
+redistributing the Work and assume any risks associated with Your exercise of
+permissions under this License.
+
+8. Limitation of Liability.
+
+In no event and under no legal theory, whether in tort (including negligence),
+contract, or otherwise, unless required by applicable law (such as deliberate
+and grossly negligent acts) or agreed to in writing, shall any Contributor be
+liable to You for damages, including any direct, indirect, special, incidental,
+or consequential damages of any character arising as a result of this License or
+out of the use or inability to use the Work (including but not limited to
+damages for loss of goodwill, work stoppage, computer failure or malfunction, or
+any and all other commercial damages or losses), even if such Contributor has
+been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability.
+
+While redistributing the Work or Derivative Works thereof, You may choose to
+offer, and charge a fee for, acceptance of support, warranty, indemnity, or
+other liability obligations and/or rights consistent with this License. However,
+in accepting such obligations, You may act only on Your own behalf and on Your
+sole responsibility, not on behalf of any other Contributor, and only if You
+agree to indemnify, defend, and hold each Contributor harmless for any liability
+incurred by, or claims asserted against, such Contributor by reason of your
+accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+APPENDIX: How to apply the Apache License to your work
+
+To apply the Apache License to your work, attach the following boilerplate
+notice, with the fields enclosed by brackets "[]" replaced with your own
+identifying information. (Don't include the brackets!) The text should be
+enclosed in the appropriate comment syntax for the file format. We also
+recommend that a file or class name and description of purpose be included on
+the same "printed page" as the copyright notice for easier identification within
+third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+     http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/README b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/README
new file mode 100644
index 0000000000..e18556e20b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/README
@@ -0,0 +1,22 @@
+https://github.com/lemire/FastPFor
+
+Modified to remove 24 and 32-bit versions of the bitpackingaligned functions since we won't need them, and to remove unneeded includes in common.h.
+Modified to replace __restrict__ with __restrict for compatibility with MSVC.
+
+Included 16-bit support from DuckDB (MIT License below):
+    https://github.com/duckdb/duckdb/commit/68abedc20f290b53a2d1073b82e5cf73aef1e9f7
+Included 8-bit support from DuckDB (MIT License below):
+    https://github.com/duckdb/duckdb/commit/bb0df14323447523aa1e8ef09ab37278f7f2db39
+    https://github.com/duckdb/duckdb/commit/29698b8b3bec89a80d6eebcd0cf49972e5280645
+
+    Copyright 2018-2023 Stichting DuckDB Foundation
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to
+    deal in the Software without restriction, including without limitation the
+    rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+    sell copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in
+    all copies or substantial portions of the Software.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/bitpacking.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/bitpacking.cpp
new file mode 100644
index 0000000000..f11e2eb85a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/bitpacking.cpp
@@ -0,0 +1,2009 @@
+#include "bitpacking.h"
+#include <cstdint>
+#include <type_traits>
+
+namespace {
+
+template <uint8_t DELTA, uint8_t SHR>
+typename std::enable_if<(DELTA + SHR) < 8>::type unpack_single_out(const uint8_t *__restrict in,
+                                                                   uint8_t *__restrict out) {
+  *out = ((*in) >> SHR) % (1 << DELTA);
+}
+
+template <uint8_t DELTA, uint8_t SHR>
+typename std::enable_if<(DELTA + SHR) >= 8>::type unpack_single_out(const uint8_t *__restrict &in,
+                                                                     uint8_t *__restrict out) {
+  *out = (*in) >> SHR;
+  ++in;
+
+  static const uint8_t NEXT_SHR = SHR + DELTA - 8;
+  *out |= ((*in) % (1U << NEXT_SHR)) << (8 - SHR);
+}
+
+template <uint8_t DELTA, uint8_t SHR>
+typename std::enable_if<(DELTA + SHR) < 16>::type unpack_single_out(const uint16_t *__restrict in,
+                                                                    uint16_t *__restrict out) {
+  *out = ((*in) >> SHR) % (1 << DELTA);
+}
+
+template <uint8_t DELTA, uint8_t SHR>
+typename std::enable_if<(DELTA + SHR) >= 16>::type unpack_single_out(const uint16_t *__restrict &in,
+                                                                     uint16_t *__restrict out) {
+  *out = (*in) >> SHR;
+  ++in;
+
+  static const uint8_t NEXT_SHR = SHR + DELTA - 16;
+  *out |= ((*in) % (1U << NEXT_SHR)) << (16 - SHR);
+}
+
+
+template <uint8_t DELTA, uint8_t SHR>
+typename std::enable_if<(DELTA + SHR) < 32>::type unpack_single_out(
+    const uint32_t *__restrict in, uint32_t *__restrict out) {
+  *out = ((*in) >> SHR) % (1 << DELTA);
+}
+
+template <uint8_t DELTA, uint8_t SHR>
+typename std::enable_if<(DELTA + SHR) >= 32>::type unpack_single_out(
+    const uint32_t *__restrict &in, uint32_t *__restrict out) {
+  *out = (*in) >> SHR;
+  ++in;
+
+  static const uint8_t NEXT_SHR = SHR + DELTA - 32;
+  *out |= ((*in) % (1U << NEXT_SHR)) << (32 - SHR);
+}
+
+template <uint8_t DELTA, uint8_t SHR>
+typename std::enable_if<(DELTA + SHR) < 32>::type unpack_single_out(
+    const uint32_t *__restrict in, uint64_t *__restrict out) {
+  *out = ((static_cast<uint64_t>(*in)) >> SHR) % (1ULL << DELTA);
+}
+
+template <uint8_t DELTA, uint8_t SHR>
+typename std::enable_if<(DELTA + SHR) >= 32 && (DELTA + SHR) < 64>::type
+unpack_single_out(const uint32_t *__restrict &in,
+                  uint64_t *__restrict out) {
+  *out = static_cast<uint64_t>(*in) >> SHR;
+  ++in;
+  if (DELTA + SHR > 32) {
+    static const uint8_t NEXT_SHR = SHR + DELTA - 32;
+    *out |= static_cast<uint64_t>((*in) % (1U << NEXT_SHR)) << (32 - SHR);
+  }
+}
+
+template <uint8_t DELTA, uint8_t SHR>
+typename std::enable_if<(DELTA + SHR) >= 64>::type unpack_single_out(
+    const uint32_t *__restrict &in, uint64_t *__restrict out) {
+  *out = static_cast<uint64_t>(*in) >> SHR;
+  ++in;
+
+  *out |= static_cast<uint64_t>(*in) << (32 - SHR);
+  ++in;
+
+  if (DELTA + SHR > 64) {
+    static const uint8_t NEXT_SHR = DELTA + SHR - 64;
+    *out |= static_cast<uint64_t>((*in) % (1U << NEXT_SHR)) << (64 - SHR);
+  }
+}
+
+template <uint16_t DELTA, uint16_t SHL, uint32_t MASK>
+    typename std::enable_if <
+    DELTA + SHL<32>::type pack_single_in(const uint32_t in,
+                                         uint32_t *__restrict out) {
+  if (SHL == 0) {
+    *out = in & MASK;
+  } else {
+    *out |= (in & MASK) << SHL;
+  }
+}
+
+template <uint16_t DELTA, uint16_t SHL, uint32_t MASK>
+typename std::enable_if<DELTA + SHL >= 32>::type pack_single_in(
+    const uint32_t in, uint32_t *__restrict &out) {
+  *out |= in << SHL;
+  ++out;
+
+  if (DELTA + SHL > 32) {
+    *out = (in & MASK) >> (32 - SHL);
+  }
+}
+
+template <uint16_t DELTA, uint16_t SHL, uint16_t MASK>
+typename std::enable_if < DELTA + SHL<8>::type pack_single_in(const uint8_t in, uint8_t *__restrict out) {
+  if (SHL == 0) {
+    *out = in & MASK;
+  } else {
+    *out |= (in & MASK) << SHL;
+  }
+}
+
+template <uint16_t DELTA, uint16_t SHL, uint16_t MASK>
+typename std::enable_if<DELTA + SHL >= 8>::type pack_single_in(const uint8_t in, uint8_t *__restrict &out) {
+  *out |= in << SHL;
+  ++out;
+
+  if (DELTA + SHL > 8) {
+    *out = (in & MASK) >> (8 - SHL);
+  }
+}
+
+template <uint16_t DELTA, uint16_t SHL, uint16_t MASK>
+  typename std::enable_if < DELTA + SHL<16>::type pack_single_in(const uint16_t in, uint16_t *__restrict out) {
+  if (SHL == 0) {
+	*out = in & MASK;
+  } else {
+	*out |= (in & MASK) << SHL;
+  }
+}
+
+template <uint16_t DELTA, uint16_t SHL, uint16_t MASK>
+typename std::enable_if<DELTA + SHL >= 16>::type pack_single_in(const uint16_t in, uint16_t *__restrict &out) {
+  *out |= in << SHL;
+  ++out;
+
+  if (DELTA + SHL > 16) {
+	*out = (in & MASK) >> (16 - SHL);
+  }
+}
+
+
+template <uint16_t DELTA, uint16_t SHL, uint64_t MASK>
+    typename std::enable_if <
+    DELTA + SHL<32>::type pack_single_in64(const uint64_t in,
+                                           uint32_t *__restrict out) {
+  if (SHL == 0) {
+    *out = static_cast<uint32_t>(in & MASK);
+  } else {
+    *out |= (in & MASK) << SHL;
+  }
+}
+
+template <uint16_t DELTA, uint16_t SHL, uint64_t MASK>
+        typename std::enable_if < DELTA + SHL >= 32 &&
+    DELTA + SHL<64>::type pack_single_in64(const uint64_t in,
+                                           uint32_t *__restrict &out) {
+  if (SHL == 0) {
+    *out = static_cast<uint32_t>(in & MASK);
+  } else {
+    *out |= (in & MASK) << SHL;
+  }
+
+  ++out;
+
+  if (DELTA + SHL > 32) {
+    *out = static_cast<uint32_t>((in & MASK) >> (32 - SHL));
+  }
+}
+
+template <uint16_t DELTA, uint16_t SHL, uint64_t MASK>
+typename std::enable_if<DELTA + SHL >= 64>::type pack_single_in64(
+    const uint64_t in, uint32_t *__restrict &out) {
+  *out |= in << SHL;
+  ++out;
+
+  *out = static_cast<uint32_t>((in & MASK) >> (32 - SHL));
+  ++out;
+
+  if (DELTA + SHL > 64) {
+    *out = (in & MASK) >> (64 - SHL);
+  }
+}
+
+template <uint16_t DELTA, uint16_t OINDEX = 0>
+struct Unroller8 {
+  static void Unpack(const uint8_t *__restrict &in, uint8_t *__restrict out) {
+    unpack_single_out<DELTA, (DELTA * OINDEX) % 8>(in, out + OINDEX);
+
+    Unroller8<DELTA, OINDEX + 1>::Unpack(in, out);
+  }
+
+  static void Pack(const uint8_t *__restrict in, uint8_t *__restrict out) {
+    pack_single_in<DELTA, (DELTA * OINDEX) % 8, (1U << DELTA) - 1>(in[OINDEX], out);
+
+    Unroller8<DELTA, OINDEX + 1>::Pack(in, out);
+  }
+
+};
+template <uint16_t DELTA>
+struct Unroller8<DELTA, 7> {
+  enum { SHIFT = (DELTA * 7) % 8 };
+
+  static void Unpack(const uint8_t *__restrict in, uint8_t *__restrict out) {
+    out[7] = (*in) >> SHIFT;
+  }
+
+  static void Pack(const uint8_t *__restrict in, uint8_t *__restrict out) {
+    *out |= (in[7] << SHIFT);
+  }
+};
+
+
+template <uint16_t DELTA, uint16_t OINDEX = 0>
+struct Unroller16 {
+  static void Unpack(const uint16_t *__restrict &in, uint16_t *__restrict out) {
+	unpack_single_out<DELTA, (DELTA * OINDEX) % 16>(in, out + OINDEX);
+
+	Unroller16<DELTA, OINDEX + 1>::Unpack(in, out);
+  }
+
+  static void Pack(const uint16_t *__restrict in, uint16_t *__restrict out) {
+	pack_single_in<DELTA, (DELTA * OINDEX) % 16, (1U << DELTA) - 1>(in[OINDEX], out);
+
+	Unroller16<DELTA, OINDEX + 1>::Pack(in, out);
+  }
+
+};
+
+template <uint16_t DELTA>
+struct Unroller16<DELTA, 15> {
+	enum { SHIFT = (DELTA * 15) % 16 };
+
+	static void Unpack(const uint16_t *__restrict in, uint16_t *__restrict out) {
+		out[15] = (*in) >> SHIFT;
+	}
+
+	static void Pack(const uint16_t *__restrict in, uint16_t *__restrict out) {
+		*out |= (in[15] << SHIFT);
+	}
+};
+
+
+template <uint16_t DELTA, uint16_t OINDEX = 0>
+struct Unroller {
+  static void Unpack(const uint32_t *__restrict &in,
+                     uint32_t *__restrict out) {
+    unpack_single_out<DELTA, (DELTA * OINDEX) % 32>(in, out + OINDEX);
+
+    Unroller<DELTA, OINDEX + 1>::Unpack(in, out);
+  }
+
+  static void Unpack(const uint32_t *__restrict &in,
+                     uint64_t *__restrict out) {
+    unpack_single_out<DELTA, (DELTA * OINDEX) % 32>(in, out + OINDEX);
+
+    Unroller<DELTA, OINDEX + 1>::Unpack(in, out);
+  }
+
+  static void Pack(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+    pack_single_in<DELTA, (DELTA * OINDEX) % 32, (1U << DELTA) - 1>(in[OINDEX],
+                                                                    out);
+
+    Unroller<DELTA, OINDEX + 1>::Pack(in, out);
+  }
+
+  static void Pack(const uint64_t *__restrict in,
+                   uint32_t *__restrict out) {
+    pack_single_in64<DELTA, (DELTA * OINDEX) % 32, (1ULL << DELTA) - 1>(
+        in[OINDEX], out);
+
+    Unroller<DELTA, OINDEX + 1>::Pack(in, out);
+  }
+
+  static void PackNoMask(const uint32_t *__restrict in,
+                         uint32_t *__restrict out) {
+    pack_single_in<DELTA, (DELTA * OINDEX) % 32, uint32_t(-1)>(in[OINDEX], out);
+
+    Unroller<DELTA, OINDEX + 1>::PackNoMask(in, out);
+  }
+
+  static void PackNoMask(const uint64_t *__restrict in,
+                         uint32_t *__restrict out) {
+    pack_single_in64<DELTA, (DELTA * OINDEX) % 32, uint64_t(-1)>(in[OINDEX],
+                                                                 out);
+
+    Unroller<DELTA, OINDEX + 1>::PackNoMask(in, out);
+  }
+};
+
+template <uint16_t DELTA>
+struct Unroller<DELTA, 31> {
+  enum { SHIFT = (DELTA * 31) % 32 };
+
+  static void Unpack(const uint32_t *__restrict in,
+                     uint32_t *__restrict out) {
+    out[31] = (*in) >> SHIFT;
+  }
+
+  static void Unpack(const uint32_t *__restrict in,
+                     uint64_t *__restrict out) {
+    out[31] = (*in) >> SHIFT;
+    if (DELTA > 32) {
+      ++in;
+      out[31] |= static_cast<uint64_t>(*in) << (32 - SHIFT);
+    }
+  }
+
+  static void Pack(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+    *out |= (in[31] << SHIFT);
+  }
+
+  static void Pack(const uint64_t *__restrict in,
+                   uint32_t *__restrict out) {
+    *out |= (in[31] << SHIFT);
+    if (DELTA > 32) {
+      ++out;
+      *out = static_cast<uint32_t>(in[31] >> (32 - SHIFT));
+    }
+  }
+
+  static void PackNoMask(const uint32_t *__restrict in,
+                         uint32_t *__restrict out) {
+    *out |= (in[31] << SHIFT);
+  }
+
+  static void PackNoMask(const uint64_t *__restrict in,
+                         uint32_t *__restrict out) {
+    *out |= (in[31] << SHIFT);
+    if (DELTA > 32) {
+      ++out;
+      *out = static_cast<uint32_t>(in[31] >> (32 - SHIFT));
+    }
+  }
+};
+}  // namespace
+
+// Special cases
+void __fastunpack0(const uint8_t *__restrict, uint8_t *__restrict out) {
+  for (uint8_t i = 0; i < 8; ++i)
+    *(out++) = 0;
+}
+
+void __fastunpack0(const uint16_t *__restrict, uint16_t *__restrict out) {
+  for (uint16_t i = 0; i < 16; ++i)
+	*(out++) = 0;
+}
+
+void __fastunpack0(const uint32_t *__restrict, uint32_t *__restrict out) {
+  for (uint32_t i = 0; i < 32; ++i) *(out++) = 0;
+}
+
+void __fastunpack0(const uint32_t *__restrict, uint64_t *__restrict out) {
+  for (uint32_t i = 0; i < 32; ++i) *(out++) = 0;
+}
+
+void __fastpack0(const uint8_t *__restrict, uint8_t *__restrict) {}
+void __fastpack0(const uint16_t *__restrict, uint16_t *__restrict) {}
+void __fastpack0(const uint32_t *__restrict, uint32_t *__restrict) {}
+void __fastpack0(const uint64_t *__restrict, uint32_t *__restrict) {}
+
+void __fastpackwithoutmask0(const uint32_t *__restrict,
+                            uint32_t *__restrict) {}
+void __fastpackwithoutmask0(const uint64_t *__restrict,
+                            uint32_t *__restrict) {}
+
+// fastunpack for 8 bits
+void __fastunpack1(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<1>::Unpack(in, out);
+}
+
+void __fastunpack2(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<2>::Unpack(in, out);
+}
+
+void __fastunpack3(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<3>::Unpack(in, out);
+}
+
+void __fastunpack4(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  for (uint8_t outer = 0; outer < 4; ++outer) {
+    for (uint8_t inwordpointer = 0; inwordpointer < 8; inwordpointer += 4)
+      *(out++) = ((*in) >> inwordpointer) % (1U << 4);
+    ++in;
+  }
+}
+
+void __fastunpack5(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<5>::Unpack(in, out);
+}
+
+void __fastunpack6(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<6>::Unpack(in, out);
+}
+
+void __fastunpack7(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<7>::Unpack(in, out);
+}
+
+void __fastunpack8(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  for (int k = 0; k < 8; ++k)
+    out[k] = in[k];
+}
+
+// fastunpack for 16 bits
+void __fastunpack1(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<1>::Unpack(in, out);
+}
+
+void __fastunpack2(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<2>::Unpack(in, out);
+}
+
+void __fastunpack3(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<3>::Unpack(in, out);
+}
+
+void __fastunpack4(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  for (uint16_t outer = 0; outer < 4; ++outer) {
+	for (uint16_t inwordpointer = 0; inwordpointer < 16; inwordpointer += 4)
+	  *(out++) = ((*in) >> inwordpointer) % (1U << 4);
+	++in;
+  }
+}
+
+void __fastunpack5(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<5>::Unpack(in, out);
+}
+
+void __fastunpack6(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<6>::Unpack(in, out);
+}
+
+void __fastunpack7(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<7>::Unpack(in, out);
+}
+
+void __fastunpack8(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  for (uint16_t outer = 0; outer < 8; ++outer) {
+	for (uint16_t inwordpointer = 0; inwordpointer < 16; inwordpointer += 8)
+	  *(out++) = ((*in) >> inwordpointer) % (1U << 8);
+	++in;
+  }
+}
+
+void __fastunpack9(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<9>::Unpack(in, out);
+}
+
+void __fastunpack10(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<10>::Unpack(in, out);
+}
+
+void __fastunpack11(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<11>::Unpack(in, out);
+}
+
+void __fastunpack12(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<12>::Unpack(in, out);
+}
+
+void __fastunpack13(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<13>::Unpack(in, out);
+}
+
+void __fastunpack14(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<14>::Unpack(in, out);
+}
+
+void __fastunpack15(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<15>::Unpack(in, out);
+}
+
+void __fastunpack16(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  for (int k = 0; k < 16; ++k)
+	out[k] = in[k];
+}
+
+// fastunpack for 32 bits
+void __fastunpack1(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+  Unroller<1>::Unpack(in, out);
+}
+
+void __fastunpack2(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+  Unroller<2>::Unpack(in, out);
+}
+
+void __fastunpack3(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+  Unroller<3>::Unpack(in, out);
+}
+
+void __fastunpack4(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+  for (uint32_t outer = 0; outer < 4; ++outer) {
+    for (uint32_t inwordpointer = 0; inwordpointer < 32; inwordpointer += 4)
+      *(out++) = ((*in) >> inwordpointer) % (1U << 4);
+    ++in;
+  }
+}
+
+void __fastunpack5(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+  Unroller<5>::Unpack(in, out);
+}
+
+void __fastunpack6(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+  Unroller<6>::Unpack(in, out);
+}
+
+void __fastunpack7(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+  Unroller<7>::Unpack(in, out);
+}
+
+void __fastunpack8(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+  for (uint32_t outer = 0; outer < 8; ++outer) {
+    for (uint32_t inwordpointer = 0; inwordpointer < 32; inwordpointer += 8)
+      *(out++) = ((*in) >> inwordpointer) % (1U << 8);
+    ++in;
+  }
+}
+
+void __fastunpack9(const uint32_t *__restrict in,
+                   uint32_t *__restrict out) {
+  Unroller<9>::Unpack(in, out);
+}
+
+void __fastunpack10(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<10>::Unpack(in, out);
+}
+
+void __fastunpack11(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<11>::Unpack(in, out);
+}
+
+void __fastunpack12(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<12>::Unpack(in, out);
+}
+
+void __fastunpack13(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<13>::Unpack(in, out);
+}
+
+void __fastunpack14(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<14>::Unpack(in, out);
+}
+
+void __fastunpack15(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<15>::Unpack(in, out);
+}
+
+void __fastunpack16(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  for (uint32_t outer = 0; outer < 16; ++outer) {
+    for (uint32_t inwordpointer = 0; inwordpointer < 32; inwordpointer += 16)
+      *(out++) = ((*in) >> inwordpointer) % (1U << 16);
+    ++in;
+  }
+}
+
+void __fastunpack17(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<17>::Unpack(in, out);
+}
+
+void __fastunpack18(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<18>::Unpack(in, out);
+}
+
+void __fastunpack19(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<19>::Unpack(in, out);
+}
+
+void __fastunpack20(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<20>::Unpack(in, out);
+}
+
+void __fastunpack21(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<21>::Unpack(in, out);
+}
+
+void __fastunpack22(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<22>::Unpack(in, out);
+}
+
+void __fastunpack23(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<23>::Unpack(in, out);
+}
+
+void __fastunpack24(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<24>::Unpack(in, out);
+}
+
+void __fastunpack25(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<25>::Unpack(in, out);
+}
+
+void __fastunpack26(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<26>::Unpack(in, out);
+}
+
+void __fastunpack27(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<27>::Unpack(in, out);
+}
+
+void __fastunpack28(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<28>::Unpack(in, out);
+}
+
+void __fastunpack29(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<29>::Unpack(in, out);
+}
+
+void __fastunpack30(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<30>::Unpack(in, out);
+}
+
+void __fastunpack31(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  Unroller<31>::Unpack(in, out);
+}
+
+void __fastunpack32(const uint32_t *__restrict in,
+                    uint32_t *__restrict out) {
+  for (int k = 0; k < 32; ++k) out[k] = in[k];
+}
+
+// fastupack for 64 bits
+void __fastunpack1(const uint32_t *__restrict in,
+                   uint64_t *__restrict out) {
+  Unroller<1>::Unpack(in, out);
+}
+
+void __fastunpack2(const uint32_t *__restrict in,
+                   uint64_t *__restrict out) {
+  Unroller<2>::Unpack(in, out);
+}
+
+void __fastunpack3(const uint32_t *__restrict in,
+                   uint64_t *__restrict out) {
+  Unroller<3>::Unpack(in, out);
+}
+
+void __fastunpack4(const uint32_t *__restrict in,
+                   uint64_t *__restrict out) {
+  for (uint32_t outer = 0; outer < 4; ++outer) {
+    for (uint32_t inwordpointer = 0; inwordpointer < 32; inwordpointer += 4)
+      *(out++) = ((*in) >> inwordpointer) % (1U << 4);
+    ++in;
+  }
+}
+
+void __fastunpack5(const uint32_t *__restrict in,
+                   uint64_t *__restrict out) {
+  Unroller<5>::Unpack(in, out);
+}
+
+void __fastunpack6(const uint32_t *__restrict in,
+                   uint64_t *__restrict out) {
+  Unroller<6>::Unpack(in, out);
+}
+
+void __fastunpack7(const uint32_t *__restrict in,
+                   uint64_t *__restrict out) {
+  Unroller<7>::Unpack(in, out);
+}
+
+void __fastunpack8(const uint32_t *__restrict in,
+                   uint64_t *__restrict out) {
+  for (uint32_t outer = 0; outer < 8; ++outer) {
+    for (uint32_t inwordpointer = 0; inwordpointer < 32; inwordpointer += 8) {
+      *(out++) = ((*in) >> inwordpointer) % (1U << 8);
+    }
+    ++in;
+  }
+}
+
+void __fastunpack9(const uint32_t *__restrict in,
+                   uint64_t *__restrict out) {
+  Unroller<9>::Unpack(in, out);
+}
+
+void __fastunpack10(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<10>::Unpack(in, out);
+}
+
+void __fastunpack11(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<11>::Unpack(in, out);
+}
+
+void __fastunpack12(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<12>::Unpack(in, out);
+}
+
+void __fastunpack13(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<13>::Unpack(in, out);
+}
+
+void __fastunpack14(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<14>::Unpack(in, out);
+}
+
+void __fastunpack15(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<15>::Unpack(in, out);
+}
+
+void __fastunpack16(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  for (uint32_t outer = 0; outer < 16; ++outer) {
+    for (uint32_t inwordpointer = 0; inwordpointer < 32; inwordpointer += 16)
+      *(out++) = ((*in) >> inwordpointer) % (1U << 16);
+    ++in;
+  }
+}
+
+void __fastunpack17(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<17>::Unpack(in, out);
+}
+
+void __fastunpack18(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<18>::Unpack(in, out);
+}
+
+void __fastunpack19(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<19>::Unpack(in, out);
+}
+
+void __fastunpack20(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<20>::Unpack(in, out);
+}
+
+void __fastunpack21(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<21>::Unpack(in, out);
+}
+
+void __fastunpack22(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<22>::Unpack(in, out);
+}
+
+void __fastunpack23(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<23>::Unpack(in, out);
+}
+
+void __fastunpack24(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<24>::Unpack(in, out);
+}
+
+void __fastunpack25(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<25>::Unpack(in, out);
+}
+
+void __fastunpack26(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<26>::Unpack(in, out);
+}
+
+void __fastunpack27(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<27>::Unpack(in, out);
+}
+
+void __fastunpack28(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<28>::Unpack(in, out);
+}
+
+void __fastunpack29(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<29>::Unpack(in, out);
+}
+
+void __fastunpack30(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<30>::Unpack(in, out);
+}
+
+void __fastunpack31(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<31>::Unpack(in, out);
+}
+
+void __fastunpack32(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  for (int k = 0; k < 32; ++k) out[k] = in[k];
+}
+
+void __fastunpack33(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<33>::Unpack(in, out);
+}
+
+void __fastunpack34(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<34>::Unpack(in, out);
+}
+
+void __fastunpack35(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<35>::Unpack(in, out);
+}
+
+void __fastunpack36(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<36>::Unpack(in, out);
+}
+
+void __fastunpack37(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<37>::Unpack(in, out);
+}
+
+void __fastunpack38(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<38>::Unpack(in, out);
+}
+
+void __fastunpack39(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<39>::Unpack(in, out);
+}
+
+void __fastunpack40(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<40>::Unpack(in, out);
+}
+
+void __fastunpack41(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<41>::Unpack(in, out);
+}
+
+void __fastunpack42(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<42>::Unpack(in, out);
+}
+
+void __fastunpack43(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<43>::Unpack(in, out);
+}
+
+void __fastunpack44(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<44>::Unpack(in, out);
+}
+
+void __fastunpack45(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<45>::Unpack(in, out);
+}
+
+void __fastunpack46(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<46>::Unpack(in, out);
+}
+
+void __fastunpack47(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<47>::Unpack(in, out);
+}
+
+void __fastunpack48(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<48>::Unpack(in, out);
+}
+
+void __fastunpack49(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<49>::Unpack(in, out);
+}
+
+void __fastunpack50(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<50>::Unpack(in, out);
+}
+
+void __fastunpack51(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<51>::Unpack(in, out);
+}
+
+void __fastunpack52(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<52>::Unpack(in, out);
+}
+
+void __fastunpack53(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<53>::Unpack(in, out);
+}
+
+void __fastunpack54(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<54>::Unpack(in, out);
+}
+
+void __fastunpack55(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<55>::Unpack(in, out);
+}
+
+void __fastunpack56(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<56>::Unpack(in, out);
+}
+
+void __fastunpack57(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<57>::Unpack(in, out);
+}
+
+void __fastunpack58(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<58>::Unpack(in, out);
+}
+
+void __fastunpack59(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<59>::Unpack(in, out);
+}
+
+void __fastunpack60(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<60>::Unpack(in, out);
+}
+
+void __fastunpack61(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<61>::Unpack(in, out);
+}
+
+void __fastunpack62(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<62>::Unpack(in, out);
+}
+
+void __fastunpack63(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  Unroller<63>::Unpack(in, out);
+}
+
+void __fastunpack64(const uint32_t *__restrict in,
+                    uint64_t *__restrict out) {
+  for (int k = 0; k < 32; ++k) {
+    out[k] = in[k * 2];
+    out[k] |= static_cast<uint64_t>(in[k * 2 + 1]) << 32;
+  }
+}
+
+// fastpack for 8 bits
+
+void __fastpack1(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<1>::Pack(in, out);
+}
+
+void __fastpack2(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<2>::Pack(in, out);
+}
+
+void __fastpack3(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<3>::Pack(in, out);
+}
+
+void __fastpack4(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<4>::Pack(in, out);
+}
+
+void __fastpack5(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<5>::Pack(in, out);
+}
+
+void __fastpack6(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<6>::Pack(in, out);
+}
+
+void __fastpack7(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  Unroller8<7>::Pack(in, out);
+}
+
+void __fastpack8(const uint8_t *__restrict in, uint8_t *__restrict out) {
+  for (int k = 0; k < 8; ++k)
+    out[k] = in[k];
+}
+
+// fastpack for 16 bits
+
+void __fastpack1(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<1>::Pack(in, out);
+}
+
+void __fastpack2(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<2>::Pack(in, out);
+}
+
+void __fastpack3(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<3>::Pack(in, out);
+}
+
+void __fastpack4(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<4>::Pack(in, out);
+}
+
+void __fastpack5(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<5>::Pack(in, out);
+}
+
+void __fastpack6(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<6>::Pack(in, out);
+}
+
+void __fastpack7(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<7>::Pack(in, out);
+}
+
+void __fastpack8(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<8>::Pack(in, out);
+}
+
+void __fastpack9(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<9>::Pack(in, out);
+}
+
+void __fastpack10(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<10>::Pack(in, out);
+}
+
+void __fastpack11(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<11>::Pack(in, out);
+}
+
+void __fastpack12(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<12>::Pack(in, out);
+}
+
+void __fastpack13(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<13>::Pack(in, out);
+}
+
+void __fastpack14(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<14>::Pack(in, out);
+}
+
+void __fastpack15(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  Unroller16<15>::Pack(in, out);
+}
+
+void __fastpack16(const uint16_t *__restrict in, uint16_t *__restrict out) {
+  for (int k = 0; k < 16; ++k)
+    out[k] = in[k];
+}
+
+// fastpack for 32 bits
+
+void __fastpack1(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<1>::Pack(in, out);
+}
+
+void __fastpack2(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<2>::Pack(in, out);
+}
+
+void __fastpack3(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<3>::Pack(in, out);
+}
+
+void __fastpack4(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<4>::Pack(in, out);
+}
+
+void __fastpack5(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<5>::Pack(in, out);
+}
+
+void __fastpack6(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<6>::Pack(in, out);
+}
+
+void __fastpack7(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<7>::Pack(in, out);
+}
+
+void __fastpack8(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<8>::Pack(in, out);
+}
+
+void __fastpack9(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<9>::Pack(in, out);
+}
+
+void __fastpack10(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<10>::Pack(in, out);
+}
+
+void __fastpack11(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<11>::Pack(in, out);
+}
+
+void __fastpack12(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<12>::Pack(in, out);
+}
+
+void __fastpack13(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<13>::Pack(in, out);
+}
+
+void __fastpack14(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<14>::Pack(in, out);
+}
+
+void __fastpack15(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<15>::Pack(in, out);
+}
+
+void __fastpack16(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<16>::Pack(in, out);
+}
+
+void __fastpack17(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<17>::Pack(in, out);
+}
+
+void __fastpack18(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<18>::Pack(in, out);
+}
+
+void __fastpack19(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<19>::Pack(in, out);
+}
+
+void __fastpack20(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<20>::Pack(in, out);
+}
+
+void __fastpack21(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<21>::Pack(in, out);
+}
+
+void __fastpack22(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<22>::Pack(in, out);
+}
+
+void __fastpack23(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<23>::Pack(in, out);
+}
+
+void __fastpack24(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<24>::Pack(in, out);
+}
+
+void __fastpack25(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<25>::Pack(in, out);
+}
+
+void __fastpack26(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<26>::Pack(in, out);
+}
+
+void __fastpack27(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<27>::Pack(in, out);
+}
+
+void __fastpack28(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<28>::Pack(in, out);
+}
+
+void __fastpack29(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<29>::Pack(in, out);
+}
+
+void __fastpack30(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<30>::Pack(in, out);
+}
+
+void __fastpack31(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<31>::Pack(in, out);
+}
+
+void __fastpack32(const uint32_t *__restrict in, uint32_t *__restrict out) {
+  for (int k = 0; k < 32; ++k) out[k] = in[k];
+}
+
+// fastpack for 64 bits
+
+void __fastpack1(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<1>::Pack(in, out);
+}
+
+void __fastpack2(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<2>::Pack(in, out);
+}
+
+void __fastpack3(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<3>::Pack(in, out);
+}
+
+void __fastpack4(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<4>::Pack(in, out);
+}
+
+void __fastpack5(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<5>::Pack(in, out);
+}
+
+void __fastpack6(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<6>::Pack(in, out);
+}
+
+void __fastpack7(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<7>::Pack(in, out);
+}
+
+void __fastpack8(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<8>::Pack(in, out);
+}
+
+void __fastpack9(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<9>::Pack(in, out);
+}
+
+void __fastpack10(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<10>::Pack(in, out);
+}
+
+void __fastpack11(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<11>::Pack(in, out);
+}
+
+void __fastpack12(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<12>::Pack(in, out);
+}
+
+void __fastpack13(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<13>::Pack(in, out);
+}
+
+void __fastpack14(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<14>::Pack(in, out);
+}
+
+void __fastpack15(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<15>::Pack(in, out);
+}
+
+void __fastpack16(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<16>::Pack(in, out);
+}
+
+void __fastpack17(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<17>::Pack(in, out);
+}
+
+void __fastpack18(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<18>::Pack(in, out);
+}
+
+void __fastpack19(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<19>::Pack(in, out);
+}
+
+void __fastpack20(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<20>::Pack(in, out);
+}
+
+void __fastpack21(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<21>::Pack(in, out);
+}
+
+void __fastpack22(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<22>::Pack(in, out);
+}
+
+void __fastpack23(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<23>::Pack(in, out);
+}
+
+void __fastpack24(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<24>::Pack(in, out);
+}
+
+void __fastpack25(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<25>::Pack(in, out);
+}
+
+void __fastpack26(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<26>::Pack(in, out);
+}
+
+void __fastpack27(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<27>::Pack(in, out);
+}
+
+void __fastpack28(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<28>::Pack(in, out);
+}
+
+void __fastpack29(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<29>::Pack(in, out);
+}
+
+void __fastpack30(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<30>::Pack(in, out);
+}
+
+void __fastpack31(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<31>::Pack(in, out);
+}
+
+void __fastpack32(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  for (int k = 0; k < 32; ++k) {
+    out[k] = static_cast<uint32_t>(in[k]);
+  }
+}
+
+void __fastpack33(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<33>::Pack(in, out);
+}
+
+void __fastpack34(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<34>::Pack(in, out);
+}
+
+void __fastpack35(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<35>::Pack(in, out);
+}
+
+void __fastpack36(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<36>::Pack(in, out);
+}
+
+void __fastpack37(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<37>::Pack(in, out);
+}
+
+void __fastpack38(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<38>::Pack(in, out);
+}
+
+void __fastpack39(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<39>::Pack(in, out);
+}
+
+void __fastpack40(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<40>::Pack(in, out);
+}
+
+void __fastpack41(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<41>::Pack(in, out);
+}
+
+void __fastpack42(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<42>::Pack(in, out);
+}
+
+void __fastpack43(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<43>::Pack(in, out);
+}
+
+void __fastpack44(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<44>::Pack(in, out);
+}
+
+void __fastpack45(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<45>::Pack(in, out);
+}
+
+void __fastpack46(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<46>::Pack(in, out);
+}
+
+void __fastpack47(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<47>::Pack(in, out);
+}
+
+void __fastpack48(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<48>::Pack(in, out);
+}
+
+void __fastpack49(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<49>::Pack(in, out);
+}
+
+void __fastpack50(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<50>::Pack(in, out);
+}
+
+void __fastpack51(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<51>::Pack(in, out);
+}
+
+void __fastpack52(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<52>::Pack(in, out);
+}
+
+void __fastpack53(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<53>::Pack(in, out);
+}
+
+void __fastpack54(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<54>::Pack(in, out);
+}
+
+void __fastpack55(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<55>::Pack(in, out);
+}
+
+void __fastpack56(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<56>::Pack(in, out);
+}
+
+void __fastpack57(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<57>::Pack(in, out);
+}
+
+void __fastpack58(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<58>::Pack(in, out);
+}
+
+void __fastpack59(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<59>::Pack(in, out);
+}
+
+void __fastpack60(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<60>::Pack(in, out);
+}
+
+void __fastpack61(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<61>::Pack(in, out);
+}
+
+void __fastpack62(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<62>::Pack(in, out);
+}
+
+void __fastpack63(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  Unroller<63>::Pack(in, out);
+}
+
+void __fastpack64(const uint64_t *__restrict in, uint32_t *__restrict out) {
+  for (int i = 0; i < 32; ++i) {
+    out[2 * i] = static_cast<uint32_t>(in[i]);
+    out[2 * i + 1] = in[i] >> 32;
+  }
+}
+
+// fastpackwithoutmask for 32 bits
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask1(const uint32_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<1>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask2(const uint32_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<2>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask3(const uint32_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<3>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask4(const uint32_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<4>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask5(const uint32_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<5>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask6(const uint32_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<6>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask7(const uint32_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<7>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask8(const uint32_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<8>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask9(const uint32_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<9>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask10(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<10>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask11(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<11>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask12(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<12>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask13(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<13>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask14(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<14>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask15(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<15>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask16(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<16>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask17(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<17>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask18(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<18>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask19(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<19>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask20(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<20>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask21(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<21>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask22(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<22>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask23(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<23>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask24(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<24>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask25(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<25>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask26(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<26>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask27(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<27>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask28(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<28>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask29(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<29>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask30(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<30>::PackNoMask(in, out);
+}
+
+/*assumes that integers fit in the prescribed number of bits */
+void __fastpackwithoutmask31(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<31>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask32(const uint32_t *__restrict in,
+                             uint32_t *__restrict out) {
+  for (int k = 0; k < 32; ++k) out[k] = in[k];
+}
+
+// fastpackwithoutmask for 64 bits
+void __fastpackwithoutmask1(const uint64_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<1>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask2(const uint64_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<2>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask3(const uint64_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<3>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask4(const uint64_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<4>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask5(const uint64_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<5>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask6(const uint64_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<6>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask7(const uint64_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<7>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask8(const uint64_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<8>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask9(const uint64_t *__restrict in,
+                            uint32_t *__restrict out) {
+  Unroller<9>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask10(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<10>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask11(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<11>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask12(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<12>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask13(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<13>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask14(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<14>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask15(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<15>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask16(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<16>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask17(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<17>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask18(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<18>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask19(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<19>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask20(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<20>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask21(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<21>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask22(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<22>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask23(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<23>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask24(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<24>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask25(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<25>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask26(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<26>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask27(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<27>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask28(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<28>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask29(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<29>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask30(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<30>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask31(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<31>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask32(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  for (int i = 0; i < 32; ++i) {
+    out[i] = static_cast<uint32_t>(in[i]);
+  }
+}
+
+void __fastpackwithoutmask33(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<33>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask34(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<34>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask35(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<35>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask36(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<36>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask37(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<37>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask38(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<38>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask39(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<39>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask40(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<40>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask41(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<41>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask42(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<42>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask43(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<43>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask44(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<44>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask45(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<45>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask46(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<46>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask47(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<47>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask48(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<48>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask49(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<49>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask50(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<50>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask51(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<51>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask52(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<52>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask53(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<53>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask54(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<54>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask55(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<55>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask56(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<56>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask57(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<57>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask58(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<58>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask59(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<59>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask60(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<60>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask61(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<61>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask62(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<62>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask63(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  Unroller<63>::PackNoMask(in, out);
+}
+
+void __fastpackwithoutmask64(const uint64_t *__restrict in,
+                             uint32_t *__restrict out) {
+  for (int i = 0; i < 32; ++i) {
+    out[2 * i] = static_cast<uint32_t>(in[i]);
+    out[2 * i + 1] = in[i] >> 32;
+  }
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/bitpacking.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/bitpacking.h
new file mode 100644
index 0000000000..8e6835ed00
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/bitpacking.h
@@ -0,0 +1,543 @@
+/**
+ * This code is released under the
+ * Apache License Version 2.0 http://www.apache.org/licenses/.
+ *
+ * (c) Daniel Lemire, http://lemire.me/en/
+ */
+#ifndef BITPACKING_H_
+#define BITPACKING_H_
+#include "common.h"
+
+void __fastunpack0(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastunpack1(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastunpack2(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastunpack3(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastunpack4(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastunpack5(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastunpack6(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastunpack7(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastunpack8(const uint8_t *__restrict in, uint8_t *__restrict out);
+
+void __fastunpack0(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack1(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack2(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack3(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack4(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack5(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack6(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack7(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack8(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack9(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack10(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack11(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack12(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack13(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack14(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack15(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastunpack16(const uint16_t *__restrict in, uint16_t *__restrict out);
+
+void __fastunpack0(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack1(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack2(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack3(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack4(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack5(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack6(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack7(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack8(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack9(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastunpack10(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack11(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack12(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack13(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack14(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack15(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack16(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack17(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack18(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack19(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack20(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack21(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack22(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack23(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack24(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack25(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack26(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack27(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack28(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack29(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack30(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack31(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+void __fastunpack32(const uint32_t *__restrict in,
+                    uint32_t *__restrict out);
+
+void __fastunpack0(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack1(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack2(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack3(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack4(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack5(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack6(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack7(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack8(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack9(const uint32_t *__restrict in, uint64_t *__restrict out);
+void __fastunpack10(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack11(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack12(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack13(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack14(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack15(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack16(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack17(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack18(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack19(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack20(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack21(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack22(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack23(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack24(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack25(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack26(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack27(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack28(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack29(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack30(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack31(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack32(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack33(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack34(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack35(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack36(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack37(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack38(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack39(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack40(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack41(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack42(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack43(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack44(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack45(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack46(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack47(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack48(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack49(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack50(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack51(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack52(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack53(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack54(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack55(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack56(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack57(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack58(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack59(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack60(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack61(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack62(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack63(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+void __fastunpack64(const uint32_t *__restrict in,
+                    uint64_t *__restrict out);
+
+void __fastpack0(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastpack1(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastpack2(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastpack3(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastpack4(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastpack5(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastpack6(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastpack7(const uint8_t *__restrict in, uint8_t *__restrict out);
+void __fastpack8(const uint8_t *__restrict in, uint8_t *__restrict out);
+
+void __fastpack0(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack1(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack2(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack3(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack4(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack5(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack6(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack7(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack8(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack9(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack10(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack11(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack12(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack13(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack14(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack15(const uint16_t *__restrict in, uint16_t *__restrict out);
+void __fastpack16(const uint16_t *__restrict in, uint16_t *__restrict out);
+
+void __fastpack0(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack1(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack2(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack3(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack4(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack5(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack6(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack7(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack8(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack9(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack10(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack11(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack12(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack13(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack14(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack15(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack16(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack17(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack18(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack19(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack20(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack21(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack22(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack23(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack24(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack25(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack26(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack27(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack28(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack29(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack30(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack31(const uint32_t *__restrict in, uint32_t *__restrict out);
+void __fastpack32(const uint32_t *__restrict in, uint32_t *__restrict out);
+
+void __fastpack0(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack1(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack2(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack3(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack4(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack5(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack6(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack7(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack8(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack9(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack10(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack11(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack12(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack13(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack14(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack15(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack16(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack17(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack18(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack19(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack20(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack21(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack22(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack23(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack24(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack25(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack26(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack27(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack28(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack29(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack30(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack31(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack32(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack33(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack34(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack35(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack36(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack37(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack38(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack39(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack40(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack41(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack42(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack43(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack44(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack45(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack46(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack47(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack48(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack49(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack50(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack51(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack52(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack53(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack54(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack55(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack56(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack57(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack58(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack59(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack60(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack61(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack62(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack63(const uint64_t *__restrict in, uint32_t *__restrict out);
+void __fastpack64(const uint64_t *__restrict in, uint32_t *__restrict out);
+
+void __fastpackwithoutmask0(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask1(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask2(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask3(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask4(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask5(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask6(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask7(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask8(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask9(const uint32_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask10(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask11(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask12(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask13(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask14(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask15(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask16(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask17(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask18(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask19(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask20(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask21(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask22(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask23(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask24(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask25(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask26(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask27(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask28(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask29(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask30(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask31(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask32(const uint32_t *__restrict in,
+                             uint32_t *__restrict out);
+
+void __fastpackwithoutmask0(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask1(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask2(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask3(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask4(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask5(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask6(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask7(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask8(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask9(const uint64_t *__restrict in,
+                            uint32_t *__restrict out);
+void __fastpackwithoutmask10(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask11(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask12(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask13(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask14(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask15(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask16(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask17(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask18(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask19(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask20(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask21(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask22(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask23(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask24(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask25(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask26(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask27(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask28(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask29(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask30(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask31(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask32(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask33(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask34(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask35(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask36(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask37(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask38(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask39(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask40(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask41(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask42(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask43(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask44(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask45(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask46(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask47(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask48(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask49(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask50(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask51(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask52(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask53(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask54(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask55(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask56(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask57(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask58(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask59(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask60(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask61(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask62(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask63(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+void __fastpackwithoutmask64(const uint64_t *__restrict in,
+                             uint32_t *__restrict out);
+
+#endif /* BITPACKING_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/bitpackinghelpers.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/bitpackinghelpers.h
new file mode 100644
index 0000000000..536c6b7780
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/bitpackinghelpers.h
@@ -0,0 +1,1208 @@
+/*
+ * bitpackinghelpers.h
+ *
+ *  Created on: Jul 11, 2012
+ *      Author: lemire
+ */
+
+#ifndef BITPACKINGHELPERS_H_
+#define BITPACKINGHELPERS_H_
+
+#include "bitpacking.h"
+
+namespace FastPForLib {
+
+// Note that this only packs 8 values
+inline void fastunpack_quarter(const uint8_t *__restrict in, uint8_t *__restrict out, const uint32_t bit) {
+  // Could have used function pointers instead of switch.
+  // Switch calls do offer the compiler more opportunities for optimization in
+  // theory. In this case, it makes no difference with a good compiler.
+  switch (bit) {
+  case 0:
+    __fastunpack0(in, out);
+    break;
+  case 1:
+    __fastunpack1(in, out);
+    break;
+  case 2:
+    __fastunpack2(in, out);
+    break;
+  case 3:
+    __fastunpack3(in, out);
+    break;
+  case 4:
+    __fastunpack4(in, out);
+    break;
+  case 5:
+    __fastunpack5(in, out);
+    break;
+  case 6:
+    __fastunpack6(in, out);
+    break;
+  case 7:
+    __fastunpack7(in, out);
+    break;
+  case 8:
+    __fastunpack8(in, out);
+    break;
+  default:
+    throw std::logic_error("Invalid bit width for bitpacking");
+  }
+}
+
+// Note that this only packs 8 values
+inline void fastpack_quarter(const uint8_t *__restrict in, uint8_t *__restrict out, const uint32_t bit) {
+  // Could have used function pointers instead of switch.
+  // Switch calls do offer the compiler more opportunities for optimization in
+  // theory. In this case, it makes no difference with a good compiler.
+  switch (bit) {
+  case 0:
+    __fastpack0(in, out);
+    break;
+  case 1:
+    __fastpack1(in, out);
+    break;
+  case 2:
+    __fastpack2(in, out);
+    break;
+  case 3:
+    __fastpack3(in, out);
+    break;
+  case 4:
+    __fastpack4(in, out);
+    break;
+  case 5:
+    __fastpack5(in, out);
+    break;
+  case 6:
+    __fastpack6(in, out);
+    break;
+  case 7:
+    __fastpack7(in, out);
+    break;
+  case 8:
+    __fastpack8(in, out);
+    break;
+  default:
+  	throw std::logic_error("Invalid bit width for bitpacking");
+  }
+}
+
+// Note that this only packs 16 values
+inline void fastunpack_half(const uint16_t *__restrict in, uint16_t *__restrict out, const uint32_t bit) {
+  // Could have used function pointers instead of switch.
+  // Switch calls do offer the compiler more opportunities for optimization in
+  // theory. In this case, it makes no difference with a good compiler.
+  switch (bit) {
+  case 0:
+    __fastunpack0(in, out);
+    break;
+  case 1:
+    __fastunpack1(in, out);
+    break;
+  case 2:
+    __fastunpack2(in, out);
+    break;
+  case 3:
+    __fastunpack3(in, out);
+    break;
+  case 4:
+    __fastunpack4(in, out);
+    break;
+  case 5:
+    __fastunpack5(in, out);
+    break;
+  case 6:
+    __fastunpack6(in, out);
+    break;
+  case 7:
+    __fastunpack7(in, out);
+    break;
+  case 8:
+    __fastunpack8(in, out);
+    break;
+  case 9:
+    __fastunpack9(in, out);
+    break;
+  case 10:
+    __fastunpack10(in, out);
+    break;
+  case 11:
+    __fastunpack11(in, out);
+    break;
+  case 12:
+    __fastunpack12(in, out);
+    break;
+  case 13:
+    __fastunpack13(in, out);
+    break;
+  case 14:
+    __fastunpack14(in, out);
+  break;
+  case 15:
+    __fastunpack15(in, out);
+    break;
+  case 16:
+    __fastunpack16(in, out);
+    break;
+  default:
+    throw std::logic_error("Invalid bit width for bitpacking");
+  }
+}
+
+// Note that this only packs 16 values
+inline void fastpack_half(const uint16_t *__restrict in, uint16_t *__restrict out, const uint32_t bit) {
+    // Could have used function pointers instead of switch.
+    // Switch calls do offer the compiler more opportunities for optimization in
+    // theory. In this case, it makes no difference with a good compiler.
+  switch (bit) {
+  case 0:
+    __fastpack0(in, out);
+    break;
+  case 1:
+    __fastpack1(in, out);
+    break;
+  case 2:
+    __fastpack2(in, out);
+    break;
+  case 3:
+    __fastpack3(in, out);
+    break;
+  case 4:
+    __fastpack4(in, out);
+    break;
+  case 5:
+    __fastpack5(in, out);
+    break;
+  case 6:
+    __fastpack6(in, out);
+    break;
+  case 7:
+    __fastpack7(in, out);
+    break;
+  case 8:
+    __fastpack8(in, out);
+    break;
+  case 9:
+    __fastpack9(in, out);
+    break;
+  case 10:
+    __fastpack10(in, out);
+    break;
+  case 11:
+    __fastpack11(in, out);
+    break;
+  case 12:
+    __fastpack12(in, out);
+    break;
+  case 13:
+    __fastpack13(in, out);
+    break;
+  case 14:
+    __fastpack14(in, out);
+    break;
+  case 15:
+    __fastpack15(in, out);
+    break;
+  case 16:
+    __fastpack16(in, out);
+    break;
+  default:
+    throw std::logic_error("Invalid bit width for bitpacking");
+  }
+}
+
+inline void fastunpack(const uint8_t *__restrict in, uint8_t *__restrict out, const uint32_t bit) {
+  for (uint8_t i = 0; i < 4; i++) {
+    fastunpack_quarter(in + (i*bit), out+(i*8), bit);
+  }
+}
+
+inline void fastunpack(const uint16_t *__restrict in,
+        		    uint16_t *__restrict out, const uint32_t bit) {
+  fastunpack_half(in, out, bit);
+  fastunpack_half(in + bit, out+16, bit);
+}
+
+
+inline void fastunpack(const uint32_t *__restrict in,
+                       uint32_t *__restrict out, const uint32_t bit) {
+  // Could have used function pointers instead of switch.
+  // Switch calls do offer the compiler more opportunities for optimization in
+  // theory. In this case, it makes no difference with a good compiler.
+  switch (bit) {
+  case 0:
+    __fastunpack0(in, out);
+    break;
+  case 1:
+    __fastunpack1(in, out);
+    break;
+  case 2:
+    __fastunpack2(in, out);
+    break;
+  case 3:
+    __fastunpack3(in, out);
+    break;
+  case 4:
+    __fastunpack4(in, out);
+    break;
+  case 5:
+    __fastunpack5(in, out);
+    break;
+  case 6:
+    __fastunpack6(in, out);
+    break;
+  case 7:
+    __fastunpack7(in, out);
+    break;
+  case 8:
+    __fastunpack8(in, out);
+    break;
+  case 9:
+    __fastunpack9(in, out);
+    break;
+  case 10:
+    __fastunpack10(in, out);
+    break;
+  case 11:
+    __fastunpack11(in, out);
+    break;
+  case 12:
+    __fastunpack12(in, out);
+    break;
+  case 13:
+    __fastunpack13(in, out);
+    break;
+  case 14:
+    __fastunpack14(in, out);
+    break;
+  case 15:
+    __fastunpack15(in, out);
+    break;
+  case 16:
+    __fastunpack16(in, out);
+    break;
+  case 17:
+    __fastunpack17(in, out);
+    break;
+  case 18:
+    __fastunpack18(in, out);
+    break;
+  case 19:
+    __fastunpack19(in, out);
+    break;
+  case 20:
+    __fastunpack20(in, out);
+    break;
+  case 21:
+    __fastunpack21(in, out);
+    break;
+  case 22:
+    __fastunpack22(in, out);
+    break;
+  case 23:
+    __fastunpack23(in, out);
+    break;
+  case 24:
+    __fastunpack24(in, out);
+    break;
+  case 25:
+    __fastunpack25(in, out);
+    break;
+  case 26:
+    __fastunpack26(in, out);
+    break;
+  case 27:
+    __fastunpack27(in, out);
+    break;
+  case 28:
+    __fastunpack28(in, out);
+    break;
+  case 29:
+    __fastunpack29(in, out);
+    break;
+  case 30:
+    __fastunpack30(in, out);
+    break;
+  case 31:
+    __fastunpack31(in, out);
+    break;
+  case 32:
+    __fastunpack32(in, out);
+    break;
+  default:
+    break;
+  }
+}
+
+inline void fastunpack(const uint32_t *__restrict in,
+                       uint64_t *__restrict out, const uint32_t bit) {
+  // Could have used function pointers instead of switch.
+  // Switch calls do offer the compiler more opportunities for optimization in
+  // theory. In this case, it makes no difference with a good compiler.
+  switch (bit) {
+  case 0:
+    __fastunpack0(in, out);
+    break;
+  case 1:
+    __fastunpack1(in, out);
+    break;
+  case 2:
+    __fastunpack2(in, out);
+    break;
+  case 3:
+    __fastunpack3(in, out);
+    break;
+  case 4:
+    __fastunpack4(in, out);
+    break;
+  case 5:
+    __fastunpack5(in, out);
+    break;
+  case 6:
+    __fastunpack6(in, out);
+    break;
+  case 7:
+    __fastunpack7(in, out);
+    break;
+  case 8:
+    __fastunpack8(in, out);
+    break;
+  case 9:
+    __fastunpack9(in, out);
+    break;
+  case 10:
+    __fastunpack10(in, out);
+    break;
+  case 11:
+    __fastunpack11(in, out);
+    break;
+  case 12:
+    __fastunpack12(in, out);
+    break;
+  case 13:
+    __fastunpack13(in, out);
+    break;
+  case 14:
+    __fastunpack14(in, out);
+    break;
+  case 15:
+    __fastunpack15(in, out);
+    break;
+  case 16:
+    __fastunpack16(in, out);
+    break;
+  case 17:
+    __fastunpack17(in, out);
+    break;
+  case 18:
+    __fastunpack18(in, out);
+    break;
+  case 19:
+    __fastunpack19(in, out);
+    break;
+  case 20:
+    __fastunpack20(in, out);
+    break;
+  case 21:
+    __fastunpack21(in, out);
+    break;
+  case 22:
+    __fastunpack22(in, out);
+    break;
+  case 23:
+    __fastunpack23(in, out);
+    break;
+  case 24:
+    __fastunpack24(in, out);
+    break;
+  case 25:
+    __fastunpack25(in, out);
+    break;
+  case 26:
+    __fastunpack26(in, out);
+    break;
+  case 27:
+    __fastunpack27(in, out);
+    break;
+  case 28:
+    __fastunpack28(in, out);
+    break;
+  case 29:
+    __fastunpack29(in, out);
+    break;
+  case 30:
+    __fastunpack30(in, out);
+    break;
+  case 31:
+    __fastunpack31(in, out);
+    break;
+  case 32:
+    __fastunpack32(in, out);
+    break;
+  case 33:
+    __fastunpack33(in, out);
+    break;
+  case 34:
+    __fastunpack34(in, out);
+    break;
+  case 35:
+    __fastunpack35(in, out);
+    break;
+  case 36:
+    __fastunpack36(in, out);
+    break;
+  case 37:
+    __fastunpack37(in, out);
+    break;
+  case 38:
+    __fastunpack38(in, out);
+    break;
+  case 39:
+    __fastunpack39(in, out);
+    break;
+  case 40:
+    __fastunpack40(in, out);
+    break;
+  case 41:
+    __fastunpack41(in, out);
+    break;
+  case 42:
+    __fastunpack42(in, out);
+    break;
+  case 43:
+    __fastunpack43(in, out);
+    break;
+  case 44:
+    __fastunpack44(in, out);
+    break;
+  case 45:
+    __fastunpack45(in, out);
+    break;
+  case 46:
+    __fastunpack46(in, out);
+    break;
+  case 47:
+    __fastunpack47(in, out);
+    break;
+  case 48:
+    __fastunpack48(in, out);
+    break;
+  case 49:
+    __fastunpack49(in, out);
+    break;
+  case 50:
+    __fastunpack50(in, out);
+    break;
+  case 51:
+    __fastunpack51(in, out);
+    break;
+  case 52:
+    __fastunpack52(in, out);
+    break;
+  case 53:
+    __fastunpack53(in, out);
+    break;
+  case 54:
+    __fastunpack54(in, out);
+    break;
+  case 55:
+    __fastunpack55(in, out);
+    break;
+  case 56:
+    __fastunpack56(in, out);
+    break;
+  case 57:
+    __fastunpack57(in, out);
+    break;
+  case 58:
+    __fastunpack58(in, out);
+    break;
+  case 59:
+    __fastunpack59(in, out);
+    break;
+  case 60:
+    __fastunpack60(in, out);
+    break;
+  case 61:
+    __fastunpack61(in, out);
+    break;
+  case 62:
+    __fastunpack62(in, out);
+    break;
+  case 63:
+    __fastunpack63(in, out);
+    break;
+  case 64:
+    __fastunpack64(in, out);
+    break;
+  default:
+    break;
+  }
+}
+
+inline void fastpack(const uint8_t *__restrict in, uint8_t *__restrict out, const uint32_t bit) {
+  for (uint8_t i = 0; i < 4; i++) {
+    fastpack_quarter(in+(i*8), out + (i*bit), bit);
+  }
+}
+
+// Compress all 32 values
+inline void fastpack(const uint16_t *__restrict in,
+                     uint16_t *__restrict out, const uint32_t bit) {
+  fastpack_half(in, out, bit);
+  fastpack_half(in+16, out + bit, bit);
+}
+
+inline void fastpack(const uint32_t *__restrict in,
+                     uint32_t *__restrict out, const uint32_t bit) {
+  // Could have used function pointers instead of switch.
+  // Switch calls do offer the compiler more opportunities for optimization in
+  // theory. In this case, it makes no difference with a good compiler.
+  switch (bit) {
+  case 0:
+    __fastpack0(in, out);
+    break;
+  case 1:
+    __fastpack1(in, out);
+    break;
+  case 2:
+    __fastpack2(in, out);
+    break;
+  case 3:
+    __fastpack3(in, out);
+    break;
+  case 4:
+    __fastpack4(in, out);
+    break;
+  case 5:
+    __fastpack5(in, out);
+    break;
+  case 6:
+    __fastpack6(in, out);
+    break;
+  case 7:
+    __fastpack7(in, out);
+    break;
+  case 8:
+    __fastpack8(in, out);
+    break;
+  case 9:
+    __fastpack9(in, out);
+    break;
+  case 10:
+    __fastpack10(in, out);
+    break;
+  case 11:
+    __fastpack11(in, out);
+    break;
+  case 12:
+    __fastpack12(in, out);
+    break;
+  case 13:
+    __fastpack13(in, out);
+    break;
+  case 14:
+    __fastpack14(in, out);
+    break;
+  case 15:
+    __fastpack15(in, out);
+    break;
+  case 16:
+    __fastpack16(in, out);
+    break;
+  case 17:
+    __fastpack17(in, out);
+    break;
+  case 18:
+    __fastpack18(in, out);
+    break;
+  case 19:
+    __fastpack19(in, out);
+    break;
+  case 20:
+    __fastpack20(in, out);
+    break;
+  case 21:
+    __fastpack21(in, out);
+    break;
+  case 22:
+    __fastpack22(in, out);
+    break;
+  case 23:
+    __fastpack23(in, out);
+    break;
+  case 24:
+    __fastpack24(in, out);
+    break;
+  case 25:
+    __fastpack25(in, out);
+    break;
+  case 26:
+    __fastpack26(in, out);
+    break;
+  case 27:
+    __fastpack27(in, out);
+    break;
+  case 28:
+    __fastpack28(in, out);
+    break;
+  case 29:
+    __fastpack29(in, out);
+    break;
+  case 30:
+    __fastpack30(in, out);
+    break;
+  case 31:
+    __fastpack31(in, out);
+    break;
+  case 32:
+    __fastpack32(in, out);
+    break;
+  default:
+    break;
+  }
+}
+
+inline void fastpack(const uint64_t *__restrict in,
+                     uint32_t *__restrict out, const uint32_t bit) {
+  switch (bit) {
+  case 0:
+    __fastpack0(in, out);
+    break;
+  case 1:
+    __fastpack1(in, out);
+    break;
+  case 2:
+    __fastpack2(in, out);
+    break;
+  case 3:
+    __fastpack3(in, out);
+    break;
+  case 4:
+    __fastpack4(in, out);
+    break;
+  case 5:
+    __fastpack5(in, out);
+    break;
+  case 6:
+    __fastpack6(in, out);
+    break;
+  case 7:
+    __fastpack7(in, out);
+    break;
+  case 8:
+    __fastpack8(in, out);
+    break;
+  case 9:
+    __fastpack9(in, out);
+    break;
+  case 10:
+    __fastpack10(in, out);
+    break;
+  case 11:
+    __fastpack11(in, out);
+    break;
+  case 12:
+    __fastpack12(in, out);
+    break;
+  case 13:
+    __fastpack13(in, out);
+    break;
+  case 14:
+    __fastpack14(in, out);
+    break;
+  case 15:
+    __fastpack15(in, out);
+    break;
+  case 16:
+    __fastpack16(in, out);
+    break;
+  case 17:
+    __fastpack17(in, out);
+    break;
+  case 18:
+    __fastpack18(in, out);
+    break;
+  case 19:
+    __fastpack19(in, out);
+    break;
+  case 20:
+    __fastpack20(in, out);
+    break;
+  case 21:
+    __fastpack21(in, out);
+    break;
+  case 22:
+    __fastpack22(in, out);
+    break;
+  case 23:
+    __fastpack23(in, out);
+    break;
+  case 24:
+    __fastpack24(in, out);
+    break;
+  case 25:
+    __fastpack25(in, out);
+    break;
+  case 26:
+    __fastpack26(in, out);
+    break;
+  case 27:
+    __fastpack27(in, out);
+    break;
+  case 28:
+    __fastpack28(in, out);
+    break;
+  case 29:
+    __fastpack29(in, out);
+    break;
+  case 30:
+    __fastpack30(in, out);
+    break;
+  case 31:
+    __fastpack31(in, out);
+    break;
+  case 32:
+    __fastpack32(in, out);
+    break;
+  case 33:
+    __fastpack33(in, out);
+    break;
+  case 34:
+    __fastpack34(in, out);
+    break;
+  case 35:
+    __fastpack35(in, out);
+    break;
+  case 36:
+    __fastpack36(in, out);
+    break;
+  case 37:
+    __fastpack37(in, out);
+    break;
+  case 38:
+    __fastpack38(in, out);
+    break;
+  case 39:
+    __fastpack39(in, out);
+    break;
+  case 40:
+    __fastpack40(in, out);
+    break;
+  case 41:
+    __fastpack41(in, out);
+    break;
+  case 42:
+    __fastpack42(in, out);
+    break;
+  case 43:
+    __fastpack43(in, out);
+    break;
+  case 44:
+    __fastpack44(in, out);
+    break;
+  case 45:
+    __fastpack45(in, out);
+    break;
+  case 46:
+    __fastpack46(in, out);
+    break;
+  case 47:
+    __fastpack47(in, out);
+    break;
+  case 48:
+    __fastpack48(in, out);
+    break;
+  case 49:
+    __fastpack49(in, out);
+    break;
+  case 50:
+    __fastpack50(in, out);
+    break;
+  case 51:
+    __fastpack51(in, out);
+    break;
+  case 52:
+    __fastpack52(in, out);
+    break;
+  case 53:
+    __fastpack53(in, out);
+    break;
+  case 54:
+    __fastpack54(in, out);
+    break;
+  case 55:
+    __fastpack55(in, out);
+    break;
+  case 56:
+    __fastpack56(in, out);
+    break;
+  case 57:
+    __fastpack57(in, out);
+    break;
+  case 58:
+    __fastpack58(in, out);
+    break;
+  case 59:
+    __fastpack59(in, out);
+    break;
+  case 60:
+    __fastpack60(in, out);
+    break;
+  case 61:
+    __fastpack61(in, out);
+    break;
+  case 62:
+    __fastpack62(in, out);
+    break;
+  case 63:
+    __fastpack63(in, out);
+    break;
+  case 64:
+    __fastpack64(in, out);
+    break;
+  default:
+    break;
+  }
+}
+
+/*assumes that integers fit in the prescribed number of bits*/
+inline void fastpackwithoutmask(const uint32_t *__restrict in,
+                                uint32_t *__restrict out,
+                                const uint32_t bit) {
+  // Could have used function pointers instead of switch.
+  // Switch calls do offer the compiler more opportunities for optimization in
+  // theory. In this case, it makes no difference with a good compiler.
+  switch (bit) {
+  case 0:
+    __fastpackwithoutmask0(in, out);
+    break;
+  case 1:
+    __fastpackwithoutmask1(in, out);
+    break;
+  case 2:
+    __fastpackwithoutmask2(in, out);
+    break;
+  case 3:
+    __fastpackwithoutmask3(in, out);
+    break;
+  case 4:
+    __fastpackwithoutmask4(in, out);
+    break;
+  case 5:
+    __fastpackwithoutmask5(in, out);
+    break;
+  case 6:
+    __fastpackwithoutmask6(in, out);
+    break;
+  case 7:
+    __fastpackwithoutmask7(in, out);
+    break;
+  case 8:
+    __fastpackwithoutmask8(in, out);
+    break;
+  case 9:
+    __fastpackwithoutmask9(in, out);
+    break;
+  case 10:
+    __fastpackwithoutmask10(in, out);
+    break;
+  case 11:
+    __fastpackwithoutmask11(in, out);
+    break;
+  case 12:
+    __fastpackwithoutmask12(in, out);
+    break;
+  case 13:
+    __fastpackwithoutmask13(in, out);
+    break;
+  case 14:
+    __fastpackwithoutmask14(in, out);
+    break;
+  case 15:
+    __fastpackwithoutmask15(in, out);
+    break;
+  case 16:
+    __fastpackwithoutmask16(in, out);
+    break;
+  case 17:
+    __fastpackwithoutmask17(in, out);
+    break;
+  case 18:
+    __fastpackwithoutmask18(in, out);
+    break;
+  case 19:
+    __fastpackwithoutmask19(in, out);
+    break;
+  case 20:
+    __fastpackwithoutmask20(in, out);
+    break;
+  case 21:
+    __fastpackwithoutmask21(in, out);
+    break;
+  case 22:
+    __fastpackwithoutmask22(in, out);
+    break;
+  case 23:
+    __fastpackwithoutmask23(in, out);
+    break;
+  case 24:
+    __fastpackwithoutmask24(in, out);
+    break;
+  case 25:
+    __fastpackwithoutmask25(in, out);
+    break;
+  case 26:
+    __fastpackwithoutmask26(in, out);
+    break;
+  case 27:
+    __fastpackwithoutmask27(in, out);
+    break;
+  case 28:
+    __fastpackwithoutmask28(in, out);
+    break;
+  case 29:
+    __fastpackwithoutmask29(in, out);
+    break;
+  case 30:
+    __fastpackwithoutmask30(in, out);
+    break;
+  case 31:
+    __fastpackwithoutmask31(in, out);
+    break;
+  case 32:
+    __fastpackwithoutmask32(in, out);
+    break;
+  default:
+    break;
+  }
+}
+
+inline void fastpackwithoutmask(const uint64_t *__restrict in,
+                                uint32_t *__restrict out,
+                                const uint32_t bit) {
+  switch (bit) {
+  case 0:
+    __fastpackwithoutmask0(in, out);
+    break;
+  case 1:
+    __fastpackwithoutmask1(in, out);
+    break;
+  case 2:
+    __fastpackwithoutmask2(in, out);
+    break;
+  case 3:
+    __fastpackwithoutmask3(in, out);
+    break;
+  case 4:
+    __fastpackwithoutmask4(in, out);
+    break;
+  case 5:
+    __fastpackwithoutmask5(in, out);
+    break;
+  case 6:
+    __fastpackwithoutmask6(in, out);
+    break;
+  case 7:
+    __fastpackwithoutmask7(in, out);
+    break;
+  case 8:
+    __fastpackwithoutmask8(in, out);
+    break;
+  case 9:
+    __fastpackwithoutmask9(in, out);
+    break;
+  case 10:
+    __fastpackwithoutmask10(in, out);
+    break;
+  case 11:
+    __fastpackwithoutmask11(in, out);
+    break;
+  case 12:
+    __fastpackwithoutmask12(in, out);
+    break;
+  case 13:
+    __fastpackwithoutmask13(in, out);
+    break;
+  case 14:
+    __fastpackwithoutmask14(in, out);
+    break;
+  case 15:
+    __fastpackwithoutmask15(in, out);
+    break;
+  case 16:
+    __fastpackwithoutmask16(in, out);
+    break;
+  case 17:
+    __fastpackwithoutmask17(in, out);
+    break;
+  case 18:
+    __fastpackwithoutmask18(in, out);
+    break;
+  case 19:
+    __fastpackwithoutmask19(in, out);
+    break;
+  case 20:
+    __fastpackwithoutmask20(in, out);
+    break;
+  case 21:
+    __fastpackwithoutmask21(in, out);
+    break;
+  case 22:
+    __fastpackwithoutmask22(in, out);
+    break;
+  case 23:
+    __fastpackwithoutmask23(in, out);
+    break;
+  case 24:
+    __fastpackwithoutmask24(in, out);
+    break;
+  case 25:
+    __fastpackwithoutmask25(in, out);
+    break;
+  case 26:
+    __fastpackwithoutmask26(in, out);
+    break;
+  case 27:
+    __fastpackwithoutmask27(in, out);
+    break;
+  case 28:
+    __fastpackwithoutmask28(in, out);
+    break;
+  case 29:
+    __fastpackwithoutmask29(in, out);
+    break;
+  case 30:
+    __fastpackwithoutmask30(in, out);
+    break;
+  case 31:
+    __fastpackwithoutmask31(in, out);
+    break;
+  case 32:
+    __fastpackwithoutmask32(in, out);
+    break;
+  case 33:
+    __fastpackwithoutmask33(in, out);
+    break;
+  case 34:
+    __fastpackwithoutmask34(in, out);
+    break;
+  case 35:
+    __fastpackwithoutmask35(in, out);
+    break;
+  case 36:
+    __fastpackwithoutmask36(in, out);
+    break;
+  case 37:
+    __fastpackwithoutmask37(in, out);
+    break;
+  case 38:
+    __fastpackwithoutmask38(in, out);
+    break;
+  case 39:
+    __fastpackwithoutmask39(in, out);
+    break;
+  case 40:
+    __fastpackwithoutmask40(in, out);
+    break;
+  case 41:
+    __fastpackwithoutmask41(in, out);
+    break;
+  case 42:
+    __fastpackwithoutmask42(in, out);
+    break;
+  case 43:
+    __fastpackwithoutmask43(in, out);
+    break;
+  case 44:
+    __fastpackwithoutmask44(in, out);
+    break;
+  case 45:
+    __fastpackwithoutmask45(in, out);
+    break;
+  case 46:
+    __fastpackwithoutmask46(in, out);
+    break;
+  case 47:
+    __fastpackwithoutmask47(in, out);
+    break;
+  case 48:
+    __fastpackwithoutmask48(in, out);
+    break;
+  case 49:
+    __fastpackwithoutmask49(in, out);
+    break;
+  case 50:
+    __fastpackwithoutmask50(in, out);
+    break;
+  case 51:
+    __fastpackwithoutmask51(in, out);
+    break;
+  case 52:
+    __fastpackwithoutmask52(in, out);
+    break;
+  case 53:
+    __fastpackwithoutmask53(in, out);
+    break;
+  case 54:
+    __fastpackwithoutmask54(in, out);
+    break;
+  case 55:
+    __fastpackwithoutmask55(in, out);
+    break;
+  case 56:
+    __fastpackwithoutmask56(in, out);
+    break;
+  case 57:
+    __fastpackwithoutmask57(in, out);
+    break;
+  case 58:
+    __fastpackwithoutmask58(in, out);
+    break;
+  case 59:
+    __fastpackwithoutmask59(in, out);
+    break;
+  case 60:
+    __fastpackwithoutmask60(in, out);
+    break;
+  case 61:
+    __fastpackwithoutmask61(in, out);
+    break;
+  case 62:
+    __fastpackwithoutmask62(in, out);
+    break;
+  case 63:
+    __fastpackwithoutmask63(in, out);
+    break;
+  case 64:
+    __fastpackwithoutmask64(in, out);
+    break;
+  default:
+    break;
+  }
+}
+
+template <uint32_t BlockSize, typename IntType = uint32_t>
+uint32_t *packblockup(const IntType * source, uint32_t *out,
+                      const uint32_t bit) {
+  for (uint32_t j = 0; j != BlockSize; j += 32) {
+    fastpack(source + j, out, bit);
+    out += bit;
+  }
+  return out;
+}
+
+template <uint32_t BlockSize, typename IntType = uint32_t>
+const uint32_t *unpackblock(const uint32_t *source, IntType *out,
+                            const uint32_t bit) {
+  for (uint32_t j = 0; j != BlockSize; j += 32) {
+    fastunpack(source, out + j, bit);
+    source += bit;
+  }
+  return source;
+}
+
+} // namespace FastPForLib
+
+#endif /* BITPACKINGHELPERS_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/common.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/common.h
new file mode 100644
index 0000000000..2ac0dcb61e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/fastpfor/fastpfor/common.h
@@ -0,0 +1,14 @@
+/**
+ * This code is released under the
+ * Apache License Version 2.0 http://www.apache.org/licenses/.
+ *
+ * (c) Daniel Lemire, http://lemire.me/en/
+ */
+#ifndef COMMON_H_
+#define COMMON_H_
+
+#include <cstdint>
+#include <string.h>
+#include <stdexcept>
+
+#endif /* COMMON_H_ */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/glob/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/glob/CMakeLists.txt
new file mode 100644
index 0000000000..d4e77fa840
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/glob/CMakeLists.txt
@@ -0,0 +1,3 @@
+add_library(Glob INTERFACE)
+
+target_include_directories(Glob INTERFACE ${CMAKE_CURRENT_SOURCE_DIR})
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/glob/glob/glob.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/glob/glob/glob.hpp
new file mode 100644
index 0000000000..e1a3ee8b08
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/glob/glob/glob.hpp
@@ -0,0 +1,449 @@
+/*
+  From https://github.com/p-ranav/glob
+  Single header version
+  Commit 8cd16218ae648addf166977d7e41b914768bcb05
+  With commit 615c56cc2c59e5521ab8f20c3695e8fea92f669f reverted (broke tilde expansion)
+
+  MIT License
+
+  Copyright (c) 2019 Pranav
+
+  Permission is hereby granted, free of charge, to any person obtaining a copy
+  of this software and associated documentation files (the "Software"), to deal
+  in the Software without restriction, including without limitation the rights
+  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the Software is
+  furnished to do so, subject to the following conditions:
+
+  The above copyright notice and this permission notice shall be included in all
+  copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+  SOFTWARE.
+*/
+
+
+#pragma once
+#include <cassert>
+#include <functional>
+#include <iostream>
+#include <map>
+#include <regex>
+#include <string>
+#include <vector>
+
+#ifdef GLOB_USE_GHC_FILESYSTEM
+#include <ghc/filesystem.hpp>
+#else
+#include <filesystem>
+#endif
+
+#include "re2.h"
+
+namespace glob {
+
+#ifdef GLOB_USE_GHC_FILESYSTEM
+namespace fs = ghc::filesystem;
+#else
+namespace fs = std::filesystem;
+#endif
+
+namespace {
+
+static inline 
+bool string_replace(std::string &str, const std::string &from, const std::string &to) {
+  std::size_t start_pos = str.find(from);
+  if (start_pos == std::string::npos)
+    return false;
+  str.replace(start_pos, from.length(), to);
+  return true;
+}
+
+static inline 
+std::string translate(const std::string &pattern) {
+  std::size_t i = 0, n = pattern.size();
+  std::string result_string;
+
+  while (i < n) {
+    auto c = pattern[i];
+    i += 1;
+    if (c == '*') {
+      result_string += ".*";
+    } else if (c == '?') {
+      result_string += ".";
+    } else if (c == '[') {
+      auto j = i;
+      if (j < n && pattern[j] == '!') {
+        j += 1;
+      }
+      if (j < n && pattern[j] == ']') {
+        j += 1;
+      }
+      while (j < n && pattern[j] != ']') {
+        j += 1;
+      }
+      if (j >= n) {
+        result_string += "\\[";
+      } else {
+        auto stuff = std::string(pattern.begin() + i, pattern.begin() + j);
+        if (stuff.find("--") == std::string::npos) {
+          string_replace(stuff, std::string{"\\"}, std::string{R"(\\)"});
+        } else {
+          std::vector<std::string> chunks;
+          std::size_t k = 0;
+          if (pattern[i] == '!') {
+            k = i + 2;
+          } else {
+            k = i + 1;
+          }
+
+          while (true) {
+            k = pattern.find("-", k, j);
+            if (k == std::string::npos) {
+              break;
+            }
+            chunks.push_back(std::string(pattern.begin() + i, pattern.begin() + k));
+            i = k + 1;
+            k = k + 3;
+          }
+
+          chunks.push_back(std::string(pattern.begin() + i, pattern.begin() + j));
+          // Escape backslashes and hyphens for set difference (--).
+          // Hyphens that create ranges shouldn't be escaped.
+          bool first = false;
+          for (auto &s : chunks) {
+            string_replace(s, std::string{"\\"}, std::string{R"(\\)"});
+            string_replace(s, std::string{"-"}, std::string{R"(\-)"});
+            if (first) {
+              stuff += s;
+              first = false;
+            } else {
+              stuff += "-" + s;
+            }
+          }
+        }
+
+        // Escape set operations (&&, ~~ and ||).
+        std::string result;
+        for (const auto& i: stuff) {
+          if (i == '&' || i == '~' || i == '|') {
+            result.push_back('\\');
+          }
+          result.push_back(i);
+        }
+        stuff = result;
+        i = j + 1;
+        if (stuff[0] == '!') {
+          stuff = "^" + std::string(stuff.begin() + 1, stuff.end());
+        } else if (stuff[0] == '^' || stuff[0] == '[') {
+          stuff = "\\\\" + stuff;
+        }
+        result_string = result_string + "[" + stuff + "]";
+      }
+    } else {
+      // SPECIAL_CHARS
+      // closing ')', '}' and ']'
+      // '-' (a range in character set)
+      // '&', '~', (extended character set operations)
+      // '#' (comment) and WHITESPACE (ignored) in verbose mode
+      static std::string special_characters = "()[]{}?*+-|^$\\.&~# \t\n\r\v\f";
+      static std::map<int, std::string> special_characters_map;
+      if (special_characters_map.empty()) {
+        for (auto &sc : special_characters) {
+          special_characters_map.insert(
+              std::make_pair(static_cast<int>(sc), std::string{"\\"} + std::string(1, sc)));
+        }
+      }
+
+      if (special_characters.find(c) != std::string::npos) {
+        result_string += special_characters_map[static_cast<int>(c)];
+      } else {
+        result_string += c;
+      }
+    }
+  }
+  return std::string{"(("} + result_string + std::string{R"()|[\r\n])$)"};
+}
+
+static inline 
+bool fnmatch(const fs::path &name, const std::string &pattern) {
+  return RE2::FullMatch(name.string(), translate(pattern));
+}
+
+static inline 
+std::vector<fs::path> filter(const std::vector<fs::path> &names,
+                             const std::string &pattern) {
+  // std::cout << "Pattern: " << pattern << "\n";
+  std::vector<fs::path> result;
+  for (auto &name : names) {
+    // std::cout << "Checking for " << name.string() << "\n";
+    if (fnmatch(name, pattern)) {
+      result.push_back(name);
+    }
+  }
+  return result;
+}
+
+static inline 
+fs::path expand_tilde(fs::path path) {
+  if (path.empty()) return path;
+#ifdef _WIN32
+  char* home;
+  size_t sz;
+  _dupenv_s(&home, &sz, "USERPROFILE");
+#else
+  const char * home = std::getenv("HOME");
+#endif
+  if (home == nullptr) {
+    throw std::invalid_argument("error: Unable to expand `~` - HOME environment variable not set.");
+  }
+
+  std::string s = path.string();
+  if (s[0] == '~') {
+    s = std::string(home) + s.substr(1, s.size() - 1);
+    return fs::path(s);
+  } else {
+    return path;
+  }
+}
+
+static inline 
+bool has_magic(const std::string &pathname) {
+  static const auto magic_check = RE2("([*?[])");
+  return RE2::PartialMatch(pathname, magic_check);
+}
+
+static inline 
+bool is_hidden(const std::string &pathname) {
+  static const auto check = RE2("^(.*\\/)*\\.[^\\.\\/]+\\/*$");
+  return RE2::FullMatch(pathname, check);
+}
+
+static inline 
+bool is_recursive(const std::string &pattern) { return pattern == "**"; }
+
+static inline 
+std::vector<fs::path> iter_directory(const fs::path &dirname, bool dironly) {
+  std::vector<fs::path> result;
+
+  auto current_directory = dirname;
+  if (current_directory.empty()) {
+    current_directory = fs::current_path();
+  }
+
+  if (fs::exists(current_directory)) {
+    try {
+      for (auto &entry : fs::directory_iterator(
+              current_directory, fs::directory_options::follow_directory_symlink |
+                                      fs::directory_options::skip_permission_denied)) {
+        if (!dironly || entry.is_directory()) {
+          if (dirname.is_absolute()) {
+            result.push_back(entry.path());
+          } else {
+            result.push_back(fs::relative(entry.path()));
+          }
+        }
+      }
+    } catch (std::exception&) {
+      // not a directory
+      // do nothing
+    }
+  }
+
+  return result;
+}
+
+// Recursively yields relative pathnames inside a literal directory.
+static inline 
+std::vector<fs::path> rlistdir(const fs::path &dirname, bool dironly) {
+  std::vector<fs::path> result;
+  auto names = iter_directory(dirname, dironly);
+  for (auto &x : names) {
+    if (!is_hidden(x.string())) {
+      result.push_back(x);
+      for (auto &y : rlistdir(x, dironly)) {
+        result.push_back(y);
+      }
+    }
+  }
+  return result;
+}
+
+// This helper function recursively yields relative pathnames inside a literal
+// directory.
+static inline 
+std::vector<fs::path> glob2(const fs::path &dirname, [[maybe_unused]] const std::string &pattern,
+                            bool dironly) {
+  // std::cout << "In glob2\n";
+  std::vector<fs::path> result;
+  assert(is_recursive(pattern));
+  for (auto &dir : rlistdir(dirname, dironly)) {
+    result.push_back(dir);
+  }
+  return result;
+}
+
+// These 2 helper functions non-recursively glob inside a literal directory.
+// They return a list of basenames.  _glob1 accepts a pattern while _glob0
+// takes a literal basename (so it only has to check for its existence).
+static inline 
+std::vector<fs::path> glob1(const fs::path &dirname, const std::string &pattern,
+                            bool dironly) {
+  // std::cout << "In glob1\n";
+  auto names = iter_directory(dirname, dironly);
+  std::vector<fs::path> filtered_names;
+  for (auto &n : names) {
+    if (!is_hidden(n.string())) {
+      filtered_names.push_back(n.filename());
+      // if (n.is_relative()) {
+      //   // std::cout << "Filtered (Relative): " << n << "\n";
+      //   filtered_names.push_back(fs::relative(n));
+      // } else {
+      //   // std::cout << "Filtered (Absolute): " << n << "\n";
+      //   filtered_names.push_back(n.filename());
+      // }
+    }
+  }
+  return filter(filtered_names, pattern);
+}
+
+static inline 
+std::vector<fs::path> glob0(const fs::path &dirname, const fs::path &basename,
+                            bool /*dironly*/) {
+  // std::cout << "In glob0\n";
+  std::vector<fs::path> result;
+  if (basename.empty()) {
+    // 'q*x/' should match only directories.
+    if (fs::is_directory(dirname)) {
+      result = {basename};
+    }
+  } else {
+    if (fs::exists(dirname / basename)) {
+      result = {basename};
+    }
+  }
+  return result;
+}
+
+static inline 
+std::vector<fs::path> glob(const std::string &pathname, bool recursive = false,
+                           bool dironly = false) {
+  std::vector<fs::path> result;
+
+  auto path = fs::path(pathname);
+
+  if (pathname[0] == '~') {
+    // expand tilde
+    path = expand_tilde(path);
+  }
+
+  auto dirname = path.parent_path();
+  const auto basename = path.filename();
+
+  if (!has_magic(pathname)) {
+    assert(!dironly);
+    if (!basename.empty()) {
+      if (fs::exists(path)) {
+        result.push_back(path);
+      }
+    } else {
+      // Patterns ending with a slash should match only directories
+      if (fs::is_directory(dirname)) {
+        result.push_back(path);
+      }
+    }
+    return result;
+  }
+
+  if (dirname.empty()) {
+    if (recursive && is_recursive(basename.string())) {
+      return glob2(dirname, basename.string(), dironly);
+    } else {
+      return glob1(dirname, basename.string(), dironly);
+    }
+  }
+
+  std::vector<fs::path> dirs;
+  if (dirname != fs::path(pathname) && has_magic(dirname.string())) {
+    dirs = glob(dirname.string(), recursive, true);
+  } else {
+    dirs = {dirname};
+  }
+
+  std::function<std::vector<fs::path>(const fs::path &, const std::string &, bool)>
+      glob_in_dir;
+  if (has_magic(basename.string())) {
+    if (recursive && is_recursive(basename.string())) {
+      glob_in_dir = glob2;
+    } else {
+      glob_in_dir = glob1;
+    }
+  } else {
+    glob_in_dir = glob0;
+  }
+
+  for (auto &d : dirs) {
+    for (auto &name : glob_in_dir(d, basename.string(), dironly)) {
+      fs::path subresult = name;
+      if (name.parent_path().empty()) {
+        subresult = d / name;
+      }
+      result.push_back(subresult);
+    }
+  }
+
+  return result;
+}
+
+} // namespace end
+
+static inline 
+std::vector<fs::path> glob(const std::string &pathname) {
+  return glob(pathname, false);
+}
+
+static inline 
+std::vector<fs::path> rglob(const std::string &pathname) {
+  return glob(pathname, true);
+}
+
+static inline 
+std::vector<fs::path> glob(const std::vector<std::string> &pathnames) {
+  std::vector<fs::path> result;
+  for (auto &pathname : pathnames) {
+    for (auto &match : glob(pathname, false)) {
+      result.push_back(std::move(match));
+    }
+  }
+  return result;
+}
+
+static inline 
+std::vector<fs::path> rglob(const std::vector<std::string> &pathnames) {
+  std::vector<fs::path> result;
+  for (auto &pathname : pathnames) {
+    for (auto &match : glob(pathname, true)) {
+      result.push_back(std::move(match));
+    }
+  }
+  return result;
+}
+
+static inline 
+std::vector<fs::path>
+glob(const std::initializer_list<std::string> &pathnames) {
+  return glob(std::vector<std::string>(pathnames));
+}
+
+static inline 
+std::vector<fs::path>
+rglob(const std::initializer_list<std::string> &pathnames) {
+  return rglob(std::vector<std::string>(pathnames));
+}
+
+} // namespace glob
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/httplib/httplib.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/httplib/httplib.h
new file mode 100644
index 0000000000..c534f84948
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/httplib/httplib.h
@@ -0,0 +1,9374 @@
+//
+//  httplib.h
+//
+//  Copyright (c) 2023 Yuji Hirose. All rights reserved.
+//  MIT License
+//
+
+#ifndef CPPHTTPLIB_HTTPLIB_H
+#define CPPHTTPLIB_HTTPLIB_H
+
+#define CPPHTTPLIB_VERSION "0.14.2"
+
+/*
+ * Configuration
+ */
+
+#ifndef CPPHTTPLIB_KEEPALIVE_TIMEOUT_SECOND
+#define CPPHTTPLIB_KEEPALIVE_TIMEOUT_SECOND 5
+#endif
+
+#ifndef CPPHTTPLIB_KEEPALIVE_MAX_COUNT
+#define CPPHTTPLIB_KEEPALIVE_MAX_COUNT 5
+#endif
+
+#ifndef CPPHTTPLIB_CONNECTION_TIMEOUT_SECOND
+#define CPPHTTPLIB_CONNECTION_TIMEOUT_SECOND 300
+#endif
+
+#ifndef CPPHTTPLIB_CONNECTION_TIMEOUT_USECOND
+#define CPPHTTPLIB_CONNECTION_TIMEOUT_USECOND 0
+#endif
+
+#ifndef CPPHTTPLIB_READ_TIMEOUT_SECOND
+#define CPPHTTPLIB_READ_TIMEOUT_SECOND 5
+#endif
+
+#ifndef CPPHTTPLIB_READ_TIMEOUT_USECOND
+#define CPPHTTPLIB_READ_TIMEOUT_USECOND 0
+#endif
+
+#ifndef CPPHTTPLIB_WRITE_TIMEOUT_SECOND
+#define CPPHTTPLIB_WRITE_TIMEOUT_SECOND 5
+#endif
+
+#ifndef CPPHTTPLIB_WRITE_TIMEOUT_USECOND
+#define CPPHTTPLIB_WRITE_TIMEOUT_USECOND 0
+#endif
+
+#ifndef CPPHTTPLIB_IDLE_INTERVAL_SECOND
+#define CPPHTTPLIB_IDLE_INTERVAL_SECOND 0
+#endif
+
+#ifndef CPPHTTPLIB_IDLE_INTERVAL_USECOND
+#ifdef _WIN32
+#define CPPHTTPLIB_IDLE_INTERVAL_USECOND 10000
+#else
+#define CPPHTTPLIB_IDLE_INTERVAL_USECOND 0
+#endif
+#endif
+
+#ifndef CPPHTTPLIB_REQUEST_URI_MAX_LENGTH
+#define CPPHTTPLIB_REQUEST_URI_MAX_LENGTH 8192
+#endif
+
+#ifndef CPPHTTPLIB_HEADER_MAX_LENGTH
+#define CPPHTTPLIB_HEADER_MAX_LENGTH 8192
+#endif
+
+#ifndef CPPHTTPLIB_REDIRECT_MAX_COUNT
+#define CPPHTTPLIB_REDIRECT_MAX_COUNT 20
+#endif
+
+#ifndef CPPHTTPLIB_MULTIPART_FORM_DATA_FILE_MAX_COUNT
+#define CPPHTTPLIB_MULTIPART_FORM_DATA_FILE_MAX_COUNT 1024
+#endif
+
+#ifndef CPPHTTPLIB_PAYLOAD_MAX_LENGTH
+#define CPPHTTPLIB_PAYLOAD_MAX_LENGTH ((std::numeric_limits<size_t>::max)())
+#endif
+
+#ifndef CPPHTTPLIB_FORM_URL_ENCODED_PAYLOAD_MAX_LENGTH
+#define CPPHTTPLIB_FORM_URL_ENCODED_PAYLOAD_MAX_LENGTH 8192
+#endif
+
+#ifndef CPPHTTPLIB_TCP_NODELAY
+#define CPPHTTPLIB_TCP_NODELAY false
+#endif
+
+#ifndef CPPHTTPLIB_RECV_BUFSIZ
+#define CPPHTTPLIB_RECV_BUFSIZ size_t(4096u)
+#endif
+
+#ifndef CPPHTTPLIB_COMPRESSION_BUFSIZ
+#define CPPHTTPLIB_COMPRESSION_BUFSIZ size_t(16384u)
+#endif
+
+#ifndef CPPHTTPLIB_THREAD_POOL_COUNT
+#define CPPHTTPLIB_THREAD_POOL_COUNT                                           \
+  ((std::max)(8u, std::thread::hardware_concurrency() > 0                      \
+                      ? std::thread::hardware_concurrency() - 1                \
+                      : 0))
+#endif
+
+#ifndef CPPHTTPLIB_RECV_FLAGS
+#define CPPHTTPLIB_RECV_FLAGS 0
+#endif
+
+#ifndef CPPHTTPLIB_SEND_FLAGS
+#define CPPHTTPLIB_SEND_FLAGS 0
+#endif
+
+#ifndef CPPHTTPLIB_LISTEN_BACKLOG
+#define CPPHTTPLIB_LISTEN_BACKLOG 5
+#endif
+
+/*
+ * Headers
+ */
+
+#ifdef _WIN32
+#ifndef _CRT_SECURE_NO_WARNINGS
+#define _CRT_SECURE_NO_WARNINGS
+#endif //_CRT_SECURE_NO_WARNINGS
+
+#ifndef _CRT_NONSTDC_NO_DEPRECATE
+#define _CRT_NONSTDC_NO_DEPRECATE
+#endif //_CRT_NONSTDC_NO_DEPRECATE
+
+#if defined(_MSC_VER)
+#if _MSC_VER < 1900
+#error Sorry, Visual Studio versions prior to 2015 are not supported
+#endif
+
+#pragma comment(lib, "ws2_32.lib")
+
+#ifdef _WIN64
+using ssize_t = __int64;
+#else
+using ssize_t = long;
+#endif
+#endif // _MSC_VER
+
+#ifndef S_ISREG
+#define S_ISREG(m) (((m) & S_IFREG) == S_IFREG)
+#endif // S_ISREG
+
+#ifndef S_ISDIR
+#define S_ISDIR(m) (((m) & S_IFDIR) == S_IFDIR)
+#endif // S_ISDIR
+
+#ifndef NOMINMAX
+#define NOMINMAX
+#endif // NOMINMAX
+
+#include <io.h>
+#include <winsock2.h>
+#include <ws2tcpip.h>
+
+#ifndef WSA_FLAG_NO_HANDLE_INHERIT
+#define WSA_FLAG_NO_HANDLE_INHERIT 0x80
+#endif
+
+#ifndef strcasecmp
+#define strcasecmp _stricmp
+#endif // strcasecmp
+
+using socket_t = SOCKET;
+#ifdef CPPHTTPLIB_USE_POLL
+#define poll(fds, nfds, timeout) WSAPoll(fds, nfds, timeout)
+#endif
+
+#else // not _WIN32
+
+#include <arpa/inet.h>
+#if !defined(_AIX) && !defined(__MVS__)
+#include <ifaddrs.h>
+#endif
+#ifdef __MVS__
+#include <strings.h>
+#ifndef NI_MAXHOST
+#define NI_MAXHOST 1025
+#endif
+#endif
+#include <net/if.h>
+#include <netdb.h>
+#include <netinet/in.h>
+#ifdef __linux__
+#include <resolv.h>
+#endif
+#include <netinet/tcp.h>
+#ifdef CPPHTTPLIB_USE_POLL
+#include <poll.h>
+#endif
+#include <csignal>
+#include <pthread.h>
+#include <sys/mman.h>
+#include <sys/select.h>
+#include <sys/socket.h>
+#include <sys/un.h>
+#include <unistd.h>
+
+using socket_t = int;
+#ifndef INVALID_SOCKET
+#define INVALID_SOCKET (-1)
+#endif
+#endif //_WIN32
+
+#include <algorithm>
+#include <array>
+#include <atomic>
+#include <cassert>
+#include <cctype>
+#include <climits>
+#include <condition_variable>
+#include <cstring>
+#include <errno.h>
+#include <fcntl.h>
+#include <fstream>
+#include <functional>
+#include <iomanip>
+#include <iostream>
+#include <list>
+#include <map>
+#include <memory>
+#include <mutex>
+#include <random>
+#include <regex>
+#include <set>
+#include <sstream>
+#include <string>
+#include <sys/stat.h>
+#include <thread>
+#include <unordered_map>
+#include <unordered_set>
+#include <utility>
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+#ifdef _WIN32
+#include <wincrypt.h>
+
+// these are defined in wincrypt.h and it breaks compilation if BoringSSL is
+// used
+#undef X509_NAME
+#undef X509_CERT_PAIR
+#undef X509_EXTENSIONS
+#undef PKCS7_SIGNER_INFO
+
+#ifdef _MSC_VER
+#pragma comment(lib, "crypt32.lib")
+#endif
+#elif defined(CPPHTTPLIB_USE_CERTS_FROM_MACOSX_KEYCHAIN) && defined(__APPLE__)
+#include <TargetConditionals.h>
+#if TARGET_OS_OSX
+#include <CoreFoundation/CoreFoundation.h>
+#include <Security/Security.h>
+#endif // TARGET_OS_OSX
+#endif // _WIN32
+
+#include <openssl/err.h>
+#include <openssl/evp.h>
+#include <openssl/ssl.h>
+#include <openssl/x509v3.h>
+
+#if defined(_WIN32) && defined(OPENSSL_USE_APPLINK)
+#include <openssl/applink.c>
+#endif
+
+#include <iostream>
+#include <sstream>
+
+#if OPENSSL_VERSION_NUMBER < 0x1010100fL
+#error Sorry, OpenSSL versions prior to 1.1.1 are not supported
+#elif OPENSSL_VERSION_NUMBER < 0x30000000L
+#define SSL_get1_peer_certificate SSL_get_peer_certificate
+#endif
+
+#endif
+
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+#include <zlib.h>
+#endif
+
+#ifdef CPPHTTPLIB_BROTLI_SUPPORT
+#include <brotli/decode.h>
+#include <brotli/encode.h>
+#endif
+
+/*
+ * Declaration
+ */
+namespace httplib {
+
+namespace detail {
+
+/*
+ * Backport std::make_unique from C++14.
+ *
+ * NOTE: This code came up with the following stackoverflow post:
+ * https://stackoverflow.com/questions/10149840/c-arrays-and-make-unique
+ *
+ */
+
+template <class T, class... Args>
+typename std::enable_if<!std::is_array<T>::value, std::unique_ptr<T>>::type
+make_unique(Args &&...args) {
+    return std::unique_ptr<T>(new T(std::forward<Args>(args)...));
+}
+
+template <class T>
+typename std::enable_if<std::is_array<T>::value, std::unique_ptr<T>>::type
+make_unique(std::size_t n) {
+    typedef typename std::remove_extent<T>::type RT;
+    return std::unique_ptr<T>(new RT[n]);
+}
+
+struct ci {
+    bool operator()(const std::string &s1, const std::string &s2) const {
+        return std::lexicographical_compare(s1.begin(), s1.end(), s2.begin(),
+            s2.end(),
+            [](unsigned char c1, unsigned char c2) {
+                return ::tolower(c1) < ::tolower(c2);
+            });
+    }
+};
+
+// This is based on
+// "http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4189".
+
+struct scope_exit {
+    explicit scope_exit(std::function<void(void)> &&f)
+        : exit_function(std::move(f)), execute_on_destruction{true} {}
+
+    scope_exit(scope_exit &&rhs) noexcept
+        : exit_function(std::move(rhs.exit_function)),
+          execute_on_destruction{rhs.execute_on_destruction} {
+        rhs.release();
+    }
+
+    ~scope_exit() {
+        if (execute_on_destruction) { this->exit_function(); }
+    }
+
+    void release() { this->execute_on_destruction = false; }
+
+private:
+    scope_exit(const scope_exit &) = delete;
+    void operator=(const scope_exit &) = delete;
+    scope_exit &operator=(scope_exit &&) = delete;
+
+    std::function<void(void)> exit_function;
+    bool execute_on_destruction;
+};
+
+} // namespace detail
+
+enum StatusCode {
+    // Information responses
+    Continue_100 = 100,
+    SwitchingProtocol_101 = 101,
+    Processing_102 = 102,
+    EarlyHints_103 = 103,
+
+    // Successful responses
+    OK_200 = 200,
+    Created_201 = 201,
+    Accepted_202 = 202,
+    NonAuthoritativeInformation_203 = 203,
+    NoContent_204 = 204,
+    ResetContent_205 = 205,
+    PartialContent_206 = 206,
+    MultiStatus_207 = 207,
+    AlreadyReported_208 = 208,
+    IMUsed_226 = 226,
+
+    // Redirection messages
+    MultipleChoices_300 = 300,
+    MovedPermanently_301 = 301,
+    Found_302 = 302,
+    SeeOther_303 = 303,
+    NotModified_304 = 304,
+    UseProxy_305 = 305,
+    unused_306 = 306,
+    TemporaryRedirect_307 = 307,
+    PermanentRedirect_308 = 308,
+
+    // Client error responses
+    BadRequest_400 = 400,
+    Unauthorized_401 = 401,
+    PaymentRequired_402 = 402,
+    Forbidden_403 = 403,
+    NotFound_404 = 404,
+    MethodNotAllowed_405 = 405,
+    NotAcceptable_406 = 406,
+    ProxyAuthenticationRequired_407 = 407,
+    RequestTimeout_408 = 408,
+    Conflict_409 = 409,
+    Gone_410 = 410,
+    LengthRequired_411 = 411,
+    PreconditionFailed_412 = 412,
+    PayloadTooLarge_413 = 413,
+    UriTooLong_414 = 414,
+    UnsupportedMediaType_415 = 415,
+    RangeNotSatisfiable_416 = 416,
+    ExpectationFailed_417 = 417,
+    ImATeapot_418 = 418,
+    MisdirectedRequest_421 = 421,
+    UnprocessableContent_422 = 422,
+    Locked_423 = 423,
+    FailedDependency_424 = 424,
+    TooEarly_425 = 425,
+    UpgradeRequired_426 = 426,
+    PreconditionRequired_428 = 428,
+    TooManyRequests_429 = 429,
+    RequestHeaderFieldsTooLarge_431 = 431,
+    UnavailableForLegalReasons_451 = 451,
+
+    // Server error responses
+    InternalServerError_500 = 500,
+    NotImplemented_501 = 501,
+    BadGateway_502 = 502,
+    ServiceUnavailable_503 = 503,
+    GatewayTimeout_504 = 504,
+    HttpVersionNotSupported_505 = 505,
+    VariantAlsoNegotiates_506 = 506,
+    InsufficientStorage_507 = 507,
+    LoopDetected_508 = 508,
+    NotExtended_510 = 510,
+    NetworkAuthenticationRequired_511 = 511,
+};
+
+using Headers = std::multimap<std::string, std::string, detail::ci>;
+
+using Params = std::multimap<std::string, std::string>;
+using Match = std::smatch;
+
+using Progress = std::function<bool(uint64_t current, uint64_t total)>;
+
+struct Response;
+using ResponseHandler = std::function<bool(const Response &response)>;
+
+struct MultipartFormData {
+    std::string name;
+    std::string content;
+    std::string filename;
+    std::string content_type;
+};
+using MultipartFormDataItems = std::vector<MultipartFormData>;
+using MultipartFormDataMap = std::multimap<std::string, MultipartFormData>;
+
+class DataSink {
+public:
+    DataSink() : os(&sb_), sb_(*this) {}
+
+    DataSink(const DataSink &) = delete;
+    DataSink &operator=(const DataSink &) = delete;
+    DataSink(DataSink &&) = delete;
+    DataSink &operator=(DataSink &&) = delete;
+
+    std::function<bool(const char *data, size_t data_len)> write;
+    std::function<bool()> is_writable;
+    std::function<void()> done;
+    std::function<void(const Headers &trailer)> done_with_trailer;
+    std::ostream os;
+
+private:
+    class data_sink_streambuf : public std::streambuf {
+    public:
+        explicit data_sink_streambuf(DataSink &sink) : sink_(sink) {}
+
+    protected:
+        std::streamsize xsputn(const char *s, std::streamsize n) override {
+            sink_.write(s, static_cast<size_t>(n));
+            return n;
+        }
+
+    private:
+        DataSink &sink_;
+    };
+
+    data_sink_streambuf sb_;
+};
+
+using ContentProvider =
+    std::function<bool(size_t offset, size_t length, DataSink &sink)>;
+
+using ContentProviderWithoutLength =
+    std::function<bool(size_t offset, DataSink &sink)>;
+
+using ContentProviderResourceReleaser = std::function<void(bool success)>;
+
+struct MultipartFormDataProvider {
+    std::string name;
+    ContentProviderWithoutLength provider;
+    std::string filename;
+    std::string content_type;
+};
+using MultipartFormDataProviderItems = std::vector<MultipartFormDataProvider>;
+
+using ContentReceiverWithProgress =
+    std::function<bool(const char *data, size_t data_length, uint64_t offset,
+        uint64_t total_length)>;
+
+using ContentReceiver =
+    std::function<bool(const char *data, size_t data_length)>;
+
+using MultipartContentHeader =
+    std::function<bool(const MultipartFormData &file)>;
+
+class ContentReader {
+public:
+    using Reader = std::function<bool(ContentReceiver receiver)>;
+    using MultipartReader = std::function<bool(MultipartContentHeader header,
+        ContentReceiver receiver)>;
+
+    ContentReader(Reader reader, MultipartReader multipart_reader)
+        : reader_(std::move(reader)),
+          multipart_reader_(std::move(multipart_reader)) {}
+
+    bool operator()(MultipartContentHeader header,
+        ContentReceiver receiver) const {
+        return multipart_reader_(std::move(header), std::move(receiver));
+    }
+
+    bool operator()(ContentReceiver receiver) const {
+        return reader_(std::move(receiver));
+    }
+
+    Reader reader_;
+    MultipartReader multipart_reader_;
+};
+
+using Range = std::pair<ssize_t, ssize_t>;
+using Ranges = std::vector<Range>;
+
+struct Request {
+    std::string method;
+    std::string path;
+    Headers headers;
+    std::string body;
+
+    std::string remote_addr;
+    int remote_port = -1;
+    std::string local_addr;
+    int local_port = -1;
+
+    // for server
+    std::string version;
+    std::string target;
+    Params params;
+    MultipartFormDataMap files;
+    Ranges ranges;
+    Match matches;
+    std::unordered_map<std::string, std::string> path_params;
+
+    // for client
+    ResponseHandler response_handler;
+    ContentReceiverWithProgress content_receiver;
+    Progress progress;
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    const SSL *ssl = nullptr;
+#endif
+
+    bool has_header(const std::string &key) const;
+    std::string get_header_value(const std::string &key, size_t id = 0) const;
+    uint64_t get_header_value_u64(const std::string &key, size_t id = 0) const;
+    size_t get_header_value_count(const std::string &key) const;
+    void set_header(const std::string &key, const std::string &val);
+
+    bool has_param(const std::string &key) const;
+    std::string get_param_value(const std::string &key, size_t id = 0) const;
+    size_t get_param_value_count(const std::string &key) const;
+
+    bool is_multipart_form_data() const;
+
+    bool has_file(const std::string &key) const;
+    MultipartFormData get_file_value(const std::string &key) const;
+    std::vector<MultipartFormData> get_file_values(const std::string &key) const;
+
+    // private members...
+    size_t redirect_count_ = CPPHTTPLIB_REDIRECT_MAX_COUNT;
+    size_t content_length_ = 0;
+    ContentProvider content_provider_;
+    bool is_chunked_content_provider_ = false;
+    size_t authorization_count_ = 0;
+};
+
+struct Response {
+    std::string version;
+    int status = -1;
+    std::string reason;
+    Headers headers;
+    std::string body;
+    std::string location; // Redirect location
+
+    bool has_header(const std::string &key) const;
+    std::string get_header_value(const std::string &key, size_t id = 0) const;
+    uint64_t get_header_value_u64(const std::string &key, size_t id = 0) const;
+    size_t get_header_value_count(const std::string &key) const;
+    void set_header(const std::string &key, const std::string &val);
+
+    void set_redirect(const std::string &url, int status = StatusCode::Found_302);
+    void set_content(const char *s, size_t n, const std::string &content_type);
+    void set_content(const std::string &s, const std::string &content_type);
+
+    void set_content_provider(
+        size_t length, const std::string &content_type, ContentProvider provider,
+        ContentProviderResourceReleaser resource_releaser = nullptr);
+
+    void set_content_provider(
+        const std::string &content_type, ContentProviderWithoutLength provider,
+        ContentProviderResourceReleaser resource_releaser = nullptr);
+
+    void set_chunked_content_provider(
+        const std::string &content_type, ContentProviderWithoutLength provider,
+        ContentProviderResourceReleaser resource_releaser = nullptr);
+
+    Response() = default;
+    Response(const Response &) = default;
+    Response &operator=(const Response &) = default;
+    Response(Response &&) = default;
+    Response &operator=(Response &&) = default;
+    ~Response() {
+        if (content_provider_resource_releaser_) {
+            content_provider_resource_releaser_(content_provider_success_);
+        }
+    }
+
+    // private members...
+    size_t content_length_ = 0;
+    ContentProvider content_provider_;
+    ContentProviderResourceReleaser content_provider_resource_releaser_;
+    bool is_chunked_content_provider_ = false;
+    bool content_provider_success_ = false;
+};
+
+class Stream {
+public:
+    virtual ~Stream() = default;
+
+    virtual bool is_readable() const = 0;
+    virtual bool is_writable() const = 0;
+
+    virtual ssize_t read(char *ptr, size_t size) = 0;
+    virtual ssize_t write(const char *ptr, size_t size) = 0;
+    virtual void get_remote_ip_and_port(std::string &ip, int &port) const = 0;
+    virtual void get_local_ip_and_port(std::string &ip, int &port) const = 0;
+    virtual socket_t socket() const = 0;
+
+    template <typename... Args>
+    ssize_t write_format(const char *fmt, const Args &...args);
+    ssize_t write(const char *ptr);
+    ssize_t write(const std::string &s);
+};
+
+class TaskQueue {
+public:
+    TaskQueue() = default;
+    virtual ~TaskQueue() = default;
+
+    virtual void enqueue(std::function<void()> fn) = 0;
+    virtual void shutdown() = 0;
+
+    virtual void on_idle() {}
+};
+
+class ThreadPool : public TaskQueue {
+public:
+    explicit ThreadPool(size_t n) : shutdown_(false) {
+        while (n) {
+            threads_.emplace_back(worker(*this));
+            n--;
+        }
+    }
+
+    ThreadPool(const ThreadPool &) = delete;
+    ~ThreadPool() override = default;
+
+    void enqueue(std::function<void()> fn) override {
+        {
+            std::unique_lock<std::mutex> lock(mutex_);
+            jobs_.push_back(std::move(fn));
+        }
+
+        cond_.notify_one();
+    }
+
+    void shutdown() override {
+        // Stop all worker threads...
+        {
+            std::unique_lock<std::mutex> lock(mutex_);
+            shutdown_ = true;
+        }
+
+        cond_.notify_all();
+
+        // Join...
+        for (auto &t : threads_) {
+            t.join();
+        }
+    }
+
+private:
+    struct worker {
+        explicit worker(ThreadPool &pool) : pool_(pool) {}
+
+        void operator()() {
+            for (;;) {
+                std::function<void()> fn;
+                {
+                    std::unique_lock<std::mutex> lock(pool_.mutex_);
+
+                    pool_.cond_.wait(
+                        lock, [&] { return !pool_.jobs_.empty() || pool_.shutdown_; });
+
+                    if (pool_.shutdown_ && pool_.jobs_.empty()) { break; }
+
+                    fn = std::move(pool_.jobs_.front());
+                    pool_.jobs_.pop_front();
+                }
+
+                assert(true == static_cast<bool>(fn));
+                fn();
+            }
+        }
+
+        ThreadPool &pool_;
+    };
+    friend struct worker;
+
+    std::vector<std::thread> threads_;
+    std::list<std::function<void()>> jobs_;
+
+    bool shutdown_;
+
+    std::condition_variable cond_;
+    std::mutex mutex_;
+};
+
+using Logger = std::function<void(const Request &, const Response &)>;
+
+using SocketOptions = std::function<void(socket_t sock)>;
+
+void default_socket_options(socket_t sock);
+
+const char *status_message(int status);
+
+namespace detail {
+
+class MatcherBase {
+public:
+    virtual ~MatcherBase() = default;
+
+    // Match request path and populate its matches and
+    virtual bool match(Request &request) const = 0;
+};
+
+/**
+ * Captures parameters in request path and stores them in Request::path_params
+ *
+ * Capture name is a substring of a pattern from : to /.
+ * The rest of the pattern is matched agains the request path directly
+ * Parameters are captured starting from the next character after
+ * the end of the last matched static pattern fragment until the next /.
+ *
+ * Example pattern:
+ * "/path/fragments/:capture/more/fragments/:second_capture"
+ * Static fragments:
+ * "/path/fragments/", "more/fragments/"
+ *
+ * Given the following request path:
+ * "/path/fragments/:1/more/fragments/:2"
+ * the resulting capture will be
+ * {{"capture", "1"}, {"second_capture", "2"}}
+ */
+class PathParamsMatcher : public MatcherBase {
+public:
+    PathParamsMatcher(const std::string &pattern);
+
+    bool match(Request &request) const override;
+
+private:
+    static constexpr char marker = ':';
+    // Treat segment separators as the end of path parameter capture
+    // Does not need to handle query parameters as they are parsed before path
+    // matching
+    static constexpr char separator = '/';
+
+    // Contains static path fragments to match against, excluding the '/' after
+    // path params
+    // Fragments are separated by path params
+    std::vector<std::string> static_fragments_;
+    // Stores the names of the path parameters to be used as keys in the
+    // Request::path_params map
+    std::vector<std::string> param_names_;
+};
+
+/**
+ * Performs std::regex_match on request path
+ * and stores the result in Request::matches
+ *
+ * Note that regex match is performed directly on the whole request.
+ * This means that wildcard patterns may match multiple path segments with /:
+ * "/begin/(.*)/end" will match both "/begin/middle/end" and "/begin/1/2/end".
+ */
+class RegexMatcher : public MatcherBase {
+public:
+    RegexMatcher(const std::string &pattern) : regex_(pattern) {}
+
+    bool match(Request &request) const override;
+
+private:
+    std::regex regex_;
+};
+
+ssize_t write_headers(Stream &strm, const Headers &headers);
+
+} // namespace detail
+
+class Server {
+public:
+    using Handler = std::function<void(const Request &, Response &)>;
+
+    using ExceptionHandler =
+        std::function<void(const Request &, Response &, std::exception_ptr ep)>;
+
+    enum class HandlerResponse {
+        Handled,
+        Unhandled,
+    };
+    using HandlerWithResponse =
+        std::function<HandlerResponse(const Request &, Response &)>;
+
+    using HandlerWithContentReader = std::function<void(
+        const Request &, Response &, const ContentReader &content_reader)>;
+
+    using Expect100ContinueHandler =
+        std::function<int(const Request &, Response &)>;
+
+    Server();
+
+    virtual ~Server();
+
+    virtual bool is_valid() const;
+
+    Server &Get(const std::string &pattern, Handler handler);
+    Server &Post(const std::string &pattern, Handler handler);
+    Server &Post(const std::string &pattern, HandlerWithContentReader handler);
+    Server &Put(const std::string &pattern, Handler handler);
+    Server &Put(const std::string &pattern, HandlerWithContentReader handler);
+    Server &Patch(const std::string &pattern, Handler handler);
+    Server &Patch(const std::string &pattern, HandlerWithContentReader handler);
+    Server &Delete(const std::string &pattern, Handler handler);
+    Server &Delete(const std::string &pattern, HandlerWithContentReader handler);
+    Server &Options(const std::string &pattern, Handler handler);
+
+    bool set_base_dir(const std::string &dir,
+        const std::string &mount_point = std::string());
+    bool set_mount_point(const std::string &mount_point, const std::string &dir,
+        Headers headers = Headers());
+    bool remove_mount_point(const std::string &mount_point);
+    Server &set_file_extension_and_mimetype_mapping(const std::string &ext,
+        const std::string &mime);
+    Server &set_default_file_mimetype(const std::string &mime);
+    Server &set_file_request_handler(Handler handler);
+
+    Server &set_error_handler(HandlerWithResponse handler);
+    Server &set_error_handler(Handler handler);
+    Server &set_exception_handler(ExceptionHandler handler);
+    Server &set_pre_routing_handler(HandlerWithResponse handler);
+    Server &set_post_routing_handler(Handler handler);
+
+    Server &set_expect_100_continue_handler(Expect100ContinueHandler handler);
+    Server &set_logger(Logger logger);
+
+    Server &set_address_family(int family);
+    Server &set_tcp_nodelay(bool on);
+    Server &set_socket_options(SocketOptions socket_options);
+
+    Server &set_default_headers(Headers headers);
+    Server &
+    set_header_writer(std::function<ssize_t(Stream &, Headers &)> const &writer);
+
+    Server &set_keep_alive_max_count(size_t count);
+    Server &set_keep_alive_timeout(time_t sec);
+
+    Server &set_read_timeout(time_t sec, time_t usec = 0);
+    template <class Rep, class Period>
+    Server &set_read_timeout(const std::chrono::duration<Rep, Period> &duration);
+
+    Server &set_write_timeout(time_t sec, time_t usec = 0);
+    template <class Rep, class Period>
+    Server &set_write_timeout(const std::chrono::duration<Rep, Period> &duration);
+
+    Server &set_idle_interval(time_t sec, time_t usec = 0);
+    template <class Rep, class Period>
+    Server &set_idle_interval(const std::chrono::duration<Rep, Period> &duration);
+
+    Server &set_payload_max_length(size_t length);
+
+    bool bind_to_port(const std::string &host, int port, int socket_flags = 0);
+    int bind_to_any_port(const std::string &host, int socket_flags = 0);
+    bool listen_after_bind();
+
+    bool listen(const std::string &host, int port, int socket_flags = 0);
+
+    bool is_running() const;
+    void wait_until_ready() const;
+    void stop();
+
+    std::function<TaskQueue *(void)> new_task_queue;
+
+protected:
+    bool process_request(Stream &strm, bool close_connection,
+        bool &connection_closed,
+        const std::function<void(Request &)> &setup_request);
+
+    std::atomic<socket_t> svr_sock_{INVALID_SOCKET};
+    size_t keep_alive_max_count_ = CPPHTTPLIB_KEEPALIVE_MAX_COUNT;
+    time_t keep_alive_timeout_sec_ = CPPHTTPLIB_KEEPALIVE_TIMEOUT_SECOND;
+    time_t read_timeout_sec_ = CPPHTTPLIB_READ_TIMEOUT_SECOND;
+    time_t read_timeout_usec_ = CPPHTTPLIB_READ_TIMEOUT_USECOND;
+    time_t write_timeout_sec_ = CPPHTTPLIB_WRITE_TIMEOUT_SECOND;
+    time_t write_timeout_usec_ = CPPHTTPLIB_WRITE_TIMEOUT_USECOND;
+    time_t idle_interval_sec_ = CPPHTTPLIB_IDLE_INTERVAL_SECOND;
+    time_t idle_interval_usec_ = CPPHTTPLIB_IDLE_INTERVAL_USECOND;
+    size_t payload_max_length_ = CPPHTTPLIB_PAYLOAD_MAX_LENGTH;
+
+private:
+    using Handlers =
+        std::vector<std::pair<std::unique_ptr<detail::MatcherBase>, Handler>>;
+    using HandlersForContentReader =
+        std::vector<std::pair<std::unique_ptr<detail::MatcherBase>,
+            HandlerWithContentReader>>;
+
+    static std::unique_ptr<detail::MatcherBase>
+    make_matcher(const std::string &pattern);
+
+    socket_t create_server_socket(const std::string &host, int port,
+        int socket_flags,
+        SocketOptions socket_options) const;
+    int bind_internal(const std::string &host, int port, int socket_flags);
+    bool listen_internal();
+
+    bool routing(Request &req, Response &res, Stream &strm);
+    bool handle_file_request(const Request &req, Response &res,
+        bool head = false);
+    bool dispatch_request(Request &req, Response &res,
+        const Handlers &handlers) const;
+    bool dispatch_request_for_content_reader(
+        Request &req, Response &res, ContentReader content_reader,
+        const HandlersForContentReader &handlers) const;
+
+    bool parse_request_line(const char *s, Request &req) const;
+    void apply_ranges(const Request &req, Response &res,
+        std::string &content_type, std::string &boundary) const;
+    bool write_response(Stream &strm, bool close_connection, const Request &req,
+        Response &res);
+    bool write_response_with_content(Stream &strm, bool close_connection,
+        const Request &req, Response &res);
+    bool write_response_core(Stream &strm, bool close_connection,
+        const Request &req, Response &res,
+        bool need_apply_ranges);
+    bool write_content_with_provider(Stream &strm, const Request &req,
+        Response &res, const std::string &boundary,
+        const std::string &content_type);
+    bool read_content(Stream &strm, Request &req, Response &res);
+    bool
+    read_content_with_content_receiver(Stream &strm, Request &req, Response &res,
+        ContentReceiver receiver,
+        MultipartContentHeader multipart_header,
+        ContentReceiver multipart_receiver);
+    bool read_content_core(Stream &strm, Request &req, Response &res,
+        ContentReceiver receiver,
+        MultipartContentHeader multipart_header,
+        ContentReceiver multipart_receiver) const;
+
+    virtual bool process_and_close_socket(socket_t sock);
+
+    std::atomic<bool> is_running_{false};
+    std::atomic<bool> done_{false};
+
+    struct MountPointEntry {
+        std::string mount_point;
+        std::string base_dir;
+        Headers headers;
+    };
+    std::vector<MountPointEntry> base_dirs_;
+    std::map<std::string, std::string> file_extension_and_mimetype_map_;
+    std::string default_file_mimetype_ = "application/octet-stream";
+    Handler file_request_handler_;
+
+    Handlers get_handlers_;
+    Handlers post_handlers_;
+    HandlersForContentReader post_handlers_for_content_reader_;
+    Handlers put_handlers_;
+    HandlersForContentReader put_handlers_for_content_reader_;
+    Handlers patch_handlers_;
+    HandlersForContentReader patch_handlers_for_content_reader_;
+    Handlers delete_handlers_;
+    HandlersForContentReader delete_handlers_for_content_reader_;
+    Handlers options_handlers_;
+
+    HandlerWithResponse error_handler_;
+    ExceptionHandler exception_handler_;
+    HandlerWithResponse pre_routing_handler_;
+    Handler post_routing_handler_;
+    Expect100ContinueHandler expect_100_continue_handler_;
+
+    Logger logger_;
+
+    int address_family_ = AF_UNSPEC;
+    bool tcp_nodelay_ = CPPHTTPLIB_TCP_NODELAY;
+    SocketOptions socket_options_ = default_socket_options;
+
+    Headers default_headers_;
+    std::function<ssize_t(Stream &, Headers &)> header_writer_ =
+        detail::write_headers;
+};
+
+enum class Error {
+    Success = 0,
+    Unknown,
+    Connection,
+    BindIPAddress,
+    Read,
+    Write,
+    ExceedRedirectCount,
+    Canceled,
+    SSLConnection,
+    SSLLoadingCerts,
+    SSLServerVerification,
+    UnsupportedMultipartBoundaryChars,
+    Compression,
+    ConnectionTimeout,
+    ProxyConnection,
+
+    // For internal use only
+    SSLPeerCouldBeClosed_,
+};
+
+std::string to_string(Error error);
+
+std::ostream &operator<<(std::ostream &os, const Error &obj);
+
+class Result {
+public:
+    Result() = default;
+    Result(std::unique_ptr<Response> &&res, Error err,
+        Headers &&request_headers = Headers{})
+        : res_(std::move(res)), err_(err),
+          request_headers_(std::move(request_headers)) {}
+    // Response
+    operator bool() const { return res_ != nullptr; }
+    bool operator==(std::nullptr_t) const { return res_ == nullptr; }
+    bool operator!=(std::nullptr_t) const { return res_ != nullptr; }
+    const Response &value() const { return *res_; }
+    Response &value() { return *res_; }
+    const Response &operator*() const { return *res_; }
+    Response &operator*() { return *res_; }
+    const Response *operator->() const { return res_.get(); }
+    Response *operator->() { return res_.get(); }
+
+    // Error
+    Error error() const { return err_; }
+
+    // Request Headers
+    bool has_request_header(const std::string &key) const;
+    std::string get_request_header_value(const std::string &key,
+        size_t id = 0) const;
+    uint64_t get_request_header_value_u64(const std::string &key,
+        size_t id = 0) const;
+    size_t get_request_header_value_count(const std::string &key) const;
+
+private:
+    std::unique_ptr<Response> res_;
+    Error err_ = Error::Unknown;
+    Headers request_headers_;
+};
+
+class ClientImpl {
+public:
+    explicit ClientImpl(const std::string &host);
+
+    explicit ClientImpl(const std::string &host, int port);
+
+    explicit ClientImpl(const std::string &host, int port,
+        const std::string &client_cert_path,
+        const std::string &client_key_path);
+
+    virtual ~ClientImpl();
+
+    virtual bool is_valid() const;
+
+    Result Get(const std::string &path);
+    Result Get(const std::string &path, const Headers &headers);
+    Result Get(const std::string &path, Progress progress);
+    Result Get(const std::string &path, const Headers &headers,
+        Progress progress);
+    Result Get(const std::string &path, ContentReceiver content_receiver);
+    Result Get(const std::string &path, const Headers &headers,
+        ContentReceiver content_receiver);
+    Result Get(const std::string &path, ContentReceiver content_receiver,
+        Progress progress);
+    Result Get(const std::string &path, const Headers &headers,
+        ContentReceiver content_receiver, Progress progress);
+    Result Get(const std::string &path, ResponseHandler response_handler,
+        ContentReceiver content_receiver);
+    Result Get(const std::string &path, const Headers &headers,
+        ResponseHandler response_handler,
+        ContentReceiver content_receiver);
+    Result Get(const std::string &path, ResponseHandler response_handler,
+        ContentReceiver content_receiver, Progress progress);
+    Result Get(const std::string &path, const Headers &headers,
+        ResponseHandler response_handler, ContentReceiver content_receiver,
+        Progress progress);
+
+    Result Get(const std::string &path, const Params &params,
+        const Headers &headers, Progress progress = nullptr);
+    Result Get(const std::string &path, const Params &params,
+        const Headers &headers, ContentReceiver content_receiver,
+        Progress progress = nullptr);
+    Result Get(const std::string &path, const Params &params,
+        const Headers &headers, ResponseHandler response_handler,
+        ContentReceiver content_receiver, Progress progress = nullptr);
+
+    Result Head(const std::string &path);
+    Result Head(const std::string &path, const Headers &headers);
+
+    Result Post(const std::string &path);
+    Result Post(const std::string &path, const Headers &headers);
+    Result Post(const std::string &path, const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Headers &headers, const char *body,
+        size_t content_length, const std::string &content_type);
+    Result Post(const std::string &path, const std::string &body,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Headers &headers,
+        const std::string &body, const std::string &content_type);
+    Result Post(const std::string &path, size_t content_length,
+        ContentProvider content_provider,
+        const std::string &content_type);
+    Result Post(const std::string &path,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Headers &headers,
+        size_t content_length, ContentProvider content_provider,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Headers &headers,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Params &params);
+    Result Post(const std::string &path, const Headers &headers,
+        const Params &params);
+    Result Post(const std::string &path, const MultipartFormDataItems &items);
+    Result Post(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items);
+    Result Post(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items, const std::string &boundary);
+    Result Post(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items,
+        const MultipartFormDataProviderItems &provider_items);
+
+    Result Put(const std::string &path);
+    Result Put(const std::string &path, const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Headers &headers, const char *body,
+        size_t content_length, const std::string &content_type);
+    Result Put(const std::string &path, const std::string &body,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Headers &headers,
+        const std::string &body, const std::string &content_type);
+    Result Put(const std::string &path, size_t content_length,
+        ContentProvider content_provider, const std::string &content_type);
+    Result Put(const std::string &path,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Headers &headers,
+        size_t content_length, ContentProvider content_provider,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Headers &headers,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Params &params);
+    Result Put(const std::string &path, const Headers &headers,
+        const Params &params);
+    Result Put(const std::string &path, const MultipartFormDataItems &items);
+    Result Put(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items);
+    Result Put(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items, const std::string &boundary);
+    Result Put(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items,
+        const MultipartFormDataProviderItems &provider_items);
+
+    Result Patch(const std::string &path);
+    Result Patch(const std::string &path, const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const Headers &headers,
+        const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const std::string &body,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const Headers &headers,
+        const std::string &body, const std::string &content_type);
+    Result Patch(const std::string &path, size_t content_length,
+        ContentProvider content_provider,
+        const std::string &content_type);
+    Result Patch(const std::string &path,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const Headers &headers,
+        size_t content_length, ContentProvider content_provider,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const Headers &headers,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+
+    Result Delete(const std::string &path);
+    Result Delete(const std::string &path, const Headers &headers);
+    Result Delete(const std::string &path, const char *body,
+        size_t content_length, const std::string &content_type);
+    Result Delete(const std::string &path, const Headers &headers,
+        const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Delete(const std::string &path, const std::string &body,
+        const std::string &content_type);
+    Result Delete(const std::string &path, const Headers &headers,
+        const std::string &body, const std::string &content_type);
+
+    Result Options(const std::string &path);
+    Result Options(const std::string &path, const Headers &headers);
+
+    bool send(Request &req, Response &res, Error &error);
+    Result send(const Request &req);
+
+    void stop();
+
+    std::string host() const;
+    int port() const;
+
+    size_t is_socket_open() const;
+    socket_t socket() const;
+
+    void set_hostname_addr_map(std::map<std::string, std::string> addr_map);
+
+    void set_default_headers(Headers headers);
+
+    void
+    set_header_writer(std::function<ssize_t(Stream &, Headers &)> const &writer);
+
+    void set_address_family(int family);
+    void set_tcp_nodelay(bool on);
+    void set_socket_options(SocketOptions socket_options);
+
+    void set_connection_timeout(time_t sec, time_t usec = 0);
+    template <class Rep, class Period>
+    void
+    set_connection_timeout(const std::chrono::duration<Rep, Period> &duration);
+
+    void set_read_timeout(time_t sec, time_t usec = 0);
+    template <class Rep, class Period>
+    void set_read_timeout(const std::chrono::duration<Rep, Period> &duration);
+
+    void set_write_timeout(time_t sec, time_t usec = 0);
+    template <class Rep, class Period>
+    void set_write_timeout(const std::chrono::duration<Rep, Period> &duration);
+
+    void set_basic_auth(const std::string &username, const std::string &password);
+    void set_bearer_token_auth(const std::string &token);
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    void set_digest_auth(const std::string &username,
+        const std::string &password);
+#endif
+
+    void set_keep_alive(bool on);
+    void set_follow_location(bool on);
+
+    void set_url_encode(bool on);
+
+    void set_compress(bool on);
+
+    void set_decompress(bool on);
+
+    void set_interface(const std::string &intf);
+
+    void set_proxy(const std::string &host, int port);
+    void set_proxy_basic_auth(const std::string &username,
+        const std::string &password);
+    void set_proxy_bearer_token_auth(const std::string &token);
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    void set_proxy_digest_auth(const std::string &username,
+        const std::string &password);
+#endif
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    void set_ca_cert_path(const std::string &ca_cert_file_path,
+        const std::string &ca_cert_dir_path = std::string());
+    void set_ca_cert_store(X509_STORE *ca_cert_store);
+    X509_STORE *create_ca_cert_store(const char *ca_cert, std::size_t size) const;
+#endif
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    void enable_server_certificate_verification(bool enabled);
+#endif
+
+    void set_logger(Logger logger);
+
+protected:
+    struct Socket {
+        socket_t sock = INVALID_SOCKET;
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+        SSL *ssl = nullptr;
+#endif
+
+        bool is_open() const { return sock != INVALID_SOCKET; }
+    };
+
+    virtual bool create_and_connect_socket(Socket &socket, Error &error);
+
+    // All of:
+    //   shutdown_ssl
+    //   shutdown_socket
+    //   close_socket
+    // should ONLY be called when socket_mutex_ is locked.
+    // Also, shutdown_ssl and close_socket should also NOT be called concurrently
+    // with a DIFFERENT thread sending requests using that socket.
+    virtual void shutdown_ssl(Socket &socket, bool shutdown_gracefully);
+    void shutdown_socket(Socket &socket) const;
+    void close_socket(Socket &socket);
+
+    bool process_request(Stream &strm, Request &req, Response &res,
+        bool close_connection, Error &error);
+
+    bool write_content_with_provider(Stream &strm, const Request &req,
+        Error &error) const;
+
+    void copy_settings(const ClientImpl &rhs);
+
+    // Socket endpoint information
+    const std::string host_;
+    const int port_;
+    const std::string host_and_port_;
+
+    // Current open socket
+    Socket socket_;
+    mutable std::mutex socket_mutex_;
+    std::recursive_mutex request_mutex_;
+
+    // These are all protected under socket_mutex
+    size_t socket_requests_in_flight_ = 0;
+    std::thread::id socket_requests_are_from_thread_ = std::thread::id();
+    bool socket_should_be_closed_when_request_is_done_ = false;
+
+    // Hostname-IP map
+    std::map<std::string, std::string> addr_map_;
+
+    // Default headers
+    Headers default_headers_;
+
+    // Header writer
+    std::function<ssize_t(Stream &, Headers &)> header_writer_ =
+        detail::write_headers;
+
+    // Settings
+    std::string client_cert_path_;
+    std::string client_key_path_;
+
+    time_t connection_timeout_sec_ = CPPHTTPLIB_CONNECTION_TIMEOUT_SECOND;
+    time_t connection_timeout_usec_ = CPPHTTPLIB_CONNECTION_TIMEOUT_USECOND;
+    time_t read_timeout_sec_ = CPPHTTPLIB_READ_TIMEOUT_SECOND;
+    time_t read_timeout_usec_ = CPPHTTPLIB_READ_TIMEOUT_USECOND;
+    time_t write_timeout_sec_ = CPPHTTPLIB_WRITE_TIMEOUT_SECOND;
+    time_t write_timeout_usec_ = CPPHTTPLIB_WRITE_TIMEOUT_USECOND;
+
+    std::string basic_auth_username_;
+    std::string basic_auth_password_;
+    std::string bearer_token_auth_token_;
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    std::string digest_auth_username_;
+    std::string digest_auth_password_;
+#endif
+
+    bool keep_alive_ = false;
+    bool follow_location_ = false;
+
+    bool url_encode_ = true;
+
+    int address_family_ = AF_UNSPEC;
+    bool tcp_nodelay_ = CPPHTTPLIB_TCP_NODELAY;
+    SocketOptions socket_options_ = nullptr;
+
+    bool compress_ = false;
+    bool decompress_ = true;
+
+    std::string interface_;
+
+    std::string proxy_host_;
+    int proxy_port_ = -1;
+
+    std::string proxy_basic_auth_username_;
+    std::string proxy_basic_auth_password_;
+    std::string proxy_bearer_token_auth_token_;
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    std::string proxy_digest_auth_username_;
+    std::string proxy_digest_auth_password_;
+#endif
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    std::string ca_cert_file_path_;
+    std::string ca_cert_dir_path_;
+
+    X509_STORE *ca_cert_store_ = nullptr;
+#endif
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    bool server_certificate_verification_ = true;
+#endif
+
+    Logger logger_;
+
+private:
+    bool send_(Request &req, Response &res, Error &error);
+    Result send_(Request &&req);
+
+    socket_t create_client_socket(Error &error) const;
+    bool read_response_line(Stream &strm, const Request &req,
+        Response &res) const;
+    bool write_request(Stream &strm, Request &req, bool close_connection,
+        Error &error);
+    bool redirect(Request &req, Response &res, Error &error);
+    bool handle_request(Stream &strm, Request &req, Response &res,
+        bool close_connection, Error &error);
+    std::unique_ptr<Response> send_with_content_provider(
+        Request &req, const char *body, size_t content_length,
+        ContentProvider content_provider,
+        ContentProviderWithoutLength content_provider_without_length,
+        const std::string &content_type, Error &error);
+    Result send_with_content_provider(
+        const std::string &method, const std::string &path,
+        const Headers &headers, const char *body, size_t content_length,
+        ContentProvider content_provider,
+        ContentProviderWithoutLength content_provider_without_length,
+        const std::string &content_type);
+    ContentProviderWithoutLength get_multipart_content_provider(
+        const std::string &boundary, const MultipartFormDataItems &items,
+        const MultipartFormDataProviderItems &provider_items) const;
+
+    std::string adjust_host_string(const std::string &host) const;
+
+    virtual bool process_socket(const Socket &socket,
+        std::function<bool(Stream &strm)> callback);
+    virtual bool is_ssl() const;
+};
+
+class Client {
+public:
+    // Universal interface
+    explicit Client(const std::string &scheme_host_port);
+
+    explicit Client(const std::string &scheme_host_port,
+        const std::string &client_cert_path,
+        const std::string &client_key_path);
+
+    // HTTP only interface
+    explicit Client(const std::string &host, int port);
+
+    explicit Client(const std::string &host, int port,
+        const std::string &client_cert_path,
+        const std::string &client_key_path);
+
+    Client(Client &&) = default;
+
+    ~Client();
+
+    bool is_valid() const;
+
+    Result Get(const std::string &path);
+    Result Get(const std::string &path, const Headers &headers);
+    Result Get(const std::string &path, Progress progress);
+    Result Get(const std::string &path, const Headers &headers,
+        Progress progress);
+    Result Get(const std::string &path, ContentReceiver content_receiver);
+    Result Get(const std::string &path, const Headers &headers,
+        ContentReceiver content_receiver);
+    Result Get(const std::string &path, ContentReceiver content_receiver,
+        Progress progress);
+    Result Get(const std::string &path, const Headers &headers,
+        ContentReceiver content_receiver, Progress progress);
+    Result Get(const std::string &path, ResponseHandler response_handler,
+        ContentReceiver content_receiver);
+    Result Get(const std::string &path, const Headers &headers,
+        ResponseHandler response_handler,
+        ContentReceiver content_receiver);
+    Result Get(const std::string &path, const Headers &headers,
+        ResponseHandler response_handler, ContentReceiver content_receiver,
+        Progress progress);
+    Result Get(const std::string &path, ResponseHandler response_handler,
+        ContentReceiver content_receiver, Progress progress);
+
+    Result Get(const std::string &path, const Params &params,
+        const Headers &headers, Progress progress = nullptr);
+    Result Get(const std::string &path, const Params &params,
+        const Headers &headers, ContentReceiver content_receiver,
+        Progress progress = nullptr);
+    Result Get(const std::string &path, const Params &params,
+        const Headers &headers, ResponseHandler response_handler,
+        ContentReceiver content_receiver, Progress progress = nullptr);
+
+    Result Head(const std::string &path);
+    Result Head(const std::string &path, const Headers &headers);
+
+    Result Post(const std::string &path);
+    Result Post(const std::string &path, const Headers &headers);
+    Result Post(const std::string &path, const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Headers &headers, const char *body,
+        size_t content_length, const std::string &content_type);
+    Result Post(const std::string &path, const std::string &body,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Headers &headers,
+        const std::string &body, const std::string &content_type);
+    Result Post(const std::string &path, size_t content_length,
+        ContentProvider content_provider,
+        const std::string &content_type);
+    Result Post(const std::string &path,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Headers &headers,
+        size_t content_length, ContentProvider content_provider,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Headers &headers,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Post(const std::string &path, const Params &params);
+    Result Post(const std::string &path, const Headers &headers,
+        const Params &params);
+    Result Post(const std::string &path, const MultipartFormDataItems &items);
+    Result Post(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items);
+    Result Post(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items, const std::string &boundary);
+    Result Post(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items,
+        const MultipartFormDataProviderItems &provider_items);
+
+    Result Put(const std::string &path);
+    Result Put(const std::string &path, const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Headers &headers, const char *body,
+        size_t content_length, const std::string &content_type);
+    Result Put(const std::string &path, const std::string &body,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Headers &headers,
+        const std::string &body, const std::string &content_type);
+    Result Put(const std::string &path, size_t content_length,
+        ContentProvider content_provider, const std::string &content_type);
+    Result Put(const std::string &path,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Headers &headers,
+        size_t content_length, ContentProvider content_provider,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Headers &headers,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Put(const std::string &path, const Params &params);
+    Result Put(const std::string &path, const Headers &headers,
+        const Params &params);
+    Result Put(const std::string &path, const MultipartFormDataItems &items);
+    Result Put(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items);
+    Result Put(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items, const std::string &boundary);
+    Result Put(const std::string &path, const Headers &headers,
+        const MultipartFormDataItems &items,
+        const MultipartFormDataProviderItems &provider_items);
+
+    Result Patch(const std::string &path);
+    Result Patch(const std::string &path, const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const Headers &headers,
+        const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const std::string &body,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const Headers &headers,
+        const std::string &body, const std::string &content_type);
+    Result Patch(const std::string &path, size_t content_length,
+        ContentProvider content_provider,
+        const std::string &content_type);
+    Result Patch(const std::string &path,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const Headers &headers,
+        size_t content_length, ContentProvider content_provider,
+        const std::string &content_type);
+    Result Patch(const std::string &path, const Headers &headers,
+        ContentProviderWithoutLength content_provider,
+        const std::string &content_type);
+
+    Result Delete(const std::string &path);
+    Result Delete(const std::string &path, const Headers &headers);
+    Result Delete(const std::string &path, const char *body,
+        size_t content_length, const std::string &content_type);
+    Result Delete(const std::string &path, const Headers &headers,
+        const char *body, size_t content_length,
+        const std::string &content_type);
+    Result Delete(const std::string &path, const std::string &body,
+        const std::string &content_type);
+    Result Delete(const std::string &path, const Headers &headers,
+        const std::string &body, const std::string &content_type);
+
+    Result Options(const std::string &path);
+    Result Options(const std::string &path, const Headers &headers);
+
+    bool send(Request &req, Response &res, Error &error);
+    Result send(const Request &req);
+
+    void stop();
+
+    std::string host() const;
+    int port() const;
+
+    size_t is_socket_open() const;
+    socket_t socket() const;
+
+    void set_hostname_addr_map(std::map<std::string, std::string> addr_map);
+
+    void set_default_headers(Headers headers);
+
+    void
+    set_header_writer(std::function<ssize_t(Stream &, Headers &)> const &writer);
+
+    void set_address_family(int family);
+    void set_tcp_nodelay(bool on);
+    void set_socket_options(SocketOptions socket_options);
+
+    void set_connection_timeout(time_t sec, time_t usec = 0);
+    template <class Rep, class Period>
+    void
+    set_connection_timeout(const std::chrono::duration<Rep, Period> &duration);
+
+    void set_read_timeout(time_t sec, time_t usec = 0);
+    template <class Rep, class Period>
+    void set_read_timeout(const std::chrono::duration<Rep, Period> &duration);
+
+    void set_write_timeout(time_t sec, time_t usec = 0);
+    template <class Rep, class Period>
+    void set_write_timeout(const std::chrono::duration<Rep, Period> &duration);
+
+    void set_basic_auth(const std::string &username, const std::string &password);
+    void set_bearer_token_auth(const std::string &token);
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    void set_digest_auth(const std::string &username,
+        const std::string &password);
+#endif
+
+    void set_keep_alive(bool on);
+    void set_follow_location(bool on);
+
+    void set_url_encode(bool on);
+
+    void set_compress(bool on);
+
+    void set_decompress(bool on);
+
+    void set_interface(const std::string &intf);
+
+    void set_proxy(const std::string &host, int port);
+    void set_proxy_basic_auth(const std::string &username,
+        const std::string &password);
+    void set_proxy_bearer_token_auth(const std::string &token);
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    void set_proxy_digest_auth(const std::string &username,
+        const std::string &password);
+#endif
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    void enable_server_certificate_verification(bool enabled);
+#endif
+
+    void set_logger(Logger logger);
+
+    // SSL
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    void set_ca_cert_path(const std::string &ca_cert_file_path,
+        const std::string &ca_cert_dir_path = std::string());
+
+    void set_ca_cert_store(X509_STORE *ca_cert_store);
+    void load_ca_cert_store(const char *ca_cert, std::size_t size);
+
+    long get_openssl_verify_result() const;
+
+    SSL_CTX *ssl_context() const;
+#endif
+
+private:
+    std::unique_ptr<ClientImpl> cli_;
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    bool is_ssl_ = false;
+#endif
+};
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+class SSLServer : public Server {
+public:
+    SSLServer(const char *cert_path, const char *private_key_path,
+        const char *client_ca_cert_file_path = nullptr,
+        const char *client_ca_cert_dir_path = nullptr,
+        const char *private_key_password = nullptr);
+
+    SSLServer(X509 *cert, EVP_PKEY *private_key,
+        X509_STORE *client_ca_cert_store = nullptr);
+
+    SSLServer(
+        const std::function<bool(SSL_CTX &ssl_ctx)> &setup_ssl_ctx_callback);
+
+    ~SSLServer() override;
+
+    bool is_valid() const override;
+
+    SSL_CTX *ssl_context() const;
+
+private:
+    bool process_and_close_socket(socket_t sock) override;
+
+    SSL_CTX *ctx_;
+    std::mutex ctx_mutex_;
+};
+
+class SSLClient : public ClientImpl {
+public:
+    explicit SSLClient(const std::string &host);
+
+    explicit SSLClient(const std::string &host, int port);
+
+    explicit SSLClient(const std::string &host, int port,
+        const std::string &client_cert_path,
+        const std::string &client_key_path);
+
+    explicit SSLClient(const std::string &host, int port, X509 *client_cert,
+        EVP_PKEY *client_key);
+
+    ~SSLClient() override;
+
+    bool is_valid() const override;
+
+    void set_ca_cert_store(X509_STORE *ca_cert_store);
+    void load_ca_cert_store(const char *ca_cert, std::size_t size);
+
+    long get_openssl_verify_result() const;
+
+    SSL_CTX *ssl_context() const;
+
+private:
+    bool create_and_connect_socket(Socket &socket, Error &error) override;
+    void shutdown_ssl(Socket &socket, bool shutdown_gracefully) override;
+    void shutdown_ssl_impl(Socket &socket, bool shutdown_gracefully);
+
+    bool process_socket(const Socket &socket,
+        std::function<bool(Stream &strm)> callback) override;
+    bool is_ssl() const override;
+
+    bool connect_with_proxy(Socket &sock, Response &res, bool &success,
+        Error &error);
+    bool initialize_ssl(Socket &socket, Error &error);
+
+    bool load_certs();
+
+    bool verify_host(X509 *server_cert) const;
+    bool verify_host_with_subject_alt_name(X509 *server_cert) const;
+    bool verify_host_with_common_name(X509 *server_cert) const;
+    bool check_host_name(const char *pattern, size_t pattern_len) const;
+
+    SSL_CTX *ctx_;
+    std::mutex ctx_mutex_;
+    std::once_flag initialize_cert_;
+
+    std::vector<std::string> host_components_;
+
+    long verify_result_ = 0;
+
+    friend class ClientImpl;
+};
+#endif
+
+/*
+ * Implementation of template methods.
+ */
+
+namespace detail {
+
+template <typename T, typename U>
+inline void duration_to_sec_and_usec(const T &duration, U callback) {
+    auto sec = std::chrono::duration_cast<std::chrono::seconds>(duration).count();
+    auto usec = std::chrono::duration_cast<std::chrono::microseconds>(
+        duration - std::chrono::seconds(sec))
+                    .count();
+    callback(static_cast<time_t>(sec), static_cast<time_t>(usec));
+}
+
+inline uint64_t get_header_value_u64(const Headers &headers,
+    const std::string &key, size_t id,
+    uint64_t def) {
+    auto rng = headers.equal_range(key);
+    auto it = rng.first;
+    std::advance(it, static_cast<ssize_t>(id));
+    if (it != rng.second) {
+        return std::strtoull(it->second.data(), nullptr, 10);
+    }
+    return def;
+}
+
+} // namespace detail
+
+inline uint64_t Request::get_header_value_u64(const std::string &key,
+    size_t id) const {
+    return detail::get_header_value_u64(headers, key, id, 0);
+}
+
+inline uint64_t Response::get_header_value_u64(const std::string &key,
+    size_t id) const {
+    return detail::get_header_value_u64(headers, key, id, 0);
+}
+
+template <typename... Args>
+inline ssize_t Stream::write_format(const char *fmt, const Args &...args) {
+    const auto bufsiz = 2048;
+    std::array<char, bufsiz> buf{};
+
+    auto sn = snprintf(buf.data(), buf.size() - 1, fmt, args...);
+    if (sn <= 0) { return sn; }
+
+    auto n = static_cast<size_t>(sn);
+
+    if (n >= buf.size() - 1) {
+        std::vector<char> glowable_buf(buf.size());
+
+        while (n >= glowable_buf.size() - 1) {
+            glowable_buf.resize(glowable_buf.size() * 2);
+            n = static_cast<size_t>(
+                snprintf(&glowable_buf[0], glowable_buf.size() - 1, fmt, args...));
+        }
+        return write(&glowable_buf[0], n);
+    } else {
+        return write(buf.data(), n);
+    }
+}
+
+inline void default_socket_options(socket_t sock) {
+    int yes = 1;
+#ifdef _WIN32
+    setsockopt(sock, SOL_SOCKET, SO_REUSEADDR,
+        reinterpret_cast<const char *>(&yes), sizeof(yes));
+    setsockopt(sock, SOL_SOCKET, SO_EXCLUSIVEADDRUSE,
+        reinterpret_cast<const char *>(&yes), sizeof(yes));
+#else
+#ifdef SO_REUSEPORT
+    setsockopt(sock, SOL_SOCKET, SO_REUSEPORT,
+        reinterpret_cast<const void *>(&yes), sizeof(yes));
+#else
+    setsockopt(sock, SOL_SOCKET, SO_REUSEADDR,
+        reinterpret_cast<const void *>(&yes), sizeof(yes));
+#endif
+#endif
+}
+
+inline const char *status_message(int status) {
+    switch (status) {
+    case StatusCode::Continue_100: return "Continue";
+    case StatusCode::SwitchingProtocol_101: return "Switching Protocol";
+    case StatusCode::Processing_102: return "Processing";
+    case StatusCode::EarlyHints_103: return "Early Hints";
+    case StatusCode::OK_200: return "OK";
+    case StatusCode::Created_201: return "Created";
+    case StatusCode::Accepted_202: return "Accepted";
+    case StatusCode::NonAuthoritativeInformation_203:
+        return "Non-Authoritative Information";
+    case StatusCode::NoContent_204: return "No Content";
+    case StatusCode::ResetContent_205: return "Reset Content";
+    case StatusCode::PartialContent_206: return "Partial Content";
+    case StatusCode::MultiStatus_207: return "Multi-Status";
+    case StatusCode::AlreadyReported_208: return "Already Reported";
+    case StatusCode::IMUsed_226: return "IM Used";
+    case StatusCode::MultipleChoices_300: return "Multiple Choices";
+    case StatusCode::MovedPermanently_301: return "Moved Permanently";
+    case StatusCode::Found_302: return "Found";
+    case StatusCode::SeeOther_303: return "See Other";
+    case StatusCode::NotModified_304: return "Not Modified";
+    case StatusCode::UseProxy_305: return "Use Proxy";
+    case StatusCode::unused_306: return "unused";
+    case StatusCode::TemporaryRedirect_307: return "Temporary Redirect";
+    case StatusCode::PermanentRedirect_308: return "Permanent Redirect";
+    case StatusCode::BadRequest_400: return "Bad Request";
+    case StatusCode::Unauthorized_401: return "Unauthorized";
+    case StatusCode::PaymentRequired_402: return "Payment Required";
+    case StatusCode::Forbidden_403: return "Forbidden";
+    case StatusCode::NotFound_404: return "Not Found";
+    case StatusCode::MethodNotAllowed_405: return "Method Not Allowed";
+    case StatusCode::NotAcceptable_406: return "Not Acceptable";
+    case StatusCode::ProxyAuthenticationRequired_407:
+        return "Proxy Authentication Required";
+    case StatusCode::RequestTimeout_408: return "Request Timeout";
+    case StatusCode::Conflict_409: return "Conflict";
+    case StatusCode::Gone_410: return "Gone";
+    case StatusCode::LengthRequired_411: return "Length Required";
+    case StatusCode::PreconditionFailed_412: return "Precondition Failed";
+    case StatusCode::PayloadTooLarge_413: return "Payload Too Large";
+    case StatusCode::UriTooLong_414: return "URI Too Long";
+    case StatusCode::UnsupportedMediaType_415: return "Unsupported Media Type";
+    case StatusCode::RangeNotSatisfiable_416: return "Range Not Satisfiable";
+    case StatusCode::ExpectationFailed_417: return "Expectation Failed";
+    case StatusCode::ImATeapot_418: return "I'm a teapot";
+    case StatusCode::MisdirectedRequest_421: return "Misdirected Request";
+    case StatusCode::UnprocessableContent_422: return "Unprocessable Content";
+    case StatusCode::Locked_423: return "Locked";
+    case StatusCode::FailedDependency_424: return "Failed Dependency";
+    case StatusCode::TooEarly_425: return "Too Early";
+    case StatusCode::UpgradeRequired_426: return "Upgrade Required";
+    case StatusCode::PreconditionRequired_428: return "Precondition Required";
+    case StatusCode::TooManyRequests_429: return "Too Many Requests";
+    case StatusCode::RequestHeaderFieldsTooLarge_431:
+        return "Request Header Fields Too Large";
+    case StatusCode::UnavailableForLegalReasons_451:
+        return "Unavailable For Legal Reasons";
+    case StatusCode::NotImplemented_501: return "Not Implemented";
+    case StatusCode::BadGateway_502: return "Bad Gateway";
+    case StatusCode::ServiceUnavailable_503: return "Service Unavailable";
+    case StatusCode::GatewayTimeout_504: return "Gateway Timeout";
+    case StatusCode::HttpVersionNotSupported_505:
+        return "HTTP Version Not Supported";
+    case StatusCode::VariantAlsoNegotiates_506: return "Variant Also Negotiates";
+    case StatusCode::InsufficientStorage_507: return "Insufficient Storage";
+    case StatusCode::LoopDetected_508: return "Loop Detected";
+    case StatusCode::NotExtended_510: return "Not Extended";
+    case StatusCode::NetworkAuthenticationRequired_511:
+        return "Network Authentication Required";
+
+    default:
+    case StatusCode::InternalServerError_500: return "Internal Server Error";
+    }
+}
+
+template <class Rep, class Period>
+inline Server &
+Server::set_read_timeout(const std::chrono::duration<Rep, Period> &duration) {
+    detail::duration_to_sec_and_usec(
+        duration, [&](time_t sec, time_t usec) { set_read_timeout(sec, usec); });
+    return *this;
+}
+
+template <class Rep, class Period>
+inline Server &
+Server::set_write_timeout(const std::chrono::duration<Rep, Period> &duration) {
+    detail::duration_to_sec_and_usec(
+        duration, [&](time_t sec, time_t usec) { set_write_timeout(sec, usec); });
+    return *this;
+}
+
+template <class Rep, class Period>
+inline Server &
+Server::set_idle_interval(const std::chrono::duration<Rep, Period> &duration) {
+    detail::duration_to_sec_and_usec(
+        duration, [&](time_t sec, time_t usec) { set_idle_interval(sec, usec); });
+    return *this;
+}
+
+inline std::string to_string(const Error error) {
+    switch (error) {
+    case Error::Success: return "Success (no error)";
+    case Error::Connection: return "Could not establish connection";
+    case Error::BindIPAddress: return "Failed to bind IP address";
+    case Error::Read: return "Failed to read connection";
+    case Error::Write: return "Failed to write connection";
+    case Error::ExceedRedirectCount: return "Maximum redirect count exceeded";
+    case Error::Canceled: return "Connection handling canceled";
+    case Error::SSLConnection: return "SSL connection failed";
+    case Error::SSLLoadingCerts: return "SSL certificate loading failed";
+    case Error::SSLServerVerification: return "SSL server verification failed";
+    case Error::UnsupportedMultipartBoundaryChars:
+        return "Unsupported HTTP multipart boundary characters";
+    case Error::Compression: return "Compression failed";
+    case Error::ConnectionTimeout: return "Connection timed out";
+    case Error::ProxyConnection: return "Proxy connection failed";
+    case Error::Unknown: return "Unknown";
+    default: break;
+    }
+
+    return "Invalid";
+}
+
+inline std::ostream &operator<<(std::ostream &os, const Error &obj) {
+    os << to_string(obj);
+    os << " (" << static_cast<std::underlying_type<Error>::type>(obj) << ')';
+    return os;
+}
+
+inline uint64_t Result::get_request_header_value_u64(const std::string &key,
+    size_t id) const {
+    return detail::get_header_value_u64(request_headers_, key, id, 0);
+}
+
+template <class Rep, class Period>
+inline void ClientImpl::set_connection_timeout(
+    const std::chrono::duration<Rep, Period> &duration) {
+    detail::duration_to_sec_and_usec(duration, [&](time_t sec, time_t usec) {
+        set_connection_timeout(sec, usec);
+    });
+}
+
+template <class Rep, class Period>
+inline void ClientImpl::set_read_timeout(
+    const std::chrono::duration<Rep, Period> &duration) {
+    detail::duration_to_sec_and_usec(
+        duration, [&](time_t sec, time_t usec) { set_read_timeout(sec, usec); });
+}
+
+template <class Rep, class Period>
+inline void ClientImpl::set_write_timeout(
+    const std::chrono::duration<Rep, Period> &duration) {
+    detail::duration_to_sec_and_usec(
+        duration, [&](time_t sec, time_t usec) { set_write_timeout(sec, usec); });
+}
+
+template <class Rep, class Period>
+inline void Client::set_connection_timeout(
+    const std::chrono::duration<Rep, Period> &duration) {
+    cli_->set_connection_timeout(duration);
+}
+
+template <class Rep, class Period>
+inline void
+Client::set_read_timeout(const std::chrono::duration<Rep, Period> &duration) {
+    cli_->set_read_timeout(duration);
+}
+
+template <class Rep, class Period>
+inline void
+Client::set_write_timeout(const std::chrono::duration<Rep, Period> &duration) {
+    cli_->set_write_timeout(duration);
+}
+
+/*
+ * Forward declarations and types that will be part of the .h file if split into
+ * .h + .cc.
+ */
+
+std::string hosted_at(const std::string &hostname);
+
+void hosted_at(const std::string &hostname, std::vector<std::string> &addrs);
+
+std::string append_query_params(const std::string &path, const Params &params);
+
+std::pair<std::string, std::string> make_range_header(Ranges ranges);
+
+std::pair<std::string, std::string>
+make_basic_authentication_header(const std::string &username,
+    const std::string &password,
+    bool is_proxy = false);
+
+namespace detail {
+
+std::string encode_query_param(const std::string &value);
+
+std::string decode_url(const std::string &s, bool convert_plus_to_space);
+
+void read_file(const std::string &path, std::string &out);
+
+std::string trim_copy(const std::string &s);
+
+void split(const char *b, const char *e, char d,
+    std::function<void(const char *, const char *)> fn);
+
+void split(const char *b, const char *e, char d, size_t m,
+    std::function<void(const char *, const char *)> fn);
+
+bool process_client_socket(socket_t sock, time_t read_timeout_sec,
+    time_t read_timeout_usec, time_t write_timeout_sec,
+    time_t write_timeout_usec,
+    std::function<bool(Stream &)> callback);
+
+socket_t create_client_socket(
+    const std::string &host, const std::string &ip, int port,
+    int address_family, bool tcp_nodelay, SocketOptions socket_options,
+    time_t connection_timeout_sec, time_t connection_timeout_usec,
+    time_t read_timeout_sec, time_t read_timeout_usec, time_t write_timeout_sec,
+    time_t write_timeout_usec, const std::string &intf, Error &error);
+
+const char *get_header_value(const Headers &headers, const std::string &key,
+    size_t id = 0, const char *def = nullptr);
+
+std::string params_to_query_str(const Params &params);
+
+void parse_query_text(const std::string &s, Params &params);
+
+bool parse_multipart_boundary(const std::string &content_type,
+    std::string &boundary);
+
+bool parse_range_header(const std::string &s, Ranges &ranges);
+
+int close_socket(socket_t sock);
+
+ssize_t send_socket(socket_t sock, const void *ptr, size_t size, int flags);
+
+ssize_t read_socket(socket_t sock, void *ptr, size_t size, int flags);
+
+enum class EncodingType { None = 0, Gzip, Brotli };
+
+EncodingType encoding_type(const Request &req, const Response &res);
+
+class BufferStream : public Stream {
+public:
+    BufferStream() = default;
+    ~BufferStream() override = default;
+
+    bool is_readable() const override;
+    bool is_writable() const override;
+    ssize_t read(char *ptr, size_t size) override;
+    ssize_t write(const char *ptr, size_t size) override;
+    void get_remote_ip_and_port(std::string &ip, int &port) const override;
+    void get_local_ip_and_port(std::string &ip, int &port) const override;
+    socket_t socket() const override;
+
+    const std::string &get_buffer() const;
+
+private:
+    std::string buffer;
+    size_t position = 0;
+};
+
+class compressor {
+public:
+    virtual ~compressor() = default;
+
+    typedef std::function<bool(const char *data, size_t data_len)> Callback;
+    virtual bool compress(const char *data, size_t data_length, bool last,
+        Callback callback) = 0;
+};
+
+class decompressor {
+public:
+    virtual ~decompressor() = default;
+
+    virtual bool is_valid() const = 0;
+
+    typedef std::function<bool(const char *data, size_t data_len)> Callback;
+    virtual bool decompress(const char *data, size_t data_length,
+        Callback callback) = 0;
+};
+
+class nocompressor : public compressor {
+public:
+    ~nocompressor() override = default;
+
+    bool compress(const char *data, size_t data_length, bool /*last*/,
+        Callback callback) override;
+};
+
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+class gzip_compressor : public compressor {
+public:
+    gzip_compressor();
+    ~gzip_compressor() override;
+
+    bool compress(const char *data, size_t data_length, bool last,
+        Callback callback) override;
+
+private:
+    bool is_valid_ = false;
+    z_stream strm_;
+};
+
+class gzip_decompressor : public decompressor {
+public:
+    gzip_decompressor();
+    ~gzip_decompressor() override;
+
+    bool is_valid() const override;
+
+    bool decompress(const char *data, size_t data_length,
+        Callback callback) override;
+
+private:
+    bool is_valid_ = false;
+    z_stream strm_;
+};
+#endif
+
+#ifdef CPPHTTPLIB_BROTLI_SUPPORT
+class brotli_compressor : public compressor {
+public:
+    brotli_compressor();
+    ~brotli_compressor();
+
+    bool compress(const char *data, size_t data_length, bool last,
+        Callback callback) override;
+
+private:
+    BrotliEncoderState *state_ = nullptr;
+};
+
+class brotli_decompressor : public decompressor {
+public:
+    brotli_decompressor();
+    ~brotli_decompressor();
+
+    bool is_valid() const override;
+
+    bool decompress(const char *data, size_t data_length,
+        Callback callback) override;
+
+private:
+    BrotliDecoderResult decoder_r;
+    BrotliDecoderState *decoder_s = nullptr;
+};
+#endif
+
+// NOTE: until the read size reaches `fixed_buffer_size`, use `fixed_buffer`
+// to store data. The call can set memory on stack for performance.
+class stream_line_reader {
+public:
+    stream_line_reader(Stream &strm, char *fixed_buffer,
+        size_t fixed_buffer_size);
+    const char *ptr() const;
+    size_t size() const;
+    bool end_with_crlf() const;
+    bool getline();
+
+private:
+    void append(char c);
+
+    Stream &strm_;
+    char *fixed_buffer_;
+    const size_t fixed_buffer_size_;
+    size_t fixed_buffer_used_size_ = 0;
+    std::string glowable_buffer_;
+};
+
+class mmap {
+public:
+    mmap(const char *path);
+    ~mmap();
+
+    bool open(const char *path);
+    void close();
+
+    bool is_open() const;
+    size_t size() const;
+    const char *data() const;
+
+private:
+#if defined(_WIN32)
+    HANDLE hFile_;
+    HANDLE hMapping_;
+#else
+    int fd_;
+#endif
+    size_t size_;
+    void *addr_;
+};
+
+} // namespace detail
+
+// ----------------------------------------------------------------------------
+
+/*
+ * Implementation that will be part of the .cc file if split into .h + .cc.
+ */
+
+namespace detail {
+
+inline bool is_hex(char c, int &v) {
+    if (0x20 <= c && isdigit(c)) {
+        v = c - '0';
+        return true;
+    } else if ('A' <= c && c <= 'F') {
+        v = c - 'A' + 10;
+        return true;
+    } else if ('a' <= c && c <= 'f') {
+        v = c - 'a' + 10;
+        return true;
+    }
+    return false;
+}
+
+inline bool from_hex_to_i(const std::string &s, size_t i, size_t cnt,
+    int &val) {
+    if (i >= s.size()) { return false; }
+
+    val = 0;
+    for (; cnt; i++, cnt--) {
+        if (!s[i]) { return false; }
+        auto v = 0;
+        if (is_hex(s[i], v)) {
+            val = val * 16 + v;
+        } else {
+            return false;
+        }
+    }
+    return true;
+}
+
+inline std::string from_i_to_hex(size_t n) {
+    static const auto charset = "0123456789abcdef";
+    std::string ret;
+    do {
+        ret = charset[n & 15] + ret;
+        n >>= 4;
+    } while (n > 0);
+    return ret;
+}
+
+inline size_t to_utf8(int code, char *buff) {
+    if (code < 0x0080) {
+        buff[0] = static_cast<char>(code & 0x7F);
+        return 1;
+    } else if (code < 0x0800) {
+        buff[0] = static_cast<char>(0xC0 | ((code >> 6) & 0x1F));
+        buff[1] = static_cast<char>(0x80 | (code & 0x3F));
+        return 2;
+    } else if (code < 0xD800) {
+        buff[0] = static_cast<char>(0xE0 | ((code >> 12) & 0xF));
+        buff[1] = static_cast<char>(0x80 | ((code >> 6) & 0x3F));
+        buff[2] = static_cast<char>(0x80 | (code & 0x3F));
+        return 3;
+    } else if (code < 0xE000) { // D800 - DFFF is invalid...
+        return 0;
+    } else if (code < 0x10000) {
+        buff[0] = static_cast<char>(0xE0 | ((code >> 12) & 0xF));
+        buff[1] = static_cast<char>(0x80 | ((code >> 6) & 0x3F));
+        buff[2] = static_cast<char>(0x80 | (code & 0x3F));
+        return 3;
+    } else if (code < 0x110000) {
+        buff[0] = static_cast<char>(0xF0 | ((code >> 18) & 0x7));
+        buff[1] = static_cast<char>(0x80 | ((code >> 12) & 0x3F));
+        buff[2] = static_cast<char>(0x80 | ((code >> 6) & 0x3F));
+        buff[3] = static_cast<char>(0x80 | (code & 0x3F));
+        return 4;
+    }
+
+    // NOTREACHED
+    return 0;
+}
+
+// NOTE: This code came up with the following stackoverflow post:
+// https://stackoverflow.com/questions/180947/base64-decode-snippet-in-c
+inline std::string base64_encode(const std::string &in) {
+    static const auto lookup =
+        "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+    std::string out;
+    out.reserve(in.size());
+
+    auto val = 0;
+    auto valb = -6;
+
+    for (auto c : in) {
+        val = (val << 8) + static_cast<uint8_t>(c);
+        valb += 8;
+        while (valb >= 0) {
+            out.push_back(lookup[(val >> valb) & 0x3F]);
+            valb -= 6;
+        }
+    }
+
+    if (valb > -6) { out.push_back(lookup[((val << 8) >> (valb + 8)) & 0x3F]); }
+
+    while (out.size() % 4) {
+        out.push_back('=');
+    }
+
+    return out;
+}
+
+inline bool is_file(const std::string &path) {
+#ifdef _WIN32
+    return _access_s(path.c_str(), 0) == 0;
+#else
+    struct stat st;
+    return stat(path.c_str(), &st) >= 0 && S_ISREG(st.st_mode);
+#endif
+}
+
+inline bool is_dir(const std::string &path) {
+    struct stat st;
+    return stat(path.c_str(), &st) >= 0 && S_ISDIR(st.st_mode);
+}
+
+inline bool is_valid_path(const std::string &path) {
+    size_t level = 0;
+    size_t i = 0;
+
+    // Skip slash
+    while (i < path.size() && path[i] == '/') {
+        i++;
+    }
+
+    while (i < path.size()) {
+        // Read component
+        auto beg = i;
+        while (i < path.size() && path[i] != '/') {
+            i++;
+        }
+
+        auto len = i - beg;
+        assert(len > 0);
+
+        if (!path.compare(beg, len, ".")) {
+            ;
+        } else if (!path.compare(beg, len, "..")) {
+            if (level == 0) { return false; }
+            level--;
+        } else {
+            level++;
+        }
+
+        // Skip slash
+        while (i < path.size() && path[i] == '/') {
+            i++;
+        }
+    }
+
+    return true;
+}
+
+inline std::string encode_query_param(const std::string &value) {
+    std::ostringstream escaped;
+    escaped.fill('0');
+    escaped << std::hex;
+
+    for (auto c : value) {
+        if (std::isalnum(static_cast<uint8_t>(c)) || c == '-' || c == '_' ||
+            c == '.' || c == '!' || c == '~' || c == '*' || c == '\'' || c == '(' ||
+            c == ')') {
+            escaped << c;
+        } else {
+            escaped << std::uppercase;
+            escaped << '%' << std::setw(2)
+                    << static_cast<int>(static_cast<unsigned char>(c));
+            escaped << std::nouppercase;
+        }
+    }
+
+    return escaped.str();
+}
+
+inline std::string encode_url(const std::string &s) {
+    std::string result;
+    result.reserve(s.size());
+
+    for (size_t i = 0; s[i]; i++) {
+        switch (s[i]) {
+        case ' ': result += "%20"; break;
+        case '+': result += "%2B"; break;
+        case '\r': result += "%0D"; break;
+        case '\n': result += "%0A"; break;
+        case '\'': result += "%27"; break;
+        case ',': result += "%2C"; break;
+        // case ':': result += "%3A"; break; // ok? probably...
+        case ';': result += "%3B"; break;
+        default:
+            auto c = static_cast<uint8_t>(s[i]);
+            if (c >= 0x80) {
+                result += '%';
+                char hex[4];
+                auto len = snprintf(hex, sizeof(hex) - 1, "%02X", c);
+                assert(len == 2);
+                result.append(hex, static_cast<size_t>(len));
+            } else {
+                result += s[i];
+            }
+            break;
+        }
+    }
+
+    return result;
+}
+
+inline std::string decode_url(const std::string &s,
+    bool convert_plus_to_space) {
+    std::string result;
+
+    for (size_t i = 0; i < s.size(); i++) {
+        if (s[i] == '%' && i + 1 < s.size()) {
+            if (s[i + 1] == 'u') {
+                auto val = 0;
+                if (from_hex_to_i(s, i + 2, 4, val)) {
+                    // 4 digits Unicode codes
+                    char buff[4];
+                    size_t len = to_utf8(val, buff);
+                    if (len > 0) { result.append(buff, len); }
+                    i += 5; // 'u0000'
+                } else {
+                    result += s[i];
+                }
+            } else {
+                auto val = 0;
+                if (from_hex_to_i(s, i + 1, 2, val)) {
+                    // 2 digits hex codes
+                    result += static_cast<char>(val);
+                    i += 2; // '00'
+                } else {
+                    result += s[i];
+                }
+            }
+        } else if (convert_plus_to_space && s[i] == '+') {
+            result += ' ';
+        } else {
+            result += s[i];
+        }
+    }
+
+    return result;
+}
+
+inline void read_file(const std::string &path, std::string &out) {
+    std::ifstream fs(path, std::ios_base::binary);
+    fs.seekg(0, std::ios_base::end);
+    auto size = fs.tellg();
+    fs.seekg(0);
+    out.resize(static_cast<size_t>(size));
+    fs.read(&out[0], static_cast<std::streamsize>(size));
+}
+
+inline std::string file_extension(const std::string &path) {
+    std::smatch m;
+    static auto re = std::regex("\\.([a-zA-Z0-9]+)$");
+    if (std::regex_search(path, m, re)) { return m[1].str(); }
+    return std::string();
+}
+
+inline bool is_space_or_tab(char c) { return c == ' ' || c == '\t'; }
+
+inline std::pair<size_t, size_t> trim(const char *b, const char *e, size_t left,
+    size_t right) {
+    while (b + left < e && is_space_or_tab(b[left])) {
+        left++;
+    }
+    while (right > 0 && is_space_or_tab(b[right - 1])) {
+        right--;
+    }
+    return std::make_pair(left, right);
+}
+
+inline std::string trim_copy(const std::string &s) {
+    auto r = trim(s.data(), s.data() + s.size(), 0, s.size());
+    return s.substr(r.first, r.second - r.first);
+}
+
+inline std::string trim_double_quotes_copy(const std::string &s) {
+    if (s.length() >= 2 && s.front() == '"' && s.back() == '"') {
+        return s.substr(1, s.size() - 2);
+    }
+    return s;
+}
+
+inline void split(const char *b, const char *e, char d,
+    std::function<void(const char *, const char *)> fn) {
+    return split(b, e, d, std::numeric_limits<size_t>::max(), fn);
+}
+
+inline void split(const char *b, const char *e, char d, size_t m,
+    std::function<void(const char *, const char *)> fn) {
+    size_t i = 0;
+    size_t beg = 0;
+    size_t count = 1;
+
+    while (e ? (b + i < e) : (b[i] != '\0')) {
+        if (b[i] == d && count < m) {
+            auto r = trim(b, e, beg, i);
+            if (r.first < r.second) { fn(&b[r.first], &b[r.second]); }
+            beg = i + 1;
+            count++;
+        }
+        i++;
+    }
+
+    if (i) {
+        auto r = trim(b, e, beg, i);
+        if (r.first < r.second) { fn(&b[r.first], &b[r.second]); }
+    }
+}
+
+inline stream_line_reader::stream_line_reader(Stream &strm, char *fixed_buffer,
+    size_t fixed_buffer_size)
+    : strm_(strm), fixed_buffer_(fixed_buffer),
+      fixed_buffer_size_(fixed_buffer_size) {}
+
+inline const char *stream_line_reader::ptr() const {
+    if (glowable_buffer_.empty()) {
+        return fixed_buffer_;
+    } else {
+        return glowable_buffer_.data();
+    }
+}
+
+inline size_t stream_line_reader::size() const {
+    if (glowable_buffer_.empty()) {
+        return fixed_buffer_used_size_;
+    } else {
+        return glowable_buffer_.size();
+    }
+}
+
+inline bool stream_line_reader::end_with_crlf() const {
+    auto end = ptr() + size();
+    return size() >= 2 && end[-2] == '\r' && end[-1] == '\n';
+}
+
+inline bool stream_line_reader::getline() {
+    fixed_buffer_used_size_ = 0;
+    glowable_buffer_.clear();
+
+    for (size_t i = 0;; i++) {
+        char byte;
+        auto n = strm_.read(&byte, 1);
+
+        if (n < 0) {
+            return false;
+        } else if (n == 0) {
+            if (i == 0) {
+                return false;
+            } else {
+                break;
+            }
+        }
+
+        append(byte);
+
+        if (byte == '\n') { break; }
+    }
+
+    return true;
+}
+
+inline void stream_line_reader::append(char c) {
+    if (fixed_buffer_used_size_ < fixed_buffer_size_ - 1) {
+        fixed_buffer_[fixed_buffer_used_size_++] = c;
+        fixed_buffer_[fixed_buffer_used_size_] = '\0';
+    } else {
+        if (glowable_buffer_.empty()) {
+            assert(fixed_buffer_[fixed_buffer_used_size_] == '\0');
+            glowable_buffer_.assign(fixed_buffer_, fixed_buffer_used_size_);
+        }
+        glowable_buffer_ += c;
+    }
+}
+
+inline mmap::mmap(const char *path)
+#if defined(_WIN32)
+    : hFile_(NULL), hMapping_(NULL)
+#else
+    : fd_(-1)
+#endif
+      ,
+      size_(0), addr_(nullptr) {
+    open(path);
+}
+
+inline mmap::~mmap() { close(); }
+
+inline bool mmap::open(const char *path) {
+    close();
+
+#if defined(_WIN32)
+    hFile_ = ::CreateFileA(path, GENERIC_READ, FILE_SHARE_READ, NULL,
+        OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);
+
+    if (hFile_ == INVALID_HANDLE_VALUE) { return false; }
+
+    size_ = ::GetFileSize(hFile_, NULL);
+
+    hMapping_ = ::CreateFileMapping(hFile_, NULL, PAGE_READONLY, 0, 0, NULL);
+
+    if (hMapping_ == NULL) {
+        close();
+        return false;
+    }
+
+    addr_ = ::MapViewOfFile(hMapping_, FILE_MAP_READ, 0, 0, 0);
+#else
+    fd_ = ::open(path, O_RDONLY);
+    if (fd_ == -1) { return false; }
+
+    struct stat sb;
+    if (fstat(fd_, &sb) == -1) {
+        close();
+        return false;
+    }
+    size_ = static_cast<size_t>(sb.st_size);
+
+    addr_ = ::mmap(NULL, size_, PROT_READ, MAP_PRIVATE, fd_, 0);
+#endif
+
+    if (addr_ == nullptr) {
+        close();
+        return false;
+    }
+
+    return true;
+}
+
+inline bool mmap::is_open() const { return addr_ != nullptr; }
+
+inline size_t mmap::size() const { return size_; }
+
+inline const char *mmap::data() const { return (const char *)addr_; }
+
+inline void mmap::close() {
+#if defined(_WIN32)
+    if (addr_) {
+        ::UnmapViewOfFile(addr_);
+        addr_ = nullptr;
+    }
+
+    if (hMapping_) {
+        ::CloseHandle(hMapping_);
+        hMapping_ = NULL;
+    }
+
+    if (hFile_ != INVALID_HANDLE_VALUE) {
+        ::CloseHandle(hFile_);
+        hFile_ = INVALID_HANDLE_VALUE;
+    }
+#else
+    if (addr_ != nullptr) {
+        munmap(addr_, size_);
+        addr_ = nullptr;
+    }
+
+    if (fd_ != -1) {
+        ::close(fd_);
+        fd_ = -1;
+    }
+#endif
+    size_ = 0;
+}
+inline int close_socket(socket_t sock) {
+#ifdef _WIN32
+    return closesocket(sock);
+#else
+    return close(sock);
+#endif
+}
+
+template <typename T> inline ssize_t handle_EINTR(T fn) {
+    ssize_t res = 0;
+    while (true) {
+        res = fn();
+        if (res < 0 && errno == EINTR) { continue; }
+        break;
+    }
+    return res;
+}
+
+inline ssize_t read_socket(socket_t sock, void *ptr, size_t size, int flags) {
+    return handle_EINTR([&]() {
+        return recv(sock,
+#ifdef _WIN32
+            static_cast<char *>(ptr), static_cast<int>(size),
+#else
+            ptr, size,
+#endif
+            flags);
+    });
+}
+
+inline ssize_t send_socket(socket_t sock, const void *ptr, size_t size,
+    int flags) {
+    return handle_EINTR([&]() {
+        return send(sock,
+#ifdef _WIN32
+            static_cast<const char *>(ptr), static_cast<int>(size),
+#else
+            ptr, size,
+#endif
+            flags);
+    });
+}
+
+inline ssize_t select_read(socket_t sock, time_t sec, time_t usec) {
+#ifdef CPPHTTPLIB_USE_POLL
+    struct pollfd pfd_read;
+    pfd_read.fd = sock;
+    pfd_read.events = POLLIN;
+
+    auto timeout = static_cast<int>(sec * 1000 + usec / 1000);
+
+    return handle_EINTR([&]() { return poll(&pfd_read, 1, timeout); });
+#else
+#ifndef _WIN32
+    if (sock >= FD_SETSIZE) { return 1; }
+#endif
+
+    fd_set fds;
+    FD_ZERO(&fds);
+    FD_SET(sock, &fds);
+
+    timeval tv;
+    tv.tv_sec = static_cast<long>(sec);
+    tv.tv_usec = static_cast<decltype(tv.tv_usec)>(usec);
+
+    return handle_EINTR([&]() {
+        return select(static_cast<int>(sock + 1), &fds, nullptr, nullptr, &tv);
+    });
+#endif
+}
+
+inline ssize_t select_write(socket_t sock, time_t sec, time_t usec) {
+#ifdef CPPHTTPLIB_USE_POLL
+    struct pollfd pfd_read;
+    pfd_read.fd = sock;
+    pfd_read.events = POLLOUT;
+
+    auto timeout = static_cast<int>(sec * 1000 + usec / 1000);
+
+    return handle_EINTR([&]() { return poll(&pfd_read, 1, timeout); });
+#else
+#ifndef _WIN32
+    if (sock >= FD_SETSIZE) { return 1; }
+#endif
+
+    fd_set fds;
+    FD_ZERO(&fds);
+    FD_SET(sock, &fds);
+
+    timeval tv;
+    tv.tv_sec = static_cast<long>(sec);
+    tv.tv_usec = static_cast<decltype(tv.tv_usec)>(usec);
+
+    return handle_EINTR([&]() {
+        return select(static_cast<int>(sock + 1), nullptr, &fds, nullptr, &tv);
+    });
+#endif
+}
+
+inline Error wait_until_socket_is_ready(socket_t sock, time_t sec,
+    time_t usec) {
+#ifdef CPPHTTPLIB_USE_POLL
+    struct pollfd pfd_read;
+    pfd_read.fd = sock;
+    pfd_read.events = POLLIN | POLLOUT;
+
+    auto timeout = static_cast<int>(sec * 1000 + usec / 1000);
+
+    auto poll_res = handle_EINTR([&]() { return poll(&pfd_read, 1, timeout); });
+
+    if (poll_res == 0) { return Error::ConnectionTimeout; }
+
+    if (poll_res > 0 && pfd_read.revents & (POLLIN | POLLOUT)) {
+        auto error = 0;
+        socklen_t len = sizeof(error);
+        auto res = getsockopt(sock, SOL_SOCKET, SO_ERROR,
+            reinterpret_cast<char *>(&error), &len);
+        auto successful = res >= 0 && !error;
+        return successful ? Error::Success : Error::Connection;
+    }
+
+    return Error::Connection;
+#else
+#ifndef _WIN32
+    if (sock >= FD_SETSIZE) { return Error::Connection; }
+#endif
+
+    fd_set fdsr;
+    FD_ZERO(&fdsr);
+    FD_SET(sock, &fdsr);
+
+    auto fdsw = fdsr;
+    auto fdse = fdsr;
+
+    timeval tv;
+    tv.tv_sec = static_cast<long>(sec);
+    tv.tv_usec = static_cast<decltype(tv.tv_usec)>(usec);
+
+    auto ret = handle_EINTR([&]() {
+        return select(static_cast<int>(sock + 1), &fdsr, &fdsw, &fdse, &tv);
+    });
+
+    if (ret == 0) { return Error::ConnectionTimeout; }
+
+    if (ret > 0 && (FD_ISSET(sock, &fdsr) || FD_ISSET(sock, &fdsw))) {
+        auto error = 0;
+        socklen_t len = sizeof(error);
+        auto res = getsockopt(sock, SOL_SOCKET, SO_ERROR,
+            reinterpret_cast<char *>(&error), &len);
+        auto successful = res >= 0 && !error;
+        return successful ? Error::Success : Error::Connection;
+    }
+    return Error::Connection;
+#endif
+}
+
+inline bool is_socket_alive(socket_t sock) {
+    const auto val = detail::select_read(sock, 0, 0);
+    if (val == 0) {
+        return true;
+    } else if (val < 0 && errno == EBADF) {
+        return false;
+    }
+    char buf[1];
+    return detail::read_socket(sock, &buf[0], sizeof(buf), MSG_PEEK) > 0;
+}
+
+class SocketStream : public Stream {
+public:
+    SocketStream(socket_t sock, time_t read_timeout_sec, time_t read_timeout_usec,
+        time_t write_timeout_sec, time_t write_timeout_usec);
+    ~SocketStream() override;
+
+    bool is_readable() const override;
+    bool is_writable() const override;
+    ssize_t read(char *ptr, size_t size) override;
+    ssize_t write(const char *ptr, size_t size) override;
+    void get_remote_ip_and_port(std::string &ip, int &port) const override;
+    void get_local_ip_and_port(std::string &ip, int &port) const override;
+    socket_t socket() const override;
+
+private:
+    socket_t sock_;
+    time_t read_timeout_sec_;
+    time_t read_timeout_usec_;
+    time_t write_timeout_sec_;
+    time_t write_timeout_usec_;
+
+    std::vector<char> read_buff_;
+    size_t read_buff_off_ = 0;
+    size_t read_buff_content_size_ = 0;
+
+    static const size_t read_buff_size_ = 1024l * 4;
+};
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+class SSLSocketStream : public Stream {
+public:
+    SSLSocketStream(socket_t sock, SSL *ssl, time_t read_timeout_sec,
+        time_t read_timeout_usec, time_t write_timeout_sec,
+        time_t write_timeout_usec);
+    ~SSLSocketStream() override;
+
+    bool is_readable() const override;
+    bool is_writable() const override;
+    ssize_t read(char *ptr, size_t size) override;
+    ssize_t write(const char *ptr, size_t size) override;
+    void get_remote_ip_and_port(std::string &ip, int &port) const override;
+    void get_local_ip_and_port(std::string &ip, int &port) const override;
+    socket_t socket() const override;
+
+private:
+    socket_t sock_;
+    SSL *ssl_;
+    time_t read_timeout_sec_;
+    time_t read_timeout_usec_;
+    time_t write_timeout_sec_;
+    time_t write_timeout_usec_;
+};
+#endif
+
+inline bool keep_alive(socket_t sock, time_t keep_alive_timeout_sec) {
+    using namespace std::chrono;
+    auto start = steady_clock::now();
+    while (true) {
+        auto val = select_read(sock, 0, 10000);
+        if (val < 0) {
+            return false;
+        } else if (val == 0) {
+            auto current = steady_clock::now();
+            auto duration = duration_cast<milliseconds>(current - start);
+            auto timeout = keep_alive_timeout_sec * 1000;
+            if (duration.count() > timeout) { return false; }
+            std::this_thread::sleep_for(std::chrono::milliseconds(1));
+        } else {
+            return true;
+        }
+    }
+}
+
+template <typename T>
+inline bool
+process_server_socket_core(const std::atomic<socket_t> &svr_sock, socket_t sock,
+    size_t keep_alive_max_count,
+    time_t keep_alive_timeout_sec, T callback) {
+    assert(keep_alive_max_count > 0);
+    auto ret = false;
+    auto count = keep_alive_max_count;
+    while (svr_sock != INVALID_SOCKET && count > 0 &&
+           keep_alive(sock, keep_alive_timeout_sec)) {
+        auto close_connection = count == 1;
+        auto connection_closed = false;
+        ret = callback(close_connection, connection_closed);
+        if (!ret || connection_closed) { break; }
+        count--;
+    }
+    return ret;
+}
+
+template <typename T>
+inline bool
+process_server_socket(const std::atomic<socket_t> &svr_sock, socket_t sock,
+    size_t keep_alive_max_count,
+    time_t keep_alive_timeout_sec, time_t read_timeout_sec,
+    time_t read_timeout_usec, time_t write_timeout_sec,
+    time_t write_timeout_usec, T callback) {
+    return process_server_socket_core(
+        svr_sock, sock, keep_alive_max_count, keep_alive_timeout_sec,
+        [&](bool close_connection, bool &connection_closed) {
+            SocketStream strm(sock, read_timeout_sec, read_timeout_usec,
+                write_timeout_sec, write_timeout_usec);
+            return callback(strm, close_connection, connection_closed);
+        });
+}
+
+inline bool process_client_socket(socket_t sock, time_t read_timeout_sec,
+    time_t read_timeout_usec,
+    time_t write_timeout_sec,
+    time_t write_timeout_usec,
+    std::function<bool(Stream &)> callback) {
+    SocketStream strm(sock, read_timeout_sec, read_timeout_usec,
+        write_timeout_sec, write_timeout_usec);
+    return callback(strm);
+}
+
+inline int shutdown_socket(socket_t sock) {
+#ifdef _WIN32
+    return shutdown(sock, SD_BOTH);
+#else
+    return shutdown(sock, SHUT_RDWR);
+#endif
+}
+
+template <typename BindOrConnect>
+socket_t create_socket(const std::string &host, const std::string &ip, int port,
+    int address_family, int socket_flags, bool tcp_nodelay,
+    SocketOptions socket_options,
+    BindOrConnect bind_or_connect) {
+    // Get address info
+    const char *node = nullptr;
+    struct addrinfo hints;
+    struct addrinfo *result;
+
+    memset(&hints, 0, sizeof(struct addrinfo));
+    hints.ai_socktype = SOCK_STREAM;
+    hints.ai_protocol = 0;
+
+    if (!ip.empty()) {
+        node = ip.c_str();
+        // Ask getaddrinfo to convert IP in c-string to address
+        hints.ai_family = AF_UNSPEC;
+        hints.ai_flags = AI_NUMERICHOST;
+    } else {
+        if (!host.empty()) { node = host.c_str(); }
+        hints.ai_family = address_family;
+        hints.ai_flags = socket_flags;
+    }
+
+#ifndef _WIN32
+    if (hints.ai_family == AF_UNIX) {
+        const auto addrlen = host.length();
+        if (addrlen > sizeof(sockaddr_un::sun_path)) { return INVALID_SOCKET; }
+
+        auto sock = socket(hints.ai_family, hints.ai_socktype, hints.ai_protocol);
+        if (sock != INVALID_SOCKET) {
+            sockaddr_un addr{};
+            addr.sun_family = AF_UNIX;
+            std::copy(host.begin(), host.end(), addr.sun_path);
+
+            hints.ai_addr = reinterpret_cast<sockaddr *>(&addr);
+            hints.ai_addrlen = static_cast<socklen_t>(
+                sizeof(addr) - sizeof(addr.sun_path) + addrlen);
+
+            fcntl(sock, F_SETFD, FD_CLOEXEC);
+            if (socket_options) { socket_options(sock); }
+
+            if (!bind_or_connect(sock, hints)) {
+                close_socket(sock);
+                sock = INVALID_SOCKET;
+            }
+        }
+        return sock;
+    }
+#endif
+
+    auto service = std::to_string(port);
+
+    if (getaddrinfo(node, service.c_str(), &hints, &result)) {
+#if defined __linux__ && !defined __ANDROID__
+        res_init();
+#endif
+        return INVALID_SOCKET;
+    }
+
+    for (auto rp = result; rp; rp = rp->ai_next) {
+        // Create a socket
+#ifdef _WIN32
+        auto sock =
+            WSASocketW(rp->ai_family, rp->ai_socktype, rp->ai_protocol, nullptr, 0,
+                WSA_FLAG_NO_HANDLE_INHERIT | WSA_FLAG_OVERLAPPED);
+        /**
+     * Since the WSA_FLAG_NO_HANDLE_INHERIT is only supported on Windows 7 SP1
+     * and above the socket creation fails on older Windows Systems.
+     *
+     * Let's try to create a socket the old way in this case.
+     *
+     * Reference:
+     * https://docs.microsoft.com/en-us/windows/win32/api/winsock2/nf-winsock2-wsasocketa
+     *
+     * WSA_FLAG_NO_HANDLE_INHERIT:
+     * This flag is supported on Windows 7 with SP1, Windows Server 2008 R2 with
+     * SP1, and later
+     *
+         */
+        if (sock == INVALID_SOCKET) {
+            sock = socket(rp->ai_family, rp->ai_socktype, rp->ai_protocol);
+        }
+#else
+        auto sock = socket(rp->ai_family, rp->ai_socktype, rp->ai_protocol);
+#endif
+        if (sock == INVALID_SOCKET) { continue; }
+
+#ifndef _WIN32
+        if (fcntl(sock, F_SETFD, FD_CLOEXEC) == -1) {
+            close_socket(sock);
+            continue;
+        }
+#endif
+
+        if (tcp_nodelay) {
+            auto yes = 1;
+#ifdef _WIN32
+            setsockopt(sock, IPPROTO_TCP, TCP_NODELAY,
+                reinterpret_cast<const char *>(&yes), sizeof(yes));
+#else
+            setsockopt(sock, IPPROTO_TCP, TCP_NODELAY,
+                reinterpret_cast<const void *>(&yes), sizeof(yes));
+#endif
+        }
+
+        if (socket_options) { socket_options(sock); }
+
+        if (rp->ai_family == AF_INET6) {
+            auto no = 0;
+#ifdef _WIN32
+            setsockopt(sock, IPPROTO_IPV6, IPV6_V6ONLY,
+                reinterpret_cast<const char *>(&no), sizeof(no));
+#else
+            setsockopt(sock, IPPROTO_IPV6, IPV6_V6ONLY,
+                reinterpret_cast<const void *>(&no), sizeof(no));
+#endif
+        }
+
+        // bind or connect
+        if (bind_or_connect(sock, *rp)) {
+            freeaddrinfo(result);
+            return sock;
+        }
+
+        close_socket(sock);
+    }
+
+    freeaddrinfo(result);
+    return INVALID_SOCKET;
+}
+
+inline void set_nonblocking(socket_t sock, bool nonblocking) {
+#ifdef _WIN32
+    auto flags = nonblocking ? 1UL : 0UL;
+    ioctlsocket(sock, FIONBIO, &flags);
+#else
+    auto flags = fcntl(sock, F_GETFL, 0);
+    fcntl(sock, F_SETFL,
+        nonblocking ? (flags | O_NONBLOCK) : (flags & (~O_NONBLOCK)));
+#endif
+}
+
+inline bool is_connection_error() {
+#ifdef _WIN32
+    return WSAGetLastError() != WSAEWOULDBLOCK;
+#else
+    return errno != EINPROGRESS;
+#endif
+}
+
+inline bool bind_ip_address(socket_t sock, const std::string &host) {
+    struct addrinfo hints;
+    struct addrinfo *result;
+
+    memset(&hints, 0, sizeof(struct addrinfo));
+    hints.ai_family = AF_UNSPEC;
+    hints.ai_socktype = SOCK_STREAM;
+    hints.ai_protocol = 0;
+
+    if (getaddrinfo(host.c_str(), "0", &hints, &result)) { return false; }
+
+    auto ret = false;
+    for (auto rp = result; rp; rp = rp->ai_next) {
+        const auto &ai = *rp;
+        if (!::bind(sock, ai.ai_addr, static_cast<socklen_t>(ai.ai_addrlen))) {
+            ret = true;
+            break;
+        }
+    }
+
+    freeaddrinfo(result);
+    return ret;
+}
+
+#if !defined _WIN32 && !defined ANDROID && !defined _AIX && !defined __MVS__
+#define USE_IF2IP
+#endif
+
+#ifdef USE_IF2IP
+inline std::string if2ip(int address_family, const std::string &ifn) {
+    struct ifaddrs *ifap;
+    getifaddrs(&ifap);
+    std::string addr_candidate;
+    for (auto ifa = ifap; ifa; ifa = ifa->ifa_next) {
+        if (ifa->ifa_addr && ifn == ifa->ifa_name &&
+            (AF_UNSPEC == address_family ||
+                ifa->ifa_addr->sa_family == address_family)) {
+            if (ifa->ifa_addr->sa_family == AF_INET) {
+                auto sa = reinterpret_cast<struct sockaddr_in *>(ifa->ifa_addr);
+                char buf[INET_ADDRSTRLEN];
+                if (inet_ntop(AF_INET, &sa->sin_addr, buf, INET_ADDRSTRLEN)) {
+                    freeifaddrs(ifap);
+                    return std::string(buf, INET_ADDRSTRLEN);
+                }
+            } else if (ifa->ifa_addr->sa_family == AF_INET6) {
+                auto sa = reinterpret_cast<struct sockaddr_in6 *>(ifa->ifa_addr);
+                if (!IN6_IS_ADDR_LINKLOCAL(&sa->sin6_addr)) {
+                    char buf[INET6_ADDRSTRLEN] = {};
+                    if (inet_ntop(AF_INET6, &sa->sin6_addr, buf, INET6_ADDRSTRLEN)) {
+                        // equivalent to mac's IN6_IS_ADDR_UNIQUE_LOCAL
+                        auto s6_addr_head = sa->sin6_addr.s6_addr[0];
+                        if (s6_addr_head == 0xfc || s6_addr_head == 0xfd) {
+                            addr_candidate = std::string(buf, INET6_ADDRSTRLEN);
+                        } else {
+                            freeifaddrs(ifap);
+                            return std::string(buf, INET6_ADDRSTRLEN);
+                        }
+                    }
+                }
+            }
+        }
+    }
+    freeifaddrs(ifap);
+    return addr_candidate;
+}
+#endif
+
+inline socket_t create_client_socket(
+    const std::string &host, const std::string &ip, int port,
+    int address_family, bool tcp_nodelay, SocketOptions socket_options,
+    time_t connection_timeout_sec, time_t connection_timeout_usec,
+    time_t read_timeout_sec, time_t read_timeout_usec, time_t write_timeout_sec,
+    time_t write_timeout_usec, const std::string &intf, Error &error) {
+    auto sock = create_socket(
+        host, ip, port, address_family, 0, tcp_nodelay, std::move(socket_options),
+        [&](socket_t sock2, struct addrinfo &ai) -> bool {
+            if (!intf.empty()) {
+#ifdef USE_IF2IP
+                auto ip_from_if = if2ip(address_family, intf);
+                if (ip_from_if.empty()) { ip_from_if = intf; }
+                if (!bind_ip_address(sock2, ip_from_if)) {
+                    error = Error::BindIPAddress;
+                    return false;
+                }
+#endif
+            }
+
+            set_nonblocking(sock2, true);
+
+            auto ret =
+                ::connect(sock2, ai.ai_addr, static_cast<socklen_t>(ai.ai_addrlen));
+
+            if (ret < 0) {
+                if (is_connection_error()) {
+                    error = Error::Connection;
+                    return false;
+                }
+                error = wait_until_socket_is_ready(sock2, connection_timeout_sec,
+                    connection_timeout_usec);
+                if (error != Error::Success) { return false; }
+            }
+
+            set_nonblocking(sock2, false);
+
+            {
+#ifdef _WIN32
+                auto timeout = static_cast<uint32_t>(read_timeout_sec * 1000 +
+                                                     read_timeout_usec / 1000);
+                setsockopt(sock2, SOL_SOCKET, SO_RCVTIMEO,
+                    reinterpret_cast<const char *>(&timeout), sizeof(timeout));
+#else
+                timeval tv;
+                tv.tv_sec = static_cast<long>(read_timeout_sec);
+                tv.tv_usec = static_cast<decltype(tv.tv_usec)>(read_timeout_usec);
+                setsockopt(sock2, SOL_SOCKET, SO_RCVTIMEO,
+                    reinterpret_cast<const void *>(&tv), sizeof(tv));
+#endif
+            }
+            {
+
+#ifdef _WIN32
+                auto timeout = static_cast<uint32_t>(write_timeout_sec * 1000 +
+                                                     write_timeout_usec / 1000);
+                setsockopt(sock2, SOL_SOCKET, SO_SNDTIMEO,
+                    reinterpret_cast<const char *>(&timeout), sizeof(timeout));
+#else
+                timeval tv;
+                tv.tv_sec = static_cast<long>(write_timeout_sec);
+                tv.tv_usec = static_cast<decltype(tv.tv_usec)>(write_timeout_usec);
+                setsockopt(sock2, SOL_SOCKET, SO_SNDTIMEO,
+                    reinterpret_cast<const void *>(&tv), sizeof(tv));
+#endif
+            }
+
+            error = Error::Success;
+            return true;
+        });
+
+    if (sock != INVALID_SOCKET) {
+        error = Error::Success;
+    } else {
+        if (error == Error::Success) { error = Error::Connection; }
+    }
+
+    return sock;
+}
+
+inline bool get_ip_and_port(const struct sockaddr_storage &addr,
+    socklen_t addr_len, std::string &ip, int &port) {
+    if (addr.ss_family == AF_INET) {
+        port = ntohs(reinterpret_cast<const struct sockaddr_in *>(&addr)->sin_port);
+    } else if (addr.ss_family == AF_INET6) {
+        port =
+            ntohs(reinterpret_cast<const struct sockaddr_in6 *>(&addr)->sin6_port);
+    } else {
+        return false;
+    }
+
+    std::array<char, NI_MAXHOST> ipstr{};
+    if (getnameinfo(reinterpret_cast<const struct sockaddr *>(&addr), addr_len,
+            ipstr.data(), static_cast<socklen_t>(ipstr.size()), nullptr,
+            0, NI_NUMERICHOST)) {
+        return false;
+    }
+
+    ip = ipstr.data();
+    return true;
+}
+
+inline void get_local_ip_and_port(socket_t sock, std::string &ip, int &port) {
+    struct sockaddr_storage addr;
+    socklen_t addr_len = sizeof(addr);
+    if (!getsockname(sock, reinterpret_cast<struct sockaddr *>(&addr),
+            &addr_len)) {
+        get_ip_and_port(addr, addr_len, ip, port);
+    }
+}
+
+inline void get_remote_ip_and_port(socket_t sock, std::string &ip, int &port) {
+    struct sockaddr_storage addr;
+    socklen_t addr_len = sizeof(addr);
+
+    if (!getpeername(sock, reinterpret_cast<struct sockaddr *>(&addr),
+            &addr_len)) {
+#ifndef _WIN32
+        if (addr.ss_family == AF_UNIX) {
+#if defined(__linux__)
+            struct ucred ucred;
+            socklen_t len = sizeof(ucred);
+            if (getsockopt(sock, SOL_SOCKET, SO_PEERCRED, &ucred, &len) == 0) {
+                port = ucred.pid;
+            }
+#elif defined(SOL_LOCAL) && defined(SO_PEERPID) // __APPLE__
+            pid_t pid;
+            socklen_t len = sizeof(pid);
+            if (getsockopt(sock, SOL_LOCAL, SO_PEERPID, &pid, &len) == 0) {
+                port = pid;
+            }
+#endif
+            return;
+        }
+#endif
+        get_ip_and_port(addr, addr_len, ip, port);
+    }
+}
+
+inline constexpr unsigned int str2tag_core(const char *s, size_t l,
+    unsigned int h) {
+    return (l == 0)
+               ? h
+               : str2tag_core(
+                   s + 1, l - 1,
+                   // Unsets the 6 high bits of h, therefore no overflow happens
+                   (((std::numeric_limits<unsigned int>::max)() >> 6) &
+                       h * 33) ^
+                       static_cast<unsigned char>(*s));
+}
+
+inline unsigned int str2tag(const std::string &s) {
+    return str2tag_core(s.data(), s.size(), 0);
+}
+
+namespace udl {
+
+inline constexpr unsigned int operator"" _t(const char *s, size_t l) {
+    return str2tag_core(s, l, 0);
+}
+
+} // namespace udl
+
+inline std::string
+find_content_type(const std::string &path,
+    const std::map<std::string, std::string> &user_data,
+    const std::string &default_content_type) {
+    auto ext = file_extension(path);
+
+    auto it = user_data.find(ext);
+    if (it != user_data.end()) { return it->second; }
+
+    using udl::operator""_t;
+
+    switch (str2tag(ext)) {
+    default: return default_content_type;
+
+    case "css"_t: return "text/css";
+    case "csv"_t: return "text/csv";
+    case "htm"_t:
+    case "html"_t: return "text/html";
+    case "js"_t:
+    case "mjs"_t: return "text/javascript";
+    case "txt"_t: return "text/plain";
+    case "vtt"_t: return "text/vtt";
+
+    case "apng"_t: return "image/apng";
+    case "avif"_t: return "image/avif";
+    case "bmp"_t: return "image/bmp";
+    case "gif"_t: return "image/gif";
+    case "png"_t: return "image/png";
+    case "svg"_t: return "image/svg+xml";
+    case "webp"_t: return "image/webp";
+    case "ico"_t: return "image/x-icon";
+    case "tif"_t: return "image/tiff";
+    case "tiff"_t: return "image/tiff";
+    case "jpg"_t:
+    case "jpeg"_t: return "image/jpeg";
+
+    case "mp4"_t: return "video/mp4";
+    case "mpeg"_t: return "video/mpeg";
+    case "webm"_t: return "video/webm";
+
+    case "mp3"_t: return "audio/mp3";
+    case "mpga"_t: return "audio/mpeg";
+    case "weba"_t: return "audio/webm";
+    case "wav"_t: return "audio/wave";
+
+    case "otf"_t: return "font/otf";
+    case "ttf"_t: return "font/ttf";
+    case "woff"_t: return "font/woff";
+    case "woff2"_t: return "font/woff2";
+
+    case "7z"_t: return "application/x-7z-compressed";
+    case "atom"_t: return "application/atom+xml";
+    case "pdf"_t: return "application/pdf";
+    case "json"_t: return "application/json";
+    case "rss"_t: return "application/rss+xml";
+    case "tar"_t: return "application/x-tar";
+    case "xht"_t:
+    case "xhtml"_t: return "application/xhtml+xml";
+    case "xslt"_t: return "application/xslt+xml";
+    case "xml"_t: return "application/xml";
+    case "gz"_t: return "application/gzip";
+    case "zip"_t: return "application/zip";
+    case "wasm"_t: return "application/wasm";
+    }
+}
+
+inline bool can_compress_content_type(const std::string &content_type) {
+    using udl::operator""_t;
+
+    auto tag = str2tag(content_type);
+
+    switch (tag) {
+    case "image/svg+xml"_t:
+    case "application/javascript"_t:
+    case "application/json"_t:
+    case "application/xml"_t:
+    case "application/protobuf"_t:
+    case "application/xhtml+xml"_t: return true;
+
+    default:
+        return !content_type.rfind("text/", 0) && tag != "text/event-stream"_t;
+    }
+}
+
+inline EncodingType encoding_type(const Request &req, const Response &res) {
+    auto ret =
+        detail::can_compress_content_type(res.get_header_value("Content-Type"));
+    if (!ret) { return EncodingType::None; }
+
+    const auto &s = req.get_header_value("Accept-Encoding");
+    (void)(s);
+
+#ifdef CPPHTTPLIB_BROTLI_SUPPORT
+    // TODO: 'Accept-Encoding' has br, not br;q=0
+    ret = s.find("br") != std::string::npos;
+    if (ret) { return EncodingType::Brotli; }
+#endif
+
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+    // TODO: 'Accept-Encoding' has gzip, not gzip;q=0
+    ret = s.find("gzip") != std::string::npos;
+    if (ret) { return EncodingType::Gzip; }
+#endif
+
+    return EncodingType::None;
+}
+
+inline bool nocompressor::compress(const char *data, size_t data_length,
+    bool /*last*/, Callback callback) {
+    if (!data_length) { return true; }
+    return callback(data, data_length);
+}
+
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+inline gzip_compressor::gzip_compressor() {
+    std::memset(&strm_, 0, sizeof(strm_));
+    strm_.zalloc = Z_NULL;
+    strm_.zfree = Z_NULL;
+    strm_.opaque = Z_NULL;
+
+    is_valid_ = deflateInit2(&strm_, Z_DEFAULT_COMPRESSION, Z_DEFLATED, 31, 8,
+                    Z_DEFAULT_STRATEGY) == Z_OK;
+}
+
+inline gzip_compressor::~gzip_compressor() { deflateEnd(&strm_); }
+
+inline bool gzip_compressor::compress(const char *data, size_t data_length,
+    bool last, Callback callback) {
+    assert(is_valid_);
+
+    do {
+        constexpr size_t max_avail_in =
+            (std::numeric_limits<decltype(strm_.avail_in)>::max)();
+
+        strm_.avail_in = static_cast<decltype(strm_.avail_in)>(
+            (std::min)(data_length, max_avail_in));
+        strm_.next_in = const_cast<Bytef *>(reinterpret_cast<const Bytef *>(data));
+
+        data_length -= strm_.avail_in;
+        data += strm_.avail_in;
+
+        auto flush = (last && data_length == 0) ? Z_FINISH : Z_NO_FLUSH;
+        auto ret = Z_OK;
+
+        std::array<char, CPPHTTPLIB_COMPRESSION_BUFSIZ> buff{};
+        do {
+            strm_.avail_out = static_cast<uInt>(buff.size());
+            strm_.next_out = reinterpret_cast<Bytef *>(buff.data());
+
+            ret = deflate(&strm_, flush);
+            if (ret == Z_STREAM_ERROR) { return false; }
+
+            if (!callback(buff.data(), buff.size() - strm_.avail_out)) {
+                return false;
+            }
+        } while (strm_.avail_out == 0);
+
+        assert((flush == Z_FINISH && ret == Z_STREAM_END) ||
+               (flush == Z_NO_FLUSH && ret == Z_OK));
+        assert(strm_.avail_in == 0);
+    } while (data_length > 0);
+
+    return true;
+}
+
+inline gzip_decompressor::gzip_decompressor() {
+    std::memset(&strm_, 0, sizeof(strm_));
+    strm_.zalloc = Z_NULL;
+    strm_.zfree = Z_NULL;
+    strm_.opaque = Z_NULL;
+
+    // 15 is the value of wbits, which should be at the maximum possible value
+    // to ensure that any gzip stream can be decoded. The offset of 32 specifies
+    // that the stream type should be automatically detected either gzip or
+    // deflate.
+    is_valid_ = inflateInit2(&strm_, 32 + 15) == Z_OK;
+}
+
+inline gzip_decompressor::~gzip_decompressor() { inflateEnd(&strm_); }
+
+inline bool gzip_decompressor::is_valid() const { return is_valid_; }
+
+inline bool gzip_decompressor::decompress(const char *data, size_t data_length,
+    Callback callback) {
+    assert(is_valid_);
+
+    auto ret = Z_OK;
+
+    do {
+        constexpr size_t max_avail_in =
+            (std::numeric_limits<decltype(strm_.avail_in)>::max)();
+
+        strm_.avail_in = static_cast<decltype(strm_.avail_in)>(
+            (std::min)(data_length, max_avail_in));
+        strm_.next_in = const_cast<Bytef *>(reinterpret_cast<const Bytef *>(data));
+
+        data_length -= strm_.avail_in;
+        data += strm_.avail_in;
+
+        std::array<char, CPPHTTPLIB_COMPRESSION_BUFSIZ> buff{};
+        while (strm_.avail_in > 0 && ret == Z_OK) {
+            strm_.avail_out = static_cast<uInt>(buff.size());
+            strm_.next_out = reinterpret_cast<Bytef *>(buff.data());
+
+            ret = inflate(&strm_, Z_NO_FLUSH);
+
+            assert(ret != Z_STREAM_ERROR);
+            switch (ret) {
+            case Z_NEED_DICT:
+            case Z_DATA_ERROR:
+            case Z_MEM_ERROR: inflateEnd(&strm_); return false;
+            }
+
+            if (!callback(buff.data(), buff.size() - strm_.avail_out)) {
+                return false;
+            }
+        }
+
+        if (ret != Z_OK && ret != Z_STREAM_END) { return false; }
+
+    } while (data_length > 0);
+
+    return true;
+}
+#endif
+
+#ifdef CPPHTTPLIB_BROTLI_SUPPORT
+inline brotli_compressor::brotli_compressor() {
+    state_ = BrotliEncoderCreateInstance(nullptr, nullptr, nullptr);
+}
+
+inline brotli_compressor::~brotli_compressor() {
+    BrotliEncoderDestroyInstance(state_);
+}
+
+inline bool brotli_compressor::compress(const char *data, size_t data_length,
+    bool last, Callback callback) {
+    std::array<uint8_t, CPPHTTPLIB_COMPRESSION_BUFSIZ> buff{};
+
+    auto operation = last ? BROTLI_OPERATION_FINISH : BROTLI_OPERATION_PROCESS;
+    auto available_in = data_length;
+    auto next_in = reinterpret_cast<const uint8_t *>(data);
+
+    for (;;) {
+        if (last) {
+            if (BrotliEncoderIsFinished(state_)) { break; }
+        } else {
+            if (!available_in) { break; }
+        }
+
+        auto available_out = buff.size();
+        auto next_out = buff.data();
+
+        if (!BrotliEncoderCompressStream(state_, operation, &available_in, &next_in,
+                &available_out, &next_out, nullptr)) {
+            return false;
+        }
+
+        auto output_bytes = buff.size() - available_out;
+        if (output_bytes) {
+            callback(reinterpret_cast<const char *>(buff.data()), output_bytes);
+        }
+    }
+
+    return true;
+}
+
+inline brotli_decompressor::brotli_decompressor() {
+    decoder_s = BrotliDecoderCreateInstance(0, 0, 0);
+    decoder_r = decoder_s ? BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT
+                            : BROTLI_DECODER_RESULT_ERROR;
+}
+
+inline brotli_decompressor::~brotli_decompressor() {
+    if (decoder_s) { BrotliDecoderDestroyInstance(decoder_s); }
+}
+
+inline bool brotli_decompressor::is_valid() const { return decoder_s; }
+
+inline bool brotli_decompressor::decompress(const char *data,
+    size_t data_length,
+    Callback callback) {
+    if (decoder_r == BROTLI_DECODER_RESULT_SUCCESS ||
+        decoder_r == BROTLI_DECODER_RESULT_ERROR) {
+        return 0;
+    }
+
+    auto next_in = reinterpret_cast<const uint8_t *>(data);
+    size_t avail_in = data_length;
+    size_t total_out;
+
+    decoder_r = BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT;
+
+    std::array<char, CPPHTTPLIB_COMPRESSION_BUFSIZ> buff{};
+    while (decoder_r == BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT) {
+        char *next_out = buff.data();
+        size_t avail_out = buff.size();
+
+        decoder_r = BrotliDecoderDecompressStream(
+            decoder_s, &avail_in, &next_in, &avail_out,
+            reinterpret_cast<uint8_t **>(&next_out), &total_out);
+
+        if (decoder_r == BROTLI_DECODER_RESULT_ERROR) { return false; }
+
+        if (!callback(buff.data(), buff.size() - avail_out)) { return false; }
+    }
+
+    return decoder_r == BROTLI_DECODER_RESULT_SUCCESS ||
+           decoder_r == BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT;
+}
+#endif
+
+inline bool has_header(const Headers &headers, const std::string &key) {
+    return headers.find(key) != headers.end();
+}
+
+inline const char *get_header_value(const Headers &headers,
+    const std::string &key, size_t id,
+    const char *def) {
+    auto rng = headers.equal_range(key);
+    auto it = rng.first;
+    std::advance(it, static_cast<ssize_t>(id));
+    if (it != rng.second) { return it->second.c_str(); }
+    return def;
+}
+
+inline bool compare_case_ignore(const std::string &a, const std::string &b) {
+    if (a.size() != b.size()) { return false; }
+    for (size_t i = 0; i < b.size(); i++) {
+        if (::tolower(a[i]) != ::tolower(b[i])) { return false; }
+    }
+    return true;
+}
+
+template <typename T>
+inline bool parse_header(const char *beg, const char *end, T fn) {
+    // Skip trailing spaces and tabs.
+    while (beg < end && is_space_or_tab(end[-1])) {
+        end--;
+    }
+
+    auto p = beg;
+    while (p < end && *p != ':') {
+        p++;
+    }
+
+    if (p == end) { return false; }
+
+    auto key_end = p;
+
+    if (*p++ != ':') { return false; }
+
+    while (p < end && is_space_or_tab(*p)) {
+        p++;
+    }
+
+    if (p < end) {
+        auto key_len = key_end - beg;
+        if (!key_len) { return false; }
+
+        auto key = std::string(beg, key_end);
+        auto val = compare_case_ignore(key, "Location")
+                       ? std::string(p, end)
+                       : decode_url(std::string(p, end), false);
+        fn(std::move(key), std::move(val));
+        return true;
+    }
+
+    return false;
+}
+
+inline bool read_headers(Stream &strm, Headers &headers) {
+    const auto bufsiz = 2048;
+    char buf[bufsiz];
+    stream_line_reader line_reader(strm, buf, bufsiz);
+
+    for (;;) {
+        if (!line_reader.getline()) { return false; }
+
+        // Check if the line ends with CRLF.
+        auto line_terminator_len = 2;
+        if (line_reader.end_with_crlf()) {
+            // Blank line indicates end of headers.
+            if (line_reader.size() == 2) { break; }
+#ifdef CPPHTTPLIB_ALLOW_LF_AS_LINE_TERMINATOR
+        } else {
+            // Blank line indicates end of headers.
+            if (line_reader.size() == 1) { break; }
+            line_terminator_len = 1;
+        }
+#else
+        } else {
+            continue; // Skip invalid line.
+        }
+#endif
+
+        if (line_reader.size() > CPPHTTPLIB_HEADER_MAX_LENGTH) { return false; }
+
+        // Exclude line terminator
+        auto end = line_reader.ptr() + line_reader.size() - line_terminator_len;
+
+        parse_header(line_reader.ptr(), end,
+            [&](std::string &&key, std::string &&val) {
+                headers.emplace(std::move(key), std::move(val));
+            });
+    }
+
+    return true;
+}
+
+inline bool read_content_with_length(Stream &strm, uint64_t len,
+    Progress progress,
+    ContentReceiverWithProgress out) {
+    char buf[CPPHTTPLIB_RECV_BUFSIZ];
+
+    uint64_t r = 0;
+    while (r < len) {
+        auto read_len = static_cast<size_t>(len - r);
+        auto n = strm.read(buf, (std::min)(read_len, CPPHTTPLIB_RECV_BUFSIZ));
+        if (n <= 0) { return false; }
+
+        if (!out(buf, static_cast<size_t>(n), r, len)) { return false; }
+        r += static_cast<uint64_t>(n);
+
+        if (progress) {
+            if (!progress(r, len)) { return false; }
+        }
+    }
+
+    return true;
+}
+
+inline void skip_content_with_length(Stream &strm, uint64_t len) {
+    char buf[CPPHTTPLIB_RECV_BUFSIZ];
+    uint64_t r = 0;
+    while (r < len) {
+        auto read_len = static_cast<size_t>(len - r);
+        auto n = strm.read(buf, (std::min)(read_len, CPPHTTPLIB_RECV_BUFSIZ));
+        if (n <= 0) { return; }
+        r += static_cast<uint64_t>(n);
+    }
+}
+
+inline bool read_content_without_length(Stream &strm,
+    ContentReceiverWithProgress out) {
+    char buf[CPPHTTPLIB_RECV_BUFSIZ];
+    uint64_t r = 0;
+    for (;;) {
+        auto n = strm.read(buf, CPPHTTPLIB_RECV_BUFSIZ);
+        if (n < 0) {
+            return false;
+        } else if (n == 0) {
+            return true;
+        }
+
+        if (!out(buf, static_cast<size_t>(n), r, 0)) { return false; }
+        r += static_cast<uint64_t>(n);
+    }
+
+    return true;
+}
+
+template <typename T>
+inline bool read_content_chunked(Stream &strm, T &x,
+    ContentReceiverWithProgress out) {
+    const auto bufsiz = 16;
+    char buf[bufsiz];
+
+    stream_line_reader line_reader(strm, buf, bufsiz);
+
+    if (!line_reader.getline()) { return false; }
+
+    unsigned long chunk_len;
+    while (true) {
+        char *end_ptr;
+
+        chunk_len = std::strtoul(line_reader.ptr(), &end_ptr, 16);
+
+        if (end_ptr == line_reader.ptr()) { return false; }
+        if (chunk_len == ULONG_MAX) { return false; }
+
+        if (chunk_len == 0) { break; }
+
+        if (!read_content_with_length(strm, chunk_len, nullptr, out)) {
+            return false;
+        }
+
+        if (!line_reader.getline()) { return false; }
+
+        if (strcmp(line_reader.ptr(), "\r\n") != 0) { return false; }
+
+        if (!line_reader.getline()) { return false; }
+    }
+
+    assert(chunk_len == 0);
+
+    // Trailer
+    if (!line_reader.getline()) { return false; }
+
+    while (strcmp(line_reader.ptr(), "\r\n") != 0) {
+        if (line_reader.size() > CPPHTTPLIB_HEADER_MAX_LENGTH) { return false; }
+
+        // Exclude line terminator
+        constexpr auto line_terminator_len = 2;
+        auto end = line_reader.ptr() + line_reader.size() - line_terminator_len;
+
+        parse_header(line_reader.ptr(), end,
+            [&](std::string &&key, std::string &&val) {
+                x.headers.emplace(std::move(key), std::move(val));
+            });
+
+        if (!line_reader.getline()) { return false; }
+    }
+
+    return true;
+}
+
+inline bool is_chunked_transfer_encoding(const Headers &headers) {
+    return !strcasecmp(get_header_value(headers, "Transfer-Encoding", 0, ""),
+        "chunked");
+}
+
+template <typename T, typename U>
+bool prepare_content_receiver(T &x, int &status,
+    ContentReceiverWithProgress receiver,
+    bool decompress, U callback) {
+    if (decompress) {
+        std::string encoding = x.get_header_value("Content-Encoding");
+        std::unique_ptr<decompressor> decompressor;
+
+        if (encoding == "gzip" || encoding == "deflate") {
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+            decompressor = detail::make_unique<gzip_decompressor>();
+#else
+            status = StatusCode::UnsupportedMediaType_415;
+            return false;
+#endif
+        } else if (encoding.find("br") != std::string::npos) {
+#ifdef CPPHTTPLIB_BROTLI_SUPPORT
+            decompressor = detail::make_unique<brotli_decompressor>();
+#else
+            status = StatusCode::UnsupportedMediaType_415;
+            return false;
+#endif
+        }
+
+        if (decompressor) {
+            if (decompressor->is_valid()) {
+                ContentReceiverWithProgress out = [&](const char *buf, size_t n,
+                                                      uint64_t off, uint64_t len) {
+                    return decompressor->decompress(buf, n,
+                        [&](const char *buf2, size_t n2) {
+                            return receiver(buf2, n2, off, len);
+                        });
+                };
+                return callback(std::move(out));
+            } else {
+                status = StatusCode::InternalServerError_500;
+                return false;
+            }
+        }
+    }
+
+    ContentReceiverWithProgress out = [&](const char *buf, size_t n, uint64_t off,
+                                          uint64_t len) {
+        return receiver(buf, n, off, len);
+    };
+    return callback(std::move(out));
+}
+
+template <typename T>
+bool read_content(Stream &strm, T &x, size_t payload_max_length, int &status,
+    Progress progress, ContentReceiverWithProgress receiver,
+    bool decompress) {
+    return prepare_content_receiver(
+        x, status, std::move(receiver), decompress,
+        [&](const ContentReceiverWithProgress &out) {
+            auto ret = true;
+            auto exceed_payload_max_length = false;
+
+            if (is_chunked_transfer_encoding(x.headers)) {
+                ret = read_content_chunked(strm, x, out);
+            } else if (!has_header(x.headers, "Content-Length")) {
+                ret = read_content_without_length(strm, out);
+            } else {
+                auto len = get_header_value_u64(x.headers, "Content-Length", 0, 0);
+                if (len > payload_max_length) {
+                    exceed_payload_max_length = true;
+                    skip_content_with_length(strm, len);
+                    ret = false;
+                } else if (len > 0) {
+                    ret = read_content_with_length(strm, len, std::move(progress), out);
+                }
+            }
+
+            if (!ret) {
+                status = exceed_payload_max_length ? StatusCode::PayloadTooLarge_413
+                                                     : StatusCode::BadRequest_400;
+            }
+            return ret;
+        });
+} // namespace detail
+
+inline ssize_t write_headers(Stream &strm, const Headers &headers) {
+    ssize_t write_len = 0;
+    for (const auto &x : headers) {
+        auto len =
+            strm.write_format("%s: %s\r\n", x.first.c_str(), x.second.c_str());
+        if (len < 0) { return len; }
+        write_len += len;
+    }
+    auto len = strm.write("\r\n");
+    if (len < 0) { return len; }
+    write_len += len;
+    return write_len;
+}
+
+inline bool write_data(Stream &strm, const char *d, size_t l) {
+    size_t offset = 0;
+    while (offset < l) {
+        auto length = strm.write(d + offset, l - offset);
+        if (length < 0) { return false; }
+        offset += static_cast<size_t>(length);
+    }
+    return true;
+}
+
+template <typename T>
+inline bool write_content(Stream &strm, const ContentProvider &content_provider,
+    size_t offset, size_t length, T is_shutting_down,
+    Error &error) {
+    size_t end_offset = offset + length;
+    auto ok = true;
+    DataSink data_sink;
+
+    data_sink.write = [&](const char *d, size_t l) -> bool {
+        if (ok) {
+            if (strm.is_writable() && write_data(strm, d, l)) {
+                offset += l;
+            } else {
+                ok = false;
+            }
+        }
+        return ok;
+    };
+
+    data_sink.is_writable = [&]() -> bool { return strm.is_writable(); };
+
+    while (offset < end_offset && !is_shutting_down()) {
+        if (!strm.is_writable()) {
+            error = Error::Write;
+            return false;
+        } else if (!content_provider(offset, end_offset - offset, data_sink)) {
+            error = Error::Canceled;
+            return false;
+        } else if (!ok) {
+            error = Error::Write;
+            return false;
+        }
+    }
+
+    error = Error::Success;
+    return true;
+}
+
+template <typename T>
+inline bool write_content(Stream &strm, const ContentProvider &content_provider,
+    size_t offset, size_t length,
+    const T &is_shutting_down) {
+    auto error = Error::Success;
+    return write_content(strm, content_provider, offset, length, is_shutting_down,
+        error);
+}
+
+template <typename T>
+inline bool
+write_content_without_length(Stream &strm,
+    const ContentProvider &content_provider,
+    const T &is_shutting_down) {
+    size_t offset = 0;
+    auto data_available = true;
+    auto ok = true;
+    DataSink data_sink;
+
+    data_sink.write = [&](const char *d, size_t l) -> bool {
+        if (ok) {
+            offset += l;
+            if (!strm.is_writable() || !write_data(strm, d, l)) { ok = false; }
+        }
+        return ok;
+    };
+
+    data_sink.is_writable = [&]() -> bool { return strm.is_writable(); };
+
+    data_sink.done = [&](void) { data_available = false; };
+
+    while (data_available && !is_shutting_down()) {
+        if (!strm.is_writable()) {
+            return false;
+        } else if (!content_provider(offset, 0, data_sink)) {
+            return false;
+        } else if (!ok) {
+            return false;
+        }
+    }
+    return true;
+}
+
+template <typename T, typename U>
+inline bool
+write_content_chunked(Stream &strm, const ContentProvider &content_provider,
+    const T &is_shutting_down, U &compressor, Error &error) {
+    size_t offset = 0;
+    auto data_available = true;
+    auto ok = true;
+    DataSink data_sink;
+
+    data_sink.write = [&](const char *d, size_t l) -> bool {
+        if (ok) {
+            data_available = l > 0;
+            offset += l;
+
+            std::string payload;
+            if (compressor.compress(d, l, false,
+                    [&](const char *data, size_t data_len) {
+                        payload.append(data, data_len);
+                        return true;
+                    })) {
+                if (!payload.empty()) {
+                    // Emit chunked response header and footer for each chunk
+                    auto chunk =
+                        from_i_to_hex(payload.size()) + "\r\n" + payload + "\r\n";
+                    if (!strm.is_writable() ||
+                        !write_data(strm, chunk.data(), chunk.size())) {
+                        ok = false;
+                    }
+                }
+            } else {
+                ok = false;
+            }
+        }
+        return ok;
+    };
+
+    data_sink.is_writable = [&]() -> bool { return strm.is_writable(); };
+
+    auto done_with_trailer = [&](const Headers *trailer) {
+        if (!ok) { return; }
+
+        data_available = false;
+
+        std::string payload;
+        if (!compressor.compress(nullptr, 0, true,
+                [&](const char *data, size_t data_len) {
+                    payload.append(data, data_len);
+                    return true;
+                })) {
+            ok = false;
+            return;
+        }
+
+        if (!payload.empty()) {
+            // Emit chunked response header and footer for each chunk
+            auto chunk = from_i_to_hex(payload.size()) + "\r\n" + payload + "\r\n";
+            if (!strm.is_writable() ||
+                !write_data(strm, chunk.data(), chunk.size())) {
+                ok = false;
+                return;
+            }
+        }
+
+        static const std::string done_marker("0\r\n");
+        if (!write_data(strm, done_marker.data(), done_marker.size())) {
+            ok = false;
+        }
+
+        // Trailer
+        if (trailer) {
+            for (const auto &kv : *trailer) {
+                std::string field_line = kv.first + ": " + kv.second + "\r\n";
+                if (!write_data(strm, field_line.data(), field_line.size())) {
+                    ok = false;
+                }
+            }
+        }
+
+        static const std::string crlf("\r\n");
+        if (!write_data(strm, crlf.data(), crlf.size())) { ok = false; }
+    };
+
+    data_sink.done = [&](void) { done_with_trailer(nullptr); };
+
+    data_sink.done_with_trailer = [&](const Headers &trailer) {
+        done_with_trailer(&trailer);
+    };
+
+    while (data_available && !is_shutting_down()) {
+        if (!strm.is_writable()) {
+            error = Error::Write;
+            return false;
+        } else if (!content_provider(offset, 0, data_sink)) {
+            error = Error::Canceled;
+            return false;
+        } else if (!ok) {
+            error = Error::Write;
+            return false;
+        }
+    }
+
+    error = Error::Success;
+    return true;
+}
+
+template <typename T, typename U>
+inline bool write_content_chunked(Stream &strm,
+    const ContentProvider &content_provider,
+    const T &is_shutting_down, U &compressor) {
+    auto error = Error::Success;
+    return write_content_chunked(strm, content_provider, is_shutting_down,
+        compressor, error);
+}
+
+template <typename T>
+inline bool redirect(T &cli, Request &req, Response &res,
+    const std::string &path, const std::string &location,
+    Error &error) {
+    Request new_req = req;
+    new_req.path = path;
+    new_req.redirect_count_ -= 1;
+
+    if (res.status == StatusCode::SeeOther_303 &&
+        (req.method != "GET" && req.method != "HEAD")) {
+        new_req.method = "GET";
+        new_req.body.clear();
+        new_req.headers.clear();
+    }
+
+    Response new_res;
+
+    auto ret = cli.send(new_req, new_res, error);
+    if (ret) {
+        req = new_req;
+        res = new_res;
+
+        if (res.location.empty()) { res.location = location; }
+    }
+    return ret;
+}
+
+inline std::string params_to_query_str(const Params &params) {
+    std::string query;
+
+    for (auto it = params.begin(); it != params.end(); ++it) {
+        if (it != params.begin()) { query += "&"; }
+        query += it->first;
+        query += "=";
+        query += encode_query_param(it->second);
+    }
+    return query;
+}
+
+inline void parse_query_text(const std::string &s, Params &params) {
+    std::set<std::string> cache;
+    split(s.data(), s.data() + s.size(), '&', [&](const char *b, const char *e) {
+        std::string kv(b, e);
+        if (cache.find(kv) != cache.end()) { return; }
+        cache.insert(kv);
+
+        std::string key;
+        std::string val;
+        split(b, e, '=', [&](const char *b2, const char *e2) {
+            if (key.empty()) {
+                key.assign(b2, e2);
+            } else {
+                val.assign(b2, e2);
+            }
+        });
+
+        if (!key.empty()) {
+            params.emplace(decode_url(key, true), decode_url(val, true));
+        }
+    });
+}
+
+inline bool parse_multipart_boundary(const std::string &content_type,
+    std::string &boundary) {
+    auto boundary_keyword = "boundary=";
+    auto pos = content_type.find(boundary_keyword);
+    if (pos == std::string::npos) { return false; }
+    auto end = content_type.find(';', pos);
+    auto beg = pos + strlen(boundary_keyword);
+    boundary = trim_double_quotes_copy(content_type.substr(beg, end - beg));
+    return !boundary.empty();
+}
+
+inline void parse_disposition_params(const std::string &s, Params &params) {
+    std::set<std::string> cache;
+    split(s.data(), s.data() + s.size(), ';', [&](const char *b, const char *e) {
+        std::string kv(b, e);
+        if (cache.find(kv) != cache.end()) { return; }
+        cache.insert(kv);
+
+        std::string key;
+        std::string val;
+        split(b, e, '=', [&](const char *b2, const char *e2) {
+            if (key.empty()) {
+                key.assign(b2, e2);
+            } else {
+                val.assign(b2, e2);
+            }
+        });
+
+        if (!key.empty()) {
+            params.emplace(trim_double_quotes_copy((key)),
+                trim_double_quotes_copy((val)));
+        }
+    });
+}
+
+#ifdef CPPHTTPLIB_NO_EXCEPTIONS
+inline bool parse_range_header(const std::string &s, Ranges &ranges) {
+#else
+inline bool parse_range_header(const std::string &s, Ranges &ranges) try {
+#endif
+    static auto re_first_range = std::regex(R"(bytes=(\d*-\d*(?:,\s*\d*-\d*)*))");
+    std::smatch m;
+    if (std::regex_match(s, m, re_first_range)) {
+        auto pos = static_cast<size_t>(m.position(1));
+        auto len = static_cast<size_t>(m.length(1));
+        auto all_valid_ranges = true;
+        split(&s[pos], &s[pos + len], ',', [&](const char *b, const char *e) {
+            if (!all_valid_ranges) { return; }
+            static auto re_another_range = std::regex(R"(\s*(\d*)-(\d*))");
+            std::cmatch cm;
+            if (std::regex_match(b, e, cm, re_another_range)) {
+                ssize_t first = -1;
+                if (!cm.str(1).empty()) {
+                    first = static_cast<ssize_t>(std::stoll(cm.str(1)));
+                }
+
+                ssize_t last = -1;
+                if (!cm.str(2).empty()) {
+                    last = static_cast<ssize_t>(std::stoll(cm.str(2)));
+                }
+
+                if (first != -1 && last != -1 && first > last) {
+                    all_valid_ranges = false;
+                    return;
+                }
+                ranges.emplace_back(std::make_pair(first, last));
+            }
+        });
+        return all_valid_ranges;
+    }
+    return false;
+#ifdef CPPHTTPLIB_NO_EXCEPTIONS
+}
+#else
+} catch (...) { return false; }
+#endif
+
+class MultipartFormDataParser {
+public:
+    MultipartFormDataParser() = default;
+
+    void set_boundary(std::string &&boundary) {
+        boundary_ = boundary;
+        dash_boundary_crlf_ = dash_ + boundary_ + crlf_;
+        crlf_dash_boundary_ = crlf_ + dash_ + boundary_;
+    }
+
+    bool is_valid() const { return is_valid_; }
+
+    bool parse(const char *buf, size_t n, const ContentReceiver &content_callback,
+        const MultipartContentHeader &header_callback) {
+
+        buf_append(buf, n);
+
+        while (buf_size() > 0) {
+            switch (state_) {
+            case 0: { // Initial boundary
+                buf_erase(buf_find(dash_boundary_crlf_));
+                if (dash_boundary_crlf_.size() > buf_size()) { return true; }
+                if (!buf_start_with(dash_boundary_crlf_)) { return false; }
+                buf_erase(dash_boundary_crlf_.size());
+                state_ = 1;
+                break;
+            }
+            case 1: { // New entry
+                clear_file_info();
+                state_ = 2;
+                break;
+            }
+            case 2: { // Headers
+                auto pos = buf_find(crlf_);
+                if (pos > CPPHTTPLIB_HEADER_MAX_LENGTH) { return false; }
+                while (pos < buf_size()) {
+                    // Empty line
+                    if (pos == 0) {
+                        if (!header_callback(file_)) {
+                            is_valid_ = false;
+                            return false;
+                        }
+                        buf_erase(crlf_.size());
+                        state_ = 3;
+                        break;
+                    }
+
+                    const auto header = buf_head(pos);
+
+                    if (!parse_header(header.data(), header.data() + header.size(),
+                            [&](std::string &&, std::string &&) {})) {
+                        is_valid_ = false;
+                        return false;
+                    }
+
+                    static const std::string header_content_type = "Content-Type:";
+
+                    if (start_with_case_ignore(header, header_content_type)) {
+                        file_.content_type =
+                            trim_copy(header.substr(header_content_type.size()));
+                    } else {
+                        static const std::regex re_content_disposition(
+                            R"~(^Content-Disposition:\s*form-data;\s*(.*)$)~",
+                            std::regex_constants::icase);
+
+                        std::smatch m;
+                        if (std::regex_match(header, m, re_content_disposition)) {
+                            Params params;
+                            parse_disposition_params(m[1], params);
+
+                            auto it = params.find("name");
+                            if (it != params.end()) {
+                                file_.name = it->second;
+                            } else {
+                                is_valid_ = false;
+                                return false;
+                            }
+
+                            it = params.find("filename");
+                            if (it != params.end()) { file_.filename = it->second; }
+
+                            it = params.find("filename*");
+                            if (it != params.end()) {
+                                // Only allow UTF-8 enconnding...
+                                static const std::regex re_rfc5987_encoding(
+                                    R"~(^UTF-8''(.+?)$)~", std::regex_constants::icase);
+
+                                std::smatch m2;
+                                if (std::regex_match(it->second, m2, re_rfc5987_encoding)) {
+                                    file_.filename = decode_url(m2[1], false); // override...
+                                } else {
+                                    is_valid_ = false;
+                                    return false;
+                                }
+                            }
+                        }
+                    }
+                    buf_erase(pos + crlf_.size());
+                    pos = buf_find(crlf_);
+                }
+                if (state_ != 3) { return true; }
+                break;
+            }
+            case 3: { // Body
+                if (crlf_dash_boundary_.size() > buf_size()) { return true; }
+                auto pos = buf_find(crlf_dash_boundary_);
+                if (pos < buf_size()) {
+                    if (!content_callback(buf_data(), pos)) {
+                        is_valid_ = false;
+                        return false;
+                    }
+                    buf_erase(pos + crlf_dash_boundary_.size());
+                    state_ = 4;
+                } else {
+                    auto len = buf_size() - crlf_dash_boundary_.size();
+                    if (len > 0) {
+                        if (!content_callback(buf_data(), len)) {
+                            is_valid_ = false;
+                            return false;
+                        }
+                        buf_erase(len);
+                    }
+                    return true;
+                }
+                break;
+            }
+            case 4: { // Boundary
+                if (crlf_.size() > buf_size()) { return true; }
+                if (buf_start_with(crlf_)) {
+                    buf_erase(crlf_.size());
+                    state_ = 1;
+                } else {
+                    if (dash_.size() > buf_size()) { return true; }
+                    if (buf_start_with(dash_)) {
+                        buf_erase(dash_.size());
+                        is_valid_ = true;
+                        buf_erase(buf_size()); // Remove epilogue
+                    } else {
+                        return true;
+                    }
+                }
+                break;
+            }
+            }
+        }
+
+        return true;
+    }
+
+private:
+    void clear_file_info() {
+        file_.name.clear();
+        file_.filename.clear();
+        file_.content_type.clear();
+    }
+
+    bool start_with_case_ignore(const std::string &a,
+        const std::string &b) const {
+        if (a.size() < b.size()) { return false; }
+        for (size_t i = 0; i < b.size(); i++) {
+            if (::tolower(a[i]) != ::tolower(b[i])) { return false; }
+        }
+        return true;
+    }
+
+    const std::string dash_ = "--";
+    const std::string crlf_ = "\r\n";
+    std::string boundary_;
+    std::string dash_boundary_crlf_;
+    std::string crlf_dash_boundary_;
+
+    size_t state_ = 0;
+    bool is_valid_ = false;
+    MultipartFormData file_;
+
+    // Buffer
+    bool start_with(const std::string &a, size_t spos, size_t epos,
+        const std::string &b) const {
+        if (epos - spos < b.size()) { return false; }
+        for (size_t i = 0; i < b.size(); i++) {
+            if (a[i + spos] != b[i]) { return false; }
+        }
+        return true;
+    }
+
+    size_t buf_size() const { return buf_epos_ - buf_spos_; }
+
+    const char *buf_data() const { return &buf_[buf_spos_]; }
+
+    std::string buf_head(size_t l) const { return buf_.substr(buf_spos_, l); }
+
+    bool buf_start_with(const std::string &s) const {
+        return start_with(buf_, buf_spos_, buf_epos_, s);
+    }
+
+    size_t buf_find(const std::string &s) const {
+        auto c = s.front();
+
+        size_t off = buf_spos_;
+        while (off < buf_epos_) {
+            auto pos = off;
+            while (true) {
+                if (pos == buf_epos_) { return buf_size(); }
+                if (buf_[pos] == c) { break; }
+                pos++;
+            }
+
+            auto remaining_size = buf_epos_ - pos;
+            if (s.size() > remaining_size) { return buf_size(); }
+
+            if (start_with(buf_, pos, buf_epos_, s)) { return pos - buf_spos_; }
+
+            off = pos + 1;
+        }
+
+        return buf_size();
+    }
+
+    void buf_append(const char *data, size_t n) {
+        auto remaining_size = buf_size();
+        if (remaining_size > 0 && buf_spos_ > 0) {
+            for (size_t i = 0; i < remaining_size; i++) {
+                buf_[i] = buf_[buf_spos_ + i];
+            }
+        }
+        buf_spos_ = 0;
+        buf_epos_ = remaining_size;
+
+        if (remaining_size + n > buf_.size()) { buf_.resize(remaining_size + n); }
+
+        for (size_t i = 0; i < n; i++) {
+            buf_[buf_epos_ + i] = data[i];
+        }
+        buf_epos_ += n;
+    }
+
+    void buf_erase(size_t size) { buf_spos_ += size; }
+
+    std::string buf_;
+    size_t buf_spos_ = 0;
+    size_t buf_epos_ = 0;
+};
+
+inline std::string to_lower(const char *beg, const char *end) {
+    std::string out;
+    auto it = beg;
+    while (it != end) {
+        out += static_cast<char>(::tolower(*it));
+        it++;
+    }
+    return out;
+}
+
+inline std::string make_multipart_data_boundary() {
+    static const char data[] =
+        "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
+
+    // std::random_device might actually be deterministic on some
+    // platforms, but due to lack of support in the c++ standard library,
+    // doing better requires either some ugly hacks or breaking portability.
+    std::random_device seed_gen;
+
+    // Request 128 bits of entropy for initialization
+    std::seed_seq seed_sequence{seed_gen(), seed_gen(), seed_gen(), seed_gen()};
+    std::mt19937 engine(seed_sequence);
+
+    std::string result = "--cpp-httplib-multipart-data-";
+
+    for (auto i = 0; i < 16; i++) {
+        result += data[engine() % (sizeof(data) - 1)];
+    }
+
+    return result;
+}
+
+inline bool is_multipart_boundary_chars_valid(const std::string &boundary) {
+    auto valid = true;
+    for (size_t i = 0; i < boundary.size(); i++) {
+        auto c = boundary[i];
+        if (!std::isalnum(c) && c != '-' && c != '_') {
+            valid = false;
+            break;
+        }
+    }
+    return valid;
+}
+
+template <typename T>
+inline std::string
+serialize_multipart_formdata_item_begin(const T &item,
+    const std::string &boundary) {
+    std::string body = "--" + boundary + "\r\n";
+    body += "Content-Disposition: form-data; name=\"" + item.name + "\"";
+    if (!item.filename.empty()) {
+        body += "; filename=\"" + item.filename + "\"";
+    }
+    body += "\r\n";
+    if (!item.content_type.empty()) {
+        body += "Content-Type: " + item.content_type + "\r\n";
+    }
+    body += "\r\n";
+
+    return body;
+}
+
+inline std::string serialize_multipart_formdata_item_end() { return "\r\n"; }
+
+inline std::string
+serialize_multipart_formdata_finish(const std::string &boundary) {
+    return "--" + boundary + "--\r\n";
+}
+
+inline std::string
+serialize_multipart_formdata_get_content_type(const std::string &boundary) {
+    return "multipart/form-data; boundary=" + boundary;
+}
+
+inline std::string
+serialize_multipart_formdata(const MultipartFormDataItems &items,
+    const std::string &boundary, bool finish = true) {
+    std::string body;
+
+    for (const auto &item : items) {
+        body += serialize_multipart_formdata_item_begin(item, boundary);
+        body += item.content + serialize_multipart_formdata_item_end();
+    }
+
+    if (finish) { body += serialize_multipart_formdata_finish(boundary); }
+
+    return body;
+}
+
+inline std::pair<size_t, size_t>
+get_range_offset_and_length(const Request &req, size_t content_length,
+    size_t index) {
+    auto r = req.ranges[index];
+
+    if (r.first == -1 && r.second == -1) {
+        return std::make_pair(0, content_length);
+    }
+
+    auto slen = static_cast<ssize_t>(content_length);
+
+    if (r.first == -1) {
+        r.first = (std::max)(static_cast<ssize_t>(0), slen - r.second);
+        r.second = slen - 1;
+    }
+
+    if (r.second == -1) { r.second = slen - 1; }
+    return std::make_pair(r.first, static_cast<size_t>(r.second - r.first) + 1);
+}
+
+inline std::string
+make_content_range_header_field(const std::pair<ssize_t, ssize_t> &range,
+    size_t content_length) {
+    std::string field = "bytes ";
+    if (range.first != -1) { field += std::to_string(range.first); }
+    field += "-";
+    if (range.second != -1) { field += std::to_string(range.second); }
+    field += "/";
+    field += std::to_string(content_length);
+    return field;
+}
+
+template <typename SToken, typename CToken, typename Content>
+bool process_multipart_ranges_data(const Request &req, Response &res,
+    const std::string &boundary,
+    const std::string &content_type,
+    SToken stoken, CToken ctoken,
+    Content content) {
+    for (size_t i = 0; i < req.ranges.size(); i++) {
+        ctoken("--");
+        stoken(boundary);
+        ctoken("\r\n");
+        if (!content_type.empty()) {
+            ctoken("Content-Type: ");
+            stoken(content_type);
+            ctoken("\r\n");
+        }
+
+        ctoken("Content-Range: ");
+        const auto &range = req.ranges[i];
+        stoken(make_content_range_header_field(range, res.content_length_));
+        ctoken("\r\n");
+        ctoken("\r\n");
+
+        auto offsets = get_range_offset_and_length(req, res.content_length_, i);
+        auto offset = offsets.first;
+        auto length = offsets.second;
+        if (!content(offset, length)) { return false; }
+        ctoken("\r\n");
+    }
+
+    ctoken("--");
+    stoken(boundary);
+    ctoken("--");
+
+    return true;
+}
+
+inline bool make_multipart_ranges_data(const Request &req, Response &res,
+    const std::string &boundary,
+    const std::string &content_type,
+    std::string &data) {
+    return process_multipart_ranges_data(
+        req, res, boundary, content_type,
+        [&](const std::string &token) { data += token; },
+        [&](const std::string &token) { data += token; },
+        [&](size_t offset, size_t length) {
+            if (offset < res.body.size()) {
+                data += res.body.substr(offset, length);
+                return true;
+            }
+            return false;
+        });
+}
+
+inline size_t
+get_multipart_ranges_data_length(const Request &req, Response &res,
+    const std::string &boundary,
+    const std::string &content_type) {
+    size_t data_length = 0;
+
+    process_multipart_ranges_data(
+        req, res, boundary, content_type,
+        [&](const std::string &token) { data_length += token.size(); },
+        [&](const std::string &token) { data_length += token.size(); },
+        [&](size_t /*offset*/, size_t length) {
+            data_length += length;
+            return true;
+        });
+
+    return data_length;
+}
+
+template <typename T>
+inline bool write_multipart_ranges_data(Stream &strm, const Request &req,
+    Response &res,
+    const std::string &boundary,
+    const std::string &content_type,
+    const T &is_shutting_down) {
+    return process_multipart_ranges_data(
+        req, res, boundary, content_type,
+        [&](const std::string &token) { strm.write(token); },
+        [&](const std::string &token) { strm.write(token); },
+        [&](size_t offset, size_t length) {
+            return write_content(strm, res.content_provider_, offset, length,
+                is_shutting_down);
+        });
+}
+
+inline std::pair<size_t, size_t>
+get_range_offset_and_length(const Request &req, const Response &res,
+    size_t index) {
+    auto r = req.ranges[index];
+
+    if (r.second == -1) {
+        r.second = static_cast<ssize_t>(res.content_length_) - 1;
+    }
+
+    return std::make_pair(r.first, r.second - r.first + 1);
+}
+
+inline bool expect_content(const Request &req) {
+    if (req.method == "POST" || req.method == "PUT" || req.method == "PATCH" ||
+        req.method == "PRI" || req.method == "DELETE") {
+        return true;
+    }
+    // TODO: check if Content-Length is set
+    return false;
+}
+
+inline bool has_crlf(const std::string &s) {
+    auto p = s.c_str();
+    while (*p) {
+        if (*p == '\r' || *p == '\n') { return true; }
+        p++;
+    }
+    return false;
+}
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+inline std::string message_digest(const std::string &s, const EVP_MD *algo) {
+    auto context = std::unique_ptr<EVP_MD_CTX, decltype(&EVP_MD_CTX_free)>(
+        EVP_MD_CTX_new(), EVP_MD_CTX_free);
+
+    unsigned int hash_length = 0;
+    unsigned char hash[EVP_MAX_MD_SIZE];
+
+    EVP_DigestInit_ex(context.get(), algo, nullptr);
+    EVP_DigestUpdate(context.get(), s.c_str(), s.size());
+    EVP_DigestFinal_ex(context.get(), hash, &hash_length);
+
+    std::stringstream ss;
+    for (auto i = 0u; i < hash_length; ++i) {
+        ss << std::hex << std::setw(2) << std::setfill('0')
+           << static_cast<unsigned int>(hash[i]);
+    }
+
+    return ss.str();
+}
+
+inline std::string MD5(const std::string &s) {
+    return message_digest(s, EVP_md5());
+}
+
+inline std::string SHA_256(const std::string &s) {
+    return message_digest(s, EVP_sha256());
+}
+
+inline std::string SHA_512(const std::string &s) {
+    return message_digest(s, EVP_sha512());
+}
+#endif
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+#ifdef _WIN32
+// NOTE: This code came up with the following stackoverflow post:
+// https://stackoverflow.com/questions/9507184/can-openssl-on-windows-use-the-system-certificate-store
+inline bool load_system_certs_on_windows(X509_STORE *store) {
+    auto hStore = CertOpenSystemStoreW((HCRYPTPROV_LEGACY)NULL, L"ROOT");
+    if (!hStore) { return false; }
+
+    auto result = false;
+    PCCERT_CONTEXT pContext = NULL;
+    while ((pContext = CertEnumCertificatesInStore(hStore, pContext)) !=
+           nullptr) {
+        auto encoded_cert =
+            static_cast<const unsigned char *>(pContext->pbCertEncoded);
+
+        auto x509 = d2i_X509(NULL, &encoded_cert, pContext->cbCertEncoded);
+        if (x509) {
+            X509_STORE_add_cert(store, x509);
+            X509_free(x509);
+            result = true;
+        }
+    }
+
+    CertFreeCertificateContext(pContext);
+    CertCloseStore(hStore, 0);
+
+    return result;
+}
+#elif defined(CPPHTTPLIB_USE_CERTS_FROM_MACOSX_KEYCHAIN) && defined(__APPLE__)
+#if TARGET_OS_OSX
+template <typename T>
+using CFObjectPtr =
+    std::unique_ptr<typename std::remove_pointer<T>::type, void (*)(CFTypeRef)>;
+
+inline void cf_object_ptr_deleter(CFTypeRef obj) {
+    if (obj) { CFRelease(obj); }
+}
+
+inline bool retrieve_certs_from_keychain(CFObjectPtr<CFArrayRef> &certs) {
+    CFStringRef keys[] = {kSecClass, kSecMatchLimit, kSecReturnRef};
+    CFTypeRef values[] = {kSecClassCertificate, kSecMatchLimitAll,
+        kCFBooleanTrue};
+
+    CFObjectPtr<CFDictionaryRef> query(
+        CFDictionaryCreate(nullptr, reinterpret_cast<const void **>(keys), values,
+            sizeof(keys) / sizeof(keys[0]),
+            &kCFTypeDictionaryKeyCallBacks,
+            &kCFTypeDictionaryValueCallBacks),
+        cf_object_ptr_deleter);
+
+    if (!query) { return false; }
+
+    CFTypeRef security_items = nullptr;
+    if (SecItemCopyMatching(query.get(), &security_items) != errSecSuccess ||
+        CFArrayGetTypeID() != CFGetTypeID(security_items)) {
+        return false;
+    }
+
+    certs.reset(reinterpret_cast<CFArrayRef>(security_items));
+    return true;
+}
+
+inline bool retrieve_root_certs_from_keychain(CFObjectPtr<CFArrayRef> &certs) {
+    CFArrayRef root_security_items = nullptr;
+    if (SecTrustCopyAnchorCertificates(&root_security_items) != errSecSuccess) {
+        return false;
+    }
+
+    certs.reset(root_security_items);
+    return true;
+}
+
+inline bool add_certs_to_x509_store(CFArrayRef certs, X509_STORE *store) {
+    auto result = false;
+    for (auto i = 0; i < CFArrayGetCount(certs); ++i) {
+        const auto cert = reinterpret_cast<const __SecCertificate *>(
+            CFArrayGetValueAtIndex(certs, i));
+
+        if (SecCertificateGetTypeID() != CFGetTypeID(cert)) { continue; }
+
+        CFDataRef cert_data = nullptr;
+        if (SecItemExport(cert, kSecFormatX509Cert, 0, nullptr, &cert_data) !=
+            errSecSuccess) {
+            continue;
+        }
+
+        CFObjectPtr<CFDataRef> cert_data_ptr(cert_data, cf_object_ptr_deleter);
+
+        auto encoded_cert = static_cast<const unsigned char *>(
+            CFDataGetBytePtr(cert_data_ptr.get()));
+
+        auto x509 =
+            d2i_X509(NULL, &encoded_cert, CFDataGetLength(cert_data_ptr.get()));
+
+        if (x509) {
+            X509_STORE_add_cert(store, x509);
+            X509_free(x509);
+            result = true;
+        }
+    }
+
+    return result;
+}
+
+inline bool load_system_certs_on_macos(X509_STORE *store) {
+    auto result = false;
+    CFObjectPtr<CFArrayRef> certs(nullptr, cf_object_ptr_deleter);
+    if (retrieve_certs_from_keychain(certs) && certs) {
+        result = add_certs_to_x509_store(certs.get(), store);
+    }
+
+    if (retrieve_root_certs_from_keychain(certs) && certs) {
+        result = add_certs_to_x509_store(certs.get(), store) || result;
+    }
+
+    return result;
+}
+#endif // TARGET_OS_OSX
+#endif // _WIN32
+#endif // CPPHTTPLIB_OPENSSL_SUPPORT
+
+#ifdef _WIN32
+class WSInit {
+public:
+    WSInit() {
+        WSADATA wsaData;
+        if (WSAStartup(0x0002, &wsaData) == 0) is_valid_ = true;
+    }
+
+    ~WSInit() {
+        if (is_valid_) WSACleanup();
+    }
+
+    bool is_valid_ = false;
+};
+
+static WSInit wsinit_;
+#endif
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+inline std::pair<std::string, std::string> make_digest_authentication_header(
+    const Request &req, const std::map<std::string, std::string> &auth,
+    size_t cnonce_count, const std::string &cnonce, const std::string &username,
+    const std::string &password, bool is_proxy = false) {
+    std::string nc;
+    {
+        std::stringstream ss;
+        ss << std::setfill('0') << std::setw(8) << std::hex << cnonce_count;
+        nc = ss.str();
+    }
+
+    std::string qop;
+    if (auth.find("qop") != auth.end()) {
+        qop = auth.at("qop");
+        if (qop.find("auth-int") != std::string::npos) {
+            qop = "auth-int";
+        } else if (qop.find("auth") != std::string::npos) {
+            qop = "auth";
+        } else {
+            qop.clear();
+        }
+    }
+
+    std::string algo = "MD5";
+    if (auth.find("algorithm") != auth.end()) { algo = auth.at("algorithm"); }
+
+    std::string response;
+    {
+        auto H = algo == "SHA-256"   ? detail::SHA_256
+                 : algo == "SHA-512" ? detail::SHA_512
+                                     : detail::MD5;
+
+        auto A1 = username + ":" + auth.at("realm") + ":" + password;
+
+        auto A2 = req.method + ":" + req.path;
+        if (qop == "auth-int") { A2 += ":" + H(req.body); }
+
+        if (qop.empty()) {
+            response = H(H(A1) + ":" + auth.at("nonce") + ":" + H(A2));
+        } else {
+            response = H(H(A1) + ":" + auth.at("nonce") + ":" + nc + ":" + cnonce +
+                         ":" + qop + ":" + H(A2));
+        }
+    }
+
+    auto opaque = (auth.find("opaque") != auth.end()) ? auth.at("opaque") : "";
+
+    auto field = "Digest username=\"" + username + "\", realm=\"" +
+                 auth.at("realm") + "\", nonce=\"" + auth.at("nonce") +
+                 "\", uri=\"" + req.path + "\", algorithm=" + algo +
+                 (qop.empty() ? ", response=\""
+                                : ", qop=" + qop + ", nc=" + nc + ", cnonce=\"" +
+                                    cnonce + "\", response=\"") +
+                 response + "\"" +
+                 (opaque.empty() ? "" : ", opaque=\"" + opaque + "\"");
+
+    auto key = is_proxy ? "Proxy-Authorization" : "Authorization";
+    return std::make_pair(key, field);
+}
+#endif
+
+inline bool parse_www_authenticate(const Response &res,
+    std::map<std::string, std::string> &auth,
+    bool is_proxy) {
+    auto auth_key = is_proxy ? "Proxy-Authenticate" : "WWW-Authenticate";
+    if (res.has_header(auth_key)) {
+        static auto re = std::regex(R"~((?:(?:,\s*)?(.+?)=(?:"(.*?)"|([^,]*))))~");
+        auto s = res.get_header_value(auth_key);
+        auto pos = s.find(' ');
+        if (pos != std::string::npos) {
+            auto type = s.substr(0, pos);
+            if (type == "Basic") {
+                return false;
+            } else if (type == "Digest") {
+                s = s.substr(pos + 1);
+                auto beg = std::sregex_iterator(s.begin(), s.end(), re);
+                for (auto i = beg; i != std::sregex_iterator(); ++i) {
+                    const auto &m = *i;
+                    auto key = s.substr(static_cast<size_t>(m.position(1)),
+                        static_cast<size_t>(m.length(1)));
+                    auto val = m.length(2) > 0
+                                   ? s.substr(static_cast<size_t>(m.position(2)),
+                                       static_cast<size_t>(m.length(2)))
+                                   : s.substr(static_cast<size_t>(m.position(3)),
+                                       static_cast<size_t>(m.length(3)));
+                    auth[key] = val;
+                }
+                return true;
+            }
+        }
+    }
+    return false;
+}
+
+// https://stackoverflow.com/questions/440133/how-do-i-create-a-random-alpha-numeric-string-in-c/440240#answer-440240
+inline std::string random_string(size_t length) {
+    auto randchar = []() -> char {
+        const char charset[] = "0123456789"
+                               "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
+                               "abcdefghijklmnopqrstuvwxyz";
+        const size_t max_index = (sizeof(charset) - 1);
+        return charset[static_cast<size_t>(std::rand()) % max_index];
+    };
+    std::string str(length, 0);
+    std::generate_n(str.begin(), length, randchar);
+    return str;
+}
+
+class ContentProviderAdapter {
+public:
+    explicit ContentProviderAdapter(
+        ContentProviderWithoutLength &&content_provider)
+        : content_provider_(content_provider) {}
+
+    bool operator()(size_t offset, size_t, DataSink &sink) {
+        return content_provider_(offset, sink);
+    }
+
+private:
+    ContentProviderWithoutLength content_provider_;
+};
+
+} // namespace detail
+
+inline std::string hosted_at(const std::string &hostname) {
+    std::vector<std::string> addrs;
+    hosted_at(hostname, addrs);
+    if (addrs.empty()) { return std::string(); }
+    return addrs[0];
+}
+
+inline void hosted_at(const std::string &hostname,
+    std::vector<std::string> &addrs) {
+    struct addrinfo hints;
+    struct addrinfo *result;
+
+    memset(&hints, 0, sizeof(struct addrinfo));
+    hints.ai_family = AF_UNSPEC;
+    hints.ai_socktype = SOCK_STREAM;
+    hints.ai_protocol = 0;
+
+    if (getaddrinfo(hostname.c_str(), nullptr, &hints, &result)) {
+#if defined __linux__ && !defined __ANDROID__
+        res_init();
+#endif
+        return;
+    }
+
+    for (auto rp = result; rp; rp = rp->ai_next) {
+        const auto &addr =
+            *reinterpret_cast<struct sockaddr_storage *>(rp->ai_addr);
+        std::string ip;
+        auto dummy = -1;
+        if (detail::get_ip_and_port(addr, sizeof(struct sockaddr_storage), ip,
+                dummy)) {
+            addrs.push_back(ip);
+        }
+    }
+
+    freeaddrinfo(result);
+}
+
+inline std::string append_query_params(const std::string &path,
+    const Params &params) {
+    std::string path_with_query = path;
+    const static std::regex re("[^?]+\\?.*");
+    auto delm = std::regex_match(path, re) ? '&' : '?';
+    path_with_query += delm + detail::params_to_query_str(params);
+    return path_with_query;
+}
+
+// Header utilities
+inline std::pair<std::string, std::string> make_range_header(Ranges ranges) {
+    std::string field = "bytes=";
+    auto i = 0;
+    for (auto r : ranges) {
+        if (i != 0) { field += ", "; }
+        if (r.first != -1) { field += std::to_string(r.first); }
+        field += '-';
+        if (r.second != -1) { field += std::to_string(r.second); }
+        i++;
+    }
+    return std::make_pair("Range", std::move(field));
+}
+
+inline std::pair<std::string, std::string>
+make_basic_authentication_header(const std::string &username,
+    const std::string &password, bool is_proxy) {
+    auto field = "Basic " + detail::base64_encode(username + ":" + password);
+    auto key = is_proxy ? "Proxy-Authorization" : "Authorization";
+    return std::make_pair(key, std::move(field));
+}
+
+inline std::pair<std::string, std::string>
+make_bearer_token_authentication_header(const std::string &token,
+    bool is_proxy = false) {
+    auto field = "Bearer " + token;
+    auto key = is_proxy ? "Proxy-Authorization" : "Authorization";
+    return std::make_pair(key, std::move(field));
+}
+
+// Request implementation
+inline bool Request::has_header(const std::string &key) const {
+    return detail::has_header(headers, key);
+}
+
+inline std::string Request::get_header_value(const std::string &key,
+    size_t id) const {
+    return detail::get_header_value(headers, key, id, "");
+}
+
+inline size_t Request::get_header_value_count(const std::string &key) const {
+    auto r = headers.equal_range(key);
+    return static_cast<size_t>(std::distance(r.first, r.second));
+}
+
+inline void Request::set_header(const std::string &key,
+    const std::string &val) {
+    if (!detail::has_crlf(key) && !detail::has_crlf(val)) {
+        headers.emplace(key, val);
+    }
+}
+
+inline bool Request::has_param(const std::string &key) const {
+    return params.find(key) != params.end();
+}
+
+inline std::string Request::get_param_value(const std::string &key,
+    size_t id) const {
+    auto rng = params.equal_range(key);
+    auto it = rng.first;
+    std::advance(it, static_cast<ssize_t>(id));
+    if (it != rng.second) { return it->second; }
+    return std::string();
+}
+
+inline size_t Request::get_param_value_count(const std::string &key) const {
+    auto r = params.equal_range(key);
+    return static_cast<size_t>(std::distance(r.first, r.second));
+}
+
+inline bool Request::is_multipart_form_data() const {
+    const auto &content_type = get_header_value("Content-Type");
+    return !content_type.rfind("multipart/form-data", 0);
+}
+
+inline bool Request::has_file(const std::string &key) const {
+    return files.find(key) != files.end();
+}
+
+inline MultipartFormData Request::get_file_value(const std::string &key) const {
+    auto it = files.find(key);
+    if (it != files.end()) { return it->second; }
+    return MultipartFormData();
+}
+
+inline std::vector<MultipartFormData>
+Request::get_file_values(const std::string &key) const {
+    std::vector<MultipartFormData> values;
+    auto rng = files.equal_range(key);
+    for (auto it = rng.first; it != rng.second; it++) {
+        values.push_back(it->second);
+    }
+    return values;
+}
+
+// Response implementation
+inline bool Response::has_header(const std::string &key) const {
+    return headers.find(key) != headers.end();
+}
+
+inline std::string Response::get_header_value(const std::string &key,
+    size_t id) const {
+    return detail::get_header_value(headers, key, id, "");
+}
+
+inline size_t Response::get_header_value_count(const std::string &key) const {
+    auto r = headers.equal_range(key);
+    return static_cast<size_t>(std::distance(r.first, r.second));
+}
+
+inline void Response::set_header(const std::string &key,
+    const std::string &val) {
+    if (!detail::has_crlf(key) && !detail::has_crlf(val)) {
+        headers.emplace(key, val);
+    }
+}
+
+inline void Response::set_redirect(const std::string &url, int stat) {
+    if (!detail::has_crlf(url)) {
+        set_header("Location", url);
+        if (300 <= stat && stat < 400) {
+            this->status = stat;
+        } else {
+            this->status = StatusCode::Found_302;
+        }
+    }
+}
+
+inline void Response::set_content(const char *s, size_t n,
+    const std::string &content_type) {
+    body.assign(s, n);
+
+    auto rng = headers.equal_range("Content-Type");
+    headers.erase(rng.first, rng.second);
+    set_header("Content-Type", content_type);
+}
+
+inline void Response::set_content(const std::string &s,
+    const std::string &content_type) {
+    set_content(s.data(), s.size(), content_type);
+}
+
+inline void Response::set_content_provider(
+    size_t in_length, const std::string &content_type, ContentProvider provider,
+    ContentProviderResourceReleaser resource_releaser) {
+    set_header("Content-Type", content_type);
+    content_length_ = in_length;
+    if (in_length > 0) { content_provider_ = std::move(provider); }
+    content_provider_resource_releaser_ = resource_releaser;
+    is_chunked_content_provider_ = false;
+}
+
+inline void Response::set_content_provider(
+    const std::string &content_type, ContentProviderWithoutLength provider,
+    ContentProviderResourceReleaser resource_releaser) {
+    set_header("Content-Type", content_type);
+    content_length_ = 0;
+    content_provider_ = detail::ContentProviderAdapter(std::move(provider));
+    content_provider_resource_releaser_ = resource_releaser;
+    is_chunked_content_provider_ = false;
+}
+
+inline void Response::set_chunked_content_provider(
+    const std::string &content_type, ContentProviderWithoutLength provider,
+    ContentProviderResourceReleaser resource_releaser) {
+    set_header("Content-Type", content_type);
+    content_length_ = 0;
+    content_provider_ = detail::ContentProviderAdapter(std::move(provider));
+    content_provider_resource_releaser_ = resource_releaser;
+    is_chunked_content_provider_ = true;
+}
+
+// Result implementation
+inline bool Result::has_request_header(const std::string &key) const {
+    return request_headers_.find(key) != request_headers_.end();
+}
+
+inline std::string Result::get_request_header_value(const std::string &key,
+    size_t id) const {
+    return detail::get_header_value(request_headers_, key, id, "");
+}
+
+inline size_t
+Result::get_request_header_value_count(const std::string &key) const {
+    auto r = request_headers_.equal_range(key);
+    return static_cast<size_t>(std::distance(r.first, r.second));
+}
+
+// Stream implementation
+inline ssize_t Stream::write(const char *ptr) {
+    return write(ptr, strlen(ptr));
+}
+
+inline ssize_t Stream::write(const std::string &s) {
+    return write(s.data(), s.size());
+}
+
+namespace detail {
+
+// Socket stream implementation
+inline SocketStream::SocketStream(socket_t sock, time_t read_timeout_sec,
+    time_t read_timeout_usec,
+    time_t write_timeout_sec,
+    time_t write_timeout_usec)
+    : sock_(sock), read_timeout_sec_(read_timeout_sec),
+      read_timeout_usec_(read_timeout_usec),
+      write_timeout_sec_(write_timeout_sec),
+      write_timeout_usec_(write_timeout_usec), read_buff_(read_buff_size_, 0) {}
+
+inline SocketStream::~SocketStream() = default;
+
+inline bool SocketStream::is_readable() const {
+    return select_read(sock_, read_timeout_sec_, read_timeout_usec_) > 0;
+}
+
+inline bool SocketStream::is_writable() const {
+    return select_write(sock_, write_timeout_sec_, write_timeout_usec_) > 0 &&
+           is_socket_alive(sock_);
+}
+
+inline ssize_t SocketStream::read(char *ptr, size_t size) {
+#ifdef _WIN32
+    size =
+        (std::min)(size, static_cast<size_t>((std::numeric_limits<int>::max)()));
+#else
+    size = (std::min)(size,
+        static_cast<size_t>((std::numeric_limits<ssize_t>::max)()));
+#endif
+
+    if (read_buff_off_ < read_buff_content_size_) {
+        auto remaining_size = read_buff_content_size_ - read_buff_off_;
+        if (size <= remaining_size) {
+            memcpy(ptr, read_buff_.data() + read_buff_off_, size);
+            read_buff_off_ += size;
+            return static_cast<ssize_t>(size);
+        } else {
+            memcpy(ptr, read_buff_.data() + read_buff_off_, remaining_size);
+            read_buff_off_ += remaining_size;
+            return static_cast<ssize_t>(remaining_size);
+        }
+    }
+
+    if (!is_readable()) { return -1; }
+
+    read_buff_off_ = 0;
+    read_buff_content_size_ = 0;
+
+    if (size < read_buff_size_) {
+        auto n = read_socket(sock_, read_buff_.data(), read_buff_size_,
+            CPPHTTPLIB_RECV_FLAGS);
+        if (n <= 0) {
+            return n;
+        } else if (n <= static_cast<ssize_t>(size)) {
+            memcpy(ptr, read_buff_.data(), static_cast<size_t>(n));
+            return n;
+        } else {
+            memcpy(ptr, read_buff_.data(), size);
+            read_buff_off_ = size;
+            read_buff_content_size_ = static_cast<size_t>(n);
+            return static_cast<ssize_t>(size);
+        }
+    } else {
+        return read_socket(sock_, ptr, size, CPPHTTPLIB_RECV_FLAGS);
+    }
+}
+
+inline ssize_t SocketStream::write(const char *ptr, size_t size) {
+    if (!is_writable()) { return -1; }
+
+#if defined(_WIN32) && !defined(_WIN64)
+    size =
+        (std::min)(size, static_cast<size_t>((std::numeric_limits<int>::max)()));
+#endif
+
+    return send_socket(sock_, ptr, size, CPPHTTPLIB_SEND_FLAGS);
+}
+
+inline void SocketStream::get_remote_ip_and_port(std::string &ip,
+    int &port) const {
+    return detail::get_remote_ip_and_port(sock_, ip, port);
+}
+
+inline void SocketStream::get_local_ip_and_port(std::string &ip,
+    int &port) const {
+    return detail::get_local_ip_and_port(sock_, ip, port);
+}
+
+inline socket_t SocketStream::socket() const { return sock_; }
+
+// Buffer stream implementation
+inline bool BufferStream::is_readable() const { return true; }
+
+inline bool BufferStream::is_writable() const { return true; }
+
+inline ssize_t BufferStream::read(char *ptr, size_t size) {
+#if defined(_MSC_VER) && _MSC_VER < 1910
+    auto len_read = buffer._Copy_s(ptr, size, size, position);
+#else
+    auto len_read = buffer.copy(ptr, size, position);
+#endif
+    position += static_cast<size_t>(len_read);
+    return static_cast<ssize_t>(len_read);
+}
+
+inline ssize_t BufferStream::write(const char *ptr, size_t size) {
+    buffer.append(ptr, size);
+    return static_cast<ssize_t>(size);
+}
+
+inline void BufferStream::get_remote_ip_and_port(std::string & /*ip*/,
+    int & /*port*/) const {}
+
+inline void BufferStream::get_local_ip_and_port(std::string & /*ip*/,
+    int & /*port*/) const {}
+
+inline socket_t BufferStream::socket() const { return 0; }
+
+inline const std::string &BufferStream::get_buffer() const { return buffer; }
+
+inline PathParamsMatcher::PathParamsMatcher(const std::string &pattern) {
+    // One past the last ending position of a path param substring
+    std::size_t last_param_end = 0;
+
+#ifndef CPPHTTPLIB_NO_EXCEPTIONS
+    // Needed to ensure that parameter names are unique during matcher
+    // construction
+    // If exceptions are disabled, only last duplicate path
+    // parameter will be set
+    std::unordered_set<std::string> param_name_set;
+#endif
+
+    while (true) {
+        const auto marker_pos = pattern.find(marker, last_param_end);
+        if (marker_pos == std::string::npos) { break; }
+
+        static_fragments_.push_back(
+            pattern.substr(last_param_end, marker_pos - last_param_end));
+
+        const auto param_name_start = marker_pos + 1;
+
+        auto sep_pos = pattern.find(separator, param_name_start);
+        if (sep_pos == std::string::npos) { sep_pos = pattern.length(); }
+
+        auto param_name =
+            pattern.substr(param_name_start, sep_pos - param_name_start);
+
+#ifndef CPPHTTPLIB_NO_EXCEPTIONS
+        if (param_name_set.find(param_name) != param_name_set.cend()) {
+            std::string msg = "Encountered path parameter '" + param_name +
+                              "' multiple times in route pattern '" + pattern + "'.";
+            throw std::invalid_argument(msg);
+        }
+#endif
+
+        param_names_.push_back(std::move(param_name));
+
+        last_param_end = sep_pos + 1;
+    }
+
+    if (last_param_end < pattern.length()) {
+        static_fragments_.push_back(pattern.substr(last_param_end));
+    }
+}
+
+inline bool PathParamsMatcher::match(Request &request) const {
+    request.matches = std::smatch();
+    request.path_params.clear();
+    request.path_params.reserve(param_names_.size());
+
+    // One past the position at which the path matched the pattern last time
+    std::size_t starting_pos = 0;
+    for (size_t i = 0; i < static_fragments_.size(); ++i) {
+        const auto &fragment = static_fragments_[i];
+
+        if (starting_pos + fragment.length() > request.path.length()) {
+            return false;
+        }
+
+        // Avoid unnecessary allocation by using strncmp instead of substr +
+        // comparison
+        if (std::strncmp(request.path.c_str() + starting_pos, fragment.c_str(),
+                fragment.length()) != 0) {
+            return false;
+        }
+
+        starting_pos += fragment.length();
+
+        // Should only happen when we have a static fragment after a param
+        // Example: '/users/:id/subscriptions'
+        // The 'subscriptions' fragment here does not have a corresponding param
+        if (i >= param_names_.size()) { continue; }
+
+        auto sep_pos = request.path.find(separator, starting_pos);
+        if (sep_pos == std::string::npos) { sep_pos = request.path.length(); }
+
+        const auto &param_name = param_names_[i];
+
+        request.path_params.emplace(
+            param_name, request.path.substr(starting_pos, sep_pos - starting_pos));
+
+        // Mark everythin up to '/' as matched
+        starting_pos = sep_pos + 1;
+    }
+    // Returns false if the path is longer than the pattern
+    return starting_pos >= request.path.length();
+}
+
+inline bool RegexMatcher::match(Request &request) const {
+    request.path_params.clear();
+    return std::regex_match(request.path, request.matches, regex_);
+}
+
+} // namespace detail
+
+// HTTP server implementation
+inline Server::Server()
+    : new_task_queue(
+          [] { return new ThreadPool(CPPHTTPLIB_THREAD_POOL_COUNT); }) {
+#ifndef _WIN32
+    signal(SIGPIPE, SIG_IGN);
+#endif
+}
+
+inline Server::~Server() = default;
+
+inline std::unique_ptr<detail::MatcherBase>
+Server::make_matcher(const std::string &pattern) {
+    if (pattern.find("/:") != std::string::npos) {
+        return detail::make_unique<detail::PathParamsMatcher>(pattern);
+    } else {
+        return detail::make_unique<detail::RegexMatcher>(pattern);
+    }
+}
+
+inline Server &Server::Get(const std::string &pattern, Handler handler) {
+    get_handlers_.emplace_back(make_matcher(pattern), std::move(handler));
+    return *this;
+}
+
+inline Server &Server::Post(const std::string &pattern, Handler handler) {
+    post_handlers_.emplace_back(make_matcher(pattern), std::move(handler));
+    return *this;
+}
+
+inline Server &Server::Post(const std::string &pattern,
+    HandlerWithContentReader handler) {
+    post_handlers_for_content_reader_.emplace_back(make_matcher(pattern),
+        std::move(handler));
+    return *this;
+}
+
+inline Server &Server::Put(const std::string &pattern, Handler handler) {
+    put_handlers_.emplace_back(make_matcher(pattern), std::move(handler));
+    return *this;
+}
+
+inline Server &Server::Put(const std::string &pattern,
+    HandlerWithContentReader handler) {
+    put_handlers_for_content_reader_.emplace_back(make_matcher(pattern),
+        std::move(handler));
+    return *this;
+}
+
+inline Server &Server::Patch(const std::string &pattern, Handler handler) {
+    patch_handlers_.emplace_back(make_matcher(pattern), std::move(handler));
+    return *this;
+}
+
+inline Server &Server::Patch(const std::string &pattern,
+    HandlerWithContentReader handler) {
+    patch_handlers_for_content_reader_.emplace_back(make_matcher(pattern),
+        std::move(handler));
+    return *this;
+}
+
+inline Server &Server::Delete(const std::string &pattern, Handler handler) {
+    delete_handlers_.emplace_back(make_matcher(pattern), std::move(handler));
+    return *this;
+}
+
+inline Server &Server::Delete(const std::string &pattern,
+    HandlerWithContentReader handler) {
+    delete_handlers_for_content_reader_.emplace_back(make_matcher(pattern),
+        std::move(handler));
+    return *this;
+}
+
+inline Server &Server::Options(const std::string &pattern, Handler handler) {
+    options_handlers_.emplace_back(make_matcher(pattern), std::move(handler));
+    return *this;
+}
+
+inline bool Server::set_base_dir(const std::string &dir,
+    const std::string &mount_point) {
+    return set_mount_point(mount_point, dir);
+}
+
+inline bool Server::set_mount_point(const std::string &mount_point,
+    const std::string &dir, Headers headers) {
+    if (detail::is_dir(dir)) {
+        std::string mnt = !mount_point.empty() ? mount_point : "/";
+        if (!mnt.empty() && mnt[0] == '/') {
+            base_dirs_.push_back({mnt, dir, std::move(headers)});
+            return true;
+        }
+    }
+    return false;
+}
+
+inline bool Server::remove_mount_point(const std::string &mount_point) {
+    for (auto it = base_dirs_.begin(); it != base_dirs_.end(); ++it) {
+        if (it->mount_point == mount_point) {
+            base_dirs_.erase(it);
+            return true;
+        }
+    }
+    return false;
+}
+
+inline Server &
+Server::set_file_extension_and_mimetype_mapping(const std::string &ext,
+    const std::string &mime) {
+    file_extension_and_mimetype_map_[ext] = mime;
+    return *this;
+}
+
+inline Server &Server::set_default_file_mimetype(const std::string &mime) {
+    default_file_mimetype_ = mime;
+    return *this;
+}
+
+inline Server &Server::set_file_request_handler(Handler handler) {
+    file_request_handler_ = std::move(handler);
+    return *this;
+}
+
+inline Server &Server::set_error_handler(HandlerWithResponse handler) {
+    error_handler_ = std::move(handler);
+    return *this;
+}
+
+inline Server &Server::set_error_handler(Handler handler) {
+    error_handler_ = [handler](const Request &req, Response &res) {
+        handler(req, res);
+        return HandlerResponse::Handled;
+    };
+    return *this;
+}
+
+inline Server &Server::set_exception_handler(ExceptionHandler handler) {
+    exception_handler_ = std::move(handler);
+    return *this;
+}
+
+inline Server &Server::set_pre_routing_handler(HandlerWithResponse handler) {
+    pre_routing_handler_ = std::move(handler);
+    return *this;
+}
+
+inline Server &Server::set_post_routing_handler(Handler handler) {
+    post_routing_handler_ = std::move(handler);
+    return *this;
+}
+
+inline Server &Server::set_logger(Logger logger) {
+    logger_ = std::move(logger);
+    return *this;
+}
+
+inline Server &
+Server::set_expect_100_continue_handler(Expect100ContinueHandler handler) {
+    expect_100_continue_handler_ = std::move(handler);
+    return *this;
+}
+
+inline Server &Server::set_address_family(int family) {
+    address_family_ = family;
+    return *this;
+}
+
+inline Server &Server::set_tcp_nodelay(bool on) {
+    tcp_nodelay_ = on;
+    return *this;
+}
+
+inline Server &Server::set_socket_options(SocketOptions socket_options) {
+    socket_options_ = std::move(socket_options);
+    return *this;
+}
+
+inline Server &Server::set_default_headers(Headers headers) {
+    default_headers_ = std::move(headers);
+    return *this;
+}
+
+inline Server &Server::set_header_writer(
+    std::function<ssize_t(Stream &, Headers &)> const &writer) {
+    header_writer_ = writer;
+    return *this;
+}
+
+inline Server &Server::set_keep_alive_max_count(size_t count) {
+    keep_alive_max_count_ = count;
+    return *this;
+}
+
+inline Server &Server::set_keep_alive_timeout(time_t sec) {
+    keep_alive_timeout_sec_ = sec;
+    return *this;
+}
+
+inline Server &Server::set_read_timeout(time_t sec, time_t usec) {
+    read_timeout_sec_ = sec;
+    read_timeout_usec_ = usec;
+    return *this;
+}
+
+inline Server &Server::set_write_timeout(time_t sec, time_t usec) {
+    write_timeout_sec_ = sec;
+    write_timeout_usec_ = usec;
+    return *this;
+}
+
+inline Server &Server::set_idle_interval(time_t sec, time_t usec) {
+    idle_interval_sec_ = sec;
+    idle_interval_usec_ = usec;
+    return *this;
+}
+
+inline Server &Server::set_payload_max_length(size_t length) {
+    payload_max_length_ = length;
+    return *this;
+}
+
+inline bool Server::bind_to_port(const std::string &host, int port,
+    int socket_flags) {
+    return bind_internal(host, port, socket_flags) >= 0;
+}
+inline int Server::bind_to_any_port(const std::string &host, int socket_flags) {
+    return bind_internal(host, 0, socket_flags);
+}
+
+inline bool Server::listen_after_bind() {
+    auto se = detail::scope_exit([&]() { done_ = true; });
+    return listen_internal();
+}
+
+inline bool Server::listen(const std::string &host, int port,
+    int socket_flags) {
+    auto se = detail::scope_exit([&]() { done_ = true; });
+    return bind_to_port(host, port, socket_flags) && listen_internal();
+}
+
+inline bool Server::is_running() const { return is_running_; }
+
+inline void Server::wait_until_ready() const {
+    while (!is_running() && !done_) {
+        std::this_thread::sleep_for(std::chrono::milliseconds{1});
+    }
+}
+
+inline void Server::stop() {
+    if (is_running_) {
+        assert(svr_sock_ != INVALID_SOCKET);
+        std::atomic<socket_t> sock(svr_sock_.exchange(INVALID_SOCKET));
+        detail::shutdown_socket(sock);
+        detail::close_socket(sock);
+    }
+}
+
+inline bool Server::parse_request_line(const char *s, Request &req) const {
+    auto len = strlen(s);
+    if (len < 2 || s[len - 2] != '\r' || s[len - 1] != '\n') { return false; }
+    len -= 2;
+
+    {
+        size_t count = 0;
+
+        detail::split(s, s + len, ' ', [&](const char *b, const char *e) {
+            switch (count) {
+            case 0: req.method = std::string(b, e); break;
+            case 1: req.target = std::string(b, e); break;
+            case 2: req.version = std::string(b, e); break;
+            default: break;
+            }
+            count++;
+        });
+
+        if (count != 3) { return false; }
+    }
+
+    static const std::set<std::string> methods{
+        "GET",     "HEAD",    "POST",  "PUT",   "DELETE",
+        "CONNECT", "OPTIONS", "TRACE", "PATCH", "PRI"};
+
+    if (methods.find(req.method) == methods.end()) { return false; }
+
+    if (req.version != "HTTP/1.1" && req.version != "HTTP/1.0") { return false; }
+
+    {
+        // Skip URL fragment
+        for (size_t i = 0; i < req.target.size(); i++) {
+            if (req.target[i] == '#') {
+                req.target.erase(i);
+                break;
+            }
+        }
+
+        size_t count = 0;
+
+        detail::split(req.target.data(), req.target.data() + req.target.size(), '?',
+            2, [&](const char *b, const char *e) {
+                switch (count) {
+                case 0:
+                    req.path = detail::decode_url(std::string(b, e), false);
+                    break;
+                case 1: {
+                    if (e - b > 0) {
+                        detail::parse_query_text(std::string(b, e), req.params);
+                    }
+                    break;
+                }
+                default: break;
+                }
+                count++;
+            });
+
+        if (count > 2) { return false; }
+    }
+
+    return true;
+}
+
+inline bool Server::write_response(Stream &strm, bool close_connection,
+    const Request &req, Response &res) {
+    return write_response_core(strm, close_connection, req, res, false);
+}
+
+inline bool Server::write_response_with_content(Stream &strm,
+    bool close_connection,
+    const Request &req,
+    Response &res) {
+    return write_response_core(strm, close_connection, req, res, true);
+}
+
+inline bool Server::write_response_core(Stream &strm, bool close_connection,
+    const Request &req, Response &res,
+    bool need_apply_ranges) {
+    assert(res.status != -1);
+
+    if (400 <= res.status && error_handler_ &&
+        error_handler_(req, res) == HandlerResponse::Handled) {
+        need_apply_ranges = true;
+    }
+
+    std::string content_type;
+    std::string boundary;
+    if (need_apply_ranges) { apply_ranges(req, res, content_type, boundary); }
+
+    // Prepare additional headers
+    if (close_connection || req.get_header_value("Connection") == "close") {
+        res.set_header("Connection", "close");
+    } else {
+        std::stringstream ss;
+        ss << "timeout=" << keep_alive_timeout_sec_
+           << ", max=" << keep_alive_max_count_;
+        res.set_header("Keep-Alive", ss.str());
+    }
+
+    if (!res.has_header("Content-Type") &&
+        (!res.body.empty() || res.content_length_ > 0 || res.content_provider_)) {
+        res.set_header("Content-Type", "text/plain");
+    }
+
+    if (!res.has_header("Content-Length") && res.body.empty() &&
+        !res.content_length_ && !res.content_provider_) {
+        res.set_header("Content-Length", "0");
+    }
+
+    if (!res.has_header("Accept-Ranges") && req.method == "HEAD") {
+        res.set_header("Accept-Ranges", "bytes");
+    }
+
+    if (post_routing_handler_) { post_routing_handler_(req, res); }
+
+    // Response line and headers
+    {
+        detail::BufferStream bstrm;
+
+        if (!bstrm.write_format("HTTP/1.1 %d %s\r\n", res.status,
+                status_message(res.status))) {
+            return false;
+        }
+
+        if (!header_writer_(bstrm, res.headers)) { return false; }
+
+        // Flush buffer
+        auto &data = bstrm.get_buffer();
+        detail::write_data(strm, data.data(), data.size());
+    }
+
+    // Body
+    auto ret = true;
+    if (req.method != "HEAD") {
+        if (!res.body.empty()) {
+            if (!detail::write_data(strm, res.body.data(), res.body.size())) {
+                ret = false;
+            }
+        } else if (res.content_provider_) {
+            if (write_content_with_provider(strm, req, res, boundary, content_type)) {
+                res.content_provider_success_ = true;
+            } else {
+                res.content_provider_success_ = false;
+                ret = false;
+            }
+        }
+    }
+
+    // Log
+    if (logger_) { logger_(req, res); }
+
+    return ret;
+}
+
+inline bool
+Server::write_content_with_provider(Stream &strm, const Request &req,
+    Response &res, const std::string &boundary,
+    const std::string &content_type) {
+    auto is_shutting_down = [this]() {
+        return this->svr_sock_ == INVALID_SOCKET;
+    };
+
+    if (res.content_length_ > 0) {
+        if (req.ranges.empty()) {
+            return detail::write_content(strm, res.content_provider_, 0,
+                res.content_length_, is_shutting_down);
+        } else if (req.ranges.size() == 1) {
+            auto offsets =
+                detail::get_range_offset_and_length(req, res.content_length_, 0);
+            auto offset = offsets.first;
+            auto length = offsets.second;
+            return detail::write_content(strm, res.content_provider_, offset, length,
+                is_shutting_down);
+        } else {
+            return detail::write_multipart_ranges_data(
+                strm, req, res, boundary, content_type, is_shutting_down);
+        }
+    } else {
+        if (res.is_chunked_content_provider_) {
+            auto type = detail::encoding_type(req, res);
+
+            std::unique_ptr<detail::compressor> compressor;
+            if (type == detail::EncodingType::Gzip) {
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+                compressor = detail::make_unique<detail::gzip_compressor>();
+#endif
+            } else if (type == detail::EncodingType::Brotli) {
+#ifdef CPPHTTPLIB_BROTLI_SUPPORT
+                compressor = detail::make_unique<detail::brotli_compressor>();
+#endif
+            } else {
+                compressor = detail::make_unique<detail::nocompressor>();
+            }
+            assert(compressor != nullptr);
+
+            return detail::write_content_chunked(strm, res.content_provider_,
+                is_shutting_down, *compressor);
+        } else {
+            return detail::write_content_without_length(strm, res.content_provider_,
+                is_shutting_down);
+        }
+    }
+}
+
+inline bool Server::read_content(Stream &strm, Request &req, Response &res) {
+    MultipartFormDataMap::iterator cur;
+    auto file_count = 0;
+    if (read_content_core(
+            strm, req, res,
+            // Regular
+            [&](const char *buf, size_t n) {
+                if (req.body.size() + n > req.body.max_size()) { return false; }
+                req.body.append(buf, n);
+                return true;
+            },
+            // Multipart
+            [&](const MultipartFormData &file) {
+                if (file_count++ == CPPHTTPLIB_MULTIPART_FORM_DATA_FILE_MAX_COUNT) {
+                    return false;
+                }
+                cur = req.files.emplace(file.name, file);
+                return true;
+            },
+            [&](const char *buf, size_t n) {
+                auto &content = cur->second.content;
+                if (content.size() + n > content.max_size()) { return false; }
+                content.append(buf, n);
+                return true;
+            })) {
+        const auto &content_type = req.get_header_value("Content-Type");
+        if (!content_type.find("application/x-www-form-urlencoded")) {
+            if (req.body.size() > CPPHTTPLIB_FORM_URL_ENCODED_PAYLOAD_MAX_LENGTH) {
+                res.status = StatusCode::PayloadTooLarge_413; // NOTE: should be 414?
+                return false;
+            }
+            detail::parse_query_text(req.body, req.params);
+        }
+        return true;
+    }
+    return false;
+}
+
+inline bool Server::read_content_with_content_receiver(
+    Stream &strm, Request &req, Response &res, ContentReceiver receiver,
+    MultipartContentHeader multipart_header,
+    ContentReceiver multipart_receiver) {
+    return read_content_core(strm, req, res, std::move(receiver),
+        std::move(multipart_header),
+        std::move(multipart_receiver));
+}
+
+inline bool
+Server::read_content_core(Stream &strm, Request &req, Response &res,
+    ContentReceiver receiver,
+    MultipartContentHeader multipart_header,
+    ContentReceiver multipart_receiver) const {
+    detail::MultipartFormDataParser multipart_form_data_parser;
+    ContentReceiverWithProgress out;
+
+    if (req.is_multipart_form_data()) {
+        const auto &content_type = req.get_header_value("Content-Type");
+        std::string boundary;
+        if (!detail::parse_multipart_boundary(content_type, boundary)) {
+            res.status = StatusCode::BadRequest_400;
+            return false;
+        }
+
+        multipart_form_data_parser.set_boundary(std::move(boundary));
+        out = [&](const char *buf, size_t n, uint64_t /*off*/, uint64_t /*len*/) {
+            /* For debug
+            size_t pos = 0;
+            while (pos < n) {
+              auto read_size = (std::min)<size_t>(1, n - pos);
+              auto ret = multipart_form_data_parser.parse(
+                  buf + pos, read_size, multipart_receiver, multipart_header);
+              if (!ret) { return false; }
+              pos += read_size;
+            }
+            return true;
+            */
+            return multipart_form_data_parser.parse(buf, n, multipart_receiver,
+                multipart_header);
+        };
+    } else {
+        out = [receiver](const char *buf, size_t n, uint64_t /*off*/,
+                  uint64_t /*len*/) { return receiver(buf, n); };
+    }
+
+    if (req.method == "DELETE" && !req.has_header("Content-Length")) {
+        return true;
+    }
+
+    if (!detail::read_content(strm, req, payload_max_length_, res.status, nullptr,
+            out, true)) {
+        return false;
+    }
+
+    if (req.is_multipart_form_data()) {
+        if (!multipart_form_data_parser.is_valid()) {
+            res.status = StatusCode::BadRequest_400;
+            return false;
+        }
+    }
+
+    return true;
+}
+
+inline bool Server::handle_file_request(const Request &req, Response &res,
+    bool head) {
+    for (const auto &entry : base_dirs_) {
+        // Prefix match
+        if (!req.path.compare(0, entry.mount_point.size(), entry.mount_point)) {
+            std::string sub_path = "/" + req.path.substr(entry.mount_point.size());
+            if (detail::is_valid_path(sub_path)) {
+                auto path = entry.base_dir + sub_path;
+                if (path.back() == '/') { path += "index.html"; }
+
+                if (detail::is_file(path)) {
+                    for (const auto &kv : entry.headers) {
+                        res.set_header(kv.first, kv.second);
+                    }
+
+                    auto mm = std::make_shared<detail::mmap>(path.c_str());
+                    if (!mm->is_open()) { return false; }
+
+                    res.set_content_provider(
+                        mm->size(),
+                        detail::find_content_type(path, file_extension_and_mimetype_map_,
+                            default_file_mimetype_),
+                        [mm](size_t offset, size_t length, DataSink &sink) -> bool {
+                            sink.write(mm->data() + offset, length);
+                            return true;
+                        });
+
+                    if (!head && file_request_handler_) {
+                        file_request_handler_(req, res);
+                    }
+
+                    return true;
+                }
+            }
+        }
+    }
+    return false;
+}
+
+inline socket_t
+Server::create_server_socket(const std::string &host, int port,
+    int socket_flags,
+    SocketOptions socket_options) const {
+    return detail::create_socket(
+        host, std::string(), port, address_family_, socket_flags, tcp_nodelay_,
+        std::move(socket_options),
+        [](socket_t sock, struct addrinfo &ai) -> bool {
+            if (::bind(sock, ai.ai_addr, static_cast<socklen_t>(ai.ai_addrlen))) {
+                return false;
+            }
+            if (::listen(sock, CPPHTTPLIB_LISTEN_BACKLOG)) { return false; }
+            return true;
+        });
+}
+
+inline int Server::bind_internal(const std::string &host, int port,
+    int socket_flags) {
+    if (!is_valid()) { return -1; }
+
+    svr_sock_ = create_server_socket(host, port, socket_flags, socket_options_);
+    if (svr_sock_ == INVALID_SOCKET) { return -1; }
+
+    if (port == 0) {
+        struct sockaddr_storage addr;
+        socklen_t addr_len = sizeof(addr);
+        if (getsockname(svr_sock_, reinterpret_cast<struct sockaddr *>(&addr),
+                &addr_len) == -1) {
+            return -1;
+        }
+        if (addr.ss_family == AF_INET) {
+            return ntohs(reinterpret_cast<struct sockaddr_in *>(&addr)->sin_port);
+        } else if (addr.ss_family == AF_INET6) {
+            return ntohs(reinterpret_cast<struct sockaddr_in6 *>(&addr)->sin6_port);
+        } else {
+            return -1;
+        }
+    } else {
+        return port;
+    }
+}
+
+inline bool Server::listen_internal() {
+    auto ret = true;
+    is_running_ = true;
+    auto se = detail::scope_exit([&]() { is_running_ = false; });
+
+    {
+        std::unique_ptr<TaskQueue> task_queue(new_task_queue());
+
+        while (svr_sock_ != INVALID_SOCKET) {
+#ifndef _WIN32
+            if (idle_interval_sec_ > 0 || idle_interval_usec_ > 0) {
+#endif
+                auto val = detail::select_read(svr_sock_, idle_interval_sec_,
+                    idle_interval_usec_);
+                if (val == 0) { // Timeout
+                    task_queue->on_idle();
+                    continue;
+                }
+#ifndef _WIN32
+            }
+#endif
+            socket_t sock = accept(svr_sock_, nullptr, nullptr);
+
+            if (sock == INVALID_SOCKET) {
+                if (errno == EMFILE) {
+                    // The per-process limit of open file descriptors has been reached.
+                    // Try to accept new connections after a short sleep.
+                    std::this_thread::sleep_for(std::chrono::milliseconds(1));
+                    continue;
+                } else if (errno == EINTR || errno == EAGAIN) {
+                    continue;
+                }
+                if (svr_sock_ != INVALID_SOCKET) {
+                    detail::close_socket(svr_sock_);
+                    ret = false;
+                } else {
+                    ; // The server socket was closed by user.
+                }
+                break;
+            }
+
+            {
+#ifdef _WIN32
+                auto timeout = static_cast<uint32_t>(read_timeout_sec_ * 1000 +
+                                                     read_timeout_usec_ / 1000);
+                setsockopt(sock, SOL_SOCKET, SO_RCVTIMEO,
+                    reinterpret_cast<const char *>(&timeout), sizeof(timeout));
+#else
+                timeval tv;
+                tv.tv_sec = static_cast<long>(read_timeout_sec_);
+                tv.tv_usec = static_cast<decltype(tv.tv_usec)>(read_timeout_usec_);
+                setsockopt(sock, SOL_SOCKET, SO_RCVTIMEO,
+                    reinterpret_cast<const void *>(&tv), sizeof(tv));
+#endif
+            }
+            {
+
+#ifdef _WIN32
+                auto timeout = static_cast<uint32_t>(write_timeout_sec_ * 1000 +
+                                                     write_timeout_usec_ / 1000);
+                setsockopt(sock, SOL_SOCKET, SO_SNDTIMEO,
+                    reinterpret_cast<const char *>(&timeout), sizeof(timeout));
+#else
+                timeval tv;
+                tv.tv_sec = static_cast<long>(write_timeout_sec_);
+                tv.tv_usec = static_cast<decltype(tv.tv_usec)>(write_timeout_usec_);
+                setsockopt(sock, SOL_SOCKET, SO_SNDTIMEO,
+                    reinterpret_cast<const void *>(&tv), sizeof(tv));
+#endif
+            }
+
+            task_queue->enqueue([this, sock]() { process_and_close_socket(sock); });
+        }
+
+        task_queue->shutdown();
+    }
+
+    return ret;
+}
+
+inline bool Server::routing(Request &req, Response &res, Stream &strm) {
+    if (pre_routing_handler_ &&
+        pre_routing_handler_(req, res) == HandlerResponse::Handled) {
+        return true;
+    }
+
+    // File handler
+    auto is_head_request = req.method == "HEAD";
+    if ((req.method == "GET" || is_head_request) &&
+        handle_file_request(req, res, is_head_request)) {
+        return true;
+    }
+
+    if (detail::expect_content(req)) {
+        // Content reader handler
+        {
+            ContentReader reader(
+                [&](ContentReceiver receiver) {
+                    return read_content_with_content_receiver(
+                        strm, req, res, std::move(receiver), nullptr, nullptr);
+                },
+                [&](MultipartContentHeader header, ContentReceiver receiver) {
+                    return read_content_with_content_receiver(strm, req, res, nullptr,
+                        std::move(header),
+                        std::move(receiver));
+                });
+
+            if (req.method == "POST") {
+                if (dispatch_request_for_content_reader(
+                        req, res, std::move(reader),
+                        post_handlers_for_content_reader_)) {
+                    return true;
+                }
+            } else if (req.method == "PUT") {
+                if (dispatch_request_for_content_reader(
+                        req, res, std::move(reader),
+                        put_handlers_for_content_reader_)) {
+                    return true;
+                }
+            } else if (req.method == "PATCH") {
+                if (dispatch_request_for_content_reader(
+                        req, res, std::move(reader),
+                        patch_handlers_for_content_reader_)) {
+                    return true;
+                }
+            } else if (req.method == "DELETE") {
+                if (dispatch_request_for_content_reader(
+                        req, res, std::move(reader),
+                        delete_handlers_for_content_reader_)) {
+                    return true;
+                }
+            }
+        }
+
+        // Read content into `req.body`
+        if (!read_content(strm, req, res)) { return false; }
+    }
+
+    // Regular handler
+    if (req.method == "GET" || req.method == "HEAD") {
+        return dispatch_request(req, res, get_handlers_);
+    } else if (req.method == "POST") {
+        return dispatch_request(req, res, post_handlers_);
+    } else if (req.method == "PUT") {
+        return dispatch_request(req, res, put_handlers_);
+    } else if (req.method == "DELETE") {
+        return dispatch_request(req, res, delete_handlers_);
+    } else if (req.method == "OPTIONS") {
+        return dispatch_request(req, res, options_handlers_);
+    } else if (req.method == "PATCH") {
+        return dispatch_request(req, res, patch_handlers_);
+    }
+
+    res.status = StatusCode::BadRequest_400;
+    return false;
+}
+
+inline bool Server::dispatch_request(Request &req, Response &res,
+    const Handlers &handlers) const {
+    for (const auto &x : handlers) {
+        const auto &matcher = x.first;
+        const auto &handler = x.second;
+
+        if (matcher->match(req)) {
+            handler(req, res);
+            return true;
+        }
+    }
+    return false;
+}
+
+inline void Server::apply_ranges(const Request &req, Response &res,
+    std::string &content_type,
+    std::string &boundary) const {
+    if (req.ranges.size() > 1) {
+        boundary = detail::make_multipart_data_boundary();
+
+        auto it = res.headers.find("Content-Type");
+        if (it != res.headers.end()) {
+            content_type = it->second;
+            res.headers.erase(it);
+        }
+
+        res.set_header("Content-Type",
+            "multipart/byteranges; boundary=" + boundary);
+    }
+
+    auto type = detail::encoding_type(req, res);
+
+    if (res.body.empty()) {
+        if (res.content_length_ > 0) {
+            size_t length = 0;
+            if (req.ranges.empty()) {
+                length = res.content_length_;
+            } else if (req.ranges.size() == 1) {
+                auto offsets =
+                    detail::get_range_offset_and_length(req, res.content_length_, 0);
+                length = offsets.second;
+
+                auto content_range = detail::make_content_range_header_field(
+                    req.ranges[0], res.content_length_);
+                res.set_header("Content-Range", content_range);
+            } else {
+                length = detail::get_multipart_ranges_data_length(req, res, boundary,
+                    content_type);
+            }
+            res.set_header("Content-Length", std::to_string(length));
+        } else {
+            if (res.content_provider_) {
+                if (res.is_chunked_content_provider_) {
+                    res.set_header("Transfer-Encoding", "chunked");
+                    if (type == detail::EncodingType::Gzip) {
+                        res.set_header("Content-Encoding", "gzip");
+                    } else if (type == detail::EncodingType::Brotli) {
+                        res.set_header("Content-Encoding", "br");
+                    }
+                }
+            }
+        }
+    } else {
+        if (req.ranges.empty()) {
+            ;
+        } else if (req.ranges.size() == 1) {
+            auto content_range = detail::make_content_range_header_field(
+                req.ranges[0], res.body.size());
+            res.set_header("Content-Range", content_range);
+
+            auto offsets =
+                detail::get_range_offset_and_length(req, res.body.size(), 0);
+            auto offset = offsets.first;
+            auto length = offsets.second;
+
+            if (offset < res.body.size()) {
+                res.body = res.body.substr(offset, length);
+            } else {
+                res.body.clear();
+                res.status = StatusCode::RangeNotSatisfiable_416;
+            }
+        } else {
+            std::string data;
+            if (detail::make_multipart_ranges_data(req, res, boundary, content_type,
+                    data)) {
+                res.body.swap(data);
+            } else {
+                res.body.clear();
+                res.status = StatusCode::RangeNotSatisfiable_416;
+            }
+        }
+
+        if (type != detail::EncodingType::None) {
+            std::unique_ptr<detail::compressor> compressor;
+            std::string content_encoding;
+
+            if (type == detail::EncodingType::Gzip) {
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+                compressor = detail::make_unique<detail::gzip_compressor>();
+                content_encoding = "gzip";
+#endif
+            } else if (type == detail::EncodingType::Brotli) {
+#ifdef CPPHTTPLIB_BROTLI_SUPPORT
+                compressor = detail::make_unique<detail::brotli_compressor>();
+                content_encoding = "br";
+#endif
+            }
+
+            if (compressor) {
+                std::string compressed;
+                if (compressor->compress(res.body.data(), res.body.size(), true,
+                        [&](const char *data, size_t data_len) {
+                            compressed.append(data, data_len);
+                            return true;
+                        })) {
+                    res.body.swap(compressed);
+                    res.set_header("Content-Encoding", content_encoding);
+                }
+            }
+        }
+
+        auto length = std::to_string(res.body.size());
+        res.set_header("Content-Length", length);
+    }
+}
+
+inline bool Server::dispatch_request_for_content_reader(
+    Request &req, Response &res, ContentReader content_reader,
+    const HandlersForContentReader &handlers) const {
+    for (const auto &x : handlers) {
+        const auto &matcher = x.first;
+        const auto &handler = x.second;
+
+        if (matcher->match(req)) {
+            handler(req, res, content_reader);
+            return true;
+        }
+    }
+    return false;
+}
+
+inline bool
+Server::process_request(Stream &strm, bool close_connection,
+    bool &connection_closed,
+    const std::function<void(Request &)> &setup_request) {
+    std::array<char, 2048> buf{};
+
+    detail::stream_line_reader line_reader(strm, buf.data(), buf.size());
+
+    // Connection has been closed on client
+    if (!line_reader.getline()) { return false; }
+
+    Request req;
+
+    Response res;
+    res.version = "HTTP/1.1";
+    res.headers = default_headers_;
+
+#ifdef _WIN32
+    // TODO: Increase FD_SETSIZE statically (libzmq), dynamically (MySQL).
+#else
+#ifndef CPPHTTPLIB_USE_POLL
+    // Socket file descriptor exceeded FD_SETSIZE...
+    if (strm.socket() >= FD_SETSIZE) {
+        Headers dummy;
+        detail::read_headers(strm, dummy);
+        res.status = StatusCode::InternalServerError_500;
+        return write_response(strm, close_connection, req, res);
+    }
+#endif
+#endif
+
+    // Check if the request URI doesn't exceed the limit
+    if (line_reader.size() > CPPHTTPLIB_REQUEST_URI_MAX_LENGTH) {
+        Headers dummy;
+        detail::read_headers(strm, dummy);
+        res.status = StatusCode::UriTooLong_414;
+        return write_response(strm, close_connection, req, res);
+    }
+
+    // Request line and headers
+    if (!parse_request_line(line_reader.ptr(), req) ||
+        !detail::read_headers(strm, req.headers)) {
+        res.status = StatusCode::BadRequest_400;
+        return write_response(strm, close_connection, req, res);
+    }
+
+    if (req.get_header_value("Connection") == "close") {
+        connection_closed = true;
+    }
+
+    if (req.version == "HTTP/1.0" &&
+        req.get_header_value("Connection") != "Keep-Alive") {
+        connection_closed = true;
+    }
+
+    strm.get_remote_ip_and_port(req.remote_addr, req.remote_port);
+    req.set_header("REMOTE_ADDR", req.remote_addr);
+    req.set_header("REMOTE_PORT", std::to_string(req.remote_port));
+
+    strm.get_local_ip_and_port(req.local_addr, req.local_port);
+    req.set_header("LOCAL_ADDR", req.local_addr);
+    req.set_header("LOCAL_PORT", std::to_string(req.local_port));
+
+    if (req.has_header("Range")) {
+        const auto &range_header_value = req.get_header_value("Range");
+        if (!detail::parse_range_header(range_header_value, req.ranges)) {
+            res.status = StatusCode::RangeNotSatisfiable_416;
+            return write_response(strm, close_connection, req, res);
+        }
+    }
+
+    if (setup_request) { setup_request(req); }
+
+    if (req.get_header_value("Expect") == "100-continue") {
+        int status = StatusCode::Continue_100;
+        if (expect_100_continue_handler_) {
+            status = expect_100_continue_handler_(req, res);
+        }
+        switch (status) {
+        case StatusCode::Continue_100:
+        case StatusCode::ExpectationFailed_417:
+            strm.write_format("HTTP/1.1 %d %s\r\n\r\n", status,
+                status_message(status));
+            break;
+        default: return write_response(strm, close_connection, req, res);
+        }
+    }
+
+    // Rounting
+    auto routed = false;
+#ifdef CPPHTTPLIB_NO_EXCEPTIONS
+    routed = routing(req, res, strm);
+#else
+    try {
+        routed = routing(req, res, strm);
+    } catch (std::exception &e) {
+        if (exception_handler_) {
+            auto ep = std::current_exception();
+            exception_handler_(req, res, ep);
+            routed = true;
+        } else {
+            res.status = StatusCode::InternalServerError_500;
+            std::string val;
+            auto s = e.what();
+            for (size_t i = 0; s[i]; i++) {
+                switch (s[i]) {
+                case '\r': val += "\\r"; break;
+                case '\n': val += "\\n"; break;
+                default: val += s[i]; break;
+                }
+            }
+            res.set_header("EXCEPTION_WHAT", val);
+        }
+    } catch (...) {
+        if (exception_handler_) {
+            auto ep = std::current_exception();
+            exception_handler_(req, res, ep);
+            routed = true;
+        } else {
+            res.status = StatusCode::InternalServerError_500;
+            res.set_header("EXCEPTION_WHAT", "UNKNOWN");
+        }
+    }
+#endif
+
+    if (routed) {
+        if (res.status == -1) {
+            res.status = req.ranges.empty() ? StatusCode::OK_200
+                                              : StatusCode::PartialContent_206;
+        }
+        return write_response_with_content(strm, close_connection, req, res);
+    } else {
+        if (res.status == -1) { res.status = StatusCode::NotFound_404; }
+        return write_response(strm, close_connection, req, res);
+    }
+}
+
+inline bool Server::is_valid() const { return true; }
+
+inline bool Server::process_and_close_socket(socket_t sock) {
+    auto ret = detail::process_server_socket(
+        svr_sock_, sock, keep_alive_max_count_, keep_alive_timeout_sec_,
+        read_timeout_sec_, read_timeout_usec_, write_timeout_sec_,
+        write_timeout_usec_,
+        [this](Stream &strm, bool close_connection, bool &connection_closed) {
+            return process_request(strm, close_connection, connection_closed,
+                nullptr);
+        });
+
+    detail::shutdown_socket(sock);
+    detail::close_socket(sock);
+    return ret;
+}
+
+// HTTP client implementation
+inline ClientImpl::ClientImpl(const std::string &host)
+    : ClientImpl(host, 80, std::string(), std::string()) {}
+
+inline ClientImpl::ClientImpl(const std::string &host, int port)
+    : ClientImpl(host, port, std::string(), std::string()) {}
+
+inline ClientImpl::ClientImpl(const std::string &host, int port,
+    const std::string &client_cert_path,
+    const std::string &client_key_path)
+    : host_(host), port_(port),
+      host_and_port_(adjust_host_string(host) + ":" + std::to_string(port)),
+      client_cert_path_(client_cert_path), client_key_path_(client_key_path) {}
+
+inline ClientImpl::~ClientImpl() {
+    std::lock_guard<std::mutex> guard(socket_mutex_);
+    shutdown_socket(socket_);
+    close_socket(socket_);
+}
+
+inline bool ClientImpl::is_valid() const { return true; }
+
+inline void ClientImpl::copy_settings(const ClientImpl &rhs) {
+    client_cert_path_ = rhs.client_cert_path_;
+    client_key_path_ = rhs.client_key_path_;
+    connection_timeout_sec_ = rhs.connection_timeout_sec_;
+    read_timeout_sec_ = rhs.read_timeout_sec_;
+    read_timeout_usec_ = rhs.read_timeout_usec_;
+    write_timeout_sec_ = rhs.write_timeout_sec_;
+    write_timeout_usec_ = rhs.write_timeout_usec_;
+    basic_auth_username_ = rhs.basic_auth_username_;
+    basic_auth_password_ = rhs.basic_auth_password_;
+    bearer_token_auth_token_ = rhs.bearer_token_auth_token_;
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    digest_auth_username_ = rhs.digest_auth_username_;
+    digest_auth_password_ = rhs.digest_auth_password_;
+#endif
+    keep_alive_ = rhs.keep_alive_;
+    follow_location_ = rhs.follow_location_;
+    url_encode_ = rhs.url_encode_;
+    address_family_ = rhs.address_family_;
+    tcp_nodelay_ = rhs.tcp_nodelay_;
+    socket_options_ = rhs.socket_options_;
+    compress_ = rhs.compress_;
+    decompress_ = rhs.decompress_;
+    interface_ = rhs.interface_;
+    proxy_host_ = rhs.proxy_host_;
+    proxy_port_ = rhs.proxy_port_;
+    proxy_basic_auth_username_ = rhs.proxy_basic_auth_username_;
+    proxy_basic_auth_password_ = rhs.proxy_basic_auth_password_;
+    proxy_bearer_token_auth_token_ = rhs.proxy_bearer_token_auth_token_;
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    proxy_digest_auth_username_ = rhs.proxy_digest_auth_username_;
+    proxy_digest_auth_password_ = rhs.proxy_digest_auth_password_;
+#endif
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    ca_cert_file_path_ = rhs.ca_cert_file_path_;
+    ca_cert_dir_path_ = rhs.ca_cert_dir_path_;
+    ca_cert_store_ = rhs.ca_cert_store_;
+#endif
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    server_certificate_verification_ = rhs.server_certificate_verification_;
+#endif
+    logger_ = rhs.logger_;
+}
+
+inline socket_t ClientImpl::create_client_socket(Error &error) const {
+    if (!proxy_host_.empty() && proxy_port_ != -1) {
+        return detail::create_client_socket(
+            proxy_host_, std::string(), proxy_port_, address_family_, tcp_nodelay_,
+            socket_options_, connection_timeout_sec_, connection_timeout_usec_,
+            read_timeout_sec_, read_timeout_usec_, write_timeout_sec_,
+            write_timeout_usec_, interface_, error);
+    }
+
+    // Check is custom IP specified for host_
+    std::string ip;
+    auto it = addr_map_.find(host_);
+    if (it != addr_map_.end()) { ip = it->second; }
+
+    return detail::create_client_socket(
+        host_, ip, port_, address_family_, tcp_nodelay_, socket_options_,
+        connection_timeout_sec_, connection_timeout_usec_, read_timeout_sec_,
+        read_timeout_usec_, write_timeout_sec_, write_timeout_usec_, interface_,
+        error);
+}
+
+inline bool ClientImpl::create_and_connect_socket(Socket &socket,
+    Error &error) {
+    auto sock = create_client_socket(error);
+    if (sock == INVALID_SOCKET) { return false; }
+    socket.sock = sock;
+    return true;
+}
+
+inline void ClientImpl::shutdown_ssl(Socket & /*socket*/,
+    bool /*shutdown_gracefully*/) {
+    // If there are any requests in flight from threads other than us, then it's
+    // a thread-unsafe race because individual ssl* objects are not thread-safe.
+    assert(socket_requests_in_flight_ == 0 ||
+           socket_requests_are_from_thread_ == std::this_thread::get_id());
+}
+
+inline void ClientImpl::shutdown_socket(Socket &socket) const {
+    if (socket.sock == INVALID_SOCKET) { return; }
+    detail::shutdown_socket(socket.sock);
+}
+
+inline void ClientImpl::close_socket(Socket &socket) {
+    // If there are requests in flight in another thread, usually closing
+    // the socket will be fine and they will simply receive an error when
+    // using the closed socket, but it is still a bug since rarely the OS
+    // may reassign the socket id to be used for a new socket, and then
+    // suddenly they will be operating on a live socket that is different
+    // than the one they intended!
+    assert(socket_requests_in_flight_ == 0 ||
+           socket_requests_are_from_thread_ == std::this_thread::get_id());
+
+    // It is also a bug if this happens while SSL is still active
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    assert(socket.ssl == nullptr);
+#endif
+    if (socket.sock == INVALID_SOCKET) { return; }
+    detail::close_socket(socket.sock);
+    socket.sock = INVALID_SOCKET;
+}
+
+inline bool ClientImpl::read_response_line(Stream &strm, const Request &req,
+    Response &res) const {
+    std::array<char, 2048> buf{};
+
+    detail::stream_line_reader line_reader(strm, buf.data(), buf.size());
+
+    if (!line_reader.getline()) { return false; }
+
+#ifdef CPPHTTPLIB_ALLOW_LF_AS_LINE_TERMINATOR
+    const static std::regex re("(HTTP/1\\.[01]) (\\d{3})(?: (.*?))?\r?\n");
+#else
+    const static std::regex re("(HTTP/1\\.[01]) (\\d{3})(?: (.*?))?\r\n");
+#endif
+
+    std::cmatch m;
+    if (!std::regex_match(line_reader.ptr(), m, re)) {
+        return req.method == "CONNECT";
+    }
+    res.version = std::string(m[1]);
+    res.status = std::stoi(std::string(m[2]));
+    res.reason = std::string(m[3]);
+
+    // Ignore '100 Continue'
+    while (res.status == StatusCode::Continue_100) {
+        if (!line_reader.getline()) { return false; } // CRLF
+        if (!line_reader.getline()) { return false; } // next response line
+
+        if (!std::regex_match(line_reader.ptr(), m, re)) { return false; }
+        res.version = std::string(m[1]);
+        res.status = std::stoi(std::string(m[2]));
+        res.reason = std::string(m[3]);
+    }
+
+    return true;
+}
+
+inline bool ClientImpl::send(Request &req, Response &res, Error &error) {
+    std::lock_guard<std::recursive_mutex> request_mutex_guard(request_mutex_);
+    auto ret = send_(req, res, error);
+    if (error == Error::SSLPeerCouldBeClosed_) {
+        assert(!ret);
+        ret = send_(req, res, error);
+    }
+    return ret;
+}
+
+inline bool ClientImpl::send_(Request &req, Response &res, Error &error) {
+    {
+        std::lock_guard<std::mutex> guard(socket_mutex_);
+
+        // Set this to false immediately - if it ever gets set to true by the end of
+        // the request, we know another thread instructed us to close the socket.
+        socket_should_be_closed_when_request_is_done_ = false;
+
+        auto is_alive = false;
+        if (socket_.is_open()) {
+            is_alive = detail::is_socket_alive(socket_.sock);
+            if (!is_alive) {
+                // Attempt to avoid sigpipe by shutting down nongracefully if it seems
+                // like the other side has already closed the connection Also, there
+                // cannot be any requests in flight from other threads since we locked
+                // request_mutex_, so safe to close everything immediately
+                const bool shutdown_gracefully = false;
+                shutdown_ssl(socket_, shutdown_gracefully);
+                shutdown_socket(socket_);
+                close_socket(socket_);
+            }
+        }
+
+        if (!is_alive) {
+            if (!create_and_connect_socket(socket_, error)) { return false; }
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+            // TODO: refactoring
+            if (is_ssl()) {
+                auto &scli = static_cast<SSLClient &>(*this);
+                if (!proxy_host_.empty() && proxy_port_ != -1) {
+                    auto success = false;
+                    if (!scli.connect_with_proxy(socket_, res, success, error)) {
+                        return success;
+                    }
+                }
+
+                if (!scli.initialize_ssl(socket_, error)) { return false; }
+            }
+#endif
+        }
+
+        // Mark the current socket as being in use so that it cannot be closed by
+        // anyone else while this request is ongoing, even though we will be
+        // releasing the mutex.
+        if (socket_requests_in_flight_ > 1) {
+            assert(socket_requests_are_from_thread_ == std::this_thread::get_id());
+        }
+        socket_requests_in_flight_ += 1;
+        socket_requests_are_from_thread_ = std::this_thread::get_id();
+    }
+
+    for (const auto &header : default_headers_) {
+        if (req.headers.find(header.first) == req.headers.end()) {
+            req.headers.insert(header);
+        }
+    }
+
+    auto ret = false;
+    auto close_connection = !keep_alive_;
+
+    auto se = detail::scope_exit([&]() {
+        // Briefly lock mutex in order to mark that a request is no longer ongoing
+        std::lock_guard<std::mutex> guard(socket_mutex_);
+        socket_requests_in_flight_ -= 1;
+        if (socket_requests_in_flight_ <= 0) {
+            assert(socket_requests_in_flight_ == 0);
+            socket_requests_are_from_thread_ = std::thread::id();
+        }
+
+        if (socket_should_be_closed_when_request_is_done_ || close_connection ||
+            !ret) {
+            shutdown_ssl(socket_, true);
+            shutdown_socket(socket_);
+            close_socket(socket_);
+        }
+    });
+
+    ret = process_socket(socket_, [&](Stream &strm) {
+        return handle_request(strm, req, res, close_connection, error);
+    });
+
+    if (!ret) {
+        if (error == Error::Success) { error = Error::Unknown; }
+    }
+
+    return ret;
+}
+
+inline Result ClientImpl::send(const Request &req) {
+    auto req2 = req;
+    return send_(std::move(req2));
+}
+
+inline Result ClientImpl::send_(Request &&req) {
+    auto res = detail::make_unique<Response>();
+    auto error = Error::Success;
+    auto ret = send(req, *res, error);
+    return Result{ret ? std::move(res) : nullptr, error, std::move(req.headers)};
+}
+
+inline bool ClientImpl::handle_request(Stream &strm, Request &req,
+    Response &res, bool close_connection,
+    Error &error) {
+    if (req.path.empty()) {
+        error = Error::Connection;
+        return false;
+    }
+
+    auto req_save = req;
+
+    bool ret;
+
+    if (!is_ssl() && !proxy_host_.empty() && proxy_port_ != -1) {
+        auto req2 = req;
+        req2.path = "http://" + host_and_port_ + req.path;
+        ret = process_request(strm, req2, res, close_connection, error);
+        req = req2;
+        req.path = req_save.path;
+    } else {
+        ret = process_request(strm, req, res, close_connection, error);
+    }
+
+    if (!ret) { return false; }
+
+    if (res.get_header_value("Connection") == "close" ||
+        (res.version == "HTTP/1.0" && res.reason != "Connection established")) {
+        // TODO this requires a not-entirely-obvious chain of calls to be correct
+        // for this to be safe.
+
+        // This is safe to call because handle_request is only called by send_
+        // which locks the request mutex during the process. It would be a bug
+        // to call it from a different thread since it's a thread-safety issue
+        // to do these things to the socket if another thread is using the socket.
+        std::lock_guard<std::mutex> guard(socket_mutex_);
+        shutdown_ssl(socket_, true);
+        shutdown_socket(socket_);
+        close_socket(socket_);
+    }
+
+    if (300 < res.status && res.status < 400 && follow_location_) {
+        req = req_save;
+        ret = redirect(req, res, error);
+    }
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    if ((res.status == StatusCode::Unauthorized_401 ||
+            res.status == StatusCode::ProxyAuthenticationRequired_407) &&
+        req.authorization_count_ < 5) {
+        auto is_proxy = res.status == StatusCode::ProxyAuthenticationRequired_407;
+        const auto &username =
+            is_proxy ? proxy_digest_auth_username_ : digest_auth_username_;
+        const auto &password =
+            is_proxy ? proxy_digest_auth_password_ : digest_auth_password_;
+
+        if (!username.empty() && !password.empty()) {
+            std::map<std::string, std::string> auth;
+            if (detail::parse_www_authenticate(res, auth, is_proxy)) {
+                Request new_req = req;
+                new_req.authorization_count_ += 1;
+                new_req.headers.erase(is_proxy ? "Proxy-Authorization"
+                                                 : "Authorization");
+                new_req.headers.insert(detail::make_digest_authentication_header(
+                    req, auth, new_req.authorization_count_, detail::random_string(10),
+                    username, password, is_proxy));
+
+                Response new_res;
+
+                ret = send(new_req, new_res, error);
+                if (ret) { res = new_res; }
+            }
+        }
+    }
+#endif
+
+    return ret;
+}
+
+inline bool ClientImpl::redirect(Request &req, Response &res, Error &error) {
+    if (req.redirect_count_ == 0) {
+        error = Error::ExceedRedirectCount;
+        return false;
+    }
+
+    auto location = res.get_header_value("location");
+    if (location.empty()) { return false; }
+
+    const static std::regex re(
+        R"((?:(https?):)?(?://(?:\[([\d:]+)\]|([^:/?#]+))(?::(\d+))?)?([^?#]*)(\?[^#]*)?(?:#.*)?)");
+
+    std::smatch m;
+    if (!std::regex_match(location, m, re)) { return false; }
+
+    auto scheme = is_ssl() ? "https" : "http";
+
+    auto next_scheme = m[1].str();
+    auto next_host = m[2].str();
+    if (next_host.empty()) { next_host = m[3].str(); }
+    auto port_str = m[4].str();
+    auto next_path = m[5].str();
+    auto next_query = m[6].str();
+
+    auto next_port = port_;
+    if (!port_str.empty()) {
+        next_port = std::stoi(port_str);
+    } else if (!next_scheme.empty()) {
+        next_port = next_scheme == "https" ? 443 : 80;
+    }
+
+    if (next_scheme.empty()) { next_scheme = scheme; }
+    if (next_host.empty()) { next_host = host_; }
+    if (next_path.empty()) { next_path = "/"; }
+
+    auto path = detail::decode_url(next_path, true) + next_query;
+
+    if (next_scheme == scheme && next_host == host_ && next_port == port_) {
+        return detail::redirect(*this, req, res, path, location, error);
+    } else {
+        if (next_scheme == "https") {
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+            SSLClient cli(next_host, next_port);
+            cli.copy_settings(*this);
+            if (ca_cert_store_) { cli.set_ca_cert_store(ca_cert_store_); }
+            return detail::redirect(cli, req, res, path, location, error);
+#else
+            return false;
+#endif
+        } else {
+            ClientImpl cli(next_host, next_port);
+            cli.copy_settings(*this);
+            return detail::redirect(cli, req, res, path, location, error);
+        }
+    }
+}
+
+inline bool ClientImpl::write_content_with_provider(Stream &strm,
+    const Request &req,
+    Error &error) const {
+    auto is_shutting_down = []() { return false; };
+
+    if (req.is_chunked_content_provider_) {
+        // TODO: Brotli support
+        std::unique_ptr<detail::compressor> compressor;
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+        if (compress_) {
+            compressor = detail::make_unique<detail::gzip_compressor>();
+        } else
+#endif
+        {
+            compressor = detail::make_unique<detail::nocompressor>();
+        }
+
+        return detail::write_content_chunked(strm, req.content_provider_,
+            is_shutting_down, *compressor, error);
+    } else {
+        return detail::write_content(strm, req.content_provider_, 0,
+            req.content_length_, is_shutting_down, error);
+    }
+}
+
+inline bool ClientImpl::write_request(Stream &strm, Request &req,
+    bool close_connection, Error &error) {
+    // Prepare additional headers
+    if (close_connection) {
+        if (!req.has_header("Connection")) {
+            req.set_header("Connection", "close");
+        }
+    }
+
+    if (!req.has_header("Host")) {
+        if (is_ssl()) {
+            if (port_ == 443) {
+                req.set_header("Host", host_);
+            } else {
+                req.set_header("Host", host_and_port_);
+            }
+        } else {
+            if (port_ == 80) {
+                req.set_header("Host", host_);
+            } else {
+                req.set_header("Host", host_and_port_);
+            }
+        }
+    }
+
+    if (!req.has_header("Accept")) { req.set_header("Accept", "*/*"); }
+
+#ifndef CPPHTTPLIB_NO_DEFAULT_USER_AGENT
+    if (!req.has_header("User-Agent")) {
+        auto agent = std::string("cpp-httplib/") + CPPHTTPLIB_VERSION;
+        req.set_header("User-Agent", agent);
+    }
+#endif
+
+    if (req.body.empty()) {
+        if (req.content_provider_) {
+            if (!req.is_chunked_content_provider_) {
+                if (!req.has_header("Content-Length")) {
+                    auto length = std::to_string(req.content_length_);
+                    req.set_header("Content-Length", length);
+                }
+            }
+        } else {
+            if (req.method == "POST" || req.method == "PUT" ||
+                req.method == "PATCH") {
+                req.set_header("Content-Length", "0");
+            }
+        }
+    } else {
+        if (!req.has_header("Content-Type")) {
+            req.set_header("Content-Type", "text/plain");
+        }
+
+        if (!req.has_header("Content-Length")) {
+            auto length = std::to_string(req.body.size());
+            req.set_header("Content-Length", length);
+        }
+    }
+
+    if (!basic_auth_password_.empty() || !basic_auth_username_.empty()) {
+        if (!req.has_header("Authorization")) {
+            req.headers.insert(make_basic_authentication_header(
+                basic_auth_username_, basic_auth_password_, false));
+        }
+    }
+
+    if (!proxy_basic_auth_username_.empty() &&
+        !proxy_basic_auth_password_.empty()) {
+        if (!req.has_header("Proxy-Authorization")) {
+            req.headers.insert(make_basic_authentication_header(
+                proxy_basic_auth_username_, proxy_basic_auth_password_, true));
+        }
+    }
+
+    if (!bearer_token_auth_token_.empty()) {
+        if (!req.has_header("Authorization")) {
+            req.headers.insert(make_bearer_token_authentication_header(
+                bearer_token_auth_token_, false));
+        }
+    }
+
+    if (!proxy_bearer_token_auth_token_.empty()) {
+        if (!req.has_header("Proxy-Authorization")) {
+            req.headers.insert(make_bearer_token_authentication_header(
+                proxy_bearer_token_auth_token_, true));
+        }
+    }
+
+    // Request line and headers
+    {
+        detail::BufferStream bstrm;
+
+        const auto &path = url_encode_ ? detail::encode_url(req.path) : req.path;
+        bstrm.write_format("%s %s HTTP/1.1\r\n", req.method.c_str(), path.c_str());
+
+        header_writer_(bstrm, req.headers);
+
+        // Flush buffer
+        auto &data = bstrm.get_buffer();
+        if (!detail::write_data(strm, data.data(), data.size())) {
+            error = Error::Write;
+            return false;
+        }
+    }
+
+    // Body
+    if (req.body.empty()) {
+        return write_content_with_provider(strm, req, error);
+    }
+
+    if (!detail::write_data(strm, req.body.data(), req.body.size())) {
+        error = Error::Write;
+        return false;
+    }
+
+    return true;
+}
+
+inline std::unique_ptr<Response> ClientImpl::send_with_content_provider(
+    Request &req, const char *body, size_t content_length,
+    ContentProvider content_provider,
+    ContentProviderWithoutLength content_provider_without_length,
+    const std::string &content_type, Error &error) {
+    if (!content_type.empty()) { req.set_header("Content-Type", content_type); }
+
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+    if (compress_) { req.set_header("Content-Encoding", "gzip"); }
+#endif
+
+#ifdef CPPHTTPLIB_ZLIB_SUPPORT
+    if (compress_ && !content_provider_without_length) {
+        // TODO: Brotli support
+        detail::gzip_compressor compressor;
+
+        if (content_provider) {
+            auto ok = true;
+            size_t offset = 0;
+            DataSink data_sink;
+
+            data_sink.write = [&](const char *data, size_t data_len) -> bool {
+                if (ok) {
+                    auto last = offset + data_len == content_length;
+
+                    auto ret = compressor.compress(
+                        data, data_len, last,
+                        [&](const char *compressed_data, size_t compressed_data_len) {
+                            req.body.append(compressed_data, compressed_data_len);
+                            return true;
+                        });
+
+                    if (ret) {
+                        offset += data_len;
+                    } else {
+                        ok = false;
+                    }
+                }
+                return ok;
+            };
+
+            while (ok && offset < content_length) {
+                if (!content_provider(offset, content_length - offset, data_sink)) {
+                    error = Error::Canceled;
+                    return nullptr;
+                }
+            }
+        } else {
+            if (!compressor.compress(body, content_length, true,
+                    [&](const char *data, size_t data_len) {
+                        req.body.append(data, data_len);
+                        return true;
+                    })) {
+                error = Error::Compression;
+                return nullptr;
+            }
+        }
+    } else
+#endif
+    {
+        if (content_provider) {
+            req.content_length_ = content_length;
+            req.content_provider_ = std::move(content_provider);
+            req.is_chunked_content_provider_ = false;
+        } else if (content_provider_without_length) {
+            req.content_length_ = 0;
+            req.content_provider_ = detail::ContentProviderAdapter(
+                std::move(content_provider_without_length));
+            req.is_chunked_content_provider_ = true;
+            req.set_header("Transfer-Encoding", "chunked");
+        } else {
+            req.body.assign(body, content_length);
+        }
+    }
+
+    auto res = detail::make_unique<Response>();
+    return send(req, *res, error) ? std::move(res) : nullptr;
+}
+
+inline Result ClientImpl::send_with_content_provider(
+    const std::string &method, const std::string &path, const Headers &headers,
+    const char *body, size_t content_length, ContentProvider content_provider,
+    ContentProviderWithoutLength content_provider_without_length,
+    const std::string &content_type) {
+    Request req;
+    req.method = method;
+    req.headers = headers;
+    req.path = path;
+
+    auto error = Error::Success;
+
+    auto res = send_with_content_provider(
+        req, body, content_length, std::move(content_provider),
+        std::move(content_provider_without_length), content_type, error);
+
+    return Result{std::move(res), error, std::move(req.headers)};
+}
+
+inline std::string
+ClientImpl::adjust_host_string(const std::string &host) const {
+    if (host.find(':') != std::string::npos) { return "[" + host + "]"; }
+    return host;
+}
+
+inline bool ClientImpl::process_request(Stream &strm, Request &req,
+    Response &res, bool close_connection,
+    Error &error) {
+    // Send request
+    if (!write_request(strm, req, close_connection, error)) { return false; }
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+    if (is_ssl()) {
+        auto is_proxy_enabled = !proxy_host_.empty() && proxy_port_ != -1;
+        if (!is_proxy_enabled) {
+            char buf[1];
+            if (SSL_peek(socket_.ssl, buf, 1) == 0 &&
+                SSL_get_error(socket_.ssl, 0) == SSL_ERROR_ZERO_RETURN) {
+                error = Error::SSLPeerCouldBeClosed_;
+                return false;
+            }
+        }
+    }
+#endif
+
+    // Receive response and headers
+    if (!read_response_line(strm, req, res) ||
+        !detail::read_headers(strm, res.headers)) {
+        error = Error::Read;
+        return false;
+    }
+
+    // Body
+    if ((res.status != StatusCode::NoContent_204) && req.method != "HEAD" &&
+        req.method != "CONNECT") {
+        auto redirect = 300 < res.status && res.status < 400 && follow_location_;
+
+        if (req.response_handler && !redirect) {
+            if (!req.response_handler(res)) {
+                error = Error::Canceled;
+                return false;
+            }
+        }
+
+        auto out =
+            req.content_receiver
+                ? static_cast<ContentReceiverWithProgress>(
+                    [&](const char *buf, size_t n, uint64_t off, uint64_t len) {
+                        if (redirect) { return true; }
+                        auto ret = req.content_receiver(buf, n, off, len);
+                        if (!ret) { error = Error::Canceled; }
+                        return ret;
+                    })
+                : static_cast<ContentReceiverWithProgress>(
+                    [&](const char *buf, size_t n, uint64_t /*off*/,
+                        uint64_t /*len*/) {
+                        if (res.body.size() + n > res.body.max_size()) {
+                            return false;
+                        }
+                        res.body.append(buf, n);
+                        return true;
+                    });
+
+        auto progress = [&](uint64_t current, uint64_t total) {
+            if (!req.progress || redirect) { return true; }
+            auto ret = req.progress(current, total);
+            if (!ret) { error = Error::Canceled; }
+            return ret;
+        };
+
+        int dummy_status;
+        if (!detail::read_content(strm, res, (std::numeric_limits<size_t>::max)(),
+                dummy_status, std::move(progress), std::move(out),
+                decompress_)) {
+            if (error != Error::Canceled) { error = Error::Read; }
+            return false;
+        }
+    }
+
+    // Log
+    if (logger_) { logger_(req, res); }
+
+    return true;
+}
+
+inline ContentProviderWithoutLength ClientImpl::get_multipart_content_provider(
+    const std::string &boundary, const MultipartFormDataItems &items,
+    const MultipartFormDataProviderItems &provider_items) const {
+    size_t cur_item = 0;
+    size_t cur_start = 0;
+    // cur_item and cur_start are copied to within the std::function and maintain
+    // state between successive calls
+    return [&, cur_item, cur_start](size_t offset,
+               DataSink &sink) mutable -> bool {
+        if (!offset && !items.empty()) {
+            sink.os << detail::serialize_multipart_formdata(items, boundary, false);
+            return true;
+        } else if (cur_item < provider_items.size()) {
+            if (!cur_start) {
+                const auto &begin = detail::serialize_multipart_formdata_item_begin(
+                    provider_items[cur_item], boundary);
+                offset += begin.size();
+                cur_start = offset;
+                sink.os << begin;
+            }
+
+            DataSink cur_sink;
+            auto has_data = true;
+            cur_sink.write = sink.write;
+            cur_sink.done = [&]() { has_data = false; };
+
+            if (!provider_items[cur_item].provider(offset - cur_start, cur_sink)) {
+                return false;
+            }
+
+            if (!has_data) {
+                sink.os << detail::serialize_multipart_formdata_item_end();
+                cur_item++;
+                cur_start = 0;
+            }
+            return true;
+        } else {
+            sink.os << detail::serialize_multipart_formdata_finish(boundary);
+            sink.done();
+            return true;
+        }
+    };
+}
+
+inline bool
+ClientImpl::process_socket(const Socket &socket,
+    std::function<bool(Stream &strm)> callback) {
+    return detail::process_client_socket(
+        socket.sock, read_timeout_sec_, read_timeout_usec_, write_timeout_sec_,
+        write_timeout_usec_, std::move(callback));
+}
+
+inline bool ClientImpl::is_ssl() const { return false; }
+
+inline Result ClientImpl::Get(const std::string &path) {
+    return Get(path, Headers(), Progress());
+}
+
+inline Result ClientImpl::Get(const std::string &path, Progress progress) {
+    return Get(path, Headers(), std::move(progress));
+}
+
+inline Result ClientImpl::Get(const std::string &path, const Headers &headers) {
+    return Get(path, headers, Progress());
+}
+
+inline Result ClientImpl::Get(const std::string &path, const Headers &headers,
+    Progress progress) {
+    Request req;
+    req.method = "GET";
+    req.path = path;
+    req.headers = headers;
+    req.progress = std::move(progress);
+
+    return send_(std::move(req));
+}
+
+inline Result ClientImpl::Get(const std::string &path,
+    ContentReceiver content_receiver) {
+    return Get(path, Headers(), nullptr, std::move(content_receiver), nullptr);
+}
+
+inline Result ClientImpl::Get(const std::string &path,
+    ContentReceiver content_receiver,
+    Progress progress) {
+    return Get(path, Headers(), nullptr, std::move(content_receiver),
+        std::move(progress));
+}
+
+inline Result ClientImpl::Get(const std::string &path, const Headers &headers,
+    ContentReceiver content_receiver) {
+    return Get(path, headers, nullptr, std::move(content_receiver), nullptr);
+}
+
+inline Result ClientImpl::Get(const std::string &path, const Headers &headers,
+    ContentReceiver content_receiver,
+    Progress progress) {
+    return Get(path, headers, nullptr, std::move(content_receiver),
+        std::move(progress));
+}
+
+inline Result ClientImpl::Get(const std::string &path,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver) {
+    return Get(path, Headers(), std::move(response_handler),
+        std::move(content_receiver), nullptr);
+}
+
+inline Result ClientImpl::Get(const std::string &path, const Headers &headers,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver) {
+    return Get(path, headers, std::move(response_handler),
+        std::move(content_receiver), nullptr);
+}
+
+inline Result ClientImpl::Get(const std::string &path,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver,
+    Progress progress) {
+    return Get(path, Headers(), std::move(response_handler),
+        std::move(content_receiver), std::move(progress));
+}
+
+inline Result ClientImpl::Get(const std::string &path, const Headers &headers,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver,
+    Progress progress) {
+    Request req;
+    req.method = "GET";
+    req.path = path;
+    req.headers = headers;
+    req.response_handler = std::move(response_handler);
+    req.content_receiver =
+        [content_receiver](const char *data, size_t data_length,
+            uint64_t /*offset*/, uint64_t /*total_length*/) {
+            return content_receiver(data, data_length);
+        };
+    req.progress = std::move(progress);
+
+    return send_(std::move(req));
+}
+
+inline Result ClientImpl::Get(const std::string &path, const Params &params,
+    const Headers &headers, Progress progress) {
+    if (params.empty()) { return Get(path, headers); }
+
+    std::string path_with_query = append_query_params(path, params);
+    return Get(path_with_query, headers, progress);
+}
+
+inline Result ClientImpl::Get(const std::string &path, const Params &params,
+    const Headers &headers,
+    ContentReceiver content_receiver,
+    Progress progress) {
+    return Get(path, params, headers, nullptr, content_receiver, progress);
+}
+
+inline Result ClientImpl::Get(const std::string &path, const Params &params,
+    const Headers &headers,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver,
+    Progress progress) {
+    if (params.empty()) {
+        return Get(path, headers, response_handler, content_receiver, progress);
+    }
+
+    std::string path_with_query = append_query_params(path, params);
+    return Get(path_with_query, headers, response_handler, content_receiver,
+        progress);
+}
+
+inline Result ClientImpl::Head(const std::string &path) {
+    return Head(path, Headers());
+}
+
+inline Result ClientImpl::Head(const std::string &path,
+    const Headers &headers) {
+    Request req;
+    req.method = "HEAD";
+    req.headers = headers;
+    req.path = path;
+
+    return send_(std::move(req));
+}
+
+inline Result ClientImpl::Post(const std::string &path) {
+    return Post(path, std::string(), std::string());
+}
+
+inline Result ClientImpl::Post(const std::string &path,
+    const Headers &headers) {
+    return Post(path, headers, nullptr, 0, std::string());
+}
+
+inline Result ClientImpl::Post(const std::string &path, const char *body,
+    size_t content_length,
+    const std::string &content_type) {
+    return Post(path, Headers(), body, content_length, content_type);
+}
+
+inline Result ClientImpl::Post(const std::string &path, const Headers &headers,
+    const char *body, size_t content_length,
+    const std::string &content_type) {
+    return send_with_content_provider("POST", path, headers, body, content_length,
+        nullptr, nullptr, content_type);
+}
+
+inline Result ClientImpl::Post(const std::string &path, const std::string &body,
+    const std::string &content_type) {
+    return Post(path, Headers(), body, content_type);
+}
+
+inline Result ClientImpl::Post(const std::string &path, const Headers &headers,
+    const std::string &body,
+    const std::string &content_type) {
+    return send_with_content_provider("POST", path, headers, body.data(),
+        body.size(), nullptr, nullptr,
+        content_type);
+}
+
+inline Result ClientImpl::Post(const std::string &path, const Params &params) {
+    return Post(path, Headers(), params);
+}
+
+inline Result ClientImpl::Post(const std::string &path, size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return Post(path, Headers(), content_length, std::move(content_provider),
+        content_type);
+}
+
+inline Result ClientImpl::Post(const std::string &path,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return Post(path, Headers(), std::move(content_provider), content_type);
+}
+
+inline Result ClientImpl::Post(const std::string &path, const Headers &headers,
+    size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return send_with_content_provider("POST", path, headers, nullptr,
+        content_length, std::move(content_provider),
+        nullptr, content_type);
+}
+
+inline Result ClientImpl::Post(const std::string &path, const Headers &headers,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return send_with_content_provider("POST", path, headers, nullptr, 0, nullptr,
+        std::move(content_provider), content_type);
+}
+
+inline Result ClientImpl::Post(const std::string &path, const Headers &headers,
+    const Params &params) {
+    auto query = detail::params_to_query_str(params);
+    return Post(path, headers, query, "application/x-www-form-urlencoded");
+}
+
+inline Result ClientImpl::Post(const std::string &path,
+    const MultipartFormDataItems &items) {
+    return Post(path, Headers(), items);
+}
+
+inline Result ClientImpl::Post(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items) {
+    const auto &boundary = detail::make_multipart_data_boundary();
+    const auto &content_type =
+        detail::serialize_multipart_formdata_get_content_type(boundary);
+    const auto &body = detail::serialize_multipart_formdata(items, boundary);
+    return Post(path, headers, body, content_type);
+}
+
+inline Result ClientImpl::Post(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items,
+    const std::string &boundary) {
+    if (!detail::is_multipart_boundary_chars_valid(boundary)) {
+        return Result{nullptr, Error::UnsupportedMultipartBoundaryChars};
+    }
+
+    const auto &content_type =
+        detail::serialize_multipart_formdata_get_content_type(boundary);
+    const auto &body = detail::serialize_multipart_formdata(items, boundary);
+    return Post(path, headers, body, content_type);
+}
+
+inline Result
+ClientImpl::Post(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items,
+    const MultipartFormDataProviderItems &provider_items) {
+    const auto &boundary = detail::make_multipart_data_boundary();
+    const auto &content_type =
+        detail::serialize_multipart_formdata_get_content_type(boundary);
+    return send_with_content_provider(
+        "POST", path, headers, nullptr, 0, nullptr,
+        get_multipart_content_provider(boundary, items, provider_items),
+        content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path) {
+    return Put(path, std::string(), std::string());
+}
+
+inline Result ClientImpl::Put(const std::string &path, const char *body,
+    size_t content_length,
+    const std::string &content_type) {
+    return Put(path, Headers(), body, content_length, content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path, const Headers &headers,
+    const char *body, size_t content_length,
+    const std::string &content_type) {
+    return send_with_content_provider("PUT", path, headers, body, content_length,
+        nullptr, nullptr, content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path, const std::string &body,
+    const std::string &content_type) {
+    return Put(path, Headers(), body, content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path, const Headers &headers,
+    const std::string &body,
+    const std::string &content_type) {
+    return send_with_content_provider("PUT", path, headers, body.data(),
+        body.size(), nullptr, nullptr,
+        content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path, size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return Put(path, Headers(), content_length, std::move(content_provider),
+        content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return Put(path, Headers(), std::move(content_provider), content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path, const Headers &headers,
+    size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return send_with_content_provider("PUT", path, headers, nullptr,
+        content_length, std::move(content_provider),
+        nullptr, content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path, const Headers &headers,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return send_with_content_provider("PUT", path, headers, nullptr, 0, nullptr,
+        std::move(content_provider), content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path, const Params &params) {
+    return Put(path, Headers(), params);
+}
+
+inline Result ClientImpl::Put(const std::string &path, const Headers &headers,
+    const Params &params) {
+    auto query = detail::params_to_query_str(params);
+    return Put(path, headers, query, "application/x-www-form-urlencoded");
+}
+
+inline Result ClientImpl::Put(const std::string &path,
+    const MultipartFormDataItems &items) {
+    return Put(path, Headers(), items);
+}
+
+inline Result ClientImpl::Put(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items) {
+    const auto &boundary = detail::make_multipart_data_boundary();
+    const auto &content_type =
+        detail::serialize_multipart_formdata_get_content_type(boundary);
+    const auto &body = detail::serialize_multipart_formdata(items, boundary);
+    return Put(path, headers, body, content_type);
+}
+
+inline Result ClientImpl::Put(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items,
+    const std::string &boundary) {
+    if (!detail::is_multipart_boundary_chars_valid(boundary)) {
+        return Result{nullptr, Error::UnsupportedMultipartBoundaryChars};
+    }
+
+    const auto &content_type =
+        detail::serialize_multipart_formdata_get_content_type(boundary);
+    const auto &body = detail::serialize_multipart_formdata(items, boundary);
+    return Put(path, headers, body, content_type);
+}
+
+inline Result
+ClientImpl::Put(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items,
+    const MultipartFormDataProviderItems &provider_items) {
+    const auto &boundary = detail::make_multipart_data_boundary();
+    const auto &content_type =
+        detail::serialize_multipart_formdata_get_content_type(boundary);
+    return send_with_content_provider(
+        "PUT", path, headers, nullptr, 0, nullptr,
+        get_multipart_content_provider(boundary, items, provider_items),
+        content_type);
+}
+inline Result ClientImpl::Patch(const std::string &path) {
+    return Patch(path, std::string(), std::string());
+}
+
+inline Result ClientImpl::Patch(const std::string &path, const char *body,
+    size_t content_length,
+    const std::string &content_type) {
+    return Patch(path, Headers(), body, content_length, content_type);
+}
+
+inline Result ClientImpl::Patch(const std::string &path, const Headers &headers,
+    const char *body, size_t content_length,
+    const std::string &content_type) {
+    return send_with_content_provider("PATCH", path, headers, body,
+        content_length, nullptr, nullptr,
+        content_type);
+}
+
+inline Result ClientImpl::Patch(const std::string &path,
+    const std::string &body,
+    const std::string &content_type) {
+    return Patch(path, Headers(), body, content_type);
+}
+
+inline Result ClientImpl::Patch(const std::string &path, const Headers &headers,
+    const std::string &body,
+    const std::string &content_type) {
+    return send_with_content_provider("PATCH", path, headers, body.data(),
+        body.size(), nullptr, nullptr,
+        content_type);
+}
+
+inline Result ClientImpl::Patch(const std::string &path, size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return Patch(path, Headers(), content_length, std::move(content_provider),
+        content_type);
+}
+
+inline Result ClientImpl::Patch(const std::string &path,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return Patch(path, Headers(), std::move(content_provider), content_type);
+}
+
+inline Result ClientImpl::Patch(const std::string &path, const Headers &headers,
+    size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return send_with_content_provider("PATCH", path, headers, nullptr,
+        content_length, std::move(content_provider),
+        nullptr, content_type);
+}
+
+inline Result ClientImpl::Patch(const std::string &path, const Headers &headers,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return send_with_content_provider("PATCH", path, headers, nullptr, 0, nullptr,
+        std::move(content_provider), content_type);
+}
+
+inline Result ClientImpl::Delete(const std::string &path) {
+    return Delete(path, Headers(), std::string(), std::string());
+}
+
+inline Result ClientImpl::Delete(const std::string &path,
+    const Headers &headers) {
+    return Delete(path, headers, std::string(), std::string());
+}
+
+inline Result ClientImpl::Delete(const std::string &path, const char *body,
+    size_t content_length,
+    const std::string &content_type) {
+    return Delete(path, Headers(), body, content_length, content_type);
+}
+
+inline Result ClientImpl::Delete(const std::string &path,
+    const Headers &headers, const char *body,
+    size_t content_length,
+    const std::string &content_type) {
+    Request req;
+    req.method = "DELETE";
+    req.headers = headers;
+    req.path = path;
+
+    if (!content_type.empty()) { req.set_header("Content-Type", content_type); }
+    req.body.assign(body, content_length);
+
+    return send_(std::move(req));
+}
+
+inline Result ClientImpl::Delete(const std::string &path,
+    const std::string &body,
+    const std::string &content_type) {
+    return Delete(path, Headers(), body.data(), body.size(), content_type);
+}
+
+inline Result ClientImpl::Delete(const std::string &path,
+    const Headers &headers,
+    const std::string &body,
+    const std::string &content_type) {
+    return Delete(path, headers, body.data(), body.size(), content_type);
+}
+
+inline Result ClientImpl::Options(const std::string &path) {
+    return Options(path, Headers());
+}
+
+inline Result ClientImpl::Options(const std::string &path,
+    const Headers &headers) {
+    Request req;
+    req.method = "OPTIONS";
+    req.headers = headers;
+    req.path = path;
+
+    return send_(std::move(req));
+}
+
+inline void ClientImpl::stop() {
+    std::lock_guard<std::mutex> guard(socket_mutex_);
+
+    // If there is anything ongoing right now, the ONLY thread-safe thing we can
+    // do is to shutdown_socket, so that threads using this socket suddenly
+    // discover they can't read/write any more and error out. Everything else
+    // (closing the socket, shutting ssl down) is unsafe because these actions are
+    // not thread-safe.
+    if (socket_requests_in_flight_ > 0) {
+        shutdown_socket(socket_);
+
+        // Aside from that, we set a flag for the socket to be closed when we're
+        // done.
+        socket_should_be_closed_when_request_is_done_ = true;
+        return;
+    }
+
+    // Otherwise, still holding the mutex, we can shut everything down ourselves
+    shutdown_ssl(socket_, true);
+    shutdown_socket(socket_);
+    close_socket(socket_);
+}
+
+inline std::string ClientImpl::host() const { return host_; }
+
+inline int ClientImpl::port() const { return port_; }
+
+inline size_t ClientImpl::is_socket_open() const {
+    std::lock_guard<std::mutex> guard(socket_mutex_);
+    return socket_.is_open();
+}
+
+inline socket_t ClientImpl::socket() const { return socket_.sock; }
+
+inline void ClientImpl::set_connection_timeout(time_t sec, time_t usec) {
+    connection_timeout_sec_ = sec;
+    connection_timeout_usec_ = usec;
+}
+
+inline void ClientImpl::set_read_timeout(time_t sec, time_t usec) {
+    read_timeout_sec_ = sec;
+    read_timeout_usec_ = usec;
+}
+
+inline void ClientImpl::set_write_timeout(time_t sec, time_t usec) {
+    write_timeout_sec_ = sec;
+    write_timeout_usec_ = usec;
+}
+
+inline void ClientImpl::set_basic_auth(const std::string &username,
+    const std::string &password) {
+    basic_auth_username_ = username;
+    basic_auth_password_ = password;
+}
+
+inline void ClientImpl::set_bearer_token_auth(const std::string &token) {
+    bearer_token_auth_token_ = token;
+}
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+inline void ClientImpl::set_digest_auth(const std::string &username,
+    const std::string &password) {
+    digest_auth_username_ = username;
+    digest_auth_password_ = password;
+}
+#endif
+
+inline void ClientImpl::set_keep_alive(bool on) { keep_alive_ = on; }
+
+inline void ClientImpl::set_follow_location(bool on) { follow_location_ = on; }
+
+inline void ClientImpl::set_url_encode(bool on) { url_encode_ = on; }
+
+inline void
+ClientImpl::set_hostname_addr_map(std::map<std::string, std::string> addr_map) {
+    addr_map_ = std::move(addr_map);
+}
+
+inline void ClientImpl::set_default_headers(Headers headers) {
+    default_headers_ = std::move(headers);
+}
+
+inline void ClientImpl::set_header_writer(
+    std::function<ssize_t(Stream &, Headers &)> const &writer) {
+    header_writer_ = writer;
+}
+
+inline void ClientImpl::set_address_family(int family) {
+    address_family_ = family;
+}
+
+inline void ClientImpl::set_tcp_nodelay(bool on) { tcp_nodelay_ = on; }
+
+inline void ClientImpl::set_socket_options(SocketOptions socket_options) {
+    socket_options_ = std::move(socket_options);
+}
+
+inline void ClientImpl::set_compress(bool on) { compress_ = on; }
+
+inline void ClientImpl::set_decompress(bool on) { decompress_ = on; }
+
+inline void ClientImpl::set_interface(const std::string &intf) {
+    interface_ = intf;
+}
+
+inline void ClientImpl::set_proxy(const std::string &host, int port) {
+    proxy_host_ = host;
+    proxy_port_ = port;
+}
+
+inline void ClientImpl::set_proxy_basic_auth(const std::string &username,
+    const std::string &password) {
+    proxy_basic_auth_username_ = username;
+    proxy_basic_auth_password_ = password;
+}
+
+inline void ClientImpl::set_proxy_bearer_token_auth(const std::string &token) {
+    proxy_bearer_token_auth_token_ = token;
+}
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+inline void ClientImpl::set_proxy_digest_auth(const std::string &username,
+    const std::string &password) {
+    proxy_digest_auth_username_ = username;
+    proxy_digest_auth_password_ = password;
+}
+
+inline void ClientImpl::set_ca_cert_path(const std::string &ca_cert_file_path,
+    const std::string &ca_cert_dir_path) {
+    ca_cert_file_path_ = ca_cert_file_path;
+    ca_cert_dir_path_ = ca_cert_dir_path;
+}
+
+inline void ClientImpl::set_ca_cert_store(X509_STORE *ca_cert_store) {
+    if (ca_cert_store && ca_cert_store != ca_cert_store_) {
+        ca_cert_store_ = ca_cert_store;
+    }
+}
+
+inline X509_STORE *ClientImpl::create_ca_cert_store(const char *ca_cert,
+    std::size_t size) const {
+    auto mem = BIO_new_mem_buf(ca_cert, static_cast<int>(size));
+    if (!mem) { return nullptr; }
+
+    auto inf = PEM_X509_INFO_read_bio(mem, nullptr, nullptr, nullptr);
+    if (!inf) {
+        BIO_free_all(mem);
+        return nullptr;
+    }
+
+    auto cts = X509_STORE_new();
+    if (cts) {
+        for (auto i = 0; i < static_cast<int>(sk_X509_INFO_num(inf)); i++) {
+            auto itmp = sk_X509_INFO_value(inf, i);
+            if (!itmp) { continue; }
+
+            if (itmp->x509) { X509_STORE_add_cert(cts, itmp->x509); }
+            if (itmp->crl) { X509_STORE_add_crl(cts, itmp->crl); }
+        }
+    }
+
+    sk_X509_INFO_pop_free(inf, X509_INFO_free);
+    BIO_free_all(mem);
+    return cts;
+}
+
+inline void ClientImpl::enable_server_certificate_verification(bool enabled) {
+    server_certificate_verification_ = enabled;
+}
+#endif
+
+inline void ClientImpl::set_logger(Logger logger) {
+    logger_ = std::move(logger);
+}
+
+/*
+ * SSL Implementation
+ */
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+namespace detail {
+
+template <typename U, typename V>
+inline SSL *ssl_new(socket_t sock, SSL_CTX *ctx, std::mutex &ctx_mutex,
+    U SSL_connect_or_accept, V setup) {
+    SSL *ssl = nullptr;
+    {
+        std::lock_guard<std::mutex> guard(ctx_mutex);
+        ssl = SSL_new(ctx);
+    }
+
+    if (ssl) {
+        set_nonblocking(sock, true);
+        auto bio = BIO_new_socket(static_cast<int>(sock), BIO_NOCLOSE);
+        BIO_set_nbio(bio, 1);
+        SSL_set_bio(ssl, bio, bio);
+
+        if (!setup(ssl) || SSL_connect_or_accept(ssl) != 1) {
+            SSL_shutdown(ssl);
+            {
+                std::lock_guard<std::mutex> guard(ctx_mutex);
+                SSL_free(ssl);
+            }
+            set_nonblocking(sock, false);
+            return nullptr;
+        }
+        BIO_set_nbio(bio, 0);
+        set_nonblocking(sock, false);
+    }
+
+    return ssl;
+}
+
+inline void ssl_delete(std::mutex &ctx_mutex, SSL *ssl,
+    bool shutdown_gracefully) {
+    // sometimes we may want to skip this to try to avoid SIGPIPE if we know
+    // the remote has closed the network connection
+    // Note that it is not always possible to avoid SIGPIPE, this is merely a
+    // best-efforts.
+    if (shutdown_gracefully) { SSL_shutdown(ssl); }
+
+    std::lock_guard<std::mutex> guard(ctx_mutex);
+    SSL_free(ssl);
+}
+
+template <typename U>
+bool ssl_connect_or_accept_nonblocking(socket_t sock, SSL *ssl,
+    U ssl_connect_or_accept,
+    time_t timeout_sec,
+    time_t timeout_usec) {
+    auto res = 0;
+    while ((res = ssl_connect_or_accept(ssl)) != 1) {
+        auto err = SSL_get_error(ssl, res);
+        switch (err) {
+        case SSL_ERROR_WANT_READ:
+            if (select_read(sock, timeout_sec, timeout_usec) > 0) { continue; }
+            break;
+        case SSL_ERROR_WANT_WRITE:
+            if (select_write(sock, timeout_sec, timeout_usec) > 0) { continue; }
+            break;
+        default: break;
+        }
+        return false;
+    }
+    return true;
+}
+
+template <typename T>
+inline bool process_server_socket_ssl(
+    const std::atomic<socket_t> &svr_sock, SSL *ssl, socket_t sock,
+    size_t keep_alive_max_count, time_t keep_alive_timeout_sec,
+    time_t read_timeout_sec, time_t read_timeout_usec, time_t write_timeout_sec,
+    time_t write_timeout_usec, T callback) {
+    return process_server_socket_core(
+        svr_sock, sock, keep_alive_max_count, keep_alive_timeout_sec,
+        [&](bool close_connection, bool &connection_closed) {
+            SSLSocketStream strm(sock, ssl, read_timeout_sec, read_timeout_usec,
+                write_timeout_sec, write_timeout_usec);
+            return callback(strm, close_connection, connection_closed);
+        });
+}
+
+template <typename T>
+inline bool
+process_client_socket_ssl(SSL *ssl, socket_t sock, time_t read_timeout_sec,
+    time_t read_timeout_usec, time_t write_timeout_sec,
+    time_t write_timeout_usec, T callback) {
+    SSLSocketStream strm(sock, ssl, read_timeout_sec, read_timeout_usec,
+        write_timeout_sec, write_timeout_usec);
+    return callback(strm);
+}
+
+class SSLInit {
+public:
+    SSLInit() {
+        OPENSSL_init_ssl(
+            OPENSSL_INIT_LOAD_SSL_STRINGS | OPENSSL_INIT_LOAD_CRYPTO_STRINGS, NULL);
+    }
+};
+
+// SSL socket stream implementation
+inline SSLSocketStream::SSLSocketStream(socket_t sock, SSL *ssl,
+    time_t read_timeout_sec,
+    time_t read_timeout_usec,
+    time_t write_timeout_sec,
+    time_t write_timeout_usec)
+    : sock_(sock), ssl_(ssl), read_timeout_sec_(read_timeout_sec),
+      read_timeout_usec_(read_timeout_usec),
+      write_timeout_sec_(write_timeout_sec),
+      write_timeout_usec_(write_timeout_usec) {
+    SSL_clear_mode(ssl, SSL_MODE_AUTO_RETRY);
+}
+
+inline SSLSocketStream::~SSLSocketStream() = default;
+
+inline bool SSLSocketStream::is_readable() const {
+    return detail::select_read(sock_, read_timeout_sec_, read_timeout_usec_) > 0;
+}
+
+inline bool SSLSocketStream::is_writable() const {
+    return select_write(sock_, write_timeout_sec_, write_timeout_usec_) > 0 &&
+           is_socket_alive(sock_);
+}
+
+inline ssize_t SSLSocketStream::read(char *ptr, size_t size) {
+    if (SSL_pending(ssl_) > 0) {
+        return SSL_read(ssl_, ptr, static_cast<int>(size));
+    } else if (is_readable()) {
+        auto ret = SSL_read(ssl_, ptr, static_cast<int>(size));
+        if (ret < 0) {
+            auto err = SSL_get_error(ssl_, ret);
+            auto n = 1000;
+#ifdef _WIN32
+            while (--n >= 0 && (err == SSL_ERROR_WANT_READ ||
+                                   (err == SSL_ERROR_SYSCALL &&
+                                       WSAGetLastError() == WSAETIMEDOUT))) {
+#else
+            while (--n >= 0 && err == SSL_ERROR_WANT_READ) {
+#endif
+                if (SSL_pending(ssl_) > 0) {
+                    return SSL_read(ssl_, ptr, static_cast<int>(size));
+                } else if (is_readable()) {
+                    std::this_thread::sleep_for(std::chrono::milliseconds(1));
+                    ret = SSL_read(ssl_, ptr, static_cast<int>(size));
+                    if (ret >= 0) { return ret; }
+                    err = SSL_get_error(ssl_, ret);
+                } else {
+                    return -1;
+                }
+            }
+        }
+        return ret;
+    }
+    return -1;
+}
+
+inline ssize_t SSLSocketStream::write(const char *ptr, size_t size) {
+    if (is_writable()) {
+        auto handle_size = static_cast<int>(
+            std::min<size_t>(size, (std::numeric_limits<int>::max)()));
+
+        auto ret = SSL_write(ssl_, ptr, static_cast<int>(handle_size));
+        if (ret < 0) {
+            auto err = SSL_get_error(ssl_, ret);
+            auto n = 1000;
+#ifdef _WIN32
+            while (--n >= 0 && (err == SSL_ERROR_WANT_WRITE ||
+                                   (err == SSL_ERROR_SYSCALL &&
+                                       WSAGetLastError() == WSAETIMEDOUT))) {
+#else
+            while (--n >= 0 && err == SSL_ERROR_WANT_WRITE) {
+#endif
+                if (is_writable()) {
+                    std::this_thread::sleep_for(std::chrono::milliseconds(1));
+                    ret = SSL_write(ssl_, ptr, static_cast<int>(handle_size));
+                    if (ret >= 0) { return ret; }
+                    err = SSL_get_error(ssl_, ret);
+                } else {
+                    return -1;
+                }
+            }
+        }
+        return ret;
+    }
+    return -1;
+}
+
+inline void SSLSocketStream::get_remote_ip_and_port(std::string &ip,
+    int &port) const {
+    detail::get_remote_ip_and_port(sock_, ip, port);
+}
+
+inline void SSLSocketStream::get_local_ip_and_port(std::string &ip,
+    int &port) const {
+    detail::get_local_ip_and_port(sock_, ip, port);
+}
+
+inline socket_t SSLSocketStream::socket() const { return sock_; }
+
+static SSLInit sslinit_;
+
+} // namespace detail
+
+// SSL HTTP server implementation
+inline SSLServer::SSLServer(const char *cert_path, const char *private_key_path,
+    const char *client_ca_cert_file_path,
+    const char *client_ca_cert_dir_path,
+    const char *private_key_password) {
+    ctx_ = SSL_CTX_new(TLS_server_method());
+
+    if (ctx_) {
+        SSL_CTX_set_options(ctx_,
+            SSL_OP_NO_COMPRESSION |
+                SSL_OP_NO_SESSION_RESUMPTION_ON_RENEGOTIATION);
+
+        SSL_CTX_set_min_proto_version(ctx_, TLS1_1_VERSION);
+
+        // add default password callback before opening encrypted private key
+        if (private_key_password != nullptr && (private_key_password[0] != '\0')) {
+            SSL_CTX_set_default_passwd_cb_userdata(
+                ctx_,
+                reinterpret_cast<void *>(const_cast<char *>(private_key_password)));
+        }
+
+        if (SSL_CTX_use_certificate_chain_file(ctx_, cert_path) != 1 ||
+            SSL_CTX_use_PrivateKey_file(ctx_, private_key_path, SSL_FILETYPE_PEM) !=
+                1) {
+            SSL_CTX_free(ctx_);
+            ctx_ = nullptr;
+        } else if (client_ca_cert_file_path || client_ca_cert_dir_path) {
+            SSL_CTX_load_verify_locations(ctx_, client_ca_cert_file_path,
+                client_ca_cert_dir_path);
+
+            SSL_CTX_set_verify(
+                ctx_, SSL_VERIFY_PEER | SSL_VERIFY_FAIL_IF_NO_PEER_CERT, nullptr);
+        }
+    }
+}
+
+inline SSLServer::SSLServer(X509 *cert, EVP_PKEY *private_key,
+    X509_STORE *client_ca_cert_store) {
+    ctx_ = SSL_CTX_new(TLS_server_method());
+
+    if (ctx_) {
+        SSL_CTX_set_options(ctx_,
+            SSL_OP_NO_COMPRESSION |
+                SSL_OP_NO_SESSION_RESUMPTION_ON_RENEGOTIATION);
+
+        SSL_CTX_set_min_proto_version(ctx_, TLS1_1_VERSION);
+
+        if (SSL_CTX_use_certificate(ctx_, cert) != 1 ||
+            SSL_CTX_use_PrivateKey(ctx_, private_key) != 1) {
+            SSL_CTX_free(ctx_);
+            ctx_ = nullptr;
+        } else if (client_ca_cert_store) {
+            SSL_CTX_set_cert_store(ctx_, client_ca_cert_store);
+
+            SSL_CTX_set_verify(
+                ctx_, SSL_VERIFY_PEER | SSL_VERIFY_FAIL_IF_NO_PEER_CERT, nullptr);
+        }
+    }
+}
+
+inline SSLServer::SSLServer(
+    const std::function<bool(SSL_CTX &ssl_ctx)> &setup_ssl_ctx_callback) {
+    ctx_ = SSL_CTX_new(TLS_method());
+    if (ctx_) {
+        if (!setup_ssl_ctx_callback(*ctx_)) {
+            SSL_CTX_free(ctx_);
+            ctx_ = nullptr;
+        }
+    }
+}
+
+inline SSLServer::~SSLServer() {
+    if (ctx_) { SSL_CTX_free(ctx_); }
+}
+
+inline bool SSLServer::is_valid() const { return ctx_; }
+
+inline SSL_CTX *SSLServer::ssl_context() const { return ctx_; }
+
+inline bool SSLServer::process_and_close_socket(socket_t sock) {
+    auto ssl = detail::ssl_new(
+        sock, ctx_, ctx_mutex_,
+        [&](SSL *ssl2) {
+            return detail::ssl_connect_or_accept_nonblocking(
+                sock, ssl2, SSL_accept, read_timeout_sec_, read_timeout_usec_);
+        },
+        [](SSL * /*ssl2*/) { return true; });
+
+    auto ret = false;
+    if (ssl) {
+        ret = detail::process_server_socket_ssl(
+            svr_sock_, ssl, sock, keep_alive_max_count_, keep_alive_timeout_sec_,
+            read_timeout_sec_, read_timeout_usec_, write_timeout_sec_,
+            write_timeout_usec_,
+            [this, ssl](Stream &strm, bool close_connection,
+                bool &connection_closed) {
+                return process_request(strm, close_connection, connection_closed,
+                    [&](Request &req) { req.ssl = ssl; });
+            });
+
+        // Shutdown gracefully if the result seemed successful, non-gracefully if
+        // the connection appeared to be closed.
+        const bool shutdown_gracefully = ret;
+        detail::ssl_delete(ctx_mutex_, ssl, shutdown_gracefully);
+    }
+
+    detail::shutdown_socket(sock);
+    detail::close_socket(sock);
+    return ret;
+}
+
+// SSL HTTP client implementation
+inline SSLClient::SSLClient(const std::string &host)
+    : SSLClient(host, 443, std::string(), std::string()) {}
+
+inline SSLClient::SSLClient(const std::string &host, int port)
+    : SSLClient(host, port, std::string(), std::string()) {}
+
+inline SSLClient::SSLClient(const std::string &host, int port,
+    const std::string &client_cert_path,
+    const std::string &client_key_path)
+    : ClientImpl(host, port, client_cert_path, client_key_path) {
+    ctx_ = SSL_CTX_new(TLS_client_method());
+
+    detail::split(&host_[0], &host_[host_.size()], '.',
+        [&](const char *b, const char *e) {
+            host_components_.emplace_back(b, e);
+        });
+
+    if (!client_cert_path.empty() && !client_key_path.empty()) {
+        if (SSL_CTX_use_certificate_file(ctx_, client_cert_path.c_str(),
+                SSL_FILETYPE_PEM) != 1 ||
+            SSL_CTX_use_PrivateKey_file(ctx_, client_key_path.c_str(),
+                SSL_FILETYPE_PEM) != 1) {
+            SSL_CTX_free(ctx_);
+            ctx_ = nullptr;
+        }
+    }
+}
+
+inline SSLClient::SSLClient(const std::string &host, int port,
+    X509 *client_cert, EVP_PKEY *client_key)
+    : ClientImpl(host, port) {
+    ctx_ = SSL_CTX_new(TLS_client_method());
+
+    detail::split(&host_[0], &host_[host_.size()], '.',
+        [&](const char *b, const char *e) {
+            host_components_.emplace_back(b, e);
+        });
+
+    if (client_cert != nullptr && client_key != nullptr) {
+        if (SSL_CTX_use_certificate(ctx_, client_cert) != 1 ||
+            SSL_CTX_use_PrivateKey(ctx_, client_key) != 1) {
+            SSL_CTX_free(ctx_);
+            ctx_ = nullptr;
+        }
+    }
+}
+
+inline SSLClient::~SSLClient() {
+    if (ctx_) { SSL_CTX_free(ctx_); }
+    // Make sure to shut down SSL since shutdown_ssl will resolve to the
+    // base function rather than the derived function once we get to the
+    // base class destructor, and won't free the SSL (causing a leak).
+    shutdown_ssl_impl(socket_, true);
+}
+
+inline bool SSLClient::is_valid() const { return ctx_; }
+
+inline void SSLClient::set_ca_cert_store(X509_STORE *ca_cert_store) {
+    if (ca_cert_store) {
+        if (ctx_) {
+            if (SSL_CTX_get_cert_store(ctx_) != ca_cert_store) {
+                // Free memory allocated for old cert and use new store `ca_cert_store`
+                SSL_CTX_set_cert_store(ctx_, ca_cert_store);
+            }
+        } else {
+            X509_STORE_free(ca_cert_store);
+        }
+    }
+}
+
+inline void SSLClient::load_ca_cert_store(const char *ca_cert,
+    std::size_t size) {
+    set_ca_cert_store(ClientImpl::create_ca_cert_store(ca_cert, size));
+}
+
+inline long SSLClient::get_openssl_verify_result() const {
+    return verify_result_;
+}
+
+inline SSL_CTX *SSLClient::ssl_context() const { return ctx_; }
+
+inline bool SSLClient::create_and_connect_socket(Socket &socket, Error &error) {
+    return is_valid() && ClientImpl::create_and_connect_socket(socket, error);
+}
+
+// Assumes that socket_mutex_ is locked and that there are no requests in flight
+inline bool SSLClient::connect_with_proxy(Socket &socket, Response &res,
+    bool &success, Error &error) {
+    success = true;
+    Response proxy_res;
+    if (!detail::process_client_socket(
+            socket.sock, read_timeout_sec_, read_timeout_usec_,
+            write_timeout_sec_, write_timeout_usec_, [&](Stream &strm) {
+                Request req2;
+                req2.method = "CONNECT";
+                req2.path = host_and_port_;
+                return process_request(strm, req2, proxy_res, false, error);
+            })) {
+        // Thread-safe to close everything because we are assuming there are no
+        // requests in flight
+        shutdown_ssl(socket, true);
+        shutdown_socket(socket);
+        close_socket(socket);
+        success = false;
+        return false;
+    }
+
+    if (proxy_res.status == StatusCode::ProxyAuthenticationRequired_407) {
+        if (!proxy_digest_auth_username_.empty() &&
+            !proxy_digest_auth_password_.empty()) {
+            std::map<std::string, std::string> auth;
+            if (detail::parse_www_authenticate(proxy_res, auth, true)) {
+                proxy_res = Response();
+                if (!detail::process_client_socket(
+                        socket.sock, read_timeout_sec_, read_timeout_usec_,
+                        write_timeout_sec_, write_timeout_usec_, [&](Stream &strm) {
+                            Request req3;
+                            req3.method = "CONNECT";
+                            req3.path = host_and_port_;
+                            req3.headers.insert(detail::make_digest_authentication_header(
+                                req3, auth, 1, detail::random_string(10),
+                                proxy_digest_auth_username_, proxy_digest_auth_password_,
+                                true));
+                            return process_request(strm, req3, proxy_res, false, error);
+                        })) {
+                    // Thread-safe to close everything because we are assuming there are
+                    // no requests in flight
+                    shutdown_ssl(socket, true);
+                    shutdown_socket(socket);
+                    close_socket(socket);
+                    success = false;
+                    return false;
+                }
+            }
+        }
+    }
+
+    // If status code is not 200, proxy request is failed.
+    // Set error to ProxyConnection and return proxy response
+    // as the response of the request
+    if (proxy_res.status != StatusCode::OK_200) {
+        error = Error::ProxyConnection;
+        res = std::move(proxy_res);
+        // Thread-safe to close everything because we are assuming there are
+        // no requests in flight
+        shutdown_ssl(socket, true);
+        shutdown_socket(socket);
+        close_socket(socket);
+        return false;
+    }
+
+    return true;
+}
+
+inline bool SSLClient::load_certs() {
+    auto ret = true;
+
+    std::call_once(initialize_cert_, [&]() {
+        std::lock_guard<std::mutex> guard(ctx_mutex_);
+        if (!ca_cert_file_path_.empty()) {
+            if (!SSL_CTX_load_verify_locations(ctx_, ca_cert_file_path_.c_str(),
+                    nullptr)) {
+                ret = false;
+            }
+        } else if (!ca_cert_dir_path_.empty()) {
+            if (!SSL_CTX_load_verify_locations(ctx_, nullptr,
+                    ca_cert_dir_path_.c_str())) {
+                ret = false;
+            }
+        } else {
+            auto loaded = false;
+#ifdef _WIN32
+            loaded =
+                detail::load_system_certs_on_windows(SSL_CTX_get_cert_store(ctx_));
+#elif defined(CPPHTTPLIB_USE_CERTS_FROM_MACOSX_KEYCHAIN) && defined(__APPLE__)
+#if TARGET_OS_OSX
+                loaded = detail::load_system_certs_on_macos(SSL_CTX_get_cert_store(ctx_));
+#endif // TARGET_OS_OSX
+#endif // _WIN32
+            if (!loaded) { SSL_CTX_set_default_verify_paths(ctx_); }
+        }
+    });
+
+    return ret;
+}
+
+inline bool SSLClient::initialize_ssl(Socket &socket, Error &error) {
+    auto ssl = detail::ssl_new(
+        socket.sock, ctx_, ctx_mutex_,
+        [&](SSL *ssl2) {
+            if (server_certificate_verification_) {
+                if (!load_certs()) {
+                    error = Error::SSLLoadingCerts;
+                    return false;
+                }
+                SSL_set_verify(ssl2, SSL_VERIFY_NONE, nullptr);
+            }
+
+            if (!detail::ssl_connect_or_accept_nonblocking(
+                    socket.sock, ssl2, SSL_connect, connection_timeout_sec_,
+                    connection_timeout_usec_)) {
+                error = Error::SSLConnection;
+                return false;
+            }
+
+            if (server_certificate_verification_) {
+                verify_result_ = SSL_get_verify_result(ssl2);
+
+                if (verify_result_ != X509_V_OK) {
+                    error = Error::SSLServerVerification;
+                    return false;
+                }
+
+                auto server_cert = SSL_get1_peer_certificate(ssl2);
+
+                if (server_cert == nullptr) {
+                    error = Error::SSLServerVerification;
+                    return false;
+                }
+
+                if (!verify_host(server_cert)) {
+                    X509_free(server_cert);
+                    error = Error::SSLServerVerification;
+                    return false;
+                }
+                X509_free(server_cert);
+            }
+
+            return true;
+        },
+        [&](SSL *ssl2) {
+            // NOTE: With -Wold-style-cast, this can produce a warning, since
+            //  SSL_set_tlsext_host_name is a macro (in OpenSSL), which contains
+            //  an old style cast. Short of doing compiler specific pragma's
+            //  here, we can't get rid of this warning. :'(
+            SSL_set_tlsext_host_name(ssl2, host_.c_str());
+            return true;
+        });
+
+    if (ssl) {
+        socket.ssl = ssl;
+        return true;
+    }
+
+    shutdown_socket(socket);
+    close_socket(socket);
+    return false;
+}
+
+inline void SSLClient::shutdown_ssl(Socket &socket, bool shutdown_gracefully) {
+    shutdown_ssl_impl(socket, shutdown_gracefully);
+}
+
+inline void SSLClient::shutdown_ssl_impl(Socket &socket,
+    bool shutdown_gracefully) {
+    if (socket.sock == INVALID_SOCKET) {
+        assert(socket.ssl == nullptr);
+        return;
+    }
+    if (socket.ssl) {
+        detail::ssl_delete(ctx_mutex_, socket.ssl, shutdown_gracefully);
+        socket.ssl = nullptr;
+    }
+    assert(socket.ssl == nullptr);
+}
+
+inline bool
+SSLClient::process_socket(const Socket &socket,
+    std::function<bool(Stream &strm)> callback) {
+    assert(socket.ssl);
+    return detail::process_client_socket_ssl(
+        socket.ssl, socket.sock, read_timeout_sec_, read_timeout_usec_,
+        write_timeout_sec_, write_timeout_usec_, std::move(callback));
+}
+
+inline bool SSLClient::is_ssl() const { return true; }
+
+inline bool SSLClient::verify_host(X509 *server_cert) const {
+    /* Quote from RFC2818 section 3.1 "Server Identity"
+
+       If a subjectAltName extension of type dNSName is present, that MUST
+       be used as the identity. Otherwise, the (most specific) Common Name
+       field in the Subject field of the certificate MUST be used. Although
+       the use of the Common Name is existing practice, it is deprecated and
+       Certification Authorities are encouraged to use the dNSName instead.
+
+       Matching is performed using the matching rules specified by
+       [RFC2459].  If more than one identity of a given type is present in
+       the certificate (e.g., more than one dNSName name, a match in any one
+       of the set is considered acceptable.) Names may contain the wildcard
+       character * which is considered to match any single domain name
+       component or component fragment. E.g., *.a.com matches foo.a.com but
+       not bar.foo.a.com. f*.com matches foo.com but not bar.com.
+
+       In some cases, the URI is specified as an IP address rather than a
+       hostname. In this case, the iPAddress subjectAltName must be present
+       in the certificate and must exactly match the IP in the URI.
+
+    */
+    return verify_host_with_subject_alt_name(server_cert) ||
+           verify_host_with_common_name(server_cert);
+}
+
+inline bool
+SSLClient::verify_host_with_subject_alt_name(X509 *server_cert) const {
+    auto ret = false;
+
+    auto type = GEN_DNS;
+
+    struct in6_addr addr6 {};
+    struct in_addr addr {};
+    size_t addr_len = 0;
+
+#ifndef __MINGW32__
+    if (inet_pton(AF_INET6, host_.c_str(), &addr6)) {
+        type = GEN_IPADD;
+        addr_len = sizeof(struct in6_addr);
+    } else if (inet_pton(AF_INET, host_.c_str(), &addr)) {
+        type = GEN_IPADD;
+        addr_len = sizeof(struct in_addr);
+    }
+#endif
+
+    auto alt_names = static_cast<const struct stack_st_GENERAL_NAME *>(
+        X509_get_ext_d2i(server_cert, NID_subject_alt_name, nullptr, nullptr));
+
+    if (alt_names) {
+        auto dsn_matched = false;
+        auto ip_matched = false;
+
+        auto count = sk_GENERAL_NAME_num(alt_names);
+
+        for (decltype(count) i = 0; i < count && !dsn_matched; i++) {
+            auto val = sk_GENERAL_NAME_value(alt_names, i);
+            if (val->type == type) {
+                auto name =
+                    reinterpret_cast<const char *>(ASN1_STRING_get0_data(val->d.ia5));
+                auto name_len = static_cast<size_t>(ASN1_STRING_length(val->d.ia5));
+
+                switch (type) {
+                case GEN_DNS: dsn_matched = check_host_name(name, name_len); break;
+
+                case GEN_IPADD:
+                    if (!memcmp(&addr6, name, addr_len) ||
+                        !memcmp(&addr, name, addr_len)) {
+                        ip_matched = true;
+                    }
+                    break;
+                }
+            }
+        }
+
+        if (dsn_matched || ip_matched) { ret = true; }
+    }
+
+    GENERAL_NAMES_free(const_cast<STACK_OF(GENERAL_NAME) *>(
+        reinterpret_cast<const STACK_OF(GENERAL_NAME) *>(alt_names)));
+    return ret;
+}
+
+inline bool SSLClient::verify_host_with_common_name(X509 *server_cert) const {
+    const auto subject_name = X509_get_subject_name(server_cert);
+
+    if (subject_name != nullptr) {
+        char name[BUFSIZ];
+        auto name_len = X509_NAME_get_text_by_NID(subject_name, NID_commonName,
+            name, sizeof(name));
+
+        if (name_len != -1) {
+            return check_host_name(name, static_cast<size_t>(name_len));
+        }
+    }
+
+    return false;
+}
+
+inline bool SSLClient::check_host_name(const char *pattern,
+    size_t pattern_len) const {
+    if (host_.size() == pattern_len && host_ == pattern) { return true; }
+
+    // Wildcard match
+    // https://bugs.launchpad.net/ubuntu/+source/firefox-3.0/+bug/376484
+    std::vector<std::string> pattern_components;
+    detail::split(&pattern[0], &pattern[pattern_len], '.',
+        [&](const char *b, const char *e) {
+            pattern_components.emplace_back(b, e);
+        });
+
+    if (host_components_.size() != pattern_components.size()) { return false; }
+
+    auto itr = pattern_components.begin();
+    for (const auto &h : host_components_) {
+        auto &p = *itr;
+        if (p != h && p != "*") {
+            auto partial_match = (p.size() > 0 && p[p.size() - 1] == '*' &&
+                                  !p.compare(0, p.size() - 1, h));
+            if (!partial_match) { return false; }
+        }
+        ++itr;
+    }
+
+    return true;
+}
+#endif
+
+// Universal client implementation
+inline Client::Client(const std::string &scheme_host_port)
+    : Client(scheme_host_port, std::string(), std::string()) {}
+
+inline Client::Client(const std::string &scheme_host_port,
+    const std::string &client_cert_path,
+    const std::string &client_key_path) {
+    const static std::regex re(
+        R"((?:([a-z]+):\/\/)?(?:\[([\d:]+)\]|([^:/?#]+))(?::(\d+))?)");
+
+    std::smatch m;
+    if (std::regex_match(scheme_host_port, m, re)) {
+        auto scheme = m[1].str();
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+        if (!scheme.empty() && (scheme != "http" && scheme != "https")) {
+#else
+        if (!scheme.empty() && scheme != "http") {
+#endif
+#ifndef CPPHTTPLIB_NO_EXCEPTIONS
+            std::string msg = "'" + scheme + "' scheme is not supported.";
+            throw std::invalid_argument(msg);
+#endif
+            return;
+        }
+
+        auto is_ssl = scheme == "https";
+
+        auto host = m[2].str();
+        if (host.empty()) { host = m[3].str(); }
+
+        auto port_str = m[4].str();
+        auto port = !port_str.empty() ? std::stoi(port_str) : (is_ssl ? 443 : 80);
+
+        if (is_ssl) {
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+            cli_ = detail::make_unique<SSLClient>(host, port, client_cert_path,
+                client_key_path);
+            is_ssl_ = is_ssl;
+#endif
+        } else {
+            cli_ = detail::make_unique<ClientImpl>(host, port, client_cert_path,
+                client_key_path);
+        }
+    } else {
+        cli_ = detail::make_unique<ClientImpl>(scheme_host_port, 80,
+            client_cert_path, client_key_path);
+    }
+}
+
+inline Client::Client(const std::string &host, int port)
+    : cli_(detail::make_unique<ClientImpl>(host, port)) {}
+
+inline Client::Client(const std::string &host, int port,
+    const std::string &client_cert_path,
+    const std::string &client_key_path)
+    : cli_(detail::make_unique<ClientImpl>(host, port, client_cert_path,
+          client_key_path)) {}
+
+inline Client::~Client() = default;
+
+inline bool Client::is_valid() const {
+    return cli_ != nullptr && cli_->is_valid();
+}
+
+inline Result Client::Get(const std::string &path) { return cli_->Get(path); }
+inline Result Client::Get(const std::string &path, const Headers &headers) {
+    return cli_->Get(path, headers);
+}
+inline Result Client::Get(const std::string &path, Progress progress) {
+    return cli_->Get(path, std::move(progress));
+}
+inline Result Client::Get(const std::string &path, const Headers &headers,
+    Progress progress) {
+    return cli_->Get(path, headers, std::move(progress));
+}
+inline Result Client::Get(const std::string &path,
+    ContentReceiver content_receiver) {
+    return cli_->Get(path, std::move(content_receiver));
+}
+inline Result Client::Get(const std::string &path, const Headers &headers,
+    ContentReceiver content_receiver) {
+    return cli_->Get(path, headers, std::move(content_receiver));
+}
+inline Result Client::Get(const std::string &path,
+    ContentReceiver content_receiver, Progress progress) {
+    return cli_->Get(path, std::move(content_receiver), std::move(progress));
+}
+inline Result Client::Get(const std::string &path, const Headers &headers,
+    ContentReceiver content_receiver, Progress progress) {
+    return cli_->Get(path, headers, std::move(content_receiver),
+        std::move(progress));
+}
+inline Result Client::Get(const std::string &path,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver) {
+    return cli_->Get(path, std::move(response_handler),
+        std::move(content_receiver));
+}
+inline Result Client::Get(const std::string &path, const Headers &headers,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver) {
+    return cli_->Get(path, headers, std::move(response_handler),
+        std::move(content_receiver));
+}
+inline Result Client::Get(const std::string &path,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver, Progress progress) {
+    return cli_->Get(path, std::move(response_handler),
+        std::move(content_receiver), std::move(progress));
+}
+inline Result Client::Get(const std::string &path, const Headers &headers,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver, Progress progress) {
+    return cli_->Get(path, headers, std::move(response_handler),
+        std::move(content_receiver), std::move(progress));
+}
+inline Result Client::Get(const std::string &path, const Params &params,
+    const Headers &headers, Progress progress) {
+    return cli_->Get(path, params, headers, progress);
+}
+inline Result Client::Get(const std::string &path, const Params &params,
+    const Headers &headers,
+    ContentReceiver content_receiver, Progress progress) {
+    return cli_->Get(path, params, headers, content_receiver, progress);
+}
+inline Result Client::Get(const std::string &path, const Params &params,
+    const Headers &headers,
+    ResponseHandler response_handler,
+    ContentReceiver content_receiver, Progress progress) {
+    return cli_->Get(path, params, headers, response_handler, content_receiver,
+        progress);
+}
+
+inline Result Client::Head(const std::string &path) { return cli_->Head(path); }
+inline Result Client::Head(const std::string &path, const Headers &headers) {
+    return cli_->Head(path, headers);
+}
+
+inline Result Client::Post(const std::string &path) { return cli_->Post(path); }
+inline Result Client::Post(const std::string &path, const Headers &headers) {
+    return cli_->Post(path, headers);
+}
+inline Result Client::Post(const std::string &path, const char *body,
+    size_t content_length,
+    const std::string &content_type) {
+    return cli_->Post(path, body, content_length, content_type);
+}
+inline Result Client::Post(const std::string &path, const Headers &headers,
+    const char *body, size_t content_length,
+    const std::string &content_type) {
+    return cli_->Post(path, headers, body, content_length, content_type);
+}
+inline Result Client::Post(const std::string &path, const std::string &body,
+    const std::string &content_type) {
+    return cli_->Post(path, body, content_type);
+}
+inline Result Client::Post(const std::string &path, const Headers &headers,
+    const std::string &body,
+    const std::string &content_type) {
+    return cli_->Post(path, headers, body, content_type);
+}
+inline Result Client::Post(const std::string &path, size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return cli_->Post(path, content_length, std::move(content_provider),
+        content_type);
+}
+inline Result Client::Post(const std::string &path,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return cli_->Post(path, std::move(content_provider), content_type);
+}
+inline Result Client::Post(const std::string &path, const Headers &headers,
+    size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return cli_->Post(path, headers, content_length, std::move(content_provider),
+        content_type);
+}
+inline Result Client::Post(const std::string &path, const Headers &headers,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return cli_->Post(path, headers, std::move(content_provider), content_type);
+}
+inline Result Client::Post(const std::string &path, const Params &params) {
+    return cli_->Post(path, params);
+}
+inline Result Client::Post(const std::string &path, const Headers &headers,
+    const Params &params) {
+    return cli_->Post(path, headers, params);
+}
+inline Result Client::Post(const std::string &path,
+    const MultipartFormDataItems &items) {
+    return cli_->Post(path, items);
+}
+inline Result Client::Post(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items) {
+    return cli_->Post(path, headers, items);
+}
+inline Result Client::Post(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items,
+    const std::string &boundary) {
+    return cli_->Post(path, headers, items, boundary);
+}
+inline Result
+Client::Post(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items,
+    const MultipartFormDataProviderItems &provider_items) {
+    return cli_->Post(path, headers, items, provider_items);
+}
+inline Result Client::Put(const std::string &path) { return cli_->Put(path); }
+inline Result Client::Put(const std::string &path, const char *body,
+    size_t content_length,
+    const std::string &content_type) {
+    return cli_->Put(path, body, content_length, content_type);
+}
+inline Result Client::Put(const std::string &path, const Headers &headers,
+    const char *body, size_t content_length,
+    const std::string &content_type) {
+    return cli_->Put(path, headers, body, content_length, content_type);
+}
+inline Result Client::Put(const std::string &path, const std::string &body,
+    const std::string &content_type) {
+    return cli_->Put(path, body, content_type);
+}
+inline Result Client::Put(const std::string &path, const Headers &headers,
+    const std::string &body,
+    const std::string &content_type) {
+    return cli_->Put(path, headers, body, content_type);
+}
+inline Result Client::Put(const std::string &path, size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return cli_->Put(path, content_length, std::move(content_provider),
+        content_type);
+}
+inline Result Client::Put(const std::string &path,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return cli_->Put(path, std::move(content_provider), content_type);
+}
+inline Result Client::Put(const std::string &path, const Headers &headers,
+    size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return cli_->Put(path, headers, content_length, std::move(content_provider),
+        content_type);
+}
+inline Result Client::Put(const std::string &path, const Headers &headers,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return cli_->Put(path, headers, std::move(content_provider), content_type);
+}
+inline Result Client::Put(const std::string &path, const Params &params) {
+    return cli_->Put(path, params);
+}
+inline Result Client::Put(const std::string &path, const Headers &headers,
+    const Params &params) {
+    return cli_->Put(path, headers, params);
+}
+inline Result Client::Put(const std::string &path,
+    const MultipartFormDataItems &items) {
+    return cli_->Put(path, items);
+}
+inline Result Client::Put(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items) {
+    return cli_->Put(path, headers, items);
+}
+inline Result Client::Put(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items,
+    const std::string &boundary) {
+    return cli_->Put(path, headers, items, boundary);
+}
+inline Result
+Client::Put(const std::string &path, const Headers &headers,
+    const MultipartFormDataItems &items,
+    const MultipartFormDataProviderItems &provider_items) {
+    return cli_->Put(path, headers, items, provider_items);
+}
+inline Result Client::Patch(const std::string &path) {
+    return cli_->Patch(path);
+}
+inline Result Client::Patch(const std::string &path, const char *body,
+    size_t content_length,
+    const std::string &content_type) {
+    return cli_->Patch(path, body, content_length, content_type);
+}
+inline Result Client::Patch(const std::string &path, const Headers &headers,
+    const char *body, size_t content_length,
+    const std::string &content_type) {
+    return cli_->Patch(path, headers, body, content_length, content_type);
+}
+inline Result Client::Patch(const std::string &path, const std::string &body,
+    const std::string &content_type) {
+    return cli_->Patch(path, body, content_type);
+}
+inline Result Client::Patch(const std::string &path, const Headers &headers,
+    const std::string &body,
+    const std::string &content_type) {
+    return cli_->Patch(path, headers, body, content_type);
+}
+inline Result Client::Patch(const std::string &path, size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return cli_->Patch(path, content_length, std::move(content_provider),
+        content_type);
+}
+inline Result Client::Patch(const std::string &path,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return cli_->Patch(path, std::move(content_provider), content_type);
+}
+inline Result Client::Patch(const std::string &path, const Headers &headers,
+    size_t content_length,
+    ContentProvider content_provider,
+    const std::string &content_type) {
+    return cli_->Patch(path, headers, content_length, std::move(content_provider),
+        content_type);
+}
+inline Result Client::Patch(const std::string &path, const Headers &headers,
+    ContentProviderWithoutLength content_provider,
+    const std::string &content_type) {
+    return cli_->Patch(path, headers, std::move(content_provider), content_type);
+}
+inline Result Client::Delete(const std::string &path) {
+    return cli_->Delete(path);
+}
+inline Result Client::Delete(const std::string &path, const Headers &headers) {
+    return cli_->Delete(path, headers);
+}
+inline Result Client::Delete(const std::string &path, const char *body,
+    size_t content_length,
+    const std::string &content_type) {
+    return cli_->Delete(path, body, content_length, content_type);
+}
+inline Result Client::Delete(const std::string &path, const Headers &headers,
+    const char *body, size_t content_length,
+    const std::string &content_type) {
+    return cli_->Delete(path, headers, body, content_length, content_type);
+}
+inline Result Client::Delete(const std::string &path, const std::string &body,
+    const std::string &content_type) {
+    return cli_->Delete(path, body, content_type);
+}
+inline Result Client::Delete(const std::string &path, const Headers &headers,
+    const std::string &body,
+    const std::string &content_type) {
+    return cli_->Delete(path, headers, body, content_type);
+}
+inline Result Client::Options(const std::string &path) {
+    return cli_->Options(path);
+}
+inline Result Client::Options(const std::string &path, const Headers &headers) {
+    return cli_->Options(path, headers);
+}
+
+inline bool Client::send(Request &req, Response &res, Error &error) {
+    return cli_->send(req, res, error);
+}
+
+inline Result Client::send(const Request &req) { return cli_->send(req); }
+
+inline void Client::stop() { cli_->stop(); }
+
+inline std::string Client::host() const { return cli_->host(); }
+
+inline int Client::port() const { return cli_->port(); }
+
+inline size_t Client::is_socket_open() const { return cli_->is_socket_open(); }
+
+inline socket_t Client::socket() const { return cli_->socket(); }
+
+inline void
+Client::set_hostname_addr_map(std::map<std::string, std::string> addr_map) {
+    cli_->set_hostname_addr_map(std::move(addr_map));
+}
+
+inline void Client::set_default_headers(Headers headers) {
+    cli_->set_default_headers(std::move(headers));
+}
+
+inline void Client::set_header_writer(
+    std::function<ssize_t(Stream &, Headers &)> const &writer) {
+    cli_->set_header_writer(writer);
+}
+
+inline void Client::set_address_family(int family) {
+    cli_->set_address_family(family);
+}
+
+inline void Client::set_tcp_nodelay(bool on) { cli_->set_tcp_nodelay(on); }
+
+inline void Client::set_socket_options(SocketOptions socket_options) {
+    cli_->set_socket_options(std::move(socket_options));
+}
+
+inline void Client::set_connection_timeout(time_t sec, time_t usec) {
+    cli_->set_connection_timeout(sec, usec);
+}
+
+inline void Client::set_read_timeout(time_t sec, time_t usec) {
+    cli_->set_read_timeout(sec, usec);
+}
+
+inline void Client::set_write_timeout(time_t sec, time_t usec) {
+    cli_->set_write_timeout(sec, usec);
+}
+
+inline void Client::set_basic_auth(const std::string &username,
+    const std::string &password) {
+    cli_->set_basic_auth(username, password);
+}
+inline void Client::set_bearer_token_auth(const std::string &token) {
+    cli_->set_bearer_token_auth(token);
+}
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+inline void Client::set_digest_auth(const std::string &username,
+    const std::string &password) {
+    cli_->set_digest_auth(username, password);
+}
+#endif
+
+inline void Client::set_keep_alive(bool on) { cli_->set_keep_alive(on); }
+inline void Client::set_follow_location(bool on) {
+    cli_->set_follow_location(on);
+}
+
+inline void Client::set_url_encode(bool on) { cli_->set_url_encode(on); }
+
+inline void Client::set_compress(bool on) { cli_->set_compress(on); }
+
+inline void Client::set_decompress(bool on) { cli_->set_decompress(on); }
+
+inline void Client::set_interface(const std::string &intf) {
+    cli_->set_interface(intf);
+}
+
+inline void Client::set_proxy(const std::string &host, int port) {
+    cli_->set_proxy(host, port);
+}
+inline void Client::set_proxy_basic_auth(const std::string &username,
+    const std::string &password) {
+    cli_->set_proxy_basic_auth(username, password);
+}
+inline void Client::set_proxy_bearer_token_auth(const std::string &token) {
+    cli_->set_proxy_bearer_token_auth(token);
+}
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+inline void Client::set_proxy_digest_auth(const std::string &username,
+    const std::string &password) {
+    cli_->set_proxy_digest_auth(username, password);
+}
+#endif
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+inline void Client::enable_server_certificate_verification(bool enabled) {
+    cli_->enable_server_certificate_verification(enabled);
+}
+#endif
+
+inline void Client::set_logger(Logger logger) {
+    cli_->set_logger(std::move(logger));
+}
+
+#ifdef CPPHTTPLIB_OPENSSL_SUPPORT
+inline void Client::set_ca_cert_path(const std::string &ca_cert_file_path,
+    const std::string &ca_cert_dir_path) {
+    cli_->set_ca_cert_path(ca_cert_file_path, ca_cert_dir_path);
+}
+
+inline void Client::set_ca_cert_store(X509_STORE *ca_cert_store) {
+    if (is_ssl_) {
+        static_cast<SSLClient &>(*cli_).set_ca_cert_store(ca_cert_store);
+    } else {
+        cli_->set_ca_cert_store(ca_cert_store);
+    }
+}
+
+inline void Client::load_ca_cert_store(const char *ca_cert, std::size_t size) {
+    set_ca_cert_store(cli_->create_ca_cert_store(ca_cert, size));
+}
+
+inline long Client::get_openssl_verify_result() const {
+    if (is_ssl_) {
+        return static_cast<SSLClient &>(*cli_).get_openssl_verify_result();
+    }
+    return -1; // NOTE: -1 doesn't match any of X509_V_ERR_???
+}
+
+inline SSL_CTX *Client::ssl_context() const {
+    if (is_ssl_) { return static_cast<SSLClient &>(*cli_).ssl_context(); }
+    return nullptr;
+}
+#endif
+
+// ----------------------------------------------------------------------------
+
+} // namespace httplib
+
+#if defined(_WIN32) && defined(CPPHTTPLIB_USE_POLL)
+#undef poll
+#endif
+
+#endif // CPPHTTPLIB_HTTPLIB_H
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/CMakeLists.txt
new file mode 100644
index 0000000000..7b78f8a68c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/CMakeLists.txt
@@ -0,0 +1,9 @@
+if(POLICY CMP0063)
+    cmake_policy(SET CMP0063 NEW)
+endif()
+
+add_library(lz4 STATIC lz4.cpp)
+
+target_include_directories(
+  lz4
+  PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/LICENSE
new file mode 100644
index 0000000000..ea4b93e95f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/LICENSE
@@ -0,0 +1,24 @@
+LZ4 Library
+Copyright (c) 2011-2020, Yann Collet
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice, this
+  list of conditions and the following disclaimer in the documentation and/or
+  other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/lz4.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/lz4.cpp
new file mode 100644
index 0000000000..53505b821c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/lz4.cpp
@@ -0,0 +1,2605 @@
+/*
+   LZ4 - Fast LZ compression algorithm
+   Copyright (C) 2011-2020, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   You can contact the author at :
+    - LZ4 homepage : http://www.lz4.org
+    - LZ4 source repository : https://github.com/lz4/lz4
+*/
+
+/*-************************************
+*  Tuning parameters
+**************************************/
+/*
+ * LZ4_HEAPMODE :
+ * Select how default compression functions will allocate memory for their hash table,
+ * in memory stack (0:default, fastest), or in memory heap (1:requires malloc()).
+ */
+#ifndef LZ4_HEAPMODE
+#  define LZ4_HEAPMODE 0
+#endif
+
+/*
+ * LZ4_ACCELERATION_DEFAULT :
+ * Select "acceleration" for LZ4_compress_fast() when parameter value <= 0
+ */
+#define LZ4_ACCELERATION_DEFAULT 1
+/*
+ * LZ4_ACCELERATION_MAX :
+ * Any "acceleration" value higher than this threshold
+ * get treated as LZ4_ACCELERATION_MAX instead (fix #876)
+ */
+#define LZ4_ACCELERATION_MAX 65537
+
+
+/*-************************************
+*  CPU Feature Detection
+**************************************/
+/* LZ4_FORCE_MEMORY_ACCESS
+ * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
+ * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
+ * The below switch allow to select different access method for improved performance.
+ * Method 0 (default) : use `memcpy()`. Safe and portable.
+ * Method 1 : `__packed` statement. It depends on compiler extension (ie, not portable).
+ *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
+ * Method 2 : direct access. This method is portable but violate C standard.
+ *            It can generate buggy code on targets which assembly generation depends on alignment.
+ *            But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)
+ * See https://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.
+ * Prefer these methods in priority order (0 > 1 > 2)
+ */
+#ifndef LZ4_FORCE_MEMORY_ACCESS   /* can be defined externally */
+#  if defined(__GNUC__) && \
+  ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) \
+  || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
+#    define LZ4_FORCE_MEMORY_ACCESS 2
+#  elif (defined(__INTEL_COMPILER) && !defined(_WIN32)) || defined(__GNUC__)
+#    define LZ4_FORCE_MEMORY_ACCESS 1
+#  endif
+#endif
+
+/*
+ * LZ4_FORCE_SW_BITCOUNT
+ * Define this parameter if your target system or compiler does not support hardware bit count
+ */
+#if defined(_MSC_VER) && defined(_WIN32_WCE)   /* Visual Studio for WinCE doesn't support Hardware bit count */
+#  undef  LZ4_FORCE_SW_BITCOUNT  /* avoid double def */
+#  define LZ4_FORCE_SW_BITCOUNT
+#endif
+
+
+
+/*-************************************
+*  Dependency
+**************************************/
+/*
+ * LZ4_SRC_INCLUDED:
+ * Amalgamation flag, whether lz4.c is included
+ */
+#ifndef LZ4_SRC_INCLUDED
+#  define LZ4_SRC_INCLUDED 1
+#endif
+
+#ifndef LZ4_STATIC_LINKING_ONLY
+#define LZ4_STATIC_LINKING_ONLY
+#endif
+
+#ifndef LZ4_DISABLE_DEPRECATE_WARNINGS
+#define LZ4_DISABLE_DEPRECATE_WARNINGS /* due to LZ4_decompress_safe_withPrefix64k */
+#endif
+
+#define LZ4_STATIC_LINKING_ONLY  /* LZ4_DISTANCE_MAX */
+#include <stdlib.h>
+
+#include "lz4.hpp"
+/* see also "memory routines" below */
+
+
+/*-************************************
+*  Compiler Options
+**************************************/
+
+#define LZ4_FORCE_INLINE static
+#define LZ4_FORCE_O2
+
+#if (defined(__GNUC__) && (__GNUC__ >= 3)) || (defined(__INTEL_COMPILER) && (__INTEL_COMPILER >= 800)) || defined(__clang__)
+#  define expect(expr,value)    (__builtin_expect ((expr),(value)) )
+#else
+#  define expect(expr,value)    (expr)
+#endif
+
+#ifndef likely
+#define likely(expr)     expect((expr) != 0, 1)
+#endif
+#ifndef unlikely
+#define unlikely(expr)   expect((expr) != 0, 0)
+#endif
+
+/* Should the alignment test prove unreliable, for some reason,
+ * it can be disabled by setting LZ4_ALIGN_TEST to 0 */
+#ifndef LZ4_ALIGN_TEST  /* can be externally provided */
+# define LZ4_ALIGN_TEST 1
+#endif
+
+namespace lbug_lz4 {
+/*-************************************
+*  Memory routines
+**************************************/
+
+/*! LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION :
+ *  Disable relatively high-level LZ4/HC functions that use dynamic memory
+ *  allocation functions (malloc(), calloc(), free()).
+ *
+ *  Note that this is a compile-time switch. And since it disables
+ *  public/stable LZ4 v1 API functions, we don't recommend using this
+ *  symbol to generate a library for distribution.
+ *
+ *  The following public functions are removed when this symbol is defined.
+ *  - lz4   : LZ4_createStream, LZ4_freeStream,
+ *            LZ4_createStreamDecode, LZ4_freeStreamDecode, LZ4_create (deprecated)
+ *  - lz4hc : LZ4_createStreamHC, LZ4_freeStreamHC,
+ *            LZ4_createHC (deprecated), LZ4_freeHC  (deprecated)
+ *  - lz4frame, lz4file : All LZ4F_* functions
+ */
+#if defined(LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION)
+#  define ALLOC(s)          lz4_error_memory_allocation_is_disabled
+#  define ALLOC_AND_ZERO(s) lz4_error_memory_allocation_is_disabled
+#  define FREEMEM(p)        lz4_error_memory_allocation_is_disabled
+#elif defined(LZ4_USER_MEMORY_FUNCTIONS)
+/* memory management functions can be customized by user project.
+ * Below functions must exist somewhere in the Project
+ * and be available at link time */
+void* LZ4_malloc(size_t s);
+void* LZ4_calloc(size_t n, size_t s);
+void  LZ4_free(void* p);
+# define ALLOC(s)          LZ4_malloc(s)
+# define ALLOC_AND_ZERO(s) LZ4_calloc(1,s)
+# define FREEMEM(p)        LZ4_free(p)
+#else
+# include <stdlib.h>   /* malloc, calloc, free */
+# define ALLOC(s)          malloc(s)
+# define ALLOC_AND_ZERO(s) calloc(1,s)
+# define FREEMEM(p)        free(p)
+#endif
+
+#if ! LZ4_FREESTANDING
+#  include <string.h>   /* memset, memcpy */
+#endif
+#if !defined(LZ4_memset)
+#  define LZ4_memset(p,v,s) memset((p),(v),(s))
+#endif
+#define MEM_INIT(p,v,s)   LZ4_memset((p),(v),(s))
+
+
+/*-************************************
+*  Common Constants
+**************************************/
+#define MINMATCH 4
+
+#define WILDCOPYLENGTH 8
+#define LASTLITERALS   5   /* see ../doc/lz4_Block_format.md#parsing-restrictions */
+#define MFLIMIT       12   /* see ../doc/lz4_Block_format.md#parsing-restrictions */
+#define MATCH_SAFEGUARD_DISTANCE  ((2*WILDCOPYLENGTH) - MINMATCH)   /* ensure it's possible to write 2 x wildcopyLength without overflowing output buffer */
+#define FASTLOOP_SAFE_DISTANCE 64
+static const int LZ4_minLength = (MFLIMIT+1);
+
+#define KB *(1 <<10)
+#define MB *(1 <<20)
+#define GB *(1U<<30)
+
+#define LZ4_DISTANCE_ABSOLUTE_MAX 65535
+#if (LZ4_DISTANCE_MAX > LZ4_DISTANCE_ABSOLUTE_MAX)   /* max supported by LZ4 format */
+#  error "LZ4_DISTANCE_MAX is too big : must be <= 65535"
+#endif
+
+#define ML_BITS  4
+#define ML_MASK  ((1U<<ML_BITS)-1)
+#define RUN_BITS (8-ML_BITS)
+#define RUN_MASK ((1U<<RUN_BITS)-1)
+
+
+/*-************************************
+*  Error detection
+**************************************/
+#if defined(LZ4_DEBUG) && (LZ4_DEBUG>=1)
+#  include <assert.h>
+#else
+#  ifndef assert
+#    define assert(condition) ((void)0)
+#  endif
+#endif
+
+#define LZ4_STATIC_ASSERT(c)   { enum { LZ4_static_assert = 1/(int)(!!(c)) }; }   /* use after variable declarations */
+
+#if defined(LZ4_DEBUG) && (LZ4_DEBUG>=2)
+#  include <stdio.h>
+   static int g_debuglog_enable = 1;
+#  define DEBUGLOG(l, ...) {                          \
+        if ((g_debuglog_enable) && (l<=LZ4_DEBUG)) {  \
+            fprintf(stderr, __FILE__ ": ");           \
+            fprintf(stderr, __VA_ARGS__);             \
+            fprintf(stderr, " \n");                   \
+    }   }
+#else
+#  define DEBUGLOG(l, ...) {}    /* disabled */
+#endif
+
+static int LZ4_isAligned(const void* ptr, size_t alignment)
+{
+    return ((size_t)ptr & (alignment -1)) == 0;
+}
+
+
+/*-************************************
+*  Types
+**************************************/
+#include <limits.h>
+#if defined(__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
+# include <stdint.h>
+  typedef  uint8_t BYTE;
+  typedef uint16_t U16;
+  typedef uint32_t U32;
+  typedef  int32_t S32;
+  typedef uint64_t U64;
+  typedef uintptr_t uptrval;
+#else
+# if UINT_MAX != 4294967295UL
+#   error "LZ4 code (when not C++ or C99) assumes that sizeof(int) == 4"
+# endif
+  typedef unsigned char       BYTE;
+  typedef unsigned short      U16;
+  typedef unsigned int        U32;
+  typedef   signed int        S32;
+  typedef unsigned long long  U64;
+  typedef size_t              uptrval;   /* generally true, except OpenVMS-64 */
+#endif
+
+#if defined(__x86_64__)
+  typedef U64    reg_t;   /* 64-bits in x32 mode */
+#else
+  typedef size_t reg_t;   /* 32-bits in x32 mode */
+#endif
+
+typedef enum {
+    notLimited = 0,
+    limitedOutput = 1,
+    fillOutput = 2
+} limitedOutput_directive;
+
+
+/*-************************************
+*  Reading and writing into memory
+**************************************/
+
+/**
+ * LZ4 relies on memcpy with a constant size being inlined. In freestanding
+ * environments, the compiler can't assume the implementation of memcpy() is
+ * standard compliant, so it can't apply its specialized memcpy() inlining
+ * logic. When possible, use __builtin_memcpy() to tell the compiler to analyze
+ * memcpy() as if it were standard compliant, so it can inline it in freestanding
+ * environments. This is needed when decompressing the Linux Kernel, for example.
+ */
+#if !defined(LZ4_memcpy)
+#  if defined(__GNUC__) && (__GNUC__ >= 4)
+#    define LZ4_memcpy(dst, src, size) __builtin_memcpy(dst, src, size)
+#  else
+#    define LZ4_memcpy(dst, src, size) memcpy(dst, src, size)
+#  endif
+#endif
+
+#if !defined(LZ4_memmove)
+#  if defined(__GNUC__) && (__GNUC__ >= 4)
+#    define LZ4_memmove __builtin_memmove
+#  else
+#    define LZ4_memmove memmove
+#  endif
+#endif
+
+static unsigned LZ4_isLittleEndian(void)
+{
+    const union { U32 u; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental */
+    return one.c[0];
+}
+
+
+#if defined(LZ4_FORCE_MEMORY_ACCESS) && (LZ4_FORCE_MEMORY_ACCESS==2)
+/* lie to the compiler about data alignment; use with caution */
+
+static U16 LZ4_read16(const void* memPtr) { return *(const U16*) memPtr; }
+static U32 LZ4_read32(const void* memPtr) { return *(const U32*) memPtr; }
+static reg_t LZ4_read_ARCH(const void* memPtr) { return *(const reg_t*) memPtr; }
+
+static void LZ4_write16(void* memPtr, U16 value) { *(U16*)memPtr = value; }
+static void LZ4_write32(void* memPtr, U32 value) { *(U32*)memPtr = value; }
+
+#elif defined(LZ4_FORCE_MEMORY_ACCESS) && (LZ4_FORCE_MEMORY_ACCESS==1)
+
+/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
+/* currently only defined for gcc and icc */
+typedef union { U16 u16; U32 u32; reg_t uArch; } __attribute__((packed)) LZ4_unalign;
+
+static U16 LZ4_read16(const void* ptr) { return ((const LZ4_unalign*)ptr)->u16; }
+static U32 LZ4_read32(const void* ptr) { return ((const LZ4_unalign*)ptr)->u32; }
+static reg_t LZ4_read_ARCH(const void* ptr) { return ((const LZ4_unalign*)ptr)->uArch; }
+
+static void LZ4_write16(void* memPtr, U16 value) { ((LZ4_unalign*)memPtr)->u16 = value; }
+static void LZ4_write32(void* memPtr, U32 value) { ((LZ4_unalign*)memPtr)->u32 = value; }
+
+#else  /* safe and portable access using memcpy() */
+
+static U16 LZ4_read16(const void* memPtr)
+{
+    U16 val; LZ4_memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+static U32 LZ4_read32(const void* memPtr)
+{
+    U32 val; LZ4_memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+static reg_t LZ4_read_ARCH(const void* memPtr)
+{
+    reg_t val; LZ4_memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+static void LZ4_write16(void* memPtr, U16 value)
+{
+    LZ4_memcpy(memPtr, &value, sizeof(value));
+}
+
+static void LZ4_write32(void* memPtr, U32 value)
+{
+    LZ4_memcpy(memPtr, &value, sizeof(value));
+}
+
+#endif /* LZ4_FORCE_MEMORY_ACCESS */
+
+
+static U16 LZ4_readLE16(const void* memPtr)
+{
+    if (LZ4_isLittleEndian()) {
+        return LZ4_read16(memPtr);
+    } else {
+        const BYTE* p = (const BYTE*)memPtr;
+        return (U16)((U16)p[0] + (p[1]<<8));
+    }
+}
+
+static void LZ4_writeLE16(void* memPtr, U16 value)
+{
+    if (LZ4_isLittleEndian()) {
+        LZ4_write16(memPtr, value);
+    } else {
+        BYTE* p = (BYTE*)memPtr;
+        p[0] = (BYTE) value;
+        p[1] = (BYTE)(value>>8);
+    }
+}
+
+/* customized variant of memcpy, which can overwrite up to 8 bytes beyond dstEnd */
+LZ4_FORCE_INLINE
+void LZ4_wildCopy8(void* dstPtr, const void* srcPtr, void* dstEnd)
+{
+    BYTE* d = (BYTE*)dstPtr;
+    const BYTE* s = (const BYTE*)srcPtr;
+    BYTE* const e = (BYTE*)dstEnd;
+
+    do { LZ4_memcpy(d,s,8); d+=8; s+=8; } while (d<e);
+}
+
+static const unsigned inc32table[8] = {0, 1, 2,  1,  0,  4, 4, 4};
+static const int      dec64table[8] = {0, 0, 0, -1, -4,  1, 2, 3};
+
+
+#ifndef LZ4_FAST_DEC_LOOP
+#  if defined __i386__ || defined _M_IX86 || defined __x86_64__ || defined _M_X64
+#    define LZ4_FAST_DEC_LOOP 1
+#  elif defined(__aarch64__) && defined(__APPLE__)
+#    define LZ4_FAST_DEC_LOOP 1
+#  elif defined(__aarch64__) && !defined(__clang__)
+     /* On non-Apple aarch64, we disable this optimization for clang because
+      * on certain mobile chipsets, performance is reduced with clang. For
+      * more information refer to https://github.com/lz4/lz4/pull/707 */
+#    define LZ4_FAST_DEC_LOOP 1
+#  else
+#    define LZ4_FAST_DEC_LOOP 0
+#  endif
+#endif
+
+#if LZ4_FAST_DEC_LOOP
+
+LZ4_FORCE_INLINE void
+LZ4_memcpy_using_offset_base(BYTE* dstPtr, const BYTE* srcPtr, BYTE* dstEnd, const size_t offset)
+{
+    assert(srcPtr + offset == dstPtr);
+    if (offset < 8) {
+        LZ4_write32(dstPtr, 0);   /* silence an msan warning when offset==0 */
+        dstPtr[0] = srcPtr[0];
+        dstPtr[1] = srcPtr[1];
+        dstPtr[2] = srcPtr[2];
+        dstPtr[3] = srcPtr[3];
+        srcPtr += inc32table[offset];
+        LZ4_memcpy(dstPtr+4, srcPtr, 4);
+        srcPtr -= dec64table[offset];
+        dstPtr += 8;
+    } else {
+        LZ4_memcpy(dstPtr, srcPtr, 8);
+        dstPtr += 8;
+        srcPtr += 8;
+    }
+
+    LZ4_wildCopy8(dstPtr, srcPtr, dstEnd);
+}
+
+/* customized variant of memcpy, which can overwrite up to 32 bytes beyond dstEnd
+ * this version copies two times 16 bytes (instead of one time 32 bytes)
+ * because it must be compatible with offsets >= 16. */
+LZ4_FORCE_INLINE void
+LZ4_wildCopy32(void* dstPtr, const void* srcPtr, void* dstEnd)
+{
+    BYTE* d = (BYTE*)dstPtr;
+    const BYTE* s = (const BYTE*)srcPtr;
+    BYTE* const e = (BYTE*)dstEnd;
+
+    do { LZ4_memcpy(d,s,16); LZ4_memcpy(d+16,s+16,16); d+=32; s+=32; } while (d<e);
+}
+
+/* LZ4_memcpy_using_offset()  presumes :
+ * - dstEnd >= dstPtr + MINMATCH
+ * - there is at least 8 bytes available to write after dstEnd */
+LZ4_FORCE_INLINE void
+LZ4_memcpy_using_offset(BYTE* dstPtr, const BYTE* srcPtr, BYTE* dstEnd, const size_t offset)
+{
+    BYTE v[8];
+
+    assert(dstEnd >= dstPtr + MINMATCH);
+
+    switch(offset) {
+    case 1:
+        MEM_INIT(v, *srcPtr, 8);
+        break;
+    case 2:
+        LZ4_memcpy(v, srcPtr, 2);
+        LZ4_memcpy(&v[2], srcPtr, 2);
+#if defined(_MSC_VER) && (_MSC_VER <= 1933) /* MSVC 2022 ver 17.3 or earlier */
+#  pragma warning(push)
+#  pragma warning(disable : 6385) /* warning C6385: Reading invalid data from 'v'. */
+#endif
+        LZ4_memcpy(&v[4], v, 4);
+#if defined(_MSC_VER) && (_MSC_VER <= 1933) /* MSVC 2022 ver 17.3 or earlier */
+#  pragma warning(pop)
+#endif
+        break;
+    case 4:
+        LZ4_memcpy(v, srcPtr, 4);
+        LZ4_memcpy(&v[4], srcPtr, 4);
+        break;
+    default:
+        LZ4_memcpy_using_offset_base(dstPtr, srcPtr, dstEnd, offset);
+        return;
+    }
+
+    LZ4_memcpy(dstPtr, v, 8);
+    dstPtr += 8;
+    while (dstPtr < dstEnd) {
+        LZ4_memcpy(dstPtr, v, 8);
+        dstPtr += 8;
+    }
+}
+#endif
+
+
+/*-************************************
+*  Common functions
+**************************************/
+static unsigned LZ4_NbCommonBytes (reg_t val)
+{
+    assert(val != 0);
+    if (LZ4_isLittleEndian()) {
+        if (sizeof(val) == 8) {
+            const U64 m = 0x0101010101010101ULL;
+            val ^= val - 1;
+            return (unsigned)(((U64)((val & (m - 1)) * m)) >> 56);
+        } else /* 32 bits */ {
+            const U32 m = 0x01010101;
+            return (unsigned)((((val - 1) ^ val) & (m - 1)) * m) >> 24;
+        }
+    } else   /* Big Endian CPU */ {
+		assert(false);
+		return 0;
+    }
+}
+
+
+#define STEPSIZE sizeof(reg_t)
+LZ4_FORCE_INLINE
+unsigned LZ4_count(const BYTE* pIn, const BYTE* pMatch, const BYTE* pInLimit)
+{
+    const BYTE* const pStart = pIn;
+
+    if (likely(pIn < pInLimit-(STEPSIZE-1))) {
+        reg_t const diff = LZ4_read_ARCH(pMatch) ^ LZ4_read_ARCH(pIn);
+        if (!diff) {
+            pIn+=STEPSIZE; pMatch+=STEPSIZE;
+        } else {
+            return LZ4_NbCommonBytes(diff);
+    }   }
+
+    while (likely(pIn < pInLimit-(STEPSIZE-1))) {
+        reg_t const diff = LZ4_read_ARCH(pMatch) ^ LZ4_read_ARCH(pIn);
+        if (!diff) { pIn+=STEPSIZE; pMatch+=STEPSIZE; continue; }
+        pIn += LZ4_NbCommonBytes(diff);
+        return (unsigned)(pIn - pStart);
+    }
+
+    if ((STEPSIZE==8) && (pIn<(pInLimit-3)) && (LZ4_read32(pMatch) == LZ4_read32(pIn))) { pIn+=4; pMatch+=4; }
+    if ((pIn<(pInLimit-1)) && (LZ4_read16(pMatch) == LZ4_read16(pIn))) { pIn+=2; pMatch+=2; }
+    if ((pIn<pInLimit) && (*pMatch == *pIn)) pIn++;
+    return (unsigned)(pIn - pStart);
+}
+
+
+#ifndef LZ4_COMMONDEFS_ONLY
+/*-************************************
+*  Local Constants
+**************************************/
+static const int LZ4_64Klimit = ((64 KB) + (MFLIMIT-1));
+static const U32 LZ4_skipTrigger = 6;  /* Increase this value ==> compression run slower on incompressible data */
+
+
+/*-************************************
+*  Local Structures and types
+**************************************/
+typedef enum { clearedTable = 0, byPtr, byU32, byU16 } tableType_t;
+
+/**
+ * This enum distinguishes several different modes of accessing previous
+ * content in the stream.
+ *
+ * - noDict        : There is no preceding content.
+ * - withPrefix64k : Table entries up to ctx->dictSize before the current blob
+ *                   blob being compressed are valid and refer to the preceding
+ *                   content (of length ctx->dictSize), which is available
+ *                   contiguously preceding in memory the content currently
+ *                   being compressed.
+ * - usingExtDict  : Like withPrefix64k, but the preceding content is somewhere
+ *                   else in memory, starting at ctx->dictionary with length
+ *                   ctx->dictSize.
+ * - usingDictCtx  : Everything concerning the preceding content is
+ *                   in a separate context, pointed to by ctx->dictCtx.
+ *                   ctx->dictionary, ctx->dictSize, and table entries
+ *                   in the current context that refer to positions
+ *                   preceding the beginning of the current compression are
+ *                   ignored. Instead, ctx->dictCtx->dictionary and ctx->dictCtx
+ *                   ->dictSize describe the location and size of the preceding
+ *                   content, and matches are found by looking in the ctx
+ *                   ->dictCtx->hashTable.
+ */
+typedef enum { noDict = 0, withPrefix64k, usingExtDict, usingDictCtx } dict_directive;
+typedef enum { noDictIssue = 0, dictSmall } dictIssue_directive;
+
+
+/*-************************************
+*  Local Utils
+**************************************/
+int LZ4_versionNumber (void) { return LZ4_VERSION_NUMBER; }
+const char* LZ4_versionString(void) { return LZ4_VERSION_STRING; }
+int LZ4_compressBound(int isize)  { return LZ4_COMPRESSBOUND(isize); }
+int LZ4_sizeofState(void) { return sizeof(LZ4_stream_t); }
+
+
+/*-****************************************
+*  Internal Definitions, used only in Tests
+*******************************************/
+//#if defined (__cplusplus)
+//extern "C" {
+//#endif
+
+int LZ4_compress_forceExtDict (LZ4_stream_t* LZ4_dict, const char* source, char* dest, int srcSize);
+
+int LZ4_decompress_safe_forceExtDict(const char* source, char* dest,
+                                     int compressedSize, int maxOutputSize,
+                                     const void* dictStart, size_t dictSize);
+int LZ4_decompress_safe_partial_forceExtDict(const char* source, char* dest,
+                                     int compressedSize, int targetOutputSize, int dstCapacity,
+                                     const void* dictStart, size_t dictSize);
+//#if defined (__cplusplus)
+//}
+//#endif
+
+/*-******************************
+*  Compression functions
+********************************/
+LZ4_FORCE_INLINE U32 LZ4_hash4(U32 sequence, tableType_t const tableType)
+{
+    if (tableType == byU16)
+        return ((sequence * 2654435761U) >> ((MINMATCH*8)-(LZ4_HASHLOG+1)));
+    else
+        return ((sequence * 2654435761U) >> ((MINMATCH*8)-LZ4_HASHLOG));
+}
+
+LZ4_FORCE_INLINE U32 LZ4_hash5(U64 sequence, tableType_t const tableType)
+{
+    const U32 hashLog = (tableType == byU16) ? LZ4_HASHLOG+1 : LZ4_HASHLOG;
+    if (LZ4_isLittleEndian()) {
+        const U64 prime5bytes = 889523592379ULL;
+        return (U32)(((sequence << 24) * prime5bytes) >> (64 - hashLog));
+    } else {
+        const U64 prime8bytes = 11400714785074694791ULL;
+        return (U32)(((sequence >> 24) * prime8bytes) >> (64 - hashLog));
+    }
+}
+
+LZ4_FORCE_INLINE U32 LZ4_hashPosition(const void* const p, tableType_t const tableType)
+{
+    if ((sizeof(reg_t)==8) && (tableType != byU16)) return LZ4_hash5(LZ4_read_ARCH(p), tableType);
+    return LZ4_hash4(LZ4_read32(p), tableType);
+}
+
+LZ4_FORCE_INLINE void LZ4_clearHash(U32 h, void* tableBase, tableType_t const tableType)
+{
+    switch (tableType)
+    {
+    default: /* fallthrough */
+    case clearedTable: { /* illegal! */ assert(0); return; }
+    case byPtr: { const BYTE** hashTable = (const BYTE**)tableBase; hashTable[h] = NULL; return; }
+    case byU32: { U32* hashTable = (U32*) tableBase; hashTable[h] = 0; return; }
+    case byU16: { U16* hashTable = (U16*) tableBase; hashTable[h] = 0; return; }
+    }
+}
+
+LZ4_FORCE_INLINE void LZ4_putIndexOnHash(U32 idx, U32 h, void* tableBase, tableType_t const tableType)
+{
+    switch (tableType)
+    {
+    default: /* fallthrough */
+    case clearedTable: /* fallthrough */
+    case byPtr: { /* illegal! */ assert(0); return; }
+    case byU32: { U32* hashTable = (U32*) tableBase; hashTable[h] = idx; return; }
+    case byU16: { U16* hashTable = (U16*) tableBase; assert(idx < 65536); hashTable[h] = (U16)idx; return; }
+    }
+}
+
+LZ4_FORCE_INLINE void LZ4_putPositionOnHash(const BYTE* p, U32 h,
+                                  void* tableBase, tableType_t const tableType,
+                            const BYTE* srcBase)
+{
+    switch (tableType)
+    {
+    case clearedTable: { /* illegal! */ assert(0); return; }
+    case byPtr: { const BYTE** hashTable = (const BYTE**)tableBase; hashTable[h] = p; return; }
+    case byU32: { U32* hashTable = (U32*) tableBase; hashTable[h] = (U32)(p-srcBase); return; }
+    case byU16: { U16* hashTable = (U16*) tableBase; hashTable[h] = (U16)(p-srcBase); return; }
+    }
+}
+
+LZ4_FORCE_INLINE void LZ4_putPosition(const BYTE* p, void* tableBase, tableType_t tableType, const BYTE* srcBase)
+{
+    U32 const h = LZ4_hashPosition(p, tableType);
+    LZ4_putPositionOnHash(p, h, tableBase, tableType, srcBase);
+}
+
+/* LZ4_getIndexOnHash() :
+ * Index of match position registered in hash table.
+ * hash position must be calculated by using base+index, or dictBase+index.
+ * Assumption 1 : only valid if tableType == byU32 or byU16.
+ * Assumption 2 : h is presumed valid (within limits of hash table)
+ */
+LZ4_FORCE_INLINE U32 LZ4_getIndexOnHash(U32 h, const void* tableBase, tableType_t tableType)
+{
+    LZ4_STATIC_ASSERT(LZ4_MEMORY_USAGE > 2);
+    if (tableType == byU32) {
+        const U32* const hashTable = (const U32*) tableBase;
+        assert(h < (1U << (LZ4_MEMORY_USAGE-2)));
+        return hashTable[h];
+    }
+    if (tableType == byU16) {
+        const U16* const hashTable = (const U16*) tableBase;
+        assert(h < (1U << (LZ4_MEMORY_USAGE-1)));
+        return hashTable[h];
+    }
+    assert(0); return 0;  /* forbidden case */
+}
+
+static const BYTE* LZ4_getPositionOnHash(U32 h, const void* tableBase, tableType_t tableType, const BYTE* srcBase)
+{
+    if (tableType == byPtr) { const BYTE* const* hashTable = (const BYTE* const*) tableBase; return hashTable[h]; }
+    if (tableType == byU32) { const U32* const hashTable = (const U32*) tableBase; return hashTable[h] + srcBase; }
+    { const U16* const hashTable = (const U16*) tableBase; return hashTable[h] + srcBase; }   /* default, to ensure a return */
+}
+
+LZ4_FORCE_INLINE const BYTE*
+LZ4_getPosition(const BYTE* p,
+                const void* tableBase, tableType_t tableType,
+                const BYTE* srcBase)
+{
+    U32 const h = LZ4_hashPosition(p, tableType);
+    return LZ4_getPositionOnHash(h, tableBase, tableType, srcBase);
+}
+
+LZ4_FORCE_INLINE void
+LZ4_prepareTable(LZ4_stream_t_internal* const cctx,
+           const int inputSize,
+           const tableType_t tableType) {
+    /* If the table hasn't been used, it's guaranteed to be zeroed out, and is
+     * therefore safe to use no matter what mode we're in. Otherwise, we figure
+     * out if it's safe to leave as is or whether it needs to be reset.
+     */
+    if ((tableType_t)cctx->tableType != clearedTable) {
+        assert(inputSize >= 0);
+        if ((tableType_t)cctx->tableType != tableType
+          || ((tableType == byU16) && cctx->currentOffset + (unsigned)inputSize >= 0xFFFFU)
+          || ((tableType == byU32) && cctx->currentOffset > 1 GB)
+          || tableType == byPtr
+          || inputSize >= 4 KB)
+        {
+            DEBUGLOG(4, "LZ4_prepareTable: Resetting table in %p", cctx);
+            MEM_INIT(cctx->hashTable, 0, LZ4_HASHTABLESIZE);
+            cctx->currentOffset = 0;
+            cctx->tableType = (U32)clearedTable;
+        } else {
+            DEBUGLOG(4, "LZ4_prepareTable: Re-use hash table (no reset)");
+        }
+    }
+
+    /* Adding a gap, so all previous entries are > LZ4_DISTANCE_MAX back,
+     * is faster than compressing without a gap.
+     * However, compressing with currentOffset == 0 is faster still,
+     * so we preserve that case.
+     */
+    if (cctx->currentOffset != 0 && tableType == byU32) {
+        DEBUGLOG(5, "LZ4_prepareTable: adding 64KB to currentOffset");
+        cctx->currentOffset += 64 KB;
+    }
+
+    /* Finally, clear history */
+    cctx->dictCtx = NULL;
+    cctx->dictionary = NULL;
+    cctx->dictSize = 0;
+}
+
+/** LZ4_compress_generic() :
+ *  inlined, to ensure branches are decided at compilation time.
+ *  Presumed already validated at this stage:
+ *  - source != NULL
+ *  - inputSize > 0
+ */
+LZ4_FORCE_INLINE int LZ4_compress_generic_validated(
+                 LZ4_stream_t_internal* const cctx,
+                 const char* const source,
+                 char* const dest,
+                 const int inputSize,
+                 int*  inputConsumed, /* only written when outputDirective == fillOutput */
+                 const int maxOutputSize,
+                 const limitedOutput_directive outputDirective,
+                 const tableType_t tableType,
+                 const dict_directive dictDirective,
+                 const dictIssue_directive dictIssue,
+                 const int acceleration)
+{
+    int result;
+    const BYTE* ip = (const BYTE*) source;
+
+    U32 const startIndex = cctx->currentOffset;
+    const BYTE* base = (const BYTE*) source - startIndex;
+    const BYTE* lowLimit;
+
+    const LZ4_stream_t_internal* dictCtx = (const LZ4_stream_t_internal*) cctx->dictCtx;
+    const BYTE* const dictionary =
+        dictDirective == usingDictCtx ? dictCtx->dictionary : cctx->dictionary;
+    const U32 dictSize =
+        dictDirective == usingDictCtx ? dictCtx->dictSize : cctx->dictSize;
+    const U32 dictDelta = (dictDirective == usingDictCtx) ? startIndex - dictCtx->currentOffset : 0;   /* make indexes in dictCtx comparable with index in current context */
+
+    int const maybe_extMem = (dictDirective == usingExtDict) || (dictDirective == usingDictCtx);
+    U32 const prefixIdxLimit = startIndex - dictSize;   /* used when dictDirective == dictSmall */
+    const BYTE* const dictEnd = dictionary ? dictionary + dictSize : dictionary;
+    const BYTE* anchor = (const BYTE*) source;
+    const BYTE* const iend = ip + inputSize;
+    const BYTE* const mflimitPlusOne = iend - MFLIMIT + 1;
+    const BYTE* const matchlimit = iend - LASTLITERALS;
+
+    /* the dictCtx currentOffset is indexed on the start of the dictionary,
+     * while a dictionary in the current context precedes the currentOffset */
+    const BYTE* dictBase = (dictionary == NULL) ? NULL :
+                           (dictDirective == usingDictCtx) ?
+                            dictionary + dictSize - dictCtx->currentOffset :
+                            dictionary + dictSize - startIndex;
+
+    BYTE* op = (BYTE*) dest;
+    BYTE* const olimit = op + maxOutputSize;
+
+    U32 offset = 0;
+    U32 forwardH;
+
+    DEBUGLOG(5, "LZ4_compress_generic_validated: srcSize=%i, tableType=%u", inputSize, tableType);
+    assert(ip != NULL);
+    /* If init conditions are not met, we don't have to mark stream
+     * as having dirty context, since no action was taken yet */
+    if (outputDirective == fillOutput && maxOutputSize < 1) { return 0; } /* Impossible to store anything */
+    if ((tableType == byU16) && (inputSize>=LZ4_64Klimit)) { return 0; }  /* Size too large (not within 64K limit) */
+    if (tableType==byPtr) assert(dictDirective==noDict);      /* only supported use case with byPtr */
+    assert(acceleration >= 1);
+
+    lowLimit = (const BYTE*)source - (dictDirective == withPrefix64k ? dictSize : 0);
+
+    /* Update context state */
+    if (dictDirective == usingDictCtx) {
+        /* Subsequent linked blocks can't use the dictionary. */
+        /* Instead, they use the block we just compressed. */
+        cctx->dictCtx = NULL;
+        cctx->dictSize = (U32)inputSize;
+    } else {
+        cctx->dictSize += (U32)inputSize;
+    }
+    cctx->currentOffset += (U32)inputSize;
+    cctx->tableType = (U32)tableType;
+
+    if (inputSize<LZ4_minLength) goto _last_literals;        /* Input too small, no compression (all literals) */
+
+    /* First Byte */
+    LZ4_putPosition(ip, cctx->hashTable, tableType, base);
+    ip++; forwardH = LZ4_hashPosition(ip, tableType);
+
+    /* Main Loop */
+    for ( ; ; ) {
+        const BYTE* match;
+        BYTE* token;
+        const BYTE* filledIp;
+
+        /* Find a match */
+        if (tableType == byPtr) {
+            const BYTE* forwardIp = ip;
+            int step = 1;
+            int searchMatchNb = acceleration << LZ4_skipTrigger;
+            do {
+                U32 const h = forwardH;
+                ip = forwardIp;
+                forwardIp += step;
+                step = (searchMatchNb++ >> LZ4_skipTrigger);
+
+                if (unlikely(forwardIp > mflimitPlusOne)) goto _last_literals;
+                assert(ip < mflimitPlusOne);
+
+                match = LZ4_getPositionOnHash(h, cctx->hashTable, tableType, base);
+                forwardH = LZ4_hashPosition(forwardIp, tableType);
+                LZ4_putPositionOnHash(ip, h, cctx->hashTable, tableType, base);
+
+            } while ( (match+LZ4_DISTANCE_MAX < ip)
+                   || (LZ4_read32(match) != LZ4_read32(ip)) );
+
+        } else {   /* byU32, byU16 */
+
+            const BYTE* forwardIp = ip;
+            int step = 1;
+            int searchMatchNb = acceleration << LZ4_skipTrigger;
+            do {
+                U32 const h = forwardH;
+                U32 const current = (U32)(forwardIp - base);
+                U32 matchIndex = LZ4_getIndexOnHash(h, cctx->hashTable, tableType);
+                assert(matchIndex <= current);
+                assert(forwardIp - base < (ptrdiff_t)(2 GB - 1));
+                ip = forwardIp;
+                forwardIp += step;
+                step = (searchMatchNb++ >> LZ4_skipTrigger);
+
+                if (unlikely(forwardIp > mflimitPlusOne)) goto _last_literals;
+                assert(ip < mflimitPlusOne);
+
+                if (dictDirective == usingDictCtx) {
+                    if (matchIndex < startIndex) {
+                        /* there was no match, try the dictionary */
+                        assert(tableType == byU32);
+                        matchIndex = LZ4_getIndexOnHash(h, dictCtx->hashTable, byU32);
+                        match = dictBase + matchIndex;
+                        matchIndex += dictDelta;   /* make dictCtx index comparable with current context */
+                        lowLimit = dictionary;
+                    } else {
+                        match = base + matchIndex;
+                        lowLimit = (const BYTE*)source;
+                    }
+                } else if (dictDirective == usingExtDict) {
+                    if (matchIndex < startIndex) {
+                        DEBUGLOG(7, "extDict candidate: matchIndex=%5u  <  startIndex=%5u", matchIndex, startIndex);
+                        assert(startIndex - matchIndex >= MINMATCH);
+                        assert(dictBase);
+                        match = dictBase + matchIndex;
+                        lowLimit = dictionary;
+                    } else {
+                        match = base + matchIndex;
+                        lowLimit = (const BYTE*)source;
+                    }
+                } else {   /* single continuous memory segment */
+                    match = base + matchIndex;
+                }
+                forwardH = LZ4_hashPosition(forwardIp, tableType);
+                LZ4_putIndexOnHash(current, h, cctx->hashTable, tableType);
+
+                DEBUGLOG(7, "candidate at pos=%u  (offset=%u \n", matchIndex, current - matchIndex);
+                if ((dictIssue == dictSmall) && (matchIndex < prefixIdxLimit)) { continue; }    /* match outside of valid area */
+                assert(matchIndex < current);
+                if ( ((tableType != byU16) || (LZ4_DISTANCE_MAX < LZ4_DISTANCE_ABSOLUTE_MAX))
+                  && (matchIndex+LZ4_DISTANCE_MAX < current)) {
+                    continue;
+                } /* too far */
+                assert((current - matchIndex) <= LZ4_DISTANCE_MAX);  /* match now expected within distance */
+
+                if (LZ4_read32(match) == LZ4_read32(ip)) {
+                    if (maybe_extMem) offset = current - matchIndex;
+                    break;   /* match found */
+                }
+
+            } while(1);
+        }
+
+        /* Catch up */
+        filledIp = ip;
+        while (((ip>anchor) & (match > lowLimit)) && (unlikely(ip[-1]==match[-1]))) { ip--; match--; }
+
+        /* Encode Literals */
+        {   unsigned const litLength = (unsigned)(ip - anchor);
+            token = op++;
+            if ((outputDirective == limitedOutput) &&  /* Check output buffer overflow */
+                (unlikely(op + litLength + (2 + 1 + LASTLITERALS) + (litLength/255) > olimit)) ) {
+                return 0;   /* cannot compress within `dst` budget. Stored indexes in hash table are nonetheless fine */
+            }
+            if ((outputDirective == fillOutput) &&
+                (unlikely(op + (litLength+240)/255 /* litlen */ + litLength /* literals */ + 2 /* offset */ + 1 /* token */ + MFLIMIT - MINMATCH /* min last literals so last match is <= end - MFLIMIT */ > olimit))) {
+                op--;
+                goto _last_literals;
+            }
+            if (litLength >= RUN_MASK) {
+                int len = (int)(litLength - RUN_MASK);
+                *token = (RUN_MASK<<ML_BITS);
+                for(; len >= 255 ; len-=255) *op++ = 255;
+                *op++ = (BYTE)len;
+            }
+            else *token = (BYTE)(litLength<<ML_BITS);
+
+            /* Copy Literals */
+            LZ4_wildCopy8(op, anchor, op+litLength);
+            op+=litLength;
+            DEBUGLOG(6, "seq.start:%i, literals=%u, match.start:%i",
+                        (int)(anchor-(const BYTE*)source), litLength, (int)(ip-(const BYTE*)source));
+        }
+
+_next_match:
+        /* at this stage, the following variables must be correctly set :
+         * - ip : at start of LZ operation
+         * - match : at start of previous pattern occurrence; can be within current prefix, or within extDict
+         * - offset : if maybe_ext_memSegment==1 (constant)
+         * - lowLimit : must be == dictionary to mean "match is within extDict"; must be == source otherwise
+         * - token and *token : position to write 4-bits for match length; higher 4-bits for literal length supposed already written
+         */
+
+        if ((outputDirective == fillOutput) &&
+            (op + 2 /* offset */ + 1 /* token */ + MFLIMIT - MINMATCH /* min last literals so last match is <= end - MFLIMIT */ > olimit)) {
+            /* the match was too close to the end, rewind and go to last literals */
+            op = token;
+            goto _last_literals;
+        }
+
+        /* Encode Offset */
+        if (maybe_extMem) {   /* static test */
+            DEBUGLOG(6, "             with offset=%u  (ext if > %i)", offset, (int)(ip - (const BYTE*)source));
+            assert(offset <= LZ4_DISTANCE_MAX && offset > 0);
+            LZ4_writeLE16(op, (U16)offset); op+=2;
+        } else  {
+            DEBUGLOG(6, "             with offset=%u  (same segment)", (U32)(ip - match));
+            assert(ip-match <= LZ4_DISTANCE_MAX);
+            LZ4_writeLE16(op, (U16)(ip - match)); op+=2;
+        }
+
+        /* Encode MatchLength */
+        {   unsigned matchCode;
+
+            if ( (dictDirective==usingExtDict || dictDirective==usingDictCtx)
+              && (lowLimit==dictionary) /* match within extDict */ ) {
+                const BYTE* limit = ip + (dictEnd-match);
+                assert(dictEnd > match);
+                if (limit > matchlimit) limit = matchlimit;
+                matchCode = LZ4_count(ip+MINMATCH, match+MINMATCH, limit);
+                ip += (size_t)matchCode + MINMATCH;
+                if (ip==limit) {
+                    unsigned const more = LZ4_count(limit, (const BYTE*)source, matchlimit);
+                    matchCode += more;
+                    ip += more;
+                }
+                DEBUGLOG(6, "             with matchLength=%u starting in extDict", matchCode+MINMATCH);
+            } else {
+                matchCode = LZ4_count(ip+MINMATCH, match+MINMATCH, matchlimit);
+                ip += (size_t)matchCode + MINMATCH;
+                DEBUGLOG(6, "             with matchLength=%u", matchCode+MINMATCH);
+            }
+
+            if ((outputDirective) &&    /* Check output buffer overflow */
+                (unlikely(op + (1 + LASTLITERALS) + (matchCode+240)/255 > olimit)) ) {
+                if (outputDirective == fillOutput) {
+                    /* Match description too long : reduce it */
+                    U32 newMatchCode = 15 /* in token */ - 1 /* to avoid needing a zero byte */ + ((U32)(olimit - op) - 1 - LASTLITERALS) * 255;
+                    ip -= matchCode - newMatchCode;
+                    assert(newMatchCode < matchCode);
+                    matchCode = newMatchCode;
+                    if (unlikely(ip <= filledIp)) {
+                        /* We have already filled up to filledIp so if ip ends up less than filledIp
+                         * we have positions in the hash table beyond the current position. This is
+                         * a problem if we reuse the hash table. So we have to remove these positions
+                         * from the hash table.
+                         */
+                        const BYTE* ptr;
+                        DEBUGLOG(5, "Clearing %u positions", (U32)(filledIp - ip));
+                        for (ptr = ip; ptr <= filledIp; ++ptr) {
+                            U32 const h = LZ4_hashPosition(ptr, tableType);
+                            LZ4_clearHash(h, cctx->hashTable, tableType);
+                        }
+                    }
+                } else {
+                    assert(outputDirective == limitedOutput);
+                    return 0;   /* cannot compress within `dst` budget. Stored indexes in hash table are nonetheless fine */
+                }
+            }
+            if (matchCode >= ML_MASK) {
+                *token += ML_MASK;
+                matchCode -= ML_MASK;
+                LZ4_write32(op, 0xFFFFFFFF);
+                while (matchCode >= 4*255) {
+                    op+=4;
+                    LZ4_write32(op, 0xFFFFFFFF);
+                    matchCode -= 4*255;
+                }
+                op += matchCode / 255;
+                *op++ = (BYTE)(matchCode % 255);
+            } else
+                *token += (BYTE)(matchCode);
+        }
+        /* Ensure we have enough space for the last literals. */
+        assert(!(outputDirective == fillOutput && op + 1 + LASTLITERALS > olimit));
+
+        anchor = ip;
+
+        /* Test end of chunk */
+        if (ip >= mflimitPlusOne) break;
+
+        /* Fill table */
+        LZ4_putPosition(ip-2, cctx->hashTable, tableType, base);
+
+        /* Test next position */
+        if (tableType == byPtr) {
+
+            match = LZ4_getPosition(ip, cctx->hashTable, tableType, base);
+            LZ4_putPosition(ip, cctx->hashTable, tableType, base);
+            if ( (match+LZ4_DISTANCE_MAX >= ip)
+              && (LZ4_read32(match) == LZ4_read32(ip)) )
+            { token=op++; *token=0; goto _next_match; }
+
+        } else {   /* byU32, byU16 */
+
+            U32 const h = LZ4_hashPosition(ip, tableType);
+            U32 const current = (U32)(ip-base);
+            U32 matchIndex = LZ4_getIndexOnHash(h, cctx->hashTable, tableType);
+            assert(matchIndex < current);
+            if (dictDirective == usingDictCtx) {
+                if (matchIndex < startIndex) {
+                    /* there was no match, try the dictionary */
+                    matchIndex = LZ4_getIndexOnHash(h, dictCtx->hashTable, byU32);
+                    match = dictBase + matchIndex;
+                    lowLimit = dictionary;   /* required for match length counter */
+                    matchIndex += dictDelta;
+                } else {
+                    match = base + matchIndex;
+                    lowLimit = (const BYTE*)source;  /* required for match length counter */
+                }
+            } else if (dictDirective==usingExtDict) {
+                if (matchIndex < startIndex) {
+                    assert(dictBase);
+                    match = dictBase + matchIndex;
+                    lowLimit = dictionary;   /* required for match length counter */
+                } else {
+                    match = base + matchIndex;
+                    lowLimit = (const BYTE*)source;   /* required for match length counter */
+                }
+            } else {   /* single memory segment */
+                match = base + matchIndex;
+            }
+            LZ4_putIndexOnHash(current, h, cctx->hashTable, tableType);
+            assert(matchIndex < current);
+            if ( ((dictIssue==dictSmall) ? (matchIndex >= prefixIdxLimit) : 1)
+              && (((tableType==byU16) && (LZ4_DISTANCE_MAX == LZ4_DISTANCE_ABSOLUTE_MAX)) ? 1 : (matchIndex+LZ4_DISTANCE_MAX >= current))
+              && (LZ4_read32(match) == LZ4_read32(ip)) ) {
+                token=op++;
+                *token=0;
+                if (maybe_extMem) offset = current - matchIndex;
+                DEBUGLOG(6, "seq.start:%i, literals=%u, match.start:%i",
+                            (int)(anchor-(const BYTE*)source), 0, (int)(ip-(const BYTE*)source));
+                goto _next_match;
+            }
+        }
+
+        /* Prepare next loop */
+        forwardH = LZ4_hashPosition(++ip, tableType);
+
+    }
+
+_last_literals:
+    /* Encode Last Literals */
+    {   size_t lastRun = (size_t)(iend - anchor);
+        if ( (outputDirective) &&  /* Check output buffer overflow */
+            (op + lastRun + 1 + ((lastRun+255-RUN_MASK)/255) > olimit)) {
+            if (outputDirective == fillOutput) {
+                /* adapt lastRun to fill 'dst' */
+                assert(olimit >= op);
+                lastRun  = (size_t)(olimit-op) - 1/*token*/;
+                lastRun -= (lastRun + 256 - RUN_MASK) / 256;  /*additional length tokens*/
+            } else {
+                assert(outputDirective == limitedOutput);
+                return 0;   /* cannot compress within `dst` budget. Stored indexes in hash table are nonetheless fine */
+            }
+        }
+        DEBUGLOG(6, "Final literal run : %i literals", (int)lastRun);
+        if (lastRun >= RUN_MASK) {
+            size_t accumulator = lastRun - RUN_MASK;
+            *op++ = RUN_MASK << ML_BITS;
+            for(; accumulator >= 255 ; accumulator-=255) *op++ = 255;
+            *op++ = (BYTE) accumulator;
+        } else {
+            *op++ = (BYTE)(lastRun<<ML_BITS);
+        }
+        LZ4_memcpy(op, anchor, lastRun);
+        ip = anchor + lastRun;
+        op += lastRun;
+    }
+
+    if (outputDirective == fillOutput) {
+        *inputConsumed = (int) (((const char*)ip)-source);
+    }
+    result = (int)(((char*)op) - dest);
+    assert(result > 0);
+    DEBUGLOG(5, "LZ4_compress_generic: compressed %i bytes into %i bytes", inputSize, result);
+    return result;
+}
+
+/** LZ4_compress_generic() :
+ *  inlined, to ensure branches are decided at compilation time;
+ *  takes care of src == (NULL, 0)
+ *  and forward the rest to LZ4_compress_generic_validated */
+LZ4_FORCE_INLINE int LZ4_compress_generic(
+                 LZ4_stream_t_internal* const cctx,
+                 const char* const src,
+                 char* const dst,
+                 const int srcSize,
+                 int *inputConsumed, /* only written when outputDirective == fillOutput */
+                 const int dstCapacity,
+                 const limitedOutput_directive outputDirective,
+                 const tableType_t tableType,
+                 const dict_directive dictDirective,
+                 const dictIssue_directive dictIssue,
+                 const int acceleration)
+{
+    DEBUGLOG(5, "LZ4_compress_generic: srcSize=%i, dstCapacity=%i",
+                srcSize, dstCapacity);
+
+    if ((U32)srcSize > (U32)LZ4_MAX_INPUT_SIZE) { return 0; }  /* Unsupported srcSize, too large (or negative) */
+    if (srcSize == 0) {   /* src == NULL supported if srcSize == 0 */
+        if (outputDirective != notLimited && dstCapacity <= 0) return 0;  /* no output, can't write anything */
+        DEBUGLOG(5, "Generating an empty block");
+        assert(outputDirective == notLimited || dstCapacity >= 1);
+        assert(dst != NULL);
+        dst[0] = 0;
+        if (outputDirective == fillOutput) {
+            assert (inputConsumed != NULL);
+            *inputConsumed = 0;
+        }
+        return 1;
+    }
+    assert(src != NULL);
+
+    return LZ4_compress_generic_validated(cctx, src, dst, srcSize,
+                inputConsumed, /* only written into if outputDirective == fillOutput */
+                dstCapacity, outputDirective,
+                tableType, dictDirective, dictIssue, acceleration);
+}
+
+
+int LZ4_compress_fast_extState(void* state, const char* source, char* dest, int inputSize, int maxOutputSize, int acceleration)
+{
+    LZ4_stream_t_internal* const ctx = & LZ4_initStream(state, sizeof(LZ4_stream_t)) -> internal_donotuse;
+    assert(ctx != NULL);
+    if (acceleration < 1) acceleration = LZ4_ACCELERATION_DEFAULT;
+    if (acceleration > LZ4_ACCELERATION_MAX) acceleration = LZ4_ACCELERATION_MAX;
+    if (maxOutputSize >= LZ4_compressBound(inputSize)) {
+        if (inputSize < LZ4_64Klimit) {
+            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, 0, notLimited, byU16, noDict, noDictIssue, acceleration);
+        } else {
+            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)source > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, 0, notLimited, tableType, noDict, noDictIssue, acceleration);
+        }
+    } else {
+        if (inputSize < LZ4_64Klimit) {
+            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, byU16, noDict, noDictIssue, acceleration);
+        } else {
+            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)source > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            return LZ4_compress_generic(ctx, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, noDict, noDictIssue, acceleration);
+        }
+    }
+}
+
+/**
+ * LZ4_compress_fast_extState_fastReset() :
+ * A variant of LZ4_compress_fast_extState().
+ *
+ * Using this variant avoids an expensive initialization step. It is only safe
+ * to call if the state buffer is known to be correctly initialized already
+ * (see comment in lz4.h on LZ4_resetStream_fast() for a definition of
+ * "correctly initialized").
+ */
+int LZ4_compress_fast_extState_fastReset(void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration)
+{
+    LZ4_stream_t_internal* ctx = &((LZ4_stream_t*)state)->internal_donotuse;
+    if (acceleration < 1) acceleration = LZ4_ACCELERATION_DEFAULT;
+    if (acceleration > LZ4_ACCELERATION_MAX) acceleration = LZ4_ACCELERATION_MAX;
+
+    if (dstCapacity >= LZ4_compressBound(srcSize)) {
+        if (srcSize < LZ4_64Klimit) {
+            const tableType_t tableType = byU16;
+            LZ4_prepareTable(ctx, srcSize, tableType);
+            if (ctx->currentOffset) {
+                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, 0, notLimited, tableType, noDict, dictSmall, acceleration);
+            } else {
+                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, 0, notLimited, tableType, noDict, noDictIssue, acceleration);
+            }
+        } else {
+            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)src > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            LZ4_prepareTable(ctx, srcSize, tableType);
+            return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, 0, notLimited, tableType, noDict, noDictIssue, acceleration);
+        }
+    } else {
+        if (srcSize < LZ4_64Klimit) {
+            const tableType_t tableType = byU16;
+            LZ4_prepareTable(ctx, srcSize, tableType);
+            if (ctx->currentOffset) {
+                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, dstCapacity, limitedOutput, tableType, noDict, dictSmall, acceleration);
+            } else {
+                return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, dstCapacity, limitedOutput, tableType, noDict, noDictIssue, acceleration);
+            }
+        } else {
+            const tableType_t tableType = ((sizeof(void*)==4) && ((uptrval)src > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            LZ4_prepareTable(ctx, srcSize, tableType);
+            return LZ4_compress_generic(ctx, src, dst, srcSize, NULL, dstCapacity, limitedOutput, tableType, noDict, noDictIssue, acceleration);
+        }
+    }
+}
+
+
+int LZ4_compress_fast(const char* source, char* dest, int inputSize, int maxOutputSize, int acceleration)
+{
+    int result;
+#if (LZ4_HEAPMODE)
+    LZ4_stream_t* ctxPtr = (LZ4_stream_t*)ALLOC(sizeof(LZ4_stream_t));   /* malloc-calloc always properly aligned */
+    if (ctxPtr == NULL) return 0;
+#else
+    LZ4_stream_t ctx;
+    LZ4_stream_t* const ctxPtr = &ctx;
+#endif
+    result = LZ4_compress_fast_extState(ctxPtr, source, dest, inputSize, maxOutputSize, acceleration);
+
+#if (LZ4_HEAPMODE)
+    FREEMEM(ctxPtr);
+#endif
+    return result;
+}
+
+
+int LZ4_compress_default(const char* src, char* dst, int srcSize, int maxOutputSize)
+{
+    return LZ4_compress_fast(src, dst, srcSize, maxOutputSize, 1);
+}
+
+
+/* Note!: This function leaves the stream in an unclean/broken state!
+ * It is not safe to subsequently use the same state with a _fastReset() or
+ * _continue() call without resetting it. */
+static int LZ4_compress_destSize_extState (LZ4_stream_t* state, const char* src, char* dst, int* srcSizePtr, int targetDstSize)
+{
+    void* const s = LZ4_initStream(state, sizeof (*state));
+    assert(s != NULL); (void)s;
+
+    if (targetDstSize >= LZ4_compressBound(*srcSizePtr)) {  /* compression success is guaranteed */
+        return LZ4_compress_fast_extState(state, src, dst, *srcSizePtr, targetDstSize, 1);
+    } else {
+        if (*srcSizePtr < LZ4_64Klimit) {
+            return LZ4_compress_generic(&state->internal_donotuse, src, dst, *srcSizePtr, srcSizePtr, targetDstSize, fillOutput, byU16, noDict, noDictIssue, 1);
+        } else {
+            tableType_t const addrMode = ((sizeof(void*)==4) && ((uptrval)src > LZ4_DISTANCE_MAX)) ? byPtr : byU32;
+            return LZ4_compress_generic(&state->internal_donotuse, src, dst, *srcSizePtr, srcSizePtr, targetDstSize, fillOutput, addrMode, noDict, noDictIssue, 1);
+    }   }
+}
+
+
+int LZ4_compress_destSize(const char* src, char* dst, int* srcSizePtr, int targetDstSize)
+{
+#if (LZ4_HEAPMODE)
+    LZ4_stream_t* ctx = (LZ4_stream_t*)ALLOC(sizeof(LZ4_stream_t));   /* malloc-calloc always properly aligned */
+    if (ctx == NULL) return 0;
+#else
+    LZ4_stream_t ctxBody;
+    LZ4_stream_t* ctx = &ctxBody;
+#endif
+
+    int result = LZ4_compress_destSize_extState(ctx, src, dst, srcSizePtr, targetDstSize);
+
+#if (LZ4_HEAPMODE)
+    FREEMEM(ctx);
+#endif
+    return result;
+}
+
+
+
+/*-******************************
+*  Streaming functions
+********************************/
+
+#if !defined(LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION)
+LZ4_stream_t* LZ4_createStream(void)
+{
+    LZ4_stream_t* const lz4s = (LZ4_stream_t*)ALLOC(sizeof(LZ4_stream_t));
+    LZ4_STATIC_ASSERT(sizeof(LZ4_stream_t) >= sizeof(LZ4_stream_t_internal));
+    DEBUGLOG(4, "LZ4_createStream %p", lz4s);
+    if (lz4s == NULL) return NULL;
+    LZ4_initStream(lz4s, sizeof(*lz4s));
+    return lz4s;
+}
+#endif
+
+static size_t LZ4_stream_t_alignment(void)
+{
+#if LZ4_ALIGN_TEST
+    typedef struct { char c; LZ4_stream_t t; } t_a;
+    return sizeof(t_a) - sizeof(LZ4_stream_t);
+#else
+    return 1;  /* effectively disabled */
+#endif
+}
+
+LZ4_stream_t* LZ4_initStream (void* buffer, size_t size)
+{
+    DEBUGLOG(5, "LZ4_initStream");
+    if (buffer == NULL) { return NULL; }
+    if (size < sizeof(LZ4_stream_t)) { return NULL; }
+    if (!LZ4_isAligned(buffer, LZ4_stream_t_alignment())) return NULL;
+    MEM_INIT(buffer, 0, sizeof(LZ4_stream_t_internal));
+    return (LZ4_stream_t*)buffer;
+}
+
+/* resetStream is now deprecated,
+ * prefer initStream() which is more general */
+void LZ4_resetStream (LZ4_stream_t* LZ4_stream)
+{
+    DEBUGLOG(5, "LZ4_resetStream (ctx:%p)", LZ4_stream);
+    MEM_INIT(LZ4_stream, 0, sizeof(LZ4_stream_t_internal));
+}
+
+void LZ4_resetStream_fast(LZ4_stream_t* ctx) {
+    LZ4_prepareTable(&(ctx->internal_donotuse), 0, byU32);
+}
+
+#if !defined(LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION)
+int LZ4_freeStream (LZ4_stream_t* LZ4_stream)
+{
+    if (!LZ4_stream) return 0;   /* support free on NULL */
+    DEBUGLOG(5, "LZ4_freeStream %p", LZ4_stream);
+    FREEMEM(LZ4_stream);
+    return (0);
+}
+#endif
+
+
+#define HASH_UNIT sizeof(reg_t)
+int LZ4_loadDict (LZ4_stream_t* LZ4_dict, const char* dictionary, int dictSize)
+{
+    LZ4_stream_t_internal* dict = &LZ4_dict->internal_donotuse;
+    const tableType_t tableType = byU32;
+    const BYTE* p = (const BYTE*)dictionary;
+    const BYTE* const dictEnd = p + dictSize;
+    const BYTE* base;
+
+    DEBUGLOG(4, "LZ4_loadDict (%i bytes from %p into %p)", dictSize, dictionary, LZ4_dict);
+
+    /* It's necessary to reset the context,
+     * and not just continue it with prepareTable()
+     * to avoid any risk of generating overflowing matchIndex
+     * when compressing using this dictionary */
+    LZ4_resetStream(LZ4_dict);
+
+    /* We always increment the offset by 64 KB, since, if the dict is longer,
+     * we truncate it to the last 64k, and if it's shorter, we still want to
+     * advance by a whole window length so we can provide the guarantee that
+     * there are only valid offsets in the window, which allows an optimization
+     * in LZ4_compress_fast_continue() where it uses noDictIssue even when the
+     * dictionary isn't a full 64k. */
+    dict->currentOffset += 64 KB;
+
+    if (dictSize < (int)HASH_UNIT) {
+        return 0;
+    }
+
+    if ((dictEnd - p) > 64 KB) p = dictEnd - 64 KB;
+    base = dictEnd - dict->currentOffset;
+    dict->dictionary = p;
+    dict->dictSize = (U32)(dictEnd - p);
+    dict->tableType = (U32)tableType;
+
+    while (p <= dictEnd-HASH_UNIT) {
+        LZ4_putPosition(p, dict->hashTable, tableType, base);
+        p+=3;
+    }
+
+    return (int)dict->dictSize;
+}
+
+void LZ4_attach_dictionary(LZ4_stream_t* workingStream, const LZ4_stream_t* dictionaryStream)
+{
+    const LZ4_stream_t_internal* dictCtx = (dictionaryStream == NULL) ? NULL :
+        &(dictionaryStream->internal_donotuse);
+
+    DEBUGLOG(4, "LZ4_attach_dictionary (%p, %p, size %u)",
+             workingStream, dictionaryStream,
+             dictCtx != NULL ? dictCtx->dictSize : 0);
+
+    if (dictCtx != NULL) {
+        /* If the current offset is zero, we will never look in the
+         * external dictionary context, since there is no value a table
+         * entry can take that indicate a miss. In that case, we need
+         * to bump the offset to something non-zero.
+         */
+        if (workingStream->internal_donotuse.currentOffset == 0) {
+            workingStream->internal_donotuse.currentOffset = 64 KB;
+        }
+
+        /* Don't actually attach an empty dictionary.
+         */
+        if (dictCtx->dictSize == 0) {
+            dictCtx = NULL;
+        }
+    }
+    workingStream->internal_donotuse.dictCtx = dictCtx;
+}
+
+
+static void LZ4_renormDictT(LZ4_stream_t_internal* LZ4_dict, int nextSize)
+{
+    assert(nextSize >= 0);
+    if (LZ4_dict->currentOffset + (unsigned)nextSize > 0x80000000) {   /* potential ptrdiff_t overflow (32-bits mode) */
+        /* rescale hash table */
+        U32 const delta = LZ4_dict->currentOffset - 64 KB;
+        const BYTE* dictEnd = LZ4_dict->dictionary + LZ4_dict->dictSize;
+        int i;
+        DEBUGLOG(4, "LZ4_renormDictT");
+        for (i=0; i<LZ4_HASH_SIZE_U32; i++) {
+            if (LZ4_dict->hashTable[i] < delta) LZ4_dict->hashTable[i]=0;
+            else LZ4_dict->hashTable[i] -= delta;
+        }
+        LZ4_dict->currentOffset = 64 KB;
+        if (LZ4_dict->dictSize > 64 KB) LZ4_dict->dictSize = 64 KB;
+        LZ4_dict->dictionary = dictEnd - LZ4_dict->dictSize;
+    }
+}
+
+
+int LZ4_compress_fast_continue (LZ4_stream_t* LZ4_stream,
+                                const char* source, char* dest,
+                                int inputSize, int maxOutputSize,
+                                int acceleration)
+{
+    const tableType_t tableType = byU32;
+    LZ4_stream_t_internal* const streamPtr = &LZ4_stream->internal_donotuse;
+    const char* dictEnd = streamPtr->dictSize ? (const char*)streamPtr->dictionary + streamPtr->dictSize : NULL;
+
+    DEBUGLOG(5, "LZ4_compress_fast_continue (inputSize=%i, dictSize=%u)", inputSize, streamPtr->dictSize);
+
+    LZ4_renormDictT(streamPtr, inputSize);   /* fix index overflow */
+    if (acceleration < 1) acceleration = LZ4_ACCELERATION_DEFAULT;
+    if (acceleration > LZ4_ACCELERATION_MAX) acceleration = LZ4_ACCELERATION_MAX;
+
+    /* invalidate tiny dictionaries */
+    if ( (streamPtr->dictSize < 4)     /* tiny dictionary : not enough for a hash */
+      && (dictEnd != source)           /* prefix mode */
+      && (inputSize > 0)               /* tolerance : don't lose history, in case next invocation would use prefix mode */
+      && (streamPtr->dictCtx == NULL)  /* usingDictCtx */
+      ) {
+        DEBUGLOG(5, "LZ4_compress_fast_continue: dictSize(%u) at addr:%p is too small", streamPtr->dictSize, streamPtr->dictionary);
+        /* remove dictionary existence from history, to employ faster prefix mode */
+        streamPtr->dictSize = 0;
+        streamPtr->dictionary = (const BYTE*)source;
+        dictEnd = source;
+    }
+
+    /* Check overlapping input/dictionary space */
+    {   const char* const sourceEnd = source + inputSize;
+        if ((sourceEnd > (const char*)streamPtr->dictionary) && (sourceEnd < dictEnd)) {
+            streamPtr->dictSize = (U32)(dictEnd - sourceEnd);
+            if (streamPtr->dictSize > 64 KB) streamPtr->dictSize = 64 KB;
+            if (streamPtr->dictSize < 4) streamPtr->dictSize = 0;
+            streamPtr->dictionary = (const BYTE*)dictEnd - streamPtr->dictSize;
+        }
+    }
+
+    /* prefix mode : source data follows dictionary */
+    if (dictEnd == source) {
+        if ((streamPtr->dictSize < 64 KB) && (streamPtr->dictSize < streamPtr->currentOffset))
+            return LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, withPrefix64k, dictSmall, acceleration);
+        else
+            return LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, withPrefix64k, noDictIssue, acceleration);
+    }
+
+    /* external dictionary mode */
+    {   int result;
+        if (streamPtr->dictCtx) {
+            /* We depend here on the fact that dictCtx'es (produced by
+             * LZ4_loadDict) guarantee that their tables contain no references
+             * to offsets between dictCtx->currentOffset - 64 KB and
+             * dictCtx->currentOffset - dictCtx->dictSize. This makes it safe
+             * to use noDictIssue even when the dict isn't a full 64 KB.
+             */
+            if (inputSize > 4 KB) {
+                /* For compressing large blobs, it is faster to pay the setup
+                 * cost to copy the dictionary's tables into the active context,
+                 * so that the compression loop is only looking into one table.
+                 */
+                LZ4_memcpy(streamPtr, streamPtr->dictCtx, sizeof(*streamPtr));
+                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingExtDict, noDictIssue, acceleration);
+            } else {
+                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingDictCtx, noDictIssue, acceleration);
+            }
+        } else {  /* small data <= 4 KB */
+            if ((streamPtr->dictSize < 64 KB) && (streamPtr->dictSize < streamPtr->currentOffset)) {
+                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingExtDict, dictSmall, acceleration);
+            } else {
+                result = LZ4_compress_generic(streamPtr, source, dest, inputSize, NULL, maxOutputSize, limitedOutput, tableType, usingExtDict, noDictIssue, acceleration);
+            }
+        }
+        streamPtr->dictionary = (const BYTE*)source;
+        streamPtr->dictSize = (U32)inputSize;
+        return result;
+    }
+}
+
+
+/* Hidden debug function, to force-test external dictionary mode */
+int LZ4_compress_forceExtDict (LZ4_stream_t* LZ4_dict, const char* source, char* dest, int srcSize)
+{
+    LZ4_stream_t_internal* streamPtr = &LZ4_dict->internal_donotuse;
+    int result;
+
+    LZ4_renormDictT(streamPtr, srcSize);
+
+    if ((streamPtr->dictSize < 64 KB) && (streamPtr->dictSize < streamPtr->currentOffset)) {
+        result = LZ4_compress_generic(streamPtr, source, dest, srcSize, NULL, 0, notLimited, byU32, usingExtDict, dictSmall, 1);
+    } else {
+        result = LZ4_compress_generic(streamPtr, source, dest, srcSize, NULL, 0, notLimited, byU32, usingExtDict, noDictIssue, 1);
+    }
+
+    streamPtr->dictionary = (const BYTE*)source;
+    streamPtr->dictSize = (U32)srcSize;
+
+    return result;
+}
+
+
+/*! LZ4_saveDict() :
+ *  If previously compressed data block is not guaranteed to remain available at its memory location,
+ *  save it into a safer place (char* safeBuffer).
+ *  Note : no need to call LZ4_loadDict() afterwards, dictionary is immediately usable,
+ *         one can therefore call LZ4_compress_fast_continue() right after.
+ * @return : saved dictionary size in bytes (necessarily <= dictSize), or 0 if error.
+ */
+int LZ4_saveDict (LZ4_stream_t* LZ4_dict, char* safeBuffer, int dictSize)
+{
+    LZ4_stream_t_internal* const dict = &LZ4_dict->internal_donotuse;
+
+    DEBUGLOG(5, "LZ4_saveDict : dictSize=%i, safeBuffer=%p", dictSize, safeBuffer);
+
+    if ((U32)dictSize > 64 KB) { dictSize = 64 KB; } /* useless to define a dictionary > 64 KB */
+    if ((U32)dictSize > dict->dictSize) { dictSize = (int)dict->dictSize; }
+
+    if (safeBuffer == NULL) assert(dictSize == 0);
+    if (dictSize > 0) {
+        const BYTE* const previousDictEnd = dict->dictionary + dict->dictSize;
+        assert(dict->dictionary);
+        LZ4_memmove(safeBuffer, previousDictEnd - dictSize, (size_t)dictSize);
+    }
+
+    dict->dictionary = (const BYTE*)safeBuffer;
+    dict->dictSize = (U32)dictSize;
+
+    return dictSize;
+}
+
+
+
+/*-*******************************
+ *  Decompression functions
+ ********************************/
+
+typedef enum { decode_full_block = 0, partial_decode = 1 } earlyEnd_directive;
+
+#undef MIN
+#define MIN(a,b)    ( (a) < (b) ? (a) : (b) )
+
+
+/* variant for decompress_unsafe()
+ * does not know end of input
+ * presumes input is well formed
+ * note : will consume at least one byte */
+size_t read_long_length_no_check(const BYTE** pp)
+{
+    size_t b, l = 0;
+    do { b = **pp; (*pp)++; l += b; } while (b==255);
+    DEBUGLOG(6, "read_long_length_no_check: +length=%zu using %zu input bytes", l, l/255 + 1)
+    return l;
+}
+
+/* core decoder variant for LZ4_decompress_fast*()
+ * for legacy support only : these entry points are deprecated.
+ * - Presumes input is correctly formed (no defense vs malformed inputs)
+ * - Does not know input size (presume input buffer is "large enough")
+ * - Decompress a full block (only)
+ * @return : nb of bytes read from input.
+ * Note : this variant is not optimized for speed, just for maintenance.
+ *        the goal is to remove support of decompress_fast*() variants by v2.0
+**/
+LZ4_FORCE_INLINE int
+LZ4_decompress_unsafe_generic(
+                 const BYTE* const istart,
+                 BYTE* const ostart,
+                 int decompressedSize,
+
+                 size_t prefixSize,
+                 const BYTE* const dictStart,  /* only if dict==usingExtDict */
+                 const size_t dictSize         /* note: =0 if dictStart==NULL */
+                 )
+{
+    const BYTE* ip = istart;
+    BYTE* op = (BYTE*)ostart;
+    BYTE* const oend = ostart + decompressedSize;
+    const BYTE* const prefixStart = ostart - prefixSize;
+
+    DEBUGLOG(5, "LZ4_decompress_unsafe_generic");
+    if (dictStart == NULL) assert(dictSize == 0);
+
+    while (1) {
+        /* start new sequence */
+        unsigned token = *ip++;
+
+        /* literals */
+        {   size_t ll = token >> ML_BITS;
+            if (ll==15) {
+                /* long literal length */
+                ll += read_long_length_no_check(&ip);
+            }
+            if ((size_t)(oend-op) < ll) return -1; /* output buffer overflow */
+            LZ4_memmove(op, ip, ll); /* support in-place decompression */
+            op += ll;
+            ip += ll;
+            if ((size_t)(oend-op) < MFLIMIT) {
+                if (op==oend) break;  /* end of block */
+                DEBUGLOG(5, "invalid: literals end at distance %zi from end of block", oend-op);
+                /* incorrect end of block :
+                 * last match must start at least MFLIMIT==12 bytes before end of output block */
+                return -1;
+        }   }
+
+        /* match */
+        {   size_t ml = token & 15;
+            size_t const offset = LZ4_readLE16(ip);
+            ip+=2;
+
+            if (ml==15) {
+                /* long literal length */
+                ml += read_long_length_no_check(&ip);
+            }
+            ml += MINMATCH;
+
+            if ((size_t)(oend-op) < ml) return -1; /* output buffer overflow */
+
+            {   const BYTE* match = op - offset;
+
+                /* out of range */
+                if (offset > (size_t)(op - prefixStart) + dictSize) {
+                    DEBUGLOG(6, "offset out of range");
+                    return -1;
+                }
+
+                /* check special case : extDict */
+                if (offset > (size_t)(op - prefixStart)) {
+                    /* extDict scenario */
+                    const BYTE* const dictEnd = dictStart + dictSize;
+                    const BYTE* extMatch = dictEnd - (offset - (size_t)(op-prefixStart));
+                    size_t const extml = (size_t)(dictEnd - extMatch);
+                    if (extml > ml) {
+                        /* match entirely within extDict */
+                        LZ4_memmove(op, extMatch, ml);
+                        op += ml;
+                        ml = 0;
+                    } else {
+                        /* match split between extDict & prefix */
+                        LZ4_memmove(op, extMatch, extml);
+                        op += extml;
+                        ml -= extml;
+                    }
+                    match = prefixStart;
+                }
+
+                /* match copy - slow variant, supporting overlap copy */
+                {   size_t u;
+                    for (u=0; u<ml; u++) {
+                        op[u] = match[u];
+            }   }   }
+            op += ml;
+            if ((size_t)(oend-op) < LASTLITERALS) {
+                DEBUGLOG(5, "invalid: match ends at distance %zi from end of block", oend-op);
+                /* incorrect end of block :
+                 * last match must stop at least LASTLITERALS==5 bytes before end of output block */
+                return -1;
+            }
+        } /* match */
+    } /* main loop */
+    return (int)(ip - istart);
+}
+
+
+/* Read the variable-length literal or match length.
+ *
+ * @ip : input pointer
+ * @ilimit : position after which if length is not decoded, the input is necessarily corrupted.
+ * @initial_check - check ip >= ipmax before start of loop.  Returns initial_error if so.
+ * @error (output) - error code.  Must be set to 0 before call.
+**/
+typedef size_t Rvl_t;
+static const Rvl_t rvl_error = (Rvl_t)(-1);
+LZ4_FORCE_INLINE Rvl_t
+read_variable_length(const BYTE** ip, const BYTE* ilimit,
+                     int initial_check)
+{
+    Rvl_t s, length = 0;
+    assert(ip != NULL);
+    assert(*ip !=  NULL);
+    assert(ilimit != NULL);
+    if (initial_check && unlikely((*ip) >= ilimit)) {    /* read limit reached */
+        return rvl_error;
+    }
+    do {
+        s = **ip;
+        (*ip)++;
+        length += s;
+        if (unlikely((*ip) > ilimit)) {    /* read limit reached */
+            return rvl_error;
+        }
+        /* accumulator overflow detection (32-bit mode only) */
+        if ((sizeof(length)<8) && unlikely(length > ((Rvl_t)(-1)/2)) ) {
+            return rvl_error;
+        }
+    } while (s==255);
+
+    return length;
+}
+
+/*! LZ4_decompress_generic() :
+ *  This generic decompression function covers all use cases.
+ *  It shall be instantiated several times, using different sets of directives.
+ *  Note that it is important for performance that this function really get inlined,
+ *  in order to remove useless branches during compilation optimization.
+ */
+LZ4_FORCE_INLINE int
+LZ4_decompress_generic(
+                 const char* const src,
+                 char* const dst,
+                 int srcSize,
+                 int outputSize,         /* If endOnInput==endOnInputSize, this value is `dstCapacity` */
+
+                 earlyEnd_directive partialDecoding,  /* full, partial */
+                 dict_directive dict,                 /* noDict, withPrefix64k, usingExtDict */
+                 const BYTE* const lowPrefix,  /* always <= dst, == dst when no prefix */
+                 const BYTE* const dictStart,  /* only if dict==usingExtDict */
+                 const size_t dictSize         /* note : = 0 if noDict */
+                 )
+{
+    if ((src == NULL) || (outputSize < 0)) { return -1; }
+
+    {   const BYTE* ip = (const BYTE*) src;
+        const BYTE* const iend = ip + srcSize;
+
+        BYTE* op = (BYTE*) dst;
+        BYTE* const oend = op + outputSize;
+        BYTE* cpy;
+
+        const BYTE* const dictEnd = (dictStart == NULL) ? NULL : dictStart + dictSize;
+
+        const int checkOffset = (dictSize < (int)(64 KB));
+
+
+        /* Set up the "end" pointers for the shortcut. */
+        const BYTE* const shortiend = iend - 14 /*maxLL*/ - 2 /*offset*/;
+        const BYTE* const shortoend = oend - 14 /*maxLL*/ - 18 /*maxML*/;
+
+        const BYTE* match;
+        size_t offset;
+        unsigned token;
+        size_t length;
+
+
+        DEBUGLOG(5, "LZ4_decompress_generic (srcSize:%i, dstSize:%i)", srcSize, outputSize);
+
+        /* Special cases */
+        assert(lowPrefix <= op);
+        if (unlikely(outputSize==0)) {
+            /* Empty output buffer */
+            if (partialDecoding) return 0;
+            return ((srcSize==1) && (*ip==0)) ? 0 : -1;
+        }
+        if (unlikely(srcSize==0)) { return -1; }
+
+    /* LZ4_FAST_DEC_LOOP:
+     * designed for modern OoO performance cpus,
+     * where copying reliably 32-bytes is preferable to an unpredictable branch.
+     * note : fast loop may show a regression for some client arm chips. */
+#if LZ4_FAST_DEC_LOOP
+        if ((oend - op) < FASTLOOP_SAFE_DISTANCE) {
+            DEBUGLOG(6, "skip fast decode loop");
+            goto safe_decode;
+        }
+
+        /* Fast loop : decode sequences as long as output < oend-FASTLOOP_SAFE_DISTANCE */
+        while (1) {
+            /* Main fastloop assertion: We can always wildcopy FASTLOOP_SAFE_DISTANCE */
+            assert(oend - op >= FASTLOOP_SAFE_DISTANCE);
+            assert(ip < iend);
+            token = *ip++;
+            length = token >> ML_BITS;  /* literal length */
+
+            /* decode literal length */
+            if (length == RUN_MASK) {
+                size_t const addl = read_variable_length(&ip, iend-RUN_MASK, 1);
+                if (addl == rvl_error) { goto _output_error; }
+                length += addl;
+                if (unlikely((uptrval)(op)+length<(uptrval)(op))) { goto _output_error; } /* overflow detection */
+                if (unlikely((uptrval)(ip)+length<(uptrval)(ip))) { goto _output_error; } /* overflow detection */
+
+                /* copy literals */
+                cpy = op+length;
+                LZ4_STATIC_ASSERT(MFLIMIT >= WILDCOPYLENGTH);
+                if ((cpy>oend-32) || (ip+length>iend-32)) { goto safe_literal_copy; }
+                LZ4_wildCopy32(op, ip, cpy);
+                ip += length; op = cpy;
+            } else {
+                cpy = op+length;
+                DEBUGLOG(7, "copy %u bytes in a 16-bytes stripe", (unsigned)length);
+                /* We don't need to check oend, since we check it once for each loop below */
+                if (ip > iend-(16 + 1/*max lit + offset + nextToken*/)) { goto safe_literal_copy; }
+                /* Literals can only be <= 14, but hope compilers optimize better when copy by a register size */
+                LZ4_memcpy(op, ip, 16);
+                ip += length; op = cpy;
+            }
+
+            /* get offset */
+            offset = LZ4_readLE16(ip); ip+=2;
+            match = op - offset;
+            assert(match <= op);  /* overflow check */
+
+            /* get matchlength */
+            length = token & ML_MASK;
+
+            if (length == ML_MASK) {
+                size_t const addl = read_variable_length(&ip, iend - LASTLITERALS + 1, 0);
+                if (addl == rvl_error) { goto _output_error; }
+                length += addl;
+                length += MINMATCH;
+                if (unlikely((uptrval)(op)+length<(uptrval)op)) { goto _output_error; } /* overflow detection */
+                if ((checkOffset) && (unlikely(match + dictSize < lowPrefix))) { goto _output_error; } /* Error : offset outside buffers */
+                if (op + length >= oend - FASTLOOP_SAFE_DISTANCE) {
+                    goto safe_match_copy;
+                }
+            } else {
+                length += MINMATCH;
+                if (op + length >= oend - FASTLOOP_SAFE_DISTANCE) {
+                    goto safe_match_copy;
+                }
+
+                /* Fastpath check: skip LZ4_wildCopy32 when true */
+                if ((dict == withPrefix64k) || (match >= lowPrefix)) {
+                    if (offset >= 8) {
+                        assert(match >= lowPrefix);
+                        assert(match <= op);
+                        assert(op + 18 <= oend);
+
+                        LZ4_memcpy(op, match, 8);
+                        LZ4_memcpy(op+8, match+8, 8);
+                        LZ4_memcpy(op+16, match+16, 2);
+                        op += length;
+                        continue;
+            }   }   }
+
+            if (checkOffset && (unlikely(match + dictSize < lowPrefix))) { goto _output_error; } /* Error : offset outside buffers */
+            /* match starting within external dictionary */
+            if ((dict==usingExtDict) && (match < lowPrefix)) {
+                assert(dictEnd != NULL);
+                if (unlikely(op+length > oend-LASTLITERALS)) {
+                    if (partialDecoding) {
+                        DEBUGLOG(7, "partialDecoding: dictionary match, close to dstEnd");
+                        length = MIN(length, (size_t)(oend-op));
+                    } else {
+                        goto _output_error;  /* end-of-block condition violated */
+                }   }
+
+                if (length <= (size_t)(lowPrefix-match)) {
+                    /* match fits entirely within external dictionary : just copy */
+                    LZ4_memmove(op, dictEnd - (lowPrefix-match), length);
+                    op += length;
+                } else {
+                    /* match stretches into both external dictionary and current block */
+                    size_t const copySize = (size_t)(lowPrefix - match);
+                    size_t const restSize = length - copySize;
+                    LZ4_memcpy(op, dictEnd - copySize, copySize);
+                    op += copySize;
+                    if (restSize > (size_t)(op - lowPrefix)) {  /* overlap copy */
+                        BYTE* const endOfMatch = op + restSize;
+                        const BYTE* copyFrom = lowPrefix;
+                        while (op < endOfMatch) { *op++ = *copyFrom++; }
+                    } else {
+                        LZ4_memcpy(op, lowPrefix, restSize);
+                        op += restSize;
+                }   }
+                continue;
+            }
+
+            /* copy match within block */
+            cpy = op + length;
+
+            assert((op <= oend) && (oend-op >= 32));
+            if (unlikely(offset<16)) {
+                LZ4_memcpy_using_offset(op, match, cpy, offset);
+            } else {
+                LZ4_wildCopy32(op, match, cpy);
+            }
+
+            op = cpy;   /* wildcopy correction */
+        }
+    safe_decode:
+#endif
+
+        /* Main Loop : decode remaining sequences where output < FASTLOOP_SAFE_DISTANCE */
+        while (1) {
+            assert(ip < iend);
+            token = *ip++;
+            length = token >> ML_BITS;  /* literal length */
+
+            /* A two-stage shortcut for the most common case:
+             * 1) If the literal length is 0..14, and there is enough space,
+             * enter the shortcut and copy 16 bytes on behalf of the literals
+             * (in the fast mode, only 8 bytes can be safely copied this way).
+             * 2) Further if the match length is 4..18, copy 18 bytes in a similar
+             * manner; but we ensure that there's enough space in the output for
+             * those 18 bytes earlier, upon entering the shortcut (in other words,
+             * there is a combined check for both stages).
+             */
+            if ( (length != RUN_MASK)
+                /* strictly "less than" on input, to re-enter the loop with at least one byte */
+              && likely((ip < shortiend) & (op <= shortoend)) ) {
+                /* Copy the literals */
+                LZ4_memcpy(op, ip, 16);
+                op += length; ip += length;
+
+                /* The second stage: prepare for match copying, decode full info.
+                 * If it doesn't work out, the info won't be wasted. */
+                length = token & ML_MASK; /* match length */
+                offset = LZ4_readLE16(ip); ip += 2;
+                match = op - offset;
+                assert(match <= op); /* check overflow */
+
+                /* Do not deal with overlapping matches. */
+                if ( (length != ML_MASK)
+                  && (offset >= 8)
+                  && (dict==withPrefix64k || match >= lowPrefix) ) {
+                    /* Copy the match. */
+                    LZ4_memcpy(op + 0, match + 0, 8);
+                    LZ4_memcpy(op + 8, match + 8, 8);
+                    LZ4_memcpy(op +16, match +16, 2);
+                    op += length + MINMATCH;
+                    /* Both stages worked, load the next token. */
+                    continue;
+                }
+
+                /* The second stage didn't work out, but the info is ready.
+                 * Propel it right to the point of match copying. */
+                goto _copy_match;
+            }
+
+            /* decode literal length */
+            if (length == RUN_MASK) {
+                size_t const addl = read_variable_length(&ip, iend-RUN_MASK, 1);
+                if (addl == rvl_error) { goto _output_error; }
+                length += addl;
+                if (unlikely((uptrval)(op)+length<(uptrval)(op))) { goto _output_error; } /* overflow detection */
+                if (unlikely((uptrval)(ip)+length<(uptrval)(ip))) { goto _output_error; } /* overflow detection */
+            }
+
+            /* copy literals */
+            cpy = op+length;
+#if LZ4_FAST_DEC_LOOP
+        safe_literal_copy:
+#endif
+            LZ4_STATIC_ASSERT(MFLIMIT >= WILDCOPYLENGTH);
+            if ((cpy>oend-MFLIMIT) || (ip+length>iend-(2+1+LASTLITERALS))) {
+                /* We've either hit the input parsing restriction or the output parsing restriction.
+                 * In the normal scenario, decoding a full block, it must be the last sequence,
+                 * otherwise it's an error (invalid input or dimensions).
+                 * In partialDecoding scenario, it's necessary to ensure there is no buffer overflow.
+                 */
+                if (partialDecoding) {
+                    /* Since we are partial decoding we may be in this block because of the output parsing
+                     * restriction, which is not valid since the output buffer is allowed to be undersized.
+                     */
+                    DEBUGLOG(7, "partialDecoding: copying literals, close to input or output end")
+                    DEBUGLOG(7, "partialDecoding: literal length = %u", (unsigned)length);
+                    DEBUGLOG(7, "partialDecoding: remaining space in dstBuffer : %i", (int)(oend - op));
+                    DEBUGLOG(7, "partialDecoding: remaining space in srcBuffer : %i", (int)(iend - ip));
+                    /* Finishing in the middle of a literals segment,
+                     * due to lack of input.
+                     */
+                    if (ip+length > iend) {
+                        length = (size_t)(iend-ip);
+                        cpy = op + length;
+                    }
+                    /* Finishing in the middle of a literals segment,
+                     * due to lack of output space.
+                     */
+                    if (cpy > oend) {
+                        cpy = oend;
+                        assert(op<=oend);
+                        length = (size_t)(oend-op);
+                    }
+                } else {
+                     /* We must be on the last sequence (or invalid) because of the parsing limitations
+                      * so check that we exactly consume the input and don't overrun the output buffer.
+                      */
+                    if ((ip+length != iend) || (cpy > oend)) {
+                        DEBUGLOG(6, "should have been last run of literals")
+                        DEBUGLOG(6, "ip(%p) + length(%i) = %p != iend (%p)", ip, (int)length, ip+length, iend);
+                        DEBUGLOG(6, "or cpy(%p) > oend(%p)", cpy, oend);
+                        goto _output_error;
+                    }
+                }
+                LZ4_memmove(op, ip, length);  /* supports overlapping memory regions, for in-place decompression scenarios */
+                ip += length;
+                op += length;
+                /* Necessarily EOF when !partialDecoding.
+                 * When partialDecoding, it is EOF if we've either
+                 * filled the output buffer or
+                 * can't proceed with reading an offset for following match.
+                 */
+                if (!partialDecoding || (cpy == oend) || (ip >= (iend-2))) {
+                    break;
+                }
+            } else {
+                LZ4_wildCopy8(op, ip, cpy);   /* can overwrite up to 8 bytes beyond cpy */
+                ip += length; op = cpy;
+            }
+
+            /* get offset */
+            offset = LZ4_readLE16(ip); ip+=2;
+            match = op - offset;
+
+            /* get matchlength */
+            length = token & ML_MASK;
+
+    _copy_match:
+            if (length == ML_MASK) {
+                size_t const addl = read_variable_length(&ip, iend - LASTLITERALS + 1, 0);
+                if (addl == rvl_error) { goto _output_error; }
+                length += addl;
+                if (unlikely((uptrval)(op)+length<(uptrval)op)) goto _output_error;   /* overflow detection */
+            }
+            length += MINMATCH;
+
+#if LZ4_FAST_DEC_LOOP
+        safe_match_copy:
+#endif
+            if ((checkOffset) && (unlikely(match + dictSize < lowPrefix))) goto _output_error;   /* Error : offset outside buffers */
+            /* match starting within external dictionary */
+            if ((dict==usingExtDict) && (match < lowPrefix)) {
+                assert(dictEnd != NULL);
+                if (unlikely(op+length > oend-LASTLITERALS)) {
+                    if (partialDecoding) length = MIN(length, (size_t)(oend-op));
+                    else goto _output_error;   /* doesn't respect parsing restriction */
+                }
+
+                if (length <= (size_t)(lowPrefix-match)) {
+                    /* match fits entirely within external dictionary : just copy */
+                    LZ4_memmove(op, dictEnd - (lowPrefix-match), length);
+                    op += length;
+                } else {
+                    /* match stretches into both external dictionary and current block */
+                    size_t const copySize = (size_t)(lowPrefix - match);
+                    size_t const restSize = length - copySize;
+                    LZ4_memcpy(op, dictEnd - copySize, copySize);
+                    op += copySize;
+                    if (restSize > (size_t)(op - lowPrefix)) {  /* overlap copy */
+                        BYTE* const endOfMatch = op + restSize;
+                        const BYTE* copyFrom = lowPrefix;
+                        while (op < endOfMatch) *op++ = *copyFrom++;
+                    } else {
+                        LZ4_memcpy(op, lowPrefix, restSize);
+                        op += restSize;
+                }   }
+                continue;
+            }
+            assert(match >= lowPrefix);
+
+            /* copy match within block */
+            cpy = op + length;
+
+            /* partialDecoding : may end anywhere within the block */
+            assert(op<=oend);
+            if (partialDecoding && (cpy > oend-MATCH_SAFEGUARD_DISTANCE)) {
+                size_t const mlen = MIN(length, (size_t)(oend-op));
+                const BYTE* const matchEnd = match + mlen;
+                BYTE* const copyEnd = op + mlen;
+                if (matchEnd > op) {   /* overlap copy */
+                    while (op < copyEnd) { *op++ = *match++; }
+                } else {
+                    LZ4_memcpy(op, match, mlen);
+                }
+                op = copyEnd;
+                if (op == oend) { break; }
+                continue;
+            }
+
+            if (unlikely(offset<8)) {
+                LZ4_write32(op, 0);   /* silence msan warning when offset==0 */
+                op[0] = match[0];
+                op[1] = match[1];
+                op[2] = match[2];
+                op[3] = match[3];
+                match += inc32table[offset];
+                LZ4_memcpy(op+4, match, 4);
+                match -= dec64table[offset];
+            } else {
+                LZ4_memcpy(op, match, 8);
+                match += 8;
+            }
+            op += 8;
+
+            if (unlikely(cpy > oend-MATCH_SAFEGUARD_DISTANCE)) {
+                BYTE* const oCopyLimit = oend - (WILDCOPYLENGTH-1);
+                if (cpy > oend-LASTLITERALS) { goto _output_error; } /* Error : last LASTLITERALS bytes must be literals (uncompressed) */
+                if (op < oCopyLimit) {
+                    LZ4_wildCopy8(op, match, oCopyLimit);
+                    match += oCopyLimit - op;
+                    op = oCopyLimit;
+                }
+                while (op < cpy) { *op++ = *match++; }
+            } else {
+                LZ4_memcpy(op, match, 8);
+                if (length > 16)  { LZ4_wildCopy8(op+8, match+8, cpy); }
+            }
+            op = cpy;   /* wildcopy correction */
+        }
+
+        /* end of decoding */
+        DEBUGLOG(5, "decoded %i bytes", (int) (((char*)op)-dst));
+        return (int) (((char*)op)-dst);     /* Nb of output bytes decoded */
+
+        /* Overflow error detected */
+    _output_error:
+        return (int) (-(((const char*)ip)-src))-1;
+    }
+}
+
+
+/*===== Instantiate the API decoding functions. =====*/
+
+LZ4_FORCE_O2
+int LZ4_decompress_safe(const char* source, char* dest, int compressedSize, int maxDecompressedSize)
+{
+    return LZ4_decompress_generic(source, dest, compressedSize, maxDecompressedSize,
+                                  decode_full_block, noDict,
+                                  (BYTE*)dest, NULL, 0);
+}
+
+LZ4_FORCE_O2
+int LZ4_decompress_safe_partial(const char* src, char* dst, int compressedSize, int targetOutputSize, int dstCapacity)
+{
+    dstCapacity = MIN(targetOutputSize, dstCapacity);
+    return LZ4_decompress_generic(src, dst, compressedSize, dstCapacity,
+                                  partial_decode,
+                                  noDict, (BYTE*)dst, NULL, 0);
+}
+
+LZ4_FORCE_O2
+int LZ4_decompress_fast(const char* source, char* dest, int originalSize)
+{
+    DEBUGLOG(5, "LZ4_decompress_fast");
+    return LZ4_decompress_unsafe_generic(
+                (const BYTE*)source, (BYTE*)dest, originalSize,
+                0, NULL, 0);
+}
+
+/*===== Instantiate a few more decoding cases, used more than once. =====*/
+
+LZ4_FORCE_O2 /* Exported, an obsolete API function. */
+int LZ4_decompress_safe_withPrefix64k(const char* source, char* dest, int compressedSize, int maxOutputSize)
+{
+    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize,
+                                  decode_full_block, withPrefix64k,
+                                  (BYTE*)dest - 64 KB, NULL, 0);
+}
+
+LZ4_FORCE_O2
+static int LZ4_decompress_safe_partial_withPrefix64k(const char* source, char* dest, int compressedSize, int targetOutputSize, int dstCapacity)
+{
+    dstCapacity = MIN(targetOutputSize, dstCapacity);
+    return LZ4_decompress_generic(source, dest, compressedSize, dstCapacity,
+                                  partial_decode, withPrefix64k,
+                                  (BYTE*)dest - 64 KB, NULL, 0);
+}
+
+/* Another obsolete API function, paired with the previous one. */
+int LZ4_decompress_fast_withPrefix64k(const char* source, char* dest, int originalSize)
+{
+    return LZ4_decompress_unsafe_generic(
+                (const BYTE*)source, (BYTE*)dest, originalSize,
+                64 KB, NULL, 0);
+}
+
+LZ4_FORCE_O2
+static int LZ4_decompress_safe_withSmallPrefix(const char* source, char* dest, int compressedSize, int maxOutputSize,
+                                               size_t prefixSize)
+{
+    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize,
+                                  decode_full_block, noDict,
+                                  (BYTE*)dest-prefixSize, NULL, 0);
+}
+
+LZ4_FORCE_O2
+static int LZ4_decompress_safe_partial_withSmallPrefix(const char* source, char* dest, int compressedSize, int targetOutputSize, int dstCapacity,
+                                               size_t prefixSize)
+{
+    dstCapacity = MIN(targetOutputSize, dstCapacity);
+    return LZ4_decompress_generic(source, dest, compressedSize, dstCapacity,
+                                  partial_decode, noDict,
+                                  (BYTE*)dest-prefixSize, NULL, 0);
+}
+
+LZ4_FORCE_O2
+int LZ4_decompress_safe_forceExtDict(const char* source, char* dest,
+                                     int compressedSize, int maxOutputSize,
+                                     const void* dictStart, size_t dictSize)
+{
+    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize,
+                                  decode_full_block, usingExtDict,
+                                  (BYTE*)dest, (const BYTE*)dictStart, dictSize);
+}
+
+LZ4_FORCE_O2
+int LZ4_decompress_safe_partial_forceExtDict(const char* source, char* dest,
+                                     int compressedSize, int targetOutputSize, int dstCapacity,
+                                     const void* dictStart, size_t dictSize)
+{
+    dstCapacity = MIN(targetOutputSize, dstCapacity);
+    return LZ4_decompress_generic(source, dest, compressedSize, dstCapacity,
+                                  partial_decode, usingExtDict,
+                                  (BYTE*)dest, (const BYTE*)dictStart, dictSize);
+}
+
+LZ4_FORCE_O2
+static int LZ4_decompress_fast_extDict(const char* source, char* dest, int originalSize,
+                                       const void* dictStart, size_t dictSize)
+{
+    return LZ4_decompress_unsafe_generic(
+                (const BYTE*)source, (BYTE*)dest, originalSize,
+                0, (const BYTE*)dictStart, dictSize);
+}
+
+/* The "double dictionary" mode, for use with e.g. ring buffers: the first part
+ * of the dictionary is passed as prefix, and the second via dictStart + dictSize.
+ * These routines are used only once, in LZ4_decompress_*_continue().
+ */
+LZ4_FORCE_INLINE
+int LZ4_decompress_safe_doubleDict(const char* source, char* dest, int compressedSize, int maxOutputSize,
+                                   size_t prefixSize, const void* dictStart, size_t dictSize)
+{
+    return LZ4_decompress_generic(source, dest, compressedSize, maxOutputSize,
+                                  decode_full_block, usingExtDict,
+                                  (BYTE*)dest-prefixSize, (const BYTE*)dictStart, dictSize);
+}
+
+/*===== streaming decompression functions =====*/
+
+#if !defined(LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION)
+LZ4_streamDecode_t* LZ4_createStreamDecode(void)
+{
+    LZ4_STATIC_ASSERT(sizeof(LZ4_streamDecode_t) >= sizeof(LZ4_streamDecode_t_internal));
+    return (LZ4_streamDecode_t*) ALLOC_AND_ZERO(sizeof(LZ4_streamDecode_t));
+}
+
+int LZ4_freeStreamDecode (LZ4_streamDecode_t* LZ4_stream)
+{
+    if (LZ4_stream == NULL) { return 0; }  /* support free on NULL */
+    FREEMEM(LZ4_stream);
+    return 0;
+}
+#endif
+
+/*! LZ4_setStreamDecode() :
+ *  Use this function to instruct where to find the dictionary.
+ *  This function is not necessary if previous data is still available where it was decoded.
+ *  Loading a size of 0 is allowed (same effect as no dictionary).
+ * @return : 1 if OK, 0 if error
+ */
+int LZ4_setStreamDecode (LZ4_streamDecode_t* LZ4_streamDecode, const char* dictionary, int dictSize)
+{
+    LZ4_streamDecode_t_internal* lz4sd = &LZ4_streamDecode->internal_donotuse;
+    lz4sd->prefixSize = (size_t)dictSize;
+    if (dictSize) {
+        assert(dictionary != NULL);
+        lz4sd->prefixEnd = (const BYTE*) dictionary + dictSize;
+    } else {
+        lz4sd->prefixEnd = (const BYTE*) dictionary;
+    }
+    lz4sd->externalDict = NULL;
+    lz4sd->extDictSize  = 0;
+    return 1;
+}
+
+/*! LZ4_decoderRingBufferSize() :
+ *  when setting a ring buffer for streaming decompression (optional scenario),
+ *  provides the minimum size of this ring buffer
+ *  to be compatible with any source respecting maxBlockSize condition.
+ *  Note : in a ring buffer scenario,
+ *  blocks are presumed decompressed next to each other.
+ *  When not enough space remains for next block (remainingSize < maxBlockSize),
+ *  decoding resumes from beginning of ring buffer.
+ * @return : minimum ring buffer size,
+ *           or 0 if there is an error (invalid maxBlockSize).
+ */
+int LZ4_decoderRingBufferSize(int maxBlockSize)
+{
+    if (maxBlockSize < 0) return 0;
+    if (maxBlockSize > LZ4_MAX_INPUT_SIZE) return 0;
+    if (maxBlockSize < 16) maxBlockSize = 16;
+    return LZ4_DECODER_RING_BUFFER_SIZE(maxBlockSize);
+}
+
+/*
+*_continue() :
+    These decoding functions allow decompression of multiple blocks in "streaming" mode.
+    Previously decoded blocks must still be available at the memory position where they were decoded.
+    If it's not possible, save the relevant part of decoded data into a safe buffer,
+    and indicate where it stands using LZ4_setStreamDecode()
+*/
+LZ4_FORCE_O2
+int LZ4_decompress_safe_continue (LZ4_streamDecode_t* LZ4_streamDecode, const char* source, char* dest, int compressedSize, int maxOutputSize)
+{
+    LZ4_streamDecode_t_internal* lz4sd = &LZ4_streamDecode->internal_donotuse;
+    int result;
+
+    if (lz4sd->prefixSize == 0) {
+        /* The first call, no dictionary yet. */
+        assert(lz4sd->extDictSize == 0);
+        result = LZ4_decompress_safe(source, dest, compressedSize, maxOutputSize);
+        if (result <= 0) return result;
+        lz4sd->prefixSize = (size_t)result;
+        lz4sd->prefixEnd = (BYTE*)dest + result;
+    } else if (lz4sd->prefixEnd == (BYTE*)dest) {
+        /* They're rolling the current segment. */
+        if (lz4sd->prefixSize >= 64 KB - 1)
+            result = LZ4_decompress_safe_withPrefix64k(source, dest, compressedSize, maxOutputSize);
+        else if (lz4sd->extDictSize == 0)
+            result = LZ4_decompress_safe_withSmallPrefix(source, dest, compressedSize, maxOutputSize,
+                                                         lz4sd->prefixSize);
+        else
+            result = LZ4_decompress_safe_doubleDict(source, dest, compressedSize, maxOutputSize,
+                                                    lz4sd->prefixSize, lz4sd->externalDict, lz4sd->extDictSize);
+        if (result <= 0) return result;
+        lz4sd->prefixSize += (size_t)result;
+        lz4sd->prefixEnd  += result;
+    } else {
+        /* The buffer wraps around, or they're switching to another buffer. */
+        lz4sd->extDictSize = lz4sd->prefixSize;
+        lz4sd->externalDict = lz4sd->prefixEnd - lz4sd->extDictSize;
+        result = LZ4_decompress_safe_forceExtDict(source, dest, compressedSize, maxOutputSize,
+                                                  lz4sd->externalDict, lz4sd->extDictSize);
+        if (result <= 0) return result;
+        lz4sd->prefixSize = (size_t)result;
+        lz4sd->prefixEnd  = (BYTE*)dest + result;
+    }
+
+    return result;
+}
+
+LZ4_FORCE_O2 int
+LZ4_decompress_fast_continue (LZ4_streamDecode_t* LZ4_streamDecode,
+                        const char* source, char* dest, int originalSize)
+{
+    LZ4_streamDecode_t_internal* const lz4sd =
+        (assert(LZ4_streamDecode!=NULL), &LZ4_streamDecode->internal_donotuse);
+    int result;
+
+    DEBUGLOG(5, "LZ4_decompress_fast_continue (toDecodeSize=%i)", originalSize);
+    assert(originalSize >= 0);
+
+    if (lz4sd->prefixSize == 0) {
+        DEBUGLOG(5, "first invocation : no prefix nor extDict");
+        assert(lz4sd->extDictSize == 0);
+        result = LZ4_decompress_fast(source, dest, originalSize);
+        if (result <= 0) return result;
+        lz4sd->prefixSize = (size_t)originalSize;
+        lz4sd->prefixEnd = (BYTE*)dest + originalSize;
+    } else if (lz4sd->prefixEnd == (BYTE*)dest) {
+        DEBUGLOG(5, "continue using existing prefix");
+        result = LZ4_decompress_unsafe_generic(
+                        (const BYTE*)source, (BYTE*)dest, originalSize,
+                        lz4sd->prefixSize,
+                        lz4sd->externalDict, lz4sd->extDictSize);
+        if (result <= 0) return result;
+        lz4sd->prefixSize += (size_t)originalSize;
+        lz4sd->prefixEnd  += originalSize;
+    } else {
+        DEBUGLOG(5, "prefix becomes extDict");
+        lz4sd->extDictSize = lz4sd->prefixSize;
+        lz4sd->externalDict = lz4sd->prefixEnd - lz4sd->extDictSize;
+        result = LZ4_decompress_fast_extDict(source, dest, originalSize,
+                                             lz4sd->externalDict, lz4sd->extDictSize);
+        if (result <= 0) return result;
+        lz4sd->prefixSize = (size_t)originalSize;
+        lz4sd->prefixEnd  = (BYTE*)dest + originalSize;
+    }
+
+    return result;
+}
+
+
+/*
+Advanced decoding functions :
+*_usingDict() :
+    These decoding functions work the same as "_continue" ones,
+    the dictionary must be explicitly provided within parameters
+*/
+
+int LZ4_decompress_safe_usingDict(const char* source, char* dest, int compressedSize, int maxOutputSize, const char* dictStart, int dictSize)
+{
+    if (dictSize==0)
+        return LZ4_decompress_safe(source, dest, compressedSize, maxOutputSize);
+    if (dictStart+dictSize == dest) {
+        if (dictSize >= 64 KB - 1) {
+            return LZ4_decompress_safe_withPrefix64k(source, dest, compressedSize, maxOutputSize);
+        }
+        assert(dictSize >= 0);
+        return LZ4_decompress_safe_withSmallPrefix(source, dest, compressedSize, maxOutputSize, (size_t)dictSize);
+    }
+    assert(dictSize >= 0);
+    return LZ4_decompress_safe_forceExtDict(source, dest, compressedSize, maxOutputSize, dictStart, (size_t)dictSize);
+}
+
+int LZ4_decompress_safe_partial_usingDict(const char* source, char* dest, int compressedSize, int targetOutputSize, int dstCapacity, const char* dictStart, int dictSize)
+{
+    if (dictSize==0)
+        return LZ4_decompress_safe_partial(source, dest, compressedSize, targetOutputSize, dstCapacity);
+    if (dictStart+dictSize == dest) {
+        if (dictSize >= 64 KB - 1) {
+            return LZ4_decompress_safe_partial_withPrefix64k(source, dest, compressedSize, targetOutputSize, dstCapacity);
+        }
+        assert(dictSize >= 0);
+        return LZ4_decompress_safe_partial_withSmallPrefix(source, dest, compressedSize, targetOutputSize, dstCapacity, (size_t)dictSize);
+    }
+    assert(dictSize >= 0);
+    return LZ4_decompress_safe_partial_forceExtDict(source, dest, compressedSize, targetOutputSize, dstCapacity, dictStart, (size_t)dictSize);
+}
+
+int LZ4_decompress_fast_usingDict(const char* source, char* dest, int originalSize, const char* dictStart, int dictSize)
+{
+    if (dictSize==0 || dictStart+dictSize == dest)
+        return LZ4_decompress_unsafe_generic(
+                        (const BYTE*)source, (BYTE*)dest, originalSize,
+                        (size_t)dictSize, NULL, 0);
+    assert(dictSize >= 0);
+    return LZ4_decompress_fast_extDict(source, dest, originalSize, dictStart, (size_t)dictSize);
+}
+
+
+/*=*************************************************
+*  Obsolete Functions
+***************************************************/
+/* obsolete compression functions */
+int LZ4_compress_limitedOutput(const char* source, char* dest, int inputSize, int maxOutputSize)
+{
+    return LZ4_compress_default(source, dest, inputSize, maxOutputSize);
+}
+int LZ4_compress(const char* src, char* dest, int srcSize)
+{
+    return LZ4_compress_default(src, dest, srcSize, LZ4_compressBound(srcSize));
+}
+int LZ4_compress_limitedOutput_withState (void* state, const char* src, char* dst, int srcSize, int dstSize)
+{
+    return LZ4_compress_fast_extState(state, src, dst, srcSize, dstSize, 1);
+}
+int LZ4_compress_withState (void* state, const char* src, char* dst, int srcSize)
+{
+    return LZ4_compress_fast_extState(state, src, dst, srcSize, LZ4_compressBound(srcSize), 1);
+}
+int LZ4_compress_limitedOutput_continue (LZ4_stream_t* LZ4_stream, const char* src, char* dst, int srcSize, int dstCapacity)
+{
+    return LZ4_compress_fast_continue(LZ4_stream, src, dst, srcSize, dstCapacity, 1);
+}
+int LZ4_compress_continue (LZ4_stream_t* LZ4_stream, const char* source, char* dest, int inputSize)
+{
+    return LZ4_compress_fast_continue(LZ4_stream, source, dest, inputSize, LZ4_compressBound(inputSize), 1);
+}
+
+/*
+These decompression functions are deprecated and should no longer be used.
+They are only provided here for compatibility with older user programs.
+- LZ4_uncompress is totally equivalent to LZ4_decompress_fast
+- LZ4_uncompress_unknownOutputSize is totally equivalent to LZ4_decompress_safe
+*/
+int LZ4_uncompress (const char* source, char* dest, int outputSize)
+{
+    return LZ4_decompress_fast(source, dest, outputSize);
+}
+int LZ4_uncompress_unknownOutputSize (const char* source, char* dest, int isize, int maxOutputSize)
+{
+    return LZ4_decompress_safe(source, dest, isize, maxOutputSize);
+}
+
+/* Obsolete Streaming functions */
+
+int LZ4_sizeofStreamState(void) { return sizeof(LZ4_stream_t); }
+
+int LZ4_resetStreamState(void* state, char* inputBuffer)
+{
+    (void)inputBuffer;
+    LZ4_resetStream((LZ4_stream_t*)state);
+    return 0;
+}
+
+#if !defined(LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION)
+void* LZ4_create (char* inputBuffer)
+{
+    (void)inputBuffer;
+    return LZ4_createStream();
+}
+#endif
+
+char* LZ4_slideInputBuffer (void* state)
+{
+    /* avoid const char * -> char * conversion warning */
+    return (char *)(uptrval)((LZ4_stream_t*)state)->internal_donotuse.dictionary;
+}
+
+#endif   /* LZ4_COMMONDEFS_ONLY */
+}
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/lz4.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/lz4.hpp
new file mode 100644
index 0000000000..88a41198e9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/lz4/lz4.hpp
@@ -0,0 +1,843 @@
+/*
+ *  LZ4 - Fast LZ compression algorithm
+ *  Header File
+ *  Copyright (C) 2011-2020, Yann Collet.
+
+   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are
+   met:
+
+       * Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+       * Redistributions in binary form must reproduce the above
+   copyright notice, this list of conditions and the following disclaimer
+   in the documentation and/or other materials provided with the
+   distribution.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   You can contact the author at :
+    - LZ4 homepage : http://www.lz4.org
+    - LZ4 source repository : https://github.com/lz4/lz4
+*/
+//#if defined (__cplusplus)
+//extern "C" {
+//#endif
+
+#ifndef LZ4_H_2983827168210
+#define LZ4_H_2983827168210
+
+/* --- Dependency --- */
+#include <stddef.h>   /* size_t */
+
+namespace lbug_lz4 {
+
+/**
+  Introduction
+
+  LZ4 is lossless compression algorithm, providing compression speed >500 MB/s per core,
+  scalable with multi-cores CPU. It features an extremely fast decoder, with speed in
+  multiple GB/s per core, typically reaching RAM speed limits on multi-core systems.
+
+  The LZ4 compression library provides in-memory compression and decompression functions.
+  It gives full buffer control to user.
+  Compression can be done in:
+    - a single step (described as Simple Functions)
+    - a single step, reusing a context (described in Advanced Functions)
+    - unbounded multiple steps (described as Streaming compression)
+
+  lz4.h generates and decodes LZ4-compressed blocks (doc/lz4_Block_format.md).
+  Decompressing such a compressed block requires additional metadata.
+  Exact metadata depends on exact decompression function.
+  For the typical case of LZ4_decompress_safe(),
+  metadata includes block's compressed size, and maximum bound of decompressed size.
+  Each application is free to encode and pass such metadata in whichever way it wants.
+
+  lz4.h only handle blocks, it can not generate Frames.
+
+  Blocks are different from Frames (doc/lz4_Frame_format.md).
+  Frames bundle both blocks and metadata in a specified manner.
+  Embedding metadata is required for compressed data to be self-contained and portable.
+  Frame format is delivered through a companion API, declared in lz4frame.h.
+  The `lz4` CLI can only manage frames.
+*/
+
+/*^***************************************************************
+*  Export parameters
+*****************************************************************/
+/*
+*  LZ4_DLL_EXPORT :
+*  Enable exporting of functions when building a Windows DLL
+*  LZ4LIB_VISIBILITY :
+*  Control library symbols visibility.
+*/
+#ifndef LZ4LIB_VISIBILITY
+#  if defined(__GNUC__) && (__GNUC__ >= 4)
+#    define LZ4LIB_VISIBILITY __attribute__ ((visibility ("default")))
+#  else
+#    define LZ4LIB_VISIBILITY
+#  endif
+#endif
+#if defined(LZ4_DLL_EXPORT) && (LZ4_DLL_EXPORT==1)
+#  define LZ4LIB_API __declspec(dllexport) LZ4LIB_VISIBILITY
+#elif defined(LZ4_DLL_IMPORT) && (LZ4_DLL_IMPORT==1)
+#  define LZ4LIB_API __declspec(dllimport) LZ4LIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
+#else
+#  define LZ4LIB_API LZ4LIB_VISIBILITY
+#endif
+
+/*! LZ4_FREESTANDING :
+ *  When this macro is set to 1, it enables "freestanding mode" that is
+ *  suitable for typical freestanding environment which doesn't support
+ *  standard C library.
+ *
+ *  - LZ4_FREESTANDING is a compile-time switch.
+ *  - It requires the following macros to be defined:
+ *    LZ4_memcpy, LZ4_memmove, LZ4_memset.
+ *  - It only enables LZ4/HC functions which don't use heap.
+ *    All LZ4F_* functions are not supported.
+ *  - See tests/freestanding.c to check its basic setup.
+ */
+#if defined(LZ4_FREESTANDING) && (LZ4_FREESTANDING == 1)
+#  define LZ4_HEAPMODE 0
+#  define LZ4HC_HEAPMODE 0
+#  define LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION 1
+#  if !defined(LZ4_memcpy)
+#    error "LZ4_FREESTANDING requires macro 'LZ4_memcpy'."
+#  endif
+#  if !defined(LZ4_memset)
+#    error "LZ4_FREESTANDING requires macro 'LZ4_memset'."
+#  endif
+#  if !defined(LZ4_memmove)
+#    error "LZ4_FREESTANDING requires macro 'LZ4_memmove'."
+#  endif
+#elif ! defined(LZ4_FREESTANDING)
+#  define LZ4_FREESTANDING 0
+#endif
+
+
+/*------   Version   ------*/
+#define LZ4_VERSION_MAJOR    1    /* for breaking interface changes  */
+#define LZ4_VERSION_MINOR    9    /* for new (non-breaking) interface capabilities */
+#define LZ4_VERSION_RELEASE  4    /* for tweaks, bug-fixes, or development */
+
+#define LZ4_VERSION_NUMBER (LZ4_VERSION_MAJOR *100*100 + LZ4_VERSION_MINOR *100 + LZ4_VERSION_RELEASE)
+
+#define LZ4_LIB_VERSION LZ4_VERSION_MAJOR.LZ4_VERSION_MINOR.LZ4_VERSION_RELEASE
+#define LZ4_QUOTE(str) #str
+#define LZ4_EXPAND_AND_QUOTE(str) LZ4_QUOTE(str)
+#define LZ4_VERSION_STRING LZ4_EXPAND_AND_QUOTE(LZ4_LIB_VERSION)  /* requires v1.7.3+ */
+
+LZ4LIB_API int LZ4_versionNumber (void);  /**< library version number; useful to check dll version; requires v1.3.0+ */
+LZ4LIB_API const char* LZ4_versionString (void);   /**< library version string; useful to check dll version; requires v1.7.5+ */
+
+
+/*-************************************
+*  Tuning parameter
+**************************************/
+#define LZ4_MEMORY_USAGE_MIN 10
+#define LZ4_MEMORY_USAGE_DEFAULT 14
+#define LZ4_MEMORY_USAGE_MAX 20
+
+/*!
+ * LZ4_MEMORY_USAGE :
+ * Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; )
+ * Increasing memory usage improves compression ratio, at the cost of speed.
+ * Reduced memory usage may improve speed at the cost of ratio, thanks to better cache locality.
+ * Default value is 14, for 16KB, which nicely fits into Intel x86 L1 cache
+ */
+#ifndef LZ4_MEMORY_USAGE
+# define LZ4_MEMORY_USAGE LZ4_MEMORY_USAGE_DEFAULT
+#endif
+
+#if (LZ4_MEMORY_USAGE < LZ4_MEMORY_USAGE_MIN)
+#  error "LZ4_MEMORY_USAGE is too small !"
+#endif
+
+#if (LZ4_MEMORY_USAGE > LZ4_MEMORY_USAGE_MAX)
+#  error "LZ4_MEMORY_USAGE is too large !"
+#endif
+
+/*-************************************
+*  Simple Functions
+**************************************/
+/*! LZ4_compress_default() :
+ *  Compresses 'srcSize' bytes from buffer 'src'
+ *  into already allocated 'dst' buffer of size 'dstCapacity'.
+ *  Compression is guaranteed to succeed if 'dstCapacity' >= LZ4_compressBound(srcSize).
+ *  It also runs faster, so it's a recommended setting.
+ *  If the function cannot compress 'src' into a more limited 'dst' budget,
+ *  compression stops *immediately*, and the function result is zero.
+ *  In which case, 'dst' content is undefined (invalid).
+ *      srcSize : max supported value is LZ4_MAX_INPUT_SIZE.
+ *      dstCapacity : size of buffer 'dst' (which must be already allocated)
+ *     @return  : the number of bytes written into buffer 'dst' (necessarily <= dstCapacity)
+ *                or 0 if compression fails
+ * Note : This function is protected against buffer overflow scenarios (never writes outside 'dst' buffer, nor read outside 'source' buffer).
+ */
+LZ4LIB_API int LZ4_compress_default(const char* src, char* dst, int srcSize, int dstCapacity);
+
+/*! LZ4_decompress_safe() :
+ *  compressedSize : is the exact complete size of the compressed block.
+ *  dstCapacity : is the size of destination buffer (which must be already allocated), presumed an upper bound of decompressed size.
+ * @return : the number of bytes decompressed into destination buffer (necessarily <= dstCapacity)
+ *           If destination buffer is not large enough, decoding will stop and output an error code (negative value).
+ *           If the source stream is detected malformed, the function will stop decoding and return a negative result.
+ * Note 1 : This function is protected against malicious data packets :
+ *          it will never writes outside 'dst' buffer, nor read outside 'source' buffer,
+ *          even if the compressed block is maliciously modified to order the decoder to do these actions.
+ *          In such case, the decoder stops immediately, and considers the compressed block malformed.
+ * Note 2 : compressedSize and dstCapacity must be provided to the function, the compressed block does not contain them.
+ *          The implementation is free to send / store / derive this information in whichever way is most beneficial.
+ *          If there is a need for a different format which bundles together both compressed data and its metadata, consider looking at lz4frame.h instead.
+ */
+LZ4LIB_API int LZ4_decompress_safe (const char* src, char* dst, int compressedSize, int dstCapacity);
+
+
+/*-************************************
+*  Advanced Functions
+**************************************/
+#define LZ4_MAX_INPUT_SIZE        0x7E000000   /* 2 113 929 216 bytes */
+#define LZ4_COMPRESSBOUND(isize)  ((unsigned)(isize) > (unsigned)LZ4_MAX_INPUT_SIZE ? 0 : (isize) + ((isize)/255) + 16)
+
+/*! LZ4_compressBound() :
+    Provides the maximum size that LZ4 compression may output in a "worst case" scenario (input data not compressible)
+    This function is primarily useful for memory allocation purposes (destination buffer size).
+    Macro LZ4_COMPRESSBOUND() is also provided for compilation-time evaluation (stack memory allocation for example).
+    Note that LZ4_compress_default() compresses faster when dstCapacity is >= LZ4_compressBound(srcSize)
+        inputSize  : max supported value is LZ4_MAX_INPUT_SIZE
+        return : maximum output size in a "worst case" scenario
+              or 0, if input size is incorrect (too large or negative)
+*/
+LZ4LIB_API int LZ4_compressBound(int inputSize);
+
+/*! LZ4_compress_fast() :
+    Same as LZ4_compress_default(), but allows selection of "acceleration" factor.
+    The larger the acceleration value, the faster the algorithm, but also the lesser the compression.
+    It's a trade-off. It can be fine tuned, with each successive value providing roughly +~3% to speed.
+    An acceleration value of "1" is the same as regular LZ4_compress_default()
+    Values <= 0 will be replaced by LZ4_ACCELERATION_DEFAULT (currently == 1, see lz4.c).
+    Values > LZ4_ACCELERATION_MAX will be replaced by LZ4_ACCELERATION_MAX (currently == 65537, see lz4.c).
+*/
+LZ4LIB_API int LZ4_compress_fast (const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
+
+
+/*! LZ4_compress_fast_extState() :
+ *  Same as LZ4_compress_fast(), using an externally allocated memory space for its state.
+ *  Use LZ4_sizeofState() to know how much memory must be allocated,
+ *  and allocate it on 8-bytes boundaries (using `malloc()` typically).
+ *  Then, provide this buffer as `void* state` to compression function.
+ */
+LZ4LIB_API int LZ4_sizeofState(void);
+LZ4LIB_API int LZ4_compress_fast_extState (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
+
+
+/*! LZ4_compress_destSize() :
+ *  Reverse the logic : compresses as much data as possible from 'src' buffer
+ *  into already allocated buffer 'dst', of size >= 'targetDestSize'.
+ *  This function either compresses the entire 'src' content into 'dst' if it's large enough,
+ *  or fill 'dst' buffer completely with as much data as possible from 'src'.
+ *  note: acceleration parameter is fixed to "default".
+ *
+ * *srcSizePtr : will be modified to indicate how many bytes where read from 'src' to fill 'dst'.
+ *               New value is necessarily <= input value.
+ * @return : Nb bytes written into 'dst' (necessarily <= targetDestSize)
+ *           or 0 if compression fails.
+ *
+ * Note : from v1.8.2 to v1.9.1, this function had a bug (fixed un v1.9.2+):
+ *        the produced compressed content could, in specific circumstances,
+ *        require to be decompressed into a destination buffer larger
+ *        by at least 1 byte than the content to decompress.
+ *        If an application uses `LZ4_compress_destSize()`,
+ *        it's highly recommended to update liblz4 to v1.9.2 or better.
+ *        If this can't be done or ensured,
+ *        the receiving decompression function should provide
+ *        a dstCapacity which is > decompressedSize, by at least 1 byte.
+ *        See https://github.com/lz4/lz4/issues/859 for details
+ */
+LZ4LIB_API int LZ4_compress_destSize (const char* src, char* dst, int* srcSizePtr, int targetDstSize);
+
+
+/*! LZ4_decompress_safe_partial() :
+ *  Decompress an LZ4 compressed block, of size 'srcSize' at position 'src',
+ *  into destination buffer 'dst' of size 'dstCapacity'.
+ *  Up to 'targetOutputSize' bytes will be decoded.
+ *  The function stops decoding on reaching this objective.
+ *  This can be useful to boost performance
+ *  whenever only the beginning of a block is required.
+ *
+ * @return : the number of bytes decoded in `dst` (necessarily <= targetOutputSize)
+ *           If source stream is detected malformed, function returns a negative result.
+ *
+ *  Note 1 : @return can be < targetOutputSize, if compressed block contains less data.
+ *
+ *  Note 2 : targetOutputSize must be <= dstCapacity
+ *
+ *  Note 3 : this function effectively stops decoding on reaching targetOutputSize,
+ *           so dstCapacity is kind of redundant.
+ *           This is because in older versions of this function,
+ *           decoding operation would still write complete sequences.
+ *           Therefore, there was no guarantee that it would stop writing at exactly targetOutputSize,
+ *           it could write more bytes, though only up to dstCapacity.
+ *           Some "margin" used to be required for this operation to work properly.
+ *           Thankfully, this is no longer necessary.
+ *           The function nonetheless keeps the same signature, in an effort to preserve API compatibility.
+ *
+ *  Note 4 : If srcSize is the exact size of the block,
+ *           then targetOutputSize can be any value,
+ *           including larger than the block's decompressed size.
+ *           The function will, at most, generate block's decompressed size.
+ *
+ *  Note 5 : If srcSize is _larger_ than block's compressed size,
+ *           then targetOutputSize **MUST** be <= block's decompressed size.
+ *           Otherwise, *silent corruption will occur*.
+ */
+LZ4LIB_API int LZ4_decompress_safe_partial (const char* src, char* dst, int srcSize, int targetOutputSize, int dstCapacity);
+
+
+/*-*********************************************
+*  Streaming Compression Functions
+***********************************************/
+typedef union LZ4_stream_u LZ4_stream_t;  /* incomplete type (defined later) */
+
+/**
+ Note about RC_INVOKED
+
+ - RC_INVOKED is predefined symbol of rc.exe (the resource compiler which is part of MSVC/Visual Studio).
+   https://docs.microsoft.com/en-us/windows/win32/menurc/predefined-macros
+
+ - Since rc.exe is a legacy compiler, it truncates long symbol (> 30 chars)
+   and reports warning "RC4011: identifier truncated".
+
+ - To eliminate the warning, we surround long preprocessor symbol with
+   "#if !defined(RC_INVOKED) ... #endif" block that means
+   "skip this block when rc.exe is trying to read it".
+*/
+#if !defined(RC_INVOKED) /* https://docs.microsoft.com/en-us/windows/win32/menurc/predefined-macros */
+#if !defined(LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION)
+LZ4LIB_API LZ4_stream_t* LZ4_createStream(void);
+LZ4LIB_API int           LZ4_freeStream (LZ4_stream_t* streamPtr);
+#endif /* !defined(LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION) */
+#endif
+
+/*! LZ4_resetStream_fast() : v1.9.0+
+ *  Use this to prepare an LZ4_stream_t for a new chain of dependent blocks
+ *  (e.g., LZ4_compress_fast_continue()).
+ *
+ *  An LZ4_stream_t must be initialized once before usage.
+ *  This is automatically done when created by LZ4_createStream().
+ *  However, should the LZ4_stream_t be simply declared on stack (for example),
+ *  it's necessary to initialize it first, using LZ4_initStream().
+ *
+ *  After init, start any new stream with LZ4_resetStream_fast().
+ *  A same LZ4_stream_t can be re-used multiple times consecutively
+ *  and compress multiple streams,
+ *  provided that it starts each new stream with LZ4_resetStream_fast().
+ *
+ *  LZ4_resetStream_fast() is much faster than LZ4_initStream(),
+ *  but is not compatible with memory regions containing garbage data.
+ *
+ *  Note: it's only useful to call LZ4_resetStream_fast()
+ *        in the context of streaming compression.
+ *        The *extState* functions perform their own resets.
+ *        Invoking LZ4_resetStream_fast() before is redundant, and even counterproductive.
+ */
+LZ4LIB_API void LZ4_resetStream_fast (LZ4_stream_t* streamPtr);
+
+/*! LZ4_loadDict() :
+ *  Use this function to reference a static dictionary into LZ4_stream_t.
+ *  The dictionary must remain available during compression.
+ *  LZ4_loadDict() triggers a reset, so any previous data will be forgotten.
+ *  The same dictionary will have to be loaded on decompression side for successful decoding.
+ *  Dictionary are useful for better compression of small data (KB range).
+ *  While LZ4 accept any input as dictionary,
+ *  results are generally better when using Zstandard's Dictionary Builder.
+ *  Loading a size of 0 is allowed, and is the same as reset.
+ * @return : loaded dictionary size, in bytes (necessarily <= 64 KB)
+ */
+LZ4LIB_API int LZ4_loadDict (LZ4_stream_t* streamPtr, const char* dictionary, int dictSize);
+
+/*! LZ4_compress_fast_continue() :
+ *  Compress 'src' content using data from previously compressed blocks, for better compression ratio.
+ * 'dst' buffer must be already allocated.
+ *  If dstCapacity >= LZ4_compressBound(srcSize), compression is guaranteed to succeed, and runs faster.
+ *
+ * @return : size of compressed block
+ *           or 0 if there is an error (typically, cannot fit into 'dst').
+ *
+ *  Note 1 : Each invocation to LZ4_compress_fast_continue() generates a new block.
+ *           Each block has precise boundaries.
+ *           Each block must be decompressed separately, calling LZ4_decompress_*() with relevant metadata.
+ *           It's not possible to append blocks together and expect a single invocation of LZ4_decompress_*() to decompress them together.
+ *
+ *  Note 2 : The previous 64KB of source data is __assumed__ to remain present, unmodified, at same address in memory !
+ *
+ *  Note 3 : When input is structured as a double-buffer, each buffer can have any size, including < 64 KB.
+ *           Make sure that buffers are separated, by at least one byte.
+ *           This construction ensures that each block only depends on previous block.
+ *
+ *  Note 4 : If input buffer is a ring-buffer, it can have any size, including < 64 KB.
+ *
+ *  Note 5 : After an error, the stream status is undefined (invalid), it can only be reset or freed.
+ */
+LZ4LIB_API int LZ4_compress_fast_continue (LZ4_stream_t* streamPtr, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
+
+/*! LZ4_saveDict() :
+ *  If last 64KB data cannot be guaranteed to remain available at its current memory location,
+ *  save it into a safer place (char* safeBuffer).
+ *  This is schematically equivalent to a memcpy() followed by LZ4_loadDict(),
+ *  but is much faster, because LZ4_saveDict() doesn't need to rebuild tables.
+ * @return : saved dictionary size in bytes (necessarily <= maxDictSize), or 0 if error.
+ */
+LZ4LIB_API int LZ4_saveDict (LZ4_stream_t* streamPtr, char* safeBuffer, int maxDictSize);
+
+
+/*-**********************************************
+*  Streaming Decompression Functions
+*  Bufferless synchronous API
+************************************************/
+typedef union LZ4_streamDecode_u LZ4_streamDecode_t;   /* tracking context */
+
+/*! LZ4_createStreamDecode() and LZ4_freeStreamDecode() :
+ *  creation / destruction of streaming decompression tracking context.
+ *  A tracking context can be re-used multiple times.
+ */
+#if !defined(RC_INVOKED) /* https://docs.microsoft.com/en-us/windows/win32/menurc/predefined-macros */
+#if !defined(LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION)
+LZ4LIB_API LZ4_streamDecode_t* LZ4_createStreamDecode(void);
+LZ4LIB_API int                 LZ4_freeStreamDecode (LZ4_streamDecode_t* LZ4_stream);
+#endif /* !defined(LZ4_STATIC_LINKING_ONLY_DISABLE_MEMORY_ALLOCATION) */
+#endif
+
+/*! LZ4_setStreamDecode() :
+ *  An LZ4_streamDecode_t context can be allocated once and re-used multiple times.
+ *  Use this function to start decompression of a new stream of blocks.
+ *  A dictionary can optionally be set. Use NULL or size 0 for a reset order.
+ *  Dictionary is presumed stable : it must remain accessible and unmodified during next decompression.
+ * @return : 1 if OK, 0 if error
+ */
+LZ4LIB_API int LZ4_setStreamDecode (LZ4_streamDecode_t* LZ4_streamDecode, const char* dictionary, int dictSize);
+
+/*! LZ4_decoderRingBufferSize() : v1.8.2+
+ *  Note : in a ring buffer scenario (optional),
+ *  blocks are presumed decompressed next to each other
+ *  up to the moment there is not enough remaining space for next block (remainingSize < maxBlockSize),
+ *  at which stage it resumes from beginning of ring buffer.
+ *  When setting such a ring buffer for streaming decompression,
+ *  provides the minimum size of this ring buffer
+ *  to be compatible with any source respecting maxBlockSize condition.
+ * @return : minimum ring buffer size,
+ *           or 0 if there is an error (invalid maxBlockSize).
+ */
+LZ4LIB_API int LZ4_decoderRingBufferSize(int maxBlockSize);
+#define LZ4_DECODER_RING_BUFFER_SIZE(maxBlockSize) (65536 + 14 + (maxBlockSize))  /* for static allocation; maxBlockSize presumed valid */
+
+/*! LZ4_decompress_*_continue() :
+ *  These decoding functions allow decompression of consecutive blocks in "streaming" mode.
+ *  A block is an unsplittable entity, it must be presented entirely to a decompression function.
+ *  Decompression functions only accepts one block at a time.
+ *  The last 64KB of previously decoded data *must* remain available and unmodified at the memory position where they were decoded.
+ *  If less than 64KB of data has been decoded, all the data must be present.
+ *
+ *  Special : if decompression side sets a ring buffer, it must respect one of the following conditions :
+ *  - Decompression buffer size is _at least_ LZ4_decoderRingBufferSize(maxBlockSize).
+ *    maxBlockSize is the maximum size of any single block. It can have any value > 16 bytes.
+ *    In which case, encoding and decoding buffers do not need to be synchronized.
+ *    Actually, data can be produced by any source compliant with LZ4 format specification, and respecting maxBlockSize.
+ *  - Synchronized mode :
+ *    Decompression buffer size is _exactly_ the same as compression buffer size,
+ *    and follows exactly same update rule (block boundaries at same positions),
+ *    and decoding function is provided with exact decompressed size of each block (exception for last block of the stream),
+ *    _then_ decoding & encoding ring buffer can have any size, including small ones ( < 64 KB).
+ *  - Decompression buffer is larger than encoding buffer, by a minimum of maxBlockSize more bytes.
+ *    In which case, encoding and decoding buffers do not need to be synchronized,
+ *    and encoding ring buffer can have any size, including small ones ( < 64 KB).
+ *
+ *  Whenever these conditions are not possible,
+ *  save the last 64KB of decoded data into a safe buffer where it can't be modified during decompression,
+ *  then indicate where this data is saved using LZ4_setStreamDecode(), before decompressing next block.
+*/
+LZ4LIB_API int
+LZ4_decompress_safe_continue (LZ4_streamDecode_t* LZ4_streamDecode,
+                        const char* src, char* dst,
+                        int srcSize, int dstCapacity);
+
+
+/*! LZ4_decompress_*_usingDict() :
+ *  These decoding functions work the same as
+ *  a combination of LZ4_setStreamDecode() followed by LZ4_decompress_*_continue()
+ *  They are stand-alone, and don't need an LZ4_streamDecode_t structure.
+ *  Dictionary is presumed stable : it must remain accessible and unmodified during decompression.
+ *  Performance tip : Decompression speed can be substantially increased
+ *                    when dst == dictStart + dictSize.
+ */
+LZ4LIB_API int
+LZ4_decompress_safe_usingDict(const char* src, char* dst,
+                              int srcSize, int dstCapacity,
+                              const char* dictStart, int dictSize);
+
+LZ4LIB_API int
+LZ4_decompress_safe_partial_usingDict(const char* src, char* dst,
+                                      int compressedSize,
+                                      int targetOutputSize, int maxOutputSize,
+                                      const char* dictStart, int dictSize);
+
+#endif /* LZ4_H_2983827168210 */
+
+
+/*^*************************************
+ * !!!!!!   STATIC LINKING ONLY   !!!!!!
+ ***************************************/
+
+/*-****************************************************************************
+ * Experimental section
+ *
+ * Symbols declared in this section must be considered unstable. Their
+ * signatures or semantics may change, or they may be removed altogether in the
+ * future. They are therefore only safe to depend on when the caller is
+ * statically linked against the library.
+ *
+ * To protect against unsafe usage, not only are the declarations guarded,
+ * the definitions are hidden by default
+ * when building LZ4 as a shared/dynamic library.
+ *
+ * In order to access these declarations,
+ * define LZ4_STATIC_LINKING_ONLY in your application
+ * before including LZ4's headers.
+ *
+ * In order to make their implementations accessible dynamically, you must
+ * define LZ4_PUBLISH_STATIC_FUNCTIONS when building the LZ4 library.
+ ******************************************************************************/
+
+#ifdef LZ4_STATIC_LINKING_ONLY
+
+#ifndef LZ4_STATIC_3504398509
+#define LZ4_STATIC_3504398509
+
+#ifdef LZ4_PUBLISH_STATIC_FUNCTIONS
+#define LZ4LIB_STATIC_API LZ4LIB_API
+#else
+#define LZ4LIB_STATIC_API
+#endif
+
+
+/*! LZ4_compress_fast_extState_fastReset() :
+ *  A variant of LZ4_compress_fast_extState().
+ *
+ *  Using this variant avoids an expensive initialization step.
+ *  It is only safe to call if the state buffer is known to be correctly initialized already
+ *  (see above comment on LZ4_resetStream_fast() for a definition of "correctly initialized").
+ *  From a high level, the difference is that
+ *  this function initializes the provided state with a call to something like LZ4_resetStream_fast()
+ *  while LZ4_compress_fast_extState() starts with a call to LZ4_resetStream().
+ */
+LZ4LIB_STATIC_API int LZ4_compress_fast_extState_fastReset (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
+
+/*! LZ4_attach_dictionary() :
+ *  This is an experimental API that allows
+ *  efficient use of a static dictionary many times.
+ *
+ *  Rather than re-loading the dictionary buffer into a working context before
+ *  each compression, or copying a pre-loaded dictionary's LZ4_stream_t into a
+ *  working LZ4_stream_t, this function introduces a no-copy setup mechanism,
+ *  in which the working stream references the dictionary stream in-place.
+ *
+ *  Several assumptions are made about the state of the dictionary stream.
+ *  Currently, only streams which have been prepared by LZ4_loadDict() should
+ *  be expected to work.
+ *
+ *  Alternatively, the provided dictionaryStream may be NULL,
+ *  in which case any existing dictionary stream is unset.
+ *
+ *  If a dictionary is provided, it replaces any pre-existing stream history.
+ *  The dictionary contents are the only history that can be referenced and
+ *  logically immediately precede the data compressed in the first subsequent
+ *  compression call.
+ *
+ *  The dictionary will only remain attached to the working stream through the
+ *  first compression call, at the end of which it is cleared. The dictionary
+ *  stream (and source buffer) must remain in-place / accessible / unchanged
+ *  through the completion of the first compression call on the stream.
+ */
+LZ4LIB_STATIC_API void
+LZ4_attach_dictionary(LZ4_stream_t* workingStream,
+                const LZ4_stream_t* dictionaryStream);
+
+
+/*! In-place compression and decompression
+ *
+ * It's possible to have input and output sharing the same buffer,
+ * for highly constrained memory environments.
+ * In both cases, it requires input to lay at the end of the buffer,
+ * and decompression to start at beginning of the buffer.
+ * Buffer size must feature some margin, hence be larger than final size.
+ *
+ * |<------------------------buffer--------------------------------->|
+ *                             |<-----------compressed data--------->|
+ * |<-----------decompressed size------------------>|
+ *                                                  |<----margin---->|
+ *
+ * This technique is more useful for decompression,
+ * since decompressed size is typically larger,
+ * and margin is short.
+ *
+ * In-place decompression will work inside any buffer
+ * which size is >= LZ4_DECOMPRESS_INPLACE_BUFFER_SIZE(decompressedSize).
+ * This presumes that decompressedSize > compressedSize.
+ * Otherwise, it means compression actually expanded data,
+ * and it would be more efficient to store such data with a flag indicating it's not compressed.
+ * This can happen when data is not compressible (already compressed, or encrypted).
+ *
+ * For in-place compression, margin is larger, as it must be able to cope with both
+ * history preservation, requiring input data to remain unmodified up to LZ4_DISTANCE_MAX,
+ * and data expansion, which can happen when input is not compressible.
+ * As a consequence, buffer size requirements are much higher,
+ * and memory savings offered by in-place compression are more limited.
+ *
+ * There are ways to limit this cost for compression :
+ * - Reduce history size, by modifying LZ4_DISTANCE_MAX.
+ *   Note that it is a compile-time constant, so all compressions will apply this limit.
+ *   Lower values will reduce compression ratio, except when input_size < LZ4_DISTANCE_MAX,
+ *   so it's a reasonable trick when inputs are known to be small.
+ * - Require the compressor to deliver a "maximum compressed size".
+ *   This is the `dstCapacity` parameter in `LZ4_compress*()`.
+ *   When this size is < LZ4_COMPRESSBOUND(inputSize), then compression can fail,
+ *   in which case, the return code will be 0 (zero).
+ *   The caller must be ready for these cases to happen,
+ *   and typically design a backup scheme to send data uncompressed.
+ * The combination of both techniques can significantly reduce
+ * the amount of margin required for in-place compression.
+ *
+ * In-place compression can work in any buffer
+ * which size is >= (maxCompressedSize)
+ * with maxCompressedSize == LZ4_COMPRESSBOUND(srcSize) for guaranteed compression success.
+ * LZ4_COMPRESS_INPLACE_BUFFER_SIZE() depends on both maxCompressedSize and LZ4_DISTANCE_MAX,
+ * so it's possible to reduce memory requirements by playing with them.
+ */
+
+#define LZ4_DECOMPRESS_INPLACE_MARGIN(compressedSize)          (((compressedSize) >> 8) + 32)
+#define LZ4_DECOMPRESS_INPLACE_BUFFER_SIZE(decompressedSize)   ((decompressedSize) + LZ4_DECOMPRESS_INPLACE_MARGIN(decompressedSize))  /**< note: presumes that compressedSize < decompressedSize. note2: margin is overestimated a bit, since it could use compressedSize instead */
+
+#ifndef LZ4_DISTANCE_MAX   /* history window size; can be user-defined at compile time */
+#  define LZ4_DISTANCE_MAX 65535   /* set to maximum value by default */
+#endif
+
+#define LZ4_COMPRESS_INPLACE_MARGIN                           (LZ4_DISTANCE_MAX + 32)   /* LZ4_DISTANCE_MAX can be safely replaced by srcSize when it's smaller */
+#define LZ4_COMPRESS_INPLACE_BUFFER_SIZE(maxCompressedSize)   ((maxCompressedSize) + LZ4_COMPRESS_INPLACE_MARGIN)  /**< maxCompressedSize is generally LZ4_COMPRESSBOUND(inputSize), but can be set to any lower value, with the risk that compression can fail (return code 0(zero)) */
+
+#endif   /* LZ4_STATIC_3504398509 */
+#endif   /* LZ4_STATIC_LINKING_ONLY */
+
+
+
+#ifndef LZ4_H_98237428734687
+#define LZ4_H_98237428734687
+
+/*-************************************************************
+ *  Private Definitions
+ **************************************************************
+ * Do not use these definitions directly.
+ * They are only exposed to allow static allocation of `LZ4_stream_t` and `LZ4_streamDecode_t`.
+ * Accessing members will expose user code to API and/or ABI break in future versions of the library.
+ **************************************************************/
+#define LZ4_HASHLOG   (LZ4_MEMORY_USAGE-2)
+#define LZ4_HASHTABLESIZE (1 << LZ4_MEMORY_USAGE)
+#define LZ4_HASH_SIZE_U32 (1 << LZ4_HASHLOG)       /* required as macro for static allocation */
+
+#if defined(__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
+# include <stdint.h>
+  typedef  int8_t  LZ4_i8;
+  typedef uint8_t  LZ4_byte;
+  typedef uint16_t LZ4_u16;
+  typedef uint32_t LZ4_u32;
+#else
+  typedef   signed char  LZ4_i8;
+  typedef unsigned char  LZ4_byte;
+  typedef unsigned short LZ4_u16;
+  typedef unsigned int   LZ4_u32;
+#endif
+
+/*! LZ4_stream_t :
+ *  Never ever use below internal definitions directly !
+ *  These definitions are not API/ABI safe, and may change in future versions.
+ *  If you need static allocation, declare or allocate an LZ4_stream_t object.
+**/
+
+typedef struct LZ4_stream_t_internal LZ4_stream_t_internal;
+struct LZ4_stream_t_internal {
+    LZ4_u32 hashTable[LZ4_HASH_SIZE_U32];
+    const LZ4_byte* dictionary;
+    const LZ4_stream_t_internal* dictCtx;
+    LZ4_u32 currentOffset;
+    LZ4_u32 tableType;
+    LZ4_u32 dictSize;
+    /* Implicit padding to ensure structure is aligned */
+};
+
+#define LZ4_STREAM_MINSIZE  ((1UL << LZ4_MEMORY_USAGE) + 32)  /* static size, for inter-version compatibility */
+union LZ4_stream_u {
+    char minStateSize[LZ4_STREAM_MINSIZE];
+    LZ4_stream_t_internal internal_donotuse;
+}; /* previously typedef'd to LZ4_stream_t */
+
+
+/*! LZ4_initStream() : v1.9.0+
+ *  An LZ4_stream_t structure must be initialized at least once.
+ *  This is automatically done when invoking LZ4_createStream(),
+ *  but it's not when the structure is simply declared on stack (for example).
+ *
+ *  Use LZ4_initStream() to properly initialize a newly declared LZ4_stream_t.
+ *  It can also initialize any arbitrary buffer of sufficient size,
+ *  and will @return a pointer of proper type upon initialization.
+ *
+ *  Note : initialization fails if size and alignment conditions are not respected.
+ *         In which case, the function will @return NULL.
+ *  Note2: An LZ4_stream_t structure guarantees correct alignment and size.
+ *  Note3: Before v1.9.0, use LZ4_resetStream() instead
+**/
+LZ4LIB_API LZ4_stream_t* LZ4_initStream (void* buffer, size_t size);
+
+
+/*! LZ4_streamDecode_t :
+ *  Never ever use below internal definitions directly !
+ *  These definitions are not API/ABI safe, and may change in future versions.
+ *  If you need static allocation, declare or allocate an LZ4_streamDecode_t object.
+**/
+typedef struct {
+    const LZ4_byte* externalDict;
+    const LZ4_byte* prefixEnd;
+    size_t extDictSize;
+    size_t prefixSize;
+} LZ4_streamDecode_t_internal;
+
+#define LZ4_STREAMDECODE_MINSIZE 32
+union LZ4_streamDecode_u {
+    char minStateSize[LZ4_STREAMDECODE_MINSIZE];
+    LZ4_streamDecode_t_internal internal_donotuse;
+} ;   /* previously typedef'd to LZ4_streamDecode_t */
+
+
+
+/*-************************************
+*  Obsolete Functions
+**************************************/
+
+/*! Deprecation warnings
+ *
+ *  Deprecated functions make the compiler generate a warning when invoked.
+ *  This is meant to invite users to update their source code.
+ *  Should deprecation warnings be a problem, it is generally possible to disable them,
+ *  typically with -Wno-deprecated-declarations for gcc
+ *  or _CRT_SECURE_NO_WARNINGS in Visual.
+ *
+ *  Another method is to define LZ4_DISABLE_DEPRECATE_WARNINGS
+ *  before including the header file.
+ */
+#ifdef LZ4_DISABLE_DEPRECATE_WARNINGS
+#  define LZ4_DEPRECATED(message)   /* disable deprecation warnings */
+#else
+#  if defined (__cplusplus) && (__cplusplus >= 201402) /* C++14 or greater */
+#    define LZ4_DEPRECATED(message) [[deprecated(message)]]
+#  elif defined(_MSC_VER)
+#    define LZ4_DEPRECATED(message) __declspec(deprecated(message))
+#  elif defined(__clang__) || (defined(__GNUC__) && (__GNUC__ * 10 + __GNUC_MINOR__ >= 45))
+#    define LZ4_DEPRECATED(message) __attribute__((deprecated(message)))
+#  elif defined(__GNUC__) && (__GNUC__ * 10 + __GNUC_MINOR__ >= 31)
+#    define LZ4_DEPRECATED(message) __attribute__((deprecated))
+#  else
+#    pragma message("WARNING: LZ4_DEPRECATED needs custom implementation for this compiler")
+#    define LZ4_DEPRECATED(message)   /* disabled */
+#  endif
+#endif /* LZ4_DISABLE_DEPRECATE_WARNINGS */
+
+/*! Obsolete compression functions (since v1.7.3) */
+LZ4_DEPRECATED("use LZ4_compress_default() instead")       LZ4LIB_API int LZ4_compress               (const char* src, char* dest, int srcSize);
+LZ4_DEPRECATED("use LZ4_compress_default() instead")       LZ4LIB_API int LZ4_compress_limitedOutput (const char* src, char* dest, int srcSize, int maxOutputSize);
+LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead") LZ4LIB_API int LZ4_compress_withState               (void* state, const char* source, char* dest, int inputSize);
+LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead") LZ4LIB_API int LZ4_compress_limitedOutput_withState (void* state, const char* source, char* dest, int inputSize, int maxOutputSize);
+LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead") LZ4LIB_API int LZ4_compress_continue                (LZ4_stream_t* LZ4_streamPtr, const char* source, char* dest, int inputSize);
+LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead") LZ4LIB_API int LZ4_compress_limitedOutput_continue  (LZ4_stream_t* LZ4_streamPtr, const char* source, char* dest, int inputSize, int maxOutputSize);
+
+/*! Obsolete decompression functions (since v1.8.0) */
+LZ4_DEPRECATED("use LZ4_decompress_fast() instead") LZ4LIB_API int LZ4_uncompress (const char* source, char* dest, int outputSize);
+LZ4_DEPRECATED("use LZ4_decompress_safe() instead") LZ4LIB_API int LZ4_uncompress_unknownOutputSize (const char* source, char* dest, int isize, int maxOutputSize);
+
+/* Obsolete streaming functions (since v1.7.0)
+ * degraded functionality; do not use!
+ *
+ * In order to perform streaming compression, these functions depended on data
+ * that is no longer tracked in the state. They have been preserved as well as
+ * possible: using them will still produce a correct output. However, they don't
+ * actually retain any history between compression calls. The compression ratio
+ * achieved will therefore be no better than compressing each chunk
+ * independently.
+ */
+LZ4_DEPRECATED("Use LZ4_createStream() instead") LZ4LIB_API void* LZ4_create (char* inputBuffer);
+LZ4_DEPRECATED("Use LZ4_createStream() instead") LZ4LIB_API int   LZ4_sizeofStreamState(void);
+LZ4_DEPRECATED("Use LZ4_resetStream() instead")  LZ4LIB_API int   LZ4_resetStreamState(void* state, char* inputBuffer);
+LZ4_DEPRECATED("Use LZ4_saveDict() instead")     LZ4LIB_API char* LZ4_slideInputBuffer (void* state);
+
+/*! Obsolete streaming decoding functions (since v1.7.0) */
+LZ4_DEPRECATED("use LZ4_decompress_safe_usingDict() instead") LZ4LIB_API int LZ4_decompress_safe_withPrefix64k (const char* src, char* dst, int compressedSize, int maxDstSize);
+LZ4_DEPRECATED("use LZ4_decompress_fast_usingDict() instead") LZ4LIB_API int LZ4_decompress_fast_withPrefix64k (const char* src, char* dst, int originalSize);
+
+/*! Obsolete LZ4_decompress_fast variants (since v1.9.0) :
+ *  These functions used to be faster than LZ4_decompress_safe(),
+ *  but this is no longer the case. They are now slower.
+ *  This is because LZ4_decompress_fast() doesn't know the input size,
+ *  and therefore must progress more cautiously into the input buffer to not read beyond the end of block.
+ *  On top of that `LZ4_decompress_fast()` is not protected vs malformed or malicious inputs, making it a security liability.
+ *  As a consequence, LZ4_decompress_fast() is strongly discouraged, and deprecated.
+ *
+ *  The last remaining LZ4_decompress_fast() specificity is that
+ *  it can decompress a block without knowing its compressed size.
+ *  Such functionality can be achieved in a more secure manner
+ *  by employing LZ4_decompress_safe_partial().
+ *
+ *  Parameters:
+ *  originalSize : is the uncompressed size to regenerate.
+ *                 `dst` must be already allocated, its size must be >= 'originalSize' bytes.
+ * @return : number of bytes read from source buffer (== compressed size).
+ *           The function expects to finish at block's end exactly.
+ *           If the source stream is detected malformed, the function stops decoding and returns a negative result.
+ *  note : LZ4_decompress_fast*() requires originalSize. Thanks to this information, it never writes past the output buffer.
+ *         However, since it doesn't know its 'src' size, it may read an unknown amount of input, past input buffer bounds.
+ *         Also, since match offsets are not validated, match reads from 'src' may underflow too.
+ *         These issues never happen if input (compressed) data is correct.
+ *         But they may happen if input data is invalid (error or intentional tampering).
+ *         As a consequence, use these functions in trusted environments with trusted data **only**.
+ */
+LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe() instead")
+LZ4LIB_API int LZ4_decompress_fast (const char* src, char* dst, int originalSize);
+LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_continue() instead")
+LZ4LIB_API int LZ4_decompress_fast_continue (LZ4_streamDecode_t* LZ4_streamDecode, const char* src, char* dst, int originalSize);
+LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_usingDict() instead")
+LZ4LIB_API int LZ4_decompress_fast_usingDict (const char* src, char* dst, int originalSize, const char* dictStart, int dictSize);
+
+/*! LZ4_resetStream() :
+ *  An LZ4_stream_t structure must be initialized at least once.
+ *  This is done with LZ4_initStream(), or LZ4_resetStream().
+ *  Consider switching to LZ4_initStream(),
+ *  invoking LZ4_resetStream() will trigger deprecation warnings in the future.
+ */
+LZ4LIB_API void LZ4_resetStream (LZ4_stream_t* streamPtr);
+
+
+#endif /* LZ4_H_98237428734687 */
+
+
+#if defined (__cplusplus)
+}
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/CMakeLists.txt
new file mode 100644
index 0000000000..5e2199f36e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/CMakeLists.txt
@@ -0,0 +1,37 @@
+set(CMAKE_POSITION_INDEPENDENT_CODE ON)
+
+if(POLICY CMP0063)
+    cmake_policy(SET CMP0063 NEW)
+endif()
+
+include_directories(include)
+
+set(CMAKE_CXX_VISIBILITY_PRESET hidden)
+
+add_library(mbedtls STATIC
+        library/aes.cpp
+        library/aria.cpp
+        library/asn1parse.cpp
+        library/base64.cpp
+        library/bignum.cpp
+        library/camellia.cpp
+        library/cipher.cpp
+        library/cipher_wrap.cpp
+        library/constant_time.cpp
+        library/entropy.cpp
+        library/entropy_poll.cpp
+        library/gcm.cpp
+        library/md.cpp
+        library/oid.cpp
+        library/pem.cpp
+        library/pk.cpp
+        library/pk_wrap.cpp
+        library/pkparse.cpp
+        library/platform_util.cpp
+        library/rsa.cpp
+        library/rsa_alt_helpers.cpp
+        library/sha1.cpp
+        library/sha256.cpp
+        library/sha512.cpp)
+
+set_property(TARGET mbedtls PROPERTY C_STANDARD 99)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/LICENSE
new file mode 100644
index 0000000000..d645695673
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/LICENSE
@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/aes.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/aes.h
new file mode 100644
index 0000000000..49bf0c97cb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/aes.h
@@ -0,0 +1,604 @@
+/**
+ * \file aes.h
+ *
+ * \brief   This file contains AES definitions and functions.
+ *
+ *          The Advanced Encryption Standard (AES) specifies a FIPS-approved
+ *          cryptographic algorithm that can be used to protect electronic
+ *          data.
+ *
+ *          The AES algorithm is a symmetric block cipher that can
+ *          encrypt and decrypt information. For more information, see
+ *          <em>FIPS Publication 197: Advanced Encryption Standard</em> and
+ *          <em>ISO/IEC 18033-2:2006: Information technology -- Security
+ *          techniques -- Encryption algorithms -- Part 2: Asymmetric
+ *          ciphers</em>.
+ *
+ *          The AES-XTS block mode is standardized by NIST SP 800-38E
+ *          <https://nvlpubs.nist.gov/nistpubs/legacy/sp/nistspecialpublication800-38e.pdf>
+ *          and described in detail by IEEE P1619
+ *          <https://ieeexplore.ieee.org/servlet/opac?punumber=4375278>.
+ */
+
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_AES_H
+#define MBEDTLS_AES_H
+#include <stddef.h>
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/private_access.h"
+
+/* padlock.c and aesni.c rely on these values! */
+#define MBEDTLS_AES_ENCRYPT 1 /**< AES encryption. */
+#define MBEDTLS_AES_DECRYPT 0 /**< AES decryption. */
+
+/* Error codes in range 0x0020-0x0022 */
+/** Invalid key length. */
+#define MBEDTLS_ERR_AES_INVALID_KEY_LENGTH -0x0020
+/** Invalid data input length. */
+#define MBEDTLS_ERR_AES_INVALID_INPUT_LENGTH -0x0022
+
+/* Error codes in range 0x0021-0x0025 */
+/** Invalid input data. */
+#define MBEDTLS_ERR_AES_BAD_INPUT_DATA -0x0021
+
+#if (defined(__ARMCC_VERSION) || defined(_MSC_VER)) && !defined(inline) && !defined(__cplusplus)
+#define inline __inline
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_AES_ALT)
+// Regular implementation
+//
+
+/**
+ * \brief The AES context-type definition.
+ */
+typedef struct mbedtls_aes_context {
+    int MBEDTLS_PRIVATE(nr);           /*!< The number of rounds. */
+    uint32_t* MBEDTLS_PRIVATE(rk);     /*!< AES round keys. */
+    uint32_t MBEDTLS_PRIVATE(buf)[68]; /*!< Unaligned data buffer. This buffer can
+                 hold 32 extra Bytes, which can be used for
+                 one of the following purposes:
+                 <ul><li>Alignment if VIA padlock is
+                         used.</li>
+                 <li>Simplifying key expansion in the 256-bit
+                     case by generating an extra round key.
+                     </li></ul> */
+} mbedtls_aes_context;
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+/**
+ * \brief The AES XTS context-type definition.
+ */
+typedef struct mbedtls_aes_xts_context {
+    mbedtls_aes_context MBEDTLS_PRIVATE(crypt); /*!< The AES context to use for AES block
+                                        encryption or decryption. */
+    mbedtls_aes_context MBEDTLS_PRIVATE(tweak); /*!< The AES context used for tweak
+                                        computation. */
+} mbedtls_aes_xts_context;
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+#else /* MBEDTLS_AES_ALT */
+#include "mbedtls/aes_alt.h"
+#endif /* MBEDTLS_AES_ALT */
+
+/**
+ * \brief          This function initializes the specified AES context.
+ *
+ *                 It must be the first API called before using
+ *                 the context.
+ *
+ * \param ctx      The AES context to initialize. This must not be \c NULL.
+ */
+void mbedtls_aes_init(mbedtls_aes_context* ctx);
+
+/**
+ * \brief          This function releases and clears the specified AES context.
+ *
+ * \param ctx      The AES context to clear.
+ *                 If this is \c NULL, this function does nothing.
+ *                 Otherwise, the context must have been at least initialized.
+ */
+void mbedtls_aes_free(mbedtls_aes_context* ctx);
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+/**
+ * \brief          This function initializes the specified AES XTS context.
+ *
+ *                 It must be the first API called before using
+ *                 the context.
+ *
+ * \param ctx      The AES XTS context to initialize. This must not be \c NULL.
+ */
+void mbedtls_aes_xts_init(mbedtls_aes_xts_context* ctx);
+
+/**
+ * \brief          This function releases and clears the specified AES XTS context.
+ *
+ * \param ctx      The AES XTS context to clear.
+ *                 If this is \c NULL, this function does nothing.
+ *                 Otherwise, the context must have been at least initialized.
+ */
+void mbedtls_aes_xts_free(mbedtls_aes_xts_context* ctx);
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+/**
+ * \brief          This function sets the encryption key.
+ *
+ * \param ctx      The AES context to which the key should be bound.
+ *                 It must be initialized.
+ * \param key      The encryption key.
+ *                 This must be a readable buffer of size \p keybits bits.
+ * \param keybits  The size of data passed in bits. Valid options are:
+ *                 <ul><li>128 bits</li>
+ *                 <li>192 bits</li>
+ *                 <li>256 bits</li></ul>
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_AES_INVALID_KEY_LENGTH on failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_setkey_enc(mbedtls_aes_context* ctx, const unsigned char* key,
+    unsigned int keybits);
+
+/**
+ * \brief          This function sets the decryption key.
+ *
+ * \param ctx      The AES context to which the key should be bound.
+ *                 It must be initialized.
+ * \param key      The decryption key.
+ *                 This must be a readable buffer of size \p keybits bits.
+ * \param keybits  The size of data passed. Valid options are:
+ *                 <ul><li>128 bits</li>
+ *                 <li>192 bits</li>
+ *                 <li>256 bits</li></ul>
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_AES_INVALID_KEY_LENGTH on failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_setkey_dec(mbedtls_aes_context* ctx, const unsigned char* key,
+    unsigned int keybits);
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+/**
+ * \brief          This function prepares an XTS context for encryption and
+ *                 sets the encryption key.
+ *
+ * \param ctx      The AES XTS context to which the key should be bound.
+ *                 It must be initialized.
+ * \param key      The encryption key. This is comprised of the XTS key1
+ *                 concatenated with the XTS key2.
+ *                 This must be a readable buffer of size \p keybits bits.
+ * \param keybits  The size of \p key passed in bits. Valid options are:
+ *                 <ul><li>256 bits (each of key1 and key2 is a 128-bit key)</li>
+ *                 <li>512 bits (each of key1 and key2 is a 256-bit key)</li></ul>
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_AES_INVALID_KEY_LENGTH on failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_xts_setkey_enc(mbedtls_aes_xts_context* ctx, const unsigned char* key,
+    unsigned int keybits);
+
+/**
+ * \brief          This function prepares an XTS context for decryption and
+ *                 sets the decryption key.
+ *
+ * \param ctx      The AES XTS context to which the key should be bound.
+ *                 It must be initialized.
+ * \param key      The decryption key. This is comprised of the XTS key1
+ *                 concatenated with the XTS key2.
+ *                 This must be a readable buffer of size \p keybits bits.
+ * \param keybits  The size of \p key passed in bits. Valid options are:
+ *                 <ul><li>256 bits (each of key1 and key2 is a 128-bit key)</li>
+ *                 <li>512 bits (each of key1 and key2 is a 256-bit key)</li></ul>
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_AES_INVALID_KEY_LENGTH on failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_xts_setkey_dec(mbedtls_aes_xts_context* ctx, const unsigned char* key,
+    unsigned int keybits);
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+/**
+* \brief          This function performs an AES single-block encryption or
+*                 decryption operation.
+*
+*                 It performs the operation defined in the \p mode parameter
+*                 (encrypt or decrypt), on the input data buffer defined in
+*                 the \p input parameter.
+*
+*                 mbedtls_aes_init(), and either mbedtls_aes_setkey_enc() or
+*                 mbedtls_aes_setkey_dec() must be called before the first
+*                 call to this API with the same context.
+*
+* \param ctx      The AES context to use for encryption or decryption.
+*                 It must be initialized and bound to a key.
+* \param mode     The AES operation: #MBEDTLS_AES_ENCRYPT or
+*                 #MBEDTLS_AES_DECRYPT.
+* \param input    The buffer holding the input data.
+*                 It must be readable and at least \c 16 Bytes long.
+* \param output   The buffer where the output data will be written.
+*                 It must be writeable and at least \c 16 Bytes long.
+
+* \return         \c 0 on success.
+*/
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_crypt_ecb(mbedtls_aes_context* ctx, int mode, const unsigned char input[16],
+    unsigned char output[16]);
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+/**
+ * \brief  This function performs an AES-CBC encryption or decryption operation
+ *         on full blocks.
+ *
+ *         It performs the operation defined in the \p mode
+ *         parameter (encrypt/decrypt), on the input data buffer defined in
+ *         the \p input parameter.
+ *
+ *         It can be called as many times as needed, until all the input
+ *         data is processed. mbedtls_aes_init(), and either
+ *         mbedtls_aes_setkey_enc() or mbedtls_aes_setkey_dec() must be called
+ *         before the first call to this API with the same context.
+ *
+ * \note   This function operates on full blocks, that is, the input size
+ *         must be a multiple of the AES block size of \c 16 Bytes.
+ *
+ * \note   Upon exit, the content of the IV is updated so that you can
+ *         call the same function again on the next
+ *         block(s) of data and get the same result as if it was
+ *         encrypted in one call. This allows a "streaming" usage.
+ *         If you need to retain the contents of the IV, you should
+ *         either save it manually or use the cipher module instead.
+ *
+ *
+ * \param ctx      The AES context to use for encryption or decryption.
+ *                 It must be initialized and bound to a key.
+ * \param mode     The AES operation: #MBEDTLS_AES_ENCRYPT or
+ *                 #MBEDTLS_AES_DECRYPT.
+ * \param length   The length of the input data in Bytes. This must be a
+ *                 multiple of the block size (\c 16 Bytes).
+ * \param iv       Initialization vector (updated after use).
+ *                 It must be a readable and writeable buffer of \c 16 Bytes.
+ * \param input    The buffer holding the input data.
+ *                 It must be readable and of size \p length Bytes.
+ * \param output   The buffer holding the output data.
+ *                 It must be writeable and of size \p length Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_AES_INVALID_INPUT_LENGTH
+ *                 on failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_crypt_cbc(mbedtls_aes_context* ctx, int mode, size_t length, unsigned char iv[16],
+    const unsigned char* input, unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+/**
+ * \brief      This function performs an AES-XTS encryption or decryption
+ *             operation for an entire XTS data unit.
+ *
+ *             AES-XTS encrypts or decrypts blocks based on their location as
+ *             defined by a data unit number. The data unit number must be
+ *             provided by \p data_unit.
+ *
+ *             NIST SP 800-38E limits the maximum size of a data unit to 2^20
+ *             AES blocks. If the data unit is larger than this, this function
+ *             returns #MBEDTLS_ERR_AES_INVALID_INPUT_LENGTH.
+ *
+ * \param ctx          The AES XTS context to use for AES XTS operations.
+ *                     It must be initialized and bound to a key.
+ * \param mode         The AES operation: #MBEDTLS_AES_ENCRYPT or
+ *                     #MBEDTLS_AES_DECRYPT.
+ * \param length       The length of a data unit in Bytes. This can be any
+ *                     length between 16 bytes and 2^24 bytes inclusive
+ *                     (between 1 and 2^20 block cipher blocks).
+ * \param data_unit    The address of the data unit encoded as an array of 16
+ *                     bytes in little-endian format. For disk encryption, this
+ *                     is typically the index of the block device sector that
+ *                     contains the data.
+ * \param input        The buffer holding the input data (which is an entire
+ *                     data unit). This function reads \p length Bytes from \p
+ *                     input.
+ * \param output       The buffer holding the output data (which is an entire
+ *                     data unit). This function writes \p length Bytes to \p
+ *                     output.
+ *
+ * \return             \c 0 on success.
+ * \return             #MBEDTLS_ERR_AES_INVALID_INPUT_LENGTH if \p length is
+ *                     smaller than an AES block in size (16 Bytes) or if \p
+ *                     length is larger than 2^20 blocks (16 MiB).
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_crypt_xts(mbedtls_aes_xts_context* ctx, int mode, size_t length,
+    const unsigned char data_unit[16], const unsigned char* input, unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+/**
+ * \brief This function performs an AES-CFB128 encryption or decryption
+ *        operation.
+ *
+ *        It performs the operation defined in the \p mode
+ *        parameter (encrypt or decrypt), on the input data buffer
+ *        defined in the \p input parameter.
+ *
+ *        For CFB, you must set up the context with mbedtls_aes_setkey_enc(),
+ *        regardless of whether you are performing an encryption or decryption
+ *        operation, that is, regardless of the \p mode parameter. This is
+ *        because CFB mode uses the same key schedule for encryption and
+ *        decryption.
+ *
+ * \note  Upon exit, the content of the IV is updated so that you can
+ *        call the same function again on the next
+ *        block(s) of data and get the same result as if it was
+ *        encrypted in one call. This allows a "streaming" usage.
+ *        If you need to retain the contents of the
+ *        IV, you must either save it manually or use the cipher
+ *        module instead.
+ *
+ *
+ * \param ctx      The AES context to use for encryption or decryption.
+ *                 It must be initialized and bound to a key.
+ * \param mode     The AES operation: #MBEDTLS_AES_ENCRYPT or
+ *                 #MBEDTLS_AES_DECRYPT.
+ * \param length   The length of the input data in Bytes.
+ * \param iv_off   The offset in IV (updated after use).
+ *                 It must point to a valid \c size_t.
+ * \param iv       The initialization vector (updated after use).
+ *                 It must be a readable and writeable buffer of \c 16 Bytes.
+ * \param input    The buffer holding the input data.
+ *                 It must be readable and of size \p length Bytes.
+ * \param output   The buffer holding the output data.
+ *                 It must be writeable and of size \p length Bytes.
+ *
+ * \return         \c 0 on success.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_crypt_cfb128(mbedtls_aes_context* ctx, int mode, size_t length, size_t* iv_off,
+    unsigned char iv[16], const unsigned char* input, unsigned char* output);
+
+/**
+ * \brief This function performs an AES-CFB8 encryption or decryption
+ *        operation.
+ *
+ *        It performs the operation defined in the \p mode
+ *        parameter (encrypt/decrypt), on the input data buffer defined
+ *        in the \p input parameter.
+ *
+ *        Due to the nature of CFB, you must use the same key schedule for
+ *        both encryption and decryption operations. Therefore, you must
+ *        use the context initialized with mbedtls_aes_setkey_enc() for
+ *        both #MBEDTLS_AES_ENCRYPT and #MBEDTLS_AES_DECRYPT.
+ *
+ * \note  Upon exit, the content of the IV is updated so that you can
+ *        call the same function again on the next
+ *        block(s) of data and get the same result as if it was
+ *        encrypted in one call. This allows a "streaming" usage.
+ *        If you need to retain the contents of the
+ *        IV, you should either save it manually or use the cipher
+ *        module instead.
+ *
+ *
+ * \param ctx      The AES context to use for encryption or decryption.
+ *                 It must be initialized and bound to a key.
+ * \param mode     The AES operation: #MBEDTLS_AES_ENCRYPT or
+ *                 #MBEDTLS_AES_DECRYPT
+ * \param length   The length of the input data.
+ * \param iv       The initialization vector (updated after use).
+ *                 It must be a readable and writeable buffer of \c 16 Bytes.
+ * \param input    The buffer holding the input data.
+ *                 It must be readable and of size \p length Bytes.
+ * \param output   The buffer holding the output data.
+ *                 It must be writeable and of size \p length Bytes.
+ *
+ * \return         \c 0 on success.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_crypt_cfb8(mbedtls_aes_context* ctx, int mode, size_t length, unsigned char iv[16],
+    const unsigned char* input, unsigned char* output);
+#endif /*MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+/**
+ * \brief       This function performs an AES-OFB (Output Feedback Mode)
+ *              encryption or decryption operation.
+ *
+ *              For OFB, you must set up the context with
+ *              mbedtls_aes_setkey_enc(), regardless of whether you are
+ *              performing an encryption or decryption operation. This is
+ *              because OFB mode uses the same key schedule for encryption and
+ *              decryption.
+ *
+ *              The OFB operation is identical for encryption or decryption,
+ *              therefore no operation mode needs to be specified.
+ *
+ * \note        Upon exit, the content of iv, the Initialisation Vector, is
+ *              updated so that you can call the same function again on the next
+ *              block(s) of data and get the same result as if it was encrypted
+ *              in one call. This allows a "streaming" usage, by initialising
+ *              iv_off to 0 before the first call, and preserving its value
+ *              between calls.
+ *
+ *              For non-streaming use, the iv should be initialised on each call
+ *              to a unique value, and iv_off set to 0 on each call.
+ *
+ *              If you need to retain the contents of the initialisation vector,
+ *              you must either save it manually or use the cipher module
+ *              instead.
+ *
+ * \warning     For the OFB mode, the initialisation vector must be unique
+ *              every encryption operation. Reuse of an initialisation vector
+ *              will compromise security.
+ *
+ * \param ctx      The AES context to use for encryption or decryption.
+ *                 It must be initialized and bound to a key.
+ * \param length   The length of the input data.
+ * \param iv_off   The offset in IV (updated after use).
+ *                 It must point to a valid \c size_t.
+ * \param iv       The initialization vector (updated after use).
+ *                 It must be a readable and writeable buffer of \c 16 Bytes.
+ * \param input    The buffer holding the input data.
+ *                 It must be readable and of size \p length Bytes.
+ * \param output   The buffer holding the output data.
+ *                 It must be writeable and of size \p length Bytes.
+ *
+ * \return         \c 0 on success.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_crypt_ofb(mbedtls_aes_context* ctx, size_t length, size_t* iv_off,
+    unsigned char iv[16], const unsigned char* input, unsigned char* output);
+
+#endif /* MBEDTLS_CIPHER_MODE_OFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+/**
+ * \brief      This function performs an AES-CTR encryption or decryption
+ *             operation.
+ *
+ *             Due to the nature of CTR, you must use the same key schedule
+ *             for both encryption and decryption operations. Therefore, you
+ *             must use the context initialized with mbedtls_aes_setkey_enc()
+ *             for both #MBEDTLS_AES_ENCRYPT and #MBEDTLS_AES_DECRYPT.
+ *
+ * \warning    You must never reuse a nonce value with the same key. Doing so
+ *             would void the encryption for the two messages encrypted with
+ *             the same nonce and key.
+ *
+ *             There are two common strategies for managing nonces with CTR:
+ *
+ *             1. You can handle everything as a single message processed over
+ *             successive calls to this function. In that case, you want to
+ *             set \p nonce_counter and \p nc_off to 0 for the first call, and
+ *             then preserve the values of \p nonce_counter, \p nc_off and \p
+ *             stream_block across calls to this function as they will be
+ *             updated by this function.
+ *
+ *             With this strategy, you must not encrypt more than 2**128
+ *             blocks of data with the same key.
+ *
+ *             2. You can encrypt separate messages by dividing the \p
+ *             nonce_counter buffer in two areas: the first one used for a
+ *             per-message nonce, handled by yourself, and the second one
+ *             updated by this function internally.
+ *
+ *             For example, you might reserve the first 12 bytes for the
+ *             per-message nonce, and the last 4 bytes for internal use. In that
+ *             case, before calling this function on a new message you need to
+ *             set the first 12 bytes of \p nonce_counter to your chosen nonce
+ *             value, the last 4 to 0, and \p nc_off to 0 (which will cause \p
+ *             stream_block to be ignored). That way, you can encrypt at most
+ *             2**96 messages of up to 2**32 blocks each with the same key.
+ *
+ *             The per-message nonce (or information sufficient to reconstruct
+ *             it) needs to be communicated with the ciphertext and must be unique.
+ *             The recommended way to ensure uniqueness is to use a message
+ *             counter. An alternative is to generate random nonces, but this
+ *             limits the number of messages that can be securely encrypted:
+ *             for example, with 96-bit random nonces, you should not encrypt
+ *             more than 2**32 messages with the same key.
+ *
+ *             Note that for both stategies, sizes are measured in blocks and
+ *             that an AES block is 16 bytes.
+ *
+ * \warning    Upon return, \p stream_block contains sensitive data. Its
+ *             content must not be written to insecure storage and should be
+ *             securely discarded as soon as it's no longer needed.
+ *
+ * \param ctx              The AES context to use for encryption or decryption.
+ *                         It must be initialized and bound to a key.
+ * \param length           The length of the input data.
+ * \param nc_off           The offset in the current \p stream_block, for
+ *                         resuming within the current cipher stream. The
+ *                         offset pointer should be 0 at the start of a stream.
+ *                         It must point to a valid \c size_t.
+ * \param nonce_counter    The 128-bit nonce and counter.
+ *                         It must be a readable-writeable buffer of \c 16 Bytes.
+ * \param stream_block     The saved stream block for resuming. This is
+ *                         overwritten by the function.
+ *                         It must be a readable-writeable buffer of \c 16 Bytes.
+ * \param input            The buffer holding the input data.
+ *                         It must be readable and of size \p length Bytes.
+ * \param output           The buffer holding the output data.
+ *                         It must be writeable and of size \p length Bytes.
+ *
+ * \return                 \c 0 on success.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_aes_crypt_ctr(mbedtls_aes_context* ctx, size_t length, size_t* nc_off,
+    unsigned char nonce_counter[16], unsigned char stream_block[16], const unsigned char* input,
+    unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+/**
+ * \brief           Internal AES block encryption function. This is only
+ *                  exposed to allow overriding it using
+ *                  \c MBEDTLS_AES_ENCRYPT_ALT.
+ *
+ * \param ctx       The AES context to use for encryption.
+ * \param input     The plaintext block.
+ * \param output    The output (ciphertext) block.
+ *
+ * \return          \c 0 on success.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_internal_aes_encrypt(mbedtls_aes_context* ctx, const unsigned char input[16],
+    unsigned char output[16]);
+
+/**
+ * \brief           Internal AES block decryption function. This is only
+ *                  exposed to allow overriding it using see
+ *                  \c MBEDTLS_AES_DECRYPT_ALT.
+ *
+ * \param ctx       The AES context to use for decryption.
+ * \param input     The ciphertext block.
+ * \param output    The output (plaintext) block.
+ *
+ * \return          \c 0 on success.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_internal_aes_decrypt(mbedtls_aes_context* ctx, const unsigned char input[16],
+    unsigned char output[16]);
+
+#if defined(MBEDTLS_SELF_TEST)
+/**
+ * \brief          Checkup routine.
+ *
+ * \return         \c 0 on success.
+ * \return         \c 1 on failure.
+ */
+MBEDTLS_CHECK_RETURN_CRITICAL
+int mbedtls_aes_self_test(int verbose);
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* aes.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/aria.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/aria.h
new file mode 100644
index 0000000000..93b62ab30e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/aria.h
@@ -0,0 +1,340 @@
+/**
+ * \file aria.h
+ *
+ * \brief ARIA block cipher
+ *
+ *        The ARIA algorithm is a symmetric block cipher that can encrypt and
+ *        decrypt information. It is defined by the Korean Agency for
+ *        Technology and Standards (KATS) in <em>KS X 1213:2004</em> (in
+ *        Korean, but see http://210.104.33.10/ARIA/index-e.html in English)
+ *        and also described by the IETF in <em>RFC 5794</em>.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_ARIA_H
+#define MBEDTLS_ARIA_H
+#include <stddef.h>
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/private_access.h"
+
+#define MBEDTLS_ARIA_ENCRYPT 1 /**< ARIA encryption. */
+#define MBEDTLS_ARIA_DECRYPT 0 /**< ARIA decryption. */
+
+#define MBEDTLS_ARIA_BLOCKSIZE 16   /**< ARIA block size in bytes. */
+#define MBEDTLS_ARIA_MAX_ROUNDS 16  /**< Maxiumum number of rounds in ARIA. */
+#define MBEDTLS_ARIA_MAX_KEYSIZE 32 /**< Maximum size of an ARIA key in bytes. */
+
+/** Bad input data. */
+#define MBEDTLS_ERR_ARIA_BAD_INPUT_DATA -0x005C
+
+/** Invalid data input length. */
+#define MBEDTLS_ERR_ARIA_INVALID_INPUT_LENGTH -0x005E
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_ARIA_ALT)
+// Regular implementation
+//
+
+/**
+ * \brief The ARIA context-type definition.
+ */
+typedef struct mbedtls_aria_context {
+    unsigned char MBEDTLS_PRIVATE(nr); /*!< The number of rounds (12, 14 or 16) */
+    /*! The ARIA round keys. */
+    uint32_t MBEDTLS_PRIVATE(rk)[MBEDTLS_ARIA_MAX_ROUNDS + 1][MBEDTLS_ARIA_BLOCKSIZE / 4];
+} mbedtls_aria_context;
+
+#else /* MBEDTLS_ARIA_ALT */
+#include "mbedtls/aria_alt.h"
+#endif /* MBEDTLS_ARIA_ALT */
+
+/**
+ * \brief          This function initializes the specified ARIA context.
+ *
+ *                 It must be the first API called before using
+ *                 the context.
+ *
+ * \param ctx      The ARIA context to initialize. This must not be \c NULL.
+ */
+void mbedtls_aria_init(mbedtls_aria_context* ctx);
+
+/**
+ * \brief          This function releases and clears the specified ARIA context.
+ *
+ * \param ctx      The ARIA context to clear. This may be \c NULL, in which
+ *                 case this function returns immediately. If it is not \c NULL,
+ *                 it must point to an initialized ARIA context.
+ */
+void mbedtls_aria_free(mbedtls_aria_context* ctx);
+
+/**
+ * \brief          This function sets the encryption key.
+ *
+ * \param ctx      The ARIA context to which the key should be bound.
+ *                 This must be initialized.
+ * \param key      The encryption key. This must be a readable buffer
+ *                 of size \p keybits Bits.
+ * \param keybits  The size of \p key in Bits. Valid options are:
+ *                 <ul><li>128 bits</li>
+ *                 <li>192 bits</li>
+ *                 <li>256 bits</li></ul>
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_aria_setkey_enc(mbedtls_aria_context* ctx, const unsigned char* key,
+    unsigned int keybits);
+
+/**
+ * \brief          This function sets the decryption key.
+ *
+ * \param ctx      The ARIA context to which the key should be bound.
+ *                 This must be initialized.
+ * \param key      The decryption key. This must be a readable buffer
+ *                 of size \p keybits Bits.
+ * \param keybits  The size of data passed. Valid options are:
+ *                 <ul><li>128 bits</li>
+ *                 <li>192 bits</li>
+ *                 <li>256 bits</li></ul>
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_aria_setkey_dec(mbedtls_aria_context* ctx, const unsigned char* key,
+    unsigned int keybits);
+
+/**
+ * \brief          This function performs an ARIA single-block encryption or
+ *                 decryption operation.
+ *
+ *                 It performs encryption or decryption (depending on whether
+ *                 the key was set for encryption on decryption) on the input
+ *                 data buffer defined in the \p input parameter.
+ *
+ *                 mbedtls_aria_init(), and either mbedtls_aria_setkey_enc() or
+ *                 mbedtls_aria_setkey_dec() must be called before the first
+ *                 call to this API with the same context.
+ *
+ * \param ctx      The ARIA context to use for encryption or decryption.
+ *                 This must be initialized and bound to a key.
+ * \param input    The 16-Byte buffer holding the input data.
+ * \param output   The 16-Byte buffer holding the output data.
+
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_aria_crypt_ecb(mbedtls_aria_context* ctx,
+    const unsigned char input[MBEDTLS_ARIA_BLOCKSIZE],
+    unsigned char output[MBEDTLS_ARIA_BLOCKSIZE]);
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+/**
+ * \brief  This function performs an ARIA-CBC encryption or decryption operation
+ *         on full blocks.
+ *
+ *         It performs the operation defined in the \p mode
+ *         parameter (encrypt/decrypt), on the input data buffer defined in
+ *         the \p input parameter.
+ *
+ *         It can be called as many times as needed, until all the input
+ *         data is processed. mbedtls_aria_init(), and either
+ *         mbedtls_aria_setkey_enc() or mbedtls_aria_setkey_dec() must be called
+ *         before the first call to this API with the same context.
+ *
+ * \note   This function operates on aligned blocks, that is, the input size
+ *         must be a multiple of the ARIA block size of 16 Bytes.
+ *
+ * \note   Upon exit, the content of the IV is updated so that you can
+ *         call the same function again on the next
+ *         block(s) of data and get the same result as if it was
+ *         encrypted in one call. This allows a "streaming" usage.
+ *         If you need to retain the contents of the IV, you should
+ *         either save it manually or use the cipher module instead.
+ *
+ *
+ * \param ctx      The ARIA context to use for encryption or decryption.
+ *                 This must be initialized and bound to a key.
+ * \param mode     The mode of operation. This must be either
+ *                 #MBEDTLS_ARIA_ENCRYPT for encryption, or
+ *                 #MBEDTLS_ARIA_DECRYPT for decryption.
+ * \param length   The length of the input data in Bytes. This must be a
+ *                 multiple of the block size (16 Bytes).
+ * \param iv       Initialization vector (updated after use).
+ *                 This must be a readable buffer of size 16 Bytes.
+ * \param input    The buffer holding the input data. This must
+ *                 be a readable buffer of length \p length Bytes.
+ * \param output   The buffer holding the output data. This must
+ *                 be a writable buffer of length \p length Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_aria_crypt_cbc(mbedtls_aria_context* ctx, int mode, size_t length,
+    unsigned char iv[MBEDTLS_ARIA_BLOCKSIZE], const unsigned char* input, unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+/**
+ * \brief This function performs an ARIA-CFB128 encryption or decryption
+ *        operation.
+ *
+ *        It performs the operation defined in the \p mode
+ *        parameter (encrypt or decrypt), on the input data buffer
+ *        defined in the \p input parameter.
+ *
+ *        For CFB, you must set up the context with mbedtls_aria_setkey_enc(),
+ *        regardless of whether you are performing an encryption or decryption
+ *        operation, that is, regardless of the \p mode parameter. This is
+ *        because CFB mode uses the same key schedule for encryption and
+ *        decryption.
+ *
+ * \note  Upon exit, the content of the IV is updated so that you can
+ *        call the same function again on the next
+ *        block(s) of data and get the same result as if it was
+ *        encrypted in one call. This allows a "streaming" usage.
+ *        If you need to retain the contents of the
+ *        IV, you must either save it manually or use the cipher
+ *        module instead.
+ *
+ *
+ * \param ctx      The ARIA context to use for encryption or decryption.
+ *                 This must be initialized and bound to a key.
+ * \param mode     The mode of operation. This must be either
+ *                 #MBEDTLS_ARIA_ENCRYPT for encryption, or
+ *                 #MBEDTLS_ARIA_DECRYPT for decryption.
+ * \param length   The length of the input data \p input in Bytes.
+ * \param iv_off   The offset in IV (updated after use).
+ *                 This must not be larger than 15.
+ * \param iv       The initialization vector (updated after use).
+ *                 This must be a readable buffer of size 16 Bytes.
+ * \param input    The buffer holding the input data. This must
+ *                 be a readable buffer of length \p length Bytes.
+ * \param output   The buffer holding the output data. This must
+ *                 be a writable buffer of length \p length Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_aria_crypt_cfb128(mbedtls_aria_context* ctx, int mode, size_t length, size_t* iv_off,
+    unsigned char iv[MBEDTLS_ARIA_BLOCKSIZE], const unsigned char* input, unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+/**
+ * \brief      This function performs an ARIA-CTR encryption or decryption
+ *             operation.
+ *
+ *             This function performs the operation defined in the \p mode
+ *             parameter (encrypt/decrypt), on the input data buffer
+ *             defined in the \p input parameter.
+ *
+ *             Due to the nature of CTR, you must use the same key schedule
+ *             for both encryption and decryption operations. Therefore, you
+ *             must use the context initialized with mbedtls_aria_setkey_enc()
+ *             for both #MBEDTLS_ARIA_ENCRYPT and #MBEDTLS_ARIA_DECRYPT.
+ *
+ * \warning    You must never reuse a nonce value with the same key. Doing so
+ *             would void the encryption for the two messages encrypted with
+ *             the same nonce and key.
+ *
+ *             There are two common strategies for managing nonces with CTR:
+ *
+ *             1. You can handle everything as a single message processed over
+ *             successive calls to this function. In that case, you want to
+ *             set \p nonce_counter and \p nc_off to 0 for the first call, and
+ *             then preserve the values of \p nonce_counter, \p nc_off and \p
+ *             stream_block across calls to this function as they will be
+ *             updated by this function.
+ *
+ *             With this strategy, you must not encrypt more than 2**128
+ *             blocks of data with the same key.
+ *
+ *             2. You can encrypt separate messages by dividing the \p
+ *             nonce_counter buffer in two areas: the first one used for a
+ *             per-message nonce, handled by yourself, and the second one
+ *             updated by this function internally.
+ *
+ *             For example, you might reserve the first 12 bytes for the
+ *             per-message nonce, and the last 4 bytes for internal use. In that
+ *             case, before calling this function on a new message you need to
+ *             set the first 12 bytes of \p nonce_counter to your chosen nonce
+ *             value, the last 4 to 0, and \p nc_off to 0 (which will cause \p
+ *             stream_block to be ignored). That way, you can encrypt at most
+ *             2**96 messages of up to 2**32 blocks each with the same key.
+ *
+ *             The per-message nonce (or information sufficient to reconstruct
+ *             it) needs to be communicated with the ciphertext and must be unique.
+ *             The recommended way to ensure uniqueness is to use a message
+ *             counter. An alternative is to generate random nonces, but this
+ *             limits the number of messages that can be securely encrypted:
+ *             for example, with 96-bit random nonces, you should not encrypt
+ *             more than 2**32 messages with the same key.
+ *
+ *             Note that for both stategies, sizes are measured in blocks and
+ *             that an ARIA block is 16 bytes.
+ *
+ * \warning    Upon return, \p stream_block contains sensitive data. Its
+ *             content must not be written to insecure storage and should be
+ *             securely discarded as soon as it's no longer needed.
+ *
+ * \param ctx              The ARIA context to use for encryption or decryption.
+ *                         This must be initialized and bound to a key.
+ * \param length           The length of the input data \p input in Bytes.
+ * \param nc_off           The offset in Bytes in the current \p stream_block,
+ *                         for resuming within the current cipher stream. The
+ *                         offset pointer should be \c 0 at the start of a
+ *                         stream. This must not be larger than \c 15 Bytes.
+ * \param nonce_counter    The 128-bit nonce and counter. This must point to
+ *                         a read/write buffer of length \c 16 bytes.
+ * \param stream_block     The saved stream block for resuming. This must
+ *                         point to a read/write buffer of length \c 16 bytes.
+ *                         This is overwritten by the function.
+ * \param input            The buffer holding the input data. This must
+ *                         be a readable buffer of length \p length Bytes.
+ * \param output           The buffer holding the output data. This must
+ *                         be a writable buffer of length \p length Bytes.
+ *
+ * \return                 \c 0 on success.
+ * \return                 A negative error code on failure.
+ */
+int mbedtls_aria_crypt_ctr(mbedtls_aria_context* ctx, size_t length, size_t* nc_off,
+    unsigned char nonce_counter[MBEDTLS_ARIA_BLOCKSIZE],
+    unsigned char stream_block[MBEDTLS_ARIA_BLOCKSIZE], const unsigned char* input,
+    unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#if defined(MBEDTLS_SELF_TEST)
+/**
+ * \brief          Checkup routine.
+ *
+ * \return         \c 0 on success, or \c 1 on failure.
+ */
+int mbedtls_aria_self_test(int verbose);
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* aria.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/asn1.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/asn1.h
new file mode 100644
index 0000000000..69f0c0cc2b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/asn1.h
@@ -0,0 +1,599 @@
+/**
+ * \file asn1.h
+ *
+ * \brief Generic ASN.1 parsing
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_ASN1_H
+#define MBEDTLS_ASN1_H
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/private_access.h"
+
+#if defined(MBEDTLS_BIGNUM_C)
+#include "mbedtls/bignum.h"
+#endif
+
+/**
+ * \addtogroup asn1_module
+ * \{
+ */
+
+/**
+ * \name ASN1 Error codes
+ * These error codes are OR'ed to X509 error codes for
+ * higher error granularity.
+ * ASN1 is a standard to specify data structures.
+ * \{
+ */
+/** Out of data when parsing an ASN1 data structure. */
+#define MBEDTLS_ERR_ASN1_OUT_OF_DATA -0x0060
+/** ASN1 tag was of an unexpected value. */
+#define MBEDTLS_ERR_ASN1_UNEXPECTED_TAG -0x0062
+/** Error when trying to determine the length or invalid length. */
+#define MBEDTLS_ERR_ASN1_INVALID_LENGTH -0x0064
+/** Actual length differs from expected length. */
+#define MBEDTLS_ERR_ASN1_LENGTH_MISMATCH -0x0066
+/** Data is invalid. */
+#define MBEDTLS_ERR_ASN1_INVALID_DATA -0x0068
+/** Memory allocation failed */
+#define MBEDTLS_ERR_ASN1_ALLOC_FAILED -0x006A
+/** Buffer too small when writing ASN.1 data structure. */
+#define MBEDTLS_ERR_ASN1_BUF_TOO_SMALL -0x006C
+
+/* \} name */
+
+/**
+ * \name DER constants
+ * These constants comply with the DER encoded ASN.1 type tags.
+ * DER encoding uses hexadecimal representation.
+ * An example DER sequence is:\n
+ * - 0x02 -- tag indicating INTEGER
+ * - 0x01 -- length in octets
+ * - 0x05 -- value
+ * Such sequences are typically read into \c ::mbedtls_x509_buf.
+ * \{
+ */
+#define MBEDTLS_ASN1_BOOLEAN 0x01
+#define MBEDTLS_ASN1_INTEGER 0x02
+#define MBEDTLS_ASN1_BIT_STRING 0x03
+#define MBEDTLS_ASN1_OCTET_STRING 0x04
+#define MBEDTLS_ASN1_NULL 0x05
+#define MBEDTLS_ASN1_OID 0x06
+#define MBEDTLS_ASN1_ENUMERATED 0x0A
+#define MBEDTLS_ASN1_UTF8_STRING 0x0C
+#define MBEDTLS_ASN1_SEQUENCE 0x10
+#define MBEDTLS_ASN1_SET 0x11
+#define MBEDTLS_ASN1_PRINTABLE_STRING 0x13
+#define MBEDTLS_ASN1_T61_STRING 0x14
+#define MBEDTLS_ASN1_IA5_STRING 0x16
+#define MBEDTLS_ASN1_UTC_TIME 0x17
+#define MBEDTLS_ASN1_GENERALIZED_TIME 0x18
+#define MBEDTLS_ASN1_UNIVERSAL_STRING 0x1C
+#define MBEDTLS_ASN1_BMP_STRING 0x1E
+#define MBEDTLS_ASN1_PRIMITIVE 0x00
+#define MBEDTLS_ASN1_CONSTRUCTED 0x20
+#define MBEDTLS_ASN1_CONTEXT_SPECIFIC 0x80
+
+/* Slightly smaller way to check if tag is a string tag
+ * compared to canonical implementation. */
+#define MBEDTLS_ASN1_IS_STRING_TAG(tag)                                                            \
+    ((tag) < 32u &&                                                                                \
+        (((1u << (tag)) &                                                                          \
+             ((1u << MBEDTLS_ASN1_BMP_STRING) | (1u << MBEDTLS_ASN1_UTF8_STRING) |                 \
+                 (1u << MBEDTLS_ASN1_T61_STRING) | (1u << MBEDTLS_ASN1_IA5_STRING) |               \
+                 (1u << MBEDTLS_ASN1_UNIVERSAL_STRING) | (1u << MBEDTLS_ASN1_PRINTABLE_STRING) |   \
+                 (1u << MBEDTLS_ASN1_BIT_STRING))) != 0))
+
+/*
+ * Bit masks for each of the components of an ASN.1 tag as specified in
+ * ITU X.690 (08/2015), section 8.1 "General rules for encoding",
+ * paragraph 8.1.2.2:
+ *
+ * Bit  8     7   6   5          1
+ *     +-------+-----+------------+
+ *     | Class | P/C | Tag number |
+ *     +-------+-----+------------+
+ */
+#define MBEDTLS_ASN1_TAG_CLASS_MASK 0xC0
+#define MBEDTLS_ASN1_TAG_PC_MASK 0x20
+#define MBEDTLS_ASN1_TAG_VALUE_MASK 0x1F
+
+/* \} name */
+/* \} addtogroup asn1_module */
+
+/** Returns the size of the binary string, without the trailing \\0 */
+#define MBEDTLS_OID_SIZE(x) (sizeof(x) - 1)
+
+/**
+ * Compares an mbedtls_asn1_buf structure to a reference OID.
+ *
+ * Only works for 'defined' oid_str values (MBEDTLS_OID_HMAC_SHA1), you cannot use a
+ * 'unsigned char *oid' here!
+ */
+#define MBEDTLS_OID_CMP(oid_str, oid_buf)                                                          \
+    ((MBEDTLS_OID_SIZE(oid_str) != (oid_buf)->len) ||                                              \
+        memcmp((oid_str), (oid_buf)->p, (oid_buf)->len) != 0)
+
+#define MBEDTLS_OID_CMP_RAW(oid_str, oid_buf, oid_buf_len)                                         \
+    ((MBEDTLS_OID_SIZE(oid_str) != (oid_buf_len)) ||                                               \
+        memcmp((oid_str), (oid_buf), (oid_buf_len)) != 0)
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \name Functions to parse ASN.1 data structures
+ * \{
+ */
+
+/**
+ * Type-length-value structure that allows for ASN1 using DER.
+ */
+typedef struct mbedtls_asn1_buf {
+    int tag;          /**< ASN1 type, e.g. MBEDTLS_ASN1_UTF8_STRING. */
+    size_t len;       /**< ASN1 length, in octets. */
+    unsigned char* p; /**< ASN1 data, e.g. in ASCII. */
+} mbedtls_asn1_buf;
+
+/**
+ * Container for ASN1 bit strings.
+ */
+typedef struct mbedtls_asn1_bitstring {
+    size_t len;                /**< ASN1 length, in octets. */
+    unsigned char unused_bits; /**< Number of unused bits at the end of the string */
+    unsigned char* p;          /**< Raw ASN1 data for the bit string */
+} mbedtls_asn1_bitstring;
+
+/**
+ * Container for a sequence of ASN.1 items
+ */
+typedef struct mbedtls_asn1_sequence {
+    mbedtls_asn1_buf buf; /**< Buffer containing the given ASN.1 item. */
+
+    /** The next entry in the sequence.
+     *
+     * The details of memory management for sequences are not documented and
+     * may change in future versions. Set this field to \p NULL when
+     * initializing a structure, and do not modify it except via Mbed TLS
+     * library functions.
+     */
+    struct mbedtls_asn1_sequence* next;
+} mbedtls_asn1_sequence;
+
+/**
+ * Container for a sequence or list of 'named' ASN.1 data items
+ */
+typedef struct mbedtls_asn1_named_data {
+    mbedtls_asn1_buf oid; /**< The object identifier. */
+    mbedtls_asn1_buf val; /**< The named value. */
+
+    /** The next entry in the sequence.
+     *
+     * The details of memory management for named data sequences are not
+     * documented and may change in future versions. Set this field to \p NULL
+     * when initializing a structure, and do not modify it except via Mbed TLS
+     * library functions.
+     */
+    struct mbedtls_asn1_named_data* next;
+
+    /** Merge next item into the current one?
+     *
+     * This field exists for the sake of Mbed TLS's X.509 certificate parsing
+     * code and may change in future versions of the library.
+     */
+    unsigned char MBEDTLS_PRIVATE(next_merged);
+} mbedtls_asn1_named_data;
+
+/**
+ * \brief       Get the length of an ASN.1 element.
+ *              Updates the pointer to immediately behind the length.
+ *
+ * \param p     On entry, \c *p points to the first byte of the length,
+ *              i.e. immediately after the tag.
+ *              On successful completion, \c *p points to the first byte
+ *              after the length, i.e. the first byte of the content.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param len   On successful completion, \c *len contains the length
+ *              read from the ASN.1 input.
+ *
+ * \return      0 if successful.
+ * \return      #MBEDTLS_ERR_ASN1_OUT_OF_DATA if the ASN.1 element
+ *              would end beyond \p end.
+ * \return      #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the length is unparseable.
+ */
+int mbedtls_asn1_get_len(unsigned char** p, const unsigned char* end, size_t* len);
+
+/**
+ * \brief       Get the tag and length of the element.
+ *              Check for the requested tag.
+ *              Updates the pointer to immediately behind the tag and length.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p points to the first byte
+ *              after the length, i.e. the first byte of the content.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param len   On successful completion, \c *len contains the length
+ *              read from the ASN.1 input.
+ * \param tag   The expected tag.
+ *
+ * \return      0 if successful.
+ * \return      #MBEDTLS_ERR_ASN1_UNEXPECTED_TAG if the data does not start
+ *              with the requested tag.
+ * \return      #MBEDTLS_ERR_ASN1_OUT_OF_DATA if the ASN.1 element
+ *              would end beyond \p end.
+ * \return      #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the length is unparseable.
+ */
+int mbedtls_asn1_get_tag(unsigned char** p, const unsigned char* end, size_t* len, int tag);
+
+/**
+ * \brief       Retrieve a boolean ASN.1 tag and its value.
+ *              Updates the pointer to immediately behind the full tag.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p points to the first byte
+ *              beyond the ASN.1 element.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param val   On success, the parsed value (\c 0 or \c 1).
+ *
+ * \return      0 if successful.
+ * \return      An ASN.1 error code if the input does not start with
+ *              a valid ASN.1 BOOLEAN.
+ */
+int mbedtls_asn1_get_bool(unsigned char** p, const unsigned char* end, int* val);
+
+/**
+ * \brief       Retrieve an integer ASN.1 tag and its value.
+ *              Updates the pointer to immediately behind the full tag.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p points to the first byte
+ *              beyond the ASN.1 element.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param val   On success, the parsed value.
+ *
+ * \return      0 if successful.
+ * \return      An ASN.1 error code if the input does not start with
+ *              a valid ASN.1 INTEGER.
+ * \return      #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the parsed value does
+ *              not fit in an \c int.
+ */
+int mbedtls_asn1_get_int(unsigned char** p, const unsigned char* end, int* val);
+
+/**
+ * \brief       Retrieve an enumerated ASN.1 tag and its value.
+ *              Updates the pointer to immediately behind the full tag.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p points to the first byte
+ *              beyond the ASN.1 element.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param val   On success, the parsed value.
+ *
+ * \return      0 if successful.
+ * \return      An ASN.1 error code if the input does not start with
+ *              a valid ASN.1 ENUMERATED.
+ * \return      #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the parsed value does
+ *              not fit in an \c int.
+ */
+int mbedtls_asn1_get_enum(unsigned char** p, const unsigned char* end, int* val);
+
+/**
+ * \brief       Retrieve a bitstring ASN.1 tag and its value.
+ *              Updates the pointer to immediately behind the full tag.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p is equal to \p end.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param bs    On success, ::mbedtls_asn1_bitstring information about
+ *              the parsed value.
+ *
+ * \return      0 if successful.
+ * \return      #MBEDTLS_ERR_ASN1_LENGTH_MISMATCH if the input contains
+ *              extra data after a valid BIT STRING.
+ * \return      An ASN.1 error code if the input does not start with
+ *              a valid ASN.1 BIT STRING.
+ */
+int mbedtls_asn1_get_bitstring(unsigned char** p, const unsigned char* end,
+    mbedtls_asn1_bitstring* bs);
+
+/**
+ * \brief       Retrieve a bitstring ASN.1 tag without unused bits and its
+ *              value.
+ *              Updates the pointer to the beginning of the bit/octet string.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p points to the first byte
+ *              of the content of the BIT STRING.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param len   On success, \c *len is the length of the content in bytes.
+ *
+ * \return      0 if successful.
+ * \return      #MBEDTLS_ERR_ASN1_INVALID_DATA if the input starts with
+ *              a valid BIT STRING with a nonzero number of unused bits.
+ * \return      An ASN.1 error code if the input does not start with
+ *              a valid ASN.1 BIT STRING.
+ */
+int mbedtls_asn1_get_bitstring_null(unsigned char** p, const unsigned char* end, size_t* len);
+
+/**
+ * \brief       Parses and splits an ASN.1 "SEQUENCE OF <tag>".
+ *              Updates the pointer to immediately behind the full sequence tag.
+ *
+ * This function allocates memory for the sequence elements. You can free
+ * the allocated memory with mbedtls_asn1_sequence_free().
+ *
+ * \note        On error, this function may return a partial list in \p cur.
+ *              You must set `cur->next = NULL` before calling this function!
+ *              Otherwise it is impossible to distinguish a previously non-null
+ *              pointer from a pointer to an object allocated by this function.
+ *
+ * \note        If the sequence is empty, this function does not modify
+ *              \c *cur. If the sequence is valid and non-empty, this
+ *              function sets `cur->buf.tag` to \p tag. This allows
+ *              callers to distinguish between an empty sequence and
+ *              a one-element sequence.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p is equal to \p end.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param cur   A ::mbedtls_asn1_sequence which this function fills.
+ *              When this function returns, \c *cur is the head of a linked
+ *              list. Each node in this list is allocated with
+ *              mbedtls_calloc() apart from \p cur itself, and should
+ *              therefore be freed with mbedtls_free().
+ *              The list describes the content of the sequence.
+ *              The head of the list (i.e. \c *cur itself) describes the
+ *              first element, `*cur->next` describes the second element, etc.
+ *              For each element, `buf.tag == tag`, `buf.len` is the length
+ *              of the content of the content of the element, and `buf.p`
+ *              points to the first byte of the content (i.e. immediately
+ *              past the length of the element).
+ *              Note that list elements may be allocated even on error.
+ * \param tag   Each element of the sequence must have this tag.
+ *
+ * \return      0 if successful.
+ * \return      #MBEDTLS_ERR_ASN1_LENGTH_MISMATCH if the input contains
+ *              extra data after a valid SEQUENCE OF \p tag.
+ * \return      #MBEDTLS_ERR_ASN1_UNEXPECTED_TAG if the input starts with
+ *              an ASN.1 SEQUENCE in which an element has a tag that
+ *              is different from \p tag.
+ * \return      #MBEDTLS_ERR_ASN1_ALLOC_FAILED if a memory allocation failed.
+ * \return      An ASN.1 error code if the input does not start with
+ *              a valid ASN.1 SEQUENCE.
+ */
+int mbedtls_asn1_get_sequence_of(unsigned char** p, const unsigned char* end,
+    mbedtls_asn1_sequence* cur, int tag);
+/**
+ * \brief          Free a heap-allocated linked list presentation of
+ *                 an ASN.1 sequence, including the first element.
+ *
+ * There are two common ways to manage the memory used for the representation
+ * of a parsed ASN.1 sequence:
+ * - Allocate a head node `mbedtls_asn1_sequence *head` with mbedtls_calloc().
+ *   Pass this node as the `cur` argument to mbedtls_asn1_get_sequence_of().
+ *   When you have finished processing the sequence,
+ *   call mbedtls_asn1_sequence_free() on `head`.
+ * - Allocate a head node `mbedtls_asn1_sequence *head` in any manner,
+ *   for example on the stack. Make sure that `head->next == NULL`.
+ *   Pass `head` as the `cur` argument to mbedtls_asn1_get_sequence_of().
+ *   When you have finished processing the sequence,
+ *   call mbedtls_asn1_sequence_free() on `head->cur`,
+ *   then free `head` itself in the appropriate manner.
+ *
+ * \param seq      The address of the first sequence component. This may
+ *                 be \c NULL, in which case this functions returns
+ *                 immediately.
+ */
+void mbedtls_asn1_sequence_free(mbedtls_asn1_sequence* seq);
+
+/**
+ * \brief                Traverse an ASN.1 SEQUENCE container and
+ *                       call a callback for each entry.
+ *
+ * This function checks that the input is a SEQUENCE of elements that
+ * each have a "must" tag, and calls a callback function on the elements
+ * that have a "may" tag.
+ *
+ * For example, to validate that the input is a SEQUENCE of `tag1` and call
+ * `cb` on each element, use
+ * ```
+ * mbedtls_asn1_traverse_sequence_of(&p, end, 0xff, tag1, 0, 0, cb, ctx);
+ * ```
+ *
+ * To validate that the input is a SEQUENCE of ANY and call `cb` on
+ * each element, use
+ * ```
+ * mbedtls_asn1_traverse_sequence_of(&p, end, 0, 0, 0, 0, cb, ctx);
+ * ```
+ *
+ * To validate that the input is a SEQUENCE of CHOICE {NULL, OCTET STRING}
+ * and call `cb` on each element that is an OCTET STRING, use
+ * ```
+ * mbedtls_asn1_traverse_sequence_of(&p, end, 0xfe, 0x04, 0xff, 0x04, cb, ctx);
+ * ```
+ *
+ * The callback is called on the elements with a "may" tag from left to
+ * right. If the input is not a valid SEQUENCE of elements with a "must" tag,
+ * the callback is called on the elements up to the leftmost point where
+ * the input is invalid.
+ *
+ * \warning              This function is still experimental and may change
+ *                       at any time.
+ *
+ * \param p              The address of the pointer to the beginning of
+ *                       the ASN.1 SEQUENCE header. This is updated to
+ *                       point to the end of the ASN.1 SEQUENCE container
+ *                       on a successful invocation.
+ * \param end            The end of the ASN.1 SEQUENCE container.
+ * \param tag_must_mask  A mask to be applied to the ASN.1 tags found within
+ *                       the SEQUENCE before comparing to \p tag_must_value.
+ * \param tag_must_val   The required value of each ASN.1 tag found in the
+ *                       SEQUENCE, after masking with \p tag_must_mask.
+ *                       Mismatching tags lead to an error.
+ *                       For example, a value of \c 0 for both \p tag_must_mask
+ *                       and \p tag_must_val means that every tag is allowed,
+ *                       while a value of \c 0xFF for \p tag_must_mask means
+ *                       that \p tag_must_val is the only allowed tag.
+ * \param tag_may_mask   A mask to be applied to the ASN.1 tags found within
+ *                       the SEQUENCE before comparing to \p tag_may_value.
+ * \param tag_may_val    The desired value of each ASN.1 tag found in the
+ *                       SEQUENCE, after masking with \p tag_may_mask.
+ *                       Mismatching tags will be silently ignored.
+ *                       For example, a value of \c 0 for \p tag_may_mask and
+ *                       \p tag_may_val means that any tag will be considered,
+ *                       while a value of \c 0xFF for \p tag_may_mask means
+ *                       that all tags with value different from \p tag_may_val
+ *                       will be ignored.
+ * \param cb             The callback to trigger for each component
+ *                       in the ASN.1 SEQUENCE that matches \p tag_may_val.
+ *                       The callback function is called with the following
+ *                       parameters:
+ *                       - \p ctx.
+ *                       - The tag of the current element.
+ *                       - A pointer to the start of the current element's
+ *                         content inside the input.
+ *                       - The length of the content of the current element.
+ *                       If the callback returns a non-zero value,
+ *                       the function stops immediately,
+ *                       forwarding the callback's return value.
+ * \param ctx            The context to be passed to the callback \p cb.
+ *
+ * \return               \c 0 if successful the entire ASN.1 SEQUENCE
+ *                       was traversed without parsing or callback errors.
+ * \return               #MBEDTLS_ERR_ASN1_LENGTH_MISMATCH if the input
+ *                       contains extra data after a valid SEQUENCE
+ *                       of elements with an accepted tag.
+ * \return               #MBEDTLS_ERR_ASN1_UNEXPECTED_TAG if the input starts
+ *                       with an ASN.1 SEQUENCE in which an element has a tag
+ *                       that is not accepted.
+ * \return               An ASN.1 error code if the input does not start with
+ *                       a valid ASN.1 SEQUENCE.
+ * \return               A non-zero error code forwarded from the callback
+ *                       \p cb in case the latter returns a non-zero value.
+ */
+int mbedtls_asn1_traverse_sequence_of(unsigned char** p, const unsigned char* end,
+    unsigned char tag_must_mask, unsigned char tag_must_val, unsigned char tag_may_mask,
+    unsigned char tag_may_val, int (*cb)(void* ctx, int tag, unsigned char* start, size_t len),
+    void* ctx);
+
+#if defined(MBEDTLS_BIGNUM_C)
+/**
+ * \brief       Retrieve an integer ASN.1 tag and its value.
+ *              Updates the pointer to immediately behind the full tag.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p points to the first byte
+ *              beyond the ASN.1 element.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param X     On success, the parsed value.
+ *
+ * \return      0 if successful.
+ * \return      An ASN.1 error code if the input does not start with
+ *              a valid ASN.1 INTEGER.
+ * \return      #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the parsed value does
+ *              not fit in an \c int.
+ * \return      An MPI error code if the parsed value is too large.
+ */
+int mbedtls_asn1_get_mpi(unsigned char** p, const unsigned char* end, mbedtls_mpi* X);
+#endif /* MBEDTLS_BIGNUM_C */
+
+/**
+ * \brief       Retrieve an AlgorithmIdentifier ASN.1 sequence.
+ *              Updates the pointer to immediately behind the full
+ *              AlgorithmIdentifier.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p points to the first byte
+ *              beyond the AlgorithmIdentifier element.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param alg   The buffer to receive the OID.
+ * \param params The buffer to receive the parameters.
+ *              This is zeroized if there are no parameters.
+ *
+ * \return      0 if successful or a specific ASN.1 or MPI error code.
+ */
+int mbedtls_asn1_get_alg(unsigned char** p, const unsigned char* end, mbedtls_asn1_buf* alg,
+    mbedtls_asn1_buf* params);
+
+/**
+ * \brief       Retrieve an AlgorithmIdentifier ASN.1 sequence with NULL or no
+ *              params.
+ *              Updates the pointer to immediately behind the full
+ *              AlgorithmIdentifier.
+ *
+ * \param p     On entry, \c *p points to the start of the ASN.1 element.
+ *              On successful completion, \c *p points to the first byte
+ *              beyond the AlgorithmIdentifier element.
+ *              On error, the value of \c *p is undefined.
+ * \param end   End of data.
+ * \param alg   The buffer to receive the OID.
+ *
+ * \return      0 if successful or a specific ASN.1 or MPI error code.
+ */
+int mbedtls_asn1_get_alg_null(unsigned char** p, const unsigned char* end, mbedtls_asn1_buf* alg);
+
+/**
+ * \brief       Find a specific named_data entry in a sequence or list based on
+ *              the OID.
+ *
+ * \param list  The list to seek through
+ * \param oid   The OID to look for
+ * \param len   Size of the OID
+ *
+ * \return      NULL if not found, or a pointer to the existing entry.
+ */
+const mbedtls_asn1_named_data* mbedtls_asn1_find_named_data(const mbedtls_asn1_named_data* list,
+    const char* oid, size_t len);
+
+/**
+ * \brief       Free a mbedtls_asn1_named_data entry
+ *
+ * \param entry The named data entry to free.
+ *              This function calls mbedtls_free() on
+ *              `entry->oid.p` and `entry->val.p`.
+ */
+void mbedtls_asn1_free_named_data(mbedtls_asn1_named_data* entry);
+
+/**
+ * \brief       Free all entries in a mbedtls_asn1_named_data list.
+ *
+ * \param head  Pointer to the head of the list of named data entries to free.
+ *              This function calls mbedtls_asn1_free_named_data() and
+ *              mbedtls_free() on each list element and
+ *              sets \c *head to \c NULL.
+ */
+void mbedtls_asn1_free_named_data_list(mbedtls_asn1_named_data** head);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* asn1.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/base64.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/base64.h
new file mode 100644
index 0000000000..89c5ff2552
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/base64.h
@@ -0,0 +1,94 @@
+/**
+ * \file base64.h
+ *
+ * \brief RFC 1521 base64 encoding/decoding
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_BASE64_H
+#define MBEDTLS_BASE64_H
+
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+
+/** Output buffer too small. */
+#define MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL -0x002A
+/** Invalid character in input. */
+#define MBEDTLS_ERR_BASE64_INVALID_CHARACTER -0x002C
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \brief          Encode a buffer into base64 format
+ *
+ * \param dst      destination buffer
+ * \param dlen     size of the destination buffer
+ * \param olen     number of bytes written
+ * \param src      source buffer
+ * \param slen     amount of data to be encoded
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL.
+ *                 *olen is always updated to reflect the amount
+ *                 of data that has (or would have) been written.
+ *                 If that length cannot be represented, then no data is
+ *                 written to the buffer and *olen is set to the maximum
+ *                 length representable as a size_t.
+ *
+ * \note           Call this function with dlen = 0 to obtain the
+ *                 required buffer size in *olen
+ */
+int mbedtls_base64_encode(unsigned char* dst, size_t dlen, size_t* olen, const unsigned char* src,
+    size_t slen);
+
+/**
+ * \brief          Decode a base64-formatted buffer
+ *
+ * \param dst      destination buffer (can be NULL for checking size)
+ * \param dlen     size of the destination buffer
+ * \param olen     number of bytes written
+ * \param src      source buffer
+ * \param slen     amount of data to be decoded
+ *
+ * \return         0 if successful, MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL, or
+ *                 MBEDTLS_ERR_BASE64_INVALID_CHARACTER if the input data is
+ *                 not correct. *olen is always updated to reflect the amount
+ *                 of data that has (or would have) been written.
+ *
+ * \note           Call this function with *dst = NULL or dlen = 0 to obtain
+ *                 the required buffer size in *olen
+ */
+int mbedtls_base64_decode(unsigned char* dst, size_t dlen, size_t* olen, const unsigned char* src,
+    size_t slen);
+
+#if defined(MBEDTLS_SELF_TEST)
+/**
+ * \brief          Checkup routine
+ *
+ * \return         0 if successful, or 1 if the test failed
+ */
+int mbedtls_base64_self_test(int verbose);
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* base64.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/bignum.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/bignum.h
new file mode 100644
index 0000000000..8c87780e17
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/bignum.h
@@ -0,0 +1,1000 @@
+/**
+ * \file bignum.h
+ *
+ * \brief Multi-precision integer library
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_BIGNUM_H
+#define MBEDTLS_BIGNUM_H
+#include <stddef.h>
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/private_access.h"
+
+#if defined(MBEDTLS_FS_IO)
+#include <stdio.h>
+#endif
+
+/** An error occurred while reading from or writing to a file. */
+#define MBEDTLS_ERR_MPI_FILE_IO_ERROR -0x0002
+/** Bad input parameters to function. */
+#define MBEDTLS_ERR_MPI_BAD_INPUT_DATA -0x0004
+/** There is an invalid character in the digit string. */
+#define MBEDTLS_ERR_MPI_INVALID_CHARACTER -0x0006
+/** The buffer is too small to write to. */
+#define MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL -0x0008
+/** The input arguments are negative or result in illegal output. */
+#define MBEDTLS_ERR_MPI_NEGATIVE_VALUE -0x000A
+/** The input argument for division is zero, which is not allowed. */
+#define MBEDTLS_ERR_MPI_DIVISION_BY_ZERO -0x000C
+/** The input arguments are not acceptable. */
+#define MBEDTLS_ERR_MPI_NOT_ACCEPTABLE -0x000E
+/** Memory allocation failed. */
+#define MBEDTLS_ERR_MPI_ALLOC_FAILED -0x0010
+
+#define MBEDTLS_MPI_CHK(f)                                                                         \
+    do {                                                                                           \
+        if ((ret = (f)) != 0)                                                                      \
+            goto cleanup;                                                                          \
+    } while (0)
+
+/*
+ * Maximum size MPIs are allowed to grow to in number of limbs.
+ */
+#define MBEDTLS_MPI_MAX_LIMBS 10000
+
+#if !defined(MBEDTLS_MPI_WINDOW_SIZE)
+/*
+ * Maximum window size used for modular exponentiation. Default: 6
+ * Minimum value: 1. Maximum value: 6.
+ *
+ * Result is an array of ( 2 ** MBEDTLS_MPI_WINDOW_SIZE ) MPIs used
+ * for the sliding window calculation. (So 64 by default)
+ *
+ * Reduction in size, reduces speed.
+ */
+#define MBEDTLS_MPI_WINDOW_SIZE 6 /**< Maximum window size used. */
+#endif                            /* !MBEDTLS_MPI_WINDOW_SIZE */
+
+#if !defined(MBEDTLS_MPI_MAX_SIZE)
+/*
+ * Maximum size of MPIs allowed in bits and bytes for user-MPIs.
+ * ( Default: 512 bytes => 4096 bits, Maximum tested: 2048 bytes => 16384 bits )
+ *
+ * Note: Calculations can temporarily result in larger MPIs. So the number
+ * of limbs required (MBEDTLS_MPI_MAX_LIMBS) is higher.
+ */
+#define MBEDTLS_MPI_MAX_SIZE 1024 /**< Maximum number of bytes for usable MPIs. */
+#endif                            /* !MBEDTLS_MPI_MAX_SIZE */
+
+#define MBEDTLS_MPI_MAX_BITS                                                                       \
+    (8 * MBEDTLS_MPI_MAX_SIZE) /**< Maximum number of bits for usable MPIs. */
+
+/*
+ * When reading from files with mbedtls_mpi_read_file() and writing to files with
+ * mbedtls_mpi_write_file() the buffer should have space
+ * for a (short) label, the MPI (in the provided radix), the newline
+ * characters and the '\0'.
+ *
+ * By default we assume at least a 10 char label, a minimum radix of 10
+ * (decimal) and a maximum of 4096 bit numbers (1234 decimal chars).
+ * Autosized at compile time for at least a 10 char label, a minimum radix
+ * of 10 (decimal) for a number of MBEDTLS_MPI_MAX_BITS size.
+ *
+ * This used to be statically sized to 1250 for a maximum of 4096 bit
+ * numbers (1234 decimal chars).
+ *
+ * Calculate using the formula:
+ *  MBEDTLS_MPI_RW_BUFFER_SIZE = ceil(MBEDTLS_MPI_MAX_BITS / ln(10) * ln(2)) +
+ *                                LabelSize + 6
+ */
+#define MBEDTLS_MPI_MAX_BITS_SCALE100 (100 * MBEDTLS_MPI_MAX_BITS)
+#define MBEDTLS_LN_2_DIV_LN_10_SCALE100 332
+#define MBEDTLS_MPI_RW_BUFFER_SIZE                                                                 \
+    (((MBEDTLS_MPI_MAX_BITS_SCALE100 + MBEDTLS_LN_2_DIV_LN_10_SCALE100 - 1) /                      \
+         MBEDTLS_LN_2_DIV_LN_10_SCALE100) +                                                        \
+        10 + 6)
+
+/*
+ * Define the base integer type, architecture-wise.
+ *
+ * 32 or 64-bit integer types can be forced regardless of the underlying
+ * architecture by defining MBEDTLS_HAVE_INT32 or MBEDTLS_HAVE_INT64
+ * respectively and undefining MBEDTLS_HAVE_ASM.
+ *
+ * Double-width integers (e.g. 128-bit in 64-bit architectures) can be
+ * disabled by defining MBEDTLS_NO_UDBL_DIVISION.
+ */
+#if !defined(MBEDTLS_HAVE_INT32)
+#if defined(_MSC_VER) && defined(_M_AMD64)
+/* Always choose 64-bit when using MSC */
+#if !defined(MBEDTLS_HAVE_INT64)
+#define MBEDTLS_HAVE_INT64
+#endif /* !MBEDTLS_HAVE_INT64 */
+typedef int64_t mbedtls_mpi_sint;
+typedef uint64_t mbedtls_mpi_uint;
+#elif defined(__GNUC__) &&                                                                         \
+    (defined(__amd64__) || defined(__x86_64__) || defined(__ppc64__) || defined(__powerpc64__) ||  \
+        defined(__ia64__) || defined(__alpha__) || (defined(__sparc__) && defined(__arch64__)) ||  \
+        defined(__s390x__) || defined(__mips64) || defined(__aarch64__))
+#if !defined(MBEDTLS_HAVE_INT64)
+#define MBEDTLS_HAVE_INT64
+#endif /* MBEDTLS_HAVE_INT64 */
+typedef int64_t mbedtls_mpi_sint;
+typedef uint64_t mbedtls_mpi_uint;
+#if !defined(MBEDTLS_NO_UDBL_DIVISION)
+/* mbedtls_t_udbl defined as 128-bit unsigned int */
+typedef unsigned int mbedtls_t_udbl __attribute__((mode(TI)));
+#define MBEDTLS_HAVE_UDBL
+#endif /* !MBEDTLS_NO_UDBL_DIVISION */
+#elif defined(__ARMCC_VERSION) && defined(__aarch64__)
+/*
+ * __ARMCC_VERSION is defined for both armcc and armclang and
+ * __aarch64__ is only defined by armclang when compiling 64-bit code
+ */
+#if !defined(MBEDTLS_HAVE_INT64)
+#define MBEDTLS_HAVE_INT64
+#endif /* !MBEDTLS_HAVE_INT64 */
+typedef int64_t mbedtls_mpi_sint;
+typedef uint64_t mbedtls_mpi_uint;
+#if !defined(MBEDTLS_NO_UDBL_DIVISION)
+/* mbedtls_t_udbl defined as 128-bit unsigned int */
+typedef __uint128_t mbedtls_t_udbl;
+#define MBEDTLS_HAVE_UDBL
+#endif /* !MBEDTLS_NO_UDBL_DIVISION */
+#elif defined(MBEDTLS_HAVE_INT64)
+/* Force 64-bit integers with unknown compiler */
+typedef int64_t mbedtls_mpi_sint;
+typedef uint64_t mbedtls_mpi_uint;
+#endif
+#endif /* !MBEDTLS_HAVE_INT32 */
+
+#if !defined(MBEDTLS_HAVE_INT64)
+/* Default to 32-bit compilation */
+#if !defined(MBEDTLS_HAVE_INT32)
+#define MBEDTLS_HAVE_INT32
+#endif /* !MBEDTLS_HAVE_INT32 */
+typedef int32_t mbedtls_mpi_sint;
+typedef uint32_t mbedtls_mpi_uint;
+#if !defined(MBEDTLS_NO_UDBL_DIVISION)
+typedef uint64_t mbedtls_t_udbl;
+#define MBEDTLS_HAVE_UDBL
+#endif /* !MBEDTLS_NO_UDBL_DIVISION */
+#endif /* !MBEDTLS_HAVE_INT64 */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \brief          MPI structure
+ */
+typedef struct mbedtls_mpi {
+    int MBEDTLS_PRIVATE(s);               /*!<  Sign: -1 if the mpi is negative, 1 otherwise */
+    size_t MBEDTLS_PRIVATE(n);            /*!<  total # of limbs  */
+    mbedtls_mpi_uint* MBEDTLS_PRIVATE(p); /*!<  pointer to limbs  */
+} mbedtls_mpi;
+
+/**
+ * \brief           Initialize an MPI context.
+ *
+ *                  This makes the MPI ready to be set or freed,
+ *                  but does not define a value for the MPI.
+ *
+ * \param X         The MPI context to initialize. This must not be \c NULL.
+ */
+void mbedtls_mpi_init(mbedtls_mpi* X);
+
+/**
+ * \brief          This function frees the components of an MPI context.
+ *
+ * \param X        The MPI context to be cleared. This may be \c NULL,
+ *                 in which case this function is a no-op. If it is
+ *                 not \c NULL, it must point to an initialized MPI.
+ */
+void mbedtls_mpi_free(mbedtls_mpi* X);
+
+/**
+ * \brief          Enlarge an MPI to the specified number of limbs.
+ *
+ * \note           This function does nothing if the MPI is
+ *                 already large enough.
+ *
+ * \param X        The MPI to grow. It must be initialized.
+ * \param nblimbs  The target number of limbs.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         Another negative error code on other kinds of failure.
+ */
+int mbedtls_mpi_grow(mbedtls_mpi* X, size_t nblimbs);
+
+/**
+ * \brief          This function resizes an MPI downwards, keeping at least the
+ *                 specified number of limbs.
+ *
+ *                 If \c X is smaller than \c nblimbs, it is resized up
+ *                 instead.
+ *
+ * \param X        The MPI to shrink. This must point to an initialized MPI.
+ * \param nblimbs  The minimum number of limbs to keep.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed
+ *                 (this can only happen when resizing up).
+ * \return         Another negative error code on other kinds of failure.
+ */
+int mbedtls_mpi_shrink(mbedtls_mpi* X, size_t nblimbs);
+
+/**
+ * \brief          Make a copy of an MPI.
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param Y        The source MPI. This must point to an initialized MPI.
+ *
+ * \note           The limb-buffer in the destination MPI is enlarged
+ *                 if necessary to hold the value in the source MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         Another negative error code on other kinds of failure.
+ */
+int mbedtls_mpi_copy(mbedtls_mpi* X, const mbedtls_mpi* Y);
+
+/**
+ * \brief          Swap the contents of two MPIs.
+ *
+ * \param X        The first MPI. It must be initialized.
+ * \param Y        The second MPI. It must be initialized.
+ */
+void mbedtls_mpi_swap(mbedtls_mpi* X, mbedtls_mpi* Y);
+
+/**
+ * \brief          Perform a safe conditional copy of MPI which doesn't
+ *                 reveal whether the condition was true or not.
+ *
+ * \param X        The MPI to conditionally assign to. This must point
+ *                 to an initialized MPI.
+ * \param Y        The MPI to be assigned from. This must point to an
+ *                 initialized MPI.
+ * \param assign   The condition deciding whether to perform the
+ *                 assignment or not. Possible values:
+ *                 * \c 1: Perform the assignment `X = Y`.
+ *                 * \c 0: Keep the original value of \p X.
+ *
+ * \note           This function is equivalent to
+ *                      `if( assign ) mbedtls_mpi_copy( X, Y );`
+ *                 except that it avoids leaking any information about whether
+ *                 the assignment was done or not (the above code may leak
+ *                 information through branch prediction and/or memory access
+ *                 patterns analysis).
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         Another negative error code on other kinds of failure.
+ */
+int mbedtls_mpi_safe_cond_assign(mbedtls_mpi* X, const mbedtls_mpi* Y, unsigned char assign);
+
+/**
+ * \brief          Perform a safe conditional swap which doesn't
+ *                 reveal whether the condition was true or not.
+ *
+ * \param X        The first MPI. This must be initialized.
+ * \param Y        The second MPI. This must be initialized.
+ * \param assign   The condition deciding whether to perform
+ *                 the swap or not. Possible values:
+ *                 * \c 1: Swap the values of \p X and \p Y.
+ *                 * \c 0: Keep the original values of \p X and \p Y.
+ *
+ * \note           This function is equivalent to
+ *                      if( assign ) mbedtls_mpi_swap( X, Y );
+ *                 except that it avoids leaking any information about whether
+ *                 the assignment was done or not (the above code may leak
+ *                 information through branch prediction and/or memory access
+ *                 patterns analysis).
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         Another negative error code on other kinds of failure.
+ *
+ */
+int mbedtls_mpi_safe_cond_swap(mbedtls_mpi* X, mbedtls_mpi* Y, unsigned char assign);
+
+/**
+ * \brief          Store integer value in MPI.
+ *
+ * \param X        The MPI to set. This must be initialized.
+ * \param z        The value to use.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         Another negative error code on other kinds of failure.
+ */
+int mbedtls_mpi_lset(mbedtls_mpi* X, mbedtls_mpi_sint z);
+
+/**
+ * \brief          Get a specific bit from an MPI.
+ *
+ * \param X        The MPI to query. This must be initialized.
+ * \param pos      Zero-based index of the bit to query.
+ *
+ * \return         \c 0 or \c 1 on success, depending on whether bit \c pos
+ *                 of \c X is unset or set.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_mpi_get_bit(const mbedtls_mpi* X, size_t pos);
+
+/**
+ * \brief          Modify a specific bit in an MPI.
+ *
+ * \note           This function will grow the target MPI if necessary to set a
+ *                 bit to \c 1 in a not yet existing limb. It will not grow if
+ *                 the bit should be set to \c 0.
+ *
+ * \param X        The MPI to modify. This must be initialized.
+ * \param pos      Zero-based index of the bit to modify.
+ * \param val      The desired value of bit \c pos: \c 0 or \c 1.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         Another negative error code on other kinds of failure.
+ */
+int mbedtls_mpi_set_bit(mbedtls_mpi* X, size_t pos, unsigned char val);
+
+/**
+ * \brief          Return the number of bits of value \c 0 before the
+ *                 least significant bit of value \c 1.
+ *
+ * \note           This is the same as the zero-based index of
+ *                 the least significant bit of value \c 1.
+ *
+ * \param X        The MPI to query.
+ *
+ * \return         The number of bits of value \c 0 before the least significant
+ *                 bit of value \c 1 in \p X.
+ */
+size_t mbedtls_mpi_lsb(const mbedtls_mpi* X);
+
+/**
+ * \brief          Return the number of bits up to and including the most
+ *                 significant bit of value \c 1.
+ *
+ * * \note         This is same as the one-based index of the most
+ *                 significant bit of value \c 1.
+ *
+ * \param X        The MPI to query. This must point to an initialized MPI.
+ *
+ * \return         The number of bits up to and including the most
+ *                 significant bit of value \c 1.
+ */
+size_t mbedtls_mpi_bitlen(const mbedtls_mpi* X);
+
+/**
+ * \brief          Return the total size of an MPI value in bytes.
+ *
+ * \param X        The MPI to use. This must point to an initialized MPI.
+ *
+ * \note           The value returned by this function may be less than
+ *                 the number of bytes used to store \p X internally.
+ *                 This happens if and only if there are trailing bytes
+ *                 of value zero.
+ *
+ * \return         The least number of bytes capable of storing
+ *                 the absolute value of \p X.
+ */
+size_t mbedtls_mpi_size(const mbedtls_mpi* X);
+
+/**
+ * \brief          Import an MPI from an ASCII string.
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param radix    The numeric base of the input string.
+ * \param s        Null-terminated string buffer.
+ *
+ * \return         \c 0 if successful.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_mpi_read_string(mbedtls_mpi* X, int radix, const char* s);
+
+/**
+ * \brief          Export an MPI to an ASCII string.
+ *
+ * \param X        The source MPI. This must point to an initialized MPI.
+ * \param radix    The numeric base of the output string.
+ * \param buf      The buffer to write the string to. This must be writable
+ *                 buffer of length \p buflen Bytes.
+ * \param buflen   The available size in Bytes of \p buf.
+ * \param olen     The address at which to store the length of the string
+ *                 written, including the  final \c NULL byte. This must
+ *                 not be \c NULL.
+ *
+ * \note           You can call this function with `buflen == 0` to obtain the
+ *                 minimum required buffer size in `*olen`.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL if the target buffer \p buf
+ *                 is too small to hold the value of \p X in the desired base.
+ *                 In this case, `*olen` is nonetheless updated to contain the
+ *                 size of \p buf required for a successful call.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_write_string(const mbedtls_mpi* X, int radix, char* buf, size_t buflen,
+    size_t* olen);
+
+#if defined(MBEDTLS_FS_IO)
+/**
+ * \brief          Read an MPI from a line in an opened file.
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param radix    The numeric base of the string representation used
+ *                 in the source line.
+ * \param fin      The input file handle to use. This must not be \c NULL.
+ *
+ * \note           On success, this function advances the file stream
+ *                 to the end of the current line or to EOF.
+ *
+ *                 The function returns \c 0 on an empty line.
+ *
+ *                 Leading whitespaces are ignored, as is a
+ *                 '0x' prefix for radix \c 16.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL if the file read buffer
+ *                 is too small.
+ * \return         Another negative error code on failure.
+ */
+int mbedtls_mpi_read_file(mbedtls_mpi* X, int radix, FILE* fin);
+
+/**
+ * \brief          Export an MPI into an opened file.
+ *
+ * \param p        A string prefix to emit prior to the MPI data.
+ *                 For example, this might be a label, or "0x" when
+ *                 printing in base \c 16. This may be \c NULL if no prefix
+ *                 is needed.
+ * \param X        The source MPI. This must point to an initialized MPI.
+ * \param radix    The numeric base to be used in the emitted string.
+ * \param fout     The output file handle. This may be \c NULL, in which case
+ *                 the output is written to \c stdout.
+ *
+ * \return         \c 0 if successful.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_mpi_write_file(const char* p, const mbedtls_mpi* X, int radix, FILE* fout);
+#endif /* MBEDTLS_FS_IO */
+
+/**
+ * \brief          Import an MPI from unsigned big endian binary data.
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param buf      The input buffer. This must be a readable buffer of length
+ *                 \p buflen Bytes.
+ * \param buflen   The length of the input buffer \p p in Bytes.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_read_binary(mbedtls_mpi* X, const unsigned char* buf, size_t buflen);
+
+/**
+ * \brief          Import X from unsigned binary data, little endian
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param buf      The input buffer. This must be a readable buffer of length
+ *                 \p buflen Bytes.
+ * \param buflen   The length of the input buffer \p p in Bytes.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_read_binary_le(mbedtls_mpi* X, const unsigned char* buf, size_t buflen);
+
+/**
+ * \brief          Export X into unsigned binary data, big endian.
+ *                 Always fills the whole buffer, which will start with zeros
+ *                 if the number is smaller.
+ *
+ * \param X        The source MPI. This must point to an initialized MPI.
+ * \param buf      The output buffer. This must be a writable buffer of length
+ *                 \p buflen Bytes.
+ * \param buflen   The size of the output buffer \p buf in Bytes.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL if \p buf isn't
+ *                 large enough to hold the value of \p X.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_write_binary(const mbedtls_mpi* X, unsigned char* buf, size_t buflen);
+
+/**
+ * \brief          Export X into unsigned binary data, little endian.
+ *                 Always fills the whole buffer, which will end with zeros
+ *                 if the number is smaller.
+ *
+ * \param X        The source MPI. This must point to an initialized MPI.
+ * \param buf      The output buffer. This must be a writable buffer of length
+ *                 \p buflen Bytes.
+ * \param buflen   The size of the output buffer \p buf in Bytes.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL if \p buf isn't
+ *                 large enough to hold the value of \p X.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_write_binary_le(const mbedtls_mpi* X, unsigned char* buf, size_t buflen);
+
+/**
+ * \brief          Perform a left-shift on an MPI: X <<= count
+ *
+ * \param X        The MPI to shift. This must point to an initialized MPI.
+ * \param count    The number of bits to shift by.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_shift_l(mbedtls_mpi* X, size_t count);
+
+/**
+ * \brief          Perform a right-shift on an MPI: X >>= count
+ *
+ * \param X        The MPI to shift. This must point to an initialized MPI.
+ * \param count    The number of bits to shift by.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_shift_r(mbedtls_mpi* X, size_t count);
+
+/**
+ * \brief          Compare the absolute values of two MPIs.
+ *
+ * \param X        The left-hand MPI. This must point to an initialized MPI.
+ * \param Y        The right-hand MPI. This must point to an initialized MPI.
+ *
+ * \return         \c 1 if `|X|` is greater than `|Y|`.
+ * \return         \c -1 if `|X|` is lesser than `|Y|`.
+ * \return         \c 0 if `|X|` is equal to `|Y|`.
+ */
+int mbedtls_mpi_cmp_abs(const mbedtls_mpi* X, const mbedtls_mpi* Y);
+
+/**
+ * \brief          Compare two MPIs.
+ *
+ * \param X        The left-hand MPI. This must point to an initialized MPI.
+ * \param Y        The right-hand MPI. This must point to an initialized MPI.
+ *
+ * \return         \c 1 if \p X is greater than \p Y.
+ * \return         \c -1 if \p X is lesser than \p Y.
+ * \return         \c 0 if \p X is equal to \p Y.
+ */
+int mbedtls_mpi_cmp_mpi(const mbedtls_mpi* X, const mbedtls_mpi* Y);
+
+/**
+ * \brief          Check if an MPI is less than the other in constant time.
+ *
+ * \param X        The left-hand MPI. This must point to an initialized MPI
+ *                 with the same allocated length as Y.
+ * \param Y        The right-hand MPI. This must point to an initialized MPI
+ *                 with the same allocated length as X.
+ * \param ret      The result of the comparison:
+ *                 \c 1 if \p X is less than \p Y.
+ *                 \c 0 if \p X is greater than or equal to \p Y.
+ *
+ * \return         0 on success.
+ * \return         MBEDTLS_ERR_MPI_BAD_INPUT_DATA if the allocated length of
+ *                 the two input MPIs is not the same.
+ */
+int mbedtls_mpi_lt_mpi_ct(const mbedtls_mpi* X, const mbedtls_mpi* Y, unsigned* ret);
+
+/**
+ * \brief          Compare an MPI with an integer.
+ *
+ * \param X        The left-hand MPI. This must point to an initialized MPI.
+ * \param z        The integer value to compare \p X to.
+ *
+ * \return         \c 1 if \p X is greater than \p z.
+ * \return         \c -1 if \p X is lesser than \p z.
+ * \return         \c 0 if \p X is equal to \p z.
+ */
+int mbedtls_mpi_cmp_int(const mbedtls_mpi* X, mbedtls_mpi_sint z);
+
+/**
+ * \brief          Perform an unsigned addition of MPIs: X = |A| + |B|
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The first summand. This must point to an initialized MPI.
+ * \param B        The second summand. This must point to an initialized MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_add_abs(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B);
+
+/**
+ * \brief          Perform an unsigned subtraction of MPIs: X = |A| - |B|
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The minuend. This must point to an initialized MPI.
+ * \param B        The subtrahend. This must point to an initialized MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_NEGATIVE_VALUE if \p B is greater than \p A.
+ * \return         Another negative error code on different kinds of failure.
+ *
+ */
+int mbedtls_mpi_sub_abs(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B);
+
+/**
+ * \brief          Perform a signed addition of MPIs: X = A + B
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The first summand. This must point to an initialized MPI.
+ * \param B        The second summand. This must point to an initialized MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_add_mpi(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B);
+
+/**
+ * \brief          Perform a signed subtraction of MPIs: X = A - B
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The minuend. This must point to an initialized MPI.
+ * \param B        The subtrahend. This must point to an initialized MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_sub_mpi(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B);
+
+/**
+ * \brief          Perform a signed addition of an MPI and an integer: X = A + b
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The first summand. This must point to an initialized MPI.
+ * \param b        The second summand.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_add_int(mbedtls_mpi* X, const mbedtls_mpi* A, mbedtls_mpi_sint b);
+
+/**
+ * \brief          Perform a signed subtraction of an MPI and an integer:
+ *                 X = A - b
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The minuend. This must point to an initialized MPI.
+ * \param b        The subtrahend.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_sub_int(mbedtls_mpi* X, const mbedtls_mpi* A, mbedtls_mpi_sint b);
+
+/**
+ * \brief          Perform a multiplication of two MPIs: X = A * B
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The first factor. This must point to an initialized MPI.
+ * \param B        The second factor. This must point to an initialized MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ *
+ */
+int mbedtls_mpi_mul_mpi(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B);
+
+/**
+ * \brief          Perform a multiplication of an MPI with an unsigned integer:
+ *                 X = A * b
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The first factor. This must point to an initialized MPI.
+ * \param b        The second factor.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ *
+ */
+int mbedtls_mpi_mul_int(mbedtls_mpi* X, const mbedtls_mpi* A, mbedtls_mpi_uint b);
+
+/**
+ * \brief          Perform a division with remainder of two MPIs:
+ *                 A = Q * B + R
+ *
+ * \param Q        The destination MPI for the quotient.
+ *                 This may be \c NULL if the value of the
+ *                 quotient is not needed.
+ * \param R        The destination MPI for the remainder value.
+ *                 This may be \c NULL if the value of the
+ *                 remainder is not needed.
+ * \param A        The dividend. This must point to an initialized MPi.
+ * \param B        The divisor. This must point to an initialized MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         #MBEDTLS_ERR_MPI_DIVISION_BY_ZERO if \p B equals zero.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_div_mpi(mbedtls_mpi* Q, mbedtls_mpi* R, const mbedtls_mpi* A, const mbedtls_mpi* B);
+
+/**
+ * \brief          Perform a division with remainder of an MPI by an integer:
+ *                 A = Q * b + R
+ *
+ * \param Q        The destination MPI for the quotient.
+ *                 This may be \c NULL if the value of the
+ *                 quotient is not needed.
+ * \param R        The destination MPI for the remainder value.
+ *                 This may be \c NULL if the value of the
+ *                 remainder is not needed.
+ * \param A        The dividend. This must point to an initialized MPi.
+ * \param b        The divisor.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if memory allocation failed.
+ * \return         #MBEDTLS_ERR_MPI_DIVISION_BY_ZERO if \p b equals zero.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_div_int(mbedtls_mpi* Q, mbedtls_mpi* R, const mbedtls_mpi* A, mbedtls_mpi_sint b);
+
+/**
+ * \brief          Perform a modular reduction. R = A mod B
+ *
+ * \param R        The destination MPI for the residue value.
+ *                 This must point to an initialized MPI.
+ * \param A        The MPI to compute the residue of.
+ *                 This must point to an initialized MPI.
+ * \param B        The base of the modular reduction.
+ *                 This must point to an initialized MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         #MBEDTLS_ERR_MPI_DIVISION_BY_ZERO if \p B equals zero.
+ * \return         #MBEDTLS_ERR_MPI_NEGATIVE_VALUE if \p B is negative.
+ * \return         Another negative error code on different kinds of failure.
+ *
+ */
+int mbedtls_mpi_mod_mpi(mbedtls_mpi* R, const mbedtls_mpi* A, const mbedtls_mpi* B);
+
+/**
+ * \brief          Perform a modular reduction with respect to an integer.
+ *                 r = A mod b
+ *
+ * \param r        The address at which to store the residue.
+ *                 This must not be \c NULL.
+ * \param A        The MPI to compute the residue of.
+ *                 This must point to an initialized MPi.
+ * \param b        The integer base of the modular reduction.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         #MBEDTLS_ERR_MPI_DIVISION_BY_ZERO if \p b equals zero.
+ * \return         #MBEDTLS_ERR_MPI_NEGATIVE_VALUE if \p b is negative.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_mod_int(mbedtls_mpi_uint* r, const mbedtls_mpi* A, mbedtls_mpi_sint b);
+
+/**
+ * \brief          Perform a sliding-window exponentiation: X = A^E mod N
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The base of the exponentiation.
+ *                 This must point to an initialized MPI.
+ * \param E        The exponent MPI. This must point to an initialized MPI.
+ * \param N        The base for the modular reduction. This must point to an
+ *                 initialized MPI.
+ * \param prec_RR  A helper MPI depending solely on \p N which can be used to
+ *                 speed-up multiple modular exponentiations for the same value
+ *                 of \p N. This may be \c NULL. If it is not \c NULL, it must
+ *                 point to an initialized MPI. If it hasn't been used after
+ *                 the call to mbedtls_mpi_init(), this function will compute
+ *                 the helper value and store it in \p prec_RR for reuse on
+ *                 subsequent calls to this function. Otherwise, the function
+ *                 will assume that \p prec_RR holds the helper value set by a
+ *                 previous call to mbedtls_mpi_exp_mod(), and reuse it.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         #MBEDTLS_ERR_MPI_BAD_INPUT_DATA if \c N is negative or
+ *                 even, or if \c E is negative.
+ * \return         Another negative error code on different kinds of failures.
+ *
+ */
+int mbedtls_mpi_exp_mod(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* E,
+    const mbedtls_mpi* N, mbedtls_mpi* prec_RR);
+
+/**
+ * \brief          Fill an MPI with a number of random bytes.
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param size     The number of random bytes to generate.
+ * \param f_rng    The RNG function to use. This must not be \c NULL.
+ * \param p_rng    The RNG parameter to be passed to \p f_rng. This may be
+ *                 \c NULL if \p f_rng doesn't need a context argument.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on failure.
+ *
+ * \note           The bytes obtained from the RNG are interpreted
+ *                 as a big-endian representation of an MPI; this can
+ *                 be relevant in applications like deterministic ECDSA.
+ */
+int mbedtls_mpi_fill_random(mbedtls_mpi* X, size_t size,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+/** Generate a random number uniformly in a range.
+ *
+ * This function generates a random number between \p min inclusive and
+ * \p N exclusive.
+ *
+ * The procedure complies with RFC 6979 §3.3 (deterministic ECDSA)
+ * when the RNG is a suitably parametrized instance of HMAC_DRBG
+ * and \p min is \c 1.
+ *
+ * \note           There are `N - min` possible outputs. The lower bound
+ *                 \p min can be reached, but the upper bound \p N cannot.
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param min      The minimum value to return.
+ *                 It must be nonnegative.
+ * \param N        The upper bound of the range, exclusive.
+ *                 In other words, this is one plus the maximum value to return.
+ *                 \p N must be strictly larger than \p min.
+ * \param f_rng    The RNG function to use. This must not be \c NULL.
+ * \param p_rng    The RNG parameter to be passed to \p f_rng.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         #MBEDTLS_ERR_MPI_BAD_INPUT_DATA if \p min or \p N is invalid
+ *                 or if they are incompatible.
+ * \return         #MBEDTLS_ERR_MPI_NOT_ACCEPTABLE if the implementation was
+ *                 unable to find a suitable value within a limited number
+ *                 of attempts. This has a negligible probability if \p N
+ *                 is significantly larger than \p min, which is the case
+ *                 for all usual cryptographic applications.
+ * \return         Another negative error code on failure.
+ */
+int mbedtls_mpi_random(mbedtls_mpi* X, mbedtls_mpi_sint min, const mbedtls_mpi* N,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+/**
+ * \brief          Compute the greatest common divisor: G = gcd(A, B)
+ *
+ * \param G        The destination MPI. This must point to an initialized MPI.
+ * \param A        The first operand. This must point to an initialized MPI.
+ * \param B        The second operand. This must point to an initialized MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         Another negative error code on different kinds of failure.
+ */
+int mbedtls_mpi_gcd(mbedtls_mpi* G, const mbedtls_mpi* A, const mbedtls_mpi* B);
+
+/**
+ * \brief          Compute the modular inverse: X = A^-1 mod N
+ *
+ * \param X        The destination MPI. This must point to an initialized MPI.
+ * \param A        The MPI to calculate the modular inverse of. This must point
+ *                 to an initialized MPI.
+ * \param N        The base of the modular inversion. This must point to an
+ *                 initialized MPI.
+ *
+ * \return         \c 0 if successful.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         #MBEDTLS_ERR_MPI_BAD_INPUT_DATA if \p N is less than
+ *                 or equal to one.
+ * \return         #MBEDTLS_ERR_MPI_NOT_ACCEPTABLE if \p has no modular inverse
+ *                 with respect to \p N.
+ */
+int mbedtls_mpi_inv_mod(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* N);
+
+/**
+ * \brief          Miller-Rabin primality test.
+ *
+ * \warning        If \p X is potentially generated by an adversary, for example
+ *                 when validating cryptographic parameters that you didn't
+ *                 generate yourself and that are supposed to be prime, then
+ *                 \p rounds should be at least the half of the security
+ *                 strength of the cryptographic algorithm. On the other hand,
+ *                 if \p X is chosen uniformly or non-adversially (as is the
+ *                 case when mbedtls_mpi_gen_prime calls this function), then
+ *                 \p rounds can be much lower.
+ *
+ * \param X        The MPI to check for primality.
+ *                 This must point to an initialized MPI.
+ * \param rounds   The number of bases to perform the Miller-Rabin primality
+ *                 test for. The probability of returning 0 on a composite is
+ *                 at most 2<sup>-2*\p rounds</sup>.
+ * \param f_rng    The RNG function to use. This must not be \c NULL.
+ * \param p_rng    The RNG parameter to be passed to \p f_rng.
+ *                 This may be \c NULL if \p f_rng doesn't use
+ *                 a context parameter.
+ *
+ * \return         \c 0 if successful, i.e. \p X is probably prime.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         #MBEDTLS_ERR_MPI_NOT_ACCEPTABLE if \p X is not prime.
+ * \return         Another negative error code on other kinds of failure.
+ */
+int mbedtls_mpi_is_prime_ext(const mbedtls_mpi* X, int rounds,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+/**
+ * \brief Flags for mbedtls_mpi_gen_prime()
+ *
+ * Each of these flags is a constraint on the result X returned by
+ * mbedtls_mpi_gen_prime().
+ */
+typedef enum {
+    MBEDTLS_MPI_GEN_PRIME_FLAG_DH = 0x0001, /**< (X-1)/2 is prime too */
+    MBEDTLS_MPI_GEN_PRIME_FLAG_LOW_ERR =
+        0x0002, /**< lower error rate from 2<sup>-80</sup> to 2<sup>-128</sup> */
+} mbedtls_mpi_gen_prime_flag_t;
+
+/**
+ * \brief          Generate a prime number.
+ *
+ * \param X        The destination MPI to store the generated prime in.
+ *                 This must point to an initialized MPi.
+ * \param nbits    The required size of the destination MPI in bits.
+ *                 This must be between \c 3 and #MBEDTLS_MPI_MAX_BITS.
+ * \param flags    A mask of flags of type #mbedtls_mpi_gen_prime_flag_t.
+ * \param f_rng    The RNG function to use. This must not be \c NULL.
+ * \param p_rng    The RNG parameter to be passed to \p f_rng.
+ *                 This may be \c NULL if \p f_rng doesn't use
+ *                 a context parameter.
+ *
+ * \return         \c 0 if successful, in which case \p X holds a
+ *                 probably prime number.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED if a memory allocation failed.
+ * \return         #MBEDTLS_ERR_MPI_BAD_INPUT_DATA if `nbits` is not between
+ *                 \c 3 and #MBEDTLS_MPI_MAX_BITS.
+ */
+int mbedtls_mpi_gen_prime(mbedtls_mpi* X, size_t nbits, int flags,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/**
+ * \brief          Checkup routine
+ *
+ * \return         0 if successful, or 1 if the test failed
+ */
+int mbedtls_mpi_self_test(int verbose);
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* bignum.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/build_info.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/build_info.h
new file mode 100644
index 0000000000..f84f0aff15
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/build_info.h
@@ -0,0 +1,82 @@
+/**
+ * \file build_info.h
+ *
+ * \brief Build-time configuration info
+ *
+ *  Include this file if you need to depend on the
+ *  configuration options defined in mbedtls_config.h or MBEDTLS_CONFIG_FILE
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_BUILD_INFO_H
+#define MBEDTLS_BUILD_INFO_H
+
+/*
+ * This set of compile-time defines can be used to determine the version number
+ * of the Mbed TLS library used. Run-time variables for the same can be found in
+ * version.h
+ */
+
+/**
+ * The version number x.y.z is split into three parts.
+ * Major, Minor, Patchlevel
+ */
+#define MBEDTLS_VERSION_MAJOR 3
+#define MBEDTLS_VERSION_MINOR 1
+#define MBEDTLS_VERSION_PATCH 0
+
+/**
+ * The single version number has the following structure:
+ *    MMNNPP00
+ *    Major version | Minor version | Patch version
+ */
+#define MBEDTLS_VERSION_NUMBER 0x03010000
+#define MBEDTLS_VERSION_STRING "3.1.0"
+#define MBEDTLS_VERSION_STRING_FULL "mbed TLS 3.1.0"
+
+#if defined(_MSC_VER) && !defined(_CRT_SECURE_NO_DEPRECATE)
+#define _CRT_SECURE_NO_DEPRECATE 1
+#endif
+
+#if !defined(MBEDTLS_CONFIG_FILE)
+#include "mbedtls/mbedtls_config.h"
+#else
+#include MBEDTLS_CONFIG_FILE
+#endif
+
+#if defined(MBEDTLS_CONFIG_VERSION) &&                                                             \
+    (MBEDTLS_CONFIG_VERSION < 0x03000000 || MBEDTLS_CONFIG_VERSION > MBEDTLS_VERSION_NUMBER)
+#error "Invalid config version, defined value of MBEDTLS_CONFIG_VERSION is unsupported"
+#endif
+
+/* Target and application specific configurations
+ *
+ * Allow user to override any previous default.
+ *
+ */
+#if defined(MBEDTLS_USER_CONFIG_FILE)
+#include MBEDTLS_USER_CONFIG_FILE
+#endif
+
+#if defined(MBEDTLS_PSA_CRYPTO_CONFIG)
+#include "mbedtls/config_psa.h"
+#endif
+
+#include "mbedtls/check_config.h"
+
+#endif /* MBEDTLS_BUILD_INFO_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/camellia.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/camellia.h
new file mode 100644
index 0000000000..f409c12374
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/camellia.h
@@ -0,0 +1,295 @@
+/**
+ * \file camellia.h
+ *
+ * \brief Camellia block cipher
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_CAMELLIA_H
+#define MBEDTLS_CAMELLIA_H
+#include <stddef.h>
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/private_access.h"
+
+#define MBEDTLS_CAMELLIA_ENCRYPT 1
+#define MBEDTLS_CAMELLIA_DECRYPT 0
+
+/** Bad input data. */
+#define MBEDTLS_ERR_CAMELLIA_BAD_INPUT_DATA -0x0024
+
+/** Invalid data input length. */
+#define MBEDTLS_ERR_CAMELLIA_INVALID_INPUT_LENGTH -0x0026
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_CAMELLIA_ALT)
+// Regular implementation
+//
+
+/**
+ * \brief          CAMELLIA context structure
+ */
+typedef struct mbedtls_camellia_context {
+    int MBEDTLS_PRIVATE(nr);          /*!<  number of rounds  */
+    uint32_t MBEDTLS_PRIVATE(rk)[68]; /*!<  CAMELLIA round keys    */
+} mbedtls_camellia_context;
+
+#else /* MBEDTLS_CAMELLIA_ALT */
+#include "mbedtls/camellia_alt.h"
+#endif /* MBEDTLS_CAMELLIA_ALT */
+
+/**
+ * \brief          Initialize a CAMELLIA context.
+ *
+ * \param ctx      The CAMELLIA context to be initialized.
+ *                 This must not be \c NULL.
+ */
+void mbedtls_camellia_init(mbedtls_camellia_context* ctx);
+
+/**
+ * \brief          Clear a CAMELLIA context.
+ *
+ * \param ctx      The CAMELLIA context to be cleared. This may be \c NULL,
+ *                 in which case this function returns immediately. If it is not
+ *                 \c NULL, it must be initialized.
+ */
+void mbedtls_camellia_free(mbedtls_camellia_context* ctx);
+
+/**
+ * \brief          Perform a CAMELLIA key schedule operation for encryption.
+ *
+ * \param ctx      The CAMELLIA context to use. This must be initialized.
+ * \param key      The encryption key to use. This must be a readable buffer
+ *                 of size \p keybits Bits.
+ * \param keybits  The length of \p key in Bits. This must be either \c 128,
+ *                 \c 192 or \c 256.
+ *
+ * \return         \c 0 if successful.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_camellia_setkey_enc(mbedtls_camellia_context* ctx, const unsigned char* key,
+    unsigned int keybits);
+
+/**
+ * \brief          Perform a CAMELLIA key schedule operation for decryption.
+ *
+ * \param ctx      The CAMELLIA context to use. This must be initialized.
+ * \param key      The decryption key. This must be a readable buffer
+ *                 of size \p keybits Bits.
+ * \param keybits  The length of \p key in Bits. This must be either \c 128,
+ *                 \c 192 or \c 256.
+ *
+ * \return         \c 0 if successful.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_camellia_setkey_dec(mbedtls_camellia_context* ctx, const unsigned char* key,
+    unsigned int keybits);
+
+/**
+ * \brief          Perform a CAMELLIA-ECB block encryption/decryption operation.
+ *
+ * \param ctx      The CAMELLIA context to use. This must be initialized
+ *                 and bound to a key.
+ * \param mode     The mode of operation. This must be either
+ *                 #MBEDTLS_CAMELLIA_ENCRYPT or #MBEDTLS_CAMELLIA_DECRYPT.
+ * \param input    The input block. This must be a readable buffer
+ *                 of size \c 16 Bytes.
+ * \param output   The output block. This must be a writable buffer
+ *                 of size \c 16 Bytes.
+ *
+ * \return         \c 0 if successful.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_camellia_crypt_ecb(mbedtls_camellia_context* ctx, int mode,
+    const unsigned char input[16], unsigned char output[16]);
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+/**
+ * \brief          Perform a CAMELLIA-CBC buffer encryption/decryption operation.
+ *
+ * \note           Upon exit, the content of the IV is updated so that you can
+ *                 call the function same function again on the following
+ *                 block(s) of data and get the same result as if it was
+ *                 encrypted in one call. This allows a "streaming" usage.
+ *                 If on the other hand you need to retain the contents of the
+ *                 IV, you should either save it manually or use the cipher
+ *                 module instead.
+ *
+ * \param ctx      The CAMELLIA context to use. This must be initialized
+ *                 and bound to a key.
+ * \param mode     The mode of operation. This must be either
+ *                 #MBEDTLS_CAMELLIA_ENCRYPT or #MBEDTLS_CAMELLIA_DECRYPT.
+ * \param length   The length in Bytes of the input data \p input.
+ *                 This must be a multiple of \c 16 Bytes.
+ * \param iv       The initialization vector. This must be a read/write buffer
+ *                 of length \c 16 Bytes. It is updated to allow streaming
+ *                 use as explained above.
+ * \param input    The buffer holding the input data. This must point to a
+ *                 readable buffer of length \p length Bytes.
+ * \param output   The buffer holding the output data. This must point to a
+ *                 writable buffer of length \p length Bytes.
+ *
+ * \return         \c 0 if successful.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_camellia_crypt_cbc(mbedtls_camellia_context* ctx, int mode, size_t length,
+    unsigned char iv[16], const unsigned char* input, unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+/**
+ * \brief          Perform a CAMELLIA-CFB128 buffer encryption/decryption
+ *                 operation.
+ *
+ * \note           Due to the nature of CFB mode, you should use the same
+ *                 key for both encryption and decryption. In particular, calls
+ *                 to this function should be preceded by a key-schedule via
+ *                 mbedtls_camellia_setkey_enc() regardless of whether \p mode
+ *                 is #MBEDTLS_CAMELLIA_ENCRYPT or #MBEDTLS_CAMELLIA_DECRYPT.
+ *
+ * \note           Upon exit, the content of the IV is updated so that you can
+ *                 call the function same function again on the following
+ *                 block(s) of data and get the same result as if it was
+ *                 encrypted in one call. This allows a "streaming" usage.
+ *                 If on the other hand you need to retain the contents of the
+ *                 IV, you should either save it manually or use the cipher
+ *                 module instead.
+ *
+ * \param ctx      The CAMELLIA context to use. This must be initialized
+ *                 and bound to a key.
+ * \param mode     The mode of operation. This must be either
+ *                 #MBEDTLS_CAMELLIA_ENCRYPT or #MBEDTLS_CAMELLIA_DECRYPT.
+ * \param length   The length of the input data \p input. Any value is allowed.
+ * \param iv_off   The current offset in the IV. This must be smaller
+ *                 than \c 16 Bytes. It is updated after this call to allow
+ *                 the aforementioned streaming usage.
+ * \param iv       The initialization vector. This must be a read/write buffer
+ *                 of length \c 16 Bytes. It is updated after this call to
+ *                 allow the aforementioned streaming usage.
+ * \param input    The buffer holding the input data. This must be a readable
+ *                 buffer of size \p length Bytes.
+ * \param output   The buffer to hold the output data. This must be a writable
+ *                 buffer of length \p length Bytes.
+ *
+ * \return         \c 0 if successful.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_camellia_crypt_cfb128(mbedtls_camellia_context* ctx, int mode, size_t length,
+    size_t* iv_off, unsigned char iv[16], const unsigned char* input, unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+/**
+ * \brief      Perform a CAMELLIA-CTR buffer encryption/decryption operation.
+ *
+ * *note       Due to the nature of CTR mode, you should use the same
+ *             key for both encryption and decryption. In particular, calls
+ *             to this function should be preceded by a key-schedule via
+ *             mbedtls_camellia_setkey_enc() regardless of whether \p mode
+ *             is #MBEDTLS_CAMELLIA_ENCRYPT or #MBEDTLS_CAMELLIA_DECRYPT.
+ *
+ * \warning    You must never reuse a nonce value with the same key. Doing so
+ *             would void the encryption for the two messages encrypted with
+ *             the same nonce and key.
+ *
+ *             There are two common strategies for managing nonces with CTR:
+ *
+ *             1. You can handle everything as a single message processed over
+ *             successive calls to this function. In that case, you want to
+ *             set \p nonce_counter and \p nc_off to 0 for the first call, and
+ *             then preserve the values of \p nonce_counter, \p nc_off and \p
+ *             stream_block across calls to this function as they will be
+ *             updated by this function.
+ *
+ *             With this strategy, you must not encrypt more than 2**128
+ *             blocks of data with the same key.
+ *
+ *             2. You can encrypt separate messages by dividing the \p
+ *             nonce_counter buffer in two areas: the first one used for a
+ *             per-message nonce, handled by yourself, and the second one
+ *             updated by this function internally.
+ *
+ *             For example, you might reserve the first \c 12 Bytes for the
+ *             per-message nonce, and the last \c 4 Bytes for internal use.
+ *             In that case, before calling this function on a new message you
+ *             need to set the first \c 12 Bytes of \p nonce_counter to your
+ *             chosen nonce value, the last four to \c 0, and \p nc_off to \c 0
+ *             (which will cause \p stream_block to be ignored). That way, you
+ *             can encrypt at most \c 2**96 messages of up to \c 2**32 blocks
+ *             each  with the same key.
+ *
+ *             The per-message nonce (or information sufficient to reconstruct
+ *             it) needs to be communicated with the ciphertext and must be
+ *             unique. The recommended way to ensure uniqueness is to use a
+ *             message counter. An alternative is to generate random nonces,
+ *             but this limits the number of messages that can be securely
+ *             encrypted: for example, with 96-bit random nonces, you should
+ *             not encrypt more than 2**32 messages with the same key.
+ *
+ *             Note that for both stategies, sizes are measured in blocks and
+ *             that a CAMELLIA block is \c 16 Bytes.
+ *
+ * \warning    Upon return, \p stream_block contains sensitive data. Its
+ *             content must not be written to insecure storage and should be
+ *             securely discarded as soon as it's no longer needed.
+ *
+ * \param ctx           The CAMELLIA context to use. This must be initialized
+ *                      and bound to a key.
+ * \param length        The length of the input data \p input in Bytes.
+ *                      Any value is allowed.
+ * \param nc_off        The offset in the current \p stream_block (for resuming
+ *                      within current cipher stream). The offset pointer to
+ *                      should be \c 0 at the start of a stream. It is updated
+ *                      at the end of this call.
+ * \param nonce_counter The 128-bit nonce and counter. This must be a read/write
+ *                      buffer of length \c 16 Bytes.
+ * \param stream_block  The saved stream-block for resuming. This must be a
+ *                      read/write buffer of length \c 16 Bytes.
+ * \param input         The input data stream. This must be a readable buffer of
+ *                      size \p length Bytes.
+ * \param output        The output data stream. This must be a writable buffer
+ *                      of size \p length Bytes.
+ *
+ * \return              \c 0 if successful.
+ * \return              A negative error code on failure.
+ */
+int mbedtls_camellia_crypt_ctr(mbedtls_camellia_context* ctx, size_t length, size_t* nc_off,
+    unsigned char nonce_counter[16], unsigned char stream_block[16], const unsigned char* input,
+    unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/**
+ * \brief          Checkup routine
+ *
+ * \return         0 if successful, or 1 if the test failed
+ */
+int mbedtls_camellia_self_test(int verbose);
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* camellia.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/ccm.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/ccm.h
new file mode 100644
index 0000000000..c8880f6883
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/ccm.h
@@ -0,0 +1,508 @@
+/**
+ * \file ccm.h
+ *
+ * \brief This file provides an API for the CCM authenticated encryption
+ *        mode for block ciphers.
+ *
+ * CCM combines Counter mode encryption with CBC-MAC authentication
+ * for 128-bit block ciphers.
+ *
+ * Input to CCM includes the following elements:
+ * <ul><li>Payload - data that is both authenticated and encrypted.</li>
+ * <li>Associated data (Adata) - data that is authenticated but not
+ * encrypted, For example, a header.</li>
+ * <li>Nonce - A unique value that is assigned to the payload and the
+ * associated data.</li></ul>
+ *
+ * Definition of CCM:
+ * http://csrc.nist.gov/publications/nistpubs/800-38C/SP800-38C_updated-July20_2007.pdf
+ * RFC 3610 "Counter with CBC-MAC (CCM)"
+ *
+ * Related:
+ * RFC 5116 "An Interface and Algorithms for Authenticated Encryption"
+ *
+ * Definition of CCM*:
+ * IEEE 802.15.4 - IEEE Standard for Local and metropolitan area networks
+ * Integer representation is fixed most-significant-octet-first order and
+ * the representation of octets is most-significant-bit-first order. This is
+ * consistent with RFC 3610.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_CCM_H
+#define MBEDTLS_CCM_H
+#include "mbedtls/build_info.h"
+#include "mbedtls/cipher.h"
+#include "mbedtls/private_access.h"
+
+#define MBEDTLS_CCM_DECRYPT 0
+#define MBEDTLS_CCM_ENCRYPT 1
+#define MBEDTLS_CCM_STAR_DECRYPT 2
+#define MBEDTLS_CCM_STAR_ENCRYPT 3
+
+/** Bad input parameters to the function. */
+#define MBEDTLS_ERR_CCM_BAD_INPUT -0x000D
+/** Authenticated decryption failed. */
+#define MBEDTLS_ERR_CCM_AUTH_FAILED -0x000F
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_CCM_ALT)
+// Regular implementation
+//
+
+/**
+ * \brief    The CCM context-type definition. The CCM context is passed
+ *           to the APIs called.
+ */
+typedef struct mbedtls_ccm_context {
+    unsigned char MBEDTLS_PRIVATE(y)[16];                 /*!< The Y working buffer */
+    unsigned char MBEDTLS_PRIVATE(ctr)[16];               /*!< The counter buffer */
+    mbedtls_cipher_context_t MBEDTLS_PRIVATE(cipher_ctx); /*!< The cipher context used. */
+    size_t MBEDTLS_PRIVATE(plaintext_len);                /*!< Total plaintext length */
+    size_t MBEDTLS_PRIVATE(add_len);                      /*!< Total authentication data length */
+    size_t MBEDTLS_PRIVATE(tag_len);                      /*!< Total tag length */
+    size_t MBEDTLS_PRIVATE(processed);                    /*!< Track how many bytes of input data
+                                                               were processed (chunked input).
+                                                               Used independently for both auth data
+                                                               and plaintext/ciphertext.
+                                                               This variable is set to zero after
+                                                               auth data input is finished. */
+    unsigned char MBEDTLS_PRIVATE(q);                     /*!< The Q working value */
+    unsigned char MBEDTLS_PRIVATE(mode);                  /*!< The operation to perform:
+                                                               #MBEDTLS_CCM_ENCRYPT or
+                                                               #MBEDTLS_CCM_DECRYPT or
+                                                               #MBEDTLS_CCM_STAR_ENCRYPT or
+                                                               #MBEDTLS_CCM_STAR_DECRYPT. */
+    int MBEDTLS_PRIVATE(state);                           /*!< Working value holding context's
+                                                               state. Used for chunked data
+                                                               input */
+} mbedtls_ccm_context;
+
+#else /* MBEDTLS_CCM_ALT */
+#include "mbedtls/ccm_alt.h"
+#endif /* MBEDTLS_CCM_ALT */
+
+/**
+ * \brief           This function initializes the specified CCM context,
+ *                  to make references valid, and prepare the context
+ *                  for mbedtls_ccm_setkey() or mbedtls_ccm_free().
+ *
+ * \param ctx       The CCM context to initialize. This must not be \c NULL.
+ */
+void mbedtls_ccm_init(mbedtls_ccm_context* ctx);
+
+/**
+ * \brief           This function initializes the CCM context set in the
+ *                  \p ctx parameter and sets the encryption key.
+ *
+ * \param ctx       The CCM context to initialize. This must be an initialized
+ *                  context.
+ * \param cipher    The 128-bit block cipher to use.
+ * \param key       The encryption key. This must not be \c NULL.
+ * \param keybits   The key size in bits. This must be acceptable by the cipher.
+ *
+ * \return          \c 0 on success.
+ * \return          A CCM or cipher-specific error code on failure.
+ */
+int mbedtls_ccm_setkey(mbedtls_ccm_context* ctx, mbedtls_cipher_id_t cipher,
+    const unsigned char* key, unsigned int keybits);
+
+/**
+ * \brief   This function releases and clears the specified CCM context
+ *          and underlying cipher sub-context.
+ *
+ * \param ctx       The CCM context to clear. If this is \c NULL, the function
+ *                  has no effect. Otherwise, this must be initialized.
+ */
+void mbedtls_ccm_free(mbedtls_ccm_context* ctx);
+
+/**
+ * \brief           This function encrypts a buffer using CCM.
+ *
+ * \note            The tag is written to a separate buffer. To concatenate
+ *                  the \p tag with the \p output, as done in <em>RFC-3610:
+ *                  Counter with CBC-MAC (CCM)</em>, use
+ *                  \p tag = \p output + \p length, and make sure that the
+ *                  output buffer is at least \p length + \p tag_len wide.
+ *
+ * \param ctx       The CCM context to use for encryption. This must be
+ *                  initialized and bound to a key.
+ * \param length    The length of the input data in Bytes.
+ * \param iv        The initialization vector (nonce). This must be a readable
+ *                  buffer of at least \p iv_len Bytes.
+ * \param iv_len    The length of the nonce in Bytes: 7, 8, 9, 10, 11, 12,
+ *                  or 13. The length L of the message length field is
+ *                  15 - \p iv_len.
+ * \param ad        The additional data field. If \p ad_len is greater than
+ *                  zero, \p ad must be a readable buffer of at least that
+ *                  length.
+ * \param ad_len    The length of additional data in Bytes.
+ *                  This must be less than `2^16 - 2^8`.
+ * \param input     The buffer holding the input data. If \p length is greater
+ *                  than zero, \p input must be a readable buffer of at least
+ *                  that length.
+ * \param output    The buffer holding the output data. If \p length is greater
+ *                  than zero, \p output must be a writable buffer of at least
+ *                  that length.
+ * \param tag       The buffer holding the authentication field. This must be a
+ *                  writable buffer of at least \p tag_len Bytes.
+ * \param tag_len   The length of the authentication field to generate in Bytes:
+ *                  4, 6, 8, 10, 12, 14 or 16.
+ *
+ * \return          \c 0 on success.
+ * \return          A CCM or cipher-specific error code on failure.
+ */
+int mbedtls_ccm_encrypt_and_tag(mbedtls_ccm_context* ctx, size_t length, const unsigned char* iv,
+    size_t iv_len, const unsigned char* ad, size_t ad_len, const unsigned char* input,
+    unsigned char* output, unsigned char* tag, size_t tag_len);
+
+/**
+ * \brief           This function encrypts a buffer using CCM*.
+ *
+ * \note            The tag is written to a separate buffer. To concatenate
+ *                  the \p tag with the \p output, as done in <em>RFC-3610:
+ *                  Counter with CBC-MAC (CCM)</em>, use
+ *                  \p tag = \p output + \p length, and make sure that the
+ *                  output buffer is at least \p length + \p tag_len wide.
+ *
+ * \note            When using this function in a variable tag length context,
+ *                  the tag length has to be encoded into the \p iv passed to
+ *                  this function.
+ *
+ * \param ctx       The CCM context to use for encryption. This must be
+ *                  initialized and bound to a key.
+ * \param length    The length of the input data in Bytes.
+ *                  For tag length = 0, input length is ignored.
+ * \param iv        The initialization vector (nonce). This must be a readable
+ *                  buffer of at least \p iv_len Bytes.
+ * \param iv_len    The length of the nonce in Bytes: 7, 8, 9, 10, 11, 12,
+ *                  or 13. The length L of the message length field is
+ *                  15 - \p iv_len.
+ * \param ad        The additional data field. This must be a readable buffer of
+ *                  at least \p ad_len Bytes.
+ * \param ad_len    The length of additional data in Bytes.
+ *                  This must be less than 2^16 - 2^8.
+ * \param input     The buffer holding the input data. If \p length is greater
+ *                  than zero, \p input must be a readable buffer of at least
+ *                  that length.
+ * \param output    The buffer holding the output data. If \p length is greater
+ *                  than zero, \p output must be a writable buffer of at least
+ *                  that length.
+ * \param tag       The buffer holding the authentication field. This must be a
+ *                  writable buffer of at least \p tag_len Bytes.
+ * \param tag_len   The length of the authentication field to generate in Bytes:
+ *                  0, 4, 6, 8, 10, 12, 14 or 16.
+ *
+ * \warning         Passing \c 0 as \p tag_len means that the message is no
+ *                  longer authenticated.
+ *
+ * \return          \c 0 on success.
+ * \return          A CCM or cipher-specific error code on failure.
+ */
+int mbedtls_ccm_star_encrypt_and_tag(mbedtls_ccm_context* ctx, size_t length,
+    const unsigned char* iv, size_t iv_len, const unsigned char* ad, size_t ad_len,
+    const unsigned char* input, unsigned char* output, unsigned char* tag, size_t tag_len);
+
+/**
+ * \brief           This function performs a CCM authenticated decryption of a
+ *                  buffer.
+ *
+ * \param ctx       The CCM context to use for decryption. This must be
+ *                  initialized and bound to a key.
+ * \param length    The length of the input data in Bytes.
+ * \param iv        The initialization vector (nonce). This must be a readable
+ *                  buffer of at least \p iv_len Bytes.
+ * \param iv_len    The length of the nonce in Bytes: 7, 8, 9, 10, 11, 12,
+ *                  or 13. The length L of the message length field is
+ *                  15 - \p iv_len.
+ * \param ad        The additional data field. This must be a readable buffer
+ *                  of at least that \p ad_len Bytes..
+ * \param ad_len    The length of additional data in Bytes.
+ *                  This must be less than 2^16 - 2^8.
+ * \param input     The buffer holding the input data. If \p length is greater
+ *                  than zero, \p input must be a readable buffer of at least
+ *                  that length.
+ * \param output    The buffer holding the output data. If \p length is greater
+ *                  than zero, \p output must be a writable buffer of at least
+ *                  that length.
+ * \param tag       The buffer holding the authentication field. This must be a
+ *                  readable buffer of at least \p tag_len Bytes.
+ * \param tag_len   The length of the authentication field to generate in Bytes:
+ *                  4, 6, 8, 10, 12, 14 or 16.
+ *
+ * \return          \c 0 on success. This indicates that the message is authentic.
+ * \return          #MBEDTLS_ERR_CCM_AUTH_FAILED if the tag does not match.
+ * \return          A cipher-specific error code on calculation failure.
+ */
+int mbedtls_ccm_auth_decrypt(mbedtls_ccm_context* ctx, size_t length, const unsigned char* iv,
+    size_t iv_len, const unsigned char* ad, size_t ad_len, const unsigned char* input,
+    unsigned char* output, const unsigned char* tag, size_t tag_len);
+
+/**
+ * \brief           This function performs a CCM* authenticated decryption of a
+ *                  buffer.
+ *
+ * \note            When using this function in a variable tag length context,
+ *                  the tag length has to be decoded from \p iv and passed to
+ *                  this function as \p tag_len. (\p tag needs to be adjusted
+ *                  accordingly.)
+ *
+ * \param ctx       The CCM context to use for decryption. This must be
+ *                  initialized and bound to a key.
+ * \param length    The length of the input data in Bytes.
+ *                  For tag length = 0, input length is ignored.
+ * \param iv        The initialization vector (nonce). This must be a readable
+ *                  buffer of at least \p iv_len Bytes.
+ * \param iv_len    The length of the nonce in Bytes: 7, 8, 9, 10, 11, 12,
+ *                  or 13. The length L of the message length field is
+ *                  15 - \p iv_len.
+ * \param ad        The additional data field. This must be a readable buffer of
+ *                  at least that \p ad_len Bytes.
+ * \param ad_len    The length of additional data in Bytes.
+ *                  This must be less than 2^16 - 2^8.
+ * \param input     The buffer holding the input data. If \p length is greater
+ *                  than zero, \p input must be a readable buffer of at least
+ *                  that length.
+ * \param output    The buffer holding the output data. If \p length is greater
+ *                  than zero, \p output must be a writable buffer of at least
+ *                  that length.
+ * \param tag       The buffer holding the authentication field. This must be a
+ *                  readable buffer of at least \p tag_len Bytes.
+ * \param tag_len   The length of the authentication field in Bytes.
+ *                  0, 4, 6, 8, 10, 12, 14 or 16.
+ *
+ * \warning         Passing \c 0 as \p tag_len means that the message is nos
+ *                  longer authenticated.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_CCM_AUTH_FAILED if the tag does not match.
+ * \return          A cipher-specific error code on calculation failure.
+ */
+int mbedtls_ccm_star_auth_decrypt(mbedtls_ccm_context* ctx, size_t length, const unsigned char* iv,
+    size_t iv_len, const unsigned char* ad, size_t ad_len, const unsigned char* input,
+    unsigned char* output, const unsigned char* tag, size_t tag_len);
+
+/**
+ * \brief           This function starts a CCM encryption or decryption
+ *                  operation.
+ *
+ *                  This function and mbedtls_ccm_set_lengths() must be called
+ *                  before calling mbedtls_ccm_update_ad() or
+ *                  mbedtls_ccm_update(). This function can be called before
+ *                  or after mbedtls_ccm_set_lengths().
+ *
+ * \note            This function is not implemented in Mbed TLS yet.
+ *
+ * \param ctx       The CCM context. This must be initialized.
+ * \param mode      The operation to perform: #MBEDTLS_CCM_ENCRYPT or
+ *                  #MBEDTLS_CCM_DECRYPT or #MBEDTLS_CCM_STAR_ENCRYPT or
+ *                  #MBEDTLS_CCM_STAR_DECRYPT.
+ * \param iv        The initialization vector. This must be a readable buffer
+ *                  of at least \p iv_len Bytes.
+ * \param iv_len    The length of the nonce in Bytes: 7, 8, 9, 10, 11, 12,
+ *                  or 13. The length L of the message length field is
+ *                  15 - \p iv_len.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_CCM_BAD_INPUT on failure:
+ *                  \p ctx is in an invalid state,
+ *                  \p mode is invalid,
+ *                  \p iv_len is invalid (lower than \c 7 or greater than
+ *                  \c 13).
+ */
+int mbedtls_ccm_starts(mbedtls_ccm_context* ctx, int mode, const unsigned char* iv, size_t iv_len);
+
+/**
+ * \brief           This function declares the lengths of the message
+ *                  and additional data for a CCM encryption or decryption
+ *                  operation.
+ *
+ *                  This function and mbedtls_ccm_starts() must be called
+ *                  before calling mbedtls_ccm_update_ad() or
+ *                  mbedtls_ccm_update(). This function can be called before
+ *                  or after mbedtls_ccm_starts().
+ *
+ * \note            This function is not implemented in Mbed TLS yet.
+ *
+ * \param ctx       The CCM context. This must be initialized.
+ * \param total_ad_len   The total length of additional data in bytes.
+ *                       This must be less than `2^16 - 2^8`.
+ * \param plaintext_len  The length in bytes of the plaintext to encrypt or
+ *                       result of the decryption (thus not encompassing the
+ *                       additional data that are not encrypted).
+ * \param tag_len   The length of the tag to generate in Bytes:
+ *                  4, 6, 8, 10, 12, 14 or 16.
+ *                  For CCM*, zero is also valid.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_CCM_BAD_INPUT on failure:
+ *                  \p ctx is in an invalid state,
+ *                  \p total_ad_len is greater than \c 0xFF00.
+ */
+int mbedtls_ccm_set_lengths(mbedtls_ccm_context* ctx, size_t total_ad_len, size_t plaintext_len,
+    size_t tag_len);
+
+/**
+ * \brief           This function feeds an input buffer as associated data
+ *                  (authenticated but not encrypted data) in a CCM
+ *                  encryption or decryption operation.
+ *
+ *                  You may call this function zero, one or more times
+ *                  to pass successive parts of the additional data. The
+ *                  lengths \p ad_len of the data parts should eventually add
+ *                  up exactly to the total length of additional data
+ *                  \c total_ad_len passed to mbedtls_ccm_set_lengths(). You
+ *                  may not call this function after calling
+ *                  mbedtls_ccm_update().
+ *
+ * \note            This function is not implemented in Mbed TLS yet.
+ *
+ * \param ctx       The CCM context. This must have been started with
+ *                  mbedtls_ccm_starts(), the lengths of the message and
+ *                  additional data must have been declared with
+ *                  mbedtls_ccm_set_lengths() and this must not have yet
+ *                  received any input with mbedtls_ccm_update().
+ * \param ad        The buffer holding the additional data, or \c NULL
+ *                  if \p ad_len is \c 0.
+ * \param ad_len    The length of the additional data. If \c 0,
+ *                  \p ad may be \c NULL.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_CCM_BAD_INPUT on failure:
+ *                  \p ctx is in an invalid state,
+ *                  total input length too long.
+ */
+int mbedtls_ccm_update_ad(mbedtls_ccm_context* ctx, const unsigned char* ad, size_t ad_len);
+
+/**
+ * \brief           This function feeds an input buffer into an ongoing CCM
+ *                  encryption or decryption operation.
+ *
+ *                  You may call this function zero, one or more times
+ *                  to pass successive parts of the input: the plaintext to
+ *                  encrypt, or the ciphertext (not including the tag) to
+ *                  decrypt. After the last part of the input, call
+ *                  mbedtls_ccm_finish(). The lengths \p input_len of the
+ *                  data parts should eventually add up exactly to the
+ *                  plaintext length \c plaintext_len passed to
+ *                  mbedtls_ccm_set_lengths().
+ *
+ *                  This function may produce output in one of the following
+ *                  ways:
+ *                  - Immediate output: the output length is always equal
+ *                    to the input length.
+ *                  - Buffered output: except for the last part of input data,
+ *                    the output consists of a whole number of 16-byte blocks.
+ *                    If the total input length so far (not including
+ *                    associated data) is 16 \* *B* + *A* with *A* < 16 then
+ *                    the total output length is 16 \* *B*.
+ *                    For the last part of input data, the output length is
+ *                    equal to the input length plus the number of bytes (*A*)
+ *                    buffered in the previous call to the function (if any).
+ *                    The function uses the plaintext length
+ *                    \c plaintext_len passed to mbedtls_ccm_set_lengths()
+ *                    to detect the last part of input data.
+ *
+ *                  In particular:
+ *                  - It is always correct to call this function with
+ *                    \p output_size >= \p input_len + 15.
+ *                  - If \p input_len is a multiple of 16 for all the calls
+ *                    to this function during an operation (not necessary for
+ *                    the last one) then it is correct to use \p output_size
+ *                    =\p input_len.
+ *
+ * \note            This function is not implemented in Mbed TLS yet.
+ *
+ * \param ctx           The CCM context. This must have been started with
+ *                      mbedtls_ccm_starts() and the lengths of the message and
+ *                      additional data must have been declared with
+ *                      mbedtls_ccm_set_lengths().
+ * \param input         The buffer holding the input data. If \p input_len
+ *                      is greater than zero, this must be a readable buffer
+ *                      of at least \p input_len bytes.
+ * \param input_len     The length of the input data in bytes.
+ * \param output        The buffer for the output data. If \p output_size
+ *                      is greater than zero, this must be a writable buffer of
+ *                      at least \p output_size bytes.
+ * \param output_size   The size of the output buffer in bytes.
+ *                      See the function description regarding the output size.
+ * \param output_len    On success, \p *output_len contains the actual
+ *                      length of the output written in \p output.
+ *                      On failure, the content of \p *output_len is
+ *                      unspecified.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_CCM_BAD_INPUT on failure:
+ *                 \p ctx is in an invalid state,
+ *                 total input length too long,
+ *                 or \p output_size too small.
+ */
+int mbedtls_ccm_update(mbedtls_ccm_context* ctx, const unsigned char* input, size_t input_len,
+    unsigned char* output, size_t output_size, size_t* output_len);
+
+/**
+ * \brief           This function finishes the CCM operation and generates
+ *                  the authentication tag.
+ *
+ *                  It wraps up the CCM stream, and generates the
+ *                  tag. The tag can have a maximum length of 16 Bytes.
+ *
+ * \note            This function is not implemented in Mbed TLS yet.
+ *
+ * \param ctx       The CCM context. This must have been started with
+ *                  mbedtls_ccm_starts() and the lengths of the message and
+ *                  additional data must have been declared with
+ *                  mbedtls_ccm_set_lengths().
+ * \param tag       The buffer for holding the tag. If \p tag_len is greater
+ *                  than zero, this must be a writable buffer of at least \p
+ *                  tag_len Bytes.
+ * \param tag_len   The length of the tag. Must match the tag length passed to
+ *                  mbedtls_ccm_set_lengths() function.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_CCM_BAD_INPUT on failure:
+ *                  \p ctx is in an invalid state,
+ *                  invalid value of \p tag_len,
+ *                  the total amount of additional data passed to
+ *                  mbedtls_ccm_update_ad() was lower than the total length of
+ *                  additional data \c total_ad_len passed to
+ *                  mbedtls_ccm_set_lengths(),
+ *                  the total amount of input data passed to
+ *                  mbedtls_ccm_update() was lower than the plaintext length
+ *                  \c plaintext_len passed to mbedtls_ccm_set_lengths().
+ */
+int mbedtls_ccm_finish(mbedtls_ccm_context* ctx, unsigned char* tag, size_t tag_len);
+
+#if defined(MBEDTLS_SELF_TEST) && defined(MBEDTLS_AES_C)
+/**
+ * \brief          The CCM checkup routine.
+ *
+ * \return         \c 0 on success.
+ * \return         \c 1 on failure.
+ */
+int mbedtls_ccm_self_test(int verbose);
+#endif /* MBEDTLS_SELF_TEST && MBEDTLS_AES_C */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* MBEDTLS_CCM_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/check_config.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/check_config.h
new file mode 100644
index 0000000000..873bc4094d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/check_config.h
@@ -0,0 +1,791 @@
+/**
+ * \file check_config.h
+ *
+ * \brief Consistency checks for configuration options
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_CHECK_CONFIG_H
+#define MBEDTLS_CHECK_CONFIG_H
+
+/*
+ * We assume CHAR_BIT is 8 in many places. In practice, this is true on our
+ * target platforms, so not an issue, but let's just be extra sure.
+ */
+#include <limits.h>
+#if CHAR_BIT != 8
+#error "mbed TLS requires a platform with 8-bit chars"
+#endif
+
+#if defined(_WIN32)
+#if !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_C is required on Windows"
+#endif
+
+/* Fix the config here. Not convenient to put an #ifdef _WIN32 in mbedtls_config.h as
+ * it would confuse config.py. */
+#if !defined(MBEDTLS_PLATFORM_SNPRINTF_ALT) && !defined(MBEDTLS_PLATFORM_SNPRINTF_MACRO)
+#define MBEDTLS_PLATFORM_SNPRINTF_ALT
+#endif
+
+#if !defined(MBEDTLS_PLATFORM_VSNPRINTF_ALT) && !defined(MBEDTLS_PLATFORM_VSNPRINTF_MACRO)
+#define MBEDTLS_PLATFORM_VSNPRINTF_ALT
+#endif
+#endif /* _WIN32 */
+
+#if defined(TARGET_LIKE_MBED) && defined(MBEDTLS_NET_C)
+#error                                                                                             \
+    "The NET module is not available for mbed OS - please use the network functions provided by Mbed OS"
+#endif
+
+#if defined(MBEDTLS_DEPRECATED_WARNING) && !defined(__GNUC__) && !defined(__clang__)
+#error "MBEDTLS_DEPRECATED_WARNING only works with GCC and Clang"
+#endif
+
+#if defined(MBEDTLS_HAVE_TIME_DATE) && !defined(MBEDTLS_HAVE_TIME)
+#error "MBEDTLS_HAVE_TIME_DATE without MBEDTLS_HAVE_TIME does not make sense"
+#endif
+
+#if defined(MBEDTLS_AESNI_C) && !defined(MBEDTLS_HAVE_ASM)
+#error "MBEDTLS_AESNI_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_CTR_DRBG_C) && !defined(MBEDTLS_AES_C)
+#error "MBEDTLS_CTR_DRBG_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_DHM_C) && !defined(MBEDTLS_BIGNUM_C)
+#error "MBEDTLS_DHM_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_CMAC_C) && !defined(MBEDTLS_AES_C) && !defined(MBEDTLS_DES_C)
+#error "MBEDTLS_CMAC_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_NIST_KW_C) && (!defined(MBEDTLS_AES_C) || !defined(MBEDTLS_CIPHER_C))
+#error "MBEDTLS_NIST_KW_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECDH_C) && !defined(MBEDTLS_ECP_C)
+#error "MBEDTLS_ECDH_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECDSA_C) &&                                                                    \
+    (!defined(MBEDTLS_ECP_C) ||                                                                    \
+        !(defined(MBEDTLS_ECP_DP_SECP192R1_ENABLED) ||                                             \
+            defined(MBEDTLS_ECP_DP_SECP224R1_ENABLED) ||                                           \
+            defined(MBEDTLS_ECP_DP_SECP256R1_ENABLED) ||                                           \
+            defined(MBEDTLS_ECP_DP_SECP384R1_ENABLED) ||                                           \
+            defined(MBEDTLS_ECP_DP_SECP521R1_ENABLED) ||                                           \
+            defined(MBEDTLS_ECP_DP_SECP192K1_ENABLED) ||                                           \
+            defined(MBEDTLS_ECP_DP_SECP224K1_ENABLED) ||                                           \
+            defined(MBEDTLS_ECP_DP_SECP256K1_ENABLED) ||                                           \
+            defined(MBEDTLS_ECP_DP_BP256R1_ENABLED) || defined(MBEDTLS_ECP_DP_BP384R1_ENABLED) ||  \
+            defined(MBEDTLS_ECP_DP_BP512R1_ENABLED)) ||                                            \
+        !defined(MBEDTLS_ASN1_PARSE_C) || !defined(MBEDTLS_ASN1_WRITE_C))
+#error "MBEDTLS_ECDSA_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECJPAKE_C) && (!defined(MBEDTLS_ECP_C) || !defined(MBEDTLS_MD_C))
+#error "MBEDTLS_ECJPAKE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_RESTARTABLE) &&                                                            \
+    (defined(MBEDTLS_USE_PSA_CRYPTO) || defined(MBEDTLS_ECDH_COMPUTE_SHARED_ALT) ||                \
+        defined(MBEDTLS_ECDH_GEN_PUBLIC_ALT) || defined(MBEDTLS_ECDSA_SIGN_ALT) ||                 \
+        defined(MBEDTLS_ECDSA_VERIFY_ALT) || defined(MBEDTLS_ECDSA_GENKEY_ALT) ||                  \
+        defined(MBEDTLS_ECP_INTERNAL_ALT) || defined(MBEDTLS_ECP_ALT))
+#error                                                                                             \
+    "MBEDTLS_ECP_RESTARTABLE defined, but it cannot coexist with an alternative or PSA-based ECP implementation"
+#endif
+
+#if defined(MBEDTLS_ECDSA_DETERMINISTIC) && !defined(MBEDTLS_HMAC_DRBG_C)
+#error "MBEDTLS_ECDSA_DETERMINISTIC defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_C) &&                                                                      \
+    (!defined(MBEDTLS_BIGNUM_C) || (!defined(MBEDTLS_ECP_DP_SECP192R1_ENABLED) &&                  \
+                                       !defined(MBEDTLS_ECP_DP_SECP224R1_ENABLED) &&               \
+                                       !defined(MBEDTLS_ECP_DP_SECP256R1_ENABLED) &&               \
+                                       !defined(MBEDTLS_ECP_DP_SECP384R1_ENABLED) &&               \
+                                       !defined(MBEDTLS_ECP_DP_SECP521R1_ENABLED) &&               \
+                                       !defined(MBEDTLS_ECP_DP_BP256R1_ENABLED) &&                 \
+                                       !defined(MBEDTLS_ECP_DP_BP384R1_ENABLED) &&                 \
+                                       !defined(MBEDTLS_ECP_DP_BP512R1_ENABLED) &&                 \
+                                       !defined(MBEDTLS_ECP_DP_SECP192K1_ENABLED) &&               \
+                                       !defined(MBEDTLS_ECP_DP_SECP224K1_ENABLED) &&               \
+                                       !defined(MBEDTLS_ECP_DP_SECP256K1_ENABLED) &&               \
+                                       !defined(MBEDTLS_ECP_DP_CURVE25519_ENABLED) &&              \
+                                       !defined(MBEDTLS_ECP_DP_CURVE448_ENABLED)))
+#error "MBEDTLS_ECP_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PK_PARSE_C) && !defined(MBEDTLS_ASN1_PARSE_C)
+#error "MBEDTLS_PK_PARSE_C defined, but not all prerequesites"
+#endif
+
+#if defined(MBEDTLS_ENTROPY_C) && (!defined(MBEDTLS_SHA512_C) && !defined(MBEDTLS_SHA256_C))
+#error "MBEDTLS_ENTROPY_C defined, but not all prerequisites"
+#endif
+#if defined(MBEDTLS_ENTROPY_C) && defined(MBEDTLS_SHA512_C) &&                                     \
+    defined(MBEDTLS_CTR_DRBG_ENTROPY_LEN) && (MBEDTLS_CTR_DRBG_ENTROPY_LEN > 64)
+#error "MBEDTLS_CTR_DRBG_ENTROPY_LEN value too high"
+#endif
+#if defined(MBEDTLS_ENTROPY_C) &&                                                                  \
+    (!defined(MBEDTLS_SHA512_C) || defined(MBEDTLS_ENTROPY_FORCE_SHA256)) &&                       \
+    defined(MBEDTLS_CTR_DRBG_ENTROPY_LEN) && (MBEDTLS_CTR_DRBG_ENTROPY_LEN > 32)
+#error "MBEDTLS_CTR_DRBG_ENTROPY_LEN value too high"
+#endif
+#if defined(MBEDTLS_ENTROPY_C) && defined(MBEDTLS_ENTROPY_FORCE_SHA256) &&                         \
+    !defined(MBEDTLS_SHA256_C)
+#error "MBEDTLS_ENTROPY_FORCE_SHA256 defined, but not all prerequisites"
+#endif
+
+#if defined(__has_feature)
+#if __has_feature(memory_sanitizer)
+#define MBEDTLS_HAS_MEMSAN
+#endif
+#endif
+#if defined(MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN) && !defined(MBEDTLS_HAS_MEMSAN)
+#error "MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN requires building with MemorySanitizer"
+#endif
+#undef MBEDTLS_HAS_MEMSAN
+
+#if defined(MBEDTLS_GCM_C) &&                                                                      \
+    (!defined(MBEDTLS_AES_C) && !defined(MBEDTLS_CAMELLIA_C) && !defined(MBEDTLS_ARIA_C))
+#error "MBEDTLS_GCM_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_RANDOMIZE_JAC_ALT) && !defined(MBEDTLS_ECP_INTERNAL_ALT)
+#error "MBEDTLS_ECP_RANDOMIZE_JAC_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_ADD_MIXED_ALT) && !defined(MBEDTLS_ECP_INTERNAL_ALT)
+#error "MBEDTLS_ECP_ADD_MIXED_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_DOUBLE_JAC_ALT) && !defined(MBEDTLS_ECP_INTERNAL_ALT)
+#error "MBEDTLS_ECP_DOUBLE_JAC_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_NORMALIZE_JAC_MANY_ALT) && !defined(MBEDTLS_ECP_INTERNAL_ALT)
+#error "MBEDTLS_ECP_NORMALIZE_JAC_MANY_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_NORMALIZE_JAC_ALT) && !defined(MBEDTLS_ECP_INTERNAL_ALT)
+#error "MBEDTLS_ECP_NORMALIZE_JAC_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_DOUBLE_ADD_MXZ_ALT) && !defined(MBEDTLS_ECP_INTERNAL_ALT)
+#error "MBEDTLS_ECP_DOUBLE_ADD_MXZ_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_RANDOMIZE_MXZ_ALT) && !defined(MBEDTLS_ECP_INTERNAL_ALT)
+#error "MBEDTLS_ECP_RANDOMIZE_MXZ_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_NORMALIZE_MXZ_ALT) && !defined(MBEDTLS_ECP_INTERNAL_ALT)
+#error "MBEDTLS_ECP_NORMALIZE_MXZ_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ECP_NO_FALLBACK) && !defined(MBEDTLS_ECP_INTERNAL_ALT)
+#error "MBEDTLS_ECP_NO_FALLBACK defined, but no alternative implementation enabled"
+#endif
+
+#if defined(MBEDTLS_HKDF_C) && !defined(MBEDTLS_MD_C)
+#error "MBEDTLS_HKDF_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_HMAC_DRBG_C) && !defined(MBEDTLS_MD_C)
+#error "MBEDTLS_HMAC_DRBG_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_ECDH_ECDSA_ENABLED) &&                                            \
+    (!defined(MBEDTLS_ECDH_C) || !defined(MBEDTLS_ECDSA_C) || !defined(MBEDTLS_X509_CRT_PARSE_C))
+#error "MBEDTLS_KEY_EXCHANGE_ECDH_ECDSA_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_ECDH_RSA_ENABLED) &&                                              \
+    (!defined(MBEDTLS_ECDH_C) || !defined(MBEDTLS_RSA_C) || !defined(MBEDTLS_X509_CRT_PARSE_C))
+#error "MBEDTLS_KEY_EXCHANGE_ECDH_RSA_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_DHE_PSK_ENABLED) && !defined(MBEDTLS_DHM_C)
+#error "MBEDTLS_KEY_EXCHANGE_DHE_PSK_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_ECDHE_PSK_ENABLED) && !defined(MBEDTLS_ECDH_C)
+#error "MBEDTLS_KEY_EXCHANGE_ECDHE_PSK_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_DHE_RSA_ENABLED) &&                                               \
+    (!defined(MBEDTLS_DHM_C) || !defined(MBEDTLS_RSA_C) || !defined(MBEDTLS_X509_CRT_PARSE_C) ||   \
+        !defined(MBEDTLS_PKCS1_V15))
+#error "MBEDTLS_KEY_EXCHANGE_DHE_RSA_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_ECDHE_RSA_ENABLED) &&                                             \
+    (!defined(MBEDTLS_ECDH_C) || !defined(MBEDTLS_RSA_C) || !defined(MBEDTLS_X509_CRT_PARSE_C) ||  \
+        !defined(MBEDTLS_PKCS1_V15))
+#error "MBEDTLS_KEY_EXCHANGE_ECDHE_RSA_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_ECDHE_ECDSA_ENABLED) &&                                           \
+    (!defined(MBEDTLS_ECDH_C) || !defined(MBEDTLS_ECDSA_C) || !defined(MBEDTLS_X509_CRT_PARSE_C))
+#error "MBEDTLS_KEY_EXCHANGE_ECDHE_ECDSA_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_RSA_PSK_ENABLED) &&                                               \
+    (!defined(MBEDTLS_RSA_C) || !defined(MBEDTLS_X509_CRT_PARSE_C) || !defined(MBEDTLS_PKCS1_V15))
+#error "MBEDTLS_KEY_EXCHANGE_RSA_PSK_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_RSA_ENABLED) &&                                                   \
+    (!defined(MBEDTLS_RSA_C) || !defined(MBEDTLS_X509_CRT_PARSE_C) || !defined(MBEDTLS_PKCS1_V15))
+#error "MBEDTLS_KEY_EXCHANGE_RSA_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_ECJPAKE_ENABLED) &&                                               \
+    (!defined(MBEDTLS_ECJPAKE_C) || !defined(MBEDTLS_SHA256_C) ||                                  \
+        !defined(MBEDTLS_ECP_DP_SECP256R1_ENABLED))
+#error "MBEDTLS_KEY_EXCHANGE_ECJPAKE_ENABLED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_KEY_EXCHANGE_WITH_CERT_ENABLED) &&                                             \
+    !defined(MBEDTLS_SSL_KEEP_PEER_CERTIFICATE) &&                                                 \
+    (!defined(MBEDTLS_SHA256_C) && !defined(MBEDTLS_SHA512_C) && !defined(MBEDTLS_SHA1_C))
+#error                                                                                             \
+    "!MBEDTLS_SSL_KEEP_PEER_CERTIFICATE requires MBEDTLS_SHA512_C, MBEDTLS_SHA256_C or MBEDTLS_SHA1_C"
+#endif
+
+#if defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C) &&                                                      \
+    (!defined(MBEDTLS_PLATFORM_C) || !defined(MBEDTLS_PLATFORM_MEMORY))
+#error "MBEDTLS_MEMORY_BUFFER_ALLOC_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_MEMORY_BACKTRACE) && !defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
+#error "MBEDTLS_MEMORY_BACKTRACE defined, but not all prerequesites"
+#endif
+
+#if defined(MBEDTLS_MEMORY_DEBUG) && !defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
+#error "MBEDTLS_MEMORY_DEBUG defined, but not all prerequesites"
+#endif
+
+#if defined(MBEDTLS_PADLOCK_C) && !defined(MBEDTLS_HAVE_ASM)
+#error "MBEDTLS_PADLOCK_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PEM_PARSE_C) && !defined(MBEDTLS_BASE64_C)
+#error "MBEDTLS_PEM_PARSE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PEM_WRITE_C) && !defined(MBEDTLS_BASE64_C)
+#error "MBEDTLS_PEM_WRITE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PK_C) && (!defined(MBEDTLS_RSA_C) && !defined(MBEDTLS_ECP_C))
+#error "MBEDTLS_PK_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PK_PARSE_C) && !defined(MBEDTLS_PK_C)
+#error "MBEDTLS_PK_PARSE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PK_WRITE_C) && !defined(MBEDTLS_PK_C)
+#error "MBEDTLS_PK_WRITE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_EXIT_ALT) && !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_EXIT_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_EXIT_MACRO) && !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_EXIT_MACRO defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_EXIT_MACRO) &&                                                        \
+    (defined(MBEDTLS_PLATFORM_STD_EXIT) || defined(MBEDTLS_PLATFORM_EXIT_ALT))
+#error                                                                                             \
+    "MBEDTLS_PLATFORM_EXIT_MACRO and MBEDTLS_PLATFORM_STD_EXIT/MBEDTLS_PLATFORM_EXIT_ALT cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_TIME_ALT) &&                                                          \
+    (!defined(MBEDTLS_PLATFORM_C) || !defined(MBEDTLS_HAVE_TIME))
+#error "MBEDTLS_PLATFORM_TIME_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_TIME_MACRO) &&                                                        \
+    (!defined(MBEDTLS_PLATFORM_C) || !defined(MBEDTLS_HAVE_TIME))
+#error "MBEDTLS_PLATFORM_TIME_MACRO defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_TIME_TYPE_MACRO) &&                                                   \
+    (!defined(MBEDTLS_PLATFORM_C) || !defined(MBEDTLS_HAVE_TIME))
+#error "MBEDTLS_PLATFORM_TIME_TYPE_MACRO defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_TIME_MACRO) &&                                                        \
+    (defined(MBEDTLS_PLATFORM_STD_TIME) || defined(MBEDTLS_PLATFORM_TIME_ALT))
+#error                                                                                             \
+    "MBEDTLS_PLATFORM_TIME_MACRO and MBEDTLS_PLATFORM_STD_TIME/MBEDTLS_PLATFORM_TIME_ALT cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_TIME_TYPE_MACRO) &&                                                   \
+    (defined(MBEDTLS_PLATFORM_STD_TIME) || defined(MBEDTLS_PLATFORM_TIME_ALT))
+#error                                                                                             \
+    "MBEDTLS_PLATFORM_TIME_TYPE_MACRO and MBEDTLS_PLATFORM_STD_TIME/MBEDTLS_PLATFORM_TIME_ALT cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_FPRINTF_ALT) && !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_FPRINTF_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_FPRINTF_MACRO) && !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_FPRINTF_MACRO defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_FPRINTF_MACRO) &&                                                     \
+    (defined(MBEDTLS_PLATFORM_STD_FPRINTF) || defined(MBEDTLS_PLATFORM_FPRINTF_ALT))
+#error                                                                                             \
+    "MBEDTLS_PLATFORM_FPRINTF_MACRO and MBEDTLS_PLATFORM_STD_FPRINTF/MBEDTLS_PLATFORM_FPRINTF_ALT cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_FREE_MACRO) &&                                                        \
+    (!defined(MBEDTLS_PLATFORM_C) || !defined(MBEDTLS_PLATFORM_MEMORY))
+#error "MBEDTLS_PLATFORM_FREE_MACRO defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_FREE_MACRO) && defined(MBEDTLS_PLATFORM_STD_FREE)
+#error "MBEDTLS_PLATFORM_FREE_MACRO and MBEDTLS_PLATFORM_STD_FREE cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_FREE_MACRO) && !defined(MBEDTLS_PLATFORM_CALLOC_MACRO)
+#error "MBEDTLS_PLATFORM_CALLOC_MACRO must be defined if MBEDTLS_PLATFORM_FREE_MACRO is"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_CALLOC_MACRO) &&                                                      \
+    (!defined(MBEDTLS_PLATFORM_C) || !defined(MBEDTLS_PLATFORM_MEMORY))
+#error "MBEDTLS_PLATFORM_CALLOC_MACRO defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_CALLOC_MACRO) && defined(MBEDTLS_PLATFORM_STD_CALLOC)
+#error                                                                                             \
+    "MBEDTLS_PLATFORM_CALLOC_MACRO and MBEDTLS_PLATFORM_STD_CALLOC cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_CALLOC_MACRO) && !defined(MBEDTLS_PLATFORM_FREE_MACRO)
+#error "MBEDTLS_PLATFORM_FREE_MACRO must be defined if MBEDTLS_PLATFORM_CALLOC_MACRO is"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_MEMORY) && !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_MEMORY defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_PRINTF_ALT) && !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_PRINTF_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_PRINTF_MACRO) && !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_PRINTF_MACRO defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_PRINTF_MACRO) &&                                                      \
+    (defined(MBEDTLS_PLATFORM_STD_PRINTF) || defined(MBEDTLS_PLATFORM_PRINTF_ALT))
+#error                                                                                             \
+    "MBEDTLS_PLATFORM_PRINTF_MACRO and MBEDTLS_PLATFORM_STD_PRINTF/MBEDTLS_PLATFORM_PRINTF_ALT cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_SNPRINTF_ALT) && !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_SNPRINTF_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_SNPRINTF_MACRO) && !defined(MBEDTLS_PLATFORM_C)
+#error "MBEDTLS_PLATFORM_SNPRINTF_MACRO defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_SNPRINTF_MACRO) &&                                                    \
+    (defined(MBEDTLS_PLATFORM_STD_SNPRINTF) || defined(MBEDTLS_PLATFORM_SNPRINTF_ALT))
+#error                                                                                             \
+    "MBEDTLS_PLATFORM_SNPRINTF_MACRO and MBEDTLS_PLATFORM_STD_SNPRINTF/MBEDTLS_PLATFORM_SNPRINTF_ALT cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_MEM_HDR) && !defined(MBEDTLS_PLATFORM_NO_STD_FUNCTIONS)
+#error "MBEDTLS_PLATFORM_STD_MEM_HDR defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_CALLOC) && !defined(MBEDTLS_PLATFORM_MEMORY)
+#error "MBEDTLS_PLATFORM_STD_CALLOC defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_FREE) && !defined(MBEDTLS_PLATFORM_MEMORY)
+#error "MBEDTLS_PLATFORM_STD_FREE defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_EXIT) && !defined(MBEDTLS_PLATFORM_EXIT_ALT)
+#error "MBEDTLS_PLATFORM_STD_EXIT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_TIME) &&                                                          \
+    (!defined(MBEDTLS_PLATFORM_TIME_ALT) || !defined(MBEDTLS_HAVE_TIME))
+#error "MBEDTLS_PLATFORM_STD_TIME defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_FPRINTF) && !defined(MBEDTLS_PLATFORM_FPRINTF_ALT)
+#error "MBEDTLS_PLATFORM_STD_FPRINTF defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_PRINTF) && !defined(MBEDTLS_PLATFORM_PRINTF_ALT)
+#error "MBEDTLS_PLATFORM_STD_PRINTF defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_SNPRINTF) && !defined(MBEDTLS_PLATFORM_SNPRINTF_ALT)
+#error "MBEDTLS_PLATFORM_STD_SNPRINTF defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_ENTROPY_NV_SEED) &&                                                            \
+    (!defined(MBEDTLS_PLATFORM_C) || !defined(MBEDTLS_ENTROPY_C))
+#error "MBEDTLS_ENTROPY_NV_SEED defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_NV_SEED_ALT) && !defined(MBEDTLS_ENTROPY_NV_SEED)
+#error "MBEDTLS_PLATFORM_NV_SEED_ALT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_NV_SEED_READ) && !defined(MBEDTLS_PLATFORM_NV_SEED_ALT)
+#error "MBEDTLS_PLATFORM_STD_NV_SEED_READ defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_STD_NV_SEED_WRITE) && !defined(MBEDTLS_PLATFORM_NV_SEED_ALT)
+#error "MBEDTLS_PLATFORM_STD_NV_SEED_WRITE defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_NV_SEED_READ_MACRO) &&                                                \
+    (defined(MBEDTLS_PLATFORM_STD_NV_SEED_READ) || defined(MBEDTLS_PLATFORM_NV_SEED_ALT))
+#error                                                                                             \
+    "MBEDTLS_PLATFORM_NV_SEED_READ_MACRO and MBEDTLS_PLATFORM_STD_NV_SEED_READ cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_NV_SEED_WRITE_MACRO) &&                                               \
+    (defined(MBEDTLS_PLATFORM_STD_NV_SEED_WRITE) || defined(MBEDTLS_PLATFORM_NV_SEED_ALT))
+#error                                                                                             \
+    "MBEDTLS_PLATFORM_NV_SEED_WRITE_MACRO and MBEDTLS_PLATFORM_STD_NV_SEED_WRITE cannot be defined simultaneously"
+#endif
+
+#if defined(MBEDTLS_PSA_CRYPTO_C) &&                                                               \
+    !(((defined(MBEDTLS_CTR_DRBG_C) || defined(MBEDTLS_HMAC_DRBG_C)) &&                            \
+          defined(MBEDTLS_ENTROPY_C)) ||                                                           \
+        defined(MBEDTLS_PSA_CRYPTO_EXTERNAL_RNG))
+#error "MBEDTLS_PSA_CRYPTO_C defined, but not all prerequisites (missing RNG)"
+#endif
+
+#if defined(MBEDTLS_PSA_CRYPTO_SPM) && !defined(MBEDTLS_PSA_CRYPTO_C)
+#error "MBEDTLS_PSA_CRYPTO_SPM defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PSA_CRYPTO_SE_C) &&                                                            \
+    !(defined(MBEDTLS_PSA_CRYPTO_C) && defined(MBEDTLS_PSA_CRYPTO_STORAGE_C))
+#error "MBEDTLS_PSA_CRYPTO_SE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PSA_CRYPTO_STORAGE_C) && !defined(MBEDTLS_PSA_CRYPTO_C)
+#error "MBEDTLS_PSA_CRYPTO_STORAGE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PSA_INJECT_ENTROPY) &&                                                         \
+    !(defined(MBEDTLS_PSA_CRYPTO_STORAGE_C) && defined(MBEDTLS_ENTROPY_NV_SEED))
+#error "MBEDTLS_PSA_INJECT_ENTROPY defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PSA_INJECT_ENTROPY) && !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES)
+#error "MBEDTLS_PSA_INJECT_ENTROPY is not compatible with actual entropy sources"
+#endif
+
+#if defined(MBEDTLS_PSA_INJECT_ENTROPY) && defined(MBEDTLS_PSA_CRYPTO_EXTERNAL_RNG)
+#error "MBEDTLS_PSA_INJECT_ENTROPY is not compatible with MBEDTLS_PSA_CRYPTO_EXTERNAL_RNG"
+#endif
+
+#if defined(MBEDTLS_PSA_ITS_FILE_C) && !defined(MBEDTLS_FS_IO)
+#error "MBEDTLS_PSA_ITS_FILE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_PSA_CRYPTO_KEY_ID_ENCODES_OWNER) && defined(MBEDTLS_USE_PSA_CRYPTO)
+#error                                                                                             \
+    "MBEDTLS_PSA_CRYPTO_KEY_ID_ENCODES_OWNER defined, but it cannot coexist with MBEDTLS_USE_PSA_CRYPTO."
+#endif
+
+#if defined(MBEDTLS_RSA_C) && (!defined(MBEDTLS_BIGNUM_C) || !defined(MBEDTLS_OID_C))
+#error "MBEDTLS_RSA_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_RSA_C) && (!defined(MBEDTLS_PKCS1_V21) && !defined(MBEDTLS_PKCS1_V15))
+#error "MBEDTLS_RSA_C defined, but none of the PKCS1 versions enabled"
+#endif
+
+#if defined(MBEDTLS_X509_RSASSA_PSS_SUPPORT) &&                                                    \
+    (!defined(MBEDTLS_RSA_C) || !defined(MBEDTLS_PKCS1_V21))
+#error "MBEDTLS_X509_RSASSA_PSS_SUPPORT defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SHA384_C) && !defined(MBEDTLS_SHA512_C)
+#error "MBEDTLS_SHA384_C defined without MBEDTLS_SHA512_C"
+#endif
+
+#if defined(MBEDTLS_SHA224_C) && !defined(MBEDTLS_SHA256_C)
+#error "MBEDTLS_SHA224_C defined without MBEDTLS_SHA256_C"
+#endif
+
+#if defined(MBEDTLS_SHA256_C) && !defined(MBEDTLS_SHA224_C)
+#error "MBEDTLS_SHA256_C defined without MBEDTLS_SHA224_C"
+#endif
+
+#if defined(MBEDTLS_SSL_PROTO_TLS1_2) &&                                                           \
+    (!defined(MBEDTLS_SHA1_C) && !defined(MBEDTLS_SHA256_C) && !defined(MBEDTLS_SHA512_C))
+#error "MBEDTLS_SSL_PROTO_TLS1_2 defined, but not all prerequisites"
+#endif
+
+/*
+ * HKDF is mandatory for TLS 1.3.
+ * Otherwise support for at least one ciphersuite mandates either SHA_256 or
+ * SHA_384.
+ */
+#if defined(MBEDTLS_SSL_PROTO_TLS1_3) &&                                                           \
+    ((!defined(MBEDTLS_HKDF_C)) || (!defined(MBEDTLS_SHA256_C) && !defined(MBEDTLS_SHA384_C)) ||   \
+        (!defined(MBEDTLS_PSA_CRYPTO_C)))
+#error "MBEDTLS_SSL_PROTO_TLS1_3 defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_PROTO_TLS1_2) && !(defined(MBEDTLS_KEY_EXCHANGE_RSA_ENABLED) ||            \
+                                             defined(MBEDTLS_KEY_EXCHANGE_DHE_RSA_ENABLED) ||      \
+                                             defined(MBEDTLS_KEY_EXCHANGE_ECDHE_RSA_ENABLED) ||    \
+                                             defined(MBEDTLS_KEY_EXCHANGE_ECDHE_ECDSA_ENABLED) ||  \
+                                             defined(MBEDTLS_KEY_EXCHANGE_ECDH_RSA_ENABLED) ||     \
+                                             defined(MBEDTLS_KEY_EXCHANGE_ECDH_ECDSA_ENABLED) ||   \
+                                             defined(MBEDTLS_KEY_EXCHANGE_PSK_ENABLED) ||          \
+                                             defined(MBEDTLS_KEY_EXCHANGE_DHE_PSK_ENABLED) ||      \
+                                             defined(MBEDTLS_KEY_EXCHANGE_RSA_PSK_ENABLED) ||      \
+                                             defined(MBEDTLS_KEY_EXCHANGE_ECDHE_PSK_ENABLED) ||    \
+                                             defined(MBEDTLS_KEY_EXCHANGE_ECJPAKE_ENABLED))
+#error "One or more versions of the TLS protocol are enabled " \
+        "but no key exchange methods defined with MBEDTLS_KEY_EXCHANGE_xxxx"
+#endif
+
+#if defined(MBEDTLS_SSL_PROTO_DTLS) && !defined(MBEDTLS_SSL_PROTO_TLS1_2)
+#error "MBEDTLS_SSL_PROTO_DTLS defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_CLI_C) && !defined(MBEDTLS_SSL_TLS_C)
+#error "MBEDTLS_SSL_CLI_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_TLS_C) && (!defined(MBEDTLS_CIPHER_C) || !defined(MBEDTLS_MD_C))
+#error "MBEDTLS_SSL_TLS_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_SRV_C) && !defined(MBEDTLS_SSL_TLS_C)
+#error "MBEDTLS_SSL_SRV_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_TLS_C) && !defined(MBEDTLS_SSL_PROTO_TLS1_2)
+#error "MBEDTLS_SSL_TLS_C defined, but no protocols are active"
+#endif
+
+#if defined(MBEDTLS_SSL_DTLS_HELLO_VERIFY) && !defined(MBEDTLS_SSL_PROTO_DTLS)
+#error "MBEDTLS_SSL_DTLS_HELLO_VERIFY  defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_DTLS_CLIENT_PORT_REUSE) && !defined(MBEDTLS_SSL_DTLS_HELLO_VERIFY)
+#error "MBEDTLS_SSL_DTLS_CLIENT_PORT_REUSE  defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_DTLS_ANTI_REPLAY) &&                                                       \
+    (!defined(MBEDTLS_SSL_TLS_C) || !defined(MBEDTLS_SSL_PROTO_DTLS))
+#error "MBEDTLS_SSL_DTLS_ANTI_REPLAY  defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_DTLS_CONNECTION_ID) &&                                                     \
+    (!defined(MBEDTLS_SSL_TLS_C) || !defined(MBEDTLS_SSL_PROTO_DTLS))
+#error "MBEDTLS_SSL_DTLS_CONNECTION_ID  defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_DTLS_CONNECTION_ID) && defined(MBEDTLS_SSL_CID_IN_LEN_MAX) &&              \
+    MBEDTLS_SSL_CID_IN_LEN_MAX > 255
+#error "MBEDTLS_SSL_CID_IN_LEN_MAX too large (max 255)"
+#endif
+
+#if defined(MBEDTLS_SSL_DTLS_CONNECTION_ID) && defined(MBEDTLS_SSL_CID_OUT_LEN_MAX) &&             \
+    MBEDTLS_SSL_CID_OUT_LEN_MAX > 255
+#error "MBEDTLS_SSL_CID_OUT_LEN_MAX too large (max 255)"
+#endif
+
+#if defined(MBEDTLS_SSL_ENCRYPT_THEN_MAC) && !defined(MBEDTLS_SSL_PROTO_TLS1_2)
+#error "MBEDTLS_SSL_ENCRYPT_THEN_MAC defined, but not all prerequsites"
+#endif
+
+#if defined(MBEDTLS_SSL_EXTENDED_MASTER_SECRET) && !defined(MBEDTLS_SSL_PROTO_TLS1_2)
+#error "MBEDTLS_SSL_EXTENDED_MASTER_SECRET defined, but not all prerequsites"
+#endif
+
+#if defined(MBEDTLS_SSL_TICKET_C) && !defined(MBEDTLS_CIPHER_C)
+#error "MBEDTLS_SSL_TICKET_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_SERVER_NAME_INDICATION) && !defined(MBEDTLS_X509_CRT_PARSE_C)
+#error "MBEDTLS_SSL_SERVER_NAME_INDICATION defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_THREADING_PTHREAD)
+#if !defined(MBEDTLS_THREADING_C) || defined(MBEDTLS_THREADING_IMPL)
+#error "MBEDTLS_THREADING_PTHREAD defined, but not all prerequisites"
+#endif
+#define MBEDTLS_THREADING_IMPL
+#endif
+
+#if defined(MBEDTLS_THREADING_ALT)
+#if !defined(MBEDTLS_THREADING_C) || defined(MBEDTLS_THREADING_IMPL)
+#error "MBEDTLS_THREADING_ALT defined, but not all prerequisites"
+#endif
+#define MBEDTLS_THREADING_IMPL
+#endif
+
+#if defined(MBEDTLS_THREADING_C) && !defined(MBEDTLS_THREADING_IMPL)
+#error "MBEDTLS_THREADING_C defined, single threading implementation required"
+#endif
+#undef MBEDTLS_THREADING_IMPL
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO) && !defined(MBEDTLS_PSA_CRYPTO_C)
+#error "MBEDTLS_USE_PSA_CRYPTO defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_VERSION_FEATURES) && !defined(MBEDTLS_VERSION_C)
+#error "MBEDTLS_VERSION_FEATURES defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_X509_USE_C) &&                                                                 \
+    (!defined(MBEDTLS_BIGNUM_C) || !defined(MBEDTLS_OID_C) || !defined(MBEDTLS_ASN1_PARSE_C) ||    \
+        !defined(MBEDTLS_PK_PARSE_C))
+#error "MBEDTLS_X509_USE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_X509_CREATE_C) &&                                                              \
+    (!defined(MBEDTLS_BIGNUM_C) || !defined(MBEDTLS_OID_C) || !defined(MBEDTLS_ASN1_WRITE_C) ||    \
+        !defined(MBEDTLS_PK_WRITE_C))
+#error "MBEDTLS_X509_CREATE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_X509_CRT_PARSE_C) && (!defined(MBEDTLS_X509_USE_C))
+#error "MBEDTLS_X509_CRT_PARSE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_X509_CRL_PARSE_C) && (!defined(MBEDTLS_X509_USE_C))
+#error "MBEDTLS_X509_CRL_PARSE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_X509_CSR_PARSE_C) && (!defined(MBEDTLS_X509_USE_C))
+#error "MBEDTLS_X509_CSR_PARSE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_X509_CRT_WRITE_C) && (!defined(MBEDTLS_X509_CREATE_C))
+#error "MBEDTLS_X509_CRT_WRITE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_X509_CSR_WRITE_C) && (!defined(MBEDTLS_X509_CREATE_C))
+#error "MBEDTLS_X509_CSR_WRITE_C defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_HAVE_INT32) && defined(MBEDTLS_HAVE_INT64)
+#error "MBEDTLS_HAVE_INT32 and MBEDTLS_HAVE_INT64 cannot be defined simultaneously"
+#endif /* MBEDTLS_HAVE_INT32 && MBEDTLS_HAVE_INT64 */
+
+#if (defined(MBEDTLS_HAVE_INT32) || defined(MBEDTLS_HAVE_INT64)) && defined(MBEDTLS_HAVE_ASM)
+#error "MBEDTLS_HAVE_INT32/MBEDTLS_HAVE_INT64 and MBEDTLS_HAVE_ASM cannot be defined simultaneously"
+#endif /* (MBEDTLS_HAVE_INT32 || MBEDTLS_HAVE_INT64) && MBEDTLS_HAVE_ASM */
+
+#if defined(MBEDTLS_SSL_DTLS_SRTP) && (!defined(MBEDTLS_SSL_PROTO_DTLS))
+#error "MBEDTLS_SSL_DTLS_SRTP defined, but not all prerequisites"
+#endif
+
+#if defined(MBEDTLS_SSL_VARIABLE_BUFFER_LENGTH) && (!defined(MBEDTLS_SSL_MAX_FRAGMENT_LENGTH))
+#error "MBEDTLS_SSL_VARIABLE_BUFFER_LENGTH defined, but not all prerequisites"
+#endif
+
+/* Reject attempts to enable options that have been removed and that could
+ * cause a build to succeed but with features removed. */
+
+#if defined(MBEDTLS_HAVEGE_C) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_HAVEGE_C was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/2599"
+#endif
+
+#if defined(MBEDTLS_SSL_HW_RECORD_ACCEL) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_SSL_HW_RECORD_ACCEL was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/4031"
+#endif
+
+#if defined(MBEDTLS_SSL_PROTO_SSL3) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_SSL_PROTO_SSL3 (SSL v3.0 support) was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/4031"
+#endif
+
+#if defined(MBEDTLS_SSL_SRV_SUPPORT_SSLV2_CLIENT_HELLO) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_SSL_SRV_SUPPORT_SSLV2_CLIENT_HELLO (SSL v2 ClientHello support) was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/4031"
+#endif
+
+#if defined(MBEDTLS_SSL_TRUNCATED_HMAC_COMPAT) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_SSL_TRUNCATED_HMAC_COMPAT (compatibility with the buggy implementation of truncated HMAC in Mbed TLS up to 2.7) was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/4031"
+#endif
+
+#if defined(MBEDTLS_TLS_DEFAULT_ALLOW_SHA1_IN_CERTIFICATES) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_TLS_DEFAULT_ALLOW_SHA1_IN_CERTIFICATES was removed in Mbed TLS 3.0. See the ChangeLog entry if you really need SHA-1-signed certificates."
+#endif
+
+#if defined(MBEDTLS_ZLIB_SUPPORT) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_ZLIB_SUPPORT was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/4031"
+#endif
+
+#if defined(MBEDTLS_CHECK_PARAMS) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_CHECK_PARAMS was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/4313"
+#endif
+
+#if defined(MBEDTLS_SSL_CID_PADDING_GRANULARITY) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_SSL_CID_PADDING_GRANULARITY was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/4335"
+#endif
+
+#if defined(MBEDTLS_SSL_TLS1_3_PADDING_GRANULARITY) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_SSL_TLS1_3_PADDING_GRANULARITY was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/4335"
+#endif
+
+#if defined(MBEDTLS_SSL_TRUNCATED_HMAC) // no-check-names
+#error                                                                                             \
+    "MBEDTLS_SSL_TRUNCATED_HMAC was removed in Mbed TLS 3.0. See https://github.com/ARMmbed/mbedtls/issues/4341"
+#endif
+
+/*
+ * Avoid warning from -pedantic. This is a convenient place for this
+ * workaround since this is included by every single file before the
+ * #if defined(MBEDTLS_xxx_C) that results in empty translation units.
+ */
+typedef int mbedtls_iso_c_forbids_empty_translation_units;
+
+#endif /* MBEDTLS_CHECK_CONFIG_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/cipher.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/cipher.h
new file mode 100644
index 0000000000..27bbd307a8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/cipher.h
@@ -0,0 +1,1136 @@
+/**
+ * \file cipher.h
+ *
+ * \brief This file contains an abstraction interface for use with the cipher
+ * primitives provided by the library. It provides a common interface to all of
+ * the available cipher operations.
+ *
+ * \author Adriaan de Jong <dejong@fox-it.com>
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_CIPHER_H
+#define MBEDTLS_CIPHER_H
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/private_access.h"
+
+#if defined(MBEDTLS_GCM_C) || defined(MBEDTLS_CCM_C) || defined(MBEDTLS_CHACHAPOLY_C)
+#define MBEDTLS_CIPHER_MODE_AEAD
+#endif
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+#define MBEDTLS_CIPHER_MODE_WITH_PADDING
+#endif
+
+#if defined(MBEDTLS_CIPHER_NULL_CIPHER) || defined(MBEDTLS_CHACHA20_C)
+#define MBEDTLS_CIPHER_MODE_STREAM
+#endif
+
+#if (defined(__ARMCC_VERSION) || defined(_MSC_VER)) && !defined(inline) && !defined(__cplusplus)
+#define inline __inline
+#endif
+
+/** The selected feature is not available. */
+#define MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE -0x6080
+/** Bad input parameters. */
+#define MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA -0x6100
+/** Failed to allocate memory. */
+#define MBEDTLS_ERR_CIPHER_ALLOC_FAILED -0x6180
+/** Input data contains invalid padding and is rejected. */
+#define MBEDTLS_ERR_CIPHER_INVALID_PADDING -0x6200
+/** Decryption of block requires a full block. */
+#define MBEDTLS_ERR_CIPHER_FULL_BLOCK_EXPECTED -0x6280
+/** Authentication failed (for AEAD modes). */
+#define MBEDTLS_ERR_CIPHER_AUTH_FAILED -0x6300
+/** The context is invalid. For example, because it was freed. */
+#define MBEDTLS_ERR_CIPHER_INVALID_CONTEXT -0x6380
+
+#define MBEDTLS_CIPHER_VARIABLE_IV_LEN 0x01  /**< Cipher accepts IVs of variable length. */
+#define MBEDTLS_CIPHER_VARIABLE_KEY_LEN 0x02 /**< Cipher accepts keys of variable length. */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \brief     Supported cipher types.
+ *
+ * \warning   DES is considered weak cipher and its use
+ *            constitutes a security risk. Arm recommends considering stronger
+ *            ciphers instead.
+ */
+typedef enum {
+    MBEDTLS_CIPHER_ID_NONE = 0, /**< Placeholder to mark the end of cipher ID lists. */
+    MBEDTLS_CIPHER_ID_NULL,     /**< The identity cipher, treated as a stream cipher. */
+    MBEDTLS_CIPHER_ID_AES,      /**< The AES cipher. */
+    MBEDTLS_CIPHER_ID_DES,      /**< The DES cipher. */
+    MBEDTLS_CIPHER_ID_3DES,     /**< The Triple DES cipher. */
+    MBEDTLS_CIPHER_ID_CAMELLIA, /**< The Camellia cipher. */
+    MBEDTLS_CIPHER_ID_ARIA,     /**< The Aria cipher. */
+    MBEDTLS_CIPHER_ID_CHACHA20, /**< The ChaCha20 cipher. */
+} mbedtls_cipher_id_t;
+
+/**
+ * \brief     Supported {cipher type, cipher mode} pairs.
+ *
+ * \warning   DES is considered weak cipher and its use
+ *            constitutes a security risk. Arm recommends considering stronger
+ *            ciphers instead.
+ */
+typedef enum {
+    MBEDTLS_CIPHER_NONE = 0,            /**< Placeholder to mark the end of cipher-pair lists. */
+    MBEDTLS_CIPHER_NULL,                /**< The identity stream cipher. */
+    MBEDTLS_CIPHER_AES_128_ECB,         /**< AES cipher with 128-bit ECB mode. */
+    MBEDTLS_CIPHER_AES_192_ECB,         /**< AES cipher with 192-bit ECB mode. */
+    MBEDTLS_CIPHER_AES_256_ECB,         /**< AES cipher with 256-bit ECB mode. */
+    MBEDTLS_CIPHER_AES_128_CBC,         /**< AES cipher with 128-bit CBC mode. */
+    MBEDTLS_CIPHER_AES_192_CBC,         /**< AES cipher with 192-bit CBC mode. */
+    MBEDTLS_CIPHER_AES_256_CBC,         /**< AES cipher with 256-bit CBC mode. */
+    MBEDTLS_CIPHER_AES_128_CFB128,      /**< AES cipher with 128-bit CFB128 mode. */
+    MBEDTLS_CIPHER_AES_192_CFB128,      /**< AES cipher with 192-bit CFB128 mode. */
+    MBEDTLS_CIPHER_AES_256_CFB128,      /**< AES cipher with 256-bit CFB128 mode. */
+    MBEDTLS_CIPHER_AES_128_CTR,         /**< AES cipher with 128-bit CTR mode. */
+    MBEDTLS_CIPHER_AES_192_CTR,         /**< AES cipher with 192-bit CTR mode. */
+    MBEDTLS_CIPHER_AES_256_CTR,         /**< AES cipher with 256-bit CTR mode. */
+    MBEDTLS_CIPHER_AES_128_GCM,         /**< AES cipher with 128-bit GCM mode. */
+    MBEDTLS_CIPHER_AES_192_GCM,         /**< AES cipher with 192-bit GCM mode. */
+    MBEDTLS_CIPHER_AES_256_GCM,         /**< AES cipher with 256-bit GCM mode. */
+    MBEDTLS_CIPHER_CAMELLIA_128_ECB,    /**< Camellia cipher with 128-bit ECB mode. */
+    MBEDTLS_CIPHER_CAMELLIA_192_ECB,    /**< Camellia cipher with 192-bit ECB mode. */
+    MBEDTLS_CIPHER_CAMELLIA_256_ECB,    /**< Camellia cipher with 256-bit ECB mode. */
+    MBEDTLS_CIPHER_CAMELLIA_128_CBC,    /**< Camellia cipher with 128-bit CBC mode. */
+    MBEDTLS_CIPHER_CAMELLIA_192_CBC,    /**< Camellia cipher with 192-bit CBC mode. */
+    MBEDTLS_CIPHER_CAMELLIA_256_CBC,    /**< Camellia cipher with 256-bit CBC mode. */
+    MBEDTLS_CIPHER_CAMELLIA_128_CFB128, /**< Camellia cipher with 128-bit CFB128 mode. */
+    MBEDTLS_CIPHER_CAMELLIA_192_CFB128, /**< Camellia cipher with 192-bit CFB128 mode. */
+    MBEDTLS_CIPHER_CAMELLIA_256_CFB128, /**< Camellia cipher with 256-bit CFB128 mode. */
+    MBEDTLS_CIPHER_CAMELLIA_128_CTR,    /**< Camellia cipher with 128-bit CTR mode. */
+    MBEDTLS_CIPHER_CAMELLIA_192_CTR,    /**< Camellia cipher with 192-bit CTR mode. */
+    MBEDTLS_CIPHER_CAMELLIA_256_CTR,    /**< Camellia cipher with 256-bit CTR mode. */
+    MBEDTLS_CIPHER_CAMELLIA_128_GCM,    /**< Camellia cipher with 128-bit GCM mode. */
+    MBEDTLS_CIPHER_CAMELLIA_192_GCM,    /**< Camellia cipher with 192-bit GCM mode. */
+    MBEDTLS_CIPHER_CAMELLIA_256_GCM,    /**< Camellia cipher with 256-bit GCM mode. */
+    MBEDTLS_CIPHER_DES_ECB,             /**< DES cipher with ECB mode. */
+    MBEDTLS_CIPHER_DES_CBC,             /**< DES cipher with CBC mode. */
+    MBEDTLS_CIPHER_DES_EDE_ECB,         /**< DES cipher with EDE ECB mode. */
+    MBEDTLS_CIPHER_DES_EDE_CBC,         /**< DES cipher with EDE CBC mode. */
+    MBEDTLS_CIPHER_DES_EDE3_ECB,        /**< DES cipher with EDE3 ECB mode. */
+    MBEDTLS_CIPHER_DES_EDE3_CBC,        /**< DES cipher with EDE3 CBC mode. */
+    MBEDTLS_CIPHER_AES_128_CCM,         /**< AES cipher with 128-bit CCM mode. */
+    MBEDTLS_CIPHER_AES_192_CCM,         /**< AES cipher with 192-bit CCM mode. */
+    MBEDTLS_CIPHER_AES_256_CCM,         /**< AES cipher with 256-bit CCM mode. */
+    MBEDTLS_CIPHER_AES_128_CCM_STAR_NO_TAG, /**< AES cipher with 128-bit CCM_STAR_NO_TAG mode. */
+    MBEDTLS_CIPHER_AES_192_CCM_STAR_NO_TAG, /**< AES cipher with 192-bit CCM_STAR_NO_TAG mode. */
+    MBEDTLS_CIPHER_AES_256_CCM_STAR_NO_TAG, /**< AES cipher with 256-bit CCM_STAR_NO_TAG mode. */
+    MBEDTLS_CIPHER_CAMELLIA_128_CCM,        /**< Camellia cipher with 128-bit CCM mode. */
+    MBEDTLS_CIPHER_CAMELLIA_192_CCM,        /**< Camellia cipher with 192-bit CCM mode. */
+    MBEDTLS_CIPHER_CAMELLIA_256_CCM,        /**< Camellia cipher with 256-bit CCM mode. */
+    MBEDTLS_CIPHER_CAMELLIA_128_CCM_STAR_NO_TAG, /**< Camellia cipher with 128-bit CCM_STAR_NO_TAG
+                                                    mode. */
+    MBEDTLS_CIPHER_CAMELLIA_192_CCM_STAR_NO_TAG, /**< Camellia cipher with 192-bit CCM_STAR_NO_TAG
+                                                    mode. */
+    MBEDTLS_CIPHER_CAMELLIA_256_CCM_STAR_NO_TAG, /**< Camellia cipher with 256-bit CCM_STAR_NO_TAG
+                                                    mode. */
+    MBEDTLS_CIPHER_ARIA_128_ECB,                 /**< Aria cipher with 128-bit key and ECB mode. */
+    MBEDTLS_CIPHER_ARIA_192_ECB,                 /**< Aria cipher with 192-bit key and ECB mode. */
+    MBEDTLS_CIPHER_ARIA_256_ECB,                 /**< Aria cipher with 256-bit key and ECB mode. */
+    MBEDTLS_CIPHER_ARIA_128_CBC,                 /**< Aria cipher with 128-bit key and CBC mode. */
+    MBEDTLS_CIPHER_ARIA_192_CBC,                 /**< Aria cipher with 192-bit key and CBC mode. */
+    MBEDTLS_CIPHER_ARIA_256_CBC,                 /**< Aria cipher with 256-bit key and CBC mode. */
+    MBEDTLS_CIPHER_ARIA_128_CFB128,          /**< Aria cipher with 128-bit key and CFB-128 mode. */
+    MBEDTLS_CIPHER_ARIA_192_CFB128,          /**< Aria cipher with 192-bit key and CFB-128 mode. */
+    MBEDTLS_CIPHER_ARIA_256_CFB128,          /**< Aria cipher with 256-bit key and CFB-128 mode. */
+    MBEDTLS_CIPHER_ARIA_128_CTR,             /**< Aria cipher with 128-bit key and CTR mode. */
+    MBEDTLS_CIPHER_ARIA_192_CTR,             /**< Aria cipher with 192-bit key and CTR mode. */
+    MBEDTLS_CIPHER_ARIA_256_CTR,             /**< Aria cipher with 256-bit key and CTR mode. */
+    MBEDTLS_CIPHER_ARIA_128_GCM,             /**< Aria cipher with 128-bit key and GCM mode. */
+    MBEDTLS_CIPHER_ARIA_192_GCM,             /**< Aria cipher with 192-bit key and GCM mode. */
+    MBEDTLS_CIPHER_ARIA_256_GCM,             /**< Aria cipher with 256-bit key and GCM mode. */
+    MBEDTLS_CIPHER_ARIA_128_CCM,             /**< Aria cipher with 128-bit key and CCM mode. */
+    MBEDTLS_CIPHER_ARIA_192_CCM,             /**< Aria cipher with 192-bit key and CCM mode. */
+    MBEDTLS_CIPHER_ARIA_256_CCM,             /**< Aria cipher with 256-bit key and CCM mode. */
+    MBEDTLS_CIPHER_ARIA_128_CCM_STAR_NO_TAG, /**< Aria cipher with 128-bit key and CCM_STAR_NO_TAG
+                                                mode. */
+    MBEDTLS_CIPHER_ARIA_192_CCM_STAR_NO_TAG, /**< Aria cipher with 192-bit key and CCM_STAR_NO_TAG
+                                                mode. */
+    MBEDTLS_CIPHER_ARIA_256_CCM_STAR_NO_TAG, /**< Aria cipher with 256-bit key and CCM_STAR_NO_TAG
+                                                mode. */
+    MBEDTLS_CIPHER_AES_128_OFB,              /**< AES 128-bit cipher in OFB mode. */
+    MBEDTLS_CIPHER_AES_192_OFB,              /**< AES 192-bit cipher in OFB mode. */
+    MBEDTLS_CIPHER_AES_256_OFB,              /**< AES 256-bit cipher in OFB mode. */
+    MBEDTLS_CIPHER_AES_128_XTS,              /**< AES 128-bit cipher in XTS block mode. */
+    MBEDTLS_CIPHER_AES_256_XTS,              /**< AES 256-bit cipher in XTS block mode. */
+    MBEDTLS_CIPHER_CHACHA20,                 /**< ChaCha20 stream cipher. */
+    MBEDTLS_CIPHER_CHACHA20_POLY1305,        /**< ChaCha20-Poly1305 AEAD cipher. */
+    MBEDTLS_CIPHER_AES_128_KW,               /**< AES cipher with 128-bit NIST KW mode. */
+    MBEDTLS_CIPHER_AES_192_KW,               /**< AES cipher with 192-bit NIST KW mode. */
+    MBEDTLS_CIPHER_AES_256_KW,               /**< AES cipher with 256-bit NIST KW mode. */
+    MBEDTLS_CIPHER_AES_128_KWP,              /**< AES cipher with 128-bit NIST KWP mode. */
+    MBEDTLS_CIPHER_AES_192_KWP,              /**< AES cipher with 192-bit NIST KWP mode. */
+    MBEDTLS_CIPHER_AES_256_KWP,              /**< AES cipher with 256-bit NIST KWP mode. */
+} mbedtls_cipher_type_t;
+
+/** Supported cipher modes. */
+typedef enum {
+    MBEDTLS_MODE_NONE = 0,        /**< None.                        */
+    MBEDTLS_MODE_ECB,             /**< The ECB cipher mode.         */
+    MBEDTLS_MODE_CBC,             /**< The CBC cipher mode.         */
+    MBEDTLS_MODE_CFB,             /**< The CFB cipher mode.         */
+    MBEDTLS_MODE_OFB,             /**< The OFB cipher mode.         */
+    MBEDTLS_MODE_CTR,             /**< The CTR cipher mode.         */
+    MBEDTLS_MODE_GCM,             /**< The GCM cipher mode.         */
+    MBEDTLS_MODE_STREAM,          /**< The stream cipher mode.      */
+    MBEDTLS_MODE_CCM,             /**< The CCM cipher mode.         */
+    MBEDTLS_MODE_CCM_STAR_NO_TAG, /**< The CCM*-no-tag cipher mode. */
+    MBEDTLS_MODE_XTS,             /**< The XTS cipher mode.         */
+    MBEDTLS_MODE_CHACHAPOLY,      /**< The ChaCha-Poly cipher mode. */
+    MBEDTLS_MODE_KW,              /**< The SP800-38F KW mode */
+    MBEDTLS_MODE_KWP,             /**< The SP800-38F KWP mode */
+} mbedtls_cipher_mode_t;
+
+/** Supported cipher padding types. */
+typedef enum {
+    MBEDTLS_PADDING_PKCS7 = 0,     /**< PKCS7 padding (default).        */
+    MBEDTLS_PADDING_ONE_AND_ZEROS, /**< ISO/IEC 7816-4 padding.         */
+    MBEDTLS_PADDING_ZEROS_AND_LEN, /**< ANSI X.923 padding.             */
+    MBEDTLS_PADDING_ZEROS,         /**< Zero padding (not reversible). */
+    MBEDTLS_PADDING_NONE,          /**< Never pad (full blocks only).   */
+} mbedtls_cipher_padding_t;
+
+/** Type of operation. */
+typedef enum {
+    MBEDTLS_OPERATION_NONE = -1,
+    MBEDTLS_DECRYPT = 0,
+    MBEDTLS_ENCRYPT,
+} mbedtls_operation_t;
+
+enum {
+    /** Undefined key length. */
+    MBEDTLS_KEY_LENGTH_NONE = 0,
+    /** Key length, in bits (including parity), for DES keys. */
+    MBEDTLS_KEY_LENGTH_DES = 64,
+    /** Key length in bits, including parity, for DES in two-key EDE. */
+    MBEDTLS_KEY_LENGTH_DES_EDE = 128,
+    /** Key length in bits, including parity, for DES in three-key EDE. */
+    MBEDTLS_KEY_LENGTH_DES_EDE3 = 192,
+};
+
+/** Maximum length of any IV, in Bytes. */
+/* This should ideally be derived automatically from list of ciphers.
+ * This should be kept in sync with MBEDTLS_SSL_MAX_IV_LENGTH defined
+ * in library/ssl_misc.h. */
+#define MBEDTLS_MAX_IV_LENGTH 16
+
+/** Maximum block size of any cipher, in Bytes. */
+/* This should ideally be derived automatically from list of ciphers.
+ * This should be kept in sync with MBEDTLS_SSL_MAX_BLOCK_LENGTH defined
+ * in library/ssl_misc.h. */
+#define MBEDTLS_MAX_BLOCK_LENGTH 16
+
+/** Maximum key length, in Bytes. */
+/* This should ideally be derived automatically from list of ciphers.
+ * For now, only check whether XTS is enabled which uses 64 Byte keys,
+ * and use 32 Bytes as an upper bound for the maximum key length otherwise.
+ * This should be kept in sync with MBEDTLS_SSL_MAX_BLOCK_LENGTH defined
+ * in library/ssl_misc.h, which however deliberately ignores the case of XTS
+ * since the latter isn't used in SSL/TLS. */
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+#define MBEDTLS_MAX_KEY_LENGTH 64
+#else
+#define MBEDTLS_MAX_KEY_LENGTH 32
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+/**
+ * Base cipher information (opaque struct).
+ */
+typedef struct mbedtls_cipher_base_t mbedtls_cipher_base_t;
+
+/**
+ * CMAC context (opaque struct).
+ */
+typedef struct mbedtls_cmac_context_t mbedtls_cmac_context_t;
+
+/**
+ * Cipher information. Allows calling cipher functions
+ * in a generic way.
+ *
+ * \note        The library does not support custom cipher info structures,
+ *              only built-in structures returned by the functions
+ *              mbedtls_cipher_info_from_string(),
+ *              mbedtls_cipher_info_from_type(),
+ *              mbedtls_cipher_info_from_values(),
+ *              mbedtls_cipher_info_from_psa().
+ */
+typedef struct mbedtls_cipher_info_t {
+    /** Full cipher identifier. For example,
+     * MBEDTLS_CIPHER_AES_256_CBC.
+     */
+    mbedtls_cipher_type_t MBEDTLS_PRIVATE(type);
+
+    /** The cipher mode. For example, MBEDTLS_MODE_CBC. */
+    mbedtls_cipher_mode_t MBEDTLS_PRIVATE(mode);
+
+    /** The cipher key length, in bits. This is the
+     * default length for variable sized ciphers.
+     * Includes parity bits for ciphers like DES.
+     */
+    unsigned int MBEDTLS_PRIVATE(key_bitlen);
+
+    /** Name of the cipher. */
+    const char* MBEDTLS_PRIVATE(name);
+
+    /** IV or nonce size, in Bytes.
+     * For ciphers that accept variable IV sizes,
+     * this is the recommended size.
+     */
+    unsigned int MBEDTLS_PRIVATE(iv_size);
+
+    /** Bitflag comprised of MBEDTLS_CIPHER_VARIABLE_IV_LEN and
+     *  MBEDTLS_CIPHER_VARIABLE_KEY_LEN indicating whether the
+     *  cipher supports variable IV or variable key sizes, respectively.
+     */
+    int MBEDTLS_PRIVATE(flags);
+
+    /** The block size, in Bytes. */
+    unsigned int MBEDTLS_PRIVATE(block_size);
+
+    /** Struct for base cipher information and functions. */
+    const mbedtls_cipher_base_t* MBEDTLS_PRIVATE(base);
+
+} mbedtls_cipher_info_t;
+
+/**
+ * Generic cipher context.
+ */
+typedef struct mbedtls_cipher_context_t {
+    /** Information about the associated cipher. */
+    const mbedtls_cipher_info_t* MBEDTLS_PRIVATE(cipher_info);
+
+    /** Key length to use. */
+    int MBEDTLS_PRIVATE(key_bitlen);
+
+    /** Operation that the key of the context has been
+     * initialized for.
+     */
+    mbedtls_operation_t MBEDTLS_PRIVATE(operation);
+
+#if defined(MBEDTLS_CIPHER_MODE_WITH_PADDING)
+    /** Padding functions to use, if relevant for
+     * the specific cipher mode.
+     */
+    void (*MBEDTLS_PRIVATE(add_padding))(unsigned char* output, size_t olen, size_t data_len);
+    int (*MBEDTLS_PRIVATE(get_padding))(unsigned char* input, size_t ilen, size_t* data_len);
+#endif
+
+    /** Buffer for input that has not been processed yet. */
+    unsigned char MBEDTLS_PRIVATE(unprocessed_data)[MBEDTLS_MAX_BLOCK_LENGTH];
+
+    /** Number of Bytes that have not been processed yet. */
+    size_t MBEDTLS_PRIVATE(unprocessed_len);
+
+    /** Current IV or NONCE_COUNTER for CTR-mode, data unit (or sector) number
+     * for XTS-mode. */
+    unsigned char MBEDTLS_PRIVATE(iv)[MBEDTLS_MAX_IV_LENGTH];
+
+    /** IV size in Bytes, for ciphers with variable-length IVs. */
+    size_t MBEDTLS_PRIVATE(iv_size);
+
+    /** The cipher-specific context. */
+    void* MBEDTLS_PRIVATE(cipher_ctx);
+
+#if defined(MBEDTLS_CMAC_C)
+    /** CMAC-specific context. */
+    mbedtls_cmac_context_t* MBEDTLS_PRIVATE(cmac_ctx);
+#endif
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    /** Indicates whether the cipher operations should be performed
+     *  by Mbed TLS' own crypto library or an external implementation
+     *  of the PSA Crypto API.
+     *  This is unset if the cipher context was established through
+     *  mbedtls_cipher_setup(), and set if it was established through
+     *  mbedtls_cipher_setup_psa().
+     */
+    unsigned char MBEDTLS_PRIVATE(psa_enabled);
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+} mbedtls_cipher_context_t;
+
+/**
+ * \brief This function retrieves the list of ciphers supported
+ *        by the generic cipher module.
+ *
+ *        For any cipher identifier in the returned list, you can
+ *        obtain the corresponding generic cipher information structure
+ *        via mbedtls_cipher_info_from_type(), which can then be used
+ *        to prepare a cipher context via mbedtls_cipher_setup().
+ *
+ *
+ * \return      A statically-allocated array of cipher identifiers
+ *              of type cipher_type_t. The last entry is zero.
+ */
+const int* mbedtls_cipher_list(void);
+
+/**
+ * \brief               This function retrieves the cipher-information
+ *                      structure associated with the given cipher name.
+ *
+ * \param cipher_name   Name of the cipher to search for. This must not be
+ *                      \c NULL.
+ *
+ * \return              The cipher information structure associated with the
+ *                      given \p cipher_name.
+ * \return              \c NULL if the associated cipher information is not found.
+ */
+const mbedtls_cipher_info_t* mbedtls_cipher_info_from_string(const char* cipher_name);
+
+/**
+ * \brief               This function retrieves the cipher-information
+ *                      structure associated with the given cipher type.
+ *
+ * \param cipher_type   Type of the cipher to search for.
+ *
+ * \return              The cipher information structure associated with the
+ *                      given \p cipher_type.
+ * \return              \c NULL if the associated cipher information is not found.
+ */
+const mbedtls_cipher_info_t* mbedtls_cipher_info_from_type(const mbedtls_cipher_type_t cipher_type);
+
+/**
+ * \brief               This function retrieves the cipher-information
+ *                      structure associated with the given cipher ID,
+ *                      key size and mode.
+ *
+ * \param cipher_id     The ID of the cipher to search for. For example,
+ *                      #MBEDTLS_CIPHER_ID_AES.
+ * \param key_bitlen    The length of the key in bits.
+ * \param mode          The cipher mode. For example, #MBEDTLS_MODE_CBC.
+ *
+ * \return              The cipher information structure associated with the
+ *                      given \p cipher_id.
+ * \return              \c NULL if the associated cipher information is not found.
+ */
+const mbedtls_cipher_info_t* mbedtls_cipher_info_from_values(const mbedtls_cipher_id_t cipher_id,
+    int key_bitlen, const mbedtls_cipher_mode_t mode);
+
+/**
+ * \brief               Retrieve the identifier for a cipher info structure.
+ *
+ * \param[in] info      The cipher info structure to query.
+ *                      This may be \c NULL.
+ *
+ * \return              The full cipher identifier (\c MBEDTLS_CIPHER_xxx).
+ * \return              #MBEDTLS_CIPHER_NONE if \p info is \c NULL.
+ */
+// static inline mbedtls_cipher_type_t mbedtls_cipher_info_get_type(
+//    const mbedtls_cipher_info_t *info )
+//{
+//    if( info == NULL )
+//        return( MBEDTLS_CIPHER_NONE );
+//    else
+//        return( info->MBEDTLS_PRIVATE(type) );
+//}
+
+/**
+ * \brief               Retrieve the operation mode for a cipher info structure.
+ *
+ * \param[in] info      The cipher info structure to query.
+ *                      This may be \c NULL.
+ *
+ * \return              The cipher mode (\c MBEDTLS_MODE_xxx).
+ * \return              #MBEDTLS_MODE_NONE if \p info is \c NULL.
+ */
+// static inline mbedtls_cipher_mode_t mbedtls_cipher_info_get_mode(
+//    const mbedtls_cipher_info_t *info )
+//{
+//    if( info == NULL )
+//        return( MBEDTLS_MODE_NONE );
+//    else
+//        return( info->MBEDTLS_PRIVATE(mode) );
+//}
+
+/**
+ * \brief               Retrieve the key size for a cipher info structure.
+ *
+ * \param[in] info      The cipher info structure to query.
+ *                      This may be \c NULL.
+ *
+ * \return              The key length in bits.
+ *                      For variable-sized ciphers, this is the default length.
+ *                      For DES, this includes the parity bits.
+ * \return              \c 0 if \p info is \c NULL.
+ */
+// static inline size_t mbedtls_cipher_info_get_key_bitlen(
+//    const mbedtls_cipher_info_t *info )
+//{
+//    if( info == NULL )
+//        return( 0 );
+//    else
+//        return( info->MBEDTLS_PRIVATE(key_bitlen) );
+//}
+
+/**
+ * \brief               Retrieve the human-readable name for a
+ *                      cipher info structure.
+ *
+ * \param[in] info      The cipher info structure to query.
+ *                      This may be \c NULL.
+ *
+ * \return              The cipher name, which is a human readable string,
+ *                      with static storage duration.
+ * \return              \c NULL if \c info is \p NULL.
+ */
+// static inline const char *mbedtls_cipher_info_get_name(
+//    const mbedtls_cipher_info_t *info )
+//{
+//    if( info == NULL )
+//        return( NULL );
+//    else
+//        return( info->MBEDTLS_PRIVATE(name) );
+//}
+
+/**
+ * \brief       This function returns the size of the IV or nonce
+ *              for the cipher info structure, in bytes.
+ *
+ * \param info  The cipher info structure. This may be \c NULL.
+ *
+ * \return      The recommended IV size.
+ * \return      \c 0 for ciphers not using an IV or a nonce.
+ * \return      \c 0 if \p info is \c NULL.
+ */
+// static inline size_t mbedtls_cipher_info_get_iv_size(
+//    const mbedtls_cipher_info_t *info )
+//{
+//    if( info == NULL )
+//        return( 0 );
+//
+//    return( (size_t) info->MBEDTLS_PRIVATE(iv_size) );
+//}
+
+/**
+ * \brief        This function returns the block size of the given
+ *               cipher info structure in bytes.
+ *
+ * \param info   The cipher info structure. This may be \c NULL.
+ *
+ * \return       The block size of the cipher.
+ * \return       \c 1 if the cipher is a stream cipher.
+ * \return       \c 0 if \p info is \c NULL.
+ */
+// static inline size_t mbedtls_cipher_info_get_block_size(
+//    const mbedtls_cipher_info_t *info )
+//{
+//    if( info == NULL )
+//        return( 0 );
+//
+//    return( (size_t) info->MBEDTLS_PRIVATE(block_size) );
+//}
+
+/**
+ * \brief        This function returns a non-zero value if the key length for
+ *               the given cipher is variable.
+ *
+ * \param info   The cipher info structure. This may be \c NULL.
+ *
+ * \return       Non-zero if the key length is variable, \c 0 otherwise.
+ * \return       \c 0 if the given pointer is \c NULL.
+ */
+// static inline int mbedtls_cipher_info_has_variable_key_bitlen(
+//    const mbedtls_cipher_info_t *info )
+//{
+//    if( info == NULL )
+//        return( 0 );
+//
+//    return( info->MBEDTLS_PRIVATE(flags) & MBEDTLS_CIPHER_VARIABLE_KEY_LEN );
+//}
+
+/**
+ * \brief        This function returns a non-zero value if the IV size for
+ *               the given cipher is variable.
+ *
+ * \param info   The cipher info structure. This may be \c NULL.
+ *
+ * \return       Non-zero if the IV size is variable, \c 0 otherwise.
+ * \return       \c 0 if the given pointer is \c NULL.
+ */
+// static inline int mbedtls_cipher_info_has_variable_iv_size(
+//    const mbedtls_cipher_info_t *info )
+//{
+//    if( info == NULL )
+//        return( 0 );
+//
+//    return( info->MBEDTLS_PRIVATE(flags) & MBEDTLS_CIPHER_VARIABLE_IV_LEN );
+//}
+
+/**
+ * \brief               This function initializes a \p cipher_context as NONE.
+ *
+ * \param ctx           The context to be initialized. This must not be \c NULL.
+ */
+void mbedtls_cipher_init(mbedtls_cipher_context_t* ctx);
+
+/**
+ * \brief               This function frees and clears the cipher-specific
+ *                      context of \p ctx. Freeing \p ctx itself remains the
+ *                      responsibility of the caller.
+ *
+ * \param ctx           The context to be freed. If this is \c NULL, the
+ *                      function has no effect, otherwise this must point to an
+ *                      initialized context.
+ */
+void mbedtls_cipher_free(mbedtls_cipher_context_t* ctx);
+
+/**
+ * \brief               This function prepares a cipher context for
+ *                      use with the given cipher primitive.
+ *
+ * \note                After calling this function, you should call
+ *                      mbedtls_cipher_setkey() and, if the mode uses padding,
+ *                      mbedtls_cipher_set_padding_mode(), then for each
+ *                      message to encrypt or decrypt with this key, either:
+ *                      - mbedtls_cipher_crypt() for one-shot processing with
+ *                      non-AEAD modes;
+ *                      - mbedtls_cipher_auth_encrypt_ext() or
+ *                      mbedtls_cipher_auth_decrypt_ext() for one-shot
+ *                      processing with AEAD modes or NIST_KW;
+ *                      - for multi-part processing, see the documentation of
+ *                      mbedtls_cipher_reset().
+ *
+ * \param ctx           The context to prepare. This must be initialized by
+ *                      a call to mbedtls_cipher_init() first.
+ * \param cipher_info   The cipher to use.
+ *
+ * \return              \c 0 on success.
+ * \return              #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                      parameter-verification failure.
+ * \return              #MBEDTLS_ERR_CIPHER_ALLOC_FAILED if allocation of the
+ *                      cipher-specific context fails.
+ */
+int mbedtls_cipher_setup(mbedtls_cipher_context_t* ctx, const mbedtls_cipher_info_t* cipher_info);
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+/**
+ * \brief               This function initializes a cipher context for
+ *                      PSA-based use with the given cipher primitive.
+ *
+ * \note                See #MBEDTLS_USE_PSA_CRYPTO for information on PSA.
+ *
+ * \param ctx           The context to initialize. May not be \c NULL.
+ * \param cipher_info   The cipher to use.
+ * \param taglen        For AEAD ciphers, the length in bytes of the
+ *                      authentication tag to use. Subsequent uses of
+ *                      mbedtls_cipher_auth_encrypt_ext() or
+ *                      mbedtls_cipher_auth_decrypt_ext() must provide
+ *                      the same tag length.
+ *                      For non-AEAD ciphers, the value must be \c 0.
+ *
+ * \return              \c 0 on success.
+ * \return              #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                      parameter-verification failure.
+ * \return              #MBEDTLS_ERR_CIPHER_ALLOC_FAILED if allocation of the
+ *                      cipher-specific context fails.
+ */
+int mbedtls_cipher_setup_psa(mbedtls_cipher_context_t* ctx,
+    const mbedtls_cipher_info_t* cipher_info, size_t taglen);
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+/**
+ * \brief        This function returns the block size of the given cipher
+ *               in bytes.
+ *
+ * \param ctx    The context of the cipher.
+ *
+ * \return       The block size of the underlying cipher.
+ * \return       \c 1 if the cipher is a stream cipher.
+ * \return       \c 0 if \p ctx has not been initialized.
+ */
+static inline unsigned int mbedtls_cipher_get_block_size(const mbedtls_cipher_context_t* ctx) {
+    MBEDTLS_INTERNAL_VALIDATE_RET(ctx != NULL, 0);
+    if (ctx->MBEDTLS_PRIVATE(cipher_info) == NULL)
+        return 0;
+
+    return ctx->MBEDTLS_PRIVATE(cipher_info)->MBEDTLS_PRIVATE(block_size);
+}
+
+/**
+ * \brief        This function returns the mode of operation for
+ *               the cipher. For example, MBEDTLS_MODE_CBC.
+ *
+ * \param ctx    The context of the cipher. This must be initialized.
+ *
+ * \return       The mode of operation.
+ * \return       #MBEDTLS_MODE_NONE if \p ctx has not been initialized.
+ */
+// static inline mbedtls_cipher_mode_t mbedtls_cipher_get_cipher_mode(
+//    const mbedtls_cipher_context_t *ctx )
+//{
+//    MBEDTLS_INTERNAL_VALIDATE_RET( ctx != NULL, MBEDTLS_MODE_NONE );
+//    if( ctx->MBEDTLS_PRIVATE(cipher_info) == NULL )
+//        return MBEDTLS_MODE_NONE;
+//
+//    return ctx->MBEDTLS_PRIVATE(cipher_info)->MBEDTLS_PRIVATE(mode);
+//}
+
+/**
+ * \brief       This function returns the size of the IV or nonce
+ *              of the cipher, in Bytes.
+ *
+ * \param ctx   The context of the cipher. This must be initialized.
+ *
+ * \return      The recommended IV size if no IV has been set.
+ * \return      \c 0 for ciphers not using an IV or a nonce.
+ * \return      The actual size if an IV has been set.
+ */
+// static inline int mbedtls_cipher_get_iv_size(
+//    const mbedtls_cipher_context_t *ctx )
+//{
+//    MBEDTLS_INTERNAL_VALIDATE_RET( ctx != NULL, 0 );
+//    if( ctx->MBEDTLS_PRIVATE(cipher_info) == NULL )
+//        return 0;
+//
+//    if( ctx->MBEDTLS_PRIVATE(iv_size) != 0 )
+//        return (int) ctx->MBEDTLS_PRIVATE(iv_size);
+//
+//    return (int) ctx->MBEDTLS_PRIVATE(cipher_info)->MBEDTLS_PRIVATE(iv_size);
+//}
+
+/**
+ * \brief               This function returns the type of the given cipher.
+ *
+ * \param ctx           The context of the cipher. This must be initialized.
+ *
+ * \return              The type of the cipher.
+ * \return              #MBEDTLS_CIPHER_NONE if \p ctx has not been initialized.
+ */
+// static inline mbedtls_cipher_type_t mbedtls_cipher_get_type(
+//    const mbedtls_cipher_context_t *ctx )
+//{
+//    MBEDTLS_INTERNAL_VALIDATE_RET(
+//        ctx != NULL, MBEDTLS_CIPHER_NONE );
+//    if( ctx->MBEDTLS_PRIVATE(cipher_info) == NULL )
+//        return MBEDTLS_CIPHER_NONE;
+//
+//    return ctx->MBEDTLS_PRIVATE(cipher_info)->MBEDTLS_PRIVATE(type);
+//}
+
+/**
+ * \brief               This function returns the name of the given cipher
+ *                      as a string.
+ *
+ * \param ctx           The context of the cipher. This must be initialized.
+ *
+ * \return              The name of the cipher.
+ * \return              NULL if \p ctx has not been not initialized.
+ */
+// static inline const char *mbedtls_cipher_get_name(
+//    const mbedtls_cipher_context_t *ctx )
+//{
+//    MBEDTLS_INTERNAL_VALIDATE_RET( ctx != NULL, 0 );
+//    if( ctx->MBEDTLS_PRIVATE(cipher_info) == NULL )
+//        return 0;
+//
+//    return ctx->MBEDTLS_PRIVATE(cipher_info)->MBEDTLS_PRIVATE(name);
+//}
+
+/**
+ * \brief               This function returns the key length of the cipher.
+ *
+ * \param ctx           The context of the cipher. This must be initialized.
+ *
+ * \return              The key length of the cipher in bits.
+ * \return              #MBEDTLS_KEY_LENGTH_NONE if ctx \p has not been
+ *                      initialized.
+ */
+// static inline int mbedtls_cipher_get_key_bitlen(
+//    const mbedtls_cipher_context_t *ctx )
+//{
+//    MBEDTLS_INTERNAL_VALIDATE_RET(
+//        ctx != NULL, MBEDTLS_KEY_LENGTH_NONE );
+//    if( ctx->MBEDTLS_PRIVATE(cipher_info) == NULL )
+//        return MBEDTLS_KEY_LENGTH_NONE;
+//
+//    return (int) ctx->MBEDTLS_PRIVATE(cipher_info)->MBEDTLS_PRIVATE(key_bitlen);
+//}
+
+/**
+ * \brief          This function returns the operation of the given cipher.
+ *
+ * \param ctx      The context of the cipher. This must be initialized.
+ *
+ * \return         The type of operation: #MBEDTLS_ENCRYPT or #MBEDTLS_DECRYPT.
+ * \return         #MBEDTLS_OPERATION_NONE if \p ctx has not been initialized.
+ */
+// static inline mbedtls_operation_t mbedtls_cipher_get_operation(
+//    const mbedtls_cipher_context_t *ctx )
+//{
+//    MBEDTLS_INTERNAL_VALIDATE_RET(
+//        ctx != NULL, MBEDTLS_OPERATION_NONE );
+//    if( ctx->MBEDTLS_PRIVATE(cipher_info) == NULL )
+//        return MBEDTLS_OPERATION_NONE;
+//
+//    return ctx->MBEDTLS_PRIVATE(operation);
+//}
+
+/**
+ * \brief               This function sets the key to use with the given context.
+ *
+ * \param ctx           The generic cipher context. This must be initialized and
+ *                      bound to a cipher information structure.
+ * \param key           The key to use. This must be a readable buffer of at
+ *                      least \p key_bitlen Bits.
+ * \param key_bitlen    The key length to use, in Bits.
+ * \param operation     The operation that the key will be used for:
+ *                      #MBEDTLS_ENCRYPT or #MBEDTLS_DECRYPT.
+ *
+ * \return              \c 0 on success.
+ * \return              #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                      parameter-verification failure.
+ * \return              A cipher-specific error code on failure.
+ */
+int mbedtls_cipher_setkey(mbedtls_cipher_context_t* ctx, const unsigned char* key, int key_bitlen,
+    const mbedtls_operation_t operation);
+
+#if defined(MBEDTLS_CIPHER_MODE_WITH_PADDING)
+/**
+ * \brief               This function sets the padding mode, for cipher modes
+ *                      that use padding.
+ *
+ *                      The default passing mode is PKCS7 padding.
+ *
+ * \param ctx           The generic cipher context. This must be initialized and
+ *                      bound to a cipher information structure.
+ * \param mode          The padding mode.
+ *
+ * \return              \c 0 on success.
+ * \return              #MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE
+ *                      if the selected padding mode is not supported.
+ * \return              #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA if the cipher mode
+ *                      does not support padding.
+ */
+int mbedtls_cipher_set_padding_mode(mbedtls_cipher_context_t* ctx, mbedtls_cipher_padding_t mode);
+#endif /* MBEDTLS_CIPHER_MODE_WITH_PADDING */
+
+/**
+ * \brief           This function sets the initialization vector (IV)
+ *                  or nonce.
+ *
+ * \note            Some ciphers do not use IVs nor nonce. For these
+ *                  ciphers, this function has no effect.
+ *
+ * \param ctx       The generic cipher context. This must be initialized and
+ *                  bound to a cipher information structure.
+ * \param iv        The IV to use, or NONCE_COUNTER for CTR-mode ciphers. This
+ *                  must be a readable buffer of at least \p iv_len Bytes.
+ * \param iv_len    The IV length for ciphers with variable-size IV.
+ *                  This parameter is discarded by ciphers with fixed-size IV.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                  parameter-verification failure.
+ */
+int mbedtls_cipher_set_iv(mbedtls_cipher_context_t* ctx, const unsigned char* iv, size_t iv_len);
+
+/**
+ * \brief         This function resets the cipher state.
+ *
+ * \note          With non-AEAD ciphers, the order of calls for each message
+ *                is as follows:
+ *                1. mbedtls_cipher_set_iv() if the mode uses an IV/nonce.
+ *                2. mbedtls_cipher_reset()
+ *                3. mbedtls_cipher_update() one or more times
+ *                4. mbedtls_cipher_finish()
+ *                .
+ *                This sequence can be repeated to encrypt or decrypt multiple
+ *                messages with the same key.
+ *
+ * \note          With AEAD ciphers, the order of calls for each message
+ *                is as follows:
+ *                1. mbedtls_cipher_set_iv() if the mode uses an IV/nonce.
+ *                2. mbedtls_cipher_reset()
+ *                3. mbedtls_cipher_update_ad()
+ *                4. mbedtls_cipher_update() one or more times
+ *                5. mbedtls_cipher_finish()
+ *                6. mbedtls_cipher_check_tag() (for decryption) or
+ *                mbedtls_cipher_write_tag() (for encryption).
+ *                .
+ *                This sequence can be repeated to encrypt or decrypt multiple
+ *                messages with the same key.
+ *
+ * \param ctx     The generic cipher context. This must be bound to a key.
+ *
+ * \return        \c 0 on success.
+ * \return        #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                parameter-verification failure.
+ */
+int mbedtls_cipher_reset(mbedtls_cipher_context_t* ctx);
+
+#if defined(MBEDTLS_GCM_C) || defined(MBEDTLS_CHACHAPOLY_C)
+/**
+ * \brief               This function adds additional data for AEAD ciphers.
+ *                      Currently supported with GCM and ChaCha20+Poly1305.
+ *
+ * \param ctx           The generic cipher context. This must be initialized.
+ * \param ad            The additional data to use. This must be a readable
+ *                      buffer of at least \p ad_len Bytes.
+ * \param ad_len        The length of \p ad in Bytes.
+ *
+ * \return              \c 0 on success.
+ * \return              A specific error code on failure.
+ */
+int mbedtls_cipher_update_ad(mbedtls_cipher_context_t* ctx, const unsigned char* ad, size_t ad_len);
+#endif /* MBEDTLS_GCM_C || MBEDTLS_CHACHAPOLY_C */
+
+/**
+ * \brief               The generic cipher update function. It encrypts or
+ *                      decrypts using the given cipher context. Writes as
+ *                      many block-sized blocks of data as possible to output.
+ *                      Any data that cannot be written immediately is either
+ *                      added to the next block, or flushed when
+ *                      mbedtls_cipher_finish() is called.
+ *                      Exception: For MBEDTLS_MODE_ECB, expects a single block
+ *                      in size. For example, 16 Bytes for AES.
+ *
+ * \param ctx           The generic cipher context. This must be initialized and
+ *                      bound to a key.
+ * \param input         The buffer holding the input data. This must be a
+ *                      readable buffer of at least \p ilen Bytes.
+ * \param ilen          The length of the input data.
+ * \param output        The buffer for the output data. This must be able to
+ *                      hold at least `ilen + block_size`. This must not be the
+ *                      same buffer as \p input.
+ * \param olen          The length of the output data, to be updated with the
+ *                      actual number of Bytes written. This must not be
+ *                      \c NULL.
+ *
+ * \return              \c 0 on success.
+ * \return              #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                      parameter-verification failure.
+ * \return              #MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE on an
+ *                      unsupported mode for a cipher.
+ * \return              A cipher-specific error code on failure.
+ */
+int mbedtls_cipher_update(mbedtls_cipher_context_t* ctx, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen);
+
+/**
+ * \brief               The generic cipher finalization function. If data still
+ *                      needs to be flushed from an incomplete block, the data
+ *                      contained in it is padded to the size of
+ *                      the last block, and written to the \p output buffer.
+ *
+ * \param ctx           The generic cipher context. This must be initialized and
+ *                      bound to a key.
+ * \param output        The buffer to write data to. This needs to be a writable
+ *                      buffer of at least \p block_size Bytes.
+ * \param olen          The length of the data written to the \p output buffer.
+ *                      This may not be \c NULL.
+ *
+ * \return              \c 0 on success.
+ * \return              #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                      parameter-verification failure.
+ * \return              #MBEDTLS_ERR_CIPHER_FULL_BLOCK_EXPECTED on decryption
+ *                      expecting a full block but not receiving one.
+ * \return              #MBEDTLS_ERR_CIPHER_INVALID_PADDING on invalid padding
+ *                      while decrypting.
+ * \return              A cipher-specific error code on failure.
+ */
+int mbedtls_cipher_finish(mbedtls_cipher_context_t* ctx, unsigned char* output, size_t* olen);
+
+#if defined(MBEDTLS_GCM_C) || defined(MBEDTLS_CHACHAPOLY_C)
+/**
+ * \brief               This function writes a tag for AEAD ciphers.
+ *                      Currently supported with GCM and ChaCha20+Poly1305.
+ *                      This must be called after mbedtls_cipher_finish().
+ *
+ * \param ctx           The generic cipher context. This must be initialized,
+ *                      bound to a key, and have just completed a cipher
+ *                      operation through mbedtls_cipher_finish() the tag for
+ *                      which should be written.
+ * \param tag           The buffer to write the tag to. This must be a writable
+ *                      buffer of at least \p tag_len Bytes.
+ * \param tag_len       The length of the tag to write.
+ *
+ * \return              \c 0 on success.
+ * \return              A specific error code on failure.
+ */
+int mbedtls_cipher_write_tag(mbedtls_cipher_context_t* ctx, unsigned char* tag, size_t tag_len);
+
+/**
+ * \brief               This function checks the tag for AEAD ciphers.
+ *                      Currently supported with GCM and ChaCha20+Poly1305.
+ *                      This must be called after mbedtls_cipher_finish().
+ *
+ * \param ctx           The generic cipher context. This must be initialized.
+ * \param tag           The buffer holding the tag. This must be a readable
+ *                      buffer of at least \p tag_len Bytes.
+ * \param tag_len       The length of the tag to check.
+ *
+ * \return              \c 0 on success.
+ * \return              A specific error code on failure.
+ */
+int mbedtls_cipher_check_tag(mbedtls_cipher_context_t* ctx, const unsigned char* tag,
+    size_t tag_len);
+#endif /* MBEDTLS_GCM_C || MBEDTLS_CHACHAPOLY_C */
+
+/**
+ * \brief               The generic all-in-one encryption/decryption function,
+ *                      for all ciphers except AEAD constructs.
+ *
+ * \param ctx           The generic cipher context. This must be initialized.
+ * \param iv            The IV to use, or NONCE_COUNTER for CTR-mode ciphers.
+ *                      This must be a readable buffer of at least \p iv_len
+ *                      Bytes.
+ * \param iv_len        The IV length for ciphers with variable-size IV.
+ *                      This parameter is discarded by ciphers with fixed-size
+ *                      IV.
+ * \param input         The buffer holding the input data. This must be a
+ *                      readable buffer of at least \p ilen Bytes.
+ * \param ilen          The length of the input data in Bytes.
+ * \param output        The buffer for the output data. This must be able to
+ *                      hold at least `ilen + block_size`. This must not be the
+ *                      same buffer as \p input.
+ * \param olen          The length of the output data, to be updated with the
+ *                      actual number of Bytes written. This must not be
+ *                      \c NULL.
+ *
+ * \note                Some ciphers do not use IVs nor nonce. For these
+ *                      ciphers, use \p iv = NULL and \p iv_len = 0.
+ *
+ * \return              \c 0 on success.
+ * \return              #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                      parameter-verification failure.
+ * \return              #MBEDTLS_ERR_CIPHER_FULL_BLOCK_EXPECTED on decryption
+ *                      expecting a full block but not receiving one.
+ * \return              #MBEDTLS_ERR_CIPHER_INVALID_PADDING on invalid padding
+ *                      while decrypting.
+ * \return              A cipher-specific error code on failure.
+ */
+int mbedtls_cipher_crypt(mbedtls_cipher_context_t* ctx, const unsigned char* iv, size_t iv_len,
+    const unsigned char* input, size_t ilen, unsigned char* output, size_t* olen);
+
+#if defined(MBEDTLS_CIPHER_MODE_AEAD) || defined(MBEDTLS_NIST_KW_C)
+/**
+ * \brief               The authenticated encryption (AEAD/NIST_KW) function.
+ *
+ * \note                For AEAD modes, the tag will be appended to the
+ *                      ciphertext, as recommended by RFC 5116.
+ *                      (NIST_KW doesn't have a separate tag.)
+ *
+ * \param ctx           The generic cipher context. This must be initialized and
+ *                      bound to a key, with an AEAD algorithm or NIST_KW.
+ * \param iv            The nonce to use. This must be a readable buffer of
+ *                      at least \p iv_len Bytes and may be \c NULL if \p
+ *                      iv_len is \c 0.
+ * \param iv_len        The length of the nonce. For AEAD ciphers, this must
+ *                      satisfy the constraints imposed by the cipher used.
+ *                      For NIST_KW, this must be \c 0.
+ * \param ad            The additional data to authenticate. This must be a
+ *                      readable buffer of at least \p ad_len Bytes, and may
+ *                      be \c NULL is \p ad_len is \c 0.
+ * \param ad_len        The length of \p ad. For NIST_KW, this must be \c 0.
+ * \param input         The buffer holding the input data. This must be a
+ *                      readable buffer of at least \p ilen Bytes, and may be
+ *                      \c NULL if \p ilen is \c 0.
+ * \param ilen          The length of the input data.
+ * \param output        The buffer for the output data. This must be a
+ *                      writable buffer of at least \p output_len Bytes, and
+ *                      must not be \c NULL.
+ * \param output_len    The length of the \p output buffer in Bytes. For AEAD
+ *                      ciphers, this must be at least \p ilen + \p tag_len.
+ *                      For NIST_KW, this must be at least \p ilen + 8
+ *                      (rounded up to a multiple of 8 if KWP is used);
+ *                      \p ilen + 15 is always a safe value.
+ * \param olen          This will be filled with the actual number of Bytes
+ *                      written to the \p output buffer. This must point to a
+ *                      writable object of type \c size_t.
+ * \param tag_len       The desired length of the authentication tag. For AEAD
+ *                      ciphers, this must match the constraints imposed by
+ *                      the cipher used, and in particular must not be \c 0.
+ *                      For NIST_KW, this must be \c 0.
+ *
+ * \return              \c 0 on success.
+ * \return              #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                      parameter-verification failure.
+ * \return              A cipher-specific error code on failure.
+ */
+int mbedtls_cipher_auth_encrypt_ext(mbedtls_cipher_context_t* ctx, const unsigned char* iv,
+    size_t iv_len, const unsigned char* ad, size_t ad_len, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t output_len, size_t* olen, size_t tag_len);
+
+/**
+ * \brief               The authenticated encryption (AEAD/NIST_KW) function.
+ *
+ * \note                If the data is not authentic, then the output buffer
+ *                      is zeroed out to prevent the unauthentic plaintext being
+ *                      used, making this interface safer.
+ *
+ * \note                For AEAD modes, the tag must be appended to the
+ *                      ciphertext, as recommended by RFC 5116.
+ *                      (NIST_KW doesn't have a separate tag.)
+ *
+ * \param ctx           The generic cipher context. This must be initialized and
+ *                      bound to a key, with an AEAD algorithm or NIST_KW.
+ * \param iv            The nonce to use. This must be a readable buffer of
+ *                      at least \p iv_len Bytes and may be \c NULL if \p
+ *                      iv_len is \c 0.
+ * \param iv_len        The length of the nonce. For AEAD ciphers, this must
+ *                      satisfy the constraints imposed by the cipher used.
+ *                      For NIST_KW, this must be \c 0.
+ * \param ad            The additional data to authenticate. This must be a
+ *                      readable buffer of at least \p ad_len Bytes, and may
+ *                      be \c NULL is \p ad_len is \c 0.
+ * \param ad_len        The length of \p ad. For NIST_KW, this must be \c 0.
+ * \param input         The buffer holding the input data. This must be a
+ *                      readable buffer of at least \p ilen Bytes, and may be
+ *                      \c NULL if \p ilen is \c 0.
+ * \param ilen          The length of the input data. For AEAD ciphers this
+ *                      must be at least \p tag_len. For NIST_KW this must be
+ *                      at least \c 8.
+ * \param output        The buffer for the output data. This must be a
+ *                      writable buffer of at least \p output_len Bytes, and
+ *                      may be \c NULL if \p output_len is \c 0.
+ * \param output_len    The length of the \p output buffer in Bytes. For AEAD
+ *                      ciphers, this must be at least \p ilen - \p tag_len.
+ *                      For NIST_KW, this must be at least \p ilen - 8.
+ * \param olen          This will be filled with the actual number of Bytes
+ *                      written to the \p output buffer. This must point to a
+ *                      writable object of type \c size_t.
+ * \param tag_len       The actual length of the authentication tag. For AEAD
+ *                      ciphers, this must match the constraints imposed by
+ *                      the cipher used, and in particular must not be \c 0.
+ *                      For NIST_KW, this must be \c 0.
+ *
+ * \return              \c 0 on success.
+ * \return              #MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA on
+ *                      parameter-verification failure.
+ * \return              #MBEDTLS_ERR_CIPHER_AUTH_FAILED if data is not authentic.
+ * \return              A cipher-specific error code on failure.
+ */
+int mbedtls_cipher_auth_decrypt_ext(mbedtls_cipher_context_t* ctx, const unsigned char* iv,
+    size_t iv_len, const unsigned char* ad, size_t ad_len, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t output_len, size_t* olen, size_t tag_len);
+#endif /* MBEDTLS_CIPHER_MODE_AEAD || MBEDTLS_NIST_KW_C */
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* MBEDTLS_CIPHER_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/constant_time.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/constant_time.h
new file mode 100644
index 0000000000..c5b2334dad
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/constant_time.h
@@ -0,0 +1,42 @@
+/**
+ *  Constant-time functions
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_CONSTANT_TIME_H
+#define MBEDTLS_CONSTANT_TIME_H
+
+#include <stddef.h>
+
+/** Constant-time buffer comparison without branches.
+ *
+ * This is equivalent to the standard memcmp function, but is likely to be
+ * compiled to code using bitwise operation rather than a branch.
+ *
+ * This function can be used to write constant-time code by replacing branches
+ * with bit operations using masks.
+ *
+ * \param a     Pointer to the first buffer.
+ * \param b     Pointer to the second buffer.
+ * \param n     The number of bytes to compare in the buffer.
+ *
+ * \return      Zero if the content of the two buffer is the same,
+ *              otherwise non-zero.
+ */
+int mbedtls_ct_memcmp(const void* a, const void* b, size_t n);
+
+#endif /* MBEDTLS_CONSTANT_TIME_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/des.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/des.h
new file mode 100644
index 0000000000..656af738ba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/des.h
@@ -0,0 +1,347 @@
+/**
+ * \file des.h
+ *
+ * \brief DES block cipher
+ *
+ * \warning   DES is considered a weak cipher and its use constitutes a
+ *            security risk. We recommend considering stronger ciphers
+ *            instead.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ *
+ */
+#ifndef MBEDTLS_DES_H
+#define MBEDTLS_DES_H
+#include <stddef.h>
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/private_access.h"
+
+#define MBEDTLS_DES_ENCRYPT 1
+#define MBEDTLS_DES_DECRYPT 0
+
+/** The data input has an invalid length. */
+#define MBEDTLS_ERR_DES_INVALID_INPUT_LENGTH -0x0032
+
+#define MBEDTLS_DES_KEY_SIZE 8
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_DES_ALT)
+// Regular implementation
+//
+
+/**
+ * \brief          DES context structure
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+typedef struct mbedtls_des_context {
+    uint32_t MBEDTLS_PRIVATE(sk)[32]; /*!<  DES subkeys       */
+} mbedtls_des_context;
+
+/**
+ * \brief          Triple-DES context structure
+ */
+typedef struct mbedtls_des3_context {
+    uint32_t MBEDTLS_PRIVATE(sk)[96]; /*!<  3DES subkeys      */
+} mbedtls_des3_context;
+
+#else /* MBEDTLS_DES_ALT */
+#include "des_alt.h"
+#endif /* MBEDTLS_DES_ALT */
+
+/**
+ * \brief          Initialize DES context
+ *
+ * \param ctx      DES context to be initialized
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+void mbedtls_des_init(mbedtls_des_context* ctx);
+
+/**
+ * \brief          Clear DES context
+ *
+ * \param ctx      DES context to be cleared
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+void mbedtls_des_free(mbedtls_des_context* ctx);
+
+/**
+ * \brief          Initialize Triple-DES context
+ *
+ * \param ctx      DES3 context to be initialized
+ */
+void mbedtls_des3_init(mbedtls_des3_context* ctx);
+
+/**
+ * \brief          Clear Triple-DES context
+ *
+ * \param ctx      DES3 context to be cleared
+ */
+void mbedtls_des3_free(mbedtls_des3_context* ctx);
+
+/**
+ * \brief          Set key parity on the given key to odd.
+ *
+ *                 DES keys are 56 bits long, but each byte is padded with
+ *                 a parity bit to allow verification.
+ *
+ * \param key      8-byte secret key
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+void mbedtls_des_key_set_parity(unsigned char key[MBEDTLS_DES_KEY_SIZE]);
+
+/**
+ * \brief          Check that key parity on the given key is odd.
+ *
+ *                 DES keys are 56 bits long, but each byte is padded with
+ *                 a parity bit to allow verification.
+ *
+ * \param key      8-byte secret key
+ *
+ * \return         0 is parity was ok, 1 if parity was not correct.
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des_key_check_key_parity(const unsigned char key[MBEDTLS_DES_KEY_SIZE]);
+
+/**
+ * \brief          Check that key is not a weak or semi-weak DES key
+ *
+ * \param key      8-byte secret key
+ *
+ * \return         0 if no weak key was found, 1 if a weak key was identified.
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des_key_check_weak(const unsigned char key[MBEDTLS_DES_KEY_SIZE]);
+
+/**
+ * \brief          DES key schedule (56-bit, encryption)
+ *
+ * \param ctx      DES context to be initialized
+ * \param key      8-byte secret key
+ *
+ * \return         0
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des_setkey_enc(mbedtls_des_context* ctx, const unsigned char key[MBEDTLS_DES_KEY_SIZE]);
+
+/**
+ * \brief          DES key schedule (56-bit, decryption)
+ *
+ * \param ctx      DES context to be initialized
+ * \param key      8-byte secret key
+ *
+ * \return         0
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des_setkey_dec(mbedtls_des_context* ctx, const unsigned char key[MBEDTLS_DES_KEY_SIZE]);
+
+/**
+ * \brief          Triple-DES key schedule (112-bit, encryption)
+ *
+ * \param ctx      3DES context to be initialized
+ * \param key      16-byte secret key
+ *
+ * \return         0
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des3_set2key_enc(mbedtls_des3_context* ctx,
+    const unsigned char key[MBEDTLS_DES_KEY_SIZE * 2]);
+
+/**
+ * \brief          Triple-DES key schedule (112-bit, decryption)
+ *
+ * \param ctx      3DES context to be initialized
+ * \param key      16-byte secret key
+ *
+ * \return         0
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des3_set2key_dec(mbedtls_des3_context* ctx,
+    const unsigned char key[MBEDTLS_DES_KEY_SIZE * 2]);
+
+/**
+ * \brief          Triple-DES key schedule (168-bit, encryption)
+ *
+ * \param ctx      3DES context to be initialized
+ * \param key      24-byte secret key
+ *
+ * \return         0
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des3_set3key_enc(mbedtls_des3_context* ctx,
+    const unsigned char key[MBEDTLS_DES_KEY_SIZE * 3]);
+
+/**
+ * \brief          Triple-DES key schedule (168-bit, decryption)
+ *
+ * \param ctx      3DES context to be initialized
+ * \param key      24-byte secret key
+ *
+ * \return         0
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des3_set3key_dec(mbedtls_des3_context* ctx,
+    const unsigned char key[MBEDTLS_DES_KEY_SIZE * 3]);
+
+/**
+ * \brief          DES-ECB block encryption/decryption
+ *
+ * \param ctx      DES context
+ * \param input    64-bit input block
+ * \param output   64-bit output block
+ *
+ * \return         0 if successful
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des_crypt_ecb(mbedtls_des_context* ctx, const unsigned char input[8],
+    unsigned char output[8]);
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+/**
+ * \brief          DES-CBC buffer encryption/decryption
+ *
+ * \note           Upon exit, the content of the IV is updated so that you can
+ *                 call the function same function again on the following
+ *                 block(s) of data and get the same result as if it was
+ *                 encrypted in one call. This allows a "streaming" usage.
+ *                 If on the other hand you need to retain the contents of the
+ *                 IV, you should either save it manually or use the cipher
+ *                 module instead.
+ *
+ * \param ctx      DES context
+ * \param mode     MBEDTLS_DES_ENCRYPT or MBEDTLS_DES_DECRYPT
+ * \param length   length of the input data
+ * \param iv       initialization vector (updated after use)
+ * \param input    buffer holding the input data
+ * \param output   buffer holding the output data
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des_crypt_cbc(mbedtls_des_context* ctx, int mode, size_t length, unsigned char iv[8],
+    const unsigned char* input, unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+/**
+ * \brief          3DES-ECB block encryption/decryption
+ *
+ * \param ctx      3DES context
+ * \param input    64-bit input block
+ * \param output   64-bit output block
+ *
+ * \return         0 if successful
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des3_crypt_ecb(mbedtls_des3_context* ctx, const unsigned char input[8],
+    unsigned char output[8]);
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+/**
+ * \brief          3DES-CBC buffer encryption/decryption
+ *
+ * \note           Upon exit, the content of the IV is updated so that you can
+ *                 call the function same function again on the following
+ *                 block(s) of data and get the same result as if it was
+ *                 encrypted in one call. This allows a "streaming" usage.
+ *                 If on the other hand you need to retain the contents of the
+ *                 IV, you should either save it manually or use the cipher
+ *                 module instead.
+ *
+ * \param ctx      3DES context
+ * \param mode     MBEDTLS_DES_ENCRYPT or MBEDTLS_DES_DECRYPT
+ * \param length   length of the input data
+ * \param iv       initialization vector (updated after use)
+ * \param input    buffer holding the input data
+ * \param output   buffer holding the output data
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_DES_INVALID_INPUT_LENGTH
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_des3_crypt_cbc(mbedtls_des3_context* ctx, int mode, size_t length, unsigned char iv[8],
+    const unsigned char* input, unsigned char* output);
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+/**
+ * \brief          Internal function for key expansion.
+ *                 (Only exposed to allow overriding it,
+ *                 see MBEDTLS_DES_SETKEY_ALT)
+ *
+ * \param SK       Round keys
+ * \param key      Base key
+ *
+ * \warning        DES is considered a weak cipher and its use constitutes a
+ *                 security risk. We recommend considering stronger ciphers
+ *                 instead.
+ */
+void mbedtls_des_setkey(uint32_t SK[32], const unsigned char key[MBEDTLS_DES_KEY_SIZE]);
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/**
+ * \brief          Checkup routine
+ *
+ * \return         0 if successful, or 1 if the test failed
+ */
+MBEDTLS_CHECK_RETURN_CRITICAL
+int mbedtls_des_self_test(int verbose);
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* des.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/entropy.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/entropy.h
new file mode 100644
index 0000000000..a1cc701fd6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/entropy.h
@@ -0,0 +1,285 @@
+/**
+ * \file entropy.h
+ *
+ * \brief Entropy accumulator implementation
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_ENTROPY_H
+#define MBEDTLS_ENTROPY_H
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/private_access.h"
+
+#if defined(MBEDTLS_SHA512_C) && !defined(MBEDTLS_ENTROPY_FORCE_SHA256)
+#include "mbedtls/sha512.h"
+#define MBEDTLS_ENTROPY_SHA512_ACCUMULATOR
+#else
+#if defined(MBEDTLS_SHA256_C)
+#define MBEDTLS_ENTROPY_SHA256_ACCUMULATOR
+#include "mbedtls/sha256.h"
+#endif
+#endif
+
+#if defined(MBEDTLS_THREADING_C)
+#include "mbedtls/threading.h"
+#endif
+
+/** Critical entropy source failure. */
+#define MBEDTLS_ERR_ENTROPY_SOURCE_FAILED -0x003C
+/** No more sources can be added. */
+#define MBEDTLS_ERR_ENTROPY_MAX_SOURCES -0x003E
+/** No sources have been added to poll. */
+#define MBEDTLS_ERR_ENTROPY_NO_SOURCES_DEFINED -0x0040
+/** No strong sources have been added to poll. */
+#define MBEDTLS_ERR_ENTROPY_NO_STRONG_SOURCE -0x003D
+/** Read/write error in file. */
+#define MBEDTLS_ERR_ENTROPY_FILE_IO_ERROR -0x003F
+
+/**
+ * \name SECTION: Module settings
+ *
+ * The configuration options you can set for this module are in this section.
+ * Either change them in mbedtls_config.h or define them on the compiler command line.
+ * \{
+ */
+
+#if !defined(MBEDTLS_ENTROPY_MAX_SOURCES)
+#define MBEDTLS_ENTROPY_MAX_SOURCES 20 /**< Maximum number of sources supported */
+#endif
+
+#if !defined(MBEDTLS_ENTROPY_MAX_GATHER)
+#define MBEDTLS_ENTROPY_MAX_GATHER 128 /**< Maximum amount requested from entropy sources */
+#endif
+
+/* \} name SECTION: Module settings */
+
+#if defined(MBEDTLS_ENTROPY_SHA512_ACCUMULATOR)
+#define MBEDTLS_ENTROPY_BLOCK_SIZE 64 /**< Block size of entropy accumulator (SHA-512) */
+#else
+#define MBEDTLS_ENTROPY_BLOCK_SIZE 32 /**< Block size of entropy accumulator (SHA-256) */
+#endif
+
+#define MBEDTLS_ENTROPY_MAX_SEED_SIZE 1024 /**< Maximum size of seed we read from seed file */
+#define MBEDTLS_ENTROPY_SOURCE_MANUAL MBEDTLS_ENTROPY_MAX_SOURCES
+
+#define MBEDTLS_ENTROPY_SOURCE_STRONG 1 /**< Entropy source is strong   */
+#define MBEDTLS_ENTROPY_SOURCE_WEAK 0   /**< Entropy source is weak     */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \brief           Entropy poll callback pointer
+ *
+ * \param data      Callback-specific data pointer
+ * \param output    Data to fill
+ * \param len       Maximum size to provide
+ * \param olen      The actual amount of bytes put into the buffer (Can be 0)
+ *
+ * \return          0 if no critical failures occurred,
+ *                  MBEDTLS_ERR_ENTROPY_SOURCE_FAILED otherwise
+ */
+typedef int (
+    *mbedtls_entropy_f_source_ptr)(void* data, unsigned char* output, size_t len, size_t* olen);
+
+/**
+ * \brief           Entropy source state
+ */
+typedef struct mbedtls_entropy_source_state {
+    mbedtls_entropy_f_source_ptr MBEDTLS_PRIVATE(f_source); /**< The entropy source callback */
+    void* MBEDTLS_PRIVATE(p_source);                        /**< The callback data pointer */
+    size_t MBEDTLS_PRIVATE(size);                           /**< Amount received in bytes */
+    size_t MBEDTLS_PRIVATE(threshold); /**< Minimum bytes required before release */
+    int MBEDTLS_PRIVATE(strong);       /**< Is the source strong? */
+} mbedtls_entropy_source_state;
+
+/**
+ * \brief           Entropy context structure
+ */
+typedef struct mbedtls_entropy_context {
+    int MBEDTLS_PRIVATE(accumulator_started); /* 0 after init.
+                                               * 1 after the first update.
+                                               * -1 after free. */
+#if defined(MBEDTLS_ENTROPY_SHA512_ACCUMULATOR)
+    mbedtls_sha512_context MBEDTLS_PRIVATE(accumulator);
+#elif defined(MBEDTLS_ENTROPY_SHA256_ACCUMULATOR)
+    mbedtls_sha256_context MBEDTLS_PRIVATE(accumulator);
+#endif
+    int MBEDTLS_PRIVATE(source_count); /* Number of entries used in source. */
+    mbedtls_entropy_source_state MBEDTLS_PRIVATE(source)[MBEDTLS_ENTROPY_MAX_SOURCES];
+#if defined(MBEDTLS_THREADING_C)
+    mbedtls_threading_mutex_t MBEDTLS_PRIVATE(mutex); /*!< mutex                  */
+#endif
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+    int MBEDTLS_PRIVATE(initial_entropy_run);
+#endif
+} mbedtls_entropy_context;
+
+#if !defined(MBEDTLS_NO_PLATFORM_ENTROPY)
+/**
+ * \brief           Platform-specific entropy poll callback
+ */
+int mbedtls_platform_entropy_poll(void* data, unsigned char* output, size_t len, size_t* olen);
+#endif
+
+/**
+ * \brief           Initialize the context
+ *
+ * \param ctx       Entropy context to initialize
+ */
+void mbedtls_entropy_init(mbedtls_entropy_context* ctx);
+
+/**
+ * \brief           Free the data in the context
+ *
+ * \param ctx       Entropy context to free
+ */
+void mbedtls_entropy_free(mbedtls_entropy_context* ctx);
+
+/**
+ * \brief           Adds an entropy source to poll
+ *                  (Thread-safe if MBEDTLS_THREADING_C is enabled)
+ *
+ * \param ctx       Entropy context
+ * \param f_source  Entropy function
+ * \param p_source  Function data
+ * \param threshold Minimum required from source before entropy is released
+ *                  ( with mbedtls_entropy_func() ) (in bytes)
+ * \param strong    MBEDTLS_ENTROPY_SOURCE_STRONG or
+ *                  MBEDTLS_ENTROPY_SOURCE_WEAK.
+ *                  At least one strong source needs to be added.
+ *                  Weaker sources (such as the cycle counter) can be used as
+ *                  a complement.
+ *
+ * \return          0 if successful or MBEDTLS_ERR_ENTROPY_MAX_SOURCES
+ */
+int mbedtls_entropy_add_source(mbedtls_entropy_context* ctx, mbedtls_entropy_f_source_ptr f_source,
+    void* p_source, size_t threshold, int strong);
+
+/**
+ * \brief           Trigger an extra gather poll for the accumulator
+ *                  (Thread-safe if MBEDTLS_THREADING_C is enabled)
+ *
+ * \param ctx       Entropy context
+ *
+ * \return          0 if successful, or MBEDTLS_ERR_ENTROPY_SOURCE_FAILED
+ */
+int mbedtls_entropy_gather(mbedtls_entropy_context* ctx);
+
+/**
+ * \brief           Retrieve entropy from the accumulator
+ *                  (Maximum length: MBEDTLS_ENTROPY_BLOCK_SIZE)
+ *                  (Thread-safe if MBEDTLS_THREADING_C is enabled)
+ *
+ * \param data      Entropy context
+ * \param output    Buffer to fill
+ * \param len       Number of bytes desired, must be at most MBEDTLS_ENTROPY_BLOCK_SIZE
+ *
+ * \return          0 if successful, or MBEDTLS_ERR_ENTROPY_SOURCE_FAILED
+ */
+int mbedtls_entropy_func(void* data, unsigned char* output, size_t len);
+
+/**
+ * \brief           Add data to the accumulator manually
+ *                  (Thread-safe if MBEDTLS_THREADING_C is enabled)
+ *
+ * \param ctx       Entropy context
+ * \param data      Data to add
+ * \param len       Length of data
+ *
+ * \return          0 if successful
+ */
+int mbedtls_entropy_update_manual(mbedtls_entropy_context* ctx, const unsigned char* data,
+    size_t len);
+
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+/**
+ * \brief           Trigger an update of the seed file in NV by using the
+ *                  current entropy pool.
+ *
+ * \param ctx       Entropy context
+ *
+ * \return          0 if successful
+ */
+int mbedtls_entropy_update_nv_seed(mbedtls_entropy_context* ctx);
+#endif /* MBEDTLS_ENTROPY_NV_SEED */
+
+#if defined(MBEDTLS_FS_IO)
+/**
+ * \brief               Write a seed file
+ *
+ * \param ctx           Entropy context
+ * \param path          Name of the file
+ *
+ * \return              0 if successful,
+ *                      MBEDTLS_ERR_ENTROPY_FILE_IO_ERROR on file error, or
+ *                      MBEDTLS_ERR_ENTROPY_SOURCE_FAILED
+ */
+int mbedtls_entropy_write_seed_file(mbedtls_entropy_context* ctx, const char* path);
+
+/**
+ * \brief               Read and update a seed file. Seed is added to this
+ *                      instance. No more than MBEDTLS_ENTROPY_MAX_SEED_SIZE bytes are
+ *                      read from the seed file. The rest is ignored.
+ *
+ * \param ctx           Entropy context
+ * \param path          Name of the file
+ *
+ * \return              0 if successful,
+ *                      MBEDTLS_ERR_ENTROPY_FILE_IO_ERROR on file error,
+ *                      MBEDTLS_ERR_ENTROPY_SOURCE_FAILED
+ */
+int mbedtls_entropy_update_seed_file(mbedtls_entropy_context* ctx, const char* path);
+#endif /* MBEDTLS_FS_IO */
+
+#if defined(MBEDTLS_SELF_TEST)
+/**
+ * \brief          Checkup routine
+ *
+ *                 This module self-test also calls the entropy self-test,
+ *                 mbedtls_entropy_source_self_test();
+ *
+ * \return         0 if successful, or 1 if a test failed
+ */
+int mbedtls_entropy_self_test(int verbose);
+
+#if defined(MBEDTLS_ENTROPY_HARDWARE_ALT)
+/**
+ * \brief          Checkup routine
+ *
+ *                 Verifies the integrity of the hardware entropy source
+ *                 provided by the function 'mbedtls_hardware_poll()'.
+ *
+ *                 Note this is the only hardware entropy source that is known
+ *                 at link time, and other entropy sources configured
+ *                 dynamically at runtime by the function
+ *                 mbedtls_entropy_add_source() will not be tested.
+ *
+ * \return         0 if successful, or 1 if a test failed
+ */
+int mbedtls_entropy_source_self_test(int verbose);
+#endif /* MBEDTLS_ENTROPY_HARDWARE_ALT */
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* entropy.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/error.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/error.h
new file mode 100644
index 0000000000..4673c489ae
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/error.h
@@ -0,0 +1,210 @@
+/**
+ * \file error.h
+ *
+ * \brief Error to string translation
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_ERROR_H
+#define MBEDTLS_ERROR_H
+
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+
+#if (defined(__ARMCC_VERSION) || defined(_MSC_VER)) && !defined(inline) && !defined(__cplusplus)
+#define inline __inline
+#endif
+
+/**
+ * Error code layout.
+ *
+ * Currently we try to keep all error codes within the negative space of 16
+ * bits signed integers to support all platforms (-0x0001 - -0x7FFF). In
+ * addition we'd like to give two layers of information on the error if
+ * possible.
+ *
+ * For that purpose the error codes are segmented in the following manner:
+ *
+ * 16 bit error code bit-segmentation
+ *
+ * 1 bit  - Unused (sign bit)
+ * 3 bits - High level module ID
+ * 5 bits - Module-dependent error code
+ * 7 bits - Low level module errors
+ *
+ * For historical reasons, low-level error codes are divided in even and odd,
+ * even codes were assigned first, and -1 is reserved for other errors.
+ *
+ * Low-level module errors (0x0002-0x007E, 0x0001-0x007F)
+ *
+ * Module   Nr  Codes assigned
+ * ERROR     2  0x006E          0x0001
+ * MPI       7  0x0002-0x0010
+ * GCM       3  0x0012-0x0016   0x0013-0x0013
+ * THREADING 3  0x001A-0x001E
+ * AES       5  0x0020-0x0022   0x0021-0x0025
+ * CAMELLIA  3  0x0024-0x0026   0x0027-0x0027
+ * BASE64    2  0x002A-0x002C
+ * OID       1  0x002E-0x002E   0x000B-0x000B
+ * PADLOCK   1  0x0030-0x0030
+ * DES       2  0x0032-0x0032   0x0033-0x0033
+ * CTR_DBRG  4  0x0034-0x003A
+ * ENTROPY   3  0x003C-0x0040   0x003D-0x003F
+ * NET      13  0x0042-0x0052   0x0043-0x0049
+ * ARIA      4  0x0058-0x005E
+ * ASN1      7  0x0060-0x006C
+ * CMAC      1  0x007A-0x007A
+ * PBKDF2    1  0x007C-0x007C
+ * HMAC_DRBG 4                  0x0003-0x0009
+ * CCM       3                  0x000D-0x0011
+ * MD5       1                  0x002F-0x002F
+ * RIPEMD160 1                  0x0031-0x0031
+ * SHA1      1                  0x0035-0x0035 0x0073-0x0073
+ * SHA256    1                  0x0037-0x0037 0x0074-0x0074
+ * SHA512    1                  0x0039-0x0039 0x0075-0x0075
+ * CHACHA20  3                  0x0051-0x0055
+ * POLY1305  3                  0x0057-0x005B
+ * CHACHAPOLY 2 0x0054-0x0056
+ * PLATFORM  2  0x0070-0x0072
+ *
+ * High-level module nr (3 bits - 0x0...-0x7...)
+ * Name      ID  Nr of Errors
+ * PEM       1   9
+ * PKCS#12   1   4 (Started from top)
+ * X509      2   20
+ * PKCS5     2   4 (Started from top)
+ * DHM       3   11
+ * PK        3   15 (Started from top)
+ * RSA       4   11
+ * ECP       4   10 (Started from top)
+ * MD        5   5
+ * HKDF      5   1 (Started from top)
+ * SSL       5   2 (Started from 0x5F00)
+ * CIPHER    6   8 (Started from 0x6080)
+ * SSL       6   22 (Started from top, plus 0x6000)
+ * SSL       7   20 (Started from 0x7000, gaps at
+ *                   0x7380, 0x7900-0x7980, 0x7A80-0x7E80)
+ *
+ * Module dependent error code (5 bits 0x.00.-0x.F8.)
+ */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/** Generic error */
+#define MBEDTLS_ERR_ERROR_GENERIC_ERROR -0x0001
+/** This is a bug in the library */
+#define MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED -0x006E
+
+/** Hardware accelerator failed */
+#define MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED -0x0070
+/** The requested feature is not supported by the platform */
+#define MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED -0x0072
+
+/**
+ * \brief Combines a high-level and low-level error code together.
+ *
+ *        Wrapper macro for mbedtls_error_add(). See that function for
+ *        more details.
+ */
+#define MBEDTLS_ERROR_ADD(high, low) mbedtls_error_add(high, low, __FILE__, __LINE__)
+
+#if defined(MBEDTLS_TEST_HOOKS)
+/**
+ * \brief Testing hook called before adding/combining two error codes together.
+ *        Only used when invasive testing is enabled via MBEDTLS_TEST_HOOKS.
+ */
+extern void (*mbedtls_test_hook_error_add)(int, int, const char*, int);
+#endif
+
+/**
+ * \brief Combines a high-level and low-level error code together.
+ *
+ *        This function can be called directly however it is usually
+ *        called via the #MBEDTLS_ERROR_ADD macro.
+ *
+ *        While a value of zero is not a negative error code, it is still an
+ *        error code (that denotes success) and can be combined with both a
+ *        negative error code or another value of zero.
+ *
+ * \note  When invasive testing is enabled via #MBEDTLS_TEST_HOOKS, also try to
+ *        call \link mbedtls_test_hook_error_add \endlink.
+ *
+ * \param high      high-level error code. See error.h for more details.
+ * \param low       low-level error code. See error.h for more details.
+ * \param file      file where this error code addition occurred.
+ * \param line      line where this error code addition occurred.
+ */
+static inline int mbedtls_error_add(int high, int low, const char* file, int line) {
+#if defined(MBEDTLS_TEST_HOOKS)
+    if (*mbedtls_test_hook_error_add != NULL)
+        (*mbedtls_test_hook_error_add)(high, low, file, line);
+#endif
+    (void)file;
+    (void)line;
+
+    return (high + low);
+}
+
+/**
+ * \brief Translate a mbed TLS error code into a string representation,
+ *        Result is truncated if necessary and always includes a terminating
+ *        null byte.
+ *
+ * \param errnum    error code
+ * \param buffer    buffer to place representation in
+ * \param buflen    length of the buffer
+ */
+void mbedtls_strerror(int errnum, char* buffer, size_t buflen);
+
+/**
+ * \brief Translate the high-level part of an Mbed TLS error code into a string
+ *        representation.
+ *
+ * This function returns a const pointer to an un-modifiable string. The caller
+ * must not try to modify the string. It is intended to be used mostly for
+ * logging purposes.
+ *
+ * \param error_code    error code
+ *
+ * \return The string representation of the error code, or \c NULL if the error
+ *         code is unknown.
+ */
+const char* mbedtls_high_level_strerr(int error_code);
+
+/**
+ * \brief Translate the low-level part of an Mbed TLS error code into a string
+ *        representation.
+ *
+ * This function returns a const pointer to an un-modifiable string. The caller
+ * must not try to modify the string. It is intended to be used mostly for
+ * logging purposes.
+ *
+ * \param error_code    error code
+ *
+ * \return The string representation of the error code, or \c NULL if the error
+ *         code is unknown.
+ */
+const char* mbedtls_low_level_strerr(int error_code);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* error.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/gcm.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/gcm.h
new file mode 100644
index 0000000000..544c7ba12a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/gcm.h
@@ -0,0 +1,352 @@
+/**
+ * \file gcm.h
+ *
+ * \brief This file contains GCM definitions and functions.
+ *
+ * The Galois/Counter Mode (GCM) for 128-bit block ciphers is defined
+ * in <em>D. McGrew, J. Viega, The Galois/Counter Mode of Operation
+ * (GCM), Natl. Inst. Stand. Technol.</em>
+ *
+ * For more information on GCM, see <em>NIST SP 800-38D: Recommendation for
+ * Block Cipher Modes of Operation: Galois/Counter Mode (GCM) and GMAC</em>.
+ *
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_GCM_H
+#define MBEDTLS_GCM_H
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/cipher.h"
+#include "mbedtls/private_access.h"
+
+#define MBEDTLS_GCM_ENCRYPT 1
+#define MBEDTLS_GCM_DECRYPT 0
+
+/** Authenticated decryption failed. */
+#define MBEDTLS_ERR_GCM_AUTH_FAILED -0x0012
+/** Bad input parameters to function. */
+#define MBEDTLS_ERR_GCM_BAD_INPUT -0x0014
+/** An output buffer is too small. */
+#define MBEDTLS_ERR_GCM_BUFFER_TOO_SMALL -0x0016
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_GCM_ALT)
+
+/**
+ * \brief          The GCM context structure.
+ */
+typedef struct mbedtls_gcm_context {
+    mbedtls_cipher_context_t MBEDTLS_PRIVATE(cipher_ctx); /*!< The cipher context used. */
+    uint64_t MBEDTLS_PRIVATE(HL)[16];                     /*!< Precalculated HTable low. */
+    uint64_t MBEDTLS_PRIVATE(HH)[16];                     /*!< Precalculated HTable high. */
+    uint64_t MBEDTLS_PRIVATE(len);                /*!< The total length of the encrypted data. */
+    uint64_t MBEDTLS_PRIVATE(add_len);            /*!< The total length of the additional data. */
+    unsigned char MBEDTLS_PRIVATE(base_ectr)[16]; /*!< The first ECTR for tag. */
+    unsigned char MBEDTLS_PRIVATE(y)[16];         /*!< The Y working value. */
+    unsigned char MBEDTLS_PRIVATE(buf)[16];       /*!< The buf working value. */
+    int MBEDTLS_PRIVATE(mode);                    /*!< The operation to perform:
+                                      #MBEDTLS_GCM_ENCRYPT or
+                                      #MBEDTLS_GCM_DECRYPT. */
+} mbedtls_gcm_context;
+
+#else /* !MBEDTLS_GCM_ALT */
+#include "mbedtls/gcm_alt.h"
+#endif /* !MBEDTLS_GCM_ALT */
+
+/**
+ * \brief           This function initializes the specified GCM context,
+ *                  to make references valid, and prepares the context
+ *                  for mbedtls_gcm_setkey() or mbedtls_gcm_free().
+ *
+ *                  The function does not bind the GCM context to a particular
+ *                  cipher, nor set the key. For this purpose, use
+ *                  mbedtls_gcm_setkey().
+ *
+ * \param ctx       The GCM context to initialize. This must not be \c NULL.
+ */
+void mbedtls_gcm_init(mbedtls_gcm_context* ctx);
+
+/**
+ * \brief           This function associates a GCM context with a
+ *                  cipher algorithm and a key.
+ *
+ * \param ctx       The GCM context. This must be initialized.
+ * \param cipher    The 128-bit block cipher to use.
+ * \param key       The encryption key. This must be a readable buffer of at
+ *                  least \p keybits bits.
+ * \param keybits   The key size in bits. Valid options are:
+ *                  <ul><li>128 bits</li>
+ *                  <li>192 bits</li>
+ *                  <li>256 bits</li></ul>
+ *
+ * \return          \c 0 on success.
+ * \return          A cipher-specific error code on failure.
+ */
+int mbedtls_gcm_setkey(mbedtls_gcm_context* ctx, mbedtls_cipher_id_t cipher,
+    const unsigned char* key, unsigned int keybits);
+
+/**
+ * \brief           This function performs GCM encryption or decryption of a buffer.
+ *
+ * \note            For encryption, the output buffer can be the same as the
+ *                  input buffer. For decryption, the output buffer cannot be
+ *                  the same as input buffer. If the buffers overlap, the output
+ *                  buffer must trail at least 8 Bytes behind the input buffer.
+ *
+ * \warning         When this function performs a decryption, it outputs the
+ *                  authentication tag and does not verify that the data is
+ *                  authentic. You should use this function to perform encryption
+ *                  only. For decryption, use mbedtls_gcm_auth_decrypt() instead.
+ *
+ * \param ctx       The GCM context to use for encryption or decryption. This
+ *                  must be initialized.
+ * \param mode      The operation to perform:
+ *                  - #MBEDTLS_GCM_ENCRYPT to perform authenticated encryption.
+ *                    The ciphertext is written to \p output and the
+ *                    authentication tag is written to \p tag.
+ *                  - #MBEDTLS_GCM_DECRYPT to perform decryption.
+ *                    The plaintext is written to \p output and the
+ *                    authentication tag is written to \p tag.
+ *                    Note that this mode is not recommended, because it does
+ *                    not verify the authenticity of the data. For this reason,
+ *                    you should use mbedtls_gcm_auth_decrypt() instead of
+ *                    calling this function in decryption mode.
+ * \param length    The length of the input data, which is equal to the length
+ *                  of the output data.
+ * \param iv        The initialization vector. This must be a readable buffer of
+ *                  at least \p iv_len Bytes.
+ * \param iv_len    The length of the IV.
+ * \param add       The buffer holding the additional data. This must be of at
+ *                  least that size in Bytes.
+ * \param add_len   The length of the additional data.
+ * \param input     The buffer holding the input data. If \p length is greater
+ *                  than zero, this must be a readable buffer of at least that
+ *                  size in Bytes.
+ * \param output    The buffer for holding the output data. If \p length is greater
+ *                  than zero, this must be a writable buffer of at least that
+ *                  size in Bytes.
+ * \param tag_len   The length of the tag to generate.
+ * \param tag       The buffer for holding the tag. This must be a writable
+ *                  buffer of at least \p tag_len Bytes.
+ *
+ * \return          \c 0 if the encryption or decryption was performed
+ *                  successfully. Note that in #MBEDTLS_GCM_DECRYPT mode,
+ *                  this does not indicate that the data is authentic.
+ * \return          #MBEDTLS_ERR_GCM_BAD_INPUT if the lengths or pointers are
+ *                  not valid or a cipher-specific error code if the encryption
+ *                  or decryption failed.
+ */
+int mbedtls_gcm_crypt_and_tag(mbedtls_gcm_context* ctx, int mode, size_t length,
+    const unsigned char* iv, size_t iv_len, const unsigned char* add, size_t add_len,
+    const unsigned char* input, unsigned char* output, size_t tag_len, unsigned char* tag);
+
+/**
+ * \brief           This function performs a GCM authenticated decryption of a
+ *                  buffer.
+ *
+ * \note            For decryption, the output buffer cannot be the same as
+ *                  input buffer. If the buffers overlap, the output buffer
+ *                  must trail at least 8 Bytes behind the input buffer.
+ *
+ * \param ctx       The GCM context. This must be initialized.
+ * \param length    The length of the ciphertext to decrypt, which is also
+ *                  the length of the decrypted plaintext.
+ * \param iv        The initialization vector. This must be a readable buffer
+ *                  of at least \p iv_len Bytes.
+ * \param iv_len    The length of the IV.
+ * \param add       The buffer holding the additional data. This must be of at
+ *                  least that size in Bytes.
+ * \param add_len   The length of the additional data.
+ * \param tag       The buffer holding the tag to verify. This must be a
+ *                  readable buffer of at least \p tag_len Bytes.
+ * \param tag_len   The length of the tag to verify.
+ * \param input     The buffer holding the ciphertext. If \p length is greater
+ *                  than zero, this must be a readable buffer of at least that
+ *                  size.
+ * \param output    The buffer for holding the decrypted plaintext. If \p length
+ *                  is greater than zero, this must be a writable buffer of at
+ *                  least that size.
+ *
+ * \return          \c 0 if successful and authenticated.
+ * \return          #MBEDTLS_ERR_GCM_AUTH_FAILED if the tag does not match.
+ * \return          #MBEDTLS_ERR_GCM_BAD_INPUT if the lengths or pointers are
+ *                  not valid or a cipher-specific error code if the decryption
+ *                  failed.
+ */
+int mbedtls_gcm_auth_decrypt(mbedtls_gcm_context* ctx, size_t length, const unsigned char* iv,
+    size_t iv_len, const unsigned char* add, size_t add_len, const unsigned char* tag,
+    size_t tag_len, const unsigned char* input, unsigned char* output);
+
+/**
+ * \brief           This function starts a GCM encryption or decryption
+ *                  operation.
+ *
+ * \param ctx       The GCM context. This must be initialized.
+ * \param mode      The operation to perform: #MBEDTLS_GCM_ENCRYPT or
+ *                  #MBEDTLS_GCM_DECRYPT.
+ * \param iv        The initialization vector. This must be a readable buffer of
+ *                  at least \p iv_len Bytes.
+ * \param iv_len    The length of the IV.
+ *
+ * \return          \c 0 on success.
+ */
+int mbedtls_gcm_starts(mbedtls_gcm_context* ctx, int mode, const unsigned char* iv, size_t iv_len);
+
+/**
+ * \brief           This function feeds an input buffer as associated data
+ *                  (authenticated but not encrypted data) in a GCM
+ *                  encryption or decryption operation.
+ *
+ *                  Call this function after mbedtls_gcm_starts() to pass
+ *                  the associated data. If the associated data is empty,
+ *                  you do not need to call this function. You may not
+ *                  call this function after calling mbedtls_cipher_update().
+ *
+ * \param ctx       The GCM context. This must have been started with
+ *                  mbedtls_gcm_starts() and must not have yet received
+ *                  any input with mbedtls_gcm_update().
+ * \param add       The buffer holding the additional data, or \c NULL
+ *                  if \p add_len is \c 0.
+ * \param add_len   The length of the additional data. If \c 0,
+ *                  \p add may be \c NULL.
+ *
+ * \return          \c 0 on success.
+ */
+int mbedtls_gcm_update_ad(mbedtls_gcm_context* ctx, const unsigned char* add, size_t add_len);
+
+/**
+ * \brief           This function feeds an input buffer into an ongoing GCM
+ *                  encryption or decryption operation.
+ *
+ *                  You may call this function zero, one or more times
+ *                  to pass successive parts of the input: the plaintext to
+ *                  encrypt, or the ciphertext (not including the tag) to
+ *                  decrypt. After the last part of the input, call
+ *                  mbedtls_gcm_finish().
+ *
+ *                  This function may produce output in one of the following
+ *                  ways:
+ *                  - Immediate output: the output length is always equal
+ *                    to the input length.
+ *                  - Buffered output: the output consists of a whole number
+ *                    of 16-byte blocks. If the total input length so far
+ *                    (not including associated data) is 16 \* *B* + *A*
+ *                    with *A* < 16 then the total output length is 16 \* *B*.
+ *
+ *                  In particular:
+ *                  - It is always correct to call this function with
+ *                    \p output_size >= \p input_length + 15.
+ *                  - If \p input_length is a multiple of 16 for all the calls
+ *                    to this function during an operation, then it is
+ *                    correct to use \p output_size = \p input_length.
+ *
+ * \note            For decryption, the output buffer cannot be the same as
+ *                  input buffer. If the buffers overlap, the output buffer
+ *                  must trail at least 8 Bytes behind the input buffer.
+ *
+ * \param ctx           The GCM context. This must be initialized.
+ * \param input         The buffer holding the input data. If \p input_length
+ *                      is greater than zero, this must be a readable buffer
+ *                      of at least \p input_length bytes.
+ * \param input_length  The length of the input data in bytes.
+ * \param output        The buffer for the output data. If \p output_size
+ *                      is greater than zero, this must be a writable buffer of
+ *                      of at least \p output_size bytes.
+ * \param output_size   The size of the output buffer in bytes.
+ *                      See the function description regarding the output size.
+ * \param output_length On success, \p *output_length contains the actual
+ *                      length of the output written in \p output.
+ *                      On failure, the content of \p *output_length is
+ *                      unspecified.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_GCM_BAD_INPUT on failure:
+ *                 total input length too long,
+ *                 unsupported input/output buffer overlap detected,
+ *                 or \p output_size too small.
+ */
+int mbedtls_gcm_update(mbedtls_gcm_context* ctx, const unsigned char* input, size_t input_length,
+    unsigned char* output, size_t output_size, size_t* output_length);
+
+/**
+ * \brief           This function finishes the GCM operation and generates
+ *                  the authentication tag.
+ *
+ *                  It wraps up the GCM stream, and generates the
+ *                  tag. The tag can have a maximum length of 16 Bytes.
+ *
+ * \param ctx       The GCM context. This must be initialized.
+ * \param tag       The buffer for holding the tag. This must be a writable
+ *                  buffer of at least \p tag_len Bytes.
+ * \param tag_len   The length of the tag to generate. This must be at least
+ *                  four.
+ * \param output    The buffer for the final output.
+ *                  If \p output_size is nonzero, this must be a writable
+ *                  buffer of at least \p output_size bytes.
+ * \param output_size  The size of the \p output buffer in bytes.
+ *                  This must be large enough for the output that
+ *                  mbedtls_gcm_update() has not produced. In particular:
+ *                  - If mbedtls_gcm_update() produces immediate output,
+ *                    or if the total input size is a multiple of \c 16,
+ *                    then mbedtls_gcm_finish() never produces any output,
+ *                    so \p output_size can be \c 0.
+ *                  - \p output_size never needs to be more than \c 15.
+ * \param output_length On success, \p *output_length contains the actual
+ *                      length of the output written in \p output.
+ *                      On failure, the content of \p *output_length is
+ *                      unspecified.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_GCM_BAD_INPUT on failure:
+ *                  invalid value of \p tag_len,
+ *                  or \p output_size too small.
+ */
+int mbedtls_gcm_finish(mbedtls_gcm_context* ctx, unsigned char* output, size_t output_size,
+    size_t* output_length, unsigned char* tag, size_t tag_len);
+
+/**
+ * \brief           This function clears a GCM context and the underlying
+ *                  cipher sub-context.
+ *
+ * \param ctx       The GCM context to clear. If this is \c NULL, the call has
+ *                  no effect. Otherwise, this must be initialized.
+ */
+void mbedtls_gcm_free(mbedtls_gcm_context* ctx);
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/**
+ * \brief          The GCM checkup routine.
+ *
+ * \return         \c 0 on success.
+ * \return         \c 1 on failure.
+ */
+int mbedtls_gcm_self_test(int verbose);
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* gcm.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/mbedtls_config.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/mbedtls_config.h
new file mode 100644
index 0000000000..25337be289
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/mbedtls_config.h
@@ -0,0 +1,22 @@
+#define MBEDTLS_SHA256_C
+#define MBEDTLS_SHA224_C
+#define MBEDTLS_RSA_C
+#define MBEDTLS_PKCS1_V15
+#define MBEDTLS_BIGNUM_C
+#define MBEDTLS_OID_C
+#define MBEDTLS_MD_C
+#define MBEDTLS_BASE64_C
+#define MBEDTLS_PK_PARSE_C
+#define MBEDTLS_ASN1_PARSE_C
+#define MBEDTLS_PK_C
+#define MBEDTLS_PEM_PARSE_C
+#define MBEDTLS_PLATFORM_C
+#define MBEDTLS_AES_C
+#define MBEDTLS_CIPHER_C
+#define MBEDTLS_CAMELLIA_C
+#define MBEDTLS_ARIA_C
+#define MBEDTLS_GCM_C
+#define MBEDTLS_ENTROPY_C
+#if defined(_WIN32)
+#define MBEDTLS_NO_PLATFORM_ENTROPY
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/md.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/md.h
new file mode 100644
index 0000000000..79c7b5fe49
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/md.h
@@ -0,0 +1,456 @@
+/**
+ * \file md.h
+ *
+ * \brief This file contains the generic message-digest wrapper.
+ *
+ * \author Adriaan de Jong <dejong@fox-it.com>
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_MD_H
+#define MBEDTLS_MD_H
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/private_access.h"
+
+/** The selected feature is not available. */
+#define MBEDTLS_ERR_MD_FEATURE_UNAVAILABLE -0x5080
+/** Bad input parameters to function. */
+#define MBEDTLS_ERR_MD_BAD_INPUT_DATA -0x5100
+/** Failed to allocate memory. */
+#define MBEDTLS_ERR_MD_ALLOC_FAILED -0x5180
+/** Opening or reading of file failed. */
+#define MBEDTLS_ERR_MD_FILE_IO_ERROR -0x5200
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \brief     Supported message digests.
+ *
+ * \warning   MD5 and SHA-1 are considered weak message digests and
+ *            their use constitutes a security risk. We recommend considering
+ *            stronger message digests instead.
+ *
+ */
+typedef enum {
+    MBEDTLS_MD_NONE = 0,  /**< None. */
+    MBEDTLS_MD_MD5,       /**< The MD5 message digest. */
+    MBEDTLS_MD_SHA1,      /**< The SHA-1 message digest. */
+    MBEDTLS_MD_SHA224,    /**< The SHA-224 message digest. */
+    MBEDTLS_MD_SHA256,    /**< The SHA-256 message digest. */
+    MBEDTLS_MD_SHA384,    /**< The SHA-384 message digest. */
+    MBEDTLS_MD_SHA512,    /**< The SHA-512 message digest. */
+    MBEDTLS_MD_RIPEMD160, /**< The RIPEMD-160 message digest. */
+} mbedtls_md_type_t;
+
+#if defined(MBEDTLS_SHA512_C)
+#define MBEDTLS_MD_MAX_SIZE 64 /* longest known is SHA512 */
+#else
+#define MBEDTLS_MD_MAX_SIZE 32 /* longest known is SHA256 or less */
+#endif
+
+#if defined(MBEDTLS_SHA512_C)
+#define MBEDTLS_MD_MAX_BLOCK_SIZE 128
+#else
+#define MBEDTLS_MD_MAX_BLOCK_SIZE 64
+#endif
+
+/**
+ * Opaque struct.
+ *
+ * Constructed using either #mbedtls_md_info_from_string or
+ * #mbedtls_md_info_from_type.
+ *
+ * Fields can be accessed with #mbedtls_md_get_size,
+ * #mbedtls_md_get_type and #mbedtls_md_get_name.
+ */
+/* Defined internally in library/md_wrap.h. */
+typedef struct mbedtls_md_info_t mbedtls_md_info_t;
+
+/**
+ * The generic message-digest context.
+ */
+typedef struct mbedtls_md_context_t {
+    /** Information about the associated message digest. */
+    const mbedtls_md_info_t* MBEDTLS_PRIVATE(md_info);
+
+    /** The digest-specific context. */
+    void* MBEDTLS_PRIVATE(md_ctx);
+
+    /** The HMAC part of the context. */
+    void* MBEDTLS_PRIVATE(hmac_ctx);
+} mbedtls_md_context_t;
+
+/**
+ * \brief           This function returns the list of digests supported by the
+ *                  generic digest module.
+ *
+ * \note            The list starts with the strongest available hashes.
+ *
+ * \return          A statically allocated array of digests. Each element
+ *                  in the returned list is an integer belonging to the
+ *                  message-digest enumeration #mbedtls_md_type_t.
+ *                  The last entry is 0.
+ */
+const int* mbedtls_md_list(void);
+
+/**
+ * \brief           This function returns the message-digest information
+ *                  associated with the given digest name.
+ *
+ * \param md_name   The name of the digest to search for.
+ *
+ * \return          The message-digest information associated with \p md_name.
+ * \return          NULL if the associated message-digest information is not found.
+ */
+const mbedtls_md_info_t* mbedtls_md_info_from_string(const char* md_name);
+
+/**
+ * \brief           This function returns the message-digest information
+ *                  associated with the given digest type.
+ *
+ * \param md_type   The type of digest to search for.
+ *
+ * \return          The message-digest information associated with \p md_type.
+ * \return          NULL if the associated message-digest information is not found.
+ */
+const mbedtls_md_info_t* mbedtls_md_info_from_type(mbedtls_md_type_t md_type);
+
+/**
+ * \brief           This function initializes a message-digest context without
+ *                  binding it to a particular message-digest algorithm.
+ *
+ *                  This function should always be called first. It prepares the
+ *                  context for mbedtls_md_setup() for binding it to a
+ *                  message-digest algorithm.
+ */
+void mbedtls_md_init(mbedtls_md_context_t* ctx);
+
+/**
+ * \brief           This function clears the internal structure of \p ctx and
+ *                  frees any embedded internal structure, but does not free
+ *                  \p ctx itself.
+ *
+ *                  If you have called mbedtls_md_setup() on \p ctx, you must
+ *                  call mbedtls_md_free() when you are no longer using the
+ *                  context.
+ *                  Calling this function if you have previously
+ *                  called mbedtls_md_init() and nothing else is optional.
+ *                  You must not call this function if you have not called
+ *                  mbedtls_md_init().
+ */
+void mbedtls_md_free(mbedtls_md_context_t* ctx);
+
+/**
+ * \brief           This function selects the message digest algorithm to use,
+ *                  and allocates internal structures.
+ *
+ *                  It should be called after mbedtls_md_init() or
+ *                  mbedtls_md_free(). Makes it necessary to call
+ *                  mbedtls_md_free() later.
+ *
+ * \param ctx       The context to set up.
+ * \param md_info   The information structure of the message-digest algorithm
+ *                  to use.
+ * \param hmac      Defines if HMAC is used. 0: HMAC is not used (saves some memory),
+ *                  or non-zero: HMAC is used with this context.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                  failure.
+ * \return          #MBEDTLS_ERR_MD_ALLOC_FAILED on memory-allocation failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_setup(mbedtls_md_context_t* ctx, const mbedtls_md_info_t* md_info, int hmac);
+
+/**
+ * \brief           This function clones the state of an message-digest
+ *                  context.
+ *
+ * \note            You must call mbedtls_md_setup() on \c dst before calling
+ *                  this function.
+ *
+ * \note            The two contexts must have the same type,
+ *                  for example, both are SHA-256.
+ *
+ * \warning         This function clones the message-digest state, not the
+ *                  HMAC state.
+ *
+ * \param dst       The destination context.
+ * \param src       The context to be cloned.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_clone(mbedtls_md_context_t* dst, const mbedtls_md_context_t* src);
+
+/**
+ * \brief           This function extracts the message-digest size from the
+ *                  message-digest information structure.
+ *
+ * \param md_info   The information structure of the message-digest algorithm
+ *                  to use.
+ *
+ * \return          The size of the message-digest output in Bytes.
+ */
+unsigned char mbedtls_md_get_size(const mbedtls_md_info_t* md_info);
+
+/**
+ * \brief           This function extracts the message-digest type from the
+ *                  message-digest information structure.
+ *
+ * \param md_info   The information structure of the message-digest algorithm
+ *                  to use.
+ *
+ * \return          The type of the message digest.
+ */
+mbedtls_md_type_t mbedtls_md_get_type(const mbedtls_md_info_t* md_info);
+
+/**
+ * \brief           This function extracts the message-digest name from the
+ *                  message-digest information structure.
+ *
+ * \param md_info   The information structure of the message-digest algorithm
+ *                  to use.
+ *
+ * \return          The name of the message digest.
+ */
+const char* mbedtls_md_get_name(const mbedtls_md_info_t* md_info);
+
+/**
+ * \brief           This function starts a message-digest computation.
+ *
+ *                  You must call this function after setting up the context
+ *                  with mbedtls_md_setup(), and before passing data with
+ *                  mbedtls_md_update().
+ *
+ * \param ctx       The generic message-digest context.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                  failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_starts(mbedtls_md_context_t* ctx);
+
+/**
+ * \brief           This function feeds an input buffer into an ongoing
+ *                  message-digest computation.
+ *
+ *                  You must call mbedtls_md_starts() before calling this
+ *                  function. You may call this function multiple times.
+ *                  Afterwards, call mbedtls_md_finish().
+ *
+ * \param ctx       The generic message-digest context.
+ * \param input     The buffer holding the input data.
+ * \param ilen      The length of the input data.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                  failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_update(mbedtls_md_context_t* ctx, const unsigned char* input, size_t ilen);
+
+/**
+ * \brief           This function finishes the digest operation,
+ *                  and writes the result to the output buffer.
+ *
+ *                  Call this function after a call to mbedtls_md_starts(),
+ *                  followed by any number of calls to mbedtls_md_update().
+ *                  Afterwards, you may either clear the context with
+ *                  mbedtls_md_free(), or call mbedtls_md_starts() to reuse
+ *                  the context for another digest operation with the same
+ *                  algorithm.
+ *
+ * \param ctx       The generic message-digest context.
+ * \param output    The buffer for the generic message-digest checksum result.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                  failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_finish(mbedtls_md_context_t* ctx, unsigned char* output);
+
+/**
+ * \brief          This function calculates the message-digest of a buffer,
+ *                 with respect to a configurable message-digest algorithm
+ *                 in a single call.
+ *
+ *                 The result is calculated as
+ *                 Output = message_digest(input buffer).
+ *
+ * \param md_info  The information structure of the message-digest algorithm
+ *                 to use.
+ * \param input    The buffer holding the data.
+ * \param ilen     The length of the input data.
+ * \param output   The generic message-digest checksum result.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                 failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md(const mbedtls_md_info_t* md_info, const unsigned char* input, size_t ilen,
+    unsigned char* output);
+
+#if defined(MBEDTLS_FS_IO)
+/**
+ * \brief          This function calculates the message-digest checksum
+ *                 result of the contents of the provided file.
+ *
+ *                 The result is calculated as
+ *                 Output = message_digest(file contents).
+ *
+ * \param md_info  The information structure of the message-digest algorithm
+ *                 to use.
+ * \param path     The input file name.
+ * \param output   The generic message-digest checksum result.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_MD_FILE_IO_ERROR on an I/O error accessing
+ *                 the file pointed by \p path.
+ * \return         #MBEDTLS_ERR_MD_BAD_INPUT_DATA if \p md_info was NULL.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_file(const mbedtls_md_info_t* md_info, const char* path, unsigned char* output);
+#endif /* MBEDTLS_FS_IO */
+
+/**
+ * \brief           This function sets the HMAC key and prepares to
+ *                  authenticate a new message.
+ *
+ *                  Call this function after mbedtls_md_setup(), to use
+ *                  the MD context for an HMAC calculation, then call
+ *                  mbedtls_md_hmac_update() to provide the input data, and
+ *                  mbedtls_md_hmac_finish() to get the HMAC value.
+ *
+ * \param ctx       The message digest context containing an embedded HMAC
+ *                  context.
+ * \param key       The HMAC secret key.
+ * \param keylen    The length of the HMAC key in Bytes.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                  failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_hmac_starts(mbedtls_md_context_t* ctx, const unsigned char* key, size_t keylen);
+
+/**
+ * \brief           This function feeds an input buffer into an ongoing HMAC
+ *                  computation.
+ *
+ *                  Call mbedtls_md_hmac_starts() or mbedtls_md_hmac_reset()
+ *                  before calling this function.
+ *                  You may call this function multiple times to pass the
+ *                  input piecewise.
+ *                  Afterwards, call mbedtls_md_hmac_finish().
+ *
+ * \param ctx       The message digest context containing an embedded HMAC
+ *                  context.
+ * \param input     The buffer holding the input data.
+ * \param ilen      The length of the input data.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                  failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_hmac_update(mbedtls_md_context_t* ctx, const unsigned char* input, size_t ilen);
+
+/**
+ * \brief           This function finishes the HMAC operation, and writes
+ *                  the result to the output buffer.
+ *
+ *                  Call this function after mbedtls_md_hmac_starts() and
+ *                  mbedtls_md_hmac_update() to get the HMAC value. Afterwards
+ *                  you may either call mbedtls_md_free() to clear the context,
+ *                  or call mbedtls_md_hmac_reset() to reuse the context with
+ *                  the same HMAC key.
+ *
+ * \param ctx       The message digest context containing an embedded HMAC
+ *                  context.
+ * \param output    The generic HMAC checksum result.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                  failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_hmac_finish(mbedtls_md_context_t* ctx, unsigned char* output);
+
+/**
+ * \brief           This function prepares to authenticate a new message with
+ *                  the same key as the previous HMAC operation.
+ *
+ *                  You may call this function after mbedtls_md_hmac_finish().
+ *                  Afterwards call mbedtls_md_hmac_update() to pass the new
+ *                  input.
+ *
+ * \param ctx       The message digest context containing an embedded HMAC
+ *                  context.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                  failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_hmac_reset(mbedtls_md_context_t* ctx);
+
+/**
+ * \brief          This function calculates the full generic HMAC
+ *                 on the input buffer with the provided key.
+ *
+ *                 The function allocates the context, performs the
+ *                 calculation, and frees the context.
+ *
+ *                 The HMAC result is calculated as
+ *                 output = generic HMAC(hmac key, input buffer).
+ *
+ * \param md_info  The information structure of the message-digest algorithm
+ *                 to use.
+ * \param key      The HMAC secret key.
+ * \param keylen   The length of the HMAC secret key in Bytes.
+ * \param input    The buffer holding the input data.
+ * \param ilen     The length of the input data.
+ * \param output   The generic HMAC result.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter-verification
+ *                 failure.
+ */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_hmac(const mbedtls_md_info_t* md_info, const unsigned char* key, size_t keylen,
+    const unsigned char* input, size_t ilen, unsigned char* output);
+
+/* Internal use */
+MBEDTLS_CHECK_RETURN_TYPICAL
+int mbedtls_md_process(mbedtls_md_context_t* ctx, const unsigned char* data);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* MBEDTLS_MD_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/memory_buffer_alloc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/memory_buffer_alloc.h
new file mode 100644
index 0000000000..7eba8199c2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/memory_buffer_alloc.h
@@ -0,0 +1,145 @@
+/**
+ * \file memory_buffer_alloc.h
+ *
+ * \brief Buffer-based memory allocator
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_MEMORY_BUFFER_ALLOC_H
+#define MBEDTLS_MEMORY_BUFFER_ALLOC_H
+
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+
+/**
+ * \name SECTION: Module settings
+ *
+ * The configuration options you can set for this module are in this section.
+ * Either change them in mbedtls_config.h or define them on the compiler command line.
+ * \{
+ */
+
+#if !defined(MBEDTLS_MEMORY_ALIGN_MULTIPLE)
+#define MBEDTLS_MEMORY_ALIGN_MULTIPLE 4 /**< Align on multiples of this value */
+#endif
+
+/* \} name SECTION: Module settings */
+
+#define MBEDTLS_MEMORY_VERIFY_NONE 0
+#define MBEDTLS_MEMORY_VERIFY_ALLOC (1 << 0)
+#define MBEDTLS_MEMORY_VERIFY_FREE (1 << 1)
+#define MBEDTLS_MEMORY_VERIFY_ALWAYS (MBEDTLS_MEMORY_VERIFY_ALLOC | MBEDTLS_MEMORY_VERIFY_FREE)
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \brief   Initialize use of stack-based memory allocator.
+ *          The stack-based allocator does memory management inside the
+ *          presented buffer and does not call calloc() and free().
+ *          It sets the global mbedtls_calloc() and mbedtls_free() pointers
+ *          to its own functions.
+ *          (Provided mbedtls_calloc() and mbedtls_free() are thread-safe if
+ *           MBEDTLS_THREADING_C is defined)
+ *
+ * \note    This code is not optimized and provides a straight-forward
+ *          implementation of a stack-based memory allocator.
+ *
+ * \param buf   buffer to use as heap
+ * \param len   size of the buffer
+ */
+void mbedtls_memory_buffer_alloc_init(unsigned char* buf, size_t len);
+
+/**
+ * \brief   Free the mutex for thread-safety and clear remaining memory
+ */
+void mbedtls_memory_buffer_alloc_free(void);
+
+/**
+ * \brief   Determine when the allocator should automatically verify the state
+ *          of the entire chain of headers / meta-data.
+ *          (Default: MBEDTLS_MEMORY_VERIFY_NONE)
+ *
+ * \param verify    One of MBEDTLS_MEMORY_VERIFY_NONE, MBEDTLS_MEMORY_VERIFY_ALLOC,
+ *                  MBEDTLS_MEMORY_VERIFY_FREE or MBEDTLS_MEMORY_VERIFY_ALWAYS
+ */
+void mbedtls_memory_buffer_set_verify(int verify);
+
+#if defined(MBEDTLS_MEMORY_DEBUG)
+/**
+ * \brief   Print out the status of the allocated memory (primarily for use
+ *          after a program should have de-allocated all memory)
+ *          Prints out a list of 'still allocated' blocks and their stack
+ *          trace if MBEDTLS_MEMORY_BACKTRACE is defined.
+ */
+void mbedtls_memory_buffer_alloc_status(void);
+
+/**
+ * \brief   Get the peak heap usage so far
+ *
+ * \param max_used      Peak number of bytes in use or committed. This
+ *                      includes bytes in allocated blocks too small to split
+ *                      into smaller blocks but larger than the requested size.
+ * \param max_blocks    Peak number of blocks in use, including free and used
+ */
+void mbedtls_memory_buffer_alloc_max_get(size_t* max_used, size_t* max_blocks);
+
+/**
+ * \brief   Reset peak statistics
+ */
+void mbedtls_memory_buffer_alloc_max_reset(void);
+
+/**
+ * \brief   Get the current heap usage
+ *
+ * \param cur_used      Current number of bytes in use or committed. This
+ *                      includes bytes in allocated blocks too small to split
+ *                      into smaller blocks but larger than the requested size.
+ * \param cur_blocks    Current number of blocks in use, including free and used
+ */
+void mbedtls_memory_buffer_alloc_cur_get(size_t* cur_used, size_t* cur_blocks);
+#endif /* MBEDTLS_MEMORY_DEBUG */
+
+/**
+ * \brief   Verifies that all headers in the memory buffer are correct
+ *          and contain sane values. Helps debug buffer-overflow errors.
+ *
+ *          Prints out first failure if MBEDTLS_MEMORY_DEBUG is defined.
+ *          Prints out full header information if MBEDTLS_MEMORY_DEBUG
+ *          is defined. (Includes stack trace information for each block if
+ *          MBEDTLS_MEMORY_BACKTRACE is defined as well).
+ *
+ * \return             0 if verified, 1 otherwise
+ */
+int mbedtls_memory_buffer_alloc_verify(void);
+
+#if defined(MBEDTLS_SELF_TEST)
+/**
+ * \brief          Checkup routine
+ *
+ * \return         0 if successful, or 1 if a test failed
+ */
+int mbedtls_memory_buffer_alloc_self_test(int verbose);
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* memory_buffer_alloc.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/oid.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/oid.h
new file mode 100644
index 0000000000..de20988a15
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/oid.h
@@ -0,0 +1,791 @@
+/**
+ * \file oid.h
+ *
+ * \brief Object Identifier (OID) database
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_OID_H
+#define MBEDTLS_OID_H
+#include <stddef.h>
+
+#include "mbedtls/asn1.h"
+#include "mbedtls/build_info.h"
+#include "mbedtls/pk.h"
+#include "mbedtls/private_access.h"
+
+#if defined(MBEDTLS_CIPHER_C)
+#include "mbedtls/cipher.h"
+#endif
+
+#if defined(MBEDTLS_MD_C)
+#include "mbedtls/md.h"
+#endif
+
+/** OID is not found. */
+#define MBEDTLS_ERR_OID_NOT_FOUND -0x002E
+/** output buffer is too small */
+#define MBEDTLS_ERR_OID_BUF_TOO_SMALL -0x000B
+
+/* This is for the benefit of X.509, but defined here in order to avoid
+ * having a "backwards" include of x.509.h here */
+/*
+ * X.509 extension types (internal, arbitrary values for bitsets)
+ */
+#define MBEDTLS_OID_X509_EXT_AUTHORITY_KEY_IDENTIFIER (1 << 0)
+#define MBEDTLS_OID_X509_EXT_SUBJECT_KEY_IDENTIFIER (1 << 1)
+#define MBEDTLS_OID_X509_EXT_KEY_USAGE (1 << 2)
+#define MBEDTLS_OID_X509_EXT_CERTIFICATE_POLICIES (1 << 3)
+#define MBEDTLS_OID_X509_EXT_POLICY_MAPPINGS (1 << 4)
+#define MBEDTLS_OID_X509_EXT_SUBJECT_ALT_NAME (1 << 5)
+#define MBEDTLS_OID_X509_EXT_ISSUER_ALT_NAME (1 << 6)
+#define MBEDTLS_OID_X509_EXT_SUBJECT_DIRECTORY_ATTRS (1 << 7)
+#define MBEDTLS_OID_X509_EXT_BASIC_CONSTRAINTS (1 << 8)
+#define MBEDTLS_OID_X509_EXT_NAME_CONSTRAINTS (1 << 9)
+#define MBEDTLS_OID_X509_EXT_POLICY_CONSTRAINTS (1 << 10)
+#define MBEDTLS_OID_X509_EXT_EXTENDED_KEY_USAGE (1 << 11)
+#define MBEDTLS_OID_X509_EXT_CRL_DISTRIBUTION_POINTS (1 << 12)
+#define MBEDTLS_OID_X509_EXT_INIHIBIT_ANYPOLICY (1 << 13)
+#define MBEDTLS_OID_X509_EXT_FRESHEST_CRL (1 << 14)
+#define MBEDTLS_OID_X509_EXT_NS_CERT_TYPE (1 << 16)
+
+/*
+ * Top level OID tuples
+ */
+#define MBEDTLS_OID_ISO_MEMBER_BODIES "\x2a"  /* {iso(1) member-body(2)} */
+#define MBEDTLS_OID_ISO_IDENTIFIED_ORG "\x2b" /* {iso(1) identified-organization(3)} */
+#define MBEDTLS_OID_ISO_CCITT_DS "\x55"       /* {joint-iso-ccitt(2) ds(5)} */
+#define MBEDTLS_OID_ISO_ITU_COUNTRY "\x60"    /* {joint-iso-itu-t(2) country(16)} */
+
+/*
+ * ISO Member bodies OID parts
+ */
+#define MBEDTLS_OID_COUNTRY_US "\x86\x48"                /* {us(840)} */
+#define MBEDTLS_OID_ORG_RSA_DATA_SECURITY "\x86\xf7\x0d" /* {rsadsi(113549)} */
+#define MBEDTLS_OID_RSA_COMPANY                                                                    \
+    MBEDTLS_OID_ISO_MEMBER_BODIES MBEDTLS_OID_COUNTRY_US                                           \
+        MBEDTLS_OID_ORG_RSA_DATA_SECURITY     /* {iso(1) member-body(2) us(840) rsadsi(113549)} */
+#define MBEDTLS_OID_ORG_ANSI_X9_62 "\xce\x3d" /* ansi-X9-62(10045) */
+#define MBEDTLS_OID_ANSI_X9_62                                                                     \
+    MBEDTLS_OID_ISO_MEMBER_BODIES MBEDTLS_OID_COUNTRY_US MBEDTLS_OID_ORG_ANSI_X9_62
+
+/*
+ * ISO Identified organization OID parts
+ */
+#define MBEDTLS_OID_ORG_DOD "\x06" /* {dod(6)} */
+#define MBEDTLS_OID_ORG_OIW "\x0e"
+#define MBEDTLS_OID_OIW_SECSIG MBEDTLS_OID_ORG_OIW "\x03"
+#define MBEDTLS_OID_OIW_SECSIG_ALG MBEDTLS_OID_OIW_SECSIG "\x02"
+#define MBEDTLS_OID_OIW_SECSIG_SHA1 MBEDTLS_OID_OIW_SECSIG_ALG "\x1a"
+#define MBEDTLS_OID_ORG_CERTICOM "\x81\x04" /* certicom(132) */
+#define MBEDTLS_OID_CERTICOM MBEDTLS_OID_ISO_IDENTIFIED_ORG MBEDTLS_OID_ORG_CERTICOM
+#define MBEDTLS_OID_ORG_TELETRUST "\x24" /* teletrust(36) */
+#define MBEDTLS_OID_TELETRUST MBEDTLS_OID_ISO_IDENTIFIED_ORG MBEDTLS_OID_ORG_TELETRUST
+
+/*
+ * ISO ITU OID parts
+ */
+#define MBEDTLS_OID_ORGANIZATION "\x01" /* {organization(1)} */
+#define MBEDTLS_OID_ISO_ITU_US_ORG                                                                 \
+    MBEDTLS_OID_ISO_ITU_COUNTRY MBEDTLS_OID_COUNTRY_US                                             \
+        MBEDTLS_OID_ORGANIZATION /* {joint-iso-itu-t(2) country(16) us(840) organization(1)} */
+
+#define MBEDTLS_OID_ORG_GOV "\x65" /* {gov(101)} */
+#define MBEDTLS_OID_GOV                                                                            \
+    MBEDTLS_OID_ISO_ITU_US_ORG MBEDTLS_OID_ORG_GOV /* {joint-iso-itu-t(2) country(16) us(840)      \
+                                                      organization(1) gov(101)} */
+
+#define MBEDTLS_OID_ORG_NETSCAPE "\x86\xF8\x42" /* {netscape(113730)} */
+#define MBEDTLS_OID_NETSCAPE                                                                       \
+    MBEDTLS_OID_ISO_ITU_US_ORG                                                                     \
+    MBEDTLS_OID_ORG_NETSCAPE /* Netscape OID {joint-iso-itu-t(2) country(16) us(840)               \
+                                organization(1) netscape(113730)} */
+
+/* ISO arc for standard certificate and CRL extensions */
+#define MBEDTLS_OID_ID_CE                                                                          \
+    MBEDTLS_OID_ISO_CCITT_DS                                                                       \
+    "\x1D" /**< id-ce OBJECT IDENTIFIER  ::=  {joint-iso-ccitt(2) ds(5) 29} */
+
+#define MBEDTLS_OID_NIST_ALG                                                                       \
+    MBEDTLS_OID_GOV "\x03\x04" /** { joint-iso-itu-t(2) country(16) us(840) organization(1)        \
+                                  gov(101) csor(3) nistAlgorithm(4) */
+
+/**
+ * Private Internet Extensions
+ * { iso(1) identified-organization(3) dod(6) internet(1)
+ *                      security(5) mechanisms(5) pkix(7) }
+ */
+#define MBEDTLS_OID_INTERNET MBEDTLS_OID_ISO_IDENTIFIED_ORG MBEDTLS_OID_ORG_DOD "\x01"
+#define MBEDTLS_OID_PKIX MBEDTLS_OID_INTERNET "\x05\x05\x07"
+
+/*
+ * Arc for standard naming attributes
+ */
+#define MBEDTLS_OID_AT                                                                             \
+    MBEDTLS_OID_ISO_CCITT_DS "\x04" /**< id-at OBJECT IDENTIFIER ::= {joint-iso-ccitt(2) ds(5) 4}  \
+                                     */
+#define MBEDTLS_OID_AT_CN MBEDTLS_OID_AT "\x03" /**< id-at-commonName AttributeType:= {id-at 3} */
+#define MBEDTLS_OID_AT_SUR_NAME                                                                    \
+    MBEDTLS_OID_AT "\x04" /**< id-at-surName AttributeType:= {id-at 4} */
+#define MBEDTLS_OID_AT_SERIAL_NUMBER                                                               \
+    MBEDTLS_OID_AT "\x05" /**< id-at-serialNumber AttributeType:= {id-at 5} */
+#define MBEDTLS_OID_AT_COUNTRY                                                                     \
+    MBEDTLS_OID_AT "\x06" /**< id-at-countryName AttributeType:= {id-at 6} */
+#define MBEDTLS_OID_AT_LOCALITY                                                                    \
+    MBEDTLS_OID_AT "\x07"                          /**< id-at-locality AttributeType:= {id-at 7} */
+#define MBEDTLS_OID_AT_STATE MBEDTLS_OID_AT "\x08" /**< id-at-state AttributeType:= {id-at 8} */
+#define MBEDTLS_OID_AT_ORGANIZATION                                                                \
+    MBEDTLS_OID_AT "\x0A" /**< id-at-organizationName AttributeType:= {id-at 10} */
+#define MBEDTLS_OID_AT_ORG_UNIT                                                                    \
+    MBEDTLS_OID_AT "\x0B" /**< id-at-organizationalUnitName AttributeType:= {id-at 11} */
+#define MBEDTLS_OID_AT_TITLE MBEDTLS_OID_AT "\x0C" /**< id-at-title AttributeType:= {id-at 12} */
+#define MBEDTLS_OID_AT_POSTAL_ADDRESS                                                              \
+    MBEDTLS_OID_AT "\x10" /**< id-at-postalAddress AttributeType:= {id-at 16} */
+#define MBEDTLS_OID_AT_POSTAL_CODE                                                                 \
+    MBEDTLS_OID_AT "\x11" /**< id-at-postalCode AttributeType:= {id-at 17} */
+#define MBEDTLS_OID_AT_GIVEN_NAME                                                                  \
+    MBEDTLS_OID_AT "\x2A" /**< id-at-givenName AttributeType:= {id-at 42} */
+#define MBEDTLS_OID_AT_INITIALS                                                                    \
+    MBEDTLS_OID_AT "\x2B" /**< id-at-initials AttributeType:= {id-at 43} */
+#define MBEDTLS_OID_AT_GENERATION_QUALIFIER                                                        \
+    MBEDTLS_OID_AT "\x2C" /**< id-at-generationQualifier AttributeType:= {id-at 44} */
+#define MBEDTLS_OID_AT_UNIQUE_IDENTIFIER                                                           \
+    MBEDTLS_OID_AT "\x2D" /**< id-at-uniqueIdentifier AttributType:= {id-at 45} */
+#define MBEDTLS_OID_AT_DN_QUALIFIER                                                                \
+    MBEDTLS_OID_AT "\x2E" /**< id-at-dnQualifier AttributeType:= {id-at 46} */
+#define MBEDTLS_OID_AT_PSEUDONYM                                                                   \
+    MBEDTLS_OID_AT "\x41" /**< id-at-pseudonym AttributeType:= {id-at 65} */
+
+#define MBEDTLS_OID_UID                                                                            \
+    "\x09\x92\x26\x89\x93\xF2\x2C\x64\x01\x01" /** id-domainComponent AttributeType:= {itu-t(0)    \
+                                                  data(9) pss(2342) ucl(19200300) pilot(100)       \
+                                                  pilotAttributeType(1) uid(1)} */
+#define MBEDTLS_OID_DOMAIN_COMPONENT                                                               \
+    "\x09\x92\x26\x89\x93\xF2\x2C\x64\x01\x19" /** id-domainComponent AttributeType:= {itu-t(0)    \
+                                                  data(9) pss(2342) ucl(19200300) pilot(100)       \
+                                                  pilotAttributeType(1) domainComponent(25)} */
+
+/*
+ * OIDs for standard certificate extensions
+ */
+#define MBEDTLS_OID_AUTHORITY_KEY_IDENTIFIER                                                       \
+    MBEDTLS_OID_ID_CE                                                                              \
+    "\x23" /**< id-ce-authorityKeyIdentifier OBJECT IDENTIFIER ::=  { id-ce 35 } */
+#define MBEDTLS_OID_SUBJECT_KEY_IDENTIFIER                                                         \
+    MBEDTLS_OID_ID_CE "\x0E" /**< id-ce-subjectKeyIdentifier OBJECT IDENTIFIER ::=  { id-ce 14 }   \
+                              */
+#define MBEDTLS_OID_KEY_USAGE                                                                      \
+    MBEDTLS_OID_ID_CE "\x0F" /**< id-ce-keyUsage OBJECT IDENTIFIER ::=  { id-ce 15 } */
+#define MBEDTLS_OID_CERTIFICATE_POLICIES                                                           \
+    MBEDTLS_OID_ID_CE "\x20" /**< id-ce-certificatePolicies OBJECT IDENTIFIER ::=  { id-ce 32 } */
+#define MBEDTLS_OID_POLICY_MAPPINGS                                                                \
+    MBEDTLS_OID_ID_CE "\x21" /**< id-ce-policyMappings OBJECT IDENTIFIER ::=  { id-ce 33 } */
+#define MBEDTLS_OID_SUBJECT_ALT_NAME                                                               \
+    MBEDTLS_OID_ID_CE "\x11" /**< id-ce-subjectAltName OBJECT IDENTIFIER ::=  { id-ce 17 } */
+#define MBEDTLS_OID_ISSUER_ALT_NAME                                                                \
+    MBEDTLS_OID_ID_CE "\x12" /**< id-ce-issuerAltName OBJECT IDENTIFIER ::=  { id-ce 18 } */
+#define MBEDTLS_OID_SUBJECT_DIRECTORY_ATTRS                                                        \
+    MBEDTLS_OID_ID_CE                                                                              \
+    "\x09" /**< id-ce-subjectDirectoryAttributes OBJECT IDENTIFIER ::=  { id-ce 9 } */
+#define MBEDTLS_OID_BASIC_CONSTRAINTS                                                              \
+    MBEDTLS_OID_ID_CE "\x13" /**< id-ce-basicConstraints OBJECT IDENTIFIER ::=  { id-ce 19 } */
+#define MBEDTLS_OID_NAME_CONSTRAINTS                                                               \
+    MBEDTLS_OID_ID_CE "\x1E" /**< id-ce-nameConstraints OBJECT IDENTIFIER ::=  { id-ce 30 } */
+#define MBEDTLS_OID_POLICY_CONSTRAINTS                                                             \
+    MBEDTLS_OID_ID_CE "\x24" /**< id-ce-policyConstraints OBJECT IDENTIFIER ::=  { id-ce 36 } */
+#define MBEDTLS_OID_EXTENDED_KEY_USAGE                                                             \
+    MBEDTLS_OID_ID_CE "\x25" /**< id-ce-extKeyUsage OBJECT IDENTIFIER ::= { id-ce 37 } */
+#define MBEDTLS_OID_CRL_DISTRIBUTION_POINTS                                                        \
+    MBEDTLS_OID_ID_CE "\x1F" /**< id-ce-cRLDistributionPoints OBJECT IDENTIFIER ::=  { id-ce 31 }  \
+                              */
+#define MBEDTLS_OID_INIHIBIT_ANYPOLICY                                                             \
+    MBEDTLS_OID_ID_CE "\x36" /**< id-ce-inhibitAnyPolicy OBJECT IDENTIFIER ::=  { id-ce 54 } */
+#define MBEDTLS_OID_FRESHEST_CRL                                                                   \
+    MBEDTLS_OID_ID_CE "\x2E" /**< id-ce-freshestCRL OBJECT IDENTIFIER ::=  { id-ce 46 } */
+
+/*
+ * Certificate policies
+ */
+#define MBEDTLS_OID_ANY_POLICY                                                                     \
+    MBEDTLS_OID_CERTIFICATE_POLICIES                                                               \
+    "\x00" /**< anyPolicy OBJECT IDENTIFIER ::= { id-ce-certificatePolicies 0 } */
+
+/*
+ * Netscape certificate extensions
+ */
+#define MBEDTLS_OID_NS_CERT MBEDTLS_OID_NETSCAPE "\x01"
+#define MBEDTLS_OID_NS_CERT_TYPE MBEDTLS_OID_NS_CERT "\x01"
+#define MBEDTLS_OID_NS_BASE_URL MBEDTLS_OID_NS_CERT "\x02"
+#define MBEDTLS_OID_NS_REVOCATION_URL MBEDTLS_OID_NS_CERT "\x03"
+#define MBEDTLS_OID_NS_CA_REVOCATION_URL MBEDTLS_OID_NS_CERT "\x04"
+#define MBEDTLS_OID_NS_RENEWAL_URL MBEDTLS_OID_NS_CERT "\x07"
+#define MBEDTLS_OID_NS_CA_POLICY_URL MBEDTLS_OID_NS_CERT "\x08"
+#define MBEDTLS_OID_NS_SSL_SERVER_NAME MBEDTLS_OID_NS_CERT "\x0C"
+#define MBEDTLS_OID_NS_COMMENT MBEDTLS_OID_NS_CERT "\x0D"
+#define MBEDTLS_OID_NS_DATA_TYPE MBEDTLS_OID_NETSCAPE "\x02"
+#define MBEDTLS_OID_NS_CERT_SEQUENCE MBEDTLS_OID_NS_DATA_TYPE "\x05"
+
+/*
+ * OIDs for CRL extensions
+ */
+#define MBEDTLS_OID_PRIVATE_KEY_USAGE_PERIOD MBEDTLS_OID_ID_CE "\x10"
+#define MBEDTLS_OID_CRL_NUMBER                                                                     \
+    MBEDTLS_OID_ID_CE "\x14" /**< id-ce-cRLNumber OBJECT IDENTIFIER ::= { id-ce 20 } */
+
+/*
+ * X.509 v3 Extended key usage OIDs
+ */
+#define MBEDTLS_OID_ANY_EXTENDED_KEY_USAGE                                                         \
+    MBEDTLS_OID_EXTENDED_KEY_USAGE                                                                 \
+    "\x00" /**< anyExtendedKeyUsage OBJECT IDENTIFIER ::= { id-ce-extKeyUsage 0 } */
+
+#define MBEDTLS_OID_KP MBEDTLS_OID_PKIX "\x03" /**< id-kp OBJECT IDENTIFIER ::= { id-pkix 3 } */
+#define MBEDTLS_OID_SERVER_AUTH                                                                    \
+    MBEDTLS_OID_KP "\x01" /**< id-kp-serverAuth OBJECT IDENTIFIER ::= { id-kp 1 } */
+#define MBEDTLS_OID_CLIENT_AUTH                                                                    \
+    MBEDTLS_OID_KP "\x02" /**< id-kp-clientAuth OBJECT IDENTIFIER ::= { id-kp 2 } */
+#define MBEDTLS_OID_CODE_SIGNING                                                                   \
+    MBEDTLS_OID_KP "\x03" /**< id-kp-codeSigning OBJECT IDENTIFIER ::= { id-kp 3 } */
+#define MBEDTLS_OID_EMAIL_PROTECTION                                                               \
+    MBEDTLS_OID_KP "\x04" /**< id-kp-emailProtection OBJECT IDENTIFIER ::= { id-kp 4 } */
+#define MBEDTLS_OID_TIME_STAMPING                                                                  \
+    MBEDTLS_OID_KP "\x08" /**< id-kp-timeStamping OBJECT IDENTIFIER ::= { id-kp 8 } */
+#define MBEDTLS_OID_OCSP_SIGNING                                                                   \
+    MBEDTLS_OID_KP "\x09" /**< id-kp-OCSPSigning OBJECT IDENTIFIER ::= { id-kp 9 } */
+
+/**
+ * Wi-SUN Alliance Field Area Network
+ * { iso(1) identified-organization(3) dod(6) internet(1)
+ *                      private(4) enterprise(1) WiSUN(45605) FieldAreaNetwork(1) }
+ */
+#define MBEDTLS_OID_WISUN_FAN MBEDTLS_OID_INTERNET "\x04\x01\x82\xe4\x25\x01"
+
+#define MBEDTLS_OID_ON MBEDTLS_OID_PKIX "\x08" /**< id-on OBJECT IDENTIFIER ::= { id-pkix 8 } */
+#define MBEDTLS_OID_ON_HW_MODULE_NAME                                                              \
+    MBEDTLS_OID_ON "\x04" /**< id-on-hardwareModuleName OBJECT IDENTIFIER ::= { id-on 4 } */
+
+/*
+ * PKCS definition OIDs
+ */
+
+#define MBEDTLS_OID_PKCS                                                                           \
+    MBEDTLS_OID_RSA_COMPANY "\x01" /**< pkcs OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840) \
+                                      rsadsi(113549) 1 } */
+#define MBEDTLS_OID_PKCS1                                                                          \
+    MBEDTLS_OID_PKCS "\x01" /**< pkcs-1 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)      \
+                               rsadsi(113549) pkcs(1) 1 } */
+#define MBEDTLS_OID_PKCS5                                                                          \
+    MBEDTLS_OID_PKCS "\x05" /**< pkcs-5 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)      \
+                               rsadsi(113549) pkcs(1) 5 } */
+#define MBEDTLS_OID_PKCS9                                                                          \
+    MBEDTLS_OID_PKCS "\x09" /**< pkcs-9 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)      \
+                               rsadsi(113549) pkcs(1) 9 } */
+#define MBEDTLS_OID_PKCS12                                                                         \
+    MBEDTLS_OID_PKCS "\x0c" /**< pkcs-12 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)     \
+                               rsadsi(113549) pkcs(1) 12 } */
+
+/*
+ * PKCS#1 OIDs
+ */
+#define MBEDTLS_OID_PKCS1_RSA                                                                      \
+    MBEDTLS_OID_PKCS1 "\x01" /**< rsaEncryption OBJECT IDENTIFIER ::= { pkcs-1 1 } */
+#define MBEDTLS_OID_PKCS1_MD5                                                                      \
+    MBEDTLS_OID_PKCS1 "\x04" /**< md5WithRSAEncryption ::= { pkcs-1 4 }                            \
+                              */
+#define MBEDTLS_OID_PKCS1_SHA1                                                                     \
+    MBEDTLS_OID_PKCS1 "\x05" /**< sha1WithRSAEncryption ::= { pkcs-1 5 } */
+#define MBEDTLS_OID_PKCS1_SHA224                                                                   \
+    MBEDTLS_OID_PKCS1 "\x0e" /**< sha224WithRSAEncryption ::= { pkcs-1 14 } */
+#define MBEDTLS_OID_PKCS1_SHA256                                                                   \
+    MBEDTLS_OID_PKCS1 "\x0b" /**< sha256WithRSAEncryption ::= { pkcs-1 11 } */
+#define MBEDTLS_OID_PKCS1_SHA384                                                                   \
+    MBEDTLS_OID_PKCS1 "\x0c" /**< sha384WithRSAEncryption ::= { pkcs-1 12 } */
+#define MBEDTLS_OID_PKCS1_SHA512                                                                   \
+    MBEDTLS_OID_PKCS1 "\x0d" /**< sha512WithRSAEncryption ::= { pkcs-1 13 } */
+
+#define MBEDTLS_OID_RSA_SHA_OBS "\x2B\x0E\x03\x02\x1D"
+
+#define MBEDTLS_OID_PKCS9_EMAIL                                                                    \
+    MBEDTLS_OID_PKCS9 "\x01" /**< emailAddress AttributeType ::= { pkcs-9 1 } */
+
+/* RFC 4055 */
+#define MBEDTLS_OID_RSASSA_PSS MBEDTLS_OID_PKCS1 "\x0a" /**< id-RSASSA-PSS ::= { pkcs-1 10 } */
+#define MBEDTLS_OID_MGF1 MBEDTLS_OID_PKCS1 "\x08"       /**< id-mgf1 ::= { pkcs-1 8 } */
+
+/*
+ * Digest algorithms
+ */
+#define MBEDTLS_OID_DIGEST_ALG_MD5                                                                 \
+    MBEDTLS_OID_RSA_COMPANY                                                                        \
+    "\x02\x05" /**< id-mbedtls_md5 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)           \
+                  rsadsi(113549) digestAlgorithm(2) 5 } */
+#define MBEDTLS_OID_DIGEST_ALG_SHA1                                                                \
+    MBEDTLS_OID_ISO_IDENTIFIED_ORG                                                                 \
+    MBEDTLS_OID_OIW_SECSIG_SHA1 /**< id-mbedtls_sha1 OBJECT IDENTIFIER ::= { iso(1)                \
+                                   identified-organization(3) oiw(14) secsig(3) algorithms(2)      \
+                                   26 } */
+#define MBEDTLS_OID_DIGEST_ALG_SHA224                                                              \
+    MBEDTLS_OID_NIST_ALG                                                                           \
+    "\x02\x04" /**< id-sha224 OBJECT IDENTIFIER ::= { joint-iso-itu-t(2) country(16) us(840)       \
+                  organization(1) gov(101) csor(3) nistalgorithm(4) hashalgs(2) 4 } */
+#define MBEDTLS_OID_DIGEST_ALG_SHA256                                                              \
+    MBEDTLS_OID_NIST_ALG                                                                           \
+    "\x02\x01" /**< id-mbedtls_sha256 OBJECT IDENTIFIER ::= { joint-iso-itu-t(2) country(16)       \
+                  us(840) organization(1) gov(101) csor(3) nistalgorithm(4) hashalgs(2) 1 } */
+
+#define MBEDTLS_OID_DIGEST_ALG_SHA384                                                              \
+    MBEDTLS_OID_NIST_ALG                                                                           \
+    "\x02\x02" /**< id-sha384 OBJECT IDENTIFIER ::= { joint-iso-itu-t(2) country(16) us(840)       \
+                  organization(1) gov(101) csor(3) nistalgorithm(4) hashalgs(2) 2 } */
+
+#define MBEDTLS_OID_DIGEST_ALG_SHA512                                                              \
+    MBEDTLS_OID_NIST_ALG                                                                           \
+    "\x02\x03" /**< id-mbedtls_sha512 OBJECT IDENTIFIER ::= { joint-iso-itu-t(2) country(16)       \
+                  us(840) organization(1) gov(101) csor(3) nistalgorithm(4) hashalgs(2) 3 } */
+
+#define MBEDTLS_OID_DIGEST_ALG_RIPEMD160                                                           \
+    MBEDTLS_OID_TELETRUST                                                                          \
+    "\x03\x02\x01" /**< id-ripemd160 OBJECT IDENTIFIER :: { iso(1) identified-organization(3)      \
+                      teletrust(36) algorithm(3) hashAlgorithm(2) ripemd160(1) } */
+
+#define MBEDTLS_OID_HMAC_SHA1                                                                      \
+    MBEDTLS_OID_RSA_COMPANY                                                                        \
+    "\x02\x07" /**< id-hmacWithSHA1 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)          \
+                  rsadsi(113549) digestAlgorithm(2) 7 } */
+
+#define MBEDTLS_OID_HMAC_SHA224                                                                    \
+    MBEDTLS_OID_RSA_COMPANY                                                                        \
+    "\x02\x08" /**< id-hmacWithSHA224 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)        \
+                  rsadsi(113549) digestAlgorithm(2) 8 } */
+
+#define MBEDTLS_OID_HMAC_SHA256                                                                    \
+    MBEDTLS_OID_RSA_COMPANY                                                                        \
+    "\x02\x09" /**< id-hmacWithSHA256 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)        \
+                  rsadsi(113549) digestAlgorithm(2) 9 } */
+
+#define MBEDTLS_OID_HMAC_SHA384                                                                    \
+    MBEDTLS_OID_RSA_COMPANY                                                                        \
+    "\x02\x0A" /**< id-hmacWithSHA384 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)        \
+                  rsadsi(113549) digestAlgorithm(2) 10 } */
+
+#define MBEDTLS_OID_HMAC_SHA512                                                                    \
+    MBEDTLS_OID_RSA_COMPANY                                                                        \
+    "\x02\x0B" /**< id-hmacWithSHA512 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)        \
+                  rsadsi(113549) digestAlgorithm(2) 11 } */
+
+/*
+ * Encryption algorithms
+ */
+#define MBEDTLS_OID_DES_CBC                                                                        \
+    MBEDTLS_OID_ISO_IDENTIFIED_ORG MBEDTLS_OID_OIW_SECSIG_ALG                                      \
+        "\x07" /**< desCBC OBJECT IDENTIFIER ::= { iso(1) identified-organization(3) oiw(14)       \
+                  secsig(3) algorithms(2) 7 } */
+#define MBEDTLS_OID_DES_EDE3_CBC                                                                   \
+    MBEDTLS_OID_RSA_COMPANY                                                                        \
+    "\x03\x07" /**< des-ede3-cbc OBJECT IDENTIFIER ::= { iso(1) member-body(2) -- us(840)          \
+                  rsadsi(113549) encryptionAlgorithm(3) 7 } */
+#define MBEDTLS_OID_AES                                                                            \
+    MBEDTLS_OID_NIST_ALG                                                                           \
+    "\x01" /** aes OBJECT IDENTIFIER ::= { joint-iso-itu-t(2) country(16) us(840)                  \
+              organization(1) gov(101) csor(3) nistAlgorithm(4) 1 } */
+
+/*
+ * Key Wrapping algorithms
+ */
+/*
+ * RFC 5649
+ */
+#define MBEDTLS_OID_AES128_KW                                                                      \
+    MBEDTLS_OID_AES "\x05" /** id-aes128-wrap     OBJECT IDENTIFIER ::= { aes 5 } */
+#define MBEDTLS_OID_AES128_KWP                                                                     \
+    MBEDTLS_OID_AES "\x08" /** id-aes128-wrap-pad OBJECT IDENTIFIER ::= { aes 8 } */
+#define MBEDTLS_OID_AES192_KW                                                                      \
+    MBEDTLS_OID_AES "\x19" /** id-aes192-wrap     OBJECT IDENTIFIER ::= { aes 25 } */
+#define MBEDTLS_OID_AES192_KWP                                                                     \
+    MBEDTLS_OID_AES "\x1c" /** id-aes192-wrap-pad OBJECT IDENTIFIER ::= { aes 28 } */
+#define MBEDTLS_OID_AES256_KW                                                                      \
+    MBEDTLS_OID_AES "\x2d" /** id-aes256-wrap     OBJECT IDENTIFIER ::= { aes 45 } */
+#define MBEDTLS_OID_AES256_KWP                                                                     \
+    MBEDTLS_OID_AES "\x30" /** id-aes256-wrap-pad OBJECT IDENTIFIER ::= { aes 48 } */
+/*
+ * PKCS#5 OIDs
+ */
+#define MBEDTLS_OID_PKCS5_PBKDF2                                                                   \
+    MBEDTLS_OID_PKCS5 "\x0c" /**< id-PBKDF2 OBJECT IDENTIFIER ::= {pkcs-5 12} */
+#define MBEDTLS_OID_PKCS5_PBES2                                                                    \
+    MBEDTLS_OID_PKCS5 "\x0d" /**< id-PBES2 OBJECT IDENTIFIER ::= {pkcs-5 13} */
+#define MBEDTLS_OID_PKCS5_PBMAC1                                                                   \
+    MBEDTLS_OID_PKCS5 "\x0e" /**< id-PBMAC1 OBJECT IDENTIFIER ::= {pkcs-5 14} */
+
+/*
+ * PKCS#5 PBES1 algorithms
+ */
+#define MBEDTLS_OID_PKCS5_PBE_MD5_DES_CBC                                                          \
+    MBEDTLS_OID_PKCS5 "\x03" /**< pbeWithMD5AndDES-CBC OBJECT IDENTIFIER ::= {pkcs-5 3} */
+#define MBEDTLS_OID_PKCS5_PBE_MD5_RC2_CBC                                                          \
+    MBEDTLS_OID_PKCS5 "\x06" /**< pbeWithMD5AndRC2-CBC OBJECT IDENTIFIER ::= {pkcs-5 6} */
+#define MBEDTLS_OID_PKCS5_PBE_SHA1_DES_CBC                                                         \
+    MBEDTLS_OID_PKCS5 "\x0a" /**< pbeWithSHA1AndDES-CBC OBJECT IDENTIFIER ::= {pkcs-5 10} */
+#define MBEDTLS_OID_PKCS5_PBE_SHA1_RC2_CBC                                                         \
+    MBEDTLS_OID_PKCS5 "\x0b" /**< pbeWithSHA1AndRC2-CBC OBJECT IDENTIFIER ::= {pkcs-5 11} */
+
+/*
+ * PKCS#8 OIDs
+ */
+#define MBEDTLS_OID_PKCS9_CSR_EXT_REQ                                                              \
+    MBEDTLS_OID_PKCS9 "\x0e" /**< extensionRequest OBJECT IDENTIFIER ::= {pkcs-9 14} */
+
+/*
+ * PKCS#12 PBE OIDs
+ */
+#define MBEDTLS_OID_PKCS12_PBE                                                                     \
+    MBEDTLS_OID_PKCS12 "\x01" /**< pkcs-12PbeIds OBJECT IDENTIFIER ::= {pkcs-12 1} */
+
+#define MBEDTLS_OID_PKCS12_PBE_SHA1_DES3_EDE_CBC                                                   \
+    MBEDTLS_OID_PKCS12_PBE                                                                         \
+    "\x03" /**< pbeWithSHAAnd3-KeyTripleDES-CBC OBJECT IDENTIFIER ::= {pkcs-12PbeIds 3} */
+#define MBEDTLS_OID_PKCS12_PBE_SHA1_DES2_EDE_CBC                                                   \
+    MBEDTLS_OID_PKCS12_PBE                                                                         \
+    "\x04" /**< pbeWithSHAAnd2-KeyTripleDES-CBC OBJECT IDENTIFIER ::= {pkcs-12PbeIds 4} */
+#define MBEDTLS_OID_PKCS12_PBE_SHA1_RC2_128_CBC                                                    \
+    MBEDTLS_OID_PKCS12_PBE                                                                         \
+    "\x05" /**< pbeWithSHAAnd128BitRC2-CBC OBJECT IDENTIFIER ::= {pkcs-12PbeIds 5} */
+#define MBEDTLS_OID_PKCS12_PBE_SHA1_RC2_40_CBC                                                     \
+    MBEDTLS_OID_PKCS12_PBE                                                                         \
+    "\x06" /**< pbeWithSHAAnd40BitRC2-CBC OBJECT IDENTIFIER ::= {pkcs-12PbeIds 6} */
+
+/*
+ * EC key algorithms from RFC 5480
+ */
+
+/* id-ecPublicKey OBJECT IDENTIFIER ::= {
+ *       iso(1) member-body(2) us(840) ansi-X9-62(10045) keyType(2) 1 } */
+#define MBEDTLS_OID_EC_ALG_UNRESTRICTED MBEDTLS_OID_ANSI_X9_62 "\x02\01"
+
+/*   id-ecDH OBJECT IDENTIFIER ::= {
+ *     iso(1) identified-organization(3) certicom(132)
+ *     schemes(1) ecdh(12) } */
+#define MBEDTLS_OID_EC_ALG_ECDH MBEDTLS_OID_CERTICOM "\x01\x0c"
+
+/*
+ * ECParameters namedCurve identifiers, from RFC 5480, RFC 5639, and SEC2
+ */
+
+/* secp192r1 OBJECT IDENTIFIER ::= {
+ *   iso(1) member-body(2) us(840) ansi-X9-62(10045) curves(3) prime(1) 1 } */
+#define MBEDTLS_OID_EC_GRP_SECP192R1 MBEDTLS_OID_ANSI_X9_62 "\x03\x01\x01"
+
+/* secp224r1 OBJECT IDENTIFIER ::= {
+ *   iso(1) identified-organization(3) certicom(132) curve(0) 33 } */
+#define MBEDTLS_OID_EC_GRP_SECP224R1 MBEDTLS_OID_CERTICOM "\x00\x21"
+
+/* secp256r1 OBJECT IDENTIFIER ::= {
+ *   iso(1) member-body(2) us(840) ansi-X9-62(10045) curves(3) prime(1) 7 } */
+#define MBEDTLS_OID_EC_GRP_SECP256R1 MBEDTLS_OID_ANSI_X9_62 "\x03\x01\x07"
+
+/* secp384r1 OBJECT IDENTIFIER ::= {
+ *   iso(1) identified-organization(3) certicom(132) curve(0) 34 } */
+#define MBEDTLS_OID_EC_GRP_SECP384R1 MBEDTLS_OID_CERTICOM "\x00\x22"
+
+/* secp521r1 OBJECT IDENTIFIER ::= {
+ *   iso(1) identified-organization(3) certicom(132) curve(0) 35 } */
+#define MBEDTLS_OID_EC_GRP_SECP521R1 MBEDTLS_OID_CERTICOM "\x00\x23"
+
+/* secp192k1 OBJECT IDENTIFIER ::= {
+ *   iso(1) identified-organization(3) certicom(132) curve(0) 31 } */
+#define MBEDTLS_OID_EC_GRP_SECP192K1 MBEDTLS_OID_CERTICOM "\x00\x1f"
+
+/* secp224k1 OBJECT IDENTIFIER ::= {
+ *   iso(1) identified-organization(3) certicom(132) curve(0) 32 } */
+#define MBEDTLS_OID_EC_GRP_SECP224K1 MBEDTLS_OID_CERTICOM "\x00\x20"
+
+/* secp256k1 OBJECT IDENTIFIER ::= {
+ *   iso(1) identified-organization(3) certicom(132) curve(0) 10 } */
+#define MBEDTLS_OID_EC_GRP_SECP256K1 MBEDTLS_OID_CERTICOM "\x00\x0a"
+
+/* RFC 5639 4.1
+ * ecStdCurvesAndGeneration OBJECT IDENTIFIER::= {iso(1)
+ * identified-organization(3) teletrust(36) algorithm(3) signature-
+ * algorithm(3) ecSign(2) 8}
+ * ellipticCurve OBJECT IDENTIFIER ::= {ecStdCurvesAndGeneration 1}
+ * versionOne OBJECT IDENTIFIER ::= {ellipticCurve 1} */
+#define MBEDTLS_OID_EC_BRAINPOOL_V1 MBEDTLS_OID_TELETRUST "\x03\x03\x02\x08\x01\x01"
+
+/* brainpoolP256r1 OBJECT IDENTIFIER ::= {versionOne 7} */
+#define MBEDTLS_OID_EC_GRP_BP256R1 MBEDTLS_OID_EC_BRAINPOOL_V1 "\x07"
+
+/* brainpoolP384r1 OBJECT IDENTIFIER ::= {versionOne 11} */
+#define MBEDTLS_OID_EC_GRP_BP384R1 MBEDTLS_OID_EC_BRAINPOOL_V1 "\x0B"
+
+/* brainpoolP512r1 OBJECT IDENTIFIER ::= {versionOne 13} */
+#define MBEDTLS_OID_EC_GRP_BP512R1 MBEDTLS_OID_EC_BRAINPOOL_V1 "\x0D"
+
+/*
+ * SEC1 C.1
+ *
+ * prime-field OBJECT IDENTIFIER ::= { id-fieldType 1 }
+ * id-fieldType OBJECT IDENTIFIER ::= { ansi-X9-62 fieldType(1)}
+ */
+#define MBEDTLS_OID_ANSI_X9_62_FIELD_TYPE MBEDTLS_OID_ANSI_X9_62 "\x01"
+#define MBEDTLS_OID_ANSI_X9_62_PRIME_FIELD MBEDTLS_OID_ANSI_X9_62_FIELD_TYPE "\x01"
+
+/*
+ * ECDSA signature identifiers, from RFC 5480
+ */
+#define MBEDTLS_OID_ANSI_X9_62_SIG MBEDTLS_OID_ANSI_X9_62 "\x04"          /* signatures(4) */
+#define MBEDTLS_OID_ANSI_X9_62_SIG_SHA2 MBEDTLS_OID_ANSI_X9_62_SIG "\x03" /* ecdsa-with-SHA2(3) */
+
+/* ecdsa-with-SHA1 OBJECT IDENTIFIER ::= {
+ *   iso(1) member-body(2) us(840) ansi-X9-62(10045) signatures(4) 1 } */
+#define MBEDTLS_OID_ECDSA_SHA1 MBEDTLS_OID_ANSI_X9_62_SIG "\x01"
+
+/* ecdsa-with-SHA224 OBJECT IDENTIFIER ::= {
+ *   iso(1) member-body(2) us(840) ansi-X9-62(10045) signatures(4)
+ *   ecdsa-with-SHA2(3) 1 } */
+#define MBEDTLS_OID_ECDSA_SHA224 MBEDTLS_OID_ANSI_X9_62_SIG_SHA2 "\x01"
+
+/* ecdsa-with-SHA256 OBJECT IDENTIFIER ::= {
+ *   iso(1) member-body(2) us(840) ansi-X9-62(10045) signatures(4)
+ *   ecdsa-with-SHA2(3) 2 } */
+#define MBEDTLS_OID_ECDSA_SHA256 MBEDTLS_OID_ANSI_X9_62_SIG_SHA2 "\x02"
+
+/* ecdsa-with-SHA384 OBJECT IDENTIFIER ::= {
+ *   iso(1) member-body(2) us(840) ansi-X9-62(10045) signatures(4)
+ *   ecdsa-with-SHA2(3) 3 } */
+#define MBEDTLS_OID_ECDSA_SHA384 MBEDTLS_OID_ANSI_X9_62_SIG_SHA2 "\x03"
+
+/* ecdsa-with-SHA512 OBJECT IDENTIFIER ::= {
+ *   iso(1) member-body(2) us(840) ansi-X9-62(10045) signatures(4)
+ *   ecdsa-with-SHA2(3) 4 } */
+#define MBEDTLS_OID_ECDSA_SHA512 MBEDTLS_OID_ANSI_X9_62_SIG_SHA2 "\x04"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \brief Base OID descriptor structure
+ */
+typedef struct mbedtls_oid_descriptor_t {
+    const char* MBEDTLS_PRIVATE(asn1); /*!< OID ASN.1 representation       */
+    size_t MBEDTLS_PRIVATE(asn1_len);  /*!< length of asn1                 */
+#if !defined(MBEDTLS_X509_REMOVE_INFO)
+    const char* MBEDTLS_PRIVATE(name);        /*!< official name (e.g. from RFC)  */
+    const char* MBEDTLS_PRIVATE(description); /*!< human friendly description     */
+#endif
+} mbedtls_oid_descriptor_t;
+
+/**
+ * \brief           Translate an ASN.1 OID into its numeric representation
+ *                  (e.g. "\x2A\x86\x48\x86\xF7\x0D" into "1.2.840.113549")
+ *
+ * \param buf       buffer to put representation in
+ * \param size      size of the buffer
+ * \param oid       OID to translate
+ *
+ * \return          Length of the string written (excluding final NULL) or
+ *                  MBEDTLS_ERR_OID_BUF_TOO_SMALL in case of error
+ */
+int mbedtls_oid_get_numeric_string(char* buf, size_t size, const mbedtls_asn1_buf* oid);
+
+/**
+ * \brief          Translate an X.509 extension OID into local values
+ *
+ * \param oid      OID to use
+ * \param ext_type place to store the extension type
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_x509_ext_type(const mbedtls_asn1_buf* oid, int* ext_type);
+
+/**
+ * \brief          Translate an X.509 attribute type OID into the short name
+ *                 (e.g. the OID for an X520 Common Name into "CN")
+ *
+ * \param oid      OID to use
+ * \param short_name    place to store the string pointer
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_attr_short_name(const mbedtls_asn1_buf* oid, const char** short_name);
+
+/**
+ * \brief          Translate PublicKeyAlgorithm OID into pk_type
+ *
+ * \param oid      OID to use
+ * \param pk_alg   place to store public key algorithm
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_pk_alg(const mbedtls_asn1_buf* oid, mbedtls_pk_type_t* pk_alg);
+
+/**
+ * \brief          Translate pk_type into PublicKeyAlgorithm OID
+ *
+ * \param pk_alg   Public key type to look for
+ * \param oid      place to store ASN.1 OID string pointer
+ * \param olen     length of the OID
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_oid_by_pk_alg(mbedtls_pk_type_t pk_alg, const char** oid, size_t* olen);
+
+#if defined(MBEDTLS_ECP_C)
+/**
+ * \brief          Translate NamedCurve OID into an EC group identifier
+ *
+ * \param oid      OID to use
+ * \param grp_id   place to store group id
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_ec_grp(const mbedtls_asn1_buf* oid, mbedtls_ecp_group_id* grp_id);
+
+/**
+ * \brief          Translate EC group identifier into NamedCurve OID
+ *
+ * \param grp_id   EC group identifier
+ * \param oid      place to store ASN.1 OID string pointer
+ * \param olen     length of the OID
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_oid_by_ec_grp(mbedtls_ecp_group_id grp_id, const char** oid, size_t* olen);
+#endif /* MBEDTLS_ECP_C */
+
+#if defined(MBEDTLS_MD_C)
+/**
+ * \brief          Translate SignatureAlgorithm OID into md_type and pk_type
+ *
+ * \param oid      OID to use
+ * \param md_alg   place to store message digest algorithm
+ * \param pk_alg   place to store public key algorithm
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_sig_alg(const mbedtls_asn1_buf* oid, mbedtls_md_type_t* md_alg,
+    mbedtls_pk_type_t* pk_alg);
+
+/**
+ * \brief          Translate SignatureAlgorithm OID into description
+ *
+ * \param oid      OID to use
+ * \param desc     place to store string pointer
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_sig_alg_desc(const mbedtls_asn1_buf* oid, const char** desc);
+
+/**
+ * \brief          Translate md_type and pk_type into SignatureAlgorithm OID
+ *
+ * \param md_alg   message digest algorithm
+ * \param pk_alg   public key algorithm
+ * \param oid      place to store ASN.1 OID string pointer
+ * \param olen     length of the OID
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_oid_by_sig_alg(mbedtls_pk_type_t pk_alg, mbedtls_md_type_t md_alg,
+    const char** oid, size_t* olen);
+
+/**
+ * \brief          Translate hash algorithm OID into md_type
+ *
+ * \param oid      OID to use
+ * \param md_alg   place to store message digest algorithm
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_md_alg(const mbedtls_asn1_buf* oid, mbedtls_md_type_t* md_alg);
+
+/**
+ * \brief          Translate hmac algorithm OID into md_type
+ *
+ * \param oid      OID to use
+ * \param md_hmac  place to store message hmac algorithm
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_md_hmac(const mbedtls_asn1_buf* oid, mbedtls_md_type_t* md_hmac);
+#endif /* MBEDTLS_MD_C */
+
+#if !defined(MBEDTLS_X509_REMOVE_INFO)
+/**
+ * \brief          Translate Extended Key Usage OID into description
+ *
+ * \param oid      OID to use
+ * \param desc     place to store string pointer
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_extended_key_usage(const mbedtls_asn1_buf* oid, const char** desc);
+#endif
+
+/**
+ * \brief          Translate certificate policies OID into description
+ *
+ * \param oid      OID to use
+ * \param desc     place to store string pointer
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_certificate_policies(const mbedtls_asn1_buf* oid, const char** desc);
+
+/**
+ * \brief          Translate md_type into hash algorithm OID
+ *
+ * \param md_alg   message digest algorithm
+ * \param oid      place to store ASN.1 OID string pointer
+ * \param olen     length of the OID
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_oid_by_md(mbedtls_md_type_t md_alg, const char** oid, size_t* olen);
+
+#if defined(MBEDTLS_CIPHER_C)
+/**
+ * \brief          Translate encryption algorithm OID into cipher_type
+ *
+ * \param oid           OID to use
+ * \param cipher_alg    place to store cipher algorithm
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_cipher_alg(const mbedtls_asn1_buf* oid, mbedtls_cipher_type_t* cipher_alg);
+#endif /* MBEDTLS_CIPHER_C */
+
+#if defined(MBEDTLS_PKCS12_C)
+/**
+ * \brief          Translate PKCS#12 PBE algorithm OID into md_type and
+ *                 cipher_type
+ *
+ * \param oid           OID to use
+ * \param md_alg        place to store message digest algorithm
+ * \param cipher_alg    place to store cipher algorithm
+ *
+ * \return         0 if successful, or MBEDTLS_ERR_OID_NOT_FOUND
+ */
+int mbedtls_oid_get_pkcs12_pbe_alg(const mbedtls_asn1_buf* oid, mbedtls_md_type_t* md_alg,
+    mbedtls_cipher_type_t* cipher_alg);
+#endif /* MBEDTLS_PKCS12_C */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* oid.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/pem.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/pem.h
new file mode 100644
index 0000000000..d9aeb5a895
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/pem.h
@@ -0,0 +1,144 @@
+/**
+ * \file pem.h
+ *
+ * \brief Privacy Enhanced Mail (PEM) decoding
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_PEM_H
+#define MBEDTLS_PEM_H
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/private_access.h"
+
+/**
+ * \name PEM Error codes
+ * These error codes are returned in case of errors reading the
+ * PEM data.
+ * \{
+ */
+/** No PEM header or footer found. */
+#define MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT -0x1080
+/** PEM string is not as expected. */
+#define MBEDTLS_ERR_PEM_INVALID_DATA -0x1100
+/** Failed to allocate memory. */
+#define MBEDTLS_ERR_PEM_ALLOC_FAILED -0x1180
+/** RSA IV is not in hex-format. */
+#define MBEDTLS_ERR_PEM_INVALID_ENC_IV -0x1200
+/** Unsupported key encryption algorithm. */
+#define MBEDTLS_ERR_PEM_UNKNOWN_ENC_ALG -0x1280
+/** Private key password can't be empty. */
+#define MBEDTLS_ERR_PEM_PASSWORD_REQUIRED -0x1300
+/** Given private key password does not allow for correct decryption. */
+#define MBEDTLS_ERR_PEM_PASSWORD_MISMATCH -0x1380
+/** Unavailable feature, e.g. hashing/encryption combination. */
+#define MBEDTLS_ERR_PEM_FEATURE_UNAVAILABLE -0x1400
+/** Bad input parameters to function. */
+#define MBEDTLS_ERR_PEM_BAD_INPUT_DATA -0x1480
+/* \} name */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if defined(MBEDTLS_PEM_PARSE_C)
+/**
+ * \brief       PEM context structure
+ */
+typedef struct mbedtls_pem_context {
+    unsigned char* MBEDTLS_PRIVATE(buf);  /*!< buffer for decoded data             */
+    size_t MBEDTLS_PRIVATE(buflen);       /*!< length of the buffer                */
+    unsigned char* MBEDTLS_PRIVATE(info); /*!< buffer for extra header information */
+} mbedtls_pem_context;
+
+/**
+ * \brief       PEM context setup
+ *
+ * \param ctx   context to be initialized
+ */
+void mbedtls_pem_init(mbedtls_pem_context* ctx);
+
+/**
+ * \brief       Read a buffer for PEM information and store the resulting
+ *              data into the specified context buffers.
+ *
+ * \param ctx       context to use
+ * \param header    header string to seek and expect
+ * \param footer    footer string to seek and expect
+ * \param data      source data to look in (must be nul-terminated)
+ * \param pwd       password for decryption (can be NULL)
+ * \param pwdlen    length of password
+ * \param use_len   destination for total length used (set after header is
+ *                  correctly read, so unless you get
+ *                  MBEDTLS_ERR_PEM_BAD_INPUT_DATA or
+ *                  MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT, use_len is
+ *                  the length to skip)
+ *
+ * \note            Attempts to check password correctness by verifying if
+ *                  the decrypted text starts with an ASN.1 sequence of
+ *                  appropriate length
+ *
+ * \return          0 on success, or a specific PEM error code
+ */
+int mbedtls_pem_read_buffer(mbedtls_pem_context* ctx, const char* header, const char* footer,
+    const unsigned char* data, const unsigned char* pwd, size_t pwdlen, size_t* use_len);
+
+/**
+ * \brief       PEM context memory freeing
+ *
+ * \param ctx   context to be freed
+ */
+void mbedtls_pem_free(mbedtls_pem_context* ctx);
+#endif /* MBEDTLS_PEM_PARSE_C */
+
+#if defined(MBEDTLS_PEM_WRITE_C)
+/**
+ * \brief           Write a buffer of PEM information from a DER encoded
+ *                  buffer.
+ *
+ * \param header    The header string to write.
+ * \param footer    The footer string to write.
+ * \param der_data  The DER data to encode.
+ * \param der_len   The length of the DER data \p der_data in Bytes.
+ * \param buf       The buffer to write to.
+ * \param buf_len   The length of the output buffer \p buf in Bytes.
+ * \param olen      The address at which to store the total length written
+ *                  or required (if \p buf_len is not enough).
+ *
+ * \note            You may pass \c NULL for \p buf and \c 0 for \p buf_len
+ *                  to request the length of the resulting PEM buffer in
+ *                  `*olen`.
+ *
+ * \note            This function may be called with overlapping \p der_data
+ *                  and \p buf buffers.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL if \p buf isn't large
+ *                  enough to hold the PEM buffer. In  this case, `*olen` holds
+ *                  the required minimum size of \p buf.
+ * \return          Another PEM or BASE64 error code on other kinds of failure.
+ */
+int mbedtls_pem_write_buffer(const char* header, const char* footer, const unsigned char* der_data,
+    size_t der_len, unsigned char* buf, size_t buf_len, size_t* olen);
+#endif /* MBEDTLS_PEM_WRITE_C */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* pem.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/pk.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/pk.h
new file mode 100644
index 0000000000..ad2981bcf7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/pk.h
@@ -0,0 +1,876 @@
+/**
+ * \file pk.h
+ *
+ * \brief Public Key abstraction layer
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_PK_H
+#define MBEDTLS_PK_H
+#include "mbedtls/build_info.h"
+#include "mbedtls/md.h"
+#include "mbedtls/private_access.h"
+
+#if defined(MBEDTLS_RSA_C)
+#include "mbedtls/rsa.h"
+#endif
+
+#if defined(MBEDTLS_ECP_C)
+#include "mbedtls/ecp.h"
+#endif
+
+#if defined(MBEDTLS_ECDSA_C)
+#include "mbedtls/ecdsa.h"
+#endif
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+#include "psa/crypto.h"
+#endif
+
+#if (defined(__ARMCC_VERSION) || defined(_MSC_VER)) && !defined(inline) && !defined(__cplusplus)
+#define inline __inline
+#endif
+
+/** Memory allocation failed. */
+#define MBEDTLS_ERR_PK_ALLOC_FAILED -0x3F80
+/** Type mismatch, eg attempt to encrypt with an ECDSA key */
+#define MBEDTLS_ERR_PK_TYPE_MISMATCH -0x3F00
+/** Bad input parameters to function. */
+#define MBEDTLS_ERR_PK_BAD_INPUT_DATA -0x3E80
+/** Read/write of file failed. */
+#define MBEDTLS_ERR_PK_FILE_IO_ERROR -0x3E00
+/** Unsupported key version */
+#define MBEDTLS_ERR_PK_KEY_INVALID_VERSION -0x3D80
+/** Invalid key tag or value. */
+#define MBEDTLS_ERR_PK_KEY_INVALID_FORMAT -0x3D00
+/** Key algorithm is unsupported (only RSA and EC are supported). */
+#define MBEDTLS_ERR_PK_UNKNOWN_PK_ALG -0x3C80
+/** Private key password can't be empty. */
+#define MBEDTLS_ERR_PK_PASSWORD_REQUIRED -0x3C00
+/** Given private key password does not allow for correct decryption. */
+#define MBEDTLS_ERR_PK_PASSWORD_MISMATCH -0x3B80
+/** The pubkey tag or value is invalid (only RSA and EC are supported). */
+#define MBEDTLS_ERR_PK_INVALID_PUBKEY -0x3B00
+/** The algorithm tag or value is invalid. */
+#define MBEDTLS_ERR_PK_INVALID_ALG -0x3A80
+/** Elliptic curve is unsupported (only NIST curves are supported). */
+#define MBEDTLS_ERR_PK_UNKNOWN_NAMED_CURVE -0x3A00
+/** Unavailable feature, e.g. RSA disabled for RSA key. */
+#define MBEDTLS_ERR_PK_FEATURE_UNAVAILABLE -0x3980
+/** The buffer contains a valid signature followed by more data. */
+#define MBEDTLS_ERR_PK_SIG_LEN_MISMATCH -0x3900
+/** The output buffer is too small. */
+#define MBEDTLS_ERR_PK_BUFFER_TOO_SMALL -0x3880
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \brief          Public key types
+ */
+typedef enum {
+    MBEDTLS_PK_NONE = 0,
+    MBEDTLS_PK_RSA,
+    MBEDTLS_PK_ECKEY,
+    MBEDTLS_PK_ECKEY_DH,
+    MBEDTLS_PK_ECDSA,
+    MBEDTLS_PK_RSA_ALT,
+    MBEDTLS_PK_RSASSA_PSS,
+    MBEDTLS_PK_OPAQUE,
+} mbedtls_pk_type_t;
+
+/**
+ * \brief           Options for RSASSA-PSS signature verification.
+ *                  See \c mbedtls_rsa_rsassa_pss_verify_ext()
+ */
+typedef struct mbedtls_pk_rsassa_pss_options {
+    mbedtls_md_type_t MBEDTLS_PRIVATE(mgf1_hash_id);
+    int MBEDTLS_PRIVATE(expected_salt_len);
+
+} mbedtls_pk_rsassa_pss_options;
+
+/**
+ * \brief           Maximum size of a signature made by mbedtls_pk_sign().
+ */
+/* We need to set MBEDTLS_PK_SIGNATURE_MAX_SIZE to the maximum signature
+ * size among the supported signature types. Do it by starting at 0,
+ * then incrementally increasing to be large enough for each supported
+ * signature mechanism.
+ *
+ * The resulting value can be 0, for example if MBEDTLS_ECDH_C is enabled
+ * (which allows the pk module to be included) but neither MBEDTLS_ECDSA_C
+ * nor MBEDTLS_RSA_C nor any opaque signature mechanism (PSA or RSA_ALT).
+ */
+#define MBEDTLS_PK_SIGNATURE_MAX_SIZE 0
+
+#if (defined(MBEDTLS_RSA_C) || defined(MBEDTLS_PK_RSA_ALT_SUPPORT)) &&                             \
+    MBEDTLS_MPI_MAX_SIZE > MBEDTLS_PK_SIGNATURE_MAX_SIZE
+/* For RSA, the signature can be as large as the bignum module allows.
+ * For RSA_ALT, the signature size is not necessarily tied to what the
+ * bignum module can do, but in the absence of any specific setting,
+ * we use that (rsa_alt_sign_wrap in library/pk_wrap.h will check). */
+#undef MBEDTLS_PK_SIGNATURE_MAX_SIZE
+#define MBEDTLS_PK_SIGNATURE_MAX_SIZE MBEDTLS_MPI_MAX_SIZE
+#endif
+
+#if defined(MBEDTLS_ECDSA_C) && MBEDTLS_ECDSA_MAX_LEN > MBEDTLS_PK_SIGNATURE_MAX_SIZE
+/* For ECDSA, the ecdsa module exports a constant for the maximum
+ * signature size. */
+#undef MBEDTLS_PK_SIGNATURE_MAX_SIZE
+#define MBEDTLS_PK_SIGNATURE_MAX_SIZE MBEDTLS_ECDSA_MAX_LEN
+#endif
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+#if PSA_SIGNATURE_MAX_SIZE > MBEDTLS_PK_SIGNATURE_MAX_SIZE
+/* PSA_SIGNATURE_MAX_SIZE is the maximum size of a signature made
+ * through the PSA API in the PSA representation. */
+#undef MBEDTLS_PK_SIGNATURE_MAX_SIZE
+#define MBEDTLS_PK_SIGNATURE_MAX_SIZE PSA_SIGNATURE_MAX_SIZE
+#endif
+
+#if PSA_VENDOR_ECDSA_SIGNATURE_MAX_SIZE + 11 > MBEDTLS_PK_SIGNATURE_MAX_SIZE
+/* The Mbed TLS representation is different for ECDSA signatures:
+ * PSA uses the raw concatenation of r and s,
+ * whereas Mbed TLS uses the ASN.1 representation (SEQUENCE of two INTEGERs).
+ * Add the overhead of ASN.1: up to (1+2) + 2 * (1+2+1) for the
+ * types, lengths (represented by up to 2 bytes), and potential leading
+ * zeros of the INTEGERs and the SEQUENCE. */
+#undef MBEDTLS_PK_SIGNATURE_MAX_SIZE
+#define MBEDTLS_PK_SIGNATURE_MAX_SIZE (PSA_VENDOR_ECDSA_SIGNATURE_MAX_SIZE + 11)
+#endif
+#endif /* defined(MBEDTLS_USE_PSA_CRYPTO) */
+
+/**
+ * \brief           Types for interfacing with the debug module
+ */
+typedef enum {
+    MBEDTLS_PK_DEBUG_NONE = 0,
+    MBEDTLS_PK_DEBUG_MPI,
+    MBEDTLS_PK_DEBUG_ECP,
+} mbedtls_pk_debug_type;
+
+/**
+ * \brief           Item to send to the debug module
+ */
+typedef struct mbedtls_pk_debug_item {
+    mbedtls_pk_debug_type MBEDTLS_PRIVATE(type);
+    const char* MBEDTLS_PRIVATE(name);
+    void* MBEDTLS_PRIVATE(value);
+} mbedtls_pk_debug_item;
+
+/** Maximum number of item send for debugging, plus 1 */
+#define MBEDTLS_PK_DEBUG_MAX_ITEMS 3
+
+/**
+ * \brief           Public key information and operations
+ *
+ * \note        The library does not support custom pk info structures,
+ *              only built-in structures returned by
+ *              mbedtls_cipher_info_from_type().
+ */
+typedef struct mbedtls_pk_info_t mbedtls_pk_info_t;
+
+/**
+ * \brief           Public key container
+ */
+typedef struct mbedtls_pk_context {
+    const mbedtls_pk_info_t* MBEDTLS_PRIVATE(pk_info); /**< Public key information         */
+    void* MBEDTLS_PRIVATE(pk_ctx);                     /**< Underlying public key context  */
+} mbedtls_pk_context;
+
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+/**
+ * \brief           Context for resuming operations
+ */
+typedef struct {
+    const mbedtls_pk_info_t* MBEDTLS_PRIVATE(pk_info); /**< Public key information         */
+    void* MBEDTLS_PRIVATE(rs_ctx);                     /**< Underlying restart context     */
+} mbedtls_pk_restart_ctx;
+#else  /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+/* Now we can declare functions that take a pointer to that */
+typedef void mbedtls_pk_restart_ctx;
+#endif /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+
+#if defined(MBEDTLS_RSA_C)
+/**
+ * Quick access to an RSA context inside a PK context.
+ *
+ * \warning You must make sure the PK context actually holds an RSA context
+ * before using this function!
+ */
+static inline mbedtls_rsa_context* mbedtls_pk_rsa(const mbedtls_pk_context pk) {
+    return ((mbedtls_rsa_context*)(pk).MBEDTLS_PRIVATE(pk_ctx));
+}
+#endif /* MBEDTLS_RSA_C */
+
+#if defined(MBEDTLS_ECP_C)
+/**
+ * Quick access to an EC context inside a PK context.
+ *
+ * \warning You must make sure the PK context actually holds an EC context
+ * before using this function!
+ */
+static inline mbedtls_ecp_keypair* mbedtls_pk_ec(const mbedtls_pk_context pk) {
+    return ((mbedtls_ecp_keypair*)(pk).MBEDTLS_PRIVATE(pk_ctx));
+}
+#endif /* MBEDTLS_ECP_C */
+
+#if defined(MBEDTLS_PK_RSA_ALT_SUPPORT)
+/**
+ * \brief           Types for RSA-alt abstraction
+ */
+typedef int (*mbedtls_pk_rsa_alt_decrypt_func)(void* ctx, size_t* olen, const unsigned char* input,
+    unsigned char* output, size_t output_max_len);
+typedef int (*mbedtls_pk_rsa_alt_sign_func)(void* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, mbedtls_md_type_t md_alg, unsigned int hashlen, const unsigned char* hash,
+    unsigned char* sig);
+typedef size_t (*mbedtls_pk_rsa_alt_key_len_func)(void* ctx);
+#endif /* MBEDTLS_PK_RSA_ALT_SUPPORT */
+
+/**
+ * \brief           Return information associated with the given PK type
+ *
+ * \param pk_type   PK type to search for.
+ *
+ * \return          The PK info associated with the type or NULL if not found.
+ */
+const mbedtls_pk_info_t* mbedtls_pk_info_from_type(mbedtls_pk_type_t pk_type);
+
+/**
+ * \brief           Initialize a #mbedtls_pk_context (as NONE).
+ *
+ * \param ctx       The context to initialize.
+ *                  This must not be \c NULL.
+ */
+void mbedtls_pk_init(mbedtls_pk_context* ctx);
+
+/**
+ * \brief           Free the components of a #mbedtls_pk_context.
+ *
+ * \param ctx       The context to clear. It must have been initialized.
+ *                  If this is \c NULL, this function does nothing.
+ *
+ * \note            For contexts that have been set up with
+ *                  mbedtls_pk_setup_opaque(), this does not free the underlying
+ *                  PSA key and you still need to call psa_destroy_key()
+ *                  independently if you want to destroy that key.
+ */
+void mbedtls_pk_free(mbedtls_pk_context* ctx);
+
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+/**
+ * \brief           Initialize a restart context
+ *
+ * \param ctx       The context to initialize.
+ *                  This must not be \c NULL.
+ */
+void mbedtls_pk_restart_init(mbedtls_pk_restart_ctx* ctx);
+
+/**
+ * \brief           Free the components of a restart context
+ *
+ * \param ctx       The context to clear. It must have been initialized.
+ *                  If this is \c NULL, this function does nothing.
+ */
+void mbedtls_pk_restart_free(mbedtls_pk_restart_ctx* ctx);
+#endif /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+
+/**
+ * \brief           Initialize a PK context with the information given
+ *                  and allocates the type-specific PK subcontext.
+ *
+ * \param ctx       Context to initialize. It must not have been set
+ *                  up yet (type #MBEDTLS_PK_NONE).
+ * \param info      Information to use
+ *
+ * \return          0 on success,
+ *                  MBEDTLS_ERR_PK_BAD_INPUT_DATA on invalid input,
+ *                  MBEDTLS_ERR_PK_ALLOC_FAILED on allocation failure.
+ *
+ * \note            For contexts holding an RSA-alt key, use
+ *                  \c mbedtls_pk_setup_rsa_alt() instead.
+ */
+int mbedtls_pk_setup(mbedtls_pk_context* ctx, const mbedtls_pk_info_t* info);
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+/**
+ * \brief           Initialize a PK context to wrap a PSA key.
+ *
+ * \note            This function replaces mbedtls_pk_setup() for contexts
+ *                  that wrap a (possibly opaque) PSA key instead of
+ *                  storing and manipulating the key material directly.
+ *
+ * \param ctx       The context to initialize. It must be empty (type NONE).
+ * \param key       The PSA key to wrap, which must hold an ECC key pair
+ *                  (see notes below).
+ *
+ * \note            The wrapped key must remain valid as long as the
+ *                  wrapping PK context is in use, that is at least between
+ *                  the point this function is called and the point
+ *                  mbedtls_pk_free() is called on this context. The wrapped
+ *                  key might then be independently used or destroyed.
+ *
+ * \note            This function is currently only available for ECC key
+ *                  pairs (that is, ECC keys containing private key material).
+ *                  Support for other key types may be added later.
+ *
+ * \return          \c 0 on success.
+ * \return          #MBEDTLS_ERR_PK_BAD_INPUT_DATA on invalid input
+ *                  (context already used, invalid key identifier).
+ * \return          #MBEDTLS_ERR_PK_FEATURE_UNAVAILABLE if the key is not an
+ *                  ECC key pair.
+ * \return          #MBEDTLS_ERR_PK_ALLOC_FAILED on allocation failure.
+ */
+int mbedtls_pk_setup_opaque(mbedtls_pk_context* ctx, const psa_key_id_t key);
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#if defined(MBEDTLS_PK_RSA_ALT_SUPPORT)
+/**
+ * \brief           Initialize an RSA-alt context
+ *
+ * \param ctx       Context to initialize. It must not have been set
+ *                  up yet (type #MBEDTLS_PK_NONE).
+ * \param key       RSA key pointer
+ * \param decrypt_func  Decryption function
+ * \param sign_func     Signing function
+ * \param key_len_func  Function returning key length in bytes
+ *
+ * \return          0 on success, or MBEDTLS_ERR_PK_BAD_INPUT_DATA if the
+ *                  context wasn't already initialized as RSA_ALT.
+ *
+ * \note            This function replaces \c mbedtls_pk_setup() for RSA-alt.
+ */
+int mbedtls_pk_setup_rsa_alt(mbedtls_pk_context* ctx, void* key,
+    mbedtls_pk_rsa_alt_decrypt_func decrypt_func, mbedtls_pk_rsa_alt_sign_func sign_func,
+    mbedtls_pk_rsa_alt_key_len_func key_len_func);
+#endif /* MBEDTLS_PK_RSA_ALT_SUPPORT */
+
+/**
+ * \brief           Get the size in bits of the underlying key
+ *
+ * \param ctx       The context to query. It must have been initialized.
+ *
+ * \return          Key size in bits, or 0 on error
+ */
+size_t mbedtls_pk_get_bitlen(const mbedtls_pk_context* ctx);
+
+///**
+// * \brief           Get the length in bytes of the underlying key
+// *
+// * \param ctx       The context to query. It must have been initialized.
+// *
+// * \return          Key length in bytes, or 0 on error
+// */
+// static inline size_t mbedtls_pk_get_len( const mbedtls_pk_context *ctx )
+//{
+//    return( ( mbedtls_pk_get_bitlen( ctx ) + 7 ) / 8 );
+//}
+
+/**
+ * \brief           Tell if a context can do the operation given by type
+ *
+ * \param ctx       The context to query. It must have been initialized.
+ * \param type      The desired type.
+ *
+ * \return          1 if the context can do operations on the given type.
+ * \return          0 if the context cannot do the operations on the given
+ *                  type. This is always the case for a context that has
+ *                  been initialized but not set up, or that has been
+ *                  cleared with mbedtls_pk_free().
+ */
+int mbedtls_pk_can_do(const mbedtls_pk_context* ctx, mbedtls_pk_type_t type);
+
+/**
+ * \brief           Verify signature (including padding if relevant).
+ *
+ * \param ctx       The PK context to use. It must have been set up.
+ * \param md_alg    Hash algorithm used.
+ *                  This can be #MBEDTLS_MD_NONE if the signature algorithm
+ *                  does not rely on a hash algorithm (non-deterministic
+ *                  ECDSA, RSA PKCS#1 v1.5).
+ *                  For PKCS#1 v1.5, if \p md_alg is #MBEDTLS_MD_NONE, then
+ *                  \p hash is the DigestInfo structure used by RFC 8017
+ *                  &sect;9.2 steps 3&ndash;6. If \p md_alg is a valid hash
+ *                  algorithm then \p hash is the digest itself, and this
+ *                  function calculates the DigestInfo encoding internally.
+ * \param hash      Hash of the message to sign
+ * \param hash_len  Hash length
+ * \param sig       Signature to verify
+ * \param sig_len   Signature length
+ *
+ * \return          0 on success (signature is valid),
+ *                  #MBEDTLS_ERR_PK_SIG_LEN_MISMATCH if there is a valid
+ *                  signature in sig but its length is less than \p siglen,
+ *                  or a specific error code.
+ *
+ * \note            For RSA keys, the default padding type is PKCS#1 v1.5.
+ *                  Use \c mbedtls_pk_verify_ext( MBEDTLS_PK_RSASSA_PSS, ... )
+ *                  to verify RSASSA_PSS signatures.
+ */
+int mbedtls_pk_verify(mbedtls_pk_context* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len);
+
+/**
+ * \brief           Restartable version of \c mbedtls_pk_verify()
+ *
+ * \note            Performs the same job as \c mbedtls_pk_verify(), but can
+ *                  return early and restart according to the limit set with
+ *                  \c mbedtls_ecp_set_max_ops() to reduce blocking for ECC
+ *                  operations. For RSA, same as \c mbedtls_pk_verify().
+ *
+ * \param ctx       The PK context to use. It must have been set up.
+ * \param md_alg    Hash algorithm used (see notes)
+ * \param hash      Hash of the message to sign
+ * \param hash_len  Hash length or 0 (see notes)
+ * \param sig       Signature to verify
+ * \param sig_len   Signature length
+ * \param rs_ctx    Restart context (NULL to disable restart)
+ *
+ * \return          See \c mbedtls_pk_verify(), or
+ * \return          #MBEDTLS_ERR_ECP_IN_PROGRESS if maximum number of
+ *                  operations was reached: see \c mbedtls_ecp_set_max_ops().
+ */
+int mbedtls_pk_verify_restartable(mbedtls_pk_context* ctx, mbedtls_md_type_t md_alg,
+    const unsigned char* hash, size_t hash_len, const unsigned char* sig, size_t sig_len,
+    mbedtls_pk_restart_ctx* rs_ctx);
+
+/**
+ * \brief           Verify signature, with options.
+ *                  (Includes verification of the padding depending on type.)
+ *
+ * \param type      Signature type (inc. possible padding type) to verify
+ * \param options   Pointer to type-specific options, or NULL
+ * \param ctx       The PK context to use. It must have been set up.
+ * \param md_alg    Hash algorithm used (see notes)
+ * \param hash      Hash of the message to sign
+ * \param hash_len  Hash length or 0 (see notes)
+ * \param sig       Signature to verify
+ * \param sig_len   Signature length
+ *
+ * \return          0 on success (signature is valid),
+ *                  #MBEDTLS_ERR_PK_TYPE_MISMATCH if the PK context can't be
+ *                  used for this type of signatures,
+ *                  #MBEDTLS_ERR_PK_SIG_LEN_MISMATCH if there is a valid
+ *                  signature in sig but its length is less than \p siglen,
+ *                  or a specific error code.
+ *
+ * \note            If hash_len is 0, then the length associated with md_alg
+ *                  is used instead, or an error returned if it is invalid.
+ *
+ * \note            md_alg may be MBEDTLS_MD_NONE, only if hash_len != 0
+ *
+ * \note            If type is MBEDTLS_PK_RSASSA_PSS, then options must point
+ *                  to a mbedtls_pk_rsassa_pss_options structure,
+ *                  otherwise it must be NULL.
+ */
+int mbedtls_pk_verify_ext(mbedtls_pk_type_t type, const void* options, mbedtls_pk_context* ctx,
+    mbedtls_md_type_t md_alg, const unsigned char* hash, size_t hash_len, const unsigned char* sig,
+    size_t sig_len);
+
+/**
+ * \brief           Make signature, including padding if relevant.
+ *
+ * \param ctx       The PK context to use. It must have been set up
+ *                  with a private key.
+ * \param md_alg    Hash algorithm used (see notes)
+ * \param hash      Hash of the message to sign
+ * \param hash_len  Hash length
+ * \param sig       Place to write the signature.
+ *                  It must have enough room for the signature.
+ *                  #MBEDTLS_PK_SIGNATURE_MAX_SIZE is always enough.
+ *                  You may use a smaller buffer if it is large enough
+ *                  given the key type.
+ * \param sig_size  The size of the \p sig buffer in bytes.
+ * \param sig_len   On successful return,
+ *                  the number of bytes written to \p sig.
+ * \param f_rng     RNG function, must not be \c NULL.
+ * \param p_rng     RNG parameter
+ *
+ * \return          0 on success, or a specific error code.
+ *
+ * \note            For RSA keys, the default padding type is PKCS#1 v1.5.
+ *                  There is no interface in the PK module to make RSASSA-PSS
+ *                  signatures yet.
+ *
+ * \note            For RSA, md_alg may be MBEDTLS_MD_NONE if hash_len != 0.
+ *                  For ECDSA, md_alg may never be MBEDTLS_MD_NONE.
+ */
+int mbedtls_pk_sign(mbedtls_pk_context* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+/**
+ * \brief           Restartable version of \c mbedtls_pk_sign()
+ *
+ * \note            Performs the same job as \c mbedtls_pk_sign(), but can
+ *                  return early and restart according to the limit set with
+ *                  \c mbedtls_ecp_set_max_ops() to reduce blocking for ECC
+ *                  operations. For RSA, same as \c mbedtls_pk_sign().
+ *
+ * \param ctx       The PK context to use. It must have been set up
+ *                  with a private key.
+ * \param md_alg    Hash algorithm used (see notes for mbedtls_pk_sign())
+ * \param hash      Hash of the message to sign
+ * \param hash_len  Hash length
+ * \param sig       Place to write the signature.
+ *                  It must have enough room for the signature.
+ *                  #MBEDTLS_PK_SIGNATURE_MAX_SIZE is always enough.
+ *                  You may use a smaller buffer if it is large enough
+ *                  given the key type.
+ * \param sig_size  The size of the \p sig buffer in bytes.
+ * \param sig_len   On successful return,
+ *                  the number of bytes written to \p sig.
+ * \param f_rng     RNG function, must not be \c NULL.
+ * \param p_rng     RNG parameter
+ * \param rs_ctx    Restart context (NULL to disable restart)
+ *
+ * \return          See \c mbedtls_pk_sign().
+ * \return          #MBEDTLS_ERR_ECP_IN_PROGRESS if maximum number of
+ *                  operations was reached: see \c mbedtls_ecp_set_max_ops().
+ */
+int mbedtls_pk_sign_restartable(mbedtls_pk_context* ctx, mbedtls_md_type_t md_alg,
+    const unsigned char* hash, size_t hash_len, unsigned char* sig, size_t sig_size,
+    size_t* sig_len, int (*f_rng)(void*, unsigned char*, size_t), void* p_rng,
+    mbedtls_pk_restart_ctx* rs_ctx);
+
+/**
+ * \brief           Decrypt message (including padding if relevant).
+ *
+ * \param ctx       The PK context to use. It must have been set up
+ *                  with a private key.
+ * \param input     Input to decrypt
+ * \param ilen      Input size
+ * \param output    Decrypted output
+ * \param olen      Decrypted message length
+ * \param osize     Size of the output buffer
+ * \param f_rng     RNG function, must not be \c NULL.
+ * \param p_rng     RNG parameter
+ *
+ * \note            For RSA keys, the default padding type is PKCS#1 v1.5.
+ *
+ * \return          0 on success, or a specific error code.
+ */
+int mbedtls_pk_decrypt(mbedtls_pk_context* ctx, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen, size_t osize, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng);
+
+/**
+ * \brief           Encrypt message (including padding if relevant).
+ *
+ * \param ctx       The PK context to use. It must have been set up.
+ * \param input     Message to encrypt
+ * \param ilen      Message size
+ * \param output    Encrypted output
+ * \param olen      Encrypted output length
+ * \param osize     Size of the output buffer
+ * \param f_rng     RNG function, must not be \c NULL.
+ * \param p_rng     RNG parameter
+ *
+ * \note            \p f_rng is used for padding generation.
+ *
+ * \note            For RSA keys, the default padding type is PKCS#1 v1.5.
+ *
+ * \return          0 on success, or a specific error code.
+ */
+int mbedtls_pk_encrypt(mbedtls_pk_context* ctx, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen, size_t osize, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng);
+
+/**
+ * \brief           Check if a public-private pair of keys matches.
+ *
+ * \param pub       Context holding a public key.
+ * \param prv       Context holding a private (and public) key.
+ * \param f_rng     RNG function, must not be \c NULL.
+ * \param p_rng     RNG parameter
+ *
+ * \return          \c 0 on success (keys were checked and match each other).
+ * \return          #MBEDTLS_ERR_PK_FEATURE_UNAVAILABLE if the keys could not
+ *                  be checked - in that case they may or may not match.
+ * \return          #MBEDTLS_ERR_PK_BAD_INPUT_DATA if a context is invalid.
+ * \return          Another non-zero value if the keys do not match.
+ */
+int mbedtls_pk_check_pair(const mbedtls_pk_context* pub, const mbedtls_pk_context* prv,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+/**
+ * \brief           Export debug information
+ *
+ * \param ctx       The PK context to use. It must have been initialized.
+ * \param items     Place to write debug items
+ *
+ * \return          0 on success or MBEDTLS_ERR_PK_BAD_INPUT_DATA
+ */
+int mbedtls_pk_debug(const mbedtls_pk_context* ctx, mbedtls_pk_debug_item* items);
+
+/**
+ * \brief           Access the type name
+ *
+ * \param ctx       The PK context to use. It must have been initialized.
+ *
+ * \return          Type name on success, or "invalid PK"
+ */
+const char* mbedtls_pk_get_name(const mbedtls_pk_context* ctx);
+
+/**
+ * \brief           Get the key type
+ *
+ * \param ctx       The PK context to use. It must have been initialized.
+ *
+ * \return          Type on success.
+ * \return          #MBEDTLS_PK_NONE for a context that has not been set up.
+ */
+mbedtls_pk_type_t mbedtls_pk_get_type(const mbedtls_pk_context* ctx);
+
+#if defined(MBEDTLS_PK_PARSE_C)
+/** \ingroup pk_module */
+/**
+ * \brief           Parse a private key in PEM or DER format
+ *
+ * \param ctx       The PK context to fill. It must have been initialized
+ *                  but not set up.
+ * \param key       Input buffer to parse.
+ *                  The buffer must contain the input exactly, with no
+ *                  extra trailing material. For PEM, the buffer must
+ *                  contain a null-terminated string.
+ * \param keylen    Size of \b key in bytes.
+ *                  For PEM data, this includes the terminating null byte,
+ *                  so \p keylen must be equal to `strlen(key) + 1`.
+ * \param pwd       Optional password for decryption.
+ *                  Pass \c NULL if expecting a non-encrypted key.
+ *                  Pass a string of \p pwdlen bytes if expecting an encrypted
+ *                  key; a non-encrypted key will also be accepted.
+ *                  The empty password is not supported.
+ * \param pwdlen    Size of the password in bytes.
+ *                  Ignored if \p pwd is \c NULL.
+ * \param f_rng     RNG function, must not be \c NULL. Used for blinding.
+ * \param p_rng     RNG parameter
+ *
+ * \note            On entry, ctx must be empty, either freshly initialised
+ *                  with mbedtls_pk_init() or reset with mbedtls_pk_free(). If you need a
+ *                  specific key type, check the result with mbedtls_pk_can_do().
+ *
+ * \note            The key is also checked for correctness.
+ *
+ * \return          0 if successful, or a specific PK or PEM error code
+ */
+int mbedtls_pk_parse_key(mbedtls_pk_context* ctx, const unsigned char* key, size_t keylen,
+    const unsigned char* pwd, size_t pwdlen, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng);
+
+/** \ingroup pk_module */
+/**
+ * \brief           Parse a public key in PEM or DER format
+ *
+ * \param ctx       The PK context to fill. It must have been initialized
+ *                  but not set up.
+ * \param key       Input buffer to parse.
+ *                  The buffer must contain the input exactly, with no
+ *                  extra trailing material. For PEM, the buffer must
+ *                  contain a null-terminated string.
+ * \param keylen    Size of \b key in bytes.
+ *                  For PEM data, this includes the terminating null byte,
+ *                  so \p keylen must be equal to `strlen(key) + 1`.
+ *
+ * \note            On entry, ctx must be empty, either freshly initialised
+ *                  with mbedtls_pk_init() or reset with mbedtls_pk_free(). If you need a
+ *                  specific key type, check the result with mbedtls_pk_can_do().
+ *
+ * \note            The key is also checked for correctness.
+ *
+ * \return          0 if successful, or a specific PK or PEM error code
+ */
+int mbedtls_pk_parse_public_key(mbedtls_pk_context* ctx, const unsigned char* key, size_t keylen);
+
+#if defined(MBEDTLS_FS_IO)
+/** \ingroup pk_module */
+/**
+ * \brief           Load and parse a private key
+ *
+ * \param ctx       The PK context to fill. It must have been initialized
+ *                  but not set up.
+ * \param path      filename to read the private key from
+ * \param password  Optional password to decrypt the file.
+ *                  Pass \c NULL if expecting a non-encrypted key.
+ *                  Pass a null-terminated string if expecting an encrypted
+ *                  key; a non-encrypted key will also be accepted.
+ *                  The empty password is not supported.
+ * \param f_rng     RNG function, must not be \c NULL. Used for blinding.
+ * \param p_rng     RNG parameter
+ *
+ * \note            On entry, ctx must be empty, either freshly initialised
+ *                  with mbedtls_pk_init() or reset with mbedtls_pk_free(). If you need a
+ *                  specific key type, check the result with mbedtls_pk_can_do().
+ *
+ * \note            The key is also checked for correctness.
+ *
+ * \return          0 if successful, or a specific PK or PEM error code
+ */
+int mbedtls_pk_parse_keyfile(mbedtls_pk_context* ctx, const char* path, const char* password,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+/** \ingroup pk_module */
+/**
+ * \brief           Load and parse a public key
+ *
+ * \param ctx       The PK context to fill. It must have been initialized
+ *                  but not set up.
+ * \param path      filename to read the public key from
+ *
+ * \note            On entry, ctx must be empty, either freshly initialised
+ *                  with mbedtls_pk_init() or reset with mbedtls_pk_free(). If
+ *                  you need a specific key type, check the result with
+ *                  mbedtls_pk_can_do().
+ *
+ * \note            The key is also checked for correctness.
+ *
+ * \return          0 if successful, or a specific PK or PEM error code
+ */
+int mbedtls_pk_parse_public_keyfile(mbedtls_pk_context* ctx, const char* path);
+#endif /* MBEDTLS_FS_IO */
+#endif /* MBEDTLS_PK_PARSE_C */
+
+#if defined(MBEDTLS_PK_WRITE_C)
+/**
+ * \brief           Write a private key to a PKCS#1 or SEC1 DER structure
+ *                  Note: data is written at the end of the buffer! Use the
+ *                        return value to determine where you should start
+ *                        using the buffer
+ *
+ * \param ctx       PK context which must contain a valid private key.
+ * \param buf       buffer to write to
+ * \param size      size of the buffer
+ *
+ * \return          length of data written if successful, or a specific
+ *                  error code
+ */
+int mbedtls_pk_write_key_der(const mbedtls_pk_context* ctx, unsigned char* buf, size_t size);
+
+/**
+ * \brief           Write a public key to a SubjectPublicKeyInfo DER structure
+ *                  Note: data is written at the end of the buffer! Use the
+ *                        return value to determine where you should start
+ *                        using the buffer
+ *
+ * \param ctx       PK context which must contain a valid public or private key.
+ * \param buf       buffer to write to
+ * \param size      size of the buffer
+ *
+ * \return          length of data written if successful, or a specific
+ *                  error code
+ */
+int mbedtls_pk_write_pubkey_der(const mbedtls_pk_context* ctx, unsigned char* buf, size_t size);
+
+#if defined(MBEDTLS_PEM_WRITE_C)
+/**
+ * \brief           Write a public key to a PEM string
+ *
+ * \param ctx       PK context which must contain a valid public or private key.
+ * \param buf       Buffer to write to. The output includes a
+ *                  terminating null byte.
+ * \param size      Size of the buffer in bytes.
+ *
+ * \return          0 if successful, or a specific error code
+ */
+int mbedtls_pk_write_pubkey_pem(const mbedtls_pk_context* ctx, unsigned char* buf, size_t size);
+
+/**
+ * \brief           Write a private key to a PKCS#1 or SEC1 PEM string
+ *
+ * \param ctx       PK context which must contain a valid private key.
+ * \param buf       Buffer to write to. The output includes a
+ *                  terminating null byte.
+ * \param size      Size of the buffer in bytes.
+ *
+ * \return          0 if successful, or a specific error code
+ */
+int mbedtls_pk_write_key_pem(const mbedtls_pk_context* ctx, unsigned char* buf, size_t size);
+#endif /* MBEDTLS_PEM_WRITE_C */
+#endif /* MBEDTLS_PK_WRITE_C */
+
+/*
+ * WARNING: Low-level functions. You probably do not want to use these unless
+ *          you are certain you do ;)
+ */
+
+#if defined(MBEDTLS_PK_PARSE_C)
+/**
+ * \brief           Parse a SubjectPublicKeyInfo DER structure
+ *
+ * \param p         the position in the ASN.1 data
+ * \param end       end of the buffer
+ * \param pk        The PK context to fill. It must have been initialized
+ *                  but not set up.
+ *
+ * \return          0 if successful, or a specific PK error code
+ */
+int mbedtls_pk_parse_subpubkey(unsigned char** p, const unsigned char* end, mbedtls_pk_context* pk);
+#endif /* MBEDTLS_PK_PARSE_C */
+
+#if defined(MBEDTLS_PK_WRITE_C)
+/**
+ * \brief           Write a subjectPublicKey to ASN.1 data
+ *                  Note: function works backwards in data buffer
+ *
+ * \param p         reference to current position pointer
+ * \param start     start of the buffer (for bounds-checking)
+ * \param key       PK context which must contain a valid public or private key.
+ *
+ * \return          the length written or a negative error code
+ */
+int mbedtls_pk_write_pubkey(unsigned char** p, unsigned char* start, const mbedtls_pk_context* key);
+#endif /* MBEDTLS_PK_WRITE_C */
+
+/*
+ * Internal module functions. You probably do not want to use these unless you
+ * know you do.
+ */
+#if defined(MBEDTLS_FS_IO)
+int mbedtls_pk_load_file(const char* path, unsigned char** buf, size_t* n);
+#endif
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+/**
+ * \brief           Turn an EC key into an opaque one.
+ *
+ * \warning         This is a temporary utility function for tests. It might
+ *                  change or be removed at any time without notice.
+ *
+ * \note            Only ECDSA keys are supported so far. Signing with the
+ *                  specified hash is the only allowed use of that key.
+ *
+ * \param pk        Input: the EC key to import to a PSA key.
+ *                  Output: a PK context wrapping that PSA key.
+ * \param key       Output: a PSA key identifier.
+ *                  It's the caller's responsibility to call
+ *                  psa_destroy_key() on that key identifier after calling
+ *                  mbedtls_pk_free() on the PK context.
+ * \param hash_alg  The hash algorithm to allow for use with that key.
+ *
+ * \return          \c 0 if successful.
+ * \return          An Mbed TLS error code otherwise.
+ */
+int mbedtls_pk_wrap_as_opaque(mbedtls_pk_context* pk, psa_key_id_t* key, psa_algorithm_t hash_alg);
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* MBEDTLS_PK_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/platform.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/platform.h
new file mode 100644
index 0000000000..3f4a5650b5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/platform.h
@@ -0,0 +1,403 @@
+/**
+ * \file platform.h
+ *
+ * \brief This file contains the definitions and functions of the
+ *        Mbed TLS platform abstraction layer.
+ *
+ *        The platform abstraction layer removes the need for the library
+ *        to directly link to standard C library functions or operating
+ *        system services, making the library easier to port and embed.
+ *        Application developers and users of the library can provide their own
+ *        implementations of these functions, or implementations specific to
+ *        their platform, which can be statically linked to the library or
+ *        dynamically configured at runtime.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_PLATFORM_H
+#define MBEDTLS_PLATFORM_H
+#include "mbedtls/build_info.h"
+#include "mbedtls/private_access.h"
+
+#if defined(MBEDTLS_HAVE_TIME)
+#include "mbedtls/platform_time.h"
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \name SECTION: Module settings
+ *
+ * The configuration options you can set for this module are in this section.
+ * Either change them in mbedtls_config.h or define them on the compiler command line.
+ * \{
+ */
+
+/* The older Microsoft Windows common runtime provides non-conforming
+ * implementations of some standard library functions, including snprintf
+ * and vsnprintf. This affects MSVC and MinGW builds.
+ */
+#if defined(__MINGW32__) || (defined(_MSC_VER) && _MSC_VER <= 1900)
+#define MBEDTLS_PLATFORM_HAS_NON_CONFORMING_SNPRINTF
+#define MBEDTLS_PLATFORM_HAS_NON_CONFORMING_VSNPRINTF
+#endif
+
+#if !defined(MBEDTLS_PLATFORM_NO_STD_FUNCTIONS)
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#if !defined(MBEDTLS_PLATFORM_STD_SNPRINTF)
+#if defined(MBEDTLS_PLATFORM_HAS_NON_CONFORMING_SNPRINTF)
+#define MBEDTLS_PLATFORM_STD_SNPRINTF                                                              \
+    mbedtls_platform_win32_snprintf /**< The default \c snprintf function to use.  */
+#else
+#define MBEDTLS_PLATFORM_STD_SNPRINTF snprintf /**< The default \c snprintf function to use.  */
+#endif
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_VSNPRINTF)
+#if defined(MBEDTLS_PLATFORM_HAS_NON_CONFORMING_VSNPRINTF)
+#define MBEDTLS_PLATFORM_STD_VSNPRINTF                                                             \
+    mbedtls_platform_win32_vsnprintf /**< The default \c vsnprintf function to use.  */
+#else
+#define MBEDTLS_PLATFORM_STD_VSNPRINTF vsnprintf /**< The default \c vsnprintf function to use. */
+#endif
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_PRINTF)
+#define MBEDTLS_PLATFORM_STD_PRINTF printf /**< The default \c printf function to use. */
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_FPRINTF)
+#define MBEDTLS_PLATFORM_STD_FPRINTF fprintf /**< The default \c fprintf function to use. */
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_CALLOC)
+#define MBEDTLS_PLATFORM_STD_CALLOC calloc /**< The default \c calloc function to use. */
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_FREE)
+#define MBEDTLS_PLATFORM_STD_FREE free /**< The default \c free function to use. */
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_EXIT)
+#define MBEDTLS_PLATFORM_STD_EXIT exit /**< The default \c exit function to use. */
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_TIME)
+#define MBEDTLS_PLATFORM_STD_TIME time /**< The default \c time function to use. */
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_EXIT_SUCCESS)
+#define MBEDTLS_PLATFORM_STD_EXIT_SUCCESS EXIT_SUCCESS /**< The default exit value to use. */
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_EXIT_FAILURE)
+#define MBEDTLS_PLATFORM_STD_EXIT_FAILURE EXIT_FAILURE /**< The default exit value to use. */
+#endif
+#if defined(MBEDTLS_FS_IO)
+#if !defined(MBEDTLS_PLATFORM_STD_NV_SEED_READ)
+#define MBEDTLS_PLATFORM_STD_NV_SEED_READ mbedtls_platform_std_nv_seed_read
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_NV_SEED_WRITE)
+#define MBEDTLS_PLATFORM_STD_NV_SEED_WRITE mbedtls_platform_std_nv_seed_write
+#endif
+#if !defined(MBEDTLS_PLATFORM_STD_NV_SEED_FILE)
+#define MBEDTLS_PLATFORM_STD_NV_SEED_FILE "seedfile"
+#endif
+#endif /* MBEDTLS_FS_IO */
+#else  /* MBEDTLS_PLATFORM_NO_STD_FUNCTIONS */
+#if defined(MBEDTLS_PLATFORM_STD_MEM_HDR)
+#include MBEDTLS_PLATFORM_STD_MEM_HDR
+#endif
+#endif /* MBEDTLS_PLATFORM_NO_STD_FUNCTIONS */
+
+/* \} name SECTION: Module settings */
+
+/*
+ * The function pointers for calloc and free.
+ */
+#if defined(MBEDTLS_PLATFORM_MEMORY)
+#if defined(MBEDTLS_PLATFORM_FREE_MACRO) && defined(MBEDTLS_PLATFORM_CALLOC_MACRO)
+#define mbedtls_free MBEDTLS_PLATFORM_FREE_MACRO
+#define mbedtls_calloc MBEDTLS_PLATFORM_CALLOC_MACRO
+#else
+/* For size_t */
+#include <stddef.h>
+extern void* mbedtls_calloc(size_t n, size_t size);
+extern void mbedtls_free(void* ptr);
+
+/**
+ * \brief               This function dynamically sets the memory-management
+ *                      functions used by the library, during runtime.
+ *
+ * \param calloc_func   The \c calloc function implementation.
+ * \param free_func     The \c free function implementation.
+ *
+ * \return              \c 0.
+ */
+int mbedtls_platform_set_calloc_free(void* (*calloc_func)(size_t, size_t),
+    void (*free_func)(void*));
+#endif /* MBEDTLS_PLATFORM_FREE_MACRO && MBEDTLS_PLATFORM_CALLOC_MACRO */
+#else  /* !MBEDTLS_PLATFORM_MEMORY */
+#define mbedtls_free free
+#define mbedtls_calloc calloc
+#endif /* MBEDTLS_PLATFORM_MEMORY && !MBEDTLS_PLATFORM_{FREE,CALLOC}_MACRO */
+
+/*
+ * The function pointers for fprintf
+ */
+#if defined(MBEDTLS_PLATFORM_FPRINTF_ALT)
+/* We need FILE * */
+#include <stdio.h>
+extern int (*mbedtls_fprintf)(FILE* stream, const char* format, ...);
+
+/**
+ * \brief                This function dynamically configures the fprintf
+ *                       function that is called when the
+ *                       mbedtls_fprintf() function is invoked by the library.
+ *
+ * \param fprintf_func   The \c fprintf function implementation.
+ *
+ * \return               \c 0.
+ */
+int mbedtls_platform_set_fprintf(int (*fprintf_func)(FILE* stream, const char*, ...));
+#else
+#if defined(MBEDTLS_PLATFORM_FPRINTF_MACRO)
+#define mbedtls_fprintf MBEDTLS_PLATFORM_FPRINTF_MACRO
+#else
+#define mbedtls_fprintf fprintf
+#endif /* MBEDTLS_PLATFORM_FPRINTF_MACRO */
+#endif /* MBEDTLS_PLATFORM_FPRINTF_ALT */
+
+/*
+ * The function pointers for printf
+ */
+#if defined(MBEDTLS_PLATFORM_PRINTF_ALT)
+extern int (*mbedtls_printf)(const char* format, ...);
+
+/**
+ * \brief               This function dynamically configures the snprintf
+ *                      function that is called when the mbedtls_snprintf()
+ *                      function is invoked by the library.
+ *
+ * \param printf_func   The \c printf function implementation.
+ *
+ * \return              \c 0 on success.
+ */
+int mbedtls_platform_set_printf(int (*printf_func)(const char*, ...));
+#else /* !MBEDTLS_PLATFORM_PRINTF_ALT */
+#if defined(MBEDTLS_PLATFORM_PRINTF_MACRO)
+#define mbedtls_printf MBEDTLS_PLATFORM_PRINTF_MACRO
+#else
+#define mbedtls_printf printf
+#endif /* MBEDTLS_PLATFORM_PRINTF_MACRO */
+#endif /* MBEDTLS_PLATFORM_PRINTF_ALT */
+
+/*
+ * The function pointers for snprintf
+ *
+ * The snprintf implementation should conform to C99:
+ * - it *must* always correctly zero-terminate the buffer
+ *   (except when n == 0, then it must leave the buffer untouched)
+ * - however it is acceptable to return -1 instead of the required length when
+ *   the destination buffer is too short.
+ */
+#if defined(MBEDTLS_PLATFORM_HAS_NON_CONFORMING_SNPRINTF)
+/* For Windows (inc. MSYS2), we provide our own fixed implementation */
+int mbedtls_platform_win32_snprintf(char* s, size_t n, const char* fmt, ...);
+#endif
+
+#if defined(MBEDTLS_PLATFORM_SNPRINTF_ALT)
+extern int (*mbedtls_snprintf)(char* s, size_t n, const char* format, ...);
+
+/**
+ * \brief                 This function allows configuring a custom
+ *                        \c snprintf function pointer.
+ *
+ * \param snprintf_func   The \c snprintf function implementation.
+ *
+ * \return                \c 0 on success.
+ */
+int mbedtls_platform_set_snprintf(int (*snprintf_func)(char* s, size_t n, const char* format, ...));
+#else /* MBEDTLS_PLATFORM_SNPRINTF_ALT */
+#if defined(MBEDTLS_PLATFORM_SNPRINTF_MACRO)
+#define mbedtls_snprintf MBEDTLS_PLATFORM_SNPRINTF_MACRO
+#else
+#define mbedtls_snprintf MBEDTLS_PLATFORM_STD_SNPRINTF
+#endif /* MBEDTLS_PLATFORM_SNPRINTF_MACRO */
+#endif /* MBEDTLS_PLATFORM_SNPRINTF_ALT */
+
+/*
+ * The function pointers for vsnprintf
+ *
+ * The vsnprintf implementation should conform to C99:
+ * - it *must* always correctly zero-terminate the buffer
+ *   (except when n == 0, then it must leave the buffer untouched)
+ * - however it is acceptable to return -1 instead of the required length when
+ *   the destination buffer is too short.
+ */
+#if defined(MBEDTLS_PLATFORM_HAS_NON_CONFORMING_VSNPRINTF)
+#include <stdarg.h>
+/* For Older Windows (inc. MSYS2), we provide our own fixed implementation */
+int mbedtls_platform_win32_vsnprintf(char* s, size_t n, const char* fmt, va_list arg);
+#endif
+
+#if defined(MBEDTLS_PLATFORM_VSNPRINTF_ALT)
+#include <stdarg.h>
+extern int (*mbedtls_vsnprintf)(char* s, size_t n, const char* format, va_list arg);
+
+/**
+ * \brief   Set your own snprintf function pointer
+ *
+ * \param   vsnprintf_func   The \c vsnprintf function implementation
+ *
+ * \return  \c 0
+ */
+int mbedtls_platform_set_vsnprintf(
+    int (*vsnprintf_func)(char* s, size_t n, const char* format, va_list arg));
+#else /* MBEDTLS_PLATFORM_VSNPRINTF_ALT */
+#if defined(MBEDTLS_PLATFORM_VSNPRINTF_MACRO)
+#define mbedtls_vsnprintf MBEDTLS_PLATFORM_VSNPRINTF_MACRO
+#else
+#define mbedtls_vsnprintf vsnprintf
+#endif /* MBEDTLS_PLATFORM_VSNPRINTF_MACRO */
+#endif /* MBEDTLS_PLATFORM_VSNPRINTF_ALT */
+
+/*
+ * The function pointers for exit
+ */
+#if defined(MBEDTLS_PLATFORM_EXIT_ALT)
+extern void (*mbedtls_exit)(int status);
+
+/**
+ * \brief             This function dynamically configures the exit
+ *                    function that is called when the mbedtls_exit()
+ *                    function is invoked by the library.
+ *
+ * \param exit_func   The \c exit function implementation.
+ *
+ * \return            \c 0 on success.
+ */
+int mbedtls_platform_set_exit(void (*exit_func)(int status));
+#else
+#if defined(MBEDTLS_PLATFORM_EXIT_MACRO)
+#define mbedtls_exit MBEDTLS_PLATFORM_EXIT_MACRO
+#else
+#define mbedtls_exit exit
+#endif /* MBEDTLS_PLATFORM_EXIT_MACRO */
+#endif /* MBEDTLS_PLATFORM_EXIT_ALT */
+
+/*
+ * The default exit values
+ */
+#if defined(MBEDTLS_PLATFORM_STD_EXIT_SUCCESS)
+#define MBEDTLS_EXIT_SUCCESS MBEDTLS_PLATFORM_STD_EXIT_SUCCESS
+#else
+#define MBEDTLS_EXIT_SUCCESS 0
+#endif
+#if defined(MBEDTLS_PLATFORM_STD_EXIT_FAILURE)
+#define MBEDTLS_EXIT_FAILURE MBEDTLS_PLATFORM_STD_EXIT_FAILURE
+#else
+#define MBEDTLS_EXIT_FAILURE 1
+#endif
+
+/*
+ * The function pointers for reading from and writing a seed file to
+ * Non-Volatile storage (NV) in a platform-independent way
+ *
+ * Only enabled when the NV seed entropy source is enabled
+ */
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+#if !defined(MBEDTLS_PLATFORM_NO_STD_FUNCTIONS) && defined(MBEDTLS_FS_IO)
+/* Internal standard platform definitions */
+int mbedtls_platform_std_nv_seed_read(unsigned char* buf, size_t buf_len);
+int mbedtls_platform_std_nv_seed_write(unsigned char* buf, size_t buf_len);
+#endif
+
+#if defined(MBEDTLS_PLATFORM_NV_SEED_ALT)
+extern int (*mbedtls_nv_seed_read)(unsigned char* buf, size_t buf_len);
+extern int (*mbedtls_nv_seed_write)(unsigned char* buf, size_t buf_len);
+
+/**
+ * \brief   This function allows configuring custom seed file writing and
+ *          reading functions.
+ *
+ * \param   nv_seed_read_func   The seed reading function implementation.
+ * \param   nv_seed_write_func  The seed writing function implementation.
+ *
+ * \return  \c 0 on success.
+ */
+int mbedtls_platform_set_nv_seed(int (*nv_seed_read_func)(unsigned char* buf, size_t buf_len),
+    int (*nv_seed_write_func)(unsigned char* buf, size_t buf_len));
+#else
+#if defined(MBEDTLS_PLATFORM_NV_SEED_READ_MACRO) && defined(MBEDTLS_PLATFORM_NV_SEED_WRITE_MACRO)
+#define mbedtls_nv_seed_read MBEDTLS_PLATFORM_NV_SEED_READ_MACRO
+#define mbedtls_nv_seed_write MBEDTLS_PLATFORM_NV_SEED_WRITE_MACRO
+#else
+#define mbedtls_nv_seed_read mbedtls_platform_std_nv_seed_read
+#define mbedtls_nv_seed_write mbedtls_platform_std_nv_seed_write
+#endif
+#endif /* MBEDTLS_PLATFORM_NV_SEED_ALT */
+#endif /* MBEDTLS_ENTROPY_NV_SEED */
+
+#if !defined(MBEDTLS_PLATFORM_SETUP_TEARDOWN_ALT)
+
+/**
+ * \brief   The platform context structure.
+ *
+ * \note    This structure may be used to assist platform-specific
+ *          setup or teardown operations.
+ */
+typedef struct mbedtls_platform_context {
+    char MBEDTLS_PRIVATE(dummy); /**< A placeholder member, as empty structs are not portable. */
+} mbedtls_platform_context;
+
+#else
+#include "platform_alt.h"
+#endif /* !MBEDTLS_PLATFORM_SETUP_TEARDOWN_ALT */
+
+/**
+ * \brief   This function performs any platform-specific initialization
+ *          operations.
+ *
+ * \note    This function should be called before any other library functions.
+ *
+ *          Its implementation is platform-specific, and unless
+ *          platform-specific code is provided, it does nothing.
+ *
+ * \note    The usage and necessity of this function is dependent on the platform.
+ *
+ * \param   ctx     The platform context.
+ *
+ * \return  \c 0 on success.
+ */
+int mbedtls_platform_setup(mbedtls_platform_context* ctx);
+/**
+ * \brief   This function performs any platform teardown operations.
+ *
+ * \note    This function should be called after every other Mbed TLS module
+ *          has been correctly freed using the appropriate free function.
+ *
+ *          Its implementation is platform-specific, and unless
+ *          platform-specific code is provided, it does nothing.
+ *
+ * \note    The usage and necessity of this function is dependent on the platform.
+ *
+ * \param   ctx     The platform context.
+ *
+ */
+void mbedtls_platform_teardown(mbedtls_platform_context* ctx);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* platform.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/platform_time.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/platform_time.h
new file mode 100644
index 0000000000..5f70e57f26
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/platform_time.h
@@ -0,0 +1,76 @@
+/**
+ * \file platform_time.h
+ *
+ * \brief mbed TLS Platform time abstraction
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_PLATFORM_TIME_H
+#define MBEDTLS_PLATFORM_TIME_H
+
+#include "mbedtls/build_info.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \name SECTION: Module settings
+ *
+ * The configuration options you can set for this module are in this section.
+ * Either change them in mbedtls_config.h or define them on the compiler command line.
+ * \{
+ */
+
+/*
+ * The time_t datatype
+ */
+#if defined(MBEDTLS_PLATFORM_TIME_TYPE_MACRO)
+typedef MBEDTLS_PLATFORM_TIME_TYPE_MACRO mbedtls_time_t;
+#else
+/* For time_t */
+#include <time.h>
+typedef time_t mbedtls_time_t;
+#endif /* MBEDTLS_PLATFORM_TIME_TYPE_MACRO */
+
+/*
+ * The function pointers for time
+ */
+#if defined(MBEDTLS_PLATFORM_TIME_ALT)
+extern mbedtls_time_t (*mbedtls_time)(mbedtls_time_t* time);
+
+/**
+ * \brief   Set your own time function pointer
+ *
+ * \param   time_func   the time function implementation
+ *
+ * \return              0
+ */
+int mbedtls_platform_set_time(mbedtls_time_t (*time_func)(mbedtls_time_t* time));
+#else
+#if defined(MBEDTLS_PLATFORM_TIME_MACRO)
+#define mbedtls_time MBEDTLS_PLATFORM_TIME_MACRO
+#else
+#define mbedtls_time time
+#endif /* MBEDTLS_PLATFORM_TIME_MACRO */
+#endif /* MBEDTLS_PLATFORM_TIME_ALT */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* platform_time.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/platform_util.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/platform_util.h
new file mode 100644
index 0000000000..60598148bf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/platform_util.h
@@ -0,0 +1,209 @@
+/**
+ * \file platform_util.h
+ *
+ * \brief Common and shared functions used by multiple modules in the Mbed TLS
+ *        library.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_PLATFORM_UTIL_H
+#define MBEDTLS_PLATFORM_UTIL_H
+
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+#if defined(MBEDTLS_HAVE_TIME_DATE)
+#include <time.h>
+
+#include "mbedtls/platform_time.h"
+#endif /* MBEDTLS_HAVE_TIME_DATE */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* Internal macros meant to be called only from within the library. */
+#define MBEDTLS_INTERNAL_VALIDATE_RET(cond, ret)                                                   \
+    do {                                                                                           \
+    } while (0)
+#define MBEDTLS_INTERNAL_VALIDATE(cond)                                                            \
+    do {                                                                                           \
+    } while (0)
+
+/* Internal helper macros for deprecating API constants. */
+#if !defined(MBEDTLS_DEPRECATED_REMOVED)
+#if defined(MBEDTLS_DEPRECATED_WARNING)
+#define MBEDTLS_DEPRECATED __attribute__((deprecated))
+MBEDTLS_DEPRECATED typedef char const* mbedtls_deprecated_string_constant_t;
+#define MBEDTLS_DEPRECATED_STRING_CONSTANT(VAL) ((mbedtls_deprecated_string_constant_t)(VAL))
+MBEDTLS_DEPRECATED typedef int mbedtls_deprecated_numeric_constant_t;
+#define MBEDTLS_DEPRECATED_NUMERIC_CONSTANT(VAL) ((mbedtls_deprecated_numeric_constant_t)(VAL))
+#else /* MBEDTLS_DEPRECATED_WARNING */
+#define MBEDTLS_DEPRECATED
+#define MBEDTLS_DEPRECATED_STRING_CONSTANT(VAL) VAL
+#define MBEDTLS_DEPRECATED_NUMERIC_CONSTANT(VAL) VAL
+#endif /* MBEDTLS_DEPRECATED_WARNING */
+#endif /* MBEDTLS_DEPRECATED_REMOVED */
+
+/* Implementation of the check-return facility.
+ * See the user documentation in mbedtls_config.h.
+ *
+ * Do not use this macro directly to annotate function: instead,
+ * use one of MBEDTLS_CHECK_RETURN_CRITICAL or MBEDTLS_CHECK_RETURN_TYPICAL
+ * depending on how important it is to check the return value.
+ */
+#if !defined(MBEDTLS_CHECK_RETURN)
+#if defined(__GNUC__)
+#define MBEDTLS_CHECK_RETURN __attribute__((__warn_unused_result__))
+#elif defined(_MSC_VER) && _MSC_VER >= 1700
+#include <sal.h>
+#define MBEDTLS_CHECK_RETURN _Check_return_
+#else
+#define MBEDTLS_CHECK_RETURN
+#endif
+#endif
+
+/** Critical-failure function
+ *
+ * This macro appearing at the beginning of the declaration of a function
+ * indicates that its return value should be checked in all applications.
+ * Omitting the check is very likely to indicate a bug in the application
+ * and will result in a compile-time warning if #MBEDTLS_CHECK_RETURN
+ * is implemented for the compiler in use.
+ *
+ * \note  The use of this macro is a work in progress.
+ *        This macro may be added to more functions in the future.
+ *        Such an extension is not considered an API break, provided that
+ *        there are near-unavoidable circumstances under which the function
+ *        can fail. For example, signature/MAC/AEAD verification functions,
+ *        and functions that require a random generator, are considered
+ *        return-check-critical.
+ */
+#define MBEDTLS_CHECK_RETURN_CRITICAL MBEDTLS_CHECK_RETURN
+
+/** Ordinary-failure function
+ *
+ * This macro appearing at the beginning of the declaration of a function
+ * indicates that its return value should be generally be checked in portable
+ * applications. Omitting the check will result in a compile-time warning if
+ * #MBEDTLS_CHECK_RETURN is implemented for the compiler in use and
+ * #MBEDTLS_CHECK_RETURN_WARNING is enabled in the compile-time configuration.
+ *
+ * You can use #MBEDTLS_IGNORE_RETURN to explicitly ignore the return value
+ * of a function that is annotated with #MBEDTLS_CHECK_RETURN.
+ *
+ * \note  The use of this macro is a work in progress.
+ *        This macro will be added to more functions in the future.
+ *        Eventually this should appear before most functions returning
+ *        an error code (as \c int in the \c mbedtls_xxx API or
+ *        as ::psa_status_t in the \c psa_xxx API).
+ */
+#if defined(MBEDTLS_CHECK_RETURN_WARNING)
+#define MBEDTLS_CHECK_RETURN_TYPICAL MBEDTLS_CHECK_RETURN
+#else
+#define MBEDTLS_CHECK_RETURN_TYPICAL
+#endif
+
+/** Benign-failure function
+ *
+ * This macro appearing at the beginning of the declaration of a function
+ * indicates that it is rarely useful to check its return value.
+ *
+ * This macro has an empty expansion. It exists for documentation purposes:
+ * a #MBEDTLS_CHECK_RETURN_OPTIONAL annotation indicates that the function
+ * has been analyzed for return-check usefuless, whereas the lack of
+ * an annotation indicates that the function has not been analyzed and its
+ * return-check usefulness is unknown.
+ */
+#define MBEDTLS_CHECK_RETURN_OPTIONAL
+
+/** \def MBEDTLS_IGNORE_RETURN
+ *
+ * Call this macro with one argument, a function call, to suppress a warning
+ * from #MBEDTLS_CHECK_RETURN due to that function call.
+ */
+#if !defined(MBEDTLS_IGNORE_RETURN)
+/* GCC doesn't silence the warning with just (void)(result).
+ * (void)!(result) is known to work up at least up to GCC 10, as well
+ * as with Clang and MSVC.
+ *
+ * https://gcc.gnu.org/onlinedocs/gcc-3.4.6/gcc/Non_002dbugs.html
+ * https://stackoverflow.com/questions/40576003/ignoring-warning-wunused-result
+ * https://gcc.gnu.org/bugzilla/show_bug.cgi?id=66425#c34
+ */
+#define MBEDTLS_IGNORE_RETURN(result) ((void)!(result))
+#endif
+
+/**
+ * \brief       Securely zeroize a buffer
+ *
+ *              The function is meant to wipe the data contained in a buffer so
+ *              that it can no longer be recovered even if the program memory
+ *              is later compromised. Call this function on sensitive data
+ *              stored on the stack before returning from a function, and on
+ *              sensitive data stored on the heap before freeing the heap
+ *              object.
+ *
+ *              It is extremely difficult to guarantee that calls to
+ *              mbedtls_platform_zeroize() are not removed by aggressive
+ *              compiler optimizations in a portable way. For this reason, Mbed
+ *              TLS provides the configuration option
+ *              MBEDTLS_PLATFORM_ZEROIZE_ALT, which allows users to configure
+ *              mbedtls_platform_zeroize() to use a suitable implementation for
+ *              their platform and needs
+ *
+ * \param buf   Buffer to be zeroized
+ * \param len   Length of the buffer in bytes
+ *
+ */
+void mbedtls_platform_zeroize(void* buf, size_t len);
+
+#if defined(MBEDTLS_HAVE_TIME_DATE)
+/**
+ * \brief      Platform-specific implementation of gmtime_r()
+ *
+ *             The function is a thread-safe abstraction that behaves
+ *             similarly to the gmtime_r() function from Unix/POSIX.
+ *
+ *             Mbed TLS will try to identify the underlying platform and
+ *             make use of an appropriate underlying implementation (e.g.
+ *             gmtime_r() for POSIX and gmtime_s() for Windows). If this is
+ *             not possible, then gmtime() will be used. In this case, calls
+ *             from the library to gmtime() will be guarded by the mutex
+ *             mbedtls_threading_gmtime_mutex if MBEDTLS_THREADING_C is
+ *             enabled. It is recommended that calls from outside the library
+ *             are also guarded by this mutex.
+ *
+ *             If MBEDTLS_PLATFORM_GMTIME_R_ALT is defined, then Mbed TLS will
+ *             unconditionally use the alternative implementation for
+ *             mbedtls_platform_gmtime_r() supplied by the user at compile time.
+ *
+ * \param tt     Pointer to an object containing time (in seconds) since the
+ *               epoch to be converted
+ * \param tm_buf Pointer to an object where the results will be stored
+ *
+ * \return      Pointer to an object of type struct tm on success, otherwise
+ *              NULL
+ */
+struct tm* mbedtls_platform_gmtime_r(const mbedtls_time_t* tt, struct tm* tm_buf);
+#endif /* MBEDTLS_HAVE_TIME_DATE */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* MBEDTLS_PLATFORM_UTIL_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/private_access.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/private_access.h
new file mode 100644
index 0000000000..3d15a98761
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/private_access.h
@@ -0,0 +1,32 @@
+/**
+ * \file private_access.h
+ *
+ * \brief Macro wrapper for struct's memebrs.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_PRIVATE_ACCESS_H
+#define MBEDTLS_PRIVATE_ACCESS_H
+
+#ifndef MBEDTLS_ALLOW_PRIVATE_ACCESS
+#define MBEDTLS_PRIVATE(member) private_##member
+#else
+#define MBEDTLS_PRIVATE(member) member
+#endif
+
+#endif /* MBEDTLS_PRIVATE_ACCESS_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/rsa.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/rsa.h
new file mode 100644
index 0000000000..e2fa3e7db7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/rsa.h
@@ -0,0 +1,1053 @@
+/**
+ * \file rsa.h
+ *
+ * \brief This file provides an API for the RSA public-key cryptosystem.
+ *
+ * The RSA public-key cryptosystem is defined in <em>Public-Key
+ * Cryptography Standards (PKCS) #1 v1.5: RSA Encryption</em>
+ * and <em>Public-Key Cryptography Standards (PKCS) #1 v2.1:
+ * RSA Cryptography Specifications</em>.
+ *
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_RSA_H
+#define MBEDTLS_RSA_H
+#include "mbedtls/bignum.h"
+#include "mbedtls/build_info.h"
+#include "mbedtls/md.h"
+#include "mbedtls/private_access.h"
+
+#if defined(MBEDTLS_THREADING_C)
+#include "mbedtls/threading.h"
+#endif
+
+/*
+ * RSA Error codes
+ */
+/** Bad input parameters to function. */
+#define MBEDTLS_ERR_RSA_BAD_INPUT_DATA -0x4080
+/** Input data contains invalid padding and is rejected. */
+#define MBEDTLS_ERR_RSA_INVALID_PADDING -0x4100
+/** Something failed during generation of a key. */
+#define MBEDTLS_ERR_RSA_KEY_GEN_FAILED -0x4180
+/** Key failed to pass the validity check of the library. */
+#define MBEDTLS_ERR_RSA_KEY_CHECK_FAILED -0x4200
+/** The public key operation failed. */
+#define MBEDTLS_ERR_RSA_PUBLIC_FAILED -0x4280
+/** The private key operation failed. */
+#define MBEDTLS_ERR_RSA_PRIVATE_FAILED -0x4300
+/** The PKCS#1 verification failed. */
+#define MBEDTLS_ERR_RSA_VERIFY_FAILED -0x4380
+/** The output buffer for decryption is not large enough. */
+#define MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE -0x4400
+/** The random generator failed to generate non-zeros. */
+#define MBEDTLS_ERR_RSA_RNG_FAILED -0x4480
+
+/*
+ * RSA constants
+ */
+
+#define MBEDTLS_RSA_PKCS_V15 0 /**< Use PKCS#1 v1.5 encoding. */
+#define MBEDTLS_RSA_PKCS_V21 1 /**< Use PKCS#1 v2.1 encoding. */
+
+#define MBEDTLS_RSA_SIGN 1  /**< Identifier for RSA signature operations. */
+#define MBEDTLS_RSA_CRYPT 2 /**< Identifier for RSA encryption and decryption operations. */
+
+#define MBEDTLS_RSA_SALT_LEN_ANY -1
+
+/*
+ * The above constants may be used even if the RSA module is compile out,
+ * eg for alternative (PKCS#11) RSA implemenations in the PK layers.
+ */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_RSA_ALT)
+// Regular implementation
+//
+
+/**
+ * \brief   The RSA context structure.
+ */
+typedef struct mbedtls_rsa_context {
+    int MBEDTLS_PRIVATE(ver);    /*!<  Reserved for internal purposes.
+                                  *    Do not set this field in application
+                                  *    code. Its meaning might change without
+                                  *    notice. */
+    size_t MBEDTLS_PRIVATE(len); /*!<  The size of \p N in Bytes. */
+
+    mbedtls_mpi MBEDTLS_PRIVATE(N); /*!<  The public modulus. */
+    mbedtls_mpi MBEDTLS_PRIVATE(E); /*!<  The public exponent. */
+
+    mbedtls_mpi MBEDTLS_PRIVATE(D); /*!<  The private exponent. */
+    mbedtls_mpi MBEDTLS_PRIVATE(P); /*!<  The first prime factor. */
+    mbedtls_mpi MBEDTLS_PRIVATE(Q); /*!<  The second prime factor. */
+
+    mbedtls_mpi MBEDTLS_PRIVATE(DP); /*!<  <code>D % (P - 1)</code>. */
+    mbedtls_mpi MBEDTLS_PRIVATE(DQ); /*!<  <code>D % (Q - 1)</code>. */
+    mbedtls_mpi MBEDTLS_PRIVATE(QP); /*!<  <code>1 / (Q % P)</code>. */
+
+    mbedtls_mpi MBEDTLS_PRIVATE(RN); /*!<  cached <code>R^2 mod N</code>. */
+
+    mbedtls_mpi MBEDTLS_PRIVATE(RP); /*!<  cached <code>R^2 mod P</code>. */
+    mbedtls_mpi MBEDTLS_PRIVATE(RQ); /*!<  cached <code>R^2 mod Q</code>. */
+
+    mbedtls_mpi MBEDTLS_PRIVATE(Vi); /*!<  The cached blinding value. */
+    mbedtls_mpi MBEDTLS_PRIVATE(Vf); /*!<  The cached un-blinding value. */
+
+    int MBEDTLS_PRIVATE(padding); /*!< Selects padding mode:
+                      #MBEDTLS_RSA_PKCS_V15 for 1.5 padding and
+                      #MBEDTLS_RSA_PKCS_V21 for OAEP or PSS. */
+    int MBEDTLS_PRIVATE(hash_id); /*!< Hash identifier of mbedtls_md_type_t type,
+                      as specified in md.h for use in the MGF
+                      mask generating function used in the
+                      EME-OAEP and EMSA-PSS encodings. */
+#if defined(MBEDTLS_THREADING_C)
+    /* Invariant: the mutex is initialized iff ver != 0. */
+    mbedtls_threading_mutex_t MBEDTLS_PRIVATE(mutex); /*!<  Thread-safety mutex. */
+#endif
+} mbedtls_rsa_context;
+
+#else /* MBEDTLS_RSA_ALT */
+#include "rsa_alt.h"
+#endif /* MBEDTLS_RSA_ALT */
+
+/**
+ * \brief          This function initializes an RSA context.
+ *
+ * \note           This function initializes the padding and the hash
+ *                 identifier to respectively #MBEDTLS_RSA_PKCS_V15 and
+ *                 #MBEDTLS_MD_NONE. See mbedtls_rsa_set_padding() for more
+ *                 information about those parameters.
+ *
+ * \param ctx      The RSA context to initialize. This must not be \c NULL.
+ */
+void mbedtls_rsa_init(mbedtls_rsa_context* ctx);
+
+/**
+ * \brief          This function sets padding for an already initialized RSA
+ *                 context.
+ *
+ * \note           Set padding to #MBEDTLS_RSA_PKCS_V21 for the RSAES-OAEP
+ *                 encryption scheme and the RSASSA-PSS signature scheme.
+ *
+ * \note           The \p hash_id parameter is ignored when using
+ *                 #MBEDTLS_RSA_PKCS_V15 padding.
+ *
+ * \note           The choice of padding mode is strictly enforced for private
+ *                 key operations, since there might be security concerns in
+ *                 mixing padding modes. For public key operations it is
+ *                 a default value, which can be overridden by calling specific
+ *                 \c mbedtls_rsa_rsaes_xxx or \c mbedtls_rsa_rsassa_xxx
+ *                 functions.
+ *
+ * \note           The hash selected in \p hash_id is always used for OEAP
+ *                 encryption. For PSS signatures, it is always used for
+ *                 making signatures, but can be overridden for verifying them.
+ *                 If set to #MBEDTLS_MD_NONE, it is always overridden.
+ *
+ * \param ctx      The initialized RSA context to be configured.
+ * \param padding  The padding mode to use. This must be either
+ *                 #MBEDTLS_RSA_PKCS_V15 or #MBEDTLS_RSA_PKCS_V21.
+ * \param hash_id  The hash identifier for PSS or OAEP, if \p padding is
+ *                 #MBEDTLS_RSA_PKCS_V21. #MBEDTLS_MD_NONE is accepted by this
+ *                 function but may be not suitable for some operations.
+ *                 Ignored if \p padding is #MBEDTLS_RSA_PKCS_V15.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_RSA_INVALID_PADDING failure:
+ *                 \p padding or \p hash_id is invalid.
+ */
+int mbedtls_rsa_set_padding(mbedtls_rsa_context* ctx, int padding, mbedtls_md_type_t hash_id);
+
+/**
+ * \brief          This function imports a set of core parameters into an
+ *                 RSA context.
+ *
+ * \note           This function can be called multiple times for successive
+ *                 imports, if the parameters are not simultaneously present.
+ *
+ *                 Any sequence of calls to this function should be followed
+ *                 by a call to mbedtls_rsa_complete(), which checks and
+ *                 completes the provided information to a ready-for-use
+ *                 public or private RSA key.
+ *
+ * \note           See mbedtls_rsa_complete() for more information on which
+ *                 parameters are necessary to set up a private or public
+ *                 RSA key.
+ *
+ * \note           The imported parameters are copied and need not be preserved
+ *                 for the lifetime of the RSA context being set up.
+ *
+ * \param ctx      The initialized RSA context to store the parameters in.
+ * \param N        The RSA modulus. This may be \c NULL.
+ * \param P        The first prime factor of \p N. This may be \c NULL.
+ * \param Q        The second prime factor of \p N. This may be \c NULL.
+ * \param D        The private exponent. This may be \c NULL.
+ * \param E        The public exponent. This may be \c NULL.
+ *
+ * \return         \c 0 on success.
+ * \return         A non-zero error code on failure.
+ */
+int mbedtls_rsa_import(mbedtls_rsa_context* ctx, const mbedtls_mpi* N, const mbedtls_mpi* P,
+    const mbedtls_mpi* Q, const mbedtls_mpi* D, const mbedtls_mpi* E);
+
+/**
+ * \brief          This function imports core RSA parameters, in raw big-endian
+ *                 binary format, into an RSA context.
+ *
+ * \note           This function can be called multiple times for successive
+ *                 imports, if the parameters are not simultaneously present.
+ *
+ *                 Any sequence of calls to this function should be followed
+ *                 by a call to mbedtls_rsa_complete(), which checks and
+ *                 completes the provided information to a ready-for-use
+ *                 public or private RSA key.
+ *
+ * \note           See mbedtls_rsa_complete() for more information on which
+ *                 parameters are necessary to set up a private or public
+ *                 RSA key.
+ *
+ * \note           The imported parameters are copied and need not be preserved
+ *                 for the lifetime of the RSA context being set up.
+ *
+ * \param ctx      The initialized RSA context to store the parameters in.
+ * \param N        The RSA modulus. This may be \c NULL.
+ * \param N_len    The Byte length of \p N; it is ignored if \p N == NULL.
+ * \param P        The first prime factor of \p N. This may be \c NULL.
+ * \param P_len    The Byte length of \p P; it ns ignored if \p P == NULL.
+ * \param Q        The second prime factor of \p N. This may be \c NULL.
+ * \param Q_len    The Byte length of \p Q; it is ignored if \p Q == NULL.
+ * \param D        The private exponent. This may be \c NULL.
+ * \param D_len    The Byte length of \p D; it is ignored if \p D == NULL.
+ * \param E        The public exponent. This may be \c NULL.
+ * \param E_len    The Byte length of \p E; it is ignored if \p E == NULL.
+ *
+ * \return         \c 0 on success.
+ * \return         A non-zero error code on failure.
+ */
+int mbedtls_rsa_import_raw(mbedtls_rsa_context* ctx, unsigned char const* N, size_t N_len,
+    unsigned char const* P, size_t P_len, unsigned char const* Q, size_t Q_len,
+    unsigned char const* D, size_t D_len, unsigned char const* E, size_t E_len);
+
+/**
+ * \brief          This function completes an RSA context from
+ *                 a set of imported core parameters.
+ *
+ *                 To setup an RSA public key, precisely \p N and \p E
+ *                 must have been imported.
+ *
+ *                 To setup an RSA private key, sufficient information must
+ *                 be present for the other parameters to be derivable.
+ *
+ *                 The default implementation supports the following:
+ *                 <ul><li>Derive \p P, \p Q from \p N, \p D, \p E.</li>
+ *                 <li>Derive \p N, \p D from \p P, \p Q, \p E.</li></ul>
+ *                 Alternative implementations need not support these.
+ *
+ *                 If this function runs successfully, it guarantees that
+ *                 the RSA context can be used for RSA operations without
+ *                 the risk of failure or crash.
+ *
+ * \warning        This function need not perform consistency checks
+ *                 for the imported parameters. In particular, parameters that
+ *                 are not needed by the implementation might be silently
+ *                 discarded and left unchecked. To check the consistency
+ *                 of the key material, see mbedtls_rsa_check_privkey().
+ *
+ * \param ctx      The initialized RSA context holding imported parameters.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_RSA_BAD_INPUT_DATA if the attempted derivations
+ *                 failed.
+ *
+ */
+int mbedtls_rsa_complete(mbedtls_rsa_context* ctx);
+
+/**
+ * \brief          This function exports the core parameters of an RSA key.
+ *
+ *                 If this function runs successfully, the non-NULL buffers
+ *                 pointed to by \p N, \p P, \p Q, \p D, and \p E are fully
+ *                 written, with additional unused space filled leading by
+ *                 zero Bytes.
+ *
+ *                 Possible reasons for returning
+ *                 #MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED:<ul>
+ *                 <li>An alternative RSA implementation is in use, which
+ *                 stores the key externally, and either cannot or should
+ *                 not export it into RAM.</li>
+ *                 <li>A SW or HW implementation might not support a certain
+ *                 deduction. For example, \p P, \p Q from \p N, \p D,
+ *                 and \p E if the former are not part of the
+ *                 implementation.</li></ul>
+ *
+ *                 If the function fails due to an unsupported operation,
+ *                 the RSA context stays intact and remains usable.
+ *
+ * \param ctx      The initialized RSA context.
+ * \param N        The MPI to hold the RSA modulus.
+ *                 This may be \c NULL if this field need not be exported.
+ * \param P        The MPI to hold the first prime factor of \p N.
+ *                 This may be \c NULL if this field need not be exported.
+ * \param Q        The MPI to hold the second prime factor of \p N.
+ *                 This may be \c NULL if this field need not be exported.
+ * \param D        The MPI to hold the private exponent.
+ *                 This may be \c NULL if this field need not be exported.
+ * \param E        The MPI to hold the public exponent.
+ *                 This may be \c NULL if this field need not be exported.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED if exporting the
+ *                 requested parameters cannot be done due to missing
+ *                 functionality or because of security policies.
+ * \return         A non-zero return code on any other failure.
+ *
+ */
+int mbedtls_rsa_export(const mbedtls_rsa_context* ctx, mbedtls_mpi* N, mbedtls_mpi* P,
+    mbedtls_mpi* Q, mbedtls_mpi* D, mbedtls_mpi* E);
+
+/**
+ * \brief          This function exports core parameters of an RSA key
+ *                 in raw big-endian binary format.
+ *
+ *                 If this function runs successfully, the non-NULL buffers
+ *                 pointed to by \p N, \p P, \p Q, \p D, and \p E are fully
+ *                 written, with additional unused space filled leading by
+ *                 zero Bytes.
+ *
+ *                 Possible reasons for returning
+ *                 #MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED:<ul>
+ *                 <li>An alternative RSA implementation is in use, which
+ *                 stores the key externally, and either cannot or should
+ *                 not export it into RAM.</li>
+ *                 <li>A SW or HW implementation might not support a certain
+ *                 deduction. For example, \p P, \p Q from \p N, \p D,
+ *                 and \p E if the former are not part of the
+ *                 implementation.</li></ul>
+ *                 If the function fails due to an unsupported operation,
+ *                 the RSA context stays intact and remains usable.
+ *
+ * \note           The length parameters are ignored if the corresponding
+ *                 buffer pointers are NULL.
+ *
+ * \param ctx      The initialized RSA context.
+ * \param N        The Byte array to store the RSA modulus,
+ *                 or \c NULL if this field need not be exported.
+ * \param N_len    The size of the buffer for the modulus.
+ * \param P        The Byte array to hold the first prime factor of \p N,
+ *                 or \c NULL if this field need not be exported.
+ * \param P_len    The size of the buffer for the first prime factor.
+ * \param Q        The Byte array to hold the second prime factor of \p N,
+ *                 or \c NULL if this field need not be exported.
+ * \param Q_len    The size of the buffer for the second prime factor.
+ * \param D        The Byte array to hold the private exponent,
+ *                 or \c NULL if this field need not be exported.
+ * \param D_len    The size of the buffer for the private exponent.
+ * \param E        The Byte array to hold the public exponent,
+ *                 or \c NULL if this field need not be exported.
+ * \param E_len    The size of the buffer for the public exponent.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED if exporting the
+ *                 requested parameters cannot be done due to missing
+ *                 functionality or because of security policies.
+ * \return         A non-zero return code on any other failure.
+ */
+int mbedtls_rsa_export_raw(const mbedtls_rsa_context* ctx, unsigned char* N, size_t N_len,
+    unsigned char* P, size_t P_len, unsigned char* Q, size_t Q_len, unsigned char* D, size_t D_len,
+    unsigned char* E, size_t E_len);
+
+/**
+ * \brief          This function exports CRT parameters of a private RSA key.
+ *
+ * \note           Alternative RSA implementations not using CRT-parameters
+ *                 internally can implement this function based on
+ *                 mbedtls_rsa_deduce_opt().
+ *
+ * \param ctx      The initialized RSA context.
+ * \param DP       The MPI to hold \c D modulo `P-1`,
+ *                 or \c NULL if it need not be exported.
+ * \param DQ       The MPI to hold \c D modulo `Q-1`,
+ *                 or \c NULL if it need not be exported.
+ * \param QP       The MPI to hold modular inverse of \c Q modulo \c P,
+ *                 or \c NULL if it need not be exported.
+ *
+ * \return         \c 0 on success.
+ * \return         A non-zero error code on failure.
+ *
+ */
+int mbedtls_rsa_export_crt(const mbedtls_rsa_context* ctx, mbedtls_mpi* DP, mbedtls_mpi* DQ,
+    mbedtls_mpi* QP);
+
+/**
+ * \brief          This function retrieves the length of RSA modulus in Bytes.
+ *
+ * \param ctx      The initialized RSA context.
+ *
+ * \return         The length of the RSA modulus in Bytes.
+ *
+ */
+size_t mbedtls_rsa_get_len(const mbedtls_rsa_context* ctx);
+
+/**
+ * \brief          This function generates an RSA keypair.
+ *
+ * \note           mbedtls_rsa_init() must be called before this function,
+ *                 to set up the RSA context.
+ *
+ * \param ctx      The initialized RSA context used to hold the key.
+ * \param f_rng    The RNG function to be used for key generation.
+ *                 This is mandatory and must not be \c NULL.
+ * \param p_rng    The RNG context to be passed to \p f_rng.
+ *                 This may be \c NULL if \p f_rng doesn't need a context.
+ * \param nbits    The size of the public key in bits.
+ * \param exponent The public exponent to use. For example, \c 65537.
+ *                 This must be odd and greater than \c 1.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_gen_key(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, unsigned int nbits, int exponent);
+
+/**
+ * \brief          This function checks if a context contains at least an RSA
+ *                 public key.
+ *
+ *                 If the function runs successfully, it is guaranteed that
+ *                 enough information is present to perform an RSA public key
+ *                 operation using mbedtls_rsa_public().
+ *
+ * \param ctx      The initialized RSA context to check.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ *
+ */
+int mbedtls_rsa_check_pubkey(const mbedtls_rsa_context* ctx);
+
+/**
+ * \brief      This function checks if a context contains an RSA private key
+ *             and perform basic consistency checks.
+ *
+ * \note       The consistency checks performed by this function not only
+ *             ensure that mbedtls_rsa_private() can be called successfully
+ *             on the given context, but that the various parameters are
+ *             mutually consistent with high probability, in the sense that
+ *             mbedtls_rsa_public() and mbedtls_rsa_private() are inverses.
+ *
+ * \warning    This function should catch accidental misconfigurations
+ *             like swapping of parameters, but it cannot establish full
+ *             trust in neither the quality nor the consistency of the key
+ *             material that was used to setup the given RSA context:
+ *             <ul><li>Consistency: Imported parameters that are irrelevant
+ *             for the implementation might be silently dropped. If dropped,
+ *             the current function does not have access to them,
+ *             and therefore cannot check them. See mbedtls_rsa_complete().
+ *             If you want to check the consistency of the entire
+ *             content of an PKCS1-encoded RSA private key, for example, you
+ *             should use mbedtls_rsa_validate_params() before setting
+ *             up the RSA context.
+ *             Additionally, if the implementation performs empirical checks,
+ *             these checks substantiate but do not guarantee consistency.</li>
+ *             <li>Quality: This function is not expected to perform
+ *             extended quality assessments like checking that the prime
+ *             factors are safe. Additionally, it is the responsibility of the
+ *             user to ensure the trustworthiness of the source of his RSA
+ *             parameters, which goes beyond what is effectively checkable
+ *             by the library.</li></ul>
+ *
+ * \param ctx  The initialized RSA context to check.
+ *
+ * \return     \c 0 on success.
+ * \return     An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_check_privkey(const mbedtls_rsa_context* ctx);
+
+/**
+ * \brief          This function checks a public-private RSA key pair.
+ *
+ *                 It checks each of the contexts, and makes sure they match.
+ *
+ * \param pub      The initialized RSA context holding the public key.
+ * \param prv      The initialized RSA context holding the private key.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_check_pub_priv(const mbedtls_rsa_context* pub, const mbedtls_rsa_context* prv);
+
+/**
+ * \brief          This function performs an RSA public key operation.
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param input    The input buffer. This must be a readable buffer
+ *                 of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ * \param output   The output buffer. This must be a writable buffer
+ *                 of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ *
+ * \note           This function does not handle message padding.
+ *
+ * \note           Make sure to set \p input[0] = 0 or ensure that
+ *                 input is smaller than \p N.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_public(mbedtls_rsa_context* ctx, const unsigned char* input, unsigned char* output);
+
+/**
+ * \brief          This function performs an RSA private key operation.
+ *
+ * \note           Blinding is used if and only if a PRNG is provided.
+ *
+ * \note           If blinding is used, both the base of exponentation
+ *                 and the exponent are blinded, providing protection
+ *                 against some side-channel attacks.
+ *
+ * \warning        It is deprecated and a security risk to not provide
+ *                 a PRNG here and thereby prevent the use of blinding.
+ *                 Future versions of the library may enforce the presence
+ *                 of a PRNG.
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param f_rng    The RNG function, used for blinding. It is mandatory.
+ * \param p_rng    The RNG context to pass to \p f_rng. This may be \c NULL
+ *                 if \p f_rng doesn't need a context.
+ * \param input    The input buffer. This must be a readable buffer
+ *                 of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ * \param output   The output buffer. This must be a writable buffer
+ *                 of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ *
+ */
+int mbedtls_rsa_private(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, const unsigned char* input, unsigned char* output);
+
+/**
+ * \brief          This function adds the message padding, then performs an RSA
+ *                 operation.
+ *
+ *                 It is the generic wrapper for performing a PKCS#1 encryption
+ *                 operation.
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param f_rng    The RNG to use. It is used for padding generation
+ *                 and it is mandatory.
+ * \param p_rng    The RNG context to be passed to \p f_rng. May be
+ *                 \c NULL if \p f_rng doesn't need a context argument.
+ * \param ilen     The length of the plaintext in Bytes.
+ * \param input    The input data to encrypt. This must be a readable
+ *                 buffer of size \p ilen Bytes. It may be \c NULL if
+ *                 `ilen == 0`.
+ * \param output   The output buffer. This must be a writable buffer
+ *                 of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_pkcs1_encrypt(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, size_t ilen, const unsigned char* input, unsigned char* output);
+
+/**
+ * \brief          This function performs a PKCS#1 v1.5 encryption operation
+ *                 (RSAES-PKCS1-v1_5-ENCRYPT).
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param f_rng    The RNG function to use. It is mandatory and used for
+ *                 padding generation.
+ * \param p_rng    The RNG context to be passed to \p f_rng. This may
+ *                 be \c NULL if \p f_rng doesn't need a context argument.
+ * \param ilen     The length of the plaintext in Bytes.
+ * \param input    The input data to encrypt. This must be a readable
+ *                 buffer of size \p ilen Bytes. It may be \c NULL if
+ *                 `ilen == 0`.
+ * \param output   The output buffer. This must be a writable buffer
+ *                 of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_rsaes_pkcs1_v15_encrypt(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, size_t ilen,
+    const unsigned char* input, unsigned char* output);
+
+/**
+ * \brief            This function performs a PKCS#1 v2.1 OAEP encryption
+ *                   operation (RSAES-OAEP-ENCRYPT).
+ *
+ * \note             The output buffer must be as large as the size
+ *                   of ctx->N. For example, 128 Bytes if RSA-1024 is used.
+ *
+ * \param ctx        The initnialized RSA context to use.
+ * \param f_rng      The RNG function to use. This is needed for padding
+ *                   generation and is mandatory.
+ * \param p_rng      The RNG context to be passed to \p f_rng. This may
+ *                   be \c NULL if \p f_rng doesn't need a context argument.
+ * \param label      The buffer holding the custom label to use.
+ *                   This must be a readable buffer of length \p label_len
+ *                   Bytes. It may be \c NULL if \p label_len is \c 0.
+ * \param label_len  The length of the label in Bytes.
+ * \param ilen       The length of the plaintext buffer \p input in Bytes.
+ * \param input      The input data to encrypt. This must be a readable
+ *                   buffer of size \p ilen Bytes. It may be \c NULL if
+ *                   `ilen == 0`.
+ * \param output     The output buffer. This must be a writable buffer
+ *                   of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                   for an 2048-bit RSA modulus.
+ *
+ * \return           \c 0 on success.
+ * \return           An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_rsaes_oaep_encrypt(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, const unsigned char* label,
+    size_t label_len, size_t ilen, const unsigned char* input, unsigned char* output);
+
+/**
+ * \brief          This function performs an RSA operation, then removes the
+ *                 message padding.
+ *
+ *                 It is the generic wrapper for performing a PKCS#1 decryption
+ *                 operation.
+ *
+ * \note           The output buffer length \c output_max_len should be
+ *                 as large as the size \p ctx->len of \p ctx->N (for example,
+ *                 128 Bytes if RSA-1024 is used) to be able to hold an
+ *                 arbitrary decrypted message. If it is not large enough to
+ *                 hold the decryption of the particular ciphertext provided,
+ *                 the function returns \c MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE.
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param f_rng    The RNG function. This is used for blinding and is
+ *                 mandatory; see mbedtls_rsa_private() for more.
+ * \param p_rng    The RNG context to be passed to \p f_rng. This may be
+ *                 \c NULL if \p f_rng doesn't need a context.
+ * \param olen     The address at which to store the length of
+ *                 the plaintext. This must not be \c NULL.
+ * \param input    The ciphertext buffer. This must be a readable buffer
+ *                 of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ * \param output   The buffer used to hold the plaintext. This must
+ *                 be a writable buffer of length \p output_max_len Bytes.
+ * \param output_max_len The length in Bytes of the output buffer \p output.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_pkcs1_decrypt(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, size_t* olen, const unsigned char* input, unsigned char* output,
+    size_t output_max_len);
+
+/**
+ * \brief          This function performs a PKCS#1 v1.5 decryption
+ *                 operation (RSAES-PKCS1-v1_5-DECRYPT).
+ *
+ * \note           The output buffer length \c output_max_len should be
+ *                 as large as the size \p ctx->len of \p ctx->N, for example,
+ *                 128 Bytes if RSA-1024 is used, to be able to hold an
+ *                 arbitrary decrypted message. If it is not large enough to
+ *                 hold the decryption of the particular ciphertext provided,
+ *                 the function returns #MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE.
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param f_rng    The RNG function. This is used for blinding and is
+ *                 mandatory; see mbedtls_rsa_private() for more.
+ * \param p_rng    The RNG context to be passed to \p f_rng. This may be
+ *                 \c NULL if \p f_rng doesn't need a context.
+ * \param olen     The address at which to store the length of
+ *                 the plaintext. This must not be \c NULL.
+ * \param input    The ciphertext buffer. This must be a readable buffer
+ *                 of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ * \param output   The buffer used to hold the plaintext. This must
+ *                 be a writable buffer of length \p output_max_len Bytes.
+ * \param output_max_len The length in Bytes of the output buffer \p output.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ *
+ */
+int mbedtls_rsa_rsaes_pkcs1_v15_decrypt(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, size_t* olen,
+    const unsigned char* input, unsigned char* output, size_t output_max_len);
+
+/**
+ * \brief            This function performs a PKCS#1 v2.1 OAEP decryption
+ *                   operation (RSAES-OAEP-DECRYPT).
+ *
+ * \note             The output buffer length \c output_max_len should be
+ *                   as large as the size \p ctx->len of \p ctx->N, for
+ *                   example, 128 Bytes if RSA-1024 is used, to be able to
+ *                   hold an arbitrary decrypted message. If it is not
+ *                   large enough to hold the decryption of the particular
+ *                   ciphertext provided, the function returns
+ *                   #MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE.
+ *
+ * \param ctx        The initialized RSA context to use.
+ * \param f_rng      The RNG function. This is used for blinding and is
+ *                   mandatory.
+ * \param p_rng      The RNG context to be passed to \p f_rng. This may be
+ *                   \c NULL if \p f_rng doesn't need a context.
+ * \param label      The buffer holding the custom label to use.
+ *                   This must be a readable buffer of length \p label_len
+ *                   Bytes. It may be \c NULL if \p label_len is \c 0.
+ * \param label_len  The length of the label in Bytes.
+ * \param olen       The address at which to store the length of
+ *                   the plaintext. This must not be \c NULL.
+ * \param input      The ciphertext buffer. This must be a readable buffer
+ *                   of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                   for an 2048-bit RSA modulus.
+ * \param output     The buffer used to hold the plaintext. This must
+ *                   be a writable buffer of length \p output_max_len Bytes.
+ * \param output_max_len The length in Bytes of the output buffer \p output.
+ *
+ * \return         \c 0 on success.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_rsaes_oaep_decrypt(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, const unsigned char* label,
+    size_t label_len, size_t* olen, const unsigned char* input, unsigned char* output,
+    size_t output_max_len);
+
+/**
+ * \brief          This function performs a private RSA operation to sign
+ *                 a message digest using PKCS#1.
+ *
+ *                 It is the generic wrapper for performing a PKCS#1
+ *                 signature.
+ *
+ * \note           The \p sig buffer must be as large as the size
+ *                 of \p ctx->N. For example, 128 Bytes if RSA-1024 is used.
+ *
+ * \note           For PKCS#1 v2.1 encoding, see comments on
+ *                 mbedtls_rsa_rsassa_pss_sign() for details on
+ *                 \p md_alg and \p hash_id.
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param f_rng    The RNG function to use. This is mandatory and
+ *                 must not be \c NULL.
+ * \param p_rng    The RNG context to be passed to \p f_rng. This may be \c NULL
+ *                 if \p f_rng doesn't need a context argument.
+ * \param md_alg   The message-digest algorithm used to hash the original data.
+ *                 Use #MBEDTLS_MD_NONE for signing raw data.
+ * \param hashlen  The length of the message digest or raw data in Bytes.
+ *                 If \p md_alg is not #MBEDTLS_MD_NONE, this must match the
+ *                 output length of the corresponding hash algorithm.
+ * \param hash     The buffer holding the message digest or raw data.
+ *                 This must be a readable buffer of at least \p hashlen Bytes.
+ * \param sig      The buffer to hold the signature. This must be a writable
+ *                 buffer of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus. A buffer length of
+ *                 #MBEDTLS_MPI_MAX_SIZE is always safe.
+ *
+ * \return         \c 0 if the signing operation was successful.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_pkcs1_sign(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, mbedtls_md_type_t md_alg, unsigned int hashlen, const unsigned char* hash,
+    unsigned char* sig);
+
+/**
+ * \brief          This function performs a PKCS#1 v1.5 signature
+ *                 operation (RSASSA-PKCS1-v1_5-SIGN).
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param f_rng    The RNG function. This is used for blinding and is
+ *                 mandatory; see mbedtls_rsa_private() for more.
+ * \param p_rng    The RNG context to be passed to \p f_rng. This may be \c NULL
+ *                 if \p f_rng doesn't need a context argument.
+ * \param md_alg   The message-digest algorithm used to hash the original data.
+ *                 Use #MBEDTLS_MD_NONE for signing raw data.
+ * \param hashlen  The length of the message digest or raw data in Bytes.
+ *                 If \p md_alg is not #MBEDTLS_MD_NONE, this must match the
+ *                 output length of the corresponding hash algorithm.
+ * \param hash     The buffer holding the message digest or raw data.
+ *                 This must be a readable buffer of at least \p hashlen Bytes.
+ * \param sig      The buffer to hold the signature. This must be a writable
+ *                 buffer of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus. A buffer length of
+ *                 #MBEDTLS_MPI_MAX_SIZE is always safe.
+ *
+ * \return         \c 0 if the signing operation was successful.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_rsassa_pkcs1_v15_sign(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, unsigned char* sig);
+
+/**
+ * \brief          This function performs a PKCS#1 v2.1 PSS signature
+ *                 operation (RSASSA-PSS-SIGN).
+ *
+ * \note           The \c hash_id set in \p ctx by calling
+ *                 mbedtls_rsa_set_padding() selects the hash used for the
+ *                 encoding operation and for the mask generation function
+ *                 (MGF1). For more details on the encoding operation and the
+ *                 mask generation function, consult <em>RFC-3447: Public-Key
+ *                 Cryptography Standards (PKCS) #1 v2.1: RSA Cryptography
+ *                 Specifications</em>.
+ *
+ * \note           This function enforces that the provided salt length complies
+ *                 with FIPS 186-4 §5.5 (e) and RFC 8017 (PKCS#1 v2.2) §9.1.1
+ *                 step 3. The constraint is that the hash length plus the salt
+ *                 length plus 2 bytes must be at most the key length. If this
+ *                 constraint is not met, this function returns
+ *                 #MBEDTLS_ERR_RSA_BAD_INPUT_DATA.
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param f_rng    The RNG function. It is mandatory and must not be \c NULL.
+ * \param p_rng    The RNG context to be passed to \p f_rng. This may be \c NULL
+ *                 if \p f_rng doesn't need a context argument.
+ * \param md_alg   The message-digest algorithm used to hash the original data.
+ *                 Use #MBEDTLS_MD_NONE for signing raw data.
+ * \param hashlen  The length of the message digest or raw data in Bytes.
+ *                 If \p md_alg is not #MBEDTLS_MD_NONE, this must match the
+ *                 output length of the corresponding hash algorithm.
+ * \param hash     The buffer holding the message digest or raw data.
+ *                 This must be a readable buffer of at least \p hashlen Bytes.
+ * \param saltlen  The length of the salt that should be used.
+ *                 If passed #MBEDTLS_RSA_SALT_LEN_ANY, the function will use
+ *                 the largest possible salt length up to the hash length,
+ *                 which is the largest permitted by some standards including
+ *                 FIPS 186-4 §5.5.
+ * \param sig      The buffer to hold the signature. This must be a writable
+ *                 buffer of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus. A buffer length of
+ *                 #MBEDTLS_MPI_MAX_SIZE is always safe.
+ *
+ * \return         \c 0 if the signing operation was successful.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_rsassa_pss_sign_ext(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, int saltlen, unsigned char* sig);
+
+/**
+ * \brief          This function performs a PKCS#1 v2.1 PSS signature
+ *                 operation (RSASSA-PSS-SIGN).
+ *
+ * \note           The \c hash_id set in \p ctx by calling
+ *                 mbedtls_rsa_set_padding() selects the hash used for the
+ *                 encoding operation and for the mask generation function
+ *                 (MGF1). For more details on the encoding operation and the
+ *                 mask generation function, consult <em>RFC-3447: Public-Key
+ *                 Cryptography Standards (PKCS) #1 v2.1: RSA Cryptography
+ *                 Specifications</em>.
+ *
+ * \note           This function always uses the maximum possible salt size,
+ *                 up to the length of the payload hash. This choice of salt
+ *                 size complies with FIPS 186-4 §5.5 (e) and RFC 8017 (PKCS#1
+ *                 v2.2) §9.1.1 step 3. Furthermore this function enforces a
+ *                 minimum salt size which is the hash size minus 2 bytes. If
+ *                 this minimum size is too large given the key size (the salt
+ *                 size, plus the hash size, plus 2 bytes must be no more than
+ *                 the key size in bytes), this function returns
+ *                 #MBEDTLS_ERR_RSA_BAD_INPUT_DATA.
+ *
+ * \param ctx      The initialized RSA context to use.
+ * \param f_rng    The RNG function. It is mandatory and must not be \c NULL.
+ * \param p_rng    The RNG context to be passed to \p f_rng. This may be \c NULL
+ *                 if \p f_rng doesn't need a context argument.
+ * \param md_alg   The message-digest algorithm used to hash the original data.
+ *                 Use #MBEDTLS_MD_NONE for signing raw data.
+ * \param hashlen  The length of the message digest or raw data in Bytes.
+ *                 If \p md_alg is not #MBEDTLS_MD_NONE, this must match the
+ *                 output length of the corresponding hash algorithm.
+ * \param hash     The buffer holding the message digest or raw data.
+ *                 This must be a readable buffer of at least \p hashlen Bytes.
+ * \param sig      The buffer to hold the signature. This must be a writable
+ *                 buffer of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus. A buffer length of
+ *                 #MBEDTLS_MPI_MAX_SIZE is always safe.
+ *
+ * \return         \c 0 if the signing operation was successful.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_rsassa_pss_sign(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, unsigned char* sig);
+
+/**
+ * \brief          This function performs a public RSA operation and checks
+ *                 the message digest.
+ *
+ *                 This is the generic wrapper for performing a PKCS#1
+ *                 verification.
+ *
+ * \note           For PKCS#1 v2.1 encoding, see comments on
+ *                 mbedtls_rsa_rsassa_pss_verify() about \p md_alg and
+ *                 \p hash_id.
+ *
+ * \param ctx      The initialized RSA public key context to use.
+ * \param md_alg   The message-digest algorithm used to hash the original data.
+ *                 Use #MBEDTLS_MD_NONE for signing raw data.
+ * \param hashlen  The length of the message digest or raw data in Bytes.
+ *                 If \p md_alg is not #MBEDTLS_MD_NONE, this must match the
+ *                 output length of the corresponding hash algorithm.
+ * \param hash     The buffer holding the message digest or raw data.
+ *                 This must be a readable buffer of at least \p hashlen Bytes.
+ * \param sig      The buffer holding the signature. This must be a readable
+ *                 buffer of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ *
+ * \return         \c 0 if the verify operation was successful.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_pkcs1_verify(mbedtls_rsa_context* ctx, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, const unsigned char* sig);
+
+/**
+ * \brief          This function performs a PKCS#1 v1.5 verification
+ *                 operation (RSASSA-PKCS1-v1_5-VERIFY).
+ *
+ * \param ctx      The initialized RSA public key context to use.
+ * \param md_alg   The message-digest algorithm used to hash the original data.
+ *                 Use #MBEDTLS_MD_NONE for signing raw data.
+ * \param hashlen  The length of the message digest or raw data in Bytes.
+ *                 If \p md_alg is not #MBEDTLS_MD_NONE, this must match the
+ *                 output length of the corresponding hash algorithm.
+ * \param hash     The buffer holding the message digest or raw data.
+ *                 This must be a readable buffer of at least \p hashlen Bytes.
+ * \param sig      The buffer holding the signature. This must be a readable
+ *                 buffer of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ *
+ * \return         \c 0 if the verify operation was successful.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_rsassa_pkcs1_v15_verify(mbedtls_rsa_context* ctx, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, const unsigned char* sig);
+
+/**
+ * \brief          This function performs a PKCS#1 v2.1 PSS verification
+ *                 operation (RSASSA-PSS-VERIFY).
+ *
+ * \note           The \c hash_id set in \p ctx by calling
+ *                 mbedtls_rsa_set_padding() selects the hash used for the
+ *                 encoding operation and for the mask generation function
+ *                 (MGF1). For more details on the encoding operation and the
+ *                 mask generation function, consult <em>RFC-3447: Public-Key
+ *                 Cryptography Standards (PKCS) #1 v2.1: RSA Cryptography
+ *                 Specifications</em>. If the \c hash_id set in \p ctx by
+ *                 mbedtls_rsa_set_padding() is #MBEDTLS_MD_NONE, the \p md_alg
+ *                 parameter is used.
+ *
+ * \param ctx      The initialized RSA public key context to use.
+ * \param md_alg   The message-digest algorithm used to hash the original data.
+ *                 Use #MBEDTLS_MD_NONE for signing raw data.
+ * \param hashlen  The length of the message digest or raw data in Bytes.
+ *                 If \p md_alg is not #MBEDTLS_MD_NONE, this must match the
+ *                 output length of the corresponding hash algorithm.
+ * \param hash     The buffer holding the message digest or raw data.
+ *                 This must be a readable buffer of at least \p hashlen Bytes.
+ * \param sig      The buffer holding the signature. This must be a readable
+ *                 buffer of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ *
+ * \return         \c 0 if the verify operation was successful.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_rsassa_pss_verify(mbedtls_rsa_context* ctx, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, const unsigned char* sig);
+
+/**
+ * \brief          This function performs a PKCS#1 v2.1 PSS verification
+ *                 operation (RSASSA-PSS-VERIFY).
+ *
+ * \note           The \p sig buffer must be as large as the size
+ *                 of \p ctx->N. For example, 128 Bytes if RSA-1024 is used.
+ *
+ * \note           The \c hash_id set in \p ctx by mbedtls_rsa_set_padding() is
+ *                 ignored.
+ *
+ * \param ctx      The initialized RSA public key context to use.
+ * \param md_alg   The message-digest algorithm used to hash the original data.
+ *                 Use #MBEDTLS_MD_NONE for signing raw data.
+ * \param hashlen  The length of the message digest or raw data in Bytes.
+ *                 If \p md_alg is not #MBEDTLS_MD_NONE, this must match the
+ *                 output length of the corresponding hash algorithm.
+ * \param hash     The buffer holding the message digest or raw data.
+ *                 This must be a readable buffer of at least \p hashlen Bytes.
+ * \param mgf1_hash_id      The message digest algorithm used for the
+ *                          verification operation and the mask generation
+ *                          function (MGF1). For more details on the encoding
+ *                          operation and the mask generation function, consult
+ *                          <em>RFC-3447: Public-Key Cryptography Standards
+ *                          (PKCS) #1 v2.1: RSA Cryptography
+ *                          Specifications</em>.
+ * \param expected_salt_len The length of the salt used in padding. Use
+ *                          #MBEDTLS_RSA_SALT_LEN_ANY to accept any salt length.
+ * \param sig      The buffer holding the signature. This must be a readable
+ *                 buffer of length \c ctx->len Bytes. For example, \c 256 Bytes
+ *                 for an 2048-bit RSA modulus.
+ *
+ * \return         \c 0 if the verify operation was successful.
+ * \return         An \c MBEDTLS_ERR_RSA_XXX error code on failure.
+ */
+int mbedtls_rsa_rsassa_pss_verify_ext(mbedtls_rsa_context* ctx, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, mbedtls_md_type_t mgf1_hash_id,
+    int expected_salt_len, const unsigned char* sig);
+
+/**
+ * \brief          This function copies the components of an RSA context.
+ *
+ * \param dst      The destination context. This must be initialized.
+ * \param src      The source context. This must be initialized.
+ *
+ * \return         \c 0 on success.
+ * \return         #MBEDTLS_ERR_MPI_ALLOC_FAILED on memory allocation failure.
+ */
+int mbedtls_rsa_copy(mbedtls_rsa_context* dst, const mbedtls_rsa_context* src);
+
+/**
+ * \brief          This function frees the components of an RSA key.
+ *
+ * \param ctx      The RSA context to free. May be \c NULL, in which case
+ *                 this function is a no-op. If it is not \c NULL, it must
+ *                 point to an initialized RSA context.
+ */
+void mbedtls_rsa_free(mbedtls_rsa_context* ctx);
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/**
+ * \brief          The RSA checkup routine.
+ *
+ * \return         \c 0 on success.
+ * \return         \c 1 on failure.
+ */
+int mbedtls_rsa_self_test(int verbose);
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* rsa.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/sha1.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/sha1.h
new file mode 100644
index 0000000000..7810959c2f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/sha1.h
@@ -0,0 +1,222 @@
+/**
+ * \file sha1.h
+ *
+ * \brief This file contains SHA-1 definitions and functions.
+ *
+ * The Secure Hash Algorithm 1 (SHA-1) cryptographic hash function is defined in
+ * <em>FIPS 180-4: Secure Hash Standard (SHS)</em>.
+ *
+ * \warning   SHA-1 is considered a weak message digest and its use constitutes
+ *            a security risk. We recommend considering stronger message
+ *            digests instead.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_SHA1_H
+#define MBEDTLS_SHA1_H
+#include <stddef.h>
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/private_access.h"
+
+/** SHA-1 input data was malformed. */
+#define MBEDTLS_ERR_SHA1_BAD_INPUT_DATA -0x0073
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_SHA1_ALT)
+// Regular implementation
+//
+
+/**
+ * \brief          The SHA-1 context structure.
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ */
+typedef struct mbedtls_sha1_context {
+    uint32_t MBEDTLS_PRIVATE(total)[2];        /*!< The number of Bytes processed.  */
+    uint32_t MBEDTLS_PRIVATE(state)[5];        /*!< The intermediate digest state.  */
+    unsigned char MBEDTLS_PRIVATE(buffer)[64]; /*!< The data block being processed. */
+} mbedtls_sha1_context;
+
+#else /* MBEDTLS_SHA1_ALT */
+#include "sha1_alt.h"
+#endif /* MBEDTLS_SHA1_ALT */
+
+/**
+ * \brief          This function initializes a SHA-1 context.
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ * \param ctx      The SHA-1 context to initialize.
+ *                 This must not be \c NULL.
+ *
+ */
+void mbedtls_sha1_init(mbedtls_sha1_context* ctx);
+
+/**
+ * \brief          This function clears a SHA-1 context.
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ * \param ctx      The SHA-1 context to clear. This may be \c NULL,
+ *                 in which case this function does nothing. If it is
+ *                 not \c NULL, it must point to an initialized
+ *                 SHA-1 context.
+ *
+ */
+void mbedtls_sha1_free(mbedtls_sha1_context* ctx);
+
+/**
+ * \brief          This function clones the state of a SHA-1 context.
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ * \param dst      The SHA-1 context to clone to. This must be initialized.
+ * \param src      The SHA-1 context to clone from. This must be initialized.
+ *
+ */
+void mbedtls_sha1_clone(mbedtls_sha1_context* dst, const mbedtls_sha1_context* src);
+
+/**
+ * \brief          This function starts a SHA-1 checksum calculation.
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ * \param ctx      The SHA-1 context to initialize. This must be initialized.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ *
+ */
+int mbedtls_sha1_starts(mbedtls_sha1_context* ctx);
+
+/**
+ * \brief          This function feeds an input buffer into an ongoing SHA-1
+ *                 checksum calculation.
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ * \param ctx      The SHA-1 context. This must be initialized
+ *                 and have a hash operation started.
+ * \param input    The buffer holding the input data.
+ *                 This must be a readable buffer of length \p ilen Bytes.
+ * \param ilen     The length of the input data \p input in Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha1_update(mbedtls_sha1_context* ctx, const unsigned char* input, size_t ilen);
+
+/**
+ * \brief          This function finishes the SHA-1 operation, and writes
+ *                 the result to the output buffer.
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ * \param ctx      The SHA-1 context to use. This must be initialized and
+ *                 have a hash operation started.
+ * \param output   The SHA-1 checksum result. This must be a writable
+ *                 buffer of length \c 20 Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha1_finish(mbedtls_sha1_context* ctx, unsigned char output[20]);
+
+/**
+ * \brief          SHA-1 process data block (internal use only).
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ * \param ctx      The SHA-1 context to use. This must be initialized.
+ * \param data     The data block being processed. This must be a
+ *                 readable buffer of length \c 64 Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ *
+ */
+int mbedtls_internal_sha1_process(mbedtls_sha1_context* ctx, const unsigned char data[64]);
+
+/**
+ * \brief          This function calculates the SHA-1 checksum of a buffer.
+ *
+ *                 The function allocates the context, performs the
+ *                 calculation, and frees the context.
+ *
+ *                 The SHA-1 result is calculated as
+ *                 output = SHA-1(input buffer).
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ * \param input    The buffer holding the input data.
+ *                 This must be a readable buffer of length \p ilen Bytes.
+ * \param ilen     The length of the input data \p input in Bytes.
+ * \param output   The SHA-1 checksum result.
+ *                 This must be a writable buffer of length \c 20 Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ *
+ */
+int mbedtls_sha1(const unsigned char* input, size_t ilen, unsigned char output[20]);
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/**
+ * \brief          The SHA-1 checkup routine.
+ *
+ * \warning        SHA-1 is considered a weak message digest and its use
+ *                 constitutes a security risk. We recommend considering
+ *                 stronger message digests instead.
+ *
+ * \return         \c 0 on success.
+ * \return         \c 1 on failure.
+ *
+ */
+int mbedtls_sha1_self_test(int verbose);
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* mbedtls_sha1.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/sha256.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/sha256.h
new file mode 100644
index 0000000000..4b557d56ab
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/sha256.h
@@ -0,0 +1,184 @@
+/**
+ * \file sha256.h
+ *
+ * \brief This file contains SHA-224 and SHA-256 definitions and functions.
+ *
+ * The Secure Hash Algorithms 224 and 256 (SHA-224 and SHA-256) cryptographic
+ * hash functions are defined in <em>FIPS 180-4: Secure Hash Standard (SHS)</em>.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_SHA256_H
+#define MBEDTLS_SHA256_H
+#include <stddef.h>
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/private_access.h"
+
+/** SHA-256 input data was malformed. */
+#define MBEDTLS_ERR_SHA256_BAD_INPUT_DATA -0x0074
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_SHA256_ALT)
+// Regular implementation
+//
+
+/**
+ * \brief          The SHA-256 context structure.
+ *
+ *                 The structure is used both for SHA-256 and for SHA-224
+ *                 checksum calculations. The choice between these two is
+ *                 made in the call to mbedtls_sha256_starts().
+ */
+typedef struct mbedtls_sha256_context {
+    uint32_t MBEDTLS_PRIVATE(total)[2];        /*!< The number of Bytes processed.  */
+    uint32_t MBEDTLS_PRIVATE(state)[8];        /*!< The intermediate digest state.  */
+    unsigned char MBEDTLS_PRIVATE(buffer)[64]; /*!< The data block being processed. */
+    int MBEDTLS_PRIVATE(is224);                /*!< Determines which function to use:
+                                   0: Use SHA-256, or 1: Use SHA-224. */
+} mbedtls_sha256_context;
+
+#else /* MBEDTLS_SHA256_ALT */
+#include "sha256_alt.h"
+#endif /* MBEDTLS_SHA256_ALT */
+
+/**
+ * \brief          This function initializes a SHA-256 context.
+ *
+ * \param ctx      The SHA-256 context to initialize. This must not be \c NULL.
+ */
+void mbedtls_sha256_init(mbedtls_sha256_context* ctx);
+
+/**
+ * \brief          This function clears a SHA-256 context.
+ *
+ * \param ctx      The SHA-256 context to clear. This may be \c NULL, in which
+ *                 case this function returns immediately. If it is not \c NULL,
+ *                 it must point to an initialized SHA-256 context.
+ */
+void mbedtls_sha256_free(mbedtls_sha256_context* ctx);
+
+/**
+ * \brief          This function clones the state of a SHA-256 context.
+ *
+ * \param dst      The destination context. This must be initialized.
+ * \param src      The context to clone. This must be initialized.
+ */
+void mbedtls_sha256_clone(mbedtls_sha256_context* dst, const mbedtls_sha256_context* src);
+
+/**
+ * \brief          This function starts a SHA-224 or SHA-256 checksum
+ *                 calculation.
+ *
+ * \param ctx      The context to use. This must be initialized.
+ * \param is224    This determines which function to use. This must be
+ *                 either \c 0 for SHA-256, or \c 1 for SHA-224.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha256_starts(mbedtls_sha256_context* ctx, int is224);
+
+/**
+ * \brief          This function feeds an input buffer into an ongoing
+ *                 SHA-256 checksum calculation.
+ *
+ * \param ctx      The SHA-256 context. This must be initialized
+ *                 and have a hash operation started.
+ * \param input    The buffer holding the data. This must be a readable
+ *                 buffer of length \p ilen Bytes.
+ * \param ilen     The length of the input data in Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha256_update(mbedtls_sha256_context* ctx, const unsigned char* input, size_t ilen);
+
+/**
+ * \brief          This function finishes the SHA-256 operation, and writes
+ *                 the result to the output buffer.
+ *
+ * \param ctx      The SHA-256 context. This must be initialized
+ *                 and have a hash operation started.
+ * \param output   The SHA-224 or SHA-256 checksum result.
+ *                 This must be a writable buffer of length \c 32 bytes
+ *                 for SHA-256, \c 28 bytes for SHA-224.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha256_finish(mbedtls_sha256_context* ctx, unsigned char* output);
+
+/**
+ * \brief          This function processes a single data block within
+ *                 the ongoing SHA-256 computation. This function is for
+ *                 internal use only.
+ *
+ * \param ctx      The SHA-256 context. This must be initialized.
+ * \param data     The buffer holding one block of data. This must
+ *                 be a readable buffer of length \c 64 Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_internal_sha256_process(mbedtls_sha256_context* ctx, const unsigned char data[64]);
+
+/**
+ * \brief          This function calculates the SHA-224 or SHA-256
+ *                 checksum of a buffer.
+ *
+ *                 The function allocates the context, performs the
+ *                 calculation, and frees the context.
+ *
+ *                 The SHA-256 result is calculated as
+ *                 output = SHA-256(input buffer).
+ *
+ * \param input    The buffer holding the data. This must be a readable
+ *                 buffer of length \p ilen Bytes.
+ * \param ilen     The length of the input data in Bytes.
+ * \param output   The SHA-224 or SHA-256 checksum result.
+ *                 This must be a writable buffer of length \c 32 bytes
+ *                 for SHA-256, \c 28 bytes for SHA-224.
+ * \param is224    Determines which function to use. This must be
+ *                 either \c 0 for SHA-256, or \c 1 for SHA-224.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha256(const unsigned char* input, size_t ilen, unsigned char* output, int is224);
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/**
+ * \brief          The SHA-224 and SHA-256 checkup routine.
+ *
+ * \return         \c 0 on success.
+ * \return         \c 1 on failure.
+ */
+int mbedtls_sha256_self_test(int verbose);
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* mbedtls_sha256.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/sha512.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/sha512.h
new file mode 100644
index 0000000000..a637aa25a5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/include/mbedtls/sha512.h
@@ -0,0 +1,194 @@
+/**
+ * \file sha512.h
+ * \brief This file contains SHA-384 and SHA-512 definitions and functions.
+ *
+ * The Secure Hash Algorithms 384 and 512 (SHA-384 and SHA-512) cryptographic
+ * hash functions are defined in <em>FIPS 180-4: Secure Hash Standard (SHS)</em>.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_SHA512_H
+#define MBEDTLS_SHA512_H
+#include <stddef.h>
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/private_access.h"
+
+/** SHA-512 input data was malformed. */
+#define MBEDTLS_ERR_SHA512_BAD_INPUT_DATA -0x0075
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined(MBEDTLS_SHA512_ALT)
+// Regular implementation
+//
+
+/**
+ * \brief          The SHA-512 context structure.
+ *
+ *                 The structure is used both for SHA-384 and for SHA-512
+ *                 checksum calculations. The choice between these two is
+ *                 made in the call to mbedtls_sha512_starts().
+ */
+typedef struct mbedtls_sha512_context {
+    uint64_t MBEDTLS_PRIVATE(total)[2];         /*!< The number of Bytes processed. */
+    uint64_t MBEDTLS_PRIVATE(state)[8];         /*!< The intermediate digest state. */
+    unsigned char MBEDTLS_PRIVATE(buffer)[128]; /*!< The data block being processed. */
+#if defined(MBEDTLS_SHA384_C)
+    int MBEDTLS_PRIVATE(is384); /*!< Determines which function to use:
+                                     0: Use SHA-512, or 1: Use SHA-384. */
+#endif
+} mbedtls_sha512_context;
+
+#else /* MBEDTLS_SHA512_ALT */
+#include "sha512_alt.h"
+#endif /* MBEDTLS_SHA512_ALT */
+
+/**
+ * \brief          This function initializes a SHA-512 context.
+ *
+ * \param ctx      The SHA-512 context to initialize. This must
+ *                 not be \c NULL.
+ */
+void mbedtls_sha512_init(mbedtls_sha512_context* ctx);
+
+/**
+ * \brief          This function clears a SHA-512 context.
+ *
+ * \param ctx      The SHA-512 context to clear. This may be \c NULL,
+ *                 in which case this function does nothing. If it
+ *                 is not \c NULL, it must point to an initialized
+ *                 SHA-512 context.
+ */
+void mbedtls_sha512_free(mbedtls_sha512_context* ctx);
+
+/**
+ * \brief          This function clones the state of a SHA-512 context.
+ *
+ * \param dst      The destination context. This must be initialized.
+ * \param src      The context to clone. This must be initialized.
+ */
+void mbedtls_sha512_clone(mbedtls_sha512_context* dst, const mbedtls_sha512_context* src);
+
+/**
+ * \brief          This function starts a SHA-384 or SHA-512 checksum
+ *                 calculation.
+ *
+ * \param ctx      The SHA-512 context to use. This must be initialized.
+ * \param is384    Determines which function to use. This must be
+ *                 either \c 0 for SHA-512, or \c 1 for SHA-384.
+ *
+ * \note           When \c MBEDTLS_SHA384_C is not defined,
+ *                 \p is384 must be \c 0, or the function will return
+ *                 #MBEDTLS_ERR_SHA512_BAD_INPUT_DATA.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha512_starts(mbedtls_sha512_context* ctx, int is384);
+
+/**
+ * \brief          This function feeds an input buffer into an ongoing
+ *                 SHA-512 checksum calculation.
+ *
+ * \param ctx      The SHA-512 context. This must be initialized
+ *                 and have a hash operation started.
+ * \param input    The buffer holding the input data. This must
+ *                 be a readable buffer of length \p ilen Bytes.
+ * \param ilen     The length of the input data in Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha512_update(mbedtls_sha512_context* ctx, const unsigned char* input, size_t ilen);
+
+/**
+ * \brief          This function finishes the SHA-512 operation, and writes
+ *                 the result to the output buffer.
+ *
+ * \param ctx      The SHA-512 context. This must be initialized
+ *                 and have a hash operation started.
+ * \param output   The SHA-384 or SHA-512 checksum result.
+ *                 This must be a writable buffer of length \c 64 bytes
+ *                 for SHA-512, \c 48 bytes for SHA-384.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha512_finish(mbedtls_sha512_context* ctx, unsigned char* output);
+
+/**
+ * \brief          This function processes a single data block within
+ *                 the ongoing SHA-512 computation.
+ *                 This function is for internal use only.
+ *
+ * \param ctx      The SHA-512 context. This must be initialized.
+ * \param data     The buffer holding one block of data. This
+ *                 must be a readable buffer of length \c 128 Bytes.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_internal_sha512_process(mbedtls_sha512_context* ctx, const unsigned char data[128]);
+
+/**
+ * \brief          This function calculates the SHA-512 or SHA-384
+ *                 checksum of a buffer.
+ *
+ *                 The function allocates the context, performs the
+ *                 calculation, and frees the context.
+ *
+ *                 The SHA-512 result is calculated as
+ *                 output = SHA-512(input buffer).
+ *
+ * \param input    The buffer holding the input data. This must be
+ *                 a readable buffer of length \p ilen Bytes.
+ * \param ilen     The length of the input data in Bytes.
+ * \param output   The SHA-384 or SHA-512 checksum result.
+ *                 This must be a writable buffer of length \c 64 bytes
+ *                 for SHA-512, \c 48 bytes for SHA-384.
+ * \param is384    Determines which function to use. This must be either
+ *                 \c 0 for SHA-512, or \c 1 for SHA-384.
+ *
+ * \note           When \c MBEDTLS_SHA384_C is not defined, \p is384 must
+ *                 be \c 0, or the function will return
+ *                 #MBEDTLS_ERR_SHA512_BAD_INPUT_DATA.
+ *
+ * \return         \c 0 on success.
+ * \return         A negative error code on failure.
+ */
+int mbedtls_sha512(const unsigned char* input, size_t ilen, unsigned char* output, int is384);
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/**
+ * \brief          The SHA-384 or SHA-512 checkup routine.
+ *
+ * \return         \c 0 on success.
+ * \return         \c 1 on failure.
+ */
+int mbedtls_sha512_self_test(int verbose);
+#endif /* MBEDTLS_SELF_TEST */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* mbedtls_sha512.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/aes.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/aes.cpp
new file mode 100644
index 0000000000..f587949140
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/aes.cpp
@@ -0,0 +1,1872 @@
+/*
+ *  FIPS-197 compliant AES implementation
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+/*
+ *  The AES block cipher was designed by Vincent Rijmen and Joan Daemen.
+ *
+ *  http://csrc.nist.gov/encryption/aes/rijndael/Rijndael.pdf
+ *  http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_AES_C)
+
+#include <string.h>
+
+#include "mbedtls/aes.h"
+#include "mbedtls/error.h"
+#include "mbedtls/platform.h"
+#include "mbedtls/platform_util.h"
+#if defined(MBEDTLS_PADLOCK_C)
+#include "padlock.h"
+#endif
+#if defined(MBEDTLS_AESNI_C)
+#include "aesni.h"
+#endif
+
+#if defined(MBEDTLS_SELF_TEST)
+// #if defined(MBEDTLS_PLATFORM_C)
+// #include "mbedtls/platform.h"
+// #else
+// #include <stdio.h>
+// #define mbedtls_printf printf
+// #endif /* MBEDTLS_PLATFORM_C */
+#endif /* MBEDTLS_SELF_TEST */
+
+#if !defined(MBEDTLS_AES_ALT)
+
+/* Parameter validation macros based on platform_util.h */
+#define AES_VALIDATE_RET(cond) MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_AES_BAD_INPUT_DATA)
+#define AES_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+#if defined(MBEDTLS_PADLOCK_C) && (defined(MBEDTLS_HAVE_X86) || defined(MBEDTLS_PADLOCK_ALIGN16))
+static int aes_padlock_ace = -1;
+#endif
+
+#if defined(MBEDTLS_AES_ROM_TABLES)
+/*
+ * Forward S-box
+ */
+static const unsigned char AESFSb[256] = {0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30,
+    0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76, 0xCA, 0x82, 0xC9, 0x7D, 0xFA, 0x59, 0x47, 0xF0, 0xAD,
+    0xD4, 0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0, 0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34,
+    0xA5, 0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15, 0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07,
+    0x12, 0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75, 0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52,
+    0x3B, 0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84, 0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A,
+    0xCB, 0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF, 0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45,
+    0xF9, 0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8, 0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC,
+    0xB6, 0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2, 0xCD, 0x0C, 0x13, 0xEC, 0x5F, 0x97, 0x44, 0x17, 0xC4,
+    0xA7, 0x7E, 0x3D, 0x64, 0x5D, 0x19, 0x73, 0x60, 0x81, 0x4F, 0xDC, 0x22, 0x2A, 0x90, 0x88, 0x46,
+    0xEE, 0xB8, 0x14, 0xDE, 0x5E, 0x0B, 0xDB, 0xE0, 0x32, 0x3A, 0x0A, 0x49, 0x06, 0x24, 0x5C, 0xC2,
+    0xD3, 0xAC, 0x62, 0x91, 0x95, 0xE4, 0x79, 0xE7, 0xC8, 0x37, 0x6D, 0x8D, 0xD5, 0x4E, 0xA9, 0x6C,
+    0x56, 0xF4, 0xEA, 0x65, 0x7A, 0xAE, 0x08, 0xBA, 0x78, 0x25, 0x2E, 0x1C, 0xA6, 0xB4, 0xC6, 0xE8,
+    0xDD, 0x74, 0x1F, 0x4B, 0xBD, 0x8B, 0x8A, 0x70, 0x3E, 0xB5, 0x66, 0x48, 0x03, 0xF6, 0x0E, 0x61,
+    0x35, 0x57, 0xB9, 0x86, 0xC1, 0x1D, 0x9E, 0xE1, 0xF8, 0x98, 0x11, 0x69, 0xD9, 0x8E, 0x94, 0x9B,
+    0x1E, 0x87, 0xE9, 0xCE, 0x55, 0x28, 0xDF, 0x8C, 0xA1, 0x89, 0x0D, 0xBF, 0xE6, 0x42, 0x68, 0x41,
+    0x99, 0x2D, 0x0F, 0xB0, 0x54, 0xBB, 0x16};
+
+/*
+ * Forward tables
+ */
+#define FT                                                                                         \
+                                                                                                   \
+    V(A5, 63, 63, C6), V(84, 7C, 7C, F8), V(99, 77, 77, EE), V(8D, 7B, 7B, F6), V(0D, F2, F2, FF), \
+        V(BD, 6B, 6B, D6), V(B1, 6F, 6F, DE), V(54, C5, C5, 91), V(50, 30, 30, 60),                \
+        V(03, 01, 01, 02), V(A9, 67, 67, CE), V(7D, 2B, 2B, 56), V(19, FE, FE, E7),                \
+        V(62, D7, D7, B5), V(E6, AB, AB, 4D), V(9A, 76, 76, EC), V(45, CA, CA, 8F),                \
+        V(9D, 82, 82, 1F), V(40, C9, C9, 89), V(87, 7D, 7D, FA), V(15, FA, FA, EF),                \
+        V(EB, 59, 59, B2), V(C9, 47, 47, 8E), V(0B, F0, F0, FB), V(EC, AD, AD, 41),                \
+        V(67, D4, D4, B3), V(FD, A2, A2, 5F), V(EA, AF, AF, 45), V(BF, 9C, 9C, 23),                \
+        V(F7, A4, A4, 53), V(96, 72, 72, E4), V(5B, C0, C0, 9B), V(C2, B7, B7, 75),                \
+        V(1C, FD, FD, E1), V(AE, 93, 93, 3D), V(6A, 26, 26, 4C), V(5A, 36, 36, 6C),                \
+        V(41, 3F, 3F, 7E), V(02, F7, F7, F5), V(4F, CC, CC, 83), V(5C, 34, 34, 68),                \
+        V(F4, A5, A5, 51), V(34, E5, E5, D1), V(08, F1, F1, F9), V(93, 71, 71, E2),                \
+        V(73, D8, D8, AB), V(53, 31, 31, 62), V(3F, 15, 15, 2A), V(0C, 04, 04, 08),                \
+        V(52, C7, C7, 95), V(65, 23, 23, 46), V(5E, C3, C3, 9D), V(28, 18, 18, 30),                \
+        V(A1, 96, 96, 37), V(0F, 05, 05, 0A), V(B5, 9A, 9A, 2F), V(09, 07, 07, 0E),                \
+        V(36, 12, 12, 24), V(9B, 80, 80, 1B), V(3D, E2, E2, DF), V(26, EB, EB, CD),                \
+        V(69, 27, 27, 4E), V(CD, B2, B2, 7F), V(9F, 75, 75, EA), V(1B, 09, 09, 12),                \
+        V(9E, 83, 83, 1D), V(74, 2C, 2C, 58), V(2E, 1A, 1A, 34), V(2D, 1B, 1B, 36),                \
+        V(B2, 6E, 6E, DC), V(EE, 5A, 5A, B4), V(FB, A0, A0, 5B), V(F6, 52, 52, A4),                \
+        V(4D, 3B, 3B, 76), V(61, D6, D6, B7), V(CE, B3, B3, 7D), V(7B, 29, 29, 52),                \
+        V(3E, E3, E3, DD), V(71, 2F, 2F, 5E), V(97, 84, 84, 13), V(F5, 53, 53, A6),                \
+        V(68, D1, D1, B9), V(00, 00, 00, 00), V(2C, ED, ED, C1), V(60, 20, 20, 40),                \
+        V(1F, FC, FC, E3), V(C8, B1, B1, 79), V(ED, 5B, 5B, B6), V(BE, 6A, 6A, D4),                \
+        V(46, CB, CB, 8D), V(D9, BE, BE, 67), V(4B, 39, 39, 72), V(DE, 4A, 4A, 94),                \
+        V(D4, 4C, 4C, 98), V(E8, 58, 58, B0), V(4A, CF, CF, 85), V(6B, D0, D0, BB),                \
+        V(2A, EF, EF, C5), V(E5, AA, AA, 4F), V(16, FB, FB, ED), V(C5, 43, 43, 86),                \
+        V(D7, 4D, 4D, 9A), V(55, 33, 33, 66), V(94, 85, 85, 11), V(CF, 45, 45, 8A),                \
+        V(10, F9, F9, E9), V(06, 02, 02, 04), V(81, 7F, 7F, FE), V(F0, 50, 50, A0),                \
+        V(44, 3C, 3C, 78), V(BA, 9F, 9F, 25), V(E3, A8, A8, 4B), V(F3, 51, 51, A2),                \
+        V(FE, A3, A3, 5D), V(C0, 40, 40, 80), V(8A, 8F, 8F, 05), V(AD, 92, 92, 3F),                \
+        V(BC, 9D, 9D, 21), V(48, 38, 38, 70), V(04, F5, F5, F1), V(DF, BC, BC, 63),                \
+        V(C1, B6, B6, 77), V(75, DA, DA, AF), V(63, 21, 21, 42), V(30, 10, 10, 20),                \
+        V(1A, FF, FF, E5), V(0E, F3, F3, FD), V(6D, D2, D2, BF), V(4C, CD, CD, 81),                \
+        V(14, 0C, 0C, 18), V(35, 13, 13, 26), V(2F, EC, EC, C3), V(E1, 5F, 5F, BE),                \
+        V(A2, 97, 97, 35), V(CC, 44, 44, 88), V(39, 17, 17, 2E), V(57, C4, C4, 93),                \
+        V(F2, A7, A7, 55), V(82, 7E, 7E, FC), V(47, 3D, 3D, 7A), V(AC, 64, 64, C8),                \
+        V(E7, 5D, 5D, BA), V(2B, 19, 19, 32), V(95, 73, 73, E6), V(A0, 60, 60, C0),                \
+        V(98, 81, 81, 19), V(D1, 4F, 4F, 9E), V(7F, DC, DC, A3), V(66, 22, 22, 44),                \
+        V(7E, 2A, 2A, 54), V(AB, 90, 90, 3B), V(83, 88, 88, 0B), V(CA, 46, 46, 8C),                \
+        V(29, EE, EE, C7), V(D3, B8, B8, 6B), V(3C, 14, 14, 28), V(79, DE, DE, A7),                \
+        V(E2, 5E, 5E, BC), V(1D, 0B, 0B, 16), V(76, DB, DB, AD), V(3B, E0, E0, DB),                \
+        V(56, 32, 32, 64), V(4E, 3A, 3A, 74), V(1E, 0A, 0A, 14), V(DB, 49, 49, 92),                \
+        V(0A, 06, 06, 0C), V(6C, 24, 24, 48), V(E4, 5C, 5C, B8), V(5D, C2, C2, 9F),                \
+        V(6E, D3, D3, BD), V(EF, AC, AC, 43), V(A6, 62, 62, C4), V(A8, 91, 91, 39),                \
+        V(A4, 95, 95, 31), V(37, E4, E4, D3), V(8B, 79, 79, F2), V(32, E7, E7, D5),                \
+        V(43, C8, C8, 8B), V(59, 37, 37, 6E), V(B7, 6D, 6D, DA), V(8C, 8D, 8D, 01),                \
+        V(64, D5, D5, B1), V(D2, 4E, 4E, 9C), V(E0, A9, A9, 49), V(B4, 6C, 6C, D8),                \
+        V(FA, 56, 56, AC), V(07, F4, F4, F3), V(25, EA, EA, CF), V(AF, 65, 65, CA),                \
+        V(8E, 7A, 7A, F4), V(E9, AE, AE, 47), V(18, 08, 08, 10), V(D5, BA, BA, 6F),                \
+        V(88, 78, 78, F0), V(6F, 25, 25, 4A), V(72, 2E, 2E, 5C), V(24, 1C, 1C, 38),                \
+        V(F1, A6, A6, 57), V(C7, B4, B4, 73), V(51, C6, C6, 97), V(23, E8, E8, CB),                \
+        V(7C, DD, DD, A1), V(9C, 74, 74, E8), V(21, 1F, 1F, 3E), V(DD, 4B, 4B, 96),                \
+        V(DC, BD, BD, 61), V(86, 8B, 8B, 0D), V(85, 8A, 8A, 0F), V(90, 70, 70, E0),                \
+        V(42, 3E, 3E, 7C), V(C4, B5, B5, 71), V(AA, 66, 66, CC), V(D8, 48, 48, 90),                \
+        V(05, 03, 03, 06), V(01, F6, F6, F7), V(12, 0E, 0E, 1C), V(A3, 61, 61, C2),                \
+        V(5F, 35, 35, 6A), V(F9, 57, 57, AE), V(D0, B9, B9, 69), V(91, 86, 86, 17),                \
+        V(58, C1, C1, 99), V(27, 1D, 1D, 3A), V(B9, 9E, 9E, 27), V(38, E1, E1, D9),                \
+        V(13, F8, F8, EB), V(B3, 98, 98, 2B), V(33, 11, 11, 22), V(BB, 69, 69, D2),                \
+        V(70, D9, D9, A9), V(89, 8E, 8E, 07), V(A7, 94, 94, 33), V(B6, 9B, 9B, 2D),                \
+        V(22, 1E, 1E, 3C), V(92, 87, 87, 15), V(20, E9, E9, C9), V(49, CE, CE, 87),                \
+        V(FF, 55, 55, AA), V(78, 28, 28, 50), V(7A, DF, DF, A5), V(8F, 8C, 8C, 03),                \
+        V(F8, A1, A1, 59), V(80, 89, 89, 09), V(17, 0D, 0D, 1A), V(DA, BF, BF, 65),                \
+        V(31, E6, E6, D7), V(C6, 42, 42, 84), V(B8, 68, 68, D0), V(C3, 41, 41, 82),                \
+        V(B0, 99, 99, 29), V(77, 2D, 2D, 5A), V(11, 0F, 0F, 1E), V(CB, B0, B0, 7B),                \
+        V(FC, 54, 54, A8), V(D6, BB, BB, 6D), V(3A, 16, 16, 2C)
+
+#define V(a, b, c, d) 0x##a##b##c##d
+static const uint32_t FT0[256] = {FT};
+#undef V
+
+#if !defined(MBEDTLS_AES_FEWER_TABLES)
+
+#define V(a, b, c, d) 0x##b##c##d##a
+static const uint32_t FT1[256] = {FT};
+#undef V
+
+#define V(a, b, c, d) 0x##c##d##a##b
+static const uint32_t FT2[256] = {FT};
+#undef V
+
+#define V(a, b, c, d) 0x##d##a##b##c
+static const uint32_t FT3[256] = {FT};
+#undef V
+
+#endif /* !MBEDTLS_AES_FEWER_TABLES */
+
+#undef FT
+
+/*
+ * Reverse S-box
+ */
+static const unsigned char RSb[256] = {0x52, 0x09, 0x6A, 0xD5, 0x30, 0x36, 0xA5, 0x38, 0xBF, 0x40,
+    0xA3, 0x9E, 0x81, 0xF3, 0xD7, 0xFB, 0x7C, 0xE3, 0x39, 0x82, 0x9B, 0x2F, 0xFF, 0x87, 0x34, 0x8E,
+    0x43, 0x44, 0xC4, 0xDE, 0xE9, 0xCB, 0x54, 0x7B, 0x94, 0x32, 0xA6, 0xC2, 0x23, 0x3D, 0xEE, 0x4C,
+    0x95, 0x0B, 0x42, 0xFA, 0xC3, 0x4E, 0x08, 0x2E, 0xA1, 0x66, 0x28, 0xD9, 0x24, 0xB2, 0x76, 0x5B,
+    0xA2, 0x49, 0x6D, 0x8B, 0xD1, 0x25, 0x72, 0xF8, 0xF6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xD4, 0xA4,
+    0x5C, 0xCC, 0x5D, 0x65, 0xB6, 0x92, 0x6C, 0x70, 0x48, 0x50, 0xFD, 0xED, 0xB9, 0xDA, 0x5E, 0x15,
+    0x46, 0x57, 0xA7, 0x8D, 0x9D, 0x84, 0x90, 0xD8, 0xAB, 0x00, 0x8C, 0xBC, 0xD3, 0x0A, 0xF7, 0xE4,
+    0x58, 0x05, 0xB8, 0xB3, 0x45, 0x06, 0xD0, 0x2C, 0x1E, 0x8F, 0xCA, 0x3F, 0x0F, 0x02, 0xC1, 0xAF,
+    0xBD, 0x03, 0x01, 0x13, 0x8A, 0x6B, 0x3A, 0x91, 0x11, 0x41, 0x4F, 0x67, 0xDC, 0xEA, 0x97, 0xF2,
+    0xCF, 0xCE, 0xF0, 0xB4, 0xE6, 0x73, 0x96, 0xAC, 0x74, 0x22, 0xE7, 0xAD, 0x35, 0x85, 0xE2, 0xF9,
+    0x37, 0xE8, 0x1C, 0x75, 0xDF, 0x6E, 0x47, 0xF1, 0x1A, 0x71, 0x1D, 0x29, 0xC5, 0x89, 0x6F, 0xB7,
+    0x62, 0x0E, 0xAA, 0x18, 0xBE, 0x1B, 0xFC, 0x56, 0x3E, 0x4B, 0xC6, 0xD2, 0x79, 0x20, 0x9A, 0xDB,
+    0xC0, 0xFE, 0x78, 0xCD, 0x5A, 0xF4, 0x1F, 0xDD, 0xA8, 0x33, 0x88, 0x07, 0xC7, 0x31, 0xB1, 0x12,
+    0x10, 0x59, 0x27, 0x80, 0xEC, 0x5F, 0x60, 0x51, 0x7F, 0xA9, 0x19, 0xB5, 0x4A, 0x0D, 0x2D, 0xE5,
+    0x7A, 0x9F, 0x93, 0xC9, 0x9C, 0xEF, 0xA0, 0xE0, 0x3B, 0x4D, 0xAE, 0x2A, 0xF5, 0xB0, 0xC8, 0xEB,
+    0xBB, 0x3C, 0x83, 0x53, 0x99, 0x61, 0x17, 0x2B, 0x04, 0x7E, 0xBA, 0x77, 0xD6, 0x26, 0xE1, 0x69,
+    0x14, 0x63, 0x55, 0x21, 0x0C, 0x7D};
+
+/*
+ * Reverse tables
+ */
+#define RT                                                                                         \
+                                                                                                   \
+    V(50, A7, F4, 51), V(53, 65, 41, 7E), V(C3, A4, 17, 1A), V(96, 5E, 27, 3A), V(CB, 6B, AB, 3B), \
+        V(F1, 45, 9D, 1F), V(AB, 58, FA, AC), V(93, 03, E3, 4B), V(55, FA, 30, 20),                \
+        V(F6, 6D, 76, AD), V(91, 76, CC, 88), V(25, 4C, 02, F5), V(FC, D7, E5, 4F),                \
+        V(D7, CB, 2A, C5), V(80, 44, 35, 26), V(8F, A3, 62, B5), V(49, 5A, B1, DE),                \
+        V(67, 1B, BA, 25), V(98, 0E, EA, 45), V(E1, C0, FE, 5D), V(02, 75, 2F, C3),                \
+        V(12, F0, 4C, 81), V(A3, 97, 46, 8D), V(C6, F9, D3, 6B), V(E7, 5F, 8F, 03),                \
+        V(95, 9C, 92, 15), V(EB, 7A, 6D, BF), V(DA, 59, 52, 95), V(2D, 83, BE, D4),                \
+        V(D3, 21, 74, 58), V(29, 69, E0, 49), V(44, C8, C9, 8E), V(6A, 89, C2, 75),                \
+        V(78, 79, 8E, F4), V(6B, 3E, 58, 99), V(DD, 71, B9, 27), V(B6, 4F, E1, BE),                \
+        V(17, AD, 88, F0), V(66, AC, 20, C9), V(B4, 3A, CE, 7D), V(18, 4A, DF, 63),                \
+        V(82, 31, 1A, E5), V(60, 33, 51, 97), V(45, 7F, 53, 62), V(E0, 77, 64, B1),                \
+        V(84, AE, 6B, BB), V(1C, A0, 81, FE), V(94, 2B, 08, F9), V(58, 68, 48, 70),                \
+        V(19, FD, 45, 8F), V(87, 6C, DE, 94), V(B7, F8, 7B, 52), V(23, D3, 73, AB),                \
+        V(E2, 02, 4B, 72), V(57, 8F, 1F, E3), V(2A, AB, 55, 66), V(07, 28, EB, B2),                \
+        V(03, C2, B5, 2F), V(9A, 7B, C5, 86), V(A5, 08, 37, D3), V(F2, 87, 28, 30),                \
+        V(B2, A5, BF, 23), V(BA, 6A, 03, 02), V(5C, 82, 16, ED), V(2B, 1C, CF, 8A),                \
+        V(92, B4, 79, A7), V(F0, F2, 07, F3), V(A1, E2, 69, 4E), V(CD, F4, DA, 65),                \
+        V(D5, BE, 05, 06), V(1F, 62, 34, D1), V(8A, FE, A6, C4), V(9D, 53, 2E, 34),                \
+        V(A0, 55, F3, A2), V(32, E1, 8A, 05), V(75, EB, F6, A4), V(39, EC, 83, 0B),                \
+        V(AA, EF, 60, 40), V(06, 9F, 71, 5E), V(51, 10, 6E, BD), V(F9, 8A, 21, 3E),                \
+        V(3D, 06, DD, 96), V(AE, 05, 3E, DD), V(46, BD, E6, 4D), V(B5, 8D, 54, 91),                \
+        V(05, 5D, C4, 71), V(6F, D4, 06, 04), V(FF, 15, 50, 60), V(24, FB, 98, 19),                \
+        V(97, E9, BD, D6), V(CC, 43, 40, 89), V(77, 9E, D9, 67), V(BD, 42, E8, B0),                \
+        V(88, 8B, 89, 07), V(38, 5B, 19, E7), V(DB, EE, C8, 79), V(47, 0A, 7C, A1),                \
+        V(E9, 0F, 42, 7C), V(C9, 1E, 84, F8), V(00, 00, 00, 00), V(83, 86, 80, 09),                \
+        V(48, ED, 2B, 32), V(AC, 70, 11, 1E), V(4E, 72, 5A, 6C), V(FB, FF, 0E, FD),                \
+        V(56, 38, 85, 0F), V(1E, D5, AE, 3D), V(27, 39, 2D, 36), V(64, D9, 0F, 0A),                \
+        V(21, A6, 5C, 68), V(D1, 54, 5B, 9B), V(3A, 2E, 36, 24), V(B1, 67, 0A, 0C),                \
+        V(0F, E7, 57, 93), V(D2, 96, EE, B4), V(9E, 91, 9B, 1B), V(4F, C5, C0, 80),                \
+        V(A2, 20, DC, 61), V(69, 4B, 77, 5A), V(16, 1A, 12, 1C), V(0A, BA, 93, E2),                \
+        V(E5, 2A, A0, C0), V(43, E0, 22, 3C), V(1D, 17, 1B, 12), V(0B, 0D, 09, 0E),                \
+        V(AD, C7, 8B, F2), V(B9, A8, B6, 2D), V(C8, A9, 1E, 14), V(85, 19, F1, 57),                \
+        V(4C, 07, 75, AF), V(BB, DD, 99, EE), V(FD, 60, 7F, A3), V(9F, 26, 01, F7),                \
+        V(BC, F5, 72, 5C), V(C5, 3B, 66, 44), V(34, 7E, FB, 5B), V(76, 29, 43, 8B),                \
+        V(DC, C6, 23, CB), V(68, FC, ED, B6), V(63, F1, E4, B8), V(CA, DC, 31, D7),                \
+        V(10, 85, 63, 42), V(40, 22, 97, 13), V(20, 11, C6, 84), V(7D, 24, 4A, 85),                \
+        V(F8, 3D, BB, D2), V(11, 32, F9, AE), V(6D, A1, 29, C7), V(4B, 2F, 9E, 1D),                \
+        V(F3, 30, B2, DC), V(EC, 52, 86, 0D), V(D0, E3, C1, 77), V(6C, 16, B3, 2B),                \
+        V(99, B9, 70, A9), V(FA, 48, 94, 11), V(22, 64, E9, 47), V(C4, 8C, FC, A8),                \
+        V(1A, 3F, F0, A0), V(D8, 2C, 7D, 56), V(EF, 90, 33, 22), V(C7, 4E, 49, 87),                \
+        V(C1, D1, 38, D9), V(FE, A2, CA, 8C), V(36, 0B, D4, 98), V(CF, 81, F5, A6),                \
+        V(28, DE, 7A, A5), V(26, 8E, B7, DA), V(A4, BF, AD, 3F), V(E4, 9D, 3A, 2C),                \
+        V(0D, 92, 78, 50), V(9B, CC, 5F, 6A), V(62, 46, 7E, 54), V(C2, 13, 8D, F6),                \
+        V(E8, B8, D8, 90), V(5E, F7, 39, 2E), V(F5, AF, C3, 82), V(BE, 80, 5D, 9F),                \
+        V(7C, 93, D0, 69), V(A9, 2D, D5, 6F), V(B3, 12, 25, CF), V(3B, 99, AC, C8),                \
+        V(A7, 7D, 18, 10), V(6E, 63, 9C, E8), V(7B, BB, 3B, DB), V(09, 78, 26, CD),                \
+        V(F4, 18, 59, 6E), V(01, B7, 9A, EC), V(A8, 9A, 4F, 83), V(65, 6E, 95, E6),                \
+        V(7E, E6, FF, AA), V(08, CF, BC, 21), V(E6, E8, 15, EF), V(D9, 9B, E7, BA),                \
+        V(CE, 36, 6F, 4A), V(D4, 09, 9F, EA), V(D6, 7C, B0, 29), V(AF, B2, A4, 31),                \
+        V(31, 23, 3F, 2A), V(30, 94, A5, C6), V(C0, 66, A2, 35), V(37, BC, 4E, 74),                \
+        V(A6, CA, 82, FC), V(B0, D0, 90, E0), V(15, D8, A7, 33), V(4A, 98, 04, F1),                \
+        V(F7, DA, EC, 41), V(0E, 50, CD, 7F), V(2F, F6, 91, 17), V(8D, D6, 4D, 76),                \
+        V(4D, B0, EF, 43), V(54, 4D, AA, CC), V(DF, 04, 96, E4), V(E3, B5, D1, 9E),                \
+        V(1B, 88, 6A, 4C), V(B8, 1F, 2C, C1), V(7F, 51, 65, 46), V(04, EA, 5E, 9D),                \
+        V(5D, 35, 8C, 01), V(73, 74, 87, FA), V(2E, 41, 0B, FB), V(5A, 1D, 67, B3),                \
+        V(52, D2, DB, 92), V(33, 56, 10, E9), V(13, 47, D6, 6D), V(8C, 61, D7, 9A),                \
+        V(7A, 0C, A1, 37), V(8E, 14, F8, 59), V(89, 3C, 13, EB), V(EE, 27, A9, CE),                \
+        V(35, C9, 61, B7), V(ED, E5, 1C, E1), V(3C, B1, 47, 7A), V(59, DF, D2, 9C),                \
+        V(3F, 73, F2, 55), V(79, CE, 14, 18), V(BF, 37, C7, 73), V(EA, CD, F7, 53),                \
+        V(5B, AA, FD, 5F), V(14, 6F, 3D, DF), V(86, DB, 44, 78), V(81, F3, AF, CA),                \
+        V(3E, C4, 68, B9), V(2C, 34, 24, 38), V(5F, 40, A3, C2), V(72, C3, 1D, 16),                \
+        V(0C, 25, E2, BC), V(8B, 49, 3C, 28), V(41, 95, 0D, FF), V(71, 01, A8, 39),                \
+        V(DE, B3, 0C, 08), V(9C, E4, B4, D8), V(90, C1, 56, 64), V(61, 84, CB, 7B),                \
+        V(70, B6, 32, D5), V(74, 5C, 6C, 48), V(42, 57, B8, D0)
+
+#define V(a, b, c, d) 0x##a##b##c##d
+static const uint32_t RT0[256] = {RT};
+#undef V
+
+#if !defined(MBEDTLS_AES_FEWER_TABLES)
+
+#define V(a, b, c, d) 0x##b##c##d##a
+static const uint32_t RT1[256] = {RT};
+#undef V
+
+#define V(a, b, c, d) 0x##c##d##a##b
+static const uint32_t RT2[256] = {RT};
+#undef V
+
+#define V(a, b, c, d) 0x##d##a##b##c
+static const uint32_t RT3[256] = {RT};
+#undef V
+
+#endif /* !MBEDTLS_AES_FEWER_TABLES */
+
+#undef RT
+
+/*
+ * Round constants
+ */
+static const uint32_t RCON[10] = {0x00000001, 0x00000002, 0x00000004, 0x00000008, 0x00000010,
+    0x00000020, 0x00000040, 0x00000080, 0x0000001B, 0x00000036};
+
+#else /* MBEDTLS_AES_ROM_TABLES */
+
+/*
+ * Forward S-box & tables
+ */
+static unsigned char AESFSb[256];
+static uint32_t FT0[256];
+#if !defined(MBEDTLS_AES_FEWER_TABLES)
+static uint32_t FT1[256];
+static uint32_t FT2[256];
+static uint32_t FT3[256];
+#endif /* !MBEDTLS_AES_FEWER_TABLES */
+
+/*
+ * Reverse S-box & tables
+ */
+static unsigned char RSb[256];
+static uint32_t RT0[256];
+#if !defined(MBEDTLS_AES_FEWER_TABLES)
+static uint32_t RT1[256];
+static uint32_t RT2[256];
+static uint32_t RT3[256];
+#endif /* !MBEDTLS_AES_FEWER_TABLES */
+
+/*
+ * Round constants
+ */
+static uint32_t RCON[10];
+
+/*
+ * Tables generation code
+ */
+#define ROTL8(x) (((x) << 8) & 0xFFFFFFFF) | ((x) >> 24)
+#define XTIME(x) (((x) << 1) ^ (((x) & 0x80) ? 0x1B : 0x00))
+#define MUL(x, y) (((x) && (y)) ? pow[(log[(x)] + log[(y)]) % 255] : 0)
+
+static int aes_init_done = 0;
+
+static void aes_gen_tables(void) {
+    int i, x, y, z;
+    int pow[256];
+    int log[256];
+
+    /*
+     * compute pow and log tables over GF(2^8)
+     */
+    for (i = 0, x = 1; i < 256; i++) {
+        pow[i] = x;
+        log[x] = i;
+        x = MBEDTLS_BYTE_0(x ^ XTIME(x));
+    }
+
+    /*
+     * calculate the round constants
+     */
+    for (i = 0, x = 1; i < 10; i++) {
+        RCON[i] = (uint32_t)x;
+        x = MBEDTLS_BYTE_0(XTIME(x));
+    }
+
+    /*
+     * generate the forward and reverse S-boxes
+     */
+    AESFSb[0x00] = 0x63;
+    RSb[0x63] = 0x00;
+
+    for (i = 1; i < 256; i++) {
+        x = pow[255 - log[i]];
+
+        y = x;
+        y = MBEDTLS_BYTE_0((y << 1) | (y >> 7));
+        x ^= y;
+        y = MBEDTLS_BYTE_0((y << 1) | (y >> 7));
+        x ^= y;
+        y = MBEDTLS_BYTE_0((y << 1) | (y >> 7));
+        x ^= y;
+        y = MBEDTLS_BYTE_0((y << 1) | (y >> 7));
+        x ^= y ^ 0x63;
+
+        AESFSb[i] = (unsigned char)x;
+        RSb[x] = (unsigned char)i;
+    }
+
+    /*
+     * generate the forward and reverse tables
+     */
+    for (i = 0; i < 256; i++) {
+        x = AESFSb[i];
+        y = MBEDTLS_BYTE_0(XTIME(x));
+        z = MBEDTLS_BYTE_0(y ^ x);
+
+        FT0[i] = ((uint32_t)y) ^ ((uint32_t)x << 8) ^ ((uint32_t)x << 16) ^ ((uint32_t)z << 24);
+
+#if !defined(MBEDTLS_AES_FEWER_TABLES)
+        FT1[i] = ROTL8(FT0[i]);
+        FT2[i] = ROTL8(FT1[i]);
+        FT3[i] = ROTL8(FT2[i]);
+#endif /* !MBEDTLS_AES_FEWER_TABLES */
+
+        x = RSb[i];
+
+        RT0[i] = ((uint32_t)MUL(0x0E, x)) ^ ((uint32_t)MUL(0x09, x) << 8) ^
+                 ((uint32_t)MUL(0x0D, x) << 16) ^ ((uint32_t)MUL(0x0B, x) << 24);
+
+#if !defined(MBEDTLS_AES_FEWER_TABLES)
+        RT1[i] = ROTL8(RT0[i]);
+        RT2[i] = ROTL8(RT1[i]);
+        RT3[i] = ROTL8(RT2[i]);
+#endif /* !MBEDTLS_AES_FEWER_TABLES */
+    }
+}
+
+#undef ROTL8
+
+#endif /* MBEDTLS_AES_ROM_TABLES */
+
+#if defined(MBEDTLS_AES_FEWER_TABLES)
+
+#define ROTL8(x) ((uint32_t)((x) << 8) + (uint32_t)((x) >> 24))
+#define ROTL16(x) ((uint32_t)((x) << 16) + (uint32_t)((x) >> 16))
+#define ROTL24(x) ((uint32_t)((x) << 24) + (uint32_t)((x) >> 8))
+
+#define AES_RT0(idx) RT0[idx]
+#define AES_RT1(idx) ROTL8(RT0[idx])
+#define AES_RT2(idx) ROTL16(RT0[idx])
+#define AES_RT3(idx) ROTL24(RT0[idx])
+
+#define AES_FT0(idx) FT0[idx]
+#define AES_FT1(idx) ROTL8(FT0[idx])
+#define AES_FT2(idx) ROTL16(FT0[idx])
+#define AES_FT3(idx) ROTL24(FT0[idx])
+
+#else /* MBEDTLS_AES_FEWER_TABLES */
+
+#define AES_RT0(idx) RT0[idx]
+#define AES_RT1(idx) RT1[idx]
+#define AES_RT2(idx) RT2[idx]
+#define AES_RT3(idx) RT3[idx]
+
+#define AES_FT0(idx) FT0[idx]
+#define AES_FT1(idx) FT1[idx]
+#define AES_FT2(idx) FT2[idx]
+#define AES_FT3(idx) FT3[idx]
+
+#endif /* MBEDTLS_AES_FEWER_TABLES */
+
+void mbedtls_aes_init(mbedtls_aes_context* ctx) {
+    AES_VALIDATE(ctx != NULL);
+
+    memset(ctx, 0, sizeof(mbedtls_aes_context));
+}
+
+void mbedtls_aes_free(mbedtls_aes_context* ctx) {
+    if (ctx == NULL)
+        return;
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_aes_context));
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+void mbedtls_aes_xts_init(mbedtls_aes_xts_context* ctx) {
+    AES_VALIDATE(ctx != NULL);
+
+    mbedtls_aes_init(&ctx->crypt);
+    mbedtls_aes_init(&ctx->tweak);
+}
+
+void mbedtls_aes_xts_free(mbedtls_aes_xts_context* ctx) {
+    if (ctx == NULL)
+        return;
+
+    mbedtls_aes_free(&ctx->crypt);
+    mbedtls_aes_free(&ctx->tweak);
+}
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+/*
+ * AES key schedule (encryption)
+ */
+#if !defined(MBEDTLS_AES_SETKEY_ENC_ALT)
+int mbedtls_aes_setkey_enc(mbedtls_aes_context* ctx, const unsigned char* key,
+    unsigned int keybits) {
+    unsigned int i;
+    uint32_t* RK;
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(key != NULL);
+
+    switch (keybits) {
+    case 128:
+        ctx->nr = 10;
+        break;
+    case 192:
+        ctx->nr = 12;
+        break;
+    case 256:
+        ctx->nr = 14;
+        break;
+    default:
+        return (MBEDTLS_ERR_AES_INVALID_KEY_LENGTH);
+    }
+
+#if !defined(MBEDTLS_AES_ROM_TABLES)
+    if (aes_init_done == 0) {
+        aes_gen_tables();
+        aes_init_done = 1;
+    }
+#endif
+
+#if defined(MBEDTLS_PADLOCK_C) && defined(MBEDTLS_PADLOCK_ALIGN16)
+    if (aes_padlock_ace == -1)
+        aes_padlock_ace = mbedtls_padlock_has_support(MBEDTLS_PADLOCK_ACE);
+
+    if (aes_padlock_ace)
+        ctx->rk = RK = MBEDTLS_PADLOCK_ALIGN16(ctx->buf);
+    else
+#endif
+        ctx->rk = RK = ctx->buf;
+
+#if defined(MBEDTLS_AESNI_C) && defined(MBEDTLS_HAVE_X86_64)
+    if (mbedtls_aesni_has_support(MBEDTLS_AESNI_AES))
+        return (mbedtls_aesni_setkey_enc((unsigned char*)ctx->rk, key, keybits));
+#endif
+
+    for (i = 0; i < (keybits >> 5); i++) {
+        RK[i] = MBEDTLS_GET_UINT32_LE(key, i << 2);
+    }
+
+    switch (ctx->nr) {
+    case 10:
+
+        for (i = 0; i < 10; i++, RK += 4) {
+            RK[4] = RK[0] ^ RCON[i] ^ ((uint32_t)AESFSb[MBEDTLS_BYTE_1(RK[3])]) ^
+                    ((uint32_t)AESFSb[MBEDTLS_BYTE_2(RK[3])] << 8) ^
+                    ((uint32_t)AESFSb[MBEDTLS_BYTE_3(RK[3])] << 16) ^
+                    ((uint32_t)AESFSb[MBEDTLS_BYTE_0(RK[3])] << 24);
+
+            RK[5] = RK[1] ^ RK[4];
+            RK[6] = RK[2] ^ RK[5];
+            RK[7] = RK[3] ^ RK[6];
+        }
+        break;
+
+    case 12:
+
+        for (i = 0; i < 8; i++, RK += 6) {
+            RK[6] = RK[0] ^ RCON[i] ^ ((uint32_t)AESFSb[MBEDTLS_BYTE_1(RK[5])]) ^
+                    ((uint32_t)AESFSb[MBEDTLS_BYTE_2(RK[5])] << 8) ^
+                    ((uint32_t)AESFSb[MBEDTLS_BYTE_3(RK[5])] << 16) ^
+                    ((uint32_t)AESFSb[MBEDTLS_BYTE_0(RK[5])] << 24);
+
+            RK[7] = RK[1] ^ RK[6];
+            RK[8] = RK[2] ^ RK[7];
+            RK[9] = RK[3] ^ RK[8];
+            RK[10] = RK[4] ^ RK[9];
+            RK[11] = RK[5] ^ RK[10];
+        }
+        break;
+
+    case 14:
+
+        for (i = 0; i < 7; i++, RK += 8) {
+            RK[8] = RK[0] ^ RCON[i] ^ ((uint32_t)AESFSb[MBEDTLS_BYTE_1(RK[7])]) ^
+                    ((uint32_t)AESFSb[MBEDTLS_BYTE_2(RK[7])] << 8) ^
+                    ((uint32_t)AESFSb[MBEDTLS_BYTE_3(RK[7])] << 16) ^
+                    ((uint32_t)AESFSb[MBEDTLS_BYTE_0(RK[7])] << 24);
+
+            RK[9] = RK[1] ^ RK[8];
+            RK[10] = RK[2] ^ RK[9];
+            RK[11] = RK[3] ^ RK[10];
+
+            RK[12] = RK[4] ^ ((uint32_t)AESFSb[MBEDTLS_BYTE_0(RK[11])]) ^
+                     ((uint32_t)AESFSb[MBEDTLS_BYTE_1(RK[11])] << 8) ^
+                     ((uint32_t)AESFSb[MBEDTLS_BYTE_2(RK[11])] << 16) ^
+                     ((uint32_t)AESFSb[MBEDTLS_BYTE_3(RK[11])] << 24);
+
+            RK[13] = RK[5] ^ RK[12];
+            RK[14] = RK[6] ^ RK[13];
+            RK[15] = RK[7] ^ RK[14];
+        }
+        break;
+    }
+
+    return (0);
+}
+#endif /* !MBEDTLS_AES_SETKEY_ENC_ALT */
+
+/*
+ * AES key schedule (decryption)
+ */
+#if !defined(MBEDTLS_AES_SETKEY_DEC_ALT)
+int mbedtls_aes_setkey_dec(mbedtls_aes_context* ctx, const unsigned char* key,
+    unsigned int keybits) {
+    int i, j, ret;
+    mbedtls_aes_context cty;
+    uint32_t* RK;
+    uint32_t* SK;
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(key != NULL);
+
+    mbedtls_aes_init(&cty);
+
+#if defined(MBEDTLS_PADLOCK_C) && defined(MBEDTLS_PADLOCK_ALIGN16)
+    if (aes_padlock_ace == -1)
+        aes_padlock_ace = mbedtls_padlock_has_support(MBEDTLS_PADLOCK_ACE);
+
+    if (aes_padlock_ace)
+        ctx->rk = RK = MBEDTLS_PADLOCK_ALIGN16(ctx->buf);
+    else
+#endif
+        ctx->rk = RK = ctx->buf;
+
+    /* Also checks keybits */
+    if ((ret = mbedtls_aes_setkey_enc(&cty, key, keybits)) != 0)
+        goto exit;
+
+    ctx->nr = cty.nr;
+
+#if defined(MBEDTLS_AESNI_C) && defined(MBEDTLS_HAVE_X86_64)
+    if (mbedtls_aesni_has_support(MBEDTLS_AESNI_AES)) {
+        mbedtls_aesni_inverse_key((unsigned char*)ctx->rk, (const unsigned char*)cty.rk, ctx->nr);
+        goto exit;
+    }
+#endif
+
+    SK = cty.rk + cty.nr * 4;
+
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+
+    for (i = ctx->nr - 1, SK -= 8; i > 0; i--, SK -= 8) {
+        for (j = 0; j < 4; j++, SK++) {
+            *RK++ = AES_RT0(AESFSb[MBEDTLS_BYTE_0(*SK)]) ^ AES_RT1(AESFSb[MBEDTLS_BYTE_1(*SK)]) ^
+                    AES_RT2(AESFSb[MBEDTLS_BYTE_2(*SK)]) ^ AES_RT3(AESFSb[MBEDTLS_BYTE_3(*SK)]);
+        }
+    }
+
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+
+exit:
+    mbedtls_aes_free(&cty);
+
+    return (ret);
+}
+#endif /* !MBEDTLS_AES_SETKEY_DEC_ALT */
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+static int mbedtls_aes_xts_decode_keys(const unsigned char* key, unsigned int keybits,
+    const unsigned char** key1, unsigned int* key1bits, const unsigned char** key2,
+    unsigned int* key2bits) {
+    const unsigned int half_keybits = keybits / 2;
+    const unsigned int half_keybytes = half_keybits / 8;
+
+    switch (keybits) {
+    case 256:
+        break;
+    case 512:
+        break;
+    default:
+        return (MBEDTLS_ERR_AES_INVALID_KEY_LENGTH);
+    }
+
+    *key1bits = half_keybits;
+    *key2bits = half_keybits;
+    *key1 = &key[0];
+    *key2 = &key[half_keybytes];
+
+    return 0;
+}
+
+int mbedtls_aes_xts_setkey_enc(mbedtls_aes_xts_context* ctx, const unsigned char* key,
+    unsigned int keybits) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    const unsigned char *key1, *key2;
+    unsigned int key1bits, key2bits;
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(key != NULL);
+
+    ret = mbedtls_aes_xts_decode_keys(key, keybits, &key1, &key1bits, &key2, &key2bits);
+    if (ret != 0)
+        return (ret);
+
+    /* Set the tweak key. Always set tweak key for the encryption mode. */
+    ret = mbedtls_aes_setkey_enc(&ctx->tweak, key2, key2bits);
+    if (ret != 0)
+        return (ret);
+
+    /* Set crypt key for encryption. */
+    return mbedtls_aes_setkey_enc(&ctx->crypt, key1, key1bits);
+}
+
+int mbedtls_aes_xts_setkey_dec(mbedtls_aes_xts_context* ctx, const unsigned char* key,
+    unsigned int keybits) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    const unsigned char *key1, *key2;
+    unsigned int key1bits, key2bits;
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(key != NULL);
+
+    ret = mbedtls_aes_xts_decode_keys(key, keybits, &key1, &key1bits, &key2, &key2bits);
+    if (ret != 0)
+        return (ret);
+
+    /* Set the tweak key. Always set tweak key for encryption. */
+    ret = mbedtls_aes_setkey_enc(&ctx->tweak, key2, key2bits);
+    if (ret != 0)
+        return (ret);
+
+    /* Set crypt key for decryption. */
+    return mbedtls_aes_setkey_dec(&ctx->crypt, key1, key1bits);
+}
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+#define AES_FROUND(X0, X1, X2, X3, Y0, Y1, Y2, Y3)                                                 \
+    do {                                                                                           \
+        (X0) = *RK++ ^ AES_FT0(MBEDTLS_BYTE_0(Y0)) ^ AES_FT1(MBEDTLS_BYTE_1(Y1)) ^                 \
+               AES_FT2(MBEDTLS_BYTE_2(Y2)) ^ AES_FT3(MBEDTLS_BYTE_3(Y3));                          \
+                                                                                                   \
+        (X1) = *RK++ ^ AES_FT0(MBEDTLS_BYTE_0(Y1)) ^ AES_FT1(MBEDTLS_BYTE_1(Y2)) ^                 \
+               AES_FT2(MBEDTLS_BYTE_2(Y3)) ^ AES_FT3(MBEDTLS_BYTE_3(Y0));                          \
+                                                                                                   \
+        (X2) = *RK++ ^ AES_FT0(MBEDTLS_BYTE_0(Y2)) ^ AES_FT1(MBEDTLS_BYTE_1(Y3)) ^                 \
+               AES_FT2(MBEDTLS_BYTE_2(Y0)) ^ AES_FT3(MBEDTLS_BYTE_3(Y1));                          \
+                                                                                                   \
+        (X3) = *RK++ ^ AES_FT0(MBEDTLS_BYTE_0(Y3)) ^ AES_FT1(MBEDTLS_BYTE_1(Y0)) ^                 \
+               AES_FT2(MBEDTLS_BYTE_2(Y1)) ^ AES_FT3(MBEDTLS_BYTE_3(Y2));                          \
+    } while (0)
+
+#define AES_RROUND(X0, X1, X2, X3, Y0, Y1, Y2, Y3)                                                 \
+    do {                                                                                           \
+        (X0) = *RK++ ^ AES_RT0(MBEDTLS_BYTE_0(Y0)) ^ AES_RT1(MBEDTLS_BYTE_1(Y3)) ^                 \
+               AES_RT2(MBEDTLS_BYTE_2(Y2)) ^ AES_RT3(MBEDTLS_BYTE_3(Y1));                          \
+                                                                                                   \
+        (X1) = *RK++ ^ AES_RT0(MBEDTLS_BYTE_0(Y1)) ^ AES_RT1(MBEDTLS_BYTE_1(Y0)) ^                 \
+               AES_RT2(MBEDTLS_BYTE_2(Y3)) ^ AES_RT3(MBEDTLS_BYTE_3(Y2));                          \
+                                                                                                   \
+        (X2) = *RK++ ^ AES_RT0(MBEDTLS_BYTE_0(Y2)) ^ AES_RT1(MBEDTLS_BYTE_1(Y1)) ^                 \
+               AES_RT2(MBEDTLS_BYTE_2(Y0)) ^ AES_RT3(MBEDTLS_BYTE_3(Y3));                          \
+                                                                                                   \
+        (X3) = *RK++ ^ AES_RT0(MBEDTLS_BYTE_0(Y3)) ^ AES_RT1(MBEDTLS_BYTE_1(Y2)) ^                 \
+               AES_RT2(MBEDTLS_BYTE_2(Y1)) ^ AES_RT3(MBEDTLS_BYTE_3(Y0));                          \
+    } while (0)
+
+/*
+ * AES-ECB block encryption
+ */
+#if !defined(MBEDTLS_AES_ENCRYPT_ALT)
+int mbedtls_internal_aes_encrypt(mbedtls_aes_context* ctx, const unsigned char input[16],
+    unsigned char output[16]) {
+    int i;
+    uint32_t* RK = ctx->rk;
+    struct {
+        uint32_t X[4];
+        uint32_t Y[4];
+    } t;
+
+    t.X[0] = MBEDTLS_GET_UINT32_LE(input, 0);
+    t.X[0] ^= *RK++;
+    t.X[1] = MBEDTLS_GET_UINT32_LE(input, 4);
+    t.X[1] ^= *RK++;
+    t.X[2] = MBEDTLS_GET_UINT32_LE(input, 8);
+    t.X[2] ^= *RK++;
+    t.X[3] = MBEDTLS_GET_UINT32_LE(input, 12);
+    t.X[3] ^= *RK++;
+
+    for (i = (ctx->nr >> 1) - 1; i > 0; i--) {
+        AES_FROUND(t.Y[0], t.Y[1], t.Y[2], t.Y[3], t.X[0], t.X[1], t.X[2], t.X[3]);
+        AES_FROUND(t.X[0], t.X[1], t.X[2], t.X[3], t.Y[0], t.Y[1], t.Y[2], t.Y[3]);
+    }
+
+    AES_FROUND(t.Y[0], t.Y[1], t.Y[2], t.Y[3], t.X[0], t.X[1], t.X[2], t.X[3]);
+
+    t.X[0] = *RK++ ^ ((uint32_t)AESFSb[MBEDTLS_BYTE_0(t.Y[0])]) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_1(t.Y[1])] << 8) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_2(t.Y[2])] << 16) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_3(t.Y[3])] << 24);
+
+    t.X[1] = *RK++ ^ ((uint32_t)AESFSb[MBEDTLS_BYTE_0(t.Y[1])]) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_1(t.Y[2])] << 8) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_2(t.Y[3])] << 16) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_3(t.Y[0])] << 24);
+
+    t.X[2] = *RK++ ^ ((uint32_t)AESFSb[MBEDTLS_BYTE_0(t.Y[2])]) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_1(t.Y[3])] << 8) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_2(t.Y[0])] << 16) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_3(t.Y[1])] << 24);
+
+    t.X[3] = *RK++ ^ ((uint32_t)AESFSb[MBEDTLS_BYTE_0(t.Y[3])]) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_1(t.Y[0])] << 8) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_2(t.Y[1])] << 16) ^
+             ((uint32_t)AESFSb[MBEDTLS_BYTE_3(t.Y[2])] << 24);
+
+    MBEDTLS_PUT_UINT32_LE(t.X[0], output, 0);
+    MBEDTLS_PUT_UINT32_LE(t.X[1], output, 4);
+    MBEDTLS_PUT_UINT32_LE(t.X[2], output, 8);
+    MBEDTLS_PUT_UINT32_LE(t.X[3], output, 12);
+
+    mbedtls_platform_zeroize(&t, sizeof(t));
+
+    return (0);
+}
+#endif /* !MBEDTLS_AES_ENCRYPT_ALT */
+
+/*
+ * AES-ECB block decryption
+ */
+#if !defined(MBEDTLS_AES_DECRYPT_ALT)
+int mbedtls_internal_aes_decrypt(mbedtls_aes_context* ctx, const unsigned char input[16],
+    unsigned char output[16]) {
+    int i;
+    uint32_t* RK = ctx->rk;
+    struct {
+        uint32_t X[4];
+        uint32_t Y[4];
+    } t;
+
+    t.X[0] = MBEDTLS_GET_UINT32_LE(input, 0);
+    t.X[0] ^= *RK++;
+    t.X[1] = MBEDTLS_GET_UINT32_LE(input, 4);
+    t.X[1] ^= *RK++;
+    t.X[2] = MBEDTLS_GET_UINT32_LE(input, 8);
+    t.X[2] ^= *RK++;
+    t.X[3] = MBEDTLS_GET_UINT32_LE(input, 12);
+    t.X[3] ^= *RK++;
+
+    for (i = (ctx->nr >> 1) - 1; i > 0; i--) {
+        AES_RROUND(t.Y[0], t.Y[1], t.Y[2], t.Y[3], t.X[0], t.X[1], t.X[2], t.X[3]);
+        AES_RROUND(t.X[0], t.X[1], t.X[2], t.X[3], t.Y[0], t.Y[1], t.Y[2], t.Y[3]);
+    }
+
+    AES_RROUND(t.Y[0], t.Y[1], t.Y[2], t.Y[3], t.X[0], t.X[1], t.X[2], t.X[3]);
+
+    t.X[0] = *RK++ ^ ((uint32_t)RSb[MBEDTLS_BYTE_0(t.Y[0])]) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_1(t.Y[3])] << 8) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_2(t.Y[2])] << 16) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_3(t.Y[1])] << 24);
+
+    t.X[1] = *RK++ ^ ((uint32_t)RSb[MBEDTLS_BYTE_0(t.Y[1])]) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_1(t.Y[0])] << 8) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_2(t.Y[3])] << 16) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_3(t.Y[2])] << 24);
+
+    t.X[2] = *RK++ ^ ((uint32_t)RSb[MBEDTLS_BYTE_0(t.Y[2])]) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_1(t.Y[1])] << 8) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_2(t.Y[0])] << 16) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_3(t.Y[3])] << 24);
+
+    t.X[3] = *RK++ ^ ((uint32_t)RSb[MBEDTLS_BYTE_0(t.Y[3])]) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_1(t.Y[2])] << 8) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_2(t.Y[1])] << 16) ^
+             ((uint32_t)RSb[MBEDTLS_BYTE_3(t.Y[0])] << 24);
+
+    MBEDTLS_PUT_UINT32_LE(t.X[0], output, 0);
+    MBEDTLS_PUT_UINT32_LE(t.X[1], output, 4);
+    MBEDTLS_PUT_UINT32_LE(t.X[2], output, 8);
+    MBEDTLS_PUT_UINT32_LE(t.X[3], output, 12);
+
+    mbedtls_platform_zeroize(&t, sizeof(t));
+
+    return (0);
+}
+#endif /* !MBEDTLS_AES_DECRYPT_ALT */
+
+/*
+ * AES-ECB block encryption/decryption
+ */
+int mbedtls_aes_crypt_ecb(mbedtls_aes_context* ctx, int mode, const unsigned char input[16],
+    unsigned char output[16]) {
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(input != NULL);
+    AES_VALIDATE_RET(output != NULL);
+    AES_VALIDATE_RET(mode == MBEDTLS_AES_ENCRYPT || mode == MBEDTLS_AES_DECRYPT);
+
+#if defined(MBEDTLS_AESNI_C) && defined(MBEDTLS_HAVE_X86_64)
+    if (mbedtls_aesni_has_support(MBEDTLS_AESNI_AES))
+        return (mbedtls_aesni_crypt_ecb(ctx, mode, input, output));
+#endif
+
+#if defined(MBEDTLS_PADLOCK_C) && defined(MBEDTLS_HAVE_X86)
+    if (aes_padlock_ace > 0) {
+        if (mbedtls_padlock_xcryptecb(ctx, mode, input, output) == 0)
+            return (0);
+
+        // If padlock data misaligned, we just fall back to
+        // unaccelerated mode
+        //
+    }
+#endif
+
+    if (mode == MBEDTLS_AES_ENCRYPT)
+        return (mbedtls_internal_aes_encrypt(ctx, input, output));
+    else
+        return (mbedtls_internal_aes_decrypt(ctx, input, output));
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+/*
+ * AES-CBC buffer encryption/decryption
+ */
+int mbedtls_aes_crypt_cbc(mbedtls_aes_context* ctx, int mode, size_t length, unsigned char iv[16],
+    const unsigned char* input, unsigned char* output) {
+    int i;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char temp[16];
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(mode == MBEDTLS_AES_ENCRYPT || mode == MBEDTLS_AES_DECRYPT);
+    AES_VALIDATE_RET(iv != NULL);
+    AES_VALIDATE_RET(input != NULL);
+    AES_VALIDATE_RET(output != NULL);
+
+    if (length % 16)
+        return (MBEDTLS_ERR_AES_INVALID_INPUT_LENGTH);
+
+#if defined(MBEDTLS_PADLOCK_C) && defined(MBEDTLS_HAVE_X86)
+    if (aes_padlock_ace > 0) {
+        if (mbedtls_padlock_xcryptcbc(ctx, mode, length, iv, input, output) == 0)
+            return (0);
+
+        // If padlock data misaligned, we just fall back to
+        // unaccelerated mode
+        //
+    }
+#endif
+
+    if (mode == MBEDTLS_AES_DECRYPT) {
+        while (length > 0) {
+            memcpy(temp, input, 16);
+            ret = mbedtls_aes_crypt_ecb(ctx, mode, input, output);
+            if (ret != 0)
+                goto exit;
+
+            for (i = 0; i < 16; i++)
+                output[i] = (unsigned char)(output[i] ^ iv[i]);
+
+            memcpy(iv, temp, 16);
+
+            input += 16;
+            output += 16;
+            length -= 16;
+        }
+    } else {
+        while (length > 0) {
+            for (i = 0; i < 16; i++)
+                output[i] = (unsigned char)(input[i] ^ iv[i]);
+
+            ret = mbedtls_aes_crypt_ecb(ctx, mode, output, output);
+            if (ret != 0)
+                goto exit;
+            memcpy(iv, output, 16);
+
+            input += 16;
+            output += 16;
+            length -= 16;
+        }
+    }
+    ret = 0;
+
+exit:
+    return (ret);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+
+typedef unsigned char mbedtls_be128[16];
+
+/*
+ * GF(2^128) multiplication function
+ *
+ * This function multiplies a field element by x in the polynomial field
+ * representation. It uses 64-bit word operations to gain speed but compensates
+ * for machine endianess and hence works correctly on both big and little
+ * endian machines.
+ */
+static void mbedtls_gf128mul_x_ble(unsigned char r[16], const unsigned char x[16]) {
+    uint64_t a, b, ra, rb;
+
+    a = MBEDTLS_GET_UINT64_LE(x, 0);
+    b = MBEDTLS_GET_UINT64_LE(x, 8);
+
+    ra = (a << 1) ^ 0x0087 >> (8 - ((b >> 63) << 3));
+    rb = (a >> 63) | (b << 1);
+
+    MBEDTLS_PUT_UINT64_LE(ra, r, 0);
+    MBEDTLS_PUT_UINT64_LE(rb, r, 8);
+}
+
+/*
+ * AES-XTS buffer encryption/decryption
+ */
+int mbedtls_aes_crypt_xts(mbedtls_aes_xts_context* ctx, int mode, size_t length,
+    const unsigned char data_unit[16], const unsigned char* input, unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t blocks = length / 16;
+    size_t leftover = length % 16;
+    unsigned char tweak[16];
+    unsigned char prev_tweak[16];
+    unsigned char tmp[16];
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(mode == MBEDTLS_AES_ENCRYPT || mode == MBEDTLS_AES_DECRYPT);
+    AES_VALIDATE_RET(data_unit != NULL);
+    AES_VALIDATE_RET(input != NULL);
+    AES_VALIDATE_RET(output != NULL);
+
+    /* Data units must be at least 16 bytes long. */
+    if (length < 16)
+        return MBEDTLS_ERR_AES_INVALID_INPUT_LENGTH;
+
+    /* NIST SP 800-38E disallows data units larger than 2**20 blocks. */
+    if (length > (1 << 20) * 16)
+        return MBEDTLS_ERR_AES_INVALID_INPUT_LENGTH;
+
+    /* Compute the tweak. */
+    ret = mbedtls_aes_crypt_ecb(&ctx->tweak, MBEDTLS_AES_ENCRYPT, data_unit, tweak);
+    if (ret != 0)
+        return (ret);
+
+    while (blocks--) {
+        size_t i;
+
+        if (leftover && (mode == MBEDTLS_AES_DECRYPT) && blocks == 0) {
+            /* We are on the last block in a decrypt operation that has
+             * leftover bytes, so we need to use the next tweak for this block,
+             * and this tweak for the lefover bytes. Save the current tweak for
+             * the leftovers and then update the current tweak for use on this,
+             * the last full block. */
+            memcpy(prev_tweak, tweak, sizeof(tweak));
+            mbedtls_gf128mul_x_ble(tweak, tweak);
+        }
+
+        for (i = 0; i < 16; i++)
+            tmp[i] = input[i] ^ tweak[i];
+
+        ret = mbedtls_aes_crypt_ecb(&ctx->crypt, mode, tmp, tmp);
+        if (ret != 0)
+            return (ret);
+
+        for (i = 0; i < 16; i++)
+            output[i] = tmp[i] ^ tweak[i];
+
+        /* Update the tweak for the next block. */
+        mbedtls_gf128mul_x_ble(tweak, tweak);
+
+        output += 16;
+        input += 16;
+    }
+
+    if (leftover) {
+        /* If we are on the leftover bytes in a decrypt operation, we need to
+         * use the previous tweak for these bytes (as saved in prev_tweak). */
+        unsigned char* t = mode == MBEDTLS_AES_DECRYPT ? prev_tweak : tweak;
+
+        /* We are now on the final part of the data unit, which doesn't divide
+         * evenly by 16. It's time for ciphertext stealing. */
+        size_t i;
+        unsigned char* prev_output = output - 16;
+
+        /* Copy ciphertext bytes from the previous block to our output for each
+         * byte of cyphertext we won't steal. At the same time, copy the
+         * remainder of the input for this final round (since the loop bounds
+         * are the same). */
+        for (i = 0; i < leftover; i++) {
+            output[i] = prev_output[i];
+            tmp[i] = input[i] ^ t[i];
+        }
+
+        /* Copy ciphertext bytes from the previous block for input in this
+         * round. */
+        for (; i < 16; i++)
+            tmp[i] = prev_output[i] ^ t[i];
+
+        ret = mbedtls_aes_crypt_ecb(&ctx->crypt, mode, tmp, tmp);
+        if (ret != 0)
+            return ret;
+
+        /* Write the result back to the previous block, overriding the previous
+         * output we copied. */
+        for (i = 0; i < 16; i++)
+            prev_output[i] = tmp[i] ^ t[i];
+    }
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+/*
+ * AES-CFB128 buffer encryption/decryption
+ */
+int mbedtls_aes_crypt_cfb128(mbedtls_aes_context* ctx, int mode, size_t length, size_t* iv_off,
+    unsigned char iv[16], const unsigned char* input, unsigned char* output) {
+    int c;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t n;
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(mode == MBEDTLS_AES_ENCRYPT || mode == MBEDTLS_AES_DECRYPT);
+    AES_VALIDATE_RET(iv_off != NULL);
+    AES_VALIDATE_RET(iv != NULL);
+    AES_VALIDATE_RET(input != NULL);
+    AES_VALIDATE_RET(output != NULL);
+
+    n = *iv_off;
+
+    if (n > 15)
+        return (MBEDTLS_ERR_AES_BAD_INPUT_DATA);
+
+    if (mode == MBEDTLS_AES_DECRYPT) {
+        while (length--) {
+            if (n == 0) {
+                ret = mbedtls_aes_crypt_ecb(ctx, MBEDTLS_AES_ENCRYPT, iv, iv);
+                if (ret != 0)
+                    goto exit;
+            }
+
+            c = *input++;
+            *output++ = (unsigned char)(c ^ iv[n]);
+            iv[n] = (unsigned char)c;
+
+            n = (n + 1) & 0x0F;
+        }
+    } else {
+        while (length--) {
+            if (n == 0) {
+                ret = mbedtls_aes_crypt_ecb(ctx, MBEDTLS_AES_ENCRYPT, iv, iv);
+                if (ret != 0)
+                    goto exit;
+            }
+
+            iv[n] = *output++ = (unsigned char)(iv[n] ^ *input++);
+
+            n = (n + 1) & 0x0F;
+        }
+    }
+
+    *iv_off = n;
+    ret = 0;
+
+exit:
+    return (ret);
+}
+
+/*
+ * AES-CFB8 buffer encryption/decryption
+ */
+int mbedtls_aes_crypt_cfb8(mbedtls_aes_context* ctx, int mode, size_t length, unsigned char iv[16],
+    const unsigned char* input, unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char c;
+    unsigned char ov[17];
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(mode == MBEDTLS_AES_ENCRYPT || mode == MBEDTLS_AES_DECRYPT);
+    AES_VALIDATE_RET(iv != NULL);
+    AES_VALIDATE_RET(input != NULL);
+    AES_VALIDATE_RET(output != NULL);
+    while (length--) {
+        memcpy(ov, iv, 16);
+        ret = mbedtls_aes_crypt_ecb(ctx, MBEDTLS_AES_ENCRYPT, iv, iv);
+        if (ret != 0)
+            goto exit;
+
+        if (mode == MBEDTLS_AES_DECRYPT)
+            ov[16] = *input;
+
+        c = *output++ = (unsigned char)(iv[0] ^ *input++);
+
+        if (mode == MBEDTLS_AES_ENCRYPT)
+            ov[16] = c;
+
+        memcpy(iv, ov + 1, 16);
+    }
+    ret = 0;
+
+exit:
+    return (ret);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+/*
+ * AES-OFB (Output Feedback Mode) buffer encryption/decryption
+ */
+int mbedtls_aes_crypt_ofb(mbedtls_aes_context* ctx, size_t length, size_t* iv_off,
+    unsigned char iv[16], const unsigned char* input, unsigned char* output) {
+    int ret = 0;
+    size_t n;
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(iv_off != NULL);
+    AES_VALIDATE_RET(iv != NULL);
+    AES_VALIDATE_RET(input != NULL);
+    AES_VALIDATE_RET(output != NULL);
+
+    n = *iv_off;
+
+    if (n > 15)
+        return (MBEDTLS_ERR_AES_BAD_INPUT_DATA);
+
+    while (length--) {
+        if (n == 0) {
+            ret = mbedtls_aes_crypt_ecb(ctx, MBEDTLS_AES_ENCRYPT, iv, iv);
+            if (ret != 0)
+                goto exit;
+        }
+        *output++ = *input++ ^ iv[n];
+
+        n = (n + 1) & 0x0F;
+    }
+
+    *iv_off = n;
+
+exit:
+    return (ret);
+}
+#endif /* MBEDTLS_CIPHER_MODE_OFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+/*
+ * AES-CTR buffer encryption/decryption
+ */
+int mbedtls_aes_crypt_ctr(mbedtls_aes_context* ctx, size_t length, size_t* nc_off,
+    unsigned char nonce_counter[16], unsigned char stream_block[16], const unsigned char* input,
+    unsigned char* output) {
+    int c, i;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t n;
+
+    AES_VALIDATE_RET(ctx != NULL);
+    AES_VALIDATE_RET(nc_off != NULL);
+    AES_VALIDATE_RET(nonce_counter != NULL);
+    AES_VALIDATE_RET(stream_block != NULL);
+    AES_VALIDATE_RET(input != NULL);
+    AES_VALIDATE_RET(output != NULL);
+
+    n = *nc_off;
+
+    if (n > 0x0F)
+        return (MBEDTLS_ERR_AES_BAD_INPUT_DATA);
+
+    while (length--) {
+        if (n == 0) {
+            ret = mbedtls_aes_crypt_ecb(ctx, MBEDTLS_AES_ENCRYPT, nonce_counter, stream_block);
+            if (ret != 0)
+                goto exit;
+
+            for (i = 16; i > 0; i--)
+                if (++nonce_counter[i - 1] != 0)
+                    break;
+        }
+        c = *input++;
+        *output++ = (unsigned char)(c ^ stream_block[n]);
+
+        n = (n + 1) & 0x0F;
+    }
+
+    *nc_off = n;
+    ret = 0;
+
+exit:
+    return (ret);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#endif /* !MBEDTLS_AES_ALT */
+
+#if defined(MBEDTLS_SELF_TEST)
+/*
+ * AES test vectors from:
+ *
+ * http://csrc.nist.gov/archive/aes/rijndael/rijndael-vals.zip
+ */
+static const unsigned char aes_test_ecb_dec[3][16] = {{0x44, 0x41, 0x6A, 0xC2, 0xD1, 0xF5, 0x3C,
+                                                          0x58, 0x33, 0x03, 0x91, 0x7E, 0x6B, 0xE9,
+                                                          0xEB, 0xE0},
+    {0x48, 0xE3, 0x1E, 0x9E, 0x25, 0x67, 0x18, 0xF2, 0x92, 0x29, 0x31, 0x9C, 0x19, 0xF1, 0x5B,
+        0xA4},
+    {0x05, 0x8C, 0xCF, 0xFD, 0xBB, 0xCB, 0x38, 0x2D, 0x1F, 0x6F, 0x56, 0x58, 0x5D, 0x8A, 0x4A,
+        0xDE}};
+
+static const unsigned char aes_test_ecb_enc[3][16] = {{0xC3, 0x4C, 0x05, 0x2C, 0xC0, 0xDA, 0x8D,
+                                                          0x73, 0x45, 0x1A, 0xFE, 0x5F, 0x03, 0xBE,
+                                                          0x29, 0x7F},
+    {0xF3, 0xF6, 0x75, 0x2A, 0xE8, 0xD7, 0x83, 0x11, 0x38, 0xF0, 0x41, 0x56, 0x06, 0x31, 0xB1,
+        0x14},
+    {0x8B, 0x79, 0xEE, 0xCC, 0x93, 0xA0, 0xEE, 0x5D, 0xFF, 0x30, 0xB4, 0xEA, 0x21, 0x63, 0x6D,
+        0xA4}};
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static const unsigned char aes_test_cbc_dec[3][16] = {{0xFA, 0xCA, 0x37, 0xE0, 0xB0, 0xC8, 0x53,
+                                                          0x73, 0xDF, 0x70, 0x6E, 0x73, 0xF7, 0xC9,
+                                                          0xAF, 0x86},
+    {0x5D, 0xF6, 0x78, 0xDD, 0x17, 0xBA, 0x4E, 0x75, 0xB6, 0x17, 0x68, 0xC6, 0xAD, 0xEF, 0x7C,
+        0x7B},
+    {0x48, 0x04, 0xE1, 0x81, 0x8F, 0xE6, 0x29, 0x75, 0x19, 0xA3, 0xE8, 0x8C, 0x57, 0x31, 0x04,
+        0x13}};
+
+static const unsigned char aes_test_cbc_enc[3][16] = {{0x8A, 0x05, 0xFC, 0x5E, 0x09, 0x5A, 0xF4,
+                                                          0x84, 0x8A, 0x08, 0xD3, 0x28, 0xD3, 0x68,
+                                                          0x8E, 0x3D},
+    {0x7B, 0xD9, 0x66, 0xD5, 0x3A, 0xD8, 0xC1, 0xBB, 0x85, 0xD2, 0xAD, 0xFA, 0xE8, 0x7B, 0xB1,
+        0x04},
+    {0xFE, 0x3C, 0x53, 0x65, 0x3E, 0x2F, 0x45, 0xB5, 0x6F, 0xCD, 0x88, 0xB2, 0xCC, 0x89, 0x8F,
+        0xF0}};
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+/*
+ * AES-CFB128 test vectors from:
+ *
+ * http://csrc.nist.gov/publications/nistpubs/800-38a/sp800-38a.pdf
+ */
+static const unsigned char aes_test_cfb128_key[3][32] = {{0x2B, 0x7E, 0x15, 0x16, 0x28, 0xAE, 0xD2,
+                                                             0xA6, 0xAB, 0xF7, 0x15, 0x88, 0x09,
+                                                             0xCF, 0x4F, 0x3C},
+    {0x8E, 0x73, 0xB0, 0xF7, 0xDA, 0x0E, 0x64, 0x52, 0xC8, 0x10, 0xF3, 0x2B, 0x80, 0x90, 0x79, 0xE5,
+        0x62, 0xF8, 0xEA, 0xD2, 0x52, 0x2C, 0x6B, 0x7B},
+    {0x60, 0x3D, 0xEB, 0x10, 0x15, 0xCA, 0x71, 0xBE, 0x2B, 0x73, 0xAE, 0xF0, 0x85, 0x7D, 0x77, 0x81,
+        0x1F, 0x35, 0x2C, 0x07, 0x3B, 0x61, 0x08, 0xD7, 0x2D, 0x98, 0x10, 0xA3, 0x09, 0x14, 0xDF,
+        0xF4}};
+
+static const unsigned char aes_test_cfb128_iv[16] = {0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
+    0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F};
+
+static const unsigned char aes_test_cfb128_pt[64] = {0x6B, 0xC1, 0xBE, 0xE2, 0x2E, 0x40, 0x9F, 0x96,
+    0xE9, 0x3D, 0x7E, 0x11, 0x73, 0x93, 0x17, 0x2A, 0xAE, 0x2D, 0x8A, 0x57, 0x1E, 0x03, 0xAC, 0x9C,
+    0x9E, 0xB7, 0x6F, 0xAC, 0x45, 0xAF, 0x8E, 0x51, 0x30, 0xC8, 0x1C, 0x46, 0xA3, 0x5C, 0xE4, 0x11,
+    0xE5, 0xFB, 0xC1, 0x19, 0x1A, 0x0A, 0x52, 0xEF, 0xF6, 0x9F, 0x24, 0x45, 0xDF, 0x4F, 0x9B, 0x17,
+    0xAD, 0x2B, 0x41, 0x7B, 0xE6, 0x6C, 0x37, 0x10};
+
+static const unsigned char aes_test_cfb128_ct[3][64] = {
+    {0x3B, 0x3F, 0xD9, 0x2E, 0xB7, 0x2D, 0xAD, 0x20, 0x33, 0x34, 0x49, 0xF8, 0xE8, 0x3C, 0xFB, 0x4A,
+        0xC8, 0xA6, 0x45, 0x37, 0xA0, 0xB3, 0xA9, 0x3F, 0xCD, 0xE3, 0xCD, 0xAD, 0x9F, 0x1C, 0xE5,
+        0x8B, 0x26, 0x75, 0x1F, 0x67, 0xA3, 0xCB, 0xB1, 0x40, 0xB1, 0x80, 0x8C, 0xF1, 0x87, 0xA4,
+        0xF4, 0xDF, 0xC0, 0x4B, 0x05, 0x35, 0x7C, 0x5D, 0x1C, 0x0E, 0xEA, 0xC4, 0xC6, 0x6F, 0x9F,
+        0xF7, 0xF2, 0xE6},
+    {0xCD, 0xC8, 0x0D, 0x6F, 0xDD, 0xF1, 0x8C, 0xAB, 0x34, 0xC2, 0x59, 0x09, 0xC9, 0x9A, 0x41, 0x74,
+        0x67, 0xCE, 0x7F, 0x7F, 0x81, 0x17, 0x36, 0x21, 0x96, 0x1A, 0x2B, 0x70, 0x17, 0x1D, 0x3D,
+        0x7A, 0x2E, 0x1E, 0x8A, 0x1D, 0xD5, 0x9B, 0x88, 0xB1, 0xC8, 0xE6, 0x0F, 0xED, 0x1E, 0xFA,
+        0xC4, 0xC9, 0xC0, 0x5F, 0x9F, 0x9C, 0xA9, 0x83, 0x4F, 0xA0, 0x42, 0xAE, 0x8F, 0xBA, 0x58,
+        0x4B, 0x09, 0xFF},
+    {0xDC, 0x7E, 0x84, 0xBF, 0xDA, 0x79, 0x16, 0x4B, 0x7E, 0xCD, 0x84, 0x86, 0x98, 0x5D, 0x38, 0x60,
+        0x39, 0xFF, 0xED, 0x14, 0x3B, 0x28, 0xB1, 0xC8, 0x32, 0x11, 0x3C, 0x63, 0x31, 0xE5, 0x40,
+        0x7B, 0xDF, 0x10, 0x13, 0x24, 0x15, 0xE5, 0x4B, 0x92, 0xA1, 0x3E, 0xD0, 0xA8, 0x26, 0x7A,
+        0xE2, 0xF9, 0x75, 0xA3, 0x85, 0x74, 0x1A, 0xB9, 0xCE, 0xF8, 0x20, 0x31, 0x62, 0x3D, 0x55,
+        0xB1, 0xE4, 0x71}};
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+/*
+ * AES-OFB test vectors from:
+ *
+ * https://csrc.nist.gov/publications/detail/sp/800-38a/final
+ */
+static const unsigned char aes_test_ofb_key[3][32] = {{0x2B, 0x7E, 0x15, 0x16, 0x28, 0xAE, 0xD2,
+                                                          0xA6, 0xAB, 0xF7, 0x15, 0x88, 0x09, 0xCF,
+                                                          0x4F, 0x3C},
+    {0x8E, 0x73, 0xB0, 0xF7, 0xDA, 0x0E, 0x64, 0x52, 0xC8, 0x10, 0xF3, 0x2B, 0x80, 0x90, 0x79, 0xE5,
+        0x62, 0xF8, 0xEA, 0xD2, 0x52, 0x2C, 0x6B, 0x7B},
+    {0x60, 0x3D, 0xEB, 0x10, 0x15, 0xCA, 0x71, 0xBE, 0x2B, 0x73, 0xAE, 0xF0, 0x85, 0x7D, 0x77, 0x81,
+        0x1F, 0x35, 0x2C, 0x07, 0x3B, 0x61, 0x08, 0xD7, 0x2D, 0x98, 0x10, 0xA3, 0x09, 0x14, 0xDF,
+        0xF4}};
+
+static const unsigned char aes_test_ofb_iv[16] = {0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
+    0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F};
+
+static const unsigned char aes_test_ofb_pt[64] = {0x6B, 0xC1, 0xBE, 0xE2, 0x2E, 0x40, 0x9F, 0x96,
+    0xE9, 0x3D, 0x7E, 0x11, 0x73, 0x93, 0x17, 0x2A, 0xAE, 0x2D, 0x8A, 0x57, 0x1E, 0x03, 0xAC, 0x9C,
+    0x9E, 0xB7, 0x6F, 0xAC, 0x45, 0xAF, 0x8E, 0x51, 0x30, 0xC8, 0x1C, 0x46, 0xA3, 0x5C, 0xE4, 0x11,
+    0xE5, 0xFB, 0xC1, 0x19, 0x1A, 0x0A, 0x52, 0xEF, 0xF6, 0x9F, 0x24, 0x45, 0xDF, 0x4F, 0x9B, 0x17,
+    0xAD, 0x2B, 0x41, 0x7B, 0xE6, 0x6C, 0x37, 0x10};
+
+static const unsigned char aes_test_ofb_ct[3][64] = {
+    {0x3B, 0x3F, 0xD9, 0x2E, 0xB7, 0x2D, 0xAD, 0x20, 0x33, 0x34, 0x49, 0xF8, 0xE8, 0x3C, 0xFB, 0x4A,
+        0x77, 0x89, 0x50, 0x8d, 0x16, 0x91, 0x8f, 0x03, 0xf5, 0x3c, 0x52, 0xda, 0xc5, 0x4e, 0xd8,
+        0x25, 0x97, 0x40, 0x05, 0x1e, 0x9c, 0x5f, 0xec, 0xf6, 0x43, 0x44, 0xf7, 0xa8, 0x22, 0x60,
+        0xed, 0xcc, 0x30, 0x4c, 0x65, 0x28, 0xf6, 0x59, 0xc7, 0x78, 0x66, 0xa5, 0x10, 0xd9, 0xc1,
+        0xd6, 0xae, 0x5e},
+    {0xCD, 0xC8, 0x0D, 0x6F, 0xDD, 0xF1, 0x8C, 0xAB, 0x34, 0xC2, 0x59, 0x09, 0xC9, 0x9A, 0x41, 0x74,
+        0xfc, 0xc2, 0x8b, 0x8d, 0x4c, 0x63, 0x83, 0x7c, 0x09, 0xe8, 0x17, 0x00, 0xc1, 0x10, 0x04,
+        0x01, 0x8d, 0x9a, 0x9a, 0xea, 0xc0, 0xf6, 0x59, 0x6f, 0x55, 0x9c, 0x6d, 0x4d, 0xaf, 0x59,
+        0xa5, 0xf2, 0x6d, 0x9f, 0x20, 0x08, 0x57, 0xca, 0x6c, 0x3e, 0x9c, 0xac, 0x52, 0x4b, 0xd9,
+        0xac, 0xc9, 0x2a},
+    {0xDC, 0x7E, 0x84, 0xBF, 0xDA, 0x79, 0x16, 0x4B, 0x7E, 0xCD, 0x84, 0x86, 0x98, 0x5D, 0x38, 0x60,
+        0x4f, 0xeb, 0xdc, 0x67, 0x40, 0xd2, 0x0b, 0x3a, 0xc8, 0x8f, 0x6a, 0xd8, 0x2a, 0x4f, 0xb0,
+        0x8d, 0x71, 0xab, 0x47, 0xa0, 0x86, 0xe8, 0x6e, 0xed, 0xf3, 0x9d, 0x1c, 0x5b, 0xba, 0x97,
+        0xc4, 0x08, 0x01, 0x26, 0x14, 0x1d, 0x67, 0xf3, 0x7b, 0xe8, 0x53, 0x8f, 0x5a, 0x8b, 0xe7,
+        0x40, 0xe4, 0x84}};
+#endif /* MBEDTLS_CIPHER_MODE_OFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+/*
+ * AES-CTR test vectors from:
+ *
+ * http://www.faqs.org/rfcs/rfc3686.html
+ */
+
+static const unsigned char aes_test_ctr_key[3][16] = {{0xAE, 0x68, 0x52, 0xF8, 0x12, 0x10, 0x67,
+                                                          0xCC, 0x4B, 0xF7, 0xA5, 0x76, 0x55, 0x77,
+                                                          0xF3, 0x9E},
+    {0x7E, 0x24, 0x06, 0x78, 0x17, 0xFA, 0xE0, 0xD7, 0x43, 0xD6, 0xCE, 0x1F, 0x32, 0x53, 0x91,
+        0x63},
+    {0x76, 0x91, 0xBE, 0x03, 0x5E, 0x50, 0x20, 0xA8, 0xAC, 0x6E, 0x61, 0x85, 0x29, 0xF9, 0xA0,
+        0xDC}};
+
+static const unsigned char aes_test_ctr_nonce_counter[3][16] = {{0x00, 0x00, 0x00, 0x30, 0x00, 0x00,
+                                                                    0x00, 0x00, 0x00, 0x00, 0x00,
+                                                                    0x00, 0x00, 0x00, 0x00, 0x01},
+    {0x00, 0x6C, 0xB6, 0xDB, 0xC0, 0x54, 0x3B, 0x59, 0xDA, 0x48, 0xD9, 0x0B, 0x00, 0x00, 0x00,
+        0x01},
+    {0x00, 0xE0, 0x01, 0x7B, 0x27, 0x77, 0x7F, 0x3F, 0x4A, 0x17, 0x86, 0xF0, 0x00, 0x00, 0x00,
+        0x01}};
+
+static const unsigned char aes_test_ctr_pt[3][48] = {{0x53, 0x69, 0x6E, 0x67, 0x6C, 0x65, 0x20,
+                                                         0x62, 0x6C, 0x6F, 0x63, 0x6B, 0x20, 0x6D,
+                                                         0x73, 0x67},
+
+    {0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F,
+        0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E,
+        0x1F},
+
+    {0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F,
+        0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E,
+        0x1F, 0x20, 0x21, 0x22, 0x23}};
+
+static const unsigned char aes_test_ctr_ct[3][48] = {{0xE4, 0x09, 0x5D, 0x4F, 0xB7, 0xA7, 0xB3,
+                                                         0x79, 0x2D, 0x61, 0x75, 0xA3, 0x26, 0x13,
+                                                         0x11, 0xB8},
+    {0x51, 0x04, 0xA1, 0x06, 0x16, 0x8A, 0x72, 0xD9, 0x79, 0x0D, 0x41, 0xEE, 0x8E, 0xDA, 0xD3, 0x88,
+        0xEB, 0x2E, 0x1E, 0xFC, 0x46, 0xDA, 0x57, 0xC8, 0xFC, 0xE6, 0x30, 0xDF, 0x91, 0x41, 0xBE,
+        0x28},
+    {0xC1, 0xCF, 0x48, 0xA8, 0x9F, 0x2F, 0xFD, 0xD9, 0xCF, 0x46, 0x52, 0xE9, 0xEF, 0xDB, 0x72, 0xD7,
+        0x45, 0x40, 0xA4, 0x2B, 0xDE, 0x6D, 0x78, 0x36, 0xD5, 0x9A, 0x5C, 0xEA, 0xAE, 0xF3, 0x10,
+        0x53, 0x25, 0xB2, 0x07, 0x2F}};
+
+static const int aes_test_ctr_len[3] = {16, 32, 36};
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+/*
+ * AES-XTS test vectors from:
+ *
+ * IEEE P1619/D16 Annex B
+ * https://web.archive.org/web/20150629024421/http://grouper.ieee.org/groups/1619/email/pdf00086.pdf
+ * (Archived from original at http://grouper.ieee.org/groups/1619/email/pdf00086.pdf)
+ */
+static const unsigned char aes_test_xts_key[][32] = {
+    {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00},
+    {0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+        0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+        0x22},
+    {0xff, 0xfe, 0xfd, 0xfc, 0xfb, 0xfa, 0xf9, 0xf8, 0xf7, 0xf6, 0xf5, 0xf4, 0xf3, 0xf2, 0xf1, 0xf0,
+        0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+        0x22},
+};
+
+static const unsigned char aes_test_xts_pt32[][32] = {
+    {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00},
+    {0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44,
+        0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44,
+        0x44},
+    {0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44,
+        0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44,
+        0x44},
+};
+
+static const unsigned char aes_test_xts_ct32[][32] = {
+    {0x91, 0x7c, 0xf6, 0x9e, 0xbd, 0x68, 0xb2, 0xec, 0x9b, 0x9f, 0xe9, 0xa3, 0xea, 0xdd, 0xa6, 0x92,
+        0xcd, 0x43, 0xd2, 0xf5, 0x95, 0x98, 0xed, 0x85, 0x8c, 0x02, 0xc2, 0x65, 0x2f, 0xbf, 0x92,
+        0x2e},
+    {0xc4, 0x54, 0x18, 0x5e, 0x6a, 0x16, 0x93, 0x6e, 0x39, 0x33, 0x40, 0x38, 0xac, 0xef, 0x83, 0x8b,
+        0xfb, 0x18, 0x6f, 0xff, 0x74, 0x80, 0xad, 0xc4, 0x28, 0x93, 0x82, 0xec, 0xd6, 0xd3, 0x94,
+        0xf0},
+    {0xaf, 0x85, 0x33, 0x6b, 0x59, 0x7a, 0xfc, 0x1a, 0x90, 0x0b, 0x2e, 0xb2, 0x1e, 0xc9, 0x49, 0xd2,
+        0x92, 0xdf, 0x4c, 0x04, 0x7e, 0x0b, 0x21, 0x53, 0x21, 0x86, 0xa5, 0x97, 0x1a, 0x22, 0x7a,
+        0x89},
+};
+
+static const unsigned char aes_test_xts_data_unit[][16] = {
+    {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00},
+    {0x33, 0x33, 0x33, 0x33, 0x33, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00},
+    {0x33, 0x33, 0x33, 0x33, 0x33, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00},
+};
+
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+/*
+ * Checkup routine
+ */
+int mbedtls_aes_self_test(int verbose) {
+    int ret = 0, i, j, u, mode;
+    unsigned int keybits;
+    unsigned char key[32];
+    unsigned char buf[64];
+    const unsigned char* aes_tests;
+#if defined(MBEDTLS_CIPHER_MODE_CBC) || defined(MBEDTLS_CIPHER_MODE_CFB)
+    unsigned char iv[16];
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    unsigned char prv[16];
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR) || defined(MBEDTLS_CIPHER_MODE_CFB) ||                        \
+    defined(MBEDTLS_CIPHER_MODE_OFB)
+    size_t offset;
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR) || defined(MBEDTLS_CIPHER_MODE_XTS)
+    int len;
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    unsigned char nonce_counter[16];
+    unsigned char stream_block[16];
+#endif
+    mbedtls_aes_context ctx;
+
+    memset(key, 0, 32);
+    mbedtls_aes_init(&ctx);
+
+    /*
+     * ECB mode
+     */
+    for (i = 0; i < 6; i++) {
+        u = i >> 1;
+        keybits = 128 + u * 64;
+        mode = i & 1;
+
+        if (verbose != 0)
+            mbedtls_printf("  AES-ECB-%3u (%s): ", keybits,
+                (mode == MBEDTLS_AES_DECRYPT) ? "dec" : "enc");
+
+        memset(buf, 0, 16);
+
+        if (mode == MBEDTLS_AES_DECRYPT) {
+            ret = mbedtls_aes_setkey_dec(&ctx, key, keybits);
+            aes_tests = aes_test_ecb_dec[u];
+        } else {
+            ret = mbedtls_aes_setkey_enc(&ctx, key, keybits);
+            aes_tests = aes_test_ecb_enc[u];
+        }
+
+        /*
+         * AES-192 is an optional feature that may be unavailable when
+         * there is an alternative underlying implementation i.e. when
+         * MBEDTLS_AES_ALT is defined.
+         */
+        if (ret == MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED && keybits == 192) {
+            mbedtls_printf("skipped\n");
+            continue;
+        } else if (ret != 0) {
+            goto exit;
+        }
+
+        for (j = 0; j < 10000; j++) {
+            ret = mbedtls_aes_crypt_ecb(&ctx, mode, buf, buf);
+            if (ret != 0)
+                goto exit;
+        }
+
+        if (memcmp(buf, aes_tests, 16) != 0) {
+            ret = 1;
+            goto exit;
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    /*
+     * CBC mode
+     */
+    for (i = 0; i < 6; i++) {
+        u = i >> 1;
+        keybits = 128 + u * 64;
+        mode = i & 1;
+
+        if (verbose != 0)
+            mbedtls_printf("  AES-CBC-%3u (%s): ", keybits,
+                (mode == MBEDTLS_AES_DECRYPT) ? "dec" : "enc");
+
+        memset(iv, 0, 16);
+        memset(prv, 0, 16);
+        memset(buf, 0, 16);
+
+        if (mode == MBEDTLS_AES_DECRYPT) {
+            ret = mbedtls_aes_setkey_dec(&ctx, key, keybits);
+            aes_tests = aes_test_cbc_dec[u];
+        } else {
+            ret = mbedtls_aes_setkey_enc(&ctx, key, keybits);
+            aes_tests = aes_test_cbc_enc[u];
+        }
+
+        /*
+         * AES-192 is an optional feature that may be unavailable when
+         * there is an alternative underlying implementation i.e. when
+         * MBEDTLS_AES_ALT is defined.
+         */
+        if (ret == MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED && keybits == 192) {
+            mbedtls_printf("skipped\n");
+            continue;
+        } else if (ret != 0) {
+            goto exit;
+        }
+
+        for (j = 0; j < 10000; j++) {
+            if (mode == MBEDTLS_AES_ENCRYPT) {
+                unsigned char tmp[16];
+
+                memcpy(tmp, prv, 16);
+                memcpy(prv, buf, 16);
+                memcpy(buf, tmp, 16);
+            }
+
+            ret = mbedtls_aes_crypt_cbc(&ctx, mode, 16, iv, buf, buf);
+            if (ret != 0)
+                goto exit;
+        }
+
+        if (memcmp(buf, aes_tests, 16) != 0) {
+            ret = 1;
+            goto exit;
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    /*
+     * CFB128 mode
+     */
+    for (i = 0; i < 6; i++) {
+        u = i >> 1;
+        keybits = 128 + u * 64;
+        mode = i & 1;
+
+        if (verbose != 0)
+            mbedtls_printf("  AES-CFB128-%3u (%s): ", keybits,
+                (mode == MBEDTLS_AES_DECRYPT) ? "dec" : "enc");
+
+        memcpy(iv, aes_test_cfb128_iv, 16);
+        memcpy(key, aes_test_cfb128_key[u], keybits / 8);
+
+        offset = 0;
+        ret = mbedtls_aes_setkey_enc(&ctx, key, keybits);
+        /*
+         * AES-192 is an optional feature that may be unavailable when
+         * there is an alternative underlying implementation i.e. when
+         * MBEDTLS_AES_ALT is defined.
+         */
+        if (ret == MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED && keybits == 192) {
+            mbedtls_printf("skipped\n");
+            continue;
+        } else if (ret != 0) {
+            goto exit;
+        }
+
+        if (mode == MBEDTLS_AES_DECRYPT) {
+            memcpy(buf, aes_test_cfb128_ct[u], 64);
+            aes_tests = aes_test_cfb128_pt;
+        } else {
+            memcpy(buf, aes_test_cfb128_pt, 64);
+            aes_tests = aes_test_cfb128_ct[u];
+        }
+
+        ret = mbedtls_aes_crypt_cfb128(&ctx, mode, 64, &offset, iv, buf, buf);
+        if (ret != 0)
+            goto exit;
+
+        if (memcmp(buf, aes_tests, 64) != 0) {
+            ret = 1;
+            goto exit;
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    /*
+     * OFB mode
+     */
+    for (i = 0; i < 6; i++) {
+        u = i >> 1;
+        keybits = 128 + u * 64;
+        mode = i & 1;
+
+        if (verbose != 0)
+            mbedtls_printf("  AES-OFB-%3u (%s): ", keybits,
+                (mode == MBEDTLS_AES_DECRYPT) ? "dec" : "enc");
+
+        memcpy(iv, aes_test_ofb_iv, 16);
+        memcpy(key, aes_test_ofb_key[u], keybits / 8);
+
+        offset = 0;
+        ret = mbedtls_aes_setkey_enc(&ctx, key, keybits);
+        /*
+         * AES-192 is an optional feature that may be unavailable when
+         * there is an alternative underlying implementation i.e. when
+         * MBEDTLS_AES_ALT is defined.
+         */
+        if (ret == MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED && keybits == 192) {
+            mbedtls_printf("skipped\n");
+            continue;
+        } else if (ret != 0) {
+            goto exit;
+        }
+
+        if (mode == MBEDTLS_AES_DECRYPT) {
+            memcpy(buf, aes_test_ofb_ct[u], 64);
+            aes_tests = aes_test_ofb_pt;
+        } else {
+            memcpy(buf, aes_test_ofb_pt, 64);
+            aes_tests = aes_test_ofb_ct[u];
+        }
+
+        ret = mbedtls_aes_crypt_ofb(&ctx, 64, &offset, iv, buf, buf);
+        if (ret != 0)
+            goto exit;
+
+        if (memcmp(buf, aes_tests, 64) != 0) {
+            ret = 1;
+            goto exit;
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+#endif /* MBEDTLS_CIPHER_MODE_OFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    /*
+     * CTR mode
+     */
+    for (i = 0; i < 6; i++) {
+        u = i >> 1;
+        mode = i & 1;
+
+        if (verbose != 0)
+            mbedtls_printf("  AES-CTR-128 (%s): ", (mode == MBEDTLS_AES_DECRYPT) ? "dec" : "enc");
+
+        memcpy(nonce_counter, aes_test_ctr_nonce_counter[u], 16);
+        memcpy(key, aes_test_ctr_key[u], 16);
+
+        offset = 0;
+        if ((ret = mbedtls_aes_setkey_enc(&ctx, key, 128)) != 0)
+            goto exit;
+
+        len = aes_test_ctr_len[u];
+
+        if (mode == MBEDTLS_AES_DECRYPT) {
+            memcpy(buf, aes_test_ctr_ct[u], len);
+            aes_tests = aes_test_ctr_pt[u];
+        } else {
+            memcpy(buf, aes_test_ctr_pt[u], len);
+            aes_tests = aes_test_ctr_ct[u];
+        }
+
+        ret = mbedtls_aes_crypt_ctr(&ctx, len, &offset, nonce_counter, stream_block, buf, buf);
+        if (ret != 0)
+            goto exit;
+
+        if (memcmp(buf, aes_tests, len) != 0) {
+            ret = 1;
+            goto exit;
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    {
+        static const int num_tests = sizeof(aes_test_xts_key) / sizeof(*aes_test_xts_key);
+        mbedtls_aes_xts_context ctx_xts;
+
+        /*
+         * XTS mode
+         */
+        mbedtls_aes_xts_init(&ctx_xts);
+
+        for (i = 0; i < num_tests << 1; i++) {
+            const unsigned char* data_unit;
+            u = i >> 1;
+            mode = i & 1;
+
+            if (verbose != 0)
+                mbedtls_printf("  AES-XTS-128 (%s): ",
+                    (mode == MBEDTLS_AES_DECRYPT) ? "dec" : "enc");
+
+            memset(key, 0, sizeof(key));
+            memcpy(key, aes_test_xts_key[u], 32);
+            data_unit = aes_test_xts_data_unit[u];
+
+            len = sizeof(*aes_test_xts_ct32);
+
+            if (mode == MBEDTLS_AES_DECRYPT) {
+                ret = mbedtls_aes_xts_setkey_dec(&ctx_xts, key, 256);
+                if (ret != 0)
+                    goto exit;
+                memcpy(buf, aes_test_xts_ct32[u], len);
+                aes_tests = aes_test_xts_pt32[u];
+            } else {
+                ret = mbedtls_aes_xts_setkey_enc(&ctx_xts, key, 256);
+                if (ret != 0)
+                    goto exit;
+                memcpy(buf, aes_test_xts_pt32[u], len);
+                aes_tests = aes_test_xts_ct32[u];
+            }
+
+            ret = mbedtls_aes_crypt_xts(&ctx_xts, mode, len, data_unit, buf, buf);
+            if (ret != 0)
+                goto exit;
+
+            if (memcmp(buf, aes_tests, len) != 0) {
+                ret = 1;
+                goto exit;
+            }
+
+            if (verbose != 0)
+                mbedtls_printf("passed\n");
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("\n");
+
+        mbedtls_aes_xts_free(&ctx_xts);
+    }
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+    ret = 0;
+
+exit:
+    if (ret != 0 && verbose != 0)
+        mbedtls_printf("failed\n");
+
+    mbedtls_aes_free(&ctx);
+
+    return (ret);
+}
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_AES_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/aria.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/aria.cpp
new file mode 100644
index 0000000000..678c298516
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/aria.cpp
@@ -0,0 +1,955 @@
+/*
+ *  ARIA implementation
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+/*
+ * This implementation is based on the following standards:
+ * [1] http://210.104.33.10/ARIA/doc/ARIA-specification-e.pdf
+ * [2] https://tools.ietf.org/html/rfc5794
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_ARIA_C)
+
+#include <string.h>
+
+#include "mbedtls/aria.h"
+
+#if defined(MBEDTLS_SELF_TEST)
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdio.h>
+#define mbedtls_printf printf
+#endif /* MBEDTLS_PLATFORM_C */
+#endif /* MBEDTLS_SELF_TEST */
+
+#if !defined(MBEDTLS_ARIA_ALT)
+
+#include "mbedtls/platform_util.h"
+
+#if (defined(__ARMCC_VERSION) || defined(_MSC_VER)) && !defined(inline) && !defined(__cplusplus)
+#define inline __inline
+#endif
+
+/* Parameter validation macros */
+#define ARIA_VALIDATE_RET(cond) MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_ARIA_BAD_INPUT_DATA)
+#define ARIA_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+/*
+ * modify byte order: ( A B C D ) -> ( B A D C ), i.e. swap pairs of bytes
+ *
+ * This is submatrix P1 in [1] Appendix B.1
+ *
+ * Common compilers fail to translate this to minimal number of instructions,
+ * so let's provide asm versions for common platforms with C fallback.
+ */
+#if defined(MBEDTLS_HAVE_ASM)
+#if defined(__arm__) /* rev16 available from v6 up */
+/* armcc5 --gnu defines __GNUC__ but doesn't support GNU's extended asm */
+#if defined(__GNUC__) && (!defined(__ARMCC_VERSION) || __ARMCC_VERSION >= 6000000) &&              \
+    __ARM_ARCH >= 6
+static inline uint32_t aria_p1(uint32_t x) {
+    uint32_t r;
+    __asm("rev16 %0, %1" : "=l"(r) : "l"(x));
+    return (r);
+}
+#define ARIA_P1 aria_p1
+#elif defined(__ARMCC_VERSION) && __ARMCC_VERSION < 6000000 &&                                     \
+    (__TARGET_ARCH_ARM >= 6 || __TARGET_ARCH_THUMB >= 3)
+static inline uint32_t aria_p1(uint32_t x) {
+    uint32_t r;
+    __asm("rev16 r, x");
+    return (r);
+}
+#define ARIA_P1 aria_p1
+#endif
+#endif /* arm */
+#if defined(__GNUC__) && defined(__i386__) || defined(__amd64__) || defined(__x86_64__)
+/* I couldn't find an Intel equivalent of rev16, so two instructions */
+#define ARIA_P1(x) ARIA_P2(ARIA_P3(x))
+#endif /* x86 gnuc */
+#endif /* MBEDTLS_HAVE_ASM && GNUC */
+#if !defined(ARIA_P1)
+#define ARIA_P1(x) ((((x) >> 8) & 0x00FF00FF) ^ (((x) & 0x00FF00FF) << 8))
+#endif
+
+/*
+ * modify byte order: ( A B C D ) -> ( C D A B ), i.e. rotate by 16 bits
+ *
+ * This is submatrix P2 in [1] Appendix B.1
+ *
+ * Common compilers will translate this to a single instruction.
+ */
+#define ARIA_P2(x) (((x) >> 16) ^ ((x) << 16))
+
+/*
+ * modify byte order: ( A B C D ) -> ( D C B A ), i.e. change endianness
+ *
+ * This is submatrix P3 in [1] Appendix B.1
+ *
+ * Some compilers fail to translate this to a single instruction,
+ * so let's provide asm versions for common platforms with C fallback.
+ */
+#if defined(MBEDTLS_HAVE_ASM)
+#if defined(__arm__) /* rev available from v6 up */
+/* armcc5 --gnu defines __GNUC__ but doesn't support GNU's extended asm */
+#if defined(__GNUC__) && (!defined(__ARMCC_VERSION) || __ARMCC_VERSION >= 6000000) &&              \
+    __ARM_ARCH >= 6
+static inline uint32_t aria_p3(uint32_t x) {
+    uint32_t r;
+    __asm("rev %0, %1" : "=l"(r) : "l"(x));
+    return (r);
+}
+#define ARIA_P3 aria_p3
+#elif defined(__ARMCC_VERSION) && __ARMCC_VERSION < 6000000 &&                                     \
+    (__TARGET_ARCH_ARM >= 6 || __TARGET_ARCH_THUMB >= 3)
+static inline uint32_t aria_p3(uint32_t x) {
+    uint32_t r;
+    __asm("rev r, x");
+    return (r);
+}
+#define ARIA_P3 aria_p3
+#endif
+#endif /* arm */
+#if defined(__GNUC__) && defined(__i386__) || defined(__amd64__) || defined(__x86_64__)
+static inline uint32_t aria_p3(uint32_t x) {
+    __asm("bswap %0" : "=r"(x) : "0"(x));
+    return (x);
+}
+#define ARIA_P3 aria_p3
+#endif /* x86 gnuc */
+#endif /* MBEDTLS_HAVE_ASM && GNUC */
+#if !defined(ARIA_P3)
+#define ARIA_P3(x) ARIA_P2(ARIA_P1(x))
+#endif
+
+/*
+ * ARIA Affine Transform
+ * (a, b, c, d) = state in/out
+ *
+ * If we denote the first byte of input by 0, ..., the last byte by f,
+ * then inputs are: a = 0123, b = 4567, c = 89ab, d = cdef.
+ *
+ * Reading [1] 2.4 or [2] 2.4.3 in columns and performing simple
+ * rearrangements on adjacent pairs, output is:
+ *
+ * a = 3210 + 4545 + 6767 + 88aa + 99bb + dccd + effe
+ *   = 3210 + 4567 + 6745 + 89ab + 98ba + dcfe + efcd
+ * b = 0101 + 2323 + 5476 + 8998 + baab + eecc + ffdd
+ *   = 0123 + 2301 + 5476 + 89ab + ba98 + efcd + fedc
+ * c = 0022 + 1133 + 4554 + 7667 + ab89 + dcdc + fefe
+ *   = 0123 + 1032 + 4567 + 7654 + ab89 + dcfe + fedc
+ * d = 1001 + 2332 + 6644 + 7755 + 9898 + baba + cdef
+ *   = 1032 + 2301 + 6745 + 7654 + 98ba + ba98 + cdef
+ *
+ * Note: another presentation of the A transform can be found as the first
+ * half of App. B.1 in [1] in terms of 4-byte operators P1, P2, P3 and P4.
+ * The implementation below uses only P1 and P2 as they are sufficient.
+ */
+static inline void aria_a(uint32_t* a, uint32_t* b, uint32_t* c, uint32_t* d) {
+    uint32_t ta, tb, tc;
+    ta = *b;                    // 4567
+    *b = *a;                    // 0123
+    *a = ARIA_P2(ta);           // 6745
+    tb = ARIA_P2(*d);           // efcd
+    *d = ARIA_P1(*c);           // 98ba
+    *c = ARIA_P1(tb);           // fedc
+    ta ^= *d;                   // 4567+98ba
+    tc = ARIA_P2(*b);           // 2301
+    ta = ARIA_P1(ta) ^ tc ^ *c; // 2301+5476+89ab+fedc
+    tb ^= ARIA_P2(*d);          // ba98+efcd
+    tc ^= ARIA_P1(*a);          // 2301+7654
+    *b ^= ta ^ tb;              // 0123+2301+5476+89ab+ba98+efcd+fedc OUT
+    tb = ARIA_P2(tb) ^ ta;      // 2301+5476+89ab+98ba+cdef+fedc
+    *a ^= ARIA_P1(tb);          // 3210+4567+6745+89ab+98ba+dcfe+efcd OUT
+    ta = ARIA_P2(ta);           // 0123+7654+ab89+dcfe
+    *d ^= ARIA_P1(ta) ^ tc;     // 1032+2301+6745+7654+98ba+ba98+cdef OUT
+    tc = ARIA_P2(tc);           // 0123+5476
+    *c ^= ARIA_P1(tc) ^ ta;     // 0123+1032+4567+7654+ab89+dcfe+fedc OUT
+}
+
+/*
+ * ARIA Substitution Layer SL1 / SL2
+ * (a, b, c, d) = state in/out
+ * (sa, sb, sc, sd) = 256 8-bit S-Boxes (see below)
+ *
+ * By passing sb1, sb2, is1, is2 as S-Boxes you get SL1
+ * By passing is1, is2, sb1, sb2 as S-Boxes you get SL2
+ */
+static inline void aria_sl(uint32_t* a, uint32_t* b, uint32_t* c, uint32_t* d,
+    const uint8_t sa[256], const uint8_t sb[256], const uint8_t sc[256], const uint8_t sd[256]) {
+    *a = ((uint32_t)sa[MBEDTLS_BYTE_0(*a)]) ^ (((uint32_t)sb[MBEDTLS_BYTE_1(*a)]) << 8) ^
+         (((uint32_t)sc[MBEDTLS_BYTE_2(*a)]) << 16) ^ (((uint32_t)sd[MBEDTLS_BYTE_3(*a)]) << 24);
+    *b = ((uint32_t)sa[MBEDTLS_BYTE_0(*b)]) ^ (((uint32_t)sb[MBEDTLS_BYTE_1(*b)]) << 8) ^
+         (((uint32_t)sc[MBEDTLS_BYTE_2(*b)]) << 16) ^ (((uint32_t)sd[MBEDTLS_BYTE_3(*b)]) << 24);
+    *c = ((uint32_t)sa[MBEDTLS_BYTE_0(*c)]) ^ (((uint32_t)sb[MBEDTLS_BYTE_1(*c)]) << 8) ^
+         (((uint32_t)sc[MBEDTLS_BYTE_2(*c)]) << 16) ^ (((uint32_t)sd[MBEDTLS_BYTE_3(*c)]) << 24);
+    *d = ((uint32_t)sa[MBEDTLS_BYTE_0(*d)]) ^ (((uint32_t)sb[MBEDTLS_BYTE_1(*d)]) << 8) ^
+         (((uint32_t)sc[MBEDTLS_BYTE_2(*d)]) << 16) ^ (((uint32_t)sd[MBEDTLS_BYTE_3(*d)]) << 24);
+}
+
+/*
+ * S-Boxes
+ */
+static const uint8_t aria_sb1[256] = {0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30, 0x01,
+    0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76, 0xCA, 0x82, 0xC9, 0x7D, 0xFA, 0x59, 0x47, 0xF0, 0xAD, 0xD4,
+    0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0, 0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34, 0xA5,
+    0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15, 0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07, 0x12,
+    0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75, 0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52, 0x3B,
+    0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84, 0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A, 0xCB,
+    0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF, 0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45, 0xF9,
+    0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8, 0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC, 0xB6,
+    0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2, 0xCD, 0x0C, 0x13, 0xEC, 0x5F, 0x97, 0x44, 0x17, 0xC4, 0xA7,
+    0x7E, 0x3D, 0x64, 0x5D, 0x19, 0x73, 0x60, 0x81, 0x4F, 0xDC, 0x22, 0x2A, 0x90, 0x88, 0x46, 0xEE,
+    0xB8, 0x14, 0xDE, 0x5E, 0x0B, 0xDB, 0xE0, 0x32, 0x3A, 0x0A, 0x49, 0x06, 0x24, 0x5C, 0xC2, 0xD3,
+    0xAC, 0x62, 0x91, 0x95, 0xE4, 0x79, 0xE7, 0xC8, 0x37, 0x6D, 0x8D, 0xD5, 0x4E, 0xA9, 0x6C, 0x56,
+    0xF4, 0xEA, 0x65, 0x7A, 0xAE, 0x08, 0xBA, 0x78, 0x25, 0x2E, 0x1C, 0xA6, 0xB4, 0xC6, 0xE8, 0xDD,
+    0x74, 0x1F, 0x4B, 0xBD, 0x8B, 0x8A, 0x70, 0x3E, 0xB5, 0x66, 0x48, 0x03, 0xF6, 0x0E, 0x61, 0x35,
+    0x57, 0xB9, 0x86, 0xC1, 0x1D, 0x9E, 0xE1, 0xF8, 0x98, 0x11, 0x69, 0xD9, 0x8E, 0x94, 0x9B, 0x1E,
+    0x87, 0xE9, 0xCE, 0x55, 0x28, 0xDF, 0x8C, 0xA1, 0x89, 0x0D, 0xBF, 0xE6, 0x42, 0x68, 0x41, 0x99,
+    0x2D, 0x0F, 0xB0, 0x54, 0xBB, 0x16};
+
+static const uint8_t aria_sb2[256] = {0xE2, 0x4E, 0x54, 0xFC, 0x94, 0xC2, 0x4A, 0xCC, 0x62, 0x0D,
+    0x6A, 0x46, 0x3C, 0x4D, 0x8B, 0xD1, 0x5E, 0xFA, 0x64, 0xCB, 0xB4, 0x97, 0xBE, 0x2B, 0xBC, 0x77,
+    0x2E, 0x03, 0xD3, 0x19, 0x59, 0xC1, 0x1D, 0x06, 0x41, 0x6B, 0x55, 0xF0, 0x99, 0x69, 0xEA, 0x9C,
+    0x18, 0xAE, 0x63, 0xDF, 0xE7, 0xBB, 0x00, 0x73, 0x66, 0xFB, 0x96, 0x4C, 0x85, 0xE4, 0x3A, 0x09,
+    0x45, 0xAA, 0x0F, 0xEE, 0x10, 0xEB, 0x2D, 0x7F, 0xF4, 0x29, 0xAC, 0xCF, 0xAD, 0x91, 0x8D, 0x78,
+    0xC8, 0x95, 0xF9, 0x2F, 0xCE, 0xCD, 0x08, 0x7A, 0x88, 0x38, 0x5C, 0x83, 0x2A, 0x28, 0x47, 0xDB,
+    0xB8, 0xC7, 0x93, 0xA4, 0x12, 0x53, 0xFF, 0x87, 0x0E, 0x31, 0x36, 0x21, 0x58, 0x48, 0x01, 0x8E,
+    0x37, 0x74, 0x32, 0xCA, 0xE9, 0xB1, 0xB7, 0xAB, 0x0C, 0xD7, 0xC4, 0x56, 0x42, 0x26, 0x07, 0x98,
+    0x60, 0xD9, 0xB6, 0xB9, 0x11, 0x40, 0xEC, 0x20, 0x8C, 0xBD, 0xA0, 0xC9, 0x84, 0x04, 0x49, 0x23,
+    0xF1, 0x4F, 0x50, 0x1F, 0x13, 0xDC, 0xD8, 0xC0, 0x9E, 0x57, 0xE3, 0xC3, 0x7B, 0x65, 0x3B, 0x02,
+    0x8F, 0x3E, 0xE8, 0x25, 0x92, 0xE5, 0x15, 0xDD, 0xFD, 0x17, 0xA9, 0xBF, 0xD4, 0x9A, 0x7E, 0xC5,
+    0x39, 0x67, 0xFE, 0x76, 0x9D, 0x43, 0xA7, 0xE1, 0xD0, 0xF5, 0x68, 0xF2, 0x1B, 0x34, 0x70, 0x05,
+    0xA3, 0x8A, 0xD5, 0x79, 0x86, 0xA8, 0x30, 0xC6, 0x51, 0x4B, 0x1E, 0xA6, 0x27, 0xF6, 0x35, 0xD2,
+    0x6E, 0x24, 0x16, 0x82, 0x5F, 0xDA, 0xE6, 0x75, 0xA2, 0xEF, 0x2C, 0xB2, 0x1C, 0x9F, 0x5D, 0x6F,
+    0x80, 0x0A, 0x72, 0x44, 0x9B, 0x6C, 0x90, 0x0B, 0x5B, 0x33, 0x7D, 0x5A, 0x52, 0xF3, 0x61, 0xA1,
+    0xF7, 0xB0, 0xD6, 0x3F, 0x7C, 0x6D, 0xED, 0x14, 0xE0, 0xA5, 0x3D, 0x22, 0xB3, 0xF8, 0x89, 0xDE,
+    0x71, 0x1A, 0xAF, 0xBA, 0xB5, 0x81};
+
+static const uint8_t aria_is1[256] = {0x52, 0x09, 0x6A, 0xD5, 0x30, 0x36, 0xA5, 0x38, 0xBF, 0x40,
+    0xA3, 0x9E, 0x81, 0xF3, 0xD7, 0xFB, 0x7C, 0xE3, 0x39, 0x82, 0x9B, 0x2F, 0xFF, 0x87, 0x34, 0x8E,
+    0x43, 0x44, 0xC4, 0xDE, 0xE9, 0xCB, 0x54, 0x7B, 0x94, 0x32, 0xA6, 0xC2, 0x23, 0x3D, 0xEE, 0x4C,
+    0x95, 0x0B, 0x42, 0xFA, 0xC3, 0x4E, 0x08, 0x2E, 0xA1, 0x66, 0x28, 0xD9, 0x24, 0xB2, 0x76, 0x5B,
+    0xA2, 0x49, 0x6D, 0x8B, 0xD1, 0x25, 0x72, 0xF8, 0xF6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xD4, 0xA4,
+    0x5C, 0xCC, 0x5D, 0x65, 0xB6, 0x92, 0x6C, 0x70, 0x48, 0x50, 0xFD, 0xED, 0xB9, 0xDA, 0x5E, 0x15,
+    0x46, 0x57, 0xA7, 0x8D, 0x9D, 0x84, 0x90, 0xD8, 0xAB, 0x00, 0x8C, 0xBC, 0xD3, 0x0A, 0xF7, 0xE4,
+    0x58, 0x05, 0xB8, 0xB3, 0x45, 0x06, 0xD0, 0x2C, 0x1E, 0x8F, 0xCA, 0x3F, 0x0F, 0x02, 0xC1, 0xAF,
+    0xBD, 0x03, 0x01, 0x13, 0x8A, 0x6B, 0x3A, 0x91, 0x11, 0x41, 0x4F, 0x67, 0xDC, 0xEA, 0x97, 0xF2,
+    0xCF, 0xCE, 0xF0, 0xB4, 0xE6, 0x73, 0x96, 0xAC, 0x74, 0x22, 0xE7, 0xAD, 0x35, 0x85, 0xE2, 0xF9,
+    0x37, 0xE8, 0x1C, 0x75, 0xDF, 0x6E, 0x47, 0xF1, 0x1A, 0x71, 0x1D, 0x29, 0xC5, 0x89, 0x6F, 0xB7,
+    0x62, 0x0E, 0xAA, 0x18, 0xBE, 0x1B, 0xFC, 0x56, 0x3E, 0x4B, 0xC6, 0xD2, 0x79, 0x20, 0x9A, 0xDB,
+    0xC0, 0xFE, 0x78, 0xCD, 0x5A, 0xF4, 0x1F, 0xDD, 0xA8, 0x33, 0x88, 0x07, 0xC7, 0x31, 0xB1, 0x12,
+    0x10, 0x59, 0x27, 0x80, 0xEC, 0x5F, 0x60, 0x51, 0x7F, 0xA9, 0x19, 0xB5, 0x4A, 0x0D, 0x2D, 0xE5,
+    0x7A, 0x9F, 0x93, 0xC9, 0x9C, 0xEF, 0xA0, 0xE0, 0x3B, 0x4D, 0xAE, 0x2A, 0xF5, 0xB0, 0xC8, 0xEB,
+    0xBB, 0x3C, 0x83, 0x53, 0x99, 0x61, 0x17, 0x2B, 0x04, 0x7E, 0xBA, 0x77, 0xD6, 0x26, 0xE1, 0x69,
+    0x14, 0x63, 0x55, 0x21, 0x0C, 0x7D};
+
+static const uint8_t aria_is2[256] = {0x30, 0x68, 0x99, 0x1B, 0x87, 0xB9, 0x21, 0x78, 0x50, 0x39,
+    0xDB, 0xE1, 0x72, 0x09, 0x62, 0x3C, 0x3E, 0x7E, 0x5E, 0x8E, 0xF1, 0xA0, 0xCC, 0xA3, 0x2A, 0x1D,
+    0xFB, 0xB6, 0xD6, 0x20, 0xC4, 0x8D, 0x81, 0x65, 0xF5, 0x89, 0xCB, 0x9D, 0x77, 0xC6, 0x57, 0x43,
+    0x56, 0x17, 0xD4, 0x40, 0x1A, 0x4D, 0xC0, 0x63, 0x6C, 0xE3, 0xB7, 0xC8, 0x64, 0x6A, 0x53, 0xAA,
+    0x38, 0x98, 0x0C, 0xF4, 0x9B, 0xED, 0x7F, 0x22, 0x76, 0xAF, 0xDD, 0x3A, 0x0B, 0x58, 0x67, 0x88,
+    0x06, 0xC3, 0x35, 0x0D, 0x01, 0x8B, 0x8C, 0xC2, 0xE6, 0x5F, 0x02, 0x24, 0x75, 0x93, 0x66, 0x1E,
+    0xE5, 0xE2, 0x54, 0xD8, 0x10, 0xCE, 0x7A, 0xE8, 0x08, 0x2C, 0x12, 0x97, 0x32, 0xAB, 0xB4, 0x27,
+    0x0A, 0x23, 0xDF, 0xEF, 0xCA, 0xD9, 0xB8, 0xFA, 0xDC, 0x31, 0x6B, 0xD1, 0xAD, 0x19, 0x49, 0xBD,
+    0x51, 0x96, 0xEE, 0xE4, 0xA8, 0x41, 0xDA, 0xFF, 0xCD, 0x55, 0x86, 0x36, 0xBE, 0x61, 0x52, 0xF8,
+    0xBB, 0x0E, 0x82, 0x48, 0x69, 0x9A, 0xE0, 0x47, 0x9E, 0x5C, 0x04, 0x4B, 0x34, 0x15, 0x79, 0x26,
+    0xA7, 0xDE, 0x29, 0xAE, 0x92, 0xD7, 0x84, 0xE9, 0xD2, 0xBA, 0x5D, 0xF3, 0xC5, 0xB0, 0xBF, 0xA4,
+    0x3B, 0x71, 0x44, 0x46, 0x2B, 0xFC, 0xEB, 0x6F, 0xD5, 0xF6, 0x14, 0xFE, 0x7C, 0x70, 0x5A, 0x7D,
+    0xFD, 0x2F, 0x18, 0x83, 0x16, 0xA5, 0x91, 0x1F, 0x05, 0x95, 0x74, 0xA9, 0xC1, 0x5B, 0x4A, 0x85,
+    0x6D, 0x13, 0x07, 0x4F, 0x4E, 0x45, 0xB2, 0x0F, 0xC9, 0x1C, 0xA6, 0xBC, 0xEC, 0x73, 0x90, 0x7B,
+    0xCF, 0x59, 0x8F, 0xA1, 0xF9, 0x2D, 0xF2, 0xB1, 0x00, 0x94, 0x37, 0x9F, 0xD0, 0x2E, 0x9C, 0x6E,
+    0x28, 0x3F, 0x80, 0xF0, 0x3D, 0xD3, 0x25, 0x8A, 0xB5, 0xE7, 0x42, 0xB3, 0xC7, 0xEA, 0xF7, 0x4C,
+    0x11, 0x33, 0x03, 0xA2, 0xAC, 0x60};
+
+/*
+ * Helper for key schedule: r = FO( p, k ) ^ x
+ */
+static void aria_fo_xor(uint32_t r[4], const uint32_t p[4], const uint32_t k[4],
+    const uint32_t x[4]) {
+    uint32_t a, b, c, d;
+
+    a = p[0] ^ k[0];
+    b = p[1] ^ k[1];
+    c = p[2] ^ k[2];
+    d = p[3] ^ k[3];
+
+    aria_sl(&a, &b, &c, &d, aria_sb1, aria_sb2, aria_is1, aria_is2);
+    aria_a(&a, &b, &c, &d);
+
+    r[0] = a ^ x[0];
+    r[1] = b ^ x[1];
+    r[2] = c ^ x[2];
+    r[3] = d ^ x[3];
+}
+
+/*
+ * Helper for key schedule: r = FE( p, k ) ^ x
+ */
+static void aria_fe_xor(uint32_t r[4], const uint32_t p[4], const uint32_t k[4],
+    const uint32_t x[4]) {
+    uint32_t a, b, c, d;
+
+    a = p[0] ^ k[0];
+    b = p[1] ^ k[1];
+    c = p[2] ^ k[2];
+    d = p[3] ^ k[3];
+
+    aria_sl(&a, &b, &c, &d, aria_is1, aria_is2, aria_sb1, aria_sb2);
+    aria_a(&a, &b, &c, &d);
+
+    r[0] = a ^ x[0];
+    r[1] = b ^ x[1];
+    r[2] = c ^ x[2];
+    r[3] = d ^ x[3];
+}
+
+/*
+ * Big endian 128-bit rotation: r = a ^ (b <<< n), used only in key setup.
+ *
+ * We chose to store bytes into 32-bit words in little-endian format (see
+ * MBEDTLS_GET_UINT32_LE / MBEDTLS_PUT_UINT32_LE ) so we need to reverse
+ * bytes here.
+ */
+static void aria_rot128(uint32_t r[4], const uint32_t a[4], const uint32_t b[4], uint8_t n) {
+    uint8_t i, j;
+    uint32_t t, u;
+
+    const uint8_t n1 = n % 32;           // bit offset
+    const uint8_t n2 = n1 ? 32 - n1 : 0; // reverse bit offset
+
+    j = (n / 32) % 4;  // initial word offset
+    t = ARIA_P3(b[j]); // big endian
+    for (i = 0; i < 4; i++) {
+        j = (j + 1) % 4; // get next word, big endian
+        u = ARIA_P3(b[j]);
+        t <<= n1; // rotate
+        t |= u >> n2;
+        t = ARIA_P3(t);  // back to little endian
+        r[i] = a[i] ^ t; // store
+        t = u;           // move to next word
+    }
+}
+
+/*
+ * Set encryption key
+ */
+int mbedtls_aria_setkey_enc(mbedtls_aria_context* ctx, const unsigned char* key,
+    unsigned int keybits) {
+    /* round constant masks */
+    const uint32_t rc[3][4] = {{0xB7C17C51, 0x940A2227, 0xE8AB13FE, 0xE06E9AFA},
+        {0xCC4AB16D, 0x20C8219E, 0xD5B128FF, 0xB0E25DEF},
+        {0x1D3792DB, 0x70E92621, 0x75972403, 0x0EC9E804}};
+
+    int i;
+    uint32_t w[4][4], *w2;
+    ARIA_VALIDATE_RET(ctx != NULL);
+    ARIA_VALIDATE_RET(key != NULL);
+
+    if (keybits != 128 && keybits != 192 && keybits != 256)
+        return (MBEDTLS_ERR_ARIA_BAD_INPUT_DATA);
+
+    /* Copy key to W0 (and potential remainder to W1) */
+    w[0][0] = MBEDTLS_GET_UINT32_LE(key, 0);
+    w[0][1] = MBEDTLS_GET_UINT32_LE(key, 4);
+    w[0][2] = MBEDTLS_GET_UINT32_LE(key, 8);
+    w[0][3] = MBEDTLS_GET_UINT32_LE(key, 12);
+
+    memset(w[1], 0, 16);
+    if (keybits >= 192) {
+        w[1][0] = MBEDTLS_GET_UINT32_LE(key, 16); // 192 bit key
+        w[1][1] = MBEDTLS_GET_UINT32_LE(key, 20);
+    }
+    if (keybits == 256) {
+        w[1][2] = MBEDTLS_GET_UINT32_LE(key, 24); // 256 bit key
+        w[1][3] = MBEDTLS_GET_UINT32_LE(key, 28);
+    }
+
+    i = (keybits - 128) >> 6; // index: 0, 1, 2
+    ctx->nr = 12 + 2 * i;     // no. rounds: 12, 14, 16
+
+    aria_fo_xor(w[1], w[0], rc[i], w[1]); // W1 = FO(W0, CK1) ^ KR
+    i = i < 2 ? i + 1 : 0;
+    aria_fe_xor(w[2], w[1], rc[i], w[0]); // W2 = FE(W1, CK2) ^ W0
+    i = i < 2 ? i + 1 : 0;
+    aria_fo_xor(w[3], w[2], rc[i], w[1]); // W3 = FO(W2, CK3) ^ W1
+
+    for (i = 0; i < 4; i++) // create round keys
+    {
+        w2 = w[(i + 1) & 3];
+        aria_rot128(ctx->rk[i], w[i], w2, 128 - 19);
+        aria_rot128(ctx->rk[i + 4], w[i], w2, 128 - 31);
+        aria_rot128(ctx->rk[i + 8], w[i], w2, 61);
+        aria_rot128(ctx->rk[i + 12], w[i], w2, 31);
+    }
+    aria_rot128(ctx->rk[16], w[0], w[1], 19);
+
+    /* w holds enough info to reconstruct the round keys */
+    mbedtls_platform_zeroize(w, sizeof(w));
+
+    return (0);
+}
+
+/*
+ * Set decryption key
+ */
+int mbedtls_aria_setkey_dec(mbedtls_aria_context* ctx, const unsigned char* key,
+    unsigned int keybits) {
+    int i, j, k, ret;
+    ARIA_VALIDATE_RET(ctx != NULL);
+    ARIA_VALIDATE_RET(key != NULL);
+
+    ret = mbedtls_aria_setkey_enc(ctx, key, keybits);
+    if (ret != 0)
+        return (ret);
+
+    /* flip the order of round keys */
+    for (i = 0, j = ctx->nr; i < j; i++, j--) {
+        for (k = 0; k < 4; k++) {
+            uint32_t t = ctx->rk[i][k];
+            ctx->rk[i][k] = ctx->rk[j][k];
+            ctx->rk[j][k] = t;
+        }
+    }
+
+    /* apply affine transform to middle keys */
+    for (i = 1; i < ctx->nr; i++) {
+        aria_a(&ctx->rk[i][0], &ctx->rk[i][1], &ctx->rk[i][2], &ctx->rk[i][3]);
+    }
+
+    return (0);
+}
+
+/*
+ * Encrypt a block
+ */
+int mbedtls_aria_crypt_ecb(mbedtls_aria_context* ctx,
+    const unsigned char input[MBEDTLS_ARIA_BLOCKSIZE],
+    unsigned char output[MBEDTLS_ARIA_BLOCKSIZE]) {
+    int i;
+
+    uint32_t a, b, c, d;
+    ARIA_VALIDATE_RET(ctx != NULL);
+    ARIA_VALIDATE_RET(input != NULL);
+    ARIA_VALIDATE_RET(output != NULL);
+
+    a = MBEDTLS_GET_UINT32_LE(input, 0);
+    b = MBEDTLS_GET_UINT32_LE(input, 4);
+    c = MBEDTLS_GET_UINT32_LE(input, 8);
+    d = MBEDTLS_GET_UINT32_LE(input, 12);
+
+    i = 0;
+    while (1) {
+        a ^= ctx->rk[i][0];
+        b ^= ctx->rk[i][1];
+        c ^= ctx->rk[i][2];
+        d ^= ctx->rk[i][3];
+        i++;
+
+        aria_sl(&a, &b, &c, &d, aria_sb1, aria_sb2, aria_is1, aria_is2);
+        aria_a(&a, &b, &c, &d);
+
+        a ^= ctx->rk[i][0];
+        b ^= ctx->rk[i][1];
+        c ^= ctx->rk[i][2];
+        d ^= ctx->rk[i][3];
+        i++;
+
+        aria_sl(&a, &b, &c, &d, aria_is1, aria_is2, aria_sb1, aria_sb2);
+        if (i >= ctx->nr)
+            break;
+        aria_a(&a, &b, &c, &d);
+    }
+
+    /* final key mixing */
+    a ^= ctx->rk[i][0];
+    b ^= ctx->rk[i][1];
+    c ^= ctx->rk[i][2];
+    d ^= ctx->rk[i][3];
+
+    MBEDTLS_PUT_UINT32_LE(a, output, 0);
+    MBEDTLS_PUT_UINT32_LE(b, output, 4);
+    MBEDTLS_PUT_UINT32_LE(c, output, 8);
+    MBEDTLS_PUT_UINT32_LE(d, output, 12);
+
+    return (0);
+}
+
+/* Initialize context */
+void mbedtls_aria_init(mbedtls_aria_context* ctx) {
+    ARIA_VALIDATE(ctx != NULL);
+    memset(ctx, 0, sizeof(mbedtls_aria_context));
+}
+
+/* Clear context */
+void mbedtls_aria_free(mbedtls_aria_context* ctx) {
+    if (ctx == NULL)
+        return;
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_aria_context));
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+/*
+ * ARIA-CBC buffer encryption/decryption
+ */
+int mbedtls_aria_crypt_cbc(mbedtls_aria_context* ctx, int mode, size_t length,
+    unsigned char iv[MBEDTLS_ARIA_BLOCKSIZE], const unsigned char* input, unsigned char* output) {
+    int i;
+    unsigned char temp[MBEDTLS_ARIA_BLOCKSIZE];
+
+    ARIA_VALIDATE_RET(ctx != NULL);
+    ARIA_VALIDATE_RET(mode == MBEDTLS_ARIA_ENCRYPT || mode == MBEDTLS_ARIA_DECRYPT);
+    ARIA_VALIDATE_RET(length == 0 || input != NULL);
+    ARIA_VALIDATE_RET(length == 0 || output != NULL);
+    ARIA_VALIDATE_RET(iv != NULL);
+
+    if (length % MBEDTLS_ARIA_BLOCKSIZE)
+        return (MBEDTLS_ERR_ARIA_INVALID_INPUT_LENGTH);
+
+    if (mode == MBEDTLS_ARIA_DECRYPT) {
+        while (length > 0) {
+            memcpy(temp, input, MBEDTLS_ARIA_BLOCKSIZE);
+            mbedtls_aria_crypt_ecb(ctx, input, output);
+
+            for (i = 0; i < MBEDTLS_ARIA_BLOCKSIZE; i++)
+                output[i] = (unsigned char)(output[i] ^ iv[i]);
+
+            memcpy(iv, temp, MBEDTLS_ARIA_BLOCKSIZE);
+
+            input += MBEDTLS_ARIA_BLOCKSIZE;
+            output += MBEDTLS_ARIA_BLOCKSIZE;
+            length -= MBEDTLS_ARIA_BLOCKSIZE;
+        }
+    } else {
+        while (length > 0) {
+            for (i = 0; i < MBEDTLS_ARIA_BLOCKSIZE; i++)
+                output[i] = (unsigned char)(input[i] ^ iv[i]);
+
+            mbedtls_aria_crypt_ecb(ctx, output, output);
+            memcpy(iv, output, MBEDTLS_ARIA_BLOCKSIZE);
+
+            input += MBEDTLS_ARIA_BLOCKSIZE;
+            output += MBEDTLS_ARIA_BLOCKSIZE;
+            length -= MBEDTLS_ARIA_BLOCKSIZE;
+        }
+    }
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+/*
+ * ARIA-CFB128 buffer encryption/decryption
+ */
+int mbedtls_aria_crypt_cfb128(mbedtls_aria_context* ctx, int mode, size_t length, size_t* iv_off,
+    unsigned char iv[MBEDTLS_ARIA_BLOCKSIZE], const unsigned char* input, unsigned char* output) {
+    unsigned char c;
+    size_t n;
+
+    ARIA_VALIDATE_RET(ctx != NULL);
+    ARIA_VALIDATE_RET(mode == MBEDTLS_ARIA_ENCRYPT || mode == MBEDTLS_ARIA_DECRYPT);
+    ARIA_VALIDATE_RET(length == 0 || input != NULL);
+    ARIA_VALIDATE_RET(length == 0 || output != NULL);
+    ARIA_VALIDATE_RET(iv != NULL);
+    ARIA_VALIDATE_RET(iv_off != NULL);
+
+    n = *iv_off;
+
+    /* An overly large value of n can lead to an unlimited
+     * buffer overflow. Therefore, guard against this
+     * outside of parameter validation. */
+    if (n >= MBEDTLS_ARIA_BLOCKSIZE)
+        return (MBEDTLS_ERR_ARIA_BAD_INPUT_DATA);
+
+    if (mode == MBEDTLS_ARIA_DECRYPT) {
+        while (length--) {
+            if (n == 0)
+                mbedtls_aria_crypt_ecb(ctx, iv, iv);
+
+            c = *input++;
+            *output++ = c ^ iv[n];
+            iv[n] = c;
+
+            n = (n + 1) & 0x0F;
+        }
+    } else {
+        while (length--) {
+            if (n == 0)
+                mbedtls_aria_crypt_ecb(ctx, iv, iv);
+
+            iv[n] = *output++ = (unsigned char)(iv[n] ^ *input++);
+
+            n = (n + 1) & 0x0F;
+        }
+    }
+
+    *iv_off = n;
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+/*
+ * ARIA-CTR buffer encryption/decryption
+ */
+int mbedtls_aria_crypt_ctr(mbedtls_aria_context* ctx, size_t length, size_t* nc_off,
+    unsigned char nonce_counter[MBEDTLS_ARIA_BLOCKSIZE],
+    unsigned char stream_block[MBEDTLS_ARIA_BLOCKSIZE], const unsigned char* input,
+    unsigned char* output) {
+    int c, i;
+    size_t n;
+
+    ARIA_VALIDATE_RET(ctx != NULL);
+    ARIA_VALIDATE_RET(length == 0 || input != NULL);
+    ARIA_VALIDATE_RET(length == 0 || output != NULL);
+    ARIA_VALIDATE_RET(nonce_counter != NULL);
+    ARIA_VALIDATE_RET(stream_block != NULL);
+    ARIA_VALIDATE_RET(nc_off != NULL);
+
+    n = *nc_off;
+    /* An overly large value of n can lead to an unlimited
+     * buffer overflow. Therefore, guard against this
+     * outside of parameter validation. */
+    if (n >= MBEDTLS_ARIA_BLOCKSIZE)
+        return (MBEDTLS_ERR_ARIA_BAD_INPUT_DATA);
+
+    while (length--) {
+        if (n == 0) {
+            mbedtls_aria_crypt_ecb(ctx, nonce_counter, stream_block);
+
+            for (i = MBEDTLS_ARIA_BLOCKSIZE; i > 0; i--)
+                if (++nonce_counter[i - 1] != 0)
+                    break;
+        }
+        c = *input++;
+        *output++ = (unsigned char)(c ^ stream_block[n]);
+
+        n = (n + 1) & 0x0F;
+    }
+
+    *nc_off = n;
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+#endif /* !MBEDTLS_ARIA_ALT */
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/*
+ * Basic ARIA ECB test vectors from RFC 5794
+ */
+static const uint8_t aria_test1_ecb_key[32] = // test key
+    {
+        0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, // 128 bit
+        0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16,
+        0x17,                                          // 192 bit
+        0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F // 256 bit
+};
+
+static const uint8_t aria_test1_ecb_pt[MBEDTLS_ARIA_BLOCKSIZE] = // plaintext
+    {
+        0x00, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77, // same for all
+        0x88, 0x99, 0xAA, 0xBB, 0xCC, 0xDD, 0xEE, 0xFF  // key sizes
+};
+
+static const uint8_t aria_test1_ecb_ct[3][MBEDTLS_ARIA_BLOCKSIZE] = // ciphertext
+    {{0xD7, 0x18, 0xFB, 0xD6, 0xAB, 0x64, 0x4C, 0x73,               // 128 bit
+         0x9D, 0xA9, 0x5F, 0x3B, 0xE6, 0x45, 0x17, 0x78},
+        {0x26, 0x44, 0x9C, 0x18, 0x05, 0xDB, 0xE7, 0xAA, // 192 bit
+            0x25, 0xA4, 0x68, 0xCE, 0x26, 0x3A, 0x9E, 0x79},
+        {0xF9, 0x2B, 0xD7, 0xC7, 0x9F, 0xB7, 0x2E, 0x2F, // 256 bit
+            0x2B, 0x8F, 0x80, 0xC1, 0x97, 0x2D, 0x24, 0xFC}};
+
+/*
+ * Mode tests from "Test Vectors for ARIA"  Version 1.0
+ * http://210.104.33.10/ARIA/doc/ARIA-testvector-e.pdf
+ */
+#if (defined(MBEDTLS_CIPHER_MODE_CBC) || defined(MBEDTLS_CIPHER_MODE_CFB) ||                       \
+     defined(MBEDTLS_CIPHER_MODE_CTR))
+static const uint8_t aria_test2_key[32] = {
+    0x00, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77, // 128 bit
+    0x88, 0x99, 0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0xff, 0x00, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66,
+    0x77,                                          // 192 bit
+    0x88, 0x99, 0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0xff // 256 bit
+};
+
+static const uint8_t aria_test2_pt[48] = {
+    0x11,
+    0x11,
+    0x11,
+    0x11,
+    0xaa,
+    0xaa,
+    0xaa,
+    0xaa, // same for all
+    0x11,
+    0x11,
+    0x11,
+    0x11,
+    0xbb,
+    0xbb,
+    0xbb,
+    0xbb,
+    0x11,
+    0x11,
+    0x11,
+    0x11,
+    0xcc,
+    0xcc,
+    0xcc,
+    0xcc,
+    0x11,
+    0x11,
+    0x11,
+    0x11,
+    0xdd,
+    0xdd,
+    0xdd,
+    0xdd,
+    0x22,
+    0x22,
+    0x22,
+    0x22,
+    0xaa,
+    0xaa,
+    0xaa,
+    0xaa,
+    0x22,
+    0x22,
+    0x22,
+    0x22,
+    0xbb,
+    0xbb,
+    0xbb,
+    0xbb,
+};
+#endif
+
+#if (defined(MBEDTLS_CIPHER_MODE_CBC) || defined(MBEDTLS_CIPHER_MODE_CFB))
+static const uint8_t aria_test2_iv[MBEDTLS_ARIA_BLOCKSIZE] = {
+    0x0f, 0x1e, 0x2d, 0x3c, 0x4b, 0x5a, 0x69, 0x78, // same for CBC, CFB
+    0x87, 0x96, 0xa5, 0xb4, 0xc3, 0xd2, 0xe1, 0xf0  // CTR has zero IV
+};
+#endif
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static const uint8_t aria_test2_cbc_ct[3][48] =       // CBC ciphertext
+    {{0x49, 0xd6, 0x18, 0x60, 0xb1, 0x49, 0x09, 0x10, // 128-bit key
+         0x9c, 0xef, 0x0d, 0x22, 0xa9, 0x26, 0x81, 0x34, 0xfa, 0xdf, 0x9f, 0xb2, 0x31, 0x51, 0xe9,
+         0x64, 0x5f, 0xba, 0x75, 0x01, 0x8b, 0xdb, 0x15, 0x38, 0xb5, 0x33, 0x34, 0x63, 0x4b, 0xbf,
+         0x7d, 0x4c, 0xd4, 0xb5, 0x37, 0x70, 0x33, 0x06, 0x0c, 0x15},
+        {0xaf, 0xe6, 0xcf, 0x23, 0x97, 0x4b, 0x53, 0x3c, // 192-bit key
+            0x67, 0x2a, 0x82, 0x62, 0x64, 0xea, 0x78, 0x5f, 0x4e, 0x4f, 0x7f, 0x78, 0x0d, 0xc7,
+            0xf3, 0xf1, 0xe0, 0x96, 0x2b, 0x80, 0x90, 0x23, 0x86, 0xd5, 0x14, 0xe9, 0xc3, 0xe7,
+            0x72, 0x59, 0xde, 0x92, 0xdd, 0x11, 0x02, 0xff, 0xab, 0x08, 0x6c, 0x1e},
+        {0x52, 0x3a, 0x8a, 0x80, 0x6a, 0xe6, 0x21, 0xf1, // 256-bit key
+            0x55, 0xfd, 0xd2, 0x8d, 0xbc, 0x34, 0xe1, 0xab, 0x7b, 0x9b, 0x42, 0x43, 0x2a, 0xd8,
+            0xb2, 0xef, 0xb9, 0x6e, 0x23, 0xb1, 0x3f, 0x0a, 0x6e, 0x52, 0xf3, 0x61, 0x85, 0xd5,
+            0x0a, 0xd0, 0x02, 0xc5, 0xf6, 0x01, 0xbe, 0xe5, 0x49, 0x3f, 0x11, 0x8b}};
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+static const uint8_t aria_test2_cfb_ct[3][48] =       // CFB ciphertext
+    {{0x37, 0x20, 0xe5, 0x3b, 0xa7, 0xd6, 0x15, 0x38, // 128-bit key
+         0x34, 0x06, 0xb0, 0x9f, 0x0a, 0x05, 0xa2, 0x00, 0xc0, 0x7c, 0x21, 0xe6, 0x37, 0x0f, 0x41,
+         0x3a, 0x5d, 0x13, 0x25, 0x00, 0xa6, 0x82, 0x85, 0x01, 0x7c, 0x61, 0xb4, 0x34, 0xc7, 0xb7,
+         0xca, 0x96, 0x85, 0xa5, 0x10, 0x71, 0x86, 0x1e, 0x4d, 0x4b},
+        {0x41, 0x71, 0xf7, 0x19, 0x2b, 0xf4, 0x49, 0x54, // 192-bit key
+            0x94, 0xd2, 0x73, 0x61, 0x29, 0x64, 0x0f, 0x5c, 0x4d, 0x87, 0xa9, 0xa2, 0x13, 0x66,
+            0x4c, 0x94, 0x48, 0x47, 0x7c, 0x6e, 0xcc, 0x20, 0x13, 0x59, 0x8d, 0x97, 0x66, 0x95,
+            0x2d, 0xd8, 0xc3, 0x86, 0x8f, 0x17, 0xe3, 0x6e, 0xf6, 0x6f, 0xd8, 0x4b},
+        {0x26, 0x83, 0x47, 0x05, 0xb0, 0xf2, 0xc0, 0xe2, // 256-bit key
+            0x58, 0x8d, 0x4a, 0x7f, 0x09, 0x00, 0x96, 0x35, 0xf2, 0x8b, 0xb9, 0x3d, 0x8c, 0x31,
+            0xf8, 0x70, 0xec, 0x1e, 0x0b, 0xdb, 0x08, 0x2b, 0x66, 0xfa, 0x40, 0x2d, 0xd9, 0xc2,
+            0x02, 0xbe, 0x30, 0x0c, 0x45, 0x17, 0xd1, 0x96, 0xb1, 0x4d, 0x4c, 0xe1}};
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+static const uint8_t aria_test2_ctr_ct[3][48] =       // CTR ciphertext
+    {{0xac, 0x5d, 0x7d, 0xe8, 0x05, 0xa0, 0xbf, 0x1c, // 128-bit key
+         0x57, 0xc8, 0x54, 0x50, 0x1a, 0xf6, 0x0f, 0xa1, 0x14, 0x97, 0xe2, 0xa3, 0x45, 0x19, 0xde,
+         0xa1, 0x56, 0x9e, 0x91, 0xe5, 0xb5, 0xcc, 0xae, 0x2f, 0xf3, 0xbf, 0xa1, 0xbf, 0x97, 0x5f,
+         0x45, 0x71, 0xf4, 0x8b, 0xe1, 0x91, 0x61, 0x35, 0x46, 0xc3},
+        {0x08, 0x62, 0x5c, 0xa8, 0xfe, 0x56, 0x9c, 0x19, // 192-bit key
+            0xba, 0x7a, 0xf3, 0x76, 0x0a, 0x6e, 0xd1, 0xce, 0xf4, 0xd1, 0x99, 0x26, 0x3e, 0x99,
+            0x9d, 0xde, 0x14, 0x08, 0x2d, 0xbb, 0xa7, 0x56, 0x0b, 0x79, 0xa4, 0xc6, 0xb4, 0x56,
+            0xb8, 0x70, 0x7d, 0xce, 0x75, 0x1f, 0x98, 0x54, 0xf1, 0x88, 0x93, 0xdf},
+        {0x30, 0x02, 0x6c, 0x32, 0x96, 0x66, 0x14, 0x17, // 256-bit key
+            0x21, 0x17, 0x8b, 0x99, 0xc0, 0xa1, 0xf1, 0xb2, 0xf0, 0x69, 0x40, 0x25, 0x3f, 0x7b,
+            0x30, 0x89, 0xe2, 0xa3, 0x0e, 0xa8, 0x6a, 0xa3, 0xc8, 0x8f, 0x59, 0x40, 0xf0, 0x5a,
+            0xd7, 0xee, 0x41, 0xd7, 0x13, 0x47, 0xbb, 0x72, 0x61, 0xe3, 0x48, 0xf1}};
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#define ARIA_SELF_TEST_IF_FAIL                                                                     \
+    {                                                                                              \
+        if (verbose)                                                                               \
+            mbedtls_printf("failed\n");                                                            \
+        goto exit;                                                                                 \
+    }                                                                                              \
+    else {                                                                                         \
+        if (verbose)                                                                               \
+            mbedtls_printf("passed\n");                                                            \
+    }
+
+/*
+ * Checkup routine
+ */
+int mbedtls_aria_self_test(int verbose) {
+    int i;
+    uint8_t blk[MBEDTLS_ARIA_BLOCKSIZE];
+    mbedtls_aria_context ctx;
+    int ret = 1;
+
+#if (defined(MBEDTLS_CIPHER_MODE_CFB) || defined(MBEDTLS_CIPHER_MODE_CTR))
+    size_t j;
+#endif
+
+#if (defined(MBEDTLS_CIPHER_MODE_CBC) || defined(MBEDTLS_CIPHER_MODE_CFB) ||                       \
+     defined(MBEDTLS_CIPHER_MODE_CTR))
+    uint8_t buf[48], iv[MBEDTLS_ARIA_BLOCKSIZE];
+#endif
+
+    mbedtls_aria_init(&ctx);
+
+    /*
+     * Test set 1
+     */
+    for (i = 0; i < 3; i++) {
+        /* test ECB encryption */
+        if (verbose)
+            mbedtls_printf("  ARIA-ECB-%d (enc): ", 128 + 64 * i);
+        mbedtls_aria_setkey_enc(&ctx, aria_test1_ecb_key, 128 + 64 * i);
+        mbedtls_aria_crypt_ecb(&ctx, aria_test1_ecb_pt, blk);
+        if (memcmp(blk, aria_test1_ecb_ct[i], MBEDTLS_ARIA_BLOCKSIZE) != 0)
+            ARIA_SELF_TEST_IF_FAIL;
+
+        /* test ECB decryption */
+        if (verbose)
+            mbedtls_printf("  ARIA-ECB-%d (dec): ", 128 + 64 * i);
+        mbedtls_aria_setkey_dec(&ctx, aria_test1_ecb_key, 128 + 64 * i);
+        mbedtls_aria_crypt_ecb(&ctx, aria_test1_ecb_ct[i], blk);
+        if (memcmp(blk, aria_test1_ecb_pt, MBEDTLS_ARIA_BLOCKSIZE) != 0)
+            ARIA_SELF_TEST_IF_FAIL;
+    }
+    if (verbose)
+        mbedtls_printf("\n");
+
+        /*
+         * Test set 2
+         */
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    for (i = 0; i < 3; i++) {
+        /* Test CBC encryption */
+        if (verbose)
+            mbedtls_printf("  ARIA-CBC-%d (enc): ", 128 + 64 * i);
+        mbedtls_aria_setkey_enc(&ctx, aria_test2_key, 128 + 64 * i);
+        memcpy(iv, aria_test2_iv, MBEDTLS_ARIA_BLOCKSIZE);
+        memset(buf, 0x55, sizeof(buf));
+        mbedtls_aria_crypt_cbc(&ctx, MBEDTLS_ARIA_ENCRYPT, 48, iv, aria_test2_pt, buf);
+        if (memcmp(buf, aria_test2_cbc_ct[i], 48) != 0)
+            ARIA_SELF_TEST_IF_FAIL;
+
+        /* Test CBC decryption */
+        if (verbose)
+            mbedtls_printf("  ARIA-CBC-%d (dec): ", 128 + 64 * i);
+        mbedtls_aria_setkey_dec(&ctx, aria_test2_key, 128 + 64 * i);
+        memcpy(iv, aria_test2_iv, MBEDTLS_ARIA_BLOCKSIZE);
+        memset(buf, 0xAA, sizeof(buf));
+        mbedtls_aria_crypt_cbc(&ctx, MBEDTLS_ARIA_DECRYPT, 48, iv, aria_test2_cbc_ct[i], buf);
+        if (memcmp(buf, aria_test2_pt, 48) != 0)
+            ARIA_SELF_TEST_IF_FAIL;
+    }
+    if (verbose)
+        mbedtls_printf("\n");
+
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    for (i = 0; i < 3; i++) {
+        /* Test CFB encryption */
+        if (verbose)
+            mbedtls_printf("  ARIA-CFB-%d (enc): ", 128 + 64 * i);
+        mbedtls_aria_setkey_enc(&ctx, aria_test2_key, 128 + 64 * i);
+        memcpy(iv, aria_test2_iv, MBEDTLS_ARIA_BLOCKSIZE);
+        memset(buf, 0x55, sizeof(buf));
+        j = 0;
+        mbedtls_aria_crypt_cfb128(&ctx, MBEDTLS_ARIA_ENCRYPT, 48, &j, iv, aria_test2_pt, buf);
+        if (memcmp(buf, aria_test2_cfb_ct[i], 48) != 0)
+            ARIA_SELF_TEST_IF_FAIL;
+
+        /* Test CFB decryption */
+        if (verbose)
+            mbedtls_printf("  ARIA-CFB-%d (dec): ", 128 + 64 * i);
+        mbedtls_aria_setkey_enc(&ctx, aria_test2_key, 128 + 64 * i);
+        memcpy(iv, aria_test2_iv, MBEDTLS_ARIA_BLOCKSIZE);
+        memset(buf, 0xAA, sizeof(buf));
+        j = 0;
+        mbedtls_aria_crypt_cfb128(&ctx, MBEDTLS_ARIA_DECRYPT, 48, &j, iv, aria_test2_cfb_ct[i],
+            buf);
+        if (memcmp(buf, aria_test2_pt, 48) != 0)
+            ARIA_SELF_TEST_IF_FAIL;
+    }
+    if (verbose)
+        mbedtls_printf("\n");
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    for (i = 0; i < 3; i++) {
+        /* Test CTR encryption */
+        if (verbose)
+            mbedtls_printf("  ARIA-CTR-%d (enc): ", 128 + 64 * i);
+        mbedtls_aria_setkey_enc(&ctx, aria_test2_key, 128 + 64 * i);
+        memset(iv, 0, MBEDTLS_ARIA_BLOCKSIZE); // IV = 0
+        memset(buf, 0x55, sizeof(buf));
+        j = 0;
+        mbedtls_aria_crypt_ctr(&ctx, 48, &j, iv, blk, aria_test2_pt, buf);
+        if (memcmp(buf, aria_test2_ctr_ct[i], 48) != 0)
+            ARIA_SELF_TEST_IF_FAIL;
+
+        /* Test CTR decryption */
+        if (verbose)
+            mbedtls_printf("  ARIA-CTR-%d (dec): ", 128 + 64 * i);
+        mbedtls_aria_setkey_enc(&ctx, aria_test2_key, 128 + 64 * i);
+        memset(iv, 0, MBEDTLS_ARIA_BLOCKSIZE); // IV = 0
+        memset(buf, 0xAA, sizeof(buf));
+        j = 0;
+        mbedtls_aria_crypt_ctr(&ctx, 48, &j, iv, blk, aria_test2_ctr_ct[i], buf);
+        if (memcmp(buf, aria_test2_pt, 48) != 0)
+            ARIA_SELF_TEST_IF_FAIL;
+    }
+    if (verbose)
+        mbedtls_printf("\n");
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+    ret = 0;
+
+exit:
+    mbedtls_aria_free(&ctx);
+    return (ret);
+}
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_ARIA_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/asn1parse.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/asn1parse.cpp
new file mode 100644
index 0000000000..f1d4af27c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/asn1parse.cpp
@@ -0,0 +1,415 @@
+/*
+ *  Generic ASN.1 parsing
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_ASN1_PARSE_C)
+
+#include <string.h>
+
+#include "mbedtls/asn1.h"
+#include "mbedtls/error.h"
+#include "mbedtls/platform_util.h"
+
+#if defined(MBEDTLS_BIGNUM_C)
+#include "mbedtls/bignum.h"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdlib.h>
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif
+
+/*
+ * ASN.1 DER decoding routines
+ */
+int mbedtls_asn1_get_len(unsigned char** p, const unsigned char* end, size_t* len) {
+    if ((end - *p) < 1)
+        return (MBEDTLS_ERR_ASN1_OUT_OF_DATA);
+
+    if ((**p & 0x80) == 0)
+        *len = *(*p)++;
+    else {
+        switch (**p & 0x7F) {
+        case 1:
+            if ((end - *p) < 2)
+                return (MBEDTLS_ERR_ASN1_OUT_OF_DATA);
+
+            *len = (*p)[1];
+            (*p) += 2;
+            break;
+
+        case 2:
+            if ((end - *p) < 3)
+                return (MBEDTLS_ERR_ASN1_OUT_OF_DATA);
+
+            *len = ((size_t)(*p)[1] << 8) | (*p)[2];
+            (*p) += 3;
+            break;
+
+        case 3:
+            if ((end - *p) < 4)
+                return (MBEDTLS_ERR_ASN1_OUT_OF_DATA);
+
+            *len = ((size_t)(*p)[1] << 16) | ((size_t)(*p)[2] << 8) | (*p)[3];
+            (*p) += 4;
+            break;
+
+        case 4:
+            if ((end - *p) < 5)
+                return (MBEDTLS_ERR_ASN1_OUT_OF_DATA);
+
+            *len = ((size_t)(*p)[1] << 24) | ((size_t)(*p)[2] << 16) | ((size_t)(*p)[3] << 8) |
+                   (*p)[4];
+            (*p) += 5;
+            break;
+
+        default:
+            return (MBEDTLS_ERR_ASN1_INVALID_LENGTH);
+        }
+    }
+
+    if (*len > (size_t)(end - *p))
+        return (MBEDTLS_ERR_ASN1_OUT_OF_DATA);
+
+    return (0);
+}
+
+int mbedtls_asn1_get_tag(unsigned char** p, const unsigned char* end, size_t* len, int tag) {
+    if ((end - *p) < 1)
+        return (MBEDTLS_ERR_ASN1_OUT_OF_DATA);
+
+    if (**p != tag)
+        return (MBEDTLS_ERR_ASN1_UNEXPECTED_TAG);
+
+    (*p)++;
+
+    return (mbedtls_asn1_get_len(p, end, len));
+}
+
+int mbedtls_asn1_get_bool(unsigned char** p, const unsigned char* end, int* val) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t len;
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, &len, MBEDTLS_ASN1_BOOLEAN)) != 0)
+        return (ret);
+
+    if (len != 1)
+        return (MBEDTLS_ERR_ASN1_INVALID_LENGTH);
+
+    *val = (**p != 0) ? 1 : 0;
+    (*p)++;
+
+    return (0);
+}
+
+static int asn1_get_tagged_int(unsigned char** p, const unsigned char* end, int tag, int* val) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t len;
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, &len, tag)) != 0)
+        return (ret);
+
+    /*
+     * len==0 is malformed (0 must be represented as 020100 for INTEGER,
+     * or 0A0100 for ENUMERATED tags
+     */
+    if (len == 0)
+        return (MBEDTLS_ERR_ASN1_INVALID_LENGTH);
+    /* This is a cryptography library. Reject negative integers. */
+    if ((**p & 0x80) != 0)
+        return (MBEDTLS_ERR_ASN1_INVALID_LENGTH);
+
+    /* Skip leading zeros. */
+    while (len > 0 && **p == 0) {
+        ++(*p);
+        --len;
+    }
+
+    /* Reject integers that don't fit in an int. This code assumes that
+     * the int type has no padding bit. */
+    if (len > sizeof(int))
+        return (MBEDTLS_ERR_ASN1_INVALID_LENGTH);
+    if (len == sizeof(int) && (**p & 0x80) != 0)
+        return (MBEDTLS_ERR_ASN1_INVALID_LENGTH);
+
+    *val = 0;
+    while (len-- > 0) {
+        *val = (*val << 8) | **p;
+        (*p)++;
+    }
+
+    return (0);
+}
+
+int mbedtls_asn1_get_int(unsigned char** p, const unsigned char* end, int* val) {
+    return (asn1_get_tagged_int(p, end, MBEDTLS_ASN1_INTEGER, val));
+}
+
+int mbedtls_asn1_get_enum(unsigned char** p, const unsigned char* end, int* val) {
+    return (asn1_get_tagged_int(p, end, MBEDTLS_ASN1_ENUMERATED, val));
+}
+
+#if defined(MBEDTLS_BIGNUM_C)
+int mbedtls_asn1_get_mpi(unsigned char** p, const unsigned char* end, mbedtls_mpi* X) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t len;
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, &len, MBEDTLS_ASN1_INTEGER)) != 0)
+        return (ret);
+
+    ret = mbedtls_mpi_read_binary(X, *p, len);
+
+    *p += len;
+
+    return (ret);
+}
+#endif /* MBEDTLS_BIGNUM_C */
+
+int mbedtls_asn1_get_bitstring(unsigned char** p, const unsigned char* end,
+    mbedtls_asn1_bitstring* bs) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    /* Certificate type is a single byte bitstring */
+    if ((ret = mbedtls_asn1_get_tag(p, end, &bs->len, MBEDTLS_ASN1_BIT_STRING)) != 0)
+        return (ret);
+
+    /* Check length, subtract one for actual bit string length */
+    if (bs->len < 1)
+        return (MBEDTLS_ERR_ASN1_OUT_OF_DATA);
+    bs->len -= 1;
+
+    /* Get number of unused bits, ensure unused bits <= 7 */
+    bs->unused_bits = **p;
+    if (bs->unused_bits > 7)
+        return (MBEDTLS_ERR_ASN1_INVALID_LENGTH);
+    (*p)++;
+
+    /* Get actual bitstring */
+    bs->p = *p;
+    *p += bs->len;
+
+    if (*p != end)
+        return (MBEDTLS_ERR_ASN1_LENGTH_MISMATCH);
+
+    return (0);
+}
+
+/*
+ * Traverse an ASN.1 "SEQUENCE OF <tag>"
+ * and call a callback for each entry found.
+ */
+int mbedtls_asn1_traverse_sequence_of(unsigned char** p, const unsigned char* end,
+    unsigned char tag_must_mask, unsigned char tag_must_val, unsigned char tag_may_mask,
+    unsigned char tag_may_val, int (*cb)(void* ctx, int tag, unsigned char* start, size_t len),
+    void* ctx) {
+    int ret;
+    size_t len;
+
+    /* Get main sequence tag */
+    if ((ret = mbedtls_asn1_get_tag(p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0) {
+        return (ret);
+    }
+
+    if (*p + len != end)
+        return (MBEDTLS_ERR_ASN1_LENGTH_MISMATCH);
+
+    while (*p < end) {
+        unsigned char const tag = *(*p)++;
+
+        if ((tag & tag_must_mask) != tag_must_val)
+            return (MBEDTLS_ERR_ASN1_UNEXPECTED_TAG);
+
+        if ((ret = mbedtls_asn1_get_len(p, end, &len)) != 0)
+            return (ret);
+
+        if ((tag & tag_may_mask) == tag_may_val) {
+            if (cb != NULL) {
+                ret = cb(ctx, tag, *p, len);
+                if (ret != 0)
+                    return (ret);
+            }
+        }
+
+        *p += len;
+    }
+
+    return (0);
+}
+
+/*
+ * Get a bit string without unused bits
+ */
+int mbedtls_asn1_get_bitstring_null(unsigned char** p, const unsigned char* end, size_t* len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, len, MBEDTLS_ASN1_BIT_STRING)) != 0)
+        return (ret);
+
+    if (*len == 0)
+        return (MBEDTLS_ERR_ASN1_INVALID_DATA);
+    --(*len);
+
+    if (**p != 0)
+        return (MBEDTLS_ERR_ASN1_INVALID_DATA);
+    ++(*p);
+
+    return (0);
+}
+
+void mbedtls_asn1_sequence_free(mbedtls_asn1_sequence* seq) {
+    while (seq != NULL) {
+        mbedtls_asn1_sequence* next = seq->next;
+        mbedtls_platform_zeroize(seq, sizeof(*seq));
+        mbedtls_free(seq);
+        seq = next;
+    }
+}
+
+typedef struct {
+    int tag;
+    mbedtls_asn1_sequence* cur;
+} asn1_get_sequence_of_cb_ctx_t;
+
+static int asn1_get_sequence_of_cb(void* ctx, int tag, unsigned char* start, size_t len) {
+    asn1_get_sequence_of_cb_ctx_t* cb_ctx = (asn1_get_sequence_of_cb_ctx_t*)ctx;
+    mbedtls_asn1_sequence* cur = cb_ctx->cur;
+
+    if (cur->buf.p != NULL) {
+        cur->next = (struct mbedtls_asn1_sequence*)mbedtls_calloc(1, sizeof(mbedtls_asn1_sequence));
+
+        if (cur->next == NULL)
+            return (MBEDTLS_ERR_ASN1_ALLOC_FAILED);
+
+        cur = cur->next;
+    }
+
+    cur->buf.p = start;
+    cur->buf.len = len;
+    cur->buf.tag = tag;
+
+    cb_ctx->cur = cur;
+    return (0);
+}
+
+/*
+ *  Parses and splits an ASN.1 "SEQUENCE OF <tag>"
+ */
+int mbedtls_asn1_get_sequence_of(unsigned char** p, const unsigned char* end,
+    mbedtls_asn1_sequence* cur, int tag) {
+    asn1_get_sequence_of_cb_ctx_t cb_ctx = {tag, cur};
+    memset(cur, 0, sizeof(mbedtls_asn1_sequence));
+    return (mbedtls_asn1_traverse_sequence_of(p, end, 0xFF, tag, 0, 0, asn1_get_sequence_of_cb,
+        &cb_ctx));
+}
+
+int mbedtls_asn1_get_alg(unsigned char** p, const unsigned char* end, mbedtls_asn1_buf* alg,
+    mbedtls_asn1_buf* params) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t len;
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0)
+        return (ret);
+
+    if ((end - *p) < 1)
+        return (MBEDTLS_ERR_ASN1_OUT_OF_DATA);
+
+    alg->tag = **p;
+    end = *p + len;
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, &alg->len, MBEDTLS_ASN1_OID)) != 0)
+        return (ret);
+
+    alg->p = *p;
+    *p += alg->len;
+
+    if (*p == end) {
+        mbedtls_platform_zeroize(params, sizeof(mbedtls_asn1_buf));
+        return (0);
+    }
+
+    params->tag = **p;
+    (*p)++;
+
+    if ((ret = mbedtls_asn1_get_len(p, end, &params->len)) != 0)
+        return (ret);
+
+    params->p = *p;
+    *p += params->len;
+
+    if (*p != end)
+        return (MBEDTLS_ERR_ASN1_LENGTH_MISMATCH);
+
+    return (0);
+}
+
+int mbedtls_asn1_get_alg_null(unsigned char** p, const unsigned char* end, mbedtls_asn1_buf* alg) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_asn1_buf params;
+
+    memset(&params, 0, sizeof(mbedtls_asn1_buf));
+
+    if ((ret = mbedtls_asn1_get_alg(p, end, alg, &params)) != 0)
+        return (ret);
+
+    if ((params.tag != MBEDTLS_ASN1_NULL && params.tag != 0) || params.len != 0)
+        return (MBEDTLS_ERR_ASN1_INVALID_DATA);
+
+    return (0);
+}
+
+void mbedtls_asn1_free_named_data(mbedtls_asn1_named_data* cur) {
+    if (cur == NULL)
+        return;
+
+    mbedtls_free(cur->oid.p);
+    mbedtls_free(cur->val.p);
+
+    mbedtls_platform_zeroize(cur, sizeof(mbedtls_asn1_named_data));
+}
+
+void mbedtls_asn1_free_named_data_list(mbedtls_asn1_named_data** head) {
+    mbedtls_asn1_named_data* cur;
+
+    while ((cur = *head) != NULL) {
+        *head = cur->next;
+        mbedtls_asn1_free_named_data(cur);
+        mbedtls_free(cur);
+    }
+}
+
+const mbedtls_asn1_named_data* mbedtls_asn1_find_named_data(const mbedtls_asn1_named_data* list,
+    const char* oid, size_t len) {
+    while (list != NULL) {
+        if (list->oid.len == len && memcmp(list->oid.p, oid, len) == 0) {
+            break;
+        }
+
+        list = list->next;
+    }
+
+    return (list);
+}
+
+#endif /* MBEDTLS_ASN1_PARSE_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/base64.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/base64.cpp
new file mode 100644
index 0000000000..cea5cedebc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/base64.cpp
@@ -0,0 +1,250 @@
+/*
+ *  RFC 1521 base64 encoding/decoding
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_BASE64_C)
+
+#include <stdint.h>
+
+#include "constant_time_internal.h"
+#include "mbedtls/base64.h"
+
+#if defined(MBEDTLS_SELF_TEST)
+#include <string.h>
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdio.h>
+#define mbedtls_printf printf
+#endif /* MBEDTLS_PLATFORM_C */
+#endif /* MBEDTLS_SELF_TEST */
+
+#define BASE64_SIZE_T_MAX ((size_t) - 1) /* SIZE_T_MAX is not standard */
+
+/*
+ * Encode a buffer into base64 format
+ */
+int mbedtls_base64_encode(unsigned char* dst, size_t dlen, size_t* olen, const unsigned char* src,
+    size_t slen) {
+    size_t i, n;
+    int C1, C2, C3;
+    unsigned char* p;
+
+    if (slen == 0) {
+        *olen = 0;
+        return (0);
+    }
+
+    n = slen / 3 + (slen % 3 != 0);
+
+    if (n > (BASE64_SIZE_T_MAX - 1) / 4) {
+        *olen = BASE64_SIZE_T_MAX;
+        return (MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL);
+    }
+
+    n *= 4;
+
+    if ((dlen < n + 1) || (NULL == dst)) {
+        *olen = n + 1;
+        return (MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL);
+    }
+
+    n = (slen / 3) * 3;
+
+    for (i = 0, p = dst; i < n; i += 3) {
+        C1 = *src++;
+        C2 = *src++;
+        C3 = *src++;
+
+        *p++ = mbedtls_ct_base64_enc_char((C1 >> 2) & 0x3F);
+        *p++ = mbedtls_ct_base64_enc_char((((C1 & 3) << 4) + (C2 >> 4)) & 0x3F);
+        *p++ = mbedtls_ct_base64_enc_char((((C2 & 15) << 2) + (C3 >> 6)) & 0x3F);
+        *p++ = mbedtls_ct_base64_enc_char(C3 & 0x3F);
+    }
+
+    if (i < slen) {
+        C1 = *src++;
+        C2 = ((i + 1) < slen) ? *src++ : 0;
+
+        *p++ = mbedtls_ct_base64_enc_char((C1 >> 2) & 0x3F);
+        *p++ = mbedtls_ct_base64_enc_char((((C1 & 3) << 4) + (C2 >> 4)) & 0x3F);
+
+        if ((i + 1) < slen)
+            *p++ = mbedtls_ct_base64_enc_char(((C2 & 15) << 2) & 0x3F);
+        else
+            *p++ = '=';
+
+        *p++ = '=';
+    }
+
+    *olen = p - dst;
+    *p = 0;
+
+    return (0);
+}
+
+/*
+ * Decode a base64-formatted buffer
+ */
+int mbedtls_base64_decode(unsigned char* dst, size_t dlen, size_t* olen, const unsigned char* src,
+    size_t slen) {
+    size_t i;   /* index in source */
+    size_t n;   /* number of digits or trailing = in source */
+    uint32_t x; /* value accumulator */
+    unsigned accumulated_digits = 0;
+    unsigned equals = 0;
+    int spaces_present = 0;
+    unsigned char* p;
+
+    /* First pass: check for validity and get output length */
+    for (i = n = 0; i < slen; i++) {
+        /* Skip spaces before checking for EOL */
+        spaces_present = 0;
+        while (i < slen && src[i] == ' ') {
+            ++i;
+            spaces_present = 1;
+        }
+
+        /* Spaces at end of buffer are OK */
+        if (i == slen)
+            break;
+
+        if ((slen - i) >= 2 && src[i] == '\r' && src[i + 1] == '\n')
+            continue;
+
+        if (src[i] == '\n')
+            continue;
+
+        /* Space inside a line is an error */
+        if (spaces_present)
+            return (MBEDTLS_ERR_BASE64_INVALID_CHARACTER);
+
+        if (src[i] > 127)
+            return (MBEDTLS_ERR_BASE64_INVALID_CHARACTER);
+
+        if (src[i] == '=') {
+            if (++equals > 2)
+                return (MBEDTLS_ERR_BASE64_INVALID_CHARACTER);
+        } else {
+            if (equals != 0)
+                return (MBEDTLS_ERR_BASE64_INVALID_CHARACTER);
+            if (mbedtls_ct_base64_dec_value(src[i]) < 0)
+                return (MBEDTLS_ERR_BASE64_INVALID_CHARACTER);
+        }
+        n++;
+    }
+
+    if (n == 0) {
+        *olen = 0;
+        return (0);
+    }
+
+    /* The following expression is to calculate the following formula without
+     * risk of integer overflow in n:
+     *     n = ( ( n * 6 ) + 7 ) >> 3;
+     */
+    n = (6 * (n >> 3)) + ((6 * (n & 0x7) + 7) >> 3);
+    n -= equals;
+
+    if (dst == NULL || dlen < n) {
+        *olen = n;
+        return (MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL);
+    }
+
+    equals = 0;
+    for (x = 0, p = dst; i > 0; i--, src++) {
+        if (*src == '\r' || *src == '\n' || *src == ' ')
+            continue;
+
+        x = x << 6;
+        if (*src == '=')
+            ++equals;
+        else
+            x |= mbedtls_ct_base64_dec_value(*src);
+
+        if (++accumulated_digits == 4) {
+            accumulated_digits = 0;
+            *p++ = MBEDTLS_BYTE_2(x);
+            if (equals <= 1)
+                *p++ = MBEDTLS_BYTE_1(x);
+            if (equals <= 0)
+                *p++ = MBEDTLS_BYTE_0(x);
+        }
+    }
+
+    *olen = p - dst;
+
+    return (0);
+}
+
+#if defined(MBEDTLS_SELF_TEST)
+
+static const unsigned char base64_test_dec[64] = {0x24, 0x48, 0x6E, 0x56, 0x87, 0x62, 0x5A, 0xBD,
+    0xBF, 0x17, 0xD9, 0xA2, 0xC4, 0x17, 0x1A, 0x01, 0x94, 0xED, 0x8F, 0x1E, 0x11, 0xB3, 0xD7, 0x09,
+    0x0C, 0xB6, 0xE9, 0x10, 0x6F, 0x22, 0xEE, 0x13, 0xCA, 0xB3, 0x07, 0x05, 0x76, 0xC9, 0xFA, 0x31,
+    0x6C, 0x08, 0x34, 0xFF, 0x8D, 0xC2, 0x6C, 0x38, 0x00, 0x43, 0xE9, 0x54, 0x97, 0xAF, 0x50, 0x4B,
+    0xD1, 0x41, 0xBA, 0x95, 0x31, 0x5A, 0x0B, 0x97};
+
+static const unsigned char base64_test_enc[] = "JEhuVodiWr2/F9mixBcaAZTtjx4Rs9cJDLbpEG8i7hPK"
+                                               "swcFdsn6MWwINP+Nwmw4AEPpVJevUEvRQbqVMVoLlw==";
+
+/*
+ * Checkup routine
+ */
+int mbedtls_base64_self_test(int verbose) {
+    size_t len;
+    const unsigned char* src;
+    unsigned char buffer[128];
+
+    if (verbose != 0)
+        mbedtls_printf("  Base64 encoding test: ");
+
+    src = base64_test_dec;
+
+    if (mbedtls_base64_encode(buffer, sizeof(buffer), &len, src, 64) != 0 ||
+        memcmp(base64_test_enc, buffer, 88) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        return (1);
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n  Base64 decoding test: ");
+
+    src = base64_test_enc;
+
+    if (mbedtls_base64_decode(buffer, sizeof(buffer), &len, src, 88) != 0 ||
+        memcmp(base64_test_dec, buffer, 64) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        return (1);
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n\n");
+
+    return (0);
+}
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_BASE64_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/bignum.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/bignum.cpp
new file mode 100644
index 0000000000..39b733381d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/bignum.cpp
@@ -0,0 +1,2892 @@
+/*
+ *  Multi-precision integer library
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+/*
+ *  The following sources were referenced in the design of this Multi-precision
+ *  Integer library:
+ *
+ *  [1] Handbook of Applied Cryptography - 1997
+ *      Menezes, van Oorschot and Vanstone
+ *
+ *  [2] Multi-Precision Math
+ *      Tom St Denis
+ *      https://github.com/libtom/libtommath/blob/develop/tommath.pdf
+ *
+ *  [3] GNU Multi-Precision Arithmetic Library
+ *      https://gmplib.org/manual/index.html
+ *
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_BIGNUM_C)
+
+#include <limits.h>
+#include <string.h>
+
+#include "bn_mul.h"
+#include "constant_time_internal.h"
+#include "mbedtls/bignum.h"
+#include "mbedtls/error.h"
+#include "mbedtls/platform_util.h"
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdio.h>
+#include <stdlib.h>
+#define mbedtls_printf printf
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif
+
+#define MPI_VALIDATE_RET(cond) MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_MPI_BAD_INPUT_DATA)
+#define MPI_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+#define ciL (sizeof(mbedtls_mpi_uint)) /* chars in limb  */
+#define biL (ciL << 3)                 /* bits  in limb  */
+#define biH (ciL << 2)                 /* half limb size */
+
+#define MPI_SIZE_T_MAX ((size_t) - 1) /* SIZE_T_MAX is not standard */
+
+/*
+ * Convert between bits/chars and number of limbs
+ * Divide first in order to avoid potential overflows
+ */
+#define BITS_TO_LIMBS(i) ((i) / biL + ((i) % biL != 0))
+#define CHARS_TO_LIMBS(i) ((i) / ciL + ((i) % ciL != 0))
+
+/* Implementation that should never be optimized out by the compiler */
+static void mbedtls_mpi_zeroize(mbedtls_mpi_uint* v, size_t n) {
+    mbedtls_platform_zeroize(v, ciL * n);
+}
+
+/*
+ * Initialize one MPI
+ */
+void mbedtls_mpi_init(mbedtls_mpi* X) {
+    MPI_VALIDATE(X != NULL);
+
+    X->s = 1;
+    X->n = 0;
+    X->p = NULL;
+}
+
+/*
+ * Unallocate one MPI
+ */
+void mbedtls_mpi_free(mbedtls_mpi* X) {
+    if (X == NULL)
+        return;
+
+    if (X->p != NULL) {
+        mbedtls_mpi_zeroize(X->p, X->n);
+        mbedtls_free(X->p);
+    }
+
+    X->s = 1;
+    X->n = 0;
+    X->p = NULL;
+}
+
+/*
+ * Enlarge to the specified number of limbs
+ */
+int mbedtls_mpi_grow(mbedtls_mpi* X, size_t nblimbs) {
+    mbedtls_mpi_uint* p;
+    MPI_VALIDATE_RET(X != NULL);
+
+    if (nblimbs > MBEDTLS_MPI_MAX_LIMBS)
+        return (MBEDTLS_ERR_MPI_ALLOC_FAILED);
+
+    if (X->n < nblimbs) {
+        if ((p = (mbedtls_mpi_uint*)mbedtls_calloc(nblimbs, ciL)) == NULL)
+            return (MBEDTLS_ERR_MPI_ALLOC_FAILED);
+
+        if (X->p != NULL) {
+            memcpy(p, X->p, X->n * ciL);
+            mbedtls_mpi_zeroize(X->p, X->n);
+            mbedtls_free(X->p);
+        }
+
+        X->n = nblimbs;
+        X->p = p;
+    }
+
+    return (0);
+}
+
+/*
+ * Resize down as much as possible,
+ * while keeping at least the specified number of limbs
+ */
+int mbedtls_mpi_shrink(mbedtls_mpi* X, size_t nblimbs) {
+    mbedtls_mpi_uint* p;
+    size_t i;
+    MPI_VALIDATE_RET(X != NULL);
+
+    if (nblimbs > MBEDTLS_MPI_MAX_LIMBS)
+        return (MBEDTLS_ERR_MPI_ALLOC_FAILED);
+
+    /* Actually resize up if there are currently fewer than nblimbs limbs. */
+    if (X->n <= nblimbs)
+        return (mbedtls_mpi_grow(X, nblimbs));
+    /* After this point, then X->n > nblimbs and in particular X->n > 0. */
+
+    for (i = X->n - 1; i > 0; i--)
+        if (X->p[i] != 0)
+            break;
+    i++;
+
+    if (i < nblimbs)
+        i = nblimbs;
+
+    if ((p = (mbedtls_mpi_uint*)mbedtls_calloc(i, ciL)) == NULL)
+        return (MBEDTLS_ERR_MPI_ALLOC_FAILED);
+
+    if (X->p != NULL) {
+        memcpy(p, X->p, i * ciL);
+        mbedtls_mpi_zeroize(X->p, X->n);
+        mbedtls_free(X->p);
+    }
+
+    X->n = i;
+    X->p = p;
+
+    return (0);
+}
+
+/* Resize X to have exactly n limbs and set it to 0. */
+static int mbedtls_mpi_resize_clear(mbedtls_mpi* X, size_t limbs) {
+    if (limbs == 0) {
+        mbedtls_mpi_free(X);
+        return (0);
+    } else if (X->n == limbs) {
+        memset(X->p, 0, limbs * ciL);
+        X->s = 1;
+        return (0);
+    } else {
+        mbedtls_mpi_free(X);
+        return (mbedtls_mpi_grow(X, limbs));
+    }
+}
+
+/*
+ * Copy the contents of Y into X.
+ *
+ * This function is not constant-time. Leading zeros in Y may be removed.
+ *
+ * Ensure that X does not shrink. This is not guaranteed by the public API,
+ * but some code in the bignum module relies on this property, for example
+ * in mbedtls_mpi_exp_mod().
+ */
+int mbedtls_mpi_copy(mbedtls_mpi* X, const mbedtls_mpi* Y) {
+    int ret = 0;
+    size_t i;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(Y != NULL);
+
+    if (X == Y)
+        return (0);
+
+    if (Y->n == 0) {
+        if (X->n != 0) {
+            X->s = 1;
+            memset(X->p, 0, X->n * ciL);
+        }
+        return (0);
+    }
+
+    for (i = Y->n - 1; i > 0; i--)
+        if (Y->p[i] != 0)
+            break;
+    i++;
+
+    X->s = Y->s;
+
+    if (X->n < i) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, i));
+    } else {
+        memset(X->p + i, 0, (X->n - i) * ciL);
+    }
+
+    memcpy(X->p, Y->p, i * ciL);
+
+cleanup:
+
+    return (ret);
+}
+
+/*
+ * Swap the contents of X and Y
+ */
+void mbedtls_mpi_swap(mbedtls_mpi* X, mbedtls_mpi* Y) {
+    mbedtls_mpi T;
+    MPI_VALIDATE(X != NULL);
+    MPI_VALIDATE(Y != NULL);
+
+    memcpy(&T, X, sizeof(mbedtls_mpi));
+    memcpy(X, Y, sizeof(mbedtls_mpi));
+    memcpy(Y, &T, sizeof(mbedtls_mpi));
+}
+
+/*
+ * Set value from integer
+ */
+int mbedtls_mpi_lset(mbedtls_mpi* X, mbedtls_mpi_sint z) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    MPI_VALIDATE_RET(X != NULL);
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, 1));
+    memset(X->p, 0, X->n * ciL);
+
+    X->p[0] = (z < 0) ? -z : z;
+    X->s = (z < 0) ? -1 : 1;
+
+cleanup:
+
+    return (ret);
+}
+
+/*
+ * Get a specific bit
+ */
+int mbedtls_mpi_get_bit(const mbedtls_mpi* X, size_t pos) {
+    MPI_VALIDATE_RET(X != NULL);
+
+    if (X->n * biL <= pos)
+        return (0);
+
+    return ((X->p[pos / biL] >> (pos % biL)) & 0x01);
+}
+
+/* Get a specific byte, without range checks. */
+#define GET_BYTE(X, i) (((X)->p[(i) / ciL] >> (((i) % ciL) * 8)) & 0xff)
+
+/*
+ * Set a bit to a specific value of 0 or 1
+ */
+int mbedtls_mpi_set_bit(mbedtls_mpi* X, size_t pos, unsigned char val) {
+    int ret = 0;
+    size_t off = pos / biL;
+    size_t idx = pos % biL;
+    MPI_VALIDATE_RET(X != NULL);
+
+    if (val != 0 && val != 1)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    if (X->n * biL <= pos) {
+        if (val == 0)
+            return (0);
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, off + 1));
+    }
+
+    X->p[off] &= ~((mbedtls_mpi_uint)0x01 << idx);
+    X->p[off] |= (mbedtls_mpi_uint)val << idx;
+
+cleanup:
+
+    return (ret);
+}
+
+/*
+ * Return the number of less significant zero-bits
+ */
+size_t mbedtls_mpi_lsb(const mbedtls_mpi* X) {
+    size_t i, j, count = 0;
+    MBEDTLS_INTERNAL_VALIDATE_RET(X != NULL, 0);
+
+    for (i = 0; i < X->n; i++)
+        for (j = 0; j < biL; j++, count++)
+            if (((X->p[i] >> j) & 1) != 0)
+                return (count);
+
+    return (0);
+}
+
+/*
+ * Count leading zero bits in a given integer
+ */
+static size_t mbedtls_clz(const mbedtls_mpi_uint x) {
+    size_t j;
+    mbedtls_mpi_uint mask = (mbedtls_mpi_uint)1 << (biL - 1);
+
+    for (j = 0; j < biL; j++) {
+        if (x & mask)
+            break;
+
+        mask >>= 1;
+    }
+
+    return j;
+}
+
+/*
+ * Return the number of bits
+ */
+size_t mbedtls_mpi_bitlen(const mbedtls_mpi* X) {
+    size_t i, j;
+
+    if (X->n == 0)
+        return (0);
+
+    for (i = X->n - 1; i > 0; i--)
+        if (X->p[i] != 0)
+            break;
+
+    j = biL - mbedtls_clz(X->p[i]);
+
+    return ((i * biL) + j);
+}
+
+/*
+ * Return the total size in bytes
+ */
+size_t mbedtls_mpi_size(const mbedtls_mpi* X) {
+    return ((mbedtls_mpi_bitlen(X) + 7) >> 3);
+}
+
+/*
+ * Convert an ASCII character to digit value
+ */
+static int mpi_get_digit(mbedtls_mpi_uint* d, int radix, char c) {
+    *d = 255;
+
+    if (c >= 0x30 && c <= 0x39)
+        *d = c - 0x30;
+    if (c >= 0x41 && c <= 0x46)
+        *d = c - 0x37;
+    if (c >= 0x61 && c <= 0x66)
+        *d = c - 0x57;
+
+    if (*d >= (mbedtls_mpi_uint)radix)
+        return (MBEDTLS_ERR_MPI_INVALID_CHARACTER);
+
+    return (0);
+}
+
+/*
+ * Import from an ASCII string
+ */
+int mbedtls_mpi_read_string(mbedtls_mpi* X, int radix, const char* s) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t i, j, slen, n;
+    int sign = 1;
+    mbedtls_mpi_uint d;
+    mbedtls_mpi T;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(s != NULL);
+
+    if (radix < 2 || radix > 16)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    mbedtls_mpi_init(&T);
+
+    if (s[0] == 0) {
+        mbedtls_mpi_free(X);
+        return (0);
+    }
+
+    if (s[0] == '-') {
+        ++s;
+        sign = -1;
+    }
+
+    slen = strlen(s);
+
+    if (radix == 16) {
+        if (slen > MPI_SIZE_T_MAX >> 2)
+            return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+        n = BITS_TO_LIMBS(slen << 2);
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, n));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_lset(X, 0));
+
+        for (i = slen, j = 0; i > 0; i--, j++) {
+            MBEDTLS_MPI_CHK(mpi_get_digit(&d, radix, s[i - 1]));
+            X->p[j / (2 * ciL)] |= d << ((j % (2 * ciL)) << 2);
+        }
+    } else {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_lset(X, 0));
+
+        for (i = 0; i < slen; i++) {
+            MBEDTLS_MPI_CHK(mpi_get_digit(&d, radix, s[i]));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_mul_int(&T, X, radix));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_add_int(X, &T, d));
+        }
+    }
+
+    if (sign < 0 && mbedtls_mpi_bitlen(X) != 0)
+        X->s = -1;
+
+cleanup:
+
+    mbedtls_mpi_free(&T);
+
+    return (ret);
+}
+
+/*
+ * Helper to write the digits high-order first.
+ */
+static int mpi_write_hlp(mbedtls_mpi* X, int radix, char** p, const size_t buflen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_mpi_uint r;
+    size_t length = 0;
+    char* p_end = *p + buflen;
+
+    do {
+        if (length >= buflen) {
+            return (MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL);
+        }
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_int(&r, X, radix));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_div_int(X, NULL, X, radix));
+        /*
+         * Write the residue in the current position, as an ASCII character.
+         */
+        if (r < 0xA)
+            *(--p_end) = (char)('0' + r);
+        else
+            *(--p_end) = (char)('A' + (r - 0xA));
+
+        length++;
+    } while (mbedtls_mpi_cmp_int(X, 0) != 0);
+
+    memmove(*p, p_end, length);
+    *p += length;
+
+cleanup:
+
+    return (ret);
+}
+
+/*
+ * Export into an ASCII string
+ */
+int mbedtls_mpi_write_string(const mbedtls_mpi* X, int radix, char* buf, size_t buflen,
+    size_t* olen) {
+    int ret = 0;
+    size_t n;
+    char* p;
+    mbedtls_mpi T;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(olen != NULL);
+    MPI_VALIDATE_RET(buflen == 0 || buf != NULL);
+
+    if (radix < 2 || radix > 16)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    n = mbedtls_mpi_bitlen(X); /* Number of bits necessary to present `n`. */
+    if (radix >= 4)
+        n >>= 1; /* Number of 4-adic digits necessary to present
+                  * `n`. If radix > 4, this might be a strict
+                  * overapproximation of the number of
+                  * radix-adic digits needed to present `n`. */
+    if (radix >= 16)
+        n >>= 1; /* Number of hexadecimal digits necessary to
+                  * present `n`. */
+
+    n += 1;       /* Terminating null byte */
+    n += 1;       /* Compensate for the divisions above, which round down `n`
+                   * in case it's not even. */
+    n += 1;       /* Potential '-'-sign. */
+    n += (n & 1); /* Make n even to have enough space for hexadecimal writing,
+                   * which always uses an even number of hex-digits. */
+
+    if (buflen < n) {
+        *olen = n;
+        return (MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL);
+    }
+
+    p = buf;
+    mbedtls_mpi_init(&T);
+
+    if (X->s == -1) {
+        *p++ = '-';
+        buflen--;
+    }
+
+    if (radix == 16) {
+        int c;
+        size_t i, j, k;
+
+        for (i = X->n, k = 0; i > 0; i--) {
+            for (j = ciL; j > 0; j--) {
+                c = (X->p[i - 1] >> ((j - 1) << 3)) & 0xFF;
+
+                if (c == 0 && k == 0 && (i + j) != 2)
+                    continue;
+
+                *(p++) = "0123456789ABCDEF"[c / 16];
+                *(p++) = "0123456789ABCDEF"[c % 16];
+                k = 1;
+            }
+        }
+    } else {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&T, X));
+
+        if (T.s == -1)
+            T.s = 1;
+
+        MBEDTLS_MPI_CHK(mpi_write_hlp(&T, radix, &p, buflen));
+    }
+
+    *p++ = '\0';
+    *olen = p - buf;
+
+cleanup:
+
+    mbedtls_mpi_free(&T);
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_FS_IO)
+/*
+ * Read X from an opened file
+ */
+int mbedtls_mpi_read_file(mbedtls_mpi* X, int radix, FILE* fin) {
+    mbedtls_mpi_uint d;
+    size_t slen;
+    char* p;
+    /*
+     * Buffer should have space for (short) label and decimal formatted MPI,
+     * newline characters and '\0'
+     */
+    char s[MBEDTLS_MPI_RW_BUFFER_SIZE];
+
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(fin != NULL);
+
+    if (radix < 2 || radix > 16)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    memset(s, 0, sizeof(s));
+    if (fgets(s, sizeof(s) - 1, fin) == NULL)
+        return (MBEDTLS_ERR_MPI_FILE_IO_ERROR);
+
+    slen = strlen(s);
+    if (slen == sizeof(s) - 2)
+        return (MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL);
+
+    if (slen > 0 && s[slen - 1] == '\n') {
+        slen--;
+        s[slen] = '\0';
+    }
+    if (slen > 0 && s[slen - 1] == '\r') {
+        slen--;
+        s[slen] = '\0';
+    }
+
+    p = s + slen;
+    while (p-- > s)
+        if (mpi_get_digit(&d, radix, *p) != 0)
+            break;
+
+    return (mbedtls_mpi_read_string(X, radix, p + 1));
+}
+
+/*
+ * Write X into an opened file (or stdout if fout == NULL)
+ */
+int mbedtls_mpi_write_file(const char* p, const mbedtls_mpi* X, int radix, FILE* fout) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t n, slen, plen;
+    /*
+     * Buffer should have space for (short) label and decimal formatted MPI,
+     * newline characters and '\0'
+     */
+    char s[MBEDTLS_MPI_RW_BUFFER_SIZE];
+    MPI_VALIDATE_RET(X != NULL);
+
+    if (radix < 2 || radix > 16)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    memset(s, 0, sizeof(s));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_write_string(X, radix, s, sizeof(s) - 2, &n));
+
+    if (p == NULL)
+        p = "";
+
+    plen = strlen(p);
+    slen = strlen(s);
+    s[slen++] = '\r';
+    s[slen++] = '\n';
+
+    if (fout != NULL) {
+        if (fwrite(p, 1, plen, fout) != plen || fwrite(s, 1, slen, fout) != slen)
+            return (MBEDTLS_ERR_MPI_FILE_IO_ERROR);
+    } else
+        mbedtls_printf("%s%s", p, s);
+
+cleanup:
+
+    return (ret);
+}
+#endif /* MBEDTLS_FS_IO */
+
+/* Convert a big-endian byte array aligned to the size of mbedtls_mpi_uint
+ * into the storage form used by mbedtls_mpi. */
+
+static mbedtls_mpi_uint mpi_uint_bigendian_to_host_c(mbedtls_mpi_uint x) {
+    uint8_t i;
+    unsigned char* x_ptr;
+    mbedtls_mpi_uint tmp = 0;
+
+    for (i = 0, x_ptr = (unsigned char*)&x; i < ciL; i++, x_ptr++) {
+        tmp <<= CHAR_BIT;
+        tmp |= (mbedtls_mpi_uint)*x_ptr;
+    }
+
+    return (tmp);
+}
+
+static mbedtls_mpi_uint mpi_uint_bigendian_to_host(mbedtls_mpi_uint x) {
+#if defined(__BYTE_ORDER__)
+
+/* Nothing to do on bigendian systems. */
+#if (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)
+    return (x);
+#endif /* __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__ */
+
+#if (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)
+
+/* For GCC and Clang, have builtins for byte swapping. */
+#if defined(__GNUC__) && defined(__GNUC_PREREQ)
+#if __GNUC_PREREQ(4, 3)
+#define have_bswap
+#endif
+#endif
+
+#if defined(__clang__) && defined(__has_builtin)
+#if __has_builtin(__builtin_bswap32) && __has_builtin(__builtin_bswap64)
+#define have_bswap
+#endif
+#endif
+
+#if defined(have_bswap)
+    /* The compiler is hopefully able to statically evaluate this! */
+    switch (sizeof(mbedtls_mpi_uint)) {
+    case 4:
+        return (__builtin_bswap32(x));
+    case 8:
+        return (__builtin_bswap64(x));
+    }
+#endif
+#endif /* __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ */
+#endif /* __BYTE_ORDER__ */
+
+    /* Fall back to C-based reordering if we don't know the byte order
+     * or we couldn't use a compiler-specific builtin. */
+    return (mpi_uint_bigendian_to_host_c(x));
+}
+
+static void mpi_bigendian_to_host(mbedtls_mpi_uint* const p, size_t limbs) {
+    mbedtls_mpi_uint* cur_limb_left;
+    mbedtls_mpi_uint* cur_limb_right;
+    if (limbs == 0)
+        return;
+
+    /*
+     * Traverse limbs and
+     * - adapt byte-order in each limb
+     * - swap the limbs themselves.
+     * For that, simultaneously traverse the limbs from left to right
+     * and from right to left, as long as the left index is not bigger
+     * than the right index (it's not a problem if limbs is odd and the
+     * indices coincide in the last iteration).
+     */
+    for (cur_limb_left = p, cur_limb_right = p + (limbs - 1); cur_limb_left <= cur_limb_right;
+         cur_limb_left++, cur_limb_right--) {
+        mbedtls_mpi_uint tmp;
+        /* Note that if cur_limb_left == cur_limb_right,
+         * this code effectively swaps the bytes only once. */
+        tmp = mpi_uint_bigendian_to_host(*cur_limb_left);
+        *cur_limb_left = mpi_uint_bigendian_to_host(*cur_limb_right);
+        *cur_limb_right = tmp;
+    }
+}
+
+/*
+ * Import X from unsigned binary data, little endian
+ */
+int mbedtls_mpi_read_binary_le(mbedtls_mpi* X, const unsigned char* buf, size_t buflen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t i;
+    size_t const limbs = CHARS_TO_LIMBS(buflen);
+
+    /* Ensure that target MPI has exactly the necessary number of limbs */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_resize_clear(X, limbs));
+
+    for (i = 0; i < buflen; i++)
+        X->p[i / ciL] |= ((mbedtls_mpi_uint)buf[i]) << ((i % ciL) << 3);
+
+cleanup:
+
+    /*
+     * This function is also used to import keys. However, wiping the buffers
+     * upon failure is not necessary because failure only can happen before any
+     * input is copied.
+     */
+    return (ret);
+}
+
+/*
+ * Import X from unsigned binary data, big endian
+ */
+int mbedtls_mpi_read_binary(mbedtls_mpi* X, const unsigned char* buf, size_t buflen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t const limbs = CHARS_TO_LIMBS(buflen);
+    size_t const overhead = (limbs * ciL) - buflen;
+    unsigned char* Xp;
+
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(buflen == 0 || buf != NULL);
+
+    /* Ensure that target MPI has exactly the necessary number of limbs */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_resize_clear(X, limbs));
+
+    /* Avoid calling `memcpy` with NULL source or destination argument,
+     * even if buflen is 0. */
+    if (buflen != 0) {
+        Xp = (unsigned char*)X->p;
+        memcpy(Xp + overhead, buf, buflen);
+
+        mpi_bigendian_to_host(X->p, limbs);
+    }
+
+cleanup:
+
+    /*
+     * This function is also used to import keys. However, wiping the buffers
+     * upon failure is not necessary because failure only can happen before any
+     * input is copied.
+     */
+    return (ret);
+}
+
+/*
+ * Export X into unsigned binary data, little endian
+ */
+int mbedtls_mpi_write_binary_le(const mbedtls_mpi* X, unsigned char* buf, size_t buflen) {
+    size_t stored_bytes = X->n * ciL;
+    size_t bytes_to_copy;
+    size_t i;
+
+    if (stored_bytes < buflen) {
+        bytes_to_copy = stored_bytes;
+    } else {
+        bytes_to_copy = buflen;
+
+        /* The output buffer is smaller than the allocated size of X.
+         * However X may fit if its leading bytes are zero. */
+        for (i = bytes_to_copy; i < stored_bytes; i++) {
+            if (GET_BYTE(X, i) != 0)
+                return (MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL);
+        }
+    }
+
+    for (i = 0; i < bytes_to_copy; i++)
+        buf[i] = GET_BYTE(X, i);
+
+    if (stored_bytes < buflen) {
+        /* Write trailing 0 bytes */
+        memset(buf + stored_bytes, 0, buflen - stored_bytes);
+    }
+
+    return (0);
+}
+
+/*
+ * Export X into unsigned binary data, big endian
+ */
+int mbedtls_mpi_write_binary(const mbedtls_mpi* X, unsigned char* buf, size_t buflen) {
+    size_t stored_bytes;
+    size_t bytes_to_copy;
+    unsigned char* p;
+    size_t i;
+
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(buflen == 0 || buf != NULL);
+
+    stored_bytes = X->n * ciL;
+
+    if (stored_bytes < buflen) {
+        /* There is enough space in the output buffer. Write initial
+         * null bytes and record the position at which to start
+         * writing the significant bytes. In this case, the execution
+         * trace of this function does not depend on the value of the
+         * number. */
+        bytes_to_copy = stored_bytes;
+        p = buf + buflen - stored_bytes;
+        memset(buf, 0, buflen - stored_bytes);
+    } else {
+        /* The output buffer is smaller than the allocated size of X.
+         * However X may fit if its leading bytes are zero. */
+        bytes_to_copy = buflen;
+        p = buf;
+        for (i = bytes_to_copy; i < stored_bytes; i++) {
+            if (GET_BYTE(X, i) != 0)
+                return (MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL);
+        }
+    }
+
+    for (i = 0; i < bytes_to_copy; i++)
+        p[bytes_to_copy - i - 1] = GET_BYTE(X, i);
+
+    return (0);
+}
+
+/*
+ * Left-shift: X <<= count
+ */
+int mbedtls_mpi_shift_l(mbedtls_mpi* X, size_t count) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t i, v0, t1;
+    mbedtls_mpi_uint r0 = 0, r1;
+    MPI_VALIDATE_RET(X != NULL);
+
+    v0 = count / (biL);
+    t1 = count & (biL - 1);
+
+    i = mbedtls_mpi_bitlen(X) + count;
+
+    if (X->n * biL < i)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, BITS_TO_LIMBS(i)));
+
+    ret = 0;
+
+    /*
+     * shift by count / limb_size
+     */
+    if (v0 > 0) {
+        for (i = X->n; i > v0; i--)
+            X->p[i - 1] = X->p[i - v0 - 1];
+
+        for (; i > 0; i--)
+            X->p[i - 1] = 0;
+    }
+
+    /*
+     * shift by count % limb_size
+     */
+    if (t1 > 0) {
+        for (i = v0; i < X->n; i++) {
+            r1 = X->p[i] >> (biL - t1);
+            X->p[i] <<= t1;
+            X->p[i] |= r0;
+            r0 = r1;
+        }
+    }
+
+cleanup:
+
+    return (ret);
+}
+
+/*
+ * Right-shift: X >>= count
+ */
+int mbedtls_mpi_shift_r(mbedtls_mpi* X, size_t count) {
+    size_t i, v0, v1;
+    mbedtls_mpi_uint r0 = 0, r1;
+    MPI_VALIDATE_RET(X != NULL);
+
+    v0 = count / biL;
+    v1 = count & (biL - 1);
+
+    if (v0 > X->n || (v0 == X->n && v1 > 0))
+        return mbedtls_mpi_lset(X, 0);
+
+    /*
+     * shift by count / limb_size
+     */
+    if (v0 > 0) {
+        for (i = 0; i < X->n - v0; i++)
+            X->p[i] = X->p[i + v0];
+
+        for (; i < X->n; i++)
+            X->p[i] = 0;
+    }
+
+    /*
+     * shift by count % limb_size
+     */
+    if (v1 > 0) {
+        for (i = X->n; i > 0; i--) {
+            r1 = X->p[i - 1] << (biL - v1);
+            X->p[i - 1] >>= v1;
+            X->p[i - 1] |= r0;
+            r0 = r1;
+        }
+    }
+
+    return (0);
+}
+
+/*
+ * Compare unsigned values
+ */
+int mbedtls_mpi_cmp_abs(const mbedtls_mpi* X, const mbedtls_mpi* Y) {
+    size_t i, j;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(Y != NULL);
+
+    for (i = X->n; i > 0; i--)
+        if (X->p[i - 1] != 0)
+            break;
+
+    for (j = Y->n; j > 0; j--)
+        if (Y->p[j - 1] != 0)
+            break;
+
+    if (i == 0 && j == 0)
+        return (0);
+
+    if (i > j)
+        return (1);
+    if (j > i)
+        return (-1);
+
+    for (; i > 0; i--) {
+        if (X->p[i - 1] > Y->p[i - 1])
+            return (1);
+        if (X->p[i - 1] < Y->p[i - 1])
+            return (-1);
+    }
+
+    return (0);
+}
+
+/*
+ * Compare signed values
+ */
+int mbedtls_mpi_cmp_mpi(const mbedtls_mpi* X, const mbedtls_mpi* Y) {
+    size_t i, j;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(Y != NULL);
+
+    for (i = X->n; i > 0; i--)
+        if (X->p[i - 1] != 0)
+            break;
+
+    for (j = Y->n; j > 0; j--)
+        if (Y->p[j - 1] != 0)
+            break;
+
+    if (i == 0 && j == 0)
+        return (0);
+
+    if (i > j)
+        return (X->s);
+    if (j > i)
+        return (-Y->s);
+
+    if (X->s > 0 && Y->s < 0)
+        return (1);
+    if (Y->s > 0 && X->s < 0)
+        return (-1);
+
+    for (; i > 0; i--) {
+        if (X->p[i - 1] > Y->p[i - 1])
+            return (X->s);
+        if (X->p[i - 1] < Y->p[i - 1])
+            return (-X->s);
+    }
+
+    return (0);
+}
+
+/*
+ * Compare signed values
+ */
+int mbedtls_mpi_cmp_int(const mbedtls_mpi* X, mbedtls_mpi_sint z) {
+    mbedtls_mpi Y;
+    mbedtls_mpi_uint p[1];
+    MPI_VALIDATE_RET(X != NULL);
+
+    *p = (z < 0) ? -z : z;
+    Y.s = (z < 0) ? -1 : 1;
+    Y.n = 1;
+    Y.p = p;
+
+    return (mbedtls_mpi_cmp_mpi(X, &Y));
+}
+
+/*
+ * Unsigned addition: X = |A| + |B|  (HAC 14.7)
+ */
+int mbedtls_mpi_add_abs(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t i, j;
+    mbedtls_mpi_uint *o, *p, c, tmp;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(B != NULL);
+
+    if (X == B) {
+        const mbedtls_mpi* T = A;
+        A = X;
+        B = T;
+    }
+
+    if (X != A)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_copy(X, A));
+
+    /*
+     * X should always be positive as a result of unsigned additions.
+     */
+    X->s = 1;
+
+    for (j = B->n; j > 0; j--)
+        if (B->p[j - 1] != 0)
+            break;
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, j));
+
+    o = B->p;
+    p = X->p;
+    c = 0;
+
+    /*
+     * tmp is used because it might happen that p == o
+     */
+    for (i = 0; i < j; i++, o++, p++) {
+        tmp = *o;
+        *p += c;
+        c = (*p < c);
+        *p += tmp;
+        c += (*p < tmp);
+    }
+
+    while (c != 0) {
+        if (i >= X->n) {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, i + 1));
+            p = X->p + i;
+        }
+
+        *p += c;
+        c = (*p < c);
+        i++;
+        p++;
+    }
+
+cleanup:
+
+    return (ret);
+}
+
+/**
+ * Helper for mbedtls_mpi subtraction.
+ *
+ * Calculate l - r where l and r have the same size.
+ * This function operates modulo (2^ciL)^n and returns the carry
+ * (1 if there was a wraparound, i.e. if `l < r`, and 0 otherwise).
+ *
+ * d may be aliased to l or r.
+ *
+ * \param n             Number of limbs of \p d, \p l and \p r.
+ * \param[out] d        The result of the subtraction.
+ * \param[in] l         The left operand.
+ * \param[in] r         The right operand.
+ *
+ * \return              1 if `l < r`.
+ *                      0 if `l >= r`.
+ */
+static mbedtls_mpi_uint mpi_sub_hlp(size_t n, mbedtls_mpi_uint* d, const mbedtls_mpi_uint* l,
+    const mbedtls_mpi_uint* r) {
+    size_t i;
+    mbedtls_mpi_uint c = 0, t, z;
+
+    for (i = 0; i < n; i++) {
+        z = (l[i] < c);
+        t = l[i] - c;
+        c = (t < r[i]) + z;
+        d[i] = t - r[i];
+    }
+
+    return (c);
+}
+
+/*
+ * Unsigned subtraction: X = |A| - |B|  (HAC 14.9, 14.10)
+ */
+int mbedtls_mpi_sub_abs(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t n;
+    mbedtls_mpi_uint carry;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(B != NULL);
+
+    for (n = B->n; n > 0; n--)
+        if (B->p[n - 1] != 0)
+            break;
+    if (n > A->n) {
+        /* B >= (2^ciL)^n > A */
+        ret = MBEDTLS_ERR_MPI_NEGATIVE_VALUE;
+        goto cleanup;
+    }
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, A->n));
+
+    /* Set the high limbs of X to match A. Don't touch the lower limbs
+     * because X might be aliased to B, and we must not overwrite the
+     * significant digits of B. */
+    if (A->n > n)
+        memcpy(X->p + n, A->p + n, (A->n - n) * ciL);
+    if (X->n > A->n)
+        memset(X->p + A->n, 0, (X->n - A->n) * ciL);
+
+    carry = mpi_sub_hlp(n, X->p, A->p, B->p);
+    if (carry != 0) {
+        /* Propagate the carry to the first nonzero limb of X. */
+        for (; n < X->n && X->p[n] == 0; n++)
+            --X->p[n];
+        /* If we ran out of space for the carry, it means that the result
+         * is negative. */
+        if (n == X->n) {
+            ret = MBEDTLS_ERR_MPI_NEGATIVE_VALUE;
+            goto cleanup;
+        }
+        --X->p[n];
+    }
+
+    /* X should always be positive as a result of unsigned subtractions. */
+    X->s = 1;
+
+cleanup:
+    return (ret);
+}
+
+/*
+ * Signed addition: X = A + B
+ */
+int mbedtls_mpi_add_mpi(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B) {
+    int ret, s;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(B != NULL);
+
+    s = A->s;
+    if (A->s * B->s < 0) {
+        if (mbedtls_mpi_cmp_abs(A, B) >= 0) {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_abs(X, A, B));
+            X->s = s;
+        } else {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_abs(X, B, A));
+            X->s = -s;
+        }
+    } else {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_add_abs(X, A, B));
+        X->s = s;
+    }
+
+cleanup:
+
+    return (ret);
+}
+
+/*
+ * Signed subtraction: X = A - B
+ */
+int mbedtls_mpi_sub_mpi(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B) {
+    int ret, s;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(B != NULL);
+
+    s = A->s;
+    if (A->s * B->s > 0) {
+        if (mbedtls_mpi_cmp_abs(A, B) >= 0) {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_abs(X, A, B));
+            X->s = s;
+        } else {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_abs(X, B, A));
+            X->s = -s;
+        }
+    } else {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_add_abs(X, A, B));
+        X->s = s;
+    }
+
+cleanup:
+
+    return (ret);
+}
+
+/*
+ * Signed addition: X = A + b
+ */
+int mbedtls_mpi_add_int(mbedtls_mpi* X, const mbedtls_mpi* A, mbedtls_mpi_sint b) {
+    mbedtls_mpi B;
+    mbedtls_mpi_uint p[1];
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+
+    p[0] = (b < 0) ? -b : b;
+    B.s = (b < 0) ? -1 : 1;
+    B.n = 1;
+    B.p = p;
+
+    return (mbedtls_mpi_add_mpi(X, A, &B));
+}
+
+/*
+ * Signed subtraction: X = A - b
+ */
+int mbedtls_mpi_sub_int(mbedtls_mpi* X, const mbedtls_mpi* A, mbedtls_mpi_sint b) {
+    mbedtls_mpi B;
+    mbedtls_mpi_uint p[1];
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+
+    p[0] = (b < 0) ? -b : b;
+    B.s = (b < 0) ? -1 : 1;
+    B.n = 1;
+    B.p = p;
+
+    return (mbedtls_mpi_sub_mpi(X, A, &B));
+}
+
+/** Helper for mbedtls_mpi multiplication.
+ *
+ * Add \p b * \p s to \p d.
+ *
+ * \param i             The number of limbs of \p s.
+ * \param[in] s         A bignum to multiply, of size \p i.
+ *                      It may overlap with \p d, but only if
+ *                      \p d <= \p s.
+ *                      Its leading limb must not be \c 0.
+ * \param[in,out] d     The bignum to add to.
+ *                      It must be sufficiently large to store the
+ *                      result of the multiplication. This means
+ *                      \p i + 1 limbs if \p d[\p i - 1] started as 0 and \p b
+ *                      is not known a priori.
+ * \param b             A scalar to multiply.
+ */
+static
+#if defined(__APPLE__) && defined(__arm__)
+    /*
+     * Apple LLVM version 4.2 (clang-425.0.24) (based on LLVM 3.2svn)
+     * appears to need this to prevent bad ARM code generation at -O3.
+     */
+    __attribute__((noinline))
+#endif
+    void
+    mpi_mul_hlp(size_t i, const mbedtls_mpi_uint* s, mbedtls_mpi_uint* d, mbedtls_mpi_uint b) {
+    mbedtls_mpi_uint c = 0;
+
+#if defined(MULADDC_HUIT)
+    for (; i >= 8; i -= 8) {
+        MULADDC_INIT
+        MULADDC_HUIT
+        MULADDC_STOP
+    }
+
+    for (; i > 0; i--) {
+        MULADDC_INIT
+        MULADDC_CORE
+        MULADDC_STOP
+    }
+#else  /* MULADDC_HUIT */
+    for (; i >= 16; i -= 16) {
+        MULADDC_INIT
+        MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_CORE
+            MULADDC_CORE
+
+                MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_CORE
+                    MULADDC_CORE MULADDC_CORE MULADDC_STOP
+    }
+
+    for (; i >= 8; i -= 8) {
+        MULADDC_INIT
+        MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_CORE
+
+            MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_CORE MULADDC_STOP
+    }
+
+    for (; i > 0; i--) {
+        MULADDC_INIT
+        MULADDC_CORE
+        MULADDC_STOP
+    }
+#endif /* MULADDC_HUIT */
+
+    while (c != 0) {
+        *d += c;
+        c = (*d < c);
+        d++;
+    }
+}
+
+/*
+ * Baseline multiplication: X = A * B  (HAC 14.12)
+ */
+int mbedtls_mpi_mul_mpi(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* B) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t i, j;
+    mbedtls_mpi TA, TB;
+    int result_is_zero = 0;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(B != NULL);
+
+    mbedtls_mpi_init(&TA);
+    mbedtls_mpi_init(&TB);
+
+    if (X == A) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&TA, A));
+        A = &TA;
+    }
+    if (X == B) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&TB, B));
+        B = &TB;
+    }
+
+    for (i = A->n; i > 0; i--)
+        if (A->p[i - 1] != 0)
+            break;
+    if (i == 0)
+        result_is_zero = 1;
+
+    for (j = B->n; j > 0; j--)
+        if (B->p[j - 1] != 0)
+            break;
+    if (j == 0)
+        result_is_zero = 1;
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, i + j));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_lset(X, 0));
+
+    for (; j > 0; j--)
+        mpi_mul_hlp(i, A->p, X->p + j - 1, B->p[j - 1]);
+
+    /* If the result is 0, we don't shortcut the operation, which reduces
+     * but does not eliminate side channels leaking the zero-ness. We do
+     * need to take care to set the sign bit properly since the library does
+     * not fully support an MPI object with a value of 0 and s == -1. */
+    if (result_is_zero)
+        X->s = 1;
+    else
+        X->s = A->s * B->s;
+
+cleanup:
+
+    mbedtls_mpi_free(&TB);
+    mbedtls_mpi_free(&TA);
+
+    return (ret);
+}
+
+/*
+ * Baseline multiplication: X = A * b
+ */
+int mbedtls_mpi_mul_int(mbedtls_mpi* X, const mbedtls_mpi* A, mbedtls_mpi_uint b) {
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+
+    /* mpi_mul_hlp can't deal with a leading 0. */
+    size_t n = A->n;
+    while (n > 0 && A->p[n - 1] == 0)
+        --n;
+
+    /* The general method below doesn't work if n==0 or b==0. By chance
+     * calculating the result is trivial in those cases. */
+    if (b == 0 || n == 0) {
+        return (mbedtls_mpi_lset(X, 0));
+    }
+
+    /* Calculate A*b as A + A*(b-1) to take advantage of mpi_mul_hlp */
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    /* In general, A * b requires 1 limb more than b. If
+     * A->p[n - 1] * b / b == A->p[n - 1], then A * b fits in the same
+     * number of limbs as A and the call to grow() is not required since
+     * copy() will take care of the growth if needed. However, experimentally,
+     * making the call to grow() unconditional causes slightly fewer
+     * calls to calloc() in ECP code, presumably because it reuses the
+     * same mpi for a while and this way the mpi is more likely to directly
+     * grow to its final size. */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, n + 1));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(X, A));
+    mpi_mul_hlp(n, A->p, X->p, b - 1);
+
+cleanup:
+    return (ret);
+}
+
+/*
+ * Unsigned integer divide - double mbedtls_mpi_uint dividend, u1/u0, and
+ * mbedtls_mpi_uint divisor, d
+ */
+static mbedtls_mpi_uint mbedtls_int_div_int(mbedtls_mpi_uint u1, mbedtls_mpi_uint u0,
+    mbedtls_mpi_uint d, mbedtls_mpi_uint* r) {
+#if defined(MBEDTLS_HAVE_UDBL)
+    mbedtls_t_udbl dividend, quotient;
+#else
+    const mbedtls_mpi_uint radix = (mbedtls_mpi_uint)1 << biH;
+    const mbedtls_mpi_uint uint_halfword_mask = ((mbedtls_mpi_uint)1 << biH) - 1;
+    mbedtls_mpi_uint d0, d1, q0, q1, rAX, r0, quotient;
+    mbedtls_mpi_uint u0_msw, u0_lsw;
+    size_t s;
+#endif
+
+    /*
+     * Check for overflow
+     */
+    if (0 == d || u1 >= d) {
+        if (r != NULL)
+            *r = ~0;
+
+        return (~0);
+    }
+
+#if defined(MBEDTLS_HAVE_UDBL)
+    dividend = (mbedtls_t_udbl)u1 << biL;
+    dividend |= (mbedtls_t_udbl)u0;
+    quotient = dividend / d;
+    if (quotient > ((mbedtls_t_udbl)1 << biL) - 1)
+        quotient = ((mbedtls_t_udbl)1 << biL) - 1;
+
+    if (r != NULL)
+        *r = (mbedtls_mpi_uint)(dividend - (quotient * d));
+
+    return (mbedtls_mpi_uint)quotient;
+#else
+
+    /*
+     * Algorithm D, Section 4.3.1 - The Art of Computer Programming
+     *   Vol. 2 - Seminumerical Algorithms, Knuth
+     */
+
+    /*
+     * Normalize the divisor, d, and dividend, u0, u1
+     */
+    s = mbedtls_clz(d);
+    d = d << s;
+
+    u1 = u1 << s;
+    u1 |= (u0 >> (biL - s)) & (-(mbedtls_mpi_sint)s >> (biL - 1));
+    u0 = u0 << s;
+
+    d1 = d >> biH;
+    d0 = d & uint_halfword_mask;
+
+    u0_msw = u0 >> biH;
+    u0_lsw = u0 & uint_halfword_mask;
+
+    /*
+     * Find the first quotient and remainder
+     */
+    q1 = u1 / d1;
+    r0 = u1 - d1 * q1;
+
+    while (q1 >= radix || (q1 * d0 > radix * r0 + u0_msw)) {
+        q1 -= 1;
+        r0 += d1;
+
+        if (r0 >= radix)
+            break;
+    }
+
+    rAX = (u1 * radix) + (u0_msw - q1 * d);
+    q0 = rAX / d1;
+    r0 = rAX - q0 * d1;
+
+    while (q0 >= radix || (q0 * d0 > radix * r0 + u0_lsw)) {
+        q0 -= 1;
+        r0 += d1;
+
+        if (r0 >= radix)
+            break;
+    }
+
+    if (r != NULL)
+        *r = (rAX * radix + u0_lsw - q0 * d) >> s;
+
+    quotient = q1 * radix + q0;
+
+    return quotient;
+#endif
+}
+
+/*
+ * Division by mbedtls_mpi: A = Q * B + R  (HAC 14.20)
+ */
+int mbedtls_mpi_div_mpi(mbedtls_mpi* Q, mbedtls_mpi* R, const mbedtls_mpi* A,
+    const mbedtls_mpi* B) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t i, n, t, k;
+    mbedtls_mpi X, Y, Z, T1, T2;
+    mbedtls_mpi_uint TP2[3];
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(B != NULL);
+
+    if (mbedtls_mpi_cmp_int(B, 0) == 0)
+        return (MBEDTLS_ERR_MPI_DIVISION_BY_ZERO);
+
+    mbedtls_mpi_init(&X);
+    mbedtls_mpi_init(&Y);
+    mbedtls_mpi_init(&Z);
+    mbedtls_mpi_init(&T1);
+    /*
+     * Avoid dynamic memory allocations for constant-size T2.
+     *
+     * T2 is used for comparison only and the 3 limbs are assigned explicitly,
+     * so nobody increase the size of the MPI and we're safe to use an on-stack
+     * buffer.
+     */
+    T2.s = 1;
+    T2.n = sizeof(TP2) / sizeof(*TP2);
+    T2.p = TP2;
+
+    if (mbedtls_mpi_cmp_abs(A, B) < 0) {
+        if (Q != NULL)
+            MBEDTLS_MPI_CHK(mbedtls_mpi_lset(Q, 0));
+        if (R != NULL)
+            MBEDTLS_MPI_CHK(mbedtls_mpi_copy(R, A));
+        return (0);
+    }
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&X, A));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&Y, B));
+    X.s = Y.s = 1;
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&Z, A->n + 2));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&Z, 0));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&T1, A->n + 2));
+
+    k = mbedtls_mpi_bitlen(&Y) % biL;
+    if (k < biL - 1) {
+        k = biL - 1 - k;
+        MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&X, k));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&Y, k));
+    } else
+        k = 0;
+
+    n = X.n - 1;
+    t = Y.n - 1;
+    MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&Y, biL * (n - t)));
+
+    while (mbedtls_mpi_cmp_mpi(&X, &Y) >= 0) {
+        Z.p[n - t]++;
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&X, &X, &Y));
+    }
+    MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&Y, biL * (n - t)));
+
+    for (i = n; i > t; i--) {
+        if (X.p[i] >= Y.p[t])
+            Z.p[i - t - 1] = ~0;
+        else {
+            Z.p[i - t - 1] = mbedtls_int_div_int(X.p[i], X.p[i - 1], Y.p[t], NULL);
+        }
+
+        T2.p[0] = (i < 2) ? 0 : X.p[i - 2];
+        T2.p[1] = (i < 1) ? 0 : X.p[i - 1];
+        T2.p[2] = X.p[i];
+
+        Z.p[i - t - 1]++;
+        do {
+            Z.p[i - t - 1]--;
+
+            MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&T1, 0));
+            T1.p[0] = (t < 1) ? 0 : Y.p[t - 1];
+            T1.p[1] = Y.p[t];
+            MBEDTLS_MPI_CHK(mbedtls_mpi_mul_int(&T1, &T1, Z.p[i - t - 1]));
+        } while (mbedtls_mpi_cmp_mpi(&T1, &T2) > 0);
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mul_int(&T1, &Y, Z.p[i - t - 1]));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&T1, biL * (i - t - 1)));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&X, &X, &T1));
+
+        if (mbedtls_mpi_cmp_int(&X, 0) < 0) {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&T1, &Y));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&T1, biL * (i - t - 1)));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(&X, &X, &T1));
+            Z.p[i - t - 1]--;
+        }
+    }
+
+    if (Q != NULL) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_copy(Q, &Z));
+        Q->s = A->s * B->s;
+    }
+
+    if (R != NULL) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&X, k));
+        X.s = A->s;
+        MBEDTLS_MPI_CHK(mbedtls_mpi_copy(R, &X));
+
+        if (mbedtls_mpi_cmp_int(R, 0) == 0)
+            R->s = 1;
+    }
+
+cleanup:
+
+    mbedtls_mpi_free(&X);
+    mbedtls_mpi_free(&Y);
+    mbedtls_mpi_free(&Z);
+    mbedtls_mpi_free(&T1);
+    mbedtls_platform_zeroize(TP2, sizeof(TP2));
+
+    return (ret);
+}
+
+/*
+ * Division by int: A = Q * b + R
+ */
+int mbedtls_mpi_div_int(mbedtls_mpi* Q, mbedtls_mpi* R, const mbedtls_mpi* A, mbedtls_mpi_sint b) {
+    mbedtls_mpi B;
+    mbedtls_mpi_uint p[1];
+    MPI_VALIDATE_RET(A != NULL);
+
+    p[0] = (b < 0) ? -b : b;
+    B.s = (b < 0) ? -1 : 1;
+    B.n = 1;
+    B.p = p;
+
+    return (mbedtls_mpi_div_mpi(Q, R, A, &B));
+}
+
+/*
+ * Modulo: R = A mod B
+ */
+int mbedtls_mpi_mod_mpi(mbedtls_mpi* R, const mbedtls_mpi* A, const mbedtls_mpi* B) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    MPI_VALIDATE_RET(R != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(B != NULL);
+
+    if (mbedtls_mpi_cmp_int(B, 0) < 0)
+        return (MBEDTLS_ERR_MPI_NEGATIVE_VALUE);
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_div_mpi(NULL, R, A, B));
+
+    while (mbedtls_mpi_cmp_int(R, 0) < 0)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(R, R, B));
+
+    while (mbedtls_mpi_cmp_mpi(R, B) >= 0)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(R, R, B));
+
+cleanup:
+
+    return (ret);
+}
+
+/*
+ * Modulo: r = A mod b
+ */
+int mbedtls_mpi_mod_int(mbedtls_mpi_uint* r, const mbedtls_mpi* A, mbedtls_mpi_sint b) {
+    size_t i;
+    mbedtls_mpi_uint x, y, z;
+    MPI_VALIDATE_RET(r != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+
+    if (b == 0)
+        return (MBEDTLS_ERR_MPI_DIVISION_BY_ZERO);
+
+    if (b < 0)
+        return (MBEDTLS_ERR_MPI_NEGATIVE_VALUE);
+
+    /*
+     * handle trivial cases
+     */
+    if (b == 1) {
+        *r = 0;
+        return (0);
+    }
+
+    if (b == 2) {
+        *r = A->p[0] & 1;
+        return (0);
+    }
+
+    /*
+     * general case
+     */
+    for (i = A->n, y = 0; i > 0; i--) {
+        x = A->p[i - 1];
+        y = (y << biH) | (x >> biH);
+        z = y / b;
+        y -= z * b;
+
+        x <<= biH;
+        y = (y << biH) | (x >> biH);
+        z = y / b;
+        y -= z * b;
+    }
+
+    /*
+     * If A is negative, then the current y represents a negative value.
+     * Flipping it to the positive side.
+     */
+    if (A->s < 0 && y != 0)
+        y = b - y;
+
+    *r = y;
+
+    return (0);
+}
+
+/*
+ * Fast Montgomery initialization (thanks to Tom St Denis)
+ */
+static void mpi_montg_init(mbedtls_mpi_uint* mm, const mbedtls_mpi* N) {
+    mbedtls_mpi_uint x, m0 = N->p[0];
+    unsigned int i;
+
+    x = m0;
+    x += ((m0 + 2) & 4) << 1;
+
+    for (i = biL; i >= 8; i /= 2)
+        x *= (2 - (m0 * x));
+
+    *mm = ~x + 1;
+}
+
+/** Montgomery multiplication: A = A * B * R^-1 mod N  (HAC 14.36)
+ *
+ * \param[in,out]   A   One of the numbers to multiply.
+ *                      It must have at least as many limbs as N
+ *                      (A->n >= N->n), and any limbs beyond n are ignored.
+ *                      On successful completion, A contains the result of
+ *                      the multiplication A * B * R^-1 mod N where
+ *                      R = (2^ciL)^n.
+ * \param[in]       B   One of the numbers to multiply.
+ *                      It must be nonzero and must not have more limbs than N
+ *                      (B->n <= N->n).
+ * \param[in]       N   The modulo. N must be odd.
+ * \param           mm  The value calculated by `mpi_montg_init(&mm, N)`.
+ *                      This is -N^-1 mod 2^ciL.
+ * \param[in,out]   T   A bignum for temporary storage.
+ *                      It must be at least twice the limb size of N plus 2
+ *                      (T->n >= 2 * (N->n + 1)).
+ *                      Its initial content is unused and
+ *                      its final content is indeterminate.
+ *                      Note that unlike the usual convention in the library
+ *                      for `const mbedtls_mpi*`, the content of T can change.
+ */
+static void mpi_montmul(mbedtls_mpi* A, const mbedtls_mpi* B, const mbedtls_mpi* N,
+    mbedtls_mpi_uint mm, const mbedtls_mpi* T) {
+    size_t i, n, m;
+    mbedtls_mpi_uint u0, u1, *d;
+
+    memset(T->p, 0, T->n * ciL);
+
+    d = T->p;
+    n = N->n;
+    m = (B->n < n) ? B->n : n;
+
+    for (i = 0; i < n; i++) {
+        /*
+         * T = (T + u0*B + u1*N) / 2^biL
+         */
+        u0 = A->p[i];
+        u1 = (d[0] + u0 * B->p[0]) * mm;
+
+        mpi_mul_hlp(m, B->p, d, u0);
+        mpi_mul_hlp(n, N->p, d, u1);
+
+        *d++ = u0;
+        d[n + 1] = 0;
+    }
+
+    /* At this point, d is either the desired result or the desired result
+     * plus N. We now potentially subtract N, avoiding leaking whether the
+     * subtraction is performed through side channels. */
+
+    /* Copy the n least significant limbs of d to A, so that
+     * A = d if d < N (recall that N has n limbs). */
+    memcpy(A->p, d, n * ciL);
+    /* If d >= N then we want to set A to d - N. To prevent timing attacks,
+     * do the calculation without using conditional tests. */
+    /* Set d to d0 + (2^biL)^n - N where d0 is the current value of d. */
+    d[n] += 1;
+    d[n] -= mpi_sub_hlp(n, d, d, N->p);
+    /* If d0 < N then d < (2^biL)^n
+     * so d[n] == 0 and we want to keep A as it is.
+     * If d0 >= N then d >= (2^biL)^n, and d <= (2^biL)^n + N < 2 * (2^biL)^n
+     * so d[n] == 1 and we want to set A to the result of the subtraction
+     * which is d - (2^biL)^n, i.e. the n least significant limbs of d.
+     * This exactly corresponds to a conditional assignment. */
+    mbedtls_ct_mpi_uint_cond_assign(n, A->p, d, (unsigned char)d[n]);
+}
+
+/*
+ * Montgomery reduction: A = A * R^-1 mod N
+ *
+ * See mpi_montmul() regarding constraints and guarantees on the parameters.
+ */
+static void mpi_montred(mbedtls_mpi* A, const mbedtls_mpi* N, mbedtls_mpi_uint mm,
+    const mbedtls_mpi* T) {
+    mbedtls_mpi_uint z = 1;
+    mbedtls_mpi U;
+
+    U.n = U.s = (int)z;
+    U.p = &z;
+
+    mpi_montmul(A, &U, N, mm, T);
+}
+
+/**
+ * Select an MPI from a table without leaking the index.
+ *
+ * This is functionally equivalent to mbedtls_mpi_copy(R, T[idx]) except it
+ * reads the entire table in order to avoid leaking the value of idx to an
+ * attacker able to observe memory access patterns.
+ *
+ * \param[out] R        Where to write the selected MPI.
+ * \param[in] T         The table to read from.
+ * \param[in] T_size    The number of elements in the table.
+ * \param[in] idx       The index of the element to select;
+ *                      this must satisfy 0 <= idx < T_size.
+ *
+ * \return \c 0 on success, or a negative error code.
+ */
+static int mpi_select(mbedtls_mpi* R, const mbedtls_mpi* T, size_t T_size, size_t idx) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    for (size_t i = 0; i < T_size; i++) {
+        MBEDTLS_MPI_CHK(
+            mbedtls_mpi_safe_cond_assign(R, &T[i], (unsigned char)mbedtls_ct_size_bool_eq(i, idx)));
+    }
+
+cleanup:
+    return (ret);
+}
+
+/*
+ * Sliding-window exponentiation: X = A^E mod N  (HAC 14.85)
+ */
+int mbedtls_mpi_exp_mod(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* E,
+    const mbedtls_mpi* N, mbedtls_mpi* prec_RR) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t wbits, wsize, one = 1;
+    size_t i, j, nblimbs;
+    size_t bufsize, nbits;
+    mbedtls_mpi_uint ei, mm, state;
+    mbedtls_mpi RR, T, W[1 << MBEDTLS_MPI_WINDOW_SIZE], WW, Apos;
+    int neg;
+
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(E != NULL);
+    MPI_VALIDATE_RET(N != NULL);
+
+    if (mbedtls_mpi_cmp_int(N, 0) <= 0 || (N->p[0] & 1) == 0)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    if (mbedtls_mpi_cmp_int(E, 0) < 0)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    if (mbedtls_mpi_bitlen(E) > MBEDTLS_MPI_MAX_BITS ||
+        mbedtls_mpi_bitlen(N) > MBEDTLS_MPI_MAX_BITS)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    /*
+     * Init temps and window size
+     */
+    mpi_montg_init(&mm, N);
+    mbedtls_mpi_init(&RR);
+    mbedtls_mpi_init(&T);
+    mbedtls_mpi_init(&Apos);
+    mbedtls_mpi_init(&WW);
+    memset(W, 0, sizeof(W));
+
+    i = mbedtls_mpi_bitlen(E);
+
+    wsize = (i > 671) ? 6 : (i > 239) ? 5 : (i > 79) ? 4 : (i > 23) ? 3 : 1;
+
+#if (MBEDTLS_MPI_WINDOW_SIZE < 6)
+    if (wsize > MBEDTLS_MPI_WINDOW_SIZE)
+        wsize = MBEDTLS_MPI_WINDOW_SIZE;
+#endif
+
+    j = N->n + 1;
+    /* All W[i] and X must have at least N->n limbs for the mpi_montmul()
+     * and mpi_montred() calls later. Here we ensure that W[1] and X are
+     * large enough, and later we'll grow other W[i] to the same length.
+     * They must not be shrunk midway through this function!
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, j));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&W[1], j));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&T, j * 2));
+
+    /*
+     * Compensate for negative A (and correct at the end)
+     */
+    neg = (A->s == -1);
+    if (neg) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&Apos, A));
+        Apos.s = 1;
+        A = &Apos;
+    }
+
+    /*
+     * If 1st call, pre-compute R^2 mod N
+     */
+    if (prec_RR == NULL || prec_RR->p == NULL) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&RR, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&RR, N->n * 2 * biL));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&RR, &RR, N));
+
+        if (prec_RR != NULL)
+            memcpy(prec_RR, &RR, sizeof(mbedtls_mpi));
+    } else
+        memcpy(&RR, prec_RR, sizeof(mbedtls_mpi));
+
+    /*
+     * W[1] = A * R^2 * R^-1 mod N = A * R mod N
+     */
+    if (mbedtls_mpi_cmp_mpi(A, N) >= 0) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&W[1], A, N));
+        /* This should be a no-op because W[1] is already that large before
+         * mbedtls_mpi_mod_mpi(), but it's necessary to avoid an overflow
+         * in mpi_montmul() below, so let's make sure. */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&W[1], N->n + 1));
+    } else
+        MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&W[1], A));
+
+    /* Note that this is safe because W[1] always has at least N->n limbs
+     * (it grew above and was preserved by mbedtls_mpi_copy()). */
+    mpi_montmul(&W[1], &RR, N, mm, &T);
+
+    /*
+     * X = R^2 * R^-1 mod N = R mod N
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(X, &RR));
+    mpi_montred(X, N, mm, &T);
+
+    if (wsize > 1) {
+        /*
+         * W[1 << (wsize - 1)] = W[1] ^ (wsize - 1)
+         */
+        j = one << (wsize - 1);
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&W[j], N->n + 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&W[j], &W[1]));
+
+        for (i = 0; i < wsize - 1; i++)
+            mpi_montmul(&W[j], &W[j], N, mm, &T);
+
+        /*
+         * W[i] = W[i - 1] * W[1]
+         */
+        for (i = j + 1; i < (one << wsize); i++) {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&W[i], N->n + 1));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&W[i], &W[i - 1]));
+
+            mpi_montmul(&W[i], &W[1], N, mm, &T);
+        }
+    }
+
+    nblimbs = E->n;
+    bufsize = 0;
+    nbits = 0;
+    wbits = 0;
+    state = 0;
+
+    while (1) {
+        if (bufsize == 0) {
+            if (nblimbs == 0)
+                break;
+
+            nblimbs--;
+
+            bufsize = sizeof(mbedtls_mpi_uint) << 3;
+        }
+
+        bufsize--;
+
+        ei = (E->p[nblimbs] >> bufsize) & 1;
+
+        /*
+         * skip leading 0s
+         */
+        if (ei == 0 && state == 0)
+            continue;
+
+        if (ei == 0 && state == 1) {
+            /*
+             * out of window, square X
+             */
+            mpi_montmul(X, X, N, mm, &T);
+            continue;
+        }
+
+        /*
+         * add ei to current window
+         */
+        state = 2;
+
+        nbits++;
+        wbits |= (ei << (wsize - nbits));
+
+        if (nbits == wsize) {
+            /*
+             * X = X^wsize R^-1 mod N
+             */
+            for (i = 0; i < wsize; i++)
+                mpi_montmul(X, X, N, mm, &T);
+
+            /*
+             * X = X * W[wbits] R^-1 mod N
+             */
+            MBEDTLS_MPI_CHK(mpi_select(&WW, W, (size_t)1 << wsize, wbits));
+            mpi_montmul(X, &WW, N, mm, &T);
+
+            state--;
+            nbits = 0;
+            wbits = 0;
+        }
+    }
+
+    /*
+     * process the remaining bits
+     */
+    for (i = 0; i < nbits; i++) {
+        mpi_montmul(X, X, N, mm, &T);
+
+        wbits <<= 1;
+
+        if ((wbits & (one << wsize)) != 0)
+            mpi_montmul(X, &W[1], N, mm, &T);
+    }
+
+    /*
+     * X = A^E * R * R^-1 mod N = A^E mod N
+     */
+    mpi_montred(X, N, mm, &T);
+
+    if (neg && E->n != 0 && (E->p[0] & 1) != 0) {
+        X->s = -1;
+        MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(X, N, X));
+    }
+
+cleanup:
+
+    for (i = (one << (wsize - 1)); i < (one << wsize); i++)
+        mbedtls_mpi_free(&W[i]);
+
+    mbedtls_mpi_free(&W[1]);
+    mbedtls_mpi_free(&T);
+    mbedtls_mpi_free(&Apos);
+    mbedtls_mpi_free(&WW);
+
+    if (prec_RR == NULL || prec_RR->p == NULL)
+        mbedtls_mpi_free(&RR);
+
+    return (ret);
+}
+
+/*
+ * Greatest common divisor: G = gcd(A, B)  (HAC 14.54)
+ */
+int mbedtls_mpi_gcd(mbedtls_mpi* G, const mbedtls_mpi* A, const mbedtls_mpi* B) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t lz, lzt;
+    mbedtls_mpi TA, TB;
+
+    MPI_VALIDATE_RET(G != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(B != NULL);
+
+    mbedtls_mpi_init(&TA);
+    mbedtls_mpi_init(&TB);
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&TA, A));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&TB, B));
+
+    lz = mbedtls_mpi_lsb(&TA);
+    lzt = mbedtls_mpi_lsb(&TB);
+
+    /* The loop below gives the correct result when A==0 but not when B==0.
+     * So have a special case for B==0. Leverage the fact that we just
+     * calculated the lsb and lsb(B)==0 iff B is odd or 0 to make the test
+     * slightly more efficient than cmp_int(). */
+    if (lzt == 0 && mbedtls_mpi_get_bit(&TB, 0) == 0) {
+        ret = mbedtls_mpi_copy(G, A);
+        goto cleanup;
+    }
+
+    if (lzt < lz)
+        lz = lzt;
+
+    TA.s = TB.s = 1;
+
+    /* We mostly follow the procedure described in HAC 14.54, but with some
+     * minor differences:
+     * - Sequences of multiplications or divisions by 2 are grouped into a
+     *   single shift operation.
+     * - The procedure in HAC assumes that 0 < TB <= TA.
+     *     - The condition TB <= TA is not actually necessary for correctness.
+     *       TA and TB have symmetric roles except for the loop termination
+     *       condition, and the shifts at the beginning of the loop body
+     *       remove any significance from the ordering of TA vs TB before
+     *       the shifts.
+     *     - If TA = 0, the loop goes through 0 iterations and the result is
+     *       correctly TB.
+     *     - The case TB = 0 was short-circuited above.
+     *
+     * For the correctness proof below, decompose the original values of
+     * A and B as
+     *   A = sa * 2^a * A' with A'=0 or A' odd, and sa = +-1
+     *   B = sb * 2^b * B' with B'=0 or B' odd, and sb = +-1
+     * Then gcd(A, B) = 2^{min(a,b)} * gcd(A',B'),
+     * and gcd(A',B') is odd or 0.
+     *
+     * At the beginning, we have TA = |A| and TB = |B| so gcd(A,B) = gcd(TA,TB).
+     * The code maintains the following invariant:
+     *     gcd(A,B) = 2^k * gcd(TA,TB) for some k   (I)
+     */
+
+    /* Proof that the loop terminates:
+     * At each iteration, either the right-shift by 1 is made on a nonzero
+     * value and the nonnegative integer bitlen(TA) + bitlen(TB) decreases
+     * by at least 1, or the right-shift by 1 is made on zero and then
+     * TA becomes 0 which ends the loop (TB cannot be 0 if it is right-shifted
+     * since in that case TB is calculated from TB-TA with the condition TB>TA).
+     */
+    while (mbedtls_mpi_cmp_int(&TA, 0) != 0) {
+        /* Divisions by 2 preserve the invariant (I). */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&TA, mbedtls_mpi_lsb(&TA)));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&TB, mbedtls_mpi_lsb(&TB)));
+
+        /* Set either TA or TB to |TA-TB|/2. Since TA and TB are both odd,
+         * TA-TB is even so the division by 2 has an integer result.
+         * Invariant (I) is preserved since any odd divisor of both TA and TB
+         * also divides |TA-TB|/2, and any odd divisor of both TA and |TA-TB|/2
+         * also divides TB, and any odd divisior of both TB and |TA-TB|/2 also
+         * divides TA.
+         */
+        if (mbedtls_mpi_cmp_mpi(&TA, &TB) >= 0) {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_abs(&TA, &TA, &TB));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&TA, 1));
+        } else {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_abs(&TB, &TB, &TA));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&TB, 1));
+        }
+        /* Note that one of TA or TB is still odd. */
+    }
+
+    /* By invariant (I), gcd(A,B) = 2^k * gcd(TA,TB) for some k.
+     * At the loop exit, TA = 0, so gcd(TA,TB) = TB.
+     * - If there was at least one loop iteration, then one of TA or TB is odd,
+     *   and TA = 0, so TB is odd and gcd(TA,TB) = gcd(A',B'). In this case,
+     *   lz = min(a,b) so gcd(A,B) = 2^lz * TB.
+     * - If there was no loop iteration, then A was 0, and gcd(A,B) = B.
+     *   In this case, lz = 0 and B = TB so gcd(A,B) = B = 2^lz * TB as well.
+     */
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&TB, lz));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(G, &TB));
+
+cleanup:
+
+    mbedtls_mpi_free(&TA);
+    mbedtls_mpi_free(&TB);
+
+    return (ret);
+}
+
+/* Fill X with n_bytes random bytes.
+ * X must already have room for those bytes.
+ * The ordering of the bytes returned from the RNG is suitable for
+ * deterministic ECDSA (see RFC 6979 §3.3 and mbedtls_mpi_random()).
+ * The size and sign of X are unchanged.
+ * n_bytes must not be 0.
+ */
+static int mpi_fill_random_internal(mbedtls_mpi* X, size_t n_bytes,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    const size_t limbs = CHARS_TO_LIMBS(n_bytes);
+    const size_t overhead = (limbs * ciL) - n_bytes;
+
+    if (X->n < limbs)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    memset(X->p, 0, overhead);
+    memset((unsigned char*)X->p + limbs * ciL, 0, (X->n - limbs) * ciL);
+    MBEDTLS_MPI_CHK(f_rng(p_rng, (unsigned char*)X->p + overhead, n_bytes));
+    mpi_bigendian_to_host(X->p, limbs);
+
+cleanup:
+    return (ret);
+}
+
+/*
+ * Fill X with size bytes of random.
+ *
+ * Use a temporary bytes representation to make sure the result is the same
+ * regardless of the platform endianness (useful when f_rng is actually
+ * deterministic, eg for tests).
+ */
+int mbedtls_mpi_fill_random(mbedtls_mpi* X, size_t size,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t const limbs = CHARS_TO_LIMBS(size);
+
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(f_rng != NULL);
+
+    /* Ensure that target MPI has exactly the necessary number of limbs */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_resize_clear(X, limbs));
+    if (size == 0)
+        return (0);
+
+    ret = mpi_fill_random_internal(X, size, f_rng, p_rng);
+
+cleanup:
+    return (ret);
+}
+
+int mbedtls_mpi_random(mbedtls_mpi* X, mbedtls_mpi_sint min, const mbedtls_mpi* N,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret = MBEDTLS_ERR_MPI_BAD_INPUT_DATA;
+    int count;
+    unsigned lt_lower = 1, lt_upper = 0;
+    size_t n_bits = mbedtls_mpi_bitlen(N);
+    size_t n_bytes = (n_bits + 7) / 8;
+    mbedtls_mpi lower_bound;
+
+    if (min < 0)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+    if (mbedtls_mpi_cmp_int(N, min) <= 0)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    /*
+     * When min == 0, each try has at worst a probability 1/2 of failing
+     * (the msb has a probability 1/2 of being 0, and then the result will
+     * be < N), so after 30 tries failure probability is a most 2**(-30).
+     *
+     * When N is just below a power of 2, as is the case when generating
+     * a random scalar on most elliptic curves, 1 try is enough with
+     * overwhelming probability. When N is just above a power of 2,
+     * as when generating a random scalar on secp224k1, each try has
+     * a probability of failing that is almost 1/2.
+     *
+     * The probabilities are almost the same if min is nonzero but negligible
+     * compared to N. This is always the case when N is crypto-sized, but
+     * it's convenient to support small N for testing purposes. When N
+     * is small, use a higher repeat count, otherwise the probability of
+     * failure is macroscopic.
+     */
+    count = (n_bytes > 4 ? 30 : 250);
+
+    mbedtls_mpi_init(&lower_bound);
+
+    /* Ensure that target MPI has exactly the same number of limbs
+     * as the upper bound, even if the upper bound has leading zeros.
+     * This is necessary for the mbedtls_mpi_lt_mpi_ct() check. */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_resize_clear(X, N->n));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&lower_bound, N->n));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&lower_bound, min));
+
+    /*
+     * Match the procedure given in RFC 6979 §3.3 (deterministic ECDSA)
+     * when f_rng is a suitably parametrized instance of HMAC_DRBG:
+     * - use the same byte ordering;
+     * - keep the leftmost n_bits bits of the generated octet string;
+     * - try until result is in the desired range.
+     * This also avoids any bias, which is especially important for ECDSA.
+     */
+    do {
+        MBEDTLS_MPI_CHK(mpi_fill_random_internal(X, n_bytes, f_rng, p_rng));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(X, 8 * n_bytes - n_bits));
+
+        if (--count == 0) {
+            ret = MBEDTLS_ERR_MPI_NOT_ACCEPTABLE;
+            goto cleanup;
+        }
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_lt_mpi_ct(X, &lower_bound, &lt_lower));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_lt_mpi_ct(X, N, &lt_upper));
+    } while (lt_lower != 0 || lt_upper == 0);
+
+cleanup:
+    mbedtls_mpi_free(&lower_bound);
+    return (ret);
+}
+
+/*
+ * Modular inverse: X = A^-1 mod N  (HAC 14.61 / 14.64)
+ */
+int mbedtls_mpi_inv_mod(mbedtls_mpi* X, const mbedtls_mpi* A, const mbedtls_mpi* N) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_mpi G, TA, TU, U1, U2, TB, TV, V1, V2;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(A != NULL);
+    MPI_VALIDATE_RET(N != NULL);
+
+    if (mbedtls_mpi_cmp_int(N, 1) <= 0)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    mbedtls_mpi_init(&TA);
+    mbedtls_mpi_init(&TU);
+    mbedtls_mpi_init(&U1);
+    mbedtls_mpi_init(&U2);
+    mbedtls_mpi_init(&G);
+    mbedtls_mpi_init(&TB);
+    mbedtls_mpi_init(&TV);
+    mbedtls_mpi_init(&V1);
+    mbedtls_mpi_init(&V2);
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_gcd(&G, A, N));
+
+    if (mbedtls_mpi_cmp_int(&G, 1) != 0) {
+        ret = MBEDTLS_ERR_MPI_NOT_ACCEPTABLE;
+        goto cleanup;
+    }
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&TA, A, N));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&TU, &TA));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&TB, N));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&TV, N));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&U1, 1));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&U2, 0));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&V1, 0));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&V2, 1));
+
+    do {
+        while ((TU.p[0] & 1) == 0) {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&TU, 1));
+
+            if ((U1.p[0] & 1) != 0 || (U2.p[0] & 1) != 0) {
+                MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(&U1, &U1, &TB));
+                MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&U2, &U2, &TA));
+            }
+
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&U1, 1));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&U2, 1));
+        }
+
+        while ((TV.p[0] & 1) == 0) {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&TV, 1));
+
+            if ((V1.p[0] & 1) != 0 || (V2.p[0] & 1) != 0) {
+                MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(&V1, &V1, &TB));
+                MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&V2, &V2, &TA));
+            }
+
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&V1, 1));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&V2, 1));
+        }
+
+        if (mbedtls_mpi_cmp_mpi(&TU, &TV) >= 0) {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&TU, &TU, &TV));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&U1, &U1, &V1));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&U2, &U2, &V2));
+        } else {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&TV, &TV, &TU));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&V1, &V1, &U1));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&V2, &V2, &U2));
+        }
+    } while (mbedtls_mpi_cmp_int(&TU, 0) != 0);
+
+    while (mbedtls_mpi_cmp_int(&V1, 0) < 0)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(&V1, &V1, N));
+
+    while (mbedtls_mpi_cmp_mpi(&V1, N) >= 0)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&V1, &V1, N));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(X, &V1));
+
+cleanup:
+
+    mbedtls_mpi_free(&TA);
+    mbedtls_mpi_free(&TU);
+    mbedtls_mpi_free(&U1);
+    mbedtls_mpi_free(&U2);
+    mbedtls_mpi_free(&G);
+    mbedtls_mpi_free(&TB);
+    mbedtls_mpi_free(&TV);
+    mbedtls_mpi_free(&V1);
+    mbedtls_mpi_free(&V2);
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_GENPRIME)
+
+static const int small_prime[] = {3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61,
+    67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163,
+    167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269,
+    271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383,
+    389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499,
+    503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619,
+    631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751,
+    757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881,
+    883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, -103};
+
+/*
+ * Small divisors test (X must be positive)
+ *
+ * Return values:
+ * 0: no small factor (possible prime, more tests needed)
+ * 1: certain prime
+ * MBEDTLS_ERR_MPI_NOT_ACCEPTABLE: certain non-prime
+ * other negative: error
+ */
+static int mpi_check_small_factors(const mbedtls_mpi* X) {
+    int ret = 0;
+    size_t i;
+    mbedtls_mpi_uint r;
+
+    if ((X->p[0] & 1) == 0)
+        return (MBEDTLS_ERR_MPI_NOT_ACCEPTABLE);
+
+    for (i = 0; small_prime[i] > 0; i++) {
+        if (mbedtls_mpi_cmp_int(X, small_prime[i]) <= 0)
+            return (1);
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_int(&r, X, small_prime[i]));
+
+        if (r == 0)
+            return (MBEDTLS_ERR_MPI_NOT_ACCEPTABLE);
+    }
+
+cleanup:
+    return (ret);
+}
+
+/*
+ * Miller-Rabin pseudo-primality test  (HAC 4.24)
+ */
+static int mpi_miller_rabin(const mbedtls_mpi* X, size_t rounds,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret, count;
+    size_t i, j, k, s;
+    mbedtls_mpi W, R, T, A, RR;
+
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(f_rng != NULL);
+
+    mbedtls_mpi_init(&W);
+    mbedtls_mpi_init(&R);
+    mbedtls_mpi_init(&T);
+    mbedtls_mpi_init(&A);
+    mbedtls_mpi_init(&RR);
+
+    /*
+     * W = |X| - 1
+     * R = W >> lsb( W )
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&W, X, 1));
+    s = mbedtls_mpi_lsb(&W);
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&R, &W));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&R, s));
+
+    for (i = 0; i < rounds; i++) {
+        /*
+         * pick a random A, 1 < A < |X| - 1
+         */
+        count = 0;
+        do {
+            MBEDTLS_MPI_CHK(mbedtls_mpi_fill_random(&A, X->n * ciL, f_rng, p_rng));
+
+            j = mbedtls_mpi_bitlen(&A);
+            k = mbedtls_mpi_bitlen(&W);
+            if (j > k) {
+                A.p[A.n - 1] &= ((mbedtls_mpi_uint)1 << (k - (A.n - 1) * biL - 1)) - 1;
+            }
+
+            if (count++ > 30) {
+                ret = MBEDTLS_ERR_MPI_NOT_ACCEPTABLE;
+                goto cleanup;
+            }
+
+        } while (mbedtls_mpi_cmp_mpi(&A, &W) >= 0 || mbedtls_mpi_cmp_int(&A, 1) <= 0);
+
+        /*
+         * A = A^R mod |X|
+         */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_exp_mod(&A, &A, &R, X, &RR));
+
+        if (mbedtls_mpi_cmp_mpi(&A, &W) == 0 || mbedtls_mpi_cmp_int(&A, 1) == 0)
+            continue;
+
+        j = 1;
+        while (j < s && mbedtls_mpi_cmp_mpi(&A, &W) != 0) {
+            /*
+             * A = A * A mod |X|
+             */
+            MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&T, &A, &A));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&A, &T, X));
+
+            if (mbedtls_mpi_cmp_int(&A, 1) == 0)
+                break;
+
+            j++;
+        }
+
+        /*
+         * not prime if A != |X| - 1 or A == 1
+         */
+        if (mbedtls_mpi_cmp_mpi(&A, &W) != 0 || mbedtls_mpi_cmp_int(&A, 1) == 0) {
+            ret = MBEDTLS_ERR_MPI_NOT_ACCEPTABLE;
+            break;
+        }
+    }
+
+cleanup:
+    mbedtls_mpi_free(&W);
+    mbedtls_mpi_free(&R);
+    mbedtls_mpi_free(&T);
+    mbedtls_mpi_free(&A);
+    mbedtls_mpi_free(&RR);
+
+    return (ret);
+}
+
+/*
+ * Pseudo-primality test: small factors, then Miller-Rabin
+ */
+int mbedtls_mpi_is_prime_ext(const mbedtls_mpi* X, int rounds,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_mpi XX;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(f_rng != NULL);
+
+    XX.s = 1;
+    XX.n = X->n;
+    XX.p = X->p;
+
+    if (mbedtls_mpi_cmp_int(&XX, 0) == 0 || mbedtls_mpi_cmp_int(&XX, 1) == 0)
+        return (MBEDTLS_ERR_MPI_NOT_ACCEPTABLE);
+
+    if (mbedtls_mpi_cmp_int(&XX, 2) == 0)
+        return (0);
+
+    if ((ret = mpi_check_small_factors(&XX)) != 0) {
+        if (ret == 1)
+            return (0);
+
+        return (ret);
+    }
+
+    return (mpi_miller_rabin(&XX, rounds, f_rng, p_rng));
+}
+
+/*
+ * Prime number generation
+ *
+ * To generate an RSA key in a way recommended by FIPS 186-4, both primes must
+ * be either 1024 bits or 1536 bits long, and flags must contain
+ * MBEDTLS_MPI_GEN_PRIME_FLAG_LOW_ERR.
+ */
+int mbedtls_mpi_gen_prime(mbedtls_mpi* X, size_t nbits, int flags,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+#ifdef MBEDTLS_HAVE_INT64
+// ceil(2^63.5)
+#define CEIL_MAXUINT_DIV_SQRT2 0xb504f333f9de6485ULL
+#else
+// ceil(2^31.5)
+#define CEIL_MAXUINT_DIV_SQRT2 0xb504f334U
+#endif
+    int ret = MBEDTLS_ERR_MPI_NOT_ACCEPTABLE;
+    size_t k, n;
+    int rounds;
+    mbedtls_mpi_uint r;
+    mbedtls_mpi Y;
+
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(f_rng != NULL);
+
+    if (nbits < 3 || nbits > MBEDTLS_MPI_MAX_BITS)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    mbedtls_mpi_init(&Y);
+
+    n = BITS_TO_LIMBS(nbits);
+
+    if ((flags & MBEDTLS_MPI_GEN_PRIME_FLAG_LOW_ERR) == 0) {
+        /*
+         * 2^-80 error probability, number of rounds chosen per HAC, table 4.4
+         */
+        rounds = ((nbits >= 1300) ? 2 :
+                  (nbits >= 850)  ? 3 :
+                  (nbits >= 650)  ? 4 :
+                  (nbits >= 350)  ? 8 :
+                  (nbits >= 250)  ? 12 :
+                  (nbits >= 150)  ? 18 :
+                                    27);
+    } else {
+        /*
+         * 2^-100 error probability, number of rounds computed based on HAC,
+         * fact 4.48
+         */
+        rounds = ((nbits >= 1450) ? 4 :
+                  (nbits >= 1150) ? 5 :
+                  (nbits >= 1000) ? 6 :
+                  (nbits >= 850)  ? 7 :
+                  (nbits >= 750)  ? 8 :
+                  (nbits >= 500)  ? 13 :
+                  (nbits >= 250)  ? 28 :
+                  (nbits >= 150)  ? 40 :
+                                    51);
+    }
+
+    while (1) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_fill_random(X, n * ciL, f_rng, p_rng));
+        /* make sure generated number is at least (nbits-1)+0.5 bits (FIPS 186-4 §B.3.3
+         * steps 4.4, 5.5) */
+        if (X->p[n - 1] < CEIL_MAXUINT_DIV_SQRT2)
+            continue;
+
+        k = n * biL;
+        if (k > nbits)
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(X, k - nbits));
+        X->p[0] |= 1;
+
+        if ((flags & MBEDTLS_MPI_GEN_PRIME_FLAG_DH) == 0) {
+            ret = mbedtls_mpi_is_prime_ext(X, rounds, f_rng, p_rng);
+
+            if (ret != MBEDTLS_ERR_MPI_NOT_ACCEPTABLE)
+                goto cleanup;
+        } else {
+            /*
+             * An necessary condition for Y and X = 2Y + 1 to be prime
+             * is X = 2 mod 3 (which is equivalent to Y = 2 mod 3).
+             * Make sure it is satisfied, while keeping X = 3 mod 4
+             */
+
+            X->p[0] |= 2;
+
+            MBEDTLS_MPI_CHK(mbedtls_mpi_mod_int(&r, X, 3));
+            if (r == 0)
+                MBEDTLS_MPI_CHK(mbedtls_mpi_add_int(X, X, 8));
+            else if (r == 1)
+                MBEDTLS_MPI_CHK(mbedtls_mpi_add_int(X, X, 4));
+
+            /* Set Y = (X-1) / 2, which is X / 2 because X is odd */
+            MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&Y, X));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&Y, 1));
+
+            while (1) {
+                /*
+                 * First, check small factors for X and Y
+                 * before doing Miller-Rabin on any of them
+                 */
+                if ((ret = mpi_check_small_factors(X)) == 0 &&
+                    (ret = mpi_check_small_factors(&Y)) == 0 &&
+                    (ret = mpi_miller_rabin(X, rounds, f_rng, p_rng)) == 0 &&
+                    (ret = mpi_miller_rabin(&Y, rounds, f_rng, p_rng)) == 0)
+                    goto cleanup;
+
+                if (ret != MBEDTLS_ERR_MPI_NOT_ACCEPTABLE)
+                    goto cleanup;
+
+                /*
+                 * Next candidates. We want to preserve Y = (X-1) / 2 and
+                 * Y = 1 mod 2 and Y = 2 mod 3 (eq X = 3 mod 4 and X = 2 mod 3)
+                 * so up Y by 6 and X by 12.
+                 */
+                MBEDTLS_MPI_CHK(mbedtls_mpi_add_int(X, X, 12));
+                MBEDTLS_MPI_CHK(mbedtls_mpi_add_int(&Y, &Y, 6));
+            }
+        }
+    }
+
+cleanup:
+
+    mbedtls_mpi_free(&Y);
+
+    return (ret);
+}
+
+#endif /* MBEDTLS_GENPRIME */
+
+#if defined(MBEDTLS_SELF_TEST)
+
+#define GCD_PAIR_COUNT 3
+
+static const int gcd_pairs[GCD_PAIR_COUNT][3] = {{693, 609, 21}, {1764, 868, 28},
+    {768454923, 542167814, 1}};
+
+/*
+ * Checkup routine
+ */
+int mbedtls_mpi_self_test(int verbose) {
+    int ret, i;
+    mbedtls_mpi A, E, N, X, Y, U, V;
+
+    mbedtls_mpi_init(&A);
+    mbedtls_mpi_init(&E);
+    mbedtls_mpi_init(&N);
+    mbedtls_mpi_init(&X);
+    mbedtls_mpi_init(&Y);
+    mbedtls_mpi_init(&U);
+    mbedtls_mpi_init(&V);
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&A, 16,
+        "EFE021C2645FD1DC586E69184AF4A31E"
+        "D5F53E93B5F123FA41680867BA110131"
+        "944FE7952E2517337780CB0DB80E61AA"
+        "E7C8DDC6C5C6AADEB34EB38A2F40D5E6"));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&E, 16,
+        "B2E7EFD37075B9F03FF989C7C5051C20"
+        "34D2A323810251127E7BF8625A4F49A5"
+        "F3E27F4DA8BD59C47D6DAABA4C8127BD"
+        "5B5C25763222FEFCCFC38B832366C29E"));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&N, 16,
+        "0066A198186C18C10B2F5ED9B522752A"
+        "9830B69916E535C8F047518A889A43A5"
+        "94B6BED27A168D31D4A52F88925AA8F5"));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&X, &A, &N));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&U, 16,
+        "602AB7ECA597A3D6B56FF9829A5E8B85"
+        "9E857EA95A03512E2BAE7391688D264A"
+        "A5663B0341DB9CCFD2C4C5F421FEC814"
+        "8001B72E848A38CAE1C65F78E56ABDEF"
+        "E12D3C039B8A02D6BE593F0BBBDA56F1"
+        "ECF677152EF804370C1A305CAF3B5BF1"
+        "30879B56C61DE584A0F53A2447A51E"));
+
+    if (verbose != 0)
+        mbedtls_printf("  MPI test #1 (mul_mpi): ");
+
+    if (mbedtls_mpi_cmp_mpi(&X, &U) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n");
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_div_mpi(&X, &Y, &A, &N));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&U, 16, "256567336059E52CAE22925474705F39A94"));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&V, 16,
+        "6613F26162223DF488E9CD48CC132C7A"
+        "0AC93C701B001B092E4E5B9F73BCD27B"
+        "9EE50D0657C77F374E903CDFA4C642"));
+
+    if (verbose != 0)
+        mbedtls_printf("  MPI test #2 (div_mpi): ");
+
+    if (mbedtls_mpi_cmp_mpi(&X, &U) != 0 || mbedtls_mpi_cmp_mpi(&Y, &V) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n");
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_exp_mod(&X, &A, &E, &N, NULL));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&U, 16,
+        "36E139AEA55215609D2816998ED020BB"
+        "BD96C37890F65171D948E9BC7CBAA4D9"
+        "325D24D6A3C12710F10A09FA08AB87"));
+
+    if (verbose != 0)
+        mbedtls_printf("  MPI test #3 (exp_mod): ");
+
+    if (mbedtls_mpi_cmp_mpi(&X, &U) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n");
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_inv_mod(&X, &A, &N));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&U, 16,
+        "003A0AAEDD7E784FC07D8F9EC6E3BFD5"
+        "C3DBA76456363A10869622EAC2DD84EC"
+        "C5B8A74DAC4D09E03B5E0BE779F2DF61"));
+
+    if (verbose != 0)
+        mbedtls_printf("  MPI test #4 (inv_mod): ");
+
+    if (mbedtls_mpi_cmp_mpi(&X, &U) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n");
+
+    if (verbose != 0)
+        mbedtls_printf("  MPI test #5 (simple gcd): ");
+
+    for (i = 0; i < GCD_PAIR_COUNT; i++) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&X, gcd_pairs[i][0]));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&Y, gcd_pairs[i][1]));
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_gcd(&A, &X, &Y));
+
+        if (mbedtls_mpi_cmp_int(&A, gcd_pairs[i][2]) != 0) {
+            if (verbose != 0)
+                mbedtls_printf("failed at %d\n", i);
+
+            ret = 1;
+            goto cleanup;
+        }
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n");
+
+cleanup:
+
+    if (ret != 0 && verbose != 0)
+        mbedtls_printf("Unexpected error, return code = %08X\n", (unsigned int)ret);
+
+    mbedtls_mpi_free(&A);
+    mbedtls_mpi_free(&E);
+    mbedtls_mpi_free(&N);
+    mbedtls_mpi_free(&X);
+    mbedtls_mpi_free(&Y);
+    mbedtls_mpi_free(&U);
+    mbedtls_mpi_free(&V);
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+
+    return (ret);
+}
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_BIGNUM_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/bn_mul.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/bn_mul.h
new file mode 100644
index 0000000000..f23e98c379
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/bn_mul.h
@@ -0,0 +1,892 @@
+/**
+ * \file bn_mul.h
+ *
+ * \brief Multi-precision integer library
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+/*
+ *      Multiply source vector [s] with b, add result
+ *       to destination vector [d] and set carry c.
+ *
+ *      Currently supports:
+ *
+ *         . IA-32 (386+)         . AMD64 / EM64T
+ *         . IA-32 (SSE2)         . Motorola 68000
+ *         . PowerPC, 32-bit      . MicroBlaze
+ *         . PowerPC, 64-bit      . TriCore
+ *         . SPARC v8             . ARM v3+
+ *         . Alpha                . MIPS32
+ *         . C, longlong          . C, generic
+ */
+#ifndef MBEDTLS_BN_MUL_H
+#define MBEDTLS_BN_MUL_H
+
+#include "mbedtls/bignum.h"
+#include "mbedtls/build_info.h"
+
+/*
+ * Conversion macros for embedded constants:
+ * build lists of mbedtls_mpi_uint's from lists of unsigned char's grouped by 8, 4 or 2
+ */
+#if defined(MBEDTLS_HAVE_INT32)
+
+#define MBEDTLS_BYTES_TO_T_UINT_4(a, b, c, d)                                                      \
+    ((mbedtls_mpi_uint)(a) << 0) | ((mbedtls_mpi_uint)(b) << 8) | ((mbedtls_mpi_uint)(c) << 16) |  \
+        ((mbedtls_mpi_uint)(d) << 24)
+
+#define MBEDTLS_BYTES_TO_T_UINT_2(a, b) MBEDTLS_BYTES_TO_T_UINT_4(a, b, 0, 0)
+
+#define MBEDTLS_BYTES_TO_T_UINT_8(a, b, c, d, e, f, g, h)                                          \
+    MBEDTLS_BYTES_TO_T_UINT_4(a, b, c, d), MBEDTLS_BYTES_TO_T_UINT_4(e, f, g, h)
+
+#else /* 64-bits */
+
+#define MBEDTLS_BYTES_TO_T_UINT_8(a, b, c, d, e, f, g, h)                                          \
+    ((mbedtls_mpi_uint)(a) << 0) | ((mbedtls_mpi_uint)(b) << 8) | ((mbedtls_mpi_uint)(c) << 16) |  \
+        ((mbedtls_mpi_uint)(d) << 24) | ((mbedtls_mpi_uint)(e) << 32) |                            \
+        ((mbedtls_mpi_uint)(f) << 40) | ((mbedtls_mpi_uint)(g) << 48) |                            \
+        ((mbedtls_mpi_uint)(h) << 56)
+
+#define MBEDTLS_BYTES_TO_T_UINT_4(a, b, c, d) MBEDTLS_BYTES_TO_T_UINT_8(a, b, c, d, 0, 0, 0, 0)
+
+#define MBEDTLS_BYTES_TO_T_UINT_2(a, b) MBEDTLS_BYTES_TO_T_UINT_8(a, b, 0, 0, 0, 0, 0, 0)
+
+#endif /* bits in mbedtls_mpi_uint */
+
+#if defined(MBEDTLS_HAVE_ASM)
+
+#ifndef asm
+#define asm __asm
+#endif
+
+/* armcc5 --gnu defines __GNUC__ but doesn't support GNU's extended asm */
+#if defined(__GNUC__) && (!defined(__ARMCC_VERSION) || __ARMCC_VERSION >= 6000000)
+
+/*
+ * Disable use of the i386 assembly code below if option -O0, to disable all
+ * compiler optimisations, is passed, detected with __OPTIMIZE__
+ * This is done as the number of registers used in the assembly code doesn't
+ * work with the -O0 option.
+ */
+#if defined(__i386__) && defined(__OPTIMIZE__)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                    \
+        "movl   %%ebx, %0           \n\t"   \
+        "movl   %5, %%esi           \n\t"   \
+        "movl   %6, %%edi           \n\t"   \
+        "movl   %7, %%ecx           \n\t"   \
+        "movl   %8, %%ebx           \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "lodsl                      \n\t"                                                              \
+    "mull   %%ebx               \n\t"                                                              \
+    "addl   %%ecx,   %%eax      \n\t"                                                              \
+    "adcl   $0,      %%edx      \n\t"                                                              \
+    "addl   (%%edi), %%eax      \n\t"                                                              \
+    "adcl   $0,      %%edx      \n\t"                                                              \
+    "movl   %%edx,   %%ecx      \n\t"                                                              \
+    "stosl                      \n\t"
+
+#if defined(MBEDTLS_HAVE_SSE2)
+
+#define MULADDC_HUIT                                                                               \
+    "movd     %%ecx,     %%mm1      \n\t"                                                          \
+    "movd     %%ebx,     %%mm0      \n\t"                                                          \
+    "movd     (%%edi),   %%mm3      \n\t"                                                          \
+    "paddq    %%mm3,     %%mm1      \n\t"                                                          \
+    "movd     (%%esi),   %%mm2      \n\t"                                                          \
+    "pmuludq  %%mm0,     %%mm2      \n\t"                                                          \
+    "movd     4(%%esi),  %%mm4      \n\t"                                                          \
+    "pmuludq  %%mm0,     %%mm4      \n\t"                                                          \
+    "movd     8(%%esi),  %%mm6      \n\t"                                                          \
+    "pmuludq  %%mm0,     %%mm6      \n\t"                                                          \
+    "movd     12(%%esi), %%mm7      \n\t"                                                          \
+    "pmuludq  %%mm0,     %%mm7      \n\t"                                                          \
+    "paddq    %%mm2,     %%mm1      \n\t"                                                          \
+    "movd     4(%%edi),  %%mm3      \n\t"                                                          \
+    "paddq    %%mm4,     %%mm3      \n\t"                                                          \
+    "movd     8(%%edi),  %%mm5      \n\t"                                                          \
+    "paddq    %%mm6,     %%mm5      \n\t"                                                          \
+    "movd     12(%%edi), %%mm4      \n\t"                                                          \
+    "paddq    %%mm4,     %%mm7      \n\t"                                                          \
+    "movd     %%mm1,     (%%edi)    \n\t"                                                          \
+    "movd     16(%%esi), %%mm2      \n\t"                                                          \
+    "pmuludq  %%mm0,     %%mm2      \n\t"                                                          \
+    "psrlq    $32,       %%mm1      \n\t"                                                          \
+    "movd     20(%%esi), %%mm4      \n\t"                                                          \
+    "pmuludq  %%mm0,     %%mm4      \n\t"                                                          \
+    "paddq    %%mm3,     %%mm1      \n\t"                                                          \
+    "movd     24(%%esi), %%mm6      \n\t"                                                          \
+    "pmuludq  %%mm0,     %%mm6      \n\t"                                                          \
+    "movd     %%mm1,     4(%%edi)   \n\t"                                                          \
+    "psrlq    $32,       %%mm1      \n\t"                                                          \
+    "movd     28(%%esi), %%mm3      \n\t"                                                          \
+    "pmuludq  %%mm0,     %%mm3      \n\t"                                                          \
+    "paddq    %%mm5,     %%mm1      \n\t"                                                          \
+    "movd     16(%%edi), %%mm5      \n\t"                                                          \
+    "paddq    %%mm5,     %%mm2      \n\t"                                                          \
+    "movd     %%mm1,     8(%%edi)   \n\t"                                                          \
+    "psrlq    $32,       %%mm1      \n\t"                                                          \
+    "paddq    %%mm7,     %%mm1      \n\t"                                                          \
+    "movd     20(%%edi), %%mm5      \n\t"                                                          \
+    "paddq    %%mm5,     %%mm4      \n\t"                                                          \
+    "movd     %%mm1,     12(%%edi)  \n\t"                                                          \
+    "psrlq    $32,       %%mm1      \n\t"                                                          \
+    "paddq    %%mm2,     %%mm1      \n\t"                                                          \
+    "movd     24(%%edi), %%mm5      \n\t"                                                          \
+    "paddq    %%mm5,     %%mm6      \n\t"                                                          \
+    "movd     %%mm1,     16(%%edi)  \n\t"                                                          \
+    "psrlq    $32,       %%mm1      \n\t"                                                          \
+    "paddq    %%mm4,     %%mm1      \n\t"                                                          \
+    "movd     28(%%edi), %%mm5      \n\t"                                                          \
+    "paddq    %%mm5,     %%mm3      \n\t"                                                          \
+    "movd     %%mm1,     20(%%edi)  \n\t"                                                          \
+    "psrlq    $32,       %%mm1      \n\t"                                                          \
+    "paddq    %%mm6,     %%mm1      \n\t"                                                          \
+    "movd     %%mm1,     24(%%edi)  \n\t"                                                          \
+    "psrlq    $32,       %%mm1      \n\t"                                                          \
+    "paddq    %%mm3,     %%mm1      \n\t"                                                          \
+    "movd     %%mm1,     28(%%edi)  \n\t"                                                          \
+    "addl     $32,       %%edi      \n\t"                                                          \
+    "addl     $32,       %%esi      \n\t"                                                          \
+    "psrlq    $32,       %%mm1      \n\t"                                                          \
+    "movd     %%mm1,     %%ecx      \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "emms                   \n\t"   \
+        "movl   %4, %%ebx       \n\t"   \
+        "movl   %%ecx, %1       \n\t"   \
+        "movl   %%edi, %2       \n\t"   \
+        "movl   %%esi, %3       \n\t"   \
+        : "=m" (t), "=m" (c), "=m" (d), "=m" (s)        \
+        : "m" (t), "m" (s), "m" (d), "m" (c), "m" (b)   \
+        : "eax", "ebx", "ecx", "edx", "esi", "edi"      \
+    );
+
+#else
+
+#define MULADDC_STOP                                                                               \
+        "movl   %4, %%ebx       \n\t"   \
+        "movl   %%ecx, %1       \n\t"   \
+        "movl   %%edi, %2       \n\t"   \
+        "movl   %%esi, %3       \n\t"   \
+        : "=m" (t), "=m" (c), "=m" (d), "=m" (s)        \
+        : "m" (t), "m" (s), "m" (d), "m" (c), "m" (b)   \
+        : "eax", "ebx", "ecx", "edx", "esi", "edi"      \
+    );
+#endif /* SSE2 */
+#endif /* i386 */
+
+#if defined(__amd64__) || defined(__x86_64__)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                    \
+        "xorq   %%r8, %%r8\n"
+
+#define MULADDC_CORE                                                                               \
+    "movq   (%%rsi), %%rax\n"                                                                      \
+    "mulq   %%rbx\n"                                                                               \
+    "addq   $8, %%rsi\n"                                                                           \
+    "addq   %%rcx, %%rax\n"                                                                        \
+    "movq   %%r8, %%rcx\n"                                                                         \
+    "adcq   $0, %%rdx\n"                                                                           \
+    "nop    \n"                                                                                    \
+    "addq   %%rax, (%%rdi)\n"                                                                      \
+    "adcq   %%rdx, %%rcx\n"                                                                        \
+    "addq   $8, %%rdi\n"
+
+#define MULADDC_STOP                                                                               \
+        : "+c" (c), "+D" (d), "+S" (s), "+m" (*(uint64_t (*)[16]) d) \
+        : "b" (b), "m" (*(const uint64_t (*)[16]) s)                 \
+        : "rax", "rdx", "r8"                                         \
+    );
+
+#endif /* AMD64 */
+
+#if defined(__aarch64__)
+
+#define MULADDC_INIT                                                                               \
+    asm(
+
+#define MULADDC_CORE                                                                               \
+    "ldr x4, [%2], #8   \n\t"                                                                      \
+    "ldr x5, [%1]       \n\t"                                                                      \
+    "mul x6, x4, %4     \n\t"                                                                      \
+    "umulh x7, x4, %4   \n\t"                                                                      \
+    "adds x5, x5, x6    \n\t"                                                                      \
+    "adc x7, x7, xzr    \n\t"                                                                      \
+    "adds x5, x5, %0    \n\t"                                                                      \
+    "adc %0, x7, xzr    \n\t"                                                                      \
+    "str x5, [%1], #8   \n\t"
+
+#define MULADDC_STOP                                                                               \
+         : "+r" (c),  "+r" (d), "+r" (s), "+m" (*(uint64_t (*)[16]) d)  \
+         : "r" (b), "m" (*(const uint64_t (*)[16]) s)                   \
+         : "x4", "x5", "x6", "x7", "cc"                                 \
+    );
+
+#endif /* Aarch64 */
+
+#if defined(__mc68020__) || defined(__mcpu32__)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                \
+        "movl   %3, %%a2        \n\t"   \
+        "movl   %4, %%a3        \n\t"   \
+        "movl   %5, %%d3        \n\t"   \
+        "movl   %6, %%d2        \n\t"   \
+        "moveq  #0, %%d0        \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "movel  %%a2@+, %%d1    \n\t"                                                                  \
+    "mulul  %%d2, %%d4:%%d1 \n\t"                                                                  \
+    "addl   %%d3, %%d1      \n\t"                                                                  \
+    "addxl  %%d0, %%d4      \n\t"                                                                  \
+    "moveq  #0,   %%d3      \n\t"                                                                  \
+    "addl   %%d1, %%a3@+    \n\t"                                                                  \
+    "addxl  %%d4, %%d3      \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "movl   %%d3, %0        \n\t"   \
+        "movl   %%a3, %1        \n\t"   \
+        "movl   %%a2, %2        \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)              \
+        : "m" (s), "m" (d), "m" (c), "m" (b)        \
+        : "d0", "d1", "d2", "d3", "d4", "a2", "a3"  \
+    );
+
+#define MULADDC_HUIT                                                                               \
+    "movel  %%a2@+,  %%d1       \n\t"                                                              \
+    "mulul  %%d2,    %%d4:%%d1  \n\t"                                                              \
+    "addxl  %%d3,    %%d1       \n\t"                                                              \
+    "addxl  %%d0,    %%d4       \n\t"                                                              \
+    "addl   %%d1,    %%a3@+     \n\t"                                                              \
+    "movel  %%a2@+,  %%d1       \n\t"                                                              \
+    "mulul  %%d2,    %%d3:%%d1  \n\t"                                                              \
+    "addxl  %%d4,    %%d1       \n\t"                                                              \
+    "addxl  %%d0,    %%d3       \n\t"                                                              \
+    "addl   %%d1,    %%a3@+     \n\t"                                                              \
+    "movel  %%a2@+,  %%d1       \n\t"                                                              \
+    "mulul  %%d2,    %%d4:%%d1  \n\t"                                                              \
+    "addxl  %%d3,    %%d1       \n\t"                                                              \
+    "addxl  %%d0,    %%d4       \n\t"                                                              \
+    "addl   %%d1,    %%a3@+     \n\t"                                                              \
+    "movel  %%a2@+,  %%d1       \n\t"                                                              \
+    "mulul  %%d2,    %%d3:%%d1  \n\t"                                                              \
+    "addxl  %%d4,    %%d1       \n\t"                                                              \
+    "addxl  %%d0,    %%d3       \n\t"                                                              \
+    "addl   %%d1,    %%a3@+     \n\t"                                                              \
+    "movel  %%a2@+,  %%d1       \n\t"                                                              \
+    "mulul  %%d2,    %%d4:%%d1  \n\t"                                                              \
+    "addxl  %%d3,    %%d1       \n\t"                                                              \
+    "addxl  %%d0,    %%d4       \n\t"                                                              \
+    "addl   %%d1,    %%a3@+     \n\t"                                                              \
+    "movel  %%a2@+,  %%d1       \n\t"                                                              \
+    "mulul  %%d2,    %%d3:%%d1  \n\t"                                                              \
+    "addxl  %%d4,    %%d1       \n\t"                                                              \
+    "addxl  %%d0,    %%d3       \n\t"                                                              \
+    "addl   %%d1,    %%a3@+     \n\t"                                                              \
+    "movel  %%a2@+,  %%d1       \n\t"                                                              \
+    "mulul  %%d2,    %%d4:%%d1  \n\t"                                                              \
+    "addxl  %%d3,    %%d1       \n\t"                                                              \
+    "addxl  %%d0,    %%d4       \n\t"                                                              \
+    "addl   %%d1,    %%a3@+     \n\t"                                                              \
+    "movel  %%a2@+,  %%d1       \n\t"                                                              \
+    "mulul  %%d2,    %%d3:%%d1  \n\t"                                                              \
+    "addxl  %%d4,    %%d1       \n\t"                                                              \
+    "addxl  %%d0,    %%d3       \n\t"                                                              \
+    "addl   %%d1,    %%a3@+     \n\t"                                                              \
+    "addxl  %%d0,    %%d3       \n\t"
+
+#endif /* MC68000 */
+
+#if defined(__powerpc64__) || defined(__ppc64__)
+
+#if defined(__MACH__) && defined(__APPLE__)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                    \
+        "ld     r3, %3              \n\t"   \
+        "ld     r4, %4              \n\t"   \
+        "ld     r5, %5              \n\t"   \
+        "ld     r6, %6              \n\t"   \
+        "addi   r3, r3, -8          \n\t"   \
+        "addi   r4, r4, -8          \n\t"   \
+        "addic  r5, r5,  0          \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "ldu    r7, 8(r3)           \n\t"                                                              \
+    "mulld  r8, r7, r6          \n\t"                                                              \
+    "mulhdu r9, r7, r6          \n\t"                                                              \
+    "adde   r8, r8, r5          \n\t"                                                              \
+    "ld     r7, 8(r4)           \n\t"                                                              \
+    "addze  r5, r9              \n\t"                                                              \
+    "addc   r8, r8, r7          \n\t"                                                              \
+    "stdu   r8, 8(r4)           \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "addze  r5, r5              \n\t"   \
+        "addi   r4, r4, 8           \n\t"   \
+        "addi   r3, r3, 8           \n\t"   \
+        "std    r5, %0              \n\t"   \
+        "std    r4, %1              \n\t"   \
+        "std    r3, %2              \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)              \
+        : "m" (s), "m" (d), "m" (c), "m" (b)        \
+        : "r3", "r4", "r5", "r6", "r7", "r8", "r9"  \
+    );
+
+#else /* __MACH__ && __APPLE__ */
+
+#define MULADDC_INIT                                                                               \
+    asm(                                    \
+        "ld     %%r3, %3            \n\t"   \
+        "ld     %%r4, %4            \n\t"   \
+        "ld     %%r5, %5            \n\t"   \
+        "ld     %%r6, %6            \n\t"   \
+        "addi   %%r3, %%r3, -8      \n\t"   \
+        "addi   %%r4, %%r4, -8      \n\t"   \
+        "addic  %%r5, %%r5,  0      \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "ldu    %%r7, 8(%%r3)       \n\t"                                                              \
+    "mulld  %%r8, %%r7, %%r6    \n\t"                                                              \
+    "mulhdu %%r9, %%r7, %%r6    \n\t"                                                              \
+    "adde   %%r8, %%r8, %%r5    \n\t"                                                              \
+    "ld     %%r7, 8(%%r4)       \n\t"                                                              \
+    "addze  %%r5, %%r9          \n\t"                                                              \
+    "addc   %%r8, %%r8, %%r7    \n\t"                                                              \
+    "stdu   %%r8, 8(%%r4)       \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "addze  %%r5, %%r5          \n\t"   \
+        "addi   %%r4, %%r4, 8       \n\t"   \
+        "addi   %%r3, %%r3, 8       \n\t"   \
+        "std    %%r5, %0            \n\t"   \
+        "std    %%r4, %1            \n\t"   \
+        "std    %%r3, %2            \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)              \
+        : "m" (s), "m" (d), "m" (c), "m" (b)        \
+        : "r3", "r4", "r5", "r6", "r7", "r8", "r9"  \
+    );
+
+#endif /* __MACH__ && __APPLE__ */
+
+#elif defined(__powerpc__) || defined(__ppc__) /* end PPC64/begin PPC32  */
+
+#if defined(__MACH__) && defined(__APPLE__)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                \
+        "lwz    r3, %3          \n\t"   \
+        "lwz    r4, %4          \n\t"   \
+        "lwz    r5, %5          \n\t"   \
+        "lwz    r6, %6          \n\t"   \
+        "addi   r3, r3, -4      \n\t"   \
+        "addi   r4, r4, -4      \n\t"   \
+        "addic  r5, r5,  0      \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "lwzu   r7, 4(r3)       \n\t"                                                                  \
+    "mullw  r8, r7, r6      \n\t"                                                                  \
+    "mulhwu r9, r7, r6      \n\t"                                                                  \
+    "adde   r8, r8, r5      \n\t"                                                                  \
+    "lwz    r7, 4(r4)       \n\t"                                                                  \
+    "addze  r5, r9          \n\t"                                                                  \
+    "addc   r8, r8, r7      \n\t"                                                                  \
+    "stwu   r8, 4(r4)       \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "addze  r5, r5          \n\t"   \
+        "addi   r4, r4, 4       \n\t"   \
+        "addi   r3, r3, 4       \n\t"   \
+        "stw    r5, %0          \n\t"   \
+        "stw    r4, %1          \n\t"   \
+        "stw    r3, %2          \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)              \
+        : "m" (s), "m" (d), "m" (c), "m" (b)        \
+        : "r3", "r4", "r5", "r6", "r7", "r8", "r9"  \
+    );
+
+#else /* __MACH__ && __APPLE__ */
+
+#define MULADDC_INIT                                                                               \
+    asm(                                    \
+        "lwz    %%r3, %3            \n\t"   \
+        "lwz    %%r4, %4            \n\t"   \
+        "lwz    %%r5, %5            \n\t"   \
+        "lwz    %%r6, %6            \n\t"   \
+        "addi   %%r3, %%r3, -4      \n\t"   \
+        "addi   %%r4, %%r4, -4      \n\t"   \
+        "addic  %%r5, %%r5,  0      \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "lwzu   %%r7, 4(%%r3)       \n\t"                                                              \
+    "mullw  %%r8, %%r7, %%r6    \n\t"                                                              \
+    "mulhwu %%r9, %%r7, %%r6    \n\t"                                                              \
+    "adde   %%r8, %%r8, %%r5    \n\t"                                                              \
+    "lwz    %%r7, 4(%%r4)       \n\t"                                                              \
+    "addze  %%r5, %%r9          \n\t"                                                              \
+    "addc   %%r8, %%r8, %%r7    \n\t"                                                              \
+    "stwu   %%r8, 4(%%r4)       \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "addze  %%r5, %%r5          \n\t"   \
+        "addi   %%r4, %%r4, 4       \n\t"   \
+        "addi   %%r3, %%r3, 4       \n\t"   \
+        "stw    %%r5, %0            \n\t"   \
+        "stw    %%r4, %1            \n\t"   \
+        "stw    %%r3, %2            \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)              \
+        : "m" (s), "m" (d), "m" (c), "m" (b)        \
+        : "r3", "r4", "r5", "r6", "r7", "r8", "r9"  \
+    );
+
+#endif /* __MACH__ && __APPLE__ */
+
+#endif /* PPC32 */
+
+/*
+ * The Sparc(64) assembly is reported to be broken.
+ * Disable it for now, until we're able to fix it.
+ */
+#if 0 && defined(__sparc__)
+#if defined(__sparc64__)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                                \
+                "ldx     %3, %%o0               \n\t"   \
+                "ldx     %4, %%o1               \n\t"   \
+                "ld      %5, %%o2               \n\t"   \
+                "ld      %6, %%o3               \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "ld      [%%o0], %%o4           \n\t"                                                          \
+    "inc     4, %%o0                \n\t"                                                          \
+    "ld      [%%o1], %%o5           \n\t"                                                          \
+    "umul    %%o3, %%o4, %%o4       \n\t"                                                          \
+    "addcc   %%o4, %%o2, %%o4       \n\t"                                                          \
+    "rd      %%y, %%g1              \n\t"                                                          \
+    "addx    %%g1, 0, %%g1          \n\t"                                                          \
+    "addcc   %%o4, %%o5, %%o4       \n\t"                                                          \
+    "st      %%o4, [%%o1]           \n\t"                                                          \
+    "addx    %%g1, 0, %%o2          \n\t"                                                          \
+    "inc     4, %%o1                \n\t"
+
+#define MULADDC_STOP                                                                               \
+                "st      %%o2, %0               \n\t"   \
+                "stx     %%o1, %1               \n\t"   \
+                "stx     %%o0, %2               \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)          \
+        : "m" (s), "m" (d), "m" (c), "m" (b)    \
+        : "g1", "o0", "o1", "o2", "o3", "o4",   \
+          "o5"                                  \
+        );
+
+#else /* __sparc64__ */
+
+#define MULADDC_INIT                                                                               \
+    asm(                                                \
+                "ld      %3, %%o0               \n\t"   \
+                "ld      %4, %%o1               \n\t"   \
+                "ld      %5, %%o2               \n\t"   \
+                "ld      %6, %%o3               \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "ld      [%%o0], %%o4           \n\t"                                                          \
+    "inc     4, %%o0                \n\t"                                                          \
+    "ld      [%%o1], %%o5           \n\t"                                                          \
+    "umul    %%o3, %%o4, %%o4       \n\t"                                                          \
+    "addcc   %%o4, %%o2, %%o4       \n\t"                                                          \
+    "rd      %%y, %%g1              \n\t"                                                          \
+    "addx    %%g1, 0, %%g1          \n\t"                                                          \
+    "addcc   %%o4, %%o5, %%o4       \n\t"                                                          \
+    "st      %%o4, [%%o1]           \n\t"                                                          \
+    "addx    %%g1, 0, %%o2          \n\t"                                                          \
+    "inc     4, %%o1                \n\t"
+
+#define MULADDC_STOP                                                                               \
+                "st      %%o2, %0               \n\t"   \
+                "st      %%o1, %1               \n\t"   \
+                "st      %%o0, %2               \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)          \
+        : "m" (s), "m" (d), "m" (c), "m" (b)    \
+        : "g1", "o0", "o1", "o2", "o3", "o4",   \
+          "o5"                                  \
+        );
+
+#endif /* __sparc64__ */
+#endif /* __sparc__ */
+
+#if defined(__microblaze__) || defined(microblaze)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                \
+        "lwi   r3,   %3         \n\t"   \
+        "lwi   r4,   %4         \n\t"   \
+        "lwi   r5,   %5         \n\t"   \
+        "lwi   r6,   %6         \n\t"   \
+        "andi  r7,   r6, 0xffff \n\t"   \
+        "bsrli r6,   r6, 16     \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "lhui  r8,   r3,   0    \n\t"                                                                  \
+    "addi  r3,   r3,   2    \n\t"                                                                  \
+    "lhui  r9,   r3,   0    \n\t"                                                                  \
+    "addi  r3,   r3,   2    \n\t"                                                                  \
+    "mul   r10,  r9,  r6    \n\t"                                                                  \
+    "mul   r11,  r8,  r7    \n\t"                                                                  \
+    "mul   r12,  r9,  r7    \n\t"                                                                  \
+    "mul   r13,  r8,  r6    \n\t"                                                                  \
+    "bsrli  r8, r10,  16    \n\t"                                                                  \
+    "bsrli  r9, r11,  16    \n\t"                                                                  \
+    "add   r13, r13,  r8    \n\t"                                                                  \
+    "add   r13, r13,  r9    \n\t"                                                                  \
+    "bslli r10, r10,  16    \n\t"                                                                  \
+    "bslli r11, r11,  16    \n\t"                                                                  \
+    "add   r12, r12, r10    \n\t"                                                                  \
+    "addc  r13, r13,  r0    \n\t"                                                                  \
+    "add   r12, r12, r11    \n\t"                                                                  \
+    "addc  r13, r13,  r0    \n\t"                                                                  \
+    "lwi   r10,  r4,   0    \n\t"                                                                  \
+    "add   r12, r12, r10    \n\t"                                                                  \
+    "addc  r13, r13,  r0    \n\t"                                                                  \
+    "add   r12, r12,  r5    \n\t"                                                                  \
+    "addc   r5, r13,  r0    \n\t"                                                                  \
+    "swi   r12,  r4,   0    \n\t"                                                                  \
+    "addi   r4,  r4,   4    \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "swi   r5,   %0         \n\t"   \
+        "swi   r4,   %1         \n\t"   \
+        "swi   r3,   %2         \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)              \
+        : "m" (s), "m" (d), "m" (c), "m" (b)        \
+        : "r3", "r4", "r5", "r6", "r7", "r8",       \
+          "r9", "r10", "r11", "r12", "r13"          \
+    );
+
+#endif /* MicroBlaze */
+
+#if defined(__tricore__)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                        \
+        "ld.a   %%a2, %3                \n\t"   \
+        "ld.a   %%a3, %4                \n\t"   \
+        "ld.w   %%d4, %5                \n\t"   \
+        "ld.w   %%d1, %6                \n\t"   \
+        "xor    %%d5, %%d5              \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "ld.w   %%d0,   [%%a2+]         \n\t"                                                          \
+    "madd.u %%e2, %%e4, %%d0, %%d1  \n\t"                                                          \
+    "ld.w   %%d0,   [%%a3]          \n\t"                                                          \
+    "addx   %%d2,    %%d2,  %%d0    \n\t"                                                          \
+    "addc   %%d3,    %%d3,    0     \n\t"                                                          \
+    "mov    %%d4,    %%d3           \n\t"                                                          \
+    "st.w  [%%a3+],  %%d2           \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "st.w   %0, %%d4                \n\t"   \
+        "st.a   %1, %%a3                \n\t"   \
+        "st.a   %2, %%a2                \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)          \
+        : "m" (s), "m" (d), "m" (c), "m" (b)    \
+        : "d0", "d1", "e2", "d4", "a2", "a3"    \
+    );
+
+#endif /* TriCore */
+
+/*
+ * Note, gcc -O0 by default uses r7 for the frame pointer, so it complains about
+ * our use of r7 below, unless -fomit-frame-pointer is passed.
+ *
+ * On the other hand, -fomit-frame-pointer is implied by any -Ox options with
+ * x !=0, which we can detect using __OPTIMIZE__ (which is also defined by
+ * clang and armcc5 under the same conditions).
+ *
+ * So, only use the optimized assembly below for optimized build, which avoids
+ * the build error and is pretty reasonable anyway.
+ */
+#if defined(__GNUC__) && !defined(__OPTIMIZE__)
+#define MULADDC_CANNOT_USE_R7
+#endif
+
+#if defined(__arm__) && !defined(MULADDC_CANNOT_USE_R7)
+
+#if defined(__thumb__) && !defined(__thumb2__)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                                \
+            "ldr    r0, %3                      \n\t"   \
+            "ldr    r1, %4                      \n\t"   \
+            "ldr    r2, %5                      \n\t"   \
+            "ldr    r3, %6                      \n\t"   \
+            "lsr    r7, r3, #16                 \n\t"   \
+            "mov    r9, r7                      \n\t"   \
+            "lsl    r7, r3, #16                 \n\t"   \
+            "lsr    r7, r7, #16                 \n\t"   \
+            "mov    r8, r7                      \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "ldmia  r0!, {r6}                   \n\t"                                                      \
+    "lsr    r7, r6, #16                 \n\t"                                                      \
+    "lsl    r6, r6, #16                 \n\t"                                                      \
+    "lsr    r6, r6, #16                 \n\t"                                                      \
+    "mov    r4, r8                      \n\t"                                                      \
+    "mul    r4, r6                      \n\t"                                                      \
+    "mov    r3, r9                      \n\t"                                                      \
+    "mul    r6, r3                      \n\t"                                                      \
+    "mov    r5, r9                      \n\t"                                                      \
+    "mul    r5, r7                      \n\t"                                                      \
+    "mov    r3, r8                      \n\t"                                                      \
+    "mul    r7, r3                      \n\t"                                                      \
+    "lsr    r3, r6, #16                 \n\t"                                                      \
+    "add    r5, r5, r3                  \n\t"                                                      \
+    "lsr    r3, r7, #16                 \n\t"                                                      \
+    "add    r5, r5, r3                  \n\t"                                                      \
+    "add    r4, r4, r2                  \n\t"                                                      \
+    "mov    r2, #0                      \n\t"                                                      \
+    "adc    r5, r2                      \n\t"                                                      \
+    "lsl    r3, r6, #16                 \n\t"                                                      \
+    "add    r4, r4, r3                  \n\t"                                                      \
+    "adc    r5, r2                      \n\t"                                                      \
+    "lsl    r3, r7, #16                 \n\t"                                                      \
+    "add    r4, r4, r3                  \n\t"                                                      \
+    "adc    r5, r2                      \n\t"                                                      \
+    "ldr    r3, [r1]                    \n\t"                                                      \
+    "add    r4, r4, r3                  \n\t"                                                      \
+    "adc    r2, r5                      \n\t"                                                      \
+    "stmia  r1!, {r4}                   \n\t"
+
+#define MULADDC_STOP                                                                               \
+            "str    r2, %0                      \n\t"   \
+            "str    r1, %1                      \n\t"   \
+            "str    r0, %2                      \n\t"   \
+         : "=m" (c),  "=m" (d), "=m" (s)        \
+         : "m" (s), "m" (d), "m" (c), "m" (b)   \
+         : "r0", "r1", "r2", "r3", "r4", "r5",  \
+           "r6", "r7", "r8", "r9", "cc"         \
+         );
+
+#elif (__ARM_ARCH >= 6) && defined(__ARM_FEATURE_DSP) && (__ARM_FEATURE_DSP == 1)
+
+#define MULADDC_INIT                                                                               \
+    asm(
+
+#define MULADDC_CORE                                                                               \
+    "ldr    r0, [%0], #4        \n\t"                                                              \
+    "ldr    r1, [%1]            \n\t"                                                              \
+    "umaal  r1, %2, %3, r0      \n\t"                                                              \
+    "str    r1, [%1], #4        \n\t"
+
+#define MULADDC_STOP                                                                               \
+         : "=r" (s),  "=r" (d), "=r" (c)        \
+         : "r" (b), "0" (s), "1" (d), "2" (c)   \
+         : "r0", "r1", "memory"                 \
+         );
+
+#else
+
+#define MULADDC_INIT                                                                               \
+    asm(                                                \
+            "ldr    r0, %3                      \n\t"   \
+            "ldr    r1, %4                      \n\t"   \
+            "ldr    r2, %5                      \n\t"   \
+            "ldr    r3, %6                      \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "ldr    r4, [r0], #4                \n\t"                                                      \
+    "mov    r5, #0                      \n\t"                                                      \
+    "ldr    r6, [r1]                    \n\t"                                                      \
+    "umlal  r2, r5, r3, r4              \n\t"                                                      \
+    "adds   r7, r6, r2                  \n\t"                                                      \
+    "adc    r2, r5, #0                  \n\t"                                                      \
+    "str    r7, [r1], #4                \n\t"
+
+#define MULADDC_STOP                                                                               \
+            "str    r2, %0                      \n\t"   \
+            "str    r1, %1                      \n\t"   \
+            "str    r0, %2                      \n\t"   \
+         : "=m" (c),  "=m" (d), "=m" (s)        \
+         : "m" (s), "m" (d), "m" (c), "m" (b)   \
+         : "r0", "r1", "r2", "r3", "r4", "r5",  \
+           "r6", "r7", "cc"                     \
+         );
+
+#endif /* Thumb */
+
+#endif /* ARMv3 */
+
+#if defined(__alpha__)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                \
+        "ldq    $1, %3          \n\t"   \
+        "ldq    $2, %4          \n\t"   \
+        "ldq    $3, %5          \n\t"   \
+        "ldq    $4, %6          \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "ldq    $6,  0($1)      \n\t"                                                                  \
+    "addq   $1,  8, $1      \n\t"                                                                  \
+    "mulq   $6, $4, $7      \n\t"                                                                  \
+    "umulh  $6, $4, $6      \n\t"                                                                  \
+    "addq   $7, $3, $7      \n\t"                                                                  \
+    "cmpult $7, $3, $3      \n\t"                                                                  \
+    "ldq    $5,  0($2)      \n\t"                                                                  \
+    "addq   $7, $5, $7      \n\t"                                                                  \
+    "cmpult $7, $5, $5      \n\t"                                                                  \
+    "stq    $7,  0($2)      \n\t"                                                                  \
+    "addq   $2,  8, $2      \n\t"                                                                  \
+    "addq   $6, $3, $3      \n\t"                                                                  \
+    "addq   $5, $3, $3      \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "stq    $3, %0          \n\t"   \
+        "stq    $2, %1          \n\t"   \
+        "stq    $1, %2          \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)              \
+        : "m" (s), "m" (d), "m" (c), "m" (b)        \
+        : "$1", "$2", "$3", "$4", "$5", "$6", "$7"  \
+    );
+#endif /* Alpha */
+
+#if defined(__mips__) && !defined(__mips64)
+
+#define MULADDC_INIT                                                                               \
+    asm(                                \
+        "lw     $10, %3         \n\t"   \
+        "lw     $11, %4         \n\t"   \
+        "lw     $12, %5         \n\t"   \
+        "lw     $13, %6         \n\t"
+
+#define MULADDC_CORE                                                                               \
+    "lw     $14, 0($10)     \n\t"                                                                  \
+    "multu  $13, $14        \n\t"                                                                  \
+    "addi   $10, $10, 4     \n\t"                                                                  \
+    "mflo   $14             \n\t"                                                                  \
+    "mfhi   $9              \n\t"                                                                  \
+    "addu   $14, $12, $14   \n\t"                                                                  \
+    "lw     $15, 0($11)     \n\t"                                                                  \
+    "sltu   $12, $14, $12   \n\t"                                                                  \
+    "addu   $15, $14, $15   \n\t"                                                                  \
+    "sltu   $14, $15, $14   \n\t"                                                                  \
+    "addu   $12, $12, $9    \n\t"                                                                  \
+    "sw     $15, 0($11)     \n\t"                                                                  \
+    "addu   $12, $12, $14   \n\t"                                                                  \
+    "addi   $11, $11, 4     \n\t"
+
+#define MULADDC_STOP                                                                               \
+        "sw     $12, %0         \n\t"   \
+        "sw     $11, %1         \n\t"   \
+        "sw     $10, %2         \n\t"   \
+        : "=m" (c), "=m" (d), "=m" (s)                      \
+        : "m" (s), "m" (d), "m" (c), "m" (b)                \
+        : "$9", "$10", "$11", "$12", "$13", "$14", "$15", "lo", "hi" \
+    );
+
+#endif /* MIPS */
+#endif /* GNUC */
+
+#if (defined(_MSC_VER) && defined(_M_IX86)) || defined(__WATCOMC__)
+
+#define MULADDC_INIT __asm mov esi, s __asm mov edi, d __asm mov ecx, c __asm mov ebx, b
+
+#define MULADDC_CORE                                                                               \
+    __asm lodsd __asm mul ebx __asm add eax, ecx __asm adc edx,                                    \
+        0 __asm add eax, [edi] __asm adc edx, 0 __asm mov ecx, edx __asm stosd
+
+#if defined(MBEDTLS_HAVE_SSE2)
+
+#define EMIT __asm _emit
+
+#define MULADDC_HUIT                                                                               \
+    EMIT 0x0F EMIT 0x6E EMIT 0xC9 EMIT 0x0F EMIT 0x6E EMIT 0xC3 EMIT 0x0F EMIT 0x6E EMIT 0x1F EMIT 0x0F EMIT 0xD4 EMIT 0xCB EMIT 0x0F EMIT 0x6E EMIT 0x16 EMIT 0x0F EMIT 0xF4 EMIT 0xD0 EMIT 0x0F EMIT 0x6E EMIT 0x66 EMIT 0x04 EMIT 0x0F EMIT 0xF4 EMIT 0xE0 EMIT 0x0F EMIT 0x6E EMIT 0x76 EMIT 0x08 EMIT 0x0F EMIT 0xF4 EMIT 0xF0 EMIT 0x0F EMIT 0x6E EMIT 0x7E EMIT 0x0C EMIT 0x0F EMIT 0xF4 EMIT 0xF8 EMIT 0x0F EMIT 0xD4 EMIT 0xCA EMIT 0x0F EMIT 0x6E EMIT 0x5F EMIT 0x04 EMIT 0x0F EMIT 0xD4 EMIT 0xDC EMIT 0x0F EMIT 0x6E EMIT 0x6F EMIT 0x08 EMIT 0x0F EMIT 0xD4 EMIT 0xEE EMIT 0x0F EMIT 0x6E EMIT 0x67 EMIT 0x0C EMIT 0x0F EMIT 0xD4 EMIT 0xFC EMIT 0x0F EMIT 0x7E EMIT 0x0F EMIT 0x0F EMIT 0x6E EMIT 0x56 EMIT 0x10 EMIT 0x0F EMIT 0xF4 EMIT 0xD0 EMIT 0x0F EMIT 0x73 EMIT 0xD1 EMIT 0x20 EMIT 0x0F EMIT 0x6E EMIT 0x66 EMIT 0x14 EMIT 0x0F EMIT 0xF4 EMIT 0xE0 EMIT 0x0F EMIT 0xD4 EMIT 0xCB EMIT 0x0F EMIT 0x6E EMIT 0x76 EMIT 0x18 EMIT 0x0F EMIT 0xF4 EMIT 0xF0 EMIT 0x0F EMIT 0x7E EMIT 0x4F EMIT 0x04 EMIT 0x0F EMIT 0x73 EMIT 0xD1 EMIT 0x20 EMIT 0x0F EMIT 0x6E EMIT 0x5E EMIT 0x1C EMIT 0x0F EMIT 0xF4 EMIT 0xD8 EMIT 0x0F EMIT 0xD4 EMIT 0xCD EMIT 0x0F EMIT 0x6E EMIT 0x6F EMIT 0x10 EMIT 0x0F EMIT 0xD4 EMIT 0xD5 EMIT 0x0F EMIT 0x7E EMIT 0x4F EMIT 0x08 EMIT 0x0F EMIT 0x73 EMIT 0xD1 EMIT 0x20 EMIT 0x0F EMIT 0xD4 EMIT 0xCF EMIT 0x0F EMIT 0x6E EMIT 0x6F EMIT 0x14 EMIT 0x0F EMIT 0xD4 EMIT 0xE5 EMIT 0x0F EMIT 0x7E EMIT 0x4F EMIT 0x0C EMIT 0x0F EMIT 0x73 EMIT 0xD1 EMIT 0x20 EMIT 0x0F EMIT 0xD4 EMIT 0xCA EMIT 0x0F EMIT 0x6E EMIT 0x6F EMIT 0x18 EMIT 0x0F EMIT 0xD4 EMIT 0xF5 EMIT 0x0F EMIT 0x7E EMIT 0x4F EMIT 0x10 EMIT 0x0F EMIT 0x73 EMIT 0xD1 EMIT 0x20 EMIT 0x0F EMIT 0xD4 EMIT 0xCC EMIT 0x0F EMIT 0x6E EMIT 0x6F EMIT 0x1C EMIT 0x0F EMIT 0xD4 EMIT 0xDD EMIT 0x0F EMIT 0x7E EMIT 0x4F EMIT 0x14 EMIT 0x0F EMIT 0x73 EMIT 0xD1 EMIT 0x20 EMIT 0x0F EMIT 0xD4 EMIT 0xCE EMIT 0x0F EMIT 0x7E EMIT 0x4F EMIT 0x18 EMIT 0x0F EMIT 0x73 EMIT 0xD1 EMIT 0x20 EMIT 0x0F EMIT 0xD4 EMIT 0xCB EMIT 0x0F EMIT 0x7E EMIT 0x4F EMIT 0x1C EMIT 0x83 EMIT 0xC7 EMIT 0x20 EMIT 0x83 EMIT 0xC6 EMIT 0x20 EMIT 0x0F EMIT 0x73 EMIT 0xD1 EMIT 0x20 EMIT 0x0F EMIT 0x7E EMIT 0xC9
+
+#define MULADDC_STOP EMIT 0x0F EMIT 0x77 __asm mov c, ecx __asm mov d, edi __asm mov s, esi
+
+#else
+
+#define MULADDC_STOP __asm mov c, ecx __asm mov d, edi __asm mov s, esi
+
+#endif /* SSE2 */
+#endif /* MSVC */
+
+#endif /* MBEDTLS_HAVE_ASM */
+
+#if !defined(MULADDC_CORE)
+#if defined(MBEDTLS_HAVE_UDBL)
+
+#define MULADDC_INIT                                                                               \
+    {                                                                                              \
+        mbedtls_t_udbl r;                                                                          \
+        mbedtls_mpi_uint r0, r1;
+
+#define MULADDC_CORE                                                                               \
+    r = *(s++) * (mbedtls_t_udbl)b;                                                                \
+    r0 = (mbedtls_mpi_uint)r;                                                                      \
+    r1 = (mbedtls_mpi_uint)(r >> biL);                                                             \
+    r0 += c;                                                                                       \
+    r1 += (r0 < c);                                                                                \
+    r0 += *d;                                                                                      \
+    r1 += (r0 < *d);                                                                               \
+    c = r1;                                                                                        \
+    *(d++) = r0;
+
+#define MULADDC_STOP }
+
+#else
+#define MULADDC_INIT                                                                               \
+    {                                                                                              \
+        mbedtls_mpi_uint s0, s1, b0, b1;                                                           \
+        mbedtls_mpi_uint r0, r1, rx, ry;                                                           \
+        b0 = (b << biH) >> biH;                                                                    \
+        b1 = (b >> biH);
+
+#define MULADDC_CORE                                                                               \
+    s0 = (*s << biH) >> biH;                                                                       \
+    s1 = (*s >> biH);                                                                              \
+    s++;                                                                                           \
+    rx = s0 * b1;                                                                                  \
+    r0 = s0 * b0;                                                                                  \
+    ry = s1 * b0;                                                                                  \
+    r1 = s1 * b1;                                                                                  \
+    r1 += (rx >> biH);                                                                             \
+    r1 += (ry >> biH);                                                                             \
+    rx <<= biH;                                                                                    \
+    ry <<= biH;                                                                                    \
+    r0 += rx;                                                                                      \
+    r1 += (r0 < rx);                                                                               \
+    r0 += ry;                                                                                      \
+    r1 += (r0 < ry);                                                                               \
+    r0 += c;                                                                                       \
+    r1 += (r0 < c);                                                                                \
+    r0 += *d;                                                                                      \
+    r1 += (r0 < *d);                                                                               \
+    c = r1;                                                                                        \
+    *(d++) = r0;
+
+#define MULADDC_STOP }
+
+#endif /* C (generic)  */
+#endif /* C (longlong) */
+
+#endif /* bn_mul.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/camellia.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/camellia.cpp
new file mode 100644
index 0000000000..3827792d93
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/camellia.cpp
@@ -0,0 +1,924 @@
+/*
+ *  Camellia implementation
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+/*
+ *  The Camellia block cipher was designed by NTT and Mitsubishi Electric
+ *  Corporation.
+ *
+ *  http://info.isl.ntt.co.jp/crypt/eng/camellia/dl/01espec.pdf
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_CAMELLIA_C)
+
+#include <string.h>
+
+#include "mbedtls/camellia.h"
+#include "mbedtls/platform_util.h"
+
+#if defined(MBEDTLS_SELF_TEST)
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdio.h>
+#define mbedtls_printf printf
+#endif /* MBEDTLS_PLATFORM_C */
+#endif /* MBEDTLS_SELF_TEST */
+
+#if !defined(MBEDTLS_CAMELLIA_ALT)
+
+/* Parameter validation macros */
+#define CAMELLIA_VALIDATE_RET(cond)                                                                \
+    MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_CAMELLIA_BAD_INPUT_DATA)
+#define CAMELLIA_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+static const unsigned char SIGMA_CHARS[6][8] = {{0xa0, 0x9e, 0x66, 0x7f, 0x3b, 0xcc, 0x90, 0x8b},
+    {0xb6, 0x7a, 0xe8, 0x58, 0x4c, 0xaa, 0x73, 0xb2},
+    {0xc6, 0xef, 0x37, 0x2f, 0xe9, 0x4f, 0x82, 0xbe},
+    {0x54, 0xff, 0x53, 0xa5, 0xf1, 0xd3, 0x6f, 0x1c},
+    {0x10, 0xe5, 0x27, 0xfa, 0xde, 0x68, 0x2d, 0x1d},
+    {0xb0, 0x56, 0x88, 0xc2, 0xb3, 0xe6, 0xc1, 0xfd}};
+
+#if defined(MBEDTLS_CAMELLIA_SMALL_MEMORY)
+
+static const unsigned char FSb[256] = {112, 130, 44, 236, 179, 39, 192, 229, 228, 133, 87, 53, 234,
+    12, 174, 65, 35, 239, 107, 147, 69, 25, 165, 33, 237, 14, 79, 78, 29, 101, 146, 189, 134, 184,
+    175, 143, 124, 235, 31, 206, 62, 48, 220, 95, 94, 197, 11, 26, 166, 225, 57, 202, 213, 71, 93,
+    61, 217, 1, 90, 214, 81, 86, 108, 77, 139, 13, 154, 102, 251, 204, 176, 45, 116, 18, 43, 32,
+    240, 177, 132, 153, 223, 76, 203, 194, 52, 126, 118, 5, 109, 183, 169, 49, 209, 23, 4, 215, 20,
+    88, 58, 97, 222, 27, 17, 28, 50, 15, 156, 22, 83, 24, 242, 34, 254, 68, 207, 178, 195, 181, 122,
+    145, 36, 8, 232, 168, 96, 252, 105, 80, 170, 208, 160, 125, 161, 137, 98, 151, 84, 91, 30, 149,
+    224, 255, 100, 210, 16, 196, 0, 72, 163, 247, 117, 219, 138, 3, 230, 218, 9, 63, 221, 148, 135,
+    92, 131, 2, 205, 74, 144, 51, 115, 103, 246, 243, 157, 127, 191, 226, 82, 155, 216, 38, 200, 55,
+    198, 59, 129, 150, 111, 75, 19, 190, 99, 46, 233, 121, 167, 140, 159, 110, 188, 142, 41, 245,
+    249, 182, 47, 253, 180, 89, 120, 152, 6, 106, 231, 70, 113, 186, 212, 37, 171, 66, 136, 162,
+    141, 250, 114, 7, 185, 85, 248, 238, 172, 10, 54, 73, 42, 104, 60, 56, 241, 164, 64, 40, 211,
+    123, 187, 201, 67, 193, 21, 227, 173, 244, 119, 199, 128, 158};
+
+#define SBOX1(n) FSb[(n)]
+#define SBOX2(n) (unsigned char)((FSb[(n)] >> 7 ^ FSb[(n)] << 1) & 0xff)
+#define SBOX3(n) (unsigned char)((FSb[(n)] >> 1 ^ FSb[(n)] << 7) & 0xff)
+#define SBOX4(n) FSb[((n) << 1 ^ (n) >> 7) & 0xff]
+
+#else /* MBEDTLS_CAMELLIA_SMALL_MEMORY */
+
+static const unsigned char FSb[256] = {112, 130, 44, 236, 179, 39, 192, 229, 228, 133, 87, 53, 234,
+    12, 174, 65, 35, 239, 107, 147, 69, 25, 165, 33, 237, 14, 79, 78, 29, 101, 146, 189, 134, 184,
+    175, 143, 124, 235, 31, 206, 62, 48, 220, 95, 94, 197, 11, 26, 166, 225, 57, 202, 213, 71, 93,
+    61, 217, 1, 90, 214, 81, 86, 108, 77, 139, 13, 154, 102, 251, 204, 176, 45, 116, 18, 43, 32,
+    240, 177, 132, 153, 223, 76, 203, 194, 52, 126, 118, 5, 109, 183, 169, 49, 209, 23, 4, 215, 20,
+    88, 58, 97, 222, 27, 17, 28, 50, 15, 156, 22, 83, 24, 242, 34, 254, 68, 207, 178, 195, 181, 122,
+    145, 36, 8, 232, 168, 96, 252, 105, 80, 170, 208, 160, 125, 161, 137, 98, 151, 84, 91, 30, 149,
+    224, 255, 100, 210, 16, 196, 0, 72, 163, 247, 117, 219, 138, 3, 230, 218, 9, 63, 221, 148, 135,
+    92, 131, 2, 205, 74, 144, 51, 115, 103, 246, 243, 157, 127, 191, 226, 82, 155, 216, 38, 200, 55,
+    198, 59, 129, 150, 111, 75, 19, 190, 99, 46, 233, 121, 167, 140, 159, 110, 188, 142, 41, 245,
+    249, 182, 47, 253, 180, 89, 120, 152, 6, 106, 231, 70, 113, 186, 212, 37, 171, 66, 136, 162,
+    141, 250, 114, 7, 185, 85, 248, 238, 172, 10, 54, 73, 42, 104, 60, 56, 241, 164, 64, 40, 211,
+    123, 187, 201, 67, 193, 21, 227, 173, 244, 119, 199, 128, 158};
+
+static const unsigned char FSb2[256] = {224, 5, 88, 217, 103, 78, 129, 203, 201, 11, 174, 106, 213,
+    24, 93, 130, 70, 223, 214, 39, 138, 50, 75, 66, 219, 28, 158, 156, 58, 202, 37, 123, 13, 113,
+    95, 31, 248, 215, 62, 157, 124, 96, 185, 190, 188, 139, 22, 52, 77, 195, 114, 149, 171, 142,
+    186, 122, 179, 2, 180, 173, 162, 172, 216, 154, 23, 26, 53, 204, 247, 153, 97, 90, 232, 36, 86,
+    64, 225, 99, 9, 51, 191, 152, 151, 133, 104, 252, 236, 10, 218, 111, 83, 98, 163, 46, 8, 175,
+    40, 176, 116, 194, 189, 54, 34, 56, 100, 30, 57, 44, 166, 48, 229, 68, 253, 136, 159, 101, 135,
+    107, 244, 35, 72, 16, 209, 81, 192, 249, 210, 160, 85, 161, 65, 250, 67, 19, 196, 47, 168, 182,
+    60, 43, 193, 255, 200, 165, 32, 137, 0, 144, 71, 239, 234, 183, 21, 6, 205, 181, 18, 126, 187,
+    41, 15, 184, 7, 4, 155, 148, 33, 102, 230, 206, 237, 231, 59, 254, 127, 197, 164, 55, 177, 76,
+    145, 110, 141, 118, 3, 45, 222, 150, 38, 125, 198, 92, 211, 242, 79, 25, 63, 220, 121, 29, 82,
+    235, 243, 109, 94, 251, 105, 178, 240, 49, 12, 212, 207, 140, 226, 117, 169, 74, 87, 132, 17,
+    69, 27, 245, 228, 14, 115, 170, 241, 221, 89, 20, 108, 146, 84, 208, 120, 112, 227, 73, 128, 80,
+    167, 246, 119, 147, 134, 131, 42, 199, 91, 233, 238, 143, 1, 61};
+
+static const unsigned char FSb3[256] = {56, 65, 22, 118, 217, 147, 96, 242, 114, 194, 171, 154, 117,
+    6, 87, 160, 145, 247, 181, 201, 162, 140, 210, 144, 246, 7, 167, 39, 142, 178, 73, 222, 67, 92,
+    215, 199, 62, 245, 143, 103, 31, 24, 110, 175, 47, 226, 133, 13, 83, 240, 156, 101, 234, 163,
+    174, 158, 236, 128, 45, 107, 168, 43, 54, 166, 197, 134, 77, 51, 253, 102, 88, 150, 58, 9, 149,
+    16, 120, 216, 66, 204, 239, 38, 229, 97, 26, 63, 59, 130, 182, 219, 212, 152, 232, 139, 2, 235,
+    10, 44, 29, 176, 111, 141, 136, 14, 25, 135, 78, 11, 169, 12, 121, 17, 127, 34, 231, 89, 225,
+    218, 61, 200, 18, 4, 116, 84, 48, 126, 180, 40, 85, 104, 80, 190, 208, 196, 49, 203, 42, 173,
+    15, 202, 112, 255, 50, 105, 8, 98, 0, 36, 209, 251, 186, 237, 69, 129, 115, 109, 132, 159, 238,
+    74, 195, 46, 193, 1, 230, 37, 72, 153, 185, 179, 123, 249, 206, 191, 223, 113, 41, 205, 108, 19,
+    100, 155, 99, 157, 192, 75, 183, 165, 137, 95, 177, 23, 244, 188, 211, 70, 207, 55, 94, 71, 148,
+    250, 252, 91, 151, 254, 90, 172, 60, 76, 3, 53, 243, 35, 184, 93, 106, 146, 213, 33, 68, 81,
+    198, 125, 57, 131, 220, 170, 124, 119, 86, 5, 27, 164, 21, 52, 30, 28, 248, 82, 32, 20, 233,
+    189, 221, 228, 161, 224, 138, 241, 214, 122, 187, 227, 64, 79};
+
+static const unsigned char FSb4[256] = {112, 44, 179, 192, 228, 87, 234, 174, 35, 107, 69, 165, 237,
+    79, 29, 146, 134, 175, 124, 31, 62, 220, 94, 11, 166, 57, 213, 93, 217, 90, 81, 108, 139, 154,
+    251, 176, 116, 43, 240, 132, 223, 203, 52, 118, 109, 169, 209, 4, 20, 58, 222, 17, 50, 156, 83,
+    242, 254, 207, 195, 122, 36, 232, 96, 105, 170, 160, 161, 98, 84, 30, 224, 100, 16, 0, 163, 117,
+    138, 230, 9, 221, 135, 131, 205, 144, 115, 246, 157, 191, 82, 216, 200, 198, 129, 111, 19, 99,
+    233, 167, 159, 188, 41, 249, 47, 180, 120, 6, 231, 113, 212, 171, 136, 141, 114, 185, 248, 172,
+    54, 42, 60, 241, 64, 211, 187, 67, 21, 173, 119, 128, 130, 236, 39, 229, 133, 53, 12, 65, 239,
+    147, 25, 33, 14, 78, 101, 189, 184, 143, 235, 206, 48, 95, 197, 26, 225, 202, 71, 61, 1, 214,
+    86, 77, 13, 102, 204, 45, 18, 32, 177, 153, 76, 194, 126, 5, 183, 49, 23, 215, 88, 97, 27, 28,
+    15, 22, 24, 34, 68, 178, 181, 145, 8, 168, 252, 80, 208, 125, 137, 151, 91, 149, 255, 210, 196,
+    72, 247, 219, 3, 218, 63, 148, 92, 2, 74, 51, 103, 243, 127, 226, 155, 38, 55, 59, 150, 75, 190,
+    46, 121, 140, 110, 142, 245, 182, 253, 89, 152, 106, 70, 186, 37, 66, 162, 250, 7, 85, 238, 10,
+    73, 104, 56, 164, 40, 123, 201, 193, 227, 244, 199, 158};
+
+#define SBOX1(n) FSb[(n)]
+#define SBOX2(n) FSb2[(n)]
+#define SBOX3(n) FSb3[(n)]
+#define SBOX4(n) FSb4[(n)]
+
+#endif /* MBEDTLS_CAMELLIA_SMALL_MEMORY */
+
+static const unsigned char shifts[2][4][4] = {{
+                                                  {1, 1, 1, 1}, /* KL */
+                                                  {0, 0, 0, 0}, /* KR */
+                                                  {1, 1, 1, 1}, /* KA */
+                                                  {0, 0, 0, 0}  /* KB */
+                                              },
+    {
+        {1, 0, 1, 1}, /* KL */
+        {1, 1, 0, 1}, /* KR */
+        {1, 1, 1, 0}, /* KA */
+        {1, 1, 0, 1}  /* KB */
+    }};
+
+static const signed char indexes[2][4][20] = {
+    {
+        {0, 1, 2, 3, 8, 9, 10, 11, 38, 39, 36, 37, 23, 20, 21, 22, 27, -1, -1, 26}, /* KL -> RK */
+        {-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+            -1},                                                                      /* KR -> RK */
+        {4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 18, 19, -1, 24, 25, -1, 31, 28, 29, 30}, /* KA -> RK */
+        {-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+            -1} /* KB -> RK */
+    },
+    {
+        {0, 1, 2, 3, 61, 62, 63, 60, -1, -1, -1, -1, 27, 24, 25, 26, 35, 32, 33, 34}, /* KL -> RK */
+        {-1, -1, -1, -1, 8, 9, 10, 11, 16, 17, 18, 19, -1, -1, -1, -1, 39, 36, 37,
+            38}, /* KR -> RK */
+        {-1, -1, -1, -1, 12, 13, 14, 15, 58, 59, 56, 57, 31, 28, 29, 30, -1, -1, -1,
+            -1},                                                                     /* KA -> RK */
+        {4, 5, 6, 7, 65, 66, 67, 64, 20, 21, 22, 23, -1, -1, -1, -1, 43, 40, 41, 42} /* KB -> RK */
+    }};
+
+static const signed char transposes[2][20] = {
+    {21, 22, 23, 20, -1, -1, -1, -1, 18, 19, 16, 17, 11, 8, 9, 10, 15, 12, 13, 14},
+    {25, 26, 27, 24, 29, 30, 31, 28, 18, 19, 16, 17, -1, -1, -1, -1, -1, -1, -1, -1}};
+
+/* Shift macro for 128 bit strings with rotation smaller than 32 bits (!) */
+#define ROTL(DEST, SRC, SHIFT)                                                                     \
+    {                                                                                              \
+        (DEST)[0] = (SRC)[0] << (SHIFT) ^ (SRC)[1] >> (32 - (SHIFT));                              \
+        (DEST)[1] = (SRC)[1] << (SHIFT) ^ (SRC)[2] >> (32 - (SHIFT));                              \
+        (DEST)[2] = (SRC)[2] << (SHIFT) ^ (SRC)[3] >> (32 - (SHIFT));                              \
+        (DEST)[3] = (SRC)[3] << (SHIFT) ^ (SRC)[0] >> (32 - (SHIFT));                              \
+    }
+
+#define FL(XL, XR, KL, KR)                                                                         \
+    {                                                                                              \
+        (XR) = ((((XL) & (KL)) << 1) | (((XL) & (KL)) >> 31)) ^ (XR);                              \
+        (XL) = ((XR) | (KR)) ^ (XL);                                                               \
+    }
+
+#define FLInv(YL, YR, KL, KR)                                                                      \
+    {                                                                                              \
+        (YL) = ((YR) | (KR)) ^ (YL);                                                               \
+        (YR) = ((((YL) & (KL)) << 1) | (((YL) & (KL)) >> 31)) ^ (YR);                              \
+    }
+
+#define SHIFT_AND_PLACE(INDEX, OFFSET)                                                             \
+    {                                                                                              \
+        TK[0] = KC[(OFFSET) * 4 + 0];                                                              \
+        TK[1] = KC[(OFFSET) * 4 + 1];                                                              \
+        TK[2] = KC[(OFFSET) * 4 + 2];                                                              \
+        TK[3] = KC[(OFFSET) * 4 + 3];                                                              \
+                                                                                                   \
+        for (i = 1; i <= 4; i++)                                                                   \
+            if (shifts[(INDEX)][(OFFSET)][i - 1])                                                  \
+                ROTL(TK + i * 4, TK, (15 * i) % 32);                                               \
+                                                                                                   \
+        for (i = 0; i < 20; i++)                                                                   \
+            if (indexes[(INDEX)][(OFFSET)][i] != -1) {                                             \
+                RK[indexes[(INDEX)][(OFFSET)][i]] = TK[i];                                         \
+            }                                                                                      \
+    }
+
+static void camellia_feistel(const uint32_t x[2], const uint32_t k[2], uint32_t z[2]) {
+    uint32_t I0, I1;
+    I0 = x[0] ^ k[0];
+    I1 = x[1] ^ k[1];
+
+    I0 = ((uint32_t)SBOX1(MBEDTLS_BYTE_3(I0)) << 24) | ((uint32_t)SBOX2(MBEDTLS_BYTE_2(I0)) << 16) |
+         ((uint32_t)SBOX3(MBEDTLS_BYTE_1(I0)) << 8) | ((uint32_t)SBOX4(MBEDTLS_BYTE_0(I0)));
+    I1 = ((uint32_t)SBOX2(MBEDTLS_BYTE_3(I1)) << 24) | ((uint32_t)SBOX3(MBEDTLS_BYTE_2(I1)) << 16) |
+         ((uint32_t)SBOX4(MBEDTLS_BYTE_1(I1)) << 8) | ((uint32_t)SBOX1(MBEDTLS_BYTE_0(I1)));
+
+    I0 ^= (I1 << 8) | (I1 >> 24);
+    I1 ^= (I0 << 16) | (I0 >> 16);
+    I0 ^= (I1 >> 8) | (I1 << 24);
+    I1 ^= (I0 >> 8) | (I0 << 24);
+
+    z[0] ^= I1;
+    z[1] ^= I0;
+}
+
+void mbedtls_camellia_init(mbedtls_camellia_context* ctx) {
+    CAMELLIA_VALIDATE(ctx != NULL);
+    memset(ctx, 0, sizeof(mbedtls_camellia_context));
+}
+
+void mbedtls_camellia_free(mbedtls_camellia_context* ctx) {
+    if (ctx == NULL)
+        return;
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_camellia_context));
+}
+
+/*
+ * Camellia key schedule (encryption)
+ */
+int mbedtls_camellia_setkey_enc(mbedtls_camellia_context* ctx, const unsigned char* key,
+    unsigned int keybits) {
+    int idx;
+    size_t i;
+    uint32_t* RK;
+    unsigned char t[64];
+    uint32_t SIGMA[6][2];
+    uint32_t KC[16];
+    uint32_t TK[20];
+
+    CAMELLIA_VALIDATE_RET(ctx != NULL);
+    CAMELLIA_VALIDATE_RET(key != NULL);
+
+    RK = ctx->rk;
+
+    memset(t, 0, 64);
+    memset(RK, 0, sizeof(ctx->rk));
+
+    switch (keybits) {
+    case 128:
+        ctx->nr = 3;
+        idx = 0;
+        break;
+    case 192:
+    case 256:
+        ctx->nr = 4;
+        idx = 1;
+        break;
+    default:
+        return (MBEDTLS_ERR_CAMELLIA_BAD_INPUT_DATA);
+    }
+
+    for (i = 0; i < keybits / 8; ++i)
+        t[i] = key[i];
+
+    if (keybits == 192) {
+        for (i = 0; i < 8; i++)
+            t[24 + i] = ~t[16 + i];
+    }
+
+    /*
+     * Prepare SIGMA values
+     */
+    for (i = 0; i < 6; i++) {
+        SIGMA[i][0] = MBEDTLS_GET_UINT32_BE(SIGMA_CHARS[i], 0);
+        SIGMA[i][1] = MBEDTLS_GET_UINT32_BE(SIGMA_CHARS[i], 4);
+    }
+
+    /*
+     * Key storage in KC
+     * Order: KL, KR, KA, KB
+     */
+    memset(KC, 0, sizeof(KC));
+
+    /* Store KL, KR */
+    for (i = 0; i < 8; i++)
+        KC[i] = MBEDTLS_GET_UINT32_BE(t, i * 4);
+
+    /* Generate KA */
+    for (i = 0; i < 4; ++i)
+        KC[8 + i] = KC[i] ^ KC[4 + i];
+
+    camellia_feistel(KC + 8, SIGMA[0], KC + 10);
+    camellia_feistel(KC + 10, SIGMA[1], KC + 8);
+
+    for (i = 0; i < 4; ++i)
+        KC[8 + i] ^= KC[i];
+
+    camellia_feistel(KC + 8, SIGMA[2], KC + 10);
+    camellia_feistel(KC + 10, SIGMA[3], KC + 8);
+
+    if (keybits > 128) {
+        /* Generate KB */
+        for (i = 0; i < 4; ++i)
+            KC[12 + i] = KC[4 + i] ^ KC[8 + i];
+
+        camellia_feistel(KC + 12, SIGMA[4], KC + 14);
+        camellia_feistel(KC + 14, SIGMA[5], KC + 12);
+    }
+
+    /*
+     * Generating subkeys
+     */
+
+    /* Manipulating KL */
+    SHIFT_AND_PLACE(idx, 0);
+
+    /* Manipulating KR */
+    if (keybits > 128) {
+        SHIFT_AND_PLACE(idx, 1);
+    }
+
+    /* Manipulating KA */
+    SHIFT_AND_PLACE(idx, 2);
+
+    /* Manipulating KB */
+    if (keybits > 128) {
+        SHIFT_AND_PLACE(idx, 3);
+    }
+
+    /* Do transpositions */
+    for (i = 0; i < 20; i++) {
+        if (transposes[idx][i] != -1) {
+            RK[32 + 12 * idx + i] = RK[transposes[idx][i]];
+        }
+    }
+
+    return (0);
+}
+
+/*
+ * Camellia key schedule (decryption)
+ */
+int mbedtls_camellia_setkey_dec(mbedtls_camellia_context* ctx, const unsigned char* key,
+    unsigned int keybits) {
+    int idx, ret;
+    size_t i;
+    mbedtls_camellia_context cty;
+    uint32_t* RK;
+    uint32_t* SK;
+    CAMELLIA_VALIDATE_RET(ctx != NULL);
+    CAMELLIA_VALIDATE_RET(key != NULL);
+
+    mbedtls_camellia_init(&cty);
+
+    /* Also checks keybits */
+    if ((ret = mbedtls_camellia_setkey_enc(&cty, key, keybits)) != 0)
+        goto exit;
+
+    ctx->nr = cty.nr;
+    idx = (ctx->nr == 4);
+
+    RK = ctx->rk;
+    SK = cty.rk + 24 * 2 + 8 * idx * 2;
+
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+
+    for (i = 22 + 8 * idx, SK -= 6; i > 0; i--, SK -= 4) {
+        *RK++ = *SK++;
+        *RK++ = *SK++;
+    }
+
+    SK -= 2;
+
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+    *RK++ = *SK++;
+
+exit:
+    mbedtls_camellia_free(&cty);
+
+    return (ret);
+}
+
+/*
+ * Camellia-ECB block encryption/decryption
+ */
+int mbedtls_camellia_crypt_ecb(mbedtls_camellia_context* ctx, int mode,
+    const unsigned char input[16], unsigned char output[16]) {
+    int NR;
+    uint32_t *RK, X[4];
+    CAMELLIA_VALIDATE_RET(ctx != NULL);
+    CAMELLIA_VALIDATE_RET(mode == MBEDTLS_CAMELLIA_ENCRYPT || mode == MBEDTLS_CAMELLIA_DECRYPT);
+    CAMELLIA_VALIDATE_RET(input != NULL);
+    CAMELLIA_VALIDATE_RET(output != NULL);
+
+    ((void)mode);
+
+    NR = ctx->nr;
+    RK = ctx->rk;
+
+    X[0] = MBEDTLS_GET_UINT32_BE(input, 0);
+    X[1] = MBEDTLS_GET_UINT32_BE(input, 4);
+    X[2] = MBEDTLS_GET_UINT32_BE(input, 8);
+    X[3] = MBEDTLS_GET_UINT32_BE(input, 12);
+
+    X[0] ^= *RK++;
+    X[1] ^= *RK++;
+    X[2] ^= *RK++;
+    X[3] ^= *RK++;
+
+    while (NR) {
+        --NR;
+        camellia_feistel(X, RK, X + 2);
+        RK += 2;
+        camellia_feistel(X + 2, RK, X);
+        RK += 2;
+        camellia_feistel(X, RK, X + 2);
+        RK += 2;
+        camellia_feistel(X + 2, RK, X);
+        RK += 2;
+        camellia_feistel(X, RK, X + 2);
+        RK += 2;
+        camellia_feistel(X + 2, RK, X);
+        RK += 2;
+
+        if (NR) {
+            FL(X[0], X[1], RK[0], RK[1]);
+            RK += 2;
+            FLInv(X[2], X[3], RK[0], RK[1]);
+            RK += 2;
+        }
+    }
+
+    X[2] ^= *RK++;
+    X[3] ^= *RK++;
+    X[0] ^= *RK++;
+    X[1] ^= *RK++;
+
+    MBEDTLS_PUT_UINT32_BE(X[2], output, 0);
+    MBEDTLS_PUT_UINT32_BE(X[3], output, 4);
+    MBEDTLS_PUT_UINT32_BE(X[0], output, 8);
+    MBEDTLS_PUT_UINT32_BE(X[1], output, 12);
+
+    return (0);
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+/*
+ * Camellia-CBC buffer encryption/decryption
+ */
+int mbedtls_camellia_crypt_cbc(mbedtls_camellia_context* ctx, int mode, size_t length,
+    unsigned char iv[16], const unsigned char* input, unsigned char* output) {
+    int i;
+    unsigned char temp[16];
+    CAMELLIA_VALIDATE_RET(ctx != NULL);
+    CAMELLIA_VALIDATE_RET(mode == MBEDTLS_CAMELLIA_ENCRYPT || mode == MBEDTLS_CAMELLIA_DECRYPT);
+    CAMELLIA_VALIDATE_RET(iv != NULL);
+    CAMELLIA_VALIDATE_RET(length == 0 || input != NULL);
+    CAMELLIA_VALIDATE_RET(length == 0 || output != NULL);
+
+    if (length % 16)
+        return (MBEDTLS_ERR_CAMELLIA_INVALID_INPUT_LENGTH);
+
+    if (mode == MBEDTLS_CAMELLIA_DECRYPT) {
+        while (length > 0) {
+            memcpy(temp, input, 16);
+            mbedtls_camellia_crypt_ecb(ctx, mode, input, output);
+
+            for (i = 0; i < 16; i++)
+                output[i] = (unsigned char)(output[i] ^ iv[i]);
+
+            memcpy(iv, temp, 16);
+
+            input += 16;
+            output += 16;
+            length -= 16;
+        }
+    } else {
+        while (length > 0) {
+            for (i = 0; i < 16; i++)
+                output[i] = (unsigned char)(input[i] ^ iv[i]);
+
+            mbedtls_camellia_crypt_ecb(ctx, mode, output, output);
+            memcpy(iv, output, 16);
+
+            input += 16;
+            output += 16;
+            length -= 16;
+        }
+    }
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+/*
+ * Camellia-CFB128 buffer encryption/decryption
+ */
+int mbedtls_camellia_crypt_cfb128(mbedtls_camellia_context* ctx, int mode, size_t length,
+    size_t* iv_off, unsigned char iv[16], const unsigned char* input, unsigned char* output) {
+    int c;
+    size_t n;
+    CAMELLIA_VALIDATE_RET(ctx != NULL);
+    CAMELLIA_VALIDATE_RET(mode == MBEDTLS_CAMELLIA_ENCRYPT || mode == MBEDTLS_CAMELLIA_DECRYPT);
+    CAMELLIA_VALIDATE_RET(iv != NULL);
+    CAMELLIA_VALIDATE_RET(iv_off != NULL);
+    CAMELLIA_VALIDATE_RET(length == 0 || input != NULL);
+    CAMELLIA_VALIDATE_RET(length == 0 || output != NULL);
+
+    n = *iv_off;
+    if (n >= 16)
+        return (MBEDTLS_ERR_CAMELLIA_BAD_INPUT_DATA);
+
+    if (mode == MBEDTLS_CAMELLIA_DECRYPT) {
+        while (length--) {
+            if (n == 0)
+                mbedtls_camellia_crypt_ecb(ctx, MBEDTLS_CAMELLIA_ENCRYPT, iv, iv);
+
+            c = *input++;
+            *output++ = (unsigned char)(c ^ iv[n]);
+            iv[n] = (unsigned char)c;
+
+            n = (n + 1) & 0x0F;
+        }
+    } else {
+        while (length--) {
+            if (n == 0)
+                mbedtls_camellia_crypt_ecb(ctx, MBEDTLS_CAMELLIA_ENCRYPT, iv, iv);
+
+            iv[n] = *output++ = (unsigned char)(iv[n] ^ *input++);
+
+            n = (n + 1) & 0x0F;
+        }
+    }
+
+    *iv_off = n;
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+/*
+ * Camellia-CTR buffer encryption/decryption
+ */
+int mbedtls_camellia_crypt_ctr(mbedtls_camellia_context* ctx, size_t length, size_t* nc_off,
+    unsigned char nonce_counter[16], unsigned char stream_block[16], const unsigned char* input,
+    unsigned char* output) {
+    int c, i;
+    size_t n;
+    CAMELLIA_VALIDATE_RET(ctx != NULL);
+    CAMELLIA_VALIDATE_RET(nonce_counter != NULL);
+    CAMELLIA_VALIDATE_RET(stream_block != NULL);
+    CAMELLIA_VALIDATE_RET(nc_off != NULL);
+    CAMELLIA_VALIDATE_RET(length == 0 || input != NULL);
+    CAMELLIA_VALIDATE_RET(length == 0 || output != NULL);
+
+    n = *nc_off;
+    if (n >= 16)
+        return (MBEDTLS_ERR_CAMELLIA_BAD_INPUT_DATA);
+
+    while (length--) {
+        if (n == 0) {
+            mbedtls_camellia_crypt_ecb(ctx, MBEDTLS_CAMELLIA_ENCRYPT, nonce_counter, stream_block);
+
+            for (i = 16; i > 0; i--)
+                if (++nonce_counter[i - 1] != 0)
+                    break;
+        }
+        c = *input++;
+        *output++ = (unsigned char)(c ^ stream_block[n]);
+
+        n = (n + 1) & 0x0F;
+    }
+
+    *nc_off = n;
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+#endif /* !MBEDTLS_CAMELLIA_ALT */
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/*
+ * Camellia test vectors from:
+ *
+ * http://info.isl.ntt.co.jp/crypt/eng/camellia/technology.html:
+ *   http://info.isl.ntt.co.jp/crypt/eng/camellia/dl/cryptrec/intermediate.txt
+ *   http://info.isl.ntt.co.jp/crypt/eng/camellia/dl/cryptrec/t_camellia.txt
+ *                      (For each bitlength: Key 0, Nr 39)
+ */
+#define CAMELLIA_TESTS_ECB 2
+
+static const unsigned char camellia_test_ecb_key[3][CAMELLIA_TESTS_ECB][32] = {
+    {{0x01, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef, 0xfe, 0xdc, 0xba, 0x98, 0x76, 0x54, 0x32,
+         0x10},
+        {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00}},
+    {{0x01, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef, 0xfe, 0xdc, 0xba, 0x98, 0x76, 0x54, 0x32,
+         0x10, 0x00, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77},
+        {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}},
+    {{0x01, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef, 0xfe, 0xdc, 0xba, 0x98, 0x76, 0x54, 0x32,
+         0x10, 0x00, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77, 0x88, 0x99, 0xaa, 0xbb, 0xcc, 0xdd,
+         0xee, 0xff},
+        {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00}},
+};
+
+static const unsigned char camellia_test_ecb_plain[CAMELLIA_TESTS_ECB][16] = {
+    {0x01, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef, 0xfe, 0xdc, 0xba, 0x98, 0x76, 0x54, 0x32,
+        0x10},
+    {0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00}};
+
+static const unsigned char camellia_test_ecb_cipher[3][CAMELLIA_TESTS_ECB][16] = {
+    {{0x67, 0x67, 0x31, 0x38, 0x54, 0x96, 0x69, 0x73, 0x08, 0x57, 0x06, 0x56, 0x48, 0xea, 0xbe,
+         0x43},
+        {0x38, 0x3C, 0x6C, 0x2A, 0xAB, 0xEF, 0x7F, 0xDE, 0x25, 0xCD, 0x47, 0x0B, 0xF7, 0x74, 0xA3,
+            0x31}},
+    {{0xb4, 0x99, 0x34, 0x01, 0xb3, 0xe9, 0x96, 0xf8, 0x4e, 0xe5, 0xce, 0xe7, 0xd7, 0x9b, 0x09,
+         0xb9},
+        {0xD1, 0x76, 0x3F, 0xC0, 0x19, 0xD7, 0x7C, 0xC9, 0x30, 0xBF, 0xF2, 0xA5, 0x6F, 0x7C, 0x93,
+            0x64}},
+    {{0x9a, 0xcc, 0x23, 0x7d, 0xff, 0x16, 0xd7, 0x6c, 0x20, 0xef, 0x7c, 0x91, 0x9e, 0x3a, 0x75,
+         0x09},
+        {0x05, 0x03, 0xFB, 0x10, 0xAB, 0x24, 0x1E, 0x7C, 0xF4, 0x5D, 0x8C, 0xDE, 0xEE, 0x47, 0x43,
+            0x35}}};
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+#define CAMELLIA_TESTS_CBC 3
+
+static const unsigned char camellia_test_cbc_key[3][32] = {{0x2B, 0x7E, 0x15, 0x16, 0x28, 0xAE,
+                                                               0xD2, 0xA6, 0xAB, 0xF7, 0x15, 0x88,
+                                                               0x09, 0xCF, 0x4F, 0x3C},
+    {0x8E, 0x73, 0xB0, 0xF7, 0xDA, 0x0E, 0x64, 0x52, 0xC8, 0x10, 0xF3, 0x2B, 0x80, 0x90, 0x79, 0xE5,
+        0x62, 0xF8, 0xEA, 0xD2, 0x52, 0x2C, 0x6B, 0x7B},
+    {0x60, 0x3D, 0xEB, 0x10, 0x15, 0xCA, 0x71, 0xBE, 0x2B, 0x73, 0xAE, 0xF0, 0x85, 0x7D, 0x77, 0x81,
+        0x1F, 0x35, 0x2C, 0x07, 0x3B, 0x61, 0x08, 0xD7, 0x2D, 0x98, 0x10, 0xA3, 0x09, 0x14, 0xDF,
+        0xF4}};
+
+static const unsigned char camellia_test_cbc_iv[16] =
+
+    {0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E,
+        0x0F};
+
+static const unsigned char camellia_test_cbc_plain[CAMELLIA_TESTS_CBC][16] = {
+    {0x6B, 0xC1, 0xBE, 0xE2, 0x2E, 0x40, 0x9F, 0x96, 0xE9, 0x3D, 0x7E, 0x11, 0x73, 0x93, 0x17,
+        0x2A},
+    {0xAE, 0x2D, 0x8A, 0x57, 0x1E, 0x03, 0xAC, 0x9C, 0x9E, 0xB7, 0x6F, 0xAC, 0x45, 0xAF, 0x8E,
+        0x51},
+    {0x30, 0xC8, 0x1C, 0x46, 0xA3, 0x5C, 0xE4, 0x11, 0xE5, 0xFB, 0xC1, 0x19, 0x1A, 0x0A, 0x52, 0xEF}
+
+};
+
+static const unsigned char camellia_test_cbc_cipher[3][CAMELLIA_TESTS_CBC][16] = {
+    {{0x16, 0x07, 0xCF, 0x49, 0x4B, 0x36, 0xBB, 0xF0, 0x0D, 0xAE, 0xB0, 0xB5, 0x03, 0xC8, 0x31,
+         0xAB},
+        {0xA2, 0xF2, 0xCF, 0x67, 0x16, 0x29, 0xEF, 0x78, 0x40, 0xC5, 0xA5, 0xDF, 0xB5, 0x07, 0x48,
+            0x87},
+        {0x0F, 0x06, 0x16, 0x50, 0x08, 0xCF, 0x8B, 0x8B, 0x5A, 0x63, 0x58, 0x63, 0x62, 0x54, 0x3E,
+            0x54}},
+    {{0x2A, 0x48, 0x30, 0xAB, 0x5A, 0xC4, 0xA1, 0xA2, 0x40, 0x59, 0x55, 0xFD, 0x21, 0x95, 0xCF,
+         0x93},
+        {0x5D, 0x5A, 0x86, 0x9B, 0xD1, 0x4C, 0xE5, 0x42, 0x64, 0xF8, 0x92, 0xA6, 0xDD, 0x2E, 0xC3,
+            0xD5},
+        {0x37, 0xD3, 0x59, 0xC3, 0x34, 0x98, 0x36, 0xD8, 0x84, 0xE3, 0x10, 0xAD, 0xDF, 0x68, 0xC4,
+            0x49}},
+    {{0xE6, 0xCF, 0xA3, 0x5F, 0xC0, 0x2B, 0x13, 0x4A, 0x4D, 0x2C, 0x0B, 0x67, 0x37, 0xAC, 0x3E,
+         0xDA},
+        {0x36, 0xCB, 0xEB, 0x73, 0xBD, 0x50, 0x4B, 0x40, 0x70, 0xB1, 0xB7, 0xDE, 0x2B, 0x21, 0xEB,
+            0x50},
+        {0xE3, 0x1A, 0x60, 0x55, 0x29, 0x7D, 0x96, 0xCA, 0x33, 0x30, 0xCD, 0xF1, 0xB1, 0x86, 0x0A,
+            0x83}}};
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+/*
+ * Camellia-CTR test vectors from:
+ *
+ * http://www.faqs.org/rfcs/rfc5528.html
+ */
+
+static const unsigned char camellia_test_ctr_key[3][16] = {{0xAE, 0x68, 0x52, 0xF8, 0x12, 0x10,
+                                                               0x67, 0xCC, 0x4B, 0xF7, 0xA5, 0x76,
+                                                               0x55, 0x77, 0xF3, 0x9E},
+    {0x7E, 0x24, 0x06, 0x78, 0x17, 0xFA, 0xE0, 0xD7, 0x43, 0xD6, 0xCE, 0x1F, 0x32, 0x53, 0x91,
+        0x63},
+    {0x76, 0x91, 0xBE, 0x03, 0x5E, 0x50, 0x20, 0xA8, 0xAC, 0x6E, 0x61, 0x85, 0x29, 0xF9, 0xA0,
+        0xDC}};
+
+static const unsigned char camellia_test_ctr_nonce_counter[3][16] = {
+    {0x00, 0x00, 0x00, 0x30, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x01},
+    {0x00, 0x6C, 0xB6, 0xDB, 0xC0, 0x54, 0x3B, 0x59, 0xDA, 0x48, 0xD9, 0x0B, 0x00, 0x00, 0x00,
+        0x01},
+    {0x00, 0xE0, 0x01, 0x7B, 0x27, 0x77, 0x7F, 0x3F, 0x4A, 0x17, 0x86, 0xF0, 0x00, 0x00, 0x00,
+        0x01}};
+
+static const unsigned char camellia_test_ctr_pt[3][48] = {{0x53, 0x69, 0x6E, 0x67, 0x6C, 0x65, 0x20,
+                                                              0x62, 0x6C, 0x6F, 0x63, 0x6B, 0x20,
+                                                              0x6D, 0x73, 0x67},
+
+    {0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F,
+        0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E,
+        0x1F},
+
+    {0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F,
+        0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E,
+        0x1F, 0x20, 0x21, 0x22, 0x23}};
+
+static const unsigned char camellia_test_ctr_ct[3][48] = {{0xD0, 0x9D, 0xC2, 0x9A, 0x82, 0x14, 0x61,
+                                                              0x9A, 0x20, 0x87, 0x7C, 0x76, 0xDB,
+                                                              0x1F, 0x0B, 0x3F},
+    {0xDB, 0xF3, 0xC7, 0x8D, 0xC0, 0x83, 0x96, 0xD4, 0xDA, 0x7C, 0x90, 0x77, 0x65, 0xBB, 0xCB, 0x44,
+        0x2B, 0x8E, 0x8E, 0x0F, 0x31, 0xF0, 0xDC, 0xA7, 0x2C, 0x74, 0x17, 0xE3, 0x53, 0x60, 0xE0,
+        0x48},
+    {0xB1, 0x9D, 0x1F, 0xCD, 0xCB, 0x75, 0xEB, 0x88, 0x2F, 0x84, 0x9C, 0xE2, 0x4D, 0x85, 0xCF, 0x73,
+        0x9C, 0xE6, 0x4B, 0x2B, 0x5C, 0x9D, 0x73, 0xF1, 0x4F, 0x2D, 0x5D, 0x9D, 0xCE, 0x98, 0x89,
+        0xCD, 0xDF, 0x50, 0x86, 0x96}};
+
+static const int camellia_test_ctr_len[3] = {16, 32, 36};
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+/*
+ * Checkup routine
+ */
+int mbedtls_camellia_self_test(int verbose) {
+    int i, j, u, v;
+    unsigned char key[32];
+    unsigned char buf[64];
+    unsigned char src[16];
+    unsigned char dst[16];
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    unsigned char iv[16];
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    size_t offset, len;
+    unsigned char nonce_counter[16];
+    unsigned char stream_block[16];
+#endif
+    int ret = 1;
+
+    mbedtls_camellia_context ctx;
+
+    mbedtls_camellia_init(&ctx);
+    memset(key, 0, 32);
+
+    for (j = 0; j < 6; j++) {
+        u = j >> 1;
+        v = j & 1;
+
+        if (verbose != 0)
+            mbedtls_printf("  CAMELLIA-ECB-%3d (%s): ", 128 + u * 64,
+                (v == MBEDTLS_CAMELLIA_DECRYPT) ? "dec" : "enc");
+
+        for (i = 0; i < CAMELLIA_TESTS_ECB; i++) {
+            memcpy(key, camellia_test_ecb_key[u][i], 16 + 8 * u);
+
+            if (v == MBEDTLS_CAMELLIA_DECRYPT) {
+                mbedtls_camellia_setkey_dec(&ctx, key, 128 + u * 64);
+                memcpy(src, camellia_test_ecb_cipher[u][i], 16);
+                memcpy(dst, camellia_test_ecb_plain[i], 16);
+            } else { /* MBEDTLS_CAMELLIA_ENCRYPT */
+                mbedtls_camellia_setkey_enc(&ctx, key, 128 + u * 64);
+                memcpy(src, camellia_test_ecb_plain[i], 16);
+                memcpy(dst, camellia_test_ecb_cipher[u][i], 16);
+            }
+
+            mbedtls_camellia_crypt_ecb(&ctx, v, src, buf);
+
+            if (memcmp(buf, dst, 16) != 0) {
+                if (verbose != 0)
+                    mbedtls_printf("failed\n");
+                goto exit;
+            }
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    /*
+     * CBC mode
+     */
+    for (j = 0; j < 6; j++) {
+        u = j >> 1;
+        v = j & 1;
+
+        if (verbose != 0)
+            mbedtls_printf("  CAMELLIA-CBC-%3d (%s): ", 128 + u * 64,
+                (v == MBEDTLS_CAMELLIA_DECRYPT) ? "dec" : "enc");
+
+        memcpy(src, camellia_test_cbc_iv, 16);
+        memcpy(dst, camellia_test_cbc_iv, 16);
+        memcpy(key, camellia_test_cbc_key[u], 16 + 8 * u);
+
+        if (v == MBEDTLS_CAMELLIA_DECRYPT) {
+            mbedtls_camellia_setkey_dec(&ctx, key, 128 + u * 64);
+        } else {
+            mbedtls_camellia_setkey_enc(&ctx, key, 128 + u * 64);
+        }
+
+        for (i = 0; i < CAMELLIA_TESTS_CBC; i++) {
+
+            if (v == MBEDTLS_CAMELLIA_DECRYPT) {
+                memcpy(iv, src, 16);
+                memcpy(src, camellia_test_cbc_cipher[u][i], 16);
+                memcpy(dst, camellia_test_cbc_plain[i], 16);
+            } else { /* MBEDTLS_CAMELLIA_ENCRYPT */
+                memcpy(iv, dst, 16);
+                memcpy(src, camellia_test_cbc_plain[i], 16);
+                memcpy(dst, camellia_test_cbc_cipher[u][i], 16);
+            }
+
+            mbedtls_camellia_crypt_cbc(&ctx, v, 16, iv, src, buf);
+
+            if (memcmp(buf, dst, 16) != 0) {
+                if (verbose != 0)
+                    mbedtls_printf("failed\n");
+                goto exit;
+            }
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    /*
+     * CTR mode
+     */
+    for (i = 0; i < 6; i++) {
+        u = i >> 1;
+        v = i & 1;
+
+        if (verbose != 0)
+            mbedtls_printf("  CAMELLIA-CTR-128 (%s): ",
+                (v == MBEDTLS_CAMELLIA_DECRYPT) ? "dec" : "enc");
+
+        memcpy(nonce_counter, camellia_test_ctr_nonce_counter[u], 16);
+        memcpy(key, camellia_test_ctr_key[u], 16);
+
+        offset = 0;
+        mbedtls_camellia_setkey_enc(&ctx, key, 128);
+
+        if (v == MBEDTLS_CAMELLIA_DECRYPT) {
+            len = camellia_test_ctr_len[u];
+            memcpy(buf, camellia_test_ctr_ct[u], len);
+
+            mbedtls_camellia_crypt_ctr(&ctx, len, &offset, nonce_counter, stream_block, buf, buf);
+
+            if (memcmp(buf, camellia_test_ctr_pt[u], len) != 0) {
+                if (verbose != 0)
+                    mbedtls_printf("failed\n");
+                goto exit;
+            }
+        } else {
+            len = camellia_test_ctr_len[u];
+            memcpy(buf, camellia_test_ctr_pt[u], len);
+
+            mbedtls_camellia_crypt_ctr(&ctx, len, &offset, nonce_counter, stream_block, buf, buf);
+
+            if (memcmp(buf, camellia_test_ctr_ct[u], len) != 0) {
+                if (verbose != 0)
+                    mbedtls_printf("failed\n");
+                goto exit;
+            }
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+    ret = 0;
+
+exit:
+    mbedtls_camellia_free(&ctx);
+    return (ret);
+}
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_CAMELLIA_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/cipher.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/cipher.cpp
new file mode 100644
index 0000000000..22a9b08c7f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/cipher.cpp
@@ -0,0 +1,1407 @@
+/**
+ * \file cipher.c
+ *
+ * \brief Generic cipher wrapper for mbed TLS
+ *
+ * \author Adriaan de Jong <dejong@fox-it.com>
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_CIPHER_C)
+
+#include <stdlib.h>
+#include <string.h>
+
+#include "cipher_wrap.h"
+#include "mbedtls/cipher.h"
+#include "mbedtls/constant_time.h"
+#include "mbedtls/error.h"
+#include "mbedtls/platform_util.h"
+
+#if defined(MBEDTLS_CHACHAPOLY_C)
+#include "mbedtls/chachapoly.h"
+#endif
+
+#if defined(MBEDTLS_GCM_C)
+#include "mbedtls/gcm.h"
+#endif
+
+#if defined(MBEDTLS_CCM_C)
+#include "mbedtls/ccm.h"
+#endif
+
+#if defined(MBEDTLS_CHACHA20_C)
+#include "mbedtls/chacha20.h"
+#endif
+
+#if defined(MBEDTLS_CMAC_C)
+#include "mbedtls/cmac.h"
+#endif
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+#include "mbedtls/psa_util.h"
+#include "psa/crypto.h"
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#if defined(MBEDTLS_NIST_KW_C)
+#include "mbedtls/nist_kw.h"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif
+
+#define CIPHER_VALIDATE_RET(cond)                                                                  \
+    MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA)
+#define CIPHER_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+static int supported_init = 0;
+
+const int* mbedtls_cipher_list(void) {
+    const mbedtls_cipher_definition_t* def;
+    int* type;
+
+    if (!supported_init) {
+        def = mbedtls_cipher_definitions;
+        type = mbedtls_cipher_supported;
+
+        while (def->type != 0)
+            *type++ = (*def++).type;
+
+        *type = 0;
+
+        supported_init = 1;
+    }
+
+    return (mbedtls_cipher_supported);
+}
+
+const mbedtls_cipher_info_t* mbedtls_cipher_info_from_type(
+    const mbedtls_cipher_type_t cipher_type) {
+    const mbedtls_cipher_definition_t* def;
+
+    for (def = mbedtls_cipher_definitions; def->info != NULL; def++)
+        if (def->type == cipher_type)
+            return (def->info);
+
+    return (NULL);
+}
+
+const mbedtls_cipher_info_t* mbedtls_cipher_info_from_string(const char* cipher_name) {
+    const mbedtls_cipher_definition_t* def;
+
+    if (NULL == cipher_name)
+        return (NULL);
+
+    for (def = mbedtls_cipher_definitions; def->info != NULL; def++)
+        if (!strcmp(def->info->name, cipher_name))
+            return (def->info);
+
+    return (NULL);
+}
+
+const mbedtls_cipher_info_t* mbedtls_cipher_info_from_values(const mbedtls_cipher_id_t cipher_id,
+    int key_bitlen, const mbedtls_cipher_mode_t mode) {
+    const mbedtls_cipher_definition_t* def;
+
+    for (def = mbedtls_cipher_definitions; def->info != NULL; def++)
+        if (def->info->base->cipher == cipher_id && def->info->key_bitlen == (unsigned)key_bitlen &&
+            def->info->mode == mode)
+            return (def->info);
+
+    return (NULL);
+}
+
+void mbedtls_cipher_init(mbedtls_cipher_context_t* ctx) {
+    CIPHER_VALIDATE(ctx != NULL);
+    memset(ctx, 0, sizeof(mbedtls_cipher_context_t));
+}
+
+void mbedtls_cipher_free(mbedtls_cipher_context_t* ctx) {
+    if (ctx == NULL)
+        return;
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        if (ctx->cipher_ctx != NULL) {
+            mbedtls_cipher_context_psa* const cipher_psa =
+                (mbedtls_cipher_context_psa*)ctx->cipher_ctx;
+
+            if (cipher_psa->slot_state == MBEDTLS_CIPHER_PSA_KEY_OWNED) {
+                /* xxx_free() doesn't allow to return failures. */
+                (void)psa_destroy_key(cipher_psa->slot);
+            }
+
+            mbedtls_platform_zeroize(cipher_psa, sizeof(*cipher_psa));
+            mbedtls_free(cipher_psa);
+        }
+
+        mbedtls_platform_zeroize(ctx, sizeof(mbedtls_cipher_context_t));
+        return;
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#if defined(MBEDTLS_CMAC_C)
+    if (ctx->cmac_ctx) {
+        mbedtls_platform_zeroize(ctx->cmac_ctx, sizeof(mbedtls_cmac_context_t));
+        mbedtls_free(ctx->cmac_ctx);
+    }
+#endif
+
+    if (ctx->cipher_ctx)
+        ctx->cipher_info->base->ctx_free_func(ctx->cipher_ctx);
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_cipher_context_t));
+}
+
+int mbedtls_cipher_setup(mbedtls_cipher_context_t* ctx, const mbedtls_cipher_info_t* cipher_info) {
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    if (cipher_info == NULL)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    memset(ctx, 0, sizeof(mbedtls_cipher_context_t));
+
+    if (NULL == (ctx->cipher_ctx = cipher_info->base->ctx_alloc_func()))
+        return (MBEDTLS_ERR_CIPHER_ALLOC_FAILED);
+
+    ctx->cipher_info = cipher_info;
+
+#if defined(MBEDTLS_CIPHER_MODE_WITH_PADDING)
+    /*
+     * Ignore possible errors caused by a cipher mode that doesn't use padding
+     */
+#if defined(MBEDTLS_CIPHER_PADDING_PKCS7)
+    (void)mbedtls_cipher_set_padding_mode(ctx, MBEDTLS_PADDING_PKCS7);
+#else
+    (void)mbedtls_cipher_set_padding_mode(ctx, MBEDTLS_PADDING_NONE);
+#endif
+#endif /* MBEDTLS_CIPHER_MODE_WITH_PADDING */
+
+    return (0);
+}
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+int mbedtls_cipher_setup_psa(mbedtls_cipher_context_t* ctx,
+    const mbedtls_cipher_info_t* cipher_info, size_t taglen) {
+    psa_algorithm_t alg;
+    mbedtls_cipher_context_psa* cipher_psa;
+
+    if (NULL == cipher_info || NULL == ctx)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    /* Check that the underlying cipher mode and cipher type are
+     * supported by the underlying PSA Crypto implementation. */
+    alg = mbedtls_psa_translate_cipher_mode(cipher_info->mode, taglen);
+    if (alg == 0)
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+    if (mbedtls_psa_translate_cipher_type(cipher_info->type) == 0)
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+
+    memset(ctx, 0, sizeof(mbedtls_cipher_context_t));
+
+    cipher_psa = mbedtls_calloc(1, sizeof(mbedtls_cipher_context_psa));
+    if (cipher_psa == NULL)
+        return (MBEDTLS_ERR_CIPHER_ALLOC_FAILED);
+    cipher_psa->alg = alg;
+    ctx->cipher_ctx = cipher_psa;
+    ctx->cipher_info = cipher_info;
+    ctx->psa_enabled = 1;
+    return (0);
+}
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+int mbedtls_cipher_setkey(mbedtls_cipher_context_t* ctx, const unsigned char* key, int key_bitlen,
+    const mbedtls_operation_t operation) {
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(key != NULL);
+    CIPHER_VALIDATE_RET(operation == MBEDTLS_ENCRYPT || operation == MBEDTLS_DECRYPT);
+    if (ctx->cipher_info == NULL)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        mbedtls_cipher_context_psa* const cipher_psa = (mbedtls_cipher_context_psa*)ctx->cipher_ctx;
+
+        size_t const key_bytelen = ((size_t)key_bitlen + 7) / 8;
+
+        psa_status_t status;
+        psa_key_type_t key_type;
+        psa_key_attributes_t attributes = PSA_KEY_ATTRIBUTES_INIT;
+
+        /* PSA Crypto API only accepts byte-aligned keys. */
+        if (key_bitlen % 8 != 0)
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+        /* Don't allow keys to be set multiple times. */
+        if (cipher_psa->slot_state != MBEDTLS_CIPHER_PSA_KEY_UNSET)
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+        key_type = mbedtls_psa_translate_cipher_type(ctx->cipher_info->type);
+        if (key_type == 0)
+            return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+        psa_set_key_type(&attributes, key_type);
+
+        /* Mbed TLS' cipher layer doesn't enforce the mode of operation
+         * (encrypt vs. decrypt): it is possible to setup a key for encryption
+         * and use it for AEAD decryption. Until tests relying on this
+         * are changed, allow any usage in PSA. */
+        psa_set_key_usage_flags(&attributes,
+            /* mbedtls_psa_translate_cipher_operation( operation ); */
+            PSA_KEY_USAGE_ENCRYPT | PSA_KEY_USAGE_DECRYPT);
+        psa_set_key_algorithm(&attributes, cipher_psa->alg);
+
+        status = psa_import_key(&attributes, key, key_bytelen, &cipher_psa->slot);
+        switch (status) {
+        case PSA_SUCCESS:
+            break;
+        case PSA_ERROR_INSUFFICIENT_MEMORY:
+            return (MBEDTLS_ERR_CIPHER_ALLOC_FAILED);
+        case PSA_ERROR_NOT_SUPPORTED:
+            return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+        default:
+            return (MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED);
+        }
+        /* Indicate that we own the key slot and need to
+         * destroy it in mbedtls_cipher_free(). */
+        cipher_psa->slot_state = MBEDTLS_CIPHER_PSA_KEY_OWNED;
+
+        ctx->key_bitlen = key_bitlen;
+        ctx->operation = operation;
+        return (0);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+    if ((ctx->cipher_info->flags & MBEDTLS_CIPHER_VARIABLE_KEY_LEN) == 0 &&
+        (int)ctx->cipher_info->key_bitlen != key_bitlen) {
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+    }
+
+    ctx->key_bitlen = key_bitlen;
+    ctx->operation = operation;
+
+    /*
+     * For OFB, CFB and CTR mode always use the encryption key schedule
+     */
+    if (MBEDTLS_ENCRYPT == operation || MBEDTLS_MODE_CFB == ctx->cipher_info->mode ||
+        MBEDTLS_MODE_OFB == ctx->cipher_info->mode || MBEDTLS_MODE_CTR == ctx->cipher_info->mode) {
+        return (ctx->cipher_info->base->setkey_enc_func(ctx->cipher_ctx, key, ctx->key_bitlen));
+    }
+
+    if (MBEDTLS_DECRYPT == operation)
+        return (ctx->cipher_info->base->setkey_dec_func(ctx->cipher_ctx, key, ctx->key_bitlen));
+
+    return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+}
+
+int mbedtls_cipher_set_iv(mbedtls_cipher_context_t* ctx, const unsigned char* iv, size_t iv_len) {
+    size_t actual_iv_size;
+
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(iv_len == 0 || iv != NULL);
+    if (ctx->cipher_info == NULL)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* While PSA Crypto has an API for multipart
+         * operations, we currently don't make it
+         * accessible through the cipher layer. */
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+    /* avoid buffer overflow in ctx->iv */
+    if (iv_len > MBEDTLS_MAX_IV_LENGTH)
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+
+    if ((ctx->cipher_info->flags & MBEDTLS_CIPHER_VARIABLE_IV_LEN) != 0)
+        actual_iv_size = iv_len;
+    else {
+        actual_iv_size = ctx->cipher_info->iv_size;
+
+        /* avoid reading past the end of input buffer */
+        if (actual_iv_size > iv_len)
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+    }
+
+#if defined(MBEDTLS_CHACHA20_C)
+    if (ctx->cipher_info->type == MBEDTLS_CIPHER_CHACHA20) {
+        if (0 != mbedtls_chacha20_starts((mbedtls_chacha20_context*)ctx->cipher_ctx, iv,
+                     0U)) /* Initial counter value */
+        {
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+        }
+    }
+#endif
+
+#if defined(MBEDTLS_GCM_C)
+    if (MBEDTLS_MODE_GCM == ctx->cipher_info->mode) {
+        return (
+            mbedtls_gcm_starts((mbedtls_gcm_context*)ctx->cipher_ctx, ctx->operation, iv, iv_len));
+    }
+#endif
+
+#if defined(MBEDTLS_CCM_C)
+    if (MBEDTLS_MODE_CCM_STAR_NO_TAG == ctx->cipher_info->mode) {
+        int set_lengths_result;
+        int ccm_star_mode;
+
+        set_lengths_result =
+            mbedtls_ccm_set_lengths((mbedtls_ccm_context*)ctx->cipher_ctx, 0, 0, 0);
+        if (set_lengths_result != 0)
+            return set_lengths_result;
+
+        if (ctx->operation == MBEDTLS_DECRYPT)
+            ccm_star_mode = MBEDTLS_CCM_STAR_DECRYPT;
+        else if (ctx->operation == MBEDTLS_ENCRYPT)
+            ccm_star_mode = MBEDTLS_CCM_STAR_ENCRYPT;
+        else
+            return MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA;
+
+        return (
+            mbedtls_ccm_starts((mbedtls_ccm_context*)ctx->cipher_ctx, ccm_star_mode, iv, iv_len));
+    }
+#endif
+
+    if (actual_iv_size != 0) {
+        memcpy(ctx->iv, iv, actual_iv_size);
+        ctx->iv_size = actual_iv_size;
+    }
+
+    return (0);
+}
+
+int mbedtls_cipher_reset(mbedtls_cipher_context_t* ctx) {
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    if (ctx->cipher_info == NULL)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* We don't support resetting PSA-based
+         * cipher contexts, yet. */
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+    ctx->unprocessed_len = 0;
+
+    return (0);
+}
+
+#if defined(MBEDTLS_GCM_C) || defined(MBEDTLS_CHACHAPOLY_C)
+int mbedtls_cipher_update_ad(mbedtls_cipher_context_t* ctx, const unsigned char* ad,
+    size_t ad_len) {
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(ad_len == 0 || ad != NULL);
+    if (ctx->cipher_info == NULL)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* While PSA Crypto has an API for multipart
+         * operations, we currently don't make it
+         * accessible through the cipher layer. */
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#if defined(MBEDTLS_GCM_C)
+    if (MBEDTLS_MODE_GCM == ctx->cipher_info->mode) {
+        return (mbedtls_gcm_update_ad((mbedtls_gcm_context*)ctx->cipher_ctx, ad, ad_len));
+    }
+#endif
+
+#if defined(MBEDTLS_CHACHAPOLY_C)
+    if (MBEDTLS_CIPHER_CHACHA20_POLY1305 == ctx->cipher_info->type) {
+        int result;
+        mbedtls_chachapoly_mode_t mode;
+
+        mode = (ctx->operation == MBEDTLS_ENCRYPT) ? MBEDTLS_CHACHAPOLY_ENCRYPT :
+                                                     MBEDTLS_CHACHAPOLY_DECRYPT;
+
+        result =
+            mbedtls_chachapoly_starts((mbedtls_chachapoly_context*)ctx->cipher_ctx, ctx->iv, mode);
+        if (result != 0)
+            return (result);
+
+        return (mbedtls_chachapoly_update_aad((mbedtls_chachapoly_context*)ctx->cipher_ctx, ad,
+            ad_len));
+    }
+#endif
+
+    return (0);
+}
+#endif /* MBEDTLS_GCM_C || MBEDTLS_CHACHAPOLY_C */
+
+int mbedtls_cipher_update(mbedtls_cipher_context_t* ctx, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t block_size;
+
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(ilen == 0 || input != NULL);
+    CIPHER_VALIDATE_RET(output != NULL);
+    CIPHER_VALIDATE_RET(olen != NULL);
+    if (ctx->cipher_info == NULL)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* While PSA Crypto has an API for multipart
+         * operations, we currently don't make it
+         * accessible through the cipher layer. */
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+    *olen = 0;
+    block_size = mbedtls_cipher_get_block_size(ctx);
+    if (0 == block_size) {
+        return (MBEDTLS_ERR_CIPHER_INVALID_CONTEXT);
+    }
+
+    if (ctx->cipher_info->mode == MBEDTLS_MODE_ECB) {
+        if (ilen != block_size)
+            return (MBEDTLS_ERR_CIPHER_FULL_BLOCK_EXPECTED);
+
+        *olen = ilen;
+
+        if (0 != (ret = ctx->cipher_info->base->ecb_func(ctx->cipher_ctx, ctx->operation, input,
+                      output))) {
+            return (ret);
+        }
+
+        return (0);
+    }
+
+#if defined(MBEDTLS_GCM_C)
+    if (ctx->cipher_info->mode == MBEDTLS_MODE_GCM) {
+        return (mbedtls_gcm_update((mbedtls_gcm_context*)ctx->cipher_ctx, input, ilen, output, ilen,
+            olen));
+    }
+#endif
+
+#if defined(MBEDTLS_CCM_C)
+    if (ctx->cipher_info->mode == MBEDTLS_MODE_CCM_STAR_NO_TAG) {
+        return (mbedtls_ccm_update((mbedtls_ccm_context*)ctx->cipher_ctx, input, ilen, output, ilen,
+            olen));
+    }
+#endif
+
+#if defined(MBEDTLS_CHACHAPOLY_C)
+    if (ctx->cipher_info->type == MBEDTLS_CIPHER_CHACHA20_POLY1305) {
+        *olen = ilen;
+        return (mbedtls_chachapoly_update((mbedtls_chachapoly_context*)ctx->cipher_ctx, ilen, input,
+            output));
+    }
+#endif
+
+    if (input == output && (ctx->unprocessed_len != 0 || ilen % block_size)) {
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+    }
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    if (ctx->cipher_info->mode == MBEDTLS_MODE_CBC) {
+        size_t copy_len = 0;
+
+        /*
+         * If there is not enough data for a full block, cache it.
+         */
+        if ((ctx->operation == MBEDTLS_DECRYPT && NULL != ctx->add_padding &&
+                ilen <= block_size - ctx->unprocessed_len) ||
+            (ctx->operation == MBEDTLS_DECRYPT && NULL == ctx->add_padding &&
+                ilen < block_size - ctx->unprocessed_len) ||
+            (ctx->operation == MBEDTLS_ENCRYPT && ilen < block_size - ctx->unprocessed_len)) {
+            memcpy(&(ctx->unprocessed_data[ctx->unprocessed_len]), input, ilen);
+
+            ctx->unprocessed_len += ilen;
+            return (0);
+        }
+
+        /*
+         * Process cached data first
+         */
+        if (0 != ctx->unprocessed_len) {
+            copy_len = block_size - ctx->unprocessed_len;
+
+            memcpy(&(ctx->unprocessed_data[ctx->unprocessed_len]), input, copy_len);
+
+            if (0 != (ret = ctx->cipher_info->base->cbc_func(ctx->cipher_ctx, ctx->operation,
+                          block_size, ctx->iv, ctx->unprocessed_data, output))) {
+                return (ret);
+            }
+
+            *olen += block_size;
+            output += block_size;
+            ctx->unprocessed_len = 0;
+
+            input += copy_len;
+            ilen -= copy_len;
+        }
+
+        /*
+         * Cache final, incomplete block
+         */
+        if (0 != ilen) {
+            /* Encryption: only cache partial blocks
+             * Decryption w/ padding: always keep at least one whole block
+             * Decryption w/o padding: only cache partial blocks
+             */
+            copy_len = ilen % block_size;
+            if (copy_len == 0 && ctx->operation == MBEDTLS_DECRYPT && NULL != ctx->add_padding) {
+                copy_len = block_size;
+            }
+
+            memcpy(ctx->unprocessed_data, &(input[ilen - copy_len]), copy_len);
+
+            ctx->unprocessed_len += copy_len;
+            ilen -= copy_len;
+        }
+
+        /*
+         * Process remaining full blocks
+         */
+        if (ilen) {
+            if (0 != (ret = ctx->cipher_info->base->cbc_func(ctx->cipher_ctx, ctx->operation, ilen,
+                          ctx->iv, input, output))) {
+                return (ret);
+            }
+
+            *olen += ilen;
+        }
+
+        return (0);
+    }
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    if (ctx->cipher_info->mode == MBEDTLS_MODE_CFB) {
+        if (0 != (ret = ctx->cipher_info->base->cfb_func(ctx->cipher_ctx, ctx->operation, ilen,
+                      &ctx->unprocessed_len, ctx->iv, input, output))) {
+            return (ret);
+        }
+
+        *olen = ilen;
+
+        return (0);
+    }
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    if (ctx->cipher_info->mode == MBEDTLS_MODE_OFB) {
+        if (0 != (ret = ctx->cipher_info->base->ofb_func(ctx->cipher_ctx, ilen,
+                      &ctx->unprocessed_len, ctx->iv, input, output))) {
+            return (ret);
+        }
+
+        *olen = ilen;
+
+        return (0);
+    }
+#endif /* MBEDTLS_CIPHER_MODE_OFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    if (ctx->cipher_info->mode == MBEDTLS_MODE_CTR) {
+        if (0 != (ret = ctx->cipher_info->base->ctr_func(ctx->cipher_ctx, ilen,
+                      &ctx->unprocessed_len, ctx->iv, ctx->unprocessed_data, input, output))) {
+            return (ret);
+        }
+
+        *olen = ilen;
+
+        return (0);
+    }
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    if (ctx->cipher_info->mode == MBEDTLS_MODE_XTS) {
+        if (ctx->unprocessed_len > 0) {
+            /* We can only process an entire data unit at a time. */
+            return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+        }
+
+        ret = ctx->cipher_info->base->xts_func(ctx->cipher_ctx, ctx->operation, ilen, ctx->iv,
+            input, output);
+        if (ret != 0) {
+            return (ret);
+        }
+
+        *olen = ilen;
+
+        return (0);
+    }
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    if (ctx->cipher_info->mode == MBEDTLS_MODE_STREAM) {
+        if (0 !=
+            (ret = ctx->cipher_info->base->stream_func(ctx->cipher_ctx, ilen, input, output))) {
+            return (ret);
+        }
+
+        *olen = ilen;
+
+        return (0);
+    }
+#endif /* MBEDTLS_CIPHER_MODE_STREAM */
+
+    return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_WITH_PADDING)
+#if defined(MBEDTLS_CIPHER_PADDING_PKCS7)
+/*
+ * PKCS7 (and PKCS5) padding: fill with ll bytes, with ll = padding_len
+ */
+static void add_pkcs_padding(unsigned char* output, size_t output_len, size_t data_len) {
+    size_t padding_len = output_len - data_len;
+    unsigned char i;
+
+    for (i = 0; i < padding_len; i++)
+        output[data_len + i] = (unsigned char)padding_len;
+}
+
+static int get_pkcs_padding(unsigned char* input, size_t input_len, size_t* data_len) {
+    size_t i, pad_idx;
+    unsigned char padding_len, bad = 0;
+
+    if (NULL == input || NULL == data_len)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    padding_len = input[input_len - 1];
+    *data_len = input_len - padding_len;
+
+    /* Avoid logical || since it results in a branch */
+    bad |= padding_len > input_len;
+    bad |= padding_len == 0;
+
+    /* The number of bytes checked must be independent of padding_len,
+     * so pick input_len, which is usually 8 or 16 (one block) */
+    pad_idx = input_len - padding_len;
+    for (i = 0; i < input_len; i++)
+        bad |= (input[i] ^ padding_len) * (i >= pad_idx);
+
+    return (MBEDTLS_ERR_CIPHER_INVALID_PADDING * (bad != 0));
+}
+#endif /* MBEDTLS_CIPHER_PADDING_PKCS7 */
+
+#if defined(MBEDTLS_CIPHER_PADDING_ONE_AND_ZEROS)
+/*
+ * One and zeros padding: fill with 80 00 ... 00
+ */
+static void add_one_and_zeros_padding(unsigned char* output, size_t output_len, size_t data_len) {
+    size_t padding_len = output_len - data_len;
+    unsigned char i = 0;
+
+    output[data_len] = 0x80;
+    for (i = 1; i < padding_len; i++)
+        output[data_len + i] = 0x00;
+}
+
+static int get_one_and_zeros_padding(unsigned char* input, size_t input_len, size_t* data_len) {
+    size_t i;
+    unsigned char done = 0, prev_done, bad;
+
+    if (NULL == input || NULL == data_len)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    bad = 0x80;
+    *data_len = 0;
+    for (i = input_len; i > 0; i--) {
+        prev_done = done;
+        done |= (input[i - 1] != 0);
+        *data_len |= (i - 1) * (done != prev_done);
+        bad ^= input[i - 1] * (done != prev_done);
+    }
+
+    return (MBEDTLS_ERR_CIPHER_INVALID_PADDING * (bad != 0));
+}
+#endif /* MBEDTLS_CIPHER_PADDING_ONE_AND_ZEROS */
+
+#if defined(MBEDTLS_CIPHER_PADDING_ZEROS_AND_LEN)
+/*
+ * Zeros and len padding: fill with 00 ... 00 ll, where ll is padding length
+ */
+static void add_zeros_and_len_padding(unsigned char* output, size_t output_len, size_t data_len) {
+    size_t padding_len = output_len - data_len;
+    unsigned char i = 0;
+
+    for (i = 1; i < padding_len; i++)
+        output[data_len + i - 1] = 0x00;
+    output[output_len - 1] = (unsigned char)padding_len;
+}
+
+static int get_zeros_and_len_padding(unsigned char* input, size_t input_len, size_t* data_len) {
+    size_t i, pad_idx;
+    unsigned char padding_len, bad = 0;
+
+    if (NULL == input || NULL == data_len)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    padding_len = input[input_len - 1];
+    *data_len = input_len - padding_len;
+
+    /* Avoid logical || since it results in a branch */
+    bad |= padding_len > input_len;
+    bad |= padding_len == 0;
+
+    /* The number of bytes checked must be independent of padding_len */
+    pad_idx = input_len - padding_len;
+    for (i = 0; i < input_len - 1; i++)
+        bad |= input[i] * (i >= pad_idx);
+
+    return (MBEDTLS_ERR_CIPHER_INVALID_PADDING * (bad != 0));
+}
+#endif /* MBEDTLS_CIPHER_PADDING_ZEROS_AND_LEN */
+
+#if defined(MBEDTLS_CIPHER_PADDING_ZEROS)
+/*
+ * Zero padding: fill with 00 ... 00
+ */
+static void add_zeros_padding(unsigned char* output, size_t output_len, size_t data_len) {
+    size_t i;
+
+    for (i = data_len; i < output_len; i++)
+        output[i] = 0x00;
+}
+
+static int get_zeros_padding(unsigned char* input, size_t input_len, size_t* data_len) {
+    size_t i;
+    unsigned char done = 0, prev_done;
+
+    if (NULL == input || NULL == data_len)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    *data_len = 0;
+    for (i = input_len; i > 0; i--) {
+        prev_done = done;
+        done |= (input[i - 1] != 0);
+        *data_len |= i * (done != prev_done);
+    }
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_PADDING_ZEROS */
+
+/*
+ * No padding: don't pad :)
+ *
+ * There is no add_padding function (check for NULL in mbedtls_cipher_finish)
+ * but a trivial get_padding function
+ */
+static int get_no_padding(unsigned char* input, size_t input_len, size_t* data_len) {
+    if (NULL == input || NULL == data_len)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    *data_len = input_len;
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_MODE_WITH_PADDING */
+
+int mbedtls_cipher_finish(mbedtls_cipher_context_t* ctx, unsigned char* output, size_t* olen) {
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(output != NULL);
+    CIPHER_VALIDATE_RET(olen != NULL);
+    if (ctx->cipher_info == NULL)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* While PSA Crypto has an API for multipart
+         * operations, we currently don't make it
+         * accessible through the cipher layer. */
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+    *olen = 0;
+
+    if (MBEDTLS_MODE_CFB == ctx->cipher_info->mode || MBEDTLS_MODE_OFB == ctx->cipher_info->mode ||
+        MBEDTLS_MODE_CTR == ctx->cipher_info->mode || MBEDTLS_MODE_GCM == ctx->cipher_info->mode ||
+        MBEDTLS_MODE_CCM_STAR_NO_TAG == ctx->cipher_info->mode ||
+        MBEDTLS_MODE_XTS == ctx->cipher_info->mode ||
+        MBEDTLS_MODE_STREAM == ctx->cipher_info->mode) {
+        return (0);
+    }
+
+    if ((MBEDTLS_CIPHER_CHACHA20 == ctx->cipher_info->type) ||
+        (MBEDTLS_CIPHER_CHACHA20_POLY1305 == ctx->cipher_info->type)) {
+        return (0);
+    }
+
+    if (MBEDTLS_MODE_ECB == ctx->cipher_info->mode) {
+        if (ctx->unprocessed_len != 0)
+            return (MBEDTLS_ERR_CIPHER_FULL_BLOCK_EXPECTED);
+
+        return (0);
+    }
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    if (MBEDTLS_MODE_CBC == ctx->cipher_info->mode) {
+        int ret = 0;
+
+        if (MBEDTLS_ENCRYPT == ctx->operation) {
+            /* check for 'no padding' mode */
+            if (NULL == ctx->add_padding) {
+                if (0 != ctx->unprocessed_len)
+                    return (MBEDTLS_ERR_CIPHER_FULL_BLOCK_EXPECTED);
+
+                return (0);
+            }
+
+            ctx->add_padding(ctx->unprocessed_data, mbedtls_cipher_get_iv_size(ctx),
+                ctx->unprocessed_len);
+        } else if (mbedtls_cipher_get_block_size(ctx) != ctx->unprocessed_len) {
+            /*
+             * For decrypt operations, expect a full block,
+             * or an empty block if no padding
+             */
+            if (NULL == ctx->add_padding && 0 == ctx->unprocessed_len)
+                return (0);
+
+            return (MBEDTLS_ERR_CIPHER_FULL_BLOCK_EXPECTED);
+        }
+
+        /* cipher block */
+        if (0 !=
+            (ret = ctx->cipher_info->base->cbc_func(ctx->cipher_ctx, ctx->operation,
+                 mbedtls_cipher_get_block_size(ctx), ctx->iv, ctx->unprocessed_data, output))) {
+            return (ret);
+        }
+
+        /* Set output size for decryption */
+        if (MBEDTLS_DECRYPT == ctx->operation)
+            return (ctx->get_padding(output, mbedtls_cipher_get_block_size(ctx), olen));
+
+        /* Set output size for encryption */
+        *olen = mbedtls_cipher_get_block_size(ctx);
+        return (0);
+    }
+#else
+    ((void)output);
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+    return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_WITH_PADDING)
+int mbedtls_cipher_set_padding_mode(mbedtls_cipher_context_t* ctx, mbedtls_cipher_padding_t mode) {
+    CIPHER_VALIDATE_RET(ctx != NULL);
+
+    if (NULL == ctx->cipher_info || MBEDTLS_MODE_CBC != ctx->cipher_info->mode) {
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+    }
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* While PSA Crypto knows about CBC padding
+         * schemes, we currently don't make them
+         * accessible through the cipher layer. */
+        if (mode != MBEDTLS_PADDING_NONE)
+            return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+
+        return (0);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+    switch (mode) {
+#if defined(MBEDTLS_CIPHER_PADDING_PKCS7)
+    case MBEDTLS_PADDING_PKCS7:
+        ctx->add_padding = add_pkcs_padding;
+        ctx->get_padding = get_pkcs_padding;
+        break;
+#endif
+#if defined(MBEDTLS_CIPHER_PADDING_ONE_AND_ZEROS)
+    case MBEDTLS_PADDING_ONE_AND_ZEROS:
+        ctx->add_padding = add_one_and_zeros_padding;
+        ctx->get_padding = get_one_and_zeros_padding;
+        break;
+#endif
+#if defined(MBEDTLS_CIPHER_PADDING_ZEROS_AND_LEN)
+    case MBEDTLS_PADDING_ZEROS_AND_LEN:
+        ctx->add_padding = add_zeros_and_len_padding;
+        ctx->get_padding = get_zeros_and_len_padding;
+        break;
+#endif
+#if defined(MBEDTLS_CIPHER_PADDING_ZEROS)
+    case MBEDTLS_PADDING_ZEROS:
+        ctx->add_padding = add_zeros_padding;
+        ctx->get_padding = get_zeros_padding;
+        break;
+#endif
+    case MBEDTLS_PADDING_NONE:
+        ctx->add_padding = NULL;
+        ctx->get_padding = get_no_padding;
+        break;
+
+    default:
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+    }
+
+    return (0);
+}
+#endif /* MBEDTLS_CIPHER_MODE_WITH_PADDING */
+
+#if defined(MBEDTLS_GCM_C) || defined(MBEDTLS_CHACHAPOLY_C)
+int mbedtls_cipher_write_tag(mbedtls_cipher_context_t* ctx, unsigned char* tag, size_t tag_len) {
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(tag_len == 0 || tag != NULL);
+    if (ctx->cipher_info == NULL)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    if (MBEDTLS_ENCRYPT != ctx->operation)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* While PSA Crypto has an API for multipart
+         * operations, we currently don't make it
+         * accessible through the cipher layer. */
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#if defined(MBEDTLS_GCM_C)
+    if (MBEDTLS_MODE_GCM == ctx->cipher_info->mode) {
+        size_t output_length;
+        /* The code here doesn't yet support alternative implementations
+         * that can delay up to a block of output. */
+        return (mbedtls_gcm_finish((mbedtls_gcm_context*)ctx->cipher_ctx, NULL, 0, &output_length,
+            tag, tag_len));
+    }
+#endif
+
+#if defined(MBEDTLS_CHACHAPOLY_C)
+    if (MBEDTLS_CIPHER_CHACHA20_POLY1305 == ctx->cipher_info->type) {
+        /* Don't allow truncated MAC for Poly1305 */
+        if (tag_len != 16U)
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+        return (mbedtls_chachapoly_finish((mbedtls_chachapoly_context*)ctx->cipher_ctx, tag));
+    }
+#endif
+
+    return (0);
+}
+
+int mbedtls_cipher_check_tag(mbedtls_cipher_context_t* ctx, const unsigned char* tag,
+    size_t tag_len) {
+    unsigned char check_tag[16];
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(tag_len == 0 || tag != NULL);
+    if (ctx->cipher_info == NULL)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    if (MBEDTLS_DECRYPT != ctx->operation) {
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+    }
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* While PSA Crypto has an API for multipart
+         * operations, we currently don't make it
+         * accessible through the cipher layer. */
+        return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+    /* Status to return on a non-authenticated algorithm. It would make sense
+     * to return MBEDTLS_ERR_CIPHER_INVALID_CONTEXT or perhaps
+     * MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA, but at the time I write this our
+     * unit tests assume 0. */
+    ret = 0;
+
+#if defined(MBEDTLS_GCM_C)
+    if (MBEDTLS_MODE_GCM == ctx->cipher_info->mode) {
+        size_t output_length;
+        /* The code here doesn't yet support alternative implementations
+         * that can delay up to a block of output. */
+
+        if (tag_len > sizeof(check_tag))
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+        if (0 != (ret = mbedtls_gcm_finish((mbedtls_gcm_context*)ctx->cipher_ctx, NULL, 0,
+                      &output_length, check_tag, tag_len))) {
+            return (ret);
+        }
+
+        /* Check the tag in "constant-time" */
+        if (mbedtls_ct_memcmp(tag, check_tag, tag_len) != 0) {
+            ret = MBEDTLS_ERR_CIPHER_AUTH_FAILED;
+            goto exit;
+        }
+    }
+#endif /* MBEDTLS_GCM_C */
+
+#if defined(MBEDTLS_CHACHAPOLY_C)
+    if (MBEDTLS_CIPHER_CHACHA20_POLY1305 == ctx->cipher_info->type) {
+        /* Don't allow truncated MAC for Poly1305 */
+        if (tag_len != sizeof(check_tag))
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+        ret = mbedtls_chachapoly_finish((mbedtls_chachapoly_context*)ctx->cipher_ctx, check_tag);
+        if (ret != 0) {
+            return (ret);
+        }
+
+        /* Check the tag in "constant-time" */
+        if (mbedtls_ct_memcmp(tag, check_tag, tag_len) != 0) {
+            ret = MBEDTLS_ERR_CIPHER_AUTH_FAILED;
+            goto exit;
+        }
+    }
+#endif /* MBEDTLS_CHACHAPOLY_C */
+
+exit:
+    mbedtls_platform_zeroize(check_tag, tag_len);
+    return (ret);
+}
+#endif /* MBEDTLS_GCM_C || MBEDTLS_CHACHAPOLY_C */
+
+/*
+ * Packet-oriented wrapper for non-AEAD modes
+ */
+int mbedtls_cipher_crypt(mbedtls_cipher_context_t* ctx, const unsigned char* iv, size_t iv_len,
+    const unsigned char* input, size_t ilen, unsigned char* output, size_t* olen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t finish_olen;
+
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(iv_len == 0 || iv != NULL);
+    CIPHER_VALIDATE_RET(ilen == 0 || input != NULL);
+    CIPHER_VALIDATE_RET(output != NULL);
+    CIPHER_VALIDATE_RET(olen != NULL);
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* As in the non-PSA case, we don't check that
+         * a key has been set. If not, the key slot will
+         * still be in its default state of 0, which is
+         * guaranteed to be invalid, hence the PSA-call
+         * below will gracefully fail. */
+        mbedtls_cipher_context_psa* const cipher_psa = (mbedtls_cipher_context_psa*)ctx->cipher_ctx;
+
+        psa_status_t status;
+        psa_cipher_operation_t cipher_op = PSA_CIPHER_OPERATION_INIT;
+        size_t part_len;
+
+        if (ctx->operation == MBEDTLS_DECRYPT) {
+            status = psa_cipher_decrypt_setup(&cipher_op, cipher_psa->slot, cipher_psa->alg);
+        } else if (ctx->operation == MBEDTLS_ENCRYPT) {
+            status = psa_cipher_encrypt_setup(&cipher_op, cipher_psa->slot, cipher_psa->alg);
+        } else
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+        /* In the following, we can immediately return on an error,
+         * because the PSA Crypto API guarantees that cipher operations
+         * are terminated by unsuccessful calls to psa_cipher_update(),
+         * and by any call to psa_cipher_finish(). */
+        if (status != PSA_SUCCESS)
+            return (MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED);
+
+        if (ctx->cipher_info->mode != MBEDTLS_MODE_ECB) {
+            status = psa_cipher_set_iv(&cipher_op, iv, iv_len);
+            if (status != PSA_SUCCESS)
+                return (MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED);
+        }
+
+        status = psa_cipher_update(&cipher_op, input, ilen, output, ilen, olen);
+        if (status != PSA_SUCCESS)
+            return (MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED);
+
+        status = psa_cipher_finish(&cipher_op, output + *olen, ilen - *olen, &part_len);
+        if (status != PSA_SUCCESS)
+            return (MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED);
+
+        *olen += part_len;
+        return (0);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+    if ((ret = mbedtls_cipher_set_iv(ctx, iv, iv_len)) != 0)
+        return (ret);
+
+    if ((ret = mbedtls_cipher_reset(ctx)) != 0)
+        return (ret);
+
+    if ((ret = mbedtls_cipher_update(ctx, input, ilen, output, olen)) != 0)
+        return (ret);
+
+    if ((ret = mbedtls_cipher_finish(ctx, output + *olen, &finish_olen)) != 0)
+        return (ret);
+
+    *olen += finish_olen;
+
+    return (0);
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_AEAD)
+/*
+ * Packet-oriented encryption for AEAD modes: internal function used by
+ * mbedtls_cipher_auth_encrypt_ext().
+ */
+static int mbedtls_cipher_aead_encrypt(mbedtls_cipher_context_t* ctx, const unsigned char* iv,
+    size_t iv_len, const unsigned char* ad, size_t ad_len, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen, unsigned char* tag, size_t tag_len) {
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* As in the non-PSA case, we don't check that
+         * a key has been set. If not, the key slot will
+         * still be in its default state of 0, which is
+         * guaranteed to be invalid, hence the PSA-call
+         * below will gracefully fail. */
+        mbedtls_cipher_context_psa* const cipher_psa = (mbedtls_cipher_context_psa*)ctx->cipher_ctx;
+
+        psa_status_t status;
+
+        /* PSA Crypto API always writes the authentication tag
+         * at the end of the encrypted message. */
+        if (output == NULL || tag != output + ilen)
+            return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+
+        status = psa_aead_encrypt(cipher_psa->slot, cipher_psa->alg, iv, iv_len, ad, ad_len, input,
+            ilen, output, ilen + tag_len, olen);
+        if (status != PSA_SUCCESS)
+            return (MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED);
+
+        *olen -= tag_len;
+        return (0);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#if defined(MBEDTLS_GCM_C)
+    if (MBEDTLS_MODE_GCM == ctx->cipher_info->mode) {
+        *olen = ilen;
+        return (mbedtls_gcm_crypt_and_tag((mbedtls_gcm_context*)ctx->cipher_ctx,
+            MBEDTLS_GCM_ENCRYPT, ilen, iv, iv_len, ad, ad_len, input, output, tag_len, tag));
+    }
+#endif /* MBEDTLS_GCM_C */
+#if defined(MBEDTLS_CCM_C)
+    if (MBEDTLS_MODE_CCM == ctx->cipher_info->mode) {
+        *olen = ilen;
+        return (mbedtls_ccm_encrypt_and_tag(ctx->cipher_ctx, ilen, iv, iv_len, ad, ad_len, input,
+            output, tag, tag_len));
+    }
+#endif /* MBEDTLS_CCM_C */
+#if defined(MBEDTLS_CHACHAPOLY_C)
+    if (MBEDTLS_CIPHER_CHACHA20_POLY1305 == ctx->cipher_info->type) {
+        /* ChachaPoly has fixed length nonce and MAC (tag) */
+        if ((iv_len != ctx->cipher_info->iv_size) || (tag_len != 16U)) {
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+        }
+
+        *olen = ilen;
+        return (mbedtls_chachapoly_encrypt_and_tag(ctx->cipher_ctx, ilen, iv, ad, ad_len, input,
+            output, tag));
+    }
+#endif /* MBEDTLS_CHACHAPOLY_C */
+
+    return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+}
+
+/*
+ * Packet-oriented encryption for AEAD modes: internal function used by
+ * mbedtls_cipher_auth_encrypt_ext().
+ */
+static int mbedtls_cipher_aead_decrypt(mbedtls_cipher_context_t* ctx, const unsigned char* iv,
+    size_t iv_len, const unsigned char* ad, size_t ad_len, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen, const unsigned char* tag, size_t tag_len) {
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+    if (ctx->psa_enabled == 1) {
+        /* As in the non-PSA case, we don't check that
+         * a key has been set. If not, the key slot will
+         * still be in its default state of 0, which is
+         * guaranteed to be invalid, hence the PSA-call
+         * below will gracefully fail. */
+        mbedtls_cipher_context_psa* const cipher_psa = (mbedtls_cipher_context_psa*)ctx->cipher_ctx;
+
+        psa_status_t status;
+
+        /* PSA Crypto API always writes the authentication tag
+         * at the end of the encrypted message. */
+        if (input == NULL || tag != input + ilen)
+            return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+
+        status = psa_aead_decrypt(cipher_psa->slot, cipher_psa->alg, iv, iv_len, ad, ad_len, input,
+            ilen + tag_len, output, ilen, olen);
+        if (status == PSA_ERROR_INVALID_SIGNATURE)
+            return (MBEDTLS_ERR_CIPHER_AUTH_FAILED);
+        else if (status != PSA_SUCCESS)
+            return (MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED);
+
+        return (0);
+    }
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#if defined(MBEDTLS_GCM_C)
+    if (MBEDTLS_MODE_GCM == ctx->cipher_info->mode) {
+        int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+        *olen = ilen;
+        ret = mbedtls_gcm_auth_decrypt((mbedtls_gcm_context*)ctx->cipher_ctx, ilen, iv, iv_len, ad,
+            ad_len, tag, tag_len, input, output);
+
+        if (ret == MBEDTLS_ERR_GCM_AUTH_FAILED)
+            ret = MBEDTLS_ERR_CIPHER_AUTH_FAILED;
+
+        return (ret);
+    }
+#endif /* MBEDTLS_GCM_C */
+#if defined(MBEDTLS_CCM_C)
+    if (MBEDTLS_MODE_CCM == ctx->cipher_info->mode) {
+        int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+        *olen = ilen;
+        ret = mbedtls_ccm_auth_decrypt(ctx->cipher_ctx, ilen, iv, iv_len, ad, ad_len, input, output,
+            tag, tag_len);
+
+        if (ret == MBEDTLS_ERR_CCM_AUTH_FAILED)
+            ret = MBEDTLS_ERR_CIPHER_AUTH_FAILED;
+
+        return (ret);
+    }
+#endif /* MBEDTLS_CCM_C */
+#if defined(MBEDTLS_CHACHAPOLY_C)
+    if (MBEDTLS_CIPHER_CHACHA20_POLY1305 == ctx->cipher_info->type) {
+        int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+        /* ChachaPoly has fixed length nonce and MAC (tag) */
+        if ((iv_len != ctx->cipher_info->iv_size) || (tag_len != 16U)) {
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+        }
+
+        *olen = ilen;
+        ret = mbedtls_chachapoly_auth_decrypt(ctx->cipher_ctx, ilen, iv, ad, ad_len, tag, input,
+            output);
+
+        if (ret == MBEDTLS_ERR_CHACHAPOLY_AUTH_FAILED)
+            ret = MBEDTLS_ERR_CIPHER_AUTH_FAILED;
+
+        return (ret);
+    }
+#endif /* MBEDTLS_CHACHAPOLY_C */
+
+    return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+}
+#endif /* MBEDTLS_CIPHER_MODE_AEAD */
+
+#if defined(MBEDTLS_CIPHER_MODE_AEAD) || defined(MBEDTLS_NIST_KW_C)
+/*
+ * Packet-oriented encryption for AEAD/NIST_KW: public function.
+ */
+int mbedtls_cipher_auth_encrypt_ext(mbedtls_cipher_context_t* ctx, const unsigned char* iv,
+    size_t iv_len, const unsigned char* ad, size_t ad_len, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t output_len, size_t* olen, size_t tag_len) {
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(iv_len == 0 || iv != NULL);
+    CIPHER_VALIDATE_RET(ad_len == 0 || ad != NULL);
+    CIPHER_VALIDATE_RET(ilen == 0 || input != NULL);
+    CIPHER_VALIDATE_RET(output != NULL);
+    CIPHER_VALIDATE_RET(olen != NULL);
+
+#if defined(MBEDTLS_NIST_KW_C)
+    if (
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+        ctx->psa_enabled == 0 &&
+#endif
+        (MBEDTLS_MODE_KW == ctx->cipher_info->mode || MBEDTLS_MODE_KWP == ctx->cipher_info->mode)) {
+        mbedtls_nist_kw_mode_t mode =
+            (MBEDTLS_MODE_KW == ctx->cipher_info->mode) ? MBEDTLS_KW_MODE_KW : MBEDTLS_KW_MODE_KWP;
+
+        /* There is no iv, tag or ad associated with KW and KWP,
+         * so these length should be 0 as documented. */
+        if (iv_len != 0 || tag_len != 0 || ad_len != 0)
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+        (void)iv;
+        (void)ad;
+
+        return (mbedtls_nist_kw_wrap(ctx->cipher_ctx, mode, input, ilen, output, olen, output_len));
+    }
+#endif /* MBEDTLS_NIST_KW_C */
+
+#if defined(MBEDTLS_CIPHER_MODE_AEAD)
+    /* AEAD case: check length before passing on to shared function */
+    if (output_len < ilen + tag_len)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    int ret = mbedtls_cipher_aead_encrypt(ctx, iv, iv_len, ad, ad_len, input, ilen, output, olen,
+        output + ilen, tag_len);
+    *olen += tag_len;
+    return (ret);
+#else
+    return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+#endif /* MBEDTLS_CIPHER_MODE_AEAD */
+}
+
+/*
+ * Packet-oriented decryption for AEAD/NIST_KW: public function.
+ */
+int mbedtls_cipher_auth_decrypt_ext(mbedtls_cipher_context_t* ctx, const unsigned char* iv,
+    size_t iv_len, const unsigned char* ad, size_t ad_len, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t output_len, size_t* olen, size_t tag_len) {
+    CIPHER_VALIDATE_RET(ctx != NULL);
+    CIPHER_VALIDATE_RET(iv_len == 0 || iv != NULL);
+    CIPHER_VALIDATE_RET(ad_len == 0 || ad != NULL);
+    CIPHER_VALIDATE_RET(ilen == 0 || input != NULL);
+    CIPHER_VALIDATE_RET(output_len == 0 || output != NULL);
+    CIPHER_VALIDATE_RET(olen != NULL);
+
+#if defined(MBEDTLS_NIST_KW_C)
+    if (
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+        ctx->psa_enabled == 0 &&
+#endif
+        (MBEDTLS_MODE_KW == ctx->cipher_info->mode || MBEDTLS_MODE_KWP == ctx->cipher_info->mode)) {
+        mbedtls_nist_kw_mode_t mode =
+            (MBEDTLS_MODE_KW == ctx->cipher_info->mode) ? MBEDTLS_KW_MODE_KW : MBEDTLS_KW_MODE_KWP;
+
+        /* There is no iv, tag or ad associated with KW and KWP,
+         * so these length should be 0 as documented. */
+        if (iv_len != 0 || tag_len != 0 || ad_len != 0)
+            return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+        (void)iv;
+        (void)ad;
+
+        return (
+            mbedtls_nist_kw_unwrap(ctx->cipher_ctx, mode, input, ilen, output, olen, output_len));
+    }
+#endif /* MBEDTLS_NIST_KW_C */
+
+#if defined(MBEDTLS_CIPHER_MODE_AEAD)
+    /* AEAD case: check length before passing on to shared function */
+    if (ilen < tag_len || output_len < ilen - tag_len)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    return (mbedtls_cipher_aead_decrypt(ctx, iv, iv_len, ad, ad_len, input, ilen - tag_len, output,
+        olen, input + ilen - tag_len, tag_len));
+#else
+    return (MBEDTLS_ERR_CIPHER_FEATURE_UNAVAILABLE);
+#endif /* MBEDTLS_CIPHER_MODE_AEAD */
+}
+#endif /* MBEDTLS_CIPHER_MODE_AEAD || MBEDTLS_NIST_KW_C */
+
+#endif /* MBEDTLS_CIPHER_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/cipher_wrap.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/cipher_wrap.cpp
new file mode 100644
index 0000000000..7de01cc3ac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/cipher_wrap.cpp
@@ -0,0 +1,1439 @@
+/**
+ * \file cipher_wrap.c
+ *
+ * \brief Generic cipher wrapper for mbed TLS
+ *
+ * \author Adriaan de Jong <dejong@fox-it.com>
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_CIPHER_C)
+
+#include "cipher_wrap.h"
+#include "mbedtls/error.h"
+
+#if defined(MBEDTLS_CHACHAPOLY_C)
+#include "mbedtls/chachapoly.h"
+#endif
+
+#if defined(MBEDTLS_AES_C)
+#include "mbedtls/aes.h"
+#endif
+
+#if defined(MBEDTLS_CAMELLIA_C)
+#include "mbedtls/camellia.h"
+#endif
+
+#if defined(MBEDTLS_ARIA_C)
+#include "mbedtls/aria.h"
+#endif
+
+#if defined(MBEDTLS_DES_C)
+#include "mbedtls/des.h"
+#endif
+
+#if defined(MBEDTLS_CHACHA20_C)
+#include "mbedtls/chacha20.h"
+#endif
+
+#if defined(MBEDTLS_GCM_C)
+#include "mbedtls/gcm.h"
+#endif
+
+#if defined(MBEDTLS_CCM_C)
+#include "mbedtls/ccm.h"
+#endif
+
+#if defined(MBEDTLS_NIST_KW_C)
+#include "mbedtls/nist_kw.h"
+#endif
+
+#if defined(MBEDTLS_CIPHER_NULL_CIPHER)
+#include <string.h>
+#endif
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdlib.h>
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif
+
+#if defined(MBEDTLS_GCM_C)
+/* shared by all GCM ciphers */
+static void* gcm_ctx_alloc(void) {
+    void* ctx = mbedtls_calloc(1, sizeof(mbedtls_gcm_context));
+
+    if (ctx != NULL)
+        mbedtls_gcm_init((mbedtls_gcm_context*)ctx);
+
+    return (ctx);
+}
+
+static void gcm_ctx_free(void* ctx) {
+    mbedtls_gcm_free((mbedtls_gcm_context*)ctx);
+    mbedtls_free(ctx);
+}
+#endif /* MBEDTLS_GCM_C */
+
+#if defined(MBEDTLS_CCM_C)
+/* shared by all CCM ciphers */
+static void* ccm_ctx_alloc(void) {
+    void* ctx = mbedtls_calloc(1, sizeof(mbedtls_ccm_context));
+
+    if (ctx != NULL)
+        mbedtls_ccm_init((mbedtls_ccm_context*)ctx);
+
+    return (ctx);
+}
+
+static void ccm_ctx_free(void* ctx) {
+    mbedtls_ccm_free(ctx);
+    mbedtls_free(ctx);
+}
+#endif /* MBEDTLS_CCM_C */
+
+#if defined(MBEDTLS_AES_C)
+
+static int aes_crypt_ecb_wrap(void* ctx, mbedtls_operation_t operation, const unsigned char* input,
+    unsigned char* output) {
+    return mbedtls_aes_crypt_ecb((mbedtls_aes_context*)ctx, operation, input, output);
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static int aes_crypt_cbc_wrap(void* ctx, mbedtls_operation_t operation, size_t length,
+    unsigned char* iv, const unsigned char* input, unsigned char* output) {
+    return mbedtls_aes_crypt_cbc((mbedtls_aes_context*)ctx, operation, length, iv, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+static int aes_crypt_cfb128_wrap(void* ctx, mbedtls_operation_t operation, size_t length,
+    size_t* iv_off, unsigned char* iv, const unsigned char* input, unsigned char* output) {
+    return mbedtls_aes_crypt_cfb128((mbedtls_aes_context*)ctx, operation, length, iv_off, iv, input,
+        output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+static int aes_crypt_ofb_wrap(void* ctx, size_t length, size_t* iv_off, unsigned char* iv,
+    const unsigned char* input, unsigned char* output) {
+    return mbedtls_aes_crypt_ofb((mbedtls_aes_context*)ctx, length, iv_off, iv, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_OFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+static int aes_crypt_ctr_wrap(void* ctx, size_t length, size_t* nc_off,
+    unsigned char* nonce_counter, unsigned char* stream_block, const unsigned char* input,
+    unsigned char* output) {
+    return mbedtls_aes_crypt_ctr((mbedtls_aes_context*)ctx, length, nc_off, nonce_counter,
+        stream_block, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+static int aes_crypt_xts_wrap(void* ctx, mbedtls_operation_t operation, size_t length,
+    const unsigned char data_unit[16], const unsigned char* input, unsigned char* output) {
+    mbedtls_aes_xts_context* xts_ctx = ctx;
+    int mode;
+
+    switch (operation) {
+    case MBEDTLS_ENCRYPT:
+        mode = MBEDTLS_AES_ENCRYPT;
+        break;
+    case MBEDTLS_DECRYPT:
+        mode = MBEDTLS_AES_DECRYPT;
+        break;
+    default:
+        return MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA;
+    }
+
+    return mbedtls_aes_crypt_xts(xts_ctx, mode, length, data_unit, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+static int aes_setkey_dec_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_aes_setkey_dec((mbedtls_aes_context*)ctx, key, key_bitlen);
+}
+
+static int aes_setkey_enc_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_aes_setkey_enc((mbedtls_aes_context*)ctx, key, key_bitlen);
+}
+
+static void* aes_ctx_alloc(void) {
+    mbedtls_aes_context* aes = (mbedtls_aes_context*)mbedtls_calloc(1, sizeof(mbedtls_aes_context));
+
+    if (aes == NULL)
+        return (NULL);
+
+    mbedtls_aes_init(aes);
+
+    return (aes);
+}
+
+static void aes_ctx_free(void* ctx) {
+    mbedtls_aes_free((mbedtls_aes_context*)ctx);
+    mbedtls_free(ctx);
+}
+
+static const mbedtls_cipher_base_t aes_info = {MBEDTLS_CIPHER_ID_AES, aes_crypt_ecb_wrap,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    aes_crypt_cbc_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    aes_crypt_cfb128_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    aes_crypt_ofb_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    aes_crypt_ctr_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    aes_setkey_enc_wrap, aes_setkey_dec_wrap, aes_ctx_alloc, aes_ctx_free};
+
+static const mbedtls_cipher_info_t aes_128_ecb_info = {MBEDTLS_CIPHER_AES_128_ECB, MBEDTLS_MODE_ECB,
+    128, "AES-128-ECB", 0, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_192_ecb_info = {MBEDTLS_CIPHER_AES_192_ECB, MBEDTLS_MODE_ECB,
+    192, "AES-192-ECB", 0, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_256_ecb_info = {MBEDTLS_CIPHER_AES_256_ECB, MBEDTLS_MODE_ECB,
+    256, "AES-256-ECB", 0, 0, 16, &aes_info};
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static const mbedtls_cipher_info_t aes_128_cbc_info = {MBEDTLS_CIPHER_AES_128_CBC, MBEDTLS_MODE_CBC,
+    128, "AES-128-CBC", 16, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_192_cbc_info = {MBEDTLS_CIPHER_AES_192_CBC, MBEDTLS_MODE_CBC,
+    192, "AES-192-CBC", 16, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_256_cbc_info = {MBEDTLS_CIPHER_AES_256_CBC, MBEDTLS_MODE_CBC,
+    256, "AES-256-CBC", 16, 0, 16, &aes_info};
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+static const mbedtls_cipher_info_t aes_128_cfb128_info = {MBEDTLS_CIPHER_AES_128_CFB128,
+    MBEDTLS_MODE_CFB, 128, "AES-128-CFB128", 16, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_192_cfb128_info = {MBEDTLS_CIPHER_AES_192_CFB128,
+    MBEDTLS_MODE_CFB, 192, "AES-192-CFB128", 16, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_256_cfb128_info = {MBEDTLS_CIPHER_AES_256_CFB128,
+    MBEDTLS_MODE_CFB, 256, "AES-256-CFB128", 16, 0, 16, &aes_info};
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+static const mbedtls_cipher_info_t aes_128_ofb_info = {MBEDTLS_CIPHER_AES_128_OFB, MBEDTLS_MODE_OFB,
+    128, "AES-128-OFB", 16, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_192_ofb_info = {MBEDTLS_CIPHER_AES_192_OFB, MBEDTLS_MODE_OFB,
+    192, "AES-192-OFB", 16, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_256_ofb_info = {MBEDTLS_CIPHER_AES_256_OFB, MBEDTLS_MODE_OFB,
+    256, "AES-256-OFB", 16, 0, 16, &aes_info};
+#endif /* MBEDTLS_CIPHER_MODE_OFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+static const mbedtls_cipher_info_t aes_128_ctr_info = {MBEDTLS_CIPHER_AES_128_CTR, MBEDTLS_MODE_CTR,
+    128, "AES-128-CTR", 16, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_192_ctr_info = {MBEDTLS_CIPHER_AES_192_CTR, MBEDTLS_MODE_CTR,
+    192, "AES-192-CTR", 16, 0, 16, &aes_info};
+
+static const mbedtls_cipher_info_t aes_256_ctr_info = {MBEDTLS_CIPHER_AES_256_CTR, MBEDTLS_MODE_CTR,
+    256, "AES-256-CTR", 16, 0, 16, &aes_info};
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+static int xts_aes_setkey_enc_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    mbedtls_aes_xts_context* xts_ctx = ctx;
+    return (mbedtls_aes_xts_setkey_enc(xts_ctx, key, key_bitlen));
+}
+
+static int xts_aes_setkey_dec_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    mbedtls_aes_xts_context* xts_ctx = ctx;
+    return (mbedtls_aes_xts_setkey_dec(xts_ctx, key, key_bitlen));
+}
+
+static void* xts_aes_ctx_alloc(void) {
+    mbedtls_aes_xts_context* xts_ctx = mbedtls_calloc(1, sizeof(*xts_ctx));
+
+    if (xts_ctx != NULL)
+        mbedtls_aes_xts_init(xts_ctx);
+
+    return (xts_ctx);
+}
+
+static void xts_aes_ctx_free(void* ctx) {
+    mbedtls_aes_xts_context* xts_ctx = ctx;
+
+    if (xts_ctx == NULL)
+        return;
+
+    mbedtls_aes_xts_free(xts_ctx);
+    mbedtls_free(xts_ctx);
+}
+
+static const mbedtls_cipher_base_t xts_aes_info = {MBEDTLS_CIPHER_ID_AES, NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    aes_crypt_xts_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    xts_aes_setkey_enc_wrap, xts_aes_setkey_dec_wrap, xts_aes_ctx_alloc, xts_aes_ctx_free};
+
+static const mbedtls_cipher_info_t aes_128_xts_info = {MBEDTLS_CIPHER_AES_128_XTS, MBEDTLS_MODE_XTS,
+    256, "AES-128-XTS", 16, 0, 16, &xts_aes_info};
+
+static const mbedtls_cipher_info_t aes_256_xts_info = {MBEDTLS_CIPHER_AES_256_XTS, MBEDTLS_MODE_XTS,
+    512, "AES-256-XTS", 16, 0, 16, &xts_aes_info};
+#endif /* MBEDTLS_CIPHER_MODE_XTS */
+
+#if defined(MBEDTLS_GCM_C)
+static int gcm_aes_setkey_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_gcm_setkey((mbedtls_gcm_context*)ctx, MBEDTLS_CIPHER_ID_AES, key, key_bitlen);
+}
+
+static const mbedtls_cipher_base_t gcm_aes_info = {
+    MBEDTLS_CIPHER_ID_AES,
+    NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    gcm_aes_setkey_wrap,
+    gcm_aes_setkey_wrap,
+    gcm_ctx_alloc,
+    gcm_ctx_free,
+};
+
+static const mbedtls_cipher_info_t aes_128_gcm_info = {MBEDTLS_CIPHER_AES_128_GCM, MBEDTLS_MODE_GCM,
+    128, "AES-128-GCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &gcm_aes_info};
+
+static const mbedtls_cipher_info_t aes_192_gcm_info = {MBEDTLS_CIPHER_AES_192_GCM, MBEDTLS_MODE_GCM,
+    192, "AES-192-GCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &gcm_aes_info};
+
+static const mbedtls_cipher_info_t aes_256_gcm_info = {MBEDTLS_CIPHER_AES_256_GCM, MBEDTLS_MODE_GCM,
+    256, "AES-256-GCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &gcm_aes_info};
+#endif /* MBEDTLS_GCM_C */
+
+#if defined(MBEDTLS_CCM_C)
+static int ccm_aes_setkey_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_ccm_setkey((mbedtls_ccm_context*)ctx, MBEDTLS_CIPHER_ID_AES, key, key_bitlen);
+}
+
+static const mbedtls_cipher_base_t ccm_aes_info = {
+    MBEDTLS_CIPHER_ID_AES,
+    NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    ccm_aes_setkey_wrap,
+    ccm_aes_setkey_wrap,
+    ccm_ctx_alloc,
+    ccm_ctx_free,
+};
+
+static const mbedtls_cipher_info_t aes_128_ccm_info = {MBEDTLS_CIPHER_AES_128_CCM, MBEDTLS_MODE_CCM,
+    128, "AES-128-CCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aes_info};
+
+static const mbedtls_cipher_info_t aes_192_ccm_info = {MBEDTLS_CIPHER_AES_192_CCM, MBEDTLS_MODE_CCM,
+    192, "AES-192-CCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aes_info};
+
+static const mbedtls_cipher_info_t aes_256_ccm_info = {MBEDTLS_CIPHER_AES_256_CCM, MBEDTLS_MODE_CCM,
+    256, "AES-256-CCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aes_info};
+
+static const mbedtls_cipher_info_t aes_128_ccm_star_no_tag_info = {
+    MBEDTLS_CIPHER_AES_128_CCM_STAR_NO_TAG, MBEDTLS_MODE_CCM_STAR_NO_TAG, 128,
+    "AES-128-CCM*-NO-TAG", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aes_info};
+
+static const mbedtls_cipher_info_t aes_192_ccm_star_no_tag_info = {
+    MBEDTLS_CIPHER_AES_192_CCM_STAR_NO_TAG, MBEDTLS_MODE_CCM_STAR_NO_TAG, 192,
+    "AES-192-CCM*-NO-TAG", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aes_info};
+
+static const mbedtls_cipher_info_t aes_256_ccm_star_no_tag_info = {
+    MBEDTLS_CIPHER_AES_256_CCM_STAR_NO_TAG, MBEDTLS_MODE_CCM_STAR_NO_TAG, 256,
+    "AES-256-CCM*-NO-TAG", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aes_info};
+#endif /* MBEDTLS_CCM_C */
+
+#endif /* MBEDTLS_AES_C */
+
+#if defined(MBEDTLS_CAMELLIA_C)
+
+static int camellia_crypt_ecb_wrap(void* ctx, mbedtls_operation_t operation,
+    const unsigned char* input, unsigned char* output) {
+    return mbedtls_camellia_crypt_ecb((mbedtls_camellia_context*)ctx, operation, input, output);
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static int camellia_crypt_cbc_wrap(void* ctx, mbedtls_operation_t operation, size_t length,
+    unsigned char* iv, const unsigned char* input, unsigned char* output) {
+    return mbedtls_camellia_crypt_cbc((mbedtls_camellia_context*)ctx, operation, length, iv, input,
+        output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+static int camellia_crypt_cfb128_wrap(void* ctx, mbedtls_operation_t operation, size_t length,
+    size_t* iv_off, unsigned char* iv, const unsigned char* input, unsigned char* output) {
+    return mbedtls_camellia_crypt_cfb128((mbedtls_camellia_context*)ctx, operation, length, iv_off,
+        iv, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+static int camellia_crypt_ctr_wrap(void* ctx, size_t length, size_t* nc_off,
+    unsigned char* nonce_counter, unsigned char* stream_block, const unsigned char* input,
+    unsigned char* output) {
+    return mbedtls_camellia_crypt_ctr((mbedtls_camellia_context*)ctx, length, nc_off, nonce_counter,
+        stream_block, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+static int camellia_setkey_dec_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_camellia_setkey_dec((mbedtls_camellia_context*)ctx, key, key_bitlen);
+}
+
+static int camellia_setkey_enc_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_camellia_setkey_enc((mbedtls_camellia_context*)ctx, key, key_bitlen);
+}
+
+static void* camellia_ctx_alloc(void) {
+    mbedtls_camellia_context* ctx;
+    ctx = (mbedtls_camellia_context*)mbedtls_calloc(1, sizeof(mbedtls_camellia_context));
+
+    if (ctx == NULL)
+        return (NULL);
+
+    mbedtls_camellia_init(ctx);
+
+    return (ctx);
+}
+
+static void camellia_ctx_free(void* ctx) {
+    mbedtls_camellia_free((mbedtls_camellia_context*)ctx);
+    mbedtls_free(ctx);
+}
+
+static const mbedtls_cipher_base_t camellia_info = {MBEDTLS_CIPHER_ID_CAMELLIA,
+    camellia_crypt_ecb_wrap,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    camellia_crypt_cbc_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    camellia_crypt_cfb128_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    camellia_crypt_ctr_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    camellia_setkey_enc_wrap, camellia_setkey_dec_wrap, camellia_ctx_alloc, camellia_ctx_free};
+
+static const mbedtls_cipher_info_t camellia_128_ecb_info = {MBEDTLS_CIPHER_CAMELLIA_128_ECB,
+    MBEDTLS_MODE_ECB, 128, "CAMELLIA-128-ECB", 0, 0, 16, &camellia_info};
+
+static const mbedtls_cipher_info_t camellia_192_ecb_info = {MBEDTLS_CIPHER_CAMELLIA_192_ECB,
+    MBEDTLS_MODE_ECB, 192, "CAMELLIA-192-ECB", 0, 0, 16, &camellia_info};
+
+static const mbedtls_cipher_info_t camellia_256_ecb_info = {MBEDTLS_CIPHER_CAMELLIA_256_ECB,
+    MBEDTLS_MODE_ECB, 256, "CAMELLIA-256-ECB", 0, 0, 16, &camellia_info};
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static const mbedtls_cipher_info_t camellia_128_cbc_info = {MBEDTLS_CIPHER_CAMELLIA_128_CBC,
+    MBEDTLS_MODE_CBC, 128, "CAMELLIA-128-CBC", 16, 0, 16, &camellia_info};
+
+static const mbedtls_cipher_info_t camellia_192_cbc_info = {MBEDTLS_CIPHER_CAMELLIA_192_CBC,
+    MBEDTLS_MODE_CBC, 192, "CAMELLIA-192-CBC", 16, 0, 16, &camellia_info};
+
+static const mbedtls_cipher_info_t camellia_256_cbc_info = {MBEDTLS_CIPHER_CAMELLIA_256_CBC,
+    MBEDTLS_MODE_CBC, 256, "CAMELLIA-256-CBC", 16, 0, 16, &camellia_info};
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+static const mbedtls_cipher_info_t camellia_128_cfb128_info = {MBEDTLS_CIPHER_CAMELLIA_128_CFB128,
+    MBEDTLS_MODE_CFB, 128, "CAMELLIA-128-CFB128", 16, 0, 16, &camellia_info};
+
+static const mbedtls_cipher_info_t camellia_192_cfb128_info = {MBEDTLS_CIPHER_CAMELLIA_192_CFB128,
+    MBEDTLS_MODE_CFB, 192, "CAMELLIA-192-CFB128", 16, 0, 16, &camellia_info};
+
+static const mbedtls_cipher_info_t camellia_256_cfb128_info = {MBEDTLS_CIPHER_CAMELLIA_256_CFB128,
+    MBEDTLS_MODE_CFB, 256, "CAMELLIA-256-CFB128", 16, 0, 16, &camellia_info};
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+static const mbedtls_cipher_info_t camellia_128_ctr_info = {MBEDTLS_CIPHER_CAMELLIA_128_CTR,
+    MBEDTLS_MODE_CTR, 128, "CAMELLIA-128-CTR", 16, 0, 16, &camellia_info};
+
+static const mbedtls_cipher_info_t camellia_192_ctr_info = {MBEDTLS_CIPHER_CAMELLIA_192_CTR,
+    MBEDTLS_MODE_CTR, 192, "CAMELLIA-192-CTR", 16, 0, 16, &camellia_info};
+
+static const mbedtls_cipher_info_t camellia_256_ctr_info = {MBEDTLS_CIPHER_CAMELLIA_256_CTR,
+    MBEDTLS_MODE_CTR, 256, "CAMELLIA-256-CTR", 16, 0, 16, &camellia_info};
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#if defined(MBEDTLS_GCM_C)
+static int gcm_camellia_setkey_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_gcm_setkey((mbedtls_gcm_context*)ctx, MBEDTLS_CIPHER_ID_CAMELLIA, key,
+        key_bitlen);
+}
+
+static const mbedtls_cipher_base_t gcm_camellia_info = {
+    MBEDTLS_CIPHER_ID_CAMELLIA,
+    NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    gcm_camellia_setkey_wrap,
+    gcm_camellia_setkey_wrap,
+    gcm_ctx_alloc,
+    gcm_ctx_free,
+};
+
+static const mbedtls_cipher_info_t camellia_128_gcm_info = {MBEDTLS_CIPHER_CAMELLIA_128_GCM,
+    MBEDTLS_MODE_GCM, 128, "CAMELLIA-128-GCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16,
+    &gcm_camellia_info};
+
+static const mbedtls_cipher_info_t camellia_192_gcm_info = {MBEDTLS_CIPHER_CAMELLIA_192_GCM,
+    MBEDTLS_MODE_GCM, 192, "CAMELLIA-192-GCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16,
+    &gcm_camellia_info};
+
+static const mbedtls_cipher_info_t camellia_256_gcm_info = {MBEDTLS_CIPHER_CAMELLIA_256_GCM,
+    MBEDTLS_MODE_GCM, 256, "CAMELLIA-256-GCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16,
+    &gcm_camellia_info};
+#endif /* MBEDTLS_GCM_C */
+
+#if defined(MBEDTLS_CCM_C)
+static int ccm_camellia_setkey_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_ccm_setkey((mbedtls_ccm_context*)ctx, MBEDTLS_CIPHER_ID_CAMELLIA, key,
+        key_bitlen);
+}
+
+static const mbedtls_cipher_base_t ccm_camellia_info = {
+    MBEDTLS_CIPHER_ID_CAMELLIA,
+    NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    ccm_camellia_setkey_wrap,
+    ccm_camellia_setkey_wrap,
+    ccm_ctx_alloc,
+    ccm_ctx_free,
+};
+
+static const mbedtls_cipher_info_t camellia_128_ccm_info = {MBEDTLS_CIPHER_CAMELLIA_128_CCM,
+    MBEDTLS_MODE_CCM, 128, "CAMELLIA-128-CCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16,
+    &ccm_camellia_info};
+
+static const mbedtls_cipher_info_t camellia_192_ccm_info = {MBEDTLS_CIPHER_CAMELLIA_192_CCM,
+    MBEDTLS_MODE_CCM, 192, "CAMELLIA-192-CCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16,
+    &ccm_camellia_info};
+
+static const mbedtls_cipher_info_t camellia_256_ccm_info = {MBEDTLS_CIPHER_CAMELLIA_256_CCM,
+    MBEDTLS_MODE_CCM, 256, "CAMELLIA-256-CCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16,
+    &ccm_camellia_info};
+
+static const mbedtls_cipher_info_t camellia_128_ccm_star_no_tag_info = {
+    MBEDTLS_CIPHER_CAMELLIA_128_CCM_STAR_NO_TAG, MBEDTLS_MODE_CCM_STAR_NO_TAG, 128,
+    "CAMELLIA-128-CCM*-NO-TAG", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_camellia_info};
+
+static const mbedtls_cipher_info_t camellia_192_ccm_star_no_tag_info = {
+    MBEDTLS_CIPHER_CAMELLIA_192_CCM_STAR_NO_TAG, MBEDTLS_MODE_CCM_STAR_NO_TAG, 192,
+    "CAMELLIA-192-CCM*-NO-TAG", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_camellia_info};
+
+static const mbedtls_cipher_info_t camellia_256_ccm_star_no_tag_info = {
+    MBEDTLS_CIPHER_CAMELLIA_256_CCM_STAR_NO_TAG, MBEDTLS_MODE_CCM_STAR_NO_TAG, 256,
+    "CAMELLIA-256-CCM*-NO-TAG", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_camellia_info};
+#endif /* MBEDTLS_CCM_C */
+
+#endif /* MBEDTLS_CAMELLIA_C */
+
+#if defined(MBEDTLS_ARIA_C)
+
+static int aria_crypt_ecb_wrap(void* ctx, mbedtls_operation_t operation, const unsigned char* input,
+    unsigned char* output) {
+    (void)operation;
+    return mbedtls_aria_crypt_ecb((mbedtls_aria_context*)ctx, input, output);
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static int aria_crypt_cbc_wrap(void* ctx, mbedtls_operation_t operation, size_t length,
+    unsigned char* iv, const unsigned char* input, unsigned char* output) {
+    return mbedtls_aria_crypt_cbc((mbedtls_aria_context*)ctx, operation, length, iv, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+static int aria_crypt_cfb128_wrap(void* ctx, mbedtls_operation_t operation, size_t length,
+    size_t* iv_off, unsigned char* iv, const unsigned char* input, unsigned char* output) {
+    return mbedtls_aria_crypt_cfb128((mbedtls_aria_context*)ctx, operation, length, iv_off, iv,
+        input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+static int aria_crypt_ctr_wrap(void* ctx, size_t length, size_t* nc_off,
+    unsigned char* nonce_counter, unsigned char* stream_block, const unsigned char* input,
+    unsigned char* output) {
+    return mbedtls_aria_crypt_ctr((mbedtls_aria_context*)ctx, length, nc_off, nonce_counter,
+        stream_block, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+static int aria_setkey_dec_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_aria_setkey_dec((mbedtls_aria_context*)ctx, key, key_bitlen);
+}
+
+static int aria_setkey_enc_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_aria_setkey_enc((mbedtls_aria_context*)ctx, key, key_bitlen);
+}
+
+static void* aria_ctx_alloc(void) {
+    mbedtls_aria_context* ctx;
+    ctx = (mbedtls_aria_context*)mbedtls_calloc(1, sizeof(mbedtls_aria_context));
+
+    if (ctx == NULL)
+        return (NULL);
+
+    mbedtls_aria_init(ctx);
+
+    return (ctx);
+}
+
+static void aria_ctx_free(void* ctx) {
+    mbedtls_aria_free((mbedtls_aria_context*)ctx);
+    mbedtls_free(ctx);
+}
+
+static const mbedtls_cipher_base_t aria_info = {MBEDTLS_CIPHER_ID_ARIA, aria_crypt_ecb_wrap,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    aria_crypt_cbc_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    aria_crypt_cfb128_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    aria_crypt_ctr_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    aria_setkey_enc_wrap, aria_setkey_dec_wrap, aria_ctx_alloc, aria_ctx_free};
+
+static const mbedtls_cipher_info_t aria_128_ecb_info = {MBEDTLS_CIPHER_ARIA_128_ECB,
+    MBEDTLS_MODE_ECB, 128, "ARIA-128-ECB", 0, 0, 16, &aria_info};
+
+static const mbedtls_cipher_info_t aria_192_ecb_info = {MBEDTLS_CIPHER_ARIA_192_ECB,
+    MBEDTLS_MODE_ECB, 192, "ARIA-192-ECB", 0, 0, 16, &aria_info};
+
+static const mbedtls_cipher_info_t aria_256_ecb_info = {MBEDTLS_CIPHER_ARIA_256_ECB,
+    MBEDTLS_MODE_ECB, 256, "ARIA-256-ECB", 0, 0, 16, &aria_info};
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static const mbedtls_cipher_info_t aria_128_cbc_info = {MBEDTLS_CIPHER_ARIA_128_CBC,
+    MBEDTLS_MODE_CBC, 128, "ARIA-128-CBC", 16, 0, 16, &aria_info};
+
+static const mbedtls_cipher_info_t aria_192_cbc_info = {MBEDTLS_CIPHER_ARIA_192_CBC,
+    MBEDTLS_MODE_CBC, 192, "ARIA-192-CBC", 16, 0, 16, &aria_info};
+
+static const mbedtls_cipher_info_t aria_256_cbc_info = {MBEDTLS_CIPHER_ARIA_256_CBC,
+    MBEDTLS_MODE_CBC, 256, "ARIA-256-CBC", 16, 0, 16, &aria_info};
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+static const mbedtls_cipher_info_t aria_128_cfb128_info = {MBEDTLS_CIPHER_ARIA_128_CFB128,
+    MBEDTLS_MODE_CFB, 128, "ARIA-128-CFB128", 16, 0, 16, &aria_info};
+
+static const mbedtls_cipher_info_t aria_192_cfb128_info = {MBEDTLS_CIPHER_ARIA_192_CFB128,
+    MBEDTLS_MODE_CFB, 192, "ARIA-192-CFB128", 16, 0, 16, &aria_info};
+
+static const mbedtls_cipher_info_t aria_256_cfb128_info = {MBEDTLS_CIPHER_ARIA_256_CFB128,
+    MBEDTLS_MODE_CFB, 256, "ARIA-256-CFB128", 16, 0, 16, &aria_info};
+#endif /* MBEDTLS_CIPHER_MODE_CFB */
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+static const mbedtls_cipher_info_t aria_128_ctr_info = {MBEDTLS_CIPHER_ARIA_128_CTR,
+    MBEDTLS_MODE_CTR, 128, "ARIA-128-CTR", 16, 0, 16, &aria_info};
+
+static const mbedtls_cipher_info_t aria_192_ctr_info = {MBEDTLS_CIPHER_ARIA_192_CTR,
+    MBEDTLS_MODE_CTR, 192, "ARIA-192-CTR", 16, 0, 16, &aria_info};
+
+static const mbedtls_cipher_info_t aria_256_ctr_info = {MBEDTLS_CIPHER_ARIA_256_CTR,
+    MBEDTLS_MODE_CTR, 256, "ARIA-256-CTR", 16, 0, 16, &aria_info};
+#endif /* MBEDTLS_CIPHER_MODE_CTR */
+
+#if defined(MBEDTLS_GCM_C)
+static int gcm_aria_setkey_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_gcm_setkey((mbedtls_gcm_context*)ctx, MBEDTLS_CIPHER_ID_ARIA, key, key_bitlen);
+}
+
+static const mbedtls_cipher_base_t gcm_aria_info = {
+    MBEDTLS_CIPHER_ID_ARIA,
+    NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    gcm_aria_setkey_wrap,
+    gcm_aria_setkey_wrap,
+    gcm_ctx_alloc,
+    gcm_ctx_free,
+};
+
+static const mbedtls_cipher_info_t aria_128_gcm_info = {MBEDTLS_CIPHER_ARIA_128_GCM,
+    MBEDTLS_MODE_GCM, 128, "ARIA-128-GCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &gcm_aria_info};
+
+static const mbedtls_cipher_info_t aria_192_gcm_info = {MBEDTLS_CIPHER_ARIA_192_GCM,
+    MBEDTLS_MODE_GCM, 192, "ARIA-192-GCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &gcm_aria_info};
+
+static const mbedtls_cipher_info_t aria_256_gcm_info = {MBEDTLS_CIPHER_ARIA_256_GCM,
+    MBEDTLS_MODE_GCM, 256, "ARIA-256-GCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &gcm_aria_info};
+#endif /* MBEDTLS_GCM_C */
+
+#if defined(MBEDTLS_CCM_C)
+static int ccm_aria_setkey_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_ccm_setkey((mbedtls_ccm_context*)ctx, MBEDTLS_CIPHER_ID_ARIA, key, key_bitlen);
+}
+
+static const mbedtls_cipher_base_t ccm_aria_info = {
+    MBEDTLS_CIPHER_ID_ARIA,
+    NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    ccm_aria_setkey_wrap,
+    ccm_aria_setkey_wrap,
+    ccm_ctx_alloc,
+    ccm_ctx_free,
+};
+
+static const mbedtls_cipher_info_t aria_128_ccm_info = {MBEDTLS_CIPHER_ARIA_128_CCM,
+    MBEDTLS_MODE_CCM, 128, "ARIA-128-CCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aria_info};
+
+static const mbedtls_cipher_info_t aria_192_ccm_info = {MBEDTLS_CIPHER_ARIA_192_CCM,
+    MBEDTLS_MODE_CCM, 192, "ARIA-192-CCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aria_info};
+
+static const mbedtls_cipher_info_t aria_256_ccm_info = {MBEDTLS_CIPHER_ARIA_256_CCM,
+    MBEDTLS_MODE_CCM, 256, "ARIA-256-CCM", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aria_info};
+
+static const mbedtls_cipher_info_t aria_128_ccm_star_no_tag_info = {
+    MBEDTLS_CIPHER_ARIA_128_CCM_STAR_NO_TAG, MBEDTLS_MODE_CCM_STAR_NO_TAG, 128,
+    "ARIA-128-CCM*-NO-TAG", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aria_info};
+
+static const mbedtls_cipher_info_t aria_192_ccm_star_no_tag_info = {
+    MBEDTLS_CIPHER_ARIA_192_CCM_STAR_NO_TAG, MBEDTLS_MODE_CCM_STAR_NO_TAG, 192,
+    "ARIA-192-CCM*-NO-TAG", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aria_info};
+
+static const mbedtls_cipher_info_t aria_256_ccm_star_no_tag_info = {
+    MBEDTLS_CIPHER_ARIA_256_CCM_STAR_NO_TAG, MBEDTLS_MODE_CCM_STAR_NO_TAG, 256,
+    "ARIA-256-CCM*-NO-TAG", 12, MBEDTLS_CIPHER_VARIABLE_IV_LEN, 16, &ccm_aria_info};
+#endif /* MBEDTLS_CCM_C */
+
+#endif /* MBEDTLS_ARIA_C */
+
+#if defined(MBEDTLS_DES_C)
+
+static int des_crypt_ecb_wrap(void* ctx, mbedtls_operation_t operation, const unsigned char* input,
+    unsigned char* output) {
+    ((void)operation);
+    return mbedtls_des_crypt_ecb((mbedtls_des_context*)ctx, input, output);
+}
+
+static int des3_crypt_ecb_wrap(void* ctx, mbedtls_operation_t operation, const unsigned char* input,
+    unsigned char* output) {
+    ((void)operation);
+    return mbedtls_des3_crypt_ecb((mbedtls_des3_context*)ctx, input, output);
+}
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static int des_crypt_cbc_wrap(void* ctx, mbedtls_operation_t operation, size_t length,
+    unsigned char* iv, const unsigned char* input, unsigned char* output) {
+    return mbedtls_des_crypt_cbc((mbedtls_des_context*)ctx, operation, length, iv, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static int des3_crypt_cbc_wrap(void* ctx, mbedtls_operation_t operation, size_t length,
+    unsigned char* iv, const unsigned char* input, unsigned char* output) {
+    return mbedtls_des3_crypt_cbc((mbedtls_des3_context*)ctx, operation, length, iv, input, output);
+}
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+static int des_setkey_dec_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    ((void)key_bitlen);
+
+    return mbedtls_des_setkey_dec((mbedtls_des_context*)ctx, key);
+}
+
+static int des_setkey_enc_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    ((void)key_bitlen);
+
+    return mbedtls_des_setkey_enc((mbedtls_des_context*)ctx, key);
+}
+
+static int des3_set2key_dec_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    ((void)key_bitlen);
+
+    return mbedtls_des3_set2key_dec((mbedtls_des3_context*)ctx, key);
+}
+
+static int des3_set2key_enc_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    ((void)key_bitlen);
+
+    return mbedtls_des3_set2key_enc((mbedtls_des3_context*)ctx, key);
+}
+
+static int des3_set3key_dec_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    ((void)key_bitlen);
+
+    return mbedtls_des3_set3key_dec((mbedtls_des3_context*)ctx, key);
+}
+
+static int des3_set3key_enc_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    ((void)key_bitlen);
+
+    return mbedtls_des3_set3key_enc((mbedtls_des3_context*)ctx, key);
+}
+
+static void* des_ctx_alloc(void) {
+    mbedtls_des_context* des = mbedtls_calloc(1, sizeof(mbedtls_des_context));
+
+    if (des == NULL)
+        return (NULL);
+
+    mbedtls_des_init(des);
+
+    return (des);
+}
+
+static void des_ctx_free(void* ctx) {
+    mbedtls_des_free((mbedtls_des_context*)ctx);
+    mbedtls_free(ctx);
+}
+
+static void* des3_ctx_alloc(void) {
+    mbedtls_des3_context* des3;
+    des3 = mbedtls_calloc(1, sizeof(mbedtls_des3_context));
+
+    if (des3 == NULL)
+        return (NULL);
+
+    mbedtls_des3_init(des3);
+
+    return (des3);
+}
+
+static void des3_ctx_free(void* ctx) {
+    mbedtls_des3_free((mbedtls_des3_context*)ctx);
+    mbedtls_free(ctx);
+}
+
+static const mbedtls_cipher_base_t des_info = {MBEDTLS_CIPHER_ID_DES, des_crypt_ecb_wrap,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    des_crypt_cbc_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    des_setkey_enc_wrap, des_setkey_dec_wrap, des_ctx_alloc, des_ctx_free};
+
+static const mbedtls_cipher_info_t des_ecb_info = {MBEDTLS_CIPHER_DES_ECB, MBEDTLS_MODE_ECB,
+    MBEDTLS_KEY_LENGTH_DES, "DES-ECB", 0, 0, 8, &des_info};
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static const mbedtls_cipher_info_t des_cbc_info = {MBEDTLS_CIPHER_DES_CBC, MBEDTLS_MODE_CBC,
+    MBEDTLS_KEY_LENGTH_DES, "DES-CBC", 8, 0, 8, &des_info};
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+static const mbedtls_cipher_base_t des_ede_info = {MBEDTLS_CIPHER_ID_DES, des3_crypt_ecb_wrap,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    des3_crypt_cbc_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    des3_set2key_enc_wrap, des3_set2key_dec_wrap, des3_ctx_alloc, des3_ctx_free};
+
+static const mbedtls_cipher_info_t des_ede_ecb_info = {MBEDTLS_CIPHER_DES_EDE_ECB, MBEDTLS_MODE_ECB,
+    MBEDTLS_KEY_LENGTH_DES_EDE, "DES-EDE-ECB", 0, 0, 8, &des_ede_info};
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static const mbedtls_cipher_info_t des_ede_cbc_info = {MBEDTLS_CIPHER_DES_EDE_CBC, MBEDTLS_MODE_CBC,
+    MBEDTLS_KEY_LENGTH_DES_EDE, "DES-EDE-CBC", 8, 0, 8, &des_ede_info};
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+
+static const mbedtls_cipher_base_t des_ede3_info = {MBEDTLS_CIPHER_ID_3DES, des3_crypt_ecb_wrap,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    des3_crypt_cbc_wrap,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    des3_set3key_enc_wrap, des3_set3key_dec_wrap, des3_ctx_alloc, des3_ctx_free};
+
+static const mbedtls_cipher_info_t des_ede3_ecb_info = {MBEDTLS_CIPHER_DES_EDE3_ECB,
+    MBEDTLS_MODE_ECB, MBEDTLS_KEY_LENGTH_DES_EDE3, "DES-EDE3-ECB", 0, 0, 8, &des_ede3_info};
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+static const mbedtls_cipher_info_t des_ede3_cbc_info = {MBEDTLS_CIPHER_DES_EDE3_CBC,
+    MBEDTLS_MODE_CBC, MBEDTLS_KEY_LENGTH_DES_EDE3, "DES-EDE3-CBC", 8, 0, 8, &des_ede3_info};
+#endif /* MBEDTLS_CIPHER_MODE_CBC */
+#endif /* MBEDTLS_DES_C */
+
+#if defined(MBEDTLS_CHACHA20_C)
+
+static int chacha20_setkey_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    if (key_bitlen != 256U)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    if (0 != mbedtls_chacha20_setkey((mbedtls_chacha20_context*)ctx, key))
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    return (0);
+}
+
+static int chacha20_stream_wrap(void* ctx, size_t length, const unsigned char* input,
+    unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    ret = mbedtls_chacha20_update(ctx, length, input, output);
+    if (ret == MBEDTLS_ERR_CHACHA20_BAD_INPUT_DATA)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    return (ret);
+}
+
+static void* chacha20_ctx_alloc(void) {
+    mbedtls_chacha20_context* ctx;
+    ctx = mbedtls_calloc(1, sizeof(mbedtls_chacha20_context));
+
+    if (ctx == NULL)
+        return (NULL);
+
+    mbedtls_chacha20_init(ctx);
+
+    return (ctx);
+}
+
+static void chacha20_ctx_free(void* ctx) {
+    mbedtls_chacha20_free((mbedtls_chacha20_context*)ctx);
+    mbedtls_free(ctx);
+}
+
+static const mbedtls_cipher_base_t chacha20_base_info = {MBEDTLS_CIPHER_ID_CHACHA20, NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    chacha20_stream_wrap,
+#endif
+    chacha20_setkey_wrap, chacha20_setkey_wrap, chacha20_ctx_alloc, chacha20_ctx_free};
+static const mbedtls_cipher_info_t chacha20_info = {MBEDTLS_CIPHER_CHACHA20, MBEDTLS_MODE_STREAM,
+    256, "CHACHA20", 12, 0, 1, &chacha20_base_info};
+#endif /* MBEDTLS_CHACHA20_C */
+
+#if defined(MBEDTLS_CHACHAPOLY_C)
+
+static int chachapoly_setkey_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    if (key_bitlen != 256U)
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    if (0 != mbedtls_chachapoly_setkey((mbedtls_chachapoly_context*)ctx, key))
+        return (MBEDTLS_ERR_CIPHER_BAD_INPUT_DATA);
+
+    return (0);
+}
+
+static void* chachapoly_ctx_alloc(void) {
+    mbedtls_chachapoly_context* ctx;
+    ctx = mbedtls_calloc(1, sizeof(mbedtls_chachapoly_context));
+
+    if (ctx == NULL)
+        return (NULL);
+
+    mbedtls_chachapoly_init(ctx);
+
+    return (ctx);
+}
+
+static void chachapoly_ctx_free(void* ctx) {
+    mbedtls_chachapoly_free((mbedtls_chachapoly_context*)ctx);
+    mbedtls_free(ctx);
+}
+
+static const mbedtls_cipher_base_t chachapoly_base_info = {MBEDTLS_CIPHER_ID_CHACHA20, NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    chachapoly_setkey_wrap, chachapoly_setkey_wrap, chachapoly_ctx_alloc, chachapoly_ctx_free};
+static const mbedtls_cipher_info_t chachapoly_info = {MBEDTLS_CIPHER_CHACHA20_POLY1305,
+    MBEDTLS_MODE_CHACHAPOLY, 256, "CHACHA20-POLY1305", 12, 0, 1, &chachapoly_base_info};
+#endif /* MBEDTLS_CHACHAPOLY_C */
+
+#if defined(MBEDTLS_CIPHER_NULL_CIPHER)
+static int null_crypt_stream(void* ctx, size_t length, const unsigned char* input,
+    unsigned char* output) {
+    ((void)ctx);
+    memmove(output, input, length);
+    return (0);
+}
+
+static int null_setkey(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    ((void)ctx);
+    ((void)key);
+    ((void)key_bitlen);
+
+    return (0);
+}
+
+static void* null_ctx_alloc(void) {
+    return ((void*)1);
+}
+
+static void null_ctx_free(void* ctx) {
+    ((void)ctx);
+}
+
+static const mbedtls_cipher_base_t null_base_info = {MBEDTLS_CIPHER_ID_NULL, NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    null_crypt_stream,
+#endif
+    null_setkey, null_setkey, null_ctx_alloc, null_ctx_free};
+
+static const mbedtls_cipher_info_t null_cipher_info = {MBEDTLS_CIPHER_NULL, MBEDTLS_MODE_STREAM, 0,
+    "NULL", 0, 0, 1, &null_base_info};
+#endif /* defined(MBEDTLS_CIPHER_NULL_CIPHER) */
+
+#if defined(MBEDTLS_NIST_KW_C)
+static void* kw_ctx_alloc(void) {
+    void* ctx = mbedtls_calloc(1, sizeof(mbedtls_nist_kw_context));
+
+    if (ctx != NULL)
+        mbedtls_nist_kw_init((mbedtls_nist_kw_context*)ctx);
+
+    return (ctx);
+}
+
+static void kw_ctx_free(void* ctx) {
+    mbedtls_nist_kw_free(ctx);
+    mbedtls_free(ctx);
+}
+
+static int kw_aes_setkey_wrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_nist_kw_setkey((mbedtls_nist_kw_context*)ctx, MBEDTLS_CIPHER_ID_AES, key,
+        key_bitlen, 1);
+}
+
+static int kw_aes_setkey_unwrap(void* ctx, const unsigned char* key, unsigned int key_bitlen) {
+    return mbedtls_nist_kw_setkey((mbedtls_nist_kw_context*)ctx, MBEDTLS_CIPHER_ID_AES, key,
+        key_bitlen, 0);
+}
+
+static const mbedtls_cipher_base_t kw_aes_info = {
+    MBEDTLS_CIPHER_ID_AES,
+    NULL,
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    NULL,
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    NULL,
+#endif
+    kw_aes_setkey_wrap,
+    kw_aes_setkey_unwrap,
+    kw_ctx_alloc,
+    kw_ctx_free,
+};
+
+static const mbedtls_cipher_info_t aes_128_nist_kw_info = {MBEDTLS_CIPHER_AES_128_KW,
+    MBEDTLS_MODE_KW, 128, "AES-128-KW", 0, 0, 16, &kw_aes_info};
+
+static const mbedtls_cipher_info_t aes_192_nist_kw_info = {MBEDTLS_CIPHER_AES_192_KW,
+    MBEDTLS_MODE_KW, 192, "AES-192-KW", 0, 0, 16, &kw_aes_info};
+
+static const mbedtls_cipher_info_t aes_256_nist_kw_info = {MBEDTLS_CIPHER_AES_256_KW,
+    MBEDTLS_MODE_KW, 256, "AES-256-KW", 0, 0, 16, &kw_aes_info};
+
+static const mbedtls_cipher_info_t aes_128_nist_kwp_info = {MBEDTLS_CIPHER_AES_128_KWP,
+    MBEDTLS_MODE_KWP, 128, "AES-128-KWP", 0, 0, 16, &kw_aes_info};
+
+static const mbedtls_cipher_info_t aes_192_nist_kwp_info = {MBEDTLS_CIPHER_AES_192_KWP,
+    MBEDTLS_MODE_KWP, 192, "AES-192-KWP", 0, 0, 16, &kw_aes_info};
+
+static const mbedtls_cipher_info_t aes_256_nist_kwp_info = {MBEDTLS_CIPHER_AES_256_KWP,
+    MBEDTLS_MODE_KWP, 256, "AES-256-KWP", 0, 0, 16, &kw_aes_info};
+#endif /* MBEDTLS_NIST_KW_C */
+
+const mbedtls_cipher_definition_t mbedtls_cipher_definitions[] = {
+#if defined(MBEDTLS_AES_C)
+    {MBEDTLS_CIPHER_AES_128_ECB, &aes_128_ecb_info},
+    {MBEDTLS_CIPHER_AES_192_ECB, &aes_192_ecb_info},
+    {MBEDTLS_CIPHER_AES_256_ECB, &aes_256_ecb_info},
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    {MBEDTLS_CIPHER_AES_128_CBC, &aes_128_cbc_info},
+    {MBEDTLS_CIPHER_AES_192_CBC, &aes_192_cbc_info},
+    {MBEDTLS_CIPHER_AES_256_CBC, &aes_256_cbc_info},
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    {MBEDTLS_CIPHER_AES_128_CFB128, &aes_128_cfb128_info},
+    {MBEDTLS_CIPHER_AES_192_CFB128, &aes_192_cfb128_info},
+    {MBEDTLS_CIPHER_AES_256_CFB128, &aes_256_cfb128_info},
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    {MBEDTLS_CIPHER_AES_128_OFB, &aes_128_ofb_info},
+    {MBEDTLS_CIPHER_AES_192_OFB, &aes_192_ofb_info},
+    {MBEDTLS_CIPHER_AES_256_OFB, &aes_256_ofb_info},
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    {MBEDTLS_CIPHER_AES_128_CTR, &aes_128_ctr_info},
+    {MBEDTLS_CIPHER_AES_192_CTR, &aes_192_ctr_info},
+    {MBEDTLS_CIPHER_AES_256_CTR, &aes_256_ctr_info},
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    {MBEDTLS_CIPHER_AES_128_XTS, &aes_128_xts_info},
+    {MBEDTLS_CIPHER_AES_256_XTS, &aes_256_xts_info},
+#endif
+#if defined(MBEDTLS_GCM_C)
+    {MBEDTLS_CIPHER_AES_128_GCM, &aes_128_gcm_info},
+    {MBEDTLS_CIPHER_AES_192_GCM, &aes_192_gcm_info},
+    {MBEDTLS_CIPHER_AES_256_GCM, &aes_256_gcm_info},
+#endif
+#if defined(MBEDTLS_CCM_C)
+    {MBEDTLS_CIPHER_AES_128_CCM, &aes_128_ccm_info},
+    {MBEDTLS_CIPHER_AES_192_CCM, &aes_192_ccm_info},
+    {MBEDTLS_CIPHER_AES_256_CCM, &aes_256_ccm_info},
+    {MBEDTLS_CIPHER_AES_128_CCM_STAR_NO_TAG, &aes_128_ccm_star_no_tag_info},
+    {MBEDTLS_CIPHER_AES_192_CCM_STAR_NO_TAG, &aes_192_ccm_star_no_tag_info},
+    {MBEDTLS_CIPHER_AES_256_CCM_STAR_NO_TAG, &aes_256_ccm_star_no_tag_info},
+#endif
+#endif /* MBEDTLS_AES_C */
+
+#if defined(MBEDTLS_CAMELLIA_C)
+    {MBEDTLS_CIPHER_CAMELLIA_128_ECB, &camellia_128_ecb_info},
+    {MBEDTLS_CIPHER_CAMELLIA_192_ECB, &camellia_192_ecb_info},
+    {MBEDTLS_CIPHER_CAMELLIA_256_ECB, &camellia_256_ecb_info},
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    {MBEDTLS_CIPHER_CAMELLIA_128_CBC, &camellia_128_cbc_info},
+    {MBEDTLS_CIPHER_CAMELLIA_192_CBC, &camellia_192_cbc_info},
+    {MBEDTLS_CIPHER_CAMELLIA_256_CBC, &camellia_256_cbc_info},
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    {MBEDTLS_CIPHER_CAMELLIA_128_CFB128, &camellia_128_cfb128_info},
+    {MBEDTLS_CIPHER_CAMELLIA_192_CFB128, &camellia_192_cfb128_info},
+    {MBEDTLS_CIPHER_CAMELLIA_256_CFB128, &camellia_256_cfb128_info},
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    {MBEDTLS_CIPHER_CAMELLIA_128_CTR, &camellia_128_ctr_info},
+    {MBEDTLS_CIPHER_CAMELLIA_192_CTR, &camellia_192_ctr_info},
+    {MBEDTLS_CIPHER_CAMELLIA_256_CTR, &camellia_256_ctr_info},
+#endif
+#if defined(MBEDTLS_GCM_C)
+    {MBEDTLS_CIPHER_CAMELLIA_128_GCM, &camellia_128_gcm_info},
+    {MBEDTLS_CIPHER_CAMELLIA_192_GCM, &camellia_192_gcm_info},
+    {MBEDTLS_CIPHER_CAMELLIA_256_GCM, &camellia_256_gcm_info},
+#endif
+#if defined(MBEDTLS_CCM_C)
+    {MBEDTLS_CIPHER_CAMELLIA_128_CCM, &camellia_128_ccm_info},
+    {MBEDTLS_CIPHER_CAMELLIA_192_CCM, &camellia_192_ccm_info},
+    {MBEDTLS_CIPHER_CAMELLIA_256_CCM, &camellia_256_ccm_info},
+    {MBEDTLS_CIPHER_CAMELLIA_128_CCM_STAR_NO_TAG, &camellia_128_ccm_star_no_tag_info},
+    {MBEDTLS_CIPHER_CAMELLIA_192_CCM_STAR_NO_TAG, &camellia_192_ccm_star_no_tag_info},
+    {MBEDTLS_CIPHER_CAMELLIA_256_CCM_STAR_NO_TAG, &camellia_256_ccm_star_no_tag_info},
+#endif
+#endif /* MBEDTLS_CAMELLIA_C */
+
+#if defined(MBEDTLS_ARIA_C)
+    {MBEDTLS_CIPHER_ARIA_128_ECB, &aria_128_ecb_info},
+    {MBEDTLS_CIPHER_ARIA_192_ECB, &aria_192_ecb_info},
+    {MBEDTLS_CIPHER_ARIA_256_ECB, &aria_256_ecb_info},
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    {MBEDTLS_CIPHER_ARIA_128_CBC, &aria_128_cbc_info},
+    {MBEDTLS_CIPHER_ARIA_192_CBC, &aria_192_cbc_info},
+    {MBEDTLS_CIPHER_ARIA_256_CBC, &aria_256_cbc_info},
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    {MBEDTLS_CIPHER_ARIA_128_CFB128, &aria_128_cfb128_info},
+    {MBEDTLS_CIPHER_ARIA_192_CFB128, &aria_192_cfb128_info},
+    {MBEDTLS_CIPHER_ARIA_256_CFB128, &aria_256_cfb128_info},
+#endif
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    {MBEDTLS_CIPHER_ARIA_128_CTR, &aria_128_ctr_info},
+    {MBEDTLS_CIPHER_ARIA_192_CTR, &aria_192_ctr_info},
+    {MBEDTLS_CIPHER_ARIA_256_CTR, &aria_256_ctr_info},
+#endif
+#if defined(MBEDTLS_GCM_C)
+    {MBEDTLS_CIPHER_ARIA_128_GCM, &aria_128_gcm_info},
+    {MBEDTLS_CIPHER_ARIA_192_GCM, &aria_192_gcm_info},
+    {MBEDTLS_CIPHER_ARIA_256_GCM, &aria_256_gcm_info},
+#endif
+#if defined(MBEDTLS_CCM_C)
+    {MBEDTLS_CIPHER_ARIA_128_CCM, &aria_128_ccm_info},
+    {MBEDTLS_CIPHER_ARIA_192_CCM, &aria_192_ccm_info},
+    {MBEDTLS_CIPHER_ARIA_256_CCM, &aria_256_ccm_info},
+    {MBEDTLS_CIPHER_ARIA_128_CCM_STAR_NO_TAG, &aria_128_ccm_star_no_tag_info},
+    {MBEDTLS_CIPHER_ARIA_192_CCM_STAR_NO_TAG, &aria_192_ccm_star_no_tag_info},
+    {MBEDTLS_CIPHER_ARIA_256_CCM_STAR_NO_TAG, &aria_256_ccm_star_no_tag_info},
+#endif
+#endif /* MBEDTLS_ARIA_C */
+
+#if defined(MBEDTLS_DES_C)
+    {MBEDTLS_CIPHER_DES_ECB, &des_ecb_info}, {MBEDTLS_CIPHER_DES_EDE_ECB, &des_ede_ecb_info},
+    {MBEDTLS_CIPHER_DES_EDE3_ECB, &des_ede3_ecb_info},
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    {MBEDTLS_CIPHER_DES_CBC, &des_cbc_info}, {MBEDTLS_CIPHER_DES_EDE_CBC, &des_ede_cbc_info},
+    {MBEDTLS_CIPHER_DES_EDE3_CBC, &des_ede3_cbc_info},
+#endif
+#endif /* MBEDTLS_DES_C */
+
+#if defined(MBEDTLS_CHACHA20_C)
+    {MBEDTLS_CIPHER_CHACHA20, &chacha20_info},
+#endif
+
+#if defined(MBEDTLS_CHACHAPOLY_C)
+    {MBEDTLS_CIPHER_CHACHA20_POLY1305, &chachapoly_info},
+#endif
+
+#if defined(MBEDTLS_NIST_KW_C)
+    {MBEDTLS_CIPHER_AES_128_KW, &aes_128_nist_kw_info},
+    {MBEDTLS_CIPHER_AES_192_KW, &aes_192_nist_kw_info},
+    {MBEDTLS_CIPHER_AES_256_KW, &aes_256_nist_kw_info},
+    {MBEDTLS_CIPHER_AES_128_KWP, &aes_128_nist_kwp_info},
+    {MBEDTLS_CIPHER_AES_192_KWP, &aes_192_nist_kwp_info},
+    {MBEDTLS_CIPHER_AES_256_KWP, &aes_256_nist_kwp_info},
+#endif
+
+#if defined(MBEDTLS_CIPHER_NULL_CIPHER)
+    {MBEDTLS_CIPHER_NULL, &null_cipher_info},
+#endif /* MBEDTLS_CIPHER_NULL_CIPHER */
+
+    {MBEDTLS_CIPHER_NONE, NULL}};
+
+#define NUM_CIPHERS (sizeof(mbedtls_cipher_definitions) / sizeof(mbedtls_cipher_definitions[0]))
+int mbedtls_cipher_supported[NUM_CIPHERS];
+
+#endif /* MBEDTLS_CIPHER_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/cipher_wrap.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/cipher_wrap.h
new file mode 100644
index 0000000000..5da60eba5c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/cipher_wrap.h
@@ -0,0 +1,131 @@
+/**
+ * \file cipher_wrap.h
+ *
+ * \brief Cipher wrappers.
+ *
+ * \author Adriaan de Jong <dejong@fox-it.com>
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_CIPHER_WRAP_H
+#define MBEDTLS_CIPHER_WRAP_H
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/cipher.h"
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+#include "psa/crypto.h"
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * Base cipher information. The non-mode specific functions and values.
+ */
+struct mbedtls_cipher_base_t {
+    /** Base Cipher type (e.g. MBEDTLS_CIPHER_ID_AES) */
+    mbedtls_cipher_id_t cipher;
+
+    /** Encrypt using ECB */
+    int (*ecb_func)(void* ctx, mbedtls_operation_t mode, const unsigned char* input,
+        unsigned char* output);
+
+#if defined(MBEDTLS_CIPHER_MODE_CBC)
+    /** Encrypt using CBC */
+    int (*cbc_func)(void* ctx, mbedtls_operation_t mode, size_t length, unsigned char* iv,
+        const unsigned char* input, unsigned char* output);
+#endif
+
+#if defined(MBEDTLS_CIPHER_MODE_CFB)
+    /** Encrypt using CFB (Full length) */
+    int (*cfb_func)(void* ctx, mbedtls_operation_t mode, size_t length, size_t* iv_off,
+        unsigned char* iv, const unsigned char* input, unsigned char* output);
+#endif
+
+#if defined(MBEDTLS_CIPHER_MODE_OFB)
+    /** Encrypt using OFB (Full length) */
+    int (*ofb_func)(void* ctx, size_t length, size_t* iv_off, unsigned char* iv,
+        const unsigned char* input, unsigned char* output);
+#endif
+
+#if defined(MBEDTLS_CIPHER_MODE_CTR)
+    /** Encrypt using CTR */
+    int (*ctr_func)(void* ctx, size_t length, size_t* nc_off, unsigned char* nonce_counter,
+        unsigned char* stream_block, const unsigned char* input, unsigned char* output);
+#endif
+
+#if defined(MBEDTLS_CIPHER_MODE_XTS)
+    /** Encrypt or decrypt using XTS. */
+    int (*xts_func)(void* ctx, mbedtls_operation_t mode, size_t length,
+        const unsigned char data_unit[16], const unsigned char* input, unsigned char* output);
+#endif
+
+#if defined(MBEDTLS_CIPHER_MODE_STREAM)
+    /** Encrypt using STREAM */
+    int (*stream_func)(void* ctx, size_t length, const unsigned char* input, unsigned char* output);
+#endif
+
+    /** Set key for encryption purposes */
+    int (*setkey_enc_func)(void* ctx, const unsigned char* key, unsigned int key_bitlen);
+
+    /** Set key for decryption purposes */
+    int (*setkey_dec_func)(void* ctx, const unsigned char* key, unsigned int key_bitlen);
+
+    /** Allocate a new context */
+    void* (*ctx_alloc_func)(void);
+
+    /** Free the given context */
+    void (*ctx_free_func)(void* ctx);
+};
+
+typedef struct {
+    mbedtls_cipher_type_t type;
+    const mbedtls_cipher_info_t* info;
+} mbedtls_cipher_definition_t;
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+typedef enum {
+    MBEDTLS_CIPHER_PSA_KEY_UNSET = 0,
+    MBEDTLS_CIPHER_PSA_KEY_OWNED,     /* Used for PSA-based cipher contexts which */
+                                      /* use raw key material internally imported */
+                                      /* as a volatile key, and which hence need  */
+                                      /* to destroy that key when the context is  */
+                                      /* freed.                                   */
+    MBEDTLS_CIPHER_PSA_KEY_NOT_OWNED, /* Used for PSA-based cipher contexts   */
+                                      /* which use a key provided by the      */
+                                      /* user, and which hence will not be    */
+                                      /* destroyed when the context is freed. */
+} mbedtls_cipher_psa_key_ownership;
+
+typedef struct {
+    psa_algorithm_t alg;
+    psa_key_id_t slot;
+    mbedtls_cipher_psa_key_ownership slot_state;
+} mbedtls_cipher_context_psa;
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+extern const mbedtls_cipher_definition_t mbedtls_cipher_definitions[];
+
+extern int mbedtls_cipher_supported[];
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* MBEDTLS_CIPHER_WRAP_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/common.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/common.h
new file mode 100644
index 0000000000..1fe2fe6af0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/common.h
@@ -0,0 +1,368 @@
+/**
+ * \file common.h
+ *
+ * \brief Utility macros for internal use in the library
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_LIBRARY_COMMON_H
+#define MBEDTLS_LIBRARY_COMMON_H
+
+#include <stdint.h>
+
+#include "mbedtls/build_info.h"
+
+/** Helper to define a function as static except when building invasive tests.
+ *
+ * If a function is only used inside its own source file and should be
+ * declared `static` to allow the compiler to optimize for code size,
+ * but that function has unit tests, define it with
+ * ```
+ * MBEDTLS_STATIC_TESTABLE int mbedtls_foo(...) { ... }
+ * ```
+ * and declare it in a header in the `library/` directory with
+ * ```
+ * #if defined(MBEDTLS_TEST_HOOKS)
+ * int mbedtls_foo(...);
+ * #endif
+ * ```
+ */
+#if defined(MBEDTLS_TEST_HOOKS)
+#define MBEDTLS_STATIC_TESTABLE
+#else
+#define MBEDTLS_STATIC_TESTABLE static
+#endif
+
+#if defined(MBEDTLS_TEST_HOOKS)
+extern void (*mbedtls_test_hook_test_fail)(const char* test, int line, const char* file);
+#define MBEDTLS_TEST_HOOK_TEST_ASSERT(TEST)                                                        \
+    do {                                                                                           \
+        if ((!(TEST)) && ((*mbedtls_test_hook_test_fail) != NULL)) {                               \
+            (*mbedtls_test_hook_test_fail)(#TEST, __LINE__, __FILE__);                             \
+        }                                                                                          \
+    } while (0)
+#else
+#define MBEDTLS_TEST_HOOK_TEST_ASSERT(TEST)
+#endif /* defined(MBEDTLS_TEST_HOOKS) */
+
+/** Allow library to access its structs' private members.
+ *
+ * Although structs defined in header files are publicly available,
+ * their members are private and should not be accessed by the user.
+ */
+#define MBEDTLS_ALLOW_PRIVATE_ACCESS
+
+/** Byte Reading Macros
+ *
+ * Given a multi-byte integer \p x, MBEDTLS_BYTE_n retrieves the n-th
+ * byte from x, where byte 0 is the least significant byte.
+ */
+#define MBEDTLS_BYTE_0(x) ((uint8_t)((x) & 0xff))
+#define MBEDTLS_BYTE_1(x) ((uint8_t)(((x) >> 8) & 0xff))
+#define MBEDTLS_BYTE_2(x) ((uint8_t)(((x) >> 16) & 0xff))
+#define MBEDTLS_BYTE_3(x) ((uint8_t)(((x) >> 24) & 0xff))
+#define MBEDTLS_BYTE_4(x) ((uint8_t)(((x) >> 32) & 0xff))
+#define MBEDTLS_BYTE_5(x) ((uint8_t)(((x) >> 40) & 0xff))
+#define MBEDTLS_BYTE_6(x) ((uint8_t)(((x) >> 48) & 0xff))
+#define MBEDTLS_BYTE_7(x) ((uint8_t)(((x) >> 56) & 0xff))
+
+/**
+ * Get the unsigned 32 bits integer corresponding to four bytes in
+ * big-endian order (MSB first).
+ *
+ * \param   data    Base address of the memory to get the four bytes from.
+ * \param   offset  Offset from \p data of the first and most significant
+ *                  byte of the four bytes to build the 32 bits unsigned
+ *                  integer from.
+ */
+#ifndef MBEDTLS_GET_UINT32_BE
+#define MBEDTLS_GET_UINT32_BE(data, offset)                                                        \
+    (((uint32_t)(data)[(offset)] << 24) | ((uint32_t)(data)[(offset) + 1] << 16) |                 \
+        ((uint32_t)(data)[(offset) + 2] << 8) | ((uint32_t)(data)[(offset) + 3]))
+#endif
+
+/**
+ * Put in memory a 32 bits unsigned integer in big-endian order.
+ *
+ * \param   n       32 bits unsigned integer to put in memory.
+ * \param   data    Base address of the memory where to put the 32
+ *                  bits unsigned integer in.
+ * \param   offset  Offset from \p data where to put the most significant
+ *                  byte of the 32 bits unsigned integer \p n.
+ */
+#ifndef MBEDTLS_PUT_UINT32_BE
+#define MBEDTLS_PUT_UINT32_BE(n, data, offset)                                                     \
+    {                                                                                              \
+        (data)[(offset)] = MBEDTLS_BYTE_3(n);                                                      \
+        (data)[(offset) + 1] = MBEDTLS_BYTE_2(n);                                                  \
+        (data)[(offset) + 2] = MBEDTLS_BYTE_1(n);                                                  \
+        (data)[(offset) + 3] = MBEDTLS_BYTE_0(n);                                                  \
+    }
+#endif
+
+/**
+ * Get the unsigned 32 bits integer corresponding to four bytes in
+ * little-endian order (LSB first).
+ *
+ * \param   data    Base address of the memory to get the four bytes from.
+ * \param   offset  Offset from \p data of the first and least significant
+ *                  byte of the four bytes to build the 32 bits unsigned
+ *                  integer from.
+ */
+#ifndef MBEDTLS_GET_UINT32_LE
+#define MBEDTLS_GET_UINT32_LE(data, offset)                                                        \
+    (((uint32_t)(data)[(offset)]) | ((uint32_t)(data)[(offset) + 1] << 8) |                        \
+        ((uint32_t)(data)[(offset) + 2] << 16) | ((uint32_t)(data)[(offset) + 3] << 24))
+#endif
+
+/**
+ * Put in memory a 32 bits unsigned integer in little-endian order.
+ *
+ * \param   n       32 bits unsigned integer to put in memory.
+ * \param   data    Base address of the memory where to put the 32
+ *                  bits unsigned integer in.
+ * \param   offset  Offset from \p data where to put the least significant
+ *                  byte of the 32 bits unsigned integer \p n.
+ */
+#ifndef MBEDTLS_PUT_UINT32_LE
+#define MBEDTLS_PUT_UINT32_LE(n, data, offset)                                                     \
+    {                                                                                              \
+        (data)[(offset)] = MBEDTLS_BYTE_0(n);                                                      \
+        (data)[(offset) + 1] = MBEDTLS_BYTE_1(n);                                                  \
+        (data)[(offset) + 2] = MBEDTLS_BYTE_2(n);                                                  \
+        (data)[(offset) + 3] = MBEDTLS_BYTE_3(n);                                                  \
+    }
+#endif
+
+/**
+ * Get the unsigned 16 bits integer corresponding to two bytes in
+ * little-endian order (LSB first).
+ *
+ * \param   data    Base address of the memory to get the two bytes from.
+ * \param   offset  Offset from \p data of the first and least significant
+ *                  byte of the two bytes to build the 16 bits unsigned
+ *                  integer from.
+ */
+#ifndef MBEDTLS_GET_UINT16_LE
+#define MBEDTLS_GET_UINT16_LE(data, offset)                                                        \
+    (((uint16_t)(data)[(offset)]) | ((uint16_t)(data)[(offset) + 1] << 8))
+#endif
+
+/**
+ * Put in memory a 16 bits unsigned integer in little-endian order.
+ *
+ * \param   n       16 bits unsigned integer to put in memory.
+ * \param   data    Base address of the memory where to put the 16
+ *                  bits unsigned integer in.
+ * \param   offset  Offset from \p data where to put the least significant
+ *                  byte of the 16 bits unsigned integer \p n.
+ */
+#ifndef MBEDTLS_PUT_UINT16_LE
+#define MBEDTLS_PUT_UINT16_LE(n, data, offset)                                                     \
+    {                                                                                              \
+        (data)[(offset)] = MBEDTLS_BYTE_0(n);                                                      \
+        (data)[(offset) + 1] = MBEDTLS_BYTE_1(n);                                                  \
+    }
+#endif
+
+/**
+ * Get the unsigned 16 bits integer corresponding to two bytes in
+ * big-endian order (MSB first).
+ *
+ * \param   data    Base address of the memory to get the two bytes from.
+ * \param   offset  Offset from \p data of the first and most significant
+ *                  byte of the two bytes to build the 16 bits unsigned
+ *                  integer from.
+ */
+#ifndef MBEDTLS_GET_UINT16_BE
+#define MBEDTLS_GET_UINT16_BE(data, offset)                                                        \
+    (((uint16_t)(data)[(offset)] << 8) | ((uint16_t)(data)[(offset) + 1]))
+#endif
+
+/**
+ * Put in memory a 16 bits unsigned integer in big-endian order.
+ *
+ * \param   n       16 bits unsigned integer to put in memory.
+ * \param   data    Base address of the memory where to put the 16
+ *                  bits unsigned integer in.
+ * \param   offset  Offset from \p data where to put the most significant
+ *                  byte of the 16 bits unsigned integer \p n.
+ */
+#ifndef MBEDTLS_PUT_UINT16_BE
+#define MBEDTLS_PUT_UINT16_BE(n, data, offset)                                                     \
+    {                                                                                              \
+        (data)[(offset)] = MBEDTLS_BYTE_1(n);                                                      \
+        (data)[(offset) + 1] = MBEDTLS_BYTE_0(n);                                                  \
+    }
+#endif
+
+/**
+ * Get the unsigned 24 bits integer corresponding to three bytes in
+ * big-endian order (MSB first).
+ *
+ * \param   data    Base address of the memory to get the three bytes from.
+ * \param   offset  Offset from \p data of the first and most significant
+ *                  byte of the three bytes to build the 24 bits unsigned
+ *                  integer from.
+ */
+#ifndef MBEDTLS_GET_UINT24_BE
+#define MBEDTLS_GET_UINT24_BE(data, offset)                                                        \
+    (((uint32_t)(data)[(offset)] << 16) | ((uint32_t)(data)[(offset) + 1] << 8) |                  \
+        ((uint32_t)(data)[(offset) + 2]))
+#endif
+
+/**
+ * Put in memory a 24 bits unsigned integer in big-endian order.
+ *
+ * \param   n       24 bits unsigned integer to put in memory.
+ * \param   data    Base address of the memory where to put the 24
+ *                  bits unsigned integer in.
+ * \param   offset  Offset from \p data where to put the most significant
+ *                  byte of the 24 bits unsigned integer \p n.
+ */
+#ifndef MBEDTLS_PUT_UINT24_BE
+#define MBEDTLS_PUT_UINT24_BE(n, data, offset)                                                     \
+    {                                                                                              \
+        (data)[(offset)] = MBEDTLS_BYTE_2(n);                                                      \
+        (data)[(offset) + 1] = MBEDTLS_BYTE_1(n);                                                  \
+        (data)[(offset) + 2] = MBEDTLS_BYTE_0(n);                                                  \
+    }
+#endif
+
+/**
+ * Get the unsigned 24 bits integer corresponding to three bytes in
+ * little-endian order (LSB first).
+ *
+ * \param   data    Base address of the memory to get the three bytes from.
+ * \param   offset  Offset from \p data of the first and least significant
+ *                  byte of the three bytes to build the 24 bits unsigned
+ *                  integer from.
+ */
+#ifndef MBEDTLS_GET_UINT24_LE
+#define MBEDTLS_GET_UINT24_LE(data, offset)                                                        \
+    (((uint32_t)(data)[(offset)]) | ((uint32_t)(data)[(offset) + 1] << 8) |                        \
+        ((uint32_t)(data)[(offset) + 2] << 16))
+#endif
+
+/**
+ * Put in memory a 24 bits unsigned integer in little-endian order.
+ *
+ * \param   n       24 bits unsigned integer to put in memory.
+ * \param   data    Base address of the memory where to put the 24
+ *                  bits unsigned integer in.
+ * \param   offset  Offset from \p data where to put the least significant
+ *                  byte of the 24 bits unsigned integer \p n.
+ */
+#ifndef MBEDTLS_PUT_UINT24_LE
+#define MBEDTLS_PUT_UINT24_LE(n, data, offset)                                                     \
+    {                                                                                              \
+        (data)[(offset)] = MBEDTLS_BYTE_0(n);                                                      \
+        (data)[(offset) + 1] = MBEDTLS_BYTE_1(n);                                                  \
+        (data)[(offset) + 2] = MBEDTLS_BYTE_2(n);                                                  \
+    }
+#endif
+
+/**
+ * Get the unsigned 64 bits integer corresponding to eight bytes in
+ * big-endian order (MSB first).
+ *
+ * \param   data    Base address of the memory to get the eight bytes from.
+ * \param   offset  Offset from \p data of the first and most significant
+ *                  byte of the eight bytes to build the 64 bits unsigned
+ *                  integer from.
+ */
+#ifndef MBEDTLS_GET_UINT64_BE
+#define MBEDTLS_GET_UINT64_BE(data, offset)                                                        \
+    (((uint64_t)(data)[(offset)] << 56) | ((uint64_t)(data)[(offset) + 1] << 48) |                 \
+        ((uint64_t)(data)[(offset) + 2] << 40) | ((uint64_t)(data)[(offset) + 3] << 32) |          \
+        ((uint64_t)(data)[(offset) + 4] << 24) | ((uint64_t)(data)[(offset) + 5] << 16) |          \
+        ((uint64_t)(data)[(offset) + 6] << 8) | ((uint64_t)(data)[(offset) + 7]))
+#endif
+
+/**
+ * Put in memory a 64 bits unsigned integer in big-endian order.
+ *
+ * \param   n       64 bits unsigned integer to put in memory.
+ * \param   data    Base address of the memory where to put the 64
+ *                  bits unsigned integer in.
+ * \param   offset  Offset from \p data where to put the most significant
+ *                  byte of the 64 bits unsigned integer \p n.
+ */
+#ifndef MBEDTLS_PUT_UINT64_BE
+#define MBEDTLS_PUT_UINT64_BE(n, data, offset)                                                     \
+    {                                                                                              \
+        (data)[(offset)] = MBEDTLS_BYTE_7(n);                                                      \
+        (data)[(offset) + 1] = MBEDTLS_BYTE_6(n);                                                  \
+        (data)[(offset) + 2] = MBEDTLS_BYTE_5(n);                                                  \
+        (data)[(offset) + 3] = MBEDTLS_BYTE_4(n);                                                  \
+        (data)[(offset) + 4] = MBEDTLS_BYTE_3(n);                                                  \
+        (data)[(offset) + 5] = MBEDTLS_BYTE_2(n);                                                  \
+        (data)[(offset) + 6] = MBEDTLS_BYTE_1(n);                                                  \
+        (data)[(offset) + 7] = MBEDTLS_BYTE_0(n);                                                  \
+    }
+#endif
+
+/**
+ * Get the unsigned 64 bits integer corresponding to eight bytes in
+ * little-endian order (LSB first).
+ *
+ * \param   data    Base address of the memory to get the eight bytes from.
+ * \param   offset  Offset from \p data of the first and least significant
+ *                  byte of the eight bytes to build the 64 bits unsigned
+ *                  integer from.
+ */
+#ifndef MBEDTLS_GET_UINT64_LE
+#define MBEDTLS_GET_UINT64_LE(data, offset)                                                        \
+    (((uint64_t)(data)[(offset) + 7] << 56) | ((uint64_t)(data)[(offset) + 6] << 48) |             \
+        ((uint64_t)(data)[(offset) + 5] << 40) | ((uint64_t)(data)[(offset) + 4] << 32) |          \
+        ((uint64_t)(data)[(offset) + 3] << 24) | ((uint64_t)(data)[(offset) + 2] << 16) |          \
+        ((uint64_t)(data)[(offset) + 1] << 8) | ((uint64_t)(data)[(offset)]))
+#endif
+
+/**
+ * Put in memory a 64 bits unsigned integer in little-endian order.
+ *
+ * \param   n       64 bits unsigned integer to put in memory.
+ * \param   data    Base address of the memory where to put the 64
+ *                  bits unsigned integer in.
+ * \param   offset  Offset from \p data where to put the least significant
+ *                  byte of the 64 bits unsigned integer \p n.
+ */
+#ifndef MBEDTLS_PUT_UINT64_LE
+#define MBEDTLS_PUT_UINT64_LE(n, data, offset)                                                     \
+    {                                                                                              \
+        (data)[(offset)] = MBEDTLS_BYTE_0(n);                                                      \
+        (data)[(offset) + 1] = MBEDTLS_BYTE_1(n);                                                  \
+        (data)[(offset) + 2] = MBEDTLS_BYTE_2(n);                                                  \
+        (data)[(offset) + 3] = MBEDTLS_BYTE_3(n);                                                  \
+        (data)[(offset) + 4] = MBEDTLS_BYTE_4(n);                                                  \
+        (data)[(offset) + 5] = MBEDTLS_BYTE_5(n);                                                  \
+        (data)[(offset) + 6] = MBEDTLS_BYTE_6(n);                                                  \
+        (data)[(offset) + 7] = MBEDTLS_BYTE_7(n);                                                  \
+    }
+#endif
+
+/* Fix MSVC C99 compatible issue
+ *      MSVC support __func__ from visual studio 2015( 1900 )
+ *      Use MSVC predefine macro to avoid name check fail.
+ */
+#if (defined(_MSC_VER) && (_MSC_VER <= 1900))
+#define /*no-check-names*/ __func__ __FUNCTION__
+#endif
+
+#endif /* MBEDTLS_LIBRARY_COMMON_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/constant_time.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/constant_time.cpp
new file mode 100644
index 0000000000..a010995016
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/constant_time.cpp
@@ -0,0 +1,727 @@
+/**
+ *  Constant-time functions
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+/*
+ * The following functions are implemented without using comparison operators, as those
+ * might be translated to branches by some compilers on some platforms.
+ */
+
+#include "mbedtls/constant_time.h"
+
+#include "common.h"
+#include "constant_time_internal.h"
+#include "mbedtls/error.h"
+#include "mbedtls/platform_util.h"
+
+#if defined(MBEDTLS_BIGNUM_C)
+#include "mbedtls/bignum.h"
+#endif
+
+#if defined(MBEDTLS_SSL_TLS_C)
+#include "ssl_misc.h"
+#endif
+
+#if defined(MBEDTLS_RSA_C)
+#include "mbedtls/rsa.h"
+#endif
+
+#if defined(MBEDTLS_BASE64_C)
+#include "constant_time_invasive.h"
+#endif
+
+#include <string.h>
+
+int mbedtls_ct_memcmp(const void* a, const void* b, size_t n) {
+    size_t i;
+    volatile const unsigned char* A = (volatile const unsigned char*)a;
+    volatile const unsigned char* B = (volatile const unsigned char*)b;
+    volatile unsigned char diff = 0;
+
+    for (i = 0; i < n; i++) {
+        /* Read volatile data in order before computing diff.
+         * This avoids IAR compiler warning:
+         * 'the order of volatile accesses is undefined ..' */
+        unsigned char x = A[i], y = B[i];
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wdeprecated-volatile"
+#pragma clang diagnostic ignored "-Wunknown-warning-option"
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wvolatile"
+        diff |= x ^ y;
+#pragma GCC diagnostic pop
+#pragma clang diagnostic pop
+    }
+
+    return ((int)diff);
+}
+
+unsigned mbedtls_ct_uint_mask(unsigned value) {
+    /* MSVC has a warning about unary minus on unsigned, but this is
+     * well-defined and precisely what we want to do here */
+#if defined(_MSC_VER)
+#pragma warning(push)
+#pragma warning(disable : 4146)
+#endif
+    return (-((value | -value) >> (sizeof(value) * 8 - 1)));
+#if defined(_MSC_VER)
+#pragma warning(pop)
+#endif
+}
+
+#if defined(MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC)
+
+size_t mbedtls_ct_size_mask(size_t value) {
+    /* MSVC has a warning about unary minus on unsigned integer types,
+     * but this is well-defined and precisely what we want to do here. */
+#if defined(_MSC_VER)
+#pragma warning(push)
+#pragma warning(disable : 4146)
+#endif
+    return (-((value | -value) >> (sizeof(value) * 8 - 1)));
+#if defined(_MSC_VER)
+#pragma warning(pop)
+#endif
+}
+
+#endif /* MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC */
+
+#if defined(MBEDTLS_BIGNUM_C)
+
+mbedtls_mpi_uint mbedtls_ct_mpi_uint_mask(mbedtls_mpi_uint value) {
+    /* MSVC has a warning about unary minus on unsigned, but this is
+     * well-defined and precisely what we want to do here */
+#if defined(_MSC_VER)
+#pragma warning(push)
+#pragma warning(disable : 4146)
+#endif
+    return (-((value | -value) >> (sizeof(value) * 8 - 1)));
+#if defined(_MSC_VER)
+#pragma warning(pop)
+#endif
+}
+
+#endif /* MBEDTLS_BIGNUM_C */
+
+#if defined(MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC)
+
+/** Constant-flow mask generation for "less than" comparison:
+ * - if \p x < \p y, return all-bits 1, that is (size_t) -1
+ * - otherwise, return all bits 0, that is 0
+ *
+ * This function can be used to write constant-time code by replacing branches
+ * with bit operations using masks.
+ *
+ * \param x     The first value to analyze.
+ * \param y     The second value to analyze.
+ *
+ * \return      All-bits-one if \p x is less than \p y, otherwise zero.
+ */
+static size_t mbedtls_ct_size_mask_lt(size_t x, size_t y) {
+    /* This has the most significant bit set if and only if x < y */
+    const size_t sub = x - y;
+
+    /* sub1 = (x < y) ? 1 : 0 */
+    const size_t sub1 = sub >> (sizeof(sub) * 8 - 1);
+
+    /* mask = (x < y) ? 0xff... : 0x00... */
+    const size_t mask = mbedtls_ct_size_mask(sub1);
+
+    return (mask);
+}
+
+size_t mbedtls_ct_size_mask_ge(size_t x, size_t y) {
+    return (~mbedtls_ct_size_mask_lt(x, y));
+}
+
+#endif /* MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC */
+
+#if defined(MBEDTLS_BASE64_C)
+
+/* Return 0xff if low <= c <= high, 0 otherwise.
+ *
+ * Constant flow with respect to c.
+ */
+MBEDTLS_STATIC_TESTABLE
+unsigned char mbedtls_ct_uchar_mask_of_range(unsigned char low, unsigned char high,
+    unsigned char c) {
+    /* low_mask is: 0 if low <= c, 0x...ff if low > c */
+    unsigned low_mask = ((unsigned)c - low) >> 8;
+    /* high_mask is: 0 if c <= high, 0x...ff if c > high */
+    unsigned high_mask = ((unsigned)high - c) >> 8;
+    return (~(low_mask | high_mask) & 0xff);
+}
+
+#endif /* MBEDTLS_BASE64_C */
+
+unsigned mbedtls_ct_size_bool_eq(size_t x, size_t y) {
+    /* diff = 0 if x == y, non-zero otherwise */
+    const size_t diff = x ^ y;
+
+    /* MSVC has a warning about unary minus on unsigned integer types,
+     * but this is well-defined and precisely what we want to do here. */
+#if defined(_MSC_VER)
+#pragma warning(push)
+#pragma warning(disable : 4146)
+#endif
+
+    /* diff_msb's most significant bit is equal to x != y */
+    const size_t diff_msb = (diff | (size_t)-diff);
+
+#if defined(_MSC_VER)
+#pragma warning(pop)
+#endif
+
+    /* diff1 = (x != y) ? 1 : 0 */
+    const unsigned diff1 = diff_msb >> (sizeof(diff_msb) * 8 - 1);
+
+    return (1 ^ diff1);
+}
+
+#if defined(MBEDTLS_PKCS1_V15) && defined(MBEDTLS_RSA_C) && !defined(MBEDTLS_RSA_ALT)
+
+/** Constant-flow "greater than" comparison:
+ * return x > y
+ *
+ * This is equivalent to \p x > \p y, but is likely to be compiled
+ * to code using bitwise operation rather than a branch.
+ *
+ * \param x     The first value to analyze.
+ * \param y     The second value to analyze.
+ *
+ * \return      1 if \p x greater than \p y, otherwise 0.
+ */
+static unsigned mbedtls_ct_size_gt(size_t x, size_t y) {
+    /* Return the sign bit (1 for negative) of (y - x). */
+    return ((y - x) >> (sizeof(size_t) * 8 - 1));
+}
+
+#endif /* MBEDTLS_PKCS1_V15 && MBEDTLS_RSA_C && ! MBEDTLS_RSA_ALT */
+
+#if defined(MBEDTLS_BIGNUM_C)
+
+unsigned mbedtls_ct_mpi_uint_lt(const mbedtls_mpi_uint x, const mbedtls_mpi_uint y) {
+    mbedtls_mpi_uint ret;
+    mbedtls_mpi_uint cond;
+
+    /*
+     * Check if the most significant bits (MSB) of the operands are different.
+     */
+    cond = (x ^ y);
+    /*
+     * If the MSB are the same then the difference x-y will be negative (and
+     * have its MSB set to 1 during conversion to unsigned) if and only if x<y.
+     */
+    ret = (x - y) & ~cond;
+    /*
+     * If the MSB are different, then the operand with the MSB of 1 is the
+     * bigger. (That is if y has MSB of 1, then x<y is true and it is false if
+     * the MSB of y is 0.)
+     */
+    ret |= y & cond;
+
+    ret = ret >> (sizeof(mbedtls_mpi_uint) * 8 - 1);
+
+    return (unsigned)ret;
+}
+
+#endif /* MBEDTLS_BIGNUM_C */
+
+unsigned mbedtls_ct_uint_if(unsigned condition, unsigned if1, unsigned if0) {
+    unsigned mask = mbedtls_ct_uint_mask(condition);
+    return ((mask & if1) | (~mask & if0));
+}
+
+#if defined(MBEDTLS_BIGNUM_C)
+
+/** Select between two sign values without branches.
+ *
+ * This is functionally equivalent to `condition ? if1 : if0` but uses only bit
+ * operations in order to avoid branches.
+ *
+ * \note if1 and if0 must be either 1 or -1, otherwise the result
+ *       is undefined.
+ *
+ * \param condition     Condition to test.
+ * \param if1           The first sign; must be either +1 or -1.
+ * \param if0           The second sign; must be either +1 or -1.
+ *
+ * \return  \c if1 if \p condition is nonzero, otherwise \c if0.
+ * */
+static int mbedtls_ct_cond_select_sign(unsigned char condition, int if1, int if0) {
+    /* In order to avoid questions about what we can reasonably assume about
+     * the representations of signed integers, move everything to unsigned
+     * by taking advantage of the fact that if1 and if0 are either +1 or -1. */
+    unsigned uif1 = if1 + 1;
+    unsigned uif0 = if0 + 1;
+
+    /* condition was 0 or 1, mask is 0 or 2 as are uif1 and uif0 */
+    const unsigned mask = condition << 1;
+
+    /* select uif1 or uif0 */
+    unsigned ur = (uif0 & ~mask) | (uif1 & mask);
+
+    /* ur is now 0 or 2, convert back to -1 or +1 */
+    return ((int)ur - 1);
+}
+
+void mbedtls_ct_mpi_uint_cond_assign(size_t n, mbedtls_mpi_uint* dest, const mbedtls_mpi_uint* src,
+    unsigned char condition) {
+    size_t i;
+
+    /* MSVC has a warning about unary minus on unsigned integer types,
+     * but this is well-defined and precisely what we want to do here. */
+#if defined(_MSC_VER)
+#pragma warning(push)
+#pragma warning(disable : 4146)
+#endif
+
+    /* all-bits 1 if condition is 1, all-bits 0 if condition is 0 */
+    const mbedtls_mpi_uint mask = -condition;
+
+#if defined(_MSC_VER)
+#pragma warning(pop)
+#endif
+
+    for (i = 0; i < n; i++)
+        dest[i] = (src[i] & mask) | (dest[i] & ~mask);
+}
+
+#endif /* MBEDTLS_BIGNUM_C */
+
+#if defined(MBEDTLS_BASE64_C)
+
+unsigned char mbedtls_ct_base64_enc_char(unsigned char value) {
+    unsigned char digit = 0;
+    /* For each range of values, if value is in that range, mask digit with
+     * the corresponding value. Since value can only be in a single range,
+     * only at most one masking will change digit. */
+    digit |= mbedtls_ct_uchar_mask_of_range(0, 25, value) & ('A' + value);
+    digit |= mbedtls_ct_uchar_mask_of_range(26, 51, value) & ('a' + value - 26);
+    digit |= mbedtls_ct_uchar_mask_of_range(52, 61, value) & ('0' + value - 52);
+    digit |= mbedtls_ct_uchar_mask_of_range(62, 62, value) & '+';
+    digit |= mbedtls_ct_uchar_mask_of_range(63, 63, value) & '/';
+    return (digit);
+}
+
+signed char mbedtls_ct_base64_dec_value(unsigned char c) {
+    unsigned char val = 0;
+    /* For each range of digits, if c is in that range, mask val with
+     * the corresponding value. Since c can only be in a single range,
+     * only at most one masking will change val. Set val to one plus
+     * the desired value so that it stays 0 if c is in none of the ranges. */
+    val |= mbedtls_ct_uchar_mask_of_range('A', 'Z', c) & (c - 'A' + 0 + 1);
+    val |= mbedtls_ct_uchar_mask_of_range('a', 'z', c) & (c - 'a' + 26 + 1);
+    val |= mbedtls_ct_uchar_mask_of_range('0', '9', c) & (c - '0' + 52 + 1);
+    val |= mbedtls_ct_uchar_mask_of_range('+', '+', c) & (c - '+' + 62 + 1);
+    val |= mbedtls_ct_uchar_mask_of_range('/', '/', c) & (c - '/' + 63 + 1);
+    /* At this point, val is 0 if c is an invalid digit and v+1 if c is
+     * a digit with the value v. */
+    return (val - 1);
+}
+
+#endif /* MBEDTLS_BASE64_C */
+
+#if defined(MBEDTLS_PKCS1_V15) && defined(MBEDTLS_RSA_C) && !defined(MBEDTLS_RSA_ALT)
+
+/** Shift some data towards the left inside a buffer.
+ *
+ * `mbedtls_ct_mem_move_to_left(start, total, offset)` is functionally
+ * equivalent to
+ * ```
+ * memmove(start, start + offset, total - offset);
+ * memset(start + offset, 0, total - offset);
+ * ```
+ * but it strives to use a memory access pattern (and thus total timing)
+ * that does not depend on \p offset. This timing independence comes at
+ * the expense of performance.
+ *
+ * \param start     Pointer to the start of the buffer.
+ * \param total     Total size of the buffer.
+ * \param offset    Offset from which to copy \p total - \p offset bytes.
+ */
+static void mbedtls_ct_mem_move_to_left(void* start, size_t total, size_t offset) {
+    volatile unsigned char* buf = (volatile unsigned char*)start;
+    size_t i, n;
+    if (total == 0)
+        return;
+    for (i = 0; i < total; i++) {
+        unsigned no_op = mbedtls_ct_size_gt(total - offset, i);
+        /* The first `total - offset` passes are a no-op. The last
+         * `offset` passes shift the data one byte to the left and
+         * zero out the last byte. */
+        for (n = 0; n < total - 1; n++) {
+            unsigned char current = buf[n];
+            unsigned char next = buf[n + 1];
+            buf[n] = mbedtls_ct_uint_if(no_op, current, next);
+        }
+        buf[total - 1] = mbedtls_ct_uint_if(no_op, buf[total - 1], 0);
+    }
+}
+
+#endif /* MBEDTLS_PKCS1_V15 && MBEDTLS_RSA_C && ! MBEDTLS_RSA_ALT */
+
+#if defined(MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC)
+
+void mbedtls_ct_memcpy_if_eq(unsigned char* dest, const unsigned char* src, size_t len, size_t c1,
+    size_t c2) {
+    /* mask = c1 == c2 ? 0xff : 0x00 */
+    const size_t equal = mbedtls_ct_size_bool_eq(c1, c2);
+    const unsigned char mask = (unsigned char)mbedtls_ct_size_mask(equal);
+
+    /* dest[i] = c1 == c2 ? src[i] : dest[i] */
+    for (size_t i = 0; i < len; i++)
+        dest[i] = (src[i] & mask) | (dest[i] & ~mask);
+}
+
+void mbedtls_ct_memcpy_offset(unsigned char* dest, const unsigned char* src, size_t offset,
+    size_t offset_min, size_t offset_max, size_t len) {
+    size_t offsetval;
+
+    for (offsetval = offset_min; offsetval <= offset_max; offsetval++) {
+        mbedtls_ct_memcpy_if_eq(dest, src + offsetval, len, offsetval, offset);
+    }
+}
+
+int mbedtls_ct_hmac(mbedtls_md_context_t* ctx, const unsigned char* add_data, size_t add_data_len,
+    const unsigned char* data, size_t data_len_secret, size_t min_data_len, size_t max_data_len,
+    unsigned char* output) {
+    /*
+     * This function breaks the HMAC abstraction and uses the md_clone()
+     * extension to the MD API in order to get constant-flow behaviour.
+     *
+     * HMAC(msg) is defined as HASH(okey + HASH(ikey + msg)) where + means
+     * concatenation, and okey/ikey are the XOR of the key with some fixed bit
+     * patterns (see RFC 2104, sec. 2), which are stored in ctx->hmac_ctx.
+     *
+     * We'll first compute inner_hash = HASH(ikey + msg) by hashing up to
+     * minlen, then cloning the context, and for each byte up to maxlen
+     * finishing up the hash computation, keeping only the correct result.
+     *
+     * Then we only need to compute HASH(okey + inner_hash) and we're done.
+     */
+    const mbedtls_md_type_t md_alg = mbedtls_md_get_type(ctx->md_info);
+    /* TLS 1.2 only supports SHA-384, SHA-256, SHA-1, MD-5,
+     * all of which have the same block size except SHA-384. */
+    const size_t block_size = md_alg == MBEDTLS_MD_SHA384 ? 128 : 64;
+    const unsigned char* const ikey = ctx->hmac_ctx;
+    const unsigned char* const okey = ikey + block_size;
+    const size_t hash_size = mbedtls_md_get_size(ctx->md_info);
+
+    unsigned char aux_out[MBEDTLS_MD_MAX_SIZE];
+    mbedtls_md_context_t aux;
+    size_t offset;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    mbedtls_md_init(&aux);
+
+#define MD_CHK(func_call)                                                                          \
+    do {                                                                                           \
+        ret = (func_call);                                                                         \
+        if (ret != 0)                                                                              \
+            goto cleanup;                                                                          \
+    } while (0)
+
+    MD_CHK(mbedtls_md_setup(&aux, ctx->md_info, 0));
+
+    /* After hmac_start() of hmac_reset(), ikey has already been hashed,
+     * so we can start directly with the message */
+    MD_CHK(mbedtls_md_update(ctx, add_data, add_data_len));
+    MD_CHK(mbedtls_md_update(ctx, data, min_data_len));
+
+    /* For each possible length, compute the hash up to that point */
+    for (offset = min_data_len; offset <= max_data_len; offset++) {
+        MD_CHK(mbedtls_md_clone(&aux, ctx));
+        MD_CHK(mbedtls_md_finish(&aux, aux_out));
+        /* Keep only the correct inner_hash in the output buffer */
+        mbedtls_ct_memcpy_if_eq(output, aux_out, hash_size, offset, data_len_secret);
+
+        if (offset < max_data_len)
+            MD_CHK(mbedtls_md_update(ctx, data + offset, 1));
+    }
+
+    /* The context needs to finish() before it starts() again */
+    MD_CHK(mbedtls_md_finish(ctx, aux_out));
+
+    /* Now compute HASH(okey + inner_hash) */
+    MD_CHK(mbedtls_md_starts(ctx));
+    MD_CHK(mbedtls_md_update(ctx, okey, block_size));
+    MD_CHK(mbedtls_md_update(ctx, output, hash_size));
+    MD_CHK(mbedtls_md_finish(ctx, output));
+
+    /* Done, get ready for next time */
+    MD_CHK(mbedtls_md_hmac_reset(ctx));
+
+#undef MD_CHK
+
+cleanup:
+    mbedtls_md_free(&aux);
+    return (ret);
+}
+
+#endif /* MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC */
+
+#if defined(MBEDTLS_BIGNUM_C)
+
+#define MPI_VALIDATE_RET(cond) MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_MPI_BAD_INPUT_DATA)
+
+/*
+ * Conditionally assign X = Y, without leaking information
+ * about whether the assignment was made or not.
+ * (Leaking information about the respective sizes of X and Y is ok however.)
+ */
+int mbedtls_mpi_safe_cond_assign(mbedtls_mpi* X, const mbedtls_mpi* Y, unsigned char assign) {
+    int ret = 0;
+    size_t i;
+    mbedtls_mpi_uint limb_mask;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(Y != NULL);
+
+    /* all-bits 1 if assign is 1, all-bits 0 if assign is 0 */
+    limb_mask = mbedtls_ct_mpi_uint_mask(assign);
+    ;
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, Y->n));
+
+    X->s = mbedtls_ct_cond_select_sign(assign, Y->s, X->s);
+
+    mbedtls_ct_mpi_uint_cond_assign(Y->n, X->p, Y->p, assign);
+
+    for (i = Y->n; i < X->n; i++)
+        X->p[i] &= ~limb_mask;
+
+cleanup:
+    return (ret);
+}
+
+/*
+ * Conditionally swap X and Y, without leaking information
+ * about whether the swap was made or not.
+ * Here it is not ok to simply swap the pointers, which whould lead to
+ * different memory access patterns when X and Y are used afterwards.
+ */
+int mbedtls_mpi_safe_cond_swap(mbedtls_mpi* X, mbedtls_mpi* Y, unsigned char swap) {
+    int ret, s;
+    size_t i;
+    mbedtls_mpi_uint limb_mask;
+    mbedtls_mpi_uint tmp;
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(Y != NULL);
+
+    if (X == Y)
+        return (0);
+
+    /* all-bits 1 if swap is 1, all-bits 0 if swap is 0 */
+    limb_mask = mbedtls_ct_mpi_uint_mask(swap);
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, Y->n));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_grow(Y, X->n));
+
+    s = X->s;
+    X->s = mbedtls_ct_cond_select_sign(swap, Y->s, X->s);
+    Y->s = mbedtls_ct_cond_select_sign(swap, s, Y->s);
+
+    for (i = 0; i < X->n; i++) {
+        tmp = X->p[i];
+        X->p[i] = (X->p[i] & ~limb_mask) | (Y->p[i] & limb_mask);
+        Y->p[i] = (Y->p[i] & ~limb_mask) | (tmp & limb_mask);
+    }
+
+cleanup:
+    return (ret);
+}
+
+/*
+ * Compare signed values in constant time
+ */
+int mbedtls_mpi_lt_mpi_ct(const mbedtls_mpi* X, const mbedtls_mpi* Y, unsigned* ret) {
+    size_t i;
+    /* The value of any of these variables is either 0 or 1 at all times. */
+    unsigned cond, done, X_is_negative, Y_is_negative;
+
+    MPI_VALIDATE_RET(X != NULL);
+    MPI_VALIDATE_RET(Y != NULL);
+    MPI_VALIDATE_RET(ret != NULL);
+
+    if (X->n != Y->n)
+        return MBEDTLS_ERR_MPI_BAD_INPUT_DATA;
+
+    /*
+     * Set sign_N to 1 if N >= 0, 0 if N < 0.
+     * We know that N->s == 1 if N >= 0 and N->s == -1 if N < 0.
+     */
+    X_is_negative = (X->s & 2) >> 1;
+    Y_is_negative = (Y->s & 2) >> 1;
+
+    /*
+     * If the signs are different, then the positive operand is the bigger.
+     * That is if X is negative (X_is_negative == 1), then X < Y is true and it
+     * is false if X is positive (X_is_negative == 0).
+     */
+    cond = (X_is_negative ^ Y_is_negative);
+    *ret = cond & X_is_negative;
+
+    /*
+     * This is a constant-time function. We might have the result, but we still
+     * need to go through the loop. Record if we have the result already.
+     */
+    done = cond;
+
+    for (i = X->n; i > 0; i--) {
+        /*
+         * If Y->p[i - 1] < X->p[i - 1] then X < Y is true if and only if both
+         * X and Y are negative.
+         *
+         * Again even if we can make a decision, we just mark the result and
+         * the fact that we are done and continue looping.
+         */
+        cond = mbedtls_ct_mpi_uint_lt(Y->p[i - 1], X->p[i - 1]);
+        *ret |= cond & (1 - done) & X_is_negative;
+        done |= cond;
+
+        /*
+         * If X->p[i - 1] < Y->p[i - 1] then X < Y is true if and only if both
+         * X and Y are positive.
+         *
+         * Again even if we can make a decision, we just mark the result and
+         * the fact that we are done and continue looping.
+         */
+        cond = mbedtls_ct_mpi_uint_lt(X->p[i - 1], Y->p[i - 1]);
+        *ret |= cond & (1 - done) & (1 - X_is_negative);
+        done |= cond;
+    }
+
+    return (0);
+}
+
+#endif /* MBEDTLS_BIGNUM_C */
+
+#if defined(MBEDTLS_PKCS1_V15) && defined(MBEDTLS_RSA_C) && !defined(MBEDTLS_RSA_ALT)
+
+int mbedtls_ct_rsaes_pkcs1_v15_unpadding(unsigned char* input, size_t ilen, unsigned char* output,
+    size_t output_max_len, size_t* olen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t i, plaintext_max_size;
+
+    /* The following variables take sensitive values: their value must
+     * not leak into the observable behavior of the function other than
+     * the designated outputs (output, olen, return value). Otherwise
+     * this would open the execution of the function to
+     * side-channel-based variants of the Bleichenbacher padding oracle
+     * attack. Potential side channels include overall timing, memory
+     * access patterns (especially visible to an adversary who has access
+     * to a shared memory cache), and branches (especially visible to
+     * an adversary who has access to a shared code cache or to a shared
+     * branch predictor). */
+    size_t pad_count = 0;
+    unsigned bad = 0;
+    unsigned char pad_done = 0;
+    size_t plaintext_size = 0;
+    unsigned output_too_large;
+
+    plaintext_max_size = (output_max_len > ilen - 11) ? ilen - 11 : output_max_len;
+
+    /* Check and get padding length in constant time and constant
+     * memory trace. The first byte must be 0. */
+    bad |= input[0];
+
+    /* Decode EME-PKCS1-v1_5 padding: 0x00 || 0x02 || PS || 0x00
+     * where PS must be at least 8 nonzero bytes. */
+    bad |= input[1] ^ MBEDTLS_RSA_CRYPT;
+
+    /* Read the whole buffer. Set pad_done to nonzero if we find
+     * the 0x00 byte and remember the padding length in pad_count. */
+    for (i = 2; i < ilen; i++) {
+        pad_done |= ((input[i] | (unsigned char)-input[i]) >> 7) ^ 1;
+        pad_count += ((pad_done | (unsigned char)-pad_done) >> 7) ^ 1;
+    }
+
+    /* If pad_done is still zero, there's no data, only unfinished padding. */
+    bad |= mbedtls_ct_uint_if(pad_done, 0, 1);
+
+    /* There must be at least 8 bytes of padding. */
+    bad |= mbedtls_ct_size_gt(8, pad_count);
+
+    /* If the padding is valid, set plaintext_size to the number of
+     * remaining bytes after stripping the padding. If the padding
+     * is invalid, avoid leaking this fact through the size of the
+     * output: use the maximum message size that fits in the output
+     * buffer. Do it without branches to avoid leaking the padding
+     * validity through timing. RSA keys are small enough that all the
+     * size_t values involved fit in unsigned int. */
+    plaintext_size =
+        mbedtls_ct_uint_if(bad, (unsigned)plaintext_max_size, (unsigned)(ilen - pad_count - 3));
+
+    /* Set output_too_large to 0 if the plaintext fits in the output
+     * buffer and to 1 otherwise. */
+    output_too_large = mbedtls_ct_size_gt(plaintext_size, plaintext_max_size);
+
+    /* Set ret without branches to avoid timing attacks. Return:
+     * - INVALID_PADDING if the padding is bad (bad != 0).
+     * - OUTPUT_TOO_LARGE if the padding is good but the decrypted
+     *   plaintext does not fit in the output buffer.
+     * - 0 if the padding is correct. */
+    ret = -(int)mbedtls_ct_uint_if(bad, -MBEDTLS_ERR_RSA_INVALID_PADDING,
+        mbedtls_ct_uint_if(output_too_large, -MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE, 0));
+
+    /* If the padding is bad or the plaintext is too large, zero the
+     * data that we're about to copy to the output buffer.
+     * We need to copy the same amount of data
+     * from the same buffer whether the padding is good or not to
+     * avoid leaking the padding validity through overall timing or
+     * through memory or cache access patterns. */
+    bad = mbedtls_ct_uint_mask(bad | output_too_large);
+    for (i = 11; i < ilen; i++)
+        input[i] &= ~bad;
+
+    /* If the plaintext is too large, truncate it to the buffer size.
+     * Copy anyway to avoid revealing the length through timing, because
+     * revealing the length is as bad as revealing the padding validity
+     * for a Bleichenbacher attack. */
+    plaintext_size = mbedtls_ct_uint_if(output_too_large, (unsigned)plaintext_max_size,
+        (unsigned)plaintext_size);
+
+    /* Move the plaintext to the leftmost position where it can start in
+     * the working buffer, i.e. make it start plaintext_max_size from
+     * the end of the buffer. Do this with a memory access trace that
+     * does not depend on the plaintext size. After this move, the
+     * starting location of the plaintext is no longer sensitive
+     * information. */
+    mbedtls_ct_mem_move_to_left(input + ilen - plaintext_max_size, plaintext_max_size,
+        plaintext_max_size - plaintext_size);
+
+    /* Finally copy the decrypted plaintext plus trailing zeros into the output
+     * buffer. If output_max_len is 0, then output may be an invalid pointer
+     * and the result of memcpy() would be undefined; prevent undefined
+     * behavior making sure to depend only on output_max_len (the size of the
+     * user-provided output buffer), which is independent from plaintext
+     * length, validity of padding, success of the decryption, and other
+     * secrets. */
+    if (output_max_len != 0)
+        memcpy(output, input + ilen - plaintext_max_size, plaintext_max_size);
+
+    /* Report the amount of data we copied to the output buffer. In case
+     * of errors (bad padding or output too large), the value of *olen
+     * when this function returns is not specified. Making it equivalent
+     * to the good case limits the risks of leaking the padding validity. */
+    *olen = plaintext_size;
+
+    return (ret);
+}
+
+#endif /* MBEDTLS_PKCS1_V15 && MBEDTLS_RSA_C && ! MBEDTLS_RSA_ALT */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/constant_time_internal.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/constant_time_internal.h
new file mode 100644
index 0000000000..30eeccb6d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/constant_time_internal.h
@@ -0,0 +1,304 @@
+/**
+ *  Constant-time functions
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_CONSTANT_TIME_INTERNAL_H
+#define MBEDTLS_CONSTANT_TIME_INTERNAL_H
+
+#include "common.h"
+
+#if defined(MBEDTLS_BIGNUM_C)
+#include "mbedtls/bignum.h"
+#endif
+
+#if defined(MBEDTLS_SSL_TLS_C)
+#include "ssl_misc.h"
+#endif
+
+#include <stddef.h>
+
+/** Turn a value into a mask:
+ * - if \p value == 0, return the all-bits 0 mask, aka 0
+ * - otherwise, return the all-bits 1 mask, aka (unsigned) -1
+ *
+ * This function can be used to write constant-time code by replacing branches
+ * with bit operations using masks.
+ *
+ * \param value     The value to analyze.
+ *
+ * \return          Zero if \p value is zero, otherwise all-bits-one.
+ */
+unsigned mbedtls_ct_uint_mask(unsigned value);
+
+#if defined(MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC)
+
+/** Turn a value into a mask:
+ * - if \p value == 0, return the all-bits 0 mask, aka 0
+ * - otherwise, return the all-bits 1 mask, aka (size_t) -1
+ *
+ * This function can be used to write constant-time code by replacing branches
+ * with bit operations using masks.
+ *
+ * \param value     The value to analyze.
+ *
+ * \return          Zero if \p value is zero, otherwise all-bits-one.
+ */
+size_t mbedtls_ct_size_mask(size_t value);
+
+#endif /* MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC */
+
+#if defined(MBEDTLS_BIGNUM_C)
+
+/** Turn a value into a mask:
+ * - if \p value == 0, return the all-bits 0 mask, aka 0
+ * - otherwise, return the all-bits 1 mask, aka (mbedtls_mpi_uint) -1
+ *
+ * This function can be used to write constant-time code by replacing branches
+ * with bit operations using masks.
+ *
+ * \param value     The value to analyze.
+ *
+ * \return          Zero if \p value is zero, otherwise all-bits-one.
+ */
+mbedtls_mpi_uint mbedtls_ct_mpi_uint_mask(mbedtls_mpi_uint value);
+
+#endif /* MBEDTLS_BIGNUM_C */
+
+#if defined(MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC)
+
+/** Constant-flow mask generation for "greater or equal" comparison:
+ * - if \p x >= \p y, return all-bits 1, that is (size_t) -1
+ * - otherwise, return all bits 0, that is 0
+ *
+ * This function can be used to write constant-time code by replacing branches
+ * with bit operations using masks.
+ *
+ * \param x     The first value to analyze.
+ * \param y     The second value to analyze.
+ *
+ * \return      All-bits-one if \p x is greater or equal than \p y,
+ *              otherwise zero.
+ */
+size_t mbedtls_ct_size_mask_ge(size_t x, size_t y);
+
+#endif /* MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC */
+
+/** Constant-flow boolean "equal" comparison:
+ * return x == y
+ *
+ * This is equivalent to \p x == \p y, but is likely to be compiled
+ * to code using bitwise operation rather than a branch.
+ *
+ * \param x     The first value to analyze.
+ * \param y     The second value to analyze.
+ *
+ * \return      1 if \p x equals to \p y, otherwise 0.
+ */
+unsigned mbedtls_ct_size_bool_eq(size_t x, size_t y);
+
+#if defined(MBEDTLS_BIGNUM_C)
+
+/** Decide if an integer is less than the other, without branches.
+ *
+ * This is equivalent to \p x < \p y, but is likely to be compiled
+ * to code using bitwise operation rather than a branch.
+ *
+ * \param x     The first value to analyze.
+ * \param y     The second value to analyze.
+ *
+ * \return      1 if \p x is less than \p y, otherwise 0.
+ */
+unsigned mbedtls_ct_mpi_uint_lt(const mbedtls_mpi_uint x, const mbedtls_mpi_uint y);
+
+#endif /* MBEDTLS_BIGNUM_C */
+
+/** Choose between two integer values without branches.
+ *
+ * This is equivalent to `condition ? if1 : if0`, but is likely to be compiled
+ * to code using bitwise operation rather than a branch.
+ *
+ * \param condition     Condition to test.
+ * \param if1           Value to use if \p condition is nonzero.
+ * \param if0           Value to use if \p condition is zero.
+ *
+ * \return  \c if1 if \p condition is nonzero, otherwise \c if0.
+ */
+unsigned mbedtls_ct_uint_if(unsigned condition, unsigned if1, unsigned if0);
+
+#if defined(MBEDTLS_BIGNUM_C)
+
+/** Conditionally assign a value without branches.
+ *
+ * This is equivalent to `if ( condition ) dest = src`, but is likely
+ * to be compiled to code using bitwise operation rather than a branch.
+ *
+ * \param n             \p dest and \p src must be arrays of limbs of size n.
+ * \param dest          The MPI to conditionally assign to. This must point
+ *                      to an initialized MPI.
+ * \param src           The MPI to be assigned from. This must point to an
+ *                      initialized MPI.
+ * \param condition     Condition to test, must be 0 or 1.
+ */
+void mbedtls_ct_mpi_uint_cond_assign(size_t n, mbedtls_mpi_uint* dest, const mbedtls_mpi_uint* src,
+    unsigned char condition);
+
+#endif /* MBEDTLS_BIGNUM_C */
+
+#if defined(MBEDTLS_BASE64_C)
+
+/** Given a value in the range 0..63, return the corresponding Base64 digit.
+ *
+ * The implementation assumes that letters are consecutive (e.g. ASCII
+ * but not EBCDIC).
+ *
+ * \param value     A value in the range 0..63.
+ *
+ * \return          A base64 digit converted from \p value.
+ */
+unsigned char mbedtls_ct_base64_enc_char(unsigned char value);
+
+/** Given a Base64 digit, return its value.
+ *
+ * If c is not a Base64 digit ('A'..'Z', 'a'..'z', '0'..'9', '+' or '/'),
+ * return -1.
+ *
+ * The implementation assumes that letters are consecutive (e.g. ASCII
+ * but not EBCDIC).
+ *
+ * \param c     A base64 digit.
+ *
+ * \return      The value of the base64 digit \p c.
+ */
+signed char mbedtls_ct_base64_dec_value(unsigned char c);
+
+#endif /* MBEDTLS_BASE64_C */
+
+#if defined(MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC)
+
+/** Conditional memcpy without branches.
+ *
+ * This is equivalent to `if ( c1 == c2 ) memcpy(dest, src, len)`, but is likely
+ * to be compiled to code using bitwise operation rather than a branch.
+ *
+ * \param dest      The pointer to conditionally copy to.
+ * \param src       The pointer to copy from. Shouldn't overlap with \p dest.
+ * \param len       The number of bytes to copy.
+ * \param c1        The first value to analyze in the condition.
+ * \param c2        The second value to analyze in the condition.
+ */
+void mbedtls_ct_memcpy_if_eq(unsigned char* dest, const unsigned char* src, size_t len, size_t c1,
+    size_t c2);
+
+/** Copy data from a secret position with constant flow.
+ *
+ * This function copies \p len bytes from \p src_base + \p offset_secret to \p
+ * dst, with a code flow and memory access pattern that does not depend on \p
+ * offset_secret, but only on \p offset_min, \p offset_max and \p len.
+ * Functionally equivalent to `memcpy(dst, src + offset_secret, len)`.
+ *
+ * \param dest          The destination buffer. This must point to a writable
+ *                      buffer of at least \p len bytes.
+ * \param src           The base of the source buffer. This must point to a
+ *                      readable buffer of at least \p offset_max + \p len
+ *                      bytes. Shouldn't overlap with \p dest.
+ * \param offset        The offset in the source buffer from which to copy.
+ *                      This must be no less than \p offset_min and no greater
+ *                      than \p offset_max.
+ * \param offset_min    The minimal value of \p offset.
+ * \param offset_max    The maximal value of \p offset.
+ * \param len           The number of bytes to copy.
+ */
+void mbedtls_ct_memcpy_offset(unsigned char* dest, const unsigned char* src, size_t offset,
+    size_t offset_min, size_t offset_max, size_t len);
+
+/** Compute the HMAC of variable-length data with constant flow.
+ *
+ * This function computes the HMAC of the concatenation of \p add_data and \p
+ * data, and does with a code flow and memory access pattern that does not
+ * depend on \p data_len_secret, but only on \p min_data_len and \p
+ * max_data_len. In particular, this function always reads exactly \p
+ * max_data_len bytes from \p data.
+ *
+ * \param ctx               The HMAC context. It must have keys configured
+ *                          with mbedtls_md_hmac_starts() and use one of the
+ *                          following hashes: SHA-384, SHA-256, SHA-1 or MD-5.
+ *                          It is reset using mbedtls_md_hmac_reset() after
+ *                          the computation is complete to prepare for the
+ *                          next computation.
+ * \param add_data          The first part of the message whose HMAC is being
+ *                          calculated. This must point to a readable buffer
+ *                          of \p add_data_len bytes.
+ * \param add_data_len      The length of \p add_data in bytes.
+ * \param data              The buffer containing the second part of the
+ *                          message. This must point to a readable buffer
+ *                          of \p max_data_len bytes.
+ * \param data_len_secret   The length of the data to process in \p data.
+ *                          This must be no less than \p min_data_len and no
+ *                          greater than \p max_data_len.
+ * \param min_data_len      The minimal length of the second part of the
+ *                          message, read from \p data.
+ * \param max_data_len      The maximal length of the second part of the
+ *                          message, read from \p data.
+ * \param output            The HMAC will be written here. This must point to
+ *                          a writable buffer of sufficient size to hold the
+ *                          HMAC value.
+ *
+ * \retval 0 on success.
+ * \retval #MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED
+ *         The hardware accelerator failed.
+ */
+int mbedtls_ct_hmac(mbedtls_md_context_t* ctx, const unsigned char* add_data, size_t add_data_len,
+    const unsigned char* data, size_t data_len_secret, size_t min_data_len, size_t max_data_len,
+    unsigned char* output);
+
+#endif /* MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC */
+
+#if defined(MBEDTLS_PKCS1_V15) && defined(MBEDTLS_RSA_C) && !defined(MBEDTLS_RSA_ALT)
+
+/** This function performs the unpadding part of a PKCS#1 v1.5 decryption
+ *  operation (EME-PKCS1-v1_5 decoding).
+ *
+ * \note The return value from this function is a sensitive value
+ *       (this is unusual). #MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE shouldn't happen
+ *       in a well-written application, but 0 vs #MBEDTLS_ERR_RSA_INVALID_PADDING
+ *       is often a situation that an attacker can provoke and leaking which
+ *       one is the result is precisely the information the attacker wants.
+ *
+ * \param input          The input buffer which is the payload inside PKCS#1v1.5
+ *                       encryption padding, called the "encoded message EM"
+ *                       by the terminology.
+ * \param ilen           The length of the payload in the \p input buffer.
+ * \param output         The buffer for the payload, called "message M" by the
+ *                       PKCS#1 terminology. This must be a writable buffer of
+ *                       length \p output_max_len bytes.
+ * \param olen           The address at which to store the length of
+ *                       the payload. This must not be \c NULL.
+ * \param output_max_len The length in bytes of the output buffer \p output.
+ *
+ * \return      \c 0 on success.
+ * \return      #MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE
+ *              The output buffer is too small for the unpadded payload.
+ * \return      #MBEDTLS_ERR_RSA_INVALID_PADDING
+ *              The input doesn't contain properly formatted padding.
+ */
+int mbedtls_ct_rsaes_pkcs1_v15_unpadding(unsigned char* input, size_t ilen, unsigned char* output,
+    size_t output_max_len, size_t* olen);
+
+#endif /* MBEDTLS_PKCS1_V15 && MBEDTLS_RSA_C && ! MBEDTLS_RSA_ALT */
+
+#endif /* MBEDTLS_CONSTANT_TIME_INTERNAL_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/constant_time_invasive.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/constant_time_invasive.h
new file mode 100644
index 0000000000..9dcd31bb45
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/constant_time_invasive.h
@@ -0,0 +1,50 @@
+/**
+ * \file constant_time_invasive.h
+ *
+ * \brief Constant-time module: interfaces for invasive testing only.
+ *
+ * The interfaces in this file are intended for testing purposes only.
+ * They SHOULD NOT be made available in library integrations except when
+ * building the library for testing.
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_CONSTANT_TIME_INVASIVE_H
+#define MBEDTLS_CONSTANT_TIME_INVASIVE_H
+
+#include "common.h"
+
+#if defined(MBEDTLS_TEST_HOOKS)
+
+/** Turn a value into a mask:
+ * - if \p low <= \p c <= \p high,
+ *   return the all-bits 1 mask, aka (unsigned) -1
+ * - otherwise, return the all-bits 0 mask, aka 0
+ *
+ * \param low   The value to analyze.
+ * \param high  The value to analyze.
+ * \param c     The value to analyze.
+ *
+ * \return      All-bits-one if \p low <= \p c <= \p high, otherwise zero.
+ */
+unsigned char mbedtls_ct_uchar_mask_of_range(unsigned char low, unsigned char high,
+    unsigned char c);
+
+#endif /* MBEDTLS_TEST_HOOKS */
+
+#endif /* MBEDTLS_CONSTANT_TIME_INVASIVE_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/entropy.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/entropy.cpp
new file mode 100644
index 0000000000..533c293546
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/entropy.cpp
@@ -0,0 +1,649 @@
+/*
+ *  Entropy accumulator implementation
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_ENTROPY_C)
+
+#include <string.h>
+
+#include "entropy_poll.h"
+#include "mbedtls/entropy.h"
+#include "mbedtls/error.h"
+#include "mbedtls/platform_util.h"
+
+#if defined(MBEDTLS_FS_IO)
+#include <stdio.h>
+#endif
+
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+#include "mbedtls/platform.h"
+#endif
+
+#if defined(MBEDTLS_SELF_TEST)
+// #if defined(MBEDTLS_PLATFORM_C)
+// #include "mbedtls/platform.h"
+// #else
+// #include <stdio.h>
+// #define mbedtls_printf     printf
+// #endif /* MBEDTLS_PLATFORM_C */
+#endif /* MBEDTLS_SELF_TEST */
+
+#define ENTROPY_MAX_LOOP 256 /**< Maximum amount to loop before error */
+
+void mbedtls_entropy_init(mbedtls_entropy_context* ctx) {
+    ctx->source_count = 0;
+    memset(ctx->source, 0, sizeof(ctx->source));
+
+#if defined(MBEDTLS_THREADING_C)
+    mbedtls_mutex_init(&ctx->mutex);
+#endif
+
+    ctx->accumulator_started = 0;
+#if defined(MBEDTLS_ENTROPY_SHA512_ACCUMULATOR)
+    mbedtls_sha512_init(&ctx->accumulator);
+#else
+    mbedtls_sha256_init(&ctx->accumulator);
+#endif
+
+    /* Reminder: Update ENTROPY_HAVE_STRONG in the test files
+     *           when adding more strong entropy sources here. */
+
+#if !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES)
+#if !defined(MBEDTLS_NO_PLATFORM_ENTROPY)
+    mbedtls_entropy_add_source(ctx, mbedtls_platform_entropy_poll, NULL,
+        MBEDTLS_ENTROPY_MIN_PLATFORM, MBEDTLS_ENTROPY_SOURCE_STRONG);
+#endif
+#if defined(MBEDTLS_ENTROPY_HARDWARE_ALT)
+    mbedtls_entropy_add_source(ctx, mbedtls_hardware_poll, NULL, MBEDTLS_ENTROPY_MIN_HARDWARE,
+        MBEDTLS_ENTROPY_SOURCE_STRONG);
+#endif
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+    mbedtls_entropy_add_source(ctx, mbedtls_nv_seed_poll, NULL, MBEDTLS_ENTROPY_BLOCK_SIZE,
+        MBEDTLS_ENTROPY_SOURCE_STRONG);
+    ctx->initial_entropy_run = 0;
+#endif
+#endif /* MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES */
+}
+
+void mbedtls_entropy_free(mbedtls_entropy_context* ctx) {
+    /* If the context was already free, don't call free() again.
+     * This is important for mutexes which don't allow double-free. */
+    if (ctx->accumulator_started == -1)
+        return;
+
+#if defined(MBEDTLS_THREADING_C)
+    mbedtls_mutex_free(&ctx->mutex);
+#endif
+#if defined(MBEDTLS_ENTROPY_SHA512_ACCUMULATOR)
+    mbedtls_sha512_free(&ctx->accumulator);
+#else
+    mbedtls_sha256_free(&ctx->accumulator);
+#endif
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+    ctx->initial_entropy_run = 0;
+#endif
+    ctx->source_count = 0;
+    mbedtls_platform_zeroize(ctx->source, sizeof(ctx->source));
+    ctx->accumulator_started = -1;
+}
+
+int mbedtls_entropy_add_source(mbedtls_entropy_context* ctx, mbedtls_entropy_f_source_ptr f_source,
+    void* p_source, size_t threshold, int strong) {
+    int idx, ret = 0;
+
+#if defined(MBEDTLS_THREADING_C)
+    if ((ret = mbedtls_mutex_lock(&ctx->mutex)) != 0)
+        return (ret);
+#endif
+
+    idx = ctx->source_count;
+    if (idx >= MBEDTLS_ENTROPY_MAX_SOURCES) {
+        ret = MBEDTLS_ERR_ENTROPY_MAX_SOURCES;
+        goto exit;
+    }
+
+    ctx->source[idx].f_source = f_source;
+    ctx->source[idx].p_source = p_source;
+    ctx->source[idx].threshold = threshold;
+    ctx->source[idx].strong = strong;
+
+    ctx->source_count++;
+
+exit:
+#if defined(MBEDTLS_THREADING_C)
+    if (mbedtls_mutex_unlock(&ctx->mutex) != 0)
+        return (MBEDTLS_ERR_THREADING_MUTEX_ERROR);
+#endif
+
+    return (ret);
+}
+
+/*
+ * Entropy accumulator update
+ */
+static int entropy_update(mbedtls_entropy_context* ctx, unsigned char source_id,
+    const unsigned char* data, size_t len) {
+    unsigned char header[2];
+    unsigned char tmp[MBEDTLS_ENTROPY_BLOCK_SIZE];
+    size_t use_len = len;
+    const unsigned char* p = data;
+    int ret = 0;
+
+    if (use_len > MBEDTLS_ENTROPY_BLOCK_SIZE) {
+#if defined(MBEDTLS_ENTROPY_SHA512_ACCUMULATOR)
+        if ((ret = mbedtls_sha512(data, len, tmp, 0)) != 0)
+            goto cleanup;
+#else
+        if ((ret = mbedtls_sha256(data, len, tmp, 0)) != 0)
+            goto cleanup;
+#endif
+        p = tmp;
+        use_len = MBEDTLS_ENTROPY_BLOCK_SIZE;
+    }
+
+    header[0] = source_id;
+    header[1] = use_len & 0xFF;
+
+    /*
+     * Start the accumulator if this has not already happened. Note that
+     * it is sufficient to start the accumulator here only because all calls to
+     * gather entropy eventually execute this code.
+     */
+#if defined(MBEDTLS_ENTROPY_SHA512_ACCUMULATOR)
+    if (ctx->accumulator_started == 0 && (ret = mbedtls_sha512_starts(&ctx->accumulator, 0)) != 0)
+        goto cleanup;
+    else
+        ctx->accumulator_started = 1;
+    if ((ret = mbedtls_sha512_update(&ctx->accumulator, header, 2)) != 0)
+        goto cleanup;
+    ret = mbedtls_sha512_update(&ctx->accumulator, p, use_len);
+#else
+    if (ctx->accumulator_started == 0 && (ret = mbedtls_sha256_starts(&ctx->accumulator, 0)) != 0)
+        goto cleanup;
+    else
+        ctx->accumulator_started = 1;
+    if ((ret = mbedtls_sha256_update(&ctx->accumulator, header, 2)) != 0)
+        goto cleanup;
+    ret = mbedtls_sha256_update(&ctx->accumulator, p, use_len);
+#endif
+
+cleanup:
+    mbedtls_platform_zeroize(tmp, sizeof(tmp));
+
+    return (ret);
+}
+
+int mbedtls_entropy_update_manual(mbedtls_entropy_context* ctx, const unsigned char* data,
+    size_t len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+#if defined(MBEDTLS_THREADING_C)
+    if ((ret = mbedtls_mutex_lock(&ctx->mutex)) != 0)
+        return (ret);
+#endif
+
+    ret = entropy_update(ctx, MBEDTLS_ENTROPY_SOURCE_MANUAL, data, len);
+
+#if defined(MBEDTLS_THREADING_C)
+    if (mbedtls_mutex_unlock(&ctx->mutex) != 0)
+        return (MBEDTLS_ERR_THREADING_MUTEX_ERROR);
+#endif
+
+    return (ret);
+}
+
+/*
+ * Run through the different sources to add entropy to our accumulator
+ */
+static int entropy_gather_internal(mbedtls_entropy_context* ctx) {
+    int ret = MBEDTLS_ERR_ENTROPY_SOURCE_FAILED;
+    int i;
+    int have_one_strong = 0;
+    unsigned char buf[MBEDTLS_ENTROPY_MAX_GATHER];
+    size_t olen;
+
+    if (ctx->source_count == 0)
+        return (MBEDTLS_ERR_ENTROPY_NO_SOURCES_DEFINED);
+
+    /*
+     * Run through our entropy sources
+     */
+    for (i = 0; i < ctx->source_count; i++) {
+        if (ctx->source[i].strong == MBEDTLS_ENTROPY_SOURCE_STRONG)
+            have_one_strong = 1;
+
+        olen = 0;
+        if ((ret = ctx->source[i].f_source(ctx->source[i].p_source, buf, MBEDTLS_ENTROPY_MAX_GATHER,
+                 &olen)) != 0) {
+            goto cleanup;
+        }
+
+        /*
+         * Add if we actually gathered something
+         */
+        if (olen > 0) {
+            if ((ret = entropy_update(ctx, (unsigned char)i, buf, olen)) != 0)
+                return (ret);
+            ctx->source[i].size += olen;
+        }
+    }
+
+    if (have_one_strong == 0)
+        ret = MBEDTLS_ERR_ENTROPY_NO_STRONG_SOURCE;
+
+cleanup:
+    mbedtls_platform_zeroize(buf, sizeof(buf));
+
+    return (ret);
+}
+
+/*
+ * Thread-safe wrapper for entropy_gather_internal()
+ */
+int mbedtls_entropy_gather(mbedtls_entropy_context* ctx) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+#if defined(MBEDTLS_THREADING_C)
+    if ((ret = mbedtls_mutex_lock(&ctx->mutex)) != 0)
+        return (ret);
+#endif
+
+    ret = entropy_gather_internal(ctx);
+
+#if defined(MBEDTLS_THREADING_C)
+    if (mbedtls_mutex_unlock(&ctx->mutex) != 0)
+        return (MBEDTLS_ERR_THREADING_MUTEX_ERROR);
+#endif
+
+    return (ret);
+}
+
+int mbedtls_entropy_func(void* data, unsigned char* output, size_t len) {
+    int ret, count = 0, i, thresholds_reached;
+    size_t strong_size;
+    mbedtls_entropy_context* ctx = (mbedtls_entropy_context*)data;
+    unsigned char buf[MBEDTLS_ENTROPY_BLOCK_SIZE];
+
+    if (len > MBEDTLS_ENTROPY_BLOCK_SIZE)
+        return (MBEDTLS_ERR_ENTROPY_SOURCE_FAILED);
+
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+    /* Update the NV entropy seed before generating any entropy for outside
+     * use.
+     */
+    if (ctx->initial_entropy_run == 0) {
+        ctx->initial_entropy_run = 1;
+        if ((ret = mbedtls_entropy_update_nv_seed(ctx)) != 0)
+            return (ret);
+    }
+#endif
+
+#if defined(MBEDTLS_THREADING_C)
+    if ((ret = mbedtls_mutex_lock(&ctx->mutex)) != 0)
+        return (ret);
+#endif
+
+    /*
+     * Always gather extra entropy before a call
+     */
+    do {
+        if (count++ > ENTROPY_MAX_LOOP) {
+            ret = MBEDTLS_ERR_ENTROPY_SOURCE_FAILED;
+            goto exit;
+        }
+
+        if ((ret = entropy_gather_internal(ctx)) != 0)
+            goto exit;
+
+        thresholds_reached = 1;
+        strong_size = 0;
+        for (i = 0; i < ctx->source_count; i++) {
+            if (ctx->source[i].size < ctx->source[i].threshold)
+                thresholds_reached = 0;
+            if (ctx->source[i].strong == MBEDTLS_ENTROPY_SOURCE_STRONG)
+                strong_size += ctx->source[i].size;
+        }
+    } while (!thresholds_reached || strong_size < MBEDTLS_ENTROPY_BLOCK_SIZE);
+
+    memset(buf, 0, MBEDTLS_ENTROPY_BLOCK_SIZE);
+
+#if defined(MBEDTLS_ENTROPY_SHA512_ACCUMULATOR)
+    /*
+     * Note that at this stage it is assumed that the accumulator was started
+     * in a previous call to entropy_update(). If this is not guaranteed, the
+     * code below will fail.
+     */
+    if ((ret = mbedtls_sha512_finish(&ctx->accumulator, buf)) != 0)
+        goto exit;
+
+    /*
+     * Reset accumulator and counters and recycle existing entropy
+     */
+    mbedtls_sha512_free(&ctx->accumulator);
+    mbedtls_sha512_init(&ctx->accumulator);
+    if ((ret = mbedtls_sha512_starts(&ctx->accumulator, 0)) != 0)
+        goto exit;
+    if ((ret = mbedtls_sha512_update(&ctx->accumulator, buf, MBEDTLS_ENTROPY_BLOCK_SIZE)) != 0)
+        goto exit;
+
+    /*
+     * Perform second SHA-512 on entropy
+     */
+    if ((ret = mbedtls_sha512(buf, MBEDTLS_ENTROPY_BLOCK_SIZE, buf, 0)) != 0)
+        goto exit;
+#else  /* MBEDTLS_ENTROPY_SHA512_ACCUMULATOR */
+    if ((ret = mbedtls_sha256_finish(&ctx->accumulator, buf)) != 0)
+        goto exit;
+
+    /*
+     * Reset accumulator and counters and recycle existing entropy
+     */
+    mbedtls_sha256_free(&ctx->accumulator);
+    mbedtls_sha256_init(&ctx->accumulator);
+    if ((ret = mbedtls_sha256_starts(&ctx->accumulator, 0)) != 0)
+        goto exit;
+    if ((ret = mbedtls_sha256_update(&ctx->accumulator, buf, MBEDTLS_ENTROPY_BLOCK_SIZE)) != 0)
+        goto exit;
+
+    /*
+     * Perform second SHA-256 on entropy
+     */
+    if ((ret = mbedtls_sha256(buf, MBEDTLS_ENTROPY_BLOCK_SIZE, buf, 0)) != 0)
+        goto exit;
+#endif /* MBEDTLS_ENTROPY_SHA512_ACCUMULATOR */
+
+    for (i = 0; i < ctx->source_count; i++)
+        ctx->source[i].size = 0;
+
+    memcpy(output, buf, len);
+
+    ret = 0;
+
+exit:
+    mbedtls_platform_zeroize(buf, sizeof(buf));
+
+#if defined(MBEDTLS_THREADING_C)
+    if (mbedtls_mutex_unlock(&ctx->mutex) != 0)
+        return (MBEDTLS_ERR_THREADING_MUTEX_ERROR);
+#endif
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+int mbedtls_entropy_update_nv_seed(mbedtls_entropy_context* ctx) {
+    int ret = MBEDTLS_ERR_ENTROPY_FILE_IO_ERROR;
+    unsigned char buf[MBEDTLS_ENTROPY_BLOCK_SIZE];
+
+    /* Read new seed  and write it to NV */
+    if ((ret = mbedtls_entropy_func(ctx, buf, MBEDTLS_ENTROPY_BLOCK_SIZE)) != 0)
+        return (ret);
+
+    if (mbedtls_nv_seed_write(buf, MBEDTLS_ENTROPY_BLOCK_SIZE) < 0)
+        return (MBEDTLS_ERR_ENTROPY_FILE_IO_ERROR);
+
+    /* Manually update the remaining stream with a separator value to diverge */
+    memset(buf, 0, MBEDTLS_ENTROPY_BLOCK_SIZE);
+    ret = mbedtls_entropy_update_manual(ctx, buf, MBEDTLS_ENTROPY_BLOCK_SIZE);
+
+    return (ret);
+}
+#endif /* MBEDTLS_ENTROPY_NV_SEED */
+
+#if defined(MBEDTLS_FS_IO)
+int mbedtls_entropy_write_seed_file(mbedtls_entropy_context* ctx, const char* path) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    FILE* f = NULL;
+    unsigned char buf[MBEDTLS_ENTROPY_BLOCK_SIZE];
+
+    if ((ret = mbedtls_entropy_func(ctx, buf, MBEDTLS_ENTROPY_BLOCK_SIZE)) != 0) {
+        ret = MBEDTLS_ERR_ENTROPY_SOURCE_FAILED;
+        goto exit;
+    }
+
+    if ((f = fopen(path, "wb")) == NULL) {
+        ret = MBEDTLS_ERR_ENTROPY_FILE_IO_ERROR;
+        goto exit;
+    }
+
+    if (fwrite(buf, 1, MBEDTLS_ENTROPY_BLOCK_SIZE, f) != MBEDTLS_ENTROPY_BLOCK_SIZE) {
+        ret = MBEDTLS_ERR_ENTROPY_FILE_IO_ERROR;
+        goto exit;
+    }
+
+    ret = 0;
+
+exit:
+    mbedtls_platform_zeroize(buf, sizeof(buf));
+
+    if (f != NULL)
+        fclose(f);
+
+    return (ret);
+}
+
+int mbedtls_entropy_update_seed_file(mbedtls_entropy_context* ctx, const char* path) {
+    int ret = 0;
+    FILE* f;
+    size_t n;
+    unsigned char buf[MBEDTLS_ENTROPY_MAX_SEED_SIZE];
+
+    if ((f = fopen(path, "rb")) == NULL)
+        return (MBEDTLS_ERR_ENTROPY_FILE_IO_ERROR);
+
+    fseek(f, 0, SEEK_END);
+    n = (size_t)ftell(f);
+    fseek(f, 0, SEEK_SET);
+
+    if (n > MBEDTLS_ENTROPY_MAX_SEED_SIZE)
+        n = MBEDTLS_ENTROPY_MAX_SEED_SIZE;
+
+    if (fread(buf, 1, n, f) != n)
+        ret = MBEDTLS_ERR_ENTROPY_FILE_IO_ERROR;
+    else
+        ret = mbedtls_entropy_update_manual(ctx, buf, n);
+
+    fclose(f);
+
+    mbedtls_platform_zeroize(buf, sizeof(buf));
+
+    if (ret != 0)
+        return (ret);
+
+    return (mbedtls_entropy_write_seed_file(ctx, path));
+}
+#endif /* MBEDTLS_FS_IO */
+
+#if defined(MBEDTLS_SELF_TEST)
+/*
+ * Dummy source function
+ */
+static int entropy_dummy_source(void* data, unsigned char* output, size_t len, size_t* olen) {
+    ((void)data);
+
+    memset(output, 0x2a, len);
+    *olen = len;
+
+    return (0);
+}
+
+#if defined(MBEDTLS_ENTROPY_HARDWARE_ALT)
+
+static int mbedtls_entropy_source_self_test_gather(unsigned char* buf, size_t buf_len) {
+    int ret = 0;
+    size_t entropy_len = 0;
+    size_t olen = 0;
+    size_t attempts = buf_len;
+
+    while (attempts > 0 && entropy_len < buf_len) {
+        if ((ret = mbedtls_hardware_poll(NULL, buf + entropy_len, buf_len - entropy_len, &olen)) !=
+            0)
+            return (ret);
+
+        entropy_len += olen;
+        attempts--;
+    }
+
+    if (entropy_len < buf_len) {
+        ret = 1;
+    }
+
+    return (ret);
+}
+
+static int mbedtls_entropy_source_self_test_check_bits(const unsigned char* buf, size_t buf_len) {
+    unsigned char set = 0xFF;
+    unsigned char unset = 0x00;
+    size_t i;
+
+    for (i = 0; i < buf_len; i++) {
+        set &= buf[i];
+        unset |= buf[i];
+    }
+
+    return (set == 0xFF || unset == 0x00);
+}
+
+/*
+ * A test to ensure hat the entropy sources are functioning correctly
+ * and there is no obvious failure. The test performs the following checks:
+ *  - The entropy source is not providing only 0s (all bits unset) or 1s (all
+ *    bits set).
+ *  - The entropy source is not providing values in a pattern. Because the
+ *    hardware could be providing data in an arbitrary length, this check polls
+ *    the hardware entropy source twice and compares the result to ensure they
+ *    are not equal.
+ *  - The error code returned by the entropy source is not an error.
+ */
+int mbedtls_entropy_source_self_test(int verbose) {
+    int ret = 0;
+    unsigned char buf0[2 * sizeof(unsigned long long int)];
+    unsigned char buf1[2 * sizeof(unsigned long long int)];
+
+    if (verbose != 0)
+        mbedtls_printf("  ENTROPY_BIAS test: ");
+
+    memset(buf0, 0x00, sizeof(buf0));
+    memset(buf1, 0x00, sizeof(buf1));
+
+    if ((ret = mbedtls_entropy_source_self_test_gather(buf0, sizeof(buf0))) != 0)
+        goto cleanup;
+    if ((ret = mbedtls_entropy_source_self_test_gather(buf1, sizeof(buf1))) != 0)
+        goto cleanup;
+
+    /* Make sure that the returned values are not all 0 or 1 */
+    if ((ret = mbedtls_entropy_source_self_test_check_bits(buf0, sizeof(buf0))) != 0)
+        goto cleanup;
+    if ((ret = mbedtls_entropy_source_self_test_check_bits(buf1, sizeof(buf1))) != 0)
+        goto cleanup;
+
+    /* Make sure that the entropy source is not returning values in a
+     * pattern */
+    ret = memcmp(buf0, buf1, sizeof(buf0)) == 0;
+
+cleanup:
+    if (verbose != 0) {
+        if (ret != 0)
+            mbedtls_printf("failed\n");
+        else
+            mbedtls_printf("passed\n");
+
+        mbedtls_printf("\n");
+    }
+
+    return (ret != 0);
+}
+
+#endif /* MBEDTLS_ENTROPY_HARDWARE_ALT */
+
+/*
+ * The actual entropy quality is hard to test, but we can at least
+ * test that the functions don't cause errors and write the correct
+ * amount of data to buffers.
+ */
+int mbedtls_entropy_self_test(int verbose) {
+    int ret = 1;
+    mbedtls_entropy_context ctx;
+    unsigned char buf[MBEDTLS_ENTROPY_BLOCK_SIZE] = {0};
+    unsigned char acc[MBEDTLS_ENTROPY_BLOCK_SIZE] = {0};
+    size_t i, j;
+
+    if (verbose != 0)
+        mbedtls_printf("  ENTROPY test: ");
+
+    mbedtls_entropy_init(&ctx);
+
+    /* First do a gather to make sure we have default sources */
+    if ((ret = mbedtls_entropy_gather(&ctx)) != 0)
+        goto cleanup;
+
+    ret = mbedtls_entropy_add_source(&ctx, entropy_dummy_source, NULL, 16,
+        MBEDTLS_ENTROPY_SOURCE_WEAK);
+    if (ret != 0)
+        goto cleanup;
+
+    if ((ret = mbedtls_entropy_update_manual(&ctx, buf, sizeof buf)) != 0)
+        goto cleanup;
+
+    /*
+     * To test that mbedtls_entropy_func writes correct number of bytes:
+     * - use the whole buffer and rely on ASan to detect overruns
+     * - collect entropy 8 times and OR the result in an accumulator:
+     *   any byte should then be 0 with probably 2^(-64), so requiring
+     *   each of the 32 or 64 bytes to be non-zero has a false failure rate
+     *   of at most 2^(-58) which is acceptable.
+     */
+    for (i = 0; i < 8; i++) {
+        if ((ret = mbedtls_entropy_func(&ctx, buf, sizeof(buf))) != 0)
+            goto cleanup;
+
+        for (j = 0; j < sizeof(buf); j++)
+            acc[j] |= buf[j];
+    }
+
+    for (j = 0; j < sizeof(buf); j++) {
+        if (acc[j] == 0) {
+            ret = 1;
+            goto cleanup;
+        }
+    }
+
+#if defined(MBEDTLS_ENTROPY_HARDWARE_ALT)
+    if ((ret = mbedtls_entropy_source_self_test(0)) != 0)
+        goto cleanup;
+#endif
+
+cleanup:
+    mbedtls_entropy_free(&ctx);
+
+    if (verbose != 0) {
+        if (ret != 0)
+            mbedtls_printf("failed\n");
+        else
+            mbedtls_printf("passed\n");
+
+        mbedtls_printf("\n");
+    }
+
+    return (ret != 0);
+}
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_ENTROPY_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/entropy_poll.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/entropy_poll.cpp
new file mode 100644
index 0000000000..9c51ccbae5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/entropy_poll.cpp
@@ -0,0 +1,223 @@
+/*
+ *  Platform-specific and custom entropy polling functions
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#if defined(__linux__) && !defined(_GNU_SOURCE)
+/* Ensure that syscall() is available even when compiling with -std=c99 */
+#define _GNU_SOURCE
+#endif
+
+#include <string.h>
+
+#include "common.h"
+
+#if defined(MBEDTLS_ENTROPY_C)
+
+#include "entropy_poll.h"
+#include "mbedtls/entropy.h"
+#include "mbedtls/error.h"
+
+#if defined(MBEDTLS_TIMING_C)
+#include "mbedtls/timing.h"
+#endif
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+#include "mbedtls/platform.h"
+#endif
+
+#if !defined(MBEDTLS_NO_PLATFORM_ENTROPY)
+
+#if !defined(unix) && !defined(__unix__) && !defined(__unix) && !defined(__APPLE__) &&             \
+    !defined(_WIN32) && !defined(__QNXNTO__) && !defined(__HAIKU__) && !defined(__midipix__)
+#error                                                                                             \
+    "Platform entropy sources only work on Unix and Windows, see MBEDTLS_NO_PLATFORM_ENTROPY in mbedtls_config.h"
+#endif
+
+#if defined(_WIN32) && !defined(EFIX64) && !defined(EFI32)
+
+#if !defined(_WIN32_WINNT)
+#define _WIN32_WINNT 0x0400
+#endif
+#include <wincrypt.h>
+#include <windows.h>
+
+int mbedtls_platform_entropy_poll(void* data, unsigned char* output, size_t len, size_t* olen) {
+    HCRYPTPROV provider;
+    ((void)data);
+    *olen = 0;
+
+    if (CryptAcquireContext(&provider, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT) == FALSE) {
+        return (MBEDTLS_ERR_ENTROPY_SOURCE_FAILED);
+    }
+
+    if (CryptGenRandom(provider, (DWORD)len, output) == FALSE) {
+        CryptReleaseContext(provider, 0);
+        return (MBEDTLS_ERR_ENTROPY_SOURCE_FAILED);
+    }
+
+    CryptReleaseContext(provider, 0);
+    *olen = len;
+
+    return (0);
+}
+#else /* _WIN32 && !EFIX64 && !EFI32 */
+
+/*
+ * Test for Linux getrandom() support.
+ * Since there is no wrapper in the libc yet, use the generic syscall wrapper
+ * available in GNU libc and compatible libc's (eg uClibc).
+ */
+#if ((defined(__linux__) && defined(__GLIBC__)) || defined(__midipix__))
+#include <unistd.h>
+
+#include <sys/syscall.h>
+#if defined(SYS_getrandom)
+#define HAVE_GETRANDOM
+#include <errno.h>
+
+static int getrandom_wrapper(void* buf, size_t buflen, unsigned int flags) {
+    /* MemSan cannot understand that the syscall writes to the buffer */
+#if defined(__has_feature)
+#if __has_feature(memory_sanitizer)
+    memset(buf, 0, buflen);
+#endif
+#endif
+    return (syscall(SYS_getrandom, buf, buflen, flags));
+}
+#endif /* SYS_getrandom */
+#endif /* __linux__ || __midipix__ */
+
+#if defined(__FreeBSD__) || defined(__DragonFly__)
+#include <sys/param.h>
+#if (defined(__FreeBSD__) && __FreeBSD_version >= 1200000) ||                                      \
+    (defined(__DragonFly__) && __DragonFly_version >= 500700)
+#include <errno.h>
+
+#include <sys/random.h>
+#define HAVE_GETRANDOM
+static int getrandom_wrapper(void* buf, size_t buflen, unsigned int flags) {
+    return getrandom(buf, buflen, flags);
+}
+#endif /* (__FreeBSD__ && __FreeBSD_version >= 1200000) ||                                         \
+          (__DragonFly__ && __DragonFly_version >= 500700) */
+#endif /* __FreeBSD__ || __DragonFly__ */
+
+/*
+ * Some BSD systems provide KERN_ARND.
+ * This is equivalent to reading from /dev/urandom, only it doesn't require an
+ * open file descriptor, and provides up to 256 bytes per call (basically the
+ * same as getentropy(), but with a longer history).
+ *
+ * Documentation: https://netbsd.gw.com/cgi-bin/man-cgi?sysctl+7
+ */
+#if (defined(__FreeBSD__) || defined(__NetBSD__)) && !defined(HAVE_GETRANDOM)
+#include <sys/param.h>
+#include <sys/sysctl.h>
+#if defined(KERN_ARND)
+#define HAVE_SYSCTL_ARND
+
+static int sysctl_arnd_wrapper(unsigned char* buf, size_t buflen) {
+    int name[2];
+    size_t len;
+
+    name[0] = CTL_KERN;
+    name[1] = KERN_ARND;
+
+    while (buflen > 0) {
+        len = buflen > 256 ? 256 : buflen;
+        if (sysctl(name, 2, buf, &len, NULL, 0) == -1)
+            return (-1);
+        buflen -= len;
+        buf += len;
+    }
+    return (0);
+}
+#endif /* KERN_ARND */
+#endif /* __FreeBSD__ || __NetBSD__ */
+
+#include <stdio.h>
+
+int mbedtls_platform_entropy_poll(void* data, unsigned char* output, size_t len, size_t* olen) {
+    FILE* file;
+    size_t read_len;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    ((void)data);
+
+#if defined(HAVE_GETRANDOM)
+    ret = getrandom_wrapper(output, len, 0);
+    if (ret >= 0) {
+        *olen = ret;
+        return (0);
+    } else if (errno != ENOSYS)
+        return (MBEDTLS_ERR_ENTROPY_SOURCE_FAILED);
+        /* Fall through if the system call isn't known. */
+#else
+    ((void)ret);
+#endif /* HAVE_GETRANDOM */
+
+#if defined(HAVE_SYSCTL_ARND)
+    ((void)file);
+    ((void)read_len);
+    if (sysctl_arnd_wrapper(output, len) == -1)
+        return (MBEDTLS_ERR_ENTROPY_SOURCE_FAILED);
+    *olen = len;
+    return (0);
+#else
+
+    *olen = 0;
+
+    file = fopen("/dev/urandom", "rb");
+    if (file == NULL)
+        return (MBEDTLS_ERR_ENTROPY_SOURCE_FAILED);
+
+    read_len = fread(output, 1, len, file);
+    if (read_len != len) {
+        fclose(file);
+        return (MBEDTLS_ERR_ENTROPY_SOURCE_FAILED);
+    }
+
+    fclose(file);
+    *olen = len;
+
+    return (0);
+#endif /* HAVE_SYSCTL_ARND */
+}
+#endif /* _WIN32 && !EFIX64 && !EFI32 */
+#endif /* !MBEDTLS_NO_PLATFORM_ENTROPY */
+
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+int mbedtls_nv_seed_poll(void* data, unsigned char* output, size_t len, size_t* olen) {
+    unsigned char buf[MBEDTLS_ENTROPY_BLOCK_SIZE];
+    size_t use_len = MBEDTLS_ENTROPY_BLOCK_SIZE;
+    ((void)data);
+
+    memset(buf, 0, MBEDTLS_ENTROPY_BLOCK_SIZE);
+
+    if (mbedtls_nv_seed_read(buf, MBEDTLS_ENTROPY_BLOCK_SIZE) < 0)
+        return (MBEDTLS_ERR_ENTROPY_SOURCE_FAILED);
+
+    if (len < use_len)
+        use_len = len;
+
+    memcpy(output, buf, use_len);
+    *olen = use_len;
+
+    return (0);
+}
+#endif /* MBEDTLS_ENTROPY_NV_SEED */
+
+#endif /* MBEDTLS_ENTROPY_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/entropy_poll.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/entropy_poll.h
new file mode 100644
index 0000000000..26a71ea1ff
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/entropy_poll.h
@@ -0,0 +1,73 @@
+/**
+ * \file entropy_poll.h
+ *
+ * \brief Platform-specific and custom entropy polling functions
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_ENTROPY_POLL_H
+#define MBEDTLS_ENTROPY_POLL_H
+
+#include <stddef.h>
+
+#include "mbedtls/build_info.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+ * Default thresholds for built-in sources, in bytes
+ */
+#define MBEDTLS_ENTROPY_MIN_PLATFORM 32 /**< Minimum for platform source    */
+#if !defined(MBEDTLS_ENTROPY_MIN_HARDWARE)
+#define MBEDTLS_ENTROPY_MIN_HARDWARE 32 /**< Minimum for the hardware source */
+#endif
+
+#if !defined(MBEDTLS_NO_PLATFORM_ENTROPY)
+/**
+ * \brief           Platform-specific entropy poll callback
+ */
+int mbedtls_platform_entropy_poll(void* data, unsigned char* output, size_t len, size_t* olen);
+#endif
+
+#if defined(MBEDTLS_ENTROPY_HARDWARE_ALT)
+/**
+ * \brief           Entropy poll callback for a hardware source
+ *
+ * \warning         This is not provided by mbed TLS!
+ *                  See \c MBEDTLS_ENTROPY_HARDWARE_ALT in mbedtls_config.h.
+ *
+ * \note            This must accept NULL as its first argument.
+ */
+int mbedtls_hardware_poll(void* data, unsigned char* output, size_t len, size_t* olen);
+#endif
+
+#if defined(MBEDTLS_ENTROPY_NV_SEED)
+/**
+ * \brief           Entropy poll callback for a non-volatile seed file
+ *
+ * \note            This must accept NULL as its first argument.
+ */
+int mbedtls_nv_seed_poll(void* data, unsigned char* output, size_t len, size_t* olen);
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* entropy_poll.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/gcm.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/gcm.cpp
new file mode 100644
index 0000000000..cccba00af1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/gcm.cpp
@@ -0,0 +1,954 @@
+/*
+ *  NIST SP800-38D compliant GCM implementation
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+/*
+ * http://csrc.nist.gov/publications/nistpubs/800-38D/SP-800-38D.pdf
+ *
+ * See also:
+ * [MGV] http://csrc.nist.gov/groups/ST/toolkit/BCM/documents/proposedmodes/gcm/gcm-revised-spec.pdf
+ *
+ * We use the algorithm described as Shoup's method with 4-bit tables in
+ * [MGV] 4.1, pp. 12-13, to enhance speed without using too much memory.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_GCM_C)
+
+#include <string.h>
+
+#include "mbedtls/error.h"
+#include "mbedtls/gcm.h"
+#include "mbedtls/platform_util.h"
+
+#if defined(MBEDTLS_AESNI_C)
+#include "aesni.h"
+#endif
+
+#if defined(MBEDTLS_SELF_TEST) && defined(MBEDTLS_AES_C)
+#include "mbedtls/aes.h"
+#include "mbedtls/platform.h"
+#if !defined(MBEDTLS_PLATFORM_C)
+#include <stdio.h>
+#define mbedtls_printf printf
+#endif /* MBEDTLS_PLATFORM_C */
+#endif /* MBEDTLS_SELF_TEST && MBEDTLS_AES_C */
+
+#if !defined(MBEDTLS_GCM_ALT)
+
+/* Parameter validation macros */
+#define GCM_VALIDATE_RET(cond) MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_GCM_BAD_INPUT)
+#define GCM_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+/*
+ * Initialize a context
+ */
+void mbedtls_gcm_init(mbedtls_gcm_context* ctx) {
+    GCM_VALIDATE(ctx != NULL);
+    memset(ctx, 0, sizeof(mbedtls_gcm_context));
+}
+
+/*
+ * Precompute small multiples of H, that is set
+ *      HH[i] || HL[i] = H times i,
+ * where i is seen as a field element as in [MGV], ie high-order bits
+ * correspond to low powers of P. The result is stored in the same way, that
+ * is the high-order bit of HH corresponds to P^0 and the low-order bit of HL
+ * corresponds to P^127.
+ */
+static int gcm_gen_table(mbedtls_gcm_context* ctx) {
+    int ret, i, j;
+    uint64_t hi, lo;
+    uint64_t vl, vh;
+    unsigned char h[16];
+    size_t olen = 0;
+
+    memset(h, 0, 16);
+    if ((ret = mbedtls_cipher_update(&ctx->cipher_ctx, h, 16, h, &olen)) != 0)
+        return (ret);
+
+    /* pack h as two 64-bits ints, big-endian */
+    hi = MBEDTLS_GET_UINT32_BE(h, 0);
+    lo = MBEDTLS_GET_UINT32_BE(h, 4);
+    vh = (uint64_t)hi << 32 | lo;
+
+    hi = MBEDTLS_GET_UINT32_BE(h, 8);
+    lo = MBEDTLS_GET_UINT32_BE(h, 12);
+    vl = (uint64_t)hi << 32 | lo;
+
+    /* 8 = 1000 corresponds to 1 in GF(2^128) */
+    ctx->HL[8] = vl;
+    ctx->HH[8] = vh;
+
+#if defined(MBEDTLS_AESNI_C) && defined(MBEDTLS_HAVE_X86_64)
+    /* With CLMUL support, we need only h, not the rest of the table */
+    if (mbedtls_aesni_has_support(MBEDTLS_AESNI_CLMUL))
+        return (0);
+#endif
+
+    /* 0 corresponds to 0 in GF(2^128) */
+    ctx->HH[0] = 0;
+    ctx->HL[0] = 0;
+
+    for (i = 4; i > 0; i >>= 1) {
+        uint32_t T = (vl & 1) * 0xe1000000U;
+        vl = (vh << 63) | (vl >> 1);
+        vh = (vh >> 1) ^ ((uint64_t)T << 32);
+
+        ctx->HL[i] = vl;
+        ctx->HH[i] = vh;
+    }
+
+    for (i = 2; i <= 8; i *= 2) {
+        uint64_t *HiL = ctx->HL + i, *HiH = ctx->HH + i;
+        vh = *HiH;
+        vl = *HiL;
+        for (j = 1; j < i; j++) {
+            HiH[j] = vh ^ ctx->HH[j];
+            HiL[j] = vl ^ ctx->HL[j];
+        }
+    }
+
+    return (0);
+}
+
+int mbedtls_gcm_setkey(mbedtls_gcm_context* ctx, mbedtls_cipher_id_t cipher,
+    const unsigned char* key, unsigned int keybits) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    const mbedtls_cipher_info_t* cipher_info;
+
+    GCM_VALIDATE_RET(ctx != NULL);
+    GCM_VALIDATE_RET(key != NULL);
+    GCM_VALIDATE_RET(keybits == 128 || keybits == 192 || keybits == 256);
+
+    cipher_info = mbedtls_cipher_info_from_values(cipher, keybits, MBEDTLS_MODE_ECB);
+    if (cipher_info == NULL)
+        return (MBEDTLS_ERR_GCM_BAD_INPUT);
+
+    if (cipher_info->block_size != 16)
+        return (MBEDTLS_ERR_GCM_BAD_INPUT);
+
+    mbedtls_cipher_free(&ctx->cipher_ctx);
+
+    if ((ret = mbedtls_cipher_setup(&ctx->cipher_ctx, cipher_info)) != 0)
+        return (ret);
+
+    if ((ret = mbedtls_cipher_setkey(&ctx->cipher_ctx, key, keybits, MBEDTLS_ENCRYPT)) != 0) {
+        return (ret);
+    }
+
+    if ((ret = gcm_gen_table(ctx)) != 0)
+        return (ret);
+
+    return (0);
+}
+
+/*
+ * Shoup's method for multiplication use this table with
+ *      last4[x] = x times P^128
+ * where x and last4[x] are seen as elements of GF(2^128) as in [MGV]
+ */
+static const uint64_t last4[16] = {0x0000, 0x1c20, 0x3840, 0x2460, 0x7080, 0x6ca0, 0x48c0, 0x54e0,
+    0xe100, 0xfd20, 0xd940, 0xc560, 0x9180, 0x8da0, 0xa9c0, 0xb5e0};
+
+/*
+ * Sets output to x times H using the precomputed tables.
+ * x and output are seen as elements of GF(2^128) as in [MGV].
+ */
+static void gcm_mult(mbedtls_gcm_context* ctx, const unsigned char x[16],
+    unsigned char output[16]) {
+    int i = 0;
+    unsigned char lo, hi, rem;
+    uint64_t zh, zl;
+
+#if defined(MBEDTLS_AESNI_C) && defined(MBEDTLS_HAVE_X86_64)
+    if (mbedtls_aesni_has_support(MBEDTLS_AESNI_CLMUL)) {
+        unsigned char h[16];
+
+        MBEDTLS_PUT_UINT32_BE(ctx->HH[8] >> 32, h, 0);
+        MBEDTLS_PUT_UINT32_BE(ctx->HH[8], h, 4);
+        MBEDTLS_PUT_UINT32_BE(ctx->HL[8] >> 32, h, 8);
+        MBEDTLS_PUT_UINT32_BE(ctx->HL[8], h, 12);
+
+        mbedtls_aesni_gcm_mult(output, x, h);
+        return;
+    }
+#endif /* MBEDTLS_AESNI_C && MBEDTLS_HAVE_X86_64 */
+
+    lo = x[15] & 0xf;
+
+    zh = ctx->HH[lo];
+    zl = ctx->HL[lo];
+
+    for (i = 15; i >= 0; i--) {
+        lo = x[i] & 0xf;
+        hi = (x[i] >> 4) & 0xf;
+
+        if (i != 15) {
+            rem = (unsigned char)zl & 0xf;
+            zl = (zh << 60) | (zl >> 4);
+            zh = (zh >> 4);
+            zh ^= (uint64_t)last4[rem] << 48;
+            zh ^= ctx->HH[lo];
+            zl ^= ctx->HL[lo];
+        }
+
+        rem = (unsigned char)zl & 0xf;
+        zl = (zh << 60) | (zl >> 4);
+        zh = (zh >> 4);
+        zh ^= (uint64_t)last4[rem] << 48;
+        zh ^= ctx->HH[hi];
+        zl ^= ctx->HL[hi];
+    }
+
+    MBEDTLS_PUT_UINT32_BE(zh >> 32, output, 0);
+    MBEDTLS_PUT_UINT32_BE(zh, output, 4);
+    MBEDTLS_PUT_UINT32_BE(zl >> 32, output, 8);
+    MBEDTLS_PUT_UINT32_BE(zl, output, 12);
+}
+
+int mbedtls_gcm_starts(mbedtls_gcm_context* ctx, int mode, const unsigned char* iv, size_t iv_len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char work_buf[16];
+    size_t i;
+    const unsigned char* p;
+    size_t use_len, olen = 0;
+    uint64_t iv_bits;
+
+    GCM_VALIDATE_RET(ctx != NULL);
+    GCM_VALIDATE_RET(iv != NULL);
+
+    /* IV is limited to 2^64 bits, so 2^61 bytes */
+    /* IV is not allowed to be zero length */
+    if (iv_len == 0 || (uint64_t)iv_len >> 61 != 0)
+        return (MBEDTLS_ERR_GCM_BAD_INPUT);
+
+    memset(ctx->y, 0x00, sizeof(ctx->y));
+    memset(ctx->buf, 0x00, sizeof(ctx->buf));
+
+    ctx->mode = mode;
+    ctx->len = 0;
+    ctx->add_len = 0;
+
+    if (iv_len == 12) {
+        memcpy(ctx->y, iv, iv_len);
+        ctx->y[15] = 1;
+    } else {
+        memset(work_buf, 0x00, 16);
+        iv_bits = (uint64_t)iv_len * 8;
+        MBEDTLS_PUT_UINT64_BE(iv_bits, work_buf, 8);
+
+        p = iv;
+        while (iv_len > 0) {
+            use_len = (iv_len < 16) ? iv_len : 16;
+
+            for (i = 0; i < use_len; i++)
+                ctx->y[i] ^= p[i];
+
+            gcm_mult(ctx, ctx->y, ctx->y);
+
+            iv_len -= use_len;
+            p += use_len;
+        }
+
+        for (i = 0; i < 16; i++)
+            ctx->y[i] ^= work_buf[i];
+
+        gcm_mult(ctx, ctx->y, ctx->y);
+    }
+
+    if ((ret = mbedtls_cipher_update(&ctx->cipher_ctx, ctx->y, 16, ctx->base_ectr, &olen)) != 0) {
+        return (ret);
+    }
+
+    return (0);
+}
+
+/**
+ * mbedtls_gcm_context::buf contains the partial state of the computation of
+ * the authentication tag.
+ * mbedtls_gcm_context::add_len and mbedtls_gcm_context::len indicate
+ * different stages of the computation:
+ *     * len == 0 && add_len == 0:      initial state
+ *     * len == 0 && add_len % 16 != 0: the first `add_len % 16` bytes have
+ *                                      a partial block of AD that has been
+ *                                      xored in but not yet multiplied in.
+ *     * len == 0 && add_len % 16 == 0: the authentication tag is correct if
+ *                                      the data ends now.
+ *     * len % 16 != 0:                 the first `len % 16` bytes have
+ *                                      a partial block of ciphertext that has
+ *                                      been xored in but not yet multiplied in.
+ *     * len > 0 && len % 16 == 0:      the authentication tag is correct if
+ *                                      the data ends now.
+ */
+int mbedtls_gcm_update_ad(mbedtls_gcm_context* ctx, const unsigned char* add, size_t add_len) {
+    const unsigned char* p;
+    size_t use_len, i, offset;
+
+    GCM_VALIDATE_RET(add_len == 0 || add != NULL);
+
+    /* IV is limited to 2^64 bits, so 2^61 bytes */
+    if ((uint64_t)add_len >> 61 != 0)
+        return (MBEDTLS_ERR_GCM_BAD_INPUT);
+
+    offset = ctx->add_len % 16;
+    p = add;
+
+    if (offset != 0) {
+        use_len = 16 - offset;
+        if (use_len > add_len)
+            use_len = add_len;
+
+        for (i = 0; i < use_len; i++)
+            ctx->buf[i + offset] ^= p[i];
+
+        if (offset + use_len == 16)
+            gcm_mult(ctx, ctx->buf, ctx->buf);
+
+        ctx->add_len += use_len;
+        add_len -= use_len;
+        p += use_len;
+    }
+
+    ctx->add_len += add_len;
+
+    while (add_len >= 16) {
+        for (i = 0; i < 16; i++)
+            ctx->buf[i] ^= p[i];
+
+        gcm_mult(ctx, ctx->buf, ctx->buf);
+
+        add_len -= 16;
+        p += 16;
+    }
+
+    if (add_len > 0) {
+        for (i = 0; i < add_len; i++)
+            ctx->buf[i] ^= p[i];
+    }
+
+    return (0);
+}
+
+/* Increment the counter. */
+static void gcm_incr(unsigned char y[16]) {
+    size_t i;
+    for (i = 16; i > 12; i--)
+        if (++y[i - 1] != 0)
+            break;
+}
+
+/* Calculate and apply the encryption mask. Process use_len bytes of data,
+ * starting at position offset in the mask block. */
+static int gcm_mask(mbedtls_gcm_context* ctx, unsigned char ectr[16], size_t offset, size_t use_len,
+    const unsigned char* input, unsigned char* output) {
+    size_t i;
+    size_t olen = 0;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    if ((ret = mbedtls_cipher_update(&ctx->cipher_ctx, ctx->y, 16, ectr, &olen)) != 0) {
+        mbedtls_platform_zeroize(ectr, 16);
+        return (ret);
+    }
+
+    for (i = 0; i < use_len; i++) {
+        if (ctx->mode == MBEDTLS_GCM_DECRYPT)
+            ctx->buf[offset + i] ^= input[i];
+        output[i] = ectr[offset + i] ^ input[i];
+        if (ctx->mode == MBEDTLS_GCM_ENCRYPT)
+            ctx->buf[offset + i] ^= output[i];
+    }
+    return (0);
+}
+
+int mbedtls_gcm_update(mbedtls_gcm_context* ctx, const unsigned char* input, size_t input_length,
+    unsigned char* output, size_t output_size, size_t* output_length) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    const unsigned char* p = input;
+    unsigned char* out_p = output;
+    size_t offset;
+    unsigned char ectr[16];
+
+    if (output_size < input_length)
+        return (MBEDTLS_ERR_GCM_BUFFER_TOO_SMALL);
+    GCM_VALIDATE_RET(output_length != NULL);
+    *output_length = input_length;
+
+    /* Exit early if input_length==0 so that we don't do any pointer arithmetic
+     * on a potentially null pointer.
+     * Returning early also means that the last partial block of AD remains
+     * untouched for mbedtls_gcm_finish */
+    if (input_length == 0)
+        return (0);
+
+    GCM_VALIDATE_RET(ctx != NULL);
+    GCM_VALIDATE_RET(input != NULL);
+    GCM_VALIDATE_RET(output != NULL);
+
+    if (output > input && (size_t)(output - input) < input_length)
+        return (MBEDTLS_ERR_GCM_BAD_INPUT);
+
+    /* Total length is restricted to 2^39 - 256 bits, ie 2^36 - 2^5 bytes
+     * Also check for possible overflow */
+    if (ctx->len + input_length < ctx->len || (uint64_t)ctx->len + input_length > 0xFFFFFFFE0ull) {
+        return (MBEDTLS_ERR_GCM_BAD_INPUT);
+    }
+
+    if (ctx->len == 0 && ctx->add_len % 16 != 0) {
+        gcm_mult(ctx, ctx->buf, ctx->buf);
+    }
+
+    offset = ctx->len % 16;
+    if (offset != 0) {
+        size_t use_len = 16 - offset;
+        if (use_len > input_length)
+            use_len = input_length;
+
+        if ((ret = gcm_mask(ctx, ectr, offset, use_len, p, out_p)) != 0)
+            return (ret);
+
+        if (offset + use_len == 16)
+            gcm_mult(ctx, ctx->buf, ctx->buf);
+
+        ctx->len += use_len;
+        input_length -= use_len;
+        p += use_len;
+        out_p += use_len;
+    }
+
+    ctx->len += input_length;
+
+    while (input_length >= 16) {
+        gcm_incr(ctx->y);
+        if ((ret = gcm_mask(ctx, ectr, 0, 16, p, out_p)) != 0)
+            return (ret);
+
+        gcm_mult(ctx, ctx->buf, ctx->buf);
+
+        input_length -= 16;
+        p += 16;
+        out_p += 16;
+    }
+
+    if (input_length > 0) {
+        gcm_incr(ctx->y);
+        if ((ret = gcm_mask(ctx, ectr, 0, input_length, p, out_p)) != 0)
+            return (ret);
+    }
+
+    mbedtls_platform_zeroize(ectr, sizeof(ectr));
+    return (0);
+}
+
+int mbedtls_gcm_finish(mbedtls_gcm_context* ctx, unsigned char* output, size_t output_size,
+    size_t* output_length, unsigned char* tag, size_t tag_len) {
+    unsigned char work_buf[16];
+    size_t i;
+    uint64_t orig_len;
+    uint64_t orig_add_len;
+
+    GCM_VALIDATE_RET(ctx != NULL);
+    GCM_VALIDATE_RET(tag != NULL);
+
+    /* We never pass any output in finish(). The output parameter exists only
+     * for the sake of alternative implementations. */
+    (void)output;
+    (void)output_size;
+    *output_length = 0;
+
+    orig_len = ctx->len * 8;
+    orig_add_len = ctx->add_len * 8;
+
+    if (ctx->len == 0 && ctx->add_len % 16 != 0) {
+        gcm_mult(ctx, ctx->buf, ctx->buf);
+    }
+
+    if (tag_len > 16 || tag_len < 4)
+        return (MBEDTLS_ERR_GCM_BAD_INPUT);
+
+    if (ctx->len % 16 != 0)
+        gcm_mult(ctx, ctx->buf, ctx->buf);
+
+    memcpy(tag, ctx->base_ectr, tag_len);
+
+    if (orig_len || orig_add_len) {
+        memset(work_buf, 0x00, 16);
+
+        MBEDTLS_PUT_UINT32_BE((orig_add_len >> 32), work_buf, 0);
+        MBEDTLS_PUT_UINT32_BE((orig_add_len), work_buf, 4);
+        MBEDTLS_PUT_UINT32_BE((orig_len >> 32), work_buf, 8);
+        MBEDTLS_PUT_UINT32_BE((orig_len), work_buf, 12);
+
+        for (i = 0; i < 16; i++)
+            ctx->buf[i] ^= work_buf[i];
+
+        gcm_mult(ctx, ctx->buf, ctx->buf);
+
+        for (i = 0; i < tag_len; i++)
+            tag[i] ^= ctx->buf[i];
+    }
+
+    return (0);
+}
+
+int mbedtls_gcm_crypt_and_tag(mbedtls_gcm_context* ctx, int mode, size_t length,
+    const unsigned char* iv, size_t iv_len, const unsigned char* add, size_t add_len,
+    const unsigned char* input, unsigned char* output, size_t tag_len, unsigned char* tag) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t olen;
+
+    GCM_VALIDATE_RET(ctx != NULL);
+    GCM_VALIDATE_RET(iv != NULL);
+    GCM_VALIDATE_RET(add_len == 0 || add != NULL);
+    GCM_VALIDATE_RET(length == 0 || input != NULL);
+    GCM_VALIDATE_RET(length == 0 || output != NULL);
+    GCM_VALIDATE_RET(tag != NULL);
+
+    if ((ret = mbedtls_gcm_starts(ctx, mode, iv, iv_len)) != 0)
+        return (ret);
+
+    if ((ret = mbedtls_gcm_update_ad(ctx, add, add_len)) != 0)
+        return (ret);
+
+    if ((ret = mbedtls_gcm_update(ctx, input, length, output, length, &olen)) != 0)
+        return (ret);
+
+    if ((ret = mbedtls_gcm_finish(ctx, NULL, 0, &olen, tag, tag_len)) != 0)
+        return (ret);
+
+    return (0);
+}
+
+int mbedtls_gcm_auth_decrypt(mbedtls_gcm_context* ctx, size_t length, const unsigned char* iv,
+    size_t iv_len, const unsigned char* add, size_t add_len, const unsigned char* tag,
+    size_t tag_len, const unsigned char* input, unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char check_tag[16];
+    size_t i;
+    int diff;
+
+    GCM_VALIDATE_RET(ctx != NULL);
+    GCM_VALIDATE_RET(iv != NULL);
+    GCM_VALIDATE_RET(add_len == 0 || add != NULL);
+    GCM_VALIDATE_RET(tag != NULL);
+    GCM_VALIDATE_RET(length == 0 || input != NULL);
+    GCM_VALIDATE_RET(length == 0 || output != NULL);
+
+    if ((ret = mbedtls_gcm_crypt_and_tag(ctx, MBEDTLS_GCM_DECRYPT, length, iv, iv_len, add, add_len,
+             input, output, tag_len, check_tag)) != 0) {
+        return (ret);
+    }
+
+    /* Check tag in "constant-time" */
+    for (diff = 0, i = 0; i < tag_len; i++)
+        diff |= tag[i] ^ check_tag[i];
+
+    if (diff != 0) {
+        mbedtls_platform_zeroize(output, length);
+        return (MBEDTLS_ERR_GCM_AUTH_FAILED);
+    }
+
+    return (0);
+}
+
+void mbedtls_gcm_free(mbedtls_gcm_context* ctx) {
+    if (ctx == NULL)
+        return;
+    mbedtls_cipher_free(&ctx->cipher_ctx);
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_gcm_context));
+}
+
+#endif /* !MBEDTLS_GCM_ALT */
+
+#if defined(MBEDTLS_SELF_TEST) && defined(MBEDTLS_AES_C)
+/*
+ * AES-GCM test vectors from:
+ *
+ * http://csrc.nist.gov/groups/STM/cavp/documents/mac/gcmtestvectors.zip
+ */
+#define MAX_TESTS 6
+
+static const int key_index_test_data[MAX_TESTS] = {0, 0, 1, 1, 1, 1};
+
+static const unsigned char key_test_data[MAX_TESTS][32] = {
+    {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00},
+    {0xfe, 0xff, 0xe9, 0x92, 0x86, 0x65, 0x73, 0x1c, 0x6d, 0x6a, 0x8f, 0x94, 0x67, 0x30, 0x83, 0x08,
+        0xfe, 0xff, 0xe9, 0x92, 0x86, 0x65, 0x73, 0x1c, 0x6d, 0x6a, 0x8f, 0x94, 0x67, 0x30, 0x83,
+        0x08},
+};
+
+static const size_t iv_len_test_data[MAX_TESTS] = {12, 12, 12, 12, 8, 60};
+
+static const int iv_index_test_data[MAX_TESTS] = {0, 0, 1, 1, 1, 2};
+
+static const unsigned char iv_test_data[MAX_TESTS][64] = {
+    {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00},
+    {0xca, 0xfe, 0xba, 0xbe, 0xfa, 0xce, 0xdb, 0xad, 0xde, 0xca, 0xf8, 0x88},
+    {0x93, 0x13, 0x22, 0x5d, 0xf8, 0x84, 0x06, 0xe5, 0x55, 0x90, 0x9c, 0x5a, 0xff, 0x52, 0x69, 0xaa,
+        0x6a, 0x7a, 0x95, 0x38, 0x53, 0x4f, 0x7d, 0xa1, 0xe4, 0xc3, 0x03, 0xd2, 0xa3, 0x18, 0xa7,
+        0x28, 0xc3, 0xc0, 0xc9, 0x51, 0x56, 0x80, 0x95, 0x39, 0xfc, 0xf0, 0xe2, 0x42, 0x9a, 0x6b,
+        0x52, 0x54, 0x16, 0xae, 0xdb, 0xf5, 0xa0, 0xde, 0x6a, 0x57, 0xa6, 0x37, 0xb3, 0x9b},
+};
+
+static const size_t add_len_test_data[MAX_TESTS] = {0, 0, 0, 20, 20, 20};
+
+static const int add_index_test_data[MAX_TESTS] = {0, 0, 0, 1, 1, 1};
+
+static const unsigned char additional_test_data[MAX_TESTS][64] = {
+    {0x00},
+    {0xfe, 0xed, 0xfa, 0xce, 0xde, 0xad, 0xbe, 0xef, 0xfe, 0xed, 0xfa, 0xce, 0xde, 0xad, 0xbe, 0xef,
+        0xab, 0xad, 0xda, 0xd2},
+};
+
+static const size_t pt_len_test_data[MAX_TESTS] = {0, 16, 64, 60, 60, 60};
+
+static const int pt_index_test_data[MAX_TESTS] = {0, 0, 1, 1, 1, 1};
+
+static const unsigned char pt_test_data[MAX_TESTS][64] = {
+    {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00},
+    {0xd9, 0x31, 0x32, 0x25, 0xf8, 0x84, 0x06, 0xe5, 0xa5, 0x59, 0x09, 0xc5, 0xaf, 0xf5, 0x26, 0x9a,
+        0x86, 0xa7, 0xa9, 0x53, 0x15, 0x34, 0xf7, 0xda, 0x2e, 0x4c, 0x30, 0x3d, 0x8a, 0x31, 0x8a,
+        0x72, 0x1c, 0x3c, 0x0c, 0x95, 0x95, 0x68, 0x09, 0x53, 0x2f, 0xcf, 0x0e, 0x24, 0x49, 0xa6,
+        0xb5, 0x25, 0xb1, 0x6a, 0xed, 0xf5, 0xaa, 0x0d, 0xe6, 0x57, 0xba, 0x63, 0x7b, 0x39, 0x1a,
+        0xaf, 0xd2, 0x55},
+};
+
+static const unsigned char ct_test_data[MAX_TESTS * 3][64] = {
+    {0x00},
+    {0x03, 0x88, 0xda, 0xce, 0x60, 0xb6, 0xa3, 0x92, 0xf3, 0x28, 0xc2, 0xb9, 0x71, 0xb2, 0xfe,
+        0x78},
+    {0x42, 0x83, 0x1e, 0xc2, 0x21, 0x77, 0x74, 0x24, 0x4b, 0x72, 0x21, 0xb7, 0x84, 0xd0, 0xd4, 0x9c,
+        0xe3, 0xaa, 0x21, 0x2f, 0x2c, 0x02, 0xa4, 0xe0, 0x35, 0xc1, 0x7e, 0x23, 0x29, 0xac, 0xa1,
+        0x2e, 0x21, 0xd5, 0x14, 0xb2, 0x54, 0x66, 0x93, 0x1c, 0x7d, 0x8f, 0x6a, 0x5a, 0xac, 0x84,
+        0xaa, 0x05, 0x1b, 0xa3, 0x0b, 0x39, 0x6a, 0x0a, 0xac, 0x97, 0x3d, 0x58, 0xe0, 0x91, 0x47,
+        0x3f, 0x59, 0x85},
+    {0x42, 0x83, 0x1e, 0xc2, 0x21, 0x77, 0x74, 0x24, 0x4b, 0x72, 0x21, 0xb7, 0x84, 0xd0, 0xd4, 0x9c,
+        0xe3, 0xaa, 0x21, 0x2f, 0x2c, 0x02, 0xa4, 0xe0, 0x35, 0xc1, 0x7e, 0x23, 0x29, 0xac, 0xa1,
+        0x2e, 0x21, 0xd5, 0x14, 0xb2, 0x54, 0x66, 0x93, 0x1c, 0x7d, 0x8f, 0x6a, 0x5a, 0xac, 0x84,
+        0xaa, 0x05, 0x1b, 0xa3, 0x0b, 0x39, 0x6a, 0x0a, 0xac, 0x97, 0x3d, 0x58, 0xe0, 0x91},
+    {0x61, 0x35, 0x3b, 0x4c, 0x28, 0x06, 0x93, 0x4a, 0x77, 0x7f, 0xf5, 0x1f, 0xa2, 0x2a, 0x47, 0x55,
+        0x69, 0x9b, 0x2a, 0x71, 0x4f, 0xcd, 0xc6, 0xf8, 0x37, 0x66, 0xe5, 0xf9, 0x7b, 0x6c, 0x74,
+        0x23, 0x73, 0x80, 0x69, 0x00, 0xe4, 0x9f, 0x24, 0xb2, 0x2b, 0x09, 0x75, 0x44, 0xd4, 0x89,
+        0x6b, 0x42, 0x49, 0x89, 0xb5, 0xe1, 0xeb, 0xac, 0x0f, 0x07, 0xc2, 0x3f, 0x45, 0x98},
+    {0x8c, 0xe2, 0x49, 0x98, 0x62, 0x56, 0x15, 0xb6, 0x03, 0xa0, 0x33, 0xac, 0xa1, 0x3f, 0xb8, 0x94,
+        0xbe, 0x91, 0x12, 0xa5, 0xc3, 0xa2, 0x11, 0xa8, 0xba, 0x26, 0x2a, 0x3c, 0xca, 0x7e, 0x2c,
+        0xa7, 0x01, 0xe4, 0xa9, 0xa4, 0xfb, 0xa4, 0x3c, 0x90, 0xcc, 0xdc, 0xb2, 0x81, 0xd4, 0x8c,
+        0x7c, 0x6f, 0xd6, 0x28, 0x75, 0xd2, 0xac, 0xa4, 0x17, 0x03, 0x4c, 0x34, 0xae, 0xe5},
+    {0x00},
+    {0x98, 0xe7, 0x24, 0x7c, 0x07, 0xf0, 0xfe, 0x41, 0x1c, 0x26, 0x7e, 0x43, 0x84, 0xb0, 0xf6,
+        0x00},
+    {0x39, 0x80, 0xca, 0x0b, 0x3c, 0x00, 0xe8, 0x41, 0xeb, 0x06, 0xfa, 0xc4, 0x87, 0x2a, 0x27, 0x57,
+        0x85, 0x9e, 0x1c, 0xea, 0xa6, 0xef, 0xd9, 0x84, 0x62, 0x85, 0x93, 0xb4, 0x0c, 0xa1, 0xe1,
+        0x9c, 0x7d, 0x77, 0x3d, 0x00, 0xc1, 0x44, 0xc5, 0x25, 0xac, 0x61, 0x9d, 0x18, 0xc8, 0x4a,
+        0x3f, 0x47, 0x18, 0xe2, 0x44, 0x8b, 0x2f, 0xe3, 0x24, 0xd9, 0xcc, 0xda, 0x27, 0x10, 0xac,
+        0xad, 0xe2, 0x56},
+    {0x39, 0x80, 0xca, 0x0b, 0x3c, 0x00, 0xe8, 0x41, 0xeb, 0x06, 0xfa, 0xc4, 0x87, 0x2a, 0x27, 0x57,
+        0x85, 0x9e, 0x1c, 0xea, 0xa6, 0xef, 0xd9, 0x84, 0x62, 0x85, 0x93, 0xb4, 0x0c, 0xa1, 0xe1,
+        0x9c, 0x7d, 0x77, 0x3d, 0x00, 0xc1, 0x44, 0xc5, 0x25, 0xac, 0x61, 0x9d, 0x18, 0xc8, 0x4a,
+        0x3f, 0x47, 0x18, 0xe2, 0x44, 0x8b, 0x2f, 0xe3, 0x24, 0xd9, 0xcc, 0xda, 0x27, 0x10},
+    {0x0f, 0x10, 0xf5, 0x99, 0xae, 0x14, 0xa1, 0x54, 0xed, 0x24, 0xb3, 0x6e, 0x25, 0x32, 0x4d, 0xb8,
+        0xc5, 0x66, 0x63, 0x2e, 0xf2, 0xbb, 0xb3, 0x4f, 0x83, 0x47, 0x28, 0x0f, 0xc4, 0x50, 0x70,
+        0x57, 0xfd, 0xdc, 0x29, 0xdf, 0x9a, 0x47, 0x1f, 0x75, 0xc6, 0x65, 0x41, 0xd4, 0xd4, 0xda,
+        0xd1, 0xc9, 0xe9, 0x3a, 0x19, 0xa5, 0x8e, 0x8b, 0x47, 0x3f, 0xa0, 0xf0, 0x62, 0xf7},
+    {0xd2, 0x7e, 0x88, 0x68, 0x1c, 0xe3, 0x24, 0x3c, 0x48, 0x30, 0x16, 0x5a, 0x8f, 0xdc, 0xf9, 0xff,
+        0x1d, 0xe9, 0xa1, 0xd8, 0xe6, 0xb4, 0x47, 0xef, 0x6e, 0xf7, 0xb7, 0x98, 0x28, 0x66, 0x6e,
+        0x45, 0x81, 0xe7, 0x90, 0x12, 0xaf, 0x34, 0xdd, 0xd9, 0xe2, 0xf0, 0x37, 0x58, 0x9b, 0x29,
+        0x2d, 0xb3, 0xe6, 0x7c, 0x03, 0x67, 0x45, 0xfa, 0x22, 0xe7, 0xe9, 0xb7, 0x37, 0x3b},
+    {0x00},
+    {0xce, 0xa7, 0x40, 0x3d, 0x4d, 0x60, 0x6b, 0x6e, 0x07, 0x4e, 0xc5, 0xd3, 0xba, 0xf3, 0x9d,
+        0x18},
+    {0x52, 0x2d, 0xc1, 0xf0, 0x99, 0x56, 0x7d, 0x07, 0xf4, 0x7f, 0x37, 0xa3, 0x2a, 0x84, 0x42, 0x7d,
+        0x64, 0x3a, 0x8c, 0xdc, 0xbf, 0xe5, 0xc0, 0xc9, 0x75, 0x98, 0xa2, 0xbd, 0x25, 0x55, 0xd1,
+        0xaa, 0x8c, 0xb0, 0x8e, 0x48, 0x59, 0x0d, 0xbb, 0x3d, 0xa7, 0xb0, 0x8b, 0x10, 0x56, 0x82,
+        0x88, 0x38, 0xc5, 0xf6, 0x1e, 0x63, 0x93, 0xba, 0x7a, 0x0a, 0xbc, 0xc9, 0xf6, 0x62, 0x89,
+        0x80, 0x15, 0xad},
+    {0x52, 0x2d, 0xc1, 0xf0, 0x99, 0x56, 0x7d, 0x07, 0xf4, 0x7f, 0x37, 0xa3, 0x2a, 0x84, 0x42, 0x7d,
+        0x64, 0x3a, 0x8c, 0xdc, 0xbf, 0xe5, 0xc0, 0xc9, 0x75, 0x98, 0xa2, 0xbd, 0x25, 0x55, 0xd1,
+        0xaa, 0x8c, 0xb0, 0x8e, 0x48, 0x59, 0x0d, 0xbb, 0x3d, 0xa7, 0xb0, 0x8b, 0x10, 0x56, 0x82,
+        0x88, 0x38, 0xc5, 0xf6, 0x1e, 0x63, 0x93, 0xba, 0x7a, 0x0a, 0xbc, 0xc9, 0xf6, 0x62},
+    {0xc3, 0x76, 0x2d, 0xf1, 0xca, 0x78, 0x7d, 0x32, 0xae, 0x47, 0xc1, 0x3b, 0xf1, 0x98, 0x44, 0xcb,
+        0xaf, 0x1a, 0xe1, 0x4d, 0x0b, 0x97, 0x6a, 0xfa, 0xc5, 0x2f, 0xf7, 0xd7, 0x9b, 0xba, 0x9d,
+        0xe0, 0xfe, 0xb5, 0x82, 0xd3, 0x39, 0x34, 0xa4, 0xf0, 0x95, 0x4c, 0xc2, 0x36, 0x3b, 0xc7,
+        0x3f, 0x78, 0x62, 0xac, 0x43, 0x0e, 0x64, 0xab, 0xe4, 0x99, 0xf4, 0x7c, 0x9b, 0x1f},
+    {0x5a, 0x8d, 0xef, 0x2f, 0x0c, 0x9e, 0x53, 0xf1, 0xf7, 0x5d, 0x78, 0x53, 0x65, 0x9e, 0x2a, 0x20,
+        0xee, 0xb2, 0xb2, 0x2a, 0xaf, 0xde, 0x64, 0x19, 0xa0, 0x58, 0xab, 0x4f, 0x6f, 0x74, 0x6b,
+        0xf4, 0x0f, 0xc0, 0xc3, 0xb7, 0x80, 0xf2, 0x44, 0x45, 0x2d, 0xa3, 0xeb, 0xf1, 0xc5, 0xd8,
+        0x2c, 0xde, 0xa2, 0x41, 0x89, 0x97, 0x20, 0x0e, 0xf8, 0x2e, 0x44, 0xae, 0x7e, 0x3f},
+};
+
+static const unsigned char tag_test_data[MAX_TESTS * 3][16] = {
+    {0x58, 0xe2, 0xfc, 0xce, 0xfa, 0x7e, 0x30, 0x61, 0x36, 0x7f, 0x1d, 0x57, 0xa4, 0xe7, 0x45,
+        0x5a},
+    {0xab, 0x6e, 0x47, 0xd4, 0x2c, 0xec, 0x13, 0xbd, 0xf5, 0x3a, 0x67, 0xb2, 0x12, 0x57, 0xbd,
+        0xdf},
+    {0x4d, 0x5c, 0x2a, 0xf3, 0x27, 0xcd, 0x64, 0xa6, 0x2c, 0xf3, 0x5a, 0xbd, 0x2b, 0xa6, 0xfa,
+        0xb4},
+    {0x5b, 0xc9, 0x4f, 0xbc, 0x32, 0x21, 0xa5, 0xdb, 0x94, 0xfa, 0xe9, 0x5a, 0xe7, 0x12, 0x1a,
+        0x47},
+    {0x36, 0x12, 0xd2, 0xe7, 0x9e, 0x3b, 0x07, 0x85, 0x56, 0x1b, 0xe1, 0x4a, 0xac, 0xa2, 0xfc,
+        0xcb},
+    {0x61, 0x9c, 0xc5, 0xae, 0xff, 0xfe, 0x0b, 0xfa, 0x46, 0x2a, 0xf4, 0x3c, 0x16, 0x99, 0xd0,
+        0x50},
+    {0xcd, 0x33, 0xb2, 0x8a, 0xc7, 0x73, 0xf7, 0x4b, 0xa0, 0x0e, 0xd1, 0xf3, 0x12, 0x57, 0x24,
+        0x35},
+    {0x2f, 0xf5, 0x8d, 0x80, 0x03, 0x39, 0x27, 0xab, 0x8e, 0xf4, 0xd4, 0x58, 0x75, 0x14, 0xf0,
+        0xfb},
+    {0x99, 0x24, 0xa7, 0xc8, 0x58, 0x73, 0x36, 0xbf, 0xb1, 0x18, 0x02, 0x4d, 0xb8, 0x67, 0x4a,
+        0x14},
+    {0x25, 0x19, 0x49, 0x8e, 0x80, 0xf1, 0x47, 0x8f, 0x37, 0xba, 0x55, 0xbd, 0x6d, 0x27, 0x61,
+        0x8c},
+    {0x65, 0xdc, 0xc5, 0x7f, 0xcf, 0x62, 0x3a, 0x24, 0x09, 0x4f, 0xcc, 0xa4, 0x0d, 0x35, 0x33,
+        0xf8},
+    {0xdc, 0xf5, 0x66, 0xff, 0x29, 0x1c, 0x25, 0xbb, 0xb8, 0x56, 0x8f, 0xc3, 0xd3, 0x76, 0xa6,
+        0xd9},
+    {0x53, 0x0f, 0x8a, 0xfb, 0xc7, 0x45, 0x36, 0xb9, 0xa9, 0x63, 0xb4, 0xf1, 0xc4, 0xcb, 0x73,
+        0x8b},
+    {0xd0, 0xd1, 0xc8, 0xa7, 0x99, 0x99, 0x6b, 0xf0, 0x26, 0x5b, 0x98, 0xb5, 0xd4, 0x8a, 0xb9,
+        0x19},
+    {0xb0, 0x94, 0xda, 0xc5, 0xd9, 0x34, 0x71, 0xbd, 0xec, 0x1a, 0x50, 0x22, 0x70, 0xe3, 0xcc,
+        0x6c},
+    {0x76, 0xfc, 0x6e, 0xce, 0x0f, 0x4e, 0x17, 0x68, 0xcd, 0xdf, 0x88, 0x53, 0xbb, 0x2d, 0x55,
+        0x1b},
+    {0x3a, 0x33, 0x7d, 0xbf, 0x46, 0xa7, 0x92, 0xc4, 0x5e, 0x45, 0x49, 0x13, 0xfe, 0x2e, 0xa8,
+        0xf2},
+    {0xa4, 0x4a, 0x82, 0x66, 0xee, 0x1c, 0x8e, 0xb0, 0xc8, 0xb5, 0xd4, 0xcf, 0x5a, 0xe9, 0xf1,
+        0x9a},
+};
+
+int mbedtls_gcm_self_test(int verbose) {
+    mbedtls_gcm_context ctx;
+    unsigned char buf[64];
+    unsigned char tag_buf[16];
+    int i, j, ret;
+    mbedtls_cipher_id_t cipher = MBEDTLS_CIPHER_ID_AES;
+    size_t olen;
+
+    for (j = 0; j < 3; j++) {
+        int key_len = 128 + 64 * j;
+
+        for (i = 0; i < MAX_TESTS; i++) {
+            mbedtls_gcm_init(&ctx);
+
+            if (verbose != 0)
+                mbedtls_printf("  AES-GCM-%3d #%d (%s): ", key_len, i, "enc");
+
+            ret = mbedtls_gcm_setkey(&ctx, cipher, key_test_data[key_index_test_data[i]], key_len);
+            /*
+             * AES-192 is an optional feature that may be unavailable when
+             * there is an alternative underlying implementation i.e. when
+             * MBEDTLS_AES_ALT is defined.
+             */
+            if (ret == MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED && key_len == 192) {
+                mbedtls_printf("skipped\n");
+                break;
+            } else if (ret != 0) {
+                goto exit;
+            }
+
+            ret = mbedtls_gcm_crypt_and_tag(&ctx, MBEDTLS_GCM_ENCRYPT, pt_len_test_data[i],
+                iv_test_data[iv_index_test_data[i]], iv_len_test_data[i],
+                additional_test_data[add_index_test_data[i]], add_len_test_data[i],
+                pt_test_data[pt_index_test_data[i]], buf, 16, tag_buf);
+#if defined(MBEDTLS_GCM_ALT)
+            /* Allow alternative implementations to only support 12-byte nonces. */
+            if (ret == MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED && iv_len_test_data[i] != 12) {
+                mbedtls_printf("skipped\n");
+                break;
+            }
+#endif /* defined(MBEDTLS_GCM_ALT) */
+            if (ret != 0)
+                goto exit;
+
+            if (memcmp(buf, ct_test_data[j * 6 + i], pt_len_test_data[i]) != 0 ||
+                memcmp(tag_buf, tag_test_data[j * 6 + i], 16) != 0) {
+                ret = 1;
+                goto exit;
+            }
+
+            mbedtls_gcm_free(&ctx);
+
+            if (verbose != 0)
+                mbedtls_printf("passed\n");
+
+            mbedtls_gcm_init(&ctx);
+
+            if (verbose != 0)
+                mbedtls_printf("  AES-GCM-%3d #%d (%s): ", key_len, i, "dec");
+
+            ret = mbedtls_gcm_setkey(&ctx, cipher, key_test_data[key_index_test_data[i]], key_len);
+            if (ret != 0)
+                goto exit;
+
+            ret = mbedtls_gcm_crypt_and_tag(&ctx, MBEDTLS_GCM_DECRYPT, pt_len_test_data[i],
+                iv_test_data[iv_index_test_data[i]], iv_len_test_data[i],
+                additional_test_data[add_index_test_data[i]], add_len_test_data[i],
+                ct_test_data[j * 6 + i], buf, 16, tag_buf);
+
+            if (ret != 0)
+                goto exit;
+
+            if (memcmp(buf, pt_test_data[pt_index_test_data[i]], pt_len_test_data[i]) != 0 ||
+                memcmp(tag_buf, tag_test_data[j * 6 + i], 16) != 0) {
+                ret = 1;
+                goto exit;
+            }
+
+            mbedtls_gcm_free(&ctx);
+
+            if (verbose != 0)
+                mbedtls_printf("passed\n");
+
+            mbedtls_gcm_init(&ctx);
+
+            if (verbose != 0)
+                mbedtls_printf("  AES-GCM-%3d #%d split (%s): ", key_len, i, "enc");
+
+            ret = mbedtls_gcm_setkey(&ctx, cipher, key_test_data[key_index_test_data[i]], key_len);
+            if (ret != 0)
+                goto exit;
+
+            ret = mbedtls_gcm_starts(&ctx, MBEDTLS_GCM_ENCRYPT, iv_test_data[iv_index_test_data[i]],
+                iv_len_test_data[i]);
+            if (ret != 0)
+                goto exit;
+
+            ret = mbedtls_gcm_update_ad(&ctx, additional_test_data[add_index_test_data[i]],
+                add_len_test_data[i]);
+            if (ret != 0)
+                goto exit;
+
+            if (pt_len_test_data[i] > 32) {
+                size_t rest_len = pt_len_test_data[i] - 32;
+                ret = mbedtls_gcm_update(&ctx, pt_test_data[pt_index_test_data[i]], 32, buf,
+                    sizeof(buf), &olen);
+                if (ret != 0)
+                    goto exit;
+                if (olen != 32)
+                    goto exit;
+
+                ret = mbedtls_gcm_update(&ctx, pt_test_data[pt_index_test_data[i]] + 32, rest_len,
+                    buf + 32, sizeof(buf) - 32, &olen);
+                if (ret != 0)
+                    goto exit;
+                if (olen != rest_len)
+                    goto exit;
+            } else {
+                ret = mbedtls_gcm_update(&ctx, pt_test_data[pt_index_test_data[i]],
+                    pt_len_test_data[i], buf, sizeof(buf), &olen);
+                if (ret != 0)
+                    goto exit;
+                if (olen != pt_len_test_data[i])
+                    goto exit;
+            }
+
+            ret = mbedtls_gcm_finish(&ctx, NULL, 0, &olen, tag_buf, 16);
+            if (ret != 0)
+                goto exit;
+
+            if (memcmp(buf, ct_test_data[j * 6 + i], pt_len_test_data[i]) != 0 ||
+                memcmp(tag_buf, tag_test_data[j * 6 + i], 16) != 0) {
+                ret = 1;
+                goto exit;
+            }
+
+            mbedtls_gcm_free(&ctx);
+
+            if (verbose != 0)
+                mbedtls_printf("passed\n");
+
+            mbedtls_gcm_init(&ctx);
+
+            if (verbose != 0)
+                mbedtls_printf("  AES-GCM-%3d #%d split (%s): ", key_len, i, "dec");
+
+            ret = mbedtls_gcm_setkey(&ctx, cipher, key_test_data[key_index_test_data[i]], key_len);
+            if (ret != 0)
+                goto exit;
+
+            ret = mbedtls_gcm_starts(&ctx, MBEDTLS_GCM_DECRYPT, iv_test_data[iv_index_test_data[i]],
+                iv_len_test_data[i]);
+            if (ret != 0)
+                goto exit;
+            ret = mbedtls_gcm_update_ad(&ctx, additional_test_data[add_index_test_data[i]],
+                add_len_test_data[i]);
+            if (ret != 0)
+                goto exit;
+
+            if (pt_len_test_data[i] > 32) {
+                size_t rest_len = pt_len_test_data[i] - 32;
+                ret =
+                    mbedtls_gcm_update(&ctx, ct_test_data[j * 6 + i], 32, buf, sizeof(buf), &olen);
+                if (ret != 0)
+                    goto exit;
+                if (olen != 32)
+                    goto exit;
+
+                ret = mbedtls_gcm_update(&ctx, ct_test_data[j * 6 + i] + 32, rest_len, buf + 32,
+                    sizeof(buf) - 32, &olen);
+                if (ret != 0)
+                    goto exit;
+                if (olen != rest_len)
+                    goto exit;
+            } else {
+                ret = mbedtls_gcm_update(&ctx, ct_test_data[j * 6 + i], pt_len_test_data[i], buf,
+                    sizeof(buf), &olen);
+                if (ret != 0)
+                    goto exit;
+                if (olen != pt_len_test_data[i])
+                    goto exit;
+            }
+
+            ret = mbedtls_gcm_finish(&ctx, NULL, 0, &olen, tag_buf, 16);
+            if (ret != 0)
+                goto exit;
+
+            if (memcmp(buf, pt_test_data[pt_index_test_data[i]], pt_len_test_data[i]) != 0 ||
+                memcmp(tag_buf, tag_test_data[j * 6 + i], 16) != 0) {
+                ret = 1;
+                goto exit;
+            }
+
+            mbedtls_gcm_free(&ctx);
+
+            if (verbose != 0)
+                mbedtls_printf("passed\n");
+        }
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+
+    ret = 0;
+
+exit:
+    if (ret != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+        mbedtls_gcm_free(&ctx);
+    }
+
+    return (ret);
+}
+
+#endif /* MBEDTLS_SELF_TEST && MBEDTLS_AES_C */
+
+#endif /* MBEDTLS_GCM_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/md.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/md.cpp
new file mode 100644
index 0000000000..ee05ad9f7e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/md.cpp
@@ -0,0 +1,779 @@
+/**
+ * \file md.c
+ *
+ * \brief Generic message digest wrapper for mbed TLS
+ *
+ * \author Adriaan de Jong <dejong@fox-it.com>
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_MD_C)
+
+#include "mbedtls/error.h"
+#include "mbedtls/md.h"
+#include "mbedtls/platform_util.h"
+#include "md_wrap.h"
+
+#if defined(MBEDTLS_MD5_C)
+#include "mbedtls/md5.h"
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+#include "mbedtls/ripemd160.h"
+#endif
+#if defined(MBEDTLS_SHA1_C)
+#include "mbedtls/sha1.h"
+#endif
+#if defined(MBEDTLS_SHA256_C)
+#include "mbedtls/sha256.h"
+#endif
+#if defined(MBEDTLS_SHA512_C)
+#include "mbedtls/sha512.h"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdlib.h>
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif
+
+#include <string.h>
+
+#if defined(MBEDTLS_FS_IO)
+#include <stdio.h>
+#endif
+
+#if defined(MBEDTLS_MD5_C)
+const mbedtls_md_info_t mbedtls_md5_info = {
+    "MD5",
+    MBEDTLS_MD_MD5,
+    16,
+    64,
+};
+#endif
+
+#if defined(MBEDTLS_RIPEMD160_C)
+const mbedtls_md_info_t mbedtls_ripemd160_info = {
+    "RIPEMD160",
+    MBEDTLS_MD_RIPEMD160,
+    20,
+    64,
+};
+#endif
+
+#if defined(MBEDTLS_SHA1_C)
+const mbedtls_md_info_t mbedtls_sha1_info = {
+    "SHA1",
+    MBEDTLS_MD_SHA1,
+    20,
+    64,
+};
+#endif
+
+#if defined(MBEDTLS_SHA224_C)
+const mbedtls_md_info_t mbedtls_sha224_info = {
+    "SHA224",
+    MBEDTLS_MD_SHA224,
+    28,
+    64,
+};
+#endif
+
+#if defined(MBEDTLS_SHA256_C)
+const mbedtls_md_info_t mbedtls_sha256_info = {
+    "SHA256",
+    MBEDTLS_MD_SHA256,
+    32,
+    64,
+};
+#endif
+
+#if defined(MBEDTLS_SHA384_C)
+const mbedtls_md_info_t mbedtls_sha384_info = {
+    "SHA384",
+    MBEDTLS_MD_SHA384,
+    48,
+    128,
+};
+#endif
+
+#if defined(MBEDTLS_SHA512_C)
+const mbedtls_md_info_t mbedtls_sha512_info = {
+    "SHA512",
+    MBEDTLS_MD_SHA512,
+    64,
+    128,
+};
+#endif
+
+/*
+ * Reminder: update profiles in x509_crt.c when adding a new hash!
+ */
+static const int supported_digests[] = {
+
+#if defined(MBEDTLS_SHA512_C)
+    MBEDTLS_MD_SHA512,
+#endif
+
+#if defined(MBEDTLS_SHA384_C)
+    MBEDTLS_MD_SHA384,
+#endif
+
+#if defined(MBEDTLS_SHA256_C)
+    MBEDTLS_MD_SHA256,
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    MBEDTLS_MD_SHA224,
+#endif
+
+#if defined(MBEDTLS_SHA1_C)
+    MBEDTLS_MD_SHA1,
+#endif
+
+#if defined(MBEDTLS_RIPEMD160_C)
+    MBEDTLS_MD_RIPEMD160,
+#endif
+
+#if defined(MBEDTLS_MD5_C)
+    MBEDTLS_MD_MD5,
+#endif
+
+    MBEDTLS_MD_NONE};
+
+const int* mbedtls_md_list(void) {
+    return (supported_digests);
+}
+
+const mbedtls_md_info_t* mbedtls_md_info_from_string(const char* md_name) {
+    if (NULL == md_name)
+        return (NULL);
+
+        /* Get the appropriate digest information */
+#if defined(MBEDTLS_MD5_C)
+    if (!strcmp("MD5", md_name))
+        return mbedtls_md_info_from_type(MBEDTLS_MD_MD5);
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+    if (!strcmp("RIPEMD160", md_name))
+        return mbedtls_md_info_from_type(MBEDTLS_MD_RIPEMD160);
+#endif
+#if defined(MBEDTLS_SHA1_C)
+    if (!strcmp("SHA1", md_name) || !strcmp("SHA", md_name))
+        return mbedtls_md_info_from_type(MBEDTLS_MD_SHA1);
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    if (!strcmp("SHA224", md_name))
+        return mbedtls_md_info_from_type(MBEDTLS_MD_SHA224);
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    if (!strcmp("SHA256", md_name))
+        return mbedtls_md_info_from_type(MBEDTLS_MD_SHA256);
+#endif
+#if defined(MBEDTLS_SHA384_C)
+    if (!strcmp("SHA384", md_name))
+        return mbedtls_md_info_from_type(MBEDTLS_MD_SHA384);
+#endif
+#if defined(MBEDTLS_SHA512_C)
+    if (!strcmp("SHA512", md_name))
+        return mbedtls_md_info_from_type(MBEDTLS_MD_SHA512);
+#endif
+    return (NULL);
+}
+
+const mbedtls_md_info_t* mbedtls_md_info_from_type(mbedtls_md_type_t md_type) {
+    switch (md_type) {
+#if defined(MBEDTLS_MD5_C)
+    case MBEDTLS_MD_MD5:
+        return (&mbedtls_md5_info);
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+    case MBEDTLS_MD_RIPEMD160:
+        return (&mbedtls_ripemd160_info);
+#endif
+#if defined(MBEDTLS_SHA1_C)
+    case MBEDTLS_MD_SHA1:
+        return (&mbedtls_sha1_info);
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    case MBEDTLS_MD_SHA224:
+        return (&mbedtls_sha224_info);
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    case MBEDTLS_MD_SHA256:
+        return (&mbedtls_sha256_info);
+#endif
+#if defined(MBEDTLS_SHA384_C)
+    case MBEDTLS_MD_SHA384:
+        return (&mbedtls_sha384_info);
+#endif
+#if defined(MBEDTLS_SHA512_C)
+    case MBEDTLS_MD_SHA512:
+        return (&mbedtls_sha512_info);
+#endif
+    default:
+        return (NULL);
+    }
+}
+
+void mbedtls_md_init(mbedtls_md_context_t* ctx) {
+    memset(ctx, 0, sizeof(mbedtls_md_context_t));
+}
+
+void mbedtls_md_free(mbedtls_md_context_t* ctx) {
+    if (ctx == NULL || ctx->md_info == NULL)
+        return;
+
+    if (ctx->md_ctx != NULL) {
+        switch (ctx->md_info->type) {
+#if defined(MBEDTLS_MD5_C)
+        case MBEDTLS_MD_MD5:
+            mbedtls_md5_free(ctx->md_ctx);
+            break;
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+        case MBEDTLS_MD_RIPEMD160:
+            mbedtls_ripemd160_free(ctx->md_ctx);
+            break;
+#endif
+#if defined(MBEDTLS_SHA1_C)
+        case MBEDTLS_MD_SHA1:
+            mbedtls_sha1_free(ctx->md_ctx);
+            break;
+#endif
+#if defined(MBEDTLS_SHA224_C)
+        case MBEDTLS_MD_SHA224:
+            mbedtls_sha256_free((mbedtls_sha256_context*)ctx->md_ctx);
+            break;
+#endif
+#if defined(MBEDTLS_SHA256_C)
+        case MBEDTLS_MD_SHA256:
+            mbedtls_sha256_free((mbedtls_sha256_context*)ctx->md_ctx);
+            break;
+#endif
+#if defined(MBEDTLS_SHA384_C)
+        case MBEDTLS_MD_SHA384:
+            mbedtls_sha512_free(ctx->md_ctx);
+            break;
+#endif
+#if defined(MBEDTLS_SHA512_C)
+        case MBEDTLS_MD_SHA512:
+            mbedtls_sha512_free(ctx->md_ctx);
+            break;
+#endif
+        default:
+            /* Shouldn't happen */
+            break;
+        }
+        mbedtls_free(ctx->md_ctx);
+    }
+
+    if (ctx->hmac_ctx != NULL) {
+        mbedtls_platform_zeroize(ctx->hmac_ctx, 2 * ctx->md_info->block_size);
+        mbedtls_free(ctx->hmac_ctx);
+    }
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_md_context_t));
+}
+
+int mbedtls_md_clone(mbedtls_md_context_t* dst, const mbedtls_md_context_t* src) {
+    if (dst == NULL || dst->md_info == NULL || src == NULL || src->md_info == NULL ||
+        dst->md_info != src->md_info) {
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+    }
+
+    switch (src->md_info->type) {
+#if defined(MBEDTLS_MD5_C)
+    case MBEDTLS_MD_MD5:
+        mbedtls_md5_clone(dst->md_ctx, src->md_ctx);
+        break;
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+    case MBEDTLS_MD_RIPEMD160:
+        mbedtls_ripemd160_clone(dst->md_ctx, src->md_ctx);
+        break;
+#endif
+#if defined(MBEDTLS_SHA1_C)
+    case MBEDTLS_MD_SHA1:
+        mbedtls_sha1_clone(dst->md_ctx, src->md_ctx);
+        break;
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    case MBEDTLS_MD_SHA224:
+        mbedtls_sha256_clone((mbedtls_sha256_context*)dst->md_ctx,
+            (mbedtls_sha256_context*)src->md_ctx);
+        break;
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    case MBEDTLS_MD_SHA256:
+        mbedtls_sha256_clone((mbedtls_sha256_context*)dst->md_ctx,
+            (mbedtls_sha256_context*)src->md_ctx);
+        break;
+#endif
+#if defined(MBEDTLS_SHA384_C)
+    case MBEDTLS_MD_SHA384:
+        mbedtls_sha512_clone(dst->md_ctx, src->md_ctx);
+        break;
+#endif
+#if defined(MBEDTLS_SHA512_C)
+    case MBEDTLS_MD_SHA512:
+        mbedtls_sha512_clone(dst->md_ctx, src->md_ctx);
+        break;
+#endif
+    default:
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+    }
+
+    return (0);
+}
+
+#define ALLOC(type)                                                                                \
+    do {                                                                                           \
+        ctx->md_ctx =                                                                              \
+            (mbedtls_##type##_context*)mbedtls_calloc(1, sizeof(mbedtls_##type##_context));        \
+        if (ctx->md_ctx == NULL)                                                                   \
+            return (MBEDTLS_ERR_MD_ALLOC_FAILED);                                                  \
+        mbedtls_##type##_init((mbedtls_##type##_context*)ctx->md_ctx);                             \
+    } while (0)
+
+int mbedtls_md_setup(mbedtls_md_context_t* ctx, const mbedtls_md_info_t* md_info, int hmac) {
+    if (md_info == NULL || ctx == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    ctx->md_info = md_info;
+    ctx->md_ctx = NULL;
+    ctx->hmac_ctx = NULL;
+
+    switch (md_info->type) {
+#if defined(MBEDTLS_MD5_C)
+    case MBEDTLS_MD_MD5:
+        ALLOC(md5);
+        break;
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+    case MBEDTLS_MD_RIPEMD160:
+        ALLOC(ripemd160);
+        break;
+#endif
+#if defined(MBEDTLS_SHA1_C)
+    case MBEDTLS_MD_SHA1:
+        ALLOC(sha1);
+        break;
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    case MBEDTLS_MD_SHA224:
+        ALLOC(sha256);
+        break;
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    case MBEDTLS_MD_SHA256:
+        ALLOC(sha256);
+        break;
+#endif
+#if defined(MBEDTLS_SHA384_C)
+    case MBEDTLS_MD_SHA384:
+        ALLOC(sha512);
+        break;
+#endif
+#if defined(MBEDTLS_SHA512_C)
+    case MBEDTLS_MD_SHA512:
+        ALLOC(sha512);
+        break;
+#endif
+    default:
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+    }
+
+    if (hmac != 0) {
+        ctx->hmac_ctx = mbedtls_calloc(2, md_info->block_size);
+        if (ctx->hmac_ctx == NULL) {
+            mbedtls_md_free(ctx);
+            return (MBEDTLS_ERR_MD_ALLOC_FAILED);
+        }
+    }
+
+    return (0);
+}
+#undef ALLOC
+
+int mbedtls_md_starts(mbedtls_md_context_t* ctx) {
+    if (ctx == NULL || ctx->md_info == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    switch (ctx->md_info->type) {
+#if defined(MBEDTLS_MD5_C)
+    case MBEDTLS_MD_MD5:
+        return (mbedtls_md5_starts(ctx->md_ctx));
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+    case MBEDTLS_MD_RIPEMD160:
+        return (mbedtls_ripemd160_starts(ctx->md_ctx));
+#endif
+#if defined(MBEDTLS_SHA1_C)
+    case MBEDTLS_MD_SHA1:
+        return (mbedtls_sha1_starts(ctx->md_ctx));
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    case MBEDTLS_MD_SHA224:
+        return (mbedtls_sha256_starts((mbedtls_sha256_context*)ctx->md_ctx, 1));
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    case MBEDTLS_MD_SHA256:
+        return (mbedtls_sha256_starts((mbedtls_sha256_context*)ctx->md_ctx, 0));
+#endif
+#if defined(MBEDTLS_SHA384_C)
+    case MBEDTLS_MD_SHA384:
+        return (mbedtls_sha512_starts(ctx->md_ctx, 1));
+#endif
+#if defined(MBEDTLS_SHA512_C)
+    case MBEDTLS_MD_SHA512:
+        return (mbedtls_sha512_starts(ctx->md_ctx, 0));
+#endif
+    default:
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+    }
+}
+
+int mbedtls_md_update(mbedtls_md_context_t* ctx, const unsigned char* input, size_t ilen) {
+    if (ctx == NULL || ctx->md_info == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    switch (ctx->md_info->type) {
+#if defined(MBEDTLS_MD5_C)
+    case MBEDTLS_MD_MD5:
+        return (mbedtls_md5_update(ctx->md_ctx, input, ilen));
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+    case MBEDTLS_MD_RIPEMD160:
+        return (mbedtls_ripemd160_update(ctx->md_ctx, input, ilen));
+#endif
+#if defined(MBEDTLS_SHA1_C)
+    case MBEDTLS_MD_SHA1:
+        return (mbedtls_sha1_update(ctx->md_ctx, input, ilen));
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    case MBEDTLS_MD_SHA224:
+        return (mbedtls_sha256_update((mbedtls_sha256_context*)ctx->md_ctx, input, ilen));
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    case MBEDTLS_MD_SHA256:
+        return (mbedtls_sha256_update((mbedtls_sha256_context*)ctx->md_ctx, input, ilen));
+#endif
+#if defined(MBEDTLS_SHA384_C)
+    case MBEDTLS_MD_SHA384:
+        return (mbedtls_sha512_update(ctx->md_ctx, input, ilen));
+#endif
+#if defined(MBEDTLS_SHA512_C)
+    case MBEDTLS_MD_SHA512:
+        return (mbedtls_sha512_update(ctx->md_ctx, input, ilen));
+#endif
+    default:
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+    }
+}
+
+int mbedtls_md_finish(mbedtls_md_context_t* ctx, unsigned char* output) {
+    if (ctx == NULL || ctx->md_info == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    switch (ctx->md_info->type) {
+#if defined(MBEDTLS_MD5_C)
+    case MBEDTLS_MD_MD5:
+        return (mbedtls_md5_finish(ctx->md_ctx, output));
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+    case MBEDTLS_MD_RIPEMD160:
+        return (mbedtls_ripemd160_finish(ctx->md_ctx, output));
+#endif
+#if defined(MBEDTLS_SHA1_C)
+    case MBEDTLS_MD_SHA1:
+        return (mbedtls_sha1_finish(ctx->md_ctx, output));
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    case MBEDTLS_MD_SHA224:
+        return (mbedtls_sha256_finish((mbedtls_sha256_context*)ctx->md_ctx, output));
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    case MBEDTLS_MD_SHA256:
+        return (mbedtls_sha256_finish((mbedtls_sha256_context*)(mbedtls_sha256_context*)ctx->md_ctx,
+            output));
+#endif
+#if defined(MBEDTLS_SHA384_C)
+    case MBEDTLS_MD_SHA384:
+        return (mbedtls_sha512_finish(ctx->md_ctx, output));
+#endif
+#if defined(MBEDTLS_SHA512_C)
+    case MBEDTLS_MD_SHA512:
+        return (mbedtls_sha512_finish(ctx->md_ctx, output));
+#endif
+    default:
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+    }
+}
+
+int mbedtls_md(const mbedtls_md_info_t* md_info, const unsigned char* input, size_t ilen,
+    unsigned char* output) {
+    if (md_info == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    switch (md_info->type) {
+#if defined(MBEDTLS_MD5_C)
+    case MBEDTLS_MD_MD5:
+        return (mbedtls_md5(input, ilen, output));
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+    case MBEDTLS_MD_RIPEMD160:
+        return (mbedtls_ripemd160(input, ilen, output));
+#endif
+#if defined(MBEDTLS_SHA1_C)
+    case MBEDTLS_MD_SHA1:
+        return (mbedtls_sha1(input, ilen, output));
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    case MBEDTLS_MD_SHA224:
+        return (mbedtls_sha256(input, ilen, output, 1));
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    case MBEDTLS_MD_SHA256:
+        return (mbedtls_sha256(input, ilen, output, 0));
+#endif
+#if defined(MBEDTLS_SHA384_C)
+    case MBEDTLS_MD_SHA384:
+        return (mbedtls_sha512(input, ilen, output, 1));
+#endif
+#if defined(MBEDTLS_SHA512_C)
+    case MBEDTLS_MD_SHA512:
+        return (mbedtls_sha512(input, ilen, output, 0));
+#endif
+    default:
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+    }
+}
+
+#if defined(MBEDTLS_FS_IO)
+int mbedtls_md_file(const mbedtls_md_info_t* md_info, const char* path, unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    FILE* f;
+    size_t n;
+    mbedtls_md_context_t ctx;
+    unsigned char buf[1024];
+
+    if (md_info == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    if ((f = fopen(path, "rb")) == NULL)
+        return (MBEDTLS_ERR_MD_FILE_IO_ERROR);
+
+    mbedtls_md_init(&ctx);
+
+    if ((ret = mbedtls_md_setup(&ctx, md_info, 0)) != 0)
+        goto cleanup;
+
+    if ((ret = mbedtls_md_starts(&ctx)) != 0)
+        goto cleanup;
+
+    while ((n = fread(buf, 1, sizeof(buf), f)) > 0)
+        if ((ret = mbedtls_md_update(&ctx, buf, n)) != 0)
+            goto cleanup;
+
+    if (ferror(f) != 0)
+        ret = MBEDTLS_ERR_MD_FILE_IO_ERROR;
+    else
+        ret = mbedtls_md_finish(&ctx, output);
+
+cleanup:
+    mbedtls_platform_zeroize(buf, sizeof(buf));
+    fclose(f);
+    mbedtls_md_free(&ctx);
+
+    return (ret);
+}
+#endif /* MBEDTLS_FS_IO */
+
+int mbedtls_md_hmac_starts(mbedtls_md_context_t* ctx, const unsigned char* key, size_t keylen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char sum[MBEDTLS_MD_MAX_SIZE];
+    unsigned char *ipad, *opad;
+    size_t i;
+
+    if (ctx == NULL || ctx->md_info == NULL || ctx->hmac_ctx == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    if (keylen > (size_t)ctx->md_info->block_size) {
+        if ((ret = mbedtls_md_starts(ctx)) != 0)
+            goto cleanup;
+        if ((ret = mbedtls_md_update(ctx, key, keylen)) != 0)
+            goto cleanup;
+        if ((ret = mbedtls_md_finish(ctx, sum)) != 0)
+            goto cleanup;
+
+        keylen = ctx->md_info->size;
+        key = sum;
+    }
+
+    ipad = (unsigned char*)ctx->hmac_ctx;
+    opad = (unsigned char*)ctx->hmac_ctx + ctx->md_info->block_size;
+
+    memset(ipad, 0x36, ctx->md_info->block_size);
+    memset(opad, 0x5C, ctx->md_info->block_size);
+
+    for (i = 0; i < keylen; i++) {
+        ipad[i] = (unsigned char)(ipad[i] ^ key[i]);
+        opad[i] = (unsigned char)(opad[i] ^ key[i]);
+    }
+
+    if ((ret = mbedtls_md_starts(ctx)) != 0)
+        goto cleanup;
+    if ((ret = mbedtls_md_update(ctx, ipad, ctx->md_info->block_size)) != 0)
+        goto cleanup;
+
+cleanup:
+    mbedtls_platform_zeroize(sum, sizeof(sum));
+
+    return (ret);
+}
+
+int mbedtls_md_hmac_update(mbedtls_md_context_t* ctx, const unsigned char* input, size_t ilen) {
+    if (ctx == NULL || ctx->md_info == NULL || ctx->hmac_ctx == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    return (mbedtls_md_update(ctx, input, ilen));
+}
+
+int mbedtls_md_hmac_finish(mbedtls_md_context_t* ctx, unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char tmp[MBEDTLS_MD_MAX_SIZE];
+    unsigned char* opad;
+
+    if (ctx == NULL || ctx->md_info == NULL || ctx->hmac_ctx == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    opad = (unsigned char*)ctx->hmac_ctx + ctx->md_info->block_size;
+
+    if ((ret = mbedtls_md_finish(ctx, tmp)) != 0)
+        return (ret);
+    if ((ret = mbedtls_md_starts(ctx)) != 0)
+        return (ret);
+    if ((ret = mbedtls_md_update(ctx, opad, ctx->md_info->block_size)) != 0)
+        return (ret);
+    if ((ret = mbedtls_md_update(ctx, tmp, ctx->md_info->size)) != 0)
+        return (ret);
+    return (mbedtls_md_finish(ctx, output));
+}
+
+int mbedtls_md_hmac_reset(mbedtls_md_context_t* ctx) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char* ipad;
+
+    if (ctx == NULL || ctx->md_info == NULL || ctx->hmac_ctx == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    ipad = (unsigned char*)ctx->hmac_ctx;
+
+    if ((ret = mbedtls_md_starts(ctx)) != 0)
+        return (ret);
+    return (mbedtls_md_update(ctx, ipad, ctx->md_info->block_size));
+}
+
+int mbedtls_md_hmac(const mbedtls_md_info_t* md_info, const unsigned char* key, size_t keylen,
+    const unsigned char* input, size_t ilen, unsigned char* output) {
+    mbedtls_md_context_t ctx;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    if (md_info == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    mbedtls_md_init(&ctx);
+
+    if ((ret = mbedtls_md_setup(&ctx, md_info, 1)) != 0)
+        goto cleanup;
+
+    if ((ret = mbedtls_md_hmac_starts(&ctx, key, keylen)) != 0)
+        goto cleanup;
+    if ((ret = mbedtls_md_hmac_update(&ctx, input, ilen)) != 0)
+        goto cleanup;
+    if ((ret = mbedtls_md_hmac_finish(&ctx, output)) != 0)
+        goto cleanup;
+
+cleanup:
+    mbedtls_md_free(&ctx);
+
+    return (ret);
+}
+
+int mbedtls_md_process(mbedtls_md_context_t* ctx, const unsigned char* data) {
+    if (ctx == NULL || ctx->md_info == NULL)
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+
+    switch (ctx->md_info->type) {
+#if defined(MBEDTLS_MD5_C)
+    case MBEDTLS_MD_MD5:
+        return (mbedtls_internal_md5_process(ctx->md_ctx, data));
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+    case MBEDTLS_MD_RIPEMD160:
+        return (mbedtls_internal_ripemd160_process(ctx->md_ctx, data));
+#endif
+#if defined(MBEDTLS_SHA1_C)
+    case MBEDTLS_MD_SHA1:
+        return (mbedtls_internal_sha1_process(ctx->md_ctx, data));
+#endif
+#if defined(MBEDTLS_SHA224_C)
+    case MBEDTLS_MD_SHA224:
+        return (mbedtls_internal_sha256_process((mbedtls_sha256_context*)ctx->md_ctx, data));
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    case MBEDTLS_MD_SHA256:
+        return (mbedtls_internal_sha256_process((mbedtls_sha256_context*)ctx->md_ctx, data));
+#endif
+#if defined(MBEDTLS_SHA384_C)
+    case MBEDTLS_MD_SHA384:
+        return (mbedtls_internal_sha512_process(ctx->md_ctx, data));
+#endif
+#if defined(MBEDTLS_SHA512_C)
+    case MBEDTLS_MD_SHA512:
+        return (mbedtls_internal_sha512_process(ctx->md_ctx, data));
+#endif
+    default:
+        return (MBEDTLS_ERR_MD_BAD_INPUT_DATA);
+    }
+}
+
+unsigned char mbedtls_md_get_size(const mbedtls_md_info_t* md_info) {
+    if (md_info == NULL)
+        return (0);
+
+    return md_info->size;
+}
+
+mbedtls_md_type_t mbedtls_md_get_type(const mbedtls_md_info_t* md_info) {
+    if (md_info == NULL)
+        return (MBEDTLS_MD_NONE);
+
+    return md_info->type;
+}
+
+const char* mbedtls_md_get_name(const mbedtls_md_info_t* md_info) {
+    if (md_info == NULL)
+        return (NULL);
+
+    return md_info->name;
+}
+
+#endif /* MBEDTLS_MD_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/md_wrap.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/md_wrap.h
new file mode 100644
index 0000000000..5801f9e752
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/md_wrap.h
@@ -0,0 +1,80 @@
+/**
+ * \file md_wrap.h
+ *
+ * \brief Message digest wrappers.
+ *
+ * \warning This in an internal header. Do not include directly.
+ *
+ * \author Adriaan de Jong <dejong@fox-it.com>
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+#ifndef MBEDTLS_MD_WRAP_H
+#define MBEDTLS_MD_WRAP_H
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/md.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * Message digest information.
+ * Allows message digest functions to be called in a generic way.
+ */
+struct mbedtls_md_info_t {
+    /** Name of the message digest */
+    const char* name;
+
+    /** Digest identifier */
+    mbedtls_md_type_t type;
+
+    /** Output length of the digest function in bytes */
+    unsigned char size;
+
+    /** Block length of the digest function in bytes */
+    unsigned char block_size;
+};
+
+#if defined(MBEDTLS_MD5_C)
+extern const mbedtls_md_info_t mbedtls_md5_info;
+#endif
+#if defined(MBEDTLS_RIPEMD160_C)
+extern const mbedtls_md_info_t mbedtls_ripemd160_info;
+#endif
+#if defined(MBEDTLS_SHA1_C)
+extern const mbedtls_md_info_t mbedtls_sha1_info;
+#endif
+#if defined(MBEDTLS_SHA224_C)
+extern const mbedtls_md_info_t mbedtls_sha224_info;
+#endif
+#if defined(MBEDTLS_SHA256_C)
+extern const mbedtls_md_info_t mbedtls_sha256_info;
+#endif
+#if defined(MBEDTLS_SHA384_C)
+extern const mbedtls_md_info_t mbedtls_sha384_info;
+#endif
+#if defined(MBEDTLS_SHA512_C)
+extern const mbedtls_md_info_t mbedtls_sha512_info;
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* MBEDTLS_MD_WRAP_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/oid.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/oid.cpp
new file mode 100644
index 0000000000..1782225d71
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/oid.cpp
@@ -0,0 +1,767 @@
+/**
+ * \file oid.c
+ *
+ * \brief Object Identifier (OID) database
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_OID_C)
+
+#include <stdio.h>
+#include <string.h>
+
+#include "mbedtls/error.h"
+#include "mbedtls/oid.h"
+#include "mbedtls/rsa.h"
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#define mbedtls_snprintf snprintf
+#endif
+
+/*
+ * Macro to automatically add the size of #define'd OIDs
+ */
+#define ADD_LEN(s) s, MBEDTLS_OID_SIZE(s)
+
+/*
+ * Macro to generate mbedtls_oid_descriptor_t
+ */
+#if !defined(MBEDTLS_X509_REMOVE_INFO)
+#define OID_DESCRIPTOR(s, name, description)                                                       \
+    { ADD_LEN(s), name, description }
+#define NULL_OID_DESCRIPTOR                                                                        \
+    { NULL, 0, NULL, NULL }
+#else
+#define OID_DESCRIPTOR(s, name, description)                                                       \
+    { ADD_LEN(s) }
+#define NULL_OID_DESCRIPTOR                                                                        \
+    { NULL, 0 }
+#endif
+
+/*
+ * Macro to generate an internal function for oid_XXX_from_asn1() (used by
+ * the other functions)
+ */
+#define FN_OID_TYPED_FROM_ASN1(TYPE_T, NAME, LIST)                                                 \
+    static const TYPE_T* oid_##NAME##_from_asn1(const mbedtls_asn1_buf* oid) {                     \
+        const TYPE_T* p = (LIST);                                                                  \
+        const mbedtls_oid_descriptor_t* cur = (const mbedtls_oid_descriptor_t*)p;                  \
+        if (p == NULL || oid == NULL)                                                              \
+            return (NULL);                                                                         \
+        while (cur->asn1 != NULL) {                                                                \
+            if (cur->asn1_len == oid->len && memcmp(cur->asn1, oid->p, oid->len) == 0) {           \
+                return (p);                                                                        \
+            }                                                                                      \
+            p++;                                                                                   \
+            cur = (const mbedtls_oid_descriptor_t*)p;                                              \
+        }                                                                                          \
+        return (NULL);                                                                             \
+    }
+
+#if !defined(MBEDTLS_X509_REMOVE_INFO)
+/*
+ * Macro to generate a function for retrieving a single attribute from the
+ * descriptor of an mbedtls_oid_descriptor_t wrapper.
+ */
+#define FN_OID_GET_DESCRIPTOR_ATTR1(FN_NAME, TYPE_T, TYPE_NAME, ATTR1_TYPE, ATTR1)                 \
+    int FN_NAME(const mbedtls_asn1_buf* oid, ATTR1_TYPE* ATTR1) {                                  \
+        const TYPE_T* data = oid_##TYPE_NAME##_from_asn1(oid);                                     \
+        if (data == NULL)                                                                          \
+            return (MBEDTLS_ERR_OID_NOT_FOUND);                                                    \
+        *ATTR1 = data->descriptor.ATTR1;                                                           \
+        return (0);                                                                                \
+    }
+#endif /* MBEDTLS_X509_REMOVE_INFO */
+
+/*
+ * Macro to generate a function for retrieving a single attribute from an
+ * mbedtls_oid_descriptor_t wrapper.
+ */
+#define FN_OID_GET_ATTR1(FN_NAME, TYPE_T, TYPE_NAME, ATTR1_TYPE, ATTR1)                            \
+    int FN_NAME(const mbedtls_asn1_buf* oid, ATTR1_TYPE* ATTR1) {                                  \
+        const TYPE_T* data = oid_##TYPE_NAME##_from_asn1(oid);                                     \
+        if (data == NULL)                                                                          \
+            return (MBEDTLS_ERR_OID_NOT_FOUND);                                                    \
+        *ATTR1 = data->ATTR1;                                                                      \
+        return (0);                                                                                \
+    }
+
+/*
+ * Macro to generate a function for retrieving two attributes from an
+ * mbedtls_oid_descriptor_t wrapper.
+ */
+#define FN_OID_GET_ATTR2(FN_NAME, TYPE_T, TYPE_NAME, ATTR1_TYPE, ATTR1, ATTR2_TYPE, ATTR2)         \
+    int FN_NAME(const mbedtls_asn1_buf* oid, ATTR1_TYPE* ATTR1, ATTR2_TYPE* ATTR2) {               \
+        const TYPE_T* data = oid_##TYPE_NAME##_from_asn1(oid);                                     \
+        if (data == NULL)                                                                          \
+            return (MBEDTLS_ERR_OID_NOT_FOUND);                                                    \
+        *(ATTR1) = data->ATTR1;                                                                    \
+        *(ATTR2) = data->ATTR2;                                                                    \
+        return (0);                                                                                \
+    }
+
+/*
+ * Macro to generate a function for retrieving the OID based on a single
+ * attribute from a mbedtls_oid_descriptor_t wrapper.
+ */
+#define FN_OID_GET_OID_BY_ATTR1(FN_NAME, TYPE_T, LIST, ATTR1_TYPE, ATTR1)                          \
+    int FN_NAME(ATTR1_TYPE ATTR1, const char** oid, size_t* olen) {                                \
+        const TYPE_T* cur = (LIST);                                                                \
+        while (cur->descriptor.asn1 != NULL) {                                                     \
+            if (cur->ATTR1 == (ATTR1)) {                                                           \
+                *oid = cur->descriptor.asn1;                                                       \
+                *olen = cur->descriptor.asn1_len;                                                  \
+                return (0);                                                                        \
+            }                                                                                      \
+            cur++;                                                                                 \
+        }                                                                                          \
+        return (MBEDTLS_ERR_OID_NOT_FOUND);                                                        \
+    }
+
+/*
+ * Macro to generate a function for retrieving the OID based on two
+ * attributes from a mbedtls_oid_descriptor_t wrapper.
+ */
+#define FN_OID_GET_OID_BY_ATTR2(FN_NAME, TYPE_T, LIST, ATTR1_TYPE, ATTR1, ATTR2_TYPE, ATTR2)       \
+    int FN_NAME(ATTR1_TYPE ATTR1, ATTR2_TYPE ATTR2, const char** oid, size_t* olen) {              \
+        const TYPE_T* cur = (LIST);                                                                \
+        while (cur->descriptor.asn1 != NULL) {                                                     \
+            if (cur->ATTR1 == (ATTR1) && cur->ATTR2 == (ATTR2)) {                                  \
+                *oid = cur->descriptor.asn1;                                                       \
+                *olen = cur->descriptor.asn1_len;                                                  \
+                return (0);                                                                        \
+            }                                                                                      \
+            cur++;                                                                                 \
+        }                                                                                          \
+        return (MBEDTLS_ERR_OID_NOT_FOUND);                                                        \
+    }
+
+/*
+ * For X520 attribute types
+ */
+typedef struct {
+    mbedtls_oid_descriptor_t descriptor;
+    const char* short_name;
+} oid_x520_attr_t;
+
+static const oid_x520_attr_t oid_x520_attr_type[] = {
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_CN, "id-at-commonName", "Common Name"),
+        "CN",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_COUNTRY, "id-at-countryName", "Country"),
+        "C",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_LOCALITY, "id-at-locality", "Locality"),
+        "L",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_STATE, "id-at-state", "State"),
+        "ST",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_ORGANIZATION, "id-at-organizationName", "Organization"),
+        "O",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_ORG_UNIT, "id-at-organizationalUnitName", "Org Unit"),
+        "OU",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS9_EMAIL, "emailAddress", "E-mail address"),
+        "emailAddress",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_SERIAL_NUMBER, "id-at-serialNumber", "Serial number"),
+        "serialNumber",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_POSTAL_ADDRESS, "id-at-postalAddress", "Postal address"),
+        "postalAddress",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_POSTAL_CODE, "id-at-postalCode", "Postal code"),
+        "postalCode",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_SUR_NAME, "id-at-surName", "Surname"),
+        "SN",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_GIVEN_NAME, "id-at-givenName", "Given name"),
+        "GN",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_INITIALS, "id-at-initials", "Initials"),
+        "initials",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_GENERATION_QUALIFIER, "id-at-generationQualifier",
+            "Generation qualifier"),
+        "generationQualifier",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_TITLE, "id-at-title", "Title"),
+        "title",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_DN_QUALIFIER, "id-at-dnQualifier",
+            "Distinguished Name qualifier"),
+        "dnQualifier",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_PSEUDONYM, "id-at-pseudonym", "Pseudonym"),
+        "pseudonym",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_UID, "id-uid", "User Id"),
+        "uid",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DOMAIN_COMPONENT, "id-domainComponent", "Domain component"),
+        "DC",
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_AT_UNIQUE_IDENTIFIER, "id-at-uniqueIdentifier",
+            "Unique Identifier"),
+        "uniqueIdentifier",
+    },
+    {
+        NULL_OID_DESCRIPTOR,
+        NULL,
+    }};
+
+FN_OID_TYPED_FROM_ASN1(oid_x520_attr_t, x520_attr, oid_x520_attr_type)
+FN_OID_GET_ATTR1(mbedtls_oid_get_attr_short_name, oid_x520_attr_t, x520_attr, const char*,
+    short_name)
+
+/*
+ * For X509 extensions
+ */
+typedef struct {
+    mbedtls_oid_descriptor_t descriptor;
+    int ext_type;
+} oid_x509_ext_t;
+
+static const oid_x509_ext_t oid_x509_ext[] = {
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_BASIC_CONSTRAINTS, "id-ce-basicConstraints",
+            "Basic Constraints"),
+        MBEDTLS_OID_X509_EXT_BASIC_CONSTRAINTS,
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_KEY_USAGE, "id-ce-keyUsage", "Key Usage"),
+        MBEDTLS_OID_X509_EXT_KEY_USAGE,
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EXTENDED_KEY_USAGE, "id-ce-extKeyUsage", "Extended Key Usage"),
+        MBEDTLS_OID_X509_EXT_EXTENDED_KEY_USAGE,
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_SUBJECT_ALT_NAME, "id-ce-subjectAltName", "Subject Alt Name"),
+        MBEDTLS_OID_X509_EXT_SUBJECT_ALT_NAME,
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_NS_CERT_TYPE, "id-netscape-certtype",
+            "Netscape Certificate Type"),
+        MBEDTLS_OID_X509_EXT_NS_CERT_TYPE,
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_CERTIFICATE_POLICIES, "id-ce-certificatePolicies",
+            "Certificate Policies"),
+        MBEDTLS_OID_X509_EXT_CERTIFICATE_POLICIES,
+    },
+    {
+        NULL_OID_DESCRIPTOR,
+        0,
+    },
+};
+
+FN_OID_TYPED_FROM_ASN1(oid_x509_ext_t, x509_ext, oid_x509_ext)
+FN_OID_GET_ATTR1(mbedtls_oid_get_x509_ext_type, oid_x509_ext_t, x509_ext, int, ext_type)
+
+#if !defined(MBEDTLS_X509_REMOVE_INFO)
+static const mbedtls_oid_descriptor_t oid_ext_key_usage[] = {
+    OID_DESCRIPTOR(MBEDTLS_OID_SERVER_AUTH, "id-kp-serverAuth", "TLS Web Server Authentication"),
+    OID_DESCRIPTOR(MBEDTLS_OID_CLIENT_AUTH, "id-kp-clientAuth", "TLS Web Client Authentication"),
+    OID_DESCRIPTOR(MBEDTLS_OID_CODE_SIGNING, "id-kp-codeSigning", "Code Signing"),
+    OID_DESCRIPTOR(MBEDTLS_OID_EMAIL_PROTECTION, "id-kp-emailProtection", "E-mail Protection"),
+    OID_DESCRIPTOR(MBEDTLS_OID_TIME_STAMPING, "id-kp-timeStamping", "Time Stamping"),
+    OID_DESCRIPTOR(MBEDTLS_OID_OCSP_SIGNING, "id-kp-OCSPSigning", "OCSP Signing"),
+    OID_DESCRIPTOR(MBEDTLS_OID_WISUN_FAN, "id-kp-wisun-fan-device",
+        "Wi-SUN Alliance Field Area Network (FAN)"),
+    NULL_OID_DESCRIPTOR,
+};
+
+FN_OID_TYPED_FROM_ASN1(mbedtls_oid_descriptor_t, ext_key_usage, oid_ext_key_usage)
+FN_OID_GET_ATTR1(mbedtls_oid_get_extended_key_usage, mbedtls_oid_descriptor_t, ext_key_usage,
+    const char*, description)
+
+static const mbedtls_oid_descriptor_t oid_certificate_policies[] = {
+    OID_DESCRIPTOR(MBEDTLS_OID_ANY_POLICY, "anyPolicy", "Any Policy"),
+    NULL_OID_DESCRIPTOR,
+};
+
+FN_OID_TYPED_FROM_ASN1(mbedtls_oid_descriptor_t, certificate_policies, oid_certificate_policies)
+FN_OID_GET_ATTR1(mbedtls_oid_get_certificate_policies, mbedtls_oid_descriptor_t,
+    certificate_policies, const char*, description)
+#endif /* MBEDTLS_X509_REMOVE_INFO */
+
+#if defined(MBEDTLS_MD_C)
+/*
+ * For SignatureAlgorithmIdentifier
+ */
+typedef struct {
+    mbedtls_oid_descriptor_t descriptor;
+    mbedtls_md_type_t md_alg;
+    mbedtls_pk_type_t pk_alg;
+} oid_sig_alg_t;
+
+static const oid_sig_alg_t oid_sig_alg[] = {
+#if defined(MBEDTLS_RSA_C)
+#if defined(MBEDTLS_MD5_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS1_MD5, "md5WithRSAEncryption", "RSA with MD5"),
+        MBEDTLS_MD_MD5,
+        MBEDTLS_PK_RSA,
+    },
+#endif /* MBEDTLS_MD5_C */
+#if defined(MBEDTLS_SHA1_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS1_SHA1, "sha-1WithRSAEncryption", "RSA with SHA1"),
+        MBEDTLS_MD_SHA1,
+        MBEDTLS_PK_RSA,
+    },
+#endif /* MBEDTLS_SHA1_C */
+#if defined(MBEDTLS_SHA224_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS1_SHA224, "sha224WithRSAEncryption", "RSA with SHA-224"),
+        MBEDTLS_MD_SHA224,
+        MBEDTLS_PK_RSA,
+    },
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS1_SHA256, "sha256WithRSAEncryption", "RSA with SHA-256"),
+        MBEDTLS_MD_SHA256,
+        MBEDTLS_PK_RSA,
+    },
+#endif /* MBEDTLS_SHA256_C */
+#if defined(MBEDTLS_SHA384_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS1_SHA384, "sha384WithRSAEncryption", "RSA with SHA-384"),
+        MBEDTLS_MD_SHA384,
+        MBEDTLS_PK_RSA,
+    },
+#endif /* MBEDTLS_SHA384_C */
+#if defined(MBEDTLS_SHA512_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS1_SHA512, "sha512WithRSAEncryption", "RSA with SHA-512"),
+        MBEDTLS_MD_SHA512,
+        MBEDTLS_PK_RSA,
+    },
+#endif /* MBEDTLS_SHA512_C */
+#if defined(MBEDTLS_SHA1_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_RSA_SHA_OBS, "sha-1WithRSAEncryption", "RSA with SHA1"),
+        MBEDTLS_MD_SHA1,
+        MBEDTLS_PK_RSA,
+    },
+#endif /* MBEDTLS_SHA1_C */
+#endif /* MBEDTLS_RSA_C */
+#if defined(MBEDTLS_ECDSA_C)
+#if defined(MBEDTLS_SHA1_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_ECDSA_SHA1, "ecdsa-with-SHA1", "ECDSA with SHA1"),
+        MBEDTLS_MD_SHA1,
+        MBEDTLS_PK_ECDSA,
+    },
+#endif /* MBEDTLS_SHA1_C */
+#if defined(MBEDTLS_SHA224_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_ECDSA_SHA224, "ecdsa-with-SHA224", "ECDSA with SHA224"),
+        MBEDTLS_MD_SHA224,
+        MBEDTLS_PK_ECDSA,
+    },
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_ECDSA_SHA256, "ecdsa-with-SHA256", "ECDSA with SHA256"),
+        MBEDTLS_MD_SHA256,
+        MBEDTLS_PK_ECDSA,
+    },
+#endif /* MBEDTLS_SHA256_C */
+#if defined(MBEDTLS_SHA384_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_ECDSA_SHA384, "ecdsa-with-SHA384", "ECDSA with SHA384"),
+        MBEDTLS_MD_SHA384,
+        MBEDTLS_PK_ECDSA,
+    },
+#endif /* MBEDTLS_SHA384_C */
+#if defined(MBEDTLS_SHA512_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_ECDSA_SHA512, "ecdsa-with-SHA512", "ECDSA with SHA512"),
+        MBEDTLS_MD_SHA512,
+        MBEDTLS_PK_ECDSA,
+    },
+#endif /* MBEDTLS_SHA512_C */
+#endif /* MBEDTLS_ECDSA_C */
+#if defined(MBEDTLS_RSA_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_RSASSA_PSS, "RSASSA-PSS", "RSASSA-PSS"),
+        MBEDTLS_MD_NONE,
+        MBEDTLS_PK_RSASSA_PSS,
+    },
+#endif /* MBEDTLS_RSA_C */
+    {
+        NULL_OID_DESCRIPTOR,
+        MBEDTLS_MD_NONE,
+        MBEDTLS_PK_NONE,
+    },
+};
+
+FN_OID_TYPED_FROM_ASN1(oid_sig_alg_t, sig_alg, oid_sig_alg)
+
+#if !defined(MBEDTLS_X509_REMOVE_INFO)
+FN_OID_GET_DESCRIPTOR_ATTR1(mbedtls_oid_get_sig_alg_desc, oid_sig_alg_t, sig_alg, const char*,
+    description)
+#endif
+
+FN_OID_GET_ATTR2(mbedtls_oid_get_sig_alg, oid_sig_alg_t, sig_alg, mbedtls_md_type_t, md_alg,
+    mbedtls_pk_type_t, pk_alg)
+FN_OID_GET_OID_BY_ATTR2(mbedtls_oid_get_oid_by_sig_alg, oid_sig_alg_t, oid_sig_alg,
+    mbedtls_pk_type_t, pk_alg, mbedtls_md_type_t, md_alg)
+#endif /* MBEDTLS_MD_C */
+
+/*
+ * For PublicKeyInfo (PKCS1, RFC 5480)
+ */
+typedef struct {
+    mbedtls_oid_descriptor_t descriptor;
+    mbedtls_pk_type_t pk_alg;
+} oid_pk_alg_t;
+
+static const oid_pk_alg_t oid_pk_alg[] = {
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS1_RSA, "rsaEncryption", "RSA"),
+        MBEDTLS_PK_RSA,
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_ALG_UNRESTRICTED, "id-ecPublicKey", "Generic EC key"),
+        MBEDTLS_PK_ECKEY,
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_ALG_ECDH, "id-ecDH", "EC key for ECDH"),
+        MBEDTLS_PK_ECKEY_DH,
+    },
+    {
+        NULL_OID_DESCRIPTOR,
+        MBEDTLS_PK_NONE,
+    },
+};
+
+FN_OID_TYPED_FROM_ASN1(oid_pk_alg_t, pk_alg, oid_pk_alg)
+FN_OID_GET_ATTR1(mbedtls_oid_get_pk_alg, oid_pk_alg_t, pk_alg, mbedtls_pk_type_t, pk_alg)
+FN_OID_GET_OID_BY_ATTR1(mbedtls_oid_get_oid_by_pk_alg, oid_pk_alg_t, oid_pk_alg, mbedtls_pk_type_t,
+    pk_alg)
+
+#if defined(MBEDTLS_ECP_C)
+/*
+ * For namedCurve (RFC 5480)
+ */
+typedef struct {
+    mbedtls_oid_descriptor_t descriptor;
+    mbedtls_ecp_group_id grp_id;
+} oid_ecp_grp_t;
+
+static const oid_ecp_grp_t oid_ecp_grp[] = {
+#if defined(MBEDTLS_ECP_DP_SECP192R1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_SECP192R1, "secp192r1", "secp192r1"),
+        MBEDTLS_ECP_DP_SECP192R1,
+    },
+#endif /* MBEDTLS_ECP_DP_SECP192R1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_SECP224R1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_SECP224R1, "secp224r1", "secp224r1"),
+        MBEDTLS_ECP_DP_SECP224R1,
+    },
+#endif /* MBEDTLS_ECP_DP_SECP224R1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_SECP256R1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_SECP256R1, "secp256r1", "secp256r1"),
+        MBEDTLS_ECP_DP_SECP256R1,
+    },
+#endif /* MBEDTLS_ECP_DP_SECP256R1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_SECP384R1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_SECP384R1, "secp384r1", "secp384r1"),
+        MBEDTLS_ECP_DP_SECP384R1,
+    },
+#endif /* MBEDTLS_ECP_DP_SECP384R1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_SECP521R1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_SECP521R1, "secp521r1", "secp521r1"),
+        MBEDTLS_ECP_DP_SECP521R1,
+    },
+#endif /* MBEDTLS_ECP_DP_SECP521R1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_SECP192K1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_SECP192K1, "secp192k1", "secp192k1"),
+        MBEDTLS_ECP_DP_SECP192K1,
+    },
+#endif /* MBEDTLS_ECP_DP_SECP192K1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_SECP224K1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_SECP224K1, "secp224k1", "secp224k1"),
+        MBEDTLS_ECP_DP_SECP224K1,
+    },
+#endif /* MBEDTLS_ECP_DP_SECP224K1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_SECP256K1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_SECP256K1, "secp256k1", "secp256k1"),
+        MBEDTLS_ECP_DP_SECP256K1,
+    },
+#endif /* MBEDTLS_ECP_DP_SECP256K1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_BP256R1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_BP256R1, "brainpoolP256r1", "brainpool256r1"),
+        MBEDTLS_ECP_DP_BP256R1,
+    },
+#endif /* MBEDTLS_ECP_DP_BP256R1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_BP384R1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_BP384R1, "brainpoolP384r1", "brainpool384r1"),
+        MBEDTLS_ECP_DP_BP384R1,
+    },
+#endif /* MBEDTLS_ECP_DP_BP384R1_ENABLED */
+#if defined(MBEDTLS_ECP_DP_BP512R1_ENABLED)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_EC_GRP_BP512R1, "brainpoolP512r1", "brainpool512r1"),
+        MBEDTLS_ECP_DP_BP512R1,
+    },
+#endif /* MBEDTLS_ECP_DP_BP512R1_ENABLED */
+    {
+        NULL_OID_DESCRIPTOR,
+        MBEDTLS_ECP_DP_NONE,
+    },
+};
+
+FN_OID_TYPED_FROM_ASN1(oid_ecp_grp_t, grp_id, oid_ecp_grp)
+FN_OID_GET_ATTR1(mbedtls_oid_get_ec_grp, oid_ecp_grp_t, grp_id, mbedtls_ecp_group_id, grp_id)
+FN_OID_GET_OID_BY_ATTR1(mbedtls_oid_get_oid_by_ec_grp, oid_ecp_grp_t, oid_ecp_grp,
+    mbedtls_ecp_group_id, grp_id)
+#endif /* MBEDTLS_ECP_C */
+
+#if defined(MBEDTLS_CIPHER_C)
+/*
+ * For PKCS#5 PBES2 encryption algorithm
+ */
+typedef struct {
+    mbedtls_oid_descriptor_t descriptor;
+    mbedtls_cipher_type_t cipher_alg;
+} oid_cipher_alg_t;
+
+static const oid_cipher_alg_t oid_cipher_alg[] = {
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DES_CBC, "desCBC", "DES-CBC"),
+        MBEDTLS_CIPHER_DES_CBC,
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DES_EDE3_CBC, "des-ede3-cbc", "DES-EDE3-CBC"),
+        MBEDTLS_CIPHER_DES_EDE3_CBC,
+    },
+    {
+        NULL_OID_DESCRIPTOR,
+        MBEDTLS_CIPHER_NONE,
+    },
+};
+
+FN_OID_TYPED_FROM_ASN1(oid_cipher_alg_t, cipher_alg, oid_cipher_alg)
+FN_OID_GET_ATTR1(mbedtls_oid_get_cipher_alg, oid_cipher_alg_t, cipher_alg, mbedtls_cipher_type_t,
+    cipher_alg)
+#endif /* MBEDTLS_CIPHER_C */
+
+#if defined(MBEDTLS_MD_C)
+/*
+ * For digestAlgorithm
+ */
+typedef struct {
+    mbedtls_oid_descriptor_t descriptor;
+    mbedtls_md_type_t md_alg;
+} oid_md_alg_t;
+
+static const oid_md_alg_t oid_md_alg[] = {
+#if defined(MBEDTLS_MD5_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DIGEST_ALG_MD5, "id-md5", "MD5"),
+        MBEDTLS_MD_MD5,
+    },
+#endif /* MBEDTLS_MD5_C */
+#if defined(MBEDTLS_SHA1_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DIGEST_ALG_SHA1, "id-sha1", "SHA-1"),
+        MBEDTLS_MD_SHA1,
+    },
+#endif /* MBEDTLS_SHA1_C */
+#if defined(MBEDTLS_SHA224_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DIGEST_ALG_SHA224, "id-sha224", "SHA-224"),
+        MBEDTLS_MD_SHA224,
+    },
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DIGEST_ALG_SHA256, "id-sha256", "SHA-256"),
+        MBEDTLS_MD_SHA256,
+    },
+#endif /* MBEDTLS_SHA256_C */
+#if defined(MBEDTLS_SHA384_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DIGEST_ALG_SHA384, "id-sha384", "SHA-384"),
+        MBEDTLS_MD_SHA384,
+    },
+#endif /* MBEDTLS_SHA384_C */
+#if defined(MBEDTLS_SHA512_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DIGEST_ALG_SHA512, "id-sha512", "SHA-512"),
+        MBEDTLS_MD_SHA512,
+    },
+#endif /* MBEDTLS_SHA512_C */
+#if defined(MBEDTLS_RIPEMD160_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_DIGEST_ALG_RIPEMD160, "id-ripemd160", "RIPEMD-160"),
+        MBEDTLS_MD_RIPEMD160,
+    },
+#endif /* MBEDTLS_RIPEMD160_C */
+    {
+        NULL_OID_DESCRIPTOR,
+        MBEDTLS_MD_NONE,
+    },
+};
+
+FN_OID_TYPED_FROM_ASN1(oid_md_alg_t, md_alg, oid_md_alg)
+FN_OID_GET_ATTR1(mbedtls_oid_get_md_alg, oid_md_alg_t, md_alg, mbedtls_md_type_t, md_alg)
+FN_OID_GET_OID_BY_ATTR1(mbedtls_oid_get_oid_by_md, oid_md_alg_t, oid_md_alg, mbedtls_md_type_t,
+    md_alg)
+
+/*
+ * For HMAC digestAlgorithm
+ */
+typedef struct {
+    mbedtls_oid_descriptor_t descriptor;
+    mbedtls_md_type_t md_hmac;
+} oid_md_hmac_t;
+
+static const oid_md_hmac_t oid_md_hmac[] = {
+#if defined(MBEDTLS_SHA1_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_HMAC_SHA1, "hmacSHA1", "HMAC-SHA-1"),
+        MBEDTLS_MD_SHA1,
+    },
+#endif /* MBEDTLS_SHA1_C */
+#if defined(MBEDTLS_SHA224_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_HMAC_SHA224, "hmacSHA224", "HMAC-SHA-224"),
+        MBEDTLS_MD_SHA224,
+    },
+#endif
+#if defined(MBEDTLS_SHA256_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_HMAC_SHA256, "hmacSHA256", "HMAC-SHA-256"),
+        MBEDTLS_MD_SHA256,
+    },
+#endif /* MBEDTLS_SHA256_C */
+#if defined(MBEDTLS_SHA384_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_HMAC_SHA384, "hmacSHA384", "HMAC-SHA-384"),
+        MBEDTLS_MD_SHA384,
+    },
+#endif /* MBEDTLS_SHA384_C */
+#if defined(MBEDTLS_SHA512_C)
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_HMAC_SHA512, "hmacSHA512", "HMAC-SHA-512"),
+        MBEDTLS_MD_SHA512,
+    },
+#endif /* MBEDTLS_SHA512_C */
+    {
+        NULL_OID_DESCRIPTOR,
+        MBEDTLS_MD_NONE,
+    },
+};
+
+FN_OID_TYPED_FROM_ASN1(oid_md_hmac_t, md_hmac, oid_md_hmac)
+FN_OID_GET_ATTR1(mbedtls_oid_get_md_hmac, oid_md_hmac_t, md_hmac, mbedtls_md_type_t, md_hmac)
+#endif /* MBEDTLS_MD_C */
+
+#if defined(MBEDTLS_PKCS12_C)
+/*
+ * For PKCS#12 PBEs
+ */
+typedef struct {
+    mbedtls_oid_descriptor_t descriptor;
+    mbedtls_md_type_t md_alg;
+    mbedtls_cipher_type_t cipher_alg;
+} oid_pkcs12_pbe_alg_t;
+
+static const oid_pkcs12_pbe_alg_t oid_pkcs12_pbe_alg[] = {
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS12_PBE_SHA1_DES3_EDE_CBC, "pbeWithSHAAnd3-KeyTripleDES-CBC",
+            "PBE with SHA1 and 3-Key 3DES"),
+        MBEDTLS_MD_SHA1,
+        MBEDTLS_CIPHER_DES_EDE3_CBC,
+    },
+    {
+        OID_DESCRIPTOR(MBEDTLS_OID_PKCS12_PBE_SHA1_DES2_EDE_CBC, "pbeWithSHAAnd2-KeyTripleDES-CBC",
+            "PBE with SHA1 and 2-Key 3DES"),
+        MBEDTLS_MD_SHA1,
+        MBEDTLS_CIPHER_DES_EDE_CBC,
+    },
+    {
+        NULL_OID_DESCRIPTOR,
+        MBEDTLS_MD_NONE,
+        MBEDTLS_CIPHER_NONE,
+    },
+};
+
+FN_OID_TYPED_FROM_ASN1(oid_pkcs12_pbe_alg_t, pkcs12_pbe_alg, oid_pkcs12_pbe_alg)
+FN_OID_GET_ATTR2(mbedtls_oid_get_pkcs12_pbe_alg, oid_pkcs12_pbe_alg_t, pkcs12_pbe_alg,
+    mbedtls_md_type_t, md_alg, mbedtls_cipher_type_t, cipher_alg)
+#endif /* MBEDTLS_PKCS12_C */
+
+#define OID_SAFE_SNPRINTF                                                                          \
+    do {                                                                                           \
+        if (ret < 0 || (size_t)ret >= n)                                                           \
+            return (MBEDTLS_ERR_OID_BUF_TOO_SMALL);                                                \
+                                                                                                   \
+        n -= (size_t)ret;                                                                          \
+        p += (size_t)ret;                                                                          \
+    } while (0)
+
+/* Return the x.y.z.... style numeric string for the given OID */
+int mbedtls_oid_get_numeric_string(char*, size_t, const mbedtls_asn1_buf*) {
+    return MBEDTLS_ERR_ERROR_GENERIC_ERROR; // patched because it used to require printf which would
+                                            // fail on Windows
+}
+
+#endif /* MBEDTLS_OID_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pem.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pem.cpp
new file mode 100644
index 0000000000..ea6532b612
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pem.cpp
@@ -0,0 +1,471 @@
+/*
+ *  Privacy Enhanced Mail (PEM) decoding
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_PEM_PARSE_C) || defined(MBEDTLS_PEM_WRITE_C)
+
+#include "mbedtls/base64.h"
+#include "mbedtls/des.h"
+#include "mbedtls/pem.h"
+#ifdef MBEDTLS_AES_C
+#include "mbedtls/aes.h"
+#endif
+#ifdef MBEDTLS_MD5_C
+#include "mbedtls/md5.h"
+#endif
+#include <string.h>
+
+#include "mbedtls/cipher.h"
+#include "mbedtls/error.h"
+#include "mbedtls/platform_util.h"
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdlib.h>
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif
+
+#if defined(MBEDTLS_PEM_PARSE_C)
+void mbedtls_pem_init(mbedtls_pem_context* ctx) {
+    memset(ctx, 0, sizeof(mbedtls_pem_context));
+}
+
+#if defined(MBEDTLS_MD5_C) && defined(MBEDTLS_CIPHER_MODE_CBC) &&                                  \
+    (defined(MBEDTLS_DES_C) || defined(MBEDTLS_AES_C))
+/*
+ * Read a 16-byte hex string and convert it to binary
+ */
+static int pem_get_iv(const unsigned char* s, unsigned char* iv, size_t iv_len) {
+    size_t i, j, k;
+
+    memset(iv, 0, iv_len);
+
+    for (i = 0; i < iv_len * 2; i++, s++) {
+        if (*s >= '0' && *s <= '9')
+            j = *s - '0';
+        else if (*s >= 'A' && *s <= 'F')
+            j = *s - '7';
+        else if (*s >= 'a' && *s <= 'f')
+            j = *s - 'W';
+        else
+            return (MBEDTLS_ERR_PEM_INVALID_ENC_IV);
+
+        k = ((i & 1) != 0) ? j : j << 4;
+
+        iv[i >> 1] = (unsigned char)(iv[i >> 1] | k);
+    }
+
+    return (0);
+}
+
+static int pem_pbkdf1(unsigned char* key, size_t keylen, unsigned char* iv,
+    const unsigned char* pwd, size_t pwdlen) {
+    mbedtls_md5_context md5_ctx;
+    unsigned char md5sum[16];
+    size_t use_len;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    mbedtls_md5_init(&md5_ctx);
+
+    /*
+     * key[ 0..15] = MD5(pwd || IV)
+     */
+    if ((ret = mbedtls_md5_starts(&md5_ctx)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md5_update(&md5_ctx, pwd, pwdlen)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md5_update(&md5_ctx, iv, 8)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md5_finish(&md5_ctx, md5sum)) != 0)
+        goto exit;
+
+    if (keylen <= 16) {
+        memcpy(key, md5sum, keylen);
+        goto exit;
+    }
+
+    memcpy(key, md5sum, 16);
+
+    /*
+     * key[16..23] = MD5(key[ 0..15] || pwd || IV])
+     */
+    if ((ret = mbedtls_md5_starts(&md5_ctx)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md5_update(&md5_ctx, md5sum, 16)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md5_update(&md5_ctx, pwd, pwdlen)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md5_update(&md5_ctx, iv, 8)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md5_finish(&md5_ctx, md5sum)) != 0)
+        goto exit;
+
+    use_len = 16;
+    if (keylen < 32)
+        use_len = keylen - 16;
+
+    memcpy(key + 16, md5sum, use_len);
+
+exit:
+    mbedtls_md5_free(&md5_ctx);
+    mbedtls_platform_zeroize(md5sum, 16);
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_DES_C)
+/*
+ * Decrypt with DES-CBC, using PBKDF1 for key derivation
+ */
+static int pem_des_decrypt(unsigned char des_iv[8], unsigned char* buf, size_t buflen,
+    const unsigned char* pwd, size_t pwdlen) {
+    mbedtls_des_context des_ctx;
+    unsigned char des_key[8];
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    mbedtls_des_init(&des_ctx);
+
+    if ((ret = pem_pbkdf1(des_key, 8, des_iv, pwd, pwdlen)) != 0)
+        goto exit;
+
+    if ((ret = mbedtls_des_setkey_dec(&des_ctx, des_key)) != 0)
+        goto exit;
+    ret = mbedtls_des_crypt_cbc(&des_ctx, MBEDTLS_DES_DECRYPT, buflen, des_iv, buf, buf);
+
+exit:
+    mbedtls_des_free(&des_ctx);
+    mbedtls_platform_zeroize(des_key, 8);
+
+    return (ret);
+}
+
+/*
+ * Decrypt with 3DES-CBC, using PBKDF1 for key derivation
+ */
+static int pem_des3_decrypt(unsigned char des3_iv[8], unsigned char* buf, size_t buflen,
+    const unsigned char* pwd, size_t pwdlen) {
+    mbedtls_des3_context des3_ctx;
+    unsigned char des3_key[24];
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    mbedtls_des3_init(&des3_ctx);
+
+    if ((ret = pem_pbkdf1(des3_key, 24, des3_iv, pwd, pwdlen)) != 0)
+        goto exit;
+
+    if ((ret = mbedtls_des3_set3key_dec(&des3_ctx, des3_key)) != 0)
+        goto exit;
+    ret = mbedtls_des3_crypt_cbc(&des3_ctx, MBEDTLS_DES_DECRYPT, buflen, des3_iv, buf, buf);
+
+exit:
+    mbedtls_des3_free(&des3_ctx);
+    mbedtls_platform_zeroize(des3_key, 24);
+
+    return (ret);
+}
+#endif /* MBEDTLS_DES_C */
+
+#if defined(MBEDTLS_AES_C)
+/*
+ * Decrypt with AES-XXX-CBC, using PBKDF1 for key derivation
+ */
+static int pem_aes_decrypt(unsigned char aes_iv[16], unsigned int keylen, unsigned char* buf,
+    size_t buflen, const unsigned char* pwd, size_t pwdlen) {
+    mbedtls_aes_context aes_ctx;
+    unsigned char aes_key[32];
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    mbedtls_aes_init(&aes_ctx);
+
+    if ((ret = pem_pbkdf1(aes_key, keylen, aes_iv, pwd, pwdlen)) != 0)
+        goto exit;
+
+    if ((ret = mbedtls_aes_setkey_dec(&aes_ctx, aes_key, keylen * 8)) != 0)
+        goto exit;
+    ret = mbedtls_aes_crypt_cbc(&aes_ctx, MBEDTLS_AES_DECRYPT, buflen, aes_iv, buf, buf);
+
+exit:
+    mbedtls_aes_free(&aes_ctx);
+    mbedtls_platform_zeroize(aes_key, keylen);
+
+    return (ret);
+}
+#endif /* MBEDTLS_AES_C */
+
+#endif /* MBEDTLS_MD5_C && MBEDTLS_CIPHER_MODE_CBC &&                                              \
+          ( MBEDTLS_AES_C || MBEDTLS_DES_C ) */
+
+int mbedtls_pem_read_buffer(mbedtls_pem_context* ctx, const char* header, const char* footer,
+    const unsigned char* data, const unsigned char* pwd, size_t pwdlen, size_t* use_len) {
+    int ret, enc;
+    size_t len;
+    unsigned char* buf;
+    const unsigned char *s1, *s2, *end;
+#if defined(MBEDTLS_MD5_C) && defined(MBEDTLS_CIPHER_MODE_CBC) &&                                  \
+    (defined(MBEDTLS_DES_C) || defined(MBEDTLS_AES_C))
+    unsigned char pem_iv[16];
+    mbedtls_cipher_type_t enc_alg = MBEDTLS_CIPHER_NONE;
+#else
+    ((void)pwd);
+    ((void)pwdlen);
+#endif /* MBEDTLS_MD5_C && MBEDTLS_CIPHER_MODE_CBC &&                                              \
+          ( MBEDTLS_AES_C || MBEDTLS_DES_C ) */
+
+    if (ctx == NULL)
+        return (MBEDTLS_ERR_PEM_BAD_INPUT_DATA);
+
+    s1 = (unsigned char*)strstr((const char*)data, header);
+
+    if (s1 == NULL)
+        return (MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT);
+
+    s2 = (unsigned char*)strstr((const char*)data, footer);
+
+    if (s2 == NULL || s2 <= s1)
+        return (MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT);
+
+    s1 += strlen(header);
+    if (*s1 == ' ')
+        s1++;
+    if (*s1 == '\r')
+        s1++;
+    if (*s1 == '\n')
+        s1++;
+    else
+        return (MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT);
+
+    end = s2;
+    end += strlen(footer);
+    if (*end == ' ')
+        end++;
+    if (*end == '\r')
+        end++;
+    if (*end == '\n')
+        end++;
+    *use_len = end - data;
+
+    enc = 0;
+
+    if (s2 - s1 >= 22 && memcmp(s1, "Proc-Type: 4,ENCRYPTED", 22) == 0) {
+#if defined(MBEDTLS_MD5_C) && defined(MBEDTLS_CIPHER_MODE_CBC) &&                                  \
+    (defined(MBEDTLS_DES_C) || defined(MBEDTLS_AES_C))
+        enc++;
+
+        s1 += 22;
+        if (*s1 == '\r')
+            s1++;
+        if (*s1 == '\n')
+            s1++;
+        else
+            return (MBEDTLS_ERR_PEM_INVALID_DATA);
+
+#if defined(MBEDTLS_DES_C)
+        if (s2 - s1 >= 23 && memcmp(s1, "DEK-Info: DES-EDE3-CBC,", 23) == 0) {
+            enc_alg = MBEDTLS_CIPHER_DES_EDE3_CBC;
+
+            s1 += 23;
+            if (s2 - s1 < 16 || pem_get_iv(s1, pem_iv, 8) != 0)
+                return (MBEDTLS_ERR_PEM_INVALID_ENC_IV);
+
+            s1 += 16;
+        } else if (s2 - s1 >= 18 && memcmp(s1, "DEK-Info: DES-CBC,", 18) == 0) {
+            enc_alg = MBEDTLS_CIPHER_DES_CBC;
+
+            s1 += 18;
+            if (s2 - s1 < 16 || pem_get_iv(s1, pem_iv, 8) != 0)
+                return (MBEDTLS_ERR_PEM_INVALID_ENC_IV);
+
+            s1 += 16;
+        }
+#endif /* MBEDTLS_DES_C */
+
+#if defined(MBEDTLS_AES_C)
+        if (s2 - s1 >= 14 && memcmp(s1, "DEK-Info: AES-", 14) == 0) {
+            if (s2 - s1 < 22)
+                return (MBEDTLS_ERR_PEM_UNKNOWN_ENC_ALG);
+            else if (memcmp(s1, "DEK-Info: AES-128-CBC,", 22) == 0)
+                enc_alg = MBEDTLS_CIPHER_AES_128_CBC;
+            else if (memcmp(s1, "DEK-Info: AES-192-CBC,", 22) == 0)
+                enc_alg = MBEDTLS_CIPHER_AES_192_CBC;
+            else if (memcmp(s1, "DEK-Info: AES-256-CBC,", 22) == 0)
+                enc_alg = MBEDTLS_CIPHER_AES_256_CBC;
+            else
+                return (MBEDTLS_ERR_PEM_UNKNOWN_ENC_ALG);
+
+            s1 += 22;
+            if (s2 - s1 < 32 || pem_get_iv(s1, pem_iv, 16) != 0)
+                return (MBEDTLS_ERR_PEM_INVALID_ENC_IV);
+
+            s1 += 32;
+        }
+#endif /* MBEDTLS_AES_C */
+
+        if (enc_alg == MBEDTLS_CIPHER_NONE)
+            return (MBEDTLS_ERR_PEM_UNKNOWN_ENC_ALG);
+
+        if (*s1 == '\r')
+            s1++;
+        if (*s1 == '\n')
+            s1++;
+        else
+            return (MBEDTLS_ERR_PEM_INVALID_DATA);
+#else
+        return (MBEDTLS_ERR_PEM_FEATURE_UNAVAILABLE);
+#endif /* MBEDTLS_MD5_C && MBEDTLS_CIPHER_MODE_CBC &&                                              \
+          ( MBEDTLS_AES_C || MBEDTLS_DES_C ) */
+    }
+
+    if (s1 >= s2)
+        return (MBEDTLS_ERR_PEM_INVALID_DATA);
+
+    ret = mbedtls_base64_decode(NULL, 0, &len, s1, s2 - s1);
+
+    if (ret == MBEDTLS_ERR_BASE64_INVALID_CHARACTER)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PEM_INVALID_DATA, ret));
+
+    if ((buf = (unsigned char*)mbedtls_calloc(1, len)) == NULL)
+        return (MBEDTLS_ERR_PEM_ALLOC_FAILED);
+
+    if ((ret = mbedtls_base64_decode(buf, len, &len, s1, s2 - s1)) != 0) {
+        mbedtls_platform_zeroize(buf, len);
+        mbedtls_free(buf);
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PEM_INVALID_DATA, ret));
+    }
+
+    if (enc != 0) {
+#if defined(MBEDTLS_MD5_C) && defined(MBEDTLS_CIPHER_MODE_CBC) &&                                  \
+    (defined(MBEDTLS_DES_C) || defined(MBEDTLS_AES_C))
+        if (pwd == NULL) {
+            mbedtls_platform_zeroize(buf, len);
+            mbedtls_free(buf);
+            return (MBEDTLS_ERR_PEM_PASSWORD_REQUIRED);
+        }
+
+        ret = 0;
+
+#if defined(MBEDTLS_DES_C)
+        if (enc_alg == MBEDTLS_CIPHER_DES_EDE3_CBC)
+            ret = pem_des3_decrypt(pem_iv, buf, len, pwd, pwdlen);
+        else if (enc_alg == MBEDTLS_CIPHER_DES_CBC)
+            ret = pem_des_decrypt(pem_iv, buf, len, pwd, pwdlen);
+#endif /* MBEDTLS_DES_C */
+
+#if defined(MBEDTLS_AES_C)
+        if (enc_alg == MBEDTLS_CIPHER_AES_128_CBC)
+            ret = pem_aes_decrypt(pem_iv, 16, buf, len, pwd, pwdlen);
+        else if (enc_alg == MBEDTLS_CIPHER_AES_192_CBC)
+            ret = pem_aes_decrypt(pem_iv, 24, buf, len, pwd, pwdlen);
+        else if (enc_alg == MBEDTLS_CIPHER_AES_256_CBC)
+            ret = pem_aes_decrypt(pem_iv, 32, buf, len, pwd, pwdlen);
+#endif /* MBEDTLS_AES_C */
+
+        if (ret != 0) {
+            mbedtls_free(buf);
+            return (ret);
+        }
+
+        /*
+         * The result will be ASN.1 starting with a SEQUENCE tag, with 1 to 3
+         * length bytes (allow 4 to be sure) in all known use cases.
+         *
+         * Use that as a heuristic to try to detect password mismatches.
+         */
+        if (len <= 2 || buf[0] != 0x30 || buf[1] > 0x83) {
+            mbedtls_platform_zeroize(buf, len);
+            mbedtls_free(buf);
+            return (MBEDTLS_ERR_PEM_PASSWORD_MISMATCH);
+        }
+#else
+        mbedtls_platform_zeroize(buf, len);
+        mbedtls_free(buf);
+        return (MBEDTLS_ERR_PEM_FEATURE_UNAVAILABLE);
+#endif /* MBEDTLS_MD5_C && MBEDTLS_CIPHER_MODE_CBC &&                                              \
+          ( MBEDTLS_AES_C || MBEDTLS_DES_C ) */
+    }
+
+    ctx->buf = buf;
+    ctx->buflen = len;
+
+    return (0);
+}
+
+void mbedtls_pem_free(mbedtls_pem_context* ctx) {
+    if (ctx->buf != NULL) {
+        mbedtls_platform_zeroize(ctx->buf, ctx->buflen);
+        mbedtls_free(ctx->buf);
+    }
+    mbedtls_free(ctx->info);
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_pem_context));
+}
+#endif /* MBEDTLS_PEM_PARSE_C */
+
+#if defined(MBEDTLS_PEM_WRITE_C)
+int mbedtls_pem_write_buffer(const char* header, const char* footer, const unsigned char* der_data,
+    size_t der_len, unsigned char* buf, size_t buf_len, size_t* olen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char *encode_buf = NULL, *c, *p = buf;
+    size_t len = 0, use_len, add_len = 0;
+
+    mbedtls_base64_encode(NULL, 0, &use_len, der_data, der_len);
+    add_len = strlen(header) + strlen(footer) + (use_len / 64) + 1;
+
+    if (use_len + add_len > buf_len) {
+        *olen = use_len + add_len;
+        return (MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL);
+    }
+
+    if (use_len != 0 && ((encode_buf = mbedtls_calloc(1, use_len)) == NULL))
+        return (MBEDTLS_ERR_PEM_ALLOC_FAILED);
+
+    if ((ret = mbedtls_base64_encode(encode_buf, use_len, &use_len, der_data, der_len)) != 0) {
+        mbedtls_free(encode_buf);
+        return (ret);
+    }
+
+    memcpy(p, header, strlen(header));
+    p += strlen(header);
+    c = encode_buf;
+
+    while (use_len) {
+        len = (use_len > 64) ? 64 : use_len;
+        memcpy(p, c, len);
+        use_len -= len;
+        p += len;
+        c += len;
+        *p++ = '\n';
+    }
+
+    memcpy(p, footer, strlen(footer));
+    p += strlen(footer);
+
+    *p++ = '\0';
+    *olen = p - buf;
+
+    /* Clean any remaining data previously written to the buffer */
+    memset(buf + *olen, 0, buf_len - *olen);
+
+    mbedtls_free(encode_buf);
+    return (0);
+}
+#endif /* MBEDTLS_PEM_WRITE_C */
+#endif /* MBEDTLS_PEM_PARSE_C || MBEDTLS_PEM_WRITE_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pk.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pk.cpp
new file mode 100644
index 0000000000..a4c862862f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pk.cpp
@@ -0,0 +1,578 @@
+/*
+ *  Public Key abstraction layer
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_PK_C)
+#include "mbedtls/error.h"
+#include "mbedtls/pk.h"
+#include "mbedtls/platform_util.h"
+#include "pk_wrap.h"
+
+#if defined(MBEDTLS_RSA_C)
+#include "mbedtls/rsa.h"
+#endif
+#if defined(MBEDTLS_ECP_C)
+#include "mbedtls/ecp.h"
+#endif
+#if defined(MBEDTLS_ECDSA_C)
+#include "mbedtls/ecdsa.h"
+#endif
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+#include "mbedtls/psa_util.h"
+#endif
+
+#include <limits.h>
+#include <stdint.h>
+
+/* Parameter validation macros based on platform_util.h */
+#define PK_VALIDATE_RET(cond) MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_PK_BAD_INPUT_DATA)
+#define PK_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+/*
+ * Initialise a mbedtls_pk_context
+ */
+void mbedtls_pk_init(mbedtls_pk_context* ctx) {
+    PK_VALIDATE(ctx != NULL);
+
+    ctx->pk_info = NULL;
+    ctx->pk_ctx = NULL;
+}
+
+/*
+ * Free (the components of) a mbedtls_pk_context
+ */
+void mbedtls_pk_free(mbedtls_pk_context* ctx) {
+    if (ctx == NULL)
+        return;
+
+    if (ctx->pk_info != NULL)
+        ctx->pk_info->ctx_free_func(ctx->pk_ctx);
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_pk_context));
+}
+
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+/*
+ * Initialize a restart context
+ */
+void mbedtls_pk_restart_init(mbedtls_pk_restart_ctx* ctx) {
+    PK_VALIDATE(ctx != NULL);
+    ctx->pk_info = NULL;
+    ctx->rs_ctx = NULL;
+}
+
+/*
+ * Free the components of a restart context
+ */
+void mbedtls_pk_restart_free(mbedtls_pk_restart_ctx* ctx) {
+    if (ctx == NULL || ctx->pk_info == NULL || ctx->pk_info->rs_free_func == NULL) {
+        return;
+    }
+
+    ctx->pk_info->rs_free_func(ctx->rs_ctx);
+
+    ctx->pk_info = NULL;
+    ctx->rs_ctx = NULL;
+}
+#endif /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+
+/*
+ * Get pk_info structure from type
+ */
+const mbedtls_pk_info_t* mbedtls_pk_info_from_type(mbedtls_pk_type_t pk_type) {
+    switch (pk_type) {
+#if defined(MBEDTLS_RSA_C)
+    case MBEDTLS_PK_RSA:
+        return (&mbedtls_rsa_info);
+#endif
+#if defined(MBEDTLS_ECP_C)
+    case MBEDTLS_PK_ECKEY:
+        return (&mbedtls_eckey_info);
+    case MBEDTLS_PK_ECKEY_DH:
+        return (&mbedtls_eckeydh_info);
+#endif
+#if defined(MBEDTLS_ECDSA_C)
+    case MBEDTLS_PK_ECDSA:
+        return (&mbedtls_ecdsa_info);
+#endif
+    /* MBEDTLS_PK_RSA_ALT omitted on purpose */
+    default:
+        return (NULL);
+    }
+}
+
+/*
+ * Initialise context
+ */
+int mbedtls_pk_setup(mbedtls_pk_context* ctx, const mbedtls_pk_info_t* info) {
+    PK_VALIDATE_RET(ctx != NULL);
+    if (info == NULL || ctx->pk_info != NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    if ((ctx->pk_ctx = info->ctx_alloc_func()) == NULL)
+        return (MBEDTLS_ERR_PK_ALLOC_FAILED);
+
+    ctx->pk_info = info;
+
+    return (0);
+}
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+/*
+ * Initialise a PSA-wrapping context
+ */
+int mbedtls_pk_setup_opaque(mbedtls_pk_context* ctx, const psa_key_id_t key) {
+    const mbedtls_pk_info_t* const info = &mbedtls_pk_opaque_info;
+    psa_key_attributes_t attributes = PSA_KEY_ATTRIBUTES_INIT;
+    psa_key_id_t* pk_ctx;
+    psa_key_type_t type;
+
+    if (ctx == NULL || ctx->pk_info != NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    if (PSA_SUCCESS != psa_get_key_attributes(key, &attributes))
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+    type = psa_get_key_type(&attributes);
+    psa_reset_key_attributes(&attributes);
+
+    /* Current implementation of can_do() relies on this. */
+    if (!PSA_KEY_TYPE_IS_ECC_KEY_PAIR(type))
+        return (MBEDTLS_ERR_PK_FEATURE_UNAVAILABLE);
+
+    if ((ctx->pk_ctx = info->ctx_alloc_func()) == NULL)
+        return (MBEDTLS_ERR_PK_ALLOC_FAILED);
+
+    ctx->pk_info = info;
+
+    pk_ctx = (psa_key_id_t*)ctx->pk_ctx;
+    *pk_ctx = key;
+
+    return (0);
+}
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#if defined(MBEDTLS_PK_RSA_ALT_SUPPORT)
+/*
+ * Initialize an RSA-alt context
+ */
+int mbedtls_pk_setup_rsa_alt(mbedtls_pk_context* ctx, void* key,
+    mbedtls_pk_rsa_alt_decrypt_func decrypt_func, mbedtls_pk_rsa_alt_sign_func sign_func,
+    mbedtls_pk_rsa_alt_key_len_func key_len_func) {
+    mbedtls_rsa_alt_context* rsa_alt;
+    const mbedtls_pk_info_t* info = &mbedtls_rsa_alt_info;
+
+    PK_VALIDATE_RET(ctx != NULL);
+    if (ctx->pk_info != NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    if ((ctx->pk_ctx = info->ctx_alloc_func()) == NULL)
+        return (MBEDTLS_ERR_PK_ALLOC_FAILED);
+
+    ctx->pk_info = info;
+
+    rsa_alt = (mbedtls_rsa_alt_context*)ctx->pk_ctx;
+
+    rsa_alt->key = key;
+    rsa_alt->decrypt_func = decrypt_func;
+    rsa_alt->sign_func = sign_func;
+    rsa_alt->key_len_func = key_len_func;
+
+    return (0);
+}
+#endif /* MBEDTLS_PK_RSA_ALT_SUPPORT */
+
+/*
+ * Tell if a PK can do the operations of the given type
+ */
+int mbedtls_pk_can_do(const mbedtls_pk_context* ctx, mbedtls_pk_type_t type) {
+    /* A context with null pk_info is not set up yet and can't do anything.
+     * For backward compatibility, also accept NULL instead of a context
+     * pointer. */
+    if (ctx == NULL || ctx->pk_info == NULL)
+        return (0);
+
+    return (ctx->pk_info->can_do(type));
+}
+
+/*
+ * Helper for mbedtls_pk_sign and mbedtls_pk_verify
+ */
+static inline int pk_hashlen_helper(mbedtls_md_type_t md_alg, size_t* hash_len) {
+    const mbedtls_md_info_t* md_info;
+
+    if (*hash_len != 0)
+        return (0);
+
+    if ((md_info = mbedtls_md_info_from_type(md_alg)) == NULL)
+        return (-1);
+
+    *hash_len = mbedtls_md_get_size(md_info);
+    return (0);
+}
+
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+/*
+ * Helper to set up a restart context if needed
+ */
+static int pk_restart_setup(mbedtls_pk_restart_ctx* ctx, const mbedtls_pk_info_t* info) {
+    /* Don't do anything if already set up or invalid */
+    if (ctx == NULL || ctx->pk_info != NULL)
+        return (0);
+
+    /* Should never happen when we're called */
+    if (info->rs_alloc_func == NULL || info->rs_free_func == NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    if ((ctx->rs_ctx = info->rs_alloc_func()) == NULL)
+        return (MBEDTLS_ERR_PK_ALLOC_FAILED);
+
+    ctx->pk_info = info;
+
+    return (0);
+}
+#endif /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+
+/*
+ * Verify a signature (restartable)
+ */
+int mbedtls_pk_verify_restartable(mbedtls_pk_context* ctx, mbedtls_md_type_t md_alg,
+    const unsigned char* hash, size_t hash_len, const unsigned char* sig, size_t sig_len,
+    mbedtls_pk_restart_ctx* rs_ctx) {
+    PK_VALIDATE_RET(ctx != NULL);
+    PK_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hash_len == 0) || hash != NULL);
+    PK_VALIDATE_RET(sig != NULL);
+
+    if (ctx->pk_info == NULL || pk_hashlen_helper(md_alg, &hash_len) != 0)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    /* optimization: use non-restartable version if restart disabled */
+    if (rs_ctx != NULL && mbedtls_ecp_restart_is_enabled() &&
+        ctx->pk_info->verify_rs_func != NULL) {
+        int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+        if ((ret = pk_restart_setup(rs_ctx, ctx->pk_info)) != 0)
+            return (ret);
+
+        ret = ctx->pk_info->verify_rs_func(ctx->pk_ctx, md_alg, hash, hash_len, sig, sig_len,
+            rs_ctx->rs_ctx);
+
+        if (ret != MBEDTLS_ERR_ECP_IN_PROGRESS)
+            mbedtls_pk_restart_free(rs_ctx);
+
+        return (ret);
+    }
+#else  /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+    (void)rs_ctx;
+#endif /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+
+    if (ctx->pk_info->verify_func == NULL)
+        return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+
+    return (ctx->pk_info->verify_func(ctx->pk_ctx, md_alg, hash, hash_len, sig, sig_len));
+}
+
+/*
+ * Verify a signature
+ */
+int mbedtls_pk_verify(mbedtls_pk_context* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len) {
+    return (mbedtls_pk_verify_restartable(ctx, md_alg, hash, hash_len, sig, sig_len, NULL));
+}
+
+/*
+ * Verify a signature with options
+ */
+int mbedtls_pk_verify_ext(mbedtls_pk_type_t type, const void* options, mbedtls_pk_context* ctx,
+    mbedtls_md_type_t md_alg, const unsigned char* hash, size_t hash_len, const unsigned char* sig,
+    size_t sig_len) {
+    PK_VALIDATE_RET(ctx != NULL);
+    PK_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hash_len == 0) || hash != NULL);
+    PK_VALIDATE_RET(sig != NULL);
+
+    if (ctx->pk_info == NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    if (!mbedtls_pk_can_do(ctx, type))
+        return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+
+    if (type == MBEDTLS_PK_RSASSA_PSS) {
+#if defined(MBEDTLS_RSA_C) && defined(MBEDTLS_PKCS1_V21)
+        int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+        const mbedtls_pk_rsassa_pss_options* pss_opts;
+
+#if SIZE_MAX > UINT_MAX
+        if (md_alg == MBEDTLS_MD_NONE && UINT_MAX < hash_len)
+            return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+#endif /* SIZE_MAX > UINT_MAX */
+
+        if (options == NULL)
+            return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+        pss_opts = (const mbedtls_pk_rsassa_pss_options*)options;
+
+        if (sig_len < mbedtls_pk_get_len(ctx))
+            return (MBEDTLS_ERR_RSA_VERIFY_FAILED);
+
+        ret = mbedtls_rsa_rsassa_pss_verify_ext(mbedtls_pk_rsa(*ctx), md_alg,
+            (unsigned int)hash_len, hash, pss_opts->mgf1_hash_id, pss_opts->expected_salt_len, sig);
+        if (ret != 0)
+            return (ret);
+
+        if (sig_len > mbedtls_pk_get_len(ctx))
+            return (MBEDTLS_ERR_PK_SIG_LEN_MISMATCH);
+
+        return (0);
+#else
+        return (MBEDTLS_ERR_PK_FEATURE_UNAVAILABLE);
+#endif /* MBEDTLS_RSA_C && MBEDTLS_PKCS1_V21 */
+    }
+
+    /* General case: no options */
+    if (options != NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    return (mbedtls_pk_verify(ctx, md_alg, hash, hash_len, sig, sig_len));
+}
+
+/*
+ * Make a signature (restartable)
+ */
+int mbedtls_pk_sign_restartable(mbedtls_pk_context* ctx, mbedtls_md_type_t md_alg,
+    const unsigned char* hash, size_t hash_len, unsigned char* sig, size_t sig_size,
+    size_t* sig_len, int (*f_rng)(void*, unsigned char*, size_t), void* p_rng,
+    mbedtls_pk_restart_ctx* rs_ctx) {
+    PK_VALIDATE_RET(ctx != NULL);
+    PK_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hash_len == 0) || hash != NULL);
+    PK_VALIDATE_RET(sig != NULL);
+
+    if (ctx->pk_info == NULL || pk_hashlen_helper(md_alg, &hash_len) != 0)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    /* optimization: use non-restartable version if restart disabled */
+    if (rs_ctx != NULL && mbedtls_ecp_restart_is_enabled() && ctx->pk_info->sign_rs_func != NULL) {
+        int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+        if ((ret = pk_restart_setup(rs_ctx, ctx->pk_info)) != 0)
+            return (ret);
+
+        ret = ctx->pk_info->sign_rs_func(ctx->pk_ctx, md_alg, hash, hash_len, sig, sig_size,
+            sig_len, f_rng, p_rng, rs_ctx->rs_ctx);
+
+        if (ret != MBEDTLS_ERR_ECP_IN_PROGRESS)
+            mbedtls_pk_restart_free(rs_ctx);
+
+        return (ret);
+    }
+#else  /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+    (void)rs_ctx;
+#endif /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+
+    if (ctx->pk_info->sign_func == NULL)
+        return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+
+    return (ctx->pk_info->sign_func(ctx->pk_ctx, md_alg, hash, hash_len, sig, sig_size, sig_len,
+        f_rng, p_rng));
+}
+
+/*
+ * Make a signature
+ */
+int mbedtls_pk_sign(mbedtls_pk_context* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    return (mbedtls_pk_sign_restartable(ctx, md_alg, hash, hash_len, sig, sig_size, sig_len, f_rng,
+        p_rng, NULL));
+}
+
+/*
+ * Decrypt message
+ */
+int mbedtls_pk_decrypt(mbedtls_pk_context* ctx, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen, size_t osize, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng) {
+    PK_VALIDATE_RET(ctx != NULL);
+    PK_VALIDATE_RET(input != NULL || ilen == 0);
+    PK_VALIDATE_RET(output != NULL || osize == 0);
+    PK_VALIDATE_RET(olen != NULL);
+
+    if (ctx->pk_info == NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    if (ctx->pk_info->decrypt_func == NULL)
+        return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+
+    return (
+        ctx->pk_info->decrypt_func(ctx->pk_ctx, input, ilen, output, olen, osize, f_rng, p_rng));
+}
+
+/*
+ * Encrypt message
+ */
+int mbedtls_pk_encrypt(mbedtls_pk_context* ctx, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen, size_t osize, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng) {
+    PK_VALIDATE_RET(ctx != NULL);
+    PK_VALIDATE_RET(input != NULL || ilen == 0);
+    PK_VALIDATE_RET(output != NULL || osize == 0);
+    PK_VALIDATE_RET(olen != NULL);
+
+    if (ctx->pk_info == NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    if (ctx->pk_info->encrypt_func == NULL)
+        return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+
+    return (
+        ctx->pk_info->encrypt_func(ctx->pk_ctx, input, ilen, output, olen, osize, f_rng, p_rng));
+}
+
+/*
+ * Check public-private key pair
+ */
+int mbedtls_pk_check_pair(const mbedtls_pk_context* pub, const mbedtls_pk_context* prv,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    PK_VALIDATE_RET(pub != NULL);
+    PK_VALIDATE_RET(prv != NULL);
+
+    if (pub->pk_info == NULL || prv->pk_info == NULL) {
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+    }
+
+    if (f_rng == NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    if (prv->pk_info->check_pair_func == NULL)
+        return (MBEDTLS_ERR_PK_FEATURE_UNAVAILABLE);
+
+    if (prv->pk_info->type == MBEDTLS_PK_RSA_ALT) {
+        if (pub->pk_info->type != MBEDTLS_PK_RSA)
+            return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+    } else {
+        if (pub->pk_info != prv->pk_info)
+            return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+    }
+
+    return (prv->pk_info->check_pair_func(pub->pk_ctx, prv->pk_ctx, f_rng, p_rng));
+}
+
+/*
+ * Get key size in bits
+ */
+size_t mbedtls_pk_get_bitlen(const mbedtls_pk_context* ctx) {
+    /* For backward compatibility, accept NULL or a context that
+     * isn't set up yet, and return a fake value that should be safe. */
+    if (ctx == NULL || ctx->pk_info == NULL)
+        return (0);
+
+    return (ctx->pk_info->get_bitlen(ctx->pk_ctx));
+}
+
+/*
+ * Export debug information
+ */
+int mbedtls_pk_debug(const mbedtls_pk_context* ctx, mbedtls_pk_debug_item* items) {
+    PK_VALIDATE_RET(ctx != NULL);
+    if (ctx->pk_info == NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    if (ctx->pk_info->debug_func == NULL)
+        return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+
+    ctx->pk_info->debug_func(ctx->pk_ctx, items);
+    return (0);
+}
+
+/*
+ * Access the PK type name
+ */
+const char* mbedtls_pk_get_name(const mbedtls_pk_context* ctx) {
+    if (ctx == NULL || ctx->pk_info == NULL)
+        return ("invalid PK");
+
+    return (ctx->pk_info->name);
+}
+
+/*
+ * Access the PK type
+ */
+mbedtls_pk_type_t mbedtls_pk_get_type(const mbedtls_pk_context* ctx) {
+    if (ctx == NULL || ctx->pk_info == NULL)
+        return (MBEDTLS_PK_NONE);
+
+    return (ctx->pk_info->type);
+}
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+/*
+ * Load the key to a PSA key slot,
+ * then turn the PK context into a wrapper for that key slot.
+ *
+ * Currently only works for EC private keys.
+ */
+int mbedtls_pk_wrap_as_opaque(mbedtls_pk_context* pk, psa_key_id_t* key, psa_algorithm_t hash_alg) {
+#if !defined(MBEDTLS_ECP_C)
+    ((void)pk);
+    ((void)key);
+    ((void)hash_alg);
+    return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+#else
+    const mbedtls_ecp_keypair* ec;
+    unsigned char d[MBEDTLS_ECP_MAX_BYTES];
+    size_t d_len;
+    psa_ecc_family_t curve_id;
+    psa_key_attributes_t attributes = PSA_KEY_ATTRIBUTES_INIT;
+    psa_key_type_t key_type;
+    size_t bits;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    /* export the private key material in the format PSA wants */
+    if (mbedtls_pk_get_type(pk) != MBEDTLS_PK_ECKEY)
+        return (MBEDTLS_ERR_PK_TYPE_MISMATCH);
+
+    ec = mbedtls_pk_ec(*pk);
+    d_len = (ec->grp.nbits + 7) / 8;
+    if ((ret = mbedtls_mpi_write_binary(&ec->d, d, d_len)) != 0)
+        return (ret);
+
+    curve_id = mbedtls_ecc_group_to_psa(ec->grp.id, &bits);
+    key_type = PSA_KEY_TYPE_ECC_KEY_PAIR(curve_id);
+
+    /* prepare the key attributes */
+    psa_set_key_type(&attributes, key_type);
+    psa_set_key_bits(&attributes, bits);
+    psa_set_key_usage_flags(&attributes, PSA_KEY_USAGE_SIGN_HASH);
+    psa_set_key_algorithm(&attributes, PSA_ALG_ECDSA(hash_alg));
+
+    /* import private key into PSA */
+    if (PSA_SUCCESS != psa_import_key(&attributes, d, d_len, key))
+        return (MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED);
+
+    /* make PK context wrap the key slot */
+    mbedtls_pk_free(pk);
+    mbedtls_pk_init(pk);
+
+    return (mbedtls_pk_setup_opaque(pk, *key));
+#endif /* MBEDTLS_ECP_C */
+}
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+#endif /* MBEDTLS_PK_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pk_wrap.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pk_wrap.cpp
new file mode 100644
index 0000000000..ce2499a4fb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pk_wrap.cpp
@@ -0,0 +1,928 @@
+/*
+ *  Public Key abstraction layer: wrapper functions
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_PK_C)
+#include "mbedtls/error.h"
+#include "pk_wrap.h"
+
+/* Even if RSA not activated, for the sake of RSA-alt */
+#include <string.h>
+
+#include "mbedtls/rsa.h"
+
+#if defined(MBEDTLS_ECP_C)
+#include "mbedtls/ecp.h"
+#endif
+
+#if defined(MBEDTLS_ECDSA_C)
+#include "mbedtls/ecdsa.h"
+#endif
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+#include "mbedtls/asn1write.h"
+#endif
+
+#if defined(MBEDTLS_PK_RSA_ALT_SUPPORT)
+#include "mbedtls/platform_util.h"
+#endif
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+#include "mbedtls/asn1.h"
+#include "mbedtls/psa_util.h"
+#include "psa/crypto.h"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdlib.h>
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif
+
+#include <limits.h>
+#include <stdint.h>
+
+#if defined(MBEDTLS_RSA_C)
+static int rsa_can_do(mbedtls_pk_type_t type) {
+    return (type == MBEDTLS_PK_RSA || type == MBEDTLS_PK_RSASSA_PSS);
+}
+
+static size_t rsa_get_bitlen(const void* ctx) {
+    const mbedtls_rsa_context* rsa = (const mbedtls_rsa_context*)ctx;
+    return (8 * mbedtls_rsa_get_len(rsa));
+}
+
+static int rsa_verify_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_rsa_context* rsa = (mbedtls_rsa_context*)ctx;
+    size_t rsa_len = mbedtls_rsa_get_len(rsa);
+
+#if SIZE_MAX > UINT_MAX
+    if (md_alg == MBEDTLS_MD_NONE && UINT_MAX < hash_len)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+#endif /* SIZE_MAX > UINT_MAX */
+
+    if (sig_len < rsa_len)
+        return (MBEDTLS_ERR_RSA_VERIFY_FAILED);
+
+    if ((ret = mbedtls_rsa_pkcs1_verify(rsa, md_alg, (unsigned int)hash_len, hash, sig)) != 0)
+        return (ret);
+
+    /* The buffer contains a valid signature followed by extra data.
+     * We have a special error code for that so that so that callers can
+     * use mbedtls_pk_verify() to check "Does the buffer start with a
+     * valid signature?" and not just "Does the buffer contain a valid
+     * signature?". */
+    if (sig_len > rsa_len)
+        return (MBEDTLS_ERR_PK_SIG_LEN_MISMATCH);
+
+    return (0);
+}
+
+static int rsa_sign_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    mbedtls_rsa_context* rsa = (mbedtls_rsa_context*)ctx;
+
+#if SIZE_MAX > UINT_MAX
+    if (md_alg == MBEDTLS_MD_NONE && UINT_MAX < hash_len)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+#endif /* SIZE_MAX > UINT_MAX */
+
+    *sig_len = mbedtls_rsa_get_len(rsa);
+    if (sig_size < *sig_len)
+        return (MBEDTLS_ERR_PK_BUFFER_TOO_SMALL);
+
+    return (mbedtls_rsa_pkcs1_sign(rsa, f_rng, p_rng, md_alg, (unsigned int)hash_len, hash, sig));
+}
+
+static int rsa_decrypt_wrap(void* ctx, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen, size_t osize, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng) {
+    mbedtls_rsa_context* rsa = (mbedtls_rsa_context*)ctx;
+
+    if (ilen != mbedtls_rsa_get_len(rsa))
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    return (mbedtls_rsa_pkcs1_decrypt(rsa, f_rng, p_rng, olen, input, output, osize));
+}
+
+static int rsa_encrypt_wrap(void* ctx, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen, size_t osize, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng) {
+    mbedtls_rsa_context* rsa = (mbedtls_rsa_context*)ctx;
+    *olen = mbedtls_rsa_get_len(rsa);
+
+    if (*olen > osize)
+        return (MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE);
+
+    return (mbedtls_rsa_pkcs1_encrypt(rsa, f_rng, p_rng, ilen, input, output));
+}
+
+static int rsa_check_pair_wrap(const void* pub, const void* prv,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    (void)f_rng;
+    (void)p_rng;
+    return (mbedtls_rsa_check_pub_priv((const mbedtls_rsa_context*)pub,
+        (const mbedtls_rsa_context*)prv));
+}
+
+static void* rsa_alloc_wrap(void) {
+    void* ctx = mbedtls_calloc(1, sizeof(mbedtls_rsa_context));
+
+    if (ctx != NULL)
+        mbedtls_rsa_init((mbedtls_rsa_context*)ctx);
+
+    return (ctx);
+}
+
+static void rsa_free_wrap(void* ctx) {
+    mbedtls_rsa_free((mbedtls_rsa_context*)ctx);
+    mbedtls_free(ctx);
+}
+
+static void rsa_debug(const void* ctx, mbedtls_pk_debug_item* items) {
+#if defined(MBEDTLS_RSA_ALT)
+    /* Not supported */
+    (void)ctx;
+    (void)items;
+#else
+    items->type = MBEDTLS_PK_DEBUG_MPI;
+    items->name = "rsa.N";
+    items->value = &(((mbedtls_rsa_context*)ctx)->N);
+
+    items++;
+
+    items->type = MBEDTLS_PK_DEBUG_MPI;
+    items->name = "rsa.E";
+    items->value = &(((mbedtls_rsa_context*)ctx)->E);
+#endif
+}
+
+const mbedtls_pk_info_t mbedtls_rsa_info = {
+    MBEDTLS_PK_RSA,
+    "RSA",
+    rsa_get_bitlen,
+    rsa_can_do,
+    rsa_verify_wrap,
+    rsa_sign_wrap,
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    NULL,
+    NULL,
+#endif
+    rsa_decrypt_wrap,
+    rsa_encrypt_wrap,
+    rsa_check_pair_wrap,
+    rsa_alloc_wrap,
+    rsa_free_wrap,
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    NULL,
+    NULL,
+#endif
+    rsa_debug,
+};
+#endif /* MBEDTLS_RSA_C */
+
+#if defined(MBEDTLS_ECP_C)
+/*
+ * Generic EC key
+ */
+static int eckey_can_do(mbedtls_pk_type_t type) {
+    return (type == MBEDTLS_PK_ECKEY || type == MBEDTLS_PK_ECKEY_DH || type == MBEDTLS_PK_ECDSA);
+}
+
+static size_t eckey_get_bitlen(const void* ctx) {
+    return (((mbedtls_ecp_keypair*)ctx)->grp.pbits);
+}
+
+#if defined(MBEDTLS_ECDSA_C)
+/* Forward declarations */
+static int ecdsa_verify_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len);
+
+static int ecdsa_sign_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+static int eckey_verify_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_ecdsa_context ecdsa;
+
+    mbedtls_ecdsa_init(&ecdsa);
+
+    if ((ret = mbedtls_ecdsa_from_keypair(&ecdsa, ctx)) == 0)
+        ret = ecdsa_verify_wrap(&ecdsa, md_alg, hash, hash_len, sig, sig_len);
+
+    mbedtls_ecdsa_free(&ecdsa);
+
+    return (ret);
+}
+
+static int eckey_sign_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_ecdsa_context ecdsa;
+
+    mbedtls_ecdsa_init(&ecdsa);
+
+    if ((ret = mbedtls_ecdsa_from_keypair(&ecdsa, ctx)) == 0)
+        ret = ecdsa_sign_wrap(&ecdsa, md_alg, hash, hash_len, sig, sig_size, sig_len, f_rng, p_rng);
+
+    mbedtls_ecdsa_free(&ecdsa);
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_ECP_RESTARTABLE)
+/* Forward declarations */
+static int ecdsa_verify_rs_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len, void* rs_ctx);
+
+static int ecdsa_sign_rs_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, void* rs_ctx);
+
+/*
+ * Restart context for ECDSA operations with ECKEY context
+ *
+ * We need to store an actual ECDSA context, as we need to pass the same to
+ * the underlying ecdsa function, so we can't create it on the fly every time.
+ */
+typedef struct {
+    mbedtls_ecdsa_restart_ctx ecdsa_rs;
+    mbedtls_ecdsa_context ecdsa_ctx;
+} eckey_restart_ctx;
+
+static void* eckey_rs_alloc(void) {
+    eckey_restart_ctx* rs_ctx;
+
+    void* ctx = mbedtls_calloc(1, sizeof(eckey_restart_ctx));
+
+    if (ctx != NULL) {
+        rs_ctx = ctx;
+        mbedtls_ecdsa_restart_init(&rs_ctx->ecdsa_rs);
+        mbedtls_ecdsa_init(&rs_ctx->ecdsa_ctx);
+    }
+
+    return (ctx);
+}
+
+static void eckey_rs_free(void* ctx) {
+    eckey_restart_ctx* rs_ctx;
+
+    if (ctx == NULL)
+        return;
+
+    rs_ctx = ctx;
+    mbedtls_ecdsa_restart_free(&rs_ctx->ecdsa_rs);
+    mbedtls_ecdsa_free(&rs_ctx->ecdsa_ctx);
+
+    mbedtls_free(ctx);
+}
+
+static int eckey_verify_rs_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len, void* rs_ctx) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    eckey_restart_ctx* rs = rs_ctx;
+
+    /* Should never happen */
+    if (rs == NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    /* set up our own sub-context if needed (that is, on first run) */
+    if (rs->ecdsa_ctx.grp.pbits == 0)
+        MBEDTLS_MPI_CHK(mbedtls_ecdsa_from_keypair(&rs->ecdsa_ctx, ctx));
+
+    MBEDTLS_MPI_CHK(
+        ecdsa_verify_rs_wrap(&rs->ecdsa_ctx, md_alg, hash, hash_len, sig, sig_len, &rs->ecdsa_rs));
+
+cleanup:
+    return (ret);
+}
+
+static int eckey_sign_rs_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, void* rs_ctx) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    eckey_restart_ctx* rs = rs_ctx;
+
+    /* Should never happen */
+    if (rs == NULL)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    /* set up our own sub-context if needed (that is, on first run) */
+    if (rs->ecdsa_ctx.grp.pbits == 0)
+        MBEDTLS_MPI_CHK(mbedtls_ecdsa_from_keypair(&rs->ecdsa_ctx, ctx));
+
+    MBEDTLS_MPI_CHK(ecdsa_sign_rs_wrap(&rs->ecdsa_ctx, md_alg, hash, hash_len, sig, sig_size,
+        sig_len, f_rng, p_rng, &rs->ecdsa_rs));
+
+cleanup:
+    return (ret);
+}
+#endif /* MBEDTLS_ECP_RESTARTABLE */
+#endif /* MBEDTLS_ECDSA_C */
+
+static int eckey_check_pair(const void* pub, const void* prv,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    return (mbedtls_ecp_check_pub_priv((const mbedtls_ecp_keypair*)pub,
+        (const mbedtls_ecp_keypair*)prv, f_rng, p_rng));
+}
+
+static void* eckey_alloc_wrap(void) {
+    void* ctx = mbedtls_calloc(1, sizeof(mbedtls_ecp_keypair));
+
+    if (ctx != NULL)
+        mbedtls_ecp_keypair_init(ctx);
+
+    return (ctx);
+}
+
+static void eckey_free_wrap(void* ctx) {
+    mbedtls_ecp_keypair_free((mbedtls_ecp_keypair*)ctx);
+    mbedtls_free(ctx);
+}
+
+static void eckey_debug(const void* ctx, mbedtls_pk_debug_item* items) {
+    items->type = MBEDTLS_PK_DEBUG_ECP;
+    items->name = "eckey.Q";
+    items->value = &(((mbedtls_ecp_keypair*)ctx)->Q);
+}
+
+const mbedtls_pk_info_t mbedtls_eckey_info = {
+    MBEDTLS_PK_ECKEY,
+    "EC",
+    eckey_get_bitlen,
+    eckey_can_do,
+#if defined(MBEDTLS_ECDSA_C)
+    eckey_verify_wrap,
+    eckey_sign_wrap,
+#if defined(MBEDTLS_ECP_RESTARTABLE)
+    eckey_verify_rs_wrap,
+    eckey_sign_rs_wrap,
+#endif
+#else  /* MBEDTLS_ECDSA_C */
+    NULL,
+    NULL,
+#endif /* MBEDTLS_ECDSA_C */
+    NULL,
+    NULL,
+    eckey_check_pair,
+    eckey_alloc_wrap,
+    eckey_free_wrap,
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    eckey_rs_alloc,
+    eckey_rs_free,
+#endif
+    eckey_debug,
+};
+
+/*
+ * EC key restricted to ECDH
+ */
+static int eckeydh_can_do(mbedtls_pk_type_t type) {
+    return (type == MBEDTLS_PK_ECKEY || type == MBEDTLS_PK_ECKEY_DH);
+}
+
+const mbedtls_pk_info_t mbedtls_eckeydh_info = {
+    MBEDTLS_PK_ECKEY_DH, "EC_DH", eckey_get_bitlen, /* Same underlying key structure */
+    eckeydh_can_do, NULL, NULL,
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    NULL, NULL,
+#endif
+    NULL, NULL, eckey_check_pair, eckey_alloc_wrap, /* Same underlying key structure */
+    eckey_free_wrap,                                /* Same underlying key structure */
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    NULL, NULL,
+#endif
+    eckey_debug, /* Same underlying key structure */
+};
+#endif /* MBEDTLS_ECP_C */
+
+#if defined(MBEDTLS_ECDSA_C)
+static int ecdsa_can_do(mbedtls_pk_type_t type) {
+    return (type == MBEDTLS_PK_ECDSA);
+}
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+/*
+ * An ASN.1 encoded signature is a sequence of two ASN.1 integers. Parse one of
+ * those integers and convert it to the fixed-length encoding expected by PSA.
+ */
+static int extract_ecdsa_sig_int(unsigned char** from, const unsigned char* end, unsigned char* to,
+    size_t to_len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t unpadded_len, padding_len;
+
+    if ((ret = mbedtls_asn1_get_tag(from, end, &unpadded_len, MBEDTLS_ASN1_INTEGER)) != 0) {
+        return (ret);
+    }
+
+    while (unpadded_len > 0 && **from == 0x00) {
+        (*from)++;
+        unpadded_len--;
+    }
+
+    if (unpadded_len > to_len || unpadded_len == 0)
+        return (MBEDTLS_ERR_ASN1_LENGTH_MISMATCH);
+
+    padding_len = to_len - unpadded_len;
+    memset(to, 0x00, padding_len);
+    memcpy(to + padding_len, *from, unpadded_len);
+    (*from) += unpadded_len;
+
+    return (0);
+}
+
+/*
+ * Convert a signature from an ASN.1 sequence of two integers
+ * to a raw {r,s} buffer. Note: the provided sig buffer must be at least
+ * twice as big as int_size.
+ */
+static int extract_ecdsa_sig(unsigned char** p, const unsigned char* end, unsigned char* sig,
+    size_t int_size) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t tmp_size;
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, &tmp_size,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0)
+        return (ret);
+
+    /* Extract r */
+    if ((ret = extract_ecdsa_sig_int(p, end, sig, int_size)) != 0)
+        return (ret);
+    /* Extract s */
+    if ((ret = extract_ecdsa_sig_int(p, end, sig + int_size, int_size)) != 0)
+        return (ret);
+
+    return (0);
+}
+
+static int ecdsa_verify_wrap(void* ctx_arg, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len) {
+    mbedtls_ecdsa_context* ctx = ctx_arg;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    psa_key_attributes_t attributes = PSA_KEY_ATTRIBUTES_INIT;
+    psa_key_id_t key_id = 0;
+    psa_status_t status;
+    mbedtls_pk_context key;
+    int key_len;
+    /* see ECP_PUB_DER_MAX_BYTES in pkwrite.c */
+    unsigned char buf[30 + 2 * MBEDTLS_ECP_MAX_BYTES];
+    unsigned char* p;
+    mbedtls_pk_info_t pk_info = mbedtls_eckey_info;
+    psa_algorithm_t psa_sig_md = PSA_ALG_ECDSA_ANY;
+    size_t curve_bits;
+    psa_ecc_family_t curve = mbedtls_ecc_group_to_psa(ctx->grp.id, &curve_bits);
+    const size_t signature_part_size = (ctx->grp.nbits + 7) / 8;
+    ((void)md_alg);
+
+    if (curve == 0)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    /* mbedtls_pk_write_pubkey() expects a full PK context;
+     * re-construct one to make it happy */
+    key.pk_info = &pk_info;
+    key.pk_ctx = ctx;
+    p = buf + sizeof(buf);
+    key_len = mbedtls_pk_write_pubkey(&p, buf, &key);
+    if (key_len <= 0)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+
+    psa_set_key_type(&attributes, PSA_KEY_TYPE_ECC_PUBLIC_KEY(curve));
+    psa_set_key_usage_flags(&attributes, PSA_KEY_USAGE_VERIFY_HASH);
+    psa_set_key_algorithm(&attributes, psa_sig_md);
+
+    status = psa_import_key(&attributes, buf + sizeof(buf) - key_len, key_len, &key_id);
+    if (status != PSA_SUCCESS) {
+        ret = mbedtls_psa_err_translate_pk(status);
+        goto cleanup;
+    }
+
+    /* We don't need the exported key anymore and can
+     * reuse its buffer for signature extraction. */
+    if (2 * signature_part_size > sizeof(buf)) {
+        ret = MBEDTLS_ERR_PK_BAD_INPUT_DATA;
+        goto cleanup;
+    }
+
+    p = (unsigned char*)sig;
+    if ((ret = extract_ecdsa_sig(&p, sig + sig_len, buf, signature_part_size)) != 0) {
+        goto cleanup;
+    }
+
+    if (psa_verify_hash(key_id, psa_sig_md, hash, hash_len, buf, 2 * signature_part_size) !=
+        PSA_SUCCESS) {
+        ret = MBEDTLS_ERR_ECP_VERIFY_FAILED;
+        goto cleanup;
+    }
+
+    if (p != sig + sig_len) {
+        ret = MBEDTLS_ERR_PK_SIG_LEN_MISMATCH;
+        goto cleanup;
+    }
+    ret = 0;
+
+cleanup:
+    psa_destroy_key(key_id);
+    return (ret);
+}
+#else  /* MBEDTLS_USE_PSA_CRYPTO */
+static int ecdsa_verify_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    ((void)md_alg);
+
+    ret = mbedtls_ecdsa_read_signature((mbedtls_ecdsa_context*)ctx, hash, hash_len, sig, sig_len);
+
+    if (ret == MBEDTLS_ERR_ECP_SIG_LEN_MISMATCH)
+        return (MBEDTLS_ERR_PK_SIG_LEN_MISMATCH);
+
+    return (ret);
+}
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+static int ecdsa_sign_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    return (mbedtls_ecdsa_write_signature((mbedtls_ecdsa_context*)ctx, md_alg, hash, hash_len, sig,
+        sig_size, sig_len, f_rng, p_rng));
+}
+
+#if defined(MBEDTLS_ECP_RESTARTABLE)
+static int ecdsa_verify_rs_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, const unsigned char* sig, size_t sig_len, void* rs_ctx) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    ((void)md_alg);
+
+    ret = mbedtls_ecdsa_read_signature_restartable((mbedtls_ecdsa_context*)ctx, hash, hash_len, sig,
+        sig_len, (mbedtls_ecdsa_restart_ctx*)rs_ctx);
+
+    if (ret == MBEDTLS_ERR_ECP_SIG_LEN_MISMATCH)
+        return (MBEDTLS_ERR_PK_SIG_LEN_MISMATCH);
+
+    return (ret);
+}
+
+static int ecdsa_sign_rs_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, void* rs_ctx) {
+    return (mbedtls_ecdsa_write_signature_restartable((mbedtls_ecdsa_context*)ctx, md_alg, hash,
+        hash_len, sig, sig_size, sig_len, f_rng, p_rng, (mbedtls_ecdsa_restart_ctx*)rs_ctx));
+}
+#endif /* MBEDTLS_ECP_RESTARTABLE */
+
+static void* ecdsa_alloc_wrap(void) {
+    void* ctx = mbedtls_calloc(1, sizeof(mbedtls_ecdsa_context));
+
+    if (ctx != NULL)
+        mbedtls_ecdsa_init((mbedtls_ecdsa_context*)ctx);
+
+    return (ctx);
+}
+
+static void ecdsa_free_wrap(void* ctx) {
+    mbedtls_ecdsa_free((mbedtls_ecdsa_context*)ctx);
+    mbedtls_free(ctx);
+}
+
+#if defined(MBEDTLS_ECP_RESTARTABLE)
+static void* ecdsa_rs_alloc(void) {
+    void* ctx = mbedtls_calloc(1, sizeof(mbedtls_ecdsa_restart_ctx));
+
+    if (ctx != NULL)
+        mbedtls_ecdsa_restart_init(ctx);
+
+    return (ctx);
+}
+
+static void ecdsa_rs_free(void* ctx) {
+    mbedtls_ecdsa_restart_free(ctx);
+    mbedtls_free(ctx);
+}
+#endif /* MBEDTLS_ECP_RESTARTABLE */
+
+const mbedtls_pk_info_t mbedtls_ecdsa_info = {
+    MBEDTLS_PK_ECDSA, "ECDSA", eckey_get_bitlen, /* Compatible key structures */
+    ecdsa_can_do, ecdsa_verify_wrap, ecdsa_sign_wrap,
+#if defined(MBEDTLS_ECP_RESTARTABLE)
+    ecdsa_verify_rs_wrap, ecdsa_sign_rs_wrap,
+#endif
+    NULL, NULL, eckey_check_pair, /* Compatible key structures */
+    ecdsa_alloc_wrap, ecdsa_free_wrap,
+#if defined(MBEDTLS_ECP_RESTARTABLE)
+    ecdsa_rs_alloc, ecdsa_rs_free,
+#endif
+    eckey_debug, /* Compatible key structures */
+};
+#endif /* MBEDTLS_ECDSA_C */
+
+#if defined(MBEDTLS_PK_RSA_ALT_SUPPORT)
+/*
+ * Support for alternative RSA-private implementations
+ */
+
+static int rsa_alt_can_do(mbedtls_pk_type_t type) {
+    return (type == MBEDTLS_PK_RSA);
+}
+
+static size_t rsa_alt_get_bitlen(const void* ctx) {
+    const mbedtls_rsa_alt_context* rsa_alt = (const mbedtls_rsa_alt_context*)ctx;
+
+    return (8 * rsa_alt->key_len_func(rsa_alt->key));
+}
+
+static int rsa_alt_sign_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    mbedtls_rsa_alt_context* rsa_alt = (mbedtls_rsa_alt_context*)ctx;
+
+#if SIZE_MAX > UINT_MAX
+    if (UINT_MAX < hash_len)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+#endif /* SIZE_MAX > UINT_MAX */
+
+    *sig_len = rsa_alt->key_len_func(rsa_alt->key);
+    if (*sig_len > MBEDTLS_PK_SIGNATURE_MAX_SIZE)
+        return (MBEDTLS_ERR_PK_BAD_INPUT_DATA);
+    if (*sig_len > sig_size)
+        return (MBEDTLS_ERR_PK_BUFFER_TOO_SMALL);
+
+    return (
+        rsa_alt->sign_func(rsa_alt->key, f_rng, p_rng, md_alg, (unsigned int)hash_len, hash, sig));
+}
+
+static int rsa_alt_decrypt_wrap(void* ctx, const unsigned char* input, size_t ilen,
+    unsigned char* output, size_t* olen, size_t osize, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng) {
+    mbedtls_rsa_alt_context* rsa_alt = (mbedtls_rsa_alt_context*)ctx;
+
+    ((void)f_rng);
+    ((void)p_rng);
+
+    if (ilen != rsa_alt->key_len_func(rsa_alt->key))
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    return (rsa_alt->decrypt_func(rsa_alt->key, olen, input, output, osize));
+}
+
+#if defined(MBEDTLS_RSA_C)
+static int rsa_alt_check_pair(const void* pub, const void* prv,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    unsigned char sig[MBEDTLS_MPI_MAX_SIZE];
+    unsigned char hash[32];
+    size_t sig_len = 0;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    if (rsa_alt_get_bitlen(prv) != rsa_get_bitlen(pub))
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+
+    memset(hash, 0x2a, sizeof(hash));
+
+    if ((ret = rsa_alt_sign_wrap((void*)prv, MBEDTLS_MD_NONE, hash, sizeof(hash), sig, sizeof(sig),
+             &sig_len, f_rng, p_rng)) != 0) {
+        return (ret);
+    }
+
+    if (rsa_verify_wrap((void*)pub, MBEDTLS_MD_NONE, hash, sizeof(hash), sig, sig_len) != 0) {
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+    }
+
+    return (0);
+}
+#endif /* MBEDTLS_RSA_C */
+
+static void* rsa_alt_alloc_wrap(void) {
+    void* ctx = mbedtls_calloc(1, sizeof(mbedtls_rsa_alt_context));
+
+    if (ctx != NULL)
+        memset(ctx, 0, sizeof(mbedtls_rsa_alt_context));
+
+    return (ctx);
+}
+
+static void rsa_alt_free_wrap(void* ctx) {
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_rsa_alt_context));
+    mbedtls_free(ctx);
+}
+
+const mbedtls_pk_info_t mbedtls_rsa_alt_info = {
+    MBEDTLS_PK_RSA_ALT,
+    "RSA-alt",
+    rsa_alt_get_bitlen,
+    rsa_alt_can_do,
+    NULL,
+    rsa_alt_sign_wrap,
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    NULL,
+    NULL,
+#endif
+    rsa_alt_decrypt_wrap,
+    NULL,
+#if defined(MBEDTLS_RSA_C)
+    rsa_alt_check_pair,
+#else
+    NULL,
+#endif
+    rsa_alt_alloc_wrap,
+    rsa_alt_free_wrap,
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    NULL,
+    NULL,
+#endif
+    NULL,
+};
+
+#endif /* MBEDTLS_PK_RSA_ALT_SUPPORT */
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+
+static void* pk_opaque_alloc_wrap(void) {
+    void* ctx = mbedtls_calloc(1, sizeof(psa_key_id_t));
+
+    /* no _init() function to call, an calloc() already zeroized */
+
+    return (ctx);
+}
+
+static void pk_opaque_free_wrap(void* ctx) {
+    mbedtls_platform_zeroize(ctx, sizeof(psa_key_id_t));
+    mbedtls_free(ctx);
+}
+
+static size_t pk_opaque_get_bitlen(const void* ctx) {
+    const psa_key_id_t* key = (const psa_key_id_t*)ctx;
+    size_t bits;
+    psa_key_attributes_t attributes = PSA_KEY_ATTRIBUTES_INIT;
+
+    if (PSA_SUCCESS != psa_get_key_attributes(*key, &attributes))
+        return (0);
+
+    bits = psa_get_key_bits(&attributes);
+    psa_reset_key_attributes(&attributes);
+    return (bits);
+}
+
+static int pk_opaque_can_do(mbedtls_pk_type_t type) {
+    /* For now opaque PSA keys can only wrap ECC keypairs,
+     * as checked by setup_psa().
+     * Also, ECKEY_DH does not really make sense with the current API. */
+    return (type == MBEDTLS_PK_ECKEY || type == MBEDTLS_PK_ECDSA);
+}
+
+#if defined(MBEDTLS_ECDSA_C)
+
+/*
+ * Simultaneously convert and move raw MPI from the beginning of a buffer
+ * to an ASN.1 MPI at the end of the buffer.
+ * See also mbedtls_asn1_write_mpi().
+ *
+ * p: pointer to the end of the output buffer
+ * start: start of the output buffer, and also of the mpi to write at the end
+ * n_len: length of the mpi to read from start
+ */
+static int asn1_write_mpibuf(unsigned char** p, unsigned char* start, size_t n_len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t len = 0;
+
+    if ((size_t)(*p - start) < n_len)
+        return (MBEDTLS_ERR_ASN1_BUF_TOO_SMALL);
+
+    len = n_len;
+    *p -= len;
+    memmove(*p, start, len);
+
+    /* ASN.1 DER encoding requires minimal length, so skip leading 0s.
+     * Neither r nor s should be 0, but as a failsafe measure, still detect
+     * that rather than overflowing the buffer in case of a PSA error. */
+    while (len > 0 && **p == 0x00) {
+        ++(*p);
+        --len;
+    }
+
+    /* this is only reached if the signature was invalid */
+    if (len == 0)
+        return (MBEDTLS_ERR_PLATFORM_HW_ACCEL_FAILED);
+
+    /* if the msb is 1, ASN.1 requires that we prepend a 0.
+     * Neither r nor s can be 0, so we can assume len > 0 at all times. */
+    if (**p & 0x80) {
+        if (*p - start < 1)
+            return (MBEDTLS_ERR_ASN1_BUF_TOO_SMALL);
+
+        *--(*p) = 0x00;
+        len += 1;
+    }
+
+    MBEDTLS_ASN1_CHK_ADD(len, mbedtls_asn1_write_len(p, start, len));
+    MBEDTLS_ASN1_CHK_ADD(len, mbedtls_asn1_write_tag(p, start, MBEDTLS_ASN1_INTEGER));
+
+    return ((int)len);
+}
+
+/* Transcode signature from PSA format to ASN.1 sequence.
+ * See ecdsa_signature_to_asn1 in ecdsa.c, but with byte buffers instead of
+ * MPIs, and in-place.
+ *
+ * [in/out] sig: the signature pre- and post-transcoding
+ * [in/out] sig_len: signature length pre- and post-transcoding
+ * [int] buf_len: the available size the in/out buffer
+ */
+static int pk_ecdsa_sig_asn1_from_psa(unsigned char* sig, size_t* sig_len, size_t buf_len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t len = 0;
+    const size_t rs_len = *sig_len / 2;
+    unsigned char* p = sig + buf_len;
+
+    MBEDTLS_ASN1_CHK_ADD(len, asn1_write_mpibuf(&p, sig + rs_len, rs_len));
+    MBEDTLS_ASN1_CHK_ADD(len, asn1_write_mpibuf(&p, sig, rs_len));
+
+    MBEDTLS_ASN1_CHK_ADD(len, mbedtls_asn1_write_len(&p, sig, len));
+    MBEDTLS_ASN1_CHK_ADD(len,
+        mbedtls_asn1_write_tag(&p, sig, MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE));
+
+    memmove(sig, p, len);
+    *sig_len = len;
+
+    return (0);
+}
+
+#endif /* MBEDTLS_ECDSA_C */
+
+static int pk_opaque_sign_wrap(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+    size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+#if !defined(MBEDTLS_ECDSA_C)
+    ((void)ctx);
+    ((void)md_alg);
+    ((void)hash);
+    ((void)hash_len);
+    ((void)sig);
+    ((void)sig_size);
+    ((void)sig_len);
+    ((void)f_rng);
+    ((void)p_rng);
+    return (MBEDTLS_ERR_PK_FEATURE_UNAVAILABLE);
+#else  /* !MBEDTLS_ECDSA_C */
+    const psa_key_id_t* key = (const psa_key_id_t*)ctx;
+    psa_algorithm_t alg = PSA_ALG_ECDSA(mbedtls_psa_translate_md(md_alg));
+    psa_status_t status;
+
+    /* PSA has its own RNG */
+    (void)f_rng;
+    (void)p_rng;
+
+    /* make the signature */
+    status = psa_sign_hash(*key, alg, hash, hash_len, sig, sig_size, sig_len);
+    if (status != PSA_SUCCESS)
+        return (mbedtls_psa_err_translate_pk(status));
+
+    /* transcode it to ASN.1 sequence */
+    return (pk_ecdsa_sig_asn1_from_psa(sig, sig_len, sig_size));
+#endif /* !MBEDTLS_ECDSA_C */
+}
+
+const mbedtls_pk_info_t mbedtls_pk_opaque_info = {
+    MBEDTLS_PK_OPAQUE, "Opaque", pk_opaque_get_bitlen, pk_opaque_can_do,
+    NULL, /* verify - will be done later */
+    pk_opaque_sign_wrap,
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    NULL, /* restartable verify - not relevant */
+    NULL, /* restartable sign - not relevant */
+#endif
+    NULL, /* decrypt - will be done later */
+    NULL, /* encrypt - will be done later */
+    NULL, /* check_pair - could be done later or left NULL */
+    pk_opaque_alloc_wrap, pk_opaque_free_wrap,
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    NULL, /* restart alloc - not relevant */
+    NULL, /* restart free - not relevant */
+#endif
+    NULL, /* debug - could be done later, or even left NULL */
+};
+
+#endif /* MBEDTLS_USE_PSA_CRYPTO */
+
+#endif /* MBEDTLS_PK_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pk_wrap.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pk_wrap.h
new file mode 100644
index 0000000000..9e9b27d199
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pk_wrap.h
@@ -0,0 +1,122 @@
+/**
+ * \file pk_wrap.h
+ *
+ * \brief Public Key abstraction layer: wrapper functions
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#ifndef MBEDTLS_PK_WRAP_H
+#define MBEDTLS_PK_WRAP_H
+
+#include "mbedtls/build_info.h"
+#include "mbedtls/pk.h"
+
+struct mbedtls_pk_info_t {
+    /** Public key type */
+    mbedtls_pk_type_t type;
+
+    /** Type name */
+    const char* name;
+
+    /** Get key size in bits */
+    size_t (*get_bitlen)(const void*);
+
+    /** Tell if the context implements this type (e.g. ECKEY can do ECDSA) */
+    int (*can_do)(mbedtls_pk_type_t type);
+
+    /** Verify signature */
+    int (*verify_func)(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+        size_t hash_len, const unsigned char* sig, size_t sig_len);
+
+    /** Make signature */
+    int (*sign_func)(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+        size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+        int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    /** Verify signature (restartable) */
+    int (*verify_rs_func)(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+        size_t hash_len, const unsigned char* sig, size_t sig_len, void* rs_ctx);
+
+    /** Make signature (restartable) */
+    int (*sign_rs_func)(void* ctx, mbedtls_md_type_t md_alg, const unsigned char* hash,
+        size_t hash_len, unsigned char* sig, size_t sig_size, size_t* sig_len,
+        int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, void* rs_ctx);
+#endif /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+
+    /** Decrypt message */
+    int (*decrypt_func)(void* ctx, const unsigned char* input, size_t ilen, unsigned char* output,
+        size_t* olen, size_t osize, int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+    /** Encrypt message */
+    int (*encrypt_func)(void* ctx, const unsigned char* input, size_t ilen, unsigned char* output,
+        size_t* olen, size_t osize, int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+    /** Check public-private key pair */
+    int (*check_pair_func)(const void* pub, const void* prv,
+        int (*f_rng)(void*, unsigned char*, size_t), void* p_rng);
+
+    /** Allocate a new context */
+    void* (*ctx_alloc_func)(void);
+
+    /** Free the given context */
+    void (*ctx_free_func)(void* ctx);
+
+#if defined(MBEDTLS_ECDSA_C) && defined(MBEDTLS_ECP_RESTARTABLE)
+    /** Allocate the restart context */
+    void* (*rs_alloc_func)(void);
+
+    /** Free the restart context */
+    void (*rs_free_func)(void* rs_ctx);
+#endif /* MBEDTLS_ECDSA_C && MBEDTLS_ECP_RESTARTABLE */
+
+    /** Interface with the debug module */
+    void (*debug_func)(const void* ctx, mbedtls_pk_debug_item* items);
+};
+#if defined(MBEDTLS_PK_RSA_ALT_SUPPORT)
+/* Container for RSA-alt */
+typedef struct {
+    void* key;
+    mbedtls_pk_rsa_alt_decrypt_func decrypt_func;
+    mbedtls_pk_rsa_alt_sign_func sign_func;
+    mbedtls_pk_rsa_alt_key_len_func key_len_func;
+} mbedtls_rsa_alt_context;
+#endif
+
+#if defined(MBEDTLS_RSA_C)
+extern const mbedtls_pk_info_t mbedtls_rsa_info;
+#endif
+
+#if defined(MBEDTLS_ECP_C)
+extern const mbedtls_pk_info_t mbedtls_eckey_info;
+extern const mbedtls_pk_info_t mbedtls_eckeydh_info;
+#endif
+
+#if defined(MBEDTLS_ECDSA_C)
+extern const mbedtls_pk_info_t mbedtls_ecdsa_info;
+#endif
+
+#if defined(MBEDTLS_PK_RSA_ALT_SUPPORT)
+extern const mbedtls_pk_info_t mbedtls_rsa_alt_info;
+#endif
+
+#if defined(MBEDTLS_USE_PSA_CRYPTO)
+extern const mbedtls_pk_info_t mbedtls_pk_opaque_info;
+#endif
+
+#endif /* MBEDTLS_PK_WRAP_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pkparse.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pkparse.cpp
new file mode 100644
index 0000000000..055d693cd2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/pkparse.cpp
@@ -0,0 +1,1375 @@
+/*
+ *  Public Key layer for parsing key files and structures
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_PK_PARSE_C)
+
+#include <string.h>
+
+#include "mbedtls/asn1.h"
+#include "mbedtls/error.h"
+#include "mbedtls/oid.h"
+#include "mbedtls/pk.h"
+#include "mbedtls/platform_util.h"
+
+#if defined(MBEDTLS_RSA_C)
+#include "mbedtls/rsa.h"
+#endif
+#if defined(MBEDTLS_ECP_C)
+#include "mbedtls/ecp.h"
+#endif
+#if defined(MBEDTLS_ECDSA_C)
+#include "mbedtls/ecdsa.h"
+#endif
+#if defined(MBEDTLS_PEM_PARSE_C)
+#include "mbedtls/pem.h"
+#endif
+#if defined(MBEDTLS_PKCS5_C)
+#include "mbedtls/pkcs5.h"
+#endif
+#if defined(MBEDTLS_PKCS12_C)
+#include "mbedtls/pkcs12.h"
+#endif
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdlib.h>
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif
+
+/* Parameter validation macros based on platform_util.h */
+#define PK_VALIDATE_RET(cond) MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_PK_BAD_INPUT_DATA)
+#define PK_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+#if defined(MBEDTLS_FS_IO)
+/*
+ * Load all data from a file into a given buffer.
+ *
+ * The file is expected to contain either PEM or DER encoded data.
+ * A terminating null byte is always appended. It is included in the announced
+ * length only if the data looks like it is PEM encoded.
+ */
+int mbedtls_pk_load_file(const char* path, unsigned char** buf, size_t* n) {
+    FILE* f;
+    long size;
+
+    PK_VALIDATE_RET(path != NULL);
+    PK_VALIDATE_RET(buf != NULL);
+    PK_VALIDATE_RET(n != NULL);
+
+    if ((f = fopen(path, "rb")) == NULL)
+        return (MBEDTLS_ERR_PK_FILE_IO_ERROR);
+
+    fseek(f, 0, SEEK_END);
+    if ((size = ftell(f)) == -1) {
+        fclose(f);
+        return (MBEDTLS_ERR_PK_FILE_IO_ERROR);
+    }
+    fseek(f, 0, SEEK_SET);
+
+    *n = (size_t)size;
+
+    if (*n + 1 == 0 || (*buf = mbedtls_calloc(1, *n + 1)) == NULL) {
+        fclose(f);
+        return (MBEDTLS_ERR_PK_ALLOC_FAILED);
+    }
+
+    if (fread(*buf, 1, *n, f) != *n) {
+        fclose(f);
+
+        mbedtls_platform_zeroize(*buf, *n);
+        mbedtls_free(*buf);
+
+        return (MBEDTLS_ERR_PK_FILE_IO_ERROR);
+    }
+
+    fclose(f);
+
+    (*buf)[*n] = '\0';
+
+    if (strstr((const char*)*buf, "-----BEGIN ") != NULL)
+        ++*n;
+
+    return (0);
+}
+
+/*
+ * Load and parse a private key
+ */
+int mbedtls_pk_parse_keyfile(mbedtls_pk_context* ctx, const char* path, const char* pwd,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t n;
+    unsigned char* buf;
+
+    PK_VALIDATE_RET(ctx != NULL);
+    PK_VALIDATE_RET(path != NULL);
+
+    if ((ret = mbedtls_pk_load_file(path, &buf, &n)) != 0)
+        return (ret);
+
+    if (pwd == NULL)
+        ret = mbedtls_pk_parse_key(ctx, buf, n, NULL, 0, f_rng, p_rng);
+    else
+        ret =
+            mbedtls_pk_parse_key(ctx, buf, n, (const unsigned char*)pwd, strlen(pwd), f_rng, p_rng);
+
+    mbedtls_platform_zeroize(buf, n);
+    mbedtls_free(buf);
+
+    return (ret);
+}
+
+/*
+ * Load and parse a public key
+ */
+int mbedtls_pk_parse_public_keyfile(mbedtls_pk_context* ctx, const char* path) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t n;
+    unsigned char* buf;
+
+    PK_VALIDATE_RET(ctx != NULL);
+    PK_VALIDATE_RET(path != NULL);
+
+    if ((ret = mbedtls_pk_load_file(path, &buf, &n)) != 0)
+        return (ret);
+
+    ret = mbedtls_pk_parse_public_key(ctx, buf, n);
+
+    mbedtls_platform_zeroize(buf, n);
+    mbedtls_free(buf);
+
+    return (ret);
+}
+#endif /* MBEDTLS_FS_IO */
+
+#if defined(MBEDTLS_ECP_C)
+/* Minimally parse an ECParameters buffer to and mbedtls_asn1_buf
+ *
+ * ECParameters ::= CHOICE {
+ *   namedCurve         OBJECT IDENTIFIER
+ *   specifiedCurve     SpecifiedECDomain -- = SEQUENCE { ... }
+ *   -- implicitCurve   NULL
+ * }
+ */
+static int pk_get_ecparams(unsigned char** p, const unsigned char* end, mbedtls_asn1_buf* params) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    if (end - *p < 1)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, MBEDTLS_ERR_ASN1_OUT_OF_DATA));
+
+    /* Tag may be either OID or SEQUENCE */
+    params->tag = **p;
+    if (params->tag != MBEDTLS_ASN1_OID
+#if defined(MBEDTLS_PK_PARSE_EC_EXTENDED)
+        && params->tag != (MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)
+#endif
+    ) {
+        return (
+            MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, MBEDTLS_ERR_ASN1_UNEXPECTED_TAG));
+    }
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, &params->len, params->tag)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    params->p = *p;
+    *p += params->len;
+
+    if (*p != end)
+        return (
+            MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, MBEDTLS_ERR_ASN1_LENGTH_MISMATCH));
+
+    return (0);
+}
+
+#if defined(MBEDTLS_PK_PARSE_EC_EXTENDED)
+/*
+ * Parse a SpecifiedECDomain (SEC 1 C.2) and (mostly) fill the group with it.
+ * WARNING: the resulting group should only be used with
+ * pk_group_id_from_specified(), since its base point may not be set correctly
+ * if it was encoded compressed.
+ *
+ *  SpecifiedECDomain ::= SEQUENCE {
+ *      version SpecifiedECDomainVersion(ecdpVer1 | ecdpVer2 | ecdpVer3, ...),
+ *      fieldID FieldID {{FieldTypes}},
+ *      curve Curve,
+ *      base ECPoint,
+ *      order INTEGER,
+ *      cofactor INTEGER OPTIONAL,
+ *      hash HashAlgorithm OPTIONAL,
+ *      ...
+ *  }
+ *
+ * We only support prime-field as field type, and ignore hash and cofactor.
+ */
+static int pk_group_from_specified(const mbedtls_asn1_buf* params, mbedtls_ecp_group* grp) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char* p = params->p;
+    const unsigned char* const end = params->p + params->len;
+    const unsigned char *end_field, *end_curve;
+    size_t len;
+    int ver;
+
+    /* SpecifiedECDomainVersion ::= INTEGER { 1, 2, 3 } */
+    if ((ret = mbedtls_asn1_get_int(&p, end, &ver)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    if (ver < 1 || ver > 3)
+        return (MBEDTLS_ERR_PK_KEY_INVALID_FORMAT);
+
+    /*
+     * FieldID { FIELD-ID:IOSet } ::= SEQUENCE { -- Finite field
+     *       fieldType FIELD-ID.&id({IOSet}),
+     *       parameters FIELD-ID.&Type({IOSet}{@fieldType})
+     * }
+     */
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0)
+        return (ret);
+
+    end_field = p + len;
+
+    /*
+     * FIELD-ID ::= TYPE-IDENTIFIER
+     * FieldTypes FIELD-ID ::= {
+     *       { Prime-p IDENTIFIED BY prime-field } |
+     *       { Characteristic-two IDENTIFIED BY characteristic-two-field }
+     * }
+     * prime-field OBJECT IDENTIFIER ::= { id-fieldType 1 }
+     */
+    if ((ret = mbedtls_asn1_get_tag(&p, end_field, &len, MBEDTLS_ASN1_OID)) != 0)
+        return (ret);
+
+    if (len != MBEDTLS_OID_SIZE(MBEDTLS_OID_ANSI_X9_62_PRIME_FIELD) ||
+        memcmp(p, MBEDTLS_OID_ANSI_X9_62_PRIME_FIELD, len) != 0) {
+        return (MBEDTLS_ERR_PK_FEATURE_UNAVAILABLE);
+    }
+
+    p += len;
+
+    /* Prime-p ::= INTEGER -- Field of size p. */
+    if ((ret = mbedtls_asn1_get_mpi(&p, end_field, &grp->P)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    grp->pbits = mbedtls_mpi_bitlen(&grp->P);
+
+    if (p != end_field)
+        return (
+            MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, MBEDTLS_ERR_ASN1_LENGTH_MISMATCH));
+
+    /*
+     * Curve ::= SEQUENCE {
+     *       a FieldElement,
+     *       b FieldElement,
+     *       seed BIT STRING OPTIONAL
+     *       -- Shall be present if used in SpecifiedECDomain
+     *       -- with version equal to ecdpVer2 or ecdpVer3
+     * }
+     */
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0)
+        return (ret);
+
+    end_curve = p + len;
+
+    /*
+     * FieldElement ::= OCTET STRING
+     * containing an integer in the case of a prime field
+     */
+    if ((ret = mbedtls_asn1_get_tag(&p, end_curve, &len, MBEDTLS_ASN1_OCTET_STRING)) != 0 ||
+        (ret = mbedtls_mpi_read_binary(&grp->A, p, len)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    p += len;
+
+    if ((ret = mbedtls_asn1_get_tag(&p, end_curve, &len, MBEDTLS_ASN1_OCTET_STRING)) != 0 ||
+        (ret = mbedtls_mpi_read_binary(&grp->B, p, len)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    p += len;
+
+    /* Ignore seed BIT STRING OPTIONAL */
+    if ((ret = mbedtls_asn1_get_tag(&p, end_curve, &len, MBEDTLS_ASN1_BIT_STRING)) == 0)
+        p += len;
+
+    if (p != end_curve)
+        return (
+            MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, MBEDTLS_ERR_ASN1_LENGTH_MISMATCH));
+
+    /*
+     * ECPoint ::= OCTET STRING
+     */
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len, MBEDTLS_ASN1_OCTET_STRING)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    if ((ret = mbedtls_ecp_point_read_binary(grp, &grp->G, (const unsigned char*)p, len)) != 0) {
+        /*
+         * If we can't read the point because it's compressed, cheat by
+         * reading only the X coordinate and the parity bit of Y.
+         */
+        if (ret != MBEDTLS_ERR_ECP_FEATURE_UNAVAILABLE || (p[0] != 0x02 && p[0] != 0x03) ||
+            len != mbedtls_mpi_size(&grp->P) + 1 ||
+            mbedtls_mpi_read_binary(&grp->G.X, p + 1, len - 1) != 0 ||
+            mbedtls_mpi_lset(&grp->G.Y, p[0] - 2) != 0 || mbedtls_mpi_lset(&grp->G.Z, 1) != 0) {
+            return (MBEDTLS_ERR_PK_KEY_INVALID_FORMAT);
+        }
+    }
+
+    p += len;
+
+    /*
+     * order INTEGER
+     */
+    if ((ret = mbedtls_asn1_get_mpi(&p, end, &grp->N)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    grp->nbits = mbedtls_mpi_bitlen(&grp->N);
+
+    /*
+     * Allow optional elements by purposefully not enforcing p == end here.
+     */
+
+    return (0);
+}
+
+/*
+ * Find the group id associated with an (almost filled) group as generated by
+ * pk_group_from_specified(), or return an error if unknown.
+ */
+static int pk_group_id_from_group(const mbedtls_ecp_group* grp, mbedtls_ecp_group_id* grp_id) {
+    int ret = 0;
+    mbedtls_ecp_group ref;
+    const mbedtls_ecp_group_id* id;
+
+    mbedtls_ecp_group_init(&ref);
+
+    for (id = mbedtls_ecp_grp_id_list(); *id != MBEDTLS_ECP_DP_NONE; id++) {
+        /* Load the group associated to that id */
+        mbedtls_ecp_group_free(&ref);
+        MBEDTLS_MPI_CHK(mbedtls_ecp_group_load(&ref, *id));
+
+        /* Compare to the group we were given, starting with easy tests */
+        if (grp->pbits == ref.pbits && grp->nbits == ref.nbits &&
+            mbedtls_mpi_cmp_mpi(&grp->P, &ref.P) == 0 &&
+            mbedtls_mpi_cmp_mpi(&grp->A, &ref.A) == 0 &&
+            mbedtls_mpi_cmp_mpi(&grp->B, &ref.B) == 0 &&
+            mbedtls_mpi_cmp_mpi(&grp->N, &ref.N) == 0 &&
+            mbedtls_mpi_cmp_mpi(&grp->G.X, &ref.G.X) == 0 &&
+            mbedtls_mpi_cmp_mpi(&grp->G.Z, &ref.G.Z) == 0 &&
+            /* For Y we may only know the parity bit, so compare only that */
+            mbedtls_mpi_get_bit(&grp->G.Y, 0) == mbedtls_mpi_get_bit(&ref.G.Y, 0)) {
+            break;
+        }
+    }
+
+cleanup:
+    mbedtls_ecp_group_free(&ref);
+
+    *grp_id = *id;
+
+    if (ret == 0 && *id == MBEDTLS_ECP_DP_NONE)
+        ret = MBEDTLS_ERR_ECP_FEATURE_UNAVAILABLE;
+
+    return (ret);
+}
+
+/*
+ * Parse a SpecifiedECDomain (SEC 1 C.2) and find the associated group ID
+ */
+static int pk_group_id_from_specified(const mbedtls_asn1_buf* params,
+    mbedtls_ecp_group_id* grp_id) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_ecp_group grp;
+
+    mbedtls_ecp_group_init(&grp);
+
+    if ((ret = pk_group_from_specified(params, &grp)) != 0)
+        goto cleanup;
+
+    ret = pk_group_id_from_group(&grp, grp_id);
+
+cleanup:
+    mbedtls_ecp_group_free(&grp);
+
+    return (ret);
+}
+#endif /* MBEDTLS_PK_PARSE_EC_EXTENDED */
+
+/*
+ * Use EC parameters to initialise an EC group
+ *
+ * ECParameters ::= CHOICE {
+ *   namedCurve         OBJECT IDENTIFIER
+ *   specifiedCurve     SpecifiedECDomain -- = SEQUENCE { ... }
+ *   -- implicitCurve   NULL
+ */
+static int pk_use_ecparams(const mbedtls_asn1_buf* params, mbedtls_ecp_group* grp) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_ecp_group_id grp_id;
+
+    if (params->tag == MBEDTLS_ASN1_OID) {
+        if (mbedtls_oid_get_ec_grp(params, &grp_id) != 0)
+            return (MBEDTLS_ERR_PK_UNKNOWN_NAMED_CURVE);
+    } else {
+#if defined(MBEDTLS_PK_PARSE_EC_EXTENDED)
+        if ((ret = pk_group_id_from_specified(params, &grp_id)) != 0)
+            return (ret);
+#else
+        return (MBEDTLS_ERR_PK_KEY_INVALID_FORMAT);
+#endif
+    }
+
+    /*
+     * grp may already be initilialized; if so, make sure IDs match
+     */
+    if (grp->id != MBEDTLS_ECP_DP_NONE && grp->id != grp_id)
+        return (MBEDTLS_ERR_PK_KEY_INVALID_FORMAT);
+
+    if ((ret = mbedtls_ecp_group_load(grp, grp_id)) != 0)
+        return (ret);
+
+    return (0);
+}
+
+/*
+ * EC public key is an EC point
+ *
+ * The caller is responsible for clearing the structure upon failure if
+ * desired. Take care to pass along the possible ECP_FEATURE_UNAVAILABLE
+ * return code of mbedtls_ecp_point_read_binary() and leave p in a usable state.
+ */
+static int pk_get_ecpubkey(unsigned char** p, const unsigned char* end, mbedtls_ecp_keypair* key) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+
+    if ((ret = mbedtls_ecp_point_read_binary(&key->grp, &key->Q, (const unsigned char*)*p,
+             end - *p)) == 0) {
+        ret = mbedtls_ecp_check_pubkey(&key->grp, &key->Q);
+    }
+
+    /*
+     * We know mbedtls_ecp_point_read_binary consumed all bytes or failed
+     */
+    *p = (unsigned char*)end;
+
+    return (ret);
+}
+#endif /* MBEDTLS_ECP_C */
+
+#if defined(MBEDTLS_RSA_C)
+/*
+ *  RSAPublicKey ::= SEQUENCE {
+ *      modulus           INTEGER,  -- n
+ *      publicExponent    INTEGER   -- e
+ *  }
+ */
+static int pk_get_rsapubkey(unsigned char** p, const unsigned char* end, mbedtls_rsa_context* rsa) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t len;
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_PUBKEY, ret));
+
+    if (*p + len != end)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_PUBKEY, MBEDTLS_ERR_ASN1_LENGTH_MISMATCH));
+
+    /* Import N */
+    if ((ret = mbedtls_asn1_get_tag(p, end, &len, MBEDTLS_ASN1_INTEGER)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_PUBKEY, ret));
+
+    if ((ret = mbedtls_rsa_import_raw(rsa, *p, len, NULL, 0, NULL, 0, NULL, 0, NULL, 0)) != 0)
+        return (MBEDTLS_ERR_PK_INVALID_PUBKEY);
+
+    *p += len;
+
+    /* Import E */
+    if ((ret = mbedtls_asn1_get_tag(p, end, &len, MBEDTLS_ASN1_INTEGER)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_PUBKEY, ret));
+
+    if ((ret = mbedtls_rsa_import_raw(rsa, NULL, 0, NULL, 0, NULL, 0, NULL, 0, *p, len)) != 0)
+        return (MBEDTLS_ERR_PK_INVALID_PUBKEY);
+
+    *p += len;
+
+    if (mbedtls_rsa_complete(rsa) != 0 || mbedtls_rsa_check_pubkey(rsa) != 0) {
+        return (MBEDTLS_ERR_PK_INVALID_PUBKEY);
+    }
+
+    if (*p != end)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_PUBKEY, MBEDTLS_ERR_ASN1_LENGTH_MISMATCH));
+
+    return (0);
+}
+#endif /* MBEDTLS_RSA_C */
+
+/* Get a PK algorithm identifier
+ *
+ *  AlgorithmIdentifier  ::=  SEQUENCE  {
+ *       algorithm               OBJECT IDENTIFIER,
+ *       parameters              ANY DEFINED BY algorithm OPTIONAL  }
+ */
+static int pk_get_pk_alg(unsigned char** p, const unsigned char* end, mbedtls_pk_type_t* pk_alg,
+    mbedtls_asn1_buf* params) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_asn1_buf alg_oid;
+
+    memset(params, 0, sizeof(mbedtls_asn1_buf));
+
+    if ((ret = mbedtls_asn1_get_alg(p, end, &alg_oid, params)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_ALG, ret));
+
+    if (mbedtls_oid_get_pk_alg(&alg_oid, pk_alg) != 0)
+        return (MBEDTLS_ERR_PK_UNKNOWN_PK_ALG);
+
+    /*
+     * No parameters with RSA (only for EC)
+     */
+    if (*pk_alg == MBEDTLS_PK_RSA &&
+        ((params->tag != MBEDTLS_ASN1_NULL && params->tag != 0) || params->len != 0)) {
+        return (MBEDTLS_ERR_PK_INVALID_ALG);
+    }
+
+    return (0);
+}
+
+/*
+ *  SubjectPublicKeyInfo  ::=  SEQUENCE  {
+ *       algorithm            AlgorithmIdentifier,
+ *       subjectPublicKey     BIT STRING }
+ */
+int mbedtls_pk_parse_subpubkey(unsigned char** p, const unsigned char* end,
+    mbedtls_pk_context* pk) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t len;
+    mbedtls_asn1_buf alg_params;
+    mbedtls_pk_type_t pk_alg = MBEDTLS_PK_NONE;
+    const mbedtls_pk_info_t* pk_info;
+
+    PK_VALIDATE_RET(p != NULL);
+    PK_VALIDATE_RET(*p != NULL);
+    PK_VALIDATE_RET(end != NULL);
+    PK_VALIDATE_RET(pk != NULL);
+
+    if ((ret = mbedtls_asn1_get_tag(p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    end = *p + len;
+
+    if ((ret = pk_get_pk_alg(p, end, &pk_alg, &alg_params)) != 0)
+        return (ret);
+
+    if ((ret = mbedtls_asn1_get_bitstring_null(p, end, &len)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_PUBKEY, ret));
+
+    if (*p + len != end)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_PUBKEY, MBEDTLS_ERR_ASN1_LENGTH_MISMATCH));
+
+    if ((pk_info = mbedtls_pk_info_from_type(pk_alg)) == NULL)
+        return (MBEDTLS_ERR_PK_UNKNOWN_PK_ALG);
+
+    if ((ret = mbedtls_pk_setup(pk, pk_info)) != 0)
+        return (ret);
+
+#if defined(MBEDTLS_RSA_C)
+    if (pk_alg == MBEDTLS_PK_RSA) {
+        ret = pk_get_rsapubkey(p, end, mbedtls_pk_rsa(*pk));
+    } else
+#endif /* MBEDTLS_RSA_C */
+#if defined(MBEDTLS_ECP_C)
+        if (pk_alg == MBEDTLS_PK_ECKEY_DH || pk_alg == MBEDTLS_PK_ECKEY) {
+        ret = pk_use_ecparams(&alg_params, &mbedtls_pk_ec(*pk)->grp);
+        if (ret == 0)
+            ret = pk_get_ecpubkey(p, end, mbedtls_pk_ec(*pk));
+    } else
+#endif /* MBEDTLS_ECP_C */
+        ret = MBEDTLS_ERR_PK_UNKNOWN_PK_ALG;
+
+    if (ret == 0 && *p != end)
+        ret = MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_PUBKEY, MBEDTLS_ERR_ASN1_LENGTH_MISMATCH);
+
+    if (ret != 0)
+        mbedtls_pk_free(pk);
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_RSA_C)
+/*
+ * Wrapper around mbedtls_asn1_get_mpi() that rejects zero.
+ *
+ * The value zero is:
+ * - never a valid value for an RSA parameter
+ * - interpreted as "omitted, please reconstruct" by mbedtls_rsa_complete().
+ *
+ * Since values can't be omitted in PKCS#1, passing a zero value to
+ * rsa_complete() would be incorrect, so reject zero values early.
+ */
+static int asn1_get_nonzero_mpi(unsigned char** p, const unsigned char* end, mbedtls_mpi* X) {
+    int ret;
+
+    ret = mbedtls_asn1_get_mpi(p, end, X);
+    if (ret != 0)
+        return (ret);
+
+    if (mbedtls_mpi_cmp_int(X, 0) == 0)
+        return (MBEDTLS_ERR_PK_KEY_INVALID_FORMAT);
+
+    return (0);
+}
+
+/*
+ * Parse a PKCS#1 encoded private RSA key
+ */
+static int pk_parse_key_pkcs1_der(mbedtls_rsa_context* rsa, const unsigned char* key,
+    size_t keylen) {
+    int ret, version;
+    size_t len;
+    unsigned char *p, *end;
+
+    mbedtls_mpi T;
+    mbedtls_mpi_init(&T);
+
+    p = (unsigned char*)key;
+    end = p + keylen;
+
+    /*
+     * This function parses the RSAPrivateKey (PKCS#1)
+     *
+     *  RSAPrivateKey ::= SEQUENCE {
+     *      version           Version,
+     *      modulus           INTEGER,  -- n
+     *      publicExponent    INTEGER,  -- e
+     *      privateExponent   INTEGER,  -- d
+     *      prime1            INTEGER,  -- p
+     *      prime2            INTEGER,  -- q
+     *      exponent1         INTEGER,  -- d mod (p-1)
+     *      exponent2         INTEGER,  -- d mod (q-1)
+     *      coefficient       INTEGER,  -- (inverse of q) mod p
+     *      otherPrimeInfos   OtherPrimeInfos OPTIONAL
+     *  }
+     */
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    end = p + len;
+
+    if ((ret = mbedtls_asn1_get_int(&p, end, &version)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    if (version != 0) {
+        return (MBEDTLS_ERR_PK_KEY_INVALID_VERSION);
+    }
+
+    /* Import N */
+    if ((ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = mbedtls_rsa_import(rsa, &T, NULL, NULL, NULL, NULL)) != 0)
+        goto cleanup;
+
+    /* Import E */
+    if ((ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = mbedtls_rsa_import(rsa, NULL, NULL, NULL, NULL, &T)) != 0)
+        goto cleanup;
+
+    /* Import D */
+    if ((ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = mbedtls_rsa_import(rsa, NULL, NULL, NULL, &T, NULL)) != 0)
+        goto cleanup;
+
+    /* Import P */
+    if ((ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = mbedtls_rsa_import(rsa, NULL, &T, NULL, NULL, NULL)) != 0)
+        goto cleanup;
+
+    /* Import Q */
+    if ((ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = mbedtls_rsa_import(rsa, NULL, NULL, &T, NULL, NULL)) != 0)
+        goto cleanup;
+
+#if !defined(MBEDTLS_RSA_NO_CRT) && !defined(MBEDTLS_RSA_ALT)
+    /*
+     * The RSA CRT parameters DP, DQ and QP are nominally redundant, in
+     * that they can be easily recomputed from D, P and Q. However by
+     * parsing them from the PKCS1 structure it is possible to avoid
+     * recalculating them which both reduces the overhead of loading
+     * RSA private keys into memory and also avoids side channels which
+     * can arise when computing those values, since all of D, P, and Q
+     * are secret. See https://eprint.iacr.org/2020/055 for a
+     * description of one such attack.
+     */
+
+    /* Import DP */
+    if ((ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = mbedtls_mpi_copy(&rsa->DP, &T)) != 0)
+        goto cleanup;
+
+    /* Import DQ */
+    if ((ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = mbedtls_mpi_copy(&rsa->DQ, &T)) != 0)
+        goto cleanup;
+
+    /* Import QP */
+    if ((ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = mbedtls_mpi_copy(&rsa->QP, &T)) != 0)
+        goto cleanup;
+
+#else
+    /* Verify existance of the CRT params */
+    if ((ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0 ||
+        (ret = asn1_get_nonzero_mpi(&p, end, &T)) != 0)
+        goto cleanup;
+#endif
+
+    /* rsa_complete() doesn't complete anything with the default
+     * implementation but is still called:
+     * - for the benefit of alternative implementation that may want to
+     *   pre-compute stuff beyond what's provided (eg Montgomery factors)
+     * - as is also sanity-checks the key
+     *
+     * Furthermore, we also check the public part for consistency with
+     * mbedtls_pk_parse_pubkey(), as it includes size minima for example.
+     */
+    if ((ret = mbedtls_rsa_complete(rsa)) != 0 || (ret = mbedtls_rsa_check_pubkey(rsa)) != 0) {
+        goto cleanup;
+    }
+
+    if (p != end) {
+        ret =
+            MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, MBEDTLS_ERR_ASN1_LENGTH_MISMATCH);
+    }
+
+cleanup:
+
+    mbedtls_mpi_free(&T);
+
+    if (ret != 0) {
+        /* Wrap error code if it's coming from a lower level */
+        if ((ret & 0xff80) == 0)
+            ret = MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret);
+        else
+            ret = MBEDTLS_ERR_PK_KEY_INVALID_FORMAT;
+
+        mbedtls_rsa_free(rsa);
+    }
+
+    return (ret);
+}
+#endif /* MBEDTLS_RSA_C */
+
+#if defined(MBEDTLS_ECP_C)
+/*
+ * Parse a SEC1 encoded private EC key
+ */
+static int pk_parse_key_sec1_der(mbedtls_ecp_keypair* eck, const unsigned char* key, size_t keylen,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    int version, pubkey_done;
+    size_t len;
+    mbedtls_asn1_buf params;
+    unsigned char* p = (unsigned char*)key;
+    unsigned char* end = p + keylen;
+    unsigned char* end2;
+
+    /*
+     * RFC 5915, or SEC1 Appendix C.4
+     *
+     * ECPrivateKey ::= SEQUENCE {
+     *      version        INTEGER { ecPrivkeyVer1(1) } (ecPrivkeyVer1),
+     *      privateKey     OCTET STRING,
+     *      parameters [0] ECParameters {{ NamedCurve }} OPTIONAL,
+     *      publicKey  [1] BIT STRING OPTIONAL
+     *    }
+     */
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    end = p + len;
+
+    if ((ret = mbedtls_asn1_get_int(&p, end, &version)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    if (version != 1)
+        return (MBEDTLS_ERR_PK_KEY_INVALID_VERSION);
+
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len, MBEDTLS_ASN1_OCTET_STRING)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    if ((ret = mbedtls_mpi_read_binary(&eck->d, p, len)) != 0) {
+        mbedtls_ecp_keypair_free(eck);
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    p += len;
+
+    pubkey_done = 0;
+    if (p != end) {
+        /*
+         * Is 'parameters' present?
+         */
+        if ((ret = mbedtls_asn1_get_tag(&p, end, &len,
+                 MBEDTLS_ASN1_CONTEXT_SPECIFIC | MBEDTLS_ASN1_CONSTRUCTED | 0)) == 0) {
+            if ((ret = pk_get_ecparams(&p, p + len, &params)) != 0 ||
+                (ret = pk_use_ecparams(&params, &eck->grp)) != 0) {
+                mbedtls_ecp_keypair_free(eck);
+                return (ret);
+            }
+        } else if (ret != MBEDTLS_ERR_ASN1_UNEXPECTED_TAG) {
+            mbedtls_ecp_keypair_free(eck);
+            return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+        }
+    }
+
+    if (p != end) {
+        /*
+         * Is 'publickey' present? If not, or if we can't read it (eg because it
+         * is compressed), create it from the private key.
+         */
+        if ((ret = mbedtls_asn1_get_tag(&p, end, &len,
+                 MBEDTLS_ASN1_CONTEXT_SPECIFIC | MBEDTLS_ASN1_CONSTRUCTED | 1)) == 0) {
+            end2 = p + len;
+
+            if ((ret = mbedtls_asn1_get_bitstring_null(&p, end2, &len)) != 0)
+                return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+            if (p + len != end2)
+                return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT,
+                    MBEDTLS_ERR_ASN1_LENGTH_MISMATCH));
+
+            if ((ret = pk_get_ecpubkey(&p, end2, eck)) == 0)
+                pubkey_done = 1;
+            else {
+                /*
+                 * The only acceptable failure mode of pk_get_ecpubkey() above
+                 * is if the point format is not recognized.
+                 */
+                if (ret != MBEDTLS_ERR_ECP_FEATURE_UNAVAILABLE)
+                    return (MBEDTLS_ERR_PK_KEY_INVALID_FORMAT);
+            }
+        } else if (ret != MBEDTLS_ERR_ASN1_UNEXPECTED_TAG) {
+            mbedtls_ecp_keypair_free(eck);
+            return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+        }
+    }
+
+    if (!pubkey_done &&
+        (ret = mbedtls_ecp_mul(&eck->grp, &eck->Q, &eck->d, &eck->grp.G, f_rng, p_rng)) != 0) {
+        mbedtls_ecp_keypair_free(eck);
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    if ((ret = mbedtls_ecp_check_privkey(&eck->grp, &eck->d)) != 0) {
+        mbedtls_ecp_keypair_free(eck);
+        return (ret);
+    }
+
+    return (0);
+}
+#endif /* MBEDTLS_ECP_C */
+
+/*
+ * Parse an unencrypted PKCS#8 encoded private key
+ *
+ * Notes:
+ *
+ * - This function does not own the key buffer. It is the
+ *   responsibility of the caller to take care of zeroizing
+ *   and freeing it after use.
+ *
+ * - The function is responsible for freeing the provided
+ *   PK context on failure.
+ *
+ */
+static int pk_parse_key_pkcs8_unencrypted_der(mbedtls_pk_context* pk, const unsigned char* key,
+    size_t keylen, int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret, version;
+    size_t len;
+    mbedtls_asn1_buf params;
+    unsigned char* p = (unsigned char*)key;
+    unsigned char* end = p + keylen;
+    mbedtls_pk_type_t pk_alg = MBEDTLS_PK_NONE;
+    const mbedtls_pk_info_t* pk_info;
+
+#if !defined(MBEDTLS_ECP_C)
+    (void)f_rng;
+    (void)p_rng;
+#endif
+
+    /*
+     * This function parses the PrivateKeyInfo object (PKCS#8 v1.2 = RFC 5208)
+     *
+     *    PrivateKeyInfo ::= SEQUENCE {
+     *      version                   Version,
+     *      privateKeyAlgorithm       PrivateKeyAlgorithmIdentifier,
+     *      privateKey                PrivateKey,
+     *      attributes           [0]  IMPLICIT Attributes OPTIONAL }
+     *
+     *    Version ::= INTEGER
+     *    PrivateKeyAlgorithmIdentifier ::= AlgorithmIdentifier
+     *    PrivateKey ::= OCTET STRING
+     *
+     *  The PrivateKey OCTET STRING is a SEC1 ECPrivateKey
+     */
+
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    end = p + len;
+
+    if ((ret = mbedtls_asn1_get_int(&p, end, &version)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    if (version != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_VERSION, ret));
+
+    if ((ret = pk_get_pk_alg(&p, end, &pk_alg, &params)) != 0) {
+        return (ret);
+    }
+
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len, MBEDTLS_ASN1_OCTET_STRING)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    if (len < 1)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, MBEDTLS_ERR_ASN1_OUT_OF_DATA));
+
+    if ((pk_info = mbedtls_pk_info_from_type(pk_alg)) == NULL)
+        return (MBEDTLS_ERR_PK_UNKNOWN_PK_ALG);
+
+    if ((ret = mbedtls_pk_setup(pk, pk_info)) != 0)
+        return (ret);
+
+#if defined(MBEDTLS_RSA_C)
+    if (pk_alg == MBEDTLS_PK_RSA) {
+        if ((ret = pk_parse_key_pkcs1_der(mbedtls_pk_rsa(*pk), p, len)) != 0) {
+            mbedtls_pk_free(pk);
+            return (ret);
+        }
+    } else
+#endif /* MBEDTLS_RSA_C */
+#if defined(MBEDTLS_ECP_C)
+        if (pk_alg == MBEDTLS_PK_ECKEY || pk_alg == MBEDTLS_PK_ECKEY_DH) {
+        if ((ret = pk_use_ecparams(&params, &mbedtls_pk_ec(*pk)->grp)) != 0 ||
+            (ret = pk_parse_key_sec1_der(mbedtls_pk_ec(*pk), p, len, f_rng, p_rng)) != 0) {
+            mbedtls_pk_free(pk);
+            return (ret);
+        }
+    } else
+#endif /* MBEDTLS_ECP_C */
+        return (MBEDTLS_ERR_PK_UNKNOWN_PK_ALG);
+
+    return (0);
+}
+
+/*
+ * Parse an encrypted PKCS#8 encoded private key
+ *
+ * To save space, the decryption happens in-place on the given key buffer.
+ * Also, while this function may modify the keybuffer, it doesn't own it,
+ * and instead it is the responsibility of the caller to zeroize and properly
+ * free it after use.
+ *
+ */
+#if defined(MBEDTLS_PKCS12_C) || defined(MBEDTLS_PKCS5_C)
+static int pk_parse_key_pkcs8_encrypted_der(mbedtls_pk_context* pk, unsigned char* key,
+    size_t keylen, const unsigned char* pwd, size_t pwdlen,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret, decrypted = 0;
+    size_t len;
+    unsigned char* buf;
+    unsigned char *p, *end;
+    mbedtls_asn1_buf pbe_alg_oid, pbe_params;
+#if defined(MBEDTLS_PKCS12_C)
+    mbedtls_cipher_type_t cipher_alg;
+    mbedtls_md_type_t md_alg;
+#endif
+
+    p = key;
+    end = p + keylen;
+
+    if (pwdlen == 0)
+        return (MBEDTLS_ERR_PK_PASSWORD_REQUIRED);
+
+    /*
+     * This function parses the EncryptedPrivateKeyInfo object (PKCS#8)
+     *
+     *  EncryptedPrivateKeyInfo ::= SEQUENCE {
+     *    encryptionAlgorithm  EncryptionAlgorithmIdentifier,
+     *    encryptedData        EncryptedData
+     *  }
+     *
+     *  EncryptionAlgorithmIdentifier ::= AlgorithmIdentifier
+     *
+     *  EncryptedData ::= OCTET STRING
+     *
+     *  The EncryptedData OCTET STRING is a PKCS#8 PrivateKeyInfo
+     *
+     */
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len,
+             MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+    }
+
+    end = p + len;
+
+    if ((ret = mbedtls_asn1_get_alg(&p, end, &pbe_alg_oid, &pbe_params)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    if ((ret = mbedtls_asn1_get_tag(&p, end, &len, MBEDTLS_ASN1_OCTET_STRING)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_KEY_INVALID_FORMAT, ret));
+
+    buf = p;
+
+    /*
+     * Decrypt EncryptedData with appropriate PBE
+     */
+#if defined(MBEDTLS_PKCS12_C)
+    if (mbedtls_oid_get_pkcs12_pbe_alg(&pbe_alg_oid, &md_alg, &cipher_alg) == 0) {
+        if ((ret = mbedtls_pkcs12_pbe(&pbe_params, MBEDTLS_PKCS12_PBE_DECRYPT, cipher_alg, md_alg,
+                 pwd, pwdlen, p, len, buf)) != 0) {
+            if (ret == MBEDTLS_ERR_PKCS12_PASSWORD_MISMATCH)
+                return (MBEDTLS_ERR_PK_PASSWORD_MISMATCH);
+
+            return (ret);
+        }
+
+        decrypted = 1;
+    } else
+#endif /* MBEDTLS_PKCS12_C */
+#if defined(MBEDTLS_PKCS5_C)
+        if (MBEDTLS_OID_CMP(MBEDTLS_OID_PKCS5_PBES2, &pbe_alg_oid) == 0) {
+        if ((ret = mbedtls_pkcs5_pbes2(&pbe_params, MBEDTLS_PKCS5_DECRYPT, pwd, pwdlen, p, len,
+                 buf)) != 0) {
+            if (ret == MBEDTLS_ERR_PKCS5_PASSWORD_MISMATCH)
+                return (MBEDTLS_ERR_PK_PASSWORD_MISMATCH);
+
+            return (ret);
+        }
+
+        decrypted = 1;
+    } else
+#endif /* MBEDTLS_PKCS5_C */
+    {
+        ((void)pwd);
+    }
+
+    if (decrypted == 0)
+        return (MBEDTLS_ERR_PK_FEATURE_UNAVAILABLE);
+
+    return (pk_parse_key_pkcs8_unencrypted_der(pk, buf, len, f_rng, p_rng));
+}
+#endif /* MBEDTLS_PKCS12_C || MBEDTLS_PKCS5_C */
+
+/*
+ * Parse a private key
+ */
+int mbedtls_pk_parse_key(mbedtls_pk_context* pk, const unsigned char* key, size_t keylen,
+    const unsigned char* pwd, size_t pwdlen, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    const mbedtls_pk_info_t* pk_info;
+#if defined(MBEDTLS_PEM_PARSE_C)
+    size_t len;
+    mbedtls_pem_context pem;
+#endif
+
+    PK_VALIDATE_RET(pk != NULL);
+    if (keylen == 0)
+        return (MBEDTLS_ERR_PK_KEY_INVALID_FORMAT);
+    PK_VALIDATE_RET(key != NULL);
+
+#if defined(MBEDTLS_PEM_PARSE_C)
+    mbedtls_pem_init(&pem);
+
+#if defined(MBEDTLS_RSA_C)
+    /* Avoid calling mbedtls_pem_read_buffer() on non-null-terminated string */
+    if (key[keylen - 1] != '\0')
+        ret = MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT;
+    else
+        ret = mbedtls_pem_read_buffer(&pem, "-----BEGIN RSA PRIVATE KEY-----",
+            "-----END RSA PRIVATE KEY-----", key, pwd, pwdlen, &len);
+
+    if (ret == 0) {
+        pk_info = mbedtls_pk_info_from_type(MBEDTLS_PK_RSA);
+        if ((ret = mbedtls_pk_setup(pk, pk_info)) != 0 ||
+            (ret = pk_parse_key_pkcs1_der(mbedtls_pk_rsa(*pk), pem.buf, pem.buflen)) != 0) {
+            mbedtls_pk_free(pk);
+        }
+
+        mbedtls_pem_free(&pem);
+        return (ret);
+    } else if (ret == MBEDTLS_ERR_PEM_PASSWORD_MISMATCH)
+        return (MBEDTLS_ERR_PK_PASSWORD_MISMATCH);
+    else if (ret == MBEDTLS_ERR_PEM_PASSWORD_REQUIRED)
+        return (MBEDTLS_ERR_PK_PASSWORD_REQUIRED);
+    else if (ret != MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT)
+        return (ret);
+#endif /* MBEDTLS_RSA_C */
+
+#if defined(MBEDTLS_ECP_C)
+    /* Avoid calling mbedtls_pem_read_buffer() on non-null-terminated string */
+    if (key[keylen - 1] != '\0')
+        ret = MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT;
+    else
+        ret = mbedtls_pem_read_buffer(&pem, "-----BEGIN EC PRIVATE KEY-----",
+            "-----END EC PRIVATE KEY-----", key, pwd, pwdlen, &len);
+    if (ret == 0) {
+        pk_info = mbedtls_pk_info_from_type(MBEDTLS_PK_ECKEY);
+
+        if ((ret = mbedtls_pk_setup(pk, pk_info)) != 0 ||
+            (ret = pk_parse_key_sec1_der(mbedtls_pk_ec(*pk), pem.buf, pem.buflen, f_rng, p_rng)) !=
+                0) {
+            mbedtls_pk_free(pk);
+        }
+
+        mbedtls_pem_free(&pem);
+        return (ret);
+    } else if (ret == MBEDTLS_ERR_PEM_PASSWORD_MISMATCH)
+        return (MBEDTLS_ERR_PK_PASSWORD_MISMATCH);
+    else if (ret == MBEDTLS_ERR_PEM_PASSWORD_REQUIRED)
+        return (MBEDTLS_ERR_PK_PASSWORD_REQUIRED);
+    else if (ret != MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT)
+        return (ret);
+#endif /* MBEDTLS_ECP_C */
+
+    /* Avoid calling mbedtls_pem_read_buffer() on non-null-terminated string */
+    if (key[keylen - 1] != '\0')
+        ret = MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT;
+    else
+        ret = mbedtls_pem_read_buffer(&pem, "-----BEGIN PRIVATE KEY-----",
+            "-----END PRIVATE KEY-----", key, NULL, 0, &len);
+    if (ret == 0) {
+        if ((ret = pk_parse_key_pkcs8_unencrypted_der(pk, pem.buf, pem.buflen, f_rng, p_rng)) !=
+            0) {
+            mbedtls_pk_free(pk);
+        }
+
+        mbedtls_pem_free(&pem);
+        return (ret);
+    } else if (ret != MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT)
+        return (ret);
+
+#if defined(MBEDTLS_PKCS12_C) || defined(MBEDTLS_PKCS5_C)
+    /* Avoid calling mbedtls_pem_read_buffer() on non-null-terminated string */
+    if (key[keylen - 1] != '\0')
+        ret = MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT;
+    else
+        ret = mbedtls_pem_read_buffer(&pem, "-----BEGIN ENCRYPTED PRIVATE KEY-----",
+            "-----END ENCRYPTED PRIVATE KEY-----", key, NULL, 0, &len);
+    if (ret == 0) {
+        if ((ret = pk_parse_key_pkcs8_encrypted_der(pk, pem.buf, pem.buflen, pwd, pwdlen, f_rng,
+                 p_rng)) != 0) {
+            mbedtls_pk_free(pk);
+        }
+
+        mbedtls_pem_free(&pem);
+        return (ret);
+    } else if (ret != MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT)
+        return (ret);
+#endif /* MBEDTLS_PKCS12_C || MBEDTLS_PKCS5_C */
+#else
+    ((void)pwd);
+    ((void)pwdlen);
+#endif /* MBEDTLS_PEM_PARSE_C */
+
+        /*
+         * At this point we only know it's not a PEM formatted key. Could be any
+         * of the known DER encoded private key formats
+         *
+         * We try the different DER format parsers to see if one passes without
+         * error
+         */
+#if defined(MBEDTLS_PKCS12_C) || defined(MBEDTLS_PKCS5_C)
+    {
+        unsigned char* key_copy;
+
+        if ((key_copy = mbedtls_calloc(1, keylen)) == NULL)
+            return (MBEDTLS_ERR_PK_ALLOC_FAILED);
+
+        memcpy(key_copy, key, keylen);
+
+        ret = pk_parse_key_pkcs8_encrypted_der(pk, key_copy, keylen, pwd, pwdlen, f_rng, p_rng);
+
+        mbedtls_platform_zeroize(key_copy, keylen);
+        mbedtls_free(key_copy);
+    }
+
+    if (ret == 0)
+        return (0);
+
+    mbedtls_pk_free(pk);
+    mbedtls_pk_init(pk);
+
+    if (ret == MBEDTLS_ERR_PK_PASSWORD_MISMATCH) {
+        return (ret);
+    }
+#endif /* MBEDTLS_PKCS12_C || MBEDTLS_PKCS5_C */
+
+    ret = pk_parse_key_pkcs8_unencrypted_der(pk, key, keylen, f_rng, p_rng);
+    if (ret == 0) {
+        return (0);
+    }
+
+    mbedtls_pk_free(pk);
+    mbedtls_pk_init(pk);
+
+#if defined(MBEDTLS_RSA_C)
+
+    pk_info = mbedtls_pk_info_from_type(MBEDTLS_PK_RSA);
+    if (mbedtls_pk_setup(pk, pk_info) == 0 &&
+        pk_parse_key_pkcs1_der(mbedtls_pk_rsa(*pk), key, keylen) == 0) {
+        return (0);
+    }
+
+    mbedtls_pk_free(pk);
+    mbedtls_pk_init(pk);
+#endif /* MBEDTLS_RSA_C */
+
+#if defined(MBEDTLS_ECP_C)
+    pk_info = mbedtls_pk_info_from_type(MBEDTLS_PK_ECKEY);
+    if (mbedtls_pk_setup(pk, pk_info) == 0 &&
+        pk_parse_key_sec1_der(mbedtls_pk_ec(*pk), key, keylen, f_rng, p_rng) == 0) {
+        return (0);
+    }
+    mbedtls_pk_free(pk);
+#endif /* MBEDTLS_ECP_C */
+
+    /* If MBEDTLS_RSA_C is defined but MBEDTLS_ECP_C isn't,
+     * it is ok to leave the PK context initialized but not
+     * freed: It is the caller's responsibility to call pk_init()
+     * before calling this function, and to call pk_free()
+     * when it fails. If MBEDTLS_ECP_C is defined but MBEDTLS_RSA_C
+     * isn't, this leads to mbedtls_pk_free() being called
+     * twice, once here and once by the caller, but this is
+     * also ok and in line with the mbedtls_pk_free() calls
+     * on failed PEM parsing attempts. */
+
+    return (MBEDTLS_ERR_PK_KEY_INVALID_FORMAT);
+}
+
+/*
+ * Parse a public key
+ */
+int mbedtls_pk_parse_public_key(mbedtls_pk_context* ctx, const unsigned char* key, size_t keylen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char* p;
+#if defined(MBEDTLS_RSA_C)
+    const mbedtls_pk_info_t* pk_info;
+#endif
+#if defined(MBEDTLS_PEM_PARSE_C)
+    size_t len;
+    mbedtls_pem_context pem;
+#endif
+
+    PK_VALIDATE_RET(ctx != NULL);
+    if (keylen == 0)
+        return (MBEDTLS_ERR_PK_KEY_INVALID_FORMAT);
+    PK_VALIDATE_RET(key != NULL || keylen == 0);
+
+#if defined(MBEDTLS_PEM_PARSE_C)
+    mbedtls_pem_init(&pem);
+#if defined(MBEDTLS_RSA_C)
+    /* Avoid calling mbedtls_pem_read_buffer() on non-null-terminated string */
+    if (key[keylen - 1] != '\0')
+        ret = MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT;
+    else
+        ret = mbedtls_pem_read_buffer(&pem, "-----BEGIN RSA PUBLIC KEY-----",
+            "-----END RSA PUBLIC KEY-----", key, NULL, 0, &len);
+
+    if (ret == 0) {
+        p = pem.buf;
+        if ((pk_info = mbedtls_pk_info_from_type(MBEDTLS_PK_RSA)) == NULL)
+            return (MBEDTLS_ERR_PK_UNKNOWN_PK_ALG);
+
+        if ((ret = mbedtls_pk_setup(ctx, pk_info)) != 0)
+            return (ret);
+
+        if ((ret = pk_get_rsapubkey(&p, p + pem.buflen, mbedtls_pk_rsa(*ctx))) != 0)
+            mbedtls_pk_free(ctx);
+
+        mbedtls_pem_free(&pem);
+        return (ret);
+    } else if (ret != MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT) {
+        mbedtls_pem_free(&pem);
+        return (ret);
+    }
+#endif /* MBEDTLS_RSA_C */
+
+    /* Avoid calling mbedtls_pem_read_buffer() on non-null-terminated string */
+    if (key[keylen - 1] != '\0')
+        ret = MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT;
+    else
+        ret = mbedtls_pem_read_buffer(&pem, "-----BEGIN PUBLIC KEY-----",
+            "-----END PUBLIC KEY-----", key, NULL, 0, &len);
+
+    if (ret == 0) {
+        /*
+         * Was PEM encoded
+         */
+        p = pem.buf;
+
+        ret = mbedtls_pk_parse_subpubkey(&p, p + pem.buflen, ctx);
+        mbedtls_pem_free(&pem);
+        return (ret);
+    } else if (ret != MBEDTLS_ERR_PEM_NO_HEADER_FOOTER_PRESENT) {
+        mbedtls_pem_free(&pem);
+        return (ret);
+    }
+    mbedtls_pem_free(&pem);
+#endif /* MBEDTLS_PEM_PARSE_C */
+
+#if defined(MBEDTLS_RSA_C)
+    if ((pk_info = mbedtls_pk_info_from_type(MBEDTLS_PK_RSA)) == NULL)
+        return (MBEDTLS_ERR_PK_UNKNOWN_PK_ALG);
+
+    if ((ret = mbedtls_pk_setup(ctx, pk_info)) != 0)
+        return (ret);
+
+    p = (unsigned char*)key;
+    ret = pk_get_rsapubkey(&p, p + keylen, mbedtls_pk_rsa(*ctx));
+    if (ret == 0) {
+        return (ret);
+    }
+    mbedtls_pk_free(ctx);
+    if (ret !=
+        (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_PK_INVALID_PUBKEY, MBEDTLS_ERR_ASN1_UNEXPECTED_TAG))) {
+        return (ret);
+    }
+#endif /* MBEDTLS_RSA_C */
+    p = (unsigned char*)key;
+
+    ret = mbedtls_pk_parse_subpubkey(&p, p + keylen, ctx);
+
+    return (ret);
+}
+
+#endif /* MBEDTLS_PK_PARSE_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/platform_util.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/platform_util.cpp
new file mode 100644
index 0000000000..da97ef363c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/platform_util.cpp
@@ -0,0 +1,132 @@
+/*
+ * Common and shared functions used by multiple modules in the Mbed TLS
+ * library.
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+/*
+ * Ensure gmtime_r is available even with -std=c99; must be defined before
+ * mbedtls_config.h, which pulls in glibc's features.h. Harmless on other platforms.
+ */
+#if !defined(_POSIX_C_SOURCE)
+#define _POSIX_C_SOURCE 200112L
+#endif
+
+#include "mbedtls/platform_util.h"
+
+#include "common.h"
+#include "mbedtls/platform.h"
+#ifdef MBEDTLS_THREADING_C
+#include "mbedtls/threading.h"
+#endif
+#include <stddef.h>
+#include <string.h>
+
+#if !defined(MBEDTLS_PLATFORM_ZEROIZE_ALT)
+/*
+ * This implementation should never be optimized out by the compiler
+ *
+ * This implementation for mbedtls_platform_zeroize() was inspired from Colin
+ * Percival's blog article at:
+ *
+ * http://www.daemonology.net/blog/2014-09-04-how-to-zero-a-buffer.html
+ *
+ * It uses a volatile function pointer to the standard memset(). Because the
+ * pointer is volatile the compiler expects it to change at
+ * any time and will not optimize out the call that could potentially perform
+ * other operations on the input buffer instead of just setting it to 0.
+ * Nevertheless, as pointed out by davidtgoldblatt on Hacker News
+ * (refer to http://www.daemonology.net/blog/2014-09-05-erratum.html for
+ * details), optimizations of the following form are still possible:
+ *
+ * if( memset_func != memset )
+ *     memset_func( buf, 0, len );
+ *
+ * Note that it is extremely difficult to guarantee that
+ * mbedtls_platform_zeroize() will not be optimized out by aggressive compilers
+ * in a portable way. For this reason, Mbed TLS also provides the configuration
+ * option MBEDTLS_PLATFORM_ZEROIZE_ALT, which allows users to configure
+ * mbedtls_platform_zeroize() to use a suitable implementation for their
+ * platform and needs.
+ */
+static void* (*const volatile memset_func)(void*, int, size_t) = memset;
+
+void mbedtls_platform_zeroize(void* buf, size_t len) {
+    MBEDTLS_INTERNAL_VALIDATE(len == 0 || buf != NULL);
+
+    if (len > 0)
+        memset_func(buf, 0, len);
+}
+#endif /* MBEDTLS_PLATFORM_ZEROIZE_ALT */
+
+#if defined(MBEDTLS_HAVE_TIME_DATE) && !defined(MBEDTLS_PLATFORM_GMTIME_R_ALT)
+#include <time.h>
+#if !defined(_WIN32) && (defined(unix) || defined(__unix) || defined(__unix__) ||                  \
+                            (defined(__APPLE__) && defined(__MACH__)))
+#include <unistd.h>
+#endif /* !_WIN32 && (unix || __unix || __unix__ ||                                                \
+        * (__APPLE__ && __MACH__)) */
+
+#if !((defined(_POSIX_VERSION) && _POSIX_VERSION >= 200809L) ||                                    \
+      (defined(_POSIX_THREAD_SAFE_FUNCTIONS) && _POSIX_THREAD_SAFE_FUNCTIONS >= 200112L))
+/*
+ * This is a convenience shorthand macro to avoid checking the long
+ * preprocessor conditions above. Ideally, we could expose this macro in
+ * platform_util.h and simply use it in platform_util.c, threading.c and
+ * threading.h. However, this macro is not part of the Mbed TLS public API, so
+ * we keep it private by only defining it in this file
+ */
+#if !(defined(_WIN32) && !defined(EFIX64) && !defined(EFI32))
+#define PLATFORM_UTIL_USE_GMTIME
+#endif /* ! ( defined(_WIN32) && !defined(EFIX64) && !defined(EFI32) ) */
+
+#endif /* !( ( defined(_POSIX_VERSION) && _POSIX_VERSION >= 200809L ) ||                           \
+             ( defined(_POSIX_THREAD_SAFE_FUNCTIONS ) &&                                           \
+                _POSIX_THREAD_SAFE_FUNCTIONS >= 200112L ) ) */
+
+struct tm* mbedtls_platform_gmtime_r(const mbedtls_time_t* tt, struct tm* tm_buf) {
+#if defined(_WIN32) && !defined(EFIX64) && !defined(EFI32)
+    return ((gmtime_s(tm_buf, tt) == 0) ? tm_buf : NULL);
+#elif !defined(PLATFORM_UTIL_USE_GMTIME)
+    return (gmtime_r(tt, tm_buf));
+#else
+    struct tm* lt;
+
+#if defined(MBEDTLS_THREADING_C)
+    if (mbedtls_mutex_lock(&mbedtls_threading_gmtime_mutex) != 0)
+        return (NULL);
+#endif /* MBEDTLS_THREADING_C */
+
+    lt = gmtime(tt);
+
+    if (lt != NULL) {
+        memcpy(tm_buf, lt, sizeof(struct tm));
+    }
+
+#if defined(MBEDTLS_THREADING_C)
+    if (mbedtls_mutex_unlock(&mbedtls_threading_gmtime_mutex) != 0)
+        return (NULL);
+#endif /* MBEDTLS_THREADING_C */
+
+    return ((lt == NULL) ? NULL : tm_buf);
+#endif /* _WIN32 && !EFIX64 && !EFI32 */
+}
+#endif /* MBEDTLS_HAVE_TIME_DATE && MBEDTLS_PLATFORM_GMTIME_R_ALT */
+
+#if defined(MBEDTLS_TEST_HOOKS)
+void (*mbedtls_test_hook_test_fail)(const char*, int, const char*);
+#endif /* MBEDTLS_TEST_HOOKS */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/rsa.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/rsa.cpp
new file mode 100644
index 0000000000..9301e52271
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/rsa.cpp
@@ -0,0 +1,2235 @@
+/*
+ *  The RSA public-key cryptosystem
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+
+/*
+ *  The following sources were referenced in the design of this implementation
+ *  of the RSA algorithm:
+ *
+ *  [1] A method for obtaining digital signatures and public-key cryptosystems
+ *      R Rivest, A Shamir, and L Adleman
+ *      http://people.csail.mit.edu/rivest/pubs.html#RSA78
+ *
+ *  [2] Handbook of Applied Cryptography - 1997, Chapter 8
+ *      Menezes, van Oorschot and Vanstone
+ *
+ *  [3] Malware Guard Extension: Using SGX to Conceal Cache Attacks
+ *      Michael Schwarz, Samuel Weiser, Daniel Gruss, Clémentine Maurice and
+ *      Stefan Mangard
+ *      https://arxiv.org/abs/1702.08719v2
+ *
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_RSA_C)
+
+#include <string.h>
+
+#include "constant_time_internal.h"
+#include "mbedtls/constant_time.h"
+#include "mbedtls/error.h"
+#include "mbedtls/oid.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/rsa.h"
+#include "rsa_alt_helpers.h"
+
+#if defined(MBEDTLS_PKCS1_V21)
+#include "mbedtls/md.h"
+#endif
+
+#if defined(MBEDTLS_PKCS1_V15) && !defined(__OpenBSD__) && !defined(__NetBSD__)
+#include <stdlib.h>
+#endif
+
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdio.h>
+#define mbedtls_printf printf
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif
+
+#if !defined(MBEDTLS_RSA_ALT)
+
+/* Parameter validation macros */
+#define RSA_VALIDATE_RET(cond) MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_RSA_BAD_INPUT_DATA)
+#define RSA_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+int mbedtls_rsa_import(mbedtls_rsa_context* ctx, const mbedtls_mpi* N, const mbedtls_mpi* P,
+    const mbedtls_mpi* Q, const mbedtls_mpi* D, const mbedtls_mpi* E) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    RSA_VALIDATE_RET(ctx != NULL);
+
+    if ((N != NULL && (ret = mbedtls_mpi_copy(&ctx->N, N)) != 0) ||
+        (P != NULL && (ret = mbedtls_mpi_copy(&ctx->P, P)) != 0) ||
+        (Q != NULL && (ret = mbedtls_mpi_copy(&ctx->Q, Q)) != 0) ||
+        (D != NULL && (ret = mbedtls_mpi_copy(&ctx->D, D)) != 0) ||
+        (E != NULL && (ret = mbedtls_mpi_copy(&ctx->E, E)) != 0)) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_BAD_INPUT_DATA, ret));
+    }
+
+    if (N != NULL)
+        ctx->len = mbedtls_mpi_size(&ctx->N);
+
+    return (0);
+}
+
+int mbedtls_rsa_import_raw(mbedtls_rsa_context* ctx, unsigned char const* N, size_t N_len,
+    unsigned char const* P, size_t P_len, unsigned char const* Q, size_t Q_len,
+    unsigned char const* D, size_t D_len, unsigned char const* E, size_t E_len) {
+    int ret = 0;
+    RSA_VALIDATE_RET(ctx != NULL);
+
+    if (N != NULL) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_read_binary(&ctx->N, N, N_len));
+        ctx->len = mbedtls_mpi_size(&ctx->N);
+    }
+
+    if (P != NULL)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_read_binary(&ctx->P, P, P_len));
+
+    if (Q != NULL)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_read_binary(&ctx->Q, Q, Q_len));
+
+    if (D != NULL)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_read_binary(&ctx->D, D, D_len));
+
+    if (E != NULL)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_read_binary(&ctx->E, E, E_len));
+
+cleanup:
+
+    if (ret != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_BAD_INPUT_DATA, ret));
+
+    return (0);
+}
+
+/*
+ * Checks whether the context fields are set in such a way
+ * that the RSA primitives will be able to execute without error.
+ * It does *not* make guarantees for consistency of the parameters.
+ */
+static int rsa_check_context(mbedtls_rsa_context const* ctx, int is_priv, int blinding_needed) {
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    /* blinding_needed is only used for NO_CRT to decide whether
+     * P,Q need to be present or not. */
+    ((void)blinding_needed);
+#endif
+
+    if (ctx->len != mbedtls_mpi_size(&ctx->N) || ctx->len > MBEDTLS_MPI_MAX_SIZE) {
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+
+    /*
+     * 1. Modular exponentiation needs positive, odd moduli.
+     */
+
+    /* Modular exponentiation wrt. N is always used for
+     * RSA public key operations. */
+    if (mbedtls_mpi_cmp_int(&ctx->N, 0) <= 0 || mbedtls_mpi_get_bit(&ctx->N, 0) == 0) {
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    /* Modular exponentiation for P and Q is only
+     * used for private key operations and if CRT
+     * is used. */
+    if (is_priv &&
+        (mbedtls_mpi_cmp_int(&ctx->P, 0) <= 0 || mbedtls_mpi_get_bit(&ctx->P, 0) == 0 ||
+            mbedtls_mpi_cmp_int(&ctx->Q, 0) <= 0 || mbedtls_mpi_get_bit(&ctx->Q, 0) == 0)) {
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+#endif /* !MBEDTLS_RSA_NO_CRT */
+
+    /*
+     * 2. Exponents must be positive
+     */
+
+    /* Always need E for public key operations */
+    if (mbedtls_mpi_cmp_int(&ctx->E, 0) <= 0)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+#if defined(MBEDTLS_RSA_NO_CRT)
+    /* For private key operations, use D or DP & DQ
+     * as (unblinded) exponents. */
+    if (is_priv && mbedtls_mpi_cmp_int(&ctx->D, 0) <= 0)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+#else
+    if (is_priv &&
+        (mbedtls_mpi_cmp_int(&ctx->DP, 0) <= 0 || mbedtls_mpi_cmp_int(&ctx->DQ, 0) <= 0)) {
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+#endif /* MBEDTLS_RSA_NO_CRT */
+
+        /* Blinding shouldn't make exponents negative either,
+         * so check that P, Q >= 1 if that hasn't yet been
+         * done as part of 1. */
+#if defined(MBEDTLS_RSA_NO_CRT)
+    if (is_priv && blinding_needed &&
+        (mbedtls_mpi_cmp_int(&ctx->P, 0) <= 0 || mbedtls_mpi_cmp_int(&ctx->Q, 0) <= 0)) {
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+#endif
+
+    /* It wouldn't lead to an error if it wasn't satisfied,
+     * but check for QP >= 1 nonetheless. */
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    if (is_priv && mbedtls_mpi_cmp_int(&ctx->QP, 0) <= 0) {
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+#endif
+
+    return (0);
+}
+
+int mbedtls_rsa_complete(mbedtls_rsa_context* ctx) {
+    int ret = 0;
+    int have_N, have_P, have_Q, have_D, have_E;
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    int have_DP, have_DQ, have_QP;
+#endif
+    int n_missing, pq_missing, d_missing, is_pub, is_priv;
+
+    RSA_VALIDATE_RET(ctx != NULL);
+
+    have_N = (mbedtls_mpi_cmp_int(&ctx->N, 0) != 0);
+    have_P = (mbedtls_mpi_cmp_int(&ctx->P, 0) != 0);
+    have_Q = (mbedtls_mpi_cmp_int(&ctx->Q, 0) != 0);
+    have_D = (mbedtls_mpi_cmp_int(&ctx->D, 0) != 0);
+    have_E = (mbedtls_mpi_cmp_int(&ctx->E, 0) != 0);
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    have_DP = (mbedtls_mpi_cmp_int(&ctx->DP, 0) != 0);
+    have_DQ = (mbedtls_mpi_cmp_int(&ctx->DQ, 0) != 0);
+    have_QP = (mbedtls_mpi_cmp_int(&ctx->QP, 0) != 0);
+#endif
+
+    /*
+     * Check whether provided parameters are enough
+     * to deduce all others. The following incomplete
+     * parameter sets for private keys are supported:
+     *
+     * (1) P, Q missing.
+     * (2) D and potentially N missing.
+     *
+     */
+
+    n_missing = have_P && have_Q && have_D && have_E;
+    pq_missing = have_N && !have_P && !have_Q && have_D && have_E;
+    d_missing = have_P && have_Q && !have_D && have_E;
+    is_pub = have_N && !have_P && !have_Q && !have_D && have_E;
+
+    /* These three alternatives are mutually exclusive */
+    is_priv = n_missing || pq_missing || d_missing;
+
+    if (!is_priv && !is_pub)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    /*
+     * Step 1: Deduce N if P, Q are provided.
+     */
+
+    if (!have_N && have_P && have_Q) {
+        if ((ret = mbedtls_mpi_mul_mpi(&ctx->N, &ctx->P, &ctx->Q)) != 0) {
+            return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_BAD_INPUT_DATA, ret));
+        }
+
+        ctx->len = mbedtls_mpi_size(&ctx->N);
+    }
+
+    /*
+     * Step 2: Deduce and verify all remaining core parameters.
+     */
+
+    if (pq_missing) {
+        ret = mbedtls_rsa_deduce_primes(&ctx->N, &ctx->E, &ctx->D, &ctx->P, &ctx->Q);
+        if (ret != 0)
+            return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_BAD_INPUT_DATA, ret));
+
+    } else if (d_missing) {
+        if ((ret = mbedtls_rsa_deduce_private_exponent(&ctx->P, &ctx->Q, &ctx->E, &ctx->D)) != 0) {
+            return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_BAD_INPUT_DATA, ret));
+        }
+    }
+
+    /*
+     * Step 3: Deduce all additional parameters specific
+     *         to our current RSA implementation.
+     */
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    if (is_priv && !(have_DP && have_DQ && have_QP)) {
+        ret = mbedtls_rsa_deduce_crt(&ctx->P, &ctx->Q, &ctx->D, &ctx->DP, &ctx->DQ, &ctx->QP);
+        if (ret != 0)
+            return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_BAD_INPUT_DATA, ret));
+    }
+#endif /* MBEDTLS_RSA_NO_CRT */
+
+    /*
+     * Step 3: Basic sanity checks
+     */
+
+    return (rsa_check_context(ctx, is_priv, 1));
+}
+
+int mbedtls_rsa_export_raw(const mbedtls_rsa_context* ctx, unsigned char* N, size_t N_len,
+    unsigned char* P, size_t P_len, unsigned char* Q, size_t Q_len, unsigned char* D, size_t D_len,
+    unsigned char* E, size_t E_len) {
+    int ret = 0;
+    int is_priv;
+    RSA_VALIDATE_RET(ctx != NULL);
+
+    /* Check if key is private or public */
+    is_priv = mbedtls_mpi_cmp_int(&ctx->N, 0) != 0 && mbedtls_mpi_cmp_int(&ctx->P, 0) != 0 &&
+              mbedtls_mpi_cmp_int(&ctx->Q, 0) != 0 && mbedtls_mpi_cmp_int(&ctx->D, 0) != 0 &&
+              mbedtls_mpi_cmp_int(&ctx->E, 0) != 0;
+
+    if (!is_priv) {
+        /* If we're trying to export private parameters for a public key,
+         * something must be wrong. */
+        if (P != NULL || Q != NULL || D != NULL)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+
+    if (N != NULL)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_write_binary(&ctx->N, N, N_len));
+
+    if (P != NULL)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_write_binary(&ctx->P, P, P_len));
+
+    if (Q != NULL)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_write_binary(&ctx->Q, Q, Q_len));
+
+    if (D != NULL)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_write_binary(&ctx->D, D, D_len));
+
+    if (E != NULL)
+        MBEDTLS_MPI_CHK(mbedtls_mpi_write_binary(&ctx->E, E, E_len));
+
+cleanup:
+
+    return (ret);
+}
+
+int mbedtls_rsa_export(const mbedtls_rsa_context* ctx, mbedtls_mpi* N, mbedtls_mpi* P,
+    mbedtls_mpi* Q, mbedtls_mpi* D, mbedtls_mpi* E) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    int is_priv;
+    RSA_VALIDATE_RET(ctx != NULL);
+
+    /* Check if key is private or public */
+    is_priv = mbedtls_mpi_cmp_int(&ctx->N, 0) != 0 && mbedtls_mpi_cmp_int(&ctx->P, 0) != 0 &&
+              mbedtls_mpi_cmp_int(&ctx->Q, 0) != 0 && mbedtls_mpi_cmp_int(&ctx->D, 0) != 0 &&
+              mbedtls_mpi_cmp_int(&ctx->E, 0) != 0;
+
+    if (!is_priv) {
+        /* If we're trying to export private parameters for a public key,
+         * something must be wrong. */
+        if (P != NULL || Q != NULL || D != NULL)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+
+    /* Export all requested core parameters. */
+
+    if ((N != NULL && (ret = mbedtls_mpi_copy(N, &ctx->N)) != 0) ||
+        (P != NULL && (ret = mbedtls_mpi_copy(P, &ctx->P)) != 0) ||
+        (Q != NULL && (ret = mbedtls_mpi_copy(Q, &ctx->Q)) != 0) ||
+        (D != NULL && (ret = mbedtls_mpi_copy(D, &ctx->D)) != 0) ||
+        (E != NULL && (ret = mbedtls_mpi_copy(E, &ctx->E)) != 0)) {
+        return (ret);
+    }
+
+    return (0);
+}
+
+/*
+ * Export CRT parameters
+ * This must also be implemented if CRT is not used, for being able to
+ * write DER encoded RSA keys. The helper function mbedtls_rsa_deduce_crt
+ * can be used in this case.
+ */
+int mbedtls_rsa_export_crt(const mbedtls_rsa_context* ctx, mbedtls_mpi* DP, mbedtls_mpi* DQ,
+    mbedtls_mpi* QP) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    int is_priv;
+    RSA_VALIDATE_RET(ctx != NULL);
+
+    /* Check if key is private or public */
+    is_priv = mbedtls_mpi_cmp_int(&ctx->N, 0) != 0 && mbedtls_mpi_cmp_int(&ctx->P, 0) != 0 &&
+              mbedtls_mpi_cmp_int(&ctx->Q, 0) != 0 && mbedtls_mpi_cmp_int(&ctx->D, 0) != 0 &&
+              mbedtls_mpi_cmp_int(&ctx->E, 0) != 0;
+
+    if (!is_priv)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    /* Export all requested blinding parameters. */
+    if ((DP != NULL && (ret = mbedtls_mpi_copy(DP, &ctx->DP)) != 0) ||
+        (DQ != NULL && (ret = mbedtls_mpi_copy(DQ, &ctx->DQ)) != 0) ||
+        (QP != NULL && (ret = mbedtls_mpi_copy(QP, &ctx->QP)) != 0)) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_BAD_INPUT_DATA, ret));
+    }
+#else
+    if ((ret = mbedtls_rsa_deduce_crt(&ctx->P, &ctx->Q, &ctx->D, DP, DQ, QP)) != 0) {
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_BAD_INPUT_DATA, ret));
+    }
+#endif
+
+    return (0);
+}
+
+/*
+ * Initialize an RSA context
+ */
+void mbedtls_rsa_init(mbedtls_rsa_context* ctx) {
+    RSA_VALIDATE(ctx != NULL);
+
+    memset(ctx, 0, sizeof(mbedtls_rsa_context));
+
+    ctx->padding = MBEDTLS_RSA_PKCS_V15;
+    ctx->hash_id = MBEDTLS_MD_NONE;
+
+#if defined(MBEDTLS_THREADING_C)
+    /* Set ctx->ver to nonzero to indicate that the mutex has been
+     * initialized and will need to be freed. */
+    ctx->ver = 1;
+    mbedtls_mutex_init(&ctx->mutex);
+#endif
+}
+
+/*
+ * Set padding for an existing RSA context
+ */
+int mbedtls_rsa_set_padding(mbedtls_rsa_context* ctx, int padding, mbedtls_md_type_t hash_id) {
+    switch (padding) {
+#if defined(MBEDTLS_PKCS1_V15)
+    case MBEDTLS_RSA_PKCS_V15:
+        break;
+#endif
+
+#if defined(MBEDTLS_PKCS1_V21)
+    case MBEDTLS_RSA_PKCS_V21:
+        break;
+#endif
+    default:
+        return (MBEDTLS_ERR_RSA_INVALID_PADDING);
+    }
+
+    if ((padding == MBEDTLS_RSA_PKCS_V21) && (hash_id != MBEDTLS_MD_NONE)) {
+        const mbedtls_md_info_t* md_info;
+
+        md_info = mbedtls_md_info_from_type(hash_id);
+        if (md_info == NULL)
+            return (MBEDTLS_ERR_RSA_INVALID_PADDING);
+    }
+
+    ctx->padding = padding;
+    ctx->hash_id = hash_id;
+
+    return (0);
+}
+
+/*
+ * Get length in bytes of RSA modulus
+ */
+
+size_t mbedtls_rsa_get_len(const mbedtls_rsa_context* ctx) {
+    return (ctx->len);
+}
+
+#if defined(MBEDTLS_GENPRIME)
+
+/*
+ * Generate an RSA keypair
+ *
+ * This generation method follows the RSA key pair generation procedure of
+ * FIPS 186-4 if 2^16 < exponent < 2^256 and nbits = 2048 or nbits = 3072.
+ */
+int mbedtls_rsa_gen_key(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, unsigned int nbits, int exponent) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_mpi H, G, L;
+    int prime_quality = 0;
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(f_rng != NULL);
+
+    /*
+     * If the modulus is 1024 bit long or shorter, then the security strength of
+     * the RSA algorithm is less than or equal to 80 bits and therefore an error
+     * rate of 2^-80 is sufficient.
+     */
+    if (nbits > 1024)
+        prime_quality = MBEDTLS_MPI_GEN_PRIME_FLAG_LOW_ERR;
+
+    mbedtls_mpi_init(&H);
+    mbedtls_mpi_init(&G);
+    mbedtls_mpi_init(&L);
+
+    if (nbits < 128 || exponent < 3 || nbits % 2 != 0) {
+        ret = MBEDTLS_ERR_RSA_BAD_INPUT_DATA;
+        goto cleanup;
+    }
+
+    /*
+     * find primes P and Q with Q < P so that:
+     * 1.  |P-Q| > 2^( nbits / 2 - 100 )
+     * 2.  GCD( E, (P-1)*(Q-1) ) == 1
+     * 3.  E^-1 mod LCM(P-1, Q-1) > 2^( nbits / 2 )
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_lset(&ctx->E, exponent));
+
+    do {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_gen_prime(&ctx->P, nbits >> 1, prime_quality, f_rng, p_rng));
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_gen_prime(&ctx->Q, nbits >> 1, prime_quality, f_rng, p_rng));
+
+        /* make sure the difference between p and q is not too small (FIPS 186-4 §B.3.3 step 5.4) */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&H, &ctx->P, &ctx->Q));
+        if (mbedtls_mpi_bitlen(&H) <= ((nbits >= 200) ? ((nbits >> 1) - 99) : 0))
+            continue;
+
+        /* not required by any standards, but some users rely on the fact that P > Q */
+        if (H.s < 0)
+            mbedtls_mpi_swap(&ctx->P, &ctx->Q);
+
+        /* Temporarily replace P,Q by P-1, Q-1 */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&ctx->P, &ctx->P, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&ctx->Q, &ctx->Q, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&H, &ctx->P, &ctx->Q));
+
+        /* check GCD( E, (P-1)*(Q-1) ) == 1 (FIPS 186-4 §B.3.1 criterion 2(a)) */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_gcd(&G, &ctx->E, &H));
+        if (mbedtls_mpi_cmp_int(&G, 1) != 0)
+            continue;
+
+        /* compute smallest possible D = E^-1 mod LCM(P-1, Q-1) (FIPS 186-4 §B.3.1 criterion 3(b))
+         */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_gcd(&G, &ctx->P, &ctx->Q));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_div_mpi(&L, NULL, &H, &G));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_inv_mod(&ctx->D, &ctx->E, &L));
+
+        if (mbedtls_mpi_bitlen(&ctx->D) <= ((nbits + 1) / 2)) // (FIPS 186-4 §B.3.1 criterion 3(a))
+            continue;
+
+        break;
+    } while (1);
+
+    /* Restore P,Q */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_add_int(&ctx->P, &ctx->P, 1));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_add_int(&ctx->Q, &ctx->Q, 1));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&ctx->N, &ctx->P, &ctx->Q));
+
+    ctx->len = mbedtls_mpi_size(&ctx->N);
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    /*
+     * DP = D mod (P - 1)
+     * DQ = D mod (Q - 1)
+     * QP = Q^-1 mod P
+     */
+    MBEDTLS_MPI_CHK(
+        mbedtls_rsa_deduce_crt(&ctx->P, &ctx->Q, &ctx->D, &ctx->DP, &ctx->DQ, &ctx->QP));
+#endif /* MBEDTLS_RSA_NO_CRT */
+
+    /* Double-check */
+    MBEDTLS_MPI_CHK(mbedtls_rsa_check_privkey(ctx));
+
+cleanup:
+
+    mbedtls_mpi_free(&H);
+    mbedtls_mpi_free(&G);
+    mbedtls_mpi_free(&L);
+
+    if (ret != 0) {
+        mbedtls_rsa_free(ctx);
+
+        if ((-ret & ~0x7f) == 0)
+            ret = MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_KEY_GEN_FAILED, ret);
+        return (ret);
+    }
+
+    return (0);
+}
+
+#endif /* MBEDTLS_GENPRIME */
+
+/*
+ * Check a public RSA key
+ */
+int mbedtls_rsa_check_pubkey(const mbedtls_rsa_context* ctx) {
+    RSA_VALIDATE_RET(ctx != NULL);
+
+    if (rsa_check_context(ctx, 0 /* public */, 0 /* no blinding */) != 0)
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+
+    if (mbedtls_mpi_bitlen(&ctx->N) < 128) {
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+    }
+
+    if (mbedtls_mpi_get_bit(&ctx->E, 0) == 0 || mbedtls_mpi_bitlen(&ctx->E) < 2 ||
+        mbedtls_mpi_cmp_mpi(&ctx->E, &ctx->N) >= 0) {
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+    }
+
+    return (0);
+}
+
+/*
+ * Check for the consistency of all fields in an RSA private key context
+ */
+int mbedtls_rsa_check_privkey(const mbedtls_rsa_context* ctx) {
+    RSA_VALIDATE_RET(ctx != NULL);
+
+    if (mbedtls_rsa_check_pubkey(ctx) != 0 ||
+        rsa_check_context(ctx, 1 /* private */, 1 /* blinding */) != 0) {
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+    }
+
+    if (mbedtls_rsa_validate_params(&ctx->N, &ctx->P, &ctx->Q, &ctx->D, &ctx->E, NULL, NULL) != 0) {
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+    }
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    else if (mbedtls_rsa_validate_crt(&ctx->P, &ctx->Q, &ctx->D, &ctx->DP, &ctx->DQ, &ctx->QP) !=
+             0) {
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+    }
+#endif
+
+    return (0);
+}
+
+/*
+ * Check if contexts holding a public and private key match
+ */
+int mbedtls_rsa_check_pub_priv(const mbedtls_rsa_context* pub, const mbedtls_rsa_context* prv) {
+    RSA_VALIDATE_RET(pub != NULL);
+    RSA_VALIDATE_RET(prv != NULL);
+
+    if (mbedtls_rsa_check_pubkey(pub) != 0 || mbedtls_rsa_check_privkey(prv) != 0) {
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+    }
+
+    if (mbedtls_mpi_cmp_mpi(&pub->N, &prv->N) != 0 || mbedtls_mpi_cmp_mpi(&pub->E, &prv->E) != 0) {
+        return (MBEDTLS_ERR_RSA_KEY_CHECK_FAILED);
+    }
+
+    return (0);
+}
+
+/*
+ * Do an RSA public key operation
+ */
+int mbedtls_rsa_public(mbedtls_rsa_context* ctx, const unsigned char* input,
+    unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t olen;
+    mbedtls_mpi T;
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(input != NULL);
+    RSA_VALIDATE_RET(output != NULL);
+
+    if (rsa_check_context(ctx, 0 /* public */, 0 /* no blinding */))
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    mbedtls_mpi_init(&T);
+
+#if defined(MBEDTLS_THREADING_C)
+    if ((ret = mbedtls_mutex_lock(&ctx->mutex)) != 0)
+        return (ret);
+#endif
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_binary(&T, input, ctx->len));
+
+    if (mbedtls_mpi_cmp_mpi(&T, &ctx->N) >= 0) {
+        ret = MBEDTLS_ERR_MPI_BAD_INPUT_DATA;
+        goto cleanup;
+    }
+
+    olen = ctx->len;
+    MBEDTLS_MPI_CHK(mbedtls_mpi_exp_mod(&T, &T, &ctx->E, &ctx->N, &ctx->RN));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_write_binary(&T, output, olen));
+
+cleanup:
+#if defined(MBEDTLS_THREADING_C)
+    if (mbedtls_mutex_unlock(&ctx->mutex) != 0)
+        return (MBEDTLS_ERR_THREADING_MUTEX_ERROR);
+#endif
+
+    mbedtls_mpi_free(&T);
+
+    if (ret != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_PUBLIC_FAILED, ret));
+
+    return (0);
+}
+
+/*
+ * Generate or update blinding values, see section 10 of:
+ *  KOCHER, Paul C. Timing attacks on implementations of Diffie-Hellman, RSA,
+ *  DSS, and other systems. In : Advances in Cryptology-CRYPTO'96. Springer
+ *  Berlin Heidelberg, 1996. p. 104-113.
+ */
+static int rsa_prepare_blinding(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng) {
+    int ret, count = 0;
+    mbedtls_mpi R;
+
+    mbedtls_mpi_init(&R);
+
+    if (ctx->Vf.p != NULL) {
+        /* We already have blinding values, just update them by squaring */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&ctx->Vi, &ctx->Vi, &ctx->Vi));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&ctx->Vi, &ctx->Vi, &ctx->N));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&ctx->Vf, &ctx->Vf, &ctx->Vf));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&ctx->Vf, &ctx->Vf, &ctx->N));
+
+        goto cleanup;
+    }
+
+    /* Unblinding value: Vf = random number, invertible mod N */
+    do {
+        if (count++ > 10) {
+            ret = MBEDTLS_ERR_RSA_RNG_FAILED;
+            goto cleanup;
+        }
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_fill_random(&ctx->Vf, ctx->len - 1, f_rng, p_rng));
+
+        /* Compute Vf^-1 as R * (R Vf)^-1 to avoid leaks from inv_mod. */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_fill_random(&R, ctx->len - 1, f_rng, p_rng));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&ctx->Vi, &ctx->Vf, &R));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&ctx->Vi, &ctx->Vi, &ctx->N));
+
+        /* At this point, Vi is invertible mod N if and only if both Vf and R
+         * are invertible mod N. If one of them isn't, we don't need to know
+         * which one, we just loop and choose new values for both of them.
+         * (Each iteration succeeds with overwhelming probability.) */
+        ret = mbedtls_mpi_inv_mod(&ctx->Vi, &ctx->Vi, &ctx->N);
+        if (ret != 0 && ret != MBEDTLS_ERR_MPI_NOT_ACCEPTABLE)
+            goto cleanup;
+
+    } while (ret == MBEDTLS_ERR_MPI_NOT_ACCEPTABLE);
+
+    /* Finish the computation of Vf^-1 = R * (R Vf)^-1 */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&ctx->Vi, &ctx->Vi, &R));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&ctx->Vi, &ctx->Vi, &ctx->N));
+
+    /* Blinding value: Vi = Vf^(-e) mod N
+     * (Vi already contains Vf^-1 at this point) */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_exp_mod(&ctx->Vi, &ctx->Vi, &ctx->E, &ctx->N, &ctx->RN));
+
+cleanup:
+    mbedtls_mpi_free(&R);
+
+    return (ret);
+}
+
+/*
+ * Exponent blinding supposed to prevent side-channel attacks using multiple
+ * traces of measurements to recover the RSA key. The more collisions are there,
+ * the more bits of the key can be recovered. See [3].
+ *
+ * Collecting n collisions with m bit long blinding value requires 2^(m-m/n)
+ * observations on avarage.
+ *
+ * For example with 28 byte blinding to achieve 2 collisions the adversary has
+ * to make 2^112 observations on avarage.
+ *
+ * (With the currently (as of 2017 April) known best algorithms breaking 2048
+ * bit RSA requires approximately as much time as trying out 2^112 random keys.
+ * Thus in this sense with 28 byte blinding the security is not reduced by
+ * side-channel attacks like the one in [3])
+ *
+ * This countermeasure does not help if the key recovery is possible with a
+ * single trace.
+ */
+#define RSA_EXPONENT_BLINDING 28
+
+/*
+ * Do an RSA private key operation
+ */
+int mbedtls_rsa_private(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, const unsigned char* input, unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t olen;
+
+    /* Temporary holding the result */
+    mbedtls_mpi T;
+
+    /* Temporaries holding P-1, Q-1 and the
+     * exponent blinding factor, respectively. */
+    mbedtls_mpi P1, Q1, R;
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    /* Temporaries holding the results mod p resp. mod q. */
+    mbedtls_mpi TP, TQ;
+
+    /* Temporaries holding the blinded exponents for
+     * the mod p resp. mod q computation (if used). */
+    mbedtls_mpi DP_blind, DQ_blind;
+
+    /* Pointers to actual exponents to be used - either the unblinded
+     * or the blinded ones, depending on the presence of a PRNG. */
+    mbedtls_mpi* DP = &ctx->DP;
+    mbedtls_mpi* DQ = &ctx->DQ;
+#else
+    /* Temporary holding the blinded exponent (if used). */
+    mbedtls_mpi D_blind;
+
+    /* Pointer to actual exponent to be used - either the unblinded
+     * or the blinded one, depending on the presence of a PRNG. */
+    mbedtls_mpi* D = &ctx->D;
+#endif /* MBEDTLS_RSA_NO_CRT */
+
+    /* Temporaries holding the initial input and the double
+     * checked result; should be the same in the end. */
+    mbedtls_mpi I, C;
+
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(input != NULL);
+    RSA_VALIDATE_RET(output != NULL);
+
+    if (f_rng == NULL)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    if (rsa_check_context(ctx, 1 /* private key checks */, 1 /* blinding on        */) != 0) {
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+
+#if defined(MBEDTLS_THREADING_C)
+    if ((ret = mbedtls_mutex_lock(&ctx->mutex)) != 0)
+        return (ret);
+#endif
+
+    /* MPI Initialization */
+    mbedtls_mpi_init(&T);
+
+    mbedtls_mpi_init(&P1);
+    mbedtls_mpi_init(&Q1);
+    mbedtls_mpi_init(&R);
+
+#if defined(MBEDTLS_RSA_NO_CRT)
+    mbedtls_mpi_init(&D_blind);
+#else
+    mbedtls_mpi_init(&DP_blind);
+    mbedtls_mpi_init(&DQ_blind);
+#endif
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    mbedtls_mpi_init(&TP);
+    mbedtls_mpi_init(&TQ);
+#endif
+
+    mbedtls_mpi_init(&I);
+    mbedtls_mpi_init(&C);
+
+    /* End of MPI initialization */
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_binary(&T, input, ctx->len));
+    if (mbedtls_mpi_cmp_mpi(&T, &ctx->N) >= 0) {
+        ret = MBEDTLS_ERR_MPI_BAD_INPUT_DATA;
+        goto cleanup;
+    }
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&I, &T));
+
+    /*
+     * Blinding
+     * T = T * Vi mod N
+     */
+    MBEDTLS_MPI_CHK(rsa_prepare_blinding(ctx, f_rng, p_rng));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&T, &T, &ctx->Vi));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&T, &T, &ctx->N));
+
+    /*
+     * Exponent blinding
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&P1, &ctx->P, 1));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&Q1, &ctx->Q, 1));
+
+#if defined(MBEDTLS_RSA_NO_CRT)
+    /*
+     * D_blind = ( P - 1 ) * ( Q - 1 ) * R + D
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_fill_random(&R, RSA_EXPONENT_BLINDING, f_rng, p_rng));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&D_blind, &P1, &Q1));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&D_blind, &D_blind, &R));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(&D_blind, &D_blind, &ctx->D));
+
+    D = &D_blind;
+#else
+    /*
+     * DP_blind = ( P - 1 ) * R + DP
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_fill_random(&R, RSA_EXPONENT_BLINDING, f_rng, p_rng));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&DP_blind, &P1, &R));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(&DP_blind, &DP_blind, &ctx->DP));
+
+    DP = &DP_blind;
+
+    /*
+     * DQ_blind = ( Q - 1 ) * R + DQ
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_fill_random(&R, RSA_EXPONENT_BLINDING, f_rng, p_rng));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&DQ_blind, &Q1, &R));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(&DQ_blind, &DQ_blind, &ctx->DQ));
+
+    DQ = &DQ_blind;
+#endif /* MBEDTLS_RSA_NO_CRT */
+
+#if defined(MBEDTLS_RSA_NO_CRT)
+    MBEDTLS_MPI_CHK(mbedtls_mpi_exp_mod(&T, &T, D, &ctx->N, &ctx->RN));
+#else
+    /*
+     * Faster decryption using the CRT
+     *
+     * TP = input ^ dP mod P
+     * TQ = input ^ dQ mod Q
+     */
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_exp_mod(&TP, &T, DP, &ctx->P, &ctx->RP));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_exp_mod(&TQ, &T, DQ, &ctx->Q, &ctx->RQ));
+
+    /*
+     * T = (TP - TQ) * (Q^-1 mod P) mod P
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&T, &TP, &TQ));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&TP, &T, &ctx->QP));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&T, &TP, &ctx->P));
+
+    /*
+     * T = TQ + T * Q
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&TP, &T, &ctx->Q));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_add_mpi(&T, &TQ, &TP));
+#endif /* MBEDTLS_RSA_NO_CRT */
+
+    /*
+     * Unblind
+     * T = T * Vf mod N
+     */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&T, &T, &ctx->Vf));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&T, &T, &ctx->N));
+
+    /* Verify the result to prevent glitching attacks. */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_exp_mod(&C, &T, &ctx->E, &ctx->N, &ctx->RN));
+    if (mbedtls_mpi_cmp_mpi(&C, &I) != 0) {
+        ret = MBEDTLS_ERR_RSA_VERIFY_FAILED;
+        goto cleanup;
+    }
+
+    olen = ctx->len;
+    MBEDTLS_MPI_CHK(mbedtls_mpi_write_binary(&T, output, olen));
+
+cleanup:
+#if defined(MBEDTLS_THREADING_C)
+    if (mbedtls_mutex_unlock(&ctx->mutex) != 0)
+        return (MBEDTLS_ERR_THREADING_MUTEX_ERROR);
+#endif
+
+    mbedtls_mpi_free(&P1);
+    mbedtls_mpi_free(&Q1);
+    mbedtls_mpi_free(&R);
+
+#if defined(MBEDTLS_RSA_NO_CRT)
+    mbedtls_mpi_free(&D_blind);
+#else
+    mbedtls_mpi_free(&DP_blind);
+    mbedtls_mpi_free(&DQ_blind);
+#endif
+
+    mbedtls_mpi_free(&T);
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    mbedtls_mpi_free(&TP);
+    mbedtls_mpi_free(&TQ);
+#endif
+
+    mbedtls_mpi_free(&C);
+    mbedtls_mpi_free(&I);
+
+    if (ret != 0 && ret >= -0x007f)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_PRIVATE_FAILED, ret));
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_PKCS1_V21)
+/**
+ * Generate and apply the MGF1 operation (from PKCS#1 v2.1) to a buffer.
+ *
+ * \param dst       buffer to mask
+ * \param dlen      length of destination buffer
+ * \param src       source of the mask generation
+ * \param slen      length of the source buffer
+ * \param md_ctx    message digest context to use
+ */
+static int mgf_mask(unsigned char* dst, size_t dlen, unsigned char* src, size_t slen,
+    mbedtls_md_context_t* md_ctx) {
+    unsigned char mask[MBEDTLS_MD_MAX_SIZE];
+    unsigned char counter[4];
+    unsigned char* p;
+    unsigned int hlen;
+    size_t i, use_len;
+    int ret = 0;
+
+    memset(mask, 0, MBEDTLS_MD_MAX_SIZE);
+    memset(counter, 0, 4);
+
+    hlen = mbedtls_md_get_size(md_ctx->md_info);
+
+    /* Generate and apply dbMask */
+    p = dst;
+
+    while (dlen > 0) {
+        use_len = hlen;
+        if (dlen < hlen)
+            use_len = dlen;
+
+        if ((ret = mbedtls_md_starts(md_ctx)) != 0)
+            goto exit;
+        if ((ret = mbedtls_md_update(md_ctx, src, slen)) != 0)
+            goto exit;
+        if ((ret = mbedtls_md_update(md_ctx, counter, 4)) != 0)
+            goto exit;
+        if ((ret = mbedtls_md_finish(md_ctx, mask)) != 0)
+            goto exit;
+
+        for (i = 0; i < use_len; ++i)
+            *p++ ^= mask[i];
+
+        counter[3]++;
+
+        dlen -= use_len;
+    }
+
+exit:
+    mbedtls_platform_zeroize(mask, sizeof(mask));
+
+    return (ret);
+}
+#endif /* MBEDTLS_PKCS1_V21 */
+
+#if defined(MBEDTLS_PKCS1_V21)
+/*
+ * Implementation of the PKCS#1 v2.1 RSAES-OAEP-ENCRYPT function
+ */
+int mbedtls_rsa_rsaes_oaep_encrypt(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, const unsigned char* label,
+    size_t label_len, size_t ilen, const unsigned char* input, unsigned char* output) {
+    size_t olen;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char* p = output;
+    unsigned int hlen;
+    const mbedtls_md_info_t* md_info;
+    mbedtls_md_context_t md_ctx;
+
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(output != NULL);
+    RSA_VALIDATE_RET(ilen == 0 || input != NULL);
+    RSA_VALIDATE_RET(label_len == 0 || label != NULL);
+
+    if (f_rng == NULL)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    md_info = mbedtls_md_info_from_type((mbedtls_md_type_t)ctx->hash_id);
+    if (md_info == NULL)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    olen = ctx->len;
+    hlen = mbedtls_md_get_size(md_info);
+
+    /* first comparison checks for overflow */
+    if (ilen + 2 * hlen + 2 < ilen || olen < ilen + 2 * hlen + 2)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    memset(output, 0, olen);
+
+    *p++ = 0;
+
+    /* Generate a random octet string seed */
+    if ((ret = f_rng(p_rng, p, hlen)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_RNG_FAILED, ret));
+
+    p += hlen;
+
+    /* Construct DB */
+    if ((ret = mbedtls_md(md_info, label, label_len, p)) != 0)
+        return (ret);
+    p += hlen;
+    p += olen - 2 * hlen - 2 - ilen;
+    *p++ = 1;
+    if (ilen != 0)
+        memcpy(p, input, ilen);
+
+    mbedtls_md_init(&md_ctx);
+    if ((ret = mbedtls_md_setup(&md_ctx, md_info, 0)) != 0)
+        goto exit;
+
+    /* maskedDB: Apply dbMask to DB */
+    if ((ret = mgf_mask(output + hlen + 1, olen - hlen - 1, output + 1, hlen, &md_ctx)) != 0)
+        goto exit;
+
+    /* maskedSeed: Apply seedMask to seed */
+    if ((ret = mgf_mask(output + 1, hlen, output + hlen + 1, olen - hlen - 1, &md_ctx)) != 0)
+        goto exit;
+
+exit:
+    mbedtls_md_free(&md_ctx);
+
+    if (ret != 0)
+        return (ret);
+
+    return (mbedtls_rsa_public(ctx, output, output));
+}
+#endif /* MBEDTLS_PKCS1_V21 */
+
+#if defined(MBEDTLS_PKCS1_V15)
+/*
+ * Implementation of the PKCS#1 v2.1 RSAES-PKCS1-V1_5-ENCRYPT function
+ */
+int mbedtls_rsa_rsaes_pkcs1_v15_encrypt(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, size_t ilen,
+    const unsigned char* input, unsigned char* output) {
+    size_t nb_pad, olen;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char* p = output;
+
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(output != NULL);
+    RSA_VALIDATE_RET(ilen == 0 || input != NULL);
+
+    olen = ctx->len;
+
+    /* first comparison checks for overflow */
+    if (ilen + 11 < ilen || olen < ilen + 11)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    nb_pad = olen - 3 - ilen;
+
+    *p++ = 0;
+
+    if (f_rng == NULL)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    *p++ = MBEDTLS_RSA_CRYPT;
+
+    while (nb_pad-- > 0) {
+        int rng_dl = 100;
+
+        do {
+            ret = f_rng(p_rng, p, 1);
+        } while (*p == 0 && --rng_dl && ret == 0);
+
+        /* Check if RNG failed to generate data */
+        if (rng_dl == 0 || ret != 0)
+            return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_RNG_FAILED, ret));
+
+        p++;
+    }
+
+    *p++ = 0;
+    if (ilen != 0)
+        memcpy(p, input, ilen);
+
+    return (mbedtls_rsa_public(ctx, output, output));
+}
+#endif /* MBEDTLS_PKCS1_V15 */
+
+/*
+ * Add the message padding, then do an RSA operation
+ */
+int mbedtls_rsa_pkcs1_encrypt(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, size_t ilen, const unsigned char* input, unsigned char* output) {
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(output != NULL);
+    RSA_VALIDATE_RET(ilen == 0 || input != NULL);
+
+    switch (ctx->padding) {
+#if defined(MBEDTLS_PKCS1_V15)
+    case MBEDTLS_RSA_PKCS_V15:
+        return mbedtls_rsa_rsaes_pkcs1_v15_encrypt(ctx, f_rng, p_rng, ilen, input, output);
+#endif
+
+#if defined(MBEDTLS_PKCS1_V21)
+    case MBEDTLS_RSA_PKCS_V21:
+        return mbedtls_rsa_rsaes_oaep_encrypt(ctx, f_rng, p_rng, NULL, 0, ilen, input, output);
+#endif
+
+    default:
+        return (MBEDTLS_ERR_RSA_INVALID_PADDING);
+    }
+}
+
+#if defined(MBEDTLS_PKCS1_V21)
+/*
+ * Implementation of the PKCS#1 v2.1 RSAES-OAEP-DECRYPT function
+ */
+int mbedtls_rsa_rsaes_oaep_decrypt(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, const unsigned char* label,
+    size_t label_len, size_t* olen, const unsigned char* input, unsigned char* output,
+    size_t output_max_len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t ilen, i, pad_len;
+    unsigned char *p, bad, pad_done;
+    unsigned char buf[MBEDTLS_MPI_MAX_SIZE];
+    unsigned char lhash[MBEDTLS_MD_MAX_SIZE];
+    unsigned int hlen;
+    const mbedtls_md_info_t* md_info;
+    mbedtls_md_context_t md_ctx;
+
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(output_max_len == 0 || output != NULL);
+    RSA_VALIDATE_RET(label_len == 0 || label != NULL);
+    RSA_VALIDATE_RET(input != NULL);
+    RSA_VALIDATE_RET(olen != NULL);
+
+    /*
+     * Parameters sanity checks
+     */
+    if (ctx->padding != MBEDTLS_RSA_PKCS_V21)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    ilen = ctx->len;
+
+    if (ilen < 16 || ilen > sizeof(buf))
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    md_info = mbedtls_md_info_from_type((mbedtls_md_type_t)ctx->hash_id);
+    if (md_info == NULL)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    hlen = mbedtls_md_get_size(md_info);
+
+    // checking for integer underflow
+    if (2 * hlen + 2 > ilen)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    /*
+     * RSA operation
+     */
+    ret = mbedtls_rsa_private(ctx, f_rng, p_rng, input, buf);
+
+    if (ret != 0)
+        goto cleanup;
+
+    /*
+     * Unmask data and generate lHash
+     */
+    mbedtls_md_init(&md_ctx);
+    if ((ret = mbedtls_md_setup(&md_ctx, md_info, 0)) != 0) {
+        mbedtls_md_free(&md_ctx);
+        goto cleanup;
+    }
+
+    /* seed: Apply seedMask to maskedSeed */
+    if ((ret = mgf_mask(buf + 1, hlen, buf + hlen + 1, ilen - hlen - 1, &md_ctx)) != 0 ||
+        /* DB: Apply dbMask to maskedDB */
+        (ret = mgf_mask(buf + hlen + 1, ilen - hlen - 1, buf + 1, hlen, &md_ctx)) != 0) {
+        mbedtls_md_free(&md_ctx);
+        goto cleanup;
+    }
+
+    mbedtls_md_free(&md_ctx);
+
+    /* Generate lHash */
+    if ((ret = mbedtls_md(md_info, label, label_len, lhash)) != 0)
+        goto cleanup;
+
+    /*
+     * Check contents, in "constant-time"
+     */
+    p = buf;
+    bad = 0;
+
+    bad |= *p++; /* First byte must be 0 */
+
+    p += hlen; /* Skip seed */
+
+    /* Check lHash */
+    for (i = 0; i < hlen; i++)
+        bad |= lhash[i] ^ *p++;
+
+    /* Get zero-padding len, but always read till end of buffer
+     * (minus one, for the 01 byte) */
+    pad_len = 0;
+    pad_done = 0;
+    for (i = 0; i < ilen - 2 * hlen - 2; i++) {
+        pad_done |= p[i];
+        pad_len += ((pad_done | (unsigned char)-pad_done) >> 7) ^ 1;
+    }
+
+    p += pad_len;
+    bad |= *p++ ^ 0x01;
+
+    /*
+     * The only information "leaked" is whether the padding was correct or not
+     * (eg, no data is copied if it was not correct). This meets the
+     * recommendations in PKCS#1 v2.2: an opponent cannot distinguish between
+     * the different error conditions.
+     */
+    if (bad != 0) {
+        ret = MBEDTLS_ERR_RSA_INVALID_PADDING;
+        goto cleanup;
+    }
+
+    if (ilen - (p - buf) > output_max_len) {
+        ret = MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE;
+        goto cleanup;
+    }
+
+    *olen = ilen - (p - buf);
+    if (*olen != 0)
+        memcpy(output, p, *olen);
+    ret = 0;
+
+cleanup:
+    mbedtls_platform_zeroize(buf, sizeof(buf));
+    mbedtls_platform_zeroize(lhash, sizeof(lhash));
+
+    return (ret);
+}
+#endif /* MBEDTLS_PKCS1_V21 */
+
+#if defined(MBEDTLS_PKCS1_V15)
+/*
+ * Implementation of the PKCS#1 v2.1 RSAES-PKCS1-V1_5-DECRYPT function
+ */
+int mbedtls_rsa_rsaes_pkcs1_v15_decrypt(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, size_t* olen,
+    const unsigned char* input, unsigned char* output, size_t output_max_len) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t ilen;
+    unsigned char buf[MBEDTLS_MPI_MAX_SIZE];
+
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(output_max_len == 0 || output != NULL);
+    RSA_VALIDATE_RET(input != NULL);
+    RSA_VALIDATE_RET(olen != NULL);
+
+    ilen = ctx->len;
+
+    if (ctx->padding != MBEDTLS_RSA_PKCS_V15)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    if (ilen < 16 || ilen > sizeof(buf))
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    ret = mbedtls_rsa_private(ctx, f_rng, p_rng, input, buf);
+
+    if (ret != 0)
+        goto cleanup;
+
+    ret = mbedtls_ct_rsaes_pkcs1_v15_unpadding(buf, ilen, output, output_max_len, olen);
+
+cleanup:
+    mbedtls_platform_zeroize(buf, sizeof(buf));
+
+    return (ret);
+}
+#endif /* MBEDTLS_PKCS1_V15 */
+
+/*
+ * Do an RSA operation, then remove the message padding
+ */
+int mbedtls_rsa_pkcs1_decrypt(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, size_t* olen, const unsigned char* input, unsigned char* output,
+    size_t output_max_len) {
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(output_max_len == 0 || output != NULL);
+    RSA_VALIDATE_RET(input != NULL);
+    RSA_VALIDATE_RET(olen != NULL);
+
+    switch (ctx->padding) {
+#if defined(MBEDTLS_PKCS1_V15)
+    case MBEDTLS_RSA_PKCS_V15:
+        return mbedtls_rsa_rsaes_pkcs1_v15_decrypt(ctx, f_rng, p_rng, olen, input, output,
+            output_max_len);
+#endif
+
+#if defined(MBEDTLS_PKCS1_V21)
+    case MBEDTLS_RSA_PKCS_V21:
+        return mbedtls_rsa_rsaes_oaep_decrypt(ctx, f_rng, p_rng, NULL, 0, olen, input, output,
+            output_max_len);
+#endif
+
+    default:
+        return (MBEDTLS_ERR_RSA_INVALID_PADDING);
+    }
+}
+
+#if defined(MBEDTLS_PKCS1_V21)
+static int rsa_rsassa_pss_sign(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, int saltlen, unsigned char* sig) {
+    size_t olen;
+    unsigned char* p = sig;
+    unsigned char* salt = NULL;
+    size_t slen, min_slen, hlen, offset = 0;
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t msb;
+    const mbedtls_md_info_t* md_info;
+    mbedtls_md_context_t md_ctx;
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hashlen == 0) || hash != NULL);
+    RSA_VALIDATE_RET(sig != NULL);
+
+    if (ctx->padding != MBEDTLS_RSA_PKCS_V21)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    if (f_rng == NULL)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    olen = ctx->len;
+
+    if (md_alg != MBEDTLS_MD_NONE) {
+        /* Gather length of hash to sign */
+        md_info = mbedtls_md_info_from_type(md_alg);
+        if (md_info == NULL)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+        if (hashlen != mbedtls_md_get_size(md_info))
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+
+    md_info = mbedtls_md_info_from_type((mbedtls_md_type_t)ctx->hash_id);
+    if (md_info == NULL)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    hlen = mbedtls_md_get_size(md_info);
+
+    if (saltlen == MBEDTLS_RSA_SALT_LEN_ANY) {
+        /* Calculate the largest possible salt length, up to the hash size.
+         * Normally this is the hash length, which is the maximum salt length
+         * according to FIPS 185-4 §5.5 (e) and common practice. If there is not
+         * enough room, use the maximum salt length that fits. The constraint is
+         * that the hash length plus the salt length plus 2 bytes must be at most
+         * the key length. This complies with FIPS 186-4 §5.5 (e) and RFC 8017
+         * (PKCS#1 v2.2) §9.1.1 step 3. */
+        min_slen = hlen - 2;
+        if (olen < hlen + min_slen + 2)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+        else if (olen >= hlen + hlen + 2)
+            slen = hlen;
+        else
+            slen = olen - hlen - 2;
+    } else if ((saltlen < 0) || (saltlen + hlen + 2 > olen)) {
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    } else {
+        slen = (size_t)saltlen;
+    }
+
+    memset(sig, 0, olen);
+
+    /* Note: EMSA-PSS encoding is over the length of N - 1 bits */
+    msb = mbedtls_mpi_bitlen(&ctx->N) - 1;
+    p += olen - hlen - slen - 2;
+    *p++ = 0x01;
+
+    /* Generate salt of length slen in place in the encoded message */
+    salt = p;
+    if ((ret = f_rng(p_rng, salt, slen)) != 0)
+        return (MBEDTLS_ERROR_ADD(MBEDTLS_ERR_RSA_RNG_FAILED, ret));
+
+    p += slen;
+
+    mbedtls_md_init(&md_ctx);
+    if ((ret = mbedtls_md_setup(&md_ctx, md_info, 0)) != 0)
+        goto exit;
+
+    /* Generate H = Hash( M' ) */
+    if ((ret = mbedtls_md_starts(&md_ctx)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md_update(&md_ctx, p, 8)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md_update(&md_ctx, hash, hashlen)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md_update(&md_ctx, salt, slen)) != 0)
+        goto exit;
+    if ((ret = mbedtls_md_finish(&md_ctx, p)) != 0)
+        goto exit;
+
+    /* Compensate for boundary condition when applying mask */
+    if (msb % 8 == 0)
+        offset = 1;
+
+    /* maskedDB: Apply dbMask to DB */
+    if ((ret = mgf_mask(sig + offset, olen - hlen - 1 - offset, p, hlen, &md_ctx)) != 0)
+        goto exit;
+
+    msb = mbedtls_mpi_bitlen(&ctx->N) - 1;
+    sig[0] &= 0xFF >> (olen * 8 - msb);
+
+    p += hlen;
+    *p++ = 0xBC;
+
+exit:
+    mbedtls_md_free(&md_ctx);
+
+    if (ret != 0)
+        return (ret);
+
+    return mbedtls_rsa_private(ctx, f_rng, p_rng, sig, sig);
+}
+
+/*
+ * Implementation of the PKCS#1 v2.1 RSASSA-PSS-SIGN function with
+ * the option to pass in the salt length.
+ */
+int mbedtls_rsa_rsassa_pss_sign_ext(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, int saltlen, unsigned char* sig) {
+    return rsa_rsassa_pss_sign(ctx, f_rng, p_rng, md_alg, hashlen, hash, saltlen, sig);
+}
+
+/*
+ * Implementation of the PKCS#1 v2.1 RSASSA-PSS-SIGN function
+ */
+int mbedtls_rsa_rsassa_pss_sign(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, unsigned char* sig) {
+    return rsa_rsassa_pss_sign(ctx, f_rng, p_rng, md_alg, hashlen, hash, MBEDTLS_RSA_SALT_LEN_ANY,
+        sig);
+}
+#endif /* MBEDTLS_PKCS1_V21 */
+
+#if defined(MBEDTLS_PKCS1_V15)
+/*
+ * Implementation of the PKCS#1 v2.1 RSASSA-PKCS1-V1_5-SIGN function
+ */
+
+/* Construct a PKCS v1.5 encoding of a hashed message
+ *
+ * This is used both for signature generation and verification.
+ *
+ * Parameters:
+ * - md_alg:  Identifies the hash algorithm used to generate the given hash;
+ *            MBEDTLS_MD_NONE if raw data is signed.
+ * - hashlen: Length of hash. Must match md_alg if that's not NONE.
+ * - hash:    Buffer containing the hashed message or the raw data.
+ * - dst_len: Length of the encoded message.
+ * - dst:     Buffer to hold the encoded message.
+ *
+ * Assumptions:
+ * - hash has size hashlen.
+ * - dst points to a buffer of size at least dst_len.
+ *
+ */
+static int rsa_rsassa_pkcs1_v15_encode(mbedtls_md_type_t md_alg, unsigned int hashlen,
+    const unsigned char* hash, size_t dst_len, unsigned char* dst) {
+    size_t oid_size = 0;
+    size_t nb_pad = dst_len;
+    unsigned char* p = dst;
+    const char* oid = NULL;
+
+    /* Are we signing hashed or raw data? */
+    if (md_alg != MBEDTLS_MD_NONE) {
+        const mbedtls_md_info_t* md_info = mbedtls_md_info_from_type(md_alg);
+        if (md_info == NULL)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+        if (mbedtls_oid_get_oid_by_md(md_alg, &oid, &oid_size) != 0)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+        if (hashlen != mbedtls_md_get_size(md_info))
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+        /* Double-check that 8 + hashlen + oid_size can be used as a
+         * 1-byte ASN.1 length encoding and that there's no overflow. */
+        if (8 + hashlen + oid_size >= 0x80 || 10 + hashlen < hashlen ||
+            10 + hashlen + oid_size < 10 + hashlen)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+        /*
+         * Static bounds check:
+         * - Need 10 bytes for five tag-length pairs.
+         *   (Insist on 1-byte length encodings to protect against variants of
+         *    Bleichenbacher's forgery attack against lax PKCS#1v1.5 verification)
+         * - Need hashlen bytes for hash
+         * - Need oid_size bytes for hash alg OID.
+         */
+        if (nb_pad < 10 + hashlen + oid_size)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+        nb_pad -= 10 + hashlen + oid_size;
+    } else {
+        if (nb_pad < hashlen)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+        nb_pad -= hashlen;
+    }
+
+    /* Need space for signature header and padding delimiter (3 bytes),
+     * and 8 bytes for the minimal padding */
+    if (nb_pad < 3 + 8)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    nb_pad -= 3;
+
+    /* Now nb_pad is the amount of memory to be filled
+     * with padding, and at least 8 bytes long. */
+
+    /* Write signature header and padding */
+    *p++ = 0;
+    *p++ = MBEDTLS_RSA_SIGN;
+    memset(p, 0xFF, nb_pad);
+    p += nb_pad;
+    *p++ = 0;
+
+    /* Are we signing raw data? */
+    if (md_alg == MBEDTLS_MD_NONE) {
+        memcpy(p, hash, hashlen);
+        return (0);
+    }
+
+    /* Signing hashed data, add corresponding ASN.1 structure
+     *
+     * DigestInfo ::= SEQUENCE {
+     *   digestAlgorithm DigestAlgorithmIdentifier,
+     *   digest Digest }
+     * DigestAlgorithmIdentifier ::= AlgorithmIdentifier
+     * Digest ::= OCTET STRING
+     *
+     * Schematic:
+     * TAG-SEQ + LEN [ TAG-SEQ + LEN [ TAG-OID  + LEN [ OID  ]
+     *                                 TAG-NULL + LEN [ NULL ] ]
+     *                 TAG-OCTET + LEN [ HASH ] ]
+     */
+    *p++ = MBEDTLS_ASN1_SEQUENCE | MBEDTLS_ASN1_CONSTRUCTED;
+    *p++ = (unsigned char)(0x08 + oid_size + hashlen);
+    *p++ = MBEDTLS_ASN1_SEQUENCE | MBEDTLS_ASN1_CONSTRUCTED;
+    *p++ = (unsigned char)(0x04 + oid_size);
+    *p++ = MBEDTLS_ASN1_OID;
+    *p++ = (unsigned char)oid_size;
+    memcpy(p, oid, oid_size);
+    p += oid_size;
+    *p++ = MBEDTLS_ASN1_NULL;
+    *p++ = 0x00;
+    *p++ = MBEDTLS_ASN1_OCTET_STRING;
+    *p++ = (unsigned char)hashlen;
+    memcpy(p, hash, hashlen);
+    p += hashlen;
+
+    /* Just a sanity-check, should be automatic
+     * after the initial bounds check. */
+    if (p != dst + dst_len) {
+        mbedtls_platform_zeroize(dst, dst_len);
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+
+    return (0);
+}
+
+/*
+ * Do an RSA operation to sign the message digest
+ */
+int mbedtls_rsa_rsassa_pkcs1_v15_sign(mbedtls_rsa_context* ctx,
+    int (*f_rng)(void*, unsigned char*, size_t), void* p_rng, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, unsigned char* sig) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned char *sig_try = NULL, *verif = NULL;
+
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hashlen == 0) || hash != NULL);
+    RSA_VALIDATE_RET(sig != NULL);
+
+    if (ctx->padding != MBEDTLS_RSA_PKCS_V15)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    /*
+     * Prepare PKCS1-v1.5 encoding (padding and hash identifier)
+     */
+
+    if ((ret = rsa_rsassa_pkcs1_v15_encode(md_alg, hashlen, hash, ctx->len, sig)) != 0)
+        return (ret);
+
+    /* Private key operation
+     *
+     * In order to prevent Lenstra's attack, make the signature in a
+     * temporary buffer and check it before returning it.
+     */
+
+    sig_try = (unsigned char*)mbedtls_calloc(1, ctx->len);
+    if (sig_try == NULL)
+        return (MBEDTLS_ERR_MPI_ALLOC_FAILED);
+
+    verif = (unsigned char*)mbedtls_calloc(1, ctx->len);
+    if (verif == NULL) {
+        mbedtls_free(sig_try);
+        return (MBEDTLS_ERR_MPI_ALLOC_FAILED);
+    }
+
+    MBEDTLS_MPI_CHK(mbedtls_rsa_private(ctx, f_rng, p_rng, sig, sig_try));
+    MBEDTLS_MPI_CHK(mbedtls_rsa_public(ctx, sig_try, verif));
+
+    if (mbedtls_ct_memcmp(verif, sig, ctx->len) != 0) {
+        ret = MBEDTLS_ERR_RSA_PRIVATE_FAILED;
+        goto cleanup;
+    }
+
+    memcpy(sig, sig_try, ctx->len);
+
+cleanup:
+    mbedtls_platform_zeroize(sig_try, ctx->len);
+    mbedtls_platform_zeroize(verif, ctx->len);
+    mbedtls_free(sig_try);
+    mbedtls_free(verif);
+
+    if (ret != 0)
+        memset(sig, '!', ctx->len);
+    return (ret);
+}
+#endif /* MBEDTLS_PKCS1_V15 */
+
+/*
+ * Do an RSA operation to sign the message digest
+ */
+int mbedtls_rsa_pkcs1_sign(mbedtls_rsa_context* ctx, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng, mbedtls_md_type_t md_alg, unsigned int hashlen, const unsigned char* hash,
+    unsigned char* sig) {
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hashlen == 0) || hash != NULL);
+    RSA_VALIDATE_RET(sig != NULL);
+
+    switch (ctx->padding) {
+#if defined(MBEDTLS_PKCS1_V15)
+    case MBEDTLS_RSA_PKCS_V15:
+        return mbedtls_rsa_rsassa_pkcs1_v15_sign(ctx, f_rng, p_rng, md_alg, hashlen, hash, sig);
+#endif
+
+#if defined(MBEDTLS_PKCS1_V21)
+    case MBEDTLS_RSA_PKCS_V21:
+        return mbedtls_rsa_rsassa_pss_sign(ctx, f_rng, p_rng, md_alg, hashlen, hash, sig);
+#endif
+
+    default:
+        return (MBEDTLS_ERR_RSA_INVALID_PADDING);
+    }
+}
+
+#if defined(MBEDTLS_PKCS1_V21)
+/*
+ * Implementation of the PKCS#1 v2.1 RSASSA-PSS-VERIFY function
+ */
+int mbedtls_rsa_rsassa_pss_verify_ext(mbedtls_rsa_context* ctx, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, mbedtls_md_type_t mgf1_hash_id,
+    int expected_salt_len, const unsigned char* sig) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t siglen;
+    unsigned char* p;
+    unsigned char* hash_start;
+    unsigned char result[MBEDTLS_MD_MAX_SIZE];
+    unsigned char zeros[8];
+    unsigned int hlen;
+    size_t observed_salt_len, msb;
+    const mbedtls_md_info_t* md_info;
+    mbedtls_md_context_t md_ctx;
+    unsigned char buf[MBEDTLS_MPI_MAX_SIZE];
+
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(sig != NULL);
+    RSA_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hashlen == 0) || hash != NULL);
+
+    siglen = ctx->len;
+
+    if (siglen < 16 || siglen > sizeof(buf))
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    ret = mbedtls_rsa_public(ctx, sig, buf);
+
+    if (ret != 0)
+        return (ret);
+
+    p = buf;
+
+    if (buf[siglen - 1] != 0xBC)
+        return (MBEDTLS_ERR_RSA_INVALID_PADDING);
+
+    if (md_alg != MBEDTLS_MD_NONE) {
+        /* Gather length of hash to sign */
+        md_info = mbedtls_md_info_from_type(md_alg);
+        if (md_info == NULL)
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+        if (hashlen != mbedtls_md_get_size(md_info))
+            return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    }
+
+    md_info = mbedtls_md_info_from_type(mgf1_hash_id);
+    if (md_info == NULL)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    hlen = mbedtls_md_get_size(md_info);
+
+    memset(zeros, 0, 8);
+
+    /*
+     * Note: EMSA-PSS verification is over the length of N - 1 bits
+     */
+    msb = mbedtls_mpi_bitlen(&ctx->N) - 1;
+
+    if (buf[0] >> (8 - siglen * 8 + msb))
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+
+    /* Compensate for boundary condition when applying mask */
+    if (msb % 8 == 0) {
+        p++;
+        siglen -= 1;
+    }
+
+    if (siglen < hlen + 2)
+        return (MBEDTLS_ERR_RSA_BAD_INPUT_DATA);
+    hash_start = p + siglen - hlen - 1;
+
+    mbedtls_md_init(&md_ctx);
+    if ((ret = mbedtls_md_setup(&md_ctx, md_info, 0)) != 0)
+        goto exit;
+
+    ret = mgf_mask(p, siglen - hlen - 1, hash_start, hlen, &md_ctx);
+    if (ret != 0)
+        goto exit;
+
+    buf[0] &= 0xFF >> (siglen * 8 - msb);
+
+    while (p < hash_start - 1 && *p == 0)
+        p++;
+
+    if (*p++ != 0x01) {
+        ret = MBEDTLS_ERR_RSA_INVALID_PADDING;
+        goto exit;
+    }
+
+    observed_salt_len = hash_start - p;
+
+    if (expected_salt_len != MBEDTLS_RSA_SALT_LEN_ANY &&
+        observed_salt_len != (size_t)expected_salt_len) {
+        ret = MBEDTLS_ERR_RSA_INVALID_PADDING;
+        goto exit;
+    }
+
+    /*
+     * Generate H = Hash( M' )
+     */
+    ret = mbedtls_md_starts(&md_ctx);
+    if (ret != 0)
+        goto exit;
+    ret = mbedtls_md_update(&md_ctx, zeros, 8);
+    if (ret != 0)
+        goto exit;
+    ret = mbedtls_md_update(&md_ctx, hash, hashlen);
+    if (ret != 0)
+        goto exit;
+    ret = mbedtls_md_update(&md_ctx, p, observed_salt_len);
+    if (ret != 0)
+        goto exit;
+    ret = mbedtls_md_finish(&md_ctx, result);
+    if (ret != 0)
+        goto exit;
+
+    if (memcmp(hash_start, result, hlen) != 0) {
+        ret = MBEDTLS_ERR_RSA_VERIFY_FAILED;
+        goto exit;
+    }
+
+exit:
+    mbedtls_md_free(&md_ctx);
+
+    return (ret);
+}
+
+/*
+ * Simplified PKCS#1 v2.1 RSASSA-PSS-VERIFY function
+ */
+int mbedtls_rsa_rsassa_pss_verify(mbedtls_rsa_context* ctx, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, const unsigned char* sig) {
+    mbedtls_md_type_t mgf1_hash_id;
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(sig != NULL);
+    RSA_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hashlen == 0) || hash != NULL);
+
+    mgf1_hash_id = (ctx->hash_id != MBEDTLS_MD_NONE) ? (mbedtls_md_type_t)ctx->hash_id : md_alg;
+
+    return (mbedtls_rsa_rsassa_pss_verify_ext(ctx, md_alg, hashlen, hash, mgf1_hash_id,
+        MBEDTLS_RSA_SALT_LEN_ANY, sig));
+}
+#endif /* MBEDTLS_PKCS1_V21 */
+
+#if defined(MBEDTLS_PKCS1_V15)
+/*
+ * Implementation of the PKCS#1 v2.1 RSASSA-PKCS1-v1_5-VERIFY function
+ */
+int mbedtls_rsa_rsassa_pkcs1_v15_verify(mbedtls_rsa_context* ctx, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, const unsigned char* sig) {
+    int ret = 0;
+    size_t sig_len;
+    unsigned char *encoded = NULL, *encoded_expected = NULL;
+
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(sig != NULL);
+    RSA_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hashlen == 0) || hash != NULL);
+
+    sig_len = ctx->len;
+
+    /*
+     * Prepare expected PKCS1 v1.5 encoding of hash.
+     */
+
+    if ((encoded = (unsigned char*)mbedtls_calloc(1, sig_len)) == NULL ||
+        (encoded_expected = (unsigned char*)mbedtls_calloc(1, sig_len)) == NULL) {
+        ret = MBEDTLS_ERR_MPI_ALLOC_FAILED;
+        goto cleanup;
+    }
+
+    if ((ret = rsa_rsassa_pkcs1_v15_encode(md_alg, hashlen, hash, sig_len, encoded_expected)) != 0)
+        goto cleanup;
+
+    /*
+     * Apply RSA primitive to get what should be PKCS1 encoded hash.
+     */
+
+    ret = mbedtls_rsa_public(ctx, sig, encoded);
+    if (ret != 0)
+        goto cleanup;
+
+    /*
+     * Compare
+     */
+
+    if ((ret = mbedtls_ct_memcmp(encoded, encoded_expected, sig_len)) != 0) {
+        ret = MBEDTLS_ERR_RSA_VERIFY_FAILED;
+        goto cleanup;
+    }
+
+cleanup:
+
+    if (encoded != NULL) {
+        mbedtls_platform_zeroize(encoded, sig_len);
+        mbedtls_free(encoded);
+    }
+
+    if (encoded_expected != NULL) {
+        mbedtls_platform_zeroize(encoded_expected, sig_len);
+        mbedtls_free(encoded_expected);
+    }
+
+    return (ret);
+}
+#endif /* MBEDTLS_PKCS1_V15 */
+
+/*
+ * Do an RSA operation and check the message digest
+ */
+int mbedtls_rsa_pkcs1_verify(mbedtls_rsa_context* ctx, mbedtls_md_type_t md_alg,
+    unsigned int hashlen, const unsigned char* hash, const unsigned char* sig) {
+    RSA_VALIDATE_RET(ctx != NULL);
+    RSA_VALIDATE_RET(sig != NULL);
+    RSA_VALIDATE_RET((md_alg == MBEDTLS_MD_NONE && hashlen == 0) || hash != NULL);
+
+    switch (ctx->padding) {
+#if defined(MBEDTLS_PKCS1_V15)
+    case MBEDTLS_RSA_PKCS_V15:
+        return mbedtls_rsa_rsassa_pkcs1_v15_verify(ctx, md_alg, hashlen, hash, sig);
+#endif
+
+#if defined(MBEDTLS_PKCS1_V21)
+    case MBEDTLS_RSA_PKCS_V21:
+        return mbedtls_rsa_rsassa_pss_verify(ctx, md_alg, hashlen, hash, sig);
+#endif
+
+    default:
+        return (MBEDTLS_ERR_RSA_INVALID_PADDING);
+    }
+}
+
+/*
+ * Copy the components of an RSA key
+ */
+int mbedtls_rsa_copy(mbedtls_rsa_context* dst, const mbedtls_rsa_context* src) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    RSA_VALIDATE_RET(dst != NULL);
+    RSA_VALIDATE_RET(src != NULL);
+
+    dst->len = src->len;
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->N, &src->N));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->E, &src->E));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->D, &src->D));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->P, &src->P));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->Q, &src->Q));
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->DP, &src->DP));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->DQ, &src->DQ));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->QP, &src->QP));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->RP, &src->RP));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->RQ, &src->RQ));
+#endif
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->RN, &src->RN));
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->Vi, &src->Vi));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&dst->Vf, &src->Vf));
+
+    dst->padding = src->padding;
+    dst->hash_id = src->hash_id;
+
+cleanup:
+    if (ret != 0)
+        mbedtls_rsa_free(dst);
+
+    return (ret);
+}
+
+/*
+ * Free the components of an RSA key
+ */
+void mbedtls_rsa_free(mbedtls_rsa_context* ctx) {
+    if (ctx == NULL)
+        return;
+
+    mbedtls_mpi_free(&ctx->Vi);
+    mbedtls_mpi_free(&ctx->Vf);
+    mbedtls_mpi_free(&ctx->RN);
+    mbedtls_mpi_free(&ctx->D);
+    mbedtls_mpi_free(&ctx->Q);
+    mbedtls_mpi_free(&ctx->P);
+    mbedtls_mpi_free(&ctx->E);
+    mbedtls_mpi_free(&ctx->N);
+
+#if !defined(MBEDTLS_RSA_NO_CRT)
+    mbedtls_mpi_free(&ctx->RQ);
+    mbedtls_mpi_free(&ctx->RP);
+    mbedtls_mpi_free(&ctx->QP);
+    mbedtls_mpi_free(&ctx->DQ);
+    mbedtls_mpi_free(&ctx->DP);
+#endif /* MBEDTLS_RSA_NO_CRT */
+
+#if defined(MBEDTLS_THREADING_C)
+    /* Free the mutex, but only if it hasn't been freed already. */
+    if (ctx->ver != 0) {
+        mbedtls_mutex_free(&ctx->mutex);
+        ctx->ver = 0;
+    }
+#endif
+}
+
+#endif /* !MBEDTLS_RSA_ALT */
+
+#if defined(MBEDTLS_SELF_TEST)
+
+#include "mbedtls/sha1.h"
+
+/*
+ * Example RSA-1024 keypair, for test purposes
+ */
+#define KEY_LEN 128
+
+#define RSA_N                                                                                      \
+    "9292758453063D803DD603D5E777D788"                                                             \
+    "8ED1D5BF35786190FA2F23EBC0848AEA"                                                             \
+    "DDA92CA6C3D80B32C4D109BE0F36D6AE"                                                             \
+    "7130B9CED7ACDF54CFC7555AC14EEBAB"                                                             \
+    "93A89813FBF3C4F8066D2D800F7C38A8"                                                             \
+    "1AE31942917403FF4946B0A83D3D3E05"                                                             \
+    "EE57C6F5F5606FB5D4BC6CD34EE0801A"                                                             \
+    "5E94BB77B07507233A0BC7BAC8F90F79"
+
+#define RSA_E "10001"
+
+#define RSA_D                                                                                      \
+    "24BF6185468786FDD303083D25E64EFC"                                                             \
+    "66CA472BC44D253102F8B4A9D3BFA750"                                                             \
+    "91386C0077937FE33FA3252D28855837"                                                             \
+    "AE1B484A8A9A45F7EE8C0C634F99E8CD"                                                             \
+    "DF79C5CE07EE72C7F123142198164234"                                                             \
+    "CABB724CF78B8173B9F880FC86322407"                                                             \
+    "AF1FEDFDDE2BEB674CA15F3E81A1521E"                                                             \
+    "071513A1E85B5DFA031F21ECAE91A34D"
+
+#define RSA_P                                                                                      \
+    "C36D0EB7FCD285223CFB5AABA5BDA3D8"                                                             \
+    "2C01CAD19EA484A87EA4377637E75500"                                                             \
+    "FCB2005C5C7DD6EC4AC023CDA285D796"                                                             \
+    "C3D9E75E1EFC42488BB4F1D13AC30A57"
+
+#define RSA_Q                                                                                      \
+    "C000DF51A7C77AE8D7C7370C1FF55B69"                                                             \
+    "E211C2B9E5DB1ED0BF61D0D9899620F4"                                                             \
+    "910E4168387E3C30AA1E00C339A79508"                                                             \
+    "8452DD96A9A5EA5D9DCA68DA636032AF"
+
+#define PT_LEN 24
+#define RSA_PT                                                                                     \
+    "\xAA\xBB\xCC\x03\x02\x01\x00\xFF\xFF\xFF\xFF\xFF"                                             \
+    "\x11\x22\x33\x0A\x0B\x0C\xCC\xDD\xDD\xDD\xDD\xDD"
+
+#if defined(MBEDTLS_PKCS1_V15)
+static int myrand(void* rng_state, unsigned char* output, size_t len) {
+#if !defined(__OpenBSD__) && !defined(__NetBSD__)
+    size_t i;
+
+    if (rng_state != NULL)
+        rng_state = NULL;
+
+    for (i = 0; i < len; ++i)
+        output[i] = rand();
+#else
+    if (rng_state != NULL)
+        rng_state = NULL;
+
+    arc4random_buf(output, len);
+#endif /* !OpenBSD && !NetBSD */
+
+    return (0);
+}
+#endif /* MBEDTLS_PKCS1_V15 */
+
+/*
+ * Checkup routine
+ */
+int mbedtls_rsa_self_test(int verbose) {
+    int ret = 0;
+#if defined(MBEDTLS_PKCS1_V15)
+    size_t len;
+    mbedtls_rsa_context rsa;
+    unsigned char rsa_plaintext[PT_LEN];
+    unsigned char rsa_decrypted[PT_LEN];
+    unsigned char rsa_ciphertext[KEY_LEN];
+#if defined(MBEDTLS_SHA1_C)
+    unsigned char sha1sum[20];
+#endif
+
+    mbedtls_mpi K;
+
+    mbedtls_mpi_init(&K);
+    mbedtls_rsa_init(&rsa);
+
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&K, 16, RSA_N));
+    MBEDTLS_MPI_CHK(mbedtls_rsa_import(&rsa, &K, NULL, NULL, NULL, NULL));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&K, 16, RSA_P));
+    MBEDTLS_MPI_CHK(mbedtls_rsa_import(&rsa, NULL, &K, NULL, NULL, NULL));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&K, 16, RSA_Q));
+    MBEDTLS_MPI_CHK(mbedtls_rsa_import(&rsa, NULL, NULL, &K, NULL, NULL));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&K, 16, RSA_D));
+    MBEDTLS_MPI_CHK(mbedtls_rsa_import(&rsa, NULL, NULL, NULL, &K, NULL));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_read_string(&K, 16, RSA_E));
+    MBEDTLS_MPI_CHK(mbedtls_rsa_import(&rsa, NULL, NULL, NULL, NULL, &K));
+
+    MBEDTLS_MPI_CHK(mbedtls_rsa_complete(&rsa));
+
+    if (verbose != 0)
+        mbedtls_printf("  RSA key validation: ");
+
+    if (mbedtls_rsa_check_pubkey(&rsa) != 0 || mbedtls_rsa_check_privkey(&rsa) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n  PKCS#1 encryption : ");
+
+    memcpy(rsa_plaintext, RSA_PT, PT_LEN);
+
+    if (mbedtls_rsa_pkcs1_encrypt(&rsa, myrand, NULL, PT_LEN, rsa_plaintext, rsa_ciphertext) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n  PKCS#1 decryption : ");
+
+    if (mbedtls_rsa_pkcs1_decrypt(&rsa, myrand, NULL, &len, rsa_ciphertext, rsa_decrypted,
+            sizeof(rsa_decrypted)) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (memcmp(rsa_decrypted, rsa_plaintext, len) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n");
+
+#if defined(MBEDTLS_SHA1_C)
+    if (verbose != 0)
+        mbedtls_printf("  PKCS#1 data sign  : ");
+
+    if (mbedtls_sha1(rsa_plaintext, PT_LEN, sha1sum) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        return (1);
+    }
+
+    if (mbedtls_rsa_pkcs1_sign(&rsa, myrand, NULL, MBEDTLS_MD_SHA1, 20, sha1sum, rsa_ciphertext) !=
+        0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n  PKCS#1 sig. verify: ");
+
+    if (mbedtls_rsa_pkcs1_verify(&rsa, MBEDTLS_MD_SHA1, 20, sha1sum, rsa_ciphertext) != 0) {
+        if (verbose != 0)
+            mbedtls_printf("failed\n");
+
+        ret = 1;
+        goto cleanup;
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("passed\n");
+#endif /* MBEDTLS_SHA1_C */
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+
+cleanup:
+    mbedtls_mpi_free(&K);
+    mbedtls_rsa_free(&rsa);
+#else  /* MBEDTLS_PKCS1_V15 */
+    ((void)verbose);
+#endif /* MBEDTLS_PKCS1_V15 */
+    return (ret);
+}
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_RSA_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/rsa_alt_helpers.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/rsa_alt_helpers.cpp
new file mode 100644
index 0000000000..baa3a058de
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/rsa_alt_helpers.cpp
@@ -0,0 +1,426 @@
+/*
+ *  Helper functions for the RSA module
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ *
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_RSA_C)
+
+#include "mbedtls/bignum.h"
+#include "mbedtls/rsa.h"
+#include "rsa_alt_helpers.h"
+
+/*
+ * Compute RSA prime factors from public and private exponents
+ *
+ * Summary of algorithm:
+ * Setting F := lcm(P-1,Q-1), the idea is as follows:
+ *
+ * (a) For any 1 <= X < N with gcd(X,N)=1, we have X^F = 1 modulo N, so X^(F/2)
+ *     is a square root of 1 in Z/NZ. Since Z/NZ ~= Z/PZ x Z/QZ by CRT and the
+ *     square roots of 1 in Z/PZ and Z/QZ are +1 and -1, this leaves the four
+ *     possibilities X^(F/2) = (+-1, +-1). If it happens that X^(F/2) = (-1,+1)
+ *     or (+1,-1), then gcd(X^(F/2) + 1, N) will be equal to one of the prime
+ *     factors of N.
+ *
+ * (b) If we don't know F/2 but (F/2) * K for some odd (!) K, then the same
+ *     construction still applies since (-)^K is the identity on the set of
+ *     roots of 1 in Z/NZ.
+ *
+ * The public and private key primitives (-)^E and (-)^D are mutually inverse
+ * bijections on Z/NZ if and only if (-)^(DE) is the identity on Z/NZ, i.e.
+ * if and only if DE - 1 is a multiple of F, say DE - 1 = F * L.
+ * Splitting L = 2^t * K with K odd, we have
+ *
+ *   DE - 1 = FL = (F/2) * (2^(t+1)) * K,
+ *
+ * so (F / 2) * K is among the numbers
+ *
+ *   (DE - 1) >> 1, (DE - 1) >> 2, ..., (DE - 1) >> ord
+ *
+ * where ord is the order of 2 in (DE - 1).
+ * We can therefore iterate through these numbers apply the construction
+ * of (a) and (b) above to attempt to factor N.
+ *
+ */
+int mbedtls_rsa_deduce_primes(mbedtls_mpi const* N, mbedtls_mpi const* E, mbedtls_mpi const* D,
+    mbedtls_mpi* P, mbedtls_mpi* Q) {
+    int ret = 0;
+
+    uint16_t attempt; /* Number of current attempt  */
+    uint16_t iter;    /* Number of squares computed in the current attempt */
+
+    uint16_t order; /* Order of 2 in DE - 1 */
+
+    mbedtls_mpi T; /* Holds largest odd divisor of DE - 1     */
+    mbedtls_mpi K; /* Temporary holding the current candidate */
+
+    const unsigned char primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59,
+        61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157,
+        163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251};
+
+    const size_t num_primes = sizeof(primes) / sizeof(*primes);
+
+    if (P == NULL || Q == NULL || P->p != NULL || Q->p != NULL)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    if (mbedtls_mpi_cmp_int(N, 0) <= 0 || mbedtls_mpi_cmp_int(D, 1) <= 0 ||
+        mbedtls_mpi_cmp_mpi(D, N) >= 0 || mbedtls_mpi_cmp_int(E, 1) <= 0 ||
+        mbedtls_mpi_cmp_mpi(E, N) >= 0) {
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+    }
+
+    /*
+     * Initializations and temporary changes
+     */
+
+    mbedtls_mpi_init(&K);
+    mbedtls_mpi_init(&T);
+
+    /* T := DE - 1 */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&T, D, E));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&T, &T, 1));
+
+    if ((order = (uint16_t)mbedtls_mpi_lsb(&T)) == 0) {
+        ret = MBEDTLS_ERR_MPI_BAD_INPUT_DATA;
+        goto cleanup;
+    }
+
+    /* After this operation, T holds the largest odd divisor of DE - 1. */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&T, order));
+
+    /*
+     * Actual work
+     */
+
+    /* Skip trying 2 if N == 1 mod 8 */
+    attempt = 0;
+    if (N->p[0] % 8 == 1)
+        attempt = 1;
+
+    for (; attempt < num_primes; ++attempt) {
+        mbedtls_mpi_lset(&K, primes[attempt]);
+
+        /* Check if gcd(K,N) = 1 */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_gcd(P, &K, N));
+        if (mbedtls_mpi_cmp_int(P, 1) != 0)
+            continue;
+
+        /* Go through K^T + 1, K^(2T) + 1, K^(4T) + 1, ...
+         * and check whether they have nontrivial GCD with N. */
+        MBEDTLS_MPI_CHK( mbedtls_mpi_exp_mod( &K, &K, &T, N,
+                             Q /* temporarily use Q for storing Montgomery
+                                * multiplication helper values */ ) );
+
+        for (iter = 1; iter <= order; ++iter) {
+            /* If we reach 1 prematurely, there's no point
+             * in continuing to square K */
+            if (mbedtls_mpi_cmp_int(&K, 1) == 0)
+                break;
+
+            MBEDTLS_MPI_CHK(mbedtls_mpi_add_int(&K, &K, 1));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_gcd(P, &K, N));
+
+            if (mbedtls_mpi_cmp_int(P, 1) == 1 && mbedtls_mpi_cmp_mpi(P, N) == -1) {
+                /*
+                 * Have found a nontrivial divisor P of N.
+                 * Set Q := N / P.
+                 */
+
+                MBEDTLS_MPI_CHK(mbedtls_mpi_div_mpi(Q, NULL, N, P));
+                goto cleanup;
+            }
+
+            MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&K, &K, 1));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&K, &K, &K));
+            MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&K, &K, N));
+        }
+
+        /*
+         * If we get here, then either we prematurely aborted the loop because
+         * we reached 1, or K holds primes[attempt]^(DE - 1) mod N, which must
+         * be 1 if D,E,N were consistent.
+         * Check if that's the case and abort if not, to avoid very long,
+         * yet eventually failing, computations if N,D,E were not sane.
+         */
+        if (mbedtls_mpi_cmp_int(&K, 1) != 0) {
+            break;
+        }
+    }
+
+    ret = MBEDTLS_ERR_MPI_BAD_INPUT_DATA;
+
+cleanup:
+
+    mbedtls_mpi_free(&K);
+    mbedtls_mpi_free(&T);
+    return (ret);
+}
+
+/*
+ * Given P, Q and the public exponent E, deduce D.
+ * This is essentially a modular inversion.
+ */
+int mbedtls_rsa_deduce_private_exponent(mbedtls_mpi const* P, mbedtls_mpi const* Q,
+    mbedtls_mpi const* E, mbedtls_mpi* D) {
+    int ret = 0;
+    mbedtls_mpi K, L;
+
+    if (D == NULL || mbedtls_mpi_cmp_int(D, 0) != 0)
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+
+    if (mbedtls_mpi_cmp_int(P, 1) <= 0 || mbedtls_mpi_cmp_int(Q, 1) <= 0 ||
+        mbedtls_mpi_cmp_int(E, 0) == 0) {
+        return (MBEDTLS_ERR_MPI_BAD_INPUT_DATA);
+    }
+
+    mbedtls_mpi_init(&K);
+    mbedtls_mpi_init(&L);
+
+    /* Temporarily put K := P-1 and L := Q-1 */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&K, P, 1));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&L, Q, 1));
+
+    /* Temporarily put D := gcd(P-1, Q-1) */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_gcd(D, &K, &L));
+
+    /* K := LCM(P-1, Q-1) */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&K, &K, &L));
+    MBEDTLS_MPI_CHK(mbedtls_mpi_div_mpi(&K, NULL, &K, D));
+
+    /* Compute modular inverse of E in LCM(P-1, Q-1) */
+    MBEDTLS_MPI_CHK(mbedtls_mpi_inv_mod(D, E, &K));
+
+cleanup:
+
+    mbedtls_mpi_free(&K);
+    mbedtls_mpi_free(&L);
+
+    return (ret);
+}
+
+int mbedtls_rsa_deduce_crt(const mbedtls_mpi* P, const mbedtls_mpi* Q, const mbedtls_mpi* D,
+    mbedtls_mpi* DP, mbedtls_mpi* DQ, mbedtls_mpi* QP) {
+    int ret = 0;
+    mbedtls_mpi K;
+    mbedtls_mpi_init(&K);
+
+    /* DP = D mod P-1 */
+    if (DP != NULL) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&K, P, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(DP, D, &K));
+    }
+
+    /* DQ = D mod Q-1 */
+    if (DQ != NULL) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&K, Q, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(DQ, D, &K));
+    }
+
+    /* QP = Q^{-1} mod P */
+    if (QP != NULL) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_inv_mod(QP, Q, P));
+    }
+
+cleanup:
+    mbedtls_mpi_free(&K);
+
+    return (ret);
+}
+
+/*
+ * Check that core RSA parameters are sane.
+ */
+int mbedtls_rsa_validate_params(const mbedtls_mpi* N, const mbedtls_mpi* P, const mbedtls_mpi* Q,
+    const mbedtls_mpi* D, const mbedtls_mpi* E, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng) {
+    int ret = 0;
+    mbedtls_mpi K, L;
+
+    mbedtls_mpi_init(&K);
+    mbedtls_mpi_init(&L);
+
+    /*
+     * Step 1: If PRNG provided, check that P and Q are prime
+     */
+
+#if defined(MBEDTLS_GENPRIME)
+    /*
+     * When generating keys, the strongest security we support aims for an error
+     * rate of at most 2^-100 and we are aiming for the same certainty here as
+     * well.
+     */
+    if (f_rng != NULL && P != NULL && (ret = mbedtls_mpi_is_prime_ext(P, 50, f_rng, p_rng)) != 0) {
+        ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+        goto cleanup;
+    }
+
+    if (f_rng != NULL && Q != NULL && (ret = mbedtls_mpi_is_prime_ext(Q, 50, f_rng, p_rng)) != 0) {
+        ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+        goto cleanup;
+    }
+#else
+    ((void)f_rng);
+    ((void)p_rng);
+#endif /* MBEDTLS_GENPRIME */
+
+    /*
+     * Step 2: Check that 1 < N = P * Q
+     */
+
+    if (P != NULL && Q != NULL && N != NULL) {
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&K, P, Q));
+        if (mbedtls_mpi_cmp_int(N, 1) <= 0 || mbedtls_mpi_cmp_mpi(&K, N) != 0) {
+            ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+            goto cleanup;
+        }
+    }
+
+    /*
+     * Step 3: Check and 1 < D, E < N if present.
+     */
+
+    if (N != NULL && D != NULL && E != NULL) {
+        if (mbedtls_mpi_cmp_int(D, 1) <= 0 || mbedtls_mpi_cmp_int(E, 1) <= 0 ||
+            mbedtls_mpi_cmp_mpi(D, N) >= 0 || mbedtls_mpi_cmp_mpi(E, N) >= 0) {
+            ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+            goto cleanup;
+        }
+    }
+
+    /*
+     * Step 4: Check that D, E are inverse modulo P-1 and Q-1
+     */
+
+    if (P != NULL && Q != NULL && D != NULL && E != NULL) {
+        if (mbedtls_mpi_cmp_int(P, 1) <= 0 || mbedtls_mpi_cmp_int(Q, 1) <= 0) {
+            ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+            goto cleanup;
+        }
+
+        /* Compute DE-1 mod P-1 */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&K, D, E));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&K, &K, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&L, P, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&K, &K, &L));
+        if (mbedtls_mpi_cmp_int(&K, 0) != 0) {
+            ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+            goto cleanup;
+        }
+
+        /* Compute DE-1 mod Q-1 */
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&K, D, E));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&K, &K, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&L, Q, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&K, &K, &L));
+        if (mbedtls_mpi_cmp_int(&K, 0) != 0) {
+            ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+            goto cleanup;
+        }
+    }
+
+cleanup:
+
+    mbedtls_mpi_free(&K);
+    mbedtls_mpi_free(&L);
+
+    /* Wrap MPI error codes by RSA check failure error code */
+    if (ret != 0 && ret != MBEDTLS_ERR_RSA_KEY_CHECK_FAILED) {
+        ret += MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+    }
+
+    return (ret);
+}
+
+/*
+ * Check that RSA CRT parameters are in accordance with core parameters.
+ */
+int mbedtls_rsa_validate_crt(const mbedtls_mpi* P, const mbedtls_mpi* Q, const mbedtls_mpi* D,
+    const mbedtls_mpi* DP, const mbedtls_mpi* DQ, const mbedtls_mpi* QP) {
+    int ret = 0;
+
+    mbedtls_mpi K, L;
+    mbedtls_mpi_init(&K);
+    mbedtls_mpi_init(&L);
+
+    /* Check that DP - D == 0 mod P - 1 */
+    if (DP != NULL) {
+        if (P == NULL) {
+            ret = MBEDTLS_ERR_RSA_BAD_INPUT_DATA;
+            goto cleanup;
+        }
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&K, P, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&L, DP, D));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&L, &L, &K));
+
+        if (mbedtls_mpi_cmp_int(&L, 0) != 0) {
+            ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+            goto cleanup;
+        }
+    }
+
+    /* Check that DQ - D == 0 mod Q - 1 */
+    if (DQ != NULL) {
+        if (Q == NULL) {
+            ret = MBEDTLS_ERR_RSA_BAD_INPUT_DATA;
+            goto cleanup;
+        }
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&K, Q, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&L, DQ, D));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&L, &L, &K));
+
+        if (mbedtls_mpi_cmp_int(&L, 0) != 0) {
+            ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+            goto cleanup;
+        }
+    }
+
+    /* Check that QP * Q - 1 == 0 mod P */
+    if (QP != NULL) {
+        if (P == NULL || Q == NULL) {
+            ret = MBEDTLS_ERR_RSA_BAD_INPUT_DATA;
+            goto cleanup;
+        }
+
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mul_mpi(&K, QP, Q));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_sub_int(&K, &K, 1));
+        MBEDTLS_MPI_CHK(mbedtls_mpi_mod_mpi(&K, &K, P));
+        if (mbedtls_mpi_cmp_int(&K, 0) != 0) {
+            ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+            goto cleanup;
+        }
+    }
+
+cleanup:
+
+    /* Wrap MPI error codes by RSA check failure error code */
+    if (ret != 0 && ret != MBEDTLS_ERR_RSA_KEY_CHECK_FAILED &&
+        ret != MBEDTLS_ERR_RSA_BAD_INPUT_DATA) {
+        ret += MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
+    }
+
+    mbedtls_mpi_free(&K);
+    mbedtls_mpi_free(&L);
+
+    return (ret);
+}
+
+#endif /* MBEDTLS_RSA_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/rsa_alt_helpers.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/rsa_alt_helpers.h
new file mode 100644
index 0000000000..e801fb12f8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/rsa_alt_helpers.h
@@ -0,0 +1,209 @@
+/**
+ * \file rsa_alt_helpers.h
+ *
+ * \brief Context-independent RSA helper functions
+ *
+ *  This module declares some RSA-related helper functions useful when
+ *  implementing the RSA interface. These functions are provided in a separate
+ *  compilation unit in order to make it easy for designers of alternative RSA
+ *  implementations to use them in their own code, as it is conceived that the
+ *  functionality they provide will be necessary for most complete
+ *  implementations.
+ *
+ *  End-users of Mbed TLS who are not providing their own alternative RSA
+ *  implementations should not use these functions directly, and should instead
+ *  use only the functions declared in rsa.h.
+ *
+ *  The interface provided by this module will be maintained through LTS (Long
+ *  Term Support) branches of Mbed TLS, but may otherwise be subject to change,
+ *  and must be considered an internal interface of the library.
+ *
+ *  There are two classes of helper functions:
+ *
+ *  (1) Parameter-generating helpers. These are:
+ *      - mbedtls_rsa_deduce_primes
+ *      - mbedtls_rsa_deduce_private_exponent
+ *      - mbedtls_rsa_deduce_crt
+ *       Each of these functions takes a set of core RSA parameters and
+ *       generates some other, or CRT related parameters.
+ *
+ *  (2) Parameter-checking helpers. These are:
+ *      - mbedtls_rsa_validate_params
+ *      - mbedtls_rsa_validate_crt
+ *      They take a set of core or CRT related RSA parameters and check their
+ *      validity.
+ *
+ */
+/*
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ *
+ */
+
+#ifndef MBEDTLS_RSA_INTERNAL_H
+#define MBEDTLS_RSA_INTERNAL_H
+
+#include "mbedtls/bignum.h"
+#include "mbedtls/build_info.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * \brief          Compute RSA prime moduli P, Q from public modulus N=PQ
+ *                 and a pair of private and public key.
+ *
+ * \note           This is a 'static' helper function not operating on
+ *                 an RSA context. Alternative implementations need not
+ *                 overwrite it.
+ *
+ * \param N        RSA modulus N = PQ, with P, Q to be found
+ * \param E        RSA public exponent
+ * \param D        RSA private exponent
+ * \param P        Pointer to MPI holding first prime factor of N on success
+ * \param Q        Pointer to MPI holding second prime factor of N on success
+ *
+ * \return
+ *                 - 0 if successful. In this case, P and Q constitute a
+ *                   factorization of N.
+ *                 - A non-zero error code otherwise.
+ *
+ * \note           It is neither checked that P, Q are prime nor that
+ *                 D, E are modular inverses wrt. P-1 and Q-1. For that,
+ *                 use the helper function \c mbedtls_rsa_validate_params.
+ *
+ */
+int mbedtls_rsa_deduce_primes(mbedtls_mpi const* N, mbedtls_mpi const* E, mbedtls_mpi const* D,
+    mbedtls_mpi* P, mbedtls_mpi* Q);
+
+/**
+ * \brief          Compute RSA private exponent from
+ *                 prime moduli and public key.
+ *
+ * \note           This is a 'static' helper function not operating on
+ *                 an RSA context. Alternative implementations need not
+ *                 overwrite it.
+ *
+ * \param P        First prime factor of RSA modulus
+ * \param Q        Second prime factor of RSA modulus
+ * \param E        RSA public exponent
+ * \param D        Pointer to MPI holding the private exponent on success.
+ *
+ * \return
+ *                 - 0 if successful. In this case, D is set to a simultaneous
+ *                   modular inverse of E modulo both P-1 and Q-1.
+ *                 - A non-zero error code otherwise.
+ *
+ * \note           This function does not check whether P and Q are primes.
+ *
+ */
+int mbedtls_rsa_deduce_private_exponent(mbedtls_mpi const* P, mbedtls_mpi const* Q,
+    mbedtls_mpi const* E, mbedtls_mpi* D);
+
+/**
+ * \brief          Generate RSA-CRT parameters
+ *
+ * \note           This is a 'static' helper function not operating on
+ *                 an RSA context. Alternative implementations need not
+ *                 overwrite it.
+ *
+ * \param P        First prime factor of N
+ * \param Q        Second prime factor of N
+ * \param D        RSA private exponent
+ * \param DP       Output variable for D modulo P-1
+ * \param DQ       Output variable for D modulo Q-1
+ * \param QP       Output variable for the modular inverse of Q modulo P.
+ *
+ * \return         0 on success, non-zero error code otherwise.
+ *
+ * \note           This function does not check whether P, Q are
+ *                 prime and whether D is a valid private exponent.
+ *
+ */
+int mbedtls_rsa_deduce_crt(const mbedtls_mpi* P, const mbedtls_mpi* Q, const mbedtls_mpi* D,
+    mbedtls_mpi* DP, mbedtls_mpi* DQ, mbedtls_mpi* QP);
+
+/**
+ * \brief          Check validity of core RSA parameters
+ *
+ * \note           This is a 'static' helper function not operating on
+ *                 an RSA context. Alternative implementations need not
+ *                 overwrite it.
+ *
+ * \param N        RSA modulus N = PQ
+ * \param P        First prime factor of N
+ * \param Q        Second prime factor of N
+ * \param D        RSA private exponent
+ * \param E        RSA public exponent
+ * \param f_rng    PRNG to be used for primality check, or NULL
+ * \param p_rng    PRNG context for f_rng, or NULL
+ *
+ * \return
+ *                 - 0 if the following conditions are satisfied
+ *                   if all relevant parameters are provided:
+ *                    - P prime if f_rng != NULL (%)
+ *                    - Q prime if f_rng != NULL (%)
+ *                    - 1 < N = P * Q
+ *                    - 1 < D, E < N
+ *                    - D and E are modular inverses modulo P-1 and Q-1
+ *                   (%) This is only done if MBEDTLS_GENPRIME is defined.
+ *                 - A non-zero error code otherwise.
+ *
+ * \note           The function can be used with a restricted set of arguments
+ *                 to perform specific checks only. E.g., calling it with
+ *                 (-,P,-,-,-) and a PRNG amounts to a primality check for P.
+ */
+int mbedtls_rsa_validate_params(const mbedtls_mpi* N, const mbedtls_mpi* P, const mbedtls_mpi* Q,
+    const mbedtls_mpi* D, const mbedtls_mpi* E, int (*f_rng)(void*, unsigned char*, size_t),
+    void* p_rng);
+
+/**
+ * \brief          Check validity of RSA CRT parameters
+ *
+ * \note           This is a 'static' helper function not operating on
+ *                 an RSA context. Alternative implementations need not
+ *                 overwrite it.
+ *
+ * \param P        First prime factor of RSA modulus
+ * \param Q        Second prime factor of RSA modulus
+ * \param D        RSA private exponent
+ * \param DP       MPI to check for D modulo P-1
+ * \param DQ       MPI to check for D modulo P-1
+ * \param QP       MPI to check for the modular inverse of Q modulo P.
+ *
+ * \return
+ *                 - 0 if the following conditions are satisfied:
+ *                    - D = DP mod P-1 if P, D, DP != NULL
+ *                    - Q = DQ mod P-1 if P, D, DQ != NULL
+ *                    - QP = Q^-1 mod P if P, Q, QP != NULL
+ *                 - \c MBEDTLS_ERR_RSA_KEY_CHECK_FAILED if check failed,
+ *                   potentially including \c MBEDTLS_ERR_MPI_XXX if some
+ *                   MPI calculations failed.
+ *                 - \c MBEDTLS_ERR_RSA_BAD_INPUT_DATA if insufficient
+ *                   data was provided to check DP, DQ or QP.
+ *
+ * \note           The function can be used with a restricted set of arguments
+ *                 to perform specific checks only. E.g., calling it with the
+ *                 parameters (P, -, D, DP, -, -) will check DP = D mod P-1.
+ */
+int mbedtls_rsa_validate_crt(const mbedtls_mpi* P, const mbedtls_mpi* Q, const mbedtls_mpi* D,
+    const mbedtls_mpi* DP, const mbedtls_mpi* DQ, const mbedtls_mpi* QP);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* rsa_alt_helpers.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/sha1.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/sha1.cpp
new file mode 100644
index 0000000000..3bdbe695f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/sha1.cpp
@@ -0,0 +1,468 @@
+/*
+ *  FIPS-180-1 compliant SHA-1 implementation
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+/*
+ *  The SHA-1 standard was published by NIST in 1993.
+ *
+ *  http://www.itl.nist.gov/fipspubs/fip180-1.htm
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_SHA1_C)
+
+#include <string.h>
+
+#include "mbedtls/error.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/sha1.h"
+
+#if defined(MBEDTLS_SELF_TEST)
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdio.h>
+#define mbedtls_printf printf
+#endif /* MBEDTLS_PLATFORM_C */
+#endif /* MBEDTLS_SELF_TEST */
+
+#define SHA1_VALIDATE_RET(cond) MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_SHA1_BAD_INPUT_DATA)
+
+#define SHA1_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+#if !defined(MBEDTLS_SHA1_ALT)
+
+void mbedtls_sha1_init(mbedtls_sha1_context* ctx) {
+    SHA1_VALIDATE(ctx != NULL);
+
+    memset(ctx, 0, sizeof(mbedtls_sha1_context));
+}
+
+void mbedtls_sha1_free(mbedtls_sha1_context* ctx) {
+    if (ctx == NULL)
+        return;
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_sha1_context));
+}
+
+void mbedtls_sha1_clone(mbedtls_sha1_context* dst, const mbedtls_sha1_context* src) {
+    SHA1_VALIDATE(dst != NULL);
+    SHA1_VALIDATE(src != NULL);
+
+    *dst = *src;
+}
+
+/*
+ * SHA-1 context setup
+ */
+int mbedtls_sha1_starts(mbedtls_sha1_context* ctx) {
+    SHA1_VALIDATE_RET(ctx != NULL);
+
+    ctx->total[0] = 0;
+    ctx->total[1] = 0;
+
+    ctx->state[0] = 0x67452301;
+    ctx->state[1] = 0xEFCDAB89;
+    ctx->state[2] = 0x98BADCFE;
+    ctx->state[3] = 0x10325476;
+    ctx->state[4] = 0xC3D2E1F0;
+
+    return (0);
+}
+
+#if !defined(MBEDTLS_SHA1_PROCESS_ALT)
+int mbedtls_internal_sha1_process(mbedtls_sha1_context* ctx, const unsigned char data[64]) {
+    struct {
+        uint32_t temp, W[16], A, B, C, D, E;
+    } local;
+
+    SHA1_VALIDATE_RET(ctx != NULL);
+    SHA1_VALIDATE_RET((const unsigned char*)data != NULL);
+
+    local.W[0] = MBEDTLS_GET_UINT32_BE(data, 0);
+    local.W[1] = MBEDTLS_GET_UINT32_BE(data, 4);
+    local.W[2] = MBEDTLS_GET_UINT32_BE(data, 8);
+    local.W[3] = MBEDTLS_GET_UINT32_BE(data, 12);
+    local.W[4] = MBEDTLS_GET_UINT32_BE(data, 16);
+    local.W[5] = MBEDTLS_GET_UINT32_BE(data, 20);
+    local.W[6] = MBEDTLS_GET_UINT32_BE(data, 24);
+    local.W[7] = MBEDTLS_GET_UINT32_BE(data, 28);
+    local.W[8] = MBEDTLS_GET_UINT32_BE(data, 32);
+    local.W[9] = MBEDTLS_GET_UINT32_BE(data, 36);
+    local.W[10] = MBEDTLS_GET_UINT32_BE(data, 40);
+    local.W[11] = MBEDTLS_GET_UINT32_BE(data, 44);
+    local.W[12] = MBEDTLS_GET_UINT32_BE(data, 48);
+    local.W[13] = MBEDTLS_GET_UINT32_BE(data, 52);
+    local.W[14] = MBEDTLS_GET_UINT32_BE(data, 56);
+    local.W[15] = MBEDTLS_GET_UINT32_BE(data, 60);
+
+#define S(x, n) (((x) << (n)) | (((x) & 0xFFFFFFFF) >> (32 - (n))))
+
+#define R(t)                                                                                       \
+    (local.temp = local.W[((t) - 3) & 0x0F] ^ local.W[((t) - 8) & 0x0F] ^                          \
+                  local.W[((t) - 14) & 0x0F] ^ local.W[(t) & 0x0F],                                \
+        (local.W[(t) & 0x0F] = S(local.temp, 1)))
+
+#define P(a, b, c, d, e, x)                                                                        \
+    do {                                                                                           \
+        (e) += S((a), 5) + F((b), (c), (d)) + K + (x);                                             \
+        (b) = S((b), 30);                                                                          \
+    } while (0)
+
+    local.A = ctx->state[0];
+    local.B = ctx->state[1];
+    local.C = ctx->state[2];
+    local.D = ctx->state[3];
+    local.E = ctx->state[4];
+
+#define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
+#define K 0x5A827999
+
+    P(local.A, local.B, local.C, local.D, local.E, local.W[0]);
+    P(local.E, local.A, local.B, local.C, local.D, local.W[1]);
+    P(local.D, local.E, local.A, local.B, local.C, local.W[2]);
+    P(local.C, local.D, local.E, local.A, local.B, local.W[3]);
+    P(local.B, local.C, local.D, local.E, local.A, local.W[4]);
+    P(local.A, local.B, local.C, local.D, local.E, local.W[5]);
+    P(local.E, local.A, local.B, local.C, local.D, local.W[6]);
+    P(local.D, local.E, local.A, local.B, local.C, local.W[7]);
+    P(local.C, local.D, local.E, local.A, local.B, local.W[8]);
+    P(local.B, local.C, local.D, local.E, local.A, local.W[9]);
+    P(local.A, local.B, local.C, local.D, local.E, local.W[10]);
+    P(local.E, local.A, local.B, local.C, local.D, local.W[11]);
+    P(local.D, local.E, local.A, local.B, local.C, local.W[12]);
+    P(local.C, local.D, local.E, local.A, local.B, local.W[13]);
+    P(local.B, local.C, local.D, local.E, local.A, local.W[14]);
+    P(local.A, local.B, local.C, local.D, local.E, local.W[15]);
+    P(local.E, local.A, local.B, local.C, local.D, R(16));
+    P(local.D, local.E, local.A, local.B, local.C, R(17));
+    P(local.C, local.D, local.E, local.A, local.B, R(18));
+    P(local.B, local.C, local.D, local.E, local.A, R(19));
+
+#undef K
+#undef F
+
+#define F(x, y, z) ((x) ^ (y) ^ (z))
+#define K 0x6ED9EBA1
+
+    P(local.A, local.B, local.C, local.D, local.E, R(20));
+    P(local.E, local.A, local.B, local.C, local.D, R(21));
+    P(local.D, local.E, local.A, local.B, local.C, R(22));
+    P(local.C, local.D, local.E, local.A, local.B, R(23));
+    P(local.B, local.C, local.D, local.E, local.A, R(24));
+    P(local.A, local.B, local.C, local.D, local.E, R(25));
+    P(local.E, local.A, local.B, local.C, local.D, R(26));
+    P(local.D, local.E, local.A, local.B, local.C, R(27));
+    P(local.C, local.D, local.E, local.A, local.B, R(28));
+    P(local.B, local.C, local.D, local.E, local.A, R(29));
+    P(local.A, local.B, local.C, local.D, local.E, R(30));
+    P(local.E, local.A, local.B, local.C, local.D, R(31));
+    P(local.D, local.E, local.A, local.B, local.C, R(32));
+    P(local.C, local.D, local.E, local.A, local.B, R(33));
+    P(local.B, local.C, local.D, local.E, local.A, R(34));
+    P(local.A, local.B, local.C, local.D, local.E, R(35));
+    P(local.E, local.A, local.B, local.C, local.D, R(36));
+    P(local.D, local.E, local.A, local.B, local.C, R(37));
+    P(local.C, local.D, local.E, local.A, local.B, R(38));
+    P(local.B, local.C, local.D, local.E, local.A, R(39));
+
+#undef K
+#undef F
+
+#define F(x, y, z) (((x) & (y)) | ((z) & ((x) | (y))))
+#define K 0x8F1BBCDC
+
+    P(local.A, local.B, local.C, local.D, local.E, R(40));
+    P(local.E, local.A, local.B, local.C, local.D, R(41));
+    P(local.D, local.E, local.A, local.B, local.C, R(42));
+    P(local.C, local.D, local.E, local.A, local.B, R(43));
+    P(local.B, local.C, local.D, local.E, local.A, R(44));
+    P(local.A, local.B, local.C, local.D, local.E, R(45));
+    P(local.E, local.A, local.B, local.C, local.D, R(46));
+    P(local.D, local.E, local.A, local.B, local.C, R(47));
+    P(local.C, local.D, local.E, local.A, local.B, R(48));
+    P(local.B, local.C, local.D, local.E, local.A, R(49));
+    P(local.A, local.B, local.C, local.D, local.E, R(50));
+    P(local.E, local.A, local.B, local.C, local.D, R(51));
+    P(local.D, local.E, local.A, local.B, local.C, R(52));
+    P(local.C, local.D, local.E, local.A, local.B, R(53));
+    P(local.B, local.C, local.D, local.E, local.A, R(54));
+    P(local.A, local.B, local.C, local.D, local.E, R(55));
+    P(local.E, local.A, local.B, local.C, local.D, R(56));
+    P(local.D, local.E, local.A, local.B, local.C, R(57));
+    P(local.C, local.D, local.E, local.A, local.B, R(58));
+    P(local.B, local.C, local.D, local.E, local.A, R(59));
+
+#undef K
+#undef F
+
+#define F(x, y, z) ((x) ^ (y) ^ (z))
+#define K 0xCA62C1D6
+
+    P(local.A, local.B, local.C, local.D, local.E, R(60));
+    P(local.E, local.A, local.B, local.C, local.D, R(61));
+    P(local.D, local.E, local.A, local.B, local.C, R(62));
+    P(local.C, local.D, local.E, local.A, local.B, R(63));
+    P(local.B, local.C, local.D, local.E, local.A, R(64));
+    P(local.A, local.B, local.C, local.D, local.E, R(65));
+    P(local.E, local.A, local.B, local.C, local.D, R(66));
+    P(local.D, local.E, local.A, local.B, local.C, R(67));
+    P(local.C, local.D, local.E, local.A, local.B, R(68));
+    P(local.B, local.C, local.D, local.E, local.A, R(69));
+    P(local.A, local.B, local.C, local.D, local.E, R(70));
+    P(local.E, local.A, local.B, local.C, local.D, R(71));
+    P(local.D, local.E, local.A, local.B, local.C, R(72));
+    P(local.C, local.D, local.E, local.A, local.B, R(73));
+    P(local.B, local.C, local.D, local.E, local.A, R(74));
+    P(local.A, local.B, local.C, local.D, local.E, R(75));
+    P(local.E, local.A, local.B, local.C, local.D, R(76));
+    P(local.D, local.E, local.A, local.B, local.C, R(77));
+    P(local.C, local.D, local.E, local.A, local.B, R(78));
+    P(local.B, local.C, local.D, local.E, local.A, R(79));
+
+#undef K
+#undef F
+
+    ctx->state[0] += local.A;
+    ctx->state[1] += local.B;
+    ctx->state[2] += local.C;
+    ctx->state[3] += local.D;
+    ctx->state[4] += local.E;
+
+    /* Zeroise buffers and variables to clear sensitive data from memory. */
+    mbedtls_platform_zeroize(&local, sizeof(local));
+
+    return (0);
+}
+
+#endif /* !MBEDTLS_SHA1_PROCESS_ALT */
+
+/*
+ * SHA-1 process buffer
+ */
+int mbedtls_sha1_update(mbedtls_sha1_context* ctx, const unsigned char* input, size_t ilen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t fill;
+    uint32_t left;
+
+    SHA1_VALIDATE_RET(ctx != NULL);
+    SHA1_VALIDATE_RET(ilen == 0 || input != NULL);
+
+    if (ilen == 0)
+        return (0);
+
+    left = ctx->total[0] & 0x3F;
+    fill = 64 - left;
+
+    ctx->total[0] += (uint32_t)ilen;
+    ctx->total[0] &= 0xFFFFFFFF;
+
+    if (ctx->total[0] < (uint32_t)ilen)
+        ctx->total[1]++;
+
+    if (left && ilen >= fill) {
+        memcpy((void*)(ctx->buffer + left), input, fill);
+
+        if ((ret = mbedtls_internal_sha1_process(ctx, ctx->buffer)) != 0)
+            return (ret);
+
+        input += fill;
+        ilen -= fill;
+        left = 0;
+    }
+
+    while (ilen >= 64) {
+        if ((ret = mbedtls_internal_sha1_process(ctx, input)) != 0)
+            return (ret);
+
+        input += 64;
+        ilen -= 64;
+    }
+
+    if (ilen > 0)
+        memcpy((void*)(ctx->buffer + left), input, ilen);
+
+    return (0);
+}
+
+/*
+ * SHA-1 final digest
+ */
+int mbedtls_sha1_finish(mbedtls_sha1_context* ctx, unsigned char output[20]) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    uint32_t used;
+    uint32_t high, low;
+
+    SHA1_VALIDATE_RET(ctx != NULL);
+    SHA1_VALIDATE_RET((unsigned char*)output != NULL);
+
+    /*
+     * Add padding: 0x80 then 0x00 until 8 bytes remain for the length
+     */
+    used = ctx->total[0] & 0x3F;
+
+    ctx->buffer[used++] = 0x80;
+
+    if (used <= 56) {
+        /* Enough room for padding + length in current block */
+        memset(ctx->buffer + used, 0, 56 - used);
+    } else {
+        /* We'll need an extra block */
+        memset(ctx->buffer + used, 0, 64 - used);
+
+        if ((ret = mbedtls_internal_sha1_process(ctx, ctx->buffer)) != 0)
+            return (ret);
+
+        memset(ctx->buffer, 0, 56);
+    }
+
+    /*
+     * Add message length
+     */
+    high = (ctx->total[0] >> 29) | (ctx->total[1] << 3);
+    low = (ctx->total[0] << 3);
+
+    MBEDTLS_PUT_UINT32_BE(high, ctx->buffer, 56);
+    MBEDTLS_PUT_UINT32_BE(low, ctx->buffer, 60);
+
+    if ((ret = mbedtls_internal_sha1_process(ctx, ctx->buffer)) != 0)
+        return (ret);
+
+    /*
+     * Output final state
+     */
+    MBEDTLS_PUT_UINT32_BE(ctx->state[0], output, 0);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[1], output, 4);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[2], output, 8);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[3], output, 12);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[4], output, 16);
+
+    return (0);
+}
+
+#endif /* !MBEDTLS_SHA1_ALT */
+
+/*
+ * output = SHA-1( input buffer )
+ */
+int mbedtls_sha1(const unsigned char* input, size_t ilen, unsigned char output[20]) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_sha1_context ctx;
+
+    SHA1_VALIDATE_RET(ilen == 0 || input != NULL);
+    SHA1_VALIDATE_RET((unsigned char*)output != NULL);
+
+    mbedtls_sha1_init(&ctx);
+
+    if ((ret = mbedtls_sha1_starts(&ctx)) != 0)
+        goto exit;
+
+    if ((ret = mbedtls_sha1_update(&ctx, input, ilen)) != 0)
+        goto exit;
+
+    if ((ret = mbedtls_sha1_finish(&ctx, output)) != 0)
+        goto exit;
+
+exit:
+    mbedtls_sha1_free(&ctx);
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_SELF_TEST)
+/*
+ * FIPS-180-1 test vectors
+ */
+static const unsigned char sha1_test_buf[3][57] = {{"abc"},
+    {"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"}, {""}};
+
+static const size_t sha1_test_buflen[3] = {3, 56, 1000};
+
+static const unsigned char sha1_test_sum[3][20] = {{0xA9, 0x99, 0x3E, 0x36, 0x47, 0x06, 0x81, 0x6A,
+                                                       0xBA, 0x3E, 0x25, 0x71, 0x78, 0x50, 0xC2,
+                                                       0x6C, 0x9C, 0xD0, 0xD8, 0x9D},
+    {0x84, 0x98, 0x3E, 0x44, 0x1C, 0x3B, 0xD2, 0x6E, 0xBA, 0xAE, 0x4A, 0xA1, 0xF9, 0x51, 0x29, 0xE5,
+        0xE5, 0x46, 0x70, 0xF1},
+    {0x34, 0xAA, 0x97, 0x3C, 0xD4, 0xC4, 0xDA, 0xA4, 0xF6, 0x1E, 0xEB, 0x2B, 0xDB, 0xAD, 0x27, 0x31,
+        0x65, 0x34, 0x01, 0x6F}};
+
+/*
+ * Checkup routine
+ */
+int mbedtls_sha1_self_test(int verbose) {
+    int i, j, buflen, ret = 0;
+    unsigned char buf[1024];
+    unsigned char sha1sum[20];
+    mbedtls_sha1_context ctx;
+
+    mbedtls_sha1_init(&ctx);
+
+    /*
+     * SHA-1
+     */
+    for (i = 0; i < 3; i++) {
+        if (verbose != 0)
+            mbedtls_printf("  SHA-1 test #%d: ", i + 1);
+
+        if ((ret = mbedtls_sha1_starts(&ctx)) != 0)
+            goto fail;
+
+        if (i == 2) {
+            memset(buf, 'a', buflen = 1000);
+
+            for (j = 0; j < 1000; j++) {
+                ret = mbedtls_sha1_update(&ctx, buf, buflen);
+                if (ret != 0)
+                    goto fail;
+            }
+        } else {
+            ret = mbedtls_sha1_update(&ctx, sha1_test_buf[i], sha1_test_buflen[i]);
+            if (ret != 0)
+                goto fail;
+        }
+
+        if ((ret = mbedtls_sha1_finish(&ctx, sha1sum)) != 0)
+            goto fail;
+
+        if (memcmp(sha1sum, sha1_test_sum[i], 20) != 0) {
+            ret = 1;
+            goto fail;
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+
+    goto exit;
+
+fail:
+    if (verbose != 0)
+        mbedtls_printf("failed\n");
+
+exit:
+    mbedtls_sha1_free(&ctx);
+
+    return (ret);
+}
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_SHA1_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/sha256.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/sha256.cpp
new file mode 100644
index 0000000000..7f6c74aefe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/sha256.cpp
@@ -0,0 +1,549 @@
+/*
+ *  FIPS-180-2 compliant SHA-256 implementation
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+/*
+ *  The SHA-256 Secure Hash Standard was published by NIST in 2002.
+ *
+ *  http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_SHA256_C)
+
+#include <string.h>
+
+#include "mbedtls/error.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/sha256.h"
+
+#if defined(MBEDTLS_SELF_TEST)
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdio.h>
+#include <stdlib.h>
+#define mbedtls_printf printf
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif /* MBEDTLS_PLATFORM_C */
+#endif /* MBEDTLS_SELF_TEST */
+
+#define SHA256_VALIDATE_RET(cond)                                                                  \
+    MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_SHA256_BAD_INPUT_DATA)
+#define SHA256_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+#if !defined(MBEDTLS_SHA256_ALT)
+
+void mbedtls_sha256_init(mbedtls_sha256_context* ctx) {
+    SHA256_VALIDATE(ctx != NULL);
+
+    memset(ctx, 0, sizeof(mbedtls_sha256_context));
+}
+
+void mbedtls_sha256_free(mbedtls_sha256_context* ctx) {
+    if (ctx == NULL)
+        return;
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_sha256_context));
+}
+
+void mbedtls_sha256_clone(mbedtls_sha256_context* dst, const mbedtls_sha256_context* src) {
+    SHA256_VALIDATE(dst != NULL);
+    SHA256_VALIDATE(src != NULL);
+
+    *dst = *src;
+}
+
+/*
+ * SHA-256 context setup
+ */
+int mbedtls_sha256_starts(mbedtls_sha256_context* ctx, int is224) {
+    SHA256_VALIDATE_RET(ctx != NULL);
+
+#if defined(MBEDTLS_SHA224_C)
+    SHA256_VALIDATE_RET(is224 == 0 || is224 == 1);
+#else
+    SHA256_VALIDATE_RET(is224 == 0);
+#endif
+
+    ctx->total[0] = 0;
+    ctx->total[1] = 0;
+
+    if (is224 == 0) {
+        /* SHA-256 */
+        ctx->state[0] = 0x6A09E667;
+        ctx->state[1] = 0xBB67AE85;
+        ctx->state[2] = 0x3C6EF372;
+        ctx->state[3] = 0xA54FF53A;
+        ctx->state[4] = 0x510E527F;
+        ctx->state[5] = 0x9B05688C;
+        ctx->state[6] = 0x1F83D9AB;
+        ctx->state[7] = 0x5BE0CD19;
+    } else {
+#if defined(MBEDTLS_SHA224_C)
+        /* SHA-224 */
+        ctx->state[0] = 0xC1059ED8;
+        ctx->state[1] = 0x367CD507;
+        ctx->state[2] = 0x3070DD17;
+        ctx->state[3] = 0xF70E5939;
+        ctx->state[4] = 0xFFC00B31;
+        ctx->state[5] = 0x68581511;
+        ctx->state[6] = 0x64F98FA7;
+        ctx->state[7] = 0xBEFA4FA4;
+#endif
+    }
+
+    ctx->is224 = is224;
+
+    return (0);
+}
+
+#if !defined(MBEDTLS_SHA256_PROCESS_ALT)
+static const uint32_t K[] = {
+    0x428A2F98,
+    0x71374491,
+    0xB5C0FBCF,
+    0xE9B5DBA5,
+    0x3956C25B,
+    0x59F111F1,
+    0x923F82A4,
+    0xAB1C5ED5,
+    0xD807AA98,
+    0x12835B01,
+    0x243185BE,
+    0x550C7DC3,
+    0x72BE5D74,
+    0x80DEB1FE,
+    0x9BDC06A7,
+    0xC19BF174,
+    0xE49B69C1,
+    0xEFBE4786,
+    0x0FC19DC6,
+    0x240CA1CC,
+    0x2DE92C6F,
+    0x4A7484AA,
+    0x5CB0A9DC,
+    0x76F988DA,
+    0x983E5152,
+    0xA831C66D,
+    0xB00327C8,
+    0xBF597FC7,
+    0xC6E00BF3,
+    0xD5A79147,
+    0x06CA6351,
+    0x14292967,
+    0x27B70A85,
+    0x2E1B2138,
+    0x4D2C6DFC,
+    0x53380D13,
+    0x650A7354,
+    0x766A0ABB,
+    0x81C2C92E,
+    0x92722C85,
+    0xA2BFE8A1,
+    0xA81A664B,
+    0xC24B8B70,
+    0xC76C51A3,
+    0xD192E819,
+    0xD6990624,
+    0xF40E3585,
+    0x106AA070,
+    0x19A4C116,
+    0x1E376C08,
+    0x2748774C,
+    0x34B0BCB5,
+    0x391C0CB3,
+    0x4ED8AA4A,
+    0x5B9CCA4F,
+    0x682E6FF3,
+    0x748F82EE,
+    0x78A5636F,
+    0x84C87814,
+    0x8CC70208,
+    0x90BEFFFA,
+    0xA4506CEB,
+    0xBEF9A3F7,
+    0xC67178F2,
+};
+
+#define SHR(x, n) (((x) & 0xFFFFFFFF) >> (n))
+#define ROTR(x, n) (SHR(x, n) | ((x) << (32 - (n))))
+
+#define S0(x) (ROTR(x, 7) ^ ROTR(x, 18) ^ SHR(x, 3))
+#define S1(x) (ROTR(x, 17) ^ ROTR(x, 19) ^ SHR(x, 10))
+
+#define S2(x) (ROTR(x, 2) ^ ROTR(x, 13) ^ ROTR(x, 22))
+#define S3(x) (ROTR(x, 6) ^ ROTR(x, 11) ^ ROTR(x, 25))
+
+#define F0(x, y, z) (((x) & (y)) | ((z) & ((x) | (y))))
+#define F1(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
+
+#define R(t)                                                                                       \
+    (local.W[t] =                                                                                  \
+            S1(local.W[(t) - 2]) + local.W[(t) - 7] + S0(local.W[(t) - 15]) + local.W[(t) - 16])
+
+#define P(a, b, c, d, e, f, g, h, x, K)                                                            \
+    do {                                                                                           \
+        local.temp1 = (h) + S3(e) + F1((e), (f), (g)) + (K) + (x);                                 \
+        local.temp2 = S2(a) + F0((a), (b), (c));                                                   \
+        (d) += local.temp1;                                                                        \
+        (h) = local.temp1 + local.temp2;                                                           \
+    } while (0)
+
+int mbedtls_internal_sha256_process(mbedtls_sha256_context* ctx, const unsigned char data[64]) {
+    struct {
+        uint32_t temp1, temp2, W[64];
+        uint32_t A[8];
+    } local;
+
+    unsigned int i;
+
+    SHA256_VALIDATE_RET(ctx != NULL);
+    SHA256_VALIDATE_RET((const unsigned char*)data != NULL);
+
+    for (i = 0; i < 8; i++)
+        local.A[i] = ctx->state[i];
+
+#if defined(MBEDTLS_SHA256_SMALLER)
+    for (i = 0; i < 64; i++) {
+        if (i < 16)
+            local.W[i] = MBEDTLS_GET_UINT32_BE(data, 4 * i);
+        else
+            R(i);
+
+        P(local.A[0], local.A[1], local.A[2], local.A[3], local.A[4], local.A[5], local.A[6],
+            local.A[7], local.W[i], K[i]);
+
+        local.temp1 = local.A[7];
+        local.A[7] = local.A[6];
+        local.A[6] = local.A[5];
+        local.A[5] = local.A[4];
+        local.A[4] = local.A[3];
+        local.A[3] = local.A[2];
+        local.A[2] = local.A[1];
+        local.A[1] = local.A[0];
+        local.A[0] = local.temp1;
+    }
+#else  /* MBEDTLS_SHA256_SMALLER */
+    for (i = 0; i < 16; i++)
+        local.W[i] = MBEDTLS_GET_UINT32_BE(data, 4 * i);
+
+    for (i = 0; i < 16; i += 8) {
+        P(local.A[0], local.A[1], local.A[2], local.A[3], local.A[4], local.A[5], local.A[6],
+            local.A[7], local.W[i + 0], K[i + 0]);
+        P(local.A[7], local.A[0], local.A[1], local.A[2], local.A[3], local.A[4], local.A[5],
+            local.A[6], local.W[i + 1], K[i + 1]);
+        P(local.A[6], local.A[7], local.A[0], local.A[1], local.A[2], local.A[3], local.A[4],
+            local.A[5], local.W[i + 2], K[i + 2]);
+        P(local.A[5], local.A[6], local.A[7], local.A[0], local.A[1], local.A[2], local.A[3],
+            local.A[4], local.W[i + 3], K[i + 3]);
+        P(local.A[4], local.A[5], local.A[6], local.A[7], local.A[0], local.A[1], local.A[2],
+            local.A[3], local.W[i + 4], K[i + 4]);
+        P(local.A[3], local.A[4], local.A[5], local.A[6], local.A[7], local.A[0], local.A[1],
+            local.A[2], local.W[i + 5], K[i + 5]);
+        P(local.A[2], local.A[3], local.A[4], local.A[5], local.A[6], local.A[7], local.A[0],
+            local.A[1], local.W[i + 6], K[i + 6]);
+        P(local.A[1], local.A[2], local.A[3], local.A[4], local.A[5], local.A[6], local.A[7],
+            local.A[0], local.W[i + 7], K[i + 7]);
+    }
+
+    for (i = 16; i < 64; i += 8) {
+        P(local.A[0], local.A[1], local.A[2], local.A[3], local.A[4], local.A[5], local.A[6],
+            local.A[7], R(i + 0), K[i + 0]);
+        P(local.A[7], local.A[0], local.A[1], local.A[2], local.A[3], local.A[4], local.A[5],
+            local.A[6], R(i + 1), K[i + 1]);
+        P(local.A[6], local.A[7], local.A[0], local.A[1], local.A[2], local.A[3], local.A[4],
+            local.A[5], R(i + 2), K[i + 2]);
+        P(local.A[5], local.A[6], local.A[7], local.A[0], local.A[1], local.A[2], local.A[3],
+            local.A[4], R(i + 3), K[i + 3]);
+        P(local.A[4], local.A[5], local.A[6], local.A[7], local.A[0], local.A[1], local.A[2],
+            local.A[3], R(i + 4), K[i + 4]);
+        P(local.A[3], local.A[4], local.A[5], local.A[6], local.A[7], local.A[0], local.A[1],
+            local.A[2], R(i + 5), K[i + 5]);
+        P(local.A[2], local.A[3], local.A[4], local.A[5], local.A[6], local.A[7], local.A[0],
+            local.A[1], R(i + 6), K[i + 6]);
+        P(local.A[1], local.A[2], local.A[3], local.A[4], local.A[5], local.A[6], local.A[7],
+            local.A[0], R(i + 7), K[i + 7]);
+    }
+#endif /* MBEDTLS_SHA256_SMALLER */
+
+    for (i = 0; i < 8; i++)
+        ctx->state[i] += local.A[i];
+
+    /* Zeroise buffers and variables to clear sensitive data from memory. */
+    mbedtls_platform_zeroize(&local, sizeof(local));
+
+    return (0);
+}
+
+#endif /* !MBEDTLS_SHA256_PROCESS_ALT */
+
+/*
+ * SHA-256 process buffer
+ */
+int mbedtls_sha256_update(mbedtls_sha256_context* ctx, const unsigned char* input, size_t ilen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t fill;
+    uint32_t left;
+
+    SHA256_VALIDATE_RET(ctx != NULL);
+    SHA256_VALIDATE_RET(ilen == 0 || input != NULL);
+
+    if (ilen == 0)
+        return (0);
+
+    left = ctx->total[0] & 0x3F;
+    fill = 64 - left;
+
+    ctx->total[0] += (uint32_t)ilen;
+    ctx->total[0] &= 0xFFFFFFFF;
+
+    if (ctx->total[0] < (uint32_t)ilen)
+        ctx->total[1]++;
+
+    if (left && ilen >= fill) {
+        memcpy((void*)(ctx->buffer + left), input, fill);
+
+        if ((ret = mbedtls_internal_sha256_process(ctx, ctx->buffer)) != 0)
+            return (ret);
+
+        input += fill;
+        ilen -= fill;
+        left = 0;
+    }
+
+    while (ilen >= 64) {
+        if ((ret = mbedtls_internal_sha256_process(ctx, input)) != 0)
+            return (ret);
+
+        input += 64;
+        ilen -= 64;
+    }
+
+    if (ilen > 0)
+        memcpy((void*)(ctx->buffer + left), input, ilen);
+
+    return (0);
+}
+
+/*
+ * SHA-256 final digest
+ */
+int mbedtls_sha256_finish(mbedtls_sha256_context* ctx, unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    uint32_t used;
+    uint32_t high, low;
+
+    SHA256_VALIDATE_RET(ctx != NULL);
+    SHA256_VALIDATE_RET((unsigned char*)output != NULL);
+
+    /*
+     * Add padding: 0x80 then 0x00 until 8 bytes remain for the length
+     */
+    used = ctx->total[0] & 0x3F;
+
+    ctx->buffer[used++] = 0x80;
+
+    if (used <= 56) {
+        /* Enough room for padding + length in current block */
+        memset(ctx->buffer + used, 0, 56 - used);
+    } else {
+        /* We'll need an extra block */
+        memset(ctx->buffer + used, 0, 64 - used);
+
+        if ((ret = mbedtls_internal_sha256_process(ctx, ctx->buffer)) != 0)
+            return (ret);
+
+        memset(ctx->buffer, 0, 56);
+    }
+
+    /*
+     * Add message length
+     */
+    high = (ctx->total[0] >> 29) | (ctx->total[1] << 3);
+    low = (ctx->total[0] << 3);
+
+    MBEDTLS_PUT_UINT32_BE(high, ctx->buffer, 56);
+    MBEDTLS_PUT_UINT32_BE(low, ctx->buffer, 60);
+
+    if ((ret = mbedtls_internal_sha256_process(ctx, ctx->buffer)) != 0)
+        return (ret);
+
+    /*
+     * Output final state
+     */
+    MBEDTLS_PUT_UINT32_BE(ctx->state[0], output, 0);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[1], output, 4);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[2], output, 8);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[3], output, 12);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[4], output, 16);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[5], output, 20);
+    MBEDTLS_PUT_UINT32_BE(ctx->state[6], output, 24);
+
+#if defined(MBEDTLS_SHA224_C)
+    if (ctx->is224 == 0)
+#endif
+        MBEDTLS_PUT_UINT32_BE(ctx->state[7], output, 28);
+
+    return (0);
+}
+
+#endif /* !MBEDTLS_SHA256_ALT */
+
+/*
+ * output = SHA-256( input buffer )
+ */
+int mbedtls_sha256(const unsigned char* input, size_t ilen, unsigned char* output, int is224) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_sha256_context ctx;
+
+#if defined(MBEDTLS_SHA224_C)
+    SHA256_VALIDATE_RET(is224 == 0 || is224 == 1);
+#else
+    SHA256_VALIDATE_RET(is224 == 0);
+#endif
+
+    SHA256_VALIDATE_RET(ilen == 0 || input != NULL);
+    SHA256_VALIDATE_RET((unsigned char*)output != NULL);
+
+    mbedtls_sha256_init(&ctx);
+
+    if ((ret = mbedtls_sha256_starts(&ctx, is224)) != 0)
+        goto exit;
+
+    if ((ret = mbedtls_sha256_update(&ctx, input, ilen)) != 0)
+        goto exit;
+
+    if ((ret = mbedtls_sha256_finish(&ctx, output)) != 0)
+        goto exit;
+
+exit:
+    mbedtls_sha256_free(&ctx);
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_SELF_TEST)
+/*
+ * FIPS-180-2 test vectors
+ */
+static const unsigned char sha256_test_buf[3][57] = {{"abc"},
+    {"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"}, {""}};
+
+static const size_t sha256_test_buflen[3] = {3, 56, 1000};
+
+static const unsigned char sha256_test_sum[6][32] = {
+    /*
+     * SHA-224 test vectors
+     */
+    {0x23, 0x09, 0x7D, 0x22, 0x34, 0x05, 0xD8, 0x22, 0x86, 0x42, 0xA4, 0x77, 0xBD, 0xA2, 0x55, 0xB3,
+        0x2A, 0xAD, 0xBC, 0xE4, 0xBD, 0xA0, 0xB3, 0xF7, 0xE3, 0x6C, 0x9D, 0xA7},
+    {0x75, 0x38, 0x8B, 0x16, 0x51, 0x27, 0x76, 0xCC, 0x5D, 0xBA, 0x5D, 0xA1, 0xFD, 0x89, 0x01, 0x50,
+        0xB0, 0xC6, 0x45, 0x5C, 0xB4, 0xF5, 0x8B, 0x19, 0x52, 0x52, 0x25, 0x25},
+    {0x20, 0x79, 0x46, 0x55, 0x98, 0x0C, 0x91, 0xD8, 0xBB, 0xB4, 0xC1, 0xEA, 0x97, 0x61, 0x8A, 0x4B,
+        0xF0, 0x3F, 0x42, 0x58, 0x19, 0x48, 0xB2, 0xEE, 0x4E, 0xE7, 0xAD, 0x67},
+
+    /*
+     * SHA-256 test vectors
+     */
+    {0xBA, 0x78, 0x16, 0xBF, 0x8F, 0x01, 0xCF, 0xEA, 0x41, 0x41, 0x40, 0xDE, 0x5D, 0xAE, 0x22, 0x23,
+        0xB0, 0x03, 0x61, 0xA3, 0x96, 0x17, 0x7A, 0x9C, 0xB4, 0x10, 0xFF, 0x61, 0xF2, 0x00, 0x15,
+        0xAD},
+    {0x24, 0x8D, 0x6A, 0x61, 0xD2, 0x06, 0x38, 0xB8, 0xE5, 0xC0, 0x26, 0x93, 0x0C, 0x3E, 0x60, 0x39,
+        0xA3, 0x3C, 0xE4, 0x59, 0x64, 0xFF, 0x21, 0x67, 0xF6, 0xEC, 0xED, 0xD4, 0x19, 0xDB, 0x06,
+        0xC1},
+    {0xCD, 0xC7, 0x6E, 0x5C, 0x99, 0x14, 0xFB, 0x92, 0x81, 0xA1, 0xC7, 0xE2, 0x84, 0xD7, 0x3E, 0x67,
+        0xF1, 0x80, 0x9A, 0x48, 0xA4, 0x97, 0x20, 0x0E, 0x04, 0x6D, 0x39, 0xCC, 0xC7, 0x11, 0x2C,
+        0xD0}};
+
+/*
+ * Checkup routine
+ */
+int mbedtls_sha256_self_test(int verbose) {
+    int i, j, k, buflen, ret = 0;
+    unsigned char* buf;
+    unsigned char sha256sum[32];
+    mbedtls_sha256_context ctx;
+
+    buf = mbedtls_calloc(1024, sizeof(unsigned char));
+    if (NULL == buf) {
+        if (verbose != 0)
+            mbedtls_printf("Buffer allocation failed\n");
+
+        return (1);
+    }
+
+    mbedtls_sha256_init(&ctx);
+
+    for (i = 0; i < 6; i++) {
+        j = i % 3;
+        k = i < 3;
+
+        if (verbose != 0)
+            mbedtls_printf("  SHA-%d test #%d: ", 256 - k * 32, j + 1);
+
+        if ((ret = mbedtls_sha256_starts(&ctx, k)) != 0)
+            goto fail;
+
+        if (j == 2) {
+            memset(buf, 'a', buflen = 1000);
+
+            for (j = 0; j < 1000; j++) {
+                ret = mbedtls_sha256_update(&ctx, buf, buflen);
+                if (ret != 0)
+                    goto fail;
+            }
+
+        } else {
+            ret = mbedtls_sha256_update(&ctx, sha256_test_buf[j], sha256_test_buflen[j]);
+            if (ret != 0)
+                goto fail;
+        }
+
+        if ((ret = mbedtls_sha256_finish(&ctx, sha256sum)) != 0)
+            goto fail;
+
+        if (memcmp(sha256sum, sha256_test_sum[i], 32 - k * 4) != 0) {
+            ret = 1;
+            goto fail;
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+
+    goto exit;
+
+fail:
+    if (verbose != 0)
+        mbedtls_printf("failed\n");
+
+exit:
+    mbedtls_sha256_free(&ctx);
+    mbedtls_free(buf);
+
+    return (ret);
+}
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_SHA256_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/sha512.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/sha512.cpp
new file mode 100644
index 0000000000..8c2c4b3884
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/mbedtls/library/sha512.cpp
@@ -0,0 +1,547 @@
+/*
+ *  FIPS-180-2 compliant SHA-384/512 implementation
+ *
+ *  Copyright The Mbed TLS Contributors
+ *  SPDX-License-Identifier: Apache-2.0
+ *
+ *  Licensed under the Apache License, Version 2.0 (the "License"); you may
+ *  not use this file except in compliance with the License.
+ *  You may obtain a copy of the License at
+ *
+ *  http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *  Unless required by applicable law or agreed to in writing, software
+ *  distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *  See the License for the specific language governing permissions and
+ *  limitations under the License.
+ */
+/*
+ *  The SHA-512 Secure Hash Standard was published by NIST in 2002.
+ *
+ *  http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
+ */
+
+#include "common.h"
+
+#if defined(MBEDTLS_SHA512_C)
+
+#include "mbedtls/error.h"
+#include "mbedtls/platform_util.h"
+#include "mbedtls/sha512.h"
+
+#if defined(_MSC_VER) || defined(__WATCOMC__)
+#define UL64(x) x##ui64
+#else
+#define UL64(x) x##ULL
+#endif
+
+#include <string.h>
+
+#if defined(MBEDTLS_SELF_TEST)
+#if defined(MBEDTLS_PLATFORM_C)
+#include "mbedtls/platform.h"
+#else
+#include <stdio.h>
+#include <stdlib.h>
+#define mbedtls_printf printf
+#define mbedtls_calloc calloc
+#define mbedtls_free free
+#endif /* MBEDTLS_PLATFORM_C */
+#endif /* MBEDTLS_SELF_TEST */
+
+#define SHA512_VALIDATE_RET(cond)                                                                  \
+    MBEDTLS_INTERNAL_VALIDATE_RET(cond, MBEDTLS_ERR_SHA512_BAD_INPUT_DATA)
+#define SHA512_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE(cond)
+
+#if !defined(MBEDTLS_SHA512_ALT)
+
+#if defined(MBEDTLS_SHA512_SMALLER)
+static void sha512_put_uint64_be(uint64_t n, unsigned char* b, uint8_t i) {
+    MBEDTLS_PUT_UINT64_BE(n, b, i);
+}
+#else
+#define sha512_put_uint64_be MBEDTLS_PUT_UINT64_BE
+#endif /* MBEDTLS_SHA512_SMALLER */
+
+void mbedtls_sha512_init(mbedtls_sha512_context* ctx) {
+    SHA512_VALIDATE(ctx != NULL);
+
+    memset(ctx, 0, sizeof(mbedtls_sha512_context));
+}
+
+void mbedtls_sha512_free(mbedtls_sha512_context* ctx) {
+    if (ctx == NULL)
+        return;
+
+    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_sha512_context));
+}
+
+void mbedtls_sha512_clone(mbedtls_sha512_context* dst, const mbedtls_sha512_context* src) {
+    SHA512_VALIDATE(dst != NULL);
+    SHA512_VALIDATE(src != NULL);
+
+    *dst = *src;
+}
+
+/*
+ * SHA-512 context setup
+ */
+int mbedtls_sha512_starts(mbedtls_sha512_context* ctx, int is384) {
+    SHA512_VALIDATE_RET(ctx != NULL);
+#if defined(MBEDTLS_SHA384_C)
+    SHA512_VALIDATE_RET(is384 == 0 || is384 == 1);
+#else
+    SHA512_VALIDATE_RET(is384 == 0);
+#endif
+
+    ctx->total[0] = 0;
+    ctx->total[1] = 0;
+
+    if (is384 == 0) {
+        /* SHA-512 */
+        ctx->state[0] = UL64(0x6A09E667F3BCC908);
+        ctx->state[1] = UL64(0xBB67AE8584CAA73B);
+        ctx->state[2] = UL64(0x3C6EF372FE94F82B);
+        ctx->state[3] = UL64(0xA54FF53A5F1D36F1);
+        ctx->state[4] = UL64(0x510E527FADE682D1);
+        ctx->state[5] = UL64(0x9B05688C2B3E6C1F);
+        ctx->state[6] = UL64(0x1F83D9ABFB41BD6B);
+        ctx->state[7] = UL64(0x5BE0CD19137E2179);
+    } else {
+#if !defined(MBEDTLS_SHA384_C)
+        return (MBEDTLS_ERR_SHA512_BAD_INPUT_DATA);
+#else
+        /* SHA-384 */
+        ctx->state[0] = UL64(0xCBBB9D5DC1059ED8);
+        ctx->state[1] = UL64(0x629A292A367CD507);
+        ctx->state[2] = UL64(0x9159015A3070DD17);
+        ctx->state[3] = UL64(0x152FECD8F70E5939);
+        ctx->state[4] = UL64(0x67332667FFC00B31);
+        ctx->state[5] = UL64(0x8EB44A8768581511);
+        ctx->state[6] = UL64(0xDB0C2E0D64F98FA7);
+        ctx->state[7] = UL64(0x47B5481DBEFA4FA4);
+#endif /* MBEDTLS_SHA384_C */
+    }
+
+#if defined(MBEDTLS_SHA384_C)
+    ctx->is384 = is384;
+#endif
+
+    return (0);
+}
+
+#if !defined(MBEDTLS_SHA512_PROCESS_ALT)
+
+/*
+ * Round constants
+ */
+static const uint64_t K[80] = {UL64(0x428A2F98D728AE22), UL64(0x7137449123EF65CD),
+    UL64(0xB5C0FBCFEC4D3B2F), UL64(0xE9B5DBA58189DBBC), UL64(0x3956C25BF348B538),
+    UL64(0x59F111F1B605D019), UL64(0x923F82A4AF194F9B), UL64(0xAB1C5ED5DA6D8118),
+    UL64(0xD807AA98A3030242), UL64(0x12835B0145706FBE), UL64(0x243185BE4EE4B28C),
+    UL64(0x550C7DC3D5FFB4E2), UL64(0x72BE5D74F27B896F), UL64(0x80DEB1FE3B1696B1),
+    UL64(0x9BDC06A725C71235), UL64(0xC19BF174CF692694), UL64(0xE49B69C19EF14AD2),
+    UL64(0xEFBE4786384F25E3), UL64(0x0FC19DC68B8CD5B5), UL64(0x240CA1CC77AC9C65),
+    UL64(0x2DE92C6F592B0275), UL64(0x4A7484AA6EA6E483), UL64(0x5CB0A9DCBD41FBD4),
+    UL64(0x76F988DA831153B5), UL64(0x983E5152EE66DFAB), UL64(0xA831C66D2DB43210),
+    UL64(0xB00327C898FB213F), UL64(0xBF597FC7BEEF0EE4), UL64(0xC6E00BF33DA88FC2),
+    UL64(0xD5A79147930AA725), UL64(0x06CA6351E003826F), UL64(0x142929670A0E6E70),
+    UL64(0x27B70A8546D22FFC), UL64(0x2E1B21385C26C926), UL64(0x4D2C6DFC5AC42AED),
+    UL64(0x53380D139D95B3DF), UL64(0x650A73548BAF63DE), UL64(0x766A0ABB3C77B2A8),
+    UL64(0x81C2C92E47EDAEE6), UL64(0x92722C851482353B), UL64(0xA2BFE8A14CF10364),
+    UL64(0xA81A664BBC423001), UL64(0xC24B8B70D0F89791), UL64(0xC76C51A30654BE30),
+    UL64(0xD192E819D6EF5218), UL64(0xD69906245565A910), UL64(0xF40E35855771202A),
+    UL64(0x106AA07032BBD1B8), UL64(0x19A4C116B8D2D0C8), UL64(0x1E376C085141AB53),
+    UL64(0x2748774CDF8EEB99), UL64(0x34B0BCB5E19B48A8), UL64(0x391C0CB3C5C95A63),
+    UL64(0x4ED8AA4AE3418ACB), UL64(0x5B9CCA4F7763E373), UL64(0x682E6FF3D6B2B8A3),
+    UL64(0x748F82EE5DEFB2FC), UL64(0x78A5636F43172F60), UL64(0x84C87814A1F0AB72),
+    UL64(0x8CC702081A6439EC), UL64(0x90BEFFFA23631E28), UL64(0xA4506CEBDE82BDE9),
+    UL64(0xBEF9A3F7B2C67915), UL64(0xC67178F2E372532B), UL64(0xCA273ECEEA26619C),
+    UL64(0xD186B8C721C0C207), UL64(0xEADA7DD6CDE0EB1E), UL64(0xF57D4F7FEE6ED178),
+    UL64(0x06F067AA72176FBA), UL64(0x0A637DC5A2C898A6), UL64(0x113F9804BEF90DAE),
+    UL64(0x1B710B35131C471B), UL64(0x28DB77F523047D84), UL64(0x32CAAB7B40C72493),
+    UL64(0x3C9EBE0A15C9BEBC), UL64(0x431D67C49C100D4C), UL64(0x4CC5D4BECB3E42B6),
+    UL64(0x597F299CFC657E2A), UL64(0x5FCB6FAB3AD6FAEC), UL64(0x6C44198C4A475817)};
+
+int mbedtls_internal_sha512_process(mbedtls_sha512_context* ctx, const unsigned char data[128]) {
+    int i;
+    struct {
+        uint64_t temp1, temp2, W[80];
+        uint64_t A[8];
+    } local;
+
+    SHA512_VALIDATE_RET(ctx != NULL);
+    SHA512_VALIDATE_RET((const unsigned char*)data != NULL);
+
+#define SHR(x, n) ((x) >> (n))
+#define ROTR(x, n) (SHR((x), (n)) | ((x) << (64 - (n))))
+
+#define S0(x) (ROTR(x, 1) ^ ROTR(x, 8) ^ SHR(x, 7))
+#define S1(x) (ROTR(x, 19) ^ ROTR(x, 61) ^ SHR(x, 6))
+
+#define S2(x) (ROTR(x, 28) ^ ROTR(x, 34) ^ ROTR(x, 39))
+#define S3(x) (ROTR(x, 14) ^ ROTR(x, 18) ^ ROTR(x, 41))
+
+#define F0(x, y, z) (((x) & (y)) | ((z) & ((x) | (y))))
+#define F1(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
+
+#define P(a, b, c, d, e, f, g, h, x, K)                                                            \
+    do {                                                                                           \
+        local.temp1 = (h) + S3(e) + F1((e), (f), (g)) + (K) + (x);                                 \
+        local.temp2 = S2(a) + F0((a), (b), (c));                                                   \
+        (d) += local.temp1;                                                                        \
+        (h) = local.temp1 + local.temp2;                                                           \
+    } while (0)
+
+    for (i = 0; i < 8; i++)
+        local.A[i] = ctx->state[i];
+
+#if defined(MBEDTLS_SHA512_SMALLER)
+    for (i = 0; i < 80; i++) {
+        if (i < 16) {
+            local.W[i] = MBEDTLS_GET_UINT64_BE(data, i << 3);
+        } else {
+            local.W[i] =
+                S1(local.W[i - 2]) + local.W[i - 7] + S0(local.W[i - 15]) + local.W[i - 16];
+        }
+
+        P(local.A[0], local.A[1], local.A[2], local.A[3], local.A[4], local.A[5], local.A[6],
+            local.A[7], local.W[i], K[i]);
+
+        local.temp1 = local.A[7];
+        local.A[7] = local.A[6];
+        local.A[6] = local.A[5];
+        local.A[5] = local.A[4];
+        local.A[4] = local.A[3];
+        local.A[3] = local.A[2];
+        local.A[2] = local.A[1];
+        local.A[1] = local.A[0];
+        local.A[0] = local.temp1;
+    }
+#else  /* MBEDTLS_SHA512_SMALLER */
+    for (i = 0; i < 16; i++) {
+        local.W[i] = MBEDTLS_GET_UINT64_BE(data, i << 3);
+    }
+
+    for (; i < 80; i++) {
+        local.W[i] = S1(local.W[i - 2]) + local.W[i - 7] + S0(local.W[i - 15]) + local.W[i - 16];
+    }
+
+    i = 0;
+    do {
+        P(local.A[0], local.A[1], local.A[2], local.A[3], local.A[4], local.A[5], local.A[6],
+            local.A[7], local.W[i], K[i]);
+        i++;
+        P(local.A[7], local.A[0], local.A[1], local.A[2], local.A[3], local.A[4], local.A[5],
+            local.A[6], local.W[i], K[i]);
+        i++;
+        P(local.A[6], local.A[7], local.A[0], local.A[1], local.A[2], local.A[3], local.A[4],
+            local.A[5], local.W[i], K[i]);
+        i++;
+        P(local.A[5], local.A[6], local.A[7], local.A[0], local.A[1], local.A[2], local.A[3],
+            local.A[4], local.W[i], K[i]);
+        i++;
+        P(local.A[4], local.A[5], local.A[6], local.A[7], local.A[0], local.A[1], local.A[2],
+            local.A[3], local.W[i], K[i]);
+        i++;
+        P(local.A[3], local.A[4], local.A[5], local.A[6], local.A[7], local.A[0], local.A[1],
+            local.A[2], local.W[i], K[i]);
+        i++;
+        P(local.A[2], local.A[3], local.A[4], local.A[5], local.A[6], local.A[7], local.A[0],
+            local.A[1], local.W[i], K[i]);
+        i++;
+        P(local.A[1], local.A[2], local.A[3], local.A[4], local.A[5], local.A[6], local.A[7],
+            local.A[0], local.W[i], K[i]);
+        i++;
+    } while (i < 80);
+#endif /* MBEDTLS_SHA512_SMALLER */
+
+    for (i = 0; i < 8; i++)
+        ctx->state[i] += local.A[i];
+
+    /* Zeroise buffers and variables to clear sensitive data from memory. */
+    mbedtls_platform_zeroize(&local, sizeof(local));
+
+    return (0);
+}
+
+#endif /* !MBEDTLS_SHA512_PROCESS_ALT */
+
+/*
+ * SHA-512 process buffer
+ */
+int mbedtls_sha512_update(mbedtls_sha512_context* ctx, const unsigned char* input, size_t ilen) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    size_t fill;
+    unsigned int left;
+
+    SHA512_VALIDATE_RET(ctx != NULL);
+    SHA512_VALIDATE_RET(ilen == 0 || input != NULL);
+
+    if (ilen == 0)
+        return (0);
+
+    left = (unsigned int)(ctx->total[0] & 0x7F);
+    fill = 128 - left;
+
+    ctx->total[0] += (uint64_t)ilen;
+
+    if (ctx->total[0] < (uint64_t)ilen)
+        ctx->total[1]++;
+
+    if (left && ilen >= fill) {
+        memcpy((void*)(ctx->buffer + left), input, fill);
+
+        if ((ret = mbedtls_internal_sha512_process(ctx, ctx->buffer)) != 0)
+            return (ret);
+
+        input += fill;
+        ilen -= fill;
+        left = 0;
+    }
+
+    while (ilen >= 128) {
+        if ((ret = mbedtls_internal_sha512_process(ctx, input)) != 0)
+            return (ret);
+
+        input += 128;
+        ilen -= 128;
+    }
+
+    if (ilen > 0)
+        memcpy((void*)(ctx->buffer + left), input, ilen);
+
+    return (0);
+}
+
+/*
+ * SHA-512 final digest
+ */
+int mbedtls_sha512_finish(mbedtls_sha512_context* ctx, unsigned char* output) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    unsigned used;
+    uint64_t high, low;
+
+    SHA512_VALIDATE_RET(ctx != NULL);
+    SHA512_VALIDATE_RET((unsigned char*)output != NULL);
+
+    /*
+     * Add padding: 0x80 then 0x00 until 16 bytes remain for the length
+     */
+    used = ctx->total[0] & 0x7F;
+
+    ctx->buffer[used++] = 0x80;
+
+    if (used <= 112) {
+        /* Enough room for padding + length in current block */
+        memset(ctx->buffer + used, 0, 112 - used);
+    } else {
+        /* We'll need an extra block */
+        memset(ctx->buffer + used, 0, 128 - used);
+
+        if ((ret = mbedtls_internal_sha512_process(ctx, ctx->buffer)) != 0)
+            return (ret);
+
+        memset(ctx->buffer, 0, 112);
+    }
+
+    /*
+     * Add message length
+     */
+    high = (ctx->total[0] >> 61) | (ctx->total[1] << 3);
+    low = (ctx->total[0] << 3);
+
+    sha512_put_uint64_be(high, ctx->buffer, 112);
+    sha512_put_uint64_be(low, ctx->buffer, 120);
+
+    if ((ret = mbedtls_internal_sha512_process(ctx, ctx->buffer)) != 0)
+        return (ret);
+
+    /*
+     * Output final state
+     */
+    sha512_put_uint64_be(ctx->state[0], output, 0);
+    sha512_put_uint64_be(ctx->state[1], output, 8);
+    sha512_put_uint64_be(ctx->state[2], output, 16);
+    sha512_put_uint64_be(ctx->state[3], output, 24);
+    sha512_put_uint64_be(ctx->state[4], output, 32);
+    sha512_put_uint64_be(ctx->state[5], output, 40);
+
+#if defined(MBEDTLS_SHA384_C)
+    if (ctx->is384 == 0)
+#endif
+    {
+        sha512_put_uint64_be(ctx->state[6], output, 48);
+        sha512_put_uint64_be(ctx->state[7], output, 56);
+    }
+
+    return (0);
+}
+
+#endif /* !MBEDTLS_SHA512_ALT */
+
+/*
+ * output = SHA-512( input buffer )
+ */
+int mbedtls_sha512(const unsigned char* input, size_t ilen, unsigned char* output, int is384) {
+    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
+    mbedtls_sha512_context ctx;
+
+#if defined(MBEDTLS_SHA384_C)
+    SHA512_VALIDATE_RET(is384 == 0 || is384 == 1);
+#else
+    SHA512_VALIDATE_RET(is384 == 0);
+#endif
+    SHA512_VALIDATE_RET(ilen == 0 || input != NULL);
+    SHA512_VALIDATE_RET((unsigned char*)output != NULL);
+
+    mbedtls_sha512_init(&ctx);
+
+    if ((ret = mbedtls_sha512_starts(&ctx, is384)) != 0)
+        goto exit;
+
+    if ((ret = mbedtls_sha512_update(&ctx, input, ilen)) != 0)
+        goto exit;
+
+    if ((ret = mbedtls_sha512_finish(&ctx, output)) != 0)
+        goto exit;
+
+exit:
+    mbedtls_sha512_free(&ctx);
+
+    return (ret);
+}
+
+#if defined(MBEDTLS_SELF_TEST)
+
+/*
+ * FIPS-180-2 test vectors
+ */
+static const unsigned char sha512_test_buf[3][113] = {{"abc"},
+    {"abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmnhijklmnoijklmnopjklmnopqklmnopqrlmnop"
+     "qrsmnopqrstnopqrstu"},
+    {""}};
+
+static const size_t sha512_test_buflen[3] = {3, 112, 1000};
+
+static const unsigned char sha512_test_sum[][64] = {
+#if defined(MBEDTLS_SHA384_C)
+    /*
+     * SHA-384 test vectors
+     */
+    {0xCB, 0x00, 0x75, 0x3F, 0x45, 0xA3, 0x5E, 0x8B, 0xB5, 0xA0, 0x3D, 0x69, 0x9A, 0xC6, 0x50, 0x07,
+        0x27, 0x2C, 0x32, 0xAB, 0x0E, 0xDE, 0xD1, 0x63, 0x1A, 0x8B, 0x60, 0x5A, 0x43, 0xFF, 0x5B,
+        0xED, 0x80, 0x86, 0x07, 0x2B, 0xA1, 0xE7, 0xCC, 0x23, 0x58, 0xBA, 0xEC, 0xA1, 0x34, 0xC8,
+        0x25, 0xA7},
+    {0x09, 0x33, 0x0C, 0x33, 0xF7, 0x11, 0x47, 0xE8, 0x3D, 0x19, 0x2F, 0xC7, 0x82, 0xCD, 0x1B, 0x47,
+        0x53, 0x11, 0x1B, 0x17, 0x3B, 0x3B, 0x05, 0xD2, 0x2F, 0xA0, 0x80, 0x86, 0xE3, 0xB0, 0xF7,
+        0x12, 0xFC, 0xC7, 0xC7, 0x1A, 0x55, 0x7E, 0x2D, 0xB9, 0x66, 0xC3, 0xE9, 0xFA, 0x91, 0x74,
+        0x60, 0x39},
+    {0x9D, 0x0E, 0x18, 0x09, 0x71, 0x64, 0x74, 0xCB, 0x08, 0x6E, 0x83, 0x4E, 0x31, 0x0A, 0x4A, 0x1C,
+        0xED, 0x14, 0x9E, 0x9C, 0x00, 0xF2, 0x48, 0x52, 0x79, 0x72, 0xCE, 0xC5, 0x70, 0x4C, 0x2A,
+        0x5B, 0x07, 0xB8, 0xB3, 0xDC, 0x38, 0xEC, 0xC4, 0xEB, 0xAE, 0x97, 0xDD, 0xD8, 0x7F, 0x3D,
+        0x89, 0x85},
+#endif /* MBEDTLS_SHA384_C */
+
+    /*
+     * SHA-512 test vectors
+     */
+    {0xDD, 0xAF, 0x35, 0xA1, 0x93, 0x61, 0x7A, 0xBA, 0xCC, 0x41, 0x73, 0x49, 0xAE, 0x20, 0x41, 0x31,
+        0x12, 0xE6, 0xFA, 0x4E, 0x89, 0xA9, 0x7E, 0xA2, 0x0A, 0x9E, 0xEE, 0xE6, 0x4B, 0x55, 0xD3,
+        0x9A, 0x21, 0x92, 0x99, 0x2A, 0x27, 0x4F, 0xC1, 0xA8, 0x36, 0xBA, 0x3C, 0x23, 0xA3, 0xFE,
+        0xEB, 0xBD, 0x45, 0x4D, 0x44, 0x23, 0x64, 0x3C, 0xE8, 0x0E, 0x2A, 0x9A, 0xC9, 0x4F, 0xA5,
+        0x4C, 0xA4, 0x9F},
+    {0x8E, 0x95, 0x9B, 0x75, 0xDA, 0xE3, 0x13, 0xDA, 0x8C, 0xF4, 0xF7, 0x28, 0x14, 0xFC, 0x14, 0x3F,
+        0x8F, 0x77, 0x79, 0xC6, 0xEB, 0x9F, 0x7F, 0xA1, 0x72, 0x99, 0xAE, 0xAD, 0xB6, 0x88, 0x90,
+        0x18, 0x50, 0x1D, 0x28, 0x9E, 0x49, 0x00, 0xF7, 0xE4, 0x33, 0x1B, 0x99, 0xDE, 0xC4, 0xB5,
+        0x43, 0x3A, 0xC7, 0xD3, 0x29, 0xEE, 0xB6, 0xDD, 0x26, 0x54, 0x5E, 0x96, 0xE5, 0x5B, 0x87,
+        0x4B, 0xE9, 0x09},
+    {0xE7, 0x18, 0x48, 0x3D, 0x0C, 0xE7, 0x69, 0x64, 0x4E, 0x2E, 0x42, 0xC7, 0xBC, 0x15, 0xB4, 0x63,
+        0x8E, 0x1F, 0x98, 0xB1, 0x3B, 0x20, 0x44, 0x28, 0x56, 0x32, 0xA8, 0x03, 0xAF, 0xA9, 0x73,
+        0xEB, 0xDE, 0x0F, 0xF2, 0x44, 0x87, 0x7E, 0xA6, 0x0A, 0x4C, 0xB0, 0x43, 0x2C, 0xE5, 0x77,
+        0xC3, 0x1B, 0xEB, 0x00, 0x9C, 0x5C, 0x2C, 0x49, 0xAA, 0x2E, 0x4E, 0xAD, 0xB2, 0x17, 0xAD,
+        0x8C, 0xC0, 0x9B}};
+
+#define ARRAY_LENGTH(a) (sizeof(a) / sizeof((a)[0]))
+
+/*
+ * Checkup routine
+ */
+int mbedtls_sha512_self_test(int verbose) {
+    int i, j, k, buflen, ret = 0;
+    unsigned char* buf;
+    unsigned char sha512sum[64];
+    mbedtls_sha512_context ctx;
+
+    buf = mbedtls_calloc(1024, sizeof(unsigned char));
+    if (NULL == buf) {
+        if (verbose != 0)
+            mbedtls_printf("Buffer allocation failed\n");
+
+        return (1);
+    }
+
+    mbedtls_sha512_init(&ctx);
+
+    for (i = 0; i < (int)ARRAY_LENGTH(sha512_test_sum); i++) {
+        j = i % 3;
+#if defined(MBEDTLS_SHA384_C)
+        k = i < 3;
+#else
+        k = 0;
+#endif
+
+        if (verbose != 0)
+            mbedtls_printf("  SHA-%d test #%d: ", 512 - k * 128, j + 1);
+
+        if ((ret = mbedtls_sha512_starts(&ctx, k)) != 0)
+            goto fail;
+
+        if (j == 2) {
+            memset(buf, 'a', buflen = 1000);
+
+            for (j = 0; j < 1000; j++) {
+                ret = mbedtls_sha512_update(&ctx, buf, buflen);
+                if (ret != 0)
+                    goto fail;
+            }
+        } else {
+            ret = mbedtls_sha512_update(&ctx, sha512_test_buf[j], sha512_test_buflen[j]);
+            if (ret != 0)
+                goto fail;
+        }
+
+        if ((ret = mbedtls_sha512_finish(&ctx, sha512sum)) != 0)
+            goto fail;
+
+        if (memcmp(sha512sum, sha512_test_sum[i], 64 - k * 16) != 0) {
+            ret = 1;
+            goto fail;
+        }
+
+        if (verbose != 0)
+            mbedtls_printf("passed\n");
+    }
+
+    if (verbose != 0)
+        mbedtls_printf("\n");
+
+    goto exit;
+
+fail:
+    if (verbose != 0)
+        mbedtls_printf("failed\n");
+
+exit:
+    mbedtls_sha512_free(&ctx);
+    mbedtls_free(buf);
+
+    return (ret);
+}
+
+#undef ARRAY_LENGTH
+
+#endif /* MBEDTLS_SELF_TEST */
+
+#endif /* MBEDTLS_SHA512_C */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/CMakeLists.txt
new file mode 100644
index 0000000000..7948c43da7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/CMakeLists.txt
@@ -0,0 +1,9 @@
+if(POLICY CMP0063)
+    cmake_policy(SET CMP0063 NEW)
+endif()
+
+add_library(miniz STATIC miniz.cpp)
+
+target_include_directories(
+  miniz
+  PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/LICENSE
new file mode 100755
index 0000000000..1982f4bb8f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/LICENSE
@@ -0,0 +1,22 @@
+Copyright 2013-2014 RAD Game Tools and Valve Software
+Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
+
+All Rights Reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/miniz.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/miniz.cpp
new file mode 100755
index 0000000000..eecb3afbcc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/miniz.cpp
@@ -0,0 +1,7544 @@
+/**************************************************************************
+ *
+ * Copyright 2013-2014 RAD Game Tools and Valve Software
+ * Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
+ * All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ *
+ **************************************************************************/
+
+#include "miniz.hpp"
+
+namespace miniz {
+typedef unsigned char mz_validate_uint16[sizeof(mz_uint16) == 2 ? 1 : -1];
+typedef unsigned char mz_validate_uint32[sizeof(mz_uint32) == 4 ? 1 : -1];
+typedef unsigned char mz_validate_uint64[sizeof(mz_uint64) == 8 ? 1 : -1];
+
+
+
+/* ------------------- zlib-style API's */
+
+mz_ulong mz_adler32(mz_ulong adler, const unsigned char *ptr, size_t buf_len)
+{
+    mz_uint32 i, s1 = (mz_uint32)(adler & 0xffff), s2 = (mz_uint32)(adler >> 16);
+    size_t block_len = buf_len % 5552;
+    if (!ptr)
+        return MZ_ADLER32_INIT;
+    while (buf_len)
+    {
+        for (i = 0; i + 7 < block_len; i += 8, ptr += 8)
+        {
+            s1 += ptr[0], s2 += s1;
+            s1 += ptr[1], s2 += s1;
+            s1 += ptr[2], s2 += s1;
+            s1 += ptr[3], s2 += s1;
+            s1 += ptr[4], s2 += s1;
+            s1 += ptr[5], s2 += s1;
+            s1 += ptr[6], s2 += s1;
+            s1 += ptr[7], s2 += s1;
+        }
+        for (; i < block_len; ++i)
+            s1 += *ptr++, s2 += s1;
+        s1 %= 65521U, s2 %= 65521U;
+        buf_len -= block_len;
+        block_len = 5552;
+    }
+    return (s2 << 16) + s1;
+}
+
+/* Karl Malbrain's compact CRC-32. See "A compact CCITT crc16 and crc32 C implementation that balances processor cache usage against speed": http://www.geocities.com/malbrain/ */
+#if 0
+    mz_ulong mz_crc32(mz_ulong crc, const mz_uint8 *ptr, size_t buf_len)
+    {
+        static const mz_uint32 s_crc32[16] = { 0, 0x1db71064, 0x3b6e20c8, 0x26d930ac, 0x76dc4190, 0x6b6b51f4, 0x4db26158, 0x5005713c,
+                                               0xedb88320, 0xf00f9344, 0xd6d6a3e8, 0xcb61b38c, 0x9b64c2b0, 0x86d3d2d4, 0xa00ae278, 0xbdbdf21c };
+        mz_uint32 crcu32 = (mz_uint32)crc;
+        if (!ptr)
+            return MZ_CRC32_INIT;
+        crcu32 = ~crcu32;
+        while (buf_len--)
+        {
+            mz_uint8 b = *ptr++;
+            crcu32 = (crcu32 >> 4) ^ s_crc32[(crcu32 & 0xF) ^ (b & 0xF)];
+            crcu32 = (crcu32 >> 4) ^ s_crc32[(crcu32 & 0xF) ^ (b >> 4)];
+        }
+        return ~crcu32;
+    }
+#else
+/* Faster, but larger CPU cache footprint.
+ */
+mz_ulong mz_crc32(mz_ulong crc, const mz_uint8 *ptr, size_t buf_len)
+{
+    static const mz_uint32 s_crc_table[256] =
+        {
+          0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535,
+          0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD,
+          0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D,
+          0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC,
+          0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4,
+          0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C,
+          0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC,
+          0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
+          0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB,
+          0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F,
+          0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB,
+          0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E,
+          0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA,
+          0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE,
+          0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A,
+          0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9,
+          0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409,
+          0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81,
+          0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739,
+          0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8,
+          0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268,
+          0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0,
+          0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8,
+          0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
+          0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF,
+          0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703,
+          0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7,
+          0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A,
+          0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE,
+          0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242,
+          0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6,
+          0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45,
+          0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D,
+          0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5,
+          0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605,
+          0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94,
+          0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D
+        };
+
+    mz_uint32 crc32 = (mz_uint32)crc ^ 0xFFFFFFFF;
+    const mz_uint8 *pByte_buf = (const mz_uint8 *)ptr;
+
+    while (buf_len >= 4)
+    {
+        crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[0]) & 0xFF];
+        crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[1]) & 0xFF];
+        crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[2]) & 0xFF];
+        crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[3]) & 0xFF];
+        pByte_buf += 4;
+        buf_len -= 4;
+    }
+
+    while (buf_len)
+    {
+        crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[0]) & 0xFF];
+        ++pByte_buf;
+        --buf_len;
+    }
+
+    return ~crc32;
+}
+#endif
+
+void mz_free(void *p)
+{
+    MZ_FREE(p);
+}
+
+void *miniz_def_alloc_func(void *opaque, size_t items, size_t size)
+{
+    (void)opaque, (void)items, (void)size;
+    return MZ_MALLOC(items * size);
+}
+void miniz_def_free_func(void *opaque, void *address)
+{
+    (void)opaque, (void)address;
+    MZ_FREE(address);
+}
+void *miniz_def_realloc_func(void *opaque, void *address, size_t items, size_t size)
+{
+    (void)opaque, (void)address, (void)items, (void)size;
+    return MZ_REALLOC(address, items * size);
+}
+
+const char *mz_version(void)
+{
+    return MZ_VERSION;
+}
+
+#ifndef MINIZ_NO_ZLIB_APIS
+
+int mz_deflateInit(mz_streamp pStream, int level)
+{
+    return mz_deflateInit2(pStream, level, MZ_DEFLATED, MZ_DEFAULT_WINDOW_BITS, 9, MZ_DEFAULT_STRATEGY);
+}
+
+int mz_deflateInit2(mz_streamp pStream, int level, int method, int window_bits, int mem_level, int strategy)
+{
+    tdefl_compressor *pComp;
+    mz_uint comp_flags = TDEFL_COMPUTE_ADLER32 | tdefl_create_comp_flags_from_zip_params(level, window_bits, strategy);
+
+    if (!pStream)
+        return MZ_STREAM_ERROR;
+    if ((method != MZ_DEFLATED) || ((mem_level < 1) || (mem_level > 9)) || ((window_bits != MZ_DEFAULT_WINDOW_BITS) && (-window_bits != MZ_DEFAULT_WINDOW_BITS)))
+        return MZ_PARAM_ERROR;
+
+    pStream->data_type = 0;
+    pStream->adler = MZ_ADLER32_INIT;
+    pStream->msg = NULL;
+    pStream->reserved = 0;
+    pStream->total_in = 0;
+    pStream->total_out = 0;
+    if (!pStream->zalloc)
+        pStream->zalloc = miniz_def_alloc_func;
+    if (!pStream->zfree)
+        pStream->zfree = miniz_def_free_func;
+
+    pComp = (tdefl_compressor *)pStream->zalloc(pStream->opaque, 1, sizeof(tdefl_compressor));
+    if (!pComp)
+        return MZ_MEM_ERROR;
+
+    pStream->state = (struct mz_internal_state *)pComp;
+
+    if (tdefl_init(pComp, NULL, NULL, comp_flags) != TDEFL_STATUS_OKAY)
+    {
+        mz_deflateEnd(pStream);
+        return MZ_PARAM_ERROR;
+    }
+
+    return MZ_OK;
+}
+
+int mz_deflateReset(mz_streamp pStream)
+{
+    if ((!pStream) || (!pStream->state) || (!pStream->zalloc) || (!pStream->zfree))
+        return MZ_STREAM_ERROR;
+    pStream->total_in = pStream->total_out = 0;
+    tdefl_init((tdefl_compressor *)pStream->state, NULL, NULL, ((tdefl_compressor *)pStream->state)->m_flags);
+    return MZ_OK;
+}
+
+int mz_deflate(mz_streamp pStream, int flush)
+{
+    size_t in_bytes, out_bytes;
+    mz_ulong orig_total_in, orig_total_out;
+    int mz_status = MZ_OK;
+
+    if ((!pStream) || (!pStream->state) || (flush < 0) || (flush > MZ_FINISH) || (!pStream->next_out))
+        return MZ_STREAM_ERROR;
+    if (!pStream->avail_out)
+        return MZ_BUF_ERROR;
+
+    if (flush == MZ_PARTIAL_FLUSH)
+        flush = MZ_SYNC_FLUSH;
+
+    if (((tdefl_compressor *)pStream->state)->m_prev_return_status == TDEFL_STATUS_DONE)
+        return (flush == MZ_FINISH) ? MZ_STREAM_END : MZ_BUF_ERROR;
+
+    orig_total_in = pStream->total_in;
+    orig_total_out = pStream->total_out;
+    for (;;)
+    {
+        tdefl_status defl_status;
+        in_bytes = pStream->avail_in;
+        out_bytes = pStream->avail_out;
+
+        defl_status = tdefl_compress((tdefl_compressor *)pStream->state, pStream->next_in, &in_bytes, pStream->next_out, &out_bytes, (tdefl_flush)flush);
+        pStream->next_in += (mz_uint)in_bytes;
+        pStream->avail_in -= (mz_uint)in_bytes;
+        pStream->total_in += (mz_uint)in_bytes;
+        pStream->adler = tdefl_get_adler32((tdefl_compressor *)pStream->state);
+
+        pStream->next_out += (mz_uint)out_bytes;
+        pStream->avail_out -= (mz_uint)out_bytes;
+        pStream->total_out += (mz_uint)out_bytes;
+
+        if (defl_status < 0)
+        {
+            mz_status = MZ_STREAM_ERROR;
+            break;
+        }
+        else if (defl_status == TDEFL_STATUS_DONE)
+        {
+            mz_status = MZ_STREAM_END;
+            break;
+        }
+        else if (!pStream->avail_out)
+            break;
+        else if ((!pStream->avail_in) && (flush != MZ_FINISH))
+        {
+            if ((flush) || (pStream->total_in != orig_total_in) || (pStream->total_out != orig_total_out))
+                break;
+            return MZ_BUF_ERROR; /* Can't make forward progress without some input.
+ */
+        }
+    }
+    return mz_status;
+}
+
+int mz_deflateEnd(mz_streamp pStream)
+{
+    if (!pStream)
+        return MZ_STREAM_ERROR;
+    if (pStream->state)
+    {
+        pStream->zfree(pStream->opaque, pStream->state);
+        pStream->state = NULL;
+    }
+    return MZ_OK;
+}
+
+mz_ulong mz_deflateBound(mz_streamp pStream, mz_ulong source_len)
+{
+    (void)pStream;
+    /* This is really over conservative. (And lame, but it's actually pretty tricky to compute a true upper bound given the way tdefl's blocking works.) */
+    return MZ_MAX(128 + (source_len * 110) / 100, 128 + source_len + ((source_len / (31 * 1024)) + 1) * 5);
+}
+
+int mz_compress2(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len, int level)
+{
+    int status;
+    mz_stream stream;
+    memset(&stream, 0, sizeof(stream));
+
+    /* In case mz_ulong is 64-bits (argh I hate longs). */
+    if ((source_len | *pDest_len) > 0xFFFFFFFFU)
+        return MZ_PARAM_ERROR;
+
+    stream.next_in = pSource;
+    stream.avail_in = (mz_uint32)source_len;
+    stream.next_out = pDest;
+    stream.avail_out = (mz_uint32)*pDest_len;
+
+    status = mz_deflateInit(&stream, level);
+    if (status != MZ_OK)
+        return status;
+
+    status = mz_deflate(&stream, MZ_FINISH);
+    if (status != MZ_STREAM_END)
+    {
+        mz_deflateEnd(&stream);
+        return (status == MZ_OK) ? MZ_BUF_ERROR : status;
+    }
+
+    *pDest_len = stream.total_out;
+    return mz_deflateEnd(&stream);
+}
+
+int mz_compress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len)
+{
+    return mz_compress2(pDest, pDest_len, pSource, source_len, MZ_DEFAULT_COMPRESSION);
+}
+
+mz_ulong mz_compressBound(mz_ulong source_len)
+{
+    return mz_deflateBound(NULL, source_len);
+}
+
+typedef struct
+{
+    tinfl_decompressor m_decomp;
+    mz_uint m_dict_ofs, m_dict_avail, m_first_call, m_has_flushed;
+    int m_window_bits;
+    mz_uint8 m_dict[TINFL_LZ_DICT_SIZE];
+    tinfl_status m_last_status;
+} inflate_state;
+
+int mz_inflateInit2(mz_streamp pStream, int window_bits)
+{
+    inflate_state *pDecomp;
+    if (!pStream)
+        return MZ_STREAM_ERROR;
+    if ((window_bits != MZ_DEFAULT_WINDOW_BITS) && (-window_bits != MZ_DEFAULT_WINDOW_BITS))
+        return MZ_PARAM_ERROR;
+
+    pStream->data_type = 0;
+    pStream->adler = 0;
+    pStream->msg = NULL;
+    pStream->total_in = 0;
+    pStream->total_out = 0;
+    pStream->reserved = 0;
+    if (!pStream->zalloc)
+        pStream->zalloc = miniz_def_alloc_func;
+    if (!pStream->zfree)
+        pStream->zfree = miniz_def_free_func;
+
+    pDecomp = (inflate_state *)pStream->zalloc(pStream->opaque, 1, sizeof(inflate_state));
+    if (!pDecomp)
+        return MZ_MEM_ERROR;
+
+    pStream->state = (struct mz_internal_state *)pDecomp;
+
+    tinfl_init(&pDecomp->m_decomp);
+    pDecomp->m_dict_ofs = 0;
+    pDecomp->m_dict_avail = 0;
+    pDecomp->m_last_status = TINFL_STATUS_NEEDS_MORE_INPUT;
+    pDecomp->m_first_call = 1;
+    pDecomp->m_has_flushed = 0;
+    pDecomp->m_window_bits = window_bits;
+
+    return MZ_OK;
+}
+
+int mz_inflateInit(mz_streamp pStream)
+{
+    return mz_inflateInit2(pStream, MZ_DEFAULT_WINDOW_BITS);
+}
+
+int mz_inflate(mz_streamp pStream, int flush)
+{
+    inflate_state *pState;
+    mz_uint n, first_call, decomp_flags = TINFL_FLAG_COMPUTE_ADLER32;
+    size_t in_bytes, out_bytes, orig_avail_in;
+    tinfl_status status;
+
+    if ((!pStream) || (!pStream->state))
+        return MZ_STREAM_ERROR;
+    if (flush == MZ_PARTIAL_FLUSH)
+        flush = MZ_SYNC_FLUSH;
+    if ((flush) && (flush != MZ_SYNC_FLUSH) && (flush != MZ_FINISH))
+        return MZ_STREAM_ERROR;
+
+    pState = (inflate_state *)pStream->state;
+    if (pState->m_window_bits > 0)
+        decomp_flags |= TINFL_FLAG_PARSE_ZLIB_HEADER;
+    orig_avail_in = pStream->avail_in;
+
+    first_call = pState->m_first_call;
+    pState->m_first_call = 0;
+    if (pState->m_last_status < 0)
+        return MZ_DATA_ERROR;
+
+    if (pState->m_has_flushed && (flush != MZ_FINISH))
+        return MZ_STREAM_ERROR;
+    pState->m_has_flushed |= (flush == MZ_FINISH);
+
+    if ((flush == MZ_FINISH) && (first_call))
+    {
+        /* MZ_FINISH on the first call implies that the input and output buffers are large enough to hold the entire compressed/decompressed file. */
+        decomp_flags |= TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF;
+        in_bytes = pStream->avail_in;
+        out_bytes = pStream->avail_out;
+        status = tinfl_decompress(&pState->m_decomp, pStream->next_in, &in_bytes, pStream->next_out, pStream->next_out, &out_bytes, decomp_flags);
+        pState->m_last_status = status;
+        pStream->next_in += (mz_uint)in_bytes;
+        pStream->avail_in -= (mz_uint)in_bytes;
+        pStream->total_in += (mz_uint)in_bytes;
+        pStream->adler = tinfl_get_adler32(&pState->m_decomp);
+        pStream->next_out += (mz_uint)out_bytes;
+        pStream->avail_out -= (mz_uint)out_bytes;
+        pStream->total_out += (mz_uint)out_bytes;
+
+        if (status < 0)
+            return MZ_DATA_ERROR;
+        else if (status != TINFL_STATUS_DONE)
+        {
+            pState->m_last_status = TINFL_STATUS_FAILED;
+            return MZ_BUF_ERROR;
+        }
+        return MZ_STREAM_END;
+    }
+    /* flush != MZ_FINISH then we must assume there's more input. */
+    if (flush != MZ_FINISH)
+        decomp_flags |= TINFL_FLAG_HAS_MORE_INPUT;
+
+    if (pState->m_dict_avail)
+    {
+        n = MZ_MIN(pState->m_dict_avail, pStream->avail_out);
+        memcpy(pStream->next_out, pState->m_dict + pState->m_dict_ofs, n);
+        pStream->next_out += n;
+        pStream->avail_out -= n;
+        pStream->total_out += n;
+        pState->m_dict_avail -= n;
+        pState->m_dict_ofs = (pState->m_dict_ofs + n) & (TINFL_LZ_DICT_SIZE - 1);
+        return ((pState->m_last_status == TINFL_STATUS_DONE) && (!pState->m_dict_avail)) ? MZ_STREAM_END : MZ_OK;
+    }
+
+    for (;;)
+    {
+        in_bytes = pStream->avail_in;
+        out_bytes = TINFL_LZ_DICT_SIZE - pState->m_dict_ofs;
+
+        status = tinfl_decompress(&pState->m_decomp, pStream->next_in, &in_bytes, pState->m_dict, pState->m_dict + pState->m_dict_ofs, &out_bytes, decomp_flags);
+        pState->m_last_status = status;
+
+        pStream->next_in += (mz_uint)in_bytes;
+        pStream->avail_in -= (mz_uint)in_bytes;
+        pStream->total_in += (mz_uint)in_bytes;
+        pStream->adler = tinfl_get_adler32(&pState->m_decomp);
+
+        pState->m_dict_avail = (mz_uint)out_bytes;
+
+        n = MZ_MIN(pState->m_dict_avail, pStream->avail_out);
+        memcpy(pStream->next_out, pState->m_dict + pState->m_dict_ofs, n);
+        pStream->next_out += n;
+        pStream->avail_out -= n;
+        pStream->total_out += n;
+        pState->m_dict_avail -= n;
+        pState->m_dict_ofs = (pState->m_dict_ofs + n) & (TINFL_LZ_DICT_SIZE - 1);
+
+        if (status < 0)
+            return MZ_DATA_ERROR; /* Stream is corrupted (there could be some uncompressed data left in the output dictionary - oh well). */
+        else if ((status == TINFL_STATUS_NEEDS_MORE_INPUT) && (!orig_avail_in))
+            return MZ_BUF_ERROR; /* Signal caller that we can't make forward progress without supplying more input or by setting flush to MZ_FINISH. */
+        else if (flush == MZ_FINISH)
+        {
+            /* The output buffer MUST be large to hold the remaining uncompressed data when flush==MZ_FINISH. */
+            if (status == TINFL_STATUS_DONE)
+                return pState->m_dict_avail ? MZ_BUF_ERROR : MZ_STREAM_END;
+            /* status here must be TINFL_STATUS_HAS_MORE_OUTPUT, which means there's at least 1 more byte on the way. If there's no more room left in the output buffer then something is wrong. */
+            else if (!pStream->avail_out)
+                return MZ_BUF_ERROR;
+        }
+        else if ((status == TINFL_STATUS_DONE) || (!pStream->avail_in) || (!pStream->avail_out) || (pState->m_dict_avail))
+            break;
+    }
+
+    return ((status == TINFL_STATUS_DONE) && (!pState->m_dict_avail)) ? MZ_STREAM_END : MZ_OK;
+}
+
+int mz_inflateEnd(mz_streamp pStream)
+{
+    if (!pStream)
+        return MZ_STREAM_ERROR;
+    if (pStream->state)
+    {
+        pStream->zfree(pStream->opaque, pStream->state);
+        pStream->state = NULL;
+    }
+    return MZ_OK;
+}
+
+int mz_uncompress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len)
+{
+    mz_stream stream;
+    int status;
+    memset(&stream, 0, sizeof(stream));
+
+    /* In case mz_ulong is 64-bits (argh I hate longs). */
+    if ((source_len | *pDest_len) > 0xFFFFFFFFU)
+        return MZ_PARAM_ERROR;
+
+    stream.next_in = pSource;
+    stream.avail_in = (mz_uint32)source_len;
+    stream.next_out = pDest;
+    stream.avail_out = (mz_uint32)*pDest_len;
+
+    status = mz_inflateInit(&stream);
+    if (status != MZ_OK)
+        return status;
+
+    status = mz_inflate(&stream, MZ_FINISH);
+    if (status != MZ_STREAM_END)
+    {
+        mz_inflateEnd(&stream);
+        return ((status == MZ_BUF_ERROR) && (!stream.avail_in)) ? MZ_DATA_ERROR : status;
+    }
+    *pDest_len = stream.total_out;
+
+    return mz_inflateEnd(&stream);
+}
+
+const char *mz_error(int err)
+{
+    static struct
+    {
+        int m_err;
+        const char *m_pDesc;
+    } s_error_descs[] =
+        {
+          { MZ_OK, "" }, { MZ_STREAM_END, "stream end" }, { MZ_NEED_DICT, "need dictionary" }, { MZ_ERRNO, "file error" }, { MZ_STREAM_ERROR, "stream error" }, { MZ_DATA_ERROR, "data error" }, { MZ_MEM_ERROR, "out of memory" }, { MZ_BUF_ERROR, "buf error" }, { MZ_VERSION_ERROR, "version error" }, { MZ_PARAM_ERROR, "parameter error" }
+        };
+    mz_uint i;
+    for (i = 0; i < sizeof(s_error_descs) / sizeof(s_error_descs[0]); ++i)
+        if (s_error_descs[i].m_err == err)
+            return s_error_descs[i].m_pDesc;
+    return NULL;
+}
+
+#endif /*MINIZ_NO_ZLIB_APIS */
+
+
+
+/*
+  This is free and unencumbered software released into the public domain.
+
+  Anyone is free to copy, modify, publish, use, compile, sell, or
+  distribute this software, either in source code form or as a compiled
+  binary, for any purpose, commercial or non-commercial, and by any
+  means.
+
+  In jurisdictions that recognize copyright laws, the author or authors
+  of this software dedicate any and all copyright interest in the
+  software to the public domain. We make this dedication for the benefit
+  of the public at large and to the detriment of our heirs and
+  successors. We intend this dedication to be an overt act of
+  relinquishment in perpetuity of all present and future rights to this
+  software under copyright law.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+  IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
+  OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
+  ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+  OTHER DEALINGS IN THE SOFTWARE.
+
+  For more information, please refer to <http://unlicense.org/>
+*/
+/**************************************************************************
+ *
+ * Copyright 2013-2014 RAD Game Tools and Valve Software
+ * Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
+ * All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ *
+ ***********************************************************************/
+
+/* ------------------- Low-level Compression (independent from all decompression API's) */
+
+/* Purposely making these tables static for faster init and thread safety. */
+static const mz_uint16 s_tdefl_len_sym[256] =
+    {
+      257, 258, 259, 260, 261, 262, 263, 264, 265, 265, 266, 266, 267, 267, 268, 268, 269, 269, 269, 269, 270, 270, 270, 270, 271, 271, 271, 271, 272, 272, 272, 272,
+      273, 273, 273, 273, 273, 273, 273, 273, 274, 274, 274, 274, 274, 274, 274, 274, 275, 275, 275, 275, 275, 275, 275, 275, 276, 276, 276, 276, 276, 276, 276, 276,
+      277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278,
+      279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280,
+      281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281,
+      282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282,
+      283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283,
+      284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 285
+    };
+
+static const mz_uint8 s_tdefl_len_extra[256] =
+    {
+      0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+      4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+      5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+      5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 0
+    };
+
+static const mz_uint8 s_tdefl_small_dist_sym[512] =
+    {
+      0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11,
+      11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13,
+      13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
+      14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
+      14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
+      15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
+      16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
+      16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
+      16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
+      17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
+      17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
+      17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17
+    };
+
+static const mz_uint8 s_tdefl_small_dist_extra[512] =
+    {
+      0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5,
+      5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+      6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+      6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+      7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+      7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+      7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+      7, 7, 7, 7, 7, 7, 7, 7
+    };
+
+static const mz_uint8 s_tdefl_large_dist_sym[128] =
+    {
+      0, 0, 18, 19, 20, 20, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
+      26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+      28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29
+    };
+
+static const mz_uint8 s_tdefl_large_dist_extra[128] =
+    {
+      0, 0, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
+      12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13,
+      13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13
+    };
+
+/* Radix sorts tdefl_sym_freq[] array by 16-bit key m_key. Returns ptr to sorted values. */
+typedef struct
+{
+    mz_uint16 m_key, m_sym_index;
+} tdefl_sym_freq;
+static tdefl_sym_freq *tdefl_radix_sort_syms(mz_uint num_syms, tdefl_sym_freq *pSyms0, tdefl_sym_freq *pSyms1)
+{
+    mz_uint32 total_passes = 2, pass_shift, pass, i, hist[256 * 2];
+    tdefl_sym_freq *pCur_syms = pSyms0, *pNew_syms = pSyms1;
+    MZ_CLEAR_OBJ(hist);
+    for (i = 0; i < num_syms; i++)
+    {
+        mz_uint freq = pSyms0[i].m_key;
+        hist[freq & 0xFF]++;
+        hist[256 + ((freq >> 8) & 0xFF)]++;
+    }
+    while ((total_passes > 1) && (num_syms == hist[(total_passes - 1) * 256]))
+        total_passes--;
+    for (pass_shift = 0, pass = 0; pass < total_passes; pass++, pass_shift += 8)
+    {
+        const mz_uint32 *pHist = &hist[pass << 8];
+        mz_uint offsets[256], cur_ofs = 0;
+        for (i = 0; i < 256; i++)
+        {
+            offsets[i] = cur_ofs;
+            cur_ofs += pHist[i];
+        }
+        for (i = 0; i < num_syms; i++)
+            pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] = pCur_syms[i];
+        {
+            tdefl_sym_freq *t = pCur_syms;
+            pCur_syms = pNew_syms;
+            pNew_syms = t;
+        }
+    }
+    return pCur_syms;
+}
+
+/* tdefl_calculate_minimum_redundancy() originally written by: Alistair Moffat, alistair@cs.mu.oz.au, Jyrki Katajainen, jyrki@diku.dk, November 1996. */
+static void tdefl_calculate_minimum_redundancy(tdefl_sym_freq *A, int n)
+{
+    int root, leaf, next, avbl, used, dpth;
+    if (n == 0)
+        return;
+    else if (n == 1)
+    {
+        A[0].m_key = 1;
+        return;
+    }
+    A[0].m_key += A[1].m_key;
+    root = 0;
+    leaf = 2;
+    for (next = 1; next < n - 1; next++)
+    {
+        if (leaf >= n || A[root].m_key < A[leaf].m_key)
+        {
+            A[next].m_key = A[root].m_key;
+            A[root++].m_key = (mz_uint16)next;
+        }
+        else
+            A[next].m_key = A[leaf++].m_key;
+        if (leaf >= n || (root < next && A[root].m_key < A[leaf].m_key))
+        {
+            A[next].m_key = (mz_uint16)(A[next].m_key + A[root].m_key);
+            A[root++].m_key = (mz_uint16)next;
+        }
+        else
+            A[next].m_key = (mz_uint16)(A[next].m_key + A[leaf++].m_key);
+    }
+    A[n - 2].m_key = 0;
+    for (next = n - 3; next >= 0; next--)
+        A[next].m_key = A[A[next].m_key].m_key + 1;
+    avbl = 1;
+    used = dpth = 0;
+    root = n - 2;
+    next = n - 1;
+    while (avbl > 0)
+    {
+        while (root >= 0 && (int)A[root].m_key == dpth)
+        {
+            used++;
+            root--;
+        }
+        while (avbl > used)
+        {
+            A[next--].m_key = (mz_uint16)(dpth);
+            avbl--;
+        }
+        avbl = 2 * used;
+        dpth++;
+        used = 0;
+    }
+}
+
+/* Limits canonical Huffman code table's max code size. */
+enum
+{
+    TDEFL_MAX_SUPPORTED_HUFF_CODESIZE = 32
+};
+static void tdefl_huffman_enforce_max_code_size(int *pNum_codes, int code_list_len, int max_code_size)
+{
+    int i;
+    mz_uint32 total = 0;
+    if (code_list_len <= 1)
+        return;
+    for (i = max_code_size + 1; i <= TDEFL_MAX_SUPPORTED_HUFF_CODESIZE; i++)
+        pNum_codes[max_code_size] += pNum_codes[i];
+    for (i = max_code_size; i > 0; i--)
+        total += (((mz_uint32)pNum_codes[i]) << (max_code_size - i));
+    while (total != (1UL << max_code_size))
+    {
+        pNum_codes[max_code_size]--;
+        for (i = max_code_size - 1; i > 0; i--)
+            if (pNum_codes[i])
+            {
+                pNum_codes[i]--;
+                pNum_codes[i + 1] += 2;
+                break;
+            }
+        total--;
+    }
+}
+
+static void tdefl_optimize_huffman_table(tdefl_compressor *d, int table_num, int table_len, int code_size_limit, int static_table)
+{
+    int i, j, l, num_codes[1 + TDEFL_MAX_SUPPORTED_HUFF_CODESIZE];
+    mz_uint next_code[TDEFL_MAX_SUPPORTED_HUFF_CODESIZE + 1];
+    MZ_CLEAR_OBJ(num_codes);
+    if (static_table)
+    {
+        for (i = 0; i < table_len; i++)
+            num_codes[d->m_huff_code_sizes[table_num][i]]++;
+    }
+    else
+    {
+        tdefl_sym_freq syms0[TDEFL_MAX_HUFF_SYMBOLS], syms1[TDEFL_MAX_HUFF_SYMBOLS], *pSyms;
+        int num_used_syms = 0;
+        const mz_uint16 *pSym_count = &d->m_huff_count[table_num][0];
+        for (i = 0; i < table_len; i++)
+            if (pSym_count[i])
+            {
+                syms0[num_used_syms].m_key = (mz_uint16)pSym_count[i];
+                syms0[num_used_syms++].m_sym_index = (mz_uint16)i;
+            }
+
+        pSyms = tdefl_radix_sort_syms(num_used_syms, syms0, syms1);
+        tdefl_calculate_minimum_redundancy(pSyms, num_used_syms);
+
+        for (i = 0; i < num_used_syms; i++)
+            num_codes[pSyms[i].m_key]++;
+
+        tdefl_huffman_enforce_max_code_size(num_codes, num_used_syms, code_size_limit);
+
+        MZ_CLEAR_OBJ(d->m_huff_code_sizes[table_num]);
+        MZ_CLEAR_OBJ(d->m_huff_codes[table_num]);
+        for (i = 1, j = num_used_syms; i <= code_size_limit; i++)
+            for (l = num_codes[i]; l > 0; l--)
+                d->m_huff_code_sizes[table_num][pSyms[--j].m_sym_index] = (mz_uint8)(i);
+    }
+
+    next_code[1] = 0;
+    for (j = 0, i = 2; i <= code_size_limit; i++)
+        next_code[i] = j = ((j + num_codes[i - 1]) << 1);
+
+    for (i = 0; i < table_len; i++)
+    {
+        mz_uint rev_code = 0, code, code_size;
+        if ((code_size = d->m_huff_code_sizes[table_num][i]) == 0)
+            continue;
+        code = next_code[code_size]++;
+        for (l = code_size; l > 0; l--, code >>= 1)
+            rev_code = (rev_code << 1) | (code & 1);
+        d->m_huff_codes[table_num][i] = (mz_uint16)rev_code;
+    }
+}
+
+#define TDEFL_PUT_BITS(b, l)                                       \
+    do                                                             \
+    {                                                              \
+        mz_uint bits = b;                                          \
+        mz_uint len = l;                                           \
+        MZ_ASSERT(bits <= ((1U << len) - 1U));                     \
+        d->m_bit_buffer |= (bits << d->m_bits_in);                 \
+        d->m_bits_in += len;                                       \
+        while (d->m_bits_in >= 8)                                  \
+        {                                                          \
+            if (d->m_pOutput_buf < d->m_pOutput_buf_end)           \
+                *d->m_pOutput_buf++ = (mz_uint8)(d->m_bit_buffer); \
+            d->m_bit_buffer >>= 8;                                 \
+            d->m_bits_in -= 8;                                     \
+        }                                                          \
+    }                                                              \
+    MZ_MACRO_END
+
+#define TDEFL_RLE_PREV_CODE_SIZE()                                                                                       \
+    {                                                                                                                    \
+        if (rle_repeat_count)                                                                                            \
+        {                                                                                                                \
+            if (rle_repeat_count < 3)                                                                                    \
+            {                                                                                                            \
+                d->m_huff_count[2][prev_code_size] = (mz_uint16)(d->m_huff_count[2][prev_code_size] + rle_repeat_count); \
+                while (rle_repeat_count--)                                                                               \
+                    packed_code_sizes[num_packed_code_sizes++] = prev_code_size;                                         \
+            }                                                                                                            \
+            else                                                                                                         \
+            {                                                                                                            \
+                d->m_huff_count[2][16] = (mz_uint16)(d->m_huff_count[2][16] + 1);                                        \
+                packed_code_sizes[num_packed_code_sizes++] = 16;                                                         \
+                packed_code_sizes[num_packed_code_sizes++] = (mz_uint8)(rle_repeat_count - 3);                           \
+            }                                                                                                            \
+            rle_repeat_count = 0;                                                                                        \
+        }                                                                                                                \
+    }
+
+#define TDEFL_RLE_ZERO_CODE_SIZE()                                                         \
+    {                                                                                      \
+        if (rle_z_count)                                                                   \
+        {                                                                                  \
+            if (rle_z_count < 3)                                                           \
+            {                                                                              \
+                d->m_huff_count[2][0] = (mz_uint16)(d->m_huff_count[2][0] + rle_z_count);  \
+                while (rle_z_count--)                                                      \
+                    packed_code_sizes[num_packed_code_sizes++] = 0;                        \
+            }                                                                              \
+            else if (rle_z_count <= 10)                                                    \
+            {                                                                              \
+                d->m_huff_count[2][17] = (mz_uint16)(d->m_huff_count[2][17] + 1);          \
+                packed_code_sizes[num_packed_code_sizes++] = 17;                           \
+                packed_code_sizes[num_packed_code_sizes++] = (mz_uint8)(rle_z_count - 3);  \
+            }                                                                              \
+            else                                                                           \
+            {                                                                              \
+                d->m_huff_count[2][18] = (mz_uint16)(d->m_huff_count[2][18] + 1);          \
+                packed_code_sizes[num_packed_code_sizes++] = 18;                           \
+                packed_code_sizes[num_packed_code_sizes++] = (mz_uint8)(rle_z_count - 11); \
+            }                                                                              \
+            rle_z_count = 0;                                                               \
+        }                                                                                  \
+    }
+
+static mz_uint8 s_tdefl_packed_code_size_syms_swizzle[] = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
+
+static void tdefl_start_dynamic_block(tdefl_compressor *d)
+{
+    int num_lit_codes, num_dist_codes, num_bit_lengths;
+    mz_uint i, total_code_sizes_to_pack, num_packed_code_sizes, rle_z_count, rle_repeat_count, packed_code_sizes_index;
+    mz_uint8 code_sizes_to_pack[TDEFL_MAX_HUFF_SYMBOLS_0 + TDEFL_MAX_HUFF_SYMBOLS_1], packed_code_sizes[TDEFL_MAX_HUFF_SYMBOLS_0 + TDEFL_MAX_HUFF_SYMBOLS_1], prev_code_size = 0xFF;
+
+    d->m_huff_count[0][256] = 1;
+
+    tdefl_optimize_huffman_table(d, 0, TDEFL_MAX_HUFF_SYMBOLS_0, 15, MZ_FALSE);
+    tdefl_optimize_huffman_table(d, 1, TDEFL_MAX_HUFF_SYMBOLS_1, 15, MZ_FALSE);
+
+    for (num_lit_codes = 286; num_lit_codes > 257; num_lit_codes--)
+        if (d->m_huff_code_sizes[0][num_lit_codes - 1])
+            break;
+    for (num_dist_codes = 30; num_dist_codes > 1; num_dist_codes--)
+        if (d->m_huff_code_sizes[1][num_dist_codes - 1])
+            break;
+
+    memcpy(code_sizes_to_pack, &d->m_huff_code_sizes[0][0], num_lit_codes);
+    memcpy(code_sizes_to_pack + num_lit_codes, &d->m_huff_code_sizes[1][0], num_dist_codes);
+    total_code_sizes_to_pack = num_lit_codes + num_dist_codes;
+    num_packed_code_sizes = 0;
+    rle_z_count = 0;
+    rle_repeat_count = 0;
+
+    memset(&d->m_huff_count[2][0], 0, sizeof(d->m_huff_count[2][0]) * TDEFL_MAX_HUFF_SYMBOLS_2);
+    for (i = 0; i < total_code_sizes_to_pack; i++)
+    {
+        mz_uint8 code_size = code_sizes_to_pack[i];
+        if (!code_size)
+        {
+            TDEFL_RLE_PREV_CODE_SIZE();
+            if (++rle_z_count == 138)
+            {
+                TDEFL_RLE_ZERO_CODE_SIZE();
+            }
+        }
+        else
+        {
+            TDEFL_RLE_ZERO_CODE_SIZE();
+            if (code_size != prev_code_size)
+            {
+                TDEFL_RLE_PREV_CODE_SIZE();
+                d->m_huff_count[2][code_size] = (mz_uint16)(d->m_huff_count[2][code_size] + 1);
+                packed_code_sizes[num_packed_code_sizes++] = code_size;
+            }
+            else if (++rle_repeat_count == 6)
+            {
+                TDEFL_RLE_PREV_CODE_SIZE();
+            }
+        }
+        prev_code_size = code_size;
+    }
+    if (rle_repeat_count)
+    {
+        TDEFL_RLE_PREV_CODE_SIZE();
+    }
+    else
+    {
+        TDEFL_RLE_ZERO_CODE_SIZE();
+    }
+
+    tdefl_optimize_huffman_table(d, 2, TDEFL_MAX_HUFF_SYMBOLS_2, 7, MZ_FALSE);
+
+    TDEFL_PUT_BITS(2, 2);
+
+    TDEFL_PUT_BITS(num_lit_codes - 257, 5);
+    TDEFL_PUT_BITS(num_dist_codes - 1, 5);
+
+    for (num_bit_lengths = 18; num_bit_lengths >= 0; num_bit_lengths--)
+        if (d->m_huff_code_sizes[2][s_tdefl_packed_code_size_syms_swizzle[num_bit_lengths]])
+            break;
+    num_bit_lengths = MZ_MAX(4, (num_bit_lengths + 1));
+    TDEFL_PUT_BITS(num_bit_lengths - 4, 4);
+    for (i = 0; (int)i < num_bit_lengths; i++)
+        TDEFL_PUT_BITS(d->m_huff_code_sizes[2][s_tdefl_packed_code_size_syms_swizzle[i]], 3);
+
+    for (packed_code_sizes_index = 0; packed_code_sizes_index < num_packed_code_sizes;)
+    {
+        mz_uint code = packed_code_sizes[packed_code_sizes_index++];
+        MZ_ASSERT(code < TDEFL_MAX_HUFF_SYMBOLS_2);
+        TDEFL_PUT_BITS(d->m_huff_codes[2][code], d->m_huff_code_sizes[2][code]);
+        if (code >= 16)
+            TDEFL_PUT_BITS(packed_code_sizes[packed_code_sizes_index++], "\02\03\07"[code - 16]);
+    }
+}
+
+static void tdefl_start_static_block(tdefl_compressor *d)
+{
+    mz_uint i;
+    mz_uint8 *p = &d->m_huff_code_sizes[0][0];
+
+    for (i = 0; i <= 143; ++i)
+        *p++ = 8;
+    for (; i <= 255; ++i)
+        *p++ = 9;
+    for (; i <= 279; ++i)
+        *p++ = 7;
+    for (; i <= 287; ++i)
+        *p++ = 8;
+
+    memset(d->m_huff_code_sizes[1], 5, 32);
+
+    tdefl_optimize_huffman_table(d, 0, 288, 15, MZ_TRUE);
+    tdefl_optimize_huffman_table(d, 1, 32, 15, MZ_TRUE);
+
+    TDEFL_PUT_BITS(1, 2);
+}
+
+static const mz_uint mz_bitmasks[17] = { 0x0000, 0x0001, 0x0003, 0x0007, 0x000F, 0x001F, 0x003F, 0x007F, 0x00FF, 0x01FF, 0x03FF, 0x07FF, 0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF };
+
+#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN && MINIZ_HAS_64BIT_REGISTERS
+static mz_bool tdefl_compress_lz_codes(tdefl_compressor *d)
+{
+    mz_uint flags;
+    mz_uint8 *pLZ_codes;
+    mz_uint8 *pOutput_buf = d->m_pOutput_buf;
+    mz_uint8 *pLZ_code_buf_end = d->m_pLZ_code_buf;
+    mz_uint64 bit_buffer = d->m_bit_buffer;
+    mz_uint bits_in = d->m_bits_in;
+
+#define TDEFL_PUT_BITS_FAST(b, l)                    \
+    {                                                \
+        bit_buffer |= (((mz_uint64)(b)) << bits_in); \
+        bits_in += (l);                              \
+    }
+
+    flags = 1;
+    for (pLZ_codes = d->m_lz_code_buf; pLZ_codes < pLZ_code_buf_end; flags >>= 1)
+    {
+        if (flags == 1)
+            flags = *pLZ_codes++ | 0x100;
+
+        if (flags & 1)
+        {
+            mz_uint s0, s1, n0, n1, sym, num_extra_bits;
+            mz_uint match_len = pLZ_codes[0], match_dist = *(const mz_uint16 *)(pLZ_codes + 1);
+            pLZ_codes += 3;
+
+            MZ_ASSERT(d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]);
+            TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][s_tdefl_len_sym[match_len]], d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]);
+            TDEFL_PUT_BITS_FAST(match_len & mz_bitmasks[s_tdefl_len_extra[match_len]], s_tdefl_len_extra[match_len]);
+
+            /* This sequence coaxes MSVC into using cmov's vs. jmp's. */
+            s0 = s_tdefl_small_dist_sym[match_dist & 511];
+            n0 = s_tdefl_small_dist_extra[match_dist & 511];
+            s1 = s_tdefl_large_dist_sym[match_dist >> 8];
+            n1 = s_tdefl_large_dist_extra[match_dist >> 8];
+            sym = (match_dist < 512) ? s0 : s1;
+            num_extra_bits = (match_dist < 512) ? n0 : n1;
+
+            MZ_ASSERT(d->m_huff_code_sizes[1][sym]);
+            TDEFL_PUT_BITS_FAST(d->m_huff_codes[1][sym], d->m_huff_code_sizes[1][sym]);
+            TDEFL_PUT_BITS_FAST(match_dist & mz_bitmasks[num_extra_bits], num_extra_bits);
+        }
+        else
+        {
+            mz_uint lit = *pLZ_codes++;
+            MZ_ASSERT(d->m_huff_code_sizes[0][lit]);
+            TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]);
+
+            if (((flags & 2) == 0) && (pLZ_codes < pLZ_code_buf_end))
+            {
+                flags >>= 1;
+                lit = *pLZ_codes++;
+                MZ_ASSERT(d->m_huff_code_sizes[0][lit]);
+                TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]);
+
+                if (((flags & 2) == 0) && (pLZ_codes < pLZ_code_buf_end))
+                {
+                    flags >>= 1;
+                    lit = *pLZ_codes++;
+                    MZ_ASSERT(d->m_huff_code_sizes[0][lit]);
+                    TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]);
+                }
+            }
+        }
+
+        if (pOutput_buf >= d->m_pOutput_buf_end)
+            return MZ_FALSE;
+
+        *(mz_uint64 *)pOutput_buf = bit_buffer;
+        pOutput_buf += (bits_in >> 3);
+        bit_buffer >>= (bits_in & ~7);
+        bits_in &= 7;
+    }
+
+#undef TDEFL_PUT_BITS_FAST
+
+    d->m_pOutput_buf = pOutput_buf;
+    d->m_bits_in = 0;
+    d->m_bit_buffer = 0;
+
+    while (bits_in)
+    {
+        mz_uint32 n = MZ_MIN(bits_in, 16);
+        TDEFL_PUT_BITS((mz_uint)bit_buffer & mz_bitmasks[n], n);
+        bit_buffer >>= n;
+        bits_in -= n;
+    }
+
+    TDEFL_PUT_BITS(d->m_huff_codes[0][256], d->m_huff_code_sizes[0][256]);
+
+    return (d->m_pOutput_buf < d->m_pOutput_buf_end);
+}
+#else
+static mz_bool tdefl_compress_lz_codes(tdefl_compressor *d)
+{
+    mz_uint flags;
+    mz_uint8 *pLZ_codes;
+
+    flags = 1;
+    for (pLZ_codes = d->m_lz_code_buf; pLZ_codes < d->m_pLZ_code_buf; flags >>= 1)
+    {
+        if (flags == 1)
+            flags = *pLZ_codes++ | 0x100;
+        if (flags & 1)
+        {
+            mz_uint sym, num_extra_bits;
+            mz_uint match_len = pLZ_codes[0], match_dist = (pLZ_codes[1] | (pLZ_codes[2] << 8));
+            pLZ_codes += 3;
+
+            MZ_ASSERT(d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]);
+            TDEFL_PUT_BITS(d->m_huff_codes[0][s_tdefl_len_sym[match_len]], d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]);
+            TDEFL_PUT_BITS(match_len & mz_bitmasks[s_tdefl_len_extra[match_len]], s_tdefl_len_extra[match_len]);
+
+            if (match_dist < 512)
+            {
+                sym = s_tdefl_small_dist_sym[match_dist];
+                num_extra_bits = s_tdefl_small_dist_extra[match_dist];
+            }
+            else
+            {
+                sym = s_tdefl_large_dist_sym[match_dist >> 8];
+                num_extra_bits = s_tdefl_large_dist_extra[match_dist >> 8];
+            }
+            MZ_ASSERT(d->m_huff_code_sizes[1][sym]);
+            TDEFL_PUT_BITS(d->m_huff_codes[1][sym], d->m_huff_code_sizes[1][sym]);
+            TDEFL_PUT_BITS(match_dist & mz_bitmasks[num_extra_bits], num_extra_bits);
+        }
+        else
+        {
+            mz_uint lit = *pLZ_codes++;
+            MZ_ASSERT(d->m_huff_code_sizes[0][lit]);
+            TDEFL_PUT_BITS(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]);
+        }
+    }
+
+    TDEFL_PUT_BITS(d->m_huff_codes[0][256], d->m_huff_code_sizes[0][256]);
+
+    return (d->m_pOutput_buf < d->m_pOutput_buf_end);
+}
+#endif /* MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN && MINIZ_HAS_64BIT_REGISTERS */
+
+static mz_bool tdefl_compress_block(tdefl_compressor *d, mz_bool static_block)
+{
+    if (static_block)
+        tdefl_start_static_block(d);
+    else
+        tdefl_start_dynamic_block(d);
+    return tdefl_compress_lz_codes(d);
+}
+
+static int tdefl_flush_block(tdefl_compressor *d, int flush)
+{
+    mz_uint saved_bit_buf, saved_bits_in;
+    mz_uint8 *pSaved_output_buf;
+    mz_bool comp_block_succeeded = MZ_FALSE;
+    int n, use_raw_block = ((d->m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS) != 0) && (d->m_lookahead_pos - d->m_lz_code_buf_dict_pos) <= d->m_dict_size;
+    mz_uint8 *pOutput_buf_start = ((d->m_pPut_buf_func == NULL) && ((*d->m_pOut_buf_size - d->m_out_buf_ofs) >= TDEFL_OUT_BUF_SIZE)) ? ((mz_uint8 *)d->m_pOut_buf + d->m_out_buf_ofs) : d->m_output_buf;
+
+    d->m_pOutput_buf = pOutput_buf_start;
+    d->m_pOutput_buf_end = d->m_pOutput_buf + TDEFL_OUT_BUF_SIZE - 16;
+
+    MZ_ASSERT(!d->m_output_flush_remaining);
+    d->m_output_flush_ofs = 0;
+    d->m_output_flush_remaining = 0;
+
+    *d->m_pLZ_flags = (mz_uint8)(*d->m_pLZ_flags >> d->m_num_flags_left);
+    d->m_pLZ_code_buf -= (d->m_num_flags_left == 8);
+
+    if ((d->m_flags & TDEFL_WRITE_ZLIB_HEADER) && (!d->m_block_index))
+    {
+        TDEFL_PUT_BITS(0x78, 8);
+        TDEFL_PUT_BITS(0x01, 8);
+    }
+
+    TDEFL_PUT_BITS(flush == TDEFL_FINISH, 1);
+
+    pSaved_output_buf = d->m_pOutput_buf;
+    saved_bit_buf = d->m_bit_buffer;
+    saved_bits_in = d->m_bits_in;
+
+    if (!use_raw_block)
+        comp_block_succeeded = tdefl_compress_block(d, (d->m_flags & TDEFL_FORCE_ALL_STATIC_BLOCKS) || (d->m_total_lz_bytes < 48));
+
+    /* If the block gets expanded, forget the current contents of the output buffer and send a raw block instead. */
+    if (((use_raw_block) || ((d->m_total_lz_bytes) && ((d->m_pOutput_buf - pSaved_output_buf + 1U) >= d->m_total_lz_bytes))) &&
+        ((d->m_lookahead_pos - d->m_lz_code_buf_dict_pos) <= d->m_dict_size))
+    {
+        mz_uint i;
+        d->m_pOutput_buf = pSaved_output_buf;
+        d->m_bit_buffer = saved_bit_buf, d->m_bits_in = saved_bits_in;
+        TDEFL_PUT_BITS(0, 2);
+        if (d->m_bits_in)
+        {
+            TDEFL_PUT_BITS(0, 8 - d->m_bits_in);
+        }
+        for (i = 2; i; --i, d->m_total_lz_bytes ^= 0xFFFF)
+        {
+            TDEFL_PUT_BITS(d->m_total_lz_bytes & 0xFFFF, 16);
+        }
+        for (i = 0; i < d->m_total_lz_bytes; ++i)
+        {
+            TDEFL_PUT_BITS(d->m_dict[(d->m_lz_code_buf_dict_pos + i) & TDEFL_LZ_DICT_SIZE_MASK], 8);
+        }
+    }
+    /* Check for the extremely unlikely (if not impossible) case of the compressed block not fitting into the output buffer when using dynamic codes. */
+    else if (!comp_block_succeeded)
+    {
+        d->m_pOutput_buf = pSaved_output_buf;
+        d->m_bit_buffer = saved_bit_buf, d->m_bits_in = saved_bits_in;
+        tdefl_compress_block(d, MZ_TRUE);
+    }
+
+    if (flush)
+    {
+        if (flush == TDEFL_FINISH)
+        {
+            if (d->m_bits_in)
+            {
+                TDEFL_PUT_BITS(0, 8 - d->m_bits_in);
+            }
+            if (d->m_flags & TDEFL_WRITE_ZLIB_HEADER)
+            {
+                mz_uint i, a = d->m_adler32;
+                for (i = 0; i < 4; i++)
+                {
+                    TDEFL_PUT_BITS((a >> 24) & 0xFF, 8);
+                    a <<= 8;
+                }
+            }
+        }
+        else
+        {
+            mz_uint i, z = 0;
+            TDEFL_PUT_BITS(0, 3);
+            if (d->m_bits_in)
+            {
+                TDEFL_PUT_BITS(0, 8 - d->m_bits_in);
+            }
+            for (i = 2; i; --i, z ^= 0xFFFF)
+            {
+                TDEFL_PUT_BITS(z & 0xFFFF, 16);
+            }
+        }
+    }
+
+    MZ_ASSERT(d->m_pOutput_buf < d->m_pOutput_buf_end);
+
+    memset(&d->m_huff_count[0][0], 0, sizeof(d->m_huff_count[0][0]) * TDEFL_MAX_HUFF_SYMBOLS_0);
+    memset(&d->m_huff_count[1][0], 0, sizeof(d->m_huff_count[1][0]) * TDEFL_MAX_HUFF_SYMBOLS_1);
+
+    d->m_pLZ_code_buf = d->m_lz_code_buf + 1;
+    d->m_pLZ_flags = d->m_lz_code_buf;
+    d->m_num_flags_left = 8;
+    d->m_lz_code_buf_dict_pos += d->m_total_lz_bytes;
+    d->m_total_lz_bytes = 0;
+    d->m_block_index++;
+
+    if ((n = (int)(d->m_pOutput_buf - pOutput_buf_start)) != 0)
+    {
+        if (d->m_pPut_buf_func)
+        {
+            *d->m_pIn_buf_size = d->m_pSrc - (const mz_uint8 *)d->m_pIn_buf;
+            if (!(*d->m_pPut_buf_func)(d->m_output_buf, n, d->m_pPut_buf_user))
+                return (d->m_prev_return_status = TDEFL_STATUS_PUT_BUF_FAILED);
+        }
+        else if (pOutput_buf_start == d->m_output_buf)
+        {
+            int bytes_to_copy = (int)MZ_MIN((size_t)n, (size_t)(*d->m_pOut_buf_size - d->m_out_buf_ofs));
+            memcpy((mz_uint8 *)d->m_pOut_buf + d->m_out_buf_ofs, d->m_output_buf, bytes_to_copy);
+            d->m_out_buf_ofs += bytes_to_copy;
+            if ((n -= bytes_to_copy) != 0)
+            {
+                d->m_output_flush_ofs = bytes_to_copy;
+                d->m_output_flush_remaining = n;
+            }
+        }
+        else
+        {
+            d->m_out_buf_ofs += n;
+        }
+    }
+
+    return d->m_output_flush_remaining;
+}
+
+#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES
+#ifdef MINIZ_UNALIGNED_USE_MEMCPY
+static inline mz_uint16 TDEFL_READ_UNALIGNED_WORD(const mz_uint8* p)
+{
+	mz_uint16 ret;
+	memcpy(&ret, p, sizeof(mz_uint16));
+	return ret;
+}
+static inline mz_uint16 TDEFL_READ_UNALIGNED_WORD2(const mz_uint16* p)
+{
+	mz_uint16 ret;
+	memcpy(&ret, p, sizeof(mz_uint16));
+	return ret;
+}
+#else
+#define TDEFL_READ_UNALIGNED_WORD(p) *(const mz_uint16 *)(p)
+#define TDEFL_READ_UNALIGNED_WORD2(p) *(const mz_uint16 *)(p)
+#endif
+static MZ_FORCEINLINE void tdefl_find_match(tdefl_compressor *d, mz_uint lookahead_pos, mz_uint max_dist, mz_uint max_match_len, mz_uint *pMatch_dist, mz_uint *pMatch_len)
+{
+    mz_uint dist, pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK, match_len = *pMatch_len, probe_pos = pos, next_probe_pos, probe_len;
+    mz_uint num_probes_left = d->m_max_probes[match_len >= 32];
+    const mz_uint16 *s = (const mz_uint16 *)(d->m_dict + pos), *p, *q;
+    mz_uint16 c01 = TDEFL_READ_UNALIGNED_WORD(&d->m_dict[pos + match_len - 1]), s01 = TDEFL_READ_UNALIGNED_WORD2(s);
+    MZ_ASSERT(max_match_len <= TDEFL_MAX_MATCH_LEN);
+    if (max_match_len <= match_len)
+        return;
+    for (;;)
+    {
+        for (;;)
+        {
+            if (--num_probes_left == 0)
+                return;
+#define TDEFL_PROBE                                                                             \
+    next_probe_pos = d->m_next[probe_pos];                                                      \
+    if ((!next_probe_pos) || ((dist = (mz_uint16)(lookahead_pos - next_probe_pos)) > max_dist)) \
+        return;                                                                                 \
+    probe_pos = next_probe_pos & TDEFL_LZ_DICT_SIZE_MASK;                                       \
+    if (TDEFL_READ_UNALIGNED_WORD(&d->m_dict[probe_pos + match_len - 1]) == c01)                \
+        break;
+            TDEFL_PROBE;
+            TDEFL_PROBE;
+            TDEFL_PROBE;
+        }
+        if (!dist)
+            break;
+        q = (const mz_uint16 *)(d->m_dict + probe_pos);
+        if (TDEFL_READ_UNALIGNED_WORD2(q) != s01)
+            continue;
+        p = s;
+        probe_len = 32;
+        do
+        {
+        } while ((TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) &&
+                 (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (--probe_len > 0));
+        if (!probe_len)
+        {
+            *pMatch_dist = dist;
+            *pMatch_len = MZ_MIN(max_match_len, (mz_uint)TDEFL_MAX_MATCH_LEN);
+            break;
+        }
+        else if ((probe_len = ((mz_uint)(p - s) * 2) + (mz_uint)(*(const mz_uint8 *)p == *(const mz_uint8 *)q)) > match_len)
+        {
+            *pMatch_dist = dist;
+            if ((*pMatch_len = match_len = MZ_MIN(max_match_len, probe_len)) == max_match_len)
+                break;
+            c01 = TDEFL_READ_UNALIGNED_WORD(&d->m_dict[pos + match_len - 1]);
+        }
+    }
+}
+#else
+static MZ_FORCEINLINE void tdefl_find_match(tdefl_compressor *d, mz_uint lookahead_pos, mz_uint max_dist, mz_uint max_match_len, mz_uint *pMatch_dist, mz_uint *pMatch_len)
+{
+    mz_uint dist, pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK, match_len = *pMatch_len, probe_pos = pos, next_probe_pos, probe_len;
+    mz_uint num_probes_left = d->m_max_probes[match_len >= 32];
+    const mz_uint8 *s = d->m_dict + pos, *p, *q;
+    mz_uint8 c0 = d->m_dict[pos + match_len], c1 = d->m_dict[pos + match_len - 1];
+    MZ_ASSERT(max_match_len <= TDEFL_MAX_MATCH_LEN);
+    if (max_match_len <= match_len)
+        return;
+    for (;;)
+    {
+        for (;;)
+        {
+            if (--num_probes_left == 0)
+                return;
+#define TDEFL_PROBE                                                                               \
+    next_probe_pos = d->m_next[probe_pos];                                                        \
+    if ((!next_probe_pos) || ((dist = (mz_uint16)(lookahead_pos - next_probe_pos)) > max_dist))   \
+        return;                                                                                   \
+    probe_pos = next_probe_pos & TDEFL_LZ_DICT_SIZE_MASK;                                         \
+    if ((d->m_dict[probe_pos + match_len] == c0) && (d->m_dict[probe_pos + match_len - 1] == c1)) \
+        break;
+            TDEFL_PROBE;
+            TDEFL_PROBE;
+            TDEFL_PROBE;
+        }
+        if (!dist)
+            break;
+        p = s;
+        q = d->m_dict + probe_pos;
+        for (probe_len = 0; probe_len < max_match_len; probe_len++)
+            if (*p++ != *q++)
+                break;
+        if (probe_len > match_len)
+        {
+            *pMatch_dist = dist;
+            if ((*pMatch_len = match_len = probe_len) == max_match_len)
+                return;
+            c0 = d->m_dict[pos + match_len];
+            c1 = d->m_dict[pos + match_len - 1];
+        }
+    }
+}
+#endif /* #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES */
+
+#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN
+static mz_bool tdefl_compress_fast(tdefl_compressor *d)
+{
+    /* Faster, minimally featured LZRW1-style match+parse loop with better register utilization. Intended for applications where raw throughput is valued more highly than ratio. */
+    mz_uint lookahead_pos = d->m_lookahead_pos, lookahead_size = d->m_lookahead_size, dict_size = d->m_dict_size, total_lz_bytes = d->m_total_lz_bytes, num_flags_left = d->m_num_flags_left;
+    mz_uint8 *pLZ_code_buf = d->m_pLZ_code_buf, *pLZ_flags = d->m_pLZ_flags;
+    mz_uint cur_pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK;
+
+    while ((d->m_src_buf_left) || ((d->m_flush) && (lookahead_size)))
+    {
+        const mz_uint TDEFL_COMP_FAST_LOOKAHEAD_SIZE = 4096;
+        mz_uint dst_pos = (lookahead_pos + lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK;
+        mz_uint num_bytes_to_process = (mz_uint)MZ_MIN(d->m_src_buf_left, TDEFL_COMP_FAST_LOOKAHEAD_SIZE - lookahead_size);
+        d->m_src_buf_left -= num_bytes_to_process;
+        lookahead_size += num_bytes_to_process;
+
+        while (num_bytes_to_process)
+        {
+            mz_uint32 n = MZ_MIN(TDEFL_LZ_DICT_SIZE - dst_pos, num_bytes_to_process);
+            memcpy(d->m_dict + dst_pos, d->m_pSrc, n);
+            if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1))
+                memcpy(d->m_dict + TDEFL_LZ_DICT_SIZE + dst_pos, d->m_pSrc, MZ_MIN(n, (TDEFL_MAX_MATCH_LEN - 1) - dst_pos));
+            d->m_pSrc += n;
+            dst_pos = (dst_pos + n) & TDEFL_LZ_DICT_SIZE_MASK;
+            num_bytes_to_process -= n;
+        }
+
+        dict_size = MZ_MIN(TDEFL_LZ_DICT_SIZE - lookahead_size, dict_size);
+        if ((!d->m_flush) && (lookahead_size < TDEFL_COMP_FAST_LOOKAHEAD_SIZE))
+            break;
+
+        while (lookahead_size >= 4)
+        {
+            mz_uint cur_match_dist, cur_match_len = 1;
+            mz_uint8 *pCur_dict = d->m_dict + cur_pos;
+            mz_uint first_trigram = (*(const mz_uint32 *)pCur_dict) & 0xFFFFFF;
+            mz_uint hash = (first_trigram ^ (first_trigram >> (24 - (TDEFL_LZ_HASH_BITS - 8)))) & TDEFL_LEVEL1_HASH_SIZE_MASK;
+            mz_uint probe_pos = d->m_hash[hash];
+            d->m_hash[hash] = (mz_uint16)lookahead_pos;
+
+            if (((cur_match_dist = (mz_uint16)(lookahead_pos - probe_pos)) <= dict_size) && ((*(const mz_uint32 *)(d->m_dict + (probe_pos &= TDEFL_LZ_DICT_SIZE_MASK)) & 0xFFFFFF) == first_trigram))
+            {
+                const mz_uint16 *p = (const mz_uint16 *)pCur_dict;
+                const mz_uint16 *q = (const mz_uint16 *)(d->m_dict + probe_pos);
+                mz_uint32 probe_len = 32;
+                do
+                {
+                } while ((TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) &&
+                         (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (--probe_len > 0));
+                cur_match_len = ((mz_uint)(p - (const mz_uint16 *)pCur_dict) * 2) + (mz_uint)(*(const mz_uint8 *)p == *(const mz_uint8 *)q);
+                if (!probe_len)
+                    cur_match_len = cur_match_dist ? TDEFL_MAX_MATCH_LEN : 0;
+
+                if ((cur_match_len < TDEFL_MIN_MATCH_LEN) || ((cur_match_len == TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 8U * 1024U)))
+                {
+                    cur_match_len = 1;
+                    *pLZ_code_buf++ = (mz_uint8)first_trigram;
+                    *pLZ_flags = (mz_uint8)(*pLZ_flags >> 1);
+                    d->m_huff_count[0][(mz_uint8)first_trigram]++;
+                }
+                else
+                {
+                    mz_uint32 s0, s1;
+                    cur_match_len = MZ_MIN(cur_match_len, lookahead_size);
+
+                    MZ_ASSERT((cur_match_len >= TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 1) && (cur_match_dist <= TDEFL_LZ_DICT_SIZE));
+
+                    cur_match_dist--;
+
+                    pLZ_code_buf[0] = (mz_uint8)(cur_match_len - TDEFL_MIN_MATCH_LEN);
+                    *(mz_uint16 *)(&pLZ_code_buf[1]) = (mz_uint16)cur_match_dist;
+                    pLZ_code_buf += 3;
+                    *pLZ_flags = (mz_uint8)((*pLZ_flags >> 1) | 0x80);
+
+                    s0 = s_tdefl_small_dist_sym[cur_match_dist & 511];
+                    s1 = s_tdefl_large_dist_sym[cur_match_dist >> 8];
+                    d->m_huff_count[1][(cur_match_dist < 512) ? s0 : s1]++;
+
+                    d->m_huff_count[0][s_tdefl_len_sym[cur_match_len - TDEFL_MIN_MATCH_LEN]]++;
+                }
+            }
+            else
+            {
+                *pLZ_code_buf++ = (mz_uint8)first_trigram;
+                *pLZ_flags = (mz_uint8)(*pLZ_flags >> 1);
+                d->m_huff_count[0][(mz_uint8)first_trigram]++;
+            }
+
+            if (--num_flags_left == 0)
+            {
+                num_flags_left = 8;
+                pLZ_flags = pLZ_code_buf++;
+            }
+
+            total_lz_bytes += cur_match_len;
+            lookahead_pos += cur_match_len;
+            dict_size = MZ_MIN(dict_size + cur_match_len, (mz_uint)TDEFL_LZ_DICT_SIZE);
+            cur_pos = (cur_pos + cur_match_len) & TDEFL_LZ_DICT_SIZE_MASK;
+            MZ_ASSERT(lookahead_size >= cur_match_len);
+            lookahead_size -= cur_match_len;
+
+            if (pLZ_code_buf > &d->m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8])
+            {
+                int n;
+                d->m_lookahead_pos = lookahead_pos;
+                d->m_lookahead_size = lookahead_size;
+                d->m_dict_size = dict_size;
+                d->m_total_lz_bytes = total_lz_bytes;
+                d->m_pLZ_code_buf = pLZ_code_buf;
+                d->m_pLZ_flags = pLZ_flags;
+                d->m_num_flags_left = num_flags_left;
+                if ((n = tdefl_flush_block(d, 0)) != 0)
+                    return (n < 0) ? MZ_FALSE : MZ_TRUE;
+                total_lz_bytes = d->m_total_lz_bytes;
+                pLZ_code_buf = d->m_pLZ_code_buf;
+                pLZ_flags = d->m_pLZ_flags;
+                num_flags_left = d->m_num_flags_left;
+            }
+        }
+
+        while (lookahead_size)
+        {
+            mz_uint8 lit = d->m_dict[cur_pos];
+
+            total_lz_bytes++;
+            *pLZ_code_buf++ = lit;
+            *pLZ_flags = (mz_uint8)(*pLZ_flags >> 1);
+            if (--num_flags_left == 0)
+            {
+                num_flags_left = 8;
+                pLZ_flags = pLZ_code_buf++;
+            }
+
+            d->m_huff_count[0][lit]++;
+
+            lookahead_pos++;
+            dict_size = MZ_MIN(dict_size + 1, (mz_uint)TDEFL_LZ_DICT_SIZE);
+            cur_pos = (cur_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK;
+            lookahead_size--;
+
+            if (pLZ_code_buf > &d->m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8])
+            {
+                int n;
+                d->m_lookahead_pos = lookahead_pos;
+                d->m_lookahead_size = lookahead_size;
+                d->m_dict_size = dict_size;
+                d->m_total_lz_bytes = total_lz_bytes;
+                d->m_pLZ_code_buf = pLZ_code_buf;
+                d->m_pLZ_flags = pLZ_flags;
+                d->m_num_flags_left = num_flags_left;
+                if ((n = tdefl_flush_block(d, 0)) != 0)
+                    return (n < 0) ? MZ_FALSE : MZ_TRUE;
+                total_lz_bytes = d->m_total_lz_bytes;
+                pLZ_code_buf = d->m_pLZ_code_buf;
+                pLZ_flags = d->m_pLZ_flags;
+                num_flags_left = d->m_num_flags_left;
+            }
+        }
+    }
+
+    d->m_lookahead_pos = lookahead_pos;
+    d->m_lookahead_size = lookahead_size;
+    d->m_dict_size = dict_size;
+    d->m_total_lz_bytes = total_lz_bytes;
+    d->m_pLZ_code_buf = pLZ_code_buf;
+    d->m_pLZ_flags = pLZ_flags;
+    d->m_num_flags_left = num_flags_left;
+    return MZ_TRUE;
+}
+#endif /* MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN */
+
+static MZ_FORCEINLINE void tdefl_record_literal(tdefl_compressor *d, mz_uint8 lit)
+{
+    d->m_total_lz_bytes++;
+    *d->m_pLZ_code_buf++ = lit;
+    *d->m_pLZ_flags = (mz_uint8)(*d->m_pLZ_flags >> 1);
+    if (--d->m_num_flags_left == 0)
+    {
+        d->m_num_flags_left = 8;
+        d->m_pLZ_flags = d->m_pLZ_code_buf++;
+    }
+    d->m_huff_count[0][lit]++;
+}
+
+static MZ_FORCEINLINE void tdefl_record_match(tdefl_compressor *d, mz_uint match_len, mz_uint match_dist)
+{
+    mz_uint32 s0, s1;
+
+    MZ_ASSERT((match_len >= TDEFL_MIN_MATCH_LEN) && (match_dist >= 1) && (match_dist <= TDEFL_LZ_DICT_SIZE));
+
+    d->m_total_lz_bytes += match_len;
+
+    d->m_pLZ_code_buf[0] = (mz_uint8)(match_len - TDEFL_MIN_MATCH_LEN);
+
+    match_dist -= 1;
+    d->m_pLZ_code_buf[1] = (mz_uint8)(match_dist & 0xFF);
+    d->m_pLZ_code_buf[2] = (mz_uint8)(match_dist >> 8);
+    d->m_pLZ_code_buf += 3;
+
+    *d->m_pLZ_flags = (mz_uint8)((*d->m_pLZ_flags >> 1) | 0x80);
+    if (--d->m_num_flags_left == 0)
+    {
+        d->m_num_flags_left = 8;
+        d->m_pLZ_flags = d->m_pLZ_code_buf++;
+    }
+
+    s0 = s_tdefl_small_dist_sym[match_dist & 511];
+    s1 = s_tdefl_large_dist_sym[(match_dist >> 8) & 127];
+    d->m_huff_count[1][(match_dist < 512) ? s0 : s1]++;
+
+    if (match_len >= TDEFL_MIN_MATCH_LEN)
+        d->m_huff_count[0][s_tdefl_len_sym[match_len - TDEFL_MIN_MATCH_LEN]]++;
+}
+
+static mz_bool tdefl_compress_normal(tdefl_compressor *d)
+{
+    const mz_uint8 *pSrc = d->m_pSrc;
+    size_t src_buf_left = d->m_src_buf_left;
+    tdefl_flush flush = d->m_flush;
+
+    while ((src_buf_left) || ((flush) && (d->m_lookahead_size)))
+    {
+        mz_uint len_to_move, cur_match_dist, cur_match_len, cur_pos;
+        /* Update dictionary and hash chains. Keeps the lookahead size equal to TDEFL_MAX_MATCH_LEN. */
+        if ((d->m_lookahead_size + d->m_dict_size) >= (TDEFL_MIN_MATCH_LEN - 1))
+        {
+            mz_uint dst_pos = (d->m_lookahead_pos + d->m_lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK, ins_pos = d->m_lookahead_pos + d->m_lookahead_size - 2;
+            mz_uint hash = (d->m_dict[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] << TDEFL_LZ_HASH_SHIFT) ^ d->m_dict[(ins_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK];
+            mz_uint num_bytes_to_process = (mz_uint)MZ_MIN(src_buf_left, TDEFL_MAX_MATCH_LEN - d->m_lookahead_size);
+            const mz_uint8 *pSrc_end = pSrc + num_bytes_to_process;
+            src_buf_left -= num_bytes_to_process;
+            d->m_lookahead_size += num_bytes_to_process;
+            while (pSrc != pSrc_end)
+            {
+                mz_uint8 c = *pSrc++;
+                d->m_dict[dst_pos] = c;
+                if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1))
+                    d->m_dict[TDEFL_LZ_DICT_SIZE + dst_pos] = c;
+                hash = ((hash << TDEFL_LZ_HASH_SHIFT) ^ c) & (TDEFL_LZ_HASH_SIZE - 1);
+                d->m_next[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] = d->m_hash[hash];
+                d->m_hash[hash] = (mz_uint16)(ins_pos);
+                dst_pos = (dst_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK;
+                ins_pos++;
+            }
+        }
+        else
+        {
+            while ((src_buf_left) && (d->m_lookahead_size < TDEFL_MAX_MATCH_LEN))
+            {
+                mz_uint8 c = *pSrc++;
+                mz_uint dst_pos = (d->m_lookahead_pos + d->m_lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK;
+                src_buf_left--;
+                d->m_dict[dst_pos] = c;
+                if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1))
+                    d->m_dict[TDEFL_LZ_DICT_SIZE + dst_pos] = c;
+                if ((++d->m_lookahead_size + d->m_dict_size) >= TDEFL_MIN_MATCH_LEN)
+                {
+                    mz_uint ins_pos = d->m_lookahead_pos + (d->m_lookahead_size - 1) - 2;
+                    mz_uint hash = ((d->m_dict[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] << (TDEFL_LZ_HASH_SHIFT * 2)) ^ (d->m_dict[(ins_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK] << TDEFL_LZ_HASH_SHIFT) ^ c) & (TDEFL_LZ_HASH_SIZE - 1);
+                    d->m_next[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] = d->m_hash[hash];
+                    d->m_hash[hash] = (mz_uint16)(ins_pos);
+                }
+            }
+        }
+        d->m_dict_size = MZ_MIN(TDEFL_LZ_DICT_SIZE - d->m_lookahead_size, d->m_dict_size);
+        if ((!flush) && (d->m_lookahead_size < TDEFL_MAX_MATCH_LEN))
+            break;
+
+        /* Simple lazy/greedy parsing state machine. */
+        len_to_move = 1;
+        cur_match_dist = 0;
+        cur_match_len = d->m_saved_match_len ? d->m_saved_match_len : (TDEFL_MIN_MATCH_LEN - 1);
+        cur_pos = d->m_lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK;
+        if (d->m_flags & (TDEFL_RLE_MATCHES | TDEFL_FORCE_ALL_RAW_BLOCKS))
+        {
+            if ((d->m_dict_size) && (!(d->m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS)))
+            {
+                mz_uint8 c = d->m_dict[(cur_pos - 1) & TDEFL_LZ_DICT_SIZE_MASK];
+                cur_match_len = 0;
+                while (cur_match_len < d->m_lookahead_size)
+                {
+                    if (d->m_dict[cur_pos + cur_match_len] != c)
+                        break;
+                    cur_match_len++;
+                }
+                if (cur_match_len < TDEFL_MIN_MATCH_LEN)
+                    cur_match_len = 0;
+                else
+                    cur_match_dist = 1;
+            }
+        }
+        else
+        {
+            tdefl_find_match(d, d->m_lookahead_pos, d->m_dict_size, d->m_lookahead_size, &cur_match_dist, &cur_match_len);
+        }
+        if (((cur_match_len == TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 8U * 1024U)) || (cur_pos == cur_match_dist) || ((d->m_flags & TDEFL_FILTER_MATCHES) && (cur_match_len <= 5)))
+        {
+            cur_match_dist = cur_match_len = 0;
+        }
+        if (d->m_saved_match_len)
+        {
+            if (cur_match_len > d->m_saved_match_len)
+            {
+                tdefl_record_literal(d, (mz_uint8)d->m_saved_lit);
+                if (cur_match_len >= 128)
+                {
+                    tdefl_record_match(d, cur_match_len, cur_match_dist);
+                    d->m_saved_match_len = 0;
+                    len_to_move = cur_match_len;
+                }
+                else
+                {
+                    d->m_saved_lit = d->m_dict[cur_pos];
+                    d->m_saved_match_dist = cur_match_dist;
+                    d->m_saved_match_len = cur_match_len;
+                }
+            }
+            else
+            {
+                tdefl_record_match(d, d->m_saved_match_len, d->m_saved_match_dist);
+                len_to_move = d->m_saved_match_len - 1;
+                d->m_saved_match_len = 0;
+            }
+        }
+        else if (!cur_match_dist)
+            tdefl_record_literal(d, d->m_dict[MZ_MIN(cur_pos, sizeof(d->m_dict) - 1)]);
+        else if ((d->m_greedy_parsing) || (d->m_flags & TDEFL_RLE_MATCHES) || (cur_match_len >= 128))
+        {
+            tdefl_record_match(d, cur_match_len, cur_match_dist);
+            len_to_move = cur_match_len;
+        }
+        else
+        {
+            d->m_saved_lit = d->m_dict[MZ_MIN(cur_pos, sizeof(d->m_dict) - 1)];
+            d->m_saved_match_dist = cur_match_dist;
+            d->m_saved_match_len = cur_match_len;
+        }
+        /* Move the lookahead forward by len_to_move bytes. */
+        d->m_lookahead_pos += len_to_move;
+        MZ_ASSERT(d->m_lookahead_size >= len_to_move);
+        d->m_lookahead_size -= len_to_move;
+        d->m_dict_size = MZ_MIN(d->m_dict_size + len_to_move, (mz_uint)TDEFL_LZ_DICT_SIZE);
+        /* Check if it's time to flush the current LZ codes to the internal output buffer. */
+        if ((d->m_pLZ_code_buf > &d->m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8]) ||
+            ((d->m_total_lz_bytes > 31 * 1024) && (((((mz_uint)(d->m_pLZ_code_buf - d->m_lz_code_buf) * 115) >> 7) >= d->m_total_lz_bytes) || (d->m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS))))
+        {
+            int n;
+            d->m_pSrc = pSrc;
+            d->m_src_buf_left = src_buf_left;
+            if ((n = tdefl_flush_block(d, 0)) != 0)
+                return (n < 0) ? MZ_FALSE : MZ_TRUE;
+        }
+    }
+
+    d->m_pSrc = pSrc;
+    d->m_src_buf_left = src_buf_left;
+    return MZ_TRUE;
+}
+
+static tdefl_status tdefl_flush_output_buffer(tdefl_compressor *d)
+{
+    if (d->m_pIn_buf_size)
+    {
+        *d->m_pIn_buf_size = d->m_pSrc - (const mz_uint8 *)d->m_pIn_buf;
+    }
+
+    if (d->m_pOut_buf_size)
+    {
+        size_t n = MZ_MIN(*d->m_pOut_buf_size - d->m_out_buf_ofs, d->m_output_flush_remaining);
+        memcpy((mz_uint8 *)d->m_pOut_buf + d->m_out_buf_ofs, d->m_output_buf + d->m_output_flush_ofs, n);
+        d->m_output_flush_ofs += (mz_uint)n;
+        d->m_output_flush_remaining -= (mz_uint)n;
+        d->m_out_buf_ofs += n;
+
+        *d->m_pOut_buf_size = d->m_out_buf_ofs;
+    }
+
+    return (d->m_finished && !d->m_output_flush_remaining) ? TDEFL_STATUS_DONE : TDEFL_STATUS_OKAY;
+}
+
+tdefl_status tdefl_compress(tdefl_compressor *d, const void *pIn_buf, size_t *pIn_buf_size, void *pOut_buf, size_t *pOut_buf_size, tdefl_flush flush)
+{
+    if (!d)
+    {
+        if (pIn_buf_size)
+            *pIn_buf_size = 0;
+        if (pOut_buf_size)
+            *pOut_buf_size = 0;
+        return TDEFL_STATUS_BAD_PARAM;
+    }
+
+    d->m_pIn_buf = pIn_buf;
+    d->m_pIn_buf_size = pIn_buf_size;
+    d->m_pOut_buf = pOut_buf;
+    d->m_pOut_buf_size = pOut_buf_size;
+    d->m_pSrc = (const mz_uint8 *)(pIn_buf);
+    d->m_src_buf_left = pIn_buf_size ? *pIn_buf_size : 0;
+    d->m_out_buf_ofs = 0;
+    d->m_flush = flush;
+
+    if (((d->m_pPut_buf_func != NULL) == ((pOut_buf != NULL) || (pOut_buf_size != NULL))) || (d->m_prev_return_status != TDEFL_STATUS_OKAY) ||
+        (d->m_wants_to_finish && (flush != TDEFL_FINISH)) || (pIn_buf_size && *pIn_buf_size && !pIn_buf) || (pOut_buf_size && *pOut_buf_size && !pOut_buf))
+    {
+        if (pIn_buf_size)
+            *pIn_buf_size = 0;
+        if (pOut_buf_size)
+            *pOut_buf_size = 0;
+        return (d->m_prev_return_status = TDEFL_STATUS_BAD_PARAM);
+    }
+    d->m_wants_to_finish |= (flush == TDEFL_FINISH);
+
+    if ((d->m_output_flush_remaining) || (d->m_finished))
+        return (d->m_prev_return_status = tdefl_flush_output_buffer(d));
+
+#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN
+    if (((d->m_flags & TDEFL_MAX_PROBES_MASK) == 1) &&
+        ((d->m_flags & TDEFL_GREEDY_PARSING_FLAG) != 0) &&
+        ((d->m_flags & (TDEFL_FILTER_MATCHES | TDEFL_FORCE_ALL_RAW_BLOCKS | TDEFL_RLE_MATCHES)) == 0))
+    {
+        if (!tdefl_compress_fast(d))
+            return d->m_prev_return_status;
+    }
+    else
+#endif /* #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN */
+    {
+        if (!tdefl_compress_normal(d))
+            return d->m_prev_return_status;
+    }
+
+    if ((d->m_flags & (TDEFL_WRITE_ZLIB_HEADER | TDEFL_COMPUTE_ADLER32)) && (pIn_buf))
+        d->m_adler32 = (mz_uint32)mz_adler32(d->m_adler32, (const mz_uint8 *)pIn_buf, d->m_pSrc - (const mz_uint8 *)pIn_buf);
+
+    if ((flush) && (!d->m_lookahead_size) && (!d->m_src_buf_left) && (!d->m_output_flush_remaining))
+    {
+        if (tdefl_flush_block(d, flush) < 0)
+            return d->m_prev_return_status;
+        d->m_finished = (flush == TDEFL_FINISH);
+        if (flush == TDEFL_FULL_FLUSH)
+        {
+            MZ_CLEAR_OBJ(d->m_hash);
+            MZ_CLEAR_OBJ(d->m_next);
+            d->m_dict_size = 0;
+        }
+    }
+
+    return (d->m_prev_return_status = tdefl_flush_output_buffer(d));
+}
+
+tdefl_status tdefl_compress_buffer(tdefl_compressor *d, const void *pIn_buf, size_t in_buf_size, tdefl_flush flush)
+{
+    MZ_ASSERT(d->m_pPut_buf_func);
+    return tdefl_compress(d, pIn_buf, &in_buf_size, NULL, NULL, flush);
+}
+
+tdefl_status tdefl_init(tdefl_compressor *d, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags)
+{
+    d->m_pPut_buf_func = pPut_buf_func;
+    d->m_pPut_buf_user = pPut_buf_user;
+    d->m_flags = (mz_uint)(flags);
+    d->m_max_probes[0] = 1 + ((flags & 0xFFF) + 2) / 3;
+    d->m_greedy_parsing = (flags & TDEFL_GREEDY_PARSING_FLAG) != 0;
+    d->m_max_probes[1] = 1 + (((flags & 0xFFF) >> 2) + 2) / 3;
+    if (!(flags & TDEFL_NONDETERMINISTIC_PARSING_FLAG))
+        MZ_CLEAR_OBJ(d->m_hash);
+    d->m_lookahead_pos = d->m_lookahead_size = d->m_dict_size = d->m_total_lz_bytes = d->m_lz_code_buf_dict_pos = d->m_bits_in = 0;
+    d->m_output_flush_ofs = d->m_output_flush_remaining = d->m_finished = d->m_block_index = d->m_bit_buffer = d->m_wants_to_finish = 0;
+    d->m_pLZ_code_buf = d->m_lz_code_buf + 1;
+    d->m_pLZ_flags = d->m_lz_code_buf;
+    d->m_num_flags_left = 8;
+    d->m_pOutput_buf = d->m_output_buf;
+    d->m_pOutput_buf_end = d->m_output_buf;
+    d->m_prev_return_status = TDEFL_STATUS_OKAY;
+    d->m_saved_match_dist = d->m_saved_match_len = d->m_saved_lit = 0;
+    d->m_adler32 = 1;
+    d->m_pIn_buf = NULL;
+    d->m_pOut_buf = NULL;
+    d->m_pIn_buf_size = NULL;
+    d->m_pOut_buf_size = NULL;
+    d->m_flush = TDEFL_NO_FLUSH;
+    d->m_pSrc = NULL;
+    d->m_src_buf_left = 0;
+    d->m_out_buf_ofs = 0;
+    if (!(flags & TDEFL_NONDETERMINISTIC_PARSING_FLAG))
+        MZ_CLEAR_OBJ(d->m_dict);
+    memset(&d->m_huff_count[0][0], 0, sizeof(d->m_huff_count[0][0]) * TDEFL_MAX_HUFF_SYMBOLS_0);
+    memset(&d->m_huff_count[1][0], 0, sizeof(d->m_huff_count[1][0]) * TDEFL_MAX_HUFF_SYMBOLS_1);
+    return TDEFL_STATUS_OKAY;
+}
+
+tdefl_status tdefl_get_prev_return_status(tdefl_compressor *d)
+{
+    return d->m_prev_return_status;
+}
+
+mz_uint32 tdefl_get_adler32(tdefl_compressor *d)
+{
+    return d->m_adler32;
+}
+
+mz_bool tdefl_compress_mem_to_output(const void *pBuf, size_t buf_len, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags)
+{
+    tdefl_compressor *pComp;
+    mz_bool succeeded;
+    if (((buf_len) && (!pBuf)) || (!pPut_buf_func))
+        return MZ_FALSE;
+    pComp = (tdefl_compressor *)MZ_MALLOC(sizeof(tdefl_compressor));
+    if (!pComp)
+        return MZ_FALSE;
+    succeeded = (tdefl_init(pComp, pPut_buf_func, pPut_buf_user, flags) == TDEFL_STATUS_OKAY);
+    succeeded = succeeded && (tdefl_compress_buffer(pComp, pBuf, buf_len, TDEFL_FINISH) == TDEFL_STATUS_DONE);
+    MZ_FREE(pComp);
+    return succeeded;
+}
+
+typedef struct
+{
+    size_t m_size, m_capacity;
+    mz_uint8 *m_pBuf;
+    mz_bool m_expandable;
+} tdefl_output_buffer;
+
+static mz_bool tdefl_output_buffer_putter(const void *pBuf, int len, void *pUser)
+{
+    tdefl_output_buffer *p = (tdefl_output_buffer *)pUser;
+    size_t new_size = p->m_size + len;
+    if (new_size > p->m_capacity)
+    {
+        size_t new_capacity = p->m_capacity;
+        mz_uint8 *pNew_buf;
+        if (!p->m_expandable)
+            return MZ_FALSE;
+        do
+        {
+            new_capacity = MZ_MAX(128U, new_capacity << 1U);
+        } while (new_size > new_capacity);
+        pNew_buf = (mz_uint8 *)MZ_REALLOC(p->m_pBuf, new_capacity);
+        if (!pNew_buf)
+            return MZ_FALSE;
+        p->m_pBuf = pNew_buf;
+        p->m_capacity = new_capacity;
+    }
+    memcpy((mz_uint8 *)p->m_pBuf + p->m_size, pBuf, len);
+    p->m_size = new_size;
+    return MZ_TRUE;
+}
+
+void *tdefl_compress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags)
+{
+    tdefl_output_buffer out_buf;
+    MZ_CLEAR_OBJ(out_buf);
+    if (!pOut_len)
+        return MZ_FALSE;
+    else
+        *pOut_len = 0;
+    out_buf.m_expandable = MZ_TRUE;
+    if (!tdefl_compress_mem_to_output(pSrc_buf, src_buf_len, tdefl_output_buffer_putter, &out_buf, flags))
+        return NULL;
+    *pOut_len = out_buf.m_size;
+    return out_buf.m_pBuf;
+}
+
+size_t tdefl_compress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags)
+{
+    tdefl_output_buffer out_buf;
+    MZ_CLEAR_OBJ(out_buf);
+    if (!pOut_buf)
+        return 0;
+    out_buf.m_pBuf = (mz_uint8 *)pOut_buf;
+    out_buf.m_capacity = out_buf_len;
+    if (!tdefl_compress_mem_to_output(pSrc_buf, src_buf_len, tdefl_output_buffer_putter, &out_buf, flags))
+        return 0;
+    return out_buf.m_size;
+}
+
+static const mz_uint s_tdefl_num_probes[11] = { 0, 1, 6, 32, 16, 32, 128, 256, 512, 768, 1500 };
+
+/* level may actually range from [0,10] (10 is a "hidden" max level, where we want a bit more compression and it's fine if throughput to fall off a cliff on some files). */
+mz_uint tdefl_create_comp_flags_from_zip_params(int level, int window_bits, int strategy)
+{
+    mz_uint comp_flags = s_tdefl_num_probes[(level >= 0) ? MZ_MIN(10, level) : MZ_DEFAULT_LEVEL] | ((level <= 3) ? TDEFL_GREEDY_PARSING_FLAG : 0);
+    if (window_bits > 0)
+        comp_flags |= TDEFL_WRITE_ZLIB_HEADER;
+
+    if (!level)
+        comp_flags |= TDEFL_FORCE_ALL_RAW_BLOCKS;
+    else if (strategy == MZ_FILTERED)
+        comp_flags |= TDEFL_FILTER_MATCHES;
+    else if (strategy == MZ_HUFFMAN_ONLY)
+        comp_flags &= ~TDEFL_MAX_PROBES_MASK;
+    else if (strategy == MZ_FIXED)
+        comp_flags |= TDEFL_FORCE_ALL_STATIC_BLOCKS;
+    else if (strategy == MZ_RLE)
+        comp_flags |= TDEFL_RLE_MATCHES;
+
+    return comp_flags;
+}
+
+#ifdef _MSC_VER
+//#pragma warning(push)
+//#pragma warning(disable : 4204) /* nonstandard extension used : non-constant aggregate initializer (also supported by GNU C and C99, so no big deal) */
+#endif
+
+/* Simple PNG writer function by Alex Evans, 2011. Released into the public domain: https://gist.github.com/908299, more context at
+ http://altdevblogaday.org/2011/04/06/a-smaller-jpg-encoder/.
+ This is actually a modification of Alex's original code so PNG files generated by this function pass pngcheck. */
+void *tdefl_write_image_to_png_file_in_memory_ex(const void *pImage, int w, int h, int num_chans, size_t *pLen_out, mz_uint level, mz_bool flip)
+{
+    /* Using a local copy of this array here in case MINIZ_NO_ZLIB_APIS was defined. */
+    static const mz_uint s_tdefl_png_num_probes[11] = { 0, 1, 6, 32, 16, 32, 128, 256, 512, 768, 1500 };
+    tdefl_compressor *pComp = (tdefl_compressor *)MZ_MALLOC(sizeof(tdefl_compressor));
+    tdefl_output_buffer out_buf;
+    int i, bpl = w * num_chans, y, z;
+    mz_uint32 c;
+    *pLen_out = 0;
+    if (!pComp)
+        return NULL;
+    MZ_CLEAR_OBJ(out_buf);
+    out_buf.m_expandable = MZ_TRUE;
+    out_buf.m_capacity = 57 + MZ_MAX(64, (1 + bpl) * h);
+    if (NULL == (out_buf.m_pBuf = (mz_uint8 *)MZ_MALLOC(out_buf.m_capacity)))
+    {
+        MZ_FREE(pComp);
+        return NULL;
+    }
+    /* write dummy header */
+    for (z = 41; z; --z)
+        tdefl_output_buffer_putter(&z, 1, &out_buf);
+    /* compress image data */
+    tdefl_init(pComp, tdefl_output_buffer_putter, &out_buf, s_tdefl_png_num_probes[MZ_MIN(10, level)] | TDEFL_WRITE_ZLIB_HEADER);
+    for (y = 0; y < h; ++y)
+    {
+        tdefl_compress_buffer(pComp, &z, 1, TDEFL_NO_FLUSH);
+        tdefl_compress_buffer(pComp, (mz_uint8 *)pImage + (flip ? (h - 1 - y) : y) * bpl, bpl, TDEFL_NO_FLUSH);
+    }
+    if (tdefl_compress_buffer(pComp, NULL, 0, TDEFL_FINISH) != TDEFL_STATUS_DONE)
+    {
+        MZ_FREE(pComp);
+        MZ_FREE(out_buf.m_pBuf);
+        return NULL;
+    }
+    /* write real header */
+    *pLen_out = out_buf.m_size - 41;
+    {
+        static const mz_uint8 chans[] = { 0x00, 0x00, 0x04, 0x02, 0x06 };
+        mz_uint8 pnghdr[41] = { 0x89, 0x50, 0x4e, 0x47, 0x0d,
+                                0x0a, 0x1a, 0x0a, 0x00, 0x00,
+                                0x00, 0x0d, 0x49, 0x48, 0x44,
+                                0x52, 0x00, 0x00, 0x00, 0x00,
+                                0x00, 0x00, 0x00, 0x00, 0x08,
+                                0x00, 0x00, 0x00, 0x00, 0x00,
+                                0x00, 0x00, 0x00, 0x00, 0x00,
+                                0x00, 0x00, 0x49, 0x44, 0x41,
+                                0x54 };
+        pnghdr[18] = (mz_uint8)(w >> 8);
+        pnghdr[19] = (mz_uint8)w;
+        pnghdr[22] = (mz_uint8)(h >> 8);
+        pnghdr[23] = (mz_uint8)h;
+        pnghdr[25] = chans[num_chans];
+        pnghdr[33] = (mz_uint8)(*pLen_out >> 24);
+        pnghdr[34] = (mz_uint8)(*pLen_out >> 16);
+        pnghdr[35] = (mz_uint8)(*pLen_out >> 8);
+        pnghdr[36] = (mz_uint8)*pLen_out;
+        c = (mz_uint32)mz_crc32(MZ_CRC32_INIT, pnghdr + 12, 17);
+        for (i = 0; i < 4; ++i, c <<= 8)
+            ((mz_uint8 *)(pnghdr + 29))[i] = (mz_uint8)(c >> 24);
+        memcpy(out_buf.m_pBuf, pnghdr, 41);
+    }
+    /* write footer (IDAT CRC-32, followed by IEND chunk) */
+    if (!tdefl_output_buffer_putter("\0\0\0\0\0\0\0\0\x49\x45\x4e\x44\xae\x42\x60\x82", 16, &out_buf))
+    {
+        *pLen_out = 0;
+        MZ_FREE(pComp);
+        MZ_FREE(out_buf.m_pBuf);
+        return NULL;
+    }
+    c = (mz_uint32)mz_crc32(MZ_CRC32_INIT, out_buf.m_pBuf + 41 - 4, *pLen_out + 4);
+    for (i = 0; i < 4; ++i, c <<= 8)
+        (out_buf.m_pBuf + out_buf.m_size - 16)[i] = (mz_uint8)(c >> 24);
+    /* compute final size of file, grab compressed data buffer and return */
+    *pLen_out += 57;
+    MZ_FREE(pComp);
+    return out_buf.m_pBuf;
+}
+void *tdefl_write_image_to_png_file_in_memory(const void *pImage, int w, int h, int num_chans, size_t *pLen_out)
+{
+    /* Level 6 corresponds to TDEFL_DEFAULT_MAX_PROBES or MZ_DEFAULT_LEVEL (but we can't depend on MZ_DEFAULT_LEVEL being available in case the zlib API's where #defined out) */
+    return tdefl_write_image_to_png_file_in_memory_ex(pImage, w, h, num_chans, pLen_out, 6, MZ_FALSE);
+}
+
+/* Allocate the tdefl_compressor and tinfl_decompressor structures in C so that */
+/* non-C language bindings to tdefL_ and tinfl_ API don't need to worry about */
+/* structure size and allocation mechanism. */
+tdefl_compressor *tdefl_compressor_alloc()
+{
+    return (tdefl_compressor *)MZ_MALLOC(sizeof(tdefl_compressor));
+}
+
+void tdefl_compressor_free(tdefl_compressor *pComp)
+{
+    MZ_FREE(pComp);
+}
+
+#ifdef _MSC_VER
+//#pragma warning(pop)
+#endif
+
+/**************************************************************************
+ *
+ * Copyright 2013-2014 RAD Game Tools and Valve Software
+ * Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
+ * All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ *
+ **************************************************************************/
+
+
+
+
+/* ------------------- Low-level Decompression (completely independent from all compression API's) */
+
+#define TINFL_MEMCPY(d, s, l) memcpy(d, s, l)
+#define TINFL_MEMSET(p, c, l) memset(p, c, l)
+
+#define TINFL_CR_BEGIN  \
+    switch (r->m_state) \
+    {                   \
+        case 0:
+#define TINFL_CR_RETURN(state_index, result) \
+    do                                       \
+    {                                        \
+        status = result;                     \
+        r->m_state = state_index;            \
+        goto common_exit;                    \
+        case state_index:;                   \
+    }                                        \
+    MZ_MACRO_END
+#define TINFL_CR_RETURN_FOREVER(state_index, result) \
+    do                                               \
+    {                                                \
+        for (;;)                                     \
+        {                                            \
+            TINFL_CR_RETURN(state_index, result);    \
+        }                                            \
+    }                                                \
+    MZ_MACRO_END
+#define TINFL_CR_FINISH }
+
+#define TINFL_GET_BYTE(state_index, c)                                                                                                                           \
+    do                                                                                                                                                           \
+    {                                                                                                                                                            \
+        while (pIn_buf_cur >= pIn_buf_end)                                                                                                                       \
+        {                                                                                                                                                        \
+            TINFL_CR_RETURN(state_index, (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS); \
+        }                                                                                                                                                        \
+        c = *pIn_buf_cur++;                                                                                                                                      \
+    }                                                                                                                                                            \
+    MZ_MACRO_END
+
+#define TINFL_NEED_BITS(state_index, n)                \
+    do                                                 \
+    {                                                  \
+        mz_uint c;                                     \
+        TINFL_GET_BYTE(state_index, c);                \
+        bit_buf |= (((tinfl_bit_buf_t)c) << num_bits); \
+        num_bits += 8;                                 \
+    } while (num_bits < (mz_uint)(n))
+#define TINFL_SKIP_BITS(state_index, n)      \
+    do                                       \
+    {                                        \
+        if (num_bits < (mz_uint)(n))         \
+        {                                    \
+            TINFL_NEED_BITS(state_index, n); \
+        }                                    \
+        bit_buf >>= (n);                     \
+        num_bits -= (n);                     \
+    }                                        \
+    MZ_MACRO_END
+#define TINFL_GET_BITS(state_index, b, n)    \
+    do                                       \
+    {                                        \
+        if (num_bits < (mz_uint)(n))         \
+        {                                    \
+            TINFL_NEED_BITS(state_index, n); \
+        }                                    \
+        b = bit_buf & ((1 << (n)) - 1);      \
+        bit_buf >>= (n);                     \
+        num_bits -= (n);                     \
+    }                                        \
+    MZ_MACRO_END
+
+/* TINFL_HUFF_BITBUF_FILL() is only used rarely, when the number of bytes remaining in the input buffer falls below 2. */
+/* It reads just enough bytes from the input stream that are needed to decode the next Huffman code (and absolutely no more). It works by trying to fully decode a */
+/* Huffman code by using whatever bits are currently present in the bit buffer. If this fails, it reads another byte, and tries again until it succeeds or until the */
+/* bit buffer contains >=15 bits (deflate's max. Huffman code size). */
+#define TINFL_HUFF_BITBUF_FILL(state_index, pHuff)                             \
+    do                                                                         \
+    {                                                                          \
+        temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)];     \
+        if (temp >= 0)                                                         \
+        {                                                                      \
+            code_len = temp >> 9;                                              \
+            if ((code_len) && (num_bits >= code_len))                          \
+                break;                                                         \
+        }                                                                      \
+        else if (num_bits > TINFL_FAST_LOOKUP_BITS)                            \
+        {                                                                      \
+            code_len = TINFL_FAST_LOOKUP_BITS;                                 \
+            do                                                                 \
+            {                                                                  \
+                temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)]; \
+            } while ((temp < 0) && (num_bits >= (code_len + 1)));              \
+            if (temp >= 0)                                                     \
+                break;                                                         \
+        }                                                                      \
+        TINFL_GET_BYTE(state_index, c);                                        \
+        bit_buf |= (((tinfl_bit_buf_t)c) << num_bits);                         \
+        num_bits += 8;                                                         \
+    } while (num_bits < 15);
+
+/* TINFL_HUFF_DECODE() decodes the next Huffman coded symbol. It's more complex than you would initially expect because the zlib API expects the decompressor to never read */
+/* beyond the final byte of the deflate stream. (In other words, when this macro wants to read another byte from the input, it REALLY needs another byte in order to fully */
+/* decode the next Huffman code.) Handling this properly is particularly important on raw deflate (non-zlib) streams, which aren't followed by a byte aligned adler-32. */
+/* The slow path is only executed at the very end of the input buffer. */
+/* v1.16: The original macro handled the case at the very end of the passed-in input buffer, but we also need to handle the case where the user passes in 1+zillion bytes */
+/* following the deflate data and our non-conservative read-ahead path won't kick in here on this code. This is much trickier. */
+#define TINFL_HUFF_DECODE(state_index, sym, pHuff)                                                                                  \
+    do                                                                                                                              \
+    {                                                                                                                               \
+        int temp;                                                                                                                   \
+        mz_uint code_len, c;                                                                                                        \
+        if (num_bits < 15)                                                                                                          \
+        {                                                                                                                           \
+            if ((pIn_buf_end - pIn_buf_cur) < 2)                                                                                    \
+            {                                                                                                                       \
+                TINFL_HUFF_BITBUF_FILL(state_index, pHuff);                                                                         \
+            }                                                                                                                       \
+            else                                                                                                                    \
+            {                                                                                                                       \
+                bit_buf |= (((tinfl_bit_buf_t)pIn_buf_cur[0]) << num_bits) | (((tinfl_bit_buf_t)pIn_buf_cur[1]) << (num_bits + 8)); \
+                pIn_buf_cur += 2;                                                                                                   \
+                num_bits += 16;                                                                                                     \
+            }                                                                                                                       \
+        }                                                                                                                           \
+        if ((temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)                                               \
+            code_len = temp >> 9, temp &= 511;                                                                                      \
+        else                                                                                                                        \
+        {                                                                                                                           \
+            code_len = TINFL_FAST_LOOKUP_BITS;                                                                                      \
+            do                                                                                                                      \
+            {                                                                                                                       \
+                temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)];                                                      \
+            } while (temp < 0);                                                                                                     \
+        }                                                                                                                           \
+        sym = temp;                                                                                                                 \
+        bit_buf >>= code_len;                                                                                                       \
+        num_bits -= code_len;                                                                                                       \
+    }                                                                                                                               \
+    MZ_MACRO_END
+
+tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_next, size_t *pIn_buf_size, mz_uint8 *pOut_buf_start, mz_uint8 *pOut_buf_next, size_t *pOut_buf_size, const mz_uint32 decomp_flags)
+{
+    static const int s_length_base[31] = { 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 };
+    static const int s_length_extra[31] = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 0, 0 };
+    static const int s_dist_base[32] = { 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0 };
+    static const int s_dist_extra[32] = { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13 };
+    static const mz_uint8 s_length_dezigzag[19] = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
+    static const int s_min_table_sizes[3] = { 257, 1, 4 };
+
+    tinfl_status status = TINFL_STATUS_FAILED;
+    mz_uint32 num_bits, dist, counter, num_extra;
+    tinfl_bit_buf_t bit_buf;
+    const mz_uint8 *pIn_buf_cur = pIn_buf_next, *const pIn_buf_end = pIn_buf_next + *pIn_buf_size;
+    mz_uint8 *pOut_buf_cur = pOut_buf_next, *const pOut_buf_end = pOut_buf_next + *pOut_buf_size;
+    size_t out_buf_size_mask = (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF) ? (size_t)-1 : ((pOut_buf_next - pOut_buf_start) + *pOut_buf_size) - 1, dist_from_out_buf_start;
+
+    /* Ensure the output buffer's size is a power of 2, unless the output buffer is large enough to hold the entire output file (in which case it doesn't matter). */
+    if (((out_buf_size_mask + 1) & out_buf_size_mask) || (pOut_buf_next < pOut_buf_start))
+    {
+        *pIn_buf_size = *pOut_buf_size = 0;
+        return TINFL_STATUS_BAD_PARAM;
+    }
+
+    num_bits = r->m_num_bits;
+    bit_buf = r->m_bit_buf;
+    dist = r->m_dist;
+    counter = r->m_counter;
+    num_extra = r->m_num_extra;
+    dist_from_out_buf_start = r->m_dist_from_out_buf_start;
+    TINFL_CR_BEGIN
+
+    bit_buf = num_bits = dist = counter = num_extra = r->m_zhdr0 = r->m_zhdr1 = 0;
+    r->m_z_adler32 = r->m_check_adler32 = 1;
+    if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER)
+    {
+        TINFL_GET_BYTE(1, r->m_zhdr0);
+        TINFL_GET_BYTE(2, r->m_zhdr1);
+        counter = (((r->m_zhdr0 * 256 + r->m_zhdr1) % 31 != 0) || (r->m_zhdr1 & 32) || ((r->m_zhdr0 & 15) != 8));
+        if (!(decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF))
+            counter |= (((1U << (8U + (r->m_zhdr0 >> 4))) > 32768U) || ((out_buf_size_mask + 1) < (size_t)(1U << (8U + (r->m_zhdr0 >> 4)))));
+        if (counter)
+        {
+            TINFL_CR_RETURN_FOREVER(36, TINFL_STATUS_FAILED);
+        }
+    }
+
+    do
+    {
+        TINFL_GET_BITS(3, r->m_final, 3);
+        r->m_type = r->m_final >> 1;
+        if (r->m_type == 0)
+        {
+            TINFL_SKIP_BITS(5, num_bits & 7);
+            for (counter = 0; counter < 4; ++counter)
+            {
+                if (num_bits)
+                    TINFL_GET_BITS(6, r->m_raw_header[counter], 8);
+                else
+                    TINFL_GET_BYTE(7, r->m_raw_header[counter]);
+            }
+            if ((counter = (r->m_raw_header[0] | (r->m_raw_header[1] << 8))) != (mz_uint)(0xFFFF ^ (r->m_raw_header[2] | (r->m_raw_header[3] << 8))))
+            {
+                TINFL_CR_RETURN_FOREVER(39, TINFL_STATUS_FAILED);
+            }
+            while ((counter) && (num_bits))
+            {
+                TINFL_GET_BITS(51, dist, 8);
+                while (pOut_buf_cur >= pOut_buf_end)
+                {
+                    TINFL_CR_RETURN(52, TINFL_STATUS_HAS_MORE_OUTPUT);
+                }
+                *pOut_buf_cur++ = (mz_uint8)dist;
+                counter--;
+            }
+            while (counter)
+            {
+                size_t n;
+                while (pOut_buf_cur >= pOut_buf_end)
+                {
+                    TINFL_CR_RETURN(9, TINFL_STATUS_HAS_MORE_OUTPUT);
+                }
+                while (pIn_buf_cur >= pIn_buf_end)
+                {
+                    TINFL_CR_RETURN(38, (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS);
+                }
+                n = MZ_MIN(MZ_MIN((size_t)(pOut_buf_end - pOut_buf_cur), (size_t)(pIn_buf_end - pIn_buf_cur)), counter);
+                TINFL_MEMCPY(pOut_buf_cur, pIn_buf_cur, n);
+                pIn_buf_cur += n;
+                pOut_buf_cur += n;
+                counter -= (mz_uint)n;
+            }
+        }
+        else if (r->m_type == 3)
+        {
+            TINFL_CR_RETURN_FOREVER(10, TINFL_STATUS_FAILED);
+        }
+        else
+        {
+            if (r->m_type == 1)
+            {
+                mz_uint8 *p = r->m_tables[0].m_code_size;
+                mz_uint i;
+                r->m_table_sizes[0] = 288;
+                r->m_table_sizes[1] = 32;
+                TINFL_MEMSET(r->m_tables[1].m_code_size, 5, 32);
+                for (i = 0; i <= 143; ++i)
+                    *p++ = 8;
+                for (; i <= 255; ++i)
+                    *p++ = 9;
+                for (; i <= 279; ++i)
+                    *p++ = 7;
+                for (; i <= 287; ++i)
+                    *p++ = 8;
+            }
+            else
+            {
+                for (counter = 0; counter < 3; counter++)
+                {
+                    TINFL_GET_BITS(11, r->m_table_sizes[counter], "\05\05\04"[counter]);
+                    r->m_table_sizes[counter] += s_min_table_sizes[counter];
+                }
+                MZ_CLEAR_OBJ(r->m_tables[2].m_code_size);
+                for (counter = 0; counter < r->m_table_sizes[2]; counter++)
+                {
+                    mz_uint s;
+                    TINFL_GET_BITS(14, s, 3);
+                    r->m_tables[2].m_code_size[s_length_dezigzag[counter]] = (mz_uint8)s;
+                }
+                r->m_table_sizes[2] = 19;
+            }
+            for (; (int)r->m_type >= 0; r->m_type--)
+            {
+                int tree_next, tree_cur;
+                tinfl_huff_table *pTable;
+                mz_uint i, j, used_syms, total, sym_index, next_code[17], total_syms[16];
+                pTable = &r->m_tables[r->m_type];
+                MZ_CLEAR_OBJ(total_syms);
+                MZ_CLEAR_OBJ(pTable->m_look_up);
+                MZ_CLEAR_OBJ(pTable->m_tree);
+                for (i = 0; i < r->m_table_sizes[r->m_type]; ++i)
+                    total_syms[pTable->m_code_size[i]]++;
+                used_syms = 0, total = 0;
+                next_code[0] = next_code[1] = 0;
+                for (i = 1; i <= 15; ++i)
+                {
+                    used_syms += total_syms[i];
+                    next_code[i + 1] = (total = ((total + total_syms[i]) << 1));
+                }
+                if ((65536 != total) && (used_syms > 1))
+                {
+                    TINFL_CR_RETURN_FOREVER(35, TINFL_STATUS_FAILED);
+                }
+                for (tree_next = -1, sym_index = 0; sym_index < r->m_table_sizes[r->m_type]; ++sym_index)
+                {
+                    mz_uint rev_code = 0, l, cur_code, code_size = pTable->m_code_size[sym_index];
+                    if (!code_size)
+                        continue;
+                    cur_code = next_code[code_size]++;
+                    for (l = code_size; l > 0; l--, cur_code >>= 1)
+                        rev_code = (rev_code << 1) | (cur_code & 1);
+                    if (code_size <= TINFL_FAST_LOOKUP_BITS)
+                    {
+                        mz_int16 k = (mz_int16)((code_size << 9) | sym_index);
+                        while (rev_code < TINFL_FAST_LOOKUP_SIZE)
+                        {
+                            pTable->m_look_up[rev_code] = k;
+                            rev_code += (1 << code_size);
+                        }
+                        continue;
+                    }
+                    if (0 == (tree_cur = pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)]))
+                    {
+                        pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = (mz_int16)tree_next;
+                        tree_cur = tree_next;
+                        tree_next -= 2;
+                    }
+                    rev_code >>= (TINFL_FAST_LOOKUP_BITS - 1);
+                    for (j = code_size; j > (TINFL_FAST_LOOKUP_BITS + 1); j--)
+                    {
+                        tree_cur -= ((rev_code >>= 1) & 1);
+                        if (!pTable->m_tree[-tree_cur - 1])
+                        {
+                            pTable->m_tree[-tree_cur - 1] = (mz_int16)tree_next;
+                            tree_cur = tree_next;
+                            tree_next -= 2;
+                        }
+                        else
+                            tree_cur = pTable->m_tree[-tree_cur - 1];
+                    }
+                    tree_cur -= ((rev_code >>= 1) & 1);
+                    pTable->m_tree[-tree_cur - 1] = (mz_int16)sym_index;
+                }
+                if (r->m_type == 2)
+                {
+                    for (counter = 0; counter < (r->m_table_sizes[0] + r->m_table_sizes[1]);)
+                    {
+                        mz_uint s;
+                        TINFL_HUFF_DECODE(16, dist, &r->m_tables[2]);
+                        if (dist < 16)
+                        {
+                            r->m_len_codes[counter++] = (mz_uint8)dist;
+                            continue;
+                        }
+                        if ((dist == 16) && (!counter))
+                        {
+                            TINFL_CR_RETURN_FOREVER(17, TINFL_STATUS_FAILED);
+                        }
+                        num_extra = "\02\03\07"[dist - 16];
+                        TINFL_GET_BITS(18, s, num_extra);
+                        s += "\03\03\013"[dist - 16];
+                        TINFL_MEMSET(r->m_len_codes + counter, (dist == 16) ? r->m_len_codes[counter - 1] : 0, s);
+                        counter += s;
+                    }
+                    if ((r->m_table_sizes[0] + r->m_table_sizes[1]) != counter)
+                    {
+                        TINFL_CR_RETURN_FOREVER(21, TINFL_STATUS_FAILED);
+                    }
+                    TINFL_MEMCPY(r->m_tables[0].m_code_size, r->m_len_codes, r->m_table_sizes[0]);
+                    TINFL_MEMCPY(r->m_tables[1].m_code_size, r->m_len_codes + r->m_table_sizes[0], r->m_table_sizes[1]);
+                }
+            }
+            for (;;)
+            {
+                mz_uint8 *pSrc;
+                for (;;)
+                {
+                    if (((pIn_buf_end - pIn_buf_cur) < 4) || ((pOut_buf_end - pOut_buf_cur) < 2))
+                    {
+                        TINFL_HUFF_DECODE(23, counter, &r->m_tables[0]);
+                        if (counter >= 256)
+                            break;
+                        while (pOut_buf_cur >= pOut_buf_end)
+                        {
+                            TINFL_CR_RETURN(24, TINFL_STATUS_HAS_MORE_OUTPUT);
+                        }
+                        *pOut_buf_cur++ = (mz_uint8)counter;
+                    }
+                    else
+                    {
+                        int sym2;
+                        mz_uint code_len;
+#if TINFL_USE_64BIT_BITBUF
+                        if (num_bits < 30)
+                        {
+                            bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE32(pIn_buf_cur)) << num_bits);
+                            pIn_buf_cur += 4;
+                            num_bits += 32;
+                        }
+#else
+                        if (num_bits < 15)
+                        {
+                            bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE16(pIn_buf_cur)) << num_bits);
+                            pIn_buf_cur += 2;
+                            num_bits += 16;
+                        }
+#endif
+                        if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
+                            code_len = sym2 >> 9;
+                        else
+                        {
+                            code_len = TINFL_FAST_LOOKUP_BITS;
+                            do
+                            {
+                                sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)];
+                            } while (sym2 < 0);
+                        }
+                        counter = sym2;
+                        bit_buf >>= code_len;
+                        num_bits -= code_len;
+                        if (counter & 256)
+                            break;
+
+#if !TINFL_USE_64BIT_BITBUF
+                        if (num_bits < 15)
+                        {
+                            bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE16(pIn_buf_cur)) << num_bits);
+                            pIn_buf_cur += 2;
+                            num_bits += 16;
+                        }
+#endif
+                        if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
+                            code_len = sym2 >> 9;
+                        else
+                        {
+                            code_len = TINFL_FAST_LOOKUP_BITS;
+                            do
+                            {
+                                sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)];
+                            } while (sym2 < 0);
+                        }
+                        bit_buf >>= code_len;
+                        num_bits -= code_len;
+
+                        pOut_buf_cur[0] = (mz_uint8)counter;
+                        if (sym2 & 256)
+                        {
+                            pOut_buf_cur++;
+                            counter = sym2;
+                            break;
+                        }
+                        pOut_buf_cur[1] = (mz_uint8)sym2;
+                        pOut_buf_cur += 2;
+                    }
+                }
+                if ((counter &= 511) == 256)
+                    break;
+
+                num_extra = s_length_extra[counter - 257];
+                counter = s_length_base[counter - 257];
+                if (num_extra)
+                {
+                    mz_uint extra_bits;
+                    TINFL_GET_BITS(25, extra_bits, num_extra);
+                    counter += extra_bits;
+                }
+
+                TINFL_HUFF_DECODE(26, dist, &r->m_tables[1]);
+                num_extra = s_dist_extra[dist];
+                dist = s_dist_base[dist];
+                if (num_extra)
+                {
+                    mz_uint extra_bits;
+                    TINFL_GET_BITS(27, extra_bits, num_extra);
+                    dist += extra_bits;
+                }
+
+                dist_from_out_buf_start = pOut_buf_cur - pOut_buf_start;
+                if ((dist > dist_from_out_buf_start) && (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF))
+                {
+                    TINFL_CR_RETURN_FOREVER(37, TINFL_STATUS_FAILED);
+                }
+
+                pSrc = pOut_buf_start + ((dist_from_out_buf_start - dist) & out_buf_size_mask);
+
+                if ((MZ_MAX(pOut_buf_cur, pSrc) + counter) > pOut_buf_end)
+                {
+                    while (counter--)
+                    {
+                        while (pOut_buf_cur >= pOut_buf_end)
+                        {
+                            TINFL_CR_RETURN(53, TINFL_STATUS_HAS_MORE_OUTPUT);
+                        }
+                        *pOut_buf_cur++ = pOut_buf_start[(dist_from_out_buf_start++ - dist) & out_buf_size_mask];
+                    }
+                    continue;
+                }
+#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES
+                else if ((counter >= 9) && (counter <= dist))
+                {
+                    const mz_uint8 *pSrc_end = pSrc + (counter & ~7);
+                    do
+                    {
+                        ((mz_uint32 *)pOut_buf_cur)[0] = ((const mz_uint32 *)pSrc)[0];
+                        ((mz_uint32 *)pOut_buf_cur)[1] = ((const mz_uint32 *)pSrc)[1];
+                        pOut_buf_cur += 8;
+                    } while ((pSrc += 8) < pSrc_end);
+                    if ((counter &= 7) < 3)
+                    {
+                        if (counter)
+                        {
+                            pOut_buf_cur[0] = pSrc[0];
+                            if (counter > 1)
+                                pOut_buf_cur[1] = pSrc[1];
+                            pOut_buf_cur += counter;
+                        }
+                        continue;
+                    }
+                }
+#endif
+                while(counter>2)
+                {
+                    pOut_buf_cur[0] = pSrc[0];
+                    pOut_buf_cur[1] = pSrc[1];
+                    pOut_buf_cur[2] = pSrc[2];
+                    pOut_buf_cur += 3;
+                    pSrc += 3;
+					counter -= 3;
+                }
+                if (counter > 0)
+                {
+                    pOut_buf_cur[0] = pSrc[0];
+                    if (counter > 1)
+                        pOut_buf_cur[1] = pSrc[1];
+                    pOut_buf_cur += counter;
+                }
+            }
+        }
+    } while (!(r->m_final & 1));
+
+    /* Ensure byte alignment and put back any bytes from the bitbuf if we've looked ahead too far on gzip, or other Deflate streams followed by arbitrary data. */
+    /* I'm being super conservative here. A number of simplifications can be made to the byte alignment part, and the Adler32 check shouldn't ever need to worry about reading from the bitbuf now. */
+    TINFL_SKIP_BITS(32, num_bits & 7);
+    while ((pIn_buf_cur > pIn_buf_next) && (num_bits >= 8))
+    {
+        --pIn_buf_cur;
+        num_bits -= 8;
+    }
+    bit_buf &= (tinfl_bit_buf_t)((((mz_uint64)1) << num_bits) - (mz_uint64)1);
+    MZ_ASSERT(!num_bits); /* if this assert fires then we've read beyond the end of non-deflate/zlib streams with following data (such as gzip streams). */
+
+    if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER)
+    {
+        for (counter = 0; counter < 4; ++counter)
+        {
+            mz_uint s;
+            if (num_bits)
+                TINFL_GET_BITS(41, s, 8);
+            else
+                TINFL_GET_BYTE(42, s);
+            r->m_z_adler32 = (r->m_z_adler32 << 8) | s;
+        }
+    }
+    TINFL_CR_RETURN_FOREVER(34, TINFL_STATUS_DONE);
+
+    TINFL_CR_FINISH
+
+common_exit:
+    /* As long as we aren't telling the caller that we NEED more input to make forward progress: */
+    /* Put back any bytes from the bitbuf in case we've looked ahead too far on gzip, or other Deflate streams followed by arbitrary data. */
+    /* We need to be very careful here to NOT push back any bytes we definitely know we need to make forward progress, though, or we'll lock the caller up into an inf loop. */
+    if ((status != TINFL_STATUS_NEEDS_MORE_INPUT) && (status != TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS))
+    {
+        while ((pIn_buf_cur > pIn_buf_next) && (num_bits >= 8))
+        {
+            --pIn_buf_cur;
+            num_bits -= 8;
+        }
+    }
+    r->m_num_bits = num_bits;
+    r->m_bit_buf = bit_buf & (tinfl_bit_buf_t)((((mz_uint64)1) << num_bits) - (mz_uint64)1);
+    r->m_dist = dist;
+    r->m_counter = counter;
+    r->m_num_extra = num_extra;
+    r->m_dist_from_out_buf_start = dist_from_out_buf_start;
+    *pIn_buf_size = pIn_buf_cur - pIn_buf_next;
+    *pOut_buf_size = pOut_buf_cur - pOut_buf_next;
+    if ((decomp_flags & (TINFL_FLAG_PARSE_ZLIB_HEADER | TINFL_FLAG_COMPUTE_ADLER32)) && (status >= 0))
+    {
+        const mz_uint8 *ptr = pOut_buf_next;
+        size_t buf_len = *pOut_buf_size;
+        mz_uint32 i, s1 = r->m_check_adler32 & 0xffff, s2 = r->m_check_adler32 >> 16;
+        size_t block_len = buf_len % 5552;
+        while (buf_len)
+        {
+            for (i = 0; i + 7 < block_len; i += 8, ptr += 8)
+            {
+                s1 += ptr[0], s2 += s1;
+                s1 += ptr[1], s2 += s1;
+                s1 += ptr[2], s2 += s1;
+                s1 += ptr[3], s2 += s1;
+                s1 += ptr[4], s2 += s1;
+                s1 += ptr[5], s2 += s1;
+                s1 += ptr[6], s2 += s1;
+                s1 += ptr[7], s2 += s1;
+            }
+            for (; i < block_len; ++i)
+                s1 += *ptr++, s2 += s1;
+            s1 %= 65521U, s2 %= 65521U;
+            buf_len -= block_len;
+            block_len = 5552;
+        }
+        r->m_check_adler32 = (s2 << 16) + s1;
+        if ((status == TINFL_STATUS_DONE) && (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER) && (r->m_check_adler32 != r->m_z_adler32))
+            status = TINFL_STATUS_ADLER32_MISMATCH;
+    }
+    return status;
+}
+
+/* Higher level helper functions. */
+void *tinfl_decompress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags)
+{
+    tinfl_decompressor decomp;
+    void *pBuf = NULL, *pNew_buf;
+    size_t src_buf_ofs = 0, out_buf_capacity = 0;
+    *pOut_len = 0;
+    tinfl_init(&decomp);
+    for (;;)
+    {
+        size_t src_buf_size = src_buf_len - src_buf_ofs, dst_buf_size = out_buf_capacity - *pOut_len, new_out_buf_capacity;
+        tinfl_status status = tinfl_decompress(&decomp, (const mz_uint8 *)pSrc_buf + src_buf_ofs, &src_buf_size, (mz_uint8 *)pBuf, pBuf ? (mz_uint8 *)pBuf + *pOut_len : NULL, &dst_buf_size,
+                                               (flags & ~TINFL_FLAG_HAS_MORE_INPUT) | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF);
+        if ((status < 0) || (status == TINFL_STATUS_NEEDS_MORE_INPUT))
+        {
+            MZ_FREE(pBuf);
+            *pOut_len = 0;
+            return NULL;
+        }
+        src_buf_ofs += src_buf_size;
+        *pOut_len += dst_buf_size;
+        if (status == TINFL_STATUS_DONE)
+            break;
+        new_out_buf_capacity = out_buf_capacity * 2;
+        if (new_out_buf_capacity < 128)
+            new_out_buf_capacity = 128;
+        pNew_buf = MZ_REALLOC(pBuf, new_out_buf_capacity);
+        if (!pNew_buf)
+        {
+            MZ_FREE(pBuf);
+            *pOut_len = 0;
+            return NULL;
+        }
+        pBuf = pNew_buf;
+        out_buf_capacity = new_out_buf_capacity;
+    }
+    return pBuf;
+}
+
+size_t tinfl_decompress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags)
+{
+    tinfl_decompressor decomp;
+    tinfl_status status;
+    tinfl_init(&decomp);
+    status = tinfl_decompress(&decomp, (const mz_uint8 *)pSrc_buf, &src_buf_len, (mz_uint8 *)pOut_buf, (mz_uint8 *)pOut_buf, &out_buf_len, (flags & ~TINFL_FLAG_HAS_MORE_INPUT) | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF);
+    return (status != TINFL_STATUS_DONE) ? TINFL_DECOMPRESS_MEM_TO_MEM_FAILED : out_buf_len;
+}
+
+int tinfl_decompress_mem_to_callback(const void *pIn_buf, size_t *pIn_buf_size, tinfl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags)
+{
+    int result = 0;
+    tinfl_decompressor decomp;
+    mz_uint8 *pDict = (mz_uint8 *)MZ_MALLOC(TINFL_LZ_DICT_SIZE);
+    size_t in_buf_ofs = 0, dict_ofs = 0;
+    if (!pDict)
+        return TINFL_STATUS_FAILED;
+    tinfl_init(&decomp);
+    for (;;)
+    {
+        size_t in_buf_size = *pIn_buf_size - in_buf_ofs, dst_buf_size = TINFL_LZ_DICT_SIZE - dict_ofs;
+        tinfl_status status = tinfl_decompress(&decomp, (const mz_uint8 *)pIn_buf + in_buf_ofs, &in_buf_size, pDict, pDict + dict_ofs, &dst_buf_size,
+                                               (flags & ~(TINFL_FLAG_HAS_MORE_INPUT | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF)));
+        in_buf_ofs += in_buf_size;
+        if ((dst_buf_size) && (!(*pPut_buf_func)(pDict + dict_ofs, (int)dst_buf_size, pPut_buf_user)))
+            break;
+        if (status != TINFL_STATUS_HAS_MORE_OUTPUT)
+        {
+            result = (status == TINFL_STATUS_DONE);
+            break;
+        }
+        dict_ofs = (dict_ofs + dst_buf_size) & (TINFL_LZ_DICT_SIZE - 1);
+    }
+    MZ_FREE(pDict);
+    *pIn_buf_size = in_buf_ofs;
+    return result;
+}
+
+tinfl_decompressor *tinfl_decompressor_alloc()
+{
+    tinfl_decompressor *pDecomp = (tinfl_decompressor *)MZ_MALLOC(sizeof(tinfl_decompressor));
+    if (pDecomp)
+        tinfl_init(pDecomp);
+    return pDecomp;
+}
+
+void tinfl_decompressor_free(tinfl_decompressor *pDecomp)
+{
+    MZ_FREE(pDecomp);
+}
+
+
+
+/**************************************************************************
+ *
+ * Copyright 2013-2014 RAD Game Tools and Valve Software
+ * Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
+ * Copyright 2016 Martin Raiber
+ * All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ *
+ **************************************************************************/
+
+
+#ifndef MINIZ_NO_ARCHIVE_APIS
+
+
+
+/* ------------------- .ZIP archive reading */
+
+#ifdef MINIZ_NO_STDIO
+#define MZ_FILE void *
+#else
+#include <sys/stat.h>
+
+#if defined(_MSC_VER) || defined(__MINGW64__)
+static FILE *mz_fopen(const char *pFilename, const char *pMode)
+{
+    FILE *pFile = NULL;
+    fopen_s(&pFile, pFilename, pMode);
+    return pFile;
+}
+static FILE *mz_freopen(const char *pPath, const char *pMode, FILE *pStream)
+{
+    FILE *pFile = NULL;
+    if (freopen_s(&pFile, pPath, pMode, pStream))
+        return NULL;
+    return pFile;
+}
+#ifndef MINIZ_NO_TIME
+#include <sys/utime.h>
+#endif
+#define MZ_FOPEN mz_fopen
+#define MZ_FCLOSE fclose
+#define MZ_FREAD fread
+#define MZ_FWRITE fwrite
+#define MZ_FTELL64 _ftelli64
+#define MZ_FSEEK64 _fseeki64
+#define MZ_FILE_STAT_STRUCT _stat
+#define MZ_FILE_STAT _stat
+#define MZ_FFLUSH fflush
+#define MZ_FREOPEN mz_freopen
+#define MZ_DELETE_FILE remove
+#elif defined(__MINGW32__)
+#ifndef MINIZ_NO_TIME
+#include <sys/utime.h>
+#endif
+#define MZ_FOPEN(f, m) fopen(f, m)
+#define MZ_FCLOSE fclose
+#define MZ_FREAD fread
+#define MZ_FWRITE fwrite
+#define MZ_FTELL64 ftello64
+#define MZ_FSEEK64 fseeko64
+#define MZ_FILE_STAT_STRUCT _stat
+#define MZ_FILE_STAT _stat
+#define MZ_FFLUSH fflush
+#define MZ_FREOPEN(f, m, s) freopen(f, m, s)
+#define MZ_DELETE_FILE remove
+#elif defined(__TINYC__)
+#ifndef MINIZ_NO_TIME
+#include <sys/utime.h>
+#endif
+#define MZ_FOPEN(f, m) fopen(f, m)
+#define MZ_FCLOSE fclose
+#define MZ_FREAD fread
+#define MZ_FWRITE fwrite
+#define MZ_FTELL64 ftell
+#define MZ_FSEEK64 fseek
+#define MZ_FILE_STAT_STRUCT stat
+#define MZ_FILE_STAT stat
+#define MZ_FFLUSH fflush
+#define MZ_FREOPEN(f, m, s) freopen(f, m, s)
+#define MZ_DELETE_FILE remove
+#elif defined(__GNUC__) && _LARGEFILE64_SOURCE
+#ifndef MINIZ_NO_TIME
+#include <utime.h>
+#endif
+#define MZ_FOPEN(f, m) fopen64(f, m)
+#define MZ_FCLOSE fclose
+#define MZ_FREAD fread
+#define MZ_FWRITE fwrite
+#define MZ_FTELL64 ftello64
+#define MZ_FSEEK64 fseeko64
+#define MZ_FILE_STAT_STRUCT stat64
+#define MZ_FILE_STAT stat64
+#define MZ_FFLUSH fflush
+#define MZ_FREOPEN(p, m, s) freopen64(p, m, s)
+#define MZ_DELETE_FILE remove
+#elif defined(__APPLE__)
+#ifndef MINIZ_NO_TIME
+#include <utime.h>
+#endif
+#define MZ_FOPEN(f, m) fopen(f, m)
+#define MZ_FCLOSE fclose
+#define MZ_FREAD fread
+#define MZ_FWRITE fwrite
+#define MZ_FTELL64 ftello
+#define MZ_FSEEK64 fseeko
+#define MZ_FILE_STAT_STRUCT stat
+#define MZ_FILE_STAT stat
+#define MZ_FFLUSH fflush
+#define MZ_FREOPEN(p, m, s) freopen(p, m, s)
+#define MZ_DELETE_FILE remove
+
+#else
+//#pragma message("Using fopen, ftello, fseeko, stat() etc. path for file I/O - this path may not support large files.")
+#ifndef MINIZ_NO_TIME
+#include <utime.h>
+#endif
+#define MZ_FOPEN(f, m) fopen(f, m)
+#define MZ_FCLOSE fclose
+#define MZ_FREAD fread
+#define MZ_FWRITE fwrite
+#ifdef __STRICT_ANSI__
+#define MZ_FTELL64 ftell
+#define MZ_FSEEK64 fseek
+#else
+#define MZ_FTELL64 ftello
+#define MZ_FSEEK64 fseeko
+#endif
+#define MZ_FILE_STAT_STRUCT stat
+#define MZ_FILE_STAT stat
+#define MZ_FFLUSH fflush
+#define MZ_FREOPEN(f, m, s) freopen(f, m, s)
+#define MZ_DELETE_FILE remove
+#endif /* #ifdef _MSC_VER */
+#endif /* #ifdef MINIZ_NO_STDIO */
+
+#define MZ_TOLOWER(c) ((((c) >= 'A') && ((c) <= 'Z')) ? ((c) - 'A' + 'a') : (c))
+
+/* Various ZIP archive enums. To completely avoid cross platform compiler alignment and platform endian issues, miniz.c doesn't use structs for any of this stuff. */
+enum
+{
+    /* ZIP archive identifiers and record sizes */
+    MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIG = 0x06054b50,
+    MZ_ZIP_CENTRAL_DIR_HEADER_SIG = 0x02014b50,
+    MZ_ZIP_LOCAL_DIR_HEADER_SIG = 0x04034b50,
+    MZ_ZIP_LOCAL_DIR_HEADER_SIZE = 30,
+    MZ_ZIP_CENTRAL_DIR_HEADER_SIZE = 46,
+    MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE = 22,
+
+    /* ZIP64 archive identifier and record sizes */
+    MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIG = 0x06064b50,
+    MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIG = 0x07064b50,
+    MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE = 56,
+    MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIZE = 20,
+    MZ_ZIP64_EXTENDED_INFORMATION_FIELD_HEADER_ID = 0x0001,
+    MZ_ZIP_DATA_DESCRIPTOR_ID = 0x08074b50,
+    MZ_ZIP_DATA_DESCRIPTER_SIZE64 = 24,
+    MZ_ZIP_DATA_DESCRIPTER_SIZE32 = 16,
+
+    /* Central directory header record offsets */
+    MZ_ZIP_CDH_SIG_OFS = 0,
+    MZ_ZIP_CDH_VERSION_MADE_BY_OFS = 4,
+    MZ_ZIP_CDH_VERSION_NEEDED_OFS = 6,
+    MZ_ZIP_CDH_BIT_FLAG_OFS = 8,
+    MZ_ZIP_CDH_METHOD_OFS = 10,
+    MZ_ZIP_CDH_FILE_TIME_OFS = 12,
+    MZ_ZIP_CDH_FILE_DATE_OFS = 14,
+    MZ_ZIP_CDH_CRC32_OFS = 16,
+    MZ_ZIP_CDH_COMPRESSED_SIZE_OFS = 20,
+    MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS = 24,
+    MZ_ZIP_CDH_FILENAME_LEN_OFS = 28,
+    MZ_ZIP_CDH_EXTRA_LEN_OFS = 30,
+    MZ_ZIP_CDH_COMMENT_LEN_OFS = 32,
+    MZ_ZIP_CDH_DISK_START_OFS = 34,
+    MZ_ZIP_CDH_INTERNAL_ATTR_OFS = 36,
+    MZ_ZIP_CDH_EXTERNAL_ATTR_OFS = 38,
+    MZ_ZIP_CDH_LOCAL_HEADER_OFS = 42,
+
+    /* Local directory header offsets */
+    MZ_ZIP_LDH_SIG_OFS = 0,
+    MZ_ZIP_LDH_VERSION_NEEDED_OFS = 4,
+    MZ_ZIP_LDH_BIT_FLAG_OFS = 6,
+    MZ_ZIP_LDH_METHOD_OFS = 8,
+    MZ_ZIP_LDH_FILE_TIME_OFS = 10,
+    MZ_ZIP_LDH_FILE_DATE_OFS = 12,
+    MZ_ZIP_LDH_CRC32_OFS = 14,
+    MZ_ZIP_LDH_COMPRESSED_SIZE_OFS = 18,
+    MZ_ZIP_LDH_DECOMPRESSED_SIZE_OFS = 22,
+    MZ_ZIP_LDH_FILENAME_LEN_OFS = 26,
+    MZ_ZIP_LDH_EXTRA_LEN_OFS = 28,
+    MZ_ZIP_LDH_BIT_FLAG_HAS_LOCATOR = 1 << 3,
+
+    /* End of central directory offsets */
+    MZ_ZIP_ECDH_SIG_OFS = 0,
+    MZ_ZIP_ECDH_NUM_THIS_DISK_OFS = 4,
+    MZ_ZIP_ECDH_NUM_DISK_CDIR_OFS = 6,
+    MZ_ZIP_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS = 8,
+    MZ_ZIP_ECDH_CDIR_TOTAL_ENTRIES_OFS = 10,
+    MZ_ZIP_ECDH_CDIR_SIZE_OFS = 12,
+    MZ_ZIP_ECDH_CDIR_OFS_OFS = 16,
+    MZ_ZIP_ECDH_COMMENT_SIZE_OFS = 20,
+
+    /* ZIP64 End of central directory locator offsets */
+    MZ_ZIP64_ECDL_SIG_OFS = 0,                    /* 4 bytes */
+    MZ_ZIP64_ECDL_NUM_DISK_CDIR_OFS = 4,          /* 4 bytes */
+    MZ_ZIP64_ECDL_REL_OFS_TO_ZIP64_ECDR_OFS = 8,  /* 8 bytes */
+    MZ_ZIP64_ECDL_TOTAL_NUMBER_OF_DISKS_OFS = 16, /* 4 bytes */
+
+    /* ZIP64 End of central directory header offsets */
+    MZ_ZIP64_ECDH_SIG_OFS = 0,                       /* 4 bytes */
+    MZ_ZIP64_ECDH_SIZE_OF_RECORD_OFS = 4,            /* 8 bytes */
+    MZ_ZIP64_ECDH_VERSION_MADE_BY_OFS = 12,          /* 2 bytes */
+    MZ_ZIP64_ECDH_VERSION_NEEDED_OFS = 14,           /* 2 bytes */
+    MZ_ZIP64_ECDH_NUM_THIS_DISK_OFS = 16,            /* 4 bytes */
+    MZ_ZIP64_ECDH_NUM_DISK_CDIR_OFS = 20,            /* 4 bytes */
+    MZ_ZIP64_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS = 24, /* 8 bytes */
+    MZ_ZIP64_ECDH_CDIR_TOTAL_ENTRIES_OFS = 32,       /* 8 bytes */
+    MZ_ZIP64_ECDH_CDIR_SIZE_OFS = 40,                /* 8 bytes */
+    MZ_ZIP64_ECDH_CDIR_OFS_OFS = 48,                 /* 8 bytes */
+    MZ_ZIP_VERSION_MADE_BY_DOS_FILESYSTEM_ID = 0,
+    MZ_ZIP_DOS_DIR_ATTRIBUTE_BITFLAG = 0x10,
+    MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_IS_ENCRYPTED = 1,
+    MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_COMPRESSED_PATCH_FLAG = 32,
+    MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_USES_STRONG_ENCRYPTION = 64,
+    MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_LOCAL_DIR_IS_MASKED = 8192,
+    MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_UTF8 = 1 << 11
+};
+
+typedef struct
+{
+    void *m_p;
+    size_t m_size, m_capacity;
+    mz_uint m_element_size;
+} mz_zip_array;
+
+struct mz_zip_internal_state_tag
+{
+    mz_zip_array m_central_dir;
+    mz_zip_array m_central_dir_offsets;
+    mz_zip_array m_sorted_central_dir_offsets;
+
+    /* The flags passed in when the archive is initially opened. */
+    uint32_t m_init_flags;
+
+    /* MZ_TRUE if the archive has a zip64 end of central directory headers, etc. */
+    mz_bool m_zip64;
+
+    /* MZ_TRUE if we found zip64 extended info in the central directory (m_zip64 will also be slammed to true too, even if we didn't find a zip64 end of central dir header, etc.) */
+    mz_bool m_zip64_has_extended_info_fields;
+
+    /* These fields are used by the file, FILE, memory, and memory/heap read/write helpers. */
+    MZ_FILE *m_pFile;
+    mz_uint64 m_file_archive_start_ofs;
+
+    void *m_pMem;
+    size_t m_mem_size;
+    size_t m_mem_capacity;
+};
+
+#define MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(array_ptr, element_size) (array_ptr)->m_element_size = element_size
+
+#if defined(DEBUG) || defined(_DEBUG) || defined(NDEBUG)
+static MZ_FORCEINLINE mz_uint mz_zip_array_range_check(const mz_zip_array *pArray, mz_uint index)
+{
+    MZ_ASSERT(index < pArray->m_size);
+    return index;
+}
+#define MZ_ZIP_ARRAY_ELEMENT(array_ptr, element_type, index) ((element_type *)((array_ptr)->m_p))[mz_zip_array_range_check(array_ptr, index)]
+#else
+#define MZ_ZIP_ARRAY_ELEMENT(array_ptr, element_type, index) ((element_type *)((array_ptr)->m_p))[index]
+#endif
+
+static MZ_FORCEINLINE void mz_zip_array_init(mz_zip_array *pArray, mz_uint32 element_size)
+{
+    memset(pArray, 0, sizeof(mz_zip_array));
+    pArray->m_element_size = element_size;
+}
+
+static MZ_FORCEINLINE void mz_zip_array_clear(mz_zip_archive *pZip, mz_zip_array *pArray)
+{
+    pZip->m_pFree(pZip->m_pAlloc_opaque, pArray->m_p);
+    memset(pArray, 0, sizeof(mz_zip_array));
+}
+
+static mz_bool mz_zip_array_ensure_capacity(mz_zip_archive *pZip, mz_zip_array *pArray, size_t min_new_capacity, mz_uint growing)
+{
+    void *pNew_p;
+    size_t new_capacity = min_new_capacity;
+    MZ_ASSERT(pArray->m_element_size);
+    if (pArray->m_capacity >= min_new_capacity)
+        return MZ_TRUE;
+    if (growing)
+    {
+        new_capacity = MZ_MAX(1, pArray->m_capacity);
+        while (new_capacity < min_new_capacity)
+            new_capacity *= 2;
+    }
+    if (NULL == (pNew_p = pZip->m_pRealloc(pZip->m_pAlloc_opaque, pArray->m_p, pArray->m_element_size, new_capacity)))
+        return MZ_FALSE;
+    pArray->m_p = pNew_p;
+    pArray->m_capacity = new_capacity;
+    return MZ_TRUE;
+}
+
+static MZ_FORCEINLINE mz_bool mz_zip_array_reserve(mz_zip_archive *pZip, mz_zip_array *pArray, size_t new_capacity, mz_uint growing)
+{
+    if (new_capacity > pArray->m_capacity)
+    {
+        if (!mz_zip_array_ensure_capacity(pZip, pArray, new_capacity, growing))
+            return MZ_FALSE;
+    }
+    return MZ_TRUE;
+}
+
+static MZ_FORCEINLINE mz_bool mz_zip_array_resize(mz_zip_archive *pZip, mz_zip_array *pArray, size_t new_size, mz_uint growing)
+{
+    if (new_size > pArray->m_capacity)
+    {
+        if (!mz_zip_array_ensure_capacity(pZip, pArray, new_size, growing))
+            return MZ_FALSE;
+    }
+    pArray->m_size = new_size;
+    return MZ_TRUE;
+}
+
+static MZ_FORCEINLINE mz_bool mz_zip_array_ensure_room(mz_zip_archive *pZip, mz_zip_array *pArray, size_t n)
+{
+    return mz_zip_array_reserve(pZip, pArray, pArray->m_size + n, MZ_TRUE);
+}
+
+static MZ_FORCEINLINE mz_bool mz_zip_array_push_back(mz_zip_archive *pZip, mz_zip_array *pArray, const void *pElements, size_t n)
+{
+    size_t orig_size = pArray->m_size;
+    if (!mz_zip_array_resize(pZip, pArray, orig_size + n, MZ_TRUE))
+        return MZ_FALSE;
+    memcpy((mz_uint8 *)pArray->m_p + orig_size * pArray->m_element_size, pElements, n * pArray->m_element_size);
+    return MZ_TRUE;
+}
+
+#ifndef MINIZ_NO_TIME
+static MZ_TIME_T mz_zip_dos_to_time_t(int dos_time, int dos_date)
+{
+    struct tm tm;
+    memset(&tm, 0, sizeof(tm));
+    tm.tm_isdst = -1;
+    tm.tm_year = ((dos_date >> 9) & 127) + 1980 - 1900;
+    tm.tm_mon = ((dos_date >> 5) & 15) - 1;
+    tm.tm_mday = dos_date & 31;
+    tm.tm_hour = (dos_time >> 11) & 31;
+    tm.tm_min = (dos_time >> 5) & 63;
+    tm.tm_sec = (dos_time << 1) & 62;
+    return mktime(&tm);
+}
+
+#ifndef MINIZ_NO_ARCHIVE_WRITING_APIS
+static void mz_zip_time_t_to_dos_time(MZ_TIME_T time, mz_uint16 *pDOS_time, mz_uint16 *pDOS_date)
+{
+#ifdef _MSC_VER
+    struct tm tm_struct;
+    struct tm *tm = &tm_struct;
+    errno_t err = localtime_s(tm, &time);
+    if (err)
+    {
+        *pDOS_date = 0;
+        *pDOS_time = 0;
+        return;
+    }
+#else
+    struct tm *tm = localtime(&time);
+#endif /* #ifdef _MSC_VER */
+
+    *pDOS_time = (mz_uint16)(((tm->tm_hour) << 11) + ((tm->tm_min) << 5) + ((tm->tm_sec) >> 1));
+    *pDOS_date = (mz_uint16)(((tm->tm_year + 1900 - 1980) << 9) + ((tm->tm_mon + 1) << 5) + tm->tm_mday);
+}
+#endif /* MINIZ_NO_ARCHIVE_WRITING_APIS */
+
+#ifndef MINIZ_NO_STDIO
+#ifndef MINIZ_NO_ARCHIVE_WRITING_APIS
+static mz_bool mz_zip_get_file_modified_time(const char *pFilename, MZ_TIME_T *pTime)
+{
+    struct MZ_FILE_STAT_STRUCT file_stat;
+
+    /* On Linux with x86 glibc, this call will fail on large files (I think >= 0x80000000 bytes) unless you compiled with _LARGEFILE64_SOURCE. Argh. */
+    if (MZ_FILE_STAT(pFilename, &file_stat) != 0)
+        return MZ_FALSE;
+
+    *pTime = file_stat.st_mtime;
+
+    return MZ_TRUE;
+}
+#endif /* #ifndef MINIZ_NO_ARCHIVE_WRITING_APIS*/
+
+static mz_bool mz_zip_set_file_times(const char *pFilename, MZ_TIME_T access_time, MZ_TIME_T modified_time)
+{
+    struct utimbuf t;
+
+    memset(&t, 0, sizeof(t));
+    t.actime = access_time;
+    t.modtime = modified_time;
+
+    return !utime(pFilename, &t);
+}
+#endif /* #ifndef MINIZ_NO_STDIO */
+#endif /* #ifndef MINIZ_NO_TIME */
+
+static MZ_FORCEINLINE mz_bool mz_zip_set_error(mz_zip_archive *pZip, mz_zip_error err_num)
+{
+    if (pZip)
+        pZip->m_last_error = err_num;
+    return MZ_FALSE;
+}
+
+static mz_bool mz_zip_reader_init_internal(mz_zip_archive *pZip, mz_uint flags)
+{
+    (void)flags;
+    if ((!pZip) || (pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_INVALID))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (!pZip->m_pAlloc)
+        pZip->m_pAlloc = miniz_def_alloc_func;
+    if (!pZip->m_pFree)
+        pZip->m_pFree = miniz_def_free_func;
+    if (!pZip->m_pRealloc)
+        pZip->m_pRealloc = miniz_def_realloc_func;
+
+    pZip->m_archive_size = 0;
+    pZip->m_central_directory_file_ofs = 0;
+    pZip->m_total_files = 0;
+    pZip->m_last_error = MZ_ZIP_NO_ERROR;
+
+    if (NULL == (pZip->m_pState = (mz_zip_internal_state *)pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, sizeof(mz_zip_internal_state))))
+        return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+    memset(pZip->m_pState, 0, sizeof(mz_zip_internal_state));
+    MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_central_dir, sizeof(mz_uint8));
+    MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_central_dir_offsets, sizeof(mz_uint32));
+    MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_sorted_central_dir_offsets, sizeof(mz_uint32));
+    pZip->m_pState->m_init_flags = flags;
+    pZip->m_pState->m_zip64 = MZ_FALSE;
+    pZip->m_pState->m_zip64_has_extended_info_fields = MZ_FALSE;
+
+    pZip->m_zip_mode = MZ_ZIP_MODE_READING;
+
+    return MZ_TRUE;
+}
+
+static MZ_FORCEINLINE mz_bool mz_zip_reader_filename_less(const mz_zip_array *pCentral_dir_array, const mz_zip_array *pCentral_dir_offsets, mz_uint l_index, mz_uint r_index)
+{
+    const mz_uint8 *pL = &MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_array, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_offsets, mz_uint32, l_index)), *pE;
+    const mz_uint8 *pR = &MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_array, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_offsets, mz_uint32, r_index));
+    mz_uint l_len = MZ_READ_LE16(pL + MZ_ZIP_CDH_FILENAME_LEN_OFS), r_len = MZ_READ_LE16(pR + MZ_ZIP_CDH_FILENAME_LEN_OFS);
+    mz_uint8 l = 0, r = 0;
+    pL += MZ_ZIP_CENTRAL_DIR_HEADER_SIZE;
+    pR += MZ_ZIP_CENTRAL_DIR_HEADER_SIZE;
+    pE = pL + MZ_MIN(l_len, r_len);
+    while (pL < pE)
+    {
+        if ((l = MZ_TOLOWER(*pL)) != (r = MZ_TOLOWER(*pR)))
+            break;
+        pL++;
+        pR++;
+    }
+    return (pL == pE) ? (l_len < r_len) : (l < r);
+}
+
+#define MZ_SWAP_UINT32(a, b) \
+    do                       \
+    {                        \
+        mz_uint32 t = a;     \
+        a = b;               \
+        b = t;               \
+    }                        \
+    MZ_MACRO_END
+
+/* Heap sort of lowercased filenames, used to help accelerate plain central directory searches by mz_zip_reader_locate_file(). (Could also use qsort(), but it could allocate memory.) */
+static void mz_zip_reader_sort_central_dir_offsets_by_filename(mz_zip_archive *pZip)
+{
+    mz_zip_internal_state *pState = pZip->m_pState;
+    const mz_zip_array *pCentral_dir_offsets = &pState->m_central_dir_offsets;
+    const mz_zip_array *pCentral_dir = &pState->m_central_dir;
+    mz_uint32 *pIndices;
+    mz_uint32 start, end;
+    const mz_uint32 size = pZip->m_total_files;
+
+    if (size <= 1U)
+        return;
+
+    pIndices = &MZ_ZIP_ARRAY_ELEMENT(&pState->m_sorted_central_dir_offsets, mz_uint32, 0);
+
+    start = (size - 2U) >> 1U;
+    for (;;)
+    {
+        mz_uint64 child, root = start;
+        for (;;)
+        {
+            if ((child = (root << 1U) + 1U) >= size)
+                break;
+            child += (((child + 1U) < size) && (mz_zip_reader_filename_less(pCentral_dir, pCentral_dir_offsets, pIndices[child], pIndices[child + 1U])));
+            if (!mz_zip_reader_filename_less(pCentral_dir, pCentral_dir_offsets, pIndices[root], pIndices[child]))
+                break;
+            MZ_SWAP_UINT32(pIndices[root], pIndices[child]);
+            root = child;
+        }
+        if (!start)
+            break;
+        start--;
+    }
+
+    end = size - 1;
+    while (end > 0)
+    {
+        mz_uint64 child, root = 0;
+        MZ_SWAP_UINT32(pIndices[end], pIndices[0]);
+        for (;;)
+        {
+            if ((child = (root << 1U) + 1U) >= end)
+                break;
+            child += (((child + 1U) < end) && mz_zip_reader_filename_less(pCentral_dir, pCentral_dir_offsets, pIndices[child], pIndices[child + 1U]));
+            if (!mz_zip_reader_filename_less(pCentral_dir, pCentral_dir_offsets, pIndices[root], pIndices[child]))
+                break;
+            MZ_SWAP_UINT32(pIndices[root], pIndices[child]);
+            root = child;
+        }
+        end--;
+    }
+}
+
+static mz_bool mz_zip_reader_locate_header_sig(mz_zip_archive *pZip, mz_uint32 record_sig, mz_uint32 record_size, mz_int64 *pOfs)
+{
+    mz_int64 cur_file_ofs;
+    mz_uint32 buf_u32[4096 / sizeof(mz_uint32)];
+    mz_uint8 *pBuf = (mz_uint8 *)buf_u32;
+
+    /* Basic sanity checks - reject files which are too small */
+    if (pZip->m_archive_size < record_size)
+        return MZ_FALSE;
+
+    /* Find the record by scanning the file from the end towards the beginning. */
+    cur_file_ofs = MZ_MAX((mz_int64)pZip->m_archive_size - (mz_int64)sizeof(buf_u32), 0);
+    for (;;)
+    {
+        int i, n = (int)MZ_MIN(sizeof(buf_u32), pZip->m_archive_size - cur_file_ofs);
+
+        if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pBuf, n) != (mz_uint)n)
+            return MZ_FALSE;
+
+        for (i = n - 4; i >= 0; --i)
+        {
+            mz_uint s = MZ_READ_LE32(pBuf + i);
+            if (s == record_sig)
+            {
+                if ((pZip->m_archive_size - (cur_file_ofs + i)) >= record_size)
+                    break;
+            }
+        }
+
+        if (i >= 0)
+        {
+            cur_file_ofs += i;
+            break;
+        }
+
+        /* Give up if we've searched the entire file, or we've gone back "too far" (~64kb) */
+        if ((!cur_file_ofs) || ((pZip->m_archive_size - cur_file_ofs) >= (MZ_UINT16_MAX + record_size)))
+            return MZ_FALSE;
+
+        cur_file_ofs = MZ_MAX(cur_file_ofs - (sizeof(buf_u32) - 3), 0);
+    }
+
+    *pOfs = cur_file_ofs;
+    return MZ_TRUE;
+}
+
+static mz_bool mz_zip_reader_read_central_dir(mz_zip_archive *pZip, mz_uint flags)
+{
+    mz_uint cdir_size = 0, cdir_entries_on_this_disk = 0, num_this_disk = 0, cdir_disk_index = 0;
+    mz_uint64 cdir_ofs = 0;
+    mz_int64 cur_file_ofs = 0;
+    const mz_uint8 *p;
+
+    mz_uint32 buf_u32[4096 / sizeof(mz_uint32)];
+    mz_uint8 *pBuf = (mz_uint8 *)buf_u32;
+    mz_bool sort_central_dir = ((flags & MZ_ZIP_FLAG_DO_NOT_SORT_CENTRAL_DIRECTORY) == 0);
+    mz_uint32 zip64_end_of_central_dir_locator_u32[(MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)];
+    mz_uint8 *pZip64_locator = (mz_uint8 *)zip64_end_of_central_dir_locator_u32;
+
+    mz_uint32 zip64_end_of_central_dir_header_u32[(MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)];
+    mz_uint8 *pZip64_end_of_central_dir = (mz_uint8 *)zip64_end_of_central_dir_header_u32;
+
+    mz_uint64 zip64_end_of_central_dir_ofs = 0;
+
+    /* Basic sanity checks - reject files which are too small, and check the first 4 bytes of the file to make sure a local header is there. */
+    if (pZip->m_archive_size < MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_NOT_AN_ARCHIVE);
+
+    if (!mz_zip_reader_locate_header_sig(pZip, MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIG, MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE, &cur_file_ofs))
+        return mz_zip_set_error(pZip, MZ_ZIP_FAILED_FINDING_CENTRAL_DIR);
+
+    /* Read and verify the end of central directory record. */
+    if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pBuf, MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE) != MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+
+    if (MZ_READ_LE32(pBuf + MZ_ZIP_ECDH_SIG_OFS) != MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIG)
+        return mz_zip_set_error(pZip, MZ_ZIP_NOT_AN_ARCHIVE);
+
+    if (cur_file_ofs >= (MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIZE + MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE))
+    {
+        if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs - MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIZE, pZip64_locator, MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIZE) == MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIZE)
+        {
+            if (MZ_READ_LE32(pZip64_locator + MZ_ZIP64_ECDL_SIG_OFS) == MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIG)
+            {
+                zip64_end_of_central_dir_ofs = MZ_READ_LE64(pZip64_locator + MZ_ZIP64_ECDL_REL_OFS_TO_ZIP64_ECDR_OFS);
+                if (zip64_end_of_central_dir_ofs > (pZip->m_archive_size - MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE))
+                    return mz_zip_set_error(pZip, MZ_ZIP_NOT_AN_ARCHIVE);
+
+                if (pZip->m_pRead(pZip->m_pIO_opaque, zip64_end_of_central_dir_ofs, pZip64_end_of_central_dir, MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE) == MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE)
+                {
+                    if (MZ_READ_LE32(pZip64_end_of_central_dir + MZ_ZIP64_ECDH_SIG_OFS) == MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIG)
+                    {
+                        pZip->m_pState->m_zip64 = MZ_TRUE;
+                    }
+                }
+            }
+        }
+    }
+
+    pZip->m_total_files = MZ_READ_LE16(pBuf + MZ_ZIP_ECDH_CDIR_TOTAL_ENTRIES_OFS);
+    cdir_entries_on_this_disk = MZ_READ_LE16(pBuf + MZ_ZIP_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS);
+    num_this_disk = MZ_READ_LE16(pBuf + MZ_ZIP_ECDH_NUM_THIS_DISK_OFS);
+    cdir_disk_index = MZ_READ_LE16(pBuf + MZ_ZIP_ECDH_NUM_DISK_CDIR_OFS);
+    cdir_size = MZ_READ_LE32(pBuf + MZ_ZIP_ECDH_CDIR_SIZE_OFS);
+    cdir_ofs = MZ_READ_LE32(pBuf + MZ_ZIP_ECDH_CDIR_OFS_OFS);
+
+    if (pZip->m_pState->m_zip64)
+    {
+        mz_uint32 zip64_total_num_of_disks = MZ_READ_LE32(pZip64_locator + MZ_ZIP64_ECDL_TOTAL_NUMBER_OF_DISKS_OFS);
+        mz_uint64 zip64_cdir_total_entries = MZ_READ_LE64(pZip64_end_of_central_dir + MZ_ZIP64_ECDH_CDIR_TOTAL_ENTRIES_OFS);
+        mz_uint64 zip64_cdir_total_entries_on_this_disk = MZ_READ_LE64(pZip64_end_of_central_dir + MZ_ZIP64_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS);
+        mz_uint64 zip64_size_of_end_of_central_dir_record = MZ_READ_LE64(pZip64_end_of_central_dir + MZ_ZIP64_ECDH_SIZE_OF_RECORD_OFS);
+        mz_uint64 zip64_size_of_central_directory = MZ_READ_LE64(pZip64_end_of_central_dir + MZ_ZIP64_ECDH_CDIR_SIZE_OFS);
+
+        if (zip64_size_of_end_of_central_dir_record < (MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE - 12))
+            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+        if (zip64_total_num_of_disks != 1U)
+            return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_MULTIDISK);
+
+        /* Check for miniz's practical limits */
+        if (zip64_cdir_total_entries > MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+
+        pZip->m_total_files = (mz_uint32)zip64_cdir_total_entries;
+
+        if (zip64_cdir_total_entries_on_this_disk > MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+
+        cdir_entries_on_this_disk = (mz_uint32)zip64_cdir_total_entries_on_this_disk;
+
+        /* Check for miniz's current practical limits (sorry, this should be enough for millions of files) */
+        if (zip64_size_of_central_directory > MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_CDIR_SIZE);
+
+        cdir_size = (mz_uint32)zip64_size_of_central_directory;
+
+        num_this_disk = MZ_READ_LE32(pZip64_end_of_central_dir + MZ_ZIP64_ECDH_NUM_THIS_DISK_OFS);
+
+        cdir_disk_index = MZ_READ_LE32(pZip64_end_of_central_dir + MZ_ZIP64_ECDH_NUM_DISK_CDIR_OFS);
+
+        cdir_ofs = MZ_READ_LE64(pZip64_end_of_central_dir + MZ_ZIP64_ECDH_CDIR_OFS_OFS);
+    }
+
+    if (pZip->m_total_files != cdir_entries_on_this_disk)
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_MULTIDISK);
+
+    if (((num_this_disk | cdir_disk_index) != 0) && ((num_this_disk != 1) || (cdir_disk_index != 1)))
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_MULTIDISK);
+
+    if (cdir_size < pZip->m_total_files * MZ_ZIP_CENTRAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    if ((cdir_ofs + (mz_uint64)cdir_size) > pZip->m_archive_size)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    pZip->m_central_directory_file_ofs = cdir_ofs;
+
+    if (pZip->m_total_files)
+    {
+        mz_uint i, n;
+        /* Read the entire central directory into a heap block, and allocate another heap block to hold the unsorted central dir file record offsets, and possibly another to hold the sorted indices. */
+        if ((!mz_zip_array_resize(pZip, &pZip->m_pState->m_central_dir, cdir_size, MZ_FALSE)) ||
+            (!mz_zip_array_resize(pZip, &pZip->m_pState->m_central_dir_offsets, pZip->m_total_files, MZ_FALSE)))
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+        if (sort_central_dir)
+        {
+            if (!mz_zip_array_resize(pZip, &pZip->m_pState->m_sorted_central_dir_offsets, pZip->m_total_files, MZ_FALSE))
+                return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        }
+
+        if (pZip->m_pRead(pZip->m_pIO_opaque, cdir_ofs, pZip->m_pState->m_central_dir.m_p, cdir_size) != cdir_size)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+
+        /* Now create an index into the central directory file records, do some basic sanity checking on each record */
+        p = (const mz_uint8 *)pZip->m_pState->m_central_dir.m_p;
+        for (n = cdir_size, i = 0; i < pZip->m_total_files; ++i)
+        {
+            mz_uint total_header_size, disk_index, bit_flags, filename_size, ext_data_size;
+            mz_uint64 comp_size, decomp_size, local_header_ofs;
+
+            if ((n < MZ_ZIP_CENTRAL_DIR_HEADER_SIZE) || (MZ_READ_LE32(p) != MZ_ZIP_CENTRAL_DIR_HEADER_SIG))
+                return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+            MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir_offsets, mz_uint32, i) = (mz_uint32)(p - (const mz_uint8 *)pZip->m_pState->m_central_dir.m_p);
+
+            if (sort_central_dir)
+                MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_sorted_central_dir_offsets, mz_uint32, i) = i;
+
+            comp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS);
+            decomp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS);
+            local_header_ofs = MZ_READ_LE32(p + MZ_ZIP_CDH_LOCAL_HEADER_OFS);
+            filename_size = MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS);
+            ext_data_size = MZ_READ_LE16(p + MZ_ZIP_CDH_EXTRA_LEN_OFS);
+
+            if ((!pZip->m_pState->m_zip64_has_extended_info_fields) &&
+                (ext_data_size) &&
+                (MZ_MAX(MZ_MAX(comp_size, decomp_size), local_header_ofs) == MZ_UINT32_MAX))
+            {
+                /* Attempt to find zip64 extended information field in the entry's extra data */
+                mz_uint32 extra_size_remaining = ext_data_size;
+
+                if (extra_size_remaining)
+                {
+                    const mz_uint8 *pExtra_data = p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + filename_size;
+
+                    do
+                    {
+                        mz_uint32 field_id;
+                        mz_uint32 field_data_size;
+
+                        if (extra_size_remaining < (sizeof(mz_uint16) * 2))
+                            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+                        field_id = MZ_READ_LE16(pExtra_data);
+                        field_data_size = MZ_READ_LE16(pExtra_data + sizeof(mz_uint16));
+
+                        if ((field_data_size + sizeof(mz_uint16) * 2) > extra_size_remaining)
+                            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+                        if (field_id == MZ_ZIP64_EXTENDED_INFORMATION_FIELD_HEADER_ID)
+                        {
+                            /* Ok, the archive didn't have any zip64 headers but it uses a zip64 extended information field so mark it as zip64 anyway (this can occur with infozip's zip util when it reads compresses files from stdin). */
+                            pZip->m_pState->m_zip64 = MZ_TRUE;
+                            pZip->m_pState->m_zip64_has_extended_info_fields = MZ_TRUE;
+                            break;
+                        }
+
+                        pExtra_data += sizeof(mz_uint16) * 2 + field_data_size;
+                        extra_size_remaining = extra_size_remaining - sizeof(mz_uint16) * 2 - field_data_size;
+                    } while (extra_size_remaining);
+                }
+            }
+
+            /* I've seen archives that aren't marked as zip64 that uses zip64 ext data, argh */
+            if ((comp_size != MZ_UINT32_MAX) && (decomp_size != MZ_UINT32_MAX))
+            {
+                if (((!MZ_READ_LE32(p + MZ_ZIP_CDH_METHOD_OFS)) && (decomp_size != comp_size)) || (decomp_size && !comp_size))
+                    return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+            }
+
+            disk_index = MZ_READ_LE16(p + MZ_ZIP_CDH_DISK_START_OFS);
+            if ((disk_index == MZ_UINT16_MAX) || ((disk_index != num_this_disk) && (disk_index != 1)))
+                return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_MULTIDISK);
+
+            if (comp_size != MZ_UINT32_MAX)
+            {
+                if (((mz_uint64)MZ_READ_LE32(p + MZ_ZIP_CDH_LOCAL_HEADER_OFS) + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + comp_size) > pZip->m_archive_size)
+                    return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+            }
+
+            bit_flags = MZ_READ_LE16(p + MZ_ZIP_CDH_BIT_FLAG_OFS);
+            if (bit_flags & MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_LOCAL_DIR_IS_MASKED)
+                return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_ENCRYPTION);
+
+            if ((total_header_size = MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS) + MZ_READ_LE16(p + MZ_ZIP_CDH_EXTRA_LEN_OFS) + MZ_READ_LE16(p + MZ_ZIP_CDH_COMMENT_LEN_OFS)) > n)
+                return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+            n -= total_header_size;
+            p += total_header_size;
+        }
+    }
+
+    if (sort_central_dir)
+        mz_zip_reader_sort_central_dir_offsets_by_filename(pZip);
+
+    return MZ_TRUE;
+}
+
+void mz_zip_zero_struct(mz_zip_archive *pZip)
+{
+    if (pZip)
+        MZ_CLEAR_OBJ(*pZip);
+}
+
+static mz_bool mz_zip_reader_end_internal(mz_zip_archive *pZip, mz_bool set_last_error)
+{
+    mz_bool status = MZ_TRUE;
+
+    if (!pZip)
+        return MZ_FALSE;
+
+    if ((!pZip->m_pState) || (!pZip->m_pAlloc) || (!pZip->m_pFree) || (pZip->m_zip_mode != MZ_ZIP_MODE_READING))
+    {
+        if (set_last_error)
+            pZip->m_last_error = MZ_ZIP_INVALID_PARAMETER;
+
+        return MZ_FALSE;
+    }
+
+    if (pZip->m_pState)
+    {
+        mz_zip_internal_state *pState = pZip->m_pState;
+        pZip->m_pState = NULL;
+
+        mz_zip_array_clear(pZip, &pState->m_central_dir);
+        mz_zip_array_clear(pZip, &pState->m_central_dir_offsets);
+        mz_zip_array_clear(pZip, &pState->m_sorted_central_dir_offsets);
+
+#ifndef MINIZ_NO_STDIO
+        if (pState->m_pFile)
+        {
+            if (pZip->m_zip_type == MZ_ZIP_TYPE_FILE)
+            {
+                if (MZ_FCLOSE(pState->m_pFile) == EOF)
+                {
+                    if (set_last_error)
+                        pZip->m_last_error = MZ_ZIP_FILE_CLOSE_FAILED;
+                    status = MZ_FALSE;
+                }
+            }
+            pState->m_pFile = NULL;
+        }
+#endif /* #ifndef MINIZ_NO_STDIO */
+
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+    }
+    pZip->m_zip_mode = MZ_ZIP_MODE_INVALID;
+
+    return status;
+}
+
+mz_bool mz_zip_reader_end(mz_zip_archive *pZip)
+{
+    return mz_zip_reader_end_internal(pZip, MZ_TRUE);
+}
+mz_bool mz_zip_reader_init(mz_zip_archive *pZip, mz_uint64 size, mz_uint flags)
+{
+    if ((!pZip) || (!pZip->m_pRead))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (!mz_zip_reader_init_internal(pZip, flags))
+        return MZ_FALSE;
+
+    pZip->m_zip_type = MZ_ZIP_TYPE_USER;
+    pZip->m_archive_size = size;
+
+    if (!mz_zip_reader_read_central_dir(pZip, flags))
+    {
+        mz_zip_reader_end_internal(pZip, MZ_FALSE);
+        return MZ_FALSE;
+    }
+
+    return MZ_TRUE;
+}
+
+static size_t mz_zip_mem_read_func(void *pOpaque, mz_uint64 file_ofs, void *pBuf, size_t n)
+{
+    mz_zip_archive *pZip = (mz_zip_archive *)pOpaque;
+    size_t s = (file_ofs >= pZip->m_archive_size) ? 0 : (size_t)MZ_MIN(pZip->m_archive_size - file_ofs, n);
+    memcpy(pBuf, (const mz_uint8 *)pZip->m_pState->m_pMem + file_ofs, s);
+    return s;
+}
+
+mz_bool mz_zip_reader_init_mem(mz_zip_archive *pZip, const void *pMem, size_t size, mz_uint flags)
+{
+    if (!pMem)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (size < MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_NOT_AN_ARCHIVE);
+
+    if (!mz_zip_reader_init_internal(pZip, flags))
+        return MZ_FALSE;
+
+    pZip->m_zip_type = MZ_ZIP_TYPE_MEMORY;
+    pZip->m_archive_size = size;
+    pZip->m_pRead = mz_zip_mem_read_func;
+    pZip->m_pIO_opaque = pZip;
+    pZip->m_pNeeds_keepalive = NULL;
+
+#ifdef __cplusplus
+    pZip->m_pState->m_pMem = const_cast<void *>(pMem);
+#else
+    pZip->m_pState->m_pMem = (void *)pMem;
+#endif
+
+    pZip->m_pState->m_mem_size = size;
+
+    if (!mz_zip_reader_read_central_dir(pZip, flags))
+    {
+        mz_zip_reader_end_internal(pZip, MZ_FALSE);
+        return MZ_FALSE;
+    }
+
+    return MZ_TRUE;
+}
+
+#ifndef MINIZ_NO_STDIO
+static size_t mz_zip_file_read_func(void *pOpaque, mz_uint64 file_ofs, void *pBuf, size_t n)
+{
+    mz_zip_archive *pZip = (mz_zip_archive *)pOpaque;
+    mz_int64 cur_ofs = MZ_FTELL64(pZip->m_pState->m_pFile);
+
+    file_ofs += pZip->m_pState->m_file_archive_start_ofs;
+
+    if (((mz_int64)file_ofs < 0) || (((cur_ofs != (mz_int64)file_ofs)) && (MZ_FSEEK64(pZip->m_pState->m_pFile, (mz_int64)file_ofs, SEEK_SET))))
+        return 0;
+
+    return MZ_FREAD(pBuf, 1, n, pZip->m_pState->m_pFile);
+}
+
+mz_bool mz_zip_reader_init_file(mz_zip_archive *pZip, const char *pFilename, mz_uint32 flags)
+{
+    return mz_zip_reader_init_file_v2(pZip, pFilename, flags, 0, 0);
+}
+
+mz_bool mz_zip_reader_init_file_v2(mz_zip_archive *pZip, const char *pFilename, mz_uint flags, mz_uint64 file_start_ofs, mz_uint64 archive_size)
+{
+    mz_uint64 file_size;
+    MZ_FILE *pFile;
+
+    if ((!pZip) || (!pFilename) || ((archive_size) && (archive_size < MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE)))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    pFile = MZ_FOPEN(pFilename, "rb");
+    if (!pFile)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_OPEN_FAILED);
+
+    file_size = archive_size;
+    if (!file_size)
+    {
+        if (MZ_FSEEK64(pFile, 0, SEEK_END))
+        {
+            MZ_FCLOSE(pFile);
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_SEEK_FAILED);
+        }
+
+        file_size = MZ_FTELL64(pFile);
+    }
+
+    /* TODO: Better sanity check archive_size and the # of actual remaining bytes */
+
+    if (file_size < MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE)
+    {
+	MZ_FCLOSE(pFile);
+        return mz_zip_set_error(pZip, MZ_ZIP_NOT_AN_ARCHIVE);
+    }
+
+    if (!mz_zip_reader_init_internal(pZip, flags))
+    {
+        MZ_FCLOSE(pFile);
+        return MZ_FALSE;
+    }
+
+    pZip->m_zip_type = MZ_ZIP_TYPE_FILE;
+    pZip->m_pRead = mz_zip_file_read_func;
+    pZip->m_pIO_opaque = pZip;
+    pZip->m_pState->m_pFile = pFile;
+    pZip->m_archive_size = file_size;
+    pZip->m_pState->m_file_archive_start_ofs = file_start_ofs;
+
+    if (!mz_zip_reader_read_central_dir(pZip, flags))
+    {
+        mz_zip_reader_end_internal(pZip, MZ_FALSE);
+        return MZ_FALSE;
+    }
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_reader_init_cfile(mz_zip_archive *pZip, MZ_FILE *pFile, mz_uint64 archive_size, mz_uint flags)
+{
+    mz_uint64 cur_file_ofs;
+
+    if ((!pZip) || (!pFile))
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_OPEN_FAILED);
+
+    cur_file_ofs = MZ_FTELL64(pFile);
+
+    if (!archive_size)
+    {
+        if (MZ_FSEEK64(pFile, 0, SEEK_END))
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_SEEK_FAILED);
+
+        archive_size = MZ_FTELL64(pFile) - cur_file_ofs;
+
+        if (archive_size < MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE)
+            return mz_zip_set_error(pZip, MZ_ZIP_NOT_AN_ARCHIVE);
+    }
+
+    if (!mz_zip_reader_init_internal(pZip, flags))
+        return MZ_FALSE;
+
+    pZip->m_zip_type = MZ_ZIP_TYPE_CFILE;
+    pZip->m_pRead = mz_zip_file_read_func;
+
+    pZip->m_pIO_opaque = pZip;
+    pZip->m_pState->m_pFile = pFile;
+    pZip->m_archive_size = archive_size;
+    pZip->m_pState->m_file_archive_start_ofs = cur_file_ofs;
+
+    if (!mz_zip_reader_read_central_dir(pZip, flags))
+    {
+        mz_zip_reader_end_internal(pZip, MZ_FALSE);
+        return MZ_FALSE;
+    }
+
+    return MZ_TRUE;
+}
+
+#endif /* #ifndef MINIZ_NO_STDIO */
+
+static MZ_FORCEINLINE const mz_uint8 *mz_zip_get_cdh(mz_zip_archive *pZip, mz_uint file_index)
+{
+    if ((!pZip) || (!pZip->m_pState) || (file_index >= pZip->m_total_files))
+        return NULL;
+    return &MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir_offsets, mz_uint32, file_index));
+}
+
+mz_bool mz_zip_reader_is_file_encrypted(mz_zip_archive *pZip, mz_uint file_index)
+{
+    mz_uint m_bit_flag;
+    const mz_uint8 *p = mz_zip_get_cdh(pZip, file_index);
+    if (!p)
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+        return MZ_FALSE;
+    }
+
+    m_bit_flag = MZ_READ_LE16(p + MZ_ZIP_CDH_BIT_FLAG_OFS);
+    return (m_bit_flag & (MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_IS_ENCRYPTED | MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_USES_STRONG_ENCRYPTION)) != 0;
+}
+
+mz_bool mz_zip_reader_is_file_supported(mz_zip_archive *pZip, mz_uint file_index)
+{
+    mz_uint bit_flag;
+    mz_uint method;
+
+    const mz_uint8 *p = mz_zip_get_cdh(pZip, file_index);
+    if (!p)
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+        return MZ_FALSE;
+    }
+
+    method = MZ_READ_LE16(p + MZ_ZIP_CDH_METHOD_OFS);
+    bit_flag = MZ_READ_LE16(p + MZ_ZIP_CDH_BIT_FLAG_OFS);
+
+    if ((method != 0) && (method != MZ_DEFLATED))
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_METHOD);
+        return MZ_FALSE;
+    }
+
+    if (bit_flag & (MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_IS_ENCRYPTED | MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_USES_STRONG_ENCRYPTION))
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_ENCRYPTION);
+        return MZ_FALSE;
+    }
+
+    if (bit_flag & MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_COMPRESSED_PATCH_FLAG)
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_FEATURE);
+        return MZ_FALSE;
+    }
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_reader_is_file_a_directory(mz_zip_archive *pZip, mz_uint file_index)
+{
+    mz_uint filename_len, attribute_mapping_id, external_attr;
+    const mz_uint8 *p = mz_zip_get_cdh(pZip, file_index);
+    if (!p)
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+        return MZ_FALSE;
+    }
+
+    filename_len = MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS);
+    if (filename_len)
+    {
+        if (*(p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + filename_len - 1) == '/')
+            return MZ_TRUE;
+    }
+
+    /* Bugfix: This code was also checking if the internal attribute was non-zero, which wasn't correct. */
+    /* Most/all zip writers (hopefully) set DOS file/directory attributes in the low 16-bits, so check for the DOS directory flag and ignore the source OS ID in the created by field. */
+    /* FIXME: Remove this check? Is it necessary - we already check the filename. */
+    attribute_mapping_id = MZ_READ_LE16(p + MZ_ZIP_CDH_VERSION_MADE_BY_OFS) >> 8;
+    (void)attribute_mapping_id;
+
+    external_attr = MZ_READ_LE32(p + MZ_ZIP_CDH_EXTERNAL_ATTR_OFS);
+    if ((external_attr & MZ_ZIP_DOS_DIR_ATTRIBUTE_BITFLAG) != 0)
+    {
+        return MZ_TRUE;
+    }
+
+    return MZ_FALSE;
+}
+
+static mz_bool mz_zip_file_stat_internal(mz_zip_archive *pZip, mz_uint file_index, const mz_uint8 *pCentral_dir_header, mz_zip_archive_file_stat *pStat, mz_bool *pFound_zip64_extra_data)
+{
+    mz_uint n;
+    const mz_uint8 *p = pCentral_dir_header;
+
+    if (pFound_zip64_extra_data)
+        *pFound_zip64_extra_data = MZ_FALSE;
+
+    if ((!p) || (!pStat))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    /* Extract fields from the central directory record. */
+    pStat->m_file_index = file_index;
+    pStat->m_central_dir_ofs = MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir_offsets, mz_uint32, file_index);
+    pStat->m_version_made_by = MZ_READ_LE16(p + MZ_ZIP_CDH_VERSION_MADE_BY_OFS);
+    pStat->m_version_needed = MZ_READ_LE16(p + MZ_ZIP_CDH_VERSION_NEEDED_OFS);
+    pStat->m_bit_flag = MZ_READ_LE16(p + MZ_ZIP_CDH_BIT_FLAG_OFS);
+    pStat->m_method = MZ_READ_LE16(p + MZ_ZIP_CDH_METHOD_OFS);
+#ifndef MINIZ_NO_TIME
+    pStat->m_time = mz_zip_dos_to_time_t(MZ_READ_LE16(p + MZ_ZIP_CDH_FILE_TIME_OFS), MZ_READ_LE16(p + MZ_ZIP_CDH_FILE_DATE_OFS));
+#endif
+    pStat->m_crc32 = MZ_READ_LE32(p + MZ_ZIP_CDH_CRC32_OFS);
+    pStat->m_comp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS);
+    pStat->m_uncomp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS);
+    pStat->m_internal_attr = MZ_READ_LE16(p + MZ_ZIP_CDH_INTERNAL_ATTR_OFS);
+    pStat->m_external_attr = MZ_READ_LE32(p + MZ_ZIP_CDH_EXTERNAL_ATTR_OFS);
+    pStat->m_local_header_ofs = MZ_READ_LE32(p + MZ_ZIP_CDH_LOCAL_HEADER_OFS);
+
+    /* Copy as much of the filename and comment as possible. */
+    n = MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS);
+    n = MZ_MIN(n, MZ_ZIP_MAX_ARCHIVE_FILENAME_SIZE - 1);
+    memcpy(pStat->m_filename, p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE, n);
+    pStat->m_filename[n] = '\0';
+
+    n = MZ_READ_LE16(p + MZ_ZIP_CDH_COMMENT_LEN_OFS);
+    n = MZ_MIN(n, MZ_ZIP_MAX_ARCHIVE_FILE_COMMENT_SIZE - 1);
+    pStat->m_comment_size = n;
+    memcpy(pStat->m_comment, p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS) + MZ_READ_LE16(p + MZ_ZIP_CDH_EXTRA_LEN_OFS), n);
+    pStat->m_comment[n] = '\0';
+
+    /* Set some flags for convienance */
+    pStat->m_is_directory = mz_zip_reader_is_file_a_directory(pZip, file_index);
+    pStat->m_is_encrypted = mz_zip_reader_is_file_encrypted(pZip, file_index);
+    pStat->m_is_supported = mz_zip_reader_is_file_supported(pZip, file_index);
+
+    /* See if we need to read any zip64 extended information fields. */
+    /* Confusingly, these zip64 fields can be present even on non-zip64 archives (Debian zip on a huge files from stdin piped to stdout creates them). */
+    if (MZ_MAX(MZ_MAX(pStat->m_comp_size, pStat->m_uncomp_size), pStat->m_local_header_ofs) == MZ_UINT32_MAX)
+    {
+        /* Attempt to find zip64 extended information field in the entry's extra data */
+        mz_uint32 extra_size_remaining = MZ_READ_LE16(p + MZ_ZIP_CDH_EXTRA_LEN_OFS);
+
+        if (extra_size_remaining)
+        {
+            const mz_uint8 *pExtra_data = p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS);
+
+            do
+            {
+                mz_uint32 field_id;
+                mz_uint32 field_data_size;
+
+                if (extra_size_remaining < (sizeof(mz_uint16) * 2))
+                    return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+                field_id = MZ_READ_LE16(pExtra_data);
+                field_data_size = MZ_READ_LE16(pExtra_data + sizeof(mz_uint16));
+
+                if ((field_data_size + sizeof(mz_uint16) * 2) > extra_size_remaining)
+                    return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+                if (field_id == MZ_ZIP64_EXTENDED_INFORMATION_FIELD_HEADER_ID)
+                {
+                    const mz_uint8 *pField_data = pExtra_data + sizeof(mz_uint16) * 2;
+                    mz_uint32 field_data_remaining = field_data_size;
+
+                    if (pFound_zip64_extra_data)
+                        *pFound_zip64_extra_data = MZ_TRUE;
+
+                    if (pStat->m_uncomp_size == MZ_UINT32_MAX)
+                    {
+                        if (field_data_remaining < sizeof(mz_uint64))
+                            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+                        pStat->m_uncomp_size = MZ_READ_LE64(pField_data);
+                        pField_data += sizeof(mz_uint64);
+                        field_data_remaining -= sizeof(mz_uint64);
+                    }
+
+                    if (pStat->m_comp_size == MZ_UINT32_MAX)
+                    {
+                        if (field_data_remaining < sizeof(mz_uint64))
+                            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+                        pStat->m_comp_size = MZ_READ_LE64(pField_data);
+                        pField_data += sizeof(mz_uint64);
+                        field_data_remaining -= sizeof(mz_uint64);
+                    }
+
+                    if (pStat->m_local_header_ofs == MZ_UINT32_MAX)
+                    {
+                        if (field_data_remaining < sizeof(mz_uint64))
+                            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+                        pStat->m_local_header_ofs = MZ_READ_LE64(pField_data);
+                        pField_data += sizeof(mz_uint64);
+                        field_data_remaining -= sizeof(mz_uint64);
+                    }
+
+                    break;
+                }
+
+                pExtra_data += sizeof(mz_uint16) * 2 + field_data_size;
+                extra_size_remaining = extra_size_remaining - sizeof(mz_uint16) * 2 - field_data_size;
+            } while (extra_size_remaining);
+        }
+    }
+
+    return MZ_TRUE;
+}
+
+static MZ_FORCEINLINE mz_bool mz_zip_string_equal(const char *pA, const char *pB, mz_uint len, mz_uint flags)
+{
+    mz_uint i;
+    if (flags & MZ_ZIP_FLAG_CASE_SENSITIVE)
+        return 0 == memcmp(pA, pB, len);
+    for (i = 0; i < len; ++i)
+        if (MZ_TOLOWER(pA[i]) != MZ_TOLOWER(pB[i]))
+            return MZ_FALSE;
+    return MZ_TRUE;
+}
+
+static MZ_FORCEINLINE int mz_zip_filename_compare(const mz_zip_array *pCentral_dir_array, const mz_zip_array *pCentral_dir_offsets, mz_uint l_index, const char *pR, mz_uint r_len)
+{
+    const mz_uint8 *pL = &MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_array, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_offsets, mz_uint32, l_index)), *pE;
+    mz_uint l_len = MZ_READ_LE16(pL + MZ_ZIP_CDH_FILENAME_LEN_OFS);
+    mz_uint8 l = 0, r = 0;
+    pL += MZ_ZIP_CENTRAL_DIR_HEADER_SIZE;
+    pE = pL + MZ_MIN(l_len, r_len);
+    while (pL < pE)
+    {
+        if ((l = MZ_TOLOWER(*pL)) != (r = MZ_TOLOWER(*pR)))
+            break;
+        pL++;
+        pR++;
+    }
+    return (pL == pE) ? (int)(l_len - r_len) : (l - r);
+}
+
+static mz_bool mz_zip_locate_file_binary_search(mz_zip_archive *pZip, const char *pFilename, mz_uint32 *pIndex)
+{
+    mz_zip_internal_state *pState = pZip->m_pState;
+    const mz_zip_array *pCentral_dir_offsets = &pState->m_central_dir_offsets;
+    const mz_zip_array *pCentral_dir = &pState->m_central_dir;
+    mz_uint32 *pIndices = &MZ_ZIP_ARRAY_ELEMENT(&pState->m_sorted_central_dir_offsets, mz_uint32, 0);
+    const uint32_t size = pZip->m_total_files;
+    const mz_uint filename_len = (mz_uint)strlen(pFilename);
+
+    if (pIndex)
+        *pIndex = 0;
+
+    if (size)
+    {
+        /* yes I could use uint32_t's, but then we would have to add some special case checks in the loop, argh, and */
+        /* honestly the major expense here on 32-bit CPU's will still be the filename compare */
+        mz_int64 l = 0, h = (mz_int64)size - 1;
+
+        while (l <= h)
+        {
+            mz_int64 m = l + ((h - l) >> 1);
+            uint32_t file_index = pIndices[(uint32_t)m];
+
+            int comp = mz_zip_filename_compare(pCentral_dir, pCentral_dir_offsets, file_index, pFilename, filename_len);
+            if (!comp)
+            {
+                if (pIndex)
+                    *pIndex = file_index;
+                return MZ_TRUE;
+            }
+            else if (comp < 0)
+                l = m + 1;
+            else
+                h = m - 1;
+        }
+    }
+
+    return mz_zip_set_error(pZip, MZ_ZIP_FILE_NOT_FOUND);
+}
+
+int mz_zip_reader_locate_file(mz_zip_archive *pZip, const char *pName, const char *pComment, mz_uint flags)
+{
+    mz_uint32 index;
+    if (!mz_zip_reader_locate_file_v2(pZip, pName, pComment, flags, &index))
+        return -1;
+    else
+        return (int)index;
+}
+
+mz_bool mz_zip_reader_locate_file_v2(mz_zip_archive *pZip, const char *pName, const char *pComment, mz_uint flags, mz_uint32 *pIndex)
+{
+    mz_uint file_index;
+    size_t name_len, comment_len;
+
+    if (pIndex)
+        *pIndex = 0;
+
+    if ((!pZip) || (!pZip->m_pState) || (!pName))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    /* See if we can use a binary search */
+    if (((pZip->m_pState->m_init_flags & MZ_ZIP_FLAG_DO_NOT_SORT_CENTRAL_DIRECTORY) == 0) &&
+        (pZip->m_zip_mode == MZ_ZIP_MODE_READING) &&
+        ((flags & (MZ_ZIP_FLAG_IGNORE_PATH | MZ_ZIP_FLAG_CASE_SENSITIVE)) == 0) && (!pComment) && (pZip->m_pState->m_sorted_central_dir_offsets.m_size))
+    {
+        return mz_zip_locate_file_binary_search(pZip, pName, pIndex);
+    }
+
+    /* Locate the entry by scanning the entire central directory */
+    name_len = strlen(pName);
+    if (name_len > MZ_UINT16_MAX)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    comment_len = pComment ? strlen(pComment) : 0;
+    if (comment_len > MZ_UINT16_MAX)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    for (file_index = 0; file_index < pZip->m_total_files; file_index++)
+    {
+        const mz_uint8 *pHeader = &MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir_offsets, mz_uint32, file_index));
+        mz_uint filename_len = MZ_READ_LE16(pHeader + MZ_ZIP_CDH_FILENAME_LEN_OFS);
+        const char *pFilename = (const char *)pHeader + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE;
+        if (filename_len < name_len)
+            continue;
+        if (comment_len)
+        {
+            mz_uint file_extra_len = MZ_READ_LE16(pHeader + MZ_ZIP_CDH_EXTRA_LEN_OFS), file_comment_len = MZ_READ_LE16(pHeader + MZ_ZIP_CDH_COMMENT_LEN_OFS);
+            const char *pFile_comment = pFilename + filename_len + file_extra_len;
+            if ((file_comment_len != comment_len) || (!mz_zip_string_equal(pComment, pFile_comment, file_comment_len, flags)))
+                continue;
+        }
+        if ((flags & MZ_ZIP_FLAG_IGNORE_PATH) && (filename_len))
+        {
+            int ofs = filename_len - 1;
+            do
+            {
+                if ((pFilename[ofs] == '/') || (pFilename[ofs] == '\\') || (pFilename[ofs] == ':'))
+                    break;
+            } while (--ofs >= 0);
+            ofs++;
+            pFilename += ofs;
+            filename_len -= ofs;
+        }
+        if ((filename_len == name_len) && (mz_zip_string_equal(pName, pFilename, filename_len, flags)))
+        {
+            if (pIndex)
+                *pIndex = file_index;
+            return MZ_TRUE;
+        }
+    }
+
+    return mz_zip_set_error(pZip, MZ_ZIP_FILE_NOT_FOUND);
+}
+
+mz_bool mz_zip_reader_extract_to_mem_no_alloc(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size)
+{
+    int status = TINFL_STATUS_DONE;
+    mz_uint64 needed_size, cur_file_ofs, comp_remaining, out_buf_ofs = 0, read_buf_size, read_buf_ofs = 0, read_buf_avail;
+    mz_zip_archive_file_stat file_stat;
+    void *pRead_buf;
+    mz_uint32 local_header_u32[(MZ_ZIP_LOCAL_DIR_HEADER_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)];
+    mz_uint8 *pLocal_header = (mz_uint8 *)local_header_u32;
+    tinfl_decompressor inflator;
+
+    if ((!pZip) || (!pZip->m_pState) || ((buf_size) && (!pBuf)) || ((user_read_buf_size) && (!pUser_read_buf)) || (!pZip->m_pRead))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (!mz_zip_reader_file_stat(pZip, file_index, &file_stat))
+        return MZ_FALSE;
+
+    /* A directory or zero length file */
+    if ((file_stat.m_is_directory) || (!file_stat.m_comp_size))
+        return MZ_TRUE;
+
+    /* Encryption and patch files are not supported. */
+    if (file_stat.m_bit_flag & (MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_IS_ENCRYPTED | MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_USES_STRONG_ENCRYPTION | MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_COMPRESSED_PATCH_FLAG))
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_ENCRYPTION);
+
+    /* This function only supports decompressing stored and deflate. */
+    if ((!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) && (file_stat.m_method != 0) && (file_stat.m_method != MZ_DEFLATED))
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_METHOD);
+
+    /* Ensure supplied output buffer is large enough. */
+    needed_size = (flags & MZ_ZIP_FLAG_COMPRESSED_DATA) ? file_stat.m_comp_size : file_stat.m_uncomp_size;
+    if (buf_size < needed_size)
+        return mz_zip_set_error(pZip, MZ_ZIP_BUF_TOO_SMALL);
+
+    /* Read and parse the local directory entry. */
+    cur_file_ofs = file_stat.m_local_header_ofs;
+    if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+
+    if (MZ_READ_LE32(pLocal_header) != MZ_ZIP_LOCAL_DIR_HEADER_SIG)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    cur_file_ofs += MZ_ZIP_LOCAL_DIR_HEADER_SIZE + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_FILENAME_LEN_OFS) + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_EXTRA_LEN_OFS);
+    if ((cur_file_ofs + file_stat.m_comp_size) > pZip->m_archive_size)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    if ((flags & MZ_ZIP_FLAG_COMPRESSED_DATA) || (!file_stat.m_method))
+    {
+        /* The file is stored or the caller has requested the compressed data. */
+        if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pBuf, (size_t)needed_size) != needed_size)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+        if ((flags & MZ_ZIP_FLAG_COMPRESSED_DATA) == 0)
+        {
+            if (mz_crc32(MZ_CRC32_INIT, (const mz_uint8 *)pBuf, (size_t)file_stat.m_uncomp_size) != file_stat.m_crc32)
+                return mz_zip_set_error(pZip, MZ_ZIP_CRC_CHECK_FAILED);
+        }
+#endif
+
+        return MZ_TRUE;
+    }
+
+    /* Decompress the file either directly from memory or from a file input buffer. */
+    tinfl_init(&inflator);
+
+    if (pZip->m_pState->m_pMem)
+    {
+        /* Read directly from the archive in memory. */
+        pRead_buf = (mz_uint8 *)pZip->m_pState->m_pMem + cur_file_ofs;
+        read_buf_size = read_buf_avail = file_stat.m_comp_size;
+        comp_remaining = 0;
+    }
+    else if (pUser_read_buf)
+    {
+        /* Use a user provided read buffer. */
+        if (!user_read_buf_size)
+            return MZ_FALSE;
+        pRead_buf = (mz_uint8 *)pUser_read_buf;
+        read_buf_size = user_read_buf_size;
+        read_buf_avail = 0;
+        comp_remaining = file_stat.m_comp_size;
+    }
+    else
+    {
+        /* Temporarily allocate a read buffer. */
+        read_buf_size = MZ_MIN(file_stat.m_comp_size, (mz_uint64)MZ_ZIP_MAX_IO_BUF_SIZE);
+        if (((sizeof(size_t) == sizeof(mz_uint32))) && (read_buf_size > 0x7FFFFFFF))
+            return mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
+
+        if (NULL == (pRead_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, (size_t)read_buf_size)))
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+        read_buf_avail = 0;
+        comp_remaining = file_stat.m_comp_size;
+    }
+
+    do
+    {
+        /* The size_t cast here should be OK because we've verified that the output buffer is >= file_stat.m_uncomp_size above */
+        size_t in_buf_size, out_buf_size = (size_t)(file_stat.m_uncomp_size - out_buf_ofs);
+        if ((!read_buf_avail) && (!pZip->m_pState->m_pMem))
+        {
+            read_buf_avail = MZ_MIN(read_buf_size, comp_remaining);
+            if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pRead_buf, (size_t)read_buf_avail) != read_buf_avail)
+            {
+                status = TINFL_STATUS_FAILED;
+                mz_zip_set_error(pZip, MZ_ZIP_DECOMPRESSION_FAILED);
+                break;
+            }
+            cur_file_ofs += read_buf_avail;
+            comp_remaining -= read_buf_avail;
+            read_buf_ofs = 0;
+        }
+        in_buf_size = (size_t)read_buf_avail;
+        status = tinfl_decompress(&inflator, (mz_uint8 *)pRead_buf + read_buf_ofs, &in_buf_size, (mz_uint8 *)pBuf, (mz_uint8 *)pBuf + out_buf_ofs, &out_buf_size, TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF | (comp_remaining ? TINFL_FLAG_HAS_MORE_INPUT : 0));
+        read_buf_avail -= in_buf_size;
+        read_buf_ofs += in_buf_size;
+        out_buf_ofs += out_buf_size;
+    } while (status == TINFL_STATUS_NEEDS_MORE_INPUT);
+
+    if (status == TINFL_STATUS_DONE)
+    {
+        /* Make sure the entire file was decompressed, and check its CRC. */
+        if (out_buf_ofs != file_stat.m_uncomp_size)
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_UNEXPECTED_DECOMPRESSED_SIZE);
+            status = TINFL_STATUS_FAILED;
+        }
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+        else if (mz_crc32(MZ_CRC32_INIT, (const mz_uint8 *)pBuf, (size_t)file_stat.m_uncomp_size) != file_stat.m_crc32)
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_CRC_CHECK_FAILED);
+            status = TINFL_STATUS_FAILED;
+        }
+#endif
+    }
+
+    if ((!pZip->m_pState->m_pMem) && (!pUser_read_buf))
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf);
+
+    return status == TINFL_STATUS_DONE;
+}
+
+mz_bool mz_zip_reader_extract_file_to_mem_no_alloc(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size)
+{
+    mz_uint32 file_index;
+    if (!mz_zip_reader_locate_file_v2(pZip, pFilename, NULL, flags, &file_index))
+        return MZ_FALSE;
+    return mz_zip_reader_extract_to_mem_no_alloc(pZip, file_index, pBuf, buf_size, flags, pUser_read_buf, user_read_buf_size);
+}
+
+mz_bool mz_zip_reader_extract_to_mem(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags)
+{
+    return mz_zip_reader_extract_to_mem_no_alloc(pZip, file_index, pBuf, buf_size, flags, NULL, 0);
+}
+
+mz_bool mz_zip_reader_extract_file_to_mem(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags)
+{
+    return mz_zip_reader_extract_file_to_mem_no_alloc(pZip, pFilename, pBuf, buf_size, flags, NULL, 0);
+}
+
+void *mz_zip_reader_extract_to_heap(mz_zip_archive *pZip, mz_uint file_index, size_t *pSize, mz_uint flags)
+{
+    mz_uint64 comp_size, uncomp_size, alloc_size;
+    const mz_uint8 *p = mz_zip_get_cdh(pZip, file_index);
+    void *pBuf;
+
+    if (pSize)
+        *pSize = 0;
+
+    if (!p)
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+        return NULL;
+    }
+
+    comp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS);
+    uncomp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS);
+
+    alloc_size = (flags & MZ_ZIP_FLAG_COMPRESSED_DATA) ? comp_size : uncomp_size;
+    if (((sizeof(size_t) == sizeof(mz_uint32))) && (alloc_size > 0x7FFFFFFF))
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
+        return NULL;
+    }
+
+    if (NULL == (pBuf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, (size_t)alloc_size)))
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        return NULL;
+    }
+
+    if (!mz_zip_reader_extract_to_mem(pZip, file_index, pBuf, (size_t)alloc_size, flags))
+    {
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf);
+        return NULL;
+    }
+
+    if (pSize)
+        *pSize = (size_t)alloc_size;
+    return pBuf;
+}
+
+void *mz_zip_reader_extract_file_to_heap(mz_zip_archive *pZip, const char *pFilename, size_t *pSize, mz_uint flags)
+{
+    mz_uint32 file_index;
+    if (!mz_zip_reader_locate_file_v2(pZip, pFilename, NULL, flags, &file_index))
+    {
+        if (pSize)
+            *pSize = 0;
+        return MZ_FALSE;
+    }
+    return mz_zip_reader_extract_to_heap(pZip, file_index, pSize, flags);
+}
+
+mz_bool mz_zip_reader_extract_to_callback(mz_zip_archive *pZip, mz_uint file_index, mz_file_write_func pCallback, void *pOpaque, mz_uint flags)
+{
+    int status = TINFL_STATUS_DONE;
+    mz_uint file_crc32 = MZ_CRC32_INIT;
+    mz_uint64 read_buf_size, read_buf_ofs = 0, read_buf_avail, comp_remaining, out_buf_ofs = 0, cur_file_ofs;
+    mz_zip_archive_file_stat file_stat;
+    void *pRead_buf = NULL;
+    void *pWrite_buf = NULL;
+    mz_uint32 local_header_u32[(MZ_ZIP_LOCAL_DIR_HEADER_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)];
+    mz_uint8 *pLocal_header = (mz_uint8 *)local_header_u32;
+
+    if ((!pZip) || (!pZip->m_pState) || (!pCallback) || (!pZip->m_pRead))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (!mz_zip_reader_file_stat(pZip, file_index, &file_stat))
+        return MZ_FALSE;
+
+    /* A directory or zero length file */
+    if ((file_stat.m_is_directory) || (!file_stat.m_comp_size))
+        return MZ_TRUE;
+
+    /* Encryption and patch files are not supported. */
+    if (file_stat.m_bit_flag & (MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_IS_ENCRYPTED | MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_USES_STRONG_ENCRYPTION | MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_COMPRESSED_PATCH_FLAG))
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_ENCRYPTION);
+
+    /* This function only supports decompressing stored and deflate. */
+    if ((!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) && (file_stat.m_method != 0) && (file_stat.m_method != MZ_DEFLATED))
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_METHOD);
+
+    /* Read and do some minimal validation of the local directory entry (this doesn't crack the zip64 stuff, which we already have from the central dir) */
+    cur_file_ofs = file_stat.m_local_header_ofs;
+    if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+
+    if (MZ_READ_LE32(pLocal_header) != MZ_ZIP_LOCAL_DIR_HEADER_SIG)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    cur_file_ofs += MZ_ZIP_LOCAL_DIR_HEADER_SIZE + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_FILENAME_LEN_OFS) + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_EXTRA_LEN_OFS);
+    if ((cur_file_ofs + file_stat.m_comp_size) > pZip->m_archive_size)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    /* Decompress the file either directly from memory or from a file input buffer. */
+    if (pZip->m_pState->m_pMem)
+    {
+        pRead_buf = (mz_uint8 *)pZip->m_pState->m_pMem + cur_file_ofs;
+        read_buf_size = read_buf_avail = file_stat.m_comp_size;
+        comp_remaining = 0;
+    }
+    else
+    {
+        read_buf_size = MZ_MIN(file_stat.m_comp_size, (mz_uint64)MZ_ZIP_MAX_IO_BUF_SIZE);
+        if (NULL == (pRead_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, (size_t)read_buf_size)))
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+        read_buf_avail = 0;
+        comp_remaining = file_stat.m_comp_size;
+    }
+
+    if ((flags & MZ_ZIP_FLAG_COMPRESSED_DATA) || (!file_stat.m_method))
+    {
+        /* The file is stored or the caller has requested the compressed data. */
+        if (pZip->m_pState->m_pMem)
+        {
+            if (((sizeof(size_t) == sizeof(mz_uint32))) && (file_stat.m_comp_size > MZ_UINT32_MAX))
+                return mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
+
+            if (pCallback(pOpaque, out_buf_ofs, pRead_buf, (size_t)file_stat.m_comp_size) != file_stat.m_comp_size)
+            {
+                mz_zip_set_error(pZip, MZ_ZIP_WRITE_CALLBACK_FAILED);
+                status = TINFL_STATUS_FAILED;
+            }
+            else if (!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA))
+            {
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+                file_crc32 = (mz_uint32)mz_crc32(file_crc32, (const mz_uint8 *)pRead_buf, (size_t)file_stat.m_comp_size);
+#endif
+            }
+
+            cur_file_ofs += file_stat.m_comp_size;
+            out_buf_ofs += file_stat.m_comp_size;
+            comp_remaining = 0;
+        }
+        else
+        {
+            while (comp_remaining)
+            {
+                read_buf_avail = MZ_MIN(read_buf_size, comp_remaining);
+                if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pRead_buf, (size_t)read_buf_avail) != read_buf_avail)
+                {
+                    mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+                    status = TINFL_STATUS_FAILED;
+                    break;
+                }
+
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+                if (!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA))
+                {
+                    file_crc32 = (mz_uint32)mz_crc32(file_crc32, (const mz_uint8 *)pRead_buf, (size_t)read_buf_avail);
+                }
+#endif
+
+                if (pCallback(pOpaque, out_buf_ofs, pRead_buf, (size_t)read_buf_avail) != read_buf_avail)
+                {
+                    mz_zip_set_error(pZip, MZ_ZIP_WRITE_CALLBACK_FAILED);
+                    status = TINFL_STATUS_FAILED;
+                    break;
+                }
+
+                cur_file_ofs += read_buf_avail;
+                out_buf_ofs += read_buf_avail;
+                comp_remaining -= read_buf_avail;
+            }
+        }
+    }
+    else
+    {
+        tinfl_decompressor inflator;
+        tinfl_init(&inflator);
+
+        if (NULL == (pWrite_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, TINFL_LZ_DICT_SIZE)))
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+            status = TINFL_STATUS_FAILED;
+        }
+        else
+        {
+            do
+            {
+                mz_uint8 *pWrite_buf_cur = (mz_uint8 *)pWrite_buf + (out_buf_ofs & (TINFL_LZ_DICT_SIZE - 1));
+                size_t in_buf_size, out_buf_size = TINFL_LZ_DICT_SIZE - (out_buf_ofs & (TINFL_LZ_DICT_SIZE - 1));
+                if ((!read_buf_avail) && (!pZip->m_pState->m_pMem))
+                {
+                    read_buf_avail = MZ_MIN(read_buf_size, comp_remaining);
+                    if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pRead_buf, (size_t)read_buf_avail) != read_buf_avail)
+                    {
+                        mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+                        status = TINFL_STATUS_FAILED;
+                        break;
+                    }
+                    cur_file_ofs += read_buf_avail;
+                    comp_remaining -= read_buf_avail;
+                    read_buf_ofs = 0;
+                }
+
+                in_buf_size = (size_t)read_buf_avail;
+                status = tinfl_decompress(&inflator, (const mz_uint8 *)pRead_buf + read_buf_ofs, &in_buf_size, (mz_uint8 *)pWrite_buf, pWrite_buf_cur, &out_buf_size, comp_remaining ? TINFL_FLAG_HAS_MORE_INPUT : 0);
+                read_buf_avail -= in_buf_size;
+                read_buf_ofs += in_buf_size;
+
+                if (out_buf_size)
+                {
+                    if (pCallback(pOpaque, out_buf_ofs, pWrite_buf_cur, out_buf_size) != out_buf_size)
+                    {
+                        mz_zip_set_error(pZip, MZ_ZIP_WRITE_CALLBACK_FAILED);
+                        status = TINFL_STATUS_FAILED;
+                        break;
+                    }
+
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+                    file_crc32 = (mz_uint32)mz_crc32(file_crc32, pWrite_buf_cur, out_buf_size);
+#endif
+                    if ((out_buf_ofs += out_buf_size) > file_stat.m_uncomp_size)
+                    {
+                        mz_zip_set_error(pZip, MZ_ZIP_DECOMPRESSION_FAILED);
+                        status = TINFL_STATUS_FAILED;
+                        break;
+                    }
+                }
+            } while ((status == TINFL_STATUS_NEEDS_MORE_INPUT) || (status == TINFL_STATUS_HAS_MORE_OUTPUT));
+        }
+    }
+
+    if ((status == TINFL_STATUS_DONE) && (!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA)))
+    {
+        /* Make sure the entire file was decompressed, and check its CRC. */
+        if (out_buf_ofs != file_stat.m_uncomp_size)
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_UNEXPECTED_DECOMPRESSED_SIZE);
+            status = TINFL_STATUS_FAILED;
+        }
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+        else if (file_crc32 != file_stat.m_crc32)
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_DECOMPRESSION_FAILED);
+            status = TINFL_STATUS_FAILED;
+        }
+#endif
+    }
+
+    if (!pZip->m_pState->m_pMem)
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf);
+
+    if (pWrite_buf)
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pWrite_buf);
+
+    return status == TINFL_STATUS_DONE;
+}
+
+mz_bool mz_zip_reader_extract_file_to_callback(mz_zip_archive *pZip, const char *pFilename, mz_file_write_func pCallback, void *pOpaque, mz_uint flags)
+{
+    mz_uint32 file_index;
+    if (!mz_zip_reader_locate_file_v2(pZip, pFilename, NULL, flags, &file_index))
+        return MZ_FALSE;
+
+    return mz_zip_reader_extract_to_callback(pZip, file_index, pCallback, pOpaque, flags);
+}
+
+mz_zip_reader_extract_iter_state* mz_zip_reader_extract_iter_new(mz_zip_archive *pZip, mz_uint file_index, mz_uint flags)
+{
+    mz_zip_reader_extract_iter_state *pState;
+    mz_uint32 local_header_u32[(MZ_ZIP_LOCAL_DIR_HEADER_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)];
+    mz_uint8 *pLocal_header = (mz_uint8 *)local_header_u32;
+
+    /* Argument sanity check */
+    if ((!pZip) || (!pZip->m_pState))
+        return NULL;
+
+    /* Allocate an iterator status structure */
+    pState = (mz_zip_reader_extract_iter_state*)pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, sizeof(mz_zip_reader_extract_iter_state));
+    if (!pState)
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        return NULL;
+    }
+
+    /* Fetch file details */
+    if (!mz_zip_reader_file_stat(pZip, file_index, &pState->file_stat))
+    {
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+        return NULL;
+    }
+
+    /* Encryption and patch files are not supported. */
+    if (pState->file_stat.m_bit_flag & (MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_IS_ENCRYPTED | MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_USES_STRONG_ENCRYPTION | MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_COMPRESSED_PATCH_FLAG))
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_ENCRYPTION);
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+        return NULL;
+    }
+
+    /* This function only supports decompressing stored and deflate. */
+    if ((!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) && (pState->file_stat.m_method != 0) && (pState->file_stat.m_method != MZ_DEFLATED))
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_METHOD);
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+        return NULL;
+    }
+
+    /* Init state - save args */
+    pState->pZip = pZip;
+    pState->flags = flags;
+
+    /* Init state - reset variables to defaults */
+    pState->status = TINFL_STATUS_DONE;
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+    pState->file_crc32 = MZ_CRC32_INIT;
+#endif
+    pState->read_buf_ofs = 0;
+    pState->out_buf_ofs = 0;
+    pState->pRead_buf = NULL;
+    pState->pWrite_buf = NULL;
+    pState->out_blk_remain = 0;
+
+    /* Read and parse the local directory entry. */
+    pState->cur_file_ofs = pState->file_stat.m_local_header_ofs;
+    if (pZip->m_pRead(pZip->m_pIO_opaque, pState->cur_file_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE)
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+        return NULL;
+    }
+
+    if (MZ_READ_LE32(pLocal_header) != MZ_ZIP_LOCAL_DIR_HEADER_SIG)
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+        return NULL;
+    }
+
+    pState->cur_file_ofs += MZ_ZIP_LOCAL_DIR_HEADER_SIZE + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_FILENAME_LEN_OFS) + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_EXTRA_LEN_OFS);
+    if ((pState->cur_file_ofs + pState->file_stat.m_comp_size) > pZip->m_archive_size)
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+        return NULL;
+    }
+
+    /* Decompress the file either directly from memory or from a file input buffer. */
+    if (pZip->m_pState->m_pMem)
+    {
+        pState->pRead_buf = (mz_uint8 *)pZip->m_pState->m_pMem + pState->cur_file_ofs;
+        pState->read_buf_size = pState->read_buf_avail = pState->file_stat.m_comp_size;
+        pState->comp_remaining = pState->file_stat.m_comp_size;
+    }
+    else
+    {
+        if (!((flags & MZ_ZIP_FLAG_COMPRESSED_DATA) || (!pState->file_stat.m_method)))
+        {
+            /* Decompression required, therefore intermediate read buffer required */
+            pState->read_buf_size = MZ_MIN(pState->file_stat.m_comp_size, int(MZ_ZIP_MAX_IO_BUF_SIZE));
+            if (NULL == (pState->pRead_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, (size_t)pState->read_buf_size)))
+            {
+                mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+                pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+                return NULL;
+            }
+        }
+        else
+        {
+            /* Decompression not required - we will be reading directly into user buffer, no temp buf required */
+            pState->read_buf_size = 0;
+        }
+        pState->read_buf_avail = 0;
+        pState->comp_remaining = pState->file_stat.m_comp_size;
+    }
+
+    if (!((flags & MZ_ZIP_FLAG_COMPRESSED_DATA) || (!pState->file_stat.m_method)))
+    {
+        /* Decompression required, init decompressor */
+        tinfl_init( &pState->inflator );
+
+        /* Allocate write buffer */
+        if (NULL == (pState->pWrite_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, TINFL_LZ_DICT_SIZE)))
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+            if (pState->pRead_buf)
+                pZip->m_pFree(pZip->m_pAlloc_opaque, pState->pRead_buf);
+            pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+            return NULL;
+        }
+    }
+
+    return pState;
+}
+
+mz_zip_reader_extract_iter_state* mz_zip_reader_extract_file_iter_new(mz_zip_archive *pZip, const char *pFilename, mz_uint flags)
+{
+    mz_uint32 file_index;
+
+    /* Locate file index by name */
+    if (!mz_zip_reader_locate_file_v2(pZip, pFilename, NULL, flags, &file_index))
+        return NULL;
+
+    /* Construct iterator */
+    return mz_zip_reader_extract_iter_new(pZip, file_index, flags);
+}
+
+size_t mz_zip_reader_extract_iter_read(mz_zip_reader_extract_iter_state* pState, void* pvBuf, size_t buf_size)
+{
+    size_t copied_to_caller = 0;
+
+    /* Argument sanity check */
+    if ((!pState) || (!pState->pZip) || (!pState->pZip->m_pState) || (!pvBuf))
+        return 0;
+
+    if ((pState->flags & MZ_ZIP_FLAG_COMPRESSED_DATA) || (!pState->file_stat.m_method))
+    {
+        /* The file is stored or the caller has requested the compressed data, calc amount to return. */
+        copied_to_caller = MZ_MIN( buf_size, pState->comp_remaining );
+
+        /* Zip is in memory....or requires reading from a file? */
+        if (pState->pZip->m_pState->m_pMem)
+        {
+            /* Copy data to caller's buffer */
+            memcpy( pvBuf, pState->pRead_buf, copied_to_caller );
+            pState->pRead_buf = ((mz_uint8*)pState->pRead_buf) + copied_to_caller;
+        }
+        else
+        {
+            /* Read directly into caller's buffer */
+            if (pState->pZip->m_pRead(pState->pZip->m_pIO_opaque, pState->cur_file_ofs, pvBuf, copied_to_caller) != copied_to_caller)
+            {
+                /* Failed to read all that was asked for, flag failure and alert user */
+                mz_zip_set_error(pState->pZip, MZ_ZIP_FILE_READ_FAILED);
+                pState->status = TINFL_STATUS_FAILED;
+                copied_to_caller = 0;
+            }
+        }
+
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+        /* Compute CRC if not returning compressed data only */
+        if (!(pState->flags & MZ_ZIP_FLAG_COMPRESSED_DATA))
+            pState->file_crc32 = (mz_uint32)mz_crc32(pState->file_crc32, (const mz_uint8 *)pvBuf, copied_to_caller);
+#endif
+
+        /* Advance offsets, dec counters */
+        pState->cur_file_ofs += copied_to_caller;
+        pState->out_buf_ofs += copied_to_caller;
+        pState->comp_remaining -= copied_to_caller;
+    }
+    else
+    {
+        do
+        {
+            /* Calc ptr to write buffer - given current output pos and block size */
+            mz_uint8 *pWrite_buf_cur = (mz_uint8 *)pState->pWrite_buf + (pState->out_buf_ofs & (TINFL_LZ_DICT_SIZE - 1));
+
+            /* Calc max output size - given current output pos and block size */
+            size_t in_buf_size, out_buf_size = TINFL_LZ_DICT_SIZE - (pState->out_buf_ofs & (TINFL_LZ_DICT_SIZE - 1));
+
+            if (!pState->out_blk_remain)
+            {
+                /* Read more data from file if none available (and reading from file) */
+                if ((!pState->read_buf_avail) && (!pState->pZip->m_pState->m_pMem))
+                {
+                    /* Calc read size */
+                    pState->read_buf_avail = MZ_MIN(pState->read_buf_size, pState->comp_remaining);
+                    if (pState->pZip->m_pRead(pState->pZip->m_pIO_opaque, pState->cur_file_ofs, pState->pRead_buf, (size_t)pState->read_buf_avail) != pState->read_buf_avail)
+                    {
+                        mz_zip_set_error(pState->pZip, MZ_ZIP_FILE_READ_FAILED);
+                        pState->status = TINFL_STATUS_FAILED;
+                        break;
+                    }
+
+                    /* Advance offsets, dec counters */
+                    pState->cur_file_ofs += pState->read_buf_avail;
+                    pState->comp_remaining -= pState->read_buf_avail;
+                    pState->read_buf_ofs = 0;
+                }
+
+                /* Perform decompression */
+                in_buf_size = (size_t)pState->read_buf_avail;
+                pState->status = tinfl_decompress(&pState->inflator, (const mz_uint8 *)pState->pRead_buf + pState->read_buf_ofs, &in_buf_size, (mz_uint8 *)pState->pWrite_buf, pWrite_buf_cur, &out_buf_size, pState->comp_remaining ? TINFL_FLAG_HAS_MORE_INPUT : 0);
+                pState->read_buf_avail -= in_buf_size;
+                pState->read_buf_ofs += in_buf_size;
+
+                /* Update current output block size remaining */
+                pState->out_blk_remain = out_buf_size;
+            }
+
+            if (pState->out_blk_remain)
+            {
+                /* Calc amount to return. */
+                size_t to_copy = MZ_MIN( (buf_size - copied_to_caller), pState->out_blk_remain );
+
+                /* Copy data to caller's buffer */
+                memcpy( (uint8_t*)pvBuf + copied_to_caller, pWrite_buf_cur, to_copy );
+
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+                /* Perform CRC */
+                pState->file_crc32 = (mz_uint32)mz_crc32(pState->file_crc32, pWrite_buf_cur, to_copy);
+#endif
+
+                /* Decrement data consumed from block */
+                pState->out_blk_remain -= to_copy;
+
+                /* Inc output offset, while performing sanity check */
+                if ((pState->out_buf_ofs += to_copy) > pState->file_stat.m_uncomp_size)
+                {
+                    mz_zip_set_error(pState->pZip, MZ_ZIP_DECOMPRESSION_FAILED);
+                    pState->status = TINFL_STATUS_FAILED;
+                    break;
+                }
+
+                /* Increment counter of data copied to caller */
+                copied_to_caller += to_copy;
+            }
+        } while ( (copied_to_caller < buf_size) && ((pState->status == TINFL_STATUS_NEEDS_MORE_INPUT) || (pState->status == TINFL_STATUS_HAS_MORE_OUTPUT)) );
+    }
+
+    /* Return how many bytes were copied into user buffer */
+    return copied_to_caller;
+}
+
+mz_bool mz_zip_reader_extract_iter_free(mz_zip_reader_extract_iter_state* pState)
+{
+    int status;
+
+    /* Argument sanity check */
+    if ((!pState) || (!pState->pZip) || (!pState->pZip->m_pState))
+        return MZ_FALSE;
+
+    /* Was decompression completed and requested? */
+    if ((pState->status == TINFL_STATUS_DONE) && (!(pState->flags & MZ_ZIP_FLAG_COMPRESSED_DATA)))
+    {
+        /* Make sure the entire file was decompressed, and check its CRC. */
+        if (pState->out_buf_ofs != pState->file_stat.m_uncomp_size)
+        {
+            mz_zip_set_error(pState->pZip, MZ_ZIP_UNEXPECTED_DECOMPRESSED_SIZE);
+            pState->status = TINFL_STATUS_FAILED;
+        }
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+        else if (pState->file_crc32 != pState->file_stat.m_crc32)
+        {
+            mz_zip_set_error(pState->pZip, MZ_ZIP_DECOMPRESSION_FAILED);
+            pState->status = TINFL_STATUS_FAILED;
+        }
+#endif
+    }
+
+    /* Free buffers */
+    if (!pState->pZip->m_pState->m_pMem)
+        pState->pZip->m_pFree(pState->pZip->m_pAlloc_opaque, pState->pRead_buf);
+    if (pState->pWrite_buf)
+        pState->pZip->m_pFree(pState->pZip->m_pAlloc_opaque, pState->pWrite_buf);
+
+    /* Save status */
+    status = pState->status;
+
+    /* Free context */
+    pState->pZip->m_pFree(pState->pZip->m_pAlloc_opaque, pState);
+
+    return status == TINFL_STATUS_DONE;
+}
+
+#ifndef MINIZ_NO_STDIO
+static size_t mz_zip_file_write_callback(void *pOpaque, mz_uint64 ofs, const void *pBuf, size_t n)
+{
+    (void)ofs;
+
+    return MZ_FWRITE(pBuf, 1, n, (MZ_FILE *)pOpaque);
+}
+
+mz_bool mz_zip_reader_extract_to_file(mz_zip_archive *pZip, mz_uint file_index, const char *pDst_filename, mz_uint flags)
+{
+    mz_bool status;
+    mz_zip_archive_file_stat file_stat;
+    MZ_FILE *pFile;
+
+    if (!mz_zip_reader_file_stat(pZip, file_index, &file_stat))
+        return MZ_FALSE;
+
+    if ((file_stat.m_is_directory) || (!file_stat.m_is_supported))
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_FEATURE);
+
+    pFile = MZ_FOPEN(pDst_filename, "wb");
+    if (!pFile)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_OPEN_FAILED);
+
+    status = mz_zip_reader_extract_to_callback(pZip, file_index, mz_zip_file_write_callback, pFile, flags);
+
+    if (MZ_FCLOSE(pFile) == EOF)
+    {
+        if (status)
+            mz_zip_set_error(pZip, MZ_ZIP_FILE_CLOSE_FAILED);
+
+        status = MZ_FALSE;
+    }
+
+#if !defined(MINIZ_NO_TIME) && !defined(MINIZ_NO_STDIO)
+    if (status)
+        mz_zip_set_file_times(pDst_filename, file_stat.m_time, file_stat.m_time);
+#endif
+
+    return status;
+}
+
+mz_bool mz_zip_reader_extract_file_to_file(mz_zip_archive *pZip, const char *pArchive_filename, const char *pDst_filename, mz_uint flags)
+{
+    mz_uint32 file_index;
+    if (!mz_zip_reader_locate_file_v2(pZip, pArchive_filename, NULL, flags, &file_index))
+        return MZ_FALSE;
+
+    return mz_zip_reader_extract_to_file(pZip, file_index, pDst_filename, flags);
+}
+
+mz_bool mz_zip_reader_extract_to_cfile(mz_zip_archive *pZip, mz_uint file_index, MZ_FILE *pFile, mz_uint flags)
+{
+    mz_zip_archive_file_stat file_stat;
+
+    if (!mz_zip_reader_file_stat(pZip, file_index, &file_stat))
+        return MZ_FALSE;
+
+    if ((file_stat.m_is_directory) || (!file_stat.m_is_supported))
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_FEATURE);
+
+    return mz_zip_reader_extract_to_callback(pZip, file_index, mz_zip_file_write_callback, pFile, flags);
+}
+
+mz_bool mz_zip_reader_extract_file_to_cfile(mz_zip_archive *pZip, const char *pArchive_filename, MZ_FILE *pFile, mz_uint flags)
+{
+    mz_uint32 file_index;
+    if (!mz_zip_reader_locate_file_v2(pZip, pArchive_filename, NULL, flags, &file_index))
+        return MZ_FALSE;
+
+    return mz_zip_reader_extract_to_cfile(pZip, file_index, pFile, flags);
+}
+#endif /* #ifndef MINIZ_NO_STDIO */
+
+static size_t mz_zip_compute_crc32_callback(void *pOpaque, mz_uint64 file_ofs, const void *pBuf, size_t n)
+{
+    mz_uint32 *p = (mz_uint32 *)pOpaque;
+    (void)file_ofs;
+    *p = (mz_uint32)mz_crc32(*p, (const mz_uint8 *)pBuf, n);
+    return n;
+}
+
+mz_bool mz_zip_validate_file(mz_zip_archive *pZip, mz_uint file_index, mz_uint flags)
+{
+    mz_zip_archive_file_stat file_stat;
+    mz_zip_internal_state *pState;
+    const mz_uint8 *pCentral_dir_header;
+    mz_bool found_zip64_ext_data_in_cdir = MZ_FALSE;
+    mz_bool found_zip64_ext_data_in_ldir = MZ_FALSE;
+    mz_uint32 local_header_u32[(MZ_ZIP_LOCAL_DIR_HEADER_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)];
+    mz_uint8 *pLocal_header = (mz_uint8 *)local_header_u32;
+    mz_uint64 local_header_ofs = 0;
+    mz_uint32 local_header_filename_len, local_header_extra_len, local_header_crc32;
+    mz_uint64 local_header_comp_size, local_header_uncomp_size;
+    mz_uint32 uncomp_crc32 = MZ_CRC32_INIT;
+    mz_bool has_data_descriptor;
+    mz_uint32 local_header_bit_flags;
+
+    mz_zip_array file_data_array;
+    mz_zip_array_init(&file_data_array, 1);
+
+    if ((!pZip) || (!pZip->m_pState) || (!pZip->m_pAlloc) || (!pZip->m_pFree) || (!pZip->m_pRead))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (file_index > pZip->m_total_files)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    pState = pZip->m_pState;
+
+    pCentral_dir_header = mz_zip_get_cdh(pZip, file_index);
+
+    if (!mz_zip_file_stat_internal(pZip, file_index, pCentral_dir_header, &file_stat, &found_zip64_ext_data_in_cdir))
+        return MZ_FALSE;
+
+    /* A directory or zero length file */
+    if ((file_stat.m_is_directory) || (!file_stat.m_uncomp_size))
+        return MZ_TRUE;
+
+    /* Encryption and patch files are not supported. */
+    if (file_stat.m_is_encrypted)
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_ENCRYPTION);
+
+    /* This function only supports stored and deflate. */
+    if ((file_stat.m_method != 0) && (file_stat.m_method != MZ_DEFLATED))
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_METHOD);
+
+    if (!file_stat.m_is_supported)
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_FEATURE);
+
+    /* Read and parse the local directory entry. */
+    local_header_ofs = file_stat.m_local_header_ofs;
+    if (pZip->m_pRead(pZip->m_pIO_opaque, local_header_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+
+    if (MZ_READ_LE32(pLocal_header) != MZ_ZIP_LOCAL_DIR_HEADER_SIG)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    local_header_filename_len = MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_FILENAME_LEN_OFS);
+    local_header_extra_len = MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_EXTRA_LEN_OFS);
+    local_header_comp_size = MZ_READ_LE32(pLocal_header + MZ_ZIP_LDH_COMPRESSED_SIZE_OFS);
+    local_header_uncomp_size = MZ_READ_LE32(pLocal_header + MZ_ZIP_LDH_DECOMPRESSED_SIZE_OFS);
+    local_header_crc32 = MZ_READ_LE32(pLocal_header + MZ_ZIP_LDH_CRC32_OFS);
+    local_header_bit_flags = MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_BIT_FLAG_OFS);
+    has_data_descriptor = (local_header_bit_flags & 8) != 0;
+
+    if (local_header_filename_len != strlen(file_stat.m_filename))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    if ((local_header_ofs + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + local_header_filename_len + local_header_extra_len + file_stat.m_comp_size) > pZip->m_archive_size)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    if (!mz_zip_array_resize(pZip, &file_data_array, MZ_MAX(local_header_filename_len, local_header_extra_len), MZ_FALSE))
+        return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+    if (local_header_filename_len)
+    {
+        if (pZip->m_pRead(pZip->m_pIO_opaque, local_header_ofs + MZ_ZIP_LOCAL_DIR_HEADER_SIZE, file_data_array.m_p, local_header_filename_len) != local_header_filename_len)
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+            goto handle_failure;
+        }
+
+        /* I've seen 1 archive that had the same pathname, but used backslashes in the local dir and forward slashes in the central dir. Do we care about this? For now, this case will fail validation. */
+        if (memcmp(file_stat.m_filename, file_data_array.m_p, local_header_filename_len) != 0)
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_VALIDATION_FAILED);
+            goto handle_failure;
+        }
+    }
+
+    if ((local_header_extra_len) && ((local_header_comp_size == MZ_UINT32_MAX) || (local_header_uncomp_size == MZ_UINT32_MAX)))
+    {
+        mz_uint32 extra_size_remaining = local_header_extra_len;
+        const mz_uint8 *pExtra_data = (const mz_uint8 *)file_data_array.m_p;
+
+        if (pZip->m_pRead(pZip->m_pIO_opaque, local_header_ofs + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + local_header_filename_len, file_data_array.m_p, local_header_extra_len) != local_header_extra_len)
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+            goto handle_failure;
+        }
+
+        do
+        {
+            mz_uint32 field_id, field_data_size, field_total_size;
+
+            if (extra_size_remaining < (sizeof(mz_uint16) * 2))
+                return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+            field_id = MZ_READ_LE16(pExtra_data);
+            field_data_size = MZ_READ_LE16(pExtra_data + sizeof(mz_uint16));
+            field_total_size = field_data_size + sizeof(mz_uint16) * 2;
+
+            if (field_total_size > extra_size_remaining)
+                return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+            if (field_id == MZ_ZIP64_EXTENDED_INFORMATION_FIELD_HEADER_ID)
+            {
+                const mz_uint8 *pSrc_field_data = pExtra_data + sizeof(mz_uint32);
+
+                if (field_data_size < sizeof(mz_uint64) * 2)
+                {
+                    mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+                    goto handle_failure;
+                }
+
+                local_header_uncomp_size = MZ_READ_LE64(pSrc_field_data);
+                local_header_comp_size = MZ_READ_LE64(pSrc_field_data + sizeof(mz_uint64));
+
+                found_zip64_ext_data_in_ldir = MZ_TRUE;
+                break;
+            }
+
+            pExtra_data += field_total_size;
+            extra_size_remaining -= field_total_size;
+        } while (extra_size_remaining);
+    }
+
+    /* TODO: parse local header extra data when local_header_comp_size is 0xFFFFFFFF! (big_descriptor.zip) */
+    /* I've seen zips in the wild with the data descriptor bit set, but proper local header values and bogus data descriptors */
+    if ((has_data_descriptor) && (!local_header_comp_size) && (!local_header_crc32))
+    {
+        mz_uint8 descriptor_buf[32];
+        mz_bool has_id;
+        const mz_uint8 *pSrc;
+        mz_uint32 file_crc32;
+        mz_uint64 comp_size = 0, uncomp_size = 0;
+
+        mz_uint32 num_descriptor_uint32s = ((pState->m_zip64) || (found_zip64_ext_data_in_ldir)) ? 6 : 4;
+
+        if (pZip->m_pRead(pZip->m_pIO_opaque, local_header_ofs + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + local_header_filename_len + local_header_extra_len + file_stat.m_comp_size, descriptor_buf, sizeof(mz_uint32) * num_descriptor_uint32s) != (sizeof(mz_uint32) * num_descriptor_uint32s))
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+            goto handle_failure;
+        }
+
+        has_id = (MZ_READ_LE32(descriptor_buf) == MZ_ZIP_DATA_DESCRIPTOR_ID);
+        pSrc = has_id ? (descriptor_buf + sizeof(mz_uint32)) : descriptor_buf;
+
+        file_crc32 = MZ_READ_LE32(pSrc);
+
+        if ((pState->m_zip64) || (found_zip64_ext_data_in_ldir))
+        {
+            comp_size = MZ_READ_LE64(pSrc + sizeof(mz_uint32));
+            uncomp_size = MZ_READ_LE64(pSrc + sizeof(mz_uint32) + sizeof(mz_uint64));
+        }
+        else
+        {
+            comp_size = MZ_READ_LE32(pSrc + sizeof(mz_uint32));
+            uncomp_size = MZ_READ_LE32(pSrc + sizeof(mz_uint32) + sizeof(mz_uint32));
+        }
+
+        if ((file_crc32 != file_stat.m_crc32) || (comp_size != file_stat.m_comp_size) || (uncomp_size != file_stat.m_uncomp_size))
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_VALIDATION_FAILED);
+            goto handle_failure;
+        }
+    }
+    else
+    {
+        if ((local_header_crc32 != file_stat.m_crc32) || (local_header_comp_size != file_stat.m_comp_size) || (local_header_uncomp_size != file_stat.m_uncomp_size))
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_VALIDATION_FAILED);
+            goto handle_failure;
+        }
+    }
+
+    mz_zip_array_clear(pZip, &file_data_array);
+
+    if ((flags & MZ_ZIP_FLAG_VALIDATE_HEADERS_ONLY) == 0)
+    {
+        if (!mz_zip_reader_extract_to_callback(pZip, file_index, mz_zip_compute_crc32_callback, &uncomp_crc32, 0))
+            return MZ_FALSE;
+
+        /* 1 more check to be sure, although the extract checks too. */
+        if (uncomp_crc32 != file_stat.m_crc32)
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_VALIDATION_FAILED);
+            return MZ_FALSE;
+        }
+    }
+
+    return MZ_TRUE;
+
+handle_failure:
+    mz_zip_array_clear(pZip, &file_data_array);
+    return MZ_FALSE;
+}
+
+mz_bool mz_zip_validate_archive(mz_zip_archive *pZip, mz_uint flags)
+{
+    mz_zip_internal_state *pState;
+    uint32_t i;
+
+    if ((!pZip) || (!pZip->m_pState) || (!pZip->m_pAlloc) || (!pZip->m_pFree) || (!pZip->m_pRead))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    pState = pZip->m_pState;
+
+    /* Basic sanity checks */
+    if (!pState->m_zip64)
+    {
+        if (pZip->m_total_files > MZ_UINT16_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+
+        if (pZip->m_archive_size > MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+    }
+    else
+    {
+        if (pZip->m_total_files >= MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+
+        if (pState->m_central_dir.m_size >= MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+    }
+
+    for (i = 0; i < pZip->m_total_files; i++)
+    {
+        if (MZ_ZIP_FLAG_VALIDATE_LOCATE_FILE_FLAG & flags)
+        {
+            mz_uint32 found_index;
+            mz_zip_archive_file_stat stat;
+
+            if (!mz_zip_reader_file_stat(pZip, i, &stat))
+                return MZ_FALSE;
+
+            if (!mz_zip_reader_locate_file_v2(pZip, stat.m_filename, NULL, 0, &found_index))
+                return MZ_FALSE;
+
+            /* This check can fail if there are duplicate filenames in the archive (which we don't check for when writing - that's up to the user) */
+            if (found_index != i)
+                return mz_zip_set_error(pZip, MZ_ZIP_VALIDATION_FAILED);
+        }
+
+        if (!mz_zip_validate_file(pZip, i, flags))
+            return MZ_FALSE;
+    }
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_validate_mem_archive(const void *pMem, size_t size, mz_uint flags, mz_zip_error *pErr)
+{
+    mz_bool success = MZ_TRUE;
+    mz_zip_archive zip;
+    mz_zip_error actual_err = MZ_ZIP_NO_ERROR;
+
+    if ((!pMem) || (!size))
+    {
+        if (pErr)
+            *pErr = MZ_ZIP_INVALID_PARAMETER;
+        return MZ_FALSE;
+    }
+
+    mz_zip_zero_struct(&zip);
+
+    if (!mz_zip_reader_init_mem(&zip, pMem, size, flags))
+    {
+        if (pErr)
+            *pErr = zip.m_last_error;
+        return MZ_FALSE;
+    }
+
+    if (!mz_zip_validate_archive(&zip, flags))
+    {
+        actual_err = zip.m_last_error;
+        success = MZ_FALSE;
+    }
+
+    if (!mz_zip_reader_end_internal(&zip, success))
+    {
+        if (!actual_err)
+            actual_err = zip.m_last_error;
+        success = MZ_FALSE;
+    }
+
+    if (pErr)
+        *pErr = actual_err;
+
+    return success;
+}
+
+#ifndef MINIZ_NO_STDIO
+mz_bool mz_zip_validate_file_archive(const char *pFilename, mz_uint flags, mz_zip_error *pErr)
+{
+    mz_bool success = MZ_TRUE;
+    mz_zip_archive zip;
+    mz_zip_error actual_err = MZ_ZIP_NO_ERROR;
+
+    if (!pFilename)
+    {
+        if (pErr)
+            *pErr = MZ_ZIP_INVALID_PARAMETER;
+        return MZ_FALSE;
+    }
+
+    mz_zip_zero_struct(&zip);
+
+    if (!mz_zip_reader_init_file_v2(&zip, pFilename, flags, 0, 0))
+    {
+        if (pErr)
+            *pErr = zip.m_last_error;
+        return MZ_FALSE;
+    }
+
+    if (!mz_zip_validate_archive(&zip, flags))
+    {
+        actual_err = zip.m_last_error;
+        success = MZ_FALSE;
+    }
+
+    if (!mz_zip_reader_end_internal(&zip, success))
+    {
+        if (!actual_err)
+            actual_err = zip.m_last_error;
+        success = MZ_FALSE;
+    }
+
+    if (pErr)
+        *pErr = actual_err;
+
+    return success;
+}
+#endif /* #ifndef MINIZ_NO_STDIO */
+
+/* ------------------- .ZIP archive writing */
+
+#ifndef MINIZ_NO_ARCHIVE_WRITING_APIS
+
+static MZ_FORCEINLINE void mz_write_le16(mz_uint8 *p, mz_uint16 v)
+{
+    p[0] = (mz_uint8)v;
+    p[1] = (mz_uint8)(v >> 8);
+}
+static MZ_FORCEINLINE void mz_write_le32(mz_uint8 *p, mz_uint32 v)
+{
+    p[0] = (mz_uint8)v;
+    p[1] = (mz_uint8)(v >> 8);
+    p[2] = (mz_uint8)(v >> 16);
+    p[3] = (mz_uint8)(v >> 24);
+}
+static MZ_FORCEINLINE void mz_write_le64(mz_uint8 *p, mz_uint64 v)
+{
+    mz_write_le32(p, (mz_uint32)v);
+    mz_write_le32(p + sizeof(mz_uint32), (mz_uint32)(v >> 32));
+}
+
+#define MZ_WRITE_LE16(p, v) mz_write_le16((mz_uint8 *)(p), (mz_uint16)(v))
+#define MZ_WRITE_LE32(p, v) mz_write_le32((mz_uint8 *)(p), (mz_uint32)(v))
+#define MZ_WRITE_LE64(p, v) mz_write_le64((mz_uint8 *)(p), (mz_uint64)(v))
+
+static size_t mz_zip_heap_write_func(void *pOpaque, mz_uint64 file_ofs, const void *pBuf, size_t n)
+{
+    mz_zip_archive *pZip = (mz_zip_archive *)pOpaque;
+    mz_zip_internal_state *pState = pZip->m_pState;
+    mz_uint64 new_size = MZ_MAX(file_ofs + n, pState->m_mem_size);
+
+    if (!n)
+        return 0;
+
+    /* An allocation this big is likely to just fail on 32-bit systems, so don't even go there. */
+    if ((sizeof(size_t) == sizeof(mz_uint32)) && (new_size > 0x7FFFFFFF))
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_FILE_TOO_LARGE);
+        return 0;
+    }
+
+    if (new_size > pState->m_mem_capacity)
+    {
+        void *pNew_block;
+        size_t new_capacity = MZ_MAX(64, pState->m_mem_capacity);
+
+        while (new_capacity < new_size)
+            new_capacity *= 2;
+
+        if (NULL == (pNew_block = pZip->m_pRealloc(pZip->m_pAlloc_opaque, pState->m_pMem, 1, new_capacity)))
+        {
+            mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+            return 0;
+        }
+
+        pState->m_pMem = pNew_block;
+        pState->m_mem_capacity = new_capacity;
+    }
+    memcpy((mz_uint8 *)pState->m_pMem + file_ofs, pBuf, n);
+    pState->m_mem_size = (size_t)new_size;
+    return n;
+}
+
+static mz_bool mz_zip_writer_end_internal(mz_zip_archive *pZip, mz_bool set_last_error)
+{
+    mz_zip_internal_state *pState;
+    mz_bool status = MZ_TRUE;
+
+    if ((!pZip) || (!pZip->m_pState) || (!pZip->m_pAlloc) || (!pZip->m_pFree) || ((pZip->m_zip_mode != MZ_ZIP_MODE_WRITING) && (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING_HAS_BEEN_FINALIZED)))
+    {
+        if (set_last_error)
+            mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+        return MZ_FALSE;
+    }
+
+    pState = pZip->m_pState;
+    pZip->m_pState = NULL;
+    mz_zip_array_clear(pZip, &pState->m_central_dir);
+    mz_zip_array_clear(pZip, &pState->m_central_dir_offsets);
+    mz_zip_array_clear(pZip, &pState->m_sorted_central_dir_offsets);
+
+#ifndef MINIZ_NO_STDIO
+    if (pState->m_pFile)
+    {
+        if (pZip->m_zip_type == MZ_ZIP_TYPE_FILE)
+        {
+            if (MZ_FCLOSE(pState->m_pFile) == EOF)
+            {
+                if (set_last_error)
+                    mz_zip_set_error(pZip, MZ_ZIP_FILE_CLOSE_FAILED);
+                status = MZ_FALSE;
+            }
+        }
+
+        pState->m_pFile = NULL;
+    }
+#endif /* #ifndef MINIZ_NO_STDIO */
+
+    if ((pZip->m_pWrite == mz_zip_heap_write_func) && (pState->m_pMem))
+    {
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pState->m_pMem);
+        pState->m_pMem = NULL;
+    }
+
+    pZip->m_pFree(pZip->m_pAlloc_opaque, pState);
+    pZip->m_zip_mode = MZ_ZIP_MODE_INVALID;
+    return status;
+}
+
+mz_bool mz_zip_writer_init_v2(mz_zip_archive *pZip, mz_uint64 existing_size, mz_uint flags)
+{
+    mz_bool zip64 = (flags & MZ_ZIP_FLAG_WRITE_ZIP64) != 0;
+
+    if ((!pZip) || (pZip->m_pState) || (!pZip->m_pWrite) || (pZip->m_zip_mode != MZ_ZIP_MODE_INVALID))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (flags & MZ_ZIP_FLAG_WRITE_ALLOW_READING)
+    {
+        if (!pZip->m_pRead)
+            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+    }
+
+    if (pZip->m_file_offset_alignment)
+    {
+        /* Ensure user specified file offset alignment is a power of 2. */
+        if (pZip->m_file_offset_alignment & (pZip->m_file_offset_alignment - 1))
+            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+    }
+
+    if (!pZip->m_pAlloc)
+        pZip->m_pAlloc = miniz_def_alloc_func;
+    if (!pZip->m_pFree)
+        pZip->m_pFree = miniz_def_free_func;
+    if (!pZip->m_pRealloc)
+        pZip->m_pRealloc = miniz_def_realloc_func;
+
+    pZip->m_archive_size = existing_size;
+    pZip->m_central_directory_file_ofs = 0;
+    pZip->m_total_files = 0;
+
+    if (NULL == (pZip->m_pState = (mz_zip_internal_state *)pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, sizeof(mz_zip_internal_state))))
+        return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+    memset(pZip->m_pState, 0, sizeof(mz_zip_internal_state));
+
+    MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_central_dir, sizeof(mz_uint8));
+    MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_central_dir_offsets, sizeof(mz_uint32));
+    MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_sorted_central_dir_offsets, sizeof(mz_uint32));
+
+    pZip->m_pState->m_zip64 = zip64;
+    pZip->m_pState->m_zip64_has_extended_info_fields = zip64;
+
+    pZip->m_zip_type = MZ_ZIP_TYPE_USER;
+    pZip->m_zip_mode = MZ_ZIP_MODE_WRITING;
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_writer_init(mz_zip_archive *pZip, mz_uint64 existing_size)
+{
+    return mz_zip_writer_init_v2(pZip, existing_size, 0);
+}
+
+mz_bool mz_zip_writer_init_heap_v2(mz_zip_archive *pZip, size_t size_to_reserve_at_beginning, size_t initial_allocation_size, mz_uint flags)
+{
+    pZip->m_pWrite = mz_zip_heap_write_func;
+    pZip->m_pNeeds_keepalive = NULL;
+
+    if (flags & MZ_ZIP_FLAG_WRITE_ALLOW_READING)
+        pZip->m_pRead = mz_zip_mem_read_func;
+
+    pZip->m_pIO_opaque = pZip;
+
+    if (!mz_zip_writer_init_v2(pZip, size_to_reserve_at_beginning, flags))
+        return MZ_FALSE;
+
+    pZip->m_zip_type = MZ_ZIP_TYPE_HEAP;
+
+    if (0 != (initial_allocation_size = MZ_MAX(initial_allocation_size, size_to_reserve_at_beginning)))
+    {
+        if (NULL == (pZip->m_pState->m_pMem = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, initial_allocation_size)))
+        {
+            mz_zip_writer_end_internal(pZip, MZ_FALSE);
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        }
+        pZip->m_pState->m_mem_capacity = initial_allocation_size;
+    }
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_writer_init_heap(mz_zip_archive *pZip, size_t size_to_reserve_at_beginning, size_t initial_allocation_size)
+{
+    return mz_zip_writer_init_heap_v2(pZip, size_to_reserve_at_beginning, initial_allocation_size, 0);
+}
+
+#ifndef MINIZ_NO_STDIO
+static size_t mz_zip_file_write_func(void *pOpaque, mz_uint64 file_ofs, const void *pBuf, size_t n)
+{
+    mz_zip_archive *pZip = (mz_zip_archive *)pOpaque;
+    mz_int64 cur_ofs = MZ_FTELL64(pZip->m_pState->m_pFile);
+
+    file_ofs += pZip->m_pState->m_file_archive_start_ofs;
+
+    if (((mz_int64)file_ofs < 0) || (((cur_ofs != (mz_int64)file_ofs)) && (MZ_FSEEK64(pZip->m_pState->m_pFile, (mz_int64)file_ofs, SEEK_SET))))
+    {
+        mz_zip_set_error(pZip, MZ_ZIP_FILE_SEEK_FAILED);
+        return 0;
+    }
+
+    return MZ_FWRITE(pBuf, 1, n, pZip->m_pState->m_pFile);
+}
+
+mz_bool mz_zip_writer_init_file(mz_zip_archive *pZip, const char *pFilename, mz_uint64 size_to_reserve_at_beginning)
+{
+    return mz_zip_writer_init_file_v2(pZip, pFilename, size_to_reserve_at_beginning, 0);
+}
+
+mz_bool mz_zip_writer_init_file_v2(mz_zip_archive *pZip, const char *pFilename, mz_uint64 size_to_reserve_at_beginning, mz_uint flags)
+{
+    MZ_FILE *pFile;
+
+    pZip->m_pWrite = mz_zip_file_write_func;
+    pZip->m_pNeeds_keepalive = NULL;
+
+    if (flags & MZ_ZIP_FLAG_WRITE_ALLOW_READING)
+        pZip->m_pRead = mz_zip_file_read_func;
+
+    pZip->m_pIO_opaque = pZip;
+
+    if (!mz_zip_writer_init_v2(pZip, size_to_reserve_at_beginning, flags))
+        return MZ_FALSE;
+
+    if (NULL == (pFile = MZ_FOPEN(pFilename, (flags & MZ_ZIP_FLAG_WRITE_ALLOW_READING) ? "w+b" : "wb")))
+    {
+        mz_zip_writer_end(pZip);
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_OPEN_FAILED);
+    }
+
+    pZip->m_pState->m_pFile = pFile;
+    pZip->m_zip_type = MZ_ZIP_TYPE_FILE;
+
+    if (size_to_reserve_at_beginning)
+    {
+        mz_uint64 cur_ofs = 0;
+        char buf[4096];
+
+        MZ_CLEAR_OBJ(buf);
+
+        do
+        {
+            size_t n = (size_t)MZ_MIN(sizeof(buf), size_to_reserve_at_beginning);
+            if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_ofs, buf, n) != n)
+            {
+                mz_zip_writer_end(pZip);
+                return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+            }
+            cur_ofs += n;
+            size_to_reserve_at_beginning -= n;
+        } while (size_to_reserve_at_beginning);
+    }
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_writer_init_cfile(mz_zip_archive *pZip, MZ_FILE *pFile, mz_uint flags)
+{
+    pZip->m_pWrite = mz_zip_file_write_func;
+    pZip->m_pNeeds_keepalive = NULL;
+
+    if (flags & MZ_ZIP_FLAG_WRITE_ALLOW_READING)
+        pZip->m_pRead = mz_zip_file_read_func;
+
+    pZip->m_pIO_opaque = pZip;
+
+    if (!mz_zip_writer_init_v2(pZip, 0, flags))
+        return MZ_FALSE;
+
+    pZip->m_pState->m_pFile = pFile;
+    pZip->m_pState->m_file_archive_start_ofs = MZ_FTELL64(pZip->m_pState->m_pFile);
+    pZip->m_zip_type = MZ_ZIP_TYPE_CFILE;
+
+    return MZ_TRUE;
+}
+#endif /* #ifndef MINIZ_NO_STDIO */
+
+mz_bool mz_zip_writer_init_from_reader_v2(mz_zip_archive *pZip, const char *pFilename, mz_uint flags)
+{
+    mz_zip_internal_state *pState;
+
+    if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_READING))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (flags & MZ_ZIP_FLAG_WRITE_ZIP64)
+    {
+        /* We don't support converting a non-zip64 file to zip64 - this seems like more trouble than it's worth. (What about the existing 32-bit data descriptors that could follow the compressed data?) */
+        if (!pZip->m_pState->m_zip64)
+            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+    }
+
+    /* No sense in trying to write to an archive that's already at the support max size */
+    if (pZip->m_pState->m_zip64)
+    {
+        if (pZip->m_total_files == MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+    }
+    else
+    {
+        if (pZip->m_total_files == MZ_UINT16_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+
+        if ((pZip->m_archive_size + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + MZ_ZIP_LOCAL_DIR_HEADER_SIZE) > MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_TOO_LARGE);
+    }
+
+    pState = pZip->m_pState;
+
+    if (pState->m_pFile)
+    {
+#ifdef MINIZ_NO_STDIO
+        (void)pFilename;
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+#else
+        if (pZip->m_pIO_opaque != pZip)
+            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+        if (pZip->m_zip_type == MZ_ZIP_TYPE_FILE)
+        {
+            if (!pFilename)
+                return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+            /* Archive is being read from stdio and was originally opened only for reading. Try to reopen as writable. */
+            if (NULL == (pState->m_pFile = MZ_FREOPEN(pFilename, "r+b", pState->m_pFile)))
+            {
+                /* The mz_zip_archive is now in a bogus state because pState->m_pFile is NULL, so just close it. */
+                mz_zip_reader_end_internal(pZip, MZ_FALSE);
+                return mz_zip_set_error(pZip, MZ_ZIP_FILE_OPEN_FAILED);
+            }
+        }
+
+        pZip->m_pWrite = mz_zip_file_write_func;
+        pZip->m_pNeeds_keepalive = NULL;
+#endif /* #ifdef MINIZ_NO_STDIO */
+    }
+    else if (pState->m_pMem)
+    {
+        /* Archive lives in a memory block. Assume it's from the heap that we can resize using the realloc callback. */
+        if (pZip->m_pIO_opaque != pZip)
+            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+        pState->m_mem_capacity = pState->m_mem_size;
+        pZip->m_pWrite = mz_zip_heap_write_func;
+        pZip->m_pNeeds_keepalive = NULL;
+    }
+    /* Archive is being read via a user provided read function - make sure the user has specified a write function too. */
+    else if (!pZip->m_pWrite)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    /* Start writing new files at the archive's current central directory location. */
+    /* TODO: We could add a flag that lets the user start writing immediately AFTER the existing central dir - this would be safer. */
+    pZip->m_archive_size = pZip->m_central_directory_file_ofs;
+    pZip->m_central_directory_file_ofs = 0;
+
+    /* Clear the sorted central dir offsets, they aren't useful or maintained now. */
+    /* Even though we're now in write mode, files can still be extracted and verified, but file locates will be slow. */
+    /* TODO: We could easily maintain the sorted central directory offsets. */
+    mz_zip_array_clear(pZip, &pZip->m_pState->m_sorted_central_dir_offsets);
+
+    pZip->m_zip_mode = MZ_ZIP_MODE_WRITING;
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_writer_init_from_reader(mz_zip_archive *pZip, const char *pFilename)
+{
+    return mz_zip_writer_init_from_reader_v2(pZip, pFilename, 0);
+}
+
+/* TODO: pArchive_name is a terrible name here! */
+mz_bool mz_zip_writer_add_mem(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, mz_uint level_and_flags)
+{
+    return mz_zip_writer_add_mem_ex(pZip, pArchive_name, pBuf, buf_size, NULL, 0, level_and_flags, 0, 0);
+}
+
+typedef struct
+{
+    mz_zip_archive *m_pZip;
+    mz_uint64 m_cur_archive_file_ofs;
+    mz_uint64 m_comp_size;
+} mz_zip_writer_add_state;
+
+static mz_bool mz_zip_writer_add_put_buf_callback(const void *pBuf, int len, void *pUser)
+{
+    mz_zip_writer_add_state *pState = (mz_zip_writer_add_state *)pUser;
+    if ((int)pState->m_pZip->m_pWrite(pState->m_pZip->m_pIO_opaque, pState->m_cur_archive_file_ofs, pBuf, len) != len)
+        return MZ_FALSE;
+
+    pState->m_cur_archive_file_ofs += len;
+    pState->m_comp_size += len;
+    return MZ_TRUE;
+}
+
+#define MZ_ZIP64_MAX_LOCAL_EXTRA_FIELD_SIZE (sizeof(mz_uint16) * 2 + sizeof(mz_uint64) * 2)
+#define MZ_ZIP64_MAX_CENTRAL_EXTRA_FIELD_SIZE (sizeof(mz_uint16) * 2 + sizeof(mz_uint64) * 3)
+static mz_uint32 mz_zip_writer_create_zip64_extra_data(mz_uint8 *pBuf, mz_uint64 *pUncomp_size, mz_uint64 *pComp_size, mz_uint64 *pLocal_header_ofs)
+{
+    mz_uint8 *pDst = pBuf;
+    mz_uint32 field_size = 0;
+
+    MZ_WRITE_LE16(pDst + 0, MZ_ZIP64_EXTENDED_INFORMATION_FIELD_HEADER_ID);
+    MZ_WRITE_LE16(pDst + 2, 0);
+    pDst += sizeof(mz_uint16) * 2;
+
+    if (pUncomp_size)
+    {
+        MZ_WRITE_LE64(pDst, *pUncomp_size);
+        pDst += sizeof(mz_uint64);
+        field_size += sizeof(mz_uint64);
+    }
+
+    if (pComp_size)
+    {
+        MZ_WRITE_LE64(pDst, *pComp_size);
+        pDst += sizeof(mz_uint64);
+        field_size += sizeof(mz_uint64);
+    }
+
+    if (pLocal_header_ofs)
+    {
+        MZ_WRITE_LE64(pDst, *pLocal_header_ofs);
+        pDst += sizeof(mz_uint64);
+        field_size += sizeof(mz_uint64);
+    }
+
+    MZ_WRITE_LE16(pBuf + 2, field_size);
+
+    return (mz_uint32)(pDst - pBuf);
+}
+
+static mz_bool mz_zip_writer_create_local_dir_header(mz_zip_archive *pZip, mz_uint8 *pDst, mz_uint16 filename_size, mz_uint16 extra_size, mz_uint64 uncomp_size, mz_uint64 comp_size, mz_uint32 uncomp_crc32, mz_uint16 method, mz_uint16 bit_flags, mz_uint16 dos_time, mz_uint16 dos_date)
+{
+    (void)pZip;
+    memset(pDst, 0, MZ_ZIP_LOCAL_DIR_HEADER_SIZE);
+    MZ_WRITE_LE32(pDst + MZ_ZIP_LDH_SIG_OFS, MZ_ZIP_LOCAL_DIR_HEADER_SIG);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_VERSION_NEEDED_OFS, method ? 20 : 0);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_BIT_FLAG_OFS, bit_flags);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_METHOD_OFS, method);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_FILE_TIME_OFS, dos_time);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_FILE_DATE_OFS, dos_date);
+    MZ_WRITE_LE32(pDst + MZ_ZIP_LDH_CRC32_OFS, uncomp_crc32);
+    MZ_WRITE_LE32(pDst + MZ_ZIP_LDH_COMPRESSED_SIZE_OFS, MZ_MIN(comp_size, MZ_UINT32_MAX));
+    MZ_WRITE_LE32(pDst + MZ_ZIP_LDH_DECOMPRESSED_SIZE_OFS, MZ_MIN(uncomp_size, MZ_UINT32_MAX));
+    MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_FILENAME_LEN_OFS, filename_size);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_EXTRA_LEN_OFS, extra_size);
+    return MZ_TRUE;
+}
+
+static mz_bool mz_zip_writer_create_central_dir_header(mz_zip_archive *pZip, mz_uint8 *pDst,
+                                                       mz_uint16 filename_size, mz_uint16 extra_size, mz_uint16 comment_size,
+                                                       mz_uint64 uncomp_size, mz_uint64 comp_size, mz_uint32 uncomp_crc32,
+                                                       mz_uint16 method, mz_uint16 bit_flags, mz_uint16 dos_time, mz_uint16 dos_date,
+                                                       mz_uint64 local_header_ofs, mz_uint32 ext_attributes)
+{
+    (void)pZip;
+    memset(pDst, 0, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE);
+    MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_SIG_OFS, MZ_ZIP_CENTRAL_DIR_HEADER_SIG);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_VERSION_NEEDED_OFS, method ? 20 : 0);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_BIT_FLAG_OFS, bit_flags);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_METHOD_OFS, method);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_FILE_TIME_OFS, dos_time);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_FILE_DATE_OFS, dos_date);
+    MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_CRC32_OFS, uncomp_crc32);
+    MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS, MZ_MIN(comp_size, MZ_UINT32_MAX));
+    MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS, MZ_MIN(uncomp_size, MZ_UINT32_MAX));
+    MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_FILENAME_LEN_OFS, filename_size);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_EXTRA_LEN_OFS, extra_size);
+    MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_COMMENT_LEN_OFS, comment_size);
+    MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_EXTERNAL_ATTR_OFS, ext_attributes);
+    MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_LOCAL_HEADER_OFS, MZ_MIN(local_header_ofs, MZ_UINT32_MAX));
+    return MZ_TRUE;
+}
+
+static mz_bool mz_zip_writer_add_to_central_dir(mz_zip_archive *pZip, const char *pFilename, mz_uint16 filename_size,
+                                                const void *pExtra, mz_uint16 extra_size, const void *pComment, mz_uint16 comment_size,
+                                                mz_uint64 uncomp_size, mz_uint64 comp_size, mz_uint32 uncomp_crc32,
+                                                mz_uint16 method, mz_uint16 bit_flags, mz_uint16 dos_time, mz_uint16 dos_date,
+                                                mz_uint64 local_header_ofs, mz_uint32 ext_attributes,
+                                                const char *user_extra_data, mz_uint user_extra_data_len)
+{
+    mz_zip_internal_state *pState = pZip->m_pState;
+    mz_uint32 central_dir_ofs = (mz_uint32)pState->m_central_dir.m_size;
+    size_t orig_central_dir_size = pState->m_central_dir.m_size;
+    mz_uint8 central_dir_header[MZ_ZIP_CENTRAL_DIR_HEADER_SIZE];
+
+    if (!pZip->m_pState->m_zip64)
+    {
+        if (local_header_ofs > 0xFFFFFFFF)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_TOO_LARGE);
+    }
+
+    /* miniz doesn't support central dirs >= MZ_UINT32_MAX bytes yet */
+    if (((mz_uint64)pState->m_central_dir.m_size + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + filename_size + extra_size + user_extra_data_len + comment_size) >= MZ_UINT32_MAX)
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_CDIR_SIZE);
+
+    if (!mz_zip_writer_create_central_dir_header(pZip, central_dir_header, filename_size, extra_size + user_extra_data_len, comment_size, uncomp_size, comp_size, uncomp_crc32, method, bit_flags, dos_time, dos_date, local_header_ofs, ext_attributes))
+        return mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
+
+    if ((!mz_zip_array_push_back(pZip, &pState->m_central_dir, central_dir_header, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE)) ||
+        (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pFilename, filename_size)) ||
+        (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pExtra, extra_size)) ||
+        (!mz_zip_array_push_back(pZip, &pState->m_central_dir, user_extra_data, user_extra_data_len)) ||
+        (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pComment, comment_size)) ||
+        (!mz_zip_array_push_back(pZip, &pState->m_central_dir_offsets, &central_dir_ofs, 1)))
+    {
+        /* Try to resize the central directory array back into its original state. */
+        mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE);
+        return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+    }
+
+    return MZ_TRUE;
+}
+
+static mz_bool mz_zip_writer_validate_archive_name(const char *pArchive_name)
+{
+    /* Basic ZIP archive filename validity checks: Valid filenames cannot start with a forward slash, cannot contain a drive letter, and cannot use DOS-style backward slashes. */
+    if (*pArchive_name == '/')
+        return MZ_FALSE;
+
+    while (*pArchive_name)
+    {
+        if ((*pArchive_name == '\\') || (*pArchive_name == ':'))
+            return MZ_FALSE;
+
+        pArchive_name++;
+    }
+
+    return MZ_TRUE;
+}
+
+static mz_uint mz_zip_writer_compute_padding_needed_for_file_alignment(mz_zip_archive *pZip)
+{
+    mz_uint32 n;
+    if (!pZip->m_file_offset_alignment)
+        return 0;
+    n = (mz_uint32)(pZip->m_archive_size & (pZip->m_file_offset_alignment - 1));
+    return (mz_uint)((pZip->m_file_offset_alignment - n) & (pZip->m_file_offset_alignment - 1));
+}
+
+static mz_bool mz_zip_writer_write_zeros(mz_zip_archive *pZip, mz_uint64 cur_file_ofs, mz_uint32 n)
+{
+    char buf[4096];
+    memset(buf, 0, MZ_MIN(sizeof(buf), n));
+    while (n)
+    {
+        mz_uint32 s = MZ_MIN(sizeof(buf), n);
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_file_ofs, buf, s) != s)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        cur_file_ofs += s;
+        n -= s;
+    }
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_writer_add_mem_ex(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags,
+                                 mz_uint64 uncomp_size, mz_uint32 uncomp_crc32)
+{
+    return mz_zip_writer_add_mem_ex_v2(pZip, pArchive_name, pBuf, buf_size, pComment, comment_size, level_and_flags, uncomp_size, uncomp_crc32, NULL, NULL, 0, NULL, 0);
+}
+
+mz_bool mz_zip_writer_add_mem_ex_v2(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size,
+                                    mz_uint level_and_flags, mz_uint64 uncomp_size, mz_uint32 uncomp_crc32, MZ_TIME_T *last_modified,
+                                    const char *user_extra_data, mz_uint user_extra_data_len, const char *user_extra_data_central, mz_uint user_extra_data_central_len)
+{
+    mz_uint16 method = 0, dos_time = 0, dos_date = 0;
+    mz_uint level, ext_attributes = 0, num_alignment_padding_bytes;
+    mz_uint64 local_dir_header_ofs = pZip->m_archive_size, cur_archive_file_ofs = pZip->m_archive_size, comp_size = 0;
+    size_t archive_name_size;
+    mz_uint8 local_dir_header[MZ_ZIP_LOCAL_DIR_HEADER_SIZE];
+    tdefl_compressor *pComp = NULL;
+    mz_bool store_data_uncompressed;
+    mz_zip_internal_state *pState;
+    mz_uint8 *pExtra_data = NULL;
+    mz_uint32 extra_size = 0;
+    mz_uint8 extra_data[MZ_ZIP64_MAX_CENTRAL_EXTRA_FIELD_SIZE];
+    mz_uint16 bit_flags = 0;
+
+    if ((int)level_and_flags < 0)
+        level_and_flags = MZ_DEFAULT_LEVEL;
+
+    if (uncomp_size || (buf_size && !(level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA)))
+        bit_flags |= MZ_ZIP_LDH_BIT_FLAG_HAS_LOCATOR;
+
+    if (!(level_and_flags & MZ_ZIP_FLAG_ASCII_FILENAME))
+        bit_flags |= MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_UTF8;
+
+    level = level_and_flags & 0xF;
+    store_data_uncompressed = ((!level) || (level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA));
+
+    if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING) || ((buf_size) && (!pBuf)) || (!pArchive_name) || ((comment_size) && (!pComment)) || (level > MZ_UBER_COMPRESSION))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    pState = pZip->m_pState;
+
+    if (pState->m_zip64)
+    {
+        if (pZip->m_total_files == MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+    }
+    else
+    {
+        if (pZip->m_total_files == MZ_UINT16_MAX)
+        {
+            pState->m_zip64 = MZ_TRUE;
+            /*return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES); */
+        }
+        if ((buf_size > 0xFFFFFFFF) || (uncomp_size > 0xFFFFFFFF))
+        {
+            pState->m_zip64 = MZ_TRUE;
+            /*return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE); */
+        }
+    }
+
+    if ((!(level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) && (uncomp_size))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (!mz_zip_writer_validate_archive_name(pArchive_name))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_FILENAME);
+
+#ifndef MINIZ_NO_TIME
+    if (last_modified != NULL)
+    {
+        mz_zip_time_t_to_dos_time(*last_modified, &dos_time, &dos_date);
+    }
+    else
+    {
+        MZ_TIME_T cur_time;
+        time(&cur_time);
+        mz_zip_time_t_to_dos_time(cur_time, &dos_time, &dos_date);
+    }
+#endif /* #ifndef MINIZ_NO_TIME */
+
+	if (!(level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA))
+	{
+		uncomp_crc32 = (mz_uint32)mz_crc32(MZ_CRC32_INIT, (const mz_uint8 *)pBuf, buf_size);
+		uncomp_size = buf_size;
+		if (uncomp_size <= 3)
+		{
+			level = 0;
+			store_data_uncompressed = MZ_TRUE;
+		}
+	}
+
+    archive_name_size = strlen(pArchive_name);
+    if (archive_name_size > MZ_UINT16_MAX)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_FILENAME);
+
+    num_alignment_padding_bytes = mz_zip_writer_compute_padding_needed_for_file_alignment(pZip);
+
+    /* miniz doesn't support central dirs >= MZ_UINT32_MAX bytes yet */
+    if (((mz_uint64)pState->m_central_dir.m_size + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + archive_name_size + MZ_ZIP64_MAX_CENTRAL_EXTRA_FIELD_SIZE + comment_size) >= MZ_UINT32_MAX)
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_CDIR_SIZE);
+
+    if (!pState->m_zip64)
+    {
+        /* Bail early if the archive would obviously become too large */
+        if ((pZip->m_archive_size + num_alignment_padding_bytes + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + archive_name_size
+			+ MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + archive_name_size + comment_size + user_extra_data_len +
+			pState->m_central_dir.m_size + MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE + user_extra_data_central_len
+			+ MZ_ZIP_DATA_DESCRIPTER_SIZE32) > 0xFFFFFFFF)
+        {
+            pState->m_zip64 = MZ_TRUE;
+            /*return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE); */
+        }
+    }
+
+    if ((archive_name_size) && (pArchive_name[archive_name_size - 1] == '/'))
+    {
+        /* Set DOS Subdirectory attribute bit. */
+        ext_attributes |= MZ_ZIP_DOS_DIR_ATTRIBUTE_BITFLAG;
+
+        /* Subdirectories cannot contain data. */
+        if ((buf_size) || (uncomp_size))
+            return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+    }
+
+    /* Try to do any allocations before writing to the archive, so if an allocation fails the file remains unmodified. (A good idea if we're doing an in-place modification.) */
+    if ((!mz_zip_array_ensure_room(pZip, &pState->m_central_dir, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + archive_name_size + comment_size + (pState->m_zip64 ? MZ_ZIP64_MAX_CENTRAL_EXTRA_FIELD_SIZE : 0))) || (!mz_zip_array_ensure_room(pZip, &pState->m_central_dir_offsets, 1)))
+        return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+    if ((!store_data_uncompressed) && (buf_size))
+    {
+        if (NULL == (pComp = (tdefl_compressor *)pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, sizeof(tdefl_compressor))))
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+    }
+
+    if (!mz_zip_writer_write_zeros(pZip, cur_archive_file_ofs, num_alignment_padding_bytes))
+    {
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pComp);
+        return MZ_FALSE;
+    }
+
+    local_dir_header_ofs += num_alignment_padding_bytes;
+    if (pZip->m_file_offset_alignment)
+    {
+        MZ_ASSERT((local_dir_header_ofs & (pZip->m_file_offset_alignment - 1)) == 0);
+    }
+    cur_archive_file_ofs += num_alignment_padding_bytes;
+
+    MZ_CLEAR_OBJ(local_dir_header);
+
+    if (!store_data_uncompressed || (level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA))
+    {
+        method = MZ_DEFLATED;
+    }
+
+    if (pState->m_zip64)
+    {
+        if (uncomp_size >= MZ_UINT32_MAX || local_dir_header_ofs >= MZ_UINT32_MAX)
+        {
+            pExtra_data = extra_data;
+            extra_size = mz_zip_writer_create_zip64_extra_data(extra_data, (uncomp_size >= MZ_UINT32_MAX) ? &uncomp_size : NULL,
+                                                               (uncomp_size >= MZ_UINT32_MAX) ? &comp_size : NULL, (local_dir_header_ofs >= MZ_UINT32_MAX) ? &local_dir_header_ofs : NULL);
+        }
+
+        if (!mz_zip_writer_create_local_dir_header(pZip, local_dir_header, (mz_uint16)archive_name_size, extra_size + user_extra_data_len, 0, 0, 0, method, bit_flags, dos_time, dos_date))
+            return mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, local_dir_header_ofs, local_dir_header, sizeof(local_dir_header)) != sizeof(local_dir_header))
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        cur_archive_file_ofs += sizeof(local_dir_header);
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pArchive_name, archive_name_size) != archive_name_size)
+        {
+            pZip->m_pFree(pZip->m_pAlloc_opaque, pComp);
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+        }
+        cur_archive_file_ofs += archive_name_size;
+
+        if (pExtra_data != NULL)
+        {
+            if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, extra_data, extra_size) != extra_size)
+                return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+            cur_archive_file_ofs += extra_size;
+        }
+    }
+    else
+    {
+        if ((comp_size > MZ_UINT32_MAX) || (cur_archive_file_ofs > MZ_UINT32_MAX))
+            return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+        if (!mz_zip_writer_create_local_dir_header(pZip, local_dir_header, (mz_uint16)archive_name_size, user_extra_data_len, 0, 0, 0, method, bit_flags, dos_time, dos_date))
+            return mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, local_dir_header_ofs, local_dir_header, sizeof(local_dir_header)) != sizeof(local_dir_header))
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        cur_archive_file_ofs += sizeof(local_dir_header);
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pArchive_name, archive_name_size) != archive_name_size)
+        {
+            pZip->m_pFree(pZip->m_pAlloc_opaque, pComp);
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+        }
+        cur_archive_file_ofs += archive_name_size;
+    }
+
+	if (user_extra_data_len > 0)
+	{
+		if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, user_extra_data, user_extra_data_len) != user_extra_data_len)
+			return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+		cur_archive_file_ofs += user_extra_data_len;
+	}
+
+    if (store_data_uncompressed)
+    {
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pBuf, buf_size) != buf_size)
+        {
+            pZip->m_pFree(pZip->m_pAlloc_opaque, pComp);
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+        }
+
+        cur_archive_file_ofs += buf_size;
+        comp_size = buf_size;
+    }
+    else if (buf_size)
+    {
+        mz_zip_writer_add_state state;
+
+        state.m_pZip = pZip;
+        state.m_cur_archive_file_ofs = cur_archive_file_ofs;
+        state.m_comp_size = 0;
+
+        if ((tdefl_init(pComp, mz_zip_writer_add_put_buf_callback, &state, tdefl_create_comp_flags_from_zip_params(level, -15, MZ_DEFAULT_STRATEGY)) != TDEFL_STATUS_OKAY) ||
+            (tdefl_compress_buffer(pComp, pBuf, buf_size, TDEFL_FINISH) != TDEFL_STATUS_DONE))
+        {
+            pZip->m_pFree(pZip->m_pAlloc_opaque, pComp);
+            return mz_zip_set_error(pZip, MZ_ZIP_COMPRESSION_FAILED);
+        }
+
+        comp_size = state.m_comp_size;
+        cur_archive_file_ofs = state.m_cur_archive_file_ofs;
+    }
+
+    pZip->m_pFree(pZip->m_pAlloc_opaque, pComp);
+    pComp = NULL;
+
+    if (uncomp_size)
+    {
+        mz_uint8 local_dir_footer[MZ_ZIP_DATA_DESCRIPTER_SIZE64];
+        mz_uint32 local_dir_footer_size = MZ_ZIP_DATA_DESCRIPTER_SIZE32;
+
+        MZ_ASSERT(bit_flags & MZ_ZIP_LDH_BIT_FLAG_HAS_LOCATOR);
+
+        MZ_WRITE_LE32(local_dir_footer + 0, MZ_ZIP_DATA_DESCRIPTOR_ID);
+        MZ_WRITE_LE32(local_dir_footer + 4, uncomp_crc32);
+        if (pExtra_data == NULL)
+        {
+            if (comp_size > MZ_UINT32_MAX)
+                return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+
+            MZ_WRITE_LE32(local_dir_footer + 8, comp_size);
+            MZ_WRITE_LE32(local_dir_footer + 12, uncomp_size);
+        }
+        else
+        {
+            MZ_WRITE_LE64(local_dir_footer + 8, comp_size);
+            MZ_WRITE_LE64(local_dir_footer + 16, uncomp_size);
+            local_dir_footer_size = MZ_ZIP_DATA_DESCRIPTER_SIZE64;
+        }
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, local_dir_footer, local_dir_footer_size) != local_dir_footer_size)
+            return MZ_FALSE;
+
+        cur_archive_file_ofs += local_dir_footer_size;
+    }
+
+    if (pExtra_data != NULL)
+    {
+        extra_size = mz_zip_writer_create_zip64_extra_data(extra_data, (uncomp_size >= MZ_UINT32_MAX) ? &uncomp_size : NULL,
+                                                           (uncomp_size >= MZ_UINT32_MAX) ? &comp_size : NULL, (local_dir_header_ofs >= MZ_UINT32_MAX) ? &local_dir_header_ofs : NULL);
+    }
+
+    if (!mz_zip_writer_add_to_central_dir(pZip, pArchive_name, (mz_uint16)archive_name_size, pExtra_data, extra_size, pComment,
+                                          comment_size, uncomp_size, comp_size, uncomp_crc32, method, bit_flags, dos_time, dos_date, local_dir_header_ofs, ext_attributes,
+                                          user_extra_data_central, user_extra_data_central_len))
+        return MZ_FALSE;
+
+    pZip->m_total_files++;
+    pZip->m_archive_size = cur_archive_file_ofs;
+
+    return MZ_TRUE;
+}
+
+#ifndef MINIZ_NO_STDIO
+mz_bool mz_zip_writer_add_cfile(mz_zip_archive *pZip, const char *pArchive_name, MZ_FILE *pSrc_file, mz_uint64 size_to_add, const MZ_TIME_T *pFile_time, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags,
+                                const char *user_extra_data, mz_uint user_extra_data_len, const char *user_extra_data_central, mz_uint user_extra_data_central_len)
+{
+    mz_uint16 gen_flags = MZ_ZIP_LDH_BIT_FLAG_HAS_LOCATOR;
+    mz_uint uncomp_crc32 = MZ_CRC32_INIT, level, num_alignment_padding_bytes;
+    mz_uint16 method = 0, dos_time = 0, dos_date = 0, ext_attributes = 0;
+    mz_uint64 local_dir_header_ofs, cur_archive_file_ofs = pZip->m_archive_size, uncomp_size = size_to_add, comp_size = 0;
+    size_t archive_name_size;
+    mz_uint8 local_dir_header[MZ_ZIP_LOCAL_DIR_HEADER_SIZE];
+    mz_uint8 *pExtra_data = NULL;
+    mz_uint32 extra_size = 0;
+    mz_uint8 extra_data[MZ_ZIP64_MAX_CENTRAL_EXTRA_FIELD_SIZE];
+    mz_zip_internal_state *pState;
+
+    if (!(level_and_flags & MZ_ZIP_FLAG_ASCII_FILENAME))
+        gen_flags |= MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_UTF8;
+
+    if ((int)level_and_flags < 0)
+        level_and_flags = MZ_DEFAULT_LEVEL;
+    level = level_and_flags & 0xF;
+
+    /* Sanity checks */
+    if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING) || (!pArchive_name) || ((comment_size) && (!pComment)) || (level > MZ_UBER_COMPRESSION))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    pState = pZip->m_pState;
+
+    if ((!pState->m_zip64) && (uncomp_size > MZ_UINT32_MAX))
+    {
+        /* Source file is too large for non-zip64 */
+        /*return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE); */
+        pState->m_zip64 = MZ_TRUE;
+    }
+
+    /* We could support this, but why? */
+    if (level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (!mz_zip_writer_validate_archive_name(pArchive_name))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_FILENAME);
+
+    if (pState->m_zip64)
+    {
+        if (pZip->m_total_files == MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+    }
+    else
+    {
+        if (pZip->m_total_files == MZ_UINT16_MAX)
+        {
+            pState->m_zip64 = MZ_TRUE;
+            /*return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES); */
+        }
+    }
+
+    archive_name_size = strlen(pArchive_name);
+    if (archive_name_size > MZ_UINT16_MAX)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_FILENAME);
+
+    num_alignment_padding_bytes = mz_zip_writer_compute_padding_needed_for_file_alignment(pZip);
+
+    /* miniz doesn't support central dirs >= MZ_UINT32_MAX bytes yet */
+    if (((mz_uint64)pState->m_central_dir.m_size + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + archive_name_size + MZ_ZIP64_MAX_CENTRAL_EXTRA_FIELD_SIZE + comment_size) >= MZ_UINT32_MAX)
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_CDIR_SIZE);
+
+    if (!pState->m_zip64)
+    {
+        /* Bail early if the archive would obviously become too large */
+        if ((pZip->m_archive_size + num_alignment_padding_bytes + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + archive_name_size + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE
+			+ archive_name_size + comment_size + user_extra_data_len + pState->m_central_dir.m_size + MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE + 1024
+			+ MZ_ZIP_DATA_DESCRIPTER_SIZE32 + user_extra_data_central_len) > 0xFFFFFFFF)
+        {
+            pState->m_zip64 = MZ_TRUE;
+            /*return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE); */
+        }
+    }
+
+#ifndef MINIZ_NO_TIME
+    if (pFile_time)
+    {
+        mz_zip_time_t_to_dos_time(*pFile_time, &dos_time, &dos_date);
+    }
+#endif
+
+    if (uncomp_size <= 3)
+        level = 0;
+
+    if (!mz_zip_writer_write_zeros(pZip, cur_archive_file_ofs, num_alignment_padding_bytes))
+    {
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+    }
+
+    cur_archive_file_ofs += num_alignment_padding_bytes;
+    local_dir_header_ofs = cur_archive_file_ofs;
+
+    if (pZip->m_file_offset_alignment)
+    {
+        MZ_ASSERT((cur_archive_file_ofs & (pZip->m_file_offset_alignment - 1)) == 0);
+    }
+
+    if (uncomp_size && level)
+    {
+        method = MZ_DEFLATED;
+    }
+
+    MZ_CLEAR_OBJ(local_dir_header);
+    if (pState->m_zip64)
+    {
+        if (uncomp_size >= MZ_UINT32_MAX || local_dir_header_ofs >= MZ_UINT32_MAX)
+        {
+            pExtra_data = extra_data;
+            extra_size = mz_zip_writer_create_zip64_extra_data(extra_data, (uncomp_size >= MZ_UINT32_MAX) ? &uncomp_size : NULL,
+                                                               (uncomp_size >= MZ_UINT32_MAX) ? &comp_size : NULL, (local_dir_header_ofs >= MZ_UINT32_MAX) ? &local_dir_header_ofs : NULL);
+        }
+
+        if (!mz_zip_writer_create_local_dir_header(pZip, local_dir_header, (mz_uint16)archive_name_size, extra_size + user_extra_data_len, 0, 0, 0, method, gen_flags, dos_time, dos_date))
+            return mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, local_dir_header, sizeof(local_dir_header)) != sizeof(local_dir_header))
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        cur_archive_file_ofs += sizeof(local_dir_header);
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pArchive_name, archive_name_size) != archive_name_size)
+        {
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+        }
+
+        cur_archive_file_ofs += archive_name_size;
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, extra_data, extra_size) != extra_size)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        cur_archive_file_ofs += extra_size;
+    }
+    else
+    {
+        if ((comp_size > MZ_UINT32_MAX) || (cur_archive_file_ofs > MZ_UINT32_MAX))
+            return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+        if (!mz_zip_writer_create_local_dir_header(pZip, local_dir_header, (mz_uint16)archive_name_size, user_extra_data_len, 0, 0, 0, method, gen_flags, dos_time, dos_date))
+            return mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, local_dir_header, sizeof(local_dir_header)) != sizeof(local_dir_header))
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        cur_archive_file_ofs += sizeof(local_dir_header);
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pArchive_name, archive_name_size) != archive_name_size)
+        {
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+        }
+
+        cur_archive_file_ofs += archive_name_size;
+    }
+
+    if (user_extra_data_len > 0)
+    {
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, user_extra_data, user_extra_data_len) != user_extra_data_len)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        cur_archive_file_ofs += user_extra_data_len;
+    }
+
+    if (uncomp_size)
+    {
+        mz_uint64 uncomp_remaining = uncomp_size;
+        void *pRead_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, MZ_ZIP_MAX_IO_BUF_SIZE);
+        if (!pRead_buf)
+        {
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        }
+
+        if (!level)
+        {
+            while (uncomp_remaining)
+            {
+                mz_uint n = (mz_uint)MZ_MIN((mz_uint64)MZ_ZIP_MAX_IO_BUF_SIZE, uncomp_remaining);
+                if ((MZ_FREAD(pRead_buf, 1, n, pSrc_file) != n) || (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pRead_buf, n) != n))
+                {
+                    pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf);
+                    return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+                }
+                uncomp_crc32 = (mz_uint32)mz_crc32(uncomp_crc32, (const mz_uint8 *)pRead_buf, n);
+                uncomp_remaining -= n;
+                cur_archive_file_ofs += n;
+            }
+            comp_size = uncomp_size;
+        }
+        else
+        {
+            mz_bool result = MZ_FALSE;
+            mz_zip_writer_add_state state;
+            tdefl_compressor *pComp = (tdefl_compressor *)pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, sizeof(tdefl_compressor));
+            if (!pComp)
+            {
+                pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf);
+                return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+            }
+
+            state.m_pZip = pZip;
+            state.m_cur_archive_file_ofs = cur_archive_file_ofs;
+            state.m_comp_size = 0;
+
+            if (tdefl_init(pComp, mz_zip_writer_add_put_buf_callback, &state, tdefl_create_comp_flags_from_zip_params(level, -15, MZ_DEFAULT_STRATEGY)) != TDEFL_STATUS_OKAY)
+            {
+                pZip->m_pFree(pZip->m_pAlloc_opaque, pComp);
+                pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf);
+                return mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
+            }
+
+            for (;;)
+            {
+                size_t in_buf_size = (mz_uint32)MZ_MIN(uncomp_remaining, (mz_uint64)MZ_ZIP_MAX_IO_BUF_SIZE);
+                tdefl_status status;
+                tdefl_flush flush = TDEFL_NO_FLUSH;
+
+                if (MZ_FREAD(pRead_buf, 1, in_buf_size, pSrc_file) != in_buf_size)
+                {
+                    mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+                    break;
+                }
+
+                uncomp_crc32 = (mz_uint32)mz_crc32(uncomp_crc32, (const mz_uint8 *)pRead_buf, in_buf_size);
+                uncomp_remaining -= in_buf_size;
+
+                if (pZip->m_pNeeds_keepalive != NULL && pZip->m_pNeeds_keepalive(pZip->m_pIO_opaque))
+                    flush = TDEFL_FULL_FLUSH;
+
+                status = tdefl_compress_buffer(pComp, pRead_buf, in_buf_size, uncomp_remaining ? flush : TDEFL_FINISH);
+                if (status == TDEFL_STATUS_DONE)
+                {
+                    result = MZ_TRUE;
+                    break;
+                }
+                else if (status != TDEFL_STATUS_OKAY)
+                {
+                    mz_zip_set_error(pZip, MZ_ZIP_COMPRESSION_FAILED);
+                    break;
+                }
+            }
+
+            pZip->m_pFree(pZip->m_pAlloc_opaque, pComp);
+
+            if (!result)
+            {
+                pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf);
+                return MZ_FALSE;
+            }
+
+            comp_size = state.m_comp_size;
+            cur_archive_file_ofs = state.m_cur_archive_file_ofs;
+        }
+
+        pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf);
+    }
+
+    {
+        mz_uint8 local_dir_footer[MZ_ZIP_DATA_DESCRIPTER_SIZE64];
+        mz_uint32 local_dir_footer_size = MZ_ZIP_DATA_DESCRIPTER_SIZE32;
+
+        MZ_WRITE_LE32(local_dir_footer + 0, MZ_ZIP_DATA_DESCRIPTOR_ID);
+        MZ_WRITE_LE32(local_dir_footer + 4, uncomp_crc32);
+        if (pExtra_data == NULL)
+        {
+            if (comp_size > MZ_UINT32_MAX)
+                return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+
+            MZ_WRITE_LE32(local_dir_footer + 8, comp_size);
+            MZ_WRITE_LE32(local_dir_footer + 12, uncomp_size);
+        }
+        else
+        {
+            MZ_WRITE_LE64(local_dir_footer + 8, comp_size);
+            MZ_WRITE_LE64(local_dir_footer + 16, uncomp_size);
+            local_dir_footer_size = MZ_ZIP_DATA_DESCRIPTER_SIZE64;
+        }
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, local_dir_footer, local_dir_footer_size) != local_dir_footer_size)
+            return MZ_FALSE;
+
+        cur_archive_file_ofs += local_dir_footer_size;
+    }
+
+    if (pExtra_data != NULL)
+    {
+        extra_size = mz_zip_writer_create_zip64_extra_data(extra_data, (uncomp_size >= MZ_UINT32_MAX) ? &uncomp_size : NULL,
+                                                           (uncomp_size >= MZ_UINT32_MAX) ? &comp_size : NULL, (local_dir_header_ofs >= MZ_UINT32_MAX) ? &local_dir_header_ofs : NULL);
+    }
+
+    if (!mz_zip_writer_add_to_central_dir(pZip, pArchive_name, (mz_uint16)archive_name_size, pExtra_data, extra_size, pComment, comment_size,
+                                          uncomp_size, comp_size, uncomp_crc32, method, gen_flags, dos_time, dos_date, local_dir_header_ofs, ext_attributes,
+                                          user_extra_data_central, user_extra_data_central_len))
+        return MZ_FALSE;
+
+    pZip->m_total_files++;
+    pZip->m_archive_size = cur_archive_file_ofs;
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_writer_add_file(mz_zip_archive *pZip, const char *pArchive_name, const char *pSrc_filename, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags)
+{
+    MZ_FILE *pSrc_file = NULL;
+    mz_uint64 uncomp_size = 0;
+    MZ_TIME_T file_modified_time;
+    MZ_TIME_T *pFile_time = NULL;
+    mz_bool status;
+
+    memset(&file_modified_time, 0, sizeof(file_modified_time));
+
+#if !defined(MINIZ_NO_TIME) && !defined(MINIZ_NO_STDIO)
+    pFile_time = &file_modified_time;
+    if (!mz_zip_get_file_modified_time(pSrc_filename, &file_modified_time))
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_STAT_FAILED);
+#endif
+
+    pSrc_file = MZ_FOPEN(pSrc_filename, "rb");
+    if (!pSrc_file)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_OPEN_FAILED);
+
+    MZ_FSEEK64(pSrc_file, 0, SEEK_END);
+    uncomp_size = MZ_FTELL64(pSrc_file);
+    MZ_FSEEK64(pSrc_file, 0, SEEK_SET);
+
+    status = mz_zip_writer_add_cfile(pZip, pArchive_name, pSrc_file, uncomp_size, pFile_time, pComment, comment_size, level_and_flags, NULL, 0, NULL, 0);
+
+    MZ_FCLOSE(pSrc_file);
+
+    return status;
+}
+#endif /* #ifndef MINIZ_NO_STDIO */
+
+static mz_bool mz_zip_writer_update_zip64_extension_block(mz_zip_array *pNew_ext, mz_zip_archive *pZip, const mz_uint8 *pExt, uint32_t ext_len, mz_uint64 *pComp_size, mz_uint64 *pUncomp_size, mz_uint64 *pLocal_header_ofs, mz_uint32 *pDisk_start)
+{
+    /* + 64 should be enough for any new zip64 data */
+    if (!mz_zip_array_reserve(pZip, pNew_ext, ext_len + 64, MZ_FALSE))
+        return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+    mz_zip_array_resize(pZip, pNew_ext, 0, MZ_FALSE);
+
+    if ((pUncomp_size) || (pComp_size) || (pLocal_header_ofs) || (pDisk_start))
+    {
+        mz_uint8 new_ext_block[64];
+        mz_uint8 *pDst = new_ext_block;
+        mz_write_le16(pDst, MZ_ZIP64_EXTENDED_INFORMATION_FIELD_HEADER_ID);
+        mz_write_le16(pDst + sizeof(mz_uint16), 0);
+        pDst += sizeof(mz_uint16) * 2;
+
+        if (pUncomp_size)
+        {
+            mz_write_le64(pDst, *pUncomp_size);
+            pDst += sizeof(mz_uint64);
+        }
+
+        if (pComp_size)
+        {
+            mz_write_le64(pDst, *pComp_size);
+            pDst += sizeof(mz_uint64);
+        }
+
+        if (pLocal_header_ofs)
+        {
+            mz_write_le64(pDst, *pLocal_header_ofs);
+            pDst += sizeof(mz_uint64);
+        }
+
+        if (pDisk_start)
+        {
+            mz_write_le32(pDst, *pDisk_start);
+            pDst += sizeof(mz_uint32);
+        }
+
+        mz_write_le16(new_ext_block + sizeof(mz_uint16), (mz_uint16)((pDst - new_ext_block) - sizeof(mz_uint16) * 2));
+
+        if (!mz_zip_array_push_back(pZip, pNew_ext, new_ext_block, pDst - new_ext_block))
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+    }
+
+    if ((pExt) && (ext_len))
+    {
+        mz_uint32 extra_size_remaining = ext_len;
+        const mz_uint8 *pExtra_data = pExt;
+
+        do
+        {
+            mz_uint32 field_id, field_data_size, field_total_size;
+
+            if (extra_size_remaining < (sizeof(mz_uint16) * 2))
+                return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+            field_id = MZ_READ_LE16(pExtra_data);
+            field_data_size = MZ_READ_LE16(pExtra_data + sizeof(mz_uint16));
+            field_total_size = field_data_size + sizeof(mz_uint16) * 2;
+
+            if (field_total_size > extra_size_remaining)
+                return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+            if (field_id != MZ_ZIP64_EXTENDED_INFORMATION_FIELD_HEADER_ID)
+            {
+                if (!mz_zip_array_push_back(pZip, pNew_ext, pExtra_data, field_total_size))
+                    return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+            }
+
+            pExtra_data += field_total_size;
+            extra_size_remaining -= field_total_size;
+        } while (extra_size_remaining);
+    }
+
+    return MZ_TRUE;
+}
+
+/* TODO: This func is now pretty freakin complex due to zip64, split it up? */
+mz_bool mz_zip_writer_add_from_zip_reader(mz_zip_archive *pZip, mz_zip_archive *pSource_zip, mz_uint src_file_index)
+{
+    mz_uint n, bit_flags, num_alignment_padding_bytes, src_central_dir_following_data_size;
+    mz_uint64 src_archive_bytes_remaining, local_dir_header_ofs;
+    mz_uint64 cur_src_file_ofs, cur_dst_file_ofs;
+    mz_uint32 local_header_u32[(MZ_ZIP_LOCAL_DIR_HEADER_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)];
+    mz_uint8 *pLocal_header = (mz_uint8 *)local_header_u32;
+    mz_uint8 new_central_header[MZ_ZIP_CENTRAL_DIR_HEADER_SIZE];
+    size_t orig_central_dir_size;
+    mz_zip_internal_state *pState;
+    void *pBuf;
+    const mz_uint8 *pSrc_central_header;
+    mz_zip_archive_file_stat src_file_stat;
+    mz_uint32 src_filename_len, src_comment_len, src_ext_len;
+    mz_uint32 local_header_filename_size, local_header_extra_len;
+    mz_uint64 local_header_comp_size, local_header_uncomp_size;
+    mz_bool found_zip64_ext_data_in_ldir = MZ_FALSE;
+
+    /* Sanity checks */
+    if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING) || (!pSource_zip->m_pRead))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    pState = pZip->m_pState;
+
+    /* Don't support copying files from zip64 archives to non-zip64, even though in some cases this is possible */
+    if ((pSource_zip->m_pState->m_zip64) && (!pZip->m_pState->m_zip64))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    /* Get pointer to the source central dir header and crack it */
+    if (NULL == (pSrc_central_header = mz_zip_get_cdh(pSource_zip, src_file_index)))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (MZ_READ_LE32(pSrc_central_header + MZ_ZIP_CDH_SIG_OFS) != MZ_ZIP_CENTRAL_DIR_HEADER_SIG)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    src_filename_len = MZ_READ_LE16(pSrc_central_header + MZ_ZIP_CDH_FILENAME_LEN_OFS);
+    src_comment_len = MZ_READ_LE16(pSrc_central_header + MZ_ZIP_CDH_COMMENT_LEN_OFS);
+    src_ext_len = MZ_READ_LE16(pSrc_central_header + MZ_ZIP_CDH_EXTRA_LEN_OFS);
+    src_central_dir_following_data_size = src_filename_len + src_ext_len + src_comment_len;
+
+    /* TODO: We don't support central dir's >= MZ_UINT32_MAX bytes right now (+32 fudge factor in case we need to add more extra data) */
+    if ((pState->m_central_dir.m_size + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + src_central_dir_following_data_size + 32) >= MZ_UINT32_MAX)
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_CDIR_SIZE);
+
+    num_alignment_padding_bytes = mz_zip_writer_compute_padding_needed_for_file_alignment(pZip);
+
+    if (!pState->m_zip64)
+    {
+        if (pZip->m_total_files == MZ_UINT16_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+    }
+    else
+    {
+        /* TODO: Our zip64 support still has some 32-bit limits that may not be worth fixing. */
+        if (pZip->m_total_files == MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+    }
+
+    if (!mz_zip_file_stat_internal(pSource_zip, src_file_index, pSrc_central_header, &src_file_stat, NULL))
+        return MZ_FALSE;
+
+    cur_src_file_ofs = src_file_stat.m_local_header_ofs;
+    cur_dst_file_ofs = pZip->m_archive_size;
+
+    /* Read the source archive's local dir header */
+    if (pSource_zip->m_pRead(pSource_zip->m_pIO_opaque, cur_src_file_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+
+    if (MZ_READ_LE32(pLocal_header) != MZ_ZIP_LOCAL_DIR_HEADER_SIG)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+
+    cur_src_file_ofs += MZ_ZIP_LOCAL_DIR_HEADER_SIZE;
+
+    /* Compute the total size we need to copy (filename+extra data+compressed data) */
+    local_header_filename_size = MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_FILENAME_LEN_OFS);
+    local_header_extra_len = MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_EXTRA_LEN_OFS);
+    local_header_comp_size = MZ_READ_LE32(pLocal_header + MZ_ZIP_LDH_COMPRESSED_SIZE_OFS);
+    local_header_uncomp_size = MZ_READ_LE32(pLocal_header + MZ_ZIP_LDH_DECOMPRESSED_SIZE_OFS);
+    src_archive_bytes_remaining = local_header_filename_size + local_header_extra_len + src_file_stat.m_comp_size;
+
+    /* Try to find a zip64 extended information field */
+    if ((local_header_extra_len) && ((local_header_comp_size == MZ_UINT32_MAX) || (local_header_uncomp_size == MZ_UINT32_MAX)))
+    {
+        mz_zip_array file_data_array;
+        const mz_uint8 *pExtra_data;
+        mz_uint32 extra_size_remaining = local_header_extra_len;
+
+        mz_zip_array_init(&file_data_array, 1);
+        if (!mz_zip_array_resize(pZip, &file_data_array, local_header_extra_len, MZ_FALSE))
+        {
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        }
+
+        if (pSource_zip->m_pRead(pSource_zip->m_pIO_opaque, src_file_stat.m_local_header_ofs + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + local_header_filename_size, file_data_array.m_p, local_header_extra_len) != local_header_extra_len)
+        {
+            mz_zip_array_clear(pZip, &file_data_array);
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+        }
+
+        pExtra_data = (const mz_uint8 *)file_data_array.m_p;
+
+        do
+        {
+            mz_uint32 field_id, field_data_size, field_total_size;
+
+            if (extra_size_remaining < (sizeof(mz_uint16) * 2))
+            {
+                mz_zip_array_clear(pZip, &file_data_array);
+                return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+            }
+
+            field_id = MZ_READ_LE16(pExtra_data);
+            field_data_size = MZ_READ_LE16(pExtra_data + sizeof(mz_uint16));
+            field_total_size = field_data_size + sizeof(mz_uint16) * 2;
+
+            if (field_total_size > extra_size_remaining)
+            {
+                mz_zip_array_clear(pZip, &file_data_array);
+                return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+            }
+
+            if (field_id == MZ_ZIP64_EXTENDED_INFORMATION_FIELD_HEADER_ID)
+            {
+                const mz_uint8 *pSrc_field_data = pExtra_data + sizeof(mz_uint32);
+
+                if (field_data_size < sizeof(mz_uint64) * 2)
+                {
+                    mz_zip_array_clear(pZip, &file_data_array);
+                    return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
+                }
+
+                local_header_uncomp_size = MZ_READ_LE64(pSrc_field_data);
+                local_header_comp_size = MZ_READ_LE64(pSrc_field_data + sizeof(mz_uint64)); /* may be 0 if there's a descriptor */
+
+                found_zip64_ext_data_in_ldir = MZ_TRUE;
+                break;
+            }
+
+            pExtra_data += field_total_size;
+            extra_size_remaining -= field_total_size;
+        } while (extra_size_remaining);
+
+        mz_zip_array_clear(pZip, &file_data_array);
+    }
+
+    if (!pState->m_zip64)
+    {
+        /* Try to detect if the new archive will most likely wind up too big and bail early (+(sizeof(mz_uint32) * 4) is for the optional descriptor which could be present, +64 is a fudge factor). */
+        /* We also check when the archive is finalized so this doesn't need to be perfect. */
+        mz_uint64 approx_new_archive_size = cur_dst_file_ofs + num_alignment_padding_bytes + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + src_archive_bytes_remaining + (sizeof(mz_uint32) * 4) +
+                                            pState->m_central_dir.m_size + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + src_central_dir_following_data_size + MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE + 64;
+
+        if (approx_new_archive_size >= MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+    }
+
+    /* Write dest archive padding */
+    if (!mz_zip_writer_write_zeros(pZip, cur_dst_file_ofs, num_alignment_padding_bytes))
+        return MZ_FALSE;
+
+    cur_dst_file_ofs += num_alignment_padding_bytes;
+
+    local_dir_header_ofs = cur_dst_file_ofs;
+    if (pZip->m_file_offset_alignment)
+    {
+        MZ_ASSERT((local_dir_header_ofs & (pZip->m_file_offset_alignment - 1)) == 0);
+    }
+
+    /* The original zip's local header+ext block doesn't change, even with zip64, so we can just copy it over to the dest zip */
+    if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_dst_file_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+    cur_dst_file_ofs += MZ_ZIP_LOCAL_DIR_HEADER_SIZE;
+
+    /* Copy over the source archive bytes to the dest archive, also ensure we have enough buf space to handle optional data descriptor */
+    if (NULL == (pBuf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, (size_t)MZ_MAX(32U, MZ_MIN((mz_uint64)MZ_ZIP_MAX_IO_BUF_SIZE, src_archive_bytes_remaining)))))
+        return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+    while (src_archive_bytes_remaining)
+    {
+        n = (mz_uint)MZ_MIN((mz_uint64)MZ_ZIP_MAX_IO_BUF_SIZE, src_archive_bytes_remaining);
+        if (pSource_zip->m_pRead(pSource_zip->m_pIO_opaque, cur_src_file_ofs, pBuf, n) != n)
+        {
+            pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf);
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+        }
+        cur_src_file_ofs += n;
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_dst_file_ofs, pBuf, n) != n)
+        {
+            pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf);
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+        }
+        cur_dst_file_ofs += n;
+
+        src_archive_bytes_remaining -= n;
+    }
+
+    /* Now deal with the optional data descriptor */
+    bit_flags = MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_BIT_FLAG_OFS);
+    if (bit_flags & 8)
+    {
+        /* Copy data descriptor */
+        if ((pSource_zip->m_pState->m_zip64) || (found_zip64_ext_data_in_ldir))
+        {
+            /* src is zip64, dest must be zip64 */
+
+            /* name			uint32_t's */
+            /* id				1 (optional in zip64?) */
+            /* crc			1 */
+            /* comp_size	2 */
+            /* uncomp_size 2 */
+            if (pSource_zip->m_pRead(pSource_zip->m_pIO_opaque, cur_src_file_ofs, pBuf, (sizeof(mz_uint32) * 6)) != (sizeof(mz_uint32) * 6))
+            {
+                pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf);
+                return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+            }
+
+            n = sizeof(mz_uint32) * ((MZ_READ_LE32(pBuf) == MZ_ZIP_DATA_DESCRIPTOR_ID) ? 6 : 5);
+        }
+        else
+        {
+            /* src is NOT zip64 */
+            mz_bool has_id;
+
+            if (pSource_zip->m_pRead(pSource_zip->m_pIO_opaque, cur_src_file_ofs, pBuf, sizeof(mz_uint32) * 4) != sizeof(mz_uint32) * 4)
+            {
+                pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf);
+                return mz_zip_set_error(pZip, MZ_ZIP_FILE_READ_FAILED);
+            }
+
+            has_id = (MZ_READ_LE32(pBuf) == MZ_ZIP_DATA_DESCRIPTOR_ID);
+
+            if (pZip->m_pState->m_zip64)
+            {
+                /* dest is zip64, so upgrade the data descriptor */
+                const mz_uint32 *pSrc_descriptor = (const mz_uint32 *)((const mz_uint8 *)pBuf + (has_id ? sizeof(mz_uint32) : 0));
+                const mz_uint32 src_crc32 = pSrc_descriptor[0];
+                const mz_uint64 src_comp_size = pSrc_descriptor[1];
+                const mz_uint64 src_uncomp_size = pSrc_descriptor[2];
+
+                mz_write_le32((mz_uint8 *)pBuf, MZ_ZIP_DATA_DESCRIPTOR_ID);
+                mz_write_le32((mz_uint8 *)pBuf + sizeof(mz_uint32) * 1, src_crc32);
+                mz_write_le64((mz_uint8 *)pBuf + sizeof(mz_uint32) * 2, src_comp_size);
+                mz_write_le64((mz_uint8 *)pBuf + sizeof(mz_uint32) * 4, src_uncomp_size);
+
+                n = sizeof(mz_uint32) * 6;
+            }
+            else
+            {
+                /* dest is NOT zip64, just copy it as-is */
+                n = sizeof(mz_uint32) * (has_id ? 4 : 3);
+            }
+        }
+
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_dst_file_ofs, pBuf, n) != n)
+        {
+            pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf);
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+        }
+
+        cur_src_file_ofs += n;
+        cur_dst_file_ofs += n;
+    }
+    pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf);
+
+    /* Finally, add the new central dir header */
+    orig_central_dir_size = pState->m_central_dir.m_size;
+
+    memcpy(new_central_header, pSrc_central_header, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE);
+
+    if (pState->m_zip64)
+    {
+        /* This is the painful part: We need to write a new central dir header + ext block with updated zip64 fields, and ensure the old fields (if any) are not included. */
+        const mz_uint8 *pSrc_ext = pSrc_central_header + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + src_filename_len;
+        mz_zip_array new_ext_block;
+
+        mz_zip_array_init(&new_ext_block, sizeof(mz_uint8));
+
+        MZ_WRITE_LE32(new_central_header + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS, MZ_UINT32_MAX);
+        MZ_WRITE_LE32(new_central_header + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS, MZ_UINT32_MAX);
+        MZ_WRITE_LE32(new_central_header + MZ_ZIP_CDH_LOCAL_HEADER_OFS, MZ_UINT32_MAX);
+
+        if (!mz_zip_writer_update_zip64_extension_block(&new_ext_block, pZip, pSrc_ext, src_ext_len, &src_file_stat.m_comp_size, &src_file_stat.m_uncomp_size, &local_dir_header_ofs, NULL))
+        {
+            mz_zip_array_clear(pZip, &new_ext_block);
+            return MZ_FALSE;
+        }
+
+        MZ_WRITE_LE16(new_central_header + MZ_ZIP_CDH_EXTRA_LEN_OFS, new_ext_block.m_size);
+
+        if (!mz_zip_array_push_back(pZip, &pState->m_central_dir, new_central_header, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE))
+        {
+            mz_zip_array_clear(pZip, &new_ext_block);
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        }
+
+        if (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pSrc_central_header + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE, src_filename_len))
+        {
+            mz_zip_array_clear(pZip, &new_ext_block);
+            mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE);
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        }
+
+        if (!mz_zip_array_push_back(pZip, &pState->m_central_dir, new_ext_block.m_p, new_ext_block.m_size))
+        {
+            mz_zip_array_clear(pZip, &new_ext_block);
+            mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE);
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        }
+
+        if (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pSrc_central_header + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + src_filename_len + src_ext_len, src_comment_len))
+        {
+            mz_zip_array_clear(pZip, &new_ext_block);
+            mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE);
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        }
+
+        mz_zip_array_clear(pZip, &new_ext_block);
+    }
+    else
+    {
+        /* sanity checks */
+        if (cur_dst_file_ofs > MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+
+        if (local_dir_header_ofs >= MZ_UINT32_MAX)
+            return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
+
+        MZ_WRITE_LE32(new_central_header + MZ_ZIP_CDH_LOCAL_HEADER_OFS, local_dir_header_ofs);
+
+        if (!mz_zip_array_push_back(pZip, &pState->m_central_dir, new_central_header, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE))
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+
+        if (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pSrc_central_header + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE, src_central_dir_following_data_size))
+        {
+            mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE);
+            return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+        }
+    }
+
+    /* This shouldn't trigger unless we screwed up during the initial sanity checks */
+    if (pState->m_central_dir.m_size >= MZ_UINT32_MAX)
+    {
+        /* TODO: Support central dirs >= 32-bits in size */
+        mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE);
+        return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_CDIR_SIZE);
+    }
+
+    n = (mz_uint32)orig_central_dir_size;
+    if (!mz_zip_array_push_back(pZip, &pState->m_central_dir_offsets, &n, 1))
+    {
+        mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE);
+        return mz_zip_set_error(pZip, MZ_ZIP_ALLOC_FAILED);
+    }
+
+    pZip->m_total_files++;
+    pZip->m_archive_size = cur_dst_file_ofs;
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_writer_finalize_archive(mz_zip_archive *pZip)
+{
+    mz_zip_internal_state *pState;
+    mz_uint64 central_dir_ofs, central_dir_size;
+    mz_uint8 hdr[256];
+
+    if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    pState = pZip->m_pState;
+
+    if (pState->m_zip64)
+    {
+        if ((pZip->m_total_files > MZ_UINT32_MAX) || (pState->m_central_dir.m_size >= MZ_UINT32_MAX))
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+    }
+    else
+    {
+        if ((pZip->m_total_files > MZ_UINT16_MAX) || ((pZip->m_archive_size + pState->m_central_dir.m_size + MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE) > MZ_UINT32_MAX))
+            return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
+    }
+
+    central_dir_ofs = 0;
+    central_dir_size = 0;
+    if (pZip->m_total_files)
+    {
+        /* Write central directory */
+        central_dir_ofs = pZip->m_archive_size;
+        central_dir_size = pState->m_central_dir.m_size;
+        pZip->m_central_directory_file_ofs = central_dir_ofs;
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, central_dir_ofs, pState->m_central_dir.m_p, (size_t)central_dir_size) != central_dir_size)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        pZip->m_archive_size += central_dir_size;
+    }
+
+    if (pState->m_zip64)
+    {
+        /* Write zip64 end of central directory header */
+        mz_uint64 rel_ofs_to_zip64_ecdr = pZip->m_archive_size;
+
+        MZ_CLEAR_OBJ(hdr);
+        MZ_WRITE_LE32(hdr + MZ_ZIP64_ECDH_SIG_OFS, MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIG);
+        MZ_WRITE_LE64(hdr + MZ_ZIP64_ECDH_SIZE_OF_RECORD_OFS, MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE - sizeof(mz_uint32) - sizeof(mz_uint64));
+        MZ_WRITE_LE16(hdr + MZ_ZIP64_ECDH_VERSION_MADE_BY_OFS, 0x031E); /* TODO: always Unix */
+        MZ_WRITE_LE16(hdr + MZ_ZIP64_ECDH_VERSION_NEEDED_OFS, 0x002D);
+        MZ_WRITE_LE64(hdr + MZ_ZIP64_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS, pZip->m_total_files);
+        MZ_WRITE_LE64(hdr + MZ_ZIP64_ECDH_CDIR_TOTAL_ENTRIES_OFS, pZip->m_total_files);
+        MZ_WRITE_LE64(hdr + MZ_ZIP64_ECDH_CDIR_SIZE_OFS, central_dir_size);
+        MZ_WRITE_LE64(hdr + MZ_ZIP64_ECDH_CDIR_OFS_OFS, central_dir_ofs);
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, pZip->m_archive_size, hdr, MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE) != MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        pZip->m_archive_size += MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE;
+
+        /* Write zip64 end of central directory locator */
+        MZ_CLEAR_OBJ(hdr);
+        MZ_WRITE_LE32(hdr + MZ_ZIP64_ECDL_SIG_OFS, MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIG);
+        MZ_WRITE_LE64(hdr + MZ_ZIP64_ECDL_REL_OFS_TO_ZIP64_ECDR_OFS, rel_ofs_to_zip64_ecdr);
+        MZ_WRITE_LE32(hdr + MZ_ZIP64_ECDL_TOTAL_NUMBER_OF_DISKS_OFS, 1);
+        if (pZip->m_pWrite(pZip->m_pIO_opaque, pZip->m_archive_size, hdr, MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIZE) != MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIZE)
+            return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+        pZip->m_archive_size += MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIZE;
+    }
+
+    /* Write end of central directory record */
+    MZ_CLEAR_OBJ(hdr);
+    MZ_WRITE_LE32(hdr + MZ_ZIP_ECDH_SIG_OFS, MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIG);
+    MZ_WRITE_LE16(hdr + MZ_ZIP_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS, MZ_MIN(MZ_UINT16_MAX, pZip->m_total_files));
+    MZ_WRITE_LE16(hdr + MZ_ZIP_ECDH_CDIR_TOTAL_ENTRIES_OFS, MZ_MIN(MZ_UINT16_MAX, pZip->m_total_files));
+    MZ_WRITE_LE32(hdr + MZ_ZIP_ECDH_CDIR_SIZE_OFS, MZ_MIN(MZ_UINT32_MAX, central_dir_size));
+    MZ_WRITE_LE32(hdr + MZ_ZIP_ECDH_CDIR_OFS_OFS, MZ_MIN(MZ_UINT32_MAX, central_dir_ofs));
+
+    if (pZip->m_pWrite(pZip->m_pIO_opaque, pZip->m_archive_size, hdr, MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE) != MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE)
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_WRITE_FAILED);
+
+#ifndef MINIZ_NO_STDIO
+    if ((pState->m_pFile) && (MZ_FFLUSH(pState->m_pFile) == EOF))
+        return mz_zip_set_error(pZip, MZ_ZIP_FILE_CLOSE_FAILED);
+#endif /* #ifndef MINIZ_NO_STDIO */
+
+    pZip->m_archive_size += MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE;
+
+    pZip->m_zip_mode = MZ_ZIP_MODE_WRITING_HAS_BEEN_FINALIZED;
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_writer_finalize_heap_archive(mz_zip_archive *pZip, void **ppBuf, size_t *pSize)
+{
+    if ((!ppBuf) || (!pSize))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    *ppBuf = NULL;
+    *pSize = 0;
+
+    if ((!pZip) || (!pZip->m_pState))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (pZip->m_pWrite != mz_zip_heap_write_func)
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    if (!mz_zip_writer_finalize_archive(pZip))
+        return MZ_FALSE;
+
+    *ppBuf = pZip->m_pState->m_pMem;
+    *pSize = pZip->m_pState->m_mem_size;
+    pZip->m_pState->m_pMem = NULL;
+    pZip->m_pState->m_mem_size = pZip->m_pState->m_mem_capacity = 0;
+
+    return MZ_TRUE;
+}
+
+mz_bool mz_zip_writer_end(mz_zip_archive *pZip)
+{
+    return mz_zip_writer_end_internal(pZip, MZ_TRUE);
+}
+
+#ifndef MINIZ_NO_STDIO
+mz_bool mz_zip_add_mem_to_archive_file_in_place(const char *pZip_filename, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags)
+{
+    return mz_zip_add_mem_to_archive_file_in_place_v2(pZip_filename, pArchive_name, pBuf, buf_size, pComment, comment_size, level_and_flags, NULL);
+}
+
+mz_bool mz_zip_add_mem_to_archive_file_in_place_v2(const char *pZip_filename, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags, mz_zip_error *pErr)
+{
+    mz_bool status, created_new_archive = MZ_FALSE;
+    mz_zip_archive zip_archive;
+    struct MZ_FILE_STAT_STRUCT file_stat;
+    mz_zip_error actual_err = MZ_ZIP_NO_ERROR;
+
+    mz_zip_zero_struct(&zip_archive);
+    if ((int)level_and_flags < 0)
+        level_and_flags = MZ_DEFAULT_LEVEL;
+
+    if ((!pZip_filename) || (!pArchive_name) || ((buf_size) && (!pBuf)) || ((comment_size) && (!pComment)) || ((level_and_flags & 0xF) > MZ_UBER_COMPRESSION))
+    {
+        if (pErr)
+            *pErr = MZ_ZIP_INVALID_PARAMETER;
+        return MZ_FALSE;
+    }
+
+    if (!mz_zip_writer_validate_archive_name(pArchive_name))
+    {
+        if (pErr)
+            *pErr = MZ_ZIP_INVALID_FILENAME;
+        return MZ_FALSE;
+    }
+
+    /* Important: The regular non-64 bit version of stat() can fail here if the file is very large, which could cause the archive to be overwritten. */
+    /* So be sure to compile with _LARGEFILE64_SOURCE 1 */
+    if (MZ_FILE_STAT(pZip_filename, &file_stat) != 0)
+    {
+        /* Create a new archive. */
+        if (!mz_zip_writer_init_file_v2(&zip_archive, pZip_filename, 0, level_and_flags))
+        {
+            if (pErr)
+                *pErr = zip_archive.m_last_error;
+            return MZ_FALSE;
+        }
+
+        created_new_archive = MZ_TRUE;
+    }
+    else
+    {
+        /* Append to an existing archive. */
+        if (!mz_zip_reader_init_file_v2(&zip_archive, pZip_filename, level_and_flags | MZ_ZIP_FLAG_DO_NOT_SORT_CENTRAL_DIRECTORY, 0, 0))
+        {
+            if (pErr)
+                *pErr = zip_archive.m_last_error;
+            return MZ_FALSE;
+        }
+
+        if (!mz_zip_writer_init_from_reader_v2(&zip_archive, pZip_filename, level_and_flags))
+        {
+            if (pErr)
+                *pErr = zip_archive.m_last_error;
+
+            mz_zip_reader_end_internal(&zip_archive, MZ_FALSE);
+
+            return MZ_FALSE;
+        }
+    }
+
+    status = mz_zip_writer_add_mem_ex(&zip_archive, pArchive_name, pBuf, buf_size, pComment, comment_size, level_and_flags, 0, 0);
+    actual_err = zip_archive.m_last_error;
+
+    /* Always finalize, even if adding failed for some reason, so we have a valid central directory. (This may not always succeed, but we can try.) */
+    if (!mz_zip_writer_finalize_archive(&zip_archive))
+    {
+        if (!actual_err)
+            actual_err = zip_archive.m_last_error;
+
+        status = MZ_FALSE;
+    }
+
+    if (!mz_zip_writer_end_internal(&zip_archive, status))
+    {
+        if (!actual_err)
+            actual_err = zip_archive.m_last_error;
+
+        status = MZ_FALSE;
+    }
+
+    if ((!status) && (created_new_archive))
+    {
+        /* It's a new archive and something went wrong, so just delete it. */
+        int ignoredStatus = MZ_DELETE_FILE(pZip_filename);
+        (void)ignoredStatus;
+    }
+
+    if (pErr)
+        *pErr = actual_err;
+
+    return status;
+}
+
+void *mz_zip_extract_archive_file_to_heap_v2(const char *pZip_filename, const char *pArchive_name, const char *pComment, size_t *pSize, mz_uint flags, mz_zip_error *pErr)
+{
+    mz_uint32 file_index;
+    mz_zip_archive zip_archive;
+    void *p = NULL;
+
+    if (pSize)
+        *pSize = 0;
+
+    if ((!pZip_filename) || (!pArchive_name))
+    {
+        if (pErr)
+            *pErr = MZ_ZIP_INVALID_PARAMETER;
+
+        return NULL;
+    }
+
+    mz_zip_zero_struct(&zip_archive);
+    if (!mz_zip_reader_init_file_v2(&zip_archive, pZip_filename, flags | MZ_ZIP_FLAG_DO_NOT_SORT_CENTRAL_DIRECTORY, 0, 0))
+    {
+        if (pErr)
+            *pErr = zip_archive.m_last_error;
+
+        return NULL;
+    }
+
+    if (mz_zip_reader_locate_file_v2(&zip_archive, pArchive_name, pComment, flags, &file_index))
+    {
+        p = mz_zip_reader_extract_to_heap(&zip_archive, file_index, pSize, flags);
+    }
+
+    mz_zip_reader_end_internal(&zip_archive, p != NULL);
+
+    if (pErr)
+        *pErr = zip_archive.m_last_error;
+
+    return p;
+}
+
+void *mz_zip_extract_archive_file_to_heap(const char *pZip_filename, const char *pArchive_name, size_t *pSize, mz_uint flags)
+{
+    return mz_zip_extract_archive_file_to_heap_v2(pZip_filename, pArchive_name, NULL, pSize, flags, NULL);
+}
+
+#endif /* #ifndef MINIZ_NO_STDIO */
+
+#endif /* #ifndef MINIZ_NO_ARCHIVE_WRITING_APIS */
+
+/* ------------------- Misc utils */
+
+mz_zip_mode mz_zip_get_mode(mz_zip_archive *pZip)
+{
+    return pZip ? pZip->m_zip_mode : MZ_ZIP_MODE_INVALID;
+}
+
+mz_zip_type mz_zip_get_type(mz_zip_archive *pZip)
+{
+    return pZip ? pZip->m_zip_type : MZ_ZIP_TYPE_INVALID;
+}
+
+mz_zip_error mz_zip_set_last_error(mz_zip_archive *pZip, mz_zip_error err_num)
+{
+    mz_zip_error prev_err;
+
+    if (!pZip)
+        return MZ_ZIP_INVALID_PARAMETER;
+
+    prev_err = pZip->m_last_error;
+
+    pZip->m_last_error = err_num;
+    return prev_err;
+}
+
+mz_zip_error mz_zip_peek_last_error(mz_zip_archive *pZip)
+{
+    if (!pZip)
+        return MZ_ZIP_INVALID_PARAMETER;
+
+    return pZip->m_last_error;
+}
+
+mz_zip_error mz_zip_clear_last_error(mz_zip_archive *pZip)
+{
+    return mz_zip_set_last_error(pZip, MZ_ZIP_NO_ERROR);
+}
+
+mz_zip_error mz_zip_get_last_error(mz_zip_archive *pZip)
+{
+    mz_zip_error prev_err;
+
+    if (!pZip)
+        return MZ_ZIP_INVALID_PARAMETER;
+
+    prev_err = pZip->m_last_error;
+
+    pZip->m_last_error = MZ_ZIP_NO_ERROR;
+    return prev_err;
+}
+
+const char *mz_zip_get_error_string(mz_zip_error mz_err)
+{
+    switch (mz_err)
+    {
+        case MZ_ZIP_NO_ERROR:
+            return "no error";
+        case MZ_ZIP_UNDEFINED_ERROR:
+            return "undefined error";
+        case MZ_ZIP_TOO_MANY_FILES:
+            return "too many files";
+        case MZ_ZIP_FILE_TOO_LARGE:
+            return "file too large";
+        case MZ_ZIP_UNSUPPORTED_METHOD:
+            return "unsupported method";
+        case MZ_ZIP_UNSUPPORTED_ENCRYPTION:
+            return "unsupported encryption";
+        case MZ_ZIP_UNSUPPORTED_FEATURE:
+            return "unsupported feature";
+        case MZ_ZIP_FAILED_FINDING_CENTRAL_DIR:
+            return "failed finding central directory";
+        case MZ_ZIP_NOT_AN_ARCHIVE:
+            return "not a ZIP archive";
+        case MZ_ZIP_INVALID_HEADER_OR_CORRUPTED:
+            return "invalid header or archive is corrupted";
+        case MZ_ZIP_UNSUPPORTED_MULTIDISK:
+            return "unsupported multidisk archive";
+        case MZ_ZIP_DECOMPRESSION_FAILED:
+            return "decompression failed or archive is corrupted";
+        case MZ_ZIP_COMPRESSION_FAILED:
+            return "compression failed";
+        case MZ_ZIP_UNEXPECTED_DECOMPRESSED_SIZE:
+            return "unexpected decompressed size";
+        case MZ_ZIP_CRC_CHECK_FAILED:
+            return "CRC-32 check failed";
+        case MZ_ZIP_UNSUPPORTED_CDIR_SIZE:
+            return "unsupported central directory size";
+        case MZ_ZIP_ALLOC_FAILED:
+            return "allocation failed";
+        case MZ_ZIP_FILE_OPEN_FAILED:
+            return "file open failed";
+        case MZ_ZIP_FILE_CREATE_FAILED:
+            return "file create failed";
+        case MZ_ZIP_FILE_WRITE_FAILED:
+            return "file write failed";
+        case MZ_ZIP_FILE_READ_FAILED:
+            return "file read failed";
+        case MZ_ZIP_FILE_CLOSE_FAILED:
+            return "file close failed";
+        case MZ_ZIP_FILE_SEEK_FAILED:
+            return "file seek failed";
+        case MZ_ZIP_FILE_STAT_FAILED:
+            return "file stat failed";
+        case MZ_ZIP_INVALID_PARAMETER:
+            return "invalid parameter";
+        case MZ_ZIP_INVALID_FILENAME:
+            return "invalid filename";
+        case MZ_ZIP_BUF_TOO_SMALL:
+            return "buffer too small";
+        case MZ_ZIP_INTERNAL_ERROR:
+            return "internal error";
+        case MZ_ZIP_FILE_NOT_FOUND:
+            return "file not found";
+        case MZ_ZIP_ARCHIVE_TOO_LARGE:
+            return "archive is too large";
+        case MZ_ZIP_VALIDATION_FAILED:
+            return "validation failed";
+        case MZ_ZIP_WRITE_CALLBACK_FAILED:
+            return "write calledback failed";
+        default:
+            break;
+    }
+
+    return "unknown error";
+}
+
+/* Note: Just because the archive is not zip64 doesn't necessarily mean it doesn't have Zip64 extended information extra field, argh. */
+mz_bool mz_zip_is_zip64(mz_zip_archive *pZip)
+{
+    if ((!pZip) || (!pZip->m_pState))
+        return MZ_FALSE;
+
+    return pZip->m_pState->m_zip64;
+}
+
+size_t mz_zip_get_central_dir_size(mz_zip_archive *pZip)
+{
+    if ((!pZip) || (!pZip->m_pState))
+        return 0;
+
+    return pZip->m_pState->m_central_dir.m_size;
+}
+
+mz_uint mz_zip_reader_get_num_files(mz_zip_archive *pZip)
+{
+    return pZip ? pZip->m_total_files : 0;
+}
+
+mz_uint64 mz_zip_get_archive_size(mz_zip_archive *pZip)
+{
+    if (!pZip)
+        return 0;
+    return pZip->m_archive_size;
+}
+
+mz_uint64 mz_zip_get_archive_file_start_offset(mz_zip_archive *pZip)
+{
+    if ((!pZip) || (!pZip->m_pState))
+        return 0;
+    return pZip->m_pState->m_file_archive_start_ofs;
+}
+
+MZ_FILE *mz_zip_get_cfile(mz_zip_archive *pZip)
+{
+    if ((!pZip) || (!pZip->m_pState))
+        return 0;
+    return pZip->m_pState->m_pFile;
+}
+
+size_t mz_zip_read_archive_data(mz_zip_archive *pZip, mz_uint64 file_ofs, void *pBuf, size_t n)
+{
+    if ((!pZip) || (!pZip->m_pState) || (!pBuf) || (!pZip->m_pRead))
+        return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+
+    return pZip->m_pRead(pZip->m_pIO_opaque, file_ofs, pBuf, n);
+}
+
+mz_uint mz_zip_reader_get_filename(mz_zip_archive *pZip, mz_uint file_index, char *pFilename, mz_uint filename_buf_size)
+{
+    mz_uint n;
+    const mz_uint8 *p = mz_zip_get_cdh(pZip, file_index);
+    if (!p)
+    {
+        if (filename_buf_size)
+            pFilename[0] = '\0';
+        mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
+        return 0;
+    }
+    n = MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS);
+    if (filename_buf_size)
+    {
+        n = MZ_MIN(n, filename_buf_size - 1);
+        memcpy(pFilename, p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE, n);
+        pFilename[n] = '\0';
+    }
+    return n + 1;
+}
+
+mz_bool mz_zip_reader_file_stat(mz_zip_archive *pZip, mz_uint file_index, mz_zip_archive_file_stat *pStat)
+{
+    return mz_zip_file_stat_internal(pZip, file_index, mz_zip_get_cdh(pZip, file_index), pStat, NULL);
+}
+
+mz_bool mz_zip_end(mz_zip_archive *pZip)
+{
+    if (!pZip)
+        return MZ_FALSE;
+
+    if (pZip->m_zip_mode == MZ_ZIP_MODE_READING)
+        return mz_zip_reader_end(pZip);
+#ifndef MINIZ_NO_ARCHIVE_WRITING_APIS
+    else if ((pZip->m_zip_mode == MZ_ZIP_MODE_WRITING) || (pZip->m_zip_mode == MZ_ZIP_MODE_WRITING_HAS_BEEN_FINALIZED))
+        return mz_zip_writer_end(pZip);
+#endif
+
+    return MZ_FALSE;
+}
+
+
+
+#endif /*#ifndef MINIZ_NO_ARCHIVE_APIS*/
+} // namespace duckdb_miniz
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/miniz.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/miniz.hpp
new file mode 100755
index 0000000000..8e4b6d7de2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/miniz.hpp
@@ -0,0 +1,1288 @@
+/* miniz.c 2.0.8 - public domain deflate/inflate, zlib-subset, ZIP reading/writing/appending, PNG writing
+   See "unlicense" statement at the end of this file.
+   Rich Geldreich <richgel99@gmail.com>, last updated Oct. 13, 2013
+   Implements RFC 1950: http://www.ietf.org/rfc/rfc1950.txt and RFC 1951: http://www.ietf.org/rfc/rfc1951.txt
+
+   Most API's defined in miniz.c are optional. For example, to disable the archive related functions just define
+   MINIZ_NO_ARCHIVE_APIS, or to get rid of all stdio usage define MINIZ_NO_STDIO (see the list below for more macros).
+
+   * Low-level Deflate/Inflate implementation notes:
+
+     Compression: Use the "tdefl" API's. The compressor supports raw, static, and dynamic blocks, lazy or
+     greedy parsing, match length filtering, RLE-only, and Huffman-only streams. It performs and compresses
+     approximately as well as zlib.
+
+     Decompression: Use the "tinfl" API's. The entire decompressor is implemented as a single function
+     coroutine: see tinfl_decompress(). It supports decompression into a 32KB (or larger power of 2) wrapping buffer, or into a memory
+     block large enough to hold the entire file.
+
+     The low-level tdefl/tinfl API's do not make any use of dynamic memory allocation.
+
+   * zlib-style API notes:
+
+     miniz.c implements a fairly large subset of zlib. There's enough functionality present for it to be a drop-in
+     zlib replacement in many apps:
+        The z_stream struct, optional memory allocation callbacks
+        deflateInit/deflateInit2/deflate/deflateReset/deflateEnd/deflateBound
+        inflateInit/inflateInit2/inflate/inflateEnd
+        compress, compress2, compressBound, uncompress
+        CRC-32, Adler-32 - Using modern, minimal code size, CPU cache friendly routines.
+        Supports raw deflate streams or standard zlib streams with adler-32 checking.
+
+     Limitations:
+      The callback API's are not implemented yet. No support for gzip headers or zlib static dictionaries.
+      I've tried to closely emulate zlib's various flavors of stream flushing and return status codes, but
+      there are no guarantees that miniz.c pulls this off perfectly.
+
+   * PNG writing: See the tdefl_write_image_to_png_file_in_memory() function, originally written by
+     Alex Evans. Supports 1-4 bytes/pixel images.
+
+   * ZIP archive API notes:
+
+     The ZIP archive API's where designed with simplicity and efficiency in mind, with just enough abstraction to
+     get the job done with minimal fuss. There are simple API's to retrieve file information, read files from
+     existing archives, create new archives, append new files to existing archives, or clone archive data from
+     one archive to another. It supports archives located in memory or the heap, on disk (using stdio.h),
+     or you can specify custom file read/write callbacks.
+
+     - Archive reading: Just call this function to read a single file from a disk archive:
+
+      void *mz_zip_extract_archive_file_to_heap(const char *pZip_filename, const char *pArchive_name,
+        size_t *pSize, mz_uint zip_flags);
+
+     For more complex cases, use the "mz_zip_reader" functions. Upon opening an archive, the entire central
+     directory is located and read as-is into memory, and subsequent file access only occurs when reading individual files.
+
+     - Archives file scanning: The simple way is to use this function to scan a loaded archive for a specific file:
+
+     int mz_zip_reader_locate_file(mz_zip_archive *pZip, const char *pName, const char *pComment, mz_uint flags);
+
+     The locate operation can optionally check file comments too, which (as one example) can be used to identify
+     multiple versions of the same file in an archive. This function uses a simple linear search through the central
+     directory, so it's not very fast.
+
+     Alternately, you can iterate through all the files in an archive (using mz_zip_reader_get_num_files()) and
+     retrieve detailed info on each file by calling mz_zip_reader_file_stat().
+
+     - Archive creation: Use the "mz_zip_writer" functions. The ZIP writer immediately writes compressed file data
+     to disk and builds an exact image of the central directory in memory. The central directory image is written
+     all at once at the end of the archive file when the archive is finalized.
+
+     The archive writer can optionally align each file's local header and file data to any power of 2 alignment,
+     which can be useful when the archive will be read from optical media. Also, the writer supports placing
+     arbitrary data blobs at the very beginning of ZIP archives. Archives written using either feature are still
+     readable by any ZIP tool.
+
+     - Archive appending: The simple way to add a single file to an archive is to call this function:
+
+      mz_bool mz_zip_add_mem_to_archive_file_in_place(const char *pZip_filename, const char *pArchive_name,
+        const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags);
+
+     The archive will be created if it doesn't already exist, otherwise it'll be appended to.
+     Note the appending is done in-place and is not an atomic operation, so if something goes wrong
+     during the operation it's possible the archive could be left without a central directory (although the local
+     file headers and file data will be fine, so the archive will be recoverable).
+
+     For more complex archive modification scenarios:
+     1. The safest way is to use a mz_zip_reader to read the existing archive, cloning only those bits you want to
+     preserve into a new archive using using the mz_zip_writer_add_from_zip_reader() function (which compiles the
+     compressed file data as-is). When you're done, delete the old archive and rename the newly written archive, and
+     you're done. This is safe but requires a bunch of temporary disk space or heap memory.
+
+     2. Or, you can convert an mz_zip_reader in-place to an mz_zip_writer using mz_zip_writer_init_from_reader(),
+     append new files as needed, then finalize the archive which will write an updated central directory to the
+     original archive. (This is basically what mz_zip_add_mem_to_archive_file_in_place() does.) There's a
+     possibility that the archive's central directory could be lost with this method if anything goes wrong, though.
+
+     - ZIP archive support limitations:
+     No zip64 or spanning support. Extraction functions can only handle unencrypted, stored or deflated files.
+     Requires streams capable of seeking.
+
+   * This is a header file library, like stb_image.c. To get only a header file, either cut and paste the
+     below header, or create miniz.h, #define MINIZ_HEADER_FILE_ONLY, and then include miniz.c from it.
+
+   * Important: For best perf. be sure to customize the below macros for your target platform:
+     #define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1
+     #define MINIZ_LITTLE_ENDIAN 1
+     #define MINIZ_HAS_64BIT_REGISTERS 1
+
+   * On platforms using glibc, Be sure to "#define _LARGEFILE64_SOURCE 1" before including miniz.c to ensure miniz
+     uses the 64-bit variants: fopen64(), stat64(), etc. Otherwise you won't be able to process large files
+     (i.e. 32-bit stat() fails for me on files > 0x7FFFFFFF bytes).
+*/
+#pragma once
+
+
+
+
+/* Defines to completely disable specific portions of miniz.c:
+   If all macros here are defined the only functionality remaining will be CRC-32, adler-32, tinfl, and tdefl. */
+
+/* Define MINIZ_NO_STDIO to disable all usage and any functions which rely on stdio for file I/O. */
+#define MINIZ_NO_STDIO
+
+/* If MINIZ_NO_TIME is specified then the ZIP archive functions will not be able to get the current time, or */
+/* get/set file times, and the C run-time funcs that get/set times won't be called. */
+/* The current downside is the times written to your archives will be from 1979. */
+#define MINIZ_NO_TIME
+
+/* Define MINIZ_NO_ARCHIVE_APIS to disable all ZIP archive API's. */
+/* #define MINIZ_NO_ARCHIVE_APIS */
+
+/* Define MINIZ_NO_ARCHIVE_WRITING_APIS to disable all writing related ZIP archive API's. */
+/* #define MINIZ_NO_ARCHIVE_WRITING_APIS */
+
+/* Define MINIZ_NO_ZLIB_APIS to remove all ZLIB-style compression/decompression API's. */
+/*#define MINIZ_NO_ZLIB_APIS */
+
+/* Define MINIZ_NO_ZLIB_COMPATIBLE_NAME to disable zlib names, to prevent conflicts against stock zlib. */
+#define MINIZ_NO_ZLIB_COMPATIBLE_NAMES
+
+/* Define MINIZ_NO_MALLOC to disable all calls to malloc, free, and realloc.
+   Note if MINIZ_NO_MALLOC is defined then the user must always provide custom user alloc/free/realloc
+   callbacks to the zlib and archive API's, and a few stand-alone helper API's which don't provide custom user
+   functions (such as tdefl_compress_mem_to_heap() and tinfl_decompress_mem_to_heap()) won't work. */
+/*#define MINIZ_NO_MALLOC */
+
+#if defined(__TINYC__) && (defined(__linux) || defined(__linux__))
+/* TODO: Work around "error: include file 'sys\utime.h' when compiling with tcc on Linux */
+#define MINIZ_NO_TIME
+#endif
+
+#include <stddef.h>
+
+
+
+#if !defined(MINIZ_NO_TIME) && !defined(MINIZ_NO_ARCHIVE_APIS)
+#include <time.h>
+#endif
+
+#if defined(_M_IX86) || defined(_M_X64) || defined(__i386__) || defined(__i386) || defined(__i486__) || defined(__i486) || defined(i386) || defined(__ia64__) || defined(__x86_64__)
+/* MINIZ_X86_OR_X64_CPU is only used to help set the below macros. */
+#define MINIZ_X86_OR_X64_CPU 1
+#else
+#define MINIZ_X86_OR_X64_CPU 0
+#endif
+
+#if (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__) || MINIZ_X86_OR_X64_CPU
+/* Set MINIZ_LITTLE_ENDIAN to 1 if the processor is little endian. */
+#define MINIZ_LITTLE_ENDIAN 1
+#else
+#define MINIZ_LITTLE_ENDIAN 0
+#endif
+
+#if MINIZ_X86_OR_X64_CPU
+/* Set MINIZ_USE_UNALIGNED_LOADS_AND_STORES to 1 on CPU's that permit efficient integer loads and stores from unaligned addresses. */
+#define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 0 // always 0 because alignment
+#else
+#define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 0
+#endif
+
+#if defined(_M_X64) || defined(_WIN64) || defined(__MINGW64__) || defined(_LP64) || defined(__LP64__) || defined(__ia64__) || defined(__x86_64__)
+/* Set MINIZ_HAS_64BIT_REGISTERS to 1 if operations on 64-bit integers are reasonably fast (and don't involve compiler generated calls to helper functions). */
+#define MINIZ_HAS_64BIT_REGISTERS 1
+#else
+#define MINIZ_HAS_64BIT_REGISTERS 0
+#endif
+
+namespace miniz {
+
+/* ------------------- zlib-style API Definitions. */
+
+/* For more compatibility with zlib, miniz.c uses unsigned long for some parameters/struct members. Beware: mz_ulong can be either 32 or 64-bits! */
+typedef unsigned long mz_ulong;
+
+/* mz_free() internally uses the MZ_FREE() macro (which by default calls free() unless you've modified the MZ_MALLOC macro) to release a block allocated from the heap. */
+void mz_free(void *p);
+
+#define MZ_ADLER32_INIT (1)
+/* mz_adler32() returns the initial adler-32 value to use when called with ptr==NULL. */
+mz_ulong mz_adler32(mz_ulong adler, const unsigned char *ptr, size_t buf_len);
+
+#define MZ_CRC32_INIT (0)
+/* mz_crc32() returns the initial CRC-32 value to use when called with ptr==NULL. */
+mz_ulong mz_crc32(mz_ulong crc, const unsigned char *ptr, size_t buf_len);
+
+/* Compression strategies. */
+enum { MZ_DEFAULT_STRATEGY = 0, MZ_FILTERED = 1, MZ_HUFFMAN_ONLY = 2, MZ_RLE = 3, MZ_FIXED = 4 };
+
+/* Method */
+#define MZ_DEFLATED 8
+
+/* Heap allocation callbacks.
+Note that mz_alloc_func parameter types purpsosely differ from zlib's: items/size is size_t, not unsigned long. */
+typedef void *(*mz_alloc_func)(void *opaque, size_t items, size_t size);
+typedef void (*mz_free_func)(void *opaque, void *address);
+typedef void *(*mz_realloc_func)(void *opaque, void *address, size_t items, size_t size);
+
+/* Compression levels: 0-9 are the standard zlib-style levels, 10 is best possible compression (not zlib compatible, and may be very slow), MZ_DEFAULT_COMPRESSION=MZ_DEFAULT_LEVEL. */
+enum {
+	MZ_NO_COMPRESSION = 0,
+	MZ_BEST_SPEED = 1,
+	MZ_BEST_COMPRESSION = 9,
+	MZ_UBER_COMPRESSION = 10,
+	MZ_DEFAULT_LEVEL = 6,
+	MZ_DEFAULT_COMPRESSION = -1
+};
+
+#define MZ_VERSION "10.0.3"
+#define MZ_VERNUM 0xA030
+#define MZ_VER_MAJOR 10
+#define MZ_VER_MINOR 0
+#define MZ_VER_REVISION 3
+#define MZ_VER_SUBREVISION 0
+
+#ifndef MINIZ_NO_ZLIB_APIS
+
+/* Flush values. For typical usage you only need MZ_NO_FLUSH and MZ_FINISH. The other values are for advanced use (refer to the zlib docs). */
+enum { MZ_NO_FLUSH = 0, MZ_PARTIAL_FLUSH = 1, MZ_SYNC_FLUSH = 2, MZ_FULL_FLUSH = 3, MZ_FINISH = 4, MZ_BLOCK = 5 };
+
+/* Return status codes. MZ_PARAM_ERROR is non-standard. */
+enum {
+	MZ_OK = 0,
+	MZ_STREAM_END = 1,
+	MZ_NEED_DICT = 2,
+	MZ_ERRNO = -1,
+	MZ_STREAM_ERROR = -2,
+	MZ_DATA_ERROR = -3,
+	MZ_MEM_ERROR = -4,
+	MZ_BUF_ERROR = -5,
+	MZ_VERSION_ERROR = -6,
+	MZ_PARAM_ERROR = -10000
+};
+
+/* Window bits */
+#define MZ_DEFAULT_WINDOW_BITS 15
+
+struct mz_internal_state;
+
+/* Compression/decompression stream struct. */
+typedef struct mz_stream_s {
+	const unsigned char *next_in; /* pointer to next byte to read */
+	unsigned int avail_in;        /* number of bytes available at next_in */
+	mz_ulong total_in;            /* total number of bytes consumed so far */
+
+	unsigned char *next_out; /* pointer to next byte to write */
+	unsigned int avail_out;  /* number of bytes that can be written to next_out */
+	mz_ulong total_out;      /* total number of bytes produced so far */
+
+	char *msg;                       /* error msg (unused) */
+	struct mz_internal_state *state; /* internal state, allocated by zalloc/zfree */
+
+	mz_alloc_func zalloc; /* optional heap allocation function (defaults to malloc) */
+	mz_free_func zfree;   /* optional heap free function (defaults to free) */
+	void *opaque;         /* heap alloc function user pointer */
+
+	int data_type;     /* data_type (unused) */
+	mz_ulong adler;    /* adler32 of the source or uncompressed data */
+	mz_ulong reserved; /* not used */
+} mz_stream;
+
+typedef mz_stream *mz_streamp;
+
+/* Returns the version string of miniz.c. */
+const char *mz_version(void);
+
+/* mz_deflateInit() initializes a compressor with default options: */
+/* Parameters: */
+/*  pStream must point to an initialized mz_stream struct. */
+/*  level must be between [MZ_NO_COMPRESSION, MZ_BEST_COMPRESSION]. */
+/*  level 1 enables a specially optimized compression function that's been optimized purely for performance, not ratio.
+ */
+/*  (This special func. is currently only enabled when MINIZ_USE_UNALIGNED_LOADS_AND_STORES and MINIZ_LITTLE_ENDIAN are defined.) */
+/* Return values: */
+/*  MZ_OK on success. */
+/*  MZ_STREAM_ERROR if the stream is bogus. */
+/*  MZ_PARAM_ERROR if the input parameters are bogus. */
+/*  MZ_MEM_ERROR on out of memory. */
+int mz_deflateInit(mz_streamp pStream, int level);
+
+/* mz_deflateInit2() is like mz_deflate(), except with more control: */
+/* Additional parameters: */
+/*   method must be MZ_DEFLATED */
+/*   window_bits must be MZ_DEFAULT_WINDOW_BITS (to wrap the deflate stream with zlib header/adler-32 footer) or -MZ_DEFAULT_WINDOW_BITS (raw deflate/no header or footer) */
+/*   mem_level must be between [1, 9] (it's checked but ignored by miniz.c) */
+int mz_deflateInit2(mz_streamp pStream, int level, int method, int window_bits, int mem_level, int strategy);
+
+/* Quickly resets a compressor without having to reallocate anything. Same as calling mz_deflateEnd() followed by mz_deflateInit()/mz_deflateInit2(). */
+int mz_deflateReset(mz_streamp pStream);
+
+/* mz_deflate() compresses the input to output, consuming as much of the input and producing as much output as possible.
+ */
+/* Parameters: */
+/*   pStream is the stream to read from and write to. You must initialize/update the next_in, avail_in, next_out, and avail_out members. */
+/*   flush may be MZ_NO_FLUSH, MZ_PARTIAL_FLUSH/MZ_SYNC_FLUSH, MZ_FULL_FLUSH, or MZ_FINISH. */
+/* Return values: */
+/*   MZ_OK on success (when flushing, or if more input is needed but not available, and/or there's more output to be written but the output buffer is full). */
+/*   MZ_STREAM_END if all input has been consumed and all output bytes have been written. Don't call mz_deflate() on the stream anymore. */
+/*   MZ_STREAM_ERROR if the stream is bogus. */
+/*   MZ_PARAM_ERROR if one of the parameters is invalid. */
+/*   MZ_BUF_ERROR if no forward progress is possible because the input and/or output buffers are empty. (Fill up the input buffer or free up some output space and try again.) */
+int mz_deflate(mz_streamp pStream, int flush);
+
+/* mz_deflateEnd() deinitializes a compressor: */
+/* Return values: */
+/*  MZ_OK on success. */
+/*  MZ_STREAM_ERROR if the stream is bogus. */
+int mz_deflateEnd(mz_streamp pStream);
+
+/* mz_deflateBound() returns a (very) conservative upper bound on the amount of data that could be generated by deflate(), assuming flush is set to only MZ_NO_FLUSH or MZ_FINISH. */
+mz_ulong mz_deflateBound(mz_streamp pStream, mz_ulong source_len);
+
+/* Single-call compression functions mz_compress() and mz_compress2(): */
+/* Returns MZ_OK on success, or one of the error codes from mz_deflate() on failure. */
+int mz_compress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len);
+int mz_compress2(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len,
+                 int level);
+
+/* mz_compressBound() returns a (very) conservative upper bound on the amount of data that could be generated by calling mz_compress(). */
+mz_ulong mz_compressBound(mz_ulong source_len);
+
+/* Initializes a decompressor. */
+int mz_inflateInit(mz_streamp pStream);
+
+/* mz_inflateInit2() is like mz_inflateInit() with an additional option that controls the window size and whether or not the stream has been wrapped with a zlib header/footer: */
+/* window_bits must be MZ_DEFAULT_WINDOW_BITS (to parse zlib header/footer) or -MZ_DEFAULT_WINDOW_BITS (raw deflate). */
+int mz_inflateInit2(mz_streamp pStream, int window_bits);
+
+/* Decompresses the input stream to the output, consuming only as much of the input as needed, and writing as much to the output as possible. */
+/* Parameters: */
+/*   pStream is the stream to read from and write to. You must initialize/update the next_in, avail_in, next_out, and avail_out members. */
+/*   flush may be MZ_NO_FLUSH, MZ_SYNC_FLUSH, or MZ_FINISH. */
+/*   On the first call, if flush is MZ_FINISH it's assumed the input and output buffers are both sized large enough to decompress the entire stream in a single call (this is slightly faster). */
+/*   MZ_FINISH implies that there are no more source bytes available beside what's already in the input buffer, and that the output buffer is large enough to hold the rest of the decompressed data. */
+/* Return values: */
+/*   MZ_OK on success. Either more input is needed but not available, and/or there's more output to be written but the output buffer is full. */
+/*   MZ_STREAM_END if all needed input has been consumed and all output bytes have been written. For zlib streams, the adler-32 of the decompressed data has also been verified. */
+/*   MZ_STREAM_ERROR if the stream is bogus. */
+/*   MZ_DATA_ERROR if the deflate stream is invalid. */
+/*   MZ_PARAM_ERROR if one of the parameters is invalid. */
+/*   MZ_BUF_ERROR if no forward progress is possible because the input buffer is empty but the inflater needs more input to continue, or if the output buffer is not large enough. Call mz_inflate() again */
+/*   with more input data, or with more room in the output buffer (except when using single call decompression, described above). */
+int mz_inflate(mz_streamp pStream, int flush);
+
+/* Deinitializes a decompressor. */
+int mz_inflateEnd(mz_streamp pStream);
+
+/* Single-call decompression. */
+/* Returns MZ_OK on success, or one of the error codes from mz_inflate() on failure. */
+int mz_uncompress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len);
+
+/* Returns a string description of the specified error code, or NULL if the error code is invalid. */
+const char *mz_error(int err);
+
+/* Redefine zlib-compatible names to miniz equivalents, so miniz.c can be used as a drop-in replacement for the subset of zlib that miniz.c supports. */
+/* Define MINIZ_NO_ZLIB_COMPATIBLE_NAMES to disable zlib-compatibility if you use zlib in the same project. */
+#ifndef MINIZ_NO_ZLIB_COMPATIBLE_NAMES
+typedef unsigned char Byte;
+typedef unsigned int uInt;
+typedef mz_ulong uLong;
+typedef Byte Bytef;
+typedef uInt uIntf;
+typedef char charf;
+typedef int intf;
+typedef void *voidpf;
+typedef uLong uLongf;
+typedef void *voidp;
+typedef void *const voidpc;
+#define Z_NULL 0
+#define Z_NO_FLUSH MZ_NO_FLUSH
+#define Z_PARTIAL_FLUSH MZ_PARTIAL_FLUSH
+#define Z_SYNC_FLUSH MZ_SYNC_FLUSH
+#define Z_FULL_FLUSH MZ_FULL_FLUSH
+#define Z_FINISH MZ_FINISH
+#define Z_BLOCK MZ_BLOCK
+#define Z_OK MZ_OK
+#define Z_STREAM_END MZ_STREAM_END
+#define Z_NEED_DICT MZ_NEED_DICT
+#define Z_ERRNO MZ_ERRNO
+#define Z_STREAM_ERROR MZ_STREAM_ERROR
+#define Z_DATA_ERROR MZ_DATA_ERROR
+#define Z_MEM_ERROR MZ_MEM_ERROR
+#define Z_BUF_ERROR MZ_BUF_ERROR
+#define Z_VERSION_ERROR MZ_VERSION_ERROR
+#define Z_PARAM_ERROR MZ_PARAM_ERROR
+#define Z_NO_COMPRESSION MZ_NO_COMPRESSION
+#define Z_BEST_SPEED MZ_BEST_SPEED
+#define Z_BEST_COMPRESSION MZ_BEST_COMPRESSION
+#define Z_DEFAULT_COMPRESSION MZ_DEFAULT_COMPRESSION
+#define Z_DEFAULT_STRATEGY MZ_DEFAULT_STRATEGY
+#define Z_FILTERED MZ_FILTERED
+#define Z_HUFFMAN_ONLY MZ_HUFFMAN_ONLY
+#define Z_RLE MZ_RLE
+#define Z_FIXED MZ_FIXED
+#define Z_DEFLATED MZ_DEFLATED
+#define Z_DEFAULT_WINDOW_BITS MZ_DEFAULT_WINDOW_BITS
+#define alloc_func mz_alloc_func
+#define free_func mz_free_func
+#define internal_state mz_internal_state
+#define z_stream mz_stream
+#define deflateInit mz_deflateInit
+#define deflateInit2 mz_deflateInit2
+#define deflateReset mz_deflateReset
+#define deflate mz_deflate
+#define deflateEnd mz_deflateEnd
+#define deflateBound mz_deflateBound
+#define compress mz_compress
+#define compress2 mz_compress2
+#define compressBound mz_compressBound
+#define inflateInit mz_inflateInit
+#define inflateInit2 mz_inflateInit2
+#define inflate mz_inflate
+#define inflateEnd mz_inflateEnd
+#define uncompress mz_uncompress
+#define crc32 mz_crc32
+#define adler32 mz_adler32
+#define MAX_WBITS 15
+#define MAX_MEM_LEVEL 9
+#define zError mz_error
+#define ZLIB_VERSION MZ_VERSION
+#define ZLIB_VERNUM MZ_VERNUM
+#define ZLIB_VER_MAJOR MZ_VER_MAJOR
+#define ZLIB_VER_MINOR MZ_VER_MINOR
+#define ZLIB_VER_REVISION MZ_VER_REVISION
+#define ZLIB_VER_SUBREVISION MZ_VER_SUBREVISION
+#define zlibVersion mz_version
+#define zlib_version mz_version()
+#endif /* #ifndef MINIZ_NO_ZLIB_COMPATIBLE_NAMES */
+
+#endif /* MINIZ_NO_ZLIB_APIS */
+
+}
+
+#pragma once
+#include <assert.h>
+#include <stdint.h>
+#include <stdlib.h>
+#include <string.h>
+
+namespace miniz {
+
+/* ------------------- Types and macros */
+typedef unsigned char mz_uint8;
+typedef signed short mz_int16;
+typedef unsigned short mz_uint16;
+typedef unsigned int mz_uint32;
+typedef unsigned int mz_uint;
+typedef int64_t mz_int64;
+typedef uint64_t mz_uint64;
+typedef int mz_bool;
+
+#define MZ_FALSE (0)
+#define MZ_TRUE (1)
+
+/* Works around MSVC's spammy "warning C4127: conditional expression is constant" message. */
+#ifdef _MSC_VER
+#define MZ_MACRO_END while (0, 0)
+#else
+#define MZ_MACRO_END while (0)
+#endif
+
+#ifdef MINIZ_NO_STDIO
+#define MZ_FILE void *
+#else
+#include <stdio.h>
+#define MZ_FILE FILE
+#endif /* #ifdef MINIZ_NO_STDIO */
+
+#ifdef MINIZ_NO_TIME
+typedef struct mz_dummy_time_t_tag
+{
+    int m_dummy;
+} mz_dummy_time_t;
+#define MZ_TIME_T mz_dummy_time_t
+#else
+#define MZ_TIME_T time_t
+#endif
+
+#define MZ_ASSERT(x) assert(x)
+
+#ifdef MINIZ_NO_MALLOC
+#define MZ_MALLOC(x) NULL
+#define MZ_FREE(x) (void)x, ((void)0)
+#define MZ_REALLOC(p, x) NULL
+#else
+#define MZ_MALLOC(x) malloc(x)
+#define MZ_FREE(x) free(x)
+#define MZ_REALLOC(p, x) realloc(p, x)
+#endif
+
+#define MZ_MAX(a, b) (((a) > (b)) ? (a) : (b))
+#define MZ_MIN(a, b) (((a) < (b)) ? (a) : (b))
+#define MZ_CLEAR_OBJ(obj) memset(&(obj), 0, sizeof(obj))
+
+#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN
+#define MZ_READ_LE16(p) *((const mz_uint16 *)(p))
+#define MZ_READ_LE32(p) *((const mz_uint32 *)(p))
+#else
+#define MZ_READ_LE16(p) ((mz_uint32)(((const mz_uint8 *)(p))[0]) | ((mz_uint32)(((const mz_uint8 *)(p))[1]) << 8U))
+#define MZ_READ_LE32(p) ((mz_uint32)(((const mz_uint8 *)(p))[0]) | ((mz_uint32)(((const mz_uint8 *)(p))[1]) << 8U) | ((mz_uint32)(((const mz_uint8 *)(p))[2]) << 16U) | ((mz_uint32)(((const mz_uint8 *)(p))[3]) << 24U))
+#endif
+
+#define MZ_READ_LE64(p) (((mz_uint64)MZ_READ_LE32(p)) | (((mz_uint64)MZ_READ_LE32((const mz_uint8 *)(p) + sizeof(mz_uint32))) << 32U))
+
+#ifdef _MSC_VER
+#define MZ_FORCEINLINE __forceinline
+#elif defined(__GNUC__)
+#define MZ_FORCEINLINE __inline__ __attribute__((__always_inline__))
+#else
+#define MZ_FORCEINLINE inline
+#endif
+
+extern void *miniz_def_alloc_func(void *opaque, size_t items, size_t size);
+extern void miniz_def_free_func(void *opaque, void *address);
+extern void *miniz_def_realloc_func(void *opaque, void *address, size_t items, size_t size);
+
+#define MZ_UINT16_MAX (0xFFFFU)
+#define MZ_UINT32_MAX (0xFFFFFFFFU)
+
+
+#pragma once
+
+
+/* ------------------- Low-level Compression API Definitions */
+
+/* Set TDEFL_LESS_MEMORY to 1 to use less memory (compression will be slightly slower, and raw/dynamic blocks will be output more frequently). */
+#define TDEFL_LESS_MEMORY 0
+
+/* tdefl_init() compression flags logically OR'd together (low 12 bits contain the max. number of probes per dictionary search): */
+/* TDEFL_DEFAULT_MAX_PROBES: The compressor defaults to 128 dictionary probes per dictionary search. 0=Huffman only, 1=Huffman+LZ (fastest/crap compression), 4095=Huffman+LZ (slowest/best compression). */
+enum
+{
+    TDEFL_HUFFMAN_ONLY = 0,
+    TDEFL_DEFAULT_MAX_PROBES = 128,
+    TDEFL_MAX_PROBES_MASK = 0xFFF
+};
+
+/* TDEFL_WRITE_ZLIB_HEADER: If set, the compressor outputs a zlib header before the deflate data, and the Adler-32 of the source data at the end. Otherwise, you'll get raw deflate data. */
+/* TDEFL_COMPUTE_ADLER32: Always compute the adler-32 of the input data (even when not writing zlib headers). */
+/* TDEFL_GREEDY_PARSING_FLAG: Set to use faster greedy parsing, instead of more efficient lazy parsing. */
+/* TDEFL_NONDETERMINISTIC_PARSING_FLAG: Enable to decrease the compressor's initialization time to the minimum, but the output may vary from run to run given the same input (depending on the contents of memory). */
+/* TDEFL_RLE_MATCHES: Only look for RLE matches (matches with a distance of 1) */
+/* TDEFL_FILTER_MATCHES: Discards matches <= 5 chars if enabled. */
+/* TDEFL_FORCE_ALL_STATIC_BLOCKS: Disable usage of optimized Huffman tables. */
+/* TDEFL_FORCE_ALL_RAW_BLOCKS: Only use raw (uncompressed) deflate blocks. */
+/* The low 12 bits are reserved to control the max # of hash probes per dictionary lookup (see TDEFL_MAX_PROBES_MASK). */
+enum
+{
+    TDEFL_WRITE_ZLIB_HEADER = 0x01000,
+    TDEFL_COMPUTE_ADLER32 = 0x02000,
+    TDEFL_GREEDY_PARSING_FLAG = 0x04000,
+    TDEFL_NONDETERMINISTIC_PARSING_FLAG = 0x08000,
+    TDEFL_RLE_MATCHES = 0x10000,
+    TDEFL_FILTER_MATCHES = 0x20000,
+    TDEFL_FORCE_ALL_STATIC_BLOCKS = 0x40000,
+    TDEFL_FORCE_ALL_RAW_BLOCKS = 0x80000
+};
+
+/* High level compression functions: */
+/* tdefl_compress_mem_to_heap() compresses a block in memory to a heap block allocated via malloc(). */
+/* On entry: */
+/*  pSrc_buf, src_buf_len: Pointer and size of source block to compress. */
+/*  flags: The max match finder probes (default is 128) logically OR'd against the above flags. Higher probes are slower but improve compression. */
+/* On return: */
+/*  Function returns a pointer to the compressed data, or NULL on failure. */
+/*  *pOut_len will be set to the compressed data's size, which could be larger than src_buf_len on uncompressible data. */
+/*  The caller must free() the returned block when it's no longer needed. */
+void *tdefl_compress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags);
+
+/* tdefl_compress_mem_to_mem() compresses a block in memory to another block in memory. */
+/* Returns 0 on failure. */
+size_t tdefl_compress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags);
+
+/* Compresses an image to a compressed PNG file in memory. */
+/* On entry: */
+/*  pImage, w, h, and num_chans describe the image to compress. num_chans may be 1, 2, 3, or 4. */
+/*  The image pitch in bytes per scanline will be w*num_chans. The leftmost pixel on the top scanline is stored first in memory. */
+/*  level may range from [0,10], use MZ_NO_COMPRESSION, MZ_BEST_SPEED, MZ_BEST_COMPRESSION, etc. or a decent default is MZ_DEFAULT_LEVEL */
+/*  If flip is true, the image will be flipped on the Y axis (useful for OpenGL apps). */
+/* On return: */
+/*  Function returns a pointer to the compressed data, or NULL on failure. */
+/*  *pLen_out will be set to the size of the PNG image file. */
+/*  The caller must mz_free() the returned heap block (which will typically be larger than *pLen_out) when it's no longer needed. */
+void *tdefl_write_image_to_png_file_in_memory_ex(const void *pImage, int w, int h, int num_chans, size_t *pLen_out, mz_uint level, mz_bool flip);
+void *tdefl_write_image_to_png_file_in_memory(const void *pImage, int w, int h, int num_chans, size_t *pLen_out);
+
+/* Output stream interface. The compressor uses this interface to write compressed data. It'll typically be called TDEFL_OUT_BUF_SIZE at a time. */
+typedef mz_bool (*tdefl_put_buf_func_ptr)(const void *pBuf, int len, void *pUser);
+
+/* tdefl_compress_mem_to_output() compresses a block to an output stream. The above helpers use this function internally. */
+mz_bool tdefl_compress_mem_to_output(const void *pBuf, size_t buf_len, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags);
+
+enum
+{
+    TDEFL_MAX_HUFF_TABLES = 3,
+    TDEFL_MAX_HUFF_SYMBOLS_0 = 288,
+    TDEFL_MAX_HUFF_SYMBOLS_1 = 32,
+    TDEFL_MAX_HUFF_SYMBOLS_2 = 19,
+    TDEFL_LZ_DICT_SIZE = 32768,
+    TDEFL_LZ_DICT_SIZE_MASK = TDEFL_LZ_DICT_SIZE - 1,
+    TDEFL_MIN_MATCH_LEN = 3,
+    TDEFL_MAX_MATCH_LEN = 258
+};
+
+/* TDEFL_OUT_BUF_SIZE MUST be large enough to hold a single entire compressed output block (using static/fixed Huffman codes). */
+#if TDEFL_LESS_MEMORY
+enum
+{
+    TDEFL_LZ_CODE_BUF_SIZE = 24 * 1024,
+    TDEFL_OUT_BUF_SIZE = (TDEFL_LZ_CODE_BUF_SIZE * 13) / 10,
+    TDEFL_MAX_HUFF_SYMBOLS = 288,
+    TDEFL_LZ_HASH_BITS = 12,
+    TDEFL_LEVEL1_HASH_SIZE_MASK = 4095,
+    TDEFL_LZ_HASH_SHIFT = (TDEFL_LZ_HASH_BITS + 2) / 3,
+    TDEFL_LZ_HASH_SIZE = 1 << TDEFL_LZ_HASH_BITS
+};
+#else
+enum
+{
+    TDEFL_LZ_CODE_BUF_SIZE = 64 * 1024,
+    TDEFL_OUT_BUF_SIZE = (TDEFL_LZ_CODE_BUF_SIZE * 13) / 10,
+    TDEFL_MAX_HUFF_SYMBOLS = 288,
+    TDEFL_LZ_HASH_BITS = 15,
+    TDEFL_LEVEL1_HASH_SIZE_MASK = 4095,
+    TDEFL_LZ_HASH_SHIFT = (TDEFL_LZ_HASH_BITS + 2) / 3,
+    TDEFL_LZ_HASH_SIZE = 1 << TDEFL_LZ_HASH_BITS
+};
+#endif
+
+/* The low-level tdefl functions below may be used directly if the above helper functions aren't flexible enough. The low-level functions don't make any heap allocations, unlike the above helper functions. */
+typedef enum {
+    TDEFL_STATUS_BAD_PARAM = -2,
+    TDEFL_STATUS_PUT_BUF_FAILED = -1,
+    TDEFL_STATUS_OKAY = 0,
+    TDEFL_STATUS_DONE = 1
+} tdefl_status;
+
+/* Must map to MZ_NO_FLUSH, MZ_SYNC_FLUSH, etc. enums */
+typedef enum {
+    TDEFL_NO_FLUSH = 0,
+    TDEFL_SYNC_FLUSH = 2,
+    TDEFL_FULL_FLUSH = 3,
+    TDEFL_FINISH = 4
+} tdefl_flush;
+
+/* tdefl's compression state structure. */
+typedef struct
+{
+    tdefl_put_buf_func_ptr m_pPut_buf_func;
+    void *m_pPut_buf_user;
+    mz_uint m_flags, m_max_probes[2];
+    int m_greedy_parsing;
+    mz_uint m_adler32, m_lookahead_pos, m_lookahead_size, m_dict_size;
+    mz_uint8 *m_pLZ_code_buf, *m_pLZ_flags, *m_pOutput_buf, *m_pOutput_buf_end;
+    mz_uint m_num_flags_left, m_total_lz_bytes, m_lz_code_buf_dict_pos, m_bits_in, m_bit_buffer;
+    mz_uint m_saved_match_dist, m_saved_match_len, m_saved_lit, m_output_flush_ofs, m_output_flush_remaining, m_finished, m_block_index, m_wants_to_finish;
+    tdefl_status m_prev_return_status;
+    const void *m_pIn_buf;
+    void *m_pOut_buf;
+    size_t *m_pIn_buf_size, *m_pOut_buf_size;
+    tdefl_flush m_flush;
+    const mz_uint8 *m_pSrc;
+    size_t m_src_buf_left, m_out_buf_ofs;
+    mz_uint8 m_dict[TDEFL_LZ_DICT_SIZE + TDEFL_MAX_MATCH_LEN - 1];
+    mz_uint16 m_huff_count[TDEFL_MAX_HUFF_TABLES][TDEFL_MAX_HUFF_SYMBOLS];
+    mz_uint16 m_huff_codes[TDEFL_MAX_HUFF_TABLES][TDEFL_MAX_HUFF_SYMBOLS];
+    mz_uint8 m_huff_code_sizes[TDEFL_MAX_HUFF_TABLES][TDEFL_MAX_HUFF_SYMBOLS];
+    mz_uint8 m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE];
+    mz_uint16 m_next[TDEFL_LZ_DICT_SIZE];
+    mz_uint16 m_hash[TDEFL_LZ_HASH_SIZE];
+    mz_uint8 m_output_buf[TDEFL_OUT_BUF_SIZE];
+} tdefl_compressor;
+
+/* Initializes the compressor. */
+/* There is no corresponding deinit() function because the tdefl API's do not dynamically allocate memory. */
+/* pBut_buf_func: If NULL, output data will be supplied to the specified callback. In this case, the user should call the tdefl_compress_buffer() API for compression. */
+/* If pBut_buf_func is NULL the user should always call the tdefl_compress() API. */
+/* flags: See the above enums (TDEFL_HUFFMAN_ONLY, TDEFL_WRITE_ZLIB_HEADER, etc.) */
+tdefl_status tdefl_init(tdefl_compressor *d, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags);
+
+/* Compresses a block of data, consuming as much of the specified input buffer as possible, and writing as much compressed data to the specified output buffer as possible. */
+tdefl_status tdefl_compress(tdefl_compressor *d, const void *pIn_buf, size_t *pIn_buf_size, void *pOut_buf, size_t *pOut_buf_size, tdefl_flush flush);
+
+/* tdefl_compress_buffer() is only usable when the tdefl_init() is called with a non-NULL tdefl_put_buf_func_ptr. */
+/* tdefl_compress_buffer() always consumes the entire input buffer. */
+tdefl_status tdefl_compress_buffer(tdefl_compressor *d, const void *pIn_buf, size_t in_buf_size, tdefl_flush flush);
+
+tdefl_status tdefl_get_prev_return_status(tdefl_compressor *d);
+mz_uint32 tdefl_get_adler32(tdefl_compressor *d);
+
+/* Create tdefl_compress() flags given zlib-style compression parameters. */
+/* level may range from [0,10] (where 10 is absolute max compression, but may be much slower on some files) */
+/* window_bits may be -15 (raw deflate) or 15 (zlib) */
+/* strategy may be either MZ_DEFAULT_STRATEGY, MZ_FILTERED, MZ_HUFFMAN_ONLY, MZ_RLE, or MZ_FIXED */
+mz_uint tdefl_create_comp_flags_from_zip_params(int level, int window_bits, int strategy);
+
+/* Allocate the tdefl_compressor structure in C so that */
+/* non-C language bindings to tdefl_ API don't need to worry about */
+/* structure size and allocation mechanism. */
+tdefl_compressor *tdefl_compressor_alloc();
+void tdefl_compressor_free(tdefl_compressor *pComp);
+
+
+#pragma once
+
+/* ------------------- Low-level Decompression API Definitions */
+
+
+/* Decompression flags used by tinfl_decompress(). */
+/* TINFL_FLAG_PARSE_ZLIB_HEADER: If set, the input has a valid zlib header and ends with an adler32 checksum (it's a valid zlib stream). Otherwise, the input is a raw deflate stream. */
+/* TINFL_FLAG_HAS_MORE_INPUT: If set, there are more input bytes available beyond the end of the supplied input buffer. If clear, the input buffer contains all remaining input. */
+/* TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF: If set, the output buffer is large enough to hold the entire decompressed stream. If clear, the output buffer is at least the size of the dictionary (typically 32KB). */
+/* TINFL_FLAG_COMPUTE_ADLER32: Force adler-32 checksum computation of the decompressed bytes. */
+enum
+{
+    TINFL_FLAG_PARSE_ZLIB_HEADER = 1,
+    TINFL_FLAG_HAS_MORE_INPUT = 2,
+    TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF = 4,
+    TINFL_FLAG_COMPUTE_ADLER32 = 8
+};
+
+/* High level decompression functions: */
+/* tinfl_decompress_mem_to_heap() decompresses a block in memory to a heap block allocated via malloc(). */
+/* On entry: */
+/*  pSrc_buf, src_buf_len: Pointer and size of the Deflate or zlib source data to decompress. */
+/* On return: */
+/*  Function returns a pointer to the decompressed data, or NULL on failure. */
+/*  *pOut_len will be set to the decompressed data's size, which could be larger than src_buf_len on uncompressible data. */
+/*  The caller must call mz_free() on the returned block when it's no longer needed. */
+void *tinfl_decompress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags);
+
+/* tinfl_decompress_mem_to_mem() decompresses a block in memory to another block in memory. */
+/* Returns TINFL_DECOMPRESS_MEM_TO_MEM_FAILED on failure, or the number of bytes written on success. */
+#define TINFL_DECOMPRESS_MEM_TO_MEM_FAILED ((size_t)(-1))
+size_t tinfl_decompress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags);
+
+/* tinfl_decompress_mem_to_callback() decompresses a block in memory to an internal 32KB buffer, and a user provided callback function will be called to flush the buffer. */
+/* Returns 1 on success or 0 on failure. */
+typedef int (*tinfl_put_buf_func_ptr)(const void *pBuf, int len, void *pUser);
+int tinfl_decompress_mem_to_callback(const void *pIn_buf, size_t *pIn_buf_size, tinfl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags);
+
+struct tinfl_decompressor_tag;
+typedef struct tinfl_decompressor_tag tinfl_decompressor;
+
+/* Allocate the tinfl_decompressor structure in C so that */
+/* non-C language bindings to tinfl_ API don't need to worry about */
+/* structure size and allocation mechanism. */
+
+tinfl_decompressor *tinfl_decompressor_alloc();
+void tinfl_decompressor_free(tinfl_decompressor *pDecomp);
+
+/* Max size of LZ dictionary. */
+#define TINFL_LZ_DICT_SIZE 32768
+
+/* Return status. */
+typedef enum {
+    /* This flags indicates the inflator needs 1 or more input bytes to make forward progress, but the caller is indicating that no more are available. The compressed data */
+    /* is probably corrupted. If you call the inflator again with more bytes it'll try to continue processing the input but this is a BAD sign (either the data is corrupted or you called it incorrectly). */
+    /* If you call it again with no input you'll just get TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS again. */
+    TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS = -4,
+
+    /* This flag indicates that one or more of the input parameters was obviously bogus. (You can try calling it again, but if you get this error the calling code is wrong.) */
+    TINFL_STATUS_BAD_PARAM = -3,
+
+    /* This flags indicate the inflator is finished but the adler32 check of the uncompressed data didn't match. If you call it again it'll return TINFL_STATUS_DONE. */
+    TINFL_STATUS_ADLER32_MISMATCH = -2,
+
+    /* This flags indicate the inflator has somehow failed (bad code, corrupted input, etc.). If you call it again without resetting via tinfl_init() it it'll just keep on returning the same status failure code. */
+    TINFL_STATUS_FAILED = -1,
+
+    /* Any status code less than TINFL_STATUS_DONE must indicate a failure. */
+
+    /* This flag indicates the inflator has returned every byte of uncompressed data that it can, has consumed every byte that it needed, has successfully reached the end of the deflate stream, and */
+    /* if zlib headers and adler32 checking enabled that it has successfully checked the uncompressed data's adler32. If you call it again you'll just get TINFL_STATUS_DONE over and over again. */
+    TINFL_STATUS_DONE = 0,
+
+    /* This flag indicates the inflator MUST have more input data (even 1 byte) before it can make any more forward progress, or you need to clear the TINFL_FLAG_HAS_MORE_INPUT */
+    /* flag on the next call if you don't have any more source data. If the source data was somehow corrupted it's also possible (but unlikely) for the inflator to keep on demanding input to */
+    /* proceed, so be sure to properly set the TINFL_FLAG_HAS_MORE_INPUT flag. */
+    TINFL_STATUS_NEEDS_MORE_INPUT = 1,
+
+    /* This flag indicates the inflator definitely has 1 or more bytes of uncompressed data available, but it cannot write this data into the output buffer. */
+    /* Note if the source compressed data was corrupted it's possible for the inflator to return a lot of uncompressed data to the caller. I've been assuming you know how much uncompressed data to expect */
+    /* (either exact or worst case) and will stop calling the inflator and fail after receiving too much. In pure streaming scenarios where you have no idea how many bytes to expect this may not be possible */
+    /* so I may need to add some code to address this. */
+    TINFL_STATUS_HAS_MORE_OUTPUT = 2
+} tinfl_status;
+
+/* Initializes the decompressor to its initial state. */
+#define tinfl_init(r)     \
+    do                    \
+    {                     \
+        (r)->m_state = 0; \
+    }                     \
+    MZ_MACRO_END
+#define tinfl_get_adler32(r) (r)->m_check_adler32
+
+/* Main low-level decompressor coroutine function. This is the only function actually needed for decompression. All the other functions are just high-level helpers for improved usability. */
+/* This is a universal API, i.e. it can be used as a building block to build any desired higher level decompression API. In the limit case, it can be called once per every byte input or output. */
+tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_next, size_t *pIn_buf_size, mz_uint8 *pOut_buf_start, mz_uint8 *pOut_buf_next, size_t *pOut_buf_size, const mz_uint32 decomp_flags);
+
+/* Internal/private bits follow. */
+enum
+{
+    TINFL_MAX_HUFF_TABLES = 3,
+    TINFL_MAX_HUFF_SYMBOLS_0 = 288,
+    TINFL_MAX_HUFF_SYMBOLS_1 = 32,
+    TINFL_MAX_HUFF_SYMBOLS_2 = 19,
+    TINFL_FAST_LOOKUP_BITS = 10,
+    TINFL_FAST_LOOKUP_SIZE = 1 << TINFL_FAST_LOOKUP_BITS
+};
+
+typedef struct
+{
+    mz_uint8 m_code_size[TINFL_MAX_HUFF_SYMBOLS_0];
+    mz_int16 m_look_up[TINFL_FAST_LOOKUP_SIZE], m_tree[TINFL_MAX_HUFF_SYMBOLS_0 * 2];
+} tinfl_huff_table;
+
+#if MINIZ_HAS_64BIT_REGISTERS
+#define TINFL_USE_64BIT_BITBUF 1
+#else
+#define TINFL_USE_64BIT_BITBUF 0
+#endif
+
+#if TINFL_USE_64BIT_BITBUF
+typedef mz_uint64 tinfl_bit_buf_t;
+#define TINFL_BITBUF_SIZE (64)
+#else
+typedef mz_uint32 tinfl_bit_buf_t;
+#define TINFL_BITBUF_SIZE (32)
+#endif
+
+struct tinfl_decompressor_tag
+{
+    mz_uint32 m_state, m_num_bits, m_zhdr0, m_zhdr1, m_z_adler32, m_final, m_type, m_check_adler32, m_dist, m_counter, m_num_extra, m_table_sizes[TINFL_MAX_HUFF_TABLES];
+    tinfl_bit_buf_t m_bit_buf;
+    size_t m_dist_from_out_buf_start;
+    tinfl_huff_table m_tables[TINFL_MAX_HUFF_TABLES];
+    mz_uint8 m_raw_header[4], m_len_codes[TINFL_MAX_HUFF_SYMBOLS_0 + TINFL_MAX_HUFF_SYMBOLS_1 + 137];
+};
+
+
+
+#pragma once
+
+
+/* ------------------- ZIP archive reading/writing */
+
+#ifndef MINIZ_NO_ARCHIVE_APIS
+
+
+enum
+{
+    /* Note: These enums can be reduced as needed to save memory or stack space - they are pretty conservative. */
+    MZ_ZIP_MAX_IO_BUF_SIZE = 64 * 1024,
+    MZ_ZIP_MAX_ARCHIVE_FILENAME_SIZE = 512,
+    MZ_ZIP_MAX_ARCHIVE_FILE_COMMENT_SIZE = 512
+};
+
+typedef struct
+{
+    /* Central directory file index. */
+    mz_uint32 m_file_index;
+
+    /* Byte offset of this entry in the archive's central directory. Note we currently only support up to UINT_MAX or less bytes in the central dir. */
+    mz_uint64 m_central_dir_ofs;
+
+    /* These fields are copied directly from the zip's central dir. */
+    mz_uint16 m_version_made_by;
+    mz_uint16 m_version_needed;
+    mz_uint16 m_bit_flag;
+    mz_uint16 m_method;
+
+#ifndef MINIZ_NO_TIME
+    MZ_TIME_T m_time;
+#endif
+
+    /* CRC-32 of uncompressed data. */
+    mz_uint32 m_crc32;
+
+    /* File's compressed size. */
+    mz_uint64 m_comp_size;
+
+    /* File's uncompressed size. Note, I've seen some old archives where directory entries had 512 bytes for their uncompressed sizes, but when you try to unpack them you actually get 0 bytes. */
+    mz_uint64 m_uncomp_size;
+
+    /* Zip internal and external file attributes. */
+    mz_uint16 m_internal_attr;
+    mz_uint32 m_external_attr;
+
+    /* Entry's local header file offset in bytes. */
+    mz_uint64 m_local_header_ofs;
+
+    /* Size of comment in bytes. */
+    mz_uint32 m_comment_size;
+
+    /* MZ_TRUE if the entry appears to be a directory. */
+    mz_bool m_is_directory;
+
+    /* MZ_TRUE if the entry uses encryption/strong encryption (which miniz_zip doesn't support) */
+    mz_bool m_is_encrypted;
+
+    /* MZ_TRUE if the file is not encrypted, a patch file, and if it uses a compression method we support. */
+    mz_bool m_is_supported;
+
+    /* Filename. If string ends in '/' it's a subdirectory entry. */
+    /* Guaranteed to be zero terminated, may be truncated to fit. */
+    char m_filename[MZ_ZIP_MAX_ARCHIVE_FILENAME_SIZE];
+
+    /* Comment field. */
+    /* Guaranteed to be zero terminated, may be truncated to fit. */
+    char m_comment[MZ_ZIP_MAX_ARCHIVE_FILE_COMMENT_SIZE];
+
+} mz_zip_archive_file_stat;
+
+typedef size_t (*mz_file_read_func)(void *pOpaque, mz_uint64 file_ofs, void *pBuf, size_t n);
+typedef size_t (*mz_file_write_func)(void *pOpaque, mz_uint64 file_ofs, const void *pBuf, size_t n);
+typedef mz_bool (*mz_file_needs_keepalive)(void *pOpaque);
+
+struct mz_zip_internal_state_tag;
+typedef struct mz_zip_internal_state_tag mz_zip_internal_state;
+
+typedef enum {
+    MZ_ZIP_MODE_INVALID = 0,
+    MZ_ZIP_MODE_READING = 1,
+    MZ_ZIP_MODE_WRITING = 2,
+    MZ_ZIP_MODE_WRITING_HAS_BEEN_FINALIZED = 3
+} mz_zip_mode;
+
+typedef enum {
+    MZ_ZIP_FLAG_CASE_SENSITIVE = 0x0100,
+    MZ_ZIP_FLAG_IGNORE_PATH = 0x0200,
+    MZ_ZIP_FLAG_COMPRESSED_DATA = 0x0400,
+    MZ_ZIP_FLAG_DO_NOT_SORT_CENTRAL_DIRECTORY = 0x0800,
+    MZ_ZIP_FLAG_VALIDATE_LOCATE_FILE_FLAG = 0x1000, /* if enabled, mz_zip_reader_locate_file() will be called on each file as its validated to ensure the func finds the file in the central dir (intended for testing) */
+    MZ_ZIP_FLAG_VALIDATE_HEADERS_ONLY = 0x2000,     /* validate the local headers, but don't decompress the entire file and check the crc32 */
+    MZ_ZIP_FLAG_WRITE_ZIP64 = 0x4000,               /* always use the zip64 file format, instead of the original zip file format with automatic switch to zip64. Use as flags parameter with mz_zip_writer_init*_v2 */
+    MZ_ZIP_FLAG_WRITE_ALLOW_READING = 0x8000,
+    MZ_ZIP_FLAG_ASCII_FILENAME = 0x10000
+} mz_zip_flags;
+
+typedef enum {
+    MZ_ZIP_TYPE_INVALID = 0,
+    MZ_ZIP_TYPE_USER,
+    MZ_ZIP_TYPE_MEMORY,
+    MZ_ZIP_TYPE_HEAP,
+    MZ_ZIP_TYPE_FILE,
+    MZ_ZIP_TYPE_CFILE,
+    MZ_ZIP_TOTAL_TYPES
+} mz_zip_type;
+
+/* miniz error codes. Be sure to update mz_zip_get_error_string() if you add or modify this enum. */
+typedef enum {
+    MZ_ZIP_NO_ERROR = 0,
+    MZ_ZIP_UNDEFINED_ERROR,
+    MZ_ZIP_TOO_MANY_FILES,
+    MZ_ZIP_FILE_TOO_LARGE,
+    MZ_ZIP_UNSUPPORTED_METHOD,
+    MZ_ZIP_UNSUPPORTED_ENCRYPTION,
+    MZ_ZIP_UNSUPPORTED_FEATURE,
+    MZ_ZIP_FAILED_FINDING_CENTRAL_DIR,
+    MZ_ZIP_NOT_AN_ARCHIVE,
+    MZ_ZIP_INVALID_HEADER_OR_CORRUPTED,
+    MZ_ZIP_UNSUPPORTED_MULTIDISK,
+    MZ_ZIP_DECOMPRESSION_FAILED,
+    MZ_ZIP_COMPRESSION_FAILED,
+    MZ_ZIP_UNEXPECTED_DECOMPRESSED_SIZE,
+    MZ_ZIP_CRC_CHECK_FAILED,
+    MZ_ZIP_UNSUPPORTED_CDIR_SIZE,
+    MZ_ZIP_ALLOC_FAILED,
+    MZ_ZIP_FILE_OPEN_FAILED,
+    MZ_ZIP_FILE_CREATE_FAILED,
+    MZ_ZIP_FILE_WRITE_FAILED,
+    MZ_ZIP_FILE_READ_FAILED,
+    MZ_ZIP_FILE_CLOSE_FAILED,
+    MZ_ZIP_FILE_SEEK_FAILED,
+    MZ_ZIP_FILE_STAT_FAILED,
+    MZ_ZIP_INVALID_PARAMETER,
+    MZ_ZIP_INVALID_FILENAME,
+    MZ_ZIP_BUF_TOO_SMALL,
+    MZ_ZIP_INTERNAL_ERROR,
+    MZ_ZIP_FILE_NOT_FOUND,
+    MZ_ZIP_ARCHIVE_TOO_LARGE,
+    MZ_ZIP_VALIDATION_FAILED,
+    MZ_ZIP_WRITE_CALLBACK_FAILED,
+    MZ_ZIP_TOTAL_ERRORS
+} mz_zip_error;
+
+typedef struct
+{
+    mz_uint64 m_archive_size;
+    mz_uint64 m_central_directory_file_ofs;
+
+    /* We only support up to UINT32_MAX files in zip64 mode. */
+    mz_uint32 m_total_files;
+    mz_zip_mode m_zip_mode;
+    mz_zip_type m_zip_type;
+    mz_zip_error m_last_error;
+
+    mz_uint64 m_file_offset_alignment;
+
+    mz_alloc_func m_pAlloc;
+    mz_free_func m_pFree;
+    mz_realloc_func m_pRealloc;
+    void *m_pAlloc_opaque;
+
+    mz_file_read_func m_pRead;
+    mz_file_write_func m_pWrite;
+    mz_file_needs_keepalive m_pNeeds_keepalive;
+    void *m_pIO_opaque;
+
+    mz_zip_internal_state *m_pState;
+
+} mz_zip_archive;
+
+typedef struct
+{
+    mz_zip_archive *pZip;
+    mz_uint flags;
+
+    int status;
+#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
+    mz_uint file_crc32;
+#endif
+    mz_uint64 read_buf_size, read_buf_ofs, read_buf_avail, comp_remaining, out_buf_ofs, cur_file_ofs;
+    mz_zip_archive_file_stat file_stat;
+    void *pRead_buf;
+    void *pWrite_buf;
+
+    size_t out_blk_remain;
+
+    tinfl_decompressor inflator;
+
+} mz_zip_reader_extract_iter_state;
+
+/* -------- ZIP reading */
+
+/* Inits a ZIP archive reader. */
+/* These functions read and validate the archive's central directory. */
+mz_bool mz_zip_reader_init(mz_zip_archive *pZip, mz_uint64 size, mz_uint flags);
+
+mz_bool mz_zip_reader_init_mem(mz_zip_archive *pZip, const void *pMem, size_t size, mz_uint flags);
+
+#ifndef MINIZ_NO_STDIO
+/* Read a archive from a disk file. */
+/* file_start_ofs is the file offset where the archive actually begins, or 0. */
+/* actual_archive_size is the true total size of the archive, which may be smaller than the file's actual size on disk. If zero the entire file is treated as the archive. */
+mz_bool mz_zip_reader_init_file(mz_zip_archive *pZip, const char *pFilename, mz_uint32 flags);
+mz_bool mz_zip_reader_init_file_v2(mz_zip_archive *pZip, const char *pFilename, mz_uint flags, mz_uint64 file_start_ofs, mz_uint64 archive_size);
+
+/* Read an archive from an already opened FILE, beginning at the current file position. */
+/* The archive is assumed to be archive_size bytes long. If archive_size is < 0, then the entire rest of the file is assumed to contain the archive. */
+/* The FILE will NOT be closed when mz_zip_reader_end() is called. */
+mz_bool mz_zip_reader_init_cfile(mz_zip_archive *pZip, MZ_FILE *pFile, mz_uint64 archive_size, mz_uint flags);
+#endif
+
+/* Ends archive reading, freeing all allocations, and closing the input archive file if mz_zip_reader_init_file() was used. */
+mz_bool mz_zip_reader_end(mz_zip_archive *pZip);
+
+/* -------- ZIP reading or writing */
+
+/* Clears a mz_zip_archive struct to all zeros. */
+/* Important: This must be done before passing the struct to any mz_zip functions. */
+void mz_zip_zero_struct(mz_zip_archive *pZip);
+
+mz_zip_mode mz_zip_get_mode(mz_zip_archive *pZip);
+mz_zip_type mz_zip_get_type(mz_zip_archive *pZip);
+
+/* Returns the total number of files in the archive. */
+mz_uint mz_zip_reader_get_num_files(mz_zip_archive *pZip);
+
+mz_uint64 mz_zip_get_archive_size(mz_zip_archive *pZip);
+mz_uint64 mz_zip_get_archive_file_start_offset(mz_zip_archive *pZip);
+MZ_FILE *mz_zip_get_cfile(mz_zip_archive *pZip);
+
+/* Reads n bytes of raw archive data, starting at file offset file_ofs, to pBuf. */
+size_t mz_zip_read_archive_data(mz_zip_archive *pZip, mz_uint64 file_ofs, void *pBuf, size_t n);
+
+/* All mz_zip funcs set the m_last_error field in the mz_zip_archive struct. These functions retrieve/manipulate this field. */
+/* Note that the m_last_error functionality is not thread safe. */
+mz_zip_error mz_zip_set_last_error(mz_zip_archive *pZip, mz_zip_error err_num);
+mz_zip_error mz_zip_peek_last_error(mz_zip_archive *pZip);
+mz_zip_error mz_zip_clear_last_error(mz_zip_archive *pZip);
+mz_zip_error mz_zip_get_last_error(mz_zip_archive *pZip);
+const char *mz_zip_get_error_string(mz_zip_error mz_err);
+
+/* MZ_TRUE if the archive file entry is a directory entry. */
+mz_bool mz_zip_reader_is_file_a_directory(mz_zip_archive *pZip, mz_uint file_index);
+
+/* MZ_TRUE if the file is encrypted/strong encrypted. */
+mz_bool mz_zip_reader_is_file_encrypted(mz_zip_archive *pZip, mz_uint file_index);
+
+/* MZ_TRUE if the compression method is supported, and the file is not encrypted, and the file is not a compressed patch file. */
+mz_bool mz_zip_reader_is_file_supported(mz_zip_archive *pZip, mz_uint file_index);
+
+/* Retrieves the filename of an archive file entry. */
+/* Returns the number of bytes written to pFilename, or if filename_buf_size is 0 this function returns the number of bytes needed to fully store the filename. */
+mz_uint mz_zip_reader_get_filename(mz_zip_archive *pZip, mz_uint file_index, char *pFilename, mz_uint filename_buf_size);
+
+/* Attempts to locates a file in the archive's central directory. */
+/* Valid flags: MZ_ZIP_FLAG_CASE_SENSITIVE, MZ_ZIP_FLAG_IGNORE_PATH */
+/* Returns -1 if the file cannot be found. */
+int mz_zip_reader_locate_file(mz_zip_archive *pZip, const char *pName, const char *pComment, mz_uint flags);
+int mz_zip_reader_locate_file_v2(mz_zip_archive *pZip, const char *pName, const char *pComment, mz_uint flags, mz_uint32 *file_index);
+
+/* Returns detailed information about an archive file entry. */
+mz_bool mz_zip_reader_file_stat(mz_zip_archive *pZip, mz_uint file_index, mz_zip_archive_file_stat *pStat);
+
+/* MZ_TRUE if the file is in zip64 format. */
+/* A file is considered zip64 if it contained a zip64 end of central directory marker, or if it contained any zip64 extended file information fields in the central directory. */
+mz_bool mz_zip_is_zip64(mz_zip_archive *pZip);
+
+/* Returns the total central directory size in bytes. */
+/* The current max supported size is <= MZ_UINT32_MAX. */
+size_t mz_zip_get_central_dir_size(mz_zip_archive *pZip);
+
+/* Extracts a archive file to a memory buffer using no memory allocation. */
+/* There must be at least enough room on the stack to store the inflator's state (~34KB or so). */
+mz_bool mz_zip_reader_extract_to_mem_no_alloc(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size);
+mz_bool mz_zip_reader_extract_file_to_mem_no_alloc(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size);
+
+/* Extracts a archive file to a memory buffer. */
+mz_bool mz_zip_reader_extract_to_mem(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags);
+mz_bool mz_zip_reader_extract_file_to_mem(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags);
+
+/* Extracts a archive file to a dynamically allocated heap buffer. */
+/* The memory will be allocated via the mz_zip_archive's alloc/realloc functions. */
+/* Returns NULL and sets the last error on failure. */
+void *mz_zip_reader_extract_to_heap(mz_zip_archive *pZip, mz_uint file_index, size_t *pSize, mz_uint flags);
+void *mz_zip_reader_extract_file_to_heap(mz_zip_archive *pZip, const char *pFilename, size_t *pSize, mz_uint flags);
+
+/* Extracts a archive file using a callback function to output the file's data. */
+mz_bool mz_zip_reader_extract_to_callback(mz_zip_archive *pZip, mz_uint file_index, mz_file_write_func pCallback, void *pOpaque, mz_uint flags);
+mz_bool mz_zip_reader_extract_file_to_callback(mz_zip_archive *pZip, const char *pFilename, mz_file_write_func pCallback, void *pOpaque, mz_uint flags);
+
+/* Extract a file iteratively */
+mz_zip_reader_extract_iter_state* mz_zip_reader_extract_iter_new(mz_zip_archive *pZip, mz_uint file_index, mz_uint flags);
+mz_zip_reader_extract_iter_state* mz_zip_reader_extract_file_iter_new(mz_zip_archive *pZip, const char *pFilename, mz_uint flags);
+size_t mz_zip_reader_extract_iter_read(mz_zip_reader_extract_iter_state* pState, void* pvBuf, size_t buf_size);
+mz_bool mz_zip_reader_extract_iter_free(mz_zip_reader_extract_iter_state* pState);
+
+#ifndef MINIZ_NO_STDIO
+/* Extracts a archive file to a disk file and sets its last accessed and modified times. */
+/* This function only extracts files, not archive directory records. */
+mz_bool mz_zip_reader_extract_to_file(mz_zip_archive *pZip, mz_uint file_index, const char *pDst_filename, mz_uint flags);
+mz_bool mz_zip_reader_extract_file_to_file(mz_zip_archive *pZip, const char *pArchive_filename, const char *pDst_filename, mz_uint flags);
+
+/* Extracts a archive file starting at the current position in the destination FILE stream. */
+mz_bool mz_zip_reader_extract_to_cfile(mz_zip_archive *pZip, mz_uint file_index, MZ_FILE *File, mz_uint flags);
+mz_bool mz_zip_reader_extract_file_to_cfile(mz_zip_archive *pZip, const char *pArchive_filename, MZ_FILE *pFile, mz_uint flags);
+#endif
+
+#if 0
+/* TODO */
+	typedef void *mz_zip_streaming_extract_state_ptr;
+	mz_zip_streaming_extract_state_ptr mz_zip_streaming_extract_begin(mz_zip_archive *pZip, mz_uint file_index, mz_uint flags);
+	uint64_t mz_zip_streaming_extract_get_size(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState);
+	uint64_t mz_zip_streaming_extract_get_cur_ofs(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState);
+	mz_bool mz_zip_streaming_extract_seek(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState, uint64_t new_ofs);
+	size_t mz_zip_streaming_extract_read(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState, void *pBuf, size_t buf_size);
+	mz_bool mz_zip_streaming_extract_end(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState);
+#endif
+
+/* This function compares the archive's local headers, the optional local zip64 extended information block, and the optional descriptor following the compressed data vs. the data in the central directory. */
+/* It also validates that each file can be successfully uncompressed unless the MZ_ZIP_FLAG_VALIDATE_HEADERS_ONLY is specified. */
+mz_bool mz_zip_validate_file(mz_zip_archive *pZip, mz_uint file_index, mz_uint flags);
+
+/* Validates an entire archive by calling mz_zip_validate_file() on each file. */
+mz_bool mz_zip_validate_archive(mz_zip_archive *pZip, mz_uint flags);
+
+/* Misc utils/helpers, valid for ZIP reading or writing */
+mz_bool mz_zip_validate_mem_archive(const void *pMem, size_t size, mz_uint flags, mz_zip_error *pErr);
+mz_bool mz_zip_validate_file_archive(const char *pFilename, mz_uint flags, mz_zip_error *pErr);
+
+/* Universal end function - calls either mz_zip_reader_end() or mz_zip_writer_end(). */
+mz_bool mz_zip_end(mz_zip_archive *pZip);
+
+/* -------- ZIP writing */
+
+#ifndef MINIZ_NO_ARCHIVE_WRITING_APIS
+
+/* Inits a ZIP archive writer. */
+/*Set pZip->m_pWrite (and pZip->m_pIO_opaque) before calling mz_zip_writer_init or mz_zip_writer_init_v2*/
+/*The output is streamable, i.e. file_ofs in mz_file_write_func always increases only by n*/
+mz_bool mz_zip_writer_init(mz_zip_archive *pZip, mz_uint64 existing_size);
+mz_bool mz_zip_writer_init_v2(mz_zip_archive *pZip, mz_uint64 existing_size, mz_uint flags);
+
+mz_bool mz_zip_writer_init_heap(mz_zip_archive *pZip, size_t size_to_reserve_at_beginning, size_t initial_allocation_size);
+mz_bool mz_zip_writer_init_heap_v2(mz_zip_archive *pZip, size_t size_to_reserve_at_beginning, size_t initial_allocation_size, mz_uint flags);
+
+#ifndef MINIZ_NO_STDIO
+mz_bool mz_zip_writer_init_file(mz_zip_archive *pZip, const char *pFilename, mz_uint64 size_to_reserve_at_beginning);
+mz_bool mz_zip_writer_init_file_v2(mz_zip_archive *pZip, const char *pFilename, mz_uint64 size_to_reserve_at_beginning, mz_uint flags);
+mz_bool mz_zip_writer_init_cfile(mz_zip_archive *pZip, MZ_FILE *pFile, mz_uint flags);
+#endif
+
+/* Converts a ZIP archive reader object into a writer object, to allow efficient in-place file appends to occur on an existing archive. */
+/* For archives opened using mz_zip_reader_init_file, pFilename must be the archive's filename so it can be reopened for writing. If the file can't be reopened, mz_zip_reader_end() will be called. */
+/* For archives opened using mz_zip_reader_init_mem, the memory block must be growable using the realloc callback (which defaults to realloc unless you've overridden it). */
+/* Finally, for archives opened using mz_zip_reader_init, the mz_zip_archive's user provided m_pWrite function cannot be NULL. */
+/* Note: In-place archive modification is not recommended unless you know what you're doing, because if execution stops or something goes wrong before */
+/* the archive is finalized the file's central directory will be hosed. */
+mz_bool mz_zip_writer_init_from_reader(mz_zip_archive *pZip, const char *pFilename);
+mz_bool mz_zip_writer_init_from_reader_v2(mz_zip_archive *pZip, const char *pFilename, mz_uint flags);
+
+/* Adds the contents of a memory buffer to an archive. These functions record the current local time into the archive. */
+/* To add a directory entry, call this method with an archive name ending in a forwardslash with an empty buffer. */
+/* level_and_flags - compression level (0-10, see MZ_BEST_SPEED, MZ_BEST_COMPRESSION, etc.) logically OR'd with zero or more mz_zip_flags, or just set to MZ_DEFAULT_COMPRESSION. */
+mz_bool mz_zip_writer_add_mem(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, mz_uint level_and_flags);
+
+/* Like mz_zip_writer_add_mem(), except you can specify a file comment field, and optionally supply the function with already compressed data. */
+/* uncomp_size/uncomp_crc32 are only used if the MZ_ZIP_FLAG_COMPRESSED_DATA flag is specified. */
+mz_bool mz_zip_writer_add_mem_ex(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags,
+                                 mz_uint64 uncomp_size, mz_uint32 uncomp_crc32);
+
+mz_bool mz_zip_writer_add_mem_ex_v2(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags,
+                                    mz_uint64 uncomp_size, mz_uint32 uncomp_crc32, MZ_TIME_T *last_modified, const char *user_extra_data_local, mz_uint user_extra_data_local_len,
+                                    const char *user_extra_data_central, mz_uint user_extra_data_central_len);
+
+#ifndef MINIZ_NO_STDIO
+/* Adds the contents of a disk file to an archive. This function also records the disk file's modified time into the archive. */
+/* level_and_flags - compression level (0-10, see MZ_BEST_SPEED, MZ_BEST_COMPRESSION, etc.) logically OR'd with zero or more mz_zip_flags, or just set to MZ_DEFAULT_COMPRESSION. */
+mz_bool mz_zip_writer_add_file(mz_zip_archive *pZip, const char *pArchive_name, const char *pSrc_filename, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags);
+
+/* Like mz_zip_writer_add_file(), except the file data is read from the specified FILE stream. */
+mz_bool mz_zip_writer_add_cfile(mz_zip_archive *pZip, const char *pArchive_name, MZ_FILE *pSrc_file, mz_uint64 size_to_add,
+                                const MZ_TIME_T *pFile_time, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags, const char *user_extra_data_local, mz_uint user_extra_data_local_len,
+                                const char *user_extra_data_central, mz_uint user_extra_data_central_len);
+#endif
+
+/* Adds a file to an archive by fully cloning the data from another archive. */
+/* This function fully clones the source file's compressed data (no recompression), along with its full filename, extra data (it may add or modify the zip64 local header extra data field), and the optional descriptor following the compressed data. */
+mz_bool mz_zip_writer_add_from_zip_reader(mz_zip_archive *pZip, mz_zip_archive *pSource_zip, mz_uint src_file_index);
+
+/* Finalizes the archive by writing the central directory records followed by the end of central directory record. */
+/* After an archive is finalized, the only valid call on the mz_zip_archive struct is mz_zip_writer_end(). */
+/* An archive must be manually finalized by calling this function for it to be valid. */
+mz_bool mz_zip_writer_finalize_archive(mz_zip_archive *pZip);
+
+/* Finalizes a heap archive, returning a poiner to the heap block and its size. */
+/* The heap block will be allocated using the mz_zip_archive's alloc/realloc callbacks. */
+mz_bool mz_zip_writer_finalize_heap_archive(mz_zip_archive *pZip, void **ppBuf, size_t *pSize);
+
+/* Ends archive writing, freeing all allocations, and closing the output file if mz_zip_writer_init_file() was used. */
+/* Note for the archive to be valid, it *must* have been finalized before ending (this function will not do it for you). */
+mz_bool mz_zip_writer_end(mz_zip_archive *pZip);
+
+/* -------- Misc. high-level helper functions: */
+
+/* mz_zip_add_mem_to_archive_file_in_place() efficiently (but not atomically) appends a memory blob to a ZIP archive. */
+/* Note this is NOT a fully safe operation. If it crashes or dies in some way your archive can be left in a screwed up state (without a central directory). */
+/* level_and_flags - compression level (0-10, see MZ_BEST_SPEED, MZ_BEST_COMPRESSION, etc.) logically OR'd with zero or more mz_zip_flags, or just set to MZ_DEFAULT_COMPRESSION. */
+/* TODO: Perhaps add an option to leave the existing central dir in place in case the add dies? We could then truncate the file (so the old central dir would be at the end) if something goes wrong. */
+mz_bool mz_zip_add_mem_to_archive_file_in_place(const char *pZip_filename, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags);
+mz_bool mz_zip_add_mem_to_archive_file_in_place_v2(const char *pZip_filename, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags, mz_zip_error *pErr);
+
+/* Reads a single file from an archive into a heap block. */
+/* If pComment is not NULL, only the file with the specified comment will be extracted. */
+/* Returns NULL on failure. */
+void *mz_zip_extract_archive_file_to_heap(const char *pZip_filename, const char *pArchive_name, size_t *pSize, mz_uint flags);
+void *mz_zip_extract_archive_file_to_heap_v2(const char *pZip_filename, const char *pArchive_name, const char *pComment, size_t *pSize, mz_uint flags, mz_zip_error *pErr);
+
+#endif /* #ifndef MINIZ_NO_ARCHIVE_WRITING_APIS */
+
+
+
+#endif /* MINIZ_NO_ARCHIVE_APIS */
+
+} // namespace miniz
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/miniz_wrapper.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/miniz_wrapper.hpp
new file mode 100644
index 0000000000..a63f2e81d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/miniz/miniz_wrapper.hpp
@@ -0,0 +1,132 @@
+#pragma once
+
+#include <stdexcept>
+#include <string>
+
+#include "miniz.hpp"
+
+namespace lbug {
+
+enum class MiniZStreamType : uint8_t { MINIZ_TYPE_NONE, MINIZ_TYPE_INFLATE, MINIZ_TYPE_DEFLATE };
+
+struct MiniZStream {
+    static constexpr uint8_t GZIP_HEADER_MINSIZE = 10;
+    static constexpr uint8_t GZIP_FOOTER_SIZE = 8;
+    static constexpr uint8_t GZIP_COMPRESSION_DEFLATE = 0x08;
+    static constexpr unsigned char GZIP_FLAG_UNSUPPORTED = 0x1 | 0x2 | 0x4 | 0x10 | 0x20;
+
+public:
+    MiniZStream() : type(MiniZStreamType::MINIZ_TYPE_NONE) {
+        memset(&stream, 0, sizeof(miniz::mz_stream));
+    }
+    ~MiniZStream() {
+        switch (type) {
+        case MiniZStreamType::MINIZ_TYPE_INFLATE:
+            miniz::mz_inflateEnd(&stream);
+            break;
+        case MiniZStreamType::MINIZ_TYPE_DEFLATE:
+            miniz::mz_deflateEnd(&stream);
+            break;
+        default:
+            break;
+        }
+    }
+    void FormatException(std::string error_msg) { throw std::runtime_error(error_msg); }
+    void FormatException(const char* error_msg, int mz_ret) {
+        auto err = miniz::mz_error(mz_ret);
+        FormatException(error_msg + std::string(": ") + (err ? err : "Unknown error code"));
+    }
+    void Decompress(
+        const char* compressed_data, size_t compressed_size, char* out_data, size_t out_size) {
+        auto mz_ret = mz_inflateInit2(&stream, -MZ_DEFAULT_WINDOW_BITS);
+        if (mz_ret != miniz::MZ_OK) {
+            FormatException("Failed to initialize miniz", mz_ret);
+        }
+        type = MiniZStreamType::MINIZ_TYPE_INFLATE;
+
+        if (compressed_size < GZIP_HEADER_MINSIZE) {
+            FormatException(
+                "Failed to decompress GZIP block: compressed size is less than gzip header size");
+        }
+        auto gzip_hdr = (const unsigned char*)compressed_data;
+        if (gzip_hdr[0] != 0x1F || gzip_hdr[1] != 0x8B || gzip_hdr[2] != GZIP_COMPRESSION_DEFLATE ||
+            gzip_hdr[3] & GZIP_FLAG_UNSUPPORTED) {
+            FormatException("Input is invalid/unsupported GZIP stream");
+        }
+
+        stream.next_in = (const unsigned char*)compressed_data + GZIP_HEADER_MINSIZE;
+        stream.avail_in = compressed_size - GZIP_HEADER_MINSIZE;
+        stream.next_out = (unsigned char*)out_data;
+        stream.avail_out = out_size;
+
+        mz_ret = mz_inflate(&stream, miniz::MZ_FINISH);
+        if (mz_ret != miniz::MZ_OK && mz_ret != miniz::MZ_STREAM_END) {
+            FormatException("Failed to decompress GZIP block", mz_ret);
+        }
+    }
+    size_t MaxCompressedLength(size_t input_size) {
+        return miniz::mz_compressBound(input_size) + GZIP_HEADER_MINSIZE + GZIP_FOOTER_SIZE;
+    }
+    static void InitializeGZIPHeader(unsigned char* gzip_header) {
+        memset(gzip_header, 0, GZIP_HEADER_MINSIZE);
+        gzip_header[0] = 0x1F;
+        gzip_header[1] = 0x8B;
+        gzip_header[2] = GZIP_COMPRESSION_DEFLATE;
+        gzip_header[3] = 0;
+        gzip_header[4] = 0;
+        gzip_header[5] = 0;
+        gzip_header[6] = 0;
+        gzip_header[7] = 0;
+        gzip_header[8] = 0;
+        gzip_header[9] = 0xFF;
+    }
+
+    static void InitializeGZIPFooter(
+        unsigned char* gzip_footer, miniz::mz_ulong crc, uint64_t uncompressed_size) {
+        gzip_footer[0] = crc & 0xFF;
+        gzip_footer[1] = (crc >> 8) & 0xFF;
+        gzip_footer[2] = (crc >> 16) & 0xFF;
+        gzip_footer[3] = (crc >> 24) & 0xFF;
+        gzip_footer[4] = uncompressed_size & 0xFF;
+        gzip_footer[5] = (uncompressed_size >> 8) & 0xFF;
+        gzip_footer[6] = (uncompressed_size >> 16) & 0xFF;
+        gzip_footer[7] = (uncompressed_size >> 24) & 0xFF;
+    }
+
+    void Compress(
+        const char* uncompressed_data, size_t uncompressed_size, char* out_data, size_t* out_size) {
+        auto mz_ret = mz_deflateInit2(
+            &stream, miniz::MZ_DEFAULT_LEVEL, MZ_DEFLATED, -MZ_DEFAULT_WINDOW_BITS, 1, 0);
+        if (mz_ret != miniz::MZ_OK) {
+            FormatException("Failed to initialize miniz", mz_ret);
+        }
+        type = MiniZStreamType::MINIZ_TYPE_DEFLATE;
+
+        auto gzip_header = (unsigned char*)out_data;
+        InitializeGZIPHeader(gzip_header);
+
+        auto gzip_body = gzip_header + GZIP_HEADER_MINSIZE;
+
+        stream.next_in = (const unsigned char*)uncompressed_data;
+        stream.avail_in = uncompressed_size;
+        stream.next_out = gzip_body;
+        stream.avail_out = *out_size - GZIP_HEADER_MINSIZE;
+
+        mz_ret = mz_deflate(&stream, miniz::MZ_FINISH);
+        if (mz_ret != miniz::MZ_OK && mz_ret != miniz::MZ_STREAM_END) {
+            FormatException("Failed to compress GZIP block", mz_ret);
+        }
+        auto gzip_footer = gzip_body + stream.total_out;
+        auto crc = miniz::mz_crc32(
+            MZ_CRC32_INIT, (const unsigned char*)uncompressed_data, uncompressed_size);
+        InitializeGZIPFooter(gzip_footer, crc, uncompressed_size);
+
+        *out_size = stream.total_out + GZIP_HEADER_MINSIZE + GZIP_FOOTER_SIZE;
+    }
+
+private:
+    miniz::mz_stream stream;
+    MiniZStreamType type;
+};
+
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/nlohmann_json/json.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/nlohmann_json/json.hpp
new file mode 100644
index 0000000000..48d17df7f0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/nlohmann_json/json.hpp
@@ -0,0 +1,24596 @@
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+/****************************************************************************\
+ * Note on documentation: The source files contain links to the online      *
+ * documentation of the public API at https://json.nlohmann.me. This URL    *
+ * contains the most recent documentation and should also be applicable to  *
+ * previous versions; documentation for deprecated functions is not         *
+ * removed, but marked deprecated. See "Generate documentation" section in  *
+ * file docs/README.md.                                                     *
+\****************************************************************************/
+
+#ifndef INCLUDE_NLOHMANN_JSON_HPP_
+#define INCLUDE_NLOHMANN_JSON_HPP_
+
+#include <algorithm> // all_of, find, for_each
+#include <cstddef> // nullptr_t, ptrdiff_t, size_t
+#include <functional> // hash, less
+#include <initializer_list> // initializer_list
+#ifndef JSON_NO_IO
+    #include <iosfwd> // istream, ostream
+#endif  // JSON_NO_IO
+#include <iterator> // random_access_iterator_tag
+#include <memory> // unique_ptr
+#include <numeric> // accumulate
+#include <string> // string, stoi, to_string
+#include <utility> // declval, forward, move, pair, swap
+#include <vector> // vector
+
+// #include <nlohmann/adl_serializer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <utility>
+
+// #include <nlohmann/detail/abi_macros.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// This file contains all macro definitions affecting or depending on the ABI
+
+#ifndef JSON_SKIP_LIBRARY_VERSION_CHECK
+    #if defined(NLOHMANN_JSON_VERSION_MAJOR) && defined(NLOHMANN_JSON_VERSION_MINOR) && defined(NLOHMANN_JSON_VERSION_PATCH)
+        #if NLOHMANN_JSON_VERSION_MAJOR != 3 || NLOHMANN_JSON_VERSION_MINOR != 11 || NLOHMANN_JSON_VERSION_PATCH != 2
+            #warning "Already included a different version of the library!"
+        #endif
+    #endif
+#endif
+
+#define NLOHMANN_JSON_VERSION_MAJOR 3   // NOLINT(modernize-macro-to-enum)
+#define NLOHMANN_JSON_VERSION_MINOR 11  // NOLINT(modernize-macro-to-enum)
+#define NLOHMANN_JSON_VERSION_PATCH 2   // NOLINT(modernize-macro-to-enum)
+
+#ifndef JSON_DIAGNOSTICS
+    #define JSON_DIAGNOSTICS 0
+#endif
+
+#ifndef JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+    #define JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON 0
+#endif
+
+#if JSON_DIAGNOSTICS
+    #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diag
+#else
+    #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS
+#endif
+
+#if JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+    #define NLOHMANN_JSON_ABI_TAG_LEGACY_DISCARDED_VALUE_COMPARISON _ldvcmp
+#else
+    #define NLOHMANN_JSON_ABI_TAG_LEGACY_DISCARDED_VALUE_COMPARISON
+#endif
+
+#ifndef NLOHMANN_JSON_NAMESPACE_NO_VERSION
+    #define NLOHMANN_JSON_NAMESPACE_NO_VERSION 0
+#endif
+
+// Construct the namespace ABI tags component
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b) json_abi ## a ## b
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT(a, b) \
+    NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b)
+
+#define NLOHMANN_JSON_ABI_TAGS                                       \
+    NLOHMANN_JSON_ABI_TAGS_CONCAT(                                   \
+            NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS,                       \
+            NLOHMANN_JSON_ABI_TAG_LEGACY_DISCARDED_VALUE_COMPARISON)
+
+// Construct the namespace version component
+#define NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT_EX(major, minor, patch) \
+    _v ## major ## _ ## minor ## _ ## patch
+#define NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT(major, minor, patch) \
+    NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT_EX(major, minor, patch)
+
+#if NLOHMANN_JSON_NAMESPACE_NO_VERSION
+#define NLOHMANN_JSON_NAMESPACE_VERSION
+#else
+#define NLOHMANN_JSON_NAMESPACE_VERSION                                 \
+    NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT(NLOHMANN_JSON_VERSION_MAJOR, \
+                                           NLOHMANN_JSON_VERSION_MINOR, \
+                                           NLOHMANN_JSON_VERSION_PATCH)
+#endif
+
+// Combine namespace components
+#define NLOHMANN_JSON_NAMESPACE_CONCAT_EX(a, b) a ## b
+#define NLOHMANN_JSON_NAMESPACE_CONCAT(a, b) \
+    NLOHMANN_JSON_NAMESPACE_CONCAT_EX(a, b)
+
+#ifndef NLOHMANN_JSON_NAMESPACE
+#define NLOHMANN_JSON_NAMESPACE               \
+    nlohmann::NLOHMANN_JSON_NAMESPACE_CONCAT( \
+            NLOHMANN_JSON_ABI_TAGS,           \
+            NLOHMANN_JSON_NAMESPACE_VERSION)
+#endif
+
+#ifndef NLOHMANN_JSON_NAMESPACE_BEGIN
+#define NLOHMANN_JSON_NAMESPACE_BEGIN                \
+    namespace nlohmann                               \
+    {                                                \
+    inline namespace NLOHMANN_JSON_NAMESPACE_CONCAT( \
+                NLOHMANN_JSON_ABI_TAGS,              \
+                NLOHMANN_JSON_NAMESPACE_VERSION)     \
+    {
+#endif
+
+#ifndef NLOHMANN_JSON_NAMESPACE_END
+#define NLOHMANN_JSON_NAMESPACE_END                                     \
+    }  /* namespace (inline namespace) NOLINT(readability/namespace) */ \
+    }  // namespace nlohmann
+#endif
+
+// #include <nlohmann/detail/conversions/from_json.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // transform
+#include <array> // array
+#include <forward_list> // forward_list
+#include <iterator> // inserter, front_inserter, end
+#include <map> // map
+#include <string> // string
+#include <tuple> // tuple, make_tuple
+#include <type_traits> // is_arithmetic, is_same, is_enum, underlying_type, is_convertible
+#include <unordered_map> // unordered_map
+#include <utility> // pair, declval
+#include <valarray> // valarray
+
+// #include <nlohmann/detail/exceptions.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // nullptr_t
+#include <exception> // exception
+#include <stdexcept> // runtime_error
+#include <string> // to_string
+#include <vector> // vector
+
+// #include <nlohmann/detail/value_t.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <cstddef> // size_t
+#include <cstdint> // uint8_t
+#include <string> // string
+
+// #include <nlohmann/detail/macro_scope.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <utility> // declval, pair
+// #include <nlohmann/detail/meta/detected.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <type_traits>
+
+// #include <nlohmann/detail/meta/void_t.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename ...Ts> struct make_void
+{
+    using type = void;
+};
+template<typename ...Ts> using void_t = typename make_void<Ts...>::type;
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+// https://en.cppreference.com/w/cpp/experimental/is_detected
+struct nonesuch
+{
+    nonesuch() = delete;
+    ~nonesuch() = delete;
+    nonesuch(nonesuch const&) = delete;
+    nonesuch(nonesuch const&&) = delete;
+    void operator=(nonesuch const&) = delete;
+    void operator=(nonesuch&&) = delete;
+};
+
+template<class Default,
+         class AlwaysVoid,
+         template<class...> class Op,
+         class... Args>
+struct detector
+{
+    using value_t = std::false_type;
+    using type = Default;
+};
+
+template<class Default, template<class...> class Op, class... Args>
+struct detector<Default, void_t<Op<Args...>>, Op, Args...>
+{
+    using value_t = std::true_type;
+    using type = Op<Args...>;
+};
+
+template<template<class...> class Op, class... Args>
+using is_detected = typename detector<nonesuch, void, Op, Args...>::value_t;
+
+template<template<class...> class Op, class... Args>
+struct is_detected_lazy : is_detected<Op, Args...> { };
+
+template<template<class...> class Op, class... Args>
+using detected_t = typename detector<nonesuch, void, Op, Args...>::type;
+
+template<class Default, template<class...> class Op, class... Args>
+using detected_or = detector<Default, void, Op, Args...>;
+
+template<class Default, template<class...> class Op, class... Args>
+using detected_or_t = typename detected_or<Default, Op, Args...>::type;
+
+template<class Expected, template<class...> class Op, class... Args>
+using is_detected_exact = std::is_same<Expected, detected_t<Op, Args...>>;
+
+template<class To, template<class...> class Op, class... Args>
+using is_detected_convertible =
+    std::is_convertible<detected_t<Op, Args...>, To>;
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/thirdparty/hedley/hedley.hpp>
+
+
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-FileCopyrightText: 2016-2021 Evan Nemerson <evan@nemerson.com>
+// SPDX-License-Identifier: MIT
+
+/* Hedley - https://nemequ.github.io/hedley
+ * Created by Evan Nemerson <evan@nemerson.com>
+ */
+
+#if !defined(JSON_HEDLEY_VERSION) || (JSON_HEDLEY_VERSION < 15)
+#if defined(JSON_HEDLEY_VERSION)
+    #undef JSON_HEDLEY_VERSION
+#endif
+#define JSON_HEDLEY_VERSION 15
+
+#if defined(JSON_HEDLEY_STRINGIFY_EX)
+    #undef JSON_HEDLEY_STRINGIFY_EX
+#endif
+#define JSON_HEDLEY_STRINGIFY_EX(x) #x
+
+#if defined(JSON_HEDLEY_STRINGIFY)
+    #undef JSON_HEDLEY_STRINGIFY
+#endif
+#define JSON_HEDLEY_STRINGIFY(x) JSON_HEDLEY_STRINGIFY_EX(x)
+
+#if defined(JSON_HEDLEY_CONCAT_EX)
+    #undef JSON_HEDLEY_CONCAT_EX
+#endif
+#define JSON_HEDLEY_CONCAT_EX(a,b) a##b
+
+#if defined(JSON_HEDLEY_CONCAT)
+    #undef JSON_HEDLEY_CONCAT
+#endif
+#define JSON_HEDLEY_CONCAT(a,b) JSON_HEDLEY_CONCAT_EX(a,b)
+
+#if defined(JSON_HEDLEY_CONCAT3_EX)
+    #undef JSON_HEDLEY_CONCAT3_EX
+#endif
+#define JSON_HEDLEY_CONCAT3_EX(a,b,c) a##b##c
+
+#if defined(JSON_HEDLEY_CONCAT3)
+    #undef JSON_HEDLEY_CONCAT3
+#endif
+#define JSON_HEDLEY_CONCAT3(a,b,c) JSON_HEDLEY_CONCAT3_EX(a,b,c)
+
+#if defined(JSON_HEDLEY_VERSION_ENCODE)
+    #undef JSON_HEDLEY_VERSION_ENCODE
+#endif
+#define JSON_HEDLEY_VERSION_ENCODE(major,minor,revision) (((major) * 1000000) + ((minor) * 1000) + (revision))
+
+#if defined(JSON_HEDLEY_VERSION_DECODE_MAJOR)
+    #undef JSON_HEDLEY_VERSION_DECODE_MAJOR
+#endif
+#define JSON_HEDLEY_VERSION_DECODE_MAJOR(version) ((version) / 1000000)
+
+#if defined(JSON_HEDLEY_VERSION_DECODE_MINOR)
+    #undef JSON_HEDLEY_VERSION_DECODE_MINOR
+#endif
+#define JSON_HEDLEY_VERSION_DECODE_MINOR(version) (((version) % 1000000) / 1000)
+
+#if defined(JSON_HEDLEY_VERSION_DECODE_REVISION)
+    #undef JSON_HEDLEY_VERSION_DECODE_REVISION
+#endif
+#define JSON_HEDLEY_VERSION_DECODE_REVISION(version) ((version) % 1000)
+
+#if defined(JSON_HEDLEY_GNUC_VERSION)
+    #undef JSON_HEDLEY_GNUC_VERSION
+#endif
+#if defined(__GNUC__) && defined(__GNUC_PATCHLEVEL__)
+    #define JSON_HEDLEY_GNUC_VERSION JSON_HEDLEY_VERSION_ENCODE(__GNUC__, __GNUC_MINOR__, __GNUC_PATCHLEVEL__)
+#elif defined(__GNUC__)
+    #define JSON_HEDLEY_GNUC_VERSION JSON_HEDLEY_VERSION_ENCODE(__GNUC__, __GNUC_MINOR__, 0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_VERSION_CHECK)
+    #undef JSON_HEDLEY_GNUC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_GNUC_VERSION)
+    #define JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_GNUC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_MSVC_VERSION)
+    #undef JSON_HEDLEY_MSVC_VERSION
+#endif
+#if defined(_MSC_FULL_VER) && (_MSC_FULL_VER >= 140000000) && !defined(__ICL)
+    #define JSON_HEDLEY_MSVC_VERSION JSON_HEDLEY_VERSION_ENCODE(_MSC_FULL_VER / 10000000, (_MSC_FULL_VER % 10000000) / 100000, (_MSC_FULL_VER % 100000) / 100)
+#elif defined(_MSC_FULL_VER) && !defined(__ICL)
+    #define JSON_HEDLEY_MSVC_VERSION JSON_HEDLEY_VERSION_ENCODE(_MSC_FULL_VER / 1000000, (_MSC_FULL_VER % 1000000) / 10000, (_MSC_FULL_VER % 10000) / 10)
+#elif defined(_MSC_VER) && !defined(__ICL)
+    #define JSON_HEDLEY_MSVC_VERSION JSON_HEDLEY_VERSION_ENCODE(_MSC_VER / 100, _MSC_VER % 100, 0)
+#endif
+
+#if defined(JSON_HEDLEY_MSVC_VERSION_CHECK)
+    #undef JSON_HEDLEY_MSVC_VERSION_CHECK
+#endif
+#if !defined(JSON_HEDLEY_MSVC_VERSION)
+    #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (0)
+#elif defined(_MSC_VER) && (_MSC_VER >= 1400)
+    #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (_MSC_FULL_VER >= ((major * 10000000) + (minor * 100000) + (patch)))
+#elif defined(_MSC_VER) && (_MSC_VER >= 1200)
+    #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (_MSC_FULL_VER >= ((major * 1000000) + (minor * 10000) + (patch)))
+#else
+    #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (_MSC_VER >= ((major * 100) + (minor)))
+#endif
+
+#if defined(JSON_HEDLEY_INTEL_VERSION)
+    #undef JSON_HEDLEY_INTEL_VERSION
+#endif
+#if defined(__INTEL_COMPILER) && defined(__INTEL_COMPILER_UPDATE) && !defined(__ICL)
+    #define JSON_HEDLEY_INTEL_VERSION JSON_HEDLEY_VERSION_ENCODE(__INTEL_COMPILER / 100, __INTEL_COMPILER % 100, __INTEL_COMPILER_UPDATE)
+#elif defined(__INTEL_COMPILER) && !defined(__ICL)
+    #define JSON_HEDLEY_INTEL_VERSION JSON_HEDLEY_VERSION_ENCODE(__INTEL_COMPILER / 100, __INTEL_COMPILER % 100, 0)
+#endif
+
+#if defined(JSON_HEDLEY_INTEL_VERSION_CHECK)
+    #undef JSON_HEDLEY_INTEL_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_INTEL_VERSION)
+    #define JSON_HEDLEY_INTEL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_INTEL_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_INTEL_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_INTEL_CL_VERSION)
+    #undef JSON_HEDLEY_INTEL_CL_VERSION
+#endif
+#if defined(__INTEL_COMPILER) && defined(__INTEL_COMPILER_UPDATE) && defined(__ICL)
+    #define JSON_HEDLEY_INTEL_CL_VERSION JSON_HEDLEY_VERSION_ENCODE(__INTEL_COMPILER, __INTEL_COMPILER_UPDATE, 0)
+#endif
+
+#if defined(JSON_HEDLEY_INTEL_CL_VERSION_CHECK)
+    #undef JSON_HEDLEY_INTEL_CL_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_INTEL_CL_VERSION)
+    #define JSON_HEDLEY_INTEL_CL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_INTEL_CL_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_INTEL_CL_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_PGI_VERSION)
+    #undef JSON_HEDLEY_PGI_VERSION
+#endif
+#if defined(__PGI) && defined(__PGIC__) && defined(__PGIC_MINOR__) && defined(__PGIC_PATCHLEVEL__)
+    #define JSON_HEDLEY_PGI_VERSION JSON_HEDLEY_VERSION_ENCODE(__PGIC__, __PGIC_MINOR__, __PGIC_PATCHLEVEL__)
+#endif
+
+#if defined(JSON_HEDLEY_PGI_VERSION_CHECK)
+    #undef JSON_HEDLEY_PGI_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_PGI_VERSION)
+    #define JSON_HEDLEY_PGI_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_PGI_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_PGI_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_SUNPRO_VERSION)
+    #undef JSON_HEDLEY_SUNPRO_VERSION
+#endif
+#if defined(__SUNPRO_C) && (__SUNPRO_C > 0x1000)
+    #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((((__SUNPRO_C >> 16) & 0xf) * 10) + ((__SUNPRO_C >> 12) & 0xf), (((__SUNPRO_C >> 8) & 0xf) * 10) + ((__SUNPRO_C >> 4) & 0xf), (__SUNPRO_C & 0xf) * 10)
+#elif defined(__SUNPRO_C)
+    #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((__SUNPRO_C >> 8) & 0xf, (__SUNPRO_C >> 4) & 0xf, (__SUNPRO_C) & 0xf)
+#elif defined(__SUNPRO_CC) && (__SUNPRO_CC > 0x1000)
+    #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((((__SUNPRO_CC >> 16) & 0xf) * 10) + ((__SUNPRO_CC >> 12) & 0xf), (((__SUNPRO_CC >> 8) & 0xf) * 10) + ((__SUNPRO_CC >> 4) & 0xf), (__SUNPRO_CC & 0xf) * 10)
+#elif defined(__SUNPRO_CC)
+    #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((__SUNPRO_CC >> 8) & 0xf, (__SUNPRO_CC >> 4) & 0xf, (__SUNPRO_CC) & 0xf)
+#endif
+
+#if defined(JSON_HEDLEY_SUNPRO_VERSION_CHECK)
+    #undef JSON_HEDLEY_SUNPRO_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_SUNPRO_VERSION)
+    #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_SUNPRO_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_EMSCRIPTEN_VERSION)
+    #undef JSON_HEDLEY_EMSCRIPTEN_VERSION
+#endif
+#if defined(__EMSCRIPTEN__)
+    #define JSON_HEDLEY_EMSCRIPTEN_VERSION JSON_HEDLEY_VERSION_ENCODE(__EMSCRIPTEN_major__, __EMSCRIPTEN_minor__, __EMSCRIPTEN_tiny__)
+#endif
+
+#if defined(JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK)
+    #undef JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_EMSCRIPTEN_VERSION)
+    #define JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_EMSCRIPTEN_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_ARM_VERSION)
+    #undef JSON_HEDLEY_ARM_VERSION
+#endif
+#if defined(__CC_ARM) && defined(__ARMCOMPILER_VERSION)
+    #define JSON_HEDLEY_ARM_VERSION JSON_HEDLEY_VERSION_ENCODE(__ARMCOMPILER_VERSION / 1000000, (__ARMCOMPILER_VERSION % 1000000) / 10000, (__ARMCOMPILER_VERSION % 10000) / 100)
+#elif defined(__CC_ARM) && defined(__ARMCC_VERSION)
+    #define JSON_HEDLEY_ARM_VERSION JSON_HEDLEY_VERSION_ENCODE(__ARMCC_VERSION / 1000000, (__ARMCC_VERSION % 1000000) / 10000, (__ARMCC_VERSION % 10000) / 100)
+#endif
+
+#if defined(JSON_HEDLEY_ARM_VERSION_CHECK)
+    #undef JSON_HEDLEY_ARM_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_ARM_VERSION)
+    #define JSON_HEDLEY_ARM_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_ARM_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_ARM_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_IBM_VERSION)
+    #undef JSON_HEDLEY_IBM_VERSION
+#endif
+#if defined(__ibmxl__)
+    #define JSON_HEDLEY_IBM_VERSION JSON_HEDLEY_VERSION_ENCODE(__ibmxl_version__, __ibmxl_release__, __ibmxl_modification__)
+#elif defined(__xlC__) && defined(__xlC_ver__)
+    #define JSON_HEDLEY_IBM_VERSION JSON_HEDLEY_VERSION_ENCODE(__xlC__ >> 8, __xlC__ & 0xff, (__xlC_ver__ >> 8) & 0xff)
+#elif defined(__xlC__)
+    #define JSON_HEDLEY_IBM_VERSION JSON_HEDLEY_VERSION_ENCODE(__xlC__ >> 8, __xlC__ & 0xff, 0)
+#endif
+
+#if defined(JSON_HEDLEY_IBM_VERSION_CHECK)
+    #undef JSON_HEDLEY_IBM_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_IBM_VERSION)
+    #define JSON_HEDLEY_IBM_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_IBM_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_IBM_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_VERSION)
+    #undef JSON_HEDLEY_TI_VERSION
+#endif
+#if \
+    defined(__TI_COMPILER_VERSION__) && \
+    ( \
+      defined(__TMS470__) || defined(__TI_ARM__) || \
+      defined(__MSP430__) || \
+      defined(__TMS320C2000__) \
+    )
+#if (__TI_COMPILER_VERSION__ >= 16000000)
+    #define JSON_HEDLEY_TI_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+#endif
+
+#if defined(JSON_HEDLEY_TI_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_VERSION)
+    #define JSON_HEDLEY_TI_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL2000_VERSION)
+    #undef JSON_HEDLEY_TI_CL2000_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__TMS320C2000__)
+    #define JSON_HEDLEY_TI_CL2000_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL2000_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CL2000_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CL2000_VERSION)
+    #define JSON_HEDLEY_TI_CL2000_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL2000_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CL2000_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL430_VERSION)
+    #undef JSON_HEDLEY_TI_CL430_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__MSP430__)
+    #define JSON_HEDLEY_TI_CL430_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL430_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CL430_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CL430_VERSION)
+    #define JSON_HEDLEY_TI_CL430_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL430_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CL430_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_ARMCL_VERSION)
+    #undef JSON_HEDLEY_TI_ARMCL_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && (defined(__TMS470__) || defined(__TI_ARM__))
+    #define JSON_HEDLEY_TI_ARMCL_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_ARMCL_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_ARMCL_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_ARMCL_VERSION)
+    #define JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_ARMCL_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL6X_VERSION)
+    #undef JSON_HEDLEY_TI_CL6X_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__TMS320C6X__)
+    #define JSON_HEDLEY_TI_CL6X_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL6X_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CL6X_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CL6X_VERSION)
+    #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL6X_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL7X_VERSION)
+    #undef JSON_HEDLEY_TI_CL7X_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__C7000__)
+    #define JSON_HEDLEY_TI_CL7X_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL7X_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CL7X_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CL7X_VERSION)
+    #define JSON_HEDLEY_TI_CL7X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL7X_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CL7X_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CLPRU_VERSION)
+    #undef JSON_HEDLEY_TI_CLPRU_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__PRU__)
+    #define JSON_HEDLEY_TI_CLPRU_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CLPRU_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CLPRU_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CLPRU_VERSION)
+    #define JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CLPRU_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_CRAY_VERSION)
+    #undef JSON_HEDLEY_CRAY_VERSION
+#endif
+#if defined(_CRAYC)
+    #if defined(_RELEASE_PATCHLEVEL)
+        #define JSON_HEDLEY_CRAY_VERSION JSON_HEDLEY_VERSION_ENCODE(_RELEASE_MAJOR, _RELEASE_MINOR, _RELEASE_PATCHLEVEL)
+    #else
+        #define JSON_HEDLEY_CRAY_VERSION JSON_HEDLEY_VERSION_ENCODE(_RELEASE_MAJOR, _RELEASE_MINOR, 0)
+    #endif
+#endif
+
+#if defined(JSON_HEDLEY_CRAY_VERSION_CHECK)
+    #undef JSON_HEDLEY_CRAY_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_CRAY_VERSION)
+    #define JSON_HEDLEY_CRAY_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_CRAY_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_CRAY_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_IAR_VERSION)
+    #undef JSON_HEDLEY_IAR_VERSION
+#endif
+#if defined(__IAR_SYSTEMS_ICC__)
+    #if __VER__ > 1000
+        #define JSON_HEDLEY_IAR_VERSION JSON_HEDLEY_VERSION_ENCODE((__VER__ / 1000000), ((__VER__ / 1000) % 1000), (__VER__ % 1000))
+    #else
+        #define JSON_HEDLEY_IAR_VERSION JSON_HEDLEY_VERSION_ENCODE(__VER__ / 100, __VER__ % 100, 0)
+    #endif
+#endif
+
+#if defined(JSON_HEDLEY_IAR_VERSION_CHECK)
+    #undef JSON_HEDLEY_IAR_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_IAR_VERSION)
+    #define JSON_HEDLEY_IAR_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_IAR_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_IAR_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TINYC_VERSION)
+    #undef JSON_HEDLEY_TINYC_VERSION
+#endif
+#if defined(__TINYC__)
+    #define JSON_HEDLEY_TINYC_VERSION JSON_HEDLEY_VERSION_ENCODE(__TINYC__ / 1000, (__TINYC__ / 100) % 10, __TINYC__ % 100)
+#endif
+
+#if defined(JSON_HEDLEY_TINYC_VERSION_CHECK)
+    #undef JSON_HEDLEY_TINYC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TINYC_VERSION)
+    #define JSON_HEDLEY_TINYC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TINYC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TINYC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_DMC_VERSION)
+    #undef JSON_HEDLEY_DMC_VERSION
+#endif
+#if defined(__DMC__)
+    #define JSON_HEDLEY_DMC_VERSION JSON_HEDLEY_VERSION_ENCODE(__DMC__ >> 8, (__DMC__ >> 4) & 0xf, __DMC__ & 0xf)
+#endif
+
+#if defined(JSON_HEDLEY_DMC_VERSION_CHECK)
+    #undef JSON_HEDLEY_DMC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_DMC_VERSION)
+    #define JSON_HEDLEY_DMC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_DMC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_DMC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_COMPCERT_VERSION)
+    #undef JSON_HEDLEY_COMPCERT_VERSION
+#endif
+#if defined(__COMPCERT_VERSION__)
+    #define JSON_HEDLEY_COMPCERT_VERSION JSON_HEDLEY_VERSION_ENCODE(__COMPCERT_VERSION__ / 10000, (__COMPCERT_VERSION__ / 100) % 100, __COMPCERT_VERSION__ % 100)
+#endif
+
+#if defined(JSON_HEDLEY_COMPCERT_VERSION_CHECK)
+    #undef JSON_HEDLEY_COMPCERT_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_COMPCERT_VERSION)
+    #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_COMPCERT_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_PELLES_VERSION)
+    #undef JSON_HEDLEY_PELLES_VERSION
+#endif
+#if defined(__POCC__)
+    #define JSON_HEDLEY_PELLES_VERSION JSON_HEDLEY_VERSION_ENCODE(__POCC__ / 100, __POCC__ % 100, 0)
+#endif
+
+#if defined(JSON_HEDLEY_PELLES_VERSION_CHECK)
+    #undef JSON_HEDLEY_PELLES_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_PELLES_VERSION)
+    #define JSON_HEDLEY_PELLES_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_PELLES_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_PELLES_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_MCST_LCC_VERSION)
+    #undef JSON_HEDLEY_MCST_LCC_VERSION
+#endif
+#if defined(__LCC__) && defined(__LCC_MINOR__)
+    #define JSON_HEDLEY_MCST_LCC_VERSION JSON_HEDLEY_VERSION_ENCODE(__LCC__ / 100, __LCC__ % 100, __LCC_MINOR__)
+#endif
+
+#if defined(JSON_HEDLEY_MCST_LCC_VERSION_CHECK)
+    #undef JSON_HEDLEY_MCST_LCC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_MCST_LCC_VERSION)
+    #define JSON_HEDLEY_MCST_LCC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_MCST_LCC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_MCST_LCC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_VERSION)
+    #undef JSON_HEDLEY_GCC_VERSION
+#endif
+#if \
+    defined(JSON_HEDLEY_GNUC_VERSION) && \
+    !defined(__clang__) && \
+    !defined(JSON_HEDLEY_INTEL_VERSION) && \
+    !defined(JSON_HEDLEY_PGI_VERSION) && \
+    !defined(JSON_HEDLEY_ARM_VERSION) && \
+    !defined(JSON_HEDLEY_CRAY_VERSION) && \
+    !defined(JSON_HEDLEY_TI_VERSION) && \
+    !defined(JSON_HEDLEY_TI_ARMCL_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CL430_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CL2000_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CL6X_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CL7X_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CLPRU_VERSION) && \
+    !defined(__COMPCERT__) && \
+    !defined(JSON_HEDLEY_MCST_LCC_VERSION)
+    #define JSON_HEDLEY_GCC_VERSION JSON_HEDLEY_GNUC_VERSION
+#endif
+
+#if defined(JSON_HEDLEY_GCC_VERSION_CHECK)
+    #undef JSON_HEDLEY_GCC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_GCC_VERSION)
+    #define JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_GCC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_ATTRIBUTE)
+    #undef JSON_HEDLEY_HAS_ATTRIBUTE
+#endif
+#if \
+  defined(__has_attribute) && \
+  ( \
+    (!defined(JSON_HEDLEY_IAR_VERSION) || JSON_HEDLEY_IAR_VERSION_CHECK(8,5,9)) \
+  )
+#  define JSON_HEDLEY_HAS_ATTRIBUTE(attribute) __has_attribute(attribute)
+#else
+#  define JSON_HEDLEY_HAS_ATTRIBUTE(attribute) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_ATTRIBUTE)
+    #undef JSON_HEDLEY_GNUC_HAS_ATTRIBUTE
+#endif
+#if defined(__has_attribute)
+    #define JSON_HEDLEY_GNUC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_HAS_ATTRIBUTE(attribute)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_ATTRIBUTE)
+    #undef JSON_HEDLEY_GCC_HAS_ATTRIBUTE
+#endif
+#if defined(__has_attribute)
+    #define JSON_HEDLEY_GCC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_HAS_ATTRIBUTE(attribute)
+#else
+    #define JSON_HEDLEY_GCC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_CPP_ATTRIBUTE)
+    #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE
+#endif
+#if \
+    defined(__has_cpp_attribute) && \
+    defined(__cplusplus) && \
+    (!defined(JSON_HEDLEY_SUNPRO_VERSION) || JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0))
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE(attribute) __has_cpp_attribute(attribute)
+#else
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE(attribute) (0)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS)
+    #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS
+#endif
+#if !defined(__cplusplus) || !defined(__has_cpp_attribute)
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(ns,attribute) (0)
+#elif \
+    !defined(JSON_HEDLEY_PGI_VERSION) && \
+    !defined(JSON_HEDLEY_IAR_VERSION) && \
+    (!defined(JSON_HEDLEY_SUNPRO_VERSION) || JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0)) && \
+    (!defined(JSON_HEDLEY_MSVC_VERSION) || JSON_HEDLEY_MSVC_VERSION_CHECK(19,20,0))
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(ns,attribute) JSON_HEDLEY_HAS_CPP_ATTRIBUTE(ns::attribute)
+#else
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(ns,attribute) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE)
+    #undef JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE
+#endif
+#if defined(__has_cpp_attribute) && defined(__cplusplus)
+    #define JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) __has_cpp_attribute(attribute)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE)
+    #undef JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE
+#endif
+#if defined(__has_cpp_attribute) && defined(__cplusplus)
+    #define JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) __has_cpp_attribute(attribute)
+#else
+    #define JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_BUILTIN)
+    #undef JSON_HEDLEY_HAS_BUILTIN
+#endif
+#if defined(__has_builtin)
+    #define JSON_HEDLEY_HAS_BUILTIN(builtin) __has_builtin(builtin)
+#else
+    #define JSON_HEDLEY_HAS_BUILTIN(builtin) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_BUILTIN)
+    #undef JSON_HEDLEY_GNUC_HAS_BUILTIN
+#endif
+#if defined(__has_builtin)
+    #define JSON_HEDLEY_GNUC_HAS_BUILTIN(builtin,major,minor,patch) __has_builtin(builtin)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_BUILTIN(builtin,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_BUILTIN)
+    #undef JSON_HEDLEY_GCC_HAS_BUILTIN
+#endif
+#if defined(__has_builtin)
+    #define JSON_HEDLEY_GCC_HAS_BUILTIN(builtin,major,minor,patch) __has_builtin(builtin)
+#else
+    #define JSON_HEDLEY_GCC_HAS_BUILTIN(builtin,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_FEATURE)
+    #undef JSON_HEDLEY_HAS_FEATURE
+#endif
+#if defined(__has_feature)
+    #define JSON_HEDLEY_HAS_FEATURE(feature) __has_feature(feature)
+#else
+    #define JSON_HEDLEY_HAS_FEATURE(feature) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_FEATURE)
+    #undef JSON_HEDLEY_GNUC_HAS_FEATURE
+#endif
+#if defined(__has_feature)
+    #define JSON_HEDLEY_GNUC_HAS_FEATURE(feature,major,minor,patch) __has_feature(feature)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_FEATURE(feature,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_FEATURE)
+    #undef JSON_HEDLEY_GCC_HAS_FEATURE
+#endif
+#if defined(__has_feature)
+    #define JSON_HEDLEY_GCC_HAS_FEATURE(feature,major,minor,patch) __has_feature(feature)
+#else
+    #define JSON_HEDLEY_GCC_HAS_FEATURE(feature,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_EXTENSION)
+    #undef JSON_HEDLEY_HAS_EXTENSION
+#endif
+#if defined(__has_extension)
+    #define JSON_HEDLEY_HAS_EXTENSION(extension) __has_extension(extension)
+#else
+    #define JSON_HEDLEY_HAS_EXTENSION(extension) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_EXTENSION)
+    #undef JSON_HEDLEY_GNUC_HAS_EXTENSION
+#endif
+#if defined(__has_extension)
+    #define JSON_HEDLEY_GNUC_HAS_EXTENSION(extension,major,minor,patch) __has_extension(extension)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_EXTENSION(extension,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_EXTENSION)
+    #undef JSON_HEDLEY_GCC_HAS_EXTENSION
+#endif
+#if defined(__has_extension)
+    #define JSON_HEDLEY_GCC_HAS_EXTENSION(extension,major,minor,patch) __has_extension(extension)
+#else
+    #define JSON_HEDLEY_GCC_HAS_EXTENSION(extension,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE)
+    #undef JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE
+#endif
+#if defined(__has_declspec_attribute)
+    #define JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE(attribute) __has_declspec_attribute(attribute)
+#else
+    #define JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE(attribute) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE)
+    #undef JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE
+#endif
+#if defined(__has_declspec_attribute)
+    #define JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) __has_declspec_attribute(attribute)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE)
+    #undef JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE
+#endif
+#if defined(__has_declspec_attribute)
+    #define JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) __has_declspec_attribute(attribute)
+#else
+    #define JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_WARNING)
+    #undef JSON_HEDLEY_HAS_WARNING
+#endif
+#if defined(__has_warning)
+    #define JSON_HEDLEY_HAS_WARNING(warning) __has_warning(warning)
+#else
+    #define JSON_HEDLEY_HAS_WARNING(warning) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_WARNING)
+    #undef JSON_HEDLEY_GNUC_HAS_WARNING
+#endif
+#if defined(__has_warning)
+    #define JSON_HEDLEY_GNUC_HAS_WARNING(warning,major,minor,patch) __has_warning(warning)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_WARNING(warning,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_WARNING)
+    #undef JSON_HEDLEY_GCC_HAS_WARNING
+#endif
+#if defined(__has_warning)
+    #define JSON_HEDLEY_GCC_HAS_WARNING(warning,major,minor,patch) __has_warning(warning)
+#else
+    #define JSON_HEDLEY_GCC_HAS_WARNING(warning,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if \
+    (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) || \
+    defined(__clang__) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,0,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(18,4,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,7,0) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(2,0,1) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,1,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,0,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_CRAY_VERSION_CHECK(5,0,0) || \
+    JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,17) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(8,0,0) || \
+    (JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) && defined(__C99_PRAGMA_OPERATOR))
+    #define JSON_HEDLEY_PRAGMA(value) _Pragma(#value)
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0)
+    #define JSON_HEDLEY_PRAGMA(value) __pragma(value)
+#else
+    #define JSON_HEDLEY_PRAGMA(value)
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_PUSH)
+    #undef JSON_HEDLEY_DIAGNOSTIC_PUSH
+#endif
+#if defined(JSON_HEDLEY_DIAGNOSTIC_POP)
+    #undef JSON_HEDLEY_DIAGNOSTIC_POP
+#endif
+#if defined(__clang__)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("clang diagnostic push")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("clang diagnostic pop")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("warning(push)")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("warning(pop)")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,6,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("GCC diagnostic push")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("GCC diagnostic pop")
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH __pragma(warning(push))
+    #define JSON_HEDLEY_DIAGNOSTIC_POP __pragma(warning(pop))
+#elif JSON_HEDLEY_ARM_VERSION_CHECK(5,6,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("push")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("pop")
+#elif \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,4,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,1,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("diag_push")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("diag_pop")
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(2,90,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("warning(push)")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("warning(pop)")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH
+    #define JSON_HEDLEY_DIAGNOSTIC_POP
+#endif
+
+/* JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_ is for
+   HEDLEY INTERNAL USE ONLY.  API subject to change without notice. */
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_
+#endif
+#if defined(__cplusplus)
+#  if JSON_HEDLEY_HAS_WARNING("-Wc++98-compat")
+#    if JSON_HEDLEY_HAS_WARNING("-Wc++17-extensions")
+#      if JSON_HEDLEY_HAS_WARNING("-Wc++1z-extensions")
+#        define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(xpr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wc++98-compat\"") \
+    _Pragma("clang diagnostic ignored \"-Wc++17-extensions\"") \
+    _Pragma("clang diagnostic ignored \"-Wc++1z-extensions\"") \
+    xpr \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#      else
+#        define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(xpr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wc++98-compat\"") \
+    _Pragma("clang diagnostic ignored \"-Wc++17-extensions\"") \
+    xpr \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#      endif
+#    else
+#      define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(xpr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wc++98-compat\"") \
+    xpr \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#    endif
+#  endif
+#endif
+#if !defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(x) x
+#endif
+
+#if defined(JSON_HEDLEY_CONST_CAST)
+    #undef JSON_HEDLEY_CONST_CAST
+#endif
+#if defined(__cplusplus)
+#  define JSON_HEDLEY_CONST_CAST(T, expr) (const_cast<T>(expr))
+#elif \
+  JSON_HEDLEY_HAS_WARNING("-Wcast-qual") || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(4,6,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+#  define JSON_HEDLEY_CONST_CAST(T, expr) (__extension__ ({ \
+        JSON_HEDLEY_DIAGNOSTIC_PUSH \
+        JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL \
+        ((T) (expr)); \
+        JSON_HEDLEY_DIAGNOSTIC_POP \
+    }))
+#else
+#  define JSON_HEDLEY_CONST_CAST(T, expr) ((T) (expr))
+#endif
+
+#if defined(JSON_HEDLEY_REINTERPRET_CAST)
+    #undef JSON_HEDLEY_REINTERPRET_CAST
+#endif
+#if defined(__cplusplus)
+    #define JSON_HEDLEY_REINTERPRET_CAST(T, expr) (reinterpret_cast<T>(expr))
+#else
+    #define JSON_HEDLEY_REINTERPRET_CAST(T, expr) ((T) (expr))
+#endif
+
+#if defined(JSON_HEDLEY_STATIC_CAST)
+    #undef JSON_HEDLEY_STATIC_CAST
+#endif
+#if defined(__cplusplus)
+    #define JSON_HEDLEY_STATIC_CAST(T, expr) (static_cast<T>(expr))
+#else
+    #define JSON_HEDLEY_STATIC_CAST(T, expr) ((T) (expr))
+#endif
+
+#if defined(JSON_HEDLEY_CPP_CAST)
+    #undef JSON_HEDLEY_CPP_CAST
+#endif
+#if defined(__cplusplus)
+#  if JSON_HEDLEY_HAS_WARNING("-Wold-style-cast")
+#    define JSON_HEDLEY_CPP_CAST(T, expr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wold-style-cast\"") \
+    ((T) (expr)) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#  elif JSON_HEDLEY_IAR_VERSION_CHECK(8,3,0)
+#    define JSON_HEDLEY_CPP_CAST(T, expr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("diag_suppress=Pe137") \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#  else
+#    define JSON_HEDLEY_CPP_CAST(T, expr) ((T) (expr))
+#  endif
+#else
+#  define JSON_HEDLEY_CPP_CAST(T, expr) (expr)
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wdeprecated-declarations")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("clang diagnostic ignored \"-Wdeprecated-declarations\"")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("warning(disable:1478 1786)")
+#elif JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED __pragma(warning(disable:1478 1786))
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(20,7,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1215,1216,1444,1445")
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1215,1444")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,3,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("GCC diagnostic ignored \"-Wdeprecated-declarations\"")
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED __pragma(warning(disable:4996))
+#elif JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1215,1444")
+#elif \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1291,1718")
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,13,0) && !defined(__cplusplus)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("error_messages(off,E_DEPRECATED_ATT,E_DEPRECATED_ATT_MESS)")
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,13,0) && defined(__cplusplus)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("error_messages(off,symdeprecated,symdeprecated2)")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress=Pe1444,Pe1215")
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(2,90,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("warn(disable:2241)")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunknown-pragmas")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("clang diagnostic ignored \"-Wunknown-pragmas\"")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("warning(disable:161)")
+#elif JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS __pragma(warning(disable:161))
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 1675")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,3,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("GCC diagnostic ignored \"-Wunknown-pragmas\"")
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS __pragma(warning(disable:4068))
+#elif \
+    JSON_HEDLEY_TI_VERSION_CHECK(16,9,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,0,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,3,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 163")
+#elif JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 163")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress=Pe161")
+#elif JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 161")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunknown-attributes")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("clang diagnostic ignored \"-Wunknown-attributes\"")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,6,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("GCC diagnostic ignored \"-Wdeprecated-declarations\"")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(17,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("warning(disable:1292)")
+#elif JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES __pragma(warning(disable:1292))
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(19,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES __pragma(warning(disable:5030))
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(20,7,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1097,1098")
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1097")
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,14,0) && defined(__cplusplus)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("error_messages(off,attrskipunsup)")
+#elif \
+    JSON_HEDLEY_TI_VERSION_CHECK(18,1,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,3,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1173")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress=Pe1097")
+#elif JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1097")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wcast-qual")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL _Pragma("clang diagnostic ignored \"-Wcast-qual\"")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL _Pragma("warning(disable:2203 2331)")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(3,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL _Pragma("GCC diagnostic ignored \"-Wcast-qual\"")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunused-function")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION _Pragma("clang diagnostic ignored \"-Wunused-function\"")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION _Pragma("GCC diagnostic ignored \"-Wunused-function\"")
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(1,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION __pragma(warning(disable:4505))
+#elif JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION _Pragma("diag_suppress 3142")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION
+#endif
+
+#if defined(JSON_HEDLEY_DEPRECATED)
+    #undef JSON_HEDLEY_DEPRECATED
+#endif
+#if defined(JSON_HEDLEY_DEPRECATED_FOR)
+    #undef JSON_HEDLEY_DEPRECATED_FOR
+#endif
+#if \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(14,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DEPRECATED(since) __declspec(deprecated("Since " # since))
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __declspec(deprecated("Since " #since "; use " #replacement))
+#elif \
+    (JSON_HEDLEY_HAS_EXTENSION(attribute_deprecated_with_message) && !defined(JSON_HEDLEY_IAR_VERSION)) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,5,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(5,6,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,13,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(18,1,0) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(18,1,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,3,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,3,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DEPRECATED(since) __attribute__((__deprecated__("Since " #since)))
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __attribute__((__deprecated__("Since " #since "; use " #replacement)))
+#elif defined(__cplusplus) && (__cplusplus >= 201402L)
+    #define JSON_HEDLEY_DEPRECATED(since) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[deprecated("Since " #since)]])
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[deprecated("Since " #since "; use " #replacement)]])
+#elif \
+    JSON_HEDLEY_HAS_ATTRIBUTE(deprecated) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,10,0)
+    #define JSON_HEDLEY_DEPRECATED(since) __attribute__((__deprecated__))
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __attribute__((__deprecated__))
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \
+    JSON_HEDLEY_PELLES_VERSION_CHECK(6,50,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DEPRECATED(since) __declspec(deprecated)
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __declspec(deprecated)
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DEPRECATED(since) _Pragma("deprecated")
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) _Pragma("deprecated")
+#else
+    #define JSON_HEDLEY_DEPRECATED(since)
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement)
+#endif
+
+#if defined(JSON_HEDLEY_UNAVAILABLE)
+    #undef JSON_HEDLEY_UNAVAILABLE
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(warning) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,3,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_UNAVAILABLE(available_since) __attribute__((__warning__("Not available until " #available_since)))
+#else
+    #define JSON_HEDLEY_UNAVAILABLE(available_since)
+#endif
+
+#if defined(JSON_HEDLEY_WARN_UNUSED_RESULT)
+    #undef JSON_HEDLEY_WARN_UNUSED_RESULT
+#endif
+#if defined(JSON_HEDLEY_WARN_UNUSED_RESULT_MSG)
+    #undef JSON_HEDLEY_WARN_UNUSED_RESULT_MSG
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(warn_unused_result) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0) && defined(__cplusplus)) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT __attribute__((__warn_unused_result__))
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) __attribute__((__warn_unused_result__))
+#elif (JSON_HEDLEY_HAS_CPP_ATTRIBUTE(nodiscard) >= 201907L)
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard]])
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard(msg)]])
+#elif JSON_HEDLEY_HAS_CPP_ATTRIBUTE(nodiscard)
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard]])
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard]])
+#elif defined(_Check_return_) /* SAL */
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT _Check_return_
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) _Check_return_
+#else
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg)
+#endif
+
+#if defined(JSON_HEDLEY_SENTINEL)
+    #undef JSON_HEDLEY_SENTINEL
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(sentinel) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,0,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(5,4,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_SENTINEL(position) __attribute__((__sentinel__(position)))
+#else
+    #define JSON_HEDLEY_SENTINEL(position)
+#endif
+
+#if defined(JSON_HEDLEY_NO_RETURN)
+    #undef JSON_HEDLEY_NO_RETURN
+#endif
+#if JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_NO_RETURN __noreturn
+#elif \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_NO_RETURN __attribute__((__noreturn__))
+#elif defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L
+    #define JSON_HEDLEY_NO_RETURN _Noreturn
+#elif defined(__cplusplus) && (__cplusplus >= 201103L)
+    #define JSON_HEDLEY_NO_RETURN JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[noreturn]])
+#elif \
+    JSON_HEDLEY_HAS_ATTRIBUTE(noreturn) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,2,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,10,0)
+    #define JSON_HEDLEY_NO_RETURN __attribute__((__noreturn__))
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0)
+    #define JSON_HEDLEY_NO_RETURN _Pragma("does_not_return")
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_NO_RETURN __declspec(noreturn)
+#elif JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,0,0) && defined(__cplusplus)
+    #define JSON_HEDLEY_NO_RETURN _Pragma("FUNC_NEVER_RETURNS;")
+#elif JSON_HEDLEY_COMPCERT_VERSION_CHECK(3,2,0)
+    #define JSON_HEDLEY_NO_RETURN __attribute((noreturn))
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(9,0,0)
+    #define JSON_HEDLEY_NO_RETURN __declspec(noreturn)
+#else
+    #define JSON_HEDLEY_NO_RETURN
+#endif
+
+#if defined(JSON_HEDLEY_NO_ESCAPE)
+    #undef JSON_HEDLEY_NO_ESCAPE
+#endif
+#if JSON_HEDLEY_HAS_ATTRIBUTE(noescape)
+    #define JSON_HEDLEY_NO_ESCAPE __attribute__((__noescape__))
+#else
+    #define JSON_HEDLEY_NO_ESCAPE
+#endif
+
+#if defined(JSON_HEDLEY_UNREACHABLE)
+    #undef JSON_HEDLEY_UNREACHABLE
+#endif
+#if defined(JSON_HEDLEY_UNREACHABLE_RETURN)
+    #undef JSON_HEDLEY_UNREACHABLE_RETURN
+#endif
+#if defined(JSON_HEDLEY_ASSUME)
+    #undef JSON_HEDLEY_ASSUME
+#endif
+#if \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_ASSUME(expr) __assume(expr)
+#elif JSON_HEDLEY_HAS_BUILTIN(__builtin_assume)
+    #define JSON_HEDLEY_ASSUME(expr) __builtin_assume(expr)
+#elif \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(4,0,0)
+    #if defined(__cplusplus)
+        #define JSON_HEDLEY_ASSUME(expr) std::_nassert(expr)
+    #else
+        #define JSON_HEDLEY_ASSUME(expr) _nassert(expr)
+    #endif
+#endif
+#if \
+    (JSON_HEDLEY_HAS_BUILTIN(__builtin_unreachable) && (!defined(JSON_HEDLEY_ARM_VERSION))) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,5,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(18,10,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(13,1,5) || \
+    JSON_HEDLEY_CRAY_VERSION_CHECK(10,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_UNREACHABLE() __builtin_unreachable()
+#elif defined(JSON_HEDLEY_ASSUME)
+    #define JSON_HEDLEY_UNREACHABLE() JSON_HEDLEY_ASSUME(0)
+#endif
+#if !defined(JSON_HEDLEY_ASSUME)
+    #if defined(JSON_HEDLEY_UNREACHABLE)
+        #define JSON_HEDLEY_ASSUME(expr) JSON_HEDLEY_STATIC_CAST(void, ((expr) ? 1 : (JSON_HEDLEY_UNREACHABLE(), 1)))
+    #else
+        #define JSON_HEDLEY_ASSUME(expr) JSON_HEDLEY_STATIC_CAST(void, expr)
+    #endif
+#endif
+#if defined(JSON_HEDLEY_UNREACHABLE)
+    #if  \
+        JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,0) || \
+        JSON_HEDLEY_TI_CL6X_VERSION_CHECK(4,0,0)
+        #define JSON_HEDLEY_UNREACHABLE_RETURN(value) return (JSON_HEDLEY_STATIC_CAST(void, JSON_HEDLEY_ASSUME(0)), (value))
+    #else
+        #define JSON_HEDLEY_UNREACHABLE_RETURN(value) JSON_HEDLEY_UNREACHABLE()
+    #endif
+#else
+    #define JSON_HEDLEY_UNREACHABLE_RETURN(value) return (value)
+#endif
+#if !defined(JSON_HEDLEY_UNREACHABLE)
+    #define JSON_HEDLEY_UNREACHABLE() JSON_HEDLEY_ASSUME(0)
+#endif
+
+JSON_HEDLEY_DIAGNOSTIC_PUSH
+#if JSON_HEDLEY_HAS_WARNING("-Wpedantic")
+    #pragma clang diagnostic ignored "-Wpedantic"
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wc++98-compat-pedantic") && defined(__cplusplus)
+    #pragma clang diagnostic ignored "-Wc++98-compat-pedantic"
+#endif
+#if JSON_HEDLEY_GCC_HAS_WARNING("-Wvariadic-macros",4,0,0)
+    #if defined(__clang__)
+        #pragma clang diagnostic ignored "-Wvariadic-macros"
+    #elif defined(JSON_HEDLEY_GCC_VERSION)
+        #pragma GCC diagnostic ignored "-Wvariadic-macros"
+    #endif
+#endif
+#if defined(JSON_HEDLEY_NON_NULL)
+    #undef JSON_HEDLEY_NON_NULL
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(nonnull) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,3,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0)
+    #define JSON_HEDLEY_NON_NULL(...) __attribute__((__nonnull__(__VA_ARGS__)))
+#else
+    #define JSON_HEDLEY_NON_NULL(...)
+#endif
+JSON_HEDLEY_DIAGNOSTIC_POP
+
+#if defined(JSON_HEDLEY_PRINTF_FORMAT)
+    #undef JSON_HEDLEY_PRINTF_FORMAT
+#endif
+#if defined(__MINGW32__) && JSON_HEDLEY_GCC_HAS_ATTRIBUTE(format,4,4,0) && !defined(__USE_MINGW_ANSI_STDIO)
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __attribute__((__format__(ms_printf, string_idx, first_to_check)))
+#elif defined(__MINGW32__) && JSON_HEDLEY_GCC_HAS_ATTRIBUTE(format,4,4,0) && defined(__USE_MINGW_ANSI_STDIO)
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __attribute__((__format__(gnu_printf, string_idx, first_to_check)))
+#elif \
+    JSON_HEDLEY_HAS_ATTRIBUTE(format) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(5,6,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __attribute__((__format__(__printf__, string_idx, first_to_check)))
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(6,0,0)
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __declspec(vaformat(printf,string_idx,first_to_check))
+#else
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check)
+#endif
+
+#if defined(JSON_HEDLEY_CONSTEXPR)
+    #undef JSON_HEDLEY_CONSTEXPR
+#endif
+#if defined(__cplusplus)
+    #if __cplusplus >= 201103L
+        #define JSON_HEDLEY_CONSTEXPR JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(constexpr)
+    #endif
+#endif
+#if !defined(JSON_HEDLEY_CONSTEXPR)
+    #define JSON_HEDLEY_CONSTEXPR
+#endif
+
+#if defined(JSON_HEDLEY_PREDICT)
+    #undef JSON_HEDLEY_PREDICT
+#endif
+#if defined(JSON_HEDLEY_LIKELY)
+    #undef JSON_HEDLEY_LIKELY
+#endif
+#if defined(JSON_HEDLEY_UNLIKELY)
+    #undef JSON_HEDLEY_UNLIKELY
+#endif
+#if defined(JSON_HEDLEY_UNPREDICTABLE)
+    #undef JSON_HEDLEY_UNPREDICTABLE
+#endif
+#if JSON_HEDLEY_HAS_BUILTIN(__builtin_unpredictable)
+    #define JSON_HEDLEY_UNPREDICTABLE(expr) __builtin_unpredictable((expr))
+#endif
+#if \
+  (JSON_HEDLEY_HAS_BUILTIN(__builtin_expect_with_probability) && !defined(JSON_HEDLEY_PGI_VERSION)) || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(9,0,0) || \
+  JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+#  define JSON_HEDLEY_PREDICT(expr, value, probability) __builtin_expect_with_probability(  (expr), (value), (probability))
+#  define JSON_HEDLEY_PREDICT_TRUE(expr, probability)   __builtin_expect_with_probability(!!(expr),    1   , (probability))
+#  define JSON_HEDLEY_PREDICT_FALSE(expr, probability)  __builtin_expect_with_probability(!!(expr),    0   , (probability))
+#  define JSON_HEDLEY_LIKELY(expr)                      __builtin_expect                 (!!(expr),    1                  )
+#  define JSON_HEDLEY_UNLIKELY(expr)                    __builtin_expect                 (!!(expr),    0                  )
+#elif \
+  (JSON_HEDLEY_HAS_BUILTIN(__builtin_expect) && !defined(JSON_HEDLEY_INTEL_CL_VERSION)) || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(3,0,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+  (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0) && defined(__cplusplus)) || \
+  JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+  JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+  JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+  JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,7,0) || \
+  JSON_HEDLEY_TI_CL430_VERSION_CHECK(3,1,0) || \
+  JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,1,0) || \
+  JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,1,0) || \
+  JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+  JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+  JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,27) || \
+  JSON_HEDLEY_CRAY_VERSION_CHECK(8,1,0) || \
+  JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+#  define JSON_HEDLEY_PREDICT(expr, expected, probability) \
+    (((probability) >= 0.9) ? __builtin_expect((expr), (expected)) : (JSON_HEDLEY_STATIC_CAST(void, expected), (expr)))
+#  define JSON_HEDLEY_PREDICT_TRUE(expr, probability) \
+    (__extension__ ({ \
+        double hedley_probability_ = (probability); \
+        ((hedley_probability_ >= 0.9) ? __builtin_expect(!!(expr), 1) : ((hedley_probability_ <= 0.1) ? __builtin_expect(!!(expr), 0) : !!(expr))); \
+    }))
+#  define JSON_HEDLEY_PREDICT_FALSE(expr, probability) \
+    (__extension__ ({ \
+        double hedley_probability_ = (probability); \
+        ((hedley_probability_ >= 0.9) ? __builtin_expect(!!(expr), 0) : ((hedley_probability_ <= 0.1) ? __builtin_expect(!!(expr), 1) : !!(expr))); \
+    }))
+#  define JSON_HEDLEY_LIKELY(expr)   __builtin_expect(!!(expr), 1)
+#  define JSON_HEDLEY_UNLIKELY(expr) __builtin_expect(!!(expr), 0)
+#else
+#  define JSON_HEDLEY_PREDICT(expr, expected, probability) (JSON_HEDLEY_STATIC_CAST(void, expected), (expr))
+#  define JSON_HEDLEY_PREDICT_TRUE(expr, probability) (!!(expr))
+#  define JSON_HEDLEY_PREDICT_FALSE(expr, probability) (!!(expr))
+#  define JSON_HEDLEY_LIKELY(expr) (!!(expr))
+#  define JSON_HEDLEY_UNLIKELY(expr) (!!(expr))
+#endif
+#if !defined(JSON_HEDLEY_UNPREDICTABLE)
+    #define JSON_HEDLEY_UNPREDICTABLE(expr) JSON_HEDLEY_PREDICT(expr, 1, 0.5)
+#endif
+
+#if defined(JSON_HEDLEY_MALLOC)
+    #undef JSON_HEDLEY_MALLOC
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(malloc) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(12,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_MALLOC __attribute__((__malloc__))
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0)
+    #define JSON_HEDLEY_MALLOC _Pragma("returns_new_memory")
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(14,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_MALLOC __declspec(restrict)
+#else
+    #define JSON_HEDLEY_MALLOC
+#endif
+
+#if defined(JSON_HEDLEY_PURE)
+    #undef JSON_HEDLEY_PURE
+#endif
+#if \
+  JSON_HEDLEY_HAS_ATTRIBUTE(pure) || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(2,96,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+  JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+  JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+  JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+  JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+  (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+  (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+  (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+  (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+  JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+  JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+  JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+  JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+#  define JSON_HEDLEY_PURE __attribute__((__pure__))
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0)
+#  define JSON_HEDLEY_PURE _Pragma("does_not_write_global_data")
+#elif defined(__cplusplus) && \
+    ( \
+      JSON_HEDLEY_TI_CL430_VERSION_CHECK(2,0,1) || \
+      JSON_HEDLEY_TI_CL6X_VERSION_CHECK(4,0,0) || \
+      JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) \
+    )
+#  define JSON_HEDLEY_PURE _Pragma("FUNC_IS_PURE;")
+#else
+#  define JSON_HEDLEY_PURE
+#endif
+
+#if defined(JSON_HEDLEY_CONST)
+    #undef JSON_HEDLEY_CONST
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(const) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(2,5,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_CONST __attribute__((__const__))
+#elif \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0)
+    #define JSON_HEDLEY_CONST _Pragma("no_side_effect")
+#else
+    #define JSON_HEDLEY_CONST JSON_HEDLEY_PURE
+#endif
+
+#if defined(JSON_HEDLEY_RESTRICT)
+    #undef JSON_HEDLEY_RESTRICT
+#endif
+#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) && !defined(__cplusplus)
+    #define JSON_HEDLEY_RESTRICT restrict
+#elif \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(14,0,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,4) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,1,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,14,0) && defined(__cplusplus)) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) || \
+    defined(__clang__) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_RESTRICT __restrict
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,3,0) && !defined(__cplusplus)
+    #define JSON_HEDLEY_RESTRICT _Restrict
+#else
+    #define JSON_HEDLEY_RESTRICT
+#endif
+
+#if defined(JSON_HEDLEY_INLINE)
+    #undef JSON_HEDLEY_INLINE
+#endif
+#if \
+    (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) || \
+    (defined(__cplusplus) && (__cplusplus >= 199711L))
+    #define JSON_HEDLEY_INLINE inline
+#elif \
+    defined(JSON_HEDLEY_GCC_VERSION) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(6,2,0)
+    #define JSON_HEDLEY_INLINE __inline__
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(12,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,1,0) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,0,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_INLINE __inline
+#else
+    #define JSON_HEDLEY_INLINE
+#endif
+
+#if defined(JSON_HEDLEY_ALWAYS_INLINE)
+    #undef JSON_HEDLEY_ALWAYS_INLINE
+#endif
+#if \
+  JSON_HEDLEY_HAS_ATTRIBUTE(always_inline) || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(4,0,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+  JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+  JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+  JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+  JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+  (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+  (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+  (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+  (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+  JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+  JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+  JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10) || \
+  JSON_HEDLEY_IAR_VERSION_CHECK(8,10,0)
+#  define JSON_HEDLEY_ALWAYS_INLINE __attribute__((__always_inline__)) JSON_HEDLEY_INLINE
+#elif \
+  JSON_HEDLEY_MSVC_VERSION_CHECK(12,0,0) || \
+  JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+#  define JSON_HEDLEY_ALWAYS_INLINE __forceinline
+#elif defined(__cplusplus) && \
+    ( \
+      JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+      JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+      JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+      JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,1,0) || \
+      JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+      JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) \
+    )
+#  define JSON_HEDLEY_ALWAYS_INLINE _Pragma("FUNC_ALWAYS_INLINE;")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+#  define JSON_HEDLEY_ALWAYS_INLINE _Pragma("inline=forced")
+#else
+#  define JSON_HEDLEY_ALWAYS_INLINE JSON_HEDLEY_INLINE
+#endif
+
+#if defined(JSON_HEDLEY_NEVER_INLINE)
+    #undef JSON_HEDLEY_NEVER_INLINE
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(noinline) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,0,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,10,0)
+    #define JSON_HEDLEY_NEVER_INLINE __attribute__((__noinline__))
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_NEVER_INLINE __declspec(noinline)
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(10,2,0)
+    #define JSON_HEDLEY_NEVER_INLINE _Pragma("noinline")
+#elif JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,0,0) && defined(__cplusplus)
+    #define JSON_HEDLEY_NEVER_INLINE _Pragma("FUNC_CANNOT_INLINE;")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_NEVER_INLINE _Pragma("inline=never")
+#elif JSON_HEDLEY_COMPCERT_VERSION_CHECK(3,2,0)
+    #define JSON_HEDLEY_NEVER_INLINE __attribute((noinline))
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(9,0,0)
+    #define JSON_HEDLEY_NEVER_INLINE __declspec(noinline)
+#else
+    #define JSON_HEDLEY_NEVER_INLINE
+#endif
+
+#if defined(JSON_HEDLEY_PRIVATE)
+    #undef JSON_HEDLEY_PRIVATE
+#endif
+#if defined(JSON_HEDLEY_PUBLIC)
+    #undef JSON_HEDLEY_PUBLIC
+#endif
+#if defined(JSON_HEDLEY_IMPORT)
+    #undef JSON_HEDLEY_IMPORT
+#endif
+#if defined(_WIN32) || defined(__CYGWIN__)
+#  define JSON_HEDLEY_PRIVATE
+#  define JSON_HEDLEY_PUBLIC   __declspec(dllexport)
+#  define JSON_HEDLEY_IMPORT   __declspec(dllimport)
+#else
+#  if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(visibility) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,3,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(13,1,0) || \
+    ( \
+      defined(__TI_EABI__) && \
+      ( \
+        (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+        JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) \
+      ) \
+    ) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+#    define JSON_HEDLEY_PRIVATE __attribute__((__visibility__("hidden")))
+#    define JSON_HEDLEY_PUBLIC  __attribute__((__visibility__("default")))
+#  else
+#    define JSON_HEDLEY_PRIVATE
+#    define JSON_HEDLEY_PUBLIC
+#  endif
+#  define JSON_HEDLEY_IMPORT    extern
+#endif
+
+#if defined(JSON_HEDLEY_NO_THROW)
+    #undef JSON_HEDLEY_NO_THROW
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(nothrow) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,3,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_NO_THROW __attribute__((__nothrow__))
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,1,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0)
+    #define JSON_HEDLEY_NO_THROW __declspec(nothrow)
+#else
+    #define JSON_HEDLEY_NO_THROW
+#endif
+
+#if defined(JSON_HEDLEY_FALL_THROUGH)
+    #undef JSON_HEDLEY_FALL_THROUGH
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(fallthrough) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(7,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_FALL_THROUGH __attribute__((__fallthrough__))
+#elif JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(clang,fallthrough)
+    #define JSON_HEDLEY_FALL_THROUGH JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[clang::fallthrough]])
+#elif JSON_HEDLEY_HAS_CPP_ATTRIBUTE(fallthrough)
+    #define JSON_HEDLEY_FALL_THROUGH JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[fallthrough]])
+#elif defined(__fallthrough) /* SAL */
+    #define JSON_HEDLEY_FALL_THROUGH __fallthrough
+#else
+    #define JSON_HEDLEY_FALL_THROUGH
+#endif
+
+#if defined(JSON_HEDLEY_RETURNS_NON_NULL)
+    #undef JSON_HEDLEY_RETURNS_NON_NULL
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(returns_nonnull) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,9,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_RETURNS_NON_NULL __attribute__((__returns_nonnull__))
+#elif defined(_Ret_notnull_) /* SAL */
+    #define JSON_HEDLEY_RETURNS_NON_NULL _Ret_notnull_
+#else
+    #define JSON_HEDLEY_RETURNS_NON_NULL
+#endif
+
+#if defined(JSON_HEDLEY_ARRAY_PARAM)
+    #undef JSON_HEDLEY_ARRAY_PARAM
+#endif
+#if \
+    defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) && \
+    !defined(__STDC_NO_VLA__) && \
+    !defined(__cplusplus) && \
+    !defined(JSON_HEDLEY_PGI_VERSION) && \
+    !defined(JSON_HEDLEY_TINYC_VERSION)
+    #define JSON_HEDLEY_ARRAY_PARAM(name) (name)
+#else
+    #define JSON_HEDLEY_ARRAY_PARAM(name)
+#endif
+
+#if defined(JSON_HEDLEY_IS_CONSTANT)
+    #undef JSON_HEDLEY_IS_CONSTANT
+#endif
+#if defined(JSON_HEDLEY_REQUIRE_CONSTEXPR)
+    #undef JSON_HEDLEY_REQUIRE_CONSTEXPR
+#endif
+/* JSON_HEDLEY_IS_CONSTEXPR_ is for
+   HEDLEY INTERNAL USE ONLY.  API subject to change without notice. */
+#if defined(JSON_HEDLEY_IS_CONSTEXPR_)
+    #undef JSON_HEDLEY_IS_CONSTEXPR_
+#endif
+#if \
+    JSON_HEDLEY_HAS_BUILTIN(__builtin_constant_p) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,19) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(13,1,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,1,0) || \
+    (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0) && !defined(__cplusplus)) || \
+    JSON_HEDLEY_CRAY_VERSION_CHECK(8,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_IS_CONSTANT(expr) __builtin_constant_p(expr)
+#endif
+#if !defined(__cplusplus)
+#  if \
+       JSON_HEDLEY_HAS_BUILTIN(__builtin_types_compatible_p) || \
+       JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0) || \
+       JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+       JSON_HEDLEY_IBM_VERSION_CHECK(13,1,0) || \
+       JSON_HEDLEY_CRAY_VERSION_CHECK(8,1,0) || \
+       JSON_HEDLEY_ARM_VERSION_CHECK(5,4,0) || \
+       JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,24)
+#if defined(__INTPTR_TYPE__)
+    #define JSON_HEDLEY_IS_CONSTEXPR_(expr) __builtin_types_compatible_p(__typeof__((1 ? (void*) ((__INTPTR_TYPE__) ((expr) * 0)) : (int*) 0)), int*)
+#else
+    #include <stdint.h>
+    #define JSON_HEDLEY_IS_CONSTEXPR_(expr) __builtin_types_compatible_p(__typeof__((1 ? (void*) ((intptr_t) ((expr) * 0)) : (int*) 0)), int*)
+#endif
+#  elif \
+       ( \
+          defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L) && \
+          !defined(JSON_HEDLEY_SUNPRO_VERSION) && \
+          !defined(JSON_HEDLEY_PGI_VERSION) && \
+          !defined(JSON_HEDLEY_IAR_VERSION)) || \
+       (JSON_HEDLEY_HAS_EXTENSION(c_generic_selections) && !defined(JSON_HEDLEY_IAR_VERSION)) || \
+       JSON_HEDLEY_GCC_VERSION_CHECK(4,9,0) || \
+       JSON_HEDLEY_INTEL_VERSION_CHECK(17,0,0) || \
+       JSON_HEDLEY_IBM_VERSION_CHECK(12,1,0) || \
+       JSON_HEDLEY_ARM_VERSION_CHECK(5,3,0)
+#if defined(__INTPTR_TYPE__)
+    #define JSON_HEDLEY_IS_CONSTEXPR_(expr) _Generic((1 ? (void*) ((__INTPTR_TYPE__) ((expr) * 0)) : (int*) 0), int*: 1, void*: 0)
+#else
+    #include <stdint.h>
+    #define JSON_HEDLEY_IS_CONSTEXPR_(expr) _Generic((1 ? (void*) ((intptr_t) * 0) : (int*) 0), int*: 1, void*: 0)
+#endif
+#  elif \
+       defined(JSON_HEDLEY_GCC_VERSION) || \
+       defined(JSON_HEDLEY_INTEL_VERSION) || \
+       defined(JSON_HEDLEY_TINYC_VERSION) || \
+       defined(JSON_HEDLEY_TI_ARMCL_VERSION) || \
+       JSON_HEDLEY_TI_CL430_VERSION_CHECK(18,12,0) || \
+       defined(JSON_HEDLEY_TI_CL2000_VERSION) || \
+       defined(JSON_HEDLEY_TI_CL6X_VERSION) || \
+       defined(JSON_HEDLEY_TI_CL7X_VERSION) || \
+       defined(JSON_HEDLEY_TI_CLPRU_VERSION) || \
+       defined(__clang__)
+#    define JSON_HEDLEY_IS_CONSTEXPR_(expr) ( \
+        sizeof(void) != \
+        sizeof(*( \
+                  1 ? \
+                  ((void*) ((expr) * 0L) ) : \
+((struct { char v[sizeof(void) * 2]; } *) 1) \
+                ) \
+              ) \
+                                            )
+#  endif
+#endif
+#if defined(JSON_HEDLEY_IS_CONSTEXPR_)
+    #if !defined(JSON_HEDLEY_IS_CONSTANT)
+        #define JSON_HEDLEY_IS_CONSTANT(expr) JSON_HEDLEY_IS_CONSTEXPR_(expr)
+    #endif
+    #define JSON_HEDLEY_REQUIRE_CONSTEXPR(expr) (JSON_HEDLEY_IS_CONSTEXPR_(expr) ? (expr) : (-1))
+#else
+    #if !defined(JSON_HEDLEY_IS_CONSTANT)
+        #define JSON_HEDLEY_IS_CONSTANT(expr) (0)
+    #endif
+    #define JSON_HEDLEY_REQUIRE_CONSTEXPR(expr) (expr)
+#endif
+
+#if defined(JSON_HEDLEY_BEGIN_C_DECLS)
+    #undef JSON_HEDLEY_BEGIN_C_DECLS
+#endif
+#if defined(JSON_HEDLEY_END_C_DECLS)
+    #undef JSON_HEDLEY_END_C_DECLS
+#endif
+#if defined(JSON_HEDLEY_C_DECL)
+    #undef JSON_HEDLEY_C_DECL
+#endif
+#if defined(__cplusplus)
+    #define JSON_HEDLEY_BEGIN_C_DECLS extern "C" {
+    #define JSON_HEDLEY_END_C_DECLS }
+    #define JSON_HEDLEY_C_DECL extern "C"
+#else
+    #define JSON_HEDLEY_BEGIN_C_DECLS
+    #define JSON_HEDLEY_END_C_DECLS
+    #define JSON_HEDLEY_C_DECL
+#endif
+
+#if defined(JSON_HEDLEY_STATIC_ASSERT)
+    #undef JSON_HEDLEY_STATIC_ASSERT
+#endif
+#if \
+  !defined(__cplusplus) && ( \
+      (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L)) || \
+      (JSON_HEDLEY_HAS_FEATURE(c_static_assert) && !defined(JSON_HEDLEY_INTEL_CL_VERSION)) || \
+      JSON_HEDLEY_GCC_VERSION_CHECK(6,0,0) || \
+      JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+      defined(_Static_assert) \
+    )
+#  define JSON_HEDLEY_STATIC_ASSERT(expr, message) _Static_assert(expr, message)
+#elif \
+  (defined(__cplusplus) && (__cplusplus >= 201103L)) || \
+  JSON_HEDLEY_MSVC_VERSION_CHECK(16,0,0) || \
+  JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+#  define JSON_HEDLEY_STATIC_ASSERT(expr, message) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(static_assert(expr, message))
+#else
+#  define JSON_HEDLEY_STATIC_ASSERT(expr, message)
+#endif
+
+#if defined(JSON_HEDLEY_NULL)
+    #undef JSON_HEDLEY_NULL
+#endif
+#if defined(__cplusplus)
+    #if __cplusplus >= 201103L
+        #define JSON_HEDLEY_NULL JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(nullptr)
+    #elif defined(NULL)
+        #define JSON_HEDLEY_NULL NULL
+    #else
+        #define JSON_HEDLEY_NULL JSON_HEDLEY_STATIC_CAST(void*, 0)
+    #endif
+#elif defined(NULL)
+    #define JSON_HEDLEY_NULL NULL
+#else
+    #define JSON_HEDLEY_NULL ((void*) 0)
+#endif
+
+#if defined(JSON_HEDLEY_MESSAGE)
+    #undef JSON_HEDLEY_MESSAGE
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunknown-pragmas")
+#  define JSON_HEDLEY_MESSAGE(msg) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS \
+    JSON_HEDLEY_PRAGMA(message msg) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#elif \
+  JSON_HEDLEY_GCC_VERSION_CHECK(4,4,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+#  define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(message msg)
+#elif JSON_HEDLEY_CRAY_VERSION_CHECK(5,0,0)
+#  define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(_CRI message msg)
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+#  define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(message(msg))
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(2,0,0)
+#  define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(message(msg))
+#else
+#  define JSON_HEDLEY_MESSAGE(msg)
+#endif
+
+#if defined(JSON_HEDLEY_WARNING)
+    #undef JSON_HEDLEY_WARNING
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunknown-pragmas")
+#  define JSON_HEDLEY_WARNING(msg) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS \
+    JSON_HEDLEY_PRAGMA(clang warning msg) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#elif \
+  JSON_HEDLEY_GCC_VERSION_CHECK(4,8,0) || \
+  JSON_HEDLEY_PGI_VERSION_CHECK(18,4,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+#  define JSON_HEDLEY_WARNING(msg) JSON_HEDLEY_PRAGMA(GCC warning msg)
+#elif \
+  JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0) || \
+  JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+#  define JSON_HEDLEY_WARNING(msg) JSON_HEDLEY_PRAGMA(message(msg))
+#else
+#  define JSON_HEDLEY_WARNING(msg) JSON_HEDLEY_MESSAGE(msg)
+#endif
+
+#if defined(JSON_HEDLEY_REQUIRE)
+    #undef JSON_HEDLEY_REQUIRE
+#endif
+#if defined(JSON_HEDLEY_REQUIRE_MSG)
+    #undef JSON_HEDLEY_REQUIRE_MSG
+#endif
+#if JSON_HEDLEY_HAS_ATTRIBUTE(diagnose_if)
+#  if JSON_HEDLEY_HAS_WARNING("-Wgcc-compat")
+#    define JSON_HEDLEY_REQUIRE(expr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wgcc-compat\"") \
+    __attribute__((diagnose_if(!(expr), #expr, "error"))) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#    define JSON_HEDLEY_REQUIRE_MSG(expr,msg) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wgcc-compat\"") \
+    __attribute__((diagnose_if(!(expr), msg, "error"))) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#  else
+#    define JSON_HEDLEY_REQUIRE(expr) __attribute__((diagnose_if(!(expr), #expr, "error")))
+#    define JSON_HEDLEY_REQUIRE_MSG(expr,msg) __attribute__((diagnose_if(!(expr), msg, "error")))
+#  endif
+#else
+#  define JSON_HEDLEY_REQUIRE(expr)
+#  define JSON_HEDLEY_REQUIRE_MSG(expr,msg)
+#endif
+
+#if defined(JSON_HEDLEY_FLAGS)
+    #undef JSON_HEDLEY_FLAGS
+#endif
+#if JSON_HEDLEY_HAS_ATTRIBUTE(flag_enum) && (!defined(__cplusplus) || JSON_HEDLEY_HAS_WARNING("-Wbitfield-enum-conversion"))
+    #define JSON_HEDLEY_FLAGS __attribute__((__flag_enum__))
+#else
+    #define JSON_HEDLEY_FLAGS
+#endif
+
+#if defined(JSON_HEDLEY_FLAGS_CAST)
+    #undef JSON_HEDLEY_FLAGS_CAST
+#endif
+#if JSON_HEDLEY_INTEL_VERSION_CHECK(19,0,0)
+#  define JSON_HEDLEY_FLAGS_CAST(T, expr) (__extension__ ({ \
+        JSON_HEDLEY_DIAGNOSTIC_PUSH \
+        _Pragma("warning(disable:188)") \
+        ((T) (expr)); \
+        JSON_HEDLEY_DIAGNOSTIC_POP \
+    }))
+#else
+#  define JSON_HEDLEY_FLAGS_CAST(T, expr) JSON_HEDLEY_STATIC_CAST(T, expr)
+#endif
+
+#if defined(JSON_HEDLEY_EMPTY_BASES)
+    #undef JSON_HEDLEY_EMPTY_BASES
+#endif
+#if \
+    (JSON_HEDLEY_MSVC_VERSION_CHECK(19,0,23918) && !JSON_HEDLEY_MSVC_VERSION_CHECK(20,0,0)) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_EMPTY_BASES __declspec(empty_bases)
+#else
+    #define JSON_HEDLEY_EMPTY_BASES
+#endif
+
+/* Remaining macros are deprecated. */
+
+#if defined(JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK)
+    #undef JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK
+#endif
+#if defined(__clang__)
+    #define JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK(major,minor,patch) (0)
+#else
+    #define JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK(major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_CLANG_HAS_ATTRIBUTE)
+    #undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE
+#endif
+#define JSON_HEDLEY_CLANG_HAS_ATTRIBUTE(attribute) JSON_HEDLEY_HAS_ATTRIBUTE(attribute)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE)
+    #undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE
+#endif
+#define JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE(attribute) JSON_HEDLEY_HAS_CPP_ATTRIBUTE(attribute)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_BUILTIN)
+    #undef JSON_HEDLEY_CLANG_HAS_BUILTIN
+#endif
+#define JSON_HEDLEY_CLANG_HAS_BUILTIN(builtin) JSON_HEDLEY_HAS_BUILTIN(builtin)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_FEATURE)
+    #undef JSON_HEDLEY_CLANG_HAS_FEATURE
+#endif
+#define JSON_HEDLEY_CLANG_HAS_FEATURE(feature) JSON_HEDLEY_HAS_FEATURE(feature)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_EXTENSION)
+    #undef JSON_HEDLEY_CLANG_HAS_EXTENSION
+#endif
+#define JSON_HEDLEY_CLANG_HAS_EXTENSION(extension) JSON_HEDLEY_HAS_EXTENSION(extension)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE)
+    #undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE
+#endif
+#define JSON_HEDLEY_CLANG_HAS_DECLSPEC_ATTRIBUTE(attribute) JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE(attribute)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_WARNING)
+    #undef JSON_HEDLEY_CLANG_HAS_WARNING
+#endif
+#define JSON_HEDLEY_CLANG_HAS_WARNING(warning) JSON_HEDLEY_HAS_WARNING(warning)
+
+#endif /* !defined(JSON_HEDLEY_VERSION) || (JSON_HEDLEY_VERSION < X) */
+
+
+// This file contains all internal macro definitions (except those affecting ABI)
+// You MUST include macro_unscope.hpp at the end of json.hpp to undef all of them
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+// exclude unsupported compilers
+#if !defined(JSON_SKIP_UNSUPPORTED_COMPILER_CHECK)
+    #if defined(__clang__)
+        #if (__clang_major__ * 10000 + __clang_minor__ * 100 + __clang_patchlevel__) < 30400
+            #error "unsupported Clang version - see https://github.com/nlohmann/json#supported-compilers"
+        #endif
+    #elif defined(__GNUC__) && !(defined(__ICC) || defined(__INTEL_COMPILER))
+        #if (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) < 40800
+            #error "unsupported GCC version - see https://github.com/nlohmann/json#supported-compilers"
+        #endif
+    #endif
+#endif
+
+// C++ language standard detection
+// if the user manually specified the used c++ version this is skipped
+#if !defined(JSON_HAS_CPP_20) && !defined(JSON_HAS_CPP_17) && !defined(JSON_HAS_CPP_14) && !defined(JSON_HAS_CPP_11)
+    #if (defined(__cplusplus) && __cplusplus >= 202002L) || (defined(_MSVC_LANG) && _MSVC_LANG >= 202002L)
+        #define JSON_HAS_CPP_20
+        #define JSON_HAS_CPP_17
+        #define JSON_HAS_CPP_14
+    #elif (defined(__cplusplus) && __cplusplus >= 201703L) || (defined(_HAS_CXX17) && _HAS_CXX17 == 1) // fix for issue #464
+        #define JSON_HAS_CPP_17
+        #define JSON_HAS_CPP_14
+    #elif (defined(__cplusplus) && __cplusplus >= 201402L) || (defined(_HAS_CXX14) && _HAS_CXX14 == 1)
+        #define JSON_HAS_CPP_14
+    #endif
+    // the cpp 11 flag is always specified because it is the minimal required version
+    #define JSON_HAS_CPP_11
+#endif
+
+#ifdef __has_include
+    #if __has_include(<version>)
+        #include <version>
+    #endif
+#endif
+
+#if !defined(JSON_HAS_FILESYSTEM) && !defined(JSON_HAS_EXPERIMENTAL_FILESYSTEM)
+    #ifdef JSON_HAS_CPP_17
+        #if defined(__cpp_lib_filesystem)
+            #define JSON_HAS_FILESYSTEM 1
+        #elif defined(__cpp_lib_experimental_filesystem)
+            #define JSON_HAS_EXPERIMENTAL_FILESYSTEM 1
+        #elif !defined(__has_include)
+            #define JSON_HAS_EXPERIMENTAL_FILESYSTEM 1
+        #elif __has_include(<filesystem>)
+            #define JSON_HAS_FILESYSTEM 1
+        #elif __has_include(<experimental/filesystem>)
+            #define JSON_HAS_EXPERIMENTAL_FILESYSTEM 1
+        #endif
+
+        // std::filesystem does not work on MinGW GCC 8: https://sourceforge.net/p/mingw-w64/bugs/737/
+        #if defined(__MINGW32__) && defined(__GNUC__) && __GNUC__ == 8
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before GCC 8: https://en.cppreference.com/w/cpp/compiler_support
+        #if defined(__GNUC__) && !defined(__clang__) && __GNUC__ < 8
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before Clang 7: https://en.cppreference.com/w/cpp/compiler_support
+        #if defined(__clang_major__) && __clang_major__ < 7
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before MSVC 19.14: https://en.cppreference.com/w/cpp/compiler_support
+        #if defined(_MSC_VER) && _MSC_VER < 1914
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before iOS 13
+        #if defined(__IPHONE_OS_VERSION_MIN_REQUIRED) && __IPHONE_OS_VERSION_MIN_REQUIRED < 130000
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before macOS Catalina
+        #if defined(__MAC_OS_X_VERSION_MIN_REQUIRED) && __MAC_OS_X_VERSION_MIN_REQUIRED < 101500
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+    #endif
+#endif
+
+#ifndef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+    #define JSON_HAS_EXPERIMENTAL_FILESYSTEM 0
+#endif
+
+#ifndef JSON_HAS_FILESYSTEM
+    #define JSON_HAS_FILESYSTEM 0
+#endif
+
+#ifndef JSON_HAS_THREE_WAY_COMPARISON
+    #if defined(__cpp_impl_three_way_comparison) && __cpp_impl_three_way_comparison >= 201907L \
+        && defined(__cpp_lib_three_way_comparison) && __cpp_lib_three_way_comparison >= 201907L
+        #define JSON_HAS_THREE_WAY_COMPARISON 1
+    #else
+        #define JSON_HAS_THREE_WAY_COMPARISON 0
+    #endif
+#endif
+
+#ifndef JSON_HAS_RANGES
+    // ranges header shipping in GCC 11.1.0 (released 2021-04-27) has syntax error
+    #if defined(__GLIBCXX__) && __GLIBCXX__ == 20210427
+        #define JSON_HAS_RANGES 0
+    #elif defined(__cpp_lib_ranges)
+        #define JSON_HAS_RANGES 1
+    #else
+        #define JSON_HAS_RANGES 0
+    #endif
+#endif
+
+#ifdef JSON_HAS_CPP_17
+    #define JSON_INLINE_VARIABLE inline
+#else
+    #define JSON_INLINE_VARIABLE
+#endif
+
+#if JSON_HEDLEY_HAS_ATTRIBUTE(no_unique_address)
+    #define JSON_NO_UNIQUE_ADDRESS [[no_unique_address]]
+#else
+    #define JSON_NO_UNIQUE_ADDRESS
+#endif
+
+// disable documentation warnings on clang
+#if defined(__clang__)
+    #pragma clang diagnostic push
+    #pragma clang diagnostic ignored "-Wdocumentation"
+    #pragma clang diagnostic ignored "-Wdocumentation-unknown-command"
+#endif
+
+// allow disabling exceptions
+#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND)) && !defined(JSON_NOEXCEPTION)
+    #define JSON_THROW(exception) throw exception
+    #define JSON_TRY try
+    #define JSON_CATCH(exception) catch(exception)
+    #define JSON_INTERNAL_CATCH(exception) catch(exception)
+#else
+    #include <cstdlib>
+    #define JSON_THROW(exception) std::abort()
+    #define JSON_TRY if(true)
+    #define JSON_CATCH(exception) if(false)
+    #define JSON_INTERNAL_CATCH(exception) if(false)
+#endif
+
+// override exception macros
+#if defined(JSON_THROW_USER)
+    #undef JSON_THROW
+    #define JSON_THROW JSON_THROW_USER
+#endif
+#if defined(JSON_TRY_USER)
+    #undef JSON_TRY
+    #define JSON_TRY JSON_TRY_USER
+#endif
+#if defined(JSON_CATCH_USER)
+    #undef JSON_CATCH
+    #define JSON_CATCH JSON_CATCH_USER
+    #undef JSON_INTERNAL_CATCH
+    #define JSON_INTERNAL_CATCH JSON_CATCH_USER
+#endif
+#if defined(JSON_INTERNAL_CATCH_USER)
+    #undef JSON_INTERNAL_CATCH
+    #define JSON_INTERNAL_CATCH JSON_INTERNAL_CATCH_USER
+#endif
+
+// allow overriding assert
+#if !defined(JSON_ASSERT)
+    #include <cassert> // assert
+    #define JSON_ASSERT(x) assert(x)
+#endif
+
+// allow to access some private functions (needed by the test suite)
+#if defined(JSON_TESTS_PRIVATE)
+    #define JSON_PRIVATE_UNLESS_TESTED public
+#else
+    #define JSON_PRIVATE_UNLESS_TESTED private
+#endif
+
+/*!
+@brief macro to briefly define a mapping between an enum and JSON
+@def NLOHMANN_JSON_SERIALIZE_ENUM
+@since version 3.4.0
+*/
+#define NLOHMANN_JSON_SERIALIZE_ENUM(ENUM_TYPE, ...)                                            \
+    template<typename BasicJsonType>                                                            \
+    inline void to_json(BasicJsonType& j, const ENUM_TYPE& e)                                   \
+    {                                                                                           \
+        static_assert(std::is_enum<ENUM_TYPE>::value, #ENUM_TYPE " must be an enum!");          \
+        static const std::pair<ENUM_TYPE, BasicJsonType> m[] = __VA_ARGS__;                     \
+        auto it = std::find_if(std::begin(m), std::end(m),                                      \
+                               [e](const std::pair<ENUM_TYPE, BasicJsonType>& ej_pair) -> bool  \
+        {                                                                                       \
+            return ej_pair.first == e;                                                          \
+        });                                                                                     \
+        j = ((it != std::end(m)) ? it : std::begin(m))->second;                                 \
+    }                                                                                           \
+    template<typename BasicJsonType>                                                            \
+    inline void from_json(const BasicJsonType& j, ENUM_TYPE& e)                                 \
+    {                                                                                           \
+        static_assert(std::is_enum<ENUM_TYPE>::value, #ENUM_TYPE " must be an enum!");          \
+        static const std::pair<ENUM_TYPE, BasicJsonType> m[] = __VA_ARGS__;                     \
+        auto it = std::find_if(std::begin(m), std::end(m),                                      \
+                               [&j](const std::pair<ENUM_TYPE, BasicJsonType>& ej_pair) -> bool \
+        {                                                                                       \
+            return ej_pair.second == j;                                                         \
+        });                                                                                     \
+        e = ((it != std::end(m)) ? it : std::begin(m))->first;                                  \
+    }
+
+// Ugly macros to avoid uglier copy-paste when specializing basic_json. They
+// may be removed in the future once the class is split.
+
+#define NLOHMANN_BASIC_JSON_TPL_DECLARATION                                \
+    template<template<typename, typename, typename...> class ObjectType,   \
+             template<typename, typename...> class ArrayType,              \
+             class StringType, class BooleanType, class NumberIntegerType, \
+             class NumberUnsignedType, class NumberFloatType,              \
+             template<typename> class AllocatorType,                       \
+             template<typename, typename = void> class JSONSerializer,     \
+             class BinaryType>
+
+#define NLOHMANN_BASIC_JSON_TPL                                            \
+    basic_json<ObjectType, ArrayType, StringType, BooleanType,             \
+    NumberIntegerType, NumberUnsignedType, NumberFloatType,                \
+    AllocatorType, JSONSerializer, BinaryType>
+
+// Macros to simplify conversion from/to types
+
+#define NLOHMANN_JSON_EXPAND( x ) x
+#define NLOHMANN_JSON_GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55, _56, _57, _58, _59, _60, _61, _62, _63, _64, NAME,...) NAME
+#define NLOHMANN_JSON_PASTE(...) NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_GET_MACRO(__VA_ARGS__, \
+        NLOHMANN_JSON_PASTE64, \
+        NLOHMANN_JSON_PASTE63, \
+        NLOHMANN_JSON_PASTE62, \
+        NLOHMANN_JSON_PASTE61, \
+        NLOHMANN_JSON_PASTE60, \
+        NLOHMANN_JSON_PASTE59, \
+        NLOHMANN_JSON_PASTE58, \
+        NLOHMANN_JSON_PASTE57, \
+        NLOHMANN_JSON_PASTE56, \
+        NLOHMANN_JSON_PASTE55, \
+        NLOHMANN_JSON_PASTE54, \
+        NLOHMANN_JSON_PASTE53, \
+        NLOHMANN_JSON_PASTE52, \
+        NLOHMANN_JSON_PASTE51, \
+        NLOHMANN_JSON_PASTE50, \
+        NLOHMANN_JSON_PASTE49, \
+        NLOHMANN_JSON_PASTE48, \
+        NLOHMANN_JSON_PASTE47, \
+        NLOHMANN_JSON_PASTE46, \
+        NLOHMANN_JSON_PASTE45, \
+        NLOHMANN_JSON_PASTE44, \
+        NLOHMANN_JSON_PASTE43, \
+        NLOHMANN_JSON_PASTE42, \
+        NLOHMANN_JSON_PASTE41, \
+        NLOHMANN_JSON_PASTE40, \
+        NLOHMANN_JSON_PASTE39, \
+        NLOHMANN_JSON_PASTE38, \
+        NLOHMANN_JSON_PASTE37, \
+        NLOHMANN_JSON_PASTE36, \
+        NLOHMANN_JSON_PASTE35, \
+        NLOHMANN_JSON_PASTE34, \
+        NLOHMANN_JSON_PASTE33, \
+        NLOHMANN_JSON_PASTE32, \
+        NLOHMANN_JSON_PASTE31, \
+        NLOHMANN_JSON_PASTE30, \
+        NLOHMANN_JSON_PASTE29, \
+        NLOHMANN_JSON_PASTE28, \
+        NLOHMANN_JSON_PASTE27, \
+        NLOHMANN_JSON_PASTE26, \
+        NLOHMANN_JSON_PASTE25, \
+        NLOHMANN_JSON_PASTE24, \
+        NLOHMANN_JSON_PASTE23, \
+        NLOHMANN_JSON_PASTE22, \
+        NLOHMANN_JSON_PASTE21, \
+        NLOHMANN_JSON_PASTE20, \
+        NLOHMANN_JSON_PASTE19, \
+        NLOHMANN_JSON_PASTE18, \
+        NLOHMANN_JSON_PASTE17, \
+        NLOHMANN_JSON_PASTE16, \
+        NLOHMANN_JSON_PASTE15, \
+        NLOHMANN_JSON_PASTE14, \
+        NLOHMANN_JSON_PASTE13, \
+        NLOHMANN_JSON_PASTE12, \
+        NLOHMANN_JSON_PASTE11, \
+        NLOHMANN_JSON_PASTE10, \
+        NLOHMANN_JSON_PASTE9, \
+        NLOHMANN_JSON_PASTE8, \
+        NLOHMANN_JSON_PASTE7, \
+        NLOHMANN_JSON_PASTE6, \
+        NLOHMANN_JSON_PASTE5, \
+        NLOHMANN_JSON_PASTE4, \
+        NLOHMANN_JSON_PASTE3, \
+        NLOHMANN_JSON_PASTE2, \
+        NLOHMANN_JSON_PASTE1)(__VA_ARGS__))
+#define NLOHMANN_JSON_PASTE2(func, v1) func(v1)
+#define NLOHMANN_JSON_PASTE3(func, v1, v2) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE2(func, v2)
+#define NLOHMANN_JSON_PASTE4(func, v1, v2, v3) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE3(func, v2, v3)
+#define NLOHMANN_JSON_PASTE5(func, v1, v2, v3, v4) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE4(func, v2, v3, v4)
+#define NLOHMANN_JSON_PASTE6(func, v1, v2, v3, v4, v5) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE5(func, v2, v3, v4, v5)
+#define NLOHMANN_JSON_PASTE7(func, v1, v2, v3, v4, v5, v6) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE6(func, v2, v3, v4, v5, v6)
+#define NLOHMANN_JSON_PASTE8(func, v1, v2, v3, v4, v5, v6, v7) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE7(func, v2, v3, v4, v5, v6, v7)
+#define NLOHMANN_JSON_PASTE9(func, v1, v2, v3, v4, v5, v6, v7, v8) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE8(func, v2, v3, v4, v5, v6, v7, v8)
+#define NLOHMANN_JSON_PASTE10(func, v1, v2, v3, v4, v5, v6, v7, v8, v9) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE9(func, v2, v3, v4, v5, v6, v7, v8, v9)
+#define NLOHMANN_JSON_PASTE11(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE10(func, v2, v3, v4, v5, v6, v7, v8, v9, v10)
+#define NLOHMANN_JSON_PASTE12(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE11(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11)
+#define NLOHMANN_JSON_PASTE13(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE12(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12)
+#define NLOHMANN_JSON_PASTE14(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE13(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13)
+#define NLOHMANN_JSON_PASTE15(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE14(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14)
+#define NLOHMANN_JSON_PASTE16(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE15(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15)
+#define NLOHMANN_JSON_PASTE17(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE16(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16)
+#define NLOHMANN_JSON_PASTE18(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE17(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17)
+#define NLOHMANN_JSON_PASTE19(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE18(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18)
+#define NLOHMANN_JSON_PASTE20(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE19(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19)
+#define NLOHMANN_JSON_PASTE21(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE20(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20)
+#define NLOHMANN_JSON_PASTE22(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE21(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21)
+#define NLOHMANN_JSON_PASTE23(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE22(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22)
+#define NLOHMANN_JSON_PASTE24(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE23(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23)
+#define NLOHMANN_JSON_PASTE25(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE24(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24)
+#define NLOHMANN_JSON_PASTE26(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE25(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25)
+#define NLOHMANN_JSON_PASTE27(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE26(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26)
+#define NLOHMANN_JSON_PASTE28(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE27(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27)
+#define NLOHMANN_JSON_PASTE29(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE28(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28)
+#define NLOHMANN_JSON_PASTE30(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE29(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29)
+#define NLOHMANN_JSON_PASTE31(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE30(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30)
+#define NLOHMANN_JSON_PASTE32(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE31(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31)
+#define NLOHMANN_JSON_PASTE33(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE32(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32)
+#define NLOHMANN_JSON_PASTE34(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE33(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33)
+#define NLOHMANN_JSON_PASTE35(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE34(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34)
+#define NLOHMANN_JSON_PASTE36(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE35(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35)
+#define NLOHMANN_JSON_PASTE37(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE36(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36)
+#define NLOHMANN_JSON_PASTE38(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE37(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37)
+#define NLOHMANN_JSON_PASTE39(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE38(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38)
+#define NLOHMANN_JSON_PASTE40(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE39(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39)
+#define NLOHMANN_JSON_PASTE41(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE40(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40)
+#define NLOHMANN_JSON_PASTE42(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE41(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41)
+#define NLOHMANN_JSON_PASTE43(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE42(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42)
+#define NLOHMANN_JSON_PASTE44(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE43(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43)
+#define NLOHMANN_JSON_PASTE45(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE44(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44)
+#define NLOHMANN_JSON_PASTE46(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE45(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45)
+#define NLOHMANN_JSON_PASTE47(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE46(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46)
+#define NLOHMANN_JSON_PASTE48(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE47(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47)
+#define NLOHMANN_JSON_PASTE49(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE48(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48)
+#define NLOHMANN_JSON_PASTE50(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE49(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49)
+#define NLOHMANN_JSON_PASTE51(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE50(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50)
+#define NLOHMANN_JSON_PASTE52(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE51(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51)
+#define NLOHMANN_JSON_PASTE53(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE52(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52)
+#define NLOHMANN_JSON_PASTE54(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE53(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53)
+#define NLOHMANN_JSON_PASTE55(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE54(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54)
+#define NLOHMANN_JSON_PASTE56(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE55(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55)
+#define NLOHMANN_JSON_PASTE57(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE56(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56)
+#define NLOHMANN_JSON_PASTE58(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE57(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57)
+#define NLOHMANN_JSON_PASTE59(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE58(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58)
+#define NLOHMANN_JSON_PASTE60(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE59(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59)
+#define NLOHMANN_JSON_PASTE61(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE60(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60)
+#define NLOHMANN_JSON_PASTE62(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE61(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61)
+#define NLOHMANN_JSON_PASTE63(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE62(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62)
+#define NLOHMANN_JSON_PASTE64(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62, v63) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE63(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62, v63)
+
+#define NLOHMANN_JSON_TO(v1) nlohmann_json_j[#v1] = nlohmann_json_t.v1;
+#define NLOHMANN_JSON_FROM(v1) nlohmann_json_j.at(#v1).get_to(nlohmann_json_t.v1);
+#define NLOHMANN_JSON_FROM_WITH_DEFAULT(v1) nlohmann_json_t.v1 = nlohmann_json_j.value(#v1, nlohmann_json_default_obj.v1);
+
+/*!
+@brief macro
+@def NLOHMANN_DEFINE_TYPE_INTRUSIVE
+@since version 3.9.0
+*/
+#define NLOHMANN_DEFINE_TYPE_INTRUSIVE(Type, ...)  \
+    friend void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \
+    friend void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM, __VA_ARGS__)) }
+
+#define NLOHMANN_DEFINE_TYPE_INTRUSIVE_WITH_DEFAULT(Type, ...)  \
+    friend void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \
+    friend void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { Type nlohmann_json_default_obj; NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM_WITH_DEFAULT, __VA_ARGS__)) }
+
+/*!
+@brief macro
+@def NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE
+@since version 3.9.0
+*/
+#define NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Type, ...)  \
+    inline void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \
+    inline void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM, __VA_ARGS__)) }
+
+#define NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE_WITH_DEFAULT(Type, ...)  \
+    inline void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \
+    inline void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { Type nlohmann_json_default_obj; NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM_WITH_DEFAULT, __VA_ARGS__)) }
+
+
+// inspired from https://stackoverflow.com/a/26745591
+// allows to call any std function as if (e.g. with begin):
+// using std::begin; begin(x);
+//
+// it allows using the detected idiom to retrieve the return type
+// of such an expression
+#define NLOHMANN_CAN_CALL_STD_FUNC_IMPL(std_name)                                 \
+    namespace detail {                                                            \
+    using std::std_name;                                                          \
+    \
+    template<typename... T>                                                       \
+    using result_of_##std_name = decltype(std_name(std::declval<T>()...));        \
+    }                                                                             \
+    \
+    namespace detail2 {                                                           \
+    struct std_name##_tag                                                         \
+    {                                                                             \
+    };                                                                            \
+    \
+    template<typename... T>                                                       \
+    std_name##_tag std_name(T&&...);                                              \
+    \
+    template<typename... T>                                                       \
+    using result_of_##std_name = decltype(std_name(std::declval<T>()...));        \
+    \
+    template<typename... T>                                                       \
+    struct would_call_std_##std_name                                              \
+    {                                                                             \
+        static constexpr auto const value = ::nlohmann::detail::                  \
+                                            is_detected_exact<std_name##_tag, result_of_##std_name, T...>::value; \
+    };                                                                            \
+    } /* namespace detail2 */ \
+    \
+    template<typename... T>                                                       \
+    struct would_call_std_##std_name : detail2::would_call_std_##std_name<T...>   \
+    {                                                                             \
+    }
+
+#ifndef JSON_USE_IMPLICIT_CONVERSIONS
+    #define JSON_USE_IMPLICIT_CONVERSIONS 1
+#endif
+
+#if JSON_USE_IMPLICIT_CONVERSIONS
+    #define JSON_EXPLICIT
+#else
+    #define JSON_EXPLICIT explicit
+#endif
+
+#ifndef JSON_DISABLE_ENUM_SERIALIZATION
+    #define JSON_DISABLE_ENUM_SERIALIZATION 0
+#endif
+
+#ifndef JSON_USE_GLOBAL_UDLS
+    #define JSON_USE_GLOBAL_UDLS 1
+#endif
+
+#if JSON_HAS_THREE_WAY_COMPARISON
+    #include <compare> // partial_ordering
+#endif
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+///////////////////////////
+// JSON type enumeration //
+///////////////////////////
+
+/*!
+@brief the JSON type enumeration
+
+This enumeration collects the different JSON types. It is internally used to
+distinguish the stored values, and the functions @ref basic_json::is_null(),
+@ref basic_json::is_object(), @ref basic_json::is_array(),
+@ref basic_json::is_string(), @ref basic_json::is_boolean(),
+@ref basic_json::is_number() (with @ref basic_json::is_number_integer(),
+@ref basic_json::is_number_unsigned(), and @ref basic_json::is_number_float()),
+@ref basic_json::is_discarded(), @ref basic_json::is_primitive(), and
+@ref basic_json::is_structured() rely on it.
+
+@note There are three enumeration entries (number_integer, number_unsigned, and
+number_float), because the library distinguishes these three types for numbers:
+@ref basic_json::number_unsigned_t is used for unsigned integers,
+@ref basic_json::number_integer_t is used for signed integers, and
+@ref basic_json::number_float_t is used for floating-point numbers or to
+approximate integers which do not fit in the limits of their respective type.
+
+@sa see @ref basic_json::basic_json(const value_t value_type) -- create a JSON
+value with the default value for a given type
+
+@since version 1.0.0
+*/
+enum class value_t : std::uint8_t
+{
+    null,             ///< null value
+    object,           ///< object (unordered set of name/value pairs)
+    array,            ///< array (ordered collection of values)
+    string,           ///< string value
+    boolean,          ///< boolean value
+    number_integer,   ///< number value (signed integer)
+    number_unsigned,  ///< number value (unsigned integer)
+    number_float,     ///< number value (floating-point)
+    binary,           ///< binary array (ordered collection of bytes)
+    discarded         ///< discarded by the parser callback function
+};
+
+/*!
+@brief comparison operator for JSON types
+
+Returns an ordering that is similar to Python:
+- order: null < boolean < number < object < array < string < binary
+- furthermore, each type is not smaller than itself
+- discarded values are not comparable
+- binary is represented as a b"" string in python and directly comparable to a
+  string; however, making a binary array directly comparable with a string would
+  be surprising behavior in a JSON file.
+
+@since version 1.0.0
+*/
+#if JSON_HAS_THREE_WAY_COMPARISON
+    inline std::partial_ordering operator<=>(const value_t lhs, const value_t rhs) noexcept // *NOPAD*
+#else
+    inline bool operator<(const value_t lhs, const value_t rhs) noexcept
+#endif
+{
+    static constexpr std::array<std::uint8_t, 9> order = {{
+            0 /* null */, 3 /* object */, 4 /* array */, 5 /* string */,
+            1 /* boolean */, 2 /* integer */, 2 /* unsigned */, 2 /* float */,
+            6 /* binary */
+        }
+    };
+
+    const auto l_index = static_cast<std::size_t>(lhs);
+    const auto r_index = static_cast<std::size_t>(rhs);
+#if JSON_HAS_THREE_WAY_COMPARISON
+    if (l_index < order.size() && r_index < order.size())
+    {
+        return order[l_index] <=> order[r_index]; // *NOPAD*
+    }
+    return std::partial_ordering::unordered;
+#else
+    return l_index < order.size() && r_index < order.size() && order[l_index] < order[r_index];
+#endif
+}
+
+// GCC selects the built-in operator< over an operator rewritten from
+// a user-defined spaceship operator
+// Clang, MSVC, and ICC select the rewritten candidate
+// (see GCC bug https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105200)
+#if JSON_HAS_THREE_WAY_COMPARISON && defined(__GNUC__)
+inline bool operator<(const value_t lhs, const value_t rhs) noexcept
+{
+    return std::is_lt(lhs <=> rhs); // *NOPAD*
+}
+#endif
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/string_escape.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/*!
+@brief replace all occurrences of a substring by another string
+
+@param[in,out] s  the string to manipulate; changed so that all
+               occurrences of @a f are replaced with @a t
+@param[in]     f  the substring to replace with @a t
+@param[in]     t  the string to replace @a f
+
+@pre The search string @a f must not be empty. **This precondition is
+enforced with an assertion.**
+
+@since version 2.0.0
+*/
+template<typename StringType>
+inline void replace_substring(StringType& s, const StringType& f,
+                              const StringType& t)
+{
+    JSON_ASSERT(!f.empty());
+    for (auto pos = s.find(f);                // find first occurrence of f
+            pos != StringType::npos;          // make sure f was found
+            s.replace(pos, f.size(), t),      // replace with t, and
+            pos = s.find(f, pos + t.size()))  // find next occurrence of f
+    {}
+}
+
+/*!
+ * @brief string escaping as described in RFC 6901 (Sect. 4)
+ * @param[in] s string to escape
+ * @return    escaped string
+ *
+ * Note the order of escaping "~" to "~0" and "/" to "~1" is important.
+ */
+template<typename StringType>
+inline StringType escape(StringType s)
+{
+    replace_substring(s, StringType{"~"}, StringType{"~0"});
+    replace_substring(s, StringType{"/"}, StringType{"~1"});
+    return s;
+}
+
+/*!
+ * @brief string unescaping as described in RFC 6901 (Sect. 4)
+ * @param[in] s string to unescape
+ * @return    unescaped string
+ *
+ * Note the order of escaping "~1" to "/" and "~0" to "~" is important.
+ */
+template<typename StringType>
+static void unescape(StringType& s)
+{
+    replace_substring(s, StringType{"~1"}, StringType{"/"});
+    replace_substring(s, StringType{"~0"}, StringType{"~"});
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/position_t.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // size_t
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/// struct to capture the start position of the current token
+struct position_t
+{
+    /// the total number of characters read
+    std::size_t chars_read_total = 0;
+    /// the number of characters read in the current line
+    std::size_t chars_read_current_line = 0;
+    /// the number of lines read
+    std::size_t lines_read = 0;
+
+    /// conversion to size_t to preserve SAX interface
+    constexpr operator size_t() const
+    {
+        return chars_read_total;
+    }
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-FileCopyrightText: 2018 The Abseil Authors
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <cstddef> // size_t
+#include <type_traits> // conditional, enable_if, false_type, integral_constant, is_constructible, is_integral, is_same, remove_cv, remove_reference, true_type
+#include <utility> // index_sequence, make_index_sequence, index_sequence_for
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename T>
+using uncvref_t = typename std::remove_cv<typename std::remove_reference<T>::type>::type;
+
+#ifdef JSON_HAS_CPP_14
+
+// the following utilities are natively available in C++14
+using std::enable_if_t;
+using std::index_sequence;
+using std::make_index_sequence;
+using std::index_sequence_for;
+
+#else
+
+// alias templates to reduce boilerplate
+template<bool B, typename T = void>
+using enable_if_t = typename std::enable_if<B, T>::type;
+
+// The following code is taken from https://github.com/abseil/abseil-cpp/blob/10cb35e459f5ecca5b2ff107635da0bfa41011b4/absl/utility/utility.h
+// which is part of Google Abseil (https://github.com/abseil/abseil-cpp), licensed under the Apache License 2.0.
+
+//// START OF CODE FROM GOOGLE ABSEIL
+
+// integer_sequence
+//
+// Class template representing a compile-time integer sequence. An instantiation
+// of `integer_sequence<T, Ints...>` has a sequence of integers encoded in its
+// type through its template arguments (which is a common need when
+// working with C++11 variadic templates). `absl::integer_sequence` is designed
+// to be a drop-in replacement for C++14's `std::integer_sequence`.
+//
+// Example:
+//
+//   template< class T, T... Ints >
+//   void user_function(integer_sequence<T, Ints...>);
+//
+//   int main()
+//   {
+//     // user_function's `T` will be deduced to `int` and `Ints...`
+//     // will be deduced to `0, 1, 2, 3, 4`.
+//     user_function(make_integer_sequence<int, 5>());
+//   }
+template <typename T, T... Ints>
+struct integer_sequence
+{
+    using value_type = T;
+    static constexpr std::size_t size() noexcept
+    {
+        return sizeof...(Ints);
+    }
+};
+
+// index_sequence
+//
+// A helper template for an `integer_sequence` of `size_t`,
+// `absl::index_sequence` is designed to be a drop-in replacement for C++14's
+// `std::index_sequence`.
+template <size_t... Ints>
+using index_sequence = integer_sequence<size_t, Ints...>;
+
+namespace utility_internal
+{
+
+template <typename Seq, size_t SeqSize, size_t Rem>
+struct Extend;
+
+// Note that SeqSize == sizeof...(Ints). It's passed explicitly for efficiency.
+template <typename T, T... Ints, size_t SeqSize>
+struct Extend<integer_sequence<T, Ints...>, SeqSize, 0>
+{
+    using type = integer_sequence < T, Ints..., (Ints + SeqSize)... >;
+};
+
+template <typename T, T... Ints, size_t SeqSize>
+struct Extend<integer_sequence<T, Ints...>, SeqSize, 1>
+{
+    using type = integer_sequence < T, Ints..., (Ints + SeqSize)..., 2 * SeqSize >;
+};
+
+// Recursion helper for 'make_integer_sequence<T, N>'.
+// 'Gen<T, N>::type' is an alias for 'integer_sequence<T, 0, 1, ... N-1>'.
+template <typename T, size_t N>
+struct Gen
+{
+    using type =
+        typename Extend < typename Gen < T, N / 2 >::type, N / 2, N % 2 >::type;
+};
+
+template <typename T>
+struct Gen<T, 0>
+{
+    using type = integer_sequence<T>;
+};
+
+}  // namespace utility_internal
+
+// Compile-time sequences of integers
+
+// make_integer_sequence
+//
+// This template alias is equivalent to
+// `integer_sequence<int, 0, 1, ..., N-1>`, and is designed to be a drop-in
+// replacement for C++14's `std::make_integer_sequence`.
+template <typename T, T N>
+using make_integer_sequence = typename utility_internal::Gen<T, N>::type;
+
+// make_index_sequence
+//
+// This template alias is equivalent to `index_sequence<0, 1, ..., N-1>`,
+// and is designed to be a drop-in replacement for C++14's
+// `std::make_index_sequence`.
+template <size_t N>
+using make_index_sequence = make_integer_sequence<size_t, N>;
+
+// index_sequence_for
+//
+// Converts a typename pack into an index sequence of the same length, and
+// is designed to be a drop-in replacement for C++14's
+// `std::index_sequence_for()`
+template <typename... Ts>
+using index_sequence_for = make_index_sequence<sizeof...(Ts)>;
+
+//// END OF CODE FROM GOOGLE ABSEIL
+
+#endif
+
+// dispatch utility (taken from ranges-v3)
+template<unsigned N> struct priority_tag : priority_tag < N - 1 > {};
+template<> struct priority_tag<0> {};
+
+// taken from ranges-v3
+template<typename T>
+struct static_const
+{
+    static JSON_INLINE_VARIABLE constexpr T value{};
+};
+
+#ifndef JSON_HAS_CPP_17
+    template<typename T>
+    constexpr T static_const<T>::value;
+#endif
+
+template<typename T, typename... Args>
+inline constexpr std::array<T, sizeof...(Args)> make_array(Args&& ... args)
+{
+    return std::array<T, sizeof...(Args)> {{static_cast<T>(std::forward<Args>(args))...}};
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <limits> // numeric_limits
+#include <type_traits> // false_type, is_constructible, is_integral, is_same, true_type
+#include <utility> // declval
+#include <tuple> // tuple
+
+// #include <nlohmann/detail/iterators/iterator_traits.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <iterator> // random_access_iterator_tag
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/meta/void_t.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename It, typename = void>
+struct iterator_types {};
+
+template<typename It>
+struct iterator_types <
+    It,
+    void_t<typename It::difference_type, typename It::value_type, typename It::pointer,
+    typename It::reference, typename It::iterator_category >>
+{
+    using difference_type = typename It::difference_type;
+    using value_type = typename It::value_type;
+    using pointer = typename It::pointer;
+    using reference = typename It::reference;
+    using iterator_category = typename It::iterator_category;
+};
+
+// This is required as some compilers implement std::iterator_traits in a way that
+// doesn't work with SFINAE. See https://github.com/nlohmann/json/issues/1341.
+template<typename T, typename = void>
+struct iterator_traits
+{
+};
+
+template<typename T>
+struct iterator_traits < T, enable_if_t < !std::is_pointer<T>::value >>
+            : iterator_types<T>
+{
+};
+
+template<typename T>
+struct iterator_traits<T*, enable_if_t<std::is_object<T>::value>>
+{
+    using iterator_category = std::random_access_iterator_tag;
+    using value_type = T;
+    using difference_type = ptrdiff_t;
+    using pointer = T*;
+    using reference = T&;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/call_std/begin.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+NLOHMANN_CAN_CALL_STD_FUNC_IMPL(begin);
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/call_std/end.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+NLOHMANN_CAN_CALL_STD_FUNC_IMPL(end);
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/detected.hpp>
+
+// #include <nlohmann/json_fwd.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+#ifndef INCLUDE_NLOHMANN_JSON_FWD_HPP_
+    #define INCLUDE_NLOHMANN_JSON_FWD_HPP_
+
+    #include <cstdint> // int64_t, uint64_t
+    #include <map> // map
+    #include <memory> // allocator
+    #include <string> // string
+    #include <vector> // vector
+
+    // #include <nlohmann/detail/abi_macros.hpp>
+
+
+    /*!
+    @brief namespace for Niels Lohmann
+    @see https://github.com/nlohmann
+    @since version 1.0.0
+    */
+    NLOHMANN_JSON_NAMESPACE_BEGIN
+
+    /*!
+    @brief default JSONSerializer template argument
+
+    This serializer ignores the template arguments and uses ADL
+    ([argument-dependent lookup](https://en.cppreference.com/w/cpp/language/adl))
+    for serialization.
+    */
+    template<typename T = void, typename SFINAE = void>
+    struct adl_serializer;
+
+    /// a class to store JSON values
+    /// @sa https://json.nlohmann.me/api/basic_json/
+    template<template<typename U, typename V, typename... Args> class ObjectType =
+    std::map,
+    template<typename U, typename... Args> class ArrayType = std::vector,
+    class StringType = std::string, class BooleanType = bool,
+    class NumberIntegerType = std::int64_t,
+    class NumberUnsignedType = std::uint64_t,
+    class NumberFloatType = double,
+    template<typename U> class AllocatorType = std::allocator,
+    template<typename T, typename SFINAE = void> class JSONSerializer =
+    adl_serializer,
+    class BinaryType = std::vector<std::uint8_t>>
+    class basic_json;
+
+    /// @brief JSON Pointer defines a string syntax for identifying a specific value within a JSON document
+    /// @sa https://json.nlohmann.me/api/json_pointer/
+    template<typename RefStringType>
+    class json_pointer;
+
+    /*!
+    @brief default specialization
+    @sa https://json.nlohmann.me/api/json/
+    */
+    using json = basic_json<>;
+
+    /// @brief a minimal map-like container that preserves insertion order
+    /// @sa https://json.nlohmann.me/api/ordered_map/
+    template<class Key, class T, class IgnoredLess, class Allocator>
+    struct ordered_map;
+
+    /// @brief specialization that maintains the insertion order of object keys
+    /// @sa https://json.nlohmann.me/api/ordered_json/
+    using ordered_json = basic_json<nlohmann::ordered_map>;
+
+    NLOHMANN_JSON_NAMESPACE_END
+
+#endif  // INCLUDE_NLOHMANN_JSON_FWD_HPP_
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+/*!
+@brief detail namespace with internal helper functions
+
+This namespace collects functions that should not be exposed,
+implementations of some @ref basic_json methods, and meta-programming helpers.
+
+@since version 2.1.0
+*/
+namespace detail
+{
+
+/////////////
+// helpers //
+/////////////
+
+// Note to maintainers:
+//
+// Every trait in this file expects a non CV-qualified type.
+// The only exceptions are in the 'aliases for detected' section
+// (i.e. those of the form: decltype(T::member_function(std::declval<T>())))
+//
+// In this case, T has to be properly CV-qualified to constraint the function arguments
+// (e.g. to_json(BasicJsonType&, const T&))
+
+template<typename> struct is_basic_json : std::false_type {};
+
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+struct is_basic_json<NLOHMANN_BASIC_JSON_TPL> : std::true_type {};
+
+// used by exceptions create() member functions
+// true_type for pointer to possibly cv-qualified basic_json or std::nullptr_t
+// false_type otherwise
+template<typename BasicJsonContext>
+struct is_basic_json_context :
+    std::integral_constant < bool,
+    is_basic_json<typename std::remove_cv<typename std::remove_pointer<BasicJsonContext>::type>::type>::value
+    || std::is_same<BasicJsonContext, std::nullptr_t>::value >
+{};
+
+//////////////////////
+// json_ref helpers //
+//////////////////////
+
+template<typename>
+class json_ref;
+
+template<typename>
+struct is_json_ref : std::false_type {};
+
+template<typename T>
+struct is_json_ref<json_ref<T>> : std::true_type {};
+
+//////////////////////////
+// aliases for detected //
+//////////////////////////
+
+template<typename T>
+using mapped_type_t = typename T::mapped_type;
+
+template<typename T>
+using key_type_t = typename T::key_type;
+
+template<typename T>
+using value_type_t = typename T::value_type;
+
+template<typename T>
+using difference_type_t = typename T::difference_type;
+
+template<typename T>
+using pointer_t = typename T::pointer;
+
+template<typename T>
+using reference_t = typename T::reference;
+
+template<typename T>
+using iterator_category_t = typename T::iterator_category;
+
+template<typename T, typename... Args>
+using to_json_function = decltype(T::to_json(std::declval<Args>()...));
+
+template<typename T, typename... Args>
+using from_json_function = decltype(T::from_json(std::declval<Args>()...));
+
+template<typename T, typename U>
+using get_template_function = decltype(std::declval<T>().template get<U>());
+
+// trait checking if JSONSerializer<T>::from_json(json const&, udt&) exists
+template<typename BasicJsonType, typename T, typename = void>
+struct has_from_json : std::false_type {};
+
+// trait checking if j.get<T> is valid
+// use this trait instead of std::is_constructible or std::is_convertible,
+// both rely on, or make use of implicit conversions, and thus fail when T
+// has several constructors/operator= (see https://github.com/nlohmann/json/issues/958)
+template <typename BasicJsonType, typename T>
+struct is_getable
+{
+    static constexpr bool value = is_detected<get_template_function, const BasicJsonType&, T>::value;
+};
+
+template<typename BasicJsonType, typename T>
+struct has_from_json < BasicJsonType, T, enable_if_t < !is_basic_json<T>::value >>
+{
+    using serializer = typename BasicJsonType::template json_serializer<T, void>;
+
+    static constexpr bool value =
+        is_detected_exact<void, from_json_function, serializer,
+        const BasicJsonType&, T&>::value;
+};
+
+// This trait checks if JSONSerializer<T>::from_json(json const&) exists
+// this overload is used for non-default-constructible user-defined-types
+template<typename BasicJsonType, typename T, typename = void>
+struct has_non_default_from_json : std::false_type {};
+
+template<typename BasicJsonType, typename T>
+struct has_non_default_from_json < BasicJsonType, T, enable_if_t < !is_basic_json<T>::value >>
+{
+    using serializer = typename BasicJsonType::template json_serializer<T, void>;
+
+    static constexpr bool value =
+        is_detected_exact<T, from_json_function, serializer,
+        const BasicJsonType&>::value;
+};
+
+// This trait checks if BasicJsonType::json_serializer<T>::to_json exists
+// Do not evaluate the trait when T is a basic_json type, to avoid template instantiation infinite recursion.
+template<typename BasicJsonType, typename T, typename = void>
+struct has_to_json : std::false_type {};
+
+template<typename BasicJsonType, typename T>
+struct has_to_json < BasicJsonType, T, enable_if_t < !is_basic_json<T>::value >>
+{
+    using serializer = typename BasicJsonType::template json_serializer<T, void>;
+
+    static constexpr bool value =
+        is_detected_exact<void, to_json_function, serializer, BasicJsonType&,
+        T>::value;
+};
+
+template<typename T>
+using detect_key_compare = typename T::key_compare;
+
+template<typename T>
+struct has_key_compare : std::integral_constant<bool, is_detected<detect_key_compare, T>::value> {};
+
+// obtains the actual object key comparator
+template<typename BasicJsonType>
+struct actual_object_comparator
+{
+    using object_t = typename BasicJsonType::object_t;
+    using object_comparator_t = typename BasicJsonType::default_object_comparator_t;
+    using type = typename std::conditional < has_key_compare<object_t>::value,
+          typename object_t::key_compare, object_comparator_t>::type;
+};
+
+template<typename BasicJsonType>
+using actual_object_comparator_t = typename actual_object_comparator<BasicJsonType>::type;
+
+///////////////////
+// is_ functions //
+///////////////////
+
+// https://en.cppreference.com/w/cpp/types/conjunction
+template<class...> struct conjunction : std::true_type { };
+template<class B> struct conjunction<B> : B { };
+template<class B, class... Bn>
+struct conjunction<B, Bn...>
+: std::conditional<static_cast<bool>(B::value), conjunction<Bn...>, B>::type {};
+
+// https://en.cppreference.com/w/cpp/types/negation
+template<class B> struct negation : std::integral_constant < bool, !B::value > { };
+
+// Reimplementation of is_constructible and is_default_constructible, due to them being broken for
+// std::pair and std::tuple until LWG 2367 fix (see https://cplusplus.github.io/LWG/lwg-defects.html#2367).
+// This causes compile errors in e.g. clang 3.5 or gcc 4.9.
+template <typename T>
+struct is_default_constructible : std::is_default_constructible<T> {};
+
+template <typename T1, typename T2>
+struct is_default_constructible<std::pair<T1, T2>>
+            : conjunction<is_default_constructible<T1>, is_default_constructible<T2>> {};
+
+template <typename T1, typename T2>
+struct is_default_constructible<const std::pair<T1, T2>>
+            : conjunction<is_default_constructible<T1>, is_default_constructible<T2>> {};
+
+template <typename... Ts>
+struct is_default_constructible<std::tuple<Ts...>>
+            : conjunction<is_default_constructible<Ts>...> {};
+
+template <typename... Ts>
+struct is_default_constructible<const std::tuple<Ts...>>
+            : conjunction<is_default_constructible<Ts>...> {};
+
+
+template <typename T, typename... Args>
+struct is_constructible : std::is_constructible<T, Args...> {};
+
+template <typename T1, typename T2>
+struct is_constructible<std::pair<T1, T2>> : is_default_constructible<std::pair<T1, T2>> {};
+
+template <typename T1, typename T2>
+struct is_constructible<const std::pair<T1, T2>> : is_default_constructible<const std::pair<T1, T2>> {};
+
+template <typename... Ts>
+struct is_constructible<std::tuple<Ts...>> : is_default_constructible<std::tuple<Ts...>> {};
+
+template <typename... Ts>
+struct is_constructible<const std::tuple<Ts...>> : is_default_constructible<const std::tuple<Ts...>> {};
+
+
+template<typename T, typename = void>
+struct is_iterator_traits : std::false_type {};
+
+template<typename T>
+struct is_iterator_traits<iterator_traits<T>>
+{
+  private:
+    using traits = iterator_traits<T>;
+
+  public:
+    static constexpr auto value =
+        is_detected<value_type_t, traits>::value &&
+        is_detected<difference_type_t, traits>::value &&
+        is_detected<pointer_t, traits>::value &&
+        is_detected<iterator_category_t, traits>::value &&
+        is_detected<reference_t, traits>::value;
+};
+
+template<typename T>
+struct is_range
+{
+  private:
+    using t_ref = typename std::add_lvalue_reference<T>::type;
+
+    using iterator = detected_t<result_of_begin, t_ref>;
+    using sentinel = detected_t<result_of_end, t_ref>;
+
+    // to be 100% correct, it should use https://en.cppreference.com/w/cpp/iterator/input_or_output_iterator
+    // and https://en.cppreference.com/w/cpp/iterator/sentinel_for
+    // but reimplementing these would be too much work, as a lot of other concepts are used underneath
+    static constexpr auto is_iterator_begin =
+        is_iterator_traits<iterator_traits<iterator>>::value;
+
+  public:
+    static constexpr bool value = !std::is_same<iterator, nonesuch>::value && !std::is_same<sentinel, nonesuch>::value && is_iterator_begin;
+};
+
+template<typename R>
+using iterator_t = enable_if_t<is_range<R>::value, result_of_begin<decltype(std::declval<R&>())>>;
+
+template<typename T>
+using range_value_t = value_type_t<iterator_traits<iterator_t<T>>>;
+
+// The following implementation of is_complete_type is taken from
+// https://blogs.msdn.microsoft.com/vcblog/2015/12/02/partial-support-for-expression-sfinae-in-vs-2015-update-1/
+// and is written by Xiang Fan who agreed to using it in this library.
+
+template<typename T, typename = void>
+struct is_complete_type : std::false_type {};
+
+template<typename T>
+struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {};
+
+template<typename BasicJsonType, typename CompatibleObjectType,
+         typename = void>
+struct is_compatible_object_type_impl : std::false_type {};
+
+template<typename BasicJsonType, typename CompatibleObjectType>
+struct is_compatible_object_type_impl <
+    BasicJsonType, CompatibleObjectType,
+    enable_if_t < is_detected<mapped_type_t, CompatibleObjectType>::value&&
+    is_detected<key_type_t, CompatibleObjectType>::value >>
+{
+    using object_t = typename BasicJsonType::object_t;
+
+    // macOS's is_constructible does not play well with nonesuch...
+    static constexpr bool value =
+        is_constructible<typename object_t::key_type,
+        typename CompatibleObjectType::key_type>::value &&
+        is_constructible<typename object_t::mapped_type,
+        typename CompatibleObjectType::mapped_type>::value;
+};
+
+template<typename BasicJsonType, typename CompatibleObjectType>
+struct is_compatible_object_type
+    : is_compatible_object_type_impl<BasicJsonType, CompatibleObjectType> {};
+
+template<typename BasicJsonType, typename ConstructibleObjectType,
+         typename = void>
+struct is_constructible_object_type_impl : std::false_type {};
+
+template<typename BasicJsonType, typename ConstructibleObjectType>
+struct is_constructible_object_type_impl <
+    BasicJsonType, ConstructibleObjectType,
+    enable_if_t < is_detected<mapped_type_t, ConstructibleObjectType>::value&&
+    is_detected<key_type_t, ConstructibleObjectType>::value >>
+{
+    using object_t = typename BasicJsonType::object_t;
+
+    static constexpr bool value =
+        (is_default_constructible<ConstructibleObjectType>::value &&
+         (std::is_move_assignable<ConstructibleObjectType>::value ||
+          std::is_copy_assignable<ConstructibleObjectType>::value) &&
+         (is_constructible<typename ConstructibleObjectType::key_type,
+          typename object_t::key_type>::value &&
+          std::is_same <
+          typename object_t::mapped_type,
+          typename ConstructibleObjectType::mapped_type >::value)) ||
+        (has_from_json<BasicJsonType,
+         typename ConstructibleObjectType::mapped_type>::value ||
+         has_non_default_from_json <
+         BasicJsonType,
+         typename ConstructibleObjectType::mapped_type >::value);
+};
+
+template<typename BasicJsonType, typename ConstructibleObjectType>
+struct is_constructible_object_type
+    : is_constructible_object_type_impl<BasicJsonType,
+      ConstructibleObjectType> {};
+
+template<typename BasicJsonType, typename CompatibleStringType>
+struct is_compatible_string_type
+{
+    static constexpr auto value =
+        is_constructible<typename BasicJsonType::string_t, CompatibleStringType>::value;
+};
+
+template<typename BasicJsonType, typename ConstructibleStringType>
+struct is_constructible_string_type
+{
+    // launder type through decltype() to fix compilation failure on ICPC
+#ifdef __INTEL_COMPILER
+    using laundered_type = decltype(std::declval<ConstructibleStringType>());
+#else
+    using laundered_type = ConstructibleStringType;
+#endif
+
+    static constexpr auto value =
+        conjunction <
+        is_constructible<laundered_type, typename BasicJsonType::string_t>,
+        is_detected_exact<typename BasicJsonType::string_t::value_type,
+        value_type_t, laundered_type >>::value;
+};
+
+template<typename BasicJsonType, typename CompatibleArrayType, typename = void>
+struct is_compatible_array_type_impl : std::false_type {};
+
+template<typename BasicJsonType, typename CompatibleArrayType>
+struct is_compatible_array_type_impl <
+    BasicJsonType, CompatibleArrayType,
+    enable_if_t <
+    is_detected<iterator_t, CompatibleArrayType>::value&&
+    is_iterator_traits<iterator_traits<detected_t<iterator_t, CompatibleArrayType>>>::value&&
+// special case for types like std::filesystem::path whose iterator's value_type are themselves
+// c.f. https://github.com/nlohmann/json/pull/3073
+    !std::is_same<CompatibleArrayType, detected_t<range_value_t, CompatibleArrayType>>::value >>
+{
+    static constexpr bool value =
+        is_constructible<BasicJsonType,
+        range_value_t<CompatibleArrayType>>::value;
+};
+
+template<typename BasicJsonType, typename CompatibleArrayType>
+struct is_compatible_array_type
+    : is_compatible_array_type_impl<BasicJsonType, CompatibleArrayType> {};
+
+template<typename BasicJsonType, typename ConstructibleArrayType, typename = void>
+struct is_constructible_array_type_impl : std::false_type {};
+
+template<typename BasicJsonType, typename ConstructibleArrayType>
+struct is_constructible_array_type_impl <
+    BasicJsonType, ConstructibleArrayType,
+    enable_if_t<std::is_same<ConstructibleArrayType,
+    typename BasicJsonType::value_type>::value >>
+            : std::true_type {};
+
+template<typename BasicJsonType, typename ConstructibleArrayType>
+struct is_constructible_array_type_impl <
+    BasicJsonType, ConstructibleArrayType,
+    enable_if_t < !std::is_same<ConstructibleArrayType,
+    typename BasicJsonType::value_type>::value&&
+    !is_compatible_string_type<BasicJsonType, ConstructibleArrayType>::value&&
+    is_default_constructible<ConstructibleArrayType>::value&&
+(std::is_move_assignable<ConstructibleArrayType>::value ||
+ std::is_copy_assignable<ConstructibleArrayType>::value)&&
+is_detected<iterator_t, ConstructibleArrayType>::value&&
+is_iterator_traits<iterator_traits<detected_t<iterator_t, ConstructibleArrayType>>>::value&&
+is_detected<range_value_t, ConstructibleArrayType>::value&&
+// special case for types like std::filesystem::path whose iterator's value_type are themselves
+// c.f. https://github.com/nlohmann/json/pull/3073
+!std::is_same<ConstructibleArrayType, detected_t<range_value_t, ConstructibleArrayType>>::value&&
+        is_complete_type <
+        detected_t<range_value_t, ConstructibleArrayType >>::value >>
+{
+    using value_type = range_value_t<ConstructibleArrayType>;
+
+    static constexpr bool value =
+        std::is_same<value_type,
+        typename BasicJsonType::array_t::value_type>::value ||
+        has_from_json<BasicJsonType,
+        value_type>::value ||
+        has_non_default_from_json <
+        BasicJsonType,
+        value_type >::value;
+};
+
+template<typename BasicJsonType, typename ConstructibleArrayType>
+struct is_constructible_array_type
+    : is_constructible_array_type_impl<BasicJsonType, ConstructibleArrayType> {};
+
+template<typename RealIntegerType, typename CompatibleNumberIntegerType,
+         typename = void>
+struct is_compatible_integer_type_impl : std::false_type {};
+
+template<typename RealIntegerType, typename CompatibleNumberIntegerType>
+struct is_compatible_integer_type_impl <
+    RealIntegerType, CompatibleNumberIntegerType,
+    enable_if_t < std::is_integral<RealIntegerType>::value&&
+    std::is_integral<CompatibleNumberIntegerType>::value&&
+    !std::is_same<bool, CompatibleNumberIntegerType>::value >>
+{
+    // is there an assert somewhere on overflows?
+    using RealLimits = std::numeric_limits<RealIntegerType>;
+    using CompatibleLimits = std::numeric_limits<CompatibleNumberIntegerType>;
+
+    static constexpr auto value =
+        is_constructible<RealIntegerType,
+        CompatibleNumberIntegerType>::value &&
+        CompatibleLimits::is_integer &&
+        RealLimits::is_signed == CompatibleLimits::is_signed;
+};
+
+template<typename RealIntegerType, typename CompatibleNumberIntegerType>
+struct is_compatible_integer_type
+    : is_compatible_integer_type_impl<RealIntegerType,
+      CompatibleNumberIntegerType> {};
+
+template<typename BasicJsonType, typename CompatibleType, typename = void>
+struct is_compatible_type_impl: std::false_type {};
+
+template<typename BasicJsonType, typename CompatibleType>
+struct is_compatible_type_impl <
+    BasicJsonType, CompatibleType,
+    enable_if_t<is_complete_type<CompatibleType>::value >>
+{
+    static constexpr bool value =
+        has_to_json<BasicJsonType, CompatibleType>::value;
+};
+
+template<typename BasicJsonType, typename CompatibleType>
+struct is_compatible_type
+    : is_compatible_type_impl<BasicJsonType, CompatibleType> {};
+
+template<typename T1, typename T2>
+struct is_constructible_tuple : std::false_type {};
+
+template<typename T1, typename... Args>
+struct is_constructible_tuple<T1, std::tuple<Args...>> : conjunction<is_constructible<T1, Args>...> {};
+
+template<typename BasicJsonType, typename T>
+struct is_json_iterator_of : std::false_type {};
+
+template<typename BasicJsonType>
+struct is_json_iterator_of<BasicJsonType, typename BasicJsonType::iterator> : std::true_type {};
+
+template<typename BasicJsonType>
+struct is_json_iterator_of<BasicJsonType, typename BasicJsonType::const_iterator> : std::true_type
+{};
+
+// checks if a given type T is a template specialization of Primary
+template<template <typename...> class Primary, typename T>
+struct is_specialization_of : std::false_type {};
+
+template<template <typename...> class Primary, typename... Args>
+struct is_specialization_of<Primary, Primary<Args...>> : std::true_type {};
+
+template<typename T>
+using is_json_pointer = is_specialization_of<::nlohmann::json_pointer, uncvref_t<T>>;
+
+// checks if A and B are comparable using Compare functor
+template<typename Compare, typename A, typename B, typename = void>
+struct is_comparable : std::false_type {};
+
+template<typename Compare, typename A, typename B>
+struct is_comparable<Compare, A, B, void_t<
+decltype(std::declval<Compare>()(std::declval<A>(), std::declval<B>())),
+decltype(std::declval<Compare>()(std::declval<B>(), std::declval<A>()))
+>> : std::true_type {};
+
+template<typename T>
+using detect_is_transparent = typename T::is_transparent;
+
+// type trait to check if KeyType can be used as object key (without a BasicJsonType)
+// see is_usable_as_basic_json_key_type below
+template<typename Comparator, typename ObjectKeyType, typename KeyTypeCVRef, bool RequireTransparentComparator = true,
+         bool ExcludeObjectKeyType = RequireTransparentComparator, typename KeyType = uncvref_t<KeyTypeCVRef>>
+using is_usable_as_key_type = typename std::conditional <
+                              is_comparable<Comparator, ObjectKeyType, KeyTypeCVRef>::value
+                              && !(ExcludeObjectKeyType && std::is_same<KeyType,
+                                   ObjectKeyType>::value)
+                              && (!RequireTransparentComparator
+                                  || is_detected <detect_is_transparent, Comparator>::value)
+                              && !is_json_pointer<KeyType>::value,
+                              std::true_type,
+                              std::false_type >::type;
+
+// type trait to check if KeyType can be used as object key
+// true if:
+//   - KeyType is comparable with BasicJsonType::object_t::key_type
+//   - if ExcludeObjectKeyType is true, KeyType is not BasicJsonType::object_t::key_type
+//   - the comparator is transparent or RequireTransparentComparator is false
+//   - KeyType is not a JSON iterator or json_pointer
+template<typename BasicJsonType, typename KeyTypeCVRef, bool RequireTransparentComparator = true,
+         bool ExcludeObjectKeyType = RequireTransparentComparator, typename KeyType = uncvref_t<KeyTypeCVRef>>
+using is_usable_as_basic_json_key_type = typename std::conditional <
+        is_usable_as_key_type<typename BasicJsonType::object_comparator_t,
+        typename BasicJsonType::object_t::key_type, KeyTypeCVRef,
+        RequireTransparentComparator, ExcludeObjectKeyType>::value
+        && !is_json_iterator_of<BasicJsonType, KeyType>::value,
+        std::true_type,
+        std::false_type >::type;
+
+template<typename ObjectType, typename KeyType>
+using detect_erase_with_key_type = decltype(std::declval<ObjectType&>().erase(std::declval<KeyType>()));
+
+// type trait to check if object_t has an erase() member functions accepting KeyType
+template<typename BasicJsonType, typename KeyType>
+using has_erase_with_key_type = typename std::conditional <
+                                is_detected <
+                                detect_erase_with_key_type,
+                                typename BasicJsonType::object_t, KeyType >::value,
+                                std::true_type,
+                                std::false_type >::type;
+
+// a naive helper to check if a type is an ordered_map (exploits the fact that
+// ordered_map inherits capacity() from std::vector)
+template <typename T>
+struct is_ordered_map
+{
+    using one = char;
+
+    struct two
+    {
+        char x[2]; // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+    };
+
+    template <typename C> static one test( decltype(&C::capacity) ) ;
+    template <typename C> static two test(...);
+
+    enum { value = sizeof(test<T>(nullptr)) == sizeof(char) }; // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+};
+
+// to avoid useless casts (see https://github.com/nlohmann/json/issues/2893#issuecomment-889152324)
+template < typename T, typename U, enable_if_t < !std::is_same<T, U>::value, int > = 0 >
+T conditional_static_cast(U value)
+{
+    return static_cast<T>(value);
+}
+
+template<typename T, typename U, enable_if_t<std::is_same<T, U>::value, int> = 0>
+T conditional_static_cast(U value)
+{
+    return value;
+}
+
+template<typename... Types>
+using all_integral = conjunction<std::is_integral<Types>...>;
+
+template<typename... Types>
+using all_signed = conjunction<std::is_signed<Types>...>;
+
+template<typename... Types>
+using all_unsigned = conjunction<std::is_unsigned<Types>...>;
+
+// there's a disjunction trait in another PR; replace when merged
+template<typename... Types>
+using same_sign = std::integral_constant < bool,
+      all_signed<Types...>::value || all_unsigned<Types...>::value >;
+
+template<typename OfType, typename T>
+using never_out_of_range = std::integral_constant < bool,
+      (std::is_signed<OfType>::value && (sizeof(T) < sizeof(OfType)))
+      || (same_sign<OfType, T>::value && sizeof(OfType) == sizeof(T)) >;
+
+template<typename OfType, typename T,
+         bool OfTypeSigned = std::is_signed<OfType>::value,
+         bool TSigned = std::is_signed<T>::value>
+struct value_in_range_of_impl2;
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl2<OfType, T, false, false>
+{
+    static constexpr bool test(T val)
+    {
+        using CommonType = typename std::common_type<OfType, T>::type;
+        return static_cast<CommonType>(val) <= static_cast<CommonType>((std::numeric_limits<OfType>::max)());
+    }
+};
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl2<OfType, T, true, false>
+{
+    static constexpr bool test(T val)
+    {
+        using CommonType = typename std::common_type<OfType, T>::type;
+        return static_cast<CommonType>(val) <= static_cast<CommonType>((std::numeric_limits<OfType>::max)());
+    }
+};
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl2<OfType, T, false, true>
+{
+    static constexpr bool test(T val)
+    {
+        using CommonType = typename std::common_type<OfType, T>::type;
+        return val >= 0 && static_cast<CommonType>(val) <= static_cast<CommonType>((std::numeric_limits<OfType>::max)());
+    }
+};
+
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl2<OfType, T, true, true>
+{
+    static constexpr bool test(T val)
+    {
+        using CommonType = typename std::common_type<OfType, T>::type;
+        return static_cast<CommonType>(val) >= static_cast<CommonType>((std::numeric_limits<OfType>::min)())
+               && static_cast<CommonType>(val) <= static_cast<CommonType>((std::numeric_limits<OfType>::max)());
+    }
+};
+
+template<typename OfType, typename T,
+         bool NeverOutOfRange = never_out_of_range<OfType, T>::value,
+         typename = detail::enable_if_t<all_integral<OfType, T>::value>>
+struct value_in_range_of_impl1;
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl1<OfType, T, false>
+{
+    static constexpr bool test(T val)
+    {
+        return value_in_range_of_impl2<OfType, T>::test(val);
+    }
+};
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl1<OfType, T, true>
+{
+    static constexpr bool test(T /*val*/)
+    {
+        return true;
+    }
+};
+
+template<typename OfType, typename T>
+inline constexpr bool value_in_range_of(T val)
+{
+    return value_in_range_of_impl1<OfType, T>::test(val);
+}
+
+template<bool Value>
+using bool_constant = std::integral_constant<bool, Value>;
+
+///////////////////////////////////////////////////////////////////////////////
+// is_c_string
+///////////////////////////////////////////////////////////////////////////////
+
+namespace impl
+{
+
+template<typename T>
+inline constexpr bool is_c_string()
+{
+    using TUnExt = typename std::remove_extent<T>::type;
+    using TUnCVExt = typename std::remove_cv<TUnExt>::type;
+    using TUnPtr = typename std::remove_pointer<T>::type;
+    using TUnCVPtr = typename std::remove_cv<TUnPtr>::type;
+    return
+        (std::is_array<T>::value && std::is_same<TUnCVExt, char>::value)
+        || (std::is_pointer<T>::value && std::is_same<TUnCVPtr, char>::value);
+}
+
+}  // namespace impl
+
+// checks whether T is a [cv] char */[cv] char[] C string
+template<typename T>
+struct is_c_string : bool_constant<impl::is_c_string<T>()> {};
+
+template<typename T>
+using is_c_string_uncvref = is_c_string<uncvref_t<T>>;
+
+///////////////////////////////////////////////////////////////////////////////
+// is_transparent
+///////////////////////////////////////////////////////////////////////////////
+
+namespace impl
+{
+
+template<typename T>
+inline constexpr bool is_transparent()
+{
+    return is_detected<detect_is_transparent, T>::value;
+}
+
+}  // namespace impl
+
+// checks whether T has a member named is_transparent
+template<typename T>
+struct is_transparent : bool_constant<impl::is_transparent<T>()> {};
+
+///////////////////////////////////////////////////////////////////////////////
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/string_concat.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstring> // strlen
+#include <string> // string
+#include <utility> // forward
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/detected.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+inline std::size_t concat_length()
+{
+    return 0;
+}
+
+template<typename... Args>
+inline std::size_t concat_length(const char* cstr, Args&& ... rest);
+
+template<typename StringType, typename... Args>
+inline std::size_t concat_length(const StringType& str, Args&& ... rest);
+
+template<typename... Args>
+inline std::size_t concat_length(const char /*c*/, Args&& ... rest)
+{
+    return 1 + concat_length(std::forward<Args>(rest)...);
+}
+
+template<typename... Args>
+inline std::size_t concat_length(const char* cstr, Args&& ... rest)
+{
+    // cppcheck-suppress ignoredReturnValue
+    return ::strlen(cstr) + concat_length(std::forward<Args>(rest)...);
+}
+
+template<typename StringType, typename... Args>
+inline std::size_t concat_length(const StringType& str, Args&& ... rest)
+{
+    return str.size() + concat_length(std::forward<Args>(rest)...);
+}
+
+template<typename OutStringType>
+inline void concat_into(OutStringType& /*out*/)
+{}
+
+template<typename StringType, typename Arg>
+using string_can_append = decltype(std::declval<StringType&>().append(std::declval < Arg && > ()));
+
+template<typename StringType, typename Arg>
+using detect_string_can_append = is_detected<string_can_append, StringType, Arg>;
+
+template<typename StringType, typename Arg>
+using string_can_append_op = decltype(std::declval<StringType&>() += std::declval < Arg && > ());
+
+template<typename StringType, typename Arg>
+using detect_string_can_append_op = is_detected<string_can_append_op, StringType, Arg>;
+
+template<typename StringType, typename Arg>
+using string_can_append_iter = decltype(std::declval<StringType&>().append(std::declval<const Arg&>().begin(), std::declval<const Arg&>().end()));
+
+template<typename StringType, typename Arg>
+using detect_string_can_append_iter = is_detected<string_can_append_iter, StringType, Arg>;
+
+template<typename StringType, typename Arg>
+using string_can_append_data = decltype(std::declval<StringType&>().append(std::declval<const Arg&>().data(), std::declval<const Arg&>().size()));
+
+template<typename StringType, typename Arg>
+using detect_string_can_append_data = is_detected<string_can_append_data, StringType, Arg>;
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && detect_string_can_append_op<OutStringType, Arg>::value, int > = 0 >
+inline void concat_into(OutStringType& out, Arg && arg, Args && ... rest);
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && !detect_string_can_append_op<OutStringType, Arg>::value
+                         && detect_string_can_append_iter<OutStringType, Arg>::value, int > = 0 >
+inline void concat_into(OutStringType& out, const Arg& arg, Args && ... rest);
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && !detect_string_can_append_op<OutStringType, Arg>::value
+                         && !detect_string_can_append_iter<OutStringType, Arg>::value
+                         && detect_string_can_append_data<OutStringType, Arg>::value, int > = 0 >
+inline void concat_into(OutStringType& out, const Arg& arg, Args && ... rest);
+
+template<typename OutStringType, typename Arg, typename... Args,
+         enable_if_t<detect_string_can_append<OutStringType, Arg>::value, int> = 0>
+inline void concat_into(OutStringType& out, Arg && arg, Args && ... rest)
+{
+    out.append(std::forward<Arg>(arg));
+    concat_into(out, std::forward<Args>(rest)...);
+}
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && detect_string_can_append_op<OutStringType, Arg>::value, int > >
+inline void concat_into(OutStringType& out, Arg&& arg, Args&& ... rest)
+{
+    out += std::forward<Arg>(arg);
+    concat_into(out, std::forward<Args>(rest)...);
+}
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && !detect_string_can_append_op<OutStringType, Arg>::value
+                         && detect_string_can_append_iter<OutStringType, Arg>::value, int > >
+inline void concat_into(OutStringType& out, const Arg& arg, Args&& ... rest)
+{
+    out.append(arg.begin(), arg.end());
+    concat_into(out, std::forward<Args>(rest)...);
+}
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && !detect_string_can_append_op<OutStringType, Arg>::value
+                         && !detect_string_can_append_iter<OutStringType, Arg>::value
+                         && detect_string_can_append_data<OutStringType, Arg>::value, int > >
+inline void concat_into(OutStringType& out, const Arg& arg, Args&& ... rest)
+{
+    out.append(arg.data(), arg.size());
+    concat_into(out, std::forward<Args>(rest)...);
+}
+
+template<typename OutStringType = std::string, typename... Args>
+inline OutStringType concat(Args && ... args)
+{
+    OutStringType str;
+    str.reserve(concat_length(std::forward<Args>(args)...));
+    concat_into(str, std::forward<Args>(args)...);
+    return str;
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+////////////////
+// exceptions //
+////////////////
+
+/// @brief general exception of the @ref basic_json class
+/// @sa https://json.nlohmann.me/api/basic_json/exception/
+class exception : public std::exception
+{
+  public:
+    /// returns the explanatory string
+    const char* what() const noexcept override
+    {
+        return m.what();
+    }
+
+    /// the id of the exception
+    const int id; // NOLINT(cppcoreguidelines-non-private-member-variables-in-classes)
+
+  protected:
+    JSON_HEDLEY_NON_NULL(3)
+    exception(int id_, const char* what_arg) : id(id_), m(what_arg) {} // NOLINT(bugprone-throw-keyword-missing)
+
+    static std::string name(const std::string& ename, int id_)
+    {
+        return concat("[json.exception.", ename, '.', std::to_string(id_), "] ");
+    }
+
+    static std::string diagnostics(std::nullptr_t /*leaf_element*/)
+    {
+        return "";
+    }
+
+    template<typename BasicJsonType>
+    static std::string diagnostics(const BasicJsonType* leaf_element)
+    {
+#if JSON_DIAGNOSTICS
+        std::vector<std::string> tokens;
+        for (const auto* current = leaf_element; current != nullptr && current->m_parent != nullptr; current = current->m_parent)
+        {
+            switch (current->m_parent->type())
+            {
+                case value_t::array:
+                {
+                    for (std::size_t i = 0; i < current->m_parent->m_value.array->size(); ++i)
+                    {
+                        if (&current->m_parent->m_value.array->operator[](i) == current)
+                        {
+                            tokens.emplace_back(std::to_string(i));
+                            break;
+                        }
+                    }
+                    break;
+                }
+
+                case value_t::object:
+                {
+                    for (const auto& element : *current->m_parent->m_value.object)
+                    {
+                        if (&element.second == current)
+                        {
+                            tokens.emplace_back(element.first.c_str());
+                            break;
+                        }
+                    }
+                    break;
+                }
+
+                case value_t::null: // LCOV_EXCL_LINE
+                case value_t::string: // LCOV_EXCL_LINE
+                case value_t::boolean: // LCOV_EXCL_LINE
+                case value_t::number_integer: // LCOV_EXCL_LINE
+                case value_t::number_unsigned: // LCOV_EXCL_LINE
+                case value_t::number_float: // LCOV_EXCL_LINE
+                case value_t::binary: // LCOV_EXCL_LINE
+                case value_t::discarded: // LCOV_EXCL_LINE
+                default:   // LCOV_EXCL_LINE
+                    break; // LCOV_EXCL_LINE
+            }
+        }
+
+        if (tokens.empty())
+        {
+            return "";
+        }
+
+        auto str = std::accumulate(tokens.rbegin(), tokens.rend(), std::string{},
+                                   [](const std::string & a, const std::string & b)
+        {
+            return concat(a, '/', detail::escape(b));
+        });
+        return concat('(', str, ") ");
+#else
+        static_cast<void>(leaf_element);
+        return "";
+#endif
+    }
+
+  private:
+    /// an exception object as storage for error messages
+    std::runtime_error m;
+};
+
+/// @brief exception indicating a parse error
+/// @sa https://json.nlohmann.me/api/basic_json/parse_error/
+class parse_error : public exception
+{
+  public:
+    /*!
+    @brief create a parse error exception
+    @param[in] id_       the id of the exception
+    @param[in] pos       the position where the error occurred (or with
+                         chars_read_total=0 if the position cannot be
+                         determined)
+    @param[in] what_arg  the explanatory string
+    @return parse_error object
+    */
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static parse_error create(int id_, const position_t& pos, const std::string& what_arg, BasicJsonContext context)
+    {
+        std::string w = concat(exception::name("parse_error", id_), "parse error",
+                               position_string(pos), ": ", exception::diagnostics(context), what_arg);
+        return {id_, pos.chars_read_total, w.c_str()};
+    }
+
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static parse_error create(int id_, std::size_t byte_, const std::string& what_arg, BasicJsonContext context)
+    {
+        std::string w = concat(exception::name("parse_error", id_), "parse error",
+                               (byte_ != 0 ? (concat(" at byte ", std::to_string(byte_))) : ""),
+                               ": ", exception::diagnostics(context), what_arg);
+        return {id_, byte_, w.c_str()};
+    }
+
+    /*!
+    @brief byte index of the parse error
+
+    The byte index of the last read character in the input file.
+
+    @note For an input with n bytes, 1 is the index of the first character and
+          n+1 is the index of the terminating null byte or the end of file.
+          This also holds true when reading a byte vector (CBOR or MessagePack).
+    */
+    const std::size_t byte;
+
+  private:
+    parse_error(int id_, std::size_t byte_, const char* what_arg)
+        : exception(id_, what_arg), byte(byte_) {}
+
+    static std::string position_string(const position_t& pos)
+    {
+        return concat(" at line ", std::to_string(pos.lines_read + 1),
+                      ", column ", std::to_string(pos.chars_read_current_line));
+    }
+};
+
+/// @brief exception indicating errors with iterators
+/// @sa https://json.nlohmann.me/api/basic_json/invalid_iterator/
+class invalid_iterator : public exception
+{
+  public:
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static invalid_iterator create(int id_, const std::string& what_arg, BasicJsonContext context)
+    {
+        std::string w = concat(exception::name("invalid_iterator", id_), exception::diagnostics(context), what_arg);
+        return {id_, w.c_str()};
+    }
+
+  private:
+    JSON_HEDLEY_NON_NULL(3)
+    invalid_iterator(int id_, const char* what_arg)
+        : exception(id_, what_arg) {}
+};
+
+/// @brief exception indicating executing a member function with a wrong type
+/// @sa https://json.nlohmann.me/api/basic_json/type_error/
+class type_error : public exception
+{
+  public:
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static type_error create(int id_, const std::string& what_arg, BasicJsonContext context)
+    {
+        std::string w = concat(exception::name("type_error", id_), exception::diagnostics(context), what_arg);
+        return {id_, w.c_str()};
+    }
+
+  private:
+    JSON_HEDLEY_NON_NULL(3)
+    type_error(int id_, const char* what_arg) : exception(id_, what_arg) {}
+};
+
+/// @brief exception indicating access out of the defined range
+/// @sa https://json.nlohmann.me/api/basic_json/out_of_range/
+class out_of_range : public exception
+{
+  public:
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static out_of_range create(int id_, const std::string& what_arg, BasicJsonContext context)
+    {
+        std::string w = concat(exception::name("out_of_range", id_), exception::diagnostics(context), what_arg);
+        return {id_, w.c_str()};
+    }
+
+  private:
+    JSON_HEDLEY_NON_NULL(3)
+    out_of_range(int id_, const char* what_arg) : exception(id_, what_arg) {}
+};
+
+/// @brief exception indicating other library errors
+/// @sa https://json.nlohmann.me/api/basic_json/other_error/
+class other_error : public exception
+{
+  public:
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static other_error create(int id_, const std::string& what_arg, BasicJsonContext context)
+    {
+        std::string w = concat(exception::name("other_error", id_), exception::diagnostics(context), what_arg);
+        return {id_, w.c_str()};
+    }
+
+  private:
+    JSON_HEDLEY_NON_NULL(3)
+    other_error(int id_, const char* what_arg) : exception(id_, what_arg) {}
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/identity_tag.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+// dispatching helper struct
+template <class T> struct identity_tag {};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/std_fs.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+#if JSON_HAS_EXPERIMENTAL_FILESYSTEM
+#include <experimental/filesystem>
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+namespace std_fs = std::experimental::filesystem;
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+#elif JSON_HAS_FILESYSTEM
+#include <filesystem>
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+namespace std_fs = std::filesystem;
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+#endif
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename std::nullptr_t& n)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_null()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be null, but is ", j.type_name()), &j));
+    }
+    n = nullptr;
+}
+
+// overloads for basic_json template parameters
+template < typename BasicJsonType, typename ArithmeticType,
+           enable_if_t < std::is_arithmetic<ArithmeticType>::value&&
+                         !std::is_same<ArithmeticType, typename BasicJsonType::boolean_t>::value,
+                         int > = 0 >
+void get_arithmetic_value(const BasicJsonType& j, ArithmeticType& val)
+{
+    switch (static_cast<value_t>(j))
+    {
+        case value_t::number_unsigned:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_unsigned_t*>());
+            break;
+        }
+        case value_t::number_integer:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_integer_t*>());
+            break;
+        }
+        case value_t::number_float:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_float_t*>());
+            break;
+        }
+
+        case value_t::null:
+        case value_t::object:
+        case value_t::array:
+        case value_t::string:
+        case value_t::boolean:
+        case value_t::binary:
+        case value_t::discarded:
+        default:
+            JSON_THROW(type_error::create(302, concat("type must be number, but is ", j.type_name()), &j));
+    }
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::boolean_t& b)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_boolean()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be boolean, but is ", j.type_name()), &j));
+    }
+    b = *j.template get_ptr<const typename BasicJsonType::boolean_t*>();
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::string_t& s)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_string()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be string, but is ", j.type_name()), &j));
+    }
+    s = *j.template get_ptr<const typename BasicJsonType::string_t*>();
+}
+
+template <
+    typename BasicJsonType, typename StringType,
+    enable_if_t <
+        std::is_assignable<StringType&, const typename BasicJsonType::string_t>::value
+        && is_detected_exact<typename BasicJsonType::string_t::value_type, value_type_t, StringType>::value
+        && !std::is_same<typename BasicJsonType::string_t, StringType>::value
+        && !is_json_ref<StringType>::value, int > = 0 >
+inline void from_json(const BasicJsonType& j, StringType& s)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_string()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be string, but is ", j.type_name()), &j));
+    }
+
+    s = *j.template get_ptr<const typename BasicJsonType::string_t*>();
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::number_float_t& val)
+{
+    get_arithmetic_value(j, val);
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::number_unsigned_t& val)
+{
+    get_arithmetic_value(j, val);
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::number_integer_t& val)
+{
+    get_arithmetic_value(j, val);
+}
+
+#if !JSON_DISABLE_ENUM_SERIALIZATION
+template<typename BasicJsonType, typename EnumType,
+         enable_if_t<std::is_enum<EnumType>::value, int> = 0>
+inline void from_json(const BasicJsonType& j, EnumType& e)
+{
+    typename std::underlying_type<EnumType>::type val;
+    get_arithmetic_value(j, val);
+    e = static_cast<EnumType>(val);
+}
+#endif  // JSON_DISABLE_ENUM_SERIALIZATION
+
+// forward_list doesn't have an insert method
+template<typename BasicJsonType, typename T, typename Allocator,
+         enable_if_t<is_getable<BasicJsonType, T>::value, int> = 0>
+inline void from_json(const BasicJsonType& j, std::forward_list<T, Allocator>& l)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+    l.clear();
+    std::transform(j.rbegin(), j.rend(),
+                   std::front_inserter(l), [](const BasicJsonType & i)
+    {
+        return i.template get<T>();
+    });
+}
+
+// valarray doesn't have an insert method
+template<typename BasicJsonType, typename T,
+         enable_if_t<is_getable<BasicJsonType, T>::value, int> = 0>
+inline void from_json(const BasicJsonType& j, std::valarray<T>& l)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+    l.resize(j.size());
+    std::transform(j.begin(), j.end(), std::begin(l),
+                   [](const BasicJsonType & elem)
+    {
+        return elem.template get<T>();
+    });
+}
+
+template<typename BasicJsonType, typename T, std::size_t N>
+auto from_json(const BasicJsonType& j, T (&arr)[N])  // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+-> decltype(j.template get<T>(), void())
+{
+    for (std::size_t i = 0; i < N; ++i)
+    {
+        arr[i] = j.at(i).template get<T>();
+    }
+}
+
+template<typename BasicJsonType>
+inline void from_json_array_impl(const BasicJsonType& j, typename BasicJsonType::array_t& arr, priority_tag<3> /*unused*/)
+{
+    arr = *j.template get_ptr<const typename BasicJsonType::array_t*>();
+}
+
+template<typename BasicJsonType, typename T, std::size_t N>
+auto from_json_array_impl(const BasicJsonType& j, std::array<T, N>& arr,
+                          priority_tag<2> /*unused*/)
+-> decltype(j.template get<T>(), void())
+{
+    for (std::size_t i = 0; i < N; ++i)
+    {
+        arr[i] = j.at(i).template get<T>();
+    }
+}
+
+template<typename BasicJsonType, typename ConstructibleArrayType,
+         enable_if_t<
+             std::is_assignable<ConstructibleArrayType&, ConstructibleArrayType>::value,
+             int> = 0>
+auto from_json_array_impl(const BasicJsonType& j, ConstructibleArrayType& arr, priority_tag<1> /*unused*/)
+-> decltype(
+    arr.reserve(std::declval<typename ConstructibleArrayType::size_type>()),
+    j.template get<typename ConstructibleArrayType::value_type>(),
+    void())
+{
+    using std::end;
+
+    ConstructibleArrayType ret;
+    ret.reserve(j.size());
+    std::transform(j.begin(), j.end(),
+                   std::inserter(ret, end(ret)), [](const BasicJsonType & i)
+    {
+        // get<BasicJsonType>() returns *this, this won't call a from_json
+        // method when value_type is BasicJsonType
+        return i.template get<typename ConstructibleArrayType::value_type>();
+    });
+    arr = std::move(ret);
+}
+
+template<typename BasicJsonType, typename ConstructibleArrayType,
+         enable_if_t<
+             std::is_assignable<ConstructibleArrayType&, ConstructibleArrayType>::value,
+             int> = 0>
+inline void from_json_array_impl(const BasicJsonType& j, ConstructibleArrayType& arr,
+                                 priority_tag<0> /*unused*/)
+{
+    using std::end;
+
+    ConstructibleArrayType ret;
+    std::transform(
+        j.begin(), j.end(), std::inserter(ret, end(ret)),
+        [](const BasicJsonType & i)
+    {
+        // get<BasicJsonType>() returns *this, this won't call a from_json
+        // method when value_type is BasicJsonType
+        return i.template get<typename ConstructibleArrayType::value_type>();
+    });
+    arr = std::move(ret);
+}
+
+template < typename BasicJsonType, typename ConstructibleArrayType,
+           enable_if_t <
+               is_constructible_array_type<BasicJsonType, ConstructibleArrayType>::value&&
+               !is_constructible_object_type<BasicJsonType, ConstructibleArrayType>::value&&
+               !is_constructible_string_type<BasicJsonType, ConstructibleArrayType>::value&&
+               !std::is_same<ConstructibleArrayType, typename BasicJsonType::binary_t>::value&&
+               !is_basic_json<ConstructibleArrayType>::value,
+               int > = 0 >
+auto from_json(const BasicJsonType& j, ConstructibleArrayType& arr)
+-> decltype(from_json_array_impl(j, arr, priority_tag<3> {}),
+j.template get<typename ConstructibleArrayType::value_type>(),
+void())
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+
+    from_json_array_impl(j, arr, priority_tag<3> {});
+}
+
+template < typename BasicJsonType, typename T, std::size_t... Idx >
+std::array<T, sizeof...(Idx)> from_json_inplace_array_impl(BasicJsonType&& j,
+        identity_tag<std::array<T, sizeof...(Idx)>> /*unused*/, index_sequence<Idx...> /*unused*/)
+{
+    return { { std::forward<BasicJsonType>(j).at(Idx).template get<T>()... } };
+}
+
+template < typename BasicJsonType, typename T, std::size_t N >
+auto from_json(BasicJsonType&& j, identity_tag<std::array<T, N>> tag)
+-> decltype(from_json_inplace_array_impl(std::forward<BasicJsonType>(j), tag, make_index_sequence<N> {}))
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+
+    return from_json_inplace_array_impl(std::forward<BasicJsonType>(j), tag, make_index_sequence<N> {});
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::binary_t& bin)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_binary()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be binary, but is ", j.type_name()), &j));
+    }
+
+    bin = *j.template get_ptr<const typename BasicJsonType::binary_t*>();
+}
+
+template<typename BasicJsonType, typename ConstructibleObjectType,
+         enable_if_t<is_constructible_object_type<BasicJsonType, ConstructibleObjectType>::value, int> = 0>
+inline void from_json(const BasicJsonType& j, ConstructibleObjectType& obj)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_object()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be object, but is ", j.type_name()), &j));
+    }
+
+    ConstructibleObjectType ret;
+    const auto* inner_object = j.template get_ptr<const typename BasicJsonType::object_t*>();
+    using value_type = typename ConstructibleObjectType::value_type;
+    std::transform(
+        inner_object->begin(), inner_object->end(),
+        std::inserter(ret, ret.begin()),
+        [](typename BasicJsonType::object_t::value_type const & p)
+    {
+        return value_type(p.first, p.second.template get<typename ConstructibleObjectType::mapped_type>());
+    });
+    obj = std::move(ret);
+}
+
+// overload for arithmetic types, not chosen for basic_json template arguments
+// (BooleanType, etc..); note: Is it really necessary to provide explicit
+// overloads for boolean_t etc. in case of a custom BooleanType which is not
+// an arithmetic type?
+template < typename BasicJsonType, typename ArithmeticType,
+           enable_if_t <
+               std::is_arithmetic<ArithmeticType>::value&&
+               !std::is_same<ArithmeticType, typename BasicJsonType::number_unsigned_t>::value&&
+               !std::is_same<ArithmeticType, typename BasicJsonType::number_integer_t>::value&&
+               !std::is_same<ArithmeticType, typename BasicJsonType::number_float_t>::value&&
+               !std::is_same<ArithmeticType, typename BasicJsonType::boolean_t>::value,
+               int > = 0 >
+inline void from_json(const BasicJsonType& j, ArithmeticType& val)
+{
+    switch (static_cast<value_t>(j))
+    {
+        case value_t::number_unsigned:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_unsigned_t*>());
+            break;
+        }
+        case value_t::number_integer:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_integer_t*>());
+            break;
+        }
+        case value_t::number_float:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_float_t*>());
+            break;
+        }
+        case value_t::boolean:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::boolean_t*>());
+            break;
+        }
+
+        case value_t::null:
+        case value_t::object:
+        case value_t::array:
+        case value_t::string:
+        case value_t::binary:
+        case value_t::discarded:
+        default:
+            JSON_THROW(type_error::create(302, concat("type must be number, but is ", j.type_name()), &j));
+    }
+}
+
+template<typename BasicJsonType, typename... Args, std::size_t... Idx>
+std::tuple<Args...> from_json_tuple_impl_base(BasicJsonType&& j, index_sequence<Idx...> /*unused*/)
+{
+    return std::make_tuple(std::forward<BasicJsonType>(j).at(Idx).template get<Args>()...);
+}
+
+template < typename BasicJsonType, class A1, class A2 >
+std::pair<A1, A2> from_json_tuple_impl(BasicJsonType&& j, identity_tag<std::pair<A1, A2>> /*unused*/, priority_tag<0> /*unused*/)
+{
+    return {std::forward<BasicJsonType>(j).at(0).template get<A1>(),
+            std::forward<BasicJsonType>(j).at(1).template get<A2>()};
+}
+
+template<typename BasicJsonType, typename A1, typename A2>
+inline void from_json_tuple_impl(BasicJsonType&& j, std::pair<A1, A2>& p, priority_tag<1> /*unused*/)
+{
+    p = from_json_tuple_impl(std::forward<BasicJsonType>(j), identity_tag<std::pair<A1, A2>> {}, priority_tag<0> {});
+}
+
+template<typename BasicJsonType, typename... Args>
+std::tuple<Args...> from_json_tuple_impl(BasicJsonType&& j, identity_tag<std::tuple<Args...>> /*unused*/, priority_tag<2> /*unused*/)
+{
+    return from_json_tuple_impl_base<BasicJsonType, Args...>(std::forward<BasicJsonType>(j), index_sequence_for<Args...> {});
+}
+
+template<typename BasicJsonType, typename... Args>
+inline void from_json_tuple_impl(BasicJsonType&& j, std::tuple<Args...>& t, priority_tag<3> /*unused*/)
+{
+    t = from_json_tuple_impl_base<BasicJsonType, Args...>(std::forward<BasicJsonType>(j), index_sequence_for<Args...> {});
+}
+
+template<typename BasicJsonType, typename TupleRelated>
+auto from_json(BasicJsonType&& j, TupleRelated&& t)
+-> decltype(from_json_tuple_impl(std::forward<BasicJsonType>(j), std::forward<TupleRelated>(t), priority_tag<3> {}))
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+
+    return from_json_tuple_impl(std::forward<BasicJsonType>(j), std::forward<TupleRelated>(t), priority_tag<3> {});
+}
+
+template < typename BasicJsonType, typename Key, typename Value, typename Compare, typename Allocator,
+           typename = enable_if_t < !std::is_constructible <
+                                        typename BasicJsonType::string_t, Key >::value >>
+inline void from_json(const BasicJsonType& j, std::map<Key, Value, Compare, Allocator>& m)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+    m.clear();
+    for (const auto& p : j)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!p.is_array()))
+        {
+            JSON_THROW(type_error::create(302, concat("type must be array, but is ", p.type_name()), &j));
+        }
+        m.emplace(p.at(0).template get<Key>(), p.at(1).template get<Value>());
+    }
+}
+
+template < typename BasicJsonType, typename Key, typename Value, typename Hash, typename KeyEqual, typename Allocator,
+           typename = enable_if_t < !std::is_constructible <
+                                        typename BasicJsonType::string_t, Key >::value >>
+inline void from_json(const BasicJsonType& j, std::unordered_map<Key, Value, Hash, KeyEqual, Allocator>& m)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+    m.clear();
+    for (const auto& p : j)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!p.is_array()))
+        {
+            JSON_THROW(type_error::create(302, concat("type must be array, but is ", p.type_name()), &j));
+        }
+        m.emplace(p.at(0).template get<Key>(), p.at(1).template get<Value>());
+    }
+}
+
+#if JSON_HAS_FILESYSTEM || JSON_HAS_EXPERIMENTAL_FILESYSTEM
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, std_fs::path& p)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_string()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be string, but is ", j.type_name()), &j));
+    }
+    p = *j.template get_ptr<const typename BasicJsonType::string_t*>();
+}
+#endif
+
+struct from_json_fn
+{
+    template<typename BasicJsonType, typename T>
+    auto operator()(const BasicJsonType& j, T&& val) const
+    noexcept(noexcept(from_json(j, std::forward<T>(val))))
+    -> decltype(from_json(j, std::forward<T>(val)))
+    {
+        return from_json(j, std::forward<T>(val));
+    }
+};
+
+}  // namespace detail
+
+#ifndef JSON_HAS_CPP_17
+/// namespace to hold default `from_json` function
+/// to see why this is required:
+/// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4381.html
+namespace // NOLINT(cert-dcl59-cpp,fuchsia-header-anon-namespaces,google-build-namespaces)
+{
+#endif
+JSON_INLINE_VARIABLE constexpr const auto& from_json = // NOLINT(misc-definitions-in-headers)
+    detail::static_const<detail::from_json_fn>::value;
+#ifndef JSON_HAS_CPP_17
+}  // namespace
+#endif
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/conversions/to_json.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // copy
+#include <iterator> // begin, end
+#include <string> // string
+#include <tuple> // tuple, get
+#include <type_traits> // is_same, is_constructible, is_floating_point, is_enum, underlying_type
+#include <utility> // move, forward, declval, pair
+#include <valarray> // valarray
+#include <vector> // vector
+
+// #include <nlohmann/detail/iterators/iteration_proxy.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // size_t
+#include <iterator> // input_iterator_tag
+#include <string> // string, to_string
+#include <tuple> // tuple_size, get, tuple_element
+#include <utility> // move
+
+#if JSON_HAS_RANGES
+    #include <ranges> // enable_borrowed_range
+#endif
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename string_type>
+void int_to_string( string_type& target, std::size_t value )
+{
+    // For ADL
+    using std::to_string;
+    target = to_string(value);
+}
+template<typename IteratorType> class iteration_proxy_value
+{
+  public:
+    using difference_type = std::ptrdiff_t;
+    using value_type = iteration_proxy_value;
+    using pointer = value_type *;
+    using reference = value_type &;
+    using iterator_category = std::input_iterator_tag;
+    using string_type = typename std::remove_cv< typename std::remove_reference<decltype( std::declval<IteratorType>().key() ) >::type >::type;
+
+  private:
+    /// the iterator
+    IteratorType anchor{};
+    /// an index for arrays (used to create key names)
+    std::size_t array_index = 0;
+    /// last stringified array index
+    mutable std::size_t array_index_last = 0;
+    /// a string representation of the array index
+    mutable string_type array_index_str = "0";
+    /// an empty string (to return a reference for primitive values)
+    string_type empty_str{};
+
+  public:
+    explicit iteration_proxy_value() = default;
+    explicit iteration_proxy_value(IteratorType it, std::size_t array_index_ = 0)
+    noexcept(std::is_nothrow_move_constructible<IteratorType>::value
+             && std::is_nothrow_default_constructible<string_type>::value)
+        : anchor(std::move(it))
+        , array_index(array_index_)
+    {}
+
+    iteration_proxy_value(iteration_proxy_value const&) = default;
+    iteration_proxy_value& operator=(iteration_proxy_value const&) = default;
+    // older GCCs are a bit fussy and require explicit noexcept specifiers on defaulted functions
+    iteration_proxy_value(iteration_proxy_value&&)
+    noexcept(std::is_nothrow_move_constructible<IteratorType>::value
+             && std::is_nothrow_move_constructible<string_type>::value) = default;
+    iteration_proxy_value& operator=(iteration_proxy_value&&)
+    noexcept(std::is_nothrow_move_assignable<IteratorType>::value
+             && std::is_nothrow_move_assignable<string_type>::value) = default;
+    ~iteration_proxy_value() = default;
+
+    /// dereference operator (needed for range-based for)
+    const iteration_proxy_value& operator*() const
+    {
+        return *this;
+    }
+
+    /// increment operator (needed for range-based for)
+    iteration_proxy_value& operator++()
+    {
+        ++anchor;
+        ++array_index;
+
+        return *this;
+    }
+
+    iteration_proxy_value operator++(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        auto tmp = iteration_proxy_value(anchor, array_index);
+        ++anchor;
+        ++array_index;
+        return tmp;
+    }
+
+    /// equality operator (needed for InputIterator)
+    bool operator==(const iteration_proxy_value& o) const
+    {
+        return anchor == o.anchor;
+    }
+
+    /// inequality operator (needed for range-based for)
+    bool operator!=(const iteration_proxy_value& o) const
+    {
+        return anchor != o.anchor;
+    }
+
+    /// return key of the iterator
+    const string_type& key() const
+    {
+        JSON_ASSERT(anchor.m_object != nullptr);
+
+        switch (anchor.m_object->type())
+        {
+            // use integer array index as key
+            case value_t::array:
+            {
+                if (array_index != array_index_last)
+                {
+                    int_to_string( array_index_str, array_index );
+                    array_index_last = array_index;
+                }
+                return array_index_str;
+            }
+
+            // use key from the object
+            case value_t::object:
+                return anchor.key();
+
+            // use an empty key for all primitive types
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                return empty_str;
+        }
+    }
+
+    /// return value of the iterator
+    typename IteratorType::reference value() const
+    {
+        return anchor.value();
+    }
+};
+
+/// proxy class for the items() function
+template<typename IteratorType> class iteration_proxy
+{
+  private:
+    /// the container to iterate
+    typename IteratorType::pointer container = nullptr;
+
+  public:
+    explicit iteration_proxy() = default;
+
+    /// construct iteration proxy from a container
+    explicit iteration_proxy(typename IteratorType::reference cont) noexcept
+        : container(&cont) {}
+
+    iteration_proxy(iteration_proxy const&) = default;
+    iteration_proxy& operator=(iteration_proxy const&) = default;
+    iteration_proxy(iteration_proxy&&) noexcept = default;
+    iteration_proxy& operator=(iteration_proxy&&) noexcept = default;
+    ~iteration_proxy() = default;
+
+    /// return iterator begin (needed for range-based for)
+    iteration_proxy_value<IteratorType> begin() const noexcept
+    {
+        return iteration_proxy_value<IteratorType>(container->begin());
+    }
+
+    /// return iterator end (needed for range-based for)
+    iteration_proxy_value<IteratorType> end() const noexcept
+    {
+        return iteration_proxy_value<IteratorType>(container->end());
+    }
+};
+
+// Structured Bindings Support
+// For further reference see https://blog.tartanllama.xyz/structured-bindings/
+// And see https://github.com/nlohmann/json/pull/1391
+template<std::size_t N, typename IteratorType, enable_if_t<N == 0, int> = 0>
+auto get(const nlohmann::detail::iteration_proxy_value<IteratorType>& i) -> decltype(i.key())
+{
+    return i.key();
+}
+// Structured Bindings Support
+// For further reference see https://blog.tartanllama.xyz/structured-bindings/
+// And see https://github.com/nlohmann/json/pull/1391
+template<std::size_t N, typename IteratorType, enable_if_t<N == 1, int> = 0>
+auto get(const nlohmann::detail::iteration_proxy_value<IteratorType>& i) -> decltype(i.value())
+{
+    return i.value();
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// The Addition to the STD Namespace is required to add
+// Structured Bindings Support to the iteration_proxy_value class
+// For further reference see https://blog.tartanllama.xyz/structured-bindings/
+// And see https://github.com/nlohmann/json/pull/1391
+namespace std
+{
+
+#if defined(__clang__)
+    // Fix: https://github.com/nlohmann/json/issues/1401
+    #pragma clang diagnostic push
+    #pragma clang diagnostic ignored "-Wmismatched-tags"
+#endif
+template<typename IteratorType>
+class tuple_size<::nlohmann::detail::iteration_proxy_value<IteratorType>>
+            : public std::integral_constant<std::size_t, 2> {};
+
+template<std::size_t N, typename IteratorType>
+class tuple_element<N, ::nlohmann::detail::iteration_proxy_value<IteratorType >>
+{
+  public:
+    using type = decltype(
+                     get<N>(std::declval <
+                            ::nlohmann::detail::iteration_proxy_value<IteratorType >> ()));
+};
+#if defined(__clang__)
+    #pragma clang diagnostic pop
+#endif
+
+}  // namespace std
+
+#if JSON_HAS_RANGES
+    template <typename IteratorType>
+    inline constexpr bool ::std::ranges::enable_borrowed_range<::nlohmann::detail::iteration_proxy<IteratorType>> = true;
+#endif
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/std_fs.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+//////////////////
+// constructors //
+//////////////////
+
+/*
+ * Note all external_constructor<>::construct functions need to call
+ * j.m_value.destroy(j.m_type) to avoid a memory leak in case j contains an
+ * allocated value (e.g., a string). See bug issue
+ * https://github.com/nlohmann/json/issues/2865 for more information.
+ */
+
+template<value_t> struct external_constructor;
+
+template<>
+struct external_constructor<value_t::boolean>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::boolean_t b) noexcept
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::boolean;
+        j.m_value = b;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::string>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::string_t& s)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::string;
+        j.m_value = s;
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::string_t&& s)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::string;
+        j.m_value = std::move(s);
+        j.assert_invariant();
+    }
+
+    template < typename BasicJsonType, typename CompatibleStringType,
+               enable_if_t < !std::is_same<CompatibleStringType, typename BasicJsonType::string_t>::value,
+                             int > = 0 >
+    static void construct(BasicJsonType& j, const CompatibleStringType& str)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::string;
+        j.m_value.string = j.template create<typename BasicJsonType::string_t>(str);
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::binary>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::binary_t& b)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::binary;
+        j.m_value = typename BasicJsonType::binary_t(b);
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::binary_t&& b)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::binary;
+        j.m_value = typename BasicJsonType::binary_t(std::move(b));
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::number_float>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::number_float_t val) noexcept
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::number_float;
+        j.m_value = val;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::number_unsigned>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::number_unsigned_t val) noexcept
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::number_unsigned;
+        j.m_value = val;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::number_integer>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::number_integer_t val) noexcept
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::number_integer;
+        j.m_value = val;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::array>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::array_t& arr)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::array;
+        j.m_value = arr;
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::array_t&& arr)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::array;
+        j.m_value = std::move(arr);
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template < typename BasicJsonType, typename CompatibleArrayType,
+               enable_if_t < !std::is_same<CompatibleArrayType, typename BasicJsonType::array_t>::value,
+                             int > = 0 >
+    static void construct(BasicJsonType& j, const CompatibleArrayType& arr)
+    {
+        using std::begin;
+        using std::end;
+
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::array;
+        j.m_value.array = j.template create<typename BasicJsonType::array_t>(begin(arr), end(arr));
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const std::vector<bool>& arr)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::array;
+        j.m_value = value_t::array;
+        j.m_value.array->reserve(arr.size());
+        for (const bool x : arr)
+        {
+            j.m_value.array->push_back(x);
+            j.set_parent(j.m_value.array->back());
+        }
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType, typename T,
+             enable_if_t<std::is_convertible<T, BasicJsonType>::value, int> = 0>
+    static void construct(BasicJsonType& j, const std::valarray<T>& arr)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::array;
+        j.m_value = value_t::array;
+        j.m_value.array->resize(arr.size());
+        if (arr.size() > 0)
+        {
+            std::copy(std::begin(arr), std::end(arr), j.m_value.array->begin());
+        }
+        j.set_parents();
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::object>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::object_t& obj)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::object;
+        j.m_value = obj;
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::object_t&& obj)
+    {
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::object;
+        j.m_value = std::move(obj);
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template < typename BasicJsonType, typename CompatibleObjectType,
+               enable_if_t < !std::is_same<CompatibleObjectType, typename BasicJsonType::object_t>::value, int > = 0 >
+    static void construct(BasicJsonType& j, const CompatibleObjectType& obj)
+    {
+        using std::begin;
+        using std::end;
+
+        j.m_value.destroy(j.m_type);
+        j.m_type = value_t::object;
+        j.m_value.object = j.template create<typename BasicJsonType::object_t>(begin(obj), end(obj));
+        j.set_parents();
+        j.assert_invariant();
+    }
+};
+
+/////////////
+// to_json //
+/////////////
+
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_same<T, typename BasicJsonType::boolean_t>::value, int> = 0>
+inline void to_json(BasicJsonType& j, T b) noexcept
+{
+    external_constructor<value_t::boolean>::construct(j, b);
+}
+
+template < typename BasicJsonType, typename BoolRef,
+           enable_if_t <
+               ((std::is_same<std::vector<bool>::reference, BoolRef>::value
+                 && !std::is_same <std::vector<bool>::reference, typename BasicJsonType::boolean_t&>::value)
+                || (std::is_same<std::vector<bool>::const_reference, BoolRef>::value
+                    && !std::is_same <detail::uncvref_t<std::vector<bool>::const_reference>,
+                                      typename BasicJsonType::boolean_t >::value))
+               && std::is_convertible<const BoolRef&, typename BasicJsonType::boolean_t>::value, int > = 0 >
+inline void to_json(BasicJsonType& j, const BoolRef& b) noexcept
+{
+    external_constructor<value_t::boolean>::construct(j, static_cast<typename BasicJsonType::boolean_t>(b));
+}
+
+template<typename BasicJsonType, typename CompatibleString,
+         enable_if_t<std::is_constructible<typename BasicJsonType::string_t, CompatibleString>::value, int> = 0>
+inline void to_json(BasicJsonType& j, const CompatibleString& s)
+{
+    external_constructor<value_t::string>::construct(j, s);
+}
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, typename BasicJsonType::string_t&& s)
+{
+    external_constructor<value_t::string>::construct(j, std::move(s));
+}
+
+template<typename BasicJsonType, typename FloatType,
+         enable_if_t<std::is_floating_point<FloatType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, FloatType val) noexcept
+{
+    external_constructor<value_t::number_float>::construct(j, static_cast<typename BasicJsonType::number_float_t>(val));
+}
+
+template<typename BasicJsonType, typename CompatibleNumberUnsignedType,
+         enable_if_t<is_compatible_integer_type<typename BasicJsonType::number_unsigned_t, CompatibleNumberUnsignedType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, CompatibleNumberUnsignedType val) noexcept
+{
+    external_constructor<value_t::number_unsigned>::construct(j, static_cast<typename BasicJsonType::number_unsigned_t>(val));
+}
+
+template<typename BasicJsonType, typename CompatibleNumberIntegerType,
+         enable_if_t<is_compatible_integer_type<typename BasicJsonType::number_integer_t, CompatibleNumberIntegerType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, CompatibleNumberIntegerType val) noexcept
+{
+    external_constructor<value_t::number_integer>::construct(j, static_cast<typename BasicJsonType::number_integer_t>(val));
+}
+
+#if !JSON_DISABLE_ENUM_SERIALIZATION
+template<typename BasicJsonType, typename EnumType,
+         enable_if_t<std::is_enum<EnumType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, EnumType e) noexcept
+{
+    using underlying_type = typename std::underlying_type<EnumType>::type;
+    external_constructor<value_t::number_integer>::construct(j, static_cast<underlying_type>(e));
+}
+#endif  // JSON_DISABLE_ENUM_SERIALIZATION
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, const std::vector<bool>& e)
+{
+    external_constructor<value_t::array>::construct(j, e);
+}
+
+template < typename BasicJsonType, typename CompatibleArrayType,
+           enable_if_t < is_compatible_array_type<BasicJsonType,
+                         CompatibleArrayType>::value&&
+                         !is_compatible_object_type<BasicJsonType, CompatibleArrayType>::value&&
+                         !is_compatible_string_type<BasicJsonType, CompatibleArrayType>::value&&
+                         !std::is_same<typename BasicJsonType::binary_t, CompatibleArrayType>::value&&
+                         !is_basic_json<CompatibleArrayType>::value,
+                         int > = 0 >
+inline void to_json(BasicJsonType& j, const CompatibleArrayType& arr)
+{
+    external_constructor<value_t::array>::construct(j, arr);
+}
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, const typename BasicJsonType::binary_t& bin)
+{
+    external_constructor<value_t::binary>::construct(j, bin);
+}
+
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_convertible<T, BasicJsonType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, const std::valarray<T>& arr)
+{
+    external_constructor<value_t::array>::construct(j, std::move(arr));
+}
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, typename BasicJsonType::array_t&& arr)
+{
+    external_constructor<value_t::array>::construct(j, std::move(arr));
+}
+
+template < typename BasicJsonType, typename CompatibleObjectType,
+           enable_if_t < is_compatible_object_type<BasicJsonType, CompatibleObjectType>::value&& !is_basic_json<CompatibleObjectType>::value, int > = 0 >
+inline void to_json(BasicJsonType& j, const CompatibleObjectType& obj)
+{
+    external_constructor<value_t::object>::construct(j, obj);
+}
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, typename BasicJsonType::object_t&& obj)
+{
+    external_constructor<value_t::object>::construct(j, std::move(obj));
+}
+
+template <
+    typename BasicJsonType, typename T, std::size_t N,
+    enable_if_t < !std::is_constructible<typename BasicJsonType::string_t,
+                  const T(&)[N]>::value, // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+                  int > = 0 >
+inline void to_json(BasicJsonType& j, const T(&arr)[N]) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+{
+    external_constructor<value_t::array>::construct(j, arr);
+}
+
+template < typename BasicJsonType, typename T1, typename T2, enable_if_t < std::is_constructible<BasicJsonType, T1>::value&& std::is_constructible<BasicJsonType, T2>::value, int > = 0 >
+inline void to_json(BasicJsonType& j, const std::pair<T1, T2>& p)
+{
+    j = { p.first, p.second };
+}
+
+// for https://github.com/nlohmann/json/pull/1134
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_same<T, iteration_proxy_value<typename BasicJsonType::iterator>>::value, int> = 0>
+inline void to_json(BasicJsonType& j, const T& b)
+{
+    j = { {b.key(), b.value()} };
+}
+
+template<typename BasicJsonType, typename Tuple, std::size_t... Idx>
+inline void to_json_tuple_impl(BasicJsonType& j, const Tuple& t, index_sequence<Idx...> /*unused*/)
+{
+    j = { std::get<Idx>(t)... };
+}
+
+template<typename BasicJsonType, typename T, enable_if_t<is_constructible_tuple<BasicJsonType, T>::value, int > = 0>
+inline void to_json(BasicJsonType& j, const T& t)
+{
+    to_json_tuple_impl(j, t, make_index_sequence<std::tuple_size<T>::value> {});
+}
+
+#if JSON_HAS_FILESYSTEM || JSON_HAS_EXPERIMENTAL_FILESYSTEM
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, const std_fs::path& p)
+{
+    j = p.string();
+}
+#endif
+
+struct to_json_fn
+{
+    template<typename BasicJsonType, typename T>
+    auto operator()(BasicJsonType& j, T&& val) const noexcept(noexcept(to_json(j, std::forward<T>(val))))
+    -> decltype(to_json(j, std::forward<T>(val)), void())
+    {
+        return to_json(j, std::forward<T>(val));
+    }
+};
+}  // namespace detail
+
+#ifndef JSON_HAS_CPP_17
+/// namespace to hold default `to_json` function
+/// to see why this is required:
+/// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4381.html
+namespace // NOLINT(cert-dcl59-cpp,fuchsia-header-anon-namespaces,google-build-namespaces)
+{
+#endif
+JSON_INLINE_VARIABLE constexpr const auto& to_json = // NOLINT(misc-definitions-in-headers)
+    detail::static_const<detail::to_json_fn>::value;
+#ifndef JSON_HAS_CPP_17
+}  // namespace
+#endif
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/identity_tag.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/// @sa https://json.nlohmann.me/api/adl_serializer/
+template<typename ValueType, typename>
+struct adl_serializer
+{
+    /// @brief convert a JSON value to any value type
+    /// @sa https://json.nlohmann.me/api/adl_serializer/from_json/
+    template<typename BasicJsonType, typename TargetType = ValueType>
+    static auto from_json(BasicJsonType && j, TargetType& val) noexcept(
+        noexcept(::nlohmann::from_json(std::forward<BasicJsonType>(j), val)))
+    -> decltype(::nlohmann::from_json(std::forward<BasicJsonType>(j), val), void())
+    {
+        ::nlohmann::from_json(std::forward<BasicJsonType>(j), val);
+    }
+
+    /// @brief convert a JSON value to any value type
+    /// @sa https://json.nlohmann.me/api/adl_serializer/from_json/
+    template<typename BasicJsonType, typename TargetType = ValueType>
+    static auto from_json(BasicJsonType && j) noexcept(
+    noexcept(::nlohmann::from_json(std::forward<BasicJsonType>(j), detail::identity_tag<TargetType> {})))
+    -> decltype(::nlohmann::from_json(std::forward<BasicJsonType>(j), detail::identity_tag<TargetType> {}))
+    {
+        return ::nlohmann::from_json(std::forward<BasicJsonType>(j), detail::identity_tag<TargetType> {});
+    }
+
+    /// @brief convert any value type to a JSON value
+    /// @sa https://json.nlohmann.me/api/adl_serializer/to_json/
+    template<typename BasicJsonType, typename TargetType = ValueType>
+    static auto to_json(BasicJsonType& j, TargetType && val) noexcept(
+        noexcept(::nlohmann::to_json(j, std::forward<TargetType>(val))))
+    -> decltype(::nlohmann::to_json(j, std::forward<TargetType>(val)), void())
+    {
+        ::nlohmann::to_json(j, std::forward<TargetType>(val));
+    }
+};
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/byte_container_with_subtype.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstdint> // uint8_t, uint64_t
+#include <tuple> // tie
+#include <utility> // move
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/// @brief an internal type for a backed binary type
+/// @sa https://json.nlohmann.me/api/byte_container_with_subtype/
+template<typename BinaryType>
+class byte_container_with_subtype : public BinaryType
+{
+  public:
+    using container_type = BinaryType;
+    using subtype_type = std::uint64_t;
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype() noexcept(noexcept(container_type()))
+        : container_type()
+    {}
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype(const container_type& b) noexcept(noexcept(container_type(b)))
+        : container_type(b)
+    {}
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype(container_type&& b) noexcept(noexcept(container_type(std::move(b))))
+        : container_type(std::move(b))
+    {}
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype(const container_type& b, subtype_type subtype_) noexcept(noexcept(container_type(b)))
+        : container_type(b)
+        , m_subtype(subtype_)
+        , m_has_subtype(true)
+    {}
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype(container_type&& b, subtype_type subtype_) noexcept(noexcept(container_type(std::move(b))))
+        : container_type(std::move(b))
+        , m_subtype(subtype_)
+        , m_has_subtype(true)
+    {}
+
+    bool operator==(const byte_container_with_subtype& rhs) const
+    {
+        return std::tie(static_cast<const BinaryType&>(*this), m_subtype, m_has_subtype) ==
+               std::tie(static_cast<const BinaryType&>(rhs), rhs.m_subtype, rhs.m_has_subtype);
+    }
+
+    bool operator!=(const byte_container_with_subtype& rhs) const
+    {
+        return !(rhs == *this);
+    }
+
+    /// @brief sets the binary subtype
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/set_subtype/
+    void set_subtype(subtype_type subtype_) noexcept
+    {
+        m_subtype = subtype_;
+        m_has_subtype = true;
+    }
+
+    /// @brief return the binary subtype
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/subtype/
+    constexpr subtype_type subtype() const noexcept
+    {
+        return m_has_subtype ? m_subtype : static_cast<subtype_type>(-1);
+    }
+
+    /// @brief return whether the value has a subtype
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/has_subtype/
+    constexpr bool has_subtype() const noexcept
+    {
+        return m_has_subtype;
+    }
+
+    /// @brief clears the binary subtype
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/clear_subtype/
+    void clear_subtype() noexcept
+    {
+        m_subtype = 0;
+        m_has_subtype = false;
+    }
+
+  private:
+    subtype_type m_subtype = 0;
+    bool m_has_subtype = false;
+};
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/conversions/from_json.hpp>
+
+// #include <nlohmann/detail/conversions/to_json.hpp>
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/hash.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstdint> // uint8_t
+#include <cstddef> // size_t
+#include <functional> // hash
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+// boost::hash_combine
+inline std::size_t combine(std::size_t seed, std::size_t h) noexcept
+{
+    seed ^= h + 0x9e3779b9 + (seed << 6U) + (seed >> 2U);
+    return seed;
+}
+
+/*!
+@brief hash a JSON value
+
+The hash function tries to rely on std::hash where possible. Furthermore, the
+type of the JSON value is taken into account to have different hash values for
+null, 0, 0U, and false, etc.
+
+@tparam BasicJsonType basic_json specialization
+@param j JSON value to hash
+@return hash value of j
+*/
+template<typename BasicJsonType>
+std::size_t hash(const BasicJsonType& j)
+{
+    using string_t = typename BasicJsonType::string_t;
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+
+    const auto type = static_cast<std::size_t>(j.type());
+    switch (j.type())
+    {
+        case BasicJsonType::value_t::null:
+        case BasicJsonType::value_t::discarded:
+        {
+            return combine(type, 0);
+        }
+
+        case BasicJsonType::value_t::object:
+        {
+            auto seed = combine(type, j.size());
+            for (const auto& element : j.items())
+            {
+                const auto h = std::hash<string_t> {}(element.key());
+                seed = combine(seed, h);
+                seed = combine(seed, hash(element.value()));
+            }
+            return seed;
+        }
+
+        case BasicJsonType::value_t::array:
+        {
+            auto seed = combine(type, j.size());
+            for (const auto& element : j)
+            {
+                seed = combine(seed, hash(element));
+            }
+            return seed;
+        }
+
+        case BasicJsonType::value_t::string:
+        {
+            const auto h = std::hash<string_t> {}(j.template get_ref<const string_t&>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::boolean:
+        {
+            const auto h = std::hash<bool> {}(j.template get<bool>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::number_integer:
+        {
+            const auto h = std::hash<number_integer_t> {}(j.template get<number_integer_t>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::number_unsigned:
+        {
+            const auto h = std::hash<number_unsigned_t> {}(j.template get<number_unsigned_t>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::number_float:
+        {
+            const auto h = std::hash<number_float_t> {}(j.template get<number_float_t>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::binary:
+        {
+            auto seed = combine(type, j.get_binary().size());
+            const auto h = std::hash<bool> {}(j.get_binary().has_subtype());
+            seed = combine(seed, h);
+            seed = combine(seed, static_cast<std::size_t>(j.get_binary().subtype()));
+            for (const auto byte : j.get_binary())
+            {
+                seed = combine(seed, std::hash<std::uint8_t> {}(byte));
+            }
+            return seed;
+        }
+
+        default:                   // LCOV_EXCL_LINE
+            JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+            return 0;              // LCOV_EXCL_LINE
+    }
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/binary_reader.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // generate_n
+#include <array> // array
+#include <cmath> // ldexp
+#include <cstddef> // size_t
+#include <cstdint> // uint8_t, uint16_t, uint32_t, uint64_t
+#include <cstdio> // snprintf
+#include <cstring> // memcpy
+#include <iterator> // back_inserter
+#include <limits> // numeric_limits
+#include <string> // char_traits, string
+#include <utility> // make_pair, move
+#include <vector> // vector
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <cstddef> // size_t
+#include <cstring> // strlen
+#include <iterator> // begin, end, iterator_traits, random_access_iterator_tag, distance, next
+#include <memory> // shared_ptr, make_shared, addressof
+#include <numeric> // accumulate
+#include <string> // string, char_traits
+#include <type_traits> // enable_if, is_base_of, is_pointer, is_integral, remove_pointer
+#include <utility> // pair, declval
+
+#ifndef JSON_NO_IO
+    #include <cstdio>   // FILE *
+    #include <istream>  // istream
+#endif                  // JSON_NO_IO
+
+// #include <nlohmann/detail/iterators/iterator_traits.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/// the supported input formats
+enum class input_format_t { json, cbor, msgpack, ubjson, bson, bjdata };
+
+////////////////////
+// input adapters //
+////////////////////
+
+#ifndef JSON_NO_IO
+/*!
+Input adapter for stdio file access. This adapter read only 1 byte and do not use any
+ buffer. This adapter is a very low level adapter.
+*/
+class file_input_adapter
+{
+  public:
+    using char_type = char;
+
+    JSON_HEDLEY_NON_NULL(2)
+    explicit file_input_adapter(std::FILE* f) noexcept
+        : m_file(f)
+    {
+        JSON_ASSERT(m_file != nullptr);
+    }
+
+    // make class move-only
+    file_input_adapter(const file_input_adapter&) = delete;
+    file_input_adapter(file_input_adapter&&) noexcept = default;
+    file_input_adapter& operator=(const file_input_adapter&) = delete;
+    file_input_adapter& operator=(file_input_adapter&&) = delete;
+    ~file_input_adapter() = default;
+
+    std::char_traits<char>::int_type get_character() noexcept
+    {
+        return std::fgetc(m_file);
+    }
+
+  private:
+    /// the file pointer to read from
+    std::FILE* m_file;
+};
+
+
+/*!
+Input adapter for a (caching) istream. Ignores a UFT Byte Order Mark at
+beginning of input. Does not support changing the underlying std::streambuf
+in mid-input. Maintains underlying std::istream and std::streambuf to support
+subsequent use of standard std::istream operations to process any input
+characters following those used in parsing the JSON input.  Clears the
+std::istream flags; any input errors (e.g., EOF) will be detected by the first
+subsequent call for input from the std::istream.
+*/
+class input_stream_adapter
+{
+  public:
+    using char_type = char;
+
+    ~input_stream_adapter()
+    {
+        // clear stream flags; we use underlying streambuf I/O, do not
+        // maintain ifstream flags, except eof
+        if (is != nullptr)
+        {
+            is->clear(is->rdstate() & std::ios::eofbit);
+        }
+    }
+
+    explicit input_stream_adapter(std::istream& i)
+        : is(&i), sb(i.rdbuf())
+    {}
+
+    // delete because of pointer members
+    input_stream_adapter(const input_stream_adapter&) = delete;
+    input_stream_adapter& operator=(input_stream_adapter&) = delete;
+    input_stream_adapter& operator=(input_stream_adapter&&) = delete;
+
+    input_stream_adapter(input_stream_adapter&& rhs) noexcept
+        : is(rhs.is), sb(rhs.sb)
+    {
+        rhs.is = nullptr;
+        rhs.sb = nullptr;
+    }
+
+    // std::istream/std::streambuf use std::char_traits<char>::to_int_type, to
+    // ensure that std::char_traits<char>::eof() and the character 0xFF do not
+    // end up as the same value, e.g. 0xFFFFFFFF.
+    std::char_traits<char>::int_type get_character()
+    {
+        auto res = sb->sbumpc();
+        // set eof manually, as we don't use the istream interface.
+        if (JSON_HEDLEY_UNLIKELY(res == std::char_traits<char>::eof()))
+        {
+            is->clear(is->rdstate() | std::ios::eofbit);
+        }
+        return res;
+    }
+
+  private:
+    /// the associated input stream
+    std::istream* is = nullptr;
+    std::streambuf* sb = nullptr;
+};
+#endif  // JSON_NO_IO
+
+// General-purpose iterator-based adapter. It might not be as fast as
+// theoretically possible for some containers, but it is extremely versatile.
+template<typename IteratorType>
+class iterator_input_adapter
+{
+  public:
+    using char_type = typename std::iterator_traits<IteratorType>::value_type;
+
+    iterator_input_adapter(IteratorType first, IteratorType last)
+        : current(std::move(first)), end(std::move(last))
+    {}
+
+    typename std::char_traits<char_type>::int_type get_character()
+    {
+        if (JSON_HEDLEY_LIKELY(current != end))
+        {
+            auto result = std::char_traits<char_type>::to_int_type(*current);
+            std::advance(current, 1);
+            return result;
+        }
+
+        return std::char_traits<char_type>::eof();
+    }
+
+  private:
+    IteratorType current;
+    IteratorType end;
+
+    template<typename BaseInputAdapter, size_t T>
+    friend struct wide_string_input_helper;
+
+    bool empty() const
+    {
+        return current == end;
+    }
+};
+
+
+template<typename BaseInputAdapter, size_t T>
+struct wide_string_input_helper;
+
+template<typename BaseInputAdapter>
+struct wide_string_input_helper<BaseInputAdapter, 4>
+{
+    // UTF-32
+    static void fill_buffer(BaseInputAdapter& input,
+                            std::array<std::char_traits<char>::int_type, 4>& utf8_bytes,
+                            size_t& utf8_bytes_index,
+                            size_t& utf8_bytes_filled)
+    {
+        utf8_bytes_index = 0;
+
+        if (JSON_HEDLEY_UNLIKELY(input.empty()))
+        {
+            utf8_bytes[0] = std::char_traits<char>::eof();
+            utf8_bytes_filled = 1;
+        }
+        else
+        {
+            // get the current character
+            const auto wc = input.get_character();
+
+            // UTF-32 to UTF-8 encoding
+            if (wc < 0x80)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc);
+                utf8_bytes_filled = 1;
+            }
+            else if (wc <= 0x7FF)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xC0u | ((static_cast<unsigned int>(wc) >> 6u) & 0x1Fu));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 2;
+            }
+            else if (wc <= 0xFFFF)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xE0u | ((static_cast<unsigned int>(wc) >> 12u) & 0x0Fu));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((static_cast<unsigned int>(wc) >> 6u) & 0x3Fu));
+                utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 3;
+            }
+            else if (wc <= 0x10FFFF)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xF0u | ((static_cast<unsigned int>(wc) >> 18u) & 0x07u));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((static_cast<unsigned int>(wc) >> 12u) & 0x3Fu));
+                utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | ((static_cast<unsigned int>(wc) >> 6u) & 0x3Fu));
+                utf8_bytes[3] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 4;
+            }
+            else
+            {
+                // unknown character
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc);
+                utf8_bytes_filled = 1;
+            }
+        }
+    }
+};
+
+template<typename BaseInputAdapter>
+struct wide_string_input_helper<BaseInputAdapter, 2>
+{
+    // UTF-16
+    static void fill_buffer(BaseInputAdapter& input,
+                            std::array<std::char_traits<char>::int_type, 4>& utf8_bytes,
+                            size_t& utf8_bytes_index,
+                            size_t& utf8_bytes_filled)
+    {
+        utf8_bytes_index = 0;
+
+        if (JSON_HEDLEY_UNLIKELY(input.empty()))
+        {
+            utf8_bytes[0] = std::char_traits<char>::eof();
+            utf8_bytes_filled = 1;
+        }
+        else
+        {
+            // get the current character
+            const auto wc = input.get_character();
+
+            // UTF-16 to UTF-8 encoding
+            if (wc < 0x80)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc);
+                utf8_bytes_filled = 1;
+            }
+            else if (wc <= 0x7FF)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xC0u | ((static_cast<unsigned int>(wc) >> 6u)));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 2;
+            }
+            else if (0xD800 > wc || wc >= 0xE000)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xE0u | ((static_cast<unsigned int>(wc) >> 12u)));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((static_cast<unsigned int>(wc) >> 6u) & 0x3Fu));
+                utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 3;
+            }
+            else
+            {
+                if (JSON_HEDLEY_UNLIKELY(!input.empty()))
+                {
+                    const auto wc2 = static_cast<unsigned int>(input.get_character());
+                    const auto charcode = 0x10000u + (((static_cast<unsigned int>(wc) & 0x3FFu) << 10u) | (wc2 & 0x3FFu));
+                    utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xF0u | (charcode >> 18u));
+                    utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((charcode >> 12u) & 0x3Fu));
+                    utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | ((charcode >> 6u) & 0x3Fu));
+                    utf8_bytes[3] = static_cast<std::char_traits<char>::int_type>(0x80u | (charcode & 0x3Fu));
+                    utf8_bytes_filled = 4;
+                }
+                else
+                {
+                    utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc);
+                    utf8_bytes_filled = 1;
+                }
+            }
+        }
+    }
+};
+
+// Wraps another input apdater to convert wide character types into individual bytes.
+template<typename BaseInputAdapter, typename WideCharType>
+class wide_string_input_adapter
+{
+  public:
+    using char_type = char;
+
+    wide_string_input_adapter(BaseInputAdapter base)
+        : base_adapter(base) {}
+
+    typename std::char_traits<char>::int_type get_character() noexcept
+    {
+        // check if buffer needs to be filled
+        if (utf8_bytes_index == utf8_bytes_filled)
+        {
+            fill_buffer<sizeof(WideCharType)>();
+
+            JSON_ASSERT(utf8_bytes_filled > 0);
+            JSON_ASSERT(utf8_bytes_index == 0);
+        }
+
+        // use buffer
+        JSON_ASSERT(utf8_bytes_filled > 0);
+        JSON_ASSERT(utf8_bytes_index < utf8_bytes_filled);
+        return utf8_bytes[utf8_bytes_index++];
+    }
+
+  private:
+    BaseInputAdapter base_adapter;
+
+    template<size_t T>
+    void fill_buffer()
+    {
+        wide_string_input_helper<BaseInputAdapter, T>::fill_buffer(base_adapter, utf8_bytes, utf8_bytes_index, utf8_bytes_filled);
+    }
+
+    /// a buffer for UTF-8 bytes
+    std::array<std::char_traits<char>::int_type, 4> utf8_bytes = {{0, 0, 0, 0}};
+
+    /// index to the utf8_codes array for the next valid byte
+    std::size_t utf8_bytes_index = 0;
+    /// number of valid bytes in the utf8_codes array
+    std::size_t utf8_bytes_filled = 0;
+};
+
+
+template<typename IteratorType, typename Enable = void>
+struct iterator_input_adapter_factory
+{
+    using iterator_type = IteratorType;
+    using char_type = typename std::iterator_traits<iterator_type>::value_type;
+    using adapter_type = iterator_input_adapter<iterator_type>;
+
+    static adapter_type create(IteratorType first, IteratorType last)
+    {
+        return adapter_type(std::move(first), std::move(last));
+    }
+};
+
+template<typename T>
+struct is_iterator_of_multibyte
+{
+    using value_type = typename std::iterator_traits<T>::value_type;
+    enum
+    {
+        value = sizeof(value_type) > 1
+    };
+};
+
+template<typename IteratorType>
+struct iterator_input_adapter_factory<IteratorType, enable_if_t<is_iterator_of_multibyte<IteratorType>::value>>
+{
+    using iterator_type = IteratorType;
+    using char_type = typename std::iterator_traits<iterator_type>::value_type;
+    using base_adapter_type = iterator_input_adapter<iterator_type>;
+    using adapter_type = wide_string_input_adapter<base_adapter_type, char_type>;
+
+    static adapter_type create(IteratorType first, IteratorType last)
+    {
+        return adapter_type(base_adapter_type(std::move(first), std::move(last)));
+    }
+};
+
+// General purpose iterator-based input
+template<typename IteratorType>
+typename iterator_input_adapter_factory<IteratorType>::adapter_type input_adapter(IteratorType first, IteratorType last)
+{
+    using factory_type = iterator_input_adapter_factory<IteratorType>;
+    return factory_type::create(first, last);
+}
+
+// Convenience shorthand from container to iterator
+// Enables ADL on begin(container) and end(container)
+// Encloses the using declarations in namespace for not to leak them to outside scope
+
+namespace container_input_adapter_factory_impl
+{
+
+using std::begin;
+using std::end;
+
+template<typename ContainerType, typename Enable = void>
+struct container_input_adapter_factory {};
+
+template<typename ContainerType>
+struct container_input_adapter_factory< ContainerType,
+       void_t<decltype(begin(std::declval<ContainerType>()), end(std::declval<ContainerType>()))>>
+       {
+           using adapter_type = decltype(input_adapter(begin(std::declval<ContainerType>()), end(std::declval<ContainerType>())));
+
+           static adapter_type create(const ContainerType& container)
+{
+    return input_adapter(begin(container), end(container));
+}
+       };
+
+}  // namespace container_input_adapter_factory_impl
+
+template<typename ContainerType>
+typename container_input_adapter_factory_impl::container_input_adapter_factory<ContainerType>::adapter_type input_adapter(const ContainerType& container)
+{
+    return container_input_adapter_factory_impl::container_input_adapter_factory<ContainerType>::create(container);
+}
+
+#ifndef JSON_NO_IO
+// Special cases with fast paths
+inline file_input_adapter input_adapter(std::FILE* file)
+{
+    return file_input_adapter(file);
+}
+
+inline input_stream_adapter input_adapter(std::istream& stream)
+{
+    return input_stream_adapter(stream);
+}
+
+inline input_stream_adapter input_adapter(std::istream&& stream)
+{
+    return input_stream_adapter(stream);
+}
+#endif  // JSON_NO_IO
+
+using contiguous_bytes_input_adapter = decltype(input_adapter(std::declval<const char*>(), std::declval<const char*>()));
+
+// Null-delimited strings, and the like.
+template < typename CharT,
+           typename std::enable_if <
+               std::is_pointer<CharT>::value&&
+               !std::is_array<CharT>::value&&
+               std::is_integral<typename std::remove_pointer<CharT>::type>::value&&
+               sizeof(typename std::remove_pointer<CharT>::type) == 1,
+               int >::type = 0 >
+contiguous_bytes_input_adapter input_adapter(CharT b)
+{
+    auto length = std::strlen(reinterpret_cast<const char*>(b));
+    const auto* ptr = reinterpret_cast<const char*>(b);
+    return input_adapter(ptr, ptr + length);
+}
+
+template<typename T, std::size_t N>
+auto input_adapter(T (&array)[N]) -> decltype(input_adapter(array, array + N)) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+{
+    return input_adapter(array, array + N);
+}
+
+// This class only handles inputs of input_buffer_adapter type.
+// It's required so that expressions like {ptr, len} can be implicitly cast
+// to the correct adapter.
+class span_input_adapter
+{
+  public:
+    template < typename CharT,
+               typename std::enable_if <
+                   std::is_pointer<CharT>::value&&
+                   std::is_integral<typename std::remove_pointer<CharT>::type>::value&&
+                   sizeof(typename std::remove_pointer<CharT>::type) == 1,
+                   int >::type = 0 >
+    span_input_adapter(CharT b, std::size_t l)
+        : ia(reinterpret_cast<const char*>(b), reinterpret_cast<const char*>(b) + l) {}
+
+    template<class IteratorType,
+             typename std::enable_if<
+                 std::is_same<typename iterator_traits<IteratorType>::iterator_category, std::random_access_iterator_tag>::value,
+                 int>::type = 0>
+    span_input_adapter(IteratorType first, IteratorType last)
+        : ia(input_adapter(first, last)) {}
+
+    contiguous_bytes_input_adapter&& get()
+    {
+        return std::move(ia); // NOLINT(hicpp-move-const-arg,performance-move-const-arg)
+    }
+
+  private:
+    contiguous_bytes_input_adapter ia;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/json_sax.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef>
+#include <string> // string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/*!
+@brief SAX interface
+
+This class describes the SAX interface used by @ref nlohmann::json::sax_parse.
+Each function is called in different situations while the input is parsed. The
+boolean return value informs the parser whether to continue processing the
+input.
+*/
+template<typename BasicJsonType>
+struct json_sax
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+
+    /*!
+    @brief a null value was read
+    @return whether parsing should proceed
+    */
+    virtual bool null() = 0;
+
+    /*!
+    @brief a boolean value was read
+    @param[in] val  boolean value
+    @return whether parsing should proceed
+    */
+    virtual bool boolean(bool val) = 0;
+
+    /*!
+    @brief an integer number was read
+    @param[in] val  integer value
+    @return whether parsing should proceed
+    */
+    virtual bool number_integer(number_integer_t val) = 0;
+
+    /*!
+    @brief an unsigned integer number was read
+    @param[in] val  unsigned integer value
+    @return whether parsing should proceed
+    */
+    virtual bool number_unsigned(number_unsigned_t val) = 0;
+
+    /*!
+    @brief a floating-point number was read
+    @param[in] val  floating-point value
+    @param[in] s    raw token value
+    @return whether parsing should proceed
+    */
+    virtual bool number_float(number_float_t val, const string_t& s) = 0;
+
+    /*!
+    @brief a string value was read
+    @param[in] val  string value
+    @return whether parsing should proceed
+    @note It is safe to move the passed string value.
+    */
+    virtual bool string(string_t& val) = 0;
+
+    /*!
+    @brief a binary value was read
+    @param[in] val  binary value
+    @return whether parsing should proceed
+    @note It is safe to move the passed binary value.
+    */
+    virtual bool binary(binary_t& val) = 0;
+
+    /*!
+    @brief the beginning of an object was read
+    @param[in] elements  number of object elements or -1 if unknown
+    @return whether parsing should proceed
+    @note binary formats may report the number of elements
+    */
+    virtual bool start_object(std::size_t elements) = 0;
+
+    /*!
+    @brief an object key was read
+    @param[in] val  object key
+    @return whether parsing should proceed
+    @note It is safe to move the passed string.
+    */
+    virtual bool key(string_t& val) = 0;
+
+    /*!
+    @brief the end of an object was read
+    @return whether parsing should proceed
+    */
+    virtual bool end_object() = 0;
+
+    /*!
+    @brief the beginning of an array was read
+    @param[in] elements  number of array elements or -1 if unknown
+    @return whether parsing should proceed
+    @note binary formats may report the number of elements
+    */
+    virtual bool start_array(std::size_t elements) = 0;
+
+    /*!
+    @brief the end of an array was read
+    @return whether parsing should proceed
+    */
+    virtual bool end_array() = 0;
+
+    /*!
+    @brief a parse error occurred
+    @param[in] position    the position in the input where the error occurs
+    @param[in] last_token  the last read token
+    @param[in] ex          an exception object describing the error
+    @return whether parsing should proceed (must return false)
+    */
+    virtual bool parse_error(std::size_t position,
+                             const std::string& last_token,
+                             const detail::exception& ex) = 0;
+
+    json_sax() = default;
+    json_sax(const json_sax&) = default;
+    json_sax(json_sax&&) noexcept = default;
+    json_sax& operator=(const json_sax&) = default;
+    json_sax& operator=(json_sax&&) noexcept = default;
+    virtual ~json_sax() = default;
+};
+
+
+namespace detail
+{
+/*!
+@brief SAX implementation to create a JSON value from SAX events
+
+This class implements the @ref json_sax interface and processes the SAX events
+to create a JSON value which makes it basically a DOM parser. The structure or
+hierarchy of the JSON value is managed by the stack `ref_stack` which contains
+a pointer to the respective array or object for each recursion depth.
+
+After successful parsing, the value that is passed by reference to the
+constructor contains the parsed value.
+
+@tparam BasicJsonType  the JSON type
+*/
+template<typename BasicJsonType>
+class json_sax_dom_parser
+{
+  public:
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+
+    /*!
+    @param[in,out] r  reference to a JSON value that is manipulated while
+                       parsing
+    @param[in] allow_exceptions_  whether parse errors yield exceptions
+    */
+    explicit json_sax_dom_parser(BasicJsonType& r, const bool allow_exceptions_ = true)
+        : root(r), allow_exceptions(allow_exceptions_)
+    {}
+
+    // make class move-only
+    json_sax_dom_parser(const json_sax_dom_parser&) = delete;
+    json_sax_dom_parser(json_sax_dom_parser&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    json_sax_dom_parser& operator=(const json_sax_dom_parser&) = delete;
+    json_sax_dom_parser& operator=(json_sax_dom_parser&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    ~json_sax_dom_parser() = default;
+
+    bool null()
+    {
+        handle_value(nullptr);
+        return true;
+    }
+
+    bool boolean(bool val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_integer(number_integer_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_unsigned(number_unsigned_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_float(number_float_t val, const string_t& /*unused*/)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool string(string_t& val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool binary(binary_t& val)
+    {
+        handle_value(std::move(val));
+        return true;
+    }
+
+    bool start_object(std::size_t len)
+    {
+        ref_stack.push_back(handle_value(BasicJsonType::value_t::object));
+
+        if (JSON_HEDLEY_UNLIKELY(len != static_cast<std::size_t>(-1) && len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408, concat("excessive object size: ", std::to_string(len)), ref_stack.back()));
+        }
+
+        return true;
+    }
+
+    bool key(string_t& val)
+    {
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(ref_stack.back()->is_object());
+
+        // add null at given key and store the reference for later
+        object_element = &(ref_stack.back()->m_value.object->operator[](val));
+        return true;
+    }
+
+    bool end_object()
+    {
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(ref_stack.back()->is_object());
+
+        ref_stack.back()->set_parents();
+        ref_stack.pop_back();
+        return true;
+    }
+
+    bool start_array(std::size_t len)
+    {
+        ref_stack.push_back(handle_value(BasicJsonType::value_t::array));
+
+        if (JSON_HEDLEY_UNLIKELY(len != static_cast<std::size_t>(-1) && len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408, concat("excessive array size: ", std::to_string(len)), ref_stack.back()));
+        }
+
+        return true;
+    }
+
+    bool end_array()
+    {
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(ref_stack.back()->is_array());
+
+        ref_stack.back()->set_parents();
+        ref_stack.pop_back();
+        return true;
+    }
+
+    template<class Exception>
+    bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/,
+                     const Exception& ex)
+    {
+        errored = true;
+        static_cast<void>(ex);
+        if (allow_exceptions)
+        {
+            JSON_THROW(ex);
+        }
+        return false;
+    }
+
+    constexpr bool is_errored() const
+    {
+        return errored;
+    }
+
+  private:
+    /*!
+    @invariant If the ref stack is empty, then the passed value will be the new
+               root.
+    @invariant If the ref stack contains a value, then it is an array or an
+               object to which we can add elements
+    */
+    template<typename Value>
+    JSON_HEDLEY_RETURNS_NON_NULL
+    BasicJsonType* handle_value(Value&& v)
+    {
+        if (ref_stack.empty())
+        {
+            root = BasicJsonType(std::forward<Value>(v));
+            return &root;
+        }
+
+        JSON_ASSERT(ref_stack.back()->is_array() || ref_stack.back()->is_object());
+
+        if (ref_stack.back()->is_array())
+        {
+            ref_stack.back()->m_value.array->emplace_back(std::forward<Value>(v));
+            return &(ref_stack.back()->m_value.array->back());
+        }
+
+        JSON_ASSERT(ref_stack.back()->is_object());
+        JSON_ASSERT(object_element);
+        *object_element = BasicJsonType(std::forward<Value>(v));
+        return object_element;
+    }
+
+    /// the parsed JSON value
+    BasicJsonType& root;
+    /// stack to model hierarchy of values
+    std::vector<BasicJsonType*> ref_stack {};
+    /// helper to hold the reference for the next object element
+    BasicJsonType* object_element = nullptr;
+    /// whether a syntax error occurred
+    bool errored = false;
+    /// whether to throw exceptions in case of errors
+    const bool allow_exceptions = true;
+};
+
+template<typename BasicJsonType>
+class json_sax_dom_callback_parser
+{
+  public:
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using parser_callback_t = typename BasicJsonType::parser_callback_t;
+    using parse_event_t = typename BasicJsonType::parse_event_t;
+
+    json_sax_dom_callback_parser(BasicJsonType& r,
+                                 const parser_callback_t cb,
+                                 const bool allow_exceptions_ = true)
+        : root(r), callback(cb), allow_exceptions(allow_exceptions_)
+    {
+        keep_stack.push_back(true);
+    }
+
+    // make class move-only
+    json_sax_dom_callback_parser(const json_sax_dom_callback_parser&) = delete;
+    json_sax_dom_callback_parser(json_sax_dom_callback_parser&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    json_sax_dom_callback_parser& operator=(const json_sax_dom_callback_parser&) = delete;
+    json_sax_dom_callback_parser& operator=(json_sax_dom_callback_parser&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    ~json_sax_dom_callback_parser() = default;
+
+    bool null()
+    {
+        handle_value(nullptr);
+        return true;
+    }
+
+    bool boolean(bool val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_integer(number_integer_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_unsigned(number_unsigned_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_float(number_float_t val, const string_t& /*unused*/)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool string(string_t& val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool binary(binary_t& val)
+    {
+        handle_value(std::move(val));
+        return true;
+    }
+
+    bool start_object(std::size_t len)
+    {
+        // check callback for object start
+        const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::object_start, discarded);
+        keep_stack.push_back(keep);
+
+        auto val = handle_value(BasicJsonType::value_t::object, true);
+        ref_stack.push_back(val.second);
+
+        // check object limit
+        if (ref_stack.back() && JSON_HEDLEY_UNLIKELY(len != static_cast<std::size_t>(-1) && len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408, concat("excessive object size: ", std::to_string(len)), ref_stack.back()));
+        }
+
+        return true;
+    }
+
+    bool key(string_t& val)
+    {
+        BasicJsonType k = BasicJsonType(val);
+
+        // check callback for key
+        const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::key, k);
+        key_keep_stack.push_back(keep);
+
+        // add discarded value at given key and store the reference for later
+        if (keep && ref_stack.back())
+        {
+            object_element = &(ref_stack.back()->m_value.object->operator[](val) = discarded);
+        }
+
+        return true;
+    }
+
+    bool end_object()
+    {
+        if (ref_stack.back())
+        {
+            if (!callback(static_cast<int>(ref_stack.size()) - 1, parse_event_t::object_end, *ref_stack.back()))
+            {
+                // discard object
+                *ref_stack.back() = discarded;
+            }
+            else
+            {
+                ref_stack.back()->set_parents();
+            }
+        }
+
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(!keep_stack.empty());
+        ref_stack.pop_back();
+        keep_stack.pop_back();
+
+        if (!ref_stack.empty() && ref_stack.back() && ref_stack.back()->is_structured())
+        {
+            // remove discarded value
+            for (auto it = ref_stack.back()->begin(); it != ref_stack.back()->end(); ++it)
+            {
+                if (it->is_discarded())
+                {
+                    ref_stack.back()->erase(it);
+                    break;
+                }
+            }
+        }
+
+        return true;
+    }
+
+    bool start_array(std::size_t len)
+    {
+        const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::array_start, discarded);
+        keep_stack.push_back(keep);
+
+        auto val = handle_value(BasicJsonType::value_t::array, true);
+        ref_stack.push_back(val.second);
+
+        // check array limit
+        if (ref_stack.back() && JSON_HEDLEY_UNLIKELY(len != static_cast<std::size_t>(-1) && len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408, concat("excessive array size: ", std::to_string(len)), ref_stack.back()));
+        }
+
+        return true;
+    }
+
+    bool end_array()
+    {
+        bool keep = true;
+
+        if (ref_stack.back())
+        {
+            keep = callback(static_cast<int>(ref_stack.size()) - 1, parse_event_t::array_end, *ref_stack.back());
+            if (keep)
+            {
+                ref_stack.back()->set_parents();
+            }
+            else
+            {
+                // discard array
+                *ref_stack.back() = discarded;
+            }
+        }
+
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(!keep_stack.empty());
+        ref_stack.pop_back();
+        keep_stack.pop_back();
+
+        // remove discarded value
+        if (!keep && !ref_stack.empty() && ref_stack.back()->is_array())
+        {
+            ref_stack.back()->m_value.array->pop_back();
+        }
+
+        return true;
+    }
+
+    template<class Exception>
+    bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/,
+                     const Exception& ex)
+    {
+        errored = true;
+        static_cast<void>(ex);
+        if (allow_exceptions)
+        {
+            JSON_THROW(ex);
+        }
+        return false;
+    }
+
+    constexpr bool is_errored() const
+    {
+        return errored;
+    }
+
+  private:
+    /*!
+    @param[in] v  value to add to the JSON value we build during parsing
+    @param[in] skip_callback  whether we should skip calling the callback
+               function; this is required after start_array() and
+               start_object() SAX events, because otherwise we would call the
+               callback function with an empty array or object, respectively.
+
+    @invariant If the ref stack is empty, then the passed value will be the new
+               root.
+    @invariant If the ref stack contains a value, then it is an array or an
+               object to which we can add elements
+
+    @return pair of boolean (whether value should be kept) and pointer (to the
+            passed value in the ref_stack hierarchy; nullptr if not kept)
+    */
+    template<typename Value>
+    std::pair<bool, BasicJsonType*> handle_value(Value&& v, const bool skip_callback = false)
+    {
+        JSON_ASSERT(!keep_stack.empty());
+
+        // do not handle this value if we know it would be added to a discarded
+        // container
+        if (!keep_stack.back())
+        {
+            return {false, nullptr};
+        }
+
+        // create value
+        auto value = BasicJsonType(std::forward<Value>(v));
+
+        // check callback
+        const bool keep = skip_callback || callback(static_cast<int>(ref_stack.size()), parse_event_t::value, value);
+
+        // do not handle this value if we just learnt it shall be discarded
+        if (!keep)
+        {
+            return {false, nullptr};
+        }
+
+        if (ref_stack.empty())
+        {
+            root = std::move(value);
+            return {true, &root};
+        }
+
+        // skip this value if we already decided to skip the parent
+        // (https://github.com/nlohmann/json/issues/971#issuecomment-413678360)
+        if (!ref_stack.back())
+        {
+            return {false, nullptr};
+        }
+
+        // we now only expect arrays and objects
+        JSON_ASSERT(ref_stack.back()->is_array() || ref_stack.back()->is_object());
+
+        // array
+        if (ref_stack.back()->is_array())
+        {
+            ref_stack.back()->m_value.array->emplace_back(std::move(value));
+            return {true, &(ref_stack.back()->m_value.array->back())};
+        }
+
+        // object
+        JSON_ASSERT(ref_stack.back()->is_object());
+        // check if we should store an element for the current key
+        JSON_ASSERT(!key_keep_stack.empty());
+        const bool store_element = key_keep_stack.back();
+        key_keep_stack.pop_back();
+
+        if (!store_element)
+        {
+            return {false, nullptr};
+        }
+
+        JSON_ASSERT(object_element);
+        *object_element = std::move(value);
+        return {true, object_element};
+    }
+
+    /// the parsed JSON value
+    BasicJsonType& root;
+    /// stack to model hierarchy of values
+    std::vector<BasicJsonType*> ref_stack {};
+    /// stack to manage which values to keep
+    std::vector<bool> keep_stack {};
+    /// stack to manage which object keys to keep
+    std::vector<bool> key_keep_stack {};
+    /// helper to hold the reference for the next object element
+    BasicJsonType* object_element = nullptr;
+    /// whether a syntax error occurred
+    bool errored = false;
+    /// callback function
+    const parser_callback_t callback = nullptr;
+    /// whether to throw exceptions in case of errors
+    const bool allow_exceptions = true;
+    /// a discarded value for the callback
+    BasicJsonType discarded = BasicJsonType::value_t::discarded;
+};
+
+template<typename BasicJsonType>
+class json_sax_acceptor
+{
+  public:
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+
+    bool null()
+    {
+        return true;
+    }
+
+    bool boolean(bool /*unused*/)
+    {
+        return true;
+    }
+
+    bool number_integer(number_integer_t /*unused*/)
+    {
+        return true;
+    }
+
+    bool number_unsigned(number_unsigned_t /*unused*/)
+    {
+        return true;
+    }
+
+    bool number_float(number_float_t /*unused*/, const string_t& /*unused*/)
+    {
+        return true;
+    }
+
+    bool string(string_t& /*unused*/)
+    {
+        return true;
+    }
+
+    bool binary(binary_t& /*unused*/)
+    {
+        return true;
+    }
+
+    bool start_object(std::size_t /*unused*/ = static_cast<std::size_t>(-1))
+    {
+        return true;
+    }
+
+    bool key(string_t& /*unused*/)
+    {
+        return true;
+    }
+
+    bool end_object()
+    {
+        return true;
+    }
+
+    bool start_array(std::size_t /*unused*/ = static_cast<std::size_t>(-1))
+    {
+        return true;
+    }
+
+    bool end_array()
+    {
+        return true;
+    }
+
+    bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/, const detail::exception& /*unused*/)
+    {
+        return false;
+    }
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/lexer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <clocale> // localeconv
+#include <cstddef> // size_t
+#include <cstdio> // snprintf
+#include <cstdlib> // strtof, strtod, strtold, strtoll, strtoull
+#include <initializer_list> // initializer_list
+#include <string> // char_traits, string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+// #include <nlohmann/detail/input/position_t.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+///////////
+// lexer //
+///////////
+
+template<typename BasicJsonType>
+class lexer_base
+{
+  public:
+    /// token types for the parser
+    enum class token_type
+    {
+        uninitialized,    ///< indicating the scanner is uninitialized
+        literal_true,     ///< the `true` literal
+        literal_false,    ///< the `false` literal
+        literal_null,     ///< the `null` literal
+        value_string,     ///< a string -- use get_string() for actual value
+        value_unsigned,   ///< an unsigned integer -- use get_number_unsigned() for actual value
+        value_integer,    ///< a signed integer -- use get_number_integer() for actual value
+        value_float,      ///< an floating point number -- use get_number_float() for actual value
+        begin_array,      ///< the character for array begin `[`
+        begin_object,     ///< the character for object begin `{`
+        end_array,        ///< the character for array end `]`
+        end_object,       ///< the character for object end `}`
+        name_separator,   ///< the name separator `:`
+        value_separator,  ///< the value separator `,`
+        parse_error,      ///< indicating a parse error
+        end_of_input,     ///< indicating the end of the input buffer
+        literal_or_value  ///< a literal or the begin of a value (only for diagnostics)
+    };
+
+    /// return name of values of type token_type (only used for errors)
+    JSON_HEDLEY_RETURNS_NON_NULL
+    JSON_HEDLEY_CONST
+    static const char* token_type_name(const token_type t) noexcept
+    {
+        switch (t)
+        {
+            case token_type::uninitialized:
+                return "<uninitialized>";
+            case token_type::literal_true:
+                return "true literal";
+            case token_type::literal_false:
+                return "false literal";
+            case token_type::literal_null:
+                return "null literal";
+            case token_type::value_string:
+                return "string literal";
+            case token_type::value_unsigned:
+            case token_type::value_integer:
+            case token_type::value_float:
+                return "number literal";
+            case token_type::begin_array:
+                return "'['";
+            case token_type::begin_object:
+                return "'{'";
+            case token_type::end_array:
+                return "']'";
+            case token_type::end_object:
+                return "'}'";
+            case token_type::name_separator:
+                return "':'";
+            case token_type::value_separator:
+                return "','";
+            case token_type::parse_error:
+                return "<parse error>";
+            case token_type::end_of_input:
+                return "end of input";
+            case token_type::literal_or_value:
+                return "'[', '{', or a literal";
+            // LCOV_EXCL_START
+            default: // catch non-enum values
+                return "unknown token";
+                // LCOV_EXCL_STOP
+        }
+    }
+};
+/*!
+@brief lexical analysis
+
+This class organizes the lexical analysis during JSON deserialization.
+*/
+template<typename BasicJsonType, typename InputAdapterType>
+class lexer : public lexer_base<BasicJsonType>
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using char_type = typename InputAdapterType::char_type;
+    using char_int_type = typename std::char_traits<char_type>::int_type;
+
+  public:
+    using token_type = typename lexer_base<BasicJsonType>::token_type;
+
+    explicit lexer(InputAdapterType&& adapter, bool ignore_comments_ = false) noexcept
+        : ia(std::move(adapter))
+        , ignore_comments(ignore_comments_)
+        , decimal_point_char(static_cast<char_int_type>(get_decimal_point()))
+    {}
+
+    // delete because of pointer members
+    lexer(const lexer&) = delete;
+    lexer(lexer&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    lexer& operator=(lexer&) = delete;
+    lexer& operator=(lexer&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    ~lexer() = default;
+
+  private:
+    /////////////////////
+    // locales
+    /////////////////////
+
+    /// return the locale-dependent decimal point
+    JSON_HEDLEY_PURE
+    static char get_decimal_point() noexcept
+    {
+        const auto* loc = localeconv();
+        JSON_ASSERT(loc != nullptr);
+        return (loc->decimal_point == nullptr) ? '.' : *(loc->decimal_point);
+    }
+
+    /////////////////////
+    // scan functions
+    /////////////////////
+
+    /*!
+    @brief get codepoint from 4 hex characters following `\u`
+
+    For input "\u c1 c2 c3 c4" the codepoint is:
+      (c1 * 0x1000) + (c2 * 0x0100) + (c3 * 0x0010) + c4
+    = (c1 << 12) + (c2 << 8) + (c3 << 4) + (c4 << 0)
+
+    Furthermore, the possible characters '0'..'9', 'A'..'F', and 'a'..'f'
+    must be converted to the integers 0x0..0x9, 0xA..0xF, 0xA..0xF, resp. The
+    conversion is done by subtracting the offset (0x30, 0x37, and 0x57)
+    between the ASCII value of the character and the desired integer value.
+
+    @return codepoint (0x0000..0xFFFF) or -1 in case of an error (e.g. EOF or
+            non-hex character)
+    */
+    int get_codepoint()
+    {
+        // this function only makes sense after reading `\u`
+        JSON_ASSERT(current == 'u');
+        int codepoint = 0;
+
+        const auto factors = { 12u, 8u, 4u, 0u };
+        for (const auto factor : factors)
+        {
+            get();
+
+            if (current >= '0' && current <= '9')
+            {
+                codepoint += static_cast<int>((static_cast<unsigned int>(current) - 0x30u) << factor);
+            }
+            else if (current >= 'A' && current <= 'F')
+            {
+                codepoint += static_cast<int>((static_cast<unsigned int>(current) - 0x37u) << factor);
+            }
+            else if (current >= 'a' && current <= 'f')
+            {
+                codepoint += static_cast<int>((static_cast<unsigned int>(current) - 0x57u) << factor);
+            }
+            else
+            {
+                return -1;
+            }
+        }
+
+        JSON_ASSERT(0x0000 <= codepoint && codepoint <= 0xFFFF);
+        return codepoint;
+    }
+
+    /*!
+    @brief check if the next byte(s) are inside a given range
+
+    Adds the current byte and, for each passed range, reads a new byte and
+    checks if it is inside the range. If a violation was detected, set up an
+    error message and return false. Otherwise, return true.
+
+    @param[in] ranges  list of integers; interpreted as list of pairs of
+                       inclusive lower and upper bound, respectively
+
+    @pre The passed list @a ranges must have 2, 4, or 6 elements; that is,
+         1, 2, or 3 pairs. This precondition is enforced by an assertion.
+
+    @return true if and only if no range violation was detected
+    */
+    bool next_byte_in_range(std::initializer_list<char_int_type> ranges)
+    {
+        JSON_ASSERT(ranges.size() == 2 || ranges.size() == 4 || ranges.size() == 6);
+        add(current);
+
+        for (auto range = ranges.begin(); range != ranges.end(); ++range)
+        {
+            get();
+            if (JSON_HEDLEY_LIKELY(*range <= current && current <= *(++range)))
+            {
+                add(current);
+            }
+            else
+            {
+                error_message = "invalid string: ill-formed UTF-8 byte";
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    /*!
+    @brief scan a string literal
+
+    This function scans a string according to Sect. 7 of RFC 8259. While
+    scanning, bytes are escaped and copied into buffer token_buffer. Then the
+    function returns successfully, token_buffer is *not* null-terminated (as it
+    may contain \0 bytes), and token_buffer.size() is the number of bytes in the
+    string.
+
+    @return token_type::value_string if string could be successfully scanned,
+            token_type::parse_error otherwise
+
+    @note In case of errors, variable error_message contains a textual
+          description.
+    */
+    token_type scan_string()
+    {
+        // reset token_buffer (ignore opening quote)
+        reset();
+
+        // we entered the function by reading an open quote
+        JSON_ASSERT(current == '\"');
+
+        while (true)
+        {
+            // get next character
+            switch (get())
+            {
+                // end of file while parsing string
+                case std::char_traits<char_type>::eof():
+                {
+                    error_message = "invalid string: missing closing quote";
+                    return token_type::parse_error;
+                }
+
+                // closing quote
+                case '\"':
+                {
+                    return token_type::value_string;
+                }
+
+                // escapes
+                case '\\':
+                {
+                    switch (get())
+                    {
+                        // quotation mark
+                        case '\"':
+                            add('\"');
+                            break;
+                        // reverse solidus
+                        case '\\':
+                            add('\\');
+                            break;
+                        // solidus
+                        case '/':
+                            add('/');
+                            break;
+                        // backspace
+                        case 'b':
+                            add('\b');
+                            break;
+                        // form feed
+                        case 'f':
+                            add('\f');
+                            break;
+                        // line feed
+                        case 'n':
+                            add('\n');
+                            break;
+                        // carriage return
+                        case 'r':
+                            add('\r');
+                            break;
+                        // tab
+                        case 't':
+                            add('\t');
+                            break;
+
+                        // unicode escapes
+                        case 'u':
+                        {
+                            const int codepoint1 = get_codepoint();
+                            int codepoint = codepoint1; // start with codepoint1
+
+                            if (JSON_HEDLEY_UNLIKELY(codepoint1 == -1))
+                            {
+                                error_message = "invalid string: '\\u' must be followed by 4 hex digits";
+                                return token_type::parse_error;
+                            }
+
+                            // check if code point is a high surrogate
+                            if (0xD800 <= codepoint1 && codepoint1 <= 0xDBFF)
+                            {
+                                // expect next \uxxxx entry
+                                if (JSON_HEDLEY_LIKELY(get() == '\\' && get() == 'u'))
+                                {
+                                    const int codepoint2 = get_codepoint();
+
+                                    if (JSON_HEDLEY_UNLIKELY(codepoint2 == -1))
+                                    {
+                                        error_message = "invalid string: '\\u' must be followed by 4 hex digits";
+                                        return token_type::parse_error;
+                                    }
+
+                                    // check if codepoint2 is a low surrogate
+                                    if (JSON_HEDLEY_LIKELY(0xDC00 <= codepoint2 && codepoint2 <= 0xDFFF))
+                                    {
+                                        // overwrite codepoint
+                                        codepoint = static_cast<int>(
+                                                        // high surrogate occupies the most significant 22 bits
+                                                        (static_cast<unsigned int>(codepoint1) << 10u)
+                                                        // low surrogate occupies the least significant 15 bits
+                                                        + static_cast<unsigned int>(codepoint2)
+                                                        // there is still the 0xD800, 0xDC00 and 0x10000 noise
+                                                        // in the result, so we have to subtract with:
+                                                        // (0xD800 << 10) + DC00 - 0x10000 = 0x35FDC00
+                                                        - 0x35FDC00u);
+                                    }
+                                    else
+                                    {
+                                        error_message = "invalid string: surrogate U+D800..U+DBFF must be followed by U+DC00..U+DFFF";
+                                        return token_type::parse_error;
+                                    }
+                                }
+                                else
+                                {
+                                    error_message = "invalid string: surrogate U+D800..U+DBFF must be followed by U+DC00..U+DFFF";
+                                    return token_type::parse_error;
+                                }
+                            }
+                            else
+                            {
+                                if (JSON_HEDLEY_UNLIKELY(0xDC00 <= codepoint1 && codepoint1 <= 0xDFFF))
+                                {
+                                    error_message = "invalid string: surrogate U+DC00..U+DFFF must follow U+D800..U+DBFF";
+                                    return token_type::parse_error;
+                                }
+                            }
+
+                            // result of the above calculation yields a proper codepoint
+                            JSON_ASSERT(0x00 <= codepoint && codepoint <= 0x10FFFF);
+
+                            // translate codepoint into bytes
+                            if (codepoint < 0x80)
+                            {
+                                // 1-byte characters: 0xxxxxxx (ASCII)
+                                add(static_cast<char_int_type>(codepoint));
+                            }
+                            else if (codepoint <= 0x7FF)
+                            {
+                                // 2-byte characters: 110xxxxx 10xxxxxx
+                                add(static_cast<char_int_type>(0xC0u | (static_cast<unsigned int>(codepoint) >> 6u)));
+                                add(static_cast<char_int_type>(0x80u | (static_cast<unsigned int>(codepoint) & 0x3Fu)));
+                            }
+                            else if (codepoint <= 0xFFFF)
+                            {
+                                // 3-byte characters: 1110xxxx 10xxxxxx 10xxxxxx
+                                add(static_cast<char_int_type>(0xE0u | (static_cast<unsigned int>(codepoint) >> 12u)));
+                                add(static_cast<char_int_type>(0x80u | ((static_cast<unsigned int>(codepoint) >> 6u) & 0x3Fu)));
+                                add(static_cast<char_int_type>(0x80u | (static_cast<unsigned int>(codepoint) & 0x3Fu)));
+                            }
+                            else
+                            {
+                                // 4-byte characters: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
+                                add(static_cast<char_int_type>(0xF0u | (static_cast<unsigned int>(codepoint) >> 18u)));
+                                add(static_cast<char_int_type>(0x80u | ((static_cast<unsigned int>(codepoint) >> 12u) & 0x3Fu)));
+                                add(static_cast<char_int_type>(0x80u | ((static_cast<unsigned int>(codepoint) >> 6u) & 0x3Fu)));
+                                add(static_cast<char_int_type>(0x80u | (static_cast<unsigned int>(codepoint) & 0x3Fu)));
+                            }
+
+                            break;
+                        }
+
+                        // other characters after escape
+                        default:
+                            error_message = "invalid string: forbidden character after backslash";
+                            return token_type::parse_error;
+                    }
+
+                    break;
+                }
+
+                // invalid control characters
+                case 0x00:
+                {
+                    error_message = "invalid string: control character U+0000 (NUL) must be escaped to \\u0000";
+                    return token_type::parse_error;
+                }
+
+                case 0x01:
+                {
+                    error_message = "invalid string: control character U+0001 (SOH) must be escaped to \\u0001";
+                    return token_type::parse_error;
+                }
+
+                case 0x02:
+                {
+                    error_message = "invalid string: control character U+0002 (STX) must be escaped to \\u0002";
+                    return token_type::parse_error;
+                }
+
+                case 0x03:
+                {
+                    error_message = "invalid string: control character U+0003 (ETX) must be escaped to \\u0003";
+                    return token_type::parse_error;
+                }
+
+                case 0x04:
+                {
+                    error_message = "invalid string: control character U+0004 (EOT) must be escaped to \\u0004";
+                    return token_type::parse_error;
+                }
+
+                case 0x05:
+                {
+                    error_message = "invalid string: control character U+0005 (ENQ) must be escaped to \\u0005";
+                    return token_type::parse_error;
+                }
+
+                case 0x06:
+                {
+                    error_message = "invalid string: control character U+0006 (ACK) must be escaped to \\u0006";
+                    return token_type::parse_error;
+                }
+
+                case 0x07:
+                {
+                    error_message = "invalid string: control character U+0007 (BEL) must be escaped to \\u0007";
+                    return token_type::parse_error;
+                }
+
+                case 0x08:
+                {
+                    error_message = "invalid string: control character U+0008 (BS) must be escaped to \\u0008 or \\b";
+                    return token_type::parse_error;
+                }
+
+                case 0x09:
+                {
+                    error_message = "invalid string: control character U+0009 (HT) must be escaped to \\u0009 or \\t";
+                    return token_type::parse_error;
+                }
+
+                case 0x0A:
+                {
+                    error_message = "invalid string: control character U+000A (LF) must be escaped to \\u000A or \\n";
+                    return token_type::parse_error;
+                }
+
+                case 0x0B:
+                {
+                    error_message = "invalid string: control character U+000B (VT) must be escaped to \\u000B";
+                    return token_type::parse_error;
+                }
+
+                case 0x0C:
+                {
+                    error_message = "invalid string: control character U+000C (FF) must be escaped to \\u000C or \\f";
+                    return token_type::parse_error;
+                }
+
+                case 0x0D:
+                {
+                    error_message = "invalid string: control character U+000D (CR) must be escaped to \\u000D or \\r";
+                    return token_type::parse_error;
+                }
+
+                case 0x0E:
+                {
+                    error_message = "invalid string: control character U+000E (SO) must be escaped to \\u000E";
+                    return token_type::parse_error;
+                }
+
+                case 0x0F:
+                {
+                    error_message = "invalid string: control character U+000F (SI) must be escaped to \\u000F";
+                    return token_type::parse_error;
+                }
+
+                case 0x10:
+                {
+                    error_message = "invalid string: control character U+0010 (DLE) must be escaped to \\u0010";
+                    return token_type::parse_error;
+                }
+
+                case 0x11:
+                {
+                    error_message = "invalid string: control character U+0011 (DC1) must be escaped to \\u0011";
+                    return token_type::parse_error;
+                }
+
+                case 0x12:
+                {
+                    error_message = "invalid string: control character U+0012 (DC2) must be escaped to \\u0012";
+                    return token_type::parse_error;
+                }
+
+                case 0x13:
+                {
+                    error_message = "invalid string: control character U+0013 (DC3) must be escaped to \\u0013";
+                    return token_type::parse_error;
+                }
+
+                case 0x14:
+                {
+                    error_message = "invalid string: control character U+0014 (DC4) must be escaped to \\u0014";
+                    return token_type::parse_error;
+                }
+
+                case 0x15:
+                {
+                    error_message = "invalid string: control character U+0015 (NAK) must be escaped to \\u0015";
+                    return token_type::parse_error;
+                }
+
+                case 0x16:
+                {
+                    error_message = "invalid string: control character U+0016 (SYN) must be escaped to \\u0016";
+                    return token_type::parse_error;
+                }
+
+                case 0x17:
+                {
+                    error_message = "invalid string: control character U+0017 (ETB) must be escaped to \\u0017";
+                    return token_type::parse_error;
+                }
+
+                case 0x18:
+                {
+                    error_message = "invalid string: control character U+0018 (CAN) must be escaped to \\u0018";
+                    return token_type::parse_error;
+                }
+
+                case 0x19:
+                {
+                    error_message = "invalid string: control character U+0019 (EM) must be escaped to \\u0019";
+                    return token_type::parse_error;
+                }
+
+                case 0x1A:
+                {
+                    error_message = "invalid string: control character U+001A (SUB) must be escaped to \\u001A";
+                    return token_type::parse_error;
+                }
+
+                case 0x1B:
+                {
+                    error_message = "invalid string: control character U+001B (ESC) must be escaped to \\u001B";
+                    return token_type::parse_error;
+                }
+
+                case 0x1C:
+                {
+                    error_message = "invalid string: control character U+001C (FS) must be escaped to \\u001C";
+                    return token_type::parse_error;
+                }
+
+                case 0x1D:
+                {
+                    error_message = "invalid string: control character U+001D (GS) must be escaped to \\u001D";
+                    return token_type::parse_error;
+                }
+
+                case 0x1E:
+                {
+                    error_message = "invalid string: control character U+001E (RS) must be escaped to \\u001E";
+                    return token_type::parse_error;
+                }
+
+                case 0x1F:
+                {
+                    error_message = "invalid string: control character U+001F (US) must be escaped to \\u001F";
+                    return token_type::parse_error;
+                }
+
+                // U+0020..U+007F (except U+0022 (quote) and U+005C (backspace))
+                case 0x20:
+                case 0x21:
+                case 0x23:
+                case 0x24:
+                case 0x25:
+                case 0x26:
+                case 0x27:
+                case 0x28:
+                case 0x29:
+                case 0x2A:
+                case 0x2B:
+                case 0x2C:
+                case 0x2D:
+                case 0x2E:
+                case 0x2F:
+                case 0x30:
+                case 0x31:
+                case 0x32:
+                case 0x33:
+                case 0x34:
+                case 0x35:
+                case 0x36:
+                case 0x37:
+                case 0x38:
+                case 0x39:
+                case 0x3A:
+                case 0x3B:
+                case 0x3C:
+                case 0x3D:
+                case 0x3E:
+                case 0x3F:
+                case 0x40:
+                case 0x41:
+                case 0x42:
+                case 0x43:
+                case 0x44:
+                case 0x45:
+                case 0x46:
+                case 0x47:
+                case 0x48:
+                case 0x49:
+                case 0x4A:
+                case 0x4B:
+                case 0x4C:
+                case 0x4D:
+                case 0x4E:
+                case 0x4F:
+                case 0x50:
+                case 0x51:
+                case 0x52:
+                case 0x53:
+                case 0x54:
+                case 0x55:
+                case 0x56:
+                case 0x57:
+                case 0x58:
+                case 0x59:
+                case 0x5A:
+                case 0x5B:
+                case 0x5D:
+                case 0x5E:
+                case 0x5F:
+                case 0x60:
+                case 0x61:
+                case 0x62:
+                case 0x63:
+                case 0x64:
+                case 0x65:
+                case 0x66:
+                case 0x67:
+                case 0x68:
+                case 0x69:
+                case 0x6A:
+                case 0x6B:
+                case 0x6C:
+                case 0x6D:
+                case 0x6E:
+                case 0x6F:
+                case 0x70:
+                case 0x71:
+                case 0x72:
+                case 0x73:
+                case 0x74:
+                case 0x75:
+                case 0x76:
+                case 0x77:
+                case 0x78:
+                case 0x79:
+                case 0x7A:
+                case 0x7B:
+                case 0x7C:
+                case 0x7D:
+                case 0x7E:
+                case 0x7F:
+                {
+                    add(current);
+                    break;
+                }
+
+                // U+0080..U+07FF: bytes C2..DF 80..BF
+                case 0xC2:
+                case 0xC3:
+                case 0xC4:
+                case 0xC5:
+                case 0xC6:
+                case 0xC7:
+                case 0xC8:
+                case 0xC9:
+                case 0xCA:
+                case 0xCB:
+                case 0xCC:
+                case 0xCD:
+                case 0xCE:
+                case 0xCF:
+                case 0xD0:
+                case 0xD1:
+                case 0xD2:
+                case 0xD3:
+                case 0xD4:
+                case 0xD5:
+                case 0xD6:
+                case 0xD7:
+                case 0xD8:
+                case 0xD9:
+                case 0xDA:
+                case 0xDB:
+                case 0xDC:
+                case 0xDD:
+                case 0xDE:
+                case 0xDF:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!next_byte_in_range({0x80, 0xBF})))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+0800..U+0FFF: bytes E0 A0..BF 80..BF
+                case 0xE0:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0xA0, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+1000..U+CFFF: bytes E1..EC 80..BF 80..BF
+                // U+E000..U+FFFF: bytes EE..EF 80..BF 80..BF
+                case 0xE1:
+                case 0xE2:
+                case 0xE3:
+                case 0xE4:
+                case 0xE5:
+                case 0xE6:
+                case 0xE7:
+                case 0xE8:
+                case 0xE9:
+                case 0xEA:
+                case 0xEB:
+                case 0xEC:
+                case 0xEE:
+                case 0xEF:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+D000..U+D7FF: bytes ED 80..9F 80..BF
+                case 0xED:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0x9F, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+10000..U+3FFFF F0 90..BF 80..BF 80..BF
+                case 0xF0:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x90, 0xBF, 0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+40000..U+FFFFF F1..F3 80..BF 80..BF 80..BF
+                case 0xF1:
+                case 0xF2:
+                case 0xF3:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0xBF, 0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+100000..U+10FFFF F4 80..8F 80..BF 80..BF
+                case 0xF4:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0x8F, 0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // remaining bytes (80..C1 and F5..FF) are ill-formed
+                default:
+                {
+                    error_message = "invalid string: ill-formed UTF-8 byte";
+                    return token_type::parse_error;
+                }
+            }
+        }
+    }
+
+    /*!
+     * @brief scan a comment
+     * @return whether comment could be scanned successfully
+     */
+    bool scan_comment()
+    {
+        switch (get())
+        {
+            // single-line comments skip input until a newline or EOF is read
+            case '/':
+            {
+                while (true)
+                {
+                    switch (get())
+                    {
+                        case '\n':
+                        case '\r':
+                        case std::char_traits<char_type>::eof():
+                        case '\0':
+                            return true;
+
+                        default:
+                            break;
+                    }
+                }
+            }
+
+            // multi-line comments skip input until */ is read
+            case '*':
+            {
+                while (true)
+                {
+                    switch (get())
+                    {
+                        case std::char_traits<char_type>::eof():
+                        case '\0':
+                        {
+                            error_message = "invalid comment; missing closing '*/'";
+                            return false;
+                        }
+
+                        case '*':
+                        {
+                            switch (get())
+                            {
+                                case '/':
+                                    return true;
+
+                                default:
+                                {
+                                    unget();
+                                    continue;
+                                }
+                            }
+                        }
+
+                        default:
+                            continue;
+                    }
+                }
+            }
+
+            // unexpected character after reading '/'
+            default:
+            {
+                error_message = "invalid comment; expecting '/' or '*' after '/'";
+                return false;
+            }
+        }
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    static void strtof(float& f, const char* str, char** endptr) noexcept
+    {
+        f = std::strtof(str, endptr);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    static void strtof(double& f, const char* str, char** endptr) noexcept
+    {
+        f = std::strtod(str, endptr);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    static void strtof(long double& f, const char* str, char** endptr) noexcept
+    {
+        f = std::strtold(str, endptr);
+    }
+
+    /*!
+    @brief scan a number literal
+
+    This function scans a string according to Sect. 6 of RFC 8259.
+
+    The function is realized with a deterministic finite state machine derived
+    from the grammar described in RFC 8259. Starting in state "init", the
+    input is read and used to determined the next state. Only state "done"
+    accepts the number. State "error" is a trap state to model errors. In the
+    table below, "anything" means any character but the ones listed before.
+
+    state    | 0        | 1-9      | e E      | +       | -       | .        | anything
+    ---------|----------|----------|----------|---------|---------|----------|-----------
+    init     | zero     | any1     | [error]  | [error] | minus   | [error]  | [error]
+    minus    | zero     | any1     | [error]  | [error] | [error] | [error]  | [error]
+    zero     | done     | done     | exponent | done    | done    | decimal1 | done
+    any1     | any1     | any1     | exponent | done    | done    | decimal1 | done
+    decimal1 | decimal2 | decimal2 | [error]  | [error] | [error] | [error]  | [error]
+    decimal2 | decimal2 | decimal2 | exponent | done    | done    | done     | done
+    exponent | any2     | any2     | [error]  | sign    | sign    | [error]  | [error]
+    sign     | any2     | any2     | [error]  | [error] | [error] | [error]  | [error]
+    any2     | any2     | any2     | done     | done    | done    | done     | done
+
+    The state machine is realized with one label per state (prefixed with
+    "scan_number_") and `goto` statements between them. The state machine
+    contains cycles, but any cycle can be left when EOF is read. Therefore,
+    the function is guaranteed to terminate.
+
+    During scanning, the read bytes are stored in token_buffer. This string is
+    then converted to a signed integer, an unsigned integer, or a
+    floating-point number.
+
+    @return token_type::value_unsigned, token_type::value_integer, or
+            token_type::value_float if number could be successfully scanned,
+            token_type::parse_error otherwise
+
+    @note The scanner is independent of the current locale. Internally, the
+          locale's decimal point is used instead of `.` to work with the
+          locale-dependent converters.
+    */
+    token_type scan_number()  // lgtm [cpp/use-of-goto]
+    {
+        // reset token_buffer to store the number's bytes
+        reset();
+
+        // the type of the parsed number; initially set to unsigned; will be
+        // changed if minus sign, decimal point or exponent is read
+        token_type number_type = token_type::value_unsigned;
+
+        // state (init): we just found out we need to scan a number
+        switch (current)
+        {
+            case '-':
+            {
+                add(current);
+                goto scan_number_minus;
+            }
+
+            case '0':
+            {
+                add(current);
+                goto scan_number_zero;
+            }
+
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any1;
+            }
+
+            // all other characters are rejected outside scan_number()
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+
+scan_number_minus:
+        // state: we just parsed a leading minus sign
+        number_type = token_type::value_integer;
+        switch (get())
+        {
+            case '0':
+            {
+                add(current);
+                goto scan_number_zero;
+            }
+
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any1;
+            }
+
+            default:
+            {
+                error_message = "invalid number; expected digit after '-'";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_zero:
+        // state: we just parse a zero (maybe with a leading minus sign)
+        switch (get())
+        {
+            case '.':
+            {
+                add(decimal_point_char);
+                goto scan_number_decimal1;
+            }
+
+            case 'e':
+            case 'E':
+            {
+                add(current);
+                goto scan_number_exponent;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_any1:
+        // state: we just parsed a number 0-9 (maybe with a leading minus sign)
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any1;
+            }
+
+            case '.':
+            {
+                add(decimal_point_char);
+                goto scan_number_decimal1;
+            }
+
+            case 'e':
+            case 'E':
+            {
+                add(current);
+                goto scan_number_exponent;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_decimal1:
+        // state: we just parsed a decimal point
+        number_type = token_type::value_float;
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_decimal2;
+            }
+
+            default:
+            {
+                error_message = "invalid number; expected digit after '.'";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_decimal2:
+        // we just parsed at least one number after a decimal point
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_decimal2;
+            }
+
+            case 'e':
+            case 'E':
+            {
+                add(current);
+                goto scan_number_exponent;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_exponent:
+        // we just parsed an exponent
+        number_type = token_type::value_float;
+        switch (get())
+        {
+            case '+':
+            case '-':
+            {
+                add(current);
+                goto scan_number_sign;
+            }
+
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any2;
+            }
+
+            default:
+            {
+                error_message =
+                    "invalid number; expected '+', '-', or digit after exponent";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_sign:
+        // we just parsed an exponent sign
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any2;
+            }
+
+            default:
+            {
+                error_message = "invalid number; expected digit after exponent sign";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_any2:
+        // we just parsed a number after the exponent or exponent sign
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any2;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_done:
+        // unget the character after the number (we only read it to know that
+        // we are done scanning a number)
+        unget();
+
+        char* endptr = nullptr; // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+        errno = 0;
+
+        // try to parse integers first and fall back to floats
+        if (number_type == token_type::value_unsigned)
+        {
+            const auto x = std::strtoull(token_buffer.data(), &endptr, 10);
+
+            // we checked the number format before
+            JSON_ASSERT(endptr == token_buffer.data() + token_buffer.size());
+
+            if (errno == 0)
+            {
+                value_unsigned = static_cast<number_unsigned_t>(x);
+                if (value_unsigned == x)
+                {
+                    return token_type::value_unsigned;
+                }
+            }
+        }
+        else if (number_type == token_type::value_integer)
+        {
+            const auto x = std::strtoll(token_buffer.data(), &endptr, 10);
+
+            // we checked the number format before
+            JSON_ASSERT(endptr == token_buffer.data() + token_buffer.size());
+
+            if (errno == 0)
+            {
+                value_integer = static_cast<number_integer_t>(x);
+                if (value_integer == x)
+                {
+                    return token_type::value_integer;
+                }
+            }
+        }
+
+        // this code is reached if we parse a floating-point number or if an
+        // integer conversion above failed
+        strtof(value_float, token_buffer.data(), &endptr);
+
+        // we checked the number format before
+        JSON_ASSERT(endptr == token_buffer.data() + token_buffer.size());
+
+        return token_type::value_float;
+    }
+
+    /*!
+    @param[in] literal_text  the literal text to expect
+    @param[in] length        the length of the passed literal text
+    @param[in] return_type   the token type to return on success
+    */
+    JSON_HEDLEY_NON_NULL(2)
+    token_type scan_literal(const char_type* literal_text, const std::size_t length,
+                            token_type return_type)
+    {
+        JSON_ASSERT(std::char_traits<char_type>::to_char_type(current) == literal_text[0]);
+        for (std::size_t i = 1; i < length; ++i)
+        {
+            if (JSON_HEDLEY_UNLIKELY(std::char_traits<char_type>::to_char_type(get()) != literal_text[i]))
+            {
+                error_message = "invalid literal";
+                return token_type::parse_error;
+            }
+        }
+        return return_type;
+    }
+
+    /////////////////////
+    // input management
+    /////////////////////
+
+    /// reset token_buffer; current character is beginning of token
+    void reset() noexcept
+    {
+        token_buffer.clear();
+        token_string.clear();
+        token_string.push_back(std::char_traits<char_type>::to_char_type(current));
+    }
+
+    /*
+    @brief get next character from the input
+
+    This function provides the interface to the used input adapter. It does
+    not throw in case the input reached EOF, but returns a
+    `std::char_traits<char>::eof()` in that case.  Stores the scanned characters
+    for use in error messages.
+
+    @return character read from the input
+    */
+    char_int_type get()
+    {
+        ++position.chars_read_total;
+        ++position.chars_read_current_line;
+
+        if (next_unget)
+        {
+            // just reset the next_unget variable and work with current
+            next_unget = false;
+        }
+        else
+        {
+            current = ia.get_character();
+        }
+
+        if (JSON_HEDLEY_LIKELY(current != std::char_traits<char_type>::eof()))
+        {
+            token_string.push_back(std::char_traits<char_type>::to_char_type(current));
+        }
+
+        if (current == '\n')
+        {
+            ++position.lines_read;
+            position.chars_read_current_line = 0;
+        }
+
+        return current;
+    }
+
+    /*!
+    @brief unget current character (read it again on next get)
+
+    We implement unget by setting variable next_unget to true. The input is not
+    changed - we just simulate ungetting by modifying chars_read_total,
+    chars_read_current_line, and token_string. The next call to get() will
+    behave as if the unget character is read again.
+    */
+    void unget()
+    {
+        next_unget = true;
+
+        --position.chars_read_total;
+
+        // in case we "unget" a newline, we have to also decrement the numLinesRead
+        if (position.chars_read_current_line == 0)
+        {
+            if (position.lines_read > 0)
+            {
+                --position.lines_read;
+            }
+        }
+        else
+        {
+            --position.chars_read_current_line;
+        }
+
+        if (JSON_HEDLEY_LIKELY(current != std::char_traits<char_type>::eof()))
+        {
+            JSON_ASSERT(!token_string.empty());
+            token_string.pop_back();
+        }
+    }
+
+    /// add a character to token_buffer
+    void add(char_int_type c)
+    {
+        token_buffer.push_back(static_cast<typename string_t::value_type>(c));
+    }
+
+  public:
+    /////////////////////
+    // value getters
+    /////////////////////
+
+    /// return integer value
+    constexpr number_integer_t get_number_integer() const noexcept
+    {
+        return value_integer;
+    }
+
+    /// return unsigned integer value
+    constexpr number_unsigned_t get_number_unsigned() const noexcept
+    {
+        return value_unsigned;
+    }
+
+    /// return floating-point value
+    constexpr number_float_t get_number_float() const noexcept
+    {
+        return value_float;
+    }
+
+    /// return current string value (implicitly resets the token; useful only once)
+    string_t& get_string()
+    {
+        return token_buffer;
+    }
+
+    /////////////////////
+    // diagnostics
+    /////////////////////
+
+    /// return position of last read token
+    constexpr position_t get_position() const noexcept
+    {
+        return position;
+    }
+
+    /// return the last read token (for errors only).  Will never contain EOF
+    /// (an arbitrary value that is not a valid char value, often -1), because
+    /// 255 may legitimately occur.  May contain NUL, which should be escaped.
+    std::string get_token_string() const
+    {
+        // escape control characters
+        std::string result;
+        for (const auto c : token_string)
+        {
+            if (static_cast<unsigned char>(c) <= '\x1F')
+            {
+                // escape control characters
+                std::array<char, 9> cs{{}};
+                static_cast<void>((std::snprintf)(cs.data(), cs.size(), "<U+%.4X>", static_cast<unsigned char>(c))); // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+                result += cs.data();
+            }
+            else
+            {
+                // add character as is
+                result.push_back(static_cast<std::string::value_type>(c));
+            }
+        }
+
+        return result;
+    }
+
+    /// return syntax error message
+    JSON_HEDLEY_RETURNS_NON_NULL
+    constexpr const char* get_error_message() const noexcept
+    {
+        return error_message;
+    }
+
+    /////////////////////
+    // actual scanner
+    /////////////////////
+
+    /*!
+    @brief skip the UTF-8 byte order mark
+    @return true iff there is no BOM or the correct BOM has been skipped
+    */
+    bool skip_bom()
+    {
+        if (get() == 0xEF)
+        {
+            // check if we completely parse the BOM
+            return get() == 0xBB && get() == 0xBF;
+        }
+
+        // the first character is not the beginning of the BOM; unget it to
+        // process is later
+        unget();
+        return true;
+    }
+
+    void skip_whitespace()
+    {
+        do
+        {
+            get();
+        }
+        while (current == ' ' || current == '\t' || current == '\n' || current == '\r');
+    }
+
+    token_type scan()
+    {
+        // initially, skip the BOM
+        if (position.chars_read_total == 0 && !skip_bom())
+        {
+            error_message = "invalid BOM; must be 0xEF 0xBB 0xBF if given";
+            return token_type::parse_error;
+        }
+
+        // read next character and ignore whitespace
+        skip_whitespace();
+
+        // ignore comments
+        while (ignore_comments && current == '/')
+        {
+            if (!scan_comment())
+            {
+                return token_type::parse_error;
+            }
+
+            // skip following whitespace
+            skip_whitespace();
+        }
+
+        switch (current)
+        {
+            // structural characters
+            case '[':
+                return token_type::begin_array;
+            case ']':
+                return token_type::end_array;
+            case '{':
+                return token_type::begin_object;
+            case '}':
+                return token_type::end_object;
+            case ':':
+                return token_type::name_separator;
+            case ',':
+                return token_type::value_separator;
+
+            // literals
+            case 't':
+            {
+                std::array<char_type, 4> true_literal = {{static_cast<char_type>('t'), static_cast<char_type>('r'), static_cast<char_type>('u'), static_cast<char_type>('e')}};
+                return scan_literal(true_literal.data(), true_literal.size(), token_type::literal_true);
+            }
+            case 'f':
+            {
+                std::array<char_type, 5> false_literal = {{static_cast<char_type>('f'), static_cast<char_type>('a'), static_cast<char_type>('l'), static_cast<char_type>('s'), static_cast<char_type>('e')}};
+                return scan_literal(false_literal.data(), false_literal.size(), token_type::literal_false);
+            }
+            case 'n':
+            {
+                std::array<char_type, 4> null_literal = {{static_cast<char_type>('n'), static_cast<char_type>('u'), static_cast<char_type>('l'), static_cast<char_type>('l')}};
+                return scan_literal(null_literal.data(), null_literal.size(), token_type::literal_null);
+            }
+
+            // string
+            case '\"':
+                return scan_string();
+
+            // number
+            case '-':
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+                return scan_number();
+
+            // end of input (the null byte is needed when parsing from
+            // string literals)
+            case '\0':
+            case std::char_traits<char_type>::eof():
+                return token_type::end_of_input;
+
+            // error
+            default:
+                error_message = "invalid literal";
+                return token_type::parse_error;
+        }
+    }
+
+  private:
+    /// input adapter
+    InputAdapterType ia;
+
+    /// whether comments should be ignored (true) or signaled as errors (false)
+    const bool ignore_comments = false;
+
+    /// the current character
+    char_int_type current = std::char_traits<char_type>::eof();
+
+    /// whether the next get() call should just return current
+    bool next_unget = false;
+
+    /// the start position of the current token
+    position_t position {};
+
+    /// raw input token string (for error messages)
+    std::vector<char_type> token_string {};
+
+    /// buffer for variable-length tokens (numbers, strings)
+    string_t token_buffer {};
+
+    /// a description of occurred lexer errors
+    const char* error_message = "";
+
+    // number values
+    number_integer_t value_integer = 0;
+    number_unsigned_t value_unsigned = 0;
+    number_float_t value_float = 0;
+
+    /// the decimal point
+    const char_int_type decimal_point_char = '.';
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/is_sax.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstdint> // size_t
+#include <utility> // declval
+#include <string> // string
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/meta/detected.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename T>
+using null_function_t = decltype(std::declval<T&>().null());
+
+template<typename T>
+using boolean_function_t =
+    decltype(std::declval<T&>().boolean(std::declval<bool>()));
+
+template<typename T, typename Integer>
+using number_integer_function_t =
+    decltype(std::declval<T&>().number_integer(std::declval<Integer>()));
+
+template<typename T, typename Unsigned>
+using number_unsigned_function_t =
+    decltype(std::declval<T&>().number_unsigned(std::declval<Unsigned>()));
+
+template<typename T, typename Float, typename String>
+using number_float_function_t = decltype(std::declval<T&>().number_float(
+                                    std::declval<Float>(), std::declval<const String&>()));
+
+template<typename T, typename String>
+using string_function_t =
+    decltype(std::declval<T&>().string(std::declval<String&>()));
+
+template<typename T, typename Binary>
+using binary_function_t =
+    decltype(std::declval<T&>().binary(std::declval<Binary&>()));
+
+template<typename T>
+using start_object_function_t =
+    decltype(std::declval<T&>().start_object(std::declval<std::size_t>()));
+
+template<typename T, typename String>
+using key_function_t =
+    decltype(std::declval<T&>().key(std::declval<String&>()));
+
+template<typename T>
+using end_object_function_t = decltype(std::declval<T&>().end_object());
+
+template<typename T>
+using start_array_function_t =
+    decltype(std::declval<T&>().start_array(std::declval<std::size_t>()));
+
+template<typename T>
+using end_array_function_t = decltype(std::declval<T&>().end_array());
+
+template<typename T, typename Exception>
+using parse_error_function_t = decltype(std::declval<T&>().parse_error(
+        std::declval<std::size_t>(), std::declval<const std::string&>(),
+        std::declval<const Exception&>()));
+
+template<typename SAX, typename BasicJsonType>
+struct is_sax
+{
+  private:
+    static_assert(is_basic_json<BasicJsonType>::value,
+                  "BasicJsonType must be of type basic_json<...>");
+
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using exception_t = typename BasicJsonType::exception;
+
+  public:
+    static constexpr bool value =
+        is_detected_exact<bool, null_function_t, SAX>::value &&
+        is_detected_exact<bool, boolean_function_t, SAX>::value &&
+        is_detected_exact<bool, number_integer_function_t, SAX, number_integer_t>::value &&
+        is_detected_exact<bool, number_unsigned_function_t, SAX, number_unsigned_t>::value &&
+        is_detected_exact<bool, number_float_function_t, SAX, number_float_t, string_t>::value &&
+        is_detected_exact<bool, string_function_t, SAX, string_t>::value &&
+        is_detected_exact<bool, binary_function_t, SAX, binary_t>::value &&
+        is_detected_exact<bool, start_object_function_t, SAX>::value &&
+        is_detected_exact<bool, key_function_t, SAX, string_t>::value &&
+        is_detected_exact<bool, end_object_function_t, SAX>::value &&
+        is_detected_exact<bool, start_array_function_t, SAX>::value &&
+        is_detected_exact<bool, end_array_function_t, SAX>::value &&
+        is_detected_exact<bool, parse_error_function_t, SAX, exception_t>::value;
+};
+
+template<typename SAX, typename BasicJsonType>
+struct is_sax_static_asserts
+{
+  private:
+    static_assert(is_basic_json<BasicJsonType>::value,
+                  "BasicJsonType must be of type basic_json<...>");
+
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using exception_t = typename BasicJsonType::exception;
+
+  public:
+    static_assert(is_detected_exact<bool, null_function_t, SAX>::value,
+                  "Missing/invalid function: bool null()");
+    static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,
+                  "Missing/invalid function: bool boolean(bool)");
+    static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,
+                  "Missing/invalid function: bool boolean(bool)");
+    static_assert(
+        is_detected_exact<bool, number_integer_function_t, SAX,
+        number_integer_t>::value,
+        "Missing/invalid function: bool number_integer(number_integer_t)");
+    static_assert(
+        is_detected_exact<bool, number_unsigned_function_t, SAX,
+        number_unsigned_t>::value,
+        "Missing/invalid function: bool number_unsigned(number_unsigned_t)");
+    static_assert(is_detected_exact<bool, number_float_function_t, SAX,
+                  number_float_t, string_t>::value,
+                  "Missing/invalid function: bool number_float(number_float_t, const string_t&)");
+    static_assert(
+        is_detected_exact<bool, string_function_t, SAX, string_t>::value,
+        "Missing/invalid function: bool string(string_t&)");
+    static_assert(
+        is_detected_exact<bool, binary_function_t, SAX, binary_t>::value,
+        "Missing/invalid function: bool binary(binary_t&)");
+    static_assert(is_detected_exact<bool, start_object_function_t, SAX>::value,
+                  "Missing/invalid function: bool start_object(std::size_t)");
+    static_assert(is_detected_exact<bool, key_function_t, SAX, string_t>::value,
+                  "Missing/invalid function: bool key(string_t&)");
+    static_assert(is_detected_exact<bool, end_object_function_t, SAX>::value,
+                  "Missing/invalid function: bool end_object()");
+    static_assert(is_detected_exact<bool, start_array_function_t, SAX>::value,
+                  "Missing/invalid function: bool start_array(std::size_t)");
+    static_assert(is_detected_exact<bool, end_array_function_t, SAX>::value,
+                  "Missing/invalid function: bool end_array()");
+    static_assert(
+        is_detected_exact<bool, parse_error_function_t, SAX, exception_t>::value,
+        "Missing/invalid function: bool parse_error(std::size_t, const "
+        "std::string&, const exception&)");
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/// how to treat CBOR tags
+enum class cbor_tag_handler_t
+{
+    error,   ///< throw a parse_error exception in case of a tag
+    ignore,  ///< ignore tags
+    store    ///< store tags as binary type
+};
+
+/*!
+@brief determine system byte order
+
+@return true if and only if system's byte order is little endian
+
+@note from https://stackoverflow.com/a/1001328/266378
+*/
+static inline bool little_endianness(int num = 1) noexcept
+{
+    return *reinterpret_cast<char*>(&num) == 1;
+}
+
+
+///////////////////
+// binary reader //
+///////////////////
+
+/*!
+@brief deserialization of CBOR, MessagePack, and UBJSON values
+*/
+template<typename BasicJsonType, typename InputAdapterType, typename SAX = json_sax_dom_parser<BasicJsonType>>
+class binary_reader
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using json_sax_t = SAX;
+    using char_type = typename InputAdapterType::char_type;
+    using char_int_type = typename std::char_traits<char_type>::int_type;
+
+  public:
+    /*!
+    @brief create a binary reader
+
+    @param[in] adapter  input adapter to read from
+    */
+    explicit binary_reader(InputAdapterType&& adapter, const input_format_t format = input_format_t::json) noexcept : ia(std::move(adapter)), input_format(format)
+    {
+        (void)detail::is_sax_static_asserts<SAX, BasicJsonType> {};
+    }
+
+    // make class move-only
+    binary_reader(const binary_reader&) = delete;
+    binary_reader(binary_reader&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    binary_reader& operator=(const binary_reader&) = delete;
+    binary_reader& operator=(binary_reader&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    ~binary_reader() = default;
+
+    /*!
+    @param[in] format  the binary format to parse
+    @param[in] sax_    a SAX event processor
+    @param[in] strict  whether to expect the input to be consumed completed
+    @param[in] tag_handler  how to treat CBOR tags
+
+    @return whether parsing was successful
+    */
+    JSON_HEDLEY_NON_NULL(3)
+    bool sax_parse(const input_format_t format,
+                   json_sax_t* sax_,
+                   const bool strict = true,
+                   const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        sax = sax_;
+        bool result = false;
+
+        switch (format)
+        {
+            case input_format_t::bson:
+                result = parse_bson_internal();
+                break;
+
+            case input_format_t::cbor:
+                result = parse_cbor_internal(true, tag_handler);
+                break;
+
+            case input_format_t::msgpack:
+                result = parse_msgpack_internal();
+                break;
+
+            case input_format_t::ubjson:
+            case input_format_t::bjdata:
+                result = parse_ubjson_internal();
+                break;
+
+            case input_format_t::json: // LCOV_EXCL_LINE
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+
+        // strict mode: next byte must be EOF
+        if (result && strict)
+        {
+            if (input_format == input_format_t::ubjson || input_format == input_format_t::bjdata)
+            {
+                get_ignore_noop();
+            }
+            else
+            {
+                get();
+            }
+
+            if (JSON_HEDLEY_UNLIKELY(current != std::char_traits<char_type>::eof()))
+            {
+                return sax->parse_error(chars_read, get_token_string(), parse_error::create(110, chars_read,
+                                        exception_message(input_format, concat("expected end of input; last byte: 0x", get_token_string()), "value"), nullptr));
+            }
+        }
+
+        return result;
+    }
+
+  private:
+    //////////
+    // BSON //
+    //////////
+
+    /*!
+    @brief Reads in a BSON-object and passes it to the SAX-parser.
+    @return whether a valid BSON-value was passed to the SAX parser
+    */
+    bool parse_bson_internal()
+    {
+        std::int32_t document_size{};
+        get_number<std::int32_t, true>(input_format_t::bson, document_size);
+
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_object(static_cast<std::size_t>(-1))))
+        {
+            return false;
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(!parse_bson_element_list(/*is_array*/false)))
+        {
+            return false;
+        }
+
+        return sax->end_object();
+    }
+
+    /*!
+    @brief Parses a C-style string from the BSON input.
+    @param[in,out] result  A reference to the string variable where the read
+                            string is to be stored.
+    @return `true` if the \x00-byte indicating the end of the string was
+             encountered before the EOF; false` indicates an unexpected EOF.
+    */
+    bool get_bson_cstr(string_t& result)
+    {
+        auto out = std::back_inserter(result);
+        while (true)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::bson, "cstring")))
+            {
+                return false;
+            }
+            if (current == 0x00)
+            {
+                return true;
+            }
+            *out++ = static_cast<typename string_t::value_type>(current);
+        }
+    }
+
+    /*!
+    @brief Parses a zero-terminated string of length @a len from the BSON
+           input.
+    @param[in] len  The length (including the zero-byte at the end) of the
+                    string to be read.
+    @param[in,out] result  A reference to the string variable where the read
+                            string is to be stored.
+    @tparam NumberType The type of the length @a len
+    @pre len >= 1
+    @return `true` if the string was successfully parsed
+    */
+    template<typename NumberType>
+    bool get_bson_string(const NumberType len, string_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(len < 1))
+        {
+            auto last_token = get_token_string();
+            return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                    exception_message(input_format_t::bson, concat("string length must be at least 1, is ", std::to_string(len)), "string"), nullptr));
+        }
+
+        return get_string(input_format_t::bson, len - static_cast<NumberType>(1), result) && get() != std::char_traits<char_type>::eof();
+    }
+
+    /*!
+    @brief Parses a byte array input of length @a len from the BSON input.
+    @param[in] len  The length of the byte array to be read.
+    @param[in,out] result  A reference to the binary variable where the read
+                            array is to be stored.
+    @tparam NumberType The type of the length @a len
+    @pre len >= 0
+    @return `true` if the byte array was successfully parsed
+    */
+    template<typename NumberType>
+    bool get_bson_binary(const NumberType len, binary_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(len < 0))
+        {
+            auto last_token = get_token_string();
+            return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                    exception_message(input_format_t::bson, concat("byte array length cannot be negative, is ", std::to_string(len)), "binary"), nullptr));
+        }
+
+        // All BSON binary values have a subtype
+        std::uint8_t subtype{};
+        get_number<std::uint8_t>(input_format_t::bson, subtype);
+        result.set_subtype(subtype);
+
+        return get_binary(input_format_t::bson, len, result);
+    }
+
+    /*!
+    @brief Read a BSON document element of the given @a element_type.
+    @param[in] element_type The BSON element type, c.f. http://bsonspec.org/spec.html
+    @param[in] element_type_parse_position The position in the input stream,
+               where the `element_type` was read.
+    @warning Not all BSON element types are supported yet. An unsupported
+             @a element_type will give rise to a parse_error.114:
+             Unsupported BSON record type 0x...
+    @return whether a valid BSON-object/array was passed to the SAX parser
+    */
+    bool parse_bson_element_internal(const char_int_type element_type,
+                                     const std::size_t element_type_parse_position)
+    {
+        switch (element_type)
+        {
+            case 0x01: // double
+            {
+                double number{};
+                return get_number<double, true>(input_format_t::bson, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0x02: // string
+            {
+                std::int32_t len{};
+                string_t value;
+                return get_number<std::int32_t, true>(input_format_t::bson, len) && get_bson_string(len, value) && sax->string(value);
+            }
+
+            case 0x03: // object
+            {
+                return parse_bson_internal();
+            }
+
+            case 0x04: // array
+            {
+                return parse_bson_array();
+            }
+
+            case 0x05: // binary
+            {
+                std::int32_t len{};
+                binary_t value;
+                return get_number<std::int32_t, true>(input_format_t::bson, len) && get_bson_binary(len, value) && sax->binary(value);
+            }
+
+            case 0x08: // boolean
+            {
+                return sax->boolean(get() != 0);
+            }
+
+            case 0x0A: // null
+            {
+                return sax->null();
+            }
+
+            case 0x10: // int32
+            {
+                std::int32_t value{};
+                return get_number<std::int32_t, true>(input_format_t::bson, value) && sax->number_integer(value);
+            }
+
+            case 0x12: // int64
+            {
+                std::int64_t value{};
+                return get_number<std::int64_t, true>(input_format_t::bson, value) && sax->number_integer(value);
+            }
+
+            default: // anything else not supported (yet)
+            {
+                std::array<char, 3> cr{{}};
+                static_cast<void>((std::snprintf)(cr.data(), cr.size(), "%.2hhX", static_cast<unsigned char>(element_type))); // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+                std::string cr_str{cr.data()};
+                return sax->parse_error(element_type_parse_position, cr_str,
+                                        parse_error::create(114, element_type_parse_position, concat("Unsupported BSON record type 0x", cr_str), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief Read a BSON element list (as specified in the BSON-spec)
+
+    The same binary layout is used for objects and arrays, hence it must be
+    indicated with the argument @a is_array which one is expected
+    (true --> array, false --> object).
+
+    @param[in] is_array Determines if the element list being read is to be
+                        treated as an object (@a is_array == false), or as an
+                        array (@a is_array == true).
+    @return whether a valid BSON-object/array was passed to the SAX parser
+    */
+    bool parse_bson_element_list(const bool is_array)
+    {
+        string_t key;
+
+        while (auto element_type = get())
+        {
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::bson, "element list")))
+            {
+                return false;
+            }
+
+            const std::size_t element_type_parse_position = chars_read;
+            if (JSON_HEDLEY_UNLIKELY(!get_bson_cstr(key)))
+            {
+                return false;
+            }
+
+            if (!is_array && !sax->key(key))
+            {
+                return false;
+            }
+
+            if (JSON_HEDLEY_UNLIKELY(!parse_bson_element_internal(element_type, element_type_parse_position)))
+            {
+                return false;
+            }
+
+            // get_bson_cstr only appends
+            key.clear();
+        }
+
+        return true;
+    }
+
+    /*!
+    @brief Reads an array from the BSON input and passes it to the SAX-parser.
+    @return whether a valid BSON-array was passed to the SAX parser
+    */
+    bool parse_bson_array()
+    {
+        std::int32_t document_size{};
+        get_number<std::int32_t, true>(input_format_t::bson, document_size);
+
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_array(static_cast<std::size_t>(-1))))
+        {
+            return false;
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(!parse_bson_element_list(/*is_array*/true)))
+        {
+            return false;
+        }
+
+        return sax->end_array();
+    }
+
+    //////////
+    // CBOR //
+    //////////
+
+    /*!
+    @param[in] get_char  whether a new character should be retrieved from the
+                         input (true) or whether the last read character should
+                         be considered instead (false)
+    @param[in] tag_handler how CBOR tags should be treated
+
+    @return whether a valid CBOR value was passed to the SAX parser
+    */
+    bool parse_cbor_internal(const bool get_char,
+                             const cbor_tag_handler_t tag_handler)
+    {
+        switch (get_char ? get() : current)
+        {
+            // EOF
+            case std::char_traits<char_type>::eof():
+                return unexpect_eof(input_format_t::cbor, "value");
+
+            // Integer 0x00..0x17 (0..23)
+            case 0x00:
+            case 0x01:
+            case 0x02:
+            case 0x03:
+            case 0x04:
+            case 0x05:
+            case 0x06:
+            case 0x07:
+            case 0x08:
+            case 0x09:
+            case 0x0A:
+            case 0x0B:
+            case 0x0C:
+            case 0x0D:
+            case 0x0E:
+            case 0x0F:
+            case 0x10:
+            case 0x11:
+            case 0x12:
+            case 0x13:
+            case 0x14:
+            case 0x15:
+            case 0x16:
+            case 0x17:
+                return sax->number_unsigned(static_cast<number_unsigned_t>(current));
+
+            case 0x18: // Unsigned integer (one-byte uint8_t follows)
+            {
+                std::uint8_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_unsigned(number);
+            }
+
+            case 0x19: // Unsigned integer (two-byte uint16_t follows)
+            {
+                std::uint16_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_unsigned(number);
+            }
+
+            case 0x1A: // Unsigned integer (four-byte uint32_t follows)
+            {
+                std::uint32_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_unsigned(number);
+            }
+
+            case 0x1B: // Unsigned integer (eight-byte uint64_t follows)
+            {
+                std::uint64_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_unsigned(number);
+            }
+
+            // Negative integer -1-0x00..-1-0x17 (-1..-24)
+            case 0x20:
+            case 0x21:
+            case 0x22:
+            case 0x23:
+            case 0x24:
+            case 0x25:
+            case 0x26:
+            case 0x27:
+            case 0x28:
+            case 0x29:
+            case 0x2A:
+            case 0x2B:
+            case 0x2C:
+            case 0x2D:
+            case 0x2E:
+            case 0x2F:
+            case 0x30:
+            case 0x31:
+            case 0x32:
+            case 0x33:
+            case 0x34:
+            case 0x35:
+            case 0x36:
+            case 0x37:
+                return sax->number_integer(static_cast<std::int8_t>(0x20 - 1 - current));
+
+            case 0x38: // Negative integer (one-byte uint8_t follows)
+            {
+                std::uint8_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast<number_integer_t>(-1) - number);
+            }
+
+            case 0x39: // Negative integer -1-n (two-byte uint16_t follows)
+            {
+                std::uint16_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast<number_integer_t>(-1) - number);
+            }
+
+            case 0x3A: // Negative integer -1-n (four-byte uint32_t follows)
+            {
+                std::uint32_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast<number_integer_t>(-1) - number);
+            }
+
+            case 0x3B: // Negative integer -1-n (eight-byte uint64_t follows)
+            {
+                std::uint64_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast<number_integer_t>(-1)
+                        - static_cast<number_integer_t>(number));
+            }
+
+            // Binary data (0x00..0x17 bytes follow)
+            case 0x40:
+            case 0x41:
+            case 0x42:
+            case 0x43:
+            case 0x44:
+            case 0x45:
+            case 0x46:
+            case 0x47:
+            case 0x48:
+            case 0x49:
+            case 0x4A:
+            case 0x4B:
+            case 0x4C:
+            case 0x4D:
+            case 0x4E:
+            case 0x4F:
+            case 0x50:
+            case 0x51:
+            case 0x52:
+            case 0x53:
+            case 0x54:
+            case 0x55:
+            case 0x56:
+            case 0x57:
+            case 0x58: // Binary data (one-byte uint8_t for n follows)
+            case 0x59: // Binary data (two-byte uint16_t for n follow)
+            case 0x5A: // Binary data (four-byte uint32_t for n follow)
+            case 0x5B: // Binary data (eight-byte uint64_t for n follow)
+            case 0x5F: // Binary data (indefinite length)
+            {
+                binary_t b;
+                return get_cbor_binary(b) && sax->binary(b);
+            }
+
+            // UTF-8 string (0x00..0x17 bytes follow)
+            case 0x60:
+            case 0x61:
+            case 0x62:
+            case 0x63:
+            case 0x64:
+            case 0x65:
+            case 0x66:
+            case 0x67:
+            case 0x68:
+            case 0x69:
+            case 0x6A:
+            case 0x6B:
+            case 0x6C:
+            case 0x6D:
+            case 0x6E:
+            case 0x6F:
+            case 0x70:
+            case 0x71:
+            case 0x72:
+            case 0x73:
+            case 0x74:
+            case 0x75:
+            case 0x76:
+            case 0x77:
+            case 0x78: // UTF-8 string (one-byte uint8_t for n follows)
+            case 0x79: // UTF-8 string (two-byte uint16_t for n follow)
+            case 0x7A: // UTF-8 string (four-byte uint32_t for n follow)
+            case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow)
+            case 0x7F: // UTF-8 string (indefinite length)
+            {
+                string_t s;
+                return get_cbor_string(s) && sax->string(s);
+            }
+
+            // array (0x00..0x17 data items follow)
+            case 0x80:
+            case 0x81:
+            case 0x82:
+            case 0x83:
+            case 0x84:
+            case 0x85:
+            case 0x86:
+            case 0x87:
+            case 0x88:
+            case 0x89:
+            case 0x8A:
+            case 0x8B:
+            case 0x8C:
+            case 0x8D:
+            case 0x8E:
+            case 0x8F:
+            case 0x90:
+            case 0x91:
+            case 0x92:
+            case 0x93:
+            case 0x94:
+            case 0x95:
+            case 0x96:
+            case 0x97:
+                return get_cbor_array(
+                           conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu), tag_handler);
+
+            case 0x98: // array (one-byte uint8_t for n follows)
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0x99: // array (two-byte uint16_t for n follow)
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0x9A: // array (four-byte uint32_t for n follow)
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_array(conditional_static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0x9B: // array (eight-byte uint64_t for n follow)
+            {
+                std::uint64_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_array(conditional_static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0x9F: // array (indefinite length)
+                return get_cbor_array(static_cast<std::size_t>(-1), tag_handler);
+
+            // map (0x00..0x17 pairs of data items follow)
+            case 0xA0:
+            case 0xA1:
+            case 0xA2:
+            case 0xA3:
+            case 0xA4:
+            case 0xA5:
+            case 0xA6:
+            case 0xA7:
+            case 0xA8:
+            case 0xA9:
+            case 0xAA:
+            case 0xAB:
+            case 0xAC:
+            case 0xAD:
+            case 0xAE:
+            case 0xAF:
+            case 0xB0:
+            case 0xB1:
+            case 0xB2:
+            case 0xB3:
+            case 0xB4:
+            case 0xB5:
+            case 0xB6:
+            case 0xB7:
+                return get_cbor_object(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu), tag_handler);
+
+            case 0xB8: // map (one-byte uint8_t for n follows)
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0xB9: // map (two-byte uint16_t for n follow)
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0xBA: // map (four-byte uint32_t for n follow)
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_object(conditional_static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0xBB: // map (eight-byte uint64_t for n follow)
+            {
+                std::uint64_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_object(conditional_static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0xBF: // map (indefinite length)
+                return get_cbor_object(static_cast<std::size_t>(-1), tag_handler);
+
+            case 0xC6: // tagged item
+            case 0xC7:
+            case 0xC8:
+            case 0xC9:
+            case 0xCA:
+            case 0xCB:
+            case 0xCC:
+            case 0xCD:
+            case 0xCE:
+            case 0xCF:
+            case 0xD0:
+            case 0xD1:
+            case 0xD2:
+            case 0xD3:
+            case 0xD4:
+            case 0xD8: // tagged item (1 bytes follow)
+            case 0xD9: // tagged item (2 bytes follow)
+            case 0xDA: // tagged item (4 bytes follow)
+            case 0xDB: // tagged item (8 bytes follow)
+            {
+                switch (tag_handler)
+                {
+                    case cbor_tag_handler_t::error:
+                    {
+                        auto last_token = get_token_string();
+                        return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                                exception_message(input_format_t::cbor, concat("invalid byte: 0x", last_token), "value"), nullptr));
+                    }
+
+                    case cbor_tag_handler_t::ignore:
+                    {
+                        // ignore binary subtype
+                        switch (current)
+                        {
+                            case 0xD8:
+                            {
+                                std::uint8_t subtype_to_ignore{};
+                                get_number(input_format_t::cbor, subtype_to_ignore);
+                                break;
+                            }
+                            case 0xD9:
+                            {
+                                std::uint16_t subtype_to_ignore{};
+                                get_number(input_format_t::cbor, subtype_to_ignore);
+                                break;
+                            }
+                            case 0xDA:
+                            {
+                                std::uint32_t subtype_to_ignore{};
+                                get_number(input_format_t::cbor, subtype_to_ignore);
+                                break;
+                            }
+                            case 0xDB:
+                            {
+                                std::uint64_t subtype_to_ignore{};
+                                get_number(input_format_t::cbor, subtype_to_ignore);
+                                break;
+                            }
+                            default:
+                                break;
+                        }
+                        return parse_cbor_internal(true, tag_handler);
+                    }
+
+                    case cbor_tag_handler_t::store:
+                    {
+                        binary_t b;
+                        // use binary subtype and store in binary container
+                        switch (current)
+                        {
+                            case 0xD8:
+                            {
+                                std::uint8_t subtype{};
+                                get_number(input_format_t::cbor, subtype);
+                                b.set_subtype(detail::conditional_static_cast<typename binary_t::subtype_type>(subtype));
+                                break;
+                            }
+                            case 0xD9:
+                            {
+                                std::uint16_t subtype{};
+                                get_number(input_format_t::cbor, subtype);
+                                b.set_subtype(detail::conditional_static_cast<typename binary_t::subtype_type>(subtype));
+                                break;
+                            }
+                            case 0xDA:
+                            {
+                                std::uint32_t subtype{};
+                                get_number(input_format_t::cbor, subtype);
+                                b.set_subtype(detail::conditional_static_cast<typename binary_t::subtype_type>(subtype));
+                                break;
+                            }
+                            case 0xDB:
+                            {
+                                std::uint64_t subtype{};
+                                get_number(input_format_t::cbor, subtype);
+                                b.set_subtype(detail::conditional_static_cast<typename binary_t::subtype_type>(subtype));
+                                break;
+                            }
+                            default:
+                                return parse_cbor_internal(true, tag_handler);
+                        }
+                        get();
+                        return get_cbor_binary(b) && sax->binary(b);
+                    }
+
+                    default:                 // LCOV_EXCL_LINE
+                        JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+                        return false;        // LCOV_EXCL_LINE
+                }
+            }
+
+            case 0xF4: // false
+                return sax->boolean(false);
+
+            case 0xF5: // true
+                return sax->boolean(true);
+
+            case 0xF6: // null
+                return sax->null();
+
+            case 0xF9: // Half-Precision Float (two-byte IEEE 754)
+            {
+                const auto byte1_raw = get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "number")))
+                {
+                    return false;
+                }
+                const auto byte2_raw = get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "number")))
+                {
+                    return false;
+                }
+
+                const auto byte1 = static_cast<unsigned char>(byte1_raw);
+                const auto byte2 = static_cast<unsigned char>(byte2_raw);
+
+                // code from RFC 7049, Appendix D, Figure 3:
+                // As half-precision floating-point numbers were only added
+                // to IEEE 754 in 2008, today's programming platforms often
+                // still only have limited support for them. It is very
+                // easy to include at least decoding support for them even
+                // without such support. An example of a small decoder for
+                // half-precision floating-point numbers in the C language
+                // is shown in Fig. 3.
+                const auto half = static_cast<unsigned int>((byte1 << 8u) + byte2);
+                const double val = [&half]
+                {
+                    const int exp = (half >> 10u) & 0x1Fu;
+                    const unsigned int mant = half & 0x3FFu;
+                    JSON_ASSERT(0 <= exp&& exp <= 32);
+                    JSON_ASSERT(mant <= 1024);
+                    switch (exp)
+                    {
+                        case 0:
+                            return std::ldexp(mant, -24);
+                        case 31:
+                            return (mant == 0)
+                            ? std::numeric_limits<double>::infinity()
+                            : std::numeric_limits<double>::quiet_NaN();
+                        default:
+                            return std::ldexp(mant + 1024, exp - 25);
+                    }
+                }();
+                return sax->number_float((half & 0x8000u) != 0
+                                         ? static_cast<number_float_t>(-val)
+                                         : static_cast<number_float_t>(val), "");
+            }
+
+            case 0xFA: // Single-Precision Float (four-byte IEEE 754)
+            {
+                float number{};
+                return get_number(input_format_t::cbor, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0xFB: // Double-Precision Float (eight-byte IEEE 754)
+            {
+                double number{};
+                return get_number(input_format_t::cbor, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            default: // anything else (0xFF is handled inside the other types)
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format_t::cbor, concat("invalid byte: 0x", last_token), "value"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief reads a CBOR string
+
+    This function first reads starting bytes to determine the expected
+    string length and then copies this number of bytes into a string.
+    Additionally, CBOR's strings with indefinite lengths are supported.
+
+    @param[out] result  created string
+
+    @return whether string creation completed
+    */
+    bool get_cbor_string(string_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "string")))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            // UTF-8 string (0x00..0x17 bytes follow)
+            case 0x60:
+            case 0x61:
+            case 0x62:
+            case 0x63:
+            case 0x64:
+            case 0x65:
+            case 0x66:
+            case 0x67:
+            case 0x68:
+            case 0x69:
+            case 0x6A:
+            case 0x6B:
+            case 0x6C:
+            case 0x6D:
+            case 0x6E:
+            case 0x6F:
+            case 0x70:
+            case 0x71:
+            case 0x72:
+            case 0x73:
+            case 0x74:
+            case 0x75:
+            case 0x76:
+            case 0x77:
+            {
+                return get_string(input_format_t::cbor, static_cast<unsigned int>(current) & 0x1Fu, result);
+            }
+
+            case 0x78: // UTF-8 string (one-byte uint8_t for n follows)
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
+            }
+
+            case 0x79: // UTF-8 string (two-byte uint16_t for n follow)
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
+            }
+
+            case 0x7A: // UTF-8 string (four-byte uint32_t for n follow)
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
+            }
+
+            case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow)
+            {
+                std::uint64_t len{};
+                return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
+            }
+
+            case 0x7F: // UTF-8 string (indefinite length)
+            {
+                while (get() != 0xFF)
+                {
+                    string_t chunk;
+                    if (!get_cbor_string(chunk))
+                    {
+                        return false;
+                    }
+                    result.append(chunk);
+                }
+                return true;
+            }
+
+            default:
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read,
+                                        exception_message(input_format_t::cbor, concat("expected length specification (0x60-0x7B) or indefinite string type (0x7F); last byte: 0x", last_token), "string"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief reads a CBOR byte array
+
+    This function first reads starting bytes to determine the expected
+    byte array length and then copies this number of bytes into the byte array.
+    Additionally, CBOR's byte arrays with indefinite lengths are supported.
+
+    @param[out] result  created byte array
+
+    @return whether byte array creation completed
+    */
+    bool get_cbor_binary(binary_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "binary")))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            // Binary data (0x00..0x17 bytes follow)
+            case 0x40:
+            case 0x41:
+            case 0x42:
+            case 0x43:
+            case 0x44:
+            case 0x45:
+            case 0x46:
+            case 0x47:
+            case 0x48:
+            case 0x49:
+            case 0x4A:
+            case 0x4B:
+            case 0x4C:
+            case 0x4D:
+            case 0x4E:
+            case 0x4F:
+            case 0x50:
+            case 0x51:
+            case 0x52:
+            case 0x53:
+            case 0x54:
+            case 0x55:
+            case 0x56:
+            case 0x57:
+            {
+                return get_binary(input_format_t::cbor, static_cast<unsigned int>(current) & 0x1Fu, result);
+            }
+
+            case 0x58: // Binary data (one-byte uint8_t for n follows)
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::cbor, len) &&
+                       get_binary(input_format_t::cbor, len, result);
+            }
+
+            case 0x59: // Binary data (two-byte uint16_t for n follow)
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::cbor, len) &&
+                       get_binary(input_format_t::cbor, len, result);
+            }
+
+            case 0x5A: // Binary data (four-byte uint32_t for n follow)
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::cbor, len) &&
+                       get_binary(input_format_t::cbor, len, result);
+            }
+
+            case 0x5B: // Binary data (eight-byte uint64_t for n follow)
+            {
+                std::uint64_t len{};
+                return get_number(input_format_t::cbor, len) &&
+                       get_binary(input_format_t::cbor, len, result);
+            }
+
+            case 0x5F: // Binary data (indefinite length)
+            {
+                while (get() != 0xFF)
+                {
+                    binary_t chunk;
+                    if (!get_cbor_binary(chunk))
+                    {
+                        return false;
+                    }
+                    result.insert(result.end(), chunk.begin(), chunk.end());
+                }
+                return true;
+            }
+
+            default:
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read,
+                                        exception_message(input_format_t::cbor, concat("expected length specification (0x40-0x5B) or indefinite binary array type (0x5F); last byte: 0x", last_token), "binary"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @param[in] len  the length of the array or static_cast<std::size_t>(-1) for an
+                    array of indefinite size
+    @param[in] tag_handler how CBOR tags should be treated
+    @return whether array creation completed
+    */
+    bool get_cbor_array(const std::size_t len,
+                        const cbor_tag_handler_t tag_handler)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_array(len)))
+        {
+            return false;
+        }
+
+        if (len != static_cast<std::size_t>(-1))
+        {
+            for (std::size_t i = 0; i < len; ++i)
+            {
+                if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler)))
+                {
+                    return false;
+                }
+            }
+        }
+        else
+        {
+            while (get() != 0xFF)
+            {
+                if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(false, tag_handler)))
+                {
+                    return false;
+                }
+            }
+        }
+
+        return sax->end_array();
+    }
+
+    /*!
+    @param[in] len  the length of the object or static_cast<std::size_t>(-1) for an
+                    object of indefinite size
+    @param[in] tag_handler how CBOR tags should be treated
+    @return whether object creation completed
+    */
+    bool get_cbor_object(const std::size_t len,
+                         const cbor_tag_handler_t tag_handler)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_object(len)))
+        {
+            return false;
+        }
+
+        if (len != 0)
+        {
+            string_t key;
+            if (len != static_cast<std::size_t>(-1))
+            {
+                for (std::size_t i = 0; i < len; ++i)
+                {
+                    get();
+                    if (JSON_HEDLEY_UNLIKELY(!get_cbor_string(key) || !sax->key(key)))
+                    {
+                        return false;
+                    }
+
+                    if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler)))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+            else
+            {
+                while (get() != 0xFF)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!get_cbor_string(key) || !sax->key(key)))
+                    {
+                        return false;
+                    }
+
+                    if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler)))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+        }
+
+        return sax->end_object();
+    }
+
+    /////////////
+    // MsgPack //
+    /////////////
+
+    /*!
+    @return whether a valid MessagePack value was passed to the SAX parser
+    */
+    bool parse_msgpack_internal()
+    {
+        switch (get())
+        {
+            // EOF
+            case std::char_traits<char_type>::eof():
+                return unexpect_eof(input_format_t::msgpack, "value");
+
+            // positive fixint
+            case 0x00:
+            case 0x01:
+            case 0x02:
+            case 0x03:
+            case 0x04:
+            case 0x05:
+            case 0x06:
+            case 0x07:
+            case 0x08:
+            case 0x09:
+            case 0x0A:
+            case 0x0B:
+            case 0x0C:
+            case 0x0D:
+            case 0x0E:
+            case 0x0F:
+            case 0x10:
+            case 0x11:
+            case 0x12:
+            case 0x13:
+            case 0x14:
+            case 0x15:
+            case 0x16:
+            case 0x17:
+            case 0x18:
+            case 0x19:
+            case 0x1A:
+            case 0x1B:
+            case 0x1C:
+            case 0x1D:
+            case 0x1E:
+            case 0x1F:
+            case 0x20:
+            case 0x21:
+            case 0x22:
+            case 0x23:
+            case 0x24:
+            case 0x25:
+            case 0x26:
+            case 0x27:
+            case 0x28:
+            case 0x29:
+            case 0x2A:
+            case 0x2B:
+            case 0x2C:
+            case 0x2D:
+            case 0x2E:
+            case 0x2F:
+            case 0x30:
+            case 0x31:
+            case 0x32:
+            case 0x33:
+            case 0x34:
+            case 0x35:
+            case 0x36:
+            case 0x37:
+            case 0x38:
+            case 0x39:
+            case 0x3A:
+            case 0x3B:
+            case 0x3C:
+            case 0x3D:
+            case 0x3E:
+            case 0x3F:
+            case 0x40:
+            case 0x41:
+            case 0x42:
+            case 0x43:
+            case 0x44:
+            case 0x45:
+            case 0x46:
+            case 0x47:
+            case 0x48:
+            case 0x49:
+            case 0x4A:
+            case 0x4B:
+            case 0x4C:
+            case 0x4D:
+            case 0x4E:
+            case 0x4F:
+            case 0x50:
+            case 0x51:
+            case 0x52:
+            case 0x53:
+            case 0x54:
+            case 0x55:
+            case 0x56:
+            case 0x57:
+            case 0x58:
+            case 0x59:
+            case 0x5A:
+            case 0x5B:
+            case 0x5C:
+            case 0x5D:
+            case 0x5E:
+            case 0x5F:
+            case 0x60:
+            case 0x61:
+            case 0x62:
+            case 0x63:
+            case 0x64:
+            case 0x65:
+            case 0x66:
+            case 0x67:
+            case 0x68:
+            case 0x69:
+            case 0x6A:
+            case 0x6B:
+            case 0x6C:
+            case 0x6D:
+            case 0x6E:
+            case 0x6F:
+            case 0x70:
+            case 0x71:
+            case 0x72:
+            case 0x73:
+            case 0x74:
+            case 0x75:
+            case 0x76:
+            case 0x77:
+            case 0x78:
+            case 0x79:
+            case 0x7A:
+            case 0x7B:
+            case 0x7C:
+            case 0x7D:
+            case 0x7E:
+            case 0x7F:
+                return sax->number_unsigned(static_cast<number_unsigned_t>(current));
+
+            // fixmap
+            case 0x80:
+            case 0x81:
+            case 0x82:
+            case 0x83:
+            case 0x84:
+            case 0x85:
+            case 0x86:
+            case 0x87:
+            case 0x88:
+            case 0x89:
+            case 0x8A:
+            case 0x8B:
+            case 0x8C:
+            case 0x8D:
+            case 0x8E:
+            case 0x8F:
+                return get_msgpack_object(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu));
+
+            // fixarray
+            case 0x90:
+            case 0x91:
+            case 0x92:
+            case 0x93:
+            case 0x94:
+            case 0x95:
+            case 0x96:
+            case 0x97:
+            case 0x98:
+            case 0x99:
+            case 0x9A:
+            case 0x9B:
+            case 0x9C:
+            case 0x9D:
+            case 0x9E:
+            case 0x9F:
+                return get_msgpack_array(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu));
+
+            // fixstr
+            case 0xA0:
+            case 0xA1:
+            case 0xA2:
+            case 0xA3:
+            case 0xA4:
+            case 0xA5:
+            case 0xA6:
+            case 0xA7:
+            case 0xA8:
+            case 0xA9:
+            case 0xAA:
+            case 0xAB:
+            case 0xAC:
+            case 0xAD:
+            case 0xAE:
+            case 0xAF:
+            case 0xB0:
+            case 0xB1:
+            case 0xB2:
+            case 0xB3:
+            case 0xB4:
+            case 0xB5:
+            case 0xB6:
+            case 0xB7:
+            case 0xB8:
+            case 0xB9:
+            case 0xBA:
+            case 0xBB:
+            case 0xBC:
+            case 0xBD:
+            case 0xBE:
+            case 0xBF:
+            case 0xD9: // str 8
+            case 0xDA: // str 16
+            case 0xDB: // str 32
+            {
+                string_t s;
+                return get_msgpack_string(s) && sax->string(s);
+            }
+
+            case 0xC0: // nil
+                return sax->null();
+
+            case 0xC2: // false
+                return sax->boolean(false);
+
+            case 0xC3: // true
+                return sax->boolean(true);
+
+            case 0xC4: // bin 8
+            case 0xC5: // bin 16
+            case 0xC6: // bin 32
+            case 0xC7: // ext 8
+            case 0xC8: // ext 16
+            case 0xC9: // ext 32
+            case 0xD4: // fixext 1
+            case 0xD5: // fixext 2
+            case 0xD6: // fixext 4
+            case 0xD7: // fixext 8
+            case 0xD8: // fixext 16
+            {
+                binary_t b;
+                return get_msgpack_binary(b) && sax->binary(b);
+            }
+
+            case 0xCA: // float 32
+            {
+                float number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0xCB: // float 64
+            {
+                double number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0xCC: // uint 8
+            {
+                std::uint8_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number);
+            }
+
+            case 0xCD: // uint 16
+            {
+                std::uint16_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number);
+            }
+
+            case 0xCE: // uint 32
+            {
+                std::uint32_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number);
+            }
+
+            case 0xCF: // uint 64
+            {
+                std::uint64_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number);
+            }
+
+            case 0xD0: // int 8
+            {
+                std::int8_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_integer(number);
+            }
+
+            case 0xD1: // int 16
+            {
+                std::int16_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_integer(number);
+            }
+
+            case 0xD2: // int 32
+            {
+                std::int32_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_integer(number);
+            }
+
+            case 0xD3: // int 64
+            {
+                std::int64_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_integer(number);
+            }
+
+            case 0xDC: // array 16
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::msgpack, len) && get_msgpack_array(static_cast<std::size_t>(len));
+            }
+
+            case 0xDD: // array 32
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::msgpack, len) && get_msgpack_array(conditional_static_cast<std::size_t>(len));
+            }
+
+            case 0xDE: // map 16
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::msgpack, len) && get_msgpack_object(static_cast<std::size_t>(len));
+            }
+
+            case 0xDF: // map 32
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::msgpack, len) && get_msgpack_object(conditional_static_cast<std::size_t>(len));
+            }
+
+            // negative fixint
+            case 0xE0:
+            case 0xE1:
+            case 0xE2:
+            case 0xE3:
+            case 0xE4:
+            case 0xE5:
+            case 0xE6:
+            case 0xE7:
+            case 0xE8:
+            case 0xE9:
+            case 0xEA:
+            case 0xEB:
+            case 0xEC:
+            case 0xED:
+            case 0xEE:
+            case 0xEF:
+            case 0xF0:
+            case 0xF1:
+            case 0xF2:
+            case 0xF3:
+            case 0xF4:
+            case 0xF5:
+            case 0xF6:
+            case 0xF7:
+            case 0xF8:
+            case 0xF9:
+            case 0xFA:
+            case 0xFB:
+            case 0xFC:
+            case 0xFD:
+            case 0xFE:
+            case 0xFF:
+                return sax->number_integer(static_cast<std::int8_t>(current));
+
+            default: // anything else
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format_t::msgpack, concat("invalid byte: 0x", last_token), "value"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief reads a MessagePack string
+
+    This function first reads starting bytes to determine the expected
+    string length and then copies this number of bytes into a string.
+
+    @param[out] result  created string
+
+    @return whether string creation completed
+    */
+    bool get_msgpack_string(string_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::msgpack, "string")))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            // fixstr
+            case 0xA0:
+            case 0xA1:
+            case 0xA2:
+            case 0xA3:
+            case 0xA4:
+            case 0xA5:
+            case 0xA6:
+            case 0xA7:
+            case 0xA8:
+            case 0xA9:
+            case 0xAA:
+            case 0xAB:
+            case 0xAC:
+            case 0xAD:
+            case 0xAE:
+            case 0xAF:
+            case 0xB0:
+            case 0xB1:
+            case 0xB2:
+            case 0xB3:
+            case 0xB4:
+            case 0xB5:
+            case 0xB6:
+            case 0xB7:
+            case 0xB8:
+            case 0xB9:
+            case 0xBA:
+            case 0xBB:
+            case 0xBC:
+            case 0xBD:
+            case 0xBE:
+            case 0xBF:
+            {
+                return get_string(input_format_t::msgpack, static_cast<unsigned int>(current) & 0x1Fu, result);
+            }
+
+            case 0xD9: // str 8
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::msgpack, len) && get_string(input_format_t::msgpack, len, result);
+            }
+
+            case 0xDA: // str 16
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::msgpack, len) && get_string(input_format_t::msgpack, len, result);
+            }
+
+            case 0xDB: // str 32
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::msgpack, len) && get_string(input_format_t::msgpack, len, result);
+            }
+
+            default:
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read,
+                                        exception_message(input_format_t::msgpack, concat("expected length specification (0xA0-0xBF, 0xD9-0xDB); last byte: 0x", last_token), "string"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief reads a MessagePack byte array
+
+    This function first reads starting bytes to determine the expected
+    byte array length and then copies this number of bytes into a byte array.
+
+    @param[out] result  created byte array
+
+    @return whether byte array creation completed
+    */
+    bool get_msgpack_binary(binary_t& result)
+    {
+        // helper function to set the subtype
+        auto assign_and_return_true = [&result](std::int8_t subtype)
+        {
+            result.set_subtype(static_cast<std::uint8_t>(subtype));
+            return true;
+        };
+
+        switch (current)
+        {
+            case 0xC4: // bin 8
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_binary(input_format_t::msgpack, len, result);
+            }
+
+            case 0xC5: // bin 16
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_binary(input_format_t::msgpack, len, result);
+            }
+
+            case 0xC6: // bin 32
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_binary(input_format_t::msgpack, len, result);
+            }
+
+            case 0xC7: // ext 8
+            {
+                std::uint8_t len{};
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, len, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xC8: // ext 16
+            {
+                std::uint16_t len{};
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, len, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xC9: // ext 32
+            {
+                std::uint32_t len{};
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, len, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD4: // fixext 1
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 1, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD5: // fixext 2
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 2, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD6: // fixext 4
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 4, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD7: // fixext 8
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 8, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD8: // fixext 16
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 16, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            default:           // LCOV_EXCL_LINE
+                return false;  // LCOV_EXCL_LINE
+        }
+    }
+
+    /*!
+    @param[in] len  the length of the array
+    @return whether array creation completed
+    */
+    bool get_msgpack_array(const std::size_t len)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_array(len)))
+        {
+            return false;
+        }
+
+        for (std::size_t i = 0; i < len; ++i)
+        {
+            if (JSON_HEDLEY_UNLIKELY(!parse_msgpack_internal()))
+            {
+                return false;
+            }
+        }
+
+        return sax->end_array();
+    }
+
+    /*!
+    @param[in] len  the length of the object
+    @return whether object creation completed
+    */
+    bool get_msgpack_object(const std::size_t len)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_object(len)))
+        {
+            return false;
+        }
+
+        string_t key;
+        for (std::size_t i = 0; i < len; ++i)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!get_msgpack_string(key) || !sax->key(key)))
+            {
+                return false;
+            }
+
+            if (JSON_HEDLEY_UNLIKELY(!parse_msgpack_internal()))
+            {
+                return false;
+            }
+            key.clear();
+        }
+
+        return sax->end_object();
+    }
+
+    ////////////
+    // UBJSON //
+    ////////////
+
+    /*!
+    @param[in] get_char  whether a new character should be retrieved from the
+                         input (true, default) or whether the last read
+                         character should be considered instead
+
+    @return whether a valid UBJSON value was passed to the SAX parser
+    */
+    bool parse_ubjson_internal(const bool get_char = true)
+    {
+        return get_ubjson_value(get_char ? get_ignore_noop() : current);
+    }
+
+    /*!
+    @brief reads a UBJSON string
+
+    This function is either called after reading the 'S' byte explicitly
+    indicating a string, or in case of an object key where the 'S' byte can be
+    left out.
+
+    @param[out] result   created string
+    @param[in] get_char  whether a new character should be retrieved from the
+                         input (true, default) or whether the last read
+                         character should be considered instead
+
+    @return whether string creation completed
+    */
+    bool get_ubjson_string(string_t& result, const bool get_char = true)
+    {
+        if (get_char)
+        {
+            get();  // TODO(niels): may we ignore N here?
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "value")))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            case 'U':
+            {
+                std::uint8_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'i':
+            {
+                std::int8_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'I':
+            {
+                std::int16_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'l':
+            {
+                std::int32_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'L':
+            {
+                std::int64_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'u':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint16_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'm':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint32_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'M':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint64_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            default:
+                break;
+        }
+        auto last_token = get_token_string();
+        std::string message;
+
+        if (input_format != input_format_t::bjdata)
+        {
+            message = "expected length type specification (U, i, I, l, L); last byte: 0x" + last_token;
+        }
+        else
+        {
+            message = "expected length type specification (U, i, u, I, m, l, M, L); last byte: 0x" + last_token;
+        }
+        return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format, message, "string"), nullptr));
+    }
+
+    /*!
+    @param[out] dim  an integer vector storing the ND array dimensions
+    @return whether reading ND array size vector is successful
+    */
+    bool get_ubjson_ndarray_size(std::vector<size_t>& dim)
+    {
+        std::pair<std::size_t, char_int_type> size_and_type;
+        size_t dimlen = 0;
+        bool no_ndarray = true;
+
+        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_type(size_and_type, no_ndarray)))
+        {
+            return false;
+        }
+
+        if (size_and_type.first != npos)
+        {
+            if (size_and_type.second != 0)
+            {
+                if (size_and_type.second != 'N')
+                {
+                    for (std::size_t i = 0; i < size_and_type.first; ++i)
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_value(dimlen, no_ndarray, size_and_type.second)))
+                        {
+                            return false;
+                        }
+                        dim.push_back(dimlen);
+                    }
+                }
+            }
+            else
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_value(dimlen, no_ndarray)))
+                    {
+                        return false;
+                    }
+                    dim.push_back(dimlen);
+                }
+            }
+        }
+        else
+        {
+            while (current != ']')
+            {
+                if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_value(dimlen, no_ndarray, current)))
+                {
+                    return false;
+                }
+                dim.push_back(dimlen);
+                get_ignore_noop();
+            }
+        }
+        return true;
+    }
+
+    /*!
+    @param[out] result  determined size
+    @param[in,out] is_ndarray  for input, `true` means already inside an ndarray vector
+                               or ndarray dimension is not allowed; `false` means ndarray
+                               is allowed; for output, `true` means an ndarray is found;
+                               is_ndarray can only return `true` when its initial value
+                               is `false`
+    @param[in] prefix  type marker if already read, otherwise set to 0
+
+    @return whether size determination completed
+    */
+    bool get_ubjson_size_value(std::size_t& result, bool& is_ndarray, char_int_type prefix = 0)
+    {
+        if (prefix == 0)
+        {
+            prefix = get_ignore_noop();
+        }
+
+        switch (prefix)
+        {
+            case 'U':
+            {
+                std::uint8_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'i':
+            {
+                std::int8_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (number < 0)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read,
+                                            exception_message(input_format, "count in an optimized container must be positive", "size"), nullptr));
+                }
+                result = static_cast<std::size_t>(number); // NOLINT(bugprone-signed-char-misuse,cert-str34-c): number is not a char
+                return true;
+            }
+
+            case 'I':
+            {
+                std::int16_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (number < 0)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read,
+                                            exception_message(input_format, "count in an optimized container must be positive", "size"), nullptr));
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'l':
+            {
+                std::int32_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (number < 0)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read,
+                                            exception_message(input_format, "count in an optimized container must be positive", "size"), nullptr));
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'L':
+            {
+                std::int64_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (number < 0)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read,
+                                            exception_message(input_format, "count in an optimized container must be positive", "size"), nullptr));
+                }
+                if (!value_in_range_of<std::size_t>(number))
+                {
+                    return sax->parse_error(chars_read, get_token_string(), out_of_range::create(408,
+                                            exception_message(input_format, "integer value overflow", "size"), nullptr));
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'u':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint16_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'm':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint32_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                result = conditional_static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'M':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint64_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (!value_in_range_of<std::size_t>(number))
+                {
+                    return sax->parse_error(chars_read, get_token_string(), out_of_range::create(408,
+                                            exception_message(input_format, "integer value overflow", "size"), nullptr));
+                }
+                result = detail::conditional_static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case '[':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                if (is_ndarray) // ndarray dimensional vector can only contain integers, and can not embed another array
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read, exception_message(input_format, "ndarray dimentional vector is not allowed", "size"), nullptr));
+                }
+                std::vector<size_t> dim;
+                if (JSON_HEDLEY_UNLIKELY(!get_ubjson_ndarray_size(dim)))
+                {
+                    return false;
+                }
+                if (dim.size() == 1 || (dim.size() == 2 && dim.at(0) == 1)) // return normal array size if 1D row vector
+                {
+                    result = dim.at(dim.size() - 1);
+                    return true;
+                }
+                if (!dim.empty())  // if ndarray, convert to an object in JData annotated array format
+                {
+                    for (auto i : dim) // test if any dimension in an ndarray is 0, if so, return a 1D empty container
+                    {
+                        if ( i == 0 )
+                        {
+                            result = 0;
+                            return true;
+                        }
+                    }
+
+                    string_t key = "_ArraySize_";
+                    if (JSON_HEDLEY_UNLIKELY(!sax->start_object(3) || !sax->key(key) || !sax->start_array(dim.size())))
+                    {
+                        return false;
+                    }
+                    result = 1;
+                    for (auto i : dim)
+                    {
+                        result *= i;
+                        if (result == 0 || result == npos) // because dim elements shall not have zeros, result = 0 means overflow happened; it also can't be npos as it is used to initialize size in get_ubjson_size_type()
+                        {
+                            return sax->parse_error(chars_read, get_token_string(), out_of_range::create(408, exception_message(input_format, "excessive ndarray size caused overflow", "size"), nullptr));
+                        }
+                        if (JSON_HEDLEY_UNLIKELY(!sax->number_unsigned(static_cast<number_unsigned_t>(i))))
+                        {
+                            return false;
+                        }
+                    }
+                    is_ndarray = true;
+                    return sax->end_array();
+                }
+                result = 0;
+                return true;
+            }
+
+            default:
+                break;
+        }
+        auto last_token = get_token_string();
+        std::string message;
+
+        if (input_format != input_format_t::bjdata)
+        {
+            message = "expected length type specification (U, i, I, l, L) after '#'; last byte: 0x" + last_token;
+        }
+        else
+        {
+            message = "expected length type specification (U, i, u, I, m, l, M, L) after '#'; last byte: 0x" + last_token;
+        }
+        return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format, message, "size"), nullptr));
+    }
+
+    /*!
+    @brief determine the type and size for a container
+
+    In the optimized UBJSON format, a type and a size can be provided to allow
+    for a more compact representation.
+
+    @param[out] result  pair of the size and the type
+    @param[in] inside_ndarray  whether the parser is parsing an ND array dimensional vector
+
+    @return whether pair creation completed
+    */
+    bool get_ubjson_size_type(std::pair<std::size_t, char_int_type>& result, bool inside_ndarray = false)
+    {
+        result.first = npos; // size
+        result.second = 0; // type
+        bool is_ndarray = false;
+
+        get_ignore_noop();
+
+        if (current == '$')
+        {
+            result.second = get();  // must not ignore 'N', because 'N' maybe the type
+            if (input_format == input_format_t::bjdata
+                    && JSON_HEDLEY_UNLIKELY(std::binary_search(bjd_optimized_type_markers.begin(), bjd_optimized_type_markers.end(), result.second)))
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format, concat("marker 0x", last_token, " is not a permitted optimized array type"), "type"), nullptr));
+            }
+
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "type")))
+            {
+                return false;
+            }
+
+            get_ignore_noop();
+            if (JSON_HEDLEY_UNLIKELY(current != '#'))
+            {
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "value")))
+                {
+                    return false;
+                }
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format, concat("expected '#' after type information; last byte: 0x", last_token), "size"), nullptr));
+            }
+
+            bool is_error = get_ubjson_size_value(result.first, is_ndarray);
+            if (input_format == input_format_t::bjdata && is_ndarray)
+            {
+                if (inside_ndarray)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(112, chars_read,
+                                            exception_message(input_format, "ndarray can not be recursive", "size"), nullptr));
+                }
+                result.second |= (1 << 8); // use bit 8 to indicate ndarray, all UBJSON and BJData markers should be ASCII letters
+            }
+            return is_error;
+        }
+
+        if (current == '#')
+        {
+            bool is_error = get_ubjson_size_value(result.first, is_ndarray);
+            if (input_format == input_format_t::bjdata && is_ndarray)
+            {
+                return sax->parse_error(chars_read, get_token_string(), parse_error::create(112, chars_read,
+                                        exception_message(input_format, "ndarray requires both type and size", "size"), nullptr));
+            }
+            return is_error;
+        }
+
+        return true;
+    }
+
+    /*!
+    @param prefix  the previously read or set type prefix
+    @return whether value creation completed
+    */
+    bool get_ubjson_value(const char_int_type prefix)
+    {
+        switch (prefix)
+        {
+            case std::char_traits<char_type>::eof():  // EOF
+                return unexpect_eof(input_format, "value");
+
+            case 'T':  // true
+                return sax->boolean(true);
+            case 'F':  // false
+                return sax->boolean(false);
+
+            case 'Z':  // null
+                return sax->null();
+
+            case 'U':
+            {
+                std::uint8_t number{};
+                return get_number(input_format, number) && sax->number_unsigned(number);
+            }
+
+            case 'i':
+            {
+                std::int8_t number{};
+                return get_number(input_format, number) && sax->number_integer(number);
+            }
+
+            case 'I':
+            {
+                std::int16_t number{};
+                return get_number(input_format, number) && sax->number_integer(number);
+            }
+
+            case 'l':
+            {
+                std::int32_t number{};
+                return get_number(input_format, number) && sax->number_integer(number);
+            }
+
+            case 'L':
+            {
+                std::int64_t number{};
+                return get_number(input_format, number) && sax->number_integer(number);
+            }
+
+            case 'u':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint16_t number{};
+                return get_number(input_format, number) && sax->number_unsigned(number);
+            }
+
+            case 'm':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint32_t number{};
+                return get_number(input_format, number) && sax->number_unsigned(number);
+            }
+
+            case 'M':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint64_t number{};
+                return get_number(input_format, number) && sax->number_unsigned(number);
+            }
+
+            case 'h':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                const auto byte1_raw = get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "number")))
+                {
+                    return false;
+                }
+                const auto byte2_raw = get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "number")))
+                {
+                    return false;
+                }
+
+                const auto byte1 = static_cast<unsigned char>(byte1_raw);
+                const auto byte2 = static_cast<unsigned char>(byte2_raw);
+
+                // code from RFC 7049, Appendix D, Figure 3:
+                // As half-precision floating-point numbers were only added
+                // to IEEE 754 in 2008, today's programming platforms often
+                // still only have limited support for them. It is very
+                // easy to include at least decoding support for them even
+                // without such support. An example of a small decoder for
+                // half-precision floating-point numbers in the C language
+                // is shown in Fig. 3.
+                const auto half = static_cast<unsigned int>((byte2 << 8u) + byte1);
+                const double val = [&half]
+                {
+                    const int exp = (half >> 10u) & 0x1Fu;
+                    const unsigned int mant = half & 0x3FFu;
+                    JSON_ASSERT(0 <= exp&& exp <= 32);
+                    JSON_ASSERT(mant <= 1024);
+                    switch (exp)
+                    {
+                        case 0:
+                            return std::ldexp(mant, -24);
+                        case 31:
+                            return (mant == 0)
+                            ? std::numeric_limits<double>::infinity()
+                            : std::numeric_limits<double>::quiet_NaN();
+                        default:
+                            return std::ldexp(mant + 1024, exp - 25);
+                    }
+                }();
+                return sax->number_float((half & 0x8000u) != 0
+                                         ? static_cast<number_float_t>(-val)
+                                         : static_cast<number_float_t>(val), "");
+            }
+
+            case 'd':
+            {
+                float number{};
+                return get_number(input_format, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 'D':
+            {
+                double number{};
+                return get_number(input_format, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 'H':
+            {
+                return get_ubjson_high_precision_number();
+            }
+
+            case 'C':  // char
+            {
+                get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "char")))
+                {
+                    return false;
+                }
+                if (JSON_HEDLEY_UNLIKELY(current > 127))
+                {
+                    auto last_token = get_token_string();
+                    return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read,
+                                            exception_message(input_format, concat("byte after 'C' must be in range 0x00..0x7F; last byte: 0x", last_token), "char"), nullptr));
+                }
+                string_t s(1, static_cast<typename string_t::value_type>(current));
+                return sax->string(s);
+            }
+
+            case 'S':  // string
+            {
+                string_t s;
+                return get_ubjson_string(s) && sax->string(s);
+            }
+
+            case '[':  // array
+                return get_ubjson_array();
+
+            case '{':  // object
+                return get_ubjson_object();
+
+            default: // anything else
+                break;
+        }
+        auto last_token = get_token_string();
+        return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format, "invalid byte: 0x" + last_token, "value"), nullptr));
+    }
+
+    /*!
+    @return whether array creation completed
+    */
+    bool get_ubjson_array()
+    {
+        std::pair<std::size_t, char_int_type> size_and_type;
+        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_type(size_and_type)))
+        {
+            return false;
+        }
+
+        // if bit-8 of size_and_type.second is set to 1, encode bjdata ndarray as an object in JData annotated array format (https://github.com/NeuroJSON/jdata):
+        // {"_ArrayType_" : "typeid", "_ArraySize_" : [n1, n2, ...], "_ArrayData_" : [v1, v2, ...]}
+
+        if (input_format == input_format_t::bjdata && size_and_type.first != npos && (size_and_type.second & (1 << 8)) != 0)
+        {
+            size_and_type.second &= ~(static_cast<char_int_type>(1) << 8);  // use bit 8 to indicate ndarray, here we remove the bit to restore the type marker
+            auto it = std::lower_bound(bjd_types_map.begin(), bjd_types_map.end(), size_and_type.second, [](const bjd_type & p, char_int_type t)
+            {
+                return p.first < t;
+            });
+            string_t key = "_ArrayType_";
+            if (JSON_HEDLEY_UNLIKELY(it == bjd_types_map.end() || it->first != size_and_type.second))
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format, "invalid byte: 0x" + last_token, "type"), nullptr));
+            }
+
+            string_t type = it->second; // sax->string() takes a reference
+            if (JSON_HEDLEY_UNLIKELY(!sax->key(key) || !sax->string(type)))
+            {
+                return false;
+            }
+
+            if (size_and_type.second == 'C')
+            {
+                size_and_type.second = 'U';
+            }
+
+            key = "_ArrayData_";
+            if (JSON_HEDLEY_UNLIKELY(!sax->key(key) || !sax->start_array(size_and_type.first) ))
+            {
+                return false;
+            }
+
+            for (std::size_t i = 0; i < size_and_type.first; ++i)
+            {
+                if (JSON_HEDLEY_UNLIKELY(!get_ubjson_value(size_and_type.second)))
+                {
+                    return false;
+                }
+            }
+
+            return (sax->end_array() && sax->end_object());
+        }
+
+        if (size_and_type.first != npos)
+        {
+            if (JSON_HEDLEY_UNLIKELY(!sax->start_array(size_and_type.first)))
+            {
+                return false;
+            }
+
+            if (size_and_type.second != 0)
+            {
+                if (size_and_type.second != 'N')
+                {
+                    for (std::size_t i = 0; i < size_and_type.first; ++i)
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_value(size_and_type.second)))
+                        {
+                            return false;
+                        }
+                    }
+                }
+            }
+            else
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal()))
+                    {
+                        return false;
+                    }
+                }
+            }
+        }
+        else
+        {
+            if (JSON_HEDLEY_UNLIKELY(!sax->start_array(static_cast<std::size_t>(-1))))
+            {
+                return false;
+            }
+
+            while (current != ']')
+            {
+                if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal(false)))
+                {
+                    return false;
+                }
+                get_ignore_noop();
+            }
+        }
+
+        return sax->end_array();
+    }
+
+    /*!
+    @return whether object creation completed
+    */
+    bool get_ubjson_object()
+    {
+        std::pair<std::size_t, char_int_type> size_and_type;
+        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_type(size_and_type)))
+        {
+            return false;
+        }
+
+        // do not accept ND-array size in objects in BJData
+        if (input_format == input_format_t::bjdata && size_and_type.first != npos && (size_and_type.second & (1 << 8)) != 0)
+        {
+            auto last_token = get_token_string();
+            return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                    exception_message(input_format, "BJData object does not support ND-array size in optimized format", "object"), nullptr));
+        }
+
+        string_t key;
+        if (size_and_type.first != npos)
+        {
+            if (JSON_HEDLEY_UNLIKELY(!sax->start_object(size_and_type.first)))
+            {
+                return false;
+            }
+
+            if (size_and_type.second != 0)
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!get_ubjson_string(key) || !sax->key(key)))
+                    {
+                        return false;
+                    }
+                    if (JSON_HEDLEY_UNLIKELY(!get_ubjson_value(size_and_type.second)))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+            else
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!get_ubjson_string(key) || !sax->key(key)))
+                    {
+                        return false;
+                    }
+                    if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal()))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+        }
+        else
+        {
+            if (JSON_HEDLEY_UNLIKELY(!sax->start_object(static_cast<std::size_t>(-1))))
+            {
+                return false;
+            }
+
+            while (current != '}')
+            {
+                if (JSON_HEDLEY_UNLIKELY(!get_ubjson_string(key, false) || !sax->key(key)))
+                {
+                    return false;
+                }
+                if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal()))
+                {
+                    return false;
+                }
+                get_ignore_noop();
+                key.clear();
+            }
+        }
+
+        return sax->end_object();
+    }
+
+    // Note, no reader for UBJSON binary types is implemented because they do
+    // not exist
+
+    bool get_ubjson_high_precision_number()
+    {
+        // get size of following number string
+        std::size_t size{};
+        bool no_ndarray = true;
+        auto res = get_ubjson_size_value(size, no_ndarray);
+        if (JSON_HEDLEY_UNLIKELY(!res))
+        {
+            return res;
+        }
+
+        // get number string
+        std::vector<char> number_vector;
+        for (std::size_t i = 0; i < size; ++i)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "number")))
+            {
+                return false;
+            }
+            number_vector.push_back(static_cast<char>(current));
+        }
+
+        // parse number string
+        using ia_type = decltype(detail::input_adapter(number_vector));
+        auto number_lexer = detail::lexer<BasicJsonType, ia_type>(detail::input_adapter(number_vector), false);
+        const auto result_number = number_lexer.scan();
+        const auto number_string = number_lexer.get_token_string();
+        const auto result_remainder = number_lexer.scan();
+
+        using token_type = typename detail::lexer_base<BasicJsonType>::token_type;
+
+        if (JSON_HEDLEY_UNLIKELY(result_remainder != token_type::end_of_input))
+        {
+            return sax->parse_error(chars_read, number_string, parse_error::create(115, chars_read,
+                                    exception_message(input_format, concat("invalid number text: ", number_lexer.get_token_string()), "high-precision number"), nullptr));
+        }
+
+        switch (result_number)
+        {
+            case token_type::value_integer:
+                return sax->number_integer(number_lexer.get_number_integer());
+            case token_type::value_unsigned:
+                return sax->number_unsigned(number_lexer.get_number_unsigned());
+            case token_type::value_float:
+                return sax->number_float(number_lexer.get_number_float(), std::move(number_string));
+            case token_type::uninitialized:
+            case token_type::literal_true:
+            case token_type::literal_false:
+            case token_type::literal_null:
+            case token_type::value_string:
+            case token_type::begin_array:
+            case token_type::begin_object:
+            case token_type::end_array:
+            case token_type::end_object:
+            case token_type::name_separator:
+            case token_type::value_separator:
+            case token_type::parse_error:
+            case token_type::end_of_input:
+            case token_type::literal_or_value:
+            default:
+                return sax->parse_error(chars_read, number_string, parse_error::create(115, chars_read,
+                                        exception_message(input_format, concat("invalid number text: ", number_lexer.get_token_string()), "high-precision number"), nullptr));
+        }
+    }
+
+    ///////////////////////
+    // Utility functions //
+    ///////////////////////
+
+    /*!
+    @brief get next character from the input
+
+    This function provides the interface to the used input adapter. It does
+    not throw in case the input reached EOF, but returns a -'ve valued
+    `std::char_traits<char_type>::eof()` in that case.
+
+    @return character read from the input
+    */
+    char_int_type get()
+    {
+        ++chars_read;
+        return current = ia.get_character();
+    }
+
+    /*!
+    @return character read from the input after ignoring all 'N' entries
+    */
+    char_int_type get_ignore_noop()
+    {
+        do
+        {
+            get();
+        }
+        while (current == 'N');
+
+        return current;
+    }
+
+    /*
+    @brief read a number from the input
+
+    @tparam NumberType the type of the number
+    @param[in] format   the current format (for diagnostics)
+    @param[out] result  number of type @a NumberType
+
+    @return whether conversion completed
+
+    @note This function needs to respect the system's endianness, because
+          bytes in CBOR, MessagePack, and UBJSON are stored in network order
+          (big endian) and therefore need reordering on little endian systems.
+          On the other hand, BSON and BJData use little endian and should reorder
+          on big endian systems.
+    */
+    template<typename NumberType, bool InputIsLittleEndian = false>
+    bool get_number(const input_format_t format, NumberType& result)
+    {
+        // step 1: read input into array with system's byte order
+        std::array<std::uint8_t, sizeof(NumberType)> vec{};
+        for (std::size_t i = 0; i < sizeof(NumberType); ++i)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(format, "number")))
+            {
+                return false;
+            }
+
+            // reverse byte order prior to conversion if necessary
+            if (is_little_endian != (InputIsLittleEndian || format == input_format_t::bjdata))
+            {
+                vec[sizeof(NumberType) - i - 1] = static_cast<std::uint8_t>(current);
+            }
+            else
+            {
+                vec[i] = static_cast<std::uint8_t>(current); // LCOV_EXCL_LINE
+            }
+        }
+
+        // step 2: convert array into number of type T and return
+        std::memcpy(&result, vec.data(), sizeof(NumberType));
+        return true;
+    }
+
+    /*!
+    @brief create a string by reading characters from the input
+
+    @tparam NumberType the type of the number
+    @param[in] format the current format (for diagnostics)
+    @param[in] len number of characters to read
+    @param[out] result string created by reading @a len bytes
+
+    @return whether string creation completed
+
+    @note We can not reserve @a len bytes for the result, because @a len
+          may be too large. Usually, @ref unexpect_eof() detects the end of
+          the input before we run out of string memory.
+    */
+    template<typename NumberType>
+    bool get_string(const input_format_t format,
+                    const NumberType len,
+                    string_t& result)
+    {
+        bool success = true;
+        for (NumberType i = 0; i < len; i++)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(format, "string")))
+            {
+                success = false;
+                break;
+            }
+            result.push_back(static_cast<typename string_t::value_type>(current));
+        }
+        return success;
+    }
+
+    /*!
+    @brief create a byte array by reading bytes from the input
+
+    @tparam NumberType the type of the number
+    @param[in] format the current format (for diagnostics)
+    @param[in] len number of bytes to read
+    @param[out] result byte array created by reading @a len bytes
+
+    @return whether byte array creation completed
+
+    @note We can not reserve @a len bytes for the result, because @a len
+          may be too large. Usually, @ref unexpect_eof() detects the end of
+          the input before we run out of memory.
+    */
+    template<typename NumberType>
+    bool get_binary(const input_format_t format,
+                    const NumberType len,
+                    binary_t& result)
+    {
+        bool success = true;
+        for (NumberType i = 0; i < len; i++)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(format, "binary")))
+            {
+                success = false;
+                break;
+            }
+            result.push_back(static_cast<std::uint8_t>(current));
+        }
+        return success;
+    }
+
+    /*!
+    @param[in] format   the current format (for diagnostics)
+    @param[in] context  further context information (for diagnostics)
+    @return whether the last read character is not EOF
+    */
+    JSON_HEDLEY_NON_NULL(3)
+    bool unexpect_eof(const input_format_t format, const char* context) const
+    {
+        if (JSON_HEDLEY_UNLIKELY(current == std::char_traits<char_type>::eof()))
+        {
+            return sax->parse_error(chars_read, "<end of file>",
+                                    parse_error::create(110, chars_read, exception_message(format, "unexpected end of input", context), nullptr));
+        }
+        return true;
+    }
+
+    /*!
+    @return a string representation of the last read byte
+    */
+    std::string get_token_string() const
+    {
+        std::array<char, 3> cr{{}};
+        static_cast<void>((std::snprintf)(cr.data(), cr.size(), "%.2hhX", static_cast<unsigned char>(current))); // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+        return std::string{cr.data()};
+    }
+
+    /*!
+    @param[in] format   the current format
+    @param[in] detail   a detailed error message
+    @param[in] context  further context information
+    @return a message string to use in the parse_error exceptions
+    */
+    std::string exception_message(const input_format_t format,
+                                  const std::string& detail,
+                                  const std::string& context) const
+    {
+        std::string error_msg = "syntax error while parsing ";
+
+        switch (format)
+        {
+            case input_format_t::cbor:
+                error_msg += "CBOR";
+                break;
+
+            case input_format_t::msgpack:
+                error_msg += "MessagePack";
+                break;
+
+            case input_format_t::ubjson:
+                error_msg += "UBJSON";
+                break;
+
+            case input_format_t::bson:
+                error_msg += "BSON";
+                break;
+
+            case input_format_t::bjdata:
+                error_msg += "BJData";
+                break;
+
+            case input_format_t::json: // LCOV_EXCL_LINE
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+
+        return concat(error_msg, ' ', context, ": ", detail);
+    }
+
+  private:
+    static JSON_INLINE_VARIABLE constexpr std::size_t npos = static_cast<std::size_t>(-1);
+
+    /// input adapter
+    InputAdapterType ia;
+
+    /// the current character
+    char_int_type current = std::char_traits<char_type>::eof();
+
+    /// the number of characters read
+    std::size_t chars_read = 0;
+
+    /// whether we can assume little endianness
+    const bool is_little_endian = little_endianness();
+
+    /// input format
+    const input_format_t input_format = input_format_t::json;
+
+    /// the SAX parser
+    json_sax_t* sax = nullptr;
+
+    // excluded markers in bjdata optimized type
+#define JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_ \
+    make_array<char_int_type>('F', 'H', 'N', 'S', 'T', 'Z', '[', '{')
+
+#define JSON_BINARY_READER_MAKE_BJD_TYPES_MAP_ \
+    make_array<bjd_type>(                      \
+    bjd_type{'C', "char"},                     \
+    bjd_type{'D', "double"},                   \
+    bjd_type{'I', "int16"},                    \
+    bjd_type{'L', "int64"},                    \
+    bjd_type{'M', "uint64"},                   \
+    bjd_type{'U', "uint8"},                    \
+    bjd_type{'d', "single"},                   \
+    bjd_type{'i', "int8"},                     \
+    bjd_type{'l', "int32"},                    \
+    bjd_type{'m', "uint32"},                   \
+    bjd_type{'u', "uint16"})
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    // lookup tables
+    // NOLINTNEXTLINE(cppcoreguidelines-non-private-member-variables-in-classes)
+    const decltype(JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_) bjd_optimized_type_markers =
+        JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_;
+
+    using bjd_type = std::pair<char_int_type, string_t>;
+    // NOLINTNEXTLINE(cppcoreguidelines-non-private-member-variables-in-classes)
+    const decltype(JSON_BINARY_READER_MAKE_BJD_TYPES_MAP_) bjd_types_map =
+        JSON_BINARY_READER_MAKE_BJD_TYPES_MAP_;
+
+#undef JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_
+#undef JSON_BINARY_READER_MAKE_BJD_TYPES_MAP_
+};
+
+#ifndef JSON_HAS_CPP_17
+    template<typename BasicJsonType, typename InputAdapterType, typename SAX>
+    constexpr std::size_t binary_reader<BasicJsonType, InputAdapterType, SAX>::npos;
+#endif
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+// #include <nlohmann/detail/input/lexer.hpp>
+
+// #include <nlohmann/detail/input/parser.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cmath> // isfinite
+#include <cstdint> // uint8_t
+#include <functional> // function
+#include <string> // string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+// #include <nlohmann/detail/input/json_sax.hpp>
+
+// #include <nlohmann/detail/input/lexer.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/is_sax.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+////////////
+// parser //
+////////////
+
+enum class parse_event_t : std::uint8_t
+{
+    /// the parser read `{` and started to process a JSON object
+    object_start,
+    /// the parser read `}` and finished processing a JSON object
+    object_end,
+    /// the parser read `[` and started to process a JSON array
+    array_start,
+    /// the parser read `]` and finished processing a JSON array
+    array_end,
+    /// the parser read a key of a value in an object
+    key,
+    /// the parser finished reading a JSON value
+    value
+};
+
+template<typename BasicJsonType>
+using parser_callback_t =
+    std::function<bool(int /*depth*/, parse_event_t /*event*/, BasicJsonType& /*parsed*/)>;
+
+/*!
+@brief syntax analysis
+
+This class implements a recursive descent parser.
+*/
+template<typename BasicJsonType, typename InputAdapterType>
+class parser
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using lexer_t = lexer<BasicJsonType, InputAdapterType>;
+    using token_type = typename lexer_t::token_type;
+
+  public:
+    /// a parser reading from an input adapter
+    explicit parser(InputAdapterType&& adapter,
+                    const parser_callback_t<BasicJsonType> cb = nullptr,
+                    const bool allow_exceptions_ = true,
+                    const bool skip_comments = false)
+        : callback(cb)
+        , m_lexer(std::move(adapter), skip_comments)
+        , allow_exceptions(allow_exceptions_)
+    {
+        // read first token
+        get_token();
+    }
+
+    /*!
+    @brief public parser interface
+
+    @param[in] strict      whether to expect the last token to be EOF
+    @param[in,out] result  parsed JSON value
+
+    @throw parse_error.101 in case of an unexpected token
+    @throw parse_error.102 if to_unicode fails or surrogate error
+    @throw parse_error.103 if to_unicode fails
+    */
+    void parse(const bool strict, BasicJsonType& result)
+    {
+        if (callback)
+        {
+            json_sax_dom_callback_parser<BasicJsonType> sdp(result, callback, allow_exceptions);
+            sax_parse_internal(&sdp);
+
+            // in strict mode, input must be completely read
+            if (strict && (get_token() != token_type::end_of_input))
+            {
+                sdp.parse_error(m_lexer.get_position(),
+                                m_lexer.get_token_string(),
+                                parse_error::create(101, m_lexer.get_position(),
+                                                    exception_message(token_type::end_of_input, "value"), nullptr));
+            }
+
+            // in case of an error, return discarded value
+            if (sdp.is_errored())
+            {
+                result = value_t::discarded;
+                return;
+            }
+
+            // set top-level value to null if it was discarded by the callback
+            // function
+            if (result.is_discarded())
+            {
+                result = nullptr;
+            }
+        }
+        else
+        {
+            json_sax_dom_parser<BasicJsonType> sdp(result, allow_exceptions);
+            sax_parse_internal(&sdp);
+
+            // in strict mode, input must be completely read
+            if (strict && (get_token() != token_type::end_of_input))
+            {
+                sdp.parse_error(m_lexer.get_position(),
+                                m_lexer.get_token_string(),
+                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_of_input, "value"), nullptr));
+            }
+
+            // in case of an error, return discarded value
+            if (sdp.is_errored())
+            {
+                result = value_t::discarded;
+                return;
+            }
+        }
+
+        result.assert_invariant();
+    }
+
+    /*!
+    @brief public accept interface
+
+    @param[in] strict  whether to expect the last token to be EOF
+    @return whether the input is a proper JSON text
+    */
+    bool accept(const bool strict = true)
+    {
+        json_sax_acceptor<BasicJsonType> sax_acceptor;
+        return sax_parse(&sax_acceptor, strict);
+    }
+
+    template<typename SAX>
+    JSON_HEDLEY_NON_NULL(2)
+    bool sax_parse(SAX* sax, const bool strict = true)
+    {
+        (void)detail::is_sax_static_asserts<SAX, BasicJsonType> {};
+        const bool result = sax_parse_internal(sax);
+
+        // strict mode: next byte must be EOF
+        if (result && strict && (get_token() != token_type::end_of_input))
+        {
+            return sax->parse_error(m_lexer.get_position(),
+                                    m_lexer.get_token_string(),
+                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_of_input, "value"), nullptr));
+        }
+
+        return result;
+    }
+
+  private:
+    template<typename SAX>
+    JSON_HEDLEY_NON_NULL(2)
+    bool sax_parse_internal(SAX* sax)
+    {
+        // stack to remember the hierarchy of structured values we are parsing
+        // true = array; false = object
+        std::vector<bool> states;
+        // value to avoid a goto (see comment where set to true)
+        bool skip_to_state_evaluation = false;
+
+        while (true)
+        {
+            if (!skip_to_state_evaluation)
+            {
+                // invariant: get_token() was called before each iteration
+                switch (last_token)
+                {
+                    case token_type::begin_object:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->start_object(static_cast<std::size_t>(-1))))
+                        {
+                            return false;
+                        }
+
+                        // closing } -> we are done
+                        if (get_token() == token_type::end_object)
+                        {
+                            if (JSON_HEDLEY_UNLIKELY(!sax->end_object()))
+                            {
+                                return false;
+                            }
+                            break;
+                        }
+
+                        // parse key
+                        if (JSON_HEDLEY_UNLIKELY(last_token != token_type::value_string))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::value_string, "object key"), nullptr));
+                        }
+                        if (JSON_HEDLEY_UNLIKELY(!sax->key(m_lexer.get_string())))
+                        {
+                            return false;
+                        }
+
+                        // parse separator (:)
+                        if (JSON_HEDLEY_UNLIKELY(get_token() != token_type::name_separator))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::name_separator, "object separator"), nullptr));
+                        }
+
+                        // remember we are now inside an object
+                        states.push_back(false);
+
+                        // parse values
+                        get_token();
+                        continue;
+                    }
+
+                    case token_type::begin_array:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->start_array(static_cast<std::size_t>(-1))))
+                        {
+                            return false;
+                        }
+
+                        // closing ] -> we are done
+                        if (get_token() == token_type::end_array)
+                        {
+                            if (JSON_HEDLEY_UNLIKELY(!sax->end_array()))
+                            {
+                                return false;
+                            }
+                            break;
+                        }
+
+                        // remember we are now inside an array
+                        states.push_back(true);
+
+                        // parse values (no need to call get_token)
+                        continue;
+                    }
+
+                    case token_type::value_float:
+                    {
+                        const auto res = m_lexer.get_number_float();
+
+                        if (JSON_HEDLEY_UNLIKELY(!std::isfinite(res)))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    out_of_range::create(406, concat("number overflow parsing '", m_lexer.get_token_string(), '\''), nullptr));
+                        }
+
+                        if (JSON_HEDLEY_UNLIKELY(!sax->number_float(res, m_lexer.get_string())))
+                        {
+                            return false;
+                        }
+
+                        break;
+                    }
+
+                    case token_type::literal_false:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->boolean(false)))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::literal_null:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->null()))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::literal_true:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->boolean(true)))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::value_integer:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->number_integer(m_lexer.get_number_integer())))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::value_string:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->string(m_lexer.get_string())))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::value_unsigned:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->number_unsigned(m_lexer.get_number_unsigned())))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::parse_error:
+                    {
+                        // using "uninitialized" to avoid "expected" message
+                        return sax->parse_error(m_lexer.get_position(),
+                                                m_lexer.get_token_string(),
+                                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::uninitialized, "value"), nullptr));
+                    }
+
+                    case token_type::uninitialized:
+                    case token_type::end_array:
+                    case token_type::end_object:
+                    case token_type::name_separator:
+                    case token_type::value_separator:
+                    case token_type::end_of_input:
+                    case token_type::literal_or_value:
+                    default: // the last token was unexpected
+                    {
+                        return sax->parse_error(m_lexer.get_position(),
+                                                m_lexer.get_token_string(),
+                                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::literal_or_value, "value"), nullptr));
+                    }
+                }
+            }
+            else
+            {
+                skip_to_state_evaluation = false;
+            }
+
+            // we reached this line after we successfully parsed a value
+            if (states.empty())
+            {
+                // empty stack: we reached the end of the hierarchy: done
+                return true;
+            }
+
+            if (states.back())  // array
+            {
+                // comma -> next value
+                if (get_token() == token_type::value_separator)
+                {
+                    // parse a new value
+                    get_token();
+                    continue;
+                }
+
+                // closing ]
+                if (JSON_HEDLEY_LIKELY(last_token == token_type::end_array))
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!sax->end_array()))
+                    {
+                        return false;
+                    }
+
+                    // We are done with this array. Before we can parse a
+                    // new value, we need to evaluate the new state first.
+                    // By setting skip_to_state_evaluation to false, we
+                    // are effectively jumping to the beginning of this if.
+                    JSON_ASSERT(!states.empty());
+                    states.pop_back();
+                    skip_to_state_evaluation = true;
+                    continue;
+                }
+
+                return sax->parse_error(m_lexer.get_position(),
+                                        m_lexer.get_token_string(),
+                                        parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_array, "array"), nullptr));
+            }
+
+            // states.back() is false -> object
+
+            // comma -> next value
+            if (get_token() == token_type::value_separator)
+            {
+                // parse key
+                if (JSON_HEDLEY_UNLIKELY(get_token() != token_type::value_string))
+                {
+                    return sax->parse_error(m_lexer.get_position(),
+                                            m_lexer.get_token_string(),
+                                            parse_error::create(101, m_lexer.get_position(), exception_message(token_type::value_string, "object key"), nullptr));
+                }
+
+                if (JSON_HEDLEY_UNLIKELY(!sax->key(m_lexer.get_string())))
+                {
+                    return false;
+                }
+
+                // parse separator (:)
+                if (JSON_HEDLEY_UNLIKELY(get_token() != token_type::name_separator))
+                {
+                    return sax->parse_error(m_lexer.get_position(),
+                                            m_lexer.get_token_string(),
+                                            parse_error::create(101, m_lexer.get_position(), exception_message(token_type::name_separator, "object separator"), nullptr));
+                }
+
+                // parse values
+                get_token();
+                continue;
+            }
+
+            // closing }
+            if (JSON_HEDLEY_LIKELY(last_token == token_type::end_object))
+            {
+                if (JSON_HEDLEY_UNLIKELY(!sax->end_object()))
+                {
+                    return false;
+                }
+
+                // We are done with this object. Before we can parse a
+                // new value, we need to evaluate the new state first.
+                // By setting skip_to_state_evaluation to false, we
+                // are effectively jumping to the beginning of this if.
+                JSON_ASSERT(!states.empty());
+                states.pop_back();
+                skip_to_state_evaluation = true;
+                continue;
+            }
+
+            return sax->parse_error(m_lexer.get_position(),
+                                    m_lexer.get_token_string(),
+                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_object, "object"), nullptr));
+        }
+    }
+
+    /// get next token from lexer
+    token_type get_token()
+    {
+        return last_token = m_lexer.scan();
+    }
+
+    std::string exception_message(const token_type expected, const std::string& context)
+    {
+        std::string error_msg = "syntax error ";
+
+        if (!context.empty())
+        {
+            error_msg += concat("while parsing ", context, ' ');
+        }
+
+        error_msg += "- ";
+
+        if (last_token == token_type::parse_error)
+        {
+            error_msg += concat(m_lexer.get_error_message(), "; last read: '",
+                                m_lexer.get_token_string(), '\'');
+        }
+        else
+        {
+            error_msg += concat("unexpected ", lexer_t::token_type_name(last_token));
+        }
+
+        if (expected != token_type::uninitialized)
+        {
+            error_msg += concat("; expected ", lexer_t::token_type_name(expected));
+        }
+
+        return error_msg;
+    }
+
+  private:
+    /// callback function
+    const parser_callback_t<BasicJsonType> callback = nullptr;
+    /// the type of the last read token
+    token_type last_token = token_type::uninitialized;
+    /// the lexer
+    lexer_t m_lexer;
+    /// whether to throw exceptions in case of errors
+    const bool allow_exceptions = true;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/iterators/internal_iterator.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/iterators/primitive_iterator.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // ptrdiff_t
+#include <limits>  // numeric_limits
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/*
+@brief an iterator for primitive JSON types
+
+This class models an iterator for primitive JSON types (boolean, number,
+string). It's only purpose is to allow the iterator/const_iterator classes
+to "iterate" over primitive values. Internally, the iterator is modeled by
+a `difference_type` variable. Value begin_value (`0`) models the begin,
+end_value (`1`) models past the end.
+*/
+class primitive_iterator_t
+{
+  private:
+    using difference_type = std::ptrdiff_t;
+    static constexpr difference_type begin_value = 0;
+    static constexpr difference_type end_value = begin_value + 1;
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /// iterator as signed integer type
+    difference_type m_it = (std::numeric_limits<std::ptrdiff_t>::min)();
+
+  public:
+    constexpr difference_type get_value() const noexcept
+    {
+        return m_it;
+    }
+
+    /// set iterator to a defined beginning
+    void set_begin() noexcept
+    {
+        m_it = begin_value;
+    }
+
+    /// set iterator to a defined past the end
+    void set_end() noexcept
+    {
+        m_it = end_value;
+    }
+
+    /// return whether the iterator can be dereferenced
+    constexpr bool is_begin() const noexcept
+    {
+        return m_it == begin_value;
+    }
+
+    /// return whether the iterator is at end
+    constexpr bool is_end() const noexcept
+    {
+        return m_it == end_value;
+    }
+
+    friend constexpr bool operator==(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
+    {
+        return lhs.m_it == rhs.m_it;
+    }
+
+    friend constexpr bool operator<(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
+    {
+        return lhs.m_it < rhs.m_it;
+    }
+
+    primitive_iterator_t operator+(difference_type n) noexcept
+    {
+        auto result = *this;
+        result += n;
+        return result;
+    }
+
+    friend constexpr difference_type operator-(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
+    {
+        return lhs.m_it - rhs.m_it;
+    }
+
+    primitive_iterator_t& operator++() noexcept
+    {
+        ++m_it;
+        return *this;
+    }
+
+    primitive_iterator_t operator++(int)& noexcept // NOLINT(cert-dcl21-cpp)
+    {
+        auto result = *this;
+        ++m_it;
+        return result;
+    }
+
+    primitive_iterator_t& operator--() noexcept
+    {
+        --m_it;
+        return *this;
+    }
+
+    primitive_iterator_t operator--(int)& noexcept // NOLINT(cert-dcl21-cpp)
+    {
+        auto result = *this;
+        --m_it;
+        return result;
+    }
+
+    primitive_iterator_t& operator+=(difference_type n) noexcept
+    {
+        m_it += n;
+        return *this;
+    }
+
+    primitive_iterator_t& operator-=(difference_type n) noexcept
+    {
+        m_it -= n;
+        return *this;
+    }
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/*!
+@brief an iterator value
+
+@note This structure could easily be a union, but MSVC currently does not allow
+unions members with complex constructors, see https://github.com/nlohmann/json/pull/105.
+*/
+template<typename BasicJsonType> struct internal_iterator
+{
+    /// iterator for JSON objects
+    typename BasicJsonType::object_t::iterator object_iterator {};
+    /// iterator for JSON arrays
+    typename BasicJsonType::array_t::iterator array_iterator {};
+    /// generic iterator for all other types
+    primitive_iterator_t primitive_iterator {};
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/iterators/iter_impl.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <iterator> // iterator, random_access_iterator_tag, bidirectional_iterator_tag, advance, next
+#include <type_traits> // conditional, is_const, remove_const
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/iterators/internal_iterator.hpp>
+
+// #include <nlohmann/detail/iterators/primitive_iterator.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+// forward declare, to be able to friend it later on
+template<typename IteratorType> class iteration_proxy;
+template<typename IteratorType> class iteration_proxy_value;
+
+/*!
+@brief a template for a bidirectional iterator for the @ref basic_json class
+This class implements a both iterators (iterator and const_iterator) for the
+@ref basic_json class.
+@note An iterator is called *initialized* when a pointer to a JSON value has
+      been set (e.g., by a constructor or a copy assignment). If the iterator is
+      default-constructed, it is *uninitialized* and most methods are undefined.
+      **The library uses assertions to detect calls on uninitialized iterators.**
+@requirement The class satisfies the following concept requirements:
+-
+[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator):
+  The iterator that can be moved can be moved in both directions (i.e.
+  incremented and decremented).
+@since version 1.0.0, simplified in version 2.0.9, change to bidirectional
+       iterators in version 3.0.0 (see https://github.com/nlohmann/json/issues/593)
+*/
+template<typename BasicJsonType>
+class iter_impl // NOLINT(cppcoreguidelines-special-member-functions,hicpp-special-member-functions)
+{
+    /// the iterator with BasicJsonType of different const-ness
+    using other_iter_impl = iter_impl<typename std::conditional<std::is_const<BasicJsonType>::value, typename std::remove_const<BasicJsonType>::type, const BasicJsonType>::type>;
+    /// allow basic_json to access private members
+    friend other_iter_impl;
+    friend BasicJsonType;
+    friend iteration_proxy<iter_impl>;
+    friend iteration_proxy_value<iter_impl>;
+
+    using object_t = typename BasicJsonType::object_t;
+    using array_t = typename BasicJsonType::array_t;
+    // make sure BasicJsonType is basic_json or const basic_json
+    static_assert(is_basic_json<typename std::remove_const<BasicJsonType>::type>::value,
+                  "iter_impl only accepts (const) basic_json");
+    // superficial check for the LegacyBidirectionalIterator named requirement
+    static_assert(std::is_base_of<std::bidirectional_iterator_tag, std::bidirectional_iterator_tag>::value
+                  &&  std::is_base_of<std::bidirectional_iterator_tag, typename std::iterator_traits<typename array_t::iterator>::iterator_category>::value,
+                  "basic_json iterator assumes array and object type iterators satisfy the LegacyBidirectionalIterator named requirement.");
+
+  public:
+    /// The std::iterator class template (used as a base class to provide typedefs) is deprecated in C++17.
+    /// The C++ Standard has never required user-defined iterators to derive from std::iterator.
+    /// A user-defined iterator should provide publicly accessible typedefs named
+    /// iterator_category, value_type, difference_type, pointer, and reference.
+    /// Note that value_type is required to be non-const, even for constant iterators.
+    using iterator_category = std::bidirectional_iterator_tag;
+
+    /// the type of the values when the iterator is dereferenced
+    using value_type = typename BasicJsonType::value_type;
+    /// a type to represent differences between iterators
+    using difference_type = typename BasicJsonType::difference_type;
+    /// defines a pointer to the type iterated over (value_type)
+    using pointer = typename std::conditional<std::is_const<BasicJsonType>::value,
+          typename BasicJsonType::const_pointer,
+          typename BasicJsonType::pointer>::type;
+    /// defines a reference to the type iterated over (value_type)
+    using reference =
+        typename std::conditional<std::is_const<BasicJsonType>::value,
+        typename BasicJsonType::const_reference,
+        typename BasicJsonType::reference>::type;
+
+    iter_impl() = default;
+    ~iter_impl() = default;
+    iter_impl(iter_impl&&) noexcept = default;
+    iter_impl& operator=(iter_impl&&) noexcept = default;
+
+    /*!
+    @brief constructor for a given JSON instance
+    @param[in] object  pointer to a JSON object for this iterator
+    @pre object != nullptr
+    @post The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    explicit iter_impl(pointer object) noexcept : m_object(object)
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                m_it.object_iterator = typename object_t::iterator();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_it.array_iterator = typename array_t::iterator();
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                m_it.primitive_iterator = primitive_iterator_t();
+                break;
+            }
+        }
+    }
+
+    /*!
+    @note The conventional copy constructor and copy assignment are implicitly
+          defined. Combined with the following converting constructor and
+          assignment, they support: (1) copy from iterator to iterator, (2)
+          copy from const iterator to const iterator, and (3) conversion from
+          iterator to const iterator. However conversion from const iterator
+          to iterator is not defined.
+    */
+
+    /*!
+    @brief const copy constructor
+    @param[in] other const iterator to copy from
+    @note This copy constructor had to be defined explicitly to circumvent a bug
+          occurring on msvc v19.0 compiler (VS 2015) debug build. For more
+          information refer to: https://github.com/nlohmann/json/issues/1608
+    */
+    iter_impl(const iter_impl<const BasicJsonType>& other) noexcept
+        : m_object(other.m_object), m_it(other.m_it)
+    {}
+
+    /*!
+    @brief converting assignment
+    @param[in] other const iterator to copy from
+    @return const/non-const iterator
+    @note It is not checked whether @a other is initialized.
+    */
+    iter_impl& operator=(const iter_impl<const BasicJsonType>& other) noexcept
+    {
+        if (&other != this)
+        {
+            m_object = other.m_object;
+            m_it = other.m_it;
+        }
+        return *this;
+    }
+
+    /*!
+    @brief converting constructor
+    @param[in] other  non-const iterator to copy from
+    @note It is not checked whether @a other is initialized.
+    */
+    iter_impl(const iter_impl<typename std::remove_const<BasicJsonType>::type>& other) noexcept
+        : m_object(other.m_object), m_it(other.m_it)
+    {}
+
+    /*!
+    @brief converting assignment
+    @param[in] other  non-const iterator to copy from
+    @return const/non-const iterator
+    @note It is not checked whether @a other is initialized.
+    */
+    iter_impl& operator=(const iter_impl<typename std::remove_const<BasicJsonType>::type>& other) noexcept // NOLINT(cert-oop54-cpp)
+    {
+        m_object = other.m_object;
+        m_it = other.m_it;
+        return *this;
+    }
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /*!
+    @brief set the iterator to the first value
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    void set_begin() noexcept
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                m_it.object_iterator = m_object->m_value.object->begin();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_it.array_iterator = m_object->m_value.array->begin();
+                break;
+            }
+
+            case value_t::null:
+            {
+                // set to end so begin()==end() is true: null is empty
+                m_it.primitive_iterator.set_end();
+                break;
+            }
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                m_it.primitive_iterator.set_begin();
+                break;
+            }
+        }
+    }
+
+    /*!
+    @brief set the iterator past the last value
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    void set_end() noexcept
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                m_it.object_iterator = m_object->m_value.object->end();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_it.array_iterator = m_object->m_value.array->end();
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                m_it.primitive_iterator.set_end();
+                break;
+            }
+        }
+    }
+
+  public:
+    /*!
+    @brief return a reference to the value pointed to by the iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    reference operator*() const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                JSON_ASSERT(m_it.object_iterator != m_object->m_value.object->end());
+                return m_it.object_iterator->second;
+            }
+
+            case value_t::array:
+            {
+                JSON_ASSERT(m_it.array_iterator != m_object->m_value.array->end());
+                return *m_it.array_iterator;
+            }
+
+            case value_t::null:
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                if (JSON_HEDLEY_LIKELY(m_it.primitive_iterator.is_begin()))
+                {
+                    return *m_object;
+                }
+
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+            }
+        }
+    }
+
+    /*!
+    @brief dereference the iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    pointer operator->() const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                JSON_ASSERT(m_it.object_iterator != m_object->m_value.object->end());
+                return &(m_it.object_iterator->second);
+            }
+
+            case value_t::array:
+            {
+                JSON_ASSERT(m_it.array_iterator != m_object->m_value.array->end());
+                return &*m_it.array_iterator;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                if (JSON_HEDLEY_LIKELY(m_it.primitive_iterator.is_begin()))
+                {
+                    return m_object;
+                }
+
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+            }
+        }
+    }
+
+    /*!
+    @brief post-increment (it++)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator++(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        auto result = *this;
+        ++(*this);
+        return result;
+    }
+
+    /*!
+    @brief pre-increment (++it)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator++()
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                std::advance(m_it.object_iterator, 1);
+                break;
+            }
+
+            case value_t::array:
+            {
+                std::advance(m_it.array_iterator, 1);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                ++m_it.primitive_iterator;
+                break;
+            }
+        }
+
+        return *this;
+    }
+
+    /*!
+    @brief post-decrement (it--)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator--(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        auto result = *this;
+        --(*this);
+        return result;
+    }
+
+    /*!
+    @brief pre-decrement (--it)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator--()
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                std::advance(m_it.object_iterator, -1);
+                break;
+            }
+
+            case value_t::array:
+            {
+                std::advance(m_it.array_iterator, -1);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                --m_it.primitive_iterator;
+                break;
+            }
+        }
+
+        return *this;
+    }
+
+    /*!
+    @brief comparison: equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    template < typename IterImpl, detail::enable_if_t < (std::is_same<IterImpl, iter_impl>::value || std::is_same<IterImpl, other_iter_impl>::value), std::nullptr_t > = nullptr >
+    bool operator==(const IterImpl& other) const
+    {
+        // if objects are not the same, the comparison is undefined
+        if (JSON_HEDLEY_UNLIKELY(m_object != other.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers", m_object));
+        }
+
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                return (m_it.object_iterator == other.m_it.object_iterator);
+
+            case value_t::array:
+                return (m_it.array_iterator == other.m_it.array_iterator);
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                return (m_it.primitive_iterator == other.m_it.primitive_iterator);
+        }
+    }
+
+    /*!
+    @brief comparison: not equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    template < typename IterImpl, detail::enable_if_t < (std::is_same<IterImpl, iter_impl>::value || std::is_same<IterImpl, other_iter_impl>::value), std::nullptr_t > = nullptr >
+    bool operator!=(const IterImpl& other) const
+    {
+        return !operator==(other);
+    }
+
+    /*!
+    @brief comparison: smaller
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator<(const iter_impl& other) const
+    {
+        // if objects are not the same, the comparison is undefined
+        if (JSON_HEDLEY_UNLIKELY(m_object != other.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers", m_object));
+        }
+
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(213, "cannot compare order of object iterators", m_object));
+
+            case value_t::array:
+                return (m_it.array_iterator < other.m_it.array_iterator);
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                return (m_it.primitive_iterator < other.m_it.primitive_iterator);
+        }
+    }
+
+    /*!
+    @brief comparison: less than or equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator<=(const iter_impl& other) const
+    {
+        return !other.operator < (*this);
+    }
+
+    /*!
+    @brief comparison: greater than
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator>(const iter_impl& other) const
+    {
+        return !operator<=(other);
+    }
+
+    /*!
+    @brief comparison: greater than or equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator>=(const iter_impl& other) const
+    {
+        return !operator<(other);
+    }
+
+    /*!
+    @brief add to iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator+=(difference_type i)
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators", m_object));
+
+            case value_t::array:
+            {
+                std::advance(m_it.array_iterator, i);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                m_it.primitive_iterator += i;
+                break;
+            }
+        }
+
+        return *this;
+    }
+
+    /*!
+    @brief subtract from iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator-=(difference_type i)
+    {
+        return operator+=(-i);
+    }
+
+    /*!
+    @brief add to iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator+(difference_type i) const
+    {
+        auto result = *this;
+        result += i;
+        return result;
+    }
+
+    /*!
+    @brief addition of distance and iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    friend iter_impl operator+(difference_type i, const iter_impl& it)
+    {
+        auto result = it;
+        result += i;
+        return result;
+    }
+
+    /*!
+    @brief subtract from iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator-(difference_type i) const
+    {
+        auto result = *this;
+        result -= i;
+        return result;
+    }
+
+    /*!
+    @brief return difference
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    difference_type operator-(const iter_impl& other) const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators", m_object));
+
+            case value_t::array:
+                return m_it.array_iterator - other.m_it.array_iterator;
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                return m_it.primitive_iterator - other.m_it.primitive_iterator;
+        }
+    }
+
+    /*!
+    @brief access to successor
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    reference operator[](difference_type n) const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(208, "cannot use operator[] for object iterators", m_object));
+
+            case value_t::array:
+                return *std::next(m_it.array_iterator, n);
+
+            case value_t::null:
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                if (JSON_HEDLEY_LIKELY(m_it.primitive_iterator.get_value() == -n))
+                {
+                    return *m_object;
+                }
+
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+            }
+        }
+    }
+
+    /*!
+    @brief return the key of an object iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    const typename object_t::key_type& key() const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        if (JSON_HEDLEY_LIKELY(m_object->is_object()))
+        {
+            return m_it.object_iterator->first;
+        }
+
+        JSON_THROW(invalid_iterator::create(207, "cannot use key() for non-object iterators", m_object));
+    }
+
+    /*!
+    @brief return the value of an iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    reference value() const
+    {
+        return operator*();
+    }
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /// associated JSON instance
+    pointer m_object = nullptr;
+    /// the actual iterator of the associated instance
+    internal_iterator<typename std::remove_const<BasicJsonType>::type> m_it {};
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/iterators/iteration_proxy.hpp>
+
+// #include <nlohmann/detail/iterators/json_reverse_iterator.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // ptrdiff_t
+#include <iterator> // reverse_iterator
+#include <utility> // declval
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+//////////////////////
+// reverse_iterator //
+//////////////////////
+
+/*!
+@brief a template for a reverse iterator class
+
+@tparam Base the base iterator type to reverse. Valid types are @ref
+iterator (to create @ref reverse_iterator) and @ref const_iterator (to
+create @ref const_reverse_iterator).
+
+@requirement The class satisfies the following concept requirements:
+-
+[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator):
+  The iterator that can be moved can be moved in both directions (i.e.
+  incremented and decremented).
+- [OutputIterator](https://en.cppreference.com/w/cpp/named_req/OutputIterator):
+  It is possible to write to the pointed-to element (only if @a Base is
+  @ref iterator).
+
+@since version 1.0.0
+*/
+template<typename Base>
+class json_reverse_iterator : public std::reverse_iterator<Base>
+{
+  public:
+    using difference_type = std::ptrdiff_t;
+    /// shortcut to the reverse iterator adapter
+    using base_iterator = std::reverse_iterator<Base>;
+    /// the reference type for the pointed-to element
+    using reference = typename Base::reference;
+
+    /// create reverse iterator from iterator
+    explicit json_reverse_iterator(const typename base_iterator::iterator_type& it) noexcept
+        : base_iterator(it) {}
+
+    /// create reverse iterator from base class
+    explicit json_reverse_iterator(const base_iterator& it) noexcept : base_iterator(it) {}
+
+    /// post-increment (it++)
+    json_reverse_iterator operator++(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator++(1));
+    }
+
+    /// pre-increment (++it)
+    json_reverse_iterator& operator++()
+    {
+        return static_cast<json_reverse_iterator&>(base_iterator::operator++());
+    }
+
+    /// post-decrement (it--)
+    json_reverse_iterator operator--(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator--(1));
+    }
+
+    /// pre-decrement (--it)
+    json_reverse_iterator& operator--()
+    {
+        return static_cast<json_reverse_iterator&>(base_iterator::operator--());
+    }
+
+    /// add to iterator
+    json_reverse_iterator& operator+=(difference_type i)
+    {
+        return static_cast<json_reverse_iterator&>(base_iterator::operator+=(i));
+    }
+
+    /// add to iterator
+    json_reverse_iterator operator+(difference_type i) const
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator+(i));
+    }
+
+    /// subtract from iterator
+    json_reverse_iterator operator-(difference_type i) const
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator-(i));
+    }
+
+    /// return difference
+    difference_type operator-(const json_reverse_iterator& other) const
+    {
+        return base_iterator(*this) - base_iterator(other);
+    }
+
+    /// access to successor
+    reference operator[](difference_type n) const
+    {
+        return *(this->operator+(n));
+    }
+
+    /// return the key of an object iterator
+    auto key() const -> decltype(std::declval<Base>().key())
+    {
+        auto it = --this->base();
+        return it.key();
+    }
+
+    /// return the value of an iterator
+    reference value() const
+    {
+        auto it = --this->base();
+        return it.operator * ();
+    }
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/iterators/primitive_iterator.hpp>
+
+// #include <nlohmann/detail/json_pointer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // all_of
+#include <cctype> // isdigit
+#include <cerrno> // errno, ERANGE
+#include <cstdlib> // strtoull
+#ifndef JSON_NO_IO
+    #include <iosfwd> // ostream
+#endif  // JSON_NO_IO
+#include <limits> // max
+#include <numeric> // accumulate
+#include <string> // string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/string_escape.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/// @brief JSON Pointer defines a string syntax for identifying a specific value within a JSON document
+/// @sa https://json.nlohmann.me/api/json_pointer/
+template<typename RefStringType>
+class json_pointer
+{
+    // allow basic_json to access private members
+    NLOHMANN_BASIC_JSON_TPL_DECLARATION
+    friend class basic_json;
+
+    template<typename>
+    friend class json_pointer;
+
+    template<typename T>
+    struct string_t_helper
+    {
+        using type = T;
+    };
+
+    NLOHMANN_BASIC_JSON_TPL_DECLARATION
+    struct string_t_helper<NLOHMANN_BASIC_JSON_TPL>
+    {
+        using type = StringType;
+    };
+
+  public:
+    // for backwards compatibility accept BasicJsonType
+    using string_t = typename string_t_helper<RefStringType>::type;
+
+    /// @brief create JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/json_pointer/
+    explicit json_pointer(const string_t& s = "")
+        : reference_tokens(split(s))
+    {}
+
+    /// @brief return a string representation of the JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/to_string/
+    string_t to_string() const
+    {
+        return std::accumulate(reference_tokens.begin(), reference_tokens.end(),
+                               string_t{},
+                               [](const string_t& a, const string_t& b)
+        {
+            return detail::concat(a, '/', detail::escape(b));
+        });
+    }
+
+    /// @brief return a string representation of the JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_string/
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, to_string())
+    operator string_t() const
+    {
+        return to_string();
+    }
+
+#ifndef JSON_NO_IO
+    /// @brief write string representation of the JSON pointer to stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ltlt/
+    friend std::ostream& operator<<(std::ostream& o, const json_pointer& ptr)
+    {
+        o << ptr.to_string();
+        return o;
+    }
+#endif
+
+    /// @brief append another JSON pointer at the end of this JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slasheq/
+    json_pointer& operator/=(const json_pointer& ptr)
+    {
+        reference_tokens.insert(reference_tokens.end(),
+                                ptr.reference_tokens.begin(),
+                                ptr.reference_tokens.end());
+        return *this;
+    }
+
+    /// @brief append an unescaped reference token at the end of this JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slasheq/
+    json_pointer& operator/=(string_t token)
+    {
+        push_back(std::move(token));
+        return *this;
+    }
+
+    /// @brief append an array index at the end of this JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slasheq/
+    json_pointer& operator/=(std::size_t array_idx)
+    {
+        return *this /= std::to_string(array_idx);
+    }
+
+    /// @brief create a new JSON pointer by appending the right JSON pointer at the end of the left JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slash/
+    friend json_pointer operator/(const json_pointer& lhs,
+                                  const json_pointer& rhs)
+    {
+        return json_pointer(lhs) /= rhs;
+    }
+
+    /// @brief create a new JSON pointer by appending the unescaped token at the end of the JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slash/
+    friend json_pointer operator/(const json_pointer& lhs, string_t token) // NOLINT(performance-unnecessary-value-param)
+    {
+        return json_pointer(lhs) /= std::move(token);
+    }
+
+    /// @brief create a new JSON pointer by appending the array-index-token at the end of the JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slash/
+    friend json_pointer operator/(const json_pointer& lhs, std::size_t array_idx)
+    {
+        return json_pointer(lhs) /= array_idx;
+    }
+
+    /// @brief returns the parent of this JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/parent_pointer/
+    json_pointer parent_pointer() const
+    {
+        if (empty())
+        {
+            return *this;
+        }
+
+        json_pointer res = *this;
+        res.pop_back();
+        return res;
+    }
+
+    /// @brief remove last reference token
+    /// @sa https://json.nlohmann.me/api/json_pointer/pop_back/
+    void pop_back()
+    {
+        if (JSON_HEDLEY_UNLIKELY(empty()))
+        {
+            JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent", nullptr));
+        }
+
+        reference_tokens.pop_back();
+    }
+
+    /// @brief return last reference token
+    /// @sa https://json.nlohmann.me/api/json_pointer/back/
+    const string_t& back() const
+    {
+        if (JSON_HEDLEY_UNLIKELY(empty()))
+        {
+            JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent", nullptr));
+        }
+
+        return reference_tokens.back();
+    }
+
+    /// @brief append an unescaped token at the end of the reference pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/push_back/
+    void push_back(const string_t& token)
+    {
+        reference_tokens.push_back(token);
+    }
+
+    /// @brief append an unescaped token at the end of the reference pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/push_back/
+    void push_back(string_t&& token)
+    {
+        reference_tokens.push_back(std::move(token));
+    }
+
+    /// @brief return whether pointer points to the root document
+    /// @sa https://json.nlohmann.me/api/json_pointer/empty/
+    bool empty() const noexcept
+    {
+        return reference_tokens.empty();
+    }
+
+  private:
+    /*!
+    @param[in] s  reference token to be converted into an array index
+
+    @return integer representation of @a s
+
+    @throw parse_error.106  if an array index begins with '0'
+    @throw parse_error.109  if an array index begins not with a digit
+    @throw out_of_range.404 if string @a s could not be converted to an integer
+    @throw out_of_range.410 if an array index exceeds size_type
+    */
+    template<typename BasicJsonType>
+    static typename BasicJsonType::size_type array_index(const string_t& s)
+    {
+        using size_type = typename BasicJsonType::size_type;
+
+        // error condition (cf. RFC 6901, Sect. 4)
+        if (JSON_HEDLEY_UNLIKELY(s.size() > 1 && s[0] == '0'))
+        {
+            JSON_THROW(detail::parse_error::create(106, 0, detail::concat("array index '", s, "' must not begin with '0'"), nullptr));
+        }
+
+        // error condition (cf. RFC 6901, Sect. 4)
+        if (JSON_HEDLEY_UNLIKELY(s.size() > 1 && !(s[0] >= '1' && s[0] <= '9')))
+        {
+            JSON_THROW(detail::parse_error::create(109, 0, detail::concat("array index '", s, "' is not a number"), nullptr));
+        }
+
+        const char* p = s.c_str();
+        char* p_end = nullptr;
+        errno = 0; // strtoull doesn't reset errno
+        unsigned long long res = std::strtoull(p, &p_end, 10); // NOLINT(runtime/int)
+        if (p == p_end // invalid input or empty string
+                || errno == ERANGE // out of range
+                || JSON_HEDLEY_UNLIKELY(static_cast<std::size_t>(p_end - p) != s.size())) // incomplete read
+        {
+            JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", s, "'"), nullptr));
+        }
+
+        // only triggered on special platforms (like 32bit), see also
+        // https://github.com/nlohmann/json/pull/2203
+        if (res >= static_cast<unsigned long long>((std::numeric_limits<size_type>::max)()))  // NOLINT(runtime/int)
+        {
+            JSON_THROW(detail::out_of_range::create(410, detail::concat("array index ", s, " exceeds size_type"), nullptr));   // LCOV_EXCL_LINE
+        }
+
+        return static_cast<size_type>(res);
+    }
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    json_pointer top() const
+    {
+        if (JSON_HEDLEY_UNLIKELY(empty()))
+        {
+            JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent", nullptr));
+        }
+
+        json_pointer result = *this;
+        result.reference_tokens = {reference_tokens[0]};
+        return result;
+    }
+
+  private:
+    /*!
+    @brief create and return a reference to the pointed to value
+
+    @complexity Linear in the number of reference tokens.
+
+    @throw parse_error.109 if array index is not a number
+    @throw type_error.313 if value cannot be unflattened
+    */
+    template<typename BasicJsonType>
+    BasicJsonType& get_and_create(BasicJsonType& j) const
+    {
+        auto* result = &j;
+
+        // in case no reference tokens exist, return a reference to the JSON value
+        // j which will be overwritten by a primitive value
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (result->type())
+            {
+                case detail::value_t::null:
+                {
+                    if (reference_token == "0")
+                    {
+                        // start a new array if reference token is 0
+                        result = &result->operator[](0);
+                    }
+                    else
+                    {
+                        // start a new object otherwise
+                        result = &result->operator[](reference_token);
+                    }
+                    break;
+                }
+
+                case detail::value_t::object:
+                {
+                    // create an entry in the object
+                    result = &result->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    // create an entry in the array
+                    result = &result->operator[](array_index<BasicJsonType>(reference_token));
+                    break;
+                }
+
+                /*
+                The following code is only reached if there exists a reference
+                token _and_ the current value is primitive. In this case, we have
+                an error situation, because primitive values may only occur as
+                single value; that is, with an empty list of reference tokens.
+                */
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::type_error::create(313, "invalid value to unflatten", &j));
+            }
+        }
+
+        return *result;
+    }
+
+    /*!
+    @brief return a reference to the pointed to value
+
+    @note This version does not throw if a value is not present, but tries to
+          create nested values instead. For instance, calling this function
+          with pointer `"/this/that"` on a null value is equivalent to calling
+          `operator[]("this").operator[]("that")` on that value, effectively
+          changing the null value to an object.
+
+    @param[in] ptr  a JSON value
+
+    @return reference to the JSON value pointed to by the JSON pointer
+
+    @complexity Linear in the length of the JSON pointer.
+
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    template<typename BasicJsonType>
+    BasicJsonType& get_unchecked(BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            // convert null values to arrays or objects before continuing
+            if (ptr->is_null())
+            {
+                // check if reference token is a number
+                const bool nums =
+                    std::all_of(reference_token.begin(), reference_token.end(),
+                                [](const unsigned char x)
+                {
+                    return std::isdigit(x);
+                });
+
+                // change value to array for numbers or "-" or to object otherwise
+                *ptr = (nums || reference_token == "-")
+                       ? detail::value_t::array
+                       : detail::value_t::object;
+            }
+
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    // use unchecked object access
+                    ptr = &ptr->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (reference_token == "-")
+                    {
+                        // explicitly treat "-" as index beyond the end
+                        ptr = &ptr->operator[](ptr->m_value.array->size());
+                    }
+                    else
+                    {
+                        // convert array index to number; unchecked access
+                        ptr = &ptr->operator[](array_index<BasicJsonType>(reference_token));
+                    }
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", reference_token, "'"), ptr));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    template<typename BasicJsonType>
+    BasicJsonType& get_checked(BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    // note: at performs range check
+                    ptr = &ptr->at(reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" always fails the range check
+                        JSON_THROW(detail::out_of_range::create(402, detail::concat(
+                                "array index '-' (", std::to_string(ptr->m_value.array->size()),
+                                ") is out of range"), ptr));
+                    }
+
+                    // note: at performs range check
+                    ptr = &ptr->at(array_index<BasicJsonType>(reference_token));
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", reference_token, "'"), ptr));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @brief return a const reference to the pointed to value
+
+    @param[in] ptr  a JSON value
+
+    @return const reference to the JSON value pointed to by the JSON
+    pointer
+
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    template<typename BasicJsonType>
+    const BasicJsonType& get_unchecked(const BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    // use unchecked object access
+                    ptr = &ptr->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" cannot be used for const access
+                        JSON_THROW(detail::out_of_range::create(402, detail::concat("array index '-' (", std::to_string(ptr->m_value.array->size()), ") is out of range"), ptr));
+                    }
+
+                    // use unchecked array access
+                    ptr = &ptr->operator[](array_index<BasicJsonType>(reference_token));
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", reference_token, "'"), ptr));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    template<typename BasicJsonType>
+    const BasicJsonType& get_checked(const BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    // note: at performs range check
+                    ptr = &ptr->at(reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" always fails the range check
+                        JSON_THROW(detail::out_of_range::create(402, detail::concat(
+                                "array index '-' (", std::to_string(ptr->m_value.array->size()),
+                                ") is out of range"), ptr));
+                    }
+
+                    // note: at performs range check
+                    ptr = &ptr->at(array_index<BasicJsonType>(reference_token));
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", reference_token, "'"), ptr));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    */
+    template<typename BasicJsonType>
+    bool contains(const BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    if (!ptr->contains(reference_token))
+                    {
+                        // we did not find the key in the object
+                        return false;
+                    }
+
+                    ptr = &ptr->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" always fails the range check
+                        return false;
+                    }
+                    if (JSON_HEDLEY_UNLIKELY(reference_token.size() == 1 && !("0" <= reference_token && reference_token <= "9")))
+                    {
+                        // invalid char
+                        return false;
+                    }
+                    if (JSON_HEDLEY_UNLIKELY(reference_token.size() > 1))
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!('1' <= reference_token[0] && reference_token[0] <= '9')))
+                        {
+                            // first char should be between '1' and '9'
+                            return false;
+                        }
+                        for (std::size_t i = 1; i < reference_token.size(); i++)
+                        {
+                            if (JSON_HEDLEY_UNLIKELY(!('0' <= reference_token[i] && reference_token[i] <= '9')))
+                            {
+                                // other char should be between '0' and '9'
+                                return false;
+                            }
+                        }
+                    }
+
+                    const auto idx = array_index<BasicJsonType>(reference_token);
+                    if (idx >= ptr->size())
+                    {
+                        // index out of range
+                        return false;
+                    }
+
+                    ptr = &ptr->operator[](idx);
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                {
+                    // we do not expect primitive values if there is still a
+                    // reference token to process
+                    return false;
+                }
+            }
+        }
+
+        // no reference token left means we found a primitive value
+        return true;
+    }
+
+    /*!
+    @brief split the string input to reference tokens
+
+    @note This function is only called by the json_pointer constructor.
+          All exceptions below are documented there.
+
+    @throw parse_error.107  if the pointer is not empty or begins with '/'
+    @throw parse_error.108  if character '~' is not followed by '0' or '1'
+    */
+    static std::vector<string_t> split(const string_t& reference_string)
+    {
+        std::vector<string_t> result;
+
+        // special case: empty reference string -> no reference tokens
+        if (reference_string.empty())
+        {
+            return result;
+        }
+
+        // check if nonempty reference string begins with slash
+        if (JSON_HEDLEY_UNLIKELY(reference_string[0] != '/'))
+        {
+            JSON_THROW(detail::parse_error::create(107, 1, detail::concat("JSON pointer must be empty or begin with '/' - was: '", reference_string, "'"), nullptr));
+        }
+
+        // extract the reference tokens:
+        // - slash: position of the last read slash (or end of string)
+        // - start: position after the previous slash
+        for (
+            // search for the first slash after the first character
+            std::size_t slash = reference_string.find_first_of('/', 1),
+            // set the beginning of the first reference token
+            start = 1;
+            // we can stop if start == 0 (if slash == string_t::npos)
+            start != 0;
+            // set the beginning of the next reference token
+            // (will eventually be 0 if slash == string_t::npos)
+            start = (slash == string_t::npos) ? 0 : slash + 1,
+            // find next slash
+            slash = reference_string.find_first_of('/', start))
+        {
+            // use the text between the beginning of the reference token
+            // (start) and the last slash (slash).
+            auto reference_token = reference_string.substr(start, slash - start);
+
+            // check reference tokens are properly escaped
+            for (std::size_t pos = reference_token.find_first_of('~');
+                    pos != string_t::npos;
+                    pos = reference_token.find_first_of('~', pos + 1))
+            {
+                JSON_ASSERT(reference_token[pos] == '~');
+
+                // ~ must be followed by 0 or 1
+                if (JSON_HEDLEY_UNLIKELY(pos == reference_token.size() - 1 ||
+                                         (reference_token[pos + 1] != '0' &&
+                                          reference_token[pos + 1] != '1')))
+                {
+                    JSON_THROW(detail::parse_error::create(108, 0, "escape character '~' must be followed with '0' or '1'", nullptr));
+                }
+            }
+
+            // finally, store the reference token
+            detail::unescape(reference_token);
+            result.push_back(reference_token);
+        }
+
+        return result;
+    }
+
+  private:
+    /*!
+    @param[in] reference_string  the reference string to the current value
+    @param[in] value             the value to consider
+    @param[in,out] result        the result object to insert values to
+
+    @note Empty objects or arrays are flattened to `null`.
+    */
+    template<typename BasicJsonType>
+    static void flatten(const string_t& reference_string,
+                        const BasicJsonType& value,
+                        BasicJsonType& result)
+    {
+        switch (value.type())
+        {
+            case detail::value_t::array:
+            {
+                if (value.m_value.array->empty())
+                {
+                    // flatten empty array as null
+                    result[reference_string] = nullptr;
+                }
+                else
+                {
+                    // iterate array and use index as reference string
+                    for (std::size_t i = 0; i < value.m_value.array->size(); ++i)
+                    {
+                        flatten(detail::concat(reference_string, '/', std::to_string(i)),
+                                value.m_value.array->operator[](i), result);
+                    }
+                }
+                break;
+            }
+
+            case detail::value_t::object:
+            {
+                if (value.m_value.object->empty())
+                {
+                    // flatten empty object as null
+                    result[reference_string] = nullptr;
+                }
+                else
+                {
+                    // iterate object and use keys as reference string
+                    for (const auto& element : *value.m_value.object)
+                    {
+                        flatten(detail::concat(reference_string, '/', detail::escape(element.first)), element.second, result);
+                    }
+                }
+                break;
+            }
+
+            case detail::value_t::null:
+            case detail::value_t::string:
+            case detail::value_t::boolean:
+            case detail::value_t::number_integer:
+            case detail::value_t::number_unsigned:
+            case detail::value_t::number_float:
+            case detail::value_t::binary:
+            case detail::value_t::discarded:
+            default:
+            {
+                // add primitive value with its reference string
+                result[reference_string] = value;
+                break;
+            }
+        }
+    }
+
+    /*!
+    @param[in] value  flattened JSON
+
+    @return unflattened JSON
+
+    @throw parse_error.109 if array index is not a number
+    @throw type_error.314  if value is not an object
+    @throw type_error.315  if object values are not primitive
+    @throw type_error.313  if value cannot be unflattened
+    */
+    template<typename BasicJsonType>
+    static BasicJsonType
+    unflatten(const BasicJsonType& value)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!value.is_object()))
+        {
+            JSON_THROW(detail::type_error::create(314, "only objects can be unflattened", &value));
+        }
+
+        BasicJsonType result;
+
+        // iterate the JSON object values
+        for (const auto& element : *value.m_value.object)
+        {
+            if (JSON_HEDLEY_UNLIKELY(!element.second.is_primitive()))
+            {
+                JSON_THROW(detail::type_error::create(315, "values in object must be primitive", &element.second));
+            }
+
+            // assign value to reference pointed to by JSON pointer; Note that if
+            // the JSON pointer is "" (i.e., points to the whole value), function
+            // get_and_create returns a reference to result itself. An assignment
+            // will then create a primitive value.
+            json_pointer(element.first).get_and_create(result) = element.second;
+        }
+
+        return result;
+    }
+
+    // can't use conversion operator because of ambiguity
+    json_pointer<string_t> convert() const&
+    {
+        json_pointer<string_t> result;
+        result.reference_tokens = reference_tokens;
+        return result;
+    }
+
+    json_pointer<string_t> convert()&&
+    {
+        json_pointer<string_t> result;
+        result.reference_tokens = std::move(reference_tokens);
+        return result;
+    }
+
+  public:
+#if JSON_HAS_THREE_WAY_COMPARISON
+    /// @brief compares two JSON pointers for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    template<typename RefStringTypeRhs>
+    bool operator==(const json_pointer<RefStringTypeRhs>& rhs) const noexcept
+    {
+        return reference_tokens == rhs.reference_tokens;
+    }
+
+    /// @brief compares JSON pointer and string for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator==(json_pointer))
+    bool operator==(const string_t& rhs) const
+    {
+        return *this == json_pointer(rhs);
+    }
+
+    /// @brief 3-way compares two JSON pointers
+    template<typename RefStringTypeRhs>
+    std::strong_ordering operator<=>(const json_pointer<RefStringTypeRhs>& rhs) const noexcept // *NOPAD*
+    {
+        return  reference_tokens <=> rhs.reference_tokens; // *NOPAD*
+    }
+#else
+    /// @brief compares two JSON pointers for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator==(const json_pointer<RefStringTypeLhs>& lhs,
+                           const json_pointer<RefStringTypeRhs>& rhs) noexcept;
+
+    /// @brief compares JSON pointer and string for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    template<typename RefStringTypeLhs, typename StringType>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator==(const json_pointer<RefStringTypeLhs>& lhs,
+                           const StringType& rhs);
+
+    /// @brief compares string and JSON pointer for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    template<typename RefStringTypeRhs, typename StringType>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator==(const StringType& lhs,
+                           const json_pointer<RefStringTypeRhs>& rhs);
+
+    /// @brief compares two JSON pointers for inequality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_ne/
+    template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator!=(const json_pointer<RefStringTypeLhs>& lhs,
+                           const json_pointer<RefStringTypeRhs>& rhs) noexcept;
+
+    /// @brief compares JSON pointer and string for inequality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_ne/
+    template<typename RefStringTypeLhs, typename StringType>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator!=(const json_pointer<RefStringTypeLhs>& lhs,
+                           const StringType& rhs);
+
+    /// @brief compares string and JSON pointer for inequality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_ne/
+    template<typename RefStringTypeRhs, typename StringType>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator!=(const StringType& lhs,
+                           const json_pointer<RefStringTypeRhs>& rhs);
+
+    /// @brief compares two JSON pointer for less-than
+    template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator<(const json_pointer<RefStringTypeLhs>& lhs,
+                          const json_pointer<RefStringTypeRhs>& rhs) noexcept;
+#endif
+
+  private:
+    /// the reference tokens
+    std::vector<string_t> reference_tokens;
+};
+
+#if !JSON_HAS_THREE_WAY_COMPARISON
+// functions cannot be defined inside class due to ODR violations
+template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+inline bool operator==(const json_pointer<RefStringTypeLhs>& lhs,
+                       const json_pointer<RefStringTypeRhs>& rhs) noexcept
+{
+    return lhs.reference_tokens == rhs.reference_tokens;
+}
+
+template<typename RefStringTypeLhs,
+         typename StringType = typename json_pointer<RefStringTypeLhs>::string_t>
+JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator==(json_pointer, json_pointer))
+inline bool operator==(const json_pointer<RefStringTypeLhs>& lhs,
+                       const StringType& rhs)
+{
+    return lhs == json_pointer<RefStringTypeLhs>(rhs);
+}
+
+template<typename RefStringTypeRhs,
+         typename StringType = typename json_pointer<RefStringTypeRhs>::string_t>
+JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator==(json_pointer, json_pointer))
+inline bool operator==(const StringType& lhs,
+                       const json_pointer<RefStringTypeRhs>& rhs)
+{
+    return json_pointer<RefStringTypeRhs>(lhs) == rhs;
+}
+
+template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+inline bool operator!=(const json_pointer<RefStringTypeLhs>& lhs,
+                       const json_pointer<RefStringTypeRhs>& rhs) noexcept
+{
+    return !(lhs == rhs);
+}
+
+template<typename RefStringTypeLhs,
+         typename StringType = typename json_pointer<RefStringTypeLhs>::string_t>
+JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator!=(json_pointer, json_pointer))
+inline bool operator!=(const json_pointer<RefStringTypeLhs>& lhs,
+                       const StringType& rhs)
+{
+    return !(lhs == rhs);
+}
+
+template<typename RefStringTypeRhs,
+         typename StringType = typename json_pointer<RefStringTypeRhs>::string_t>
+JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator!=(json_pointer, json_pointer))
+inline bool operator!=(const StringType& lhs,
+                       const json_pointer<RefStringTypeRhs>& rhs)
+{
+    return !(lhs == rhs);
+}
+
+template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+inline bool operator<(const json_pointer<RefStringTypeLhs>& lhs,
+                      const json_pointer<RefStringTypeRhs>& rhs) noexcept
+{
+    return lhs.reference_tokens < rhs.reference_tokens;
+}
+#endif
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/json_ref.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <initializer_list>
+#include <utility>
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename BasicJsonType>
+class json_ref
+{
+  public:
+    using value_type = BasicJsonType;
+
+    json_ref(value_type&& value)
+        : owned_value(std::move(value))
+    {}
+
+    json_ref(const value_type& value)
+        : value_ref(&value)
+    {}
+
+    json_ref(std::initializer_list<json_ref> init)
+        : owned_value(init)
+    {}
+
+    template <
+        class... Args,
+        enable_if_t<std::is_constructible<value_type, Args...>::value, int> = 0 >
+    json_ref(Args && ... args)
+        : owned_value(std::forward<Args>(args)...)
+    {}
+
+    // class should be movable only
+    json_ref(json_ref&&) noexcept = default;
+    json_ref(const json_ref&) = delete;
+    json_ref& operator=(const json_ref&) = delete;
+    json_ref& operator=(json_ref&&) = delete;
+    ~json_ref() = default;
+
+    value_type moved_or_copied() const
+    {
+        if (value_ref == nullptr)
+        {
+            return std::move(owned_value);
+        }
+        return *value_ref;
+    }
+
+    value_type const& operator*() const
+    {
+        return value_ref ? *value_ref : owned_value;
+    }
+
+    value_type const* operator->() const
+    {
+        return &** this;
+    }
+
+  private:
+    mutable value_type owned_value = nullptr;
+    value_type const* value_ref = nullptr;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/string_escape.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/output/binary_writer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // reverse
+#include <array> // array
+#include <map> // map
+#include <cmath> // isnan, isinf
+#include <cstdint> // uint8_t, uint16_t, uint32_t, uint64_t
+#include <cstring> // memcpy
+#include <limits> // numeric_limits
+#include <string> // string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/input/binary_reader.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/output/output_adapters.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // copy
+#include <cstddef> // size_t
+#include <iterator> // back_inserter
+#include <memory> // shared_ptr, make_shared
+#include <string> // basic_string
+#include <vector> // vector
+
+#ifndef JSON_NO_IO
+    #include <ios>      // streamsize
+    #include <ostream>  // basic_ostream
+#endif  // JSON_NO_IO
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/// abstract output adapter interface
+template<typename CharType> struct output_adapter_protocol
+{
+    virtual void write_character(CharType c) = 0;
+    virtual void write_characters(const CharType* s, std::size_t length) = 0;
+    virtual ~output_adapter_protocol() = default;
+
+    output_adapter_protocol() = default;
+    output_adapter_protocol(const output_adapter_protocol&) = default;
+    output_adapter_protocol(output_adapter_protocol&&) noexcept = default;
+    output_adapter_protocol& operator=(const output_adapter_protocol&) = default;
+    output_adapter_protocol& operator=(output_adapter_protocol&&) noexcept = default;
+};
+
+/// a type to simplify interfaces
+template<typename CharType>
+using output_adapter_t = std::shared_ptr<output_adapter_protocol<CharType>>;
+
+/// output adapter for byte vectors
+template<typename CharType, typename AllocatorType = std::allocator<CharType>>
+class output_vector_adapter : public output_adapter_protocol<CharType>
+{
+  public:
+    explicit output_vector_adapter(std::vector<CharType, AllocatorType>& vec) noexcept
+        : v(vec)
+    {}
+
+    void write_character(CharType c) override
+    {
+        v.push_back(c);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    void write_characters(const CharType* s, std::size_t length) override
+    {
+        v.insert(v.end(), s, s + length);
+    }
+
+  private:
+    std::vector<CharType, AllocatorType>& v;
+};
+
+#ifndef JSON_NO_IO
+/// output adapter for output streams
+template<typename CharType>
+class output_stream_adapter : public output_adapter_protocol<CharType>
+{
+  public:
+    explicit output_stream_adapter(std::basic_ostream<CharType>& s) noexcept
+        : stream(s)
+    {}
+
+    void write_character(CharType c) override
+    {
+        stream.put(c);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    void write_characters(const CharType* s, std::size_t length) override
+    {
+        stream.write(s, static_cast<std::streamsize>(length));
+    }
+
+  private:
+    std::basic_ostream<CharType>& stream;
+};
+#endif  // JSON_NO_IO
+
+/// output adapter for basic_string
+template<typename CharType, typename StringType = std::basic_string<CharType>>
+class output_string_adapter : public output_adapter_protocol<CharType>
+{
+  public:
+    explicit output_string_adapter(StringType& s) noexcept
+        : str(s)
+    {}
+
+    void write_character(CharType c) override
+    {
+        str.push_back(c);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    void write_characters(const CharType* s, std::size_t length) override
+    {
+        str.append(s, length);
+    }
+
+  private:
+    StringType& str;
+};
+
+template<typename CharType, typename StringType = std::basic_string<CharType>>
+class output_adapter
+{
+  public:
+    template<typename AllocatorType = std::allocator<CharType>>
+    output_adapter(std::vector<CharType, AllocatorType>& vec)
+        : oa(std::make_shared<output_vector_adapter<CharType, AllocatorType>>(vec)) {}
+
+#ifndef JSON_NO_IO
+    output_adapter(std::basic_ostream<CharType>& s)
+        : oa(std::make_shared<output_stream_adapter<CharType>>(s)) {}
+#endif  // JSON_NO_IO
+
+    output_adapter(StringType& s)
+        : oa(std::make_shared<output_string_adapter<CharType, StringType>>(s)) {}
+
+    operator output_adapter_t<CharType>()
+    {
+        return oa;
+    }
+
+  private:
+    output_adapter_t<CharType> oa = nullptr;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+///////////////////
+// binary writer //
+///////////////////
+
+/*!
+@brief serialization to CBOR and MessagePack values
+*/
+template<typename BasicJsonType, typename CharType>
+class binary_writer
+{
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+
+  public:
+    /*!
+    @brief create a binary writer
+
+    @param[in] adapter  output adapter to write to
+    */
+    explicit binary_writer(output_adapter_t<CharType> adapter) : oa(std::move(adapter))
+    {
+        JSON_ASSERT(oa);
+    }
+
+    /*!
+    @param[in] j  JSON value to serialize
+    @pre       j.type() == value_t::object
+    */
+    void write_bson(const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::object:
+            {
+                write_bson_object(*j.m_value.object);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::array:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                JSON_THROW(type_error::create(317, concat("to serialize to BSON, top-level type must be object, but is ", j.type_name()), &j));
+            }
+        }
+    }
+
+    /*!
+    @param[in] j  JSON value to serialize
+    */
+    void write_cbor(const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::null:
+            {
+                oa->write_character(to_char_type(0xF6));
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                oa->write_character(j.m_value.boolean
+                                    ? to_char_type(0xF5)
+                                    : to_char_type(0xF4));
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                if (j.m_value.number_integer >= 0)
+                {
+                    // CBOR does not differentiate between positive signed
+                    // integers and unsigned integers. Therefore, we used the
+                    // code from the value_t::number_unsigned case here.
+                    if (j.m_value.number_integer <= 0x17)
+                    {
+                        write_number(static_cast<std::uint8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer <= (std::numeric_limits<std::uint8_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x18));
+                        write_number(static_cast<std::uint8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer <= (std::numeric_limits<std::uint16_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x19));
+                        write_number(static_cast<std::uint16_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer <= (std::numeric_limits<std::uint32_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x1A));
+                        write_number(static_cast<std::uint32_t>(j.m_value.number_integer));
+                    }
+                    else
+                    {
+                        oa->write_character(to_char_type(0x1B));
+                        write_number(static_cast<std::uint64_t>(j.m_value.number_integer));
+                    }
+                }
+                else
+                {
+                    // The conversions below encode the sign in the first
+                    // byte, and the value is converted to a positive number.
+                    const auto positive_number = -1 - j.m_value.number_integer;
+                    if (j.m_value.number_integer >= -24)
+                    {
+                        write_number(static_cast<std::uint8_t>(0x20 + positive_number));
+                    }
+                    else if (positive_number <= (std::numeric_limits<std::uint8_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x38));
+                        write_number(static_cast<std::uint8_t>(positive_number));
+                    }
+                    else if (positive_number <= (std::numeric_limits<std::uint16_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x39));
+                        write_number(static_cast<std::uint16_t>(positive_number));
+                    }
+                    else if (positive_number <= (std::numeric_limits<std::uint32_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x3A));
+                        write_number(static_cast<std::uint32_t>(positive_number));
+                    }
+                    else
+                    {
+                        oa->write_character(to_char_type(0x3B));
+                        write_number(static_cast<std::uint64_t>(positive_number));
+                    }
+                }
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                if (j.m_value.number_unsigned <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(j.m_value.number_unsigned));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x18));
+                    write_number(static_cast<std::uint8_t>(j.m_value.number_unsigned));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x19));
+                    write_number(static_cast<std::uint16_t>(j.m_value.number_unsigned));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x1A));
+                    write_number(static_cast<std::uint32_t>(j.m_value.number_unsigned));
+                }
+                else
+                {
+                    oa->write_character(to_char_type(0x1B));
+                    write_number(static_cast<std::uint64_t>(j.m_value.number_unsigned));
+                }
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                if (std::isnan(j.m_value.number_float))
+                {
+                    // NaN is 0xf97e00 in CBOR
+                    oa->write_character(to_char_type(0xF9));
+                    oa->write_character(to_char_type(0x7E));
+                    oa->write_character(to_char_type(0x00));
+                }
+                else if (std::isinf(j.m_value.number_float))
+                {
+                    // Infinity is 0xf97c00, -Infinity is 0xf9fc00
+                    oa->write_character(to_char_type(0xf9));
+                    oa->write_character(j.m_value.number_float > 0 ? to_char_type(0x7C) : to_char_type(0xFC));
+                    oa->write_character(to_char_type(0x00));
+                }
+                else
+                {
+                    write_compact_float(j.m_value.number_float, detail::input_format_t::cbor);
+                }
+                break;
+            }
+
+            case value_t::string:
+            {
+                // step 1: write control byte and the string length
+                const auto N = j.m_value.string->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(0x60 + N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x78));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x79));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x7A));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x7B));
+                    write_number(static_cast<std::uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write the string
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_value.string->c_str()),
+                    j.m_value.string->size());
+                break;
+            }
+
+            case value_t::array:
+            {
+                // step 1: write control byte and the array size
+                const auto N = j.m_value.array->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(0x80 + N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x98));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x99));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x9A));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x9B));
+                    write_number(static_cast<std::uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write each element
+                for (const auto& el : *j.m_value.array)
+                {
+                    write_cbor(el);
+                }
+                break;
+            }
+
+            case value_t::binary:
+            {
+                if (j.m_value.binary->has_subtype())
+                {
+                    if (j.m_value.binary->subtype() <= (std::numeric_limits<std::uint8_t>::max)())
+                    {
+                        write_number(static_cast<std::uint8_t>(0xd8));
+                        write_number(static_cast<std::uint8_t>(j.m_value.binary->subtype()));
+                    }
+                    else if (j.m_value.binary->subtype() <= (std::numeric_limits<std::uint16_t>::max)())
+                    {
+                        write_number(static_cast<std::uint8_t>(0xd9));
+                        write_number(static_cast<std::uint16_t>(j.m_value.binary->subtype()));
+                    }
+                    else if (j.m_value.binary->subtype() <= (std::numeric_limits<std::uint32_t>::max)())
+                    {
+                        write_number(static_cast<std::uint8_t>(0xda));
+                        write_number(static_cast<std::uint32_t>(j.m_value.binary->subtype()));
+                    }
+                    else if (j.m_value.binary->subtype() <= (std::numeric_limits<std::uint64_t>::max)())
+                    {
+                        write_number(static_cast<std::uint8_t>(0xdb));
+                        write_number(static_cast<std::uint64_t>(j.m_value.binary->subtype()));
+                    }
+                }
+
+                // step 1: write control byte and the binary array size
+                const auto N = j.m_value.binary->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(0x40 + N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x58));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x59));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x5A));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x5B));
+                    write_number(static_cast<std::uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write each element
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_value.binary->data()),
+                    N);
+
+                break;
+            }
+
+            case value_t::object:
+            {
+                // step 1: write control byte and the object size
+                const auto N = j.m_value.object->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(0xA0 + N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0xB8));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0xB9));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0xBA));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    oa->write_character(to_char_type(0xBB));
+                    write_number(static_cast<std::uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write each element
+                for (const auto& el : *j.m_value.object)
+                {
+                    write_cbor(el.first);
+                    write_cbor(el.second);
+                }
+                break;
+            }
+
+            case value_t::discarded:
+            default:
+                break;
+        }
+    }
+
+    /*!
+    @param[in] j  JSON value to serialize
+    */
+    void write_msgpack(const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::null: // nil
+            {
+                oa->write_character(to_char_type(0xC0));
+                break;
+            }
+
+            case value_t::boolean: // true and false
+            {
+                oa->write_character(j.m_value.boolean
+                                    ? to_char_type(0xC3)
+                                    : to_char_type(0xC2));
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                if (j.m_value.number_integer >= 0)
+                {
+                    // MessagePack does not differentiate between positive
+                    // signed integers and unsigned integers. Therefore, we used
+                    // the code from the value_t::number_unsigned case here.
+                    if (j.m_value.number_unsigned < 128)
+                    {
+                        // positive fixnum
+                        write_number(static_cast<std::uint8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)())
+                    {
+                        // uint 8
+                        oa->write_character(to_char_type(0xCC));
+                        write_number(static_cast<std::uint8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint16_t>::max)())
+                    {
+                        // uint 16
+                        oa->write_character(to_char_type(0xCD));
+                        write_number(static_cast<std::uint16_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint32_t>::max)())
+                    {
+                        // uint 32
+                        oa->write_character(to_char_type(0xCE));
+                        write_number(static_cast<std::uint32_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint64_t>::max)())
+                    {
+                        // uint 64
+                        oa->write_character(to_char_type(0xCF));
+                        write_number(static_cast<std::uint64_t>(j.m_value.number_integer));
+                    }
+                }
+                else
+                {
+                    if (j.m_value.number_integer >= -32)
+                    {
+                        // negative fixnum
+                        write_number(static_cast<std::int8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer >= (std::numeric_limits<std::int8_t>::min)() &&
+                             j.m_value.number_integer <= (std::numeric_limits<std::int8_t>::max)())
+                    {
+                        // int 8
+                        oa->write_character(to_char_type(0xD0));
+                        write_number(static_cast<std::int8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer >= (std::numeric_limits<std::int16_t>::min)() &&
+                             j.m_value.number_integer <= (std::numeric_limits<std::int16_t>::max)())
+                    {
+                        // int 16
+                        oa->write_character(to_char_type(0xD1));
+                        write_number(static_cast<std::int16_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer >= (std::numeric_limits<std::int32_t>::min)() &&
+                             j.m_value.number_integer <= (std::numeric_limits<std::int32_t>::max)())
+                    {
+                        // int 32
+                        oa->write_character(to_char_type(0xD2));
+                        write_number(static_cast<std::int32_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer >= (std::numeric_limits<std::int64_t>::min)() &&
+                             j.m_value.number_integer <= (std::numeric_limits<std::int64_t>::max)())
+                    {
+                        // int 64
+                        oa->write_character(to_char_type(0xD3));
+                        write_number(static_cast<std::int64_t>(j.m_value.number_integer));
+                    }
+                }
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                if (j.m_value.number_unsigned < 128)
+                {
+                    // positive fixnum
+                    write_number(static_cast<std::uint8_t>(j.m_value.number_integer));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    // uint 8
+                    oa->write_character(to_char_type(0xCC));
+                    write_number(static_cast<std::uint8_t>(j.m_value.number_integer));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    // uint 16
+                    oa->write_character(to_char_type(0xCD));
+                    write_number(static_cast<std::uint16_t>(j.m_value.number_integer));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    // uint 32
+                    oa->write_character(to_char_type(0xCE));
+                    write_number(static_cast<std::uint32_t>(j.m_value.number_integer));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    // uint 64
+                    oa->write_character(to_char_type(0xCF));
+                    write_number(static_cast<std::uint64_t>(j.m_value.number_integer));
+                }
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                write_compact_float(j.m_value.number_float, detail::input_format_t::msgpack);
+                break;
+            }
+
+            case value_t::string:
+            {
+                // step 1: write control byte and the string length
+                const auto N = j.m_value.string->size();
+                if (N <= 31)
+                {
+                    // fixstr
+                    write_number(static_cast<std::uint8_t>(0xA0 | N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    // str 8
+                    oa->write_character(to_char_type(0xD9));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    // str 16
+                    oa->write_character(to_char_type(0xDA));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    // str 32
+                    oa->write_character(to_char_type(0xDB));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+
+                // step 2: write the string
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_value.string->c_str()),
+                    j.m_value.string->size());
+                break;
+            }
+
+            case value_t::array:
+            {
+                // step 1: write control byte and the array size
+                const auto N = j.m_value.array->size();
+                if (N <= 15)
+                {
+                    // fixarray
+                    write_number(static_cast<std::uint8_t>(0x90 | N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    // array 16
+                    oa->write_character(to_char_type(0xDC));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    // array 32
+                    oa->write_character(to_char_type(0xDD));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+
+                // step 2: write each element
+                for (const auto& el : *j.m_value.array)
+                {
+                    write_msgpack(el);
+                }
+                break;
+            }
+
+            case value_t::binary:
+            {
+                // step 0: determine if the binary type has a set subtype to
+                // determine whether or not to use the ext or fixext types
+                const bool use_ext = j.m_value.binary->has_subtype();
+
+                // step 1: write control byte and the byte string length
+                const auto N = j.m_value.binary->size();
+                if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    std::uint8_t output_type{};
+                    bool fixed = true;
+                    if (use_ext)
+                    {
+                        switch (N)
+                        {
+                            case 1:
+                                output_type = 0xD4; // fixext 1
+                                break;
+                            case 2:
+                                output_type = 0xD5; // fixext 2
+                                break;
+                            case 4:
+                                output_type = 0xD6; // fixext 4
+                                break;
+                            case 8:
+                                output_type = 0xD7; // fixext 8
+                                break;
+                            case 16:
+                                output_type = 0xD8; // fixext 16
+                                break;
+                            default:
+                                output_type = 0xC7; // ext 8
+                                fixed = false;
+                                break;
+                        }
+
+                    }
+                    else
+                    {
+                        output_type = 0xC4; // bin 8
+                        fixed = false;
+                    }
+
+                    oa->write_character(to_char_type(output_type));
+                    if (!fixed)
+                    {
+                        write_number(static_cast<std::uint8_t>(N));
+                    }
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    std::uint8_t output_type = use_ext
+                                               ? 0xC8 // ext 16
+                                               : 0xC5; // bin 16
+
+                    oa->write_character(to_char_type(output_type));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    std::uint8_t output_type = use_ext
+                                               ? 0xC9 // ext 32
+                                               : 0xC6; // bin 32
+
+                    oa->write_character(to_char_type(output_type));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+
+                // step 1.5: if this is an ext type, write the subtype
+                if (use_ext)
+                {
+                    write_number(static_cast<std::int8_t>(j.m_value.binary->subtype()));
+                }
+
+                // step 2: write the byte string
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_value.binary->data()),
+                    N);
+
+                break;
+            }
+
+            case value_t::object:
+            {
+                // step 1: write control byte and the object size
+                const auto N = j.m_value.object->size();
+                if (N <= 15)
+                {
+                    // fixmap
+                    write_number(static_cast<std::uint8_t>(0x80 | (N & 0xF)));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    // map 16
+                    oa->write_character(to_char_type(0xDE));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    // map 32
+                    oa->write_character(to_char_type(0xDF));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+
+                // step 2: write each element
+                for (const auto& el : *j.m_value.object)
+                {
+                    write_msgpack(el.first);
+                    write_msgpack(el.second);
+                }
+                break;
+            }
+
+            case value_t::discarded:
+            default:
+                break;
+        }
+    }
+
+    /*!
+    @param[in] j  JSON value to serialize
+    @param[in] use_count   whether to use '#' prefixes (optimized format)
+    @param[in] use_type    whether to use '$' prefixes (optimized format)
+    @param[in] add_prefix  whether prefixes need to be used for this value
+    @param[in] use_bjdata  whether write in BJData format, default is false
+    */
+    void write_ubjson(const BasicJsonType& j, const bool use_count,
+                      const bool use_type, const bool add_prefix = true,
+                      const bool use_bjdata = false)
+    {
+        switch (j.type())
+        {
+            case value_t::null:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('Z'));
+                }
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(j.m_value.boolean
+                                        ? to_char_type('T')
+                                        : to_char_type('F'));
+                }
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                write_number_with_ubjson_prefix(j.m_value.number_integer, add_prefix, use_bjdata);
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                write_number_with_ubjson_prefix(j.m_value.number_unsigned, add_prefix, use_bjdata);
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                write_number_with_ubjson_prefix(j.m_value.number_float, add_prefix, use_bjdata);
+                break;
+            }
+
+            case value_t::string:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('S'));
+                }
+                write_number_with_ubjson_prefix(j.m_value.string->size(), true, use_bjdata);
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_value.string->c_str()),
+                    j.m_value.string->size());
+                break;
+            }
+
+            case value_t::array:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('['));
+                }
+
+                bool prefix_required = true;
+                if (use_type && !j.m_value.array->empty())
+                {
+                    JSON_ASSERT(use_count);
+                    const CharType first_prefix = ubjson_prefix(j.front(), use_bjdata);
+                    const bool same_prefix = std::all_of(j.begin() + 1, j.end(),
+                                                         [this, first_prefix, use_bjdata](const BasicJsonType & v)
+                    {
+                        return ubjson_prefix(v, use_bjdata) == first_prefix;
+                    });
+
+                    std::vector<CharType> bjdx = {'[', '{', 'S', 'H', 'T', 'F', 'N', 'Z'}; // excluded markers in bjdata optimized type
+
+                    if (same_prefix && !(use_bjdata && std::find(bjdx.begin(), bjdx.end(), first_prefix) != bjdx.end()))
+                    {
+                        prefix_required = false;
+                        oa->write_character(to_char_type('$'));
+                        oa->write_character(first_prefix);
+                    }
+                }
+
+                if (use_count)
+                {
+                    oa->write_character(to_char_type('#'));
+                    write_number_with_ubjson_prefix(j.m_value.array->size(), true, use_bjdata);
+                }
+
+                for (const auto& el : *j.m_value.array)
+                {
+                    write_ubjson(el, use_count, use_type, prefix_required, use_bjdata);
+                }
+
+                if (!use_count)
+                {
+                    oa->write_character(to_char_type(']'));
+                }
+
+                break;
+            }
+
+            case value_t::binary:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('['));
+                }
+
+                if (use_type && !j.m_value.binary->empty())
+                {
+                    JSON_ASSERT(use_count);
+                    oa->write_character(to_char_type('$'));
+                    oa->write_character('U');
+                }
+
+                if (use_count)
+                {
+                    oa->write_character(to_char_type('#'));
+                    write_number_with_ubjson_prefix(j.m_value.binary->size(), true, use_bjdata);
+                }
+
+                if (use_type)
+                {
+                    oa->write_characters(
+                        reinterpret_cast<const CharType*>(j.m_value.binary->data()),
+                        j.m_value.binary->size());
+                }
+                else
+                {
+                    for (size_t i = 0; i < j.m_value.binary->size(); ++i)
+                    {
+                        oa->write_character(to_char_type('U'));
+                        oa->write_character(j.m_value.binary->data()[i]);
+                    }
+                }
+
+                if (!use_count)
+                {
+                    oa->write_character(to_char_type(']'));
+                }
+
+                break;
+            }
+
+            case value_t::object:
+            {
+                if (use_bjdata && j.m_value.object->size() == 3 && j.m_value.object->find("_ArrayType_") != j.m_value.object->end() && j.m_value.object->find("_ArraySize_") != j.m_value.object->end() && j.m_value.object->find("_ArrayData_") != j.m_value.object->end())
+                {
+                    if (!write_bjdata_ndarray(*j.m_value.object, use_count, use_type))  // decode bjdata ndarray in the JData format (https://github.com/NeuroJSON/jdata)
+                    {
+                        break;
+                    }
+                }
+
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('{'));
+                }
+
+                bool prefix_required = true;
+                if (use_type && !j.m_value.object->empty())
+                {
+                    JSON_ASSERT(use_count);
+                    const CharType first_prefix = ubjson_prefix(j.front(), use_bjdata);
+                    const bool same_prefix = std::all_of(j.begin(), j.end(),
+                                                         [this, first_prefix, use_bjdata](const BasicJsonType & v)
+                    {
+                        return ubjson_prefix(v, use_bjdata) == first_prefix;
+                    });
+
+                    std::vector<CharType> bjdx = {'[', '{', 'S', 'H', 'T', 'F', 'N', 'Z'}; // excluded markers in bjdata optimized type
+
+                    if (same_prefix && !(use_bjdata && std::find(bjdx.begin(), bjdx.end(), first_prefix) != bjdx.end()))
+                    {
+                        prefix_required = false;
+                        oa->write_character(to_char_type('$'));
+                        oa->write_character(first_prefix);
+                    }
+                }
+
+                if (use_count)
+                {
+                    oa->write_character(to_char_type('#'));
+                    write_number_with_ubjson_prefix(j.m_value.object->size(), true, use_bjdata);
+                }
+
+                for (const auto& el : *j.m_value.object)
+                {
+                    write_number_with_ubjson_prefix(el.first.size(), true, use_bjdata);
+                    oa->write_characters(
+                        reinterpret_cast<const CharType*>(el.first.c_str()),
+                        el.first.size());
+                    write_ubjson(el.second, use_count, use_type, prefix_required, use_bjdata);
+                }
+
+                if (!use_count)
+                {
+                    oa->write_character(to_char_type('}'));
+                }
+
+                break;
+            }
+
+            case value_t::discarded:
+            default:
+                break;
+        }
+    }
+
+  private:
+    //////////
+    // BSON //
+    //////////
+
+    /*!
+    @return The size of a BSON document entry header, including the id marker
+            and the entry name size (and its null-terminator).
+    */
+    static std::size_t calc_bson_entry_header_size(const string_t& name, const BasicJsonType& j)
+    {
+        const auto it = name.find(static_cast<typename string_t::value_type>(0));
+        if (JSON_HEDLEY_UNLIKELY(it != BasicJsonType::string_t::npos))
+        {
+            JSON_THROW(out_of_range::create(409, concat("BSON key cannot contain code point U+0000 (at byte ", std::to_string(it), ")"), &j));
+            static_cast<void>(j);
+        }
+
+        return /*id*/ 1ul + name.size() + /*zero-terminator*/1u;
+    }
+
+    /*!
+    @brief Writes the given @a element_type and @a name to the output adapter
+    */
+    void write_bson_entry_header(const string_t& name,
+                                 const std::uint8_t element_type)
+    {
+        oa->write_character(to_char_type(element_type)); // boolean
+        oa->write_characters(
+            reinterpret_cast<const CharType*>(name.c_str()),
+            name.size() + 1u);
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and boolean value @a value
+    */
+    void write_bson_boolean(const string_t& name,
+                            const bool value)
+    {
+        write_bson_entry_header(name, 0x08);
+        oa->write_character(value ? to_char_type(0x01) : to_char_type(0x00));
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and double value @a value
+    */
+    void write_bson_double(const string_t& name,
+                           const double value)
+    {
+        write_bson_entry_header(name, 0x01);
+        write_number<double>(value, true);
+    }
+
+    /*!
+    @return The size of the BSON-encoded string in @a value
+    */
+    static std::size_t calc_bson_string_size(const string_t& value)
+    {
+        return sizeof(std::int32_t) + value.size() + 1ul;
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and string value @a value
+    */
+    void write_bson_string(const string_t& name,
+                           const string_t& value)
+    {
+        write_bson_entry_header(name, 0x02);
+
+        write_number<std::int32_t>(static_cast<std::int32_t>(value.size() + 1ul), true);
+        oa->write_characters(
+            reinterpret_cast<const CharType*>(value.c_str()),
+            value.size() + 1);
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and null value
+    */
+    void write_bson_null(const string_t& name)
+    {
+        write_bson_entry_header(name, 0x0A);
+    }
+
+    /*!
+    @return The size of the BSON-encoded integer @a value
+    */
+    static std::size_t calc_bson_integer_size(const std::int64_t value)
+    {
+        return (std::numeric_limits<std::int32_t>::min)() <= value && value <= (std::numeric_limits<std::int32_t>::max)()
+               ? sizeof(std::int32_t)
+               : sizeof(std::int64_t);
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and integer @a value
+    */
+    void write_bson_integer(const string_t& name,
+                            const std::int64_t value)
+    {
+        if ((std::numeric_limits<std::int32_t>::min)() <= value && value <= (std::numeric_limits<std::int32_t>::max)())
+        {
+            write_bson_entry_header(name, 0x10); // int32
+            write_number<std::int32_t>(static_cast<std::int32_t>(value), true);
+        }
+        else
+        {
+            write_bson_entry_header(name, 0x12); // int64
+            write_number<std::int64_t>(static_cast<std::int64_t>(value), true);
+        }
+    }
+
+    /*!
+    @return The size of the BSON-encoded unsigned integer in @a j
+    */
+    static constexpr std::size_t calc_bson_unsigned_size(const std::uint64_t value) noexcept
+    {
+        return (value <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)()))
+               ? sizeof(std::int32_t)
+               : sizeof(std::int64_t);
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and unsigned @a value
+    */
+    void write_bson_unsigned(const string_t& name,
+                             const BasicJsonType& j)
+    {
+        if (j.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)()))
+        {
+            write_bson_entry_header(name, 0x10 /* int32 */);
+            write_number<std::int32_t>(static_cast<std::int32_t>(j.m_value.number_unsigned), true);
+        }
+        else if (j.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int64_t>::max)()))
+        {
+            write_bson_entry_header(name, 0x12 /* int64 */);
+            write_number<std::int64_t>(static_cast<std::int64_t>(j.m_value.number_unsigned), true);
+        }
+        else
+        {
+            JSON_THROW(out_of_range::create(407, concat("integer number ", std::to_string(j.m_value.number_unsigned), " cannot be represented by BSON as it does not fit int64"), &j));
+        }
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and object @a value
+    */
+    void write_bson_object_entry(const string_t& name,
+                                 const typename BasicJsonType::object_t& value)
+    {
+        write_bson_entry_header(name, 0x03); // object
+        write_bson_object(value);
+    }
+
+    /*!
+    @return The size of the BSON-encoded array @a value
+    */
+    static std::size_t calc_bson_array_size(const typename BasicJsonType::array_t& value)
+    {
+        std::size_t array_index = 0ul;
+
+        const std::size_t embedded_document_size = std::accumulate(std::begin(value), std::end(value), static_cast<std::size_t>(0), [&array_index](std::size_t result, const typename BasicJsonType::array_t::value_type & el)
+        {
+            return result + calc_bson_element_size(std::to_string(array_index++), el);
+        });
+
+        return sizeof(std::int32_t) + embedded_document_size + 1ul;
+    }
+
+    /*!
+    @return The size of the BSON-encoded binary array @a value
+    */
+    static std::size_t calc_bson_binary_size(const typename BasicJsonType::binary_t& value)
+    {
+        return sizeof(std::int32_t) + value.size() + 1ul;
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and array @a value
+    */
+    void write_bson_array(const string_t& name,
+                          const typename BasicJsonType::array_t& value)
+    {
+        write_bson_entry_header(name, 0x04); // array
+        write_number<std::int32_t>(static_cast<std::int32_t>(calc_bson_array_size(value)), true);
+
+        std::size_t array_index = 0ul;
+
+        for (const auto& el : value)
+        {
+            write_bson_element(std::to_string(array_index++), el);
+        }
+
+        oa->write_character(to_char_type(0x00));
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and binary value @a value
+    */
+    void write_bson_binary(const string_t& name,
+                           const binary_t& value)
+    {
+        write_bson_entry_header(name, 0x05);
+
+        write_number<std::int32_t>(static_cast<std::int32_t>(value.size()), true);
+        write_number(value.has_subtype() ? static_cast<std::uint8_t>(value.subtype()) : static_cast<std::uint8_t>(0x00));
+
+        oa->write_characters(reinterpret_cast<const CharType*>(value.data()), value.size());
+    }
+
+    /*!
+    @brief Calculates the size necessary to serialize the JSON value @a j with its @a name
+    @return The calculated size for the BSON document entry for @a j with the given @a name.
+    */
+    static std::size_t calc_bson_element_size(const string_t& name,
+            const BasicJsonType& j)
+    {
+        const auto header_size = calc_bson_entry_header_size(name, j);
+        switch (j.type())
+        {
+            case value_t::object:
+                return header_size + calc_bson_object_size(*j.m_value.object);
+
+            case value_t::array:
+                return header_size + calc_bson_array_size(*j.m_value.array);
+
+            case value_t::binary:
+                return header_size + calc_bson_binary_size(*j.m_value.binary);
+
+            case value_t::boolean:
+                return header_size + 1ul;
+
+            case value_t::number_float:
+                return header_size + 8ul;
+
+            case value_t::number_integer:
+                return header_size + calc_bson_integer_size(j.m_value.number_integer);
+
+            case value_t::number_unsigned:
+                return header_size + calc_bson_unsigned_size(j.m_value.number_unsigned);
+
+            case value_t::string:
+                return header_size + calc_bson_string_size(*j.m_value.string);
+
+            case value_t::null:
+                return header_size + 0ul;
+
+            // LCOV_EXCL_START
+            case value_t::discarded:
+            default:
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert)
+                return 0ul;
+                // LCOV_EXCL_STOP
+        }
+    }
+
+    /*!
+    @brief Serializes the JSON value @a j to BSON and associates it with the
+           key @a name.
+    @param name The name to associate with the JSON entity @a j within the
+                current BSON document
+    */
+    void write_bson_element(const string_t& name,
+                            const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::object:
+                return write_bson_object_entry(name, *j.m_value.object);
+
+            case value_t::array:
+                return write_bson_array(name, *j.m_value.array);
+
+            case value_t::binary:
+                return write_bson_binary(name, *j.m_value.binary);
+
+            case value_t::boolean:
+                return write_bson_boolean(name, j.m_value.boolean);
+
+            case value_t::number_float:
+                return write_bson_double(name, j.m_value.number_float);
+
+            case value_t::number_integer:
+                return write_bson_integer(name, j.m_value.number_integer);
+
+            case value_t::number_unsigned:
+                return write_bson_unsigned(name, j);
+
+            case value_t::string:
+                return write_bson_string(name, *j.m_value.string);
+
+            case value_t::null:
+                return write_bson_null(name);
+
+            // LCOV_EXCL_START
+            case value_t::discarded:
+            default:
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert)
+                return;
+                // LCOV_EXCL_STOP
+        }
+    }
+
+    /*!
+    @brief Calculates the size of the BSON serialization of the given
+           JSON-object @a j.
+    @param[in] value  JSON value to serialize
+    @pre       value.type() == value_t::object
+    */
+    static std::size_t calc_bson_object_size(const typename BasicJsonType::object_t& value)
+    {
+        std::size_t document_size = std::accumulate(value.begin(), value.end(), static_cast<std::size_t>(0),
+                                    [](size_t result, const typename BasicJsonType::object_t::value_type & el)
+        {
+            return result += calc_bson_element_size(el.first, el.second);
+        });
+
+        return sizeof(std::int32_t) + document_size + 1ul;
+    }
+
+    /*!
+    @param[in] value  JSON value to serialize
+    @pre       value.type() == value_t::object
+    */
+    void write_bson_object(const typename BasicJsonType::object_t& value)
+    {
+        write_number<std::int32_t>(static_cast<std::int32_t>(calc_bson_object_size(value)), true);
+
+        for (const auto& el : value)
+        {
+            write_bson_element(el.first, el.second);
+        }
+
+        oa->write_character(to_char_type(0x00));
+    }
+
+    //////////
+    // CBOR //
+    //////////
+
+    static constexpr CharType get_cbor_float_prefix(float /*unused*/)
+    {
+        return to_char_type(0xFA);  // Single-Precision Float
+    }
+
+    static constexpr CharType get_cbor_float_prefix(double /*unused*/)
+    {
+        return to_char_type(0xFB);  // Double-Precision Float
+    }
+
+    /////////////
+    // MsgPack //
+    /////////////
+
+    static constexpr CharType get_msgpack_float_prefix(float /*unused*/)
+    {
+        return to_char_type(0xCA);  // float 32
+    }
+
+    static constexpr CharType get_msgpack_float_prefix(double /*unused*/)
+    {
+        return to_char_type(0xCB);  // float 64
+    }
+
+    ////////////
+    // UBJSON //
+    ////////////
+
+    // UBJSON: write number (floating point)
+    template<typename NumberType, typename std::enable_if<
+                 std::is_floating_point<NumberType>::value, int>::type = 0>
+    void write_number_with_ubjson_prefix(const NumberType n,
+                                         const bool add_prefix,
+                                         const bool use_bjdata)
+    {
+        if (add_prefix)
+        {
+            oa->write_character(get_ubjson_float_prefix(n));
+        }
+        write_number(n, use_bjdata);
+    }
+
+    // UBJSON: write number (unsigned integer)
+    template<typename NumberType, typename std::enable_if<
+                 std::is_unsigned<NumberType>::value, int>::type = 0>
+    void write_number_with_ubjson_prefix(const NumberType n,
+                                         const bool add_prefix,
+                                         const bool use_bjdata)
+    {
+        if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int8_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('i'));  // int8
+            }
+            write_number(static_cast<std::uint8_t>(n), use_bjdata);
+        }
+        else if (n <= (std::numeric_limits<std::uint8_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('U'));  // uint8
+            }
+            write_number(static_cast<std::uint8_t>(n), use_bjdata);
+        }
+        else if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int16_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('I'));  // int16
+            }
+            write_number(static_cast<std::int16_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && n <= static_cast<uint64_t>((std::numeric_limits<uint16_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('u'));  // uint16 - bjdata only
+            }
+            write_number(static_cast<std::uint16_t>(n), use_bjdata);
+        }
+        else if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('l'));  // int32
+            }
+            write_number(static_cast<std::int32_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && n <= static_cast<uint64_t>((std::numeric_limits<uint32_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('m'));  // uint32 - bjdata only
+            }
+            write_number(static_cast<std::uint32_t>(n), use_bjdata);
+        }
+        else if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int64_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('L'));  // int64
+            }
+            write_number(static_cast<std::int64_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && n <= (std::numeric_limits<uint64_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('M'));  // uint64 - bjdata only
+            }
+            write_number(static_cast<std::uint64_t>(n), use_bjdata);
+        }
+        else
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('H'));  // high-precision number
+            }
+
+            const auto number = BasicJsonType(n).dump();
+            write_number_with_ubjson_prefix(number.size(), true, use_bjdata);
+            for (std::size_t i = 0; i < number.size(); ++i)
+            {
+                oa->write_character(to_char_type(static_cast<std::uint8_t>(number[i])));
+            }
+        }
+    }
+
+    // UBJSON: write number (signed integer)
+    template < typename NumberType, typename std::enable_if <
+                   std::is_signed<NumberType>::value&&
+                   !std::is_floating_point<NumberType>::value, int >::type = 0 >
+    void write_number_with_ubjson_prefix(const NumberType n,
+                                         const bool add_prefix,
+                                         const bool use_bjdata)
+    {
+        if ((std::numeric_limits<std::int8_t>::min)() <= n && n <= (std::numeric_limits<std::int8_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('i'));  // int8
+            }
+            write_number(static_cast<std::int8_t>(n), use_bjdata);
+        }
+        else if (static_cast<std::int64_t>((std::numeric_limits<std::uint8_t>::min)()) <= n && n <= static_cast<std::int64_t>((std::numeric_limits<std::uint8_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('U'));  // uint8
+            }
+            write_number(static_cast<std::uint8_t>(n), use_bjdata);
+        }
+        else if ((std::numeric_limits<std::int16_t>::min)() <= n && n <= (std::numeric_limits<std::int16_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('I'));  // int16
+            }
+            write_number(static_cast<std::int16_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && (static_cast<std::int64_t>((std::numeric_limits<std::uint16_t>::min)()) <= n && n <= static_cast<std::int64_t>((std::numeric_limits<std::uint16_t>::max)())))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('u'));  // uint16 - bjdata only
+            }
+            write_number(static_cast<uint16_t>(n), use_bjdata);
+        }
+        else if ((std::numeric_limits<std::int32_t>::min)() <= n && n <= (std::numeric_limits<std::int32_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('l'));  // int32
+            }
+            write_number(static_cast<std::int32_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && (static_cast<std::int64_t>((std::numeric_limits<std::uint32_t>::min)()) <= n && n <= static_cast<std::int64_t>((std::numeric_limits<std::uint32_t>::max)())))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('m'));  // uint32 - bjdata only
+            }
+            write_number(static_cast<uint32_t>(n), use_bjdata);
+        }
+        else if ((std::numeric_limits<std::int64_t>::min)() <= n && n <= (std::numeric_limits<std::int64_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('L'));  // int64
+            }
+            write_number(static_cast<std::int64_t>(n), use_bjdata);
+        }
+        // LCOV_EXCL_START
+        else
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('H'));  // high-precision number
+            }
+
+            const auto number = BasicJsonType(n).dump();
+            write_number_with_ubjson_prefix(number.size(), true, use_bjdata);
+            for (std::size_t i = 0; i < number.size(); ++i)
+            {
+                oa->write_character(to_char_type(static_cast<std::uint8_t>(number[i])));
+            }
+        }
+        // LCOV_EXCL_STOP
+    }
+
+    /*!
+    @brief determine the type prefix of container values
+    */
+    CharType ubjson_prefix(const BasicJsonType& j, const bool use_bjdata) const noexcept
+    {
+        switch (j.type())
+        {
+            case value_t::null:
+                return 'Z';
+
+            case value_t::boolean:
+                return j.m_value.boolean ? 'T' : 'F';
+
+            case value_t::number_integer:
+            {
+                if ((std::numeric_limits<std::int8_t>::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits<std::int8_t>::max)())
+                {
+                    return 'i';
+                }
+                if ((std::numeric_limits<std::uint8_t>::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    return 'U';
+                }
+                if ((std::numeric_limits<std::int16_t>::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits<std::int16_t>::max)())
+                {
+                    return 'I';
+                }
+                if (use_bjdata && ((std::numeric_limits<std::uint16_t>::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits<std::uint16_t>::max)()))
+                {
+                    return 'u';
+                }
+                if ((std::numeric_limits<std::int32_t>::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits<std::int32_t>::max)())
+                {
+                    return 'l';
+                }
+                if (use_bjdata && ((std::numeric_limits<std::uint32_t>::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits<std::uint32_t>::max)()))
+                {
+                    return 'm';
+                }
+                if ((std::numeric_limits<std::int64_t>::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits<std::int64_t>::max)())
+                {
+                    return 'L';
+                }
+                // anything else is treated as high-precision number
+                return 'H'; // LCOV_EXCL_LINE
+            }
+
+            case value_t::number_unsigned:
+            {
+                if (j.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int8_t>::max)()))
+                {
+                    return 'i';
+                }
+                if (j.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::uint8_t>::max)()))
+                {
+                    return 'U';
+                }
+                if (j.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int16_t>::max)()))
+                {
+                    return 'I';
+                }
+                if (use_bjdata && j.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::uint16_t>::max)()))
+                {
+                    return 'u';
+                }
+                if (j.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)()))
+                {
+                    return 'l';
+                }
+                if (use_bjdata && j.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::uint32_t>::max)()))
+                {
+                    return 'm';
+                }
+                if (j.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int64_t>::max)()))
+                {
+                    return 'L';
+                }
+                if (use_bjdata && j.m_value.number_unsigned <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    return 'M';
+                }
+                // anything else is treated as high-precision number
+                return 'H'; // LCOV_EXCL_LINE
+            }
+
+            case value_t::number_float:
+                return get_ubjson_float_prefix(j.m_value.number_float);
+
+            case value_t::string:
+                return 'S';
+
+            case value_t::array: // fallthrough
+            case value_t::binary:
+                return '[';
+
+            case value_t::object:
+                return '{';
+
+            case value_t::discarded:
+            default:  // discarded values
+                return 'N';
+        }
+    }
+
+    static constexpr CharType get_ubjson_float_prefix(float /*unused*/)
+    {
+        return 'd';  // float 32
+    }
+
+    static constexpr CharType get_ubjson_float_prefix(double /*unused*/)
+    {
+        return 'D';  // float 64
+    }
+
+    /*!
+    @return false if the object is successfully converted to a bjdata ndarray, true if the type or size is invalid
+    */
+    bool write_bjdata_ndarray(const typename BasicJsonType::object_t& value, const bool use_count, const bool use_type)
+    {
+        std::map<string_t, CharType> bjdtype = {{"uint8", 'U'},  {"int8", 'i'},  {"uint16", 'u'}, {"int16", 'I'},
+            {"uint32", 'm'}, {"int32", 'l'}, {"uint64", 'M'}, {"int64", 'L'}, {"single", 'd'}, {"double", 'D'}, {"char", 'C'}
+        };
+
+        string_t key = "_ArrayType_";
+        auto it = bjdtype.find(static_cast<string_t>(value.at(key)));
+        if (it == bjdtype.end())
+        {
+            return true;
+        }
+        CharType dtype = it->second;
+
+        key = "_ArraySize_";
+        std::size_t len = (value.at(key).empty() ? 0 : 1);
+        for (const auto& el : value.at(key))
+        {
+            len *= static_cast<std::size_t>(el.m_value.number_unsigned);
+        }
+
+        key = "_ArrayData_";
+        if (value.at(key).size() != len)
+        {
+            return true;
+        }
+
+        oa->write_character('[');
+        oa->write_character('$');
+        oa->write_character(dtype);
+        oa->write_character('#');
+
+        key = "_ArraySize_";
+        write_ubjson(value.at(key), use_count, use_type, true,  true);
+
+        key = "_ArrayData_";
+        if (dtype == 'U' || dtype == 'C')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::uint8_t>(el.m_value.number_unsigned), true);
+            }
+        }
+        else if (dtype == 'i')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::int8_t>(el.m_value.number_integer), true);
+            }
+        }
+        else if (dtype == 'u')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::uint16_t>(el.m_value.number_unsigned), true);
+            }
+        }
+        else if (dtype == 'I')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::int16_t>(el.m_value.number_integer), true);
+            }
+        }
+        else if (dtype == 'm')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::uint32_t>(el.m_value.number_unsigned), true);
+            }
+        }
+        else if (dtype == 'l')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::int32_t>(el.m_value.number_integer), true);
+            }
+        }
+        else if (dtype == 'M')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::uint64_t>(el.m_value.number_unsigned), true);
+            }
+        }
+        else if (dtype == 'L')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::int64_t>(el.m_value.number_integer), true);
+            }
+        }
+        else if (dtype == 'd')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<float>(el.m_value.number_float), true);
+            }
+        }
+        else if (dtype == 'D')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<double>(el.m_value.number_float), true);
+            }
+        }
+        return false;
+    }
+
+    ///////////////////////
+    // Utility functions //
+    ///////////////////////
+
+    /*
+    @brief write a number to output input
+    @param[in] n number of type @a NumberType
+    @param[in] OutputIsLittleEndian Set to true if output data is
+                                 required to be little endian
+    @tparam NumberType the type of the number
+
+    @note This function needs to respect the system's endianness, because bytes
+          in CBOR, MessagePack, and UBJSON are stored in network order (big
+          endian) and therefore need reordering on little endian systems.
+          On the other hand, BSON and BJData use little endian and should reorder
+          on big endian systems.
+    */
+    template<typename NumberType>
+    void write_number(const NumberType n, const bool OutputIsLittleEndian = false)
+    {
+        // step 1: write number to array of length NumberType
+        std::array<CharType, sizeof(NumberType)> vec{};
+        std::memcpy(vec.data(), &n, sizeof(NumberType));
+
+        // step 2: write array to output (with possible reordering)
+        if (is_little_endian != OutputIsLittleEndian)
+        {
+            // reverse byte order prior to conversion if necessary
+            std::reverse(vec.begin(), vec.end());
+        }
+
+        oa->write_characters(vec.data(), sizeof(NumberType));
+    }
+
+    void write_compact_float(const number_float_t n, detail::input_format_t format)
+    {
+#ifdef __GNUC__
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif
+        if (static_cast<double>(n) >= static_cast<double>(std::numeric_limits<float>::lowest()) &&
+                static_cast<double>(n) <= static_cast<double>((std::numeric_limits<float>::max)()) &&
+                static_cast<double>(static_cast<float>(n)) == static_cast<double>(n))
+        {
+            oa->write_character(format == detail::input_format_t::cbor
+                                ? get_cbor_float_prefix(static_cast<float>(n))
+                                : get_msgpack_float_prefix(static_cast<float>(n)));
+            write_number(static_cast<float>(n));
+        }
+        else
+        {
+            oa->write_character(format == detail::input_format_t::cbor
+                                ? get_cbor_float_prefix(n)
+                                : get_msgpack_float_prefix(n));
+            write_number(n);
+        }
+#ifdef __GNUC__
+#pragma GCC diagnostic pop
+#endif
+    }
+
+  public:
+    // The following to_char_type functions are implement the conversion
+    // between uint8_t and CharType. In case CharType is not unsigned,
+    // such a conversion is required to allow values greater than 128.
+    // See <https://github.com/nlohmann/json/issues/1286> for a discussion.
+    template < typename C = CharType,
+               enable_if_t < std::is_signed<C>::value && std::is_signed<char>::value > * = nullptr >
+    static constexpr CharType to_char_type(std::uint8_t x) noexcept
+    {
+        return *reinterpret_cast<char*>(&x);
+    }
+
+    template < typename C = CharType,
+               enable_if_t < std::is_signed<C>::value && std::is_unsigned<char>::value > * = nullptr >
+    static CharType to_char_type(std::uint8_t x) noexcept
+    {
+        static_assert(sizeof(std::uint8_t) == sizeof(CharType), "size of CharType must be equal to std::uint8_t");
+        static_assert(std::is_trivial<CharType>::value, "CharType must be trivial");
+        CharType result;
+        std::memcpy(&result, &x, sizeof(x));
+        return result;
+    }
+
+    template<typename C = CharType,
+             enable_if_t<std::is_unsigned<C>::value>* = nullptr>
+    static constexpr CharType to_char_type(std::uint8_t x) noexcept
+    {
+        return x;
+    }
+
+    template < typename InputCharType, typename C = CharType,
+               enable_if_t <
+                   std::is_signed<C>::value &&
+                   std::is_signed<char>::value &&
+                   std::is_same<char, typename std::remove_cv<InputCharType>::type>::value
+                   > * = nullptr >
+    static constexpr CharType to_char_type(InputCharType x) noexcept
+    {
+        return x;
+    }
+
+  private:
+    /// whether we can assume little endianness
+    const bool is_little_endian = little_endianness();
+
+    /// the output
+    output_adapter_t<CharType> oa = nullptr;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/output/output_adapters.hpp>
+
+// #include <nlohmann/detail/output/serializer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2008-2009 Björn Hoehrmann <bjoern@hoehrmann.de>
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // reverse, remove, fill, find, none_of
+#include <array> // array
+#include <clocale> // localeconv, lconv
+#include <cmath> // labs, isfinite, isnan, signbit
+#include <cstddef> // size_t, ptrdiff_t
+#include <cstdint> // uint8_t
+#include <cstdio> // snprintf
+#include <limits> // numeric_limits
+#include <string> // string, char_traits
+#include <iomanip> // setfill, setw
+#include <type_traits> // is_same
+#include <utility> // move
+
+// #include <nlohmann/detail/conversions/to_chars.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2009 Florian Loitsch <https://florian.loitsch.com/>
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <cmath>   // signbit, isfinite
+#include <cstdint> // intN_t, uintN_t
+#include <cstring> // memcpy, memmove
+#include <limits> // numeric_limits
+#include <type_traits> // conditional
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/*!
+@brief implements the Grisu2 algorithm for binary to decimal floating-point
+conversion.
+
+This implementation is a slightly modified version of the reference
+implementation which may be obtained from
+http://florian.loitsch.com/publications (bench.tar.gz).
+
+The code is distributed under the MIT license, Copyright (c) 2009 Florian Loitsch.
+
+For a detailed description of the algorithm see:
+
+[1] Loitsch, "Printing Floating-Point Numbers Quickly and Accurately with
+    Integers", Proceedings of the ACM SIGPLAN 2010 Conference on Programming
+    Language Design and Implementation, PLDI 2010
+[2] Burger, Dybvig, "Printing Floating-Point Numbers Quickly and Accurately",
+    Proceedings of the ACM SIGPLAN 1996 Conference on Programming Language
+    Design and Implementation, PLDI 1996
+*/
+namespace dtoa_impl
+{
+
+template<typename Target, typename Source>
+Target reinterpret_bits(const Source source)
+{
+    static_assert(sizeof(Target) == sizeof(Source), "size mismatch");
+
+    Target target;
+    std::memcpy(&target, &source, sizeof(Source));
+    return target;
+}
+
+struct diyfp // f * 2^e
+{
+    static constexpr int kPrecision = 64; // = q
+
+    std::uint64_t f = 0;
+    int e = 0;
+
+    constexpr diyfp(std::uint64_t f_, int e_) noexcept : f(f_), e(e_) {}
+
+    /*!
+    @brief returns x - y
+    @pre x.e == y.e and x.f >= y.f
+    */
+    static diyfp sub(const diyfp& x, const diyfp& y) noexcept
+    {
+        JSON_ASSERT(x.e == y.e);
+        JSON_ASSERT(x.f >= y.f);
+
+        return {x.f - y.f, x.e};
+    }
+
+    /*!
+    @brief returns x * y
+    @note The result is rounded. (Only the upper q bits are returned.)
+    */
+    static diyfp mul(const diyfp& x, const diyfp& y) noexcept
+    {
+        static_assert(kPrecision == 64, "internal error");
+
+        // Computes:
+        //  f = round((x.f * y.f) / 2^q)
+        //  e = x.e + y.e + q
+
+        // Emulate the 64-bit * 64-bit multiplication:
+        //
+        // p = u * v
+        //   = (u_lo + 2^32 u_hi) (v_lo + 2^32 v_hi)
+        //   = (u_lo v_lo         ) + 2^32 ((u_lo v_hi         ) + (u_hi v_lo         )) + 2^64 (u_hi v_hi         )
+        //   = (p0                ) + 2^32 ((p1                ) + (p2                )) + 2^64 (p3                )
+        //   = (p0_lo + 2^32 p0_hi) + 2^32 ((p1_lo + 2^32 p1_hi) + (p2_lo + 2^32 p2_hi)) + 2^64 (p3                )
+        //   = (p0_lo             ) + 2^32 (p0_hi + p1_lo + p2_lo                      ) + 2^64 (p1_hi + p2_hi + p3)
+        //   = (p0_lo             ) + 2^32 (Q                                          ) + 2^64 (H                 )
+        //   = (p0_lo             ) + 2^32 (Q_lo + 2^32 Q_hi                           ) + 2^64 (H                 )
+        //
+        // (Since Q might be larger than 2^32 - 1)
+        //
+        //   = (p0_lo + 2^32 Q_lo) + 2^64 (Q_hi + H)
+        //
+        // (Q_hi + H does not overflow a 64-bit int)
+        //
+        //   = p_lo + 2^64 p_hi
+
+        const std::uint64_t u_lo = x.f & 0xFFFFFFFFu;
+        const std::uint64_t u_hi = x.f >> 32u;
+        const std::uint64_t v_lo = y.f & 0xFFFFFFFFu;
+        const std::uint64_t v_hi = y.f >> 32u;
+
+        const std::uint64_t p0 = u_lo * v_lo;
+        const std::uint64_t p1 = u_lo * v_hi;
+        const std::uint64_t p2 = u_hi * v_lo;
+        const std::uint64_t p3 = u_hi * v_hi;
+
+        const std::uint64_t p0_hi = p0 >> 32u;
+        const std::uint64_t p1_lo = p1 & 0xFFFFFFFFu;
+        const std::uint64_t p1_hi = p1 >> 32u;
+        const std::uint64_t p2_lo = p2 & 0xFFFFFFFFu;
+        const std::uint64_t p2_hi = p2 >> 32u;
+
+        std::uint64_t Q = p0_hi + p1_lo + p2_lo;
+
+        // The full product might now be computed as
+        //
+        // p_hi = p3 + p2_hi + p1_hi + (Q >> 32)
+        // p_lo = p0_lo + (Q << 32)
+        //
+        // But in this particular case here, the full p_lo is not required.
+        // Effectively we only need to add the highest bit in p_lo to p_hi (and
+        // Q_hi + 1 does not overflow).
+
+        Q += std::uint64_t{1} << (64u - 32u - 1u); // round, ties up
+
+        const std::uint64_t h = p3 + p2_hi + p1_hi + (Q >> 32u);
+
+        return {h, x.e + y.e + 64};
+    }
+
+    /*!
+    @brief normalize x such that the significand is >= 2^(q-1)
+    @pre x.f != 0
+    */
+    static diyfp normalize(diyfp x) noexcept
+    {
+        JSON_ASSERT(x.f != 0);
+
+        while ((x.f >> 63u) == 0)
+        {
+            x.f <<= 1u;
+            x.e--;
+        }
+
+        return x;
+    }
+
+    /*!
+    @brief normalize x such that the result has the exponent E
+    @pre e >= x.e and the upper e - x.e bits of x.f must be zero.
+    */
+    static diyfp normalize_to(const diyfp& x, const int target_exponent) noexcept
+    {
+        const int delta = x.e - target_exponent;
+
+        JSON_ASSERT(delta >= 0);
+        JSON_ASSERT(((x.f << delta) >> delta) == x.f);
+
+        return {x.f << delta, target_exponent};
+    }
+};
+
+struct boundaries
+{
+    diyfp w;
+    diyfp minus;
+    diyfp plus;
+};
+
+/*!
+Compute the (normalized) diyfp representing the input number 'value' and its
+boundaries.
+
+@pre value must be finite and positive
+*/
+template<typename FloatType>
+boundaries compute_boundaries(FloatType value)
+{
+    JSON_ASSERT(std::isfinite(value));
+    JSON_ASSERT(value > 0);
+
+    // Convert the IEEE representation into a diyfp.
+    //
+    // If v is denormal:
+    //      value = 0.F * 2^(1 - bias) = (          F) * 2^(1 - bias - (p-1))
+    // If v is normalized:
+    //      value = 1.F * 2^(E - bias) = (2^(p-1) + F) * 2^(E - bias - (p-1))
+
+    static_assert(std::numeric_limits<FloatType>::is_iec559,
+                  "internal error: dtoa_short requires an IEEE-754 floating-point implementation");
+
+    constexpr int      kPrecision = std::numeric_limits<FloatType>::digits; // = p (includes the hidden bit)
+    constexpr int      kBias      = std::numeric_limits<FloatType>::max_exponent - 1 + (kPrecision - 1);
+    constexpr int      kMinExp    = 1 - kBias;
+    constexpr std::uint64_t kHiddenBit = std::uint64_t{1} << (kPrecision - 1); // = 2^(p-1)
+
+    using bits_type = typename std::conditional<kPrecision == 24, std::uint32_t, std::uint64_t >::type;
+
+    const auto bits = static_cast<std::uint64_t>(reinterpret_bits<bits_type>(value));
+    const std::uint64_t E = bits >> (kPrecision - 1);
+    const std::uint64_t F = bits & (kHiddenBit - 1);
+
+    const bool is_denormal = E == 0;
+    const diyfp v = is_denormal
+                    ? diyfp(F, kMinExp)
+                    : diyfp(F + kHiddenBit, static_cast<int>(E) - kBias);
+
+    // Compute the boundaries m- and m+ of the floating-point value
+    // v = f * 2^e.
+    //
+    // Determine v- and v+, the floating-point predecessor and successor if v,
+    // respectively.
+    //
+    //      v- = v - 2^e        if f != 2^(p-1) or e == e_min                (A)
+    //         = v - 2^(e-1)    if f == 2^(p-1) and e > e_min                (B)
+    //
+    //      v+ = v + 2^e
+    //
+    // Let m- = (v- + v) / 2 and m+ = (v + v+) / 2. All real numbers _strictly_
+    // between m- and m+ round to v, regardless of how the input rounding
+    // algorithm breaks ties.
+    //
+    //      ---+-------------+-------------+-------------+-------------+---  (A)
+    //         v-            m-            v             m+            v+
+    //
+    //      -----------------+------+------+-------------+-------------+---  (B)
+    //                       v-     m-     v             m+            v+
+
+    const bool lower_boundary_is_closer = F == 0 && E > 1;
+    const diyfp m_plus = diyfp(2 * v.f + 1, v.e - 1);
+    const diyfp m_minus = lower_boundary_is_closer
+                          ? diyfp(4 * v.f - 1, v.e - 2)  // (B)
+                          : diyfp(2 * v.f - 1, v.e - 1); // (A)
+
+    // Determine the normalized w+ = m+.
+    const diyfp w_plus = diyfp::normalize(m_plus);
+
+    // Determine w- = m- such that e_(w-) = e_(w+).
+    const diyfp w_minus = diyfp::normalize_to(m_minus, w_plus.e);
+
+    return {diyfp::normalize(v), w_minus, w_plus};
+}
+
+// Given normalized diyfp w, Grisu needs to find a (normalized) cached
+// power-of-ten c, such that the exponent of the product c * w = f * 2^e lies
+// within a certain range [alpha, gamma] (Definition 3.2 from [1])
+//
+//      alpha <= e = e_c + e_w + q <= gamma
+//
+// or
+//
+//      f_c * f_w * 2^alpha <= f_c 2^(e_c) * f_w 2^(e_w) * 2^q
+//                          <= f_c * f_w * 2^gamma
+//
+// Since c and w are normalized, i.e. 2^(q-1) <= f < 2^q, this implies
+//
+//      2^(q-1) * 2^(q-1) * 2^alpha <= c * w * 2^q < 2^q * 2^q * 2^gamma
+//
+// or
+//
+//      2^(q - 2 + alpha) <= c * w < 2^(q + gamma)
+//
+// The choice of (alpha,gamma) determines the size of the table and the form of
+// the digit generation procedure. Using (alpha,gamma)=(-60,-32) works out well
+// in practice:
+//
+// The idea is to cut the number c * w = f * 2^e into two parts, which can be
+// processed independently: An integral part p1, and a fractional part p2:
+//
+//      f * 2^e = ( (f div 2^-e) * 2^-e + (f mod 2^-e) ) * 2^e
+//              = (f div 2^-e) + (f mod 2^-e) * 2^e
+//              = p1 + p2 * 2^e
+//
+// The conversion of p1 into decimal form requires a series of divisions and
+// modulos by (a power of) 10. These operations are faster for 32-bit than for
+// 64-bit integers, so p1 should ideally fit into a 32-bit integer. This can be
+// achieved by choosing
+//
+//      -e >= 32   or   e <= -32 := gamma
+//
+// In order to convert the fractional part
+//
+//      p2 * 2^e = p2 / 2^-e = d[-1] / 10^1 + d[-2] / 10^2 + ...
+//
+// into decimal form, the fraction is repeatedly multiplied by 10 and the digits
+// d[-i] are extracted in order:
+//
+//      (10 * p2) div 2^-e = d[-1]
+//      (10 * p2) mod 2^-e = d[-2] / 10^1 + ...
+//
+// The multiplication by 10 must not overflow. It is sufficient to choose
+//
+//      10 * p2 < 16 * p2 = 2^4 * p2 <= 2^64.
+//
+// Since p2 = f mod 2^-e < 2^-e,
+//
+//      -e <= 60   or   e >= -60 := alpha
+
+constexpr int kAlpha = -60;
+constexpr int kGamma = -32;
+
+struct cached_power // c = f * 2^e ~= 10^k
+{
+    std::uint64_t f;
+    int e;
+    int k;
+};
+
+/*!
+For a normalized diyfp w = f * 2^e, this function returns a (normalized) cached
+power-of-ten c = f_c * 2^e_c, such that the exponent of the product w * c
+satisfies (Definition 3.2 from [1])
+
+     alpha <= e_c + e + q <= gamma.
+*/
+inline cached_power get_cached_power_for_binary_exponent(int e)
+{
+    // Now
+    //
+    //      alpha <= e_c + e + q <= gamma                                    (1)
+    //      ==> f_c * 2^alpha <= c * 2^e * 2^q
+    //
+    // and since the c's are normalized, 2^(q-1) <= f_c,
+    //
+    //      ==> 2^(q - 1 + alpha) <= c * 2^(e + q)
+    //      ==> 2^(alpha - e - 1) <= c
+    //
+    // If c were an exact power of ten, i.e. c = 10^k, one may determine k as
+    //
+    //      k = ceil( log_10( 2^(alpha - e - 1) ) )
+    //        = ceil( (alpha - e - 1) * log_10(2) )
+    //
+    // From the paper:
+    // "In theory the result of the procedure could be wrong since c is rounded,
+    //  and the computation itself is approximated [...]. In practice, however,
+    //  this simple function is sufficient."
+    //
+    // For IEEE double precision floating-point numbers converted into
+    // normalized diyfp's w = f * 2^e, with q = 64,
+    //
+    //      e >= -1022      (min IEEE exponent)
+    //           -52        (p - 1)
+    //           -52        (p - 1, possibly normalize denormal IEEE numbers)
+    //           -11        (normalize the diyfp)
+    //         = -1137
+    //
+    // and
+    //
+    //      e <= +1023      (max IEEE exponent)
+    //           -52        (p - 1)
+    //           -11        (normalize the diyfp)
+    //         = 960
+    //
+    // This binary exponent range [-1137,960] results in a decimal exponent
+    // range [-307,324]. One does not need to store a cached power for each
+    // k in this range. For each such k it suffices to find a cached power
+    // such that the exponent of the product lies in [alpha,gamma].
+    // This implies that the difference of the decimal exponents of adjacent
+    // table entries must be less than or equal to
+    //
+    //      floor( (gamma - alpha) * log_10(2) ) = 8.
+    //
+    // (A smaller distance gamma-alpha would require a larger table.)
+
+    // NB:
+    // Actually this function returns c, such that -60 <= e_c + e + 64 <= -34.
+
+    constexpr int kCachedPowersMinDecExp = -300;
+    constexpr int kCachedPowersDecStep = 8;
+
+    static constexpr std::array<cached_power, 79> kCachedPowers =
+    {
+        {
+            { 0xAB70FE17C79AC6CA, -1060, -300 },
+            { 0xFF77B1FCBEBCDC4F, -1034, -292 },
+            { 0xBE5691EF416BD60C, -1007, -284 },
+            { 0x8DD01FAD907FFC3C,  -980, -276 },
+            { 0xD3515C2831559A83,  -954, -268 },
+            { 0x9D71AC8FADA6C9B5,  -927, -260 },
+            { 0xEA9C227723EE8BCB,  -901, -252 },
+            { 0xAECC49914078536D,  -874, -244 },
+            { 0x823C12795DB6CE57,  -847, -236 },
+            { 0xC21094364DFB5637,  -821, -228 },
+            { 0x9096EA6F3848984F,  -794, -220 },
+            { 0xD77485CB25823AC7,  -768, -212 },
+            { 0xA086CFCD97BF97F4,  -741, -204 },
+            { 0xEF340A98172AACE5,  -715, -196 },
+            { 0xB23867FB2A35B28E,  -688, -188 },
+            { 0x84C8D4DFD2C63F3B,  -661, -180 },
+            { 0xC5DD44271AD3CDBA,  -635, -172 },
+            { 0x936B9FCEBB25C996,  -608, -164 },
+            { 0xDBAC6C247D62A584,  -582, -156 },
+            { 0xA3AB66580D5FDAF6,  -555, -148 },
+            { 0xF3E2F893DEC3F126,  -529, -140 },
+            { 0xB5B5ADA8AAFF80B8,  -502, -132 },
+            { 0x87625F056C7C4A8B,  -475, -124 },
+            { 0xC9BCFF6034C13053,  -449, -116 },
+            { 0x964E858C91BA2655,  -422, -108 },
+            { 0xDFF9772470297EBD,  -396, -100 },
+            { 0xA6DFBD9FB8E5B88F,  -369,  -92 },
+            { 0xF8A95FCF88747D94,  -343,  -84 },
+            { 0xB94470938FA89BCF,  -316,  -76 },
+            { 0x8A08F0F8BF0F156B,  -289,  -68 },
+            { 0xCDB02555653131B6,  -263,  -60 },
+            { 0x993FE2C6D07B7FAC,  -236,  -52 },
+            { 0xE45C10C42A2B3B06,  -210,  -44 },
+            { 0xAA242499697392D3,  -183,  -36 },
+            { 0xFD87B5F28300CA0E,  -157,  -28 },
+            { 0xBCE5086492111AEB,  -130,  -20 },
+            { 0x8CBCCC096F5088CC,  -103,  -12 },
+            { 0xD1B71758E219652C,   -77,   -4 },
+            { 0x9C40000000000000,   -50,    4 },
+            { 0xE8D4A51000000000,   -24,   12 },
+            { 0xAD78EBC5AC620000,     3,   20 },
+            { 0x813F3978F8940984,    30,   28 },
+            { 0xC097CE7BC90715B3,    56,   36 },
+            { 0x8F7E32CE7BEA5C70,    83,   44 },
+            { 0xD5D238A4ABE98068,   109,   52 },
+            { 0x9F4F2726179A2245,   136,   60 },
+            { 0xED63A231D4C4FB27,   162,   68 },
+            { 0xB0DE65388CC8ADA8,   189,   76 },
+            { 0x83C7088E1AAB65DB,   216,   84 },
+            { 0xC45D1DF942711D9A,   242,   92 },
+            { 0x924D692CA61BE758,   269,  100 },
+            { 0xDA01EE641A708DEA,   295,  108 },
+            { 0xA26DA3999AEF774A,   322,  116 },
+            { 0xF209787BB47D6B85,   348,  124 },
+            { 0xB454E4A179DD1877,   375,  132 },
+            { 0x865B86925B9BC5C2,   402,  140 },
+            { 0xC83553C5C8965D3D,   428,  148 },
+            { 0x952AB45CFA97A0B3,   455,  156 },
+            { 0xDE469FBD99A05FE3,   481,  164 },
+            { 0xA59BC234DB398C25,   508,  172 },
+            { 0xF6C69A72A3989F5C,   534,  180 },
+            { 0xB7DCBF5354E9BECE,   561,  188 },
+            { 0x88FCF317F22241E2,   588,  196 },
+            { 0xCC20CE9BD35C78A5,   614,  204 },
+            { 0x98165AF37B2153DF,   641,  212 },
+            { 0xE2A0B5DC971F303A,   667,  220 },
+            { 0xA8D9D1535CE3B396,   694,  228 },
+            { 0xFB9B7CD9A4A7443C,   720,  236 },
+            { 0xBB764C4CA7A44410,   747,  244 },
+            { 0x8BAB8EEFB6409C1A,   774,  252 },
+            { 0xD01FEF10A657842C,   800,  260 },
+            { 0x9B10A4E5E9913129,   827,  268 },
+            { 0xE7109BFBA19C0C9D,   853,  276 },
+            { 0xAC2820D9623BF429,   880,  284 },
+            { 0x80444B5E7AA7CF85,   907,  292 },
+            { 0xBF21E44003ACDD2D,   933,  300 },
+            { 0x8E679C2F5E44FF8F,   960,  308 },
+            { 0xD433179D9C8CB841,   986,  316 },
+            { 0x9E19DB92B4E31BA9,  1013,  324 },
+        }
+    };
+
+    // This computation gives exactly the same results for k as
+    //      k = ceil((kAlpha - e - 1) * 0.30102999566398114)
+    // for |e| <= 1500, but doesn't require floating-point operations.
+    // NB: log_10(2) ~= 78913 / 2^18
+    JSON_ASSERT(e >= -1500);
+    JSON_ASSERT(e <=  1500);
+    const int f = kAlpha - e - 1;
+    const int k = (f * 78913) / (1 << 18) + static_cast<int>(f > 0);
+
+    const int index = (-kCachedPowersMinDecExp + k + (kCachedPowersDecStep - 1)) / kCachedPowersDecStep;
+    JSON_ASSERT(index >= 0);
+    JSON_ASSERT(static_cast<std::size_t>(index) < kCachedPowers.size());
+
+    const cached_power cached = kCachedPowers[static_cast<std::size_t>(index)];
+    JSON_ASSERT(kAlpha <= cached.e + e + 64);
+    JSON_ASSERT(kGamma >= cached.e + e + 64);
+
+    return cached;
+}
+
+/*!
+For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k.
+For n == 0, returns 1 and sets pow10 := 1.
+*/
+inline int find_largest_pow10(const std::uint32_t n, std::uint32_t& pow10)
+{
+    // LCOV_EXCL_START
+    if (n >= 1000000000)
+    {
+        pow10 = 1000000000;
+        return 10;
+    }
+    // LCOV_EXCL_STOP
+    if (n >= 100000000)
+    {
+        pow10 = 100000000;
+        return  9;
+    }
+    if (n >= 10000000)
+    {
+        pow10 = 10000000;
+        return  8;
+    }
+    if (n >= 1000000)
+    {
+        pow10 = 1000000;
+        return  7;
+    }
+    if (n >= 100000)
+    {
+        pow10 = 100000;
+        return  6;
+    }
+    if (n >= 10000)
+    {
+        pow10 = 10000;
+        return  5;
+    }
+    if (n >= 1000)
+    {
+        pow10 = 1000;
+        return  4;
+    }
+    if (n >= 100)
+    {
+        pow10 = 100;
+        return  3;
+    }
+    if (n >= 10)
+    {
+        pow10 = 10;
+        return  2;
+    }
+
+    pow10 = 1;
+    return 1;
+}
+
+inline void grisu2_round(char* buf, int len, std::uint64_t dist, std::uint64_t delta,
+                         std::uint64_t rest, std::uint64_t ten_k)
+{
+    JSON_ASSERT(len >= 1);
+    JSON_ASSERT(dist <= delta);
+    JSON_ASSERT(rest <= delta);
+    JSON_ASSERT(ten_k > 0);
+
+    //               <--------------------------- delta ---->
+    //                                  <---- dist --------->
+    // --------------[------------------+-------------------]--------------
+    //               M-                 w                   M+
+    //
+    //                                  ten_k
+    //                                <------>
+    //                                       <---- rest ---->
+    // --------------[------------------+----+--------------]--------------
+    //                                  w    V
+    //                                       = buf * 10^k
+    //
+    // ten_k represents a unit-in-the-last-place in the decimal representation
+    // stored in buf.
+    // Decrement buf by ten_k while this takes buf closer to w.
+
+    // The tests are written in this order to avoid overflow in unsigned
+    // integer arithmetic.
+
+    while (rest < dist
+            && delta - rest >= ten_k
+            && (rest + ten_k < dist || dist - rest > rest + ten_k - dist))
+    {
+        JSON_ASSERT(buf[len - 1] != '0');
+        buf[len - 1]--;
+        rest += ten_k;
+    }
+}
+
+/*!
+Generates V = buffer * 10^decimal_exponent, such that M- <= V <= M+.
+M- and M+ must be normalized and share the same exponent -60 <= e <= -32.
+*/
+inline void grisu2_digit_gen(char* buffer, int& length, int& decimal_exponent,
+                             diyfp M_minus, diyfp w, diyfp M_plus)
+{
+    static_assert(kAlpha >= -60, "internal error");
+    static_assert(kGamma <= -32, "internal error");
+
+    // Generates the digits (and the exponent) of a decimal floating-point
+    // number V = buffer * 10^decimal_exponent in the range [M-, M+]. The diyfp's
+    // w, M- and M+ share the same exponent e, which satisfies alpha <= e <= gamma.
+    //
+    //               <--------------------------- delta ---->
+    //                                  <---- dist --------->
+    // --------------[------------------+-------------------]--------------
+    //               M-                 w                   M+
+    //
+    // Grisu2 generates the digits of M+ from left to right and stops as soon as
+    // V is in [M-,M+].
+
+    JSON_ASSERT(M_plus.e >= kAlpha);
+    JSON_ASSERT(M_plus.e <= kGamma);
+
+    std::uint64_t delta = diyfp::sub(M_plus, M_minus).f; // (significand of (M+ - M-), implicit exponent is e)
+    std::uint64_t dist  = diyfp::sub(M_plus, w      ).f; // (significand of (M+ - w ), implicit exponent is e)
+
+    // Split M+ = f * 2^e into two parts p1 and p2 (note: e < 0):
+    //
+    //      M+ = f * 2^e
+    //         = ((f div 2^-e) * 2^-e + (f mod 2^-e)) * 2^e
+    //         = ((p1        ) * 2^-e + (p2        )) * 2^e
+    //         = p1 + p2 * 2^e
+
+    const diyfp one(std::uint64_t{1} << -M_plus.e, M_plus.e);
+
+    auto p1 = static_cast<std::uint32_t>(M_plus.f >> -one.e); // p1 = f div 2^-e (Since -e >= 32, p1 fits into a 32-bit int.)
+    std::uint64_t p2 = M_plus.f & (one.f - 1);                    // p2 = f mod 2^-e
+
+    // 1)
+    //
+    // Generate the digits of the integral part p1 = d[n-1]...d[1]d[0]
+
+    JSON_ASSERT(p1 > 0);
+
+    std::uint32_t pow10{};
+    const int k = find_largest_pow10(p1, pow10);
+
+    //      10^(k-1) <= p1 < 10^k, pow10 = 10^(k-1)
+    //
+    //      p1 = (p1 div 10^(k-1)) * 10^(k-1) + (p1 mod 10^(k-1))
+    //         = (d[k-1]         ) * 10^(k-1) + (p1 mod 10^(k-1))
+    //
+    //      M+ = p1                                             + p2 * 2^e
+    //         = d[k-1] * 10^(k-1) + (p1 mod 10^(k-1))          + p2 * 2^e
+    //         = d[k-1] * 10^(k-1) + ((p1 mod 10^(k-1)) * 2^-e + p2) * 2^e
+    //         = d[k-1] * 10^(k-1) + (                         rest) * 2^e
+    //
+    // Now generate the digits d[n] of p1 from left to right (n = k-1,...,0)
+    //
+    //      p1 = d[k-1]...d[n] * 10^n + d[n-1]...d[0]
+    //
+    // but stop as soon as
+    //
+    //      rest * 2^e = (d[n-1]...d[0] * 2^-e + p2) * 2^e <= delta * 2^e
+
+    int n = k;
+    while (n > 0)
+    {
+        // Invariants:
+        //      M+ = buffer * 10^n + (p1 + p2 * 2^e)    (buffer = 0 for n = k)
+        //      pow10 = 10^(n-1) <= p1 < 10^n
+        //
+        const std::uint32_t d = p1 / pow10;  // d = p1 div 10^(n-1)
+        const std::uint32_t r = p1 % pow10;  // r = p1 mod 10^(n-1)
+        //
+        //      M+ = buffer * 10^n + (d * 10^(n-1) + r) + p2 * 2^e
+        //         = (buffer * 10 + d) * 10^(n-1) + (r + p2 * 2^e)
+        //
+        JSON_ASSERT(d <= 9);
+        buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d
+        //
+        //      M+ = buffer * 10^(n-1) + (r + p2 * 2^e)
+        //
+        p1 = r;
+        n--;
+        //
+        //      M+ = buffer * 10^n + (p1 + p2 * 2^e)
+        //      pow10 = 10^n
+        //
+
+        // Now check if enough digits have been generated.
+        // Compute
+        //
+        //      p1 + p2 * 2^e = (p1 * 2^-e + p2) * 2^e = rest * 2^e
+        //
+        // Note:
+        // Since rest and delta share the same exponent e, it suffices to
+        // compare the significands.
+        const std::uint64_t rest = (std::uint64_t{p1} << -one.e) + p2;
+        if (rest <= delta)
+        {
+            // V = buffer * 10^n, with M- <= V <= M+.
+
+            decimal_exponent += n;
+
+            // We may now just stop. But instead look if the buffer could be
+            // decremented to bring V closer to w.
+            //
+            // pow10 = 10^n is now 1 ulp in the decimal representation V.
+            // The rounding procedure works with diyfp's with an implicit
+            // exponent of e.
+            //
+            //      10^n = (10^n * 2^-e) * 2^e = ulp * 2^e
+            //
+            const std::uint64_t ten_n = std::uint64_t{pow10} << -one.e;
+            grisu2_round(buffer, length, dist, delta, rest, ten_n);
+
+            return;
+        }
+
+        pow10 /= 10;
+        //
+        //      pow10 = 10^(n-1) <= p1 < 10^n
+        // Invariants restored.
+    }
+
+    // 2)
+    //
+    // The digits of the integral part have been generated:
+    //
+    //      M+ = d[k-1]...d[1]d[0] + p2 * 2^e
+    //         = buffer            + p2 * 2^e
+    //
+    // Now generate the digits of the fractional part p2 * 2^e.
+    //
+    // Note:
+    // No decimal point is generated: the exponent is adjusted instead.
+    //
+    // p2 actually represents the fraction
+    //
+    //      p2 * 2^e
+    //          = p2 / 2^-e
+    //          = d[-1] / 10^1 + d[-2] / 10^2 + ...
+    //
+    // Now generate the digits d[-m] of p1 from left to right (m = 1,2,...)
+    //
+    //      p2 * 2^e = d[-1]d[-2]...d[-m] * 10^-m
+    //                      + 10^-m * (d[-m-1] / 10^1 + d[-m-2] / 10^2 + ...)
+    //
+    // using
+    //
+    //      10^m * p2 = ((10^m * p2) div 2^-e) * 2^-e + ((10^m * p2) mod 2^-e)
+    //                = (                   d) * 2^-e + (                   r)
+    //
+    // or
+    //      10^m * p2 * 2^e = d + r * 2^e
+    //
+    // i.e.
+    //
+    //      M+ = buffer + p2 * 2^e
+    //         = buffer + 10^-m * (d + r * 2^e)
+    //         = (buffer * 10^m + d) * 10^-m + 10^-m * r * 2^e
+    //
+    // and stop as soon as 10^-m * r * 2^e <= delta * 2^e
+
+    JSON_ASSERT(p2 > delta);
+
+    int m = 0;
+    for (;;)
+    {
+        // Invariant:
+        //      M+ = buffer * 10^-m + 10^-m * (d[-m-1] / 10 + d[-m-2] / 10^2 + ...) * 2^e
+        //         = buffer * 10^-m + 10^-m * (p2                                 ) * 2^e
+        //         = buffer * 10^-m + 10^-m * (1/10 * (10 * p2)                   ) * 2^e
+        //         = buffer * 10^-m + 10^-m * (1/10 * ((10*p2 div 2^-e) * 2^-e + (10*p2 mod 2^-e)) * 2^e
+        //
+        JSON_ASSERT(p2 <= (std::numeric_limits<std::uint64_t>::max)() / 10);
+        p2 *= 10;
+        const std::uint64_t d = p2 >> -one.e;     // d = (10 * p2) div 2^-e
+        const std::uint64_t r = p2 & (one.f - 1); // r = (10 * p2) mod 2^-e
+        //
+        //      M+ = buffer * 10^-m + 10^-m * (1/10 * (d * 2^-e + r) * 2^e
+        //         = buffer * 10^-m + 10^-m * (1/10 * (d + r * 2^e))
+        //         = (buffer * 10 + d) * 10^(-m-1) + 10^(-m-1) * r * 2^e
+        //
+        JSON_ASSERT(d <= 9);
+        buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d
+        //
+        //      M+ = buffer * 10^(-m-1) + 10^(-m-1) * r * 2^e
+        //
+        p2 = r;
+        m++;
+        //
+        //      M+ = buffer * 10^-m + 10^-m * p2 * 2^e
+        // Invariant restored.
+
+        // Check if enough digits have been generated.
+        //
+        //      10^-m * p2 * 2^e <= delta * 2^e
+        //              p2 * 2^e <= 10^m * delta * 2^e
+        //                    p2 <= 10^m * delta
+        delta *= 10;
+        dist  *= 10;
+        if (p2 <= delta)
+        {
+            break;
+        }
+    }
+
+    // V = buffer * 10^-m, with M- <= V <= M+.
+
+    decimal_exponent -= m;
+
+    // 1 ulp in the decimal representation is now 10^-m.
+    // Since delta and dist are now scaled by 10^m, we need to do the
+    // same with ulp in order to keep the units in sync.
+    //
+    //      10^m * 10^-m = 1 = 2^-e * 2^e = ten_m * 2^e
+    //
+    const std::uint64_t ten_m = one.f;
+    grisu2_round(buffer, length, dist, delta, p2, ten_m);
+
+    // By construction this algorithm generates the shortest possible decimal
+    // number (Loitsch, Theorem 6.2) which rounds back to w.
+    // For an input number of precision p, at least
+    //
+    //      N = 1 + ceil(p * log_10(2))
+    //
+    // decimal digits are sufficient to identify all binary floating-point
+    // numbers (Matula, "In-and-Out conversions").
+    // This implies that the algorithm does not produce more than N decimal
+    // digits.
+    //
+    //      N = 17 for p = 53 (IEEE double precision)
+    //      N = 9  for p = 24 (IEEE single precision)
+}
+
+/*!
+v = buf * 10^decimal_exponent
+len is the length of the buffer (number of decimal digits)
+The buffer must be large enough, i.e. >= max_digits10.
+*/
+JSON_HEDLEY_NON_NULL(1)
+inline void grisu2(char* buf, int& len, int& decimal_exponent,
+                   diyfp m_minus, diyfp v, diyfp m_plus)
+{
+    JSON_ASSERT(m_plus.e == m_minus.e);
+    JSON_ASSERT(m_plus.e == v.e);
+
+    //  --------(-----------------------+-----------------------)--------    (A)
+    //          m-                      v                       m+
+    //
+    //  --------------------(-----------+-----------------------)--------    (B)
+    //                      m-          v                       m+
+    //
+    // First scale v (and m- and m+) such that the exponent is in the range
+    // [alpha, gamma].
+
+    const cached_power cached = get_cached_power_for_binary_exponent(m_plus.e);
+
+    const diyfp c_minus_k(cached.f, cached.e); // = c ~= 10^-k
+
+    // The exponent of the products is = v.e + c_minus_k.e + q and is in the range [alpha,gamma]
+    const diyfp w       = diyfp::mul(v,       c_minus_k);
+    const diyfp w_minus = diyfp::mul(m_minus, c_minus_k);
+    const diyfp w_plus  = diyfp::mul(m_plus,  c_minus_k);
+
+    //  ----(---+---)---------------(---+---)---------------(---+---)----
+    //          w-                      w                       w+
+    //          = c*m-                  = c*v                   = c*m+
+    //
+    // diyfp::mul rounds its result and c_minus_k is approximated too. w, w- and
+    // w+ are now off by a small amount.
+    // In fact:
+    //
+    //      w - v * 10^k < 1 ulp
+    //
+    // To account for this inaccuracy, add resp. subtract 1 ulp.
+    //
+    //  --------+---[---------------(---+---)---------------]---+--------
+    //          w-  M-                  w                   M+  w+
+    //
+    // Now any number in [M-, M+] (bounds included) will round to w when input,
+    // regardless of how the input rounding algorithm breaks ties.
+    //
+    // And digit_gen generates the shortest possible such number in [M-, M+].
+    // Note that this does not mean that Grisu2 always generates the shortest
+    // possible number in the interval (m-, m+).
+    const diyfp M_minus(w_minus.f + 1, w_minus.e);
+    const diyfp M_plus (w_plus.f  - 1, w_plus.e );
+
+    decimal_exponent = -cached.k; // = -(-k) = k
+
+    grisu2_digit_gen(buf, len, decimal_exponent, M_minus, w, M_plus);
+}
+
+/*!
+v = buf * 10^decimal_exponent
+len is the length of the buffer (number of decimal digits)
+The buffer must be large enough, i.e. >= max_digits10.
+*/
+template<typename FloatType>
+JSON_HEDLEY_NON_NULL(1)
+void grisu2(char* buf, int& len, int& decimal_exponent, FloatType value)
+{
+    static_assert(diyfp::kPrecision >= std::numeric_limits<FloatType>::digits + 3,
+                  "internal error: not enough precision");
+
+    JSON_ASSERT(std::isfinite(value));
+    JSON_ASSERT(value > 0);
+
+    // If the neighbors (and boundaries) of 'value' are always computed for double-precision
+    // numbers, all float's can be recovered using strtod (and strtof). However, the resulting
+    // decimal representations are not exactly "short".
+    //
+    // The documentation for 'std::to_chars' (https://en.cppreference.com/w/cpp/utility/to_chars)
+    // says "value is converted to a string as if by std::sprintf in the default ("C") locale"
+    // and since sprintf promotes floats to doubles, I think this is exactly what 'std::to_chars'
+    // does.
+    // On the other hand, the documentation for 'std::to_chars' requires that "parsing the
+    // representation using the corresponding std::from_chars function recovers value exactly". That
+    // indicates that single precision floating-point numbers should be recovered using
+    // 'std::strtof'.
+    //
+    // NB: If the neighbors are computed for single-precision numbers, there is a single float
+    //     (7.0385307e-26f) which can't be recovered using strtod. The resulting double precision
+    //     value is off by 1 ulp.
+#if 0
+    const boundaries w = compute_boundaries(static_cast<double>(value));
+#else
+    const boundaries w = compute_boundaries(value);
+#endif
+
+    grisu2(buf, len, decimal_exponent, w.minus, w.w, w.plus);
+}
+
+/*!
+@brief appends a decimal representation of e to buf
+@return a pointer to the element following the exponent.
+@pre -1000 < e < 1000
+*/
+JSON_HEDLEY_NON_NULL(1)
+JSON_HEDLEY_RETURNS_NON_NULL
+inline char* append_exponent(char* buf, int e)
+{
+    JSON_ASSERT(e > -1000);
+    JSON_ASSERT(e <  1000);
+
+    if (e < 0)
+    {
+        e = -e;
+        *buf++ = '-';
+    }
+    else
+    {
+        *buf++ = '+';
+    }
+
+    auto k = static_cast<std::uint32_t>(e);
+    if (k < 10)
+    {
+        // Always print at least two digits in the exponent.
+        // This is for compatibility with printf("%g").
+        *buf++ = '0';
+        *buf++ = static_cast<char>('0' + k);
+    }
+    else if (k < 100)
+    {
+        *buf++ = static_cast<char>('0' + k / 10);
+        k %= 10;
+        *buf++ = static_cast<char>('0' + k);
+    }
+    else
+    {
+        *buf++ = static_cast<char>('0' + k / 100);
+        k %= 100;
+        *buf++ = static_cast<char>('0' + k / 10);
+        k %= 10;
+        *buf++ = static_cast<char>('0' + k);
+    }
+
+    return buf;
+}
+
+/*!
+@brief prettify v = buf * 10^decimal_exponent
+
+If v is in the range [10^min_exp, 10^max_exp) it will be printed in fixed-point
+notation. Otherwise it will be printed in exponential notation.
+
+@pre min_exp < 0
+@pre max_exp > 0
+*/
+JSON_HEDLEY_NON_NULL(1)
+JSON_HEDLEY_RETURNS_NON_NULL
+inline char* format_buffer(char* buf, int len, int decimal_exponent,
+                           int min_exp, int max_exp)
+{
+    JSON_ASSERT(min_exp < 0);
+    JSON_ASSERT(max_exp > 0);
+
+    const int k = len;
+    const int n = len + decimal_exponent;
+
+    // v = buf * 10^(n-k)
+    // k is the length of the buffer (number of decimal digits)
+    // n is the position of the decimal point relative to the start of the buffer.
+
+    if (k <= n && n <= max_exp)
+    {
+        // digits[000]
+        // len <= max_exp + 2
+
+        std::memset(buf + k, '0', static_cast<size_t>(n) - static_cast<size_t>(k));
+        // Make it look like a floating-point number (#362, #378)
+        buf[n + 0] = '.';
+        buf[n + 1] = '0';
+        return buf + (static_cast<size_t>(n) + 2);
+    }
+
+    if (0 < n && n <= max_exp)
+    {
+        // dig.its
+        // len <= max_digits10 + 1
+
+        JSON_ASSERT(k > n);
+
+        std::memmove(buf + (static_cast<size_t>(n) + 1), buf + n, static_cast<size_t>(k) - static_cast<size_t>(n));
+        buf[n] = '.';
+        return buf + (static_cast<size_t>(k) + 1U);
+    }
+
+    if (min_exp < n && n <= 0)
+    {
+        // 0.[000]digits
+        // len <= 2 + (-min_exp - 1) + max_digits10
+
+        std::memmove(buf + (2 + static_cast<size_t>(-n)), buf, static_cast<size_t>(k));
+        buf[0] = '0';
+        buf[1] = '.';
+        std::memset(buf + 2, '0', static_cast<size_t>(-n));
+        return buf + (2U + static_cast<size_t>(-n) + static_cast<size_t>(k));
+    }
+
+    if (k == 1)
+    {
+        // dE+123
+        // len <= 1 + 5
+
+        buf += 1;
+    }
+    else
+    {
+        // d.igitsE+123
+        // len <= max_digits10 + 1 + 5
+
+        std::memmove(buf + 2, buf + 1, static_cast<size_t>(k) - 1);
+        buf[1] = '.';
+        buf += 1 + static_cast<size_t>(k);
+    }
+
+    *buf++ = 'e';
+    return append_exponent(buf, n - 1);
+}
+
+}  // namespace dtoa_impl
+
+/*!
+@brief generates a decimal representation of the floating-point number value in [first, last).
+
+The format of the resulting decimal representation is similar to printf's %g
+format. Returns an iterator pointing past-the-end of the decimal representation.
+
+@note The input number must be finite, i.e. NaN's and Inf's are not supported.
+@note The buffer must be large enough.
+@note The result is NOT null-terminated.
+*/
+template<typename FloatType>
+JSON_HEDLEY_NON_NULL(1, 2)
+JSON_HEDLEY_RETURNS_NON_NULL
+char* to_chars(char* first, const char* last, FloatType value)
+{
+    static_cast<void>(last); // maybe unused - fix warning
+    JSON_ASSERT(std::isfinite(value));
+
+    // Use signbit(value) instead of (value < 0) since signbit works for -0.
+    if (std::signbit(value))
+    {
+        value = -value;
+        *first++ = '-';
+    }
+
+#ifdef __GNUC__
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif
+    if (value == 0) // +-0
+    {
+        *first++ = '0';
+        // Make it look like a floating-point number (#362, #378)
+        *first++ = '.';
+        *first++ = '0';
+        return first;
+    }
+#ifdef __GNUC__
+#pragma GCC diagnostic pop
+#endif
+
+    JSON_ASSERT(last - first >= std::numeric_limits<FloatType>::max_digits10);
+
+    // Compute v = buffer * 10^decimal_exponent.
+    // The decimal digits are stored in the buffer, which needs to be interpreted
+    // as an unsigned decimal integer.
+    // len is the length of the buffer, i.e. the number of decimal digits.
+    int len = 0;
+    int decimal_exponent = 0;
+    dtoa_impl::grisu2(first, len, decimal_exponent, value);
+
+    JSON_ASSERT(len <= std::numeric_limits<FloatType>::max_digits10);
+
+    // Format the buffer like printf("%.*g", prec, value)
+    constexpr int kMinExp = -4;
+    // Use digits10 here to increase compatibility with version 2.
+    constexpr int kMaxExp = std::numeric_limits<FloatType>::digits10;
+
+    JSON_ASSERT(last - first >= kMaxExp + 2);
+    JSON_ASSERT(last - first >= 2 + (-kMinExp - 1) + std::numeric_limits<FloatType>::max_digits10);
+    JSON_ASSERT(last - first >= std::numeric_limits<FloatType>::max_digits10 + 6);
+
+    return dtoa_impl::format_buffer(first, len, decimal_exponent, kMinExp, kMaxExp);
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/output/binary_writer.hpp>
+
+// #include <nlohmann/detail/output/output_adapters.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+///////////////////
+// serialization //
+///////////////////
+
+/// how to treat decoding errors
+enum class error_handler_t
+{
+    strict,  ///< throw a type_error exception in case of invalid UTF-8
+    replace, ///< replace invalid UTF-8 sequences with U+FFFD
+    ignore   ///< ignore invalid UTF-8 sequences
+};
+
+template<typename BasicJsonType>
+class serializer
+{
+    using string_t = typename BasicJsonType::string_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using binary_char_t = typename BasicJsonType::binary_t::value_type;
+    static constexpr std::uint8_t UTF8_ACCEPT = 0;
+    static constexpr std::uint8_t UTF8_REJECT = 1;
+
+  public:
+    /*!
+    @param[in] s  output stream to serialize to
+    @param[in] ichar  indentation character to use
+    @param[in] error_handler_  how to react on decoding errors
+    */
+    serializer(output_adapter_t<char> s, const char ichar,
+               error_handler_t error_handler_ = error_handler_t::strict)
+        : o(std::move(s))
+        , loc(std::localeconv())
+        , thousands_sep(loc->thousands_sep == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->thousands_sep)))
+        , decimal_point(loc->decimal_point == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->decimal_point)))
+        , indent_char(ichar)
+        , indent_string(512, indent_char)
+        , error_handler(error_handler_)
+    {}
+
+    // delete because of pointer members
+    serializer(const serializer&) = delete;
+    serializer& operator=(const serializer&) = delete;
+    serializer(serializer&&) = delete;
+    serializer& operator=(serializer&&) = delete;
+    ~serializer() = default;
+
+    /*!
+    @brief internal implementation of the serialization function
+
+    This function is called by the public member function dump and organizes
+    the serialization internally. The indentation level is propagated as
+    additional parameter. In case of arrays and objects, the function is
+    called recursively.
+
+    - strings and object keys are escaped using `escape_string()`
+    - integer numbers are converted implicitly via `operator<<`
+    - floating-point numbers are converted to a string using `"%g"` format
+    - binary values are serialized as objects containing the subtype and the
+      byte array
+
+    @param[in] val               value to serialize
+    @param[in] pretty_print      whether the output shall be pretty-printed
+    @param[in] ensure_ascii If @a ensure_ascii is true, all non-ASCII characters
+    in the output are escaped with `\uXXXX` sequences, and the result consists
+    of ASCII characters only.
+    @param[in] indent_step       the indent level
+    @param[in] current_indent    the current indent level (only used internally)
+    */
+    void dump(const BasicJsonType& val,
+              const bool pretty_print,
+              const bool ensure_ascii,
+              const unsigned int indent_step,
+              const unsigned int current_indent = 0)
+    {
+        switch (val.m_type)
+        {
+            case value_t::object:
+            {
+                if (val.m_value.object->empty())
+                {
+                    o->write_characters("{}", 2);
+                    return;
+                }
+
+                if (pretty_print)
+                {
+                    o->write_characters("{\n", 2);
+
+                    // variable to hold indentation for recursive calls
+                    const auto new_indent = current_indent + indent_step;
+                    if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
+                    {
+                        indent_string.resize(indent_string.size() * 2, ' ');
+                    }
+
+                    // first n-1 elements
+                    auto i = val.m_value.object->cbegin();
+                    for (std::size_t cnt = 0; cnt < val.m_value.object->size() - 1; ++cnt, ++i)
+                    {
+                        o->write_characters(indent_string.c_str(), new_indent);
+                        o->write_character('\"');
+                        dump_escaped(i->first, ensure_ascii);
+                        o->write_characters("\": ", 3);
+                        dump(i->second, true, ensure_ascii, indent_step, new_indent);
+                        o->write_characters(",\n", 2);
+                    }
+
+                    // last element
+                    JSON_ASSERT(i != val.m_value.object->cend());
+                    JSON_ASSERT(std::next(i) == val.m_value.object->cend());
+                    o->write_characters(indent_string.c_str(), new_indent);
+                    o->write_character('\"');
+                    dump_escaped(i->first, ensure_ascii);
+                    o->write_characters("\": ", 3);
+                    dump(i->second, true, ensure_ascii, indent_step, new_indent);
+
+                    o->write_character('\n');
+                    o->write_characters(indent_string.c_str(), current_indent);
+                    o->write_character('}');
+                }
+                else
+                {
+                    o->write_character('{');
+
+                    // first n-1 elements
+                    auto i = val.m_value.object->cbegin();
+                    for (std::size_t cnt = 0; cnt < val.m_value.object->size() - 1; ++cnt, ++i)
+                    {
+                        o->write_character('\"');
+                        dump_escaped(i->first, ensure_ascii);
+                        o->write_characters("\":", 2);
+                        dump(i->second, false, ensure_ascii, indent_step, current_indent);
+                        o->write_character(',');
+                    }
+
+                    // last element
+                    JSON_ASSERT(i != val.m_value.object->cend());
+                    JSON_ASSERT(std::next(i) == val.m_value.object->cend());
+                    o->write_character('\"');
+                    dump_escaped(i->first, ensure_ascii);
+                    o->write_characters("\":", 2);
+                    dump(i->second, false, ensure_ascii, indent_step, current_indent);
+
+                    o->write_character('}');
+                }
+
+                return;
+            }
+
+            case value_t::array:
+            {
+                if (val.m_value.array->empty())
+                {
+                    o->write_characters("[]", 2);
+                    return;
+                }
+
+                if (pretty_print)
+                {
+                    o->write_characters("[\n", 2);
+
+                    // variable to hold indentation for recursive calls
+                    const auto new_indent = current_indent + indent_step;
+                    if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
+                    {
+                        indent_string.resize(indent_string.size() * 2, ' ');
+                    }
+
+                    // first n-1 elements
+                    for (auto i = val.m_value.array->cbegin();
+                            i != val.m_value.array->cend() - 1; ++i)
+                    {
+                        o->write_characters(indent_string.c_str(), new_indent);
+                        dump(*i, true, ensure_ascii, indent_step, new_indent);
+                        o->write_characters(",\n", 2);
+                    }
+
+                    // last element
+                    JSON_ASSERT(!val.m_value.array->empty());
+                    o->write_characters(indent_string.c_str(), new_indent);
+                    dump(val.m_value.array->back(), true, ensure_ascii, indent_step, new_indent);
+
+                    o->write_character('\n');
+                    o->write_characters(indent_string.c_str(), current_indent);
+                    o->write_character(']');
+                }
+                else
+                {
+                    o->write_character('[');
+
+                    // first n-1 elements
+                    for (auto i = val.m_value.array->cbegin();
+                            i != val.m_value.array->cend() - 1; ++i)
+                    {
+                        dump(*i, false, ensure_ascii, indent_step, current_indent);
+                        o->write_character(',');
+                    }
+
+                    // last element
+                    JSON_ASSERT(!val.m_value.array->empty());
+                    dump(val.m_value.array->back(), false, ensure_ascii, indent_step, current_indent);
+
+                    o->write_character(']');
+                }
+
+                return;
+            }
+
+            case value_t::string:
+            {
+                o->write_character('\"');
+                dump_escaped(*val.m_value.string, ensure_ascii);
+                o->write_character('\"');
+                return;
+            }
+
+            case value_t::binary:
+            {
+                if (pretty_print)
+                {
+                    o->write_characters("{\n", 2);
+
+                    // variable to hold indentation for recursive calls
+                    const auto new_indent = current_indent + indent_step;
+                    if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
+                    {
+                        indent_string.resize(indent_string.size() * 2, ' ');
+                    }
+
+                    o->write_characters(indent_string.c_str(), new_indent);
+
+                    o->write_characters("\"bytes\": [", 10);
+
+                    if (!val.m_value.binary->empty())
+                    {
+                        for (auto i = val.m_value.binary->cbegin();
+                                i != val.m_value.binary->cend() - 1; ++i)
+                        {
+                            dump_integer(*i);
+                            o->write_characters(", ", 2);
+                        }
+                        dump_integer(val.m_value.binary->back());
+                    }
+
+                    o->write_characters("],\n", 3);
+                    o->write_characters(indent_string.c_str(), new_indent);
+
+                    o->write_characters("\"subtype\": ", 11);
+                    if (val.m_value.binary->has_subtype())
+                    {
+                        dump_integer(val.m_value.binary->subtype());
+                    }
+                    else
+                    {
+                        o->write_characters("null", 4);
+                    }
+                    o->write_character('\n');
+                    o->write_characters(indent_string.c_str(), current_indent);
+                    o->write_character('}');
+                }
+                else
+                {
+                    o->write_characters("{\"bytes\":[", 10);
+
+                    if (!val.m_value.binary->empty())
+                    {
+                        for (auto i = val.m_value.binary->cbegin();
+                                i != val.m_value.binary->cend() - 1; ++i)
+                        {
+                            dump_integer(*i);
+                            o->write_character(',');
+                        }
+                        dump_integer(val.m_value.binary->back());
+                    }
+
+                    o->write_characters("],\"subtype\":", 12);
+                    if (val.m_value.binary->has_subtype())
+                    {
+                        dump_integer(val.m_value.binary->subtype());
+                        o->write_character('}');
+                    }
+                    else
+                    {
+                        o->write_characters("null}", 5);
+                    }
+                }
+                return;
+            }
+
+            case value_t::boolean:
+            {
+                if (val.m_value.boolean)
+                {
+                    o->write_characters("true", 4);
+                }
+                else
+                {
+                    o->write_characters("false", 5);
+                }
+                return;
+            }
+
+            case value_t::number_integer:
+            {
+                dump_integer(val.m_value.number_integer);
+                return;
+            }
+
+            case value_t::number_unsigned:
+            {
+                dump_integer(val.m_value.number_unsigned);
+                return;
+            }
+
+            case value_t::number_float:
+            {
+                dump_float(val.m_value.number_float);
+                return;
+            }
+
+            case value_t::discarded:
+            {
+                o->write_characters("<discarded>", 11);
+                return;
+            }
+
+            case value_t::null:
+            {
+                o->write_characters("null", 4);
+                return;
+            }
+
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+    }
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /*!
+    @brief dump escaped string
+
+    Escape a string by replacing certain special characters by a sequence of an
+    escape character (backslash) and another character and other control
+    characters by a sequence of "\u" followed by a four-digit hex
+    representation. The escaped string is written to output stream @a o.
+
+    @param[in] s  the string to escape
+    @param[in] ensure_ascii  whether to escape non-ASCII characters with
+                             \uXXXX sequences
+
+    @complexity Linear in the length of string @a s.
+    */
+    void dump_escaped(const string_t& s, const bool ensure_ascii)
+    {
+        std::uint32_t codepoint{};
+        std::uint8_t state = UTF8_ACCEPT;
+        std::size_t bytes = 0;  // number of bytes written to string_buffer
+
+        // number of bytes written at the point of the last valid byte
+        std::size_t bytes_after_last_accept = 0;
+        std::size_t undumped_chars = 0;
+
+        for (std::size_t i = 0; i < s.size(); ++i)
+        {
+            const auto byte = static_cast<std::uint8_t>(s[i]);
+
+            switch (decode(state, codepoint, byte))
+            {
+                case UTF8_ACCEPT:  // decode found a new code point
+                {
+                    switch (codepoint)
+                    {
+                        case 0x08: // backspace
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'b';
+                            break;
+                        }
+
+                        case 0x09: // horizontal tab
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 't';
+                            break;
+                        }
+
+                        case 0x0A: // newline
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'n';
+                            break;
+                        }
+
+                        case 0x0C: // formfeed
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'f';
+                            break;
+                        }
+
+                        case 0x0D: // carriage return
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'r';
+                            break;
+                        }
+
+                        case 0x22: // quotation mark
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = '\"';
+                            break;
+                        }
+
+                        case 0x5C: // reverse solidus
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = '\\';
+                            break;
+                        }
+
+                        default:
+                        {
+                            // escape control characters (0x00..0x1F) or, if
+                            // ensure_ascii parameter is used, non-ASCII characters
+                            if ((codepoint <= 0x1F) || (ensure_ascii && (codepoint >= 0x7F)))
+                            {
+                                if (codepoint <= 0xFFFF)
+                                {
+                                    // NOLINTNEXTLINE(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+                                    static_cast<void>((std::snprintf)(string_buffer.data() + bytes, 7, "\\u%04x",
+                                                                      static_cast<std::uint16_t>(codepoint)));
+                                    bytes += 6;
+                                }
+                                else
+                                {
+                                    // NOLINTNEXTLINE(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+                                    static_cast<void>((std::snprintf)(string_buffer.data() + bytes, 13, "\\u%04x\\u%04x",
+                                                                      static_cast<std::uint16_t>(0xD7C0u + (codepoint >> 10u)),
+                                                                      static_cast<std::uint16_t>(0xDC00u + (codepoint & 0x3FFu))));
+                                    bytes += 12;
+                                }
+                            }
+                            else
+                            {
+                                // copy byte to buffer (all previous bytes
+                                // been copied have in default case above)
+                                string_buffer[bytes++] = s[i];
+                            }
+                            break;
+                        }
+                    }
+
+                    // write buffer and reset index; there must be 13 bytes
+                    // left, as this is the maximal number of bytes to be
+                    // written ("\uxxxx\uxxxx\0") for one code point
+                    if (string_buffer.size() - bytes < 13)
+                    {
+                        o->write_characters(string_buffer.data(), bytes);
+                        bytes = 0;
+                    }
+
+                    // remember the byte position of this accept
+                    bytes_after_last_accept = bytes;
+                    undumped_chars = 0;
+                    break;
+                }
+
+                case UTF8_REJECT:  // decode found invalid UTF-8 byte
+                {
+                    switch (error_handler)
+                    {
+                        case error_handler_t::strict:
+                        {
+                            JSON_THROW(type_error::create(316, concat("invalid UTF-8 byte at index ", std::to_string(i), ": 0x", hex_bytes(byte | 0)), nullptr));
+                        }
+
+                        case error_handler_t::ignore:
+                        case error_handler_t::replace:
+                        {
+                            // in case we saw this character the first time, we
+                            // would like to read it again, because the byte
+                            // may be OK for itself, but just not OK for the
+                            // previous sequence
+                            if (undumped_chars > 0)
+                            {
+                                --i;
+                            }
+
+                            // reset length buffer to the last accepted index;
+                            // thus removing/ignoring the invalid characters
+                            bytes = bytes_after_last_accept;
+
+                            if (error_handler == error_handler_t::replace)
+                            {
+                                // add a replacement character
+                                if (ensure_ascii)
+                                {
+                                    string_buffer[bytes++] = '\\';
+                                    string_buffer[bytes++] = 'u';
+                                    string_buffer[bytes++] = 'f';
+                                    string_buffer[bytes++] = 'f';
+                                    string_buffer[bytes++] = 'f';
+                                    string_buffer[bytes++] = 'd';
+                                }
+                                else
+                                {
+                                    string_buffer[bytes++] = detail::binary_writer<BasicJsonType, char>::to_char_type('\xEF');
+                                    string_buffer[bytes++] = detail::binary_writer<BasicJsonType, char>::to_char_type('\xBF');
+                                    string_buffer[bytes++] = detail::binary_writer<BasicJsonType, char>::to_char_type('\xBD');
+                                }
+
+                                // write buffer and reset index; there must be 13 bytes
+                                // left, as this is the maximal number of bytes to be
+                                // written ("\uxxxx\uxxxx\0") for one code point
+                                if (string_buffer.size() - bytes < 13)
+                                {
+                                    o->write_characters(string_buffer.data(), bytes);
+                                    bytes = 0;
+                                }
+
+                                bytes_after_last_accept = bytes;
+                            }
+
+                            undumped_chars = 0;
+
+                            // continue processing the string
+                            state = UTF8_ACCEPT;
+                            break;
+                        }
+
+                        default:            // LCOV_EXCL_LINE
+                            JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+                    }
+                    break;
+                }
+
+                default:  // decode found yet incomplete multi-byte code point
+                {
+                    if (!ensure_ascii)
+                    {
+                        // code point will not be escaped - copy byte to buffer
+                        string_buffer[bytes++] = s[i];
+                    }
+                    ++undumped_chars;
+                    break;
+                }
+            }
+        }
+
+        // we finished processing the string
+        if (JSON_HEDLEY_LIKELY(state == UTF8_ACCEPT))
+        {
+            // write buffer
+            if (bytes > 0)
+            {
+                o->write_characters(string_buffer.data(), bytes);
+            }
+        }
+        else
+        {
+            // we finish reading, but do not accept: string was incomplete
+            switch (error_handler)
+            {
+                case error_handler_t::strict:
+                {
+                    JSON_THROW(type_error::create(316, concat("incomplete UTF-8 string; last byte: 0x", hex_bytes(static_cast<std::uint8_t>(s.back() | 0))), nullptr));
+                }
+
+                case error_handler_t::ignore:
+                {
+                    // write all accepted bytes
+                    o->write_characters(string_buffer.data(), bytes_after_last_accept);
+                    break;
+                }
+
+                case error_handler_t::replace:
+                {
+                    // write all accepted bytes
+                    o->write_characters(string_buffer.data(), bytes_after_last_accept);
+                    // add a replacement character
+                    if (ensure_ascii)
+                    {
+                        o->write_characters("\\ufffd", 6);
+                    }
+                    else
+                    {
+                        o->write_characters("\xEF\xBF\xBD", 3);
+                    }
+                    break;
+                }
+
+                default:            // LCOV_EXCL_LINE
+                    JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+            }
+        }
+    }
+
+  private:
+    /*!
+    @brief count digits
+
+    Count the number of decimal (base 10) digits for an input unsigned integer.
+
+    @param[in] x  unsigned integer number to count its digits
+    @return    number of decimal digits
+    */
+    inline unsigned int count_digits(number_unsigned_t x) noexcept
+    {
+        unsigned int n_digits = 1;
+        for (;;)
+        {
+            if (x < 10)
+            {
+                return n_digits;
+            }
+            if (x < 100)
+            {
+                return n_digits + 1;
+            }
+            if (x < 1000)
+            {
+                return n_digits + 2;
+            }
+            if (x < 10000)
+            {
+                return n_digits + 3;
+            }
+            x = x / 10000u;
+            n_digits += 4;
+        }
+    }
+
+    /*!
+     * @brief convert a byte to a uppercase hex representation
+     * @param[in] byte byte to represent
+     * @return representation ("00".."FF")
+     */
+    static std::string hex_bytes(std::uint8_t byte)
+    {
+        std::string result = "FF";
+        constexpr const char* nibble_to_hex = "0123456789ABCDEF";
+        result[0] = nibble_to_hex[byte / 16];
+        result[1] = nibble_to_hex[byte % 16];
+        return result;
+    }
+
+    // templates to avoid warnings about useless casts
+    template <typename NumberType, enable_if_t<std::is_signed<NumberType>::value, int> = 0>
+    bool is_negative_number(NumberType x)
+    {
+        return x < 0;
+    }
+
+    template < typename NumberType, enable_if_t <std::is_unsigned<NumberType>::value, int > = 0 >
+    bool is_negative_number(NumberType /*unused*/)
+    {
+        return false;
+    }
+
+    /*!
+    @brief dump an integer
+
+    Dump a given integer to output stream @a o. Works internally with
+    @a number_buffer.
+
+    @param[in] x  integer number (signed or unsigned) to dump
+    @tparam NumberType either @a number_integer_t or @a number_unsigned_t
+    */
+    template < typename NumberType, detail::enable_if_t <
+                   std::is_integral<NumberType>::value ||
+                   std::is_same<NumberType, number_unsigned_t>::value ||
+                   std::is_same<NumberType, number_integer_t>::value ||
+                   std::is_same<NumberType, binary_char_t>::value,
+                   int > = 0 >
+    void dump_integer(NumberType x)
+    {
+        static constexpr std::array<std::array<char, 2>, 100> digits_to_99
+        {
+            {
+                {{'0', '0'}}, {{'0', '1'}}, {{'0', '2'}}, {{'0', '3'}}, {{'0', '4'}}, {{'0', '5'}}, {{'0', '6'}}, {{'0', '7'}}, {{'0', '8'}}, {{'0', '9'}},
+                {{'1', '0'}}, {{'1', '1'}}, {{'1', '2'}}, {{'1', '3'}}, {{'1', '4'}}, {{'1', '5'}}, {{'1', '6'}}, {{'1', '7'}}, {{'1', '8'}}, {{'1', '9'}},
+                {{'2', '0'}}, {{'2', '1'}}, {{'2', '2'}}, {{'2', '3'}}, {{'2', '4'}}, {{'2', '5'}}, {{'2', '6'}}, {{'2', '7'}}, {{'2', '8'}}, {{'2', '9'}},
+                {{'3', '0'}}, {{'3', '1'}}, {{'3', '2'}}, {{'3', '3'}}, {{'3', '4'}}, {{'3', '5'}}, {{'3', '6'}}, {{'3', '7'}}, {{'3', '8'}}, {{'3', '9'}},
+                {{'4', '0'}}, {{'4', '1'}}, {{'4', '2'}}, {{'4', '3'}}, {{'4', '4'}}, {{'4', '5'}}, {{'4', '6'}}, {{'4', '7'}}, {{'4', '8'}}, {{'4', '9'}},
+                {{'5', '0'}}, {{'5', '1'}}, {{'5', '2'}}, {{'5', '3'}}, {{'5', '4'}}, {{'5', '5'}}, {{'5', '6'}}, {{'5', '7'}}, {{'5', '8'}}, {{'5', '9'}},
+                {{'6', '0'}}, {{'6', '1'}}, {{'6', '2'}}, {{'6', '3'}}, {{'6', '4'}}, {{'6', '5'}}, {{'6', '6'}}, {{'6', '7'}}, {{'6', '8'}}, {{'6', '9'}},
+                {{'7', '0'}}, {{'7', '1'}}, {{'7', '2'}}, {{'7', '3'}}, {{'7', '4'}}, {{'7', '5'}}, {{'7', '6'}}, {{'7', '7'}}, {{'7', '8'}}, {{'7', '9'}},
+                {{'8', '0'}}, {{'8', '1'}}, {{'8', '2'}}, {{'8', '3'}}, {{'8', '4'}}, {{'8', '5'}}, {{'8', '6'}}, {{'8', '7'}}, {{'8', '8'}}, {{'8', '9'}},
+                {{'9', '0'}}, {{'9', '1'}}, {{'9', '2'}}, {{'9', '3'}}, {{'9', '4'}}, {{'9', '5'}}, {{'9', '6'}}, {{'9', '7'}}, {{'9', '8'}}, {{'9', '9'}},
+            }
+        };
+
+        // special case for "0"
+        if (x == 0)
+        {
+            o->write_character('0');
+            return;
+        }
+
+        // use a pointer to fill the buffer
+        auto buffer_ptr = number_buffer.begin(); // NOLINT(llvm-qualified-auto,readability-qualified-auto,cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+
+        number_unsigned_t abs_value;
+
+        unsigned int n_chars{};
+
+        if (is_negative_number(x))
+        {
+            *buffer_ptr = '-';
+            abs_value = remove_sign(static_cast<number_integer_t>(x));
+
+            // account one more byte for the minus sign
+            n_chars = 1 + count_digits(abs_value);
+        }
+        else
+        {
+            abs_value = static_cast<number_unsigned_t>(x);
+            n_chars = count_digits(abs_value);
+        }
+
+        // spare 1 byte for '\0'
+        JSON_ASSERT(n_chars < number_buffer.size() - 1);
+
+        // jump to the end to generate the string from backward,
+        // so we later avoid reversing the result
+        buffer_ptr += n_chars;
+
+        // Fast int2ascii implementation inspired by "Fastware" talk by Andrei Alexandrescu
+        // See: https://www.youtube.com/watch?v=o4-CwDo2zpg
+        while (abs_value >= 100)
+        {
+            const auto digits_index = static_cast<unsigned>((abs_value % 100));
+            abs_value /= 100;
+            *(--buffer_ptr) = digits_to_99[digits_index][1];
+            *(--buffer_ptr) = digits_to_99[digits_index][0];
+        }
+
+        if (abs_value >= 10)
+        {
+            const auto digits_index = static_cast<unsigned>(abs_value);
+            *(--buffer_ptr) = digits_to_99[digits_index][1];
+            *(--buffer_ptr) = digits_to_99[digits_index][0];
+        }
+        else
+        {
+            *(--buffer_ptr) = static_cast<char>('0' + abs_value);
+        }
+
+        o->write_characters(number_buffer.data(), n_chars);
+    }
+
+    /*!
+    @brief dump a floating-point number
+
+    Dump a given floating-point number to output stream @a o. Works internally
+    with @a number_buffer.
+
+    @param[in] x  floating-point number to dump
+    */
+    void dump_float(number_float_t x)
+    {
+        // NaN / inf
+        if (!std::isfinite(x))
+        {
+            o->write_characters("null", 4);
+            return;
+        }
+
+        // If number_float_t is an IEEE-754 single or double precision number,
+        // use the Grisu2 algorithm to produce short numbers which are
+        // guaranteed to round-trip, using strtof and strtod, resp.
+        //
+        // NB: The test below works if <long double> == <double>.
+        static constexpr bool is_ieee_single_or_double
+            = (std::numeric_limits<number_float_t>::is_iec559 && std::numeric_limits<number_float_t>::digits == 24 && std::numeric_limits<number_float_t>::max_exponent == 128) ||
+              (std::numeric_limits<number_float_t>::is_iec559 && std::numeric_limits<number_float_t>::digits == 53 && std::numeric_limits<number_float_t>::max_exponent == 1024);
+
+        dump_float(x, std::integral_constant<bool, is_ieee_single_or_double>());
+    }
+
+    void dump_float(number_float_t x, std::true_type /*is_ieee_single_or_double*/)
+    {
+        auto* begin = number_buffer.data();
+        auto* end = ::nlohmann::detail::to_chars(begin, begin + number_buffer.size(), x);
+
+        o->write_characters(begin, static_cast<size_t>(end - begin));
+    }
+
+    void dump_float(number_float_t x, std::false_type /*is_ieee_single_or_double*/)
+    {
+        // get number of digits for a float -> text -> float round-trip
+        static constexpr auto d = std::numeric_limits<number_float_t>::max_digits10;
+
+        // the actual conversion
+        // NOLINTNEXTLINE(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+        std::ptrdiff_t len = (std::snprintf)(number_buffer.data(), number_buffer.size(), "%.*g", d, x);
+
+        // negative value indicates an error
+        JSON_ASSERT(len > 0);
+        // check if buffer was large enough
+        JSON_ASSERT(static_cast<std::size_t>(len) < number_buffer.size());
+
+        // erase thousands separator
+        if (thousands_sep != '\0')
+        {
+            // NOLINTNEXTLINE(readability-qualified-auto,llvm-qualified-auto): std::remove returns an iterator, see https://github.com/nlohmann/json/issues/3081
+            const auto end = std::remove(number_buffer.begin(), number_buffer.begin() + len, thousands_sep);
+            std::fill(end, number_buffer.end(), '\0');
+            JSON_ASSERT((end - number_buffer.begin()) <= len);
+            len = (end - number_buffer.begin());
+        }
+
+        // convert decimal point to '.'
+        if (decimal_point != '\0' && decimal_point != '.')
+        {
+            // NOLINTNEXTLINE(readability-qualified-auto,llvm-qualified-auto): std::find returns an iterator, see https://github.com/nlohmann/json/issues/3081
+            const auto dec_pos = std::find(number_buffer.begin(), number_buffer.end(), decimal_point);
+            if (dec_pos != number_buffer.end())
+            {
+                *dec_pos = '.';
+            }
+        }
+
+        o->write_characters(number_buffer.data(), static_cast<std::size_t>(len));
+
+        // determine if we need to append ".0"
+        const bool value_is_int_like =
+            std::none_of(number_buffer.begin(), number_buffer.begin() + len + 1,
+                         [](char c)
+        {
+            return c == '.' || c == 'e';
+        });
+
+        if (value_is_int_like)
+        {
+            o->write_characters(".0", 2);
+        }
+    }
+
+    /*!
+    @brief check whether a string is UTF-8 encoded
+
+    The function checks each byte of a string whether it is UTF-8 encoded. The
+    result of the check is stored in the @a state parameter. The function must
+    be called initially with state 0 (accept). State 1 means the string must
+    be rejected, because the current byte is not allowed. If the string is
+    completely processed, but the state is non-zero, the string ended
+    prematurely; that is, the last byte indicated more bytes should have
+    followed.
+
+    @param[in,out] state  the state of the decoding
+    @param[in,out] codep  codepoint (valid only if resulting state is UTF8_ACCEPT)
+    @param[in] byte       next byte to decode
+    @return               new state
+
+    @note The function has been edited: a std::array is used.
+
+    @copyright Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de>
+    @sa http://bjoern.hoehrmann.de/utf-8/decoder/dfa/
+    */
+    static std::uint8_t decode(std::uint8_t& state, std::uint32_t& codep, const std::uint8_t byte) noexcept
+    {
+        static const std::array<std::uint8_t, 400> utf8d =
+        {
+            {
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 00..1F
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 20..3F
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 40..5F
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 60..7F
+                1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, // 80..9F
+                7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, // A0..BF
+                8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, // C0..DF
+                0xA, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x4, 0x3, 0x3, // E0..EF
+                0xB, 0x6, 0x6, 0x6, 0x5, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, // F0..FF
+                0x0, 0x1, 0x2, 0x3, 0x5, 0x8, 0x7, 0x1, 0x1, 0x1, 0x4, 0x6, 0x1, 0x1, 0x1, 0x1, // s0..s0
+                1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, // s1..s2
+                1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, // s3..s4
+                1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, // s5..s6
+                1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // s7..s8
+            }
+        };
+
+        JSON_ASSERT(byte < utf8d.size());
+        const std::uint8_t type = utf8d[byte];
+
+        codep = (state != UTF8_ACCEPT)
+                ? (byte & 0x3fu) | (codep << 6u)
+                : (0xFFu >> type) & (byte);
+
+        std::size_t index = 256u + static_cast<size_t>(state) * 16u + static_cast<size_t>(type);
+        JSON_ASSERT(index < 400);
+        state = utf8d[index];
+        return state;
+    }
+
+    /*
+     * Overload to make the compiler happy while it is instantiating
+     * dump_integer for number_unsigned_t.
+     * Must never be called.
+     */
+    number_unsigned_t remove_sign(number_unsigned_t x)
+    {
+        JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        return x; // LCOV_EXCL_LINE
+    }
+
+    /*
+     * Helper function for dump_integer
+     *
+     * This function takes a negative signed integer and returns its absolute
+     * value as unsigned integer. The plus/minus shuffling is necessary as we can
+     * not directly remove the sign of an arbitrary signed integer as the
+     * absolute values of INT_MIN and INT_MAX are usually not the same. See
+     * #1708 for details.
+     */
+    inline number_unsigned_t remove_sign(number_integer_t x) noexcept
+    {
+        JSON_ASSERT(x < 0 && x < (std::numeric_limits<number_integer_t>::max)()); // NOLINT(misc-redundant-expression)
+        return static_cast<number_unsigned_t>(-(x + 1)) + 1;
+    }
+
+  private:
+    /// the output of the serializer
+    output_adapter_t<char> o = nullptr;
+
+    /// a (hopefully) large enough character buffer
+    std::array<char, 64> number_buffer{{}};
+
+    /// the locale
+    const std::lconv* loc = nullptr;
+    /// the locale's thousand separator character
+    const char thousands_sep = '\0';
+    /// the locale's decimal point character
+    const char decimal_point = '\0';
+
+    /// string buffer
+    std::array<char, 512> string_buffer{{}};
+
+    /// the indentation character
+    const char indent_char;
+    /// the indentation string
+    string_t indent_string;
+
+    /// error_handler how to react on decoding errors
+    const error_handler_t error_handler;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/value_t.hpp>
+
+// #include <nlohmann/json_fwd.hpp>
+
+// #include <nlohmann/ordered_map.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <functional> // equal_to, less
+#include <initializer_list> // initializer_list
+#include <iterator> // input_iterator_tag, iterator_traits
+#include <memory> // allocator
+#include <stdexcept> // for out_of_range
+#include <type_traits> // enable_if, is_convertible
+#include <utility> // pair
+#include <vector> // vector
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/// ordered_map: a minimal map-like container that preserves insertion order
+/// for use within nlohmann::basic_json<ordered_map>
+template <class Key, class T, class IgnoredLess = std::less<Key>,
+          class Allocator = std::allocator<std::pair<const Key, T>>>
+                  struct ordered_map : std::vector<std::pair<const Key, T>, Allocator>
+{
+    using key_type = Key;
+    using mapped_type = T;
+    using Container = std::vector<std::pair<const Key, T>, Allocator>;
+    using iterator = typename Container::iterator;
+    using const_iterator = typename Container::const_iterator;
+    using size_type = typename Container::size_type;
+    using value_type = typename Container::value_type;
+#ifdef JSON_HAS_CPP_14
+    using key_compare = std::equal_to<>;
+#else
+    using key_compare = std::equal_to<Key>;
+#endif
+
+    // Explicit constructors instead of `using Container::Container`
+    // otherwise older compilers choke on it (GCC <= 5.5, xcode <= 9.4)
+    ordered_map() noexcept(noexcept(Container())) : Container{} {}
+    explicit ordered_map(const Allocator& alloc) noexcept(noexcept(Container(alloc))) : Container{alloc} {}
+    template <class It>
+    ordered_map(It first, It last, const Allocator& alloc = Allocator())
+        : Container{first, last, alloc} {}
+    ordered_map(std::initializer_list<value_type> init, const Allocator& alloc = Allocator() )
+        : Container{init, alloc} {}
+
+    std::pair<iterator, bool> emplace(const key_type& key, T&& t)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return {it, false};
+            }
+        }
+        Container::emplace_back(key, std::forward<T>(t));
+        return {std::prev(this->end()), true};
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    std::pair<iterator, bool> emplace(KeyType && key, T && t)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return {it, false};
+            }
+        }
+        Container::emplace_back(std::forward<KeyType>(key), std::forward<T>(t));
+        return {std::prev(this->end()), true};
+    }
+
+    T& operator[](const key_type& key)
+    {
+        return emplace(key, T{}).first->second;
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    T & operator[](KeyType && key)
+    {
+        return emplace(std::forward<KeyType>(key), T{}).first->second;
+    }
+
+    const T& operator[](const key_type& key) const
+    {
+        return at(key);
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    const T & operator[](KeyType && key) const
+    {
+        return at(std::forward<KeyType>(key));
+    }
+
+    T& at(const key_type& key)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it->second;
+            }
+        }
+
+        JSON_THROW(std::out_of_range("key not found"));
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    T & at(KeyType && key)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it->second;
+            }
+        }
+
+        JSON_THROW(std::out_of_range("key not found"));
+    }
+
+    const T& at(const key_type& key) const
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it->second;
+            }
+        }
+
+        JSON_THROW(std::out_of_range("key not found"));
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    const T & at(KeyType && key) const
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it->second;
+            }
+        }
+
+        JSON_THROW(std::out_of_range("key not found"));
+    }
+
+    size_type erase(const key_type& key)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                // Since we cannot move const Keys, re-construct them in place
+                for (auto next = it; ++next != this->end(); ++it)
+                {
+                    it->~value_type(); // Destroy but keep allocation
+                    new (&*it) value_type{std::move(*next)};
+                }
+                Container::pop_back();
+                return 1;
+            }
+        }
+        return 0;
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    size_type erase(KeyType && key)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                // Since we cannot move const Keys, re-construct them in place
+                for (auto next = it; ++next != this->end(); ++it)
+                {
+                    it->~value_type(); // Destroy but keep allocation
+                    new (&*it) value_type{std::move(*next)};
+                }
+                Container::pop_back();
+                return 1;
+            }
+        }
+        return 0;
+    }
+
+    iterator erase(iterator pos)
+    {
+        return erase(pos, std::next(pos));
+    }
+
+    iterator erase(iterator first, iterator last)
+    {
+        if (first == last)
+        {
+            return first;
+        }
+
+        const auto elements_affected = std::distance(first, last);
+        const auto offset = std::distance(Container::begin(), first);
+
+        // This is the start situation. We need to delete elements_affected
+        // elements (3 in this example: e, f, g), and need to return an
+        // iterator past the last deleted element (h in this example).
+        // Note that offset is the distance from the start of the vector
+        // to first. We will need this later.
+
+        // [ a, b, c, d, e, f, g, h, i, j ]
+        //               ^        ^
+        //             first    last
+
+        // Since we cannot move const Keys, we re-construct them in place.
+        // We start at first and re-construct (viz. copy) the elements from
+        // the back of the vector. Example for first iteration:
+
+        //               ,--------.
+        //               v        |   destroy e and re-construct with h
+        // [ a, b, c, d, e, f, g, h, i, j ]
+        //               ^        ^
+        //               it       it + elements_affected
+
+        for (auto it = first; std::next(it, elements_affected) != Container::end(); ++it)
+        {
+            it->~value_type(); // destroy but keep allocation
+            new (&*it) value_type{std::move(*std::next(it, elements_affected))}; // "move" next element to it
+        }
+
+        // [ a, b, c, d, h, i, j, h, i, j ]
+        //               ^        ^
+        //             first    last
+
+        // remove the unneeded elements at the end of the vector
+        Container::resize(this->size() - static_cast<size_type>(elements_affected));
+
+        // [ a, b, c, d, h, i, j ]
+        //               ^        ^
+        //             first    last
+
+        // first is now pointing past the last deleted element, but we cannot
+        // use this iterator, because it may have been invalidated by the
+        // resize call. Instead, we can return begin() + offset.
+        return Container::begin() + offset;
+    }
+
+    size_type count(const key_type& key) const
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return 1;
+            }
+        }
+        return 0;
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    size_type count(KeyType && key) const
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return 1;
+            }
+        }
+        return 0;
+    }
+
+    iterator find(const key_type& key)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it;
+            }
+        }
+        return Container::end();
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    iterator find(KeyType && key)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it;
+            }
+        }
+        return Container::end();
+    }
+
+    const_iterator find(const key_type& key) const
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it;
+            }
+        }
+        return Container::end();
+    }
+
+    std::pair<iterator, bool> insert( value_type&& value )
+    {
+        return emplace(value.first, std::move(value.second));
+    }
+
+    std::pair<iterator, bool> insert( const value_type& value )
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, value.first))
+            {
+                return {it, false};
+            }
+        }
+        Container::push_back(value);
+        return {--this->end(), true};
+    }
+
+    template<typename InputIt>
+    using require_input_iter = typename std::enable_if<std::is_convertible<typename std::iterator_traits<InputIt>::iterator_category,
+            std::input_iterator_tag>::value>::type;
+
+    template<typename InputIt, typename = require_input_iter<InputIt>>
+    void insert(InputIt first, InputIt last)
+    {
+        for (auto it = first; it != last; ++it)
+        {
+            insert(*it);
+        }
+    }
+
+private:
+    JSON_NO_UNIQUE_ADDRESS key_compare m_compare = key_compare();
+};
+
+NLOHMANN_JSON_NAMESPACE_END
+
+
+#if defined(JSON_HAS_CPP_17)
+    #include <any>
+    #include <string_view>
+#endif
+
+/*!
+@brief namespace for Niels Lohmann
+@see https://github.com/nlohmann
+@since version 1.0.0
+*/
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/*!
+@brief a class to store JSON values
+
+@internal
+@invariant The member variables @a m_value and @a m_type have the following
+relationship:
+- If `m_type == value_t::object`, then `m_value.object != nullptr`.
+- If `m_type == value_t::array`, then `m_value.array != nullptr`.
+- If `m_type == value_t::string`, then `m_value.string != nullptr`.
+The invariants are checked by member function assert_invariant().
+
+@note ObjectType trick from https://stackoverflow.com/a/9860911
+@endinternal
+
+@since version 1.0.0
+
+@nosubgrouping
+*/
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-special-member-functions)
+{
+  private:
+    template<detail::value_t> friend struct detail::external_constructor;
+
+    template<typename>
+    friend class ::nlohmann::json_pointer;
+    // can be restored when json_pointer backwards compatibility is removed
+    // friend ::nlohmann::json_pointer<StringType>;
+
+    template<typename BasicJsonType, typename InputType>
+    friend class ::nlohmann::detail::parser;
+    friend ::nlohmann::detail::serializer<basic_json>;
+    template<typename BasicJsonType>
+    friend class ::nlohmann::detail::iter_impl;
+    template<typename BasicJsonType, typename CharType>
+    friend class ::nlohmann::detail::binary_writer;
+    template<typename BasicJsonType, typename InputType, typename SAX>
+    friend class ::nlohmann::detail::binary_reader;
+    template<typename BasicJsonType>
+    friend class ::nlohmann::detail::json_sax_dom_parser;
+    template<typename BasicJsonType>
+    friend class ::nlohmann::detail::json_sax_dom_callback_parser;
+    friend class ::nlohmann::detail::exception;
+
+    /// workaround type for MSVC
+    using basic_json_t = NLOHMANN_BASIC_JSON_TPL;
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    // convenience aliases for types residing in namespace detail;
+    using lexer = ::nlohmann::detail::lexer_base<basic_json>;
+
+    template<typename InputAdapterType>
+    static ::nlohmann::detail::parser<basic_json, InputAdapterType> parser(
+        InputAdapterType adapter,
+        detail::parser_callback_t<basic_json>cb = nullptr,
+        const bool allow_exceptions = true,
+        const bool ignore_comments = false
+                                 )
+    {
+        return ::nlohmann::detail::parser<basic_json, InputAdapterType>(std::move(adapter),
+                std::move(cb), allow_exceptions, ignore_comments);
+    }
+
+  private:
+    using primitive_iterator_t = ::nlohmann::detail::primitive_iterator_t;
+    template<typename BasicJsonType>
+    using internal_iterator = ::nlohmann::detail::internal_iterator<BasicJsonType>;
+    template<typename BasicJsonType>
+    using iter_impl = ::nlohmann::detail::iter_impl<BasicJsonType>;
+    template<typename Iterator>
+    using iteration_proxy = ::nlohmann::detail::iteration_proxy<Iterator>;
+    template<typename Base> using json_reverse_iterator = ::nlohmann::detail::json_reverse_iterator<Base>;
+
+    template<typename CharType>
+    using output_adapter_t = ::nlohmann::detail::output_adapter_t<CharType>;
+
+    template<typename InputType>
+    using binary_reader = ::nlohmann::detail::binary_reader<basic_json, InputType>;
+    template<typename CharType> using binary_writer = ::nlohmann::detail::binary_writer<basic_json, CharType>;
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    using serializer = ::nlohmann::detail::serializer<basic_json>;
+
+  public:
+    using value_t = detail::value_t;
+    /// JSON Pointer, see @ref nlohmann::json_pointer
+    using json_pointer = ::nlohmann::json_pointer<StringType>;
+    template<typename T, typename SFINAE>
+    using json_serializer = JSONSerializer<T, SFINAE>;
+    /// how to treat decoding errors
+    using error_handler_t = detail::error_handler_t;
+    /// how to treat CBOR tags
+    using cbor_tag_handler_t = detail::cbor_tag_handler_t;
+    /// helper type for initializer lists of basic_json values
+    using initializer_list_t = std::initializer_list<detail::json_ref<basic_json>>;
+
+    using input_format_t = detail::input_format_t;
+    /// SAX interface type, see @ref nlohmann::json_sax
+    using json_sax_t = json_sax<basic_json>;
+
+    ////////////////
+    // exceptions //
+    ////////////////
+
+    /// @name exceptions
+    /// Classes to implement user-defined exceptions.
+    /// @{
+
+    using exception = detail::exception;
+    using parse_error = detail::parse_error;
+    using invalid_iterator = detail::invalid_iterator;
+    using type_error = detail::type_error;
+    using out_of_range = detail::out_of_range;
+    using other_error = detail::other_error;
+
+    /// @}
+
+
+    /////////////////////
+    // container types //
+    /////////////////////
+
+    /// @name container types
+    /// The canonic container types to use @ref basic_json like any other STL
+    /// container.
+    /// @{
+
+    /// the type of elements in a basic_json container
+    using value_type = basic_json;
+
+    /// the type of an element reference
+    using reference = value_type&;
+    /// the type of an element const reference
+    using const_reference = const value_type&;
+
+    /// a type to represent differences between iterators
+    using difference_type = std::ptrdiff_t;
+    /// a type to represent container sizes
+    using size_type = std::size_t;
+
+    /// the allocator type
+    using allocator_type = AllocatorType<basic_json>;
+
+    /// the type of an element pointer
+    using pointer = typename std::allocator_traits<allocator_type>::pointer;
+    /// the type of an element const pointer
+    using const_pointer = typename std::allocator_traits<allocator_type>::const_pointer;
+
+    /// an iterator for a basic_json container
+    using iterator = iter_impl<basic_json>;
+    /// a const iterator for a basic_json container
+    using const_iterator = iter_impl<const basic_json>;
+    /// a reverse iterator for a basic_json container
+    using reverse_iterator = json_reverse_iterator<typename basic_json::iterator>;
+    /// a const reverse iterator for a basic_json container
+    using const_reverse_iterator = json_reverse_iterator<typename basic_json::const_iterator>;
+
+    /// @}
+
+
+    /// @brief returns the allocator associated with the container
+    /// @sa https://json.nlohmann.me/api/basic_json/get_allocator/
+    static allocator_type get_allocator()
+    {
+        return allocator_type();
+    }
+
+    /// @brief returns version information on the library
+    /// @sa https://json.nlohmann.me/api/basic_json/meta/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json meta()
+    {
+        basic_json result;
+
+        result["copyright"] = "(C) 2013-2022 Niels Lohmann";
+        result["name"] = "JSON for Modern C++";
+        result["url"] = "https://github.com/nlohmann/json";
+        result["version"]["string"] =
+            detail::concat(std::to_string(NLOHMANN_JSON_VERSION_MAJOR), '.',
+                           std::to_string(NLOHMANN_JSON_VERSION_MINOR), '.',
+                           std::to_string(NLOHMANN_JSON_VERSION_PATCH));
+        result["version"]["major"] = NLOHMANN_JSON_VERSION_MAJOR;
+        result["version"]["minor"] = NLOHMANN_JSON_VERSION_MINOR;
+        result["version"]["patch"] = NLOHMANN_JSON_VERSION_PATCH;
+
+#ifdef _WIN32
+        result["platform"] = "win32";
+#elif defined __linux__
+        result["platform"] = "linux";
+#elif defined __APPLE__
+        result["platform"] = "apple";
+#elif defined __unix__
+        result["platform"] = "unix";
+#else
+        result["platform"] = "unknown";
+#endif
+
+#if defined(__ICC) || defined(__INTEL_COMPILER)
+        result["compiler"] = {{"family", "icc"}, {"version", __INTEL_COMPILER}};
+#elif defined(__clang__)
+        result["compiler"] = {{"family", "clang"}, {"version", __clang_version__}};
+#elif defined(__GNUC__) || defined(__GNUG__)
+        result["compiler"] = {{"family", "gcc"}, {"version", detail::concat(
+                    std::to_string(__GNUC__), '.',
+                    std::to_string(__GNUC_MINOR__), '.',
+                    std::to_string(__GNUC_PATCHLEVEL__))
+            }
+        };
+#elif defined(__HP_cc) || defined(__HP_aCC)
+        result["compiler"] = "hp"
+#elif defined(__IBMCPP__)
+        result["compiler"] = {{"family", "ilecpp"}, {"version", __IBMCPP__}};
+#elif defined(_MSC_VER)
+        result["compiler"] = {{"family", "msvc"}, {"version", _MSC_VER}};
+#elif defined(__PGI)
+        result["compiler"] = {{"family", "pgcpp"}, {"version", __PGI}};
+#elif defined(__SUNPRO_CC)
+        result["compiler"] = {{"family", "sunpro"}, {"version", __SUNPRO_CC}};
+#else
+        result["compiler"] = {{"family", "unknown"}, {"version", "unknown"}};
+#endif
+
+
+#if defined(_MSVC_LANG)
+        result["compiler"]["c++"] = std::to_string(_MSVC_LANG);
+#elif defined(__cplusplus)
+        result["compiler"]["c++"] = std::to_string(__cplusplus);
+#else
+        result["compiler"]["c++"] = "unknown";
+#endif
+        return result;
+    }
+
+
+    ///////////////////////////
+    // JSON value data types //
+    ///////////////////////////
+
+    /// @name JSON value data types
+    /// The data types to store a JSON value. These types are derived from
+    /// the template arguments passed to class @ref basic_json.
+    /// @{
+
+    /// @brief default object key comparator type
+    /// The actual object key comparator type (@ref object_comparator_t) may be
+    /// different.
+    /// @sa https://json.nlohmann.me/api/basic_json/default_object_comparator_t/
+#if defined(JSON_HAS_CPP_14)
+    // use of transparent comparator avoids unnecessary repeated construction of temporaries
+    // in functions involving lookup by key with types other than object_t::key_type (aka. StringType)
+    using default_object_comparator_t = std::less<>;
+#else
+    using default_object_comparator_t = std::less<StringType>;
+#endif
+
+    /// @brief a type for an object
+    /// @sa https://json.nlohmann.me/api/basic_json/object_t/
+    using object_t = ObjectType<StringType,
+          basic_json,
+          default_object_comparator_t,
+          AllocatorType<std::pair<const StringType,
+          basic_json>>>;
+
+    /// @brief a type for an array
+    /// @sa https://json.nlohmann.me/api/basic_json/array_t/
+    using array_t = ArrayType<basic_json, AllocatorType<basic_json>>;
+
+    /// @brief a type for a string
+    /// @sa https://json.nlohmann.me/api/basic_json/string_t/
+    using string_t = StringType;
+
+    /// @brief a type for a boolean
+    /// @sa https://json.nlohmann.me/api/basic_json/boolean_t/
+    using boolean_t = BooleanType;
+
+    /// @brief a type for a number (integer)
+    /// @sa https://json.nlohmann.me/api/basic_json/number_integer_t/
+    using number_integer_t = NumberIntegerType;
+
+    /// @brief a type for a number (unsigned)
+    /// @sa https://json.nlohmann.me/api/basic_json/number_unsigned_t/
+    using number_unsigned_t = NumberUnsignedType;
+
+    /// @brief a type for a number (floating-point)
+    /// @sa https://json.nlohmann.me/api/basic_json/number_float_t/
+    using number_float_t = NumberFloatType;
+
+    /// @brief a type for a packed binary type
+    /// @sa https://json.nlohmann.me/api/basic_json/binary_t/
+    using binary_t = nlohmann::byte_container_with_subtype<BinaryType>;
+
+    /// @brief object key comparator type
+    /// @sa https://json.nlohmann.me/api/basic_json/object_comparator_t/
+    using object_comparator_t = detail::actual_object_comparator_t<basic_json>;
+
+    /// @}
+
+  private:
+
+    /// helper for exception-safe object creation
+    template<typename T, typename... Args>
+    JSON_HEDLEY_RETURNS_NON_NULL
+    static T* create(Args&& ... args)
+    {
+        AllocatorType<T> alloc;
+        using AllocatorTraits = std::allocator_traits<AllocatorType<T>>;
+
+        auto deleter = [&](T * obj)
+        {
+            AllocatorTraits::deallocate(alloc, obj, 1);
+        };
+        std::unique_ptr<T, decltype(deleter)> obj(AllocatorTraits::allocate(alloc, 1), deleter);
+        AllocatorTraits::construct(alloc, obj.get(), std::forward<Args>(args)...);
+        JSON_ASSERT(obj != nullptr);
+        return obj.release();
+    }
+
+    ////////////////////////
+    // JSON value storage //
+    ////////////////////////
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /*!
+    @brief a JSON value
+
+    The actual storage for a JSON value of the @ref basic_json class. This
+    union combines the different storage types for the JSON value types
+    defined in @ref value_t.
+
+    JSON type | value_t type    | used type
+    --------- | --------------- | ------------------------
+    object    | object          | pointer to @ref object_t
+    array     | array           | pointer to @ref array_t
+    string    | string          | pointer to @ref string_t
+    boolean   | boolean         | @ref boolean_t
+    number    | number_integer  | @ref number_integer_t
+    number    | number_unsigned | @ref number_unsigned_t
+    number    | number_float    | @ref number_float_t
+    binary    | binary          | pointer to @ref binary_t
+    null      | null            | *no value is stored*
+
+    @note Variable-length types (objects, arrays, and strings) are stored as
+    pointers. The size of the union should not exceed 64 bits if the default
+    value types are used.
+
+    @since version 1.0.0
+    */
+    union json_value
+    {
+        /// object (stored with pointer to save storage)
+        object_t* object;
+        /// array (stored with pointer to save storage)
+        array_t* array;
+        /// string (stored with pointer to save storage)
+        string_t* string;
+        /// binary (stored with pointer to save storage)
+        binary_t* binary;
+        /// boolean
+        boolean_t boolean;
+        /// number (integer)
+        number_integer_t number_integer;
+        /// number (unsigned integer)
+        number_unsigned_t number_unsigned;
+        /// number (floating-point)
+        number_float_t number_float;
+
+        /// default constructor (for null values)
+        json_value() = default;
+        /// constructor for booleans
+        json_value(boolean_t v) noexcept : boolean(v) {}
+        /// constructor for numbers (integer)
+        json_value(number_integer_t v) noexcept : number_integer(v) {}
+        /// constructor for numbers (unsigned)
+        json_value(number_unsigned_t v) noexcept : number_unsigned(v) {}
+        /// constructor for numbers (floating-point)
+        json_value(number_float_t v) noexcept : number_float(v) {}
+        /// constructor for empty values of a given type
+        json_value(value_t t)
+        {
+            switch (t)
+            {
+                case value_t::object:
+                {
+                    object = create<object_t>();
+                    break;
+                }
+
+                case value_t::array:
+                {
+                    array = create<array_t>();
+                    break;
+                }
+
+                case value_t::string:
+                {
+                    string = create<string_t>("");
+                    break;
+                }
+
+                case value_t::binary:
+                {
+                    binary = create<binary_t>();
+                    break;
+                }
+
+                case value_t::boolean:
+                {
+                    boolean = static_cast<boolean_t>(false);
+                    break;
+                }
+
+                case value_t::number_integer:
+                {
+                    number_integer = static_cast<number_integer_t>(0);
+                    break;
+                }
+
+                case value_t::number_unsigned:
+                {
+                    number_unsigned = static_cast<number_unsigned_t>(0);
+                    break;
+                }
+
+                case value_t::number_float:
+                {
+                    number_float = static_cast<number_float_t>(0.0);
+                    break;
+                }
+
+                case value_t::null:
+                {
+                    object = nullptr;  // silence warning, see #821
+                    break;
+                }
+
+                case value_t::discarded:
+                default:
+                {
+                    object = nullptr;  // silence warning, see #821
+                    if (JSON_HEDLEY_UNLIKELY(t == value_t::null))
+                    {
+                        JSON_THROW(other_error::create(500, "961c151d2e87f2686a955a9be24d316f1362bf21 3.11.2", nullptr)); // LCOV_EXCL_LINE
+                    }
+                    break;
+                }
+            }
+        }
+
+        /// constructor for strings
+        json_value(const string_t& value) : string(create<string_t>(value)) {}
+
+        /// constructor for rvalue strings
+        json_value(string_t&& value) : string(create<string_t>(std::move(value))) {}
+
+        /// constructor for objects
+        json_value(const object_t& value) : object(create<object_t>(value)) {}
+
+        /// constructor for rvalue objects
+        json_value(object_t&& value) : object(create<object_t>(std::move(value))) {}
+
+        /// constructor for arrays
+        json_value(const array_t& value) : array(create<array_t>(value)) {}
+
+        /// constructor for rvalue arrays
+        json_value(array_t&& value) : array(create<array_t>(std::move(value))) {}
+
+        /// constructor for binary arrays
+        json_value(const typename binary_t::container_type& value) : binary(create<binary_t>(value)) {}
+
+        /// constructor for rvalue binary arrays
+        json_value(typename binary_t::container_type&& value) : binary(create<binary_t>(std::move(value))) {}
+
+        /// constructor for binary arrays (internal type)
+        json_value(const binary_t& value) : binary(create<binary_t>(value)) {}
+
+        /// constructor for rvalue binary arrays (internal type)
+        json_value(binary_t&& value) : binary(create<binary_t>(std::move(value))) {}
+
+        void destroy(value_t t)
+        {
+            if (t == value_t::array || t == value_t::object)
+            {
+                // flatten the current json_value to a heap-allocated stack
+                std::vector<basic_json> stack;
+
+                // move the top-level items to stack
+                if (t == value_t::array)
+                {
+                    stack.reserve(array->size());
+                    std::move(array->begin(), array->end(), std::back_inserter(stack));
+                }
+                else
+                {
+                    stack.reserve(object->size());
+                    for (auto&& it : *object)
+                    {
+                        stack.push_back(std::move(it.second));
+                    }
+                }
+
+                while (!stack.empty())
+                {
+                    // move the last item to local variable to be processed
+                    basic_json current_item(std::move(stack.back()));
+                    stack.pop_back();
+
+                    // if current_item is array/object, move
+                    // its children to the stack to be processed later
+                    if (current_item.is_array())
+                    {
+                        std::move(current_item.m_value.array->begin(), current_item.m_value.array->end(), std::back_inserter(stack));
+
+                        current_item.m_value.array->clear();
+                    }
+                    else if (current_item.is_object())
+                    {
+                        for (auto&& it : *current_item.m_value.object)
+                        {
+                            stack.push_back(std::move(it.second));
+                        }
+
+                        current_item.m_value.object->clear();
+                    }
+
+                    // it's now safe that current_item get destructed
+                    // since it doesn't have any children
+                }
+            }
+
+            switch (t)
+            {
+                case value_t::object:
+                {
+                    AllocatorType<object_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, object);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, object, 1);
+                    break;
+                }
+
+                case value_t::array:
+                {
+                    AllocatorType<array_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, array);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, array, 1);
+                    break;
+                }
+
+                case value_t::string:
+                {
+                    AllocatorType<string_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, string);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, string, 1);
+                    break;
+                }
+
+                case value_t::binary:
+                {
+                    AllocatorType<binary_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, binary);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, binary, 1);
+                    break;
+                }
+
+                case value_t::null:
+                case value_t::boolean:
+                case value_t::number_integer:
+                case value_t::number_unsigned:
+                case value_t::number_float:
+                case value_t::discarded:
+                default:
+                {
+                    break;
+                }
+            }
+        }
+    };
+
+  private:
+    /*!
+    @brief checks the class invariants
+
+    This function asserts the class invariants. It needs to be called at the
+    end of every constructor to make sure that created objects respect the
+    invariant. Furthermore, it has to be called each time the type of a JSON
+    value is changed, because the invariant expresses a relationship between
+    @a m_type and @a m_value.
+
+    Furthermore, the parent relation is checked for arrays and objects: If
+    @a check_parents true and the value is an array or object, then the
+    container's elements must have the current value as parent.
+
+    @param[in] check_parents  whether the parent relation should be checked.
+               The value is true by default and should only be set to false
+               during destruction of objects when the invariant does not
+               need to hold.
+    */
+    void assert_invariant(bool check_parents = true) const noexcept
+    {
+        JSON_ASSERT(m_type != value_t::object || m_value.object != nullptr);
+        JSON_ASSERT(m_type != value_t::array || m_value.array != nullptr);
+        JSON_ASSERT(m_type != value_t::string || m_value.string != nullptr);
+        JSON_ASSERT(m_type != value_t::binary || m_value.binary != nullptr);
+
+#if JSON_DIAGNOSTICS
+        JSON_TRY
+        {
+            // cppcheck-suppress assertWithSideEffect
+            JSON_ASSERT(!check_parents || !is_structured() || std::all_of(begin(), end(), [this](const basic_json & j)
+            {
+                return j.m_parent == this;
+            }));
+        }
+        JSON_CATCH(...) {} // LCOV_EXCL_LINE
+#endif
+        static_cast<void>(check_parents);
+    }
+
+    void set_parents()
+    {
+#if JSON_DIAGNOSTICS
+        switch (m_type)
+        {
+            case value_t::array:
+            {
+                for (auto& element : *m_value.array)
+                {
+                    element.m_parent = this;
+                }
+                break;
+            }
+
+            case value_t::object:
+            {
+                for (auto& element : *m_value.object)
+                {
+                    element.second.m_parent = this;
+                }
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                break;
+        }
+#endif
+    }
+
+    iterator set_parents(iterator it, typename iterator::difference_type count_set_parents)
+    {
+#if JSON_DIAGNOSTICS
+        for (typename iterator::difference_type i = 0; i < count_set_parents; ++i)
+        {
+            (it + i)->m_parent = this;
+        }
+#else
+        static_cast<void>(count_set_parents);
+#endif
+        return it;
+    }
+
+    reference set_parent(reference j, std::size_t old_capacity = static_cast<std::size_t>(-1))
+    {
+#if JSON_DIAGNOSTICS
+        if (old_capacity != static_cast<std::size_t>(-1))
+        {
+            // see https://github.com/nlohmann/json/issues/2838
+            JSON_ASSERT(type() == value_t::array);
+            if (JSON_HEDLEY_UNLIKELY(m_value.array->capacity() != old_capacity))
+            {
+                // capacity has changed: update all parents
+                set_parents();
+                return j;
+            }
+        }
+
+        // ordered_json uses a vector internally, so pointers could have
+        // been invalidated; see https://github.com/nlohmann/json/issues/2962
+#ifdef JSON_HEDLEY_MSVC_VERSION
+#pragma warning(push )
+#pragma warning(disable : 4127) // ignore warning to replace if with if constexpr
+#endif
+        if (detail::is_ordered_map<object_t>::value)
+        {
+            set_parents();
+            return j;
+        }
+#ifdef JSON_HEDLEY_MSVC_VERSION
+#pragma warning( pop )
+#endif
+
+        j.m_parent = this;
+#else
+        static_cast<void>(j);
+        static_cast<void>(old_capacity);
+#endif
+        return j;
+    }
+
+  public:
+    //////////////////////////
+    // JSON parser callback //
+    //////////////////////////
+
+    /// @brief parser event types
+    /// @sa https://json.nlohmann.me/api/basic_json/parse_event_t/
+    using parse_event_t = detail::parse_event_t;
+
+    /// @brief per-element parser callback type
+    /// @sa https://json.nlohmann.me/api/basic_json/parser_callback_t/
+    using parser_callback_t = detail::parser_callback_t<basic_json>;
+
+    //////////////////
+    // constructors //
+    //////////////////
+
+    /// @name constructors and destructors
+    /// Constructors of class @ref basic_json, copy/move constructor, copy
+    /// assignment, static functions creating objects, and the destructor.
+    /// @{
+
+    /// @brief create an empty value with a given type
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(const value_t v)
+        : m_type(v), m_value(v)
+    {
+        assert_invariant();
+    }
+
+    /// @brief create a null object
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(std::nullptr_t = nullptr) noexcept // NOLINT(bugprone-exception-escape)
+        : basic_json(value_t::null)
+    {
+        assert_invariant();
+    }
+
+    /// @brief create a JSON value from compatible types
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    template < typename CompatibleType,
+               typename U = detail::uncvref_t<CompatibleType>,
+               detail::enable_if_t <
+                   !detail::is_basic_json<U>::value && detail::is_compatible_type<basic_json_t, U>::value, int > = 0 >
+    basic_json(CompatibleType && val) noexcept(noexcept( // NOLINT(bugprone-forwarding-reference-overload,bugprone-exception-escape)
+                JSONSerializer<U>::to_json(std::declval<basic_json_t&>(),
+                                           std::forward<CompatibleType>(val))))
+    {
+        JSONSerializer<U>::to_json(*this, std::forward<CompatibleType>(val));
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief create a JSON value from an existing one
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    template < typename BasicJsonType,
+               detail::enable_if_t <
+                   detail::is_basic_json<BasicJsonType>::value&& !std::is_same<basic_json, BasicJsonType>::value, int > = 0 >
+    basic_json(const BasicJsonType& val)
+    {
+        using other_boolean_t = typename BasicJsonType::boolean_t;
+        using other_number_float_t = typename BasicJsonType::number_float_t;
+        using other_number_integer_t = typename BasicJsonType::number_integer_t;
+        using other_number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+        using other_string_t = typename BasicJsonType::string_t;
+        using other_object_t = typename BasicJsonType::object_t;
+        using other_array_t = typename BasicJsonType::array_t;
+        using other_binary_t = typename BasicJsonType::binary_t;
+
+        switch (val.type())
+        {
+            case value_t::boolean:
+                JSONSerializer<other_boolean_t>::to_json(*this, val.template get<other_boolean_t>());
+                break;
+            case value_t::number_float:
+                JSONSerializer<other_number_float_t>::to_json(*this, val.template get<other_number_float_t>());
+                break;
+            case value_t::number_integer:
+                JSONSerializer<other_number_integer_t>::to_json(*this, val.template get<other_number_integer_t>());
+                break;
+            case value_t::number_unsigned:
+                JSONSerializer<other_number_unsigned_t>::to_json(*this, val.template get<other_number_unsigned_t>());
+                break;
+            case value_t::string:
+                JSONSerializer<other_string_t>::to_json(*this, val.template get_ref<const other_string_t&>());
+                break;
+            case value_t::object:
+                JSONSerializer<other_object_t>::to_json(*this, val.template get_ref<const other_object_t&>());
+                break;
+            case value_t::array:
+                JSONSerializer<other_array_t>::to_json(*this, val.template get_ref<const other_array_t&>());
+                break;
+            case value_t::binary:
+                JSONSerializer<other_binary_t>::to_json(*this, val.template get_ref<const other_binary_t&>());
+                break;
+            case value_t::null:
+                *this = nullptr;
+                break;
+            case value_t::discarded:
+                m_type = value_t::discarded;
+                break;
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+        JSON_ASSERT(m_type == val.type());
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief create a container (array or object) from an initializer list
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(initializer_list_t init,
+               bool type_deduction = true,
+               value_t manual_type = value_t::array)
+    {
+        // check if each element is an array with two elements whose first
+        // element is a string
+        bool is_an_object = std::all_of(init.begin(), init.end(),
+                                        [](const detail::json_ref<basic_json>& element_ref)
+        {
+            return element_ref->is_array() && element_ref->size() == 2 && (*element_ref)[0].is_string();
+        });
+
+        // adjust type if type deduction is not wanted
+        if (!type_deduction)
+        {
+            // if array is wanted, do not create an object though possible
+            if (manual_type == value_t::array)
+            {
+                is_an_object = false;
+            }
+
+            // if object is wanted but impossible, throw an exception
+            if (JSON_HEDLEY_UNLIKELY(manual_type == value_t::object && !is_an_object))
+            {
+                JSON_THROW(type_error::create(301, "cannot create object from initializer list", nullptr));
+            }
+        }
+
+        if (is_an_object)
+        {
+            // the initializer list is a list of pairs -> create object
+            m_type = value_t::object;
+            m_value = value_t::object;
+
+            for (auto& element_ref : init)
+            {
+                auto element = element_ref.moved_or_copied();
+                m_value.object->emplace(
+                    std::move(*((*element.m_value.array)[0].m_value.string)),
+                    std::move((*element.m_value.array)[1]));
+            }
+        }
+        else
+        {
+            // the initializer list describes an array -> create array
+            m_type = value_t::array;
+            m_value.array = create<array_t>(init.begin(), init.end());
+        }
+
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief explicitly create a binary array (without subtype)
+    /// @sa https://json.nlohmann.me/api/basic_json/binary/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json binary(const typename binary_t::container_type& init)
+    {
+        auto res = basic_json();
+        res.m_type = value_t::binary;
+        res.m_value = init;
+        return res;
+    }
+
+    /// @brief explicitly create a binary array (with subtype)
+    /// @sa https://json.nlohmann.me/api/basic_json/binary/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json binary(const typename binary_t::container_type& init, typename binary_t::subtype_type subtype)
+    {
+        auto res = basic_json();
+        res.m_type = value_t::binary;
+        res.m_value = binary_t(init, subtype);
+        return res;
+    }
+
+    /// @brief explicitly create a binary array
+    /// @sa https://json.nlohmann.me/api/basic_json/binary/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json binary(typename binary_t::container_type&& init)
+    {
+        auto res = basic_json();
+        res.m_type = value_t::binary;
+        res.m_value = std::move(init);
+        return res;
+    }
+
+    /// @brief explicitly create a binary array (with subtype)
+    /// @sa https://json.nlohmann.me/api/basic_json/binary/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json binary(typename binary_t::container_type&& init, typename binary_t::subtype_type subtype)
+    {
+        auto res = basic_json();
+        res.m_type = value_t::binary;
+        res.m_value = binary_t(std::move(init), subtype);
+        return res;
+    }
+
+    /// @brief explicitly create an array from an initializer list
+    /// @sa https://json.nlohmann.me/api/basic_json/array/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json array(initializer_list_t init = {})
+    {
+        return basic_json(init, false, value_t::array);
+    }
+
+    /// @brief explicitly create an object from an initializer list
+    /// @sa https://json.nlohmann.me/api/basic_json/object/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json object(initializer_list_t init = {})
+    {
+        return basic_json(init, false, value_t::object);
+    }
+
+    /// @brief construct an array with count copies of given value
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(size_type cnt, const basic_json& val)
+        : m_type(value_t::array)
+    {
+        m_value.array = create<array_t>(cnt, val);
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief construct a JSON container given an iterator range
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    template < class InputIT, typename std::enable_if <
+                   std::is_same<InputIT, typename basic_json_t::iterator>::value ||
+                   std::is_same<InputIT, typename basic_json_t::const_iterator>::value, int >::type = 0 >
+    basic_json(InputIT first, InputIT last)
+    {
+        JSON_ASSERT(first.m_object != nullptr);
+        JSON_ASSERT(last.m_object != nullptr);
+
+        // make sure iterator fits the current value
+        if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(201, "iterators are not compatible", nullptr));
+        }
+
+        // copy type from first iterator
+        m_type = first.m_object->m_type;
+
+        // check if iterator range is complete for primitive values
+        switch (m_type)
+        {
+            case value_t::boolean:
+            case value_t::number_float:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::string:
+            {
+                if (JSON_HEDLEY_UNLIKELY(!first.m_it.primitive_iterator.is_begin()
+                                         || !last.m_it.primitive_iterator.is_end()))
+                {
+                    JSON_THROW(invalid_iterator::create(204, "iterators out of range", first.m_object));
+                }
+                break;
+            }
+
+            case value_t::null:
+            case value_t::object:
+            case value_t::array:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                break;
+        }
+
+        switch (m_type)
+        {
+            case value_t::number_integer:
+            {
+                m_value.number_integer = first.m_object->m_value.number_integer;
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                m_value.number_unsigned = first.m_object->m_value.number_unsigned;
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                m_value.number_float = first.m_object->m_value.number_float;
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                m_value.boolean = first.m_object->m_value.boolean;
+                break;
+            }
+
+            case value_t::string:
+            {
+                m_value = *first.m_object->m_value.string;
+                break;
+            }
+
+            case value_t::object:
+            {
+                m_value.object = create<object_t>(first.m_it.object_iterator,
+                                                  last.m_it.object_iterator);
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_value.array = create<array_t>(first.m_it.array_iterator,
+                                                last.m_it.array_iterator);
+                break;
+            }
+
+            case value_t::binary:
+            {
+                m_value = *first.m_object->m_value.binary;
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                JSON_THROW(invalid_iterator::create(206, detail::concat("cannot construct with iterators from ", first.m_object->type_name()), first.m_object));
+        }
+
+        set_parents();
+        assert_invariant();
+    }
+
+
+    ///////////////////////////////////////
+    // other constructors and destructor //
+    ///////////////////////////////////////
+
+    template<typename JsonRef,
+             detail::enable_if_t<detail::conjunction<detail::is_json_ref<JsonRef>,
+                                 std::is_same<typename JsonRef::value_type, basic_json>>::value, int> = 0 >
+    basic_json(const JsonRef& ref) : basic_json(ref.moved_or_copied()) {}
+
+    /// @brief copy constructor
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(const basic_json& other)
+        : m_type(other.m_type)
+    {
+        // check of passed value is valid
+        other.assert_invariant();
+
+        switch (m_type)
+        {
+            case value_t::object:
+            {
+                m_value = *other.m_value.object;
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_value = *other.m_value.array;
+                break;
+            }
+
+            case value_t::string:
+            {
+                m_value = *other.m_value.string;
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                m_value = other.m_value.boolean;
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                m_value = other.m_value.number_integer;
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                m_value = other.m_value.number_unsigned;
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                m_value = other.m_value.number_float;
+                break;
+            }
+
+            case value_t::binary:
+            {
+                m_value = *other.m_value.binary;
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                break;
+        }
+
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief move constructor
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(basic_json&& other) noexcept
+        : m_type(std::move(other.m_type)),
+          m_value(std::move(other.m_value))
+    {
+        // check that passed value is valid
+        other.assert_invariant(false);
+
+        // invalidate payload
+        other.m_type = value_t::null;
+        other.m_value = {};
+
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief copy assignment
+    /// @sa https://json.nlohmann.me/api/basic_json/operator=/
+    basic_json& operator=(basic_json other) noexcept (
+        std::is_nothrow_move_constructible<value_t>::value&&
+        std::is_nothrow_move_assignable<value_t>::value&&
+        std::is_nothrow_move_constructible<json_value>::value&&
+        std::is_nothrow_move_assignable<json_value>::value
+    )
+    {
+        // check that passed value is valid
+        other.assert_invariant();
+
+        using std::swap;
+        swap(m_type, other.m_type);
+        swap(m_value, other.m_value);
+
+        set_parents();
+        assert_invariant();
+        return *this;
+    }
+
+    /// @brief destructor
+    /// @sa https://json.nlohmann.me/api/basic_json/~basic_json/
+    ~basic_json() noexcept
+    {
+        assert_invariant(false);
+        m_value.destroy(m_type);
+    }
+
+    /// @}
+
+  public:
+    ///////////////////////
+    // object inspection //
+    ///////////////////////
+
+    /// @name object inspection
+    /// Functions to inspect the type of a JSON value.
+    /// @{
+
+    /// @brief serialization
+    /// @sa https://json.nlohmann.me/api/basic_json/dump/
+    string_t dump(const int indent = -1,
+                  const char indent_char = ' ',
+                  const bool ensure_ascii = false,
+                  const error_handler_t error_handler = error_handler_t::strict) const
+    {
+        string_t result;
+        serializer s(detail::output_adapter<char, string_t>(result), indent_char, error_handler);
+
+        if (indent >= 0)
+        {
+            s.dump(*this, true, ensure_ascii, static_cast<unsigned int>(indent));
+        }
+        else
+        {
+            s.dump(*this, false, ensure_ascii, 0);
+        }
+
+        return result;
+    }
+
+    /// @brief return the type of the JSON value (explicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/type/
+    constexpr value_t type() const noexcept
+    {
+        return m_type;
+    }
+
+    /// @brief return whether type is primitive
+    /// @sa https://json.nlohmann.me/api/basic_json/is_primitive/
+    constexpr bool is_primitive() const noexcept
+    {
+        return is_null() || is_string() || is_boolean() || is_number() || is_binary();
+    }
+
+    /// @brief return whether type is structured
+    /// @sa https://json.nlohmann.me/api/basic_json/is_structured/
+    constexpr bool is_structured() const noexcept
+    {
+        return is_array() || is_object();
+    }
+
+    /// @brief return whether value is null
+    /// @sa https://json.nlohmann.me/api/basic_json/is_null/
+    constexpr bool is_null() const noexcept
+    {
+        return m_type == value_t::null;
+    }
+
+    /// @brief return whether value is a boolean
+    /// @sa https://json.nlohmann.me/api/basic_json/is_boolean/
+    constexpr bool is_boolean() const noexcept
+    {
+        return m_type == value_t::boolean;
+    }
+
+    /// @brief return whether value is a number
+    /// @sa https://json.nlohmann.me/api/basic_json/is_number/
+    constexpr bool is_number() const noexcept
+    {
+        return is_number_integer() || is_number_float();
+    }
+
+    /// @brief return whether value is an integer number
+    /// @sa https://json.nlohmann.me/api/basic_json/is_number_integer/
+    constexpr bool is_number_integer() const noexcept
+    {
+        return m_type == value_t::number_integer || m_type == value_t::number_unsigned;
+    }
+
+    /// @brief return whether value is an unsigned integer number
+    /// @sa https://json.nlohmann.me/api/basic_json/is_number_unsigned/
+    constexpr bool is_number_unsigned() const noexcept
+    {
+        return m_type == value_t::number_unsigned;
+    }
+
+    /// @brief return whether value is a floating-point number
+    /// @sa https://json.nlohmann.me/api/basic_json/is_number_float/
+    constexpr bool is_number_float() const noexcept
+    {
+        return m_type == value_t::number_float;
+    }
+
+    /// @brief return whether value is an object
+    /// @sa https://json.nlohmann.me/api/basic_json/is_object/
+    constexpr bool is_object() const noexcept
+    {
+        return m_type == value_t::object;
+    }
+
+    /// @brief return whether value is an array
+    /// @sa https://json.nlohmann.me/api/basic_json/is_array/
+    constexpr bool is_array() const noexcept
+    {
+        return m_type == value_t::array;
+    }
+
+    /// @brief return whether value is a string
+    /// @sa https://json.nlohmann.me/api/basic_json/is_string/
+    constexpr bool is_string() const noexcept
+    {
+        return m_type == value_t::string;
+    }
+
+    /// @brief return whether value is a binary array
+    /// @sa https://json.nlohmann.me/api/basic_json/is_binary/
+    constexpr bool is_binary() const noexcept
+    {
+        return m_type == value_t::binary;
+    }
+
+    /// @brief return whether value is discarded
+    /// @sa https://json.nlohmann.me/api/basic_json/is_discarded/
+    constexpr bool is_discarded() const noexcept
+    {
+        return m_type == value_t::discarded;
+    }
+
+    /// @brief return the type of the JSON value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_value_t/
+    constexpr operator value_t() const noexcept
+    {
+        return m_type;
+    }
+
+    /// @}
+
+  private:
+    //////////////////
+    // value access //
+    //////////////////
+
+    /// get a boolean (explicit)
+    boolean_t get_impl(boolean_t* /*unused*/) const
+    {
+        if (JSON_HEDLEY_LIKELY(is_boolean()))
+        {
+            return m_value.boolean;
+        }
+
+        JSON_THROW(type_error::create(302, detail::concat("type must be boolean, but is ", type_name()), this));
+    }
+
+    /// get a pointer to the value (object)
+    object_t* get_impl_ptr(object_t* /*unused*/) noexcept
+    {
+        return is_object() ? m_value.object : nullptr;
+    }
+
+    /// get a pointer to the value (object)
+    constexpr const object_t* get_impl_ptr(const object_t* /*unused*/) const noexcept
+    {
+        return is_object() ? m_value.object : nullptr;
+    }
+
+    /// get a pointer to the value (array)
+    array_t* get_impl_ptr(array_t* /*unused*/) noexcept
+    {
+        return is_array() ? m_value.array : nullptr;
+    }
+
+    /// get a pointer to the value (array)
+    constexpr const array_t* get_impl_ptr(const array_t* /*unused*/) const noexcept
+    {
+        return is_array() ? m_value.array : nullptr;
+    }
+
+    /// get a pointer to the value (string)
+    string_t* get_impl_ptr(string_t* /*unused*/) noexcept
+    {
+        return is_string() ? m_value.string : nullptr;
+    }
+
+    /// get a pointer to the value (string)
+    constexpr const string_t* get_impl_ptr(const string_t* /*unused*/) const noexcept
+    {
+        return is_string() ? m_value.string : nullptr;
+    }
+
+    /// get a pointer to the value (boolean)
+    boolean_t* get_impl_ptr(boolean_t* /*unused*/) noexcept
+    {
+        return is_boolean() ? &m_value.boolean : nullptr;
+    }
+
+    /// get a pointer to the value (boolean)
+    constexpr const boolean_t* get_impl_ptr(const boolean_t* /*unused*/) const noexcept
+    {
+        return is_boolean() ? &m_value.boolean : nullptr;
+    }
+
+    /// get a pointer to the value (integer number)
+    number_integer_t* get_impl_ptr(number_integer_t* /*unused*/) noexcept
+    {
+        return is_number_integer() ? &m_value.number_integer : nullptr;
+    }
+
+    /// get a pointer to the value (integer number)
+    constexpr const number_integer_t* get_impl_ptr(const number_integer_t* /*unused*/) const noexcept
+    {
+        return is_number_integer() ? &m_value.number_integer : nullptr;
+    }
+
+    /// get a pointer to the value (unsigned number)
+    number_unsigned_t* get_impl_ptr(number_unsigned_t* /*unused*/) noexcept
+    {
+        return is_number_unsigned() ? &m_value.number_unsigned : nullptr;
+    }
+
+    /// get a pointer to the value (unsigned number)
+    constexpr const number_unsigned_t* get_impl_ptr(const number_unsigned_t* /*unused*/) const noexcept
+    {
+        return is_number_unsigned() ? &m_value.number_unsigned : nullptr;
+    }
+
+    /// get a pointer to the value (floating-point number)
+    number_float_t* get_impl_ptr(number_float_t* /*unused*/) noexcept
+    {
+        return is_number_float() ? &m_value.number_float : nullptr;
+    }
+
+    /// get a pointer to the value (floating-point number)
+    constexpr const number_float_t* get_impl_ptr(const number_float_t* /*unused*/) const noexcept
+    {
+        return is_number_float() ? &m_value.number_float : nullptr;
+    }
+
+    /// get a pointer to the value (binary)
+    binary_t* get_impl_ptr(binary_t* /*unused*/) noexcept
+    {
+        return is_binary() ? m_value.binary : nullptr;
+    }
+
+    /// get a pointer to the value (binary)
+    constexpr const binary_t* get_impl_ptr(const binary_t* /*unused*/) const noexcept
+    {
+        return is_binary() ? m_value.binary : nullptr;
+    }
+
+    /*!
+    @brief helper function to implement get_ref()
+
+    This function helps to implement get_ref() without code duplication for
+    const and non-const overloads
+
+    @tparam ThisType will be deduced as `basic_json` or `const basic_json`
+
+    @throw type_error.303 if ReferenceType does not match underlying value
+    type of the current JSON
+    */
+    template<typename ReferenceType, typename ThisType>
+    static ReferenceType get_ref_impl(ThisType& obj)
+    {
+        // delegate the call to get_ptr<>()
+        auto* ptr = obj.template get_ptr<typename std::add_pointer<ReferenceType>::type>();
+
+        if (JSON_HEDLEY_LIKELY(ptr != nullptr))
+        {
+            return *ptr;
+        }
+
+        JSON_THROW(type_error::create(303, detail::concat("incompatible ReferenceType for get_ref, actual type is ", obj.type_name()), &obj));
+    }
+
+  public:
+    /// @name value access
+    /// Direct access to the stored value of a JSON value.
+    /// @{
+
+    /// @brief get a pointer value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_ptr/
+    template<typename PointerType, typename std::enable_if<
+                 std::is_pointer<PointerType>::value, int>::type = 0>
+    auto get_ptr() noexcept -> decltype(std::declval<basic_json_t&>().get_impl_ptr(std::declval<PointerType>()))
+    {
+        // delegate the call to get_impl_ptr<>()
+        return get_impl_ptr(static_cast<PointerType>(nullptr));
+    }
+
+    /// @brief get a pointer value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_ptr/
+    template < typename PointerType, typename std::enable_if <
+                   std::is_pointer<PointerType>::value&&
+                   std::is_const<typename std::remove_pointer<PointerType>::type>::value, int >::type = 0 >
+    constexpr auto get_ptr() const noexcept -> decltype(std::declval<const basic_json_t&>().get_impl_ptr(std::declval<PointerType>()))
+    {
+        // delegate the call to get_impl_ptr<>() const
+        return get_impl_ptr(static_cast<PointerType>(nullptr));
+    }
+
+  private:
+    /*!
+    @brief get a value (explicit)
+
+    Explicit type conversion between the JSON value and a compatible value
+    which is [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible)
+    and [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible).
+    The value is converted by calling the @ref json_serializer<ValueType>
+    `from_json()` method.
+
+    The function is equivalent to executing
+    @code {.cpp}
+    ValueType ret;
+    JSONSerializer<ValueType>::from_json(*this, ret);
+    return ret;
+    @endcode
+
+    This overloads is chosen if:
+    - @a ValueType is not @ref basic_json,
+    - @ref json_serializer<ValueType> has a `from_json()` method of the form
+      `void from_json(const basic_json&, ValueType&)`, and
+    - @ref json_serializer<ValueType> does not have a `from_json()` method of
+      the form `ValueType from_json(const basic_json&)`
+
+    @tparam ValueType the returned value type
+
+    @return copy of the JSON value, converted to @a ValueType
+
+    @throw what @ref json_serializer<ValueType> `from_json()` method throws
+
+    @liveexample{The example below shows several conversions from JSON values
+    to other types. There a few things to note: (1) Floating-point numbers can
+    be converted to integers\, (2) A JSON array can be converted to a standard
+    `std::vector<short>`\, (3) A JSON object can be converted to C++
+    associative containers such as `std::unordered_map<std::string\,
+    json>`.,get__ValueType_const}
+
+    @since version 2.1.0
+    */
+    template < typename ValueType,
+               detail::enable_if_t <
+                   detail::is_default_constructible<ValueType>::value&&
+                   detail::has_from_json<basic_json_t, ValueType>::value,
+                   int > = 0 >
+    ValueType get_impl(detail::priority_tag<0> /*unused*/) const noexcept(noexcept(
+                JSONSerializer<ValueType>::from_json(std::declval<const basic_json_t&>(), std::declval<ValueType&>())))
+    {
+        auto ret = ValueType();
+        JSONSerializer<ValueType>::from_json(*this, ret);
+        return ret;
+    }
+
+    /*!
+    @brief get a value (explicit); special case
+
+    Explicit type conversion between the JSON value and a compatible value
+    which is **not** [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible)
+    and **not** [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible).
+    The value is converted by calling the @ref json_serializer<ValueType>
+    `from_json()` method.
+
+    The function is equivalent to executing
+    @code {.cpp}
+    return JSONSerializer<ValueType>::from_json(*this);
+    @endcode
+
+    This overloads is chosen if:
+    - @a ValueType is not @ref basic_json and
+    - @ref json_serializer<ValueType> has a `from_json()` method of the form
+      `ValueType from_json(const basic_json&)`
+
+    @note If @ref json_serializer<ValueType> has both overloads of
+    `from_json()`, this one is chosen.
+
+    @tparam ValueType the returned value type
+
+    @return copy of the JSON value, converted to @a ValueType
+
+    @throw what @ref json_serializer<ValueType> `from_json()` method throws
+
+    @since version 2.1.0
+    */
+    template < typename ValueType,
+               detail::enable_if_t <
+                   detail::has_non_default_from_json<basic_json_t, ValueType>::value,
+                   int > = 0 >
+    ValueType get_impl(detail::priority_tag<1> /*unused*/) const noexcept(noexcept(
+                JSONSerializer<ValueType>::from_json(std::declval<const basic_json_t&>())))
+    {
+        return JSONSerializer<ValueType>::from_json(*this);
+    }
+
+    /*!
+    @brief get special-case overload
+
+    This overloads converts the current @ref basic_json in a different
+    @ref basic_json type
+
+    @tparam BasicJsonType == @ref basic_json
+
+    @return a copy of *this, converted into @a BasicJsonType
+
+    @complexity Depending on the implementation of the called `from_json()`
+                method.
+
+    @since version 3.2.0
+    */
+    template < typename BasicJsonType,
+               detail::enable_if_t <
+                   detail::is_basic_json<BasicJsonType>::value,
+                   int > = 0 >
+    BasicJsonType get_impl(detail::priority_tag<2> /*unused*/) const
+    {
+        return *this;
+    }
+
+    /*!
+    @brief get special-case overload
+
+    This overloads avoids a lot of template boilerplate, it can be seen as the
+    identity method
+
+    @tparam BasicJsonType == @ref basic_json
+
+    @return a copy of *this
+
+    @complexity Constant.
+
+    @since version 2.1.0
+    */
+    template<typename BasicJsonType,
+             detail::enable_if_t<
+                 std::is_same<BasicJsonType, basic_json_t>::value,
+                 int> = 0>
+    basic_json get_impl(detail::priority_tag<3> /*unused*/) const
+    {
+        return *this;
+    }
+
+    /*!
+    @brief get a pointer value (explicit)
+    @copydoc get()
+    */
+    template<typename PointerType,
+             detail::enable_if_t<
+                 std::is_pointer<PointerType>::value,
+                 int> = 0>
+    constexpr auto get_impl(detail::priority_tag<4> /*unused*/) const noexcept
+    -> decltype(std::declval<const basic_json_t&>().template get_ptr<PointerType>())
+    {
+        // delegate the call to get_ptr
+        return get_ptr<PointerType>();
+    }
+
+  public:
+    /*!
+    @brief get a (pointer) value (explicit)
+
+    Performs explicit type conversion between the JSON value and a compatible value if required.
+
+    - If the requested type is a pointer to the internally stored JSON value that pointer is returned.
+    No copies are made.
+
+    - If the requested type is the current @ref basic_json, or a different @ref basic_json convertible
+    from the current @ref basic_json.
+
+    - Otherwise the value is converted by calling the @ref json_serializer<ValueType> `from_json()`
+    method.
+
+    @tparam ValueTypeCV the provided value type
+    @tparam ValueType the returned value type
+
+    @return copy of the JSON value, converted to @tparam ValueType if necessary
+
+    @throw what @ref json_serializer<ValueType> `from_json()` method throws if conversion is required
+
+    @since version 2.1.0
+    */
+    template < typename ValueTypeCV, typename ValueType = detail::uncvref_t<ValueTypeCV>>
+#if defined(JSON_HAS_CPP_14)
+    constexpr
+#endif
+    auto get() const noexcept(
+    noexcept(std::declval<const basic_json_t&>().template get_impl<ValueType>(detail::priority_tag<4> {})))
+    -> decltype(std::declval<const basic_json_t&>().template get_impl<ValueType>(detail::priority_tag<4> {}))
+    {
+        // we cannot static_assert on ValueTypeCV being non-const, because
+        // there is support for get<const basic_json_t>(), which is why we
+        // still need the uncvref
+        static_assert(!std::is_reference<ValueTypeCV>::value,
+                      "get() cannot be used with reference types, you might want to use get_ref()");
+        return get_impl<ValueType>(detail::priority_tag<4> {});
+    }
+
+    /*!
+    @brief get a pointer value (explicit)
+
+    Explicit pointer access to the internally stored JSON value. No copies are
+    made.
+
+    @warning The pointer becomes invalid if the underlying JSON object
+    changes.
+
+    @tparam PointerType pointer type; must be a pointer to @ref array_t, @ref
+    object_t, @ref string_t, @ref boolean_t, @ref number_integer_t,
+    @ref number_unsigned_t, or @ref number_float_t.
+
+    @return pointer to the internally stored JSON value if the requested
+    pointer type @a PointerType fits to the JSON value; `nullptr` otherwise
+
+    @complexity Constant.
+
+    @liveexample{The example below shows how pointers to internal values of a
+    JSON value can be requested. Note that no type conversions are made and a
+    `nullptr` is returned if the value and the requested pointer type does not
+    match.,get__PointerType}
+
+    @sa see @ref get_ptr() for explicit pointer-member access
+
+    @since version 1.0.0
+    */
+    template<typename PointerType, typename std::enable_if<
+                 std::is_pointer<PointerType>::value, int>::type = 0>
+    auto get() noexcept -> decltype(std::declval<basic_json_t&>().template get_ptr<PointerType>())
+    {
+        // delegate the call to get_ptr
+        return get_ptr<PointerType>();
+    }
+
+    /// @brief get a value (explicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_to/
+    template < typename ValueType,
+               detail::enable_if_t <
+                   !detail::is_basic_json<ValueType>::value&&
+                   detail::has_from_json<basic_json_t, ValueType>::value,
+                   int > = 0 >
+    ValueType & get_to(ValueType& v) const noexcept(noexcept(
+                JSONSerializer<ValueType>::from_json(std::declval<const basic_json_t&>(), v)))
+    {
+        JSONSerializer<ValueType>::from_json(*this, v);
+        return v;
+    }
+
+    // specialization to allow calling get_to with a basic_json value
+    // see https://github.com/nlohmann/json/issues/2175
+    template<typename ValueType,
+             detail::enable_if_t <
+                 detail::is_basic_json<ValueType>::value,
+                 int> = 0>
+    ValueType & get_to(ValueType& v) const
+    {
+        v = *this;
+        return v;
+    }
+
+    template <
+        typename T, std::size_t N,
+        typename Array = T (&)[N], // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+        detail::enable_if_t <
+            detail::has_from_json<basic_json_t, Array>::value, int > = 0 >
+    Array get_to(T (&v)[N]) const // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+    noexcept(noexcept(JSONSerializer<Array>::from_json(
+                          std::declval<const basic_json_t&>(), v)))
+    {
+        JSONSerializer<Array>::from_json(*this, v);
+        return v;
+    }
+
+    /// @brief get a reference value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_ref/
+    template<typename ReferenceType, typename std::enable_if<
+                 std::is_reference<ReferenceType>::value, int>::type = 0>
+    ReferenceType get_ref()
+    {
+        // delegate call to get_ref_impl
+        return get_ref_impl<ReferenceType>(*this);
+    }
+
+    /// @brief get a reference value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_ref/
+    template < typename ReferenceType, typename std::enable_if <
+                   std::is_reference<ReferenceType>::value&&
+                   std::is_const<typename std::remove_reference<ReferenceType>::type>::value, int >::type = 0 >
+    ReferenceType get_ref() const
+    {
+        // delegate call to get_ref_impl
+        return get_ref_impl<ReferenceType>(*this);
+    }
+
+    /*!
+    @brief get a value (implicit)
+
+    Implicit type conversion between the JSON value and a compatible value.
+    The call is realized by calling @ref get() const.
+
+    @tparam ValueType non-pointer type compatible to the JSON value, for
+    instance `int` for JSON integer numbers, `bool` for JSON booleans, or
+    `std::vector` types for JSON arrays. The character type of @ref string_t
+    as well as an initializer list of this type is excluded to avoid
+    ambiguities as these types implicitly convert to `std::string`.
+
+    @return copy of the JSON value, converted to type @a ValueType
+
+    @throw type_error.302 in case passed type @a ValueType is incompatible
+    to the JSON value type (e.g., the JSON value is of type boolean, but a
+    string is requested); see example below
+
+    @complexity Linear in the size of the JSON value.
+
+    @liveexample{The example below shows several conversions from JSON values
+    to other types. There a few things to note: (1) Floating-point numbers can
+    be converted to integers\, (2) A JSON array can be converted to a standard
+    `std::vector<short>`\, (3) A JSON object can be converted to C++
+    associative containers such as `std::unordered_map<std::string\,
+    json>`.,operator__ValueType}
+
+    @since version 1.0.0
+    */
+    template < typename ValueType, typename std::enable_if <
+                   detail::conjunction <
+                       detail::negation<std::is_pointer<ValueType>>,
+                       detail::negation<std::is_same<ValueType, std::nullptr_t>>,
+                       detail::negation<std::is_same<ValueType, detail::json_ref<basic_json>>>,
+                                        detail::negation<std::is_same<ValueType, typename string_t::value_type>>,
+                                        detail::negation<detail::is_basic_json<ValueType>>,
+                                        detail::negation<std::is_same<ValueType, std::initializer_list<typename string_t::value_type>>>,
+#if defined(JSON_HAS_CPP_17) && (defined(__GNUC__) || (defined(_MSC_VER) && _MSC_VER >= 1910 && _MSC_VER <= 1914))
+                                                detail::negation<std::is_same<ValueType, std::string_view>>,
+#endif
+#if defined(JSON_HAS_CPP_17)
+                                                detail::negation<std::is_same<ValueType, std::any>>,
+#endif
+                                                detail::is_detected_lazy<detail::get_template_function, const basic_json_t&, ValueType>
+                                                >::value, int >::type = 0 >
+                                        JSON_EXPLICIT operator ValueType() const
+    {
+        // delegate the call to get<>() const
+        return get<ValueType>();
+    }
+
+    /// @brief get a binary value
+    /// @sa https://json.nlohmann.me/api/basic_json/get_binary/
+    binary_t& get_binary()
+    {
+        if (!is_binary())
+        {
+            JSON_THROW(type_error::create(302, detail::concat("type must be binary, but is ", type_name()), this));
+        }
+
+        return *get_ptr<binary_t*>();
+    }
+
+    /// @brief get a binary value
+    /// @sa https://json.nlohmann.me/api/basic_json/get_binary/
+    const binary_t& get_binary() const
+    {
+        if (!is_binary())
+        {
+            JSON_THROW(type_error::create(302, detail::concat("type must be binary, but is ", type_name()), this));
+        }
+
+        return *get_ptr<const binary_t*>();
+    }
+
+    /// @}
+
+
+    ////////////////////
+    // element access //
+    ////////////////////
+
+    /// @name element access
+    /// Access to the JSON value.
+    /// @{
+
+    /// @brief access specified array element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    reference at(size_type idx)
+    {
+        // at only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            JSON_TRY
+            {
+                return set_parent(m_value.array->at(idx));
+            }
+            JSON_CATCH (std::out_of_range&)
+            {
+                // create better exception explanation
+                JSON_THROW(out_of_range::create(401, detail::concat("array index ", std::to_string(idx), " is out of range"), this));
+            }
+        }
+        else
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+    }
+
+    /// @brief access specified array element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    const_reference at(size_type idx) const
+    {
+        // at only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            JSON_TRY
+            {
+                return m_value.array->at(idx);
+            }
+            JSON_CATCH (std::out_of_range&)
+            {
+                // create better exception explanation
+                JSON_THROW(out_of_range::create(401, detail::concat("array index ", std::to_string(idx), " is out of range"), this));
+            }
+        }
+        else
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+    }
+
+    /// @brief access specified object element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    reference at(const typename object_t::key_type& key)
+    {
+        // at only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+
+        auto it = m_value.object->find(key);
+        if (it == m_value.object->end())
+        {
+            JSON_THROW(out_of_range::create(403, detail::concat("key '", key, "' not found"), this));
+        }
+        return set_parent(it->second);
+    }
+
+    /// @brief access specified object element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    reference at(KeyType && key)
+    {
+        // at only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+
+        auto it = m_value.object->find(std::forward<KeyType>(key));
+        if (it == m_value.object->end())
+        {
+            JSON_THROW(out_of_range::create(403, detail::concat("key '", string_t(std::forward<KeyType>(key)), "' not found"), this));
+        }
+        return set_parent(it->second);
+    }
+
+    /// @brief access specified object element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    const_reference at(const typename object_t::key_type& key) const
+    {
+        // at only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+
+        auto it = m_value.object->find(key);
+        if (it == m_value.object->end())
+        {
+            JSON_THROW(out_of_range::create(403, detail::concat("key '", key, "' not found"), this));
+        }
+        return it->second;
+    }
+
+    /// @brief access specified object element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    const_reference at(KeyType && key) const
+    {
+        // at only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+
+        auto it = m_value.object->find(std::forward<KeyType>(key));
+        if (it == m_value.object->end())
+        {
+            JSON_THROW(out_of_range::create(403, detail::concat("key '", string_t(std::forward<KeyType>(key)), "' not found"), this));
+        }
+        return it->second;
+    }
+
+    /// @brief access specified array element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    reference operator[](size_type idx)
+    {
+        // implicitly convert null value to an empty array
+        if (is_null())
+        {
+            m_type = value_t::array;
+            m_value.array = create<array_t>();
+            assert_invariant();
+        }
+
+        // operator[] only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            // fill up array with null values if given idx is outside range
+            if (idx >= m_value.array->size())
+            {
+#if JSON_DIAGNOSTICS
+                // remember array size & capacity before resizing
+                const auto old_size = m_value.array->size();
+                const auto old_capacity = m_value.array->capacity();
+#endif
+                m_value.array->resize(idx + 1);
+
+#if JSON_DIAGNOSTICS
+                if (JSON_HEDLEY_UNLIKELY(m_value.array->capacity() != old_capacity))
+                {
+                    // capacity has changed: update all parents
+                    set_parents();
+                }
+                else
+                {
+                    // set parent for values added above
+                    set_parents(begin() + static_cast<typename iterator::difference_type>(old_size), static_cast<typename iterator::difference_type>(idx + 1 - old_size));
+                }
+#endif
+                assert_invariant();
+            }
+
+            return m_value.array->operator[](idx);
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a numeric argument with ", type_name()), this));
+    }
+
+    /// @brief access specified array element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    const_reference operator[](size_type idx) const
+    {
+        // const operator[] only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            return m_value.array->operator[](idx);
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a numeric argument with ", type_name()), this));
+    }
+
+    /// @brief access specified object element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    reference operator[](typename object_t::key_type key)
+    {
+        // implicitly convert null value to an empty object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value.object = create<object_t>();
+            assert_invariant();
+        }
+
+        // operator[] only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            auto result = m_value.object->emplace(std::move(key), nullptr);
+            return set_parent(result.first->second);
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a string argument with ", type_name()), this));
+    }
+
+    /// @brief access specified object element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    const_reference operator[](const typename object_t::key_type& key) const
+    {
+        // const operator[] only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            auto it = m_value.object->find(key);
+            JSON_ASSERT(it != m_value.object->end());
+            return it->second;
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a string argument with ", type_name()), this));
+    }
+
+    // these two functions resolve a (const) char * ambiguity affecting Clang and MSVC
+    // (they seemingly cannot be constrained to resolve the ambiguity)
+    template<typename T>
+    reference operator[](T* key)
+    {
+        return operator[](typename object_t::key_type(key));
+    }
+
+    template<typename T>
+    const_reference operator[](T* key) const
+    {
+        return operator[](typename object_t::key_type(key));
+    }
+
+    /// @brief access specified object element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int > = 0 >
+    reference operator[](KeyType && key)
+    {
+        // implicitly convert null value to an empty object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value.object = create<object_t>();
+            assert_invariant();
+        }
+
+        // operator[] only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            auto result = m_value.object->emplace(std::forward<KeyType>(key), nullptr);
+            return set_parent(result.first->second);
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a string argument with ", type_name()), this));
+    }
+
+    /// @brief access specified object element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int > = 0 >
+    const_reference operator[](KeyType && key) const
+    {
+        // const operator[] only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            auto it = m_value.object->find(std::forward<KeyType>(key));
+            JSON_ASSERT(it != m_value.object->end());
+            return it->second;
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a string argument with ", type_name()), this));
+    }
+
+  private:
+    template<typename KeyType>
+    using is_comparable_with_object_key = detail::is_comparable <
+        object_comparator_t, const typename object_t::key_type&, KeyType >;
+
+    template<typename ValueType>
+    using value_return_type = std::conditional <
+        detail::is_c_string_uncvref<ValueType>::value,
+        string_t, typename std::decay<ValueType>::type >;
+
+  public:
+    /// @brief access specified object element with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, detail::enable_if_t <
+                   !detail::is_transparent<object_comparator_t>::value
+                   && detail::is_getable<basic_json_t, ValueType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ValueType value(const typename object_t::key_type& key, const ValueType& default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if key is found, return value and given default value otherwise
+            const auto it = find(key);
+            if (it != end())
+            {
+                return it->template get<ValueType>();
+            }
+
+            return default_value;
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, class ReturnType = typename value_return_type<ValueType>::type,
+               detail::enable_if_t <
+                   !detail::is_transparent<object_comparator_t>::value
+                   && detail::is_getable<basic_json_t, ReturnType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ReturnType value(const typename object_t::key_type& key, ValueType && default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if key is found, return value and given default value otherwise
+            const auto it = find(key);
+            if (it != end())
+            {
+                return it->template get<ReturnType>();
+            }
+
+            return std::forward<ValueType>(default_value);
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, class KeyType, detail::enable_if_t <
+                   detail::is_transparent<object_comparator_t>::value
+                   && !detail::is_json_pointer<KeyType>::value
+                   && is_comparable_with_object_key<KeyType>::value
+                   && detail::is_getable<basic_json_t, ValueType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ValueType value(KeyType && key, const ValueType& default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if key is found, return value and given default value otherwise
+            const auto it = find(std::forward<KeyType>(key));
+            if (it != end())
+            {
+                return it->template get<ValueType>();
+            }
+
+            return default_value;
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element via JSON Pointer with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, class KeyType, class ReturnType = typename value_return_type<ValueType>::type,
+               detail::enable_if_t <
+                   detail::is_transparent<object_comparator_t>::value
+                   && !detail::is_json_pointer<KeyType>::value
+                   && is_comparable_with_object_key<KeyType>::value
+                   && detail::is_getable<basic_json_t, ReturnType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ReturnType value(KeyType && key, ValueType && default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if key is found, return value and given default value otherwise
+            const auto it = find(std::forward<KeyType>(key));
+            if (it != end())
+            {
+                return it->template get<ReturnType>();
+            }
+
+            return std::forward<ValueType>(default_value);
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element via JSON Pointer with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, detail::enable_if_t <
+                   detail::is_getable<basic_json_t, ValueType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ValueType value(const json_pointer& ptr, const ValueType& default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if pointer resolves a value, return it or use default value
+            JSON_TRY
+            {
+                return ptr.get_checked(this).template get<ValueType>();
+            }
+            JSON_INTERNAL_CATCH (out_of_range&)
+            {
+                return default_value;
+            }
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element via JSON Pointer with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, class ReturnType = typename value_return_type<ValueType>::type,
+               detail::enable_if_t <
+                   detail::is_getable<basic_json_t, ReturnType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ReturnType value(const json_pointer& ptr, ValueType && default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if pointer resolves a value, return it or use default value
+            JSON_TRY
+            {
+                return ptr.get_checked(this).template get<ReturnType>();
+            }
+            JSON_INTERNAL_CATCH (out_of_range&)
+            {
+                return std::forward<ValueType>(default_value);
+            }
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    template < class ValueType, class BasicJsonType, detail::enable_if_t <
+                   detail::is_basic_json<BasicJsonType>::value
+                   && detail::is_getable<basic_json_t, ValueType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    ValueType value(const ::nlohmann::json_pointer<BasicJsonType>& ptr, const ValueType& default_value) const
+    {
+        return value(ptr.convert(), default_value);
+    }
+
+    template < class ValueType, class BasicJsonType, class ReturnType = typename value_return_type<ValueType>::type,
+               detail::enable_if_t <
+                   detail::is_basic_json<BasicJsonType>::value
+                   && detail::is_getable<basic_json_t, ReturnType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    ReturnType value(const ::nlohmann::json_pointer<BasicJsonType>& ptr, ValueType && default_value) const
+    {
+        return value(ptr.convert(), std::forward<ValueType>(default_value));
+    }
+
+    /// @brief access the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/front/
+    reference front()
+    {
+        return *begin();
+    }
+
+    /// @brief access the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/front/
+    const_reference front() const
+    {
+        return *cbegin();
+    }
+
+    /// @brief access the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/back/
+    reference back()
+    {
+        auto tmp = end();
+        --tmp;
+        return *tmp;
+    }
+
+    /// @brief access the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/back/
+    const_reference back() const
+    {
+        auto tmp = cend();
+        --tmp;
+        return *tmp;
+    }
+
+    /// @brief remove element given an iterator
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    template < class IteratorType, detail::enable_if_t <
+                   std::is_same<IteratorType, typename basic_json_t::iterator>::value ||
+                   std::is_same<IteratorType, typename basic_json_t::const_iterator>::value, int > = 0 >
+    IteratorType erase(IteratorType pos)
+    {
+        // make sure iterator fits the current value
+        if (JSON_HEDLEY_UNLIKELY(this != pos.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+        }
+
+        IteratorType result = end();
+
+        switch (m_type)
+        {
+            case value_t::boolean:
+            case value_t::number_float:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::string:
+            case value_t::binary:
+            {
+                if (JSON_HEDLEY_UNLIKELY(!pos.m_it.primitive_iterator.is_begin()))
+                {
+                    JSON_THROW(invalid_iterator::create(205, "iterator out of range", this));
+                }
+
+                if (is_string())
+                {
+                    AllocatorType<string_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_value.string);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_value.string, 1);
+                    m_value.string = nullptr;
+                }
+                else if (is_binary())
+                {
+                    AllocatorType<binary_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_value.binary);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_value.binary, 1);
+                    m_value.binary = nullptr;
+                }
+
+                m_type = value_t::null;
+                assert_invariant();
+                break;
+            }
+
+            case value_t::object:
+            {
+                result.m_it.object_iterator = m_value.object->erase(pos.m_it.object_iterator);
+                break;
+            }
+
+            case value_t::array:
+            {
+                result.m_it.array_iterator = m_value.array->erase(pos.m_it.array_iterator);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+
+        return result;
+    }
+
+    /// @brief remove elements given an iterator range
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    template < class IteratorType, detail::enable_if_t <
+                   std::is_same<IteratorType, typename basic_json_t::iterator>::value ||
+                   std::is_same<IteratorType, typename basic_json_t::const_iterator>::value, int > = 0 >
+    IteratorType erase(IteratorType first, IteratorType last)
+    {
+        // make sure iterator fits the current value
+        if (JSON_HEDLEY_UNLIKELY(this != first.m_object || this != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(203, "iterators do not fit current value", this));
+        }
+
+        IteratorType result = end();
+
+        switch (m_type)
+        {
+            case value_t::boolean:
+            case value_t::number_float:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::string:
+            case value_t::binary:
+            {
+                if (JSON_HEDLEY_LIKELY(!first.m_it.primitive_iterator.is_begin()
+                                       || !last.m_it.primitive_iterator.is_end()))
+                {
+                    JSON_THROW(invalid_iterator::create(204, "iterators out of range", this));
+                }
+
+                if (is_string())
+                {
+                    AllocatorType<string_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_value.string);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_value.string, 1);
+                    m_value.string = nullptr;
+                }
+                else if (is_binary())
+                {
+                    AllocatorType<binary_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_value.binary);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_value.binary, 1);
+                    m_value.binary = nullptr;
+                }
+
+                m_type = value_t::null;
+                assert_invariant();
+                break;
+            }
+
+            case value_t::object:
+            {
+                result.m_it.object_iterator = m_value.object->erase(first.m_it.object_iterator,
+                                              last.m_it.object_iterator);
+                break;
+            }
+
+            case value_t::array:
+            {
+                result.m_it.array_iterator = m_value.array->erase(first.m_it.array_iterator,
+                                             last.m_it.array_iterator);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+
+        return result;
+    }
+
+  private:
+    template < typename KeyType, detail::enable_if_t <
+                   detail::has_erase_with_key_type<basic_json_t, KeyType>::value, int > = 0 >
+    size_type erase_internal(KeyType && key)
+    {
+        // this erase only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+
+        return m_value.object->erase(std::forward<KeyType>(key));
+    }
+
+    template < typename KeyType, detail::enable_if_t <
+                   !detail::has_erase_with_key_type<basic_json_t, KeyType>::value, int > = 0 >
+    size_type erase_internal(KeyType && key)
+    {
+        // this erase only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+
+        const auto it = m_value.object->find(std::forward<KeyType>(key));
+        if (it != m_value.object->end())
+        {
+            m_value.object->erase(it);
+            return 1;
+        }
+        return 0;
+    }
+
+  public:
+
+    /// @brief remove element from a JSON object given a key
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    size_type erase(const typename object_t::key_type& key)
+    {
+        // the indirection via erase_internal() is added to avoid making this
+        // function a template and thus de-rank it during overload resolution
+        return erase_internal(key);
+    }
+
+    /// @brief remove element from a JSON object given a key
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    size_type erase(KeyType && key)
+    {
+        return erase_internal(std::forward<KeyType>(key));
+    }
+
+    /// @brief remove element from a JSON array given an index
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    void erase(const size_type idx)
+    {
+        // this erase only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            if (JSON_HEDLEY_UNLIKELY(idx >= size()))
+            {
+                JSON_THROW(out_of_range::create(401, detail::concat("array index ", std::to_string(idx), " is out of range"), this));
+            }
+
+            m_value.array->erase(m_value.array->begin() + static_cast<difference_type>(idx));
+        }
+        else
+        {
+            JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+    }
+
+    /// @}
+
+
+    ////////////
+    // lookup //
+    ////////////
+
+    /// @name lookup
+    /// @{
+
+    /// @brief find an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/find/
+    iterator find(const typename object_t::key_type& key)
+    {
+        auto result = end();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_value.object->find(key);
+        }
+
+        return result;
+    }
+
+    /// @brief find an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/find/
+    const_iterator find(const typename object_t::key_type& key) const
+    {
+        auto result = cend();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_value.object->find(key);
+        }
+
+        return result;
+    }
+
+    /// @brief find an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/find/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    iterator find(KeyType && key)
+    {
+        auto result = end();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_value.object->find(std::forward<KeyType>(key));
+        }
+
+        return result;
+    }
+
+    /// @brief find an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/find/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    const_iterator find(KeyType && key) const
+    {
+        auto result = cend();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_value.object->find(std::forward<KeyType>(key));
+        }
+
+        return result;
+    }
+
+    /// @brief returns the number of occurrences of a key in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/count/
+    size_type count(const typename object_t::key_type& key) const
+    {
+        // return 0 for all nonobject types
+        return is_object() ? m_value.object->count(key) : 0;
+    }
+
+    /// @brief returns the number of occurrences of a key in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/count/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    size_type count(KeyType && key) const
+    {
+        // return 0 for all nonobject types
+        return is_object() ? m_value.object->count(std::forward<KeyType>(key)) : 0;
+    }
+
+    /// @brief check the existence of an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/contains/
+    bool contains(const typename object_t::key_type& key) const
+    {
+        return is_object() && m_value.object->find(key) != m_value.object->end();
+    }
+
+    /// @brief check the existence of an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/contains/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    bool contains(KeyType && key) const
+    {
+        return is_object() && m_value.object->find(std::forward<KeyType>(key)) != m_value.object->end();
+    }
+
+    /// @brief check the existence of an element in a JSON object given a JSON pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/contains/
+    bool contains(const json_pointer& ptr) const
+    {
+        return ptr.contains(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    bool contains(const typename ::nlohmann::json_pointer<BasicJsonType>& ptr) const
+    {
+        return ptr.contains(this);
+    }
+
+    /// @}
+
+
+    ///////////////
+    // iterators //
+    ///////////////
+
+    /// @name iterators
+    /// @{
+
+    /// @brief returns an iterator to the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/begin/
+    iterator begin() noexcept
+    {
+        iterator result(this);
+        result.set_begin();
+        return result;
+    }
+
+    /// @brief returns an iterator to the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/begin/
+    const_iterator begin() const noexcept
+    {
+        return cbegin();
+    }
+
+    /// @brief returns a const iterator to the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/cbegin/
+    const_iterator cbegin() const noexcept
+    {
+        const_iterator result(this);
+        result.set_begin();
+        return result;
+    }
+
+    /// @brief returns an iterator to one past the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/end/
+    iterator end() noexcept
+    {
+        iterator result(this);
+        result.set_end();
+        return result;
+    }
+
+    /// @brief returns an iterator to one past the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/end/
+    const_iterator end() const noexcept
+    {
+        return cend();
+    }
+
+    /// @brief returns an iterator to one past the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/cend/
+    const_iterator cend() const noexcept
+    {
+        const_iterator result(this);
+        result.set_end();
+        return result;
+    }
+
+    /// @brief returns an iterator to the reverse-beginning
+    /// @sa https://json.nlohmann.me/api/basic_json/rbegin/
+    reverse_iterator rbegin() noexcept
+    {
+        return reverse_iterator(end());
+    }
+
+    /// @brief returns an iterator to the reverse-beginning
+    /// @sa https://json.nlohmann.me/api/basic_json/rbegin/
+    const_reverse_iterator rbegin() const noexcept
+    {
+        return crbegin();
+    }
+
+    /// @brief returns an iterator to the reverse-end
+    /// @sa https://json.nlohmann.me/api/basic_json/rend/
+    reverse_iterator rend() noexcept
+    {
+        return reverse_iterator(begin());
+    }
+
+    /// @brief returns an iterator to the reverse-end
+    /// @sa https://json.nlohmann.me/api/basic_json/rend/
+    const_reverse_iterator rend() const noexcept
+    {
+        return crend();
+    }
+
+    /// @brief returns a const reverse iterator to the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/crbegin/
+    const_reverse_iterator crbegin() const noexcept
+    {
+        return const_reverse_iterator(cend());
+    }
+
+    /// @brief returns a const reverse iterator to one before the first
+    /// @sa https://json.nlohmann.me/api/basic_json/crend/
+    const_reverse_iterator crend() const noexcept
+    {
+        return const_reverse_iterator(cbegin());
+    }
+
+  public:
+    /// @brief wrapper to access iterator member functions in range-based for
+    /// @sa https://json.nlohmann.me/api/basic_json/items/
+    /// @deprecated This function is deprecated since 3.1.0 and will be removed in
+    ///             version 4.0.0 of the library. Please use @ref items() instead;
+    ///             that is, replace `json::iterator_wrapper(j)` with `j.items()`.
+    JSON_HEDLEY_DEPRECATED_FOR(3.1.0, items())
+    static iteration_proxy<iterator> iterator_wrapper(reference ref) noexcept
+    {
+        return ref.items();
+    }
+
+    /// @brief wrapper to access iterator member functions in range-based for
+    /// @sa https://json.nlohmann.me/api/basic_json/items/
+    /// @deprecated This function is deprecated since 3.1.0 and will be removed in
+    ///         version 4.0.0 of the library. Please use @ref items() instead;
+    ///         that is, replace `json::iterator_wrapper(j)` with `j.items()`.
+    JSON_HEDLEY_DEPRECATED_FOR(3.1.0, items())
+    static iteration_proxy<const_iterator> iterator_wrapper(const_reference ref) noexcept
+    {
+        return ref.items();
+    }
+
+    /// @brief helper to access iterator member functions in range-based for
+    /// @sa https://json.nlohmann.me/api/basic_json/items/
+    iteration_proxy<iterator> items() noexcept
+    {
+        return iteration_proxy<iterator>(*this);
+    }
+
+    /// @brief helper to access iterator member functions in range-based for
+    /// @sa https://json.nlohmann.me/api/basic_json/items/
+    iteration_proxy<const_iterator> items() const noexcept
+    {
+        return iteration_proxy<const_iterator>(*this);
+    }
+
+    /// @}
+
+
+    //////////////
+    // capacity //
+    //////////////
+
+    /// @name capacity
+    /// @{
+
+    /// @brief checks whether the container is empty.
+    /// @sa https://json.nlohmann.me/api/basic_json/empty/
+    bool empty() const noexcept
+    {
+        switch (m_type)
+        {
+            case value_t::null:
+            {
+                // null values are empty
+                return true;
+            }
+
+            case value_t::array:
+            {
+                // delegate call to array_t::empty()
+                return m_value.array->empty();
+            }
+
+            case value_t::object:
+            {
+                // delegate call to object_t::empty()
+                return m_value.object->empty();
+            }
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                // all other types are nonempty
+                return false;
+            }
+        }
+    }
+
+    /// @brief returns the number of elements
+    /// @sa https://json.nlohmann.me/api/basic_json/size/
+    size_type size() const noexcept
+    {
+        switch (m_type)
+        {
+            case value_t::null:
+            {
+                // null values are empty
+                return 0;
+            }
+
+            case value_t::array:
+            {
+                // delegate call to array_t::size()
+                return m_value.array->size();
+            }
+
+            case value_t::object:
+            {
+                // delegate call to object_t::size()
+                return m_value.object->size();
+            }
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                // all other types have size 1
+                return 1;
+            }
+        }
+    }
+
+    /// @brief returns the maximum possible number of elements
+    /// @sa https://json.nlohmann.me/api/basic_json/max_size/
+    size_type max_size() const noexcept
+    {
+        switch (m_type)
+        {
+            case value_t::array:
+            {
+                // delegate call to array_t::max_size()
+                return m_value.array->max_size();
+            }
+
+            case value_t::object:
+            {
+                // delegate call to object_t::max_size()
+                return m_value.object->max_size();
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                // all other types have max_size() == size()
+                return size();
+            }
+        }
+    }
+
+    /// @}
+
+
+    ///////////////
+    // modifiers //
+    ///////////////
+
+    /// @name modifiers
+    /// @{
+
+    /// @brief clears the contents
+    /// @sa https://json.nlohmann.me/api/basic_json/clear/
+    void clear() noexcept
+    {
+        switch (m_type)
+        {
+            case value_t::number_integer:
+            {
+                m_value.number_integer = 0;
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                m_value.number_unsigned = 0;
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                m_value.number_float = 0.0;
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                m_value.boolean = false;
+                break;
+            }
+
+            case value_t::string:
+            {
+                m_value.string->clear();
+                break;
+            }
+
+            case value_t::binary:
+            {
+                m_value.binary->clear();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_value.array->clear();
+                break;
+            }
+
+            case value_t::object:
+            {
+                m_value.object->clear();
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                break;
+        }
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/push_back/
+    void push_back(basic_json&& val)
+    {
+        // push_back only works for null objects or arrays
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_array())))
+        {
+            JSON_THROW(type_error::create(308, detail::concat("cannot use push_back() with ", type_name()), this));
+        }
+
+        // transform null object into an array
+        if (is_null())
+        {
+            m_type = value_t::array;
+            m_value = value_t::array;
+            assert_invariant();
+        }
+
+        // add element to array (move semantics)
+        const auto old_capacity = m_value.array->capacity();
+        m_value.array->push_back(std::move(val));
+        set_parent(m_value.array->back(), old_capacity);
+        // if val is moved from, basic_json move constructor marks it null, so we do not call the destructor
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/operator+=/
+    reference operator+=(basic_json&& val)
+    {
+        push_back(std::move(val));
+        return *this;
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/push_back/
+    void push_back(const basic_json& val)
+    {
+        // push_back only works for null objects or arrays
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_array())))
+        {
+            JSON_THROW(type_error::create(308, detail::concat("cannot use push_back() with ", type_name()), this));
+        }
+
+        // transform null object into an array
+        if (is_null())
+        {
+            m_type = value_t::array;
+            m_value = value_t::array;
+            assert_invariant();
+        }
+
+        // add element to array
+        const auto old_capacity = m_value.array->capacity();
+        m_value.array->push_back(val);
+        set_parent(m_value.array->back(), old_capacity);
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/operator+=/
+    reference operator+=(const basic_json& val)
+    {
+        push_back(val);
+        return *this;
+    }
+
+    /// @brief add an object to an object
+    /// @sa https://json.nlohmann.me/api/basic_json/push_back/
+    void push_back(const typename object_t::value_type& val)
+    {
+        // push_back only works for null objects or objects
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_object())))
+        {
+            JSON_THROW(type_error::create(308, detail::concat("cannot use push_back() with ", type_name()), this));
+        }
+
+        // transform null object into an object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value = value_t::object;
+            assert_invariant();
+        }
+
+        // add element to object
+        auto res = m_value.object->insert(val);
+        set_parent(res.first->second);
+    }
+
+    /// @brief add an object to an object
+    /// @sa https://json.nlohmann.me/api/basic_json/operator+=/
+    reference operator+=(const typename object_t::value_type& val)
+    {
+        push_back(val);
+        return *this;
+    }
+
+    /// @brief add an object to an object
+    /// @sa https://json.nlohmann.me/api/basic_json/push_back/
+    void push_back(initializer_list_t init)
+    {
+        if (is_object() && init.size() == 2 && (*init.begin())->is_string())
+        {
+            basic_json&& key = init.begin()->moved_or_copied();
+            push_back(typename object_t::value_type(
+                          std::move(key.get_ref<string_t&>()), (init.begin() + 1)->moved_or_copied()));
+        }
+        else
+        {
+            push_back(basic_json(init));
+        }
+    }
+
+    /// @brief add an object to an object
+    /// @sa https://json.nlohmann.me/api/basic_json/operator+=/
+    reference operator+=(initializer_list_t init)
+    {
+        push_back(init);
+        return *this;
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/emplace_back/
+    template<class... Args>
+    reference emplace_back(Args&& ... args)
+    {
+        // emplace_back only works for null objects or arrays
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_array())))
+        {
+            JSON_THROW(type_error::create(311, detail::concat("cannot use emplace_back() with ", type_name()), this));
+        }
+
+        // transform null object into an array
+        if (is_null())
+        {
+            m_type = value_t::array;
+            m_value = value_t::array;
+            assert_invariant();
+        }
+
+        // add element to array (perfect forwarding)
+        const auto old_capacity = m_value.array->capacity();
+        m_value.array->emplace_back(std::forward<Args>(args)...);
+        return set_parent(m_value.array->back(), old_capacity);
+    }
+
+    /// @brief add an object to an object if key does not exist
+    /// @sa https://json.nlohmann.me/api/basic_json/emplace/
+    template<class... Args>
+    std::pair<iterator, bool> emplace(Args&& ... args)
+    {
+        // emplace only works for null objects or arrays
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_object())))
+        {
+            JSON_THROW(type_error::create(311, detail::concat("cannot use emplace() with ", type_name()), this));
+        }
+
+        // transform null object into an object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value = value_t::object;
+            assert_invariant();
+        }
+
+        // add element to array (perfect forwarding)
+        auto res = m_value.object->emplace(std::forward<Args>(args)...);
+        set_parent(res.first->second);
+
+        // create result iterator and set iterator to the result of emplace
+        auto it = begin();
+        it.m_it.object_iterator = res.first;
+
+        // return pair of iterator and boolean
+        return {it, res.second};
+    }
+
+    /// Helper for insertion of an iterator
+    /// @note: This uses std::distance to support GCC 4.8,
+    ///        see https://github.com/nlohmann/json/pull/1257
+    template<typename... Args>
+    iterator insert_iterator(const_iterator pos, Args&& ... args)
+    {
+        iterator result(this);
+        JSON_ASSERT(m_value.array != nullptr);
+
+        auto insert_pos = std::distance(m_value.array->begin(), pos.m_it.array_iterator);
+        m_value.array->insert(pos.m_it.array_iterator, std::forward<Args>(args)...);
+        result.m_it.array_iterator = m_value.array->begin() + insert_pos;
+
+        // This could have been written as:
+        // result.m_it.array_iterator = m_value.array->insert(pos.m_it.array_iterator, cnt, val);
+        // but the return value of insert is missing in GCC 4.8, so it is written this way instead.
+
+        set_parents();
+        return result;
+    }
+
+    /// @brief inserts element into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, const basic_json& val)
+    {
+        // insert only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            // check if iterator pos fits to this JSON value
+            if (JSON_HEDLEY_UNLIKELY(pos.m_object != this))
+            {
+                JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+            }
+
+            // insert to array and return iterator
+            return insert_iterator(pos, val);
+        }
+
+        JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+    }
+
+    /// @brief inserts element into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, basic_json&& val)
+    {
+        return insert(pos, val);
+    }
+
+    /// @brief inserts copies of element into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, size_type cnt, const basic_json& val)
+    {
+        // insert only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            // check if iterator pos fits to this JSON value
+            if (JSON_HEDLEY_UNLIKELY(pos.m_object != this))
+            {
+                JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+            }
+
+            // insert to array and return iterator
+            return insert_iterator(pos, cnt, val);
+        }
+
+        JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+    }
+
+    /// @brief inserts range of elements into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, const_iterator first, const_iterator last)
+    {
+        // insert only works for arrays
+        if (JSON_HEDLEY_UNLIKELY(!is_array()))
+        {
+            JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+        }
+
+        // check if iterator pos fits to this JSON value
+        if (JSON_HEDLEY_UNLIKELY(pos.m_object != this))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+        }
+
+        // check if range iterators belong to the same JSON object
+        if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(210, "iterators do not fit", this));
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(first.m_object == this))
+        {
+            JSON_THROW(invalid_iterator::create(211, "passed iterators may not belong to container", this));
+        }
+
+        // insert to array and return iterator
+        return insert_iterator(pos, first.m_it.array_iterator, last.m_it.array_iterator);
+    }
+
+    /// @brief inserts elements from initializer list into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, initializer_list_t ilist)
+    {
+        // insert only works for arrays
+        if (JSON_HEDLEY_UNLIKELY(!is_array()))
+        {
+            JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+        }
+
+        // check if iterator pos fits to this JSON value
+        if (JSON_HEDLEY_UNLIKELY(pos.m_object != this))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+        }
+
+        // insert to array and return iterator
+        return insert_iterator(pos, ilist.begin(), ilist.end());
+    }
+
+    /// @brief inserts range of elements into object
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    void insert(const_iterator first, const_iterator last)
+    {
+        // insert only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+        }
+
+        // check if range iterators belong to the same JSON object
+        if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(210, "iterators do not fit", this));
+        }
+
+        // passed iterators must belong to objects
+        if (JSON_HEDLEY_UNLIKELY(!first.m_object->is_object()))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterators first and last must point to objects", this));
+        }
+
+        m_value.object->insert(first.m_it.object_iterator, last.m_it.object_iterator);
+    }
+
+    /// @brief updates a JSON object from another object, overwriting existing keys
+    /// @sa https://json.nlohmann.me/api/basic_json/update/
+    void update(const_reference j, bool merge_objects = false)
+    {
+        update(j.begin(), j.end(), merge_objects);
+    }
+
+    /// @brief updates a JSON object from another object, overwriting existing keys
+    /// @sa https://json.nlohmann.me/api/basic_json/update/
+    void update(const_iterator first, const_iterator last, bool merge_objects = false)
+    {
+        // implicitly convert null value to an empty object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value.object = create<object_t>();
+            assert_invariant();
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(312, detail::concat("cannot use update() with ", type_name()), this));
+        }
+
+        // check if range iterators belong to the same JSON object
+        if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(210, "iterators do not fit", this));
+        }
+
+        // passed iterators must belong to objects
+        if (JSON_HEDLEY_UNLIKELY(!first.m_object->is_object()))
+        {
+            JSON_THROW(type_error::create(312, detail::concat("cannot use update() with ", first.m_object->type_name()), first.m_object));
+        }
+
+        for (auto it = first; it != last; ++it)
+        {
+            if (merge_objects && it.value().is_object())
+            {
+                auto it2 = m_value.object->find(it.key());
+                if (it2 != m_value.object->end())
+                {
+                    it2->second.update(it.value(), true);
+                    continue;
+                }
+            }
+            m_value.object->operator[](it.key()) = it.value();
+#if JSON_DIAGNOSTICS
+            m_value.object->operator[](it.key()).m_parent = this;
+#endif
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(reference other) noexcept (
+        std::is_nothrow_move_constructible<value_t>::value&&
+        std::is_nothrow_move_assignable<value_t>::value&&
+        std::is_nothrow_move_constructible<json_value>::value&&
+        std::is_nothrow_move_assignable<json_value>::value
+    )
+    {
+        std::swap(m_type, other.m_type);
+        std::swap(m_value, other.m_value);
+
+        set_parents();
+        other.set_parents();
+        assert_invariant();
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    friend void swap(reference left, reference right) noexcept (
+        std::is_nothrow_move_constructible<value_t>::value&&
+        std::is_nothrow_move_assignable<value_t>::value&&
+        std::is_nothrow_move_constructible<json_value>::value&&
+        std::is_nothrow_move_assignable<json_value>::value
+    )
+    {
+        left.swap(right);
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(array_t& other) // NOLINT(bugprone-exception-escape)
+    {
+        // swap only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            using std::swap;
+            swap(*(m_value.array), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(array_t&) with ", type_name()), this));
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(object_t& other) // NOLINT(bugprone-exception-escape)
+    {
+        // swap only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            using std::swap;
+            swap(*(m_value.object), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(object_t&) with ", type_name()), this));
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(string_t& other) // NOLINT(bugprone-exception-escape)
+    {
+        // swap only works for strings
+        if (JSON_HEDLEY_LIKELY(is_string()))
+        {
+            using std::swap;
+            swap(*(m_value.string), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(string_t&) with ", type_name()), this));
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(binary_t& other) // NOLINT(bugprone-exception-escape)
+    {
+        // swap only works for strings
+        if (JSON_HEDLEY_LIKELY(is_binary()))
+        {
+            using std::swap;
+            swap(*(m_value.binary), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(binary_t&) with ", type_name()), this));
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(typename binary_t::container_type& other) // NOLINT(bugprone-exception-escape)
+    {
+        // swap only works for strings
+        if (JSON_HEDLEY_LIKELY(is_binary()))
+        {
+            using std::swap;
+            swap(*(m_value.binary), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(binary_t::container_type&) with ", type_name()), this));
+        }
+    }
+
+    /// @}
+
+    //////////////////////////////////////////
+    // lexicographical comparison operators //
+    //////////////////////////////////////////
+
+    /// @name lexicographical comparison operators
+    /// @{
+
+    // note parentheses around operands are necessary; see
+    // https://github.com/nlohmann/json/issues/1530
+#define JSON_IMPLEMENT_OPERATOR(op, null_result, unordered_result, default_result)                       \
+    const auto lhs_type = lhs.type();                                                                    \
+    const auto rhs_type = rhs.type();                                                                    \
+    \
+    if (lhs_type == rhs_type) /* NOLINT(readability/braces) */                                           \
+    {                                                                                                    \
+        switch (lhs_type)                                                                                \
+        {                                                                                                \
+            case value_t::array:                                                                         \
+                return (*lhs.m_value.array) op (*rhs.m_value.array);                                     \
+                \
+            case value_t::object:                                                                        \
+                return (*lhs.m_value.object) op (*rhs.m_value.object);                                   \
+                \
+            case value_t::null:                                                                          \
+                return (null_result);                                                                    \
+                \
+            case value_t::string:                                                                        \
+                return (*lhs.m_value.string) op (*rhs.m_value.string);                                   \
+                \
+            case value_t::boolean:                                                                       \
+                return (lhs.m_value.boolean) op (rhs.m_value.boolean);                                   \
+                \
+            case value_t::number_integer:                                                                \
+                return (lhs.m_value.number_integer) op (rhs.m_value.number_integer);                     \
+                \
+            case value_t::number_unsigned:                                                               \
+                return (lhs.m_value.number_unsigned) op (rhs.m_value.number_unsigned);                   \
+                \
+            case value_t::number_float:                                                                  \
+                return (lhs.m_value.number_float) op (rhs.m_value.number_float);                         \
+                \
+            case value_t::binary:                                                                        \
+                return (*lhs.m_value.binary) op (*rhs.m_value.binary);                                   \
+                \
+            case value_t::discarded:                                                                     \
+            default:                                                                                     \
+                return (unordered_result);                                                               \
+        }                                                                                                \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_integer && rhs_type == value_t::number_float)                   \
+    {                                                                                                    \
+        return static_cast<number_float_t>(lhs.m_value.number_integer) op rhs.m_value.number_float;      \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_float && rhs_type == value_t::number_integer)                   \
+    {                                                                                                    \
+        return lhs.m_value.number_float op static_cast<number_float_t>(rhs.m_value.number_integer);      \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_unsigned && rhs_type == value_t::number_float)                  \
+    {                                                                                                    \
+        return static_cast<number_float_t>(lhs.m_value.number_unsigned) op rhs.m_value.number_float;     \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_float && rhs_type == value_t::number_unsigned)                  \
+    {                                                                                                    \
+        return lhs.m_value.number_float op static_cast<number_float_t>(rhs.m_value.number_unsigned);     \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_unsigned && rhs_type == value_t::number_integer)                \
+    {                                                                                                    \
+        return static_cast<number_integer_t>(lhs.m_value.number_unsigned) op rhs.m_value.number_integer; \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_integer && rhs_type == value_t::number_unsigned)                \
+    {                                                                                                    \
+        return lhs.m_value.number_integer op static_cast<number_integer_t>(rhs.m_value.number_unsigned); \
+    }                                                                                                    \
+    else if(compares_unordered(lhs, rhs))\
+    {\
+        return (unordered_result);\
+    }\
+    \
+    return (default_result);
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    // returns true if:
+    // - any operand is NaN and the other operand is of number type
+    // - any operand is discarded
+    // in legacy mode, discarded values are considered ordered if
+    // an operation is computed as an odd number of inverses of others
+    static bool compares_unordered(const_reference lhs, const_reference rhs, bool inverse = false) noexcept
+    {
+        if ((lhs.is_number_float() && std::isnan(lhs.m_value.number_float) && rhs.is_number())
+                || (rhs.is_number_float() && std::isnan(rhs.m_value.number_float) && lhs.is_number()))
+        {
+            return true;
+        }
+#if JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+        return (lhs.is_discarded() || rhs.is_discarded()) && !inverse;
+#else
+        static_cast<void>(inverse);
+        return lhs.is_discarded() || rhs.is_discarded();
+#endif
+    }
+
+  private:
+    bool compares_unordered(const_reference rhs, bool inverse = false) const noexcept
+    {
+        return compares_unordered(*this, rhs, inverse);
+    }
+
+  public:
+#if JSON_HAS_THREE_WAY_COMPARISON
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    bool operator==(const_reference rhs) const noexcept
+    {
+#ifdef __GNUC__
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif
+        const_reference lhs = *this;
+        JSON_IMPLEMENT_OPERATOR( ==, true, false, false)
+#ifdef __GNUC__
+#pragma GCC diagnostic pop
+#endif
+    }
+
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    template<typename ScalarType>
+    requires std::is_scalar_v<ScalarType>
+    bool operator==(ScalarType rhs) const noexcept
+    {
+        return *this == basic_json(rhs);
+    }
+
+    /// @brief comparison: not equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ne/
+    bool operator!=(const_reference rhs) const noexcept
+    {
+        if (compares_unordered(rhs, true))
+        {
+            return false;
+        }
+        return !operator==(rhs);
+    }
+
+    /// @brief comparison: 3-way
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_spaceship/
+    std::partial_ordering operator<=>(const_reference rhs) const noexcept // *NOPAD*
+    {
+        const_reference lhs = *this;
+        // default_result is used if we cannot compare values. In that case,
+        // we compare types.
+        JSON_IMPLEMENT_OPERATOR(<=>, // *NOPAD*
+                                std::partial_ordering::equivalent,
+                                std::partial_ordering::unordered,
+                                lhs_type <=> rhs_type) // *NOPAD*
+    }
+
+    /// @brief comparison: 3-way
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_spaceship/
+    template<typename ScalarType>
+    requires std::is_scalar_v<ScalarType>
+    std::partial_ordering operator<=>(ScalarType rhs) const noexcept // *NOPAD*
+    {
+        return *this <=> basic_json(rhs); // *NOPAD*
+    }
+
+#if JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+    // all operators that are computed as an odd number of inverses of others
+    // need to be overloaded to emulate the legacy comparison behavior
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, undef JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON)
+    bool operator<=(const_reference rhs) const noexcept
+    {
+        if (compares_unordered(rhs, true))
+        {
+            return false;
+        }
+        return !(rhs < *this);
+    }
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    template<typename ScalarType>
+    requires std::is_scalar_v<ScalarType>
+    bool operator<=(ScalarType rhs) const noexcept
+    {
+        return *this <= basic_json(rhs);
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, undef JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON)
+    bool operator>=(const_reference rhs) const noexcept
+    {
+        if (compares_unordered(rhs, true))
+        {
+            return false;
+        }
+        return !(*this < rhs);
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    template<typename ScalarType>
+    requires std::is_scalar_v<ScalarType>
+    bool operator>=(ScalarType rhs) const noexcept
+    {
+        return *this >= basic_json(rhs);
+    }
+#endif
+#else
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    friend bool operator==(const_reference lhs, const_reference rhs) noexcept
+    {
+#ifdef __GNUC__
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif
+        JSON_IMPLEMENT_OPERATOR( ==, true, false, false)
+#ifdef __GNUC__
+#pragma GCC diagnostic pop
+#endif
+    }
+
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator==(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs == basic_json(rhs);
+    }
+
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator==(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) == rhs;
+    }
+
+    /// @brief comparison: not equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ne/
+    friend bool operator!=(const_reference lhs, const_reference rhs) noexcept
+    {
+        if (compares_unordered(lhs, rhs, true))
+        {
+            return false;
+        }
+        return !(lhs == rhs);
+    }
+
+    /// @brief comparison: not equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ne/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator!=(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs != basic_json(rhs);
+    }
+
+    /// @brief comparison: not equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ne/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator!=(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) != rhs;
+    }
+
+    /// @brief comparison: less than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_lt/
+    friend bool operator<(const_reference lhs, const_reference rhs) noexcept
+    {
+        // default_result is used if we cannot compare values. In that case,
+        // we compare types. Note we have to call the operator explicitly,
+        // because MSVC has problems otherwise.
+        JSON_IMPLEMENT_OPERATOR( <, false, false, operator<(lhs_type, rhs_type))
+    }
+
+    /// @brief comparison: less than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_lt/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs < basic_json(rhs);
+    }
+
+    /// @brief comparison: less than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_lt/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) < rhs;
+    }
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    friend bool operator<=(const_reference lhs, const_reference rhs) noexcept
+    {
+        if (compares_unordered(lhs, rhs, true))
+        {
+            return false;
+        }
+        return !(rhs < lhs);
+    }
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<=(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs <= basic_json(rhs);
+    }
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<=(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) <= rhs;
+    }
+
+    /// @brief comparison: greater than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gt/
+    friend bool operator>(const_reference lhs, const_reference rhs) noexcept
+    {
+        // double inverse
+        if (compares_unordered(lhs, rhs))
+        {
+            return false;
+        }
+        return !(lhs <= rhs);
+    }
+
+    /// @brief comparison: greater than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gt/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs > basic_json(rhs);
+    }
+
+    /// @brief comparison: greater than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gt/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) > rhs;
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    friend bool operator>=(const_reference lhs, const_reference rhs) noexcept
+    {
+        if (compares_unordered(lhs, rhs, true))
+        {
+            return false;
+        }
+        return !(lhs < rhs);
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>=(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs >= basic_json(rhs);
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>=(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) >= rhs;
+    }
+#endif
+
+#undef JSON_IMPLEMENT_OPERATOR
+
+    /// @}
+
+    ///////////////////
+    // serialization //
+    ///////////////////
+
+    /// @name serialization
+    /// @{
+#ifndef JSON_NO_IO
+    /// @brief serialize to stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ltlt/
+    friend std::ostream& operator<<(std::ostream& o, const basic_json& j)
+    {
+        // read width member and use it as indentation parameter if nonzero
+        const bool pretty_print = o.width() > 0;
+        const auto indentation = pretty_print ? o.width() : 0;
+
+        // reset width to 0 for subsequent calls to this stream
+        o.width(0);
+
+        // do the actual serialization
+        serializer s(detail::output_adapter<char>(o), o.fill());
+        s.dump(j, pretty_print, false, static_cast<unsigned int>(indentation));
+        return o;
+    }
+
+    /// @brief serialize to stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ltlt/
+    /// @deprecated This function is deprecated since 3.0.0 and will be removed in
+    ///             version 4.0.0 of the library. Please use
+    ///             operator<<(std::ostream&, const basic_json&) instead; that is,
+    ///             replace calls like `j >> o;` with `o << j;`.
+    JSON_HEDLEY_DEPRECATED_FOR(3.0.0, operator<<(std::ostream&, const basic_json&))
+    friend std::ostream& operator>>(const basic_json& j, std::ostream& o)
+    {
+        return o << j;
+    }
+#endif  // JSON_NO_IO
+    /// @}
+
+
+    /////////////////////
+    // deserialization //
+    /////////////////////
+
+    /// @name deserialization
+    /// @{
+
+    /// @brief deserialize from a compatible input
+    /// @sa https://json.nlohmann.me/api/basic_json/parse/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json parse(InputType&& i,
+                            const parser_callback_t cb = nullptr,
+                            const bool allow_exceptions = true,
+                            const bool ignore_comments = false)
+    {
+        basic_json result;
+        parser(detail::input_adapter(std::forward<InputType>(i)), cb, allow_exceptions, ignore_comments).parse(true, result);
+        return result;
+    }
+
+    /// @brief deserialize from a pair of character iterators
+    /// @sa https://json.nlohmann.me/api/basic_json/parse/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json parse(IteratorType first,
+                            IteratorType last,
+                            const parser_callback_t cb = nullptr,
+                            const bool allow_exceptions = true,
+                            const bool ignore_comments = false)
+    {
+        basic_json result;
+        parser(detail::input_adapter(std::move(first), std::move(last)), cb, allow_exceptions, ignore_comments).parse(true, result);
+        return result;
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, parse(ptr, ptr + len))
+    static basic_json parse(detail::span_input_adapter&& i,
+                            const parser_callback_t cb = nullptr,
+                            const bool allow_exceptions = true,
+                            const bool ignore_comments = false)
+    {
+        basic_json result;
+        parser(i.get(), cb, allow_exceptions, ignore_comments).parse(true, result);
+        return result;
+    }
+
+    /// @brief check if the input is valid JSON
+    /// @sa https://json.nlohmann.me/api/basic_json/accept/
+    template<typename InputType>
+    static bool accept(InputType&& i,
+                       const bool ignore_comments = false)
+    {
+        return parser(detail::input_adapter(std::forward<InputType>(i)), nullptr, false, ignore_comments).accept(true);
+    }
+
+    /// @brief check if the input is valid JSON
+    /// @sa https://json.nlohmann.me/api/basic_json/accept/
+    template<typename IteratorType>
+    static bool accept(IteratorType first, IteratorType last,
+                       const bool ignore_comments = false)
+    {
+        return parser(detail::input_adapter(std::move(first), std::move(last)), nullptr, false, ignore_comments).accept(true);
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, accept(ptr, ptr + len))
+    static bool accept(detail::span_input_adapter&& i,
+                       const bool ignore_comments = false)
+    {
+        return parser(i.get(), nullptr, false, ignore_comments).accept(true);
+    }
+
+    /// @brief generate SAX events
+    /// @sa https://json.nlohmann.me/api/basic_json/sax_parse/
+    template <typename InputType, typename SAX>
+    JSON_HEDLEY_NON_NULL(2)
+    static bool sax_parse(InputType&& i, SAX* sax,
+                          input_format_t format = input_format_t::json,
+                          const bool strict = true,
+                          const bool ignore_comments = false)
+    {
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        return format == input_format_t::json
+               ? parser(std::move(ia), nullptr, true, ignore_comments).sax_parse(sax, strict)
+               : detail::binary_reader<basic_json, decltype(ia), SAX>(std::move(ia), format).sax_parse(format, sax, strict);
+    }
+
+    /// @brief generate SAX events
+    /// @sa https://json.nlohmann.me/api/basic_json/sax_parse/
+    template<class IteratorType, class SAX>
+    JSON_HEDLEY_NON_NULL(3)
+    static bool sax_parse(IteratorType first, IteratorType last, SAX* sax,
+                          input_format_t format = input_format_t::json,
+                          const bool strict = true,
+                          const bool ignore_comments = false)
+    {
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        return format == input_format_t::json
+               ? parser(std::move(ia), nullptr, true, ignore_comments).sax_parse(sax, strict)
+               : detail::binary_reader<basic_json, decltype(ia), SAX>(std::move(ia), format).sax_parse(format, sax, strict);
+    }
+
+    /// @brief generate SAX events
+    /// @sa https://json.nlohmann.me/api/basic_json/sax_parse/
+    /// @deprecated This function is deprecated since 3.8.0 and will be removed in
+    ///             version 4.0.0 of the library. Please use
+    ///             sax_parse(ptr, ptr + len) instead.
+    template <typename SAX>
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, sax_parse(ptr, ptr + len, ...))
+    JSON_HEDLEY_NON_NULL(2)
+    static bool sax_parse(detail::span_input_adapter&& i, SAX* sax,
+                          input_format_t format = input_format_t::json,
+                          const bool strict = true,
+                          const bool ignore_comments = false)
+    {
+        auto ia = i.get();
+        return format == input_format_t::json
+               // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+               ? parser(std::move(ia), nullptr, true, ignore_comments).sax_parse(sax, strict)
+               // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+               : detail::binary_reader<basic_json, decltype(ia), SAX>(std::move(ia), format).sax_parse(format, sax, strict);
+    }
+#ifndef JSON_NO_IO
+    /// @brief deserialize from stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gtgt/
+    /// @deprecated This stream operator is deprecated since 3.0.0 and will be removed in
+    ///             version 4.0.0 of the library. Please use
+    ///             operator>>(std::istream&, basic_json&) instead; that is,
+    ///             replace calls like `j << i;` with `i >> j;`.
+    JSON_HEDLEY_DEPRECATED_FOR(3.0.0, operator>>(std::istream&, basic_json&))
+    friend std::istream& operator<<(basic_json& j, std::istream& i)
+    {
+        return operator>>(i, j);
+    }
+
+    /// @brief deserialize from stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gtgt/
+    friend std::istream& operator>>(std::istream& i, basic_json& j)
+    {
+        parser(detail::input_adapter(i)).parse(false, j);
+        return i;
+    }
+#endif  // JSON_NO_IO
+    /// @}
+
+    ///////////////////////////
+    // convenience functions //
+    ///////////////////////////
+
+    /// @brief return the type as string
+    /// @sa https://json.nlohmann.me/api/basic_json/type_name/
+    JSON_HEDLEY_RETURNS_NON_NULL
+    const char* type_name() const noexcept
+    {
+        switch (m_type)
+        {
+            case value_t::null:
+                return "null";
+            case value_t::object:
+                return "object";
+            case value_t::array:
+                return "array";
+            case value_t::string:
+                return "string";
+            case value_t::boolean:
+                return "boolean";
+            case value_t::binary:
+                return "binary";
+            case value_t::discarded:
+                return "discarded";
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            default:
+                return "number";
+        }
+    }
+
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    //////////////////////
+    // member variables //
+    //////////////////////
+
+    /// the type of the current element
+    value_t m_type = value_t::null;
+
+    /// the value of the current element
+    json_value m_value = {};
+
+#if JSON_DIAGNOSTICS
+    /// a pointer to a parent value (for debugging purposes)
+    basic_json* m_parent = nullptr;
+#endif
+
+    //////////////////////////////////////////
+    // binary serialization/deserialization //
+    //////////////////////////////////////////
+
+    /// @name binary serialization/deserialization support
+    /// @{
+
+  public:
+    /// @brief create a CBOR serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_cbor/
+    static std::vector<std::uint8_t> to_cbor(const basic_json& j)
+    {
+        std::vector<std::uint8_t> result;
+        to_cbor(j, result);
+        return result;
+    }
+
+    /// @brief create a CBOR serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_cbor/
+    static void to_cbor(const basic_json& j, detail::output_adapter<std::uint8_t> o)
+    {
+        binary_writer<std::uint8_t>(o).write_cbor(j);
+    }
+
+    /// @brief create a CBOR serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_cbor/
+    static void to_cbor(const basic_json& j, detail::output_adapter<char> o)
+    {
+        binary_writer<char>(o).write_cbor(j);
+    }
+
+    /// @brief create a MessagePack serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_msgpack/
+    static std::vector<std::uint8_t> to_msgpack(const basic_json& j)
+    {
+        std::vector<std::uint8_t> result;
+        to_msgpack(j, result);
+        return result;
+    }
+
+    /// @brief create a MessagePack serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_msgpack/
+    static void to_msgpack(const basic_json& j, detail::output_adapter<std::uint8_t> o)
+    {
+        binary_writer<std::uint8_t>(o).write_msgpack(j);
+    }
+
+    /// @brief create a MessagePack serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_msgpack/
+    static void to_msgpack(const basic_json& j, detail::output_adapter<char> o)
+    {
+        binary_writer<char>(o).write_msgpack(j);
+    }
+
+    /// @brief create a UBJSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_ubjson/
+    static std::vector<std::uint8_t> to_ubjson(const basic_json& j,
+            const bool use_size = false,
+            const bool use_type = false)
+    {
+        std::vector<std::uint8_t> result;
+        to_ubjson(j, result, use_size, use_type);
+        return result;
+    }
+
+    /// @brief create a UBJSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_ubjson/
+    static void to_ubjson(const basic_json& j, detail::output_adapter<std::uint8_t> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<std::uint8_t>(o).write_ubjson(j, use_size, use_type);
+    }
+
+    /// @brief create a UBJSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_ubjson/
+    static void to_ubjson(const basic_json& j, detail::output_adapter<char> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<char>(o).write_ubjson(j, use_size, use_type);
+    }
+
+    /// @brief create a BJData serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bjdata/
+    static std::vector<std::uint8_t> to_bjdata(const basic_json& j,
+            const bool use_size = false,
+            const bool use_type = false)
+    {
+        std::vector<std::uint8_t> result;
+        to_bjdata(j, result, use_size, use_type);
+        return result;
+    }
+
+    /// @brief create a BJData serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bjdata/
+    static void to_bjdata(const basic_json& j, detail::output_adapter<std::uint8_t> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<std::uint8_t>(o).write_ubjson(j, use_size, use_type, true, true);
+    }
+
+    /// @brief create a BJData serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bjdata/
+    static void to_bjdata(const basic_json& j, detail::output_adapter<char> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<char>(o).write_ubjson(j, use_size, use_type, true, true);
+    }
+
+    /// @brief create a BSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bson/
+    static std::vector<std::uint8_t> to_bson(const basic_json& j)
+    {
+        std::vector<std::uint8_t> result;
+        to_bson(j, result);
+        return result;
+    }
+
+    /// @brief create a BSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bson/
+    static void to_bson(const basic_json& j, detail::output_adapter<std::uint8_t> o)
+    {
+        binary_writer<std::uint8_t>(o).write_bson(j);
+    }
+
+    /// @brief create a BSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bson/
+    static void to_bson(const basic_json& j, detail::output_adapter<char> o)
+    {
+        binary_writer<char>(o).write_bson(j);
+    }
+
+    /// @brief create a JSON value from an input in CBOR format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_cbor/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_cbor(InputType&& i,
+                                const bool strict = true,
+                                const bool allow_exceptions = true,
+                                const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in CBOR format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_cbor/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_cbor(IteratorType first, IteratorType last,
+                                const bool strict = true,
+                                const bool allow_exceptions = true,
+                                const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    template<typename T>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_cbor(ptr, ptr + len))
+    static basic_json from_cbor(const T* ptr, std::size_t len,
+                                const bool strict = true,
+                                const bool allow_exceptions = true,
+                                const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        return from_cbor(ptr, ptr + len, strict, allow_exceptions, tag_handler);
+    }
+
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_cbor(ptr, ptr + len))
+    static basic_json from_cbor(detail::span_input_adapter&& i,
+                                const bool strict = true,
+                                const bool allow_exceptions = true,
+                                const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = i.get();
+        // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in MessagePack format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_msgpack/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_msgpack(InputType&& i,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in MessagePack format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_msgpack/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_msgpack(IteratorType first, IteratorType last,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    template<typename T>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_msgpack(ptr, ptr + len))
+    static basic_json from_msgpack(const T* ptr, std::size_t len,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        return from_msgpack(ptr, ptr + len, strict, allow_exceptions);
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_msgpack(ptr, ptr + len))
+    static basic_json from_msgpack(detail::span_input_adapter&& i,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = i.get();
+        // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in UBJSON format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_ubjson/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_ubjson(InputType&& i,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in UBJSON format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_ubjson/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_ubjson(IteratorType first, IteratorType last,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    template<typename T>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_ubjson(ptr, ptr + len))
+    static basic_json from_ubjson(const T* ptr, std::size_t len,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        return from_ubjson(ptr, ptr + len, strict, allow_exceptions);
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_ubjson(ptr, ptr + len))
+    static basic_json from_ubjson(detail::span_input_adapter&& i,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = i.get();
+        // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+
+    /// @brief create a JSON value from an input in BJData format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_bjdata/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_bjdata(InputType&& i,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bjdata).sax_parse(input_format_t::bjdata, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in BJData format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_bjdata/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_bjdata(IteratorType first, IteratorType last,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bjdata).sax_parse(input_format_t::bjdata, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in BSON format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_bson/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_bson(InputType&& i,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in BSON format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_bson/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_bson(IteratorType first, IteratorType last,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    template<typename T>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_bson(ptr, ptr + len))
+    static basic_json from_bson(const T* ptr, std::size_t len,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        return from_bson(ptr, ptr + len, strict, allow_exceptions);
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_bson(ptr, ptr + len))
+    static basic_json from_bson(detail::span_input_adapter&& i,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = i.get();
+        // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+    /// @}
+
+    //////////////////////////
+    // JSON Pointer support //
+    //////////////////////////
+
+    /// @name JSON Pointer functions
+    /// @{
+
+    /// @brief access specified element via JSON Pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    reference operator[](const json_pointer& ptr)
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    reference operator[](const ::nlohmann::json_pointer<BasicJsonType>& ptr)
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    /// @brief access specified element via JSON Pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    const_reference operator[](const json_pointer& ptr) const
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    const_reference operator[](const ::nlohmann::json_pointer<BasicJsonType>& ptr) const
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    /// @brief access specified element via JSON Pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    reference at(const json_pointer& ptr)
+    {
+        return ptr.get_checked(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    reference at(const ::nlohmann::json_pointer<BasicJsonType>& ptr)
+    {
+        return ptr.get_checked(this);
+    }
+
+    /// @brief access specified element via JSON Pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    const_reference at(const json_pointer& ptr) const
+    {
+        return ptr.get_checked(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    const_reference at(const ::nlohmann::json_pointer<BasicJsonType>& ptr) const
+    {
+        return ptr.get_checked(this);
+    }
+
+    /// @brief return flattened JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/flatten/
+    basic_json flatten() const
+    {
+        basic_json result(value_t::object);
+        json_pointer::flatten("", *this, result);
+        return result;
+    }
+
+    /// @brief unflatten a previously flattened JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/unflatten/
+    basic_json unflatten() const
+    {
+        return json_pointer::unflatten(*this);
+    }
+
+    /// @}
+
+    //////////////////////////
+    // JSON Patch functions //
+    //////////////////////////
+
+    /// @name JSON Patch functions
+    /// @{
+
+    /// @brief applies a JSON patch in-place without copying the object
+    /// @sa https://json.nlohmann.me/api/basic_json/patch/
+    void patch_inplace(const basic_json& json_patch)
+    {
+        basic_json& result = *this;
+        // the valid JSON Patch operations
+        enum class patch_operations {add, remove, replace, move, copy, test, invalid};
+
+        const auto get_op = [](const std::string & op)
+        {
+            if (op == "add")
+            {
+                return patch_operations::add;
+            }
+            if (op == "remove")
+            {
+                return patch_operations::remove;
+            }
+            if (op == "replace")
+            {
+                return patch_operations::replace;
+            }
+            if (op == "move")
+            {
+                return patch_operations::move;
+            }
+            if (op == "copy")
+            {
+                return patch_operations::copy;
+            }
+            if (op == "test")
+            {
+                return patch_operations::test;
+            }
+
+            return patch_operations::invalid;
+        };
+
+        // wrapper for "add" operation; add value at ptr
+        const auto operation_add = [&result](json_pointer & ptr, basic_json val)
+        {
+            // adding to the root of the target document means replacing it
+            if (ptr.empty())
+            {
+                result = val;
+                return;
+            }
+
+            // make sure the top element of the pointer exists
+            json_pointer top_pointer = ptr.top();
+            if (top_pointer != ptr)
+            {
+                result.at(top_pointer);
+            }
+
+            // get reference to parent of JSON pointer ptr
+            const auto last_path = ptr.back();
+            ptr.pop_back();
+            // parent must exist when performing patch add per RFC6902 specs
+            basic_json& parent = result.at(ptr);
+
+            switch (parent.m_type)
+            {
+                case value_t::null:
+                case value_t::object:
+                {
+                    // use operator[] to add value
+                    parent[last_path] = val;
+                    break;
+                }
+
+                case value_t::array:
+                {
+                    if (last_path == "-")
+                    {
+                        // special case: append to back
+                        parent.push_back(val);
+                    }
+                    else
+                    {
+                        const auto idx = json_pointer::template array_index<basic_json_t>(last_path);
+                        if (JSON_HEDLEY_UNLIKELY(idx > parent.size()))
+                        {
+                            // avoid undefined behavior
+                            JSON_THROW(out_of_range::create(401, detail::concat("array index ", std::to_string(idx), " is out of range"), &parent));
+                        }
+
+                        // default case: insert add offset
+                        parent.insert(parent.begin() + static_cast<difference_type>(idx), val);
+                    }
+                    break;
+                }
+
+                // if there exists a parent it cannot be primitive
+                case value_t::string: // LCOV_EXCL_LINE
+                case value_t::boolean: // LCOV_EXCL_LINE
+                case value_t::number_integer: // LCOV_EXCL_LINE
+                case value_t::number_unsigned: // LCOV_EXCL_LINE
+                case value_t::number_float: // LCOV_EXCL_LINE
+                case value_t::binary: // LCOV_EXCL_LINE
+                case value_t::discarded: // LCOV_EXCL_LINE
+                default:            // LCOV_EXCL_LINE
+                    JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+            }
+        };
+
+        // wrapper for "remove" operation; remove value at ptr
+        const auto operation_remove = [this, &result](json_pointer & ptr)
+        {
+            // get reference to parent of JSON pointer ptr
+            const auto last_path = ptr.back();
+            ptr.pop_back();
+            basic_json& parent = result.at(ptr);
+
+            // remove child
+            if (parent.is_object())
+            {
+                // perform range check
+                auto it = parent.find(last_path);
+                if (JSON_HEDLEY_LIKELY(it != parent.end()))
+                {
+                    parent.erase(it);
+                }
+                else
+                {
+                    JSON_THROW(out_of_range::create(403, detail::concat("key '", last_path, "' not found"), this));
+                }
+            }
+            else if (parent.is_array())
+            {
+                // note erase performs range check
+                parent.erase(json_pointer::template array_index<basic_json_t>(last_path));
+            }
+        };
+
+        // type check: top level value must be an array
+        if (JSON_HEDLEY_UNLIKELY(!json_patch.is_array()))
+        {
+            JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects", &json_patch));
+        }
+
+        // iterate and apply the operations
+        for (const auto& val : json_patch)
+        {
+            // wrapper to get a value for an operation
+            const auto get_value = [&val](const std::string & op,
+                                          const std::string & member,
+                                          bool string_type) -> basic_json &
+            {
+                // find value
+                auto it = val.m_value.object->find(member);
+
+                // context-sensitive error message
+                const auto error_msg = (op == "op") ? "operation" : detail::concat("operation '", op, '\'');
+
+                // check if desired value is present
+                if (JSON_HEDLEY_UNLIKELY(it == val.m_value.object->end()))
+                {
+                    // NOLINTNEXTLINE(performance-inefficient-string-concatenation)
+                    JSON_THROW(parse_error::create(105, 0, detail::concat(error_msg, " must have member '", member, "'"), &val));
+                }
+
+                // check if result is of type string
+                if (JSON_HEDLEY_UNLIKELY(string_type && !it->second.is_string()))
+                {
+                    // NOLINTNEXTLINE(performance-inefficient-string-concatenation)
+                    JSON_THROW(parse_error::create(105, 0, detail::concat(error_msg, " must have string member '", member, "'"), &val));
+                }
+
+                // no error: return value
+                return it->second;
+            };
+
+            // type check: every element of the array must be an object
+            if (JSON_HEDLEY_UNLIKELY(!val.is_object()))
+            {
+                JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects", &val));
+            }
+
+            // collect mandatory members
+            const auto op = get_value("op", "op", true).template get<std::string>();
+            const auto path = get_value(op, "path", true).template get<std::string>();
+            json_pointer ptr(path);
+
+            switch (get_op(op))
+            {
+                case patch_operations::add:
+                {
+                    operation_add(ptr, get_value("add", "value", false));
+                    break;
+                }
+
+                case patch_operations::remove:
+                {
+                    operation_remove(ptr);
+                    break;
+                }
+
+                case patch_operations::replace:
+                {
+                    // the "path" location must exist - use at()
+                    result.at(ptr) = get_value("replace", "value", false);
+                    break;
+                }
+
+                case patch_operations::move:
+                {
+                    const auto from_path = get_value("move", "from", true).template get<std::string>();
+                    json_pointer from_ptr(from_path);
+
+                    // the "from" location must exist - use at()
+                    basic_json v = result.at(from_ptr);
+
+                    // The move operation is functionally identical to a
+                    // "remove" operation on the "from" location, followed
+                    // immediately by an "add" operation at the target
+                    // location with the value that was just removed.
+                    operation_remove(from_ptr);
+                    operation_add(ptr, v);
+                    break;
+                }
+
+                case patch_operations::copy:
+                {
+                    const auto from_path = get_value("copy", "from", true).template get<std::string>();
+                    const json_pointer from_ptr(from_path);
+
+                    // the "from" location must exist - use at()
+                    basic_json v = result.at(from_ptr);
+
+                    // The copy is functionally identical to an "add"
+                    // operation at the target location using the value
+                    // specified in the "from" member.
+                    operation_add(ptr, v);
+                    break;
+                }
+
+                case patch_operations::test:
+                {
+                    bool success = false;
+                    JSON_TRY
+                    {
+                        // check if "value" matches the one at "path"
+                        // the "path" location must exist - use at()
+                        success = (result.at(ptr) == get_value("test", "value", false));
+                    }
+                    JSON_INTERNAL_CATCH (out_of_range&)
+                    {
+                        // ignore out of range errors: success remains false
+                    }
+
+                    // throw an exception if test fails
+                    if (JSON_HEDLEY_UNLIKELY(!success))
+                    {
+                        JSON_THROW(other_error::create(501, detail::concat("unsuccessful: ", val.dump()), &val));
+                    }
+
+                    break;
+                }
+
+                case patch_operations::invalid:
+                default:
+                {
+                    // op must be "add", "remove", "replace", "move", "copy", or
+                    // "test"
+                    JSON_THROW(parse_error::create(105, 0, detail::concat("operation value '", op, "' is invalid"), &val));
+                }
+            }
+        }
+    }
+
+    /// @brief applies a JSON patch to a copy of the current object
+    /// @sa https://json.nlohmann.me/api/basic_json/patch/
+    basic_json patch(const basic_json& json_patch) const
+    {
+        basic_json result = *this;
+        result.patch_inplace(json_patch);
+        return result;
+    }
+
+    /// @brief creates a diff as a JSON patch
+    /// @sa https://json.nlohmann.me/api/basic_json/diff/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json diff(const basic_json& source, const basic_json& target,
+                           const std::string& path = "")
+    {
+        // the patch
+        basic_json result(value_t::array);
+
+        // if the values are the same, return empty patch
+        if (source == target)
+        {
+            return result;
+        }
+
+        if (source.type() != target.type())
+        {
+            // different types: replace value
+            result.push_back(
+            {
+                {"op", "replace"}, {"path", path}, {"value", target}
+            });
+            return result;
+        }
+
+        switch (source.type())
+        {
+            case value_t::array:
+            {
+                // first pass: traverse common elements
+                std::size_t i = 0;
+                while (i < source.size() && i < target.size())
+                {
+                    // recursive call to compare array values at index i
+                    auto temp_diff = diff(source[i], target[i], detail::concat(path, '/', std::to_string(i)));
+                    result.insert(result.end(), temp_diff.begin(), temp_diff.end());
+                    ++i;
+                }
+
+                // We now reached the end of at least one array
+                // in a second pass, traverse the remaining elements
+
+                // remove my remaining elements
+                const auto end_index = static_cast<difference_type>(result.size());
+                while (i < source.size())
+                {
+                    // add operations in reverse order to avoid invalid
+                    // indices
+                    result.insert(result.begin() + end_index, object(
+                    {
+                        {"op", "remove"},
+                        {"path", detail::concat(path, '/', std::to_string(i))}
+                    }));
+                    ++i;
+                }
+
+                // add other remaining elements
+                while (i < target.size())
+                {
+                    result.push_back(
+                    {
+                        {"op", "add"},
+                        {"path", detail::concat(path, "/-")},
+                        {"value", target[i]}
+                    });
+                    ++i;
+                }
+
+                break;
+            }
+
+            case value_t::object:
+            {
+                // first pass: traverse this object's elements
+                for (auto it = source.cbegin(); it != source.cend(); ++it)
+                {
+                    // escape the key name to be used in a JSON patch
+                    const auto path_key = detail::concat(path, '/', detail::escape(it.key()));
+
+                    if (target.find(it.key()) != target.end())
+                    {
+                        // recursive call to compare object values at key it
+                        auto temp_diff = diff(it.value(), target[it.key()], path_key);
+                        result.insert(result.end(), temp_diff.begin(), temp_diff.end());
+                    }
+                    else
+                    {
+                        // found a key that is not in o -> remove it
+                        result.push_back(object(
+                        {
+                            {"op", "remove"}, {"path", path_key}
+                        }));
+                    }
+                }
+
+                // second pass: traverse other object's elements
+                for (auto it = target.cbegin(); it != target.cend(); ++it)
+                {
+                    if (source.find(it.key()) == source.end())
+                    {
+                        // found a key that is not in this -> add it
+                        const auto path_key = detail::concat(path, '/', detail::escape(it.key()));
+                        result.push_back(
+                        {
+                            {"op", "add"}, {"path", path_key},
+                            {"value", it.value()}
+                        });
+                    }
+                }
+
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                // both primitive type: replace value
+                result.push_back(
+                {
+                    {"op", "replace"}, {"path", path}, {"value", target}
+                });
+                break;
+            }
+        }
+
+        return result;
+    }
+    /// @}
+
+    ////////////////////////////////
+    // JSON Merge Patch functions //
+    ////////////////////////////////
+
+    /// @name JSON Merge Patch functions
+    /// @{
+
+    /// @brief applies a JSON Merge Patch
+    /// @sa https://json.nlohmann.me/api/basic_json/merge_patch/
+    void merge_patch(const basic_json& apply_patch)
+    {
+        if (apply_patch.is_object())
+        {
+            if (!is_object())
+            {
+                *this = object();
+            }
+            for (auto it = apply_patch.begin(); it != apply_patch.end(); ++it)
+            {
+                if (it.value().is_null())
+                {
+                    erase(it.key());
+                }
+                else
+                {
+                    operator[](it.key()).merge_patch(it.value());
+                }
+            }
+        }
+        else
+        {
+            *this = apply_patch;
+        }
+    }
+
+    /// @}
+};
+
+/// @brief user-defined to_string function for JSON values
+/// @sa https://json.nlohmann.me/api/basic_json/to_string/
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+std::string to_string(const NLOHMANN_BASIC_JSON_TPL& j)
+{
+    return j.dump();
+}
+
+inline namespace literals
+{
+inline namespace json_literals
+{
+
+/// @brief user-defined string literal for JSON values
+/// @sa https://json.nlohmann.me/api/basic_json/operator_literal_json/
+JSON_HEDLEY_NON_NULL(1)
+inline nlohmann::json operator "" _json(const char* s, std::size_t n)
+{
+    return nlohmann::json::parse(s, s + n);
+}
+
+/// @brief user-defined string literal for JSON pointer
+/// @sa https://json.nlohmann.me/api/basic_json/operator_literal_json_pointer/
+JSON_HEDLEY_NON_NULL(1)
+inline nlohmann::json::json_pointer operator "" _json_pointer(const char* s, std::size_t n)
+{
+    return nlohmann::json::json_pointer(std::string(s, n));
+}
+
+}  // namespace json_literals
+}  // namespace literals
+NLOHMANN_JSON_NAMESPACE_END
+
+///////////////////////
+// nonmember support //
+///////////////////////
+
+namespace std // NOLINT(cert-dcl58-cpp)
+{
+
+/// @brief hash value for JSON objects
+/// @sa https://json.nlohmann.me/api/basic_json/std_hash/
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+struct hash<nlohmann::NLOHMANN_BASIC_JSON_TPL>
+{
+    std::size_t operator()(const nlohmann::NLOHMANN_BASIC_JSON_TPL& j) const
+    {
+        return nlohmann::detail::hash(j);
+    }
+};
+
+// specialization for std::less<value_t>
+template<>
+struct less< ::nlohmann::detail::value_t> // do not remove the space after '<', see https://github.com/nlohmann/json/pull/679
+{
+    /*!
+    @brief compare two value_t enum values
+    @since version 3.0.0
+    */
+    bool operator()(::nlohmann::detail::value_t lhs,
+                    ::nlohmann::detail::value_t rhs) const noexcept
+    {
+#if JSON_HAS_THREE_WAY_COMPARISON
+        return std::is_lt(lhs <=> rhs); // *NOPAD*
+#else
+        return ::nlohmann::detail::operator<(lhs, rhs);
+#endif
+    }
+};
+
+// C++20 prohibit function specialization in the std namespace.
+#ifndef JSON_HAS_CPP_20
+
+/// @brief exchanges the values of two JSON objects
+/// @sa https://json.nlohmann.me/api/basic_json/std_swap/
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+inline void swap(nlohmann::NLOHMANN_BASIC_JSON_TPL& j1, nlohmann::NLOHMANN_BASIC_JSON_TPL& j2) noexcept(  // NOLINT(readability-inconsistent-declaration-parameter-name)
+    is_nothrow_move_constructible<nlohmann::NLOHMANN_BASIC_JSON_TPL>::value&&                          // NOLINT(misc-redundant-expression)
+    is_nothrow_move_assignable<nlohmann::NLOHMANN_BASIC_JSON_TPL>::value)
+{
+    j1.swap(j2);
+}
+
+#endif
+
+}  // namespace std
+
+#if JSON_USE_GLOBAL_UDLS
+    using nlohmann::literals::json_literals::operator "" _json; // NOLINT(misc-unused-using-decls,google-global-names-in-headers)
+    using nlohmann::literals::json_literals::operator "" _json_pointer; //NOLINT(misc-unused-using-decls,google-global-names-in-headers)
+#endif
+
+// #include <nlohmann/detail/macro_unscope.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// restore clang diagnostic settings
+#if defined(__clang__)
+    #pragma clang diagnostic pop
+#endif
+
+// clean up
+#undef JSON_ASSERT
+#undef JSON_INTERNAL_CATCH
+#undef JSON_THROW
+#undef JSON_PRIVATE_UNLESS_TESTED
+#undef NLOHMANN_BASIC_JSON_TPL_DECLARATION
+#undef NLOHMANN_BASIC_JSON_TPL
+#undef JSON_EXPLICIT
+#undef NLOHMANN_CAN_CALL_STD_FUNC_IMPL
+#undef JSON_INLINE_VARIABLE
+#undef JSON_NO_UNIQUE_ADDRESS
+#undef JSON_DISABLE_ENUM_SERIALIZATION
+#undef JSON_USE_GLOBAL_UDLS
+
+#ifndef JSON_TEST_KEEP_MACROS
+    #undef JSON_CATCH
+    #undef JSON_TRY
+    #undef JSON_HAS_CPP_11
+    #undef JSON_HAS_CPP_14
+    #undef JSON_HAS_CPP_17
+    #undef JSON_HAS_CPP_20
+    #undef JSON_HAS_FILESYSTEM
+    #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+    #undef JSON_HAS_THREE_WAY_COMPARISON
+    #undef JSON_HAS_RANGES
+    #undef JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+#endif
+
+// #include <nlohmann/thirdparty/hedley/hedley_undef.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#undef JSON_HEDLEY_ALWAYS_INLINE
+#undef JSON_HEDLEY_ARM_VERSION
+#undef JSON_HEDLEY_ARM_VERSION_CHECK
+#undef JSON_HEDLEY_ARRAY_PARAM
+#undef JSON_HEDLEY_ASSUME
+#undef JSON_HEDLEY_BEGIN_C_DECLS
+#undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE
+#undef JSON_HEDLEY_CLANG_HAS_BUILTIN
+#undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE
+#undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE
+#undef JSON_HEDLEY_CLANG_HAS_EXTENSION
+#undef JSON_HEDLEY_CLANG_HAS_FEATURE
+#undef JSON_HEDLEY_CLANG_HAS_WARNING
+#undef JSON_HEDLEY_COMPCERT_VERSION
+#undef JSON_HEDLEY_COMPCERT_VERSION_CHECK
+#undef JSON_HEDLEY_CONCAT
+#undef JSON_HEDLEY_CONCAT3
+#undef JSON_HEDLEY_CONCAT3_EX
+#undef JSON_HEDLEY_CONCAT_EX
+#undef JSON_HEDLEY_CONST
+#undef JSON_HEDLEY_CONSTEXPR
+#undef JSON_HEDLEY_CONST_CAST
+#undef JSON_HEDLEY_CPP_CAST
+#undef JSON_HEDLEY_CRAY_VERSION
+#undef JSON_HEDLEY_CRAY_VERSION_CHECK
+#undef JSON_HEDLEY_C_DECL
+#undef JSON_HEDLEY_DEPRECATED
+#undef JSON_HEDLEY_DEPRECATED_FOR
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION
+#undef JSON_HEDLEY_DIAGNOSTIC_POP
+#undef JSON_HEDLEY_DIAGNOSTIC_PUSH
+#undef JSON_HEDLEY_DMC_VERSION
+#undef JSON_HEDLEY_DMC_VERSION_CHECK
+#undef JSON_HEDLEY_EMPTY_BASES
+#undef JSON_HEDLEY_EMSCRIPTEN_VERSION
+#undef JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK
+#undef JSON_HEDLEY_END_C_DECLS
+#undef JSON_HEDLEY_FLAGS
+#undef JSON_HEDLEY_FLAGS_CAST
+#undef JSON_HEDLEY_GCC_HAS_ATTRIBUTE
+#undef JSON_HEDLEY_GCC_HAS_BUILTIN
+#undef JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE
+#undef JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE
+#undef JSON_HEDLEY_GCC_HAS_EXTENSION
+#undef JSON_HEDLEY_GCC_HAS_FEATURE
+#undef JSON_HEDLEY_GCC_HAS_WARNING
+#undef JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK
+#undef JSON_HEDLEY_GCC_VERSION
+#undef JSON_HEDLEY_GCC_VERSION_CHECK
+#undef JSON_HEDLEY_GNUC_HAS_ATTRIBUTE
+#undef JSON_HEDLEY_GNUC_HAS_BUILTIN
+#undef JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE
+#undef JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE
+#undef JSON_HEDLEY_GNUC_HAS_EXTENSION
+#undef JSON_HEDLEY_GNUC_HAS_FEATURE
+#undef JSON_HEDLEY_GNUC_HAS_WARNING
+#undef JSON_HEDLEY_GNUC_VERSION
+#undef JSON_HEDLEY_GNUC_VERSION_CHECK
+#undef JSON_HEDLEY_HAS_ATTRIBUTE
+#undef JSON_HEDLEY_HAS_BUILTIN
+#undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE
+#undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS
+#undef JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE
+#undef JSON_HEDLEY_HAS_EXTENSION
+#undef JSON_HEDLEY_HAS_FEATURE
+#undef JSON_HEDLEY_HAS_WARNING
+#undef JSON_HEDLEY_IAR_VERSION
+#undef JSON_HEDLEY_IAR_VERSION_CHECK
+#undef JSON_HEDLEY_IBM_VERSION
+#undef JSON_HEDLEY_IBM_VERSION_CHECK
+#undef JSON_HEDLEY_IMPORT
+#undef JSON_HEDLEY_INLINE
+#undef JSON_HEDLEY_INTEL_CL_VERSION
+#undef JSON_HEDLEY_INTEL_CL_VERSION_CHECK
+#undef JSON_HEDLEY_INTEL_VERSION
+#undef JSON_HEDLEY_INTEL_VERSION_CHECK
+#undef JSON_HEDLEY_IS_CONSTANT
+#undef JSON_HEDLEY_IS_CONSTEXPR_
+#undef JSON_HEDLEY_LIKELY
+#undef JSON_HEDLEY_MALLOC
+#undef JSON_HEDLEY_MCST_LCC_VERSION
+#undef JSON_HEDLEY_MCST_LCC_VERSION_CHECK
+#undef JSON_HEDLEY_MESSAGE
+#undef JSON_HEDLEY_MSVC_VERSION
+#undef JSON_HEDLEY_MSVC_VERSION_CHECK
+#undef JSON_HEDLEY_NEVER_INLINE
+#undef JSON_HEDLEY_NON_NULL
+#undef JSON_HEDLEY_NO_ESCAPE
+#undef JSON_HEDLEY_NO_RETURN
+#undef JSON_HEDLEY_NO_THROW
+#undef JSON_HEDLEY_NULL
+#undef JSON_HEDLEY_PELLES_VERSION
+#undef JSON_HEDLEY_PELLES_VERSION_CHECK
+#undef JSON_HEDLEY_PGI_VERSION
+#undef JSON_HEDLEY_PGI_VERSION_CHECK
+#undef JSON_HEDLEY_PREDICT
+#undef JSON_HEDLEY_PRINTF_FORMAT
+#undef JSON_HEDLEY_PRIVATE
+#undef JSON_HEDLEY_PUBLIC
+#undef JSON_HEDLEY_PURE
+#undef JSON_HEDLEY_REINTERPRET_CAST
+#undef JSON_HEDLEY_REQUIRE
+#undef JSON_HEDLEY_REQUIRE_CONSTEXPR
+#undef JSON_HEDLEY_REQUIRE_MSG
+#undef JSON_HEDLEY_RESTRICT
+#undef JSON_HEDLEY_RETURNS_NON_NULL
+#undef JSON_HEDLEY_SENTINEL
+#undef JSON_HEDLEY_STATIC_ASSERT
+#undef JSON_HEDLEY_STATIC_CAST
+#undef JSON_HEDLEY_STRINGIFY
+#undef JSON_HEDLEY_STRINGIFY_EX
+#undef JSON_HEDLEY_SUNPRO_VERSION
+#undef JSON_HEDLEY_SUNPRO_VERSION_CHECK
+#undef JSON_HEDLEY_TINYC_VERSION
+#undef JSON_HEDLEY_TINYC_VERSION_CHECK
+#undef JSON_HEDLEY_TI_ARMCL_VERSION
+#undef JSON_HEDLEY_TI_ARMCL_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CL2000_VERSION
+#undef JSON_HEDLEY_TI_CL2000_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CL430_VERSION
+#undef JSON_HEDLEY_TI_CL430_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CL6X_VERSION
+#undef JSON_HEDLEY_TI_CL6X_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CL7X_VERSION
+#undef JSON_HEDLEY_TI_CL7X_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CLPRU_VERSION
+#undef JSON_HEDLEY_TI_CLPRU_VERSION_CHECK
+#undef JSON_HEDLEY_TI_VERSION
+#undef JSON_HEDLEY_TI_VERSION_CHECK
+#undef JSON_HEDLEY_UNAVAILABLE
+#undef JSON_HEDLEY_UNLIKELY
+#undef JSON_HEDLEY_UNPREDICTABLE
+#undef JSON_HEDLEY_UNREACHABLE
+#undef JSON_HEDLEY_UNREACHABLE_RETURN
+#undef JSON_HEDLEY_VERSION
+#undef JSON_HEDLEY_VERSION_DECODE_MAJOR
+#undef JSON_HEDLEY_VERSION_DECODE_MINOR
+#undef JSON_HEDLEY_VERSION_DECODE_REVISION
+#undef JSON_HEDLEY_VERSION_ENCODE
+#undef JSON_HEDLEY_WARNING
+#undef JSON_HEDLEY_WARN_UNUSED_RESULT
+#undef JSON_HEDLEY_WARN_UNUSED_RESULT_MSG
+#undef JSON_HEDLEY_FALL_THROUGH
+
+
+
+#endif  // INCLUDE_NLOHMANN_JSON_HPP_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/nlohmann_json/json_fwd.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/nlohmann_json/json_fwd.hpp
new file mode 100644
index 0000000000..83c21f857b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/nlohmann_json/json_fwd.hpp
@@ -0,0 +1,175 @@
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+#ifndef INCLUDE_NLOHMANN_JSON_FWD_HPP_
+#define INCLUDE_NLOHMANN_JSON_FWD_HPP_
+
+#include <cstdint> // int64_t, uint64_t
+#include <map> // map
+#include <memory> // allocator
+#include <string> // string
+#include <vector> // vector
+
+// #include <nlohmann/detail/abi_macros.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.2
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2022 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// This file contains all macro definitions affecting or depending on the ABI
+
+#ifndef JSON_SKIP_LIBRARY_VERSION_CHECK
+    #if defined(NLOHMANN_JSON_VERSION_MAJOR) && defined(NLOHMANN_JSON_VERSION_MINOR) && defined(NLOHMANN_JSON_VERSION_PATCH)
+        #if NLOHMANN_JSON_VERSION_MAJOR != 3 || NLOHMANN_JSON_VERSION_MINOR != 11 || NLOHMANN_JSON_VERSION_PATCH != 2
+            #warning "Already included a different version of the library!"
+        #endif
+    #endif
+#endif
+
+#define NLOHMANN_JSON_VERSION_MAJOR 3   // NOLINT(modernize-macro-to-enum)
+#define NLOHMANN_JSON_VERSION_MINOR 11  // NOLINT(modernize-macro-to-enum)
+#define NLOHMANN_JSON_VERSION_PATCH 2   // NOLINT(modernize-macro-to-enum)
+
+#ifndef JSON_DIAGNOSTICS
+    #define JSON_DIAGNOSTICS 0
+#endif
+
+#ifndef JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+    #define JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON 0
+#endif
+
+#if JSON_DIAGNOSTICS
+    #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diag
+#else
+    #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS
+#endif
+
+#if JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+    #define NLOHMANN_JSON_ABI_TAG_LEGACY_DISCARDED_VALUE_COMPARISON _ldvcmp
+#else
+    #define NLOHMANN_JSON_ABI_TAG_LEGACY_DISCARDED_VALUE_COMPARISON
+#endif
+
+#ifndef NLOHMANN_JSON_NAMESPACE_NO_VERSION
+    #define NLOHMANN_JSON_NAMESPACE_NO_VERSION 0
+#endif
+
+// Construct the namespace ABI tags component
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b) json_abi ## a ## b
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT(a, b) \
+    NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b)
+
+#define NLOHMANN_JSON_ABI_TAGS                                       \
+    NLOHMANN_JSON_ABI_TAGS_CONCAT(                                   \
+            NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS,                       \
+            NLOHMANN_JSON_ABI_TAG_LEGACY_DISCARDED_VALUE_COMPARISON)
+
+// Construct the namespace version component
+#define NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT_EX(major, minor, patch) \
+    _v ## major ## _ ## minor ## _ ## patch
+#define NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT(major, minor, patch) \
+    NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT_EX(major, minor, patch)
+
+#if NLOHMANN_JSON_NAMESPACE_NO_VERSION
+#define NLOHMANN_JSON_NAMESPACE_VERSION
+#else
+#define NLOHMANN_JSON_NAMESPACE_VERSION                                 \
+    NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT(NLOHMANN_JSON_VERSION_MAJOR, \
+                                           NLOHMANN_JSON_VERSION_MINOR, \
+                                           NLOHMANN_JSON_VERSION_PATCH)
+#endif
+
+// Combine namespace components
+#define NLOHMANN_JSON_NAMESPACE_CONCAT_EX(a, b) a ## b
+#define NLOHMANN_JSON_NAMESPACE_CONCAT(a, b) \
+    NLOHMANN_JSON_NAMESPACE_CONCAT_EX(a, b)
+
+#ifndef NLOHMANN_JSON_NAMESPACE
+#define NLOHMANN_JSON_NAMESPACE               \
+    nlohmann::NLOHMANN_JSON_NAMESPACE_CONCAT( \
+            NLOHMANN_JSON_ABI_TAGS,           \
+            NLOHMANN_JSON_NAMESPACE_VERSION)
+#endif
+
+#ifndef NLOHMANN_JSON_NAMESPACE_BEGIN
+#define NLOHMANN_JSON_NAMESPACE_BEGIN                \
+    namespace nlohmann                               \
+    {                                                \
+    inline namespace NLOHMANN_JSON_NAMESPACE_CONCAT( \
+                NLOHMANN_JSON_ABI_TAGS,              \
+                NLOHMANN_JSON_NAMESPACE_VERSION)     \
+    {
+#endif
+
+#ifndef NLOHMANN_JSON_NAMESPACE_END
+#define NLOHMANN_JSON_NAMESPACE_END                                     \
+    }  /* namespace (inline namespace) NOLINT(readability/namespace) */ \
+    }  // namespace nlohmann
+#endif
+
+
+/*!
+@brief namespace for Niels Lohmann
+@see https://github.com/nlohmann
+@since version 1.0.0
+*/
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/*!
+@brief default JSONSerializer template argument
+
+This serializer ignores the template arguments and uses ADL
+([argument-dependent lookup](https://en.cppreference.com/w/cpp/language/adl))
+for serialization.
+*/
+template<typename T = void, typename SFINAE = void>
+struct adl_serializer;
+
+/// a class to store JSON values
+/// @sa https://json.nlohmann.me/api/basic_json/
+template<template<typename U, typename V, typename... Args> class ObjectType =
+         std::map,
+         template<typename U, typename... Args> class ArrayType = std::vector,
+         class StringType = std::string, class BooleanType = bool,
+         class NumberIntegerType = std::int64_t,
+         class NumberUnsignedType = std::uint64_t,
+         class NumberFloatType = double,
+         template<typename U> class AllocatorType = std::allocator,
+         template<typename T, typename SFINAE = void> class JSONSerializer =
+         adl_serializer,
+         class BinaryType = std::vector<std::uint8_t>>
+class basic_json;
+
+/// @brief JSON Pointer defines a string syntax for identifying a specific value within a JSON document
+/// @sa https://json.nlohmann.me/api/json_pointer/
+template<typename RefStringType>
+class json_pointer;
+
+/*!
+@brief default specialization
+@sa https://json.nlohmann.me/api/json/
+*/
+using json = basic_json<>;
+
+/// @brief a minimal map-like container that preserves insertion order
+/// @sa https://json.nlohmann.me/api/ordered_map/
+template<class Key, class T, class IgnoredLess, class Allocator>
+struct ordered_map;
+
+/// @brief specialization that maintains the insertion order of object keys
+/// @sa https://json.nlohmann.me/api/ordered_json/
+using ordered_json = basic_json<nlohmann::ordered_map>;
+
+NLOHMANN_JSON_NAMESPACE_END
+
+#endif  // INCLUDE_NLOHMANN_JSON_FWD_HPP_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/CMakeLists.txt
new file mode 100644
index 0000000000..e07cb6d927
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/CMakeLists.txt
@@ -0,0 +1,8 @@
+add_library(parquet
+        STATIC
+        parquet_constants.cpp
+        parquet_types.cpp)
+
+target_include_directories(parquet PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+
+target_compile_definitions(parquet PUBLIC HAVE_STDINT_H)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/LICENSE
new file mode 100644
index 0000000000..09c6877672
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/LICENSE
@@ -0,0 +1,217 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+--------------------------------------------------------------------------------
+
+This product includes code from Apache Avro.
+
+Copyright: 2014 The Apache Software Foundation.
+Home page: https://avro.apache.org/
+License: http://www.apache.org/licenses/LICENSE-2.0
+
+--------------------------------------------------------------------------------
+
+This project includes code from Daniel Lemire's JavaFastPFOR project. The
+"Lemire" bit packing source code produced by parquet-generator is derived from
+the JavaFastPFOR project.
+
+Copyright: 2013 Daniel Lemire
+Home page: http://lemire.me/en/
+Project page: https://github.com/lemire/JavaFastPFOR
+License: Apache License Version 2.0 http://www.apache.org/licenses/LICENSE-2.0
+
+--------------------------------------------------------------------------------
+
+This product includes code from Apache Spark.
+
+* dev/merge_parquet_pr.py is based on Spark's dev/merge_spark_pr.py
+
+Copyright: 2014 The Apache Software Foundation.
+Home page: https://spark.apache.org/
+License: http://www.apache.org/licenses/LICENSE-2.0
+
+--------------------------------------------------------------------------------
+
+This product includes code from Twitter's ElephantBird project.
+
+* parquet-hadoop's UnmaterializableRecordCounter.java includes code from
+  ElephantBird's LzoRecordReader.java
+
+Copyright: 2012-2014 Twitter
+Home page: https://github.com/twitter/elephant-bird
+License: http://www.apache.org/licenses/LICENSE-2.0
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_constants.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_constants.cpp
new file mode 100644
index 0000000000..9c00af3dd0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_constants.cpp
@@ -0,0 +1,17 @@
+/**
+ * Autogenerated by Thrift Compiler (0.11.0)
+ *
+ * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
+ *  @generated
+ */
+#include "parquet_constants.h"
+
+namespace lbug_parquet { namespace format {
+
+const parquetConstants g_parquet_constants;
+
+parquetConstants::parquetConstants() {
+}
+
+}} // namespace
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_constants.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_constants.h
new file mode 100644
index 0000000000..b6bd0f3ad5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_constants.h
@@ -0,0 +1,24 @@
+/**
+ * Autogenerated by Thrift Compiler (0.11.0)
+ *
+ * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
+ *  @generated
+ */
+#ifndef parquet_CONSTANTS_H
+#define parquet_CONSTANTS_H
+
+#include "parquet_types.h"
+
+namespace lbug_parquet { namespace format {
+
+class parquetConstants {
+ public:
+  parquetConstants();
+
+};
+
+extern const parquetConstants g_parquet_constants;
+
+}} // namespace
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_types.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_types.cpp
new file mode 100644
index 0000000000..047c630789
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_types.cpp
@@ -0,0 +1,6690 @@
+/**
+ * Autogenerated by Thrift Compiler (0.11.0)
+ *
+ * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
+ *  @generated
+ */
+#include "parquet_types.h"
+
+#include <algorithm>
+#include <ostream>
+
+#include "TToString.h"
+
+namespace lbug_parquet { namespace format {
+
+std::ostream &operator<<(std::ostream &out, const Type::type &val) {
+	switch (val) {
+	case Type::BOOLEAN:
+		out << "BOOLEAN";
+		return out;
+	case Type::INT32:
+		out << "INT32";
+		return out;
+	case Type::INT64:
+		out << "INT64";
+		return out;
+	case Type::INT96:
+		out << "INT96";
+		return out;
+	case Type::FLOAT:
+		out << "FLOAT";
+		return out;
+	case Type::DOUBLE:
+		out << "DOUBLE";
+		return out;
+	case Type::BYTE_ARRAY:
+		out << "BYTE_ARRAY";
+		return out;
+	case Type::FIXED_LEN_BYTE_ARRAY:
+		out << "FIXED_LEN_BYTE_ARRAY";
+		return out;
+		//  no default for compiler error on missing enum
+	}
+	out << static_cast<int>(val);
+	return out;
+}
+
+std::ostream &operator<<(std::ostream &out, const ConvertedType::type &val) {
+	switch (val) {
+	case ConvertedType::UTF8:
+		out << "UTF8";
+		return out;
+	case ConvertedType::MAP:
+		out << "MAP";
+		return out;
+	case ConvertedType::MAP_KEY_VALUE:
+		out << "MAP_KEY_VALUE";
+		return out;
+	case ConvertedType::LIST:
+		out << "LIST";
+		return out;
+	case ConvertedType::ENUM:
+		out << "ENUM";
+		return out;
+	case ConvertedType::DECIMAL:
+		out << "DECIMAL";
+		return out;
+	case ConvertedType::DATE:
+		out << "DATE";
+		return out;
+	case ConvertedType::TIME_MILLIS:
+		out << "TIME_MILLIS";
+		return out;
+	case ConvertedType::TIME_MICROS:
+		out << "TIME_MICROS";
+		return out;
+	case ConvertedType::TIMESTAMP_MILLIS:
+		out << "TIMESTAMP_MILLIS";
+		return out;
+	case ConvertedType::TIMESTAMP_MICROS:
+		out << "TIMESTAMP_MICROS";
+		return out;
+	case ConvertedType::UINT_8:
+		out << "UINT_8";
+		return out;
+	case ConvertedType::UINT_16:
+		out << "UINT_16";
+		return out;
+	case ConvertedType::UINT_32:
+		out << "UINT_32";
+		return out;
+	case ConvertedType::UINT_64:
+		out << "UINT_64";
+		return out;
+	case ConvertedType::INT_8:
+		out << "INT_8";
+		return out;
+	case ConvertedType::INT_16:
+		out << "INT_16";
+		return out;
+	case ConvertedType::INT_32:
+		out << "INT_32";
+		return out;
+	case ConvertedType::INT_64:
+		out << "INT_64";
+		return out;
+	case ConvertedType::JSON:
+		out << "JSON";
+		return out;
+	case ConvertedType::BSON:
+		out << "BSON";
+		return out;
+	case ConvertedType::INTERVAL:
+		out << "INTERVAL";
+		return out;
+  case ConvertedType::SERIAL:
+    out << "SERIAL";
+    return out;
+	case ConvertedType::NULL_TYPE:
+		out << "NULL";
+		return out;
+		//  no default for compiler error on missing enum
+	}
+	out << static_cast<int>(val);
+	return out;
+}
+
+std::ostream &operator<<(std::ostream &out, const FieldRepetitionType::type &val) {
+	switch (val) {
+	case FieldRepetitionType::REQUIRED:
+		out << "REQUIRED";
+		return out;
+	case FieldRepetitionType::OPTIONAL:
+		out << "OPTIONAL";
+		return out;
+	case FieldRepetitionType::REPEATED:
+		out << "REPEATED";
+		return out;
+		//  no default for compiler error on missing enum
+	}
+	out << static_cast<int>(val);
+	return out;
+}
+
+std::ostream &operator<<(std::ostream &out, const Encoding::type &val) {
+	switch (val) {
+	case Encoding::PLAIN:
+		out << "PLAIN";
+		return out;
+	case Encoding::PLAIN_DICTIONARY:
+		out << "PLAIN_DICTIONARY";
+		return out;
+	case Encoding::RLE:
+		out << "RLE";
+		return out;
+	case Encoding::BIT_PACKED:
+		out << "BIT_PACKED";
+		return out;
+	case Encoding::DELTA_BINARY_PACKED:
+		out << "DELTA_BINARY_PACKED";
+		return out;
+	case Encoding::DELTA_LENGTH_BYTE_ARRAY:
+		out << "DELTA_LENGTH_BYTE_ARRAY";
+		return out;
+	case Encoding::DELTA_BYTE_ARRAY:
+		out << "DELTA_BYTE_ARRAY";
+		return out;
+	case Encoding::RLE_DICTIONARY:
+		out << "RLE_DICTIONARY";
+		return out;
+	case Encoding::BYTE_STREAM_SPLIT:
+		out << "BYTE_STREAM_SPLIT";
+		return out;
+		//  no default for compiler error on missing enum
+	}
+	out << static_cast<int>(val);
+	return out;
+}
+
+std::ostream &operator<<(std::ostream &out, const CompressionCodec::type &val) {
+	switch (val) {
+	case CompressionCodec::UNCOMPRESSED:
+		out << "UNCOMPRESSED";
+		return out;
+	case CompressionCodec::SNAPPY:
+		out << "SNAPPY";
+		return out;
+	case CompressionCodec::GZIP:
+		out << "GZIP";
+		return out;
+	case CompressionCodec::LZO:
+		out << "LZO";
+		return out;
+	case CompressionCodec::BROTLI:
+		out << "BROTLI";
+		return out;
+	case CompressionCodec::LZ4:
+		out << "LZ4";
+		return out;
+	case CompressionCodec::ZSTD:
+		out << "ZSTD";
+		return out;
+	case CompressionCodec::LZ4_RAW:
+		out << "LZ4_RAW";
+		return out;
+		//  no default for compiler error on missing enum
+	}
+	out << static_cast<int>(val);
+	return out;
+}
+
+std::ostream &operator<<(std::ostream &out, const PageType::type &val) {
+	switch (val) {
+	case PageType::DATA_PAGE:
+		out << "DATA_PAGE";
+		return out;
+	case PageType::INDEX_PAGE:
+		out << "INDEX_PAGE";
+		return out;
+	case PageType::DICTIONARY_PAGE:
+		out << "DICTIONARY_PAGE";
+		return out;
+	case PageType::DATA_PAGE_V2:
+		out << "DATA_PAGE_V2";
+		return out;
+		//  no default for compiler error on missing enum
+	}
+	out << static_cast<int>(val);
+	return out;
+}
+
+std::ostream &operator<<(std::ostream &out, const BoundaryOrder::type &val) {
+	switch (val) {
+	case BoundaryOrder::UNORDERED:
+		out << "UNORDERED";
+		return out;
+	case BoundaryOrder::ASCENDING:
+		out << "ASCENDING";
+		return out;
+	case BoundaryOrder::DESCENDING:
+		out << "DESCENDING";
+		return out;
+		//  no default for compiler error on missing enum
+	}
+	out << static_cast<int>(val);
+	return out;
+}
+
+
+Statistics::~Statistics() throw() {
+}
+
+
+void Statistics::__set_max(const std::string& val) {
+  this->max = val;
+__isset.max = true;
+}
+
+void Statistics::__set_min(const std::string& val) {
+  this->min = val;
+__isset.min = true;
+}
+
+void Statistics::__set_null_count(const int64_t val) {
+  this->null_count = val;
+__isset.null_count = true;
+}
+
+void Statistics::__set_distinct_count(const int64_t val) {
+  this->distinct_count = val;
+__isset.distinct_count = true;
+}
+
+void Statistics::__set_max_value(const std::string& val) {
+  this->max_value = val;
+__isset.max_value = true;
+}
+
+void Statistics::__set_min_value(const std::string& val) {
+  this->min_value = val;
+__isset.min_value = true;
+}
+std::ostream& operator<<(std::ostream& out, const Statistics& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t Statistics::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->max);
+          this->__isset.max = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->min);
+          this->__isset.min = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->null_count);
+          this->__isset.null_count = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->distinct_count);
+          this->__isset.distinct_count = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->max_value);
+          this->__isset.max_value = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 6:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->min_value);
+          this->__isset.min_value = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t Statistics::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("Statistics");
+
+  if (this->__isset.max) {
+    xfer += oprot->writeFieldBegin("max", ::lbug_apache::thrift::protocol::T_STRING, 1);
+    xfer += oprot->writeBinary(this->max);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.min) {
+    xfer += oprot->writeFieldBegin("min", ::lbug_apache::thrift::protocol::T_STRING, 2);
+    xfer += oprot->writeBinary(this->min);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.null_count) {
+    xfer += oprot->writeFieldBegin("null_count", ::lbug_apache::thrift::protocol::T_I64, 3);
+    xfer += oprot->writeI64(this->null_count);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.distinct_count) {
+    xfer += oprot->writeFieldBegin("distinct_count", ::lbug_apache::thrift::protocol::T_I64, 4);
+    xfer += oprot->writeI64(this->distinct_count);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.max_value) {
+    xfer += oprot->writeFieldBegin("max_value", ::lbug_apache::thrift::protocol::T_STRING, 5);
+    xfer += oprot->writeBinary(this->max_value);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.min_value) {
+    xfer += oprot->writeFieldBegin("min_value", ::lbug_apache::thrift::protocol::T_STRING, 6);
+    xfer += oprot->writeBinary(this->min_value);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(Statistics &a, Statistics &b) {
+  using ::std::swap;
+  swap(a.max, b.max);
+  swap(a.min, b.min);
+  swap(a.null_count, b.null_count);
+  swap(a.distinct_count, b.distinct_count);
+  swap(a.max_value, b.max_value);
+  swap(a.min_value, b.min_value);
+  swap(a.__isset, b.__isset);
+}
+
+Statistics::Statistics(const Statistics& other0) {
+  max = other0.max;
+  min = other0.min;
+  null_count = other0.null_count;
+  distinct_count = other0.distinct_count;
+  max_value = other0.max_value;
+  min_value = other0.min_value;
+  __isset = other0.__isset;
+}
+Statistics& Statistics::operator=(const Statistics& other1) {
+  max = other1.max;
+  min = other1.min;
+  null_count = other1.null_count;
+  distinct_count = other1.distinct_count;
+  max_value = other1.max_value;
+  min_value = other1.min_value;
+  __isset = other1.__isset;
+  return *this;
+}
+void Statistics::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "Statistics(";
+  out << "max="; (__isset.max ? (out << to_string(max)) : (out << "<null>"));
+  out << ", " << "min="; (__isset.min ? (out << to_string(min)) : (out << "<null>"));
+  out << ", " << "null_count="; (__isset.null_count ? (out << to_string(null_count)) : (out << "<null>"));
+  out << ", " << "distinct_count="; (__isset.distinct_count ? (out << to_string(distinct_count)) : (out << "<null>"));
+  out << ", " << "max_value="; (__isset.max_value ? (out << to_string(max_value)) : (out << "<null>"));
+  out << ", " << "min_value="; (__isset.min_value ? (out << to_string(min_value)) : (out << "<null>"));
+  out << ")";
+}
+
+
+StringType::~StringType() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const StringType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t StringType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t StringType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("StringType");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(StringType &a, StringType &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+StringType::StringType(const StringType& other2) {
+  (void) other2;
+}
+StringType& StringType::operator=(const StringType& other3) {
+  (void) other3;
+  return *this;
+}
+void StringType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "StringType(";
+  out << ")";
+}
+
+
+UUIDType::~UUIDType() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const UUIDType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t UUIDType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t UUIDType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("UUIDType");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(UUIDType &a, UUIDType &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+UUIDType::UUIDType(const UUIDType& other4) {
+  (void) other4;
+}
+UUIDType& UUIDType::operator=(const UUIDType& other5) {
+  (void) other5;
+  return *this;
+}
+void UUIDType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "UUIDType(";
+  out << ")";
+}
+
+
+MapType::~MapType() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const MapType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t MapType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t MapType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("MapType");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(MapType &a, MapType &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+MapType::MapType(const MapType& other6) {
+  (void) other6;
+}
+MapType& MapType::operator=(const MapType& other7) {
+  (void) other7;
+  return *this;
+}
+void MapType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "MapType(";
+  out << ")";
+}
+
+
+ListType::~ListType() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const ListType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t ListType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t ListType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("ListType");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(ListType &a, ListType &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+ListType::ListType(const ListType& other8) {
+  (void) other8;
+}
+ListType& ListType::operator=(const ListType& other9) {
+  (void) other9;
+  return *this;
+}
+void ListType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "ListType(";
+  out << ")";
+}
+
+
+EnumType::~EnumType() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const EnumType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t EnumType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t EnumType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("EnumType");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(EnumType &a, EnumType &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+EnumType::EnumType(const EnumType& other10) {
+  (void) other10;
+}
+EnumType& EnumType::operator=(const EnumType& other11) {
+  (void) other11;
+  return *this;
+}
+void EnumType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "EnumType(";
+  out << ")";
+}
+
+
+DateType::~DateType() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const DateType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t DateType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t DateType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("DateType");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(DateType &a, DateType &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+DateType::DateType(const DateType& other12) {
+  (void) other12;
+}
+DateType& DateType::operator=(const DateType& other13) {
+  (void) other13;
+  return *this;
+}
+void DateType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "DateType(";
+  out << ")";
+}
+
+
+NullType::~NullType() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const NullType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t NullType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t NullType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("NullType");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(NullType &a, NullType &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+NullType::NullType(const NullType& other14) {
+  (void) other14;
+}
+NullType& NullType::operator=(const NullType& other15) {
+  (void) other15;
+  return *this;
+}
+void NullType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "NullType(";
+  out << ")";
+}
+
+
+DecimalType::~DecimalType() throw() {
+}
+
+
+void DecimalType::__set_scale(const int32_t val) {
+  this->scale = val;
+}
+
+void DecimalType::__set_precision(const int32_t val) {
+  this->precision = val;
+}
+std::ostream& operator<<(std::ostream& out, const DecimalType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t DecimalType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_scale = false;
+  bool isset_precision = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->scale);
+          isset_scale = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->precision);
+          isset_precision = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_scale)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_precision)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t DecimalType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("DecimalType");
+
+  xfer += oprot->writeFieldBegin("scale", ::lbug_apache::thrift::protocol::T_I32, 1);
+  xfer += oprot->writeI32(this->scale);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("precision", ::lbug_apache::thrift::protocol::T_I32, 2);
+  xfer += oprot->writeI32(this->precision);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(DecimalType &a, DecimalType &b) {
+  using ::std::swap;
+  swap(a.scale, b.scale);
+  swap(a.precision, b.precision);
+}
+
+DecimalType::DecimalType(const DecimalType& other16) {
+  scale = other16.scale;
+  precision = other16.precision;
+}
+DecimalType& DecimalType::operator=(const DecimalType& other17) {
+  scale = other17.scale;
+  precision = other17.precision;
+  return *this;
+}
+void DecimalType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "DecimalType(";
+  out << "scale=" << to_string(scale);
+  out << ", " << "precision=" << to_string(precision);
+  out << ")";
+}
+
+
+MilliSeconds::~MilliSeconds() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const MilliSeconds& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t MilliSeconds::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t MilliSeconds::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("MilliSeconds");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(MilliSeconds &a, MilliSeconds &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+MilliSeconds::MilliSeconds(const MilliSeconds& other18) {
+  (void) other18;
+}
+MilliSeconds& MilliSeconds::operator=(const MilliSeconds& other19) {
+  (void) other19;
+  return *this;
+}
+void MilliSeconds::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "MilliSeconds(";
+  out << ")";
+}
+
+
+MicroSeconds::~MicroSeconds() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const MicroSeconds& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t MicroSeconds::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t MicroSeconds::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("MicroSeconds");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(MicroSeconds &a, MicroSeconds &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+MicroSeconds::MicroSeconds(const MicroSeconds& other20) {
+  (void) other20;
+}
+MicroSeconds& MicroSeconds::operator=(const MicroSeconds& other21) {
+  (void) other21;
+  return *this;
+}
+void MicroSeconds::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "MicroSeconds(";
+  out << ")";
+}
+
+
+NanoSeconds::~NanoSeconds() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const NanoSeconds& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t NanoSeconds::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t NanoSeconds::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("NanoSeconds");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(NanoSeconds &a, NanoSeconds &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+NanoSeconds::NanoSeconds(const NanoSeconds& other22) {
+  (void) other22;
+}
+NanoSeconds& NanoSeconds::operator=(const NanoSeconds& other23) {
+  (void) other23;
+  return *this;
+}
+void NanoSeconds::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "NanoSeconds(";
+  out << ")";
+}
+
+
+TimeUnit::~TimeUnit() throw() {
+}
+
+
+void TimeUnit::__set_MILLIS(const MilliSeconds& val) {
+  this->MILLIS = val;
+__isset.MILLIS = true;
+}
+
+void TimeUnit::__set_MICROS(const MicroSeconds& val) {
+  this->MICROS = val;
+__isset.MICROS = true;
+}
+
+void TimeUnit::__set_NANOS(const NanoSeconds& val) {
+  this->NANOS = val;
+__isset.NANOS = true;
+}
+std::ostream& operator<<(std::ostream& out, const TimeUnit& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t TimeUnit::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->MILLIS.read(iprot);
+          this->__isset.MILLIS = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->MICROS.read(iprot);
+          this->__isset.MICROS = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->NANOS.read(iprot);
+          this->__isset.NANOS = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t TimeUnit::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("TimeUnit");
+
+  if (this->__isset.MILLIS) {
+    xfer += oprot->writeFieldBegin("MILLIS", ::lbug_apache::thrift::protocol::T_STRUCT, 1);
+    xfer += this->MILLIS.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.MICROS) {
+    xfer += oprot->writeFieldBegin("MICROS", ::lbug_apache::thrift::protocol::T_STRUCT, 2);
+    xfer += this->MICROS.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.NANOS) {
+    xfer += oprot->writeFieldBegin("NANOS", ::lbug_apache::thrift::protocol::T_STRUCT, 3);
+    xfer += this->NANOS.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(TimeUnit &a, TimeUnit &b) {
+  using ::std::swap;
+  swap(a.MILLIS, b.MILLIS);
+  swap(a.MICROS, b.MICROS);
+  swap(a.NANOS, b.NANOS);
+  swap(a.__isset, b.__isset);
+}
+
+TimeUnit::TimeUnit(const TimeUnit& other24) {
+  MILLIS = other24.MILLIS;
+  MICROS = other24.MICROS;
+  NANOS = other24.NANOS;
+  __isset = other24.__isset;
+}
+TimeUnit& TimeUnit::operator=(const TimeUnit& other25) {
+  MILLIS = other25.MILLIS;
+  MICROS = other25.MICROS;
+  NANOS = other25.NANOS;
+  __isset = other25.__isset;
+  return *this;
+}
+void TimeUnit::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "TimeUnit(";
+  out << "MILLIS="; (__isset.MILLIS ? (out << to_string(MILLIS)) : (out << "<null>"));
+  out << ", " << "MICROS="; (__isset.MICROS ? (out << to_string(MICROS)) : (out << "<null>"));
+  out << ", " << "NANOS="; (__isset.NANOS ? (out << to_string(NANOS)) : (out << "<null>"));
+  out << ")";
+}
+
+
+TimestampType::~TimestampType() throw() {
+}
+
+
+void TimestampType::__set_isAdjustedToUTC(const bool val) {
+  this->isAdjustedToUTC = val;
+}
+
+void TimestampType::__set_unit(const TimeUnit& val) {
+  this->unit = val;
+}
+std::ostream& operator<<(std::ostream& out, const TimestampType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t TimestampType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_isAdjustedToUTC = false;
+  bool isset_unit = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BOOL) {
+          xfer += iprot->readBool(this->isAdjustedToUTC);
+          isset_isAdjustedToUTC = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->unit.read(iprot);
+          isset_unit = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_isAdjustedToUTC)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_unit)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t TimestampType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("TimestampType");
+
+  xfer += oprot->writeFieldBegin("isAdjustedToUTC", ::lbug_apache::thrift::protocol::T_BOOL, 1);
+  xfer += oprot->writeBool(this->isAdjustedToUTC);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("unit", ::lbug_apache::thrift::protocol::T_STRUCT, 2);
+  xfer += this->unit.write(oprot);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(TimestampType &a, TimestampType &b) {
+  using ::std::swap;
+  swap(a.isAdjustedToUTC, b.isAdjustedToUTC);
+  swap(a.unit, b.unit);
+}
+
+TimestampType::TimestampType(const TimestampType& other26) {
+  isAdjustedToUTC = other26.isAdjustedToUTC;
+  unit = other26.unit;
+}
+TimestampType& TimestampType::operator=(const TimestampType& other27) {
+  isAdjustedToUTC = other27.isAdjustedToUTC;
+  unit = other27.unit;
+  return *this;
+}
+void TimestampType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "TimestampType(";
+  out << "isAdjustedToUTC=" << to_string(isAdjustedToUTC);
+  out << ", " << "unit=" << to_string(unit);
+  out << ")";
+}
+
+
+TimeType::~TimeType() throw() {
+}
+
+
+void TimeType::__set_isAdjustedToUTC(const bool val) {
+  this->isAdjustedToUTC = val;
+}
+
+void TimeType::__set_unit(const TimeUnit& val) {
+  this->unit = val;
+}
+std::ostream& operator<<(std::ostream& out, const TimeType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t TimeType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_isAdjustedToUTC = false;
+  bool isset_unit = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BOOL) {
+          xfer += iprot->readBool(this->isAdjustedToUTC);
+          isset_isAdjustedToUTC = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->unit.read(iprot);
+          isset_unit = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_isAdjustedToUTC)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_unit)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t TimeType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("TimeType");
+
+  xfer += oprot->writeFieldBegin("isAdjustedToUTC", ::lbug_apache::thrift::protocol::T_BOOL, 1);
+  xfer += oprot->writeBool(this->isAdjustedToUTC);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("unit", ::lbug_apache::thrift::protocol::T_STRUCT, 2);
+  xfer += this->unit.write(oprot);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(TimeType &a, TimeType &b) {
+  using ::std::swap;
+  swap(a.isAdjustedToUTC, b.isAdjustedToUTC);
+  swap(a.unit, b.unit);
+}
+
+TimeType::TimeType(const TimeType& other28) {
+  isAdjustedToUTC = other28.isAdjustedToUTC;
+  unit = other28.unit;
+}
+TimeType& TimeType::operator=(const TimeType& other29) {
+  isAdjustedToUTC = other29.isAdjustedToUTC;
+  unit = other29.unit;
+  return *this;
+}
+void TimeType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "TimeType(";
+  out << "isAdjustedToUTC=" << to_string(isAdjustedToUTC);
+  out << ", " << "unit=" << to_string(unit);
+  out << ")";
+}
+
+
+IntType::~IntType() throw() {
+}
+
+
+void IntType::__set_bitWidth(const int8_t val) {
+  this->bitWidth = val;
+}
+
+void IntType::__set_isSigned(const bool val) {
+  this->isSigned = val;
+}
+std::ostream& operator<<(std::ostream& out, const IntType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t IntType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_bitWidth = false;
+  bool isset_isSigned = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BYTE) {
+          xfer += iprot->readByte(this->bitWidth);
+          isset_bitWidth = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BOOL) {
+          xfer += iprot->readBool(this->isSigned);
+          isset_isSigned = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_bitWidth)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_isSigned)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t IntType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("IntType");
+
+  xfer += oprot->writeFieldBegin("bitWidth", ::lbug_apache::thrift::protocol::T_BYTE, 1);
+  xfer += oprot->writeByte(this->bitWidth);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("isSigned", ::lbug_apache::thrift::protocol::T_BOOL, 2);
+  xfer += oprot->writeBool(this->isSigned);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(IntType &a, IntType &b) {
+  using ::std::swap;
+  swap(a.bitWidth, b.bitWidth);
+  swap(a.isSigned, b.isSigned);
+}
+
+IntType::IntType(const IntType& other30) {
+  bitWidth = other30.bitWidth;
+  isSigned = other30.isSigned;
+}
+IntType& IntType::operator=(const IntType& other31) {
+  bitWidth = other31.bitWidth;
+  isSigned = other31.isSigned;
+  return *this;
+}
+void IntType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "IntType(";
+  out << "bitWidth=" << to_string(bitWidth);
+  out << ", " << "isSigned=" << to_string(isSigned);
+  out << ")";
+}
+
+
+JsonType::~JsonType() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const JsonType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t JsonType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t JsonType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("JsonType");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(JsonType &a, JsonType &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+JsonType::JsonType(const JsonType& other32) {
+  (void) other32;
+}
+JsonType& JsonType::operator=(const JsonType& other33) {
+  (void) other33;
+  return *this;
+}
+void JsonType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "JsonType(";
+  out << ")";
+}
+
+
+BsonType::~BsonType() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const BsonType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t BsonType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t BsonType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("BsonType");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(BsonType &a, BsonType &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+BsonType::BsonType(const BsonType& other34) {
+  (void) other34;
+}
+BsonType& BsonType::operator=(const BsonType& other35) {
+  (void) other35;
+  return *this;
+}
+void BsonType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "BsonType(";
+  out << ")";
+}
+
+
+LogicalType::~LogicalType() throw() {
+}
+
+
+void LogicalType::__set_STRING(const StringType& val) {
+  this->STRING = val;
+__isset.STRING = true;
+}
+
+void LogicalType::__set_MAP(const MapType& val) {
+  this->MAP = val;
+__isset.MAP = true;
+}
+
+void LogicalType::__set_LIST(const ListType& val) {
+  this->LIST = val;
+__isset.LIST = true;
+}
+
+void LogicalType::__set_ENUM(const EnumType& val) {
+  this->ENUM = val;
+__isset.ENUM = true;
+}
+
+void LogicalType::__set_DECIMAL(const DecimalType& val) {
+  this->DECIMAL = val;
+__isset.DECIMAL = true;
+}
+
+void LogicalType::__set_DATE(const DateType& val) {
+  this->DATE = val;
+__isset.DATE = true;
+}
+
+void LogicalType::__set_TIME(const TimeType& val) {
+  this->TIME = val;
+__isset.TIME = true;
+}
+
+void LogicalType::__set_TIMESTAMP(const TimestampType& val) {
+  this->TIMESTAMP = val;
+__isset.TIMESTAMP = true;
+}
+
+void LogicalType::__set_INTEGER(const IntType& val) {
+  this->INTEGER = val;
+__isset.INTEGER = true;
+}
+
+void LogicalType::__set_UNKNOWN(const NullType& val) {
+  this->UNKNOWN = val;
+__isset.UNKNOWN = true;
+}
+
+void LogicalType::__set_JSON(const JsonType& val) {
+  this->JSON = val;
+__isset.JSON = true;
+}
+
+void LogicalType::__set_BSON(const BsonType& val) {
+  this->BSON = val;
+__isset.BSON = true;
+}
+
+void LogicalType::__set_UUID(const UUIDType& val) {
+  this->UUID = val;
+__isset.UUID = true;
+}
+std::ostream& operator<<(std::ostream& out, const LogicalType& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t LogicalType::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->STRING.read(iprot);
+          this->__isset.STRING = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->MAP.read(iprot);
+          this->__isset.MAP = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->LIST.read(iprot);
+          this->__isset.LIST = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->ENUM.read(iprot);
+          this->__isset.ENUM = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->DECIMAL.read(iprot);
+          this->__isset.DECIMAL = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 6:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->DATE.read(iprot);
+          this->__isset.DATE = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 7:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->TIME.read(iprot);
+          this->__isset.TIME = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 8:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->TIMESTAMP.read(iprot);
+          this->__isset.TIMESTAMP = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 10:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->INTEGER.read(iprot);
+          this->__isset.INTEGER = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 11:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->UNKNOWN.read(iprot);
+          this->__isset.UNKNOWN = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 12:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->JSON.read(iprot);
+          this->__isset.JSON = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 13:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->BSON.read(iprot);
+          this->__isset.BSON = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 14:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->UUID.read(iprot);
+          this->__isset.UUID = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t LogicalType::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("LogicalType");
+
+  if (this->__isset.STRING) {
+    xfer += oprot->writeFieldBegin("STRING", ::lbug_apache::thrift::protocol::T_STRUCT, 1);
+    xfer += this->STRING.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.MAP) {
+    xfer += oprot->writeFieldBegin("MAP", ::lbug_apache::thrift::protocol::T_STRUCT, 2);
+    xfer += this->MAP.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.LIST) {
+    xfer += oprot->writeFieldBegin("LIST", ::lbug_apache::thrift::protocol::T_STRUCT, 3);
+    xfer += this->LIST.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.ENUM) {
+    xfer += oprot->writeFieldBegin("ENUM", ::lbug_apache::thrift::protocol::T_STRUCT, 4);
+    xfer += this->ENUM.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.DECIMAL) {
+    xfer += oprot->writeFieldBegin("DECIMAL", ::lbug_apache::thrift::protocol::T_STRUCT, 5);
+    xfer += this->DECIMAL.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.DATE) {
+    xfer += oprot->writeFieldBegin("DATE", ::lbug_apache::thrift::protocol::T_STRUCT, 6);
+    xfer += this->DATE.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.TIME) {
+    xfer += oprot->writeFieldBegin("TIME", ::lbug_apache::thrift::protocol::T_STRUCT, 7);
+    xfer += this->TIME.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.TIMESTAMP) {
+    xfer += oprot->writeFieldBegin("TIMESTAMP", ::lbug_apache::thrift::protocol::T_STRUCT, 8);
+    xfer += this->TIMESTAMP.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.INTEGER) {
+    xfer += oprot->writeFieldBegin("INTEGER", ::lbug_apache::thrift::protocol::T_STRUCT, 10);
+    xfer += this->INTEGER.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.UNKNOWN) {
+    xfer += oprot->writeFieldBegin("UNKNOWN", ::lbug_apache::thrift::protocol::T_STRUCT, 11);
+    xfer += this->UNKNOWN.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.JSON) {
+    xfer += oprot->writeFieldBegin("JSON", ::lbug_apache::thrift::protocol::T_STRUCT, 12);
+    xfer += this->JSON.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.BSON) {
+    xfer += oprot->writeFieldBegin("BSON", ::lbug_apache::thrift::protocol::T_STRUCT, 13);
+    xfer += this->BSON.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.UUID) {
+    xfer += oprot->writeFieldBegin("UUID", ::lbug_apache::thrift::protocol::T_STRUCT, 14);
+    xfer += this->UUID.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(LogicalType &a, LogicalType &b) {
+  using ::std::swap;
+  swap(a.STRING, b.STRING);
+  swap(a.MAP, b.MAP);
+  swap(a.LIST, b.LIST);
+  swap(a.ENUM, b.ENUM);
+  swap(a.DECIMAL, b.DECIMAL);
+  swap(a.DATE, b.DATE);
+  swap(a.TIME, b.TIME);
+  swap(a.TIMESTAMP, b.TIMESTAMP);
+  swap(a.INTEGER, b.INTEGER);
+  swap(a.UNKNOWN, b.UNKNOWN);
+  swap(a.JSON, b.JSON);
+  swap(a.BSON, b.BSON);
+  swap(a.UUID, b.UUID);
+  swap(a.__isset, b.__isset);
+}
+
+LogicalType::LogicalType(const LogicalType& other36) {
+  STRING = other36.STRING;
+  MAP = other36.MAP;
+  LIST = other36.LIST;
+  ENUM = other36.ENUM;
+  DECIMAL = other36.DECIMAL;
+  DATE = other36.DATE;
+  TIME = other36.TIME;
+  TIMESTAMP = other36.TIMESTAMP;
+  INTEGER = other36.INTEGER;
+  UNKNOWN = other36.UNKNOWN;
+  JSON = other36.JSON;
+  BSON = other36.BSON;
+  UUID = other36.UUID;
+  __isset = other36.__isset;
+}
+LogicalType& LogicalType::operator=(const LogicalType& other37) {
+  STRING = other37.STRING;
+  MAP = other37.MAP;
+  LIST = other37.LIST;
+  ENUM = other37.ENUM;
+  DECIMAL = other37.DECIMAL;
+  DATE = other37.DATE;
+  TIME = other37.TIME;
+  TIMESTAMP = other37.TIMESTAMP;
+  INTEGER = other37.INTEGER;
+  UNKNOWN = other37.UNKNOWN;
+  JSON = other37.JSON;
+  BSON = other37.BSON;
+  UUID = other37.UUID;
+  __isset = other37.__isset;
+  return *this;
+}
+void LogicalType::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "LogicalType(";
+  out << "STRING="; (__isset.STRING ? (out << to_string(STRING)) : (out << "<null>"));
+  out << ", " << "MAP="; (__isset.MAP ? (out << to_string(MAP)) : (out << "<null>"));
+  out << ", " << "LIST="; (__isset.LIST ? (out << to_string(LIST)) : (out << "<null>"));
+  out << ", " << "ENUM="; (__isset.ENUM ? (out << to_string(ENUM)) : (out << "<null>"));
+  out << ", " << "DECIMAL="; (__isset.DECIMAL ? (out << to_string(DECIMAL)) : (out << "<null>"));
+  out << ", " << "DATE="; (__isset.DATE ? (out << to_string(DATE)) : (out << "<null>"));
+  out << ", " << "TIME="; (__isset.TIME ? (out << to_string(TIME)) : (out << "<null>"));
+  out << ", " << "TIMESTAMP="; (__isset.TIMESTAMP ? (out << to_string(TIMESTAMP)) : (out << "<null>"));
+  out << ", " << "INTEGER="; (__isset.INTEGER ? (out << to_string(INTEGER)) : (out << "<null>"));
+  out << ", " << "UNKNOWN="; (__isset.UNKNOWN ? (out << to_string(UNKNOWN)) : (out << "<null>"));
+  out << ", " << "JSON="; (__isset.JSON ? (out << to_string(JSON)) : (out << "<null>"));
+  out << ", " << "BSON="; (__isset.BSON ? (out << to_string(BSON)) : (out << "<null>"));
+  out << ", " << "UUID="; (__isset.UUID ? (out << to_string(UUID)) : (out << "<null>"));
+  out << ")";
+}
+
+
+SchemaElement::~SchemaElement() throw() {
+}
+
+
+void SchemaElement::__set_type(const Type::type val) {
+  this->type = val;
+__isset.type = true;
+}
+
+void SchemaElement::__set_type_length(const int32_t val) {
+  this->type_length = val;
+__isset.type_length = true;
+}
+
+void SchemaElement::__set_repetition_type(const FieldRepetitionType::type val) {
+  this->repetition_type = val;
+__isset.repetition_type = true;
+}
+
+void SchemaElement::__set_name(const std::string& val) {
+  this->name = val;
+}
+
+void SchemaElement::__set_num_children(const int32_t val) {
+  this->num_children = val;
+__isset.num_children = true;
+}
+
+void SchemaElement::__set_converted_type(const ConvertedType::type val) {
+  this->converted_type = val;
+__isset.converted_type = true;
+}
+
+void SchemaElement::__set_scale(const int32_t val) {
+  this->scale = val;
+__isset.scale = true;
+}
+
+void SchemaElement::__set_precision(const int32_t val) {
+  this->precision = val;
+__isset.precision = true;
+}
+
+void SchemaElement::__set_field_id(const int32_t val) {
+  this->field_id = val;
+__isset.field_id = true;
+}
+
+void SchemaElement::__set_logicalType(const LogicalType& val) {
+  this->logicalType = val;
+__isset.logicalType = true;
+}
+std::ostream& operator<<(std::ostream& out, const SchemaElement& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t SchemaElement::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_name = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast38;
+          xfer += iprot->readI32(ecast38);
+          this->type = (Type::type)ecast38;
+          this->__isset.type = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->type_length);
+          this->__isset.type_length = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast39;
+          xfer += iprot->readI32(ecast39);
+          this->repetition_type = (FieldRepetitionType::type)ecast39;
+          this->__isset.repetition_type = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readString(this->name);
+          isset_name = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->num_children);
+          this->__isset.num_children = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 6:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast40;
+          xfer += iprot->readI32(ecast40);
+          this->converted_type = (ConvertedType::type)ecast40;
+          this->__isset.converted_type = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 7:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->scale);
+          this->__isset.scale = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 8:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->precision);
+          this->__isset.precision = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 9:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->field_id);
+          this->__isset.field_id = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 10:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->logicalType.read(iprot);
+          this->__isset.logicalType = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_name)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t SchemaElement::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("SchemaElement");
+
+  if (this->__isset.type) {
+    xfer += oprot->writeFieldBegin("type", ::lbug_apache::thrift::protocol::T_I32, 1);
+    xfer += oprot->writeI32((int32_t)this->type);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.type_length) {
+    xfer += oprot->writeFieldBegin("type_length", ::lbug_apache::thrift::protocol::T_I32, 2);
+    xfer += oprot->writeI32(this->type_length);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.repetition_type) {
+    xfer += oprot->writeFieldBegin("repetition_type", ::lbug_apache::thrift::protocol::T_I32, 3);
+    xfer += oprot->writeI32((int32_t)this->repetition_type);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldBegin("name", ::lbug_apache::thrift::protocol::T_STRING, 4);
+  xfer += oprot->writeString(this->name);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.num_children) {
+    xfer += oprot->writeFieldBegin("num_children", ::lbug_apache::thrift::protocol::T_I32, 5);
+    xfer += oprot->writeI32(this->num_children);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.converted_type) {
+    xfer += oprot->writeFieldBegin("converted_type", ::lbug_apache::thrift::protocol::T_I32, 6);
+    xfer += oprot->writeI32((int32_t)this->converted_type);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.scale) {
+    xfer += oprot->writeFieldBegin("scale", ::lbug_apache::thrift::protocol::T_I32, 7);
+    xfer += oprot->writeI32(this->scale);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.precision) {
+    xfer += oprot->writeFieldBegin("precision", ::lbug_apache::thrift::protocol::T_I32, 8);
+    xfer += oprot->writeI32(this->precision);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.field_id) {
+    xfer += oprot->writeFieldBegin("field_id", ::lbug_apache::thrift::protocol::T_I32, 9);
+    xfer += oprot->writeI32(this->field_id);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.logicalType) {
+    xfer += oprot->writeFieldBegin("logicalType", ::lbug_apache::thrift::protocol::T_STRUCT, 10);
+    xfer += this->logicalType.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(SchemaElement &a, SchemaElement &b) {
+  using ::std::swap;
+  swap(a.type, b.type);
+  swap(a.type_length, b.type_length);
+  swap(a.repetition_type, b.repetition_type);
+  swap(a.name, b.name);
+  swap(a.num_children, b.num_children);
+  swap(a.converted_type, b.converted_type);
+  swap(a.scale, b.scale);
+  swap(a.precision, b.precision);
+  swap(a.field_id, b.field_id);
+  swap(a.logicalType, b.logicalType);
+  swap(a.__isset, b.__isset);
+}
+
+SchemaElement::SchemaElement(const SchemaElement& other41) {
+  type = other41.type;
+  type_length = other41.type_length;
+  repetition_type = other41.repetition_type;
+  name = other41.name;
+  num_children = other41.num_children;
+  converted_type = other41.converted_type;
+  scale = other41.scale;
+  precision = other41.precision;
+  field_id = other41.field_id;
+  logicalType = other41.logicalType;
+  __isset = other41.__isset;
+}
+SchemaElement& SchemaElement::operator=(const SchemaElement& other42) {
+  type = other42.type;
+  type_length = other42.type_length;
+  repetition_type = other42.repetition_type;
+  name = other42.name;
+  num_children = other42.num_children;
+  converted_type = other42.converted_type;
+  scale = other42.scale;
+  precision = other42.precision;
+  field_id = other42.field_id;
+  logicalType = other42.logicalType;
+  __isset = other42.__isset;
+  return *this;
+}
+void SchemaElement::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "SchemaElement(";
+  out << "type="; (__isset.type ? (out << to_string(type)) : (out << "<null>"));
+  out << ", " << "type_length="; (__isset.type_length ? (out << to_string(type_length)) : (out << "<null>"));
+  out << ", " << "repetition_type="; (__isset.repetition_type ? (out << to_string(repetition_type)) : (out << "<null>"));
+  out << ", " << "name=" << to_string(name);
+  out << ", " << "num_children="; (__isset.num_children ? (out << to_string(num_children)) : (out << "<null>"));
+  out << ", " << "converted_type="; (__isset.converted_type ? (out << to_string(converted_type)) : (out << "<null>"));
+  out << ", " << "scale="; (__isset.scale ? (out << to_string(scale)) : (out << "<null>"));
+  out << ", " << "precision="; (__isset.precision ? (out << to_string(precision)) : (out << "<null>"));
+  out << ", " << "field_id="; (__isset.field_id ? (out << to_string(field_id)) : (out << "<null>"));
+  out << ", " << "logicalType="; (__isset.logicalType ? (out << to_string(logicalType)) : (out << "<null>"));
+  out << ")";
+}
+
+
+DataPageHeader::~DataPageHeader() throw() {
+}
+
+
+void DataPageHeader::__set_num_values(const int32_t val) {
+  this->num_values = val;
+}
+
+void DataPageHeader::__set_encoding(const Encoding::type val) {
+  this->encoding = val;
+}
+
+void DataPageHeader::__set_definition_level_encoding(const Encoding::type val) {
+  this->definition_level_encoding = val;
+}
+
+void DataPageHeader::__set_repetition_level_encoding(const Encoding::type val) {
+  this->repetition_level_encoding = val;
+}
+
+void DataPageHeader::__set_statistics(const Statistics& val) {
+  this->statistics = val;
+__isset.statistics = true;
+}
+std::ostream& operator<<(std::ostream& out, const DataPageHeader& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t DataPageHeader::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_num_values = false;
+  bool isset_encoding = false;
+  bool isset_definition_level_encoding = false;
+  bool isset_repetition_level_encoding = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->num_values);
+          isset_num_values = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast43;
+          xfer += iprot->readI32(ecast43);
+          this->encoding = (Encoding::type)ecast43;
+          isset_encoding = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast44;
+          xfer += iprot->readI32(ecast44);
+          this->definition_level_encoding = (Encoding::type)ecast44;
+          isset_definition_level_encoding = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast45;
+          xfer += iprot->readI32(ecast45);
+          this->repetition_level_encoding = (Encoding::type)ecast45;
+          isset_repetition_level_encoding = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->statistics.read(iprot);
+          this->__isset.statistics = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_num_values)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_encoding)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_definition_level_encoding)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_repetition_level_encoding)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t DataPageHeader::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("DataPageHeader");
+
+  xfer += oprot->writeFieldBegin("num_values", ::lbug_apache::thrift::protocol::T_I32, 1);
+  xfer += oprot->writeI32(this->num_values);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("encoding", ::lbug_apache::thrift::protocol::T_I32, 2);
+  xfer += oprot->writeI32((int32_t)this->encoding);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("definition_level_encoding", ::lbug_apache::thrift::protocol::T_I32, 3);
+  xfer += oprot->writeI32((int32_t)this->definition_level_encoding);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("repetition_level_encoding", ::lbug_apache::thrift::protocol::T_I32, 4);
+  xfer += oprot->writeI32((int32_t)this->repetition_level_encoding);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.statistics) {
+    xfer += oprot->writeFieldBegin("statistics", ::lbug_apache::thrift::protocol::T_STRUCT, 5);
+    xfer += this->statistics.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(DataPageHeader &a, DataPageHeader &b) {
+  using ::std::swap;
+  swap(a.num_values, b.num_values);
+  swap(a.encoding, b.encoding);
+  swap(a.definition_level_encoding, b.definition_level_encoding);
+  swap(a.repetition_level_encoding, b.repetition_level_encoding);
+  swap(a.statistics, b.statistics);
+  swap(a.__isset, b.__isset);
+}
+
+DataPageHeader::DataPageHeader(const DataPageHeader& other46) {
+  num_values = other46.num_values;
+  encoding = other46.encoding;
+  definition_level_encoding = other46.definition_level_encoding;
+  repetition_level_encoding = other46.repetition_level_encoding;
+  statistics = other46.statistics;
+  __isset = other46.__isset;
+}
+DataPageHeader& DataPageHeader::operator=(const DataPageHeader& other47) {
+  num_values = other47.num_values;
+  encoding = other47.encoding;
+  definition_level_encoding = other47.definition_level_encoding;
+  repetition_level_encoding = other47.repetition_level_encoding;
+  statistics = other47.statistics;
+  __isset = other47.__isset;
+  return *this;
+}
+void DataPageHeader::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "DataPageHeader(";
+  out << "num_values=" << to_string(num_values);
+  out << ", " << "encoding=" << to_string(encoding);
+  out << ", " << "definition_level_encoding=" << to_string(definition_level_encoding);
+  out << ", " << "repetition_level_encoding=" << to_string(repetition_level_encoding);
+  out << ", " << "statistics="; (__isset.statistics ? (out << to_string(statistics)) : (out << "<null>"));
+  out << ")";
+}
+
+
+IndexPageHeader::~IndexPageHeader() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const IndexPageHeader& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t IndexPageHeader::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t IndexPageHeader::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("IndexPageHeader");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(IndexPageHeader &a, IndexPageHeader &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+IndexPageHeader::IndexPageHeader(const IndexPageHeader& other48) {
+  (void) other48;
+}
+IndexPageHeader& IndexPageHeader::operator=(const IndexPageHeader& other49) {
+  (void) other49;
+  return *this;
+}
+void IndexPageHeader::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "IndexPageHeader(";
+  out << ")";
+}
+
+
+DictionaryPageHeader::~DictionaryPageHeader() throw() {
+}
+
+
+void DictionaryPageHeader::__set_num_values(const int32_t val) {
+  this->num_values = val;
+}
+
+void DictionaryPageHeader::__set_encoding(const Encoding::type val) {
+  this->encoding = val;
+}
+
+void DictionaryPageHeader::__set_is_sorted(const bool val) {
+  this->is_sorted = val;
+__isset.is_sorted = true;
+}
+std::ostream& operator<<(std::ostream& out, const DictionaryPageHeader& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t DictionaryPageHeader::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_num_values = false;
+  bool isset_encoding = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->num_values);
+          isset_num_values = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast50;
+          xfer += iprot->readI32(ecast50);
+          this->encoding = (Encoding::type)ecast50;
+          isset_encoding = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BOOL) {
+          xfer += iprot->readBool(this->is_sorted);
+          this->__isset.is_sorted = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_num_values)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_encoding)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t DictionaryPageHeader::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("DictionaryPageHeader");
+
+  xfer += oprot->writeFieldBegin("num_values", ::lbug_apache::thrift::protocol::T_I32, 1);
+  xfer += oprot->writeI32(this->num_values);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("encoding", ::lbug_apache::thrift::protocol::T_I32, 2);
+  xfer += oprot->writeI32((int32_t)this->encoding);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.is_sorted) {
+    xfer += oprot->writeFieldBegin("is_sorted", ::lbug_apache::thrift::protocol::T_BOOL, 3);
+    xfer += oprot->writeBool(this->is_sorted);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(DictionaryPageHeader &a, DictionaryPageHeader &b) {
+  using ::std::swap;
+  swap(a.num_values, b.num_values);
+  swap(a.encoding, b.encoding);
+  swap(a.is_sorted, b.is_sorted);
+  swap(a.__isset, b.__isset);
+}
+
+DictionaryPageHeader::DictionaryPageHeader(const DictionaryPageHeader& other51) {
+  num_values = other51.num_values;
+  encoding = other51.encoding;
+  is_sorted = other51.is_sorted;
+  __isset = other51.__isset;
+}
+DictionaryPageHeader& DictionaryPageHeader::operator=(const DictionaryPageHeader& other52) {
+  num_values = other52.num_values;
+  encoding = other52.encoding;
+  is_sorted = other52.is_sorted;
+  __isset = other52.__isset;
+  return *this;
+}
+void DictionaryPageHeader::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "DictionaryPageHeader(";
+  out << "num_values=" << to_string(num_values);
+  out << ", " << "encoding=" << to_string(encoding);
+  out << ", " << "is_sorted="; (__isset.is_sorted ? (out << to_string(is_sorted)) : (out << "<null>"));
+  out << ")";
+}
+
+
+DataPageHeaderV2::~DataPageHeaderV2() throw() {
+}
+
+
+void DataPageHeaderV2::__set_num_values(const int32_t val) {
+  this->num_values = val;
+}
+
+void DataPageHeaderV2::__set_num_nulls(const int32_t val) {
+  this->num_nulls = val;
+}
+
+void DataPageHeaderV2::__set_num_rows(const int32_t val) {
+  this->num_rows = val;
+}
+
+void DataPageHeaderV2::__set_encoding(const Encoding::type val) {
+  this->encoding = val;
+}
+
+void DataPageHeaderV2::__set_definition_levels_byte_length(const int32_t val) {
+  this->definition_levels_byte_length = val;
+}
+
+void DataPageHeaderV2::__set_repetition_levels_byte_length(const int32_t val) {
+  this->repetition_levels_byte_length = val;
+}
+
+void DataPageHeaderV2::__set_is_compressed(const bool val) {
+  this->is_compressed = val;
+__isset.is_compressed = true;
+}
+
+void DataPageHeaderV2::__set_statistics(const Statistics& val) {
+  this->statistics = val;
+__isset.statistics = true;
+}
+std::ostream& operator<<(std::ostream& out, const DataPageHeaderV2& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t DataPageHeaderV2::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_num_values = false;
+  bool isset_num_nulls = false;
+  bool isset_num_rows = false;
+  bool isset_encoding = false;
+  bool isset_definition_levels_byte_length = false;
+  bool isset_repetition_levels_byte_length = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->num_values);
+          isset_num_values = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->num_nulls);
+          isset_num_nulls = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->num_rows);
+          isset_num_rows = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast53;
+          xfer += iprot->readI32(ecast53);
+          this->encoding = (Encoding::type)ecast53;
+          isset_encoding = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->definition_levels_byte_length);
+          isset_definition_levels_byte_length = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 6:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->repetition_levels_byte_length);
+          isset_repetition_levels_byte_length = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 7:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BOOL) {
+          xfer += iprot->readBool(this->is_compressed);
+          this->__isset.is_compressed = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 8:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->statistics.read(iprot);
+          this->__isset.statistics = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_num_values)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_num_nulls)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_num_rows)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_encoding)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_definition_levels_byte_length)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_repetition_levels_byte_length)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t DataPageHeaderV2::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("DataPageHeaderV2");
+
+  xfer += oprot->writeFieldBegin("num_values", ::lbug_apache::thrift::protocol::T_I32, 1);
+  xfer += oprot->writeI32(this->num_values);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("num_nulls", ::lbug_apache::thrift::protocol::T_I32, 2);
+  xfer += oprot->writeI32(this->num_nulls);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("num_rows", ::lbug_apache::thrift::protocol::T_I32, 3);
+  xfer += oprot->writeI32(this->num_rows);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("encoding", ::lbug_apache::thrift::protocol::T_I32, 4);
+  xfer += oprot->writeI32((int32_t)this->encoding);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("definition_levels_byte_length", ::lbug_apache::thrift::protocol::T_I32, 5);
+  xfer += oprot->writeI32(this->definition_levels_byte_length);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("repetition_levels_byte_length", ::lbug_apache::thrift::protocol::T_I32, 6);
+  xfer += oprot->writeI32(this->repetition_levels_byte_length);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.is_compressed) {
+    xfer += oprot->writeFieldBegin("is_compressed", ::lbug_apache::thrift::protocol::T_BOOL, 7);
+    xfer += oprot->writeBool(this->is_compressed);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.statistics) {
+    xfer += oprot->writeFieldBegin("statistics", ::lbug_apache::thrift::protocol::T_STRUCT, 8);
+    xfer += this->statistics.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(DataPageHeaderV2 &a, DataPageHeaderV2 &b) {
+  using ::std::swap;
+  swap(a.num_values, b.num_values);
+  swap(a.num_nulls, b.num_nulls);
+  swap(a.num_rows, b.num_rows);
+  swap(a.encoding, b.encoding);
+  swap(a.definition_levels_byte_length, b.definition_levels_byte_length);
+  swap(a.repetition_levels_byte_length, b.repetition_levels_byte_length);
+  swap(a.is_compressed, b.is_compressed);
+  swap(a.statistics, b.statistics);
+  swap(a.__isset, b.__isset);
+}
+
+DataPageHeaderV2::DataPageHeaderV2(const DataPageHeaderV2& other54) {
+  num_values = other54.num_values;
+  num_nulls = other54.num_nulls;
+  num_rows = other54.num_rows;
+  encoding = other54.encoding;
+  definition_levels_byte_length = other54.definition_levels_byte_length;
+  repetition_levels_byte_length = other54.repetition_levels_byte_length;
+  is_compressed = other54.is_compressed;
+  statistics = other54.statistics;
+  __isset = other54.__isset;
+}
+DataPageHeaderV2& DataPageHeaderV2::operator=(const DataPageHeaderV2& other55) {
+  num_values = other55.num_values;
+  num_nulls = other55.num_nulls;
+  num_rows = other55.num_rows;
+  encoding = other55.encoding;
+  definition_levels_byte_length = other55.definition_levels_byte_length;
+  repetition_levels_byte_length = other55.repetition_levels_byte_length;
+  is_compressed = other55.is_compressed;
+  statistics = other55.statistics;
+  __isset = other55.__isset;
+  return *this;
+}
+void DataPageHeaderV2::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "DataPageHeaderV2(";
+  out << "num_values=" << to_string(num_values);
+  out << ", " << "num_nulls=" << to_string(num_nulls);
+  out << ", " << "num_rows=" << to_string(num_rows);
+  out << ", " << "encoding=" << to_string(encoding);
+  out << ", " << "definition_levels_byte_length=" << to_string(definition_levels_byte_length);
+  out << ", " << "repetition_levels_byte_length=" << to_string(repetition_levels_byte_length);
+  out << ", " << "is_compressed="; (__isset.is_compressed ? (out << to_string(is_compressed)) : (out << "<null>"));
+  out << ", " << "statistics="; (__isset.statistics ? (out << to_string(statistics)) : (out << "<null>"));
+  out << ")";
+}
+
+
+PageHeader::~PageHeader() throw() {
+}
+
+
+void PageHeader::__set_type(const PageType::type val) {
+  this->type = val;
+}
+
+void PageHeader::__set_uncompressed_page_size(const int32_t val) {
+  this->uncompressed_page_size = val;
+}
+
+void PageHeader::__set_compressed_page_size(const int32_t val) {
+  this->compressed_page_size = val;
+}
+
+void PageHeader::__set_crc(const int32_t val) {
+  this->crc = val;
+__isset.crc = true;
+}
+
+void PageHeader::__set_data_page_header(const DataPageHeader& val) {
+  this->data_page_header = val;
+__isset.data_page_header = true;
+}
+
+void PageHeader::__set_index_page_header(const IndexPageHeader& val) {
+  this->index_page_header = val;
+__isset.index_page_header = true;
+}
+
+void PageHeader::__set_dictionary_page_header(const DictionaryPageHeader& val) {
+  this->dictionary_page_header = val;
+__isset.dictionary_page_header = true;
+}
+
+void PageHeader::__set_data_page_header_v2(const DataPageHeaderV2& val) {
+  this->data_page_header_v2 = val;
+__isset.data_page_header_v2 = true;
+}
+std::ostream& operator<<(std::ostream& out, const PageHeader& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t PageHeader::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_type = false;
+  bool isset_uncompressed_page_size = false;
+  bool isset_compressed_page_size = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast56;
+          xfer += iprot->readI32(ecast56);
+          this->type = (PageType::type)ecast56;
+          isset_type = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->uncompressed_page_size);
+          isset_uncompressed_page_size = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->compressed_page_size);
+          isset_compressed_page_size = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->crc);
+          this->__isset.crc = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->data_page_header.read(iprot);
+          this->__isset.data_page_header = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 6:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->index_page_header.read(iprot);
+          this->__isset.index_page_header = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 7:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->dictionary_page_header.read(iprot);
+          this->__isset.dictionary_page_header = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 8:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->data_page_header_v2.read(iprot);
+          this->__isset.data_page_header_v2 = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_type)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_uncompressed_page_size)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_compressed_page_size)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t PageHeader::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("PageHeader");
+
+  xfer += oprot->writeFieldBegin("type", ::lbug_apache::thrift::protocol::T_I32, 1);
+  xfer += oprot->writeI32((int32_t)this->type);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("uncompressed_page_size", ::lbug_apache::thrift::protocol::T_I32, 2);
+  xfer += oprot->writeI32(this->uncompressed_page_size);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("compressed_page_size", ::lbug_apache::thrift::protocol::T_I32, 3);
+  xfer += oprot->writeI32(this->compressed_page_size);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.crc) {
+    xfer += oprot->writeFieldBegin("crc", ::lbug_apache::thrift::protocol::T_I32, 4);
+    xfer += oprot->writeI32(this->crc);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.data_page_header) {
+    xfer += oprot->writeFieldBegin("data_page_header", ::lbug_apache::thrift::protocol::T_STRUCT, 5);
+    xfer += this->data_page_header.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.index_page_header) {
+    xfer += oprot->writeFieldBegin("index_page_header", ::lbug_apache::thrift::protocol::T_STRUCT, 6);
+    xfer += this->index_page_header.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.dictionary_page_header) {
+    xfer += oprot->writeFieldBegin("dictionary_page_header", ::lbug_apache::thrift::protocol::T_STRUCT, 7);
+    xfer += this->dictionary_page_header.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.data_page_header_v2) {
+    xfer += oprot->writeFieldBegin("data_page_header_v2", ::lbug_apache::thrift::protocol::T_STRUCT, 8);
+    xfer += this->data_page_header_v2.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(PageHeader &a, PageHeader &b) {
+  using ::std::swap;
+  swap(a.type, b.type);
+  swap(a.uncompressed_page_size, b.uncompressed_page_size);
+  swap(a.compressed_page_size, b.compressed_page_size);
+  swap(a.crc, b.crc);
+  swap(a.data_page_header, b.data_page_header);
+  swap(a.index_page_header, b.index_page_header);
+  swap(a.dictionary_page_header, b.dictionary_page_header);
+  swap(a.data_page_header_v2, b.data_page_header_v2);
+  swap(a.__isset, b.__isset);
+}
+
+PageHeader::PageHeader(const PageHeader& other57) {
+  type = other57.type;
+  uncompressed_page_size = other57.uncompressed_page_size;
+  compressed_page_size = other57.compressed_page_size;
+  crc = other57.crc;
+  data_page_header = other57.data_page_header;
+  index_page_header = other57.index_page_header;
+  dictionary_page_header = other57.dictionary_page_header;
+  data_page_header_v2 = other57.data_page_header_v2;
+  __isset = other57.__isset;
+}
+PageHeader& PageHeader::operator=(const PageHeader& other58) {
+  type = other58.type;
+  uncompressed_page_size = other58.uncompressed_page_size;
+  compressed_page_size = other58.compressed_page_size;
+  crc = other58.crc;
+  data_page_header = other58.data_page_header;
+  index_page_header = other58.index_page_header;
+  dictionary_page_header = other58.dictionary_page_header;
+  data_page_header_v2 = other58.data_page_header_v2;
+  __isset = other58.__isset;
+  return *this;
+}
+void PageHeader::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "PageHeader(";
+  out << "type=" << to_string(type);
+  out << ", " << "uncompressed_page_size=" << to_string(uncompressed_page_size);
+  out << ", " << "compressed_page_size=" << to_string(compressed_page_size);
+  out << ", " << "crc="; (__isset.crc ? (out << to_string(crc)) : (out << "<null>"));
+  out << ", " << "data_page_header="; (__isset.data_page_header ? (out << to_string(data_page_header)) : (out << "<null>"));
+  out << ", " << "index_page_header="; (__isset.index_page_header ? (out << to_string(index_page_header)) : (out << "<null>"));
+  out << ", " << "dictionary_page_header="; (__isset.dictionary_page_header ? (out << to_string(dictionary_page_header)) : (out << "<null>"));
+  out << ", " << "data_page_header_v2="; (__isset.data_page_header_v2 ? (out << to_string(data_page_header_v2)) : (out << "<null>"));
+  out << ")";
+}
+
+
+KeyValue::~KeyValue() throw() {
+}
+
+
+void KeyValue::__set_key(const std::string& val) {
+  this->key = val;
+}
+
+void KeyValue::__set_value(const std::string& val) {
+  this->value = val;
+__isset.value = true;
+}
+std::ostream& operator<<(std::ostream& out, const KeyValue& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t KeyValue::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_key = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readString(this->key);
+          isset_key = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readString(this->value);
+          this->__isset.value = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_key)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t KeyValue::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("KeyValue");
+
+  xfer += oprot->writeFieldBegin("key", ::lbug_apache::thrift::protocol::T_STRING, 1);
+  xfer += oprot->writeString(this->key);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.value) {
+    xfer += oprot->writeFieldBegin("value", ::lbug_apache::thrift::protocol::T_STRING, 2);
+    xfer += oprot->writeString(this->value);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(KeyValue &a, KeyValue &b) {
+  using ::std::swap;
+  swap(a.key, b.key);
+  swap(a.value, b.value);
+  swap(a.__isset, b.__isset);
+}
+
+KeyValue::KeyValue(const KeyValue& other59) {
+  key = other59.key;
+  value = other59.value;
+  __isset = other59.__isset;
+}
+KeyValue& KeyValue::operator=(const KeyValue& other60) {
+  key = other60.key;
+  value = other60.value;
+  __isset = other60.__isset;
+  return *this;
+}
+void KeyValue::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "KeyValue(";
+  out << "key=" << to_string(key);
+  out << ", " << "value="; (__isset.value ? (out << to_string(value)) : (out << "<null>"));
+  out << ")";
+}
+
+
+SortingColumn::~SortingColumn() throw() {
+}
+
+
+void SortingColumn::__set_column_idx(const int32_t val) {
+  this->column_idx = val;
+}
+
+void SortingColumn::__set_descending(const bool val) {
+  this->descending = val;
+}
+
+void SortingColumn::__set_nulls_first(const bool val) {
+  this->nulls_first = val;
+}
+std::ostream& operator<<(std::ostream& out, const SortingColumn& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t SortingColumn::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_column_idx = false;
+  bool isset_descending = false;
+  bool isset_nulls_first = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->column_idx);
+          isset_column_idx = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BOOL) {
+          xfer += iprot->readBool(this->descending);
+          isset_descending = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BOOL) {
+          xfer += iprot->readBool(this->nulls_first);
+          isset_nulls_first = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_column_idx)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_descending)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_nulls_first)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t SortingColumn::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("SortingColumn");
+
+  xfer += oprot->writeFieldBegin("column_idx", ::lbug_apache::thrift::protocol::T_I32, 1);
+  xfer += oprot->writeI32(this->column_idx);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("descending", ::lbug_apache::thrift::protocol::T_BOOL, 2);
+  xfer += oprot->writeBool(this->descending);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("nulls_first", ::lbug_apache::thrift::protocol::T_BOOL, 3);
+  xfer += oprot->writeBool(this->nulls_first);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(SortingColumn &a, SortingColumn &b) {
+  using ::std::swap;
+  swap(a.column_idx, b.column_idx);
+  swap(a.descending, b.descending);
+  swap(a.nulls_first, b.nulls_first);
+}
+
+SortingColumn::SortingColumn(const SortingColumn& other61) {
+  column_idx = other61.column_idx;
+  descending = other61.descending;
+  nulls_first = other61.nulls_first;
+}
+SortingColumn& SortingColumn::operator=(const SortingColumn& other62) {
+  column_idx = other62.column_idx;
+  descending = other62.descending;
+  nulls_first = other62.nulls_first;
+  return *this;
+}
+void SortingColumn::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "SortingColumn(";
+  out << "column_idx=" << to_string(column_idx);
+  out << ", " << "descending=" << to_string(descending);
+  out << ", " << "nulls_first=" << to_string(nulls_first);
+  out << ")";
+}
+
+
+PageEncodingStats::~PageEncodingStats() throw() {
+}
+
+
+void PageEncodingStats::__set_page_type(const PageType::type val) {
+  this->page_type = val;
+}
+
+void PageEncodingStats::__set_encoding(const Encoding::type val) {
+  this->encoding = val;
+}
+
+void PageEncodingStats::__set_count(const int32_t val) {
+  this->count = val;
+}
+std::ostream& operator<<(std::ostream& out, const PageEncodingStats& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t PageEncodingStats::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_page_type = false;
+  bool isset_encoding = false;
+  bool isset_count = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast63;
+          xfer += iprot->readI32(ecast63);
+          this->page_type = (PageType::type)ecast63;
+          isset_page_type = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast64;
+          xfer += iprot->readI32(ecast64);
+          this->encoding = (Encoding::type)ecast64;
+          isset_encoding = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->count);
+          isset_count = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_page_type)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_encoding)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_count)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t PageEncodingStats::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("PageEncodingStats");
+
+  xfer += oprot->writeFieldBegin("page_type", ::lbug_apache::thrift::protocol::T_I32, 1);
+  xfer += oprot->writeI32((int32_t)this->page_type);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("encoding", ::lbug_apache::thrift::protocol::T_I32, 2);
+  xfer += oprot->writeI32((int32_t)this->encoding);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("count", ::lbug_apache::thrift::protocol::T_I32, 3);
+  xfer += oprot->writeI32(this->count);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(PageEncodingStats &a, PageEncodingStats &b) {
+  using ::std::swap;
+  swap(a.page_type, b.page_type);
+  swap(a.encoding, b.encoding);
+  swap(a.count, b.count);
+}
+
+PageEncodingStats::PageEncodingStats(const PageEncodingStats& other65) {
+  page_type = other65.page_type;
+  encoding = other65.encoding;
+  count = other65.count;
+}
+PageEncodingStats& PageEncodingStats::operator=(const PageEncodingStats& other66) {
+  page_type = other66.page_type;
+  encoding = other66.encoding;
+  count = other66.count;
+  return *this;
+}
+void PageEncodingStats::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "PageEncodingStats(";
+  out << "page_type=" << to_string(page_type);
+  out << ", " << "encoding=" << to_string(encoding);
+  out << ", " << "count=" << to_string(count);
+  out << ")";
+}
+
+
+ColumnMetaData::~ColumnMetaData() throw() {
+}
+
+
+void ColumnMetaData::__set_type(const Type::type val) {
+  this->type = val;
+}
+
+void ColumnMetaData::__set_encodings(const std::vector<Encoding::type> & val) {
+  this->encodings = val;
+}
+
+void ColumnMetaData::__set_path_in_schema(const std::vector<std::string> & val) {
+  this->path_in_schema = val;
+}
+
+void ColumnMetaData::__set_codec(const CompressionCodec::type val) {
+  this->codec = val;
+}
+
+void ColumnMetaData::__set_num_values(const int64_t val) {
+  this->num_values = val;
+}
+
+void ColumnMetaData::__set_total_uncompressed_size(const int64_t val) {
+  this->total_uncompressed_size = val;
+}
+
+void ColumnMetaData::__set_total_compressed_size(const int64_t val) {
+  this->total_compressed_size = val;
+}
+
+void ColumnMetaData::__set_key_value_metadata(const std::vector<KeyValue> & val) {
+  this->key_value_metadata = val;
+__isset.key_value_metadata = true;
+}
+
+void ColumnMetaData::__set_data_page_offset(const int64_t val) {
+  this->data_page_offset = val;
+}
+
+void ColumnMetaData::__set_index_page_offset(const int64_t val) {
+  this->index_page_offset = val;
+__isset.index_page_offset = true;
+}
+
+void ColumnMetaData::__set_dictionary_page_offset(const int64_t val) {
+  this->dictionary_page_offset = val;
+__isset.dictionary_page_offset = true;
+}
+
+void ColumnMetaData::__set_statistics(const Statistics& val) {
+  this->statistics = val;
+__isset.statistics = true;
+}
+
+void ColumnMetaData::__set_encoding_stats(const std::vector<PageEncodingStats> & val) {
+  this->encoding_stats = val;
+__isset.encoding_stats = true;
+}
+std::ostream& operator<<(std::ostream& out, const ColumnMetaData& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t ColumnMetaData::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_type = false;
+  bool isset_encodings = false;
+  bool isset_path_in_schema = false;
+  bool isset_codec = false;
+  bool isset_num_values = false;
+  bool isset_total_uncompressed_size = false;
+  bool isset_total_compressed_size = false;
+  bool isset_data_page_offset = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast67;
+          xfer += iprot->readI32(ecast67);
+          this->type = (Type::type)ecast67;
+          isset_type = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->encodings.clear();
+            uint32_t _size68;
+            ::lbug_apache::thrift::protocol::TType _etype71;
+            xfer += iprot->readListBegin(_etype71, _size68);
+            this->encodings.resize(_size68);
+            uint32_t _i72;
+            for (_i72 = 0; _i72 < _size68; ++_i72)
+            {
+              int32_t ecast73;
+              xfer += iprot->readI32(ecast73);
+              this->encodings[_i72] = (Encoding::type)ecast73;
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_encodings = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->path_in_schema.clear();
+            uint32_t _size74;
+            ::lbug_apache::thrift::protocol::TType _etype77;
+            xfer += iprot->readListBegin(_etype77, _size74);
+            this->path_in_schema.resize(_size74);
+            uint32_t _i78;
+            for (_i78 = 0; _i78 < _size74; ++_i78)
+            {
+              xfer += iprot->readString(this->path_in_schema[_i78]);
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_path_in_schema = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast79;
+          xfer += iprot->readI32(ecast79);
+          this->codec = (CompressionCodec::type)ecast79;
+          isset_codec = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->num_values);
+          isset_num_values = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 6:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->total_uncompressed_size);
+          isset_total_uncompressed_size = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 7:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->total_compressed_size);
+          isset_total_compressed_size = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 8:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->key_value_metadata.clear();
+            uint32_t _size80;
+            ::lbug_apache::thrift::protocol::TType _etype83;
+            xfer += iprot->readListBegin(_etype83, _size80);
+            this->key_value_metadata.resize(_size80);
+            uint32_t _i84;
+            for (_i84 = 0; _i84 < _size80; ++_i84)
+            {
+              xfer += this->key_value_metadata[_i84].read(iprot);
+            }
+            xfer += iprot->readListEnd();
+          }
+          this->__isset.key_value_metadata = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 9:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->data_page_offset);
+          isset_data_page_offset = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 10:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->index_page_offset);
+          this->__isset.index_page_offset = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 11:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->dictionary_page_offset);
+          this->__isset.dictionary_page_offset = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 12:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->statistics.read(iprot);
+          this->__isset.statistics = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 13:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->encoding_stats.clear();
+            uint32_t _size85;
+            ::lbug_apache::thrift::protocol::TType _etype88;
+            xfer += iprot->readListBegin(_etype88, _size85);
+            this->encoding_stats.resize(_size85);
+            uint32_t _i89;
+            for (_i89 = 0; _i89 < _size85; ++_i89)
+            {
+              xfer += this->encoding_stats[_i89].read(iprot);
+            }
+            xfer += iprot->readListEnd();
+          }
+          this->__isset.encoding_stats = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_type)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_encodings)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_path_in_schema)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_codec)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_num_values)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_total_uncompressed_size)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_total_compressed_size)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_data_page_offset)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t ColumnMetaData::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("ColumnMetaData");
+
+  xfer += oprot->writeFieldBegin("type", ::lbug_apache::thrift::protocol::T_I32, 1);
+  xfer += oprot->writeI32((int32_t)this->type);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("encodings", ::lbug_apache::thrift::protocol::T_LIST, 2);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_I32, static_cast<uint32_t>(this->encodings.size()));
+    std::vector<Encoding::type> ::const_iterator _iter90;
+    for (_iter90 = this->encodings.begin(); _iter90 != this->encodings.end(); ++_iter90)
+    {
+      xfer += oprot->writeI32((int32_t)(*_iter90));
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("path_in_schema", ::lbug_apache::thrift::protocol::T_LIST, 3);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRING, static_cast<uint32_t>(this->path_in_schema.size()));
+    std::vector<std::string> ::const_iterator _iter91;
+    for (_iter91 = this->path_in_schema.begin(); _iter91 != this->path_in_schema.end(); ++_iter91)
+    {
+      xfer += oprot->writeString((*_iter91));
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("codec", ::lbug_apache::thrift::protocol::T_I32, 4);
+  xfer += oprot->writeI32((int32_t)this->codec);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("num_values", ::lbug_apache::thrift::protocol::T_I64, 5);
+  xfer += oprot->writeI64(this->num_values);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("total_uncompressed_size", ::lbug_apache::thrift::protocol::T_I64, 6);
+  xfer += oprot->writeI64(this->total_uncompressed_size);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("total_compressed_size", ::lbug_apache::thrift::protocol::T_I64, 7);
+  xfer += oprot->writeI64(this->total_compressed_size);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.key_value_metadata) {
+    xfer += oprot->writeFieldBegin("key_value_metadata", ::lbug_apache::thrift::protocol::T_LIST, 8);
+    {
+      xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRUCT, static_cast<uint32_t>(this->key_value_metadata.size()));
+      std::vector<KeyValue> ::const_iterator _iter92;
+      for (_iter92 = this->key_value_metadata.begin(); _iter92 != this->key_value_metadata.end(); ++_iter92)
+      {
+        xfer += (*_iter92).write(oprot);
+      }
+      xfer += oprot->writeListEnd();
+    }
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldBegin("data_page_offset", ::lbug_apache::thrift::protocol::T_I64, 9);
+  xfer += oprot->writeI64(this->data_page_offset);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.index_page_offset) {
+    xfer += oprot->writeFieldBegin("index_page_offset", ::lbug_apache::thrift::protocol::T_I64, 10);
+    xfer += oprot->writeI64(this->index_page_offset);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.dictionary_page_offset) {
+    xfer += oprot->writeFieldBegin("dictionary_page_offset", ::lbug_apache::thrift::protocol::T_I64, 11);
+    xfer += oprot->writeI64(this->dictionary_page_offset);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.statistics) {
+    xfer += oprot->writeFieldBegin("statistics", ::lbug_apache::thrift::protocol::T_STRUCT, 12);
+    xfer += this->statistics.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.encoding_stats) {
+    xfer += oprot->writeFieldBegin("encoding_stats", ::lbug_apache::thrift::protocol::T_LIST, 13);
+    {
+      xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRUCT, static_cast<uint32_t>(this->encoding_stats.size()));
+      std::vector<PageEncodingStats> ::const_iterator _iter93;
+      for (_iter93 = this->encoding_stats.begin(); _iter93 != this->encoding_stats.end(); ++_iter93)
+      {
+        xfer += (*_iter93).write(oprot);
+      }
+      xfer += oprot->writeListEnd();
+    }
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(ColumnMetaData &a, ColumnMetaData &b) {
+  using ::std::swap;
+  swap(a.type, b.type);
+  swap(a.encodings, b.encodings);
+  swap(a.path_in_schema, b.path_in_schema);
+  swap(a.codec, b.codec);
+  swap(a.num_values, b.num_values);
+  swap(a.total_uncompressed_size, b.total_uncompressed_size);
+  swap(a.total_compressed_size, b.total_compressed_size);
+  swap(a.key_value_metadata, b.key_value_metadata);
+  swap(a.data_page_offset, b.data_page_offset);
+  swap(a.index_page_offset, b.index_page_offset);
+  swap(a.dictionary_page_offset, b.dictionary_page_offset);
+  swap(a.statistics, b.statistics);
+  swap(a.encoding_stats, b.encoding_stats);
+  swap(a.__isset, b.__isset);
+}
+
+ColumnMetaData::ColumnMetaData(const ColumnMetaData& other94) {
+  type = other94.type;
+  encodings = other94.encodings;
+  path_in_schema = other94.path_in_schema;
+  codec = other94.codec;
+  num_values = other94.num_values;
+  total_uncompressed_size = other94.total_uncompressed_size;
+  total_compressed_size = other94.total_compressed_size;
+  key_value_metadata = other94.key_value_metadata;
+  data_page_offset = other94.data_page_offset;
+  index_page_offset = other94.index_page_offset;
+  dictionary_page_offset = other94.dictionary_page_offset;
+  statistics = other94.statistics;
+  encoding_stats = other94.encoding_stats;
+  __isset = other94.__isset;
+}
+ColumnMetaData& ColumnMetaData::operator=(const ColumnMetaData& other95) {
+  type = other95.type;
+  encodings = other95.encodings;
+  path_in_schema = other95.path_in_schema;
+  codec = other95.codec;
+  num_values = other95.num_values;
+  total_uncompressed_size = other95.total_uncompressed_size;
+  total_compressed_size = other95.total_compressed_size;
+  key_value_metadata = other95.key_value_metadata;
+  data_page_offset = other95.data_page_offset;
+  index_page_offset = other95.index_page_offset;
+  dictionary_page_offset = other95.dictionary_page_offset;
+  statistics = other95.statistics;
+  encoding_stats = other95.encoding_stats;
+  __isset = other95.__isset;
+  return *this;
+}
+void ColumnMetaData::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "ColumnMetaData(";
+  out << "type=" << to_string(type);
+  out << ", " << "encodings=" << to_string(encodings);
+  out << ", " << "path_in_schema=" << to_string(path_in_schema);
+  out << ", " << "codec=" << to_string(codec);
+  out << ", " << "num_values=" << to_string(num_values);
+  out << ", " << "total_uncompressed_size=" << to_string(total_uncompressed_size);
+  out << ", " << "total_compressed_size=" << to_string(total_compressed_size);
+  out << ", " << "key_value_metadata="; (__isset.key_value_metadata ? (out << to_string(key_value_metadata)) : (out << "<null>"));
+  out << ", " << "data_page_offset=" << to_string(data_page_offset);
+  out << ", " << "index_page_offset="; (__isset.index_page_offset ? (out << to_string(index_page_offset)) : (out << "<null>"));
+  out << ", " << "dictionary_page_offset="; (__isset.dictionary_page_offset ? (out << to_string(dictionary_page_offset)) : (out << "<null>"));
+  out << ", " << "statistics="; (__isset.statistics ? (out << to_string(statistics)) : (out << "<null>"));
+  out << ", " << "encoding_stats="; (__isset.encoding_stats ? (out << to_string(encoding_stats)) : (out << "<null>"));
+  out << ")";
+}
+
+
+EncryptionWithFooterKey::~EncryptionWithFooterKey() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const EncryptionWithFooterKey& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t EncryptionWithFooterKey::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t EncryptionWithFooterKey::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("EncryptionWithFooterKey");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(EncryptionWithFooterKey &a, EncryptionWithFooterKey &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+EncryptionWithFooterKey::EncryptionWithFooterKey(const EncryptionWithFooterKey& other96) {
+  (void) other96;
+}
+EncryptionWithFooterKey& EncryptionWithFooterKey::operator=(const EncryptionWithFooterKey& other97) {
+  (void) other97;
+  return *this;
+}
+void EncryptionWithFooterKey::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "EncryptionWithFooterKey(";
+  out << ")";
+}
+
+
+EncryptionWithColumnKey::~EncryptionWithColumnKey() throw() {
+}
+
+
+void EncryptionWithColumnKey::__set_path_in_schema(const std::vector<std::string> & val) {
+  this->path_in_schema = val;
+}
+
+void EncryptionWithColumnKey::__set_key_metadata(const std::string& val) {
+  this->key_metadata = val;
+__isset.key_metadata = true;
+}
+std::ostream& operator<<(std::ostream& out, const EncryptionWithColumnKey& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t EncryptionWithColumnKey::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_path_in_schema = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->path_in_schema.clear();
+            uint32_t _size98;
+            ::lbug_apache::thrift::protocol::TType _etype101;
+            xfer += iprot->readListBegin(_etype101, _size98);
+            this->path_in_schema.resize(_size98);
+            uint32_t _i102;
+            for (_i102 = 0; _i102 < _size98; ++_i102)
+            {
+              xfer += iprot->readString(this->path_in_schema[_i102]);
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_path_in_schema = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->key_metadata);
+          this->__isset.key_metadata = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_path_in_schema)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t EncryptionWithColumnKey::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("EncryptionWithColumnKey");
+
+  xfer += oprot->writeFieldBegin("path_in_schema", ::lbug_apache::thrift::protocol::T_LIST, 1);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRING, static_cast<uint32_t>(this->path_in_schema.size()));
+    std::vector<std::string> ::const_iterator _iter103;
+    for (_iter103 = this->path_in_schema.begin(); _iter103 != this->path_in_schema.end(); ++_iter103)
+    {
+      xfer += oprot->writeString((*_iter103));
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.key_metadata) {
+    xfer += oprot->writeFieldBegin("key_metadata", ::lbug_apache::thrift::protocol::T_STRING, 2);
+    xfer += oprot->writeBinary(this->key_metadata);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(EncryptionWithColumnKey &a, EncryptionWithColumnKey &b) {
+  using ::std::swap;
+  swap(a.path_in_schema, b.path_in_schema);
+  swap(a.key_metadata, b.key_metadata);
+  swap(a.__isset, b.__isset);
+}
+
+EncryptionWithColumnKey::EncryptionWithColumnKey(const EncryptionWithColumnKey& other104) {
+  path_in_schema = other104.path_in_schema;
+  key_metadata = other104.key_metadata;
+  __isset = other104.__isset;
+}
+EncryptionWithColumnKey& EncryptionWithColumnKey::operator=(const EncryptionWithColumnKey& other105) {
+  path_in_schema = other105.path_in_schema;
+  key_metadata = other105.key_metadata;
+  __isset = other105.__isset;
+  return *this;
+}
+void EncryptionWithColumnKey::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "EncryptionWithColumnKey(";
+  out << "path_in_schema=" << to_string(path_in_schema);
+  out << ", " << "key_metadata="; (__isset.key_metadata ? (out << to_string(key_metadata)) : (out << "<null>"));
+  out << ")";
+}
+
+
+ColumnCryptoMetaData::~ColumnCryptoMetaData() throw() {
+}
+
+
+void ColumnCryptoMetaData::__set_ENCRYPTION_WITH_FOOTER_KEY(const EncryptionWithFooterKey& val) {
+  this->ENCRYPTION_WITH_FOOTER_KEY = val;
+__isset.ENCRYPTION_WITH_FOOTER_KEY = true;
+}
+
+void ColumnCryptoMetaData::__set_ENCRYPTION_WITH_COLUMN_KEY(const EncryptionWithColumnKey& val) {
+  this->ENCRYPTION_WITH_COLUMN_KEY = val;
+__isset.ENCRYPTION_WITH_COLUMN_KEY = true;
+}
+std::ostream& operator<<(std::ostream& out, const ColumnCryptoMetaData& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t ColumnCryptoMetaData::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->ENCRYPTION_WITH_FOOTER_KEY.read(iprot);
+          this->__isset.ENCRYPTION_WITH_FOOTER_KEY = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->ENCRYPTION_WITH_COLUMN_KEY.read(iprot);
+          this->__isset.ENCRYPTION_WITH_COLUMN_KEY = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t ColumnCryptoMetaData::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("ColumnCryptoMetaData");
+
+  if (this->__isset.ENCRYPTION_WITH_FOOTER_KEY) {
+    xfer += oprot->writeFieldBegin("ENCRYPTION_WITH_FOOTER_KEY", ::lbug_apache::thrift::protocol::T_STRUCT, 1);
+    xfer += this->ENCRYPTION_WITH_FOOTER_KEY.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.ENCRYPTION_WITH_COLUMN_KEY) {
+    xfer += oprot->writeFieldBegin("ENCRYPTION_WITH_COLUMN_KEY", ::lbug_apache::thrift::protocol::T_STRUCT, 2);
+    xfer += this->ENCRYPTION_WITH_COLUMN_KEY.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(ColumnCryptoMetaData &a, ColumnCryptoMetaData &b) {
+  using ::std::swap;
+  swap(a.ENCRYPTION_WITH_FOOTER_KEY, b.ENCRYPTION_WITH_FOOTER_KEY);
+  swap(a.ENCRYPTION_WITH_COLUMN_KEY, b.ENCRYPTION_WITH_COLUMN_KEY);
+  swap(a.__isset, b.__isset);
+}
+
+ColumnCryptoMetaData::ColumnCryptoMetaData(const ColumnCryptoMetaData& other106) {
+  ENCRYPTION_WITH_FOOTER_KEY = other106.ENCRYPTION_WITH_FOOTER_KEY;
+  ENCRYPTION_WITH_COLUMN_KEY = other106.ENCRYPTION_WITH_COLUMN_KEY;
+  __isset = other106.__isset;
+}
+ColumnCryptoMetaData& ColumnCryptoMetaData::operator=(const ColumnCryptoMetaData& other107) {
+  ENCRYPTION_WITH_FOOTER_KEY = other107.ENCRYPTION_WITH_FOOTER_KEY;
+  ENCRYPTION_WITH_COLUMN_KEY = other107.ENCRYPTION_WITH_COLUMN_KEY;
+  __isset = other107.__isset;
+  return *this;
+}
+void ColumnCryptoMetaData::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "ColumnCryptoMetaData(";
+  out << "ENCRYPTION_WITH_FOOTER_KEY="; (__isset.ENCRYPTION_WITH_FOOTER_KEY ? (out << to_string(ENCRYPTION_WITH_FOOTER_KEY)) : (out << "<null>"));
+  out << ", " << "ENCRYPTION_WITH_COLUMN_KEY="; (__isset.ENCRYPTION_WITH_COLUMN_KEY ? (out << to_string(ENCRYPTION_WITH_COLUMN_KEY)) : (out << "<null>"));
+  out << ")";
+}
+
+
+ColumnChunk::~ColumnChunk() throw() {
+}
+
+
+void ColumnChunk::__set_file_path(const std::string& val) {
+  this->file_path = val;
+__isset.file_path = true;
+}
+
+void ColumnChunk::__set_file_offset(const int64_t val) {
+  this->file_offset = val;
+}
+
+void ColumnChunk::__set_meta_data(const ColumnMetaData& val) {
+  this->meta_data = val;
+__isset.meta_data = true;
+}
+
+void ColumnChunk::__set_offset_index_offset(const int64_t val) {
+  this->offset_index_offset = val;
+__isset.offset_index_offset = true;
+}
+
+void ColumnChunk::__set_offset_index_length(const int32_t val) {
+  this->offset_index_length = val;
+__isset.offset_index_length = true;
+}
+
+void ColumnChunk::__set_column_index_offset(const int64_t val) {
+  this->column_index_offset = val;
+__isset.column_index_offset = true;
+}
+
+void ColumnChunk::__set_column_index_length(const int32_t val) {
+  this->column_index_length = val;
+__isset.column_index_length = true;
+}
+
+void ColumnChunk::__set_crypto_metadata(const ColumnCryptoMetaData& val) {
+  this->crypto_metadata = val;
+__isset.crypto_metadata = true;
+}
+
+void ColumnChunk::__set_encrypted_column_metadata(const std::string& val) {
+  this->encrypted_column_metadata = val;
+__isset.encrypted_column_metadata = true;
+}
+std::ostream& operator<<(std::ostream& out, const ColumnChunk& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t ColumnChunk::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_file_offset = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readString(this->file_path);
+          this->__isset.file_path = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->file_offset);
+          isset_file_offset = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->meta_data.read(iprot);
+          this->__isset.meta_data = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->offset_index_offset);
+          this->__isset.offset_index_offset = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->offset_index_length);
+          this->__isset.offset_index_length = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 6:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->column_index_offset);
+          this->__isset.column_index_offset = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 7:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->column_index_length);
+          this->__isset.column_index_length = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 8:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->crypto_metadata.read(iprot);
+          this->__isset.crypto_metadata = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 9:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->encrypted_column_metadata);
+          this->__isset.encrypted_column_metadata = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_file_offset)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t ColumnChunk::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("ColumnChunk");
+
+  if (this->__isset.file_path) {
+    xfer += oprot->writeFieldBegin("file_path", ::lbug_apache::thrift::protocol::T_STRING, 1);
+    xfer += oprot->writeString(this->file_path);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldBegin("file_offset", ::lbug_apache::thrift::protocol::T_I64, 2);
+  xfer += oprot->writeI64(this->file_offset);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.meta_data) {
+    xfer += oprot->writeFieldBegin("meta_data", ::lbug_apache::thrift::protocol::T_STRUCT, 3);
+    xfer += this->meta_data.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.offset_index_offset) {
+    xfer += oprot->writeFieldBegin("offset_index_offset", ::lbug_apache::thrift::protocol::T_I64, 4);
+    xfer += oprot->writeI64(this->offset_index_offset);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.offset_index_length) {
+    xfer += oprot->writeFieldBegin("offset_index_length", ::lbug_apache::thrift::protocol::T_I32, 5);
+    xfer += oprot->writeI32(this->offset_index_length);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.column_index_offset) {
+    xfer += oprot->writeFieldBegin("column_index_offset", ::lbug_apache::thrift::protocol::T_I64, 6);
+    xfer += oprot->writeI64(this->column_index_offset);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.column_index_length) {
+    xfer += oprot->writeFieldBegin("column_index_length", ::lbug_apache::thrift::protocol::T_I32, 7);
+    xfer += oprot->writeI32(this->column_index_length);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.crypto_metadata) {
+    xfer += oprot->writeFieldBegin("crypto_metadata", ::lbug_apache::thrift::protocol::T_STRUCT, 8);
+    xfer += this->crypto_metadata.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.encrypted_column_metadata) {
+    xfer += oprot->writeFieldBegin("encrypted_column_metadata", ::lbug_apache::thrift::protocol::T_STRING, 9);
+    xfer += oprot->writeBinary(this->encrypted_column_metadata);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(ColumnChunk &a, ColumnChunk &b) {
+  using ::std::swap;
+  swap(a.file_path, b.file_path);
+  swap(a.file_offset, b.file_offset);
+  swap(a.meta_data, b.meta_data);
+  swap(a.offset_index_offset, b.offset_index_offset);
+  swap(a.offset_index_length, b.offset_index_length);
+  swap(a.column_index_offset, b.column_index_offset);
+  swap(a.column_index_length, b.column_index_length);
+  swap(a.crypto_metadata, b.crypto_metadata);
+  swap(a.encrypted_column_metadata, b.encrypted_column_metadata);
+  swap(a.__isset, b.__isset);
+}
+
+ColumnChunk::ColumnChunk(const ColumnChunk& other108) {
+  file_path = other108.file_path;
+  file_offset = other108.file_offset;
+  meta_data = other108.meta_data;
+  offset_index_offset = other108.offset_index_offset;
+  offset_index_length = other108.offset_index_length;
+  column_index_offset = other108.column_index_offset;
+  column_index_length = other108.column_index_length;
+  crypto_metadata = other108.crypto_metadata;
+  encrypted_column_metadata = other108.encrypted_column_metadata;
+  __isset = other108.__isset;
+}
+ColumnChunk& ColumnChunk::operator=(const ColumnChunk& other109) {
+  file_path = other109.file_path;
+  file_offset = other109.file_offset;
+  meta_data = other109.meta_data;
+  offset_index_offset = other109.offset_index_offset;
+  offset_index_length = other109.offset_index_length;
+  column_index_offset = other109.column_index_offset;
+  column_index_length = other109.column_index_length;
+  crypto_metadata = other109.crypto_metadata;
+  encrypted_column_metadata = other109.encrypted_column_metadata;
+  __isset = other109.__isset;
+  return *this;
+}
+void ColumnChunk::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "ColumnChunk(";
+  out << "file_path="; (__isset.file_path ? (out << to_string(file_path)) : (out << "<null>"));
+  out << ", " << "file_offset=" << to_string(file_offset);
+  out << ", " << "meta_data="; (__isset.meta_data ? (out << to_string(meta_data)) : (out << "<null>"));
+  out << ", " << "offset_index_offset="; (__isset.offset_index_offset ? (out << to_string(offset_index_offset)) : (out << "<null>"));
+  out << ", " << "offset_index_length="; (__isset.offset_index_length ? (out << to_string(offset_index_length)) : (out << "<null>"));
+  out << ", " << "column_index_offset="; (__isset.column_index_offset ? (out << to_string(column_index_offset)) : (out << "<null>"));
+  out << ", " << "column_index_length="; (__isset.column_index_length ? (out << to_string(column_index_length)) : (out << "<null>"));
+  out << ", " << "crypto_metadata="; (__isset.crypto_metadata ? (out << to_string(crypto_metadata)) : (out << "<null>"));
+  out << ", " << "encrypted_column_metadata="; (__isset.encrypted_column_metadata ? (out << to_string(encrypted_column_metadata)) : (out << "<null>"));
+  out << ")";
+}
+
+
+RowGroup::~RowGroup() throw() {
+}
+
+
+void RowGroup::__set_columns(const std::vector<ColumnChunk> & val) {
+  this->columns = val;
+}
+
+void RowGroup::__set_total_byte_size(const int64_t val) {
+  this->total_byte_size = val;
+}
+
+void RowGroup::__set_num_rows(const int64_t val) {
+  this->num_rows = val;
+}
+
+void RowGroup::__set_sorting_columns(const std::vector<SortingColumn> & val) {
+  this->sorting_columns = val;
+__isset.sorting_columns = true;
+}
+
+void RowGroup::__set_file_offset(const int64_t val) {
+  this->file_offset = val;
+__isset.file_offset = true;
+}
+
+void RowGroup::__set_total_compressed_size(const int64_t val) {
+  this->total_compressed_size = val;
+__isset.total_compressed_size = true;
+}
+
+void RowGroup::__set_ordinal(const int16_t val) {
+  this->ordinal = val;
+__isset.ordinal = true;
+}
+std::ostream& operator<<(std::ostream& out, const RowGroup& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t RowGroup::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_columns = false;
+  bool isset_total_byte_size = false;
+  bool isset_num_rows = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->columns.clear();
+            uint32_t _size110;
+            ::lbug_apache::thrift::protocol::TType _etype113;
+            xfer += iprot->readListBegin(_etype113, _size110);
+            this->columns.resize(_size110);
+            uint32_t _i114;
+            for (_i114 = 0; _i114 < _size110; ++_i114)
+            {
+              xfer += this->columns[_i114].read(iprot);
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_columns = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->total_byte_size);
+          isset_total_byte_size = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->num_rows);
+          isset_num_rows = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->sorting_columns.clear();
+            uint32_t _size115;
+            ::lbug_apache::thrift::protocol::TType _etype118;
+            xfer += iprot->readListBegin(_etype118, _size115);
+            this->sorting_columns.resize(_size115);
+            uint32_t _i119;
+            for (_i119 = 0; _i119 < _size115; ++_i119)
+            {
+              xfer += this->sorting_columns[_i119].read(iprot);
+            }
+            xfer += iprot->readListEnd();
+          }
+          this->__isset.sorting_columns = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->file_offset);
+          this->__isset.file_offset = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 6:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->total_compressed_size);
+          this->__isset.total_compressed_size = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 7:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I16) {
+          xfer += iprot->readI16(this->ordinal);
+          this->__isset.ordinal = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_columns)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_total_byte_size)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_num_rows)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t RowGroup::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("RowGroup");
+
+  xfer += oprot->writeFieldBegin("columns", ::lbug_apache::thrift::protocol::T_LIST, 1);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRUCT, static_cast<uint32_t>(this->columns.size()));
+    std::vector<ColumnChunk> ::const_iterator _iter120;
+    for (_iter120 = this->columns.begin(); _iter120 != this->columns.end(); ++_iter120)
+    {
+      xfer += (*_iter120).write(oprot);
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("total_byte_size", ::lbug_apache::thrift::protocol::T_I64, 2);
+  xfer += oprot->writeI64(this->total_byte_size);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("num_rows", ::lbug_apache::thrift::protocol::T_I64, 3);
+  xfer += oprot->writeI64(this->num_rows);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.sorting_columns) {
+    xfer += oprot->writeFieldBegin("sorting_columns", ::lbug_apache::thrift::protocol::T_LIST, 4);
+    {
+      xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRUCT, static_cast<uint32_t>(this->sorting_columns.size()));
+      std::vector<SortingColumn> ::const_iterator _iter121;
+      for (_iter121 = this->sorting_columns.begin(); _iter121 != this->sorting_columns.end(); ++_iter121)
+      {
+        xfer += (*_iter121).write(oprot);
+      }
+      xfer += oprot->writeListEnd();
+    }
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.file_offset) {
+    xfer += oprot->writeFieldBegin("file_offset", ::lbug_apache::thrift::protocol::T_I64, 5);
+    xfer += oprot->writeI64(this->file_offset);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.total_compressed_size) {
+    xfer += oprot->writeFieldBegin("total_compressed_size", ::lbug_apache::thrift::protocol::T_I64, 6);
+    xfer += oprot->writeI64(this->total_compressed_size);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.ordinal) {
+    xfer += oprot->writeFieldBegin("ordinal", ::lbug_apache::thrift::protocol::T_I16, 7);
+    xfer += oprot->writeI16(this->ordinal);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(RowGroup &a, RowGroup &b) {
+  using ::std::swap;
+  swap(a.columns, b.columns);
+  swap(a.total_byte_size, b.total_byte_size);
+  swap(a.num_rows, b.num_rows);
+  swap(a.sorting_columns, b.sorting_columns);
+  swap(a.file_offset, b.file_offset);
+  swap(a.total_compressed_size, b.total_compressed_size);
+  swap(a.ordinal, b.ordinal);
+  swap(a.__isset, b.__isset);
+}
+
+RowGroup::RowGroup(const RowGroup& other122) {
+  columns = other122.columns;
+  total_byte_size = other122.total_byte_size;
+  num_rows = other122.num_rows;
+  sorting_columns = other122.sorting_columns;
+  file_offset = other122.file_offset;
+  total_compressed_size = other122.total_compressed_size;
+  ordinal = other122.ordinal;
+  __isset = other122.__isset;
+}
+RowGroup& RowGroup::operator=(const RowGroup& other123) {
+  columns = other123.columns;
+  total_byte_size = other123.total_byte_size;
+  num_rows = other123.num_rows;
+  sorting_columns = other123.sorting_columns;
+  file_offset = other123.file_offset;
+  total_compressed_size = other123.total_compressed_size;
+  ordinal = other123.ordinal;
+  __isset = other123.__isset;
+  return *this;
+}
+void RowGroup::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "RowGroup(";
+  out << "columns=" << to_string(columns);
+  out << ", " << "total_byte_size=" << to_string(total_byte_size);
+  out << ", " << "num_rows=" << to_string(num_rows);
+  out << ", " << "sorting_columns="; (__isset.sorting_columns ? (out << to_string(sorting_columns)) : (out << "<null>"));
+  out << ", " << "file_offset="; (__isset.file_offset ? (out << to_string(file_offset)) : (out << "<null>"));
+  out << ", " << "total_compressed_size="; (__isset.total_compressed_size ? (out << to_string(total_compressed_size)) : (out << "<null>"));
+  out << ", " << "ordinal="; (__isset.ordinal ? (out << to_string(ordinal)) : (out << "<null>"));
+  out << ")";
+}
+
+
+TypeDefinedOrder::~TypeDefinedOrder() throw() {
+}
+
+std::ostream& operator<<(std::ostream& out, const TypeDefinedOrder& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t TypeDefinedOrder::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    xfer += iprot->skip(ftype);
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t TypeDefinedOrder::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("TypeDefinedOrder");
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(TypeDefinedOrder &a, TypeDefinedOrder &b) {
+  using ::std::swap;
+  (void) a;
+  (void) b;
+}
+
+TypeDefinedOrder::TypeDefinedOrder(const TypeDefinedOrder& other124) {
+  (void) other124;
+}
+TypeDefinedOrder& TypeDefinedOrder::operator=(const TypeDefinedOrder& other125) {
+  (void) other125;
+  return *this;
+}
+void TypeDefinedOrder::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "TypeDefinedOrder(";
+  out << ")";
+}
+
+
+ColumnOrder::~ColumnOrder() throw() {
+}
+
+
+void ColumnOrder::__set_TYPE_ORDER(const TypeDefinedOrder& val) {
+  this->TYPE_ORDER = val;
+__isset.TYPE_ORDER = true;
+}
+std::ostream& operator<<(std::ostream& out, const ColumnOrder& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t ColumnOrder::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->TYPE_ORDER.read(iprot);
+          this->__isset.TYPE_ORDER = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t ColumnOrder::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("ColumnOrder");
+
+  if (this->__isset.TYPE_ORDER) {
+    xfer += oprot->writeFieldBegin("TYPE_ORDER", ::lbug_apache::thrift::protocol::T_STRUCT, 1);
+    xfer += this->TYPE_ORDER.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(ColumnOrder &a, ColumnOrder &b) {
+  using ::std::swap;
+  swap(a.TYPE_ORDER, b.TYPE_ORDER);
+  swap(a.__isset, b.__isset);
+}
+
+ColumnOrder::ColumnOrder(const ColumnOrder& other126) {
+  TYPE_ORDER = other126.TYPE_ORDER;
+  __isset = other126.__isset;
+}
+ColumnOrder& ColumnOrder::operator=(const ColumnOrder& other127) {
+  TYPE_ORDER = other127.TYPE_ORDER;
+  __isset = other127.__isset;
+  return *this;
+}
+void ColumnOrder::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "ColumnOrder(";
+  out << "TYPE_ORDER="; (__isset.TYPE_ORDER ? (out << to_string(TYPE_ORDER)) : (out << "<null>"));
+  out << ")";
+}
+
+
+PageLocation::~PageLocation() throw() {
+}
+
+
+void PageLocation::__set_offset(const int64_t val) {
+  this->offset = val;
+}
+
+void PageLocation::__set_compressed_page_size(const int32_t val) {
+  this->compressed_page_size = val;
+}
+
+void PageLocation::__set_first_row_index(const int64_t val) {
+  this->first_row_index = val;
+}
+std::ostream& operator<<(std::ostream& out, const PageLocation& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t PageLocation::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_offset = false;
+  bool isset_compressed_page_size = false;
+  bool isset_first_row_index = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->offset);
+          isset_offset = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->compressed_page_size);
+          isset_compressed_page_size = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->first_row_index);
+          isset_first_row_index = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_offset)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_compressed_page_size)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_first_row_index)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t PageLocation::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("PageLocation");
+
+  xfer += oprot->writeFieldBegin("offset", ::lbug_apache::thrift::protocol::T_I64, 1);
+  xfer += oprot->writeI64(this->offset);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("compressed_page_size", ::lbug_apache::thrift::protocol::T_I32, 2);
+  xfer += oprot->writeI32(this->compressed_page_size);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("first_row_index", ::lbug_apache::thrift::protocol::T_I64, 3);
+  xfer += oprot->writeI64(this->first_row_index);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(PageLocation &a, PageLocation &b) {
+  using ::std::swap;
+  swap(a.offset, b.offset);
+  swap(a.compressed_page_size, b.compressed_page_size);
+  swap(a.first_row_index, b.first_row_index);
+}
+
+PageLocation::PageLocation(const PageLocation& other128) {
+  offset = other128.offset;
+  compressed_page_size = other128.compressed_page_size;
+  first_row_index = other128.first_row_index;
+}
+PageLocation& PageLocation::operator=(const PageLocation& other129) {
+  offset = other129.offset;
+  compressed_page_size = other129.compressed_page_size;
+  first_row_index = other129.first_row_index;
+  return *this;
+}
+void PageLocation::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "PageLocation(";
+  out << "offset=" << to_string(offset);
+  out << ", " << "compressed_page_size=" << to_string(compressed_page_size);
+  out << ", " << "first_row_index=" << to_string(first_row_index);
+  out << ")";
+}
+
+
+OffsetIndex::~OffsetIndex() throw() {
+}
+
+
+void OffsetIndex::__set_page_locations(const std::vector<PageLocation> & val) {
+  this->page_locations = val;
+}
+std::ostream& operator<<(std::ostream& out, const OffsetIndex& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t OffsetIndex::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_page_locations = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->page_locations.clear();
+            uint32_t _size130;
+            ::lbug_apache::thrift::protocol::TType _etype133;
+            xfer += iprot->readListBegin(_etype133, _size130);
+            this->page_locations.resize(_size130);
+            uint32_t _i134;
+            for (_i134 = 0; _i134 < _size130; ++_i134)
+            {
+              xfer += this->page_locations[_i134].read(iprot);
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_page_locations = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_page_locations)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t OffsetIndex::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("OffsetIndex");
+
+  xfer += oprot->writeFieldBegin("page_locations", ::lbug_apache::thrift::protocol::T_LIST, 1);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRUCT, static_cast<uint32_t>(this->page_locations.size()));
+    std::vector<PageLocation> ::const_iterator _iter135;
+    for (_iter135 = this->page_locations.begin(); _iter135 != this->page_locations.end(); ++_iter135)
+    {
+      xfer += (*_iter135).write(oprot);
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(OffsetIndex &a, OffsetIndex &b) {
+  using ::std::swap;
+  swap(a.page_locations, b.page_locations);
+}
+
+OffsetIndex::OffsetIndex(const OffsetIndex& other136) {
+  page_locations = other136.page_locations;
+}
+OffsetIndex& OffsetIndex::operator=(const OffsetIndex& other137) {
+  page_locations = other137.page_locations;
+  return *this;
+}
+void OffsetIndex::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "OffsetIndex(";
+  out << "page_locations=" << to_string(page_locations);
+  out << ")";
+}
+
+
+ColumnIndex::~ColumnIndex() throw() {
+}
+
+
+void ColumnIndex::__set_null_pages(const std::vector<bool> & val) {
+  this->null_pages = val;
+}
+
+void ColumnIndex::__set_min_values(const std::vector<std::string> & val) {
+  this->min_values = val;
+}
+
+void ColumnIndex::__set_max_values(const std::vector<std::string> & val) {
+  this->max_values = val;
+}
+
+void ColumnIndex::__set_boundary_order(const BoundaryOrder::type val) {
+  this->boundary_order = val;
+}
+
+void ColumnIndex::__set_null_counts(const std::vector<int64_t> & val) {
+  this->null_counts = val;
+__isset.null_counts = true;
+}
+std::ostream& operator<<(std::ostream& out, const ColumnIndex& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t ColumnIndex::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_null_pages = false;
+  bool isset_min_values = false;
+  bool isset_max_values = false;
+  bool isset_boundary_order = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->null_pages.clear();
+            uint32_t _size138;
+            ::lbug_apache::thrift::protocol::TType _etype141;
+            xfer += iprot->readListBegin(_etype141, _size138);
+            this->null_pages.resize(_size138);
+            uint32_t _i142;
+            for (_i142 = 0; _i142 < _size138; ++_i142)
+            {
+              xfer += iprot->readBool(this->null_pages[_i142]);
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_null_pages = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->min_values.clear();
+            uint32_t _size143;
+            ::lbug_apache::thrift::protocol::TType _etype146;
+            xfer += iprot->readListBegin(_etype146, _size143);
+            this->min_values.resize(_size143);
+            uint32_t _i147;
+            for (_i147 = 0; _i147 < _size143; ++_i147)
+            {
+              xfer += iprot->readBinary(this->min_values[_i147]);
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_min_values = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->max_values.clear();
+            uint32_t _size148;
+            ::lbug_apache::thrift::protocol::TType _etype151;
+            xfer += iprot->readListBegin(_etype151, _size148);
+            this->max_values.resize(_size148);
+            uint32_t _i152;
+            for (_i152 = 0; _i152 < _size148; ++_i152)
+            {
+              xfer += iprot->readBinary(this->max_values[_i152]);
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_max_values = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          int32_t ecast153;
+          xfer += iprot->readI32(ecast153);
+          this->boundary_order = (BoundaryOrder::type)ecast153;
+          isset_boundary_order = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->null_counts.clear();
+            uint32_t _size154;
+            ::lbug_apache::thrift::protocol::TType _etype157;
+            xfer += iprot->readListBegin(_etype157, _size154);
+            this->null_counts.resize(_size154);
+            uint32_t _i158;
+            for (_i158 = 0; _i158 < _size154; ++_i158)
+            {
+              xfer += iprot->readI64(this->null_counts[_i158]);
+            }
+            xfer += iprot->readListEnd();
+          }
+          this->__isset.null_counts = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_null_pages)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_min_values)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_max_values)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_boundary_order)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t ColumnIndex::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("ColumnIndex");
+
+  xfer += oprot->writeFieldBegin("null_pages", ::lbug_apache::thrift::protocol::T_LIST, 1);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_BOOL, static_cast<uint32_t>(this->null_pages.size()));
+    std::vector<bool> ::const_iterator _iter159;
+    for (_iter159 = this->null_pages.begin(); _iter159 != this->null_pages.end(); ++_iter159)
+    {
+      xfer += oprot->writeBool((*_iter159));
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("min_values", ::lbug_apache::thrift::protocol::T_LIST, 2);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRING, static_cast<uint32_t>(this->min_values.size()));
+    std::vector<std::string> ::const_iterator _iter160;
+    for (_iter160 = this->min_values.begin(); _iter160 != this->min_values.end(); ++_iter160)
+    {
+      xfer += oprot->writeBinary((*_iter160));
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("max_values", ::lbug_apache::thrift::protocol::T_LIST, 3);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRING, static_cast<uint32_t>(this->max_values.size()));
+    std::vector<std::string> ::const_iterator _iter161;
+    for (_iter161 = this->max_values.begin(); _iter161 != this->max_values.end(); ++_iter161)
+    {
+      xfer += oprot->writeBinary((*_iter161));
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("boundary_order", ::lbug_apache::thrift::protocol::T_I32, 4);
+  xfer += oprot->writeI32((int32_t)this->boundary_order);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.null_counts) {
+    xfer += oprot->writeFieldBegin("null_counts", ::lbug_apache::thrift::protocol::T_LIST, 5);
+    {
+      xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_I64, static_cast<uint32_t>(this->null_counts.size()));
+      std::vector<int64_t> ::const_iterator _iter162;
+      for (_iter162 = this->null_counts.begin(); _iter162 != this->null_counts.end(); ++_iter162)
+      {
+        xfer += oprot->writeI64((*_iter162));
+      }
+      xfer += oprot->writeListEnd();
+    }
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(ColumnIndex &a, ColumnIndex &b) {
+  using ::std::swap;
+  swap(a.null_pages, b.null_pages);
+  swap(a.min_values, b.min_values);
+  swap(a.max_values, b.max_values);
+  swap(a.boundary_order, b.boundary_order);
+  swap(a.null_counts, b.null_counts);
+  swap(a.__isset, b.__isset);
+}
+
+ColumnIndex::ColumnIndex(const ColumnIndex& other163) {
+  null_pages = other163.null_pages;
+  min_values = other163.min_values;
+  max_values = other163.max_values;
+  boundary_order = other163.boundary_order;
+  null_counts = other163.null_counts;
+  __isset = other163.__isset;
+}
+ColumnIndex& ColumnIndex::operator=(const ColumnIndex& other164) {
+  null_pages = other164.null_pages;
+  min_values = other164.min_values;
+  max_values = other164.max_values;
+  boundary_order = other164.boundary_order;
+  null_counts = other164.null_counts;
+  __isset = other164.__isset;
+  return *this;
+}
+void ColumnIndex::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "ColumnIndex(";
+  out << "null_pages=" << to_string(null_pages);
+  out << ", " << "min_values=" << to_string(min_values);
+  out << ", " << "max_values=" << to_string(max_values);
+  out << ", " << "boundary_order=" << to_string(boundary_order);
+  out << ", " << "null_counts="; (__isset.null_counts ? (out << to_string(null_counts)) : (out << "<null>"));
+  out << ")";
+}
+
+
+AesGcmV1::~AesGcmV1() throw() {
+}
+
+
+void AesGcmV1::__set_aad_prefix(const std::string& val) {
+  this->aad_prefix = val;
+__isset.aad_prefix = true;
+}
+
+void AesGcmV1::__set_aad_file_unique(const std::string& val) {
+  this->aad_file_unique = val;
+__isset.aad_file_unique = true;
+}
+
+void AesGcmV1::__set_supply_aad_prefix(const bool val) {
+  this->supply_aad_prefix = val;
+__isset.supply_aad_prefix = true;
+}
+std::ostream& operator<<(std::ostream& out, const AesGcmV1& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t AesGcmV1::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->aad_prefix);
+          this->__isset.aad_prefix = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->aad_file_unique);
+          this->__isset.aad_file_unique = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BOOL) {
+          xfer += iprot->readBool(this->supply_aad_prefix);
+          this->__isset.supply_aad_prefix = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t AesGcmV1::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("AesGcmV1");
+
+  if (this->__isset.aad_prefix) {
+    xfer += oprot->writeFieldBegin("aad_prefix", ::lbug_apache::thrift::protocol::T_STRING, 1);
+    xfer += oprot->writeBinary(this->aad_prefix);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.aad_file_unique) {
+    xfer += oprot->writeFieldBegin("aad_file_unique", ::lbug_apache::thrift::protocol::T_STRING, 2);
+    xfer += oprot->writeBinary(this->aad_file_unique);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.supply_aad_prefix) {
+    xfer += oprot->writeFieldBegin("supply_aad_prefix", ::lbug_apache::thrift::protocol::T_BOOL, 3);
+    xfer += oprot->writeBool(this->supply_aad_prefix);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(AesGcmV1 &a, AesGcmV1 &b) {
+  using ::std::swap;
+  swap(a.aad_prefix, b.aad_prefix);
+  swap(a.aad_file_unique, b.aad_file_unique);
+  swap(a.supply_aad_prefix, b.supply_aad_prefix);
+  swap(a.__isset, b.__isset);
+}
+
+AesGcmV1::AesGcmV1(const AesGcmV1& other165) {
+  aad_prefix = other165.aad_prefix;
+  aad_file_unique = other165.aad_file_unique;
+  supply_aad_prefix = other165.supply_aad_prefix;
+  __isset = other165.__isset;
+}
+AesGcmV1& AesGcmV1::operator=(const AesGcmV1& other166) {
+  aad_prefix = other166.aad_prefix;
+  aad_file_unique = other166.aad_file_unique;
+  supply_aad_prefix = other166.supply_aad_prefix;
+  __isset = other166.__isset;
+  return *this;
+}
+void AesGcmV1::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "AesGcmV1(";
+  out << "aad_prefix="; (__isset.aad_prefix ? (out << to_string(aad_prefix)) : (out << "<null>"));
+  out << ", " << "aad_file_unique="; (__isset.aad_file_unique ? (out << to_string(aad_file_unique)) : (out << "<null>"));
+  out << ", " << "supply_aad_prefix="; (__isset.supply_aad_prefix ? (out << to_string(supply_aad_prefix)) : (out << "<null>"));
+  out << ")";
+}
+
+
+AesGcmCtrV1::~AesGcmCtrV1() throw() {
+}
+
+
+void AesGcmCtrV1::__set_aad_prefix(const std::string& val) {
+  this->aad_prefix = val;
+__isset.aad_prefix = true;
+}
+
+void AesGcmCtrV1::__set_aad_file_unique(const std::string& val) {
+  this->aad_file_unique = val;
+__isset.aad_file_unique = true;
+}
+
+void AesGcmCtrV1::__set_supply_aad_prefix(const bool val) {
+  this->supply_aad_prefix = val;
+__isset.supply_aad_prefix = true;
+}
+std::ostream& operator<<(std::ostream& out, const AesGcmCtrV1& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t AesGcmCtrV1::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->aad_prefix);
+          this->__isset.aad_prefix = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->aad_file_unique);
+          this->__isset.aad_file_unique = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_BOOL) {
+          xfer += iprot->readBool(this->supply_aad_prefix);
+          this->__isset.supply_aad_prefix = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t AesGcmCtrV1::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("AesGcmCtrV1");
+
+  if (this->__isset.aad_prefix) {
+    xfer += oprot->writeFieldBegin("aad_prefix", ::lbug_apache::thrift::protocol::T_STRING, 1);
+    xfer += oprot->writeBinary(this->aad_prefix);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.aad_file_unique) {
+    xfer += oprot->writeFieldBegin("aad_file_unique", ::lbug_apache::thrift::protocol::T_STRING, 2);
+    xfer += oprot->writeBinary(this->aad_file_unique);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.supply_aad_prefix) {
+    xfer += oprot->writeFieldBegin("supply_aad_prefix", ::lbug_apache::thrift::protocol::T_BOOL, 3);
+    xfer += oprot->writeBool(this->supply_aad_prefix);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(AesGcmCtrV1 &a, AesGcmCtrV1 &b) {
+  using ::std::swap;
+  swap(a.aad_prefix, b.aad_prefix);
+  swap(a.aad_file_unique, b.aad_file_unique);
+  swap(a.supply_aad_prefix, b.supply_aad_prefix);
+  swap(a.__isset, b.__isset);
+}
+
+AesGcmCtrV1::AesGcmCtrV1(const AesGcmCtrV1& other167) {
+  aad_prefix = other167.aad_prefix;
+  aad_file_unique = other167.aad_file_unique;
+  supply_aad_prefix = other167.supply_aad_prefix;
+  __isset = other167.__isset;
+}
+AesGcmCtrV1& AesGcmCtrV1::operator=(const AesGcmCtrV1& other168) {
+  aad_prefix = other168.aad_prefix;
+  aad_file_unique = other168.aad_file_unique;
+  supply_aad_prefix = other168.supply_aad_prefix;
+  __isset = other168.__isset;
+  return *this;
+}
+void AesGcmCtrV1::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "AesGcmCtrV1(";
+  out << "aad_prefix="; (__isset.aad_prefix ? (out << to_string(aad_prefix)) : (out << "<null>"));
+  out << ", " << "aad_file_unique="; (__isset.aad_file_unique ? (out << to_string(aad_file_unique)) : (out << "<null>"));
+  out << ", " << "supply_aad_prefix="; (__isset.supply_aad_prefix ? (out << to_string(supply_aad_prefix)) : (out << "<null>"));
+  out << ")";
+}
+
+
+EncryptionAlgorithm::~EncryptionAlgorithm() throw() {
+}
+
+
+void EncryptionAlgorithm::__set_AES_GCM_V1(const AesGcmV1& val) {
+  this->AES_GCM_V1 = val;
+__isset.AES_GCM_V1 = true;
+}
+
+void EncryptionAlgorithm::__set_AES_GCM_CTR_V1(const AesGcmCtrV1& val) {
+  this->AES_GCM_CTR_V1 = val;
+__isset.AES_GCM_CTR_V1 = true;
+}
+std::ostream& operator<<(std::ostream& out, const EncryptionAlgorithm& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t EncryptionAlgorithm::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->AES_GCM_V1.read(iprot);
+          this->__isset.AES_GCM_V1 = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->AES_GCM_CTR_V1.read(iprot);
+          this->__isset.AES_GCM_CTR_V1 = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  return xfer;
+}
+
+uint32_t EncryptionAlgorithm::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("EncryptionAlgorithm");
+
+  if (this->__isset.AES_GCM_V1) {
+    xfer += oprot->writeFieldBegin("AES_GCM_V1", ::lbug_apache::thrift::protocol::T_STRUCT, 1);
+    xfer += this->AES_GCM_V1.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.AES_GCM_CTR_V1) {
+    xfer += oprot->writeFieldBegin("AES_GCM_CTR_V1", ::lbug_apache::thrift::protocol::T_STRUCT, 2);
+    xfer += this->AES_GCM_CTR_V1.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(EncryptionAlgorithm &a, EncryptionAlgorithm &b) {
+  using ::std::swap;
+  swap(a.AES_GCM_V1, b.AES_GCM_V1);
+  swap(a.AES_GCM_CTR_V1, b.AES_GCM_CTR_V1);
+  swap(a.__isset, b.__isset);
+}
+
+EncryptionAlgorithm::EncryptionAlgorithm(const EncryptionAlgorithm& other169) {
+  AES_GCM_V1 = other169.AES_GCM_V1;
+  AES_GCM_CTR_V1 = other169.AES_GCM_CTR_V1;
+  __isset = other169.__isset;
+}
+EncryptionAlgorithm& EncryptionAlgorithm::operator=(const EncryptionAlgorithm& other170) {
+  AES_GCM_V1 = other170.AES_GCM_V1;
+  AES_GCM_CTR_V1 = other170.AES_GCM_CTR_V1;
+  __isset = other170.__isset;
+  return *this;
+}
+void EncryptionAlgorithm::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "EncryptionAlgorithm(";
+  out << "AES_GCM_V1="; (__isset.AES_GCM_V1 ? (out << to_string(AES_GCM_V1)) : (out << "<null>"));
+  out << ", " << "AES_GCM_CTR_V1="; (__isset.AES_GCM_CTR_V1 ? (out << to_string(AES_GCM_CTR_V1)) : (out << "<null>"));
+  out << ")";
+}
+
+
+FileMetaData::~FileMetaData() throw() {
+}
+
+
+void FileMetaData::__set_version(const int32_t val) {
+  this->version = val;
+}
+
+void FileMetaData::__set_schema(const std::vector<SchemaElement> & val) {
+  this->schema = val;
+}
+
+void FileMetaData::__set_num_rows(const int64_t val) {
+  this->num_rows = val;
+}
+
+void FileMetaData::__set_row_groups(const std::vector<RowGroup> & val) {
+  this->row_groups = val;
+}
+
+void FileMetaData::__set_key_value_metadata(const std::vector<KeyValue> & val) {
+  this->key_value_metadata = val;
+__isset.key_value_metadata = true;
+}
+
+void FileMetaData::__set_created_by(const std::string& val) {
+  this->created_by = val;
+__isset.created_by = true;
+}
+
+void FileMetaData::__set_column_orders(const std::vector<ColumnOrder> & val) {
+  this->column_orders = val;
+__isset.column_orders = true;
+}
+
+void FileMetaData::__set_encryption_algorithm(const EncryptionAlgorithm& val) {
+  this->encryption_algorithm = val;
+__isset.encryption_algorithm = true;
+}
+
+void FileMetaData::__set_footer_signing_key_metadata(const std::string& val) {
+  this->footer_signing_key_metadata = val;
+__isset.footer_signing_key_metadata = true;
+}
+std::ostream& operator<<(std::ostream& out, const FileMetaData& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t FileMetaData::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_version = false;
+  bool isset_schema = false;
+  bool isset_num_rows = false;
+  bool isset_row_groups = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I32) {
+          xfer += iprot->readI32(this->version);
+          isset_version = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->schema.clear();
+            uint32_t _size171;
+            ::lbug_apache::thrift::protocol::TType _etype174;
+            xfer += iprot->readListBegin(_etype174, _size171);
+            this->schema.resize(_size171);
+            uint32_t _i175;
+            for (_i175 = 0; _i175 < _size171; ++_i175)
+            {
+              xfer += this->schema[_i175].read(iprot);
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_schema = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 3:
+        if (ftype == ::lbug_apache::thrift::protocol::T_I64) {
+          xfer += iprot->readI64(this->num_rows);
+          isset_num_rows = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 4:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->row_groups.clear();
+            uint32_t _size176;
+            ::lbug_apache::thrift::protocol::TType _etype179;
+            xfer += iprot->readListBegin(_etype179, _size176);
+            this->row_groups.resize(_size176);
+            uint32_t _i180;
+            for (_i180 = 0; _i180 < _size176; ++_i180)
+            {
+              xfer += this->row_groups[_i180].read(iprot);
+            }
+            xfer += iprot->readListEnd();
+          }
+          isset_row_groups = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 5:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->key_value_metadata.clear();
+            uint32_t _size181;
+            ::lbug_apache::thrift::protocol::TType _etype184;
+            xfer += iprot->readListBegin(_etype184, _size181);
+            this->key_value_metadata.resize(_size181);
+            uint32_t _i185;
+            for (_i185 = 0; _i185 < _size181; ++_i185)
+            {
+              xfer += this->key_value_metadata[_i185].read(iprot);
+            }
+            xfer += iprot->readListEnd();
+          }
+          this->__isset.key_value_metadata = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 6:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readString(this->created_by);
+          this->__isset.created_by = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 7:
+        if (ftype == ::lbug_apache::thrift::protocol::T_LIST) {
+          {
+            this->column_orders.clear();
+            uint32_t _size186;
+            ::lbug_apache::thrift::protocol::TType _etype189;
+            xfer += iprot->readListBegin(_etype189, _size186);
+            this->column_orders.resize(_size186);
+            uint32_t _i190;
+            for (_i190 = 0; _i190 < _size186; ++_i190)
+            {
+              xfer += this->column_orders[_i190].read(iprot);
+            }
+            xfer += iprot->readListEnd();
+          }
+          this->__isset.column_orders = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 8:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->encryption_algorithm.read(iprot);
+          this->__isset.encryption_algorithm = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 9:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->footer_signing_key_metadata);
+          this->__isset.footer_signing_key_metadata = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_version)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_schema)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_num_rows)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  if (!isset_row_groups)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t FileMetaData::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("FileMetaData");
+
+  xfer += oprot->writeFieldBegin("version", ::lbug_apache::thrift::protocol::T_I32, 1);
+  xfer += oprot->writeI32(this->version);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("schema", ::lbug_apache::thrift::protocol::T_LIST, 2);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRUCT, static_cast<uint32_t>(this->schema.size()));
+    std::vector<SchemaElement> ::const_iterator _iter191;
+    for (_iter191 = this->schema.begin(); _iter191 != this->schema.end(); ++_iter191)
+    {
+      xfer += (*_iter191).write(oprot);
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("num_rows", ::lbug_apache::thrift::protocol::T_I64, 3);
+  xfer += oprot->writeI64(this->num_rows);
+  xfer += oprot->writeFieldEnd();
+
+  xfer += oprot->writeFieldBegin("row_groups", ::lbug_apache::thrift::protocol::T_LIST, 4);
+  {
+    xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRUCT, static_cast<uint32_t>(this->row_groups.size()));
+    std::vector<RowGroup> ::const_iterator _iter192;
+    for (_iter192 = this->row_groups.begin(); _iter192 != this->row_groups.end(); ++_iter192)
+    {
+      xfer += (*_iter192).write(oprot);
+    }
+    xfer += oprot->writeListEnd();
+  }
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.key_value_metadata) {
+    xfer += oprot->writeFieldBegin("key_value_metadata", ::lbug_apache::thrift::protocol::T_LIST, 5);
+    {
+      xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRUCT, static_cast<uint32_t>(this->key_value_metadata.size()));
+      std::vector<KeyValue> ::const_iterator _iter193;
+      for (_iter193 = this->key_value_metadata.begin(); _iter193 != this->key_value_metadata.end(); ++_iter193)
+      {
+        xfer += (*_iter193).write(oprot);
+      }
+      xfer += oprot->writeListEnd();
+    }
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.created_by) {
+    xfer += oprot->writeFieldBegin("created_by", ::lbug_apache::thrift::protocol::T_STRING, 6);
+    xfer += oprot->writeString(this->created_by);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.column_orders) {
+    xfer += oprot->writeFieldBegin("column_orders", ::lbug_apache::thrift::protocol::T_LIST, 7);
+    {
+      xfer += oprot->writeListBegin(::lbug_apache::thrift::protocol::T_STRUCT, static_cast<uint32_t>(this->column_orders.size()));
+      std::vector<ColumnOrder> ::const_iterator _iter194;
+      for (_iter194 = this->column_orders.begin(); _iter194 != this->column_orders.end(); ++_iter194)
+      {
+        xfer += (*_iter194).write(oprot);
+      }
+      xfer += oprot->writeListEnd();
+    }
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.encryption_algorithm) {
+    xfer += oprot->writeFieldBegin("encryption_algorithm", ::lbug_apache::thrift::protocol::T_STRUCT, 8);
+    xfer += this->encryption_algorithm.write(oprot);
+    xfer += oprot->writeFieldEnd();
+  }
+  if (this->__isset.footer_signing_key_metadata) {
+    xfer += oprot->writeFieldBegin("footer_signing_key_metadata", ::lbug_apache::thrift::protocol::T_STRING, 9);
+    xfer += oprot->writeBinary(this->footer_signing_key_metadata);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(FileMetaData &a, FileMetaData &b) {
+  using ::std::swap;
+  swap(a.version, b.version);
+  swap(a.schema, b.schema);
+  swap(a.num_rows, b.num_rows);
+  swap(a.row_groups, b.row_groups);
+  swap(a.key_value_metadata, b.key_value_metadata);
+  swap(a.created_by, b.created_by);
+  swap(a.column_orders, b.column_orders);
+  swap(a.encryption_algorithm, b.encryption_algorithm);
+  swap(a.footer_signing_key_metadata, b.footer_signing_key_metadata);
+  swap(a.__isset, b.__isset);
+}
+
+FileMetaData::FileMetaData(const FileMetaData& other195) {
+  version = other195.version;
+  schema = other195.schema;
+  num_rows = other195.num_rows;
+  row_groups = other195.row_groups;
+  key_value_metadata = other195.key_value_metadata;
+  created_by = other195.created_by;
+  column_orders = other195.column_orders;
+  encryption_algorithm = other195.encryption_algorithm;
+  footer_signing_key_metadata = other195.footer_signing_key_metadata;
+  __isset = other195.__isset;
+}
+FileMetaData& FileMetaData::operator=(const FileMetaData& other196) {
+  version = other196.version;
+  schema = other196.schema;
+  num_rows = other196.num_rows;
+  row_groups = other196.row_groups;
+  key_value_metadata = other196.key_value_metadata;
+  created_by = other196.created_by;
+  column_orders = other196.column_orders;
+  encryption_algorithm = other196.encryption_algorithm;
+  footer_signing_key_metadata = other196.footer_signing_key_metadata;
+  __isset = other196.__isset;
+  return *this;
+}
+
+void FileMetaData::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "FileMetaData(";
+  out << "version=" << to_string(version);
+  out << ", " << "schema=" << to_string(schema);
+  out << ", " << "num_rows=" << to_string(num_rows);
+  out << ", " << "row_groups=" << to_string(row_groups);
+  out << ", " << "key_value_metadata="; (__isset.key_value_metadata ? (out << to_string(key_value_metadata)) : (out << "<null>"));
+  out << ", " << "created_by="; (__isset.created_by ? (out << to_string(created_by)) : (out << "<null>"));
+  out << ", " << "column_orders="; (__isset.column_orders ? (out << to_string(column_orders)) : (out << "<null>"));
+  out << ", " << "encryption_algorithm="; (__isset.encryption_algorithm ? (out << to_string(encryption_algorithm)) : (out << "<null>"));
+  out << ", " << "footer_signing_key_metadata="; (__isset.footer_signing_key_metadata ? (out << to_string(footer_signing_key_metadata)) : (out << "<null>"));
+  out << ")";
+}
+
+
+FileCryptoMetaData::~FileCryptoMetaData() throw() {
+}
+
+
+void FileCryptoMetaData::__set_encryption_algorithm(const EncryptionAlgorithm& val) {
+  this->encryption_algorithm = val;
+}
+
+void FileCryptoMetaData::__set_key_metadata(const std::string& val) {
+  this->key_metadata = val;
+__isset.key_metadata = true;
+}
+std::ostream& operator<<(std::ostream& out, const FileCryptoMetaData& obj)
+{
+  obj.printTo(out);
+  return out;
+}
+
+
+uint32_t FileCryptoMetaData::read(::lbug_apache::thrift::protocol::TProtocol* iprot) {
+
+  ::lbug_apache::thrift::protocol::TInputRecursionTracker tracker(*iprot);
+  uint32_t xfer = 0;
+  std::string fname;
+  ::lbug_apache::thrift::protocol::TType ftype;
+  int16_t fid;
+
+  xfer += iprot->readStructBegin(fname);
+
+  using ::lbug_apache::thrift::protocol::TProtocolException;
+
+  bool isset_encryption_algorithm = false;
+
+  while (true)
+  {
+    xfer += iprot->readFieldBegin(fname, ftype, fid);
+    if (ftype == ::lbug_apache::thrift::protocol::T_STOP) {
+      break;
+    }
+    switch (fid)
+    {
+      case 1:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRUCT) {
+          xfer += this->encryption_algorithm.read(iprot);
+          isset_encryption_algorithm = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      case 2:
+        if (ftype == ::lbug_apache::thrift::protocol::T_STRING) {
+          xfer += iprot->readBinary(this->key_metadata);
+          this->__isset.key_metadata = true;
+        } else {
+          xfer += iprot->skip(ftype);
+        }
+        break;
+      default:
+        xfer += iprot->skip(ftype);
+        break;
+    }
+    xfer += iprot->readFieldEnd();
+  }
+
+  xfer += iprot->readStructEnd();
+
+  if (!isset_encryption_algorithm)
+    throw TProtocolException(TProtocolException::INVALID_DATA);
+  return xfer;
+}
+
+uint32_t FileCryptoMetaData::write(::lbug_apache::thrift::protocol::TProtocol* oprot) const {
+  uint32_t xfer = 0;
+  ::lbug_apache::thrift::protocol::TOutputRecursionTracker tracker(*oprot);
+  xfer += oprot->writeStructBegin("FileCryptoMetaData");
+
+  xfer += oprot->writeFieldBegin("encryption_algorithm", ::lbug_apache::thrift::protocol::T_STRUCT, 1);
+  xfer += this->encryption_algorithm.write(oprot);
+  xfer += oprot->writeFieldEnd();
+
+  if (this->__isset.key_metadata) {
+    xfer += oprot->writeFieldBegin("key_metadata", ::lbug_apache::thrift::protocol::T_STRING, 2);
+    xfer += oprot->writeBinary(this->key_metadata);
+    xfer += oprot->writeFieldEnd();
+  }
+  xfer += oprot->writeFieldStop();
+  xfer += oprot->writeStructEnd();
+  return xfer;
+}
+
+void swap(FileCryptoMetaData &a, FileCryptoMetaData &b) {
+  using ::std::swap;
+  swap(a.encryption_algorithm, b.encryption_algorithm);
+  swap(a.key_metadata, b.key_metadata);
+  swap(a.__isset, b.__isset);
+}
+
+FileCryptoMetaData::FileCryptoMetaData(const FileCryptoMetaData& other197) {
+  encryption_algorithm = other197.encryption_algorithm;
+  key_metadata = other197.key_metadata;
+  __isset = other197.__isset;
+}
+FileCryptoMetaData& FileCryptoMetaData::operator=(const FileCryptoMetaData& other198) {
+  encryption_algorithm = other198.encryption_algorithm;
+  key_metadata = other198.key_metadata;
+  __isset = other198.__isset;
+  return *this;
+}
+void FileCryptoMetaData::printTo(std::ostream& out) const {
+  using ::lbug_apache::thrift::to_string;
+  out << "FileCryptoMetaData(";
+  out << "encryption_algorithm=" << to_string(encryption_algorithm);
+  out << ", " << "key_metadata="; (__isset.key_metadata ? (out << to_string(key_metadata)) : (out << "<null>"));
+  out << ")";
+}
+
+
+}} // namespace
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_types.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_types.h
new file mode 100644
index 0000000000..7d70add0cf
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/parquet_types.h
@@ -0,0 +1,2593 @@
+/**
+ * Autogenerated by Thrift Compiler (0.11.0)
+ *
+ * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
+ *  @generated
+ */
+#ifndef parquet_TYPES_H
+#define parquet_TYPES_H
+
+#include <iosfwd>
+#include <vector>
+
+#include "Thrift.h"
+#include "TApplicationException.h"
+#include "TBase.h"
+#include "protocol/TProtocol.h"
+#include "transport/TTransport.h"
+
+#include "stdcxx.h"
+
+#include "windows_compatibility.h"
+
+namespace lbug_parquet { namespace format {
+
+struct Type {
+  enum type {
+    BOOLEAN = 0,
+    INT32 = 1,
+    INT64 = 2,
+    INT96 = 3,
+    FLOAT = 4,
+    DOUBLE = 5,
+    BYTE_ARRAY = 6,
+    FIXED_LEN_BYTE_ARRAY = 7
+  };
+};
+
+std::ostream& operator<<(std::ostream& out, const Type::type& val);
+
+struct ConvertedType {
+  enum type {
+    UTF8 = 0,
+    MAP = 1,
+    MAP_KEY_VALUE = 2,
+    LIST = 3,
+    ENUM = 4,
+    DECIMAL = 5,
+    DATE = 6,
+    TIME_MILLIS = 7,
+    TIME_MICROS = 8,
+    TIMESTAMP_MILLIS = 9,
+    TIMESTAMP_MICROS = 10,
+    UINT_8 = 11,
+    UINT_16 = 12,
+    UINT_32 = 13,
+    UINT_64 = 14,
+    INT_8 = 15,
+    INT_16 = 16,
+    INT_32 = 17,
+    INT_64 = 18,
+    JSON = 19,
+    BSON = 20,
+    INTERVAL = 21,
+    SERIAL = 22,
+    NULL_TYPE = 24
+  };
+};
+
+std::ostream& operator<<(std::ostream& out, const ConvertedType::type& val);
+
+struct FieldRepetitionType {
+  enum type {
+    REQUIRED = 0,
+    OPTIONAL = 1,
+    REPEATED = 2
+  };
+};
+
+std::ostream& operator<<(std::ostream& out, const FieldRepetitionType::type& val);
+
+struct Encoding {
+  enum type {
+    PLAIN = 0,
+    PLAIN_DICTIONARY = 2,
+    RLE = 3,
+    BIT_PACKED = 4,
+    DELTA_BINARY_PACKED = 5,
+    DELTA_LENGTH_BYTE_ARRAY = 6,
+    DELTA_BYTE_ARRAY = 7,
+    RLE_DICTIONARY = 8,
+    BYTE_STREAM_SPLIT = 9,
+  };
+};
+
+std::ostream& operator<<(std::ostream& out, const Encoding::type& val);
+
+struct CompressionCodec {
+  enum type : uint8_t {
+    UNCOMPRESSED = 0,
+    SNAPPY = 1,
+    GZIP = 2,
+    LZO = 3,
+    BROTLI = 4,
+    LZ4 = 5,
+    ZSTD = 6,
+	LZ4_RAW = 7
+  };
+};
+
+std::ostream& operator<<(std::ostream& out, const CompressionCodec::type& val);
+
+struct PageType {
+  enum type {
+    DATA_PAGE = 0,
+    INDEX_PAGE = 1,
+    DICTIONARY_PAGE = 2,
+    DATA_PAGE_V2 = 3
+  };
+};
+
+std::ostream& operator<<(std::ostream& out, const PageType::type& val);
+
+struct BoundaryOrder {
+  enum type {
+    UNORDERED = 0,
+    ASCENDING = 1,
+    DESCENDING = 2
+  };
+};
+
+std::ostream& operator<<(std::ostream& out, const BoundaryOrder::type& val);
+
+class Statistics;
+
+class StringType;
+
+class UUIDType;
+
+class MapType;
+
+class ListType;
+
+class EnumType;
+
+class DateType;
+
+class NullType;
+
+class DecimalType;
+
+class MilliSeconds;
+
+class MicroSeconds;
+
+class NanoSeconds;
+
+class TimeUnit;
+
+class TimestampType;
+
+class TimeType;
+
+class IntType;
+
+class JsonType;
+
+class BsonType;
+
+class LogicalType;
+
+class SchemaElement;
+
+class DataPageHeader;
+
+class IndexPageHeader;
+
+class DictionaryPageHeader;
+
+class DataPageHeaderV2;
+
+class PageHeader;
+
+class KeyValue;
+
+class SortingColumn;
+
+class PageEncodingStats;
+
+class ColumnMetaData;
+
+class EncryptionWithFooterKey;
+
+class EncryptionWithColumnKey;
+
+class ColumnCryptoMetaData;
+
+class ColumnChunk;
+
+class RowGroup;
+
+class TypeDefinedOrder;
+
+class ColumnOrder;
+
+class PageLocation;
+
+class OffsetIndex;
+
+class ColumnIndex;
+
+class AesGcmV1;
+
+class AesGcmCtrV1;
+
+class EncryptionAlgorithm;
+
+class FileMetaData;
+
+class FileCryptoMetaData;
+
+typedef struct _Statistics__isset {
+  _Statistics__isset() : max(false), min(false), null_count(false), distinct_count(false), max_value(false), min_value(false) {}
+  bool max :1;
+  bool min :1;
+  bool null_count :1;
+  bool distinct_count :1;
+  bool max_value :1;
+  bool min_value :1;
+} _Statistics__isset;
+
+class Statistics : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  Statistics(const Statistics&);
+  Statistics& operator=(const Statistics&);
+  Statistics() : max(), min(), null_count(0), distinct_count(0), max_value(), min_value() {
+  }
+
+  virtual ~Statistics() throw();
+  std::string max;
+  std::string min;
+  int64_t null_count;
+  int64_t distinct_count;
+  std::string max_value;
+  std::string min_value;
+
+  _Statistics__isset __isset;
+
+  void __set_max(const std::string& val);
+
+  void __set_min(const std::string& val);
+
+  void __set_null_count(const int64_t val);
+
+  void __set_distinct_count(const int64_t val);
+
+  void __set_max_value(const std::string& val);
+
+  void __set_min_value(const std::string& val);
+
+  bool operator == (const Statistics & rhs) const
+  {
+    if (__isset.max != rhs.__isset.max)
+      return false;
+    else if (__isset.max && !(max == rhs.max))
+      return false;
+    if (__isset.min != rhs.__isset.min)
+      return false;
+    else if (__isset.min && !(min == rhs.min))
+      return false;
+    if (__isset.null_count != rhs.__isset.null_count)
+      return false;
+    else if (__isset.null_count && !(null_count == rhs.null_count))
+      return false;
+    if (__isset.distinct_count != rhs.__isset.distinct_count)
+      return false;
+    else if (__isset.distinct_count && !(distinct_count == rhs.distinct_count))
+      return false;
+    if (__isset.max_value != rhs.__isset.max_value)
+      return false;
+    else if (__isset.max_value && !(max_value == rhs.max_value))
+      return false;
+    if (__isset.min_value != rhs.__isset.min_value)
+      return false;
+    else if (__isset.min_value && !(min_value == rhs.min_value))
+      return false;
+    return true;
+  }
+  bool operator != (const Statistics &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const Statistics & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(Statistics &a, Statistics &b);
+
+std::ostream& operator<<(std::ostream& out, const Statistics& obj);
+
+
+class StringType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  StringType(const StringType&);
+  StringType& operator=(const StringType&);
+  StringType() {
+  }
+
+  virtual ~StringType() throw();
+
+  bool operator == (const StringType & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const StringType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const StringType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(StringType &a, StringType &b);
+
+std::ostream& operator<<(std::ostream& out, const StringType& obj);
+
+
+class UUIDType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  UUIDType(const UUIDType&);
+  UUIDType& operator=(const UUIDType&);
+  UUIDType() {
+  }
+
+  virtual ~UUIDType() throw();
+
+  bool operator == (const UUIDType & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const UUIDType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const UUIDType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(UUIDType &a, UUIDType &b);
+
+std::ostream& operator<<(std::ostream& out, const UUIDType& obj);
+
+
+class MapType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  MapType(const MapType&);
+  MapType& operator=(const MapType&);
+  MapType() {
+  }
+
+  virtual ~MapType() throw();
+
+  bool operator == (const MapType & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const MapType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const MapType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(MapType &a, MapType &b);
+
+std::ostream& operator<<(std::ostream& out, const MapType& obj);
+
+
+class ListType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  ListType(const ListType&);
+  ListType& operator=(const ListType&);
+  ListType() {
+  }
+
+  virtual ~ListType() throw();
+
+  bool operator == (const ListType & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const ListType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const ListType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(ListType &a, ListType &b);
+
+std::ostream& operator<<(std::ostream& out, const ListType& obj);
+
+
+class EnumType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  EnumType(const EnumType&);
+  EnumType& operator=(const EnumType&);
+  EnumType() {
+  }
+
+  virtual ~EnumType() throw();
+
+  bool operator == (const EnumType & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const EnumType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const EnumType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(EnumType &a, EnumType &b);
+
+std::ostream& operator<<(std::ostream& out, const EnumType& obj);
+
+
+class DateType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  DateType(const DateType&);
+  DateType& operator=(const DateType&);
+  DateType() {
+  }
+
+  virtual ~DateType() throw();
+
+  bool operator == (const DateType & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const DateType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const DateType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(DateType &a, DateType &b);
+
+std::ostream& operator<<(std::ostream& out, const DateType& obj);
+
+
+class NullType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  NullType(const NullType&);
+  NullType& operator=(const NullType&);
+  NullType() {
+  }
+
+  virtual ~NullType() throw();
+
+  bool operator == (const NullType & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const NullType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const NullType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(NullType &a, NullType &b);
+
+std::ostream& operator<<(std::ostream& out, const NullType& obj);
+
+
+class DecimalType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  DecimalType(const DecimalType&);
+  DecimalType& operator=(const DecimalType&);
+  DecimalType() : scale(0), precision(0) {
+  }
+
+  virtual ~DecimalType() throw();
+  int32_t scale;
+  int32_t precision;
+
+  void __set_scale(const int32_t val);
+
+  void __set_precision(const int32_t val);
+
+  bool operator == (const DecimalType & rhs) const
+  {
+    if (!(scale == rhs.scale))
+      return false;
+    if (!(precision == rhs.precision))
+      return false;
+    return true;
+  }
+  bool operator != (const DecimalType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const DecimalType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(DecimalType &a, DecimalType &b);
+
+std::ostream& operator<<(std::ostream& out, const DecimalType& obj);
+
+
+class MilliSeconds : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  MilliSeconds(const MilliSeconds&);
+  MilliSeconds& operator=(const MilliSeconds&);
+  MilliSeconds() {
+  }
+
+  virtual ~MilliSeconds() throw();
+
+  bool operator == (const MilliSeconds & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const MilliSeconds &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const MilliSeconds & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(MilliSeconds &a, MilliSeconds &b);
+
+std::ostream& operator<<(std::ostream& out, const MilliSeconds& obj);
+
+
+class MicroSeconds : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  MicroSeconds(const MicroSeconds&);
+  MicroSeconds& operator=(const MicroSeconds&);
+  MicroSeconds() {
+  }
+
+  virtual ~MicroSeconds() throw();
+
+  bool operator == (const MicroSeconds & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const MicroSeconds &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const MicroSeconds & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(MicroSeconds &a, MicroSeconds &b);
+
+std::ostream& operator<<(std::ostream& out, const MicroSeconds& obj);
+
+
+class NanoSeconds : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  NanoSeconds(const NanoSeconds&);
+  NanoSeconds& operator=(const NanoSeconds&);
+  NanoSeconds() {
+  }
+
+  virtual ~NanoSeconds() throw();
+
+  bool operator == (const NanoSeconds & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const NanoSeconds &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const NanoSeconds & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(NanoSeconds &a, NanoSeconds &b);
+
+std::ostream& operator<<(std::ostream& out, const NanoSeconds& obj);
+
+typedef struct _TimeUnit__isset {
+  _TimeUnit__isset() : MILLIS(false), MICROS(false), NANOS(false) {}
+  bool MILLIS :1;
+  bool MICROS :1;
+  bool NANOS :1;
+} _TimeUnit__isset;
+
+class TimeUnit : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  TimeUnit(const TimeUnit&);
+  TimeUnit& operator=(const TimeUnit&);
+  TimeUnit() {
+  }
+
+  virtual ~TimeUnit() throw();
+  MilliSeconds MILLIS;
+  MicroSeconds MICROS;
+  NanoSeconds NANOS;
+
+  _TimeUnit__isset __isset;
+
+  void __set_MILLIS(const MilliSeconds& val);
+
+  void __set_MICROS(const MicroSeconds& val);
+
+  void __set_NANOS(const NanoSeconds& val);
+
+  bool operator == (const TimeUnit & rhs) const
+  {
+    if (__isset.MILLIS != rhs.__isset.MILLIS)
+      return false;
+    else if (__isset.MILLIS && !(MILLIS == rhs.MILLIS))
+      return false;
+    if (__isset.MICROS != rhs.__isset.MICROS)
+      return false;
+    else if (__isset.MICROS && !(MICROS == rhs.MICROS))
+      return false;
+    if (__isset.NANOS != rhs.__isset.NANOS)
+      return false;
+    else if (__isset.NANOS && !(NANOS == rhs.NANOS))
+      return false;
+    return true;
+  }
+  bool operator != (const TimeUnit &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const TimeUnit & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(TimeUnit &a, TimeUnit &b);
+
+std::ostream& operator<<(std::ostream& out, const TimeUnit& obj);
+
+
+class TimestampType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  TimestampType(const TimestampType&);
+  TimestampType& operator=(const TimestampType&);
+  TimestampType() : isAdjustedToUTC(0) {
+  }
+
+  virtual ~TimestampType() throw();
+  bool isAdjustedToUTC;
+  TimeUnit unit;
+
+  void __set_isAdjustedToUTC(const bool val);
+
+  void __set_unit(const TimeUnit& val);
+
+  bool operator == (const TimestampType & rhs) const
+  {
+    if (!(isAdjustedToUTC == rhs.isAdjustedToUTC))
+      return false;
+    if (!(unit == rhs.unit))
+      return false;
+    return true;
+  }
+  bool operator != (const TimestampType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const TimestampType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(TimestampType &a, TimestampType &b);
+
+std::ostream& operator<<(std::ostream& out, const TimestampType& obj);
+
+
+class TimeType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  TimeType(const TimeType&);
+  TimeType& operator=(const TimeType&);
+  TimeType() : isAdjustedToUTC(0) {
+  }
+
+  virtual ~TimeType() throw();
+  bool isAdjustedToUTC;
+  TimeUnit unit;
+
+  void __set_isAdjustedToUTC(const bool val);
+
+  void __set_unit(const TimeUnit& val);
+
+  bool operator == (const TimeType & rhs) const
+  {
+    if (!(isAdjustedToUTC == rhs.isAdjustedToUTC))
+      return false;
+    if (!(unit == rhs.unit))
+      return false;
+    return true;
+  }
+  bool operator != (const TimeType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const TimeType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(TimeType &a, TimeType &b);
+
+std::ostream& operator<<(std::ostream& out, const TimeType& obj);
+
+
+class IntType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  IntType(const IntType&);
+  IntType& operator=(const IntType&);
+  IntType() : bitWidth(0), isSigned(0) {
+  }
+
+  virtual ~IntType() throw();
+  int8_t bitWidth;
+  bool isSigned;
+
+  void __set_bitWidth(const int8_t val);
+
+  void __set_isSigned(const bool val);
+
+  bool operator == (const IntType & rhs) const
+  {
+    if (!(bitWidth == rhs.bitWidth))
+      return false;
+    if (!(isSigned == rhs.isSigned))
+      return false;
+    return true;
+  }
+  bool operator != (const IntType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const IntType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(IntType &a, IntType &b);
+
+std::ostream& operator<<(std::ostream& out, const IntType& obj);
+
+
+class JsonType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  JsonType(const JsonType&);
+  JsonType& operator=(const JsonType&);
+  JsonType() {
+  }
+
+  virtual ~JsonType() throw();
+
+  bool operator == (const JsonType & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const JsonType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const JsonType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(JsonType &a, JsonType &b);
+
+std::ostream& operator<<(std::ostream& out, const JsonType& obj);
+
+
+class BsonType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  BsonType(const BsonType&);
+  BsonType& operator=(const BsonType&);
+  BsonType() {
+  }
+
+  virtual ~BsonType() throw();
+
+  bool operator == (const BsonType & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const BsonType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const BsonType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(BsonType &a, BsonType &b);
+
+std::ostream& operator<<(std::ostream& out, const BsonType& obj);
+
+typedef struct _LogicalType__isset {
+  _LogicalType__isset() : STRING(false), MAP(false), LIST(false), ENUM(false), DECIMAL(false), DATE(false), TIME(false), TIMESTAMP(false), INTEGER(false), UNKNOWN(false), JSON(false), BSON(false), UUID(false) {}
+  bool STRING :1;
+  bool MAP :1;
+  bool LIST :1;
+  bool ENUM :1;
+  bool DECIMAL :1;
+  bool DATE :1;
+  bool TIME :1;
+  bool TIMESTAMP :1;
+  bool INTEGER :1;
+  bool UNKNOWN :1;
+  bool JSON :1;
+  bool BSON :1;
+  bool UUID :1;
+} _LogicalType__isset;
+
+class LogicalType : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  LogicalType(const LogicalType&);
+  LogicalType& operator=(const LogicalType&);
+  LogicalType() {
+  }
+
+  virtual ~LogicalType() throw();
+  StringType STRING;
+  MapType MAP;
+  ListType LIST;
+  EnumType ENUM;
+  DecimalType DECIMAL;
+  DateType DATE;
+  TimeType TIME;
+  TimestampType TIMESTAMP;
+  IntType INTEGER;
+  NullType UNKNOWN;
+  JsonType JSON;
+  BsonType BSON;
+  UUIDType UUID;
+
+  _LogicalType__isset __isset;
+
+  void __set_STRING(const StringType& val);
+
+  void __set_MAP(const MapType& val);
+
+  void __set_LIST(const ListType& val);
+
+  void __set_ENUM(const EnumType& val);
+
+  void __set_DECIMAL(const DecimalType& val);
+
+  void __set_DATE(const DateType& val);
+
+  void __set_TIME(const TimeType& val);
+
+  void __set_TIMESTAMP(const TimestampType& val);
+
+  void __set_INTEGER(const IntType& val);
+
+  void __set_UNKNOWN(const NullType& val);
+
+  void __set_JSON(const JsonType& val);
+
+  void __set_BSON(const BsonType& val);
+
+  void __set_UUID(const UUIDType& val);
+
+  bool operator == (const LogicalType & rhs) const
+  {
+    if (__isset.STRING != rhs.__isset.STRING)
+      return false;
+    else if (__isset.STRING && !(STRING == rhs.STRING))
+      return false;
+    if (__isset.MAP != rhs.__isset.MAP)
+      return false;
+    else if (__isset.MAP && !(MAP == rhs.MAP))
+      return false;
+    if (__isset.LIST != rhs.__isset.LIST)
+      return false;
+    else if (__isset.LIST && !(LIST == rhs.LIST))
+      return false;
+    if (__isset.ENUM != rhs.__isset.ENUM)
+      return false;
+    else if (__isset.ENUM && !(ENUM == rhs.ENUM))
+      return false;
+    if (__isset.DECIMAL != rhs.__isset.DECIMAL)
+      return false;
+    else if (__isset.DECIMAL && !(DECIMAL == rhs.DECIMAL))
+      return false;
+    if (__isset.DATE != rhs.__isset.DATE)
+      return false;
+    else if (__isset.DATE && !(DATE == rhs.DATE))
+      return false;
+    if (__isset.TIME != rhs.__isset.TIME)
+      return false;
+    else if (__isset.TIME && !(TIME == rhs.TIME))
+      return false;
+    if (__isset.TIMESTAMP != rhs.__isset.TIMESTAMP)
+      return false;
+    else if (__isset.TIMESTAMP && !(TIMESTAMP == rhs.TIMESTAMP))
+      return false;
+    if (__isset.INTEGER != rhs.__isset.INTEGER)
+      return false;
+    else if (__isset.INTEGER && !(INTEGER == rhs.INTEGER))
+      return false;
+    if (__isset.UNKNOWN != rhs.__isset.UNKNOWN)
+      return false;
+    else if (__isset.UNKNOWN && !(UNKNOWN == rhs.UNKNOWN))
+      return false;
+    if (__isset.JSON != rhs.__isset.JSON)
+      return false;
+    else if (__isset.JSON && !(JSON == rhs.JSON))
+      return false;
+    if (__isset.BSON != rhs.__isset.BSON)
+      return false;
+    else if (__isset.BSON && !(BSON == rhs.BSON))
+      return false;
+    if (__isset.UUID != rhs.__isset.UUID)
+      return false;
+    else if (__isset.UUID && !(UUID == rhs.UUID))
+      return false;
+    return true;
+  }
+  bool operator != (const LogicalType &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const LogicalType & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(LogicalType &a, LogicalType &b);
+
+std::ostream& operator<<(std::ostream& out, const LogicalType& obj);
+
+typedef struct _SchemaElement__isset {
+  _SchemaElement__isset() : type(false), type_length(false), repetition_type(false), num_children(false), converted_type(false), scale(false), precision(false), field_id(false), logicalType(false) {}
+  bool type :1;
+  bool type_length :1;
+  bool repetition_type :1;
+  bool num_children :1;
+  bool converted_type :1;
+  bool scale :1;
+  bool precision :1;
+  bool field_id :1;
+  bool logicalType :1;
+} _SchemaElement__isset;
+
+class SchemaElement : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  SchemaElement(const SchemaElement&);
+  SchemaElement& operator=(const SchemaElement&);
+  SchemaElement() : type((Type::type)0), type_length(0), repetition_type((FieldRepetitionType::type)0), name(), num_children(0), converted_type((ConvertedType::type)0), scale(0), precision(0), field_id(0) {
+  }
+
+  virtual ~SchemaElement() throw();
+  Type::type type;
+  int32_t type_length;
+  FieldRepetitionType::type repetition_type;
+  std::string name;
+  int32_t num_children;
+  ConvertedType::type converted_type;
+  int32_t scale;
+  int32_t precision;
+  int32_t field_id;
+  LogicalType logicalType;
+
+  _SchemaElement__isset __isset;
+
+  void __set_type(const Type::type val);
+
+  void __set_type_length(const int32_t val);
+
+  void __set_repetition_type(const FieldRepetitionType::type val);
+
+  void __set_name(const std::string& val);
+
+  void __set_num_children(const int32_t val);
+
+  void __set_converted_type(const ConvertedType::type val);
+
+  void __set_scale(const int32_t val);
+
+  void __set_precision(const int32_t val);
+
+  void __set_field_id(const int32_t val);
+
+  void __set_logicalType(const LogicalType& val);
+
+  bool operator == (const SchemaElement & rhs) const
+  {
+    if (__isset.type != rhs.__isset.type)
+      return false;
+    else if (__isset.type && !(type == rhs.type))
+      return false;
+    if (__isset.type_length != rhs.__isset.type_length)
+      return false;
+    else if (__isset.type_length && !(type_length == rhs.type_length))
+      return false;
+    if (__isset.repetition_type != rhs.__isset.repetition_type)
+      return false;
+    else if (__isset.repetition_type && !(repetition_type == rhs.repetition_type))
+      return false;
+    if (!(name == rhs.name))
+      return false;
+    if (__isset.num_children != rhs.__isset.num_children)
+      return false;
+    else if (__isset.num_children && !(num_children == rhs.num_children))
+      return false;
+    if (__isset.converted_type != rhs.__isset.converted_type)
+      return false;
+    else if (__isset.converted_type && !(converted_type == rhs.converted_type))
+      return false;
+    if (__isset.scale != rhs.__isset.scale)
+      return false;
+    else if (__isset.scale && !(scale == rhs.scale))
+      return false;
+    if (__isset.precision != rhs.__isset.precision)
+      return false;
+    else if (__isset.precision && !(precision == rhs.precision))
+      return false;
+    if (__isset.field_id != rhs.__isset.field_id)
+      return false;
+    else if (__isset.field_id && !(field_id == rhs.field_id))
+      return false;
+    if (__isset.logicalType != rhs.__isset.logicalType)
+      return false;
+    else if (__isset.logicalType && !(logicalType == rhs.logicalType))
+      return false;
+    return true;
+  }
+  bool operator != (const SchemaElement &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const SchemaElement & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(SchemaElement &a, SchemaElement &b);
+
+std::ostream& operator<<(std::ostream& out, const SchemaElement& obj);
+
+typedef struct _DataPageHeader__isset {
+  _DataPageHeader__isset() : statistics(false) {}
+  bool statistics :1;
+} _DataPageHeader__isset;
+
+class DataPageHeader : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  DataPageHeader(const DataPageHeader&);
+  DataPageHeader& operator=(const DataPageHeader&);
+  DataPageHeader() : num_values(0), encoding((Encoding::type)0), definition_level_encoding((Encoding::type)0), repetition_level_encoding((Encoding::type)0) {
+  }
+
+  virtual ~DataPageHeader() throw();
+  int32_t num_values;
+  Encoding::type encoding;
+  Encoding::type definition_level_encoding;
+  Encoding::type repetition_level_encoding;
+  Statistics statistics;
+
+  _DataPageHeader__isset __isset;
+
+  void __set_num_values(const int32_t val);
+
+  void __set_encoding(const Encoding::type val);
+
+  void __set_definition_level_encoding(const Encoding::type val);
+
+  void __set_repetition_level_encoding(const Encoding::type val);
+
+  void __set_statistics(const Statistics& val);
+
+  bool operator == (const DataPageHeader & rhs) const
+  {
+    if (!(num_values == rhs.num_values))
+      return false;
+    if (!(encoding == rhs.encoding))
+      return false;
+    if (!(definition_level_encoding == rhs.definition_level_encoding))
+      return false;
+    if (!(repetition_level_encoding == rhs.repetition_level_encoding))
+      return false;
+    if (__isset.statistics != rhs.__isset.statistics)
+      return false;
+    else if (__isset.statistics && !(statistics == rhs.statistics))
+      return false;
+    return true;
+  }
+  bool operator != (const DataPageHeader &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const DataPageHeader & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(DataPageHeader &a, DataPageHeader &b);
+
+std::ostream& operator<<(std::ostream& out, const DataPageHeader& obj);
+
+
+class IndexPageHeader : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  IndexPageHeader(const IndexPageHeader&);
+  IndexPageHeader& operator=(const IndexPageHeader&);
+  IndexPageHeader() {
+  }
+
+  virtual ~IndexPageHeader() throw();
+
+  bool operator == (const IndexPageHeader & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const IndexPageHeader &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const IndexPageHeader & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(IndexPageHeader &a, IndexPageHeader &b);
+
+std::ostream& operator<<(std::ostream& out, const IndexPageHeader& obj);
+
+typedef struct _DictionaryPageHeader__isset {
+  _DictionaryPageHeader__isset() : is_sorted(false) {}
+  bool is_sorted :1;
+} _DictionaryPageHeader__isset;
+
+class DictionaryPageHeader : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  DictionaryPageHeader(const DictionaryPageHeader&);
+  DictionaryPageHeader& operator=(const DictionaryPageHeader&);
+  DictionaryPageHeader() : num_values(0), encoding((Encoding::type)0), is_sorted(0) {
+  }
+
+  virtual ~DictionaryPageHeader() throw();
+  int32_t num_values;
+  Encoding::type encoding;
+  bool is_sorted;
+
+  _DictionaryPageHeader__isset __isset;
+
+  void __set_num_values(const int32_t val);
+
+  void __set_encoding(const Encoding::type val);
+
+  void __set_is_sorted(const bool val);
+
+  bool operator == (const DictionaryPageHeader & rhs) const
+  {
+    if (!(num_values == rhs.num_values))
+      return false;
+    if (!(encoding == rhs.encoding))
+      return false;
+    if (__isset.is_sorted != rhs.__isset.is_sorted)
+      return false;
+    else if (__isset.is_sorted && !(is_sorted == rhs.is_sorted))
+      return false;
+    return true;
+  }
+  bool operator != (const DictionaryPageHeader &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const DictionaryPageHeader & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(DictionaryPageHeader &a, DictionaryPageHeader &b);
+
+std::ostream& operator<<(std::ostream& out, const DictionaryPageHeader& obj);
+
+typedef struct _DataPageHeaderV2__isset {
+  _DataPageHeaderV2__isset() : is_compressed(true), statistics(false) {}
+  bool is_compressed :1;
+  bool statistics :1;
+} _DataPageHeaderV2__isset;
+
+class DataPageHeaderV2 : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  DataPageHeaderV2(const DataPageHeaderV2&);
+  DataPageHeaderV2& operator=(const DataPageHeaderV2&);
+  DataPageHeaderV2() : num_values(0), num_nulls(0), num_rows(0), encoding((Encoding::type)0), definition_levels_byte_length(0), repetition_levels_byte_length(0), is_compressed(true) {
+  }
+
+  virtual ~DataPageHeaderV2() throw();
+  int32_t num_values;
+  int32_t num_nulls;
+  int32_t num_rows;
+  Encoding::type encoding;
+  int32_t definition_levels_byte_length;
+  int32_t repetition_levels_byte_length;
+  bool is_compressed;
+  Statistics statistics;
+
+  _DataPageHeaderV2__isset __isset;
+
+  void __set_num_values(const int32_t val);
+
+  void __set_num_nulls(const int32_t val);
+
+  void __set_num_rows(const int32_t val);
+
+  void __set_encoding(const Encoding::type val);
+
+  void __set_definition_levels_byte_length(const int32_t val);
+
+  void __set_repetition_levels_byte_length(const int32_t val);
+
+  void __set_is_compressed(const bool val);
+
+  void __set_statistics(const Statistics& val);
+
+  bool operator == (const DataPageHeaderV2 & rhs) const
+  {
+    if (!(num_values == rhs.num_values))
+      return false;
+    if (!(num_nulls == rhs.num_nulls))
+      return false;
+    if (!(num_rows == rhs.num_rows))
+      return false;
+    if (!(encoding == rhs.encoding))
+      return false;
+    if (!(definition_levels_byte_length == rhs.definition_levels_byte_length))
+      return false;
+    if (!(repetition_levels_byte_length == rhs.repetition_levels_byte_length))
+      return false;
+    if (__isset.is_compressed != rhs.__isset.is_compressed)
+      return false;
+    else if (__isset.is_compressed && !(is_compressed == rhs.is_compressed))
+      return false;
+    if (__isset.statistics != rhs.__isset.statistics)
+      return false;
+    else if (__isset.statistics && !(statistics == rhs.statistics))
+      return false;
+    return true;
+  }
+  bool operator != (const DataPageHeaderV2 &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const DataPageHeaderV2 & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(DataPageHeaderV2 &a, DataPageHeaderV2 &b);
+
+std::ostream& operator<<(std::ostream& out, const DataPageHeaderV2& obj);
+
+typedef struct _PageHeader__isset {
+  _PageHeader__isset() : crc(false), data_page_header(false), index_page_header(false), dictionary_page_header(false), data_page_header_v2(false) {}
+  bool crc :1;
+  bool data_page_header :1;
+  bool index_page_header :1;
+  bool dictionary_page_header :1;
+  bool data_page_header_v2 :1;
+} _PageHeader__isset;
+
+class PageHeader : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  PageHeader(const PageHeader&);
+  PageHeader& operator=(const PageHeader&);
+  PageHeader() : type((PageType::type)0), uncompressed_page_size(0), compressed_page_size(0), crc(0) {
+  }
+
+  virtual ~PageHeader() throw();
+  PageType::type type;
+  int32_t uncompressed_page_size;
+  int32_t compressed_page_size;
+  int32_t crc;
+  DataPageHeader data_page_header;
+  IndexPageHeader index_page_header;
+  DictionaryPageHeader dictionary_page_header;
+  DataPageHeaderV2 data_page_header_v2;
+
+  _PageHeader__isset __isset;
+
+  void __set_type(const PageType::type val);
+
+  void __set_uncompressed_page_size(const int32_t val);
+
+  void __set_compressed_page_size(const int32_t val);
+
+  void __set_crc(const int32_t val);
+
+  void __set_data_page_header(const DataPageHeader& val);
+
+  void __set_index_page_header(const IndexPageHeader& val);
+
+  void __set_dictionary_page_header(const DictionaryPageHeader& val);
+
+  void __set_data_page_header_v2(const DataPageHeaderV2& val);
+
+  bool operator == (const PageHeader & rhs) const
+  {
+    if (!(type == rhs.type))
+      return false;
+    if (!(uncompressed_page_size == rhs.uncompressed_page_size))
+      return false;
+    if (!(compressed_page_size == rhs.compressed_page_size))
+      return false;
+    if (__isset.crc != rhs.__isset.crc)
+      return false;
+    else if (__isset.crc && !(crc == rhs.crc))
+      return false;
+    if (__isset.data_page_header != rhs.__isset.data_page_header)
+      return false;
+    else if (__isset.data_page_header && !(data_page_header == rhs.data_page_header))
+      return false;
+    if (__isset.index_page_header != rhs.__isset.index_page_header)
+      return false;
+    else if (__isset.index_page_header && !(index_page_header == rhs.index_page_header))
+      return false;
+    if (__isset.dictionary_page_header != rhs.__isset.dictionary_page_header)
+      return false;
+    else if (__isset.dictionary_page_header && !(dictionary_page_header == rhs.dictionary_page_header))
+      return false;
+    if (__isset.data_page_header_v2 != rhs.__isset.data_page_header_v2)
+      return false;
+    else if (__isset.data_page_header_v2 && !(data_page_header_v2 == rhs.data_page_header_v2))
+      return false;
+    return true;
+  }
+  bool operator != (const PageHeader &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const PageHeader & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(PageHeader &a, PageHeader &b);
+
+std::ostream& operator<<(std::ostream& out, const PageHeader& obj);
+
+typedef struct _KeyValue__isset {
+  _KeyValue__isset() : value(false) {}
+  bool value :1;
+} _KeyValue__isset;
+
+class KeyValue : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  KeyValue(const KeyValue&);
+  KeyValue& operator=(const KeyValue&);
+  KeyValue() : key(), value() {
+  }
+
+  virtual ~KeyValue() throw();
+  std::string key;
+  std::string value;
+
+  _KeyValue__isset __isset;
+
+  void __set_key(const std::string& val);
+
+  void __set_value(const std::string& val);
+
+  bool operator == (const KeyValue & rhs) const
+  {
+    if (!(key == rhs.key))
+      return false;
+    if (__isset.value != rhs.__isset.value)
+      return false;
+    else if (__isset.value && !(value == rhs.value))
+      return false;
+    return true;
+  }
+  bool operator != (const KeyValue &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const KeyValue & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(KeyValue &a, KeyValue &b);
+
+std::ostream& operator<<(std::ostream& out, const KeyValue& obj);
+
+
+class SortingColumn : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  SortingColumn(const SortingColumn&);
+  SortingColumn& operator=(const SortingColumn&);
+  SortingColumn() : column_idx(0), descending(0), nulls_first(0) {
+  }
+
+  virtual ~SortingColumn() throw();
+  int32_t column_idx;
+  bool descending;
+  bool nulls_first;
+
+  void __set_column_idx(const int32_t val);
+
+  void __set_descending(const bool val);
+
+  void __set_nulls_first(const bool val);
+
+  bool operator == (const SortingColumn & rhs) const
+  {
+    if (!(column_idx == rhs.column_idx))
+      return false;
+    if (!(descending == rhs.descending))
+      return false;
+    if (!(nulls_first == rhs.nulls_first))
+      return false;
+    return true;
+  }
+  bool operator != (const SortingColumn &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const SortingColumn & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(SortingColumn &a, SortingColumn &b);
+
+std::ostream& operator<<(std::ostream& out, const SortingColumn& obj);
+
+
+class PageEncodingStats : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  PageEncodingStats(const PageEncodingStats&);
+  PageEncodingStats& operator=(const PageEncodingStats&);
+  PageEncodingStats() : page_type((PageType::type)0), encoding((Encoding::type)0), count(0) {
+  }
+
+  virtual ~PageEncodingStats() throw();
+  PageType::type page_type;
+  Encoding::type encoding;
+  int32_t count;
+
+  void __set_page_type(const PageType::type val);
+
+  void __set_encoding(const Encoding::type val);
+
+  void __set_count(const int32_t val);
+
+  bool operator == (const PageEncodingStats & rhs) const
+  {
+    if (!(page_type == rhs.page_type))
+      return false;
+    if (!(encoding == rhs.encoding))
+      return false;
+    if (!(count == rhs.count))
+      return false;
+    return true;
+  }
+  bool operator != (const PageEncodingStats &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const PageEncodingStats & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(PageEncodingStats &a, PageEncodingStats &b);
+
+std::ostream& operator<<(std::ostream& out, const PageEncodingStats& obj);
+
+typedef struct _ColumnMetaData__isset {
+  _ColumnMetaData__isset() : key_value_metadata(false), index_page_offset(false), dictionary_page_offset(false), statistics(false), encoding_stats(false) {}
+  bool key_value_metadata :1;
+  bool index_page_offset :1;
+  bool dictionary_page_offset :1;
+  bool statistics :1;
+  bool encoding_stats :1;
+} _ColumnMetaData__isset;
+
+class ColumnMetaData : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  ColumnMetaData(const ColumnMetaData&);
+  ColumnMetaData& operator=(const ColumnMetaData&);
+  ColumnMetaData() : type((Type::type)0), codec((CompressionCodec::type)0), num_values(0), total_uncompressed_size(0), total_compressed_size(0), data_page_offset(0), index_page_offset(0), dictionary_page_offset(0) {
+  }
+
+  virtual ~ColumnMetaData() throw();
+  Type::type type;
+  std::vector<Encoding::type>  encodings;
+  std::vector<std::string>  path_in_schema;
+  CompressionCodec::type codec;
+  int64_t num_values;
+  int64_t total_uncompressed_size;
+  int64_t total_compressed_size;
+  std::vector<KeyValue>  key_value_metadata;
+  int64_t data_page_offset;
+  int64_t index_page_offset;
+  int64_t dictionary_page_offset;
+  Statistics statistics;
+  std::vector<PageEncodingStats>  encoding_stats;
+
+  _ColumnMetaData__isset __isset;
+
+  void __set_type(const Type::type val);
+
+  void __set_encodings(const std::vector<Encoding::type> & val);
+
+  void __set_path_in_schema(const std::vector<std::string> & val);
+
+  void __set_codec(const CompressionCodec::type val);
+
+  void __set_num_values(const int64_t val);
+
+  void __set_total_uncompressed_size(const int64_t val);
+
+  void __set_total_compressed_size(const int64_t val);
+
+  void __set_key_value_metadata(const std::vector<KeyValue> & val);
+
+  void __set_data_page_offset(const int64_t val);
+
+  void __set_index_page_offset(const int64_t val);
+
+  void __set_dictionary_page_offset(const int64_t val);
+
+  void __set_statistics(const Statistics& val);
+
+  void __set_encoding_stats(const std::vector<PageEncodingStats> & val);
+
+  bool operator == (const ColumnMetaData & rhs) const
+  {
+    if (!(type == rhs.type))
+      return false;
+    if (!(encodings == rhs.encodings))
+      return false;
+    if (!(path_in_schema == rhs.path_in_schema))
+      return false;
+    if (!(codec == rhs.codec))
+      return false;
+    if (!(num_values == rhs.num_values))
+      return false;
+    if (!(total_uncompressed_size == rhs.total_uncompressed_size))
+      return false;
+    if (!(total_compressed_size == rhs.total_compressed_size))
+      return false;
+    if (__isset.key_value_metadata != rhs.__isset.key_value_metadata)
+      return false;
+    else if (__isset.key_value_metadata && !(key_value_metadata == rhs.key_value_metadata))
+      return false;
+    if (!(data_page_offset == rhs.data_page_offset))
+      return false;
+    if (__isset.index_page_offset != rhs.__isset.index_page_offset)
+      return false;
+    else if (__isset.index_page_offset && !(index_page_offset == rhs.index_page_offset))
+      return false;
+    if (__isset.dictionary_page_offset != rhs.__isset.dictionary_page_offset)
+      return false;
+    else if (__isset.dictionary_page_offset && !(dictionary_page_offset == rhs.dictionary_page_offset))
+      return false;
+    if (__isset.statistics != rhs.__isset.statistics)
+      return false;
+    else if (__isset.statistics && !(statistics == rhs.statistics))
+      return false;
+    if (__isset.encoding_stats != rhs.__isset.encoding_stats)
+      return false;
+    else if (__isset.encoding_stats && !(encoding_stats == rhs.encoding_stats))
+      return false;
+    return true;
+  }
+  bool operator != (const ColumnMetaData &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const ColumnMetaData & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(ColumnMetaData &a, ColumnMetaData &b);
+
+std::ostream& operator<<(std::ostream& out, const ColumnMetaData& obj);
+
+
+class EncryptionWithFooterKey : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  EncryptionWithFooterKey(const EncryptionWithFooterKey&);
+  EncryptionWithFooterKey& operator=(const EncryptionWithFooterKey&);
+  EncryptionWithFooterKey() {
+  }
+
+  virtual ~EncryptionWithFooterKey() throw();
+
+  bool operator == (const EncryptionWithFooterKey & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const EncryptionWithFooterKey &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const EncryptionWithFooterKey & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(EncryptionWithFooterKey &a, EncryptionWithFooterKey &b);
+
+std::ostream& operator<<(std::ostream& out, const EncryptionWithFooterKey& obj);
+
+typedef struct _EncryptionWithColumnKey__isset {
+  _EncryptionWithColumnKey__isset() : key_metadata(false) {}
+  bool key_metadata :1;
+} _EncryptionWithColumnKey__isset;
+
+class EncryptionWithColumnKey : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  EncryptionWithColumnKey(const EncryptionWithColumnKey&);
+  EncryptionWithColumnKey& operator=(const EncryptionWithColumnKey&);
+  EncryptionWithColumnKey() : key_metadata() {
+  }
+
+  virtual ~EncryptionWithColumnKey() throw();
+  std::vector<std::string>  path_in_schema;
+  std::string key_metadata;
+
+  _EncryptionWithColumnKey__isset __isset;
+
+  void __set_path_in_schema(const std::vector<std::string> & val);
+
+  void __set_key_metadata(const std::string& val);
+
+  bool operator == (const EncryptionWithColumnKey & rhs) const
+  {
+    if (!(path_in_schema == rhs.path_in_schema))
+      return false;
+    if (__isset.key_metadata != rhs.__isset.key_metadata)
+      return false;
+    else if (__isset.key_metadata && !(key_metadata == rhs.key_metadata))
+      return false;
+    return true;
+  }
+  bool operator != (const EncryptionWithColumnKey &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const EncryptionWithColumnKey & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(EncryptionWithColumnKey &a, EncryptionWithColumnKey &b);
+
+std::ostream& operator<<(std::ostream& out, const EncryptionWithColumnKey& obj);
+
+typedef struct _ColumnCryptoMetaData__isset {
+  _ColumnCryptoMetaData__isset() : ENCRYPTION_WITH_FOOTER_KEY(false), ENCRYPTION_WITH_COLUMN_KEY(false) {}
+  bool ENCRYPTION_WITH_FOOTER_KEY :1;
+  bool ENCRYPTION_WITH_COLUMN_KEY :1;
+} _ColumnCryptoMetaData__isset;
+
+class ColumnCryptoMetaData : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  ColumnCryptoMetaData(const ColumnCryptoMetaData&);
+  ColumnCryptoMetaData& operator=(const ColumnCryptoMetaData&);
+  ColumnCryptoMetaData() {
+  }
+
+  virtual ~ColumnCryptoMetaData() throw();
+  EncryptionWithFooterKey ENCRYPTION_WITH_FOOTER_KEY;
+  EncryptionWithColumnKey ENCRYPTION_WITH_COLUMN_KEY;
+
+  _ColumnCryptoMetaData__isset __isset;
+
+  void __set_ENCRYPTION_WITH_FOOTER_KEY(const EncryptionWithFooterKey& val);
+
+  void __set_ENCRYPTION_WITH_COLUMN_KEY(const EncryptionWithColumnKey& val);
+
+  bool operator == (const ColumnCryptoMetaData & rhs) const
+  {
+    if (__isset.ENCRYPTION_WITH_FOOTER_KEY != rhs.__isset.ENCRYPTION_WITH_FOOTER_KEY)
+      return false;
+    else if (__isset.ENCRYPTION_WITH_FOOTER_KEY && !(ENCRYPTION_WITH_FOOTER_KEY == rhs.ENCRYPTION_WITH_FOOTER_KEY))
+      return false;
+    if (__isset.ENCRYPTION_WITH_COLUMN_KEY != rhs.__isset.ENCRYPTION_WITH_COLUMN_KEY)
+      return false;
+    else if (__isset.ENCRYPTION_WITH_COLUMN_KEY && !(ENCRYPTION_WITH_COLUMN_KEY == rhs.ENCRYPTION_WITH_COLUMN_KEY))
+      return false;
+    return true;
+  }
+  bool operator != (const ColumnCryptoMetaData &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const ColumnCryptoMetaData & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(ColumnCryptoMetaData &a, ColumnCryptoMetaData &b);
+
+std::ostream& operator<<(std::ostream& out, const ColumnCryptoMetaData& obj);
+
+typedef struct _ColumnChunk__isset {
+  _ColumnChunk__isset() : file_path(false), meta_data(false), offset_index_offset(false), offset_index_length(false), column_index_offset(false), column_index_length(false), crypto_metadata(false), encrypted_column_metadata(false) {}
+  bool file_path :1;
+  bool meta_data :1;
+  bool offset_index_offset :1;
+  bool offset_index_length :1;
+  bool column_index_offset :1;
+  bool column_index_length :1;
+  bool crypto_metadata :1;
+  bool encrypted_column_metadata :1;
+} _ColumnChunk__isset;
+
+class ColumnChunk : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  ColumnChunk(const ColumnChunk&);
+  ColumnChunk& operator=(const ColumnChunk&);
+  ColumnChunk() : file_path(), file_offset(0), offset_index_offset(0), offset_index_length(0), column_index_offset(0), column_index_length(0), encrypted_column_metadata() {
+  }
+
+  virtual ~ColumnChunk() throw();
+  std::string file_path;
+  int64_t file_offset;
+  ColumnMetaData meta_data;
+  int64_t offset_index_offset;
+  int32_t offset_index_length;
+  int64_t column_index_offset;
+  int32_t column_index_length;
+  ColumnCryptoMetaData crypto_metadata;
+  std::string encrypted_column_metadata;
+
+  _ColumnChunk__isset __isset;
+
+  void __set_file_path(const std::string& val);
+
+  void __set_file_offset(const int64_t val);
+
+  void __set_meta_data(const ColumnMetaData& val);
+
+  void __set_offset_index_offset(const int64_t val);
+
+  void __set_offset_index_length(const int32_t val);
+
+  void __set_column_index_offset(const int64_t val);
+
+  void __set_column_index_length(const int32_t val);
+
+  void __set_crypto_metadata(const ColumnCryptoMetaData& val);
+
+  void __set_encrypted_column_metadata(const std::string& val);
+
+  bool operator == (const ColumnChunk & rhs) const
+  {
+    if (__isset.file_path != rhs.__isset.file_path)
+      return false;
+    else if (__isset.file_path && !(file_path == rhs.file_path))
+      return false;
+    if (!(file_offset == rhs.file_offset))
+      return false;
+    if (__isset.meta_data != rhs.__isset.meta_data)
+      return false;
+    else if (__isset.meta_data && !(meta_data == rhs.meta_data))
+      return false;
+    if (__isset.offset_index_offset != rhs.__isset.offset_index_offset)
+      return false;
+    else if (__isset.offset_index_offset && !(offset_index_offset == rhs.offset_index_offset))
+      return false;
+    if (__isset.offset_index_length != rhs.__isset.offset_index_length)
+      return false;
+    else if (__isset.offset_index_length && !(offset_index_length == rhs.offset_index_length))
+      return false;
+    if (__isset.column_index_offset != rhs.__isset.column_index_offset)
+      return false;
+    else if (__isset.column_index_offset && !(column_index_offset == rhs.column_index_offset))
+      return false;
+    if (__isset.column_index_length != rhs.__isset.column_index_length)
+      return false;
+    else if (__isset.column_index_length && !(column_index_length == rhs.column_index_length))
+      return false;
+    if (__isset.crypto_metadata != rhs.__isset.crypto_metadata)
+      return false;
+    else if (__isset.crypto_metadata && !(crypto_metadata == rhs.crypto_metadata))
+      return false;
+    if (__isset.encrypted_column_metadata != rhs.__isset.encrypted_column_metadata)
+      return false;
+    else if (__isset.encrypted_column_metadata && !(encrypted_column_metadata == rhs.encrypted_column_metadata))
+      return false;
+    return true;
+  }
+  bool operator != (const ColumnChunk &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const ColumnChunk & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(ColumnChunk &a, ColumnChunk &b);
+
+std::ostream& operator<<(std::ostream& out, const ColumnChunk& obj);
+
+typedef struct _RowGroup__isset {
+  _RowGroup__isset() : sorting_columns(false), file_offset(false), total_compressed_size(false), ordinal(false) {}
+  bool sorting_columns :1;
+  bool file_offset :1;
+  bool total_compressed_size :1;
+  bool ordinal :1;
+} _RowGroup__isset;
+
+class RowGroup : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  RowGroup(const RowGroup&);
+  RowGroup& operator=(const RowGroup&);
+  RowGroup() : total_byte_size(0), num_rows(0), file_offset(0), total_compressed_size(0), ordinal(0) {
+  }
+
+  virtual ~RowGroup() throw();
+  std::vector<ColumnChunk>  columns;
+  int64_t total_byte_size;
+  int64_t num_rows;
+  std::vector<SortingColumn>  sorting_columns;
+  int64_t file_offset;
+  int64_t total_compressed_size;
+  int16_t ordinal;
+
+  _RowGroup__isset __isset;
+
+  void __set_columns(const std::vector<ColumnChunk> & val);
+
+  void __set_total_byte_size(const int64_t val);
+
+  void __set_num_rows(const int64_t val);
+
+  void __set_sorting_columns(const std::vector<SortingColumn> & val);
+
+  void __set_file_offset(const int64_t val);
+
+  void __set_total_compressed_size(const int64_t val);
+
+  void __set_ordinal(const int16_t val);
+
+  bool operator == (const RowGroup & rhs) const
+  {
+    if (!(columns == rhs.columns))
+      return false;
+    if (!(total_byte_size == rhs.total_byte_size))
+      return false;
+    if (!(num_rows == rhs.num_rows))
+      return false;
+    if (__isset.sorting_columns != rhs.__isset.sorting_columns)
+      return false;
+    else if (__isset.sorting_columns && !(sorting_columns == rhs.sorting_columns))
+      return false;
+    if (__isset.file_offset != rhs.__isset.file_offset)
+      return false;
+    else if (__isset.file_offset && !(file_offset == rhs.file_offset))
+      return false;
+    if (__isset.total_compressed_size != rhs.__isset.total_compressed_size)
+      return false;
+    else if (__isset.total_compressed_size && !(total_compressed_size == rhs.total_compressed_size))
+      return false;
+    if (__isset.ordinal != rhs.__isset.ordinal)
+      return false;
+    else if (__isset.ordinal && !(ordinal == rhs.ordinal))
+      return false;
+    return true;
+  }
+  bool operator != (const RowGroup &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const RowGroup & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(RowGroup &a, RowGroup &b);
+
+std::ostream& operator<<(std::ostream& out, const RowGroup& obj);
+
+
+class TypeDefinedOrder : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  TypeDefinedOrder(const TypeDefinedOrder&);
+  TypeDefinedOrder& operator=(const TypeDefinedOrder&);
+  TypeDefinedOrder() {
+  }
+
+  virtual ~TypeDefinedOrder() throw();
+
+  bool operator == (const TypeDefinedOrder & /* rhs */) const
+  {
+    return true;
+  }
+  bool operator != (const TypeDefinedOrder &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const TypeDefinedOrder & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(TypeDefinedOrder &a, TypeDefinedOrder &b);
+
+std::ostream& operator<<(std::ostream& out, const TypeDefinedOrder& obj);
+
+typedef struct _ColumnOrder__isset {
+  _ColumnOrder__isset() : TYPE_ORDER(false) {}
+  bool TYPE_ORDER :1;
+} _ColumnOrder__isset;
+
+class ColumnOrder : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  ColumnOrder(const ColumnOrder&);
+  ColumnOrder& operator=(const ColumnOrder&);
+  ColumnOrder() {
+  }
+
+  virtual ~ColumnOrder() throw();
+  TypeDefinedOrder TYPE_ORDER;
+
+  _ColumnOrder__isset __isset;
+
+  void __set_TYPE_ORDER(const TypeDefinedOrder& val);
+
+  bool operator == (const ColumnOrder & rhs) const
+  {
+    if (__isset.TYPE_ORDER != rhs.__isset.TYPE_ORDER)
+      return false;
+    else if (__isset.TYPE_ORDER && !(TYPE_ORDER == rhs.TYPE_ORDER))
+      return false;
+    return true;
+  }
+  bool operator != (const ColumnOrder &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const ColumnOrder & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(ColumnOrder &a, ColumnOrder &b);
+
+std::ostream& operator<<(std::ostream& out, const ColumnOrder& obj);
+
+
+class PageLocation : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  PageLocation(const PageLocation&);
+  PageLocation& operator=(const PageLocation&);
+  PageLocation() : offset(0), compressed_page_size(0), first_row_index(0) {
+  }
+
+  virtual ~PageLocation() throw();
+  int64_t offset;
+  int32_t compressed_page_size;
+  int64_t first_row_index;
+
+  void __set_offset(const int64_t val);
+
+  void __set_compressed_page_size(const int32_t val);
+
+  void __set_first_row_index(const int64_t val);
+
+  bool operator == (const PageLocation & rhs) const
+  {
+    if (!(offset == rhs.offset))
+      return false;
+    if (!(compressed_page_size == rhs.compressed_page_size))
+      return false;
+    if (!(first_row_index == rhs.first_row_index))
+      return false;
+    return true;
+  }
+  bool operator != (const PageLocation &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const PageLocation & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(PageLocation &a, PageLocation &b);
+
+std::ostream& operator<<(std::ostream& out, const PageLocation& obj);
+
+
+class OffsetIndex : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  OffsetIndex(const OffsetIndex&);
+  OffsetIndex& operator=(const OffsetIndex&);
+  OffsetIndex() {
+  }
+
+  virtual ~OffsetIndex() throw();
+  std::vector<PageLocation>  page_locations;
+
+  void __set_page_locations(const std::vector<PageLocation> & val);
+
+  bool operator == (const OffsetIndex & rhs) const
+  {
+    if (!(page_locations == rhs.page_locations))
+      return false;
+    return true;
+  }
+  bool operator != (const OffsetIndex &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const OffsetIndex & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(OffsetIndex &a, OffsetIndex &b);
+
+std::ostream& operator<<(std::ostream& out, const OffsetIndex& obj);
+
+typedef struct _ColumnIndex__isset {
+  _ColumnIndex__isset() : null_counts(false) {}
+  bool null_counts :1;
+} _ColumnIndex__isset;
+
+class ColumnIndex : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  ColumnIndex(const ColumnIndex&);
+  ColumnIndex& operator=(const ColumnIndex&);
+  ColumnIndex() : boundary_order((BoundaryOrder::type)0) {
+  }
+
+  virtual ~ColumnIndex() throw();
+  std::vector<bool>  null_pages;
+  std::vector<std::string>  min_values;
+  std::vector<std::string>  max_values;
+  BoundaryOrder::type boundary_order;
+  std::vector<int64_t>  null_counts;
+
+  _ColumnIndex__isset __isset;
+
+  void __set_null_pages(const std::vector<bool> & val);
+
+  void __set_min_values(const std::vector<std::string> & val);
+
+  void __set_max_values(const std::vector<std::string> & val);
+
+  void __set_boundary_order(const BoundaryOrder::type val);
+
+  void __set_null_counts(const std::vector<int64_t> & val);
+
+  bool operator == (const ColumnIndex & rhs) const
+  {
+    if (!(null_pages == rhs.null_pages))
+      return false;
+    if (!(min_values == rhs.min_values))
+      return false;
+    if (!(max_values == rhs.max_values))
+      return false;
+    if (!(boundary_order == rhs.boundary_order))
+      return false;
+    if (__isset.null_counts != rhs.__isset.null_counts)
+      return false;
+    else if (__isset.null_counts && !(null_counts == rhs.null_counts))
+      return false;
+    return true;
+  }
+  bool operator != (const ColumnIndex &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const ColumnIndex & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(ColumnIndex &a, ColumnIndex &b);
+
+std::ostream& operator<<(std::ostream& out, const ColumnIndex& obj);
+
+typedef struct _AesGcmV1__isset {
+  _AesGcmV1__isset() : aad_prefix(false), aad_file_unique(false), supply_aad_prefix(false) {}
+  bool aad_prefix :1;
+  bool aad_file_unique :1;
+  bool supply_aad_prefix :1;
+} _AesGcmV1__isset;
+
+class AesGcmV1 : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  AesGcmV1(const AesGcmV1&);
+  AesGcmV1& operator=(const AesGcmV1&);
+  AesGcmV1() : aad_prefix(), aad_file_unique(), supply_aad_prefix(0) {
+  }
+
+  virtual ~AesGcmV1() throw();
+  std::string aad_prefix;
+  std::string aad_file_unique;
+  bool supply_aad_prefix;
+
+  _AesGcmV1__isset __isset;
+
+  void __set_aad_prefix(const std::string& val);
+
+  void __set_aad_file_unique(const std::string& val);
+
+  void __set_supply_aad_prefix(const bool val);
+
+  bool operator == (const AesGcmV1 & rhs) const
+  {
+    if (__isset.aad_prefix != rhs.__isset.aad_prefix)
+      return false;
+    else if (__isset.aad_prefix && !(aad_prefix == rhs.aad_prefix))
+      return false;
+    if (__isset.aad_file_unique != rhs.__isset.aad_file_unique)
+      return false;
+    else if (__isset.aad_file_unique && !(aad_file_unique == rhs.aad_file_unique))
+      return false;
+    if (__isset.supply_aad_prefix != rhs.__isset.supply_aad_prefix)
+      return false;
+    else if (__isset.supply_aad_prefix && !(supply_aad_prefix == rhs.supply_aad_prefix))
+      return false;
+    return true;
+  }
+  bool operator != (const AesGcmV1 &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const AesGcmV1 & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(AesGcmV1 &a, AesGcmV1 &b);
+
+std::ostream& operator<<(std::ostream& out, const AesGcmV1& obj);
+
+typedef struct _AesGcmCtrV1__isset {
+  _AesGcmCtrV1__isset() : aad_prefix(false), aad_file_unique(false), supply_aad_prefix(false) {}
+  bool aad_prefix :1;
+  bool aad_file_unique :1;
+  bool supply_aad_prefix :1;
+} _AesGcmCtrV1__isset;
+
+class AesGcmCtrV1 : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  AesGcmCtrV1(const AesGcmCtrV1&);
+  AesGcmCtrV1& operator=(const AesGcmCtrV1&);
+  AesGcmCtrV1() : aad_prefix(), aad_file_unique(), supply_aad_prefix(0) {
+  }
+
+  virtual ~AesGcmCtrV1() throw();
+  std::string aad_prefix;
+  std::string aad_file_unique;
+  bool supply_aad_prefix;
+
+  _AesGcmCtrV1__isset __isset;
+
+  void __set_aad_prefix(const std::string& val);
+
+  void __set_aad_file_unique(const std::string& val);
+
+  void __set_supply_aad_prefix(const bool val);
+
+  bool operator == (const AesGcmCtrV1 & rhs) const
+  {
+    if (__isset.aad_prefix != rhs.__isset.aad_prefix)
+      return false;
+    else if (__isset.aad_prefix && !(aad_prefix == rhs.aad_prefix))
+      return false;
+    if (__isset.aad_file_unique != rhs.__isset.aad_file_unique)
+      return false;
+    else if (__isset.aad_file_unique && !(aad_file_unique == rhs.aad_file_unique))
+      return false;
+    if (__isset.supply_aad_prefix != rhs.__isset.supply_aad_prefix)
+      return false;
+    else if (__isset.supply_aad_prefix && !(supply_aad_prefix == rhs.supply_aad_prefix))
+      return false;
+    return true;
+  }
+  bool operator != (const AesGcmCtrV1 &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const AesGcmCtrV1 & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(AesGcmCtrV1 &a, AesGcmCtrV1 &b);
+
+std::ostream& operator<<(std::ostream& out, const AesGcmCtrV1& obj);
+
+typedef struct _EncryptionAlgorithm__isset {
+  _EncryptionAlgorithm__isset() : AES_GCM_V1(false), AES_GCM_CTR_V1(false) {}
+  bool AES_GCM_V1 :1;
+  bool AES_GCM_CTR_V1 :1;
+} _EncryptionAlgorithm__isset;
+
+class EncryptionAlgorithm : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  EncryptionAlgorithm(const EncryptionAlgorithm&);
+  EncryptionAlgorithm& operator=(const EncryptionAlgorithm&);
+  EncryptionAlgorithm() {
+  }
+
+  virtual ~EncryptionAlgorithm() throw();
+  AesGcmV1 AES_GCM_V1;
+  AesGcmCtrV1 AES_GCM_CTR_V1;
+
+  _EncryptionAlgorithm__isset __isset;
+
+  void __set_AES_GCM_V1(const AesGcmV1& val);
+
+  void __set_AES_GCM_CTR_V1(const AesGcmCtrV1& val);
+
+  bool operator == (const EncryptionAlgorithm & rhs) const
+  {
+    if (__isset.AES_GCM_V1 != rhs.__isset.AES_GCM_V1)
+      return false;
+    else if (__isset.AES_GCM_V1 && !(AES_GCM_V1 == rhs.AES_GCM_V1))
+      return false;
+    if (__isset.AES_GCM_CTR_V1 != rhs.__isset.AES_GCM_CTR_V1)
+      return false;
+    else if (__isset.AES_GCM_CTR_V1 && !(AES_GCM_CTR_V1 == rhs.AES_GCM_CTR_V1))
+      return false;
+    return true;
+  }
+  bool operator != (const EncryptionAlgorithm &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const EncryptionAlgorithm & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(EncryptionAlgorithm &a, EncryptionAlgorithm &b);
+
+std::ostream& operator<<(std::ostream& out, const EncryptionAlgorithm& obj);
+
+typedef struct _FileMetaData__isset {
+  _FileMetaData__isset() : key_value_metadata(false), created_by(false), column_orders(false), encryption_algorithm(false), footer_signing_key_metadata(false) {}
+  bool key_value_metadata :1;
+  bool created_by :1;
+  bool column_orders :1;
+  bool encryption_algorithm :1;
+  bool footer_signing_key_metadata :1;
+} _FileMetaData__isset;
+
+class FileMetaData : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  FileMetaData(const FileMetaData&);
+  FileMetaData& operator=(const FileMetaData&);
+  FileMetaData() : version(0), num_rows(0), created_by(), footer_signing_key_metadata() {
+  }
+
+  virtual ~FileMetaData() throw();
+  int32_t version;
+  std::vector<SchemaElement>  schema;
+  int64_t num_rows;
+  std::vector<RowGroup>  row_groups;
+  std::vector<KeyValue>  key_value_metadata;
+  std::string created_by;
+  std::vector<ColumnOrder>  column_orders;
+  EncryptionAlgorithm encryption_algorithm;
+  std::string footer_signing_key_metadata;
+
+  _FileMetaData__isset __isset;
+
+  void __set_version(const int32_t val);
+
+  void __set_schema(const std::vector<SchemaElement> & val);
+
+  void __set_num_rows(const int64_t val);
+
+  void __set_row_groups(const std::vector<RowGroup> & val);
+
+  void __set_key_value_metadata(const std::vector<KeyValue> & val);
+
+  void __set_created_by(const std::string& val);
+
+  void __set_column_orders(const std::vector<ColumnOrder> & val);
+
+  void __set_encryption_algorithm(const EncryptionAlgorithm& val);
+
+  void __set_footer_signing_key_metadata(const std::string& val);
+
+  bool operator == (const FileMetaData & rhs) const
+  {
+    if (!(version == rhs.version))
+      return false;
+    if (!(schema == rhs.schema))
+      return false;
+    if (!(num_rows == rhs.num_rows))
+      return false;
+    if (!(row_groups == rhs.row_groups))
+      return false;
+    if (__isset.key_value_metadata != rhs.__isset.key_value_metadata)
+      return false;
+    else if (__isset.key_value_metadata && !(key_value_metadata == rhs.key_value_metadata))
+      return false;
+    if (__isset.created_by != rhs.__isset.created_by)
+      return false;
+    else if (__isset.created_by && !(created_by == rhs.created_by))
+      return false;
+    if (__isset.column_orders != rhs.__isset.column_orders)
+      return false;
+    else if (__isset.column_orders && !(column_orders == rhs.column_orders))
+      return false;
+    if (__isset.encryption_algorithm != rhs.__isset.encryption_algorithm)
+      return false;
+    else if (__isset.encryption_algorithm && !(encryption_algorithm == rhs.encryption_algorithm))
+      return false;
+    if (__isset.footer_signing_key_metadata != rhs.__isset.footer_signing_key_metadata)
+      return false;
+    else if (__isset.footer_signing_key_metadata && !(footer_signing_key_metadata == rhs.footer_signing_key_metadata))
+      return false;
+    return true;
+  }
+  bool operator != (const FileMetaData &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const FileMetaData & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(FileMetaData &a, FileMetaData &b);
+
+std::ostream& operator<<(std::ostream& out, const FileMetaData& obj);
+
+typedef struct _FileCryptoMetaData__isset {
+  _FileCryptoMetaData__isset() : key_metadata(false) {}
+  bool key_metadata :1;
+} _FileCryptoMetaData__isset;
+
+class FileCryptoMetaData : public virtual ::lbug_apache::thrift::TBase {
+ public:
+
+  FileCryptoMetaData(const FileCryptoMetaData&);
+  FileCryptoMetaData& operator=(const FileCryptoMetaData&);
+  FileCryptoMetaData() : key_metadata() {
+  }
+
+  virtual ~FileCryptoMetaData() throw();
+  EncryptionAlgorithm encryption_algorithm;
+  std::string key_metadata;
+
+  _FileCryptoMetaData__isset __isset;
+
+  void __set_encryption_algorithm(const EncryptionAlgorithm& val);
+
+  void __set_key_metadata(const std::string& val);
+
+  bool operator == (const FileCryptoMetaData & rhs) const
+  {
+    if (!(encryption_algorithm == rhs.encryption_algorithm))
+      return false;
+    if (__isset.key_metadata != rhs.__isset.key_metadata)
+      return false;
+    else if (__isset.key_metadata && !(key_metadata == rhs.key_metadata))
+      return false;
+    return true;
+  }
+  bool operator != (const FileCryptoMetaData &rhs) const {
+    return !(*this == rhs);
+  }
+
+  bool operator < (const FileCryptoMetaData & ) const;
+
+  uint32_t read(::lbug_apache::thrift::protocol::TProtocol* iprot);
+  uint32_t write(::lbug_apache::thrift::protocol::TProtocol* oprot) const;
+
+  virtual void printTo(std::ostream& out) const;
+};
+
+void swap(FileCryptoMetaData &a, FileCryptoMetaData &b);
+
+std::ostream& operator<<(std::ostream& out, const FileCryptoMetaData& obj);
+
+}} // namespace
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/windows_compatibility.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/windows_compatibility.h
new file mode 100644
index 0000000000..89beede959
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/parquet/windows_compatibility.h
@@ -0,0 +1,9 @@
+#pragma once
+
+#ifdef _WIN32
+#undef CREATE_NEW
+#undef OPTIONAL
+#undef Realloc
+#undef min
+#undef max
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/LICENSE
new file mode 100644
index 0000000000..48546122ac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/LICENSE
@@ -0,0 +1,19 @@
+Copyright (c) 2014-2017 Melissa O'Neill and PCG Project contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/pcg_extras.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/pcg_extras.hpp
new file mode 100644
index 0000000000..0524fe2183
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/pcg_extras.hpp
@@ -0,0 +1,664 @@
+/*
+ * PCG Random Number Generation for C++
+ *
+ * Copyright 2014-2017 Melissa O'Neill <oneill@pcg-random.org>,
+ *                     and the PCG Project contributors.
+ *
+ * SPDX-License-Identifier: (Apache-2.0 OR MIT)
+ *
+ * Licensed under the Apache License, Version 2.0 (provided in
+ * LICENSE-APACHE.txt and at http://www.apache.org/licenses/LICENSE-2.0)
+ * or under the MIT license (provided in LICENSE-MIT.txt and at
+ * http://opensource.org/licenses/MIT), at your option. This file may not
+ * be copied, modified, or distributed except according to those terms.
+ *
+ * Distributed on an "AS IS" BASIS, WITHOUT WARRANTY OF ANY KIND, either
+ * express or implied.  See your chosen license for details.
+ *
+ * For additional information about the PCG random number generation scheme,
+ * visit http://www.pcg-random.org/.
+ */
+
+/*
+ * This file provides support code that is useful for random-number generation
+ * but not specific to the PCG generation scheme, including:
+ *      - 128-bit int support for platforms where it isn't available natively
+ *      - bit twiddling operations
+ *      - I/O of 128-bit and 8-bit integers
+ *      - Handling the evilness of SeedSeq
+ *      - Support for efficiently producing random numbers less than a given
+ *        bound
+ */
+
+#ifndef PCG_EXTRAS_HPP_INCLUDED
+#define PCG_EXTRAS_HPP_INCLUDED 1
+
+#include <cinttypes>
+#include <cstddef>
+#include <cstdlib>
+#include <cstring>
+#include <cassert>
+#include <limits>
+#include <iostream>
+#include <type_traits>
+#include <utility>
+#include <locale>
+#include <iterator>
+
+#ifdef __GNUC__
+#include <cxxabi.h>
+#endif
+
+/*
+ * Abstractions for compiler-specific directives
+ */
+
+#ifdef __GNUC__
+    #define PCG_NOINLINE __attribute__((noinline))
+#else
+    #define PCG_NOINLINE
+#endif
+
+/*
+ * Some members of the PCG library use 128-bit math.  When compiling on 64-bit
+ * platforms, both GCC and Clang provide 128-bit integer types that are ideal
+ * for the job.
+ *
+ * On 32-bit platforms (or with other compilers), we fall back to a C++
+ * class that provides 128-bit unsigned integers instead.  It may seem
+ * like we're reinventing the wheel here, because libraries already exist
+ * that support large integers, but most existing libraries provide a very
+ * generic multiprecision code, but here we're operating at a fixed size.
+ * Also, most other libraries are fairly heavyweight.  So we use a direct
+ * implementation.  Sadly, it's much slower than hand-coded assembly or
+ * direct CPU support.
+ *
+ */
+#if __SIZEOF_INT128__
+    namespace pcg_extras {
+        typedef __uint128_t pcg128_t;
+    }
+    #define PCG_128BIT_CONSTANT(high,low) \
+            ((pcg_extras::pcg128_t(high) << 64) + low)
+#else
+    #include "pcg_uint128.hpp"
+    namespace pcg_extras {
+        typedef pcg_extras::uint_x4<uint32_t,uint64_t> pcg128_t;
+    }
+    #define PCG_128BIT_CONSTANT(high,low) \
+            pcg_extras::pcg128_t(high,low)
+    #define PCG_EMULATED_128BIT_MATH 1
+#endif
+
+
+namespace pcg_extras {
+
+/*
+ * We often need to represent a "number of bits".  When used normally, these
+ * numbers are never greater than 128, so an unsigned char is plenty.
+ * If you're using a nonstandard generator of a larger size, you can set
+ * PCG_BITCOUNT_T to have it define it as a larger size.  (Some compilers
+ * might produce faster code if you set it to an unsigned int.)
+ */
+
+#ifndef PCG_BITCOUNT_T
+    typedef uint8_t bitcount_t;
+#else
+    typedef PCG_BITCOUNT_T bitcount_t;
+#endif
+
+/*
+ * C++ requires us to be able to serialize RNG state by printing or reading
+ * it from a stream.  Because we use 128-bit ints, we also need to be able
+ * ot print them, so here is code to do so.
+ *
+ * This code provides enough functionality to print 128-bit ints in decimal
+ * and zero-padded in hex.  It's not a full-featured implementation.
+ */
+
+template <typename CharT, typename Traits>
+std::basic_ostream<CharT,Traits>&
+operator<<(std::basic_ostream<CharT,Traits>& out, pcg128_t value)
+{
+    auto desired_base = out.flags() & out.basefield;
+    bool want_hex = desired_base == out.hex;
+
+    if (want_hex) {
+        uint64_t highpart = uint64_t(value >> 64);
+        uint64_t lowpart  = uint64_t(value);
+        auto desired_width = out.width();
+        if (desired_width > 16) {
+            out.width(desired_width - 16);
+        }
+        if (highpart != 0 || desired_width > 16)
+            out << highpart;
+        CharT oldfill = '\0';
+        if (highpart != 0) {
+            out.width(16);
+            oldfill = out.fill('0');
+        }
+        auto oldflags = out.setf(decltype(desired_base){}, out.showbase);
+        out << lowpart;
+        out.setf(oldflags);
+        if (highpart != 0) {
+            out.fill(oldfill);
+        }
+        return out;
+    }
+    constexpr size_t MAX_CHARS_128BIT = 40;
+
+    char buffer[MAX_CHARS_128BIT];
+    char* pos = buffer+sizeof(buffer);
+    *(--pos) = '\0';
+    constexpr auto BASE = pcg128_t(10ULL);
+    do {
+        auto div = value / BASE;
+        auto mod = uint32_t(value - (div * BASE));
+        *(--pos) = '0' + char(mod);
+        value = div;
+    } while(value != pcg128_t(0ULL));
+    return out << pos;
+}
+
+template <typename CharT, typename Traits>
+std::basic_istream<CharT,Traits>&
+operator>>(std::basic_istream<CharT,Traits>& in, pcg128_t& value)
+{
+    typename std::basic_istream<CharT,Traits>::sentry s(in);
+
+    if (!s)
+         return in;
+
+    constexpr auto BASE = pcg128_t(10ULL);
+    pcg128_t current(0ULL);
+    bool did_nothing = true;
+    bool overflow = false;
+    for(;;) {
+        CharT wide_ch = in.get();
+        if (!in.good())
+            break;
+        auto ch = in.narrow(wide_ch, '\0');
+        if (ch < '0' || ch > '9') {
+            in.unget();
+            break;
+        }
+        did_nothing = false;
+        pcg128_t digit(uint32_t(ch - '0'));
+        pcg128_t timesbase = current*BASE;
+        overflow = overflow || timesbase < current;
+        current = timesbase + digit;
+        overflow = overflow || current < digit;
+    }
+
+    if (did_nothing || overflow) {
+        in.setstate(std::ios::failbit);
+        if (overflow)
+            current = ~pcg128_t(0ULL);
+    }
+
+    value = current;
+
+    return in;
+}
+
+/*
+ * Likewise, if people use tiny rngs, we'll be serializing uint8_t.
+ * If we just used the provided IO operators, they'd read/write chars,
+ * not ints, so we need to define our own.  We *can* redefine this operator
+ * here because we're in our own namespace.
+ */
+
+template <typename CharT, typename Traits>
+std::basic_ostream<CharT,Traits>&
+operator<<(std::basic_ostream<CharT,Traits>&out, uint8_t value)
+{
+    return out << uint32_t(value);
+}
+
+template <typename CharT, typename Traits>
+std::basic_istream<CharT,Traits>&
+operator>>(std::basic_istream<CharT,Traits>& in, uint8_t& target)
+{
+    uint32_t value = 0xdecea5edU;
+    in >> value;
+    if (!in && value == 0xdecea5edU)
+        return in;
+    if (value > uint8_t(~0)) {
+        in.setstate(std::ios::failbit);
+        value = ~0U;
+    }
+    target = uint8_t(value);
+    return in;
+}
+
+/* Unfortunately, the above functions don't get found in preference to the
+ * built in ones, so we create some more specific overloads that will.
+ * Ugh.
+ */
+
+inline std::ostream& operator<<(std::ostream& out, uint8_t value)
+{
+    return pcg_extras::operator<< <char>(out, value);
+}
+
+inline std::istream& operator>>(std::istream& in, uint8_t& value)
+{
+    return pcg_extras::operator>> <char>(in, value);
+}
+
+
+
+/*
+ * Useful bitwise operations.
+ */
+
+/*
+ * XorShifts are invertable, but they are someting of a pain to invert.
+ * This function backs them out.  It's used by the whacky "inside out"
+ * generator defined later.
+ */
+
+template <typename itype>
+inline itype unxorshift(itype x, bitcount_t bits, bitcount_t shift)
+{
+    if (2*shift >= bits) {
+        return x ^ (x >> shift);
+    }
+    itype lowmask1 = (itype(1U) << (bits - shift*2)) - 1;
+    itype highmask1 = ~lowmask1;
+    itype top1 = x;
+    itype bottom1 = x & lowmask1;
+    top1 ^= top1 >> shift;
+    top1 &= highmask1;
+    x = top1 | bottom1;
+    itype lowmask2 = (itype(1U) << (bits - shift)) - 1;
+    itype bottom2 = x & lowmask2;
+    bottom2 = unxorshift(bottom2, bits - shift, shift);
+    bottom2 &= lowmask1;
+    return top1 | bottom2;
+}
+
+/*
+ * Rotate left and right.
+ *
+ * In ideal world, compilers would spot idiomatic rotate code and convert it
+ * to a rotate instruction.  Of course, opinions vary on what the correct
+ * idiom is and how to spot it.  For clang, sometimes it generates better
+ * (but still crappy) code if you define PCG_USE_ZEROCHECK_ROTATE_IDIOM.
+ */
+
+template <typename itype>
+inline itype rotl(itype value, bitcount_t rot)
+{
+    constexpr bitcount_t bits = sizeof(itype) * 8;
+    constexpr bitcount_t mask = bits - 1;
+#if PCG_USE_ZEROCHECK_ROTATE_IDIOM
+    return rot ? (value << rot) | (value >> (bits - rot)) : value;
+#else
+    return (value << rot) | (value >> ((- rot) & mask));
+#endif
+}
+
+template <typename itype>
+inline itype rotr(itype value, bitcount_t rot)
+{
+    constexpr bitcount_t bits = sizeof(itype) * 8;
+    constexpr bitcount_t mask = bits - 1;
+#if PCG_USE_ZEROCHECK_ROTATE_IDIOM
+    return rot ? (value >> rot) | (value << (bits - rot)) : value;
+#else
+    return (value >> rot) | (value << ((- rot) & mask));
+#endif
+}
+
+/* Unfortunately, both Clang and GCC sometimes perform poorly when it comes
+ * to properly recognizing idiomatic rotate code, so for we also provide
+ * assembler directives (enabled with PCG_USE_INLINE_ASM).  Boo, hiss.
+ * (I hope that these compilers get better so that this code can die.)
+ *
+ * These overloads will be preferred over the general template code above.
+ */
+#if PCG_USE_INLINE_ASM && __GNUC__ && (__x86_64__  || __i386__)
+
+inline uint8_t rotr(uint8_t value, bitcount_t rot)
+{
+    asm ("rorb   %%cl, %0" : "=r" (value) : "0" (value), "c" (rot));
+    return value;
+}
+
+inline uint16_t rotr(uint16_t value, bitcount_t rot)
+{
+    asm ("rorw   %%cl, %0" : "=r" (value) : "0" (value), "c" (rot));
+    return value;
+}
+
+inline uint32_t rotr(uint32_t value, bitcount_t rot)
+{
+    asm ("rorl   %%cl, %0" : "=r" (value) : "0" (value), "c" (rot));
+    return value;
+}
+
+#if __x86_64__
+inline uint64_t rotr(uint64_t value, bitcount_t rot)
+{
+    asm ("rorq   %%cl, %0" : "=r" (value) : "0" (value), "c" (rot));
+    return value;
+}
+#endif // __x86_64__
+
+#elif defined(_MSC_VER)
+  // Use MSVC++ bit rotation intrinsics
+
+#pragma intrinsic(_rotr, _rotr64, _rotr8, _rotr16)
+
+inline uint8_t rotr(uint8_t value, bitcount_t rot)
+{
+    return _rotr8(value, rot);
+}
+
+inline uint16_t rotr(uint16_t value, bitcount_t rot)
+{
+    return _rotr16(value, rot);
+}
+
+inline uint32_t rotr(uint32_t value, bitcount_t rot)
+{
+    return _rotr(value, rot);
+}
+
+inline uint64_t rotr(uint64_t value, bitcount_t rot)
+{
+    return _rotr64(value, rot);
+}
+
+#endif // PCG_USE_INLINE_ASM
+
+
+/*
+ * The C++ SeedSeq concept (modelled by seed_seq) can fill an array of
+ * 32-bit integers with seed data, but sometimes we want to produce
+ * larger or smaller integers.
+ *
+ * The following code handles this annoyance.
+ *
+ * uneven_copy will copy an array of 32-bit ints to an array of larger or
+ * smaller ints (actually, the code is general it only needing forward
+ * iterators).  The copy is identical to the one that would be performed if
+ * we just did memcpy on a standard little-endian machine, but works
+ * regardless of the endian of the machine (or the weirdness of the ints
+ * involved).
+ *
+ * generate_to initializes an array of integers using a SeedSeq
+ * object.  It is given the size as a static constant at compile time and
+ * tries to avoid memory allocation.  If we're filling in 32-bit constants
+ * we just do it directly.  If we need a separate buffer and it's small,
+ * we allocate it on the stack.  Otherwise, we fall back to heap allocation.
+ * Ugh.
+ *
+ * generate_one produces a single value of some integral type using a
+ * SeedSeq object.
+ */
+
+ /* uneven_copy helper, case where destination ints are less than 32 bit. */
+
+template<class SrcIter, class DestIter>
+SrcIter uneven_copy_impl(
+    SrcIter src_first, DestIter dest_first, DestIter dest_last,
+    std::true_type)
+{
+    typedef typename std::iterator_traits<SrcIter>::value_type  src_t;
+    typedef typename std::iterator_traits<DestIter>::value_type dest_t;
+
+    constexpr bitcount_t SRC_SIZE  = sizeof(src_t);
+    constexpr bitcount_t DEST_SIZE = sizeof(dest_t);
+    constexpr bitcount_t DEST_BITS = DEST_SIZE * 8;
+    constexpr bitcount_t SCALE     = SRC_SIZE / DEST_SIZE;
+
+    size_t count = 0;
+    src_t value = 0;
+
+    while (dest_first != dest_last) {
+        if ((count++ % SCALE) == 0)
+            value = *src_first++;       // Get more bits
+        else
+            value >>= DEST_BITS;        // Move down bits
+
+        *dest_first++ = dest_t(value);  // Truncates, ignores high bits.
+    }
+    return src_first;
+}
+
+ /* uneven_copy helper, case where destination ints are more than 32 bit. */
+
+template<class SrcIter, class DestIter>
+SrcIter uneven_copy_impl(
+    SrcIter src_first, DestIter dest_first, DestIter dest_last,
+    std::false_type)
+{
+    typedef typename std::iterator_traits<SrcIter>::value_type  src_t;
+    typedef typename std::iterator_traits<DestIter>::value_type dest_t;
+
+    constexpr auto SRC_SIZE  = sizeof(src_t);
+    constexpr auto SRC_BITS  = SRC_SIZE * 8;
+    constexpr auto DEST_SIZE = sizeof(dest_t);
+    constexpr auto SCALE     = (DEST_SIZE+SRC_SIZE-1) / SRC_SIZE;
+
+    while (dest_first != dest_last) {
+        dest_t value(0UL);
+        unsigned int shift = 0;
+
+        for (size_t i = 0; i < SCALE; ++i) {
+            value |= dest_t(*src_first++) << shift;
+            shift += SRC_BITS;
+        }
+
+        *dest_first++ = value;
+    }
+    return src_first;
+}
+
+/* uneven_copy, call the right code for larger vs. smaller */
+
+template<class SrcIter, class DestIter>
+inline SrcIter uneven_copy(SrcIter src_first,
+                           DestIter dest_first, DestIter dest_last)
+{
+    typedef typename std::iterator_traits<SrcIter>::value_type  src_t;
+    typedef typename std::iterator_traits<DestIter>::value_type dest_t;
+
+    constexpr bool DEST_IS_SMALLER = sizeof(dest_t) < sizeof(src_t);
+
+    return uneven_copy_impl(src_first, dest_first, dest_last,
+                            std::integral_constant<bool, DEST_IS_SMALLER>{});
+}
+
+/* generate_to, fill in a fixed-size array of integral type using a SeedSeq
+ * (actually works for any random-access iterator)
+ */
+
+template <size_t size, typename SeedSeq, typename DestIter>
+inline void generate_to_impl(SeedSeq&& generator, DestIter dest,
+                             std::true_type)
+{
+    generator.generate(dest, dest+size);
+}
+
+template <size_t size, typename SeedSeq, typename DestIter>
+void generate_to_impl(SeedSeq&& generator, DestIter dest,
+                      std::false_type)
+{
+    typedef typename std::iterator_traits<DestIter>::value_type dest_t;
+    constexpr auto DEST_SIZE = sizeof(dest_t);
+    constexpr auto GEN_SIZE  = sizeof(uint32_t);
+
+    constexpr bool GEN_IS_SMALLER = GEN_SIZE < DEST_SIZE;
+    constexpr size_t FROM_ELEMS =
+        GEN_IS_SMALLER
+            ? size * ((DEST_SIZE+GEN_SIZE-1) / GEN_SIZE)
+            : (size + (GEN_SIZE / DEST_SIZE) - 1)
+                / ((GEN_SIZE / DEST_SIZE) + GEN_IS_SMALLER);
+                        //  this odd code ^^^^^^^^^^^^^^^^^ is work-around for
+                        //  a bug: http://llvm.org/bugs/show_bug.cgi?id=21287
+
+    if (FROM_ELEMS <= 1024) {
+        uint32_t buffer[FROM_ELEMS];
+        generator.generate(buffer, buffer+FROM_ELEMS);
+        uneven_copy(buffer, dest, dest+size);
+    } else {
+        uint32_t* buffer = static_cast<uint32_t*>(malloc(GEN_SIZE * FROM_ELEMS));
+        generator.generate(buffer, buffer+FROM_ELEMS);
+        uneven_copy(buffer, dest, dest+size);
+        free(static_cast<void*>(buffer));
+    }
+}
+
+template <size_t size, typename SeedSeq, typename DestIter>
+inline void generate_to(SeedSeq&& generator, DestIter dest)
+{
+    typedef typename std::iterator_traits<DestIter>::value_type dest_t;
+    constexpr bool IS_32BIT = sizeof(dest_t) == sizeof(uint32_t);
+
+    generate_to_impl<size>(std::forward<SeedSeq>(generator), dest,
+                           std::integral_constant<bool, IS_32BIT>{});
+}
+
+/* generate_one, produce a value of integral type using a SeedSeq
+ * (optionally, we can have it produce more than one and pick which one
+ * we want)
+ */
+
+template <typename UInt, size_t i = 0UL, size_t N = i+1UL, typename SeedSeq>
+inline UInt generate_one(SeedSeq&& generator)
+{
+    UInt result[N];
+    generate_to<N>(std::forward<SeedSeq>(generator), result);
+    return result[i];
+}
+
+template <typename RngType>
+auto bounded_rand(RngType& rng, typename RngType::result_type upper_bound)
+        -> typename RngType::result_type
+{
+    typedef typename RngType::result_type rtype;
+    rtype threshold = (RngType::max() - RngType::min() + rtype(1) - upper_bound)
+                    % upper_bound;
+    for (;;) {
+        rtype r = rng() - RngType::min();
+        if (r >= threshold)
+            return r % upper_bound;
+    }
+}
+
+template <typename Iter, typename RandType>
+void shuffle(Iter from, Iter to, RandType&& rng)
+{
+    typedef typename std::iterator_traits<Iter>::difference_type delta_t;
+    typedef typename std::remove_reference<RandType>::type::result_type result_t;
+    auto count = to - from;
+    while (count > 1) {
+        delta_t chosen = delta_t(bounded_rand(rng, result_t(count)));
+        --count;
+        --to;
+        using std::swap;
+        swap(*(from + chosen), *to);
+    }
+}
+
+/*
+ * Although std::seed_seq is useful, it isn't everything.  Often we want to
+ * initialize a random-number generator some other way, such as from a random
+ * device.
+ *
+ * Technically, it does not meet the requirements of a SeedSequence because
+ * it lacks some of the rarely-used member functions (some of which would
+ * be impossible to provide).  However the C++ standard is quite specific
+ * that actual engines only called the generate method, so it ought not to be
+ * a problem in practice.
+ */
+
+template <typename RngType>
+class seed_seq_from {
+private:
+    RngType rng_;
+
+    typedef uint_least32_t result_type;
+
+public:
+    template<typename... Args>
+    seed_seq_from(Args&&... args) :
+        rng_(std::forward<Args>(args)...)
+    {
+        // Nothing (else) to do...
+    }
+
+    template<typename Iter>
+    void generate(Iter start, Iter finish)
+    {
+        for (auto i = start; i != finish; ++i)
+            *i = result_type(rng_());
+    }
+
+    constexpr size_t size() const
+    {
+        return (sizeof(typename RngType::result_type) > sizeof(result_type)
+                && RngType::max() > ~size_t(0UL))
+             ? ~size_t(0UL)
+             : size_t(RngType::max());
+    }
+};
+
+/*
+ * Sometimes you might want a distinct seed based on when the program
+ * was compiled.  That way, a particular instance of the program will
+ * behave the same way, but when recompiled it'll produce a different
+ * value.
+ */
+
+template <typename IntType>
+struct static_arbitrary_seed {
+private:
+    static constexpr IntType fnv(IntType hash, const char* pos) {
+        return *pos == '\0'
+             ? hash
+             : fnv((hash * IntType(16777619U)) ^ *pos, (pos+1));
+    }
+
+public:
+    static constexpr IntType value = fnv(IntType(2166136261U ^ sizeof(IntType)),
+                        __DATE__ __TIME__ __FILE__);
+};
+
+// Sometimes, when debugging or testing, it's handy to be able print the name
+// of a (in human-readable form).  This code allows the idiom:
+//
+//      cout << printable_typename<my_foo_type_t>()
+//
+// to print out my_foo_type_t (or its concrete type if it is a synonym)
+
+#if __cpp_rtti || __GXX_RTTI
+
+template <typename T>
+struct printable_typename {};
+
+template <typename T>
+std::ostream& operator<<(std::ostream& out, printable_typename<T>) {
+    const char *implementation_typename = typeid(T).name();
+#ifdef __GNUC__
+    int status;
+    char* pretty_name =
+        abi::__cxa_demangle(implementation_typename, nullptr, nullptr, &status);
+    if (status == 0)
+        out << pretty_name;
+    free(static_cast<void*>(pretty_name));
+    if (status == 0)
+        return out;
+#endif
+    out << implementation_typename;
+    return out;
+}
+
+#endif  // __cpp_rtti || __GXX_RTTI
+
+} // namespace pcg_extras
+
+#endif // PCG_EXTRAS_HPP_INCLUDED
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/pcg_random.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/pcg_random.hpp
new file mode 100644
index 0000000000..f4f5969c6c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/pcg_random.hpp
@@ -0,0 +1,1955 @@
+/*
+ * PCG Random Number Generation for C++
+ *
+ * Copyright 2014-2019 Melissa O'Neill <oneill@pcg-random.org>,
+ *                     and the PCG Project contributors.
+ *
+ * SPDX-License-Identifier: (Apache-2.0 OR MIT)
+ *
+ * Licensed under the Apache License, Version 2.0 (provided in
+ * LICENSE-APACHE.txt and at http://www.apache.org/licenses/LICENSE-2.0)
+ * or under the MIT license (provided in LICENSE-MIT.txt and at
+ * http://opensource.org/licenses/MIT), at your option. This file may not
+ * be copied, modified, or distributed except according to those terms.
+ *
+ * Distributed on an "AS IS" BASIS, WITHOUT WARRANTY OF ANY KIND, either
+ * express or implied.  See your chosen license for details.
+ *
+ * For additional information about the PCG random number generation scheme,
+ * visit http://www.pcg-random.org/.
+ */
+
+/*
+ * This code provides the reference implementation of the PCG family of
+ * random number generators.  The code is complex because it implements
+ *
+ *      - several members of the PCG family, specifically members corresponding
+ *        to the output functions:
+ *             - XSH RR         (good for 64-bit state, 32-bit output)
+ *             - XSH RS         (good for 64-bit state, 32-bit output)
+ *             - XSL RR         (good for 128-bit state, 64-bit output)
+ *             - RXS M XS       (statistically most powerful generator)
+ *             - XSL RR RR      (good for 128-bit state, 128-bit output)
+ *             - and RXS, RXS M, XSH, XSL       (mostly for testing)
+ *      - at potentially *arbitrary* bit sizes
+ *      - with four different techniques for random streams (MCG, one-stream
+ *        LCG, settable-stream LCG, unique-stream LCG)
+ *      - and the extended generation schemes allowing arbitrary periods
+ *      - with all features of C++11 random number generation (and more),
+ *        some of which are somewhat painful, including
+ *            - initializing with a SeedSequence which writes 32-bit values
+ *              to memory, even though the state of the generator may not
+ *              use 32-bit values (it might use smaller or larger integers)
+ *            - I/O for RNGs and a prescribed format, which needs to handle
+ *              the issue that 8-bit and 128-bit integers don't have working
+ *              I/O routines (e.g., normally 8-bit = char, not integer)
+ *            - equality and inequality for RNGs
+ *      - and a number of convenience typedefs to mask all the complexity
+ *
+ * The code employes a fairly heavy level of abstraction, and has to deal
+ * with various C++ minutia.  If you're looking to learn about how the PCG
+ * scheme works, you're probably best of starting with one of the other
+ * codebases (see www.pcg-random.org).  But if you're curious about the
+ * constants for the various output functions used in those other, simpler,
+ * codebases, this code shows how they are calculated.
+ *
+ * On the positive side, at least there are convenience typedefs so that you
+ * can say
+ *
+ *      pcg32 myRNG;
+ *
+ * rather than:
+ *
+ *      pcg_detail::engine<
+ *          uint32_t,                                           // Output Type
+ *          uint64_t,                                           // State Type
+ *          pcg_detail::xsh_rr_mixin<uint32_t, uint64_t>, true, // Output Func
+ *          pcg_detail::specific_stream<uint64_t>,              // Stream Kind
+ *          pcg_detail::default_multiplier<uint64_t>            // LCG Mult
+ *      > myRNG;
+ *
+ */
+
+#ifndef PCG_RAND_HPP_INCLUDED
+#define PCG_RAND_HPP_INCLUDED 1
+
+#include <algorithm>
+#include <cinttypes>
+#include <cstddef>
+#include <cstdlib>
+#include <cstring>
+#include <cassert>
+#include <limits>
+#include <iostream>
+#include <iterator>
+#include <type_traits>
+#include <utility>
+#include <locale>
+#include <new>
+#include <stdexcept>
+
+#ifdef _MSC_VER
+    #pragma warning(disable:4146)
+#endif
+
+#ifdef _MSC_VER
+    #define PCG_ALWAYS_INLINE __forceinline
+#elif __GNUC__
+    #define PCG_ALWAYS_INLINE __attribute__((always_inline))
+#else
+    #define PCG_ALWAYS_INLINE inline
+#endif
+
+#ifdef min
+#undef min
+#endif
+
+#ifdef max
+#undef max
+#endif
+
+/*
+ * The pcg_extras namespace contains some support code that is likley to
+ * be useful for a variety of RNGs, including:
+ *      - 128-bit int support for platforms where it isn't available natively
+ *      - bit twiddling operations
+ *      - I/O of 128-bit and 8-bit integers
+ *      - Handling the evilness of SeedSeq
+ *      - Support for efficiently producing random numbers less than a given
+ *        bound
+ */
+
+#include "pcg_extras.hpp"
+
+namespace pcg_detail {
+
+using namespace pcg_extras;
+
+/*
+ * The LCG generators need some constants to function.  This code lets you
+ * look up the constant by *type*.  For example
+ *
+ *      default_multiplier<uint32_t>::multiplier()
+ *
+ * gives you the default multipler for 32-bit integers.  We use the name
+ * of the constant and not a generic word like value to allow these classes
+ * to be used as mixins.
+ */
+
+template <typename T>
+struct default_multiplier {
+    // Not defined for an arbitrary type
+};
+
+template <typename T>
+struct default_increment {
+    // Not defined for an arbitrary type
+};
+
+#define PCG_DEFINE_CONSTANT(type, what, kind, constant) \
+        template <>                                     \
+        struct what ## _ ## kind<type> {                \
+            static constexpr type kind() {              \
+                return constant;                        \
+            }                                           \
+        };
+
+PCG_DEFINE_CONSTANT(uint8_t,  default, multiplier, 141U)
+PCG_DEFINE_CONSTANT(uint8_t,  default, increment,  77U)
+
+PCG_DEFINE_CONSTANT(uint16_t, default, multiplier, 12829U)
+PCG_DEFINE_CONSTANT(uint16_t, default, increment,  47989U)
+
+PCG_DEFINE_CONSTANT(uint32_t, default, multiplier, 747796405U)
+PCG_DEFINE_CONSTANT(uint32_t, default, increment,  2891336453U)
+
+PCG_DEFINE_CONSTANT(uint64_t, default, multiplier, 6364136223846793005ULL)
+PCG_DEFINE_CONSTANT(uint64_t, default, increment,  1442695040888963407ULL)
+
+PCG_DEFINE_CONSTANT(pcg128_t, default, multiplier,
+        PCG_128BIT_CONSTANT(2549297995355413924ULL,4865540595714422341ULL))
+PCG_DEFINE_CONSTANT(pcg128_t, default, increment,
+        PCG_128BIT_CONSTANT(6364136223846793005ULL,1442695040888963407ULL))
+
+/* Alternative (cheaper) multipliers for 128-bit */
+
+template <typename T>
+struct cheap_multiplier : public default_multiplier<T> {
+    // For most types just use the default.
+};
+
+template <>
+struct cheap_multiplier<pcg128_t> {
+    static constexpr uint64_t multiplier() {
+        return 0xda942042e4dd58b5ULL;
+    }
+};
+
+
+/*
+ * Each PCG generator is available in four variants, based on how it applies
+ * the additive constant for its underlying LCG; the variations are:
+ *
+ *     single stream   - all instances use the same fixed constant, thus
+ *                       the RNG always somewhere in same sequence
+ *     mcg             - adds zero, resulting in a single stream and reduced
+ *                       period
+ *     specific stream - the constant can be changed at any time, selecting
+ *                       a different random sequence
+ *     unique stream   - the constant is based on the memory address of the
+ *                       object, thus every RNG has its own unique sequence
+ *
+ * This variation is provided though mixin classes which define a function
+ * value called increment() that returns the nesessary additive constant.
+ */
+
+
+
+/*
+ * unique stream
+ */
+
+
+template <typename itype>
+class unique_stream {
+protected:
+    static constexpr bool is_mcg = false;
+
+    // Is never called, but is provided for symmetry with specific_stream
+    void set_stream(...)
+    {
+        abort();
+    }
+
+public:
+    typedef itype state_type;
+
+    constexpr itype increment() const {
+        return itype(reinterpret_cast<uintptr_t>(this) | 1);
+    }
+
+    constexpr itype stream() const
+    {
+         return increment() >> 1;
+    }
+
+    static constexpr bool can_specify_stream = false;
+
+    static constexpr size_t streams_pow2()
+    {
+        return (sizeof(itype) < sizeof(size_t) ? sizeof(itype)
+                                               : sizeof(size_t))*8 - 1u;
+    }
+
+protected:
+    constexpr unique_stream() = default;
+};
+
+
+/*
+ * no stream (mcg)
+ */
+
+template <typename itype>
+class no_stream {
+protected:
+    static constexpr bool is_mcg = true;
+
+    // Is never called, but is provided for symmetry with specific_stream
+    void set_stream(...)
+    {
+        abort();
+    }
+
+public:
+    typedef itype state_type;
+
+    static constexpr itype increment() {
+        return 0;
+    }
+
+    static constexpr bool can_specify_stream = false;
+
+    static constexpr size_t streams_pow2()
+    {
+        return 0u;
+    }
+
+protected:
+    constexpr no_stream() = default;
+};
+
+
+/*
+ * single stream/sequence (oneseq)
+ */
+
+template <typename itype>
+class oneseq_stream : public default_increment<itype> {
+protected:
+    static constexpr bool is_mcg = false;
+
+    // Is never called, but is provided for symmetry with specific_stream
+    void set_stream(...)
+    {
+        abort();
+    }
+
+public:
+    typedef itype state_type;
+
+    static constexpr itype stream()
+    {
+         return default_increment<itype>::increment() >> 1;
+    }
+
+    static constexpr bool can_specify_stream = false;
+
+    static constexpr size_t streams_pow2()
+    {
+        return 0u;
+    }
+
+protected:
+    constexpr oneseq_stream() = default;
+};
+
+
+/*
+ * specific stream
+ */
+
+template <typename itype>
+class specific_stream {
+protected:
+    static constexpr bool is_mcg = false;
+
+    itype inc_ = default_increment<itype>::increment();
+
+public:
+    typedef itype state_type;
+    typedef itype stream_state;
+
+    constexpr itype increment() const {
+        return inc_;
+    }
+
+    itype stream()
+    {
+         return inc_ >> 1;
+    }
+
+    void set_stream(itype specific_seq)
+    {
+         inc_ = (specific_seq << 1) | 1;
+    }
+
+    static constexpr bool can_specify_stream = true;
+
+    static constexpr size_t streams_pow2()
+    {
+        return (sizeof(itype)*8) - 1u;
+    }
+
+protected:
+    specific_stream() = default;
+
+    specific_stream(itype specific_seq)
+        : inc_(itype(specific_seq << 1) | itype(1U))
+    {
+        // Nothing (else) to do.
+    }
+};
+
+
+/*
+ * This is where it all comes together.  This function joins together three
+ * mixin classes which define
+ *    - the LCG additive constant (the stream)
+ *    - the LCG multiplier
+ *    - the output function
+ * in addition, we specify the type of the LCG state, and the result type,
+ * and whether to use the pre-advance version of the state for the output
+ * (increasing instruction-level parallelism) or the post-advance version
+ * (reducing register pressure).
+ *
+ * Given the high level of parameterization, the code has to use some
+ * template-metaprogramming tricks to handle some of the suble variations
+ * involved.
+ */
+
+template <typename xtype, typename itype,
+          typename output_mixin,
+          bool output_previous = true,
+          typename stream_mixin = oneseq_stream<itype>,
+          typename multiplier_mixin = default_multiplier<itype> >
+class engine : protected output_mixin,
+               public stream_mixin,
+               protected multiplier_mixin {
+protected:
+    itype state_;
+
+    struct can_specify_stream_tag {};
+    struct no_specifiable_stream_tag {};
+
+    using stream_mixin::increment;
+    using multiplier_mixin::multiplier;
+
+public:
+    typedef xtype result_type;
+    typedef itype state_type;
+
+    static constexpr size_t period_pow2()
+    {
+        return sizeof(state_type)*8 - 2*stream_mixin::is_mcg;
+    }
+
+    // It would be nice to use std::numeric_limits for these, but
+    // we can't be sure that it'd be defined for the 128-bit types.
+
+    static constexpr result_type min()
+    {
+        return result_type(0UL);
+    }
+
+    static constexpr result_type max()
+    {
+        return result_type(~result_type(0UL));
+    }
+
+protected:
+    itype bump(itype state)
+    {
+        return state * multiplier() + increment();
+    }
+
+    itype base_generate()
+    {
+        return state_ = bump(state_);
+    }
+
+    itype base_generate0()
+    {
+        itype old_state = state_;
+        state_ = bump(state_);
+        return old_state;
+    }
+
+public:
+    result_type operator()()
+    {
+        if (output_previous)
+            return this->output(base_generate0());
+        else
+            return this->output(base_generate());
+    }
+
+    result_type operator()(result_type upper_bound)
+    {
+        return bounded_rand(*this, upper_bound);
+    }
+
+protected:
+    static itype advance(itype state, itype delta,
+                         itype cur_mult, itype cur_plus);
+
+    static itype distance(itype cur_state, itype newstate, itype cur_mult,
+                          itype cur_plus, itype mask = ~itype(0U));
+
+    itype distance(itype newstate, itype mask = itype(~itype(0U))) const
+    {
+        return distance(state_, newstate, multiplier(), increment(), mask);
+    }
+
+public:
+    void advance(itype delta)
+    {
+        state_ = advance(state_, delta, this->multiplier(), this->increment());
+    }
+
+    void backstep(itype delta)
+    {
+        advance(-delta);
+    }
+
+    void discard(itype delta)
+    {
+        advance(delta);
+    }
+
+    bool wrapped()
+    {
+        if (stream_mixin::is_mcg) {
+            // For MCGs, the low order two bits never change. In this
+            // implementation, we keep them fixed at 3 to make this test
+            // easier.
+            return state_ == 3;
+        } else {
+            return state_ == 0;
+        }
+    }
+
+    engine(itype state = itype(0xcafef00dd15ea5e5ULL))
+        : state_(this->is_mcg ? state|state_type(3U)
+                              : bump(state + this->increment()))
+    {
+        // Nothing else to do.
+    }
+
+    // This function may or may not exist.  It thus has to be a template
+    // to use SFINAE; users don't have to worry about its template-ness.
+
+    template <typename sm = stream_mixin>
+    engine(itype state, typename sm::stream_state stream_seed)
+        : stream_mixin(stream_seed),
+          state_(this->is_mcg ? state|state_type(3U)
+                              : bump(state + this->increment()))
+    {
+        // Nothing else to do.
+    }
+
+    template<typename SeedSeq>
+    engine(SeedSeq&& seedSeq, typename std::enable_if<
+                  !stream_mixin::can_specify_stream
+               && !std::is_convertible<SeedSeq, itype>::value
+               && !std::is_convertible<SeedSeq, engine>::value,
+               no_specifiable_stream_tag>::type = {})
+        : engine(generate_one<itype>(std::forward<SeedSeq>(seedSeq)))
+    {
+        // Nothing else to do.
+    }
+
+    template<typename SeedSeq>
+    engine(SeedSeq&& seedSeq, typename std::enable_if<
+                   stream_mixin::can_specify_stream
+               && !std::is_convertible<SeedSeq, itype>::value
+               && !std::is_convertible<SeedSeq, engine>::value,
+        can_specify_stream_tag>::type = {})
+        : engine(generate_one<itype,1,2>(seedSeq),
+                 generate_one<itype,0,2>(seedSeq))
+    {
+        // Nothing else to do.
+    }
+
+
+    template<typename... Args>
+    void seed(Args&&... args)
+    {
+        new (this) engine(std::forward<Args>(args)...);
+    }
+
+    template <typename xtype1, typename itype1,
+              typename output_mixin1, bool output_previous1,
+              typename stream_mixin_lhs, typename multiplier_mixin_lhs,
+              typename stream_mixin_rhs, typename multiplier_mixin_rhs>
+    friend bool operator==(const engine<xtype1,itype1,
+                                     output_mixin1,output_previous1,
+                                     stream_mixin_lhs, multiplier_mixin_lhs>&,
+                           const engine<xtype1,itype1,
+                                     output_mixin1,output_previous1,
+                                     stream_mixin_rhs, multiplier_mixin_rhs>&);
+
+    template <typename xtype1, typename itype1,
+              typename output_mixin1, bool output_previous1,
+              typename stream_mixin_lhs, typename multiplier_mixin_lhs,
+              typename stream_mixin_rhs, typename multiplier_mixin_rhs>
+    friend itype1 operator-(const engine<xtype1,itype1,
+                                     output_mixin1,output_previous1,
+                                     stream_mixin_lhs, multiplier_mixin_lhs>&,
+                            const engine<xtype1,itype1,
+                                     output_mixin1,output_previous1,
+                                     stream_mixin_rhs, multiplier_mixin_rhs>&);
+
+    template <typename CharT, typename Traits,
+              typename xtype1, typename itype1,
+              typename output_mixin1, bool output_previous1,
+              typename stream_mixin1, typename multiplier_mixin1>
+    friend std::basic_ostream<CharT,Traits>&
+    operator<<(std::basic_ostream<CharT,Traits>& out,
+               const engine<xtype1,itype1,
+                              output_mixin1,output_previous1,
+                              stream_mixin1, multiplier_mixin1>&);
+
+    template <typename CharT, typename Traits,
+              typename xtype1, typename itype1,
+              typename output_mixin1, bool output_previous1,
+              typename stream_mixin1, typename multiplier_mixin1>
+    friend std::basic_istream<CharT,Traits>&
+    operator>>(std::basic_istream<CharT,Traits>& in,
+               engine<xtype1, itype1,
+                        output_mixin1, output_previous1,
+                        stream_mixin1, multiplier_mixin1>& rng);
+};
+
+template <typename CharT, typename Traits,
+          typename xtype, typename itype,
+          typename output_mixin, bool output_previous,
+          typename stream_mixin, typename multiplier_mixin>
+std::basic_ostream<CharT,Traits>&
+operator<<(std::basic_ostream<CharT,Traits>& out,
+           const engine<xtype,itype,
+                          output_mixin,output_previous,
+                          stream_mixin, multiplier_mixin>& rng)
+{
+    using pcg_extras::operator<<;
+
+    auto orig_flags = out.flags(std::ios_base::dec | std::ios_base::left);
+    auto space = out.widen(' ');
+    auto orig_fill = out.fill();
+
+    out << rng.multiplier() << space
+        << rng.increment() << space
+        << rng.state_;
+
+    out.flags(orig_flags);
+    out.fill(orig_fill);
+    return out;
+}
+
+
+template <typename CharT, typename Traits,
+          typename xtype, typename itype,
+          typename output_mixin, bool output_previous,
+          typename stream_mixin, typename multiplier_mixin>
+std::basic_istream<CharT,Traits>&
+operator>>(std::basic_istream<CharT,Traits>& in,
+           engine<xtype,itype,
+                    output_mixin,output_previous,
+                    stream_mixin, multiplier_mixin>& rng)
+{
+    using pcg_extras::operator>>;
+
+    auto orig_flags = in.flags(std::ios_base::dec | std::ios_base::skipws);
+
+    itype multiplier, increment, state;
+    in >> multiplier >> increment >> state;
+
+    if (!in.fail()) {
+        bool good = true;
+        if (multiplier != rng.multiplier()) {
+           good = false;
+        } else if (rng.can_specify_stream) {
+           rng.set_stream(increment >> 1);
+        } else if (increment != rng.increment()) {
+           good = false;
+        }
+        if (good) {
+            rng.state_ = state;
+        } else {
+            in.clear(std::ios::failbit);
+        }
+    }
+
+    in.flags(orig_flags);
+    return in;
+}
+
+
+template <typename xtype, typename itype,
+          typename output_mixin, bool output_previous,
+          typename stream_mixin, typename multiplier_mixin>
+itype engine<xtype,itype,output_mixin,output_previous,stream_mixin,
+             multiplier_mixin>::advance(
+    itype state, itype delta, itype cur_mult, itype cur_plus)
+{
+    // The method used here is based on Brown, "Random Number Generation
+    // with Arbitrary Stride,", Transactions of the American Nuclear
+    // Society (Nov. 1994).  The algorithm is very similar to fast
+    // exponentiation.
+    //
+    // Even though delta is an unsigned integer, we can pass a
+    // signed integer to go backwards, it just goes "the long way round".
+
+    constexpr itype ZERO = 0u;  // itype may be a non-trivial types, so
+    constexpr itype ONE  = 1u;  // we define some ugly constants.
+    itype acc_mult = 1;
+    itype acc_plus = 0;
+    while (delta > ZERO) {
+       if (delta & ONE) {
+          acc_mult *= cur_mult;
+          acc_plus = acc_plus*cur_mult + cur_plus;
+       }
+       cur_plus = (cur_mult+ONE)*cur_plus;
+       cur_mult *= cur_mult;
+       delta >>= 1;
+    }
+    return acc_mult * state + acc_plus;
+}
+
+template <typename xtype, typename itype,
+          typename output_mixin, bool output_previous,
+          typename stream_mixin, typename multiplier_mixin>
+itype engine<xtype,itype,output_mixin,output_previous,stream_mixin,
+               multiplier_mixin>::distance(
+    itype cur_state, itype newstate, itype cur_mult, itype cur_plus, itype mask)
+{
+    constexpr itype ONE  = 1u;  // itype could be weird, so use constant
+    bool is_mcg = cur_plus == itype(0);
+    itype the_bit = is_mcg ? itype(4u) : itype(1u);
+    itype distance = 0u;
+    while ((cur_state & mask) != (newstate & mask)) {
+       if ((cur_state & the_bit) != (newstate & the_bit)) {
+           cur_state = cur_state * cur_mult + cur_plus;
+           distance |= the_bit;
+       }
+       assert((cur_state & the_bit) == (newstate & the_bit));
+       the_bit <<= 1;
+       cur_plus = (cur_mult+ONE)*cur_plus;
+       cur_mult *= cur_mult;
+    }
+    return is_mcg ? distance >> 2 : distance;
+}
+
+template <typename xtype, typename itype,
+          typename output_mixin, bool output_previous,
+          typename stream_mixin_lhs, typename multiplier_mixin_lhs,
+          typename stream_mixin_rhs, typename multiplier_mixin_rhs>
+itype operator-(const engine<xtype,itype,
+                               output_mixin,output_previous,
+                               stream_mixin_lhs, multiplier_mixin_lhs>& lhs,
+               const engine<xtype,itype,
+                               output_mixin,output_previous,
+                               stream_mixin_rhs, multiplier_mixin_rhs>& rhs)
+{
+    static_assert(
+        std::is_same<stream_mixin_lhs, stream_mixin_rhs>::value &&
+            std::is_same<multiplier_mixin_lhs, multiplier_mixin_rhs>::value,
+        "Incomparable generators");
+    if (lhs.increment() == rhs.increment()) {
+       return rhs.distance(lhs.state_);
+    } else  {
+       constexpr itype ONE = 1u;
+       itype lhs_diff = lhs.increment() + (lhs.multiplier()-ONE) * lhs.state_;
+       itype rhs_diff = rhs.increment() + (rhs.multiplier()-ONE) * rhs.state_;
+       if ((lhs_diff & itype(3u)) != (rhs_diff & itype(3u))) {
+           rhs_diff = -rhs_diff;
+       }
+       return rhs.distance(rhs_diff, lhs_diff, rhs.multiplier(), itype(0u));
+    }
+}
+
+
+template <typename xtype, typename itype,
+          typename output_mixin, bool output_previous,
+          typename stream_mixin_lhs, typename multiplier_mixin_lhs,
+          typename stream_mixin_rhs, typename multiplier_mixin_rhs>
+bool operator==(const engine<xtype,itype,
+                               output_mixin,output_previous,
+                               stream_mixin_lhs, multiplier_mixin_lhs>& lhs,
+                const engine<xtype,itype,
+                               output_mixin,output_previous,
+                               stream_mixin_rhs, multiplier_mixin_rhs>& rhs)
+{
+    return    (lhs.multiplier() == rhs.multiplier())
+           && (lhs.increment()  == rhs.increment())
+           && (lhs.state_       == rhs.state_);
+}
+
+template <typename xtype, typename itype,
+          typename output_mixin, bool output_previous,
+          typename stream_mixin_lhs, typename multiplier_mixin_lhs,
+          typename stream_mixin_rhs, typename multiplier_mixin_rhs>
+inline bool operator!=(const engine<xtype,itype,
+                               output_mixin,output_previous,
+                               stream_mixin_lhs, multiplier_mixin_lhs>& lhs,
+                       const engine<xtype,itype,
+                               output_mixin,output_previous,
+                               stream_mixin_rhs, multiplier_mixin_rhs>& rhs)
+{
+    return !operator==(lhs,rhs);
+}
+
+
+template <typename xtype, typename itype,
+         template<typename XT,typename IT> class output_mixin,
+         bool output_previous = (sizeof(itype) <= 8),
+         template<typename IT> class multiplier_mixin = default_multiplier>
+using oneseq_base  = engine<xtype, itype,
+                        output_mixin<xtype, itype>, output_previous,
+                        oneseq_stream<itype>,
+                        multiplier_mixin<itype> >;
+
+template <typename xtype, typename itype,
+         template<typename XT,typename IT> class output_mixin,
+         bool output_previous = (sizeof(itype) <= 8),
+         template<typename IT> class multiplier_mixin = default_multiplier>
+using unique_base = engine<xtype, itype,
+                         output_mixin<xtype, itype>, output_previous,
+                         unique_stream<itype>,
+                         multiplier_mixin<itype> >;
+
+template <typename xtype, typename itype,
+         template<typename XT,typename IT> class output_mixin,
+         bool output_previous = (sizeof(itype) <= 8),
+         template<typename IT> class multiplier_mixin = default_multiplier>
+using setseq_base = engine<xtype, itype,
+                         output_mixin<xtype, itype>, output_previous,
+                         specific_stream<itype>,
+                         multiplier_mixin<itype> >;
+
+template <typename xtype, typename itype,
+         template<typename XT,typename IT> class output_mixin,
+         bool output_previous = (sizeof(itype) <= 8),
+         template<typename IT> class multiplier_mixin = default_multiplier>
+using mcg_base = engine<xtype, itype,
+                      output_mixin<xtype, itype>, output_previous,
+                      no_stream<itype>,
+                      multiplier_mixin<itype> >;
+
+/*
+ * OUTPUT FUNCTIONS.
+ *
+ * These are the core of the PCG generation scheme.  They specify how to
+ * turn the base LCG's internal state into the output value of the final
+ * generator.
+ *
+ * They're implemented as mixin classes.
+ *
+ * All of the classes have code that is written to allow it to be applied
+ * at *arbitrary* bit sizes, although in practice they'll only be used at
+ * standard sizes supported by C++.
+ */
+
+/*
+ * XSH RS -- high xorshift, followed by a random shift
+ *
+ * Fast.  A good performer.
+ */
+
+template <typename xtype, typename itype>
+struct xsh_rs_mixin {
+    static xtype output(itype internal)
+    {
+        constexpr bitcount_t bits        = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t xtypebits   = bitcount_t(sizeof(xtype) * 8);
+        constexpr bitcount_t sparebits   = bits - xtypebits;
+        constexpr bitcount_t opbits =
+                              sparebits-5 >= 64 ? 5
+                            : sparebits-4 >= 32 ? 4
+                            : sparebits-3 >= 16 ? 3
+                            : sparebits-2 >= 4  ? 2
+                            : sparebits-1 >= 1  ? 1
+                            :                     0;
+        constexpr bitcount_t mask = (1 << opbits) - 1;
+        constexpr bitcount_t maxrandshift  = mask;
+        constexpr bitcount_t topspare     = opbits;
+        constexpr bitcount_t bottomspare = sparebits - topspare;
+        constexpr bitcount_t xshift     = topspare + (xtypebits+maxrandshift)/2;
+        bitcount_t rshift =
+            opbits ? bitcount_t(internal >> (bits - opbits)) & mask : 0;
+        internal ^= internal >> xshift;
+        xtype result = xtype(internal >> (bottomspare - maxrandshift + rshift));
+        return result;
+    }
+};
+
+/*
+ * XSH RR -- high xorshift, followed by a random rotate
+ *
+ * Fast.  A good performer.  Slightly better statistically than XSH RS.
+ */
+
+template <typename xtype, typename itype>
+struct xsh_rr_mixin {
+    static xtype output(itype internal)
+    {
+        constexpr bitcount_t bits        = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t xtypebits   = bitcount_t(sizeof(xtype)*8);
+        constexpr bitcount_t sparebits   = bits - xtypebits;
+        constexpr bitcount_t wantedopbits =
+                              xtypebits >= 128 ? 7
+                            : xtypebits >=  64 ? 6
+                            : xtypebits >=  32 ? 5
+                            : xtypebits >=  16 ? 4
+                            :                    3;
+        constexpr bitcount_t opbits =
+                              sparebits >= wantedopbits ? wantedopbits
+                                                        : sparebits;
+        constexpr bitcount_t amplifier = wantedopbits - opbits;
+        constexpr bitcount_t mask = (1 << opbits) - 1;
+        constexpr bitcount_t topspare    = opbits;
+        constexpr bitcount_t bottomspare = sparebits - topspare;
+        constexpr bitcount_t xshift      = (topspare + xtypebits)/2;
+        bitcount_t rot = opbits ? bitcount_t(internal >> (bits - opbits)) & mask
+                                : 0;
+        bitcount_t amprot = (rot << amplifier) & mask;
+        internal ^= internal >> xshift;
+        xtype result = xtype(internal >> bottomspare);
+        result = rotr(result, amprot);
+        return result;
+    }
+};
+
+/*
+ * RXS -- random xorshift
+ */
+
+template <typename xtype, typename itype>
+struct rxs_mixin {
+static xtype output_rxs(itype internal)
+    {
+        constexpr bitcount_t bits        = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t xtypebits   = bitcount_t(sizeof(xtype)*8);
+        constexpr bitcount_t shift       = bits - xtypebits;
+        constexpr bitcount_t extrashift  = (xtypebits - shift)/2;
+        bitcount_t rshift = shift > 64+8 ? (internal >> (bits - 6)) & 63
+                       : shift > 32+4 ? (internal >> (bits - 5)) & 31
+                       : shift > 16+2 ? (internal >> (bits - 4)) & 15
+                       : shift >  8+1 ? (internal >> (bits - 3)) & 7
+                       : shift >  4+1 ? (internal >> (bits - 2)) & 3
+                       : shift >  2+1 ? (internal >> (bits - 1)) & 1
+                       :              0;
+        internal ^= internal >> (shift + extrashift - rshift);
+        xtype result = internal >> rshift;
+        return result;
+    }
+};
+
+/*
+ * RXS M XS -- random xorshift, mcg multiply, fixed xorshift
+ *
+ * The most statistically powerful generator, but all those steps
+ * make it slower than some of the others.  We give it the rottenest jobs.
+ *
+ * Because it's usually used in contexts where the state type and the
+ * result type are the same, it is a permutation and is thus invertable.
+ * We thus provide a function to invert it.  This function is used to
+ * for the "inside out" generator used by the extended generator.
+ */
+
+/* Defined type-based concepts for the multiplication step.  They're actually
+ * all derived by truncating the 128-bit, which was computed to be a good
+ * "universal" constant.
+ */
+
+template <typename T>
+struct mcg_multiplier {
+    // Not defined for an arbitrary type
+};
+
+template <typename T>
+struct mcg_unmultiplier {
+    // Not defined for an arbitrary type
+};
+
+PCG_DEFINE_CONSTANT(uint8_t,  mcg, multiplier,   217U)
+PCG_DEFINE_CONSTANT(uint8_t,  mcg, unmultiplier, 105U)
+
+PCG_DEFINE_CONSTANT(uint16_t, mcg, multiplier,   62169U)
+PCG_DEFINE_CONSTANT(uint16_t, mcg, unmultiplier, 28009U)
+
+PCG_DEFINE_CONSTANT(uint32_t, mcg, multiplier,   277803737U)
+PCG_DEFINE_CONSTANT(uint32_t, mcg, unmultiplier, 2897767785U)
+
+PCG_DEFINE_CONSTANT(uint64_t, mcg, multiplier,   12605985483714917081ULL)
+PCG_DEFINE_CONSTANT(uint64_t, mcg, unmultiplier, 15009553638781119849ULL)
+
+PCG_DEFINE_CONSTANT(pcg128_t, mcg, multiplier,
+        PCG_128BIT_CONSTANT(17766728186571221404ULL, 12605985483714917081ULL))
+PCG_DEFINE_CONSTANT(pcg128_t, mcg, unmultiplier,
+        PCG_128BIT_CONSTANT(14422606686972528997ULL, 15009553638781119849ULL))
+
+
+template <typename xtype, typename itype>
+struct rxs_m_xs_mixin {
+    static xtype output(itype internal)
+    {
+        constexpr bitcount_t xtypebits = bitcount_t(sizeof(xtype) * 8);
+        constexpr bitcount_t bits = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t opbits = xtypebits >= 128 ? 6
+                                 : xtypebits >=  64 ? 5
+                                 : xtypebits >=  32 ? 4
+                                 : xtypebits >=  16 ? 3
+                                 :                    2;
+        constexpr bitcount_t shift = bits - xtypebits;
+        constexpr bitcount_t mask = (1 << opbits) - 1;
+        bitcount_t rshift =
+            opbits ? bitcount_t(internal >> (bits - opbits)) & mask : 0;
+        internal ^= internal >> (opbits + rshift);
+        internal *= mcg_multiplier<itype>::multiplier();
+        xtype result = internal >> shift;
+        result ^= result >> ((2U*xtypebits+2U)/3U);
+        return result;
+    }
+
+    static itype unoutput(itype internal)
+    {
+        constexpr bitcount_t bits = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t opbits = bits >= 128 ? 6
+                                 : bits >=  64 ? 5
+                                 : bits >=  32 ? 4
+                                 : bits >=  16 ? 3
+                                 :               2;
+        constexpr bitcount_t mask = (1 << opbits) - 1;
+
+        internal = unxorshift(internal, bits, (2U*bits+2U)/3U);
+
+        internal *= mcg_unmultiplier<itype>::unmultiplier();
+
+        bitcount_t rshift = opbits ? (internal >> (bits - opbits)) & mask : 0;
+        internal = unxorshift(internal, bits, opbits + rshift);
+
+        return internal;
+    }
+};
+
+
+/*
+ * RXS M -- random xorshift, mcg multiply
+ */
+
+template <typename xtype, typename itype>
+struct rxs_m_mixin {
+    static xtype output(itype internal)
+    {
+        constexpr bitcount_t xtypebits = bitcount_t(sizeof(xtype) * 8);
+        constexpr bitcount_t bits = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t opbits = xtypebits >= 128 ? 6
+                                 : xtypebits >=  64 ? 5
+                                 : xtypebits >=  32 ? 4
+                                 : xtypebits >=  16 ? 3
+                                 :                    2;
+        constexpr bitcount_t shift = bits - xtypebits;
+        constexpr bitcount_t mask = (1 << opbits) - 1;
+        bitcount_t rshift = opbits ? (internal >> (bits - opbits)) & mask : 0;
+        internal ^= internal >> (opbits + rshift);
+        internal *= mcg_multiplier<itype>::multiplier();
+        xtype result = internal >> shift;
+        return result;
+    }
+};
+
+
+/*
+ * DXSM -- double xorshift multiply
+ *
+ * This is a new, more powerful output permutation (added in 2019).  It's
+ * a more comprehensive scrambling than RXS M, but runs faster on 128-bit
+ * types.  Although primarily intended for use at large sizes, also works
+ * at smaller sizes as well.
+ *
+ * This permutation is similar to xorshift multiply hash functions, except
+ * that one of the multipliers is the LCG multiplier (to avoid needing to
+ * have a second constant) and the other is based on the low-order bits.
+ * This latter aspect means that the scrambling applied to the high bits
+ * depends on the low bits, and makes it (to my eye) impractical to back
+ * out the permutation without having the low-order bits.
+ */
+
+template <typename xtype, typename itype>
+struct dxsm_mixin {
+    inline xtype output(itype internal)
+    {
+        constexpr bitcount_t xtypebits = bitcount_t(sizeof(xtype) * 8);
+        constexpr bitcount_t itypebits = bitcount_t(sizeof(itype) * 8);
+        static_assert(xtypebits <= itypebits/2,
+                      "Output type must be half the size of the state type.");
+
+        xtype hi = xtype(internal >> (itypebits - xtypebits));
+        xtype lo = xtype(internal);
+
+        lo |= 1;
+        hi ^= hi >> (xtypebits/2);
+	hi *= xtype(cheap_multiplier<itype>::multiplier());
+	hi ^= hi >> (3*(xtypebits/4));
+	hi *= lo;
+	return hi;
+    }
+};
+
+
+/*
+ * XSL RR -- fixed xorshift (to low bits), random rotate
+ *
+ * Useful for 128-bit types that are split across two CPU registers.
+ */
+
+template <typename xtype, typename itype>
+struct xsl_rr_mixin {
+    static xtype output(itype internal)
+    {
+        constexpr bitcount_t xtypebits = bitcount_t(sizeof(xtype) * 8);
+        constexpr bitcount_t bits = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t sparebits = bits - xtypebits;
+        constexpr bitcount_t wantedopbits = xtypebits >= 128 ? 7
+                                       : xtypebits >=  64 ? 6
+                                       : xtypebits >=  32 ? 5
+                                       : xtypebits >=  16 ? 4
+                                       :                    3;
+        constexpr bitcount_t opbits = sparebits >= wantedopbits ? wantedopbits
+                                                             : sparebits;
+        constexpr bitcount_t amplifier = wantedopbits - opbits;
+        constexpr bitcount_t mask = (1 << opbits) - 1;
+        constexpr bitcount_t topspare = sparebits;
+        constexpr bitcount_t bottomspare = sparebits - topspare;
+        constexpr bitcount_t xshift = (topspare + xtypebits) / 2;
+
+        bitcount_t rot =
+            opbits ? bitcount_t(internal >> (bits - opbits)) & mask : 0;
+        bitcount_t amprot = (rot << amplifier) & mask;
+        internal ^= internal >> xshift;
+        xtype result = xtype(internal >> bottomspare);
+        result = rotr(result, amprot);
+        return result;
+    }
+};
+
+
+/*
+ * XSL RR RR -- fixed xorshift (to low bits), random rotate (both parts)
+ *
+ * Useful for 128-bit types that are split across two CPU registers.
+ * If you really want an invertable 128-bit RNG, I guess this is the one.
+ */
+
+template <typename T> struct halfsize_trait {};
+template <> struct halfsize_trait<pcg128_t>  { typedef uint64_t type; };
+template <> struct halfsize_trait<uint64_t>  { typedef uint32_t type; };
+template <> struct halfsize_trait<uint32_t>  { typedef uint16_t type; };
+template <> struct halfsize_trait<uint16_t>  { typedef uint8_t type;  };
+
+template <typename xtype, typename itype>
+struct xsl_rr_rr_mixin {
+    typedef typename halfsize_trait<itype>::type htype;
+
+    static itype output(itype internal)
+    {
+        constexpr bitcount_t htypebits = bitcount_t(sizeof(htype) * 8);
+        constexpr bitcount_t bits      = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t sparebits = bits - htypebits;
+        constexpr bitcount_t wantedopbits = htypebits >= 128 ? 7
+                                       : htypebits >=  64 ? 6
+                                       : htypebits >=  32 ? 5
+                                       : htypebits >=  16 ? 4
+                                       :                    3;
+        constexpr bitcount_t opbits = sparebits >= wantedopbits ? wantedopbits
+                                                                : sparebits;
+        constexpr bitcount_t amplifier = wantedopbits - opbits;
+        constexpr bitcount_t mask = (1 << opbits) - 1;
+        constexpr bitcount_t topspare = sparebits;
+        constexpr bitcount_t xshift = (topspare + htypebits) / 2;
+
+        bitcount_t rot =
+            opbits ? bitcount_t(internal >> (bits - opbits)) & mask : 0;
+        bitcount_t amprot = (rot << amplifier) & mask;
+        internal ^= internal >> xshift;
+        htype lowbits = htype(internal);
+        lowbits = rotr(lowbits, amprot);
+        htype highbits = htype(internal >> topspare);
+        bitcount_t rot2 = lowbits & mask;
+        bitcount_t amprot2 = (rot2 << amplifier) & mask;
+        highbits = rotr(highbits, amprot2);
+        return (itype(highbits) << topspare) ^ itype(lowbits);
+    }
+};
+
+
+/*
+ * XSH -- fixed xorshift (to high bits)
+ *
+ * You shouldn't use this at 64-bits or less.
+ */
+
+template <typename xtype, typename itype>
+struct xsh_mixin {
+    static xtype output(itype internal)
+    {
+        constexpr bitcount_t xtypebits = bitcount_t(sizeof(xtype) * 8);
+        constexpr bitcount_t bits = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t sparebits = bits - xtypebits;
+        constexpr bitcount_t topspare = 0;
+        constexpr bitcount_t bottomspare = sparebits - topspare;
+        constexpr bitcount_t xshift = (topspare + xtypebits) / 2;
+
+        internal ^= internal >> xshift;
+        xtype result = internal >> bottomspare;
+        return result;
+    }
+};
+
+/*
+ * XSL -- fixed xorshift (to low bits)
+ *
+ * You shouldn't use this at 64-bits or less.
+ */
+
+template <typename xtype, typename itype>
+struct xsl_mixin {
+    inline xtype output(itype internal)
+    {
+        constexpr bitcount_t xtypebits = bitcount_t(sizeof(xtype) * 8);
+        constexpr bitcount_t bits = bitcount_t(sizeof(itype) * 8);
+        constexpr bitcount_t sparebits = bits - xtypebits;
+        constexpr bitcount_t topspare = sparebits;
+        constexpr bitcount_t bottomspare = sparebits - topspare;
+        constexpr bitcount_t xshift = (topspare + xtypebits) / 2;
+
+        internal ^= internal >> xshift;
+        xtype result = internal >> bottomspare;
+        return result;
+    }
+};
+
+
+/* ---- End of Output Functions ---- */
+
+
+template <typename baseclass>
+struct inside_out : private baseclass {
+    inside_out() = delete;
+
+    typedef typename baseclass::result_type result_type;
+    typedef typename baseclass::state_type  state_type;
+    static_assert(sizeof(result_type) == sizeof(state_type),
+                  "Require a RNG whose output function is a permutation");
+
+    static bool external_step(result_type& randval, size_t i)
+    {
+        state_type state = baseclass::unoutput(randval);
+        state = state * baseclass::multiplier() + baseclass::increment()
+                + state_type(i*2);
+        result_type result = baseclass::output(state);
+        randval = result;
+        state_type zero =
+            baseclass::is_mcg ? state & state_type(3U) : state_type(0U);
+        return result == zero;
+    }
+
+    static bool external_advance(result_type& randval, size_t i,
+                                 result_type delta, bool forwards = true)
+    {
+        state_type state = baseclass::unoutput(randval);
+        state_type mult  = baseclass::multiplier();
+        state_type inc   = baseclass::increment() + state_type(i*2);
+        state_type zero =
+            baseclass::is_mcg ? state & state_type(3U) : state_type(0U);
+        state_type dist_to_zero = baseclass::distance(state, zero, mult, inc);
+        bool crosses_zero =
+            forwards ? dist_to_zero <= delta
+                     : (-dist_to_zero) <= delta;
+        if (!forwards)
+            delta = -delta;
+        state = baseclass::advance(state, delta, mult, inc);
+        randval = baseclass::output(state);
+        return crosses_zero;
+    }
+};
+
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2, typename baseclass, typename extvalclass, bool kdd = true>
+class pcg_extended : public baseclass {
+public:
+    typedef typename baseclass::state_type  state_type;
+    typedef typename baseclass::result_type result_type;
+    typedef inside_out<extvalclass> insideout;
+
+private:
+    static constexpr bitcount_t rtypebits = sizeof(result_type)*8;
+    static constexpr bitcount_t stypebits = sizeof(state_type)*8;
+
+    static constexpr bitcount_t tick_limit_pow2 = 64U;
+
+    static constexpr size_t table_size  = 1UL << table_pow2;
+    static constexpr size_t table_shift = stypebits - table_pow2;
+    static constexpr state_type table_mask =
+        (state_type(1U) << table_pow2) - state_type(1U);
+
+    static constexpr bool   may_tick  =
+        (advance_pow2 < stypebits) && (advance_pow2 < tick_limit_pow2);
+    static constexpr size_t tick_shift = stypebits - advance_pow2;
+    static constexpr state_type tick_mask  =
+        may_tick ? state_type(
+                       (uint64_t(1) << (advance_pow2*may_tick)) - 1)
+                                        // ^-- stupidity to appease GCC warnings
+                 : ~state_type(0U);
+
+    static constexpr bool may_tock = stypebits < tick_limit_pow2;
+
+    result_type data_[table_size];
+
+    PCG_NOINLINE void advance_table();
+
+    PCG_NOINLINE void advance_table(state_type delta, bool isForwards = true);
+
+    result_type& get_extended_value()
+    {
+        state_type state = this->state_;
+        if (kdd && baseclass::is_mcg) {
+            // The low order bits of an MCG are constant, so drop them.
+            state >>= 2;
+        }
+        size_t index       = kdd ? state &  table_mask
+                                 : state >> table_shift;
+
+        if (may_tick) {
+            bool tick = kdd ? (state & tick_mask) == state_type(0u)
+                            : (state >> tick_shift) == state_type(0u);
+            if (tick)
+                    advance_table();
+        }
+        if (may_tock) {
+            bool tock = state == state_type(0u);
+            if (tock)
+                advance_table();
+        }
+        return data_[index];
+    }
+
+public:
+    static constexpr size_t period_pow2()
+    {
+        return baseclass::period_pow2() + table_size*extvalclass::period_pow2();
+    }
+
+    PCG_ALWAYS_INLINE result_type operator()()
+    {
+        result_type rhs = get_extended_value();
+        result_type lhs = this->baseclass::operator()();
+        return lhs ^ rhs;
+    }
+
+    result_type operator()(result_type upper_bound)
+    {
+        return bounded_rand(*this, upper_bound);
+    }
+
+    void set(result_type wanted)
+    {
+        result_type& rhs = get_extended_value();
+        result_type lhs = this->baseclass::operator()();
+        rhs = lhs ^ wanted;
+    }
+
+    void advance(state_type distance, bool forwards = true);
+
+    void backstep(state_type distance)
+    {
+        advance(distance, false);
+    }
+
+    pcg_extended(const result_type* data)
+        : baseclass()
+    {
+        datainit(data);
+    }
+
+    pcg_extended(const result_type* data, state_type seed)
+        : baseclass(seed)
+    {
+        datainit(data);
+    }
+
+    // This function may or may not exist.  It thus has to be a template
+    // to use SFINAE; users don't have to worry about its template-ness.
+
+    template <typename bc = baseclass>
+    pcg_extended(const result_type* data, state_type seed,
+            typename bc::stream_state stream_seed)
+        : baseclass(seed, stream_seed)
+    {
+        datainit(data);
+    }
+
+    pcg_extended()
+        : baseclass()
+    {
+        selfinit();
+    }
+
+    pcg_extended(state_type seed)
+        : baseclass(seed)
+    {
+        selfinit();
+    }
+
+    // This function may or may not exist.  It thus has to be a template
+    // to use SFINAE; users don't have to worry about its template-ness.
+
+    template <typename bc = baseclass>
+    pcg_extended(state_type seed, typename bc::stream_state stream_seed)
+        : baseclass(seed, stream_seed)
+    {
+        selfinit();
+    }
+
+private:
+    void selfinit();
+    void datainit(const result_type* data);
+
+public:
+
+    template<typename SeedSeq, typename = typename std::enable_if<
+           !std::is_convertible<SeedSeq, result_type>::value
+        && !std::is_convertible<SeedSeq, pcg_extended>::value>::type>
+    pcg_extended(SeedSeq&& seedSeq)
+        : baseclass(seedSeq)
+    {
+        generate_to<table_size>(seedSeq, data_);
+    }
+
+    template<typename... Args>
+    void seed(Args&&... args)
+    {
+        new (this) pcg_extended(std::forward<Args>(args)...);
+    }
+
+    template <bitcount_t table_pow2_, bitcount_t advance_pow2_,
+              typename baseclass_, typename extvalclass_, bool kdd_>
+    friend bool operator==(const pcg_extended<table_pow2_, advance_pow2_,
+                                              baseclass_, extvalclass_, kdd_>&,
+                           const pcg_extended<table_pow2_, advance_pow2_,
+                                              baseclass_, extvalclass_, kdd_>&);
+
+    template <typename CharT, typename Traits,
+              bitcount_t table_pow2_, bitcount_t advance_pow2_,
+              typename baseclass_, typename extvalclass_, bool kdd_>
+    friend std::basic_ostream<CharT,Traits>&
+    operator<<(std::basic_ostream<CharT,Traits>& out,
+               const pcg_extended<table_pow2_, advance_pow2_,
+                              baseclass_, extvalclass_, kdd_>&);
+
+    template <typename CharT, typename Traits,
+              bitcount_t table_pow2_, bitcount_t advance_pow2_,
+              typename baseclass_, typename extvalclass_, bool kdd_>
+    friend std::basic_istream<CharT,Traits>&
+    operator>>(std::basic_istream<CharT,Traits>& in,
+               pcg_extended<table_pow2_, advance_pow2_,
+                        baseclass_, extvalclass_, kdd_>&);
+
+};
+
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename baseclass, typename extvalclass, bool kdd>
+void pcg_extended<table_pow2,advance_pow2,baseclass,extvalclass,kdd>::datainit(
+         const result_type* data)
+{
+    for (size_t i = 0; i < table_size; ++i)
+        data_[i] = data[i];
+}
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename baseclass, typename extvalclass, bool kdd>
+void pcg_extended<table_pow2,advance_pow2,baseclass,extvalclass,kdd>::selfinit()
+{
+    // We need to fill the extended table with something, and we have
+    // very little provided data, so we use the base generator to
+    // produce values.  Although not ideal (use a seed sequence, folks!),
+    // unexpected correlations are mitigated by
+    //      - using XOR differences rather than the number directly
+    //      - the way the table is accessed, its values *won't* be accessed
+    //        in the same order the were written.
+    //      - any strange correlations would only be apparent if we
+    //        were to backstep the generator so that the base generator
+    //        was generating the same values again
+    result_type lhs = baseclass::operator()();
+    result_type rhs = baseclass::operator()();
+    result_type xdiff = lhs - rhs;
+    for (size_t i = 0; i < table_size; ++i) {
+        data_[i] = baseclass::operator()() ^ xdiff;
+    }
+}
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename baseclass, typename extvalclass, bool kdd>
+bool operator==(const pcg_extended<table_pow2, advance_pow2,
+                               baseclass, extvalclass, kdd>& lhs,
+                const pcg_extended<table_pow2, advance_pow2,
+                               baseclass, extvalclass, kdd>& rhs)
+{
+    auto& base_lhs = static_cast<const baseclass&>(lhs);
+    auto& base_rhs = static_cast<const baseclass&>(rhs);
+    return base_lhs == base_rhs
+        && std::equal(
+               std::begin(lhs.data_), std::end(lhs.data_),
+               std::begin(rhs.data_)
+           );
+}
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename baseclass, typename extvalclass, bool kdd>
+inline bool operator!=(const pcg_extended<table_pow2, advance_pow2,
+                                      baseclass, extvalclass, kdd>& lhs,
+                       const pcg_extended<table_pow2, advance_pow2,
+                                      baseclass, extvalclass, kdd>& rhs)
+{
+    return !operator==(lhs, rhs);
+}
+
+template <typename CharT, typename Traits,
+          bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename baseclass, typename extvalclass, bool kdd>
+std::basic_ostream<CharT,Traits>&
+operator<<(std::basic_ostream<CharT,Traits>& out,
+           const pcg_extended<table_pow2, advance_pow2,
+                          baseclass, extvalclass, kdd>& rng)
+{
+    auto orig_flags = out.flags(std::ios_base::dec | std::ios_base::left);
+    auto space = out.widen(' ');
+    auto orig_fill = out.fill();
+
+    out << rng.multiplier() << space
+        << rng.increment() << space
+        << rng.state_;
+
+    for (const auto& datum : rng.data_)
+        out << space << datum;
+
+    out.flags(orig_flags);
+    out.fill(orig_fill);
+    return out;
+}
+
+template <typename CharT, typename Traits,
+          bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename baseclass, typename extvalclass, bool kdd>
+std::basic_istream<CharT,Traits>&
+operator>>(std::basic_istream<CharT,Traits>& in,
+           pcg_extended<table_pow2, advance_pow2,
+                    baseclass, extvalclass, kdd>& rng)
+{
+    pcg_extended<table_pow2, advance_pow2, baseclass, extvalclass> new_rng;
+    auto& base_rng = static_cast<baseclass&>(new_rng);
+    in >> base_rng;
+
+    if (in.fail())
+        return in;
+
+    auto orig_flags = in.flags(std::ios_base::dec | std::ios_base::skipws);
+
+    for (auto& datum : new_rng.data_) {
+        in >> datum;
+        if (in.fail())
+            goto bail;
+    }
+
+    rng = new_rng;
+
+bail:
+    in.flags(orig_flags);
+    return in;
+}
+
+
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename baseclass, typename extvalclass, bool kdd>
+void
+pcg_extended<table_pow2,advance_pow2,baseclass,extvalclass,kdd>::advance_table()
+{
+    bool carry = false;
+    for (size_t i = 0; i < table_size; ++i) {
+        if (carry) {
+            carry = insideout::external_step(data_[i],i+1);
+        }
+        bool carry2 = insideout::external_step(data_[i],i+1);
+        carry = carry || carry2;
+    }
+}
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename baseclass, typename extvalclass, bool kdd>
+void
+pcg_extended<table_pow2,advance_pow2,baseclass,extvalclass,kdd>::advance_table(
+        state_type delta, bool isForwards)
+{
+    typedef typename baseclass::state_type   base_state_t;
+    typedef typename extvalclass::state_type ext_state_t;
+    constexpr bitcount_t basebits = sizeof(base_state_t)*8;
+    constexpr bitcount_t extbits  = sizeof(ext_state_t)*8;
+    static_assert(basebits <= extbits || advance_pow2 > 0,
+                  "Current implementation might overflow its carry");
+
+    base_state_t carry = 0;
+    for (size_t i = 0; i < table_size; ++i) {
+        base_state_t total_delta = carry + delta;
+        ext_state_t  trunc_delta = ext_state_t(total_delta);
+        if (basebits > extbits) {
+            carry = total_delta >> extbits;
+        } else {
+            carry = 0;
+        }
+        carry +=
+            insideout::external_advance(data_[i],i+1, trunc_delta, isForwards);
+    }
+}
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename baseclass, typename extvalclass, bool kdd>
+void pcg_extended<table_pow2,advance_pow2,baseclass,extvalclass,kdd>::advance(
+    state_type distance, bool forwards)
+{
+    static_assert(kdd,
+        "Efficient advance is too hard for non-kdd extension. "
+        "For a weak advance, cast to base class");
+    state_type zero =
+        baseclass::is_mcg ? this->state_ & state_type(3U) : state_type(0U);
+    if (may_tick) {
+        state_type ticks = distance >> (advance_pow2*may_tick);
+                                        // ^-- stupidity to appease GCC
+                                        // warnings
+        state_type adv_mask =
+            baseclass::is_mcg ? tick_mask << 2 : tick_mask;
+        state_type next_advance_distance = this->distance(zero, adv_mask);
+        if (!forwards)
+            next_advance_distance = (-next_advance_distance) & tick_mask;
+        if (next_advance_distance < (distance & tick_mask)) {
+            ++ticks;
+        }
+        if (ticks)
+            advance_table(ticks, forwards);
+    }
+    if (forwards) {
+        if (may_tock && this->distance(zero) <= distance)
+            advance_table();
+        baseclass::advance(distance);
+    } else {
+        if (may_tock && -(this->distance(zero)) <= distance)
+            advance_table(state_type(1U), false);
+        baseclass::advance(-distance);
+    }
+}
+
+} // namespace pcg_detail
+
+namespace pcg_engines {
+
+using namespace pcg_detail;
+
+/* Predefined types for XSH RS */
+
+typedef oneseq_base<uint8_t,  uint16_t, xsh_rs_mixin>  oneseq_xsh_rs_16_8;
+typedef oneseq_base<uint16_t, uint32_t, xsh_rs_mixin>  oneseq_xsh_rs_32_16;
+typedef oneseq_base<uint32_t, uint64_t, xsh_rs_mixin>  oneseq_xsh_rs_64_32;
+typedef oneseq_base<uint64_t, pcg128_t, xsh_rs_mixin>  oneseq_xsh_rs_128_64;
+typedef oneseq_base<uint64_t, pcg128_t, xsh_rs_mixin, true, cheap_multiplier>
+                                                       cm_oneseq_xsh_rs_128_64;
+
+typedef unique_base<uint8_t,  uint16_t, xsh_rs_mixin>  unique_xsh_rs_16_8;
+typedef unique_base<uint16_t, uint32_t, xsh_rs_mixin>  unique_xsh_rs_32_16;
+typedef unique_base<uint32_t, uint64_t, xsh_rs_mixin>  unique_xsh_rs_64_32;
+typedef unique_base<uint64_t, pcg128_t, xsh_rs_mixin>  unique_xsh_rs_128_64;
+typedef unique_base<uint64_t, pcg128_t, xsh_rs_mixin, true, cheap_multiplier>
+                                                       cm_unique_xsh_rs_128_64;
+
+typedef setseq_base<uint8_t,  uint16_t, xsh_rs_mixin>  setseq_xsh_rs_16_8;
+typedef setseq_base<uint16_t, uint32_t, xsh_rs_mixin>  setseq_xsh_rs_32_16;
+typedef setseq_base<uint32_t, uint64_t, xsh_rs_mixin>  setseq_xsh_rs_64_32;
+typedef setseq_base<uint64_t, pcg128_t, xsh_rs_mixin>  setseq_xsh_rs_128_64;
+typedef setseq_base<uint64_t, pcg128_t, xsh_rs_mixin, true, cheap_multiplier>
+                                                       cm_setseq_xsh_rs_128_64;
+
+typedef mcg_base<uint8_t,  uint16_t, xsh_rs_mixin>  mcg_xsh_rs_16_8;
+typedef mcg_base<uint16_t, uint32_t, xsh_rs_mixin>  mcg_xsh_rs_32_16;
+typedef mcg_base<uint32_t, uint64_t, xsh_rs_mixin>  mcg_xsh_rs_64_32;
+typedef mcg_base<uint64_t, pcg128_t, xsh_rs_mixin>  mcg_xsh_rs_128_64;
+typedef mcg_base<uint64_t, pcg128_t, xsh_rs_mixin, true, cheap_multiplier>
+                                                    cm_mcg_xsh_rs_128_64;
+
+/* Predefined types for XSH RR */
+
+typedef oneseq_base<uint8_t,  uint16_t, xsh_rr_mixin>  oneseq_xsh_rr_16_8;
+typedef oneseq_base<uint16_t, uint32_t, xsh_rr_mixin>  oneseq_xsh_rr_32_16;
+typedef oneseq_base<uint32_t, uint64_t, xsh_rr_mixin>  oneseq_xsh_rr_64_32;
+typedef oneseq_base<uint64_t, pcg128_t, xsh_rr_mixin>  oneseq_xsh_rr_128_64;
+typedef oneseq_base<uint64_t, pcg128_t, xsh_rr_mixin, true, cheap_multiplier>
+                                                       cm_oneseq_xsh_rr_128_64;
+
+typedef unique_base<uint8_t,  uint16_t, xsh_rr_mixin>  unique_xsh_rr_16_8;
+typedef unique_base<uint16_t, uint32_t, xsh_rr_mixin>  unique_xsh_rr_32_16;
+typedef unique_base<uint32_t, uint64_t, xsh_rr_mixin>  unique_xsh_rr_64_32;
+typedef unique_base<uint64_t, pcg128_t, xsh_rr_mixin>  unique_xsh_rr_128_64;
+typedef unique_base<uint64_t, pcg128_t, xsh_rr_mixin, true, cheap_multiplier>
+                                                       cm_unique_xsh_rr_128_64;
+
+typedef setseq_base<uint8_t,  uint16_t, xsh_rr_mixin>  setseq_xsh_rr_16_8;
+typedef setseq_base<uint16_t, uint32_t, xsh_rr_mixin>  setseq_xsh_rr_32_16;
+typedef setseq_base<uint32_t, uint64_t, xsh_rr_mixin>  setseq_xsh_rr_64_32;
+typedef setseq_base<uint64_t, pcg128_t, xsh_rr_mixin>  setseq_xsh_rr_128_64;
+typedef setseq_base<uint64_t, pcg128_t, xsh_rr_mixin, true, cheap_multiplier>
+                                                       cm_setseq_xsh_rr_128_64;
+
+typedef mcg_base<uint8_t,  uint16_t, xsh_rr_mixin>  mcg_xsh_rr_16_8;
+typedef mcg_base<uint16_t, uint32_t, xsh_rr_mixin>  mcg_xsh_rr_32_16;
+typedef mcg_base<uint32_t, uint64_t, xsh_rr_mixin>  mcg_xsh_rr_64_32;
+typedef mcg_base<uint64_t, pcg128_t, xsh_rr_mixin>  mcg_xsh_rr_128_64;
+typedef mcg_base<uint64_t, pcg128_t, xsh_rr_mixin, true, cheap_multiplier>
+                                                    cm_mcg_xsh_rr_128_64;
+
+
+/* Predefined types for RXS M XS */
+
+typedef oneseq_base<uint8_t,  uint8_t, rxs_m_xs_mixin>   oneseq_rxs_m_xs_8_8;
+typedef oneseq_base<uint16_t, uint16_t, rxs_m_xs_mixin>  oneseq_rxs_m_xs_16_16;
+typedef oneseq_base<uint32_t, uint32_t, rxs_m_xs_mixin>  oneseq_rxs_m_xs_32_32;
+typedef oneseq_base<uint64_t, uint64_t, rxs_m_xs_mixin>  oneseq_rxs_m_xs_64_64;
+typedef oneseq_base<pcg128_t, pcg128_t, rxs_m_xs_mixin>
+                                                        oneseq_rxs_m_xs_128_128;
+typedef oneseq_base<pcg128_t, pcg128_t, rxs_m_xs_mixin, true, cheap_multiplier>
+                                                     cm_oneseq_rxs_m_xs_128_128;
+
+typedef unique_base<uint8_t,  uint8_t, rxs_m_xs_mixin>  unique_rxs_m_xs_8_8;
+typedef unique_base<uint16_t, uint16_t, rxs_m_xs_mixin> unique_rxs_m_xs_16_16;
+typedef unique_base<uint32_t, uint32_t, rxs_m_xs_mixin> unique_rxs_m_xs_32_32;
+typedef unique_base<uint64_t, uint64_t, rxs_m_xs_mixin> unique_rxs_m_xs_64_64;
+typedef unique_base<pcg128_t, pcg128_t, rxs_m_xs_mixin> unique_rxs_m_xs_128_128;
+typedef unique_base<pcg128_t, pcg128_t, rxs_m_xs_mixin, true, cheap_multiplier>
+                                                     cm_unique_rxs_m_xs_128_128;
+
+typedef setseq_base<uint8_t,  uint8_t, rxs_m_xs_mixin>  setseq_rxs_m_xs_8_8;
+typedef setseq_base<uint16_t, uint16_t, rxs_m_xs_mixin> setseq_rxs_m_xs_16_16;
+typedef setseq_base<uint32_t, uint32_t, rxs_m_xs_mixin> setseq_rxs_m_xs_32_32;
+typedef setseq_base<uint64_t, uint64_t, rxs_m_xs_mixin> setseq_rxs_m_xs_64_64;
+typedef setseq_base<pcg128_t, pcg128_t, rxs_m_xs_mixin> setseq_rxs_m_xs_128_128;
+typedef setseq_base<pcg128_t, pcg128_t, rxs_m_xs_mixin, true, cheap_multiplier>
+                                                     cm_setseq_rxs_m_xs_128_128;
+
+                // MCG versions don't make sense here, so aren't defined.
+
+/* Predefined types for RXS M */
+
+typedef oneseq_base<uint8_t,  uint16_t, rxs_m_mixin>  oneseq_rxs_m_16_8;
+typedef oneseq_base<uint16_t, uint32_t, rxs_m_mixin>  oneseq_rxs_m_32_16;
+typedef oneseq_base<uint32_t, uint64_t, rxs_m_mixin>  oneseq_rxs_m_64_32;
+typedef oneseq_base<uint64_t, pcg128_t, rxs_m_mixin>  oneseq_rxs_m_128_64;
+typedef oneseq_base<uint64_t, pcg128_t, rxs_m_mixin, true, cheap_multiplier>
+                                                      cm_oneseq_rxs_m_128_64;
+
+typedef unique_base<uint8_t,  uint16_t, rxs_m_mixin>  unique_rxs_m_16_8;
+typedef unique_base<uint16_t, uint32_t, rxs_m_mixin>  unique_rxs_m_32_16;
+typedef unique_base<uint32_t, uint64_t, rxs_m_mixin>  unique_rxs_m_64_32;
+typedef unique_base<uint64_t, pcg128_t, rxs_m_mixin>  unique_rxs_m_128_64;
+typedef unique_base<uint64_t, pcg128_t, rxs_m_mixin, true, cheap_multiplier>
+                                                      cm_unique_rxs_m_128_64;
+
+typedef setseq_base<uint8_t,  uint16_t, rxs_m_mixin>  setseq_rxs_m_16_8;
+typedef setseq_base<uint16_t, uint32_t, rxs_m_mixin>  setseq_rxs_m_32_16;
+typedef setseq_base<uint32_t, uint64_t, rxs_m_mixin>  setseq_rxs_m_64_32;
+typedef setseq_base<uint64_t, pcg128_t, rxs_m_mixin>  setseq_rxs_m_128_64;
+typedef setseq_base<uint64_t, pcg128_t, rxs_m_mixin, true, cheap_multiplier>
+                                                      cm_setseq_rxs_m_128_64;
+
+typedef mcg_base<uint8_t,  uint16_t, rxs_m_mixin>  mcg_rxs_m_16_8;
+typedef mcg_base<uint16_t, uint32_t, rxs_m_mixin>  mcg_rxs_m_32_16;
+typedef mcg_base<uint32_t, uint64_t, rxs_m_mixin>  mcg_rxs_m_64_32;
+typedef mcg_base<uint64_t, pcg128_t, rxs_m_mixin>  mcg_rxs_m_128_64;
+typedef mcg_base<uint64_t, pcg128_t, rxs_m_mixin, true, cheap_multiplier>
+                                                   cm_mcg_rxs_m_128_64;
+
+/* Predefined types for DXSM */
+
+typedef oneseq_base<uint8_t,  uint16_t, dxsm_mixin>  oneseq_dxsm_16_8;
+typedef oneseq_base<uint16_t, uint32_t, dxsm_mixin>  oneseq_dxsm_32_16;
+typedef oneseq_base<uint32_t, uint64_t, dxsm_mixin>  oneseq_dxsm_64_32;
+typedef oneseq_base<uint64_t, pcg128_t, dxsm_mixin>  oneseq_dxsm_128_64;
+typedef oneseq_base<uint64_t, pcg128_t, dxsm_mixin, true, cheap_multiplier>
+                                                     cm_oneseq_dxsm_128_64;
+
+typedef unique_base<uint8_t,  uint16_t, dxsm_mixin>  unique_dxsm_16_8;
+typedef unique_base<uint16_t, uint32_t, dxsm_mixin>  unique_dxsm_32_16;
+typedef unique_base<uint32_t, uint64_t, dxsm_mixin>  unique_dxsm_64_32;
+typedef unique_base<uint64_t, pcg128_t, dxsm_mixin>  unique_dxsm_128_64;
+typedef unique_base<uint64_t, pcg128_t, dxsm_mixin, true, cheap_multiplier>
+                                                     cm_unique_dxsm_128_64;
+
+typedef setseq_base<uint8_t,  uint16_t, dxsm_mixin>  setseq_dxsm_16_8;
+typedef setseq_base<uint16_t, uint32_t, dxsm_mixin>  setseq_dxsm_32_16;
+typedef setseq_base<uint32_t, uint64_t, dxsm_mixin>  setseq_dxsm_64_32;
+typedef setseq_base<uint64_t, pcg128_t, dxsm_mixin>  setseq_dxsm_128_64;
+typedef setseq_base<uint64_t, pcg128_t, dxsm_mixin, true, cheap_multiplier>
+                                                     cm_setseq_dxsm_128_64;
+
+typedef mcg_base<uint8_t,  uint16_t, dxsm_mixin>  mcg_dxsm_16_8;
+typedef mcg_base<uint16_t, uint32_t, dxsm_mixin>  mcg_dxsm_32_16;
+typedef mcg_base<uint32_t, uint64_t, dxsm_mixin>  mcg_dxsm_64_32;
+typedef mcg_base<uint64_t, pcg128_t, dxsm_mixin>  mcg_dxsm_128_64;
+typedef mcg_base<uint64_t, pcg128_t, dxsm_mixin, true, cheap_multiplier>
+                                                  cm_mcg_dxsm_128_64;
+
+/* Predefined types for XSL RR (only defined for "large" types) */
+
+typedef oneseq_base<uint32_t, uint64_t, xsl_rr_mixin>  oneseq_xsl_rr_64_32;
+typedef oneseq_base<uint64_t, pcg128_t, xsl_rr_mixin>  oneseq_xsl_rr_128_64;
+typedef oneseq_base<uint64_t, pcg128_t, xsl_rr_mixin, true, cheap_multiplier>
+                                                       cm_oneseq_xsl_rr_128_64;
+
+typedef unique_base<uint32_t, uint64_t, xsl_rr_mixin>  unique_xsl_rr_64_32;
+typedef unique_base<uint64_t, pcg128_t, xsl_rr_mixin>  unique_xsl_rr_128_64;
+typedef unique_base<uint64_t, pcg128_t, xsl_rr_mixin, true, cheap_multiplier>
+                                                       cm_unique_xsl_rr_128_64;
+
+typedef setseq_base<uint32_t, uint64_t, xsl_rr_mixin>  setseq_xsl_rr_64_32;
+typedef setseq_base<uint64_t, pcg128_t, xsl_rr_mixin>  setseq_xsl_rr_128_64;
+typedef setseq_base<uint64_t, pcg128_t, xsl_rr_mixin, true, cheap_multiplier>
+                                                       cm_setseq_xsl_rr_128_64;
+
+typedef mcg_base<uint32_t, uint64_t, xsl_rr_mixin>  mcg_xsl_rr_64_32;
+typedef mcg_base<uint64_t, pcg128_t, xsl_rr_mixin>  mcg_xsl_rr_128_64;
+typedef mcg_base<uint64_t, pcg128_t, xsl_rr_mixin, true, cheap_multiplier>
+                                                    cm_mcg_xsl_rr_128_64;
+
+
+/* Predefined types for XSL RR RR (only defined for "large" types) */
+
+typedef oneseq_base<uint64_t, uint64_t, xsl_rr_rr_mixin>
+    oneseq_xsl_rr_rr_64_64;
+typedef oneseq_base<pcg128_t, pcg128_t, xsl_rr_rr_mixin>
+    oneseq_xsl_rr_rr_128_128;
+typedef oneseq_base<pcg128_t, pcg128_t, xsl_rr_rr_mixin, true, cheap_multiplier>
+    cm_oneseq_xsl_rr_rr_128_128;
+
+typedef unique_base<uint64_t, uint64_t, xsl_rr_rr_mixin>
+    unique_xsl_rr_rr_64_64;
+typedef unique_base<pcg128_t, pcg128_t, xsl_rr_rr_mixin>
+    unique_xsl_rr_rr_128_128;
+typedef unique_base<pcg128_t, pcg128_t, xsl_rr_rr_mixin, true, cheap_multiplier>
+    cm_unique_xsl_rr_rr_128_128;
+
+typedef setseq_base<uint64_t, uint64_t, xsl_rr_rr_mixin>
+    setseq_xsl_rr_rr_64_64;
+typedef setseq_base<pcg128_t, pcg128_t, xsl_rr_rr_mixin>
+    setseq_xsl_rr_rr_128_128;
+typedef setseq_base<pcg128_t, pcg128_t, xsl_rr_rr_mixin, true, cheap_multiplier>
+    cm_setseq_xsl_rr_rr_128_128;
+
+                // MCG versions don't make sense here, so aren't defined.
+
+/* Extended generators */
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename BaseRNG, bool kdd = true>
+using ext_std8 = pcg_extended<table_pow2, advance_pow2, BaseRNG,
+                          oneseq_rxs_m_xs_8_8, kdd>;
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename BaseRNG, bool kdd = true>
+using ext_std16 = pcg_extended<table_pow2, advance_pow2, BaseRNG,
+                           oneseq_rxs_m_xs_16_16, kdd>;
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename BaseRNG, bool kdd = true>
+using ext_std32 = pcg_extended<table_pow2, advance_pow2, BaseRNG,
+                           oneseq_rxs_m_xs_32_32, kdd>;
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2,
+          typename BaseRNG, bool kdd = true>
+using ext_std64 = pcg_extended<table_pow2, advance_pow2, BaseRNG,
+                           oneseq_rxs_m_xs_64_64, kdd>;
+
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2, bool kdd = true>
+using ext_oneseq_rxs_m_xs_32_32 =
+          ext_std32<table_pow2, advance_pow2, oneseq_rxs_m_xs_32_32, kdd>;
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2, bool kdd = true>
+using ext_mcg_xsh_rs_64_32 =
+          ext_std32<table_pow2, advance_pow2, mcg_xsh_rs_64_32, kdd>;
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2, bool kdd = true>
+using ext_oneseq_xsh_rs_64_32 =
+          ext_std32<table_pow2, advance_pow2, oneseq_xsh_rs_64_32, kdd>;
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2, bool kdd = true>
+using ext_setseq_xsh_rr_64_32 =
+          ext_std32<table_pow2, advance_pow2, setseq_xsh_rr_64_32, kdd>;
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2, bool kdd = true>
+using ext_mcg_xsl_rr_128_64 =
+          ext_std64<table_pow2, advance_pow2, mcg_xsl_rr_128_64, kdd>;
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2, bool kdd = true>
+using ext_oneseq_xsl_rr_128_64 =
+          ext_std64<table_pow2, advance_pow2, oneseq_xsl_rr_128_64, kdd>;
+
+template <bitcount_t table_pow2, bitcount_t advance_pow2, bool kdd = true>
+using ext_setseq_xsl_rr_128_64 =
+          ext_std64<table_pow2, advance_pow2, setseq_xsl_rr_128_64, kdd>;
+
+} // namespace pcg_engines
+
+typedef pcg_engines::setseq_xsh_rr_64_32        pcg32;
+typedef pcg_engines::oneseq_xsh_rr_64_32        pcg32_oneseq;
+typedef pcg_engines::unique_xsh_rr_64_32        pcg32_unique;
+typedef pcg_engines::mcg_xsh_rs_64_32           pcg32_fast;
+
+typedef pcg_engines::setseq_xsl_rr_128_64       pcg64;
+typedef pcg_engines::oneseq_xsl_rr_128_64       pcg64_oneseq;
+typedef pcg_engines::unique_xsl_rr_128_64       pcg64_unique;
+typedef pcg_engines::mcg_xsl_rr_128_64          pcg64_fast;
+
+typedef pcg_engines::setseq_rxs_m_xs_8_8        pcg8_once_insecure;
+typedef pcg_engines::setseq_rxs_m_xs_16_16      pcg16_once_insecure;
+typedef pcg_engines::setseq_rxs_m_xs_32_32      pcg32_once_insecure;
+typedef pcg_engines::setseq_rxs_m_xs_64_64      pcg64_once_insecure;
+typedef pcg_engines::setseq_xsl_rr_rr_128_128   pcg128_once_insecure;
+
+typedef pcg_engines::oneseq_rxs_m_xs_8_8        pcg8_oneseq_once_insecure;
+typedef pcg_engines::oneseq_rxs_m_xs_16_16      pcg16_oneseq_once_insecure;
+typedef pcg_engines::oneseq_rxs_m_xs_32_32      pcg32_oneseq_once_insecure;
+typedef pcg_engines::oneseq_rxs_m_xs_64_64      pcg64_oneseq_once_insecure;
+typedef pcg_engines::oneseq_xsl_rr_rr_128_128   pcg128_oneseq_once_insecure;
+
+
+// These two extended RNGs provide two-dimensionally equidistributed
+// 32-bit generators.  pcg32_k2_fast occupies the same space as pcg64,
+// and can be called twice to generate 64 bits, but does not required
+// 128-bit math; on 32-bit systems, it's faster than pcg64 as well.
+
+typedef pcg_engines::ext_setseq_xsh_rr_64_32<1,16,true>     pcg32_k2;
+typedef pcg_engines::ext_oneseq_xsh_rs_64_32<1,32,true>     pcg32_k2_fast;
+
+// These eight extended RNGs have about as much state as arc4random
+//
+//  - the k variants are k-dimensionally equidistributed
+//  - the c variants offer better crypographic security
+//
+// (just how good the cryptographic security is is an open question)
+
+typedef pcg_engines::ext_setseq_xsh_rr_64_32<6,16,true>     pcg32_k64;
+typedef pcg_engines::ext_mcg_xsh_rs_64_32<6,32,true>        pcg32_k64_oneseq;
+typedef pcg_engines::ext_oneseq_xsh_rs_64_32<6,32,true>     pcg32_k64_fast;
+
+typedef pcg_engines::ext_setseq_xsh_rr_64_32<6,16,false>    pcg32_c64;
+typedef pcg_engines::ext_oneseq_xsh_rs_64_32<6,32,false>    pcg32_c64_oneseq;
+typedef pcg_engines::ext_mcg_xsh_rs_64_32<6,32,false>       pcg32_c64_fast;
+
+typedef pcg_engines::ext_setseq_xsl_rr_128_64<5,16,true>    pcg64_k32;
+typedef pcg_engines::ext_oneseq_xsl_rr_128_64<5,128,true>   pcg64_k32_oneseq;
+typedef pcg_engines::ext_mcg_xsl_rr_128_64<5,128,true>      pcg64_k32_fast;
+
+typedef pcg_engines::ext_setseq_xsl_rr_128_64<5,16,false>   pcg64_c32;
+typedef pcg_engines::ext_oneseq_xsl_rr_128_64<5,128,false>  pcg64_c32_oneseq;
+typedef pcg_engines::ext_mcg_xsl_rr_128_64<5,128,false>     pcg64_c32_fast;
+
+// These eight extended RNGs have more state than the Mersenne twister
+//
+//  - the k variants are k-dimensionally equidistributed
+//  - the c variants offer better crypographic security
+//
+// (just how good the cryptographic security is is an open question)
+
+typedef pcg_engines::ext_setseq_xsh_rr_64_32<10,16,true>    pcg32_k1024;
+typedef pcg_engines::ext_oneseq_xsh_rs_64_32<10,32,true>    pcg32_k1024_fast;
+
+typedef pcg_engines::ext_setseq_xsh_rr_64_32<10,16,false>   pcg32_c1024;
+typedef pcg_engines::ext_oneseq_xsh_rs_64_32<10,32,false>   pcg32_c1024_fast;
+
+typedef pcg_engines::ext_setseq_xsl_rr_128_64<10,16,true>   pcg64_k1024;
+typedef pcg_engines::ext_oneseq_xsl_rr_128_64<10,128,true>  pcg64_k1024_fast;
+
+typedef pcg_engines::ext_setseq_xsl_rr_128_64<10,16,false>  pcg64_c1024;
+typedef pcg_engines::ext_oneseq_xsl_rr_128_64<10,128,false> pcg64_c1024_fast;
+
+// These generators have an insanely huge period (2^524352), and is suitable
+// for silly party tricks, such as dumping out 64 KB ZIP files at an arbitrary
+// point in the future.   [Actually, over the full period of the generator, it
+// will produce every 64 KB ZIP file 2^64 times!]
+
+typedef pcg_engines::ext_setseq_xsh_rr_64_32<14,16,true>    pcg32_k16384;
+typedef pcg_engines::ext_oneseq_xsh_rs_64_32<14,32,true>    pcg32_k16384_fast;
+
+#ifdef _MSC_VER
+    #pragma warning(default:4146)
+#endif
+
+#endif // PCG_RAND_HPP_INCLUDED
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/pcg_uint128.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/pcg_uint128.hpp
new file mode 100644
index 0000000000..c085d0ee23
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pcg/pcg_uint128.hpp
@@ -0,0 +1,884 @@
+/*
+ * PCG Random Number Generation for C++
+ *
+ * Copyright 2014-2017 Melissa O'Neill <oneill@pcg-random.org>,
+ *                     and the PCG Project contributors.
+ *
+ * SPDX-License-Identifier: (Apache-2.0 OR MIT)
+ *
+ * Licensed under the Apache License, Version 2.0 (provided in
+ * LICENSE-APACHE.txt and at http://www.apache.org/licenses/LICENSE-2.0)
+ * or under the MIT license (provided in LICENSE-MIT.txt and at
+ * http://opensource.org/licenses/MIT), at your option. This file may not
+ * be copied, modified, or distributed except according to those terms.
+ *
+ * Distributed on an "AS IS" BASIS, WITHOUT WARRANTY OF ANY KIND, either
+ * express or implied.  See your chosen license for details.
+ *
+ * For additional information about the PCG random number generation scheme,
+ * visit http://www.pcg-random.org/.
+ */
+
+/*
+ * This code provides a a C++ class that can provide 128-bit (or higher)
+ * integers.  To produce 2K-bit integers, it uses two K-bit integers,
+ * placed in a union that allowes the code to also see them as four K/2 bit
+ * integers (and access them either directly name, or by index).
+ *
+ * It may seem like we're reinventing the wheel here, because several
+ * libraries already exist that support large integers, but most existing
+ * libraries provide a very generic multiprecision code, but here we're
+ * operating at a fixed size.  Also, most other libraries are fairly
+ * heavyweight.  So we use a direct implementation.  Sadly, it's much slower
+ * than hand-coded assembly or direct CPU support.
+ */
+
+#ifndef PCG_UINT128_HPP_INCLUDED
+#define PCG_UINT128_HPP_INCLUDED 1
+
+#include <cstdint>
+#include <cstdio>
+#include <cassert>
+#include <climits>
+#include <utility>
+#include <initializer_list>
+#include <type_traits>
+
+#if defined(_MSC_VER)  // Use MSVC++ intrinsics
+#include <intrin.h>
+#endif
+
+/*
+ * We want to lay the type out the same way that a native type would be laid
+ * out, which means we must know the machine's endian, at compile time.
+ * This ugliness attempts to do so.
+ */
+
+#ifndef PCG_LITTLE_ENDIAN
+    #if defined(__BYTE_ORDER__)
+        #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
+            #define PCG_LITTLE_ENDIAN 1
+        #elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
+            #define PCG_LITTLE_ENDIAN 0
+        #else
+            #error __BYTE_ORDER__ does not match a standard endian, pick a side
+        #endif
+    #elif __LITTLE_ENDIAN__ || _LITTLE_ENDIAN
+        #define PCG_LITTLE_ENDIAN 1
+    #elif __BIG_ENDIAN__ || _BIG_ENDIAN
+        #define PCG_LITTLE_ENDIAN 0
+    #elif __x86_64 || __x86_64__ || _M_X64 || __i386 || __i386__ || _M_IX86
+        #define PCG_LITTLE_ENDIAN 1
+    #elif __powerpc__ || __POWERPC__ || __ppc__ || __PPC__ \
+          || __m68k__ || __mc68000__
+        #define PCG_LITTLE_ENDIAN 0
+    #else
+        #error Unable to determine target endianness
+    #endif
+#endif
+
+namespace pcg_extras {
+
+// Recent versions of GCC have intrinsics we can use to quickly calculate
+// the number of leading and trailing zeros in a number.  If possible, we
+// use them, otherwise we fall back to old-fashioned bit twiddling to figure
+// them out.
+
+#ifndef PCG_BITCOUNT_T
+    typedef uint8_t bitcount_t;
+#else
+    typedef PCG_BITCOUNT_T bitcount_t;
+#endif
+
+/*
+ * Provide some useful helper functions
+ *      * flog2                 floor(log2(x))
+ *      * trailingzeros         number of trailing zero bits
+ */
+
+#if defined(__GNUC__)   // Any GNU-compatible compiler supporting C++11 has
+                        // some useful intrinsics we can use.
+
+inline bitcount_t flog2(uint32_t v)
+{
+    return 31 - __builtin_clz(v);
+}
+
+inline bitcount_t trailingzeros(uint32_t v)
+{
+    return __builtin_ctz(v);
+}
+
+inline bitcount_t flog2(uint64_t v)
+{
+#if UINT64_MAX == ULONG_MAX
+    return 63 - __builtin_clzl(v);
+#elif UINT64_MAX == ULLONG_MAX
+    return 63 - __builtin_clzll(v);
+#else
+    #error Cannot find a function for uint64_t
+#endif
+}
+
+inline bitcount_t trailingzeros(uint64_t v)
+{
+#if UINT64_MAX == ULONG_MAX
+    return __builtin_ctzl(v);
+#elif UINT64_MAX == ULLONG_MAX
+    return __builtin_ctzll(v);
+#else
+    #error Cannot find a function for uint64_t
+#endif
+}
+
+#elif defined(_MSC_VER)  // Use MSVC++ intrinsics
+
+#pragma intrinsic(_BitScanReverse, _BitScanForward)
+#if defined(_M_X64) || defined(_M_ARM) || defined(_M_ARM64)
+#pragma intrinsic(_BitScanReverse64, _BitScanForward64)
+#endif
+
+inline bitcount_t flog2(uint32_t v)
+{
+    unsigned long i;
+    _BitScanReverse(&i, v);
+    return bitcount_t(i);
+}
+
+inline bitcount_t trailingzeros(uint32_t v)
+{
+    unsigned long i;
+    _BitScanForward(&i, v);
+    return bitcount_t(i);
+}
+
+inline bitcount_t flog2(uint64_t v)
+{
+#if defined(_M_X64) || defined(_M_ARM) || defined(_M_ARM64)
+    unsigned long i;
+    _BitScanReverse64(&i, v);
+    return bitcount_t(i);
+#else
+    // 32-bit x86
+    uint32_t high = v >> 32;
+    uint32_t low  = uint32_t(v);
+    return high ? 32+flog2(high) : flog2(low);
+#endif
+}
+
+inline bitcount_t trailingzeros(uint64_t v)
+{
+#if defined(_M_X64) || defined(_M_ARM) || defined(_M_ARM64)
+    unsigned long i;
+    _BitScanForward64(&i, v);
+    return bitcount_t(i);
+#else
+    // 32-bit x86
+    uint32_t high = v >> 32;
+    uint32_t low  = uint32_t(v);
+    return low ? trailingzeros(low) : trailingzeros(high)+32;
+#endif
+}
+
+#else                   // Otherwise, we fall back to bit twiddling
+                        // implementations
+
+inline bitcount_t flog2(uint32_t v)
+{
+    // Based on code by Eric Cole and Mark Dickinson, which appears at
+    // https://graphics.stanford.edu/~seander/bithacks.html#IntegerLogDeBruijn
+
+    static const uint8_t multiplyDeBruijnBitPos[32] = {
+      0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30,
+      8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31
+    };
+
+    v |= v >> 1; // first round down to one less than a power of 2
+    v |= v >> 2;
+    v |= v >> 4;
+    v |= v >> 8;
+    v |= v >> 16;
+
+    return multiplyDeBruijnBitPos[(uint32_t)(v * 0x07C4ACDDU) >> 27];
+}
+
+inline bitcount_t trailingzeros(uint32_t v)
+{
+    static const uint8_t multiplyDeBruijnBitPos[32] = {
+      0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
+      31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
+    };
+
+    return multiplyDeBruijnBitPos[((uint32_t)((v & -v) * 0x077CB531U)) >> 27];
+}
+
+inline bitcount_t flog2(uint64_t v)
+{
+    uint32_t high = v >> 32;
+    uint32_t low  = uint32_t(v);
+
+    return high ? 32+flog2(high) : flog2(low);
+}
+
+inline bitcount_t trailingzeros(uint64_t v)
+{
+    uint32_t high = v >> 32;
+    uint32_t low  = uint32_t(v);
+
+    return low ? trailingzeros(low) : trailingzeros(high)+32;
+}
+
+#endif
+
+inline bitcount_t flog2(uint8_t v)
+{
+    return flog2(uint32_t(v));
+}
+
+inline bitcount_t flog2(uint16_t v)
+{
+    return flog2(uint32_t(v));
+}
+
+#if __SIZEOF_INT128__
+inline bitcount_t flog2(__uint128_t v)
+{
+    uint64_t high = uint64_t(v >> 64);
+    uint64_t low  = uint64_t(v);
+
+    return high ? 64+flog2(high) : flog2(low);
+}
+#endif
+
+inline bitcount_t trailingzeros(uint8_t v)
+{
+    return trailingzeros(uint32_t(v));
+}
+
+inline bitcount_t trailingzeros(uint16_t v)
+{
+    return trailingzeros(uint32_t(v));
+}
+
+#if __SIZEOF_INT128__
+inline bitcount_t trailingzeros(__uint128_t v)
+{
+    uint64_t high = uint64_t(v >> 64);
+    uint64_t low  = uint64_t(v);
+    return low ? trailingzeros(low) : trailingzeros(high)+64;
+}
+#endif
+
+template <typename UInt>
+inline bitcount_t clog2(UInt v)
+{
+    return flog2(v) + ((v & (-v)) != v);
+}
+
+template <typename UInt>
+inline UInt addwithcarry(UInt x, UInt y, bool carryin, bool* carryout)
+{
+    UInt half_result = y + carryin;
+    UInt result = x + half_result;
+    *carryout = (half_result < y) || (result < x);
+    return result;
+}
+
+template <typename UInt>
+inline UInt subwithcarry(UInt x, UInt y, bool carryin, bool* carryout)
+{
+    UInt half_result = y + carryin;
+    UInt result = x - half_result;
+    *carryout = (half_result < y) || (result > x);
+    return result;
+}
+
+
+template <typename UInt, typename UIntX2>
+class uint_x4 {
+// private:
+    static constexpr unsigned int UINT_BITS = sizeof(UInt) * CHAR_BIT;
+public:
+    union {
+#if PCG_LITTLE_ENDIAN
+        struct {
+            UInt v0, v1, v2, v3;
+        } w;
+        struct {
+            UIntX2 v01, v23;
+        } d;
+#else
+        struct {
+            UInt v3, v2, v1, v0;
+        } w;
+        struct {
+            UIntX2 v23, v01;
+        } d;
+#endif
+        // For the array access versions, the code that uses the array
+        // must handle endian itself.  Yuck.
+        UInt wa[4];
+        UIntX2 da[2];
+    };
+
+public:
+    uint_x4() = default;
+
+    constexpr uint_x4(UInt v3, UInt v2, UInt v1, UInt v0)
+#if PCG_LITTLE_ENDIAN
+       : w{v0, v1, v2, v3}
+#else
+       : w{v3, v2, v1, v0}
+#endif
+    {
+        // Nothing (else) to do
+    }
+
+    constexpr uint_x4(UIntX2 v23, UIntX2 v01)
+#if PCG_LITTLE_ENDIAN
+       : d{v01,v23}
+#else
+       : d{v23,v01}
+#endif
+    {
+        // Nothing (else) to do
+    }
+
+    constexpr uint_x4(UIntX2 v01)
+#if PCG_LITTLE_ENDIAN
+       : d{v01, UIntX2(0)}
+#else
+       : d{UIntX2(0),v01}
+#endif
+    {
+        // Nothing (else) to do
+    }
+
+    template<class Integral,
+             typename std::enable_if<(std::is_integral<Integral>::value
+                                      && sizeof(Integral) <= sizeof(UIntX2))
+                                    >::type* = nullptr>
+    constexpr uint_x4(Integral v01)
+#if PCG_LITTLE_ENDIAN
+       : d{UIntX2(v01), UIntX2(0)}
+#else
+       : d{UIntX2(0), UIntX2(v01)}
+#endif
+    {
+        // Nothing (else) to do
+    }
+
+    explicit constexpr operator UIntX2() const
+    {
+        return d.v01;
+    }
+
+    template<class Integral,
+             typename std::enable_if<(std::is_integral<Integral>::value
+                                      && sizeof(Integral) <= sizeof(UIntX2))
+                                    >::type* = nullptr>
+    explicit constexpr operator Integral() const
+    {
+        return Integral(d.v01);
+    }
+
+    explicit constexpr operator bool() const
+    {
+        return d.v01 || d.v23;
+    }
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator*(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator*(const uint_x4<U,V>&, V);
+
+    template<typename U, typename V>
+    friend std::pair< uint_x4<U,V>,uint_x4<U,V> >
+        divmod(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator+(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator-(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator<<(const uint_x4<U,V>&, const bitcount_t shift);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator>>(const uint_x4<U,V>&, const bitcount_t shift);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator&(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator|(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator^(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend bool operator==(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend bool operator!=(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend bool operator<(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend bool operator<=(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend bool operator>(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend bool operator>=(const uint_x4<U,V>&, const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator~(const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend uint_x4<U,V> operator-(const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend bitcount_t flog2(const uint_x4<U,V>&);
+
+    template<typename U, typename V>
+    friend bitcount_t trailingzeros(const uint_x4<U,V>&);
+
+    uint_x4& operator*=(const uint_x4& rhs)
+    {
+        uint_x4 result = *this * rhs;
+        return *this = result;
+    }
+
+    uint_x4& operator*=(UIntX2 rhs)
+    {
+        uint_x4 result = *this * rhs;
+        return *this = result;
+    }
+
+    uint_x4& operator/=(const uint_x4& rhs)
+    {
+        uint_x4 result = *this / rhs;
+        return *this = result;
+    }
+
+    uint_x4& operator%=(const uint_x4& rhs)
+    {
+        uint_x4 result = *this % rhs;
+        return *this = result;
+    }
+
+    uint_x4& operator+=(const uint_x4& rhs)
+    {
+        uint_x4 result = *this + rhs;
+        return *this = result;
+    }
+
+    uint_x4& operator-=(const uint_x4& rhs)
+    {
+        uint_x4 result = *this - rhs;
+        return *this = result;
+    }
+
+    uint_x4& operator&=(const uint_x4& rhs)
+    {
+        uint_x4 result = *this & rhs;
+        return *this = result;
+    }
+
+    uint_x4& operator|=(const uint_x4& rhs)
+    {
+        uint_x4 result = *this | rhs;
+        return *this = result;
+    }
+
+    uint_x4& operator^=(const uint_x4& rhs)
+    {
+        uint_x4 result = *this ^ rhs;
+        return *this = result;
+    }
+
+    uint_x4& operator>>=(bitcount_t shift)
+    {
+        uint_x4 result = *this >> shift;
+        return *this = result;
+    }
+
+    uint_x4& operator<<=(bitcount_t shift)
+    {
+        uint_x4 result = *this << shift;
+        return *this = result;
+    }
+
+};
+
+template<typename U, typename V>
+bitcount_t flog2(const uint_x4<U,V>& v)
+{
+#if PCG_LITTLE_ENDIAN
+    for (uint8_t i = 4; i !=0; /* dec in loop */) {
+        --i;
+#else
+    for (uint8_t i = 0; i < 4; ++i) {
+#endif
+        if (v.wa[i] == 0)
+             continue;
+        return flog2(v.wa[i]) + uint_x4<U,V>::UINT_BITS*i;
+    }
+    abort();
+}
+
+template<typename U, typename V>
+bitcount_t trailingzeros(const uint_x4<U,V>& v)
+{
+#if PCG_LITTLE_ENDIAN
+    for (uint8_t i = 0; i < 4; ++i) {
+#else
+    for (uint8_t i = 4; i !=0; /* dec in loop */) {
+        --i;
+#endif
+        if (v.wa[i] != 0)
+            return trailingzeros(v.wa[i]) + uint_x4<U,V>::UINT_BITS*i;
+    }
+    return uint_x4<U,V>::UINT_BITS*4;
+}
+
+template <typename UInt, typename UIntX2>
+std::pair< uint_x4<UInt,UIntX2>, uint_x4<UInt,UIntX2> >
+    divmod(const uint_x4<UInt,UIntX2>& orig_dividend,
+           const uint_x4<UInt,UIntX2>& divisor)
+{
+    // If the dividend is less than the divisor, the answer is always zero.
+    // This takes care of boundary cases like 0/x (which would otherwise be
+    // problematic because we can't take the log of zero.  (The boundary case
+    // of division by zero is undefined.)
+    if (orig_dividend < divisor)
+        return { uint_x4<UInt,UIntX2>(UIntX2(0)), orig_dividend };
+
+    auto dividend = orig_dividend;
+
+    auto log2_divisor  = flog2(divisor);
+    auto log2_dividend = flog2(dividend);
+    // assert(log2_dividend >= log2_divisor);
+    bitcount_t logdiff = log2_dividend - log2_divisor;
+
+    constexpr uint_x4<UInt,UIntX2> ONE(UIntX2(1));
+    if (logdiff == 0)
+        return { ONE, dividend - divisor };
+
+    // Now we change the log difference to
+    //  floor(log2(divisor)) - ceil(log2(dividend))
+    // to ensure that we *underestimate* the result.
+    logdiff -= 1;
+
+    uint_x4<UInt,UIntX2> quotient(UIntX2(0));
+
+    auto qfactor = ONE << logdiff;
+    auto factor  = divisor << logdiff;
+
+    do {
+        dividend -= factor;
+        quotient += qfactor;
+        while (dividend < factor) {
+            factor  >>= 1;
+            qfactor >>= 1;
+        }
+    } while (dividend >= divisor);
+
+    return { quotient, dividend };
+}
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator/(const uint_x4<UInt,UIntX2>& dividend,
+                               const uint_x4<UInt,UIntX2>& divisor)
+{
+    return divmod(dividend, divisor).first;
+}
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator%(const uint_x4<UInt,UIntX2>& dividend,
+                               const uint_x4<UInt,UIntX2>& divisor)
+{
+    return divmod(dividend, divisor).second;
+}
+
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator*(const uint_x4<UInt,UIntX2>& a,
+                               const uint_x4<UInt,UIntX2>& b)
+{
+    constexpr auto UINT_BITS = uint_x4<UInt,UIntX2>::UINT_BITS;
+    uint_x4<UInt,UIntX2> r = {0U, 0U, 0U, 0U};
+    bool carryin = false;
+    bool carryout;
+    UIntX2 a0b0 = UIntX2(a.w.v0) * UIntX2(b.w.v0);
+    r.w.v0 = UInt(a0b0);
+    r.w.v1 = UInt(a0b0 >> UINT_BITS);
+
+    UIntX2 a1b0 = UIntX2(a.w.v1) * UIntX2(b.w.v0);
+    r.w.v2 = UInt(a1b0 >> UINT_BITS);
+    r.w.v1 = addwithcarry(r.w.v1, UInt(a1b0), carryin, &carryout);
+    carryin = carryout;
+    r.w.v2 = addwithcarry(r.w.v2, UInt(0U), carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = addwithcarry(r.w.v3, UInt(0U), carryin, &carryout);
+
+    UIntX2 a0b1 = UIntX2(a.w.v0) * UIntX2(b.w.v1);
+    carryin = false;
+    r.w.v2 = addwithcarry(r.w.v2, UInt(a0b1 >> UINT_BITS), carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = addwithcarry(r.w.v3, UInt(0U), carryin, &carryout);
+
+    carryin = false;
+    r.w.v1 = addwithcarry(r.w.v1, UInt(a0b1), carryin, &carryout);
+    carryin = carryout;
+    r.w.v2 = addwithcarry(r.w.v2, UInt(0U), carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = addwithcarry(r.w.v3, UInt(0U), carryin, &carryout);
+
+    UIntX2 a1b1 = UIntX2(a.w.v1) * UIntX2(b.w.v1);
+    carryin = false;
+    r.w.v2 = addwithcarry(r.w.v2, UInt(a1b1), carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = addwithcarry(r.w.v3, UInt(a1b1 >> UINT_BITS), carryin, &carryout);
+
+    r.d.v23 += a.d.v01 * b.d.v23 + a.d.v23 * b.d.v01;
+
+    return r;
+}
+
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator*(const uint_x4<UInt,UIntX2>& a,
+                               UIntX2 b01)
+{
+    constexpr auto UINT_BITS = uint_x4<UInt,UIntX2>::UINT_BITS;
+    uint_x4<UInt,UIntX2> r = {0U, 0U, 0U, 0U};
+    bool carryin = false;
+    bool carryout;
+    UIntX2 a0b0 = UIntX2(a.w.v0) * UIntX2(UInt(b01));
+    r.w.v0 = UInt(a0b0);
+    r.w.v1 = UInt(a0b0 >> UINT_BITS);
+
+    UIntX2 a1b0 = UIntX2(a.w.v1) * UIntX2(UInt(b01));
+    r.w.v2 = UInt(a1b0 >> UINT_BITS);
+    r.w.v1 = addwithcarry(r.w.v1, UInt(a1b0), carryin, &carryout);
+    carryin = carryout;
+    r.w.v2 = addwithcarry(r.w.v2, UInt(0U), carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = addwithcarry(r.w.v3, UInt(0U), carryin, &carryout);
+
+    UIntX2 a0b1 = UIntX2(a.w.v0) * UIntX2(b01 >> UINT_BITS);
+    carryin = false;
+    r.w.v2 = addwithcarry(r.w.v2, UInt(a0b1 >> UINT_BITS), carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = addwithcarry(r.w.v3, UInt(0U), carryin, &carryout);
+
+    carryin = false;
+    r.w.v1 = addwithcarry(r.w.v1, UInt(a0b1), carryin, &carryout);
+    carryin = carryout;
+    r.w.v2 = addwithcarry(r.w.v2, UInt(0U), carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = addwithcarry(r.w.v3, UInt(0U), carryin, &carryout);
+
+    UIntX2 a1b1 = UIntX2(a.w.v1) * UIntX2(b01 >> UINT_BITS);
+    carryin = false;
+    r.w.v2 = addwithcarry(r.w.v2, UInt(a1b1), carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = addwithcarry(r.w.v3, UInt(a1b1 >> UINT_BITS), carryin, &carryout);
+
+    r.d.v23 += a.d.v23 * b01;
+
+    return r;
+}
+
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator+(const uint_x4<UInt,UIntX2>& a,
+                               const uint_x4<UInt,UIntX2>& b)
+{
+    uint_x4<UInt,UIntX2> r = {0U, 0U, 0U, 0U};
+
+    bool carryin = false;
+    bool carryout;
+    r.w.v0 = addwithcarry(a.w.v0, b.w.v0, carryin, &carryout);
+    carryin = carryout;
+    r.w.v1 = addwithcarry(a.w.v1, b.w.v1, carryin, &carryout);
+    carryin = carryout;
+    r.w.v2 = addwithcarry(a.w.v2, b.w.v2, carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = addwithcarry(a.w.v3, b.w.v3, carryin, &carryout);
+
+    return r;
+}
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator-(const uint_x4<UInt,UIntX2>& a,
+                               const uint_x4<UInt,UIntX2>& b)
+{
+    uint_x4<UInt,UIntX2> r = {0U, 0U, 0U, 0U};
+
+    bool carryin = false;
+    bool carryout;
+    r.w.v0 = subwithcarry(a.w.v0, b.w.v0, carryin, &carryout);
+    carryin = carryout;
+    r.w.v1 = subwithcarry(a.w.v1, b.w.v1, carryin, &carryout);
+    carryin = carryout;
+    r.w.v2 = subwithcarry(a.w.v2, b.w.v2, carryin, &carryout);
+    carryin = carryout;
+    r.w.v3 = subwithcarry(a.w.v3, b.w.v3, carryin, &carryout);
+
+    return r;
+}
+
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator&(const uint_x4<UInt,UIntX2>& a,
+                               const uint_x4<UInt,UIntX2>& b)
+{
+    return uint_x4<UInt,UIntX2>(a.d.v23 & b.d.v23, a.d.v01 & b.d.v01);
+}
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator|(const uint_x4<UInt,UIntX2>& a,
+                               const uint_x4<UInt,UIntX2>& b)
+{
+    return uint_x4<UInt,UIntX2>(a.d.v23 | b.d.v23, a.d.v01 | b.d.v01);
+}
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator^(const uint_x4<UInt,UIntX2>& a,
+                               const uint_x4<UInt,UIntX2>& b)
+{
+    return uint_x4<UInt,UIntX2>(a.d.v23 ^ b.d.v23, a.d.v01 ^ b.d.v01);
+}
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator~(const uint_x4<UInt,UIntX2>& v)
+{
+    return uint_x4<UInt,UIntX2>(~v.d.v23, ~v.d.v01);
+}
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator-(const uint_x4<UInt,UIntX2>& v)
+{
+    return uint_x4<UInt,UIntX2>(0UL,0UL) - v;
+}
+
+template <typename UInt, typename UIntX2>
+bool operator==(const uint_x4<UInt,UIntX2>& a, const uint_x4<UInt,UIntX2>& b)
+{
+    return (a.d.v01 == b.d.v01) && (a.d.v23 == b.d.v23);
+}
+
+template <typename UInt, typename UIntX2>
+bool operator!=(const uint_x4<UInt,UIntX2>& a, const uint_x4<UInt,UIntX2>& b)
+{
+    return !operator==(a,b);
+}
+
+
+template <typename UInt, typename UIntX2>
+bool operator<(const uint_x4<UInt,UIntX2>& a, const uint_x4<UInt,UIntX2>& b)
+{
+    return (a.d.v23 < b.d.v23)
+           || ((a.d.v23 == b.d.v23) && (a.d.v01 < b.d.v01));
+}
+
+template <typename UInt, typename UIntX2>
+bool operator>(const uint_x4<UInt,UIntX2>& a, const uint_x4<UInt,UIntX2>& b)
+{
+    return operator<(b,a);
+}
+
+template <typename UInt, typename UIntX2>
+bool operator<=(const uint_x4<UInt,UIntX2>& a, const uint_x4<UInt,UIntX2>& b)
+{
+    return !(operator<(b,a));
+}
+
+template <typename UInt, typename UIntX2>
+bool operator>=(const uint_x4<UInt,UIntX2>& a, const uint_x4<UInt,UIntX2>& b)
+{
+    return !(operator<(a,b));
+}
+
+
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator<<(const uint_x4<UInt,UIntX2>& v,
+                                const bitcount_t shift)
+{
+    uint_x4<UInt,UIntX2> r = {0U, 0U, 0U, 0U};
+    const bitcount_t bits    = uint_x4<UInt,UIntX2>::UINT_BITS;
+    const bitcount_t bitmask = bits - 1;
+    const bitcount_t shiftdiv = shift / bits;
+    const bitcount_t shiftmod = shift & bitmask;
+
+    if (shiftmod) {
+        UInt carryover = 0;
+#if PCG_LITTLE_ENDIAN
+        for (uint8_t out = shiftdiv, in = 0; out < 4; ++out, ++in) {
+#else
+        for (uint8_t out = 4-shiftdiv, in = 4; out != 0; /* dec in loop */) {
+            --out, --in;
+#endif
+            r.wa[out] = (v.wa[in] << shiftmod) | carryover;
+            carryover = (v.wa[in] >> (bits - shiftmod));
+        }
+    } else {
+#if PCG_LITTLE_ENDIAN
+        for (uint8_t out = shiftdiv, in = 0; out < 4; ++out, ++in) {
+#else
+        for (uint8_t out = 4-shiftdiv, in = 4; out != 0; /* dec in loop */) {
+            --out, --in;
+#endif
+            r.wa[out] = v.wa[in];
+        }
+    }
+
+    return r;
+}
+
+template <typename UInt, typename UIntX2>
+uint_x4<UInt,UIntX2> operator>>(const uint_x4<UInt,UIntX2>& v,
+                                const bitcount_t shift)
+{
+    uint_x4<UInt,UIntX2> r = {0U, 0U, 0U, 0U};
+    const bitcount_t bits    = uint_x4<UInt,UIntX2>::UINT_BITS;
+    const bitcount_t bitmask = bits - 1;
+    const bitcount_t shiftdiv = shift / bits;
+    const bitcount_t shiftmod = shift & bitmask;
+
+    if (shiftmod) {
+        UInt carryover = 0;
+#if PCG_LITTLE_ENDIAN
+        for (uint8_t out = 4-shiftdiv, in = 4; out != 0; /* dec in loop */) {
+            --out, --in;
+#else
+        for (uint8_t out = shiftdiv, in = 0; out < 4; ++out, ++in) {
+#endif
+            r.wa[out] = (v.wa[in] >> shiftmod) | carryover;
+            carryover = (v.wa[in] << (bits - shiftmod));
+        }
+    } else {
+#if PCG_LITTLE_ENDIAN
+        for (uint8_t out = 4-shiftdiv, in = 4; out != 0; /* dec in loop */) {
+            --out, --in;
+#else
+        for (uint8_t out = shiftdiv, in = 0; out < 4; ++out, ++in) {
+#endif
+            r.wa[out] = v.wa[in];
+        }
+    }
+
+    return r;
+}
+
+} // namespace pcg_extras
+
+#endif // PCG_UINT128_HPP_INCLUDED
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/CMakeLists.txt
new file mode 100644
index 0000000000..9525354079
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/CMakeLists.txt
@@ -0,0 +1,320 @@
+# CMakeLists.txt -- Build system for the pybind11 modules
+#
+# Copyright (c) 2015 Wenzel Jakob <wenzel@inf.ethz.ch>
+#
+# All rights reserved. Use of this source code is governed by a
+# BSD-style license that can be found in the LICENSE file.
+
+cmake_minimum_required(VERSION 3.15)
+
+# The `cmake_minimum_required(VERSION 3.4...3.22)` syntax does not work with
+# some versions of VS that have a patched CMake 3.11. This forces us to emulate
+# the behavior using the following workaround:
+if(${CMAKE_VERSION} VERSION_LESS 3.22)
+  cmake_policy(VERSION ${CMAKE_MAJOR_VERSION}.${CMAKE_MINOR_VERSION})
+else()
+  cmake_policy(VERSION 3.22)
+endif()
+
+# Avoid infinite recursion if tests include this as a subdirectory
+if(DEFINED PYBIND11_MASTER_PROJECT)
+  return()
+endif()
+
+# Extract project version from source
+file(STRINGS "${CMAKE_CURRENT_SOURCE_DIR}/include/pybind11/detail/common.h"
+     pybind11_version_defines REGEX "#define PYBIND11_VERSION_(MAJOR|MINOR|PATCH) ")
+
+foreach(ver ${pybind11_version_defines})
+  if(ver MATCHES [[#define PYBIND11_VERSION_(MAJOR|MINOR|PATCH) +([^ ]+)$]])
+    set(PYBIND11_VERSION_${CMAKE_MATCH_1} "${CMAKE_MATCH_2}")
+  endif()
+endforeach()
+
+if(PYBIND11_VERSION_PATCH MATCHES [[\.([a-zA-Z0-9]+)$]])
+  set(pybind11_VERSION_TYPE "${CMAKE_MATCH_1}")
+endif()
+string(REGEX MATCH "^[0-9]+" PYBIND11_VERSION_PATCH "${PYBIND11_VERSION_PATCH}")
+
+project(
+  pybind11
+  LANGUAGES CXX
+  VERSION "${PYBIND11_VERSION_MAJOR}.${PYBIND11_VERSION_MINOR}.${PYBIND11_VERSION_PATCH}")
+
+# Standard includes
+include(GNUInstallDirs)
+include(CMakePackageConfigHelpers)
+include(CMakeDependentOption)
+
+if(NOT pybind11_FIND_QUIETLY)
+  message(STATUS "pybind11 v${pybind11_VERSION} ${pybind11_VERSION_TYPE}")
+endif()
+
+# Check if pybind11 is being used directly or via add_subdirectory
+if(CMAKE_SOURCE_DIR STREQUAL PROJECT_SOURCE_DIR)
+  ### Warn if not an out-of-source builds
+  if(CMAKE_CURRENT_SOURCE_DIR STREQUAL CMAKE_CURRENT_BINARY_DIR)
+    set(lines
+        "You are building in-place. If that is not what you intended to "
+        "do, you can clean the source directory with:\n"
+        "rm -r CMakeCache.txt CMakeFiles/ cmake_uninstall.cmake pybind11Config.cmake "
+        "pybind11ConfigVersion.cmake tests/CMakeFiles/\n")
+    message(AUTHOR_WARNING ${lines})
+  endif()
+
+  set(PYBIND11_MASTER_PROJECT ON)
+
+  if(OSX AND CMAKE_VERSION VERSION_LESS 3.7)
+    # Bug in macOS CMake < 3.7 is unable to download catch
+    message(WARNING "CMAKE 3.7+ needed on macOS to download catch, and newer HIGHLY recommended")
+  elseif(WINDOWS AND CMAKE_VERSION VERSION_LESS 3.8)
+    # Only tested with 3.8+ in CI.
+    message(WARNING "CMAKE 3.8+ tested on Windows, previous versions untested")
+  endif()
+
+  message(STATUS "CMake ${CMAKE_VERSION}")
+
+  if(CMAKE_CXX_STANDARD)
+    set(CMAKE_CXX_EXTENSIONS OFF)
+    set(CMAKE_CXX_STANDARD_REQUIRED ON)
+  endif()
+
+  set(pybind11_system "")
+
+  set_property(GLOBAL PROPERTY USE_FOLDERS ON)
+else()
+  set(PYBIND11_MASTER_PROJECT OFF)
+  set(pybind11_system SYSTEM)
+endif()
+
+# Options
+option(PYBIND11_INSTALL "Install pybind11 header files?" ${PYBIND11_MASTER_PROJECT})
+option(PYBIND11_TEST "Build pybind11 test suite?" ${PYBIND11_MASTER_PROJECT})
+option(PYBIND11_NOPYTHON "Disable search for Python" OFF)
+option(PYBIND11_SIMPLE_GIL_MANAGEMENT
+       "Use simpler GIL management logic that does not support disassociation" OFF)
+set(PYBIND11_INTERNALS_VERSION
+    ""
+    CACHE STRING "Override the ABI version, may be used to enable the unstable ABI.")
+
+if(PYBIND11_SIMPLE_GIL_MANAGEMENT)
+  add_compile_definitions(PYBIND11_SIMPLE_GIL_MANAGEMENT)
+endif()
+
+cmake_dependent_option(
+  USE_PYTHON_INCLUDE_DIR
+  "Install pybind11 headers in Python include directory instead of default installation prefix"
+  OFF "PYBIND11_INSTALL" OFF)
+
+cmake_dependent_option(PYBIND11_FINDPYTHON "Force new FindPython" OFF
+                       "NOT CMAKE_VERSION VERSION_LESS 3.12" OFF)
+
+# NB: when adding a header don't forget to also add it to setup.py
+set(PYBIND11_HEADERS
+    include/pybind11/detail/class.h
+    include/pybind11/detail/common.h
+    include/pybind11/detail/descr.h
+    include/pybind11/detail/init.h
+    include/pybind11/detail/internals.h
+    include/pybind11/detail/type_caster_base.h
+    include/pybind11/detail/typeid.h
+    include/pybind11/attr.h
+    include/pybind11/buffer_info.h
+    include/pybind11/cast.h
+    include/pybind11/chrono.h
+    include/pybind11/common.h
+    include/pybind11/complex.h
+    include/pybind11/options.h
+    include/pybind11/eigen.h
+    include/pybind11/eigen/matrix.h
+    include/pybind11/eigen/tensor.h
+    include/pybind11/embed.h
+    include/pybind11/eval.h
+    include/pybind11/gil.h
+    include/pybind11/iostream.h
+    include/pybind11/functional.h
+    include/pybind11/numpy.h
+    include/pybind11/operators.h
+    include/pybind11/pybind11.h
+    include/pybind11/pytypes.h
+    include/pybind11/stl.h
+    include/pybind11/stl_bind.h
+    include/pybind11/stl/filesystem.h)
+
+# Compare with grep and warn if mismatched
+if(PYBIND11_MASTER_PROJECT AND NOT CMAKE_VERSION VERSION_LESS 3.12)
+  file(
+    GLOB_RECURSE _pybind11_header_check
+    LIST_DIRECTORIES false
+    RELATIVE "${CMAKE_CURRENT_SOURCE_DIR}"
+    CONFIGURE_DEPENDS "include/pybind11/*.h")
+  set(_pybind11_here_only ${PYBIND11_HEADERS})
+  set(_pybind11_disk_only ${_pybind11_header_check})
+  list(REMOVE_ITEM _pybind11_here_only ${_pybind11_header_check})
+  list(REMOVE_ITEM _pybind11_disk_only ${PYBIND11_HEADERS})
+  if(_pybind11_here_only)
+    message(AUTHOR_WARNING "PYBIND11_HEADERS has extra files:" ${_pybind11_here_only})
+  endif()
+  if(_pybind11_disk_only)
+    message(AUTHOR_WARNING "PYBIND11_HEADERS is missing files:" ${_pybind11_disk_only})
+  endif()
+endif()
+
+# CMake 3.12 added list(TRANSFORM <list> PREPEND
+# But we can't use it yet
+string(REPLACE "include/" "${CMAKE_CURRENT_SOURCE_DIR}/include/" PYBIND11_HEADERS
+               "${PYBIND11_HEADERS}")
+
+# Cache variable so this can be used in parent projects
+set(pybind11_INCLUDE_DIR
+    "${CMAKE_CURRENT_LIST_DIR}/include"
+    CACHE INTERNAL "Directory where pybind11 headers are located")
+
+# Backward compatible variable for add_subdirectory mode
+if(NOT PYBIND11_MASTER_PROJECT)
+  set(PYBIND11_INCLUDE_DIR
+      "${pybind11_INCLUDE_DIR}"
+      CACHE INTERNAL "")
+endif()
+
+# Note: when creating targets, you cannot use if statements at configure time -
+# you need generator expressions, because those will be placed in the target file.
+# You can also place ifs *in* the Config.in, but not here.
+
+# This section builds targets, but does *not* touch Python
+# Non-IMPORT targets cannot be defined twice
+if(NOT TARGET pybind11_headers)
+  # Build the headers-only target (no Python included):
+  # (long name used here to keep this from clashing in subdirectory mode)
+  add_library(pybind11_headers INTERFACE)
+  add_library(pybind11::pybind11_headers ALIAS pybind11_headers) # to match exported target
+  add_library(pybind11::headers ALIAS pybind11_headers) # easier to use/remember
+
+  target_include_directories(
+    pybind11_headers ${pybind11_system} INTERFACE $<BUILD_INTERFACE:${pybind11_INCLUDE_DIR}>
+                                                  $<INSTALL_INTERFACE:${CMAKE_INSTALL_INCLUDEDIR}>)
+
+  target_compile_features(pybind11_headers INTERFACE cxx_inheriting_constructors cxx_user_literals
+                                                     cxx_right_angle_brackets)
+  if(NOT "${PYBIND11_INTERNALS_VERSION}" STREQUAL "")
+    target_compile_definitions(
+      pybind11_headers INTERFACE "PYBIND11_INTERNALS_VERSION=${PYBIND11_INTERNALS_VERSION}")
+  endif()
+else()
+  # It is invalid to install a target twice, too.
+  set(PYBIND11_INSTALL OFF)
+endif()
+
+include("${CMAKE_CURRENT_SOURCE_DIR}/tools/pybind11Common.cmake")
+# https://github.com/jtojnar/cmake-snips/#concatenating-paths-when-building-pkg-config-files
+# TODO: cmake 3.20 adds the cmake_path() function, which obsoletes this snippet
+include("${CMAKE_CURRENT_SOURCE_DIR}/tools/JoinPaths.cmake")
+
+# Relative directory setting
+if(USE_PYTHON_INCLUDE_DIR AND DEFINED Python_INCLUDE_DIRS)
+  file(RELATIVE_PATH CMAKE_INSTALL_INCLUDEDIR ${CMAKE_INSTALL_PREFIX} ${Python_INCLUDE_DIRS})
+elseif(USE_PYTHON_INCLUDE_DIR AND DEFINED PYTHON_INCLUDE_DIR)
+  file(RELATIVE_PATH CMAKE_INSTALL_INCLUDEDIR ${CMAKE_INSTALL_PREFIX} ${PYTHON_INCLUDE_DIRS})
+endif()
+
+if(PYBIND11_INSTALL)
+  install(DIRECTORY ${pybind11_INCLUDE_DIR}/pybind11 DESTINATION ${CMAKE_INSTALL_INCLUDEDIR})
+  set(PYBIND11_CMAKECONFIG_INSTALL_DIR
+      "${CMAKE_INSTALL_DATAROOTDIR}/cmake/${PROJECT_NAME}"
+      CACHE STRING "install path for pybind11Config.cmake")
+
+  if(IS_ABSOLUTE "${CMAKE_INSTALL_INCLUDEDIR}")
+    set(pybind11_INCLUDEDIR "${CMAKE_INSTALL_FULL_INCLUDEDIR}")
+  else()
+    set(pybind11_INCLUDEDIR "\$\{PACKAGE_PREFIX_DIR\}/${CMAKE_INSTALL_INCLUDEDIR}")
+  endif()
+
+  configure_package_config_file(
+    tools/${PROJECT_NAME}Config.cmake.in "${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}Config.cmake"
+    INSTALL_DESTINATION ${PYBIND11_CMAKECONFIG_INSTALL_DIR})
+
+  if(CMAKE_VERSION VERSION_LESS 3.14)
+    # Remove CMAKE_SIZEOF_VOID_P from ConfigVersion.cmake since the library does
+    # not depend on architecture specific settings or libraries.
+    set(_PYBIND11_CMAKE_SIZEOF_VOID_P ${CMAKE_SIZEOF_VOID_P})
+    unset(CMAKE_SIZEOF_VOID_P)
+
+    write_basic_package_version_file(
+      ${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}ConfigVersion.cmake
+      VERSION ${PROJECT_VERSION}
+      COMPATIBILITY AnyNewerVersion)
+
+    set(CMAKE_SIZEOF_VOID_P ${_PYBIND11_CMAKE_SIZEOF_VOID_P})
+  else()
+    # CMake 3.14+ natively supports header-only libraries
+    write_basic_package_version_file(
+      ${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}ConfigVersion.cmake
+      VERSION ${PROJECT_VERSION}
+      COMPATIBILITY AnyNewerVersion ARCH_INDEPENDENT)
+  endif()
+
+  install(
+    FILES ${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}Config.cmake
+          ${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}ConfigVersion.cmake
+          tools/FindPythonLibsNew.cmake
+          tools/pybind11Common.cmake
+          tools/pybind11Tools.cmake
+          tools/pybind11NewTools.cmake
+    DESTINATION ${PYBIND11_CMAKECONFIG_INSTALL_DIR})
+
+  if(NOT PYBIND11_EXPORT_NAME)
+    set(PYBIND11_EXPORT_NAME "${PROJECT_NAME}Targets")
+  endif()
+
+  install(TARGETS pybind11_headers EXPORT "${PYBIND11_EXPORT_NAME}")
+
+  install(
+    EXPORT "${PYBIND11_EXPORT_NAME}"
+    NAMESPACE "pybind11::"
+    DESTINATION ${PYBIND11_CMAKECONFIG_INSTALL_DIR})
+
+  # pkg-config support
+  if(NOT prefix_for_pc_file)
+    set(prefix_for_pc_file "${CMAKE_INSTALL_PREFIX}")
+  endif()
+  join_paths(includedir_for_pc_file "\${prefix}" "${CMAKE_INSTALL_INCLUDEDIR}")
+  configure_file("${CMAKE_CURRENT_SOURCE_DIR}/tools/pybind11.pc.in"
+                 "${CMAKE_CURRENT_BINARY_DIR}/pybind11.pc" @ONLY)
+  install(FILES "${CMAKE_CURRENT_BINARY_DIR}/pybind11.pc"
+          DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/pkgconfig/")
+
+  # Uninstall target
+  if(PYBIND11_MASTER_PROJECT)
+    configure_file("${CMAKE_CURRENT_SOURCE_DIR}/tools/cmake_uninstall.cmake.in"
+                   "${CMAKE_CURRENT_BINARY_DIR}/cmake_uninstall.cmake" IMMEDIATE @ONLY)
+
+    add_custom_target(uninstall COMMAND ${CMAKE_COMMAND} -P
+                                        ${CMAKE_CURRENT_BINARY_DIR}/cmake_uninstall.cmake)
+  endif()
+endif()
+
+# BUILD_TESTING takes priority, but only if this is the master project
+if(PYBIND11_MASTER_PROJECT AND DEFINED BUILD_TESTING)
+  if(BUILD_TESTING)
+    if(_pybind11_nopython)
+      message(FATAL_ERROR "Cannot activate tests in NOPYTHON mode")
+    else()
+      add_subdirectory(tests)
+    endif()
+  endif()
+else()
+  if(PYBIND11_TEST)
+    if(_pybind11_nopython)
+      message(FATAL_ERROR "Cannot activate tests in NOPYTHON mode")
+    else()
+      add_subdirectory(tests)
+    endif()
+  endif()
+endif()
+
+# Better symmetry with find_package(pybind11 CONFIG) mode.
+if(NOT PYBIND11_MASTER_PROJECT)
+  set(pybind11_FOUND
+      TRUE
+      CACHE INTERNAL "True if pybind11 and all required components found on the system")
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/LICENSE
new file mode 100644
index 0000000000..e466b0dfda
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/LICENSE
@@ -0,0 +1,29 @@
+Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>, All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its contributors
+   may be used to endorse or promote products derived from this software
+   without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+Please also refer to the file .github/CONTRIBUTING.md, which clarifies licensing of
+external contributions to this project including patches, pull requests, etc.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/attr.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/attr.h
new file mode 100644
index 0000000000..1044db94d9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/attr.h
@@ -0,0 +1,690 @@
+/*
+    pybind11/attr.h: Infrastructure for processing custom
+    type and function attributes
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "detail/common.h"
+#include "cast.h"
+
+#include <functional>
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+/// \addtogroup annotations
+/// @{
+
+/// Annotation for methods
+struct is_method {
+    handle class_;
+    explicit is_method(const handle &c) : class_(c) {}
+};
+
+/// Annotation for setters
+struct is_setter {};
+
+/// Annotation for operators
+struct is_operator {};
+
+/// Annotation for classes that cannot be subclassed
+struct is_final {};
+
+/// Annotation for parent scope
+struct scope {
+    handle value;
+    explicit scope(const handle &s) : value(s) {}
+};
+
+/// Annotation for documentation
+struct doc {
+    const char *value;
+    explicit doc(const char *value) : value(value) {}
+};
+
+/// Annotation for function names
+struct name {
+    const char *value;
+    explicit name(const char *value) : value(value) {}
+};
+
+/// Annotation indicating that a function is an overload associated with a given "sibling"
+struct sibling {
+    handle value;
+    explicit sibling(const handle &value) : value(value.ptr()) {}
+};
+
+/// Annotation indicating that a class derives from another given type
+template <typename T>
+struct base {
+
+    PYBIND11_DEPRECATED(
+        "base<T>() was deprecated in favor of specifying 'T' as a template argument to class_")
+    base() = default;
+};
+
+/// Keep patient alive while nurse lives
+template <size_t Nurse, size_t Patient>
+struct keep_alive {};
+
+/// Annotation indicating that a class is involved in a multiple inheritance relationship
+struct multiple_inheritance {};
+
+/// Annotation which enables dynamic attributes, i.e. adds `__dict__` to a class
+struct dynamic_attr {};
+
+/// Annotation which enables the buffer protocol for a type
+struct buffer_protocol {};
+
+/// Annotation which requests that a special metaclass is created for a type
+struct metaclass {
+    handle value;
+
+    PYBIND11_DEPRECATED("py::metaclass() is no longer required. It's turned on by default now.")
+    metaclass() = default;
+
+    /// Override pybind11's default metaclass
+    explicit metaclass(handle value) : value(value) {}
+};
+
+/// Specifies a custom callback with signature `void (PyHeapTypeObject*)` that
+/// may be used to customize the Python type.
+///
+/// The callback is invoked immediately before `PyType_Ready`.
+///
+/// Note: This is an advanced interface, and uses of it may require changes to
+/// work with later versions of pybind11.  You may wish to consult the
+/// implementation of `make_new_python_type` in `detail/classes.h` to understand
+/// the context in which the callback will be run.
+struct custom_type_setup {
+    using callback = std::function<void(PyHeapTypeObject *heap_type)>;
+
+    explicit custom_type_setup(callback value) : value(std::move(value)) {}
+
+    callback value;
+};
+
+/// Annotation that marks a class as local to the module:
+struct module_local {
+    const bool value;
+    constexpr explicit module_local(bool v = true) : value(v) {}
+};
+
+/// Annotation to mark enums as an arithmetic type
+struct arithmetic {};
+
+/// Mark a function for addition at the beginning of the existing overload chain instead of the end
+struct prepend {};
+
+/** \rst
+    A call policy which places one or more guard variables (``Ts...``) around the function call.
+
+    For example, this definition:
+
+    .. code-block:: cpp
+
+        m.def("foo", foo, py::call_guard<T>());
+
+    is equivalent to the following pseudocode:
+
+    .. code-block:: cpp
+
+        m.def("foo", [](args...) {
+            T scope_guard;
+            return foo(args...); // forwarded arguments
+        });
+ \endrst */
+template <typename... Ts>
+struct call_guard;
+
+template <>
+struct call_guard<> {
+    using type = detail::void_type;
+};
+
+template <typename T>
+struct call_guard<T> {
+    static_assert(std::is_default_constructible<T>::value,
+                  "The guard type must be default constructible");
+
+    using type = T;
+};
+
+template <typename T, typename... Ts>
+struct call_guard<T, Ts...> {
+    struct type {
+        T guard{}; // Compose multiple guard types with left-to-right default-constructor order
+        typename call_guard<Ts...>::type next{};
+    };
+};
+
+/// @} annotations
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+/* Forward declarations */
+enum op_id : int;
+enum op_type : int;
+struct undefined_t;
+template <op_id id, op_type ot, typename L = undefined_t, typename R = undefined_t>
+struct op_;
+void keep_alive_impl(size_t Nurse, size_t Patient, function_call &call, handle ret);
+
+/// Internal data structure which holds metadata about a keyword argument
+struct argument_record {
+    const char *name;  ///< Argument name
+    const char *descr; ///< Human-readable version of the argument value
+    handle value;      ///< Associated Python object
+    bool convert : 1;  ///< True if the argument is allowed to convert when loading
+    bool none : 1;     ///< True if None is allowed when loading
+
+    argument_record(const char *name, const char *descr, handle value, bool convert, bool none)
+        : name(name), descr(descr), value(value), convert(convert), none(none) {}
+};
+
+/// Internal data structure which holds metadata about a bound function (signature, overloads,
+/// etc.)
+struct function_record {
+    function_record()
+        : is_constructor(false), is_new_style_constructor(false), is_stateless(false),
+          is_operator(false), is_method(false), is_setter(false), has_args(false),
+          has_kwargs(false), prepend(false) {}
+
+    /// Function name
+    char *name = nullptr; /* why no C++ strings? They generate heavier code.. */
+
+    // User-specified documentation string
+    char *doc = nullptr;
+
+    /// Human-readable version of the function signature
+    char *signature = nullptr;
+
+    /// List of registered keyword arguments
+    std::vector<argument_record> args;
+
+    /// Pointer to lambda function which converts arguments and performs the actual call
+    handle (*impl)(function_call &) = nullptr;
+
+    /// Storage for the wrapped function pointer and captured data, if any
+    void *data[3] = {};
+
+    /// Pointer to custom destructor for 'data' (if needed)
+    void (*free_data)(function_record *ptr) = nullptr;
+
+    /// Return value policy associated with this function
+    return_value_policy policy = return_value_policy::automatic;
+
+    /// True if name == '__init__'
+    bool is_constructor : 1;
+
+    /// True if this is a new-style `__init__` defined in `detail/init.h`
+    bool is_new_style_constructor : 1;
+
+    /// True if this is a stateless function pointer
+    bool is_stateless : 1;
+
+    /// True if this is an operator (__add__), etc.
+    bool is_operator : 1;
+
+    /// True if this is a method
+    bool is_method : 1;
+
+    /// True if this is a setter
+    bool is_setter : 1;
+
+    /// True if the function has a '*args' argument
+    bool has_args : 1;
+
+    /// True if the function has a '**kwargs' argument
+    bool has_kwargs : 1;
+
+    /// True if this function is to be inserted at the beginning of the overload resolution chain
+    bool prepend : 1;
+
+    /// Number of arguments (including py::args and/or py::kwargs, if present)
+    std::uint16_t nargs;
+
+    /// Number of leading positional arguments, which are terminated by a py::args or py::kwargs
+    /// argument or by a py::kw_only annotation.
+    std::uint16_t nargs_pos = 0;
+
+    /// Number of leading arguments (counted in `nargs`) that are positional-only
+    std::uint16_t nargs_pos_only = 0;
+
+    /// Python method object
+    PyMethodDef *def = nullptr;
+
+    /// Python handle to the parent scope (a class or a module)
+    handle scope;
+
+    /// Python handle to the sibling function representing an overload chain
+    handle sibling;
+
+    /// Pointer to next overload
+    function_record *next = nullptr;
+};
+
+/// Special data structure which (temporarily) holds metadata about a bound class
+struct type_record {
+    PYBIND11_NOINLINE type_record()
+        : multiple_inheritance(false), dynamic_attr(false), buffer_protocol(false),
+          default_holder(true), module_local(false), is_final(false) {}
+
+    /// Handle to the parent scope
+    handle scope;
+
+    /// Name of the class
+    const char *name = nullptr;
+
+    // Pointer to RTTI type_info data structure
+    const std::type_info *type = nullptr;
+
+    /// How large is the underlying C++ type?
+    size_t type_size = 0;
+
+    /// What is the alignment of the underlying C++ type?
+    size_t type_align = 0;
+
+    /// How large is the type's holder?
+    size_t holder_size = 0;
+
+    /// The global operator new can be overridden with a class-specific variant
+    void *(*operator_new)(size_t) = nullptr;
+
+    /// Function pointer to class_<..>::init_instance
+    void (*init_instance)(instance *, const void *) = nullptr;
+
+    /// Function pointer to class_<..>::dealloc
+    void (*dealloc)(detail::value_and_holder &) = nullptr;
+
+    /// List of base classes of the newly created type
+    list bases;
+
+    /// Optional docstring
+    const char *doc = nullptr;
+
+    /// Custom metaclass (optional)
+    handle metaclass;
+
+    /// Custom type setup.
+    custom_type_setup::callback custom_type_setup_callback;
+
+    /// Multiple inheritance marker
+    bool multiple_inheritance : 1;
+
+    /// Does the class manage a __dict__?
+    bool dynamic_attr : 1;
+
+    /// Does the class implement the buffer protocol?
+    bool buffer_protocol : 1;
+
+    /// Is the default (unique_ptr) holder type used?
+    bool default_holder : 1;
+
+    /// Is the class definition local to the module shared object?
+    bool module_local : 1;
+
+    /// Is the class inheritable from python classes?
+    bool is_final : 1;
+
+    PYBIND11_NOINLINE void add_base(const std::type_info &base, void *(*caster)(void *) ) {
+        auto *base_info = detail::get_type_info(base, false);
+        if (!base_info) {
+            std::string tname(base.name());
+            detail::clean_type_id(tname);
+            pybind11_fail("generic_type: type \"" + std::string(name)
+                          + "\" referenced unknown base type \"" + tname + "\"");
+        }
+
+        if (default_holder != base_info->default_holder) {
+            std::string tname(base.name());
+            detail::clean_type_id(tname);
+            pybind11_fail("generic_type: type \"" + std::string(name) + "\" "
+                          + (default_holder ? "does not have" : "has")
+                          + " a non-default holder type while its base \"" + tname + "\" "
+                          + (base_info->default_holder ? "does not" : "does"));
+        }
+
+        bases.append((PyObject *) base_info->type);
+
+#if PY_VERSION_HEX < 0x030B0000
+        dynamic_attr |= base_info->type->tp_dictoffset != 0;
+#else
+        dynamic_attr |= (base_info->type->tp_flags & Py_TPFLAGS_MANAGED_DICT) != 0;
+#endif
+
+        if (caster) {
+            base_info->implicit_casts.emplace_back(type, caster);
+        }
+    }
+};
+
+inline function_call::function_call(const function_record &f, handle p) : func(f), parent(p) {
+    args.reserve(f.nargs);
+    args_convert.reserve(f.nargs);
+}
+
+/// Tag for a new-style `__init__` defined in `detail/init.h`
+struct is_new_style_constructor {};
+
+/**
+ * Partial template specializations to process custom attributes provided to
+ * cpp_function_ and class_. These are either used to initialize the respective
+ * fields in the type_record and function_record data structures or executed at
+ * runtime to deal with custom call policies (e.g. keep_alive).
+ */
+template <typename T, typename SFINAE = void>
+struct process_attribute;
+
+template <typename T>
+struct process_attribute_default {
+    /// Default implementation: do nothing
+    static void init(const T &, function_record *) {}
+    static void init(const T &, type_record *) {}
+    static void precall(function_call &) {}
+    static void postcall(function_call &, handle) {}
+};
+
+/// Process an attribute specifying the function's name
+template <>
+struct process_attribute<name> : process_attribute_default<name> {
+    static void init(const name &n, function_record *r) { r->name = const_cast<char *>(n.value); }
+};
+
+/// Process an attribute specifying the function's docstring
+template <>
+struct process_attribute<doc> : process_attribute_default<doc> {
+    static void init(const doc &n, function_record *r) { r->doc = const_cast<char *>(n.value); }
+};
+
+/// Process an attribute specifying the function's docstring (provided as a C-style string)
+template <>
+struct process_attribute<const char *> : process_attribute_default<const char *> {
+    static void init(const char *d, function_record *r) { r->doc = const_cast<char *>(d); }
+    static void init(const char *d, type_record *r) { r->doc = d; }
+};
+template <>
+struct process_attribute<char *> : process_attribute<const char *> {};
+
+/// Process an attribute indicating the function's return value policy
+template <>
+struct process_attribute<return_value_policy> : process_attribute_default<return_value_policy> {
+    static void init(const return_value_policy &p, function_record *r) { r->policy = p; }
+};
+
+/// Process an attribute which indicates that this is an overloaded function associated with a
+/// given sibling
+template <>
+struct process_attribute<sibling> : process_attribute_default<sibling> {
+    static void init(const sibling &s, function_record *r) { r->sibling = s.value; }
+};
+
+/// Process an attribute which indicates that this function is a method
+template <>
+struct process_attribute<is_method> : process_attribute_default<is_method> {
+    static void init(const is_method &s, function_record *r) {
+        r->is_method = true;
+        r->scope = s.class_;
+    }
+};
+
+/// Process an attribute which indicates that this function is a setter
+template <>
+struct process_attribute<is_setter> : process_attribute_default<is_setter> {
+    static void init(const is_setter &, function_record *r) { r->is_setter = true; }
+};
+
+/// Process an attribute which indicates the parent scope of a method
+template <>
+struct process_attribute<scope> : process_attribute_default<scope> {
+    static void init(const scope &s, function_record *r) { r->scope = s.value; }
+};
+
+/// Process an attribute which indicates that this function is an operator
+template <>
+struct process_attribute<is_operator> : process_attribute_default<is_operator> {
+    static void init(const is_operator &, function_record *r) { r->is_operator = true; }
+};
+
+template <>
+struct process_attribute<is_new_style_constructor>
+    : process_attribute_default<is_new_style_constructor> {
+    static void init(const is_new_style_constructor &, function_record *r) {
+        r->is_new_style_constructor = true;
+    }
+};
+
+inline void check_kw_only_arg(const arg &a, function_record *r) {
+    if (r->args.size() > r->nargs_pos && (!a.name || a.name[0] == '\0')) {
+        pybind11_fail("arg(): cannot specify an unnamed argument after a kw_only() annotation or "
+                      "args() argument");
+    }
+}
+
+inline void append_self_arg_if_needed(function_record *r) {
+    if (r->is_method && r->args.empty()) {
+        r->args.emplace_back("self", nullptr, handle(), /*convert=*/true, /*none=*/false);
+    }
+}
+
+/// Process a keyword argument attribute (*without* a default value)
+template <>
+struct process_attribute<arg> : process_attribute_default<arg> {
+    static void init(const arg &a, function_record *r) {
+        append_self_arg_if_needed(r);
+        r->args.emplace_back(a.name, nullptr, handle(), !a.flag_noconvert, a.flag_none);
+
+        check_kw_only_arg(a, r);
+    }
+};
+
+/// Process a keyword argument attribute (*with* a default value)
+template <>
+struct process_attribute<arg_v> : process_attribute_default<arg_v> {
+    static void init(const arg_v &a, function_record *r) {
+        if (r->is_method && r->args.empty()) {
+            r->args.emplace_back(
+                "self", /*descr=*/nullptr, /*parent=*/handle(), /*convert=*/true, /*none=*/false);
+        }
+
+        if (!a.value) {
+#if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+            std::string descr("'");
+            if (a.name) {
+                descr += std::string(a.name) + ": ";
+            }
+            descr += a.type + "'";
+            if (r->is_method) {
+                if (r->name) {
+                    descr += " in method '" + (std::string) str(r->scope) + "."
+                             + (std::string) r->name + "'";
+                } else {
+                    descr += " in method of '" + (std::string) str(r->scope) + "'";
+                }
+            } else if (r->name) {
+                descr += " in function '" + (std::string) r->name + "'";
+            }
+            pybind11_fail("arg(): could not convert default argument " + descr
+                          + " into a Python object (type not registered yet?)");
+#else
+            pybind11_fail("arg(): could not convert default argument "
+                          "into a Python object (type not registered yet?). "
+                          "#define PYBIND11_DETAILED_ERROR_MESSAGES or compile in debug mode for "
+                          "more information.");
+#endif
+        }
+        r->args.emplace_back(a.name, a.descr, a.value.inc_ref(), !a.flag_noconvert, a.flag_none);
+
+        check_kw_only_arg(a, r);
+    }
+};
+
+/// Process a keyword-only-arguments-follow pseudo argument
+template <>
+struct process_attribute<kw_only> : process_attribute_default<kw_only> {
+    static void init(const kw_only &, function_record *r) {
+        append_self_arg_if_needed(r);
+        if (r->has_args && r->nargs_pos != static_cast<std::uint16_t>(r->args.size())) {
+            pybind11_fail("Mismatched args() and kw_only(): they must occur at the same relative "
+                          "argument location (or omit kw_only() entirely)");
+        }
+        r->nargs_pos = static_cast<std::uint16_t>(r->args.size());
+    }
+};
+
+/// Process a positional-only-argument maker
+template <>
+struct process_attribute<pos_only> : process_attribute_default<pos_only> {
+    static void init(const pos_only &, function_record *r) {
+        append_self_arg_if_needed(r);
+        r->nargs_pos_only = static_cast<std::uint16_t>(r->args.size());
+        if (r->nargs_pos_only > r->nargs_pos) {
+            pybind11_fail("pos_only(): cannot follow a py::args() argument");
+        }
+        // It also can't follow a kw_only, but a static_assert in pybind11.h checks that
+    }
+};
+
+/// Process a parent class attribute.  Single inheritance only (class_ itself already guarantees
+/// that)
+template <typename T>
+struct process_attribute<T, enable_if_t<is_pyobject<T>::value>>
+    : process_attribute_default<handle> {
+    static void init(const handle &h, type_record *r) { r->bases.append(h); }
+};
+
+/// Process a parent class attribute (deprecated, does not support multiple inheritance)
+template <typename T>
+struct process_attribute<base<T>> : process_attribute_default<base<T>> {
+    static void init(const base<T> &, type_record *r) { r->add_base(typeid(T), nullptr); }
+};
+
+/// Process a multiple inheritance attribute
+template <>
+struct process_attribute<multiple_inheritance> : process_attribute_default<multiple_inheritance> {
+    static void init(const multiple_inheritance &, type_record *r) {
+        r->multiple_inheritance = true;
+    }
+};
+
+template <>
+struct process_attribute<dynamic_attr> : process_attribute_default<dynamic_attr> {
+    static void init(const dynamic_attr &, type_record *r) { r->dynamic_attr = true; }
+};
+
+template <>
+struct process_attribute<custom_type_setup> {
+    static void init(const custom_type_setup &value, type_record *r) {
+        r->custom_type_setup_callback = value.value;
+    }
+};
+
+template <>
+struct process_attribute<is_final> : process_attribute_default<is_final> {
+    static void init(const is_final &, type_record *r) { r->is_final = true; }
+};
+
+template <>
+struct process_attribute<buffer_protocol> : process_attribute_default<buffer_protocol> {
+    static void init(const buffer_protocol &, type_record *r) { r->buffer_protocol = true; }
+};
+
+template <>
+struct process_attribute<metaclass> : process_attribute_default<metaclass> {
+    static void init(const metaclass &m, type_record *r) { r->metaclass = m.value; }
+};
+
+template <>
+struct process_attribute<module_local> : process_attribute_default<module_local> {
+    static void init(const module_local &l, type_record *r) { r->module_local = l.value; }
+};
+
+/// Process a 'prepend' attribute, putting this at the beginning of the overload chain
+template <>
+struct process_attribute<prepend> : process_attribute_default<prepend> {
+    static void init(const prepend &, function_record *r) { r->prepend = true; }
+};
+
+/// Process an 'arithmetic' attribute for enums (does nothing here)
+template <>
+struct process_attribute<arithmetic> : process_attribute_default<arithmetic> {};
+
+template <typename... Ts>
+struct process_attribute<call_guard<Ts...>> : process_attribute_default<call_guard<Ts...>> {};
+
+/**
+ * Process a keep_alive call policy -- invokes keep_alive_impl during the
+ * pre-call handler if both Nurse, Patient != 0 and use the post-call handler
+ * otherwise
+ */
+template <size_t Nurse, size_t Patient>
+struct process_attribute<keep_alive<Nurse, Patient>>
+    : public process_attribute_default<keep_alive<Nurse, Patient>> {
+    template <size_t N = Nurse, size_t P = Patient, enable_if_t<N != 0 && P != 0, int> = 0>
+    static void precall(function_call &call) {
+        keep_alive_impl(Nurse, Patient, call, handle());
+    }
+    template <size_t N = Nurse, size_t P = Patient, enable_if_t<N != 0 && P != 0, int> = 0>
+    static void postcall(function_call &, handle) {}
+    template <size_t N = Nurse, size_t P = Patient, enable_if_t<N == 0 || P == 0, int> = 0>
+    static void precall(function_call &) {}
+    template <size_t N = Nurse, size_t P = Patient, enable_if_t<N == 0 || P == 0, int> = 0>
+    static void postcall(function_call &call, handle ret) {
+        keep_alive_impl(Nurse, Patient, call, ret);
+    }
+};
+
+/// Recursively iterate over variadic template arguments
+template <typename... Args>
+struct process_attributes {
+    static void init(const Args &...args, function_record *r) {
+        PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(r);
+        PYBIND11_WORKAROUND_INCORRECT_GCC_UNUSED_BUT_SET_PARAMETER(r);
+        using expander = int[];
+        (void) expander{
+            0, ((void) process_attribute<typename std::decay<Args>::type>::init(args, r), 0)...};
+    }
+    static void init(const Args &...args, type_record *r) {
+        PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(r);
+        PYBIND11_WORKAROUND_INCORRECT_GCC_UNUSED_BUT_SET_PARAMETER(r);
+        using expander = int[];
+        (void) expander{0,
+                        (process_attribute<typename std::decay<Args>::type>::init(args, r), 0)...};
+    }
+    static void precall(function_call &call) {
+        PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(call);
+        using expander = int[];
+        (void) expander{0,
+                        (process_attribute<typename std::decay<Args>::type>::precall(call), 0)...};
+    }
+    static void postcall(function_call &call, handle fn_ret) {
+        PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(call, fn_ret);
+        PYBIND11_WORKAROUND_INCORRECT_GCC_UNUSED_BUT_SET_PARAMETER(fn_ret);
+        using expander = int[];
+        (void) expander{
+            0, (process_attribute<typename std::decay<Args>::type>::postcall(call, fn_ret), 0)...};
+    }
+};
+
+template <typename T>
+using is_call_guard = is_instantiation<call_guard, T>;
+
+/// Extract the ``type`` from the first `call_guard` in `Extras...` (or `void_type` if none found)
+template <typename... Extra>
+using extract_guard_t = typename exactly_one_t<is_call_guard, call_guard<>, Extra...>::type;
+
+/// Check the number of named arguments at compile time
+template <typename... Extra,
+          size_t named = constexpr_sum(std::is_base_of<arg, Extra>::value...),
+          size_t self = constexpr_sum(std::is_same<is_method, Extra>::value...)>
+constexpr bool expected_num_args(size_t nargs, bool has_args, bool has_kwargs) {
+    PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(nargs, has_args, has_kwargs);
+    return named == 0 || (self + named + size_t(has_args) + size_t(has_kwargs)) == nargs;
+}
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/buffer_info.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/buffer_info.h
new file mode 100644
index 0000000000..75aec0ba30
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/buffer_info.h
@@ -0,0 +1,208 @@
+/*
+    pybind11/buffer_info.h: Python buffer object interface
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "detail/common.h"
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+// Default, C-style strides
+inline std::vector<ssize_t> c_strides(const std::vector<ssize_t> &shape, ssize_t itemsize) {
+    auto ndim = shape.size();
+    std::vector<ssize_t> strides(ndim, itemsize);
+    if (ndim > 0) {
+        for (size_t i = ndim - 1; i > 0; --i) {
+            strides[i - 1] = strides[i] * shape[i];
+        }
+    }
+    return strides;
+}
+
+// F-style strides; default when constructing an array_t with `ExtraFlags & f_style`
+inline std::vector<ssize_t> f_strides(const std::vector<ssize_t> &shape, ssize_t itemsize) {
+    auto ndim = shape.size();
+    std::vector<ssize_t> strides(ndim, itemsize);
+    for (size_t i = 1; i < ndim; ++i) {
+        strides[i] = strides[i - 1] * shape[i - 1];
+    }
+    return strides;
+}
+
+template <typename T, typename SFINAE = void>
+struct compare_buffer_info;
+
+PYBIND11_NAMESPACE_END(detail)
+
+/// Information record describing a Python buffer object
+struct buffer_info {
+    void *ptr = nullptr;          // Pointer to the underlying storage
+    ssize_t itemsize = 0;         // Size of individual items in bytes
+    ssize_t size = 0;             // Total number of entries
+    std::string format;           // For homogeneous buffers, this should be set to
+                                  // format_descriptor<T>::format()
+    ssize_t ndim = 0;             // Number of dimensions
+    std::vector<ssize_t> shape;   // Shape of the tensor (1 entry per dimension)
+    std::vector<ssize_t> strides; // Number of bytes between adjacent entries
+                                  // (for each per dimension)
+    bool readonly = false;        // flag to indicate if the underlying storage may be written to
+
+    buffer_info() = default;
+
+    buffer_info(void *ptr,
+                ssize_t itemsize,
+                const std::string &format,
+                ssize_t ndim,
+                detail::any_container<ssize_t> shape_in,
+                detail::any_container<ssize_t> strides_in,
+                bool readonly = false)
+        : ptr(ptr), itemsize(itemsize), size(1), format(format), ndim(ndim),
+          shape(std::move(shape_in)), strides(std::move(strides_in)), readonly(readonly) {
+        if (ndim != (ssize_t) shape.size() || ndim != (ssize_t) strides.size()) {
+            pybind11_fail("buffer_info: ndim doesn't match shape and/or strides length");
+        }
+        for (size_t i = 0; i < (size_t) ndim; ++i) {
+            size *= shape[i];
+        }
+    }
+
+    template <typename T>
+    buffer_info(T *ptr,
+                detail::any_container<ssize_t> shape_in,
+                detail::any_container<ssize_t> strides_in,
+                bool readonly = false)
+        : buffer_info(private_ctr_tag(),
+                      ptr,
+                      sizeof(T),
+                      format_descriptor<T>::format(),
+                      static_cast<ssize_t>(shape_in->size()),
+                      std::move(shape_in),
+                      std::move(strides_in),
+                      readonly) {}
+
+    buffer_info(void *ptr,
+                ssize_t itemsize,
+                const std::string &format,
+                ssize_t size,
+                bool readonly = false)
+        : buffer_info(ptr, itemsize, format, 1, {size}, {itemsize}, readonly) {}
+
+    template <typename T>
+    buffer_info(T *ptr, ssize_t size, bool readonly = false)
+        : buffer_info(ptr, sizeof(T), format_descriptor<T>::format(), size, readonly) {}
+
+    template <typename T>
+    buffer_info(const T *ptr, ssize_t size, bool readonly = true)
+        : buffer_info(
+              const_cast<T *>(ptr), sizeof(T), format_descriptor<T>::format(), size, readonly) {}
+
+    explicit buffer_info(Py_buffer *view, bool ownview = true)
+        : buffer_info(
+              view->buf,
+              view->itemsize,
+              view->format,
+              view->ndim,
+              {view->shape, view->shape + view->ndim},
+              /* Though buffer::request() requests PyBUF_STRIDES, ctypes objects
+               * ignore this flag and return a view with NULL strides.
+               * When strides are NULL, build them manually.  */
+              view->strides
+                  ? std::vector<ssize_t>(view->strides, view->strides + view->ndim)
+                  : detail::c_strides({view->shape, view->shape + view->ndim}, view->itemsize),
+              (view->readonly != 0)) {
+        // NOLINTNEXTLINE(cppcoreguidelines-prefer-member-initializer)
+        this->m_view = view;
+        // NOLINTNEXTLINE(cppcoreguidelines-prefer-member-initializer)
+        this->ownview = ownview;
+    }
+
+    buffer_info(const buffer_info &) = delete;
+    buffer_info &operator=(const buffer_info &) = delete;
+
+    buffer_info(buffer_info &&other) noexcept { (*this) = std::move(other); }
+
+    buffer_info &operator=(buffer_info &&rhs) noexcept {
+        ptr = rhs.ptr;
+        itemsize = rhs.itemsize;
+        size = rhs.size;
+        format = std::move(rhs.format);
+        ndim = rhs.ndim;
+        shape = std::move(rhs.shape);
+        strides = std::move(rhs.strides);
+        std::swap(m_view, rhs.m_view);
+        std::swap(ownview, rhs.ownview);
+        readonly = rhs.readonly;
+        return *this;
+    }
+
+    ~buffer_info() {
+        if (m_view && ownview) {
+            PyBuffer_Release(m_view);
+            delete m_view;
+        }
+    }
+
+    Py_buffer *view() const { return m_view; }
+    Py_buffer *&view() { return m_view; }
+
+    /* True if the buffer item type is equivalent to `T`. */
+    // To define "equivalent" by example:
+    // `buffer_info::item_type_is_equivalent_to<int>(b)` and
+    // `buffer_info::item_type_is_equivalent_to<long>(b)` may both be true
+    // on some platforms, but `int` and `unsigned` will never be equivalent.
+    // For the ground truth, please inspect `detail::compare_buffer_info<>`.
+    template <typename T>
+    bool item_type_is_equivalent_to() const {
+        return detail::compare_buffer_info<T>::compare(*this);
+    }
+
+private:
+    struct private_ctr_tag {};
+
+    buffer_info(private_ctr_tag,
+                void *ptr,
+                ssize_t itemsize,
+                const std::string &format,
+                ssize_t ndim,
+                detail::any_container<ssize_t> &&shape_in,
+                detail::any_container<ssize_t> &&strides_in,
+                bool readonly)
+        : buffer_info(
+              ptr, itemsize, format, ndim, std::move(shape_in), std::move(strides_in), readonly) {}
+
+    Py_buffer *m_view = nullptr;
+    bool ownview = false;
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <typename T, typename SFINAE>
+struct compare_buffer_info {
+    static bool compare(const buffer_info &b) {
+        // NOLINTNEXTLINE(bugprone-sizeof-expression) Needed for `PyObject *`
+        return b.format == format_descriptor<T>::format() && b.itemsize == (ssize_t) sizeof(T);
+    }
+};
+
+template <typename T>
+struct compare_buffer_info<T, detail::enable_if_t<std::is_integral<T>::value>> {
+    static bool compare(const buffer_info &b) {
+        return (size_t) b.itemsize == sizeof(T)
+               && (b.format == format_descriptor<T>::value
+                   || ((sizeof(T) == sizeof(long))
+                       && b.format == (std::is_unsigned<T>::value ? "L" : "l"))
+                   || ((sizeof(T) == sizeof(size_t))
+                       && b.format == (std::is_unsigned<T>::value ? "N" : "n")));
+    }
+};
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/cast.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/cast.h
new file mode 100644
index 0000000000..624b8ebaca
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/cast.h
@@ -0,0 +1,1848 @@
+/*
+    pybind11/cast.h: Partial template specializations to cast between
+    C++ and Python types
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "detail/common.h"
+#include "detail/descr.h"
+#include "detail/type_caster_base.h"
+#include "detail/typeid.h"
+#include "pytypes.h"
+
+#include <array>
+#include <cstring>
+#include <functional>
+#include <iosfwd>
+#include <iterator>
+#include <memory>
+#include <string>
+#include <tuple>
+#include <type_traits>
+#include <utility>
+#include <vector>
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+PYBIND11_WARNING_DISABLE_MSVC(4127)
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <typename type, typename SFINAE = void>
+class type_caster : public type_caster_base<type> {};
+template <typename type>
+using make_caster = type_caster<intrinsic_t<type>>;
+
+// Shortcut for calling a caster's `cast_op_type` cast operator for casting a type_caster to a T
+template <typename T>
+typename make_caster<T>::template cast_op_type<T> cast_op(make_caster<T> &caster) {
+    using result_t = typename make_caster<T>::template cast_op_type<T>; // See PR #4893
+    return caster.operator result_t();
+}
+template <typename T>
+typename make_caster<T>::template cast_op_type<typename std::add_rvalue_reference<T>::type>
+cast_op(make_caster<T> &&caster) {
+    using result_t = typename make_caster<T>::template cast_op_type<
+        typename std::add_rvalue_reference<T>::type>; // See PR #4893
+    return std::move(caster).operator result_t();
+}
+
+template <typename type>
+class type_caster<std::reference_wrapper<type>> {
+private:
+    using caster_t = make_caster<type>;
+    caster_t subcaster;
+    using reference_t = type &;
+    using subcaster_cast_op_type = typename caster_t::template cast_op_type<reference_t>;
+
+    static_assert(
+        std::is_same<typename std::remove_const<type>::type &, subcaster_cast_op_type>::value
+            || std::is_same<reference_t, subcaster_cast_op_type>::value,
+        "std::reference_wrapper<T> caster requires T to have a caster with an "
+        "`operator T &()` or `operator const T &()`");
+
+public:
+    bool load(handle src, bool convert) { return subcaster.load(src, convert); }
+    static constexpr auto name = caster_t::name;
+    static handle
+    cast(const std::reference_wrapper<type> &src, return_value_policy policy, handle parent) {
+        // It is definitely wrong to take ownership of this pointer, so mask that rvp
+        if (policy == return_value_policy::take_ownership
+            || policy == return_value_policy::automatic) {
+            policy = return_value_policy::automatic_reference;
+        }
+        return caster_t::cast(&src.get(), policy, parent);
+    }
+    template <typename T>
+    using cast_op_type = std::reference_wrapper<type>;
+    explicit operator std::reference_wrapper<type>() { return cast_op<type &>(subcaster); }
+};
+
+#define PYBIND11_TYPE_CASTER(type, py_name)                                                       \
+protected:                                                                                        \
+    type value;                                                                                   \
+                                                                                                  \
+public:                                                                                           \
+    static constexpr auto name = py_name;                                                         \
+    template <typename T_,                                                                        \
+              ::pybind11::detail::enable_if_t<                                                    \
+                  std::is_same<type, ::pybind11::detail::remove_cv_t<T_>>::value,                 \
+                  int>                                                                            \
+              = 0>                                                                                \
+    static ::pybind11::handle cast(                                                               \
+        T_ *src, ::pybind11::return_value_policy policy, ::pybind11::handle parent) {             \
+        if (!src)                                                                                 \
+            return ::pybind11::none().release();                                                  \
+        if (policy == ::pybind11::return_value_policy::take_ownership) {                          \
+            auto h = cast(std::move(*src), policy, parent);                                       \
+            delete src;                                                                           \
+            return h;                                                                             \
+        }                                                                                         \
+        return cast(*src, policy, parent);                                                        \
+    }                                                                                             \
+    operator type *() { return &value; }               /* NOLINT(bugprone-macro-parentheses) */   \
+    operator type &() { return value; }                /* NOLINT(bugprone-macro-parentheses) */   \
+    operator type &&() && { return std::move(value); } /* NOLINT(bugprone-macro-parentheses) */   \
+    template <typename T_>                                                                        \
+    using cast_op_type = ::pybind11::detail::movable_cast_op_type<T_>
+
+template <typename CharT>
+using is_std_char_type = any_of<std::is_same<CharT, char>, /* std::string */
+#if defined(PYBIND11_HAS_U8STRING)
+                                std::is_same<CharT, char8_t>, /* std::u8string */
+#endif
+                                std::is_same<CharT, char16_t>, /* std::u16string */
+                                std::is_same<CharT, char32_t>, /* std::u32string */
+                                std::is_same<CharT, wchar_t>   /* std::wstring */
+                                >;
+
+template <typename T>
+struct type_caster<T, enable_if_t<std::is_arithmetic<T>::value && !is_std_char_type<T>::value>> {
+    using _py_type_0 = conditional_t<sizeof(T) <= sizeof(long), long, long long>;
+    using _py_type_1 = conditional_t<std::is_signed<T>::value,
+                                     _py_type_0,
+                                     typename std::make_unsigned<_py_type_0>::type>;
+    using py_type = conditional_t<std::is_floating_point<T>::value, double, _py_type_1>;
+
+public:
+    bool load(handle src, bool convert) {
+        py_type py_value;
+
+        if (!src) {
+            return false;
+        }
+
+#if !defined(PYPY_VERSION)
+        auto index_check = [](PyObject *o) { return PyIndex_Check(o); };
+#else
+        // In PyPy 7.3.3, `PyIndex_Check` is implemented by calling `__index__`,
+        // while CPython only considers the existence of `nb_index`/`__index__`.
+        auto index_check = [](PyObject *o) { return hasattr(o, "__index__"); };
+#endif
+
+        if (std::is_floating_point<T>::value) {
+            if (convert || PyFloat_Check(src.ptr())) {
+                py_value = (py_type) PyFloat_AsDouble(src.ptr());
+            } else {
+                return false;
+            }
+        } else if (PyFloat_Check(src.ptr())
+                   || (!convert && !PYBIND11_LONG_CHECK(src.ptr()) && !index_check(src.ptr()))) {
+            return false;
+        } else {
+            handle src_or_index = src;
+            // PyPy: 7.3.7's 3.8 does not implement PyLong_*'s __index__ calls.
+#if PY_VERSION_HEX < 0x03080000 || defined(PYPY_VERSION)
+            object index;
+            if (!PYBIND11_LONG_CHECK(src.ptr())) { // So: index_check(src.ptr())
+                index = reinterpret_steal<object>(PyNumber_Index(src.ptr()));
+                if (!index) {
+                    PyErr_Clear();
+                    if (!convert)
+                        return false;
+                } else {
+                    src_or_index = index;
+                }
+            }
+#endif
+            if (std::is_unsigned<py_type>::value) {
+                py_value = as_unsigned<py_type>(src_or_index.ptr());
+            } else { // signed integer:
+                py_value = sizeof(T) <= sizeof(long)
+                               ? (py_type) PyLong_AsLong(src_or_index.ptr())
+                               : (py_type) PYBIND11_LONG_AS_LONGLONG(src_or_index.ptr());
+            }
+        }
+
+        // Python API reported an error
+        bool py_err = py_value == (py_type) -1 && PyErr_Occurred();
+
+        // Check to see if the conversion is valid (integers should match exactly)
+        // Signed/unsigned checks happen elsewhere
+        if (py_err
+            || (std::is_integral<T>::value && sizeof(py_type) != sizeof(T)
+                && py_value != (py_type) (T) py_value)) {
+            PyErr_Clear();
+            if (py_err && convert && (PyNumber_Check(src.ptr()) != 0)) {
+                auto tmp = reinterpret_steal<object>(std::is_floating_point<T>::value
+                                                         ? PyNumber_Float(src.ptr())
+                                                         : PyNumber_Long(src.ptr()));
+                PyErr_Clear();
+                return load(tmp, false);
+            }
+            return false;
+        }
+
+        value = (T) py_value;
+        return true;
+    }
+
+    template <typename U = T>
+    static typename std::enable_if<std::is_floating_point<U>::value, handle>::type
+    cast(U src, return_value_policy /* policy */, handle /* parent */) {
+        return PyFloat_FromDouble((double) src);
+    }
+
+    template <typename U = T>
+    static typename std::enable_if<!std::is_floating_point<U>::value && std::is_signed<U>::value
+                                       && (sizeof(U) <= sizeof(long)),
+                                   handle>::type
+    cast(U src, return_value_policy /* policy */, handle /* parent */) {
+        return PYBIND11_LONG_FROM_SIGNED((long) src);
+    }
+
+    template <typename U = T>
+    static typename std::enable_if<!std::is_floating_point<U>::value && std::is_unsigned<U>::value
+                                       && (sizeof(U) <= sizeof(unsigned long)),
+                                   handle>::type
+    cast(U src, return_value_policy /* policy */, handle /* parent */) {
+        return PYBIND11_LONG_FROM_UNSIGNED((unsigned long) src);
+    }
+
+    template <typename U = T>
+    static typename std::enable_if<!std::is_floating_point<U>::value && std::is_signed<U>::value
+                                       && (sizeof(U) > sizeof(long)),
+                                   handle>::type
+    cast(U src, return_value_policy /* policy */, handle /* parent */) {
+        return PyLong_FromLongLong((long long) src);
+    }
+
+    template <typename U = T>
+    static typename std::enable_if<!std::is_floating_point<U>::value && std::is_unsigned<U>::value
+                                       && (sizeof(U) > sizeof(unsigned long)),
+                                   handle>::type
+    cast(U src, return_value_policy /* policy */, handle /* parent */) {
+        return PyLong_FromUnsignedLongLong((unsigned long long) src);
+    }
+
+    PYBIND11_TYPE_CASTER(T, const_name<std::is_integral<T>::value>("int", "float"));
+};
+
+template <typename T>
+struct void_caster {
+public:
+    bool load(handle src, bool) {
+        if (src && src.is_none()) {
+            return true;
+        }
+        return false;
+    }
+    static handle cast(T, return_value_policy /* policy */, handle /* parent */) {
+        return none().release();
+    }
+    PYBIND11_TYPE_CASTER(T, const_name("None"));
+};
+
+template <>
+class type_caster<void_type> : public void_caster<void_type> {};
+
+template <>
+class type_caster<void> : public type_caster<void_type> {
+public:
+    using type_caster<void_type>::cast;
+
+    bool load(handle h, bool) {
+        if (!h) {
+            return false;
+        }
+        if (h.is_none()) {
+            value = nullptr;
+            return true;
+        }
+
+        /* Check if this is a capsule */
+        if (isinstance<capsule>(h)) {
+            value = reinterpret_borrow<capsule>(h);
+            return true;
+        }
+
+        /* Check if this is a C++ type */
+        const auto &bases = all_type_info((PyTypeObject *) type::handle_of(h).ptr());
+        if (bases.size() == 1) { // Only allowing loading from a single-value type
+            value = values_and_holders(reinterpret_cast<instance *>(h.ptr())).begin()->value_ptr();
+            return true;
+        }
+
+        /* Fail */
+        return false;
+    }
+
+    static handle cast(const void *ptr, return_value_policy /* policy */, handle /* parent */) {
+        if (ptr) {
+            return capsule(ptr).release();
+        }
+        return none().release();
+    }
+
+    template <typename T>
+    using cast_op_type = void *&;
+    explicit operator void *&() { return value; }
+    static constexpr auto name = const_name("capsule");
+
+private:
+    void *value = nullptr;
+};
+
+template <>
+class type_caster<std::nullptr_t> : public void_caster<std::nullptr_t> {};
+
+template <>
+class type_caster<bool> {
+public:
+    bool load(handle src, bool convert) {
+        if (!src) {
+            return false;
+        }
+        if (src.ptr() == Py_True) {
+            value = true;
+            return true;
+        }
+        if (src.ptr() == Py_False) {
+            value = false;
+            return true;
+        }
+        if (convert || is_numpy_bool(src)) {
+            // (allow non-implicit conversion for numpy booleans), use strncmp
+            // since NumPy 1.x had an additional trailing underscore.
+
+            Py_ssize_t res = -1;
+            if (src.is_none()) {
+                res = 0; // None is implicitly converted to False
+            }
+#if defined(PYPY_VERSION)
+            // On PyPy, check that "__bool__" attr exists
+            else if (hasattr(src, PYBIND11_BOOL_ATTR)) {
+                res = PyObject_IsTrue(src.ptr());
+            }
+#else
+            // Alternate approach for CPython: this does the same as the above, but optimized
+            // using the CPython API so as to avoid an unneeded attribute lookup.
+            else if (auto *tp_as_number = src.ptr()->ob_type->tp_as_number) {
+                if (PYBIND11_NB_BOOL(tp_as_number)) {
+                    res = (*PYBIND11_NB_BOOL(tp_as_number))(src.ptr());
+                }
+            }
+#endif
+            if (res == 0 || res == 1) {
+                value = (res != 0);
+                return true;
+            }
+            PyErr_Clear();
+        }
+        return false;
+    }
+    static handle cast(bool src, return_value_policy /* policy */, handle /* parent */) {
+        return handle(src ? Py_True : Py_False).inc_ref();
+    }
+    PYBIND11_TYPE_CASTER(bool, const_name("bool"));
+
+private:
+    // Test if an object is a NumPy boolean (without fetching the type).
+    static inline bool is_numpy_bool(handle object) {
+        const char *type_name = Py_TYPE(object.ptr())->tp_name;
+        // Name changed to `numpy.bool` in NumPy 2, `numpy.bool_` is needed for 1.x support
+        return std::strcmp("numpy.bool", type_name) == 0
+               || std::strcmp("numpy.bool_", type_name) == 0;
+    }
+};
+
+// Helper class for UTF-{8,16,32} C++ stl strings:
+template <typename StringType, bool IsView = false>
+struct string_caster {
+    using CharT = typename StringType::value_type;
+
+    // Simplify life by being able to assume standard char sizes (the standard only guarantees
+    // minimums, but Python requires exact sizes)
+    static_assert(!std::is_same<CharT, char>::value || sizeof(CharT) == 1,
+                  "Unsupported char size != 1");
+#if defined(PYBIND11_HAS_U8STRING)
+    static_assert(!std::is_same<CharT, char8_t>::value || sizeof(CharT) == 1,
+                  "Unsupported char8_t size != 1");
+#endif
+    static_assert(!std::is_same<CharT, char16_t>::value || sizeof(CharT) == 2,
+                  "Unsupported char16_t size != 2");
+    static_assert(!std::is_same<CharT, char32_t>::value || sizeof(CharT) == 4,
+                  "Unsupported char32_t size != 4");
+    // wchar_t can be either 16 bits (Windows) or 32 (everywhere else)
+    static_assert(!std::is_same<CharT, wchar_t>::value || sizeof(CharT) == 2 || sizeof(CharT) == 4,
+                  "Unsupported wchar_t size != 2/4");
+    static constexpr size_t UTF_N = 8 * sizeof(CharT);
+
+    bool load(handle src, bool) {
+        handle load_src = src;
+        if (!src) {
+            return false;
+        }
+        if (!PyUnicode_Check(load_src.ptr())) {
+            return load_raw(load_src);
+        }
+
+        // For UTF-8 we avoid the need for a temporary `bytes` object by using
+        // `PyUnicode_AsUTF8AndSize`.
+        if (UTF_N == 8) {
+            Py_ssize_t size = -1;
+            const auto *buffer
+                = reinterpret_cast<const CharT *>(PyUnicode_AsUTF8AndSize(load_src.ptr(), &size));
+            if (!buffer) {
+                PyErr_Clear();
+                return false;
+            }
+            value = StringType(buffer, static_cast<size_t>(size));
+            return true;
+        }
+
+        auto utfNbytes
+            = reinterpret_steal<object>(PyUnicode_AsEncodedString(load_src.ptr(),
+                                                                  UTF_N == 8    ? "utf-8"
+                                                                  : UTF_N == 16 ? "utf-16"
+                                                                                : "utf-32",
+                                                                  nullptr));
+        if (!utfNbytes) {
+            PyErr_Clear();
+            return false;
+        }
+
+        const auto *buffer
+            = reinterpret_cast<const CharT *>(PYBIND11_BYTES_AS_STRING(utfNbytes.ptr()));
+        size_t length = (size_t) PYBIND11_BYTES_SIZE(utfNbytes.ptr()) / sizeof(CharT);
+        // Skip BOM for UTF-16/32
+        if (UTF_N > 8) {
+            buffer++;
+            length--;
+        }
+        value = StringType(buffer, length);
+
+        // If we're loading a string_view we need to keep the encoded Python object alive:
+        if (IsView) {
+            loader_life_support::add_patient(utfNbytes);
+        }
+
+        return true;
+    }
+
+    static handle
+    cast(const StringType &src, return_value_policy /* policy */, handle /* parent */) {
+        const char *buffer = reinterpret_cast<const char *>(src.data());
+        auto nbytes = ssize_t(src.size() * sizeof(CharT));
+        handle s = decode_utfN(buffer, nbytes);
+        if (!s) {
+            throw error_already_set();
+        }
+        return s;
+    }
+
+    PYBIND11_TYPE_CASTER(StringType, const_name(PYBIND11_STRING_NAME));
+
+private:
+    static handle decode_utfN(const char *buffer, ssize_t nbytes) {
+#if !defined(PYPY_VERSION)
+        return UTF_N == 8    ? PyUnicode_DecodeUTF8(buffer, nbytes, nullptr)
+               : UTF_N == 16 ? PyUnicode_DecodeUTF16(buffer, nbytes, nullptr, nullptr)
+                             : PyUnicode_DecodeUTF32(buffer, nbytes, nullptr, nullptr);
+#else
+        // PyPy segfaults when on PyUnicode_DecodeUTF16 (and possibly on PyUnicode_DecodeUTF32 as
+        // well), so bypass the whole thing by just passing the encoding as a string value, which
+        // works properly:
+        return PyUnicode_Decode(buffer,
+                                nbytes,
+                                UTF_N == 8    ? "utf-8"
+                                : UTF_N == 16 ? "utf-16"
+                                              : "utf-32",
+                                nullptr);
+#endif
+    }
+
+    // When loading into a std::string or char*, accept a bytes/bytearray object as-is (i.e.
+    // without any encoding/decoding attempt).  For other C++ char sizes this is a no-op.
+    // which supports loading a unicode from a str, doesn't take this path.
+    template <typename C = CharT>
+    bool load_raw(enable_if_t<std::is_same<C, char>::value, handle> src) {
+        if (PYBIND11_BYTES_CHECK(src.ptr())) {
+            // We were passed raw bytes; accept it into a std::string or char*
+            // without any encoding attempt.
+            const char *bytes = PYBIND11_BYTES_AS_STRING(src.ptr());
+            if (!bytes) {
+                pybind11_fail("Unexpected PYBIND11_BYTES_AS_STRING() failure.");
+            }
+            value = StringType(bytes, (size_t) PYBIND11_BYTES_SIZE(src.ptr()));
+            return true;
+        }
+        if (PyByteArray_Check(src.ptr())) {
+            // We were passed a bytearray; accept it into a std::string or char*
+            // without any encoding attempt.
+            const char *bytearray = PyByteArray_AsString(src.ptr());
+            if (!bytearray) {
+                pybind11_fail("Unexpected PyByteArray_AsString() failure.");
+            }
+            value = StringType(bytearray, (size_t) PyByteArray_Size(src.ptr()));
+            return true;
+        }
+
+        return false;
+    }
+
+    template <typename C = CharT>
+    bool load_raw(enable_if_t<!std::is_same<C, char>::value, handle>) {
+        return false;
+    }
+};
+
+template <typename CharT, class Traits, class Allocator>
+struct type_caster<std::basic_string<CharT, Traits, Allocator>,
+                   enable_if_t<is_std_char_type<CharT>::value>>
+    : string_caster<std::basic_string<CharT, Traits, Allocator>> {};
+
+#ifdef PYBIND11_HAS_STRING_VIEW
+template <typename CharT, class Traits>
+struct type_caster<std::basic_string_view<CharT, Traits>,
+                   enable_if_t<is_std_char_type<CharT>::value>>
+    : string_caster<std::basic_string_view<CharT, Traits>, true> {};
+#endif
+
+// Type caster for C-style strings.  We basically use a std::string type caster, but also add the
+// ability to use None as a nullptr char* (which the string caster doesn't allow).
+template <typename CharT>
+struct type_caster<CharT, enable_if_t<is_std_char_type<CharT>::value>> {
+    using StringType = std::basic_string<CharT>;
+    using StringCaster = make_caster<StringType>;
+    StringCaster str_caster;
+    bool none = false;
+    CharT one_char = 0;
+
+public:
+    bool load(handle src, bool convert) {
+        if (!src) {
+            return false;
+        }
+        if (src.is_none()) {
+            // Defer accepting None to other overloads (if we aren't in convert mode):
+            if (!convert) {
+                return false;
+            }
+            none = true;
+            return true;
+        }
+        return str_caster.load(src, convert);
+    }
+
+    static handle cast(const CharT *src, return_value_policy policy, handle parent) {
+        if (src == nullptr) {
+            return pybind11::none().release();
+        }
+        return StringCaster::cast(StringType(src), policy, parent);
+    }
+
+    static handle cast(CharT src, return_value_policy policy, handle parent) {
+        if (std::is_same<char, CharT>::value) {
+            handle s = PyUnicode_DecodeLatin1((const char *) &src, 1, nullptr);
+            if (!s) {
+                throw error_already_set();
+            }
+            return s;
+        }
+        return StringCaster::cast(StringType(1, src), policy, parent);
+    }
+
+    explicit operator CharT *() {
+        return none ? nullptr : const_cast<CharT *>(static_cast<StringType &>(str_caster).c_str());
+    }
+    explicit operator CharT &() {
+        if (none) {
+            throw value_error("Cannot convert None to a character");
+        }
+
+        auto &value = static_cast<StringType &>(str_caster);
+        size_t str_len = value.size();
+        if (str_len == 0) {
+            throw value_error("Cannot convert empty string to a character");
+        }
+
+        // If we're in UTF-8 mode, we have two possible failures: one for a unicode character that
+        // is too high, and one for multiple unicode characters (caught later), so we need to
+        // figure out how long the first encoded character is in bytes to distinguish between these
+        // two errors.  We also allow want to allow unicode characters U+0080 through U+00FF, as
+        // those can fit into a single char value.
+        if (StringCaster::UTF_N == 8 && str_len > 1 && str_len <= 4) {
+            auto v0 = static_cast<unsigned char>(value[0]);
+            // low bits only: 0-127
+            // 0b110xxxxx - start of 2-byte sequence
+            // 0b1110xxxx - start of 3-byte sequence
+            // 0b11110xxx - start of 4-byte sequence
+            size_t char0_bytes = (v0 & 0x80) == 0      ? 1
+                                 : (v0 & 0xE0) == 0xC0 ? 2
+                                 : (v0 & 0xF0) == 0xE0 ? 3
+                                                       : 4;
+
+            if (char0_bytes == str_len) {
+                // If we have a 128-255 value, we can decode it into a single char:
+                if (char0_bytes == 2 && (v0 & 0xFC) == 0xC0) { // 0x110000xx 0x10xxxxxx
+                    one_char = static_cast<CharT>(((v0 & 3) << 6)
+                                                  + (static_cast<unsigned char>(value[1]) & 0x3F));
+                    return one_char;
+                }
+                // Otherwise we have a single character, but it's > U+00FF
+                throw value_error("Character code point not in range(0x100)");
+            }
+        }
+
+        // UTF-16 is much easier: we can only have a surrogate pair for values above U+FFFF, thus a
+        // surrogate pair with total length 2 instantly indicates a range error (but not a "your
+        // string was too long" error).
+        else if (StringCaster::UTF_N == 16 && str_len == 2) {
+            one_char = static_cast<CharT>(value[0]);
+            if (one_char >= 0xD800 && one_char < 0xE000) {
+                throw value_error("Character code point not in range(0x10000)");
+            }
+        }
+
+        if (str_len != 1) {
+            throw value_error("Expected a character, but multi-character string found");
+        }
+
+        one_char = value[0];
+        return one_char;
+    }
+
+    static constexpr auto name = const_name(PYBIND11_STRING_NAME);
+    template <typename _T>
+    using cast_op_type = pybind11::detail::cast_op_type<_T>;
+};
+
+// Base implementation for std::tuple and std::pair
+template <template <typename...> class Tuple, typename... Ts>
+class tuple_caster {
+    using type = Tuple<Ts...>;
+    static constexpr auto size = sizeof...(Ts);
+    using indices = make_index_sequence<size>;
+
+public:
+    bool load(handle src, bool convert) {
+        if (!isinstance<sequence>(src)) {
+            return false;
+        }
+        const auto seq = reinterpret_borrow<sequence>(src);
+        if (seq.size() != size) {
+            return false;
+        }
+        return load_impl(seq, convert, indices{});
+    }
+
+    template <typename T>
+    static handle cast(T &&src, return_value_policy policy, handle parent) {
+        return cast_impl(std::forward<T>(src), policy, parent, indices{});
+    }
+
+    // copied from the PYBIND11_TYPE_CASTER macro
+    template <typename T>
+    static handle cast(T *src, return_value_policy policy, handle parent) {
+        if (!src) {
+            return none().release();
+        }
+        if (policy == return_value_policy::take_ownership) {
+            auto h = cast(std::move(*src), policy, parent);
+            delete src;
+            return h;
+        }
+        return cast(*src, policy, parent);
+    }
+
+    static constexpr auto name = const_name("tuple[")
+                                 + ::pybind11::detail::concat(make_caster<Ts>::name...)
+                                 + const_name("]");
+
+    template <typename T>
+    using cast_op_type = type;
+
+    explicit operator type() & { return implicit_cast(indices{}); }
+    explicit operator type() && { return std::move(*this).implicit_cast(indices{}); }
+
+protected:
+    template <size_t... Is>
+    type implicit_cast(index_sequence<Is...>) & {
+        return type(cast_op<Ts>(std::get<Is>(subcasters))...);
+    }
+    template <size_t... Is>
+    type implicit_cast(index_sequence<Is...>) && {
+        return type(cast_op<Ts>(std::move(std::get<Is>(subcasters)))...);
+    }
+
+    static constexpr bool load_impl(const sequence &, bool, index_sequence<>) { return true; }
+
+    template <size_t... Is>
+    bool load_impl(const sequence &seq, bool convert, index_sequence<Is...>) {
+#ifdef __cpp_fold_expressions
+        if ((... || !std::get<Is>(subcasters).load(seq[Is], convert))) {
+            return false;
+        }
+#else
+        for (bool r : {std::get<Is>(subcasters).load(seq[Is], convert)...}) {
+            if (!r) {
+                return false;
+            }
+        }
+#endif
+        return true;
+    }
+
+    /* Implementation: Convert a C++ tuple into a Python tuple */
+    template <typename T, size_t... Is>
+    static handle
+    cast_impl(T &&src, return_value_policy policy, handle parent, index_sequence<Is...>) {
+        PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(src, policy, parent);
+        PYBIND11_WORKAROUND_INCORRECT_GCC_UNUSED_BUT_SET_PARAMETER(policy, parent);
+        std::array<object, size> entries{{reinterpret_steal<object>(
+            make_caster<Ts>::cast(std::get<Is>(std::forward<T>(src)), policy, parent))...}};
+        for (const auto &entry : entries) {
+            if (!entry) {
+                return handle();
+            }
+        }
+        tuple result(size);
+        int counter = 0;
+        for (auto &entry : entries) {
+            PyTuple_SET_ITEM(result.ptr(), counter++, entry.release().ptr());
+        }
+        return result.release();
+    }
+
+    Tuple<make_caster<Ts>...> subcasters;
+};
+
+template <typename T1, typename T2>
+class type_caster<std::pair<T1, T2>> : public tuple_caster<std::pair, T1, T2> {};
+
+template <typename... Ts>
+class type_caster<std::tuple<Ts...>> : public tuple_caster<std::tuple, Ts...> {};
+
+/// Helper class which abstracts away certain actions. Users can provide specializations for
+/// custom holders, but it's only necessary if the type has a non-standard interface.
+template <typename T>
+struct holder_helper {
+    static auto get(const T &p) -> decltype(p.get()) { return p.get(); }
+};
+
+/// Type caster for holder types like std::shared_ptr, etc.
+/// The SFINAE hook is provided to help work around the current lack of support
+/// for smart-pointer interoperability. Please consider it an implementation
+/// detail that may change in the future, as formal support for smart-pointer
+/// interoperability is added into pybind11.
+template <typename type, typename holder_type, typename SFINAE = void>
+struct copyable_holder_caster : public type_caster_base<type> {
+public:
+    using base = type_caster_base<type>;
+    static_assert(std::is_base_of<base, type_caster<type>>::value,
+                  "Holder classes are only supported for custom types");
+    using base::base;
+    using base::cast;
+    using base::typeinfo;
+    using base::value;
+
+    bool load(handle src, bool convert) {
+        return base::template load_impl<copyable_holder_caster<type, holder_type>>(src, convert);
+    }
+
+    explicit operator type *() { return this->value; }
+    // static_cast works around compiler error with MSVC 17 and CUDA 10.2
+    // see issue #2180
+    explicit operator type &() { return *(static_cast<type *>(this->value)); }
+    explicit operator holder_type *() { return std::addressof(holder); }
+    explicit operator holder_type &() { return holder; }
+
+    static handle cast(const holder_type &src, return_value_policy, handle) {
+        const auto *ptr = holder_helper<holder_type>::get(src);
+        return type_caster_base<type>::cast_holder(ptr, &src);
+    }
+
+protected:
+    friend class type_caster_generic;
+    void check_holder_compat() {
+        if (typeinfo->default_holder) {
+            throw cast_error("Unable to load a custom holder type from a default-holder instance");
+        }
+    }
+
+    bool load_value(value_and_holder &&v_h) {
+        if (v_h.holder_constructed()) {
+            value = v_h.value_ptr();
+            holder = v_h.template holder<holder_type>();
+            return true;
+        }
+        throw cast_error("Unable to cast from non-held to held instance (T& to Holder<T>) "
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+                         "(#define PYBIND11_DETAILED_ERROR_MESSAGES or compile in debug mode for "
+                         "type information)");
+#else
+                         "of type '"
+                         + type_id<holder_type>() + "''");
+#endif
+    }
+
+    template <typename T = holder_type,
+              detail::enable_if_t<!std::is_constructible<T, const T &, type *>::value, int> = 0>
+    bool try_implicit_casts(handle, bool) {
+        return false;
+    }
+
+    template <typename T = holder_type,
+              detail::enable_if_t<std::is_constructible<T, const T &, type *>::value, int> = 0>
+    bool try_implicit_casts(handle src, bool convert) {
+        for (auto &cast : typeinfo->implicit_casts) {
+            copyable_holder_caster sub_caster(*cast.first);
+            if (sub_caster.load(src, convert)) {
+                value = cast.second(sub_caster.value);
+                holder = holder_type(sub_caster.holder, (type *) value);
+                return true;
+            }
+        }
+        return false;
+    }
+
+    static bool try_direct_conversions(handle) { return false; }
+
+    holder_type holder;
+};
+
+/// Specialize for the common std::shared_ptr, so users don't need to
+template <typename T>
+class type_caster<std::shared_ptr<T>> : public copyable_holder_caster<T, std::shared_ptr<T>> {};
+
+/// Type caster for holder types like std::unique_ptr.
+/// Please consider the SFINAE hook an implementation detail, as explained
+/// in the comment for the copyable_holder_caster.
+template <typename type, typename holder_type, typename SFINAE = void>
+struct move_only_holder_caster {
+    static_assert(std::is_base_of<type_caster_base<type>, type_caster<type>>::value,
+                  "Holder classes are only supported for custom types");
+
+    static handle cast(holder_type &&src, return_value_policy, handle) {
+        auto *ptr = holder_helper<holder_type>::get(src);
+        return type_caster_base<type>::cast_holder(ptr, std::addressof(src));
+    }
+    static constexpr auto name = type_caster_base<type>::name;
+};
+
+template <typename type, typename deleter>
+class type_caster<std::unique_ptr<type, deleter>>
+    : public move_only_holder_caster<type, std::unique_ptr<type, deleter>> {};
+
+template <typename type, typename holder_type>
+using type_caster_holder = conditional_t<is_copy_constructible<holder_type>::value,
+                                         copyable_holder_caster<type, holder_type>,
+                                         move_only_holder_caster<type, holder_type>>;
+
+template <typename T, bool Value = false>
+struct always_construct_holder {
+    static constexpr bool value = Value;
+};
+
+/// Create a specialization for custom holder types (silently ignores std::shared_ptr)
+#define PYBIND11_DECLARE_HOLDER_TYPE(type, holder_type, ...)                                      \
+    PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)                                                  \
+    namespace detail {                                                                            \
+    template <typename type>                                                                      \
+    struct always_construct_holder<holder_type> : always_construct_holder<void, ##__VA_ARGS__> {  \
+    };                                                                                            \
+    template <typename type>                                                                      \
+    class type_caster<holder_type, enable_if_t<!is_shared_ptr<holder_type>::value>>               \
+        : public type_caster_holder<type, holder_type> {};                                        \
+    }                                                                                             \
+    PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
+
+// PYBIND11_DECLARE_HOLDER_TYPE holder types:
+template <typename base, typename holder>
+struct is_holder_type
+    : std::is_base_of<detail::type_caster_holder<base, holder>, detail::type_caster<holder>> {};
+// Specialization for always-supported unique_ptr holders:
+template <typename base, typename deleter>
+struct is_holder_type<base, std::unique_ptr<base, deleter>> : std::true_type {};
+
+#ifdef PYBIND11_DISABLE_HANDLE_TYPE_NAME_DEFAULT_IMPLEMENTATION // See PR #4888
+
+// This leads to compilation errors if a specialization is missing.
+template <typename T>
+struct handle_type_name;
+
+#else
+
+template <typename T>
+struct handle_type_name {
+    static constexpr auto name = const_name<T>();
+};
+
+#endif
+
+template <>
+struct handle_type_name<object> {
+    static constexpr auto name = const_name("object");
+};
+template <>
+struct handle_type_name<list> {
+    static constexpr auto name = const_name("list");
+};
+template <>
+struct handle_type_name<dict> {
+    static constexpr auto name = const_name("dict");
+};
+template <>
+struct handle_type_name<anyset> {
+    static constexpr auto name = const_name("Union[set, frozenset]");
+};
+template <>
+struct handle_type_name<set> {
+    static constexpr auto name = const_name("set");
+};
+template <>
+struct handle_type_name<frozenset> {
+    static constexpr auto name = const_name("frozenset");
+};
+template <>
+struct handle_type_name<str> {
+    static constexpr auto name = const_name("str");
+};
+template <>
+struct handle_type_name<tuple> {
+    static constexpr auto name = const_name("tuple");
+};
+template <>
+struct handle_type_name<bool_> {
+    static constexpr auto name = const_name("bool");
+};
+template <>
+struct handle_type_name<bytes> {
+    static constexpr auto name = const_name(PYBIND11_BYTES_NAME);
+};
+template <>
+struct handle_type_name<buffer> {
+    static constexpr auto name = const_name("Buffer");
+};
+template <>
+struct handle_type_name<int_> {
+    static constexpr auto name = const_name("int");
+};
+template <>
+struct handle_type_name<iterable> {
+    static constexpr auto name = const_name("Iterable");
+};
+template <>
+struct handle_type_name<iterator> {
+    static constexpr auto name = const_name("Iterator");
+};
+template <>
+struct handle_type_name<float_> {
+    static constexpr auto name = const_name("float");
+};
+template <>
+struct handle_type_name<function> {
+    static constexpr auto name = const_name("Callable");
+};
+template <>
+struct handle_type_name<handle> {
+    static constexpr auto name = handle_type_name<object>::name;
+};
+template <>
+struct handle_type_name<none> {
+    static constexpr auto name = const_name("None");
+};
+template <>
+struct handle_type_name<sequence> {
+    static constexpr auto name = const_name("Sequence");
+};
+template <>
+struct handle_type_name<bytearray> {
+    static constexpr auto name = const_name("bytearray");
+};
+template <>
+struct handle_type_name<memoryview> {
+    static constexpr auto name = const_name("memoryview");
+};
+template <>
+struct handle_type_name<slice> {
+    static constexpr auto name = const_name("slice");
+};
+template <>
+struct handle_type_name<type> {
+    static constexpr auto name = const_name("type");
+};
+template <>
+struct handle_type_name<capsule> {
+    static constexpr auto name = const_name("capsule");
+};
+template <>
+struct handle_type_name<ellipsis> {
+    static constexpr auto name = const_name("ellipsis");
+};
+template <>
+struct handle_type_name<weakref> {
+    static constexpr auto name = const_name("weakref");
+};
+template <>
+struct handle_type_name<args> {
+    static constexpr auto name = const_name("*args");
+};
+template <>
+struct handle_type_name<kwargs> {
+    static constexpr auto name = const_name("**kwargs");
+};
+template <>
+struct handle_type_name<obj_attr_accessor> {
+    static constexpr auto name = const_name<obj_attr_accessor>();
+};
+template <>
+struct handle_type_name<str_attr_accessor> {
+    static constexpr auto name = const_name<str_attr_accessor>();
+};
+template <>
+struct handle_type_name<item_accessor> {
+    static constexpr auto name = const_name<item_accessor>();
+};
+template <>
+struct handle_type_name<sequence_accessor> {
+    static constexpr auto name = const_name<sequence_accessor>();
+};
+template <>
+struct handle_type_name<list_accessor> {
+    static constexpr auto name = const_name<list_accessor>();
+};
+template <>
+struct handle_type_name<tuple_accessor> {
+    static constexpr auto name = const_name<tuple_accessor>();
+};
+
+template <typename type>
+struct pyobject_caster {
+    template <typename T = type, enable_if_t<std::is_same<T, handle>::value, int> = 0>
+    pyobject_caster() : value() {}
+
+    // `type` may not be default constructible (e.g. frozenset, anyset).  Initializing `value`
+    // to a nil handle is safe since it will only be accessed if `load` succeeds.
+    template <typename T = type, enable_if_t<std::is_base_of<object, T>::value, int> = 0>
+    pyobject_caster() : value(reinterpret_steal<type>(handle())) {}
+
+    template <typename T = type, enable_if_t<std::is_same<T, handle>::value, int> = 0>
+    bool load(handle src, bool /* convert */) {
+        value = src;
+        return static_cast<bool>(value);
+    }
+
+    template <typename T = type, enable_if_t<std::is_base_of<object, T>::value, int> = 0>
+    bool load(handle src, bool /* convert */) {
+        if (!isinstance<type>(src)) {
+            return false;
+        }
+        value = reinterpret_borrow<type>(src);
+        return true;
+    }
+
+    static handle cast(const handle &src, return_value_policy /* policy */, handle /* parent */) {
+        return src.inc_ref();
+    }
+    PYBIND11_TYPE_CASTER(type, handle_type_name<type>::name);
+};
+
+template <typename T>
+class type_caster<T, enable_if_t<is_pyobject<T>::value>> : public pyobject_caster<T> {};
+
+// Our conditions for enabling moving are quite restrictive:
+// At compile time:
+// - T needs to be a non-const, non-pointer, non-reference type
+// - type_caster<T>::operator T&() must exist
+// - the type must be move constructible (obviously)
+// At run-time:
+// - if the type is non-copy-constructible, the object must be the sole owner of the type (i.e. it
+//   must have ref_count() == 1)h
+// If any of the above are not satisfied, we fall back to copying.
+template <typename T>
+using move_is_plain_type
+    = satisfies_none_of<T, std::is_void, std::is_pointer, std::is_reference, std::is_const>;
+template <typename T, typename SFINAE = void>
+struct move_always : std::false_type {};
+template <typename T>
+struct move_always<
+    T,
+    enable_if_t<
+        all_of<move_is_plain_type<T>,
+               negation<is_copy_constructible<T>>,
+               is_move_constructible<T>,
+               std::is_same<decltype(std::declval<make_caster<T>>().operator T &()), T &>>::value>>
+    : std::true_type {};
+template <typename T, typename SFINAE = void>
+struct move_if_unreferenced : std::false_type {};
+template <typename T>
+struct move_if_unreferenced<
+    T,
+    enable_if_t<
+        all_of<move_is_plain_type<T>,
+               negation<move_always<T>>,
+               is_move_constructible<T>,
+               std::is_same<decltype(std::declval<make_caster<T>>().operator T &()), T &>>::value>>
+    : std::true_type {};
+template <typename T>
+using move_never = none_of<move_always<T>, move_if_unreferenced<T>>;
+
+// Detect whether returning a `type` from a cast on type's type_caster is going to result in a
+// reference or pointer to a local variable of the type_caster.  Basically, only
+// non-reference/pointer `type`s and reference/pointers from a type_caster_generic are safe;
+// everything else returns a reference/pointer to a local variable.
+template <typename type>
+using cast_is_temporary_value_reference
+    = bool_constant<(std::is_reference<type>::value || std::is_pointer<type>::value)
+                    && !std::is_base_of<type_caster_generic, make_caster<type>>::value
+                    && !std::is_same<intrinsic_t<type>, void>::value>;
+
+// When a value returned from a C++ function is being cast back to Python, we almost always want to
+// force `policy = move`, regardless of the return value policy the function/method was declared
+// with.
+template <typename Return, typename SFINAE = void>
+struct return_value_policy_override {
+    static return_value_policy policy(return_value_policy p) { return p; }
+};
+
+template <typename Return>
+struct return_value_policy_override<
+    Return,
+    detail::enable_if_t<std::is_base_of<type_caster_generic, make_caster<Return>>::value, void>> {
+    static return_value_policy policy(return_value_policy p) {
+        return !std::is_lvalue_reference<Return>::value && !std::is_pointer<Return>::value
+                   ? return_value_policy::move
+                   : p;
+    }
+};
+
+// Basic python -> C++ casting; throws if casting fails
+template <typename T, typename SFINAE>
+type_caster<T, SFINAE> &load_type(type_caster<T, SFINAE> &conv, const handle &handle) {
+    static_assert(!detail::is_pyobject<T>::value,
+                  "Internal error: type_caster should only be used for C++ types");
+    if (!conv.load(handle, true)) {
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+        throw cast_error(
+            "Unable to cast Python instance of type "
+            + str(type::handle_of(handle)).cast<std::string>()
+            + " to C++ type '?' (#define "
+              "PYBIND11_DETAILED_ERROR_MESSAGES or compile in debug mode for details)");
+#else
+        throw cast_error("Unable to cast Python instance of type "
+                         + str(type::handle_of(handle)).cast<std::string>() + " to C++ type '"
+                         + type_id<T>() + "'");
+#endif
+    }
+    return conv;
+}
+// Wrapper around the above that also constructs and returns a type_caster
+template <typename T>
+make_caster<T> load_type(const handle &handle) {
+    make_caster<T> conv;
+    load_type(conv, handle);
+    return conv;
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+// pytype -> C++ type
+template <typename T,
+          detail::enable_if_t<!detail::is_pyobject<T>::value
+                                  && !detail::is_same_ignoring_cvref<T, PyObject *>::value,
+                              int>
+          = 0>
+T cast(const handle &handle) {
+    using namespace detail;
+    static_assert(!cast_is_temporary_value_reference<T>::value,
+                  "Unable to cast type to reference: value is local to type caster");
+    return cast_op<T>(load_type<T>(handle));
+}
+
+// pytype -> pytype (calls converting constructor)
+template <typename T, detail::enable_if_t<detail::is_pyobject<T>::value, int> = 0>
+T cast(const handle &handle) {
+    return T(reinterpret_borrow<object>(handle));
+}
+
+// Note that `cast<PyObject *>(obj)` increments the reference count of `obj`.
+// This is necessary for the case that `obj` is a temporary, and could
+// not possibly be different, given
+// 1. the established convention that the passed `handle` is borrowed, and
+// 2. we don't want to force all generic code using `cast<T>()` to special-case
+//    handling of `T` = `PyObject *` (to increment the reference count there).
+// It is the responsibility of the caller to ensure that the reference count
+// is decremented.
+template <typename T,
+          typename Handle,
+          detail::enable_if_t<detail::is_same_ignoring_cvref<T, PyObject *>::value
+                                  && detail::is_same_ignoring_cvref<Handle, handle>::value,
+                              int>
+          = 0>
+T cast(Handle &&handle) {
+    return handle.inc_ref().ptr();
+}
+// To optimize way an inc_ref/dec_ref cycle:
+template <typename T,
+          typename Object,
+          detail::enable_if_t<detail::is_same_ignoring_cvref<T, PyObject *>::value
+                                  && detail::is_same_ignoring_cvref<Object, object>::value,
+                              int>
+          = 0>
+T cast(Object &&obj) {
+    return obj.release().ptr();
+}
+
+// C++ type -> py::object
+template <typename T, detail::enable_if_t<!detail::is_pyobject<T>::value, int> = 0>
+object cast(T &&value,
+            return_value_policy policy = return_value_policy::automatic_reference,
+            handle parent = handle()) {
+    using no_ref_T = typename std::remove_reference<T>::type;
+    if (policy == return_value_policy::automatic) {
+        policy = std::is_pointer<no_ref_T>::value     ? return_value_policy::take_ownership
+                 : std::is_lvalue_reference<T>::value ? return_value_policy::copy
+                                                      : return_value_policy::move;
+    } else if (policy == return_value_policy::automatic_reference) {
+        policy = std::is_pointer<no_ref_T>::value     ? return_value_policy::reference
+                 : std::is_lvalue_reference<T>::value ? return_value_policy::copy
+                                                      : return_value_policy::move;
+    }
+    return reinterpret_steal<object>(
+        detail::make_caster<T>::cast(std::forward<T>(value), policy, parent));
+}
+
+template <typename T>
+T handle::cast() const {
+    return pybind11::cast<T>(*this);
+}
+template <>
+inline void handle::cast() const {
+    return;
+}
+
+template <typename T>
+detail::enable_if_t<!detail::move_never<T>::value, T> move(object &&obj) {
+    if (obj.ref_count() > 1) {
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+        throw cast_error(
+            "Unable to cast Python " + str(type::handle_of(obj)).cast<std::string>()
+            + " instance to C++ rvalue: instance has multiple references"
+              " (#define PYBIND11_DETAILED_ERROR_MESSAGES or compile in debug mode for details)");
+#else
+        throw cast_error("Unable to move from Python "
+                         + str(type::handle_of(obj)).cast<std::string>() + " instance to C++ "
+                         + type_id<T>() + " instance: instance has multiple references");
+#endif
+    }
+
+    // Move into a temporary and return that, because the reference may be a local value of `conv`
+    T ret = std::move(detail::load_type<T>(obj).operator T &());
+    return ret;
+}
+
+// Calling cast() on an rvalue calls pybind11::cast with the object rvalue, which does:
+// - If we have to move (because T has no copy constructor), do it.  This will fail if the moved
+//   object has multiple references, but trying to copy will fail to compile.
+// - If both movable and copyable, check ref count: if 1, move; otherwise copy
+// - Otherwise (not movable), copy.
+template <typename T>
+detail::enable_if_t<!detail::is_pyobject<T>::value && detail::move_always<T>::value, T>
+cast(object &&object) {
+    return move<T>(std::move(object));
+}
+template <typename T>
+detail::enable_if_t<!detail::is_pyobject<T>::value && detail::move_if_unreferenced<T>::value, T>
+cast(object &&object) {
+    if (object.ref_count() > 1) {
+        return cast<T>(object);
+    }
+    return move<T>(std::move(object));
+}
+template <typename T>
+detail::enable_if_t<!detail::is_pyobject<T>::value && detail::move_never<T>::value, T>
+cast(object &&object) {
+    return cast<T>(object);
+}
+
+// pytype rvalue -> pytype (calls converting constructor)
+template <typename T>
+detail::enable_if_t<detail::is_pyobject<T>::value, T> cast(object &&object) {
+    return T(std::move(object));
+}
+
+template <typename T>
+T object::cast() const & {
+    return pybind11::cast<T>(*this);
+}
+template <typename T>
+T object::cast() && {
+    return pybind11::cast<T>(std::move(*this));
+}
+template <>
+inline void object::cast() const & {
+    return;
+}
+template <>
+inline void object::cast() && {
+    return;
+}
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+// Declared in pytypes.h:
+template <typename T, enable_if_t<!is_pyobject<T>::value, int>>
+object object_or_cast(T &&o) {
+    return pybind11::cast(std::forward<T>(o));
+}
+
+// Placeholder type for the unneeded (and dead code) static variable in the
+// PYBIND11_OVERRIDE_OVERRIDE macro
+struct override_unused {};
+template <typename ret_type>
+using override_caster_t = conditional_t<cast_is_temporary_value_reference<ret_type>::value,
+                                        make_caster<ret_type>,
+                                        override_unused>;
+
+// Trampoline use: for reference/pointer types to value-converted values, we do a value cast, then
+// store the result in the given variable.  For other types, this is a no-op.
+template <typename T>
+enable_if_t<cast_is_temporary_value_reference<T>::value, T> cast_ref(object &&o,
+                                                                     make_caster<T> &caster) {
+    return cast_op<T>(load_type(caster, o));
+}
+template <typename T>
+enable_if_t<!cast_is_temporary_value_reference<T>::value, T> cast_ref(object &&,
+                                                                      override_unused &) {
+    pybind11_fail("Internal error: cast_ref fallback invoked");
+}
+
+// Trampoline use: Having a pybind11::cast with an invalid reference type is going to
+// static_assert, even though if it's in dead code, so we provide a "trampoline" to pybind11::cast
+// that only does anything in cases where pybind11::cast is valid.
+template <typename T>
+enable_if_t<cast_is_temporary_value_reference<T>::value
+                && !detail::is_same_ignoring_cvref<T, PyObject *>::value,
+            T>
+cast_safe(object &&) {
+    pybind11_fail("Internal error: cast_safe fallback invoked");
+}
+template <typename T>
+enable_if_t<std::is_void<T>::value, void> cast_safe(object &&) {}
+template <typename T>
+enable_if_t<detail::is_same_ignoring_cvref<T, PyObject *>::value, PyObject *>
+cast_safe(object &&o) {
+    return o.release().ptr();
+}
+template <typename T>
+enable_if_t<detail::none_of<cast_is_temporary_value_reference<T>,
+                            detail::is_same_ignoring_cvref<T, PyObject *>,
+                            std::is_void<T>>::value,
+            T>
+cast_safe(object &&o) {
+    return pybind11::cast<T>(std::move(o));
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+// The overloads could coexist, i.e. the #if is not strictly speaking needed,
+// but it is an easy minor optimization.
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+inline cast_error cast_error_unable_to_convert_call_arg(const std::string &name) {
+    return cast_error("Unable to convert call argument '" + name
+                      + "' to Python object (#define "
+                        "PYBIND11_DETAILED_ERROR_MESSAGES or compile in debug mode for details)");
+}
+#else
+inline cast_error cast_error_unable_to_convert_call_arg(const std::string &name,
+                                                        const std::string &type) {
+    return cast_error("Unable to convert call argument '" + name + "' of type '" + type
+                      + "' to Python object");
+}
+#endif
+
+template <return_value_policy policy = return_value_policy::automatic_reference>
+tuple make_tuple() {
+    return tuple(0);
+}
+
+template <return_value_policy policy = return_value_policy::automatic_reference, typename... Args>
+tuple make_tuple(Args &&...args_) {
+    constexpr size_t size = sizeof...(Args);
+    std::array<object, size> args{{reinterpret_steal<object>(
+        detail::make_caster<Args>::cast(std::forward<Args>(args_), policy, nullptr))...}};
+    for (size_t i = 0; i < args.size(); i++) {
+        if (!args[i]) {
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+            throw cast_error_unable_to_convert_call_arg(std::to_string(i));
+#else
+            std::array<std::string, size> argtypes{{type_id<Args>()...}};
+            throw cast_error_unable_to_convert_call_arg(std::to_string(i), argtypes[i]);
+#endif
+        }
+    }
+    tuple result(size);
+    int counter = 0;
+    for (auto &arg_value : args) {
+        PyTuple_SET_ITEM(result.ptr(), counter++, arg_value.release().ptr());
+    }
+    return result;
+}
+
+/// \ingroup annotations
+/// Annotation for arguments
+struct arg {
+    /// Constructs an argument with the name of the argument; if null or omitted, this is a
+    /// positional argument.
+    constexpr explicit arg(const char *name = nullptr)
+        : name(name), flag_noconvert(false), flag_none(true) {}
+    /// Assign a value to this argument
+    template <typename T>
+    arg_v operator=(T &&value) const;
+    /// Indicate that the type should not be converted in the type caster
+    arg &noconvert(bool flag = true) {
+        flag_noconvert = flag;
+        return *this;
+    }
+    /// Indicates that the argument should/shouldn't allow None (e.g. for nullable pointer args)
+    arg &none(bool flag = true) {
+        flag_none = flag;
+        return *this;
+    }
+
+    const char *name;        ///< If non-null, this is a named kwargs argument
+    bool flag_noconvert : 1; ///< If set, do not allow conversion (requires a supporting type
+                             ///< caster!)
+    bool flag_none : 1;      ///< If set (the default), allow None to be passed to this argument
+};
+
+/// \ingroup annotations
+/// Annotation for arguments with values
+struct arg_v : arg {
+private:
+    template <typename T>
+    arg_v(arg &&base, T &&x, const char *descr = nullptr)
+        : arg(base), value(reinterpret_steal<object>(detail::make_caster<T>::cast(
+                         std::forward<T>(x), return_value_policy::automatic, {}))),
+          descr(descr)
+#if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+          ,
+          type(type_id<T>())
+#endif
+    {
+        // Workaround! See:
+        // https://github.com/pybind/pybind11/issues/2336
+        // https://github.com/pybind/pybind11/pull/2685#issuecomment-731286700
+        if (PyErr_Occurred()) {
+            PyErr_Clear();
+        }
+    }
+
+public:
+    /// Direct construction with name, default, and description
+    template <typename T>
+    arg_v(const char *name, T &&x, const char *descr = nullptr)
+        : arg_v(arg(name), std::forward<T>(x), descr) {}
+
+    /// Called internally when invoking `py::arg("a") = value`
+    template <typename T>
+    arg_v(const arg &base, T &&x, const char *descr = nullptr)
+        : arg_v(arg(base), std::forward<T>(x), descr) {}
+
+    /// Same as `arg::noconvert()`, but returns *this as arg_v&, not arg&
+    arg_v &noconvert(bool flag = true) {
+        arg::noconvert(flag);
+        return *this;
+    }
+
+    /// Same as `arg::nonone()`, but returns *this as arg_v&, not arg&
+    arg_v &none(bool flag = true) {
+        arg::none(flag);
+        return *this;
+    }
+
+    /// The default value
+    object value;
+    /// The (optional) description of the default value
+    const char *descr;
+#if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+    /// The C++ type name of the default value (only available when compiled in debug mode)
+    std::string type;
+#endif
+};
+
+/// \ingroup annotations
+/// Annotation indicating that all following arguments are keyword-only; the is the equivalent of
+/// an unnamed '*' argument
+struct kw_only {};
+
+/// \ingroup annotations
+/// Annotation indicating that all previous arguments are positional-only; the is the equivalent of
+/// an unnamed '/' argument (in Python 3.8)
+struct pos_only {};
+
+template <typename T>
+arg_v arg::operator=(T &&value) const {
+    return {*this, std::forward<T>(value)};
+}
+
+/// Alias for backward compatibility -- to be removed in version 2.0
+template <typename /*unused*/>
+using arg_t = arg_v;
+
+inline namespace literals {
+/** \rst
+    String literal version of `arg`
+ \endrst */
+constexpr arg
+#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ < 5
+operator"" _a // gcc 4.8.5 insists on having a space (hard error).
+#else
+operator""_a // clang 17 generates a deprecation warning if there is a space.
+#endif
+    (const char *name, size_t) {
+    return arg(name);
+}
+} // namespace literals
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <typename T>
+using is_kw_only = std::is_same<intrinsic_t<T>, kw_only>;
+template <typename T>
+using is_pos_only = std::is_same<intrinsic_t<T>, pos_only>;
+
+// forward declaration (definition in attr.h)
+struct function_record;
+
+/// Internal data associated with a single function call
+struct function_call {
+    function_call(const function_record &f, handle p); // Implementation in attr.h
+
+    /// The function data:
+    const function_record &func;
+
+    /// Arguments passed to the function:
+    std::vector<handle> args;
+
+    /// The `convert` value the arguments should be loaded with
+    std::vector<bool> args_convert;
+
+    /// Extra references for the optional `py::args` and/or `py::kwargs` arguments (which, if
+    /// present, are also in `args` but without a reference).
+    object args_ref, kwargs_ref;
+
+    /// The parent, if any
+    handle parent;
+
+    /// If this is a call to an initializer, this argument contains `self`
+    handle init_self;
+};
+
+/// Helper class which loads arguments for C++ functions called from Python
+template <typename... Args>
+class argument_loader {
+    using indices = make_index_sequence<sizeof...(Args)>;
+
+    template <typename Arg>
+    using argument_is_args = std::is_same<intrinsic_t<Arg>, args>;
+    template <typename Arg>
+    using argument_is_kwargs = std::is_same<intrinsic_t<Arg>, kwargs>;
+    // Get kwargs argument position, or -1 if not present:
+    static constexpr auto kwargs_pos = constexpr_last<argument_is_kwargs, Args...>();
+
+    static_assert(kwargs_pos == -1 || kwargs_pos == (int) sizeof...(Args) - 1,
+                  "py::kwargs is only permitted as the last argument of a function");
+
+public:
+    static constexpr bool has_kwargs = kwargs_pos != -1;
+
+    // py::args argument position; -1 if not present.
+    static constexpr int args_pos = constexpr_last<argument_is_args, Args...>();
+
+    static_assert(args_pos == -1 || args_pos == constexpr_first<argument_is_args, Args...>(),
+                  "py::args cannot be specified more than once");
+
+    static constexpr auto arg_names
+        = ::pybind11::detail::concat(type_descr(make_caster<Args>::name)...);
+
+    bool load_args(function_call &call) { return load_impl_sequence(call, indices{}); }
+
+    template <typename Return, typename Guard, typename Func>
+    // NOLINTNEXTLINE(readability-const-return-type)
+    enable_if_t<!std::is_void<Return>::value, Return> call(Func &&f) && {
+        return std::move(*this).template call_impl<remove_cv_t<Return>>(
+            std::forward<Func>(f), indices{}, Guard{});
+    }
+
+    template <typename Return, typename Guard, typename Func>
+    enable_if_t<std::is_void<Return>::value, void_type> call(Func &&f) && {
+        std::move(*this).template call_impl<remove_cv_t<Return>>(
+            std::forward<Func>(f), indices{}, Guard{});
+        return void_type();
+    }
+
+private:
+    static bool load_impl_sequence(function_call &, index_sequence<>) { return true; }
+
+    template <size_t... Is>
+    bool load_impl_sequence(function_call &call, index_sequence<Is...>) {
+#ifdef __cpp_fold_expressions
+        if ((... || !std::get<Is>(argcasters).load(call.args[Is], call.args_convert[Is]))) {
+            return false;
+        }
+#else
+        for (bool r : {std::get<Is>(argcasters).load(call.args[Is], call.args_convert[Is])...}) {
+            if (!r) {
+                return false;
+            }
+        }
+#endif
+        return true;
+    }
+
+    template <typename Return, typename Func, size_t... Is, typename Guard>
+    Return call_impl(Func &&f, index_sequence<Is...>, Guard &&) && {
+        return std::forward<Func>(f)(cast_op<Args>(std::move(std::get<Is>(argcasters)))...);
+    }
+
+    std::tuple<make_caster<Args>...> argcasters;
+};
+
+/// Helper class which collects only positional arguments for a Python function call.
+/// A fancier version below can collect any argument, but this one is optimal for simple calls.
+template <return_value_policy policy>
+class simple_collector {
+public:
+    template <typename... Ts>
+    explicit simple_collector(Ts &&...values)
+        : m_args(pybind11::make_tuple<policy>(std::forward<Ts>(values)...)) {}
+
+    const tuple &args() const & { return m_args; }
+    dict kwargs() const { return {}; }
+
+    tuple args() && { return std::move(m_args); }
+
+    /// Call a Python function and pass the collected arguments
+    object call(PyObject *ptr) const {
+        PyObject *result = PyObject_CallObject(ptr, m_args.ptr());
+        if (!result) {
+            throw error_already_set();
+        }
+        return reinterpret_steal<object>(result);
+    }
+
+private:
+    tuple m_args;
+};
+
+/// Helper class which collects positional, keyword, * and ** arguments for a Python function call
+template <return_value_policy policy>
+class unpacking_collector {
+public:
+    template <typename... Ts>
+    explicit unpacking_collector(Ts &&...values) {
+        // Tuples aren't (easily) resizable so a list is needed for collection,
+        // but the actual function call strictly requires a tuple.
+        auto args_list = list();
+        using expander = int[];
+        (void) expander{0, (process(args_list, std::forward<Ts>(values)), 0)...};
+
+        m_args = std::move(args_list);
+    }
+
+    const tuple &args() const & { return m_args; }
+    const dict &kwargs() const & { return m_kwargs; }
+
+    tuple args() && { return std::move(m_args); }
+    dict kwargs() && { return std::move(m_kwargs); }
+
+    /// Call a Python function and pass the collected arguments
+    object call(PyObject *ptr) const {
+        PyObject *result = PyObject_Call(ptr, m_args.ptr(), m_kwargs.ptr());
+        if (!result) {
+            throw error_already_set();
+        }
+        return reinterpret_steal<object>(result);
+    }
+
+private:
+    template <typename T>
+    void process(list &args_list, T &&x) {
+        auto o = reinterpret_steal<object>(
+            detail::make_caster<T>::cast(std::forward<T>(x), policy, {}));
+        if (!o) {
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+            throw cast_error_unable_to_convert_call_arg(std::to_string(args_list.size()));
+#else
+            throw cast_error_unable_to_convert_call_arg(std::to_string(args_list.size()),
+                                                        type_id<T>());
+#endif
+        }
+        args_list.append(std::move(o));
+    }
+
+    void process(list &args_list, detail::args_proxy ap) {
+        for (auto a : ap) {
+            args_list.append(a);
+        }
+    }
+
+    void process(list & /*args_list*/, arg_v a) {
+        if (!a.name) {
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+            nameless_argument_error();
+#else
+            nameless_argument_error(a.type);
+#endif
+        }
+        if (m_kwargs.contains(a.name)) {
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+            multiple_values_error();
+#else
+            multiple_values_error(a.name);
+#endif
+        }
+        if (!a.value) {
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+            throw cast_error_unable_to_convert_call_arg(a.name);
+#else
+            throw cast_error_unable_to_convert_call_arg(a.name, a.type);
+#endif
+        }
+        m_kwargs[a.name] = std::move(a.value);
+    }
+
+    void process(list & /*args_list*/, detail::kwargs_proxy kp) {
+        if (!kp) {
+            return;
+        }
+        for (auto k : reinterpret_borrow<dict>(kp)) {
+            if (m_kwargs.contains(k.first)) {
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+                multiple_values_error();
+#else
+                multiple_values_error(str(k.first));
+#endif
+            }
+            m_kwargs[k.first] = k.second;
+        }
+    }
+
+    [[noreturn]] static void nameless_argument_error() {
+        throw type_error(
+            "Got kwargs without a name; only named arguments "
+            "may be passed via py::arg() to a python function call. "
+            "(#define PYBIND11_DETAILED_ERROR_MESSAGES or compile in debug mode for details)");
+    }
+    [[noreturn]] static void nameless_argument_error(const std::string &type) {
+        throw type_error("Got kwargs without a name of type '" + type
+                         + "'; only named "
+                           "arguments may be passed via py::arg() to a python function call. ");
+    }
+    [[noreturn]] static void multiple_values_error() {
+        throw type_error(
+            "Got multiple values for keyword argument "
+            "(#define PYBIND11_DETAILED_ERROR_MESSAGES or compile in debug mode for details)");
+    }
+
+    [[noreturn]] static void multiple_values_error(const std::string &name) {
+        throw type_error("Got multiple values for keyword argument '" + name + "'");
+    }
+
+private:
+    tuple m_args;
+    dict m_kwargs;
+};
+
+// [workaround(intel)] Separate function required here
+// We need to put this into a separate function because the Intel compiler
+// fails to compile enable_if_t<!all_of<is_positional<Args>...>::value>
+// (tested with ICC 2021.1 Beta 20200827).
+template <typename... Args>
+constexpr bool args_are_all_positional() {
+    return all_of<is_positional<Args>...>::value;
+}
+
+/// Collect only positional arguments for a Python function call
+template <return_value_policy policy,
+          typename... Args,
+          typename = enable_if_t<args_are_all_positional<Args...>()>>
+simple_collector<policy> collect_arguments(Args &&...args) {
+    return simple_collector<policy>(std::forward<Args>(args)...);
+}
+
+/// Collect all arguments, including keywords and unpacking (only instantiated when needed)
+template <return_value_policy policy,
+          typename... Args,
+          typename = enable_if_t<!args_are_all_positional<Args...>()>>
+unpacking_collector<policy> collect_arguments(Args &&...args) {
+    // Following argument order rules for generalized unpacking according to PEP 448
+    static_assert(constexpr_last<is_positional, Args...>()
+                          < constexpr_first<is_keyword_or_ds, Args...>()
+                      && constexpr_last<is_s_unpacking, Args...>()
+                             < constexpr_first<is_ds_unpacking, Args...>(),
+                  "Invalid function call: positional args must precede keywords and ** unpacking; "
+                  "* unpacking must precede ** unpacking");
+    return unpacking_collector<policy>(std::forward<Args>(args)...);
+}
+
+template <typename Derived>
+template <return_value_policy policy, typename... Args>
+object object_api<Derived>::operator()(Args &&...args) const {
+#ifndef NDEBUG
+    if (!PyGILState_Check()) {
+        pybind11_fail("pybind11::object_api<>::operator() PyGILState_Check() failure.");
+    }
+#endif
+    return detail::collect_arguments<policy>(std::forward<Args>(args)...).call(derived().ptr());
+}
+
+template <typename Derived>
+template <return_value_policy policy, typename... Args>
+object object_api<Derived>::call(Args &&...args) const {
+    return operator()<policy>(std::forward<Args>(args)...);
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+template <typename T>
+handle type::handle_of() {
+    static_assert(std::is_base_of<detail::type_caster_generic, detail::make_caster<T>>::value,
+                  "py::type::of<T> only supports the case where T is a registered C++ types.");
+
+    return detail::get_type_handle(typeid(T), true);
+}
+
+#define PYBIND11_MAKE_OPAQUE(...)                                                                 \
+    PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)                                                  \
+    namespace detail {                                                                            \
+    template <>                                                                                   \
+    class type_caster<__VA_ARGS__> : public type_caster_base<__VA_ARGS__> {};                     \
+    }                                                                                             \
+    PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
+
+/// Lets you pass a type containing a `,` through a macro parameter without needing a separate
+/// typedef, e.g.:
+/// `PYBIND11_OVERRIDE(PYBIND11_TYPE(ReturnType<A, B>), PYBIND11_TYPE(Parent<C, D>), f, arg)`
+#define PYBIND11_TYPE(...) __VA_ARGS__
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/chrono.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/chrono.h
new file mode 100644
index 0000000000..167ea0e3d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/chrono.h
@@ -0,0 +1,225 @@
+/*
+    pybind11/chrono.h: Transparent conversion between std::chrono and python's datetime
+
+    Copyright (c) 2016 Trent Houliston <trent@houliston.me> and
+                       Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "pybind11.h"
+
+#include <chrono>
+#include <cmath>
+#include <ctime>
+#include <datetime.h>
+#include <mutex>
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <typename type>
+class duration_caster {
+public:
+    using rep = typename type::rep;
+    using period = typename type::period;
+
+    // signed 25 bits required by the standard.
+    using days = std::chrono::duration<int_least32_t, std::ratio<86400>>;
+
+    bool load(handle src, bool) {
+        using namespace std::chrono;
+
+        // Lazy initialise the PyDateTime import
+        if (!PyDateTimeAPI) {
+            PyDateTime_IMPORT;
+        }
+
+        if (!src) {
+            return false;
+        }
+        // If invoked with datetime.delta object
+        if (PyDelta_Check(src.ptr())) {
+            value = type(duration_cast<duration<rep, period>>(
+                days(PyDateTime_DELTA_GET_DAYS(src.ptr()))
+                + seconds(PyDateTime_DELTA_GET_SECONDS(src.ptr()))
+                + microseconds(PyDateTime_DELTA_GET_MICROSECONDS(src.ptr()))));
+            return true;
+        }
+        // If invoked with a float we assume it is seconds and convert
+        if (PyFloat_Check(src.ptr())) {
+            value = type(duration_cast<duration<rep, period>>(
+                duration<double>(PyFloat_AsDouble(src.ptr()))));
+            return true;
+        }
+        return false;
+    }
+
+    // If this is a duration just return it back
+    static const std::chrono::duration<rep, period> &
+    get_duration(const std::chrono::duration<rep, period> &src) {
+        return src;
+    }
+
+    // If this is a time_point get the time_since_epoch
+    template <typename Clock>
+    static std::chrono::duration<rep, period>
+    get_duration(const std::chrono::time_point<Clock, std::chrono::duration<rep, period>> &src) {
+        return src.time_since_epoch();
+    }
+
+    static handle cast(const type &src, return_value_policy /* policy */, handle /* parent */) {
+        using namespace std::chrono;
+
+        // Use overloaded function to get our duration from our source
+        // Works out if it is a duration or time_point and get the duration
+        auto d = get_duration(src);
+
+        // Lazy initialise the PyDateTime import
+        if (!PyDateTimeAPI) {
+            PyDateTime_IMPORT;
+        }
+
+        // Declare these special duration types so the conversions happen with the correct
+        // primitive types (int)
+        using dd_t = duration<int, std::ratio<86400>>;
+        using ss_t = duration<int, std::ratio<1>>;
+        using us_t = duration<int, std::micro>;
+
+        auto dd = duration_cast<dd_t>(d);
+        auto subd = d - dd;
+        auto ss = duration_cast<ss_t>(subd);
+        auto us = duration_cast<us_t>(subd - ss);
+        return PyDelta_FromDSU(dd.count(), ss.count(), us.count());
+    }
+
+    PYBIND11_TYPE_CASTER(type, const_name("datetime.timedelta"));
+};
+
+inline std::tm *localtime_thread_safe(const std::time_t *time, std::tm *buf) {
+#if (defined(__STDC_LIB_EXT1__) && defined(__STDC_WANT_LIB_EXT1__)) || defined(_MSC_VER)
+    if (localtime_s(buf, time))
+        return nullptr;
+    return buf;
+#else
+    static std::mutex mtx;
+    std::lock_guard<std::mutex> lock(mtx);
+    std::tm *tm_ptr = std::localtime(time);
+    if (tm_ptr != nullptr) {
+        *buf = *tm_ptr;
+    }
+    return tm_ptr;
+#endif
+}
+
+// This is for casting times on the system clock into datetime.datetime instances
+template <typename Duration>
+class type_caster<std::chrono::time_point<std::chrono::system_clock, Duration>> {
+public:
+    using type = std::chrono::time_point<std::chrono::system_clock, Duration>;
+    bool load(handle src, bool) {
+        using namespace std::chrono;
+
+        // Lazy initialise the PyDateTime import
+        if (!PyDateTimeAPI) {
+            PyDateTime_IMPORT;
+        }
+
+        if (!src) {
+            return false;
+        }
+
+        std::tm cal;
+        microseconds msecs;
+
+        if (PyDateTime_Check(src.ptr())) {
+            cal.tm_sec = PyDateTime_DATE_GET_SECOND(src.ptr());
+            cal.tm_min = PyDateTime_DATE_GET_MINUTE(src.ptr());
+            cal.tm_hour = PyDateTime_DATE_GET_HOUR(src.ptr());
+            cal.tm_mday = PyDateTime_GET_DAY(src.ptr());
+            cal.tm_mon = PyDateTime_GET_MONTH(src.ptr()) - 1;
+            cal.tm_year = PyDateTime_GET_YEAR(src.ptr()) - 1900;
+            cal.tm_isdst = -1;
+            msecs = microseconds(PyDateTime_DATE_GET_MICROSECOND(src.ptr()));
+        } else if (PyDate_Check(src.ptr())) {
+            cal.tm_sec = 0;
+            cal.tm_min = 0;
+            cal.tm_hour = 0;
+            cal.tm_mday = PyDateTime_GET_DAY(src.ptr());
+            cal.tm_mon = PyDateTime_GET_MONTH(src.ptr()) - 1;
+            cal.tm_year = PyDateTime_GET_YEAR(src.ptr()) - 1900;
+            cal.tm_isdst = -1;
+            msecs = microseconds(0);
+        } else if (PyTime_Check(src.ptr())) {
+            cal.tm_sec = PyDateTime_TIME_GET_SECOND(src.ptr());
+            cal.tm_min = PyDateTime_TIME_GET_MINUTE(src.ptr());
+            cal.tm_hour = PyDateTime_TIME_GET_HOUR(src.ptr());
+            cal.tm_mday = 1;  // This date (day, month, year) = (1, 0, 70)
+            cal.tm_mon = 0;   // represents 1-Jan-1970, which is the first
+            cal.tm_year = 70; // earliest available date for Python's datetime
+            cal.tm_isdst = -1;
+            msecs = microseconds(PyDateTime_TIME_GET_MICROSECOND(src.ptr()));
+        } else {
+            return false;
+        }
+
+        value = time_point_cast<Duration>(system_clock::from_time_t(std::mktime(&cal)) + msecs);
+        return true;
+    }
+
+    static handle cast(const std::chrono::time_point<std::chrono::system_clock, Duration> &src,
+                       return_value_policy /* policy */,
+                       handle /* parent */) {
+        using namespace std::chrono;
+
+        // Lazy initialise the PyDateTime import
+        if (!PyDateTimeAPI) {
+            PyDateTime_IMPORT;
+        }
+
+        // Get out microseconds, and make sure they are positive, to avoid bug in eastern
+        // hemisphere time zones (cfr. https://github.com/pybind/pybind11/issues/2417)
+        using us_t = duration<int, std::micro>;
+        auto us = duration_cast<us_t>(src.time_since_epoch() % seconds(1));
+        if (us.count() < 0) {
+            us += seconds(1);
+        }
+
+        // Subtract microseconds BEFORE `system_clock::to_time_t`, because:
+        // > If std::time_t has lower precision, it is implementation-defined whether the value is
+        // rounded or truncated. (https://en.cppreference.com/w/cpp/chrono/system_clock/to_time_t)
+        std::time_t tt
+            = system_clock::to_time_t(time_point_cast<system_clock::duration>(src - us));
+
+        std::tm localtime;
+        std::tm *localtime_ptr = localtime_thread_safe(&tt, &localtime);
+        if (!localtime_ptr) {
+            throw cast_error("Unable to represent system_clock in local time");
+        }
+        return PyDateTime_FromDateAndTime(localtime.tm_year + 1900,
+                                          localtime.tm_mon + 1,
+                                          localtime.tm_mday,
+                                          localtime.tm_hour,
+                                          localtime.tm_min,
+                                          localtime.tm_sec,
+                                          us.count());
+    }
+    PYBIND11_TYPE_CASTER(type, const_name("datetime.datetime"));
+};
+
+// Other clocks that are not the system clock are not measured as datetime.datetime objects
+// since they are not measured on calendar time. So instead we just make them timedeltas
+// Or if they have passed us a time as a float we convert that
+template <typename Clock, typename Duration>
+class type_caster<std::chrono::time_point<Clock, Duration>>
+    : public duration_caster<std::chrono::time_point<Clock, Duration>> {};
+
+template <typename Rep, typename Period>
+class type_caster<std::chrono::duration<Rep, Period>>
+    : public duration_caster<std::chrono::duration<Rep, Period>> {};
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/common.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/common.h
new file mode 100644
index 0000000000..6c8a4f1e88
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/common.h
@@ -0,0 +1,2 @@
+#include "detail/common.h"
+#warning "Including 'common.h' is deprecated. It will be removed in v3.0. Use 'pybind11.h'."
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/complex.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/complex.h
new file mode 100644
index 0000000000..8a831c12ce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/complex.h
@@ -0,0 +1,74 @@
+/*
+    pybind11/complex.h: Complex number support
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "pybind11.h"
+
+#include <complex>
+
+/// glibc defines I as a macro which breaks things, e.g., boost template names
+#ifdef I
+#    undef I
+#endif
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+template <typename T>
+struct format_descriptor<std::complex<T>, detail::enable_if_t<std::is_floating_point<T>::value>> {
+    static constexpr const char c = format_descriptor<T>::c;
+    static constexpr const char value[3] = {'Z', c, '\0'};
+    static std::string format() { return std::string(value); }
+};
+
+#ifndef PYBIND11_CPP17
+
+template <typename T>
+constexpr const char
+    format_descriptor<std::complex<T>,
+                      detail::enable_if_t<std::is_floating_point<T>::value>>::value[3];
+
+#endif
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <typename T>
+struct is_fmt_numeric<std::complex<T>, detail::enable_if_t<std::is_floating_point<T>::value>> {
+    static constexpr bool value = true;
+    static constexpr int index = is_fmt_numeric<T>::index + 3;
+};
+
+template <typename T>
+class type_caster<std::complex<T>> {
+public:
+    bool load(handle src, bool convert) {
+        if (!src) {
+            return false;
+        }
+        if (!convert && !PyComplex_Check(src.ptr())) {
+            return false;
+        }
+        Py_complex result = PyComplex_AsCComplex(src.ptr());
+        if (result.real == -1.0 && PyErr_Occurred()) {
+            PyErr_Clear();
+            return false;
+        }
+        value = std::complex<T>((T) result.real, (T) result.imag);
+        return true;
+    }
+
+    static handle
+    cast(const std::complex<T> &src, return_value_policy /* policy */, handle /* parent */) {
+        return PyComplex_FromDoubles((double) src.real(), (double) src.imag());
+    }
+
+    PYBIND11_TYPE_CASTER(std::complex<T>, const_name("complex"));
+};
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/class.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/class.h
new file mode 100644
index 0000000000..d30621c88c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/class.h
@@ -0,0 +1,754 @@
+/*
+    pybind11/detail/class.h: Python C API implementation details for py::class_
+
+    Copyright (c) 2017 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "../attr.h"
+#include "../options.h"
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+#if !defined(PYPY_VERSION)
+#    define PYBIND11_BUILTIN_QUALNAME
+#    define PYBIND11_SET_OLDPY_QUALNAME(obj, nameobj)
+#else
+// In PyPy, we still set __qualname__ so that we can produce reliable function type
+// signatures; in CPython this macro expands to nothing:
+#    define PYBIND11_SET_OLDPY_QUALNAME(obj, nameobj)                                             \
+        setattr((PyObject *) obj, "__qualname__", nameobj)
+#endif
+
+inline std::string get_fully_qualified_tp_name(PyTypeObject *type) {
+#if !defined(PYPY_VERSION)
+    return type->tp_name;
+#else
+    auto module_name = handle((PyObject *) type).attr("__module__").cast<std::string>();
+    if (module_name == PYBIND11_BUILTINS_MODULE)
+        return type->tp_name;
+    else
+        return std::move(module_name) + "." + type->tp_name;
+#endif
+}
+
+inline PyTypeObject *type_incref(PyTypeObject *type) {
+    Py_INCREF(type);
+    return type;
+}
+
+#if !defined(PYPY_VERSION)
+
+/// `pybind11_static_property.__get__()`: Always pass the class instead of the instance.
+extern "C" inline PyObject *pybind11_static_get(PyObject *self, PyObject * /*ob*/, PyObject *cls) {
+    return PyProperty_Type.tp_descr_get(self, cls, cls);
+}
+
+/// `pybind11_static_property.__set__()`: Just like the above `__get__()`.
+extern "C" inline int pybind11_static_set(PyObject *self, PyObject *obj, PyObject *value) {
+    PyObject *cls = PyType_Check(obj) ? obj : (PyObject *) Py_TYPE(obj);
+    return PyProperty_Type.tp_descr_set(self, cls, value);
+}
+
+// Forward declaration to use in `make_static_property_type()`
+inline void enable_dynamic_attributes(PyHeapTypeObject *heap_type);
+
+/** A `static_property` is the same as a `property` but the `__get__()` and `__set__()`
+    methods are modified to always use the object type instead of a concrete instance.
+    Return value: New reference. */
+inline PyTypeObject *make_static_property_type() {
+    constexpr auto *name = "pybind11_static_property";
+    auto name_obj = reinterpret_steal<object>(PYBIND11_FROM_STRING(name));
+
+    /* Danger zone: from now (and until PyType_Ready), make sure to
+       issue no Python C API calls which could potentially invoke the
+       garbage collector (the GC will call type_traverse(), which will in
+       turn find the newly constructed type in an invalid state) */
+    auto *heap_type = (PyHeapTypeObject *) PyType_Type.tp_alloc(&PyType_Type, 0);
+    if (!heap_type) {
+        pybind11_fail("make_static_property_type(): error allocating type!");
+    }
+
+    heap_type->ht_name = name_obj.inc_ref().ptr();
+#    ifdef PYBIND11_BUILTIN_QUALNAME
+    heap_type->ht_qualname = name_obj.inc_ref().ptr();
+#    endif
+
+    auto *type = &heap_type->ht_type;
+    type->tp_name = name;
+    type->tp_base = type_incref(&PyProperty_Type);
+    type->tp_flags = Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE | Py_TPFLAGS_HEAPTYPE;
+    type->tp_descr_get = pybind11_static_get;
+    type->tp_descr_set = pybind11_static_set;
+
+#    if PY_VERSION_HEX >= 0x030C0000
+    // Since Python-3.12 property-derived types are required to
+    // have dynamic attributes (to set `__doc__`)
+    enable_dynamic_attributes(heap_type);
+#    endif
+
+    if (PyType_Ready(type) < 0) {
+        pybind11_fail("make_static_property_type(): failure in PyType_Ready()!");
+    }
+
+    setattr((PyObject *) type, "__module__", str("pybind11_builtins"));
+    PYBIND11_SET_OLDPY_QUALNAME(type, name_obj);
+
+    return type;
+}
+
+#else // PYPY
+
+/** PyPy has some issues with the above C API, so we evaluate Python code instead.
+    This function will only be called once so performance isn't really a concern.
+    Return value: New reference. */
+inline PyTypeObject *make_static_property_type() {
+    auto d = dict();
+    PyObject *result = PyRun_String(R"(\
+class pybind11_static_property(property):
+    def __get__(self, obj, cls):
+        return property.__get__(self, cls, cls)
+
+    def __set__(self, obj, value):
+        cls = obj if isinstance(obj, type) else type(obj)
+        property.__set__(self, cls, value)
+)",
+                                    Py_file_input,
+                                    d.ptr(),
+                                    d.ptr());
+    if (result == nullptr)
+        throw error_already_set();
+    Py_DECREF(result);
+    return (PyTypeObject *) d["pybind11_static_property"].cast<object>().release().ptr();
+}
+
+#endif // PYPY
+
+/** Types with static properties need to handle `Type.static_prop = x` in a specific way.
+    By default, Python replaces the `static_property` itself, but for wrapped C++ types
+    we need to call `static_property.__set__()` in order to propagate the new value to
+    the underlying C++ data structure. */
+extern "C" inline int pybind11_meta_setattro(PyObject *obj, PyObject *name, PyObject *value) {
+    // Use `_PyType_Lookup()` instead of `PyObject_GetAttr()` in order to get the raw
+    // descriptor (`property`) instead of calling `tp_descr_get` (`property.__get__()`).
+    PyObject *descr = _PyType_Lookup((PyTypeObject *) obj, name);
+
+    // The following assignment combinations are possible:
+    //   1. `Type.static_prop = value`             --> descr_set: `Type.static_prop.__set__(value)`
+    //   2. `Type.static_prop = other_static_prop` --> setattro:  replace existing `static_prop`
+    //   3. `Type.regular_attribute = value`       --> setattro:  regular attribute assignment
+    auto *const static_prop = (PyObject *) get_internals().static_property_type;
+    const auto call_descr_set = (descr != nullptr) && (value != nullptr)
+                                && (PyObject_IsInstance(descr, static_prop) != 0)
+                                && (PyObject_IsInstance(value, static_prop) == 0);
+    if (call_descr_set) {
+        // Call `static_property.__set__()` instead of replacing the `static_property`.
+#if !defined(PYPY_VERSION)
+        return Py_TYPE(descr)->tp_descr_set(descr, obj, value);
+#else
+        if (PyObject *result = PyObject_CallMethod(descr, "__set__", "OO", obj, value)) {
+            Py_DECREF(result);
+            return 0;
+        } else {
+            return -1;
+        }
+#endif
+    } else {
+        // Replace existing attribute.
+        return PyType_Type.tp_setattro(obj, name, value);
+    }
+}
+
+/**
+ * Python 3's PyInstanceMethod_Type hides itself via its tp_descr_get, which prevents aliasing
+ * methods via cls.attr("m2") = cls.attr("m1"): instead the tp_descr_get returns a plain function,
+ * when called on a class, or a PyMethod, when called on an instance.  Override that behaviour here
+ * to do a special case bypass for PyInstanceMethod_Types.
+ */
+extern "C" inline PyObject *pybind11_meta_getattro(PyObject *obj, PyObject *name) {
+    PyObject *descr = _PyType_Lookup((PyTypeObject *) obj, name);
+    if (descr && PyInstanceMethod_Check(descr)) {
+        Py_INCREF(descr);
+        return descr;
+    }
+    return PyType_Type.tp_getattro(obj, name);
+}
+
+/// metaclass `__call__` function that is used to create all pybind11 objects.
+extern "C" inline PyObject *pybind11_meta_call(PyObject *type, PyObject *args, PyObject *kwargs) {
+
+    // use the default metaclass call to create/initialize the object
+    PyObject *self = PyType_Type.tp_call(type, args, kwargs);
+    if (self == nullptr) {
+        return nullptr;
+    }
+
+    // Ensure that the base __init__ function(s) were called
+    values_and_holders vhs(self);
+    for (const auto &vh : vhs) {
+        if (!vh.holder_constructed() && !vhs.is_redundant_value_and_holder(vh)) {
+            PyErr_Format(PyExc_TypeError,
+                         "%.200s.__init__() must be called when overriding __init__",
+                         get_fully_qualified_tp_name(vh.type->type).c_str());
+            Py_DECREF(self);
+            return nullptr;
+        }
+    }
+
+    return self;
+}
+
+/// Cleanup the type-info for a pybind11-registered type.
+extern "C" inline void pybind11_meta_dealloc(PyObject *obj) {
+    with_internals([obj](internals &internals) {
+        auto *type = (PyTypeObject *) obj;
+
+        // A pybind11-registered type will:
+        // 1) be found in internals.registered_types_py
+        // 2) have exactly one associated `detail::type_info`
+        auto found_type = internals.registered_types_py.find(type);
+        if (found_type != internals.registered_types_py.end() && found_type->second.size() == 1
+            && found_type->second[0]->type == type) {
+
+            auto *tinfo = found_type->second[0];
+            auto tindex = std::type_index(*tinfo->cpptype);
+            internals.direct_conversions.erase(tindex);
+
+            if (tinfo->module_local) {
+                get_local_internals().registered_types_cpp.erase(tindex);
+            } else {
+                internals.registered_types_cpp.erase(tindex);
+            }
+            internals.registered_types_py.erase(tinfo->type);
+
+            // Actually just `std::erase_if`, but that's only available in C++20
+            auto &cache = internals.inactive_override_cache;
+            for (auto it = cache.begin(), last = cache.end(); it != last;) {
+                if (it->first == (PyObject *) tinfo->type) {
+                    it = cache.erase(it);
+                } else {
+                    ++it;
+                }
+            }
+
+            delete tinfo;
+        }
+    });
+
+    PyType_Type.tp_dealloc(obj);
+}
+
+/** This metaclass is assigned by default to all pybind11 types and is required in order
+    for static properties to function correctly. Users may override this using `py::metaclass`.
+    Return value: New reference. */
+inline PyTypeObject *make_default_metaclass() {
+    constexpr auto *name = "pybind11_type";
+    auto name_obj = reinterpret_steal<object>(PYBIND11_FROM_STRING(name));
+
+    /* Danger zone: from now (and until PyType_Ready), make sure to
+       issue no Python C API calls which could potentially invoke the
+       garbage collector (the GC will call type_traverse(), which will in
+       turn find the newly constructed type in an invalid state) */
+    auto *heap_type = (PyHeapTypeObject *) PyType_Type.tp_alloc(&PyType_Type, 0);
+    if (!heap_type) {
+        pybind11_fail("make_default_metaclass(): error allocating metaclass!");
+    }
+
+    heap_type->ht_name = name_obj.inc_ref().ptr();
+#ifdef PYBIND11_BUILTIN_QUALNAME
+    heap_type->ht_qualname = name_obj.inc_ref().ptr();
+#endif
+
+    auto *type = &heap_type->ht_type;
+    type->tp_name = name;
+    type->tp_base = type_incref(&PyType_Type);
+    type->tp_flags = Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE | Py_TPFLAGS_HEAPTYPE;
+
+    type->tp_call = pybind11_meta_call;
+
+    type->tp_setattro = pybind11_meta_setattro;
+    type->tp_getattro = pybind11_meta_getattro;
+
+    type->tp_dealloc = pybind11_meta_dealloc;
+
+    if (PyType_Ready(type) < 0) {
+        pybind11_fail("make_default_metaclass(): failure in PyType_Ready()!");
+    }
+
+    setattr((PyObject *) type, "__module__", str("pybind11_builtins"));
+    PYBIND11_SET_OLDPY_QUALNAME(type, name_obj);
+
+    return type;
+}
+
+/// For multiple inheritance types we need to recursively register/deregister base pointers for any
+/// base classes with pointers that are difference from the instance value pointer so that we can
+/// correctly recognize an offset base class pointer. This calls a function with any offset base
+/// ptrs.
+inline void traverse_offset_bases(void *valueptr,
+                                  const detail::type_info *tinfo,
+                                  instance *self,
+                                  bool (*f)(void * /*parentptr*/, instance * /*self*/)) {
+    for (handle h : reinterpret_borrow<tuple>(tinfo->type->tp_bases)) {
+        if (auto *parent_tinfo = get_type_info((PyTypeObject *) h.ptr())) {
+            for (auto &c : parent_tinfo->implicit_casts) {
+                if (c.first == tinfo->cpptype) {
+                    auto *parentptr = c.second(valueptr);
+                    if (parentptr != valueptr) {
+                        f(parentptr, self);
+                    }
+                    traverse_offset_bases(parentptr, parent_tinfo, self, f);
+                    break;
+                }
+            }
+        }
+    }
+}
+
+inline bool register_instance_impl(void *ptr, instance *self) {
+    with_instance_map(ptr, [&](instance_map &instances) { instances.emplace(ptr, self); });
+    return true; // unused, but gives the same signature as the deregister func
+}
+inline bool deregister_instance_impl(void *ptr, instance *self) {
+    return with_instance_map(ptr, [&](instance_map &instances) {
+        auto range = instances.equal_range(ptr);
+        for (auto it = range.first; it != range.second; ++it) {
+            if (self == it->second) {
+                instances.erase(it);
+                return true;
+            }
+        }
+        return false;
+    });
+}
+
+inline void register_instance(instance *self, void *valptr, const type_info *tinfo) {
+    register_instance_impl(valptr, self);
+    if (!tinfo->simple_ancestors) {
+        traverse_offset_bases(valptr, tinfo, self, register_instance_impl);
+    }
+}
+
+inline bool deregister_instance(instance *self, void *valptr, const type_info *tinfo) {
+    bool ret = deregister_instance_impl(valptr, self);
+    if (!tinfo->simple_ancestors) {
+        traverse_offset_bases(valptr, tinfo, self, deregister_instance_impl);
+    }
+    return ret;
+}
+
+/// Instance creation function for all pybind11 types. It allocates the internal instance layout
+/// for holding C++ objects and holders.  Allocation is done lazily (the first time the instance is
+/// cast to a reference or pointer), and initialization is done by an `__init__` function.
+inline PyObject *make_new_instance(PyTypeObject *type) {
+#if defined(PYPY_VERSION)
+    // PyPy gets tp_basicsize wrong (issue 2482) under multiple inheritance when the first
+    // inherited object is a plain Python type (i.e. not derived from an extension type).  Fix it.
+    ssize_t instance_size = static_cast<ssize_t>(sizeof(instance));
+    if (type->tp_basicsize < instance_size) {
+        type->tp_basicsize = instance_size;
+    }
+#endif
+    PyObject *self = type->tp_alloc(type, 0);
+    auto *inst = reinterpret_cast<instance *>(self);
+    // Allocate the value/holder internals:
+    inst->allocate_layout();
+
+    return self;
+}
+
+/// Instance creation function for all pybind11 types. It only allocates space for the
+/// C++ object, but doesn't call the constructor -- an `__init__` function must do that.
+extern "C" inline PyObject *pybind11_object_new(PyTypeObject *type, PyObject *, PyObject *) {
+    return make_new_instance(type);
+}
+
+/// An `__init__` function constructs the C++ object. Users should provide at least one
+/// of these using `py::init` or directly with `.def(__init__, ...)`. Otherwise, the
+/// following default function will be used which simply throws an exception.
+extern "C" inline int pybind11_object_init(PyObject *self, PyObject *, PyObject *) {
+    PyTypeObject *type = Py_TYPE(self);
+    std::string msg = get_fully_qualified_tp_name(type) + ": No constructor defined!";
+    set_error(PyExc_TypeError, msg.c_str());
+    return -1;
+}
+
+inline void add_patient(PyObject *nurse, PyObject *patient) {
+    auto *instance = reinterpret_cast<detail::instance *>(nurse);
+    instance->has_patients = true;
+    Py_INCREF(patient);
+
+    with_internals([&](internals &internals) { internals.patients[nurse].push_back(patient); });
+}
+
+inline void clear_patients(PyObject *self) {
+    auto *instance = reinterpret_cast<detail::instance *>(self);
+    std::vector<PyObject *> patients;
+
+    with_internals([&](internals &internals) {
+        auto pos = internals.patients.find(self);
+
+        if (pos == internals.patients.end()) {
+            pybind11_fail(
+                "FATAL: Internal consistency check failed: Invalid clear_patients() call.");
+        }
+
+        // Clearing the patients can cause more Python code to run, which
+        // can invalidate the iterator. Extract the vector of patients
+        // from the unordered_map first.
+        patients = std::move(pos->second);
+        internals.patients.erase(pos);
+    });
+
+    instance->has_patients = false;
+    for (PyObject *&patient : patients) {
+        Py_CLEAR(patient);
+    }
+}
+
+/// Clears all internal data from the instance and removes it from registered instances in
+/// preparation for deallocation.
+inline void clear_instance(PyObject *self) {
+    auto *instance = reinterpret_cast<detail::instance *>(self);
+
+    // Deallocate any values/holders, if present:
+    for (auto &v_h : values_and_holders(instance)) {
+        if (v_h) {
+
+            // We have to deregister before we call dealloc because, for virtual MI types, we still
+            // need to be able to get the parent pointers.
+            if (v_h.instance_registered()
+                && !deregister_instance(instance, v_h.value_ptr(), v_h.type)) {
+                pybind11_fail(
+                    "pybind11_object_dealloc(): Tried to deallocate unregistered instance!");
+            }
+
+            if (instance->owned || v_h.holder_constructed()) {
+                v_h.type->dealloc(v_h);
+            }
+        }
+    }
+    // Deallocate the value/holder layout internals:
+    instance->deallocate_layout();
+
+    if (instance->weakrefs) {
+        PyObject_ClearWeakRefs(self);
+    }
+
+    PyObject **dict_ptr = _PyObject_GetDictPtr(self);
+    if (dict_ptr) {
+        Py_CLEAR(*dict_ptr);
+    }
+
+    if (instance->has_patients) {
+        clear_patients(self);
+    }
+}
+
+/// Instance destructor function for all pybind11 types. It calls `type_info.dealloc`
+/// to destroy the C++ object itself, while the rest is Python bookkeeping.
+extern "C" inline void pybind11_object_dealloc(PyObject *self) {
+    auto *type = Py_TYPE(self);
+
+    // If this is a GC tracked object, untrack it first
+    // Note that the track call is implicitly done by the
+    // default tp_alloc, which we never override.
+    if (PyType_HasFeature(type, Py_TPFLAGS_HAVE_GC) != 0) {
+        PyObject_GC_UnTrack(self);
+    }
+
+    clear_instance(self);
+
+    type->tp_free(self);
+
+#if PY_VERSION_HEX < 0x03080000
+    // `type->tp_dealloc != pybind11_object_dealloc` means that we're being called
+    // as part of a derived type's dealloc, in which case we're not allowed to decref
+    // the type here. For cross-module compatibility, we shouldn't compare directly
+    // with `pybind11_object_dealloc`, but with the common one stashed in internals.
+    auto pybind11_object_type = (PyTypeObject *) get_internals().instance_base;
+    if (type->tp_dealloc == pybind11_object_type->tp_dealloc)
+        Py_DECREF(type);
+#else
+    // This was not needed before Python 3.8 (Python issue 35810)
+    // https://github.com/pybind/pybind11/issues/1946
+    Py_DECREF(type);
+#endif
+}
+
+std::string error_string();
+
+/** Create the type which can be used as a common base for all classes.  This is
+    needed in order to satisfy Python's requirements for multiple inheritance.
+    Return value: New reference. */
+inline PyObject *make_object_base_type(PyTypeObject *metaclass) {
+    constexpr auto *name = "pybind11_object";
+    auto name_obj = reinterpret_steal<object>(PYBIND11_FROM_STRING(name));
+
+    /* Danger zone: from now (and until PyType_Ready), make sure to
+       issue no Python C API calls which could potentially invoke the
+       garbage collector (the GC will call type_traverse(), which will in
+       turn find the newly constructed type in an invalid state) */
+    auto *heap_type = (PyHeapTypeObject *) metaclass->tp_alloc(metaclass, 0);
+    if (!heap_type) {
+        pybind11_fail("make_object_base_type(): error allocating type!");
+    }
+
+    heap_type->ht_name = name_obj.inc_ref().ptr();
+#ifdef PYBIND11_BUILTIN_QUALNAME
+    heap_type->ht_qualname = name_obj.inc_ref().ptr();
+#endif
+
+    auto *type = &heap_type->ht_type;
+    type->tp_name = name;
+    type->tp_base = type_incref(&PyBaseObject_Type);
+    type->tp_basicsize = static_cast<ssize_t>(sizeof(instance));
+    type->tp_flags = Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE | Py_TPFLAGS_HEAPTYPE;
+
+    type->tp_new = pybind11_object_new;
+    type->tp_init = pybind11_object_init;
+    type->tp_dealloc = pybind11_object_dealloc;
+
+    /* Support weak references (needed for the keep_alive feature) */
+    type->tp_weaklistoffset = offsetof(instance, weakrefs);
+
+    if (PyType_Ready(type) < 0) {
+        pybind11_fail("PyType_Ready failed in make_object_base_type(): " + error_string());
+    }
+
+    setattr((PyObject *) type, "__module__", str("pybind11_builtins"));
+    PYBIND11_SET_OLDPY_QUALNAME(type, name_obj);
+
+    assert(!PyType_HasFeature(type, Py_TPFLAGS_HAVE_GC));
+    return (PyObject *) heap_type;
+}
+
+/// dynamic_attr: Allow the garbage collector to traverse the internal instance `__dict__`.
+extern "C" inline int pybind11_traverse(PyObject *self, visitproc visit, void *arg) {
+#if PY_VERSION_HEX >= 0x030D0000
+    PyObject_VisitManagedDict(self, visit, arg);
+#else
+    PyObject *&dict = *_PyObject_GetDictPtr(self);
+    Py_VISIT(dict);
+#endif
+// https://docs.python.org/3/c-api/typeobj.html#c.PyTypeObject.tp_traverse
+#if PY_VERSION_HEX >= 0x03090000
+    Py_VISIT(Py_TYPE(self));
+#endif
+    return 0;
+}
+
+/// dynamic_attr: Allow the GC to clear the dictionary.
+extern "C" inline int pybind11_clear(PyObject *self) {
+#if PY_VERSION_HEX >= 0x030D0000
+    PyObject_ClearManagedDict(self);
+#else
+    PyObject *&dict = *_PyObject_GetDictPtr(self);
+    Py_CLEAR(dict);
+#endif
+    return 0;
+}
+
+/// Give instances of this type a `__dict__` and opt into garbage collection.
+inline void enable_dynamic_attributes(PyHeapTypeObject *heap_type) {
+    auto *type = &heap_type->ht_type;
+    type->tp_flags |= Py_TPFLAGS_HAVE_GC;
+#if PY_VERSION_HEX < 0x030B0000
+    type->tp_dictoffset = type->tp_basicsize;           // place dict at the end
+    type->tp_basicsize += (ssize_t) sizeof(PyObject *); // and allocate enough space for it
+#else
+    type->tp_flags |= Py_TPFLAGS_MANAGED_DICT;
+#endif
+    type->tp_traverse = pybind11_traverse;
+    type->tp_clear = pybind11_clear;
+
+    static PyGetSetDef getset[]
+        = {{"__dict__", PyObject_GenericGetDict, PyObject_GenericSetDict, nullptr, nullptr},
+           {nullptr, nullptr, nullptr, nullptr, nullptr}};
+    type->tp_getset = getset;
+}
+
+/// buffer_protocol: Fill in the view as specified by flags.
+extern "C" inline int pybind11_getbuffer(PyObject *obj, Py_buffer *view, int flags) {
+    // Look for a `get_buffer` implementation in this type's info or any bases (following MRO).
+    type_info *tinfo = nullptr;
+    for (auto type : reinterpret_borrow<tuple>(Py_TYPE(obj)->tp_mro)) {
+        tinfo = get_type_info((PyTypeObject *) type.ptr());
+        if (tinfo && tinfo->get_buffer) {
+            break;
+        }
+    }
+    if (view == nullptr || !tinfo || !tinfo->get_buffer) {
+        if (view) {
+            view->obj = nullptr;
+        }
+        set_error(PyExc_BufferError, "pybind11_getbuffer(): Internal error");
+        return -1;
+    }
+    std::memset(view, 0, sizeof(Py_buffer));
+    buffer_info *info = tinfo->get_buffer(obj, tinfo->get_buffer_data);
+    if ((flags & PyBUF_WRITABLE) == PyBUF_WRITABLE && info->readonly) {
+        delete info;
+        // view->obj = nullptr;  // Was just memset to 0, so not necessary
+        set_error(PyExc_BufferError, "Writable buffer requested for readonly storage");
+        return -1;
+    }
+    view->obj = obj;
+    view->ndim = 1;
+    view->internal = info;
+    view->buf = info->ptr;
+    view->itemsize = info->itemsize;
+    view->len = view->itemsize;
+    for (auto s : info->shape) {
+        view->len *= s;
+    }
+    view->readonly = static_cast<int>(info->readonly);
+    if ((flags & PyBUF_FORMAT) == PyBUF_FORMAT) {
+        view->format = const_cast<char *>(info->format.c_str());
+    }
+    if ((flags & PyBUF_STRIDES) == PyBUF_STRIDES) {
+        view->ndim = (int) info->ndim;
+        view->strides = info->strides.data();
+        view->shape = info->shape.data();
+    }
+    Py_INCREF(view->obj);
+    return 0;
+}
+
+/// buffer_protocol: Release the resources of the buffer.
+extern "C" inline void pybind11_releasebuffer(PyObject *, Py_buffer *view) {
+    delete (buffer_info *) view->internal;
+}
+
+/// Give this type a buffer interface.
+inline void enable_buffer_protocol(PyHeapTypeObject *heap_type) {
+    heap_type->ht_type.tp_as_buffer = &heap_type->as_buffer;
+
+    heap_type->as_buffer.bf_getbuffer = pybind11_getbuffer;
+    heap_type->as_buffer.bf_releasebuffer = pybind11_releasebuffer;
+}
+
+/** Create a brand new Python type according to the `type_record` specification.
+    Return value: New reference. */
+inline PyObject *make_new_python_type(const type_record &rec) {
+    auto name = reinterpret_steal<object>(PYBIND11_FROM_STRING(rec.name));
+
+    auto qualname = name;
+    if (rec.scope && !PyModule_Check(rec.scope.ptr()) && hasattr(rec.scope, "__qualname__")) {
+        qualname = reinterpret_steal<object>(
+            PyUnicode_FromFormat("%U.%U", rec.scope.attr("__qualname__").ptr(), name.ptr()));
+    }
+
+    object module_;
+    if (rec.scope) {
+        if (hasattr(rec.scope, "__module__")) {
+            module_ = rec.scope.attr("__module__");
+        } else if (hasattr(rec.scope, "__name__")) {
+            module_ = rec.scope.attr("__name__");
+        }
+    }
+
+    const auto *full_name = c_str(
+#if !defined(PYPY_VERSION)
+        module_ ? str(module_).cast<std::string>() + "." + rec.name :
+#endif
+                rec.name);
+
+    char *tp_doc = nullptr;
+    if (rec.doc && options::show_user_defined_docstrings()) {
+        /* Allocate memory for docstring (Python will free this later on) */
+        size_t size = std::strlen(rec.doc) + 1;
+#if PY_VERSION_HEX >= 0x030D0000
+        tp_doc = (char *) PyMem_MALLOC(size);
+#else
+        tp_doc = (char *) PyObject_MALLOC(size);
+#endif
+        std::memcpy((void *) tp_doc, rec.doc, size);
+    }
+
+    auto &internals = get_internals();
+    auto bases = tuple(rec.bases);
+    auto *base = (bases.empty()) ? internals.instance_base : bases[0].ptr();
+
+    /* Danger zone: from now (and until PyType_Ready), make sure to
+       issue no Python C API calls which could potentially invoke the
+       garbage collector (the GC will call type_traverse(), which will in
+       turn find the newly constructed type in an invalid state) */
+    auto *metaclass
+        = rec.metaclass.ptr() ? (PyTypeObject *) rec.metaclass.ptr() : internals.default_metaclass;
+
+    auto *heap_type = (PyHeapTypeObject *) metaclass->tp_alloc(metaclass, 0);
+    if (!heap_type) {
+        pybind11_fail(std::string(rec.name) + ": Unable to create type object!");
+    }
+
+    heap_type->ht_name = name.release().ptr();
+#ifdef PYBIND11_BUILTIN_QUALNAME
+    heap_type->ht_qualname = qualname.inc_ref().ptr();
+#endif
+
+    auto *type = &heap_type->ht_type;
+    type->tp_name = full_name;
+    type->tp_doc = tp_doc;
+    type->tp_base = type_incref((PyTypeObject *) base);
+    type->tp_basicsize = static_cast<ssize_t>(sizeof(instance));
+    if (!bases.empty()) {
+        type->tp_bases = bases.release().ptr();
+    }
+
+    /* Don't inherit base __init__ */
+    type->tp_init = pybind11_object_init;
+
+    /* Supported protocols */
+    type->tp_as_number = &heap_type->as_number;
+    type->tp_as_sequence = &heap_type->as_sequence;
+    type->tp_as_mapping = &heap_type->as_mapping;
+    type->tp_as_async = &heap_type->as_async;
+
+    /* Flags */
+    type->tp_flags |= Py_TPFLAGS_DEFAULT | Py_TPFLAGS_HEAPTYPE;
+    if (!rec.is_final) {
+        type->tp_flags |= Py_TPFLAGS_BASETYPE;
+    }
+
+    if (rec.dynamic_attr) {
+        enable_dynamic_attributes(heap_type);
+    }
+
+    if (rec.buffer_protocol) {
+        enable_buffer_protocol(heap_type);
+    }
+
+    if (rec.custom_type_setup_callback) {
+        rec.custom_type_setup_callback(heap_type);
+    }
+
+    if (PyType_Ready(type) < 0) {
+        pybind11_fail(std::string(rec.name) + ": PyType_Ready failed: " + error_string());
+    }
+
+    assert(!rec.dynamic_attr || PyType_HasFeature(type, Py_TPFLAGS_HAVE_GC));
+
+    /* Register type with the parent scope */
+    if (rec.scope) {
+        setattr(rec.scope, rec.name, (PyObject *) type);
+    } else {
+        Py_INCREF(type); // Keep it alive forever (reference leak)
+    }
+
+    if (module_) { // Needed by pydoc
+        setattr((PyObject *) type, "__module__", module_);
+    }
+
+    PYBIND11_SET_OLDPY_QUALNAME(type, qualname);
+
+    return (PyObject *) type;
+}
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/common.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/common.h
new file mode 100644
index 0000000000..4f750fc7f2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/common.h
@@ -0,0 +1,1269 @@
+/*
+    pybind11/detail/common.h -- Basic macros
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#define PYBIND11_VERSION_MAJOR 2
+#define PYBIND11_VERSION_MINOR 13
+#define PYBIND11_VERSION_PATCH 1
+
+// Similar to Python's convention: https://docs.python.org/3/c-api/apiabiversion.html
+// Additional convention: 0xD = dev
+#define PYBIND11_VERSION_HEX 0x020D0100
+
+// Define some generic pybind11 helper macros for warning management.
+//
+// Note that compiler-specific push/pop pairs are baked into the
+// PYBIND11_NAMESPACE_BEGIN/PYBIND11_NAMESPACE_END pair of macros. Therefore manual
+// PYBIND11_WARNING_PUSH/PYBIND11_WARNING_POP are usually only needed in `#include` sections.
+//
+// If you find you need to suppress a warning, please try to make the suppression as local as
+// possible using these macros. Please also be sure to push/pop with the pybind11 macros. Please
+// only use compiler specifics if you need to check specific versions, e.g. Apple Clang vs. vanilla
+// Clang.
+#if defined(_MSC_VER)
+#    define PYBIND11_COMPILER_MSVC
+#    define PYBIND11_PRAGMA(...) __pragma(__VA_ARGS__)
+#    define PYBIND11_WARNING_PUSH PYBIND11_PRAGMA(warning(push))
+#    define PYBIND11_WARNING_POP PYBIND11_PRAGMA(warning(pop))
+#elif defined(__INTEL_COMPILER)
+#    define PYBIND11_COMPILER_INTEL
+#    define PYBIND11_PRAGMA(...) _Pragma(#__VA_ARGS__)
+#    define PYBIND11_WARNING_PUSH PYBIND11_PRAGMA(warning push)
+#    define PYBIND11_WARNING_POP PYBIND11_PRAGMA(warning pop)
+#elif defined(__clang__)
+#    define PYBIND11_COMPILER_CLANG
+#    define PYBIND11_PRAGMA(...) _Pragma(#__VA_ARGS__)
+#    define PYBIND11_WARNING_PUSH PYBIND11_PRAGMA(clang diagnostic push)
+#    define PYBIND11_WARNING_POP PYBIND11_PRAGMA(clang diagnostic push)
+#elif defined(__GNUC__)
+#    define PYBIND11_COMPILER_GCC
+#    define PYBIND11_PRAGMA(...) _Pragma(#__VA_ARGS__)
+#    define PYBIND11_WARNING_PUSH PYBIND11_PRAGMA(GCC diagnostic push)
+#    define PYBIND11_WARNING_POP PYBIND11_PRAGMA(GCC diagnostic pop)
+#endif
+
+#ifdef PYBIND11_COMPILER_MSVC
+#    define PYBIND11_WARNING_DISABLE_MSVC(name) PYBIND11_PRAGMA(warning(disable : name))
+#else
+#    define PYBIND11_WARNING_DISABLE_MSVC(name)
+#endif
+
+#ifdef PYBIND11_COMPILER_CLANG
+#    define PYBIND11_WARNING_DISABLE_CLANG(name) PYBIND11_PRAGMA(clang diagnostic ignored name)
+#else
+#    define PYBIND11_WARNING_DISABLE_CLANG(name)
+#endif
+
+#ifdef PYBIND11_COMPILER_GCC
+#    define PYBIND11_WARNING_DISABLE_GCC(name) PYBIND11_PRAGMA(GCC diagnostic ignored name)
+#else
+#    define PYBIND11_WARNING_DISABLE_GCC(name)
+#endif
+
+#ifdef PYBIND11_COMPILER_INTEL
+#    define PYBIND11_WARNING_DISABLE_INTEL(name) PYBIND11_PRAGMA(warning disable name)
+#else
+#    define PYBIND11_WARNING_DISABLE_INTEL(name)
+#endif
+
+#define PYBIND11_NAMESPACE_BEGIN(name)                                                            \
+    namespace name {                                                                              \
+    PYBIND11_WARNING_PUSH
+
+#define PYBIND11_NAMESPACE_END(name)                                                              \
+    PYBIND11_WARNING_POP                                                                          \
+    }
+
+// Robust support for some features and loading modules compiled against different pybind versions
+// requires forcing hidden visibility on pybind code, so we enforce this by setting the attribute
+// on the main `pybind11` namespace.
+#if !defined(PYBIND11_NAMESPACE)
+#    ifdef __GNUG__
+#        define PYBIND11_NAMESPACE pybind11 __attribute__((visibility("hidden")))
+#    else
+#        define PYBIND11_NAMESPACE pybind11
+#    endif
+#endif
+
+#if !(defined(_MSC_VER) && __cplusplus == 199711L)
+#    if __cplusplus >= 201402L
+#        define PYBIND11_CPP14
+#        if __cplusplus >= 201703L
+#            define PYBIND11_CPP17
+#            if __cplusplus >= 202002L
+#                define PYBIND11_CPP20
+// Please update tests/pybind11_tests.cpp `cpp_std()` when adding a macro here.
+#            endif
+#        endif
+#    endif
+#elif defined(_MSC_VER) && __cplusplus == 199711L
+// MSVC sets _MSVC_LANG rather than __cplusplus (supposedly until the standard is fully
+// implemented). Unless you use the /Zc:__cplusplus flag on Visual Studio 2017 15.7 Preview 3
+// or newer.
+#    if _MSVC_LANG >= 201402L
+#        define PYBIND11_CPP14
+#        if _MSVC_LANG > 201402L
+#            define PYBIND11_CPP17
+#            if _MSVC_LANG >= 202002L
+#                define PYBIND11_CPP20
+#            endif
+#        endif
+#    endif
+#endif
+
+#if defined(PYBIND11_CPP20)
+#    define PYBIND11_CONSTINIT constinit
+#    define PYBIND11_DTOR_CONSTEXPR constexpr
+#else
+#    define PYBIND11_CONSTINIT
+#    define PYBIND11_DTOR_CONSTEXPR
+#endif
+
+// Compiler version assertions
+#if defined(__INTEL_COMPILER)
+#    if __INTEL_COMPILER < 1800
+#        error pybind11 requires Intel C++ compiler v18 or newer
+#    elif __INTEL_COMPILER < 1900 && defined(PYBIND11_CPP14)
+#        error pybind11 supports only C++11 with Intel C++ compiler v18. Use v19 or newer for C++14.
+#    endif
+/* The following pragma cannot be pop'ed:
+   https://community.intel.com/t5/Intel-C-Compiler/Inline-and-no-inline-warning/td-p/1216764 */
+#    pragma warning disable 2196 // warning #2196: routine is both "inline" and "noinline"
+#elif defined(__clang__) && !defined(__apple_build_version__)
+#    if __clang_major__ < 3 || (__clang_major__ == 3 && __clang_minor__ < 3)
+#        error pybind11 requires clang 3.3 or newer
+#    endif
+#elif defined(__clang__)
+// Apple changes clang version macros to its Xcode version; the first Xcode release based on
+// (upstream) clang 3.3 was Xcode 5:
+#    if __clang_major__ < 5
+#        error pybind11 requires Xcode/clang 5.0 or newer
+#    endif
+#elif defined(__GNUG__)
+#    if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 8)
+#        error pybind11 requires gcc 4.8 or newer
+#    endif
+#elif defined(_MSC_VER)
+#    if _MSC_VER < 1910
+#        error pybind11 2.10+ requires MSVC 2017 or newer
+#    endif
+#endif
+
+#if !defined(PYBIND11_EXPORT)
+#    if defined(WIN32) || defined(_WIN32)
+#        define PYBIND11_EXPORT __declspec(dllexport)
+#    else
+#        define PYBIND11_EXPORT __attribute__((visibility("default")))
+#    endif
+#endif
+
+#if !defined(PYBIND11_EXPORT_EXCEPTION)
+#    if defined(__apple_build_version__)
+#        define PYBIND11_EXPORT_EXCEPTION PYBIND11_EXPORT
+#    else
+#        define PYBIND11_EXPORT_EXCEPTION
+#    endif
+#endif
+
+// For CUDA, GCC7, GCC8:
+// PYBIND11_NOINLINE_FORCED is incompatible with `-Wattributes -Werror`.
+// When defining PYBIND11_NOINLINE_FORCED, it is best to also use `-Wno-attributes`.
+// However, the measured shared-library size saving when using noinline are only
+// 1.7% for CUDA, -0.2% for GCC7, and 0.0% for GCC8 (using -DCMAKE_BUILD_TYPE=MinSizeRel,
+// the default under pybind11/tests).
+#if !defined(PYBIND11_NOINLINE_FORCED)                                                            \
+    && (defined(__CUDACC__) || (defined(__GNUC__) && (__GNUC__ == 7 || __GNUC__ == 8)))
+#    define PYBIND11_NOINLINE_DISABLED
+#endif
+
+// The PYBIND11_NOINLINE macro is for function DEFINITIONS.
+// In contrast, FORWARD DECLARATIONS should never use this macro:
+// https://stackoverflow.com/questions/9317473/forward-declaration-of-inline-functions
+#if defined(PYBIND11_NOINLINE_DISABLED) // Option for maximum portability and experimentation.
+#    define PYBIND11_NOINLINE inline
+#elif defined(_MSC_VER)
+#    define PYBIND11_NOINLINE __declspec(noinline) inline
+#else
+#    define PYBIND11_NOINLINE __attribute__((noinline)) inline
+#endif
+
+#if defined(__MINGW32__)
+// For unknown reasons all PYBIND11_DEPRECATED member trigger a warning when declared
+// whether it is used or not
+#    define PYBIND11_DEPRECATED(reason)
+#elif defined(PYBIND11_CPP14)
+#    define PYBIND11_DEPRECATED(reason) [[deprecated(reason)]]
+#else
+#    define PYBIND11_DEPRECATED(reason) __attribute__((deprecated(reason)))
+#endif
+
+#if defined(PYBIND11_CPP17)
+#    define PYBIND11_MAYBE_UNUSED [[maybe_unused]]
+#elif defined(_MSC_VER) && !defined(__clang__)
+#    define PYBIND11_MAYBE_UNUSED
+#else
+#    define PYBIND11_MAYBE_UNUSED __attribute__((__unused__))
+#endif
+
+/* Don't let Python.h #define (v)snprintf as macro because they are implemented
+   properly in Visual Studio since 2015. */
+#if defined(_MSC_VER)
+#    define HAVE_SNPRINTF 1
+#endif
+
+/// Include Python header, disable linking to pythonX_d.lib on Windows in debug mode
+#if defined(_MSC_VER)
+PYBIND11_WARNING_PUSH
+PYBIND11_WARNING_DISABLE_MSVC(4505)
+// C4505: 'PySlice_GetIndicesEx': unreferenced local function has been removed (PyPy only)
+#    if defined(_DEBUG) && !defined(Py_DEBUG)
+// Workaround for a VS 2022 issue.
+// NOTE: This workaround knowingly violates the Python.h include order requirement:
+// https://docs.python.org/3/c-api/intro.html#include-files
+// See https://github.com/pybind/pybind11/pull/3497 for full context.
+#        include <yvals.h>
+#        if _MSVC_STL_VERSION >= 143
+#            include <crtdefs.h>
+#        endif
+#        define PYBIND11_DEBUG_MARKER
+#        undef _DEBUG
+#    endif
+#endif
+
+// https://en.cppreference.com/w/c/chrono/localtime
+#if defined(__STDC_LIB_EXT1__) && !defined(__STDC_WANT_LIB_EXT1__)
+#    define __STDC_WANT_LIB_EXT1__
+#endif
+
+#ifdef __has_include
+// std::optional (but including it in c++14 mode isn't allowed)
+#    if defined(PYBIND11_CPP17) && __has_include(<optional>)
+#        define PYBIND11_HAS_OPTIONAL 1
+#    endif
+// std::experimental::optional (but not allowed in c++11 mode)
+#    if defined(PYBIND11_CPP14) && (__has_include(<experimental/optional>) && \
+                                 !__has_include(<optional>))
+#        define PYBIND11_HAS_EXP_OPTIONAL 1
+#    endif
+// std::variant
+#    if defined(PYBIND11_CPP17) && __has_include(<variant>)
+#        define PYBIND11_HAS_VARIANT 1
+#    endif
+#elif defined(_MSC_VER) && defined(PYBIND11_CPP17)
+#    define PYBIND11_HAS_OPTIONAL 1
+#    define PYBIND11_HAS_VARIANT 1
+#endif
+
+#if defined(PYBIND11_CPP17)
+#    if defined(__has_include)
+#        if __has_include(<string_view>)
+#            define PYBIND11_HAS_STRING_VIEW
+#        endif
+#    elif defined(_MSC_VER)
+#        define PYBIND11_HAS_STRING_VIEW
+#    endif
+#endif
+
+#include <Python.h>
+#if PY_VERSION_HEX < 0x03070000
+#    error "PYTHON < 3.7 IS UNSUPPORTED. pybind11 v2.12 was the last to support Python 3.6."
+#endif
+#include <frameobject.h>
+#include <pythread.h>
+
+/* Python #defines overrides on all sorts of core functions, which
+   tends to weak havok in C++ codebases that expect these to work
+   like regular functions (potentially with several overloads) */
+#if defined(isalnum)
+#    undef isalnum
+#    undef isalpha
+#    undef islower
+#    undef isspace
+#    undef isupper
+#    undef tolower
+#    undef toupper
+#endif
+
+#if defined(copysign)
+#    undef copysign
+#endif
+
+#if defined(PYBIND11_NUMPY_1_ONLY)
+#    define PYBIND11_INTERNAL_NUMPY_1_ONLY_DETECTED
+#endif
+
+#if defined(PYPY_VERSION) && !defined(PYBIND11_SIMPLE_GIL_MANAGEMENT)
+#    define PYBIND11_SIMPLE_GIL_MANAGEMENT
+#endif
+
+#if defined(_MSC_VER)
+#    if defined(PYBIND11_DEBUG_MARKER)
+#        define _DEBUG
+#        undef PYBIND11_DEBUG_MARKER
+#    endif
+PYBIND11_WARNING_POP
+#endif
+
+#include <cstddef>
+#include <cstring>
+#include <exception>
+#include <forward_list>
+#include <memory>
+#include <stdexcept>
+#include <string>
+#include <type_traits>
+#include <typeindex>
+#include <unordered_map>
+#include <unordered_set>
+#include <vector>
+#include <algorithm>
+#if defined(__has_include)
+#    if __has_include(<version>)
+#        include <version>
+#    endif
+#endif
+
+// Must be after including <version> or one of the other headers specified by the standard
+#if defined(__cpp_lib_char8_t) && __cpp_lib_char8_t >= 201811L
+#    define PYBIND11_HAS_U8STRING
+#endif
+
+// See description of PR #4246:
+#if !defined(PYBIND11_NO_ASSERT_GIL_HELD_INCREF_DECREF) && !defined(NDEBUG)                       \
+    && !defined(PYPY_VERSION) && !defined(PYBIND11_ASSERT_GIL_HELD_INCREF_DECREF)
+#    define PYBIND11_ASSERT_GIL_HELD_INCREF_DECREF
+#endif
+
+// #define PYBIND11_STR_LEGACY_PERMISSIVE
+// If DEFINED, pybind11::str can hold PyUnicodeObject or PyBytesObject
+//             (probably surprising and never documented, but this was the
+//             legacy behavior until and including v2.6.x). As a side-effect,
+//             pybind11::isinstance<str>() is true for both pybind11::str and
+//             pybind11::bytes.
+// If UNDEFINED, pybind11::str can only hold PyUnicodeObject, and
+//               pybind11::isinstance<str>() is true only for pybind11::str.
+//               However, for Python 2 only (!), the pybind11::str caster
+//               implicitly decoded bytes to PyUnicodeObject. This was to ease
+//               the transition from the legacy behavior to the non-permissive
+//               behavior.
+
+/// Compatibility macros for Python 2 / Python 3 versions TODO: remove
+#define PYBIND11_INSTANCE_METHOD_NEW(ptr, class_) PyInstanceMethod_New(ptr)
+#define PYBIND11_INSTANCE_METHOD_CHECK PyInstanceMethod_Check
+#define PYBIND11_INSTANCE_METHOD_GET_FUNCTION PyInstanceMethod_GET_FUNCTION
+#define PYBIND11_BYTES_CHECK PyBytes_Check
+#define PYBIND11_BYTES_FROM_STRING PyBytes_FromString
+#define PYBIND11_BYTES_FROM_STRING_AND_SIZE PyBytes_FromStringAndSize
+#define PYBIND11_BYTES_AS_STRING_AND_SIZE PyBytes_AsStringAndSize
+#define PYBIND11_BYTES_AS_STRING PyBytes_AsString
+#define PYBIND11_BYTES_SIZE PyBytes_Size
+#define PYBIND11_LONG_CHECK(o) PyLong_Check(o)
+#define PYBIND11_LONG_AS_LONGLONG(o) PyLong_AsLongLong(o)
+#define PYBIND11_LONG_FROM_SIGNED(o) PyLong_FromSsize_t((ssize_t) (o))
+#define PYBIND11_LONG_FROM_UNSIGNED(o) PyLong_FromSize_t((size_t) (o))
+#define PYBIND11_BYTES_NAME "bytes"
+#define PYBIND11_STRING_NAME "str"
+#define PYBIND11_SLICE_OBJECT PyObject
+#define PYBIND11_FROM_STRING PyUnicode_FromString
+#define PYBIND11_STR_TYPE ::pybind11::str
+#define PYBIND11_BOOL_ATTR "__bool__"
+#define PYBIND11_NB_BOOL(ptr) ((ptr)->nb_bool)
+#define PYBIND11_BUILTINS_MODULE "builtins"
+// Providing a separate declaration to make Clang's -Wmissing-prototypes happy.
+// See comment for PYBIND11_MODULE below for why this is marked "maybe unused".
+#define PYBIND11_PLUGIN_IMPL(name)                                                                \
+    extern "C" PYBIND11_MAYBE_UNUSED PYBIND11_EXPORT PyObject *PyInit_##name();                   \
+    extern "C" PYBIND11_EXPORT PyObject *PyInit_##name()
+
+#define PYBIND11_TRY_NEXT_OVERLOAD ((PyObject *) 1) // special failure return code
+#define PYBIND11_STRINGIFY(x) #x
+#define PYBIND11_TOSTRING(x) PYBIND11_STRINGIFY(x)
+#define PYBIND11_CONCAT(first, second) first##second
+#define PYBIND11_ENSURE_INTERNALS_READY pybind11::detail::get_internals();
+
+#define PYBIND11_CHECK_PYTHON_VERSION                                                             \
+    {                                                                                             \
+        const char *compiled_ver                                                                  \
+            = PYBIND11_TOSTRING(PY_MAJOR_VERSION) "." PYBIND11_TOSTRING(PY_MINOR_VERSION);        \
+        const char *runtime_ver = Py_GetVersion();                                                \
+        size_t len = std::strlen(compiled_ver);                                                   \
+        if (std::strncmp(runtime_ver, compiled_ver, len) != 0                                     \
+            || (runtime_ver[len] >= '0' && runtime_ver[len] <= '9')) {                            \
+            PyErr_Format(PyExc_ImportError,                                                       \
+                         "Python version mismatch: module was compiled for Python %s, "           \
+                         "but the interpreter version is incompatible: %s.",                      \
+                         compiled_ver,                                                            \
+                         runtime_ver);                                                            \
+            return nullptr;                                                                       \
+        }                                                                                         \
+    }
+
+#define PYBIND11_CATCH_INIT_EXCEPTIONS                                                            \
+    catch (pybind11::error_already_set & e) {                                                     \
+        pybind11::raise_from(e, PyExc_ImportError, "initialization failed");                      \
+        return nullptr;                                                                           \
+    }                                                                                             \
+    catch (const std::exception &e) {                                                             \
+        ::pybind11::set_error(PyExc_ImportError, e.what());                                       \
+        return nullptr;                                                                           \
+    }
+
+/** \rst
+    ***Deprecated in favor of PYBIND11_MODULE***
+
+    This macro creates the entry point that will be invoked when the Python interpreter
+    imports a plugin library. Please create a `module_` in the function body and return
+    the pointer to its underlying Python object at the end.
+
+    .. code-block:: cpp
+
+        PYBIND11_PLUGIN(example) {
+            pybind11::module_ m("example", "pybind11 example plugin");
+            /// Set up bindings here
+            return m.ptr();
+        }
+\endrst */
+#define PYBIND11_PLUGIN(name)                                                                     \
+    PYBIND11_DEPRECATED("PYBIND11_PLUGIN is deprecated, use PYBIND11_MODULE")                     \
+    static PyObject *pybind11_init();                                                             \
+    PYBIND11_PLUGIN_IMPL(name) {                                                                  \
+        PYBIND11_CHECK_PYTHON_VERSION                                                             \
+        PYBIND11_ENSURE_INTERNALS_READY                                                           \
+        try {                                                                                     \
+            return pybind11_init();                                                               \
+        }                                                                                         \
+        PYBIND11_CATCH_INIT_EXCEPTIONS                                                            \
+    }                                                                                             \
+    PyObject *pybind11_init()
+
+/** \rst
+    This macro creates the entry point that will be invoked when the Python interpreter
+    imports an extension module. The module name is given as the first argument and it
+    should not be in quotes. The second macro argument defines a variable of type
+    `py::module_` which can be used to initialize the module.
+
+    The entry point is marked as "maybe unused" to aid dead-code detection analysis:
+    since the entry point is typically only looked up at runtime and not referenced
+    during translation, it would otherwise appear as unused ("dead") code.
+
+    .. code-block:: cpp
+
+        PYBIND11_MODULE(example, m) {
+            m.doc() = "pybind11 example module";
+
+            // Add bindings here
+            m.def("foo", []() {
+                return "Hello, World!";
+            });
+        }
+\endrst */
+#define PYBIND11_MODULE(name, variable, ...)                                                      \
+    static ::pybind11::module_::module_def PYBIND11_CONCAT(pybind11_module_def_, name)            \
+        PYBIND11_MAYBE_UNUSED;                                                                    \
+    PYBIND11_MAYBE_UNUSED                                                                         \
+    static void PYBIND11_CONCAT(pybind11_init_, name)(::pybind11::module_ &);                     \
+    PYBIND11_PLUGIN_IMPL(name) {                                                                  \
+        PYBIND11_CHECK_PYTHON_VERSION                                                             \
+        PYBIND11_ENSURE_INTERNALS_READY                                                           \
+        auto m = ::pybind11::module_::create_extension_module(                                    \
+            PYBIND11_TOSTRING(name),                                                              \
+            nullptr,                                                                              \
+            &PYBIND11_CONCAT(pybind11_module_def_, name),                                         \
+            ##__VA_ARGS__);                                                                       \
+        try {                                                                                     \
+            PYBIND11_CONCAT(pybind11_init_, name)(m);                                             \
+            return m.ptr();                                                                       \
+        }                                                                                         \
+        PYBIND11_CATCH_INIT_EXCEPTIONS                                                            \
+    }                                                                                             \
+    void PYBIND11_CONCAT(pybind11_init_, name)(::pybind11::module_ & (variable))
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+using ssize_t = Py_ssize_t;
+using size_t = std::size_t;
+
+template <typename IntType>
+inline ssize_t ssize_t_cast(const IntType &val) {
+    static_assert(sizeof(IntType) <= sizeof(ssize_t), "Implicit narrowing is not permitted.");
+    return static_cast<ssize_t>(val);
+}
+
+/// Approach used to cast a previously unknown C++ instance into a Python object
+enum class return_value_policy : uint8_t {
+    /** This is the default return value policy, which falls back to the policy
+        return_value_policy::take_ownership when the return value is a pointer.
+        Otherwise, it uses return_value::move or return_value::copy for rvalue
+        and lvalue references, respectively. See below for a description of what
+        all of these different policies do. */
+    automatic = 0,
+
+    /** As above, but use policy return_value_policy::reference when the return
+        value is a pointer. This is the default conversion policy for function
+        arguments when calling Python functions manually from C++ code (i.e. via
+        handle::operator()). You probably won't need to use this. */
+    automatic_reference,
+
+    /** Reference an existing object (i.e. do not create a new copy) and take
+        ownership. Python will call the destructor and delete operator when the
+        object's reference count reaches zero. Undefined behavior ensues when
+        the C++ side does the same.. */
+    take_ownership,
+
+    /** Create a new copy of the returned object, which will be owned by
+        Python. This policy is comparably safe because the lifetimes of the two
+        instances are decoupled. */
+    copy,
+
+    /** Use std::move to move the return value contents into a new instance
+        that will be owned by Python. This policy is comparably safe because the
+        lifetimes of the two instances (move source and destination) are
+        decoupled. */
+    move,
+
+    /** Reference an existing object, but do not take ownership. The C++ side
+        is responsible for managing the object's lifetime and deallocating it
+        when it is no longer used. Warning: undefined behavior will ensue when
+        the C++ side deletes an object that is still referenced and used by
+        Python. */
+    reference,
+
+    /** This policy only applies to methods and properties. It references the
+        object without taking ownership similar to the above
+        return_value_policy::reference policy. In contrast to that policy, the
+        function or property's implicit this argument (called the parent) is
+        considered to be the the owner of the return value (the child).
+        pybind11 then couples the lifetime of the parent to the child via a
+        reference relationship that ensures that the parent cannot be garbage
+        collected while Python is still using the child. More advanced
+        variations of this scheme are also possible using combinations of
+        return_value_policy::reference and the keep_alive call policy */
+    reference_internal
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+inline static constexpr int log2(size_t n, int k = 0) {
+    return (n <= 1) ? k : log2(n >> 1, k + 1);
+}
+
+// Returns the size as a multiple of sizeof(void *), rounded up.
+inline static constexpr size_t size_in_ptrs(size_t s) {
+    return 1 + ((s - 1) >> log2(sizeof(void *)));
+}
+
+/**
+ * The space to allocate for simple layout instance holders (see below) in multiple of the size of
+ * a pointer (e.g.  2 means 16 bytes on 64-bit architectures).  The default is the minimum required
+ * to holder either a std::unique_ptr or std::shared_ptr (which is almost always
+ * sizeof(std::shared_ptr<T>)).
+ */
+constexpr size_t instance_simple_holder_in_ptrs() {
+    static_assert(sizeof(std::shared_ptr<int>) >= sizeof(std::unique_ptr<int>),
+                  "pybind assumes std::shared_ptrs are at least as big as std::unique_ptrs");
+    return size_in_ptrs(sizeof(std::shared_ptr<int>));
+}
+
+// Forward declarations
+struct type_info;
+struct value_and_holder;
+
+struct nonsimple_values_and_holders {
+    void **values_and_holders;
+    uint8_t *status;
+};
+
+/// The 'instance' type which needs to be standard layout (need to be able to use 'offsetof')
+struct instance {
+    PyObject_HEAD
+    /// Storage for pointers and holder; see simple_layout, below, for a description
+    union {
+        void *simple_value_holder[1 + instance_simple_holder_in_ptrs()];
+        nonsimple_values_and_holders nonsimple;
+    };
+    /// Weak references
+    PyObject *weakrefs;
+    /// If true, the pointer is owned which means we're free to manage it with a holder.
+    bool owned : 1;
+    /**
+     * An instance has two possible value/holder layouts.
+     *
+     * Simple layout (when this flag is true), means the `simple_value_holder` is set with a
+     * pointer and the holder object governing that pointer, i.e. [val1*][holder].  This layout is
+     * applied whenever there is no python-side multiple inheritance of bound C++ types *and* the
+     * type's holder will fit in the default space (which is large enough to hold either a
+     * std::unique_ptr or std::shared_ptr).
+     *
+     * Non-simple layout applies when using custom holders that require more space than
+     * `shared_ptr` (which is typically the size of two pointers), or when multiple inheritance is
+     * used on the python side.  Non-simple layout allocates the required amount of memory to have
+     * multiple bound C++ classes as parents.  Under this layout, `nonsimple.values_and_holders` is
+     * set to a pointer to allocated space of the required space to hold a sequence of value
+     * pointers and holders followed `status`, a set of bit flags (1 byte each), i.e.
+     * [val1*][holder1][val2*][holder2]...[bb...]  where each [block] is rounded up to a multiple
+     * of `sizeof(void *)`.  `nonsimple.status` is, for convenience, a pointer to the beginning of
+     * the [bb...] block (but not independently allocated).
+     *
+     * Status bits indicate whether the associated holder is constructed (&
+     * status_holder_constructed) and whether the value pointer is registered (&
+     * status_instance_registered) in `registered_instances`.
+     */
+    bool simple_layout : 1;
+    /// For simple layout, tracks whether the holder has been constructed
+    bool simple_holder_constructed : 1;
+    /// For simple layout, tracks whether the instance is registered in `registered_instances`
+    bool simple_instance_registered : 1;
+    /// If true, get_internals().patients has an entry for this object
+    bool has_patients : 1;
+
+    /// Initializes all of the above type/values/holders data (but not the instance values
+    /// themselves)
+    void allocate_layout();
+
+    /// Destroys/deallocates all of the above
+    void deallocate_layout();
+
+    /// Returns the value_and_holder wrapper for the given type (or the first, if `find_type`
+    /// omitted).  Returns a default-constructed (with `.inst = nullptr`) object on failure if
+    /// `throw_if_missing` is false.
+    value_and_holder get_value_and_holder(const type_info *find_type = nullptr,
+                                          bool throw_if_missing = true);
+
+    /// Bit values for the non-simple status flags
+    static constexpr uint8_t status_holder_constructed = 1;
+    static constexpr uint8_t status_instance_registered = 2;
+};
+
+static_assert(std::is_standard_layout<instance>::value,
+              "Internal error: `pybind11::detail::instance` is not standard layout!");
+
+/// from __cpp_future__ import (convenient aliases from C++14/17)
+#if defined(PYBIND11_CPP14)
+using std::conditional_t;
+using std::enable_if_t;
+using std::remove_cv_t;
+using std::remove_reference_t;
+#else
+template <bool B, typename T = void>
+using enable_if_t = typename std::enable_if<B, T>::type;
+template <bool B, typename T, typename F>
+using conditional_t = typename std::conditional<B, T, F>::type;
+template <typename T>
+using remove_cv_t = typename std::remove_cv<T>::type;
+template <typename T>
+using remove_reference_t = typename std::remove_reference<T>::type;
+#endif
+
+#if defined(PYBIND11_CPP20)
+using std::remove_cvref;
+using std::remove_cvref_t;
+#else
+template <class T>
+struct remove_cvref {
+    using type = remove_cv_t<remove_reference_t<T>>;
+};
+template <class T>
+using remove_cvref_t = typename remove_cvref<T>::type;
+#endif
+
+/// Example usage: is_same_ignoring_cvref<T, PyObject *>::value
+template <typename T, typename U>
+using is_same_ignoring_cvref = std::is_same<detail::remove_cvref_t<T>, U>;
+
+/// Index sequences
+#if defined(PYBIND11_CPP14)
+using std::index_sequence;
+using std::make_index_sequence;
+#else
+template <size_t...>
+struct index_sequence {};
+template <size_t N, size_t... S>
+struct make_index_sequence_impl : make_index_sequence_impl<N - 1, N - 1, S...> {};
+template <size_t... S>
+struct make_index_sequence_impl<0, S...> {
+    using type = index_sequence<S...>;
+};
+template <size_t N>
+using make_index_sequence = typename make_index_sequence_impl<N>::type;
+#endif
+
+/// Make an index sequence of the indices of true arguments
+template <typename ISeq, size_t, bool...>
+struct select_indices_impl {
+    using type = ISeq;
+};
+template <size_t... IPrev, size_t I, bool B, bool... Bs>
+struct select_indices_impl<index_sequence<IPrev...>, I, B, Bs...>
+    : select_indices_impl<conditional_t<B, index_sequence<IPrev..., I>, index_sequence<IPrev...>>,
+                          I + 1,
+                          Bs...> {};
+template <bool... Bs>
+using select_indices = typename select_indices_impl<index_sequence<>, 0, Bs...>::type;
+
+/// Backports of std::bool_constant and std::negation to accommodate older compilers
+template <bool B>
+using bool_constant = std::integral_constant<bool, B>;
+template <typename T>
+struct negation : bool_constant<!T::value> {};
+
+// PGI/Intel cannot detect operator delete with the "compatible" void_t impl, so
+// using the new one (C++14 defect, so generally works on newer compilers, even
+// if not in C++17 mode)
+#if defined(__PGIC__) || defined(__INTEL_COMPILER)
+template <typename...>
+using void_t = void;
+#else
+template <typename...>
+struct void_t_impl {
+    using type = void;
+};
+template <typename... Ts>
+using void_t = typename void_t_impl<Ts...>::type;
+#endif
+
+/// Compile-time all/any/none of that check the boolean value of all template types
+#if defined(__cpp_fold_expressions) && !(defined(_MSC_VER) && (_MSC_VER < 1916))
+template <class... Ts>
+using all_of = bool_constant<(Ts::value && ...)>;
+template <class... Ts>
+using any_of = bool_constant<(Ts::value || ...)>;
+#elif !defined(_MSC_VER)
+template <bool...>
+struct bools {};
+template <class... Ts>
+using all_of = std::is_same<bools<Ts::value..., true>, bools<true, Ts::value...>>;
+template <class... Ts>
+using any_of = negation<all_of<negation<Ts>...>>;
+#else
+// MSVC has trouble with the above, but supports std::conjunction, which we can use instead (albeit
+// at a slight loss of compilation efficiency).
+template <class... Ts>
+using all_of = std::conjunction<Ts...>;
+template <class... Ts>
+using any_of = std::disjunction<Ts...>;
+#endif
+template <class... Ts>
+using none_of = negation<any_of<Ts...>>;
+
+template <class T, template <class> class... Predicates>
+using satisfies_all_of = all_of<Predicates<T>...>;
+template <class T, template <class> class... Predicates>
+using satisfies_any_of = any_of<Predicates<T>...>;
+template <class T, template <class> class... Predicates>
+using satisfies_none_of = none_of<Predicates<T>...>;
+
+/// Strip the class from a method type
+template <typename T>
+struct remove_class {};
+template <typename C, typename R, typename... A>
+struct remove_class<R (C::*)(A...)> {
+    using type = R(A...);
+};
+template <typename C, typename R, typename... A>
+struct remove_class<R (C::*)(A...) const> {
+    using type = R(A...);
+};
+#ifdef __cpp_noexcept_function_type
+template <typename C, typename R, typename... A>
+struct remove_class<R (C::*)(A...) noexcept> {
+    using type = R(A...);
+};
+template <typename C, typename R, typename... A>
+struct remove_class<R (C::*)(A...) const noexcept> {
+    using type = R(A...);
+};
+#endif
+/// Helper template to strip away type modifiers
+template <typename T>
+struct intrinsic_type {
+    using type = T;
+};
+template <typename T>
+struct intrinsic_type<const T> {
+    using type = typename intrinsic_type<T>::type;
+};
+template <typename T>
+struct intrinsic_type<T *> {
+    using type = typename intrinsic_type<T>::type;
+};
+template <typename T>
+struct intrinsic_type<T &> {
+    using type = typename intrinsic_type<T>::type;
+};
+template <typename T>
+struct intrinsic_type<T &&> {
+    using type = typename intrinsic_type<T>::type;
+};
+template <typename T, size_t N>
+struct intrinsic_type<const T[N]> {
+    using type = typename intrinsic_type<T>::type;
+};
+template <typename T, size_t N>
+struct intrinsic_type<T[N]> {
+    using type = typename intrinsic_type<T>::type;
+};
+template <typename T>
+using intrinsic_t = typename intrinsic_type<T>::type;
+
+/// Helper type to replace 'void' in some expressions
+struct void_type {};
+
+/// Helper template which holds a list of types
+template <typename...>
+struct type_list {};
+
+/// Compile-time integer sum
+#ifdef __cpp_fold_expressions
+template <typename... Ts>
+constexpr size_t constexpr_sum(Ts... ns) {
+    return (0 + ... + size_t{ns});
+}
+#else
+constexpr size_t constexpr_sum() { return 0; }
+template <typename T, typename... Ts>
+constexpr size_t constexpr_sum(T n, Ts... ns) {
+    return size_t{n} + constexpr_sum(ns...);
+}
+#endif
+
+PYBIND11_NAMESPACE_BEGIN(constexpr_impl)
+/// Implementation details for constexpr functions
+constexpr int first(int i) { return i; }
+template <typename T, typename... Ts>
+constexpr int first(int i, T v, Ts... vs) {
+    return v ? i : first(i + 1, vs...);
+}
+
+constexpr int last(int /*i*/, int result) { return result; }
+template <typename T, typename... Ts>
+constexpr int last(int i, int result, T v, Ts... vs) {
+    return last(i + 1, v ? i : result, vs...);
+}
+PYBIND11_NAMESPACE_END(constexpr_impl)
+
+/// Return the index of the first type in Ts which satisfies Predicate<T>.
+/// Returns sizeof...(Ts) if none match.
+template <template <typename> class Predicate, typename... Ts>
+constexpr int constexpr_first() {
+    return constexpr_impl::first(0, Predicate<Ts>::value...);
+}
+
+/// Return the index of the last type in Ts which satisfies Predicate<T>, or -1 if none match.
+template <template <typename> class Predicate, typename... Ts>
+constexpr int constexpr_last() {
+    return constexpr_impl::last(0, -1, Predicate<Ts>::value...);
+}
+
+/// Return the Nth element from the parameter pack
+template <size_t N, typename T, typename... Ts>
+struct pack_element {
+    using type = typename pack_element<N - 1, Ts...>::type;
+};
+template <typename T, typename... Ts>
+struct pack_element<0, T, Ts...> {
+    using type = T;
+};
+
+/// Return the one and only type which matches the predicate, or Default if none match.
+/// If more than one type matches the predicate, fail at compile-time.
+template <template <typename> class Predicate, typename Default, typename... Ts>
+struct exactly_one {
+    static constexpr auto found = constexpr_sum(Predicate<Ts>::value...);
+    static_assert(found <= 1, "Found more than one type matching the predicate");
+
+    static constexpr auto index = found ? constexpr_first<Predicate, Ts...>() : 0;
+    using type = conditional_t<found, typename pack_element<index, Ts...>::type, Default>;
+};
+template <template <typename> class P, typename Default>
+struct exactly_one<P, Default> {
+    using type = Default;
+};
+
+template <template <typename> class Predicate, typename Default, typename... Ts>
+using exactly_one_t = typename exactly_one<Predicate, Default, Ts...>::type;
+
+/// Defer the evaluation of type T until types Us are instantiated
+template <typename T, typename... /*Us*/>
+struct deferred_type {
+    using type = T;
+};
+template <typename T, typename... Us>
+using deferred_t = typename deferred_type<T, Us...>::type;
+
+/// Like is_base_of, but requires a strict base (i.e. `is_strict_base_of<T, T>::value == false`,
+/// unlike `std::is_base_of`)
+template <typename Base, typename Derived>
+using is_strict_base_of
+    = bool_constant<std::is_base_of<Base, Derived>::value && !std::is_same<Base, Derived>::value>;
+
+/// Like is_base_of, but also requires that the base type is accessible (i.e. that a Derived
+/// pointer can be converted to a Base pointer) For unions, `is_base_of<T, T>::value` is False, so
+/// we need to check `is_same` as well.
+template <typename Base, typename Derived>
+using is_accessible_base_of
+    = bool_constant<(std::is_same<Base, Derived>::value || std::is_base_of<Base, Derived>::value)
+                    && std::is_convertible<Derived *, Base *>::value>;
+
+template <template <typename...> class Base>
+struct is_template_base_of_impl {
+    template <typename... Us>
+    static std::true_type check(Base<Us...> *);
+    static std::false_type check(...);
+};
+
+/// Check if a template is the base of a type. For example:
+/// `is_template_base_of<Base, T>` is true if `struct T : Base<U> {}` where U can be anything
+template <template <typename...> class Base, typename T>
+// Sadly, all MSVC versions incl. 2022 need the workaround, even in C++20 mode.
+// See also: https://github.com/pybind/pybind11/pull/3741
+#if !defined(_MSC_VER)
+using is_template_base_of
+    = decltype(is_template_base_of_impl<Base>::check((intrinsic_t<T> *) nullptr));
+#else
+struct is_template_base_of
+    : decltype(is_template_base_of_impl<Base>::check((intrinsic_t<T> *) nullptr)){};
+#endif
+
+/// Check if T is an instantiation of the template `Class`. For example:
+/// `is_instantiation<shared_ptr, T>` is true if `T == shared_ptr<U>` where U can be anything.
+template <template <typename...> class Class, typename T>
+struct is_instantiation : std::false_type {};
+template <template <typename...> class Class, typename... Us>
+struct is_instantiation<Class, Class<Us...>> : std::true_type {};
+
+/// Check if T is std::shared_ptr<U> where U can be anything
+template <typename T>
+using is_shared_ptr = is_instantiation<std::shared_ptr, T>;
+
+/// Check if T looks like an input iterator
+template <typename T, typename = void>
+struct is_input_iterator : std::false_type {};
+template <typename T>
+struct is_input_iterator<T,
+                         void_t<decltype(*std::declval<T &>()), decltype(++std::declval<T &>())>>
+    : std::true_type {};
+
+template <typename T>
+using is_function_pointer
+    = bool_constant<std::is_pointer<T>::value
+                    && std::is_function<typename std::remove_pointer<T>::type>::value>;
+
+template <typename F>
+struct strip_function_object {
+    // If you are encountering an
+    // 'error: name followed by "::" must be a class or namespace name'
+    // with the Intel compiler and a noexcept function here,
+    // try to use noexcept(true) instead of plain noexcept.
+    using type = typename remove_class<decltype(&F::operator())>::type;
+};
+
+// Extracts the function signature from a function, function pointer or lambda.
+template <typename Function, typename F = remove_reference_t<Function>>
+using function_signature_t = conditional_t<
+    std::is_function<F>::value,
+    F,
+    typename conditional_t<std::is_pointer<F>::value || std::is_member_pointer<F>::value,
+                           std::remove_pointer<F>,
+                           strip_function_object<F>>::type>;
+
+/// Returns true if the type looks like a lambda: that is, isn't a function, pointer or member
+/// pointer.  Note that this can catch all sorts of other things, too; this is intended to be used
+/// in a place where passing a lambda makes sense.
+template <typename T>
+using is_lambda = satisfies_none_of<remove_reference_t<T>,
+                                    std::is_function,
+                                    std::is_pointer,
+                                    std::is_member_pointer>;
+
+// [workaround(intel)] Internal error on fold expression
+/// Apply a function over each element of a parameter pack
+#if defined(__cpp_fold_expressions) && !defined(__INTEL_COMPILER)
+// Intel compiler produces an internal error on this fold expression (tested with ICC 19.0.2)
+#    define PYBIND11_EXPAND_SIDE_EFFECTS(PATTERN) (((PATTERN), void()), ...)
+#else
+using expand_side_effects = bool[];
+#    define PYBIND11_EXPAND_SIDE_EFFECTS(PATTERN)                                                 \
+        (void) pybind11::detail::expand_side_effects { ((PATTERN), void(), false)..., false }
+#endif
+
+PYBIND11_NAMESPACE_END(detail)
+
+/// C++ bindings of builtin Python exceptions
+class PYBIND11_EXPORT_EXCEPTION builtin_exception : public std::runtime_error {
+public:
+    using std::runtime_error::runtime_error;
+    /// Set the error using the Python C API
+    virtual void set_error() const = 0;
+};
+
+#define PYBIND11_RUNTIME_EXCEPTION(name, type)                                                    \
+    class PYBIND11_EXPORT_EXCEPTION name : public builtin_exception {                             \
+    public:                                                                                       \
+        using builtin_exception::builtin_exception;                                               \
+        name() : name("") {}                                                                      \
+        void set_error() const override { PyErr_SetString(type, what()); }                        \
+    };
+
+PYBIND11_RUNTIME_EXCEPTION(stop_iteration, PyExc_StopIteration)
+PYBIND11_RUNTIME_EXCEPTION(index_error, PyExc_IndexError)
+PYBIND11_RUNTIME_EXCEPTION(key_error, PyExc_KeyError)
+PYBIND11_RUNTIME_EXCEPTION(value_error, PyExc_ValueError)
+PYBIND11_RUNTIME_EXCEPTION(type_error, PyExc_TypeError)
+PYBIND11_RUNTIME_EXCEPTION(buffer_error, PyExc_BufferError)
+PYBIND11_RUNTIME_EXCEPTION(import_error, PyExc_ImportError)
+PYBIND11_RUNTIME_EXCEPTION(attribute_error, PyExc_AttributeError)
+PYBIND11_RUNTIME_EXCEPTION(cast_error, PyExc_RuntimeError) /// Thrown when pybind11::cast or
+                                                           /// handle::call fail due to a type
+                                                           /// casting error
+PYBIND11_RUNTIME_EXCEPTION(reference_cast_error, PyExc_RuntimeError) /// Used internally
+
+[[noreturn]] PYBIND11_NOINLINE void pybind11_fail(const char *reason) {
+    assert(!PyErr_Occurred());
+    throw std::runtime_error(reason);
+}
+[[noreturn]] PYBIND11_NOINLINE void pybind11_fail(const std::string &reason) {
+    assert(!PyErr_Occurred());
+    throw std::runtime_error(reason);
+}
+
+template <typename T, typename SFINAE = void>
+struct format_descriptor {};
+
+template <typename T>
+struct format_descriptor<
+    T,
+    detail::enable_if_t<detail::is_same_ignoring_cvref<T, PyObject *>::value>> {
+    static constexpr const char c = 'O';
+    static constexpr const char value[2] = {c, '\0'};
+    static std::string format() { return std::string(1, c); }
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+// Returns the index of the given type in the type char array below, and in the list in numpy.h
+// The order here is: bool; 8 ints ((signed,unsigned)x(8,16,32,64)bits); float,double,long double;
+// complex float,double,long double.  Note that the long double types only participate when long
+// double is actually longer than double (it isn't under MSVC).
+// NB: not only the string below but also complex.h and numpy.h rely on this order.
+template <typename T, typename SFINAE = void>
+struct is_fmt_numeric {
+    static constexpr bool value = false;
+};
+template <typename T>
+struct is_fmt_numeric<T, enable_if_t<std::is_arithmetic<T>::value>> {
+    static constexpr bool value = true;
+    static constexpr int index
+        = std::is_same<T, bool>::value
+              ? 0
+              : 1
+                    + (std::is_integral<T>::value
+                           ? detail::log2(sizeof(T)) * 2 + std::is_unsigned<T>::value
+                           : 8
+                                 + (std::is_same<T, double>::value        ? 1
+                                    : std::is_same<T, long double>::value ? 2
+                                                                          : 0));
+};
+PYBIND11_NAMESPACE_END(detail)
+
+template <typename T>
+struct format_descriptor<T, detail::enable_if_t<std::is_arithmetic<T>::value>> {
+    static constexpr const char c = "?bBhHiIqQfdg"[detail::is_fmt_numeric<T>::index];
+    static constexpr const char value[2] = {c, '\0'};
+    static std::string format() { return std::string(1, c); }
+};
+
+#if !defined(PYBIND11_CPP17)
+
+template <typename T>
+constexpr const char
+    format_descriptor<T, detail::enable_if_t<std::is_arithmetic<T>::value>>::value[2];
+
+#endif
+
+/// RAII wrapper that temporarily clears any Python error state
+struct error_scope {
+    PyObject *type, *value, *trace;
+    error_scope() { PyErr_Fetch(&type, &value, &trace); }
+    error_scope(const error_scope &) = delete;
+    error_scope &operator=(const error_scope &) = delete;
+    ~error_scope() { PyErr_Restore(type, value, trace); }
+};
+
+/// Dummy destructor wrapper that can be used to expose classes with a private destructor
+struct nodelete {
+    template <typename T>
+    void operator()(T *) {}
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+template <typename... Args>
+struct overload_cast_impl {
+    template <typename Return>
+    constexpr auto operator()(Return (*pf)(Args...)) const noexcept -> decltype(pf) {
+        return pf;
+    }
+
+    template <typename Return, typename Class>
+    constexpr auto operator()(Return (Class::*pmf)(Args...),
+                              std::false_type = {}) const noexcept -> decltype(pmf) {
+        return pmf;
+    }
+
+    template <typename Return, typename Class>
+    constexpr auto operator()(Return (Class::*pmf)(Args...) const,
+                              std::true_type) const noexcept -> decltype(pmf) {
+        return pmf;
+    }
+};
+PYBIND11_NAMESPACE_END(detail)
+
+// overload_cast requires variable templates: C++14
+#if defined(PYBIND11_CPP14)
+#    define PYBIND11_OVERLOAD_CAST 1
+/// Syntax sugar for resolving overloaded function pointers:
+///  - regular: static_cast<Return (Class::*)(Arg0, Arg1, Arg2)>(&Class::func)
+///  - sweet:   overload_cast<Arg0, Arg1, Arg2>(&Class::func)
+template <typename... Args>
+static constexpr detail::overload_cast_impl<Args...> overload_cast{};
+#endif
+
+/// Const member function selector for overload_cast
+///  - regular: static_cast<Return (Class::*)(Arg) const>(&Class::func)
+///  - sweet:   overload_cast<Arg>(&Class::func, const_)
+static constexpr auto const_ = std::true_type{};
+
+#if !defined(PYBIND11_CPP14) // no overload_cast: providing something that static_assert-fails:
+template <typename... Args>
+struct overload_cast {
+    static_assert(detail::deferred_t<std::false_type, Args...>::value,
+                  "pybind11::overload_cast<...> requires compiling in C++14 mode");
+};
+#endif // overload_cast
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+// Adaptor for converting arbitrary container arguments into a vector; implicitly convertible from
+// any standard container (or C-style array) supporting std::begin/std::end, any singleton
+// arithmetic type (if T is arithmetic), or explicitly constructible from an iterator pair.
+template <typename T>
+class any_container {
+    std::vector<T> v;
+
+public:
+    any_container() = default;
+
+    // Can construct from a pair of iterators
+    template <typename It, typename = enable_if_t<is_input_iterator<It>::value>>
+    any_container(It first, It last) : v(first, last) {}
+
+    // Implicit conversion constructor from any arbitrary container type
+    // with values convertible to T
+    template <typename Container,
+              typename = enable_if_t<
+                  std::is_convertible<decltype(*std::begin(std::declval<const Container &>())),
+                                      T>::value>>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    any_container(const Container &c) : any_container(std::begin(c), std::end(c)) {}
+
+    // initializer_list's aren't deducible, so don't get matched by the above template;
+    // we need this to explicitly allow implicit conversion from one:
+    template <typename TIn, typename = enable_if_t<std::is_convertible<TIn, T>::value>>
+    any_container(const std::initializer_list<TIn> &c) : any_container(c.begin(), c.end()) {}
+
+    // Avoid copying if given an rvalue vector of the correct type.
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    any_container(std::vector<T> &&v) : v(std::move(v)) {}
+
+    // Moves the vector out of an rvalue any_container
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator std::vector<T> &&() && { return std::move(v); }
+
+    // Dereferencing obtains a reference to the underlying vector
+    std::vector<T> &operator*() { return v; }
+    const std::vector<T> &operator*() const { return v; }
+
+    // -> lets you call methods on the underlying vector
+    std::vector<T> *operator->() { return &v; }
+    const std::vector<T> *operator->() const { return &v; }
+};
+
+// Forward-declaration; see detail/class.h
+std::string get_fully_qualified_tp_name(PyTypeObject *);
+
+template <typename T>
+inline static std::shared_ptr<T>
+try_get_shared_from_this(std::enable_shared_from_this<T> *holder_value_ptr) {
+// Pre C++17, this code path exploits undefined behavior, but is known to work on many platforms.
+// Use at your own risk!
+// See also https://en.cppreference.com/w/cpp/memory/enable_shared_from_this, and in particular
+// the `std::shared_ptr<Good> gp1 = not_so_good.getptr();` and `try`-`catch` parts of the example.
+#if defined(__cpp_lib_enable_shared_from_this) && (!defined(_MSC_VER) || _MSC_VER >= 1912)
+    return holder_value_ptr->weak_from_this().lock();
+#else
+    try {
+        return holder_value_ptr->shared_from_this();
+    } catch (const std::bad_weak_ptr &) {
+        return nullptr;
+    }
+#endif
+}
+
+// For silencing "unused" compiler warnings in special situations.
+template <typename... Args>
+#if defined(_MSC_VER) && _MSC_VER < 1920 // MSVC 2017
+constexpr
+#endif
+    inline void
+    silence_unused_warnings(Args &&...) {
+}
+
+// MSVC warning C4100: Unreferenced formal parameter
+#if defined(_MSC_VER) && _MSC_VER <= 1916
+#    define PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(...)                                         \
+        detail::silence_unused_warnings(__VA_ARGS__)
+#else
+#    define PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(...)
+#endif
+
+// GCC -Wunused-but-set-parameter  All GCC versions (as of July 2021).
+#if defined(__GNUG__) && !defined(__clang__) && !defined(__INTEL_COMPILER)
+#    define PYBIND11_WORKAROUND_INCORRECT_GCC_UNUSED_BUT_SET_PARAMETER(...)                       \
+        detail::silence_unused_warnings(__VA_ARGS__)
+#else
+#    define PYBIND11_WORKAROUND_INCORRECT_GCC_UNUSED_BUT_SET_PARAMETER(...)
+#endif
+
+#if defined(__clang__)                                                                            \
+    && (defined(__apple_build_version__) /* AppleClang 13.0.0.13000029 was the only data point    \
+                                            available. */                                         \
+        || (__clang_major__ >= 7                                                                  \
+            && __clang_major__ <= 12) /* Clang 3, 5, 13, 14, 15 do not generate the warning. */   \
+    )
+#    define PYBIND11_DETECTED_CLANG_WITH_MISLEADING_CALL_STD_MOVE_EXPLICITLY_WARNING
+// Example:
+// tests/test_kwargs_and_defaults.cpp:46:68: error: local variable 'args' will be copied despite
+// being returned by name [-Werror,-Wreturn-std-move]
+//     m.def("args_function", [](py::args args) -> py::tuple { return args; });
+//                                                                    ^~~~
+// test_kwargs_and_defaults.cpp:46:68: note: call 'std::move' explicitly to avoid copying
+//     m.def("args_function", [](py::args args) -> py::tuple { return args; });
+//                                                                    ^~~~
+//                                                                    std::move(args)
+#endif
+
+// Pybind offers detailed error messages by default for all builts that are debug (through the
+// negation of NDEBUG). This can also be manually enabled by users, for any builds, through
+// defining PYBIND11_DETAILED_ERROR_MESSAGES. This information is primarily useful for those
+// who are writing (as opposed to merely using) libraries that use pybind11.
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES) && !defined(NDEBUG)
+#    define PYBIND11_DETAILED_ERROR_MESSAGES
+#endif
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/descr.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/descr.h
new file mode 100644
index 0000000000..7d546311e7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/descr.h
@@ -0,0 +1,172 @@
+/*
+    pybind11/detail/descr.h: Helper type for concatenating type signatures at compile time
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "common.h"
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+#if !defined(_MSC_VER)
+#    define PYBIND11_DESCR_CONSTEXPR static constexpr
+#else
+#    define PYBIND11_DESCR_CONSTEXPR const
+#endif
+
+/* Concatenate type signatures at compile time */
+template <size_t N, typename... Ts>
+struct descr {
+    char text[N + 1]{'\0'};
+
+    constexpr descr() = default;
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    constexpr descr(char const (&s)[N + 1]) : descr(s, make_index_sequence<N>()) {}
+
+    template <size_t... Is>
+    constexpr descr(char const (&s)[N + 1], index_sequence<Is...>) : text{s[Is]..., '\0'} {}
+
+    template <typename... Chars>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    constexpr descr(char c, Chars... cs) : text{c, static_cast<char>(cs)..., '\0'} {}
+
+    static constexpr std::array<const std::type_info *, sizeof...(Ts) + 1> types() {
+        return {{&typeid(Ts)..., nullptr}};
+    }
+};
+
+template <size_t N1, size_t N2, typename... Ts1, typename... Ts2, size_t... Is1, size_t... Is2>
+constexpr descr<N1 + N2, Ts1..., Ts2...> plus_impl(const descr<N1, Ts1...> &a,
+                                                   const descr<N2, Ts2...> &b,
+                                                   index_sequence<Is1...>,
+                                                   index_sequence<Is2...>) {
+    PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(b);
+    return {a.text[Is1]..., b.text[Is2]...};
+}
+
+template <size_t N1, size_t N2, typename... Ts1, typename... Ts2>
+constexpr descr<N1 + N2, Ts1..., Ts2...> operator+(const descr<N1, Ts1...> &a,
+                                                   const descr<N2, Ts2...> &b) {
+    return plus_impl(a, b, make_index_sequence<N1>(), make_index_sequence<N2>());
+}
+
+template <size_t N>
+constexpr descr<N - 1> const_name(char const (&text)[N]) {
+    return descr<N - 1>(text);
+}
+constexpr descr<0> const_name(char const (&)[1]) { return {}; }
+
+template <size_t Rem, size_t... Digits>
+struct int_to_str : int_to_str<Rem / 10, Rem % 10, Digits...> {};
+template <size_t... Digits>
+struct int_to_str<0, Digits...> {
+    // WARNING: This only works with C++17 or higher.
+    static constexpr auto digits = descr<sizeof...(Digits)>(('0' + Digits)...);
+};
+
+// Ternary description (like std::conditional)
+template <bool B, size_t N1, size_t N2>
+constexpr enable_if_t<B, descr<N1 - 1>> const_name(char const (&text1)[N1], char const (&)[N2]) {
+    return const_name(text1);
+}
+template <bool B, size_t N1, size_t N2>
+constexpr enable_if_t<!B, descr<N2 - 1>> const_name(char const (&)[N1], char const (&text2)[N2]) {
+    return const_name(text2);
+}
+
+template <bool B, typename T1, typename T2>
+constexpr enable_if_t<B, T1> const_name(const T1 &d, const T2 &) {
+    return d;
+}
+template <bool B, typename T1, typename T2>
+constexpr enable_if_t<!B, T2> const_name(const T1 &, const T2 &d) {
+    return d;
+}
+
+template <size_t Size>
+auto constexpr const_name() -> remove_cv_t<decltype(int_to_str<Size / 10, Size % 10>::digits)> {
+    return int_to_str<Size / 10, Size % 10>::digits;
+}
+
+template <typename Type>
+constexpr descr<1, Type> const_name() {
+    return {'%'};
+}
+
+// If "_" is defined as a macro, py::detail::_ cannot be provided.
+// It is therefore best to use py::detail::const_name universally.
+// This block is for backward compatibility only.
+// (The const_name code is repeated to avoid introducing a "_" #define ourselves.)
+#ifndef _
+#    define PYBIND11_DETAIL_UNDERSCORE_BACKWARD_COMPATIBILITY
+template <size_t N>
+constexpr descr<N - 1> _(char const (&text)[N]) {
+    return const_name<N>(text);
+}
+template <bool B, size_t N1, size_t N2>
+constexpr enable_if_t<B, descr<N1 - 1>> _(char const (&text1)[N1], char const (&text2)[N2]) {
+    return const_name<B, N1, N2>(text1, text2);
+}
+template <bool B, size_t N1, size_t N2>
+constexpr enable_if_t<!B, descr<N2 - 1>> _(char const (&text1)[N1], char const (&text2)[N2]) {
+    return const_name<B, N1, N2>(text1, text2);
+}
+template <bool B, typename T1, typename T2>
+constexpr enable_if_t<B, T1> _(const T1 &d1, const T2 &d2) {
+    return const_name<B, T1, T2>(d1, d2);
+}
+template <bool B, typename T1, typename T2>
+constexpr enable_if_t<!B, T2> _(const T1 &d1, const T2 &d2) {
+    return const_name<B, T1, T2>(d1, d2);
+}
+
+template <size_t Size>
+auto constexpr _() -> remove_cv_t<decltype(int_to_str<Size / 10, Size % 10>::digits)> {
+    return const_name<Size>();
+}
+template <typename Type>
+constexpr descr<1, Type> _() {
+    return const_name<Type>();
+}
+#endif // #ifndef _
+
+constexpr descr<0> concat() { return {}; }
+
+template <size_t N, typename... Ts>
+constexpr descr<N, Ts...> concat(const descr<N, Ts...> &descr) {
+    return descr;
+}
+
+#ifdef __cpp_fold_expressions
+template <size_t N1, size_t N2, typename... Ts1, typename... Ts2>
+constexpr descr<N1 + N2 + 2, Ts1..., Ts2...> operator,(const descr<N1, Ts1...> &a,
+                                                       const descr<N2, Ts2...> &b) {
+    return a + const_name(", ") + b;
+}
+
+template <size_t N, typename... Ts, typename... Args>
+constexpr auto concat(const descr<N, Ts...> &d, const Args &...args) {
+    return (d, ..., args);
+}
+#else
+template <size_t N, typename... Ts, typename... Args>
+constexpr auto concat(const descr<N, Ts...> &d,
+                      const Args &...args) -> decltype(std::declval<descr<N + 2, Ts...>>()
+                                                       + concat(args...)) {
+    return d + const_name(", ") + concat(args...);
+}
+#endif
+
+template <size_t N, typename... Ts>
+constexpr descr<N + 2, Ts...> type_descr(const descr<N, Ts...> &descr) {
+    return const_name("{") + descr + const_name("}");
+}
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/init.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/init.h
new file mode 100644
index 0000000000..4509bd131e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/init.h
@@ -0,0 +1,434 @@
+/*
+    pybind11/detail/init.h: init factory function implementation and support code.
+
+    Copyright (c) 2017 Jason Rhinelander <jason@imaginary.ca>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "class.h"
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+PYBIND11_WARNING_DISABLE_MSVC(4127)
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <>
+class type_caster<value_and_holder> {
+public:
+    bool load(handle h, bool) {
+        value = reinterpret_cast<value_and_holder *>(h.ptr());
+        return true;
+    }
+
+    template <typename>
+    using cast_op_type = value_and_holder &;
+    explicit operator value_and_holder &() { return *value; }
+    static constexpr auto name = const_name<value_and_holder>();
+
+private:
+    value_and_holder *value = nullptr;
+};
+
+PYBIND11_NAMESPACE_BEGIN(initimpl)
+
+inline void no_nullptr(void *ptr) {
+    if (!ptr) {
+        throw type_error("pybind11::init(): factory function returned nullptr");
+    }
+}
+
+// Implementing functions for all forms of py::init<...> and py::init(...)
+template <typename Class>
+using Cpp = typename Class::type;
+template <typename Class>
+using Alias = typename Class::type_alias;
+template <typename Class>
+using Holder = typename Class::holder_type;
+
+template <typename Class>
+using is_alias_constructible = std::is_constructible<Alias<Class>, Cpp<Class> &&>;
+
+// Takes a Cpp pointer and returns true if it actually is a polymorphic Alias instance.
+template <typename Class, enable_if_t<Class::has_alias, int> = 0>
+bool is_alias(Cpp<Class> *ptr) {
+    return dynamic_cast<Alias<Class> *>(ptr) != nullptr;
+}
+// Failing fallback version of the above for a no-alias class (always returns false)
+template <typename /*Class*/>
+constexpr bool is_alias(void *) {
+    return false;
+}
+
+// Constructs and returns a new object; if the given arguments don't map to a constructor, we fall
+// back to brace aggregate initialization so that for aggregate initialization can be used with
+// py::init, e.g.  `py::init<int, int>` to initialize a `struct T { int a; int b; }`.  For
+// non-aggregate types, we need to use an ordinary T(...) constructor (invoking as `T{...}` usually
+// works, but will not do the expected thing when `T` has an `initializer_list<T>` constructor).
+template <typename Class,
+          typename... Args,
+          detail::enable_if_t<std::is_constructible<Class, Args...>::value, int> = 0>
+inline Class *construct_or_initialize(Args &&...args) {
+    return new Class(std::forward<Args>(args)...);
+}
+template <typename Class,
+          typename... Args,
+          detail::enable_if_t<!std::is_constructible<Class, Args...>::value, int> = 0>
+inline Class *construct_or_initialize(Args &&...args) {
+    return new Class{std::forward<Args>(args)...};
+}
+
+// Attempts to constructs an alias using a `Alias(Cpp &&)` constructor.  This allows types with
+// an alias to provide only a single Cpp factory function as long as the Alias can be
+// constructed from an rvalue reference of the base Cpp type.  This means that Alias classes
+// can, when appropriate, simply define a `Alias(Cpp &&)` constructor rather than needing to
+// inherit all the base class constructors.
+template <typename Class>
+void construct_alias_from_cpp(std::true_type /*is_alias_constructible*/,
+                              value_and_holder &v_h,
+                              Cpp<Class> &&base) {
+    v_h.value_ptr() = new Alias<Class>(std::move(base));
+}
+template <typename Class>
+[[noreturn]] void construct_alias_from_cpp(std::false_type /*!is_alias_constructible*/,
+                                           value_and_holder &,
+                                           Cpp<Class> &&) {
+    throw type_error("pybind11::init(): unable to convert returned instance to required "
+                     "alias class: no `Alias<Class>(Class &&)` constructor available");
+}
+
+// Error-generating fallback for factories that don't match one of the below construction
+// mechanisms.
+template <typename Class>
+void construct(...) {
+    static_assert(!std::is_same<Class, Class>::value /* always false */,
+                  "pybind11::init(): init function must return a compatible pointer, "
+                  "holder, or value");
+}
+
+// Pointer return v1: the factory function returns a class pointer for a registered class.
+// If we don't need an alias (because this class doesn't have one, or because the final type is
+// inherited on the Python side) we can simply take over ownership.  Otherwise we need to try to
+// construct an Alias from the returned base instance.
+template <typename Class>
+void construct(value_and_holder &v_h, Cpp<Class> *ptr, bool need_alias) {
+    PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(need_alias);
+    no_nullptr(ptr);
+    if (Class::has_alias && need_alias && !is_alias<Class>(ptr)) {
+        // We're going to try to construct an alias by moving the cpp type.  Whether or not
+        // that succeeds, we still need to destroy the original cpp pointer (either the
+        // moved away leftover, if the alias construction works, or the value itself if we
+        // throw an error), but we can't just call `delete ptr`: it might have a special
+        // deleter, or might be shared_from_this.  So we construct a holder around it as if
+        // it was a normal instance, then steal the holder away into a local variable; thus
+        // the holder and destruction happens when we leave the C++ scope, and the holder
+        // class gets to handle the destruction however it likes.
+        v_h.value_ptr() = ptr;
+        v_h.set_instance_registered(true);          // To prevent init_instance from registering it
+        v_h.type->init_instance(v_h.inst, nullptr); // Set up the holder
+        Holder<Class> temp_holder(std::move(v_h.holder<Holder<Class>>())); // Steal the holder
+        v_h.type->dealloc(v_h); // Destroys the moved-out holder remains, resets value ptr to null
+        v_h.set_instance_registered(false);
+
+        construct_alias_from_cpp<Class>(is_alias_constructible<Class>{}, v_h, std::move(*ptr));
+    } else {
+        // Otherwise the type isn't inherited, so we don't need an Alias
+        v_h.value_ptr() = ptr;
+    }
+}
+
+// Pointer return v2: a factory that always returns an alias instance ptr.  We simply take over
+// ownership of the pointer.
+template <typename Class, enable_if_t<Class::has_alias, int> = 0>
+void construct(value_and_holder &v_h, Alias<Class> *alias_ptr, bool) {
+    no_nullptr(alias_ptr);
+    v_h.value_ptr() = static_cast<Cpp<Class> *>(alias_ptr);
+}
+
+// Holder return: copy its pointer, and move or copy the returned holder into the new instance's
+// holder.  This also handles types like std::shared_ptr<T> and std::unique_ptr<T> where T is a
+// derived type (through those holder's implicit conversion from derived class holder
+// constructors).
+template <typename Class>
+void construct(value_and_holder &v_h, Holder<Class> holder, bool need_alias) {
+    PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(need_alias);
+    auto *ptr = holder_helper<Holder<Class>>::get(holder);
+    no_nullptr(ptr);
+    // If we need an alias, check that the held pointer is actually an alias instance
+    if (Class::has_alias && need_alias && !is_alias<Class>(ptr)) {
+        throw type_error("pybind11::init(): construction failed: returned holder-wrapped instance "
+                         "is not an alias instance");
+    }
+
+    v_h.value_ptr() = ptr;
+    v_h.type->init_instance(v_h.inst, &holder);
+}
+
+// return-by-value version 1: returning a cpp class by value.  If the class has an alias and an
+// alias is required the alias must have an `Alias(Cpp &&)` constructor so that we can construct
+// the alias from the base when needed (i.e. because of Python-side inheritance).  When we don't
+// need it, we simply move-construct the cpp value into a new instance.
+template <typename Class>
+void construct(value_and_holder &v_h, Cpp<Class> &&result, bool need_alias) {
+    PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(need_alias);
+    static_assert(is_move_constructible<Cpp<Class>>::value,
+                  "pybind11::init() return-by-value factory function requires a movable class");
+    if (Class::has_alias && need_alias) {
+        construct_alias_from_cpp<Class>(is_alias_constructible<Class>{}, v_h, std::move(result));
+    } else {
+        v_h.value_ptr() = new Cpp<Class>(std::move(result));
+    }
+}
+
+// return-by-value version 2: returning a value of the alias type itself.  We move-construct an
+// Alias instance (even if no the python-side inheritance is involved).  The is intended for
+// cases where Alias initialization is always desired.
+template <typename Class>
+void construct(value_and_holder &v_h, Alias<Class> &&result, bool) {
+    static_assert(
+        is_move_constructible<Alias<Class>>::value,
+        "pybind11::init() return-by-alias-value factory function requires a movable alias class");
+    v_h.value_ptr() = new Alias<Class>(std::move(result));
+}
+
+// Implementing class for py::init<...>()
+template <typename... Args>
+struct constructor {
+    template <typename Class, typename... Extra, enable_if_t<!Class::has_alias, int> = 0>
+    static void execute(Class &cl, const Extra &...extra) {
+        cl.def(
+            "__init__",
+            [](value_and_holder &v_h, Args... args) {
+                v_h.value_ptr() = construct_or_initialize<Cpp<Class>>(std::forward<Args>(args)...);
+            },
+            is_new_style_constructor(),
+            extra...);
+    }
+
+    template <
+        typename Class,
+        typename... Extra,
+        enable_if_t<Class::has_alias && std::is_constructible<Cpp<Class>, Args...>::value, int>
+        = 0>
+    static void execute(Class &cl, const Extra &...extra) {
+        cl.def(
+            "__init__",
+            [](value_and_holder &v_h, Args... args) {
+                if (Py_TYPE(v_h.inst) == v_h.type->type) {
+                    v_h.value_ptr()
+                        = construct_or_initialize<Cpp<Class>>(std::forward<Args>(args)...);
+                } else {
+                    v_h.value_ptr()
+                        = construct_or_initialize<Alias<Class>>(std::forward<Args>(args)...);
+                }
+            },
+            is_new_style_constructor(),
+            extra...);
+    }
+
+    template <
+        typename Class,
+        typename... Extra,
+        enable_if_t<Class::has_alias && !std::is_constructible<Cpp<Class>, Args...>::value, int>
+        = 0>
+    static void execute(Class &cl, const Extra &...extra) {
+        cl.def(
+            "__init__",
+            [](value_and_holder &v_h, Args... args) {
+                v_h.value_ptr()
+                    = construct_or_initialize<Alias<Class>>(std::forward<Args>(args)...);
+            },
+            is_new_style_constructor(),
+            extra...);
+    }
+};
+
+// Implementing class for py::init_alias<...>()
+template <typename... Args>
+struct alias_constructor {
+    template <
+        typename Class,
+        typename... Extra,
+        enable_if_t<Class::has_alias && std::is_constructible<Alias<Class>, Args...>::value, int>
+        = 0>
+    static void execute(Class &cl, const Extra &...extra) {
+        cl.def(
+            "__init__",
+            [](value_and_holder &v_h, Args... args) {
+                v_h.value_ptr()
+                    = construct_or_initialize<Alias<Class>>(std::forward<Args>(args)...);
+            },
+            is_new_style_constructor(),
+            extra...);
+    }
+};
+
+// Implementation class for py::init(Func) and py::init(Func, AliasFunc)
+template <typename CFunc,
+          typename AFunc = void_type (*)(),
+          typename = function_signature_t<CFunc>,
+          typename = function_signature_t<AFunc>>
+struct factory;
+
+// Specialization for py::init(Func)
+template <typename Func, typename Return, typename... Args>
+struct factory<Func, void_type (*)(), Return(Args...)> {
+    remove_reference_t<Func> class_factory;
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    factory(Func &&f) : class_factory(std::forward<Func>(f)) {}
+
+    // The given class either has no alias or has no separate alias factory;
+    // this always constructs the class itself.  If the class is registered with an alias
+    // type and an alias instance is needed (i.e. because the final type is a Python class
+    // inheriting from the C++ type) the returned value needs to either already be an alias
+    // instance, or the alias needs to be constructible from a `Class &&` argument.
+    template <typename Class, typename... Extra>
+    void execute(Class &cl, const Extra &...extra) && {
+#if defined(PYBIND11_CPP14)
+        cl.def(
+            "__init__",
+            [func = std::move(class_factory)]
+#else
+        auto &func = class_factory;
+        cl.def(
+            "__init__",
+            [func]
+#endif
+            (value_and_holder &v_h, Args... args) {
+                construct<Class>(
+                    v_h, func(std::forward<Args>(args)...), Py_TYPE(v_h.inst) != v_h.type->type);
+            },
+            is_new_style_constructor(),
+            extra...);
+    }
+};
+
+// Specialization for py::init(Func, AliasFunc)
+template <typename CFunc,
+          typename AFunc,
+          typename CReturn,
+          typename... CArgs,
+          typename AReturn,
+          typename... AArgs>
+struct factory<CFunc, AFunc, CReturn(CArgs...), AReturn(AArgs...)> {
+    static_assert(sizeof...(CArgs) == sizeof...(AArgs),
+                  "pybind11::init(class_factory, alias_factory): class and alias factories "
+                  "must have identical argument signatures");
+    static_assert(all_of<std::is_same<CArgs, AArgs>...>::value,
+                  "pybind11::init(class_factory, alias_factory): class and alias factories "
+                  "must have identical argument signatures");
+
+    remove_reference_t<CFunc> class_factory;
+    remove_reference_t<AFunc> alias_factory;
+
+    factory(CFunc &&c, AFunc &&a)
+        : class_factory(std::forward<CFunc>(c)), alias_factory(std::forward<AFunc>(a)) {}
+
+    // The class factory is called when the `self` type passed to `__init__` is the direct
+    // class (i.e. not inherited), the alias factory when `self` is a Python-side subtype.
+    template <typename Class, typename... Extra>
+    void execute(Class &cl, const Extra &...extra) && {
+        static_assert(Class::has_alias,
+                      "The two-argument version of `py::init()` can "
+                      "only be used if the class has an alias");
+#if defined(PYBIND11_CPP14)
+        cl.def(
+            "__init__",
+            [class_func = std::move(class_factory), alias_func = std::move(alias_factory)]
+#else
+        auto &class_func = class_factory;
+        auto &alias_func = alias_factory;
+        cl.def(
+            "__init__",
+            [class_func, alias_func]
+#endif
+            (value_and_holder &v_h, CArgs... args) {
+                if (Py_TYPE(v_h.inst) == v_h.type->type) {
+                    // If the instance type equals the registered type we don't have inheritance,
+                    // so don't need the alias and can construct using the class function:
+                    construct<Class>(v_h, class_func(std::forward<CArgs>(args)...), false);
+                } else {
+                    construct<Class>(v_h, alias_func(std::forward<CArgs>(args)...), true);
+                }
+            },
+            is_new_style_constructor(),
+            extra...);
+    }
+};
+
+/// Set just the C++ state. Same as `__init__`.
+template <typename Class, typename T>
+void setstate(value_and_holder &v_h, T &&result, bool need_alias) {
+    construct<Class>(v_h, std::forward<T>(result), need_alias);
+}
+
+/// Set both the C++ and Python states
+template <typename Class,
+          typename T,
+          typename O,
+          enable_if_t<std::is_convertible<O, handle>::value, int> = 0>
+void setstate(value_and_holder &v_h, std::pair<T, O> &&result, bool need_alias) {
+    construct<Class>(v_h, std::move(result.first), need_alias);
+    auto d = handle(result.second);
+    if (PyDict_Check(d.ptr()) && PyDict_Size(d.ptr()) == 0) {
+        // Skipping setattr below, to not force use of py::dynamic_attr() for Class unnecessarily.
+        // See PR #2972 for details.
+        return;
+    }
+    setattr((PyObject *) v_h.inst, "__dict__", d);
+}
+
+/// Implementation for py::pickle(GetState, SetState)
+template <typename Get,
+          typename Set,
+          typename = function_signature_t<Get>,
+          typename = function_signature_t<Set>>
+struct pickle_factory;
+
+template <typename Get,
+          typename Set,
+          typename RetState,
+          typename Self,
+          typename NewInstance,
+          typename ArgState>
+struct pickle_factory<Get, Set, RetState(Self), NewInstance(ArgState)> {
+    static_assert(std::is_same<intrinsic_t<RetState>, intrinsic_t<ArgState>>::value,
+                  "The type returned by `__getstate__` must be the same "
+                  "as the argument accepted by `__setstate__`");
+
+    remove_reference_t<Get> get;
+    remove_reference_t<Set> set;
+
+    pickle_factory(Get get, Set set) : get(std::forward<Get>(get)), set(std::forward<Set>(set)) {}
+
+    template <typename Class, typename... Extra>
+    void execute(Class &cl, const Extra &...extra) && {
+        cl.def("__getstate__", std::move(get));
+
+#if defined(PYBIND11_CPP14)
+        cl.def(
+            "__setstate__",
+            [func = std::move(set)]
+#else
+        auto &func = set;
+        cl.def(
+            "__setstate__",
+            [func]
+#endif
+            (value_and_holder &v_h, ArgState state) {
+                setstate<Class>(
+                    v_h, func(std::forward<ArgState>(state)), Py_TYPE(v_h.inst) != v_h.type->type);
+            },
+            is_new_style_constructor(),
+            extra...);
+    }
+};
+
+PYBIND11_NAMESPACE_END(initimpl)
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/internals.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/internals.h
new file mode 100644
index 0000000000..e61c1687fc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/internals.h
@@ -0,0 +1,749 @@
+/*
+    pybind11/detail/internals.h: Internal data structure and related functions
+
+    Copyright (c) 2017 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "common.h"
+
+#if defined(PYBIND11_SIMPLE_GIL_MANAGEMENT)
+#    include "../gil.h"
+#endif
+
+#include "../pytypes.h"
+
+#include <exception>
+#include <mutex>
+#include <thread>
+
+/// Tracks the `internals` and `type_info` ABI version independent of the main library version.
+///
+/// Some portions of the code use an ABI that is conditional depending on this
+/// version number.  That allows ABI-breaking changes to be "pre-implemented".
+/// Once the default version number is incremented, the conditional logic that
+/// no longer applies can be removed.  Additionally, users that need not
+/// maintain ABI compatibility can increase the version number in order to take
+/// advantage of any functionality/efficiency improvements that depend on the
+/// newer ABI.
+///
+/// WARNING: If you choose to manually increase the ABI version, note that
+/// pybind11 may not be tested as thoroughly with a non-default ABI version, and
+/// further ABI-incompatible changes may be made before the ABI is officially
+/// changed to the new version.
+#ifndef PYBIND11_INTERNALS_VERSION
+#    if PY_VERSION_HEX >= 0x030C0000 || defined(_MSC_VER)
+// Version bump for Python 3.12+, before first 3.12 beta release.
+// Version bump for MSVC piggy-backed on PR #4779. See comments there.
+#        define PYBIND11_INTERNALS_VERSION 5
+#    else
+#        define PYBIND11_INTERNALS_VERSION 4
+#    endif
+#endif
+
+// This requirement is mainly to reduce the support burden (see PR #4570).
+static_assert(PY_VERSION_HEX < 0x030C0000 || PYBIND11_INTERNALS_VERSION >= 5,
+              "pybind11 ABI version 5 is the minimum for Python 3.12+");
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+using ExceptionTranslator = void (*)(std::exception_ptr);
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+constexpr const char *internals_function_record_capsule_name = "pybind11_function_record_capsule";
+
+// Forward declarations
+inline PyTypeObject *make_static_property_type();
+inline PyTypeObject *make_default_metaclass();
+inline PyObject *make_object_base_type(PyTypeObject *metaclass);
+
+// The old Python Thread Local Storage (TLS) API is deprecated in Python 3.7 in favor of the new
+// Thread Specific Storage (TSS) API.
+// Avoid unnecessary allocation of `Py_tss_t`, since we cannot use
+// `Py_LIMITED_API` anyway.
+#if PYBIND11_INTERNALS_VERSION > 4
+#    define PYBIND11_TLS_KEY_REF Py_tss_t &
+#    if defined(__clang__)
+#        define PYBIND11_TLS_KEY_INIT(var)                                                        \
+            _Pragma("clang diagnostic push")                                         /**/         \
+                _Pragma("clang diagnostic ignored \"-Wmissing-field-initializers\"") /**/         \
+                Py_tss_t var                                                                      \
+                = Py_tss_NEEDS_INIT;                                                              \
+            _Pragma("clang diagnostic pop")
+#    elif defined(__GNUC__) && !defined(__INTEL_COMPILER)
+#        define PYBIND11_TLS_KEY_INIT(var)                                                        \
+            _Pragma("GCC diagnostic push")                                         /**/           \
+                _Pragma("GCC diagnostic ignored \"-Wmissing-field-initializers\"") /**/           \
+                Py_tss_t var                                                                      \
+                = Py_tss_NEEDS_INIT;                                                              \
+            _Pragma("GCC diagnostic pop")
+#    else
+#        define PYBIND11_TLS_KEY_INIT(var) Py_tss_t var = Py_tss_NEEDS_INIT;
+#    endif
+#    define PYBIND11_TLS_KEY_CREATE(var) (PyThread_tss_create(&(var)) == 0)
+#    define PYBIND11_TLS_GET_VALUE(key) PyThread_tss_get(&(key))
+#    define PYBIND11_TLS_REPLACE_VALUE(key, value) PyThread_tss_set(&(key), (value))
+#    define PYBIND11_TLS_DELETE_VALUE(key) PyThread_tss_set(&(key), nullptr)
+#    define PYBIND11_TLS_FREE(key) PyThread_tss_delete(&(key))
+#else
+#    define PYBIND11_TLS_KEY_REF Py_tss_t *
+#    define PYBIND11_TLS_KEY_INIT(var) Py_tss_t *var = nullptr;
+#    define PYBIND11_TLS_KEY_CREATE(var)                                                          \
+        (((var) = PyThread_tss_alloc()) != nullptr && (PyThread_tss_create((var)) == 0))
+#    define PYBIND11_TLS_GET_VALUE(key) PyThread_tss_get((key))
+#    define PYBIND11_TLS_REPLACE_VALUE(key, value) PyThread_tss_set((key), (value))
+#    define PYBIND11_TLS_DELETE_VALUE(key) PyThread_tss_set((key), nullptr)
+#    define PYBIND11_TLS_FREE(key) PyThread_tss_free(key)
+#endif
+
+// Python loads modules by default with dlopen with the RTLD_LOCAL flag; under libc++ and possibly
+// other STLs, this means `typeid(A)` from one module won't equal `typeid(A)` from another module
+// even when `A` is the same, non-hidden-visibility type (e.g. from a common include).  Under
+// libstdc++, this doesn't happen: equality and the type_index hash are based on the type name,
+// which works.  If not under a known-good stl, provide our own name-based hash and equality
+// functions that use the type name.
+#if (PYBIND11_INTERNALS_VERSION <= 4 && defined(__GLIBCXX__))                                     \
+    || (PYBIND11_INTERNALS_VERSION >= 5 && !defined(_LIBCPP_VERSION))
+inline bool same_type(const std::type_info &lhs, const std::type_info &rhs) { return lhs == rhs; }
+using type_hash = std::hash<std::type_index>;
+using type_equal_to = std::equal_to<std::type_index>;
+#else
+inline bool same_type(const std::type_info &lhs, const std::type_info &rhs) {
+    return lhs.name() == rhs.name() || std::strcmp(lhs.name(), rhs.name()) == 0;
+}
+
+struct type_hash {
+    size_t operator()(const std::type_index &t) const {
+        size_t hash = 5381;
+        const char *ptr = t.name();
+        while (auto c = static_cast<unsigned char>(*ptr++)) {
+            hash = (hash * 33) ^ c;
+        }
+        return hash;
+    }
+};
+
+struct type_equal_to {
+    bool operator()(const std::type_index &lhs, const std::type_index &rhs) const {
+        return lhs.name() == rhs.name() || std::strcmp(lhs.name(), rhs.name()) == 0;
+    }
+};
+#endif
+
+template <typename value_type>
+using type_map = std::unordered_map<std::type_index, value_type, type_hash, type_equal_to>;
+
+struct override_hash {
+    inline size_t operator()(const std::pair<const PyObject *, const char *> &v) const {
+        size_t value = std::hash<const void *>()(v.first);
+        value ^= std::hash<const void *>()(v.second) + 0x9e3779b9 + (value << 6) + (value >> 2);
+        return value;
+    }
+};
+
+using instance_map = std::unordered_multimap<const void *, instance *>;
+
+// Instance map shards are used to reduce mutex contention in free-threaded Python.
+struct instance_map_shard {
+    std::mutex mutex;
+    instance_map registered_instances;
+    // alignas(64) would be better, but causes compile errors in macOS before 10.14 (see #5200)
+    char padding[64 - (sizeof(std::mutex) + sizeof(instance_map)) % 64];
+};
+
+/// Internal data structure used to track registered instances and types.
+/// Whenever binary incompatible changes are made to this structure,
+/// `PYBIND11_INTERNALS_VERSION` must be incremented.
+struct internals {
+#ifdef Py_GIL_DISABLED
+    std::mutex mutex;
+#endif
+    // std::type_index -> pybind11's type information
+    type_map<type_info *> registered_types_cpp;
+    // PyTypeObject* -> base type_info(s)
+    std::unordered_map<PyTypeObject *, std::vector<type_info *>> registered_types_py;
+#ifdef Py_GIL_DISABLED
+    std::unique_ptr<instance_map_shard[]> instance_shards; // void * -> instance*
+    size_t instance_shards_mask;
+#else
+    instance_map registered_instances; // void * -> instance*
+#endif
+    std::unordered_set<std::pair<const PyObject *, const char *>, override_hash>
+        inactive_override_cache;
+    type_map<std::vector<bool (*)(PyObject *, void *&)>> direct_conversions;
+    std::unordered_map<const PyObject *, std::vector<PyObject *>> patients;
+    std::forward_list<ExceptionTranslator> registered_exception_translators;
+    std::unordered_map<std::string, void *> shared_data; // Custom data to be shared across
+                                                         // extensions
+#if PYBIND11_INTERNALS_VERSION == 4
+    std::vector<PyObject *> unused_loader_patient_stack_remove_at_v5;
+#endif
+    std::forward_list<std::string> static_strings; // Stores the std::strings backing
+                                                   // detail::c_str()
+    PyTypeObject *static_property_type;
+    PyTypeObject *default_metaclass;
+    PyObject *instance_base;
+    // Unused if PYBIND11_SIMPLE_GIL_MANAGEMENT is defined:
+    PYBIND11_TLS_KEY_INIT(tstate)
+#if PYBIND11_INTERNALS_VERSION > 4
+    PYBIND11_TLS_KEY_INIT(loader_life_support_tls_key)
+#endif // PYBIND11_INTERNALS_VERSION > 4
+    // Unused if PYBIND11_SIMPLE_GIL_MANAGEMENT is defined:
+    PyInterpreterState *istate = nullptr;
+
+#if PYBIND11_INTERNALS_VERSION > 4
+    // Note that we have to use a std::string to allocate memory to ensure a unique address
+    // We want unique addresses since we use pointer equality to compare function records
+    std::string function_record_capsule_name = internals_function_record_capsule_name;
+#endif
+
+    internals() = default;
+    internals(const internals &other) = delete;
+    internals &operator=(const internals &other) = delete;
+    ~internals() {
+#if PYBIND11_INTERNALS_VERSION > 4
+        PYBIND11_TLS_FREE(loader_life_support_tls_key);
+#endif // PYBIND11_INTERNALS_VERSION > 4
+
+        // This destructor is called *after* Py_Finalize() in finalize_interpreter().
+        // That *SHOULD BE* fine. The following details what happens when PyThread_tss_free is
+        // called. PYBIND11_TLS_FREE is PyThread_tss_free on python 3.7+. On older python, it does
+        // nothing. PyThread_tss_free calls PyThread_tss_delete and PyMem_RawFree.
+        // PyThread_tss_delete just calls TlsFree (on Windows) or pthread_key_delete (on *NIX).
+        // Neither of those have anything to do with CPython internals. PyMem_RawFree *requires*
+        // that the `tstate` be allocated with the CPython allocator.
+        PYBIND11_TLS_FREE(tstate);
+    }
+};
+
+/// Additional type information which does not fit into the PyTypeObject.
+/// Changes to this struct also require bumping `PYBIND11_INTERNALS_VERSION`.
+struct type_info {
+    PyTypeObject *type;
+    const std::type_info *cpptype;
+    size_t type_size, type_align, holder_size_in_ptrs;
+    void *(*operator_new)(size_t);
+    void (*init_instance)(instance *, const void *);
+    void (*dealloc)(value_and_holder &v_h);
+    std::vector<PyObject *(*) (PyObject *, PyTypeObject *)> implicit_conversions;
+    std::vector<std::pair<const std::type_info *, void *(*) (void *)>> implicit_casts;
+    std::vector<bool (*)(PyObject *, void *&)> *direct_conversions;
+    buffer_info *(*get_buffer)(PyObject *, void *) = nullptr;
+    void *get_buffer_data = nullptr;
+    void *(*module_local_load)(PyObject *, const type_info *) = nullptr;
+    /* A simple type never occurs as a (direct or indirect) parent
+     * of a class that makes use of multiple inheritance.
+     * A type can be simple even if it has non-simple ancestors as long as it has no descendants.
+     */
+    bool simple_type : 1;
+    /* True if there is no multiple inheritance in this type's inheritance tree */
+    bool simple_ancestors : 1;
+    /* for base vs derived holder_type checks */
+    bool default_holder : 1;
+    /* true if this is a type registered with py::module_local */
+    bool module_local : 1;
+};
+
+/// On MSVC, debug and release builds are not ABI-compatible!
+#if defined(_MSC_VER) && defined(_DEBUG)
+#    define PYBIND11_BUILD_TYPE "_debug"
+#else
+#    define PYBIND11_BUILD_TYPE ""
+#endif
+
+/// Let's assume that different compilers are ABI-incompatible.
+/// A user can manually set this string if they know their
+/// compiler is compatible.
+#ifndef PYBIND11_COMPILER_TYPE
+#    if defined(_MSC_VER)
+#        define PYBIND11_COMPILER_TYPE "_msvc"
+#    elif defined(__INTEL_COMPILER)
+#        define PYBIND11_COMPILER_TYPE "_icc"
+#    elif defined(__clang__)
+#        define PYBIND11_COMPILER_TYPE "_clang"
+#    elif defined(__PGI)
+#        define PYBIND11_COMPILER_TYPE "_pgi"
+#    elif defined(__MINGW32__)
+#        define PYBIND11_COMPILER_TYPE "_mingw"
+#    elif defined(__CYGWIN__)
+#        define PYBIND11_COMPILER_TYPE "_gcc_cygwin"
+#    elif defined(__GNUC__)
+#        define PYBIND11_COMPILER_TYPE "_gcc"
+#    else
+#        define PYBIND11_COMPILER_TYPE "_unknown"
+#    endif
+#endif
+
+/// Also standard libs
+#ifndef PYBIND11_STDLIB
+#    if defined(_LIBCPP_VERSION)
+#        define PYBIND11_STDLIB "_libcpp"
+#    elif defined(__GLIBCXX__) || defined(__GLIBCPP__)
+#        define PYBIND11_STDLIB "_libstdcpp"
+#    else
+#        define PYBIND11_STDLIB ""
+#    endif
+#endif
+
+/// On Linux/OSX, changes in __GXX_ABI_VERSION__ indicate ABI incompatibility.
+/// On MSVC, changes in _MSC_VER may indicate ABI incompatibility (#2898).
+#ifndef PYBIND11_BUILD_ABI
+#    if defined(__GXX_ABI_VERSION)
+#        define PYBIND11_BUILD_ABI "_cxxabi" PYBIND11_TOSTRING(__GXX_ABI_VERSION)
+#    elif defined(_MSC_VER)
+#        define PYBIND11_BUILD_ABI "_mscver" PYBIND11_TOSTRING(_MSC_VER)
+#    else
+#        define PYBIND11_BUILD_ABI ""
+#    endif
+#endif
+
+#ifndef PYBIND11_INTERNALS_KIND
+#    define PYBIND11_INTERNALS_KIND ""
+#endif
+
+#define PYBIND11_INTERNALS_ID                                                                     \
+    "__pybind11_internals_v" PYBIND11_TOSTRING(PYBIND11_INTERNALS_VERSION)                        \
+        PYBIND11_INTERNALS_KIND PYBIND11_COMPILER_TYPE PYBIND11_STDLIB                            \
+            PYBIND11_BUILD_ABI PYBIND11_BUILD_TYPE "__"
+
+#define PYBIND11_MODULE_LOCAL_ID                                                                  \
+    "__pybind11_module_local_v" PYBIND11_TOSTRING(PYBIND11_INTERNALS_VERSION)                     \
+        PYBIND11_INTERNALS_KIND PYBIND11_COMPILER_TYPE PYBIND11_STDLIB                            \
+            PYBIND11_BUILD_ABI PYBIND11_BUILD_TYPE "__"
+
+/// Each module locally stores a pointer to the `internals` data. The data
+/// itself is shared among modules with the same `PYBIND11_INTERNALS_ID`.
+inline internals **&get_internals_pp() {
+    static internals **internals_pp = nullptr;
+    return internals_pp;
+}
+
+// forward decl
+inline void translate_exception(std::exception_ptr);
+
+template <class T,
+          enable_if_t<std::is_same<std::nested_exception, remove_cvref_t<T>>::value, int> = 0>
+bool handle_nested_exception(const T &exc, const std::exception_ptr &p) {
+    std::exception_ptr nested = exc.nested_ptr();
+    if (nested != nullptr && nested != p) {
+        translate_exception(nested);
+        return true;
+    }
+    return false;
+}
+
+template <class T,
+          enable_if_t<!std::is_same<std::nested_exception, remove_cvref_t<T>>::value, int> = 0>
+bool handle_nested_exception(const T &exc, const std::exception_ptr &p) {
+    if (const auto *nep = dynamic_cast<const std::nested_exception *>(std::addressof(exc))) {
+        return handle_nested_exception(*nep, p);
+    }
+    return false;
+}
+
+inline bool raise_err(PyObject *exc_type, const char *msg) {
+    if (PyErr_Occurred()) {
+        raise_from(exc_type, msg);
+        return true;
+    }
+    set_error(exc_type, msg);
+    return false;
+}
+
+inline void translate_exception(std::exception_ptr p) {
+    if (!p) {
+        return;
+    }
+    try {
+        std::rethrow_exception(p);
+    } catch (error_already_set &e) {
+        handle_nested_exception(e, p);
+        e.restore();
+        return;
+    } catch (const builtin_exception &e) {
+        // Could not use template since it's an abstract class.
+        if (const auto *nep = dynamic_cast<const std::nested_exception *>(std::addressof(e))) {
+            handle_nested_exception(*nep, p);
+        }
+        e.set_error();
+        return;
+    } catch (const std::bad_alloc &e) {
+        handle_nested_exception(e, p);
+        raise_err(PyExc_MemoryError, e.what());
+        return;
+    } catch (const std::domain_error &e) {
+        handle_nested_exception(e, p);
+        raise_err(PyExc_ValueError, e.what());
+        return;
+    } catch (const std::invalid_argument &e) {
+        handle_nested_exception(e, p);
+        raise_err(PyExc_ValueError, e.what());
+        return;
+    } catch (const std::length_error &e) {
+        handle_nested_exception(e, p);
+        raise_err(PyExc_ValueError, e.what());
+        return;
+    } catch (const std::out_of_range &e) {
+        handle_nested_exception(e, p);
+        raise_err(PyExc_IndexError, e.what());
+        return;
+    } catch (const std::range_error &e) {
+        handle_nested_exception(e, p);
+        raise_err(PyExc_ValueError, e.what());
+        return;
+    } catch (const std::overflow_error &e) {
+        handle_nested_exception(e, p);
+        raise_err(PyExc_OverflowError, e.what());
+        return;
+    } catch (const std::exception &e) {
+        handle_nested_exception(e, p);
+        raise_err(PyExc_RuntimeError, e.what());
+        return;
+    } catch (const std::nested_exception &e) {
+        handle_nested_exception(e, p);
+        raise_err(PyExc_RuntimeError, "Caught an unknown nested exception!");
+        return;
+    } catch (...) {
+        raise_err(PyExc_RuntimeError, "Caught an unknown exception!");
+        return;
+    }
+}
+
+#if !defined(__GLIBCXX__)
+inline void translate_local_exception(std::exception_ptr p) {
+    try {
+        if (p) {
+            std::rethrow_exception(p);
+        }
+    } catch (error_already_set &e) {
+        e.restore();
+        return;
+    } catch (const builtin_exception &e) {
+        e.set_error();
+        return;
+    }
+}
+#endif
+
+inline object get_python_state_dict() {
+    object state_dict;
+#if PYBIND11_INTERNALS_VERSION <= 4 || PY_VERSION_HEX < 0x03080000 || defined(PYPY_VERSION)
+    state_dict = reinterpret_borrow<object>(PyEval_GetBuiltins());
+#else
+#    if PY_VERSION_HEX < 0x03090000
+    PyInterpreterState *istate = _PyInterpreterState_Get();
+#    else
+    PyInterpreterState *istate = PyInterpreterState_Get();
+#    endif
+    if (istate) {
+        state_dict = reinterpret_borrow<object>(PyInterpreterState_GetDict(istate));
+    }
+#endif
+    if (!state_dict) {
+        raise_from(PyExc_SystemError, "pybind11::detail::get_python_state_dict() FAILED");
+        throw error_already_set();
+    }
+    return state_dict;
+}
+
+inline object get_internals_obj_from_state_dict(handle state_dict) {
+    return reinterpret_steal<object>(
+        dict_getitemstringref(state_dict.ptr(), PYBIND11_INTERNALS_ID));
+}
+
+inline internals **get_internals_pp_from_capsule(handle obj) {
+    void *raw_ptr = PyCapsule_GetPointer(obj.ptr(), /*name=*/nullptr);
+    if (raw_ptr == nullptr) {
+        raise_from(PyExc_SystemError, "pybind11::detail::get_internals_pp_from_capsule() FAILED");
+        throw error_already_set();
+    }
+    return static_cast<internals **>(raw_ptr);
+}
+
+inline uint64_t round_up_to_next_pow2(uint64_t x) {
+    // Round-up to the next power of two.
+    // See https://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2
+    x--;
+    x |= (x >> 1);
+    x |= (x >> 2);
+    x |= (x >> 4);
+    x |= (x >> 8);
+    x |= (x >> 16);
+    x |= (x >> 32);
+    x++;
+    return x;
+}
+
+/// Return a reference to the current `internals` data
+PYBIND11_NOINLINE internals &get_internals() {
+    auto **&internals_pp = get_internals_pp();
+    if (internals_pp && *internals_pp) {
+        return **internals_pp;
+    }
+
+#if defined(PYBIND11_SIMPLE_GIL_MANAGEMENT)
+    gil_scoped_acquire gil;
+#else
+    // Ensure that the GIL is held since we will need to make Python calls.
+    // Cannot use py::gil_scoped_acquire here since that constructor calls get_internals.
+    struct gil_scoped_acquire_local {
+        gil_scoped_acquire_local() : state(PyGILState_Ensure()) {}
+        gil_scoped_acquire_local(const gil_scoped_acquire_local &) = delete;
+        gil_scoped_acquire_local &operator=(const gil_scoped_acquire_local &) = delete;
+        ~gil_scoped_acquire_local() { PyGILState_Release(state); }
+        const PyGILState_STATE state;
+    } gil;
+#endif
+    error_scope err_scope;
+
+    dict state_dict = get_python_state_dict();
+    if (object internals_obj = get_internals_obj_from_state_dict(state_dict)) {
+        internals_pp = get_internals_pp_from_capsule(internals_obj);
+    }
+    if (internals_pp && *internals_pp) {
+        // We loaded the internals through `state_dict`, which means that our `error_already_set`
+        // and `builtin_exception` may be different local classes than the ones set up in the
+        // initial exception translator, below, so add another for our local exception classes.
+        //
+        // libstdc++ doesn't require this (types there are identified only by name)
+        // libc++ with CPython doesn't require this (types are explicitly exported)
+        // libc++ with PyPy still need it, awaiting further investigation
+#if !defined(__GLIBCXX__)
+        (*internals_pp)->registered_exception_translators.push_front(&translate_local_exception);
+#endif
+    } else {
+        if (!internals_pp) {
+            internals_pp = new internals *();
+        }
+        auto *&internals_ptr = *internals_pp;
+        internals_ptr = new internals();
+
+        PyThreadState *tstate = PyThreadState_Get();
+        // NOLINTNEXTLINE(bugprone-assignment-in-if-condition)
+        if (!PYBIND11_TLS_KEY_CREATE(internals_ptr->tstate)) {
+            pybind11_fail("get_internals: could not successfully initialize the tstate TSS key!");
+        }
+        PYBIND11_TLS_REPLACE_VALUE(internals_ptr->tstate, tstate);
+
+#if PYBIND11_INTERNALS_VERSION > 4
+        // NOLINTNEXTLINE(bugprone-assignment-in-if-condition)
+        if (!PYBIND11_TLS_KEY_CREATE(internals_ptr->loader_life_support_tls_key)) {
+            pybind11_fail("get_internals: could not successfully initialize the "
+                          "loader_life_support TSS key!");
+        }
+#endif
+        internals_ptr->istate = tstate->interp;
+        state_dict[PYBIND11_INTERNALS_ID] = capsule(internals_pp);
+        internals_ptr->registered_exception_translators.push_front(&translate_exception);
+        internals_ptr->static_property_type = make_static_property_type();
+        internals_ptr->default_metaclass = make_default_metaclass();
+        internals_ptr->instance_base = make_object_base_type(internals_ptr->default_metaclass);
+#ifdef Py_GIL_DISABLED
+        // Scale proportional to the number of cores. 2x is a heuristic to reduce contention.
+        auto num_shards
+            = static_cast<size_t>(round_up_to_next_pow2(2 * std::thread::hardware_concurrency()));
+        if (num_shards == 0) {
+            num_shards = 1;
+        }
+        internals_ptr->instance_shards.reset(new instance_map_shard[num_shards]);
+        internals_ptr->instance_shards_mask = num_shards - 1;
+#endif // Py_GIL_DISABLED
+    }
+    return **internals_pp;
+}
+
+// the internals struct (above) is shared between all the modules. local_internals are only
+// for a single module. Any changes made to internals may require an update to
+// PYBIND11_INTERNALS_VERSION, breaking backwards compatibility. local_internals is, by design,
+// restricted to a single module. Whether a module has local internals or not should not
+// impact any other modules, because the only things accessing the local internals is the
+// module that contains them.
+struct local_internals {
+    type_map<type_info *> registered_types_cpp;
+    std::forward_list<ExceptionTranslator> registered_exception_translators;
+#if PYBIND11_INTERNALS_VERSION == 4
+
+    // For ABI compatibility, we can't store the loader_life_support TLS key in
+    // the `internals` struct directly.  Instead, we store it in `shared_data` and
+    // cache a copy in `local_internals`.  If we allocated a separate TLS key for
+    // each instance of `local_internals`, we could end up allocating hundreds of
+    // TLS keys if hundreds of different pybind11 modules are loaded (which is a
+    // plausible number).
+    PYBIND11_TLS_KEY_INIT(loader_life_support_tls_key)
+
+    // Holds the shared TLS key for the loader_life_support stack.
+    struct shared_loader_life_support_data {
+        PYBIND11_TLS_KEY_INIT(loader_life_support_tls_key)
+        shared_loader_life_support_data() {
+            // NOLINTNEXTLINE(bugprone-assignment-in-if-condition)
+            if (!PYBIND11_TLS_KEY_CREATE(loader_life_support_tls_key)) {
+                pybind11_fail("local_internals: could not successfully initialize the "
+                              "loader_life_support TLS key!");
+            }
+        }
+        // We can't help but leak the TLS key, because Python never unloads extension modules.
+    };
+
+    local_internals() {
+        auto &internals = get_internals();
+        // Get or create the `loader_life_support_stack_key`.
+        auto &ptr = internals.shared_data["_life_support"];
+        if (!ptr) {
+            ptr = new shared_loader_life_support_data;
+        }
+        loader_life_support_tls_key
+            = static_cast<shared_loader_life_support_data *>(ptr)->loader_life_support_tls_key;
+    }
+#endif //  PYBIND11_INTERNALS_VERSION == 4
+};
+
+/// Works like `get_internals`, but for things which are locally registered.
+inline local_internals &get_local_internals() {
+    // Current static can be created in the interpreter finalization routine. If the later will be
+    // destroyed in another static variable destructor, creation of this static there will cause
+    // static deinitialization fiasco. In order to avoid it we avoid destruction of the
+    // local_internals static. One can read more about the problem and current solution here:
+    // https://google.github.io/styleguide/cppguide.html#Static_and_Global_Variables
+    static auto *locals = new local_internals();
+    return *locals;
+}
+
+#ifdef Py_GIL_DISABLED
+#    define PYBIND11_LOCK_INTERNALS(internals) std::unique_lock<std::mutex> lock((internals).mutex)
+#else
+#    define PYBIND11_LOCK_INTERNALS(internals)
+#endif
+
+template <typename F>
+inline auto with_internals(const F &cb) -> decltype(cb(get_internals())) {
+    auto &internals = get_internals();
+    PYBIND11_LOCK_INTERNALS(internals);
+    return cb(internals);
+}
+
+inline std::uint64_t mix64(std::uint64_t z) {
+    // David Stafford's variant 13 of the MurmurHash3 finalizer popularized
+    // by the SplitMix PRNG.
+    // https://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html
+    z = (z ^ (z >> 30)) * 0xbf58476d1ce4e5b9;
+    z = (z ^ (z >> 27)) * 0x94d049bb133111eb;
+    return z ^ (z >> 31);
+}
+
+template <typename F>
+inline auto with_instance_map(const void *ptr,
+                              const F &cb) -> decltype(cb(std::declval<instance_map &>())) {
+    auto &internals = get_internals();
+
+#ifdef Py_GIL_DISABLED
+    // Hash address to compute shard, but ignore low bits. We'd like allocations
+    // from the same thread/core to map to the same shard and allocations from
+    // other threads/cores to map to other shards. Using the high bits is a good
+    // heuristic because memory allocators often have a per-thread
+    // arena/superblock/segment from which smaller allocations are served.
+    auto addr = reinterpret_cast<std::uintptr_t>(ptr);
+    auto hash = mix64(static_cast<std::uint64_t>(addr >> 20));
+    auto idx = static_cast<size_t>(hash & internals.instance_shards_mask);
+
+    auto &shard = internals.instance_shards[idx];
+    std::unique_lock<std::mutex> lock(shard.mutex);
+    return cb(shard.registered_instances);
+#else
+    (void) ptr;
+    return cb(internals.registered_instances);
+#endif
+}
+
+// Returns the number of registered instances for testing purposes.  The result may not be
+// consistent if other threads are registering or unregistering instances concurrently.
+inline size_t num_registered_instances() {
+    auto &internals = get_internals();
+#ifdef Py_GIL_DISABLED
+    size_t count = 0;
+    for (size_t i = 0; i <= internals.instance_shards_mask; ++i) {
+        auto &shard = internals.instance_shards[i];
+        std::unique_lock<std::mutex> lock(shard.mutex);
+        count += shard.registered_instances.size();
+    }
+    return count;
+#else
+    return internals.registered_instances.size();
+#endif
+}
+
+/// Constructs a std::string with the given arguments, stores it in `internals`, and returns its
+/// `c_str()`.  Such strings objects have a long storage duration -- the internal strings are only
+/// cleared when the program exits or after interpreter shutdown (when embedding), and so are
+/// suitable for c-style strings needed by Python internals (such as PyTypeObject's tp_name).
+template <typename... Args>
+const char *c_str(Args &&...args) {
+    // GCC 4.8 doesn't like parameter unpack within lambda capture, so use
+    // PYBIND11_LOCK_INTERNALS.
+    auto &internals = get_internals();
+    PYBIND11_LOCK_INTERNALS(internals);
+    auto &strings = internals.static_strings;
+    strings.emplace_front(std::forward<Args>(args)...);
+    return strings.front().c_str();
+}
+
+inline const char *get_function_record_capsule_name() {
+#if PYBIND11_INTERNALS_VERSION > 4
+    return get_internals().function_record_capsule_name.c_str();
+#else
+    return nullptr;
+#endif
+}
+
+// Determine whether or not the following capsule contains a pybind11 function record.
+// Note that we use `internals` to make sure that only ABI compatible records are touched.
+//
+// This check is currently used in two places:
+// - An important optimization in functional.h to avoid overhead in C++ -> Python -> C++
+// - The sibling feature of cpp_function to allow overloads
+inline bool is_function_record_capsule(const capsule &cap) {
+    // Pointer equality as we rely on internals() to ensure unique pointers
+    return cap.name() == get_function_record_capsule_name();
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+/// Returns a named pointer that is shared among all extension modules (using the same
+/// pybind11 version) running in the current interpreter. Names starting with underscores
+/// are reserved for internal usage. Returns `nullptr` if no matching entry was found.
+PYBIND11_NOINLINE void *get_shared_data(const std::string &name) {
+    return detail::with_internals([&](detail::internals &internals) {
+        auto it = internals.shared_data.find(name);
+        return it != internals.shared_data.end() ? it->second : nullptr;
+    });
+}
+
+/// Set the shared data that can be later recovered by `get_shared_data()`.
+PYBIND11_NOINLINE void *set_shared_data(const std::string &name, void *data) {
+    return detail::with_internals([&](detail::internals &internals) {
+        internals.shared_data[name] = data;
+        return data;
+    });
+}
+
+/// Returns a typed reference to a shared data entry (by using `get_shared_data()`) if
+/// such entry exists. Otherwise, a new object of default-constructible type `T` is
+/// added to the shared data under the given name and a reference to it is returned.
+template <typename T>
+T &get_or_create_shared_data(const std::string &name) {
+    return *detail::with_internals([&](detail::internals &internals) {
+        auto it = internals.shared_data.find(name);
+        T *ptr = (T *) (it != internals.shared_data.end() ? it->second : nullptr);
+        if (!ptr) {
+            ptr = new T();
+            internals.shared_data[name] = ptr;
+        }
+        return ptr;
+    });
+}
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/type_caster_base.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/type_caster_base.h
new file mode 100644
index 0000000000..fd8c81b9ac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/type_caster_base.h
@@ -0,0 +1,1214 @@
+/*
+    pybind11/detail/type_caster_base.h (originally first part of pybind11/cast.h)
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "../pytypes.h"
+#include "common.h"
+#include "descr.h"
+#include "internals.h"
+#include "typeid.h"
+
+#include <cstdint>
+#include <iterator>
+#include <new>
+#include <string>
+#include <type_traits>
+#include <typeindex>
+#include <typeinfo>
+#include <unordered_map>
+#include <utility>
+#include <vector>
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+/// A life support system for temporary objects created by `type_caster::load()`.
+/// Adding a patient will keep it alive up until the enclosing function returns.
+class loader_life_support {
+private:
+    loader_life_support *parent = nullptr;
+    std::unordered_set<PyObject *> keep_alive;
+
+    // Store stack pointer in thread-local storage.
+    static PYBIND11_TLS_KEY_REF get_stack_tls_key() {
+#if PYBIND11_INTERNALS_VERSION == 4
+        return get_local_internals().loader_life_support_tls_key;
+#else
+        return get_internals().loader_life_support_tls_key;
+#endif
+    }
+    static loader_life_support *get_stack_top() {
+        return static_cast<loader_life_support *>(PYBIND11_TLS_GET_VALUE(get_stack_tls_key()));
+    }
+    static void set_stack_top(loader_life_support *value) {
+        PYBIND11_TLS_REPLACE_VALUE(get_stack_tls_key(), value);
+    }
+
+public:
+    /// A new patient frame is created when a function is entered
+    loader_life_support() : parent{get_stack_top()} { set_stack_top(this); }
+
+    /// ... and destroyed after it returns
+    ~loader_life_support() {
+        if (get_stack_top() != this) {
+            pybind11_fail("loader_life_support: internal error");
+        }
+        set_stack_top(parent);
+        for (auto *item : keep_alive) {
+            Py_DECREF(item);
+        }
+    }
+
+    /// This can only be used inside a pybind11-bound function, either by `argument_loader`
+    /// at argument preparation time or by `py::cast()` at execution time.
+    PYBIND11_NOINLINE static void add_patient(handle h) {
+        loader_life_support *frame = get_stack_top();
+        if (!frame) {
+            // NOTE: It would be nice to include the stack frames here, as this indicates
+            // use of pybind11::cast<> outside the normal call framework, finding such
+            // a location is challenging. Developers could consider printing out
+            // stack frame addresses here using something like __builtin_frame_address(0)
+            throw cast_error("When called outside a bound function, py::cast() cannot "
+                             "do Python -> C++ conversions which require the creation "
+                             "of temporary values");
+        }
+
+        if (frame->keep_alive.insert(h.ptr()).second) {
+            Py_INCREF(h.ptr());
+        }
+    }
+};
+
+// Gets the cache entry for the given type, creating it if necessary.  The return value is the pair
+// returned by emplace, i.e. an iterator for the entry and a bool set to `true` if the entry was
+// just created.
+inline std::pair<decltype(internals::registered_types_py)::iterator, bool>
+all_type_info_get_cache(PyTypeObject *type);
+
+// Band-aid workaround to fix a subtle but serious bug in a minimalistic fashion. See PR #4762.
+inline void all_type_info_add_base_most_derived_first(std::vector<type_info *> &bases,
+                                                      type_info *addl_base) {
+    for (auto it = bases.begin(); it != bases.end(); it++) {
+        type_info *existing_base = *it;
+        if (PyType_IsSubtype(addl_base->type, existing_base->type) != 0) {
+            bases.insert(it, addl_base);
+            return;
+        }
+    }
+    bases.push_back(addl_base);
+}
+
+// Populates a just-created cache entry.
+PYBIND11_NOINLINE void all_type_info_populate(PyTypeObject *t, std::vector<type_info *> &bases) {
+    assert(bases.empty());
+    std::vector<PyTypeObject *> check;
+    for (handle parent : reinterpret_borrow<tuple>(t->tp_bases)) {
+        check.push_back((PyTypeObject *) parent.ptr());
+    }
+
+    auto const &type_dict = get_internals().registered_types_py;
+    for (size_t i = 0; i < check.size(); i++) {
+        auto *type = check[i];
+        // Ignore Python2 old-style class super type:
+        if (!PyType_Check((PyObject *) type)) {
+            continue;
+        }
+
+        // Check `type` in the current set of registered python types:
+        auto it = type_dict.find(type);
+        if (it != type_dict.end()) {
+            // We found a cache entry for it, so it's either pybind-registered or has pre-computed
+            // pybind bases, but we have to make sure we haven't already seen the type(s) before:
+            // we want to follow Python/virtual C++ rules that there should only be one instance of
+            // a common base.
+            for (auto *tinfo : it->second) {
+                // NB: Could use a second set here, rather than doing a linear search, but since
+                // having a large number of immediate pybind11-registered types seems fairly
+                // unlikely, that probably isn't worthwhile.
+                bool found = false;
+                for (auto *known : bases) {
+                    if (known == tinfo) {
+                        found = true;
+                        break;
+                    }
+                }
+                if (!found) {
+                    all_type_info_add_base_most_derived_first(bases, tinfo);
+                }
+            }
+        } else if (type->tp_bases) {
+            // It's some python type, so keep follow its bases classes to look for one or more
+            // registered types
+            if (i + 1 == check.size()) {
+                // When we're at the end, we can pop off the current element to avoid growing
+                // `check` when adding just one base (which is typical--i.e. when there is no
+                // multiple inheritance)
+                check.pop_back();
+                i--;
+            }
+            for (handle parent : reinterpret_borrow<tuple>(type->tp_bases)) {
+                check.push_back((PyTypeObject *) parent.ptr());
+            }
+        }
+    }
+}
+
+/**
+ * Extracts vector of type_info pointers of pybind-registered roots of the given Python type.  Will
+ * be just 1 pybind type for the Python type of a pybind-registered class, or for any Python-side
+ * derived class that uses single inheritance.  Will contain as many types as required for a Python
+ * class that uses multiple inheritance to inherit (directly or indirectly) from multiple
+ * pybind-registered classes.  Will be empty if neither the type nor any base classes are
+ * pybind-registered.
+ *
+ * The value is cached for the lifetime of the Python type.
+ */
+inline const std::vector<detail::type_info *> &all_type_info(PyTypeObject *type) {
+    auto ins = all_type_info_get_cache(type);
+    if (ins.second) {
+        // New cache entry: populate it
+        all_type_info_populate(type, ins.first->second);
+    }
+
+    return ins.first->second;
+}
+
+/**
+ * Gets a single pybind11 type info for a python type.  Returns nullptr if neither the type nor any
+ * ancestors are pybind11-registered.  Throws an exception if there are multiple bases--use
+ * `all_type_info` instead if you want to support multiple bases.
+ */
+PYBIND11_NOINLINE detail::type_info *get_type_info(PyTypeObject *type) {
+    const auto &bases = all_type_info(type);
+    if (bases.empty()) {
+        return nullptr;
+    }
+    if (bases.size() > 1) {
+        pybind11_fail(
+            "pybind11::detail::get_type_info: type has multiple pybind11-registered bases");
+    }
+    return bases.front();
+}
+
+inline detail::type_info *get_local_type_info(const std::type_index &tp) {
+    auto &locals = get_local_internals().registered_types_cpp;
+    auto it = locals.find(tp);
+    if (it != locals.end()) {
+        return it->second;
+    }
+    return nullptr;
+}
+
+inline detail::type_info *get_global_type_info(const std::type_index &tp) {
+    return with_internals([&](internals &internals) {
+        detail::type_info *type_info = nullptr;
+        auto &types = internals.registered_types_cpp;
+        auto it = types.find(tp);
+        if (it != types.end()) {
+            type_info = it->second;
+        }
+        return type_info;
+    });
+}
+
+/// Return the type info for a given C++ type; on lookup failure can either throw or return
+/// nullptr.
+PYBIND11_NOINLINE detail::type_info *get_type_info(const std::type_index &tp,
+                                                   bool throw_if_missing = false) {
+    if (auto *ltype = get_local_type_info(tp)) {
+        return ltype;
+    }
+    if (auto *gtype = get_global_type_info(tp)) {
+        return gtype;
+    }
+
+    if (throw_if_missing) {
+        std::string tname = tp.name();
+        detail::clean_type_id(tname);
+        pybind11_fail("pybind11::detail::get_type_info: unable to find type info for \""
+                      + std::move(tname) + '"');
+    }
+    return nullptr;
+}
+
+PYBIND11_NOINLINE handle get_type_handle(const std::type_info &tp, bool throw_if_missing) {
+    detail::type_info *type_info = get_type_info(tp, throw_if_missing);
+    return handle(type_info ? ((PyObject *) type_info->type) : nullptr);
+}
+
+// Searches the inheritance graph for a registered Python instance, using all_type_info().
+PYBIND11_NOINLINE handle find_registered_python_instance(void *src,
+                                                         const detail::type_info *tinfo) {
+    return with_instance_map(src, [&](instance_map &instances) {
+        auto it_instances = instances.equal_range(src);
+        for (auto it_i = it_instances.first; it_i != it_instances.second; ++it_i) {
+            for (auto *instance_type : detail::all_type_info(Py_TYPE(it_i->second))) {
+                if (instance_type && same_type(*instance_type->cpptype, *tinfo->cpptype)) {
+                    return handle((PyObject *) it_i->second).inc_ref();
+                }
+            }
+        }
+        return handle();
+    });
+}
+
+struct value_and_holder {
+    instance *inst = nullptr;
+    size_t index = 0u;
+    const detail::type_info *type = nullptr;
+    void **vh = nullptr;
+
+    // Main constructor for a found value/holder:
+    value_and_holder(instance *i, const detail::type_info *type, size_t vpos, size_t index)
+        : inst{i}, index{index}, type{type},
+          vh{inst->simple_layout ? inst->simple_value_holder
+                                 : &inst->nonsimple.values_and_holders[vpos]} {}
+
+    // Default constructor (used to signal a value-and-holder not found by get_value_and_holder())
+    value_and_holder() = default;
+
+    // Used for past-the-end iterator
+    explicit value_and_holder(size_t index) : index{index} {}
+
+    template <typename V = void>
+    V *&value_ptr() const {
+        return reinterpret_cast<V *&>(vh[0]);
+    }
+    // True if this `value_and_holder` has a non-null value pointer
+    explicit operator bool() const { return value_ptr() != nullptr; }
+
+    template <typename H>
+    H &holder() const {
+        return reinterpret_cast<H &>(vh[1]);
+    }
+    bool holder_constructed() const {
+        return inst->simple_layout
+                   ? inst->simple_holder_constructed
+                   : (inst->nonsimple.status[index] & instance::status_holder_constructed) != 0u;
+    }
+    // NOLINTNEXTLINE(readability-make-member-function-const)
+    void set_holder_constructed(bool v = true) {
+        if (inst->simple_layout) {
+            inst->simple_holder_constructed = v;
+        } else if (v) {
+            inst->nonsimple.status[index] |= instance::status_holder_constructed;
+        } else {
+            inst->nonsimple.status[index] &= (std::uint8_t) ~instance::status_holder_constructed;
+        }
+    }
+    bool instance_registered() const {
+        return inst->simple_layout
+                   ? inst->simple_instance_registered
+                   : ((inst->nonsimple.status[index] & instance::status_instance_registered) != 0);
+    }
+    // NOLINTNEXTLINE(readability-make-member-function-const)
+    void set_instance_registered(bool v = true) {
+        if (inst->simple_layout) {
+            inst->simple_instance_registered = v;
+        } else if (v) {
+            inst->nonsimple.status[index] |= instance::status_instance_registered;
+        } else {
+            inst->nonsimple.status[index] &= (std::uint8_t) ~instance::status_instance_registered;
+        }
+    }
+};
+
+// Container for accessing and iterating over an instance's values/holders
+struct values_and_holders {
+private:
+    instance *inst;
+    using type_vec = std::vector<detail::type_info *>;
+    const type_vec &tinfo;
+
+public:
+    explicit values_and_holders(instance *inst)
+        : inst{inst}, tinfo(all_type_info(Py_TYPE(inst))) {}
+
+    explicit values_and_holders(PyObject *obj)
+        : inst{nullptr}, tinfo(all_type_info(Py_TYPE(obj))) {
+        if (!tinfo.empty()) {
+            inst = reinterpret_cast<instance *>(obj);
+        }
+    }
+
+    struct iterator {
+    private:
+        instance *inst = nullptr;
+        const type_vec *types = nullptr;
+        value_and_holder curr;
+        friend struct values_and_holders;
+        iterator(instance *inst, const type_vec *tinfo) : inst{inst}, types{tinfo} {
+            if (inst != nullptr) {
+                assert(!types->empty());
+                curr = value_and_holder(
+                    inst /* instance */,
+                    (*types)[0] /* type info */,
+                    0, /* vpos: (non-simple types only): the first vptr comes first */
+                    0 /* index */);
+            }
+        }
+        // Past-the-end iterator:
+        explicit iterator(size_t end) : curr(end) {}
+
+    public:
+        bool operator==(const iterator &other) const { return curr.index == other.curr.index; }
+        bool operator!=(const iterator &other) const { return curr.index != other.curr.index; }
+        iterator &operator++() {
+            if (!inst->simple_layout) {
+                curr.vh += 1 + (*types)[curr.index]->holder_size_in_ptrs;
+            }
+            ++curr.index;
+            curr.type = curr.index < types->size() ? (*types)[curr.index] : nullptr;
+            return *this;
+        }
+        value_and_holder &operator*() { return curr; }
+        value_and_holder *operator->() { return &curr; }
+    };
+
+    iterator begin() { return iterator(inst, &tinfo); }
+    iterator end() { return iterator(tinfo.size()); }
+
+    iterator find(const type_info *find_type) {
+        auto it = begin(), endit = end();
+        while (it != endit && it->type != find_type) {
+            ++it;
+        }
+        return it;
+    }
+
+    size_t size() { return tinfo.size(); }
+
+    // Band-aid workaround to fix a subtle but serious bug in a minimalistic fashion. See PR #4762.
+    bool is_redundant_value_and_holder(const value_and_holder &vh) {
+        for (size_t i = 0; i < vh.index; i++) {
+            if (PyType_IsSubtype(tinfo[i]->type, tinfo[vh.index]->type) != 0) {
+                return true;
+            }
+        }
+        return false;
+    }
+};
+
+/**
+ * Extracts C++ value and holder pointer references from an instance (which may contain multiple
+ * values/holders for python-side multiple inheritance) that match the given type.  Throws an error
+ * if the given type (or ValueType, if omitted) is not a pybind11 base of the given instance.  If
+ * `find_type` is omitted (or explicitly specified as nullptr) the first value/holder are returned,
+ * regardless of type (and the resulting .type will be nullptr).
+ *
+ * The returned object should be short-lived: in particular, it must not outlive the called-upon
+ * instance.
+ */
+PYBIND11_NOINLINE value_and_holder
+instance::get_value_and_holder(const type_info *find_type /*= nullptr default in common.h*/,
+                               bool throw_if_missing /*= true in common.h*/) {
+    // Optimize common case:
+    if (!find_type || Py_TYPE(this) == find_type->type) {
+        return value_and_holder(this, find_type, 0, 0);
+    }
+
+    detail::values_and_holders vhs(this);
+    auto it = vhs.find(find_type);
+    if (it != vhs.end()) {
+        return *it;
+    }
+
+    if (!throw_if_missing) {
+        return value_and_holder();
+    }
+
+#if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+    pybind11_fail("pybind11::detail::instance::get_value_and_holder: `"
+                  + get_fully_qualified_tp_name(find_type->type)
+                  + "' is not a pybind11 base of the given `"
+                  + get_fully_qualified_tp_name(Py_TYPE(this)) + "' instance");
+#else
+    pybind11_fail(
+        "pybind11::detail::instance::get_value_and_holder: "
+        "type is not a pybind11 base of the given instance "
+        "(#define PYBIND11_DETAILED_ERROR_MESSAGES or compile in debug mode for type details)");
+#endif
+}
+
+PYBIND11_NOINLINE void instance::allocate_layout() {
+    const auto &tinfo = all_type_info(Py_TYPE(this));
+
+    const size_t n_types = tinfo.size();
+
+    if (n_types == 0) {
+        pybind11_fail(
+            "instance allocation failed: new instance has no pybind11-registered base types");
+    }
+
+    simple_layout
+        = n_types == 1 && tinfo.front()->holder_size_in_ptrs <= instance_simple_holder_in_ptrs();
+
+    // Simple path: no python-side multiple inheritance, and a small-enough holder
+    if (simple_layout) {
+        simple_value_holder[0] = nullptr;
+        simple_holder_constructed = false;
+        simple_instance_registered = false;
+    } else { // multiple base types or a too-large holder
+        // Allocate space to hold: [v1*][h1][v2*][h2]...[bb...] where [vN*] is a value pointer,
+        // [hN] is the (uninitialized) holder instance for value N, and [bb...] is a set of bool
+        // values that tracks whether each associated holder has been initialized.  Each [block] is
+        // padded, if necessary, to an integer multiple of sizeof(void *).
+        size_t space = 0;
+        for (auto *t : tinfo) {
+            space += 1;                      // value pointer
+            space += t->holder_size_in_ptrs; // holder instance
+        }
+        size_t flags_at = space;
+        space += size_in_ptrs(n_types); // status bytes (holder_constructed and
+                                        // instance_registered)
+
+        // Allocate space for flags, values, and holders, and initialize it to 0 (flags and values,
+        // in particular, need to be 0).  Use Python's memory allocation
+        // functions: Python is using pymalloc, which is designed to be
+        // efficient for small allocations like the one we're doing here;
+        // for larger allocations they are just wrappers around malloc.
+        // TODO: is this still true for pure Python 3.6?
+        nonsimple.values_and_holders = (void **) PyMem_Calloc(space, sizeof(void *));
+        if (!nonsimple.values_and_holders) {
+            throw std::bad_alloc();
+        }
+        nonsimple.status
+            = reinterpret_cast<std::uint8_t *>(&nonsimple.values_and_holders[flags_at]);
+    }
+    owned = true;
+}
+
+// NOLINTNEXTLINE(readability-make-member-function-const)
+PYBIND11_NOINLINE void instance::deallocate_layout() {
+    if (!simple_layout) {
+        PyMem_Free(nonsimple.values_and_holders);
+    }
+}
+
+PYBIND11_NOINLINE bool isinstance_generic(handle obj, const std::type_info &tp) {
+    handle type = detail::get_type_handle(tp, false);
+    if (!type) {
+        return false;
+    }
+    return isinstance(obj, type);
+}
+
+PYBIND11_NOINLINE handle get_object_handle(const void *ptr, const detail::type_info *type) {
+    return with_instance_map(ptr, [&](instance_map &instances) {
+        auto range = instances.equal_range(ptr);
+        for (auto it = range.first; it != range.second; ++it) {
+            for (const auto &vh : values_and_holders(it->second)) {
+                if (vh.type == type) {
+                    return handle((PyObject *) it->second);
+                }
+            }
+        }
+        return handle();
+    });
+}
+
+inline PyThreadState *get_thread_state_unchecked() {
+#if defined(PYPY_VERSION)
+    return PyThreadState_GET();
+#elif PY_VERSION_HEX < 0x030D0000
+    return _PyThreadState_UncheckedGet();
+#else
+    return PyThreadState_GetUnchecked();
+#endif
+}
+
+// Forward declarations
+void keep_alive_impl(handle nurse, handle patient);
+inline PyObject *make_new_instance(PyTypeObject *type);
+
+class type_caster_generic {
+public:
+    PYBIND11_NOINLINE explicit type_caster_generic(const std::type_info &type_info)
+        : typeinfo(get_type_info(type_info)), cpptype(&type_info) {}
+
+    explicit type_caster_generic(const type_info *typeinfo)
+        : typeinfo(typeinfo), cpptype(typeinfo ? typeinfo->cpptype : nullptr) {}
+
+    bool load(handle src, bool convert) { return load_impl<type_caster_generic>(src, convert); }
+
+    PYBIND11_NOINLINE static handle cast(const void *_src,
+                                         return_value_policy policy,
+                                         handle parent,
+                                         const detail::type_info *tinfo,
+                                         void *(*copy_constructor)(const void *),
+                                         void *(*move_constructor)(const void *),
+                                         const void *existing_holder = nullptr) {
+        if (!tinfo) { // no type info: error will be set already
+            return handle();
+        }
+
+        void *src = const_cast<void *>(_src);
+        if (src == nullptr) {
+            return none().release();
+        }
+
+        if (handle registered_inst = find_registered_python_instance(src, tinfo)) {
+            return registered_inst;
+        }
+
+        auto inst = reinterpret_steal<object>(make_new_instance(tinfo->type));
+        auto *wrapper = reinterpret_cast<instance *>(inst.ptr());
+        wrapper->owned = false;
+        void *&valueptr = values_and_holders(wrapper).begin()->value_ptr();
+
+        switch (policy) {
+            case return_value_policy::automatic:
+            case return_value_policy::take_ownership:
+                valueptr = src;
+                wrapper->owned = true;
+                break;
+
+            case return_value_policy::automatic_reference:
+            case return_value_policy::reference:
+                valueptr = src;
+                wrapper->owned = false;
+                break;
+
+            case return_value_policy::copy:
+                if (copy_constructor) {
+                    valueptr = copy_constructor(src);
+                } else {
+#if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+                    std::string type_name(tinfo->cpptype->name());
+                    detail::clean_type_id(type_name);
+                    throw cast_error("return_value_policy = copy, but type " + type_name
+                                     + " is non-copyable!");
+#else
+                    throw cast_error("return_value_policy = copy, but type is "
+                                     "non-copyable! (#define PYBIND11_DETAILED_ERROR_MESSAGES or "
+                                     "compile in debug mode for details)");
+#endif
+                }
+                wrapper->owned = true;
+                break;
+
+            case return_value_policy::move:
+                if (move_constructor) {
+                    valueptr = move_constructor(src);
+                } else if (copy_constructor) {
+                    valueptr = copy_constructor(src);
+                } else {
+#if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+                    std::string type_name(tinfo->cpptype->name());
+                    detail::clean_type_id(type_name);
+                    throw cast_error("return_value_policy = move, but type " + type_name
+                                     + " is neither movable nor copyable!");
+#else
+                    throw cast_error("return_value_policy = move, but type is neither "
+                                     "movable nor copyable! "
+                                     "(#define PYBIND11_DETAILED_ERROR_MESSAGES or compile in "
+                                     "debug mode for details)");
+#endif
+                }
+                wrapper->owned = true;
+                break;
+
+            case return_value_policy::reference_internal:
+                valueptr = src;
+                wrapper->owned = false;
+                keep_alive_impl(inst, parent);
+                break;
+
+            default:
+                throw cast_error("unhandled return_value_policy: should not happen!");
+        }
+
+        tinfo->init_instance(wrapper, existing_holder);
+
+        return inst.release();
+    }
+
+    // Base methods for generic caster; there are overridden in copyable_holder_caster
+    void load_value(value_and_holder &&v_h) {
+        auto *&vptr = v_h.value_ptr();
+        // Lazy allocation for unallocated values:
+        if (vptr == nullptr) {
+            const auto *type = v_h.type ? v_h.type : typeinfo;
+            if (type->operator_new) {
+                vptr = type->operator_new(type->type_size);
+            } else {
+#if defined(__cpp_aligned_new) && (!defined(_MSC_VER) || _MSC_VER >= 1912)
+                if (type->type_align > __STDCPP_DEFAULT_NEW_ALIGNMENT__) {
+                    vptr = ::operator new(type->type_size, std::align_val_t(type->type_align));
+                } else {
+                    vptr = ::operator new(type->type_size);
+                }
+#else
+                vptr = ::operator new(type->type_size);
+#endif
+            }
+        }
+        value = vptr;
+    }
+    bool try_implicit_casts(handle src, bool convert) {
+        for (const auto &cast : typeinfo->implicit_casts) {
+            type_caster_generic sub_caster(*cast.first);
+            if (sub_caster.load(src, convert)) {
+                value = cast.second(sub_caster.value);
+                return true;
+            }
+        }
+        return false;
+    }
+    bool try_direct_conversions(handle src) {
+        for (auto &converter : *typeinfo->direct_conversions) {
+            if (converter(src.ptr(), value)) {
+                return true;
+            }
+        }
+        return false;
+    }
+    void check_holder_compat() {}
+
+    PYBIND11_NOINLINE static void *local_load(PyObject *src, const type_info *ti) {
+        auto caster = type_caster_generic(ti);
+        if (caster.load(src, false)) {
+            return caster.value;
+        }
+        return nullptr;
+    }
+
+    /// Try to load with foreign typeinfo, if available. Used when there is no
+    /// native typeinfo, or when the native one wasn't able to produce a value.
+    PYBIND11_NOINLINE bool try_load_foreign_module_local(handle src) {
+        constexpr auto *local_key = PYBIND11_MODULE_LOCAL_ID;
+        const auto pytype = type::handle_of(src);
+        if (!hasattr(pytype, local_key)) {
+            return false;
+        }
+
+        type_info *foreign_typeinfo = reinterpret_borrow<capsule>(getattr(pytype, local_key));
+        // Only consider this foreign loader if actually foreign and is a loader of the correct cpp
+        // type
+        if (foreign_typeinfo->module_local_load == &local_load
+            || (cpptype && !same_type(*cpptype, *foreign_typeinfo->cpptype))) {
+            return false;
+        }
+
+        if (auto *result = foreign_typeinfo->module_local_load(src.ptr(), foreign_typeinfo)) {
+            value = result;
+            return true;
+        }
+        return false;
+    }
+
+    // Implementation of `load`; this takes the type of `this` so that it can dispatch the relevant
+    // bits of code between here and copyable_holder_caster where the two classes need different
+    // logic (without having to resort to virtual inheritance).
+    template <typename ThisT>
+    PYBIND11_NOINLINE bool load_impl(handle src, bool convert) {
+        if (!src) {
+            return false;
+        }
+        if (!typeinfo) {
+            return try_load_foreign_module_local(src);
+        }
+
+        auto &this_ = static_cast<ThisT &>(*this);
+        this_.check_holder_compat();
+
+        PyTypeObject *srctype = Py_TYPE(src.ptr());
+
+        // Case 1: If src is an exact type match for the target type then we can reinterpret_cast
+        // the instance's value pointer to the target type:
+        if (srctype == typeinfo->type) {
+            this_.load_value(reinterpret_cast<instance *>(src.ptr())->get_value_and_holder());
+            return true;
+        }
+        // Case 2: We have a derived class
+        if (PyType_IsSubtype(srctype, typeinfo->type)) {
+            const auto &bases = all_type_info(srctype);
+            bool no_cpp_mi = typeinfo->simple_type;
+
+            // Case 2a: the python type is a Python-inherited derived class that inherits from just
+            // one simple (no MI) pybind11 class, or is an exact match, so the C++ instance is of
+            // the right type and we can use reinterpret_cast.
+            // (This is essentially the same as case 2b, but because not using multiple inheritance
+            // is extremely common, we handle it specially to avoid the loop iterator and type
+            // pointer lookup overhead)
+            if (bases.size() == 1 && (no_cpp_mi || bases.front()->type == typeinfo->type)) {
+                this_.load_value(reinterpret_cast<instance *>(src.ptr())->get_value_and_holder());
+                return true;
+            }
+            // Case 2b: the python type inherits from multiple C++ bases.  Check the bases to see
+            // if we can find an exact match (or, for a simple C++ type, an inherited match); if
+            // so, we can safely reinterpret_cast to the relevant pointer.
+            if (bases.size() > 1) {
+                for (auto *base : bases) {
+                    if (no_cpp_mi ? PyType_IsSubtype(base->type, typeinfo->type)
+                                  : base->type == typeinfo->type) {
+                        this_.load_value(
+                            reinterpret_cast<instance *>(src.ptr())->get_value_and_holder(base));
+                        return true;
+                    }
+                }
+            }
+
+            // Case 2c: C++ multiple inheritance is involved and we couldn't find an exact type
+            // match in the registered bases, above, so try implicit casting (needed for proper C++
+            // casting when MI is involved).
+            if (this_.try_implicit_casts(src, convert)) {
+                return true;
+            }
+        }
+
+        // Perform an implicit conversion
+        if (convert) {
+            for (const auto &converter : typeinfo->implicit_conversions) {
+                auto temp = reinterpret_steal<object>(converter(src.ptr(), typeinfo->type));
+                if (load_impl<ThisT>(temp, false)) {
+                    loader_life_support::add_patient(temp);
+                    return true;
+                }
+            }
+            if (this_.try_direct_conversions(src)) {
+                return true;
+            }
+        }
+
+        // Failed to match local typeinfo. Try again with global.
+        if (typeinfo->module_local) {
+            if (auto *gtype = get_global_type_info(*typeinfo->cpptype)) {
+                typeinfo = gtype;
+                return load(src, false);
+            }
+        }
+
+        // Global typeinfo has precedence over foreign module_local
+        if (try_load_foreign_module_local(src)) {
+            return true;
+        }
+
+        // Custom converters didn't take None, now we convert None to nullptr.
+        if (src.is_none()) {
+            // Defer accepting None to other overloads (if we aren't in convert mode):
+            if (!convert) {
+                return false;
+            }
+            value = nullptr;
+            return true;
+        }
+
+        return false;
+    }
+
+    // Called to do type lookup and wrap the pointer and type in a pair when a dynamic_cast
+    // isn't needed or can't be used.  If the type is unknown, sets the error and returns a pair
+    // with .second = nullptr.  (p.first = nullptr is not an error: it becomes None).
+    PYBIND11_NOINLINE static std::pair<const void *, const type_info *>
+    src_and_type(const void *src,
+                 const std::type_info &cast_type,
+                 const std::type_info *rtti_type = nullptr) {
+        if (auto *tpi = get_type_info(cast_type)) {
+            return {src, const_cast<const type_info *>(tpi)};
+        }
+
+        // Not found, set error:
+        std::string tname = rtti_type ? rtti_type->name() : cast_type.name();
+        detail::clean_type_id(tname);
+        std::string msg = "Unregistered type : " + tname;
+        set_error(PyExc_TypeError, msg.c_str());
+        return {nullptr, nullptr};
+    }
+
+    const type_info *typeinfo = nullptr;
+    const std::type_info *cpptype = nullptr;
+    void *value = nullptr;
+};
+
+/**
+ * Determine suitable casting operator for pointer-or-lvalue-casting type casters.  The type caster
+ * needs to provide `operator T*()` and `operator T&()` operators.
+ *
+ * If the type supports moving the value away via an `operator T&&() &&` method, it should use
+ * `movable_cast_op_type` instead.
+ */
+template <typename T>
+using cast_op_type = conditional_t<std::is_pointer<remove_reference_t<T>>::value,
+                                   typename std::add_pointer<intrinsic_t<T>>::type,
+                                   typename std::add_lvalue_reference<intrinsic_t<T>>::type>;
+
+/**
+ * Determine suitable casting operator for a type caster with a movable value.  Such a type caster
+ * needs to provide `operator T*()`, `operator T&()`, and `operator T&&() &&`.  The latter will be
+ * called in appropriate contexts where the value can be moved rather than copied.
+ *
+ * These operator are automatically provided when using the PYBIND11_TYPE_CASTER macro.
+ */
+template <typename T>
+using movable_cast_op_type
+    = conditional_t<std::is_pointer<typename std::remove_reference<T>::type>::value,
+                    typename std::add_pointer<intrinsic_t<T>>::type,
+                    conditional_t<std::is_rvalue_reference<T>::value,
+                                  typename std::add_rvalue_reference<intrinsic_t<T>>::type,
+                                  typename std::add_lvalue_reference<intrinsic_t<T>>::type>>;
+
+// Does the container have a mapped type and is it recursive?
+// Implemented by specializations below.
+template <typename Container, typename SFINAE = void>
+struct container_mapped_type_traits {
+    static constexpr bool has_mapped_type = false;
+    static constexpr bool has_recursive_mapped_type = false;
+};
+
+template <typename Container>
+struct container_mapped_type_traits<
+    Container,
+    typename std::enable_if<
+        std::is_same<typename Container::mapped_type, Container>::value>::type> {
+    static constexpr bool has_mapped_type = true;
+    static constexpr bool has_recursive_mapped_type = true;
+};
+
+template <typename Container>
+struct container_mapped_type_traits<
+    Container,
+    typename std::enable_if<
+        negation<std::is_same<typename Container::mapped_type, Container>>::value>::type> {
+    static constexpr bool has_mapped_type = true;
+    static constexpr bool has_recursive_mapped_type = false;
+};
+
+// Does the container have a value type and is it recursive?
+// Implemented by specializations below.
+template <typename Container, typename SFINAE = void>
+struct container_value_type_traits : std::false_type {
+    static constexpr bool has_value_type = false;
+    static constexpr bool has_recursive_value_type = false;
+};
+
+template <typename Container>
+struct container_value_type_traits<
+    Container,
+    typename std::enable_if<
+        std::is_same<typename Container::value_type, Container>::value>::type> {
+    static constexpr bool has_value_type = true;
+    static constexpr bool has_recursive_value_type = true;
+};
+
+template <typename Container>
+struct container_value_type_traits<
+    Container,
+    typename std::enable_if<
+        negation<std::is_same<typename Container::value_type, Container>>::value>::type> {
+    static constexpr bool has_value_type = true;
+    static constexpr bool has_recursive_value_type = false;
+};
+
+/*
+ * Tag to be used for representing the bottom of recursively defined types.
+ * Define this tag so we don't have to use void.
+ */
+struct recursive_bottom {};
+
+/*
+ * Implementation detail of `recursive_container_traits` below.
+ * `T` is the `value_type` of the container, which might need to be modified to
+ * avoid recursive types and const types.
+ */
+template <typename T, bool is_this_a_map>
+struct impl_type_to_check_recursively {
+    /*
+     * If the container is recursive, then no further recursion should be done.
+     */
+    using if_recursive = recursive_bottom;
+    /*
+     * Otherwise yield `T` unchanged.
+     */
+    using if_not_recursive = T;
+};
+
+/*
+ * For pairs - only as value type of a map -, the first type should remove the `const`.
+ * Also, if the map is recursive, then the recursive checking should consider
+ * the first type only.
+ */
+template <typename A, typename B>
+struct impl_type_to_check_recursively<std::pair<A, B>, /* is_this_a_map = */ true> {
+    using if_recursive = typename std::remove_const<A>::type;
+    using if_not_recursive = std::pair<typename std::remove_const<A>::type, B>;
+};
+
+/*
+ * Implementation of `recursive_container_traits` below.
+ */
+template <typename Container, typename SFINAE = void>
+struct impl_recursive_container_traits {
+    using type_to_check_recursively = recursive_bottom;
+};
+
+template <typename Container>
+struct impl_recursive_container_traits<
+    Container,
+    typename std::enable_if<container_value_type_traits<Container>::has_value_type>::type> {
+    static constexpr bool is_recursive
+        = container_mapped_type_traits<Container>::has_recursive_mapped_type
+          || container_value_type_traits<Container>::has_recursive_value_type;
+    /*
+     * This member dictates which type Pybind11 should check recursively in traits
+     * such as `is_move_constructible`, `is_copy_constructible`, `is_move_assignable`, ...
+     * Direct access to `value_type` should be avoided:
+     * 1. `value_type` might recursively contain the type again
+     * 2. `value_type` of STL map types is `std::pair<A const, B>`, the `const`
+     *    should be removed.
+     *
+     */
+    using type_to_check_recursively = typename std::conditional<
+        is_recursive,
+        typename impl_type_to_check_recursively<
+            typename Container::value_type,
+            container_mapped_type_traits<Container>::has_mapped_type>::if_recursive,
+        typename impl_type_to_check_recursively<
+            typename Container::value_type,
+            container_mapped_type_traits<Container>::has_mapped_type>::if_not_recursive>::type;
+};
+
+/*
+ * This trait defines the `type_to_check_recursively` which is needed to properly
+ * handle recursively defined traits such as `is_move_constructible` without going
+ * into an infinite recursion.
+ * Should be used instead of directly accessing the `value_type`.
+ * It cancels the recursion by returning the `recursive_bottom` tag.
+ *
+ * The default definition of `type_to_check_recursively` is as follows:
+ *
+ * 1. By default, it is `recursive_bottom`, so that the recursion is canceled.
+ * 2. If the type is non-recursive and defines a `value_type`, then the `value_type` is used.
+ *    If the `value_type` is a pair and a `mapped_type` is defined,
+ *    then the `const` is removed from the first type.
+ * 3. If the type is recursive and `value_type` is not a pair, then `recursive_bottom` is returned.
+ * 4. If the type is recursive and `value_type` is a pair and a `mapped_type` is defined,
+ *    then `const` is removed from the first type and the first type is returned.
+ *
+ * This behavior can be extended by the user as seen in test_stl_binders.cpp.
+ *
+ * This struct is exactly the same as impl_recursive_container_traits.
+ * The duplication achieves that user-defined specializations don't compete
+ * with internal specializations, but take precedence.
+ */
+template <typename Container, typename SFINAE = void>
+struct recursive_container_traits : impl_recursive_container_traits<Container> {};
+
+template <typename T>
+struct is_move_constructible
+    : all_of<std::is_move_constructible<T>,
+             is_move_constructible<
+                 typename recursive_container_traits<T>::type_to_check_recursively>> {};
+
+template <>
+struct is_move_constructible<recursive_bottom> : std::true_type {};
+
+// Likewise for std::pair
+// (after C++17 it is mandatory that the move constructor not exist when the two types aren't
+// themselves move constructible, but this can not be relied upon when T1 or T2 are themselves
+// containers).
+template <typename T1, typename T2>
+struct is_move_constructible<std::pair<T1, T2>>
+    : all_of<is_move_constructible<T1>, is_move_constructible<T2>> {};
+
+// std::is_copy_constructible isn't quite enough: it lets std::vector<T> (and similar) through when
+// T is non-copyable, but code containing such a copy constructor fails to actually compile.
+template <typename T>
+struct is_copy_constructible
+    : all_of<std::is_copy_constructible<T>,
+             is_copy_constructible<
+                 typename recursive_container_traits<T>::type_to_check_recursively>> {};
+
+template <>
+struct is_copy_constructible<recursive_bottom> : std::true_type {};
+
+// Likewise for std::pair
+// (after C++17 it is mandatory that the copy constructor not exist when the two types aren't
+// themselves copy constructible, but this can not be relied upon when T1 or T2 are themselves
+// containers).
+template <typename T1, typename T2>
+struct is_copy_constructible<std::pair<T1, T2>>
+    : all_of<is_copy_constructible<T1>, is_copy_constructible<T2>> {};
+
+// The same problems arise with std::is_copy_assignable, so we use the same workaround.
+template <typename T>
+struct is_copy_assignable
+    : all_of<
+          std::is_copy_assignable<T>,
+          is_copy_assignable<typename recursive_container_traits<T>::type_to_check_recursively>> {
+};
+
+template <>
+struct is_copy_assignable<recursive_bottom> : std::true_type {};
+
+template <typename T1, typename T2>
+struct is_copy_assignable<std::pair<T1, T2>>
+    : all_of<is_copy_assignable<T1>, is_copy_assignable<T2>> {};
+
+PYBIND11_NAMESPACE_END(detail)
+
+// polymorphic_type_hook<itype>::get(src, tinfo) determines whether the object pointed
+// to by `src` actually is an instance of some class derived from `itype`.
+// If so, it sets `tinfo` to point to the std::type_info representing that derived
+// type, and returns a pointer to the start of the most-derived object of that type
+// (in which `src` is a subobject; this will be the same address as `src` in most
+// single inheritance cases). If not, or if `src` is nullptr, it simply returns `src`
+// and leaves `tinfo` at its default value of nullptr.
+//
+// The default polymorphic_type_hook just returns src. A specialization for polymorphic
+// types determines the runtime type of the passed object and adjusts the this-pointer
+// appropriately via dynamic_cast<void*>. This is what enables a C++ Animal* to appear
+// to Python as a Dog (if Dog inherits from Animal, Animal is polymorphic, Dog is
+// registered with pybind11, and this Animal is in fact a Dog).
+//
+// You may specialize polymorphic_type_hook yourself for types that want to appear
+// polymorphic to Python but do not use C++ RTTI. (This is a not uncommon pattern
+// in performance-sensitive applications, used most notably in LLVM.)
+//
+// polymorphic_type_hook_base allows users to specialize polymorphic_type_hook with
+// std::enable_if. User provided specializations will always have higher priority than
+// the default implementation and specialization provided in polymorphic_type_hook_base.
+template <typename itype, typename SFINAE = void>
+struct polymorphic_type_hook_base {
+    static const void *get(const itype *src, const std::type_info *&) { return src; }
+};
+template <typename itype>
+struct polymorphic_type_hook_base<itype, detail::enable_if_t<std::is_polymorphic<itype>::value>> {
+    static const void *get(const itype *src, const std::type_info *&type) {
+        type = src ? &typeid(*src) : nullptr;
+        return dynamic_cast<const void *>(src);
+    }
+};
+template <typename itype, typename SFINAE = void>
+struct polymorphic_type_hook : public polymorphic_type_hook_base<itype> {};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+/// Generic type caster for objects stored on the heap
+template <typename type>
+class type_caster_base : public type_caster_generic {
+    using itype = intrinsic_t<type>;
+
+public:
+    static constexpr auto name = const_name<type>();
+
+    type_caster_base() : type_caster_base(typeid(type)) {}
+    explicit type_caster_base(const std::type_info &info) : type_caster_generic(info) {}
+
+    static handle cast(const itype &src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic
+            || policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::copy;
+        }
+        return cast(std::addressof(src), policy, parent);
+    }
+
+    static handle cast(itype &&src, return_value_policy, handle parent) {
+        return cast(std::addressof(src), return_value_policy::move, parent);
+    }
+
+    // Returns a (pointer, type_info) pair taking care of necessary type lookup for a
+    // polymorphic type (using RTTI by default, but can be overridden by specializing
+    // polymorphic_type_hook). If the instance isn't derived, returns the base version.
+    static std::pair<const void *, const type_info *> src_and_type(const itype *src) {
+        const auto &cast_type = typeid(itype);
+        const std::type_info *instance_type = nullptr;
+        const void *vsrc = polymorphic_type_hook<itype>::get(src, instance_type);
+        if (instance_type && !same_type(cast_type, *instance_type)) {
+            // This is a base pointer to a derived type. If the derived type is registered
+            // with pybind11, we want to make the full derived object available.
+            // In the typical case where itype is polymorphic, we get the correct
+            // derived pointer (which may be != base pointer) by a dynamic_cast to
+            // most derived type. If itype is not polymorphic, we won't get here
+            // except via a user-provided specialization of polymorphic_type_hook,
+            // and the user has promised that no this-pointer adjustment is
+            // required in that case, so it's OK to use static_cast.
+            if (const auto *tpi = get_type_info(*instance_type)) {
+                return {vsrc, tpi};
+            }
+        }
+        // Otherwise we have either a nullptr, an `itype` pointer, or an unknown derived pointer,
+        // so don't do a cast
+        return type_caster_generic::src_and_type(src, cast_type, instance_type);
+    }
+
+    static handle cast(const itype *src, return_value_policy policy, handle parent) {
+        auto st = src_and_type(src);
+        return type_caster_generic::cast(st.first,
+                                         policy,
+                                         parent,
+                                         st.second,
+                                         make_copy_constructor(src),
+                                         make_move_constructor(src));
+    }
+
+    static handle cast_holder(const itype *src, const void *holder) {
+        auto st = src_and_type(src);
+        return type_caster_generic::cast(st.first,
+                                         return_value_policy::take_ownership,
+                                         {},
+                                         st.second,
+                                         nullptr,
+                                         nullptr,
+                                         holder);
+    }
+
+    template <typename T>
+    using cast_op_type = detail::cast_op_type<T>;
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator itype *() { return (type *) value; }
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator itype &() {
+        if (!value) {
+            throw reference_cast_error();
+        }
+        return *((itype *) value);
+    }
+
+protected:
+    using Constructor = void *(*) (const void *);
+
+    /* Only enabled when the types are {copy,move}-constructible *and* when the type
+       does not have a private operator new implementation. A comma operator is used in the
+       decltype argument to apply SFINAE to the public copy/move constructors.*/
+    template <typename T, typename = enable_if_t<is_copy_constructible<T>::value>>
+    static auto make_copy_constructor(const T *) -> decltype(new T(std::declval<const T>()),
+                                                             Constructor{}) {
+        return [](const void *arg) -> void * { return new T(*reinterpret_cast<const T *>(arg)); };
+    }
+
+    template <typename T, typename = enable_if_t<is_move_constructible<T>::value>>
+    static auto make_move_constructor(const T *) -> decltype(new T(std::declval<T &&>()),
+                                                             Constructor{}) {
+        return [](const void *arg) -> void * {
+            return new T(std::move(*const_cast<T *>(reinterpret_cast<const T *>(arg))));
+        };
+    }
+
+    static Constructor make_copy_constructor(...) { return nullptr; }
+    static Constructor make_move_constructor(...) { return nullptr; }
+};
+
+inline std::string quote_cpp_type_name(const std::string &cpp_type_name) {
+    return cpp_type_name; // No-op for now. See PR #4888
+}
+
+PYBIND11_NOINLINE std::string type_info_description(const std::type_info &ti) {
+    if (auto *type_data = get_type_info(ti)) {
+        handle th((PyObject *) type_data->type);
+        return th.attr("__module__").cast<std::string>() + '.'
+               + th.attr("__qualname__").cast<std::string>();
+    }
+    return quote_cpp_type_name(clean_type_id(ti.name()));
+}
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/typeid.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/typeid.h
new file mode 100644
index 0000000000..a67b52135b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/detail/typeid.h
@@ -0,0 +1,65 @@
+/*
+    pybind11/detail/typeid.h: Compiler-independent access to type identifiers
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include <cstdio>
+#include <cstdlib>
+
+#if defined(__GNUG__)
+#    include <cxxabi.h>
+#endif
+
+#include "common.h"
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+/// Erase all occurrences of a substring
+inline void erase_all(std::string &string, const std::string &search) {
+    for (size_t pos = 0;;) {
+        pos = string.find(search, pos);
+        if (pos == std::string::npos) {
+            break;
+        }
+        string.erase(pos, search.length());
+    }
+}
+
+PYBIND11_NOINLINE void clean_type_id(std::string &name) {
+#if defined(__GNUG__)
+    int status = 0;
+    std::unique_ptr<char, void (*)(void *)> res{
+        abi::__cxa_demangle(name.c_str(), nullptr, nullptr, &status), std::free};
+    if (status == 0) {
+        name = res.get();
+    }
+#else
+    detail::erase_all(name, "class ");
+    detail::erase_all(name, "struct ");
+    detail::erase_all(name, "enum ");
+#endif
+    detail::erase_all(name, "pybind11::");
+}
+
+inline std::string clean_type_id(const char *typeid_name) {
+    std::string name(typeid_name);
+    detail::clean_type_id(name);
+    return name;
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+/// Return a string representation of a C++ type
+template <typename T>
+static std::string type_id() {
+    return detail::clean_type_id(typeid(T).name());
+}
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen.h
new file mode 100644
index 0000000000..273b9c9308
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen.h
@@ -0,0 +1,12 @@
+/*
+    pybind11/eigen.h: Transparent conversion for dense and sparse Eigen matrices
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "eigen/matrix.h"
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen/common.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen/common.h
new file mode 100644
index 0000000000..24f56d1584
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen/common.h
@@ -0,0 +1,9 @@
+// Copyright (c) 2023 The pybind Community.
+
+#pragma once
+
+// Common message for `static_assert()`s, which are useful to easily
+// preempt much less obvious errors.
+#define PYBIND11_EIGEN_MESSAGE_POINTER_TYPES_ARE_NOT_SUPPORTED                                    \
+    "Pointer types (in particular `PyObject *`) are not supported as scalar types for Eigen "     \
+    "types."
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen/matrix.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen/matrix.h
new file mode 100644
index 0000000000..8d4342f81b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen/matrix.h
@@ -0,0 +1,714 @@
+/*
+    pybind11/eigen/matrix.h: Transparent conversion for dense and sparse Eigen matrices
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "../numpy.h"
+#include "common.h"
+
+/* HINT: To suppress warnings originating from the Eigen headers, use -isystem.
+   See also:
+       https://stackoverflow.com/questions/2579576/i-dir-vs-isystem-dir
+       https://stackoverflow.com/questions/1741816/isystem-for-ms-visual-studio-c-compiler
+*/
+PYBIND11_WARNING_PUSH
+PYBIND11_WARNING_DISABLE_MSVC(5054) // https://github.com/pybind/pybind11/pull/3741
+//       C5054: operator '&': deprecated between enumerations of different types
+#if defined(__MINGW32__)
+PYBIND11_WARNING_DISABLE_GCC("-Wmaybe-uninitialized")
+#endif
+
+#include <Eigen/Core>
+#include <Eigen/SparseCore>
+
+PYBIND11_WARNING_POP
+
+// Eigen prior to 3.2.7 doesn't have proper move constructors--but worse, some classes get implicit
+// move constructors that break things.  We could detect this an explicitly copy, but an extra copy
+// of matrices seems highly undesirable.
+static_assert(EIGEN_VERSION_AT_LEAST(3, 2, 7),
+              "Eigen matrix support in pybind11 requires Eigen >= 3.2.7");
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+PYBIND11_WARNING_DISABLE_MSVC(4127)
+
+// Provide a convenience alias for easier pass-by-ref usage with fully dynamic strides:
+using EigenDStride = Eigen::Stride<Eigen::Dynamic, Eigen::Dynamic>;
+template <typename MatrixType>
+using EigenDRef = Eigen::Ref<MatrixType, 0, EigenDStride>;
+template <typename MatrixType>
+using EigenDMap = Eigen::Map<MatrixType, 0, EigenDStride>;
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+#if EIGEN_VERSION_AT_LEAST(3, 3, 0)
+using EigenIndex = Eigen::Index;
+template <typename Scalar, int Flags, typename StorageIndex>
+using EigenMapSparseMatrix = Eigen::Map<Eigen::SparseMatrix<Scalar, Flags, StorageIndex>>;
+#else
+using EigenIndex = EIGEN_DEFAULT_DENSE_INDEX_TYPE;
+template <typename Scalar, int Flags, typename StorageIndex>
+using EigenMapSparseMatrix = Eigen::MappedSparseMatrix<Scalar, Flags, StorageIndex>;
+#endif
+
+// Matches Eigen::Map, Eigen::Ref, blocks, etc:
+template <typename T>
+using is_eigen_dense_map = all_of<is_template_base_of<Eigen::DenseBase, T>,
+                                  std::is_base_of<Eigen::MapBase<T, Eigen::ReadOnlyAccessors>, T>>;
+template <typename T>
+using is_eigen_mutable_map = std::is_base_of<Eigen::MapBase<T, Eigen::WriteAccessors>, T>;
+template <typename T>
+using is_eigen_dense_plain
+    = all_of<negation<is_eigen_dense_map<T>>, is_template_base_of<Eigen::PlainObjectBase, T>>;
+template <typename T>
+using is_eigen_sparse = is_template_base_of<Eigen::SparseMatrixBase, T>;
+// Test for objects inheriting from EigenBase<Derived> that aren't captured by the above.  This
+// basically covers anything that can be assigned to a dense matrix but that don't have a typical
+// matrix data layout that can be copied from their .data().  For example, DiagonalMatrix and
+// SelfAdjointView fall into this category.
+template <typename T>
+using is_eigen_other
+    = all_of<is_template_base_of<Eigen::EigenBase, T>,
+             negation<any_of<is_eigen_dense_map<T>, is_eigen_dense_plain<T>, is_eigen_sparse<T>>>>;
+
+// Captures numpy/eigen conformability status (returned by EigenProps::conformable()):
+template <bool EigenRowMajor>
+struct EigenConformable {
+    bool conformable = false;
+    EigenIndex rows = 0, cols = 0;
+    EigenDStride stride{0, 0};    // Only valid if negativestrides is false!
+    bool negativestrides = false; // If true, do not use stride!
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    EigenConformable(bool fits = false) : conformable{fits} {}
+    // Matrix type:
+    EigenConformable(EigenIndex r, EigenIndex c, EigenIndex rstride, EigenIndex cstride)
+        : conformable{true}, rows{r}, cols{c},
+          // TODO: when Eigen bug #747 is fixed, remove the tests for non-negativity.
+          // http://eigen.tuxfamily.org/bz/show_bug.cgi?id=747
+          stride{EigenRowMajor ? (rstride > 0 ? rstride : 0)
+                               : (cstride > 0 ? cstride : 0) /* outer stride */,
+                 EigenRowMajor ? (cstride > 0 ? cstride : 0)
+                               : (rstride > 0 ? rstride : 0) /* inner stride */},
+          negativestrides{rstride < 0 || cstride < 0} {}
+    // Vector type:
+    EigenConformable(EigenIndex r, EigenIndex c, EigenIndex stride)
+        : EigenConformable(r, c, r == 1 ? c * stride : stride, c == 1 ? r : r * stride) {}
+
+    template <typename props>
+    bool stride_compatible() const {
+        // To have compatible strides, we need (on both dimensions) one of fully dynamic strides,
+        // matching strides, or a dimension size of 1 (in which case the stride value is
+        // irrelevant). Alternatively, if any dimension size is 0, the strides are not relevant
+        // (and numpy ≥ 1.23 sets the strides to 0 in that case, so we need to check explicitly).
+        if (negativestrides) {
+            return false;
+        }
+        if (rows == 0 || cols == 0) {
+            return true;
+        }
+        return (props::inner_stride == Eigen::Dynamic || props::inner_stride == stride.inner()
+                || (EigenRowMajor ? cols : rows) == 1)
+               && (props::outer_stride == Eigen::Dynamic || props::outer_stride == stride.outer()
+                   || (EigenRowMajor ? rows : cols) == 1);
+    }
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator bool() const { return conformable; }
+};
+
+template <typename Type>
+struct eigen_extract_stride {
+    using type = Type;
+};
+template <typename PlainObjectType, int MapOptions, typename StrideType>
+struct eigen_extract_stride<Eigen::Map<PlainObjectType, MapOptions, StrideType>> {
+    using type = StrideType;
+};
+template <typename PlainObjectType, int Options, typename StrideType>
+struct eigen_extract_stride<Eigen::Ref<PlainObjectType, Options, StrideType>> {
+    using type = StrideType;
+};
+
+// Helper struct for extracting information from an Eigen type
+template <typename Type_>
+struct EigenProps {
+    using Type = Type_;
+    using Scalar = typename Type::Scalar;
+    using StrideType = typename eigen_extract_stride<Type>::type;
+    static constexpr EigenIndex rows = Type::RowsAtCompileTime, cols = Type::ColsAtCompileTime,
+                                size = Type::SizeAtCompileTime;
+    static constexpr bool row_major = Type::IsRowMajor,
+                          vector
+                          = Type::IsVectorAtCompileTime, // At least one dimension has fixed size 1
+        fixed_rows = rows != Eigen::Dynamic, fixed_cols = cols != Eigen::Dynamic,
+                          fixed = size != Eigen::Dynamic, // Fully-fixed size
+        dynamic = !fixed_rows && !fixed_cols;             // Fully-dynamic size
+
+    template <EigenIndex i, EigenIndex ifzero>
+    using if_zero = std::integral_constant<EigenIndex, i == 0 ? ifzero : i>;
+    static constexpr EigenIndex inner_stride
+        = if_zero<StrideType::InnerStrideAtCompileTime, 1>::value,
+        outer_stride = if_zero < StrideType::OuterStrideAtCompileTime,
+        vector      ? size
+        : row_major ? cols
+                    : rows > ::value;
+    static constexpr bool dynamic_stride
+        = inner_stride == Eigen::Dynamic && outer_stride == Eigen::Dynamic;
+    static constexpr bool requires_row_major
+        = !dynamic_stride && !vector && (row_major ? inner_stride : outer_stride) == 1;
+    static constexpr bool requires_col_major
+        = !dynamic_stride && !vector && (row_major ? outer_stride : inner_stride) == 1;
+
+    // Takes an input array and determines whether we can make it fit into the Eigen type.  If
+    // the array is a vector, we attempt to fit it into either an Eigen 1xN or Nx1 vector
+    // (preferring the latter if it will fit in either, i.e. for a fully dynamic matrix type).
+    static EigenConformable<row_major> conformable(const array &a) {
+        const auto dims = a.ndim();
+        if (dims < 1 || dims > 2) {
+            return false;
+        }
+
+        if (dims == 2) { // Matrix type: require exact match (or dynamic)
+
+            EigenIndex np_rows = a.shape(0), np_cols = a.shape(1),
+                       np_rstride = a.strides(0) / static_cast<ssize_t>(sizeof(Scalar)),
+                       np_cstride = a.strides(1) / static_cast<ssize_t>(sizeof(Scalar));
+            if ((fixed_rows && np_rows != rows) || (fixed_cols && np_cols != cols)) {
+                return false;
+            }
+
+            return {np_rows, np_cols, np_rstride, np_cstride};
+        }
+
+        // Otherwise we're storing an n-vector.  Only one of the strides will be used, but
+        // whichever is used, we want the (single) numpy stride value.
+        const EigenIndex n = a.shape(0),
+                         stride = a.strides(0) / static_cast<ssize_t>(sizeof(Scalar));
+
+        if (vector) { // Eigen type is a compile-time vector
+            if (fixed && size != n) {
+                return false; // Vector size mismatch
+            }
+            return {rows == 1 ? 1 : n, cols == 1 ? 1 : n, stride};
+        }
+        if (fixed) {
+            // The type has a fixed size, but is not a vector: abort
+            return false;
+        }
+        if (fixed_cols) {
+            // Since this isn't a vector, cols must be != 1.  We allow this only if it exactly
+            // equals the number of elements (rows is Dynamic, and so 1 row is allowed).
+            if (cols != n) {
+                return false;
+            }
+            return {1, n, stride};
+        } // Otherwise it's either fully dynamic, or column dynamic; both become a column vector
+        if (fixed_rows && rows != n) {
+            return false;
+        }
+        return {n, 1, stride};
+    }
+
+    static constexpr bool show_writeable
+        = is_eigen_dense_map<Type>::value && is_eigen_mutable_map<Type>::value;
+    static constexpr bool show_order = is_eigen_dense_map<Type>::value;
+    static constexpr bool show_c_contiguous = show_order && requires_row_major;
+    static constexpr bool show_f_contiguous
+        = !show_c_contiguous && show_order && requires_col_major;
+
+    static constexpr auto descriptor
+        = const_name("numpy.ndarray[") + npy_format_descriptor<Scalar>::name + const_name("[")
+          + const_name<fixed_rows>(const_name<(size_t) rows>(), const_name("m")) + const_name(", ")
+          + const_name<fixed_cols>(const_name<(size_t) cols>(), const_name("n")) + const_name("]")
+          +
+          // For a reference type (e.g. Ref<MatrixXd>) we have other constraints that might need to
+          // be satisfied: writeable=True (for a mutable reference), and, depending on the map's
+          // stride options, possibly f_contiguous or c_contiguous.  We include them in the
+          // descriptor output to provide some hint as to why a TypeError is occurring (otherwise
+          // it can be confusing to see that a function accepts a 'numpy.ndarray[float64[3,2]]' and
+          // an error message that you *gave* a numpy.ndarray of the right type and dimensions.
+          const_name<show_writeable>(", flags.writeable", "")
+          + const_name<show_c_contiguous>(", flags.c_contiguous", "")
+          + const_name<show_f_contiguous>(", flags.f_contiguous", "") + const_name("]");
+};
+
+// Casts an Eigen type to numpy array.  If given a base, the numpy array references the src data,
+// otherwise it'll make a copy.  writeable lets you turn off the writeable flag for the array.
+template <typename props>
+handle
+eigen_array_cast(typename props::Type const &src, handle base = handle(), bool writeable = true) {
+    constexpr ssize_t elem_size = sizeof(typename props::Scalar);
+    array a;
+    if (props::vector) {
+        a = array({src.size()}, {elem_size * src.innerStride()}, src.data(), base);
+    } else {
+        a = array({src.rows(), src.cols()},
+                  {elem_size * src.rowStride(), elem_size * src.colStride()},
+                  src.data(),
+                  base);
+    }
+
+    if (!writeable) {
+        array_proxy(a.ptr())->flags &= ~detail::npy_api::NPY_ARRAY_WRITEABLE_;
+    }
+
+    return a.release();
+}
+
+// Takes an lvalue ref to some Eigen type and a (python) base object, creating a numpy array that
+// reference the Eigen object's data with `base` as the python-registered base class (if omitted,
+// the base will be set to None, and lifetime management is up to the caller).  The numpy array is
+// non-writeable if the given type is const.
+template <typename props, typename Type>
+handle eigen_ref_array(Type &src, handle parent = none()) {
+    // none here is to get past array's should-we-copy detection, which currently always
+    // copies when there is no base.  Setting the base to None should be harmless.
+    return eigen_array_cast<props>(src, parent, !std::is_const<Type>::value);
+}
+
+// Takes a pointer to some dense, plain Eigen type, builds a capsule around it, then returns a
+// numpy array that references the encapsulated data with a python-side reference to the capsule to
+// tie its destruction to that of any dependent python objects.  Const-ness is determined by
+// whether or not the Type of the pointer given is const.
+template <typename props, typename Type, typename = enable_if_t<is_eigen_dense_plain<Type>::value>>
+handle eigen_encapsulate(Type *src) {
+    capsule base(src, [](void *o) { delete static_cast<Type *>(o); });
+    return eigen_ref_array<props>(*src, base);
+}
+
+// Type caster for regular, dense matrix types (e.g. MatrixXd), but not maps/refs/etc. of dense
+// types.
+template <typename Type>
+struct type_caster<Type, enable_if_t<is_eigen_dense_plain<Type>::value>> {
+    using Scalar = typename Type::Scalar;
+    static_assert(!std::is_pointer<Scalar>::value,
+                  PYBIND11_EIGEN_MESSAGE_POINTER_TYPES_ARE_NOT_SUPPORTED);
+    using props = EigenProps<Type>;
+
+    bool load(handle src, bool convert) {
+        // If we're in no-convert mode, only load if given an array of the correct type
+        if (!convert && !isinstance<array_t<Scalar>>(src)) {
+            return false;
+        }
+
+        // Coerce into an array, but don't do type conversion yet; the copy below handles it.
+        auto buf = array::ensure(src);
+
+        if (!buf) {
+            return false;
+        }
+
+        auto dims = buf.ndim();
+        if (dims < 1 || dims > 2) {
+            return false;
+        }
+
+        auto fits = props::conformable(buf);
+        if (!fits) {
+            return false;
+        }
+
+        // Allocate the new type, then build a numpy reference into it
+        value = Type(fits.rows, fits.cols);
+        auto ref = reinterpret_steal<array>(eigen_ref_array<props>(value));
+        if (dims == 1) {
+            ref = ref.squeeze();
+        } else if (ref.ndim() == 1) {
+            buf = buf.squeeze();
+        }
+
+        int result = detail::npy_api::get().PyArray_CopyInto_(ref.ptr(), buf.ptr());
+
+        if (result < 0) { // Copy failed!
+            PyErr_Clear();
+            return false;
+        }
+
+        return true;
+    }
+
+private:
+    // Cast implementation
+    template <typename CType>
+    static handle cast_impl(CType *src, return_value_policy policy, handle parent) {
+        switch (policy) {
+            case return_value_policy::take_ownership:
+            case return_value_policy::automatic:
+                return eigen_encapsulate<props>(src);
+            case return_value_policy::move:
+                return eigen_encapsulate<props>(new CType(std::move(*src)));
+            case return_value_policy::copy:
+                return eigen_array_cast<props>(*src);
+            case return_value_policy::reference:
+            case return_value_policy::automatic_reference:
+                return eigen_ref_array<props>(*src);
+            case return_value_policy::reference_internal:
+                return eigen_ref_array<props>(*src, parent);
+            default:
+                throw cast_error("unhandled return_value_policy: should not happen!");
+        };
+    }
+
+public:
+    // Normal returned non-reference, non-const value:
+    static handle cast(Type &&src, return_value_policy /* policy */, handle parent) {
+        return cast_impl(&src, return_value_policy::move, parent);
+    }
+    // If you return a non-reference const, we mark the numpy array readonly:
+    static handle cast(const Type &&src, return_value_policy /* policy */, handle parent) {
+        return cast_impl(&src, return_value_policy::move, parent);
+    }
+    // lvalue reference return; default (automatic) becomes copy
+    static handle cast(Type &src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic
+            || policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::copy;
+        }
+        return cast_impl(&src, policy, parent);
+    }
+    // const lvalue reference return; default (automatic) becomes copy
+    static handle cast(const Type &src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic
+            || policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::copy;
+        }
+        return cast(&src, policy, parent);
+    }
+    // non-const pointer return
+    static handle cast(Type *src, return_value_policy policy, handle parent) {
+        return cast_impl(src, policy, parent);
+    }
+    // const pointer return
+    static handle cast(const Type *src, return_value_policy policy, handle parent) {
+        return cast_impl(src, policy, parent);
+    }
+
+    static constexpr auto name = props::descriptor;
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator Type *() { return &value; }
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator Type &() { return value; }
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator Type &&() && { return std::move(value); }
+    template <typename T>
+    using cast_op_type = movable_cast_op_type<T>;
+
+private:
+    Type value;
+};
+
+// Base class for casting reference/map/block/etc. objects back to python.
+template <typename MapType>
+struct eigen_map_caster {
+    static_assert(!std::is_pointer<typename MapType::Scalar>::value,
+                  PYBIND11_EIGEN_MESSAGE_POINTER_TYPES_ARE_NOT_SUPPORTED);
+
+private:
+    using props = EigenProps<MapType>;
+
+public:
+    // Directly referencing a ref/map's data is a bit dangerous (whatever the map/ref points to has
+    // to stay around), but we'll allow it under the assumption that you know what you're doing
+    // (and have an appropriate keep_alive in place).  We return a numpy array pointing directly at
+    // the ref's data (The numpy array ends up read-only if the ref was to a const matrix type.)
+    // Note that this means you need to ensure you don't destroy the object in some other way (e.g.
+    // with an appropriate keep_alive, or with a reference to a statically allocated matrix).
+    static handle cast(const MapType &src, return_value_policy policy, handle parent) {
+        switch (policy) {
+            case return_value_policy::copy:
+                return eigen_array_cast<props>(src);
+            case return_value_policy::reference_internal:
+                return eigen_array_cast<props>(src, parent, is_eigen_mutable_map<MapType>::value);
+            case return_value_policy::reference:
+            case return_value_policy::automatic:
+            case return_value_policy::automatic_reference:
+                return eigen_array_cast<props>(src, none(), is_eigen_mutable_map<MapType>::value);
+            default:
+                // move, take_ownership don't make any sense for a ref/map:
+                pybind11_fail("Invalid return_value_policy for Eigen Map/Ref/Block type");
+        }
+    }
+
+    static constexpr auto name = props::descriptor;
+
+    // Explicitly delete these: support python -> C++ conversion on these (i.e. these can be return
+    // types but not bound arguments).  We still provide them (with an explicitly delete) so that
+    // you end up here if you try anyway.
+    bool load(handle, bool) = delete;
+    operator MapType() = delete;
+    template <typename>
+    using cast_op_type = MapType;
+};
+
+// We can return any map-like object (but can only load Refs, specialized next):
+template <typename Type>
+struct type_caster<Type, enable_if_t<is_eigen_dense_map<Type>::value>> : eigen_map_caster<Type> {};
+
+// Loader for Ref<...> arguments.  See the documentation for info on how to make this work without
+// copying (it requires some extra effort in many cases).
+template <typename PlainObjectType, typename StrideType>
+struct type_caster<
+    Eigen::Ref<PlainObjectType, 0, StrideType>,
+    enable_if_t<is_eigen_dense_map<Eigen::Ref<PlainObjectType, 0, StrideType>>::value>>
+    : public eigen_map_caster<Eigen::Ref<PlainObjectType, 0, StrideType>> {
+private:
+    using Type = Eigen::Ref<PlainObjectType, 0, StrideType>;
+    using props = EigenProps<Type>;
+    using Scalar = typename props::Scalar;
+    static_assert(!std::is_pointer<Scalar>::value,
+                  PYBIND11_EIGEN_MESSAGE_POINTER_TYPES_ARE_NOT_SUPPORTED);
+    using MapType = Eigen::Map<PlainObjectType, 0, StrideType>;
+    using Array
+        = array_t<Scalar,
+                  array::forcecast
+                      | ((props::row_major ? props::inner_stride : props::outer_stride) == 1
+                             ? array::c_style
+                         : (props::row_major ? props::outer_stride : props::inner_stride) == 1
+                             ? array::f_style
+                             : 0)>;
+    static constexpr bool need_writeable = is_eigen_mutable_map<Type>::value;
+    // Delay construction (these have no default constructor)
+    std::unique_ptr<MapType> map;
+    std::unique_ptr<Type> ref;
+    // Our array.  When possible, this is just a numpy array pointing to the source data, but
+    // sometimes we can't avoid copying (e.g. input is not a numpy array at all, has an
+    // incompatible layout, or is an array of a type that needs to be converted).  Using a numpy
+    // temporary (rather than an Eigen temporary) saves an extra copy when we need both type
+    // conversion and storage order conversion.  (Note that we refuse to use this temporary copy
+    // when loading an argument for a Ref<M> with M non-const, i.e. a read-write reference).
+    Array copy_or_ref;
+
+public:
+    bool load(handle src, bool convert) {
+        // First check whether what we have is already an array of the right type.  If not, we
+        // can't avoid a copy (because the copy is also going to do type conversion).
+        bool need_copy = !isinstance<Array>(src);
+
+        EigenConformable<props::row_major> fits;
+        if (!need_copy) {
+            // We don't need a converting copy, but we also need to check whether the strides are
+            // compatible with the Ref's stride requirements
+            auto aref = reinterpret_borrow<Array>(src);
+
+            if (aref && (!need_writeable || aref.writeable())) {
+                fits = props::conformable(aref);
+                if (!fits) {
+                    return false; // Incompatible dimensions
+                }
+                if (!fits.template stride_compatible<props>()) {
+                    need_copy = true;
+                } else {
+                    copy_or_ref = std::move(aref);
+                }
+            } else {
+                need_copy = true;
+            }
+        }
+
+        if (need_copy) {
+            // We need to copy: If we need a mutable reference, or we're not supposed to convert
+            // (either because we're in the no-convert overload pass, or because we're explicitly
+            // instructed not to copy (via `py::arg().noconvert()`) we have to fail loading.
+            if (!convert || need_writeable) {
+                return false;
+            }
+
+            Array copy = Array::ensure(src);
+            if (!copy) {
+                return false;
+            }
+            fits = props::conformable(copy);
+            if (!fits || !fits.template stride_compatible<props>()) {
+                return false;
+            }
+            copy_or_ref = std::move(copy);
+            loader_life_support::add_patient(copy_or_ref);
+        }
+
+        ref.reset();
+        map.reset(new MapType(data(copy_or_ref),
+                              fits.rows,
+                              fits.cols,
+                              make_stride(fits.stride.outer(), fits.stride.inner())));
+        ref.reset(new Type(*map));
+
+        return true;
+    }
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator Type *() { return ref.get(); }
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator Type &() { return *ref; }
+    template <typename _T>
+    using cast_op_type = pybind11::detail::cast_op_type<_T>;
+
+private:
+    template <typename T = Type, enable_if_t<is_eigen_mutable_map<T>::value, int> = 0>
+    Scalar *data(Array &a) {
+        return a.mutable_data();
+    }
+
+    template <typename T = Type, enable_if_t<!is_eigen_mutable_map<T>::value, int> = 0>
+    const Scalar *data(Array &a) {
+        return a.data();
+    }
+
+    // Attempt to figure out a constructor of `Stride` that will work.
+    // If both strides are fixed, use a default constructor:
+    template <typename S>
+    using stride_ctor_default = bool_constant<S::InnerStrideAtCompileTime != Eigen::Dynamic
+                                              && S::OuterStrideAtCompileTime != Eigen::Dynamic
+                                              && std::is_default_constructible<S>::value>;
+    // Otherwise, if there is a two-index constructor, assume it is (outer,inner) like
+    // Eigen::Stride, and use it:
+    template <typename S>
+    using stride_ctor_dual
+        = bool_constant<!stride_ctor_default<S>::value
+                        && std::is_constructible<S, EigenIndex, EigenIndex>::value>;
+    // Otherwise, if there is a one-index constructor, and just one of the strides is dynamic, use
+    // it (passing whichever stride is dynamic).
+    template <typename S>
+    using stride_ctor_outer
+        = bool_constant<!any_of<stride_ctor_default<S>, stride_ctor_dual<S>>::value
+                        && S::OuterStrideAtCompileTime == Eigen::Dynamic
+                        && S::InnerStrideAtCompileTime != Eigen::Dynamic
+                        && std::is_constructible<S, EigenIndex>::value>;
+    template <typename S>
+    using stride_ctor_inner
+        = bool_constant<!any_of<stride_ctor_default<S>, stride_ctor_dual<S>>::value
+                        && S::InnerStrideAtCompileTime == Eigen::Dynamic
+                        && S::OuterStrideAtCompileTime != Eigen::Dynamic
+                        && std::is_constructible<S, EigenIndex>::value>;
+
+    template <typename S = StrideType, enable_if_t<stride_ctor_default<S>::value, int> = 0>
+    static S make_stride(EigenIndex, EigenIndex) {
+        return S();
+    }
+    template <typename S = StrideType, enable_if_t<stride_ctor_dual<S>::value, int> = 0>
+    static S make_stride(EigenIndex outer, EigenIndex inner) {
+        return S(outer, inner);
+    }
+    template <typename S = StrideType, enable_if_t<stride_ctor_outer<S>::value, int> = 0>
+    static S make_stride(EigenIndex outer, EigenIndex) {
+        return S(outer);
+    }
+    template <typename S = StrideType, enable_if_t<stride_ctor_inner<S>::value, int> = 0>
+    static S make_stride(EigenIndex, EigenIndex inner) {
+        return S(inner);
+    }
+};
+
+// type_caster for special matrix types (e.g. DiagonalMatrix), which are EigenBase, but not
+// EigenDense (i.e. they don't have a data(), at least not with the usual matrix layout).
+// load() is not supported, but we can cast them into the python domain by first copying to a
+// regular Eigen::Matrix, then casting that.
+template <typename Type>
+struct type_caster<Type, enable_if_t<is_eigen_other<Type>::value>> {
+    static_assert(!std::is_pointer<typename Type::Scalar>::value,
+                  PYBIND11_EIGEN_MESSAGE_POINTER_TYPES_ARE_NOT_SUPPORTED);
+
+protected:
+    using Matrix
+        = Eigen::Matrix<typename Type::Scalar, Type::RowsAtCompileTime, Type::ColsAtCompileTime>;
+    using props = EigenProps<Matrix>;
+
+public:
+    static handle cast(const Type &src, return_value_policy /* policy */, handle /* parent */) {
+        handle h = eigen_encapsulate<props>(new Matrix(src));
+        return h;
+    }
+    static handle cast(const Type *src, return_value_policy policy, handle parent) {
+        return cast(*src, policy, parent);
+    }
+
+    static constexpr auto name = props::descriptor;
+
+    // Explicitly delete these: support python -> C++ conversion on these (i.e. these can be return
+    // types but not bound arguments).  We still provide them (with an explicitly delete) so that
+    // you end up here if you try anyway.
+    bool load(handle, bool) = delete;
+    operator Type() = delete;
+    template <typename>
+    using cast_op_type = Type;
+};
+
+template <typename Type>
+struct type_caster<Type, enable_if_t<is_eigen_sparse<Type>::value>> {
+    using Scalar = typename Type::Scalar;
+    static_assert(!std::is_pointer<Scalar>::value,
+                  PYBIND11_EIGEN_MESSAGE_POINTER_TYPES_ARE_NOT_SUPPORTED);
+    using StorageIndex = remove_reference_t<decltype(*std::declval<Type>().outerIndexPtr())>;
+    using Index = typename Type::Index;
+    static constexpr bool rowMajor = Type::IsRowMajor;
+
+    bool load(handle src, bool) {
+        if (!src) {
+            return false;
+        }
+
+        auto obj = reinterpret_borrow<object>(src);
+        object sparse_module = module_::import("scipy.sparse");
+        object matrix_type = sparse_module.attr(rowMajor ? "csr_matrix" : "csc_matrix");
+
+        if (!type::handle_of(obj).is(matrix_type)) {
+            try {
+                obj = matrix_type(obj);
+            } catch (const error_already_set &) {
+                return false;
+            }
+        }
+
+        auto values = array_t<Scalar>((object) obj.attr("data"));
+        auto innerIndices = array_t<StorageIndex>((object) obj.attr("indices"));
+        auto outerIndices = array_t<StorageIndex>((object) obj.attr("indptr"));
+        auto shape = pybind11::tuple((pybind11::object) obj.attr("shape"));
+        auto nnz = obj.attr("nnz").cast<Index>();
+
+        if (!values || !innerIndices || !outerIndices) {
+            return false;
+        }
+
+        value = EigenMapSparseMatrix<Scalar,
+                                     Type::Flags &(Eigen::RowMajor | Eigen::ColMajor),
+                                     StorageIndex>(shape[0].cast<Index>(),
+                                                   shape[1].cast<Index>(),
+                                                   std::move(nnz),
+                                                   outerIndices.mutable_data(),
+                                                   innerIndices.mutable_data(),
+                                                   values.mutable_data());
+
+        return true;
+    }
+
+    static handle cast(const Type &src, return_value_policy /* policy */, handle /* parent */) {
+        const_cast<Type &>(src).makeCompressed();
+
+        object matrix_type
+            = module_::import("scipy.sparse").attr(rowMajor ? "csr_matrix" : "csc_matrix");
+
+        array data(src.nonZeros(), src.valuePtr());
+        array outerIndices((rowMajor ? src.rows() : src.cols()) + 1, src.outerIndexPtr());
+        array innerIndices(src.nonZeros(), src.innerIndexPtr());
+
+        return matrix_type(pybind11::make_tuple(
+                               std::move(data), std::move(innerIndices), std::move(outerIndices)),
+                           pybind11::make_tuple(src.rows(), src.cols()))
+            .release();
+    }
+
+    PYBIND11_TYPE_CASTER(Type,
+                         const_name<(Type::IsRowMajor) != 0>("scipy.sparse.csr_matrix[",
+                                                             "scipy.sparse.csc_matrix[")
+                             + npy_format_descriptor<Scalar>::name + const_name("]"));
+};
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen/tensor.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen/tensor.h
new file mode 100644
index 0000000000..d4ed6c0ca8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eigen/tensor.h
@@ -0,0 +1,517 @@
+/*
+    pybind11/eigen/tensor.h: Transparent conversion for Eigen tensors
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "../numpy.h"
+#include "common.h"
+
+#if defined(__GNUC__) && !defined(__clang__) && !defined(__INTEL_COMPILER)
+static_assert(__GNUC__ > 5, "Eigen Tensor support in pybind11 requires GCC > 5.0");
+#endif
+
+// Disable warnings for Eigen
+PYBIND11_WARNING_PUSH
+PYBIND11_WARNING_DISABLE_MSVC(4554)
+PYBIND11_WARNING_DISABLE_MSVC(4127)
+#if defined(__MINGW32__)
+PYBIND11_WARNING_DISABLE_GCC("-Wmaybe-uninitialized")
+#endif
+
+#include <unsupported/Eigen/CXX11/Tensor>
+
+PYBIND11_WARNING_POP
+
+static_assert(EIGEN_VERSION_AT_LEAST(3, 3, 0),
+              "Eigen Tensor support in pybind11 requires Eigen >= 3.3.0");
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+PYBIND11_WARNING_DISABLE_MSVC(4127)
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+inline bool is_tensor_aligned(const void *data) {
+    return (reinterpret_cast<std::size_t>(data) % EIGEN_DEFAULT_ALIGN_BYTES) == 0;
+}
+
+template <typename T>
+constexpr int compute_array_flag_from_tensor() {
+    static_assert((static_cast<int>(T::Layout) == static_cast<int>(Eigen::RowMajor))
+                      || (static_cast<int>(T::Layout) == static_cast<int>(Eigen::ColMajor)),
+                  "Layout must be row or column major");
+    return (static_cast<int>(T::Layout) == static_cast<int>(Eigen::RowMajor)) ? array::c_style
+                                                                              : array::f_style;
+}
+
+template <typename T>
+struct eigen_tensor_helper {};
+
+template <typename Scalar_, int NumIndices_, int Options_, typename IndexType>
+struct eigen_tensor_helper<Eigen::Tensor<Scalar_, NumIndices_, Options_, IndexType>> {
+    using Type = Eigen::Tensor<Scalar_, NumIndices_, Options_, IndexType>;
+    using ValidType = void;
+
+    static Eigen::DSizes<typename Type::Index, Type::NumIndices> get_shape(const Type &f) {
+        return f.dimensions();
+    }
+
+    static constexpr bool
+    is_correct_shape(const Eigen::DSizes<typename Type::Index, Type::NumIndices> & /*shape*/) {
+        return true;
+    }
+
+    template <typename T>
+    struct helper {};
+
+    template <size_t... Is>
+    struct helper<index_sequence<Is...>> {
+        static constexpr auto value = ::pybind11::detail::concat(const_name(((void) Is, "?"))...);
+    };
+
+    static constexpr auto dimensions_descriptor
+        = helper<decltype(make_index_sequence<Type::NumIndices>())>::value;
+
+    template <typename... Args>
+    static Type *alloc(Args &&...args) {
+        return new Type(std::forward<Args>(args)...);
+    }
+
+    static void free(Type *tensor) { delete tensor; }
+};
+
+template <typename Scalar_, typename std::ptrdiff_t... Indices, int Options_, typename IndexType>
+struct eigen_tensor_helper<
+    Eigen::TensorFixedSize<Scalar_, Eigen::Sizes<Indices...>, Options_, IndexType>> {
+    using Type = Eigen::TensorFixedSize<Scalar_, Eigen::Sizes<Indices...>, Options_, IndexType>;
+    using ValidType = void;
+
+    static constexpr Eigen::DSizes<typename Type::Index, Type::NumIndices>
+    get_shape(const Type & /*f*/) {
+        return get_shape();
+    }
+
+    static constexpr Eigen::DSizes<typename Type::Index, Type::NumIndices> get_shape() {
+        return Eigen::DSizes<typename Type::Index, Type::NumIndices>(Indices...);
+    }
+
+    static bool
+    is_correct_shape(const Eigen::DSizes<typename Type::Index, Type::NumIndices> &shape) {
+        return get_shape() == shape;
+    }
+
+    static constexpr auto dimensions_descriptor
+        = ::pybind11::detail::concat(const_name<Indices>()...);
+
+    template <typename... Args>
+    static Type *alloc(Args &&...args) {
+        Eigen::aligned_allocator<Type> allocator;
+        return ::new (allocator.allocate(1)) Type(std::forward<Args>(args)...);
+    }
+
+    static void free(Type *tensor) {
+        Eigen::aligned_allocator<Type> allocator;
+        tensor->~Type();
+        allocator.deallocate(tensor, 1);
+    }
+};
+
+template <typename Type, bool ShowDetails, bool NeedsWriteable = false>
+struct get_tensor_descriptor {
+    static constexpr auto details
+        = const_name<NeedsWriteable>(", flags.writeable", "")
+          + const_name<static_cast<int>(Type::Layout) == static_cast<int>(Eigen::RowMajor)>(
+              ", flags.c_contiguous", ", flags.f_contiguous");
+    static constexpr auto value
+        = const_name("numpy.ndarray[") + npy_format_descriptor<typename Type::Scalar>::name
+          + const_name("[") + eigen_tensor_helper<remove_cv_t<Type>>::dimensions_descriptor
+          + const_name("]") + const_name<ShowDetails>(details, const_name("")) + const_name("]");
+};
+
+// When EIGEN_AVOID_STL_ARRAY is defined, Eigen::DSizes<T, 0> does not have the begin() member
+// function. Falling back to a simple loop works around this issue.
+//
+// We need to disable the type-limits warning for the inner loop when size = 0.
+
+PYBIND11_WARNING_PUSH
+PYBIND11_WARNING_DISABLE_GCC("-Wtype-limits")
+
+template <typename T, int size>
+std::vector<T> convert_dsizes_to_vector(const Eigen::DSizes<T, size> &arr) {
+    std::vector<T> result(size);
+
+    for (size_t i = 0; i < size; i++) {
+        result[i] = arr[i];
+    }
+
+    return result;
+}
+
+template <typename T, int size>
+Eigen::DSizes<T, size> get_shape_for_array(const array &arr) {
+    Eigen::DSizes<T, size> result;
+    const T *shape = arr.shape();
+    for (size_t i = 0; i < size; i++) {
+        result[i] = shape[i];
+    }
+
+    return result;
+}
+
+PYBIND11_WARNING_POP
+
+template <typename Type>
+struct type_caster<Type, typename eigen_tensor_helper<Type>::ValidType> {
+    static_assert(!std::is_pointer<typename Type::Scalar>::value,
+                  PYBIND11_EIGEN_MESSAGE_POINTER_TYPES_ARE_NOT_SUPPORTED);
+    using Helper = eigen_tensor_helper<Type>;
+    static constexpr auto temp_name = get_tensor_descriptor<Type, false>::value;
+    PYBIND11_TYPE_CASTER(Type, temp_name);
+
+    bool load(handle src, bool convert) {
+        if (!convert) {
+            if (!isinstance<array>(src)) {
+                return false;
+            }
+            array temp = array::ensure(src);
+            if (!temp) {
+                return false;
+            }
+
+            if (!temp.dtype().is(dtype::of<typename Type::Scalar>())) {
+                return false;
+            }
+        }
+
+        array_t<typename Type::Scalar, compute_array_flag_from_tensor<Type>()> arr(
+            reinterpret_borrow<object>(src));
+
+        if (arr.ndim() != Type::NumIndices) {
+            return false;
+        }
+        auto shape = get_shape_for_array<typename Type::Index, Type::NumIndices>(arr);
+
+        if (!Helper::is_correct_shape(shape)) {
+            return false;
+        }
+
+#if EIGEN_VERSION_AT_LEAST(3, 4, 0)
+        auto data_pointer = arr.data();
+#else
+        // Handle Eigen bug
+        auto data_pointer = const_cast<typename Type::Scalar *>(arr.data());
+#endif
+
+        if (is_tensor_aligned(arr.data())) {
+            value = Eigen::TensorMap<const Type, Eigen::Aligned>(data_pointer, shape);
+        } else {
+            value = Eigen::TensorMap<const Type>(data_pointer, shape);
+        }
+
+        return true;
+    }
+
+    static handle cast(Type &&src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::reference
+            || policy == return_value_policy::reference_internal) {
+            pybind11_fail("Cannot use a reference return value policy for an rvalue");
+        }
+        return cast_impl(&src, return_value_policy::move, parent);
+    }
+
+    static handle cast(const Type &&src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::reference
+            || policy == return_value_policy::reference_internal) {
+            pybind11_fail("Cannot use a reference return value policy for an rvalue");
+        }
+        return cast_impl(&src, return_value_policy::move, parent);
+    }
+
+    static handle cast(Type &src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic
+            || policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::copy;
+        }
+        return cast_impl(&src, policy, parent);
+    }
+
+    static handle cast(const Type &src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic
+            || policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::copy;
+        }
+        return cast(&src, policy, parent);
+    }
+
+    static handle cast(Type *src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic) {
+            policy = return_value_policy::take_ownership;
+        } else if (policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::reference;
+        }
+        return cast_impl(src, policy, parent);
+    }
+
+    static handle cast(const Type *src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic) {
+            policy = return_value_policy::take_ownership;
+        } else if (policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::reference;
+        }
+        return cast_impl(src, policy, parent);
+    }
+
+    template <typename C>
+    static handle cast_impl(C *src, return_value_policy policy, handle parent) {
+        object parent_object;
+        bool writeable = false;
+        switch (policy) {
+            case return_value_policy::move:
+                if (std::is_const<C>::value) {
+                    pybind11_fail("Cannot move from a constant reference");
+                }
+
+                src = Helper::alloc(std::move(*src));
+
+                parent_object
+                    = capsule(src, [](void *ptr) { Helper::free(reinterpret_cast<Type *>(ptr)); });
+                writeable = true;
+                break;
+
+            case return_value_policy::take_ownership:
+                if (std::is_const<C>::value) {
+                    // This cast is ugly, and might be UB in some cases, but we don't have an
+                    // alternative here as we must free that memory
+                    Helper::free(const_cast<Type *>(src));
+                    pybind11_fail("Cannot take ownership of a const reference");
+                }
+
+                parent_object
+                    = capsule(src, [](void *ptr) { Helper::free(reinterpret_cast<Type *>(ptr)); });
+                writeable = true;
+                break;
+
+            case return_value_policy::copy:
+                writeable = true;
+                break;
+
+            case return_value_policy::reference:
+                parent_object = none();
+                writeable = !std::is_const<C>::value;
+                break;
+
+            case return_value_policy::reference_internal:
+                // Default should do the right thing
+                if (!parent) {
+                    pybind11_fail("Cannot use reference internal when there is no parent");
+                }
+                parent_object = reinterpret_borrow<object>(parent);
+                writeable = !std::is_const<C>::value;
+                break;
+
+            default:
+                pybind11_fail("pybind11 bug in eigen.h, please file a bug report");
+        }
+
+        auto result = array_t<typename Type::Scalar, compute_array_flag_from_tensor<Type>()>(
+            convert_dsizes_to_vector(Helper::get_shape(*src)), src->data(), parent_object);
+
+        if (!writeable) {
+            array_proxy(result.ptr())->flags &= ~detail::npy_api::NPY_ARRAY_WRITEABLE_;
+        }
+
+        return result.release();
+    }
+};
+
+template <typename StoragePointerType,
+          bool needs_writeable,
+          enable_if_t<!needs_writeable, bool> = true>
+StoragePointerType get_array_data_for_type(array &arr) {
+#if EIGEN_VERSION_AT_LEAST(3, 4, 0)
+    return reinterpret_cast<StoragePointerType>(arr.data());
+#else
+    // Handle Eigen bug
+    return reinterpret_cast<StoragePointerType>(const_cast<void *>(arr.data()));
+#endif
+}
+
+template <typename StoragePointerType,
+          bool needs_writeable,
+          enable_if_t<needs_writeable, bool> = true>
+StoragePointerType get_array_data_for_type(array &arr) {
+    return reinterpret_cast<StoragePointerType>(arr.mutable_data());
+}
+
+template <typename T, typename = void>
+struct get_storage_pointer_type;
+
+template <typename MapType>
+struct get_storage_pointer_type<MapType, void_t<typename MapType::StoragePointerType>> {
+    using SPT = typename MapType::StoragePointerType;
+};
+
+template <typename MapType>
+struct get_storage_pointer_type<MapType, void_t<typename MapType::PointerArgType>> {
+    using SPT = typename MapType::PointerArgType;
+};
+
+template <typename Type, int Options>
+struct type_caster<Eigen::TensorMap<Type, Options>,
+                   typename eigen_tensor_helper<remove_cv_t<Type>>::ValidType> {
+    static_assert(!std::is_pointer<typename Type::Scalar>::value,
+                  PYBIND11_EIGEN_MESSAGE_POINTER_TYPES_ARE_NOT_SUPPORTED);
+    using MapType = Eigen::TensorMap<Type, Options>;
+    using Helper = eigen_tensor_helper<remove_cv_t<Type>>;
+
+    bool load(handle src, bool /*convert*/) {
+        // Note that we have a lot more checks here as we want to make sure to avoid copies
+        if (!isinstance<array>(src)) {
+            return false;
+        }
+        auto arr = reinterpret_borrow<array>(src);
+        if ((arr.flags() & compute_array_flag_from_tensor<Type>()) == 0) {
+            return false;
+        }
+
+        if (!arr.dtype().is(dtype::of<typename Type::Scalar>())) {
+            return false;
+        }
+
+        if (arr.ndim() != Type::NumIndices) {
+            return false;
+        }
+
+        constexpr bool is_aligned = (Options & Eigen::Aligned) != 0;
+
+        if (is_aligned && !is_tensor_aligned(arr.data())) {
+            return false;
+        }
+
+        auto shape = get_shape_for_array<typename Type::Index, Type::NumIndices>(arr);
+
+        if (!Helper::is_correct_shape(shape)) {
+            return false;
+        }
+
+        if (needs_writeable && !arr.writeable()) {
+            return false;
+        }
+
+        auto result = get_array_data_for_type<typename get_storage_pointer_type<MapType>::SPT,
+                                              needs_writeable>(arr);
+
+        value.reset(new MapType(std::move(result), std::move(shape)));
+
+        return true;
+    }
+
+    static handle cast(MapType &&src, return_value_policy policy, handle parent) {
+        return cast_impl(&src, policy, parent);
+    }
+
+    static handle cast(const MapType &&src, return_value_policy policy, handle parent) {
+        return cast_impl(&src, policy, parent);
+    }
+
+    static handle cast(MapType &src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic
+            || policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::copy;
+        }
+        return cast_impl(&src, policy, parent);
+    }
+
+    static handle cast(const MapType &src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic
+            || policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::copy;
+        }
+        return cast(&src, policy, parent);
+    }
+
+    static handle cast(MapType *src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic) {
+            policy = return_value_policy::take_ownership;
+        } else if (policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::reference;
+        }
+        return cast_impl(src, policy, parent);
+    }
+
+    static handle cast(const MapType *src, return_value_policy policy, handle parent) {
+        if (policy == return_value_policy::automatic) {
+            policy = return_value_policy::take_ownership;
+        } else if (policy == return_value_policy::automatic_reference) {
+            policy = return_value_policy::reference;
+        }
+        return cast_impl(src, policy, parent);
+    }
+
+    template <typename C>
+    static handle cast_impl(C *src, return_value_policy policy, handle parent) {
+        object parent_object;
+        constexpr bool writeable = !std::is_const<C>::value;
+        switch (policy) {
+            case return_value_policy::reference:
+                parent_object = none();
+                break;
+
+            case return_value_policy::reference_internal:
+                // Default should do the right thing
+                if (!parent) {
+                    pybind11_fail("Cannot use reference internal when there is no parent");
+                }
+                parent_object = reinterpret_borrow<object>(parent);
+                break;
+
+            case return_value_policy::take_ownership:
+                delete src;
+                // fallthrough
+            default:
+                // move, take_ownership don't make any sense for a ref/map:
+                pybind11_fail("Invalid return_value_policy for Eigen Map type, must be either "
+                              "reference or reference_internal");
+        }
+
+        auto result = array_t<typename Type::Scalar, compute_array_flag_from_tensor<Type>()>(
+            convert_dsizes_to_vector(Helper::get_shape(*src)),
+            src->data(),
+            std::move(parent_object));
+
+        if (!writeable) {
+            array_proxy(result.ptr())->flags &= ~detail::npy_api::NPY_ARRAY_WRITEABLE_;
+        }
+
+        return result.release();
+    }
+
+#if EIGEN_VERSION_AT_LEAST(3, 4, 0)
+
+    static constexpr bool needs_writeable = !std::is_const<typename std::remove_pointer<
+        typename get_storage_pointer_type<MapType>::SPT>::type>::value;
+#else
+    // Handle Eigen bug
+    static constexpr bool needs_writeable = !std::is_const<Type>::value;
+#endif
+
+protected:
+    // TODO: Move to std::optional once std::optional has more support
+    std::unique_ptr<MapType> value;
+
+public:
+    static constexpr auto name = get_tensor_descriptor<Type, true, needs_writeable>::value;
+    explicit operator MapType *() { return value.get(); }
+    explicit operator MapType &() { return *value; }
+    explicit operator MapType &&() && { return std::move(*value); }
+
+    template <typename T_>
+    using cast_op_type = ::pybind11::detail::movable_cast_op_type<T_>;
+};
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/embed.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/embed.h
new file mode 100644
index 0000000000..9d29eb8249
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/embed.h
@@ -0,0 +1,313 @@
+/*
+    pybind11/embed.h: Support for embedding the interpreter
+
+    Copyright (c) 2017 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "pybind11.h"
+#include "eval.h"
+
+#include <memory>
+#include <vector>
+
+#if defined(PYPY_VERSION)
+#    error Embedding the interpreter is not supported with PyPy
+#endif
+
+#define PYBIND11_EMBEDDED_MODULE_IMPL(name)                                                       \
+    extern "C" PyObject *pybind11_init_impl_##name();                                             \
+    extern "C" PyObject *pybind11_init_impl_##name() { return pybind11_init_wrapper_##name(); }
+
+/** \rst
+    Add a new module to the table of builtins for the interpreter. Must be
+    defined in global scope. The first macro parameter is the name of the
+    module (without quotes). The second parameter is the variable which will
+    be used as the interface to add functions and classes to the module.
+
+    .. code-block:: cpp
+
+        PYBIND11_EMBEDDED_MODULE(example, m) {
+            // ... initialize functions and classes here
+            m.def("foo", []() {
+                return "Hello, World!";
+            });
+        }
+ \endrst */
+#define PYBIND11_EMBEDDED_MODULE(name, variable)                                                  \
+    static ::pybind11::module_::module_def PYBIND11_CONCAT(pybind11_module_def_, name);           \
+    static void PYBIND11_CONCAT(pybind11_init_, name)(::pybind11::module_ &);                     \
+    static PyObject PYBIND11_CONCAT(*pybind11_init_wrapper_, name)() {                            \
+        auto m = ::pybind11::module_::create_extension_module(                                    \
+            PYBIND11_TOSTRING(name), nullptr, &PYBIND11_CONCAT(pybind11_module_def_, name));      \
+        try {                                                                                     \
+            PYBIND11_CONCAT(pybind11_init_, name)(m);                                             \
+            return m.ptr();                                                                       \
+        }                                                                                         \
+        PYBIND11_CATCH_INIT_EXCEPTIONS                                                            \
+    }                                                                                             \
+    PYBIND11_EMBEDDED_MODULE_IMPL(name)                                                           \
+    ::pybind11::detail::embedded_module PYBIND11_CONCAT(pybind11_module_, name)(                  \
+        PYBIND11_TOSTRING(name), PYBIND11_CONCAT(pybind11_init_impl_, name));                     \
+    void PYBIND11_CONCAT(pybind11_init_, name)(::pybind11::module_                                \
+                                               & variable) // NOLINT(bugprone-macro-parentheses)
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+/// Python 2.7/3.x compatible version of `PyImport_AppendInittab` and error checks.
+struct embedded_module {
+    using init_t = PyObject *(*) ();
+    embedded_module(const char *name, init_t init) {
+        if (Py_IsInitialized() != 0) {
+            pybind11_fail("Can't add new modules after the interpreter has been initialized");
+        }
+
+        auto result = PyImport_AppendInittab(name, init);
+        if (result == -1) {
+            pybind11_fail("Insufficient memory to add a new module");
+        }
+    }
+};
+
+struct wide_char_arg_deleter {
+    void operator()(wchar_t *ptr) const {
+        // API docs: https://docs.python.org/3/c-api/sys.html#c.Py_DecodeLocale
+        PyMem_RawFree(ptr);
+    }
+};
+
+inline wchar_t *widen_chars(const char *safe_arg) {
+    wchar_t *widened_arg = Py_DecodeLocale(safe_arg, nullptr);
+    return widened_arg;
+}
+
+inline void precheck_interpreter() {
+    if (Py_IsInitialized() != 0) {
+        pybind11_fail("The interpreter is already running");
+    }
+}
+
+#if !defined(PYBIND11_PYCONFIG_SUPPORT_PY_VERSION_HEX)
+#    define PYBIND11_PYCONFIG_SUPPORT_PY_VERSION_HEX (0x03080000)
+#endif
+
+#if PY_VERSION_HEX < PYBIND11_PYCONFIG_SUPPORT_PY_VERSION_HEX
+inline void initialize_interpreter_pre_pyconfig(bool init_signal_handlers,
+                                                int argc,
+                                                const char *const *argv,
+                                                bool add_program_dir_to_path) {
+    detail::precheck_interpreter();
+    Py_InitializeEx(init_signal_handlers ? 1 : 0);
+
+    // Before it was special-cased in python 3.8, passing an empty or null argv
+    // caused a segfault, so we have to reimplement the special case ourselves.
+    bool special_case = (argv == nullptr || argc <= 0);
+
+    const char *const empty_argv[]{"\0"};
+    const char *const *safe_argv = special_case ? empty_argv : argv;
+    if (special_case) {
+        argc = 1;
+    }
+
+    auto argv_size = static_cast<size_t>(argc);
+    // SetArgv* on python 3 takes wchar_t, so we have to convert.
+    std::unique_ptr<wchar_t *[]> widened_argv(new wchar_t *[argv_size]);
+    std::vector<std::unique_ptr<wchar_t[], detail::wide_char_arg_deleter>> widened_argv_entries;
+    widened_argv_entries.reserve(argv_size);
+    for (size_t ii = 0; ii < argv_size; ++ii) {
+        widened_argv_entries.emplace_back(detail::widen_chars(safe_argv[ii]));
+        if (!widened_argv_entries.back()) {
+            // A null here indicates a character-encoding failure or the python
+            // interpreter out of memory. Give up.
+            return;
+        }
+        widened_argv[ii] = widened_argv_entries.back().get();
+    }
+
+    auto *pysys_argv = widened_argv.get();
+
+    PySys_SetArgvEx(argc, pysys_argv, static_cast<int>(add_program_dir_to_path));
+}
+#endif
+
+PYBIND11_NAMESPACE_END(detail)
+
+#if PY_VERSION_HEX >= PYBIND11_PYCONFIG_SUPPORT_PY_VERSION_HEX
+inline void initialize_interpreter(PyConfig *config,
+                                   int argc = 0,
+                                   const char *const *argv = nullptr,
+                                   bool add_program_dir_to_path = true) {
+    detail::precheck_interpreter();
+    PyStatus status = PyConfig_SetBytesArgv(config, argc, const_cast<char *const *>(argv));
+    if (PyStatus_Exception(status) != 0) {
+        // A failure here indicates a character-encoding failure or the python
+        // interpreter out of memory. Give up.
+        PyConfig_Clear(config);
+        throw std::runtime_error(PyStatus_IsError(status) != 0 ? status.err_msg
+                                                               : "Failed to prepare CPython");
+    }
+    status = Py_InitializeFromConfig(config);
+    if (PyStatus_Exception(status) != 0) {
+        PyConfig_Clear(config);
+        throw std::runtime_error(PyStatus_IsError(status) != 0 ? status.err_msg
+                                                               : "Failed to init CPython");
+    }
+    if (add_program_dir_to_path) {
+        PyRun_SimpleString("import sys, os.path; "
+                           "sys.path.insert(0, "
+                           "os.path.abspath(os.path.dirname(sys.argv[0])) "
+                           "if sys.argv and os.path.exists(sys.argv[0]) else '')");
+    }
+    PyConfig_Clear(config);
+}
+#endif
+
+/** \rst
+    Initialize the Python interpreter. No other pybind11 or CPython API functions can be
+    called before this is done; with the exception of `PYBIND11_EMBEDDED_MODULE`. The
+    optional `init_signal_handlers` parameter can be used to skip the registration of
+    signal handlers (see the `Python documentation`_ for details). Calling this function
+    again after the interpreter has already been initialized is a fatal error.
+
+    If initializing the Python interpreter fails, then the program is terminated.  (This
+    is controlled by the CPython runtime and is an exception to pybind11's normal behavior
+    of throwing exceptions on errors.)
+
+    The remaining optional parameters, `argc`, `argv`, and `add_program_dir_to_path` are
+    used to populate ``sys.argv`` and ``sys.path``.
+    See the |PySys_SetArgvEx documentation|_ for details.
+
+    .. _Python documentation: https://docs.python.org/3/c-api/init.html#c.Py_InitializeEx
+    .. |PySys_SetArgvEx documentation| replace:: ``PySys_SetArgvEx`` documentation
+    .. _PySys_SetArgvEx documentation: https://docs.python.org/3/c-api/init.html#c.PySys_SetArgvEx
+ \endrst */
+inline void initialize_interpreter(bool init_signal_handlers = true,
+                                   int argc = 0,
+                                   const char *const *argv = nullptr,
+                                   bool add_program_dir_to_path = true) {
+#if PY_VERSION_HEX < PYBIND11_PYCONFIG_SUPPORT_PY_VERSION_HEX
+    detail::initialize_interpreter_pre_pyconfig(
+        init_signal_handlers, argc, argv, add_program_dir_to_path);
+#else
+    PyConfig config;
+    PyConfig_InitPythonConfig(&config);
+    // See PR #4473 for background
+    config.parse_argv = 0;
+
+    config.install_signal_handlers = init_signal_handlers ? 1 : 0;
+    initialize_interpreter(&config, argc, argv, add_program_dir_to_path);
+#endif
+}
+
+/** \rst
+    Shut down the Python interpreter. No pybind11 or CPython API functions can be called
+    after this. In addition, pybind11 objects must not outlive the interpreter:
+
+    .. code-block:: cpp
+
+        { // BAD
+            py::initialize_interpreter();
+            auto hello = py::str("Hello, World!");
+            py::finalize_interpreter();
+        } // <-- BOOM, hello's destructor is called after interpreter shutdown
+
+        { // GOOD
+            py::initialize_interpreter();
+            { // scoped
+                auto hello = py::str("Hello, World!");
+            } // <-- OK, hello is cleaned up properly
+            py::finalize_interpreter();
+        }
+
+        { // BETTER
+            py::scoped_interpreter guard{};
+            auto hello = py::str("Hello, World!");
+        }
+
+    .. warning::
+
+        The interpreter can be restarted by calling `initialize_interpreter` again.
+        Modules created using pybind11 can be safely re-initialized. However, Python
+        itself cannot completely unload binary extension modules and there are several
+        caveats with regard to interpreter restarting. All the details can be found
+        in the CPython documentation. In short, not all interpreter memory may be
+        freed, either due to reference cycles or user-created global data.
+
+ \endrst */
+inline void finalize_interpreter() {
+    // Get the internals pointer (without creating it if it doesn't exist).  It's possible for the
+    // internals to be created during Py_Finalize() (e.g. if a py::capsule calls `get_internals()`
+    // during destruction), so we get the pointer-pointer here and check it after Py_Finalize().
+    detail::internals **internals_ptr_ptr = detail::get_internals_pp();
+    // It could also be stashed in state_dict, so look there too:
+    if (object internals_obj
+        = get_internals_obj_from_state_dict(detail::get_python_state_dict())) {
+        internals_ptr_ptr = detail::get_internals_pp_from_capsule(internals_obj);
+    }
+    // Local internals contains data managed by the current interpreter, so we must clear them to
+    // avoid undefined behaviors when initializing another interpreter
+    detail::get_local_internals().registered_types_cpp.clear();
+    detail::get_local_internals().registered_exception_translators.clear();
+
+    Py_Finalize();
+
+    if (internals_ptr_ptr) {
+        delete *internals_ptr_ptr;
+        *internals_ptr_ptr = nullptr;
+    }
+}
+
+/** \rst
+    Scope guard version of `initialize_interpreter` and `finalize_interpreter`.
+    This a move-only guard and only a single instance can exist.
+
+    See `initialize_interpreter` for a discussion of its constructor arguments.
+
+    .. code-block:: cpp
+
+        #include <pybind11/embed.h>
+
+        int main() {
+            py::scoped_interpreter guard{};
+            py::print(Hello, World!);
+        } // <-- interpreter shutdown
+ \endrst */
+class scoped_interpreter {
+public:
+    explicit scoped_interpreter(bool init_signal_handlers = true,
+                                int argc = 0,
+                                const char *const *argv = nullptr,
+                                bool add_program_dir_to_path = true) {
+        initialize_interpreter(init_signal_handlers, argc, argv, add_program_dir_to_path);
+    }
+
+#if PY_VERSION_HEX >= PYBIND11_PYCONFIG_SUPPORT_PY_VERSION_HEX
+    explicit scoped_interpreter(PyConfig *config,
+                                int argc = 0,
+                                const char *const *argv = nullptr,
+                                bool add_program_dir_to_path = true) {
+        initialize_interpreter(config, argc, argv, add_program_dir_to_path);
+    }
+#endif
+
+    scoped_interpreter(const scoped_interpreter &) = delete;
+    scoped_interpreter(scoped_interpreter &&other) noexcept { other.is_valid = false; }
+    scoped_interpreter &operator=(const scoped_interpreter &) = delete;
+    scoped_interpreter &operator=(scoped_interpreter &&) = delete;
+
+    ~scoped_interpreter() {
+        if (is_valid) {
+            finalize_interpreter();
+        }
+    }
+
+private:
+    bool is_valid = true;
+};
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eval.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eval.h
new file mode 100644
index 0000000000..bd5f981f53
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/eval.h
@@ -0,0 +1,156 @@
+/*
+    pybind11/eval.h: Support for evaluating Python expressions and statements
+    from strings and files
+
+    Copyright (c) 2016 Klemens Morgenstern <klemens.morgenstern@ed-chemnitz.de> and
+                       Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "pybind11.h"
+
+#include <utility>
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+inline void ensure_builtins_in_globals(object &global) {
+#if defined(PYPY_VERSION) || PY_VERSION_HEX < 0x03080000
+    // Running exec and eval adds `builtins` module under `__builtins__` key to
+    // globals if not yet present.  Python 3.8 made PyRun_String behave
+    // similarly. Let's also do that for older versions, for consistency. This
+    // was missing from PyPy3.8 7.3.7.
+    if (!global.contains("__builtins__"))
+        global["__builtins__"] = module_::import(PYBIND11_BUILTINS_MODULE);
+#else
+    (void) global;
+#endif
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+enum eval_mode {
+    /// Evaluate a string containing an isolated expression
+    eval_expr,
+
+    /// Evaluate a string containing a single statement. Returns \c none
+    eval_single_statement,
+
+    /// Evaluate a string containing a sequence of statement. Returns \c none
+    eval_statements
+};
+
+template <eval_mode mode = eval_expr>
+object eval(const str &expr, object global = globals(), object local = object()) {
+    if (!local) {
+        local = global;
+    }
+
+    detail::ensure_builtins_in_globals(global);
+
+    /* PyRun_String does not accept a PyObject / encoding specifier,
+       this seems to be the only alternative */
+    std::string buffer = "# -*- coding: utf-8 -*-\n" + (std::string) expr;
+
+    int start = 0;
+    switch (mode) {
+        case eval_expr:
+            start = Py_eval_input;
+            break;
+        case eval_single_statement:
+            start = Py_single_input;
+            break;
+        case eval_statements:
+            start = Py_file_input;
+            break;
+        default:
+            pybind11_fail("invalid evaluation mode");
+    }
+
+    PyObject *result = PyRun_String(buffer.c_str(), start, global.ptr(), local.ptr());
+    if (!result) {
+        throw error_already_set();
+    }
+    return reinterpret_steal<object>(result);
+}
+
+template <eval_mode mode = eval_expr, size_t N>
+object eval(const char (&s)[N], object global = globals(), object local = object()) {
+    /* Support raw string literals by removing common leading whitespace */
+    auto expr = (s[0] == '\n') ? str(module_::import("textwrap").attr("dedent")(s)) : str(s);
+    return eval<mode>(expr, std::move(global), std::move(local));
+}
+
+inline void exec(const str &expr, object global = globals(), object local = object()) {
+    eval<eval_statements>(expr, std::move(global), std::move(local));
+}
+
+template <size_t N>
+void exec(const char (&s)[N], object global = globals(), object local = object()) {
+    eval<eval_statements>(s, std::move(global), std::move(local));
+}
+
+#if defined(PYPY_VERSION)
+template <eval_mode mode = eval_statements>
+object eval_file(str, object, object) {
+    pybind11_fail("eval_file not supported in PyPy3. Use eval");
+}
+template <eval_mode mode = eval_statements>
+object eval_file(str, object) {
+    pybind11_fail("eval_file not supported in PyPy3. Use eval");
+}
+template <eval_mode mode = eval_statements>
+object eval_file(str) {
+    pybind11_fail("eval_file not supported in PyPy3. Use eval");
+}
+#else
+template <eval_mode mode = eval_statements>
+object eval_file(str fname, object global = globals(), object local = object()) {
+    if (!local) {
+        local = global;
+    }
+
+    detail::ensure_builtins_in_globals(global);
+
+    int start = 0;
+    switch (mode) {
+        case eval_expr:
+            start = Py_eval_input;
+            break;
+        case eval_single_statement:
+            start = Py_single_input;
+            break;
+        case eval_statements:
+            start = Py_file_input;
+            break;
+        default:
+            pybind11_fail("invalid evaluation mode");
+    }
+
+    int closeFile = 1;
+    std::string fname_str = (std::string) fname;
+    FILE *f = _Py_fopen_obj(fname.ptr(), "r");
+    if (!f) {
+        PyErr_Clear();
+        pybind11_fail("File \"" + fname_str + "\" could not be opened!");
+    }
+
+    if (!global.contains("__file__")) {
+        global["__file__"] = std::move(fname);
+    }
+
+    PyObject *result
+        = PyRun_FileEx(f, fname_str.c_str(), start, global.ptr(), local.ptr(), closeFile);
+
+    if (!result) {
+        throw error_already_set();
+    }
+    return reinterpret_steal<object>(result);
+}
+#endif
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/functional.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/functional.h
new file mode 100644
index 0000000000..6856119cde
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/functional.h
@@ -0,0 +1,138 @@
+/*
+    pybind11/functional.h: std::function<> support
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "pybind11.h"
+
+#include <functional>
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <typename Return, typename... Args>
+struct type_caster<std::function<Return(Args...)>> {
+    using type = std::function<Return(Args...)>;
+    using retval_type = conditional_t<std::is_same<Return, void>::value, void_type, Return>;
+    using function_type = Return (*)(Args...);
+
+public:
+    bool load(handle src, bool convert) {
+        if (src.is_none()) {
+            // Defer accepting None to other overloads (if we aren't in convert mode):
+            if (!convert) {
+                return false;
+            }
+            return true;
+        }
+
+        if (!isinstance<function>(src)) {
+            return false;
+        }
+
+        auto func = reinterpret_borrow<function>(src);
+
+        /*
+           When passing a C++ function as an argument to another C++
+           function via Python, every function call would normally involve
+           a full C++ -> Python -> C++ roundtrip, which can be prohibitive.
+           Here, we try to at least detect the case where the function is
+           stateless (i.e. function pointer or lambda function without
+           captured variables), in which case the roundtrip can be avoided.
+         */
+        if (auto cfunc = func.cpp_function()) {
+            auto *cfunc_self = PyCFunction_GET_SELF(cfunc.ptr());
+            if (cfunc_self == nullptr) {
+                PyErr_Clear();
+            } else if (isinstance<capsule>(cfunc_self)) {
+                auto c = reinterpret_borrow<capsule>(cfunc_self);
+
+                function_record *rec = nullptr;
+                // Check that we can safely reinterpret the capsule into a function_record
+                if (detail::is_function_record_capsule(c)) {
+                    rec = c.get_pointer<function_record>();
+                }
+
+                while (rec != nullptr) {
+                    if (rec->is_stateless
+                        && same_type(typeid(function_type),
+                                     *reinterpret_cast<const std::type_info *>(rec->data[1]))) {
+                        struct capture {
+                            function_type f;
+                        };
+                        value = ((capture *) &rec->data)->f;
+                        return true;
+                    }
+                    rec = rec->next;
+                }
+            }
+            // PYPY segfaults here when passing builtin function like sum.
+            // Raising an fail exception here works to prevent the segfault, but only on gcc.
+            // See PR #1413 for full details
+        }
+
+        // ensure GIL is held during functor destruction
+        struct func_handle {
+            function f;
+#if !(defined(_MSC_VER) && _MSC_VER == 1916 && defined(PYBIND11_CPP17))
+            // This triggers a syntax error under very special conditions (very weird indeed).
+            explicit
+#endif
+                func_handle(function &&f_) noexcept
+                : f(std::move(f_)) {
+            }
+            func_handle(const func_handle &f_) { operator=(f_); }
+            func_handle &operator=(const func_handle &f_) {
+                gil_scoped_acquire acq;
+                f = f_.f;
+                return *this;
+            }
+            ~func_handle() {
+                gil_scoped_acquire acq;
+                function kill_f(std::move(f));
+            }
+        };
+
+        // to emulate 'move initialization capture' in C++11
+        struct func_wrapper {
+            func_handle hfunc;
+            explicit func_wrapper(func_handle &&hf) noexcept : hfunc(std::move(hf)) {}
+            Return operator()(Args... args) const {
+                gil_scoped_acquire acq;
+                // casts the returned object as a rvalue to the return type
+                return hfunc.f(std::forward<Args>(args)...).template cast<Return>();
+            }
+        };
+
+        value = func_wrapper(func_handle(std::move(func)));
+        return true;
+    }
+
+    template <typename Func>
+    static handle cast(Func &&f_, return_value_policy policy, handle /* parent */) {
+        if (!f_) {
+            return none().release();
+        }
+
+        auto result = f_.template target<function_type>();
+        if (result) {
+            return cpp_function(*result, policy).release();
+        }
+        return cpp_function(std::forward<Func>(f_), policy).release();
+    }
+
+    PYBIND11_TYPE_CASTER(type,
+                         const_name("Callable[[")
+                             + ::pybind11::detail::concat(make_caster<Args>::name...)
+                             + const_name("], ") + make_caster<retval_type>::name
+                             + const_name("]"));
+};
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/gil.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/gil.h
new file mode 100644
index 0000000000..6b0edaee4e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/gil.h
@@ -0,0 +1,219 @@
+/*
+    pybind11/gil.h: RAII helpers for managing the GIL
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "detail/common.h"
+
+#include <cassert>
+
+#if !defined(PYBIND11_SIMPLE_GIL_MANAGEMENT)
+#    include "detail/internals.h"
+#endif
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+// forward declarations
+PyThreadState *get_thread_state_unchecked();
+
+PYBIND11_NAMESPACE_END(detail)
+
+#if !defined(PYBIND11_SIMPLE_GIL_MANAGEMENT)
+
+/* The functions below essentially reproduce the PyGILState_* API using a RAII
+ * pattern, but there are a few important differences:
+ *
+ * 1. When acquiring the GIL from an non-main thread during the finalization
+ *    phase, the GILState API blindly terminates the calling thread, which
+ *    is often not what is wanted. This API does not do this.
+ *
+ * 2. The gil_scoped_release function can optionally cut the relationship
+ *    of a PyThreadState and its associated thread, which allows moving it to
+ *    another thread (this is a fairly rare/advanced use case).
+ *
+ * 3. The reference count of an acquired thread state can be controlled. This
+ *    can be handy to prevent cases where callbacks issued from an external
+ *    thread would otherwise constantly construct and destroy thread state data
+ *    structures.
+ *
+ * See the Python bindings of NanoGUI (http://github.com/wjakob/nanogui) for an
+ * example which uses features 2 and 3 to migrate the Python thread of
+ * execution to another thread (to run the event loop on the original thread,
+ * in this case).
+ */
+
+class gil_scoped_acquire {
+public:
+    PYBIND11_NOINLINE gil_scoped_acquire() {
+        auto &internals = detail::get_internals();
+        tstate = (PyThreadState *) PYBIND11_TLS_GET_VALUE(internals.tstate);
+
+        if (!tstate) {
+            /* Check if the GIL was acquired using the PyGILState_* API instead (e.g. if
+               calling from a Python thread). Since we use a different key, this ensures
+               we don't create a new thread state and deadlock in PyEval_AcquireThread
+               below. Note we don't save this state with internals.tstate, since we don't
+               create it we would fail to clear it (its reference count should be > 0). */
+            tstate = PyGILState_GetThisThreadState();
+        }
+
+        if (!tstate) {
+            tstate = PyThreadState_New(internals.istate);
+#    if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+            if (!tstate) {
+                pybind11_fail("scoped_acquire: could not create thread state!");
+            }
+#    endif
+            tstate->gilstate_counter = 0;
+            PYBIND11_TLS_REPLACE_VALUE(internals.tstate, tstate);
+        } else {
+            release = detail::get_thread_state_unchecked() != tstate;
+        }
+
+        if (release) {
+            PyEval_AcquireThread(tstate);
+        }
+
+        inc_ref();
+    }
+
+    gil_scoped_acquire(const gil_scoped_acquire &) = delete;
+    gil_scoped_acquire &operator=(const gil_scoped_acquire &) = delete;
+
+    void inc_ref() { ++tstate->gilstate_counter; }
+
+    PYBIND11_NOINLINE void dec_ref() {
+        --tstate->gilstate_counter;
+#    if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+        if (detail::get_thread_state_unchecked() != tstate) {
+            pybind11_fail("scoped_acquire::dec_ref(): thread state must be current!");
+        }
+        if (tstate->gilstate_counter < 0) {
+            pybind11_fail("scoped_acquire::dec_ref(): reference count underflow!");
+        }
+#    endif
+        if (tstate->gilstate_counter == 0) {
+#    if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+            if (!release) {
+                pybind11_fail("scoped_acquire::dec_ref(): internal error!");
+            }
+#    endif
+            PyThreadState_Clear(tstate);
+            if (active) {
+                PyThreadState_DeleteCurrent();
+            }
+            PYBIND11_TLS_DELETE_VALUE(detail::get_internals().tstate);
+            release = false;
+        }
+    }
+
+    /// This method will disable the PyThreadState_DeleteCurrent call and the
+    /// GIL won't be acquired. This method should be used if the interpreter
+    /// could be shutting down when this is called, as thread deletion is not
+    /// allowed during shutdown. Check _Py_IsFinalizing() on Python 3.7+, and
+    /// protect subsequent code.
+    PYBIND11_NOINLINE void disarm() { active = false; }
+
+    PYBIND11_NOINLINE ~gil_scoped_acquire() {
+        dec_ref();
+        if (release) {
+            PyEval_SaveThread();
+        }
+    }
+
+private:
+    PyThreadState *tstate = nullptr;
+    bool release = true;
+    bool active = true;
+};
+
+class gil_scoped_release {
+public:
+    // PRECONDITION: The GIL must be held when this constructor is called.
+    explicit gil_scoped_release(bool disassoc = false) : disassoc(disassoc) {
+        assert(PyGILState_Check());
+        // `get_internals()` must be called here unconditionally in order to initialize
+        // `internals.tstate` for subsequent `gil_scoped_acquire` calls. Otherwise, an
+        // initialization race could occur as multiple threads try `gil_scoped_acquire`.
+        auto &internals = detail::get_internals();
+        // NOLINTNEXTLINE(cppcoreguidelines-prefer-member-initializer)
+        tstate = PyEval_SaveThread();
+        if (disassoc) {
+            // Python >= 3.7 can remove this, it's an int before 3.7
+            // NOLINTNEXTLINE(readability-qualified-auto)
+            auto key = internals.tstate;
+            PYBIND11_TLS_DELETE_VALUE(key);
+        }
+    }
+
+    gil_scoped_release(const gil_scoped_release &) = delete;
+    gil_scoped_release &operator=(const gil_scoped_release &) = delete;
+
+    /// This method will disable the PyThreadState_DeleteCurrent call and the
+    /// GIL won't be acquired. This method should be used if the interpreter
+    /// could be shutting down when this is called, as thread deletion is not
+    /// allowed during shutdown. Check _Py_IsFinalizing() on Python 3.7+, and
+    /// protect subsequent code.
+    PYBIND11_NOINLINE void disarm() { active = false; }
+
+    ~gil_scoped_release() {
+        if (!tstate) {
+            return;
+        }
+        // `PyEval_RestoreThread()` should not be called if runtime is finalizing
+        if (active) {
+            PyEval_RestoreThread(tstate);
+        }
+        if (disassoc) {
+            // Python >= 3.7 can remove this, it's an int before 3.7
+            // NOLINTNEXTLINE(readability-qualified-auto)
+            auto key = detail::get_internals().tstate;
+            PYBIND11_TLS_REPLACE_VALUE(key, tstate);
+        }
+    }
+
+private:
+    PyThreadState *tstate;
+    bool disassoc;
+    bool active = true;
+};
+
+#else // PYBIND11_SIMPLE_GIL_MANAGEMENT
+
+class gil_scoped_acquire {
+    PyGILState_STATE state;
+
+public:
+    gil_scoped_acquire() : state{PyGILState_Ensure()} {}
+    gil_scoped_acquire(const gil_scoped_acquire &) = delete;
+    gil_scoped_acquire &operator=(const gil_scoped_acquire &) = delete;
+    ~gil_scoped_acquire() { PyGILState_Release(state); }
+    void disarm() {}
+};
+
+class gil_scoped_release {
+    PyThreadState *state;
+
+public:
+    // PRECONDITION: The GIL must be held when this constructor is called.
+    gil_scoped_release() {
+        assert(PyGILState_Check());
+        state = PyEval_SaveThread();
+    }
+    gil_scoped_release(const gil_scoped_release &) = delete;
+    gil_scoped_release &operator=(const gil_scoped_release &) = delete;
+    ~gil_scoped_release() { PyEval_RestoreThread(state); }
+    void disarm() {}
+};
+
+#endif // PYBIND11_SIMPLE_GIL_MANAGEMENT
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/gil_safe_call_once.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/gil_safe_call_once.h
new file mode 100644
index 0000000000..eaf84d16e8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/gil_safe_call_once.h
@@ -0,0 +1,91 @@
+// Copyright (c) 2023 The pybind Community.
+
+#pragma once
+
+#include "detail/common.h"
+#include "gil.h"
+
+#include <cassert>
+#include <mutex>
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+// Use the `gil_safe_call_once_and_store` class below instead of the naive
+//
+//   static auto imported_obj = py::module_::import("module_name"); // BAD, DO NOT USE!
+//
+// which has two serious issues:
+//
+//     1. Py_DECREF() calls potentially after the Python interpreter was finalized already, and
+//     2. deadlocks in multi-threaded processes (because of missing lock ordering).
+//
+// The following alternative avoids both problems:
+//
+//   PYBIND11_CONSTINIT static py::gil_safe_call_once_and_store<py::object> storage;
+//   auto &imported_obj = storage // Do NOT make this `static`!
+//       .call_once_and_store_result([]() {
+//           return py::module_::import("module_name");
+//       })
+//       .get_stored();
+//
+// The parameter of `call_once_and_store_result()` must be callable. It can make
+// CPython API calls, and in particular, it can temporarily release the GIL.
+//
+// `T` can be any C++ type, it does not have to involve CPython API types.
+//
+// The behavior with regard to signals, e.g. `SIGINT` (`KeyboardInterrupt`),
+// is not ideal. If the main thread is the one to actually run the `Callable`,
+// then a `KeyboardInterrupt` will interrupt it if it is running normal Python
+// code. The situation is different if a non-main thread runs the
+// `Callable`, and then the main thread starts waiting for it to complete:
+// a `KeyboardInterrupt` will not interrupt the non-main thread, but it will
+// get processed only when it is the main thread's turn again and it is running
+// normal Python code. However, this will be unnoticeable for quick call-once
+// functions, which is usually the case.
+template <typename T>
+class gil_safe_call_once_and_store {
+public:
+    // PRECONDITION: The GIL must be held when `call_once_and_store_result()` is called.
+    template <typename Callable>
+    gil_safe_call_once_and_store &call_once_and_store_result(Callable &&fn) {
+        if (!is_initialized_) { // This read is guarded by the GIL.
+            // Multiple threads may enter here, because the GIL is released in the next line and
+            // CPython API calls in the `fn()` call below may release and reacquire the GIL.
+            gil_scoped_release gil_rel; // Needed to establish lock ordering.
+            std::call_once(once_flag_, [&] {
+                // Only one thread will ever enter here.
+                gil_scoped_acquire gil_acq;
+                ::new (storage_) T(fn()); // fn may release, but will reacquire, the GIL.
+                is_initialized_ = true;   // This write is guarded by the GIL.
+            });
+            // All threads will observe `is_initialized_` as true here.
+        }
+        // Intentionally not returning `T &` to ensure the calling code is self-documenting.
+        return *this;
+    }
+
+    // This must only be called after `call_once_and_store_result()` was called.
+    T &get_stored() {
+        assert(is_initialized_);
+        PYBIND11_WARNING_PUSH
+#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ < 5
+        // Needed for gcc 4.8.5
+        PYBIND11_WARNING_DISABLE_GCC("-Wstrict-aliasing")
+#endif
+        return *reinterpret_cast<T *>(storage_);
+        PYBIND11_WARNING_POP
+    }
+
+    constexpr gil_safe_call_once_and_store() = default;
+    PYBIND11_DTOR_CONSTEXPR ~gil_safe_call_once_and_store() = default;
+
+private:
+    alignas(T) char storage_[sizeof(T)] = {};
+    std::once_flag once_flag_ = {};
+    bool is_initialized_ = false;
+    // The `is_initialized_`-`storage_` pair is very similar to `std::optional`,
+    // but the latter does not have the triviality properties of former,
+    // therefore `std::optional` is not a viable alternative here.
+};
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/iostream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/iostream.h
new file mode 100644
index 0000000000..1878089e31
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/iostream.h
@@ -0,0 +1,265 @@
+/*
+    pybind11/iostream.h -- Tools to assist with redirecting cout and cerr to Python
+
+    Copyright (c) 2017 Henry F. Schreiner
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+
+    WARNING: The implementation in this file is NOT thread safe. Multiple
+    threads writing to a redirected ostream concurrently cause data races
+    and potentially buffer overflows. Therefore it is currently a requirement
+    that all (possibly) concurrent redirected ostream writes are protected by
+    a mutex.
+    #HelpAppreciated: Work on iostream.h thread safety.
+    For more background see the discussions under
+    https://github.com/pybind/pybind11/pull/2982 and
+    https://github.com/pybind/pybind11/pull/2995.
+*/
+
+#pragma once
+
+#include "pybind11.h"
+
+#include <algorithm>
+#include <cstring>
+#include <iostream>
+#include <iterator>
+#include <memory>
+#include <ostream>
+#include <streambuf>
+#include <string>
+#include <utility>
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+// Buffer that writes to Python instead of C++
+class pythonbuf : public std::streambuf {
+private:
+    using traits_type = std::streambuf::traits_type;
+
+    const size_t buf_size;
+    std::unique_ptr<char[]> d_buffer;
+    object pywrite;
+    object pyflush;
+
+    int overflow(int c) override {
+        if (!traits_type::eq_int_type(c, traits_type::eof())) {
+            *pptr() = traits_type::to_char_type(c);
+            pbump(1);
+        }
+        return sync() == 0 ? traits_type::not_eof(c) : traits_type::eof();
+    }
+
+    // Computes how many bytes at the end of the buffer are part of an
+    // incomplete sequence of UTF-8 bytes.
+    // Precondition: pbase() < pptr()
+    size_t utf8_remainder() const {
+        const auto rbase = std::reverse_iterator<char *>(pbase());
+        const auto rpptr = std::reverse_iterator<char *>(pptr());
+        auto is_ascii = [](char c) { return (static_cast<unsigned char>(c) & 0x80) == 0x00; };
+        auto is_leading = [](char c) { return (static_cast<unsigned char>(c) & 0xC0) == 0xC0; };
+        auto is_leading_2b = [](char c) { return static_cast<unsigned char>(c) <= 0xDF; };
+        auto is_leading_3b = [](char c) { return static_cast<unsigned char>(c) <= 0xEF; };
+        // If the last character is ASCII, there are no incomplete code points
+        if (is_ascii(*rpptr)) {
+            return 0;
+        }
+        // Otherwise, work back from the end of the buffer and find the first
+        // UTF-8 leading byte
+        const auto rpend = rbase - rpptr >= 3 ? rpptr + 3 : rbase;
+        const auto leading = std::find_if(rpptr, rpend, is_leading);
+        if (leading == rbase) {
+            return 0;
+        }
+        const auto dist = static_cast<size_t>(leading - rpptr);
+        size_t remainder = 0;
+
+        if (dist == 0) {
+            remainder = 1; // 1-byte code point is impossible
+        } else if (dist == 1) {
+            remainder = is_leading_2b(*leading) ? 0 : dist + 1;
+        } else if (dist == 2) {
+            remainder = is_leading_3b(*leading) ? 0 : dist + 1;
+        }
+        // else if (dist >= 3), at least 4 bytes before encountering an UTF-8
+        // leading byte, either no remainder or invalid UTF-8.
+        // Invalid UTF-8 will cause an exception later when converting
+        // to a Python string, so that's not handled here.
+        return remainder;
+    }
+
+    // This function must be non-virtual to be called in a destructor.
+    int _sync() {
+        if (pbase() != pptr()) { // If buffer is not empty
+            gil_scoped_acquire tmp;
+            // This subtraction cannot be negative, so dropping the sign.
+            auto size = static_cast<size_t>(pptr() - pbase());
+            size_t remainder = utf8_remainder();
+
+            if (size > remainder) {
+                str line(pbase(), size - remainder);
+                pywrite(std::move(line));
+                pyflush();
+            }
+
+            // Copy the remainder at the end of the buffer to the beginning:
+            if (remainder > 0) {
+                std::memmove(pbase(), pptr() - remainder, remainder);
+            }
+            setp(pbase(), epptr());
+            pbump(static_cast<int>(remainder));
+        }
+        return 0;
+    }
+
+    int sync() override { return _sync(); }
+
+public:
+    explicit pythonbuf(const object &pyostream, size_t buffer_size = 1024)
+        : buf_size(buffer_size), d_buffer(new char[buf_size]), pywrite(pyostream.attr("write")),
+          pyflush(pyostream.attr("flush")) {
+        setp(d_buffer.get(), d_buffer.get() + buf_size - 1);
+    }
+
+    pythonbuf(pythonbuf &&) = default;
+
+    /// Sync before destroy
+    ~pythonbuf() override { _sync(); }
+};
+
+PYBIND11_NAMESPACE_END(detail)
+
+/** \rst
+    This a move-only guard that redirects output.
+
+    .. code-block:: cpp
+
+        #include <pybind11/iostream.h>
+
+        ...
+
+        {
+            py::scoped_ostream_redirect output;
+            std::cout << "Hello, World!"; // Python stdout
+        } // <-- return std::cout to normal
+
+    You can explicitly pass the c++ stream and the python object,
+    for example to guard stderr instead.
+
+    .. code-block:: cpp
+
+        {
+            py::scoped_ostream_redirect output{
+                std::cerr, py::module::import("sys").attr("stderr")};
+            std::cout << "Hello, World!";
+        }
+ \endrst */
+class scoped_ostream_redirect {
+protected:
+    std::streambuf *old;
+    std::ostream &costream;
+    detail::pythonbuf buffer;
+
+public:
+    explicit scoped_ostream_redirect(std::ostream &costream = std::cout,
+                                     const object &pyostream
+                                     = module_::import("sys").attr("stdout"))
+        : costream(costream), buffer(pyostream) {
+        old = costream.rdbuf(&buffer);
+    }
+
+    ~scoped_ostream_redirect() { costream.rdbuf(old); }
+
+    scoped_ostream_redirect(const scoped_ostream_redirect &) = delete;
+    scoped_ostream_redirect(scoped_ostream_redirect &&other) = default;
+    scoped_ostream_redirect &operator=(const scoped_ostream_redirect &) = delete;
+    scoped_ostream_redirect &operator=(scoped_ostream_redirect &&) = delete;
+};
+
+/** \rst
+    Like `scoped_ostream_redirect`, but redirects cerr by default. This class
+    is provided primary to make ``py::call_guard`` easier to make.
+
+    .. code-block:: cpp
+
+     m.def("noisy_func", &noisy_func,
+           py::call_guard<scoped_ostream_redirect,
+                          scoped_estream_redirect>());
+
+\endrst */
+class scoped_estream_redirect : public scoped_ostream_redirect {
+public:
+    explicit scoped_estream_redirect(std::ostream &costream = std::cerr,
+                                     const object &pyostream
+                                     = module_::import("sys").attr("stderr"))
+        : scoped_ostream_redirect(costream, pyostream) {}
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+// Class to redirect output as a context manager. C++ backend.
+class OstreamRedirect {
+    bool do_stdout_;
+    bool do_stderr_;
+    std::unique_ptr<scoped_ostream_redirect> redirect_stdout;
+    std::unique_ptr<scoped_estream_redirect> redirect_stderr;
+
+public:
+    explicit OstreamRedirect(bool do_stdout = true, bool do_stderr = true)
+        : do_stdout_(do_stdout), do_stderr_(do_stderr) {}
+
+    void enter() {
+        if (do_stdout_) {
+            redirect_stdout.reset(new scoped_ostream_redirect());
+        }
+        if (do_stderr_) {
+            redirect_stderr.reset(new scoped_estream_redirect());
+        }
+    }
+
+    void exit() {
+        redirect_stdout.reset();
+        redirect_stderr.reset();
+    }
+};
+
+PYBIND11_NAMESPACE_END(detail)
+
+/** \rst
+    This is a helper function to add a C++ redirect context manager to Python
+    instead of using a C++ guard. To use it, add the following to your binding code:
+
+    .. code-block:: cpp
+
+        #include <pybind11/iostream.h>
+
+        ...
+
+        py::add_ostream_redirect(m, "ostream_redirect");
+
+    You now have a Python context manager that redirects your output:
+
+    .. code-block:: python
+
+        with m.ostream_redirect():
+            m.print_to_cout_function()
+
+    This manager can optionally be told which streams to operate on:
+
+    .. code-block:: python
+
+        with m.ostream_redirect(stdout=true, stderr=true):
+            m.noisy_function_with_error_printing()
+
+ \endrst */
+inline class_<detail::OstreamRedirect>
+add_ostream_redirect(module_ m, const std::string &name = "ostream_redirect") {
+    return class_<detail::OstreamRedirect>(std::move(m), name.c_str(), module_local())
+        .def(init<bool, bool>(), arg("stdout") = true, arg("stderr") = true)
+        .def("__enter__", &detail::OstreamRedirect::enter)
+        .def("__exit__", [](detail::OstreamRedirect &self_, const args &) { self_.exit(); });
+}
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/numpy.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/numpy.h
new file mode 100644
index 0000000000..05ef3918b1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/numpy.h
@@ -0,0 +1,2135 @@
+/*
+    pybind11/numpy.h: Basic NumPy support, vectorize() wrapper
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "pybind11.h"
+#include "detail/common.h"
+#include "complex.h"
+#include "gil_safe_call_once.h"
+#include "pytypes.h"
+
+#include <algorithm>
+#include <array>
+#include <cstdint>
+#include <cstdlib>
+#include <cstring>
+#include <functional>
+#include <numeric>
+#include <sstream>
+#include <string>
+#include <type_traits>
+#include <typeindex>
+#include <utility>
+#include <vector>
+
+#if defined(PYBIND11_NUMPY_1_ONLY) && !defined(PYBIND11_INTERNAL_NUMPY_1_ONLY_DETECTED)
+#    error PYBIND11_NUMPY_1_ONLY must be defined before any pybind11 header is included.
+#endif
+
+/* This will be true on all flat address space platforms and allows us to reduce the
+   whole npy_intp / ssize_t / Py_intptr_t business down to just ssize_t for all size
+   and dimension types (e.g. shape, strides, indexing), instead of inflicting this
+   upon the library user.
+   Note that NumPy 2 now uses ssize_t for `npy_intp` to simplify this. */
+static_assert(sizeof(::pybind11::ssize_t) == sizeof(Py_intptr_t), "ssize_t != Py_intptr_t");
+static_assert(std::is_signed<Py_intptr_t>::value, "Py_intptr_t must be signed");
+// We now can reinterpret_cast between py::ssize_t and Py_intptr_t (MSVC + PyPy cares)
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+PYBIND11_WARNING_DISABLE_MSVC(4127)
+
+class dtype; // Forward declaration
+class array; // Forward declaration
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <>
+struct handle_type_name<dtype> {
+    static constexpr auto name = const_name("numpy.dtype");
+};
+
+template <>
+struct handle_type_name<array> {
+    static constexpr auto name = const_name("numpy.ndarray");
+};
+
+template <typename type, typename SFINAE = void>
+struct npy_format_descriptor;
+
+/* NumPy 1 proxy (always includes legacy fields) */
+struct PyArrayDescr1_Proxy {
+    PyObject_HEAD
+    PyObject *typeobj;
+    char kind;
+    char type;
+    char byteorder;
+    char flags;
+    int type_num;
+    int elsize;
+    int alignment;
+    char *subarray;
+    PyObject *fields;
+    PyObject *names;
+};
+
+#ifndef PYBIND11_NUMPY_1_ONLY
+struct PyArrayDescr_Proxy {
+    PyObject_HEAD
+    PyObject *typeobj;
+    char kind;
+    char type;
+    char byteorder;
+    char _former_flags;
+    int type_num;
+    /* Additional fields are NumPy version specific. */
+};
+#else
+/* NumPy 1.x only, we can expose all fields */
+using PyArrayDescr_Proxy = PyArrayDescr1_Proxy;
+#endif
+
+/* NumPy 2 proxy, including legacy fields */
+struct PyArrayDescr2_Proxy {
+    PyObject_HEAD
+    PyObject *typeobj;
+    char kind;
+    char type;
+    char byteorder;
+    char _former_flags;
+    int type_num;
+    std::uint64_t flags;
+    ssize_t elsize;
+    ssize_t alignment;
+    PyObject *metadata;
+    Py_hash_t hash;
+    void *reserved_null[2];
+    /* The following fields only exist if 0 <= type_num < 2056 */
+    char *subarray;
+    PyObject *fields;
+    PyObject *names;
+};
+
+struct PyArray_Proxy {
+    PyObject_HEAD
+    char *data;
+    int nd;
+    ssize_t *dimensions;
+    ssize_t *strides;
+    PyObject *base;
+    PyObject *descr;
+    int flags;
+};
+
+struct PyVoidScalarObject_Proxy {
+    PyObject_VAR_HEAD char *obval;
+    PyArrayDescr_Proxy *descr;
+    int flags;
+    PyObject *base;
+};
+
+struct numpy_type_info {
+    PyObject *dtype_ptr;
+    std::string format_str;
+};
+
+struct numpy_internals {
+    std::unordered_map<std::type_index, numpy_type_info> registered_dtypes;
+
+    numpy_type_info *get_type_info(const std::type_info &tinfo, bool throw_if_missing = true) {
+        auto it = registered_dtypes.find(std::type_index(tinfo));
+        if (it != registered_dtypes.end()) {
+            return &(it->second);
+        }
+        if (throw_if_missing) {
+            pybind11_fail(std::string("NumPy type info missing for ") + tinfo.name());
+        }
+        return nullptr;
+    }
+
+    template <typename T>
+    numpy_type_info *get_type_info(bool throw_if_missing = true) {
+        return get_type_info(typeid(typename std::remove_cv<T>::type), throw_if_missing);
+    }
+};
+
+PYBIND11_NOINLINE void load_numpy_internals(numpy_internals *&ptr) {
+    ptr = &get_or_create_shared_data<numpy_internals>("_numpy_internals");
+}
+
+inline numpy_internals &get_numpy_internals() {
+    static numpy_internals *ptr = nullptr;
+    if (!ptr) {
+        load_numpy_internals(ptr);
+    }
+    return *ptr;
+}
+
+PYBIND11_NOINLINE module_ import_numpy_core_submodule(const char *submodule_name) {
+    module_ numpy = module_::import("numpy");
+    str version_string = numpy.attr("__version__");
+
+    module_ numpy_lib = module_::import("numpy.lib");
+    object numpy_version = numpy_lib.attr("NumpyVersion")(version_string);
+    int major_version = numpy_version.attr("major").cast<int>();
+
+#ifdef PYBIND11_NUMPY_1_ONLY
+    if (major_version >= 2) {
+        throw std::runtime_error(
+            "This extension was built with PYBIND11_NUMPY_1_ONLY defined, "
+            "but NumPy 2 is used in this process. For NumPy2 compatibility, "
+            "this extension needs to be rebuilt without the PYBIND11_NUMPY_1_ONLY define.");
+    }
+#endif
+    /* `numpy.core` was renamed to `numpy._core` in NumPy 2.0 as it officially
+        became a private module. */
+    std::string numpy_core_path = major_version >= 2 ? "numpy._core" : "numpy.core";
+    return module_::import((numpy_core_path + "." + submodule_name).c_str());
+}
+
+template <typename T>
+struct same_size {
+    template <typename U>
+    using as = bool_constant<sizeof(T) == sizeof(U)>;
+};
+
+template <typename Concrete>
+constexpr int platform_lookup() {
+    return -1;
+}
+
+// Lookup a type according to its size, and return a value corresponding to the NumPy typenum.
+template <typename Concrete, typename T, typename... Ts, typename... Ints>
+constexpr int platform_lookup(int I, Ints... Is) {
+    return sizeof(Concrete) == sizeof(T) ? I : platform_lookup<Concrete, Ts...>(Is...);
+}
+
+struct npy_api {
+    enum constants {
+        NPY_ARRAY_C_CONTIGUOUS_ = 0x0001,
+        NPY_ARRAY_F_CONTIGUOUS_ = 0x0002,
+        NPY_ARRAY_OWNDATA_ = 0x0004,
+        NPY_ARRAY_FORCECAST_ = 0x0010,
+        NPY_ARRAY_ENSUREARRAY_ = 0x0040,
+        NPY_ARRAY_ALIGNED_ = 0x0100,
+        NPY_ARRAY_WRITEABLE_ = 0x0400,
+        NPY_BOOL_ = 0,
+        NPY_BYTE_,
+        NPY_UBYTE_,
+        NPY_SHORT_,
+        NPY_USHORT_,
+        NPY_INT_,
+        NPY_UINT_,
+        NPY_LONG_,
+        NPY_ULONG_,
+        NPY_LONGLONG_,
+        NPY_ULONGLONG_,
+        NPY_FLOAT_,
+        NPY_DOUBLE_,
+        NPY_LONGDOUBLE_,
+        NPY_CFLOAT_,
+        NPY_CDOUBLE_,
+        NPY_CLONGDOUBLE_,
+        NPY_OBJECT_ = 17,
+        NPY_STRING_,
+        NPY_UNICODE_,
+        NPY_VOID_,
+        // Platform-dependent normalization
+        NPY_INT8_ = NPY_BYTE_,
+        NPY_UINT8_ = NPY_UBYTE_,
+        NPY_INT16_ = NPY_SHORT_,
+        NPY_UINT16_ = NPY_USHORT_,
+        // `npy_common.h` defines the integer aliases. In order, it checks:
+        // NPY_BITSOF_LONG, NPY_BITSOF_LONGLONG, NPY_BITSOF_INT, NPY_BITSOF_SHORT, NPY_BITSOF_CHAR
+        // and assigns the alias to the first matching size, so we should check in this order.
+        NPY_INT32_
+        = platform_lookup<std::int32_t, long, int, short>(NPY_LONG_, NPY_INT_, NPY_SHORT_),
+        NPY_UINT32_ = platform_lookup<std::uint32_t, unsigned long, unsigned int, unsigned short>(
+            NPY_ULONG_, NPY_UINT_, NPY_USHORT_),
+        NPY_INT64_
+        = platform_lookup<std::int64_t, long, long long, int>(NPY_LONG_, NPY_LONGLONG_, NPY_INT_),
+        NPY_UINT64_
+        = platform_lookup<std::uint64_t, unsigned long, unsigned long long, unsigned int>(
+            NPY_ULONG_, NPY_ULONGLONG_, NPY_UINT_),
+    };
+
+    unsigned int PyArray_RUNTIME_VERSION_;
+
+    struct PyArray_Dims {
+        Py_intptr_t *ptr;
+        int len;
+    };
+
+    static npy_api &get() {
+        PYBIND11_CONSTINIT static gil_safe_call_once_and_store<npy_api> storage;
+        return storage.call_once_and_store_result(lookup).get_stored();
+    }
+
+    bool PyArray_Check_(PyObject *obj) const {
+        return PyObject_TypeCheck(obj, PyArray_Type_) != 0;
+    }
+    bool PyArrayDescr_Check_(PyObject *obj) const {
+        return PyObject_TypeCheck(obj, PyArrayDescr_Type_) != 0;
+    }
+
+    unsigned int (*PyArray_GetNDArrayCFeatureVersion_)();
+    PyObject *(*PyArray_DescrFromType_)(int);
+    PyObject *(*PyArray_NewFromDescr_)(PyTypeObject *,
+                                       PyObject *,
+                                       int,
+                                       Py_intptr_t const *,
+                                       Py_intptr_t const *,
+                                       void *,
+                                       int,
+                                       PyObject *);
+    // Unused. Not removed because that affects ABI of the class.
+    PyObject *(*PyArray_DescrNewFromType_)(int);
+    int (*PyArray_CopyInto_)(PyObject *, PyObject *);
+    PyObject *(*PyArray_NewCopy_)(PyObject *, int);
+    PyTypeObject *PyArray_Type_;
+    PyTypeObject *PyVoidArrType_Type_;
+    PyTypeObject *PyArrayDescr_Type_;
+    PyObject *(*PyArray_DescrFromScalar_)(PyObject *);
+    PyObject *(*PyArray_FromAny_)(PyObject *, PyObject *, int, int, int, PyObject *);
+    int (*PyArray_DescrConverter_)(PyObject *, PyObject **);
+    bool (*PyArray_EquivTypes_)(PyObject *, PyObject *);
+#ifdef PYBIND11_NUMPY_1_ONLY
+    int (*PyArray_GetArrayParamsFromObject_)(PyObject *,
+                                             PyObject *,
+                                             unsigned char,
+                                             PyObject **,
+                                             int *,
+                                             Py_intptr_t *,
+                                             PyObject **,
+                                             PyObject *);
+#endif
+    PyObject *(*PyArray_Squeeze_)(PyObject *);
+    // Unused. Not removed because that affects ABI of the class.
+    int (*PyArray_SetBaseObject_)(PyObject *, PyObject *);
+    PyObject *(*PyArray_Resize_)(PyObject *, PyArray_Dims *, int, int);
+    PyObject *(*PyArray_Newshape_)(PyObject *, PyArray_Dims *, int);
+    PyObject *(*PyArray_View_)(PyObject *, PyObject *, PyObject *);
+
+private:
+    enum functions {
+        API_PyArray_GetNDArrayCFeatureVersion = 211,
+        API_PyArray_Type = 2,
+        API_PyArrayDescr_Type = 3,
+        API_PyVoidArrType_Type = 39,
+        API_PyArray_DescrFromType = 45,
+        API_PyArray_DescrFromScalar = 57,
+        API_PyArray_FromAny = 69,
+        API_PyArray_Resize = 80,
+        // CopyInto was slot 82 and 50 was effectively an alias. NumPy 2 removed 82.
+        API_PyArray_CopyInto = 50,
+        API_PyArray_NewCopy = 85,
+        API_PyArray_NewFromDescr = 94,
+        API_PyArray_DescrNewFromType = 96,
+        API_PyArray_Newshape = 135,
+        API_PyArray_Squeeze = 136,
+        API_PyArray_View = 137,
+        API_PyArray_DescrConverter = 174,
+        API_PyArray_EquivTypes = 182,
+#ifdef PYBIND11_NUMPY_1_ONLY
+        API_PyArray_GetArrayParamsFromObject = 278,
+#endif
+        API_PyArray_SetBaseObject = 282
+    };
+
+    static npy_api lookup() {
+        module_ m = detail::import_numpy_core_submodule("multiarray");
+        auto c = m.attr("_ARRAY_API");
+        void **api_ptr = (void **) PyCapsule_GetPointer(c.ptr(), nullptr);
+        if (api_ptr == nullptr) {
+            raise_from(PyExc_SystemError, "FAILURE obtaining numpy _ARRAY_API pointer.");
+            throw error_already_set();
+        }
+        npy_api api;
+#define DECL_NPY_API(Func) api.Func##_ = (decltype(api.Func##_)) api_ptr[API_##Func];
+        DECL_NPY_API(PyArray_GetNDArrayCFeatureVersion);
+        api.PyArray_RUNTIME_VERSION_ = api.PyArray_GetNDArrayCFeatureVersion_();
+        if (api.PyArray_RUNTIME_VERSION_ < 0x7) {
+            pybind11_fail("pybind11 numpy support requires numpy >= 1.7.0");
+        }
+        DECL_NPY_API(PyArray_Type);
+        DECL_NPY_API(PyVoidArrType_Type);
+        DECL_NPY_API(PyArrayDescr_Type);
+        DECL_NPY_API(PyArray_DescrFromType);
+        DECL_NPY_API(PyArray_DescrFromScalar);
+        DECL_NPY_API(PyArray_FromAny);
+        DECL_NPY_API(PyArray_Resize);
+        DECL_NPY_API(PyArray_CopyInto);
+        DECL_NPY_API(PyArray_NewCopy);
+        DECL_NPY_API(PyArray_NewFromDescr);
+        DECL_NPY_API(PyArray_DescrNewFromType);
+        DECL_NPY_API(PyArray_Newshape);
+        DECL_NPY_API(PyArray_Squeeze);
+        DECL_NPY_API(PyArray_View);
+        DECL_NPY_API(PyArray_DescrConverter);
+        DECL_NPY_API(PyArray_EquivTypes);
+#ifdef PYBIND11_NUMPY_1_ONLY
+        DECL_NPY_API(PyArray_GetArrayParamsFromObject);
+#endif
+        DECL_NPY_API(PyArray_SetBaseObject);
+
+#undef DECL_NPY_API
+        return api;
+    }
+};
+
+inline PyArray_Proxy *array_proxy(void *ptr) { return reinterpret_cast<PyArray_Proxy *>(ptr); }
+
+inline const PyArray_Proxy *array_proxy(const void *ptr) {
+    return reinterpret_cast<const PyArray_Proxy *>(ptr);
+}
+
+inline PyArrayDescr_Proxy *array_descriptor_proxy(PyObject *ptr) {
+    return reinterpret_cast<PyArrayDescr_Proxy *>(ptr);
+}
+
+inline const PyArrayDescr_Proxy *array_descriptor_proxy(const PyObject *ptr) {
+    return reinterpret_cast<const PyArrayDescr_Proxy *>(ptr);
+}
+
+inline const PyArrayDescr1_Proxy *array_descriptor1_proxy(const PyObject *ptr) {
+    return reinterpret_cast<const PyArrayDescr1_Proxy *>(ptr);
+}
+
+inline const PyArrayDescr2_Proxy *array_descriptor2_proxy(const PyObject *ptr) {
+    return reinterpret_cast<const PyArrayDescr2_Proxy *>(ptr);
+}
+
+inline bool check_flags(const void *ptr, int flag) {
+    return (flag == (array_proxy(ptr)->flags & flag));
+}
+
+template <typename T>
+struct is_std_array : std::false_type {};
+template <typename T, size_t N>
+struct is_std_array<std::array<T, N>> : std::true_type {};
+template <typename T>
+struct is_complex : std::false_type {};
+template <typename T>
+struct is_complex<std::complex<T>> : std::true_type {};
+
+template <typename T>
+struct array_info_scalar {
+    using type = T;
+    static constexpr bool is_array = false;
+    static constexpr bool is_empty = false;
+    static constexpr auto extents = const_name("");
+    static void append_extents(list & /* shape */) {}
+};
+// Computes underlying type and a comma-separated list of extents for array
+// types (any mix of std::array and built-in arrays). An array of char is
+// treated as scalar because it gets special handling.
+template <typename T>
+struct array_info : array_info_scalar<T> {};
+template <typename T, size_t N>
+struct array_info<std::array<T, N>> {
+    using type = typename array_info<T>::type;
+    static constexpr bool is_array = true;
+    static constexpr bool is_empty = (N == 0) || array_info<T>::is_empty;
+    static constexpr size_t extent = N;
+
+    // appends the extents to shape
+    static void append_extents(list &shape) {
+        shape.append(N);
+        array_info<T>::append_extents(shape);
+    }
+
+    static constexpr auto extents = const_name<array_info<T>::is_array>(
+        ::pybind11::detail::concat(const_name<N>(), array_info<T>::extents), const_name<N>());
+};
+// For numpy we have special handling for arrays of characters, so we don't include
+// the size in the array extents.
+template <size_t N>
+struct array_info<char[N]> : array_info_scalar<char[N]> {};
+template <size_t N>
+struct array_info<std::array<char, N>> : array_info_scalar<std::array<char, N>> {};
+template <typename T, size_t N>
+struct array_info<T[N]> : array_info<std::array<T, N>> {};
+template <typename T>
+using remove_all_extents_t = typename array_info<T>::type;
+
+template <typename T>
+using is_pod_struct
+    = all_of<std::is_standard_layout<T>, // since we're accessing directly in memory
+                                         // we need a standard layout type
+#if defined(__GLIBCXX__)                                                                          \
+    && (__GLIBCXX__ < 20150422 || __GLIBCXX__ == 20150426 || __GLIBCXX__ == 20150623              \
+        || __GLIBCXX__ == 20150626 || __GLIBCXX__ == 20160803)
+             // libstdc++ < 5 (including versions 4.8.5, 4.9.3 and 4.9.4 which were released after
+             // 5) don't implement is_trivially_copyable, so approximate it
+             std::is_trivially_destructible<T>,
+             satisfies_any_of<T, std::has_trivial_copy_constructor, std::has_trivial_copy_assign>,
+#else
+             std::is_trivially_copyable<T>,
+#endif
+             satisfies_none_of<T,
+                               std::is_reference,
+                               std::is_array,
+                               is_std_array,
+                               std::is_arithmetic,
+                               is_complex,
+                               std::is_enum>>;
+
+// Replacement for std::is_pod (deprecated in C++20)
+template <typename T>
+using is_pod = all_of<std::is_standard_layout<T>, std::is_trivial<T>>;
+
+template <ssize_t Dim = 0, typename Strides>
+ssize_t byte_offset_unsafe(const Strides &) {
+    return 0;
+}
+template <ssize_t Dim = 0, typename Strides, typename... Ix>
+ssize_t byte_offset_unsafe(const Strides &strides, ssize_t i, Ix... index) {
+    return i * strides[Dim] + byte_offset_unsafe<Dim + 1>(strides, index...);
+}
+
+/**
+ * Proxy class providing unsafe, unchecked const access to array data.  This is constructed through
+ * the `unchecked<T, N>()` method of `array` or the `unchecked<N>()` method of `array_t<T>`. `Dims`
+ * will be -1 for dimensions determined at runtime.
+ */
+template <typename T, ssize_t Dims>
+class unchecked_reference {
+protected:
+    static constexpr bool Dynamic = Dims < 0;
+    const unsigned char *data_;
+    // Storing the shape & strides in local variables (i.e. these arrays) allows the compiler to
+    // make large performance gains on big, nested loops, but requires compile-time dimensions
+    conditional_t<Dynamic, const ssize_t *, std::array<ssize_t, (size_t) Dims>> shape_, strides_;
+    const ssize_t dims_;
+
+    friend class pybind11::array;
+    // Constructor for compile-time dimensions:
+    template <bool Dyn = Dynamic>
+    unchecked_reference(const void *data,
+                        const ssize_t *shape,
+                        const ssize_t *strides,
+                        enable_if_t<!Dyn, ssize_t>)
+        : data_{reinterpret_cast<const unsigned char *>(data)}, dims_{Dims} {
+        for (size_t i = 0; i < (size_t) dims_; i++) {
+            shape_[i] = shape[i];
+            strides_[i] = strides[i];
+        }
+    }
+    // Constructor for runtime dimensions:
+    template <bool Dyn = Dynamic>
+    unchecked_reference(const void *data,
+                        const ssize_t *shape,
+                        const ssize_t *strides,
+                        enable_if_t<Dyn, ssize_t> dims)
+        : data_{reinterpret_cast<const unsigned char *>(data)}, shape_{shape}, strides_{strides},
+          dims_{dims} {}
+
+public:
+    /**
+     * Unchecked const reference access to data at the given indices.  For a compile-time known
+     * number of dimensions, this requires the correct number of arguments; for run-time
+     * dimensionality, this is not checked (and so is up to the caller to use safely).
+     */
+    template <typename... Ix>
+    const T &operator()(Ix... index) const {
+        static_assert(ssize_t{sizeof...(Ix)} == Dims || Dynamic,
+                      "Invalid number of indices for unchecked array reference");
+        return *reinterpret_cast<const T *>(data_
+                                            + byte_offset_unsafe(strides_, ssize_t(index)...));
+    }
+    /**
+     * Unchecked const reference access to data; this operator only participates if the reference
+     * is to a 1-dimensional array.  When present, this is exactly equivalent to `obj(index)`.
+     */
+    template <ssize_t D = Dims, typename = enable_if_t<D == 1 || Dynamic>>
+    const T &operator[](ssize_t index) const {
+        return operator()(index);
+    }
+
+    /// Pointer access to the data at the given indices.
+    template <typename... Ix>
+    const T *data(Ix... ix) const {
+        return &operator()(ssize_t(ix)...);
+    }
+
+    /// Returns the item size, i.e. sizeof(T)
+    constexpr static ssize_t itemsize() { return sizeof(T); }
+
+    /// Returns the shape (i.e. size) of dimension `dim`
+    ssize_t shape(ssize_t dim) const { return shape_[(size_t) dim]; }
+
+    /// Returns the number of dimensions of the array
+    ssize_t ndim() const { return dims_; }
+
+    /// Returns the total number of elements in the referenced array, i.e. the product of the
+    /// shapes
+    template <bool Dyn = Dynamic>
+    enable_if_t<!Dyn, ssize_t> size() const {
+        return std::accumulate(
+            shape_.begin(), shape_.end(), (ssize_t) 1, std::multiplies<ssize_t>());
+    }
+    template <bool Dyn = Dynamic>
+    enable_if_t<Dyn, ssize_t> size() const {
+        return std::accumulate(shape_, shape_ + ndim(), (ssize_t) 1, std::multiplies<ssize_t>());
+    }
+
+    /// Returns the total number of bytes used by the referenced data.  Note that the actual span
+    /// in memory may be larger if the referenced array has non-contiguous strides (e.g. for a
+    /// slice).
+    ssize_t nbytes() const { return size() * itemsize(); }
+};
+
+template <typename T, ssize_t Dims>
+class unchecked_mutable_reference : public unchecked_reference<T, Dims> {
+    friend class pybind11::array;
+    using ConstBase = unchecked_reference<T, Dims>;
+    using ConstBase::ConstBase;
+    using ConstBase::Dynamic;
+
+public:
+    // Bring in const-qualified versions from base class
+    using ConstBase::operator();
+    using ConstBase::operator[];
+
+    /// Mutable, unchecked access to data at the given indices.
+    template <typename... Ix>
+    T &operator()(Ix... index) {
+        static_assert(ssize_t{sizeof...(Ix)} == Dims || Dynamic,
+                      "Invalid number of indices for unchecked array reference");
+        return const_cast<T &>(ConstBase::operator()(index...));
+    }
+    /**
+     * Mutable, unchecked access data at the given index; this operator only participates if the
+     * reference is to a 1-dimensional array (or has runtime dimensions).  When present, this is
+     * exactly equivalent to `obj(index)`.
+     */
+    template <ssize_t D = Dims, typename = enable_if_t<D == 1 || Dynamic>>
+    T &operator[](ssize_t index) {
+        return operator()(index);
+    }
+
+    /// Mutable pointer access to the data at the given indices.
+    template <typename... Ix>
+    T *mutable_data(Ix... ix) {
+        return &operator()(ssize_t(ix)...);
+    }
+};
+
+template <typename T, ssize_t Dim>
+struct type_caster<unchecked_reference<T, Dim>> {
+    static_assert(Dim == 0 && Dim > 0 /* always fail */,
+                  "unchecked array proxy object is not castable");
+};
+template <typename T, ssize_t Dim>
+struct type_caster<unchecked_mutable_reference<T, Dim>>
+    : type_caster<unchecked_reference<T, Dim>> {};
+
+PYBIND11_NAMESPACE_END(detail)
+
+class dtype : public object {
+public:
+    PYBIND11_OBJECT_DEFAULT(dtype, object, detail::npy_api::get().PyArrayDescr_Check_)
+
+    explicit dtype(const buffer_info &info) {
+        dtype descr(_dtype_from_pep3118()(pybind11::str(info.format)));
+        // If info.itemsize == 0, use the value calculated from the format string
+        m_ptr = descr.strip_padding(info.itemsize != 0 ? info.itemsize : descr.itemsize())
+                    .release()
+                    .ptr();
+    }
+
+    explicit dtype(const pybind11::str &format) : dtype(from_args(format)) {}
+
+    explicit dtype(const std::string &format) : dtype(pybind11::str(format)) {}
+
+    explicit dtype(const char *format) : dtype(pybind11::str(format)) {}
+
+    dtype(list names, list formats, list offsets, ssize_t itemsize) {
+        dict args;
+        args["names"] = std::move(names);
+        args["formats"] = std::move(formats);
+        args["offsets"] = std::move(offsets);
+        args["itemsize"] = pybind11::int_(itemsize);
+        m_ptr = from_args(args).release().ptr();
+    }
+
+    /// Return dtype for the given typenum (one of the NPY_TYPES).
+    /// https://numpy.org/devdocs/reference/c-api/array.html#c.PyArray_DescrFromType
+    explicit dtype(int typenum)
+        : object(detail::npy_api::get().PyArray_DescrFromType_(typenum), stolen_t{}) {
+        if (m_ptr == nullptr) {
+            throw error_already_set();
+        }
+    }
+
+    /// This is essentially the same as calling numpy.dtype(args) in Python.
+    static dtype from_args(const object &args) {
+        PyObject *ptr = nullptr;
+        if ((detail::npy_api::get().PyArray_DescrConverter_(args.ptr(), &ptr) == 0) || !ptr) {
+            throw error_already_set();
+        }
+        return reinterpret_steal<dtype>(ptr);
+    }
+
+    /// Return dtype associated with a C++ type.
+    template <typename T>
+    static dtype of() {
+        return detail::npy_format_descriptor<typename std::remove_cv<T>::type>::dtype();
+    }
+
+    /// Size of the data type in bytes.
+#ifdef PYBIND11_NUMPY_1_ONLY
+    ssize_t itemsize() const { return detail::array_descriptor_proxy(m_ptr)->elsize; }
+#else
+    ssize_t itemsize() const {
+        if (detail::npy_api::get().PyArray_RUNTIME_VERSION_ < 0x12) {
+            return detail::array_descriptor1_proxy(m_ptr)->elsize;
+        }
+        return detail::array_descriptor2_proxy(m_ptr)->elsize;
+    }
+#endif
+
+    /// Returns true for structured data types.
+#ifdef PYBIND11_NUMPY_1_ONLY
+    bool has_fields() const { return detail::array_descriptor_proxy(m_ptr)->names != nullptr; }
+#else
+    bool has_fields() const {
+        if (detail::npy_api::get().PyArray_RUNTIME_VERSION_ < 0x12) {
+            return detail::array_descriptor1_proxy(m_ptr)->names != nullptr;
+        }
+        const auto *proxy = detail::array_descriptor2_proxy(m_ptr);
+        if (proxy->type_num < 0 || proxy->type_num >= 2056) {
+            return false;
+        }
+        return proxy->names != nullptr;
+    }
+#endif
+
+    /// Single-character code for dtype's kind.
+    /// For example, floating point types are 'f' and integral types are 'i'.
+    char kind() const { return detail::array_descriptor_proxy(m_ptr)->kind; }
+
+    /// Single-character for dtype's type.
+    /// For example, ``float`` is 'f', ``double`` 'd', ``int`` 'i', and ``long`` 'l'.
+    char char_() const {
+        // Note: The signature, `dtype::char_` follows the naming of NumPy's
+        // public Python API (i.e., ``dtype.char``), rather than its internal
+        // C API (``PyArray_Descr::type``).
+        return detail::array_descriptor_proxy(m_ptr)->type;
+    }
+
+    /// type number of dtype.
+    int num() const {
+        // Note: The signature, `dtype::num` follows the naming of NumPy's public
+        // Python API (i.e., ``dtype.num``), rather than its internal
+        // C API (``PyArray_Descr::type_num``).
+        return detail::array_descriptor_proxy(m_ptr)->type_num;
+    }
+
+    /// Single character for byteorder
+    char byteorder() const { return detail::array_descriptor_proxy(m_ptr)->byteorder; }
+
+/// Alignment of the data type
+#ifdef PYBIND11_NUMPY_1_ONLY
+    int alignment() const { return detail::array_descriptor_proxy(m_ptr)->alignment; }
+#else
+    ssize_t alignment() const {
+        if (detail::npy_api::get().PyArray_RUNTIME_VERSION_ < 0x12) {
+            return detail::array_descriptor1_proxy(m_ptr)->alignment;
+        }
+        return detail::array_descriptor2_proxy(m_ptr)->alignment;
+    }
+#endif
+
+/// Flags for the array descriptor
+#ifdef PYBIND11_NUMPY_1_ONLY
+    char flags() const { return detail::array_descriptor_proxy(m_ptr)->flags; }
+#else
+    std::uint64_t flags() const {
+        if (detail::npy_api::get().PyArray_RUNTIME_VERSION_ < 0x12) {
+            return (unsigned char) detail::array_descriptor1_proxy(m_ptr)->flags;
+        }
+        return detail::array_descriptor2_proxy(m_ptr)->flags;
+    }
+#endif
+
+private:
+    static object &_dtype_from_pep3118() {
+        PYBIND11_CONSTINIT static gil_safe_call_once_and_store<object> storage;
+        return storage
+            .call_once_and_store_result([]() {
+                return detail::import_numpy_core_submodule("_internal")
+                    .attr("_dtype_from_pep3118");
+            })
+            .get_stored();
+    }
+
+    dtype strip_padding(ssize_t itemsize) {
+        // Recursively strip all void fields with empty names that are generated for
+        // padding fields (as of NumPy v1.11).
+        if (!has_fields()) {
+            return *this;
+        }
+
+        struct field_descr {
+            pybind11::str name;
+            object format;
+            pybind11::int_ offset;
+            field_descr(pybind11::str &&name, object &&format, pybind11::int_ &&offset)
+                : name{std::move(name)}, format{std::move(format)}, offset{std::move(offset)} {};
+        };
+        auto field_dict = attr("fields").cast<dict>();
+        std::vector<field_descr> field_descriptors;
+        field_descriptors.reserve(field_dict.size());
+
+        for (auto field : field_dict.attr("items")()) {
+            auto spec = field.cast<tuple>();
+            auto name = spec[0].cast<pybind11::str>();
+            auto spec_fo = spec[1].cast<tuple>();
+            auto format = spec_fo[0].cast<dtype>();
+            auto offset = spec_fo[1].cast<pybind11::int_>();
+            if ((len(name) == 0u) && format.kind() == 'V') {
+                continue;
+            }
+            field_descriptors.emplace_back(
+                std::move(name), format.strip_padding(format.itemsize()), std::move(offset));
+        }
+
+        std::sort(field_descriptors.begin(),
+                  field_descriptors.end(),
+                  [](const field_descr &a, const field_descr &b) {
+                      return a.offset.cast<int>() < b.offset.cast<int>();
+                  });
+
+        list names, formats, offsets;
+        for (auto &descr : field_descriptors) {
+            names.append(std::move(descr.name));
+            formats.append(std::move(descr.format));
+            offsets.append(std::move(descr.offset));
+        }
+        return dtype(std::move(names), std::move(formats), std::move(offsets), itemsize);
+    }
+};
+
+class array : public buffer {
+public:
+    PYBIND11_OBJECT_CVT(array, buffer, detail::npy_api::get().PyArray_Check_, raw_array)
+
+    enum {
+        c_style = detail::npy_api::NPY_ARRAY_C_CONTIGUOUS_,
+        f_style = detail::npy_api::NPY_ARRAY_F_CONTIGUOUS_,
+        forcecast = detail::npy_api::NPY_ARRAY_FORCECAST_
+    };
+
+    array() : array(0, static_cast<const double *>(nullptr)) {}
+
+    using ShapeContainer = detail::any_container<ssize_t>;
+    using StridesContainer = detail::any_container<ssize_t>;
+
+    // Constructs an array taking shape/strides from arbitrary container types
+    array(const pybind11::dtype &dt,
+          ShapeContainer shape,
+          StridesContainer strides,
+          const void *ptr = nullptr,
+          handle base = handle()) {
+
+        if (strides->empty()) {
+            *strides = detail::c_strides(*shape, dt.itemsize());
+        }
+
+        auto ndim = shape->size();
+        if (ndim != strides->size()) {
+            pybind11_fail("NumPy: shape ndim doesn't match strides ndim");
+        }
+        auto descr = dt;
+
+        int flags = 0;
+        if (base && ptr) {
+            if (isinstance<array>(base)) {
+                /* Copy flags from base (except ownership bit) */
+                flags = reinterpret_borrow<array>(base).flags()
+                        & ~detail::npy_api::NPY_ARRAY_OWNDATA_;
+            } else {
+                /* Writable by default, easy to downgrade later on if needed */
+                flags = detail::npy_api::NPY_ARRAY_WRITEABLE_;
+            }
+        }
+
+        auto &api = detail::npy_api::get();
+        auto tmp = reinterpret_steal<object>(api.PyArray_NewFromDescr_(
+            api.PyArray_Type_,
+            descr.release().ptr(),
+            (int) ndim,
+            // Use reinterpret_cast for PyPy on Windows (remove if fixed, checked on 7.3.1)
+            reinterpret_cast<Py_intptr_t *>(shape->data()),
+            reinterpret_cast<Py_intptr_t *>(strides->data()),
+            const_cast<void *>(ptr),
+            flags,
+            nullptr));
+        if (!tmp) {
+            throw error_already_set();
+        }
+        if (ptr) {
+            if (base) {
+                api.PyArray_SetBaseObject_(tmp.ptr(), base.inc_ref().ptr());
+            } else {
+                tmp = reinterpret_steal<object>(
+                    api.PyArray_NewCopy_(tmp.ptr(), -1 /* any order */));
+            }
+        }
+        m_ptr = tmp.release().ptr();
+    }
+
+    array(const pybind11::dtype &dt,
+          ShapeContainer shape,
+          const void *ptr = nullptr,
+          handle base = handle())
+        : array(dt, std::move(shape), {}, ptr, base) {}
+
+    template <typename T,
+              typename
+              = detail::enable_if_t<std::is_integral<T>::value && !std::is_same<bool, T>::value>>
+    array(const pybind11::dtype &dt, T count, const void *ptr = nullptr, handle base = handle())
+        : array(dt, {{count}}, ptr, base) {}
+
+    template <typename T>
+    array(ShapeContainer shape, StridesContainer strides, const T *ptr, handle base = handle())
+        : array(pybind11::dtype::of<T>(), std::move(shape), std::move(strides), ptr, base) {}
+
+    template <typename T>
+    array(ShapeContainer shape, const T *ptr, handle base = handle())
+        : array(std::move(shape), {}, ptr, base) {}
+
+    template <typename T>
+    explicit array(ssize_t count, const T *ptr, handle base = handle())
+        : array({count}, {}, ptr, base) {}
+
+    explicit array(const buffer_info &info, handle base = handle())
+        : array(pybind11::dtype(info), info.shape, info.strides, info.ptr, base) {}
+
+    /// Array descriptor (dtype)
+    pybind11::dtype dtype() const {
+        return reinterpret_borrow<pybind11::dtype>(detail::array_proxy(m_ptr)->descr);
+    }
+
+    /// Total number of elements
+    ssize_t size() const {
+        return std::accumulate(shape(), shape() + ndim(), (ssize_t) 1, std::multiplies<ssize_t>());
+    }
+
+    /// Byte size of a single element
+    ssize_t itemsize() const { return dtype().itemsize(); }
+
+    /// Total number of bytes
+    ssize_t nbytes() const { return size() * itemsize(); }
+
+    /// Number of dimensions
+    ssize_t ndim() const { return detail::array_proxy(m_ptr)->nd; }
+
+    /// Base object
+    object base() const { return reinterpret_borrow<object>(detail::array_proxy(m_ptr)->base); }
+
+    /// Dimensions of the array
+    const ssize_t *shape() const { return detail::array_proxy(m_ptr)->dimensions; }
+
+    /// Dimension along a given axis
+    ssize_t shape(ssize_t dim) const {
+        if (dim >= ndim()) {
+            fail_dim_check(dim, "invalid axis");
+        }
+        return shape()[dim];
+    }
+
+    /// Strides of the array
+    const ssize_t *strides() const { return detail::array_proxy(m_ptr)->strides; }
+
+    /// Stride along a given axis
+    ssize_t strides(ssize_t dim) const {
+        if (dim >= ndim()) {
+            fail_dim_check(dim, "invalid axis");
+        }
+        return strides()[dim];
+    }
+
+    /// Return the NumPy array flags
+    int flags() const { return detail::array_proxy(m_ptr)->flags; }
+
+    /// If set, the array is writeable (otherwise the buffer is read-only)
+    bool writeable() const {
+        return detail::check_flags(m_ptr, detail::npy_api::NPY_ARRAY_WRITEABLE_);
+    }
+
+    /// If set, the array owns the data (will be freed when the array is deleted)
+    bool owndata() const {
+        return detail::check_flags(m_ptr, detail::npy_api::NPY_ARRAY_OWNDATA_);
+    }
+
+    /// Pointer to the contained data. If index is not provided, points to the
+    /// beginning of the buffer. May throw if the index would lead to out of bounds access.
+    template <typename... Ix>
+    const void *data(Ix... index) const {
+        return static_cast<const void *>(detail::array_proxy(m_ptr)->data + offset_at(index...));
+    }
+
+    /// Mutable pointer to the contained data. If index is not provided, points to the
+    /// beginning of the buffer. May throw if the index would lead to out of bounds access.
+    /// May throw if the array is not writeable.
+    template <typename... Ix>
+    void *mutable_data(Ix... index) {
+        check_writeable();
+        return static_cast<void *>(detail::array_proxy(m_ptr)->data + offset_at(index...));
+    }
+
+    /// Byte offset from beginning of the array to a given index (full or partial).
+    /// May throw if the index would lead to out of bounds access.
+    template <typename... Ix>
+    ssize_t offset_at(Ix... index) const {
+        if ((ssize_t) sizeof...(index) > ndim()) {
+            fail_dim_check(sizeof...(index), "too many indices for an array");
+        }
+        return byte_offset(ssize_t(index)...);
+    }
+
+    ssize_t offset_at() const { return 0; }
+
+    /// Item count from beginning of the array to a given index (full or partial).
+    /// May throw if the index would lead to out of bounds access.
+    template <typename... Ix>
+    ssize_t index_at(Ix... index) const {
+        return offset_at(index...) / itemsize();
+    }
+
+    /**
+     * Returns a proxy object that provides access to the array's data without bounds or
+     * dimensionality checking.  Will throw if the array is missing the `writeable` flag.  Use with
+     * care: the array must not be destroyed or reshaped for the duration of the returned object,
+     * and the caller must take care not to access invalid dimensions or dimension indices.
+     */
+    template <typename T, ssize_t Dims = -1>
+    detail::unchecked_mutable_reference<T, Dims> mutable_unchecked() & {
+        if (Dims >= 0 && ndim() != Dims) {
+            throw std::domain_error("array has incorrect number of dimensions: "
+                                    + std::to_string(ndim()) + "; expected "
+                                    + std::to_string(Dims));
+        }
+        return detail::unchecked_mutable_reference<T, Dims>(
+            mutable_data(), shape(), strides(), ndim());
+    }
+
+    /**
+     * Returns a proxy object that provides const access to the array's data without bounds or
+     * dimensionality checking.  Unlike `mutable_unchecked()`, this does not require that the
+     * underlying array have the `writable` flag.  Use with care: the array must not be destroyed
+     * or reshaped for the duration of the returned object, and the caller must take care not to
+     * access invalid dimensions or dimension indices.
+     */
+    template <typename T, ssize_t Dims = -1>
+    detail::unchecked_reference<T, Dims> unchecked() const & {
+        if (Dims >= 0 && ndim() != Dims) {
+            throw std::domain_error("array has incorrect number of dimensions: "
+                                    + std::to_string(ndim()) + "; expected "
+                                    + std::to_string(Dims));
+        }
+        return detail::unchecked_reference<T, Dims>(data(), shape(), strides(), ndim());
+    }
+
+    /// Return a new view with all of the dimensions of length 1 removed
+    array squeeze() {
+        auto &api = detail::npy_api::get();
+        return reinterpret_steal<array>(api.PyArray_Squeeze_(m_ptr));
+    }
+
+    /// Resize array to given shape
+    /// If refcheck is true and more that one reference exist to this array
+    /// then resize will succeed only if it makes a reshape, i.e. original size doesn't change
+    void resize(ShapeContainer new_shape, bool refcheck = true) {
+        detail::npy_api::PyArray_Dims d
+            = {// Use reinterpret_cast for PyPy on Windows (remove if fixed, checked on 7.3.1)
+               reinterpret_cast<Py_intptr_t *>(new_shape->data()),
+               int(new_shape->size())};
+        // try to resize, set ordering param to -1 cause it's not used anyway
+        auto new_array = reinterpret_steal<object>(
+            detail::npy_api::get().PyArray_Resize_(m_ptr, &d, int(refcheck), -1));
+        if (!new_array) {
+            throw error_already_set();
+        }
+        if (isinstance<array>(new_array)) {
+            *this = std::move(new_array);
+        }
+    }
+
+    /// Optional `order` parameter omitted, to be added as needed.
+    array reshape(ShapeContainer new_shape) {
+        detail::npy_api::PyArray_Dims d
+            = {reinterpret_cast<Py_intptr_t *>(new_shape->data()), int(new_shape->size())};
+        auto new_array
+            = reinterpret_steal<array>(detail::npy_api::get().PyArray_Newshape_(m_ptr, &d, 0));
+        if (!new_array) {
+            throw error_already_set();
+        }
+        return new_array;
+    }
+
+    /// Create a view of an array in a different data type.
+    /// This function may fundamentally reinterpret the data in the array.
+    /// It is the responsibility of the caller to ensure that this is safe.
+    /// Only supports the `dtype` argument, the `type` argument is omitted,
+    /// to be added as needed.
+    array view(const std::string &dtype) {
+        auto &api = detail::npy_api::get();
+        auto new_view = reinterpret_steal<array>(api.PyArray_View_(
+            m_ptr, dtype::from_args(pybind11::str(dtype)).release().ptr(), nullptr));
+        if (!new_view) {
+            throw error_already_set();
+        }
+        return new_view;
+    }
+
+    /// Ensure that the argument is a NumPy array
+    /// In case of an error, nullptr is returned and the Python error is cleared.
+    static array ensure(handle h, int ExtraFlags = 0) {
+        auto result = reinterpret_steal<array>(raw_array(h.ptr(), ExtraFlags));
+        if (!result) {
+            PyErr_Clear();
+        }
+        return result;
+    }
+
+protected:
+    template <typename, typename>
+    friend struct detail::npy_format_descriptor;
+
+    void fail_dim_check(ssize_t dim, const std::string &msg) const {
+        throw index_error(msg + ": " + std::to_string(dim) + " (ndim = " + std::to_string(ndim())
+                          + ')');
+    }
+
+    template <typename... Ix>
+    ssize_t byte_offset(Ix... index) const {
+        check_dimensions(index...);
+        return detail::byte_offset_unsafe(strides(), ssize_t(index)...);
+    }
+
+    void check_writeable() const {
+        if (!writeable()) {
+            throw std::domain_error("array is not writeable");
+        }
+    }
+
+    template <typename... Ix>
+    void check_dimensions(Ix... index) const {
+        check_dimensions_impl(ssize_t(0), shape(), ssize_t(index)...);
+    }
+
+    void check_dimensions_impl(ssize_t, const ssize_t *) const {}
+
+    template <typename... Ix>
+    void check_dimensions_impl(ssize_t axis, const ssize_t *shape, ssize_t i, Ix... index) const {
+        if (i >= *shape) {
+            throw index_error(std::string("index ") + std::to_string(i)
+                              + " is out of bounds for axis " + std::to_string(axis)
+                              + " with size " + std::to_string(*shape));
+        }
+        check_dimensions_impl(axis + 1, shape + 1, index...);
+    }
+
+    /// Create array from any object -- always returns a new reference
+    static PyObject *raw_array(PyObject *ptr, int ExtraFlags = 0) {
+        if (ptr == nullptr) {
+            set_error(PyExc_ValueError, "cannot create a pybind11::array from a nullptr");
+            return nullptr;
+        }
+        return detail::npy_api::get().PyArray_FromAny_(
+            ptr, nullptr, 0, 0, detail::npy_api::NPY_ARRAY_ENSUREARRAY_ | ExtraFlags, nullptr);
+    }
+};
+
+template <typename T, int ExtraFlags = array::forcecast>
+class array_t : public array {
+private:
+    struct private_ctor {};
+    // Delegating constructor needed when both moving and accessing in the same constructor
+    array_t(private_ctor,
+            ShapeContainer &&shape,
+            StridesContainer &&strides,
+            const T *ptr,
+            handle base)
+        : array(std::move(shape), std::move(strides), ptr, base) {}
+
+public:
+    static_assert(!detail::array_info<T>::is_array, "Array types cannot be used with array_t");
+
+    using value_type = T;
+
+    array_t() : array(0, static_cast<const T *>(nullptr)) {}
+    array_t(handle h, borrowed_t) : array(h, borrowed_t{}) {}
+    array_t(handle h, stolen_t) : array(h, stolen_t{}) {}
+
+    PYBIND11_DEPRECATED("Use array_t<T>::ensure() instead")
+    array_t(handle h, bool is_borrowed) : array(raw_array_t(h.ptr()), stolen_t{}) {
+        if (!m_ptr) {
+            PyErr_Clear();
+        }
+        if (!is_borrowed) {
+            Py_XDECREF(h.ptr());
+        }
+    }
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    array_t(const object &o) : array(raw_array_t(o.ptr()), stolen_t{}) {
+        if (!m_ptr) {
+            throw error_already_set();
+        }
+    }
+
+    explicit array_t(const buffer_info &info, handle base = handle()) : array(info, base) {}
+
+    array_t(ShapeContainer shape,
+            StridesContainer strides,
+            const T *ptr = nullptr,
+            handle base = handle())
+        : array(std::move(shape), std::move(strides), ptr, base) {}
+
+    explicit array_t(ShapeContainer shape, const T *ptr = nullptr, handle base = handle())
+        : array_t(private_ctor{},
+                  std::move(shape),
+                  (ExtraFlags & f_style) != 0 ? detail::f_strides(*shape, itemsize())
+                                              : detail::c_strides(*shape, itemsize()),
+                  ptr,
+                  base) {}
+
+    explicit array_t(ssize_t count, const T *ptr = nullptr, handle base = handle())
+        : array({count}, {}, ptr, base) {}
+
+    constexpr ssize_t itemsize() const { return sizeof(T); }
+
+    template <typename... Ix>
+    ssize_t index_at(Ix... index) const {
+        return offset_at(index...) / itemsize();
+    }
+
+    template <typename... Ix>
+    const T *data(Ix... index) const {
+        return static_cast<const T *>(array::data(index...));
+    }
+
+    template <typename... Ix>
+    T *mutable_data(Ix... index) {
+        return static_cast<T *>(array::mutable_data(index...));
+    }
+
+    // Reference to element at a given index
+    template <typename... Ix>
+    const T &at(Ix... index) const {
+        if ((ssize_t) sizeof...(index) != ndim()) {
+            fail_dim_check(sizeof...(index), "index dimension mismatch");
+        }
+        return *(static_cast<const T *>(array::data())
+                 + byte_offset(ssize_t(index)...) / itemsize());
+    }
+
+    // Mutable reference to element at a given index
+    template <typename... Ix>
+    T &mutable_at(Ix... index) {
+        if ((ssize_t) sizeof...(index) != ndim()) {
+            fail_dim_check(sizeof...(index), "index dimension mismatch");
+        }
+        return *(static_cast<T *>(array::mutable_data())
+                 + byte_offset(ssize_t(index)...) / itemsize());
+    }
+
+    /**
+     * Returns a proxy object that provides access to the array's data without bounds or
+     * dimensionality checking.  Will throw if the array is missing the `writeable` flag.  Use with
+     * care: the array must not be destroyed or reshaped for the duration of the returned object,
+     * and the caller must take care not to access invalid dimensions or dimension indices.
+     */
+    template <ssize_t Dims = -1>
+    detail::unchecked_mutable_reference<T, Dims> mutable_unchecked() & {
+        return array::mutable_unchecked<T, Dims>();
+    }
+
+    /**
+     * Returns a proxy object that provides const access to the array's data without bounds or
+     * dimensionality checking.  Unlike `mutable_unchecked()`, this does not require that the
+     * underlying array have the `writable` flag.  Use with care: the array must not be destroyed
+     * or reshaped for the duration of the returned object, and the caller must take care not to
+     * access invalid dimensions or dimension indices.
+     */
+    template <ssize_t Dims = -1>
+    detail::unchecked_reference<T, Dims> unchecked() const & {
+        return array::unchecked<T, Dims>();
+    }
+
+    /// Ensure that the argument is a NumPy array of the correct dtype (and if not, try to convert
+    /// it).  In case of an error, nullptr is returned and the Python error is cleared.
+    static array_t ensure(handle h) {
+        auto result = reinterpret_steal<array_t>(raw_array_t(h.ptr()));
+        if (!result) {
+            PyErr_Clear();
+        }
+        return result;
+    }
+
+    static bool check_(handle h) {
+        const auto &api = detail::npy_api::get();
+        return api.PyArray_Check_(h.ptr())
+               && api.PyArray_EquivTypes_(detail::array_proxy(h.ptr())->descr,
+                                          dtype::of<T>().ptr())
+               && detail::check_flags(h.ptr(), ExtraFlags & (array::c_style | array::f_style));
+    }
+
+protected:
+    /// Create array from any object -- always returns a new reference
+    static PyObject *raw_array_t(PyObject *ptr) {
+        if (ptr == nullptr) {
+            set_error(PyExc_ValueError, "cannot create a pybind11::array_t from a nullptr");
+            return nullptr;
+        }
+        return detail::npy_api::get().PyArray_FromAny_(ptr,
+                                                       dtype::of<T>().release().ptr(),
+                                                       0,
+                                                       0,
+                                                       detail::npy_api::NPY_ARRAY_ENSUREARRAY_
+                                                           | ExtraFlags,
+                                                       nullptr);
+    }
+};
+
+template <typename T>
+struct format_descriptor<T, detail::enable_if_t<detail::is_pod_struct<T>::value>> {
+    static std::string format() {
+        return detail::npy_format_descriptor<typename std::remove_cv<T>::type>::format();
+    }
+};
+
+template <size_t N>
+struct format_descriptor<char[N]> {
+    static std::string format() { return std::to_string(N) + 's'; }
+};
+template <size_t N>
+struct format_descriptor<std::array<char, N>> {
+    static std::string format() { return std::to_string(N) + 's'; }
+};
+
+template <typename T>
+struct format_descriptor<T, detail::enable_if_t<std::is_enum<T>::value>> {
+    static std::string format() {
+        return format_descriptor<
+            typename std::remove_cv<typename std::underlying_type<T>::type>::type>::format();
+    }
+};
+
+template <typename T>
+struct format_descriptor<T, detail::enable_if_t<detail::array_info<T>::is_array>> {
+    static std::string format() {
+        using namespace detail;
+        static constexpr auto extents = const_name("(") + array_info<T>::extents + const_name(")");
+        return extents.text + format_descriptor<remove_all_extents_t<T>>::format();
+    }
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+template <typename T, int ExtraFlags>
+struct pyobject_caster<array_t<T, ExtraFlags>> {
+    using type = array_t<T, ExtraFlags>;
+
+    bool load(handle src, bool convert) {
+        if (!convert && !type::check_(src)) {
+            return false;
+        }
+        value = type::ensure(src);
+        return static_cast<bool>(value);
+    }
+
+    static handle cast(const handle &src, return_value_policy /* policy */, handle /* parent */) {
+        return src.inc_ref();
+    }
+    PYBIND11_TYPE_CASTER(type, handle_type_name<type>::name);
+};
+
+template <typename T>
+struct compare_buffer_info<T, detail::enable_if_t<detail::is_pod_struct<T>::value>> {
+    static bool compare(const buffer_info &b) {
+        return npy_api::get().PyArray_EquivTypes_(dtype::of<T>().ptr(), dtype(b).ptr());
+    }
+};
+
+template <typename T, typename = void>
+struct npy_format_descriptor_name;
+
+template <typename T>
+struct npy_format_descriptor_name<T, enable_if_t<std::is_integral<T>::value>> {
+    static constexpr auto name = const_name<std::is_same<T, bool>::value>(
+        const_name("bool"),
+        const_name<std::is_signed<T>::value>("numpy.int", "numpy.uint")
+            + const_name<sizeof(T) * 8>());
+};
+
+template <typename T>
+struct npy_format_descriptor_name<T, enable_if_t<std::is_floating_point<T>::value>> {
+    static constexpr auto name = const_name < std::is_same<T, float>::value
+                                 || std::is_same<T, const float>::value
+                                 || std::is_same<T, double>::value
+                                 || std::is_same<T, const double>::value
+                                        > (const_name("numpy.float") + const_name<sizeof(T) * 8>(),
+                                           const_name("numpy.longdouble"));
+};
+
+template <typename T>
+struct npy_format_descriptor_name<T, enable_if_t<is_complex<T>::value>> {
+    static constexpr auto name = const_name < std::is_same<typename T::value_type, float>::value
+                                 || std::is_same<typename T::value_type, const float>::value
+                                 || std::is_same<typename T::value_type, double>::value
+                                 || std::is_same<typename T::value_type, const double>::value
+                                        > (const_name("numpy.complex")
+                                               + const_name<sizeof(typename T::value_type) * 16>(),
+                                           const_name("numpy.longcomplex"));
+};
+
+template <typename T>
+struct npy_format_descriptor<
+    T,
+    enable_if_t<satisfies_any_of<T, std::is_arithmetic, is_complex>::value>>
+    : npy_format_descriptor_name<T> {
+private:
+    // NB: the order here must match the one in common.h
+    constexpr static const int values[15] = {npy_api::NPY_BOOL_,
+                                             npy_api::NPY_BYTE_,
+                                             npy_api::NPY_UBYTE_,
+                                             npy_api::NPY_INT16_,
+                                             npy_api::NPY_UINT16_,
+                                             npy_api::NPY_INT32_,
+                                             npy_api::NPY_UINT32_,
+                                             npy_api::NPY_INT64_,
+                                             npy_api::NPY_UINT64_,
+                                             npy_api::NPY_FLOAT_,
+                                             npy_api::NPY_DOUBLE_,
+                                             npy_api::NPY_LONGDOUBLE_,
+                                             npy_api::NPY_CFLOAT_,
+                                             npy_api::NPY_CDOUBLE_,
+                                             npy_api::NPY_CLONGDOUBLE_};
+
+public:
+    static constexpr int value = values[detail::is_fmt_numeric<T>::index];
+
+    static pybind11::dtype dtype() { return pybind11::dtype(/*typenum*/ value); }
+};
+
+template <typename T>
+struct npy_format_descriptor<T, enable_if_t<is_same_ignoring_cvref<T, PyObject *>::value>> {
+    static constexpr auto name = const_name("object");
+
+    static constexpr int value = npy_api::NPY_OBJECT_;
+
+    static pybind11::dtype dtype() { return pybind11::dtype(/*typenum*/ value); }
+};
+
+#define PYBIND11_DECL_CHAR_FMT                                                                    \
+    static constexpr auto name = const_name("S") + const_name<N>();                               \
+    static pybind11::dtype dtype() {                                                              \
+        return pybind11::dtype(std::string("S") + std::to_string(N));                             \
+    }
+template <size_t N>
+struct npy_format_descriptor<char[N]> {
+    PYBIND11_DECL_CHAR_FMT
+};
+template <size_t N>
+struct npy_format_descriptor<std::array<char, N>> {
+    PYBIND11_DECL_CHAR_FMT
+};
+#undef PYBIND11_DECL_CHAR_FMT
+
+template <typename T>
+struct npy_format_descriptor<T, enable_if_t<array_info<T>::is_array>> {
+private:
+    using base_descr = npy_format_descriptor<typename array_info<T>::type>;
+
+public:
+    static_assert(!array_info<T>::is_empty, "Zero-sized arrays are not supported");
+
+    static constexpr auto name
+        = const_name("(") + array_info<T>::extents + const_name(")") + base_descr::name;
+    static pybind11::dtype dtype() {
+        list shape;
+        array_info<T>::append_extents(shape);
+        return pybind11::dtype::from_args(
+            pybind11::make_tuple(base_descr::dtype(), std::move(shape)));
+    }
+};
+
+template <typename T>
+struct npy_format_descriptor<T, enable_if_t<std::is_enum<T>::value>> {
+private:
+    using base_descr = npy_format_descriptor<typename std::underlying_type<T>::type>;
+
+public:
+    static constexpr auto name = base_descr::name;
+    static pybind11::dtype dtype() { return base_descr::dtype(); }
+};
+
+struct field_descriptor {
+    const char *name;
+    ssize_t offset;
+    ssize_t size;
+    std::string format;
+    dtype descr;
+};
+
+PYBIND11_NOINLINE void register_structured_dtype(any_container<field_descriptor> fields,
+                                                 const std::type_info &tinfo,
+                                                 ssize_t itemsize,
+                                                 bool (*direct_converter)(PyObject *, void *&)) {
+
+    auto &numpy_internals = get_numpy_internals();
+    if (numpy_internals.get_type_info(tinfo, false)) {
+        pybind11_fail("NumPy: dtype is already registered");
+    }
+
+    // Use ordered fields because order matters as of NumPy 1.14:
+    // https://docs.scipy.org/doc/numpy/release.html#multiple-field-indexing-assignment-of-structured-arrays
+    std::vector<field_descriptor> ordered_fields(std::move(fields));
+    std::sort(
+        ordered_fields.begin(),
+        ordered_fields.end(),
+        [](const field_descriptor &a, const field_descriptor &b) { return a.offset < b.offset; });
+
+    list names, formats, offsets;
+    for (auto &field : ordered_fields) {
+        if (!field.descr) {
+            pybind11_fail(std::string("NumPy: unsupported field dtype: `") + field.name + "` @ "
+                          + tinfo.name());
+        }
+        names.append(pybind11::str(field.name));
+        formats.append(field.descr);
+        offsets.append(pybind11::int_(field.offset));
+    }
+    auto *dtype_ptr
+        = pybind11::dtype(std::move(names), std::move(formats), std::move(offsets), itemsize)
+              .release()
+              .ptr();
+
+    // There is an existing bug in NumPy (as of v1.11): trailing bytes are
+    // not encoded explicitly into the format string. This will supposedly
+    // get fixed in v1.12; for further details, see these:
+    // - https://github.com/numpy/numpy/issues/7797
+    // - https://github.com/numpy/numpy/pull/7798
+    // Because of this, we won't use numpy's logic to generate buffer format
+    // strings and will just do it ourselves.
+    ssize_t offset = 0;
+    std::ostringstream oss;
+    // mark the structure as unaligned with '^', because numpy and C++ don't
+    // always agree about alignment (particularly for complex), and we're
+    // explicitly listing all our padding. This depends on none of the fields
+    // overriding the endianness. Putting the ^ in front of individual fields
+    // isn't guaranteed to work due to https://github.com/numpy/numpy/issues/9049
+    oss << "^T{";
+    for (auto &field : ordered_fields) {
+        if (field.offset > offset) {
+            oss << (field.offset - offset) << 'x';
+        }
+        oss << field.format << ':' << field.name << ':';
+        offset = field.offset + field.size;
+    }
+    if (itemsize > offset) {
+        oss << (itemsize - offset) << 'x';
+    }
+    oss << '}';
+    auto format_str = oss.str();
+
+    // Smoke test: verify that NumPy properly parses our buffer format string
+    auto &api = npy_api::get();
+    auto arr = array(buffer_info(nullptr, itemsize, format_str, 1));
+    if (!api.PyArray_EquivTypes_(dtype_ptr, arr.dtype().ptr())) {
+        pybind11_fail("NumPy: invalid buffer descriptor!");
+    }
+
+    auto tindex = std::type_index(tinfo);
+    numpy_internals.registered_dtypes[tindex] = {dtype_ptr, std::move(format_str)};
+    with_internals([tindex, &direct_converter](internals &internals) {
+        internals.direct_conversions[tindex].push_back(direct_converter);
+    });
+}
+
+template <typename T, typename SFINAE>
+struct npy_format_descriptor {
+    static_assert(is_pod_struct<T>::value,
+                  "Attempt to use a non-POD or unimplemented POD type as a numpy dtype");
+
+    static constexpr auto name = make_caster<T>::name;
+
+    static pybind11::dtype dtype() { return reinterpret_borrow<pybind11::dtype>(dtype_ptr()); }
+
+    static std::string format() {
+        static auto format_str = get_numpy_internals().get_type_info<T>(true)->format_str;
+        return format_str;
+    }
+
+    static void register_dtype(any_container<field_descriptor> fields) {
+        register_structured_dtype(std::move(fields),
+                                  typeid(typename std::remove_cv<T>::type),
+                                  sizeof(T),
+                                  &direct_converter);
+    }
+
+private:
+    static PyObject *dtype_ptr() {
+        static PyObject *ptr = get_numpy_internals().get_type_info<T>(true)->dtype_ptr;
+        return ptr;
+    }
+
+    static bool direct_converter(PyObject *obj, void *&value) {
+        auto &api = npy_api::get();
+        if (!PyObject_TypeCheck(obj, api.PyVoidArrType_Type_)) {
+            return false;
+        }
+        if (auto descr = reinterpret_steal<object>(api.PyArray_DescrFromScalar_(obj))) {
+            if (api.PyArray_EquivTypes_(dtype_ptr(), descr.ptr())) {
+                value = ((PyVoidScalarObject_Proxy *) obj)->obval;
+                return true;
+            }
+        }
+        return false;
+    }
+};
+
+#ifdef __CLION_IDE__ // replace heavy macro with dummy code for the IDE (doesn't affect code)
+#    define PYBIND11_NUMPY_DTYPE(Type, ...) ((void) 0)
+#    define PYBIND11_NUMPY_DTYPE_EX(Type, ...) ((void) 0)
+#else
+
+#    define PYBIND11_FIELD_DESCRIPTOR_EX(T, Field, Name)                                          \
+        ::pybind11::detail::field_descriptor {                                                    \
+            Name, offsetof(T, Field), sizeof(decltype(std::declval<T>().Field)),                  \
+                ::pybind11::format_descriptor<decltype(std::declval<T>().Field)>::format(),       \
+                ::pybind11::detail::npy_format_descriptor<                                        \
+                    decltype(std::declval<T>().Field)>::dtype()                                   \
+        }
+
+// Extract name, offset and format descriptor for a struct field
+#    define PYBIND11_FIELD_DESCRIPTOR(T, Field) PYBIND11_FIELD_DESCRIPTOR_EX(T, Field, #Field)
+
+// The main idea of this macro is borrowed from https://github.com/swansontec/map-macro
+// (C) William Swanson, Paul Fultz
+#    define PYBIND11_EVAL0(...) __VA_ARGS__
+#    define PYBIND11_EVAL1(...) PYBIND11_EVAL0(PYBIND11_EVAL0(PYBIND11_EVAL0(__VA_ARGS__)))
+#    define PYBIND11_EVAL2(...) PYBIND11_EVAL1(PYBIND11_EVAL1(PYBIND11_EVAL1(__VA_ARGS__)))
+#    define PYBIND11_EVAL3(...) PYBIND11_EVAL2(PYBIND11_EVAL2(PYBIND11_EVAL2(__VA_ARGS__)))
+#    define PYBIND11_EVAL4(...) PYBIND11_EVAL3(PYBIND11_EVAL3(PYBIND11_EVAL3(__VA_ARGS__)))
+#    define PYBIND11_EVAL(...) PYBIND11_EVAL4(PYBIND11_EVAL4(PYBIND11_EVAL4(__VA_ARGS__)))
+#    define PYBIND11_MAP_END(...)
+#    define PYBIND11_MAP_OUT
+#    define PYBIND11_MAP_COMMA ,
+#    define PYBIND11_MAP_GET_END() 0, PYBIND11_MAP_END
+#    define PYBIND11_MAP_NEXT0(test, next, ...) next PYBIND11_MAP_OUT
+#    define PYBIND11_MAP_NEXT1(test, next) PYBIND11_MAP_NEXT0(test, next, 0)
+#    define PYBIND11_MAP_NEXT(test, next) PYBIND11_MAP_NEXT1(PYBIND11_MAP_GET_END test, next)
+#    if defined(_MSC_VER)                                                                         \
+        && !defined(__clang__) // MSVC is not as eager to expand macros, hence this workaround
+#        define PYBIND11_MAP_LIST_NEXT1(test, next)                                               \
+            PYBIND11_EVAL0(PYBIND11_MAP_NEXT0(test, PYBIND11_MAP_COMMA next, 0))
+#    else
+#        define PYBIND11_MAP_LIST_NEXT1(test, next)                                               \
+            PYBIND11_MAP_NEXT0(test, PYBIND11_MAP_COMMA next, 0)
+#    endif
+#    define PYBIND11_MAP_LIST_NEXT(test, next)                                                    \
+        PYBIND11_MAP_LIST_NEXT1(PYBIND11_MAP_GET_END test, next)
+#    define PYBIND11_MAP_LIST0(f, t, x, peek, ...)                                                \
+        f(t, x) PYBIND11_MAP_LIST_NEXT(peek, PYBIND11_MAP_LIST1)(f, t, peek, __VA_ARGS__)
+#    define PYBIND11_MAP_LIST1(f, t, x, peek, ...)                                                \
+        f(t, x) PYBIND11_MAP_LIST_NEXT(peek, PYBIND11_MAP_LIST0)(f, t, peek, __VA_ARGS__)
+// PYBIND11_MAP_LIST(f, t, a1, a2, ...) expands to f(t, a1), f(t, a2), ...
+#    define PYBIND11_MAP_LIST(f, t, ...)                                                          \
+        PYBIND11_EVAL(PYBIND11_MAP_LIST1(f, t, __VA_ARGS__, (), 0))
+
+#    define PYBIND11_NUMPY_DTYPE(Type, ...)                                                       \
+        ::pybind11::detail::npy_format_descriptor<Type>::register_dtype(                          \
+            ::std::vector<::pybind11::detail::field_descriptor>{                                  \
+                PYBIND11_MAP_LIST(PYBIND11_FIELD_DESCRIPTOR, Type, __VA_ARGS__)})
+
+#    if defined(_MSC_VER) && !defined(__clang__)
+#        define PYBIND11_MAP2_LIST_NEXT1(test, next)                                              \
+            PYBIND11_EVAL0(PYBIND11_MAP_NEXT0(test, PYBIND11_MAP_COMMA next, 0))
+#    else
+#        define PYBIND11_MAP2_LIST_NEXT1(test, next)                                              \
+            PYBIND11_MAP_NEXT0(test, PYBIND11_MAP_COMMA next, 0)
+#    endif
+#    define PYBIND11_MAP2_LIST_NEXT(test, next)                                                   \
+        PYBIND11_MAP2_LIST_NEXT1(PYBIND11_MAP_GET_END test, next)
+#    define PYBIND11_MAP2_LIST0(f, t, x1, x2, peek, ...)                                          \
+        f(t, x1, x2) PYBIND11_MAP2_LIST_NEXT(peek, PYBIND11_MAP2_LIST1)(f, t, peek, __VA_ARGS__)
+#    define PYBIND11_MAP2_LIST1(f, t, x1, x2, peek, ...)                                          \
+        f(t, x1, x2) PYBIND11_MAP2_LIST_NEXT(peek, PYBIND11_MAP2_LIST0)(f, t, peek, __VA_ARGS__)
+// PYBIND11_MAP2_LIST(f, t, a1, a2, ...) expands to f(t, a1, a2), f(t, a3, a4), ...
+#    define PYBIND11_MAP2_LIST(f, t, ...)                                                         \
+        PYBIND11_EVAL(PYBIND11_MAP2_LIST1(f, t, __VA_ARGS__, (), 0))
+
+#    define PYBIND11_NUMPY_DTYPE_EX(Type, ...)                                                    \
+        ::pybind11::detail::npy_format_descriptor<Type>::register_dtype(                          \
+            ::std::vector<::pybind11::detail::field_descriptor>{                                  \
+                PYBIND11_MAP2_LIST(PYBIND11_FIELD_DESCRIPTOR_EX, Type, __VA_ARGS__)})
+
+#endif // __CLION_IDE__
+
+class common_iterator {
+public:
+    using container_type = std::vector<ssize_t>;
+    using value_type = container_type::value_type;
+    using size_type = container_type::size_type;
+
+    common_iterator() : m_strides() {}
+
+    common_iterator(void *ptr, const container_type &strides, const container_type &shape)
+        : p_ptr(reinterpret_cast<char *>(ptr)), m_strides(strides.size()) {
+        m_strides.back() = static_cast<value_type>(strides.back());
+        for (size_type i = m_strides.size() - 1; i != 0; --i) {
+            size_type j = i - 1;
+            auto s = static_cast<value_type>(shape[i]);
+            m_strides[j] = strides[j] + m_strides[i] - strides[i] * s;
+        }
+    }
+
+    void increment(size_type dim) { p_ptr += m_strides[dim]; }
+
+    void *data() const { return p_ptr; }
+
+private:
+    char *p_ptr{nullptr};
+    container_type m_strides;
+};
+
+template <size_t N>
+class multi_array_iterator {
+public:
+    using container_type = std::vector<ssize_t>;
+
+    multi_array_iterator(const std::array<buffer_info, N> &buffers, const container_type &shape)
+        : m_shape(shape.size()), m_index(shape.size(), 0), m_common_iterator() {
+
+        // Manual copy to avoid conversion warning if using std::copy
+        for (size_t i = 0; i < shape.size(); ++i) {
+            m_shape[i] = shape[i];
+        }
+
+        container_type strides(shape.size());
+        for (size_t i = 0; i < N; ++i) {
+            init_common_iterator(buffers[i], shape, m_common_iterator[i], strides);
+        }
+    }
+
+    multi_array_iterator &operator++() {
+        for (size_t j = m_index.size(); j != 0; --j) {
+            size_t i = j - 1;
+            if (++m_index[i] != m_shape[i]) {
+                increment_common_iterator(i);
+                break;
+            }
+            m_index[i] = 0;
+        }
+        return *this;
+    }
+
+    template <size_t K, class T = void>
+    T *data() const {
+        return reinterpret_cast<T *>(m_common_iterator[K].data());
+    }
+
+private:
+    using common_iter = common_iterator;
+
+    void init_common_iterator(const buffer_info &buffer,
+                              const container_type &shape,
+                              common_iter &iterator,
+                              container_type &strides) {
+        auto buffer_shape_iter = buffer.shape.rbegin();
+        auto buffer_strides_iter = buffer.strides.rbegin();
+        auto shape_iter = shape.rbegin();
+        auto strides_iter = strides.rbegin();
+
+        while (buffer_shape_iter != buffer.shape.rend()) {
+            if (*shape_iter == *buffer_shape_iter) {
+                *strides_iter = *buffer_strides_iter;
+            } else {
+                *strides_iter = 0;
+            }
+
+            ++buffer_shape_iter;
+            ++buffer_strides_iter;
+            ++shape_iter;
+            ++strides_iter;
+        }
+
+        std::fill(strides_iter, strides.rend(), 0);
+        iterator = common_iter(buffer.ptr, strides, shape);
+    }
+
+    void increment_common_iterator(size_t dim) {
+        for (auto &iter : m_common_iterator) {
+            iter.increment(dim);
+        }
+    }
+
+    container_type m_shape;
+    container_type m_index;
+    std::array<common_iter, N> m_common_iterator;
+};
+
+enum class broadcast_trivial { non_trivial, c_trivial, f_trivial };
+
+// Populates the shape and number of dimensions for the set of buffers.  Returns a
+// broadcast_trivial enum value indicating whether the broadcast is "trivial"--that is, has each
+// buffer being either a singleton or a full-size, C-contiguous (`c_trivial`) or Fortran-contiguous
+// (`f_trivial`) storage buffer; returns `non_trivial` otherwise.
+template <size_t N>
+broadcast_trivial
+broadcast(const std::array<buffer_info, N> &buffers, ssize_t &ndim, std::vector<ssize_t> &shape) {
+    ndim = std::accumulate(
+        buffers.begin(), buffers.end(), ssize_t(0), [](ssize_t res, const buffer_info &buf) {
+            return std::max(res, buf.ndim);
+        });
+
+    shape.clear();
+    shape.resize((size_t) ndim, 1);
+
+    // Figure out the output size, and make sure all input arrays conform (i.e. are either size 1
+    // or the full size).
+    for (size_t i = 0; i < N; ++i) {
+        auto res_iter = shape.rbegin();
+        auto end = buffers[i].shape.rend();
+        for (auto shape_iter = buffers[i].shape.rbegin(); shape_iter != end;
+             ++shape_iter, ++res_iter) {
+            const auto &dim_size_in = *shape_iter;
+            auto &dim_size_out = *res_iter;
+
+            // Each input dimension can either be 1 or `n`, but `n` values must match across
+            // buffers
+            if (dim_size_out == 1) {
+                dim_size_out = dim_size_in;
+            } else if (dim_size_in != 1 && dim_size_in != dim_size_out) {
+                pybind11_fail("pybind11::vectorize: incompatible size/dimension of inputs!");
+            }
+        }
+    }
+
+    bool trivial_broadcast_c = true;
+    bool trivial_broadcast_f = true;
+    for (size_t i = 0; i < N && (trivial_broadcast_c || trivial_broadcast_f); ++i) {
+        if (buffers[i].size == 1) {
+            continue;
+        }
+
+        // Require the same number of dimensions:
+        if (buffers[i].ndim != ndim) {
+            return broadcast_trivial::non_trivial;
+        }
+
+        // Require all dimensions be full-size:
+        if (!std::equal(buffers[i].shape.cbegin(), buffers[i].shape.cend(), shape.cbegin())) {
+            return broadcast_trivial::non_trivial;
+        }
+
+        // Check for C contiguity (but only if previous inputs were also C contiguous)
+        if (trivial_broadcast_c) {
+            ssize_t expect_stride = buffers[i].itemsize;
+            auto end = buffers[i].shape.crend();
+            for (auto shape_iter = buffers[i].shape.crbegin(),
+                      stride_iter = buffers[i].strides.crbegin();
+                 trivial_broadcast_c && shape_iter != end;
+                 ++shape_iter, ++stride_iter) {
+                if (expect_stride == *stride_iter) {
+                    expect_stride *= *shape_iter;
+                } else {
+                    trivial_broadcast_c = false;
+                }
+            }
+        }
+
+        // Check for Fortran contiguity (if previous inputs were also F contiguous)
+        if (trivial_broadcast_f) {
+            ssize_t expect_stride = buffers[i].itemsize;
+            auto end = buffers[i].shape.cend();
+            for (auto shape_iter = buffers[i].shape.cbegin(),
+                      stride_iter = buffers[i].strides.cbegin();
+                 trivial_broadcast_f && shape_iter != end;
+                 ++shape_iter, ++stride_iter) {
+                if (expect_stride == *stride_iter) {
+                    expect_stride *= *shape_iter;
+                } else {
+                    trivial_broadcast_f = false;
+                }
+            }
+        }
+    }
+
+    return trivial_broadcast_c   ? broadcast_trivial::c_trivial
+           : trivial_broadcast_f ? broadcast_trivial::f_trivial
+                                 : broadcast_trivial::non_trivial;
+}
+
+template <typename T>
+struct vectorize_arg {
+    static_assert(!std::is_rvalue_reference<T>::value,
+                  "Functions with rvalue reference arguments cannot be vectorized");
+    // The wrapped function gets called with this type:
+    using call_type = remove_reference_t<T>;
+    // Is this a vectorized argument?
+    static constexpr bool vectorize
+        = satisfies_any_of<call_type, std::is_arithmetic, is_complex, is_pod>::value
+          && satisfies_none_of<call_type,
+                               std::is_pointer,
+                               std::is_array,
+                               is_std_array,
+                               std::is_enum>::value
+          && (!std::is_reference<T>::value
+              || (std::is_lvalue_reference<T>::value && std::is_const<call_type>::value));
+    // Accept this type: an array for vectorized types, otherwise the type as-is:
+    using type = conditional_t<vectorize, array_t<remove_cv_t<call_type>, array::forcecast>, T>;
+};
+
+// py::vectorize when a return type is present
+template <typename Func, typename Return, typename... Args>
+struct vectorize_returned_array {
+    using Type = array_t<Return>;
+
+    static Type create(broadcast_trivial trivial, const std::vector<ssize_t> &shape) {
+        if (trivial == broadcast_trivial::f_trivial) {
+            return array_t<Return, array::f_style>(shape);
+        }
+        return array_t<Return>(shape);
+    }
+
+    static Return *mutable_data(Type &array) { return array.mutable_data(); }
+
+    static Return call(Func &f, Args &...args) { return f(args...); }
+
+    static void call(Return *out, size_t i, Func &f, Args &...args) { out[i] = f(args...); }
+};
+
+// py::vectorize when a return type is not present
+template <typename Func, typename... Args>
+struct vectorize_returned_array<Func, void, Args...> {
+    using Type = none;
+
+    static Type create(broadcast_trivial, const std::vector<ssize_t> &) { return none(); }
+
+    static void *mutable_data(Type &) { return nullptr; }
+
+    static detail::void_type call(Func &f, Args &...args) {
+        f(args...);
+        return {};
+    }
+
+    static void call(void *, size_t, Func &f, Args &...args) { f(args...); }
+};
+
+template <typename Func, typename Return, typename... Args>
+struct vectorize_helper {
+
+// NVCC for some reason breaks if NVectorized is private
+#ifdef __CUDACC__
+public:
+#else
+private:
+#endif
+
+    static constexpr size_t N = sizeof...(Args);
+    static constexpr size_t NVectorized = constexpr_sum(vectorize_arg<Args>::vectorize...);
+    static_assert(
+        NVectorized >= 1,
+        "pybind11::vectorize(...) requires a function with at least one vectorizable argument");
+
+public:
+    template <typename T,
+              // SFINAE to prevent shadowing the copy constructor.
+              typename = detail::enable_if_t<
+                  !std::is_same<vectorize_helper, typename std::decay<T>::type>::value>>
+    explicit vectorize_helper(T &&f) : f(std::forward<T>(f)) {}
+
+    object operator()(typename vectorize_arg<Args>::type... args) {
+        return run(args...,
+                   make_index_sequence<N>(),
+                   select_indices<vectorize_arg<Args>::vectorize...>(),
+                   make_index_sequence<NVectorized>());
+    }
+
+private:
+    remove_reference_t<Func> f;
+
+    // Internal compiler error in MSVC 19.16.27025.1 (Visual Studio 2017 15.9.4), when compiling
+    // with "/permissive-" flag when arg_call_types is manually inlined.
+    using arg_call_types = std::tuple<typename vectorize_arg<Args>::call_type...>;
+    template <size_t Index>
+    using param_n_t = typename std::tuple_element<Index, arg_call_types>::type;
+
+    using returned_array = vectorize_returned_array<Func, Return, Args...>;
+
+    // Runs a vectorized function given arguments tuple and three index sequences:
+    //     - Index is the full set of 0 ... (N-1) argument indices;
+    //     - VIndex is the subset of argument indices with vectorized parameters, letting us access
+    //       vectorized arguments (anything not in this sequence is passed through)
+    //     - BIndex is a incremental sequence (beginning at 0) of the same size as VIndex, so that
+    //       we can store vectorized buffer_infos in an array (argument VIndex has its buffer at
+    //       index BIndex in the array).
+    template <size_t... Index, size_t... VIndex, size_t... BIndex>
+    object run(typename vectorize_arg<Args>::type &...args,
+               index_sequence<Index...> i_seq,
+               index_sequence<VIndex...> vi_seq,
+               index_sequence<BIndex...> bi_seq) {
+
+        // Pointers to values the function was called with; the vectorized ones set here will start
+        // out as array_t<T> pointers, but they will be changed them to T pointers before we make
+        // call the wrapped function.  Non-vectorized pointers are left as-is.
+        std::array<void *, N> params{{&args...}};
+
+        // The array of `buffer_info`s of vectorized arguments:
+        std::array<buffer_info, NVectorized> buffers{
+            {reinterpret_cast<array *>(params[VIndex])->request()...}};
+
+        /* Determine dimensions parameters of output array */
+        ssize_t nd = 0;
+        std::vector<ssize_t> shape(0);
+        auto trivial = broadcast(buffers, nd, shape);
+        auto ndim = (size_t) nd;
+
+        size_t size
+            = std::accumulate(shape.begin(), shape.end(), (size_t) 1, std::multiplies<size_t>());
+
+        // If all arguments are 0-dimension arrays (i.e. single values) return a plain value (i.e.
+        // not wrapped in an array).
+        if (size == 1 && ndim == 0) {
+            PYBIND11_EXPAND_SIDE_EFFECTS(params[VIndex] = buffers[BIndex].ptr);
+            return cast(
+                returned_array::call(f, *reinterpret_cast<param_n_t<Index> *>(params[Index])...));
+        }
+
+        auto result = returned_array::create(trivial, shape);
+
+        PYBIND11_WARNING_PUSH
+#ifdef PYBIND11_DETECTED_CLANG_WITH_MISLEADING_CALL_STD_MOVE_EXPLICITLY_WARNING
+        PYBIND11_WARNING_DISABLE_CLANG("-Wreturn-std-move")
+#endif
+
+        if (size == 0) {
+            return result;
+        }
+
+        /* Call the function */
+        auto *mutable_data = returned_array::mutable_data(result);
+        if (trivial == broadcast_trivial::non_trivial) {
+            apply_broadcast(buffers, params, mutable_data, size, shape, i_seq, vi_seq, bi_seq);
+        } else {
+            apply_trivial(buffers, params, mutable_data, size, i_seq, vi_seq, bi_seq);
+        }
+
+        return result;
+        PYBIND11_WARNING_POP
+    }
+
+    template <size_t... Index, size_t... VIndex, size_t... BIndex>
+    void apply_trivial(std::array<buffer_info, NVectorized> &buffers,
+                       std::array<void *, N> &params,
+                       Return *out,
+                       size_t size,
+                       index_sequence<Index...>,
+                       index_sequence<VIndex...>,
+                       index_sequence<BIndex...>) {
+
+        // Initialize an array of mutable byte references and sizes with references set to the
+        // appropriate pointer in `params`; as we iterate, we'll increment each pointer by its size
+        // (except for singletons, which get an increment of 0).
+        std::array<std::pair<unsigned char *&, const size_t>, NVectorized> vecparams{
+            {std::pair<unsigned char *&, const size_t>(
+                reinterpret_cast<unsigned char *&>(params[VIndex] = buffers[BIndex].ptr),
+                buffers[BIndex].size == 1 ? 0 : sizeof(param_n_t<VIndex>))...}};
+
+        for (size_t i = 0; i < size; ++i) {
+            returned_array::call(
+                out, i, f, *reinterpret_cast<param_n_t<Index> *>(params[Index])...);
+            for (auto &x : vecparams) {
+                x.first += x.second;
+            }
+        }
+    }
+
+    template <size_t... Index, size_t... VIndex, size_t... BIndex>
+    void apply_broadcast(std::array<buffer_info, NVectorized> &buffers,
+                         std::array<void *, N> &params,
+                         Return *out,
+                         size_t size,
+                         const std::vector<ssize_t> &output_shape,
+                         index_sequence<Index...>,
+                         index_sequence<VIndex...>,
+                         index_sequence<BIndex...>) {
+
+        multi_array_iterator<NVectorized> input_iter(buffers, output_shape);
+
+        for (size_t i = 0; i < size; ++i, ++input_iter) {
+            PYBIND11_EXPAND_SIDE_EFFECTS((params[VIndex] = input_iter.template data<BIndex>()));
+            returned_array::call(
+                out, i, f, *reinterpret_cast<param_n_t<Index> *>(std::get<Index>(params))...);
+        }
+    }
+};
+
+template <typename Func, typename Return, typename... Args>
+vectorize_helper<Func, Return, Args...> vectorize_extractor(const Func &f, Return (*)(Args...)) {
+    return detail::vectorize_helper<Func, Return, Args...>(f);
+}
+
+template <typename T, int Flags>
+struct handle_type_name<array_t<T, Flags>> {
+    static constexpr auto name
+        = const_name("numpy.ndarray[") + npy_format_descriptor<T>::name + const_name("]");
+};
+
+PYBIND11_NAMESPACE_END(detail)
+
+// Vanilla pointer vectorizer:
+template <typename Return, typename... Args>
+detail::vectorize_helper<Return (*)(Args...), Return, Args...> vectorize(Return (*f)(Args...)) {
+    return detail::vectorize_helper<Return (*)(Args...), Return, Args...>(f);
+}
+
+// lambda vectorizer:
+template <typename Func, detail::enable_if_t<detail::is_lambda<Func>::value, int> = 0>
+auto vectorize(Func &&f)
+    -> decltype(detail::vectorize_extractor(std::forward<Func>(f),
+                                            (detail::function_signature_t<Func> *) nullptr)) {
+    return detail::vectorize_extractor(std::forward<Func>(f),
+                                       (detail::function_signature_t<Func> *) nullptr);
+}
+
+// Vectorize a class method (non-const):
+template <typename Return,
+          typename Class,
+          typename... Args,
+          typename Helper = detail::vectorize_helper<
+              decltype(std::mem_fn(std::declval<Return (Class::*)(Args...)>())),
+              Return,
+              Class *,
+              Args...>>
+Helper vectorize(Return (Class::*f)(Args...)) {
+    return Helper(std::mem_fn(f));
+}
+
+// Vectorize a class method (const):
+template <typename Return,
+          typename Class,
+          typename... Args,
+          typename Helper = detail::vectorize_helper<
+              decltype(std::mem_fn(std::declval<Return (Class::*)(Args...) const>())),
+              Return,
+              const Class *,
+              Args...>>
+Helper vectorize(Return (Class::*f)(Args...) const) {
+    return Helper(std::mem_fn(f));
+}
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/operators.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/operators.h
new file mode 100644
index 0000000000..16a88ae171
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/operators.h
@@ -0,0 +1,202 @@
+/*
+    pybind11/operator.h: Metatemplates for operator overloading
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "pybind11.h"
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+/// Enumeration with all supported operator types
+enum op_id : int {
+    op_add,
+    op_sub,
+    op_mul,
+    op_div,
+    op_mod,
+    op_divmod,
+    op_pow,
+    op_lshift,
+    op_rshift,
+    op_and,
+    op_xor,
+    op_or,
+    op_neg,
+    op_pos,
+    op_abs,
+    op_invert,
+    op_int,
+    op_long,
+    op_float,
+    op_str,
+    op_cmp,
+    op_gt,
+    op_ge,
+    op_lt,
+    op_le,
+    op_eq,
+    op_ne,
+    op_iadd,
+    op_isub,
+    op_imul,
+    op_idiv,
+    op_imod,
+    op_ilshift,
+    op_irshift,
+    op_iand,
+    op_ixor,
+    op_ior,
+    op_complex,
+    op_bool,
+    op_nonzero,
+    op_repr,
+    op_truediv,
+    op_itruediv,
+    op_hash
+};
+
+enum op_type : int {
+    op_l, /* base type on left */
+    op_r, /* base type on right */
+    op_u  /* unary operator */
+};
+
+struct self_t {};
+static const self_t self = self_t();
+
+/// Type for an unused type slot
+struct undefined_t {};
+
+/// Don't warn about an unused variable
+inline self_t __self() { return self; }
+
+/// base template of operator implementations
+template <op_id, op_type, typename B, typename L, typename R>
+struct op_impl {};
+
+/// Operator implementation generator
+template <op_id id, op_type ot, typename L, typename R>
+struct op_ {
+    static constexpr bool op_enable_if_hook = true;
+    template <typename Class, typename... Extra>
+    void execute(Class &cl, const Extra &...extra) const {
+        using Base = typename Class::type;
+        using L_type = conditional_t<std::is_same<L, self_t>::value, Base, L>;
+        using R_type = conditional_t<std::is_same<R, self_t>::value, Base, R>;
+        using op = op_impl<id, ot, Base, L_type, R_type>;
+        cl.def(op::name(), &op::execute, is_operator(), extra...);
+    }
+    template <typename Class, typename... Extra>
+    void execute_cast(Class &cl, const Extra &...extra) const {
+        using Base = typename Class::type;
+        using L_type = conditional_t<std::is_same<L, self_t>::value, Base, L>;
+        using R_type = conditional_t<std::is_same<R, self_t>::value, Base, R>;
+        using op = op_impl<id, ot, Base, L_type, R_type>;
+        cl.def(op::name(), &op::execute_cast, is_operator(), extra...);
+    }
+};
+
+#define PYBIND11_BINARY_OPERATOR(id, rid, op, expr)                                               \
+    template <typename B, typename L, typename R>                                                 \
+    struct op_impl<op_##id, op_l, B, L, R> {                                                      \
+        static char const *name() { return "__" #id "__"; }                                       \
+        static auto execute(const L &l, const R &r) -> decltype(expr) { return (expr); }          \
+        static B execute_cast(const L &l, const R &r) { return B(expr); }                         \
+    };                                                                                            \
+    template <typename B, typename L, typename R>                                                 \
+    struct op_impl<op_##id, op_r, B, L, R> {                                                      \
+        static char const *name() { return "__" #rid "__"; }                                      \
+        static auto execute(const R &r, const L &l) -> decltype(expr) { return (expr); }          \
+        static B execute_cast(const R &r, const L &l) { return B(expr); }                         \
+    };                                                                                            \
+    inline op_<op_##id, op_l, self_t, self_t> op(const self_t &, const self_t &) {                \
+        return op_<op_##id, op_l, self_t, self_t>();                                              \
+    }                                                                                             \
+    template <typename T>                                                                         \
+    op_<op_##id, op_l, self_t, T> op(const self_t &, const T &) {                                 \
+        return op_<op_##id, op_l, self_t, T>();                                                   \
+    }                                                                                             \
+    template <typename T>                                                                         \
+    op_<op_##id, op_r, T, self_t> op(const T &, const self_t &) {                                 \
+        return op_<op_##id, op_r, T, self_t>();                                                   \
+    }
+
+#define PYBIND11_INPLACE_OPERATOR(id, op, expr)                                                   \
+    template <typename B, typename L, typename R>                                                 \
+    struct op_impl<op_##id, op_l, B, L, R> {                                                      \
+        static char const *name() { return "__" #id "__"; }                                       \
+        static auto execute(L &l, const R &r) -> decltype(expr) { return expr; }                  \
+        static B execute_cast(L &l, const R &r) { return B(expr); }                               \
+    };                                                                                            \
+    template <typename T>                                                                         \
+    op_<op_##id, op_l, self_t, T> op(const self_t &, const T &) {                                 \
+        return op_<op_##id, op_l, self_t, T>();                                                   \
+    }
+
+#define PYBIND11_UNARY_OPERATOR(id, op, expr)                                                     \
+    template <typename B, typename L>                                                             \
+    struct op_impl<op_##id, op_u, B, L, undefined_t> {                                            \
+        static char const *name() { return "__" #id "__"; }                                       \
+        static auto execute(const L &l) -> decltype(expr) { return expr; }                        \
+        static B execute_cast(const L &l) { return B(expr); }                                     \
+    };                                                                                            \
+    inline op_<op_##id, op_u, self_t, undefined_t> op(const self_t &) {                           \
+        return op_<op_##id, op_u, self_t, undefined_t>();                                         \
+    }
+
+PYBIND11_BINARY_OPERATOR(sub, rsub, operator-, l - r)
+PYBIND11_BINARY_OPERATOR(add, radd, operator+, l + r)
+PYBIND11_BINARY_OPERATOR(mul, rmul, operator*, l *r)
+PYBIND11_BINARY_OPERATOR(truediv, rtruediv, operator/, l / r)
+PYBIND11_BINARY_OPERATOR(mod, rmod, operator%, l % r)
+PYBIND11_BINARY_OPERATOR(lshift, rlshift, operator<<, l << r)
+PYBIND11_BINARY_OPERATOR(rshift, rrshift, operator>>, l >> r)
+PYBIND11_BINARY_OPERATOR(and, rand, operator&, l &r)
+PYBIND11_BINARY_OPERATOR(xor, rxor, operator^, l ^ r)
+PYBIND11_BINARY_OPERATOR(eq, eq, operator==, l == r)
+PYBIND11_BINARY_OPERATOR(ne, ne, operator!=, l != r)
+PYBIND11_BINARY_OPERATOR(or, ror, operator|, l | r)
+PYBIND11_BINARY_OPERATOR(gt, lt, operator>, l > r)
+PYBIND11_BINARY_OPERATOR(ge, le, operator>=, l >= r)
+PYBIND11_BINARY_OPERATOR(lt, gt, operator<, l < r)
+PYBIND11_BINARY_OPERATOR(le, ge, operator<=, l <= r)
+// PYBIND11_BINARY_OPERATOR(pow,       rpow,         pow,          std::pow(l,  r))
+PYBIND11_INPLACE_OPERATOR(iadd, operator+=, l += r)
+PYBIND11_INPLACE_OPERATOR(isub, operator-=, l -= r)
+PYBIND11_INPLACE_OPERATOR(imul, operator*=, l *= r)
+PYBIND11_INPLACE_OPERATOR(itruediv, operator/=, l /= r)
+PYBIND11_INPLACE_OPERATOR(imod, operator%=, l %= r)
+PYBIND11_INPLACE_OPERATOR(ilshift, operator<<=, l <<= r)
+PYBIND11_INPLACE_OPERATOR(irshift, operator>>=, l >>= r)
+PYBIND11_INPLACE_OPERATOR(iand, operator&=, l &= r)
+PYBIND11_INPLACE_OPERATOR(ixor, operator^=, l ^= r)
+PYBIND11_INPLACE_OPERATOR(ior, operator|=, l |= r)
+PYBIND11_UNARY_OPERATOR(neg, operator-, -l)
+PYBIND11_UNARY_OPERATOR(pos, operator+, +l)
+// WARNING: This usage of `abs` should only be done for existing STL overloads.
+// Adding overloads directly in to the `std::` namespace is advised against:
+// https://en.cppreference.com/w/cpp/language/extending_std
+PYBIND11_UNARY_OPERATOR(abs, abs, std::abs(l))
+PYBIND11_UNARY_OPERATOR(hash, hash, std::hash<L>()(l))
+PYBIND11_UNARY_OPERATOR(invert, operator~, (~l))
+PYBIND11_UNARY_OPERATOR(bool, operator!, !!l)
+PYBIND11_UNARY_OPERATOR(int, int_, (int) l)
+PYBIND11_UNARY_OPERATOR(float, float_, (double) l)
+
+#undef PYBIND11_BINARY_OPERATOR
+#undef PYBIND11_INPLACE_OPERATOR
+#undef PYBIND11_UNARY_OPERATOR
+PYBIND11_NAMESPACE_END(detail)
+
+using detail::self;
+// Add named operators so that they are accessible via `py::`.
+using detail::hash;
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/options.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/options.h
new file mode 100644
index 0000000000..1b2122522d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/options.h
@@ -0,0 +1,92 @@
+/*
+    pybind11/options.h: global settings that are configurable at runtime.
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "detail/common.h"
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+class options {
+public:
+    // Default RAII constructor, which leaves settings as they currently are.
+    options() : previous_state(global_state()) {}
+
+    // Class is non-copyable.
+    options(const options &) = delete;
+    options &operator=(const options &) = delete;
+
+    // Destructor, which restores settings that were in effect before.
+    ~options() { global_state() = previous_state; }
+
+    // Setter methods (affect the global state):
+
+    options &disable_user_defined_docstrings() & {
+        global_state().show_user_defined_docstrings = false;
+        return *this;
+    }
+
+    options &enable_user_defined_docstrings() & {
+        global_state().show_user_defined_docstrings = true;
+        return *this;
+    }
+
+    options &disable_function_signatures() & {
+        global_state().show_function_signatures = false;
+        return *this;
+    }
+
+    options &enable_function_signatures() & {
+        global_state().show_function_signatures = true;
+        return *this;
+    }
+
+    options &disable_enum_members_docstring() & {
+        global_state().show_enum_members_docstring = false;
+        return *this;
+    }
+
+    options &enable_enum_members_docstring() & {
+        global_state().show_enum_members_docstring = true;
+        return *this;
+    }
+
+    // Getter methods (return the global state):
+
+    static bool show_user_defined_docstrings() {
+        return global_state().show_user_defined_docstrings;
+    }
+
+    static bool show_function_signatures() { return global_state().show_function_signatures; }
+
+    static bool show_enum_members_docstring() {
+        return global_state().show_enum_members_docstring;
+    }
+
+    // This type is not meant to be allocated on the heap.
+    void *operator new(size_t) = delete;
+
+private:
+    struct state {
+        bool show_user_defined_docstrings = true; //< Include user-supplied texts in docstrings.
+        bool show_function_signatures = true;     //< Include auto-generated function signatures
+                                                  //  in docstrings.
+        bool show_enum_members_docstring = true;  //< Include auto-generated member list in enum
+                                                  //  docstrings.
+    };
+
+    static state &global_state() {
+        static state instance;
+        return instance;
+    }
+
+    state previous_state;
+};
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/pybind11.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/pybind11.h
new file mode 100644
index 0000000000..74919a7d52
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/pybind11.h
@@ -0,0 +1,3026 @@
+/*
+    pybind11/pybind11.h: Main header file of the C++11 python
+    binding generator library
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "detail/class.h"
+#include "detail/init.h"
+#include "attr.h"
+#include "gil.h"
+#include "gil_safe_call_once.h"
+#include "options.h"
+#include "typing.h"
+
+#include <cstdlib>
+#include <cstring>
+#include <memory>
+#include <new>
+#include <string>
+#include <utility>
+#include <vector>
+
+#if defined(__cpp_lib_launder) && !(defined(_MSC_VER) && (_MSC_VER < 1914))
+#    define PYBIND11_STD_LAUNDER std::launder
+#    define PYBIND11_HAS_STD_LAUNDER 1
+#else
+#    define PYBIND11_STD_LAUNDER
+#    define PYBIND11_HAS_STD_LAUNDER 0
+#endif
+#if defined(__GNUG__) && !defined(__clang__)
+#    include <cxxabi.h>
+#endif
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+/* https://stackoverflow.com/questions/46798456/handling-gccs-noexcept-type-warning
+   This warning is about ABI compatibility, not code health.
+   It is only actually needed in a couple places, but apparently GCC 7 "generates this warning if
+   and only if the first template instantiation ... involves noexcept" [stackoverflow], therefore
+   it could get triggered from seemingly random places, depending on user code.
+   No other GCC version generates this warning.
+ */
+#if defined(__GNUC__) && __GNUC__ == 7
+PYBIND11_WARNING_DISABLE_GCC("-Wnoexcept-type")
+#endif
+
+PYBIND11_WARNING_DISABLE_MSVC(4127)
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+inline std::string replace_newlines_and_squash(const char *text) {
+    const char *whitespaces = " \t\n\r\f\v";
+    std::string result(text);
+    bool previous_is_whitespace = false;
+
+    if (result.size() >= 2) {
+        // Do not modify string representations
+        char first_char = result[0];
+        char last_char = result[result.size() - 1];
+        if (first_char == last_char && first_char == '\'') {
+            return result;
+        }
+    }
+    result.clear();
+
+    // Replace characters in whitespaces array with spaces and squash consecutive spaces
+    while (*text != '\0') {
+        if (std::strchr(whitespaces, *text)) {
+            if (!previous_is_whitespace) {
+                result += ' ';
+                previous_is_whitespace = true;
+            }
+        } else {
+            result += *text;
+            previous_is_whitespace = false;
+        }
+        ++text;
+    }
+
+    // Strip leading and trailing whitespaces
+    const size_t str_begin = result.find_first_not_of(whitespaces);
+    if (str_begin == std::string::npos) {
+        return "";
+    }
+
+    const size_t str_end = result.find_last_not_of(whitespaces);
+    const size_t str_range = str_end - str_begin + 1;
+
+    return result.substr(str_begin, str_range);
+}
+
+// Apply all the extensions translators from a list
+// Return true if one of the translators completed without raising an exception
+// itself. Return of false indicates that if there are other translators
+// available, they should be tried.
+inline bool apply_exception_translators(std::forward_list<ExceptionTranslator> &translators) {
+    auto last_exception = std::current_exception();
+
+    for (auto &translator : translators) {
+        try {
+            translator(last_exception);
+            return true;
+        } catch (...) {
+            last_exception = std::current_exception();
+        }
+    }
+    return false;
+}
+
+#if defined(_MSC_VER)
+#    define PYBIND11_COMPAT_STRDUP _strdup
+#else
+#    define PYBIND11_COMPAT_STRDUP strdup
+#endif
+
+PYBIND11_NAMESPACE_END(detail)
+
+/// Wraps an arbitrary C++ function/method/lambda function/.. into a callable Python object
+class cpp_function : public function {
+public:
+    cpp_function() = default;
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    cpp_function(std::nullptr_t) {}
+    cpp_function(std::nullptr_t, const is_setter &) {}
+
+    /// Construct a cpp_function from a vanilla function pointer
+    template <typename Return, typename... Args, typename... Extra>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    cpp_function(Return (*f)(Args...), const Extra &...extra) {
+        initialize(f, f, extra...);
+    }
+
+    /// Construct a cpp_function from a lambda function (possibly with internal state)
+    template <typename Func,
+              typename... Extra,
+              typename = detail::enable_if_t<detail::is_lambda<Func>::value>>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    cpp_function(Func &&f, const Extra &...extra) {
+        initialize(
+            std::forward<Func>(f), (detail::function_signature_t<Func> *) nullptr, extra...);
+    }
+
+    /// Construct a cpp_function from a class method (non-const, no ref-qualifier)
+    template <typename Return, typename Class, typename... Arg, typename... Extra>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    cpp_function(Return (Class::*f)(Arg...), const Extra &...extra) {
+        initialize(
+            [f](Class *c, Arg... args) -> Return { return (c->*f)(std::forward<Arg>(args)...); },
+            (Return(*)(Class *, Arg...)) nullptr,
+            extra...);
+    }
+
+    /// Construct a cpp_function from a class method (non-const, lvalue ref-qualifier)
+    /// A copy of the overload for non-const functions without explicit ref-qualifier
+    /// but with an added `&`.
+    template <typename Return, typename Class, typename... Arg, typename... Extra>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    cpp_function(Return (Class::*f)(Arg...) &, const Extra &...extra) {
+        initialize(
+            [f](Class *c, Arg... args) -> Return { return (c->*f)(std::forward<Arg>(args)...); },
+            (Return(*)(Class *, Arg...)) nullptr,
+            extra...);
+    }
+
+    /// Construct a cpp_function from a class method (const, no ref-qualifier)
+    template <typename Return, typename Class, typename... Arg, typename... Extra>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    cpp_function(Return (Class::*f)(Arg...) const, const Extra &...extra) {
+        initialize([f](const Class *c,
+                       Arg... args) -> Return { return (c->*f)(std::forward<Arg>(args)...); },
+                   (Return(*)(const Class *, Arg...)) nullptr,
+                   extra...);
+    }
+
+    /// Construct a cpp_function from a class method (const, lvalue ref-qualifier)
+    /// A copy of the overload for const functions without explicit ref-qualifier
+    /// but with an added `&`.
+    template <typename Return, typename Class, typename... Arg, typename... Extra>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    cpp_function(Return (Class::*f)(Arg...) const &, const Extra &...extra) {
+        initialize([f](const Class *c,
+                       Arg... args) -> Return { return (c->*f)(std::forward<Arg>(args)...); },
+                   (Return(*)(const Class *, Arg...)) nullptr,
+                   extra...);
+    }
+
+    /// Return the function name
+    object name() const { return attr("__name__"); }
+
+protected:
+    struct InitializingFunctionRecordDeleter {
+        // `destruct(function_record, false)`: `initialize_generic` copies strings and
+        // takes care of cleaning up in case of exceptions. So pass `false` to `free_strings`.
+        void operator()(detail::function_record *rec) { destruct(rec, false); }
+    };
+    using unique_function_record
+        = std::unique_ptr<detail::function_record, InitializingFunctionRecordDeleter>;
+
+    /// Space optimization: don't inline this frequently instantiated fragment
+    PYBIND11_NOINLINE unique_function_record make_function_record() {
+        return unique_function_record(new detail::function_record());
+    }
+
+    /// Special internal constructor for functors, lambda functions, etc.
+    template <typename Func, typename Return, typename... Args, typename... Extra>
+    void initialize(Func &&f, Return (*)(Args...), const Extra &...extra) {
+        using namespace detail;
+        struct capture {
+            remove_reference_t<Func> f;
+        };
+
+        /* Store the function including any extra state it might have (e.g. a lambda capture
+         * object) */
+        // The unique_ptr makes sure nothing is leaked in case of an exception.
+        auto unique_rec = make_function_record();
+        auto *rec = unique_rec.get();
+
+        /* Store the capture object directly in the function record if there is enough space */
+        if (sizeof(capture) <= sizeof(rec->data)) {
+            /* Without these pragmas, GCC warns that there might not be
+               enough space to use the placement new operator. However, the
+               'if' statement above ensures that this is the case. */
+            PYBIND11_WARNING_PUSH
+
+#if defined(__GNUG__) && __GNUC__ >= 6
+            PYBIND11_WARNING_DISABLE_GCC("-Wplacement-new")
+#endif
+
+            new ((capture *) &rec->data) capture{std::forward<Func>(f)};
+
+#if !PYBIND11_HAS_STD_LAUNDER
+            PYBIND11_WARNING_DISABLE_GCC("-Wstrict-aliasing")
+#endif
+
+            // UB without std::launder, but without breaking ABI and/or
+            // a significant refactoring it's "impossible" to solve.
+            if (!std::is_trivially_destructible<capture>::value) {
+                rec->free_data = [](function_record *r) {
+                    auto data = PYBIND11_STD_LAUNDER((capture *) &r->data);
+                    (void) data;
+                    data->~capture();
+                };
+            }
+            PYBIND11_WARNING_POP
+        } else {
+            rec->data[0] = new capture{std::forward<Func>(f)};
+            rec->free_data = [](function_record *r) { delete ((capture *) r->data[0]); };
+        }
+
+        /* Type casters for the function arguments and return value */
+        using cast_in = argument_loader<Args...>;
+        using cast_out
+            = make_caster<conditional_t<std::is_void<Return>::value, void_type, Return>>;
+
+        static_assert(
+            expected_num_args<Extra...>(
+                sizeof...(Args), cast_in::args_pos >= 0, cast_in::has_kwargs),
+            "The number of argument annotations does not match the number of function arguments");
+
+        /* Dispatch code which converts function arguments and performs the actual function call */
+        rec->impl = [](function_call &call) -> handle {
+            cast_in args_converter;
+
+            /* Try to cast the function arguments into the C++ domain */
+            if (!args_converter.load_args(call)) {
+                return PYBIND11_TRY_NEXT_OVERLOAD;
+            }
+
+            /* Invoke call policy pre-call hook */
+            process_attributes<Extra...>::precall(call);
+
+            /* Get a pointer to the capture object */
+            const auto *data = (sizeof(capture) <= sizeof(call.func.data) ? &call.func.data
+                                                                          : call.func.data[0]);
+            auto *cap = const_cast<capture *>(reinterpret_cast<const capture *>(data));
+
+            /* Override policy for rvalues -- usually to enforce rvp::move on an rvalue */
+            return_value_policy policy
+                = return_value_policy_override<Return>::policy(call.func.policy);
+
+            /* Function scope guard -- defaults to the compile-to-nothing `void_type` */
+            using Guard = extract_guard_t<Extra...>;
+
+            /* Perform the function call */
+            handle result;
+            if (call.func.is_setter) {
+                (void) std::move(args_converter).template call<Return, Guard>(cap->f);
+                result = none().release();
+            } else {
+                result = cast_out::cast(
+                    std::move(args_converter).template call<Return, Guard>(cap->f),
+                    policy,
+                    call.parent);
+            }
+
+            /* Invoke call policy post-call hook */
+            process_attributes<Extra...>::postcall(call, result);
+
+            return result;
+        };
+
+        rec->nargs_pos = cast_in::args_pos >= 0
+                             ? static_cast<std::uint16_t>(cast_in::args_pos)
+                             : sizeof...(Args) - cast_in::has_kwargs; // Will get reduced more if
+                                                                      // we have a kw_only
+        rec->has_args = cast_in::args_pos >= 0;
+        rec->has_kwargs = cast_in::has_kwargs;
+
+        /* Process any user-provided function attributes */
+        process_attributes<Extra...>::init(extra..., rec);
+
+        {
+            constexpr bool has_kw_only_args = any_of<std::is_same<kw_only, Extra>...>::value,
+                           has_pos_only_args = any_of<std::is_same<pos_only, Extra>...>::value,
+                           has_arg_annotations = any_of<is_keyword<Extra>...>::value;
+            static_assert(has_arg_annotations || !has_kw_only_args,
+                          "py::kw_only requires the use of argument annotations");
+            static_assert(has_arg_annotations || !has_pos_only_args,
+                          "py::pos_only requires the use of argument annotations (for docstrings "
+                          "and aligning the annotations to the argument)");
+
+            static_assert(constexpr_sum(is_kw_only<Extra>::value...) <= 1,
+                          "py::kw_only may be specified only once");
+            static_assert(constexpr_sum(is_pos_only<Extra>::value...) <= 1,
+                          "py::pos_only may be specified only once");
+            constexpr auto kw_only_pos = constexpr_first<is_kw_only, Extra...>();
+            constexpr auto pos_only_pos = constexpr_first<is_pos_only, Extra...>();
+            static_assert(!(has_kw_only_args && has_pos_only_args) || pos_only_pos < kw_only_pos,
+                          "py::pos_only must come before py::kw_only");
+        }
+
+        /* Generate a readable signature describing the function's arguments and return
+           value types */
+        static constexpr auto signature
+            = const_name("(") + cast_in::arg_names + const_name(") -> ") + cast_out::name;
+        PYBIND11_DESCR_CONSTEXPR auto types = decltype(signature)::types();
+
+        /* Register the function with Python from generic (non-templated) code */
+        // Pass on the ownership over the `unique_rec` to `initialize_generic`. `rec` stays valid.
+        initialize_generic(std::move(unique_rec), signature.text, types.data(), sizeof...(Args));
+
+        /* Stash some additional information used by an important optimization in 'functional.h' */
+        using FunctionType = Return (*)(Args...);
+        constexpr bool is_function_ptr
+            = std::is_convertible<Func, FunctionType>::value && sizeof(capture) == sizeof(void *);
+        if (is_function_ptr) {
+            rec->is_stateless = true;
+            rec->data[1]
+                = const_cast<void *>(reinterpret_cast<const void *>(&typeid(FunctionType)));
+        }
+    }
+
+    // Utility class that keeps track of all duplicated strings, and cleans them up in its
+    // destructor, unless they are released. Basically a RAII-solution to deal with exceptions
+    // along the way.
+    class strdup_guard {
+    public:
+        strdup_guard() = default;
+        strdup_guard(const strdup_guard &) = delete;
+        strdup_guard &operator=(const strdup_guard &) = delete;
+
+        ~strdup_guard() {
+            for (auto *s : strings) {
+                std::free(s);
+            }
+        }
+        char *operator()(const char *s) {
+            auto *t = PYBIND11_COMPAT_STRDUP(s);
+            strings.push_back(t);
+            return t;
+        }
+        void release() { strings.clear(); }
+
+    private:
+        std::vector<char *> strings;
+    };
+
+    /// Register a function call with Python (generic non-templated code goes here)
+    void initialize_generic(unique_function_record &&unique_rec,
+                            const char *text,
+                            const std::type_info *const *types,
+                            size_t args) {
+        // Do NOT receive `unique_rec` by value. If this function fails to move out the unique_ptr,
+        // we do not want this to destruct the pointer. `initialize` (the caller) still relies on
+        // the pointee being alive after this call. Only move out if a `capsule` is going to keep
+        // it alive.
+        auto *rec = unique_rec.get();
+
+        // Keep track of strdup'ed strings, and clean them up as long as the function's capsule
+        // has not taken ownership yet (when `unique_rec.release()` is called).
+        // Note: This cannot easily be fixed by a `unique_ptr` with custom deleter, because the
+        // strings are only referenced before strdup'ing. So only *after* the following block could
+        // `destruct` safely be called, but even then, `repr` could still throw in the middle of
+        // copying all strings.
+        strdup_guard guarded_strdup;
+
+        /* Create copies of all referenced C-style strings */
+        rec->name = guarded_strdup(rec->name ? rec->name : "");
+        if (rec->doc) {
+            rec->doc = guarded_strdup(rec->doc);
+        }
+        for (auto &a : rec->args) {
+            if (a.name) {
+                a.name = guarded_strdup(a.name);
+            }
+            if (a.descr) {
+                a.descr = guarded_strdup(a.descr);
+            } else if (a.value) {
+                a.descr = guarded_strdup(repr(a.value).cast<std::string>().c_str());
+            }
+        }
+
+        rec->is_constructor = (std::strcmp(rec->name, "__init__") == 0)
+                              || (std::strcmp(rec->name, "__setstate__") == 0);
+
+#if defined(PYBIND11_DETAILED_ERROR_MESSAGES) && !defined(PYBIND11_DISABLE_NEW_STYLE_INIT_WARNING)
+        if (rec->is_constructor && !rec->is_new_style_constructor) {
+            const auto class_name
+                = detail::get_fully_qualified_tp_name((PyTypeObject *) rec->scope.ptr());
+            const auto func_name = std::string(rec->name);
+            PyErr_WarnEx(PyExc_FutureWarning,
+                         ("pybind11-bound class '" + class_name
+                          + "' is using an old-style "
+                            "placement-new '"
+                          + func_name
+                          + "' which has been deprecated. See "
+                            "the upgrade guide in pybind11's docs. This message is only visible "
+                            "when compiled in debug mode.")
+                             .c_str(),
+                         0);
+        }
+#endif
+
+        /* Generate a proper function signature */
+        std::string signature;
+        size_t type_index = 0, arg_index = 0;
+        bool is_starred = false;
+        for (const auto *pc = text; *pc != '\0'; ++pc) {
+            const auto c = *pc;
+
+            if (c == '{') {
+                // Write arg name for everything except *args and **kwargs.
+                is_starred = *(pc + 1) == '*';
+                if (is_starred) {
+                    continue;
+                }
+                // Separator for keyword-only arguments, placed before the kw
+                // arguments start (unless we are already putting an *args)
+                if (!rec->has_args && arg_index == rec->nargs_pos) {
+                    signature += "*, ";
+                }
+                if (arg_index < rec->args.size() && rec->args[arg_index].name) {
+                    signature += rec->args[arg_index].name;
+                } else if (arg_index == 0 && rec->is_method) {
+                    signature += "self";
+                } else {
+                    signature += "arg" + std::to_string(arg_index - (rec->is_method ? 1 : 0));
+                }
+                signature += ": ";
+            } else if (c == '}') {
+                // Write default value if available.
+                if (!is_starred && arg_index < rec->args.size() && rec->args[arg_index].descr) {
+                    signature += " = ";
+                    signature += detail::replace_newlines_and_squash(rec->args[arg_index].descr);
+                }
+                // Separator for positional-only arguments (placed after the
+                // argument, rather than before like *
+                if (rec->nargs_pos_only > 0 && (arg_index + 1) == rec->nargs_pos_only) {
+                    signature += ", /";
+                }
+                if (!is_starred) {
+                    arg_index++;
+                }
+            } else if (c == '%') {
+                const std::type_info *t = types[type_index++];
+                if (!t) {
+                    pybind11_fail("Internal error while parsing type signature (1)");
+                }
+                if (auto *tinfo = detail::get_type_info(*t)) {
+                    handle th((PyObject *) tinfo->type);
+                    signature += th.attr("__module__").cast<std::string>() + "."
+                                 + th.attr("__qualname__").cast<std::string>();
+                } else if (rec->is_new_style_constructor && arg_index == 0) {
+                    // A new-style `__init__` takes `self` as `value_and_holder`.
+                    // Rewrite it to the proper class type.
+                    signature += rec->scope.attr("__module__").cast<std::string>() + "."
+                                 + rec->scope.attr("__qualname__").cast<std::string>();
+                } else {
+                    signature += detail::quote_cpp_type_name(detail::clean_type_id(t->name()));
+                }
+            } else {
+                signature += c;
+            }
+        }
+
+        if (arg_index != args - rec->has_args - rec->has_kwargs || types[type_index] != nullptr) {
+            pybind11_fail("Internal error while parsing type signature (2)");
+        }
+
+        rec->signature = guarded_strdup(signature.c_str());
+        rec->args.shrink_to_fit();
+        rec->nargs = (std::uint16_t) args;
+
+        if (rec->sibling && PYBIND11_INSTANCE_METHOD_CHECK(rec->sibling.ptr())) {
+            rec->sibling = PYBIND11_INSTANCE_METHOD_GET_FUNCTION(rec->sibling.ptr());
+        }
+
+        detail::function_record *chain = nullptr, *chain_start = rec;
+        if (rec->sibling) {
+            if (PyCFunction_Check(rec->sibling.ptr())) {
+                auto *self = PyCFunction_GET_SELF(rec->sibling.ptr());
+                if (!isinstance<capsule>(self)) {
+                    chain = nullptr;
+                } else {
+                    auto rec_capsule = reinterpret_borrow<capsule>(self);
+                    if (detail::is_function_record_capsule(rec_capsule)) {
+                        chain = rec_capsule.get_pointer<detail::function_record>();
+                        /* Never append a method to an overload chain of a parent class;
+                           instead, hide the parent's overloads in this case */
+                        if (!chain->scope.is(rec->scope)) {
+                            chain = nullptr;
+                        }
+                    } else {
+                        chain = nullptr;
+                    }
+                }
+            }
+            // Don't trigger for things like the default __init__, which are wrapper_descriptors
+            // that we are intentionally replacing
+            else if (!rec->sibling.is_none() && rec->name[0] != '_') {
+                pybind11_fail("Cannot overload existing non-function object \""
+                              + std::string(rec->name) + "\" with a function of the same name");
+            }
+        }
+
+        if (!chain) {
+            /* No existing overload was found, create a new function object */
+            rec->def = new PyMethodDef();
+            std::memset(rec->def, 0, sizeof(PyMethodDef));
+            rec->def->ml_name = rec->name;
+            rec->def->ml_meth
+                = reinterpret_cast<PyCFunction>(reinterpret_cast<void (*)()>(dispatcher));
+            rec->def->ml_flags = METH_VARARGS | METH_KEYWORDS;
+
+            capsule rec_capsule(unique_rec.release(),
+                                detail::get_function_record_capsule_name(),
+                                [](void *ptr) { destruct((detail::function_record *) ptr); });
+            guarded_strdup.release();
+
+            object scope_module;
+            if (rec->scope) {
+                if (hasattr(rec->scope, "__module__")) {
+                    scope_module = rec->scope.attr("__module__");
+                } else if (hasattr(rec->scope, "__name__")) {
+                    scope_module = rec->scope.attr("__name__");
+                }
+            }
+
+            m_ptr = PyCFunction_NewEx(rec->def, rec_capsule.ptr(), scope_module.ptr());
+            if (!m_ptr) {
+                pybind11_fail("cpp_function::cpp_function(): Could not allocate function object");
+            }
+        } else {
+            /* Append at the beginning or end of the overload chain */
+            m_ptr = rec->sibling.ptr();
+            inc_ref();
+            if (chain->is_method != rec->is_method) {
+                pybind11_fail(
+                    "overloading a method with both static and instance methods is not supported; "
+#if !defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+                    "#define PYBIND11_DETAILED_ERROR_MESSAGES or compile in debug mode for more "
+                    "details"
+#else
+                    "error while attempting to bind "
+                    + std::string(rec->is_method ? "instance" : "static") + " method "
+                    + std::string(pybind11::str(rec->scope.attr("__name__"))) + "."
+                    + std::string(rec->name) + signature
+#endif
+                );
+            }
+
+            if (rec->prepend) {
+                // Beginning of chain; we need to replace the capsule's current head-of-the-chain
+                // pointer with this one, then make this one point to the previous head of the
+                // chain.
+                chain_start = rec;
+                rec->next = chain;
+                auto rec_capsule
+                    = reinterpret_borrow<capsule>(((PyCFunctionObject *) m_ptr)->m_self);
+                rec_capsule.set_pointer(unique_rec.release());
+                guarded_strdup.release();
+            } else {
+                // Or end of chain (normal behavior)
+                chain_start = chain;
+                while (chain->next) {
+                    chain = chain->next;
+                }
+                chain->next = unique_rec.release();
+                guarded_strdup.release();
+            }
+        }
+
+        std::string signatures;
+        int index = 0;
+        /* Create a nice pydoc rec including all signatures and
+           docstrings of the functions in the overload chain */
+        if (chain && options::show_function_signatures()) {
+            // First a generic signature
+            signatures += rec->name;
+            signatures += "(*args, **kwargs)\n";
+            signatures += "Overloaded function.\n\n";
+        }
+        // Then specific overload signatures
+        bool first_user_def = true;
+        for (auto *it = chain_start; it != nullptr; it = it->next) {
+            if (options::show_function_signatures()) {
+                if (index > 0) {
+                    signatures += '\n';
+                }
+                if (chain) {
+                    signatures += std::to_string(++index) + ". ";
+                }
+                signatures += rec->name;
+                signatures += it->signature;
+                signatures += '\n';
+            }
+            if (it->doc && it->doc[0] != '\0' && options::show_user_defined_docstrings()) {
+                // If we're appending another docstring, and aren't printing function signatures,
+                // we need to append a newline first:
+                if (!options::show_function_signatures()) {
+                    if (first_user_def) {
+                        first_user_def = false;
+                    } else {
+                        signatures += '\n';
+                    }
+                }
+                if (options::show_function_signatures()) {
+                    signatures += '\n';
+                }
+                signatures += it->doc;
+                if (options::show_function_signatures()) {
+                    signatures += '\n';
+                }
+            }
+        }
+
+        /* Install docstring */
+        auto *func = (PyCFunctionObject *) m_ptr;
+        std::free(const_cast<char *>(func->m_ml->ml_doc));
+        // Install docstring if it's non-empty (when at least one option is enabled)
+        func->m_ml->ml_doc
+            = signatures.empty() ? nullptr : PYBIND11_COMPAT_STRDUP(signatures.c_str());
+
+        if (rec->is_method) {
+            m_ptr = PYBIND11_INSTANCE_METHOD_NEW(m_ptr, rec->scope.ptr());
+            if (!m_ptr) {
+                pybind11_fail(
+                    "cpp_function::cpp_function(): Could not allocate instance method object");
+            }
+            Py_DECREF(func);
+        }
+    }
+
+    /// When a cpp_function is GCed, release any memory allocated by pybind11
+    static void destruct(detail::function_record *rec, bool free_strings = true) {
+// If on Python 3.9, check the interpreter "MICRO" (patch) version.
+// If this is running on 3.9.0, we have to work around a bug.
+#if !defined(PYPY_VERSION) && PY_MAJOR_VERSION == 3 && PY_MINOR_VERSION == 9
+        static bool is_zero = Py_GetVersion()[4] == '0';
+#endif
+
+        while (rec) {
+            detail::function_record *next = rec->next;
+            if (rec->free_data) {
+                rec->free_data(rec);
+            }
+            // During initialization, these strings might not have been copied yet,
+            // so they cannot be freed. Once the function has been created, they can.
+            // Check `make_function_record` for more details.
+            if (free_strings) {
+                std::free((char *) rec->name);
+                std::free((char *) rec->doc);
+                std::free((char *) rec->signature);
+                for (auto &arg : rec->args) {
+                    std::free(const_cast<char *>(arg.name));
+                    std::free(const_cast<char *>(arg.descr));
+                }
+            }
+            for (auto &arg : rec->args) {
+                arg.value.dec_ref();
+            }
+            if (rec->def) {
+                std::free(const_cast<char *>(rec->def->ml_doc));
+// Python 3.9.0 decref's these in the wrong order; rec->def
+// If loaded on 3.9.0, let these leak (use Python 3.9.1 at runtime to fix)
+// See https://github.com/python/cpython/pull/22670
+#if !defined(PYPY_VERSION) && PY_MAJOR_VERSION == 3 && PY_MINOR_VERSION == 9
+                if (!is_zero) {
+                    delete rec->def;
+                }
+#else
+                delete rec->def;
+#endif
+            }
+            delete rec;
+            rec = next;
+        }
+    }
+
+    /// Main dispatch logic for calls to functions bound using pybind11
+    static PyObject *dispatcher(PyObject *self, PyObject *args_in, PyObject *kwargs_in) {
+        using namespace detail;
+        assert(isinstance<capsule>(self));
+
+        /* Iterator over the list of potentially admissible overloads */
+        const function_record *overloads = reinterpret_cast<function_record *>(
+                                  PyCapsule_GetPointer(self, get_function_record_capsule_name())),
+                              *current_overload = overloads;
+        assert(overloads != nullptr);
+
+        /* Need to know how many arguments + keyword arguments there are to pick the right
+           overload */
+        const auto n_args_in = (size_t) PyTuple_GET_SIZE(args_in);
+
+        handle parent = n_args_in > 0 ? PyTuple_GET_ITEM(args_in, 0) : nullptr,
+               result = PYBIND11_TRY_NEXT_OVERLOAD;
+
+        auto self_value_and_holder = value_and_holder();
+        if (overloads->is_constructor) {
+            if (!parent
+                || !PyObject_TypeCheck(parent.ptr(), (PyTypeObject *) overloads->scope.ptr())) {
+                set_error(PyExc_TypeError,
+                          "__init__(self, ...) called with invalid or missing `self` argument");
+                return nullptr;
+            }
+
+            auto *const tinfo = get_type_info((PyTypeObject *) overloads->scope.ptr());
+            auto *const pi = reinterpret_cast<instance *>(parent.ptr());
+            self_value_and_holder = pi->get_value_and_holder(tinfo, true);
+
+            // If this value is already registered it must mean __init__ is invoked multiple times;
+            // we really can't support that in C++, so just ignore the second __init__.
+            if (self_value_and_holder.instance_registered()) {
+                return none().release().ptr();
+            }
+        }
+
+        try {
+            // We do this in two passes: in the first pass, we load arguments with `convert=false`;
+            // in the second, we allow conversion (except for arguments with an explicit
+            // py::arg().noconvert()).  This lets us prefer calls without conversion, with
+            // conversion as a fallback.
+            std::vector<function_call> second_pass;
+
+            // However, if there are no overloads, we can just skip the no-convert pass entirely
+            const bool overloaded
+                = current_overload != nullptr && current_overload->next != nullptr;
+
+            for (; current_overload != nullptr; current_overload = current_overload->next) {
+
+                /* For each overload:
+                   1. Copy all positional arguments we were given, also checking to make sure that
+                      named positional arguments weren't *also* specified via kwarg.
+                   2. If we weren't given enough, try to make up the omitted ones by checking
+                      whether they were provided by a kwarg matching the `py::arg("name")` name. If
+                      so, use it (and remove it from kwargs); if not, see if the function binding
+                      provided a default that we can use.
+                   3. Ensure that either all keyword arguments were "consumed", or that the
+                   function takes a kwargs argument to accept unconsumed kwargs.
+                   4. Any positional arguments still left get put into a tuple (for args), and any
+                      leftover kwargs get put into a dict.
+                   5. Pack everything into a vector; if we have py::args or py::kwargs, they are an
+                      extra tuple or dict at the end of the positional arguments.
+                   6. Call the function call dispatcher (function_record::impl)
+
+                   If one of these fail, move on to the next overload and keep trying until we get
+                   a result other than PYBIND11_TRY_NEXT_OVERLOAD.
+                 */
+
+                const function_record &func = *current_overload;
+                size_t num_args = func.nargs; // Number of positional arguments that we need
+                if (func.has_args) {
+                    --num_args; // (but don't count py::args
+                }
+                if (func.has_kwargs) {
+                    --num_args; //  or py::kwargs)
+                }
+                size_t pos_args = func.nargs_pos;
+
+                if (!func.has_args && n_args_in > pos_args) {
+                    continue; // Too many positional arguments for this overload
+                }
+
+                if (n_args_in < pos_args && func.args.size() < pos_args) {
+                    continue; // Not enough positional arguments given, and not enough defaults to
+                              // fill in the blanks
+                }
+
+                function_call call(func, parent);
+
+                // Protect std::min with parentheses
+                size_t args_to_copy = (std::min)(pos_args, n_args_in);
+                size_t args_copied = 0;
+
+                // 0. Inject new-style `self` argument
+                if (func.is_new_style_constructor) {
+                    // The `value` may have been preallocated by an old-style `__init__`
+                    // if it was a preceding candidate for overload resolution.
+                    if (self_value_and_holder) {
+                        self_value_and_holder.type->dealloc(self_value_and_holder);
+                    }
+
+                    call.init_self = PyTuple_GET_ITEM(args_in, 0);
+                    call.args.emplace_back(reinterpret_cast<PyObject *>(&self_value_and_holder));
+                    call.args_convert.push_back(false);
+                    ++args_copied;
+                }
+
+                // 1. Copy any position arguments given.
+                bool bad_arg = false;
+                for (; args_copied < args_to_copy; ++args_copied) {
+                    const argument_record *arg_rec
+                        = args_copied < func.args.size() ? &func.args[args_copied] : nullptr;
+                    if (kwargs_in && arg_rec && arg_rec->name
+                        && dict_getitemstring(kwargs_in, arg_rec->name)) {
+                        bad_arg = true;
+                        break;
+                    }
+
+                    handle arg(PyTuple_GET_ITEM(args_in, args_copied));
+                    if (arg_rec && !arg_rec->none && arg.is_none()) {
+                        bad_arg = true;
+                        break;
+                    }
+                    call.args.push_back(arg);
+                    call.args_convert.push_back(arg_rec ? arg_rec->convert : true);
+                }
+                if (bad_arg) {
+                    continue; // Maybe it was meant for another overload (issue #688)
+                }
+
+                // Keep track of how many position args we copied out in case we need to come back
+                // to copy the rest into a py::args argument.
+                size_t positional_args_copied = args_copied;
+
+                // We'll need to copy this if we steal some kwargs for defaults
+                dict kwargs = reinterpret_borrow<dict>(kwargs_in);
+
+                // 1.5. Fill in any missing pos_only args from defaults if they exist
+                if (args_copied < func.nargs_pos_only) {
+                    for (; args_copied < func.nargs_pos_only; ++args_copied) {
+                        const auto &arg_rec = func.args[args_copied];
+                        handle value;
+
+                        if (arg_rec.value) {
+                            value = arg_rec.value;
+                        }
+                        if (value) {
+                            call.args.push_back(value);
+                            call.args_convert.push_back(arg_rec.convert);
+                        } else {
+                            break;
+                        }
+                    }
+
+                    if (args_copied < func.nargs_pos_only) {
+                        continue; // Not enough defaults to fill the positional arguments
+                    }
+                }
+
+                // 2. Check kwargs and, failing that, defaults that may help complete the list
+                if (args_copied < num_args) {
+                    bool copied_kwargs = false;
+
+                    for (; args_copied < num_args; ++args_copied) {
+                        const auto &arg_rec = func.args[args_copied];
+
+                        handle value;
+                        if (kwargs_in && arg_rec.name) {
+                            value = dict_getitemstring(kwargs.ptr(), arg_rec.name);
+                        }
+
+                        if (value) {
+                            // Consume a kwargs value
+                            if (!copied_kwargs) {
+                                kwargs = reinterpret_steal<dict>(PyDict_Copy(kwargs.ptr()));
+                                copied_kwargs = true;
+                            }
+                            if (PyDict_DelItemString(kwargs.ptr(), arg_rec.name) == -1) {
+                                throw error_already_set();
+                            }
+                        } else if (arg_rec.value) {
+                            value = arg_rec.value;
+                        }
+
+                        if (!arg_rec.none && value.is_none()) {
+                            break;
+                        }
+
+                        if (value) {
+                            // If we're at the py::args index then first insert a stub for it to be
+                            // replaced later
+                            if (func.has_args && call.args.size() == func.nargs_pos) {
+                                call.args.push_back(none());
+                            }
+
+                            call.args.push_back(value);
+                            call.args_convert.push_back(arg_rec.convert);
+                        } else {
+                            break;
+                        }
+                    }
+
+                    if (args_copied < num_args) {
+                        continue; // Not enough arguments, defaults, or kwargs to fill the
+                                  // positional arguments
+                    }
+                }
+
+                // 3. Check everything was consumed (unless we have a kwargs arg)
+                if (kwargs && !kwargs.empty() && !func.has_kwargs) {
+                    continue; // Unconsumed kwargs, but no py::kwargs argument to accept them
+                }
+
+                // 4a. If we have a py::args argument, create a new tuple with leftovers
+                if (func.has_args) {
+                    tuple extra_args;
+                    if (args_to_copy == 0) {
+                        // We didn't copy out any position arguments from the args_in tuple, so we
+                        // can reuse it directly without copying:
+                        extra_args = reinterpret_borrow<tuple>(args_in);
+                    } else if (positional_args_copied >= n_args_in) {
+                        extra_args = tuple(0);
+                    } else {
+                        size_t args_size = n_args_in - positional_args_copied;
+                        extra_args = tuple(args_size);
+                        for (size_t i = 0; i < args_size; ++i) {
+                            extra_args[i] = PyTuple_GET_ITEM(args_in, positional_args_copied + i);
+                        }
+                    }
+                    if (call.args.size() <= func.nargs_pos) {
+                        call.args.push_back(extra_args);
+                    } else {
+                        call.args[func.nargs_pos] = extra_args;
+                    }
+                    call.args_convert.push_back(false);
+                    call.args_ref = std::move(extra_args);
+                }
+
+                // 4b. If we have a py::kwargs, pass on any remaining kwargs
+                if (func.has_kwargs) {
+                    if (!kwargs.ptr()) {
+                        kwargs = dict(); // If we didn't get one, send an empty one
+                    }
+                    call.args.push_back(kwargs);
+                    call.args_convert.push_back(false);
+                    call.kwargs_ref = std::move(kwargs);
+                }
+
+// 5. Put everything in a vector.  Not technically step 5, we've been building it
+// in `call.args` all along.
+#if defined(PYBIND11_DETAILED_ERROR_MESSAGES)
+                if (call.args.size() != func.nargs || call.args_convert.size() != func.nargs) {
+                    pybind11_fail("Internal error: function call dispatcher inserted wrong number "
+                                  "of arguments!");
+                }
+#endif
+
+                std::vector<bool> second_pass_convert;
+                if (overloaded) {
+                    // We're in the first no-convert pass, so swap out the conversion flags for a
+                    // set of all-false flags.  If the call fails, we'll swap the flags back in for
+                    // the conversion-allowed call below.
+                    second_pass_convert.resize(func.nargs, false);
+                    call.args_convert.swap(second_pass_convert);
+                }
+
+                // 6. Call the function.
+                try {
+                    loader_life_support guard{};
+                    result = func.impl(call);
+                } catch (reference_cast_error &) {
+                    result = PYBIND11_TRY_NEXT_OVERLOAD;
+                }
+
+                if (result.ptr() != PYBIND11_TRY_NEXT_OVERLOAD) {
+                    break;
+                }
+
+                if (overloaded) {
+                    // The (overloaded) call failed; if the call has at least one argument that
+                    // permits conversion (i.e. it hasn't been explicitly specified `.noconvert()`)
+                    // then add this call to the list of second pass overloads to try.
+                    for (size_t i = func.is_method ? 1 : 0; i < pos_args; i++) {
+                        if (second_pass_convert[i]) {
+                            // Found one: swap the converting flags back in and store the call for
+                            // the second pass.
+                            call.args_convert.swap(second_pass_convert);
+                            second_pass.push_back(std::move(call));
+                            break;
+                        }
+                    }
+                }
+            }
+
+            if (overloaded && !second_pass.empty() && result.ptr() == PYBIND11_TRY_NEXT_OVERLOAD) {
+                // The no-conversion pass finished without success, try again with conversion
+                // allowed
+                for (auto &call : second_pass) {
+                    try {
+                        loader_life_support guard{};
+                        result = call.func.impl(call);
+                    } catch (reference_cast_error &) {
+                        result = PYBIND11_TRY_NEXT_OVERLOAD;
+                    }
+
+                    if (result.ptr() != PYBIND11_TRY_NEXT_OVERLOAD) {
+                        // The error reporting logic below expects 'current_overload' to be valid,
+                        // as it would be if we'd encountered this failure in the first-pass loop.
+                        if (!result) {
+                            current_overload = &call.func;
+                        }
+                        break;
+                    }
+                }
+            }
+        } catch (error_already_set &e) {
+            e.restore();
+            return nullptr;
+#ifdef __GLIBCXX__
+        } catch (abi::__forced_unwind &) {
+            throw;
+#endif
+        } catch (...) {
+            /* When an exception is caught, give each registered exception
+               translator a chance to translate it to a Python exception. First
+               all module-local translators will be tried in reverse order of
+               registration. If none of the module-locale translators handle
+               the exception (or there are no module-locale translators) then
+               the global translators will be tried, also in reverse order of
+               registration.
+
+               A translator may choose to do one of the following:
+
+                - catch the exception and call py::set_error()
+                  to set a standard (or custom) Python exception, or
+                - do nothing and let the exception fall through to the next translator, or
+                - delegate translation to the next translator by throwing a new type of exception.
+             */
+
+            bool handled = with_internals([&](internals &internals) {
+                auto &local_exception_translators
+                    = get_local_internals().registered_exception_translators;
+                if (detail::apply_exception_translators(local_exception_translators)) {
+                    return true;
+                }
+                auto &exception_translators = internals.registered_exception_translators;
+                if (detail::apply_exception_translators(exception_translators)) {
+                    return true;
+                }
+                return false;
+            });
+
+            if (handled) {
+                return nullptr;
+            }
+
+            set_error(PyExc_SystemError, "Exception escaped from default exception translator!");
+            return nullptr;
+        }
+
+        auto append_note_if_missing_header_is_suspected = [](std::string &msg) {
+            if (msg.find("std::") != std::string::npos) {
+                msg += "\n\n"
+                       "Did you forget to `#include <pybind11/stl.h>`? Or <pybind11/complex.h>,\n"
+                       "<pybind11/functional.h>, <pybind11/chrono.h>, etc. Some automatic\n"
+                       "conversions are optional and require extra headers to be included\n"
+                       "when compiling your pybind11 module.";
+            }
+        };
+
+        if (result.ptr() == PYBIND11_TRY_NEXT_OVERLOAD) {
+            if (overloads->is_operator) {
+                return handle(Py_NotImplemented).inc_ref().ptr();
+            }
+
+            std::string msg = std::string(overloads->name) + "(): incompatible "
+                              + std::string(overloads->is_constructor ? "constructor" : "function")
+                              + " arguments. The following argument types are supported:\n";
+
+            int ctr = 0;
+            for (const function_record *it2 = overloads; it2 != nullptr; it2 = it2->next) {
+                msg += "    " + std::to_string(++ctr) + ". ";
+
+                bool wrote_sig = false;
+                if (overloads->is_constructor) {
+                    // For a constructor, rewrite `(self: Object, arg0, ...) -> NoneType` as
+                    // `Object(arg0, ...)`
+                    std::string sig = it2->signature;
+                    size_t start = sig.find('(') + 7; // skip "(self: "
+                    if (start < sig.size()) {
+                        // End at the , for the next argument
+                        size_t end = sig.find(", "), next = end + 2;
+                        size_t ret = sig.rfind(" -> ");
+                        // Or the ), if there is no comma:
+                        if (end >= sig.size()) {
+                            next = end = sig.find(')');
+                        }
+                        if (start < end && next < sig.size()) {
+                            msg.append(sig, start, end - start);
+                            msg += '(';
+                            msg.append(sig, next, ret - next);
+                            wrote_sig = true;
+                        }
+                    }
+                }
+                if (!wrote_sig) {
+                    msg += it2->signature;
+                }
+
+                msg += '\n';
+            }
+            msg += "\nInvoked with: ";
+            auto args_ = reinterpret_borrow<tuple>(args_in);
+            bool some_args = false;
+            for (size_t ti = overloads->is_constructor ? 1 : 0; ti < args_.size(); ++ti) {
+                if (!some_args) {
+                    some_args = true;
+                } else {
+                    msg += ", ";
+                }
+                try {
+                    msg += pybind11::repr(args_[ti]);
+                } catch (const error_already_set &) {
+                    msg += "<repr raised Error>";
+                }
+            }
+            if (kwargs_in) {
+                auto kwargs = reinterpret_borrow<dict>(kwargs_in);
+                if (!kwargs.empty()) {
+                    if (some_args) {
+                        msg += "; ";
+                    }
+                    msg += "kwargs: ";
+                    bool first = true;
+                    for (const auto &kwarg : kwargs) {
+                        if (first) {
+                            first = false;
+                        } else {
+                            msg += ", ";
+                        }
+                        msg += pybind11::str("{}=").format(kwarg.first);
+                        try {
+                            msg += pybind11::repr(kwarg.second);
+                        } catch (const error_already_set &) {
+                            msg += "<repr raised Error>";
+                        }
+                    }
+                }
+            }
+
+            append_note_if_missing_header_is_suspected(msg);
+            // Attach additional error info to the exception if supported
+            if (PyErr_Occurred()) {
+                // #HelpAppreciated: unit test coverage for this branch.
+                raise_from(PyExc_TypeError, msg.c_str());
+                return nullptr;
+            }
+            set_error(PyExc_TypeError, msg.c_str());
+            return nullptr;
+        }
+        if (!result) {
+            std::string msg = "Unable to convert function return value to a "
+                              "Python type! The signature was\n\t";
+            assert(current_overload != nullptr);
+            msg += current_overload->signature;
+            append_note_if_missing_header_is_suspected(msg);
+            // Attach additional error info to the exception if supported
+            if (PyErr_Occurred()) {
+                raise_from(PyExc_TypeError, msg.c_str());
+                return nullptr;
+            }
+            set_error(PyExc_TypeError, msg.c_str());
+            return nullptr;
+        }
+        if (overloads->is_constructor && !self_value_and_holder.holder_constructed()) {
+            auto *pi = reinterpret_cast<instance *>(parent.ptr());
+            self_value_and_holder.type->init_instance(pi, nullptr);
+        }
+        return result.ptr();
+    }
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <>
+struct handle_type_name<cpp_function> {
+    static constexpr auto name = const_name("Callable");
+};
+
+PYBIND11_NAMESPACE_END(detail)
+
+// Use to activate Py_MOD_GIL_NOT_USED.
+class mod_gil_not_used {
+public:
+    explicit mod_gil_not_used(bool flag = true) : flag_(flag) {}
+    bool flag() const { return flag_; }
+
+private:
+    bool flag_;
+};
+
+/// Wrapper for Python extension modules
+class module_ : public object {
+public:
+    PYBIND11_OBJECT_DEFAULT(module_, object, PyModule_Check)
+
+    /// Create a new top-level Python module with the given name and docstring
+    PYBIND11_DEPRECATED("Use PYBIND11_MODULE or module_::create_extension_module instead")
+    explicit module_(const char *name, const char *doc = nullptr) {
+        *this = create_extension_module(name, doc, new PyModuleDef());
+    }
+
+    /** \rst
+        Create Python binding for a new function within the module scope. ``Func``
+        can be a plain C++ function, a function pointer, or a lambda function. For
+        details on the ``Extra&& ... extra`` argument, see section :ref:`extras`.
+    \endrst */
+    template <typename Func, typename... Extra>
+    module_ &def(const char *name_, Func &&f, const Extra &...extra) {
+        cpp_function func(std::forward<Func>(f),
+                          name(name_),
+                          scope(*this),
+                          sibling(getattr(*this, name_, none())),
+                          extra...);
+        // NB: allow overwriting here because cpp_function sets up a chain with the intention of
+        // overwriting (and has already checked internally that it isn't overwriting
+        // non-functions).
+        add_object(name_, func, true /* overwrite */);
+        return *this;
+    }
+
+    /** \rst
+        Create and return a new Python submodule with the given name and docstring.
+        This also works recursively, i.e.
+
+        .. code-block:: cpp
+
+            py::module_ m("example", "pybind11 example plugin");
+            py::module_ m2 = m.def_submodule("sub", "A submodule of 'example'");
+            py::module_ m3 = m2.def_submodule("subsub", "A submodule of 'example.sub'");
+    \endrst */
+    module_ def_submodule(const char *name, const char *doc = nullptr) {
+        const char *this_name = PyModule_GetName(m_ptr);
+        if (this_name == nullptr) {
+            throw error_already_set();
+        }
+        std::string full_name = std::string(this_name) + '.' + name;
+        handle submodule = PyImport_AddModule(full_name.c_str());
+        if (!submodule) {
+            throw error_already_set();
+        }
+        auto result = reinterpret_borrow<module_>(submodule);
+        if (doc && options::show_user_defined_docstrings()) {
+            result.attr("__doc__") = pybind11::str(doc);
+        }
+        attr(name) = result;
+        return result;
+    }
+
+    /// Import and return a module or throws `error_already_set`.
+    static module_ import(const char *name) {
+        PyObject *obj = PyImport_ImportModule(name);
+        if (!obj) {
+            throw error_already_set();
+        }
+        return reinterpret_steal<module_>(obj);
+    }
+
+    /// Reload the module or throws `error_already_set`.
+    void reload() {
+        PyObject *obj = PyImport_ReloadModule(ptr());
+        if (!obj) {
+            throw error_already_set();
+        }
+        *this = reinterpret_steal<module_>(obj);
+    }
+
+    /** \rst
+        Adds an object to the module using the given name.  Throws if an object with the given name
+        already exists.
+
+        ``overwrite`` should almost always be false: attempting to overwrite objects that pybind11
+        has established will, in most cases, break things.
+    \endrst */
+    PYBIND11_NOINLINE void add_object(const char *name, handle obj, bool overwrite = false) {
+        if (!overwrite && hasattr(*this, name)) {
+            pybind11_fail(
+                "Error during initialization: multiple incompatible definitions with name \""
+                + std::string(name) + "\"");
+        }
+
+        PyModule_AddObject(ptr(), name, obj.inc_ref().ptr() /* steals a reference */);
+    }
+
+    using module_def = PyModuleDef; // TODO: Can this be removed (it was needed only for Python 2)?
+
+    /** \rst
+        Create a new top-level module that can be used as the main module of a C extension.
+
+        ``def`` should point to a statically allocated module_def.
+    \endrst */
+    static module_ create_extension_module(const char *name,
+                                           const char *doc,
+                                           module_def *def,
+                                           mod_gil_not_used gil_not_used
+                                           = mod_gil_not_used(false)) {
+        // module_def is PyModuleDef
+        // Placement new (not an allocation).
+        def = new (def)
+            PyModuleDef{/* m_base */ PyModuleDef_HEAD_INIT,
+                        /* m_name */ name,
+                        /* m_doc */ options::show_user_defined_docstrings() ? doc : nullptr,
+                        /* m_size */ -1,
+                        /* m_methods */ nullptr,
+                        /* m_slots */ nullptr,
+                        /* m_traverse */ nullptr,
+                        /* m_clear */ nullptr,
+                        /* m_free */ nullptr};
+        auto *m = PyModule_Create(def);
+        if (m == nullptr) {
+            if (PyErr_Occurred()) {
+                throw error_already_set();
+            }
+            pybind11_fail("Internal error in module_::create_extension_module()");
+        }
+        if (gil_not_used.flag()) {
+#ifdef Py_GIL_DISABLED
+            PyUnstable_Module_SetGIL(m, Py_MOD_GIL_NOT_USED);
+#endif
+        }
+        // TODO: Should be reinterpret_steal for Python 3, but Python also steals it again when
+        //       returned from PyInit_...
+        //       For Python 2, reinterpret_borrow was correct.
+        return reinterpret_borrow<module_>(m);
+    }
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <>
+struct handle_type_name<module_> {
+    static constexpr auto name = const_name("module");
+};
+
+PYBIND11_NAMESPACE_END(detail)
+
+// When inside a namespace (or anywhere as long as it's not the first item on a line),
+// C++20 allows "module" to be used. This is provided for backward compatibility, and for
+// simplicity, if someone wants to use py::module for example, that is perfectly safe.
+using module = module_;
+
+/// \ingroup python_builtins
+/// Return a dictionary representing the global variables in the current execution frame,
+/// or ``__main__.__dict__`` if there is no frame (usually when the interpreter is embedded).
+inline dict globals() {
+#if PY_VERSION_HEX >= 0x030d0000
+    PyObject *p = PyEval_GetFrameGlobals();
+    return p ? reinterpret_steal<dict>(p)
+             : reinterpret_borrow<dict>(module_::import("__main__").attr("__dict__").ptr());
+#else
+    PyObject *p = PyEval_GetGlobals();
+    return reinterpret_borrow<dict>(p ? p : module_::import("__main__").attr("__dict__").ptr());
+#endif
+}
+
+template <typename... Args, typename = detail::enable_if_t<args_are_all_keyword_or_ds<Args...>()>>
+PYBIND11_DEPRECATED("make_simple_namespace should be replaced with "
+                    "py::module_::import(\"types\").attr(\"SimpleNamespace\") ")
+object make_simple_namespace(Args &&...args_) {
+    return module_::import("types").attr("SimpleNamespace")(std::forward<Args>(args_)...);
+}
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+/// Generic support for creating new Python heap types
+class generic_type : public object {
+public:
+    PYBIND11_OBJECT_DEFAULT(generic_type, object, PyType_Check)
+protected:
+    void initialize(const type_record &rec) {
+        if (rec.scope && hasattr(rec.scope, "__dict__")
+            && rec.scope.attr("__dict__").contains(rec.name)) {
+            pybind11_fail("generic_type: cannot initialize type \"" + std::string(rec.name)
+                          + "\": an object with that name is already defined");
+        }
+
+        if ((rec.module_local ? get_local_type_info(*rec.type) : get_global_type_info(*rec.type))
+            != nullptr) {
+            pybind11_fail("generic_type: type \"" + std::string(rec.name)
+                          + "\" is already registered!");
+        }
+
+        m_ptr = make_new_python_type(rec);
+
+        /* Register supplemental type information in C++ dict */
+        auto *tinfo = new detail::type_info();
+        tinfo->type = (PyTypeObject *) m_ptr;
+        tinfo->cpptype = rec.type;
+        tinfo->type_size = rec.type_size;
+        tinfo->type_align = rec.type_align;
+        tinfo->operator_new = rec.operator_new;
+        tinfo->holder_size_in_ptrs = size_in_ptrs(rec.holder_size);
+        tinfo->init_instance = rec.init_instance;
+        tinfo->dealloc = rec.dealloc;
+        tinfo->simple_type = true;
+        tinfo->simple_ancestors = true;
+        tinfo->default_holder = rec.default_holder;
+        tinfo->module_local = rec.module_local;
+
+        with_internals([&](internals &internals) {
+            auto tindex = std::type_index(*rec.type);
+            tinfo->direct_conversions = &internals.direct_conversions[tindex];
+            if (rec.module_local) {
+                get_local_internals().registered_types_cpp[tindex] = tinfo;
+            } else {
+                internals.registered_types_cpp[tindex] = tinfo;
+            }
+            internals.registered_types_py[(PyTypeObject *) m_ptr] = {tinfo};
+        });
+
+        if (rec.bases.size() > 1 || rec.multiple_inheritance) {
+            mark_parents_nonsimple(tinfo->type);
+            tinfo->simple_ancestors = false;
+        } else if (rec.bases.size() == 1) {
+            auto *parent_tinfo = get_type_info((PyTypeObject *) rec.bases[0].ptr());
+            assert(parent_tinfo != nullptr);
+            bool parent_simple_ancestors = parent_tinfo->simple_ancestors;
+            tinfo->simple_ancestors = parent_simple_ancestors;
+            // The parent can no longer be a simple type if it has MI and has a child
+            parent_tinfo->simple_type = parent_tinfo->simple_type && parent_simple_ancestors;
+        }
+
+        if (rec.module_local) {
+            // Stash the local typeinfo and loader so that external modules can access it.
+            tinfo->module_local_load = &type_caster_generic::local_load;
+            setattr(m_ptr, PYBIND11_MODULE_LOCAL_ID, capsule(tinfo));
+        }
+    }
+
+    /// Helper function which tags all parents of a type using mult. inheritance
+    void mark_parents_nonsimple(PyTypeObject *value) {
+        auto t = reinterpret_borrow<tuple>(value->tp_bases);
+        for (handle h : t) {
+            auto *tinfo2 = get_type_info((PyTypeObject *) h.ptr());
+            if (tinfo2) {
+                tinfo2->simple_type = false;
+            }
+            mark_parents_nonsimple((PyTypeObject *) h.ptr());
+        }
+    }
+
+    void install_buffer_funcs(buffer_info *(*get_buffer)(PyObject *, void *),
+                              void *get_buffer_data) {
+        auto *type = (PyHeapTypeObject *) m_ptr;
+        auto *tinfo = detail::get_type_info(&type->ht_type);
+
+        if (!type->ht_type.tp_as_buffer) {
+            pybind11_fail("To be able to register buffer protocol support for the type '"
+                          + get_fully_qualified_tp_name(tinfo->type)
+                          + "' the associated class<>(..) invocation must "
+                            "include the pybind11::buffer_protocol() annotation!");
+        }
+
+        tinfo->get_buffer = get_buffer;
+        tinfo->get_buffer_data = get_buffer_data;
+    }
+
+    // rec_func must be set for either fget or fset.
+    void def_property_static_impl(const char *name,
+                                  handle fget,
+                                  handle fset,
+                                  detail::function_record *rec_func) {
+        const auto is_static = (rec_func != nullptr) && !(rec_func->is_method && rec_func->scope);
+        const auto has_doc = (rec_func != nullptr) && (rec_func->doc != nullptr)
+                             && pybind11::options::show_user_defined_docstrings();
+        auto property = handle(
+            (PyObject *) (is_static ? get_internals().static_property_type : &PyProperty_Type));
+        attr(name) = property(fget.ptr() ? fget : none(),
+                              fset.ptr() ? fset : none(),
+                              /*deleter*/ none(),
+                              pybind11::str(has_doc ? rec_func->doc : ""));
+    }
+};
+
+/// Set the pointer to operator new if it exists. The cast is needed because it can be overloaded.
+template <typename T,
+          typename = void_t<decltype(static_cast<void *(*) (size_t)>(T::operator new))>>
+void set_operator_new(type_record *r) {
+    r->operator_new = &T::operator new;
+}
+
+template <typename>
+void set_operator_new(...) {}
+
+template <typename T, typename SFINAE = void>
+struct has_operator_delete : std::false_type {};
+template <typename T>
+struct has_operator_delete<T, void_t<decltype(static_cast<void (*)(void *)>(T::operator delete))>>
+    : std::true_type {};
+template <typename T, typename SFINAE = void>
+struct has_operator_delete_size : std::false_type {};
+template <typename T>
+struct has_operator_delete_size<
+    T,
+    void_t<decltype(static_cast<void (*)(void *, size_t)>(T::operator delete))>> : std::true_type {
+};
+/// Call class-specific delete if it exists or global otherwise. Can also be an overload set.
+template <typename T, enable_if_t<has_operator_delete<T>::value, int> = 0>
+void call_operator_delete(T *p, size_t, size_t) {
+    T::operator delete(p);
+}
+template <typename T,
+          enable_if_t<!has_operator_delete<T>::value && has_operator_delete_size<T>::value, int>
+          = 0>
+void call_operator_delete(T *p, size_t s, size_t) {
+    T::operator delete(p, s);
+}
+
+inline void call_operator_delete(void *p, size_t s, size_t a) {
+    (void) s;
+    (void) a;
+#if defined(__cpp_aligned_new) && (!defined(_MSC_VER) || _MSC_VER >= 1912)
+    if (a > __STDCPP_DEFAULT_NEW_ALIGNMENT__) {
+#    ifdef __cpp_sized_deallocation
+        ::operator delete(p, s, std::align_val_t(a));
+#    else
+        ::operator delete(p, std::align_val_t(a));
+#    endif
+        return;
+    }
+#endif
+#ifdef __cpp_sized_deallocation
+    ::operator delete(p, s);
+#else
+    ::operator delete(p);
+#endif
+}
+
+inline void add_class_method(object &cls, const char *name_, const cpp_function &cf) {
+    cls.attr(cf.name()) = cf;
+    if (std::strcmp(name_, "__eq__") == 0 && !cls.attr("__dict__").contains("__hash__")) {
+        cls.attr("__hash__") = none();
+    }
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+/// Given a pointer to a member function, cast it to its `Derived` version.
+/// Forward everything else unchanged.
+template <typename /*Derived*/, typename F>
+auto method_adaptor(F &&f) -> decltype(std::forward<F>(f)) {
+    return std::forward<F>(f);
+}
+
+template <typename Derived, typename Return, typename Class, typename... Args>
+auto method_adaptor(Return (Class::*pmf)(Args...)) -> Return (Derived::*)(Args...) {
+    static_assert(
+        detail::is_accessible_base_of<Class, Derived>::value,
+        "Cannot bind an inaccessible base class method; use a lambda definition instead");
+    return pmf;
+}
+
+template <typename Derived, typename Return, typename Class, typename... Args>
+auto method_adaptor(Return (Class::*pmf)(Args...) const) -> Return (Derived::*)(Args...) const {
+    static_assert(
+        detail::is_accessible_base_of<Class, Derived>::value,
+        "Cannot bind an inaccessible base class method; use a lambda definition instead");
+    return pmf;
+}
+
+template <typename type_, typename... options>
+class class_ : public detail::generic_type {
+    template <typename T>
+    using is_holder = detail::is_holder_type<type_, T>;
+    template <typename T>
+    using is_subtype = detail::is_strict_base_of<type_, T>;
+    template <typename T>
+    using is_base = detail::is_strict_base_of<T, type_>;
+    // struct instead of using here to help MSVC:
+    template <typename T>
+    struct is_valid_class_option : detail::any_of<is_holder<T>, is_subtype<T>, is_base<T>> {};
+
+public:
+    using type = type_;
+    using type_alias = detail::exactly_one_t<is_subtype, void, options...>;
+    constexpr static bool has_alias = !std::is_void<type_alias>::value;
+    using holder_type = detail::exactly_one_t<is_holder, std::unique_ptr<type>, options...>;
+
+    static_assert(detail::all_of<is_valid_class_option<options>...>::value,
+                  "Unknown/invalid class_ template parameters provided");
+
+    static_assert(!has_alias || std::is_polymorphic<type>::value,
+                  "Cannot use an alias class with a non-polymorphic type");
+
+    PYBIND11_OBJECT(class_, generic_type, PyType_Check)
+
+    template <typename... Extra>
+    class_(handle scope, const char *name, const Extra &...extra) {
+        using namespace detail;
+
+        // MI can only be specified via class_ template options, not constructor parameters
+        static_assert(
+            none_of<is_pyobject<Extra>...>::value || // no base class arguments, or:
+                (constexpr_sum(is_pyobject<Extra>::value...) == 1 && // Exactly one base
+                 constexpr_sum(is_base<options>::value...) == 0 &&   // no template option bases
+                 // no multiple_inheritance attr
+                 none_of<std::is_same<multiple_inheritance, Extra>...>::value),
+            "Error: multiple inheritance bases must be specified via class_ template options");
+
+        type_record record;
+        record.scope = scope;
+        record.name = name;
+        record.type = &typeid(type);
+        record.type_size = sizeof(conditional_t<has_alias, type_alias, type>);
+        record.type_align = alignof(conditional_t<has_alias, type_alias, type> &);
+        record.holder_size = sizeof(holder_type);
+        record.init_instance = init_instance;
+        record.dealloc = dealloc;
+        record.default_holder = detail::is_instantiation<std::unique_ptr, holder_type>::value;
+
+        set_operator_new<type>(&record);
+
+        /* Register base classes specified via template arguments to class_, if any */
+        PYBIND11_EXPAND_SIDE_EFFECTS(add_base<options>(record));
+
+        /* Process optional arguments, if any */
+        process_attributes<Extra...>::init(extra..., &record);
+
+        generic_type::initialize(record);
+
+        if (has_alias) {
+            with_internals([&](internals &internals) {
+                auto &instances = record.module_local ? get_local_internals().registered_types_cpp
+                                                      : internals.registered_types_cpp;
+                instances[std::type_index(typeid(type_alias))]
+                    = instances[std::type_index(typeid(type))];
+            });
+        }
+    }
+
+    template <typename Base, detail::enable_if_t<is_base<Base>::value, int> = 0>
+    static void add_base(detail::type_record &rec) {
+        rec.add_base(typeid(Base), [](void *src) -> void * {
+            return static_cast<Base *>(reinterpret_cast<type *>(src));
+        });
+    }
+
+    template <typename Base, detail::enable_if_t<!is_base<Base>::value, int> = 0>
+    static void add_base(detail::type_record &) {}
+
+    template <typename Func, typename... Extra>
+    class_ &def(const char *name_, Func &&f, const Extra &...extra) {
+        cpp_function cf(method_adaptor<type>(std::forward<Func>(f)),
+                        name(name_),
+                        is_method(*this),
+                        sibling(getattr(*this, name_, none())),
+                        extra...);
+        add_class_method(*this, name_, cf);
+        return *this;
+    }
+
+    template <typename Func, typename... Extra>
+    class_ &def_static(const char *name_, Func &&f, const Extra &...extra) {
+        static_assert(!std::is_member_function_pointer<Func>::value,
+                      "def_static(...) called with a non-static member function pointer");
+        cpp_function cf(std::forward<Func>(f),
+                        name(name_),
+                        scope(*this),
+                        sibling(getattr(*this, name_, none())),
+                        extra...);
+        auto cf_name = cf.name();
+        attr(std::move(cf_name)) = staticmethod(std::move(cf));
+        return *this;
+    }
+
+    template <typename T, typename... Extra, detail::enable_if_t<T::op_enable_if_hook, int> = 0>
+    class_ &def(const T &op, const Extra &...extra) {
+        op.execute(*this, extra...);
+        return *this;
+    }
+
+    template <typename T, typename... Extra, detail::enable_if_t<T::op_enable_if_hook, int> = 0>
+    class_ &def_cast(const T &op, const Extra &...extra) {
+        op.execute_cast(*this, extra...);
+        return *this;
+    }
+
+    template <typename... Args, typename... Extra>
+    class_ &def(const detail::initimpl::constructor<Args...> &init, const Extra &...extra) {
+        PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(init);
+        init.execute(*this, extra...);
+        return *this;
+    }
+
+    template <typename... Args, typename... Extra>
+    class_ &def(const detail::initimpl::alias_constructor<Args...> &init, const Extra &...extra) {
+        PYBIND11_WORKAROUND_INCORRECT_MSVC_C4100(init);
+        init.execute(*this, extra...);
+        return *this;
+    }
+
+    template <typename... Args, typename... Extra>
+    class_ &def(detail::initimpl::factory<Args...> &&init, const Extra &...extra) {
+        std::move(init).execute(*this, extra...);
+        return *this;
+    }
+
+    template <typename... Args, typename... Extra>
+    class_ &def(detail::initimpl::pickle_factory<Args...> &&pf, const Extra &...extra) {
+        std::move(pf).execute(*this, extra...);
+        return *this;
+    }
+
+    template <typename Func>
+    class_ &def_buffer(Func &&func) {
+        struct capture {
+            Func func;
+        };
+        auto *ptr = new capture{std::forward<Func>(func)};
+        install_buffer_funcs(
+            [](PyObject *obj, void *ptr) -> buffer_info * {
+                detail::make_caster<type> caster;
+                if (!caster.load(obj, false)) {
+                    return nullptr;
+                }
+                return new buffer_info(((capture *) ptr)->func(std::move(caster)));
+            },
+            ptr);
+        weakref(m_ptr, cpp_function([ptr](handle wr) {
+                    delete ptr;
+                    wr.dec_ref();
+                }))
+            .release();
+        return *this;
+    }
+
+    template <typename Return, typename Class, typename... Args>
+    class_ &def_buffer(Return (Class::*func)(Args...)) {
+        return def_buffer([func](type &obj) { return (obj.*func)(); });
+    }
+
+    template <typename Return, typename Class, typename... Args>
+    class_ &def_buffer(Return (Class::*func)(Args...) const) {
+        return def_buffer([func](const type &obj) { return (obj.*func)(); });
+    }
+
+    template <typename C, typename D, typename... Extra>
+    class_ &def_readwrite(const char *name, D C::*pm, const Extra &...extra) {
+        static_assert(std::is_same<C, type>::value || std::is_base_of<C, type>::value,
+                      "def_readwrite() requires a class member (or base class member)");
+        cpp_function fget([pm](const type &c) -> const D & { return c.*pm; }, is_method(*this)),
+            fset([pm](type &c, const D &value) { c.*pm = value; }, is_method(*this));
+        def_property(name, fget, fset, return_value_policy::reference_internal, extra...);
+        return *this;
+    }
+
+    template <typename C, typename D, typename... Extra>
+    class_ &def_readonly(const char *name, const D C::*pm, const Extra &...extra) {
+        static_assert(std::is_same<C, type>::value || std::is_base_of<C, type>::value,
+                      "def_readonly() requires a class member (or base class member)");
+        cpp_function fget([pm](const type &c) -> const D & { return c.*pm; }, is_method(*this));
+        def_property_readonly(name, fget, return_value_policy::reference_internal, extra...);
+        return *this;
+    }
+
+    template <typename D, typename... Extra>
+    class_ &def_readwrite_static(const char *name, D *pm, const Extra &...extra) {
+        cpp_function fget([pm](const object &) -> const D & { return *pm; }, scope(*this)),
+            fset([pm](const object &, const D &value) { *pm = value; }, scope(*this));
+        def_property_static(name, fget, fset, return_value_policy::reference, extra...);
+        return *this;
+    }
+
+    template <typename D, typename... Extra>
+    class_ &def_readonly_static(const char *name, const D *pm, const Extra &...extra) {
+        cpp_function fget([pm](const object &) -> const D & { return *pm; }, scope(*this));
+        def_property_readonly_static(name, fget, return_value_policy::reference, extra...);
+        return *this;
+    }
+
+    /// Uses return_value_policy::reference_internal by default
+    template <typename Getter, typename... Extra>
+    class_ &def_property_readonly(const char *name, const Getter &fget, const Extra &...extra) {
+        return def_property_readonly(name,
+                                     cpp_function(method_adaptor<type>(fget)),
+                                     return_value_policy::reference_internal,
+                                     extra...);
+    }
+
+    /// Uses cpp_function's return_value_policy by default
+    template <typename... Extra>
+    class_ &
+    def_property_readonly(const char *name, const cpp_function &fget, const Extra &...extra) {
+        return def_property(name, fget, nullptr, extra...);
+    }
+
+    /// Uses return_value_policy::reference by default
+    template <typename Getter, typename... Extra>
+    class_ &
+    def_property_readonly_static(const char *name, const Getter &fget, const Extra &...extra) {
+        return def_property_readonly_static(
+            name, cpp_function(fget), return_value_policy::reference, extra...);
+    }
+
+    /// Uses cpp_function's return_value_policy by default
+    template <typename... Extra>
+    class_ &def_property_readonly_static(const char *name,
+                                         const cpp_function &fget,
+                                         const Extra &...extra) {
+        return def_property_static(name, fget, nullptr, extra...);
+    }
+
+    /// Uses return_value_policy::reference_internal by default
+    template <typename Getter, typename Setter, typename... Extra>
+    class_ &
+    def_property(const char *name, const Getter &fget, const Setter &fset, const Extra &...extra) {
+        return def_property(
+            name, fget, cpp_function(method_adaptor<type>(fset), is_setter()), extra...);
+    }
+    template <typename Getter, typename... Extra>
+    class_ &def_property(const char *name,
+                         const Getter &fget,
+                         const cpp_function &fset,
+                         const Extra &...extra) {
+        return def_property(name,
+                            cpp_function(method_adaptor<type>(fget)),
+                            fset,
+                            return_value_policy::reference_internal,
+                            extra...);
+    }
+
+    /// Uses cpp_function's return_value_policy by default
+    template <typename... Extra>
+    class_ &def_property(const char *name,
+                         const cpp_function &fget,
+                         const cpp_function &fset,
+                         const Extra &...extra) {
+        return def_property_static(name, fget, fset, is_method(*this), extra...);
+    }
+
+    /// Uses return_value_policy::reference by default
+    template <typename Getter, typename... Extra>
+    class_ &def_property_static(const char *name,
+                                const Getter &fget,
+                                const cpp_function &fset,
+                                const Extra &...extra) {
+        return def_property_static(
+            name, cpp_function(fget), fset, return_value_policy::reference, extra...);
+    }
+
+    /// Uses cpp_function's return_value_policy by default
+    template <typename... Extra>
+    class_ &def_property_static(const char *name,
+                                const cpp_function &fget,
+                                const cpp_function &fset,
+                                const Extra &...extra) {
+        static_assert(0 == detail::constexpr_sum(std::is_base_of<arg, Extra>::value...),
+                      "Argument annotations are not allowed for properties");
+        auto rec_fget = get_function_record(fget), rec_fset = get_function_record(fset);
+        auto *rec_active = rec_fget;
+        if (rec_fget) {
+            char *doc_prev = rec_fget->doc; /* 'extra' field may include a property-specific
+                                               documentation string */
+            detail::process_attributes<Extra...>::init(extra..., rec_fget);
+            if (rec_fget->doc && rec_fget->doc != doc_prev) {
+                std::free(doc_prev);
+                rec_fget->doc = PYBIND11_COMPAT_STRDUP(rec_fget->doc);
+            }
+        }
+        if (rec_fset) {
+            char *doc_prev = rec_fset->doc;
+            detail::process_attributes<Extra...>::init(extra..., rec_fset);
+            if (rec_fset->doc && rec_fset->doc != doc_prev) {
+                std::free(doc_prev);
+                rec_fset->doc = PYBIND11_COMPAT_STRDUP(rec_fset->doc);
+            }
+            if (!rec_active) {
+                rec_active = rec_fset;
+            }
+        }
+        def_property_static_impl(name, fget, fset, rec_active);
+        return *this;
+    }
+
+private:
+    /// Initialize holder object, variant 1: object derives from enable_shared_from_this
+    template <typename T>
+    static void init_holder(detail::instance *inst,
+                            detail::value_and_holder &v_h,
+                            const holder_type * /* unused */,
+                            const std::enable_shared_from_this<T> * /* dummy */) {
+
+        auto sh = std::dynamic_pointer_cast<typename holder_type::element_type>(
+            detail::try_get_shared_from_this(v_h.value_ptr<type>()));
+        if (sh) {
+            new (std::addressof(v_h.holder<holder_type>())) holder_type(std::move(sh));
+            v_h.set_holder_constructed();
+        }
+
+        if (!v_h.holder_constructed() && inst->owned) {
+            new (std::addressof(v_h.holder<holder_type>())) holder_type(v_h.value_ptr<type>());
+            v_h.set_holder_constructed();
+        }
+    }
+
+    static void init_holder_from_existing(const detail::value_and_holder &v_h,
+                                          const holder_type *holder_ptr,
+                                          std::true_type /*is_copy_constructible*/) {
+        new (std::addressof(v_h.holder<holder_type>()))
+            holder_type(*reinterpret_cast<const holder_type *>(holder_ptr));
+    }
+
+    static void init_holder_from_existing(const detail::value_and_holder &v_h,
+                                          const holder_type *holder_ptr,
+                                          std::false_type /*is_copy_constructible*/) {
+        new (std::addressof(v_h.holder<holder_type>()))
+            holder_type(std::move(*const_cast<holder_type *>(holder_ptr)));
+    }
+
+    /// Initialize holder object, variant 2: try to construct from existing holder object, if
+    /// possible
+    static void init_holder(detail::instance *inst,
+                            detail::value_and_holder &v_h,
+                            const holder_type *holder_ptr,
+                            const void * /* dummy -- not enable_shared_from_this<T>) */) {
+        if (holder_ptr) {
+            init_holder_from_existing(v_h, holder_ptr, std::is_copy_constructible<holder_type>());
+            v_h.set_holder_constructed();
+        } else if (detail::always_construct_holder<holder_type>::value || inst->owned) {
+            new (std::addressof(v_h.holder<holder_type>())) holder_type(v_h.value_ptr<type>());
+            v_h.set_holder_constructed();
+        }
+    }
+
+    /// Performs instance initialization including constructing a holder and registering the known
+    /// instance.  Should be called as soon as the `type` value_ptr is set for an instance.  Takes
+    /// an optional pointer to an existing holder to use; if not specified and the instance is
+    /// `.owned`, a new holder will be constructed to manage the value pointer.
+    static void init_instance(detail::instance *inst, const void *holder_ptr) {
+        auto v_h = inst->get_value_and_holder(detail::get_type_info(typeid(type)));
+        if (!v_h.instance_registered()) {
+            register_instance(inst, v_h.value_ptr(), v_h.type);
+            v_h.set_instance_registered();
+        }
+        init_holder(inst, v_h, (const holder_type *) holder_ptr, v_h.value_ptr<type>());
+    }
+
+    /// Deallocates an instance; via holder, if constructed; otherwise via operator delete.
+    static void dealloc(detail::value_and_holder &v_h) {
+        // We could be deallocating because we are cleaning up after a Python exception.
+        // If so, the Python error indicator will be set. We need to clear that before
+        // running the destructor, in case the destructor code calls more Python.
+        // If we don't, the Python API will exit with an exception, and pybind11 will
+        // throw error_already_set from the C++ destructor which is forbidden and triggers
+        // std::terminate().
+        error_scope scope;
+        if (v_h.holder_constructed()) {
+            v_h.holder<holder_type>().~holder_type();
+            v_h.set_holder_constructed(false);
+        } else {
+            detail::call_operator_delete(
+                v_h.value_ptr<type>(), v_h.type->type_size, v_h.type->type_align);
+        }
+        v_h.value_ptr() = nullptr;
+    }
+
+    static detail::function_record *get_function_record(handle h) {
+        h = detail::get_function(h);
+        if (!h) {
+            return nullptr;
+        }
+
+        handle func_self = PyCFunction_GET_SELF(h.ptr());
+        if (!func_self) {
+            throw error_already_set();
+        }
+        if (!isinstance<capsule>(func_self)) {
+            return nullptr;
+        }
+        auto cap = reinterpret_borrow<capsule>(func_self);
+        if (!detail::is_function_record_capsule(cap)) {
+            return nullptr;
+        }
+        return cap.get_pointer<detail::function_record>();
+    }
+};
+
+/// Binds an existing constructor taking arguments Args...
+template <typename... Args>
+detail::initimpl::constructor<Args...> init() {
+    return {};
+}
+/// Like `init<Args...>()`, but the instance is always constructed through the alias class (even
+/// when not inheriting on the Python side).
+template <typename... Args>
+detail::initimpl::alias_constructor<Args...> init_alias() {
+    return {};
+}
+
+/// Binds a factory function as a constructor
+template <typename Func, typename Ret = detail::initimpl::factory<Func>>
+Ret init(Func &&f) {
+    return {std::forward<Func>(f)};
+}
+
+/// Dual-argument factory function: the first function is called when no alias is needed, the
+/// second when an alias is needed (i.e. due to python-side inheritance).  Arguments must be
+/// identical.
+template <typename CFunc, typename AFunc, typename Ret = detail::initimpl::factory<CFunc, AFunc>>
+Ret init(CFunc &&c, AFunc &&a) {
+    return {std::forward<CFunc>(c), std::forward<AFunc>(a)};
+}
+
+/// Binds pickling functions `__getstate__` and `__setstate__` and ensures that the type
+/// returned by `__getstate__` is the same as the argument accepted by `__setstate__`.
+template <typename GetState, typename SetState>
+detail::initimpl::pickle_factory<GetState, SetState> pickle(GetState &&g, SetState &&s) {
+    return {std::forward<GetState>(g), std::forward<SetState>(s)};
+}
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+inline str enum_name(handle arg) {
+    dict entries = arg.get_type().attr("__entries");
+    for (auto kv : entries) {
+        if (handle(kv.second[int_(0)]).equal(arg)) {
+            return pybind11::str(kv.first);
+        }
+    }
+    return "???";
+}
+
+struct enum_base {
+    enum_base(const handle &base, const handle &parent) : m_base(base), m_parent(parent) {}
+
+    PYBIND11_NOINLINE void init(bool is_arithmetic, bool is_convertible) {
+        m_base.attr("__entries") = dict();
+        auto property = handle((PyObject *) &PyProperty_Type);
+        auto static_property = handle((PyObject *) get_internals().static_property_type);
+
+        m_base.attr("__repr__") = cpp_function(
+            [](const object &arg) -> str {
+                handle type = type::handle_of(arg);
+                object type_name = type.attr("__name__");
+                return pybind11::str("<{}.{}: {}>")
+                    .format(std::move(type_name), enum_name(arg), int_(arg));
+            },
+            name("__repr__"),
+            is_method(m_base));
+
+        m_base.attr("name") = property(cpp_function(&enum_name, name("name"), is_method(m_base)));
+
+        m_base.attr("__str__") = cpp_function(
+            [](handle arg) -> str {
+                object type_name = type::handle_of(arg).attr("__name__");
+                return pybind11::str("{}.{}").format(std::move(type_name), enum_name(arg));
+            },
+            name("__str__"),
+            is_method(m_base));
+
+        if (options::show_enum_members_docstring()) {
+            m_base.attr("__doc__") = static_property(
+                cpp_function(
+                    [](handle arg) -> std::string {
+                        std::string docstring;
+                        dict entries = arg.attr("__entries");
+                        if (((PyTypeObject *) arg.ptr())->tp_doc) {
+                            docstring += std::string(
+                                reinterpret_cast<PyTypeObject *>(arg.ptr())->tp_doc);
+                            docstring += "\n\n";
+                        }
+                        docstring += "Members:";
+                        for (auto kv : entries) {
+                            auto key = std::string(pybind11::str(kv.first));
+                            auto comment = kv.second[int_(1)];
+                            docstring += "\n\n  ";
+                            docstring += key;
+                            if (!comment.is_none()) {
+                                docstring += " : ";
+                                docstring += pybind11::str(comment).cast<std::string>();
+                            }
+                        }
+                        return docstring;
+                    },
+                    name("__doc__")),
+                none(),
+                none(),
+                "");
+        }
+
+        m_base.attr("__members__") = static_property(cpp_function(
+                                                         [](handle arg) -> dict {
+                                                             dict entries = arg.attr("__entries"),
+                                                                  m;
+                                                             for (auto kv : entries) {
+                                                                 m[kv.first] = kv.second[int_(0)];
+                                                             }
+                                                             return m;
+                                                         },
+                                                         name("__members__")),
+                                                     none(),
+                                                     none(),
+                                                     "");
+
+#define PYBIND11_ENUM_OP_STRICT(op, expr, strict_behavior)                                        \
+    m_base.attr(op) = cpp_function(                                                               \
+        [](const object &a, const object &b) {                                                    \
+            if (!type::handle_of(a).is(type::handle_of(b)))                                       \
+                strict_behavior; /* NOLINT(bugprone-macro-parentheses) */                         \
+            return expr;                                                                          \
+        },                                                                                        \
+        name(op),                                                                                 \
+        is_method(m_base),                                                                        \
+        arg("other"))
+
+#define PYBIND11_ENUM_OP_CONV(op, expr)                                                           \
+    m_base.attr(op) = cpp_function(                                                               \
+        [](const object &a_, const object &b_) {                                                  \
+            int_ a(a_), b(b_);                                                                    \
+            return expr;                                                                          \
+        },                                                                                        \
+        name(op),                                                                                 \
+        is_method(m_base),                                                                        \
+        arg("other"))
+
+#define PYBIND11_ENUM_OP_CONV_LHS(op, expr)                                                       \
+    m_base.attr(op) = cpp_function(                                                               \
+        [](const object &a_, const object &b) {                                                   \
+            int_ a(a_);                                                                           \
+            return expr;                                                                          \
+        },                                                                                        \
+        name(op),                                                                                 \
+        is_method(m_base),                                                                        \
+        arg("other"))
+
+        if (is_convertible) {
+            PYBIND11_ENUM_OP_CONV_LHS("__eq__", !b.is_none() && a.equal(b));
+            PYBIND11_ENUM_OP_CONV_LHS("__ne__", b.is_none() || !a.equal(b));
+
+            if (is_arithmetic) {
+                PYBIND11_ENUM_OP_CONV("__lt__", a < b);
+                PYBIND11_ENUM_OP_CONV("__gt__", a > b);
+                PYBIND11_ENUM_OP_CONV("__le__", a <= b);
+                PYBIND11_ENUM_OP_CONV("__ge__", a >= b);
+                PYBIND11_ENUM_OP_CONV("__and__", a & b);
+                PYBIND11_ENUM_OP_CONV("__rand__", a & b);
+                PYBIND11_ENUM_OP_CONV("__or__", a | b);
+                PYBIND11_ENUM_OP_CONV("__ror__", a | b);
+                PYBIND11_ENUM_OP_CONV("__xor__", a ^ b);
+                PYBIND11_ENUM_OP_CONV("__rxor__", a ^ b);
+                m_base.attr("__invert__")
+                    = cpp_function([](const object &arg) { return ~(int_(arg)); },
+                                   name("__invert__"),
+                                   is_method(m_base));
+            }
+        } else {
+            PYBIND11_ENUM_OP_STRICT("__eq__", int_(a).equal(int_(b)), return false);
+            PYBIND11_ENUM_OP_STRICT("__ne__", !int_(a).equal(int_(b)), return true);
+
+            if (is_arithmetic) {
+#define PYBIND11_THROW throw type_error("Expected an enumeration of matching type!");
+                PYBIND11_ENUM_OP_STRICT("__lt__", int_(a) < int_(b), PYBIND11_THROW);
+                PYBIND11_ENUM_OP_STRICT("__gt__", int_(a) > int_(b), PYBIND11_THROW);
+                PYBIND11_ENUM_OP_STRICT("__le__", int_(a) <= int_(b), PYBIND11_THROW);
+                PYBIND11_ENUM_OP_STRICT("__ge__", int_(a) >= int_(b), PYBIND11_THROW);
+#undef PYBIND11_THROW
+            }
+        }
+
+#undef PYBIND11_ENUM_OP_CONV_LHS
+#undef PYBIND11_ENUM_OP_CONV
+#undef PYBIND11_ENUM_OP_STRICT
+
+        m_base.attr("__getstate__") = cpp_function(
+            [](const object &arg) { return int_(arg); }, name("__getstate__"), is_method(m_base));
+
+        m_base.attr("__hash__") = cpp_function(
+            [](const object &arg) { return int_(arg); }, name("__hash__"), is_method(m_base));
+    }
+
+    PYBIND11_NOINLINE void value(char const *name_, object value, const char *doc = nullptr) {
+        dict entries = m_base.attr("__entries");
+        str name(name_);
+        if (entries.contains(name)) {
+            std::string type_name = (std::string) str(m_base.attr("__name__"));
+            throw value_error(std::move(type_name) + ": element \"" + std::string(name_)
+                              + "\" already exists!");
+        }
+
+        entries[name] = pybind11::make_tuple(value, doc);
+        m_base.attr(std::move(name)) = std::move(value);
+    }
+
+    PYBIND11_NOINLINE void export_values() {
+        dict entries = m_base.attr("__entries");
+        for (auto kv : entries) {
+            m_parent.attr(kv.first) = kv.second[int_(0)];
+        }
+    }
+
+    handle m_base;
+    handle m_parent;
+};
+
+template <bool is_signed, size_t length>
+struct equivalent_integer {};
+template <>
+struct equivalent_integer<true, 1> {
+    using type = int8_t;
+};
+template <>
+struct equivalent_integer<false, 1> {
+    using type = uint8_t;
+};
+template <>
+struct equivalent_integer<true, 2> {
+    using type = int16_t;
+};
+template <>
+struct equivalent_integer<false, 2> {
+    using type = uint16_t;
+};
+template <>
+struct equivalent_integer<true, 4> {
+    using type = int32_t;
+};
+template <>
+struct equivalent_integer<false, 4> {
+    using type = uint32_t;
+};
+template <>
+struct equivalent_integer<true, 8> {
+    using type = int64_t;
+};
+template <>
+struct equivalent_integer<false, 8> {
+    using type = uint64_t;
+};
+
+template <typename IntLike>
+using equivalent_integer_t =
+    typename equivalent_integer<std::is_signed<IntLike>::value, sizeof(IntLike)>::type;
+
+PYBIND11_NAMESPACE_END(detail)
+
+/// Binds C++ enumerations and enumeration classes to Python
+template <typename Type>
+class enum_ : public class_<Type> {
+public:
+    using Base = class_<Type>;
+    using Base::attr;
+    using Base::def;
+    using Base::def_property_readonly;
+    using Base::def_property_readonly_static;
+    using Underlying = typename std::underlying_type<Type>::type;
+    // Scalar is the integer representation of underlying type
+    using Scalar = detail::conditional_t<detail::any_of<detail::is_std_char_type<Underlying>,
+                                                        std::is_same<Underlying, bool>>::value,
+                                         detail::equivalent_integer_t<Underlying>,
+                                         Underlying>;
+
+    template <typename... Extra>
+    enum_(const handle &scope, const char *name, const Extra &...extra)
+        : class_<Type>(scope, name, extra...), m_base(*this, scope) {
+        constexpr bool is_arithmetic = detail::any_of<std::is_same<arithmetic, Extra>...>::value;
+        constexpr bool is_convertible = std::is_convertible<Type, Underlying>::value;
+        m_base.init(is_arithmetic, is_convertible);
+
+        def(init([](Scalar i) { return static_cast<Type>(i); }), arg("value"));
+        def_property_readonly("value", [](Type value) { return (Scalar) value; });
+        def("__int__", [](Type value) { return (Scalar) value; });
+        def("__index__", [](Type value) { return (Scalar) value; });
+        attr("__setstate__") = cpp_function(
+            [](detail::value_and_holder &v_h, Scalar arg) {
+                detail::initimpl::setstate<Base>(
+                    v_h, static_cast<Type>(arg), Py_TYPE(v_h.inst) != v_h.type->type);
+            },
+            detail::is_new_style_constructor(),
+            pybind11::name("__setstate__"),
+            is_method(*this),
+            arg("state"));
+    }
+
+    /// Export enumeration entries into the parent scope
+    enum_ &export_values() {
+        m_base.export_values();
+        return *this;
+    }
+
+    /// Add an enumeration entry
+    enum_ &value(char const *name, Type value, const char *doc = nullptr) {
+        m_base.value(name, pybind11::cast(value, return_value_policy::copy), doc);
+        return *this;
+    }
+
+private:
+    detail::enum_base m_base;
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+PYBIND11_NOINLINE void keep_alive_impl(handle nurse, handle patient) {
+    if (!nurse || !patient) {
+        pybind11_fail("Could not activate keep_alive!");
+    }
+
+    if (patient.is_none() || nurse.is_none()) {
+        return; /* Nothing to keep alive or nothing to be kept alive by */
+    }
+
+    auto tinfo = all_type_info(Py_TYPE(nurse.ptr()));
+    if (!tinfo.empty()) {
+        /* It's a pybind-registered type, so we can store the patient in the
+         * internal list. */
+        add_patient(nurse.ptr(), patient.ptr());
+    } else {
+        /* Fall back to clever approach based on weak references taken from
+         * Boost.Python. This is not used for pybind-registered types because
+         * the objects can be destroyed out-of-order in a GC pass. */
+        cpp_function disable_lifesupport([patient](handle weakref) {
+            patient.dec_ref();
+            weakref.dec_ref();
+        });
+
+        weakref wr(nurse, disable_lifesupport);
+
+        patient.inc_ref(); /* reference patient and leak the weak reference */
+        (void) wr.release();
+    }
+}
+
+PYBIND11_NOINLINE void
+keep_alive_impl(size_t Nurse, size_t Patient, function_call &call, handle ret) {
+    auto get_arg = [&](size_t n) {
+        if (n == 0) {
+            return ret;
+        }
+        if (n == 1 && call.init_self) {
+            return call.init_self;
+        }
+        if (n <= call.args.size()) {
+            return call.args[n - 1];
+        }
+        return handle();
+    };
+
+    keep_alive_impl(get_arg(Nurse), get_arg(Patient));
+}
+
+inline std::pair<decltype(internals::registered_types_py)::iterator, bool>
+all_type_info_get_cache(PyTypeObject *type) {
+    auto res = with_internals([type](internals &internals) {
+        return internals
+            .registered_types_py
+#ifdef __cpp_lib_unordered_map_try_emplace
+            .try_emplace(type);
+#else
+            .emplace(type, std::vector<detail::type_info *>());
+#endif
+    });
+    if (res.second) {
+        // New cache entry created; set up a weak reference to automatically remove it if the type
+        // gets destroyed:
+        weakref((PyObject *) type, cpp_function([type](handle wr) {
+                    with_internals([type](internals &internals) {
+                        internals.registered_types_py.erase(type);
+
+                        // TODO consolidate the erasure code in pybind11_meta_dealloc() in class.h
+                        auto &cache = internals.inactive_override_cache;
+                        for (auto it = cache.begin(), last = cache.end(); it != last;) {
+                            if (it->first == reinterpret_cast<PyObject *>(type)) {
+                                it = cache.erase(it);
+                            } else {
+                                ++it;
+                            }
+                        }
+                    });
+
+                    wr.dec_ref();
+                }))
+            .release();
+    }
+
+    return res;
+}
+
+/* There are a large number of apparently unused template arguments because
+ * each combination requires a separate py::class_ registration.
+ */
+template <typename Access,
+          return_value_policy Policy,
+          typename Iterator,
+          typename Sentinel,
+          typename ValueType,
+          typename... Extra>
+struct iterator_state {
+    Iterator it;
+    Sentinel end;
+    bool first_or_done;
+};
+
+// Note: these helpers take the iterator by non-const reference because some
+// iterators in the wild can't be dereferenced when const. The & after Iterator
+// is required for MSVC < 16.9. SFINAE cannot be reused for result_type due to
+// bugs in ICC, NVCC, and PGI compilers. See PR #3293.
+template <typename Iterator, typename SFINAE = decltype(*std::declval<Iterator &>())>
+struct iterator_access {
+    using result_type = decltype(*std::declval<Iterator &>());
+    // NOLINTNEXTLINE(readability-const-return-type) // PR #3263
+    result_type operator()(Iterator &it) const { return *it; }
+};
+
+template <typename Iterator, typename SFINAE = decltype((*std::declval<Iterator &>()).first)>
+class iterator_key_access {
+private:
+    using pair_type = decltype(*std::declval<Iterator &>());
+
+public:
+    /* If either the pair itself or the element of the pair is a reference, we
+     * want to return a reference, otherwise a value. When the decltype
+     * expression is parenthesized it is based on the value category of the
+     * expression; otherwise it is the declared type of the pair member.
+     * The use of declval<pair_type> in the second branch rather than directly
+     * using *std::declval<Iterator &>() is a workaround for nvcc
+     * (it's not used in the first branch because going via decltype and back
+     * through declval does not perfectly preserve references).
+     */
+    using result_type
+        = conditional_t<std::is_reference<decltype(*std::declval<Iterator &>())>::value,
+                        decltype(((*std::declval<Iterator &>()).first)),
+                        decltype(std::declval<pair_type>().first)>;
+    result_type operator()(Iterator &it) const { return (*it).first; }
+};
+
+template <typename Iterator, typename SFINAE = decltype((*std::declval<Iterator &>()).second)>
+class iterator_value_access {
+private:
+    using pair_type = decltype(*std::declval<Iterator &>());
+
+public:
+    using result_type
+        = conditional_t<std::is_reference<decltype(*std::declval<Iterator &>())>::value,
+                        decltype(((*std::declval<Iterator &>()).second)),
+                        decltype(std::declval<pair_type>().second)>;
+    result_type operator()(Iterator &it) const { return (*it).second; }
+};
+
+template <typename Access,
+          return_value_policy Policy,
+          typename Iterator,
+          typename Sentinel,
+          typename ValueType,
+          typename... Extra>
+iterator make_iterator_impl(Iterator first, Sentinel last, Extra &&...extra) {
+    using state = detail::iterator_state<Access, Policy, Iterator, Sentinel, ValueType, Extra...>;
+    // TODO: state captures only the types of Extra, not the values
+
+    if (!detail::get_type_info(typeid(state), false)) {
+        class_<state>(handle(), "iterator", pybind11::module_local())
+            .def("__iter__", [](state &s) -> state & { return s; })
+            .def(
+                "__next__",
+                [](state &s) -> ValueType {
+                    if (!s.first_or_done) {
+                        ++s.it;
+                    } else {
+                        s.first_or_done = false;
+                    }
+                    if (s.it == s.end) {
+                        s.first_or_done = true;
+                        throw stop_iteration();
+                    }
+                    return Access()(s.it);
+                    // NOLINTNEXTLINE(readability-const-return-type) // PR #3263
+                },
+                std::forward<Extra>(extra)...,
+                Policy);
+    }
+
+    return cast(state{std::forward<Iterator>(first), std::forward<Sentinel>(last), true});
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+/// Makes a python iterator from a first and past-the-end C++ InputIterator.
+template <return_value_policy Policy = return_value_policy::reference_internal,
+          typename Iterator,
+          typename Sentinel,
+          typename ValueType = typename detail::iterator_access<Iterator>::result_type,
+          typename... Extra>
+typing::Iterator<ValueType> make_iterator(Iterator first, Sentinel last, Extra &&...extra) {
+    return detail::make_iterator_impl<detail::iterator_access<Iterator>,
+                                      Policy,
+                                      Iterator,
+                                      Sentinel,
+                                      ValueType,
+                                      Extra...>(std::forward<Iterator>(first),
+                                                std::forward<Sentinel>(last),
+                                                std::forward<Extra>(extra)...);
+}
+
+/// Makes a python iterator over the keys (`.first`) of a iterator over pairs from a
+/// first and past-the-end InputIterator.
+template <return_value_policy Policy = return_value_policy::reference_internal,
+          typename Iterator,
+          typename Sentinel,
+          typename KeyType = typename detail::iterator_key_access<Iterator>::result_type,
+          typename... Extra>
+typing::Iterator<KeyType> make_key_iterator(Iterator first, Sentinel last, Extra &&...extra) {
+    return detail::make_iterator_impl<detail::iterator_key_access<Iterator>,
+                                      Policy,
+                                      Iterator,
+                                      Sentinel,
+                                      KeyType,
+                                      Extra...>(std::forward<Iterator>(first),
+                                                std::forward<Sentinel>(last),
+                                                std::forward<Extra>(extra)...);
+}
+
+/// Makes a python iterator over the values (`.second`) of a iterator over pairs from a
+/// first and past-the-end InputIterator.
+template <return_value_policy Policy = return_value_policy::reference_internal,
+          typename Iterator,
+          typename Sentinel,
+          typename ValueType = typename detail::iterator_value_access<Iterator>::result_type,
+          typename... Extra>
+typing::Iterator<ValueType> make_value_iterator(Iterator first, Sentinel last, Extra &&...extra) {
+    return detail::make_iterator_impl<detail::iterator_value_access<Iterator>,
+                                      Policy,
+                                      Iterator,
+                                      Sentinel,
+                                      ValueType,
+                                      Extra...>(std::forward<Iterator>(first),
+                                                std::forward<Sentinel>(last),
+                                                std::forward<Extra>(extra)...);
+}
+
+/// Makes an iterator over values of an stl container or other container supporting
+/// `std::begin()`/`std::end()`
+template <return_value_policy Policy = return_value_policy::reference_internal,
+          typename Type,
+          typename ValueType = typename detail::iterator_access<
+              decltype(std::begin(std::declval<Type &>()))>::result_type,
+          typename... Extra>
+typing::Iterator<ValueType> make_iterator(Type &value, Extra &&...extra) {
+    return make_iterator<Policy>(
+        std::begin(value), std::end(value), std::forward<Extra>(extra)...);
+}
+
+/// Makes an iterator over the keys (`.first`) of a stl map-like container supporting
+/// `std::begin()`/`std::end()`
+template <return_value_policy Policy = return_value_policy::reference_internal,
+          typename Type,
+          typename KeyType = typename detail::iterator_key_access<
+              decltype(std::begin(std::declval<Type &>()))>::result_type,
+          typename... Extra>
+typing::Iterator<KeyType> make_key_iterator(Type &value, Extra &&...extra) {
+    return make_key_iterator<Policy>(
+        std::begin(value), std::end(value), std::forward<Extra>(extra)...);
+}
+
+/// Makes an iterator over the values (`.second`) of a stl map-like container supporting
+/// `std::begin()`/`std::end()`
+template <return_value_policy Policy = return_value_policy::reference_internal,
+          typename Type,
+          typename ValueType = typename detail::iterator_value_access<
+              decltype(std::begin(std::declval<Type &>()))>::result_type,
+          typename... Extra>
+typing::Iterator<ValueType> make_value_iterator(Type &value, Extra &&...extra) {
+    return make_value_iterator<Policy>(
+        std::begin(value), std::end(value), std::forward<Extra>(extra)...);
+}
+
+template <typename InputType, typename OutputType>
+void implicitly_convertible() {
+    struct set_flag {
+        bool &flag;
+        explicit set_flag(bool &flag_) : flag(flag_) { flag_ = true; }
+        ~set_flag() { flag = false; }
+    };
+    auto implicit_caster = [](PyObject *obj, PyTypeObject *type) -> PyObject * {
+#ifdef Py_GIL_DISABLED
+        thread_local bool currently_used = false;
+#else
+        static bool currently_used = false;
+#endif
+        if (currently_used) { // implicit conversions are non-reentrant
+            return nullptr;
+        }
+        set_flag flag_helper(currently_used);
+        if (!detail::make_caster<InputType>().load(obj, false)) {
+            return nullptr;
+        }
+        tuple args(1);
+        args[0] = obj;
+        PyObject *result = PyObject_Call((PyObject *) type, args.ptr(), nullptr);
+        if (result == nullptr) {
+            PyErr_Clear();
+        }
+        return result;
+    };
+
+    if (auto *tinfo = detail::get_type_info(typeid(OutputType))) {
+        tinfo->implicit_conversions.emplace_back(std::move(implicit_caster));
+    } else {
+        pybind11_fail("implicitly_convertible: Unable to find type " + type_id<OutputType>());
+    }
+}
+
+inline void register_exception_translator(ExceptionTranslator &&translator) {
+    detail::with_internals([&](detail::internals &internals) {
+        internals.registered_exception_translators.push_front(
+            std::forward<ExceptionTranslator>(translator));
+    });
+}
+
+/**
+ * Add a new module-local exception translator. Locally registered functions
+ * will be tried before any globally registered exception translators, which
+ * will only be invoked if the module-local handlers do not deal with
+ * the exception.
+ */
+inline void register_local_exception_translator(ExceptionTranslator &&translator) {
+    detail::with_internals([&](detail::internals &internals) {
+        (void) internals;
+        detail::get_local_internals().registered_exception_translators.push_front(
+            std::forward<ExceptionTranslator>(translator));
+    });
+}
+
+/**
+ * Wrapper to generate a new Python exception type.
+ *
+ * This should only be used with py::set_error() for now.
+ * It is not (yet) possible to use as a py::base.
+ * Template type argument is reserved for future use.
+ */
+template <typename type>
+class exception : public object {
+public:
+    exception() = default;
+    exception(handle scope, const char *name, handle base = PyExc_Exception) {
+        std::string full_name
+            = scope.attr("__name__").cast<std::string>() + std::string(".") + name;
+        m_ptr = PyErr_NewException(const_cast<char *>(full_name.c_str()), base.ptr(), nullptr);
+        if (hasattr(scope, "__dict__") && scope.attr("__dict__").contains(name)) {
+            pybind11_fail("Error during initialization: multiple incompatible "
+                          "definitions with name \""
+                          + std::string(name) + "\"");
+        }
+        scope.attr(name) = *this;
+    }
+
+    // Sets the current python exception to this exception object with the given message
+    PYBIND11_DEPRECATED("Please use py::set_error() instead "
+                        "(https://github.com/pybind/pybind11/pull/4772)")
+    void operator()(const char *message) const { set_error(*this, message); }
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <>
+struct handle_type_name<exception<void>> {
+    static constexpr auto name = const_name("Exception");
+};
+
+// Helper function for register_exception and register_local_exception
+template <typename CppException>
+exception<CppException> &
+register_exception_impl(handle scope, const char *name, handle base, bool isLocal) {
+    PYBIND11_CONSTINIT static gil_safe_call_once_and_store<exception<CppException>> exc_storage;
+    exc_storage.call_once_and_store_result(
+        [&]() { return exception<CppException>(scope, name, base); });
+
+    auto register_func
+        = isLocal ? &register_local_exception_translator : &register_exception_translator;
+
+    register_func([](std::exception_ptr p) {
+        if (!p) {
+            return;
+        }
+        try {
+            std::rethrow_exception(p);
+        } catch (const CppException &e) {
+            set_error(exc_storage.get_stored(), e.what());
+        }
+    });
+    return exc_storage.get_stored();
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+/**
+ * Registers a Python exception in `m` of the given `name` and installs a translator to
+ * translate the C++ exception to the created Python exception using the what() method.
+ * This is intended for simple exception translations; for more complex translation, register the
+ * exception object and translator directly.
+ */
+template <typename CppException>
+exception<CppException> &
+register_exception(handle scope, const char *name, handle base = PyExc_Exception) {
+    return detail::register_exception_impl<CppException>(scope, name, base, false /* isLocal */);
+}
+
+/**
+ * Registers a Python exception in `m` of the given `name` and installs a translator to
+ * translate the C++ exception to the created Python exception using the what() method.
+ * This translator will only be used for exceptions that are thrown in this module and will be
+ * tried before global exception translators, including those registered with register_exception.
+ * This is intended for simple exception translations; for more complex translation, register the
+ * exception object and translator directly.
+ */
+template <typename CppException>
+exception<CppException> &
+register_local_exception(handle scope, const char *name, handle base = PyExc_Exception) {
+    return detail::register_exception_impl<CppException>(scope, name, base, true /* isLocal */);
+}
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+PYBIND11_NOINLINE void print(const tuple &args, const dict &kwargs) {
+    auto strings = tuple(args.size());
+    for (size_t i = 0; i < args.size(); ++i) {
+        strings[i] = str(args[i]);
+    }
+    auto sep = kwargs.contains("sep") ? kwargs["sep"] : str(" ");
+    auto line = sep.attr("join")(std::move(strings));
+
+    object file;
+    if (kwargs.contains("file")) {
+        file = kwargs["file"].cast<object>();
+    } else {
+        try {
+            file = module_::import("sys").attr("stdout");
+        } catch (const error_already_set &) {
+            /* If print() is called from code that is executed as
+               part of garbage collection during interpreter shutdown,
+               importing 'sys' can fail. Give up rather than crashing the
+               interpreter in this case. */
+            return;
+        }
+    }
+
+    auto write = file.attr("write");
+    write(std::move(line));
+    write(kwargs.contains("end") ? kwargs["end"] : str("\n"));
+
+    if (kwargs.contains("flush") && kwargs["flush"].cast<bool>()) {
+        file.attr("flush")();
+    }
+}
+PYBIND11_NAMESPACE_END(detail)
+
+template <return_value_policy policy = return_value_policy::automatic_reference, typename... Args>
+void print(Args &&...args) {
+    auto c = detail::collect_arguments<policy>(std::forward<Args>(args)...);
+    detail::print(c.args(), c.kwargs());
+}
+
+inline void
+error_already_set::m_fetched_error_deleter(detail::error_fetch_and_normalize *raw_ptr) {
+    gil_scoped_acquire gil;
+    error_scope scope;
+    delete raw_ptr;
+}
+
+inline const char *error_already_set::what() const noexcept {
+    gil_scoped_acquire gil;
+    error_scope scope;
+    return m_fetched_error->error_string().c_str();
+}
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+inline function
+get_type_override(const void *this_ptr, const type_info *this_type, const char *name) {
+    handle self = get_object_handle(this_ptr, this_type);
+    if (!self) {
+        return function();
+    }
+    handle type = type::handle_of(self);
+    auto key = std::make_pair(type.ptr(), name);
+
+    /* Cache functions that aren't overridden in Python to avoid
+       many costly Python dictionary lookups below */
+    bool not_overridden = with_internals([&key](internals &internals) {
+        auto &cache = internals.inactive_override_cache;
+        return cache.find(key) != cache.end();
+    });
+    if (not_overridden) {
+        return function();
+    }
+
+    function override = getattr(self, name, function());
+    if (override.is_cpp_function()) {
+        with_internals([&](internals &internals) {
+            internals.inactive_override_cache.insert(std::move(key));
+        });
+        return function();
+    }
+
+    /* Don't call dispatch code if invoked from overridden function.
+       Unfortunately this doesn't work on PyPy. */
+#if !defined(PYPY_VERSION)
+#    if PY_VERSION_HEX >= 0x03090000
+    PyFrameObject *frame = PyThreadState_GetFrame(PyThreadState_Get());
+    if (frame != nullptr) {
+        PyCodeObject *f_code = PyFrame_GetCode(frame);
+        // f_code is guaranteed to not be NULL
+        if ((std::string) str(f_code->co_name) == name && f_code->co_argcount > 0) {
+#        if PY_VERSION_HEX >= 0x030d0000
+            PyObject *locals = PyEval_GetFrameLocals();
+#        else
+            PyObject *locals = PyEval_GetLocals();
+            Py_XINCREF(locals);
+#        endif
+            if (locals != nullptr) {
+#        if PY_VERSION_HEX >= 0x030b0000
+                PyObject *co_varnames = PyCode_GetVarnames(f_code);
+#        else
+                PyObject *co_varnames = PyObject_GetAttrString((PyObject *) f_code, "co_varnames");
+#        endif
+                PyObject *self_arg = PyTuple_GET_ITEM(co_varnames, 0);
+                Py_DECREF(co_varnames);
+                PyObject *self_caller = dict_getitem(locals, self_arg);
+                Py_DECREF(locals);
+                if (self_caller == self.ptr()) {
+                    Py_DECREF(f_code);
+                    Py_DECREF(frame);
+                    return function();
+                }
+            }
+        }
+        Py_DECREF(f_code);
+        Py_DECREF(frame);
+    }
+#    else
+    PyFrameObject *frame = PyThreadState_Get()->frame;
+    if (frame != nullptr && (std::string) str(frame->f_code->co_name) == name
+        && frame->f_code->co_argcount > 0) {
+        PyFrame_FastToLocals(frame);
+        PyObject *self_caller
+            = dict_getitem(frame->f_locals, PyTuple_GET_ITEM(frame->f_code->co_varnames, 0));
+        if (self_caller == self.ptr()) {
+            return function();
+        }
+    }
+#    endif
+
+#else
+    /* PyPy currently doesn't provide a detailed cpyext emulation of
+       frame objects, so we have to emulate this using Python. This
+       is going to be slow..*/
+    dict d;
+    d["self"] = self;
+    d["name"] = pybind11::str(name);
+    PyObject *result
+        = PyRun_String("import inspect\n"
+                       "frame = inspect.currentframe()\n"
+                       "if frame is not None:\n"
+                       "    frame = frame.f_back\n"
+                       "    if frame is not None and str(frame.f_code.co_name) == name and "
+                       "frame.f_code.co_argcount > 0:\n"
+                       "        self_caller = frame.f_locals[frame.f_code.co_varnames[0]]\n"
+                       "        if self_caller == self:\n"
+                       "            self = None\n",
+                       Py_file_input,
+                       d.ptr(),
+                       d.ptr());
+    if (result == nullptr)
+        throw error_already_set();
+    Py_DECREF(result);
+    if (d["self"].is_none())
+        return function();
+#endif
+
+    return override;
+}
+PYBIND11_NAMESPACE_END(detail)
+
+/** \rst
+  Try to retrieve a python method by the provided name from the instance pointed to by the
+  this_ptr.
+
+  :this_ptr: The pointer to the object the overridden method should be retrieved for. This should
+             be the first non-trampoline class encountered in the inheritance chain.
+  :name: The name of the overridden Python method to retrieve.
+  :return: The Python method by this name from the object or an empty function wrapper.
+ \endrst */
+template <class T>
+function get_override(const T *this_ptr, const char *name) {
+    auto *tinfo = detail::get_type_info(typeid(T));
+    return tinfo ? detail::get_type_override(this_ptr, tinfo, name) : function();
+}
+
+#define PYBIND11_OVERRIDE_IMPL(ret_type, cname, name, ...)                                        \
+    do {                                                                                          \
+        pybind11::gil_scoped_acquire gil;                                                         \
+        pybind11::function override                                                               \
+            = pybind11::get_override(static_cast<const cname *>(this), name);                     \
+        if (override) {                                                                           \
+            auto o = override(__VA_ARGS__);                                                       \
+            PYBIND11_WARNING_PUSH                                                                 \
+            PYBIND11_WARNING_DISABLE_MSVC(4127)                                                   \
+            if (pybind11::detail::cast_is_temporary_value_reference<ret_type>::value              \
+                && !pybind11::detail::is_same_ignoring_cvref<ret_type, PyObject *>::value) {      \
+                static pybind11::detail::override_caster_t<ret_type> caster;                      \
+                return pybind11::detail::cast_ref<ret_type>(std::move(o), caster);                \
+            }                                                                                     \
+            PYBIND11_WARNING_POP                                                                  \
+            return pybind11::detail::cast_safe<ret_type>(std::move(o));                           \
+        }                                                                                         \
+    } while (false)
+
+/** \rst
+    Macro to populate the virtual method in the trampoline class. This macro tries to look up a
+    method named 'fn' from the Python side, deals with the :ref:`gil` and necessary argument
+    conversions to call this method and return the appropriate type.
+    See :ref:`overriding_virtuals` for more information. This macro should be used when the method
+    name in C is not the same as the method name in Python. For example with `__str__`.
+
+    .. code-block:: cpp
+
+      std::string toString() override {
+        PYBIND11_OVERRIDE_NAME(
+            std::string, // Return type (ret_type)
+            Animal,      // Parent class (cname)
+            "__str__",   // Name of method in Python (name)
+            toString,    // Name of function in C++ (fn)
+        );
+      }
+\endrst */
+#define PYBIND11_OVERRIDE_NAME(ret_type, cname, name, fn, ...)                                    \
+    do {                                                                                          \
+        PYBIND11_OVERRIDE_IMPL(PYBIND11_TYPE(ret_type), PYBIND11_TYPE(cname), name, __VA_ARGS__); \
+        return cname::fn(__VA_ARGS__);                                                            \
+    } while (false)
+
+/** \rst
+    Macro for pure virtual functions, this function is identical to
+    :c:macro:`PYBIND11_OVERRIDE_NAME`, except that it throws if no override can be found.
+\endrst */
+#define PYBIND11_OVERRIDE_PURE_NAME(ret_type, cname, name, fn, ...)                               \
+    do {                                                                                          \
+        PYBIND11_OVERRIDE_IMPL(PYBIND11_TYPE(ret_type), PYBIND11_TYPE(cname), name, __VA_ARGS__); \
+        pybind11::pybind11_fail(                                                                  \
+            "Tried to call pure virtual function \"" PYBIND11_STRINGIFY(cname) "::" name "\"");   \
+    } while (false)
+
+/** \rst
+    Macro to populate the virtual method in the trampoline class. This macro tries to look up the
+    method from the Python side, deals with the :ref:`gil` and necessary argument conversions to
+    call this method and return the appropriate type. This macro should be used if the method name
+    in C and in Python are identical.
+    See :ref:`overriding_virtuals` for more information.
+
+    .. code-block:: cpp
+
+      class PyAnimal : public Animal {
+      public:
+          // Inherit the constructors
+          using Animal::Animal;
+
+          // Trampoline (need one for each virtual function)
+          std::string go(int n_times) override {
+              PYBIND11_OVERRIDE_PURE(
+                  std::string, // Return type (ret_type)
+                  Animal,      // Parent class (cname)
+                  go,          // Name of function in C++ (must match Python name) (fn)
+                  n_times      // Argument(s) (...)
+              );
+          }
+      };
+\endrst */
+#define PYBIND11_OVERRIDE(ret_type, cname, fn, ...)                                               \
+    PYBIND11_OVERRIDE_NAME(PYBIND11_TYPE(ret_type), PYBIND11_TYPE(cname), #fn, fn, __VA_ARGS__)
+
+/** \rst
+    Macro for pure virtual functions, this function is identical to :c:macro:`PYBIND11_OVERRIDE`,
+    except that it throws if no override can be found.
+\endrst */
+#define PYBIND11_OVERRIDE_PURE(ret_type, cname, fn, ...)                                          \
+    PYBIND11_OVERRIDE_PURE_NAME(                                                                  \
+        PYBIND11_TYPE(ret_type), PYBIND11_TYPE(cname), #fn, fn, __VA_ARGS__)
+
+// Deprecated versions
+
+PYBIND11_DEPRECATED("get_type_overload has been deprecated")
+inline function
+get_type_overload(const void *this_ptr, const detail::type_info *this_type, const char *name) {
+    return detail::get_type_override(this_ptr, this_type, name);
+}
+
+template <class T>
+inline function get_overload(const T *this_ptr, const char *name) {
+    return get_override(this_ptr, name);
+}
+
+#define PYBIND11_OVERLOAD_INT(ret_type, cname, name, ...)                                         \
+    PYBIND11_OVERRIDE_IMPL(PYBIND11_TYPE(ret_type), PYBIND11_TYPE(cname), name, __VA_ARGS__)
+#define PYBIND11_OVERLOAD_NAME(ret_type, cname, name, fn, ...)                                    \
+    PYBIND11_OVERRIDE_NAME(PYBIND11_TYPE(ret_type), PYBIND11_TYPE(cname), name, fn, __VA_ARGS__)
+#define PYBIND11_OVERLOAD_PURE_NAME(ret_type, cname, name, fn, ...)                               \
+    PYBIND11_OVERRIDE_PURE_NAME(                                                                  \
+        PYBIND11_TYPE(ret_type), PYBIND11_TYPE(cname), name, fn, __VA_ARGS__);
+#define PYBIND11_OVERLOAD(ret_type, cname, fn, ...)                                               \
+    PYBIND11_OVERRIDE(PYBIND11_TYPE(ret_type), PYBIND11_TYPE(cname), fn, __VA_ARGS__)
+#define PYBIND11_OVERLOAD_PURE(ret_type, cname, fn, ...)                                          \
+    PYBIND11_OVERRIDE_PURE(PYBIND11_TYPE(ret_type), PYBIND11_TYPE(cname), fn, __VA_ARGS__);
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/pytypes.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/pytypes.h
new file mode 100644
index 0000000000..f26c307a87
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/pytypes.h
@@ -0,0 +1,2604 @@
+/*
+    pybind11/pytypes.h: Convenience wrapper classes for basic Python types
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "detail/common.h"
+#include "buffer_info.h"
+
+#include <assert.h>
+#include <cstddef>
+#include <exception>
+#include <frameobject.h>
+#include <iterator>
+#include <memory>
+#include <string>
+#include <type_traits>
+#include <typeinfo>
+#include <utility>
+
+#if defined(PYBIND11_HAS_OPTIONAL)
+#    include <optional>
+#endif
+
+#ifdef PYBIND11_HAS_STRING_VIEW
+#    include <string_view>
+#endif
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+
+PYBIND11_WARNING_DISABLE_MSVC(4127)
+
+/* A few forward declarations */
+class handle;
+class object;
+class str;
+class iterator;
+class type;
+struct arg;
+struct arg_v;
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+class args_proxy;
+bool isinstance_generic(handle obj, const std::type_info &tp);
+
+// Accessor forward declarations
+template <typename Policy>
+class accessor;
+namespace accessor_policies {
+struct obj_attr;
+struct str_attr;
+struct generic_item;
+struct sequence_item;
+struct list_item;
+struct tuple_item;
+} // namespace accessor_policies
+// PLEASE KEEP handle_type_name SPECIALIZATIONS IN SYNC.
+using obj_attr_accessor = accessor<accessor_policies::obj_attr>;
+using str_attr_accessor = accessor<accessor_policies::str_attr>;
+using item_accessor = accessor<accessor_policies::generic_item>;
+using sequence_accessor = accessor<accessor_policies::sequence_item>;
+using list_accessor = accessor<accessor_policies::list_item>;
+using tuple_accessor = accessor<accessor_policies::tuple_item>;
+
+/// Tag and check to identify a class which implements the Python object API
+class pyobject_tag {};
+template <typename T>
+using is_pyobject = std::is_base_of<pyobject_tag, remove_reference_t<T>>;
+
+/** \rst
+    A mixin class which adds common functions to `handle`, `object` and various accessors.
+    The only requirement for `Derived` is to implement ``PyObject *Derived::ptr() const``.
+\endrst */
+template <typename Derived>
+class object_api : public pyobject_tag {
+    const Derived &derived() const { return static_cast<const Derived &>(*this); }
+
+public:
+    /** \rst
+        Return an iterator equivalent to calling ``iter()`` in Python. The object
+        must be a collection which supports the iteration protocol.
+    \endrst */
+    iterator begin() const;
+    /// Return a sentinel which ends iteration.
+    iterator end() const;
+
+    /** \rst
+        Return an internal functor to invoke the object's sequence protocol. Casting
+        the returned ``detail::item_accessor`` instance to a `handle` or `object`
+        subclass causes a corresponding call to ``__getitem__``. Assigning a `handle`
+        or `object` subclass causes a call to ``__setitem__``.
+    \endrst */
+    item_accessor operator[](handle key) const;
+    /// See above (the only difference is that the key's reference is stolen)
+    item_accessor operator[](object &&key) const;
+    /// See above (the only difference is that the key is provided as a string literal)
+    item_accessor operator[](const char *key) const;
+
+    /** \rst
+        Return an internal functor to access the object's attributes. Casting the
+        returned ``detail::obj_attr_accessor`` instance to a `handle` or `object`
+        subclass causes a corresponding call to ``getattr``. Assigning a `handle`
+        or `object` subclass causes a call to ``setattr``.
+    \endrst */
+    obj_attr_accessor attr(handle key) const;
+    /// See above (the only difference is that the key's reference is stolen)
+    obj_attr_accessor attr(object &&key) const;
+    /// See above (the only difference is that the key is provided as a string literal)
+    str_attr_accessor attr(const char *key) const;
+
+    /** \rst
+        Matches * unpacking in Python, e.g. to unpack arguments out of a ``tuple``
+        or ``list`` for a function call. Applying another * to the result yields
+        ** unpacking, e.g. to unpack a dict as function keyword arguments.
+        See :ref:`calling_python_functions`.
+    \endrst */
+    args_proxy operator*() const;
+
+    /// Check if the given item is contained within this object, i.e. ``item in obj``.
+    template <typename T>
+    bool contains(T &&item) const;
+
+    /** \rst
+        Assuming the Python object is a function or implements the ``__call__``
+        protocol, ``operator()`` invokes the underlying function, passing an
+        arbitrary set of parameters. The result is returned as a `object` and
+        may need to be converted back into a Python object using `handle::cast()`.
+
+        When some of the arguments cannot be converted to Python objects, the
+        function will throw a `cast_error` exception. When the Python function
+        call fails, a `error_already_set` exception is thrown.
+    \endrst */
+    template <return_value_policy policy = return_value_policy::automatic_reference,
+              typename... Args>
+    object operator()(Args &&...args) const;
+    template <return_value_policy policy = return_value_policy::automatic_reference,
+              typename... Args>
+    PYBIND11_DEPRECATED("call(...) was deprecated in favor of operator()(...)")
+    object call(Args &&...args) const;
+
+    /// Equivalent to ``obj is other`` in Python.
+    bool is(object_api const &other) const { return derived().ptr() == other.derived().ptr(); }
+    /// Equivalent to ``obj is None`` in Python.
+    bool is_none() const { return derived().ptr() == Py_None; }
+    /// Equivalent to obj == other in Python
+    bool equal(object_api const &other) const { return rich_compare(other, Py_EQ); }
+    bool not_equal(object_api const &other) const { return rich_compare(other, Py_NE); }
+    bool operator<(object_api const &other) const { return rich_compare(other, Py_LT); }
+    bool operator<=(object_api const &other) const { return rich_compare(other, Py_LE); }
+    bool operator>(object_api const &other) const { return rich_compare(other, Py_GT); }
+    bool operator>=(object_api const &other) const { return rich_compare(other, Py_GE); }
+
+    object operator-() const;
+    object operator~() const;
+    object operator+(object_api const &other) const;
+    object operator+=(object_api const &other);
+    object operator-(object_api const &other) const;
+    object operator-=(object_api const &other);
+    object operator*(object_api const &other) const;
+    object operator*=(object_api const &other);
+    object operator/(object_api const &other) const;
+    object operator/=(object_api const &other);
+    object operator|(object_api const &other) const;
+    object operator|=(object_api const &other);
+    object operator&(object_api const &other) const;
+    object operator&=(object_api const &other);
+    object operator^(object_api const &other) const;
+    object operator^=(object_api const &other);
+    object operator<<(object_api const &other) const;
+    object operator<<=(object_api const &other);
+    object operator>>(object_api const &other) const;
+    object operator>>=(object_api const &other);
+
+    PYBIND11_DEPRECATED("Use py::str(obj) instead")
+    pybind11::str str() const;
+
+    /// Get or set the object's docstring, i.e. ``obj.__doc__``.
+    str_attr_accessor doc() const;
+
+    /// Return the object's current reference count
+    ssize_t ref_count() const {
+#ifdef PYPY_VERSION
+        // PyPy uses the top few bits for REFCNT_FROM_PYPY & REFCNT_FROM_PYPY_LIGHT
+        // Following pybind11 2.12.1 and older behavior and removing this part
+        return static_cast<ssize_t>(static_cast<int>(Py_REFCNT(derived().ptr())));
+#else
+        return Py_REFCNT(derived().ptr());
+#endif
+    }
+
+    // TODO PYBIND11_DEPRECATED(
+    //     "Call py::type::handle_of(h) or py::type::of(h) instead of h.get_type()")
+    handle get_type() const;
+
+private:
+    bool rich_compare(object_api const &other, int value) const;
+};
+
+template <typename T>
+using is_pyobj_ptr_or_nullptr_t = detail::any_of<std::is_same<T, PyObject *>,
+                                                 std::is_same<T, PyObject *const>,
+                                                 std::is_same<T, std::nullptr_t>>;
+
+PYBIND11_NAMESPACE_END(detail)
+
+#if !defined(PYBIND11_HANDLE_REF_DEBUG) && !defined(NDEBUG)
+#    define PYBIND11_HANDLE_REF_DEBUG
+#endif
+
+/** \rst
+    Holds a reference to a Python object (no reference counting)
+
+    The `handle` class is a thin wrapper around an arbitrary Python object (i.e. a
+    ``PyObject *`` in Python's C API). It does not perform any automatic reference
+    counting and merely provides a basic C++ interface to various Python API functions.
+
+    .. seealso::
+        The `object` class inherits from `handle` and adds automatic reference
+        counting features.
+\endrst */
+class handle : public detail::object_api<handle> {
+public:
+    /// The default constructor creates a handle with a ``nullptr``-valued pointer
+    handle() = default;
+
+    /// Enable implicit conversion from ``PyObject *`` and ``nullptr``.
+    /// Not using ``handle(PyObject *ptr)`` to avoid implicit conversion from ``0``.
+    template <typename T,
+              detail::enable_if_t<detail::is_pyobj_ptr_or_nullptr_t<T>::value, int> = 0>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    handle(T ptr) : m_ptr(ptr) {}
+
+    /// Enable implicit conversion through ``T::operator PyObject *()``.
+    template <
+        typename T,
+        detail::enable_if_t<detail::all_of<detail::none_of<std::is_base_of<handle, T>,
+                                                           detail::is_pyobj_ptr_or_nullptr_t<T>>,
+                                           std::is_convertible<T, PyObject *>>::value,
+                            int>
+        = 0>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    handle(T &obj) : m_ptr(obj) {}
+
+    /// Return the underlying ``PyObject *`` pointer
+    PyObject *ptr() const { return m_ptr; }
+    PyObject *&ptr() { return m_ptr; }
+
+    /** \rst
+        Manually increase the reference count of the Python object. Usually, it is
+        preferable to use the `object` class which derives from `handle` and calls
+        this function automatically. Returns a reference to itself.
+    \endrst */
+    const handle &inc_ref() const & {
+#ifdef PYBIND11_HANDLE_REF_DEBUG
+        inc_ref_counter(1);
+#endif
+#ifdef PYBIND11_ASSERT_GIL_HELD_INCREF_DECREF
+        if (m_ptr != nullptr && !PyGILState_Check()) {
+            throw_gilstate_error("pybind11::handle::inc_ref()");
+        }
+#endif
+        Py_XINCREF(m_ptr);
+        return *this;
+    }
+
+    /** \rst
+        Manually decrease the reference count of the Python object. Usually, it is
+        preferable to use the `object` class which derives from `handle` and calls
+        this function automatically. Returns a reference to itself.
+    \endrst */
+    const handle &dec_ref() const & {
+#ifdef PYBIND11_ASSERT_GIL_HELD_INCREF_DECREF
+        if (m_ptr != nullptr && !PyGILState_Check()) {
+            throw_gilstate_error("pybind11::handle::dec_ref()");
+        }
+#endif
+        Py_XDECREF(m_ptr);
+        return *this;
+    }
+
+    /** \rst
+        Attempt to cast the Python object into the given C++ type. A `cast_error`
+        will be throw upon failure.
+    \endrst */
+    template <typename T>
+    T cast() const;
+    /// Return ``true`` when the `handle` wraps a valid Python object
+    explicit operator bool() const { return m_ptr != nullptr; }
+    /** \rst
+        Deprecated: Check that the underlying pointers are the same.
+        Equivalent to ``obj1 is obj2`` in Python.
+    \endrst */
+    PYBIND11_DEPRECATED("Use obj1.is(obj2) instead")
+    bool operator==(const handle &h) const { return m_ptr == h.m_ptr; }
+    PYBIND11_DEPRECATED("Use !obj1.is(obj2) instead")
+    bool operator!=(const handle &h) const { return m_ptr != h.m_ptr; }
+    PYBIND11_DEPRECATED("Use handle::operator bool() instead")
+    bool check() const { return m_ptr != nullptr; }
+
+protected:
+    PyObject *m_ptr = nullptr;
+
+private:
+#ifdef PYBIND11_ASSERT_GIL_HELD_INCREF_DECREF
+    void throw_gilstate_error(const std::string &function_name) const {
+        fprintf(
+            stderr,
+            "%s is being called while the GIL is either not held or invalid. Please see "
+            "https://pybind11.readthedocs.io/en/stable/advanced/"
+            "misc.html#common-sources-of-global-interpreter-lock-errors for debugging advice.\n"
+            "If you are convinced there is no bug in your code, you can #define "
+            "PYBIND11_NO_ASSERT_GIL_HELD_INCREF_DECREF "
+            "to disable this check. In that case you have to ensure this #define is consistently "
+            "used for all translation units linked into a given pybind11 extension, otherwise "
+            "there will be ODR violations.",
+            function_name.c_str());
+        if (Py_TYPE(m_ptr)->tp_name != nullptr) {
+            fprintf(stderr,
+                    " The failing %s call was triggered on a %s object.",
+                    function_name.c_str(),
+                    Py_TYPE(m_ptr)->tp_name);
+        }
+        fprintf(stderr, "\n");
+        fflush(stderr);
+        throw std::runtime_error(function_name + " PyGILState_Check() failure.");
+    }
+#endif
+
+#ifdef PYBIND11_HANDLE_REF_DEBUG
+    static std::size_t inc_ref_counter(std::size_t add) {
+        thread_local std::size_t counter = 0;
+        counter += add;
+        return counter;
+    }
+
+public:
+    static std::size_t inc_ref_counter() { return inc_ref_counter(0); }
+#endif
+};
+
+inline void set_error(const handle &type, const char *message) {
+    PyErr_SetString(type.ptr(), message);
+}
+
+inline void set_error(const handle &type, const handle &value) {
+    PyErr_SetObject(type.ptr(), value.ptr());
+}
+
+/** \rst
+    Holds a reference to a Python object (with reference counting)
+
+    Like `handle`, the `object` class is a thin wrapper around an arbitrary Python
+    object (i.e. a ``PyObject *`` in Python's C API). In contrast to `handle`, it
+    optionally increases the object's reference count upon construction, and it
+    *always* decreases the reference count when the `object` instance goes out of
+    scope and is destructed. When using `object` instances consistently, it is much
+    easier to get reference counting right at the first attempt.
+\endrst */
+class object : public handle {
+public:
+    object() = default;
+    PYBIND11_DEPRECATED("Use reinterpret_borrow<object>() or reinterpret_steal<object>()")
+    object(handle h, bool is_borrowed) : handle(h) {
+        if (is_borrowed) {
+            inc_ref();
+        }
+    }
+    /// Copy constructor; always increases the reference count
+    object(const object &o) : handle(o) { inc_ref(); }
+    /// Move constructor; steals the object from ``other`` and preserves its reference count
+    object(object &&other) noexcept : handle(other) { other.m_ptr = nullptr; }
+    /// Destructor; automatically calls `handle::dec_ref()`
+    ~object() { dec_ref(); }
+
+    /** \rst
+        Resets the internal pointer to ``nullptr`` without decreasing the
+        object's reference count. The function returns a raw handle to the original
+        Python object.
+    \endrst */
+    handle release() {
+        PyObject *tmp = m_ptr;
+        m_ptr = nullptr;
+        return handle(tmp);
+    }
+
+    object &operator=(const object &other) {
+        // Skip inc_ref and dec_ref if both objects are the same
+        if (!this->is(other)) {
+            other.inc_ref();
+            // Use temporary variable to ensure `*this` remains valid while
+            // `Py_XDECREF` executes, in case `*this` is accessible from Python.
+            handle temp(m_ptr);
+            m_ptr = other.m_ptr;
+            temp.dec_ref();
+        }
+        return *this;
+    }
+
+    object &operator=(object &&other) noexcept {
+        if (this != &other) {
+            handle temp(m_ptr);
+            m_ptr = other.m_ptr;
+            other.m_ptr = nullptr;
+            temp.dec_ref();
+        }
+        return *this;
+    }
+
+#define PYBIND11_INPLACE_OP(iop)                                                                  \
+    object iop(object_api const &other) { return operator=(handle::iop(other)); }
+
+    PYBIND11_INPLACE_OP(operator+=)
+    PYBIND11_INPLACE_OP(operator-=)
+    PYBIND11_INPLACE_OP(operator*=)
+    PYBIND11_INPLACE_OP(operator/=)
+    PYBIND11_INPLACE_OP(operator|=)
+    PYBIND11_INPLACE_OP(operator&=)
+    PYBIND11_INPLACE_OP(operator^=)
+    PYBIND11_INPLACE_OP(operator<<=)
+    PYBIND11_INPLACE_OP(operator>>=)
+#undef PYBIND11_INPLACE_OP
+
+    // Calling cast() on an object lvalue just copies (via handle::cast)
+    template <typename T>
+    T cast() const &;
+    // Calling on an object rvalue does a move, if needed and/or possible
+    template <typename T>
+    T cast() &&;
+
+protected:
+    // Tags for choosing constructors from raw PyObject *
+    struct borrowed_t {};
+    struct stolen_t {};
+
+    /// @cond BROKEN
+    template <typename T>
+    friend T reinterpret_borrow(handle);
+    template <typename T>
+    friend T reinterpret_steal(handle);
+    /// @endcond
+
+public:
+    // Only accessible from derived classes and the reinterpret_* functions
+    object(handle h, borrowed_t) : handle(h) { inc_ref(); }
+    object(handle h, stolen_t) : handle(h) {}
+};
+
+/** \rst
+    Declare that a `handle` or ``PyObject *`` is a certain type and borrow the reference.
+    The target type ``T`` must be `object` or one of its derived classes. The function
+    doesn't do any conversions or checks. It's up to the user to make sure that the
+    target type is correct.
+
+    .. code-block:: cpp
+
+        PyObject *p = PyList_GetItem(obj, index);
+        py::object o = reinterpret_borrow<py::object>(p);
+        // or
+        py::tuple t = reinterpret_borrow<py::tuple>(p); // <-- `p` must be already be a `tuple`
+\endrst */
+template <typename T>
+T reinterpret_borrow(handle h) {
+    return {h, object::borrowed_t{}};
+}
+
+/** \rst
+    Like `reinterpret_borrow`, but steals the reference.
+
+     .. code-block:: cpp
+
+        PyObject *p = PyObject_Str(obj);
+        py::str s = reinterpret_steal<py::str>(p); // <-- `p` must be already be a `str`
+\endrst */
+template <typename T>
+T reinterpret_steal(handle h) {
+    return {h, object::stolen_t{}};
+}
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+// Equivalent to obj.__class__.__name__ (or obj.__name__ if obj is a class).
+inline const char *obj_class_name(PyObject *obj) {
+    if (PyType_Check(obj)) {
+        return reinterpret_cast<PyTypeObject *>(obj)->tp_name;
+    }
+    return Py_TYPE(obj)->tp_name;
+}
+
+std::string error_string();
+
+// The code in this struct is very unusual, to minimize the chances of
+// masking bugs (elsewhere) by errors during the error handling (here).
+// This is meant to be a lifeline for troubleshooting long-running processes
+// that crash under conditions that are virtually impossible to reproduce.
+// Low-level implementation alternatives are preferred to higher-level ones
+// that might raise cascading exceptions. Last-ditch-kind-of attempts are made
+// to report as much of the original error as possible, even if there are
+// secondary issues obtaining some of the details.
+struct error_fetch_and_normalize {
+    // This comment only applies to Python <= 3.11:
+    //     Immediate normalization is long-established behavior (starting with
+    //     https://github.com/pybind/pybind11/commit/135ba8deafb8bf64a15b24d1513899eb600e2011
+    //     from Sep 2016) and safest. Normalization could be deferred, but this could mask
+    //     errors elsewhere, the performance gain is very minor in typical situations
+    //     (usually the dominant bottleneck is EH unwinding), and the implementation here
+    //     would be more complex.
+    // Starting with Python 3.12, PyErr_Fetch() normalizes exceptions immediately.
+    // Any errors during normalization are tracked under __notes__.
+    explicit error_fetch_and_normalize(const char *called) {
+        PyErr_Fetch(&m_type.ptr(), &m_value.ptr(), &m_trace.ptr());
+        if (!m_type) {
+            pybind11_fail("Internal error: " + std::string(called)
+                          + " called while "
+                            "Python error indicator not set.");
+        }
+        const char *exc_type_name_orig = detail::obj_class_name(m_type.ptr());
+        if (exc_type_name_orig == nullptr) {
+            pybind11_fail("Internal error: " + std::string(called)
+                          + " failed to obtain the name "
+                            "of the original active exception type.");
+        }
+        m_lazy_error_string = exc_type_name_orig;
+#if PY_VERSION_HEX >= 0x030C0000
+        // The presence of __notes__ is likely due to exception normalization
+        // errors, although that is not necessarily true, therefore insert a
+        // hint only:
+        if (PyObject_HasAttrString(m_value.ptr(), "__notes__")) {
+            m_lazy_error_string += "[WITH __notes__]";
+        }
+#else
+        // PyErr_NormalizeException() may change the exception type if there are cascading
+        // failures. This can potentially be extremely confusing.
+        PyErr_NormalizeException(&m_type.ptr(), &m_value.ptr(), &m_trace.ptr());
+        if (m_type.ptr() == nullptr) {
+            pybind11_fail("Internal error: " + std::string(called)
+                          + " failed to normalize the "
+                            "active exception.");
+        }
+        const char *exc_type_name_norm = detail::obj_class_name(m_type.ptr());
+        if (exc_type_name_norm == nullptr) {
+            pybind11_fail("Internal error: " + std::string(called)
+                          + " failed to obtain the name "
+                            "of the normalized active exception type.");
+        }
+#    if defined(PYPY_VERSION_NUM) && PYPY_VERSION_NUM < 0x07030a00
+        // This behavior runs the risk of masking errors in the error handling, but avoids a
+        // conflict with PyPy, which relies on the normalization here to change OSError to
+        // FileNotFoundError (https://github.com/pybind/pybind11/issues/4075).
+        m_lazy_error_string = exc_type_name_norm;
+#    else
+        if (exc_type_name_norm != m_lazy_error_string) {
+            std::string msg = std::string(called)
+                              + ": MISMATCH of original and normalized "
+                                "active exception types: ";
+            msg += "ORIGINAL ";
+            msg += m_lazy_error_string;
+            msg += " REPLACED BY ";
+            msg += exc_type_name_norm;
+            msg += ": " + format_value_and_trace();
+            pybind11_fail(msg);
+        }
+#    endif
+#endif
+    }
+
+    error_fetch_and_normalize(const error_fetch_and_normalize &) = delete;
+    error_fetch_and_normalize(error_fetch_and_normalize &&) = delete;
+
+    std::string format_value_and_trace() const {
+        std::string result;
+        std::string message_error_string;
+        if (m_value) {
+            auto value_str = reinterpret_steal<object>(PyObject_Str(m_value.ptr()));
+            constexpr const char *message_unavailable_exc
+                = "<MESSAGE UNAVAILABLE DUE TO ANOTHER EXCEPTION>";
+            if (!value_str) {
+                message_error_string = detail::error_string();
+                result = message_unavailable_exc;
+            } else {
+                // Not using `value_str.cast<std::string>()`, to not potentially throw a secondary
+                // error_already_set that will then result in process termination (#4288).
+                auto value_bytes = reinterpret_steal<object>(
+                    PyUnicode_AsEncodedString(value_str.ptr(), "utf-8", "backslashreplace"));
+                if (!value_bytes) {
+                    message_error_string = detail::error_string();
+                    result = message_unavailable_exc;
+                } else {
+                    char *buffer = nullptr;
+                    Py_ssize_t length = 0;
+                    if (PyBytes_AsStringAndSize(value_bytes.ptr(), &buffer, &length) == -1) {
+                        message_error_string = detail::error_string();
+                        result = message_unavailable_exc;
+                    } else {
+                        result = std::string(buffer, static_cast<std::size_t>(length));
+                    }
+                }
+            }
+#if PY_VERSION_HEX >= 0x030B0000
+            auto notes
+                = reinterpret_steal<object>(PyObject_GetAttrString(m_value.ptr(), "__notes__"));
+            if (!notes) {
+                PyErr_Clear(); // No notes is good news.
+            } else {
+                auto len_notes = PyList_Size(notes.ptr());
+                if (len_notes < 0) {
+                    result += "\nFAILURE obtaining len(__notes__): " + detail::error_string();
+                } else {
+                    result += "\n__notes__ (len=" + std::to_string(len_notes) + "):";
+                    for (ssize_t i = 0; i < len_notes; i++) {
+                        PyObject *note = PyList_GET_ITEM(notes.ptr(), i);
+                        auto note_bytes = reinterpret_steal<object>(
+                            PyUnicode_AsEncodedString(note, "utf-8", "backslashreplace"));
+                        if (!note_bytes) {
+                            result += "\nFAILURE obtaining __notes__[" + std::to_string(i)
+                                      + "]: " + detail::error_string();
+                        } else {
+                            char *buffer = nullptr;
+                            Py_ssize_t length = 0;
+                            if (PyBytes_AsStringAndSize(note_bytes.ptr(), &buffer, &length)
+                                == -1) {
+                                result += "\nFAILURE formatting __notes__[" + std::to_string(i)
+                                          + "]: " + detail::error_string();
+                            } else {
+                                result += '\n';
+                                result += std::string(buffer, static_cast<std::size_t>(length));
+                            }
+                        }
+                    }
+                }
+            }
+#endif
+        } else {
+            result = "<MESSAGE UNAVAILABLE>";
+        }
+        if (result.empty()) {
+            result = "<EMPTY MESSAGE>";
+        }
+
+        bool have_trace = false;
+        if (m_trace) {
+#if !defined(PYPY_VERSION)
+            auto *tb = reinterpret_cast<PyTracebackObject *>(m_trace.ptr());
+
+            // Get the deepest trace possible.
+            while (tb->tb_next) {
+                tb = tb->tb_next;
+            }
+
+            PyFrameObject *frame = tb->tb_frame;
+            Py_XINCREF(frame);
+            result += "\n\nAt:\n";
+            while (frame) {
+#    if PY_VERSION_HEX >= 0x030900B1
+                PyCodeObject *f_code = PyFrame_GetCode(frame);
+#    else
+                PyCodeObject *f_code = frame->f_code;
+                Py_INCREF(f_code);
+#    endif
+                int lineno = PyFrame_GetLineNumber(frame);
+                result += "  ";
+                result += handle(f_code->co_filename).cast<std::string>();
+                result += '(';
+                result += std::to_string(lineno);
+                result += "): ";
+                result += handle(f_code->co_name).cast<std::string>();
+                result += '\n';
+                Py_DECREF(f_code);
+#    if PY_VERSION_HEX >= 0x030900B1
+                auto *b_frame = PyFrame_GetBack(frame);
+#    else
+                auto *b_frame = frame->f_back;
+                Py_XINCREF(b_frame);
+#    endif
+                Py_DECREF(frame);
+                frame = b_frame;
+            }
+
+            have_trace = true;
+#endif //! defined(PYPY_VERSION)
+        }
+
+        if (!message_error_string.empty()) {
+            if (!have_trace) {
+                result += '\n';
+            }
+            result += "\nMESSAGE UNAVAILABLE DUE TO EXCEPTION: " + message_error_string;
+        }
+
+        return result;
+    }
+
+    std::string const &error_string() const {
+        if (!m_lazy_error_string_completed) {
+            m_lazy_error_string += ": " + format_value_and_trace();
+            m_lazy_error_string_completed = true;
+        }
+        return m_lazy_error_string;
+    }
+
+    void restore() {
+        if (m_restore_called) {
+            pybind11_fail("Internal error: pybind11::detail::error_fetch_and_normalize::restore() "
+                          "called a second time. ORIGINAL ERROR: "
+                          + error_string());
+        }
+        PyErr_Restore(m_type.inc_ref().ptr(), m_value.inc_ref().ptr(), m_trace.inc_ref().ptr());
+        m_restore_called = true;
+    }
+
+    bool matches(handle exc) const {
+        return (PyErr_GivenExceptionMatches(m_type.ptr(), exc.ptr()) != 0);
+    }
+
+    // Not protecting these for simplicity.
+    object m_type, m_value, m_trace;
+
+private:
+    // Only protecting invariants.
+    mutable std::string m_lazy_error_string;
+    mutable bool m_lazy_error_string_completed = false;
+    mutable bool m_restore_called = false;
+};
+
+inline std::string error_string() {
+    return error_fetch_and_normalize("pybind11::detail::error_string").error_string();
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+/// Fetch and hold an error which was already set in Python.  An instance of this is typically
+/// thrown to propagate python-side errors back through C++ which can either be caught manually or
+/// else falls back to the function dispatcher (which then raises the captured error back to
+/// python).
+class PYBIND11_EXPORT_EXCEPTION error_already_set : public std::exception {
+public:
+    /// Fetches the current Python exception (using PyErr_Fetch()), which will clear the
+    /// current Python error indicator.
+    error_already_set()
+        : m_fetched_error{new detail::error_fetch_and_normalize("pybind11::error_already_set"),
+                          m_fetched_error_deleter} {}
+
+    /// The what() result is built lazily on demand.
+    /// WARNING: This member function needs to acquire the Python GIL. This can lead to
+    ///          crashes (undefined behavior) if the Python interpreter is finalizing.
+    const char *what() const noexcept override;
+
+    /// Restores the currently-held Python error (which will clear the Python error indicator first
+    /// if already set).
+    /// NOTE: This member function will always restore the normalized exception, which may or may
+    ///       not be the original Python exception.
+    /// WARNING: The GIL must be held when this member function is called!
+    void restore() { m_fetched_error->restore(); }
+
+    /// If it is impossible to raise the currently-held error, such as in a destructor, we can
+    /// write it out using Python's unraisable hook (`sys.unraisablehook`). The error context
+    /// should be some object whose `repr()` helps identify the location of the error. Python
+    /// already knows the type and value of the error, so there is no need to repeat that.
+    void discard_as_unraisable(object err_context) {
+        restore();
+        PyErr_WriteUnraisable(err_context.ptr());
+    }
+    /// An alternate version of `discard_as_unraisable()`, where a string provides information on
+    /// the location of the error. For example, `__func__` could be helpful.
+    /// WARNING: The GIL must be held when this member function is called!
+    void discard_as_unraisable(const char *err_context) {
+        discard_as_unraisable(reinterpret_steal<object>(PYBIND11_FROM_STRING(err_context)));
+    }
+
+    // Does nothing; provided for backwards compatibility.
+    PYBIND11_DEPRECATED("Use of error_already_set.clear() is deprecated")
+    void clear() {}
+
+    /// Check if the currently trapped error type matches the given Python exception class (or a
+    /// subclass thereof).  May also be passed a tuple to search for any exception class matches in
+    /// the given tuple.
+    bool matches(handle exc) const { return m_fetched_error->matches(exc); }
+
+    const object &type() const { return m_fetched_error->m_type; }
+    const object &value() const { return m_fetched_error->m_value; }
+    const object &trace() const { return m_fetched_error->m_trace; }
+
+private:
+    std::shared_ptr<detail::error_fetch_and_normalize> m_fetched_error;
+
+    /// WARNING: This custom deleter needs to acquire the Python GIL. This can lead to
+    ///          crashes (undefined behavior) if the Python interpreter is finalizing.
+    static void m_fetched_error_deleter(detail::error_fetch_and_normalize *raw_ptr);
+};
+
+/// Replaces the current Python error indicator with the chosen error, performing a
+/// 'raise from' to indicate that the chosen error was caused by the original error.
+inline void raise_from(PyObject *type, const char *message) {
+    // Based on _PyErr_FormatVFromCause:
+    // https://github.com/python/cpython/blob/467ab194fc6189d9f7310c89937c51abeac56839/Python/errors.c#L405
+    // See https://github.com/pybind/pybind11/pull/2112 for details.
+    PyObject *exc = nullptr, *val = nullptr, *val2 = nullptr, *tb = nullptr;
+
+    assert(PyErr_Occurred());
+    PyErr_Fetch(&exc, &val, &tb);
+    PyErr_NormalizeException(&exc, &val, &tb);
+    if (tb != nullptr) {
+        PyException_SetTraceback(val, tb);
+        Py_DECREF(tb);
+    }
+    Py_DECREF(exc);
+    assert(!PyErr_Occurred());
+
+    PyErr_SetString(type, message);
+
+    PyErr_Fetch(&exc, &val2, &tb);
+    PyErr_NormalizeException(&exc, &val2, &tb);
+    Py_INCREF(val);
+    PyException_SetCause(val2, val);
+    PyException_SetContext(val2, val);
+    PyErr_Restore(exc, val2, tb);
+}
+
+/// Sets the current Python error indicator with the chosen error, performing a 'raise from'
+/// from the error contained in error_already_set to indicate that the chosen error was
+/// caused by the original error.
+inline void raise_from(error_already_set &err, PyObject *type, const char *message) {
+    err.restore();
+    raise_from(type, message);
+}
+
+/** \defgroup python_builtins const_name
+    Unless stated otherwise, the following C++ functions behave the same
+    as their Python counterparts.
+ */
+
+/** \ingroup python_builtins
+    \rst
+    Return true if ``obj`` is an instance of ``T``. Type ``T`` must be a subclass of
+    `object` or a class which was exposed to Python as ``py::class_<T>``.
+\endrst */
+template <typename T, detail::enable_if_t<std::is_base_of<object, T>::value, int> = 0>
+bool isinstance(handle obj) {
+    return T::check_(obj);
+}
+
+template <typename T, detail::enable_if_t<!std::is_base_of<object, T>::value, int> = 0>
+bool isinstance(handle obj) {
+    return detail::isinstance_generic(obj, typeid(T));
+}
+
+template <>
+inline bool isinstance<handle>(handle) = delete;
+template <>
+inline bool isinstance<object>(handle obj) {
+    return obj.ptr() != nullptr;
+}
+
+/// \ingroup python_builtins
+/// Return true if ``obj`` is an instance of the ``type``.
+inline bool isinstance(handle obj, handle type) {
+    const auto result = PyObject_IsInstance(obj.ptr(), type.ptr());
+    if (result == -1) {
+        throw error_already_set();
+    }
+    return result != 0;
+}
+
+/// \addtogroup python_builtins
+/// @{
+inline bool hasattr(handle obj, handle name) {
+    return PyObject_HasAttr(obj.ptr(), name.ptr()) == 1;
+}
+
+inline bool hasattr(handle obj, const char *name) {
+    return PyObject_HasAttrString(obj.ptr(), name) == 1;
+}
+
+inline void delattr(handle obj, handle name) {
+    if (PyObject_DelAttr(obj.ptr(), name.ptr()) != 0) {
+        throw error_already_set();
+    }
+}
+
+inline void delattr(handle obj, const char *name) {
+    if (PyObject_DelAttrString(obj.ptr(), name) != 0) {
+        throw error_already_set();
+    }
+}
+
+inline object getattr(handle obj, handle name) {
+    PyObject *result = PyObject_GetAttr(obj.ptr(), name.ptr());
+    if (!result) {
+        throw error_already_set();
+    }
+    return reinterpret_steal<object>(result);
+}
+
+inline object getattr(handle obj, const char *name) {
+    PyObject *result = PyObject_GetAttrString(obj.ptr(), name);
+    if (!result) {
+        throw error_already_set();
+    }
+    return reinterpret_steal<object>(result);
+}
+
+inline object getattr(handle obj, handle name, handle default_) {
+    if (PyObject *result = PyObject_GetAttr(obj.ptr(), name.ptr())) {
+        return reinterpret_steal<object>(result);
+    }
+    PyErr_Clear();
+    return reinterpret_borrow<object>(default_);
+}
+
+inline object getattr(handle obj, const char *name, handle default_) {
+    if (PyObject *result = PyObject_GetAttrString(obj.ptr(), name)) {
+        return reinterpret_steal<object>(result);
+    }
+    PyErr_Clear();
+    return reinterpret_borrow<object>(default_);
+}
+
+inline void setattr(handle obj, handle name, handle value) {
+    if (PyObject_SetAttr(obj.ptr(), name.ptr(), value.ptr()) != 0) {
+        throw error_already_set();
+    }
+}
+
+inline void setattr(handle obj, const char *name, handle value) {
+    if (PyObject_SetAttrString(obj.ptr(), name, value.ptr()) != 0) {
+        throw error_already_set();
+    }
+}
+
+inline ssize_t hash(handle obj) {
+    auto h = PyObject_Hash(obj.ptr());
+    if (h == -1) {
+        throw error_already_set();
+    }
+    return h;
+}
+
+/// @} python_builtins
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+inline handle get_function(handle value) {
+    if (value) {
+        if (PyInstanceMethod_Check(value.ptr())) {
+            value = PyInstanceMethod_GET_FUNCTION(value.ptr());
+        } else if (PyMethod_Check(value.ptr())) {
+            value = PyMethod_GET_FUNCTION(value.ptr());
+        }
+    }
+    return value;
+}
+
+// Reimplementation of python's dict helper functions to ensure that exceptions
+// aren't swallowed (see #2862)
+
+// copied from cpython _PyDict_GetItemStringWithError
+inline PyObject *dict_getitemstring(PyObject *v, const char *key) {
+    PyObject *kv = nullptr, *rv = nullptr;
+    kv = PyUnicode_FromString(key);
+    if (kv == nullptr) {
+        throw error_already_set();
+    }
+
+    rv = PyDict_GetItemWithError(v, kv);
+    Py_DECREF(kv);
+    if (rv == nullptr && PyErr_Occurred()) {
+        throw error_already_set();
+    }
+    return rv;
+}
+
+inline PyObject *dict_getitem(PyObject *v, PyObject *key) {
+    PyObject *rv = PyDict_GetItemWithError(v, key);
+    if (rv == nullptr && PyErr_Occurred()) {
+        throw error_already_set();
+    }
+    return rv;
+}
+
+inline PyObject *dict_getitemstringref(PyObject *v, const char *key) {
+#if PY_VERSION_HEX >= 0x030D0000
+    PyObject *rv;
+    if (PyDict_GetItemStringRef(v, key, &rv) < 0) {
+        throw error_already_set();
+    }
+    return rv;
+#else
+    PyObject *rv = dict_getitemstring(v, key);
+    if (rv == nullptr && PyErr_Occurred()) {
+        throw error_already_set();
+    }
+    Py_XINCREF(rv);
+    return rv;
+#endif
+}
+
+// Helper aliases/functions to support implicit casting of values given to python
+// accessors/methods. When given a pyobject, this simply returns the pyobject as-is; for other C++
+// type, the value goes through pybind11::cast(obj) to convert it to an `object`.
+template <typename T, enable_if_t<is_pyobject<T>::value, int> = 0>
+auto object_or_cast(T &&o) -> decltype(std::forward<T>(o)) {
+    return std::forward<T>(o);
+}
+// The following casting version is implemented in cast.h:
+template <typename T, enable_if_t<!is_pyobject<T>::value, int> = 0>
+object object_or_cast(T &&o);
+// Match a PyObject*, which we want to convert directly to handle via its converting constructor
+inline handle object_or_cast(PyObject *ptr) { return ptr; }
+
+PYBIND11_WARNING_PUSH
+PYBIND11_WARNING_DISABLE_MSVC(4522) // warning C4522: multiple assignment operators specified
+template <typename Policy>
+class accessor : public object_api<accessor<Policy>> {
+    using key_type = typename Policy::key_type;
+
+public:
+    accessor(handle obj, key_type key) : obj(obj), key(std::move(key)) {}
+    accessor(const accessor &) = default;
+    accessor(accessor &&) noexcept = default;
+
+    // accessor overload required to override default assignment operator (templates are not
+    // allowed to replace default compiler-generated assignments).
+    void operator=(const accessor &a) && { std::move(*this).operator=(handle(a)); }
+    void operator=(const accessor &a) & { operator=(handle(a)); }
+
+    template <typename T>
+    void operator=(T &&value) && {
+        Policy::set(obj, key, object_or_cast(std::forward<T>(value)));
+    }
+    template <typename T>
+    void operator=(T &&value) & {
+        get_cache() = ensure_object(object_or_cast(std::forward<T>(value)));
+    }
+
+    template <typename T = Policy>
+    PYBIND11_DEPRECATED(
+        "Use of obj.attr(...) as bool is deprecated in favor of pybind11::hasattr(obj, ...)")
+    explicit
+    operator enable_if_t<std::is_same<T, accessor_policies::str_attr>::value
+                             || std::is_same<T, accessor_policies::obj_attr>::value,
+                         bool>() const {
+        return hasattr(obj, key);
+    }
+    template <typename T = Policy>
+    PYBIND11_DEPRECATED("Use of obj[key] as bool is deprecated in favor of obj.contains(key)")
+    explicit
+    operator enable_if_t<std::is_same<T, accessor_policies::generic_item>::value, bool>() const {
+        return obj.contains(key);
+    }
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator object() const { return get_cache(); }
+    PyObject *ptr() const { return get_cache().ptr(); }
+    template <typename T>
+    T cast() const {
+        return get_cache().template cast<T>();
+    }
+
+private:
+    static object ensure_object(object &&o) { return std::move(o); }
+    static object ensure_object(handle h) { return reinterpret_borrow<object>(h); }
+
+    object &get_cache() const {
+        if (!cache) {
+            cache = Policy::get(obj, key);
+        }
+        return cache;
+    }
+
+private:
+    handle obj;
+    key_type key;
+    mutable object cache;
+};
+PYBIND11_WARNING_POP
+
+PYBIND11_NAMESPACE_BEGIN(accessor_policies)
+struct obj_attr {
+    using key_type = object;
+    static object get(handle obj, handle key) { return getattr(obj, key); }
+    static void set(handle obj, handle key, handle val) { setattr(obj, key, val); }
+};
+
+struct str_attr {
+    using key_type = const char *;
+    static object get(handle obj, const char *key) { return getattr(obj, key); }
+    static void set(handle obj, const char *key, handle val) { setattr(obj, key, val); }
+};
+
+struct generic_item {
+    using key_type = object;
+
+    static object get(handle obj, handle key) {
+        PyObject *result = PyObject_GetItem(obj.ptr(), key.ptr());
+        if (!result) {
+            throw error_already_set();
+        }
+        return reinterpret_steal<object>(result);
+    }
+
+    static void set(handle obj, handle key, handle val) {
+        if (PyObject_SetItem(obj.ptr(), key.ptr(), val.ptr()) != 0) {
+            throw error_already_set();
+        }
+    }
+};
+
+struct sequence_item {
+    using key_type = size_t;
+
+    template <typename IdxType, detail::enable_if_t<std::is_integral<IdxType>::value, int> = 0>
+    static object get(handle obj, const IdxType &index) {
+        PyObject *result = PySequence_GetItem(obj.ptr(), ssize_t_cast(index));
+        if (!result) {
+            throw error_already_set();
+        }
+        return reinterpret_steal<object>(result);
+    }
+
+    template <typename IdxType, detail::enable_if_t<std::is_integral<IdxType>::value, int> = 0>
+    static void set(handle obj, const IdxType &index, handle val) {
+        // PySequence_SetItem does not steal a reference to 'val'
+        if (PySequence_SetItem(obj.ptr(), ssize_t_cast(index), val.ptr()) != 0) {
+            throw error_already_set();
+        }
+    }
+};
+
+struct list_item {
+    using key_type = size_t;
+
+    template <typename IdxType, detail::enable_if_t<std::is_integral<IdxType>::value, int> = 0>
+    static object get(handle obj, const IdxType &index) {
+        PyObject *result = PyList_GetItem(obj.ptr(), ssize_t_cast(index));
+        if (!result) {
+            throw error_already_set();
+        }
+        return reinterpret_borrow<object>(result);
+    }
+
+    template <typename IdxType, detail::enable_if_t<std::is_integral<IdxType>::value, int> = 0>
+    static void set(handle obj, const IdxType &index, handle val) {
+        // PyList_SetItem steals a reference to 'val'
+        if (PyList_SetItem(obj.ptr(), ssize_t_cast(index), val.inc_ref().ptr()) != 0) {
+            throw error_already_set();
+        }
+    }
+};
+
+struct tuple_item {
+    using key_type = size_t;
+
+    template <typename IdxType, detail::enable_if_t<std::is_integral<IdxType>::value, int> = 0>
+    static object get(handle obj, const IdxType &index) {
+        PyObject *result = PyTuple_GetItem(obj.ptr(), ssize_t_cast(index));
+        if (!result) {
+            throw error_already_set();
+        }
+        return reinterpret_borrow<object>(result);
+    }
+
+    template <typename IdxType, detail::enable_if_t<std::is_integral<IdxType>::value, int> = 0>
+    static void set(handle obj, const IdxType &index, handle val) {
+        // PyTuple_SetItem steals a reference to 'val'
+        if (PyTuple_SetItem(obj.ptr(), ssize_t_cast(index), val.inc_ref().ptr()) != 0) {
+            throw error_already_set();
+        }
+    }
+};
+PYBIND11_NAMESPACE_END(accessor_policies)
+
+/// STL iterator template used for tuple, list, sequence and dict
+template <typename Policy>
+class generic_iterator : public Policy {
+    using It = generic_iterator;
+
+public:
+    using difference_type = ssize_t;
+    using iterator_category = typename Policy::iterator_category;
+    using value_type = typename Policy::value_type;
+    using reference = typename Policy::reference;
+    using pointer = typename Policy::pointer;
+
+    generic_iterator() = default;
+    generic_iterator(handle seq, ssize_t index) : Policy(seq, index) {}
+
+    // NOLINTNEXTLINE(readability-const-return-type) // PR #3263
+    reference operator*() const { return Policy::dereference(); }
+    // NOLINTNEXTLINE(readability-const-return-type) // PR #3263
+    reference operator[](difference_type n) const { return *(*this + n); }
+    pointer operator->() const { return **this; }
+
+    It &operator++() {
+        Policy::increment();
+        return *this;
+    }
+    It operator++(int) {
+        auto copy = *this;
+        Policy::increment();
+        return copy;
+    }
+    It &operator--() {
+        Policy::decrement();
+        return *this;
+    }
+    It operator--(int) {
+        auto copy = *this;
+        Policy::decrement();
+        return copy;
+    }
+    It &operator+=(difference_type n) {
+        Policy::advance(n);
+        return *this;
+    }
+    It &operator-=(difference_type n) {
+        Policy::advance(-n);
+        return *this;
+    }
+
+    friend It operator+(const It &a, difference_type n) {
+        auto copy = a;
+        return copy += n;
+    }
+    friend It operator+(difference_type n, const It &b) { return b + n; }
+    friend It operator-(const It &a, difference_type n) {
+        auto copy = a;
+        return copy -= n;
+    }
+    friend difference_type operator-(const It &a, const It &b) { return a.distance_to(b); }
+
+    friend bool operator==(const It &a, const It &b) { return a.equal(b); }
+    friend bool operator!=(const It &a, const It &b) { return !(a == b); }
+    friend bool operator<(const It &a, const It &b) { return b - a > 0; }
+    friend bool operator>(const It &a, const It &b) { return b < a; }
+    friend bool operator>=(const It &a, const It &b) { return !(a < b); }
+    friend bool operator<=(const It &a, const It &b) { return !(a > b); }
+};
+
+PYBIND11_NAMESPACE_BEGIN(iterator_policies)
+/// Quick proxy class needed to implement ``operator->`` for iterators which can't return pointers
+template <typename T>
+struct arrow_proxy {
+    T value;
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    arrow_proxy(T &&value) noexcept : value(std::move(value)) {}
+    T *operator->() const { return &value; }
+};
+
+/// Lightweight iterator policy using just a simple pointer: see ``PySequence_Fast_ITEMS``
+class sequence_fast_readonly {
+protected:
+    using iterator_category = std::random_access_iterator_tag;
+    using value_type = handle;
+    using reference = const handle; // PR #3263
+    using pointer = arrow_proxy<const handle>;
+
+    sequence_fast_readonly(handle obj, ssize_t n) : ptr(PySequence_Fast_ITEMS(obj.ptr()) + n) {}
+
+    // NOLINTNEXTLINE(readability-const-return-type) // PR #3263
+    reference dereference() const { return *ptr; }
+    void increment() { ++ptr; }
+    void decrement() { --ptr; }
+    void advance(ssize_t n) { ptr += n; }
+    bool equal(const sequence_fast_readonly &b) const { return ptr == b.ptr; }
+    ssize_t distance_to(const sequence_fast_readonly &b) const { return ptr - b.ptr; }
+
+private:
+    PyObject **ptr;
+};
+
+/// Full read and write access using the sequence protocol: see ``detail::sequence_accessor``
+class sequence_slow_readwrite {
+protected:
+    using iterator_category = std::random_access_iterator_tag;
+    using value_type = object;
+    using reference = sequence_accessor;
+    using pointer = arrow_proxy<const sequence_accessor>;
+
+    sequence_slow_readwrite(handle obj, ssize_t index) : obj(obj), index(index) {}
+
+    reference dereference() const { return {obj, static_cast<size_t>(index)}; }
+    void increment() { ++index; }
+    void decrement() { --index; }
+    void advance(ssize_t n) { index += n; }
+    bool equal(const sequence_slow_readwrite &b) const { return index == b.index; }
+    ssize_t distance_to(const sequence_slow_readwrite &b) const { return index - b.index; }
+
+private:
+    handle obj;
+    ssize_t index;
+};
+
+/// Python's dictionary protocol permits this to be a forward iterator
+class dict_readonly {
+protected:
+    using iterator_category = std::forward_iterator_tag;
+    using value_type = std::pair<handle, handle>;
+    using reference = const value_type; // PR #3263
+    using pointer = arrow_proxy<const value_type>;
+
+    dict_readonly() = default;
+    dict_readonly(handle obj, ssize_t pos) : obj(obj), pos(pos) { increment(); }
+
+    // NOLINTNEXTLINE(readability-const-return-type) // PR #3263
+    reference dereference() const { return {key, value}; }
+    void increment() {
+        if (PyDict_Next(obj.ptr(), &pos, &key, &value) == 0) {
+            pos = -1;
+        }
+    }
+    bool equal(const dict_readonly &b) const { return pos == b.pos; }
+
+private:
+    handle obj;
+    PyObject *key = nullptr, *value = nullptr;
+    ssize_t pos = -1;
+};
+PYBIND11_NAMESPACE_END(iterator_policies)
+
+#if !defined(PYPY_VERSION)
+using tuple_iterator = generic_iterator<iterator_policies::sequence_fast_readonly>;
+using list_iterator = generic_iterator<iterator_policies::sequence_fast_readonly>;
+#else
+using tuple_iterator = generic_iterator<iterator_policies::sequence_slow_readwrite>;
+using list_iterator = generic_iterator<iterator_policies::sequence_slow_readwrite>;
+#endif
+
+using sequence_iterator = generic_iterator<iterator_policies::sequence_slow_readwrite>;
+using dict_iterator = generic_iterator<iterator_policies::dict_readonly>;
+
+inline bool PyIterable_Check(PyObject *obj) {
+    PyObject *iter = PyObject_GetIter(obj);
+    if (iter) {
+        Py_DECREF(iter);
+        return true;
+    }
+    PyErr_Clear();
+    return false;
+}
+
+inline bool PyNone_Check(PyObject *o) { return o == Py_None; }
+inline bool PyEllipsis_Check(PyObject *o) { return o == Py_Ellipsis; }
+
+#ifdef PYBIND11_STR_LEGACY_PERMISSIVE
+inline bool PyUnicode_Check_Permissive(PyObject *o) {
+    return PyUnicode_Check(o) || PYBIND11_BYTES_CHECK(o);
+}
+#    define PYBIND11_STR_CHECK_FUN detail::PyUnicode_Check_Permissive
+#else
+#    define PYBIND11_STR_CHECK_FUN PyUnicode_Check
+#endif
+
+inline bool PyStaticMethod_Check(PyObject *o) { return o->ob_type == &PyStaticMethod_Type; }
+
+class kwargs_proxy : public handle {
+public:
+    explicit kwargs_proxy(handle h) : handle(h) {}
+};
+
+class args_proxy : public handle {
+public:
+    explicit args_proxy(handle h) : handle(h) {}
+    kwargs_proxy operator*() const { return kwargs_proxy(*this); }
+};
+
+/// Python argument categories (using PEP 448 terms)
+template <typename T>
+using is_keyword = std::is_base_of<arg, T>;
+template <typename T>
+using is_s_unpacking = std::is_same<args_proxy, T>; // * unpacking
+template <typename T>
+using is_ds_unpacking = std::is_same<kwargs_proxy, T>; // ** unpacking
+template <typename T>
+using is_positional = satisfies_none_of<T, is_keyword, is_s_unpacking, is_ds_unpacking>;
+template <typename T>
+using is_keyword_or_ds = satisfies_any_of<T, is_keyword, is_ds_unpacking>;
+
+// Call argument collector forward declarations
+template <return_value_policy policy = return_value_policy::automatic_reference>
+class simple_collector;
+template <return_value_policy policy = return_value_policy::automatic_reference>
+class unpacking_collector;
+
+PYBIND11_NAMESPACE_END(detail)
+
+// TODO: After the deprecated constructors are removed, this macro can be simplified by
+//       inheriting ctors: `using Parent::Parent`. It's not an option right now because
+//       the `using` statement triggers the parent deprecation warning even if the ctor
+//       isn't even used.
+#define PYBIND11_OBJECT_COMMON(Name, Parent, CheckFun)                                            \
+public:                                                                                           \
+    PYBIND11_DEPRECATED("Use reinterpret_borrow<" #Name ">() or reinterpret_steal<" #Name ">()")  \
+    Name(handle h, bool is_borrowed)                                                              \
+        : Parent(is_borrowed ? Parent(h, borrowed_t{}) : Parent(h, stolen_t{})) {}                \
+    Name(handle h, borrowed_t) : Parent(h, borrowed_t{}) {}                                       \
+    Name(handle h, stolen_t) : Parent(h, stolen_t{}) {}                                           \
+    PYBIND11_DEPRECATED("Use py::isinstance<py::python_type>(obj) instead")                       \
+    bool check() const { return m_ptr != nullptr && (CheckFun(m_ptr) != 0); }                     \
+    static bool check_(handle h) { return h.ptr() != nullptr && CheckFun(h.ptr()); }              \
+    template <typename Policy_> /* NOLINTNEXTLINE(google-explicit-constructor) */                 \
+    Name(const ::pybind11::detail::accessor<Policy_> &a) : Name(object(a)) {}
+
+#define PYBIND11_OBJECT_CVT(Name, Parent, CheckFun, ConvertFun)                                   \
+    PYBIND11_OBJECT_COMMON(Name, Parent, CheckFun)                                                \
+    /* This is deliberately not 'explicit' to allow implicit conversion from object: */           \
+    /* NOLINTNEXTLINE(google-explicit-constructor) */                                             \
+    Name(const object &o)                                                                         \
+        : Parent(check_(o) ? o.inc_ref().ptr() : ConvertFun(o.ptr()), stolen_t{}) {               \
+        if (!m_ptr)                                                                               \
+            throw ::pybind11::error_already_set();                                                \
+    }                                                                                             \
+    /* NOLINTNEXTLINE(google-explicit-constructor) */                                             \
+    Name(object &&o) : Parent(check_(o) ? o.release().ptr() : ConvertFun(o.ptr()), stolen_t{}) {  \
+        if (!m_ptr)                                                                               \
+            throw ::pybind11::error_already_set();                                                \
+    }
+
+#define PYBIND11_OBJECT_CVT_DEFAULT(Name, Parent, CheckFun, ConvertFun)                           \
+    PYBIND11_OBJECT_CVT(Name, Parent, CheckFun, ConvertFun)                                       \
+    Name() = default;
+
+#define PYBIND11_OBJECT_CHECK_FAILED(Name, o_ptr)                                                 \
+    ::pybind11::type_error("Object of type '"                                                     \
+                           + ::pybind11::detail::get_fully_qualified_tp_name(Py_TYPE(o_ptr))      \
+                           + "' is not an instance of '" #Name "'")
+
+#define PYBIND11_OBJECT(Name, Parent, CheckFun)                                                   \
+    PYBIND11_OBJECT_COMMON(Name, Parent, CheckFun)                                                \
+    /* This is deliberately not 'explicit' to allow implicit conversion from object: */           \
+    /* NOLINTNEXTLINE(google-explicit-constructor) */                                             \
+    Name(const object &o) : Parent(o) {                                                           \
+        if (m_ptr && !check_(m_ptr))                                                              \
+            throw PYBIND11_OBJECT_CHECK_FAILED(Name, m_ptr);                                      \
+    }                                                                                             \
+    /* NOLINTNEXTLINE(google-explicit-constructor) */                                             \
+    Name(object &&o) : Parent(std::move(o)) {                                                     \
+        if (m_ptr && !check_(m_ptr))                                                              \
+            throw PYBIND11_OBJECT_CHECK_FAILED(Name, m_ptr);                                      \
+    }
+
+#define PYBIND11_OBJECT_DEFAULT(Name, Parent, CheckFun)                                           \
+    PYBIND11_OBJECT(Name, Parent, CheckFun)                                                       \
+    Name() = default;
+
+/// \addtogroup pytypes
+/// @{
+
+/** \rst
+    Wraps a Python iterator so that it can also be used as a C++ input iterator
+
+    Caveat: copying an iterator does not (and cannot) clone the internal
+    state of the Python iterable. This also applies to the post-increment
+    operator. This iterator should only be used to retrieve the current
+    value using ``operator*()``.
+\endrst */
+class iterator : public object {
+public:
+    using iterator_category = std::input_iterator_tag;
+    using difference_type = ssize_t;
+    using value_type = handle;
+    using reference = const handle; // PR #3263
+    using pointer = const handle *;
+
+    PYBIND11_OBJECT_DEFAULT(iterator, object, PyIter_Check)
+
+    iterator &operator++() {
+        advance();
+        return *this;
+    }
+
+    iterator operator++(int) {
+        auto rv = *this;
+        advance();
+        return rv;
+    }
+
+    // NOLINTNEXTLINE(readability-const-return-type) // PR #3263
+    reference operator*() const {
+        if (m_ptr && !value.ptr()) {
+            auto &self = const_cast<iterator &>(*this);
+            self.advance();
+        }
+        return value;
+    }
+
+    pointer operator->() const {
+        operator*();
+        return &value;
+    }
+
+    /** \rst
+         The value which marks the end of the iteration. ``it == iterator::sentinel()``
+         is equivalent to catching ``StopIteration`` in Python.
+
+         .. code-block:: cpp
+
+             void foo(py::iterator it) {
+                 while (it != py::iterator::sentinel()) {
+                    // use `*it`
+                    ++it;
+                 }
+             }
+    \endrst */
+    static iterator sentinel() { return {}; }
+
+    friend bool operator==(const iterator &a, const iterator &b) { return a->ptr() == b->ptr(); }
+    friend bool operator!=(const iterator &a, const iterator &b) { return a->ptr() != b->ptr(); }
+
+private:
+    void advance() {
+        value = reinterpret_steal<object>(PyIter_Next(m_ptr));
+        if (value.ptr() == nullptr && PyErr_Occurred()) {
+            throw error_already_set();
+        }
+    }
+
+private:
+    object value = {};
+};
+
+class type : public object {
+public:
+    PYBIND11_OBJECT(type, object, PyType_Check)
+
+    /// Return a type handle from a handle or an object
+    static handle handle_of(handle h) { return handle((PyObject *) Py_TYPE(h.ptr())); }
+
+    /// Return a type object from a handle or an object
+    static type of(handle h) { return type(type::handle_of(h), borrowed_t{}); }
+
+    // Defined in pybind11/cast.h
+    /// Convert C++ type to handle if previously registered. Does not convert
+    /// standard types, like int, float. etc. yet.
+    /// See https://github.com/pybind/pybind11/issues/2486
+    template <typename T>
+    static handle handle_of();
+
+    /// Convert C++ type to type if previously registered. Does not convert
+    /// standard types, like int, float. etc. yet.
+    /// See https://github.com/pybind/pybind11/issues/2486
+    template <typename T>
+    static type of() {
+        return type(type::handle_of<T>(), borrowed_t{});
+    }
+};
+
+class iterable : public object {
+public:
+    PYBIND11_OBJECT_DEFAULT(iterable, object, detail::PyIterable_Check)
+};
+
+class bytes;
+
+class str : public object {
+public:
+    PYBIND11_OBJECT_CVT(str, object, PYBIND11_STR_CHECK_FUN, raw_str)
+
+    template <typename SzType, detail::enable_if_t<std::is_integral<SzType>::value, int> = 0>
+    str(const char *c, const SzType &n)
+        : object(PyUnicode_FromStringAndSize(c, ssize_t_cast(n)), stolen_t{}) {
+        if (!m_ptr) {
+            if (PyErr_Occurred()) {
+                throw error_already_set();
+            }
+            pybind11_fail("Could not allocate string object!");
+        }
+    }
+
+    // 'explicit' is explicitly omitted from the following constructors to allow implicit
+    // conversion to py::str from C++ string-like objects
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    str(const char *c = "") : object(PyUnicode_FromString(c), stolen_t{}) {
+        if (!m_ptr) {
+            if (PyErr_Occurred()) {
+                throw error_already_set();
+            }
+            pybind11_fail("Could not allocate string object!");
+        }
+    }
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    str(const std::string &s) : str(s.data(), s.size()) {}
+
+#ifdef PYBIND11_HAS_STRING_VIEW
+    // enable_if is needed to avoid "ambiguous conversion" errors (see PR #3521).
+    template <typename T, detail::enable_if_t<std::is_same<T, std::string_view>::value, int> = 0>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    str(T s) : str(s.data(), s.size()) {}
+
+#    ifdef PYBIND11_HAS_U8STRING
+    // reinterpret_cast here is safe (C++20 guarantees char8_t has the same size/alignment as char)
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    str(std::u8string_view s) : str(reinterpret_cast<const char *>(s.data()), s.size()) {}
+#    endif
+
+#endif
+
+    explicit str(const bytes &b);
+
+    /** \rst
+        Return a string representation of the object. This is analogous to
+        the ``str()`` function in Python.
+    \endrst */
+    explicit str(handle h) : object(raw_str(h.ptr()), stolen_t{}) {
+        if (!m_ptr) {
+            throw error_already_set();
+        }
+    }
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator std::string() const {
+        object temp = *this;
+        if (PyUnicode_Check(m_ptr)) {
+            temp = reinterpret_steal<object>(PyUnicode_AsUTF8String(m_ptr));
+            if (!temp) {
+                throw error_already_set();
+            }
+        }
+        char *buffer = nullptr;
+        ssize_t length = 0;
+        if (PyBytes_AsStringAndSize(temp.ptr(), &buffer, &length) != 0) {
+            throw error_already_set();
+        }
+        return std::string(buffer, (size_t) length);
+    }
+
+    template <typename... Args>
+    str format(Args &&...args) const {
+        return attr("format")(std::forward<Args>(args)...);
+    }
+
+private:
+    /// Return string representation -- always returns a new reference, even if already a str
+    static PyObject *raw_str(PyObject *op) {
+        PyObject *str_value = PyObject_Str(op);
+        return str_value;
+    }
+};
+/// @} pytypes
+
+inline namespace literals {
+/** \rst
+    String literal version of `str`
+ \endrst */
+inline str
+#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ < 5
+operator"" _s // gcc 4.8.5 insists on having a space (hard error).
+#else
+operator""_s // clang 17 generates a deprecation warning if there is a space.
+#endif
+    (const char *s, size_t size) {
+    return {s, size};
+}
+} // namespace literals
+
+/// \addtogroup pytypes
+/// @{
+class bytes : public object {
+public:
+    PYBIND11_OBJECT(bytes, object, PYBIND11_BYTES_CHECK)
+
+    // Allow implicit conversion:
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    bytes(const char *c = "") : object(PYBIND11_BYTES_FROM_STRING(c), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate bytes object!");
+        }
+    }
+
+    template <typename SzType, detail::enable_if_t<std::is_integral<SzType>::value, int> = 0>
+    bytes(const char *c, const SzType &n)
+        : object(PYBIND11_BYTES_FROM_STRING_AND_SIZE(c, ssize_t_cast(n)), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate bytes object!");
+        }
+    }
+
+    // Allow implicit conversion:
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    bytes(const std::string &s) : bytes(s.data(), s.size()) {}
+
+    explicit bytes(const pybind11::str &s);
+
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator std::string() const { return string_op<std::string>(); }
+
+#ifdef PYBIND11_HAS_STRING_VIEW
+    // enable_if is needed to avoid "ambiguous conversion" errors (see PR #3521).
+    template <typename T, detail::enable_if_t<std::is_same<T, std::string_view>::value, int> = 0>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    bytes(T s) : bytes(s.data(), s.size()) {}
+
+    // Obtain a string view that views the current `bytes` buffer value.  Note that this is only
+    // valid so long as the `bytes` instance remains alive and so generally should not outlive the
+    // lifetime of the `bytes` instance.
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator std::string_view() const { return string_op<std::string_view>(); }
+#endif
+private:
+    template <typename T>
+    T string_op() const {
+        char *buffer = nullptr;
+        ssize_t length = 0;
+        if (PyBytes_AsStringAndSize(m_ptr, &buffer, &length) != 0) {
+            throw error_already_set();
+        }
+        return {buffer, static_cast<size_t>(length)};
+    }
+};
+// Note: breathe >= 4.17.0 will fail to build docs if the below two constructors
+// are included in the doxygen group; close here and reopen after as a workaround
+/// @} pytypes
+
+inline bytes::bytes(const pybind11::str &s) {
+    object temp = s;
+    if (PyUnicode_Check(s.ptr())) {
+        temp = reinterpret_steal<object>(PyUnicode_AsUTF8String(s.ptr()));
+        if (!temp) {
+            throw error_already_set();
+        }
+    }
+    char *buffer = nullptr;
+    ssize_t length = 0;
+    if (PyBytes_AsStringAndSize(temp.ptr(), &buffer, &length) != 0) {
+        throw error_already_set();
+    }
+    auto obj = reinterpret_steal<object>(PYBIND11_BYTES_FROM_STRING_AND_SIZE(buffer, length));
+    if (!obj) {
+        pybind11_fail("Could not allocate bytes object!");
+    }
+    m_ptr = obj.release().ptr();
+}
+
+inline str::str(const bytes &b) {
+    char *buffer = nullptr;
+    ssize_t length = 0;
+    if (PyBytes_AsStringAndSize(b.ptr(), &buffer, &length) != 0) {
+        throw error_already_set();
+    }
+    auto obj = reinterpret_steal<object>(PyUnicode_FromStringAndSize(buffer, length));
+    if (!obj) {
+        if (PyErr_Occurred()) {
+            throw error_already_set();
+        }
+        pybind11_fail("Could not allocate string object!");
+    }
+    m_ptr = obj.release().ptr();
+}
+
+/// \addtogroup pytypes
+/// @{
+class bytearray : public object {
+public:
+    PYBIND11_OBJECT_CVT(bytearray, object, PyByteArray_Check, PyByteArray_FromObject)
+
+    template <typename SzType, detail::enable_if_t<std::is_integral<SzType>::value, int> = 0>
+    bytearray(const char *c, const SzType &n)
+        : object(PyByteArray_FromStringAndSize(c, ssize_t_cast(n)), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate bytearray object!");
+        }
+    }
+
+    bytearray() : bytearray("", 0) {}
+
+    explicit bytearray(const std::string &s) : bytearray(s.data(), s.size()) {}
+
+    size_t size() const { return static_cast<size_t>(PyByteArray_Size(m_ptr)); }
+
+    explicit operator std::string() const {
+        char *buffer = PyByteArray_AS_STRING(m_ptr);
+        ssize_t size = PyByteArray_GET_SIZE(m_ptr);
+        return std::string(buffer, static_cast<size_t>(size));
+    }
+};
+// Note: breathe >= 4.17.0 will fail to build docs if the below two constructors
+// are included in the doxygen group; close here and reopen after as a workaround
+/// @} pytypes
+
+/// \addtogroup pytypes
+/// @{
+class none : public object {
+public:
+    PYBIND11_OBJECT(none, object, detail::PyNone_Check)
+    none() : object(Py_None, borrowed_t{}) {}
+};
+
+class ellipsis : public object {
+public:
+    PYBIND11_OBJECT(ellipsis, object, detail::PyEllipsis_Check)
+    ellipsis() : object(Py_Ellipsis, borrowed_t{}) {}
+};
+
+class bool_ : public object {
+public:
+    PYBIND11_OBJECT_CVT(bool_, object, PyBool_Check, raw_bool)
+    bool_() : object(Py_False, borrowed_t{}) {}
+    // Allow implicit conversion from and to `bool`:
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    bool_(bool value) : object(value ? Py_True : Py_False, borrowed_t{}) {}
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator bool() const { return (m_ptr != nullptr) && PyLong_AsLong(m_ptr) != 0; }
+
+private:
+    /// Return the truth value of an object -- always returns a new reference
+    static PyObject *raw_bool(PyObject *op) {
+        const auto value = PyObject_IsTrue(op);
+        if (value == -1) {
+            return nullptr;
+        }
+        return handle(value != 0 ? Py_True : Py_False).inc_ref().ptr();
+    }
+};
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+// Converts a value to the given unsigned type.  If an error occurs, you get back (Unsigned) -1;
+// otherwise you get back the unsigned long or unsigned long long value cast to (Unsigned).
+// (The distinction is critically important when casting a returned -1 error value to some other
+// unsigned type: (A)-1 != (B)-1 when A and B are unsigned types of different sizes).
+template <typename Unsigned>
+Unsigned as_unsigned(PyObject *o) {
+    if (sizeof(Unsigned) <= sizeof(unsigned long)) {
+        unsigned long v = PyLong_AsUnsignedLong(o);
+        return v == (unsigned long) -1 && PyErr_Occurred() ? (Unsigned) -1 : (Unsigned) v;
+    }
+    unsigned long long v = PyLong_AsUnsignedLongLong(o);
+    return v == (unsigned long long) -1 && PyErr_Occurred() ? (Unsigned) -1 : (Unsigned) v;
+}
+PYBIND11_NAMESPACE_END(detail)
+
+class int_ : public object {
+public:
+    PYBIND11_OBJECT_CVT(int_, object, PYBIND11_LONG_CHECK, PyNumber_Long)
+    int_() : object(PyLong_FromLong(0), stolen_t{}) {}
+    // Allow implicit conversion from C++ integral types:
+    template <typename T, detail::enable_if_t<std::is_integral<T>::value, int> = 0>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    int_(T value) {
+        if (sizeof(T) <= sizeof(long)) {
+            if (std::is_signed<T>::value) {
+                m_ptr = PyLong_FromLong((long) value);
+            } else {
+                m_ptr = PyLong_FromUnsignedLong((unsigned long) value);
+            }
+        } else {
+            if (std::is_signed<T>::value) {
+                m_ptr = PyLong_FromLongLong((long long) value);
+            } else {
+                m_ptr = PyLong_FromUnsignedLongLong((unsigned long long) value);
+            }
+        }
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate int object!");
+        }
+    }
+
+    template <typename T, detail::enable_if_t<std::is_integral<T>::value, int> = 0>
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator T() const {
+        return std::is_unsigned<T>::value  ? detail::as_unsigned<T>(m_ptr)
+               : sizeof(T) <= sizeof(long) ? (T) PyLong_AsLong(m_ptr)
+                                           : (T) PYBIND11_LONG_AS_LONGLONG(m_ptr);
+    }
+};
+
+class float_ : public object {
+public:
+    PYBIND11_OBJECT_CVT(float_, object, PyFloat_Check, PyNumber_Float)
+    // Allow implicit conversion from float/double:
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    float_(float value) : object(PyFloat_FromDouble((double) value), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate float object!");
+        }
+    }
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    float_(double value = .0) : object(PyFloat_FromDouble((double) value), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate float object!");
+        }
+    }
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator float() const { return (float) PyFloat_AsDouble(m_ptr); }
+    // NOLINTNEXTLINE(google-explicit-constructor)
+    operator double() const { return (double) PyFloat_AsDouble(m_ptr); }
+};
+
+class weakref : public object {
+public:
+    PYBIND11_OBJECT_CVT_DEFAULT(weakref, object, PyWeakref_Check, raw_weakref)
+    explicit weakref(handle obj, handle callback = {})
+        : object(PyWeakref_NewRef(obj.ptr(), callback.ptr()), stolen_t{}) {
+        if (!m_ptr) {
+            if (PyErr_Occurred()) {
+                throw error_already_set();
+            }
+            pybind11_fail("Could not allocate weak reference!");
+        }
+    }
+
+private:
+    static PyObject *raw_weakref(PyObject *o) { return PyWeakref_NewRef(o, nullptr); }
+};
+
+class slice : public object {
+public:
+    PYBIND11_OBJECT_DEFAULT(slice, object, PySlice_Check)
+    slice(handle start, handle stop, handle step)
+        : object(PySlice_New(start.ptr(), stop.ptr(), step.ptr()), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate slice object!");
+        }
+    }
+
+#ifdef PYBIND11_HAS_OPTIONAL
+    slice(std::optional<ssize_t> start, std::optional<ssize_t> stop, std::optional<ssize_t> step)
+        : slice(index_to_object(start), index_to_object(stop), index_to_object(step)) {}
+#else
+    slice(ssize_t start_, ssize_t stop_, ssize_t step_)
+        : slice(int_(start_), int_(stop_), int_(step_)) {}
+#endif
+
+    bool
+    compute(size_t length, size_t *start, size_t *stop, size_t *step, size_t *slicelength) const {
+        return PySlice_GetIndicesEx((PYBIND11_SLICE_OBJECT *) m_ptr,
+                                    (ssize_t) length,
+                                    (ssize_t *) start,
+                                    (ssize_t *) stop,
+                                    (ssize_t *) step,
+                                    (ssize_t *) slicelength)
+               == 0;
+    }
+    bool compute(
+        ssize_t length, ssize_t *start, ssize_t *stop, ssize_t *step, ssize_t *slicelength) const {
+        return PySlice_GetIndicesEx(
+                   (PYBIND11_SLICE_OBJECT *) m_ptr, length, start, stop, step, slicelength)
+               == 0;
+    }
+
+private:
+    template <typename T>
+    static object index_to_object(T index) {
+        return index ? object(int_(*index)) : object(none());
+    }
+};
+
+class capsule : public object {
+public:
+    PYBIND11_OBJECT_DEFAULT(capsule, object, PyCapsule_CheckExact)
+    PYBIND11_DEPRECATED("Use reinterpret_borrow<capsule>() or reinterpret_steal<capsule>()")
+    capsule(PyObject *ptr, bool is_borrowed)
+        : object(is_borrowed ? object(ptr, borrowed_t{}) : object(ptr, stolen_t{})) {}
+
+    explicit capsule(const void *value,
+                     const char *name = nullptr,
+                     PyCapsule_Destructor destructor = nullptr)
+        : object(PyCapsule_New(const_cast<void *>(value), name, destructor), stolen_t{}) {
+        if (!m_ptr) {
+            throw error_already_set();
+        }
+    }
+
+    PYBIND11_DEPRECATED("Please use the ctor with value, name, destructor args")
+    capsule(const void *value, PyCapsule_Destructor destructor)
+        : object(PyCapsule_New(const_cast<void *>(value), nullptr, destructor), stolen_t{}) {
+        if (!m_ptr) {
+            throw error_already_set();
+        }
+    }
+
+    /// Capsule name is nullptr.
+    capsule(const void *value, void (*destructor)(void *)) {
+        initialize_with_void_ptr_destructor(value, nullptr, destructor);
+    }
+
+    capsule(const void *value, const char *name, void (*destructor)(void *)) {
+        initialize_with_void_ptr_destructor(value, name, destructor);
+    }
+
+    explicit capsule(void (*destructor)()) {
+        m_ptr = PyCapsule_New(reinterpret_cast<void *>(destructor), nullptr, [](PyObject *o) {
+            const char *name = get_name_in_error_scope(o);
+            auto destructor = reinterpret_cast<void (*)()>(PyCapsule_GetPointer(o, name));
+            if (destructor == nullptr) {
+                throw error_already_set();
+            }
+            destructor();
+        });
+
+        if (!m_ptr) {
+            throw error_already_set();
+        }
+    }
+
+    template <typename T>
+    operator T *() const { // NOLINT(google-explicit-constructor)
+        return get_pointer<T>();
+    }
+
+    /// Get the pointer the capsule holds.
+    template <typename T = void>
+    T *get_pointer() const {
+        const auto *name = this->name();
+        T *result = static_cast<T *>(PyCapsule_GetPointer(m_ptr, name));
+        if (!result) {
+            throw error_already_set();
+        }
+        return result;
+    }
+
+    /// Replaces a capsule's pointer *without* calling the destructor on the existing one.
+    void set_pointer(const void *value) {
+        if (PyCapsule_SetPointer(m_ptr, const_cast<void *>(value)) != 0) {
+            throw error_already_set();
+        }
+    }
+
+    const char *name() const {
+        const char *name = PyCapsule_GetName(m_ptr);
+        if ((name == nullptr) && PyErr_Occurred()) {
+            throw error_already_set();
+        }
+        return name;
+    }
+
+    /// Replaces a capsule's name *without* calling the destructor on the existing one.
+    void set_name(const char *new_name) {
+        if (PyCapsule_SetName(m_ptr, new_name) != 0) {
+            throw error_already_set();
+        }
+    }
+
+private:
+    static const char *get_name_in_error_scope(PyObject *o) {
+        error_scope error_guard;
+
+        const char *name = PyCapsule_GetName(o);
+        if ((name == nullptr) && PyErr_Occurred()) {
+            // write out and consume error raised by call to PyCapsule_GetName
+            PyErr_WriteUnraisable(o);
+        }
+
+        return name;
+    }
+
+    void initialize_with_void_ptr_destructor(const void *value,
+                                             const char *name,
+                                             void (*destructor)(void *)) {
+        m_ptr = PyCapsule_New(const_cast<void *>(value), name, [](PyObject *o) {
+            // guard if destructor called while err indicator is set
+            error_scope error_guard;
+            auto destructor = reinterpret_cast<void (*)(void *)>(PyCapsule_GetContext(o));
+            if (destructor == nullptr && PyErr_Occurred()) {
+                throw error_already_set();
+            }
+            const char *name = get_name_in_error_scope(o);
+            void *ptr = PyCapsule_GetPointer(o, name);
+            if (ptr == nullptr) {
+                throw error_already_set();
+            }
+
+            if (destructor != nullptr) {
+                destructor(ptr);
+            }
+        });
+
+        if (!m_ptr || PyCapsule_SetContext(m_ptr, reinterpret_cast<void *>(destructor)) != 0) {
+            throw error_already_set();
+        }
+    }
+};
+
+class tuple : public object {
+public:
+    PYBIND11_OBJECT_CVT(tuple, object, PyTuple_Check, PySequence_Tuple)
+    template <typename SzType = ssize_t,
+              detail::enable_if_t<std::is_integral<SzType>::value, int> = 0>
+    // Some compilers generate link errors when using `const SzType &` here:
+    explicit tuple(SzType size = 0) : object(PyTuple_New(ssize_t_cast(size)), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate tuple object!");
+        }
+    }
+    size_t size() const { return (size_t) PyTuple_Size(m_ptr); }
+    bool empty() const { return size() == 0; }
+    detail::tuple_accessor operator[](size_t index) const { return {*this, index}; }
+    template <typename T, detail::enable_if_t<detail::is_pyobject<T>::value, int> = 0>
+    detail::item_accessor operator[](T &&o) const {
+        return object::operator[](std::forward<T>(o));
+    }
+    detail::tuple_iterator begin() const { return {*this, 0}; }
+    detail::tuple_iterator end() const { return {*this, PyTuple_GET_SIZE(m_ptr)}; }
+};
+
+// We need to put this into a separate function because the Intel compiler
+// fails to compile enable_if_t<all_of<is_keyword_or_ds<Args>...>::value> part below
+// (tested with ICC 2021.1 Beta 20200827).
+template <typename... Args>
+constexpr bool args_are_all_keyword_or_ds() {
+    return detail::all_of<detail::is_keyword_or_ds<Args>...>::value;
+}
+
+class dict : public object {
+public:
+    PYBIND11_OBJECT_CVT(dict, object, PyDict_Check, raw_dict)
+    dict() : object(PyDict_New(), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate dict object!");
+        }
+    }
+    template <typename... Args,
+              typename = detail::enable_if_t<args_are_all_keyword_or_ds<Args...>()>,
+              // MSVC workaround: it can't compile an out-of-line definition, so defer the
+              // collector
+              typename collector = detail::deferred_t<detail::unpacking_collector<>, Args...>>
+    explicit dict(Args &&...args) : dict(collector(std::forward<Args>(args)...).kwargs()) {}
+
+    size_t size() const { return (size_t) PyDict_Size(m_ptr); }
+    bool empty() const { return size() == 0; }
+    detail::dict_iterator begin() const { return {*this, 0}; }
+    detail::dict_iterator end() const { return {}; }
+    void clear() /* py-non-const */ { PyDict_Clear(ptr()); }
+    template <typename T>
+    bool contains(T &&key) const {
+        auto result = PyDict_Contains(m_ptr, detail::object_or_cast(std::forward<T>(key)).ptr());
+        if (result == -1) {
+            throw error_already_set();
+        }
+        return result == 1;
+    }
+
+private:
+    /// Call the `dict` Python type -- always returns a new reference
+    static PyObject *raw_dict(PyObject *op) {
+        if (PyDict_Check(op)) {
+            return handle(op).inc_ref().ptr();
+        }
+        return PyObject_CallFunctionObjArgs((PyObject *) &PyDict_Type, op, nullptr);
+    }
+};
+
+class sequence : public object {
+public:
+    PYBIND11_OBJECT_DEFAULT(sequence, object, PySequence_Check)
+    size_t size() const {
+        ssize_t result = PySequence_Size(m_ptr);
+        if (result == -1) {
+            throw error_already_set();
+        }
+        return (size_t) result;
+    }
+    bool empty() const { return size() == 0; }
+    detail::sequence_accessor operator[](size_t index) const { return {*this, index}; }
+    template <typename T, detail::enable_if_t<detail::is_pyobject<T>::value, int> = 0>
+    detail::item_accessor operator[](T &&o) const {
+        return object::operator[](std::forward<T>(o));
+    }
+    detail::sequence_iterator begin() const { return {*this, 0}; }
+    detail::sequence_iterator end() const { return {*this, PySequence_Size(m_ptr)}; }
+};
+
+class list : public object {
+public:
+    PYBIND11_OBJECT_CVT(list, object, PyList_Check, PySequence_List)
+    template <typename SzType = ssize_t,
+              detail::enable_if_t<std::is_integral<SzType>::value, int> = 0>
+    // Some compilers generate link errors when using `const SzType &` here:
+    explicit list(SzType size = 0) : object(PyList_New(ssize_t_cast(size)), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate list object!");
+        }
+    }
+    size_t size() const { return (size_t) PyList_Size(m_ptr); }
+    bool empty() const { return size() == 0; }
+    detail::list_accessor operator[](size_t index) const { return {*this, index}; }
+    template <typename T, detail::enable_if_t<detail::is_pyobject<T>::value, int> = 0>
+    detail::item_accessor operator[](T &&o) const {
+        return object::operator[](std::forward<T>(o));
+    }
+    detail::list_iterator begin() const { return {*this, 0}; }
+    detail::list_iterator end() const { return {*this, PyList_GET_SIZE(m_ptr)}; }
+    template <typename T>
+    void append(T &&val) /* py-non-const */ {
+        if (PyList_Append(m_ptr, detail::object_or_cast(std::forward<T>(val)).ptr()) != 0) {
+            throw error_already_set();
+        }
+    }
+    template <typename IdxType,
+              typename ValType,
+              detail::enable_if_t<std::is_integral<IdxType>::value, int> = 0>
+    void insert(const IdxType &index, ValType &&val) /* py-non-const */ {
+        if (PyList_Insert(m_ptr,
+                          ssize_t_cast(index),
+                          detail::object_or_cast(std::forward<ValType>(val)).ptr())
+            != 0) {
+            throw error_already_set();
+        }
+    }
+    void clear() /* py-non-const */ {
+        if (PyList_SetSlice(m_ptr, 0, PyList_Size(m_ptr), nullptr) == -1) {
+            throw error_already_set();
+        }
+    }
+};
+
+class args : public tuple {
+    PYBIND11_OBJECT_DEFAULT(args, tuple, PyTuple_Check)
+};
+class kwargs : public dict {
+    PYBIND11_OBJECT_DEFAULT(kwargs, dict, PyDict_Check)
+};
+
+class anyset : public object {
+public:
+    PYBIND11_OBJECT(anyset, object, PyAnySet_Check)
+    size_t size() const { return static_cast<size_t>(PySet_Size(m_ptr)); }
+    bool empty() const { return size() == 0; }
+    template <typename T>
+    bool contains(T &&val) const {
+        auto result = PySet_Contains(m_ptr, detail::object_or_cast(std::forward<T>(val)).ptr());
+        if (result == -1) {
+            throw error_already_set();
+        }
+        return result == 1;
+    }
+};
+
+class set : public anyset {
+public:
+    PYBIND11_OBJECT_CVT(set, anyset, PySet_Check, PySet_New)
+    set() : anyset(PySet_New(nullptr), stolen_t{}) {
+        if (!m_ptr) {
+            pybind11_fail("Could not allocate set object!");
+        }
+    }
+    template <typename T>
+    bool add(T &&val) /* py-non-const */ {
+        return PySet_Add(m_ptr, detail::object_or_cast(std::forward<T>(val)).ptr()) == 0;
+    }
+    void clear() /* py-non-const */ { PySet_Clear(m_ptr); }
+};
+
+class frozenset : public anyset {
+public:
+    PYBIND11_OBJECT_CVT(frozenset, anyset, PyFrozenSet_Check, PyFrozenSet_New)
+};
+
+class function : public object {
+public:
+    PYBIND11_OBJECT_DEFAULT(function, object, PyCallable_Check)
+    handle cpp_function() const {
+        handle fun = detail::get_function(m_ptr);
+        if (fun && PyCFunction_Check(fun.ptr())) {
+            return fun;
+        }
+        return handle();
+    }
+    bool is_cpp_function() const { return (bool) cpp_function(); }
+};
+
+class staticmethod : public object {
+public:
+    PYBIND11_OBJECT_CVT(staticmethod, object, detail::PyStaticMethod_Check, PyStaticMethod_New)
+};
+
+class buffer : public object {
+public:
+    PYBIND11_OBJECT_DEFAULT(buffer, object, PyObject_CheckBuffer)
+
+    buffer_info request(bool writable = false) const {
+        int flags = PyBUF_STRIDES | PyBUF_FORMAT;
+        if (writable) {
+            flags |= PyBUF_WRITABLE;
+        }
+        auto *view = new Py_buffer();
+        if (PyObject_GetBuffer(m_ptr, view, flags) != 0) {
+            delete view;
+            throw error_already_set();
+        }
+        return buffer_info(view);
+    }
+};
+
+class memoryview : public object {
+public:
+    PYBIND11_OBJECT_CVT(memoryview, object, PyMemoryView_Check, PyMemoryView_FromObject)
+
+    /** \rst
+        Creates ``memoryview`` from ``buffer_info``.
+
+        ``buffer_info`` must be created from ``buffer::request()``. Otherwise
+        throws an exception.
+
+        For creating a ``memoryview`` from objects that support buffer protocol,
+        use ``memoryview(const object& obj)`` instead of this constructor.
+     \endrst */
+    explicit memoryview(const buffer_info &info) {
+        if (!info.view()) {
+            pybind11_fail("Prohibited to create memoryview without Py_buffer");
+        }
+        // Note: PyMemoryView_FromBuffer never increments obj reference.
+        m_ptr = (info.view()->obj) ? PyMemoryView_FromObject(info.view()->obj)
+                                   : PyMemoryView_FromBuffer(info.view());
+        if (!m_ptr) {
+            pybind11_fail("Unable to create memoryview from buffer descriptor");
+        }
+    }
+
+    /** \rst
+        Creates ``memoryview`` from static buffer.
+
+        This method is meant for providing a ``memoryview`` for C/C++ buffer not
+        managed by Python. The caller is responsible for managing the lifetime
+        of ``ptr`` and ``format``, which MUST outlive the memoryview constructed
+        here.
+
+        See also: Python C API documentation for `PyMemoryView_FromBuffer`_.
+
+        .. _PyMemoryView_FromBuffer:
+           https://docs.python.org/c-api/memoryview.html#c.PyMemoryView_FromBuffer
+
+        :param ptr: Pointer to the buffer.
+        :param itemsize: Byte size of an element.
+        :param format: Pointer to the null-terminated format string. For
+            homogeneous Buffers, this should be set to
+            ``format_descriptor<T>::value``.
+        :param shape: Shape of the tensor (1 entry per dimension).
+        :param strides: Number of bytes between adjacent entries (for each
+            per dimension).
+        :param readonly: Flag to indicate if the underlying storage may be
+            written to.
+     \endrst */
+    static memoryview from_buffer(void *ptr,
+                                  ssize_t itemsize,
+                                  const char *format,
+                                  detail::any_container<ssize_t> shape,
+                                  detail::any_container<ssize_t> strides,
+                                  bool readonly = false);
+
+    static memoryview from_buffer(const void *ptr,
+                                  ssize_t itemsize,
+                                  const char *format,
+                                  detail::any_container<ssize_t> shape,
+                                  detail::any_container<ssize_t> strides) {
+        return memoryview::from_buffer(
+            const_cast<void *>(ptr), itemsize, format, std::move(shape), std::move(strides), true);
+    }
+
+    template <typename T>
+    static memoryview from_buffer(T *ptr,
+                                  detail::any_container<ssize_t> shape,
+                                  detail::any_container<ssize_t> strides,
+                                  bool readonly = false) {
+        return memoryview::from_buffer(reinterpret_cast<void *>(ptr),
+                                       sizeof(T),
+                                       format_descriptor<T>::value,
+                                       std::move(shape),
+                                       std::move(strides),
+                                       readonly);
+    }
+
+    template <typename T>
+    static memoryview from_buffer(const T *ptr,
+                                  detail::any_container<ssize_t> shape,
+                                  detail::any_container<ssize_t> strides) {
+        return memoryview::from_buffer(
+            const_cast<T *>(ptr), std::move(shape), std::move(strides), true);
+    }
+
+    /** \rst
+        Creates ``memoryview`` from static memory.
+
+        This method is meant for providing a ``memoryview`` for C/C++ buffer not
+        managed by Python. The caller is responsible for managing the lifetime
+        of ``mem``, which MUST outlive the memoryview constructed here.
+
+        See also: Python C API documentation for `PyMemoryView_FromBuffer`_.
+
+        .. _PyMemoryView_FromMemory:
+           https://docs.python.org/c-api/memoryview.html#c.PyMemoryView_FromMemory
+     \endrst */
+    static memoryview from_memory(void *mem, ssize_t size, bool readonly = false) {
+        PyObject *ptr = PyMemoryView_FromMemory(
+            reinterpret_cast<char *>(mem), size, (readonly) ? PyBUF_READ : PyBUF_WRITE);
+        if (!ptr) {
+            pybind11_fail("Could not allocate memoryview object!");
+        }
+        return memoryview(object(ptr, stolen_t{}));
+    }
+
+    static memoryview from_memory(const void *mem, ssize_t size) {
+        return memoryview::from_memory(const_cast<void *>(mem), size, true);
+    }
+
+#ifdef PYBIND11_HAS_STRING_VIEW
+    static memoryview from_memory(std::string_view mem) {
+        return from_memory(const_cast<char *>(mem.data()), static_cast<ssize_t>(mem.size()), true);
+    }
+#endif
+};
+
+/// @cond DUPLICATE
+inline memoryview memoryview::from_buffer(void *ptr,
+                                          ssize_t itemsize,
+                                          const char *format,
+                                          detail::any_container<ssize_t> shape,
+                                          detail::any_container<ssize_t> strides,
+                                          bool readonly) {
+    size_t ndim = shape->size();
+    if (ndim != strides->size()) {
+        pybind11_fail("memoryview: shape length doesn't match strides length");
+    }
+    ssize_t size = ndim != 0u ? 1 : 0;
+    for (size_t i = 0; i < ndim; ++i) {
+        size *= (*shape)[i];
+    }
+    Py_buffer view;
+    view.buf = ptr;
+    view.obj = nullptr;
+    view.len = size * itemsize;
+    view.readonly = static_cast<int>(readonly);
+    view.itemsize = itemsize;
+    view.format = const_cast<char *>(format);
+    view.ndim = static_cast<int>(ndim);
+    view.shape = shape->data();
+    view.strides = strides->data();
+    view.suboffsets = nullptr;
+    view.internal = nullptr;
+    PyObject *obj = PyMemoryView_FromBuffer(&view);
+    if (!obj) {
+        throw error_already_set();
+    }
+    return memoryview(object(obj, stolen_t{}));
+}
+/// @endcond
+/// @} pytypes
+
+/// \addtogroup python_builtins
+/// @{
+
+/// Get the length of a Python object.
+inline size_t len(handle h) {
+    ssize_t result = PyObject_Length(h.ptr());
+    if (result < 0) {
+        throw error_already_set();
+    }
+    return (size_t) result;
+}
+
+/// Get the length hint of a Python object.
+/// Returns 0 when this cannot be determined.
+inline size_t len_hint(handle h) {
+    ssize_t result = PyObject_LengthHint(h.ptr(), 0);
+    if (result < 0) {
+        // Sometimes a length can't be determined at all (eg generators)
+        // In which case simply return 0
+        PyErr_Clear();
+        return 0;
+    }
+    return (size_t) result;
+}
+
+inline str repr(handle h) {
+    PyObject *str_value = PyObject_Repr(h.ptr());
+    if (!str_value) {
+        throw error_already_set();
+    }
+    return reinterpret_steal<str>(str_value);
+}
+
+inline iterator iter(handle obj) {
+    PyObject *result = PyObject_GetIter(obj.ptr());
+    if (!result) {
+        throw error_already_set();
+    }
+    return reinterpret_steal<iterator>(result);
+}
+/// @} python_builtins
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+template <typename D>
+iterator object_api<D>::begin() const {
+    return iter(derived());
+}
+template <typename D>
+iterator object_api<D>::end() const {
+    return iterator::sentinel();
+}
+template <typename D>
+item_accessor object_api<D>::operator[](handle key) const {
+    return {derived(), reinterpret_borrow<object>(key)};
+}
+template <typename D>
+item_accessor object_api<D>::operator[](object &&key) const {
+    return {derived(), std::move(key)};
+}
+template <typename D>
+item_accessor object_api<D>::operator[](const char *key) const {
+    return {derived(), pybind11::str(key)};
+}
+template <typename D>
+obj_attr_accessor object_api<D>::attr(handle key) const {
+    return {derived(), reinterpret_borrow<object>(key)};
+}
+template <typename D>
+obj_attr_accessor object_api<D>::attr(object &&key) const {
+    return {derived(), std::move(key)};
+}
+template <typename D>
+str_attr_accessor object_api<D>::attr(const char *key) const {
+    return {derived(), key};
+}
+template <typename D>
+args_proxy object_api<D>::operator*() const {
+    return args_proxy(derived().ptr());
+}
+template <typename D>
+template <typename T>
+bool object_api<D>::contains(T &&item) const {
+    return attr("__contains__")(std::forward<T>(item)).template cast<bool>();
+}
+
+template <typename D>
+pybind11::str object_api<D>::str() const {
+    return pybind11::str(derived());
+}
+
+template <typename D>
+str_attr_accessor object_api<D>::doc() const {
+    return attr("__doc__");
+}
+
+template <typename D>
+handle object_api<D>::get_type() const {
+    return type::handle_of(derived());
+}
+
+template <typename D>
+bool object_api<D>::rich_compare(object_api const &other, int value) const {
+    int rv = PyObject_RichCompareBool(derived().ptr(), other.derived().ptr(), value);
+    if (rv == -1) {
+        throw error_already_set();
+    }
+    return rv == 1;
+}
+
+#define PYBIND11_MATH_OPERATOR_UNARY(op, fn)                                                      \
+    template <typename D>                                                                         \
+    object object_api<D>::op() const {                                                            \
+        object result = reinterpret_steal<object>(fn(derived().ptr()));                           \
+        if (!result.ptr())                                                                        \
+            throw error_already_set();                                                            \
+        return result;                                                                            \
+    }
+
+#define PYBIND11_MATH_OPERATOR_BINARY(op, fn)                                                     \
+    template <typename D>                                                                         \
+    object object_api<D>::op(object_api const &other) const {                                     \
+        object result = reinterpret_steal<object>(fn(derived().ptr(), other.derived().ptr()));    \
+        if (!result.ptr())                                                                        \
+            throw error_already_set();                                                            \
+        return result;                                                                            \
+    }
+
+#define PYBIND11_MATH_OPERATOR_BINARY_INPLACE(iop, fn)                                            \
+    template <typename D>                                                                         \
+    object object_api<D>::iop(object_api const &other) {                                          \
+        object result = reinterpret_steal<object>(fn(derived().ptr(), other.derived().ptr()));    \
+        if (!result.ptr())                                                                        \
+            throw error_already_set();                                                            \
+        return result;                                                                            \
+    }
+
+PYBIND11_MATH_OPERATOR_UNARY(operator~, PyNumber_Invert)
+PYBIND11_MATH_OPERATOR_UNARY(operator-, PyNumber_Negative)
+PYBIND11_MATH_OPERATOR_BINARY(operator+, PyNumber_Add)
+PYBIND11_MATH_OPERATOR_BINARY_INPLACE(operator+=, PyNumber_InPlaceAdd)
+PYBIND11_MATH_OPERATOR_BINARY(operator-, PyNumber_Subtract)
+PYBIND11_MATH_OPERATOR_BINARY_INPLACE(operator-=, PyNumber_InPlaceSubtract)
+PYBIND11_MATH_OPERATOR_BINARY(operator*, PyNumber_Multiply)
+PYBIND11_MATH_OPERATOR_BINARY_INPLACE(operator*=, PyNumber_InPlaceMultiply)
+PYBIND11_MATH_OPERATOR_BINARY(operator/, PyNumber_TrueDivide)
+PYBIND11_MATH_OPERATOR_BINARY_INPLACE(operator/=, PyNumber_InPlaceTrueDivide)
+PYBIND11_MATH_OPERATOR_BINARY(operator|, PyNumber_Or)
+PYBIND11_MATH_OPERATOR_BINARY_INPLACE(operator|=, PyNumber_InPlaceOr)
+PYBIND11_MATH_OPERATOR_BINARY(operator&, PyNumber_And)
+PYBIND11_MATH_OPERATOR_BINARY_INPLACE(operator&=, PyNumber_InPlaceAnd)
+PYBIND11_MATH_OPERATOR_BINARY(operator^, PyNumber_Xor)
+PYBIND11_MATH_OPERATOR_BINARY_INPLACE(operator^=, PyNumber_InPlaceXor)
+PYBIND11_MATH_OPERATOR_BINARY(operator<<, PyNumber_Lshift)
+PYBIND11_MATH_OPERATOR_BINARY_INPLACE(operator<<=, PyNumber_InPlaceLshift)
+PYBIND11_MATH_OPERATOR_BINARY(operator>>, PyNumber_Rshift)
+PYBIND11_MATH_OPERATOR_BINARY_INPLACE(operator>>=, PyNumber_InPlaceRshift)
+
+#undef PYBIND11_MATH_OPERATOR_UNARY
+#undef PYBIND11_MATH_OPERATOR_BINARY
+#undef PYBIND11_MATH_OPERATOR_BINARY_INPLACE
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/stl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/stl.h
new file mode 100644
index 0000000000..71bc5902ef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/stl.h
@@ -0,0 +1,448 @@
+/*
+    pybind11/stl.h: Transparent conversion for STL data types
+
+    Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "pybind11.h"
+#include "detail/common.h"
+
+#include <deque>
+#include <list>
+#include <map>
+#include <ostream>
+#include <set>
+#include <unordered_map>
+#include <unordered_set>
+#include <valarray>
+
+// See `detail/common.h` for implementation of these guards.
+#if defined(PYBIND11_HAS_OPTIONAL)
+#    include <optional>
+#elif defined(PYBIND11_HAS_EXP_OPTIONAL)
+#    include <experimental/optional>
+#endif
+
+#if defined(PYBIND11_HAS_VARIANT)
+#    include <variant>
+#endif
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+/// Extracts an const lvalue reference or rvalue reference for U based on the type of T (e.g. for
+/// forwarding a container element).  Typically used indirect via forwarded_type(), below.
+template <typename T, typename U>
+using forwarded_type = conditional_t<std::is_lvalue_reference<T>::value,
+                                     remove_reference_t<U> &,
+                                     remove_reference_t<U> &&>;
+
+/// Forwards a value U as rvalue or lvalue according to whether T is rvalue or lvalue; typically
+/// used for forwarding a container's elements.
+template <typename T, typename U>
+constexpr forwarded_type<T, U> forward_like(U &&u) {
+    return std::forward<detail::forwarded_type<T, U>>(std::forward<U>(u));
+}
+
+// Checks if a container has a STL style reserve method.
+// This will only return true for a `reserve()` with a `void` return.
+template <typename C>
+using has_reserve_method = std::is_same<decltype(std::declval<C>().reserve(0)), void>;
+
+template <typename Type, typename Key>
+struct set_caster {
+    using type = Type;
+    using key_conv = make_caster<Key>;
+
+private:
+    template <typename T = Type, enable_if_t<has_reserve_method<T>::value, int> = 0>
+    void reserve_maybe(const anyset &s, Type *) {
+        value.reserve(s.size());
+    }
+    void reserve_maybe(const anyset &, void *) {}
+
+public:
+    bool load(handle src, bool convert) {
+        if (!isinstance<anyset>(src)) {
+            return false;
+        }
+        auto s = reinterpret_borrow<anyset>(src);
+        value.clear();
+        reserve_maybe(s, &value);
+        for (auto entry : s) {
+            key_conv conv;
+            if (!conv.load(entry, convert)) {
+                return false;
+            }
+            value.insert(cast_op<Key &&>(std::move(conv)));
+        }
+        return true;
+    }
+
+    template <typename T>
+    static handle cast(T &&src, return_value_policy policy, handle parent) {
+        if (!std::is_lvalue_reference<T>::value) {
+            policy = return_value_policy_override<Key>::policy(policy);
+        }
+        pybind11::set s;
+        for (auto &&value : src) {
+            auto value_ = reinterpret_steal<object>(
+                key_conv::cast(detail::forward_like<T>(value), policy, parent));
+            if (!value_ || !s.add(std::move(value_))) {
+                return handle();
+            }
+        }
+        return s.release();
+    }
+
+    PYBIND11_TYPE_CASTER(type, const_name("set[") + key_conv::name + const_name("]"));
+};
+
+template <typename Type, typename Key, typename Value>
+struct map_caster {
+    using key_conv = make_caster<Key>;
+    using value_conv = make_caster<Value>;
+
+private:
+    template <typename T = Type, enable_if_t<has_reserve_method<T>::value, int> = 0>
+    void reserve_maybe(const dict &d, Type *) {
+        value.reserve(d.size());
+    }
+    void reserve_maybe(const dict &, void *) {}
+
+public:
+    bool load(handle src, bool convert) {
+        if (!isinstance<dict>(src)) {
+            return false;
+        }
+        auto d = reinterpret_borrow<dict>(src);
+        value.clear();
+        reserve_maybe(d, &value);
+        for (auto it : d) {
+            key_conv kconv;
+            value_conv vconv;
+            if (!kconv.load(it.first.ptr(), convert) || !vconv.load(it.second.ptr(), convert)) {
+                return false;
+            }
+            value.emplace(cast_op<Key &&>(std::move(kconv)), cast_op<Value &&>(std::move(vconv)));
+        }
+        return true;
+    }
+
+    template <typename T>
+    static handle cast(T &&src, return_value_policy policy, handle parent) {
+        dict d;
+        return_value_policy policy_key = policy;
+        return_value_policy policy_value = policy;
+        if (!std::is_lvalue_reference<T>::value) {
+            policy_key = return_value_policy_override<Key>::policy(policy_key);
+            policy_value = return_value_policy_override<Value>::policy(policy_value);
+        }
+        for (auto &&kv : src) {
+            auto key = reinterpret_steal<object>(
+                key_conv::cast(detail::forward_like<T>(kv.first), policy_key, parent));
+            auto value = reinterpret_steal<object>(
+                value_conv::cast(detail::forward_like<T>(kv.second), policy_value, parent));
+            if (!key || !value) {
+                return handle();
+            }
+            d[std::move(key)] = std::move(value);
+        }
+        return d.release();
+    }
+
+    PYBIND11_TYPE_CASTER(Type,
+                         const_name("dict[") + key_conv::name + const_name(", ") + value_conv::name
+                             + const_name("]"));
+};
+
+template <typename Type, typename Value>
+struct list_caster {
+    using value_conv = make_caster<Value>;
+
+    bool load(handle src, bool convert) {
+        if (!isinstance<sequence>(src) || isinstance<bytes>(src) || isinstance<str>(src)) {
+            return false;
+        }
+        auto s = reinterpret_borrow<sequence>(src);
+        value.clear();
+        reserve_maybe(s, &value);
+        for (const auto &it : s) {
+            value_conv conv;
+            if (!conv.load(it, convert)) {
+                return false;
+            }
+            value.push_back(cast_op<Value &&>(std::move(conv)));
+        }
+        return true;
+    }
+
+private:
+    template <typename T = Type, enable_if_t<has_reserve_method<T>::value, int> = 0>
+    void reserve_maybe(const sequence &s, Type *) {
+        value.reserve(s.size());
+    }
+    void reserve_maybe(const sequence &, void *) {}
+
+public:
+    template <typename T>
+    static handle cast(T &&src, return_value_policy policy, handle parent) {
+        if (!std::is_lvalue_reference<T>::value) {
+            policy = return_value_policy_override<Value>::policy(policy);
+        }
+        list l(src.size());
+        ssize_t index = 0;
+        for (auto &&value : src) {
+            auto value_ = reinterpret_steal<object>(
+                value_conv::cast(detail::forward_like<T>(value), policy, parent));
+            if (!value_) {
+                return handle();
+            }
+            PyList_SET_ITEM(l.ptr(), index++, value_.release().ptr()); // steals a reference
+        }
+        return l.release();
+    }
+
+    PYBIND11_TYPE_CASTER(Type, const_name("list[") + value_conv::name + const_name("]"));
+};
+
+template <typename Type, typename Alloc>
+struct type_caster<std::vector<Type, Alloc>> : list_caster<std::vector<Type, Alloc>, Type> {};
+
+template <typename Type, typename Alloc>
+struct type_caster<std::deque<Type, Alloc>> : list_caster<std::deque<Type, Alloc>, Type> {};
+
+template <typename Type, typename Alloc>
+struct type_caster<std::list<Type, Alloc>> : list_caster<std::list<Type, Alloc>, Type> {};
+
+template <typename ArrayType, typename Value, bool Resizable, size_t Size = 0>
+struct array_caster {
+    using value_conv = make_caster<Value>;
+
+private:
+    template <bool R = Resizable>
+    bool require_size(enable_if_t<R, size_t> size) {
+        if (value.size() != size) {
+            value.resize(size);
+        }
+        return true;
+    }
+    template <bool R = Resizable>
+    bool require_size(enable_if_t<!R, size_t> size) {
+        return size == Size;
+    }
+
+public:
+    bool load(handle src, bool convert) {
+        if (!isinstance<sequence>(src)) {
+            return false;
+        }
+        auto l = reinterpret_borrow<sequence>(src);
+        if (!require_size(l.size())) {
+            return false;
+        }
+        size_t ctr = 0;
+        for (const auto &it : l) {
+            value_conv conv;
+            if (!conv.load(it, convert)) {
+                return false;
+            }
+            value[ctr++] = cast_op<Value &&>(std::move(conv));
+        }
+        return true;
+    }
+
+    template <typename T>
+    static handle cast(T &&src, return_value_policy policy, handle parent) {
+        list l(src.size());
+        ssize_t index = 0;
+        for (auto &&value : src) {
+            auto value_ = reinterpret_steal<object>(
+                value_conv::cast(detail::forward_like<T>(value), policy, parent));
+            if (!value_) {
+                return handle();
+            }
+            PyList_SET_ITEM(l.ptr(), index++, value_.release().ptr()); // steals a reference
+        }
+        return l.release();
+    }
+
+    PYBIND11_TYPE_CASTER(ArrayType,
+                         const_name<Resizable>(const_name(""), const_name("Annotated["))
+                             + const_name("list[") + value_conv::name + const_name("]")
+                             + const_name<Resizable>(const_name(""),
+                                                     const_name(", FixedSize(")
+                                                         + const_name<Size>() + const_name(")]")));
+};
+
+template <typename Type, size_t Size>
+struct type_caster<std::array<Type, Size>>
+    : array_caster<std::array<Type, Size>, Type, false, Size> {};
+
+template <typename Type>
+struct type_caster<std::valarray<Type>> : array_caster<std::valarray<Type>, Type, true> {};
+
+template <typename Key, typename Compare, typename Alloc>
+struct type_caster<std::set<Key, Compare, Alloc>>
+    : set_caster<std::set<Key, Compare, Alloc>, Key> {};
+
+template <typename Key, typename Hash, typename Equal, typename Alloc>
+struct type_caster<std::unordered_set<Key, Hash, Equal, Alloc>>
+    : set_caster<std::unordered_set<Key, Hash, Equal, Alloc>, Key> {};
+
+template <typename Key, typename Value, typename Compare, typename Alloc>
+struct type_caster<std::map<Key, Value, Compare, Alloc>>
+    : map_caster<std::map<Key, Value, Compare, Alloc>, Key, Value> {};
+
+template <typename Key, typename Value, typename Hash, typename Equal, typename Alloc>
+struct type_caster<std::unordered_map<Key, Value, Hash, Equal, Alloc>>
+    : map_caster<std::unordered_map<Key, Value, Hash, Equal, Alloc>, Key, Value> {};
+
+// This type caster is intended to be used for std::optional and std::experimental::optional
+template <typename Type, typename Value = typename Type::value_type>
+struct optional_caster {
+    using value_conv = make_caster<Value>;
+
+    template <typename T>
+    static handle cast(T &&src, return_value_policy policy, handle parent) {
+        if (!src) {
+            return none().release();
+        }
+        if (!std::is_lvalue_reference<T>::value) {
+            policy = return_value_policy_override<Value>::policy(policy);
+        }
+        // NOLINTNEXTLINE(bugprone-unchecked-optional-access)
+        return value_conv::cast(*std::forward<T>(src), policy, parent);
+    }
+
+    bool load(handle src, bool convert) {
+        if (!src) {
+            return false;
+        }
+        if (src.is_none()) {
+            return true; // default-constructed value is already empty
+        }
+        value_conv inner_caster;
+        if (!inner_caster.load(src, convert)) {
+            return false;
+        }
+
+        value.emplace(cast_op<Value &&>(std::move(inner_caster)));
+        return true;
+    }
+
+    PYBIND11_TYPE_CASTER(Type, const_name("Optional[") + value_conv::name + const_name("]"));
+};
+
+#if defined(PYBIND11_HAS_OPTIONAL)
+template <typename T>
+struct type_caster<std::optional<T>> : public optional_caster<std::optional<T>> {};
+
+template <>
+struct type_caster<std::nullopt_t> : public void_caster<std::nullopt_t> {};
+#endif
+
+#if defined(PYBIND11_HAS_EXP_OPTIONAL)
+template <typename T>
+struct type_caster<std::experimental::optional<T>>
+    : public optional_caster<std::experimental::optional<T>> {};
+
+template <>
+struct type_caster<std::experimental::nullopt_t>
+    : public void_caster<std::experimental::nullopt_t> {};
+#endif
+
+/// Visit a variant and cast any found type to Python
+struct variant_caster_visitor {
+    return_value_policy policy;
+    handle parent;
+
+    using result_type = handle; // required by boost::variant in C++11
+
+    template <typename T>
+    result_type operator()(T &&src) const {
+        return make_caster<T>::cast(std::forward<T>(src), policy, parent);
+    }
+};
+
+/// Helper class which abstracts away variant's `visit` function. `std::variant` and similar
+/// `namespace::variant` types which provide a `namespace::visit()` function are handled here
+/// automatically using argument-dependent lookup. Users can provide specializations for other
+/// variant-like classes, e.g. `boost::variant` and `boost::apply_visitor`.
+template <template <typename...> class Variant>
+struct visit_helper {
+    template <typename... Args>
+    static auto call(Args &&...args) -> decltype(visit(std::forward<Args>(args)...)) {
+        return visit(std::forward<Args>(args)...);
+    }
+};
+
+/// Generic variant caster
+template <typename Variant>
+struct variant_caster;
+
+template <template <typename...> class V, typename... Ts>
+struct variant_caster<V<Ts...>> {
+    static_assert(sizeof...(Ts) > 0, "Variant must consist of at least one alternative.");
+
+    template <typename U, typename... Us>
+    bool load_alternative(handle src, bool convert, type_list<U, Us...>) {
+        auto caster = make_caster<U>();
+        if (caster.load(src, convert)) {
+            value = cast_op<U>(std::move(caster));
+            return true;
+        }
+        return load_alternative(src, convert, type_list<Us...>{});
+    }
+
+    bool load_alternative(handle, bool, type_list<>) { return false; }
+
+    bool load(handle src, bool convert) {
+        // Do a first pass without conversions to improve constructor resolution.
+        // E.g. `py::int_(1).cast<variant<double, int>>()` needs to fill the `int`
+        // slot of the variant. Without two-pass loading `double` would be filled
+        // because it appears first and a conversion is possible.
+        if (convert && load_alternative(src, false, type_list<Ts...>{})) {
+            return true;
+        }
+        return load_alternative(src, convert, type_list<Ts...>{});
+    }
+
+    template <typename Variant>
+    static handle cast(Variant &&src, return_value_policy policy, handle parent) {
+        return visit_helper<V>::call(variant_caster_visitor{policy, parent},
+                                     std::forward<Variant>(src));
+    }
+
+    using Type = V<Ts...>;
+    PYBIND11_TYPE_CASTER(Type,
+                         const_name("Union[")
+                             + ::pybind11::detail::concat(make_caster<Ts>::name...)
+                             + const_name("]"));
+};
+
+#if defined(PYBIND11_HAS_VARIANT)
+template <typename... Ts>
+struct type_caster<std::variant<Ts...>> : variant_caster<std::variant<Ts...>> {};
+
+template <>
+struct type_caster<std::monostate> : public void_caster<std::monostate> {};
+#endif
+
+PYBIND11_NAMESPACE_END(detail)
+
+inline std::ostream &operator<<(std::ostream &os, const handle &obj) {
+#ifdef PYBIND11_HAS_STRING_VIEW
+    os << str(obj).cast<std::string_view>();
+#else
+    os << (std::string) str(obj);
+#endif
+    return os;
+}
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/stl/filesystem.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/stl/filesystem.h
new file mode 100644
index 0000000000..85c131efe4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/stl/filesystem.h
@@ -0,0 +1,115 @@
+// Copyright (c) 2021 The Pybind Development Team.
+// All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+
+#pragma once
+
+#include "../pybind11.h"
+#include "../detail/common.h"
+#include "../detail/descr.h"
+#include "../cast.h"
+#include "../pytypes.h"
+
+#include <string>
+
+#ifdef __has_include
+#    if defined(PYBIND11_CPP17)
+#        if __has_include(<filesystem>)
+#            include <filesystem>
+#            define PYBIND11_HAS_FILESYSTEM 1
+#        elif __has_include(<experimental/filesystem>)
+#            include <experimental/filesystem>
+#            define PYBIND11_HAS_EXPERIMENTAL_FILESYSTEM 1
+#        endif
+#    endif
+#endif
+
+#if !defined(PYBIND11_HAS_FILESYSTEM) && !defined(PYBIND11_HAS_EXPERIMENTAL_FILESYSTEM)           \
+    && !defined(PYBIND11_HAS_FILESYSTEM_IS_OPTIONAL)
+#    error                                                                                        \
+        "Neither #include <filesystem> nor #include <experimental/filesystem is available. (Use -DPYBIND11_HAS_FILESYSTEM_IS_OPTIONAL to ignore.)"
+#endif
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+#if defined(PYBIND11_HAS_FILESYSTEM) || defined(PYBIND11_HAS_EXPERIMENTAL_FILESYSTEM)
+template <typename T>
+struct path_caster {
+
+private:
+    static PyObject *unicode_from_fs_native(const std::string &w) {
+#    if !defined(PYPY_VERSION)
+        return PyUnicode_DecodeFSDefaultAndSize(w.c_str(), ssize_t(w.size()));
+#    else
+        // PyPy mistakenly declares the first parameter as non-const.
+        return PyUnicode_DecodeFSDefaultAndSize(const_cast<char *>(w.c_str()), ssize_t(w.size()));
+#    endif
+    }
+
+    static PyObject *unicode_from_fs_native(const std::wstring &w) {
+        return PyUnicode_FromWideChar(w.c_str(), ssize_t(w.size()));
+    }
+
+public:
+    static handle cast(const T &path, return_value_policy, handle) {
+        if (auto py_str = unicode_from_fs_native(path.native())) {
+            return module_::import("pathlib")
+                .attr("Path")(reinterpret_steal<object>(py_str))
+                .release();
+        }
+        return nullptr;
+    }
+
+    bool load(handle handle, bool) {
+        // PyUnicode_FSConverter and PyUnicode_FSDecoder normally take care of
+        // calling PyOS_FSPath themselves, but that's broken on PyPy (PyPy
+        // issue #3168) so we do it ourselves instead.
+        PyObject *buf = PyOS_FSPath(handle.ptr());
+        if (!buf) {
+            PyErr_Clear();
+            return false;
+        }
+        PyObject *native = nullptr;
+        if constexpr (std::is_same_v<typename T::value_type, char>) {
+            if (PyUnicode_FSConverter(buf, &native) != 0) {
+                if (auto *c_str = PyBytes_AsString(native)) {
+                    // AsString returns a pointer to the internal buffer, which
+                    // must not be free'd.
+                    value = c_str;
+                }
+            }
+        } else if constexpr (std::is_same_v<typename T::value_type, wchar_t>) {
+            if (PyUnicode_FSDecoder(buf, &native) != 0) {
+                if (auto *c_str = PyUnicode_AsWideCharString(native, nullptr)) {
+                    // AsWideCharString returns a new string that must be free'd.
+                    value = c_str; // Copies the string.
+                    PyMem_Free(c_str);
+                }
+            }
+        }
+        Py_XDECREF(native);
+        Py_DECREF(buf);
+        if (PyErr_Occurred()) {
+            PyErr_Clear();
+            return false;
+        }
+        return true;
+    }
+
+    PYBIND11_TYPE_CASTER(T, const_name("os.PathLike"));
+};
+
+#endif // PYBIND11_HAS_FILESYSTEM || defined(PYBIND11_HAS_EXPERIMENTAL_FILESYSTEM)
+
+#if defined(PYBIND11_HAS_FILESYSTEM)
+template <>
+struct type_caster<std::filesystem::path> : public path_caster<std::filesystem::path> {};
+#elif defined(PYBIND11_HAS_EXPERIMENTAL_FILESYSTEM)
+template <>
+struct type_caster<std::experimental::filesystem::path>
+    : public path_caster<std::experimental::filesystem::path> {};
+#endif
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/stl_bind.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/stl_bind.h
new file mode 100644
index 0000000000..66c452ea79
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/stl_bind.h
@@ -0,0 +1,822 @@
+/*
+    pybind11/std_bind.h: Binding generators for STL data types
+
+    Copyright (c) 2016 Sergey Lyskov and Wenzel Jakob
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include "detail/common.h"
+#include "detail/type_caster_base.h"
+#include "cast.h"
+#include "operators.h"
+
+#include <algorithm>
+#include <sstream>
+#include <type_traits>
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+/* SFINAE helper class used by 'is_comparable */
+template <typename T>
+struct container_traits {
+    template <typename T2>
+    static std::true_type
+    test_comparable(decltype(std::declval<const T2 &>() == std::declval<const T2 &>()) *);
+    template <typename T2>
+    static std::false_type test_comparable(...);
+    template <typename T2>
+    static std::true_type test_value(typename T2::value_type *);
+    template <typename T2>
+    static std::false_type test_value(...);
+    template <typename T2>
+    static std::true_type test_pair(typename T2::first_type *, typename T2::second_type *);
+    template <typename T2>
+    static std::false_type test_pair(...);
+
+    static constexpr const bool is_comparable
+        = std::is_same<std::true_type, decltype(test_comparable<T>(nullptr))>::value;
+    static constexpr const bool is_pair
+        = std::is_same<std::true_type, decltype(test_pair<T>(nullptr, nullptr))>::value;
+    static constexpr const bool is_vector
+        = std::is_same<std::true_type, decltype(test_value<T>(nullptr))>::value;
+    static constexpr const bool is_element = !is_pair && !is_vector;
+};
+
+/* Default: is_comparable -> std::false_type */
+template <typename T, typename SFINAE = void>
+struct is_comparable : std::false_type {};
+
+/* For non-map data structures, check whether operator== can be instantiated */
+template <typename T>
+struct is_comparable<
+    T,
+    enable_if_t<container_traits<T>::is_element && container_traits<T>::is_comparable>>
+    : std::true_type {};
+
+/* For a vector/map data structure, recursively check the value type
+   (which is std::pair for maps) */
+template <typename T>
+struct is_comparable<T, enable_if_t<container_traits<T>::is_vector>>
+    : is_comparable<typename recursive_container_traits<T>::type_to_check_recursively> {};
+
+template <>
+struct is_comparable<recursive_bottom> : std::true_type {};
+
+/* For pairs, recursively check the two data types */
+template <typename T>
+struct is_comparable<T, enable_if_t<container_traits<T>::is_pair>> {
+    static constexpr const bool value = is_comparable<typename T::first_type>::value
+                                        && is_comparable<typename T::second_type>::value;
+};
+
+/* Fallback functions */
+template <typename, typename, typename... Args>
+void vector_if_copy_constructible(const Args &...) {}
+template <typename, typename, typename... Args>
+void vector_if_equal_operator(const Args &...) {}
+template <typename, typename, typename... Args>
+void vector_if_insertion_operator(const Args &...) {}
+template <typename, typename, typename... Args>
+void vector_modifiers(const Args &...) {}
+
+template <typename Vector, typename Class_>
+void vector_if_copy_constructible(enable_if_t<is_copy_constructible<Vector>::value, Class_> &cl) {
+    cl.def(init<const Vector &>(), "Copy constructor");
+}
+
+template <typename Vector, typename Class_>
+void vector_if_equal_operator(enable_if_t<is_comparable<Vector>::value, Class_> &cl) {
+    using T = typename Vector::value_type;
+
+    cl.def(self == self);
+    cl.def(self != self);
+
+    cl.def(
+        "count",
+        [](const Vector &v, const T &x) { return std::count(v.begin(), v.end(), x); },
+        arg("x"),
+        "Return the number of times ``x`` appears in the list");
+
+    cl.def(
+        "remove",
+        [](Vector &v, const T &x) {
+            auto p = std::find(v.begin(), v.end(), x);
+            if (p != v.end()) {
+                v.erase(p);
+            } else {
+                throw value_error();
+            }
+        },
+        arg("x"),
+        "Remove the first item from the list whose value is x. "
+        "It is an error if there is no such item.");
+
+    cl.def(
+        "__contains__",
+        [](const Vector &v, const T &x) { return std::find(v.begin(), v.end(), x) != v.end(); },
+        arg("x"),
+        "Return true the container contains ``x``");
+}
+
+// Vector modifiers -- requires a copyable vector_type:
+// (Technically, some of these (pop and __delitem__) don't actually require copyability, but it
+// seems silly to allow deletion but not insertion, so include them here too.)
+template <typename Vector, typename Class_>
+void vector_modifiers(
+    enable_if_t<is_copy_constructible<typename Vector::value_type>::value, Class_> &cl) {
+    using T = typename Vector::value_type;
+    using SizeType = typename Vector::size_type;
+    using DiffType = typename Vector::difference_type;
+
+    auto wrap_i = [](DiffType i, SizeType n) {
+        if (i < 0) {
+            i += n;
+        }
+        if (i < 0 || (SizeType) i >= n) {
+            throw index_error();
+        }
+        return i;
+    };
+
+    cl.def(
+        "append",
+        [](Vector &v, const T &value) { v.push_back(value); },
+        arg("x"),
+        "Add an item to the end of the list");
+
+    cl.def(init([](const iterable &it) {
+        auto v = std::unique_ptr<Vector>(new Vector());
+        v->reserve(len_hint(it));
+        for (handle h : it) {
+            v->push_back(h.cast<T>());
+        }
+        return v.release();
+    }));
+
+    cl.def("clear", [](Vector &v) { v.clear(); }, "Clear the contents");
+
+    cl.def(
+        "extend",
+        [](Vector &v, const Vector &src) { v.insert(v.end(), src.begin(), src.end()); },
+        arg("L"),
+        "Extend the list by appending all the items in the given list");
+
+    cl.def(
+        "extend",
+        [](Vector &v, const iterable &it) {
+            const size_t old_size = v.size();
+            v.reserve(old_size + len_hint(it));
+            try {
+                for (handle h : it) {
+                    v.push_back(h.cast<T>());
+                }
+            } catch (const cast_error &) {
+                v.erase(v.begin() + static_cast<typename Vector::difference_type>(old_size),
+                        v.end());
+                try {
+                    v.shrink_to_fit();
+                } catch (const std::exception &) {
+                    // Do nothing
+                }
+                throw;
+            }
+        },
+        arg("L"),
+        "Extend the list by appending all the items in the given list");
+
+    cl.def(
+        "insert",
+        [](Vector &v, DiffType i, const T &x) {
+            // Can't use wrap_i; i == v.size() is OK
+            if (i < 0) {
+                i += v.size();
+            }
+            if (i < 0 || (SizeType) i > v.size()) {
+                throw index_error();
+            }
+            v.insert(v.begin() + i, x);
+        },
+        arg("i"),
+        arg("x"),
+        "Insert an item at a given position.");
+
+    cl.def(
+        "pop",
+        [](Vector &v) {
+            if (v.empty()) {
+                throw index_error();
+            }
+            T t = std::move(v.back());
+            v.pop_back();
+            return t;
+        },
+        "Remove and return the last item");
+
+    cl.def(
+        "pop",
+        [wrap_i](Vector &v, DiffType i) {
+            i = wrap_i(i, v.size());
+            T t = std::move(v[(SizeType) i]);
+            v.erase(std::next(v.begin(), i));
+            return t;
+        },
+        arg("i"),
+        "Remove and return the item at index ``i``");
+
+    cl.def("__setitem__", [wrap_i](Vector &v, DiffType i, const T &t) {
+        i = wrap_i(i, v.size());
+        v[(SizeType) i] = t;
+    });
+
+    /// Slicing protocol
+    cl.def(
+        "__getitem__",
+        [](const Vector &v, const slice &slice) -> Vector * {
+            size_t start = 0, stop = 0, step = 0, slicelength = 0;
+
+            if (!slice.compute(v.size(), &start, &stop, &step, &slicelength)) {
+                throw error_already_set();
+            }
+
+            auto *seq = new Vector();
+            seq->reserve((size_t) slicelength);
+
+            for (size_t i = 0; i < slicelength; ++i) {
+                seq->push_back(v[start]);
+                start += step;
+            }
+            return seq;
+        },
+        arg("s"),
+        "Retrieve list elements using a slice object");
+
+    cl.def(
+        "__setitem__",
+        [](Vector &v, const slice &slice, const Vector &value) {
+            size_t start = 0, stop = 0, step = 0, slicelength = 0;
+            if (!slice.compute(v.size(), &start, &stop, &step, &slicelength)) {
+                throw error_already_set();
+            }
+
+            if (slicelength != value.size()) {
+                throw std::runtime_error(
+                    "Left and right hand size of slice assignment have different sizes!");
+            }
+
+            for (size_t i = 0; i < slicelength; ++i) {
+                v[start] = value[i];
+                start += step;
+            }
+        },
+        "Assign list elements using a slice object");
+
+    cl.def(
+        "__delitem__",
+        [wrap_i](Vector &v, DiffType i) {
+            i = wrap_i(i, v.size());
+            v.erase(v.begin() + i);
+        },
+        "Delete the list elements at index ``i``");
+
+    cl.def(
+        "__delitem__",
+        [](Vector &v, const slice &slice) {
+            size_t start = 0, stop = 0, step = 0, slicelength = 0;
+
+            if (!slice.compute(v.size(), &start, &stop, &step, &slicelength)) {
+                throw error_already_set();
+            }
+
+            if (step == 1 && false) {
+                v.erase(v.begin() + (DiffType) start, v.begin() + DiffType(start + slicelength));
+            } else {
+                for (size_t i = 0; i < slicelength; ++i) {
+                    v.erase(v.begin() + DiffType(start));
+                    start += step - 1;
+                }
+            }
+        },
+        "Delete list elements using a slice object");
+}
+
+// If the type has an operator[] that doesn't return a reference (most notably std::vector<bool>),
+// we have to access by copying; otherwise we return by reference.
+template <typename Vector>
+using vector_needs_copy
+    = negation<std::is_same<decltype(std::declval<Vector>()[typename Vector::size_type()]),
+                            typename Vector::value_type &>>;
+
+// The usual case: access and iterate by reference
+template <typename Vector, typename Class_>
+void vector_accessor(enable_if_t<!vector_needs_copy<Vector>::value, Class_> &cl) {
+    using T = typename Vector::value_type;
+    using SizeType = typename Vector::size_type;
+    using DiffType = typename Vector::difference_type;
+    using ItType = typename Vector::iterator;
+
+    auto wrap_i = [](DiffType i, SizeType n) {
+        if (i < 0) {
+            i += n;
+        }
+        if (i < 0 || (SizeType) i >= n) {
+            throw index_error();
+        }
+        return i;
+    };
+
+    cl.def(
+        "__getitem__",
+        [wrap_i](Vector &v, DiffType i) -> T & {
+            i = wrap_i(i, v.size());
+            return v[(SizeType) i];
+        },
+        return_value_policy::reference_internal // ref + keepalive
+    );
+
+    cl.def(
+        "__iter__",
+        [](Vector &v) {
+            return make_iterator<return_value_policy::reference_internal, ItType, ItType, T &>(
+                v.begin(), v.end());
+        },
+        keep_alive<0, 1>() /* Essential: keep list alive while iterator exists */
+    );
+}
+
+// The case for special objects, like std::vector<bool>, that have to be returned-by-copy:
+template <typename Vector, typename Class_>
+void vector_accessor(enable_if_t<vector_needs_copy<Vector>::value, Class_> &cl) {
+    using T = typename Vector::value_type;
+    using SizeType = typename Vector::size_type;
+    using DiffType = typename Vector::difference_type;
+    using ItType = typename Vector::iterator;
+    cl.def("__getitem__", [](const Vector &v, DiffType i) -> T {
+        if (i < 0) {
+            i += v.size();
+            if (i < 0) {
+                throw index_error();
+            }
+        }
+        auto i_st = static_cast<SizeType>(i);
+        if (i_st >= v.size()) {
+            throw index_error();
+        }
+        return v[i_st];
+    });
+
+    cl.def(
+        "__iter__",
+        [](Vector &v) {
+            return make_iterator<return_value_policy::copy, ItType, ItType, T>(v.begin(), v.end());
+        },
+        keep_alive<0, 1>() /* Essential: keep list alive while iterator exists */
+    );
+}
+
+template <typename Vector, typename Class_>
+auto vector_if_insertion_operator(Class_ &cl, std::string const &name)
+    -> decltype(std::declval<std::ostream &>() << std::declval<typename Vector::value_type>(),
+                void()) {
+    using size_type = typename Vector::size_type;
+
+    cl.def(
+        "__repr__",
+        [name](Vector &v) {
+            std::ostringstream s;
+            s << name << '[';
+            for (size_type i = 0; i < v.size(); ++i) {
+                s << v[i];
+                if (i != v.size() - 1) {
+                    s << ", ";
+                }
+            }
+            s << ']';
+            return s.str();
+        },
+        "Return the canonical string representation of this list.");
+}
+
+// Provide the buffer interface for vectors if we have data() and we have a format for it
+// GCC seems to have "void std::vector<bool>::data()" - doing SFINAE on the existence of data()
+// is insufficient, we need to check it returns an appropriate pointer
+template <typename Vector, typename = void>
+struct vector_has_data_and_format : std::false_type {};
+template <typename Vector>
+struct vector_has_data_and_format<
+    Vector,
+    enable_if_t<std::is_same<decltype(format_descriptor<typename Vector::value_type>::format(),
+                                      std::declval<Vector>().data()),
+                             typename Vector::value_type *>::value>> : std::true_type {};
+
+// [workaround(intel)] Separate function required here
+// Workaround as the Intel compiler does not compile the enable_if_t part below
+// (tested with icc (ICC) 2021.1 Beta 20200827)
+template <typename... Args>
+constexpr bool args_any_are_buffer() {
+    return detail::any_of<std::is_same<Args, buffer_protocol>...>::value;
+}
+
+// [workaround(intel)] Separate function required here
+// [workaround(msvc)] Can't use constexpr bool in return type
+
+// Add the buffer interface to a vector
+template <typename Vector, typename Class_, typename... Args>
+void vector_buffer_impl(Class_ &cl, std::true_type) {
+    using T = typename Vector::value_type;
+
+    static_assert(vector_has_data_and_format<Vector>::value,
+                  "There is not an appropriate format descriptor for this vector");
+
+    // numpy.h declares this for arbitrary types, but it may raise an exception and crash hard
+    // at runtime if PYBIND11_NUMPY_DTYPE hasn't been called, so check here
+    format_descriptor<T>::format();
+
+    cl.def_buffer([](Vector &v) -> buffer_info {
+        return buffer_info(v.data(),
+                           static_cast<ssize_t>(sizeof(T)),
+                           format_descriptor<T>::format(),
+                           1,
+                           {v.size()},
+                           {sizeof(T)});
+    });
+
+    cl.def(init([](const buffer &buf) {
+        auto info = buf.request();
+        if (info.ndim != 1 || info.strides[0] % static_cast<ssize_t>(sizeof(T))) {
+            throw type_error("Only valid 1D buffers can be copied to a vector");
+        }
+        if (!detail::compare_buffer_info<T>::compare(info)
+            || (ssize_t) sizeof(T) != info.itemsize) {
+            throw type_error("Format mismatch (Python: " + info.format
+                             + " C++: " + format_descriptor<T>::format() + ")");
+        }
+
+        T *p = static_cast<T *>(info.ptr);
+        ssize_t step = info.strides[0] / static_cast<ssize_t>(sizeof(T));
+        T *end = p + info.shape[0] * step;
+        if (step == 1) {
+            return Vector(p, end);
+        }
+        Vector vec;
+        vec.reserve((size_t) info.shape[0]);
+        for (; p != end; p += step) {
+            vec.push_back(*p);
+        }
+        return vec;
+    }));
+
+    return;
+}
+
+template <typename Vector, typename Class_, typename... Args>
+void vector_buffer_impl(Class_ &, std::false_type) {}
+
+template <typename Vector, typename Class_, typename... Args>
+void vector_buffer(Class_ &cl) {
+    vector_buffer_impl<Vector, Class_, Args...>(
+        cl, detail::any_of<std::is_same<Args, buffer_protocol>...>{});
+}
+
+PYBIND11_NAMESPACE_END(detail)
+
+//
+// std::vector
+//
+template <typename Vector, typename holder_type = std::unique_ptr<Vector>, typename... Args>
+class_<Vector, holder_type> bind_vector(handle scope, std::string const &name, Args &&...args) {
+    using Class_ = class_<Vector, holder_type>;
+
+    // If the value_type is unregistered (e.g. a converting type) or is itself registered
+    // module-local then make the vector binding module-local as well:
+    using vtype = typename Vector::value_type;
+    auto *vtype_info = detail::get_type_info(typeid(vtype));
+    bool local = !vtype_info || vtype_info->module_local;
+
+    Class_ cl(scope, name.c_str(), pybind11::module_local(local), std::forward<Args>(args)...);
+
+    // Declare the buffer interface if a buffer_protocol() is passed in
+    detail::vector_buffer<Vector, Class_, Args...>(cl);
+
+    cl.def(init<>());
+
+    // Register copy constructor (if possible)
+    detail::vector_if_copy_constructible<Vector, Class_>(cl);
+
+    // Register comparison-related operators and functions (if possible)
+    detail::vector_if_equal_operator<Vector, Class_>(cl);
+
+    // Register stream insertion operator (if possible)
+    detail::vector_if_insertion_operator<Vector, Class_>(cl, name);
+
+    // Modifiers require copyable vector value type
+    detail::vector_modifiers<Vector, Class_>(cl);
+
+    // Accessor and iterator; return by value if copyable, otherwise we return by ref + keep-alive
+    detail::vector_accessor<Vector, Class_>(cl);
+
+    cl.def(
+        "__bool__",
+        [](const Vector &v) -> bool { return !v.empty(); },
+        "Check whether the list is nonempty");
+
+    cl.def("__len__", [](const Vector &vec) { return vec.size(); });
+
+#if 0
+    // C++ style functions deprecated, leaving it here as an example
+    cl.def(init<size_type>());
+
+    cl.def("resize",
+         (void (Vector::*) (size_type count)) & Vector::resize,
+         "changes the number of elements stored");
+
+    cl.def("erase",
+        [](Vector &v, SizeType i) {
+        if (i >= v.size())
+            throw index_error();
+        v.erase(v.begin() + i);
+    }, "erases element at index ``i``");
+
+    cl.def("empty",         &Vector::empty,         "checks whether the container is empty");
+    cl.def("size",          &Vector::size,          "returns the number of elements");
+    cl.def("push_back", (void (Vector::*)(const T&)) &Vector::push_back, "adds an element to the end");
+    cl.def("pop_back",                               &Vector::pop_back, "removes the last element");
+
+    cl.def("max_size",      &Vector::max_size,      "returns the maximum possible number of elements");
+    cl.def("reserve",       &Vector::reserve,       "reserves storage");
+    cl.def("capacity",      &Vector::capacity,      "returns the number of elements that can be held in currently allocated storage");
+    cl.def("shrink_to_fit", &Vector::shrink_to_fit, "reduces memory usage by freeing unused memory");
+
+    cl.def("clear", &Vector::clear, "clears the contents");
+    cl.def("swap",   &Vector::swap, "swaps the contents");
+
+    cl.def("front", [](Vector &v) {
+        if (v.size()) return v.front();
+        else throw index_error();
+    }, "access the first element");
+
+    cl.def("back", [](Vector &v) {
+        if (v.size()) return v.back();
+        else throw index_error();
+    }, "access the last element ");
+
+#endif
+
+    return cl;
+}
+
+//
+// std::map, std::unordered_map
+//
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+/* Fallback functions */
+template <typename, typename, typename... Args>
+void map_if_insertion_operator(const Args &...) {}
+template <typename, typename, typename... Args>
+void map_assignment(const Args &...) {}
+
+// Map assignment when copy-assignable: just copy the value
+template <typename Map, typename Class_>
+void map_assignment(
+    enable_if_t<is_copy_assignable<typename Map::mapped_type>::value, Class_> &cl) {
+    using KeyType = typename Map::key_type;
+    using MappedType = typename Map::mapped_type;
+
+    cl.def("__setitem__", [](Map &m, const KeyType &k, const MappedType &v) {
+        auto it = m.find(k);
+        if (it != m.end()) {
+            it->second = v;
+        } else {
+            m.emplace(k, v);
+        }
+    });
+}
+
+// Not copy-assignable, but still copy-constructible: we can update the value by erasing and
+// reinserting
+template <typename Map, typename Class_>
+void map_assignment(enable_if_t<!is_copy_assignable<typename Map::mapped_type>::value
+                                    && is_copy_constructible<typename Map::mapped_type>::value,
+                                Class_> &cl) {
+    using KeyType = typename Map::key_type;
+    using MappedType = typename Map::mapped_type;
+
+    cl.def("__setitem__", [](Map &m, const KeyType &k, const MappedType &v) {
+        // We can't use m[k] = v; because value type might not be default constructable
+        auto r = m.emplace(k, v);
+        if (!r.second) {
+            // value type is not copy assignable so the only way to insert it is to erase it
+            // first...
+            m.erase(r.first);
+            m.emplace(k, v);
+        }
+    });
+}
+
+template <typename Map, typename Class_>
+auto map_if_insertion_operator(Class_ &cl, std::string const &name)
+    -> decltype(std::declval<std::ostream &>() << std::declval<typename Map::key_type>()
+                                               << std::declval<typename Map::mapped_type>(),
+                void()) {
+
+    cl.def(
+        "__repr__",
+        [name](Map &m) {
+            std::ostringstream s;
+            s << name << '{';
+            bool f = false;
+            for (auto const &kv : m) {
+                if (f) {
+                    s << ", ";
+                }
+                s << kv.first << ": " << kv.second;
+                f = true;
+            }
+            s << '}';
+            return s.str();
+        },
+        "Return the canonical string representation of this map.");
+}
+
+struct keys_view {
+    virtual size_t len() = 0;
+    virtual iterator iter() = 0;
+    virtual bool contains(const handle &k) = 0;
+    virtual ~keys_view() = default;
+};
+
+struct values_view {
+    virtual size_t len() = 0;
+    virtual iterator iter() = 0;
+    virtual ~values_view() = default;
+};
+
+struct items_view {
+    virtual size_t len() = 0;
+    virtual iterator iter() = 0;
+    virtual ~items_view() = default;
+};
+
+template <typename Map>
+struct KeysViewImpl : public detail::keys_view {
+    explicit KeysViewImpl(Map &map) : map(map) {}
+    size_t len() override { return map.size(); }
+    iterator iter() override { return make_key_iterator(map.begin(), map.end()); }
+    bool contains(const handle &k) override {
+        try {
+            return map.find(k.template cast<typename Map::key_type>()) != map.end();
+        } catch (const cast_error &) {
+            return false;
+        }
+    }
+    Map &map;
+};
+
+template <typename Map>
+struct ValuesViewImpl : public detail::values_view {
+    explicit ValuesViewImpl(Map &map) : map(map) {}
+    size_t len() override { return map.size(); }
+    iterator iter() override { return make_value_iterator(map.begin(), map.end()); }
+    Map &map;
+};
+
+template <typename Map>
+struct ItemsViewImpl : public detail::items_view {
+    explicit ItemsViewImpl(Map &map) : map(map) {}
+    size_t len() override { return map.size(); }
+    iterator iter() override { return make_iterator(map.begin(), map.end()); }
+    Map &map;
+};
+
+PYBIND11_NAMESPACE_END(detail)
+
+template <typename Map, typename holder_type = std::unique_ptr<Map>, typename... Args>
+class_<Map, holder_type> bind_map(handle scope, const std::string &name, Args &&...args) {
+    using KeyType = typename Map::key_type;
+    using MappedType = typename Map::mapped_type;
+    using KeysView = detail::keys_view;
+    using ValuesView = detail::values_view;
+    using ItemsView = detail::items_view;
+    using Class_ = class_<Map, holder_type>;
+
+    // If either type is a non-module-local bound type then make the map binding non-local as well;
+    // otherwise (e.g. both types are either module-local or converting) the map will be
+    // module-local.
+    auto *tinfo = detail::get_type_info(typeid(MappedType));
+    bool local = !tinfo || tinfo->module_local;
+    if (local) {
+        tinfo = detail::get_type_info(typeid(KeyType));
+        local = !tinfo || tinfo->module_local;
+    }
+
+    Class_ cl(scope, name.c_str(), pybind11::module_local(local), std::forward<Args>(args)...);
+
+    // Wrap KeysView if it wasn't already wrapped
+    if (!detail::get_type_info(typeid(KeysView))) {
+        class_<KeysView> keys_view(scope, "KeysView", pybind11::module_local(local));
+        keys_view.def("__len__", &KeysView::len);
+        keys_view.def("__iter__",
+                      &KeysView::iter,
+                      keep_alive<0, 1>() /* Essential: keep view alive while iterator exists */
+        );
+        keys_view.def("__contains__", &KeysView::contains);
+    }
+    // Similarly for ValuesView:
+    if (!detail::get_type_info(typeid(ValuesView))) {
+        class_<ValuesView> values_view(scope, "ValuesView", pybind11::module_local(local));
+        values_view.def("__len__", &ValuesView::len);
+        values_view.def("__iter__",
+                        &ValuesView::iter,
+                        keep_alive<0, 1>() /* Essential: keep view alive while iterator exists */
+        );
+    }
+    // Similarly for ItemsView:
+    if (!detail::get_type_info(typeid(ItemsView))) {
+        class_<ItemsView> items_view(scope, "ItemsView", pybind11::module_local(local));
+        items_view.def("__len__", &ItemsView::len);
+        items_view.def("__iter__",
+                       &ItemsView::iter,
+                       keep_alive<0, 1>() /* Essential: keep view alive while iterator exists */
+        );
+    }
+
+    cl.def(init<>());
+
+    // Register stream insertion operator (if possible)
+    detail::map_if_insertion_operator<Map, Class_>(cl, name);
+
+    cl.def(
+        "__bool__",
+        [](const Map &m) -> bool { return !m.empty(); },
+        "Check whether the map is nonempty");
+
+    cl.def(
+        "__iter__",
+        [](Map &m) { return make_key_iterator(m.begin(), m.end()); },
+        keep_alive<0, 1>() /* Essential: keep map alive while iterator exists */
+    );
+
+    cl.def(
+        "keys",
+        [](Map &m) { return std::unique_ptr<KeysView>(new detail::KeysViewImpl<Map>(m)); },
+        keep_alive<0, 1>() /* Essential: keep map alive while view exists */
+    );
+
+    cl.def(
+        "values",
+        [](Map &m) { return std::unique_ptr<ValuesView>(new detail::ValuesViewImpl<Map>(m)); },
+        keep_alive<0, 1>() /* Essential: keep map alive while view exists */
+    );
+
+    cl.def(
+        "items",
+        [](Map &m) { return std::unique_ptr<ItemsView>(new detail::ItemsViewImpl<Map>(m)); },
+        keep_alive<0, 1>() /* Essential: keep map alive while view exists */
+    );
+
+    cl.def(
+        "__getitem__",
+        [](Map &m, const KeyType &k) -> MappedType & {
+            auto it = m.find(k);
+            if (it == m.end()) {
+                throw key_error();
+            }
+            return it->second;
+        },
+        return_value_policy::reference_internal // ref + keepalive
+    );
+
+    cl.def("__contains__", [](Map &m, const KeyType &k) -> bool {
+        auto it = m.find(k);
+        if (it == m.end()) {
+            return false;
+        }
+        return true;
+    });
+    // Fallback for when the object is not of the key type
+    cl.def("__contains__", [](Map &, const object &) -> bool { return false; });
+
+    // Assignment provided only if the type is copyable
+    detail::map_assignment<Map, Class_>(cl);
+
+    cl.def("__delitem__", [](Map &m, const KeyType &k) {
+        auto it = m.find(k);
+        if (it == m.end()) {
+            throw key_error();
+        }
+        m.erase(it);
+    });
+
+    // Always use a lambda in case of `using` declaration
+    cl.def("__len__", [](const Map &m) { return m.size(); });
+
+    return cl;
+}
+
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/type_caster_pyobject_ptr.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/type_caster_pyobject_ptr.h
new file mode 100644
index 0000000000..aa914f9e15
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/type_caster_pyobject_ptr.h
@@ -0,0 +1,61 @@
+// Copyright (c) 2023 The pybind Community.
+
+#pragma once
+
+#include "detail/common.h"
+#include "detail/descr.h"
+#include "cast.h"
+#include "pytypes.h"
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <>
+class type_caster<PyObject> {
+public:
+    static constexpr auto name = const_name("object"); // See discussion under PR #4601.
+
+    // This overload is purely to guard against accidents.
+    template <typename T,
+              detail::enable_if_t<!is_same_ignoring_cvref<T, PyObject *>::value, int> = 0>
+    static handle cast(T &&, return_value_policy, handle /*parent*/) {
+        static_assert(is_same_ignoring_cvref<T, PyObject *>::value,
+                      "Invalid C++ type T for to-Python conversion (type_caster<PyObject>).");
+        return nullptr; // Unreachable.
+    }
+
+    static handle cast(PyObject *src, return_value_policy policy, handle /*parent*/) {
+        if (src == nullptr) {
+            throw error_already_set();
+        }
+        if (PyErr_Occurred()) {
+            raise_from(PyExc_SystemError, "src != nullptr but PyErr_Occurred()");
+            throw error_already_set();
+        }
+        if (policy == return_value_policy::take_ownership) {
+            return src;
+        }
+        if (policy == return_value_policy::reference
+            || policy == return_value_policy::automatic_reference) {
+            return handle(src).inc_ref();
+        }
+        pybind11_fail("type_caster<PyObject>::cast(): unsupported return_value_policy: "
+                      + std::to_string(static_cast<int>(policy)));
+    }
+
+    bool load(handle src, bool) {
+        value = reinterpret_borrow<object>(src);
+        return true;
+    }
+
+    template <typename T>
+    using cast_op_type = PyObject *;
+
+    explicit operator PyObject *() { return value.ptr(); }
+
+private:
+    object value;
+};
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/typing.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/typing.h
new file mode 100644
index 0000000000..47df10bfda
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/include/pybind11/typing.h
@@ -0,0 +1,241 @@
+/*
+    pybind11/typing.h: Convenience wrapper classes for basic Python types
+    with more explicit annotations.
+
+    Copyright (c) 2023 Dustin Spicuzza <dustin@virtualroadside.com>
+
+    All rights reserved. Use of this source code is governed by a
+    BSD-style license that can be found in the LICENSE file.
+*/
+
+#pragma once
+
+#include <algorithm>
+
+#include "detail/common.h"
+#include "cast.h"
+#include "pytypes.h"
+
+PYBIND11_NAMESPACE_BEGIN(PYBIND11_NAMESPACE)
+PYBIND11_NAMESPACE_BEGIN(typing)
+
+/*
+    The following types can be used to direct pybind11-generated docstrings
+    to have have more explicit types (e.g., `list[str]` instead of `list`).
+    Just use these in place of existing types.
+
+    There is no additional enforcement of types at runtime.
+*/
+
+template <typename... Types>
+class Tuple : public tuple {
+    using tuple::tuple;
+};
+
+template <typename K, typename V>
+class Dict : public dict {
+    using dict::dict;
+};
+
+template <typename T>
+class List : public list {
+    using list::list;
+};
+
+template <typename T>
+class Set : public set {
+    using set::set;
+};
+
+template <typename T>
+class Iterable : public iterable {
+    using iterable::iterable;
+};
+
+template <typename T>
+class Iterator : public iterator {
+    using iterator::iterator;
+};
+
+template <typename Signature>
+class Callable;
+
+template <typename Return, typename... Args>
+class Callable<Return(Args...)> : public function {
+    using function::function;
+};
+
+template <typename T>
+class Type : public type {
+    using type::type;
+};
+
+template <typename... Types>
+class Union : public object {
+    PYBIND11_OBJECT_DEFAULT(Union, object, PyObject_Type)
+    using object::object;
+};
+
+template <typename T>
+class Optional : public object {
+    PYBIND11_OBJECT_DEFAULT(Optional, object, PyObject_Type)
+    using object::object;
+};
+
+template <typename T>
+class TypeGuard : public bool_ {
+    using bool_::bool_;
+};
+
+template <typename T>
+class TypeIs : public bool_ {
+    using bool_::bool_;
+};
+
+class NoReturn : public none {
+    using none::none;
+};
+
+class Never : public none {
+    using none::none;
+};
+
+#if defined(__cpp_nontype_template_parameter_class)
+template <size_t N>
+struct StringLiteral {
+    constexpr StringLiteral(const char (&str)[N]) { std::copy_n(str, N, name); }
+    char name[N];
+};
+
+template <StringLiteral... StrLits>
+class Literal : public object {
+    PYBIND11_OBJECT_DEFAULT(Literal, object, PyObject_Type)
+};
+
+// Example syntax for creating a TypeVar.
+// typedef typing::TypeVar<"T"> TypeVarT;
+template <StringLiteral>
+class TypeVar : public object {
+    PYBIND11_OBJECT_DEFAULT(TypeVar, object, PyObject_Type)
+    using object::object;
+};
+#endif
+
+PYBIND11_NAMESPACE_END(typing)
+
+PYBIND11_NAMESPACE_BEGIN(detail)
+
+template <typename... Types>
+struct handle_type_name<typing::Tuple<Types...>> {
+    static constexpr auto name = const_name("tuple[")
+                                 + ::pybind11::detail::concat(make_caster<Types>::name...)
+                                 + const_name("]");
+};
+
+template <>
+struct handle_type_name<typing::Tuple<>> {
+    // PEP 484 specifies this syntax for an empty tuple
+    static constexpr auto name = const_name("tuple[()]");
+};
+
+template <typename T>
+struct handle_type_name<typing::Tuple<T, ellipsis>> {
+    // PEP 484 specifies this syntax for a variable-length tuple
+    static constexpr auto name
+        = const_name("tuple[") + make_caster<T>::name + const_name(", ...]");
+};
+
+template <typename K, typename V>
+struct handle_type_name<typing::Dict<K, V>> {
+    static constexpr auto name = const_name("dict[") + make_caster<K>::name + const_name(", ")
+                                 + make_caster<V>::name + const_name("]");
+};
+
+template <typename T>
+struct handle_type_name<typing::List<T>> {
+    static constexpr auto name = const_name("list[") + make_caster<T>::name + const_name("]");
+};
+
+template <typename T>
+struct handle_type_name<typing::Set<T>> {
+    static constexpr auto name = const_name("set[") + make_caster<T>::name + const_name("]");
+};
+
+template <typename T>
+struct handle_type_name<typing::Iterable<T>> {
+    static constexpr auto name = const_name("Iterable[") + make_caster<T>::name + const_name("]");
+};
+
+template <typename T>
+struct handle_type_name<typing::Iterator<T>> {
+    static constexpr auto name = const_name("Iterator[") + make_caster<T>::name + const_name("]");
+};
+
+template <typename Return, typename... Args>
+struct handle_type_name<typing::Callable<Return(Args...)>> {
+    using retval_type = conditional_t<std::is_same<Return, void>::value, void_type, Return>;
+    static constexpr auto name
+        = const_name("Callable[[") + ::pybind11::detail::concat(make_caster<Args>::name...)
+          + const_name("], ") + make_caster<retval_type>::name + const_name("]");
+};
+
+template <typename Return>
+struct handle_type_name<typing::Callable<Return(ellipsis)>> {
+    // PEP 484 specifies this syntax for defining only return types of callables
+    using retval_type = conditional_t<std::is_same<Return, void>::value, void_type, Return>;
+    static constexpr auto name
+        = const_name("Callable[..., ") + make_caster<retval_type>::name + const_name("]");
+};
+
+template <typename T>
+struct handle_type_name<typing::Type<T>> {
+    static constexpr auto name = const_name("type[") + make_caster<T>::name + const_name("]");
+};
+
+template <typename... Types>
+struct handle_type_name<typing::Union<Types...>> {
+    static constexpr auto name = const_name("Union[")
+                                 + ::pybind11::detail::concat(make_caster<Types>::name...)
+                                 + const_name("]");
+};
+
+template <typename T>
+struct handle_type_name<typing::Optional<T>> {
+    static constexpr auto name = const_name("Optional[") + make_caster<T>::name + const_name("]");
+};
+
+template <typename T>
+struct handle_type_name<typing::TypeGuard<T>> {
+    static constexpr auto name = const_name("TypeGuard[") + make_caster<T>::name + const_name("]");
+};
+
+template <typename T>
+struct handle_type_name<typing::TypeIs<T>> {
+    static constexpr auto name = const_name("TypeIs[") + make_caster<T>::name + const_name("]");
+};
+
+template <>
+struct handle_type_name<typing::NoReturn> {
+    static constexpr auto name = const_name("NoReturn");
+};
+
+template <>
+struct handle_type_name<typing::Never> {
+    static constexpr auto name = const_name("Never");
+};
+
+#if defined(__cpp_nontype_template_parameter_class)
+template <typing::StringLiteral... Literals>
+struct handle_type_name<typing::Literal<Literals...>> {
+    static constexpr auto name = const_name("Literal[")
+                                 + pybind11::detail::concat(const_name(Literals.name)...)
+                                 + const_name("]");
+};
+template <typing::StringLiteral StrLit>
+struct handle_type_name<typing::TypeVar<StrLit>> {
+    static constexpr auto name = const_name(StrLit.name);
+};
+#endif
+
+PYBIND11_NAMESPACE_END(detail)
+PYBIND11_NAMESPACE_END(PYBIND11_NAMESPACE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/FindCatch.cmake b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/FindCatch.cmake
new file mode 100644
index 0000000000..57bba58b30
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/FindCatch.cmake
@@ -0,0 +1,72 @@
+# - Find the Catch test framework or download it (single header)
+#
+# This is a quick module for internal use. It assumes that Catch is
+# REQUIRED and that a minimum version is provided (not EXACT). If
+# a suitable version isn't found locally, the single header file
+# will be downloaded and placed in the build dir: PROJECT_BINARY_DIR.
+#
+# This code sets the following variables:
+#  CATCH_INCLUDE_DIR      - path to catch.hpp
+#  CATCH_VERSION          - version number
+
+option(DOWNLOAD_CATCH "Download catch2 if not found")
+
+if(NOT Catch_FIND_VERSION)
+  message(FATAL_ERROR "A version number must be specified.")
+elseif(Catch_FIND_REQUIRED)
+  message(FATAL_ERROR "This module assumes Catch is not required.")
+elseif(Catch_FIND_VERSION_EXACT)
+  message(FATAL_ERROR "Exact version numbers are not supported, only minimum.")
+endif()
+
+# Extract the version number from catch.hpp
+function(_get_catch_version)
+  file(
+    STRINGS "${CATCH_INCLUDE_DIR}/catch.hpp" version_line
+    REGEX "Catch v.*"
+    LIMIT_COUNT 1)
+  if(version_line MATCHES "Catch v([0-9]+)\\.([0-9]+)\\.([0-9]+)")
+    set(CATCH_VERSION
+        "${CMAKE_MATCH_1}.${CMAKE_MATCH_2}.${CMAKE_MATCH_3}"
+        PARENT_SCOPE)
+  endif()
+endfunction()
+
+# Download the single-header version of Catch
+function(_download_catch version destination_dir)
+  message(STATUS "Downloading catch v${version}...")
+  set(url https://github.com/philsquared/Catch/releases/download/v${version}/catch.hpp)
+  file(DOWNLOAD ${url} "${destination_dir}/catch.hpp" STATUS status)
+  list(GET status 0 error)
+  if(error)
+    message(FATAL_ERROR "Could not download ${url}")
+  endif()
+  set(CATCH_INCLUDE_DIR
+      "${destination_dir}"
+      CACHE INTERNAL "")
+endfunction()
+
+# Look for catch locally
+find_path(
+  CATCH_INCLUDE_DIR
+  NAMES catch.hpp
+  PATH_SUFFIXES catch2)
+if(CATCH_INCLUDE_DIR)
+  _get_catch_version()
+endif()
+
+# Download the header if it wasn't found or if it's outdated
+if(NOT CATCH_VERSION OR CATCH_VERSION VERSION_LESS ${Catch_FIND_VERSION})
+  if(DOWNLOAD_CATCH)
+    _download_catch(${Catch_FIND_VERSION} "${PROJECT_BINARY_DIR}/catch/")
+    _get_catch_version()
+  else()
+    set(CATCH_FOUND FALSE)
+    return()
+  endif()
+endif()
+
+add_library(Catch2::Catch2 IMPORTED INTERFACE)
+set_property(TARGET Catch2::Catch2 PROPERTY INTERFACE_INCLUDE_DIRECTORIES "${CATCH_INCLUDE_DIR}")
+
+set(CATCH_FOUND TRUE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/FindEigen3.cmake b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/FindEigen3.cmake
new file mode 100644
index 0000000000..83625d92e0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/FindEigen3.cmake
@@ -0,0 +1,86 @@
+# - Try to find Eigen3 lib
+#
+# This module supports requiring a minimum version, e.g. you can do
+#   find_package(Eigen3 3.1.2)
+# to require version 3.1.2 or newer of Eigen3.
+#
+# Once done this will define
+#
+#  EIGEN3_FOUND - system has eigen lib with correct version
+#  EIGEN3_INCLUDE_DIR - the eigen include directory
+#  EIGEN3_VERSION - eigen version
+
+# Copyright (c) 2006, 2007 Montel Laurent, <montel@kde.org>
+# Copyright (c) 2008, 2009 Gael Guennebaud, <g.gael@free.fr>
+# Copyright (c) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>
+# Redistribution and use is allowed according to the terms of the 2-clause BSD license.
+
+if(NOT Eigen3_FIND_VERSION)
+  if(NOT Eigen3_FIND_VERSION_MAJOR)
+    set(Eigen3_FIND_VERSION_MAJOR 2)
+  endif(NOT Eigen3_FIND_VERSION_MAJOR)
+  if(NOT Eigen3_FIND_VERSION_MINOR)
+    set(Eigen3_FIND_VERSION_MINOR 91)
+  endif(NOT Eigen3_FIND_VERSION_MINOR)
+  if(NOT Eigen3_FIND_VERSION_PATCH)
+    set(Eigen3_FIND_VERSION_PATCH 0)
+  endif(NOT Eigen3_FIND_VERSION_PATCH)
+
+  set(Eigen3_FIND_VERSION
+      "${Eigen3_FIND_VERSION_MAJOR}.${Eigen3_FIND_VERSION_MINOR}.${Eigen3_FIND_VERSION_PATCH}")
+endif(NOT Eigen3_FIND_VERSION)
+
+macro(_eigen3_check_version)
+  file(READ "${EIGEN3_INCLUDE_DIR}/Eigen/src/Core/util/Macros.h" _eigen3_version_header)
+
+  string(REGEX MATCH "define[ \t]+EIGEN_WORLD_VERSION[ \t]+([0-9]+)" _eigen3_world_version_match
+               "${_eigen3_version_header}")
+  set(EIGEN3_WORLD_VERSION "${CMAKE_MATCH_1}")
+  string(REGEX MATCH "define[ \t]+EIGEN_MAJOR_VERSION[ \t]+([0-9]+)" _eigen3_major_version_match
+               "${_eigen3_version_header}")
+  set(EIGEN3_MAJOR_VERSION "${CMAKE_MATCH_1}")
+  string(REGEX MATCH "define[ \t]+EIGEN_MINOR_VERSION[ \t]+([0-9]+)" _eigen3_minor_version_match
+               "${_eigen3_version_header}")
+  set(EIGEN3_MINOR_VERSION "${CMAKE_MATCH_1}")
+
+  set(EIGEN3_VERSION ${EIGEN3_WORLD_VERSION}.${EIGEN3_MAJOR_VERSION}.${EIGEN3_MINOR_VERSION})
+  if(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
+    set(EIGEN3_VERSION_OK FALSE)
+  else(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
+    set(EIGEN3_VERSION_OK TRUE)
+  endif(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
+
+  if(NOT EIGEN3_VERSION_OK)
+
+    message(STATUS "Eigen3 version ${EIGEN3_VERSION} found in ${EIGEN3_INCLUDE_DIR}, "
+                   "but at least version ${Eigen3_FIND_VERSION} is required")
+  endif(NOT EIGEN3_VERSION_OK)
+endmacro(_eigen3_check_version)
+
+if(EIGEN3_INCLUDE_DIR)
+
+  # in cache already
+  _eigen3_check_version()
+  set(EIGEN3_FOUND ${EIGEN3_VERSION_OK})
+
+else(EIGEN3_INCLUDE_DIR)
+  if(NOT DEFINED KDE4_INCLUDE_DIR)
+    set(KDE4_INCLUDE_DIR "")
+  endif()
+
+  find_path(
+    EIGEN3_INCLUDE_DIR
+    NAMES signature_of_eigen3_matrix_library
+    PATHS ${CMAKE_INSTALL_PREFIX}/include ${KDE4_INCLUDE_DIR}
+    PATH_SUFFIXES eigen3 eigen)
+
+  if(EIGEN3_INCLUDE_DIR)
+    _eigen3_check_version()
+  endif(EIGEN3_INCLUDE_DIR)
+
+  include(FindPackageHandleStandardArgs)
+  find_package_handle_standard_args(Eigen3 DEFAULT_MSG EIGEN3_INCLUDE_DIR EIGEN3_VERSION_OK)
+
+  mark_as_advanced(EIGEN3_INCLUDE_DIR)
+
+endif(EIGEN3_INCLUDE_DIR)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/FindPythonLibsNew.cmake b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/FindPythonLibsNew.cmake
new file mode 100644
index 0000000000..bbbd9f9ec1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/FindPythonLibsNew.cmake
@@ -0,0 +1,285 @@
+# - Find python libraries
+# This module finds the libraries corresponding to the Python interpreter
+# FindPythonInterp provides.
+# This code sets the following variables:
+#
+#  PYTHONLIBS_FOUND           - have the Python libs been found
+#  PYTHON_PREFIX              - path to the Python installation
+#  PYTHON_LIBRARIES           - path to the python library
+#  PYTHON_INCLUDE_DIRS        - path to where Python.h is found
+#  PYTHON_MODULE_EXTENSION    - lib extension, e.g. '.so' or '.pyd'
+#  PYTHON_MODULE_PREFIX       - lib name prefix: usually an empty string
+#  PYTHON_SITE_PACKAGES       - path to installation site-packages
+#  PYTHON_IS_DEBUG            - whether the Python interpreter is a debug build
+#
+# Thanks to talljimbo for the patch adding the 'LDVERSION' config
+# variable usage.
+
+#=============================================================================
+# Copyright 2001-2009 Kitware, Inc.
+# Copyright 2012 Continuum Analytics, Inc.
+#
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions
+# are met:
+#
+# * Redistributions of source code must retain the above copyright
+# notice, this list of conditions and the following disclaimer.
+#
+# * Redistributions in binary form must reproduce the above copyright
+# notice, this list of conditions and the following disclaimer in the
+# documentation and/or other materials provided with the distribution.
+#
+# * Neither the names of Kitware, Inc., the Insight Software Consortium,
+# nor the names of their contributors may be used to endorse or promote
+# products derived from this software without specific prior written
+# permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+# # A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+# HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#=============================================================================
+
+# Checking for the extension makes sure that `LibsNew` was found and not just `Libs`.
+if(PYTHONLIBS_FOUND AND PYTHON_MODULE_EXTENSION)
+  return()
+endif()
+
+if(PythonLibsNew_FIND_QUIETLY)
+  set(_pythonlibs_quiet QUIET)
+else()
+  set(_pythonlibs_quiet "")
+endif()
+
+if(PythonLibsNew_FIND_REQUIRED)
+  set(_pythonlibs_required REQUIRED)
+endif()
+
+# Check to see if the `python` command is present and from a virtual
+# environment, conda, or GHA activation - if it is, try to use that.
+
+if(NOT DEFINED PYTHON_EXECUTABLE)
+  if(DEFINED ENV{VIRTUAL_ENV})
+    find_program(
+      PYTHON_EXECUTABLE python
+      PATHS "$ENV{VIRTUAL_ENV}" "$ENV{VIRTUAL_ENV}/bin"
+      NO_DEFAULT_PATH)
+  elseif(DEFINED ENV{CONDA_PREFIX})
+    find_program(
+      PYTHON_EXECUTABLE python
+      PATHS "$ENV{CONDA_PREFIX}" "$ENV{CONDA_PREFIX}/bin"
+      NO_DEFAULT_PATH)
+  elseif(DEFINED ENV{pythonLocation})
+    find_program(
+      PYTHON_EXECUTABLE python
+      PATHS "$ENV{pythonLocation}" "$ENV{pythonLocation}/bin"
+      NO_DEFAULT_PATH)
+  endif()
+  if(NOT PYTHON_EXECUTABLE)
+    unset(PYTHON_EXECUTABLE)
+  endif()
+endif()
+
+# Use the Python interpreter to find the libs.
+if(NOT PythonLibsNew_FIND_VERSION)
+  set(PythonLibsNew_FIND_VERSION "3.6")
+endif()
+
+find_package(PythonInterp ${PythonLibsNew_FIND_VERSION} ${_pythonlibs_required}
+             ${_pythonlibs_quiet})
+
+if(NOT PYTHONINTERP_FOUND)
+  set(PYTHONLIBS_FOUND FALSE)
+  set(PythonLibsNew_FOUND FALSE)
+  return()
+endif()
+
+# According to https://stackoverflow.com/questions/646518/python-how-to-detect-debug-interpreter
+# testing whether sys has the gettotalrefcount function is a reliable, cross-platform
+# way to detect a CPython debug interpreter.
+#
+# The library suffix is from the config var LDVERSION sometimes, otherwise
+# VERSION. VERSION will typically be like "2.7" on unix, and "27" on windows.
+execute_process(
+  COMMAND
+    "${PYTHON_EXECUTABLE}" "-c" "
+import sys;import struct;
+import sysconfig as s
+USE_SYSCONFIG = sys.version_info >= (3, 10)
+if not USE_SYSCONFIG:
+    from distutils import sysconfig as ds
+print('.'.join(str(v) for v in sys.version_info));
+print(sys.prefix);
+if USE_SYSCONFIG:
+    scheme = s.get_default_scheme()
+    if scheme == 'posix_local':
+        # Debian's default scheme installs to /usr/local/ but we want to find headers in /usr/
+        scheme = 'posix_prefix'
+    print(s.get_path('platinclude', scheme))
+    print(s.get_path('platlib'))
+    print(s.get_config_var('EXT_SUFFIX') or s.get_config_var('SO'))
+else:
+    print(ds.get_python_inc(plat_specific=True));
+    print(ds.get_python_lib(plat_specific=True));
+    print(ds.get_config_var('EXT_SUFFIX') or ds.get_config_var('SO'));
+print(hasattr(sys, 'gettotalrefcount')+0);
+print(struct.calcsize('@P'));
+print(s.get_config_var('LDVERSION') or s.get_config_var('VERSION'));
+print(s.get_config_var('LIBDIR') or '');
+print(s.get_config_var('MULTIARCH') or '');
+"
+  RESULT_VARIABLE _PYTHON_SUCCESS
+  OUTPUT_VARIABLE _PYTHON_VALUES
+  ERROR_VARIABLE _PYTHON_ERROR_VALUE)
+
+if(NOT _PYTHON_SUCCESS MATCHES 0)
+  if(PythonLibsNew_FIND_REQUIRED)
+    message(FATAL_ERROR "Python config failure:\n${_PYTHON_ERROR_VALUE}")
+  endif()
+  set(PYTHONLIBS_FOUND FALSE)
+  set(PythonLibsNew_FOUND FALSE)
+  return()
+endif()
+
+option(
+  PYBIND11_PYTHONLIBS_OVERWRITE
+  "Overwrite cached values read from Python library (classic search). Turn off if cross-compiling and manually setting these values."
+  ON)
+# Can manually set values when cross-compiling
+macro(_PYBIND11_GET_IF_UNDEF lst index name)
+  if(PYBIND11_PYTHONLIBS_OVERWRITE OR NOT DEFINED "${name}")
+    list(GET "${lst}" "${index}" "${name}")
+  endif()
+endmacro()
+
+# Convert the process output into a list
+if(WIN32)
+  string(REGEX REPLACE "\\\\" "/" _PYTHON_VALUES ${_PYTHON_VALUES})
+endif()
+string(REGEX REPLACE ";" "\\\\;" _PYTHON_VALUES ${_PYTHON_VALUES})
+string(REGEX REPLACE "\n" ";" _PYTHON_VALUES ${_PYTHON_VALUES})
+_pybind11_get_if_undef(_PYTHON_VALUES 0 _PYTHON_VERSION_LIST)
+_pybind11_get_if_undef(_PYTHON_VALUES 1 PYTHON_PREFIX)
+_pybind11_get_if_undef(_PYTHON_VALUES 2 PYTHON_INCLUDE_DIR)
+_pybind11_get_if_undef(_PYTHON_VALUES 3 PYTHON_SITE_PACKAGES)
+_pybind11_get_if_undef(_PYTHON_VALUES 4 PYTHON_MODULE_EXTENSION)
+_pybind11_get_if_undef(_PYTHON_VALUES 5 PYTHON_IS_DEBUG)
+_pybind11_get_if_undef(_PYTHON_VALUES 6 PYTHON_SIZEOF_VOID_P)
+_pybind11_get_if_undef(_PYTHON_VALUES 7 PYTHON_LIBRARY_SUFFIX)
+_pybind11_get_if_undef(_PYTHON_VALUES 8 PYTHON_LIBDIR)
+_pybind11_get_if_undef(_PYTHON_VALUES 9 PYTHON_MULTIARCH)
+
+# Make sure the Python has the same pointer-size as the chosen compiler
+# Skip if CMAKE_SIZEOF_VOID_P is not defined
+# This should be skipped for (non-Apple) cross-compiles (like EMSCRIPTEN)
+if(NOT CMAKE_CROSSCOMPILING
+   AND CMAKE_SIZEOF_VOID_P
+   AND (NOT "${PYTHON_SIZEOF_VOID_P}" STREQUAL "${CMAKE_SIZEOF_VOID_P}"))
+  if(PythonLibsNew_FIND_REQUIRED)
+    math(EXPR _PYTHON_BITS "${PYTHON_SIZEOF_VOID_P} * 8")
+    math(EXPR _CMAKE_BITS "${CMAKE_SIZEOF_VOID_P} * 8")
+    message(FATAL_ERROR "Python config failure: Python is ${_PYTHON_BITS}-bit, "
+                        "chosen compiler is  ${_CMAKE_BITS}-bit")
+  endif()
+  set(PYTHONLIBS_FOUND FALSE)
+  set(PythonLibsNew_FOUND FALSE)
+  return()
+endif()
+
+# The built-in FindPython didn't always give the version numbers
+string(REGEX REPLACE "\\." ";" _PYTHON_VERSION_LIST ${_PYTHON_VERSION_LIST})
+list(GET _PYTHON_VERSION_LIST 0 PYTHON_VERSION_MAJOR)
+list(GET _PYTHON_VERSION_LIST 1 PYTHON_VERSION_MINOR)
+list(GET _PYTHON_VERSION_LIST 2 PYTHON_VERSION_PATCH)
+set(PYTHON_VERSION "${PYTHON_VERSION_MAJOR}.${PYTHON_VERSION_MINOR}.${PYTHON_VERSION_PATCH}")
+
+# Make sure all directory separators are '/'
+string(REGEX REPLACE "\\\\" "/" PYTHON_PREFIX "${PYTHON_PREFIX}")
+string(REGEX REPLACE "\\\\" "/" PYTHON_INCLUDE_DIR "${PYTHON_INCLUDE_DIR}")
+string(REGEX REPLACE "\\\\" "/" PYTHON_SITE_PACKAGES "${PYTHON_SITE_PACKAGES}")
+
+if(CMAKE_HOST_WIN32)
+  set(PYTHON_LIBRARY "${PYTHON_PREFIX}/libs/python${PYTHON_LIBRARY_SUFFIX}.lib")
+
+  # when run in a venv, PYTHON_PREFIX points to it. But the libraries remain in the
+  # original python installation. They may be found relative to PYTHON_INCLUDE_DIR.
+  if(NOT EXISTS "${PYTHON_LIBRARY}")
+    get_filename_component(_PYTHON_ROOT ${PYTHON_INCLUDE_DIR} DIRECTORY)
+    set(PYTHON_LIBRARY "${_PYTHON_ROOT}/libs/python${PYTHON_LIBRARY_SUFFIX}.lib")
+  endif()
+
+  # if we are in MSYS & MINGW, and we didn't find windows python lib, look for system python lib
+  if(DEFINED ENV{MSYSTEM}
+     AND MINGW
+     AND NOT EXISTS "${PYTHON_LIBRARY}")
+    if(PYTHON_MULTIARCH)
+      set(_PYTHON_LIBS_SEARCH "${PYTHON_LIBDIR}/${PYTHON_MULTIARCH}" "${PYTHON_LIBDIR}")
+    else()
+      set(_PYTHON_LIBS_SEARCH "${PYTHON_LIBDIR}")
+    endif()
+    unset(PYTHON_LIBRARY)
+    find_library(
+      PYTHON_LIBRARY
+      NAMES "python${PYTHON_LIBRARY_SUFFIX}"
+      PATHS ${_PYTHON_LIBS_SEARCH}
+      NO_DEFAULT_PATH)
+  endif()
+
+  # raise an error if the python libs are still not found.
+  if(NOT EXISTS "${PYTHON_LIBRARY}")
+    message(FATAL_ERROR "Python libraries not found")
+  endif()
+
+else()
+  if(PYTHON_MULTIARCH)
+    set(_PYTHON_LIBS_SEARCH "${PYTHON_LIBDIR}/${PYTHON_MULTIARCH}" "${PYTHON_LIBDIR}")
+  else()
+    set(_PYTHON_LIBS_SEARCH "${PYTHON_LIBDIR}")
+  endif()
+  #message(STATUS "Searching for Python libs in ${_PYTHON_LIBS_SEARCH}")
+  # Probably this needs to be more involved. It would be nice if the config
+  # information the python interpreter itself gave us were more complete.
+  find_library(
+    PYTHON_LIBRARY
+    NAMES "python${PYTHON_LIBRARY_SUFFIX}"
+    PATHS ${_PYTHON_LIBS_SEARCH}
+    NO_DEFAULT_PATH)
+
+  # If all else fails, just set the name/version and let the linker figure out the path.
+  if(NOT PYTHON_LIBRARY)
+    set(PYTHON_LIBRARY python${PYTHON_LIBRARY_SUFFIX})
+  endif()
+endif()
+
+mark_as_advanced(PYTHON_LIBRARY PYTHON_INCLUDE_DIR)
+
+# We use PYTHON_INCLUDE_DIR, PYTHON_LIBRARY and PYTHON_DEBUG_LIBRARY for the
+# cache entries because they are meant to specify the location of a single
+# library. We now set the variables listed by the documentation for this
+# module.
+set(PYTHON_INCLUDE_DIRS "${PYTHON_INCLUDE_DIR}")
+set(PYTHON_LIBRARIES "${PYTHON_LIBRARY}")
+if(NOT PYTHON_DEBUG_LIBRARY)
+  set(PYTHON_DEBUG_LIBRARY "")
+endif()
+set(PYTHON_DEBUG_LIBRARIES "${PYTHON_DEBUG_LIBRARY}")
+
+find_package_message(PYTHON "Found PythonLibs: ${PYTHON_LIBRARY}"
+                     "${PYTHON_EXECUTABLE}${PYTHON_VERSION_STRING}")
+
+set(PYTHONLIBS_FOUND TRUE)
+set(PythonLibsNew_FOUND TRUE)
+
+if(NOT PYTHON_MODULE_PREFIX)
+  set(PYTHON_MODULE_PREFIX "")
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/JoinPaths.cmake b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/JoinPaths.cmake
new file mode 100644
index 0000000000..c68d91b84d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/JoinPaths.cmake
@@ -0,0 +1,23 @@
+# This module provides function for joining paths
+# known from most languages
+#
+# SPDX-License-Identifier: (MIT OR CC0-1.0)
+# Copyright 2020 Jan Tojnar
+# https://github.com/jtojnar/cmake-snips
+#
+# Modelled after Python’s os.path.join
+# https://docs.python.org/3.7/library/os.path.html#os.path.join
+# Windows not supported
+function(join_paths joined_path first_path_segment)
+    set(temp_path "${first_path_segment}")
+    foreach(current_segment IN LISTS ARGN)
+        if(NOT ("${current_segment}" STREQUAL ""))
+            if(IS_ABSOLUTE "${current_segment}")
+                set(temp_path "${current_segment}")
+            else()
+                set(temp_path "${temp_path}/${current_segment}")
+            endif()
+        endif()
+    endforeach()
+    set(${joined_path} "${temp_path}" PARENT_SCOPE)
+endfunction()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/check-style.sh b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/check-style.sh
new file mode 100644
index 0000000000..6d832523a7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/check-style.sh
@@ -0,0 +1,44 @@
+#!/bin/bash
+#
+# Script to check include/test code for common pybind11 code style errors.
+#
+# This script currently checks for
+#
+# 1. missing space between keyword and parenthesis, e.g.: for(, if(, while(
+# 2. Missing space between right parenthesis and brace, e.g. 'for (...){'
+# 3. opening brace on its own line. It should always be on the same line as the
+#    if/while/for/do statement.
+#
+# Invoke as: tools/check-style.sh <filenames>
+#
+
+check_style_errors=0
+IFS=$'\n'
+
+
+found="$(grep '\<\(if\|for\|while\|catch\)(\|){' "$@" -rn --color=always)"
+if [ -n "$found" ]; then
+    echo -e '\033[31;01mError: found the following coding style problems:\033[0m'
+    check_style_errors=1
+    echo "${found//^/    /}"
+fi
+
+found="$(awk '
+function prefix(filename, lineno) {
+    return "    \033[35m" filename "\033[36m:\033[32m" lineno "\033[36m:\033[0m"
+}
+function mark(pattern, string) { sub(pattern, "\033[01;31m&\033[0m", string); return string }
+last && /^\s*{/ {
+    print prefix(FILENAME, FNR-1) mark("\\)\\s*$", last)
+    print prefix(FILENAME, FNR)   mark("^\\s*{", $0)
+    last=""
+}
+{ last = /(if|for|while|catch|switch)\s*\(.*\)\s*$/ ? $0 : "" }
+' "$(find include -type f)" "$@")"
+if [ -n "$found" ]; then
+    check_style_errors=1
+    echo -e '\033[31;01mError: braces should occur on the same line as the if/while/.. statement. Found issues in the following files:\033[0m'
+    echo "$found"
+fi
+
+exit $check_style_errors
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/cmake_uninstall.cmake.in b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/cmake_uninstall.cmake.in
new file mode 100644
index 0000000000..1e5d2bb876
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/cmake_uninstall.cmake.in
@@ -0,0 +1,23 @@
+# Source: https://gitlab.kitware.com/cmake/community/-/wikis/FAQ#can-i-do-make-uninstall-with-cmake
+
+if(NOT EXISTS "@CMAKE_BINARY_DIR@/install_manifest.txt")
+  message(FATAL_ERROR "Cannot find install manifest: @CMAKE_BINARY_DIR@/install_manifest.txt")
+endif()
+
+file(READ "@CMAKE_BINARY_DIR@/install_manifest.txt" files)
+string(REGEX REPLACE "\n" ";" files "${files}")
+foreach(file ${files})
+  message(STATUS "Uninstalling $ENV{DESTDIR}${file}")
+  if(IS_SYMLINK "$ENV{DESTDIR}${file}" OR EXISTS "$ENV{DESTDIR}${file}")
+    exec_program(
+      "@CMAKE_COMMAND@" ARGS
+      "-E remove \"$ENV{DESTDIR}${file}\""
+      OUTPUT_VARIABLE rm_out
+      RETURN_VALUE rm_retval)
+    if(NOT "${rm_retval}" STREQUAL 0)
+      message(FATAL_ERROR "Problem when removing $ENV{DESTDIR}${file}")
+    endif()
+  else(IS_SYMLINK "$ENV{DESTDIR}${file}" OR EXISTS "$ENV{DESTDIR}${file}")
+    message(STATUS "File $ENV{DESTDIR}${file} does not exist.")
+  endif()
+endforeach()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/codespell_ignore_lines_from_errors.py b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/codespell_ignore_lines_from_errors.py
new file mode 100644
index 0000000000..5403ec3ad0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/codespell_ignore_lines_from_errors.py
@@ -0,0 +1,35 @@
+"""Simple script for rebuilding .codespell-ignore-lines
+
+Usage:
+
+cat < /dev/null > .codespell-ignore-lines
+pre-commit run --all-files codespell >& /tmp/codespell_errors.txt
+python3 tools/codespell_ignore_lines_from_errors.py /tmp/codespell_errors.txt > .codespell-ignore-lines
+
+git diff to review changes, then commit, push.
+"""
+
+import sys
+from typing import List
+
+
+def run(args: List[str]) -> None:
+    assert len(args) == 1, "codespell_errors.txt"
+    cache = {}
+    done = set()
+    for line in sorted(open(args[0]).read().splitlines()):
+        i = line.find(" ==> ")
+        if i > 0:
+            flds = line[:i].split(":")
+            if len(flds) >= 2:
+                filename, line_num = flds[:2]
+                if filename not in cache:
+                    cache[filename] = open(filename).read().splitlines()
+                supp = cache[filename][int(line_num) - 1]
+                if supp not in done:
+                    print(supp)
+                    done.add(supp)
+
+
+if __name__ == "__main__":
+    run(args=sys.argv[1:])
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/libsize.py b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/libsize.py
new file mode 100644
index 0000000000..1ac9afbe81
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/libsize.py
@@ -0,0 +1,36 @@
+import os
+import sys
+
+# Internal build script for generating debugging test .so size.
+# Usage:
+#     python libsize.py file.so save.txt -- displays the size of file.so and, if save.txt exists, compares it to the
+#                                           size in it, then overwrites save.txt with the new size for future runs.
+
+if len(sys.argv) != 3:
+    sys.exit("Invalid arguments: usage: python libsize.py file.so save.txt")
+
+lib = sys.argv[1]
+save = sys.argv[2]
+
+if not os.path.exists(lib):
+    sys.exit(f"Error: requested file ({lib}) does not exist")
+
+libsize = os.path.getsize(lib)
+
+print("------", os.path.basename(lib), "file size:", libsize, end="")
+
+if os.path.exists(save):
+    with open(save) as sf:
+        oldsize = int(sf.readline())
+
+    if oldsize > 0:
+        change = libsize - oldsize
+        if change == 0:
+            print(" (no change)")
+        else:
+            print(f" (change of {change:+} bytes = {change / oldsize:+.2%})")
+else:
+    print()
+
+with open(save, "w") as sf:
+    sf.write(str(libsize))
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/make_changelog.py b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/make_changelog.py
new file mode 100644
index 0000000000..839040a938
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/make_changelog.py
@@ -0,0 +1,63 @@
+#!/usr/bin/env python3
+
+import re
+
+import ghapi.all
+from rich import print
+from rich.syntax import Syntax
+
+ENTRY = re.compile(
+    r"""
+    Suggested \s changelog \s entry:
+    .*
+    ```rst
+    \s*
+    (.*?)
+    \s*
+    ```
+""",
+    re.DOTALL | re.VERBOSE,
+)
+
+print()
+
+
+api = ghapi.all.GhApi(owner="pybind", repo="pybind11")
+
+issues_pages = ghapi.page.paged(
+    api.issues.list_for_repo, labels="needs changelog", state="closed"
+)
+issues = (issue for page in issues_pages for issue in page)
+missing = []
+
+for issue in issues:
+    changelog = ENTRY.findall(issue.body)
+    if changelog:
+        (msg,) = changelog
+        if not msg.startswith("* "):
+            msg = "* " + msg
+        if not msg.endswith("."):
+            msg += "."
+
+        msg += f"\n  `#{issue.number} <{issue.html_url}>`_"
+
+        print(Syntax(msg, "rst", theme="ansi_light", word_wrap=True))
+        print()
+
+    else:
+        missing.append(issue)
+
+if missing:
+    print()
+    print("[blue]" + "-" * 30)
+    print()
+
+    for issue in missing:
+        print(f"[red bold]Missing:[/red bold][red] {issue.title}")
+        print(f"[red]  {issue.html_url}\n")
+
+    print("[bold]Template:\n")
+    msg = "## Suggested changelog entry:\n\n```rst\n\n```"
+    print(Syntax(msg, "md", theme="ansi_light"))
+
+print()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11.pc.in b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11.pc.in
new file mode 100644
index 0000000000..402f0b357d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11.pc.in
@@ -0,0 +1,7 @@
+prefix=@prefix_for_pc_file@
+includedir=@includedir_for_pc_file@
+
+Name: @PROJECT_NAME@
+Description: Seamless operability between C++11 and Python
+Version: @PROJECT_VERSION@
+Cflags: -I${includedir}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11Common.cmake b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11Common.cmake
new file mode 100644
index 0000000000..e1fb601acc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11Common.cmake
@@ -0,0 +1,385 @@
+#[======================================================[.rst
+
+Adds the following targets::
+
+    pybind11::pybind11 - link to headers and pybind11
+    pybind11::module - Adds module links
+    pybind11::embed - Adds embed links
+    pybind11::lto - Link time optimizations (manual selection)
+    pybind11::thin_lto - Link time optimizations (manual selection)
+    pybind11::python_link_helper - Adds link to Python libraries
+    pybind11::windows_extras - MSVC bigobj and mp for building multithreaded
+    pybind11::opt_size - avoid optimizations that increase code size
+
+Adds the following functions::
+
+    pybind11_strip(target) - strip target after building on linux/macOS
+    pybind11_find_import(module) - See if a module is installed.
+
+#]======================================================]
+
+# CMake 3.10 has an include_guard command, but we can't use that yet
+# include_guard(global) (pre-CMake 3.10)
+if(TARGET pybind11::lto)
+  return()
+endif()
+
+# If we are in subdirectory mode, all IMPORTED targets must be GLOBAL. If we
+# are in CONFIG mode, they should be "normal" targets instead.
+# In CMake 3.11+ you can promote a target to global after you create it,
+# which might be simpler than this check.
+get_property(
+  is_config
+  TARGET pybind11::headers
+  PROPERTY IMPORTED)
+if(NOT is_config)
+  set(optional_global GLOBAL)
+endif()
+
+# If not run in Python mode, we still would like this to at least
+# include pybind11's include directory:
+set(pybind11_INCLUDE_DIRS
+    "${pybind11_INCLUDE_DIR}"
+    CACHE INTERNAL "Include directory for pybind11 (Python not requested)")
+
+# --------------------- Shared targets ----------------------------
+
+# Build an interface library target:
+add_library(pybind11::pybind11 IMPORTED INTERFACE ${optional_global})
+set_property(
+  TARGET pybind11::pybind11
+  APPEND
+  PROPERTY INTERFACE_LINK_LIBRARIES pybind11::headers)
+
+# Build a module target:
+add_library(pybind11::module IMPORTED INTERFACE ${optional_global})
+set_property(
+  TARGET pybind11::module
+  APPEND
+  PROPERTY INTERFACE_LINK_LIBRARIES pybind11::pybind11)
+
+# Build an embed library target:
+add_library(pybind11::embed IMPORTED INTERFACE ${optional_global})
+set_property(
+  TARGET pybind11::embed
+  APPEND
+  PROPERTY INTERFACE_LINK_LIBRARIES pybind11::pybind11)
+
+# --------------------------- link helper ---------------------------
+
+add_library(pybind11::python_link_helper IMPORTED INTERFACE ${optional_global})
+
+if(CMAKE_VERSION VERSION_LESS 3.13)
+  # In CMake 3.11+, you can set INTERFACE properties via the normal methods, and
+  # this would be simpler.
+  set_property(
+    TARGET pybind11::python_link_helper
+    APPEND
+    PROPERTY INTERFACE_LINK_LIBRARIES "$<$<PLATFORM_ID:Darwin>:-undefined dynamic_lookup>")
+else()
+  # link_options was added in 3.13+
+  # This is safer, because you are ensured the deduplication pass in CMake will not consider
+  # these separate and remove one but not the other.
+  set_property(
+    TARGET pybind11::python_link_helper
+    APPEND
+    PROPERTY INTERFACE_LINK_OPTIONS "$<$<PLATFORM_ID:Darwin>:LINKER:-undefined,dynamic_lookup>")
+endif()
+
+# ------------------------ Windows extras -------------------------
+
+add_library(pybind11::windows_extras IMPORTED INTERFACE ${optional_global})
+
+if(MSVC) # That's also clang-cl
+  # /bigobj is needed for bigger binding projects due to the limit to 64k
+  # addressable sections
+  set_property(
+    TARGET pybind11::windows_extras
+    APPEND
+    PROPERTY INTERFACE_COMPILE_OPTIONS $<$<COMPILE_LANGUAGE:CXX>:/bigobj>)
+
+  # /MP enables multithreaded builds (relevant when there are many files) for MSVC
+  if("${CMAKE_CXX_COMPILER_ID}" STREQUAL "MSVC") # no Clang no Intel
+    if(CMAKE_VERSION VERSION_LESS 3.11)
+      set_property(
+        TARGET pybind11::windows_extras
+        APPEND
+        PROPERTY INTERFACE_COMPILE_OPTIONS $<$<NOT:$<CONFIG:Debug>>:/MP>)
+    else()
+      # Only set these options for C++ files.  This is important so that, for
+      # instance, projects that include other types of source files like CUDA
+      # .cu files don't get these options propagated to nvcc since that would
+      # cause the build to fail.
+      set_property(
+        TARGET pybind11::windows_extras
+        APPEND
+        PROPERTY INTERFACE_COMPILE_OPTIONS
+                 $<$<NOT:$<CONFIG:Debug>>:$<$<COMPILE_LANGUAGE:CXX>:/MP>>)
+    endif()
+  endif()
+endif()
+
+# ----------------------- Optimize binary size --------------------------
+
+add_library(pybind11::opt_size IMPORTED INTERFACE ${optional_global})
+
+if(MSVC)
+  set(PYBIND11_OPT_SIZE /Os)
+else()
+  set(PYBIND11_OPT_SIZE -Os)
+endif()
+
+set_property(
+  TARGET pybind11::opt_size
+  APPEND
+  PROPERTY INTERFACE_COMPILE_OPTIONS $<$<CONFIG:Release>:${PYBIND11_OPT_SIZE}>
+           $<$<CONFIG:MinSizeRel>:${PYBIND11_OPT_SIZE}>
+           $<$<CONFIG:RelWithDebInfo>:${PYBIND11_OPT_SIZE}>)
+
+# ----------------------- Legacy option --------------------------
+
+# Warn or error if old variable name used
+if(PYBIND11_CPP_STANDARD)
+  string(REGEX MATCH [[..$]] VAL "${PYBIND11_CPP_STANDARD}")
+  if(CMAKE_CXX_STANDARD)
+    if(NOT CMAKE_CXX_STANDARD STREQUAL VAL)
+      message(WARNING "CMAKE_CXX_STANDARD=${CMAKE_CXX_STANDARD} does not match "
+                      "PYBIND11_CPP_STANDARD=${PYBIND11_CPP_STANDARD}, "
+                      "please remove PYBIND11_CPP_STANDARD from your cache")
+    endif()
+  else()
+    set(supported_standards 11 14 17 20)
+    if("${VAL}" IN_LIST supported_standards)
+      message(WARNING "USE -DCMAKE_CXX_STANDARD=${VAL} instead of PYBIND11_CPP_STANDARD")
+      set(CMAKE_CXX_STANDARD
+          ${VAL}
+          CACHE STRING "From PYBIND11_CPP_STANDARD")
+    else()
+      message(FATAL_ERROR "PYBIND11_CPP_STANDARD should be replaced with CMAKE_CXX_STANDARD "
+                          "(last two chars: ${VAL} not understood as a valid CXX std)")
+    endif()
+  endif()
+endif()
+
+# --------------------- Python specifics -------------------------
+
+# Check to see which Python mode we are in, new, old, or no python
+if(PYBIND11_NOPYTHON)
+  set(_pybind11_nopython ON)
+elseif(
+  PYBIND11_FINDPYTHON
+  OR Python_FOUND
+  OR Python2_FOUND
+  OR Python3_FOUND)
+  # New mode
+  include("${CMAKE_CURRENT_LIST_DIR}/pybind11NewTools.cmake")
+
+else()
+
+  # Classic mode
+  include("${CMAKE_CURRENT_LIST_DIR}/pybind11Tools.cmake")
+
+endif()
+
+# --------------------- pybind11_find_import -------------------------------
+
+if(NOT _pybind11_nopython)
+  # Check to see if modules are importable. Use REQUIRED to force an error if
+  # one of the modules is not found. <package_name>_FOUND will be set if the
+  # package was found (underscores replace dashes if present). QUIET will hide
+  # the found message, and VERSION will require a minimum version. A successful
+  # find will cache the result.
+  function(pybind11_find_import PYPI_NAME)
+    # CMake variables need underscores (PyPI doesn't care)
+    string(REPLACE "-" "_" NORM_PYPI_NAME "${PYPI_NAME}")
+
+    # Return if found previously
+    if(${NORM_PYPI_NAME}_FOUND)
+      return()
+    endif()
+
+    set(options "REQUIRED;QUIET")
+    set(oneValueArgs "VERSION")
+    cmake_parse_arguments(ARG "${options}" "${oneValueArgs}" "" ${ARGN})
+
+    if(ARG_REQUIRED)
+      set(status_level FATAL_ERROR)
+    else()
+      set(status_level WARNING)
+    endif()
+
+    execute_process(
+      COMMAND
+        ${${_Python}_EXECUTABLE} -c
+        "from pkg_resources import get_distribution; print(get_distribution('${PYPI_NAME}').version)"
+      RESULT_VARIABLE RESULT_PRESENT
+      OUTPUT_VARIABLE PKG_VERSION
+      ERROR_QUIET)
+
+    string(STRIP "${PKG_VERSION}" PKG_VERSION)
+
+    # If a result is present, this failed
+    if(RESULT_PRESENT)
+      set(${NORM_PYPI_NAME}_FOUND
+          ${NORM_PYPI_NAME}-NOTFOUND
+          CACHE INTERNAL "")
+      # Always warn or error
+      message(
+        ${status_level}
+        "Missing: ${PYPI_NAME} ${ARG_VERSION}\nTry: ${${_Python}_EXECUTABLE} -m pip install ${PYPI_NAME}"
+      )
+    else()
+      if(ARG_VERSION AND PKG_VERSION VERSION_LESS ARG_VERSION)
+        message(
+          ${status_level}
+          "Version incorrect: ${PYPI_NAME} ${PKG_VERSION} found, ${ARG_VERSION} required - try upgrading"
+        )
+      else()
+        set(${NORM_PYPI_NAME}_FOUND
+            YES
+            CACHE INTERNAL "")
+        set(${NORM_PYPI_NAME}_VERSION
+            ${PKG_VERSION}
+            CACHE INTERNAL "")
+      endif()
+      if(NOT ARG_QUIET)
+        message(STATUS "Found ${PYPI_NAME} ${PKG_VERSION}")
+      endif()
+    endif()
+    if(NOT ARG_VERSION OR (NOT PKG_VERSION VERSION_LESS ARG_VERSION))
+      # We have successfully found a good version, cache to avoid calling again.
+    endif()
+  endfunction()
+endif()
+
+# --------------------- LTO -------------------------------
+
+include(CheckCXXCompilerFlag)
+
+# Checks whether the given CXX/linker flags can compile and link a cxx file.
+# cxxflags and linkerflags are lists of flags to use.  The result variable is a
+# unique variable name for each set of flags: the compilation result will be
+# cached base on the result variable.  If the flags work, sets them in
+# cxxflags_out/linkerflags_out internal cache variables (in addition to
+# ${result}).
+function(_pybind11_return_if_cxx_and_linker_flags_work result cxxflags linkerflags cxxflags_out
+         linkerflags_out)
+  set(CMAKE_REQUIRED_LIBRARIES ${linkerflags})
+  check_cxx_compiler_flag("${cxxflags}" ${result})
+  if(${result})
+    set(${cxxflags_out}
+        "${cxxflags}"
+        PARENT_SCOPE)
+    set(${linkerflags_out}
+        "${linkerflags}"
+        PARENT_SCOPE)
+  endif()
+endfunction()
+
+function(_pybind11_generate_lto target prefer_thin_lto)
+  if(MINGW)
+    message(STATUS "${target} disabled (problems with undefined symbols for MinGW for now)")
+    return()
+  endif()
+
+  if(CMAKE_CXX_COMPILER_ID MATCHES "GNU|Clang")
+    set(cxx_append "")
+    set(linker_append "")
+    if(CMAKE_CXX_COMPILER_ID MATCHES "Clang" AND NOT APPLE)
+      # Clang Gold plugin does not support -Os; append -O3 to MinSizeRel builds to override it
+      set(linker_append ";$<$<CONFIG:MinSizeRel>:-O3>")
+    elseif(CMAKE_CXX_COMPILER_ID MATCHES "GNU" AND NOT MINGW)
+      set(cxx_append ";-fno-fat-lto-objects")
+    endif()
+
+    if(CMAKE_SYSTEM_PROCESSOR MATCHES "ppc64le" OR CMAKE_SYSTEM_PROCESSOR MATCHES "mips64")
+      set(NO_FLTO_ARCH TRUE)
+    else()
+      set(NO_FLTO_ARCH FALSE)
+    endif()
+
+    if(CMAKE_CXX_COMPILER_ID MATCHES "Clang"
+       AND prefer_thin_lto
+       AND NOT NO_FLTO_ARCH)
+      _pybind11_return_if_cxx_and_linker_flags_work(
+        HAS_FLTO_THIN "-flto=thin${cxx_append}" "-flto=thin${linker_append}"
+        PYBIND11_LTO_CXX_FLAGS PYBIND11_LTO_LINKER_FLAGS)
+    endif()
+
+    if(NOT HAS_FLTO_THIN AND NOT NO_FLTO_ARCH)
+      _pybind11_return_if_cxx_and_linker_flags_work(
+        HAS_FLTO "-flto${cxx_append}" "-flto${linker_append}" PYBIND11_LTO_CXX_FLAGS
+        PYBIND11_LTO_LINKER_FLAGS)
+    endif()
+  elseif(CMAKE_CXX_COMPILER_ID MATCHES "Intel")
+    # Intel equivalent to LTO is called IPO
+    _pybind11_return_if_cxx_and_linker_flags_work(HAS_INTEL_IPO "-ipo" "-ipo"
+                                                  PYBIND11_LTO_CXX_FLAGS PYBIND11_LTO_LINKER_FLAGS)
+  elseif(MSVC)
+    # cmake only interprets libraries as linker flags when they start with a - (otherwise it
+    # converts /LTCG to \LTCG as if it was a Windows path).  Luckily MSVC supports passing flags
+    # with - instead of /, even if it is a bit non-standard:
+    _pybind11_return_if_cxx_and_linker_flags_work(HAS_MSVC_GL_LTCG "/GL" "-LTCG"
+                                                  PYBIND11_LTO_CXX_FLAGS PYBIND11_LTO_LINKER_FLAGS)
+  endif()
+
+  # Enable LTO flags if found, except for Debug builds
+  if(PYBIND11_LTO_CXX_FLAGS)
+    # CONFIG takes multiple values in CMake 3.19+, until then we have to use OR
+    set(is_debug "$<OR:$<CONFIG:Debug>,$<CONFIG:RelWithDebInfo>>")
+    set(not_debug "$<NOT:${is_debug}>")
+    set(cxx_lang "$<COMPILE_LANGUAGE:CXX>")
+    if(MSVC AND CMAKE_VERSION VERSION_LESS 3.11)
+      set(genex "${not_debug}")
+    else()
+      set(genex "$<AND:${not_debug},${cxx_lang}>")
+    endif()
+    set_property(
+      TARGET ${target}
+      APPEND
+      PROPERTY INTERFACE_COMPILE_OPTIONS "$<${genex}:${PYBIND11_LTO_CXX_FLAGS}>")
+    if(CMAKE_PROJECT_NAME STREQUAL "pybind11")
+      message(STATUS "${target} enabled")
+    endif()
+  else()
+    if(CMAKE_PROJECT_NAME STREQUAL "pybind11")
+      message(STATUS "${target} disabled (not supported by the compiler and/or linker)")
+    endif()
+  endif()
+
+  if(PYBIND11_LTO_LINKER_FLAGS)
+    if(CMAKE_VERSION VERSION_LESS 3.11)
+      set_property(
+        TARGET ${target}
+        APPEND
+        PROPERTY INTERFACE_LINK_LIBRARIES "$<${not_debug}:${PYBIND11_LTO_LINKER_FLAGS}>")
+    else()
+      set_property(
+        TARGET ${target}
+        APPEND
+        PROPERTY INTERFACE_LINK_OPTIONS "$<${not_debug}:${PYBIND11_LTO_LINKER_FLAGS}>")
+    endif()
+  endif()
+endfunction()
+
+add_library(pybind11::lto IMPORTED INTERFACE ${optional_global})
+_pybind11_generate_lto(pybind11::lto FALSE)
+
+add_library(pybind11::thin_lto IMPORTED INTERFACE ${optional_global})
+_pybind11_generate_lto(pybind11::thin_lto TRUE)
+
+# ---------------------- pybind11_strip -----------------------------
+
+function(pybind11_strip target_name)
+  # Strip unnecessary sections of the binary on Linux/macOS
+  if(CMAKE_STRIP)
+    if(APPLE)
+      set(x_opt -x)
+    endif()
+
+    add_custom_command(
+      TARGET ${target_name}
+      POST_BUILD
+      COMMAND ${CMAKE_STRIP} ${x_opt} $<TARGET_FILE:${target_name}>)
+  endif()
+endfunction()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11Config.cmake.in b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11Config.cmake.in
new file mode 100644
index 0000000000..9383e8c671
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11Config.cmake.in
@@ -0,0 +1,231 @@
+#[=============================================================================[.rst:
+
+pybind11Config.cmake
+####################
+
+Exported variables
+==================
+
+This module sets the following variables in your project:
+
+``pybind11_FOUND``
+  true if pybind11 and all required components found on the system
+``pybind11_VERSION``
+  pybind11 version in format Major.Minor.Release
+``pybind11_VERSION_TYPE``
+  pybind11 version type (``dev*`` or empty for a release)
+``pybind11_INCLUDE_DIRS``
+  Directories where pybind11 and python headers are located.
+``pybind11_INCLUDE_DIR``
+  Directory where pybind11 headers are located.
+``pybind11_DEFINITIONS``
+  Definitions necessary to use pybind11, namely USING_pybind11.
+``pybind11_LIBRARIES``
+  Compile flags and python libraries (as needed) to link against.
+``pybind11_LIBRARY``
+  Empty.
+
+Available components: None
+
+
+Exported targets
+================
+
+If pybind11 is found, this module defines the following ``IMPORTED``
+interface library targets:
+
+``pybind11::module``
+  for extension modules.
+``pybind11::embed``
+  for embedding the Python interpreter.
+
+Python headers, libraries (as needed by platform), and the C++ standard
+are attached to the target.
+
+Advanced targets are also supplied - these are primary for users building
+complex applications, and they are available in all modes:
+
+``pybind11::headers``
+  Just the pybind11 headers and minimum compile requirements.
+``pybind11::pybind11``
+  Python headers too.
+``pybind11::python_link_helper``
+  Just the "linking" part of ``pybind11:module``, for CMake < 3.15.
+``pybind11::thin_lto``
+  An alternative to ``INTERPROCEDURAL_OPTIMIZATION``.
+``pybind11::lto``
+  An alternative to ``INTERPROCEDURAL_OPTIMIZATION`` (also avoids thin LTO on clang).
+``pybind11::windows_extras``
+  Adds bigobj and mp for MSVC.
+
+Modes
+=====
+
+There are two modes provided; classic, which is built on the old Python
+discovery packages in CMake, or the new FindPython mode, which uses FindPython
+from 3.12+ forward (3.15+ _highly_ recommended).
+
+New FindPython mode
+^^^^^^^^^^^^^^^^^^^
+
+To activate this mode, either call ``find_package(Python COMPONENTS Interpreter Development)``
+before finding this package, or set the ``PYBIND11_FINDPYTHON`` variable to ON. In this mode,
+you can either use the basic targets, or use the FindPython tools:
+
+.. code-block:: cmake
+
+  find_package(Python COMPONENTS Interpreter Development)
+  find_package(pybind11 CONFIG)
+
+  # pybind11 method:
+  pybind11_add_module(MyModule1 src1.cpp)
+
+  # Python method:
+  Python_add_library(MyModule2 src2.cpp)
+  target_link_libraries(MyModule2 pybind11::headers)
+  set_target_properties(MyModule2 PROPERTIES
+                                  INTERPROCEDURAL_OPTIMIZATION ON
+                                  CXX_VISIBILITY_PRESET ON
+                                  VISIBILITY_INLINES_HIDDEN ON)
+
+If you build targets yourself, you may be interested in stripping the output
+for reduced size; this is the one other feature that the helper function gives you.
+
+Classic mode
+^^^^^^^^^^^^
+
+Set PythonLibsNew variables to influence python detection and
+CMAKE_CXX_STANDARD to influence standard setting.
+
+.. code-block:: cmake
+
+  find_package(pybind11 CONFIG REQUIRED)
+
+  # Create an extension module
+  add_library(mylib MODULE main.cpp)
+  target_link_libraries(mylib PUBLIC pybind11::module)
+
+  # Or embed the Python interpreter into an executable
+  add_executable(myexe main.cpp)
+  target_link_libraries(myexe PUBLIC pybind11::embed)
+
+
+Hints
+=====
+
+The following variables can be set to guide the search for this package:
+
+``pybind11_DIR``
+  CMake variable, set to directory containing this Config file.
+``CMAKE_PREFIX_PATH``
+  CMake variable, set to root directory of this package.
+``PATH``
+  Environment variable, set to bin directory of this package.
+``CMAKE_DISABLE_FIND_PACKAGE_pybind11``
+  CMake variable, disables ``find_package(pybind11)`` when not ``REQUIRED``,
+  perhaps to force internal build.
+
+Commands
+========
+
+pybind11_add_module
+^^^^^^^^^^^^^^^^^^^
+
+This module defines the following commands to assist with creating Python modules:
+
+.. code-block:: cmake
+
+  pybind11_add_module(<target>
+    [STATIC|SHARED|MODULE]
+    [THIN_LTO] [OPT_SIZE] [NO_EXTRAS] [WITHOUT_SOABI]
+    <files>...
+    )
+
+Add a module and setup all helpers. You can select the type of the library; the
+default is ``MODULE``. There are several options:
+
+``OPT_SIZE``
+  Optimize for size, even if the ``CMAKE_BUILD_TYPE`` is not ``MinSizeRel``.
+``THIN_LTO``
+  Use thin TLO instead of regular if there's a choice (pybind11's selection
+  is disabled if ``CMAKE_INTERPROCEDURAL_OPTIMIZATIONS`` is set).
+``WITHOUT_SOABI``
+  Disable the SOABI component (``PYBIND11_NEWPYTHON`` mode only).
+``NO_EXTRAS``
+  Disable all extras, exit immediately after making the module.
+
+pybind11_strip
+^^^^^^^^^^^^^^
+
+.. code-block:: cmake
+
+  pybind11_strip(<target>)
+
+Strip a target after building it (linux/macOS), called by ``pybind11_add_module``.
+
+pybind11_extension
+^^^^^^^^^^^^^^^^^^
+
+.. code-block:: cmake
+
+    pybind11_extension(<target>)
+
+Sets the Python extension name correctly for Python on your platform, called by
+``pybind11_add_module``.
+
+pybind11_find_import(module)
+^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+
+.. code-block:: cmake
+
+    pybind11_find_import(<module> [VERSION <number>] [REQUIRED] [QUIET])
+
+See if a module is installed. Use the registered name (the one on PyPI). You
+can specify a ``VERSION``, and you can specify ``REQUIRED`` or ``QUIET``. Only available if
+``NOPYTHON`` mode is not active.  Sets ``module_VERSION`` and ``module_FOUND``. Caches the
+result once a valid install is found.
+
+Suggested usage
+===============
+
+Using ``find_package`` with version info is not recommended except for release versions.
+
+.. code-block:: cmake
+
+  find_package(pybind11 CONFIG)
+  find_package(pybind11 2.9 EXACT CONFIG REQUIRED)
+
+#]=============================================================================]
+@PACKAGE_INIT@
+
+# Location of pybind11/pybind11.h
+# This will be relative unless explicitly set as absolute
+set(pybind11_INCLUDE_DIR "@pybind11_INCLUDEDIR@")
+
+set(pybind11_LIBRARY "")
+set(pybind11_DEFINITIONS USING_pybind11)
+set(pybind11_VERSION_TYPE "@pybind11_VERSION_TYPE@")
+
+check_required_components(pybind11)
+
+if(TARGET pybind11::python_link_helper)
+  # This has already been setup elsewhere, such as with a previous call or
+  # add_subdirectory
+  return()
+endif()
+
+include("${CMAKE_CURRENT_LIST_DIR}/pybind11Targets.cmake")
+
+# Easier to use / remember
+add_library(pybind11::headers IMPORTED INTERFACE)
+set_target_properties(pybind11::headers PROPERTIES INTERFACE_LINK_LIBRARIES
+                                                   pybind11::pybind11_headers)
+
+include("${CMAKE_CURRENT_LIST_DIR}/pybind11Common.cmake")
+
+if(NOT pybind11_FIND_QUIETLY)
+  message(
+    STATUS
+      "Found pybind11: ${pybind11_INCLUDE_DIR} (found version \"${pybind11_VERSION}${pybind11_VERSION_TYPE}\")"
+  )
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11GuessPythonExtSuffix.cmake b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11GuessPythonExtSuffix.cmake
new file mode 100644
index 0000000000..c5fb3b42c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11GuessPythonExtSuffix.cmake
@@ -0,0 +1,86 @@
+cmake_minimum_required(VERSION 3.5)
+
+function(pybind11_guess_python_module_extension python)
+
+  # The SETUPTOOLS_EXT_SUFFIX environment variable takes precedence:
+  if(NOT DEFINED PYTHON_MODULE_EXT_SUFFIX AND DEFINED ENV{SETUPTOOLS_EXT_SUFFIX})
+    message(
+      STATUS
+        "Getting Python extension suffix from ENV{SETUPTOOLS_EXT_SUFFIX}: $ENV{SETUPTOOLS_EXT_SUFFIX}"
+    )
+    set(PYTHON_MODULE_EXT_SUFFIX
+        "$ENV{SETUPTOOLS_EXT_SUFFIX}"
+        CACHE
+          STRING
+          "Extension suffix for Python extension modules (Initialized from SETUPTOOLS_EXT_SUFFIX)")
+  endif()
+  # If that didn't work, use the Python_SOABI variable:
+  if(NOT DEFINED PYTHON_MODULE_EXT_SUFFIX AND DEFINED ${python}_SOABI)
+    message(
+      STATUS "Determining Python extension suffix based on ${python}_SOABI: ${${python}_SOABI}")
+    # The final extension depends on the system
+    set(_PY_BUILD_EXTENSION "${CMAKE_SHARED_MODULE_SUFFIX}")
+    if(CMAKE_SYSTEM_NAME STREQUAL "Windows")
+      set(_PY_BUILD_EXTENSION ".pyd")
+    endif()
+    # If the SOABI already has an extension, use it as the full suffix
+    # (used for debug versions of Python on Windows)
+    if(${python}_SOABI MATCHES "\\.")
+      set(PYTHON_MODULE_EXT_SUFFIX "${${python}_SOABI}")
+      # If the SOABI is empty, this is usually a bug, but we generate a
+      # correct extension anyway, which is the best we can do
+    elseif("${${python}_SOABI}" STREQUAL "")
+      message(
+        WARNING
+          "${python}_SOABI is defined but empty. You may want to set PYTHON_MODULE_EXT_SUFFIX explicitly."
+      )
+      set(PYTHON_MODULE_EXT_SUFFIX "${_PY_BUILD_EXTENSION}")
+      # Otherwise, add the system-dependent extension to it
+    else()
+      set(PYTHON_MODULE_EXT_SUFFIX ".${${python}_SOABI}${_PY_BUILD_EXTENSION}")
+    endif()
+  endif()
+
+  # If we could not deduce the extension suffix, unset the results:
+  if(NOT DEFINED PYTHON_MODULE_EXT_SUFFIX)
+    unset(PYTHON_MODULE_DEBUG_POSTFIX PARENT_SCOPE)
+    unset(PYTHON_MODULE_EXTENSION PARENT_SCOPE)
+    unset(PYTHON_IS_DEBUG PARENT_SCOPE)
+    return()
+  endif()
+
+  # Sanity checks:
+  if(${python}_SOABI AND NOT (PYTHON_MODULE_EXT_SUFFIX STREQUAL ${python}_SOABI
+                              OR PYTHON_MODULE_EXT_SUFFIX MATCHES "\\.${${python}_SOABI}\\."))
+    message(
+      WARNING
+        "Python extension suffix (${PYTHON_MODULE_EXT_SUFFIX}) does not match ${python}_SOABI (${${python}_SOABI})."
+    )
+  endif()
+
+  # Separate file name postfix from extension: (https://github.com/pybind/pybind11/issues/4699)
+  get_filename_component(_PYTHON_MODULE_DEBUG_POSTFIX "${PYTHON_MODULE_EXT_SUFFIX}" NAME_WE)
+  get_filename_component(_PYTHON_MODULE_EXTENSION "${PYTHON_MODULE_EXT_SUFFIX}" EXT)
+
+  # Try to deduce the debug ABI from the extension suffix:
+  if(NOT DEFINED _PYTHON_IS_DEBUG)
+    if(_PYTHON_MODULE_EXTENSION MATCHES "^\\.(cpython-|cp|pypy)[0-9]+dm?-"
+       OR _PYTHON_MODULE_DEBUG_POSTFIX MATCHES "^_d")
+      set(_PYTHON_IS_DEBUG On)
+    else()
+      set(_PYTHON_IS_DEBUG Off)
+    endif()
+  endif()
+
+  # Return results
+  set(PYTHON_MODULE_DEBUG_POSTFIX
+      "${_PYTHON_MODULE_DEBUG_POSTFIX}"
+      PARENT_SCOPE)
+  set(PYTHON_MODULE_EXTENSION
+      "${_PYTHON_MODULE_EXTENSION}"
+      PARENT_SCOPE)
+  set(PYTHON_IS_DEBUG
+      "${_PYTHON_IS_DEBUG}"
+      PARENT_SCOPE)
+
+endfunction()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11NewTools.cmake b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11NewTools.cmake
new file mode 100644
index 0000000000..5a6a0cb8be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11NewTools.cmake
@@ -0,0 +1,256 @@
+# tools/pybind11NewTools.cmake -- Build system for the pybind11 modules
+#
+# Copyright (c) 2020 Wenzel Jakob <wenzel@inf.ethz.ch> and Henry Schreiner
+#
+# All rights reserved. Use of this source code is governed by a
+# BSD-style license that can be found in the LICENSE file.
+
+if(CMAKE_VERSION VERSION_LESS 3.12)
+  message(FATAL_ERROR "You cannot use the new FindPython module with CMake < 3.12")
+endif()
+
+include_guard(GLOBAL)
+
+get_property(
+  is_config
+  TARGET pybind11::headers
+  PROPERTY IMPORTED)
+
+if(pybind11_FIND_QUIETLY)
+  set(_pybind11_quiet QUIET)
+else()
+  set(_pybind11_quiet "")
+endif()
+
+if(NOT Python_FOUND AND NOT Python3_FOUND)
+  if(NOT DEFINED Python_FIND_IMPLEMENTATIONS)
+    set(Python_FIND_IMPLEMENTATIONS CPython PyPy)
+  endif()
+
+  # GitHub Actions like activation
+  if(NOT DEFINED Python_ROOT_DIR AND DEFINED ENV{pythonLocation})
+    set(Python_ROOT_DIR "$ENV{pythonLocation}")
+  endif()
+
+  find_package(Python 3.6 REQUIRED COMPONENTS Interpreter Development ${_pybind11_quiet})
+
+  # If we are in submodule mode, export the Python targets to global targets.
+  # If this behavior is not desired, FindPython _before_ pybind11.
+  if(NOT is_config)
+    set_property(TARGET Python::Python PROPERTY IMPORTED_GLOBAL TRUE)
+    set_property(TARGET Python::Interpreter PROPERTY IMPORTED_GLOBAL TRUE)
+    if(TARGET Python::Module)
+      set_property(TARGET Python::Module PROPERTY IMPORTED_GLOBAL TRUE)
+    endif()
+  endif()
+endif()
+
+if(Python_FOUND)
+  set(_Python
+      Python
+      CACHE INTERNAL "" FORCE)
+elseif(Python3_FOUND)
+  set(_Python
+      Python3
+      CACHE INTERNAL "" FORCE)
+endif()
+
+if(PYBIND11_MASTER_PROJECT)
+  if(${_Python}_INTERPRETER_ID MATCHES "PyPy")
+    message(STATUS "PyPy ${${_Python}_PyPy_VERSION} (Py ${${_Python}_VERSION})")
+  else()
+    message(STATUS "${_Python} ${${_Python}_VERSION}")
+  endif()
+endif()
+
+# If a user finds Python, they may forget to include the Interpreter component
+# and the following two steps require it. It is highly recommended by CMake
+# when finding development libraries anyway, so we will require it.
+if(NOT DEFINED ${_Python}_EXECUTABLE)
+  message(
+    FATAL_ERROR
+      "${_Python} was found without the Interpreter component. Pybind11 requires this component.")
+
+endif()
+
+if(NOT ${_Python}_EXECUTABLE STREQUAL PYBIND11_PYTHON_EXECUTABLE_LAST)
+  # Detect changes to the Python version/binary in subsequent CMake runs, and refresh config if needed
+  unset(PYTHON_IS_DEBUG CACHE)
+  unset(PYTHON_MODULE_EXTENSION CACHE)
+  set(PYBIND11_PYTHON_EXECUTABLE_LAST
+      "${${_Python}_EXECUTABLE}"
+      CACHE INTERNAL "Python executable during the last CMake run")
+endif()
+
+if(NOT DEFINED PYTHON_IS_DEBUG)
+  # Debug check - see https://stackoverflow.com/questions/646518/python-how-to-detect-debug-Interpreter
+  execute_process(
+    COMMAND "${${_Python}_EXECUTABLE}" "-c"
+            "import sys; sys.exit(hasattr(sys, 'gettotalrefcount'))"
+    RESULT_VARIABLE _PYTHON_IS_DEBUG)
+  set(PYTHON_IS_DEBUG
+      "${_PYTHON_IS_DEBUG}"
+      CACHE INTERNAL "Python debug status")
+endif()
+
+# Get the suffix - SO is deprecated, should use EXT_SUFFIX, but this is
+# required for PyPy3 (as of 7.3.1)
+if(NOT DEFINED PYTHON_MODULE_EXTENSION)
+  execute_process(
+    COMMAND
+      "${${_Python}_EXECUTABLE}" "-c"
+      "import sys, importlib; s = importlib.import_module('distutils.sysconfig' if sys.version_info < (3, 10) else 'sysconfig'); print(s.get_config_var('EXT_SUFFIX') or s.get_config_var('SO'))"
+    OUTPUT_VARIABLE _PYTHON_MODULE_EXTENSION
+    ERROR_VARIABLE _PYTHON_MODULE_EXTENSION_ERR
+    OUTPUT_STRIP_TRAILING_WHITESPACE)
+
+  if(_PYTHON_MODULE_EXTENSION STREQUAL "")
+    message(
+      FATAL_ERROR "pybind11 could not query the module file extension, likely the 'distutils'"
+                  "package is not installed. Full error message:\n${_PYTHON_MODULE_EXTENSION_ERR}")
+  endif()
+
+  # This needs to be available for the pybind11_extension function
+  set(PYTHON_MODULE_EXTENSION
+      "${_PYTHON_MODULE_EXTENSION}"
+      CACHE INTERNAL "")
+endif()
+
+# Python debug libraries expose slightly different objects before 3.8
+# https://docs.python.org/3.6/c-api/intro.html#debugging-builds
+# https://stackoverflow.com/questions/39161202/how-to-work-around-missing-pymodule-create2-in-amd64-win-python35-d-lib
+if(PYTHON_IS_DEBUG)
+  set_property(
+    TARGET pybind11::pybind11
+    APPEND
+    PROPERTY INTERFACE_COMPILE_DEFINITIONS Py_DEBUG)
+endif()
+
+# Check on every access - since Python can change - do nothing in that case.
+
+if(DEFINED ${_Python}_INCLUDE_DIRS)
+  # Only add Python for build - must be added during the import for config
+  # since it has to be re-discovered.
+  #
+  # This needs to be a target to be included after the local pybind11
+  # directory, just in case there there is an installed pybind11 sitting
+  # next to Python's includes. It also ensures Python is a SYSTEM library.
+  add_library(pybind11::python_headers INTERFACE IMPORTED)
+  set_property(
+    TARGET pybind11::python_headers PROPERTY INTERFACE_INCLUDE_DIRECTORIES
+                                             "$<BUILD_INTERFACE:${${_Python}_INCLUDE_DIRS}>")
+  set_property(
+    TARGET pybind11::pybind11
+    APPEND
+    PROPERTY INTERFACE_LINK_LIBRARIES pybind11::python_headers)
+  set(pybind11_INCLUDE_DIRS
+      "${pybind11_INCLUDE_DIR}" "${${_Python}_INCLUDE_DIRS}"
+      CACHE INTERNAL "Directories where pybind11 and possibly Python headers are located")
+endif()
+
+# In CMake 3.18+, you can find these separately, so include an if
+if(TARGET ${_Python}::Python)
+  set_property(
+    TARGET pybind11::embed
+    APPEND
+    PROPERTY INTERFACE_LINK_LIBRARIES ${_Python}::Python)
+endif()
+
+# CMake 3.15+ has this
+if(TARGET ${_Python}::Module)
+  set_property(
+    TARGET pybind11::module
+    APPEND
+    PROPERTY INTERFACE_LINK_LIBRARIES ${_Python}::Module)
+else()
+  set_property(
+    TARGET pybind11::module
+    APPEND
+    PROPERTY INTERFACE_LINK_LIBRARIES pybind11::python_link_helper)
+endif()
+
+# WITHOUT_SOABI and WITH_SOABI will disable the custom extension handling used by pybind11.
+# WITH_SOABI is passed on to python_add_library.
+function(pybind11_add_module target_name)
+  cmake_parse_arguments(PARSE_ARGV 1 ARG
+                        "STATIC;SHARED;MODULE;THIN_LTO;OPT_SIZE;NO_EXTRAS;WITHOUT_SOABI" "" "")
+
+  if(ARG_STATIC)
+    set(lib_type STATIC)
+  elseif(ARG_SHARED)
+    set(lib_type SHARED)
+  else()
+    set(lib_type MODULE)
+  endif()
+
+  if("${_Python}" STREQUAL "Python")
+    python_add_library(${target_name} ${lib_type} ${ARG_UNPARSED_ARGUMENTS})
+  elseif("${_Python}" STREQUAL "Python3")
+    python3_add_library(${target_name} ${lib_type} ${ARG_UNPARSED_ARGUMENTS})
+  else()
+    message(FATAL_ERROR "Cannot detect FindPython version: ${_Python}")
+  endif()
+
+  target_link_libraries(${target_name} PRIVATE pybind11::headers)
+
+  if(lib_type STREQUAL "MODULE")
+    target_link_libraries(${target_name} PRIVATE pybind11::module)
+  else()
+    target_link_libraries(${target_name} PRIVATE pybind11::embed)
+  endif()
+
+  if(MSVC)
+    target_link_libraries(${target_name} PRIVATE pybind11::windows_extras)
+  endif()
+
+  # -fvisibility=hidden is required to allow multiple modules compiled against
+  # different pybind versions to work properly, and for some features (e.g.
+  # py::module_local).  We force it on everything inside the `pybind11`
+  # namespace; also turning it on for a pybind module compilation here avoids
+  # potential warnings or issues from having mixed hidden/non-hidden types.
+  if(NOT DEFINED CMAKE_CXX_VISIBILITY_PRESET)
+    set_target_properties(${target_name} PROPERTIES CXX_VISIBILITY_PRESET "hidden")
+  endif()
+
+  if(NOT DEFINED CMAKE_CUDA_VISIBILITY_PRESET)
+    set_target_properties(${target_name} PROPERTIES CUDA_VISIBILITY_PRESET "hidden")
+  endif()
+
+  # If we don't pass a WITH_SOABI or WITHOUT_SOABI, use our own default handling of extensions
+  if(NOT ARG_WITHOUT_SOABI AND NOT "WITH_SOABI" IN_LIST ARG_UNPARSED_ARGUMENTS)
+    pybind11_extension(${target_name})
+  endif()
+
+  if(ARG_NO_EXTRAS)
+    return()
+  endif()
+
+  if(NOT DEFINED CMAKE_INTERPROCEDURAL_OPTIMIZATION)
+    if(ARG_THIN_LTO)
+      target_link_libraries(${target_name} PRIVATE pybind11::thin_lto)
+    else()
+      target_link_libraries(${target_name} PRIVATE pybind11::lto)
+    endif()
+  endif()
+
+  # Use case-insensitive comparison to match the result of $<CONFIG:cfgs>
+  string(TOUPPER "${CMAKE_BUILD_TYPE}" uppercase_CMAKE_BUILD_TYPE)
+  if(NOT MSVC AND NOT "${uppercase_CMAKE_BUILD_TYPE}" MATCHES DEBUG|RELWITHDEBINFO)
+    # Strip unnecessary sections of the binary on Linux/macOS
+    pybind11_strip(${target_name})
+  endif()
+
+  if(MSVC)
+    target_link_libraries(${target_name} PRIVATE pybind11::windows_extras)
+  endif()
+
+  if(ARG_OPT_SIZE)
+    target_link_libraries(${target_name} PRIVATE pybind11::opt_size)
+  endif()
+endfunction()
+
+function(pybind11_extension name)
+  # The extension is precomputed
+  set_target_properties(${name} PROPERTIES PREFIX "" SUFFIX "${PYTHON_MODULE_EXTENSION}")
+
+endfunction()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11Tools.cmake b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11Tools.cmake
new file mode 100644
index 0000000000..66ad00a478
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pybind11Tools.cmake
@@ -0,0 +1,233 @@
+# tools/pybind11Tools.cmake -- Build system for the pybind11 modules
+#
+# Copyright (c) 2020 Wenzel Jakob <wenzel.jakob@epfl.ch>
+#
+# All rights reserved. Use of this source code is governed by a
+# BSD-style license that can be found in the LICENSE file.
+
+# include_guard(global) (pre-CMake 3.10)
+if(TARGET pybind11::python_headers)
+  return()
+endif()
+
+# Built-in in CMake 3.5+
+include(CMakeParseArguments)
+
+if(pybind11_FIND_QUIETLY)
+  set(_pybind11_quiet QUIET)
+else()
+  set(_pybind11_quiet "")
+endif()
+
+# If this is the first run, PYTHON_VERSION can stand in for PYBIND11_PYTHON_VERSION
+if(NOT DEFINED PYBIND11_PYTHON_VERSION AND DEFINED PYTHON_VERSION)
+  message(WARNING "Set PYBIND11_PYTHON_VERSION to search for a specific version, not "
+                  "PYTHON_VERSION (which is an output). Assuming that is what you "
+                  "meant to do and continuing anyway.")
+  set(PYBIND11_PYTHON_VERSION
+      "${PYTHON_VERSION}"
+      CACHE STRING "Python version to use for compiling modules")
+  unset(PYTHON_VERSION)
+  unset(PYTHON_VERSION CACHE)
+elseif(DEFINED PYBIND11_PYTHON_VERSION)
+  # If this is set as a normal variable, promote it
+  set(PYBIND11_PYTHON_VERSION
+      "${PYBIND11_PYTHON_VERSION}"
+      CACHE STRING "Python version to use for compiling modules")
+else()
+  # Make an empty cache variable.
+  set(PYBIND11_PYTHON_VERSION
+      ""
+      CACHE STRING "Python version to use for compiling modules")
+endif()
+
+# A user can set versions manually too
+set(Python_ADDITIONAL_VERSIONS
+    "3.11;3.10;3.9;3.8;3.7;3.6"
+    CACHE INTERNAL "")
+
+list(APPEND CMAKE_MODULE_PATH "${CMAKE_CURRENT_LIST_DIR}")
+find_package(PythonLibsNew ${PYBIND11_PYTHON_VERSION} MODULE REQUIRED ${_pybind11_quiet})
+list(REMOVE_AT CMAKE_MODULE_PATH -1)
+
+# Makes a normal variable a cached variable
+macro(_PYBIND11_PROMOTE_TO_CACHE NAME)
+  set(_tmp_ptc "${${NAME}}")
+  # CMake 3.21 complains if a cached variable is shadowed by a normal one
+  unset(${NAME})
+  set(${NAME}
+      "${_tmp_ptc}"
+      CACHE INTERNAL "")
+endmacro()
+
+# Cache variables so pybind11_add_module can be used in parent projects
+_pybind11_promote_to_cache(PYTHON_INCLUDE_DIRS)
+_pybind11_promote_to_cache(PYTHON_LIBRARIES)
+_pybind11_promote_to_cache(PYTHON_MODULE_PREFIX)
+_pybind11_promote_to_cache(PYTHON_MODULE_EXTENSION)
+_pybind11_promote_to_cache(PYTHON_VERSION_MAJOR)
+_pybind11_promote_to_cache(PYTHON_VERSION_MINOR)
+_pybind11_promote_to_cache(PYTHON_VERSION)
+_pybind11_promote_to_cache(PYTHON_IS_DEBUG)
+
+if(PYBIND11_MASTER_PROJECT)
+  if(PYTHON_MODULE_EXTENSION MATCHES "pypy")
+    if(NOT DEFINED PYPY_VERSION)
+      execute_process(
+        COMMAND ${PYTHON_EXECUTABLE} -c
+                [=[import sys; sys.stdout.write(".".join(map(str, sys.pypy_version_info[:3])))]=]
+        OUTPUT_VARIABLE pypy_version)
+      set(PYPY_VERSION
+          ${pypy_version}
+          CACHE INTERNAL "")
+    endif()
+    message(STATUS "PYPY ${PYPY_VERSION} (Py ${PYTHON_VERSION})")
+  else()
+    message(STATUS "PYTHON ${PYTHON_VERSION}")
+  endif()
+endif()
+
+# Only add Python for build - must be added during the import for config since
+# it has to be re-discovered.
+#
+# This needs to be an target to it is included after the local pybind11
+# directory, just in case there are multiple versions of pybind11, we want the
+# one we expect.
+add_library(pybind11::python_headers INTERFACE IMPORTED)
+set_property(TARGET pybind11::python_headers PROPERTY INTERFACE_INCLUDE_DIRECTORIES
+                                                      "$<BUILD_INTERFACE:${PYTHON_INCLUDE_DIRS}>")
+set_property(
+  TARGET pybind11::pybind11
+  APPEND
+  PROPERTY INTERFACE_LINK_LIBRARIES pybind11::python_headers)
+
+set(pybind11_INCLUDE_DIRS
+    "${pybind11_INCLUDE_DIR}" "${PYTHON_INCLUDE_DIRS}"
+    CACHE INTERNAL "Directories where pybind11 and possibly Python headers are located")
+
+# Python debug libraries expose slightly different objects before 3.8
+# https://docs.python.org/3.6/c-api/intro.html#debugging-builds
+# https://stackoverflow.com/questions/39161202/how-to-work-around-missing-pymodule-create2-in-amd64-win-python35-d-lib
+if(PYTHON_IS_DEBUG)
+  set_property(
+    TARGET pybind11::pybind11
+    APPEND
+    PROPERTY INTERFACE_COMPILE_DEFINITIONS Py_DEBUG)
+endif()
+
+# The <3.11 code here does not support release/debug builds at the same time, like on vcpkg
+if(CMAKE_VERSION VERSION_LESS 3.11)
+  set_property(
+    TARGET pybind11::module
+    APPEND
+    PROPERTY
+      INTERFACE_LINK_LIBRARIES
+      pybind11::python_link_helper
+      "$<$<OR:$<PLATFORM_ID:Windows>,$<PLATFORM_ID:Cygwin>>:$<BUILD_INTERFACE:${PYTHON_LIBRARIES}>>"
+  )
+
+  set_property(
+    TARGET pybind11::embed
+    APPEND
+    PROPERTY INTERFACE_LINK_LIBRARIES pybind11::pybind11 $<BUILD_INTERFACE:${PYTHON_LIBRARIES}>)
+else()
+  # The IMPORTED INTERFACE library here is to ensure that "debug" and "release" get processed outside
+  # of a generator expression - https://gitlab.kitware.com/cmake/cmake/-/issues/18424, as they are
+  # target_link_library keywords rather than real libraries.
+  add_library(pybind11::_ClassicPythonLibraries IMPORTED INTERFACE)
+  target_link_libraries(pybind11::_ClassicPythonLibraries INTERFACE ${PYTHON_LIBRARIES})
+  target_link_libraries(
+    pybind11::module
+    INTERFACE
+      pybind11::python_link_helper
+      "$<$<OR:$<PLATFORM_ID:Windows>,$<PLATFORM_ID:Cygwin>>:pybind11::_ClassicPythonLibraries>")
+
+  target_link_libraries(pybind11::embed INTERFACE pybind11::pybind11
+                                                  pybind11::_ClassicPythonLibraries)
+endif()
+
+function(pybind11_extension name)
+  # The prefix and extension are provided by FindPythonLibsNew.cmake
+  set_target_properties(${name} PROPERTIES PREFIX "${PYTHON_MODULE_PREFIX}"
+                                           SUFFIX "${PYTHON_MODULE_EXTENSION}")
+endfunction()
+
+# Build a Python extension module:
+# pybind11_add_module(<name> [MODULE | SHARED] [EXCLUDE_FROM_ALL]
+#                     [NO_EXTRAS] [THIN_LTO] [OPT_SIZE] source1 [source2 ...])
+#
+function(pybind11_add_module target_name)
+  set(options "MODULE;SHARED;EXCLUDE_FROM_ALL;NO_EXTRAS;SYSTEM;THIN_LTO;OPT_SIZE")
+  cmake_parse_arguments(ARG "${options}" "" "" ${ARGN})
+
+  if(ARG_MODULE AND ARG_SHARED)
+    message(FATAL_ERROR "Can't be both MODULE and SHARED")
+  elseif(ARG_SHARED)
+    set(lib_type SHARED)
+  else()
+    set(lib_type MODULE)
+  endif()
+
+  if(ARG_EXCLUDE_FROM_ALL)
+    set(exclude_from_all EXCLUDE_FROM_ALL)
+  else()
+    set(exclude_from_all "")
+  endif()
+
+  add_library(${target_name} ${lib_type} ${exclude_from_all} ${ARG_UNPARSED_ARGUMENTS})
+
+  target_link_libraries(${target_name} PRIVATE pybind11::module)
+
+  if(ARG_SYSTEM)
+    message(
+      STATUS
+        "Warning: this does not have an effect - use NO_SYSTEM_FROM_IMPORTED if using imported targets"
+    )
+  endif()
+
+  pybind11_extension(${target_name})
+
+  # -fvisibility=hidden is required to allow multiple modules compiled against
+  # different pybind versions to work properly, and for some features (e.g.
+  # py::module_local).  We force it on everything inside the `pybind11`
+  # namespace; also turning it on for a pybind module compilation here avoids
+  # potential warnings or issues from having mixed hidden/non-hidden types.
+  if(NOT DEFINED CMAKE_CXX_VISIBILITY_PRESET)
+    set_target_properties(${target_name} PROPERTIES CXX_VISIBILITY_PRESET "hidden")
+  endif()
+
+  if(NOT DEFINED CMAKE_CUDA_VISIBILITY_PRESET)
+    set_target_properties(${target_name} PROPERTIES CUDA_VISIBILITY_PRESET "hidden")
+  endif()
+
+  if(ARG_NO_EXTRAS)
+    return()
+  endif()
+
+  if(NOT DEFINED CMAKE_INTERPROCEDURAL_OPTIMIZATION)
+    if(ARG_THIN_LTO)
+      target_link_libraries(${target_name} PRIVATE pybind11::thin_lto)
+    else()
+      target_link_libraries(${target_name} PRIVATE pybind11::lto)
+    endif()
+  endif()
+
+  # Use case-insensitive comparison to match the result of $<CONFIG:cfgs>
+  string(TOUPPER "${CMAKE_BUILD_TYPE}" uppercase_CMAKE_BUILD_TYPE)
+  if(NOT MSVC AND NOT "${uppercase_CMAKE_BUILD_TYPE}" MATCHES DEBUG|RELWITHDEBINFO)
+    pybind11_strip(${target_name})
+  endif()
+
+  if(MSVC)
+    target_link_libraries(${target_name} PRIVATE pybind11::windows_extras)
+  endif()
+
+  if(ARG_OPT_SIZE)
+    target_link_libraries(${target_name} PRIVATE pybind11::opt_size)
+  endif()
+endfunction()
+
+# Provide general way to call common Python commands in "common" file.
+set(_Python
+    PYTHON
+    CACHE INTERNAL "" FORCE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pyproject.toml b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pyproject.toml
new file mode 100644
index 0000000000..8fe2f47af9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/pyproject.toml
@@ -0,0 +1,3 @@
+[build-system]
+requires = ["setuptools>=42", "wheel"]
+build-backend = "setuptools.build_meta"
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/setup_global.py.in b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/setup_global.py.in
new file mode 100644
index 0000000000..885ac5c725
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/setup_global.py.in
@@ -0,0 +1,63 @@
+#!/usr/bin/env python3
+
+# Setup script for pybind11-global (in the sdist or in tools/setup_global.py in the repository)
+# This package is targeted for easy use from CMake.
+
+import glob
+import os
+import re
+
+# Setuptools has to be before distutils
+from setuptools import setup
+
+from distutils.command.install_headers import install_headers
+
+class InstallHeadersNested(install_headers):
+    def run(self):
+        headers = self.distribution.headers or []
+        for header in headers:
+            # Remove pybind11/include/
+            short_header = header.split("/", 2)[-1]
+
+            dst = os.path.join(self.install_dir, os.path.dirname(short_header))
+            self.mkpath(dst)
+            (out, _) = self.copy_file(header, dst)
+            self.outfiles.append(out)
+
+
+main_headers = glob.glob("pybind11/include/pybind11/*.h")
+detail_headers = glob.glob("pybind11/include/pybind11/detail/*.h")
+eigen_headers = glob.glob("pybind11/include/pybind11/eigen/*.h")
+stl_headers = glob.glob("pybind11/include/pybind11/stl/*.h")
+cmake_files = glob.glob("pybind11/share/cmake/pybind11/*.cmake")
+pkgconfig_files = glob.glob("pybind11/share/pkgconfig/*.pc")
+headers = main_headers + detail_headers + stl_headers + eigen_headers
+
+cmdclass = {"install_headers": InstallHeadersNested}
+$extra_cmd
+
+# This will _not_ affect installing from wheels,
+# only building wheels or installing from SDist.
+# Primarily intended on Windows, where this is sometimes
+# customized (for example, conda-forge uses Library/)
+base = os.environ.get("PYBIND11_GLOBAL_PREFIX", "")
+
+# Must have a separator
+if base and not base.endswith("/"):
+    base += "/"
+
+setup(
+    name="pybind11_global",
+    version="$version",
+    packages=[],
+    headers=headers,
+    data_files=[
+        (base + "share/cmake/pybind11", cmake_files),
+        (base + "share/pkgconfig", pkgconfig_files),
+        (base + "include/pybind11", main_headers),
+        (base + "include/pybind11/detail", detail_headers),
+        (base + "include/pybind11/eigen", eigen_headers),
+        (base + "include/pybind11/stl", stl_headers),
+    ],
+    cmdclass=cmdclass,
+)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/setup_main.py.in b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/setup_main.py.in
new file mode 100644
index 0000000000..6358cc7b9b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/setup_main.py.in
@@ -0,0 +1,44 @@
+#!/usr/bin/env python3
+
+# Setup script (in the sdist or in tools/setup_main.py in the repository)
+
+from setuptools import setup
+
+cmdclass = {}
+$extra_cmd
+
+setup(
+    name="pybind11",
+    version="$version",
+    download_url='https://github.com/pybind/pybind11/tarball/v$version',
+    packages=[
+        "pybind11",
+        "pybind11.include.pybind11",
+        "pybind11.include.pybind11.detail",
+        "pybind11.include.pybind11.eigen",
+        "pybind11.include.pybind11.stl",
+        "pybind11.share.cmake.pybind11",
+        "pybind11.share.pkgconfig",
+    ],
+    package_data={
+        "pybind11": ["py.typed"],
+        "pybind11.include.pybind11": ["*.h"],
+        "pybind11.include.pybind11.detail": ["*.h"],
+        "pybind11.include.pybind11.eigen": ["*.h"],
+        "pybind11.include.pybind11.stl": ["*.h"],
+        "pybind11.share.cmake.pybind11": ["*.cmake"],
+        "pybind11.share.pkgconfig": ["*.pc"],
+    },
+    extras_require={
+        "global": ["pybind11_global==$version"]
+        },
+    entry_points={
+        "console_scripts": [
+             "pybind11-config = pybind11.__main__:main",
+        ],
+        "pipx.run": [
+             "pybind11 = pybind11.__main__:main",
+        ]
+    },
+    cmdclass=cmdclass
+)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/test-pybind11GuessPythonExtSuffix.cmake b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/test-pybind11GuessPythonExtSuffix.cmake
new file mode 100644
index 0000000000..0de2c0169b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pybind11/tools/test-pybind11GuessPythonExtSuffix.cmake
@@ -0,0 +1,161 @@
+cmake_minimum_required(VERSION 3.5)
+
+# Tests for pybind11_guess_python_module_extension
+# Run using `cmake -P tools/test-pybind11GuessPythonExtSuffix.cmake`
+
+include("${CMAKE_CURRENT_LIST_DIR}/pybind11GuessPythonExtSuffix.cmake")
+
+macro(expect_streq actual expected)
+  if(NOT "${actual}" STREQUAL "${expected}")
+    message(SEND_ERROR "Fail\n *** actual:   '${actual}'\n *** expected: '${expected}'")
+  endif()
+endmacro()
+
+macro(expect_false actual)
+  if("${actual}")
+    message(SEND_ERROR "Fail\n *** actual:   '${actual}'\n *** expected: false")
+  endif()
+endmacro()
+
+macro(expect_true actual)
+  if(NOT "${actual}")
+    message(SEND_ERROR "Fail\n *** actual:   '${actual}'\n *** expected: true")
+  endif()
+endmacro()
+
+# Windows
+set(CMAKE_SYSTEM_NAME "Windows")
+set(CMAKE_SHARED_MODULE_SUFFIX ".dll")
+
+set(Python3_SOABI "")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".pyd")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "cp311-win_arm64")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".cp311-win_arm64.pyd")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "cp311d-win_arm64")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".cp311d-win_arm64.pyd")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_true("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "pypy310-pp73-win_amd64")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".pypy310-pp73-win_amd64.pyd")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "_d.cp311-win_amd64.pyd") # This is a quirk of FindPython3
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".cp311-win_amd64.pyd")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "_d")
+expect_true("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+unset(Python3_SOABI)
+set(ENV{SETUPTOOLS_EXT_SUFFIX} ".cp39-win_arm64.pyd") # Set by cibuildwheel
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".cp39-win_arm64.pyd")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+unset(ENV{SETUPTOOLS_EXT_SUFFIX})
+
+set(Python3_SOABI "cp311-win_arm64")
+set(ENV{SETUPTOOLS_EXT_SUFFIX} "") # Should not be used
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".cp311-win_arm64.pyd")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+unset(ENV{SETUPTOOLS_EXT_SUFFIX})
+
+# macOS
+set(CMAKE_SYSTEM_NAME "Darwin")
+set(CMAKE_SHARED_MODULE_SUFFIX ".so")
+
+set(Python3_SOABI "")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".so")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "cpython-312-darwin")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".cpython-312-darwin.so")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "cpython-312d-darwin")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".cpython-312d-darwin.so")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_true("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+# Linux
+set(CMAKE_SYSTEM_NAME "Linux")
+set(CMAKE_SHARED_MODULE_SUFFIX ".so")
+
+set(Python3_SOABI "")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".so")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "cpython-312-arm-linux-gnueabihf")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".cpython-312-arm-linux-gnueabihf.so")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "cpython-312d-arm-linux-gnueabihf")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".cpython-312d-arm-linux-gnueabihf.so")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_true("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "pypy310-pp73-x86_64-linux-gnu")
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".pypy310-pp73-x86_64-linux-gnu.so")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_false("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
+
+set(Python3_SOABI "pypy310d-pp73-x86_64-linux-gnu")
+# TODO: I'm not sure if this is the right SOABI for PyPy debug builds
+pybind11_guess_python_module_extension("Python3")
+expect_streq("${PYTHON_MODULE_EXTENSION}" ".pypy310d-pp73-x86_64-linux-gnu.so")
+expect_streq("${PYTHON_MODULE_DEBUG_POSTFIX}" "")
+expect_true("${PYTHON_IS_DEBUG}")
+unset(PYTHON_MODULE_EXT_SUFFIX)
+unset(PYTHON_MODULE_EXT_SUFFIX CACHE)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/pyparse/pyparse.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pyparse/pyparse.h
new file mode 100644
index 0000000000..8dcfe26a5a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/pyparse/pyparse.h
@@ -0,0 +1,156 @@
+/*
+   Utility functions for parsing Python data structures
+   From: https://github.com/llohse/libnpy/blob/master/include/npy.hpp
+   Copyright 2017 Leon Merten Lohse
+   Permission is hereby granted, free of charge, to any person obtaining a copy
+   of this software and associated documentation files (the "Software"), to deal
+   in the Software without restriction, including without limitation the rights
+   to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+   copies of the Software, and to permit persons to whom the Software is
+   furnished to do so, subject to the following conditions:
+   The above copyright notice and this permission notice shall be included in
+   all copies or substantial portions of the Software.
+   THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+   IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+   FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+   AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+   LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+   OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+   SOFTWARE.
+*/
+#pragma once
+
+#include <algorithm>
+#include <memory>
+#include <sstream>
+#include <string>
+#include <unordered_map>
+#include <vector>
+
+namespace pyparse {
+/**
+  Removes leading and trailing whitespaces
+  */
+inline std::string trim(const std::string& str) {
+    const std::string whitespace = " \t";
+    auto begin = str.find_first_not_of(whitespace);
+
+    if (begin == std::string::npos)
+        return "";
+
+    auto end = str.find_last_not_of(whitespace);
+
+    return str.substr(begin, end - begin + 1);
+}
+
+inline std::string get_value_from_map(const std::string& mapstr) {
+    size_t sep_pos = mapstr.find_first_of(":");
+    if (sep_pos == std::string::npos)
+        return "";
+
+    std::string tmp = mapstr.substr(sep_pos + 1);
+    return trim(tmp);
+}
+
+/**
+   Parses the string representation of a Python dict
+   The keys need to be known and may not appear anywhere else in the data.
+ */
+inline std::unordered_map<std::string, std::string> parse_dict(
+    std::string in, const std::vector<std::string>& keys) {
+    std::unordered_map<std::string, std::string> map;
+
+    if (keys.size() == 0)
+        return map;
+
+    in = trim(in);
+
+    // unwrap dictionary
+    if ((in.front() == '{') && (in.back() == '}'))
+        in = in.substr(1, in.length() - 2);
+    else
+        throw std::runtime_error("Not a Python dictionary.");
+
+    std::vector<std::pair<size_t, std::string>> positions;
+
+    for (auto const& value : keys) {
+        size_t pos = in.find("'" + value + "'");
+
+        if (pos == std::string::npos)
+            throw std::runtime_error("Missing '" + value + "' key.");
+
+        std::pair<size_t, std::string> position_pair{pos, value};
+        positions.push_back(position_pair);
+    }
+
+    // sort by position in dict
+    std::sort(positions.begin(), positions.end());
+
+    for (size_t i = 0; i < positions.size(); ++i) {
+        std::string raw_value;
+        size_t begin{positions[i].first};
+        size_t end{std::string::npos};
+
+        std::string key = positions[i].second;
+
+        if (i + 1 < positions.size())
+            end = positions[i + 1].first;
+
+        raw_value = in.substr(begin, end - begin);
+
+        raw_value = trim(raw_value);
+
+        if (raw_value.back() == ',')
+            raw_value.pop_back();
+
+        map[key] = get_value_from_map(raw_value);
+    }
+
+    return map;
+}
+
+/**
+  Parses the string representation of a Python boolean
+  */
+inline bool parse_bool(const std::string& in) {
+    if (in == "True")
+        return true;
+    if (in == "False")
+        return false;
+
+    throw std::runtime_error("Invalid python boolan.");
+}
+
+/**
+  Parses the string representation of a Python str
+  */
+inline std::string parse_str(const std::string& in) {
+    if ((in.front() == '\'') && (in.back() == '\''))
+        return in.substr(1, in.length() - 2);
+
+    throw std::runtime_error("Invalid python string.");
+}
+
+/**
+  Parses the string represenatation of a Python tuple into a vector of its items
+ */
+inline std::vector<std::string> parse_tuple(std::string in) {
+    std::vector<std::string> v;
+    const char seperator = ',';
+
+    in = trim(in);
+
+    if ((in.front() == '(') && (in.back() == ')'))
+        in = in.substr(1, in.length() - 2);
+    else
+        throw std::runtime_error("Invalid Python tuple.");
+
+    std::istringstream iss(in);
+
+    for (std::string token; std::getline(iss, token, seperator);) {
+        v.push_back(token);
+    }
+
+    return v;
+}
+} // namespace pyparse
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/CMakeLists.txt
new file mode 100644
index 0000000000..503789dd23
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/CMakeLists.txt
@@ -0,0 +1,98 @@
+# Copyright 2015 The RE2 Authors.  All Rights Reserved. Use of this source code
+# is governed by a BSD-style license that can be found in the LICENSE file.
+
+# Old enough to support Ubuntu Trusty.
+cmake_minimum_required(VERSION 3.15)
+
+if(POLICY CMP0048)
+    cmake_policy(SET CMP0048 NEW)
+endif()
+
+if(POLICY CMP0063)
+    cmake_policy(SET CMP0063 NEW)
+endif()
+
+if(POLICY CMP0069)
+    cmake_policy(SET CMP0069 NEW)
+endif()
+
+project(RE2 CXX)
+
+set(CMAKE_CXX_VISIBILITY_PRESET hidden)
+
+include(CTest)
+
+# CMake seems to have no way to enable/disable testing per subproject, so we
+# provide an option similar to BUILD_TESTING, but just for RE2.
+option(RE2_BUILD_TESTING "enable testing for RE2" OFF)
+
+set(EXTRA_TARGET_LINK_LIBRARIES)
+
+if(CMAKE_CXX_COMPILER_ID MATCHES "MSVC")
+    if(MSVC_VERSION LESS 1900)
+        message(FATAL_ERROR "you need Visual Studio 2015 or later")
+    endif()
+    if(BUILD_SHARED_LIBS)
+        # See http://www.kitware.com/blog/home/post/939 for details.
+        cmake_minimum_required(VERSION 3.4)
+        set(CMAKE_WINDOWS_EXPORT_ALL_SYMBOLS ON)
+    endif()
+    # CMake defaults to /W3, but some users like /W4 (or /Wall) and /WX, so we
+    # disable various warnings that aren't particularly helpful.
+    add_compile_options(/wd4100
+            /wd4201
+            /wd4456
+            /wd4457
+            /wd4702
+            /wd4815)
+    # Without a byte order mark (BOM), Visual Studio assumes that the source file
+    # is encoded using the current user code page, so we specify UTF-8.
+    add_compile_options(/utf-8)
+elseif(CYGWIN OR MINGW)
+    # See https://stackoverflow.com/questions/38139631 for details.
+    add_compile_options(-std=gnu++11)
+elseif(CMAKE_CXX_COMPILER_ID MATCHES "GNU|Clang")
+    add_compile_options(-std=c++17)
+endif()
+
+add_compile_options(-std=c++17)
+
+if(WIN32)
+    add_definitions(-DUNICODE
+            -D_UNICODE
+            -DSTRICT
+            -DNOMINMAX)
+    add_definitions(-D_CRT_SECURE_NO_WARNINGS -D_SCL_SECURE_NO_WARNINGS)
+elseif(UNIX)
+    # add_compile_options(-pthread) list(APPEND EXTRA_TARGET_LINK_LIBRARIES
+    # -pthread)
+endif()
+
+set(RE2_SOURCES
+        bitstate.cpp
+        compile.cpp
+        dfa.cpp
+        filtered_re2.cpp
+        mimics_pcre.cpp
+        nfa.cpp
+        onepass.cpp
+        parse.cpp
+        perl_groups.cpp
+        prefilter.cpp
+        prefilter_tree.cpp
+        prog.cpp
+        re2.cpp
+        regexp.cpp
+        set.cpp
+        simplify.cpp
+        stringpiece.cpp
+        tostring.cpp
+        unicode_casefold.cpp
+        unicode_groups.cpp
+        rune.cpp
+        strutil.cpp)
+
+add_library(re2 STATIC ${RE2_SOURCES})
+target_include_directories(
+        re2
+        PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/LICENSE
new file mode 100644
index 0000000000..09e5ec1c74
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/LICENSE
@@ -0,0 +1,27 @@
+// Copyright (c) 2009 The RE2 Authors. All rights reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//    * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//    * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//    * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/bitstate.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/bitstate.cpp
new file mode 100644
index 0000000000..dec021f593
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/bitstate.cpp
@@ -0,0 +1,374 @@
+// Copyright 2008 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Tested by search_test.cc, exhaustive_test.cc, tester.cc
+
+// Prog::SearchBitState is a regular expression search with submatch
+// tracking for small regular expressions and texts.  Similarly to
+// testing/backtrack.cc, it allocates a bitmap with (count of
+// lists) * (length of text) bits to make sure it never explores the
+// same (instruction list, character position) multiple times.  This
+// limits the search to run in time linear in the length of the text.
+//
+// Unlike testing/backtrack.cc, SearchBitState is not recursive
+// on the text.
+//
+// SearchBitState is a fast replacement for the NFA code on small
+// regexps and texts when SearchOnePass cannot be used.
+
+#include <stddef.h>
+#include <stdint.h>
+#include <string.h>
+
+#include <limits>
+#include <utility>
+
+#include "logging.h"
+#include "pod_array.h"
+#include "prog.h"
+#include "regexp.h"
+
+namespace lbug {
+namespace regex {
+
+struct Job {
+    int id;
+    int rle; // run length encoding
+    const char* p;
+};
+
+class BitState {
+public:
+    explicit BitState(Prog* prog);
+
+    // The usual Search prototype.
+    // Can only call Search once per BitState.
+    bool Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest,
+        StringPiece* submatch, int nsubmatch);
+
+private:
+    inline bool ShouldVisit(int id, const char* p);
+    void Push(int id, const char* p);
+    void GrowStack();
+    bool TrySearch(int id, const char* p);
+
+    // Search parameters
+    Prog* prog_;            // program being run
+    StringPiece text_;      // text being searched
+    StringPiece context_;   // greater context of text being searched
+    bool anchored_;         // whether search is anchored at text.begin()
+    bool longest_;          // whether search wants leftmost-longest match
+    bool endmatch_;         // whether match must end at text.end()
+    StringPiece* submatch_; // submatches to fill in
+    int nsubmatch_;         //   # of submatches to fill in
+
+    // Search state
+    static constexpr int kVisitedBits = 64;
+    PODArray<uint64_t> visited_; // bitmap: (list ID, char*) pairs visited
+    PODArray<const char*> cap_;  // capture registers
+    PODArray<Job> job_;          // stack of text positions to explore
+    int njob_;                   // stack size
+
+    BitState(const BitState&) = delete;
+    BitState& operator=(const BitState&) = delete;
+};
+
+BitState::BitState(Prog* prog)
+    : prog_(prog), anchored_(false), longest_(false), endmatch_(false), submatch_(NULL),
+      nsubmatch_(0), njob_(0) {}
+
+// Given id, which *must* be a list head, we can look up its list ID.
+// Then the question is: Should the search visit the (list ID, p) pair?
+// If so, remember that it was visited so that the next time,
+// we don't repeat the visit.
+bool BitState::ShouldVisit(int id, const char* p) {
+    int n = prog_->list_heads()[id] * static_cast<int>(text_.size() + 1) +
+            static_cast<int>(p - text_.data());
+    if (visited_[n / kVisitedBits] & (uint64_t{1} << (n & (kVisitedBits - 1))))
+        return false;
+    visited_[n / kVisitedBits] |= uint64_t{1} << (n & (kVisitedBits - 1));
+    return true;
+}
+
+// Grow the stack.
+void BitState::GrowStack() {
+    PODArray<Job> tmp(2 * job_.size());
+    memmove(tmp.data(), job_.data(), njob_ * sizeof job_[0]);
+    job_ = std::move(tmp);
+}
+
+// Push (id, p) onto the stack, growing it if necessary.
+void BitState::Push(int id, const char* p) {
+    if (njob_ >= job_.size()) {
+        GrowStack();
+        if (njob_ >= job_.size()) {
+            LOG(DFATAL) << "GrowStack() failed: "
+                        << "njob_ = " << njob_ << ", "
+                        << "job_.size() = " << job_.size();
+            return;
+        }
+    }
+
+    // If id < 0, it's undoing a Capture,
+    // so we mustn't interfere with that.
+    if (id >= 0 && njob_ > 0) {
+        Job* top = &job_[njob_ - 1];
+        if (id == top->id && p == top->p + top->rle + 1 &&
+            top->rle < std::numeric_limits<int>::max()) {
+            ++top->rle;
+            return;
+        }
+    }
+
+    Job* top = &job_[njob_++];
+    top->id = id;
+    top->rle = 0;
+    top->p = p;
+}
+
+// Try a search from instruction id0 in state p0.
+// Return whether it succeeded.
+bool BitState::TrySearch(int id0, const char* p0) {
+    bool matched = false;
+    const char* end = text_.data() + text_.size();
+    njob_ = 0;
+    // Push() no longer checks ShouldVisit(),
+    // so we must perform the check ourselves.
+    if (ShouldVisit(id0, p0))
+        Push(id0, p0);
+    while (njob_ > 0) {
+        // Pop job off stack.
+        --njob_;
+        int id = job_[njob_].id;
+        int& rle = job_[njob_].rle;
+        const char* p = job_[njob_].p;
+
+        if (id < 0) {
+            // Undo the Capture.
+            cap_[prog_->inst(-id)->cap()] = p;
+            continue;
+        }
+
+        if (rle > 0) {
+            p += rle;
+            // Revivify job on stack.
+            --rle;
+            ++njob_;
+        }
+
+    Loop:
+        // Visit id, p.
+        Prog::Inst* ip = prog_->inst(id);
+        switch (ip->opcode()) {
+        default:
+            LOG(DFATAL) << "Unexpected opcode: " << ip->opcode();
+            return false;
+
+        case kInstFail:
+            break;
+
+        case kInstAltMatch:
+            if (ip->greedy(prog_)) {
+                // out1 is the Match instruction.
+                id = ip->out1();
+                p = end;
+                goto Loop;
+            }
+            if (longest_) {
+                // ip must be non-greedy...
+                // out is the Match instruction.
+                id = ip->out();
+                p = end;
+                goto Loop;
+            }
+            goto Next;
+
+        case kInstByteRange: {
+            int c = -1;
+            if (p < end)
+                c = *p & 0xFF;
+            if (!ip->Matches(c))
+                goto Next;
+
+            if (ip->hint() != 0)
+                Push(id + ip->hint(), p); // try the next when we're done
+            id = ip->out();
+            p++;
+            goto CheckAndLoop;
+        }
+
+        case kInstCapture:
+            if (!ip->last())
+                Push(id + 1, p); // try the next when we're done
+
+            if (0 <= ip->cap() && ip->cap() < cap_.size()) {
+                // Capture p to register, but save old value first.
+                Push(-id, cap_[ip->cap()]); // undo when we're done
+                cap_[ip->cap()] = p;
+            }
+
+            id = ip->out();
+            goto CheckAndLoop;
+
+        case kInstEmptyWidth:
+            if (ip->empty() & ~Prog::EmptyFlags(context_, p))
+                goto Next;
+
+            if (!ip->last())
+                Push(id + 1, p); // try the next when we're done
+            id = ip->out();
+            goto CheckAndLoop;
+
+        case kInstNop:
+            if (!ip->last())
+                Push(id + 1, p); // try the next when we're done
+            id = ip->out();
+
+        CheckAndLoop:
+            // Sanity check: id is the head of its list, which must
+            // be the case if id-1 is the last of *its* list. :)
+            DCHECK(id == 0 || prog_->inst(id - 1)->last());
+            if (ShouldVisit(id, p))
+                goto Loop;
+            break;
+
+        case kInstMatch: {
+            if (endmatch_ && p != end)
+                goto Next;
+
+            // We found a match.  If the caller doesn't care
+            // where the match is, no point going further.
+            if (nsubmatch_ == 0)
+                return true;
+
+            // Record best match so far.
+            // Only need to check end point, because this entire
+            // call is only considering one start position.
+            matched = true;
+            cap_[1] = p;
+            if (submatch_[0].data() == NULL ||
+                (longest_ && p > submatch_[0].data() + submatch_[0].size())) {
+                for (int i = 0; i < nsubmatch_; i++)
+                    submatch_[i] = StringPiece(
+                        cap_[2 * i], static_cast<size_t>(cap_[2 * i + 1] - cap_[2 * i]));
+            }
+
+            // If going for first match, we're done.
+            if (!longest_)
+                return true;
+
+            // If we used the entire text, no longer match is possible.
+            if (p == end)
+                return true;
+
+            // Otherwise, continue on in hope of a longer match.
+            // Note the absence of the ShouldVisit() check here
+            // due to execution remaining in the same list.
+        Next:
+            if (!ip->last()) {
+                id++;
+                goto Loop;
+            }
+            break;
+        }
+        }
+    }
+    return matched;
+}
+
+// Search text (within context) for prog_.
+bool BitState::Search(const StringPiece& text, const StringPiece& context, bool anchored,
+    bool longest, StringPiece* submatch, int nsubmatch) {
+    // Search parameters.
+    text_ = text;
+    context_ = context;
+    if (context_.data() == NULL)
+        context_ = text;
+    if (prog_->anchor_start() && BeginPtr(context_) != BeginPtr(text))
+        return false;
+    if (prog_->anchor_end() && EndPtr(context_) != EndPtr(text))
+        return false;
+    anchored_ = anchored || prog_->anchor_start();
+    longest_ = longest || prog_->anchor_end();
+    endmatch_ = prog_->anchor_end();
+    submatch_ = submatch;
+    nsubmatch_ = nsubmatch;
+    for (int i = 0; i < nsubmatch_; i++)
+        submatch_[i] = StringPiece();
+
+    // Allocate scratch space.
+    int nvisited = prog_->list_count() * static_cast<int>(text.size() + 1);
+    nvisited = (nvisited + kVisitedBits - 1) / kVisitedBits;
+    visited_ = PODArray<uint64_t>(nvisited);
+    memset(visited_.data(), 0, nvisited * sizeof visited_[0]);
+
+    int ncap = 2 * nsubmatch;
+    if (ncap < 2)
+        ncap = 2;
+    cap_ = PODArray<const char*>(ncap);
+    memset(cap_.data(), 0, ncap * sizeof cap_[0]);
+
+    // When sizeof(Job) == 16, we start with a nice round 1KiB. :)
+    job_ = PODArray<Job>(64);
+
+    // Anchored search must start at text.begin().
+    if (anchored_) {
+        cap_[0] = text.data();
+        return TrySearch(prog_->start(), text.data());
+    }
+
+    // Unanchored search, starting from each possible text position.
+    // Notice that we have to try the empty string at the end of
+    // the text, so the loop condition is p <= text.end(), not p < text.end().
+    // This looks like it's quadratic in the size of the text,
+    // but we are not clearing visited_ between calls to TrySearch,
+    // so no work is duplicated and it ends up still being linear.
+    const char* etext = text.data() + text.size();
+    for (const char* p = text.data(); p <= etext; p++) {
+        // Try to use prefix accel (e.g. memchr) to skip ahead.
+        if (p < etext && prog_->can_prefix_accel()) {
+            p = reinterpret_cast<const char*>(prog_->PrefixAccel(p, etext - p));
+            if (p == NULL)
+                p = etext;
+        }
+
+        cap_[0] = p;
+        if (TrySearch(prog_->start(), p)) // Match must be leftmost; done.
+            return true;
+        // Avoid invoking undefined behavior (arithmetic on a null pointer)
+        // by simply not continuing the loop.
+        if (p == NULL)
+            break;
+    }
+    return false;
+}
+
+// Bit-state search.
+bool Prog::SearchBitState(const StringPiece& text, const StringPiece& context, Anchor anchor,
+    MatchKind kind, StringPiece* match, int nmatch) {
+    // If full match, we ask for an anchored longest match
+    // and then check that match[0] == text.
+    // So make sure match[0] exists.
+    StringPiece sp0;
+    if (kind == kFullMatch) {
+        anchor = kAnchored;
+        if (nmatch < 1) {
+            match = &sp0;
+            nmatch = 1;
+        }
+    }
+
+    // Run the search.
+    BitState b(this);
+    bool anchored = anchor == kAnchored;
+    bool longest = kind != kFirstMatch;
+    if (!b.Search(text, context, anchored, longest, match, nmatch))
+        return false;
+    if (kind == kFullMatch && EndPtr(match[0]) != EndPtr(text))
+        return false;
+    return true;
+}
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/compile.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/compile.cpp
new file mode 100644
index 0000000000..2a92eee5d3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/compile.cpp
@@ -0,0 +1,1246 @@
+// Copyright 2007 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Compile regular expression to Prog.
+//
+// Prog and Inst are defined in prog.h.
+// This file's external interface is just Regexp::CompileToProg.
+// The Compiler class defined in this file is private.
+
+#include <stdint.h>
+#include <string.h>
+
+#include <unordered_map>
+#include <utility>
+
+#include "logging.h"
+#include "pod_array.h"
+#include "prog.h"
+#include "re2.h"
+#include "regexp.h"
+#include "utf.h"
+#include "walker-inl.h"
+
+namespace lbug {
+namespace regex {
+
+// List of pointers to Inst* that need to be filled in (patched).
+// Because the Inst* haven't been filled in yet,
+// we can use the Inst* word to hold the list's "next" pointer.
+// It's kind of sleazy, but it works well in practice.
+// See http://swtch.com/~rsc/regexp/regexp1.html for inspiration.
+//
+// Because the out and out1 fields in Inst are no longer pointers,
+// we can't use pointers directly here either.  Instead, head refers
+// to inst_[head>>1].out (head&1 == 0) or inst_[head>>1].out1 (head&1 == 1).
+// head == 0 represents the NULL list.  This is okay because instruction #0
+// is always the fail instruction, which never appears on a list.
+struct PatchList {
+    // Returns patch list containing just p.
+    static PatchList Mk(uint32_t p) { return {p, p}; }
+
+    // Patches all the entries on l to have value p.
+    // Caller must not ever use patch list again.
+    static void Patch(Prog::Inst* inst0, PatchList l, uint32_t p) {
+        while (l.head != 0) {
+            Prog::Inst* ip = &inst0[l.head >> 1];
+            if (l.head & 1) {
+                l.head = ip->out1();
+                ip->out1_ = p;
+            } else {
+                l.head = ip->out();
+                ip->set_out(p);
+            }
+        }
+    }
+
+    // Appends two patch lists and returns result.
+    static PatchList Append(Prog::Inst* inst0, PatchList l1, PatchList l2) {
+        if (l1.head == 0)
+            return l2;
+        if (l2.head == 0)
+            return l1;
+        Prog::Inst* ip = &inst0[l1.tail >> 1];
+        if (l1.tail & 1)
+            ip->out1_ = l2.head;
+        else
+            ip->set_out(l2.head);
+        return {l1.head, l2.tail};
+    }
+
+    uint32_t head;
+    uint32_t tail; // for constant-time append
+};
+
+static const PatchList kNullPatchList = {0, 0};
+
+// Compiled program fragment.
+struct Frag {
+    uint32_t begin;
+    PatchList end;
+    bool nullable;
+
+    Frag() : begin(0), end(kNullPatchList), nullable(false) {}
+    Frag(uint32_t begin, PatchList end, bool nullable)
+        : begin(begin), end(end), nullable(nullable) {}
+};
+
+// Input encodings.
+enum Encoding {
+    kEncodingUTF8 = 1, // UTF-8 (0-10FFFF)
+    kEncodingLatin1,   // Latin-1 (0-FF)
+};
+
+class Compiler : public Regexp::Walker<Frag> {
+public:
+    explicit Compiler();
+    ~Compiler();
+
+    // Compiles Regexp to a new Prog.
+    // Caller is responsible for deleting Prog when finished with it.
+    // If reversed is true, compiles for walking over the input
+    // string backward (reverses all concatenations).
+    static Prog* Compile(Regexp* re, bool reversed, int64_t max_mem);
+
+    // Compiles alternation of all the re to a new Prog.
+    // Each re has a match with an id equal to its index in the vector.
+    static Prog* CompileSet(Regexp* re, RE2::Anchor anchor, int64_t max_mem);
+
+    // Interface for Regexp::Walker, which helps traverse the Regexp.
+    // The walk is purely post-recursive: given the machines for the
+    // children, PostVisit combines them to create the machine for
+    // the current node.  The child_args are Frags.
+    // The Compiler traverses the Regexp parse tree, visiting
+    // each node in depth-first order.  It invokes PreVisit before
+    // visiting the node's children and PostVisit after visiting
+    // the children.
+    Frag PreVisit(Regexp* re, Frag parent_arg, bool* stop);
+    Frag PostVisit(Regexp* re, Frag parent_arg, Frag pre_arg, Frag* child_args, int nchild_args);
+    Frag ShortVisit(Regexp* re, Frag parent_arg);
+    Frag Copy(Frag arg);
+
+    // Given fragment a, returns a+ or a+?; a* or a*?; a? or a??
+    Frag Plus(Frag a, bool nongreedy);
+    Frag Star(Frag a, bool nongreedy);
+    Frag Quest(Frag a, bool nongreedy);
+
+    // Given fragment a, returns (a) capturing as \n.
+    Frag Capture(Frag a, int n);
+
+    // Given fragments a and b, returns ab; a|b
+    Frag Cat(Frag a, Frag b);
+    Frag Alt(Frag a, Frag b);
+
+    // Returns a fragment that can't match anything.
+    Frag NoMatch();
+
+    // Returns a fragment that matches the empty string.
+    Frag Match(int32_t id);
+
+    // Returns a no-op fragment.
+    Frag Nop();
+
+    // Returns a fragment matching the byte range lo-hi.
+    Frag ByteRange(int lo, int hi, bool foldcase);
+
+    // Returns a fragment matching an empty-width special op.
+    Frag EmptyWidth(EmptyOp op);
+
+    // Adds n instructions to the program.
+    // Returns the index of the first one.
+    // Returns -1 if no more instructions are available.
+    int AllocInst(int n);
+
+    // Rune range compiler.
+
+    // Begins a new alternation.
+    void BeginRange();
+
+    // Adds a fragment matching the rune range lo-hi.
+    void AddRuneRange(Rune lo, Rune hi, bool foldcase);
+    void AddRuneRangeLatin1(Rune lo, Rune hi, bool foldcase);
+    void AddRuneRangeUTF8(Rune lo, Rune hi, bool foldcase);
+    void Add_80_10ffff();
+
+    // New suffix that matches the byte range lo-hi, then goes to next.
+    int UncachedRuneByteSuffix(uint8_t lo, uint8_t hi, bool foldcase, int next);
+    int CachedRuneByteSuffix(uint8_t lo, uint8_t hi, bool foldcase, int next);
+
+    // Returns true iff the suffix is cached.
+    bool IsCachedRuneByteSuffix(int id);
+
+    // Adds a suffix to alternation.
+    void AddSuffix(int id);
+
+    // Adds a suffix to the trie starting from the given root node.
+    // Returns zero iff allocating an instruction fails. Otherwise, returns
+    // the current root node, which might be different from what was given.
+    int AddSuffixRecursive(int root, int id);
+
+    // Finds the trie node for the given suffix. Returns a Frag in order to
+    // distinguish between pointing at the root node directly (end.head == 0)
+    // and pointing at an Alt's out1 or out (end.head&1 == 1 or 0, respectively).
+    Frag FindByteRange(int root, int id);
+
+    // Compares two ByteRanges and returns true iff they are equal.
+    bool ByteRangeEqual(int id1, int id2);
+
+    // Returns the alternation of all the added suffixes.
+    Frag EndRange();
+
+    // Single rune.
+    Frag Literal(Rune r, bool foldcase);
+
+    void Setup(Regexp::ParseFlags flags, int64_t max_mem, RE2::Anchor anchor);
+    Prog* Finish(Regexp* re);
+
+    // Returns .* where dot = any byte
+    Frag DotStar();
+
+private:
+    Prog* prog_;        // Program being built.
+    bool failed_;       // Did we give up compiling?
+    Encoding encoding_; // Input encoding
+    bool reversed_;     // Should program run backward over text?
+
+    PODArray<Prog::Inst> inst_;
+    int ninst_;     // Number of instructions used.
+    int max_ninst_; // Maximum number of instructions.
+
+    int64_t max_mem_; // Total memory budget.
+
+    std::unordered_map<uint64_t, int> rune_cache_;
+    Frag rune_range_;
+
+    RE2::Anchor anchor_; // anchor mode for RE2::Set
+
+    Compiler(const Compiler&) = delete;
+    Compiler& operator=(const Compiler&) = delete;
+};
+
+Compiler::Compiler() {
+    prog_ = new Prog();
+    failed_ = false;
+    encoding_ = kEncodingUTF8;
+    reversed_ = false;
+    ninst_ = 0;
+    max_ninst_ = 1; // make AllocInst for fail instruction okay
+    max_mem_ = 0;
+    int fail = AllocInst(1);
+    inst_[fail].InitFail();
+    max_ninst_ = 0; // Caller must change
+}
+
+Compiler::~Compiler() {
+    delete prog_;
+}
+
+int Compiler::AllocInst(int n) {
+    if (failed_ || ninst_ + n > max_ninst_) {
+        failed_ = true;
+        return -1;
+    }
+
+    if (ninst_ + n > inst_.size()) {
+        int cap = inst_.size();
+        if (cap == 0)
+            cap = 8;
+        while (ninst_ + n > cap)
+            cap *= 2;
+        PODArray<Prog::Inst> inst(cap);
+        if (inst_.data() != NULL)
+            memmove(inst.data(), inst_.data(), ninst_ * sizeof inst_[0]);
+        memset(inst.data() + ninst_, 0, (cap - ninst_) * sizeof inst_[0]);
+        inst_ = std::move(inst);
+    }
+    int id = ninst_;
+    ninst_ += n;
+    return id;
+}
+
+// These routines are somewhat hard to visualize in text --
+// see http://swtch.com/~rsc/regexp/regexp1.html for
+// pictures explaining what is going on here.
+
+// Returns an unmatchable fragment.
+Frag Compiler::NoMatch() {
+    return Frag();
+}
+
+// Is a an unmatchable fragment?
+static bool IsNoMatch(Frag a) {
+    return a.begin == 0;
+}
+
+// Given fragments a and b, returns fragment for ab.
+Frag Compiler::Cat(Frag a, Frag b) {
+    if (IsNoMatch(a) || IsNoMatch(b))
+        return NoMatch();
+
+    // Elide no-op.
+    Prog::Inst* begin = &inst_[a.begin];
+    if (begin->opcode() == kInstNop && a.end.head == (a.begin << 1) && begin->out() == 0) {
+        // in case refs to a somewhere
+        PatchList::Patch(inst_.data(), a.end, b.begin);
+        return b;
+    }
+
+    // To run backward over string, reverse all concatenations.
+    if (reversed_) {
+        PatchList::Patch(inst_.data(), b.end, a.begin);
+        return Frag(b.begin, a.end, b.nullable && a.nullable);
+    }
+
+    PatchList::Patch(inst_.data(), a.end, b.begin);
+    return Frag(a.begin, b.end, a.nullable && b.nullable);
+}
+
+// Given fragments for a and b, returns fragment for a|b.
+Frag Compiler::Alt(Frag a, Frag b) {
+    // Special case for convenience in loops.
+    if (IsNoMatch(a))
+        return b;
+    if (IsNoMatch(b))
+        return a;
+
+    int id = AllocInst(1);
+    if (id < 0)
+        return NoMatch();
+
+    inst_[id].InitAlt(a.begin, b.begin);
+    return Frag(id, PatchList::Append(inst_.data(), a.end, b.end), a.nullable || b.nullable);
+}
+
+// When capturing submatches in like-Perl mode, a kOpAlt Inst
+// treats out_ as the first choice, out1_ as the second.
+//
+// For *, +, and ?, if out_ causes another repetition,
+// then the operator is greedy.  If out1_ is the repetition
+// (and out_ moves forward), then the operator is non-greedy.
+
+// Given a fragment for a, returns a fragment for a+ or a+? (if nongreedy)
+Frag Compiler::Plus(Frag a, bool nongreedy) {
+    int id = AllocInst(1);
+    if (id < 0)
+        return NoMatch();
+    PatchList pl;
+    if (nongreedy) {
+        inst_[id].InitAlt(0, a.begin);
+        pl = PatchList::Mk(id << 1);
+    } else {
+        inst_[id].InitAlt(a.begin, 0);
+        pl = PatchList::Mk((id << 1) | 1);
+    }
+    PatchList::Patch(inst_.data(), a.end, id);
+    return Frag(a.begin, pl, a.nullable);
+}
+
+// Given a fragment for a, returns a fragment for a* or a*? (if nongreedy)
+Frag Compiler::Star(Frag a, bool nongreedy) {
+    // When the subexpression is nullable, one Alt isn't enough to guarantee
+    // correct priority ordering within the transitive closure. The simplest
+    // solution is to handle it as (a+)? instead, which adds the second Alt.
+    if (a.nullable)
+        return Quest(Plus(a, nongreedy), nongreedy);
+
+    int id = AllocInst(1);
+    if (id < 0)
+        return NoMatch();
+    PatchList pl;
+    if (nongreedy) {
+        inst_[id].InitAlt(0, a.begin);
+        pl = PatchList::Mk(id << 1);
+    } else {
+        inst_[id].InitAlt(a.begin, 0);
+        pl = PatchList::Mk((id << 1) | 1);
+    }
+    PatchList::Patch(inst_.data(), a.end, id);
+    return Frag(id, pl, true);
+}
+
+// Given a fragment for a, returns a fragment for a? or a?? (if nongreedy)
+Frag Compiler::Quest(Frag a, bool nongreedy) {
+    if (IsNoMatch(a))
+        return Nop();
+    int id = AllocInst(1);
+    if (id < 0)
+        return NoMatch();
+    PatchList pl;
+    if (nongreedy) {
+        inst_[id].InitAlt(0, a.begin);
+        pl = PatchList::Mk(id << 1);
+    } else {
+        inst_[id].InitAlt(a.begin, 0);
+        pl = PatchList::Mk((id << 1) | 1);
+    }
+    return Frag(id, PatchList::Append(inst_.data(), pl, a.end), true);
+}
+
+// Returns a fragment for the byte range lo-hi.
+Frag Compiler::ByteRange(int lo, int hi, bool foldcase) {
+    int id = AllocInst(1);
+    if (id < 0)
+        return NoMatch();
+    inst_[id].InitByteRange(lo, hi, foldcase, 0);
+    return Frag(id, PatchList::Mk(id << 1), false);
+}
+
+// Returns a no-op fragment.  Sometimes unavoidable.
+Frag Compiler::Nop() {
+    int id = AllocInst(1);
+    if (id < 0)
+        return NoMatch();
+    inst_[id].InitNop(0);
+    return Frag(id, PatchList::Mk(id << 1), true);
+}
+
+// Returns a fragment that signals a match.
+Frag Compiler::Match(int32_t match_id) {
+    int id = AllocInst(1);
+    if (id < 0)
+        return NoMatch();
+    inst_[id].InitMatch(match_id);
+    return Frag(id, kNullPatchList, false);
+}
+
+// Returns a fragment matching a particular empty-width op (like ^ or $)
+Frag Compiler::EmptyWidth(EmptyOp empty) {
+    int id = AllocInst(1);
+    if (id < 0)
+        return NoMatch();
+    inst_[id].InitEmptyWidth(empty, 0);
+    return Frag(id, PatchList::Mk(id << 1), true);
+}
+
+// Given a fragment a, returns a fragment with capturing parens around a.
+Frag Compiler::Capture(Frag a, int n) {
+    if (IsNoMatch(a))
+        return NoMatch();
+    int id = AllocInst(2);
+    if (id < 0)
+        return NoMatch();
+    inst_[id].InitCapture(2 * n, a.begin);
+    inst_[id + 1].InitCapture(2 * n + 1, 0);
+    PatchList::Patch(inst_.data(), a.end, id + 1);
+
+    return Frag(id, PatchList::Mk((id + 1) << 1), a.nullable);
+}
+
+// A Rune is a name for a Unicode code point.
+// Returns maximum rune encoded by UTF-8 sequence of length len.
+static int MaxRune(int len) {
+    int b; // number of Rune bits in len-byte UTF-8 sequence (len < UTFmax)
+    if (len == 1)
+        b = 7;
+    else
+        b = 8 - (len + 1) + 6 * (len - 1);
+    return (1 << b) - 1; // maximum Rune for b bits.
+}
+
+// The rune range compiler caches common suffix fragments,
+// which are very common in UTF-8 (e.g., [80-bf]).
+// The fragment suffixes are identified by their start
+// instructions.  NULL denotes the eventual end match.
+// The Frag accumulates in rune_range_.  Caching common
+// suffixes reduces the UTF-8 "." from 32 to 24 instructions,
+// and it reduces the corresponding one-pass NFA from 16 nodes to 8.
+
+void Compiler::BeginRange() {
+    rune_cache_.clear();
+    rune_range_.begin = 0;
+    rune_range_.end = kNullPatchList;
+}
+
+int Compiler::UncachedRuneByteSuffix(uint8_t lo, uint8_t hi, bool foldcase, int next) {
+    Frag f = ByteRange(lo, hi, foldcase);
+    if (next != 0) {
+        PatchList::Patch(inst_.data(), f.end, next);
+    } else {
+        rune_range_.end = PatchList::Append(inst_.data(), rune_range_.end, f.end);
+    }
+    return f.begin;
+}
+
+static uint64_t MakeRuneCacheKey(uint8_t lo, uint8_t hi, bool foldcase, int next) {
+    return (uint64_t)next << 17 | (uint64_t)lo << 9 | (uint64_t)hi << 1 | (uint64_t)foldcase;
+}
+
+int Compiler::CachedRuneByteSuffix(uint8_t lo, uint8_t hi, bool foldcase, int next) {
+    uint64_t key = MakeRuneCacheKey(lo, hi, foldcase, next);
+    std::unordered_map<uint64_t, int>::const_iterator it = rune_cache_.find(key);
+    if (it != rune_cache_.end())
+        return it->second;
+    int id = UncachedRuneByteSuffix(lo, hi, foldcase, next);
+    rune_cache_[key] = id;
+    return id;
+}
+
+bool Compiler::IsCachedRuneByteSuffix(int id) {
+    uint8_t lo = inst_[id].lo_;
+    uint8_t hi = inst_[id].hi_;
+    bool foldcase = inst_[id].foldcase() != 0;
+    int next = inst_[id].out();
+
+    uint64_t key = MakeRuneCacheKey(lo, hi, foldcase, next);
+    return rune_cache_.find(key) != rune_cache_.end();
+}
+
+void Compiler::AddSuffix(int id) {
+    if (failed_)
+        return;
+
+    if (rune_range_.begin == 0) {
+        rune_range_.begin = id;
+        return;
+    }
+
+    if (encoding_ == kEncodingUTF8) {
+        // Build a trie in order to reduce fanout.
+        rune_range_.begin = AddSuffixRecursive(rune_range_.begin, id);
+        return;
+    }
+
+    int alt = AllocInst(1);
+    if (alt < 0) {
+        rune_range_.begin = 0;
+        return;
+    }
+    inst_[alt].InitAlt(rune_range_.begin, id);
+    rune_range_.begin = alt;
+}
+
+int Compiler::AddSuffixRecursive(int root, int id) {
+    DCHECK(inst_[root].opcode() == kInstAlt || inst_[root].opcode() == kInstByteRange);
+
+    Frag f = FindByteRange(root, id);
+    if (IsNoMatch(f)) {
+        int alt = AllocInst(1);
+        if (alt < 0)
+            return 0;
+        inst_[alt].InitAlt(root, id);
+        return alt;
+    }
+
+    int br;
+    if (f.end.head == 0)
+        br = root;
+    else if (f.end.head & 1)
+        br = inst_[f.begin].out1();
+    else
+        br = inst_[f.begin].out();
+
+    if (IsCachedRuneByteSuffix(br)) {
+        // We can't fiddle with cached suffixes, so make a clone of the head.
+        int byterange = AllocInst(1);
+        if (byterange < 0)
+            return 0;
+        inst_[byterange].InitByteRange(
+            inst_[br].lo(), inst_[br].hi(), inst_[br].foldcase(), inst_[br].out());
+
+        // Ensure that the parent points to the clone, not to the original.
+        // Note that this could leave the head unreachable except via the cache.
+        br = byterange;
+        if (f.end.head == 0)
+            root = br;
+        else if (f.end.head & 1)
+            inst_[f.begin].out1_ = br;
+        else
+            inst_[f.begin].set_out(br);
+    }
+
+    int out = inst_[id].out();
+    if (!IsCachedRuneByteSuffix(id)) {
+        // The head should be the instruction most recently allocated, so free it
+        // instead of leaving it unreachable.
+        DCHECK_EQ(id, ninst_ - 1);
+        inst_[id].out_opcode_ = 0;
+        inst_[id].out1_ = 0;
+        ninst_--;
+    }
+
+    out = AddSuffixRecursive(inst_[br].out(), out);
+    if (out == 0)
+        return 0;
+
+    inst_[br].set_out(out);
+    return root;
+}
+
+bool Compiler::ByteRangeEqual(int id1, int id2) {
+    return inst_[id1].lo() == inst_[id2].lo() && inst_[id1].hi() == inst_[id2].hi() &&
+           inst_[id1].foldcase() == inst_[id2].foldcase();
+}
+
+Frag Compiler::FindByteRange(int root, int id) {
+    if (inst_[root].opcode() == kInstByteRange) {
+        if (ByteRangeEqual(root, id))
+            return Frag(root, kNullPatchList, false);
+        else
+            return NoMatch();
+    }
+
+    while (inst_[root].opcode() == kInstAlt) {
+        int out1 = inst_[root].out1();
+        if (ByteRangeEqual(out1, id))
+            return Frag(root, PatchList::Mk((root << 1) | 1), false);
+
+        // CharClass is a sorted list of ranges, so if out1 of the root Alt wasn't
+        // what we're looking for, then we can stop immediately. Unfortunately, we
+        // can't short-circuit the search in reverse mode.
+        if (!reversed_)
+            return NoMatch();
+
+        int out = inst_[root].out();
+        if (inst_[out].opcode() == kInstAlt)
+            root = out;
+        else if (ByteRangeEqual(out, id))
+            return Frag(root, PatchList::Mk(root << 1), false);
+        else
+            return NoMatch();
+    }
+
+    LOG(DFATAL) << "should never happen";
+    return NoMatch();
+}
+
+Frag Compiler::EndRange() {
+    return rune_range_;
+}
+
+// Converts rune range lo-hi into a fragment that recognizes
+// the bytes that would make up those runes in the current
+// encoding (Latin 1 or UTF-8).
+// This lets the machine work byte-by-byte even when
+// using multibyte encodings.
+
+void Compiler::AddRuneRange(Rune lo, Rune hi, bool foldcase) {
+    switch (encoding_) {
+    default:
+    case kEncodingUTF8:
+        AddRuneRangeUTF8(lo, hi, foldcase);
+        break;
+    case kEncodingLatin1:
+        AddRuneRangeLatin1(lo, hi, foldcase);
+        break;
+    }
+}
+
+void Compiler::AddRuneRangeLatin1(Rune lo, Rune hi, bool foldcase) {
+    // Latin-1 is easy: runes *are* bytes.
+    if (lo > hi || lo > 0xFF)
+        return;
+    if (hi > 0xFF)
+        hi = 0xFF;
+    AddSuffix(
+        UncachedRuneByteSuffix(static_cast<uint8_t>(lo), static_cast<uint8_t>(hi), foldcase, 0));
+}
+
+void Compiler::Add_80_10ffff() {
+    // The 80-10FFFF (Runeself-Runemax) rune range occurs frequently enough
+    // (for example, for /./ and /[^a-z]/) that it is worth simplifying: by
+    // permitting overlong encodings in E0 and F0 sequences and code points
+    // over 10FFFF in F4 sequences, the size of the bytecode and the number
+    // of equivalence classes are reduced significantly.
+    int id;
+    if (reversed_) {
+        // Prefix factoring matters, but we don't have to handle it here
+        // because the rune range trie logic takes care of that already.
+        id = UncachedRuneByteSuffix(0xC2, 0xDF, false, 0);
+        id = UncachedRuneByteSuffix(0x80, 0xBF, false, id);
+        AddSuffix(id);
+
+        id = UncachedRuneByteSuffix(0xE0, 0xEF, false, 0);
+        id = UncachedRuneByteSuffix(0x80, 0xBF, false, id);
+        id = UncachedRuneByteSuffix(0x80, 0xBF, false, id);
+        AddSuffix(id);
+
+        id = UncachedRuneByteSuffix(0xF0, 0xF4, false, 0);
+        id = UncachedRuneByteSuffix(0x80, 0xBF, false, id);
+        id = UncachedRuneByteSuffix(0x80, 0xBF, false, id);
+        id = UncachedRuneByteSuffix(0x80, 0xBF, false, id);
+        AddSuffix(id);
+    } else {
+        // Suffix factoring matters - and we do have to handle it here.
+        int cont1 = UncachedRuneByteSuffix(0x80, 0xBF, false, 0);
+        id = UncachedRuneByteSuffix(0xC2, 0xDF, false, cont1);
+        AddSuffix(id);
+
+        int cont2 = UncachedRuneByteSuffix(0x80, 0xBF, false, cont1);
+        id = UncachedRuneByteSuffix(0xE0, 0xEF, false, cont2);
+        AddSuffix(id);
+
+        int cont3 = UncachedRuneByteSuffix(0x80, 0xBF, false, cont2);
+        id = UncachedRuneByteSuffix(0xF0, 0xF4, false, cont3);
+        AddSuffix(id);
+    }
+}
+
+void Compiler::AddRuneRangeUTF8(Rune lo, Rune hi, bool foldcase) {
+    if (lo > hi)
+        return;
+
+    // Pick off 80-10FFFF as a common special case.
+    if (lo == 0x80 && hi == 0x10ffff) {
+        Add_80_10ffff();
+        return;
+    }
+
+    // Split range into same-length sized ranges.
+    for (int i = 1; i < UTFmax; i++) {
+        Rune max = MaxRune(i);
+        if (lo <= max && max < hi) {
+            AddRuneRangeUTF8(lo, max, foldcase);
+            AddRuneRangeUTF8(max + 1, hi, foldcase);
+            return;
+        }
+    }
+
+    // ASCII range is always a special case.
+    if (hi < Runeself) {
+        AddSuffix(UncachedRuneByteSuffix(
+            static_cast<uint8_t>(lo), static_cast<uint8_t>(hi), foldcase, 0));
+        return;
+    }
+
+    // Split range into sections that agree on leading bytes.
+    for (int i = 1; i < UTFmax; i++) {
+        uint32_t m = (1 << (6 * i)) - 1; // last i bytes of a UTF-8 sequence
+        if ((lo & ~m) != (hi & ~m)) {
+            if ((lo & m) != 0) {
+                AddRuneRangeUTF8(lo, lo | m, foldcase);
+                AddRuneRangeUTF8((lo | m) + 1, hi, foldcase);
+                return;
+            }
+            if ((hi & m) != m) {
+                AddRuneRangeUTF8(lo, (hi & ~m) - 1, foldcase);
+                AddRuneRangeUTF8(hi & ~m, hi, foldcase);
+                return;
+            }
+        }
+    }
+
+    // Finally.  Generate byte matching equivalent for lo-hi.
+    uint8_t ulo[UTFmax], uhi[UTFmax];
+    int n = runetochar(reinterpret_cast<char*>(ulo), &lo);
+    int m = runetochar(reinterpret_cast<char*>(uhi), &hi);
+    (void)m; // USED(m)
+    DCHECK_EQ(n, m);
+
+    // The logic below encodes this thinking:
+    //
+    // 1. When we have built the whole suffix, we know that it cannot
+    // possibly be a suffix of anything longer: in forward mode, nothing
+    // else can occur before the leading byte; in reverse mode, nothing
+    // else can occur after the last continuation byte or else the leading
+    // byte would have to change. Thus, there is no benefit to caching
+    // the first byte of the suffix whereas there is a cost involved in
+    // cloning it if it begins a common prefix, which is fairly likely.
+    //
+    // 2. Conversely, the last byte of the suffix cannot possibly be a
+    // prefix of anything because next == 0, so we will never want to
+    // clone it, but it is fairly likely to be a common suffix. Perhaps
+    // more so in reverse mode than in forward mode because the former is
+    // "converging" towards lower entropy, but caching is still worthwhile
+    // for the latter in cases such as 80-BF.
+    //
+    // 3. Handling the bytes between the first and the last is less
+    // straightforward and, again, the approach depends on whether we are
+    // "converging" towards lower entropy: in forward mode, a single byte
+    // is unlikely to be part of a common suffix whereas a byte range
+    // is more likely so; in reverse mode, a byte range is unlikely to
+    // be part of a common suffix whereas a single byte is more likely
+    // so. The same benefit versus cost argument applies here.
+    int id = 0;
+    if (reversed_) {
+        for (int i = 0; i < n; i++) {
+            // In reverse UTF-8 mode: cache the leading byte; don't cache the last
+            // continuation byte; cache anything else iff it's a single byte (XX-XX).
+            if (i == 0 || (ulo[i] == uhi[i] && i != n - 1))
+                id = CachedRuneByteSuffix(ulo[i], uhi[i], false, id);
+            else
+                id = UncachedRuneByteSuffix(ulo[i], uhi[i], false, id);
+        }
+    } else {
+        for (int i = n - 1; i >= 0; i--) {
+            // In forward UTF-8 mode: don't cache the leading byte; cache the last
+            // continuation byte; cache anything else iff it's a byte range (XX-YY).
+            if (i == n - 1 || (ulo[i] < uhi[i] && i != 0))
+                id = CachedRuneByteSuffix(ulo[i], uhi[i], false, id);
+            else
+                id = UncachedRuneByteSuffix(ulo[i], uhi[i], false, id);
+        }
+    }
+    AddSuffix(id);
+}
+
+// Should not be called.
+Frag Compiler::Copy(Frag arg) {
+    // We're using WalkExponential; there should be no copying.
+    failed_ = true;
+    LOG(DFATAL) << "Compiler::Copy called!";
+    return NoMatch();
+}
+
+// Visits a node quickly; called once WalkExponential has
+// decided to cut this walk short.
+Frag Compiler::ShortVisit(Regexp* re, Frag) {
+    failed_ = true;
+    return NoMatch();
+}
+
+// Called before traversing a node's children during the walk.
+Frag Compiler::PreVisit(Regexp* re, Frag, bool* stop) {
+    // Cut off walk if we've already failed.
+    if (failed_)
+        *stop = true;
+
+    return Frag(); // not used by caller
+}
+
+Frag Compiler::Literal(Rune r, bool foldcase) {
+    switch (encoding_) {
+    default:
+        return Frag();
+
+    case kEncodingLatin1:
+        return ByteRange(r, r, foldcase);
+
+    case kEncodingUTF8: {
+        if (r < Runeself) // Make common case fast.
+            return ByteRange(r, r, foldcase);
+        uint8_t buf[UTFmax];
+        int n = runetochar(reinterpret_cast<char*>(buf), &r);
+        Frag f = ByteRange((uint8_t)buf[0], buf[0], false);
+        for (int i = 1; i < n; i++)
+            f = Cat(f, ByteRange((uint8_t)buf[i], buf[i], false));
+        return f;
+    }
+    }
+}
+
+// Called after traversing the node's children during the walk.
+// Given their frags, build and return the frag for this re.
+Frag Compiler::PostVisit(Regexp* re, Frag, Frag, Frag* child_frags, int nchild_frags) {
+    // If a child failed, don't bother going forward, especially
+    // since the child_frags might contain Frags with NULLs in them.
+    if (failed_)
+        return NoMatch();
+
+    // Given the child fragments, return the fragment for this node.
+    switch (re->op()) {
+    case kRegexpRepeat:
+        // Should not see; code at bottom of function will print error
+        break;
+
+    case kRegexpNoMatch:
+        return NoMatch();
+
+    case kRegexpEmptyMatch:
+        return Nop();
+
+    case kRegexpHaveMatch: {
+        Frag f = Match(re->match_id());
+        if (anchor_ == RE2::ANCHOR_BOTH) {
+            // Append \z or else the subexpression will effectively be unanchored.
+            // Complemented by the UNANCHORED case in CompileSet().
+            f = Cat(EmptyWidth(kEmptyEndText), f);
+        }
+        return f;
+    }
+
+    case kRegexpConcat: {
+        Frag f = child_frags[0];
+        for (int i = 1; i < nchild_frags; i++)
+            f = Cat(f, child_frags[i]);
+        return f;
+    }
+
+    case kRegexpAlternate: {
+        Frag f = child_frags[0];
+        for (int i = 1; i < nchild_frags; i++)
+            f = Alt(f, child_frags[i]);
+        return f;
+    }
+
+    case kRegexpStar:
+        return Star(child_frags[0], (re->parse_flags() & Regexp::NonGreedy) != 0);
+
+    case kRegexpPlus:
+        return Plus(child_frags[0], (re->parse_flags() & Regexp::NonGreedy) != 0);
+
+    case kRegexpQuest:
+        return Quest(child_frags[0], (re->parse_flags() & Regexp::NonGreedy) != 0);
+
+    case kRegexpLiteral:
+        return Literal(re->rune(), (re->parse_flags() & Regexp::FoldCase) != 0);
+
+    case kRegexpLiteralString: {
+        // Concatenation of literals.
+        if (re->nrunes() == 0)
+            return Nop();
+        Frag f;
+        for (int i = 0; i < re->nrunes(); i++) {
+            Frag f1 = Literal(re->runes()[i], (re->parse_flags() & Regexp::FoldCase) != 0);
+            if (i == 0)
+                f = f1;
+            else
+                f = Cat(f, f1);
+        }
+        return f;
+    }
+
+    case kRegexpAnyChar:
+        BeginRange();
+        AddRuneRange(0, Runemax, false);
+        return EndRange();
+
+    case kRegexpAnyByte:
+        return ByteRange(0x00, 0xFF, false);
+
+    case kRegexpCharClass: {
+        CharClass* cc = re->cc();
+        if (cc->empty()) {
+            // This can't happen.
+            failed_ = true;
+            LOG(DFATAL) << "No ranges in char class";
+            return NoMatch();
+        }
+
+        // ASCII case-folding optimization: if the char class
+        // behaves the same on A-Z as it does on a-z,
+        // discard any ranges wholly contained in A-Z
+        // and mark the other ranges as foldascii.
+        // This reduces the size of a program for
+        // (?i)abc from 3 insts per letter to 1 per letter.
+        bool foldascii = cc->FoldsASCII();
+
+        // Character class is just a big OR of the different
+        // character ranges in the class.
+        BeginRange();
+        for (CharClass::iterator i = cc->begin(); i != cc->end(); ++i) {
+            // ASCII case-folding optimization (see above).
+            if (foldascii && 'A' <= i->lo && i->hi <= 'Z')
+                continue;
+
+            // If this range contains all of A-Za-z or none of it,
+            // the fold flag is unnecessary; don't bother.
+            bool fold = foldascii;
+            if ((i->lo <= 'A' && 'z' <= i->hi) || i->hi < 'A' || 'z' < i->lo ||
+                ('Z' < i->lo && i->hi < 'a'))
+                fold = false;
+
+            AddRuneRange(i->lo, i->hi, fold);
+        }
+        return EndRange();
+    }
+
+    case kRegexpCapture:
+        // If this is a non-capturing parenthesis -- (?:foo) --
+        // just use the inner expression.
+        if (re->cap() < 0)
+            return child_frags[0];
+        return Capture(child_frags[0], re->cap());
+
+    case kRegexpBeginLine:
+        return EmptyWidth(reversed_ ? kEmptyEndLine : kEmptyBeginLine);
+
+    case kRegexpEndLine:
+        return EmptyWidth(reversed_ ? kEmptyBeginLine : kEmptyEndLine);
+
+    case kRegexpBeginText:
+        return EmptyWidth(reversed_ ? kEmptyEndText : kEmptyBeginText);
+
+    case kRegexpEndText:
+        return EmptyWidth(reversed_ ? kEmptyBeginText : kEmptyEndText);
+
+    case kRegexpWordBoundary:
+        return EmptyWidth(kEmptyWordBoundary);
+
+    case kRegexpNoWordBoundary:
+        return EmptyWidth(kEmptyNonWordBoundary);
+    }
+    failed_ = true;
+    LOG(DFATAL) << "Missing case in Compiler: " << re->op();
+    return NoMatch();
+}
+
+// Is this regexp required to start at the beginning of the text?
+// Only approximate; can return false for complicated regexps like (\Aa|\Ab),
+// but handles (\A(a|b)).  Could use the Walker to write a more exact one.
+static bool IsAnchorStart(Regexp** pre, int depth) {
+    Regexp* re = *pre;
+    Regexp* sub;
+    // The depth limit makes sure that we don't overflow
+    // the stack on a deeply nested regexp.  As the comment
+    // above says, IsAnchorStart is conservative, so returning
+    // a false negative is okay.  The exact limit is somewhat arbitrary.
+    if (re == NULL || depth >= 4)
+        return false;
+    switch (re->op()) {
+    default:
+        break;
+    case kRegexpConcat:
+        if (re->nsub() > 0) {
+            sub = re->sub()[0]->Incref();
+            if (IsAnchorStart(&sub, depth + 1)) {
+                PODArray<Regexp*> subcopy(re->nsub());
+                subcopy[0] = sub; // already have reference
+                for (int i = 1; i < re->nsub(); i++)
+                    subcopy[i] = re->sub()[i]->Incref();
+                *pre = Regexp::Concat(subcopy.data(), re->nsub(), re->parse_flags());
+                re->Decref();
+                return true;
+            }
+            sub->Decref();
+        }
+        break;
+    case kRegexpCapture:
+        sub = re->sub()[0]->Incref();
+        if (IsAnchorStart(&sub, depth + 1)) {
+            *pre = Regexp::Capture(sub, re->parse_flags(), re->cap());
+            re->Decref();
+            return true;
+        }
+        sub->Decref();
+        break;
+    case kRegexpBeginText:
+        *pre = Regexp::LiteralString(NULL, 0, re->parse_flags());
+        re->Decref();
+        return true;
+    }
+    return false;
+}
+
+// Is this regexp required to start at the end of the text?
+// Only approximate; can return false for complicated regexps like (a\z|b\z),
+// but handles ((a|b)\z).  Could use the Walker to write a more exact one.
+static bool IsAnchorEnd(Regexp** pre, int depth) {
+    Regexp* re = *pre;
+    Regexp* sub;
+    // The depth limit makes sure that we don't overflow
+    // the stack on a deeply nested regexp.  As the comment
+    // above says, IsAnchorEnd is conservative, so returning
+    // a false negative is okay.  The exact limit is somewhat arbitrary.
+    if (re == NULL || depth >= 4)
+        return false;
+    switch (re->op()) {
+    default:
+        break;
+    case kRegexpConcat:
+        if (re->nsub() > 0) {
+            sub = re->sub()[re->nsub() - 1]->Incref();
+            if (IsAnchorEnd(&sub, depth + 1)) {
+                PODArray<Regexp*> subcopy(re->nsub());
+                subcopy[re->nsub() - 1] = sub; // already have reference
+                for (int i = 0; i < re->nsub() - 1; i++)
+                    subcopy[i] = re->sub()[i]->Incref();
+                *pre = Regexp::Concat(subcopy.data(), re->nsub(), re->parse_flags());
+                re->Decref();
+                return true;
+            }
+            sub->Decref();
+        }
+        break;
+    case kRegexpCapture:
+        sub = re->sub()[0]->Incref();
+        if (IsAnchorEnd(&sub, depth + 1)) {
+            *pre = Regexp::Capture(sub, re->parse_flags(), re->cap());
+            re->Decref();
+            return true;
+        }
+        sub->Decref();
+        break;
+    case kRegexpEndText:
+        *pre = Regexp::LiteralString(NULL, 0, re->parse_flags());
+        re->Decref();
+        return true;
+    }
+    return false;
+}
+
+void Compiler::Setup(Regexp::ParseFlags flags, int64_t max_mem, RE2::Anchor anchor) {
+    if (flags & Regexp::Latin1)
+        encoding_ = kEncodingLatin1;
+    max_mem_ = max_mem;
+    if (max_mem <= 0) {
+        max_ninst_ = 100000; // more than enough
+    } else if (static_cast<size_t>(max_mem) <= sizeof(Prog)) {
+        // No room for anything.
+        max_ninst_ = 0;
+    } else {
+        int64_t m = (max_mem - sizeof(Prog)) / sizeof(Prog::Inst);
+        // Limit instruction count so that inst->id() fits nicely in an int.
+        // SparseArray also assumes that the indices (inst->id()) are ints.
+        // The call to WalkExponential uses 2*max_ninst_ below,
+        // and other places in the code use 2 or 3 * prog->size().
+        // Limiting to 2^24 should avoid overflow in those places.
+        // (The point of allowing more than 32 bits of memory is to
+        // have plenty of room for the DFA states, not to use it up
+        // on the program.)
+        if (m >= 1 << 24)
+            m = 1 << 24;
+        // Inst imposes its own limit (currently bigger than 2^24 but be safe).
+        if (m > Prog::Inst::kMaxInst)
+            m = Prog::Inst::kMaxInst;
+        max_ninst_ = static_cast<int>(m);
+    }
+    anchor_ = anchor;
+}
+
+// Compiles re, returning program.
+// Caller is responsible for deleting prog_.
+// If reversed is true, compiles a program that expects
+// to run over the input string backward (reverses all concatenations).
+// The reversed flag is also recorded in the returned program.
+Prog* Compiler::Compile(Regexp* re, bool reversed, int64_t max_mem) {
+    Compiler c;
+    c.Setup(re->parse_flags(), max_mem, RE2::UNANCHORED /* unused */);
+    c.reversed_ = reversed;
+
+    // Simplify to remove things like counted repetitions
+    // and character classes like \d.
+    Regexp* sre = re->Simplify();
+    if (sre == NULL)
+        return NULL;
+
+    // Record whether prog is anchored, removing the anchors.
+    // (They get in the way of other optimizations.)
+    bool is_anchor_start = IsAnchorStart(&sre, 0);
+    bool is_anchor_end = IsAnchorEnd(&sre, 0);
+
+    // Generate fragment for entire regexp.
+    Frag all = c.WalkExponential(sre, Frag(), 2 * c.max_ninst_);
+    sre->Decref();
+    if (c.failed_)
+        return NULL;
+
+    // Success!  Finish by putting Match node at end, and record start.
+    // Turn off c.reversed_ (if it is set) to force the remaining concatenations
+    // to behave normally.
+    c.reversed_ = false;
+    all = c.Cat(all, c.Match(0));
+
+    c.prog_->set_reversed(reversed);
+    if (c.prog_->reversed()) {
+        c.prog_->set_anchor_start(is_anchor_end);
+        c.prog_->set_anchor_end(is_anchor_start);
+    } else {
+        c.prog_->set_anchor_start(is_anchor_start);
+        c.prog_->set_anchor_end(is_anchor_end);
+    }
+
+    c.prog_->set_start(all.begin);
+    if (!c.prog_->anchor_start()) {
+        // Also create unanchored version, which starts with a .*? loop.
+        all = c.Cat(c.DotStar(), all);
+    }
+    c.prog_->set_start_unanchored(all.begin);
+
+    // Hand ownership of prog_ to caller.
+    return c.Finish(re);
+}
+
+Prog* Compiler::Finish(Regexp* re) {
+    if (failed_)
+        return NULL;
+
+    if (prog_->start() == 0 && prog_->start_unanchored() == 0) {
+        // No possible matches; keep Fail instruction only.
+        ninst_ = 1;
+    }
+
+    // Hand off the array to Prog.
+    prog_->inst_ = std::move(inst_);
+    prog_->size_ = ninst_;
+
+    prog_->Optimize();
+    prog_->Flatten();
+    prog_->ComputeByteMap();
+
+    if (!prog_->reversed()) {
+        std::string prefix;
+        bool prefix_foldcase;
+        if (re->RequiredPrefixForAccel(&prefix, &prefix_foldcase))
+            prog_->ConfigurePrefixAccel(prefix, prefix_foldcase);
+    }
+
+    // Record remaining memory for DFA.
+    if (max_mem_ <= 0) {
+        prog_->set_dfa_mem(1 << 20);
+    } else {
+        int64_t m = max_mem_ - sizeof(Prog);
+        m -= prog_->size_ * sizeof(Prog::Inst); // account for inst_
+        if (prog_->CanBitState())
+            m -= prog_->size_ * sizeof(uint16_t); // account for list_heads_
+        if (m < 0)
+            m = 0;
+        prog_->set_dfa_mem(m);
+    }
+
+    Prog* p = prog_;
+    prog_ = NULL;
+    return p;
+}
+
+// Converts Regexp to Prog.
+Prog* Regexp::CompileToProg(int64_t max_mem) {
+    return Compiler::Compile(this, false, max_mem);
+}
+
+Prog* Regexp::CompileToReverseProg(int64_t max_mem) {
+    return Compiler::Compile(this, true, max_mem);
+}
+
+Frag Compiler::DotStar() {
+    return Star(ByteRange(0x00, 0xff, false), true);
+}
+
+// Compiles RE set to Prog.
+Prog* Compiler::CompileSet(Regexp* re, RE2::Anchor anchor, int64_t max_mem) {
+    Compiler c;
+    c.Setup(re->parse_flags(), max_mem, anchor);
+
+    Regexp* sre = re->Simplify();
+    if (sre == NULL)
+        return NULL;
+
+    Frag all = c.WalkExponential(sre, Frag(), 2 * c.max_ninst_);
+    sre->Decref();
+    if (c.failed_)
+        return NULL;
+
+    c.prog_->set_anchor_start(true);
+    c.prog_->set_anchor_end(true);
+
+    if (anchor == RE2::UNANCHORED) {
+        // Prepend .* or else the expression will effectively be anchored.
+        // Complemented by the ANCHOR_BOTH case in PostVisit().
+        all = c.Cat(c.DotStar(), all);
+    }
+    c.prog_->set_start(all.begin);
+    c.prog_->set_start_unanchored(all.begin);
+
+    Prog* prog = c.Finish(re);
+    if (prog == NULL)
+        return NULL;
+
+    // Make sure DFA has enough memory to operate,
+    // since we're not going to fall back to the NFA.
+    bool dfa_failed = false;
+    StringPiece sp = "hello, world";
+    prog->SearchDFA(sp, sp, Prog::kAnchored, Prog::kManyMatch, NULL, &dfa_failed, NULL);
+    if (dfa_failed) {
+        delete prog;
+        return NULL;
+    }
+
+    return prog;
+}
+
+Prog* Prog::CompileSet(Regexp* re, RE2::Anchor anchor, int64_t max_mem) {
+    return Compiler::CompileSet(re, anchor, max_mem);
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/dfa.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/dfa.cpp
new file mode 100644
index 0000000000..0a493d66bd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/dfa.cpp
@@ -0,0 +1,2062 @@
+// Copyright 2008 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// A DFA (deterministic finite automaton)-based regular expression search.
+//
+// The DFA search has two main parts: the construction of the automaton,
+// which is represented by a graph of State structures, and the execution
+// of the automaton over a given input string.
+//
+// The basic idea is that the State graph is constructed so that the
+// execution can simply start with a state s, and then for each byte c in
+// the input string, execute "s = s->next[c]", checking at each point whether
+// the current s represents a matching state.
+//
+// The simple explanation just given does convey the essence of this code,
+// but it omits the details of how the State graph gets constructed as well
+// as some performance-driven optimizations to the execution of the automaton.
+// All these details are explained in the comments for the code following
+// the definition of class DFA.
+//
+// See http://swtch.com/~rsc/regexp/ for a very bare-bones equivalent.
+
+#include <stddef.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <string.h>
+
+#include <algorithm>
+#include <atomic>
+#include <deque>
+#include <mutex>
+#include <new>
+#include <string>
+#include <unordered_map>
+#include <unordered_set>
+#include <utility>
+#include <vector>
+
+#include "logging.h"
+#include "mix.h"
+#include "mutex.h"
+#include "pod_array.h"
+#include "prog.h"
+#include "re2.h"
+#include "sparse_set.h"
+#include "stringpiece.h"
+#include "strutil.h"
+
+// Silence "zero-sized array in struct/union" warning for DFA::State::next_.
+#ifdef _MSC_VER
+#pragma warning(disable : 4200)
+#endif
+
+namespace lbug {
+namespace regex {
+
+// Controls whether the DFA should bail out early if the NFA would be faster.
+static bool dfa_should_bail_when_slow = true;
+
+void Prog::TESTING_ONLY_set_dfa_should_bail_when_slow(bool b) {
+    dfa_should_bail_when_slow = b;
+}
+
+// Changing this to true compiles in prints that trace execution of the DFA.
+// Generates a lot of output -- only useful for debugging.
+static const bool ExtraDebug = false;
+
+// A DFA implementation of a regular expression program.
+// Since this is entirely a forward declaration mandated by C++,
+// some of the comments here are better understood after reading
+// the comments in the sections that follow the DFA definition.
+class DFA {
+public:
+    DFA(Prog* prog, Prog::MatchKind kind, int64_t max_mem);
+    ~DFA();
+    bool ok() const { return !init_failed_; }
+    Prog::MatchKind kind() { return kind_; }
+
+    // Searches for the regular expression in text, which is considered
+    // as a subsection of context for the purposes of interpreting flags
+    // like ^ and $ and \A and \z.
+    // Returns whether a match was found.
+    // If a match is found, sets *ep to the end point of the best match in text.
+    // If "anchored", the match must begin at the start of text.
+    // If "want_earliest_match", the match that ends first is used, not
+    //   necessarily the best one.
+    // If "run_forward" is true, the DFA runs from text.begin() to text.end().
+    //   If it is false, the DFA runs from text.end() to text.begin(),
+    //   returning the leftmost end of the match instead of the rightmost one.
+    // If the DFA cannot complete the search (for example, if it is out of
+    //   memory), it sets *failed and returns false.
+    bool Search(const StringPiece& text, const StringPiece& context, bool anchored,
+        bool want_earliest_match, bool run_forward, bool* failed, const char** ep,
+        SparseSet* matches);
+
+    // Builds out all states for the entire DFA.
+    // If cb is not empty, it receives one callback per state built.
+    // Returns the number of states built.
+    // FOR TESTING OR EXPERIMENTAL PURPOSES ONLY.
+    int BuildAllStates(const Prog::DFAStateCallback& cb);
+
+    // Computes min and max for matching strings.  Won't return strings
+    // bigger than maxlen.
+    bool PossibleMatchRange(std::string* min, std::string* max, int maxlen);
+
+    // These data structures are logically private, but C++ makes it too
+    // difficult to mark them as such.
+    class RWLocker;
+    class StateSaver;
+    class Workq;
+
+    // A single DFA state.  The DFA is represented as a graph of these
+    // States, linked by the next_ pointers.  If in state s and reading
+    // byte c, the next state should be s->next_[c].
+    struct State {
+        inline bool IsMatch() const { return (flag_ & kFlagMatch) != 0; }
+
+        int* inst_;     // Instruction pointers in the state.
+        int ninst_;     // # of inst_ pointers.
+        uint32_t flag_; // Empty string bitfield flags in effect on the way
+                        // into this state, along with kFlagMatch if this
+                        // is a matching state.
+
+// Work around the bug affecting flexible array members in GCC 6.x (for x >= 1).
+// (https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70932)
+#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ == 6 && __GNUC_MINOR__ >= 1
+        std::atomic<State*> next_[0]; // Outgoing arrows from State,
+#else
+        std::atomic<State*> next_[]; // Outgoing arrows from State,
+#endif
+
+        // one per input byte class
+    };
+
+    enum {
+        kByteEndText = 256, // imaginary byte at end of text
+
+        kFlagEmptyMask = 0xFF,  // State.flag_: bits holding kEmptyXXX flags
+        kFlagMatch = 0x0100,    // State.flag_: this is a matching state
+        kFlagLastWord = 0x0200, // State.flag_: last byte was a word char
+        kFlagNeedShift = 16,    // needed kEmpty bits are or'ed in shifted left
+    };
+
+    struct StateHash {
+        size_t operator()(const State* a) const {
+            DCHECK(a != NULL);
+            HashMix mix(a->flag_);
+            for (int i = 0; i < a->ninst_; i++)
+                mix.Mix(a->inst_[i]);
+            mix.Mix(0);
+            return mix.get();
+        }
+    };
+
+    struct StateEqual {
+        bool operator()(const State* a, const State* b) const {
+            DCHECK(a != NULL);
+            DCHECK(b != NULL);
+            if (a == b)
+                return true;
+            if (a->flag_ != b->flag_)
+                return false;
+            if (a->ninst_ != b->ninst_)
+                return false;
+            for (int i = 0; i < a->ninst_; i++)
+                if (a->inst_[i] != b->inst_[i])
+                    return false;
+            return true;
+        }
+    };
+
+    typedef std::unordered_set<State*, StateHash, StateEqual> StateSet;
+
+private:
+    // Make it easier to swap in a scalable reader-writer mutex.
+    using CacheMutex = Mutex;
+
+    enum {
+        // Indices into start_ for unanchored searches.
+        // Add kStartAnchored for anchored searches.
+        kStartBeginText = 0,        // text at beginning of context
+        kStartBeginLine = 2,        // text at beginning of line
+        kStartAfterWordChar = 4,    // text follows a word character
+        kStartAfterNonWordChar = 6, // text follows non-word character
+        kMaxStart = 8,
+
+        kStartAnchored = 1,
+    };
+
+    // Resets the DFA State cache, flushing all saved State* information.
+    // Releases and reacquires cache_mutex_ via cache_lock, so any
+    // State* existing before the call are not valid after the call.
+    // Use a StateSaver to preserve important states across the call.
+    // cache_mutex_.r <= L < mutex_
+    // After: cache_mutex_.w <= L < mutex_
+    void ResetCache(RWLocker* cache_lock);
+
+    // Looks up and returns the State corresponding to a Workq.
+    // L >= mutex_
+    State* WorkqToCachedState(Workq* q, Workq* mq, uint32_t flag);
+
+    // Looks up and returns a State matching the inst, ninst, and flag.
+    // L >= mutex_
+    State* CachedState(int* inst, int ninst, uint32_t flag);
+
+    // Clear the cache entirely.
+    // Must hold cache_mutex_.w or be in destructor.
+    void ClearCache();
+
+    // Converts a State into a Workq: the opposite of WorkqToCachedState.
+    // L >= mutex_
+    void StateToWorkq(State* s, Workq* q);
+
+    // Runs a State on a given byte, returning the next state.
+    State* RunStateOnByteUnlocked(State*, int); // cache_mutex_.r <= L < mutex_
+    State* RunStateOnByte(State*, int);         // L >= mutex_
+
+    // Runs a Workq on a given byte followed by a set of empty-string flags,
+    // producing a new Workq in nq.  If a match instruction is encountered,
+    // sets *ismatch to true.
+    // L >= mutex_
+    void RunWorkqOnByte(Workq* q, Workq* nq, int c, uint32_t flag, bool* ismatch);
+
+    // Runs a Workq on a set of empty-string flags, producing a new Workq in nq.
+    // L >= mutex_
+    void RunWorkqOnEmptyString(Workq* q, Workq* nq, uint32_t flag);
+
+    // Adds the instruction id to the Workq, following empty arrows
+    // according to flag.
+    // L >= mutex_
+    void AddToQueue(Workq* q, int id, uint32_t flag);
+
+    // For debugging, returns a text representation of State.
+    static std::string DumpState(State* state);
+
+    // For debugging, returns a text representation of a Workq.
+    static std::string DumpWorkq(Workq* q);
+
+    // Search parameters
+    struct SearchParams {
+        SearchParams(const StringPiece& text, const StringPiece& context, RWLocker* cache_lock)
+            : text(text), context(context), anchored(false), can_prefix_accel(false),
+              want_earliest_match(false), run_forward(false), start(NULL), cache_lock(cache_lock),
+              failed(false), ep(NULL), matches(NULL) {}
+
+        StringPiece text;
+        StringPiece context;
+        bool anchored;
+        bool can_prefix_accel;
+        bool want_earliest_match;
+        bool run_forward;
+        State* start;
+        RWLocker* cache_lock;
+        bool failed;    // "out" parameter: whether search gave up
+        const char* ep; // "out" parameter: end pointer for match
+        SparseSet* matches;
+
+    private:
+        SearchParams(const SearchParams&) = delete;
+        SearchParams& operator=(const SearchParams&) = delete;
+    };
+
+    // Before each search, the parameters to Search are analyzed by
+    // AnalyzeSearch to determine the state in which to start.
+    struct StartInfo {
+        StartInfo() : start(NULL) {}
+        std::atomic<State*> start;
+    };
+
+    // Fills in params->start and params->can_prefix_accel using
+    // the other search parameters.  Returns true on success,
+    // false on failure.
+    // cache_mutex_.r <= L < mutex_
+    bool AnalyzeSearch(SearchParams* params);
+    bool AnalyzeSearchHelper(SearchParams* params, StartInfo* info, uint32_t flags);
+
+    // The generic search loop, inlined to create specialized versions.
+    // cache_mutex_.r <= L < mutex_
+    // Might unlock and relock cache_mutex_ via params->cache_lock.
+    template<bool can_prefix_accel, bool want_earliest_match, bool run_forward>
+    inline bool InlinedSearchLoop(SearchParams* params);
+
+    // The specialized versions of InlinedSearchLoop.  The three letters
+    // at the ends of the name denote the true/false values used as the
+    // last three parameters of InlinedSearchLoop.
+    // cache_mutex_.r <= L < mutex_
+    // Might unlock and relock cache_mutex_ via params->cache_lock.
+    bool SearchFFF(SearchParams* params);
+    bool SearchFFT(SearchParams* params);
+    bool SearchFTF(SearchParams* params);
+    bool SearchFTT(SearchParams* params);
+    bool SearchTFF(SearchParams* params);
+    bool SearchTFT(SearchParams* params);
+    bool SearchTTF(SearchParams* params);
+    bool SearchTTT(SearchParams* params);
+
+    // The main search loop: calls an appropriate specialized version of
+    // InlinedSearchLoop.
+    // cache_mutex_.r <= L < mutex_
+    // Might unlock and relock cache_mutex_ via params->cache_lock.
+    bool FastSearchLoop(SearchParams* params);
+
+    // Looks up bytes in bytemap_ but handles case c == kByteEndText too.
+    int ByteMap(int c) {
+        if (c == kByteEndText)
+            return prog_->bytemap_range();
+        return prog_->bytemap()[c];
+    }
+
+    // Constant after initialization.
+    Prog* prog_;           // The regular expression program to run.
+    Prog::MatchKind kind_; // The kind of DFA.
+    bool init_failed_;     // initialization failed (out of memory)
+
+    Mutex mutex_; // mutex_ >= cache_mutex_.r
+
+    // Scratch areas, protected by mutex_.
+    Workq* q0_; // Two pre-allocated work queues.
+    Workq* q1_;
+    PODArray<int> stack_; // Pre-allocated stack for AddToQueue
+
+    // State* cache.  Many threads use and add to the cache simultaneously,
+    // holding cache_mutex_ for reading and mutex_ (above) when adding.
+    // If the cache fills and needs to be discarded, the discarding is done
+    // while holding cache_mutex_ for writing, to avoid interrupting other
+    // readers.  Any State* pointers are only valid while cache_mutex_
+    // is held.
+    CacheMutex cache_mutex_;
+    int64_t mem_budget_;   // Total memory budget for all States.
+    int64_t state_budget_; // Amount of memory remaining for new States.
+    StateSet state_cache_; // All States computed so far.
+    StartInfo start_[kMaxStart];
+
+    DFA(const DFA&) = delete;
+    DFA& operator=(const DFA&) = delete;
+};
+
+// Shorthand for casting to uint8_t*.
+static inline const uint8_t* BytePtr(const void* v) {
+    return reinterpret_cast<const uint8_t*>(v);
+}
+
+// Work queues
+
+// Marks separate thread groups of different priority
+// in the work queue when in leftmost-longest matching mode.
+#define Mark (-1)
+
+// Separates the match IDs from the instructions in inst_.
+// Used only for "many match" DFA states.
+#define MatchSep (-2)
+
+// Internally, the DFA uses a sparse array of
+// program instruction pointers as a work queue.
+// In leftmost longest mode, marks separate sections
+// of workq that started executing at different
+// locations in the string (earlier locations first).
+class DFA::Workq : public SparseSet {
+public:
+    // Constructor: n is number of normal slots, maxmark number of mark slots.
+    Workq(int n, int maxmark)
+        : SparseSet(n + maxmark), n_(n), maxmark_(maxmark), nextmark_(n), last_was_mark_(true) {}
+
+    bool is_mark(int i) { return i >= n_; }
+
+    int maxmark() { return maxmark_; }
+
+    void clear() {
+        SparseSet::clear();
+        nextmark_ = n_;
+    }
+
+    void mark() {
+        if (last_was_mark_)
+            return;
+        last_was_mark_ = false;
+        SparseSet::insert_new(nextmark_++);
+    }
+
+    int size() { return n_ + maxmark_; }
+
+    void insert(int id) {
+        if (contains(id))
+            return;
+        insert_new(id);
+    }
+
+    void insert_new(int id) {
+        last_was_mark_ = false;
+        SparseSet::insert_new(id);
+    }
+
+private:
+    int n_;              // size excluding marks
+    int maxmark_;        // maximum number of marks
+    int nextmark_;       // id of next mark
+    bool last_was_mark_; // last inserted was mark
+
+    Workq(const Workq&) = delete;
+    Workq& operator=(const Workq&) = delete;
+};
+
+DFA::DFA(Prog* prog, Prog::MatchKind kind, int64_t max_mem)
+    : prog_(prog), kind_(kind), init_failed_(false), q0_(NULL), q1_(NULL), mem_budget_(max_mem) {
+    if (ExtraDebug)
+        fprintf(stderr, "\nkind %d\n%s\n", kind_, prog_->DumpUnanchored().c_str());
+    int nmark = 0;
+    if (kind_ == Prog::kLongestMatch)
+        nmark = prog_->size();
+    // See DFA::AddToQueue() for why this is so.
+    int nstack = prog_->inst_count(kInstCapture) + prog_->inst_count(kInstEmptyWidth) +
+                 prog_->inst_count(kInstNop) + nmark + 1; // + 1 for start inst
+
+    // Account for space needed for DFA, q0, q1, stack.
+    mem_budget_ -= sizeof(DFA);
+    mem_budget_ -= (prog_->size() + nmark) * (sizeof(int) + sizeof(int)) * 2; // q0, q1
+    mem_budget_ -= nstack * sizeof(int);                                      // stack
+    if (mem_budget_ < 0) {
+        init_failed_ = true;
+        return;
+    }
+
+    state_budget_ = mem_budget_;
+
+    // Make sure there is a reasonable amount of working room left.
+    // At minimum, the search requires room for two states in order
+    // to limp along, restarting frequently.  We'll get better performance
+    // if there is room for a larger number of states, say 20.
+    // Note that a state stores list heads only, so we use the program
+    // list count for the upper bound, not the program size.
+    int nnext = prog_->bytemap_range() + 1; // + 1 for kByteEndText slot
+    int64_t one_state = sizeof(State) + nnext * sizeof(std::atomic<State*>) +
+                        (prog_->list_count() + nmark) * sizeof(int);
+    if (state_budget_ < 20 * one_state) {
+        init_failed_ = true;
+        return;
+    }
+
+    q0_ = new Workq(prog_->size(), nmark);
+    q1_ = new Workq(prog_->size(), nmark);
+    stack_ = PODArray<int>(nstack);
+}
+
+DFA::~DFA() {
+    delete q0_;
+    delete q1_;
+    ClearCache();
+}
+
+// In the DFA state graph, s->next[c] == NULL means that the
+// state has not yet been computed and needs to be.  We need
+// a different special value to signal that s->next[c] is a
+// state that can never lead to a match (and thus the search
+// can be called off).  Hence DeadState.
+#define DeadState reinterpret_cast<State*>(1)
+
+// Signals that the rest of the string matches no matter what it is.
+#define FullMatchState reinterpret_cast<State*>(2)
+
+#define SpecialStateMax FullMatchState
+
+// Debugging printouts
+
+// For debugging, returns a string representation of the work queue.
+std::string DFA::DumpWorkq(Workq* q) {
+    std::string s;
+    const char* sep = "";
+    for (Workq::iterator it = q->begin(); it != q->end(); ++it) {
+        if (q->is_mark(*it)) {
+            s += "|";
+            sep = "";
+        } else {
+            s += StringPrintf("%s%d", sep, *it);
+            sep = ",";
+        }
+    }
+    return s;
+}
+
+// For debugging, returns a string representation of the state.
+std::string DFA::DumpState(State* state) {
+    if (state == NULL)
+        return "_";
+    if (state == DeadState)
+        return "X";
+    if (state == FullMatchState)
+        return "*";
+    std::string s;
+    const char* sep = "";
+    s += StringPrintf("(%p)", state);
+    for (int i = 0; i < state->ninst_; i++) {
+        if (state->inst_[i] == Mark) {
+            s += "|";
+            sep = "";
+        } else if (state->inst_[i] == MatchSep) {
+            s += "||";
+            sep = "";
+        } else {
+            s += StringPrintf("%s%d", sep, state->inst_[i]);
+            sep = ",";
+        }
+    }
+    s += StringPrintf(" flag=%#x", state->flag_);
+    return s;
+}
+
+//////////////////////////////////////////////////////////////////////
+//
+// DFA state graph construction.
+//
+// The DFA state graph is a heavily-linked collection of State* structures.
+// The state_cache_ is a set of all the State structures ever allocated,
+// so that if the same state is reached by two different paths,
+// the same State structure can be used.  This reduces allocation
+// requirements and also avoids duplication of effort across the two
+// identical states.
+//
+// A State is defined by an ordered list of instruction ids and a flag word.
+//
+// The choice of an ordered list of instructions differs from a typical
+// textbook DFA implementation, which would use an unordered set.
+// Textbook descriptions, however, only care about whether
+// the DFA matches, not where it matches in the text.  To decide where the
+// DFA matches, we need to mimic the behavior of the dominant backtracking
+// implementations like PCRE, which try one possible regular expression
+// execution, then another, then another, stopping when one of them succeeds.
+// The DFA execution tries these many executions in parallel, representing
+// each by an instruction id.  These pointers are ordered in the State.inst_
+// list in the same order that the executions would happen in a backtracking
+// search: if a match is found during execution of inst_[2], inst_[i] for i>=3
+// can be discarded.
+//
+// Textbooks also typically do not consider context-aware empty string operators
+// like ^ or $.  These are handled by the flag word, which specifies the set
+// of empty-string operators that should be matched when executing at the
+// current text position.  These flag bits are defined in prog.h.
+// The flag word also contains two DFA-specific bits: kFlagMatch if the state
+// is a matching state (one that reached a kInstMatch in the program)
+// and kFlagLastWord if the last processed byte was a word character, for the
+// implementation of \B and \b.
+//
+// The flag word also contains, shifted up 16 bits, the bits looked for by
+// any kInstEmptyWidth instructions in the state.  These provide a useful
+// summary indicating when new flags might be useful.
+//
+// The permanent representation of a State's instruction ids is just an array,
+// but while a state is being analyzed, these instruction ids are represented
+// as a Workq, which is an array that allows iteration in insertion order.
+
+// NOTE(rsc): The choice of State construction determines whether the DFA
+// mimics backtracking implementations (so-called leftmost first matching) or
+// traditional DFA implementations (so-called leftmost longest matching as
+// prescribed by POSIX).  This implementation chooses to mimic the
+// backtracking implementations, because we want to replace PCRE.  To get
+// POSIX behavior, the states would need to be considered not as a simple
+// ordered list of instruction ids, but as a list of unordered sets of instruction
+// ids.  A match by a state in one set would inhibit the running of sets
+// farther down the list but not other instruction ids in the same set.  Each
+// set would correspond to matches beginning at a given point in the string.
+// This is implemented by separating different sets with Mark pointers.
+
+// Looks in the State cache for a State matching q, flag.
+// If one is found, returns it.  If one is not found, allocates one,
+// inserts it in the cache, and returns it.
+// If mq is not null, MatchSep and the match IDs in mq will be appended
+// to the State.
+DFA::State* DFA::WorkqToCachedState(Workq* q, Workq* mq, uint32_t flag) {
+    // mutex_.AssertHeld();
+
+    // Construct array of instruction ids for the new state.
+    // Only ByteRange, EmptyWidth, and Match instructions are useful to keep:
+    // those are the only operators with any effect in
+    // RunWorkqOnEmptyString or RunWorkqOnByte.
+    PODArray<int> inst(q->size());
+    int n = 0;
+    uint32_t needflags = 0; // flags needed by kInstEmptyWidth instructions
+    bool sawmatch = false;  // whether queue contains guaranteed kInstMatch
+    bool sawmark = false;   // whether queue contains a Mark
+    if (ExtraDebug)
+        fprintf(stderr, "WorkqToCachedState %s [%#x]", DumpWorkq(q).c_str(), flag);
+    for (Workq::iterator it = q->begin(); it != q->end(); ++it) {
+        int id = *it;
+        if (sawmatch && (kind_ == Prog::kFirstMatch || q->is_mark(id)))
+            break;
+        if (q->is_mark(id)) {
+            if (n > 0 && inst[n - 1] != Mark) {
+                sawmark = true;
+                inst[n++] = Mark;
+            }
+            continue;
+        }
+        Prog::Inst* ip = prog_->inst(id);
+        switch (ip->opcode()) {
+        case kInstAltMatch:
+            // This state will continue to a match no matter what
+            // the rest of the input is.  If it is the highest priority match
+            // being considered, return the special FullMatchState
+            // to indicate that it's all matches from here out.
+            if (kind_ != Prog::kManyMatch &&
+                (kind_ != Prog::kFirstMatch || (it == q->begin() && ip->greedy(prog_))) &&
+                (kind_ != Prog::kLongestMatch || !sawmark) && (flag & kFlagMatch)) {
+                if (ExtraDebug)
+                    fprintf(stderr, " -> FullMatchState\n");
+                return FullMatchState;
+            }
+            FALLTHROUGH_INTENDED;
+        default:
+            // Record iff id is the head of its list, which must
+            // be the case if id-1 is the last of *its* list. :)
+            if (prog_->inst(id - 1)->last())
+                inst[n++] = *it;
+            if (ip->opcode() == kInstEmptyWidth)
+                needflags |= ip->empty();
+            if (ip->opcode() == kInstMatch && !prog_->anchor_end())
+                sawmatch = true;
+            break;
+        }
+    }
+    DCHECK_LE(n, q->size());
+    if (n > 0 && inst[n - 1] == Mark)
+        n--;
+
+    // If there are no empty-width instructions waiting to execute,
+    // then the extra flag bits will not be used, so there is no
+    // point in saving them.  (Discarding them reduces the number
+    // of distinct states.)
+    if (needflags == 0)
+        flag &= kFlagMatch;
+
+    // NOTE(rsc): The code above cannot do flag &= needflags,
+    // because if the right flags were present to pass the current
+    // kInstEmptyWidth instructions, new kInstEmptyWidth instructions
+    // might be reached that in turn need different flags.
+    // The only sure thing is that if there are no kInstEmptyWidth
+    // instructions at all, no flags will be needed.
+    // We could do the extra work to figure out the full set of
+    // possibly needed flags by exploring past the kInstEmptyWidth
+    // instructions, but the check above -- are any flags needed
+    // at all? -- handles the most common case.  More fine-grained
+    // analysis can only be justified by measurements showing that
+    // too many redundant states are being allocated.
+
+    // If there are no Insts in the list, it's a dead state,
+    // which is useful to signal with a special pointer so that
+    // the execution loop can stop early.  This is only okay
+    // if the state is *not* a matching state.
+    if (n == 0 && flag == 0) {
+        if (ExtraDebug)
+            fprintf(stderr, " -> DeadState\n");
+        return DeadState;
+    }
+
+    // If we're in longest match mode, the state is a sequence of
+    // unordered state sets separated by Marks.  Sort each set
+    // to canonicalize, to reduce the number of distinct sets stored.
+    if (kind_ == Prog::kLongestMatch) {
+        int* ip = inst.data();
+        int* ep = ip + n;
+        while (ip < ep) {
+            int* markp = ip;
+            while (markp < ep && *markp != Mark)
+                markp++;
+            std::sort(ip, markp);
+            if (markp < ep)
+                markp++;
+            ip = markp;
+        }
+    }
+
+    // If we're in many match mode, canonicalize for similar reasons:
+    // we have an unordered set of states (i.e. we don't have Marks)
+    // and sorting will reduce the number of distinct sets stored.
+    if (kind_ == Prog::kManyMatch) {
+        int* ip = inst.data();
+        int* ep = ip + n;
+        std::sort(ip, ep);
+    }
+
+    // Append MatchSep and the match IDs in mq if necessary.
+    if (mq != NULL) {
+        inst[n++] = MatchSep;
+        for (Workq::iterator i = mq->begin(); i != mq->end(); ++i) {
+            int id = *i;
+            Prog::Inst* ip = prog_->inst(id);
+            if (ip->opcode() == kInstMatch)
+                inst[n++] = ip->match_id();
+        }
+    }
+
+    // Save the needed empty-width flags in the top bits for use later.
+    flag |= needflags << kFlagNeedShift;
+
+    State* state = CachedState(inst.data(), n, flag);
+    return state;
+}
+
+// Looks in the State cache for a State matching inst, ninst, flag.
+// If one is found, returns it.  If one is not found, allocates one,
+// inserts it in the cache, and returns it.
+DFA::State* DFA::CachedState(int* inst, int ninst, uint32_t flag) {
+    // mutex_.AssertHeld();
+
+    // Look in the cache for a pre-existing state.
+    // We have to initialise the struct like this because otherwise
+    // MSVC will complain about the flexible array member. :(
+    State state;
+    state.inst_ = inst;
+    state.ninst_ = ninst;
+    state.flag_ = flag;
+    StateSet::iterator it = state_cache_.find(&state);
+    if (it != state_cache_.end()) {
+        if (ExtraDebug)
+            fprintf(stderr, " -cached-> %s\n", DumpState(*it).c_str());
+        return *it;
+    }
+
+    // Must have enough memory for new state.
+    // In addition to what we're going to allocate,
+    // the state cache hash table seems to incur about 40 bytes per
+    // State*, empirically.
+    const int kStateCacheOverhead = 40;
+    int nnext = prog_->bytemap_range() + 1; // + 1 for kByteEndText slot
+    int mem = sizeof(State) + nnext * sizeof(std::atomic<State*>) + ninst * sizeof(int);
+    if (mem_budget_ < mem + kStateCacheOverhead) {
+        mem_budget_ = -1;
+        return NULL;
+    }
+    mem_budget_ -= mem + kStateCacheOverhead;
+
+    // Allocate new state along with room for next_ and inst_.
+    char* space = std::allocator<char>().allocate(mem);
+    State* s = new (space) State;
+    (void)new (s->next_) std::atomic<State*>[ nnext ];
+    // Work around a unfortunate bug in older versions of libstdc++.
+    // (https://gcc.gnu.org/bugzilla/show_bug.cgi?id=64658)
+    for (int i = 0; i < nnext; i++)
+        (void)new (s->next_ + i) std::atomic<State*>(NULL);
+    s->inst_ = new (s->next_ + nnext) int[ninst];
+    memmove(s->inst_, inst, ninst * sizeof s->inst_[0]);
+    s->ninst_ = ninst;
+    s->flag_ = flag;
+    if (ExtraDebug)
+        fprintf(stderr, " -> %s\n", DumpState(s).c_str());
+
+    // Put state in cache and return it.
+    state_cache_.insert(s);
+    return s;
+}
+
+// Clear the cache.  Must hold cache_mutex_.w or be in destructor.
+void DFA::ClearCache() {
+    StateSet::iterator begin = state_cache_.begin();
+    StateSet::iterator end = state_cache_.end();
+    while (begin != end) {
+        StateSet::iterator tmp = begin;
+        ++begin;
+        // Deallocate the blob of memory that we allocated in DFA::CachedState().
+        // We recompute mem in order to benefit from sized delete where possible.
+        int ninst = (*tmp)->ninst_;
+        int nnext = prog_->bytemap_range() + 1; // + 1 for kByteEndText slot
+        int mem = sizeof(State) + nnext * sizeof(std::atomic<State*>) + ninst * sizeof(int);
+        std::allocator<char>().deallocate(reinterpret_cast<char*>(*tmp), mem);
+    }
+    state_cache_.clear();
+}
+
+// Copies insts in state s to the work queue q.
+void DFA::StateToWorkq(State* s, Workq* q) {
+    q->clear();
+    for (int i = 0; i < s->ninst_; i++) {
+        if (s->inst_[i] == Mark) {
+            q->mark();
+        } else if (s->inst_[i] == MatchSep) {
+            // Nothing after this is an instruction!
+            break;
+        } else {
+            // Explore from the head of the list.
+            AddToQueue(q, s->inst_[i], s->flag_ & kFlagEmptyMask);
+        }
+    }
+}
+
+// Adds ip to the work queue, following empty arrows according to flag.
+void DFA::AddToQueue(Workq* q, int id, uint32_t flag) {
+
+    // Use stack_ to hold our stack of instructions yet to process.
+    // It was preallocated as follows:
+    //   one entry per Capture;
+    //   one entry per EmptyWidth; and
+    //   one entry per Nop.
+    // This reflects the maximum number of stack pushes that each can
+    // perform. (Each instruction can be processed at most once.)
+    // When using marks, we also added nmark == prog_->size().
+    // (Otherwise, nmark == 0.)
+    int* stk = stack_.data();
+    int nstk = 0;
+
+    stk[nstk++] = id;
+    while (nstk > 0) {
+        DCHECK_LE(nstk, stack_.size());
+        id = stk[--nstk];
+
+    Loop:
+        if (id == Mark) {
+            q->mark();
+            continue;
+        }
+
+        if (id == 0)
+            continue;
+
+        // If ip is already on the queue, nothing to do.
+        // Otherwise add it.  We don't actually keep all the
+        // ones that get added, but adding all of them here
+        // increases the likelihood of q->contains(id),
+        // reducing the amount of duplicated work.
+        if (q->contains(id))
+            continue;
+        q->insert_new(id);
+
+        // Process instruction.
+        Prog::Inst* ip = prog_->inst(id);
+        switch (ip->opcode()) {
+        default:
+            LOG(DFATAL) << "unhandled opcode: " << ip->opcode();
+            break;
+
+        case kInstByteRange: // just save these on the queue
+        case kInstMatch:
+            if (ip->last())
+                break;
+            id = id + 1;
+            goto Loop;
+
+        case kInstCapture: // DFA treats captures as no-ops.
+        case kInstNop:
+            if (!ip->last())
+                stk[nstk++] = id + 1;
+
+            // If this instruction is the [00-FF]* loop at the beginning of
+            // a leftmost-longest unanchored search, separate with a Mark so
+            // that future threads (which will start farther to the right in
+            // the input string) are lower priority than current threads.
+            if (ip->opcode() == kInstNop && q->maxmark() > 0 && id == prog_->start_unanchored() &&
+                id != prog_->start())
+                stk[nstk++] = Mark;
+            id = ip->out();
+            goto Loop;
+
+        case kInstAltMatch:
+            DCHECK(!ip->last());
+            id = id + 1;
+            goto Loop;
+
+        case kInstEmptyWidth:
+            if (!ip->last())
+                stk[nstk++] = id + 1;
+
+            // Continue on if we have all the right flag bits.
+            if (ip->empty() & ~flag)
+                break;
+            id = ip->out();
+            goto Loop;
+        }
+    }
+}
+
+// Running of work queues.  In the work queue, order matters:
+// the queue is sorted in priority order.  If instruction i comes before j,
+// then the instructions that i produces during the run must come before
+// the ones that j produces.  In order to keep this invariant, all the
+// work queue runners have to take an old queue to process and then
+// also a new queue to fill in.  It's not acceptable to add to the end of
+// an existing queue, because new instructions will not end up in the
+// correct position.
+
+// Runs the work queue, processing the empty strings indicated by flag.
+// For example, flag == kEmptyBeginLine|kEmptyEndLine means to match
+// both ^ and $.  It is important that callers pass all flags at once:
+// processing both ^ and $ is not the same as first processing only ^
+// and then processing only $.  Doing the two-step sequence won't match
+// ^$^$^$ but processing ^ and $ simultaneously will (and is the behavior
+// exhibited by existing implementations).
+void DFA::RunWorkqOnEmptyString(Workq* oldq, Workq* newq, uint32_t flag) {
+    newq->clear();
+    for (Workq::iterator i = oldq->begin(); i != oldq->end(); ++i) {
+        if (oldq->is_mark(*i))
+            AddToQueue(newq, Mark, flag);
+        else
+            AddToQueue(newq, *i, flag);
+    }
+}
+
+// Runs the work queue, processing the single byte c followed by any empty
+// strings indicated by flag.  For example, c == 'a' and flag == kEmptyEndLine,
+// means to match c$.  Sets the bool *ismatch to true if the end of the
+// regular expression program has been reached (the regexp has matched).
+void DFA::RunWorkqOnByte(Workq* oldq, Workq* newq, int c, uint32_t flag, bool* ismatch) {
+    // mutex_.AssertHeld();
+
+    newq->clear();
+    for (Workq::iterator i = oldq->begin(); i != oldq->end(); ++i) {
+        if (oldq->is_mark(*i)) {
+            if (*ismatch)
+                return;
+            newq->mark();
+            continue;
+        }
+        int id = *i;
+        Prog::Inst* ip = prog_->inst(id);
+        switch (ip->opcode()) {
+        default:
+            LOG(DFATAL) << "unhandled opcode: " << ip->opcode();
+            break;
+
+        case kInstFail:       // never succeeds
+        case kInstCapture:    // already followed
+        case kInstNop:        // already followed
+        case kInstAltMatch:   // already followed
+        case kInstEmptyWidth: // already followed
+            break;
+
+        case kInstByteRange: // can follow if c is in range
+            if (!ip->Matches(c))
+                break;
+            AddToQueue(newq, ip->out(), flag);
+            if (ip->hint() != 0) {
+                // We have a hint, but we must cancel out the
+                // increment that will occur after the break.
+                i += ip->hint() - 1;
+            } else {
+                // We have no hint, so we must find the end
+                // of the current list and then skip to it.
+                Prog::Inst* ip0 = ip;
+                while (!ip->last())
+                    ++ip;
+                i += ip - ip0;
+            }
+            break;
+
+        case kInstMatch:
+            if (prog_->anchor_end() && c != kByteEndText && kind_ != Prog::kManyMatch)
+                break;
+            *ismatch = true;
+            if (kind_ == Prog::kFirstMatch) {
+                // Can stop processing work queue since we found a match.
+                return;
+            }
+            break;
+        }
+    }
+
+    if (ExtraDebug)
+        fprintf(stderr, "%s on %d[%#x] -> %s [%d]\n", DumpWorkq(oldq).c_str(), c, flag,
+            DumpWorkq(newq).c_str(), *ismatch);
+}
+
+// Processes input byte c in state, returning new state.
+// Caller does not hold mutex.
+DFA::State* DFA::RunStateOnByteUnlocked(State* state, int c) {
+    // Keep only one RunStateOnByte going
+    // even if the DFA is being run by multiple threads.
+    MutexLock l(&mutex_);
+    return RunStateOnByte(state, c);
+}
+
+// Processes input byte c in state, returning new state.
+DFA::State* DFA::RunStateOnByte(State* state, int c) {
+    // mutex_.AssertHeld();
+
+    if (state <= SpecialStateMax) {
+        if (state == FullMatchState) {
+            // It is convenient for routines like PossibleMatchRange
+            // if we implement RunStateOnByte for FullMatchState:
+            // once you get into this state you never get out,
+            // so it's pretty easy.
+            return FullMatchState;
+        }
+        if (state == DeadState) {
+            LOG(DFATAL) << "DeadState in RunStateOnByte";
+            return NULL;
+        }
+        if (state == NULL) {
+            LOG(DFATAL) << "NULL state in RunStateOnByte";
+            return NULL;
+        }
+        LOG(DFATAL) << "Unexpected special state in RunStateOnByte";
+        return NULL;
+    }
+
+    // If someone else already computed this, return it.
+    State* ns = state->next_[ByteMap(c)].load(std::memory_order_relaxed);
+    if (ns != NULL)
+        return ns;
+
+    // Convert state into Workq.
+    StateToWorkq(state, q0_);
+
+    // Flags marking the kinds of empty-width things (^ $ etc)
+    // around this byte.  Before the byte we have the flags recorded
+    // in the State structure itself.  After the byte we have
+    // nothing yet (but that will change: read on).
+    uint32_t needflag = state->flag_ >> kFlagNeedShift;
+    uint32_t beforeflag = state->flag_ & kFlagEmptyMask;
+    uint32_t oldbeforeflag = beforeflag;
+    uint32_t afterflag = 0;
+
+    if (c == '\n') {
+        // Insert implicit $ and ^ around \n
+        beforeflag |= kEmptyEndLine;
+        afterflag |= kEmptyBeginLine;
+    }
+
+    if (c == kByteEndText) {
+        // Insert implicit $ and \z before the fake "end text" byte.
+        beforeflag |= kEmptyEndLine | kEmptyEndText;
+    }
+
+    // The state flag kFlagLastWord says whether the last
+    // byte processed was a word character.  Use that info to
+    // insert empty-width (non-)word boundaries.
+    bool islastword = (state->flag_ & kFlagLastWord) != 0;
+    bool isword = c != kByteEndText && Prog::IsWordChar(static_cast<uint8_t>(c));
+    if (isword == islastword)
+        beforeflag |= kEmptyNonWordBoundary;
+    else
+        beforeflag |= kEmptyWordBoundary;
+
+    // Okay, finally ready to run.
+    // Only useful to rerun on empty string if there are new, useful flags.
+    if (beforeflag & ~oldbeforeflag & needflag) {
+        RunWorkqOnEmptyString(q0_, q1_, beforeflag);
+        using std::swap;
+        swap(q0_, q1_);
+    }
+    bool ismatch = false;
+    RunWorkqOnByte(q0_, q1_, c, afterflag, &ismatch);
+    using std::swap;
+    swap(q0_, q1_);
+
+    // Save afterflag along with ismatch and isword in new state.
+    uint32_t flag = afterflag;
+    if (ismatch)
+        flag |= kFlagMatch;
+    if (isword)
+        flag |= kFlagLastWord;
+
+    if (ismatch && kind_ == Prog::kManyMatch)
+        ns = WorkqToCachedState(q0_, q1_, flag);
+    else
+        ns = WorkqToCachedState(q0_, NULL, flag);
+
+    // Flush ns before linking to it.
+    // Write barrier before updating state->next_ so that the
+    // main search loop can proceed without any locking, for speed.
+    // (Otherwise it would need one mutex operation per input byte.)
+    state->next_[ByteMap(c)].store(ns, std::memory_order_release);
+    return ns;
+}
+
+//////////////////////////////////////////////////////////////////////
+// DFA cache reset.
+
+// Reader-writer lock helper.
+//
+// The DFA uses a reader-writer mutex to protect the state graph itself.
+// Traversing the state graph requires holding the mutex for reading,
+// and discarding the state graph and starting over requires holding the
+// lock for writing.  If a search needs to expand the graph but is out
+// of memory, it will need to drop its read lock and then acquire the
+// write lock.  Since it cannot then atomically downgrade from write lock
+// to read lock, it runs the rest of the search holding the write lock.
+// (This probably helps avoid repeated contention, but really the decision
+// is forced by the Mutex interface.)  It's a bit complicated to keep
+// track of whether the lock is held for reading or writing and thread
+// that through the search, so instead we encapsulate it in the RWLocker
+// and pass that around.
+
+class DFA::RWLocker {
+public:
+    explicit RWLocker(CacheMutex* mu);
+    ~RWLocker();
+
+    // If the lock is only held for reading right now,
+    // drop the read lock and re-acquire for writing.
+    // Subsequent calls to LockForWriting are no-ops.
+    // Notice that the lock is *released* temporarily.
+    void LockForWriting();
+
+private:
+    CacheMutex* mu_;
+    bool writing_;
+
+    RWLocker(const RWLocker&) = delete;
+    RWLocker& operator=(const RWLocker&) = delete;
+};
+
+DFA::RWLocker::RWLocker(CacheMutex* mu) : mu_(mu), writing_(false) {
+    mu_->ReaderLock();
+}
+
+// This function is marked as NO_THREAD_SAFETY_ANALYSIS because
+// the annotations don't support lock upgrade.
+void DFA::RWLocker::LockForWriting() NO_THREAD_SAFETY_ANALYSIS {
+    if (!writing_) {
+        mu_->ReaderUnlock();
+        mu_->WriterLock();
+        writing_ = true;
+    }
+}
+
+DFA::RWLocker::~RWLocker() {
+    if (!writing_)
+        mu_->ReaderUnlock();
+    else
+        mu_->WriterUnlock();
+}
+
+// When the DFA's State cache fills, we discard all the states in the
+// cache and start over.  Many threads can be using and adding to the
+// cache at the same time, so we synchronize using the cache_mutex_
+// to keep from stepping on other threads.  Specifically, all the
+// threads using the current cache hold cache_mutex_ for reading.
+// When a thread decides to flush the cache, it drops cache_mutex_
+// and then re-acquires it for writing.  That ensures there are no
+// other threads accessing the cache anymore.  The rest of the search
+// runs holding cache_mutex_ for writing, avoiding any contention
+// with or cache pollution caused by other threads.
+
+void DFA::ResetCache(RWLocker* cache_lock) {
+    // Re-acquire the cache_mutex_ for writing (exclusive use).
+    cache_lock->LockForWriting();
+
+    hooks::GetDFAStateCacheResetHook()({
+        state_budget_,
+        state_cache_.size(),
+    });
+
+    // Clear the cache, reset the memory budget.
+    for (int i = 0; i < kMaxStart; i++)
+        start_[i].start.store(NULL, std::memory_order_relaxed);
+    ClearCache();
+    mem_budget_ = state_budget_;
+}
+
+// Typically, a couple States do need to be preserved across a cache
+// reset, like the State at the current point in the search.
+// The StateSaver class helps keep States across cache resets.
+// It makes a copy of the state's guts outside the cache (before the reset)
+// and then can be asked, after the reset, to recreate the State
+// in the new cache.  For example, in a DFA method ("this" is a DFA):
+//
+//   StateSaver saver(this, s);
+//   ResetCache(cache_lock);
+//   s = saver.Restore();
+//
+// The saver should always have room in the cache to re-create the state,
+// because resetting the cache locks out all other threads, and the cache
+// is known to have room for at least a couple states (otherwise the DFA
+// constructor fails).
+
+class DFA::StateSaver {
+public:
+    explicit StateSaver(DFA* dfa, State* state);
+    ~StateSaver();
+
+    // Recreates and returns a state equivalent to the
+    // original state passed to the constructor.
+    // Returns NULL if the cache has filled, but
+    // since the DFA guarantees to have room in the cache
+    // for a couple states, should never return NULL
+    // if used right after ResetCache.
+    State* Restore();
+
+private:
+    DFA* dfa_;  // the DFA to use
+    int* inst_; // saved info from State
+    int ninst_;
+    uint32_t flag_;
+    bool is_special_; // whether original state was special
+    State* special_;  // if is_special_, the original state
+
+    StateSaver(const StateSaver&) = delete;
+    StateSaver& operator=(const StateSaver&) = delete;
+};
+
+DFA::StateSaver::StateSaver(DFA* dfa, State* state) {
+    dfa_ = dfa;
+    if (state <= SpecialStateMax) {
+        inst_ = NULL;
+        ninst_ = 0;
+        flag_ = 0;
+        is_special_ = true;
+        special_ = state;
+        return;
+    }
+    is_special_ = false;
+    special_ = NULL;
+    flag_ = state->flag_;
+    ninst_ = state->ninst_;
+    inst_ = new int[ninst_];
+    memmove(inst_, state->inst_, ninst_ * sizeof inst_[0]);
+}
+
+DFA::StateSaver::~StateSaver() {
+    if (!is_special_)
+        delete[] inst_;
+}
+
+DFA::State* DFA::StateSaver::Restore() {
+    if (is_special_)
+        return special_;
+    MutexLock l(&dfa_->mutex_);
+    State* s = dfa_->CachedState(inst_, ninst_, flag_);
+    if (s == NULL)
+        LOG(DFATAL) << "StateSaver failed to restore state.";
+    return s;
+}
+
+//////////////////////////////////////////////////////////////////////
+//
+// DFA execution.
+//
+// The basic search loop is easy: start in a state s and then for each
+// byte c in the input, s = s->next[c].
+//
+// This simple description omits a few efficiency-driven complications.
+//
+// First, the State graph is constructed incrementally: it is possible
+// that s->next[c] is null, indicating that that state has not been
+// fully explored.  In this case, RunStateOnByte must be invoked to
+// determine the next state, which is cached in s->next[c] to save
+// future effort.  An alternative reason for s->next[c] to be null is
+// that the DFA has reached a so-called "dead state", in which any match
+// is no longer possible.  In this case RunStateOnByte will return NULL
+// and the processing of the string can stop early.
+//
+// Second, a 256-element pointer array for s->next_ makes each State
+// quite large (2kB on 64-bit machines).  Instead, dfa->bytemap_[]
+// maps from bytes to "byte classes" and then next_ only needs to have
+// as many pointers as there are byte classes.  A byte class is simply a
+// range of bytes that the regexp never distinguishes between.
+// A regexp looking for a[abc] would have four byte ranges -- 0 to 'a'-1,
+// 'a', 'b' to 'c', and 'c' to 0xFF.  The bytemap slows us a little bit
+// but in exchange we typically cut the size of a State (and thus our
+// memory footprint) by about 5-10x.  The comments still refer to
+// s->next[c] for simplicity, but code should refer to s->next_[bytemap_[c]].
+//
+// Third, it is common for a DFA for an unanchored match to begin in a
+// state in which only one particular byte value can take the DFA to a
+// different state.  That is, s->next[c] != s for only one c.  In this
+// situation, the DFA can do better than executing the simple loop.
+// Instead, it can call memchr to search very quickly for the byte c.
+// Whether the start state has this property is determined during a
+// pre-compilation pass and the "can_prefix_accel" argument is set.
+//
+// Fourth, the desired behavior is to search for the leftmost-best match
+// (approximately, the same one that Perl would find), which is not
+// necessarily the match ending earliest in the string.  Each time a
+// match is found, it must be noted, but the DFA must continue on in
+// hope of finding a higher-priority match.  In some cases, the caller only
+// cares whether there is any match at all, not which one is found.
+// The "want_earliest_match" flag causes the search to stop at the first
+// match found.
+//
+// Fifth, one algorithm that uses the DFA needs it to run over the
+// input string backward, beginning at the end and ending at the beginning.
+// Passing false for the "run_forward" flag causes the DFA to run backward.
+//
+// The checks for these last three cases, which in a naive implementation
+// would be performed once per input byte, slow the general loop enough
+// to merit specialized versions of the search loop for each of the
+// eight possible settings of the three booleans.  Rather than write
+// eight different functions, we write one general implementation and then
+// inline it to create the specialized ones.
+//
+// Note that matches are delayed by one byte, to make it easier to
+// accomodate match conditions depending on the next input byte (like $ and \b).
+// When s->next[c]->IsMatch(), it means that there is a match ending just
+// *before* byte c.
+
+// The generic search loop.  Searches text for a match, returning
+// the pointer to the end of the chosen match, or NULL if no match.
+// The bools are equal to the same-named variables in params, but
+// making them function arguments lets the inliner specialize
+// this function to each combination (see two paragraphs above).
+template<bool can_prefix_accel, bool want_earliest_match, bool run_forward>
+inline bool DFA::InlinedSearchLoop(SearchParams* params) {
+    State* start = params->start;
+    const uint8_t* bp = BytePtr(params->text.data());                       // start of text
+    const uint8_t* p = bp;                                                  // text scanning point
+    const uint8_t* ep = BytePtr(params->text.data() + params->text.size()); // end of text
+    const uint8_t* resetp = NULL;                                           // p at last cache reset
+    if (!run_forward) {
+        using std::swap;
+        swap(p, ep);
+    }
+
+    const uint8_t* bytemap = prog_->bytemap();
+    const uint8_t* lastmatch = NULL; // most recent matching position in text
+    bool matched = false;
+
+    State* s = start;
+    if (ExtraDebug)
+        fprintf(stderr, "@stx: %s\n", DumpState(s).c_str());
+
+    if (s->IsMatch()) {
+        matched = true;
+        lastmatch = p;
+        if (ExtraDebug)
+            fprintf(stderr, "match @stx! [%s]\n", DumpState(s).c_str());
+        if (params->matches != NULL && kind_ == Prog::kManyMatch) {
+            for (int i = s->ninst_ - 1; i >= 0; i--) {
+                int id = s->inst_[i];
+                if (id == MatchSep)
+                    break;
+                params->matches->insert(id);
+            }
+        }
+        if (want_earliest_match) {
+            params->ep = reinterpret_cast<const char*>(lastmatch);
+            return true;
+        }
+    }
+
+    while (p != ep) {
+        if (ExtraDebug)
+            fprintf(stderr, "@%td: %s\n", p - bp, DumpState(s).c_str());
+
+        if (can_prefix_accel && s == start) {
+            // In start state, only way out is to find the prefix,
+            // so we use prefix accel (e.g. memchr) to skip ahead.
+            // If not found, we can skip to the end of the string.
+            p = BytePtr(prog_->PrefixAccel(p, ep - p));
+            if (p == NULL) {
+                p = ep;
+                break;
+            }
+        }
+
+        int c;
+        if (run_forward)
+            c = *p++;
+        else
+            c = *--p;
+
+        // Note that multiple threads might be consulting
+        // s->next_[bytemap[c]] simultaneously.
+        // RunStateOnByte takes care of the appropriate locking,
+        // including a memory barrier so that the unlocked access
+        // (sometimes known as "double-checked locking") is safe.
+        // The alternative would be either one DFA per thread
+        // or one mutex operation per input byte.
+        //
+        // ns == DeadState means the state is known to be dead
+        // (no more matches are possible).
+        // ns == NULL means the state has not yet been computed
+        // (need to call RunStateOnByteUnlocked).
+        // RunStateOnByte returns ns == NULL if it is out of memory.
+        // ns == FullMatchState means the rest of the string matches.
+        //
+        // Okay to use bytemap[] not ByteMap() here, because
+        // c is known to be an actual byte and not kByteEndText.
+
+        State* ns = s->next_[bytemap[c]].load(std::memory_order_acquire);
+        if (ns == NULL) {
+            ns = RunStateOnByteUnlocked(s, c);
+            if (ns == NULL) {
+                // After we reset the cache, we hold cache_mutex exclusively,
+                // so if resetp != NULL, it means we filled the DFA state
+                // cache with this search alone (without any other threads).
+                // Benchmarks show that doing a state computation on every
+                // byte runs at about 0.2 MB/s, while the NFA (nfa.cc) can do the
+                // same at about 2 MB/s.  Unless we're processing an average
+                // of 10 bytes per state computation, fail so that RE2 can
+                // fall back to the NFA.  However, RE2::Set cannot fall back,
+                // so we just have to keep on keeping on in that case.
+                if (dfa_should_bail_when_slow && resetp != NULL &&
+                    static_cast<size_t>(p - resetp) < 10 * state_cache_.size() &&
+                    kind_ != Prog::kManyMatch) {
+                    params->failed = true;
+                    return false;
+                }
+                resetp = p;
+
+                // Prepare to save start and s across the reset.
+                StateSaver save_start(this, start);
+                StateSaver save_s(this, s);
+
+                // Discard all the States in the cache.
+                ResetCache(params->cache_lock);
+
+                // Restore start and s so we can continue.
+                if ((start = save_start.Restore()) == NULL || (s = save_s.Restore()) == NULL) {
+                    // Restore already did LOG(DFATAL).
+                    params->failed = true;
+                    return false;
+                }
+                ns = RunStateOnByteUnlocked(s, c);
+                if (ns == NULL) {
+                    LOG(DFATAL) << "RunStateOnByteUnlocked failed after ResetCache";
+                    params->failed = true;
+                    return false;
+                }
+            }
+        }
+        if (ns <= SpecialStateMax) {
+            if (ns == DeadState) {
+                params->ep = reinterpret_cast<const char*>(lastmatch);
+                return matched;
+            }
+            // FullMatchState
+            params->ep = reinterpret_cast<const char*>(ep);
+            return true;
+        }
+
+        s = ns;
+        if (s->IsMatch()) {
+            matched = true;
+            // The DFA notices the match one byte late,
+            // so adjust p before using it in the match.
+            if (run_forward)
+                lastmatch = p - 1;
+            else
+                lastmatch = p + 1;
+            if (ExtraDebug)
+                fprintf(stderr, "match @%td! [%s]\n", lastmatch - bp, DumpState(s).c_str());
+            if (params->matches != NULL && kind_ == Prog::kManyMatch) {
+                for (int i = s->ninst_ - 1; i >= 0; i--) {
+                    int id = s->inst_[i];
+                    if (id == MatchSep)
+                        break;
+                    params->matches->insert(id);
+                }
+            }
+            if (want_earliest_match) {
+                params->ep = reinterpret_cast<const char*>(lastmatch);
+                return true;
+            }
+        }
+    }
+
+    // Process one more byte to see if it triggers a match.
+    // (Remember, matches are delayed one byte.)
+    if (ExtraDebug)
+        fprintf(stderr, "@etx: %s\n", DumpState(s).c_str());
+
+    int lastbyte;
+    if (run_forward) {
+        if (EndPtr(params->text) == EndPtr(params->context))
+            lastbyte = kByteEndText;
+        else
+            lastbyte = EndPtr(params->text)[0] & 0xFF;
+    } else {
+        if (BeginPtr(params->text) == BeginPtr(params->context))
+            lastbyte = kByteEndText;
+        else
+            lastbyte = BeginPtr(params->text)[-1] & 0xFF;
+    }
+
+    State* ns = s->next_[ByteMap(lastbyte)].load(std::memory_order_acquire);
+    if (ns == NULL) {
+        ns = RunStateOnByteUnlocked(s, lastbyte);
+        if (ns == NULL) {
+            StateSaver save_s(this, s);
+            ResetCache(params->cache_lock);
+            if ((s = save_s.Restore()) == NULL) {
+                params->failed = true;
+                return false;
+            }
+            ns = RunStateOnByteUnlocked(s, lastbyte);
+            if (ns == NULL) {
+                LOG(DFATAL) << "RunStateOnByteUnlocked failed after Reset";
+                params->failed = true;
+                return false;
+            }
+        }
+    }
+    if (ns <= SpecialStateMax) {
+        if (ns == DeadState) {
+            params->ep = reinterpret_cast<const char*>(lastmatch);
+            return matched;
+        }
+        // FullMatchState
+        params->ep = reinterpret_cast<const char*>(ep);
+        return true;
+    }
+
+    s = ns;
+    if (s->IsMatch()) {
+        matched = true;
+        lastmatch = p;
+        if (ExtraDebug)
+            fprintf(stderr, "match @etx! [%s]\n", DumpState(s).c_str());
+        if (params->matches != NULL && kind_ == Prog::kManyMatch) {
+            for (int i = s->ninst_ - 1; i >= 0; i--) {
+                int id = s->inst_[i];
+                if (id == MatchSep)
+                    break;
+                params->matches->insert(id);
+            }
+        }
+    }
+
+    params->ep = reinterpret_cast<const char*>(lastmatch);
+    return matched;
+}
+
+// Inline specializations of the general loop.
+bool DFA::SearchFFF(SearchParams* params) {
+    return InlinedSearchLoop<false, false, false>(params);
+}
+bool DFA::SearchFFT(SearchParams* params) {
+    return InlinedSearchLoop<false, false, true>(params);
+}
+bool DFA::SearchFTF(SearchParams* params) {
+    return InlinedSearchLoop<false, true, false>(params);
+}
+bool DFA::SearchFTT(SearchParams* params) {
+    return InlinedSearchLoop<false, true, true>(params);
+}
+bool DFA::SearchTFF(SearchParams* params) {
+    return InlinedSearchLoop<true, false, false>(params);
+}
+bool DFA::SearchTFT(SearchParams* params) {
+    return InlinedSearchLoop<true, false, true>(params);
+}
+bool DFA::SearchTTF(SearchParams* params) {
+    return InlinedSearchLoop<true, true, false>(params);
+}
+bool DFA::SearchTTT(SearchParams* params) {
+    return InlinedSearchLoop<true, true, true>(params);
+}
+
+// For performance, calls the appropriate specialized version
+// of InlinedSearchLoop.
+bool DFA::FastSearchLoop(SearchParams* params) {
+    // Because the methods are private, the Searches array
+    // cannot be declared at top level.
+    static bool (DFA::*Searches[])(SearchParams*) = {
+        &DFA::SearchFFF,
+        &DFA::SearchFFT,
+        &DFA::SearchFTF,
+        &DFA::SearchFTT,
+        &DFA::SearchTFF,
+        &DFA::SearchTFT,
+        &DFA::SearchTTF,
+        &DFA::SearchTTT,
+    };
+
+    int index =
+        4 * params->can_prefix_accel + 2 * params->want_earliest_match + 1 * params->run_forward;
+    return (this->*Searches[index])(params);
+}
+
+// The discussion of DFA execution above ignored the question of how
+// to determine the initial state for the search loop.  There are two
+// factors that influence the choice of start state.
+//
+// The first factor is whether the search is anchored or not.
+// The regexp program (Prog*) itself has
+// two different entry points: one for anchored searches and one for
+// unanchored searches.  (The unanchored version starts with a leading ".*?"
+// and then jumps to the anchored one.)
+//
+// The second factor is where text appears in the larger context, which
+// determines which empty-string operators can be matched at the beginning
+// of execution.  If text is at the very beginning of context, \A and ^ match.
+// Otherwise if text is at the beginning of a line, then ^ matches.
+// Otherwise it matters whether the character before text is a word character
+// or a non-word character.
+//
+// The two cases (unanchored vs not) and four cases (empty-string flags)
+// combine to make the eight cases recorded in the DFA's begin_text_[2],
+// begin_line_[2], after_wordchar_[2], and after_nonwordchar_[2] cached
+// StartInfos.  The start state for each is filled in the first time it
+// is used for an actual search.
+
+// Examines text, context, and anchored to determine the right start
+// state for the DFA search loop.  Fills in params and returns true on success.
+// Returns false on failure.
+bool DFA::AnalyzeSearch(SearchParams* params) {
+    const StringPiece& text = params->text;
+    const StringPiece& context = params->context;
+
+    // Sanity check: make sure that text lies within context.
+    if (BeginPtr(text) < BeginPtr(context) || EndPtr(text) > EndPtr(context)) {
+        LOG(DFATAL) << "context does not contain text";
+        params->start = DeadState;
+        return true;
+    }
+
+    // Determine correct search type.
+    int start;
+    uint32_t flags;
+    if (params->run_forward) {
+        if (BeginPtr(text) == BeginPtr(context)) {
+            start = kStartBeginText;
+            flags = kEmptyBeginText | kEmptyBeginLine;
+        } else if (BeginPtr(text)[-1] == '\n') {
+            start = kStartBeginLine;
+            flags = kEmptyBeginLine;
+        } else if (Prog::IsWordChar(BeginPtr(text)[-1] & 0xFF)) {
+            start = kStartAfterWordChar;
+            flags = kFlagLastWord;
+        } else {
+            start = kStartAfterNonWordChar;
+            flags = 0;
+        }
+    } else {
+        if (EndPtr(text) == EndPtr(context)) {
+            start = kStartBeginText;
+            flags = kEmptyBeginText | kEmptyBeginLine;
+        } else if (EndPtr(text)[0] == '\n') {
+            start = kStartBeginLine;
+            flags = kEmptyBeginLine;
+        } else if (Prog::IsWordChar(EndPtr(text)[0] & 0xFF)) {
+            start = kStartAfterWordChar;
+            flags = kFlagLastWord;
+        } else {
+            start = kStartAfterNonWordChar;
+            flags = 0;
+        }
+    }
+    if (params->anchored)
+        start |= kStartAnchored;
+    StartInfo* info = &start_[start];
+
+    // Try once without cache_lock for writing.
+    // Try again after resetting the cache
+    // (ResetCache will relock cache_lock for writing).
+    if (!AnalyzeSearchHelper(params, info, flags)) {
+        ResetCache(params->cache_lock);
+        if (!AnalyzeSearchHelper(params, info, flags)) {
+            params->failed = true;
+            LOG(DFATAL) << "Failed to analyze start state.";
+            return false;
+        }
+    }
+
+    params->start = info->start.load(std::memory_order_acquire);
+
+    // Even if we could prefix accel, we cannot do so when anchored and,
+    // less obviously, we cannot do so when we are going to need flags.
+    // This trick works only when there is a single byte that leads to a
+    // different state!
+    if (prog_->can_prefix_accel() && !params->anchored && params->start > SpecialStateMax &&
+        params->start->flag_ >> kFlagNeedShift == 0)
+        params->can_prefix_accel = true;
+
+    if (ExtraDebug)
+        fprintf(stderr, "anchored=%d fwd=%d flags=%#x state=%s can_prefix_accel=%d\n",
+            params->anchored, params->run_forward, flags, DumpState(params->start).c_str(),
+            params->can_prefix_accel);
+
+    return true;
+}
+
+// Fills in info if needed.  Returns true on success, false on failure.
+bool DFA::AnalyzeSearchHelper(SearchParams* params, StartInfo* info, uint32_t flags) {
+    // Quick check.
+    State* start = info->start.load(std::memory_order_acquire);
+    if (start != NULL)
+        return true;
+
+    MutexLock l(&mutex_);
+    start = info->start.load(std::memory_order_relaxed);
+    if (start != NULL)
+        return true;
+
+    q0_->clear();
+    AddToQueue(q0_, params->anchored ? prog_->start() : prog_->start_unanchored(), flags);
+    start = WorkqToCachedState(q0_, NULL, flags);
+    if (start == NULL)
+        return false;
+
+    // Synchronize with "quick check" above.
+    info->start.store(start, std::memory_order_release);
+    return true;
+}
+
+// The actual DFA search: calls AnalyzeSearch and then FastSearchLoop.
+bool DFA::Search(const StringPiece& text, const StringPiece& context, bool anchored,
+    bool want_earliest_match, bool run_forward, bool* failed, const char** epp,
+    SparseSet* matches) {
+    *epp = NULL;
+    if (!ok()) {
+        *failed = true;
+        return false;
+    }
+    *failed = false;
+
+    if (ExtraDebug) {
+        fprintf(stderr, "\nprogram:\n%s\n", prog_->DumpUnanchored().c_str());
+        fprintf(stderr, "text %s anchored=%d earliest=%d fwd=%d kind %d\n",
+            std::string(text).c_str(), anchored, want_earliest_match, run_forward, kind_);
+    }
+
+    RWLocker l(&cache_mutex_);
+    SearchParams params(text, context, &l);
+    params.anchored = anchored;
+    params.want_earliest_match = want_earliest_match;
+    params.run_forward = run_forward;
+    params.matches = matches;
+
+    if (!AnalyzeSearch(&params)) {
+        *failed = true;
+        return false;
+    }
+    if (params.start == DeadState)
+        return false;
+    if (params.start == FullMatchState) {
+        if (run_forward == want_earliest_match)
+            *epp = text.data();
+        else
+            *epp = text.data() + text.size();
+        return true;
+    }
+    if (ExtraDebug)
+        fprintf(stderr, "start %s\n", DumpState(params.start).c_str());
+    bool ret = FastSearchLoop(&params);
+    if (params.failed) {
+        *failed = true;
+        return false;
+    }
+    *epp = params.ep;
+    return ret;
+}
+
+DFA* Prog::GetDFA(MatchKind kind) {
+    // For a forward DFA, half the memory goes to each DFA.
+    // However, if it is a "many match" DFA, then there is
+    // no counterpart with which the memory must be shared.
+    //
+    // For a reverse DFA, all the memory goes to the
+    // "longest match" DFA, because RE2 never does reverse
+    // "first match" searches.
+    if (kind == kFirstMatch) {
+        std::call_once(
+            dfa_first_once_,
+            [](Prog* prog) { prog->dfa_first_ = new DFA(prog, kFirstMatch, prog->dfa_mem_ / 2); },
+            this);
+        return dfa_first_;
+    } else if (kind == kManyMatch) {
+        std::call_once(
+            dfa_first_once_,
+            [](Prog* prog) { prog->dfa_first_ = new DFA(prog, kManyMatch, prog->dfa_mem_); }, this);
+        return dfa_first_;
+    } else {
+        std::call_once(
+            dfa_longest_once_,
+            [](Prog* prog) {
+                if (!prog->reversed_)
+                    prog->dfa_longest_ = new DFA(prog, kLongestMatch, prog->dfa_mem_ / 2);
+                else
+                    prog->dfa_longest_ = new DFA(prog, kLongestMatch, prog->dfa_mem_);
+            },
+            this);
+        return dfa_longest_;
+    }
+}
+
+void Prog::DeleteDFA(DFA* dfa) {
+    delete dfa;
+}
+
+// Executes the regexp program to search in text,
+// which itself is inside the larger context.  (As a convenience,
+// passing a NULL context is equivalent to passing text.)
+// Returns true if a match is found, false if not.
+// If a match is found, fills in match0->end() to point at the end of the match
+// and sets match0->begin() to text.begin(), since the DFA can't track
+// where the match actually began.
+//
+// This is the only external interface (class DFA only exists in this file).
+//
+bool Prog::SearchDFA(const StringPiece& text, const StringPiece& const_context, Anchor anchor,
+    MatchKind kind, StringPiece* match0, bool* failed, SparseSet* matches) {
+    *failed = false;
+
+    StringPiece context = const_context;
+    if (context.data() == NULL)
+        context = text;
+    bool caret = anchor_start();
+    bool dollar = anchor_end();
+    if (reversed_) {
+        using std::swap;
+        swap(caret, dollar);
+    }
+    if (caret && BeginPtr(context) != BeginPtr(text))
+        return false;
+    if (dollar && EndPtr(context) != EndPtr(text))
+        return false;
+
+    // Handle full match by running an anchored longest match
+    // and then checking if it covers all of text.
+    bool anchored = anchor == kAnchored || anchor_start() || kind == kFullMatch;
+    bool endmatch = false;
+    if (kind == kManyMatch) {
+        // This is split out in order to avoid clobbering kind.
+    } else if (kind == kFullMatch || anchor_end()) {
+        endmatch = true;
+        kind = kLongestMatch;
+    }
+
+    // If the caller doesn't care where the match is (just whether one exists),
+    // then we can stop at the very first match we find, the so-called
+    // "earliest match".
+    bool want_earliest_match = false;
+    if (kind == kManyMatch) {
+        // This is split out in order to avoid clobbering kind.
+        if (matches == NULL) {
+            want_earliest_match = true;
+        }
+    } else if (match0 == NULL && !endmatch) {
+        want_earliest_match = true;
+        kind = kLongestMatch;
+    }
+
+    DFA* dfa = GetDFA(kind);
+    const char* ep;
+    bool matched =
+        dfa->Search(text, context, anchored, want_earliest_match, !reversed_, failed, &ep, matches);
+    if (*failed) {
+        hooks::GetDFASearchFailureHook()({
+            // Nothing yet...
+        });
+        return false;
+    }
+    if (!matched)
+        return false;
+    if (endmatch && ep != (reversed_ ? text.data() : text.data() + text.size()))
+        return false;
+
+    // If caller cares, record the boundary of the match.
+    // We only know where it ends, so use the boundary of text
+    // as the beginning.
+    if (match0) {
+        if (reversed_)
+            *match0 = StringPiece(ep, static_cast<size_t>(text.data() + text.size() - ep));
+        else
+            *match0 = StringPiece(text.data(), static_cast<size_t>(ep - text.data()));
+    }
+    return true;
+}
+
+// Build out all states in DFA.  Returns number of states.
+int DFA::BuildAllStates(const Prog::DFAStateCallback& cb) {
+    if (!ok())
+        return 0;
+
+    // Pick out start state for unanchored search
+    // at beginning of text.
+    RWLocker l(&cache_mutex_);
+    SearchParams params(StringPiece(), StringPiece(), &l);
+    params.anchored = false;
+    if (!AnalyzeSearch(&params) || params.start == NULL || params.start == DeadState)
+        return 0;
+
+    // Add start state to work queue.
+    // Note that any State* that we handle here must point into the cache,
+    // so we can simply depend on pointer-as-a-number hashing and equality.
+    std::unordered_map<State*, int> m;
+    std::deque<State*> q;
+    m.emplace(params.start, static_cast<int>(m.size()));
+    q.push_back(params.start);
+
+    // Compute the input bytes needed to cover all of the next pointers.
+    int nnext = prog_->bytemap_range() + 1; // + 1 for kByteEndText slot
+    std::vector<int> input(nnext);
+    for (int c = 0; c < 256; c++) {
+        int b = prog_->bytemap()[c];
+        while (c < 256 - 1 && prog_->bytemap()[c + 1] == b)
+            c++;
+        input[b] = c;
+    }
+    input[prog_->bytemap_range()] = kByteEndText;
+
+    // Scratch space for the output.
+    std::vector<int> output(nnext);
+
+    // Flood to expand every state.
+    bool oom = false;
+    while (!q.empty()) {
+        State* s = q.front();
+        q.pop_front();
+        for (int c : input) {
+            State* ns = RunStateOnByteUnlocked(s, c);
+            if (ns == NULL) {
+                oom = true;
+                break;
+            }
+            if (ns == DeadState) {
+                output[ByteMap(c)] = -1;
+                continue;
+            }
+            if (m.find(ns) == m.end()) {
+                m.emplace(ns, static_cast<int>(m.size()));
+                q.push_back(ns);
+            }
+            output[ByteMap(c)] = m[ns];
+        }
+        if (cb)
+            cb(oom ? NULL : output.data(), s == FullMatchState || s->IsMatch());
+        if (oom)
+            break;
+    }
+
+    return static_cast<int>(m.size());
+}
+
+// Build out all states in DFA for kind.  Returns number of states.
+int Prog::BuildEntireDFA(MatchKind kind, const DFAStateCallback& cb) {
+    return GetDFA(kind)->BuildAllStates(cb);
+}
+
+// Computes min and max for matching string.
+// Won't return strings bigger than maxlen.
+bool DFA::PossibleMatchRange(std::string* min, std::string* max, int maxlen) {
+    if (!ok())
+        return false;
+
+    // NOTE: if future users of PossibleMatchRange want more precision when
+    // presented with infinitely repeated elements, consider making this a
+    // parameter to PossibleMatchRange.
+    static int kMaxEltRepetitions = 0;
+
+    // Keep track of the number of times we've visited states previously. We only
+    // revisit a given state if it's part of a repeated group, so if the value
+    // portion of the map tuple exceeds kMaxEltRepetitions we bail out and set
+    // |*max| to |PrefixSuccessor(*max)|.
+    //
+    // Also note that previously_visited_states[UnseenStatePtr] will, in the STL
+    // tradition, implicitly insert a '0' value at first use. We take advantage
+    // of that property below.
+    std::unordered_map<State*, int> previously_visited_states;
+
+    // Pick out start state for anchored search at beginning of text.
+    RWLocker l(&cache_mutex_);
+    SearchParams params(StringPiece(), StringPiece(), &l);
+    params.anchored = true;
+    if (!AnalyzeSearch(&params))
+        return false;
+    if (params.start == DeadState) { // No matching strings
+        *min = "";
+        *max = "";
+        return true;
+    }
+    if (params.start == FullMatchState) // Every string matches: no max
+        return false;
+
+    // The DFA is essentially a big graph rooted at params.start,
+    // and paths in the graph correspond to accepted strings.
+    // Each node in the graph has potentially 256+1 arrows
+    // coming out, one for each byte plus the magic end of
+    // text character kByteEndText.
+
+    // To find the smallest possible prefix of an accepted
+    // string, we just walk the graph preferring to follow
+    // arrows with the lowest bytes possible.  To find the
+    // largest possible prefix, we follow the largest bytes
+    // possible.
+
+    // The test for whether there is an arrow from s on byte j is
+    //    ns = RunStateOnByteUnlocked(s, j);
+    //    if (ns == NULL)
+    //      return false;
+    //    if (ns != DeadState && ns->ninst > 0)
+    // The RunStateOnByteUnlocked call asks the DFA to build out the graph.
+    // It returns NULL only if the DFA has run out of memory,
+    // in which case we can't be sure of anything.
+    // The second check sees whether there was graph built
+    // and whether it is interesting graph.  Nodes might have
+    // ns->ninst == 0 if they exist only to represent the fact
+    // that a match was found on the previous byte.
+
+    // Build minimum prefix.
+    State* s = params.start;
+    min->clear();
+    MutexLock lock(&mutex_);
+    for (int i = 0; i < maxlen; i++) {
+        if (previously_visited_states[s] > kMaxEltRepetitions)
+            break;
+        previously_visited_states[s]++;
+
+        // Stop if min is a match.
+        State* ns = RunStateOnByte(s, kByteEndText);
+        if (ns == NULL) // DFA out of memory
+            return false;
+        if (ns != DeadState && (ns == FullMatchState || ns->IsMatch()))
+            break;
+
+        // Try to extend the string with low bytes.
+        bool extended = false;
+        for (int j = 0; j < 256; j++) {
+            ns = RunStateOnByte(s, j);
+            if (ns == NULL) // DFA out of memory
+                return false;
+            if (ns == FullMatchState || (ns > SpecialStateMax && ns->ninst_ > 0)) {
+                extended = true;
+                min->append(1, static_cast<char>(j));
+                s = ns;
+                break;
+            }
+        }
+        if (!extended)
+            break;
+    }
+
+    // Build maximum prefix.
+    previously_visited_states.clear();
+    s = params.start;
+    max->clear();
+    for (int i = 0; i < maxlen; i++) {
+        if (previously_visited_states[s] > kMaxEltRepetitions)
+            break;
+        previously_visited_states[s] += 1;
+
+        // Try to extend the string with high bytes.
+        bool extended = false;
+        for (int j = 255; j >= 0; j--) {
+            State* ns = RunStateOnByte(s, j);
+            if (ns == NULL)
+                return false;
+            if (ns == FullMatchState || (ns > SpecialStateMax && ns->ninst_ > 0)) {
+                extended = true;
+                max->append(1, static_cast<char>(j));
+                s = ns;
+                break;
+            }
+        }
+        if (!extended) {
+            // Done, no need for PrefixSuccessor.
+            return true;
+        }
+    }
+
+    // Stopped while still adding to *max - round aaaaaaaaaa... to aaaa...b
+    PrefixSuccessor(max);
+
+    // If there are no bytes left, we have no way to say "there is no maximum
+    // string".  We could make the interface more complicated and be able to
+    // return "there is no maximum but here is a minimum", but that seems like
+    // overkill -- the most common no-max case is all possible strings, so not
+    // telling the caller that the empty string is the minimum match isn't a
+    // great loss.
+    if (max->empty())
+        return false;
+
+    return true;
+}
+
+// PossibleMatchRange for a Prog.
+bool Prog::PossibleMatchRange(std::string* min, std::string* max, int maxlen) {
+    // Have to use dfa_longest_ to get all strings for full matches.
+    // For example, (a|aa) never matches aa in first-match mode.
+    return GetDFA(kLongestMatch)->PossibleMatchRange(min, max, maxlen);
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/filtered_re2.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/filtered_re2.cpp
new file mode 100644
index 0000000000..ac251318dd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/filtered_re2.cpp
@@ -0,0 +1,114 @@
+// Copyright 2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#include "filtered_re2.h"
+
+#include <stddef.h>
+
+#include <string>
+
+#include "logging.h"
+#include "prefilter.h"
+#include "prefilter_tree.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+FilteredRE2::FilteredRE2() : compiled_(false), prefilter_tree_(new PrefilterTree()) {}
+
+FilteredRE2::FilteredRE2(int min_atom_len)
+    : compiled_(false), prefilter_tree_(new PrefilterTree(min_atom_len)) {}
+
+FilteredRE2::~FilteredRE2() {
+    for (size_t i = 0; i < re2_vec_.size(); i++)
+        delete re2_vec_[i];
+    delete prefilter_tree_;
+}
+
+RE2::ErrorCode FilteredRE2::Add(const StringPiece& pattern, const RE2::Options& options, int* id) {
+    RE2* re = new RE2(pattern, options);
+    RE2::ErrorCode code = re->error_code();
+
+    if (!re->ok()) {
+        if (options.log_errors()) {
+            LOG(ERROR) << "Couldn't compile regular expression, skipping: " << re
+                       << " due to error " << re->error();
+        }
+        delete re;
+    } else {
+        *id = static_cast<int>(re2_vec_.size());
+        re2_vec_.push_back(re);
+    }
+
+    return code;
+}
+
+void FilteredRE2::Compile(std::vector<std::string>* atoms) {
+    if (compiled_) {
+        LOG(ERROR) << "Compile called already.";
+        return;
+    }
+
+    if (re2_vec_.empty()) {
+        LOG(ERROR) << "Compile called before Add.";
+        return;
+    }
+
+    for (size_t i = 0; i < re2_vec_.size(); i++) {
+        Prefilter* prefilter = Prefilter::FromRE2(re2_vec_[i]);
+        prefilter_tree_->Add(prefilter);
+    }
+    atoms->clear();
+    prefilter_tree_->Compile(atoms);
+    compiled_ = true;
+}
+
+int FilteredRE2::SlowFirstMatch(const StringPiece& text) const {
+    for (size_t i = 0; i < re2_vec_.size(); i++)
+        if (RE2::PartialMatch(text, *re2_vec_[i]))
+            return static_cast<int>(i);
+    return -1;
+}
+
+int FilteredRE2::FirstMatch(const StringPiece& text, const std::vector<int>& atoms) const {
+    if (!compiled_) {
+        LOG(DFATAL) << "FirstMatch called before Compile.";
+        return -1;
+    }
+    std::vector<int> regexps;
+    prefilter_tree_->RegexpsGivenStrings(atoms, &regexps);
+    for (size_t i = 0; i < regexps.size(); i++)
+        if (RE2::PartialMatch(text, *re2_vec_[regexps[i]]))
+            return regexps[i];
+    return -1;
+}
+
+bool FilteredRE2::AllMatches(const StringPiece& text, const std::vector<int>& atoms,
+    std::vector<int>* matching_regexps) const {
+    matching_regexps->clear();
+    std::vector<int> regexps;
+    prefilter_tree_->RegexpsGivenStrings(atoms, &regexps);
+    for (size_t i = 0; i < regexps.size(); i++)
+        if (RE2::PartialMatch(text, *re2_vec_[regexps[i]]))
+            matching_regexps->push_back(regexps[i]);
+    return !matching_regexps->empty();
+}
+
+void FilteredRE2::AllPotentials(
+    const std::vector<int>& atoms, std::vector<int>* potential_regexps) const {
+    prefilter_tree_->RegexpsGivenStrings(atoms, potential_regexps);
+}
+
+void FilteredRE2::RegexpsGivenStrings(
+    const std::vector<int>& matched_atoms, std::vector<int>* passed_regexps) {
+    prefilter_tree_->RegexpsGivenStrings(matched_atoms, passed_regexps);
+}
+
+void FilteredRE2::PrintPrefilter(int regexpid) {
+    prefilter_tree_->PrintPrefilter(regexpid);
+}
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/bitmap256.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/bitmap256.h
new file mode 100644
index 0000000000..9a6f4003db
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/bitmap256.h
@@ -0,0 +1,115 @@
+// Copyright 2016 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_BITMAP256_H_
+#define RE2_BITMAP256_H_
+
+#ifdef _MSC_VER
+#include <intrin.h>
+#endif
+#include <stdint.h>
+#include <string.h>
+
+#include "logging.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+class Bitmap256 {
+public:
+    Bitmap256() { Clear(); }
+
+    // Clears all of the bits.
+    void Clear() { memset(words_, 0, sizeof words_); }
+
+    // Tests the bit with index c.
+    bool Test(int c) const {
+        DCHECK_GE(c, 0);
+        DCHECK_LE(c, 255);
+
+        return (words_[c / 64] & (1ULL << (c % 64))) != 0;
+    }
+
+    // Sets the bit with index c.
+    void Set(int c) {
+        DCHECK_GE(c, 0);
+        DCHECK_LE(c, 255);
+
+        words_[c / 64] |= (1ULL << (c % 64));
+    }
+
+    // Finds the next non-zero bit with index >= c.
+    // Returns -1 if no such bit exists.
+    int FindNextSetBit(int c) const;
+
+private:
+    // Finds the least significant non-zero bit in n.
+    static int FindLSBSet(uint64_t n) {
+        DCHECK_NE(n, 0);
+
+#if defined(__GNUC__)
+        return __builtin_ctzll(n);
+#elif defined(_MSC_VER) && defined(_M_X64)
+        unsigned long c;
+        _BitScanForward64(&c, n);
+        return static_cast<int>(c);
+#elif defined(_MSC_VER) && defined(_M_IX86)
+        unsigned long c;
+        if (static_cast<uint32_t>(n) != 0) {
+            _BitScanForward(&c, static_cast<uint32_t>(n));
+            return static_cast<int>(c);
+        } else {
+            _BitScanForward(&c, static_cast<uint32_t>(n >> 32));
+            return static_cast<int>(c) + 32;
+        }
+#else
+        int c = 63;
+        for (int shift = 1 << 5; shift != 0; shift >>= 1) {
+            uint64_t word = n << shift;
+            if (word != 0) {
+                n = word;
+                c -= shift;
+            }
+        }
+        return c;
+#endif
+    }
+
+    uint64_t words_[4];
+};
+
+int Bitmap256::FindNextSetBit(int c) const {
+    DCHECK_GE(c, 0);
+    DCHECK_LE(c, 255);
+
+    // Check the word that contains the bit. Mask out any lower bits.
+    int i = c / 64;
+    uint64_t word = words_[i] & (~0ULL << (c % 64));
+    if (word != 0)
+        return (i * 64) + FindLSBSet(word);
+
+    // Check any following words.
+    i++;
+    switch (i) {
+    case 1:
+        if (words_[1] != 0)
+            return (1 * 64) + FindLSBSet(words_[1]);
+        FALLTHROUGH_INTENDED;
+    case 2:
+        if (words_[2] != 0)
+            return (2 * 64) + FindLSBSet(words_[2]);
+        FALLTHROUGH_INTENDED;
+    case 3:
+        if (words_[3] != 0)
+            return (3 * 64) + FindLSBSet(words_[3]);
+        FALLTHROUGH_INTENDED;
+    default:
+        return -1;
+    }
+}
+
+} // namespace regex
+} // namespace lbug
+#endif // RE2_BITMAP256_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/filtered_re2.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/filtered_re2.h
new file mode 100644
index 0000000000..5d1db24c0a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/filtered_re2.h
@@ -0,0 +1,106 @@
+// Copyright 2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_FILTERED_RE2_H_
+#define RE2_FILTERED_RE2_H_
+
+// The class FilteredRE2 is used as a wrapper to multiple RE2 regexps.
+// It provides a prefilter mechanism that helps in cutting down the
+// number of regexps that need to be actually searched.
+//
+// By design, it does not include a string matching engine. This is to
+// allow the user of the class to use their favorite string match
+// engine. The overall flow is: Add all the regexps using Add, then
+// Compile the FilteredRE2. The compile returns strings that need to
+// be matched. Note that all returned strings are lowercase. For
+// applying regexps to a search text, the caller does the string
+// matching using the strings returned. When doing the string match,
+// note that the caller has to do that on lower cased version of the
+// search text. Then call FirstMatch or AllMatches with a vector of
+// indices of strings that were found in the text to get the actual
+// regexp matches.
+
+#include <string>
+#include <vector>
+
+#include "re2.h"
+
+namespace lbug {
+namespace regex {
+
+class PrefilterTree;
+
+class FilteredRE2 {
+public:
+    FilteredRE2();
+    explicit FilteredRE2(int min_atom_len);
+    ~FilteredRE2();
+
+    // Uses RE2 constructor to create a RE2 object (re). Returns
+    // re->error_code(). If error_code is other than NoError, then re is
+    // deleted and not added to re2_vec_.
+    RE2::ErrorCode Add(const StringPiece& pattern, const RE2::Options& options, int* id);
+
+    // Prepares the regexps added by Add for filtering.  Returns a set
+    // of strings that the caller should check for in candidate texts.
+    // The returned strings are lowercased. When doing string matching,
+    // the search text should be lowercased first to find matching
+    // strings from the set of strings returned by Compile.  Call after
+    // all Add calls are done.
+    void Compile(std::vector<std::string>* strings_to_match);
+
+    // Returns the index of the first matching regexp.
+    // Returns -1 on no match. Can be called prior to Compile.
+    // Does not do any filtering: simply tries to Match the
+    // regexps in a loop.
+    int SlowFirstMatch(const StringPiece& text) const;
+
+    // Returns the index of the first matching regexp.
+    // Returns -1 on no match. Compile has to be called before
+    // calling this.
+    int FirstMatch(const StringPiece& text, const std::vector<int>& atoms) const;
+
+    // Returns the indices of all matching regexps, after first clearing
+    // matched_regexps.
+    bool AllMatches(const StringPiece& text, const std::vector<int>& atoms,
+        std::vector<int>* matching_regexps) const;
+
+    // Returns the indices of all potentially matching regexps after first
+    // clearing potential_regexps.
+    // A regexp is potentially matching if it passes the filter.
+    // If a regexp passes the filter it may still not match.
+    // A regexp that does not pass the filter is guaranteed to not match.
+    void AllPotentials(const std::vector<int>& atoms, std::vector<int>* potential_regexps) const;
+
+    // The number of regexps added.
+    int NumRegexps() const { return static_cast<int>(re2_vec_.size()); }
+
+private:
+    // Get the individual RE2 objects. Useful for testing.
+    RE2* GetRE2(int regexpid) const { return re2_vec_[regexpid]; }
+
+    // Print prefilter.
+    void PrintPrefilter(int regexpid);
+
+    // Useful for testing and debugging.
+    void RegexpsGivenStrings(
+        const std::vector<int>& matched_atoms, std::vector<int>* passed_regexps);
+
+    // All the regexps in the FilteredRE2.
+    std::vector<RE2*> re2_vec_;
+
+    // Has the FilteredRE2 been compiled using Compile()
+    bool compiled_;
+
+    // An AND-OR tree of string atoms used for filtering regexps.
+    PrefilterTree* prefilter_tree_;
+
+    FilteredRE2(const FilteredRE2&) = delete;
+    FilteredRE2& operator=(const FilteredRE2&) = delete;
+};
+
+} // namespace regex
+} // namespace lbug
+
+#endif // RE2_FILTERED_RE2_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/logging.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/logging.h
new file mode 100644
index 0000000000..e589b2d03b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/logging.h
@@ -0,0 +1,121 @@
+// Copyright 2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef UTIL_LOGGING_H_
+#define UTIL_LOGGING_H_
+
+// Simplified version of Google's logging.
+
+#include <assert.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+#include <ostream>
+#include <sstream>
+
+#include "util.h"
+
+// Debug-only checking.
+#define DCHECK(condition) assert(condition)
+#define DCHECK_EQ(val1, val2) assert((val1) == (val2))
+#define DCHECK_NE(val1, val2) assert((val1) != (val2))
+#define DCHECK_LE(val1, val2) assert((val1) <= (val2))
+#define DCHECK_LT(val1, val2) assert((val1) < (val2))
+#define DCHECK_GE(val1, val2) assert((val1) >= (val2))
+#define DCHECK_GT(val1, val2) assert((val1) > (val2))
+
+// Always-on checking
+#define CHECK(x)                                                                                   \
+    if (x) {                                                                                       \
+    } else                                                                                         \
+        LogMessageFatal(__FILE__, __LINE__).stream() << "Check failed: " #x
+#define CHECK_LT(x, y) CHECK((x) < (y))
+#define CHECK_GT(x, y) CHECK((x) > (y))
+#define CHECK_LE(x, y) CHECK((x) <= (y))
+#define CHECK_GE(x, y) CHECK((x) >= (y))
+#define CHECK_EQ(x, y) CHECK((x) == (y))
+#define CHECK_NE(x, y) CHECK((x) != (y))
+
+#define LOG_INFO LogMessage(__FILE__, __LINE__)
+#define LOG_WARNING LogMessage(__FILE__, __LINE__)
+#define LOG_ERROR LogMessage(__FILE__, __LINE__)
+#define LOG_FATAL LogMessageFatal(__FILE__, __LINE__)
+#define LOG_QFATAL LOG_FATAL
+
+// It seems that one of the Windows header files defines ERROR as 0.
+#ifdef _WIN32
+#define LOG_0 LOG_INFO
+#endif
+
+#ifdef NDEBUG
+#define LOG_DFATAL LOG_ERROR
+#else
+#define LOG_DFATAL LOG_FATAL
+#endif
+
+#define LOG(severity) LOG_##severity.stream()
+
+#define VLOG(x)                                                                                    \
+    if ((x) > 0) {                                                                                 \
+    } else                                                                                         \
+        LOG_INFO.stream()
+
+namespace lbug {
+namespace regex {
+
+class LogMessage {
+public:
+    LogMessage(const char* file, int line) : flushed_(false) {
+        stream() << file << ":" << line << ": ";
+    }
+    void Flush() {
+        stream() << "\n";
+        /*// R does not allow us to have a reference to stderr even if we are not using it
+        std::string s = str_.str();
+        size_t n = s.size();
+        if (fwrite(s.data(), 1, n, stderr) < n) {}  // shut up gcc
+        */
+        flushed_ = true;
+    }
+    ~LogMessage() {
+        if (!flushed_) {
+            Flush();
+        }
+    }
+    std::ostream& stream() { return str_; }
+
+private:
+    bool flushed_;
+    std::ostringstream str_;
+
+    LogMessage(const LogMessage&) = delete;
+    LogMessage& operator=(const LogMessage&) = delete;
+};
+
+// Silence "destructor never returns" warning for ~LogMessageFatal().
+// Since this is a header file, push and then pop to limit the scope.
+#ifdef _MSC_VER
+// #pragma warning(push)
+// #pragma warning(disable: 4722)
+#endif
+
+class LogMessageFatal : public LogMessage {
+public:
+    LogMessageFatal(const char* file, int line) : LogMessage(file, line) {}
+    ATTRIBUTE_NORETURN ~LogMessageFatal() {
+        Flush();
+        abort();
+    }
+
+private:
+    LogMessageFatal(const LogMessageFatal&) = delete;
+    LogMessageFatal& operator=(const LogMessageFatal&) = delete;
+};
+} // namespace regex
+} // namespace lbug
+#ifdef _MSC_VER
+//#pragma warning(pop)
+#endif
+
+#endif // UTIL_LOGGING_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/mix.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/mix.h
new file mode 100644
index 0000000000..49bfa4eb1e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/mix.h
@@ -0,0 +1,43 @@
+// Copyright 2016 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef UTIL_MIX_H_
+#define UTIL_MIX_H_
+
+#include <stddef.h>
+
+#include <limits>
+
+namespace lbug {
+namespace regex {
+
+// Silence "truncation of constant value" warning for kMul in 32-bit mode.
+// Since this is a header file, push and then pop to limit the scope.
+#ifdef _MSC_VER
+// #pragma warning(push)
+// #pragma warning(disable: 4309)
+#endif
+
+class HashMix {
+public:
+    HashMix() : hash_(1) {}
+    explicit HashMix(size_t val) : hash_(val + 83) {}
+    void Mix(size_t val) {
+        static const size_t kMul = static_cast<size_t>(0xdc3eb94af8ab4c93ULL);
+        hash_ *= kMul;
+        hash_ = ((hash_ << 19) | (hash_ >> (std::numeric_limits<size_t>::digits - 19))) + val;
+    }
+    size_t get() const { return hash_; }
+
+private:
+    size_t hash_;
+};
+
+#ifdef _MSC_VER
+// #pragma warning(pop)
+#endif
+
+} // namespace regex
+} // namespace lbug
+#endif // UTIL_MIX_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/mutex.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/mutex.h
new file mode 100644
index 0000000000..e5c2f37254
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/mutex.h
@@ -0,0 +1,156 @@
+// Copyright 2007 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef UTIL_MUTEX_H_
+#define UTIL_MUTEX_H_
+
+/*
+ * A simple mutex wrapper, supporting locks and read-write locks.
+ * You should assume the locks are *not* re-entrant.
+ */
+
+#if !defined(_WIN32)
+#ifndef _POSIX_C_SOURCE
+#define _POSIX_C_SOURCE 200809L
+#endif
+#include <unistd.h>
+//#if defined(_POSIX_READER_WRITER_LOCKS) && _POSIX_READER_WRITER_LOCKS > 0
+//#define MUTEX_IS_PTHREAD_RWLOCK
+//#endif
+#endif
+
+#if defined(MUTEX_IS_PTHREAD_RWLOCK)
+#error We really dont want to include pthread
+#include <pthread.h>
+#include <stdlib.h>
+typedef pthread_rwlock_t MutexType;
+#else
+#include <mutex>
+typedef std::mutex MutexType;
+#endif
+
+namespace lbug {
+namespace regex {
+
+class Mutex {
+public:
+    inline Mutex();
+    inline ~Mutex();
+    inline void Lock();   // Block if needed until free then acquire exclusively
+    inline void Unlock(); // Release a lock acquired via Lock()
+    // Note that on systems that don't support read-write locks, these may
+    // be implemented as synonyms to Lock() and Unlock().  So you can use
+    // these for efficiency, but don't use them anyplace where being able
+    // to do shared reads is necessary to avoid deadlock.
+    inline void ReaderLock();                // Block until free or shared then acquire a share
+    inline void ReaderUnlock();              // Release a read share of this Mutex
+    inline void WriterLock() { Lock(); }     // Acquire an exclusive lock
+    inline void WriterUnlock() { Unlock(); } // Release a lock from WriterLock()
+
+private:
+    MutexType mutex_;
+
+    // Catch the error of writing Mutex when intending MutexLock.
+    Mutex(Mutex* ignored);
+
+    Mutex(const Mutex&) = delete;
+    Mutex& operator=(const Mutex&) = delete;
+};
+
+#if defined(MUTEX_IS_PTHREAD_RWLOCK)
+
+#define SAFE_PTHREAD(fncall)                                                                       \
+    do {                                                                                           \
+        if ((fncall) != 0)                                                                         \
+            abort();                                                                               \
+    } while (0)
+
+Mutex::Mutex() {
+    SAFE_PTHREAD(pthread_rwlock_init(&mutex_, NULL));
+}
+Mutex::~Mutex() {
+    SAFE_PTHREAD(pthread_rwlock_destroy(&mutex_));
+}
+void Mutex::Lock() {
+    SAFE_PTHREAD(pthread_rwlock_wrlock(&mutex_));
+}
+void Mutex::Unlock() {
+    SAFE_PTHREAD(pthread_rwlock_unlock(&mutex_));
+}
+void Mutex::ReaderLock() {
+    SAFE_PTHREAD(pthread_rwlock_rdlock(&mutex_));
+}
+void Mutex::ReaderUnlock() {
+    SAFE_PTHREAD(pthread_rwlock_unlock(&mutex_));
+}
+
+#undef SAFE_PTHREAD
+
+#else
+
+Mutex::Mutex() {}
+Mutex::~Mutex() {}
+void Mutex::Lock() {
+    mutex_.lock();
+}
+void Mutex::Unlock() {
+    mutex_.unlock();
+}
+void Mutex::ReaderLock() {
+    Lock();
+} // C++11 doesn't have std::shared_mutex.
+void Mutex::ReaderUnlock() {
+    Unlock();
+}
+
+#endif
+
+// --------------------------------------------------------------------------
+// Some helper classes
+
+// MutexLock(mu) acquires mu when constructed and releases it when destroyed.
+class MutexLock {
+public:
+    explicit MutexLock(Mutex* mu) : mu_(mu) { mu_->Lock(); }
+    ~MutexLock() { mu_->Unlock(); }
+
+private:
+    Mutex* const mu_;
+
+    MutexLock(const MutexLock&) = delete;
+    MutexLock& operator=(const MutexLock&) = delete;
+};
+
+// ReaderMutexLock and WriterMutexLock do the same, for rwlocks
+class ReaderMutexLock {
+public:
+    explicit ReaderMutexLock(Mutex* mu) : mu_(mu) { mu_->ReaderLock(); }
+    ~ReaderMutexLock() { mu_->ReaderUnlock(); }
+
+private:
+    Mutex* const mu_;
+
+    ReaderMutexLock(const ReaderMutexLock&) = delete;
+    ReaderMutexLock& operator=(const ReaderMutexLock&) = delete;
+};
+
+class WriterMutexLock {
+public:
+    explicit WriterMutexLock(Mutex* mu) : mu_(mu) { mu_->WriterLock(); }
+    ~WriterMutexLock() { mu_->WriterUnlock(); }
+
+private:
+    Mutex* const mu_;
+
+    WriterMutexLock(const WriterMutexLock&) = delete;
+    WriterMutexLock& operator=(const WriterMutexLock&) = delete;
+};
+
+// Catch bug where variable name is omitted, e.g. MutexLock (&mu);
+#define MutexLock(x) static_assert(false, "MutexLock declaration missing variable name")
+#define ReaderMutexLock(x) static_assert(false, "ReaderMutexLock declaration missing variable name")
+#define WriterMutexLock(x) static_assert(false, "WriterMutexLock declaration missing variable name")
+} // namespace regex
+} // namespace lbug
+#endif // UTIL_MUTEX_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/pod_array.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/pod_array.h
new file mode 100644
index 0000000000..683e3968ba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/pod_array.h
@@ -0,0 +1,42 @@
+// Copyright 2018 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef UTIL_POD_ARRAY_H_
+#define UTIL_POD_ARRAY_H_
+
+#include <memory>
+#include <type_traits>
+
+namespace lbug {
+namespace regex {
+
+template<typename T>
+class PODArray {
+public:
+    static_assert(std::is_trivial<T>::value && std::is_standard_layout<T>::value, "T must be POD");
+
+    PODArray() : ptr_() {}
+    explicit PODArray(int len) : ptr_(std::allocator<T>().allocate(len), Deleter(len)) {}
+
+    T* data() const { return ptr_.get(); }
+
+    int size() const { return ptr_.get_deleter().len_; }
+
+    T& operator[](int pos) const { return ptr_[pos]; }
+
+private:
+    struct Deleter {
+        Deleter() : len_(0) {}
+        explicit Deleter(int len) : len_(len) {}
+
+        void operator()(T* ptr) const { std::allocator<T>().deallocate(ptr, len_); }
+
+        int len_;
+    };
+
+    std::unique_ptr<T[], Deleter> ptr_;
+};
+} // namespace regex
+} // namespace lbug
+#endif // UTIL_POD_ARRAY_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/prefilter.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/prefilter.h
new file mode 100644
index 0000000000..ba5b61984a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/prefilter.h
@@ -0,0 +1,132 @@
+// Copyright 2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_PREFILTER_H_
+#define RE2_PREFILTER_H_
+
+// Prefilter is the class used to extract string guards from regexps.
+// Rather than using Prefilter class directly, use FilteredRE2.
+// See filtered_re2.h
+
+#include <set>
+#include <string>
+#include <vector>
+
+#include "logging.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+class RE2;
+
+class Regexp;
+
+class Prefilter {
+    // Instead of using Prefilter directly, use FilteredRE2; see filtered_re2.h
+public:
+    enum Op {
+        ALL = 0, // Everything matches
+        NONE,    // Nothing matches
+        ATOM,    // The string atom() must match
+        AND,     // All in subs() must match
+        OR,      // One of subs() must match
+    };
+
+    explicit Prefilter(Op op);
+    ~Prefilter();
+
+    Op op() { return op_; }
+    const std::string& atom() const { return atom_; }
+    void set_unique_id(int id) { unique_id_ = id; }
+    int unique_id() const { return unique_id_; }
+
+    // The children of the Prefilter node.
+    std::vector<Prefilter*>* subs() {
+        DCHECK(op_ == AND || op_ == OR);
+        return subs_;
+    }
+
+    // Set the children vector. Prefilter takes ownership of subs and
+    // subs_ will be deleted when Prefilter is deleted.
+    void set_subs(std::vector<Prefilter*>* subs) { subs_ = subs; }
+
+    // Given a RE2, return a Prefilter. The caller takes ownership of
+    // the Prefilter and should deallocate it. Returns NULL if Prefilter
+    // cannot be formed.
+    static Prefilter* FromRE2(const RE2* re2);
+
+    // Returns a readable debug string of the prefilter.
+    std::string DebugString() const;
+
+private:
+    // A comparator used to store exact strings. We compare by length,
+    // then lexicographically. This ordering makes it easier to reduce the
+    // set of strings in SimplifyStringSet.
+    struct LengthThenLex {
+        bool operator()(const std::string& a, const std::string& b) const {
+            return (a.size() < b.size()) || (a.size() == b.size() && a < b);
+        }
+    };
+
+    class Info;
+
+    using SSet = std::set<std::string, LengthThenLex>;
+    using SSIter = SSet::iterator;
+    using ConstSSIter = SSet::const_iterator;
+
+    // Combines two prefilters together to create an AND. The passed
+    // Prefilters will be part of the returned Prefilter or deleted.
+    static Prefilter* And(Prefilter* a, Prefilter* b);
+
+    // Combines two prefilters together to create an OR. The passed
+    // Prefilters will be part of the returned Prefilter or deleted.
+    static Prefilter* Or(Prefilter* a, Prefilter* b);
+
+    // Generalized And/Or
+    static Prefilter* AndOr(Op op, Prefilter* a, Prefilter* b);
+
+    static Prefilter* FromRegexp(Regexp* a);
+
+    static Prefilter* FromString(const std::string& str);
+
+    static Prefilter* OrStrings(SSet* ss);
+
+    static Info* BuildInfo(Regexp* re);
+
+    Prefilter* Simplify();
+
+    // Removes redundant strings from the set. A string is redundant if
+    // any of the other strings appear as a substring. The empty string
+    // is a special case, which is ignored.
+    static void SimplifyStringSet(SSet* ss);
+
+    // Adds the cross-product of a and b to dst.
+    // (For each string i in a and j in b, add i+j.)
+    static void CrossProduct(const SSet& a, const SSet& b, SSet* dst);
+
+    // Kind of Prefilter.
+    Op op_;
+
+    // Sub-matches for AND or OR Prefilter.
+    std::vector<Prefilter*>* subs_;
+
+    // Actual string to match in leaf node.
+    std::string atom_;
+
+    // If different prefilters have the same string atom, or if they are
+    // structurally the same (e.g., OR of same atom strings) they are
+    // considered the same unique nodes. This is the id for each unique
+    // node. This field is populated with a unique id for every node,
+    // and -1 for duplicate nodes.
+    int unique_id_;
+
+    Prefilter(const Prefilter&) = delete;
+    Prefilter& operator=(const Prefilter&) = delete;
+};
+
+} // namespace regex
+} // namespace lbug
+
+#endif // RE2_PREFILTER_H_
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/prefilter_tree.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/prefilter_tree.h
new file mode 100644
index 0000000000..e05a35e7a1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/prefilter_tree.h
@@ -0,0 +1,140 @@
+// Copyright 2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_PREFILTER_TREE_H_
+#define RE2_PREFILTER_TREE_H_
+
+// The PrefilterTree class is used to form an AND-OR tree of strings
+// that would trigger each regexp. The 'prefilter' of each regexp is
+// added tp PrefilterTree, and then PrefilterTree is used to find all
+// the unique strings across the prefilters. During search, by using
+// matches from a string matching engine, PrefilterTree deduces the
+// set of regexps that are to be triggered. The 'string matching
+// engine' itself is outside of this class, and the caller can use any
+// favorite engine. PrefilterTree provides a set of strings (called
+// atoms) that the user of this class should use to do the string
+// matching.
+
+#include <map>
+#include <string>
+#include <vector>
+
+#include "prefilter.h"
+#include "sparse_array.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+class PrefilterTree {
+public:
+    PrefilterTree();
+    explicit PrefilterTree(int min_atom_len);
+    ~PrefilterTree();
+
+    // Adds the prefilter for the next regexp. Note that we assume that
+    // Add called sequentially for all regexps. All Add calls
+    // must precede Compile.
+    void Add(Prefilter* prefilter);
+
+    // The Compile returns a vector of string in atom_vec.
+    // Call this after all the prefilters are added through Add.
+    // No calls to Add after Compile are allowed.
+    // The caller should use the returned set of strings to do string matching.
+    // Each time a string matches, the corresponding index then has to be
+    // and passed to RegexpsGivenStrings below.
+    void Compile(std::vector<std::string>* atom_vec);
+
+    // Given the indices of the atoms that matched, returns the indexes
+    // of regexps that should be searched.  The matched_atoms should
+    // contain all the ids of string atoms that were found to match the
+    // content. The caller can use any string match engine to perform
+    // this function. This function is thread safe.
+    void RegexpsGivenStrings(
+        const std::vector<int>& matched_atoms, std::vector<int>* regexps) const;
+
+    // Print debug prefilter. Also prints unique ids associated with
+    // nodes of the prefilter of the regexp.
+    void PrintPrefilter(int regexpid);
+
+private:
+    typedef SparseArray<int> IntMap;
+    typedef std::map<int, int> StdIntMap;
+    typedef std::map<std::string, Prefilter*> NodeMap;
+
+    // Each unique node has a corresponding Entry that helps in
+    // passing the matching trigger information along the tree.
+    struct Entry {
+    public:
+        // How many children should match before this node triggers the
+        // parent. For an atom and an OR node, this is 1 and for an AND
+        // node, it is the number of unique children.
+        int propagate_up_at_count;
+
+        // When this node is ready to trigger the parent, what are the indices
+        // of the parent nodes to trigger. The reason there may be more than
+        // one is because of sharing. For example (abc | def) and (xyz | def)
+        // are two different nodes, but they share the atom 'def'. So when
+        // 'def' matches, it triggers two parents, corresponding to the two
+        // different OR nodes.
+        StdIntMap* parents;
+
+        // When this node is ready to trigger the parent, what are the
+        // regexps that are triggered.
+        std::vector<int> regexps;
+    };
+
+    // Returns true if the prefilter node should be kept.
+    bool KeepNode(Prefilter* node) const;
+
+    // This function assigns unique ids to various parts of the
+    // prefilter, by looking at if these nodes are already in the
+    // PrefilterTree.
+    void AssignUniqueIds(NodeMap* nodes, std::vector<std::string>* atom_vec);
+
+    // Given the matching atoms, find the regexps to be triggered.
+    void PropagateMatch(const std::vector<int>& atom_ids, IntMap* regexps) const;
+
+    // Returns the prefilter node that has the same NodeString as this
+    // node. For the canonical node, returns node.
+    Prefilter* CanonicalNode(NodeMap* nodes, Prefilter* node);
+
+    // A string that uniquely identifies the node. Assumes that the
+    // children of node has already been assigned unique ids.
+    std::string NodeString(Prefilter* node) const;
+
+    // Recursively constructs a readable prefilter string.
+    std::string DebugNodeString(Prefilter* node) const;
+
+    // Used for debugging.
+    void PrintDebugInfo(NodeMap* nodes);
+
+    // These are all the nodes formed by Compile. Essentially, there is
+    // one node for each unique atom and each unique AND/OR node.
+    std::vector<Entry> entries_;
+
+    // indices of regexps that always pass through the filter (since we
+    // found no required literals in these regexps).
+    std::vector<int> unfiltered_;
+
+    // vector of Prefilter for all regexps.
+    std::vector<Prefilter*> prefilter_vec_;
+
+    // Atom index in returned strings to entry id mapping.
+    std::vector<int> atom_index_to_id_;
+
+    // Has the prefilter tree been compiled.
+    bool compiled_;
+
+    // Strings less than this length are not stored as atoms.
+    const int min_atom_len_;
+
+    PrefilterTree(const PrefilterTree&) = delete;
+    PrefilterTree& operator=(const PrefilterTree&) = delete;
+};
+
+} // namespace regex
+} // namespace lbug
+
+#endif // RE2_PREFILTER_TREE_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/prog.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/prog.h
new file mode 100644
index 0000000000..7e116f8a5f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/prog.h
@@ -0,0 +1,475 @@
+// Copyright 2007 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_PROG_H_
+#define RE2_PROG_H_
+
+// Compiled representation of regular expressions.
+// See regexp.h for the Regexp class, which represents a regular
+// expression symbolically.
+
+#include <stdint.h>
+
+#include <functional>
+#include <mutex>
+#include <string>
+#include <type_traits>
+#include <vector>
+
+#include "logging.h"
+#include "pod_array.h"
+#include "re2.h"
+#include "sparse_array.h"
+#include "sparse_set.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+// Opcodes for Inst
+enum InstOp {
+    kInstAlt = 0,    // choose between out_ and out1_
+    kInstAltMatch,   // Alt: out_ is [00-FF] and back, out1_ is match; or vice versa.
+    kInstByteRange,  // next (possible case-folded) byte must be in [lo_, hi_]
+    kInstCapture,    // capturing parenthesis number cap_
+    kInstEmptyWidth, // empty-width special (^ $ ...); bit(s) set in empty_
+    kInstMatch,      // found a match!
+    kInstNop,        // no-op; occasionally unavoidable
+    kInstFail,       // never match; occasionally unavoidable
+    kNumInst,
+};
+
+// Bit flags for empty-width specials
+enum EmptyOp {
+    kEmptyBeginLine = 1 << 0,       // ^ - beginning of line
+    kEmptyEndLine = 1 << 1,         // $ - end of line
+    kEmptyBeginText = 1 << 2,       // \A - beginning of text
+    kEmptyEndText = 1 << 3,         // \z - end of text
+    kEmptyWordBoundary = 1 << 4,    // \b - word boundary
+    kEmptyNonWordBoundary = 1 << 5, // \B - not \b
+    kEmptyAllFlags = (1 << 6) - 1,
+};
+
+class DFA;
+class Regexp;
+
+// Compiled form of regexp program.
+class Prog {
+public:
+    Prog();
+    ~Prog();
+
+    // Single instruction in regexp program.
+    class Inst {
+    public:
+        // See the assertion below for why this is so.
+        Inst() = default;
+
+        // Copyable.
+        Inst(const Inst&) = default;
+        Inst& operator=(const Inst&) = default;
+
+        // Constructors per opcode
+        void InitAlt(uint32_t out, uint32_t out1);
+        void InitByteRange(int lo, int hi, int foldcase, uint32_t out);
+        void InitCapture(int cap, uint32_t out);
+        void InitEmptyWidth(EmptyOp empty, uint32_t out);
+        void InitMatch(int id);
+        void InitNop(uint32_t out);
+        void InitFail();
+
+        // Getters
+        int id(Prog* p) { return static_cast<int>(this - p->inst_.data()); }
+        InstOp opcode() { return static_cast<InstOp>(out_opcode_ & 7); }
+        int last() { return (out_opcode_ >> 3) & 1; }
+        int out() { return out_opcode_ >> 4; }
+        int out1() {
+            DCHECK(opcode() == kInstAlt || opcode() == kInstAltMatch);
+            return out1_;
+        }
+        int cap() {
+            DCHECK_EQ(opcode(), kInstCapture);
+            return cap_;
+        }
+        int lo() {
+            DCHECK_EQ(opcode(), kInstByteRange);
+            return lo_;
+        }
+        int hi() {
+            DCHECK_EQ(opcode(), kInstByteRange);
+            return hi_;
+        }
+        int foldcase() {
+            DCHECK_EQ(opcode(), kInstByteRange);
+            return hint_foldcase_ & 1;
+        }
+        int hint() {
+            DCHECK_EQ(opcode(), kInstByteRange);
+            return hint_foldcase_ >> 1;
+        }
+        int match_id() {
+            DCHECK_EQ(opcode(), kInstMatch);
+            return match_id_;
+        }
+        EmptyOp empty() {
+            DCHECK_EQ(opcode(), kInstEmptyWidth);
+            return empty_;
+        }
+
+        bool greedy(Prog* p) {
+            DCHECK_EQ(opcode(), kInstAltMatch);
+            return p->inst(out())->opcode() == kInstByteRange ||
+                   (p->inst(out())->opcode() == kInstNop &&
+                       p->inst(p->inst(out())->out())->opcode() == kInstByteRange);
+        }
+
+        // Does this inst (an kInstByteRange) match c?
+        inline bool Matches(int c) {
+            DCHECK_EQ(opcode(), kInstByteRange);
+            if (foldcase() && 'A' <= c && c <= 'Z')
+                c += 'a' - 'A';
+            return lo_ <= c && c <= hi_;
+        }
+
+        // Returns string representation for debugging.
+        std::string Dump();
+
+        // Maximum instruction id.
+        // (Must fit in out_opcode_. PatchList/last steal another bit.)
+        static const int kMaxInst = (1 << 28) - 1;
+
+    private:
+        void set_opcode(InstOp opcode) { out_opcode_ = (out() << 4) | (last() << 3) | opcode; }
+
+        void set_last() { out_opcode_ = (out() << 4) | (1 << 3) | opcode(); }
+
+        void set_out(int out) { out_opcode_ = (out << 4) | (last() << 3) | opcode(); }
+
+        void set_out_opcode(int out, InstOp opcode) {
+            out_opcode_ = (out << 4) | (last() << 3) | opcode;
+        }
+
+        uint32_t out_opcode_; // 28 bits: out, 1 bit: last, 3 (low) bits: opcode
+        union {               // additional instruction arguments:
+            uint32_t out1_;   // opcode == kInstAlt
+                              //   alternate next instruction
+
+            int32_t cap_; // opcode == kInstCapture
+                          //   Index of capture register (holds text
+                          //   position recorded by capturing parentheses).
+                          //   For \n (the submatch for the nth parentheses),
+                          //   the left parenthesis captures into register 2*n
+                          //   and the right one captures into register 2*n+1.
+
+            int32_t match_id_; // opcode == kInstMatch
+                               //   Match ID to identify this match (for re2::Set).
+
+            struct {                     // opcode == kInstByteRange
+                uint8_t lo_;             //   byte range is lo_-hi_ inclusive
+                uint8_t hi_;             //
+                uint16_t hint_foldcase_; // 15 bits: hint, 1 (low) bit: foldcase
+                                         //   hint to execution engines: the delta to the
+                                         //   next instruction (in the current list) worth
+                                         //   exploring iff this instruction matched; 0
+                                         //   means there are no remaining possibilities,
+                                         //   which is most likely for character classes.
+                                         //   foldcase: A-Z -> a-z before checking range.
+            };
+
+            EmptyOp empty_; // opcode == kInstEmptyWidth
+                            //   empty_ is bitwise OR of kEmpty* flags above.
+        };
+
+        friend class Compiler;
+        friend struct PatchList;
+        friend class Prog;
+    };
+
+    // Inst must be trivial so that we can freely clear it with memset(3).
+    // Arrays of Inst are initialised by copying the initial elements with
+    // memmove(3) and then clearing any remaining elements with memset(3).
+    static_assert(std::is_trivial<Inst>::value, "Inst must be trivial");
+
+    // Whether to anchor the search.
+    enum Anchor {
+        kUnanchored, // match anywhere
+        kAnchored,   // match only starting at beginning of text
+    };
+
+    // Kind of match to look for (for anchor != kFullMatch)
+    //
+    // kLongestMatch mode finds the overall longest
+    // match but still makes its submatch choices the way
+    // Perl would, not in the way prescribed by POSIX.
+    // The POSIX rules are much more expensive to implement,
+    // and no one has needed them.
+    //
+    // kFullMatch is not strictly necessary -- we could use
+    // kLongestMatch and then check the length of the match -- but
+    // the matching code can run faster if it knows to consider only
+    // full matches.
+    enum MatchKind {
+        kFirstMatch,   // like Perl, PCRE
+        kLongestMatch, // like egrep or POSIX
+        kFullMatch,    // match only entire text; implies anchor==kAnchored
+        kManyMatch     // for SearchDFA, records set of matches
+    };
+
+    Inst* inst(int id) { return &inst_[id]; }
+    int start() { return start_; }
+    void set_start(int start) { start_ = start; }
+    int start_unanchored() { return start_unanchored_; }
+    void set_start_unanchored(int start) { start_unanchored_ = start; }
+    int size() { return size_; }
+    bool reversed() { return reversed_; }
+    void set_reversed(bool reversed) { reversed_ = reversed; }
+    int list_count() { return list_count_; }
+    int inst_count(InstOp op) { return inst_count_[op]; }
+    uint16_t* list_heads() { return list_heads_.data(); }
+    size_t bit_state_text_max_size() { return bit_state_text_max_size_; }
+    int64_t dfa_mem() { return dfa_mem_; }
+    void set_dfa_mem(int64_t dfa_mem) { dfa_mem_ = dfa_mem; }
+    bool anchor_start() { return anchor_start_; }
+    void set_anchor_start(bool b) { anchor_start_ = b; }
+    bool anchor_end() { return anchor_end_; }
+    void set_anchor_end(bool b) { anchor_end_ = b; }
+    int bytemap_range() { return bytemap_range_; }
+    const uint8_t* bytemap() { return bytemap_; }
+    bool can_prefix_accel() { return prefix_size_ != 0; }
+
+    // Accelerates to the first likely occurrence of the prefix.
+    // Returns a pointer to the first byte or NULL if not found.
+    const void* PrefixAccel(const void* data, size_t size) {
+        DCHECK(can_prefix_accel());
+        if (prefix_foldcase_) {
+            return PrefixAccel_ShiftDFA(data, size);
+        } else if (prefix_size_ != 1) {
+            return PrefixAccel_FrontAndBack(data, size);
+        } else {
+            return memchr(data, prefix_front_, size);
+        }
+    }
+
+    // Configures prefix accel using the analysis performed during compilation.
+    void ConfigurePrefixAccel(const std::string& prefix, bool prefix_foldcase);
+
+    // An implementation of prefix accel that uses prefix_dfa_ to perform
+    // case-insensitive search.
+    const void* PrefixAccel_ShiftDFA(const void* data, size_t size);
+
+    // An implementation of prefix accel that looks for prefix_front_ and
+    // prefix_back_ to return fewer false positives than memchr(3) alone.
+    const void* PrefixAccel_FrontAndBack(const void* data, size_t size);
+
+    // Returns string representation of program for debugging.
+    std::string Dump();
+    std::string DumpUnanchored();
+    std::string DumpByteMap();
+
+    // Returns the set of kEmpty flags that are in effect at
+    // position p within context.
+    static uint32_t EmptyFlags(const StringPiece& context, const char* p);
+
+    // Returns whether byte c is a word character: ASCII only.
+    // Used by the implementation of \b and \B.
+    // This is not right for Unicode, but:
+    //   - it's hard to get right in a byte-at-a-time matching world
+    //     (the DFA has only one-byte lookahead).
+    //   - even if the lookahead were possible, the Progs would be huge.
+    // This crude approximation is the same one PCRE uses.
+    static bool IsWordChar(uint8_t c) {
+        return ('A' <= c && c <= 'Z') || ('a' <= c && c <= 'z') || ('0' <= c && c <= '9') ||
+               c == '_';
+    }
+
+    // Execution engines.  They all search for the regexp (run the prog)
+    // in text, which is in the larger context (used for ^ $ \b etc).
+    // Anchor and kind control the kind of search.
+    // Returns true if match found, false if not.
+    // If match found, fills match[0..nmatch-1] with submatch info.
+    // match[0] is overall match, match[1] is first set of parens, etc.
+    // If a particular submatch is not matched during the regexp match,
+    // it is set to NULL.
+    //
+    // Matching text == StringPiece(NULL, 0) is treated as any other empty
+    // string, but note that on return, it will not be possible to distinguish
+    // submatches that matched that empty string from submatches that didn't
+    // match anything.  Either way, match[i] == NULL.
+
+    // Search using NFA: can find submatches but kind of slow.
+    bool SearchNFA(const StringPiece& text, const StringPiece& context, Anchor anchor,
+        MatchKind kind, StringPiece* match, int nmatch);
+
+    // Search using DFA: much faster than NFA but only finds
+    // end of match and can use a lot more memory.
+    // Returns whether a match was found.
+    // If the DFA runs out of memory, sets *failed to true and returns false.
+    // If matches != NULL and kind == kManyMatch and there is a match,
+    // SearchDFA fills matches with the match IDs of the final matching state.
+    bool SearchDFA(const StringPiece& text, const StringPiece& context, Anchor anchor,
+        MatchKind kind, StringPiece* match0, bool* failed, SparseSet* matches);
+
+    // The callback issued after building each DFA state with BuildEntireDFA().
+    // If next is null, then the memory budget has been exhausted and building
+    // will halt. Otherwise, the state has been built and next points to an array
+    // of bytemap_range()+1 slots holding the next states as per the bytemap and
+    // kByteEndText. The number of the state is implied by the callback sequence:
+    // the first callback is for state 0, the second callback is for state 1, ...
+    // match indicates whether the state is a matching state.
+    using DFAStateCallback = std::function<void(const int* next, bool match)>;
+
+    // Build the entire DFA for the given match kind.
+    // Usually the DFA is built out incrementally, as needed, which
+    // avoids lots of unnecessary work.
+    // If cb is not empty, it receives one callback per state built.
+    // Returns the number of states built.
+    // FOR TESTING OR EXPERIMENTAL PURPOSES ONLY.
+    int BuildEntireDFA(MatchKind kind, const DFAStateCallback& cb);
+
+    // Compute bytemap.
+    void ComputeByteMap();
+
+    // Run peep-hole optimizer on program.
+    void Optimize();
+
+    // One-pass NFA: only correct if IsOnePass() is true,
+    // but much faster than NFA (competitive with PCRE)
+    // for those expressions.
+    bool IsOnePass();
+    bool SearchOnePass(const StringPiece& text, const StringPiece& context, Anchor anchor,
+        MatchKind kind, StringPiece* match, int nmatch);
+
+    // Bit-state backtracking.  Fast on small cases but uses memory
+    // proportional to the product of the list count and the text size.
+    bool CanBitState() { return list_heads_.data() != NULL; }
+    bool SearchBitState(const StringPiece& text, const StringPiece& context, Anchor anchor,
+        MatchKind kind, StringPiece* match, int nmatch);
+
+    static const int kMaxOnePassCapture = 5; // $0 through $4
+
+    // Backtracking search: the gold standard against which the other
+    // implementations are checked.  FOR TESTING ONLY.
+    // It allocates a ton of memory to avoid running forever.
+    // It is also recursive, so can't use in production (will overflow stacks).
+    // The name "Unsafe" here is supposed to be a flag that
+    // you should not be using this function.
+    bool UnsafeSearchBacktrack(const StringPiece& text, const StringPiece& context, Anchor anchor,
+        MatchKind kind, StringPiece* match, int nmatch);
+
+    // Computes range for any strings matching regexp. The min and max can in
+    // some cases be arbitrarily precise, so the caller gets to specify the
+    // maximum desired length of string returned.
+    //
+    // Assuming PossibleMatchRange(&min, &max, N) returns successfully, any
+    // string s that is an anchored match for this regexp satisfies
+    //   min <= s && s <= max.
+    //
+    // Note that PossibleMatchRange() will only consider the first copy of an
+    // infinitely repeated element (i.e., any regexp element followed by a '*' or
+    // '+' operator). Regexps with "{N}" constructions are not affected, as those
+    // do not compile down to infinite repetitions.
+    //
+    // Returns true on success, false on error.
+    bool PossibleMatchRange(std::string* min, std::string* max, int maxlen);
+
+    // Outputs the program fanout into the given sparse array.
+    void Fanout(SparseArray<int>* fanout);
+
+    // Compiles a collection of regexps to Prog.  Each regexp will have
+    // its own Match instruction recording the index in the output vector.
+    static Prog* CompileSet(Regexp* re, RE2::Anchor anchor, int64_t max_mem);
+
+    // Flattens the Prog from "tree" form to "list" form. This is an in-place
+    // operation in the sense that the old instructions are lost.
+    void Flatten();
+
+    // Walks the Prog; the "successor roots" or predecessors of the reachable
+    // instructions are marked in rootmap or predmap/predvec, respectively.
+    // reachable and stk are preallocated scratch structures.
+    void MarkSuccessors(SparseArray<int>* rootmap, SparseArray<int>* predmap,
+        std::vector<std::vector<int>>* predvec, SparseSet* reachable, std::vector<int>* stk);
+
+    // Walks the Prog from the given "root" instruction; the "dominator root"
+    // of the reachable instructions (if such exists) is marked in rootmap.
+    // reachable and stk are preallocated scratch structures.
+    void MarkDominator(int root, SparseArray<int>* rootmap, SparseArray<int>* predmap,
+        std::vector<std::vector<int>>* predvec, SparseSet* reachable, std::vector<int>* stk);
+
+    // Walks the Prog from the given "root" instruction; the reachable
+    // instructions are emitted in "list" form and appended to flat.
+    // reachable and stk are preallocated scratch structures.
+    void EmitList(int root, SparseArray<int>* rootmap, std::vector<Inst>* flat,
+        SparseSet* reachable, std::vector<int>* stk);
+
+    // Computes hints for ByteRange instructions in [begin, end).
+    void ComputeHints(std::vector<Inst>* flat, int begin, int end);
+
+    // Controls whether the DFA should bail out early if the NFA would be faster.
+    // FOR TESTING ONLY.
+    static void TESTING_ONLY_set_dfa_should_bail_when_slow(bool b);
+
+private:
+    friend class Compiler;
+
+    DFA* GetDFA(MatchKind kind);
+    void DeleteDFA(DFA* dfa);
+
+    bool anchor_start_; // regexp has explicit start anchor
+    bool anchor_end_;   // regexp has explicit end anchor
+    bool reversed_;     // whether program runs backward over input
+    bool did_flatten_;  // has Flatten been called?
+    bool did_onepass_;  // has IsOnePass been called?
+
+    int start_;            // entry point for program
+    int start_unanchored_; // unanchored entry point for program
+    int size_;             // number of instructions
+    int bytemap_range_;    // bytemap_[x] < bytemap_range_
+
+    bool prefix_foldcase_; // whether prefix is case-insensitive
+    size_t prefix_size_;   // size of prefix (0 if no prefix)
+    union {
+        uint64_t* prefix_dfa_; // "Shift DFA" for prefix
+        struct {
+            int prefix_front_; // first byte of prefix
+            int prefix_back_;  // last byte of prefix
+        };
+    };
+
+    int list_count_;                 // count of lists (see above)
+    int inst_count_[kNumInst];       // count of instructions by opcode
+    PODArray<uint16_t> list_heads_;  // sparse array enumerating list heads
+                                     // not populated if size_ is overly large
+    size_t bit_state_text_max_size_; // upper bound (inclusive) on text.size()
+
+    PODArray<Inst> inst_;             // pointer to instruction array
+    PODArray<uint8_t> onepass_nodes_; // data for OnePass nodes
+
+    int64_t dfa_mem_;  // Maximum memory for DFAs.
+    DFA* dfa_first_;   // DFA cached for kFirstMatch/kManyMatch
+    DFA* dfa_longest_; // DFA cached for kLongestMatch/kFullMatch
+
+    uint8_t bytemap_[256]; // map from input bytes to byte classes
+
+    std::once_flag dfa_first_once_;
+    std::once_flag dfa_longest_once_;
+
+    Prog(const Prog&) = delete;
+    Prog& operator=(const Prog&) = delete;
+};
+
+// std::string_view in MSVC has iterators that aren't just pointers and
+// that don't allow comparisons between different objects - not even if
+// those objects are views into the same string! Thus, we provide these
+// conversion functions for convenience.
+static inline const char* BeginPtr(const StringPiece& s) {
+    return s.data();
+}
+static inline const char* EndPtr(const StringPiece& s) {
+    return s.data() + s.size();
+}
+
+} // namespace regex
+} // namespace lbug
+
+#endif // RE2_PROG_H_
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/re2.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/re2.h
new file mode 100644
index 0000000000..952ef5827c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/re2.h
@@ -0,0 +1,1010 @@
+// Copyright 2003-2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_RE2_H_
+#define RE2_RE2_H_
+
+// C++ interface to the re2 regular-expression library.
+// RE2 supports Perl-style regular expressions (with extensions like
+// \d, \w, \s, ...).
+//
+// -----------------------------------------------------------------------
+// REGEXP SYNTAX:
+//
+// This module uses the re2 library and hence supports
+// its syntax for regular expressions, which is similar to Perl's with
+// some of the more complicated things thrown away.  In particular,
+// backreferences and generalized assertions are not available, nor is \Z.
+//
+// See https://github.com/google/re2/wiki/Syntax for the syntax
+// supported by RE2, and a comparison with PCRE and PERL regexps.
+//
+// For those not familiar with Perl's regular expressions,
+// here are some examples of the most commonly used extensions:
+//
+//   "hello (\\w+) world"  -- \w matches a "word" character
+//   "version (\\d+)"      -- \d matches a digit
+//   "hello\\s+world"      -- \s matches any whitespace character
+//   "\\b(\\w+)\\b"        -- \b matches non-empty string at word boundary
+//   "(?i)hello"           -- (?i) turns on case-insensitive matching
+//   "/\\*(.*?)\\*/"       -- .*? matches . minimum no. of times possible
+//
+// The double backslashes are needed when writing C++ string literals.
+// However, they should NOT be used when writing C++11 raw string literals:
+//
+//   R"(hello (\w+) world)"  -- \w matches a "word" character
+//   R"(version (\d+))"      -- \d matches a digit
+//   R"(hello\s+world)"      -- \s matches any whitespace character
+//   R"(\b(\w+)\b)"          -- \b matches non-empty string at word boundary
+//   R"((?i)hello)"          -- (?i) turns on case-insensitive matching
+//   R"(/\*(.*?)\*/)"        -- .*? matches . minimum no. of times possible
+//
+// When using UTF-8 encoding, case-insensitive matching will perform
+// simple case folding, not full case folding.
+//
+// -----------------------------------------------------------------------
+// MATCHING INTERFACE:
+//
+// The "FullMatch" operation checks that supplied text matches a
+// supplied pattern exactly.
+//
+// Example: successful match
+//    CHECK(RE2::FullMatch("hello", "h.*o"));
+//
+// Example: unsuccessful match (requires full match):
+//    CHECK(!RE2::FullMatch("hello", "e"));
+//
+// -----------------------------------------------------------------------
+// UTF-8 AND THE MATCHING INTERFACE:
+//
+// By default, the pattern and input text are interpreted as UTF-8.
+// The RE2::Latin1 option causes them to be interpreted as Latin-1.
+//
+// Example:
+//    CHECK(RE2::FullMatch(utf8_string, RE2(utf8_pattern)));
+//    CHECK(RE2::FullMatch(latin1_string, RE2(latin1_pattern, RE2::Latin1)));
+//
+// -----------------------------------------------------------------------
+// SUBMATCH EXTRACTION:
+//
+// You can supply extra pointer arguments to extract submatches.
+// On match failure, none of the pointees will have been modified.
+// On match success, the submatches will be converted (as necessary) and
+// their values will be assigned to their pointees until all conversions
+// have succeeded or one conversion has failed.
+// On conversion failure, the pointees will be in an indeterminate state
+// because the caller has no way of knowing which conversion failed.
+// However, conversion cannot fail for types like string and StringPiece
+// that do not inspect the submatch contents. Hence, in the common case
+// where all of the pointees are of such types, failure is always due to
+// match failure and thus none of the pointees will have been modified.
+//
+// Example: extracts "ruby" into "s" and 1234 into "i"
+//    int i;
+//    std::string s;
+//    CHECK(RE2::FullMatch("ruby:1234", "(\\w+):(\\d+)", &s, &i));
+//
+// Example: fails because string cannot be stored in integer
+//    CHECK(!RE2::FullMatch("ruby", "(.*)", &i));
+//
+// Example: fails because there aren't enough sub-patterns
+//    CHECK(!RE2::FullMatch("ruby:1234", "\\w+:\\d+", &s));
+//
+// Example: does not try to extract any extra sub-patterns
+//    CHECK(RE2::FullMatch("ruby:1234", "(\\w+):(\\d+)", &s));
+//
+// Example: does not try to extract into NULL
+//    CHECK(RE2::FullMatch("ruby:1234", "(\\w+):(\\d+)", NULL, &i));
+//
+// Example: integer overflow causes failure
+//    CHECK(!RE2::FullMatch("ruby:1234567891234", "\\w+:(\\d+)", &i));
+//
+// NOTE(rsc): Asking for submatches slows successful matches quite a bit.
+// This may get a little faster in the future, but right now is slower
+// than PCRE.  On the other hand, failed matches run *very* fast (faster
+// than PCRE), as do matches without submatch extraction.
+//
+// -----------------------------------------------------------------------
+// PARTIAL MATCHES
+//
+// You can use the "PartialMatch" operation when you want the pattern
+// to match any substring of the text.
+//
+// Example: simple search for a string:
+//      CHECK(RE2::PartialMatch("hello", "ell"));
+//
+// Example: find first number in a string
+//      int number;
+//      CHECK(RE2::PartialMatch("x*100 + 20", "(\\d+)", &number));
+//      CHECK_EQ(number, 100);
+//
+// -----------------------------------------------------------------------
+// PRE-COMPILED REGULAR EXPRESSIONS
+//
+// RE2 makes it easy to use any string as a regular expression, without
+// requiring a separate compilation step.
+//
+// If speed is of the essence, you can create a pre-compiled "RE2"
+// object from the pattern and use it multiple times.  If you do so,
+// you can typically parse text faster than with sscanf.
+//
+// Example: precompile pattern for faster matching:
+//    RE2 pattern("h.*o");
+//    while (ReadLine(&str)) {
+//      if (RE2::FullMatch(str, pattern)) ...;
+//    }
+//
+// -----------------------------------------------------------------------
+// SCANNING TEXT INCREMENTALLY
+//
+// The "Consume" operation may be useful if you want to repeatedly
+// match regular expressions at the front of a string and skip over
+// them as they match.  This requires use of the "StringPiece" type,
+// which represents a sub-range of a real string.
+//
+// Example: read lines of the form "var = value" from a string.
+//      std::string contents = ...;     // Fill string somehow
+//      StringPiece input(contents);    // Wrap a StringPiece around it
+//
+//      std::string var;
+//      int value;
+//      while (RE2::Consume(&input, "(\\w+) = (\\d+)\n", &var, &value)) {
+//        ...;
+//      }
+//
+// Each successful call to "Consume" will set "var/value", and also
+// advance "input" so it points past the matched text.  Note that if the
+// regular expression matches an empty string, input will advance
+// by 0 bytes.  If the regular expression being used might match
+// an empty string, the loop body must check for this case and either
+// advance the string or break out of the loop.
+//
+// The "FindAndConsume" operation is similar to "Consume" but does not
+// anchor your match at the beginning of the string.  For example, you
+// could extract all words from a string by repeatedly calling
+//     RE2::FindAndConsume(&input, "(\\w+)", &word)
+//
+// -----------------------------------------------------------------------
+// USING VARIABLE NUMBER OF ARGUMENTS
+//
+// The above operations require you to know the number of arguments
+// when you write the code.  This is not always possible or easy (for
+// example, the regular expression may be calculated at run time).
+// You can use the "N" version of the operations when the number of
+// match arguments are determined at run time.
+//
+// Example:
+//   const RE2::Arg* args[10];
+//   int n;
+//   // ... populate args with pointers to RE2::Arg values ...
+//   // ... set n to the number of RE2::Arg objects ...
+//   bool match = RE2::FullMatchN(input, pattern, args, n);
+//
+// The last statement is equivalent to
+//
+//   bool match = RE2::FullMatch(input, pattern,
+//                               *args[0], *args[1], ..., *args[n - 1]);
+//
+// -----------------------------------------------------------------------
+// PARSING HEX/OCTAL/C-RADIX NUMBERS
+//
+// By default, if you pass a pointer to a numeric value, the
+// corresponding text is interpreted as a base-10 number.  You can
+// instead wrap the pointer with a call to one of the operators Hex(),
+// Octal(), or CRadix() to interpret the text in another base.  The
+// CRadix operator interprets C-style "0" (base-8) and "0x" (base-16)
+// prefixes, but defaults to base-10.
+//
+// Example:
+//   int a, b, c, d;
+//   CHECK(RE2::FullMatch("100 40 0100 0x40", "(.*) (.*) (.*) (.*)",
+//         RE2::Octal(&a), RE2::Hex(&b), RE2::CRadix(&c), RE2::CRadix(&d));
+// will leave 64 in a, b, c, and d.
+
+#include <stddef.h>
+#include <stdint.h>
+
+#include <algorithm>
+#include <map>
+#include <mutex>
+#include <string>
+#include <type_traits>
+#include <vector>
+
+#if defined(__APPLE__)
+#include <TargetConditionals.h>
+#endif
+
+#include "stringpiece.h"
+
+namespace lbug {
+namespace regex {
+class Prog;
+class Regexp;
+} // namespace regex
+} // namespace lbug
+
+namespace lbug {
+namespace regex {
+
+// Interface for regular expression matching.  Also corresponds to a
+// pre-compiled regular expression.  An "RE2" object is safe for
+// concurrent use by multiple threads.
+class RE2 {
+public:
+    // We convert user-passed pointers into special Arg objects
+    class Arg;
+    class Options;
+
+    // Defined in set.h.
+    class Set;
+
+    enum ErrorCode {
+        NoError = 0,
+
+        // Unexpected error
+        ErrorInternal,
+
+        // Parse errors
+        ErrorBadEscape,         // bad escape sequence
+        ErrorBadCharClass,      // bad character class
+        ErrorBadCharRange,      // bad character class range
+        ErrorMissingBracket,    // missing closing ]
+        ErrorMissingParen,      // missing closing )
+        ErrorUnexpectedParen,   // unexpected closing )
+        ErrorTrailingBackslash, // trailing \ at end of regexp
+        ErrorRepeatArgument,    // repeat argument missing, e.g. "*"
+        ErrorRepeatSize,        // bad repetition argument
+        ErrorRepeatOp,          // bad repetition operator
+        ErrorBadPerlOp,         // bad perl operator
+        ErrorBadUTF8,           // invalid UTF-8 in regexp
+        ErrorBadNamedCapture,   // bad named capture group
+        ErrorPatternTooLarge    // pattern too large (compile failed)
+    };
+
+    // Predefined common options.
+    // If you need more complicated things, instantiate
+    // an Option class, possibly passing one of these to
+    // the Option constructor, change the settings, and pass that
+    // Option class to the RE2 constructor.
+    enum CannedOptions {
+        DefaultOptions = 0,
+        Latin1, // treat input as Latin-1 (default UTF-8)
+        POSIX,  // POSIX syntax, leftmost-longest match
+        Quiet   // do not log about regexp parse errors
+    };
+
+    // Need to have the const char* and const std::string& forms for implicit
+    // conversions when passing string literals to FullMatch and PartialMatch.
+    // Otherwise the StringPiece form would be sufficient.
+    RE2(const char* pattern);
+    RE2(const std::string& pattern);
+    RE2(const StringPiece& pattern);
+    RE2(const StringPiece& pattern, const Options& options);
+    ~RE2();
+
+    // Not copyable.
+    // RE2 objects are expensive. You should probably use std::shared_ptr<RE2>
+    // instead. If you really must copy, RE2(first.pattern(), first.options())
+    // effectively does so: it produces a second object that mimics the first.
+    RE2(const RE2&) = delete;
+    RE2& operator=(const RE2&) = delete;
+    // Not movable.
+    // RE2 objects are thread-safe and logically immutable. You should probably
+    // use std::unique_ptr<RE2> instead. Otherwise, consider std::deque<RE2> if
+    // direct emplacement into a container is desired. If you really must move,
+    // be prepared to submit a design document along with your feature request.
+    RE2(RE2&&) = delete;
+    RE2& operator=(RE2&&) = delete;
+
+    // Returns whether RE2 was created properly.
+    bool ok() const { return error_code() == NoError; }
+
+    // The string specification for this RE2.  E.g.
+    //   RE2 re("ab*c?d+");
+    //   re.pattern();    // "ab*c?d+"
+    const std::string& pattern() const { return *pattern_; }
+
+    // If RE2 could not be created properly, returns an error string.
+    // Else returns the empty string.
+    const std::string& error() const { return *error_; }
+
+    // If RE2 could not be created properly, returns an error code.
+    // Else returns RE2::NoError (== 0).
+    ErrorCode error_code() const { return error_code_; }
+
+    // If RE2 could not be created properly, returns the offending
+    // portion of the regexp.
+    const std::string& error_arg() const { return *error_arg_; }
+
+    // Returns the program size, a very approximate measure of a regexp's "cost".
+    // Larger numbers are more expensive than smaller numbers.
+    int ProgramSize() const;
+    int ReverseProgramSize() const;
+
+    // If histogram is not null, outputs the program fanout
+    // as a histogram bucketed by powers of 2.
+    // Returns the number of the largest non-empty bucket.
+    int ProgramFanout(std::vector<int>* histogram) const;
+    int ReverseProgramFanout(std::vector<int>* histogram) const;
+
+    // Returns the underlying Regexp; not for general use.
+    // Returns entire_regexp_ so that callers don't need
+    // to know about prefix_ and prefix_foldcase_.
+    Regexp* getEntireRegex() const { return entire_regexp_; }
+
+    /***** The array-based matching interface ******/
+
+    // The functions here have names ending in 'N' and are used to implement
+    // the functions whose names are the prefix before the 'N'. It is sometimes
+    // useful to invoke them directly, but the syntax is awkward, so the 'N'-less
+    // versions should be preferred.
+    static bool FullMatchN(const StringPiece& text, const RE2& re, const Arg* const args[], int n);
+    static bool PartialMatchN(
+        const StringPiece& text, const RE2& re, const Arg* const args[], int n);
+    static bool ConsumeN(StringPiece* input, const RE2& re, const Arg* const args[], int n);
+    static bool FindAndConsumeN(StringPiece* input, const RE2& re, const Arg* const args[], int n);
+
+private:
+    template<typename F, typename SP>
+    static inline bool Apply(F f, SP sp, const RE2& re) {
+        return f(sp, re, NULL, 0);
+    }
+
+    template<typename F, typename SP, typename... A>
+    static inline bool Apply(F f, SP sp, const RE2& re, const A&... a) {
+        const Arg* const args[] = {&a...};
+        const int n = sizeof...(a);
+        return f(sp, re, args, n);
+    }
+
+public:
+    // In order to allow FullMatch() et al. to be called with a varying number
+    // of arguments of varying types, we use two layers of variadic templates.
+    // The first layer constructs the temporary Arg objects. The second layer
+    // (above) constructs the array of pointers to the temporary Arg objects.
+
+    /***** The useful part: the matching interface *****/
+
+    // Matches "text" against "re".  If pointer arguments are
+    // supplied, copies matched sub-patterns into them.
+    //
+    // You can pass in a "const char*" or a "std::string" for "text".
+    // You can pass in a "const char*" or a "std::string" or a "RE2" for "re".
+    //
+    // The provided pointer arguments can be pointers to any scalar numeric
+    // type, or one of:
+    //    std::string     (matched piece is copied to string)
+    //    StringPiece     (StringPiece is mutated to point to matched piece)
+    //    T               (where "bool T::ParseFrom(const char*, size_t)" exists)
+    //    (void*)NULL     (the corresponding matched sub-pattern is not copied)
+    //
+    // Returns true iff all of the following conditions are satisfied:
+    //   a. "text" matches "re" fully - from the beginning to the end of "text".
+    //   b. The number of matched sub-patterns is >= number of supplied pointers.
+    //   c. The "i"th argument has a suitable type for holding the
+    //      string captured as the "i"th sub-pattern.  If you pass in
+    //      NULL for the "i"th argument, or pass fewer arguments than
+    //      number of sub-patterns, the "i"th captured sub-pattern is
+    //      ignored.
+    //
+    // CAVEAT: An optional sub-pattern that does not exist in the
+    // matched string is assigned the empty string.  Therefore, the
+    // following will return false (because the empty string is not a
+    // valid number):
+    //    int number;
+    //    RE2::FullMatch("abc", "[a-z]+(\\d+)?", &number);
+    template<typename... A>
+    static bool FullMatch(const StringPiece& text, const RE2& re, A&&... a) {
+        return Apply(FullMatchN, text, re, Arg(std::forward<A>(a))...);
+    }
+
+    // Like FullMatch(), except that "re" is allowed to match a substring
+    // of "text".
+    //
+    // Returns true iff all of the following conditions are satisfied:
+    //   a. "text" matches "re" partially - for some substring of "text".
+    //   b. The number of matched sub-patterns is >= number of supplied pointers.
+    //   c. The "i"th argument has a suitable type for holding the
+    //      string captured as the "i"th sub-pattern.  If you pass in
+    //      NULL for the "i"th argument, or pass fewer arguments than
+    //      number of sub-patterns, the "i"th captured sub-pattern is
+    //      ignored.
+    template<typename... A>
+    static bool PartialMatch(const StringPiece& text, const RE2& re, A&&... a) {
+        return Apply(PartialMatchN, text, re, Arg(std::forward<A>(a))...);
+    }
+
+    // Like FullMatch() and PartialMatch(), except that "re" has to match
+    // a prefix of the text, and "input" is advanced past the matched
+    // text.  Note: "input" is modified iff this routine returns true
+    // and "re" matched a non-empty substring of "input".
+    //
+    // Returns true iff all of the following conditions are satisfied:
+    //   a. "input" matches "re" partially - for some prefix of "input".
+    //   b. The number of matched sub-patterns is >= number of supplied pointers.
+    //   c. The "i"th argument has a suitable type for holding the
+    //      string captured as the "i"th sub-pattern.  If you pass in
+    //      NULL for the "i"th argument, or pass fewer arguments than
+    //      number of sub-patterns, the "i"th captured sub-pattern is
+    //      ignored.
+    template<typename... A>
+    static bool Consume(StringPiece* input, const RE2& re, A&&... a) {
+        return Apply(ConsumeN, input, re, Arg(std::forward<A>(a))...);
+    }
+
+    // Like Consume(), but does not anchor the match at the beginning of
+    // the text.  That is, "re" need not start its match at the beginning
+    // of "input".  For example, "FindAndConsume(s, "(\\w+)", &word)" finds
+    // the next word in "s" and stores it in "word".
+    //
+    // Returns true iff all of the following conditions are satisfied:
+    //   a. "input" matches "re" partially - for some substring of "input".
+    //   b. The number of matched sub-patterns is >= number of supplied pointers.
+    //   c. The "i"th argument has a suitable type for holding the
+    //      string captured as the "i"th sub-pattern.  If you pass in
+    //      NULL for the "i"th argument, or pass fewer arguments than
+    //      number of sub-patterns, the "i"th captured sub-pattern is
+    //      ignored.
+    template<typename... A>
+    static bool FindAndConsume(StringPiece* input, const RE2& re, A&&... a) {
+        return Apply(FindAndConsumeN, input, re, Arg(std::forward<A>(a))...);
+    }
+
+    // Replace the first match of "re" in "str" with "rewrite".
+    // Within "rewrite", backslash-escaped digits (\1 to \9) can be
+    // used to insert text matching corresponding parenthesized group
+    // from the pattern.  \0 in "rewrite" refers to the entire matching
+    // text.  E.g.,
+    //
+    //   std::string s = "yabba dabba doo";
+    //   CHECK(RE2::Replace(&s, "b+", "d"));
+    //
+    // will leave "s" containing "yada dabba doo"
+    //
+    // Returns true if the pattern matches and a replacement occurs,
+    // false otherwise.
+    static bool Replace(std::string* str, const RE2& re, const StringPiece& rewrite);
+
+    // Like Replace(), except replaces successive non-overlapping occurrences
+    // of the pattern in the string with the rewrite. E.g.
+    //
+    //   std::string s = "yabba dabba doo";
+    //   CHECK(RE2::GlobalReplace(&s, "b+", "d"));
+    //
+    // will leave "s" containing "yada dada doo"
+    // Replacements are not subject to re-matching.
+    //
+    // Because GlobalReplace only replaces non-overlapping matches,
+    // replacing "ana" within "banana" makes only one replacement, not two.
+    //
+    // Returns the number of replacements made.
+    static int GlobalReplace(std::string* str, const RE2& re, const StringPiece& rewrite);
+
+    // Like Replace, except that if the pattern matches, "rewrite"
+    // is copied into "out" with substitutions.  The non-matching
+    // portions of "text" are ignored.
+    //
+    // Returns true iff a match occurred and the extraction happened
+    // successfully;  if no match occurs, the string is left unaffected.
+    //
+    // REQUIRES: "text" must not alias any part of "*out".
+    static bool Extract(
+        const StringPiece& text, const RE2& re, const StringPiece& rewrite, std::string* out);
+
+    // Escapes all potentially meaningful regexp characters in
+    // 'unquoted'.  The returned string, used as a regular expression,
+    // will match exactly the original string.  For example,
+    //           1.5-2.0?
+    // may become:
+    //           1\.5\-2\.0\?
+    static std::string QuoteMeta(const StringPiece& unquoted);
+
+    // Computes range for any strings matching regexp. The min and max can in
+    // some cases be arbitrarily precise, so the caller gets to specify the
+    // maximum desired length of string returned.
+    //
+    // Assuming PossibleMatchRange(&min, &max, N) returns successfully, any
+    // string s that is an anchored match for this regexp satisfies
+    //   min <= s && s <= max.
+    //
+    // Note that PossibleMatchRange() will only consider the first copy of an
+    // infinitely repeated element (i.e., any regexp element followed by a '*' or
+    // '+' operator). Regexps with "{N}" constructions are not affected, as those
+    // do not compile down to infinite repetitions.
+    //
+    // Returns true on success, false on error.
+    bool PossibleMatchRange(std::string* min, std::string* max, int maxlen) const;
+
+    // Generic matching interface
+
+    // Type of match.
+    enum Anchor {
+        UNANCHORED,   // No anchoring
+        ANCHOR_START, // Anchor at start only
+        ANCHOR_BOTH   // Anchor at start and end
+    };
+
+    // Return the number of capturing subpatterns, or -1 if the
+    // regexp wasn't valid on construction.  The overall match ($0)
+    // does not count: if the regexp is "(a)(b)", returns 2.
+    int NumberOfCapturingGroups() const { return num_captures_; }
+
+    // Return a map from names to capturing indices.
+    // The map records the index of the leftmost group
+    // with the given name.
+    // Only valid until the re is deleted.
+    const std::map<std::string, int>& NamedCapturingGroups() const;
+
+    // Return a map from capturing indices to names.
+    // The map has no entries for unnamed groups.
+    // Only valid until the re is deleted.
+    const std::map<int, std::string>& CapturingGroupNames() const;
+
+    // General matching routine.
+    // Match against text starting at offset startpos
+    // and stopping the search at offset endpos.
+    // Returns true if match found, false if not.
+    // On a successful match, fills in submatch[] (up to nsubmatch entries)
+    // with information about submatches.
+    // I.e. matching RE2("(foo)|(bar)baz") on "barbazbla" will return true, with
+    // submatch[0] = "barbaz", submatch[1].data() = NULL, submatch[2] = "bar",
+    // submatch[3].data() = NULL, ..., up to submatch[nsubmatch-1].data() = NULL.
+    // Caveat: submatch[] may be clobbered even on match failure.
+    //
+    // Don't ask for more match information than you will use:
+    // runs much faster with nsubmatch == 1 than nsubmatch > 1, and
+    // runs even faster if nsubmatch == 0.
+    // Doesn't make sense to use nsubmatch > 1 + NumberOfCapturingGroups(),
+    // but will be handled correctly.
+    //
+    // Passing text == StringPiece(NULL, 0) will be handled like any other
+    // empty string, but note that on return, it will not be possible to tell
+    // whether submatch i matched the empty string or did not match:
+    // either way, submatch[i].data() == NULL.
+    bool Match(const StringPiece& text, size_t startpos, size_t endpos, Anchor re_anchor,
+        StringPiece* submatch, int nsubmatch) const;
+
+    // Check that the given rewrite string is suitable for use with this
+    // regular expression.  It checks that:
+    //   * The regular expression has enough parenthesized subexpressions
+    //     to satisfy all of the \N tokens in rewrite
+    //   * The rewrite string doesn't have any syntax errors.  E.g.,
+    //     '\' followed by anything other than a digit or '\'.
+    // A true return value guarantees that Replace() and Extract() won't
+    // fail because of a bad rewrite string.
+    bool CheckRewriteString(const StringPiece& rewrite, std::string* error) const;
+
+    // Returns the maximum submatch needed for the rewrite to be done by
+    // Replace(). E.g. if rewrite == "foo \\2,\\1", returns 2.
+    static int MaxSubmatch(const StringPiece& rewrite);
+
+    // Append the "rewrite" string, with backslash subsitutions from "vec",
+    // to string "out".
+    // Returns true on success.  This method can fail because of a malformed
+    // rewrite string.  CheckRewriteString guarantees that the rewrite will
+    // be sucessful.
+    bool Rewrite(
+        std::string* out, const StringPiece& rewrite, const StringPiece* vec, int veclen) const;
+
+    // Constructor options
+    class Options {
+    public:
+        // The options are (defaults in parentheses):
+        //
+        //   utf8             (true)  text and pattern are UTF-8; otherwise Latin-1
+        //   posix_syntax     (false) restrict regexps to POSIX egrep syntax
+        //   longest_match    (false) search for longest match, not first match
+        //   log_errors       (true)  log syntax and execution errors to ERROR
+        //   max_mem          (see below)  approx. max memory footprint of RE2
+        //   literal          (false) interpret string as literal, not regexp
+        //   never_nl         (false) never match \n, even if it is in regexp
+        //   dot_nl           (false) dot matches everything including new line
+        //   never_capture    (false) parse all parens as non-capturing
+        //   case_sensitive   (true)  match is case-sensitive (regexp can override
+        //                              with (?i) unless in posix_syntax mode)
+        //
+        // The following options are only consulted when posix_syntax == true.
+        // When posix_syntax == false, these features are always enabled and
+        // cannot be turned off; to perform multi-line matching in that case,
+        // begin the regexp with (?m).
+        //   perl_classes     (false) allow Perl's \d \s \w \D \S \W
+        //   word_boundary    (false) allow Perl's \b \B (word boundary and not)
+        //   one_line         (false) ^ and $ only match beginning and end of text
+        //
+        // The max_mem option controls how much memory can be used
+        // to hold the compiled form of the regexp (the Prog) and
+        // its cached DFA graphs.  Code Search placed limits on the number
+        // of Prog instructions and DFA states: 10,000 for both.
+        // In RE2, those limits would translate to about 240 KB per Prog
+        // and perhaps 2.5 MB per DFA (DFA state sizes vary by regexp; RE2 does a
+        // better job of keeping them small than Code Search did).
+        // Each RE2 has two Progs (one forward, one reverse), and each Prog
+        // can have two DFAs (one first match, one longest match).
+        // That makes 4 DFAs:
+        //
+        //   forward, first-match    - used for UNANCHORED or ANCHOR_START searches
+        //                               if opt.longest_match() == false
+        //   forward, longest-match  - used for all ANCHOR_BOTH searches,
+        //                               and the other two kinds if
+        //                               opt.longest_match() == true
+        //   reverse, first-match    - never used
+        //   reverse, longest-match  - used as second phase for unanchored searches
+        //
+        // The RE2 memory budget is statically divided between the two
+        // Progs and then the DFAs: two thirds to the forward Prog
+        // and one third to the reverse Prog.  The forward Prog gives half
+        // of what it has left over to each of its DFAs.  The reverse Prog
+        // gives it all to its longest-match DFA.
+        //
+        // Once a DFA fills its budget, it flushes its cache and starts over.
+        // If this happens too often, RE2 falls back on the NFA implementation.
+
+        // For now, make the default budget something close to Code Search.
+        static const int kDefaultMaxMem = 8 << 20;
+
+        enum Encoding { EncodingUTF8 = 1, EncodingLatin1 };
+
+        Options()
+            : max_mem_(kDefaultMaxMem), encoding_(EncodingUTF8), posix_syntax_(false),
+              longest_match_(false), log_errors_(true), literal_(false), never_nl_(false),
+              dot_nl_(false), never_capture_(false), case_sensitive_(true), perl_classes_(false),
+              word_boundary_(false), one_line_(false) {}
+
+        /*implicit*/ Options(CannedOptions);
+
+        int64_t max_mem() const { return max_mem_; }
+        void set_max_mem(int64_t m) { max_mem_ = m; }
+
+        Encoding encoding() const { return encoding_; }
+        void set_encoding(Encoding encoding) { encoding_ = encoding; }
+
+        bool posix_syntax() const { return posix_syntax_; }
+        void set_posix_syntax(bool b) { posix_syntax_ = b; }
+
+        bool longest_match() const { return longest_match_; }
+        void set_longest_match(bool b) { longest_match_ = b; }
+
+        bool log_errors() const { return log_errors_; }
+        void set_log_errors(bool b) { log_errors_ = b; }
+
+        bool literal() const { return literal_; }
+        void set_literal(bool b) { literal_ = b; }
+
+        bool never_nl() const { return never_nl_; }
+        void set_never_nl(bool b) { never_nl_ = b; }
+
+        bool dot_nl() const { return dot_nl_; }
+        void set_dot_nl(bool b) { dot_nl_ = b; }
+
+        bool never_capture() const { return never_capture_; }
+        void set_never_capture(bool b) { never_capture_ = b; }
+
+        bool case_sensitive() const { return case_sensitive_; }
+        void set_case_sensitive(bool b) { case_sensitive_ = b; }
+
+        bool perl_classes() const { return perl_classes_; }
+        void set_perl_classes(bool b) { perl_classes_ = b; }
+
+        bool word_boundary() const { return word_boundary_; }
+        void set_word_boundary(bool b) { word_boundary_ = b; }
+
+        bool one_line() const { return one_line_; }
+        void set_one_line(bool b) { one_line_ = b; }
+
+        void Copy(const Options& src) { *this = src; }
+
+        int ParseFlags() const;
+
+    private:
+        int64_t max_mem_;
+        Encoding encoding_;
+        bool posix_syntax_;
+        bool longest_match_;
+        bool log_errors_;
+        bool literal_;
+        bool never_nl_;
+        bool dot_nl_;
+        bool never_capture_;
+        bool case_sensitive_;
+        bool perl_classes_;
+        bool word_boundary_;
+        bool one_line_;
+    };
+
+    // Returns the options set in the constructor.
+    const Options& options() const { return options_; }
+
+    // Argument converters; see below.
+    template<typename T>
+    static Arg CRadix(T* ptr);
+    template<typename T>
+    static Arg Hex(T* ptr);
+    template<typename T>
+    static Arg Octal(T* ptr);
+
+    // Controls the maximum count permitted by GlobalReplace(); -1 is unlimited.
+    // FOR FUZZING ONLY.
+    static void FUZZING_ONLY_set_maximum_global_replace_count(int i);
+
+private:
+    void Init(const StringPiece& pattern, const Options& options);
+
+    bool DoMatch(const StringPiece& text, Anchor re_anchor, size_t* consumed,
+        const Arg* const args[], int n) const;
+
+    Prog* ReverseProg() const;
+
+    // First cache line is relatively cold fields.
+    const std::string* pattern_;         // string regular expression
+    Options options_;                    // option flags
+    lbug::regex::Regexp* entire_regexp_; // parsed regular expression
+    lbug::regex::Regexp* suffix_regexp_; // parsed regular expression, prefix_ removed
+    const std::string* error_;           // error indicator (or points to empty string)
+    const std::string* error_arg_;       // fragment of regexp showing error (or ditto)
+
+    // Second cache line is relatively hot fields.
+    // These are ordered oddly to pack everything.
+    int num_captures_;          // number of capturing groups
+    ErrorCode error_code_ : 29; // error code (29 bits is more than enough)
+    bool longest_match_ : 1;    // cached copy of options_.longest_match()
+    bool is_one_pass_ : 1;      // can use prog_->SearchOnePass?
+    bool prefix_foldcase_ : 1;  // prefix_ is ASCII case-insensitive
+    std::string prefix_;        // required prefix (before suffix_regexp_)
+    Prog* prog_;                // compiled program for regexp
+
+    // Reverse Prog for DFA execution only
+    mutable Prog* rprog_;
+    // Map from capture names to indices
+    mutable const std::map<std::string, int>* named_groups_;
+    // Map from capture indices to names
+    mutable const std::map<int, std::string>* group_names_;
+
+    mutable std::once_flag rprog_once_;
+    mutable std::once_flag named_groups_once_;
+    mutable std::once_flag group_names_once_;
+};
+
+/***** Implementation details *****/
+
+namespace re2_internal {
+
+// Types for which the 3-ary Parse() function template has specializations.
+template<typename T>
+struct Parse3ary : public std::false_type {};
+template<>
+struct Parse3ary<void> : public std::true_type {};
+template<>
+struct Parse3ary<std::string> : public std::true_type {};
+template<>
+struct Parse3ary<StringPiece> : public std::true_type {};
+template<>
+struct Parse3ary<char> : public std::true_type {};
+template<>
+struct Parse3ary<signed char> : public std::true_type {};
+template<>
+struct Parse3ary<unsigned char> : public std::true_type {};
+template<>
+struct Parse3ary<float> : public std::true_type {};
+template<>
+struct Parse3ary<double> : public std::true_type {};
+
+template<typename T>
+bool Parse(const char* str, size_t n, T* dest);
+
+// Types for which the 4-ary Parse() function template has specializations.
+template<typename T>
+struct Parse4ary : public std::false_type {};
+template<>
+struct Parse4ary<long> : public std::true_type {};
+template<>
+struct Parse4ary<unsigned long> : public std::true_type {};
+template<>
+struct Parse4ary<short> : public std::true_type {};
+template<>
+struct Parse4ary<unsigned short> : public std::true_type {};
+template<>
+struct Parse4ary<int> : public std::true_type {};
+template<>
+struct Parse4ary<unsigned int> : public std::true_type {};
+template<>
+struct Parse4ary<long long> : public std::true_type {};
+template<>
+struct Parse4ary<unsigned long long> : public std::true_type {};
+
+template<typename T>
+bool Parse(const char* str, size_t n, T* dest, int radix);
+
+} // namespace re2_internal
+
+class RE2::Arg {
+private:
+    template<typename T>
+    using CanParse3ary = typename std::enable_if<re2_internal::Parse3ary<T>::value, int>::type;
+
+    template<typename T>
+    using CanParse4ary = typename std::enable_if<re2_internal::Parse4ary<T>::value, int>::type;
+
+#if !defined(_MSC_VER)
+    template<typename T>
+    using CanParseFrom =
+        typename std::enable_if<std::is_member_function_pointer<decltype(static_cast<bool (T::*)(
+                                        const char*, size_t)>(&T::ParseFrom))>::value,
+            int>::type;
+#endif
+
+public:
+    Arg() : Arg(nullptr) {}
+    Arg(std::nullptr_t ptr) : arg_(ptr), parser_(DoNothing) {}
+
+    template<typename T, CanParse3ary<T> = 0>
+    Arg(T* ptr) : arg_(ptr), parser_(DoParse3ary<T>) {}
+
+    template<typename T, CanParse4ary<T> = 0>
+    Arg(T* ptr) : arg_(ptr), parser_(DoParse4ary<T>) {}
+
+#if !defined(_MSC_VER)
+    template<typename T, CanParseFrom<T> = 0>
+    Arg(T* ptr) : arg_(ptr), parser_(DoParseFrom<T>) {}
+#endif
+
+    typedef bool (*Parser)(const char* str, size_t n, void* dest);
+
+    template<typename T>
+    Arg(T* ptr, Parser parser) : arg_(ptr), parser_(parser) {}
+
+    bool Parse(const char* str, size_t n) const { return (*parser_)(str, n, arg_); }
+
+private:
+    static bool DoNothing(const char* /*str*/, size_t /*n*/, void* /*dest*/) { return true; }
+
+    template<typename T>
+    static bool DoParse3ary(const char* str, size_t n, void* dest) {
+        return re2_internal::Parse(str, n, reinterpret_cast<T*>(dest));
+    }
+
+    template<typename T>
+    static bool DoParse4ary(const char* str, size_t n, void* dest) {
+        return re2_internal::Parse(str, n, reinterpret_cast<T*>(dest), 10);
+    }
+
+#if !defined(_MSC_VER)
+    template<typename T>
+    static bool DoParseFrom(const char* str, size_t n, void* dest) {
+        if (dest == NULL)
+            return true;
+        return reinterpret_cast<T*>(dest)->ParseFrom(str, n);
+    }
+#endif
+
+    void* arg_;
+    Parser parser_;
+};
+
+template<typename T>
+inline RE2::Arg RE2::CRadix(T* ptr) {
+    return RE2::Arg(ptr, [](const char* str, size_t n, void* dest) -> bool {
+        return re2_internal::Parse(str, n, reinterpret_cast<T*>(dest), 0);
+    });
+}
+
+template<typename T>
+inline RE2::Arg RE2::Hex(T* ptr) {
+    return RE2::Arg(ptr, [](const char* str, size_t n, void* dest) -> bool {
+        return re2_internal::Parse(str, n, reinterpret_cast<T*>(dest), 16);
+    });
+}
+
+template<typename T>
+inline RE2::Arg RE2::Octal(T* ptr) {
+    return RE2::Arg(ptr, [](const char* str, size_t n, void* dest) -> bool {
+        return re2_internal::Parse(str, n, reinterpret_cast<T*>(dest), 8);
+    });
+}
+
+// Silence warnings about missing initializers for members of LazyRE2.
+#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ >= 6
+#pragma GCC diagnostic ignored "-Wmissing-field-initializers"
+#endif
+
+// Helper for writing global or static RE2s safely.
+// Write
+//     static LazyRE2 re = {".*"};
+// and then use *re instead of writing
+//     static RE2 re(".*");
+// The former is more careful about multithreaded
+// situations than the latter.
+//
+// N.B. This class never deletes the RE2 object that
+// it constructs: that's a feature, so that it can be used
+// for global and function static variables.
+class LazyRE2 {
+private:
+    struct NoArg {};
+
+public:
+    typedef RE2 element_type; // support std::pointer_traits
+
+    // Constructor omitted to preserve braced initialization in C++98.
+
+    // Pretend to be a pointer to Type (never NULL due to on-demand creation):
+    RE2& operator*() const { return *get(); }
+    RE2* operator->() const { return get(); }
+
+    // Named accessor/initializer:
+    RE2* get() const {
+        std::call_once(once_, &LazyRE2::Init, this);
+        return ptr_;
+    }
+
+    // All data fields must be public to support {"foo"} initialization.
+    const char* pattern_;
+    RE2::CannedOptions options_;
+    NoArg barrier_against_excess_initializers_;
+
+    mutable RE2* ptr_;
+    mutable std::once_flag once_;
+
+private:
+    static void Init(const LazyRE2* lazy_re2) {
+        lazy_re2->ptr_ = new RE2(lazy_re2->pattern_, lazy_re2->options_);
+    }
+
+    void operator=(const LazyRE2&); // disallowed
+};
+
+namespace hooks {
+
+// Most platforms support thread_local. Older versions of iOS don't support
+// thread_local, but for the sake of brevity, we lump together all versions
+// of Apple platforms that aren't macOS. If an iOS application really needs
+// the context pointee someday, we can get more specific then...
+//
+// As per https://github.com/google/re2/issues/325, thread_local support in
+// MinGW seems to be buggy. (FWIW, Abseil folks also avoid it.)
+#define RE2_HAVE_THREAD_LOCAL
+#if (defined(__APPLE__) && !(defined(TARGET_OS_OSX) && TARGET_OS_OSX)) || defined(__MINGW32__)
+#undef RE2_HAVE_THREAD_LOCAL
+#endif
+
+// A hook must not make any assumptions regarding the lifetime of the context
+// pointee beyond the current invocation of the hook. Pointers and references
+// obtained via the context pointee should be considered invalidated when the
+// hook returns. Hence, any data about the context pointee (e.g. its pattern)
+// would have to be copied in order for it to be kept for an indefinite time.
+//
+// A hook must not use RE2 for matching. Control flow reentering RE2::Match()
+// could result in infinite mutual recursion. To discourage that possibility,
+// RE2 will not maintain the context pointer correctly when used in that way.
+#ifdef RE2_HAVE_THREAD_LOCAL
+extern thread_local const RE2* context;
+#endif
+
+struct DFAStateCacheReset {
+    int64_t state_budget;
+    size_t state_cache_size;
+};
+
+struct DFASearchFailure {
+    // Nothing yet...
+};
+
+#define DECLARE_HOOK(type)                                                                         \
+    using type##Callback = void(const type&);                                                      \
+    void Set##type##Hook(type##Callback* cb);                                                      \
+    type##Callback* Get##type##Hook();
+
+DECLARE_HOOK(DFAStateCacheReset)
+DECLARE_HOOK(DFASearchFailure)
+
+#undef DECLARE_HOOK
+
+} // namespace hooks
+} // namespace regex
+} // namespace lbug
+
+using lbug::regex::LazyRE2;
+using lbug::regex::RE2;
+
+#endif // RE2_RE2_H_
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/regexp.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/regexp.h
new file mode 100644
index 0000000000..ca63c9be21
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/regexp.h
@@ -0,0 +1,686 @@
+// Copyright 2006 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_REGEXP_H_
+#define RE2_REGEXP_H_
+
+// --- SPONSORED LINK --------------------------------------------------
+// If you want to use this library for regular expression matching,
+// you should use re2/re2.h, which provides a class RE2 that
+// mimics the PCRE interface provided by PCRE's C++ wrappers.
+// This header describes the low-level interface used to implement RE2
+// and may change in backwards-incompatible ways from time to time.
+// In contrast, RE2's interface will not.
+// ---------------------------------------------------------------------
+
+// Regular expression library: parsing, execution, and manipulation
+// of regular expressions.
+//
+// Any operation that traverses the Regexp structures should be written
+// using Regexp::Walker (see walker-inl.h), not recursively, because deeply nested
+// regular expressions such as x++++++++++++++++++++... might cause recursive
+// traversals to overflow the stack.
+//
+// It is the caller's responsibility to provide appropriate mutual exclusion
+// around manipulation of the regexps.  RE2 does this.
+//
+// PARSING
+//
+// Regexp::Parse parses regular expressions encoded in UTF-8.
+// The default syntax is POSIX extended regular expressions,
+// with the following changes:
+//
+//   1.  Backreferences (optional in POSIX EREs) are not supported.
+//         (Supporting them precludes the use of DFA-based
+//          matching engines.)
+//
+//   2.  Collating elements and collation classes are not supported.
+//         (No one has needed or wanted them.)
+//
+// The exact syntax accepted can be modified by passing flags to
+// Regexp::Parse.  In particular, many of the basic Perl additions
+// are available.  The flags are documented below (search for LikePerl).
+//
+// If parsed with the flag Regexp::Latin1, both the regular expression
+// and the input to the matching routines are assumed to be encoded in
+// Latin-1, not UTF-8.
+//
+// EXECUTION
+//
+// Once Regexp has parsed a regular expression, it provides methods
+// to search text using that regular expression.  These methods are
+// implemented via calling out to other regular expression libraries.
+// (Let's call them the sublibraries.)
+//
+// To call a sublibrary, Regexp does not simply prepare a
+// string version of the regular expression and hand it to the
+// sublibrary.  Instead, Regexp prepares, from its own parsed form, the
+// corresponding internal representation used by the sublibrary.
+// This has the drawback of needing to know the internal representation
+// used by the sublibrary, but it has two important benefits:
+//
+//   1. The syntax and meaning of regular expressions is guaranteed
+//      to be that used by Regexp's parser, not the syntax expected
+//      by the sublibrary.  Regexp might accept a restricted or
+//      expanded syntax for regular expressions as compared with
+//      the sublibrary.  As long as Regexp can translate from its
+//      internal form into the sublibrary's, clients need not know
+//      exactly which sublibrary they are using.
+//
+//   2. The sublibrary parsers are bypassed.  For whatever reason,
+//      sublibrary regular expression parsers often have security
+//      problems.  For example, plan9grep's regular expression parser
+//      has a buffer overflow in its handling of large character
+//      classes, and PCRE's parser has had buffer overflow problems
+//      in the past.  Security-team requires sandboxing of sublibrary
+//      regular expression parsers.  Avoiding the sublibrary parsers
+//      avoids the sandbox.
+//
+// The execution methods we use now are provided by the compiled form,
+// Prog, described in prog.h
+//
+// MANIPULATION
+//
+// Unlike other regular expression libraries, Regexp makes its parsed
+// form accessible to clients, so that client code can analyze the
+// parsed regular expressions.
+
+#include <stddef.h>
+#include <stdint.h>
+
+#include <map>
+#include <set>
+#include <string>
+
+#include "logging.h"
+#include "stringpiece.h"
+#include "utf.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+// Keep in sync with string list kOpcodeNames[] in testing/dump.cc
+enum RegexpOp {
+    // Matches no strings.
+    kRegexpNoMatch = 1,
+
+    // Matches empty string.
+    kRegexpEmptyMatch,
+
+    // Matches rune_.
+    kRegexpLiteral,
+
+    // Matches runes_.
+    kRegexpLiteralString,
+
+    // Matches concatenation of sub_[0..nsub-1].
+    kRegexpConcat,
+    // Matches union of sub_[0..nsub-1].
+    kRegexpAlternate,
+
+    // Matches sub_[0] zero or more times.
+    kRegexpStar,
+    // Matches sub_[0] one or more times.
+    kRegexpPlus,
+    // Matches sub_[0] zero or one times.
+    kRegexpQuest,
+
+    // Matches sub_[0] at least min_ times, at most max_ times.
+    // max_ == -1 means no upper limit.
+    kRegexpRepeat,
+
+    // Parenthesized (capturing) subexpression.  Index is cap_.
+    // Optionally, capturing name is name_.
+    kRegexpCapture,
+
+    // Matches any character.
+    kRegexpAnyChar,
+
+    // Matches any byte [sic].
+    kRegexpAnyByte,
+
+    // Matches empty string at beginning of line.
+    kRegexpBeginLine,
+    // Matches empty string at end of line.
+    kRegexpEndLine,
+
+    // Matches word boundary "\b".
+    kRegexpWordBoundary,
+    // Matches not-a-word boundary "\B".
+    kRegexpNoWordBoundary,
+
+    // Matches empty string at beginning of text.
+    kRegexpBeginText,
+    // Matches empty string at end of text.
+    kRegexpEndText,
+
+    // Matches character class given by cc_.
+    kRegexpCharClass,
+
+    // Forces match of entire expression right now,
+    // with match ID match_id_ (used by RE2::Set).
+    kRegexpHaveMatch,
+
+    kMaxRegexpOp = kRegexpHaveMatch,
+};
+
+// Keep in sync with string list in regexp.cc
+enum RegexpStatusCode {
+    // No error
+    kRegexpSuccess = 0,
+
+    // Unexpected error
+    kRegexpInternalError,
+
+    // Parse errors
+    kRegexpBadEscape,         // bad escape sequence
+    kRegexpBadCharClass,      // bad character class
+    kRegexpBadCharRange,      // bad character class range
+    kRegexpMissingBracket,    // missing closing ]
+    kRegexpMissingParen,      // missing closing )
+    kRegexpUnexpectedParen,   // unexpected closing )
+    kRegexpTrailingBackslash, // at end of regexp
+    kRegexpRepeatArgument,    // repeat argument missing, e.g. "*"
+    kRegexpRepeatSize,        // bad repetition argument
+    kRegexpRepeatOp,          // bad repetition operator
+    kRegexpBadPerlOp,         // bad perl operator
+    kRegexpBadUTF8,           // invalid UTF-8 in regexp
+    kRegexpBadNamedCapture,   // bad named capture
+};
+
+// Error status for certain operations.
+class RegexpStatus {
+public:
+    RegexpStatus() : code_(kRegexpSuccess), tmp_(NULL) {}
+    ~RegexpStatus() { delete tmp_; }
+
+    void set_code(RegexpStatusCode code) { code_ = code; }
+    void set_error_arg(const StringPiece& error_arg) { error_arg_ = error_arg; }
+    void set_tmp(std::string* tmp) {
+        delete tmp_;
+        tmp_ = tmp;
+    }
+    RegexpStatusCode code() const { return code_; }
+    const StringPiece& error_arg() const { return error_arg_; }
+    bool ok() const { return code() == kRegexpSuccess; }
+
+    // Copies state from status.
+    void Copy(const RegexpStatus& status);
+
+    // Returns text equivalent of code, e.g.:
+    //   "Bad character class"
+    static std::string CodeText(RegexpStatusCode code);
+
+    // Returns text describing error, e.g.:
+    //   "Bad character class: [z-a]"
+    std::string Text() const;
+
+private:
+    RegexpStatusCode code_; // Kind of error
+    StringPiece error_arg_; // Piece of regexp containing syntax error.
+    std::string* tmp_;      // Temporary storage, possibly where error_arg_ is.
+
+    RegexpStatus(const RegexpStatus&) = delete;
+    RegexpStatus& operator=(const RegexpStatus&) = delete;
+};
+
+// Compiled form; see prog.h
+class Prog;
+
+struct RuneRange {
+    RuneRange() : lo(0), hi(0) {}
+    RuneRange(int l, int h) : lo(l), hi(h) {}
+    Rune lo;
+    Rune hi;
+};
+
+// Less-than on RuneRanges treats a == b if they overlap at all.
+// This lets us look in a set to find the range covering a particular Rune.
+struct RuneRangeLess {
+    bool operator()(const RuneRange& a, const RuneRange& b) const { return a.hi < b.lo; }
+};
+
+class CharClassBuilder;
+
+class CharClass {
+public:
+    void Delete();
+
+    typedef RuneRange* iterator;
+    iterator begin() { return ranges_; }
+    iterator end() { return ranges_ + nranges_; }
+
+    int size() { return nrunes_; }
+    bool empty() { return nrunes_ == 0; }
+    bool full() { return nrunes_ == Runemax + 1; }
+    bool FoldsASCII() { return folds_ascii_; }
+
+    bool Contains(Rune r) const;
+    CharClass* Negate();
+
+private:
+    CharClass();  // not implemented
+    ~CharClass(); // not implemented
+    static CharClass* New(size_t maxranges);
+
+    friend class CharClassBuilder;
+
+    bool folds_ascii_;
+    int nrunes_;
+    RuneRange* ranges_;
+    int nranges_;
+
+    CharClass(const CharClass&) = delete;
+    CharClass& operator=(const CharClass&) = delete;
+};
+
+class Regexp {
+public:
+    // Flags for parsing.  Can be ORed together.
+    enum ParseFlags {
+        NoParseFlags = 0,
+        FoldCase = 1 << 0, // Fold case during matching (case-insensitive).
+        Literal = 1 << 1,  // Treat s as literal string instead of a regexp.
+        ClassNL = 1 << 2,  // Allow char classes like [^a-z] and \D and \s
+                           // and [[:space:]] to match newline.
+        DotNL = 1 << 3,    // Allow . to match newline.
+        MatchNL = ClassNL | DotNL,
+        OneLine = 1 << 4,        // Treat ^ and $ as only matching at beginning and
+                                 // end of text, not around embedded newlines.
+                                 // (Perl's default)
+        Latin1 = 1 << 5,         // Regexp and text are in Latin1, not UTF-8.
+        NonGreedy = 1 << 6,      // Repetition operators are non-greedy by default.
+        PerlClasses = 1 << 7,    // Allow Perl character classes like \d.
+        PerlB = 1 << 8,          // Allow Perl's \b and \B.
+        PerlX = 1 << 9,          // Perl extensions:
+                                 //   non-capturing parens - (?: )
+                                 //   non-greedy operators - *? +? ?? {}?
+                                 //   flag edits - (?i) (?-i) (?i: )
+                                 //     i - FoldCase
+                                 //     m - !OneLine
+                                 //     s - DotNL
+                                 //     U - NonGreedy
+                                 //   line ends: \A \z
+                                 //   \Q and \E to disable/enable metacharacters
+                                 //   (?P<name>expr) for named captures
+                                 //   \C to match any single byte
+        UnicodeGroups = 1 << 10, // Allow \p{Han} for Unicode Han group
+                                 //   and \P{Han} for its negation.
+        NeverNL = 1 << 11,       // Never match NL, even if the regexp mentions
+                                 //   it explicitly.
+        NeverCapture = 1 << 12,  // Parse all parens as non-capturing.
+
+        // As close to Perl as we can get.
+        LikePerl = ClassNL | OneLine | PerlClasses | PerlB | PerlX | UnicodeGroups,
+
+        // Internal use only.
+        WasDollar = 1 << 13, // on kRegexpEndText: was $ in regexp text
+        AllParseFlags = (1 << 14) - 1,
+    };
+
+    // Get.  No set, Regexps are logically immutable once created.
+    RegexpOp op() { return static_cast<RegexpOp>(op_); }
+    int nsub() { return nsub_; }
+    bool simple() { return simple_ != 0; }
+    ParseFlags parse_flags() { return static_cast<ParseFlags>(parse_flags_); }
+    int Ref(); // For testing.
+
+    Regexp** sub() {
+        if (nsub_ <= 1)
+            return &subone_;
+        else
+            return submany_;
+    }
+
+    int min() {
+        DCHECK_EQ(op_, kRegexpRepeat);
+        return min_;
+    }
+    int max() {
+        DCHECK_EQ(op_, kRegexpRepeat);
+        return max_;
+    }
+    Rune rune() {
+        DCHECK_EQ(op_, kRegexpLiteral);
+        return rune_;
+    }
+    CharClass* cc() {
+        DCHECK_EQ(op_, kRegexpCharClass);
+        return cc_;
+    }
+    int cap() {
+        DCHECK_EQ(op_, kRegexpCapture);
+        return cap_;
+    }
+    const std::string* name() {
+        DCHECK_EQ(op_, kRegexpCapture);
+        return name_;
+    }
+    Rune* runes() {
+        DCHECK_EQ(op_, kRegexpLiteralString);
+        return runes_;
+    }
+    int nrunes() {
+        DCHECK_EQ(op_, kRegexpLiteralString);
+        return nrunes_;
+    }
+    int match_id() {
+        DCHECK_EQ(op_, kRegexpHaveMatch);
+        return match_id_;
+    }
+
+    // Increments reference count, returns object as convenience.
+    Regexp* Incref();
+
+    // Decrements reference count and deletes this object if count reaches 0.
+    void Decref();
+
+    // Parses string s to produce regular expression, returned.
+    // Caller must release return value with re->Decref().
+    // On failure, sets *status (if status != NULL) and returns NULL.
+    static Regexp* Parse(const StringPiece& s, ParseFlags flags, RegexpStatus* status);
+
+    // Returns a _new_ simplified version of the current regexp.
+    // Does not edit the current regexp.
+    // Caller must release return value with re->Decref().
+    // Simplified means that counted repetition has been rewritten
+    // into simpler terms and all Perl/POSIX features have been
+    // removed.  The result will capture exactly the same
+    // subexpressions the original did, unless formatted with ToString.
+    Regexp* Simplify();
+    friend class CoalesceWalker;
+    friend class SimplifyWalker;
+
+    // Parses the regexp src and then simplifies it and sets *dst to the
+    // string representation of the simplified form.  Returns true on success.
+    // Returns false and sets *status (if status != NULL) on parse error.
+    static bool SimplifyRegexp(
+        const StringPiece& src, ParseFlags flags, std::string* dst, RegexpStatus* status);
+
+    // Returns the number of capturing groups in the regexp.
+    int NumCaptures();
+    friend class NumCapturesWalker;
+
+    // Returns a map from names to capturing group indices,
+    // or NULL if the regexp contains no named capture groups.
+    // The caller is responsible for deleting the map.
+    std::map<std::string, int>* NamedCaptures();
+
+    // Returns a map from capturing group indices to capturing group
+    // names or NULL if the regexp contains no named capture groups. The
+    // caller is responsible for deleting the map.
+    std::map<int, std::string>* CaptureNames();
+
+    // Returns a string representation of the current regexp,
+    // using as few parentheses as possible.
+    std::string ToString();
+
+    // Convenience functions.  They consume the passed reference,
+    // so in many cases you should use, e.g., Plus(re->Incref(), flags).
+    // They do not consume allocated arrays like subs or runes.
+    static Regexp* Plus(Regexp* sub, ParseFlags flags);
+    static Regexp* Star(Regexp* sub, ParseFlags flags);
+    static Regexp* Quest(Regexp* sub, ParseFlags flags);
+    static Regexp* Concat(Regexp** subs, int nsubs, ParseFlags flags);
+    static Regexp* Alternate(Regexp** subs, int nsubs, ParseFlags flags);
+    static Regexp* Capture(Regexp* sub, ParseFlags flags, int cap);
+    static Regexp* Repeat(Regexp* sub, ParseFlags flags, int min, int max);
+    static Regexp* NewLiteral(Rune rune, ParseFlags flags);
+    static Regexp* NewCharClass(CharClass* cc, ParseFlags flags);
+    static Regexp* LiteralString(Rune* runes, int nrunes, ParseFlags flags);
+    static Regexp* HaveMatch(int match_id, ParseFlags flags);
+
+    // Like Alternate but does not factor out common prefixes.
+    static Regexp* AlternateNoFactor(Regexp** subs, int nsubs, ParseFlags flags);
+
+    // Debugging function.  Returns string format for regexp
+    // that makes structure clear.  Does NOT use regexp syntax.
+    std::string Dump();
+
+    // Helper traversal class, defined fully in walker-inl.h.
+    template<typename T>
+    class Walker;
+
+    // Compile to Prog.  See prog.h
+    // Reverse prog expects to be run over text backward.
+    // Construction and execution of prog will
+    // stay within approximately max_mem bytes of memory.
+    // If max_mem <= 0, a reasonable default is used.
+    Prog* CompileToProg(int64_t max_mem);
+    Prog* CompileToReverseProg(int64_t max_mem);
+
+    // Whether to expect this library to find exactly the same answer as PCRE
+    // when running this regexp.  Most regexps do mimic PCRE exactly, but a few
+    // obscure cases behave differently.  Technically this is more a property
+    // of the Prog than the Regexp, but the computation is much easier to do
+    // on the Regexp.  See mimics_pcre.cc for the exact conditions.
+    bool MimicsPCRE();
+
+    // Benchmarking function.
+    void NullWalk();
+
+    // Whether every match of this regexp must be anchored and
+    // begin with a non-empty fixed string (perhaps after ASCII
+    // case-folding).  If so, returns the prefix and the sub-regexp that
+    // follows it.
+    // Callers should expect *prefix, *foldcase and *suffix to be "zeroed"
+    // regardless of the return value.
+    bool RequiredPrefix(std::string* prefix, bool* foldcase, Regexp** suffix);
+
+    // Whether every match of this regexp must be unanchored and
+    // begin with a non-empty fixed string (perhaps after ASCII
+    // case-folding).  If so, returns the prefix.
+    // Callers should expect *prefix and *foldcase to be "zeroed"
+    // regardless of the return value.
+    bool RequiredPrefixForAccel(std::string* prefix, bool* foldcase);
+
+    // Controls the maximum repeat count permitted by the parser.
+    // FOR FUZZING ONLY.
+    static void FUZZING_ONLY_set_maximum_repeat_count(int i);
+
+private:
+    // Constructor allocates vectors as appropriate for operator.
+    explicit Regexp(RegexpOp op, ParseFlags parse_flags);
+
+    // Use Decref() instead of delete to release Regexps.
+    // This is private to catch deletes at compile time.
+    ~Regexp();
+    void Destroy();
+    bool QuickDestroy();
+
+    // Helpers for Parse.  Listed here so they can edit Regexps.
+    class ParseState;
+
+    friend class ParseState;
+    friend bool ParseCharClass(StringPiece* s, Regexp** out_re, RegexpStatus* status);
+
+    // Helper for testing [sic].
+    friend bool RegexpEqualTestingOnly(Regexp*, Regexp*);
+
+    // Computes whether Regexp is already simple.
+    bool ComputeSimple();
+
+    // Constructor that generates a Star, Plus or Quest,
+    // squashing the pair if sub is also a Star, Plus or Quest.
+    static Regexp* StarPlusOrQuest(RegexpOp op, Regexp* sub, ParseFlags flags);
+
+    // Constructor that generates a concatenation or alternation,
+    // enforcing the limit on the number of subexpressions for
+    // a particular Regexp.
+    static Regexp* ConcatOrAlternate(
+        RegexpOp op, Regexp** subs, int nsubs, ParseFlags flags, bool can_factor);
+
+    // Returns the leading string that re starts with.
+    // The returned Rune* points into a piece of re,
+    // so it must not be used after the caller calls re->Decref().
+    static Rune* LeadingString(Regexp* re, int* nrune, ParseFlags* flags);
+
+    // Removes the first n leading runes from the beginning of re.
+    // Edits re in place.
+    static void RemoveLeadingString(Regexp* re, int n);
+
+    // Returns the leading regexp in re's top-level concatenation.
+    // The returned Regexp* points at re or a sub-expression of re,
+    // so it must not be used after the caller calls re->Decref().
+    static Regexp* LeadingRegexp(Regexp* re);
+
+    // Removes LeadingRegexp(re) from re and returns the remainder.
+    // Might edit re in place.
+    static Regexp* RemoveLeadingRegexp(Regexp* re);
+
+    // Simplifies an alternation of literal strings by factoring out
+    // common prefixes.
+    static int FactorAlternation(Regexp** sub, int nsub, ParseFlags flags);
+    friend class FactorAlternationImpl;
+
+    // Is a == b?  Only efficient on regexps that have not been through
+    // Simplify yet - the expansion of a kRegexpRepeat will make this
+    // take a long time.  Do not call on such regexps, hence private.
+    static bool Equal(Regexp* a, Regexp* b);
+
+    // Allocate space for n sub-regexps.
+    void AllocSub(int n) {
+        DCHECK(n >= 0 && static_cast<uint16_t>(n) == n);
+        if (n > 1)
+            submany_ = new Regexp*[n];
+        nsub_ = static_cast<uint16_t>(n);
+    }
+
+    // Add Rune to LiteralString
+    void AddRuneToString(Rune r);
+
+    // Swaps this with that, in place.
+    void Swap(Regexp* that);
+
+    // Operator.  See description of operators above.
+    // uint8_t instead of RegexpOp to control space usage.
+    uint8_t op_;
+
+    // Is this regexp structure already simple
+    // (has it been returned by Simplify)?
+    // uint8_t instead of bool to control space usage.
+    uint8_t simple_;
+
+    // Flags saved from parsing and used during execution.
+    // (Only FoldCase is used.)
+    // uint16_t instead of ParseFlags to control space usage.
+    uint16_t parse_flags_;
+
+    // Reference count.  Exists so that SimplifyRegexp can build
+    // regexp structures that are dags rather than trees to avoid
+    // exponential blowup in space requirements.
+    // uint16_t to control space usage.
+    // The standard regexp routines will never generate a
+    // ref greater than the maximum repeat count (kMaxRepeat),
+    // but even so, Incref and Decref consult an overflow map
+    // when ref_ reaches kMaxRef.
+    uint16_t ref_;
+    static const uint16_t kMaxRef = 0xffff;
+
+    // Subexpressions.
+    // uint16_t to control space usage.
+    // Concat and Alternate handle larger numbers of subexpressions
+    // by building concatenation or alternation trees.
+    // Other routines should call Concat or Alternate instead of
+    // filling in sub() by hand.
+    uint16_t nsub_;
+    static const uint16_t kMaxNsub = 0xffff;
+    union {
+        Regexp** submany_; // if nsub_ > 1
+        Regexp* subone_;   // if nsub_ == 1
+    };
+
+    // Extra space for parse and teardown stacks.
+    Regexp* down_;
+
+    // Arguments to operator.  See description of operators above.
+    union {
+        struct { // Repeat
+            int max_;
+            int min_;
+        };
+        struct { // Capture
+            int cap_;
+            std::string* name_;
+        };
+        struct { // LiteralString
+            int nrunes_;
+            Rune* runes_;
+        };
+        struct { // CharClass
+            // These two could be in separate union members,
+            // but it wouldn't save any space (there are other two-word structs)
+            // and keeping them separate avoids confusion during parsing.
+            CharClass* cc_;
+            CharClassBuilder* ccb_;
+        };
+        Rune rune_;          // Literal
+        int match_id_;       // HaveMatch
+        void* the_union_[2]; // as big as any other element, for memset
+    };
+
+    Regexp(const Regexp&) = delete;
+    Regexp& operator=(const Regexp&) = delete;
+};
+
+// Character class set: contains non-overlapping, non-abutting RuneRanges.
+typedef std::set<RuneRange, RuneRangeLess> RuneRangeSet;
+
+class CharClassBuilder {
+public:
+    CharClassBuilder();
+
+    typedef RuneRangeSet::iterator iterator;
+    iterator begin() { return ranges_.begin(); }
+    iterator end() { return ranges_.end(); }
+
+    int size() { return nrunes_; }
+    bool empty() { return nrunes_ == 0; }
+    bool full() { return nrunes_ == Runemax + 1; }
+
+    bool Contains(Rune r);
+    bool FoldsASCII();
+    bool AddRange(Rune lo, Rune hi); // returns whether class changed
+    CharClassBuilder* Copy();
+    void AddCharClass(CharClassBuilder* cc);
+    void Negate();
+    void RemoveAbove(Rune r);
+    CharClass* GetCharClass();
+    void AddRangeFlags(Rune lo, Rune hi, Regexp::ParseFlags parse_flags);
+
+private:
+    static const uint32_t AlphaMask = (1 << 26) - 1;
+    uint32_t upper_; // bitmap of A-Z
+    uint32_t lower_; // bitmap of a-z
+    int nrunes_;
+    RuneRangeSet ranges_;
+
+    CharClassBuilder(const CharClassBuilder&) = delete;
+    CharClassBuilder& operator=(const CharClassBuilder&) = delete;
+};
+
+// Bitwise ops on ParseFlags produce ParseFlags.
+inline Regexp::ParseFlags operator|(Regexp::ParseFlags a, Regexp::ParseFlags b) {
+    return static_cast<Regexp::ParseFlags>(static_cast<int>(a) | static_cast<int>(b));
+}
+
+inline Regexp::ParseFlags operator^(Regexp::ParseFlags a, Regexp::ParseFlags b) {
+    return static_cast<Regexp::ParseFlags>(static_cast<int>(a) ^ static_cast<int>(b));
+}
+
+inline Regexp::ParseFlags operator&(Regexp::ParseFlags a, Regexp::ParseFlags b) {
+    return static_cast<Regexp::ParseFlags>(static_cast<int>(a) & static_cast<int>(b));
+}
+
+inline Regexp::ParseFlags operator~(Regexp::ParseFlags a) {
+    // Attempting to produce a value out of enum's range has undefined behaviour.
+    return static_cast<Regexp::ParseFlags>(
+        ~static_cast<int>(a) & static_cast<int>(Regexp::AllParseFlags));
+}
+
+} // namespace regex
+} // namespace lbug
+
+#endif // RE2_REGEXP_H_
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/set.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/set.h
new file mode 100644
index 0000000000..73bf074aac
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/set.h
@@ -0,0 +1,83 @@
+// Copyright 2010 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_SET_H_
+#define RE2_SET_H_
+
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "re2.h"
+
+namespace lbug {
+namespace regex {
+class Prog;
+class Regexp;
+} // namespace regex
+} // namespace lbug
+
+namespace lbug {
+namespace regex {
+
+// An RE2::Set represents a collection of regexps that can
+// be searched for simultaneously.
+class RE2::Set {
+public:
+    enum ErrorKind {
+        kNoError = 0,
+        kNotCompiled,  // The set is not compiled.
+        kOutOfMemory,  // The DFA ran out of memory.
+        kInconsistent, // The result is inconsistent. This should never happen.
+    };
+
+    struct ErrorInfo {
+        ErrorKind kind;
+    };
+
+    Set(const RE2::Options& options, RE2::Anchor anchor);
+    ~Set();
+
+    // Adds pattern to the set using the options passed to the constructor.
+    // Returns the index that will identify the regexp in the output of Match(),
+    // or -1 if the regexp cannot be parsed.
+    // Indices are assigned in sequential order starting from 0.
+    // Errors do not increment the index; if error is not NULL, *error will hold
+    // the error message from the parser.
+    int Add(const StringPiece& pattern, std::string* error);
+
+    // Compiles the set in preparation for matching.
+    // Returns false if the compiler runs out of memory.
+    // Add() must not be called again after Compile().
+    // Compile() must be called before Match().
+    bool Compile();
+
+    // Returns true if text matches at least one of the regexps in the set.
+    // Fills v (if not NULL) with the indices of the matching regexps.
+    // Callers must not expect v to be sorted.
+    bool Match(const StringPiece& text, std::vector<int>* v) const;
+
+    // As above, but populates error_info (if not NULL) when none of the regexps
+    // in the set matched. This can inform callers when DFA execution fails, for
+    // example, because they might wish to handle that case differently.
+    bool Match(const StringPiece& text, std::vector<int>* v, ErrorInfo* error_info) const;
+
+private:
+    typedef std::pair<std::string, lbug::regex::Regexp*> Elem;
+
+    RE2::Options options_;
+    RE2::Anchor anchor_;
+    std::vector<Elem> elem_;
+    lbug::regex::Prog* prog_;
+    bool compiled_;
+    int size_;
+
+    Set(const Set&) = delete;
+    Set& operator=(const Set&) = delete;
+};
+
+} // namespace regex
+} // namespace lbug
+
+#endif // RE2_SET_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/sparse_array.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/sparse_array.h
new file mode 100644
index 0000000000..3c88e5ca49
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/sparse_array.h
@@ -0,0 +1,369 @@
+// Copyright 2006 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef UTIL_SPARSE_ARRAY_H_
+#define UTIL_SPARSE_ARRAY_H_
+
+// DESCRIPTION
+//
+// SparseArray<T>(m) is a map from integers in [0, m) to T values.
+// It requires (sizeof(T)+sizeof(int))*m memory, but it provides
+// fast iteration through the elements in the array and fast clearing
+// of the array.  The array has a concept of certain elements being
+// uninitialized (having no value).
+//
+// Insertion and deletion are constant time operations.
+//
+// Allocating the array is a constant time operation
+// when memory allocation is a constant time operation.
+//
+// Clearing the array is a constant time operation (unusual!).
+//
+// Iterating through the array is an O(n) operation, where n
+// is the number of items in the array (not O(m)).
+//
+// The array iterator visits entries in the order they were first
+// inserted into the array.  It is safe to add items to the array while
+// using an iterator: the iterator will visit indices added to the array
+// during the iteration, but will not re-visit indices whose values
+// change after visiting.  Thus SparseArray can be a convenient
+// implementation of a work queue.
+//
+// The SparseArray implementation is NOT thread-safe.  It is up to the
+// caller to make sure only one thread is accessing the array.  (Typically
+// these arrays are temporary values and used in situations where speed is
+// important.)
+//
+// The SparseArray interface does not present all the usual STL bells and
+// whistles.
+//
+// Implemented with reference to Briggs & Torczon, An Efficient
+// Representation for Sparse Sets, ACM Letters on Programming Languages
+// and Systems, Volume 2, Issue 1-4 (March-Dec.  1993), pp.  59-69.
+//
+// Briggs & Torczon popularized this technique, but it had been known
+// long before their paper.  They point out that Aho, Hopcroft, and
+// Ullman's 1974 Design and Analysis of Computer Algorithms and Bentley's
+// 1986 Programming Pearls both hint at the technique in exercises to the
+// reader (in Aho & Hopcroft, exercise 2.12; in Bentley, column 1
+// exercise 8).
+//
+// Briggs & Torczon describe a sparse set implementation.  I have
+// trivially generalized it to create a sparse array (actually the original
+// target of the AHU and Bentley exercises).
+
+// IMPLEMENTATION
+//
+// SparseArray is an array dense_ and an array sparse_ of identical size.
+// At any point, the number of elements in the sparse array is size_.
+//
+// The array dense_ contains the size_ elements in the sparse array (with
+// their indices),
+// in the order that the elements were first inserted.  This array is dense:
+// the size_ pairs are dense_[0] through dense_[size_-1].
+//
+// The array sparse_ maps from indices in [0,m) to indices in [0,size_).
+// For indices present in the array, dense_[sparse_[i]].index_ == i.
+// For indices not present in the array, sparse_ can contain any value at all,
+// perhaps outside the range [0, size_) but perhaps not.
+//
+// The lax requirement on sparse_ values makes clearing the array very easy:
+// set size_ to 0.  Lookups are slightly more complicated.
+// An index i has a value in the array if and only if:
+//   sparse_[i] is in [0, size_) AND
+//   dense_[sparse_[i]].index_ == i.
+// If both these properties hold, only then it is safe to refer to
+//   dense_[sparse_[i]].value_
+// as the value associated with index i.
+//
+// To insert a new entry, set sparse_[i] to size_,
+// initialize dense_[size_], and then increment size_.
+//
+// To make the sparse array as efficient as possible for non-primitive types,
+// elements may or may not be destroyed when they are deleted from the sparse
+// array through a call to resize(). They immediately become inaccessible, but
+// they are only guaranteed to be destroyed when the SparseArray destructor is
+// called.
+//
+// A moved-from SparseArray will be empty.
+
+// Doing this simplifies the logic below.
+#ifndef __has_feature
+#define __has_feature(x) 0
+#endif
+
+#include <assert.h>
+#include <stdint.h>
+#if __has_feature(memory_sanitizer)
+#include <sanitizer/msan_interface.h>
+#endif
+#include <algorithm>
+#include <memory>
+#include <utility>
+
+#include "pod_array.h"
+
+namespace lbug {
+namespace regex {
+
+template<typename Value>
+class SparseArray {
+public:
+    SparseArray();
+    explicit SparseArray(int max_size);
+    ~SparseArray();
+
+    // IndexValue pairs: exposed in SparseArray::iterator.
+    class IndexValue;
+
+    typedef IndexValue* iterator;
+    typedef const IndexValue* const_iterator;
+
+    SparseArray(const SparseArray& src);
+    SparseArray(SparseArray&& src);
+
+    SparseArray& operator=(const SparseArray& src);
+    SparseArray& operator=(SparseArray&& src);
+
+    // Return the number of entries in the array.
+    int size() const { return size_; }
+
+    // Indicate whether the array is empty.
+    int empty() const { return size_ == 0; }
+
+    // Iterate over the array.
+    iterator begin() { return dense_.data(); }
+    iterator end() { return dense_.data() + size_; }
+
+    const_iterator begin() const { return dense_.data(); }
+    const_iterator end() const { return dense_.data() + size_; }
+
+    // Change the maximum size of the array.
+    // Invalidates all iterators.
+    void resize(int new_max_size);
+
+    // Return the maximum size of the array.
+    // Indices can be in the range [0, max_size).
+    int max_size() const {
+        if (dense_.data() != NULL)
+            return dense_.size();
+        else
+            return 0;
+    }
+
+    // Clear the array.
+    void clear() { size_ = 0; }
+
+    // Check whether index i is in the array.
+    bool has_index(int i) const;
+
+    // Comparison function for sorting.
+    // Can sort the sparse array so that future iterations
+    // will visit indices in increasing order using
+    // std::sort(arr.begin(), arr.end(), arr.less);
+    static bool less(const IndexValue& a, const IndexValue& b);
+
+public:
+    // Set the value at index i to v.
+    iterator set(int i, const Value& v) { return SetInternal(true, i, v); }
+
+    // Set the value at new index i to v.
+    // Fast but unsafe: only use if has_index(i) is false.
+    iterator set_new(int i, const Value& v) { return SetInternal(false, i, v); }
+
+    // Set the value at index i to v.
+    // Fast but unsafe: only use if has_index(i) is true.
+    iterator set_existing(int i, const Value& v) { return SetExistingInternal(i, v); }
+
+    // Get the value at index i.
+    // Fast but unsafe: only use if has_index(i) is true.
+    Value& get_existing(int i) {
+        assert(has_index(i));
+        return dense_[sparse_[i]].value_;
+    }
+    const Value& get_existing(int i) const {
+        assert(has_index(i));
+        return dense_[sparse_[i]].value_;
+    }
+
+private:
+    iterator SetInternal(bool allow_existing, int i, const Value& v) {
+        DebugCheckInvariants();
+        if (static_cast<uint32_t>(i) >= static_cast<uint32_t>(max_size())) {
+            assert(false && "illegal index");
+            // Semantically, end() would be better here, but we already know
+            // the user did something stupid, so begin() insulates them from
+            // dereferencing an invalid pointer.
+            return begin();
+        }
+        if (!allow_existing) {
+            assert(!has_index(i));
+            create_index(i);
+        } else {
+            if (!has_index(i))
+                create_index(i);
+        }
+        return SetExistingInternal(i, v);
+    }
+
+    iterator SetExistingInternal(int i, const Value& v) {
+        DebugCheckInvariants();
+        assert(has_index(i));
+        dense_[sparse_[i]].value_ = v;
+        DebugCheckInvariants();
+        return dense_.data() + sparse_[i];
+    }
+
+    // Add the index i to the array.
+    // Only use if has_index(i) is known to be false.
+    // Since it doesn't set the value associated with i,
+    // this function is private, only intended as a helper
+    // for other methods.
+    void create_index(int i);
+
+    // In debug mode, verify that some invariant properties of the class
+    // are being maintained. This is called at the end of the constructor
+    // and at the beginning and end of all public non-const member functions.
+    void DebugCheckInvariants() const;
+
+    // Initializes memory for elements [min, max).
+    void MaybeInitializeMemory(int min, int max) {
+#if __has_feature(memory_sanitizer)
+        __msan_unpoison(sparse_.data() + min, (max - min) * sizeof sparse_[0]);
+#elif defined(RE2_ON_VALGRIND)
+        for (int i = min; i < max; i++) {
+            sparse_[i] = 0xababababU;
+        }
+#endif
+    }
+
+    int size_ = 0;
+    PODArray<int> sparse_;
+    PODArray<IndexValue> dense_;
+};
+
+template<typename Value>
+SparseArray<Value>::SparseArray() = default;
+
+template<typename Value>
+SparseArray<Value>::SparseArray(const SparseArray& src)
+    : size_(src.size_), sparse_(src.max_size()), dense_(src.max_size()) {
+    std::copy_n(src.sparse_.data(), src.max_size(), sparse_.data());
+    std::copy_n(src.dense_.data(), src.max_size(), dense_.data());
+}
+
+template<typename Value>
+SparseArray<Value>::SparseArray(SparseArray&& src)
+    : size_(src.size_), sparse_(std::move(src.sparse_)), dense_(std::move(src.dense_)) {
+    src.size_ = 0;
+}
+
+template<typename Value>
+SparseArray<Value>& SparseArray<Value>::operator=(const SparseArray& src) {
+    // Construct these first for exception safety.
+    PODArray<int> a(src.max_size());
+    PODArray<IndexValue> b(src.max_size());
+
+    size_ = src.size_;
+    sparse_ = std::move(a);
+    dense_ = std::move(b);
+    std::copy_n(src.sparse_.data(), src.max_size(), sparse_.data());
+    std::copy_n(src.dense_.data(), src.max_size(), dense_.data());
+    return *this;
+}
+
+template<typename Value>
+SparseArray<Value>& SparseArray<Value>::operator=(SparseArray&& src) {
+    size_ = src.size_;
+    sparse_ = std::move(src.sparse_);
+    dense_ = std::move(src.dense_);
+    src.size_ = 0;
+    return *this;
+}
+
+// IndexValue pairs: exposed in SparseArray::iterator.
+template<typename Value>
+class SparseArray<Value>::IndexValue {
+public:
+    int index() const { return index_; }
+    Value& value() { return value_; }
+    const Value& value() const { return value_; }
+
+private:
+    friend class SparseArray;
+    int index_;
+    Value value_;
+};
+
+// Change the maximum size of the array.
+// Invalidates all iterators.
+template<typename Value>
+void SparseArray<Value>::resize(int new_max_size) {
+    DebugCheckInvariants();
+    if (new_max_size > max_size()) {
+        const int old_max_size = max_size();
+
+        // Construct these first for exception safety.
+        PODArray<int> a(new_max_size);
+        PODArray<IndexValue> b(new_max_size);
+
+        std::copy_n(sparse_.data(), old_max_size, a.data());
+        std::copy_n(dense_.data(), old_max_size, b.data());
+
+        sparse_ = std::move(a);
+        dense_ = std::move(b);
+
+        MaybeInitializeMemory(old_max_size, new_max_size);
+    }
+    if (size_ > new_max_size)
+        size_ = new_max_size;
+    DebugCheckInvariants();
+}
+
+// Check whether index i is in the array.
+template<typename Value>
+bool SparseArray<Value>::has_index(int i) const {
+    assert(i >= 0);
+    assert(i < max_size());
+    if (static_cast<uint32_t>(i) >= static_cast<uint32_t>(max_size())) {
+        return false;
+    }
+    // Unsigned comparison avoids checking sparse_[i] < 0.
+    return (uint32_t)sparse_[i] < (uint32_t)size_ && dense_[sparse_[i]].index_ == i;
+}
+
+template<typename Value>
+void SparseArray<Value>::create_index(int i) {
+    assert(!has_index(i));
+    assert(size_ < max_size());
+    sparse_[i] = size_;
+    dense_[size_].index_ = i;
+    size_++;
+}
+
+template<typename Value>
+SparseArray<Value>::SparseArray(int max_size) : sparse_(max_size), dense_(max_size) {
+    MaybeInitializeMemory(size_, max_size);
+    DebugCheckInvariants();
+}
+
+template<typename Value>
+SparseArray<Value>::~SparseArray() {
+    DebugCheckInvariants();
+}
+
+template<typename Value>
+void SparseArray<Value>::DebugCheckInvariants() const {
+    assert(0 <= size_);
+    assert(size_ <= max_size());
+}
+
+// Comparison function for sorting.
+template<typename Value>
+bool SparseArray<Value>::less(const IndexValue& a, const IndexValue& b) {
+    return a.index_ < b.index_;
+}
+} // namespace regex
+} // namespace lbug
+#endif // UTIL_SPARSE_ARRAY_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/sparse_set.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/sparse_set.h
new file mode 100644
index 0000000000..fc3b2a9cd4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/sparse_set.h
@@ -0,0 +1,249 @@
+// Copyright 2006 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef UTIL_SPARSE_SET_H_
+#define UTIL_SPARSE_SET_H_
+
+// DESCRIPTION
+//
+// SparseSet(m) is a set of integers in [0, m).
+// It requires sizeof(int)*m memory, but it provides
+// fast iteration through the elements in the set and fast clearing
+// of the set.
+//
+// Insertion and deletion are constant time operations.
+//
+// Allocating the set is a constant time operation
+// when memory allocation is a constant time operation.
+//
+// Clearing the set is a constant time operation (unusual!).
+//
+// Iterating through the set is an O(n) operation, where n
+// is the number of items in the set (not O(m)).
+//
+// The set iterator visits entries in the order they were first
+// inserted into the set.  It is safe to add items to the set while
+// using an iterator: the iterator will visit indices added to the set
+// during the iteration, but will not re-visit indices whose values
+// change after visiting.  Thus SparseSet can be a convenient
+// implementation of a work queue.
+//
+// The SparseSet implementation is NOT thread-safe.  It is up to the
+// caller to make sure only one thread is accessing the set.  (Typically
+// these sets are temporary values and used in situations where speed is
+// important.)
+//
+// The SparseSet interface does not present all the usual STL bells and
+// whistles.
+//
+// Implemented with reference to Briggs & Torczon, An Efficient
+// Representation for Sparse Sets, ACM Letters on Programming Languages
+// and Systems, Volume 2, Issue 1-4 (March-Dec.  1993), pp.  59-69.
+//
+// This is a specialization of sparse array; see sparse_array.h.
+
+// IMPLEMENTATION
+//
+// See sparse_array.h for implementation details.
+
+// Doing this simplifies the logic below.
+#ifndef __has_feature
+#define __has_feature(x) 0
+#endif
+
+#include <assert.h>
+#include <stdint.h>
+#if __has_feature(memory_sanitizer)
+#include <sanitizer/msan_interface.h>
+#endif
+#include <algorithm>
+#include <memory>
+#include <utility>
+
+#include "pod_array.h"
+
+namespace lbug {
+namespace regex {
+
+template<typename Value>
+class SparseSetT {
+public:
+    SparseSetT();
+    explicit SparseSetT(int max_size);
+    ~SparseSetT();
+
+    typedef int* iterator;
+    typedef const int* const_iterator;
+
+    // Return the number of entries in the set.
+    int size() const { return size_; }
+
+    // Indicate whether the set is empty.
+    int empty() const { return size_ == 0; }
+
+    // Iterate over the set.
+    iterator begin() { return dense_.data(); }
+    iterator end() { return dense_.data() + size_; }
+
+    const_iterator begin() const { return dense_.data(); }
+    const_iterator end() const { return dense_.data() + size_; }
+
+    // Change the maximum size of the set.
+    // Invalidates all iterators.
+    void resize(int new_max_size);
+
+    // Return the maximum size of the set.
+    // Indices can be in the range [0, max_size).
+    int max_size() const {
+        if (dense_.data() != NULL)
+            return dense_.size();
+        else
+            return 0;
+    }
+
+    // Clear the set.
+    void clear() { size_ = 0; }
+
+    // Check whether index i is in the set.
+    bool contains(int i) const;
+
+    // Comparison function for sorting.
+    // Can sort the sparse set so that future iterations
+    // will visit indices in increasing order using
+    // std::sort(arr.begin(), arr.end(), arr.less);
+    static bool less(int a, int b);
+
+public:
+    // Insert index i into the set.
+    iterator insert(int i) { return InsertInternal(true, i); }
+
+    // Insert index i into the set.
+    // Fast but unsafe: only use if contains(i) is false.
+    iterator insert_new(int i) { return InsertInternal(false, i); }
+
+private:
+    iterator InsertInternal(bool allow_existing, int i) {
+        DebugCheckInvariants();
+        if (static_cast<uint32_t>(i) >= static_cast<uint32_t>(max_size())) {
+            assert(false && "illegal index");
+            // Semantically, end() would be better here, but we already know
+            // the user did something stupid, so begin() insulates them from
+            // dereferencing an invalid pointer.
+            return begin();
+        }
+        if (!allow_existing) {
+            assert(!contains(i));
+            create_index(i);
+        } else {
+            if (!contains(i))
+                create_index(i);
+        }
+        DebugCheckInvariants();
+        return dense_.data() + sparse_[i];
+    }
+
+    // Add the index i to the set.
+    // Only use if contains(i) is known to be false.
+    // This function is private, only intended as a helper
+    // for other methods.
+    void create_index(int i);
+
+    // In debug mode, verify that some invariant properties of the class
+    // are being maintained. This is called at the end of the constructor
+    // and at the beginning and end of all public non-const member functions.
+    void DebugCheckInvariants() const;
+
+    // Initializes memory for elements [min, max).
+    void MaybeInitializeMemory(int min, int max) {
+#if __has_feature(memory_sanitizer)
+        __msan_unpoison(sparse_.data() + min, (max - min) * sizeof sparse_[0]);
+#elif defined(RE2_ON_VALGRIND)
+        for (int i = min; i < max; i++) {
+            sparse_[i] = 0xababababU;
+        }
+#endif
+    }
+
+    int size_ = 0;
+    PODArray<int> sparse_;
+    PODArray<int> dense_;
+};
+
+template<typename Value>
+SparseSetT<Value>::SparseSetT() = default;
+
+// Change the maximum size of the set.
+// Invalidates all iterators.
+template<typename Value>
+void SparseSetT<Value>::resize(int new_max_size) {
+    DebugCheckInvariants();
+    if (new_max_size > max_size()) {
+        const int old_max_size = max_size();
+
+        // Construct these first for exception safety.
+        PODArray<int> a(new_max_size);
+        PODArray<int> b(new_max_size);
+
+        std::copy_n(sparse_.data(), old_max_size, a.data());
+        std::copy_n(dense_.data(), old_max_size, b.data());
+
+        sparse_ = std::move(a);
+        dense_ = std::move(b);
+
+        MaybeInitializeMemory(old_max_size, new_max_size);
+    }
+    if (size_ > new_max_size)
+        size_ = new_max_size;
+    DebugCheckInvariants();
+}
+
+// Check whether index i is in the set.
+template<typename Value>
+bool SparseSetT<Value>::contains(int i) const {
+    assert(i >= 0);
+    assert(i < max_size());
+    if (static_cast<uint32_t>(i) >= static_cast<uint32_t>(max_size())) {
+        return false;
+    }
+    // Unsigned comparison avoids checking sparse_[i] < 0.
+    return (uint32_t)sparse_[i] < (uint32_t)size_ && dense_[sparse_[i]] == i;
+}
+
+template<typename Value>
+void SparseSetT<Value>::create_index(int i) {
+    assert(!contains(i));
+    assert(size_ < max_size());
+    sparse_[i] = size_;
+    dense_[size_] = i;
+    size_++;
+}
+
+template<typename Value>
+SparseSetT<Value>::SparseSetT(int max_size) : sparse_(max_size), dense_(max_size) {
+    MaybeInitializeMemory(size_, max_size);
+    DebugCheckInvariants();
+}
+
+template<typename Value>
+SparseSetT<Value>::~SparseSetT() {
+    DebugCheckInvariants();
+}
+
+template<typename Value>
+void SparseSetT<Value>::DebugCheckInvariants() const {
+    assert(0 <= size_);
+    assert(size_ <= max_size());
+}
+
+// Comparison function for sorting.
+template<typename Value>
+bool SparseSetT<Value>::less(int a, int b) {
+    return a < b;
+}
+
+typedef SparseSetT<void> SparseSet;
+
+} // namespace regex
+} // namespace lbug
+#endif // UTIL_SPARSE_SET_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/stringpiece.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/stringpiece.h
new file mode 100644
index 0000000000..c540d1acfd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/stringpiece.h
@@ -0,0 +1,194 @@
+// Copyright 2001-2010 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_STRINGPIECE_H_
+#define RE2_STRINGPIECE_H_
+
+#ifdef min
+#undef min
+#endif
+
+// A string-like object that points to a sized piece of memory.
+//
+// Functions or methods may use const StringPiece& parameters to accept either
+// a "const char*" or a "string" value that will be implicitly converted to
+// a StringPiece.  The implicit conversion means that it is often appropriate
+// to include this .h file in other files rather than forward-declaring
+// StringPiece as would be appropriate for most other Google classes.
+//
+// Systematic usage of StringPiece is encouraged as it will reduce unnecessary
+// conversions from "const char*" to "string" and back again.
+//
+//
+// Arghh!  I wish C++ literals were "string".
+
+// Doing this simplifies the logic below.
+#ifndef __has_include
+#define __has_include(x) 0
+#endif
+
+#include <stddef.h>
+#include <string.h>
+
+#include <algorithm>
+#include <iosfwd>
+#include <iterator>
+#include <string>
+#include <string_view>
+
+namespace lbug {
+namespace regex {
+
+class StringPiece {
+public:
+    typedef std::char_traits<char> traits_type;
+    typedef char value_type;
+    typedef char* pointer;
+    typedef const char* const_pointer;
+    typedef char& reference;
+    typedef const char& const_reference;
+    typedef const char* const_iterator;
+    typedef const_iterator iterator;
+    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+    typedef const_reverse_iterator reverse_iterator;
+    typedef size_t size_type;
+    typedef ptrdiff_t difference_type;
+    static const size_type npos = static_cast<size_type>(-1);
+
+    // We provide non-explicit singleton constructors so users can pass
+    // in a "const char*" or a "string" wherever a "StringPiece" is
+    // expected.
+    StringPiece() : data_(NULL), size_(0) {}
+    StringPiece(const std::string_view& str) : data_(str.data()), size_(str.size()) {}
+    StringPiece(const std::string& str) : data_(str.data()), size_(str.size()) {}
+    StringPiece(const char* str) : data_(str), size_(str == NULL ? 0 : strlen(str)) {}
+    StringPiece(const char* str, size_type len) : data_(str), size_(len) {}
+
+    const_iterator begin() const { return data_; }
+    const_iterator end() const { return data_ + size_; }
+    const_reverse_iterator rbegin() const { return const_reverse_iterator(data_ + size_); }
+    const_reverse_iterator rend() const { return const_reverse_iterator(data_); }
+
+    size_type size() const { return size_; }
+    size_type length() const { return size_; }
+    bool empty() const { return size_ == 0; }
+
+    const_reference operator[](size_type i) const { return data_[i]; }
+    const_pointer data() const { return data_; }
+
+    void remove_prefix(size_type n) {
+        data_ += n;
+        size_ -= n;
+    }
+
+    void remove_suffix(size_type n) { size_ -= n; }
+
+    void set(const char* str) {
+        data_ = str;
+        size_ = str == NULL ? 0 : strlen(str);
+    }
+
+    void set(const char* str, size_type len) {
+        data_ = str;
+        size_ = len;
+    }
+
+    // Converts to `std::basic_string`.
+    template<typename A>
+    explicit operator std::basic_string<char, traits_type, A>() const {
+        if (!data_)
+            return {};
+        return std::basic_string<char, traits_type, A>(data_, size_);
+    }
+
+    std::string as_string() const { return std::string(data_, size_); }
+
+    // We also define ToString() here, since many other string-like
+    // interfaces name the routine that converts to a C++ string
+    // "ToString", and it's confusing to have the method that does that
+    // for a StringPiece be called "as_string()".  We also leave the
+    // "as_string()" method defined here for existing code.
+    std::string ToString() const { return std::string(data_, size_); }
+
+    void CopyToString(std::string* target) const { target->assign(data_, size_); }
+
+    void AppendToString(std::string* target) const { target->append(data_, size_); }
+
+    size_type copy(char* buf, size_type n, size_type pos = 0) const;
+    StringPiece substr(size_type pos = 0, size_type n = npos) const;
+
+    int compare(const StringPiece& x) const {
+        size_type min_size = std::min(size(), x.size());
+        if (min_size > 0) {
+            int r = memcmp(data(), x.data(), min_size);
+            if (r < 0)
+                return -1;
+            if (r > 0)
+                return 1;
+        }
+        if (size() < x.size())
+            return -1;
+        if (size() > x.size())
+            return 1;
+        return 0;
+    }
+
+    // Does "this" start with "x"?
+    bool starts_with(const StringPiece& x) const {
+        return x.empty() || (size() >= x.size() && memcmp(data(), x.data(), x.size()) == 0);
+    }
+
+    // Does "this" end with "x"?
+    bool ends_with(const StringPiece& x) const {
+        return x.empty() || (size() >= x.size() &&
+                                memcmp(data() + (size() - x.size()), x.data(), x.size()) == 0);
+    }
+
+    bool contains(const StringPiece& s) const { return find(s) != npos; }
+
+    size_type find(const StringPiece& s, size_type pos = 0) const;
+    size_type find(char c, size_type pos = 0) const;
+    size_type rfind(const StringPiece& s, size_type pos = npos) const;
+    size_type rfind(char c, size_type pos = npos) const;
+
+private:
+    const_pointer data_;
+    size_type size_;
+};
+
+inline bool operator==(const StringPiece& x, const StringPiece& y) {
+    StringPiece::size_type len = x.size();
+    if (len != y.size())
+        return false;
+    return x.data() == y.data() || len == 0 || memcmp(x.data(), y.data(), len) == 0;
+}
+
+inline bool operator!=(const StringPiece& x, const StringPiece& y) {
+    return !(x == y);
+}
+
+inline bool operator<(const StringPiece& x, const StringPiece& y) {
+    StringPiece::size_type min_size = std::min(x.size(), y.size());
+    int r = min_size == 0 ? 0 : memcmp(x.data(), y.data(), min_size);
+    return (r < 0) || (r == 0 && x.size() < y.size());
+}
+
+inline bool operator>(const StringPiece& x, const StringPiece& y) {
+    return y < x;
+}
+
+inline bool operator<=(const StringPiece& x, const StringPiece& y) {
+    return !(x > y);
+}
+
+inline bool operator>=(const StringPiece& x, const StringPiece& y) {
+    return !(x < y);
+}
+
+// Allow StringPiece to be logged.
+std::ostream& operator<<(std::ostream& o, const StringPiece& p);
+
+} // namespace regex
+} // namespace lbug
+#endif // RE2_STRINGPIECE_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/strutil.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/strutil.h
new file mode 100644
index 0000000000..b9bb4e0a70
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/strutil.h
@@ -0,0 +1,25 @@
+// Copyright 2016 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef UTIL_STRUTIL_H_
+#define UTIL_STRUTIL_H_
+
+#include <string>
+
+#include "stringpiece.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+std::string CEscape(const StringPiece& src);
+void PrefixSuccessor(std::string* prefix);
+std::string StringPrintf(const char* format, ...);
+void SStringPrintf(std::string* dst, const char* format, ...);
+void StringAppendF(std::string* dst, const char* format, ...);
+
+} // namespace regex
+} // namespace lbug
+
+#endif // UTIL_STRUTIL_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/unicode_casefold.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/unicode_casefold.h
new file mode 100644
index 0000000000..e57d9119ba
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/unicode_casefold.h
@@ -0,0 +1,79 @@
+// Copyright 2008 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_UNICODE_CASEFOLD_H_
+#define RE2_UNICODE_CASEFOLD_H_
+
+// Unicode case folding tables.
+
+// The Unicode case folding tables encode the mapping from one Unicode point
+// to the next largest Unicode point with equivalent folding.  The largest
+// point wraps back to the first.  For example, the tables map:
+//
+//     'A' -> 'a'
+//     'a' -> 'A'
+//
+//     'K' -> 'k'
+//     'k' -> 'K'  (Kelvin symbol)
+//     'K' -> 'K'
+//
+// Like everything Unicode, these tables are big.  If we represent the table
+// as a sorted list of uint32_t pairs, it has 2049 entries and is 16 kB.
+// Most table entries look like the ones around them:
+// 'A' maps to 'A'+32, 'B' maps to 'B'+32, etc.
+// Instead of listing all the pairs explicitly, we make a list of ranges
+// and deltas, so that the table entries for 'A' through 'Z' can be represented
+// as a single entry { 'A', 'Z', +32 }.
+//
+// In addition to blocks that map to each other (A-Z mapping to a-z)
+// there are blocks of pairs that individually map to each other
+// (for example, 0100<->0101, 0102<->0103, 0104<->0105, ...).
+// For those, the special delta value EvenOdd marks even/odd pairs
+// (if even, add 1; if odd, subtract 1), and OddEven marks odd/even pairs.
+//
+// In this form, the table has 274 entries, about 3kB.  If we were to split
+// the table into one for 16-bit codes and an overflow table for larger ones,
+// we could get it down to about 1.5kB, but that's not worth the complexity.
+//
+// The grouped form also allows for efficient fold range calculations
+// rather than looping one character at a time.
+
+#include <stdint.h>
+
+#include "utf.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+enum {
+    EvenOdd = 1,
+    OddEven = -1,
+    EvenOddSkip = 1 << 30,
+    OddEvenSkip,
+};
+
+struct CaseFold {
+    Rune lo;
+    Rune hi;
+    int32_t delta;
+};
+
+extern const CaseFold unicode_casefold[];
+extern const int num_unicode_casefold;
+
+extern const CaseFold unicode_tolower[];
+extern const int num_unicode_tolower;
+
+// Returns the CaseFold* in the tables that contains rune.
+// If rune is not in the tables, returns the first CaseFold* after rune.
+// If rune is larger than any value in the tables, returns NULL.
+extern const CaseFold* LookupCaseFold(const CaseFold*, int, Rune rune);
+
+// Returns the result of applying the fold f to the rune r.
+extern Rune ApplyFold(const CaseFold* f, Rune r);
+
+} // namespace regex
+} // namespace lbug
+#endif // RE2_UNICODE_CASEFOLD_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/unicode_groups.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/unicode_groups.h
new file mode 100644
index 0000000000..ae680bc4e1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/unicode_groups.h
@@ -0,0 +1,65 @@
+// Copyright 2008 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_UNICODE_GROUPS_H_
+#define RE2_UNICODE_GROUPS_H_
+
+// Unicode character groups.
+
+// The codes get split into ranges of 16-bit codes
+// and ranges of 32-bit codes.  It would be simpler
+// to use only 32-bit ranges, but these tables are large
+// enough to warrant extra care.
+//
+// Using just 32-bit ranges gives 27 kB of data.
+// Adding 16-bit ranges gives 18 kB of data.
+// Adding an extra table of 16-bit singletons would reduce
+// to 16.5 kB of data but make the data harder to use;
+// we don't bother.
+
+#include <stdint.h>
+
+#include "utf.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+struct URange16 {
+    uint16_t lo;
+    uint16_t hi;
+};
+
+struct URange32 {
+    Rune lo;
+    Rune hi;
+};
+
+struct UGroup {
+    const char* name;
+    int sign; // +1 for [abc], -1 for [^abc]
+    const URange16* r16;
+    int nr16;
+    const URange32* r32;
+    int nr32;
+};
+
+// Named by property or script name (e.g., "Nd", "N", "Han").
+// Negated groups are not included.
+extern const UGroup unicode_groups[];
+extern const int num_unicode_groups;
+
+// Named by POSIX name (e.g., "[:alpha:]", "[:^lower:]").
+// Negated groups are included.
+extern const UGroup posix_groups[];
+extern const int num_posix_groups;
+
+// Named by Perl name (e.g., "\\d", "\\D").
+// Negated groups are included.
+extern const UGroup perl_groups[];
+extern const int num_perl_groups;
+
+} // namespace regex
+} // namespace lbug
+#endif // RE2_UNICODE_GROUPS_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/utf.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/utf.h
new file mode 100644
index 0000000000..d016bd71db
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/utf.h
@@ -0,0 +1,44 @@
+/*
+ * The authors of this software are Rob Pike and Ken Thompson.
+ *              Copyright (c) 2002 by Lucent Technologies.
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose without fee is hereby granted, provided that this entire notice
+ * is included in all copies of any software which is or includes a copy
+ * or modification of this software and in all copies of the supporting
+ * documentation for such software.
+ * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
+ * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY
+ * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
+ * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
+ *
+ * This file and rune.cc have been converted to compile as C++ code
+ * in name space re2.
+ */
+
+#ifndef UTIL_UTF_H_
+#define UTIL_UTF_H_
+
+#include <stdint.h>
+
+namespace lbug {
+namespace regex {
+
+typedef signed int Rune; /* Code-point values in Unicode 4.0 are 21 bits wide.*/
+
+enum {
+    UTFmax = 4,         /* maximum bytes per rune */
+    Runesync = 0x80,    /* cannot represent part of a UTF sequence (<) */
+    Runeself = 0x80,    /* rune and UTF sequences are the same (<) */
+    Runeerror = 0xFFFD, /* decoding error in UTF */
+    Runemax = 0x10FFFF, /* maximum rune value */
+};
+
+int runetochar(char* s, const Rune* r);
+int chartorune(Rune* r, const char* s);
+int fullrune(const char* s, int n);
+int utflen(const char* s);
+char* utfrune(const char*, Rune);
+
+} // namespace regex
+} // namespace lbug
+#endif // UTIL_UTF_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/util.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/util.h
new file mode 100644
index 0000000000..a768eb0b0b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/util.h
@@ -0,0 +1,36 @@
+// Copyright 2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef UTIL_UTIL_H_
+#define UTIL_UTIL_H_
+
+#define arraysize(array) (int)(sizeof(array) / sizeof((array)[0]))
+
+#ifndef ATTRIBUTE_NORETURN
+#if defined(__GNUC__)
+#define ATTRIBUTE_NORETURN __attribute__((noreturn))
+#elif defined(_MSC_VER)
+#define ATTRIBUTE_NORETURN __declspec(noreturn)
+#else
+#define ATTRIBUTE_NORETURN
+#endif
+#endif
+
+#ifndef FALLTHROUGH_INTENDED
+#if defined(__clang__)
+#define FALLTHROUGH_INTENDED [[clang::fallthrough]]
+#elif defined(__GNUC__) && __GNUC__ >= 7
+#define FALLTHROUGH_INTENDED [[gnu::fallthrough]]
+#else
+#define FALLTHROUGH_INTENDED                                                                       \
+    do {                                                                                           \
+    } while (0)
+#endif
+#endif
+
+#ifndef NO_THREAD_SAFETY_ANALYSIS
+#define NO_THREAD_SAFETY_ANALYSIS
+#endif
+
+#endif // UTIL_UTIL_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/walker-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/walker-inl.h
new file mode 100644
index 0000000000..f5c4bcce0f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/include/walker-inl.h
@@ -0,0 +1,249 @@
+// Copyright 2006 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#ifndef RE2_WALKER_INL_H_
+#define RE2_WALKER_INL_H_
+
+// Helper class for traversing Regexps without recursion.
+// Clients should declare their own subclasses that override
+// the PreVisit and PostVisit methods, which are called before
+// and after visiting the subexpressions.
+
+// Not quite the Visitor pattern, because (among other things)
+// the Visitor pattern is recursive.
+
+#include <stack>
+
+#include "logging.h"
+#include "regexp.h"
+
+namespace lbug {
+namespace regex {
+
+template<typename T>
+struct WalkState;
+
+template<typename T>
+class Regexp::Walker {
+public:
+    Walker();
+    virtual ~Walker();
+
+    // Virtual method called before visiting re's children.
+    // PreVisit passes ownership of its return value to its caller.
+    // The Arg* that PreVisit returns will be passed to PostVisit as pre_arg
+    // and passed to the child PreVisits and PostVisits as parent_arg.
+    // At the top-most Regexp, parent_arg is arg passed to walk.
+    // If PreVisit sets *stop to true, the walk does not recurse
+    // into the children.  Instead it behaves as though the return
+    // value from PreVisit is the return value from PostVisit.
+    // The default PreVisit returns parent_arg.
+    virtual T PreVisit(Regexp* re, T parent_arg, bool* stop);
+
+    // Virtual method called after visiting re's children.
+    // The pre_arg is the T that PreVisit returned.
+    // The child_args is a vector of the T that the child PostVisits returned.
+    // PostVisit takes ownership of pre_arg.
+    // PostVisit takes ownership of the Ts
+    // in *child_args, but not the vector itself.
+    // PostVisit passes ownership of its return value
+    // to its caller.
+    // The default PostVisit simply returns pre_arg.
+    virtual T PostVisit(Regexp* re, T parent_arg, T pre_arg, T* child_args, int nchild_args);
+
+    // Virtual method called to copy a T,
+    // when Walk notices that more than one child is the same re.
+    virtual T Copy(T arg);
+
+    // Virtual method called to do a "quick visit" of the re,
+    // but not its children.  Only called once the visit budget
+    // has been used up and we're trying to abort the walk
+    // as quickly as possible.  Should return a value that
+    // makes sense for the parent PostVisits still to be run.
+    // This function is (hopefully) only called by
+    // WalkExponential, but must be implemented by all clients,
+    // just in case.
+    virtual T ShortVisit(Regexp* re, T parent_arg) = 0;
+
+    // Walks over a regular expression.
+    // Top_arg is passed as parent_arg to PreVisit and PostVisit of re.
+    // Returns the T returned by PostVisit on re.
+    T Walk(Regexp* re, T top_arg);
+
+    // Like Walk, but doesn't use Copy.  This can lead to
+    // exponential runtimes on cross-linked Regexps like the
+    // ones generated by Simplify.  To help limit this,
+    // at most max_visits nodes will be visited and then
+    // the walk will be cut off early.
+    // If the walk *is* cut off early, ShortVisit(re)
+    // will be called on regexps that cannot be fully
+    // visited rather than calling PreVisit/PostVisit.
+    T WalkExponential(Regexp* re, T top_arg, int max_visits);
+
+    // Clears the stack.  Should never be necessary, since
+    // Walk always enters and exits with an empty stack.
+    // Logs DFATAL if stack is not already clear.
+    void Reset();
+
+    // Returns whether walk was cut off.
+    bool stopped_early() { return stopped_early_; }
+
+private:
+    // Walk state for the entire traversal.
+    std::stack<WalkState<T>> stack_;
+    bool stopped_early_;
+    int max_visits_;
+
+    T WalkInternal(Regexp* re, T top_arg, bool use_copy);
+
+    Walker(const Walker&) = delete;
+    Walker& operator=(const Walker&) = delete;
+};
+
+template<typename T>
+T Regexp::Walker<T>::PreVisit(Regexp* re, T parent_arg, bool* stop) {
+    return parent_arg;
+}
+
+template<typename T>
+T Regexp::Walker<T>::PostVisit(
+    Regexp* re, T parent_arg, T pre_arg, T* child_args, int nchild_args) {
+    return pre_arg;
+}
+
+template<typename T>
+T Regexp::Walker<T>::Copy(T arg) {
+    return arg;
+}
+
+// State about a single level in the traversal.
+template<typename T>
+struct WalkState {
+    WalkState(Regexp* re, T parent) : re(re), n(-1), parent_arg(parent), child_args(NULL) {}
+
+    Regexp* re;   // The regexp
+    int n;        // The index of the next child to process; -1 means need to PreVisit
+    T parent_arg; // Accumulated arguments.
+    T pre_arg;
+    T child_arg; // One-element buffer for child_args.
+    T* child_args;
+};
+
+template<typename T>
+Regexp::Walker<T>::Walker() {
+    stopped_early_ = false;
+}
+
+template<typename T>
+Regexp::Walker<T>::~Walker() {
+    Reset();
+}
+
+// Clears the stack.  Should never be necessary, since
+// Walk always enters and exits with an empty stack.
+// Logs DFATAL if stack is not already clear.
+template<typename T>
+void Regexp::Walker<T>::Reset() {
+    if (!stack_.empty()) {
+        LOG(DFATAL) << "Stack not empty.";
+        while (!stack_.empty()) {
+            if (stack_.top().re->nsub_ > 1)
+                delete[] stack_.top().child_args;
+            stack_.pop();
+        }
+    }
+}
+
+template<typename T>
+T Regexp::Walker<T>::WalkInternal(Regexp* re, T top_arg, bool use_copy) {
+    Reset();
+
+    if (re == NULL) {
+        LOG(DFATAL) << "Walk NULL";
+        return top_arg;
+    }
+
+    stack_.push(WalkState<T>(re, top_arg));
+
+    WalkState<T>* s;
+    for (;;) {
+        T t;
+        s = &stack_.top();
+        re = s->re;
+        switch (s->n) {
+        case -1: {
+            if (--max_visits_ < 0) {
+                stopped_early_ = true;
+                t = ShortVisit(re, s->parent_arg);
+                break;
+            }
+            bool stop = false;
+            s->pre_arg = PreVisit(re, s->parent_arg, &stop);
+            if (stop) {
+                t = s->pre_arg;
+                break;
+            }
+            s->n = 0;
+            s->child_args = NULL;
+            if (re->nsub_ == 1)
+                s->child_args = &s->child_arg;
+            else if (re->nsub_ > 1)
+                s->child_args = new T[re->nsub_];
+            FALLTHROUGH_INTENDED;
+        }
+        default: {
+            if (re->nsub_ > 0) {
+                Regexp** sub = re->sub();
+                if (s->n < re->nsub_) {
+                    if (use_copy && s->n > 0 && sub[s->n - 1] == sub[s->n]) {
+                        s->child_args[s->n] = Copy(s->child_args[s->n - 1]);
+                        s->n++;
+                    } else {
+                        stack_.push(WalkState<T>(sub[s->n], s->pre_arg));
+                    }
+                    continue;
+                }
+            }
+
+            t = PostVisit(re, s->parent_arg, s->pre_arg, s->child_args, s->n);
+            if (re->nsub_ > 1)
+                delete[] s->child_args;
+            break;
+        }
+        }
+
+        // We've finished stack_.top().
+        // Update next guy down.
+        stack_.pop();
+        if (stack_.empty())
+            return t;
+        s = &stack_.top();
+        if (s->child_args != NULL)
+            s->child_args[s->n] = t;
+        else
+            s->child_arg = t;
+        s->n++;
+    }
+}
+
+template<typename T>
+T Regexp::Walker<T>::Walk(Regexp* re, T top_arg) {
+    // Without the exponential walking behavior,
+    // this budget should be more than enough for any
+    // regexp, and yet not enough to get us in trouble
+    // as far as CPU time.
+    max_visits_ = 1000000;
+    return WalkInternal(re, top_arg, true);
+}
+
+template<typename T>
+T Regexp::Walker<T>::WalkExponential(Regexp* re, T top_arg, int max_visits) {
+    max_visits_ = max_visits;
+    return WalkInternal(re, top_arg, false);
+}
+
+} // namespace regex
+} // namespace lbug
+
+#endif // RE2_WALKER_INL_H_
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/mimics_pcre.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/mimics_pcre.cpp
new file mode 100644
index 0000000000..b4bae4d3d0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/mimics_pcre.cpp
@@ -0,0 +1,198 @@
+// Copyright 2008 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Determine whether this library should match PCRE exactly
+// for a particular Regexp.  (If so, the testing framework can
+// check that it does.)
+//
+// This library matches PCRE except in these cases:
+//   * the regexp contains a repetition of an empty string,
+//     like (a*)* or (a*)+.  In this case, PCRE will treat
+//     the repetition sequence as ending with an empty string,
+//     while this library does not.
+//   * Perl and PCRE differ on whether \v matches \n.
+//     For historical reasons, this library implements the Perl behavior.
+//   * Perl and PCRE allow $ in one-line mode to match either the very
+//     end of the text or just before a \n at the end of the text.
+//     This library requires it to match only the end of the text.
+//   * Similarly, Perl and PCRE do not allow ^ in multi-line mode to
+//     match the end of the text if the last character is a \n.
+//     This library does allow it.
+//
+// Regexp::MimicsPCRE checks for any of these conditions.
+
+#include "logging.h"
+#include "regexp.h"
+#include "util.h"
+#include "walker-inl.h"
+
+namespace lbug {
+namespace regex {
+
+// Returns whether re might match an empty string.
+static bool CanBeEmptyString(Regexp* re);
+
+// Walker class to compute whether library handles a regexp
+// exactly as PCRE would.  See comment at top for conditions.
+
+class PCREWalker : public Regexp::Walker<bool> {
+public:
+    PCREWalker() {}
+
+    virtual bool PostVisit(
+        Regexp* re, bool parent_arg, bool pre_arg, bool* child_args, int nchild_args);
+
+    virtual bool ShortVisit(Regexp* re, bool a) {
+        // Should never be called: we use Walk(), not WalkExponential().
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+        LOG(DFATAL) << "PCREWalker::ShortVisit called";
+#endif
+        return a;
+    }
+
+private:
+    PCREWalker(const PCREWalker&) = delete;
+    PCREWalker& operator=(const PCREWalker&) = delete;
+};
+
+// Called after visiting each of re's children and accumulating
+// the return values in child_args.  So child_args contains whether
+// this library mimics PCRE for those subexpressions.
+bool PCREWalker::PostVisit(
+    Regexp* re, bool parent_arg, bool pre_arg, bool* child_args, int nchild_args) {
+    // If children failed, so do we.
+    for (int i = 0; i < nchild_args; i++)
+        if (!child_args[i])
+            return false;
+
+    // Otherwise look for other reasons to fail.
+    switch (re->op()) {
+    // Look for repeated empty string.
+    case kRegexpStar:
+    case kRegexpPlus:
+    case kRegexpQuest:
+        if (CanBeEmptyString(re->sub()[0]))
+            return false;
+        break;
+    case kRegexpRepeat:
+        if (re->max() == -1 && CanBeEmptyString(re->sub()[0]))
+            return false;
+        break;
+
+    // Look for \v
+    case kRegexpLiteral:
+        if (re->rune() == '\v')
+            return false;
+        break;
+
+    // Look for $ in single-line mode.
+    case kRegexpEndText:
+    case kRegexpEmptyMatch:
+        if (re->parse_flags() & Regexp::WasDollar)
+            return false;
+        break;
+
+    // Look for ^ in multi-line mode.
+    case kRegexpBeginLine:
+        // No condition: in single-line mode ^ becomes kRegexpBeginText.
+        return false;
+
+    default:
+        break;
+    }
+
+    // Not proven guilty.
+    return true;
+}
+
+// Returns whether this regexp's behavior will mimic PCRE's exactly.
+bool Regexp::MimicsPCRE() {
+    PCREWalker w;
+    return w.Walk(this, true);
+}
+
+// Walker class to compute whether a Regexp can match an empty string.
+// It is okay to overestimate.  For example, \b\B cannot match an empty
+// string, because \b and \B are mutually exclusive, but this isn't
+// that smart and will say it can.  Spurious empty strings
+// will reduce the number of regexps we sanity check against PCRE,
+// but they won't break anything.
+
+class EmptyStringWalker : public Regexp::Walker<bool> {
+public:
+    EmptyStringWalker() {}
+
+    virtual bool PostVisit(
+        Regexp* re, bool parent_arg, bool pre_arg, bool* child_args, int nchild_args);
+
+    virtual bool ShortVisit(Regexp* re, bool a) {
+        // Should never be called: we use Walk(), not WalkExponential().
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+        LOG(DFATAL) << "EmptyStringWalker::ShortVisit called";
+#endif
+        return a;
+    }
+
+private:
+    EmptyStringWalker(const EmptyStringWalker&) = delete;
+    EmptyStringWalker& operator=(const EmptyStringWalker&) = delete;
+};
+
+// Called after visiting re's children.  child_args contains the return
+// value from each of the children's PostVisits (i.e., whether each child
+// can match an empty string).  Returns whether this clause can match an
+// empty string.
+bool EmptyStringWalker::PostVisit(
+    Regexp* re, bool parent_arg, bool pre_arg, bool* child_args, int nchild_args) {
+    switch (re->op()) {
+    case kRegexpNoMatch: // never empty
+    case kRegexpLiteral:
+    case kRegexpAnyChar:
+    case kRegexpAnyByte:
+    case kRegexpCharClass:
+    case kRegexpLiteralString:
+        return false;
+
+    case kRegexpEmptyMatch: // always empty
+    case kRegexpBeginLine:  // always empty, when they match
+    case kRegexpEndLine:
+    case kRegexpNoWordBoundary:
+    case kRegexpWordBoundary:
+    case kRegexpBeginText:
+    case kRegexpEndText:
+    case kRegexpStar: // can always be empty
+    case kRegexpQuest:
+    case kRegexpHaveMatch:
+        return true;
+
+    case kRegexpConcat: // can be empty if all children can
+        for (int i = 0; i < nchild_args; i++)
+            if (!child_args[i])
+                return false;
+        return true;
+
+    case kRegexpAlternate: // can be empty if any child can
+        for (int i = 0; i < nchild_args; i++)
+            if (child_args[i])
+                return true;
+        return false;
+
+    case kRegexpPlus: // can be empty if the child can
+    case kRegexpCapture:
+        return child_args[0];
+
+    case kRegexpRepeat: // can be empty if child can or is x{0}
+        return child_args[0] || re->min() == 0;
+    }
+    return false;
+}
+
+// Returns whether re can match an empty string.
+static bool CanBeEmptyString(Regexp* re) {
+    EmptyStringWalker w;
+    return w.Walk(re, true);
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/nfa.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/nfa.cpp
new file mode 100644
index 0000000000..871b23b4aa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/nfa.cpp
@@ -0,0 +1,701 @@
+// Copyright 2006-2007 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Tested by search_test.cc.
+//
+// Prog::SearchNFA, an NFA search.
+// This is an actual NFA like the theorists talk about,
+// not the pseudo-NFA found in backtracking regexp implementations.
+//
+// IMPLEMENTATION
+//
+// This algorithm is a variant of one that appeared in Rob Pike's sam editor,
+// which is a variant of the one described in Thompson's 1968 CACM paper.
+// See http://swtch.com/~rsc/regexp/ for various history.  The main feature
+// over the DFA implementation is that it tracks submatch boundaries.
+//
+// When the choice of submatch boundaries is ambiguous, this particular
+// implementation makes the same choices that traditional backtracking
+// implementations (in particular, Perl and PCRE) do.
+// Note that unlike in Perl and PCRE, this algorithm *cannot* take exponential
+// time in the length of the input.
+//
+// Like Thompson's original machine and like the DFA implementation, this
+// implementation notices a match only once it is one byte past it.
+
+#include <stdio.h>
+#include <string.h>
+
+#include <algorithm>
+#include <deque>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "logging.h"
+#include "pod_array.h"
+#include "prog.h"
+#include "regexp.h"
+#include "sparse_array.h"
+#include "sparse_set.h"
+#include "strutil.h"
+
+namespace lbug {
+namespace regex {
+
+static const bool ExtraDebug = false;
+
+class NFA {
+public:
+    NFA(Prog* prog);
+    ~NFA();
+
+    // Searches for a matching string.
+    //   * If anchored is true, only considers matches starting at offset.
+    //     Otherwise finds lefmost match at or after offset.
+    //   * If longest is true, returns the longest match starting
+    //     at the chosen start point.  Otherwise returns the so-called
+    //     left-biased match, the one traditional backtracking engines
+    //     (like Perl and PCRE) find.
+    // Records submatch boundaries in submatch[1..nsubmatch-1].
+    // Submatch[0] is the entire match.  When there is a choice in
+    // which text matches each subexpression, the submatch boundaries
+    // are chosen to match what a backtracking implementation would choose.
+    bool Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest,
+        StringPiece* submatch, int nsubmatch);
+
+private:
+    struct Thread {
+        union {
+            int ref;
+            Thread* next; // when on free list
+        };
+        const char** capture;
+    };
+
+    // State for explicit stack in AddToThreadq.
+    struct AddState {
+        int id;    // Inst to process
+        Thread* t; // if not null, set t0 = t before processing id
+    };
+
+    // Threadq is a list of threads.  The list is sorted by the order
+    // in which Perl would explore that particular state -- the earlier
+    // choices appear earlier in the list.
+    typedef SparseArray<Thread*> Threadq;
+
+    inline Thread* AllocThread();
+    inline Thread* Incref(Thread* t);
+    inline void Decref(Thread* t);
+
+    // Follows all empty arrows from id0 and enqueues all the states reached.
+    // Enqueues only the ByteRange instructions that match byte c.
+    // context is used (with p) for evaluating empty-width specials.
+    // p is the current input position, and t0 is the current thread.
+    void AddToThreadq(
+        Threadq* q, int id0, int c, const StringPiece& context, const char* p, Thread* t0);
+
+    // Run runq on byte c, appending new states to nextq.
+    // Updates matched_ and match_ as new, better matches are found.
+    // context is used (with p) for evaluating empty-width specials.
+    // p is the position of byte c in the input string for AddToThreadq;
+    // p-1 will be used when processing Match instructions.
+    // Frees all the threads on runq.
+    // If there is a shortcut to the end, returns that shortcut.
+    int Step(Threadq* runq, Threadq* nextq, int c, const StringPiece& context, const char* p);
+
+    // Returns text version of capture information, for debugging.
+    std::string FormatCapture(const char** capture);
+
+    void CopyCapture(const char** dst, const char** src) {
+        memmove(dst, src, ncapture_ * sizeof src[0]);
+    }
+
+    Prog* prog_;               // underlying program
+    int start_;                // start instruction in program
+    int ncapture_;             // number of submatches to track
+    bool longest_;             // whether searching for longest match
+    bool endmatch_;            // whether match must end at text.end()
+    const char* btext_;        // beginning of text (for FormatSubmatch)
+    const char* etext_;        // end of text (for endmatch_)
+    Threadq q0_, q1_;          // pre-allocated for Search.
+    PODArray<AddState> stack_; // pre-allocated for AddToThreadq
+    std::deque<Thread> arena_; // thread arena
+    Thread* freelist_;         // thread freelist
+    const char** match_;       // best match so far
+    bool matched_;             // any match so far?
+
+    NFA(const NFA&) = delete;
+    NFA& operator=(const NFA&) = delete;
+};
+
+NFA::NFA(Prog* prog) {
+    prog_ = prog;
+    start_ = prog_->start();
+    ncapture_ = 0;
+    longest_ = false;
+    endmatch_ = false;
+    btext_ = NULL;
+    etext_ = NULL;
+    q0_.resize(prog_->size());
+    q1_.resize(prog_->size());
+    // See NFA::AddToThreadq() for why this is so.
+    int nstack = 2 * prog_->inst_count(kInstCapture) + prog_->inst_count(kInstEmptyWidth) +
+                 prog_->inst_count(kInstNop) + 1; // + 1 for start inst
+    stack_ = PODArray<AddState>(nstack);
+    freelist_ = NULL;
+    match_ = NULL;
+    matched_ = false;
+}
+
+NFA::~NFA() {
+    delete[] match_;
+    for (const Thread& t : arena_)
+        delete[] t.capture;
+}
+
+NFA::Thread* NFA::AllocThread() {
+    Thread* t = freelist_;
+    if (t != NULL) {
+        freelist_ = t->next;
+        t->ref = 1;
+        // We don't need to touch t->capture because
+        // the caller will immediately overwrite it.
+        return t;
+    }
+    arena_.emplace_back();
+    t = &arena_.back();
+    t->ref = 1;
+    t->capture = new const char*[ncapture_];
+    return t;
+}
+
+NFA::Thread* NFA::Incref(Thread* t) {
+    DCHECK(t != NULL);
+    t->ref++;
+    return t;
+}
+
+void NFA::Decref(Thread* t) {
+    DCHECK(t != NULL);
+    t->ref--;
+    if (t->ref > 0)
+        return;
+    DCHECK_EQ(t->ref, 0);
+    t->next = freelist_;
+    freelist_ = t;
+}
+
+// Follows all empty arrows from id0 and enqueues all the states reached.
+// Enqueues only the ByteRange instructions that match byte c.
+// context is used (with p) for evaluating empty-width specials.
+// p is the current input position, and t0 is the current thread.
+void NFA::AddToThreadq(
+    Threadq* q, int id0, int c, const StringPiece& context, const char* p, Thread* t0) {
+    if (id0 == 0)
+        return;
+
+    // Use stack_ to hold our stack of instructions yet to process.
+    // It was preallocated as follows:
+    //   two entries per Capture;
+    //   one entry per EmptyWidth; and
+    //   one entry per Nop.
+    // This reflects the maximum number of stack pushes that each can
+    // perform. (Each instruction can be processed at most once.)
+    AddState* stk = stack_.data();
+    int nstk = 0;
+
+    stk[nstk++] = {id0, NULL};
+    while (nstk > 0) {
+        DCHECK_LE(nstk, stack_.size());
+        AddState a = stk[--nstk];
+
+    Loop:
+        if (a.t != NULL) {
+            // t0 was a thread that we allocated and copied in order to
+            // record the capture, so we must now decref it.
+            Decref(t0);
+            t0 = a.t;
+        }
+
+        int id = a.id;
+        if (id == 0)
+            continue;
+        if (q->has_index(id)) {
+            if (ExtraDebug)
+                fprintf(stderr, "  [%d%s]\n", id, FormatCapture(t0->capture).c_str());
+            continue;
+        }
+
+        // Create entry in q no matter what.  We might fill it in below,
+        // or we might not.  Even if not, it is necessary to have it,
+        // so that we don't revisit id0 during the recursion.
+        q->set_new(id, NULL);
+        Thread** tp = &q->get_existing(id);
+        int j;
+        Thread* t;
+        Prog::Inst* ip = prog_->inst(id);
+        switch (ip->opcode()) {
+        default:
+            LOG(DFATAL) << "unhandled " << ip->opcode() << " in AddToThreadq";
+            break;
+
+        case kInstFail:
+            break;
+
+        case kInstAltMatch:
+            // Save state; will pick up at next byte.
+            t = Incref(t0);
+            *tp = t;
+
+            DCHECK(!ip->last());
+            a = {id + 1, NULL};
+            goto Loop;
+
+        case kInstNop:
+            if (!ip->last())
+                stk[nstk++] = {id + 1, NULL};
+
+            // Continue on.
+            a = {ip->out(), NULL};
+            goto Loop;
+
+        case kInstCapture:
+            if (!ip->last())
+                stk[nstk++] = {id + 1, NULL};
+
+            if ((j = ip->cap()) < ncapture_) {
+                // Push a dummy whose only job is to restore t0
+                // once we finish exploring this possibility.
+                stk[nstk++] = {0, t0};
+
+                // Record capture.
+                t = AllocThread();
+                CopyCapture(t->capture, t0->capture);
+                t->capture[j] = p;
+                t0 = t;
+            }
+            a = {ip->out(), NULL};
+            goto Loop;
+
+        case kInstByteRange:
+            if (!ip->Matches(c))
+                goto Next;
+
+            // Save state; will pick up at next byte.
+            t = Incref(t0);
+            *tp = t;
+            if (ExtraDebug)
+                fprintf(stderr, " + %d%s\n", id, FormatCapture(t0->capture).c_str());
+
+            if (ip->hint() == 0)
+                break;
+            a = {id + ip->hint(), NULL};
+            goto Loop;
+
+        case kInstMatch:
+            // Save state; will pick up at next byte.
+            t = Incref(t0);
+            *tp = t;
+            if (ExtraDebug)
+                fprintf(stderr, " ! %d%s\n", id, FormatCapture(t0->capture).c_str());
+
+        Next:
+            if (ip->last())
+                break;
+            a = {id + 1, NULL};
+            goto Loop;
+
+        case kInstEmptyWidth:
+            if (!ip->last())
+                stk[nstk++] = {id + 1, NULL};
+
+            // Continue on if we have all the right flag bits.
+            if (ip->empty() & ~Prog::EmptyFlags(context, p))
+                break;
+            a = {ip->out(), NULL};
+            goto Loop;
+        }
+    }
+}
+
+// Run runq on byte c, appending new states to nextq.
+// Updates matched_ and match_ as new, better matches are found.
+// context is used (with p) for evaluating empty-width specials.
+// p is the position of byte c in the input string for AddToThreadq;
+// p-1 will be used when processing Match instructions.
+// Frees all the threads on runq.
+// If there is a shortcut to the end, returns that shortcut.
+int NFA::Step(Threadq* runq, Threadq* nextq, int c, const StringPiece& context, const char* p) {
+    nextq->clear();
+
+    for (Threadq::iterator i = runq->begin(); i != runq->end(); ++i) {
+        Thread* t = i->value();
+        if (t == NULL)
+            continue;
+
+        if (longest_) {
+            // Can skip any threads started after our current best match.
+            if (matched_ && match_[0] < t->capture[0]) {
+                Decref(t);
+                continue;
+            }
+        }
+
+        int id = i->index();
+        Prog::Inst* ip = prog_->inst(id);
+
+        switch (ip->opcode()) {
+        default:
+            // Should only see the values handled below.
+            LOG(DFATAL) << "Unhandled " << ip->opcode() << " in step";
+            break;
+
+        case kInstByteRange:
+            AddToThreadq(nextq, ip->out(), c, context, p, t);
+            break;
+
+        case kInstAltMatch:
+            if (i != runq->begin())
+                break;
+            // The match is ours if we want it.
+            if (ip->greedy(prog_) || longest_) {
+                CopyCapture(match_, t->capture);
+                matched_ = true;
+
+                Decref(t);
+                for (++i; i != runq->end(); ++i) {
+                    if (i->value() != NULL)
+                        Decref(i->value());
+                }
+                runq->clear();
+                if (ip->greedy(prog_))
+                    return ip->out1();
+                return ip->out();
+            }
+            break;
+
+        case kInstMatch: {
+            // Avoid invoking undefined behavior (arithmetic on a null pointer)
+            // by storing p instead of p-1. (What would the latter even mean?!)
+            // This complements the special case in NFA::Search().
+            if (p == NULL) {
+                CopyCapture(match_, t->capture);
+                match_[1] = p;
+                matched_ = true;
+                break;
+            }
+
+            if (endmatch_ && p - 1 != etext_)
+                break;
+
+            if (longest_) {
+                // Leftmost-longest mode: save this match only if
+                // it is either farther to the left or at the same
+                // point but longer than an existing match.
+                if (!matched_ || t->capture[0] < match_[0] ||
+                    (t->capture[0] == match_[0] && p - 1 > match_[1])) {
+                    CopyCapture(match_, t->capture);
+                    match_[1] = p - 1;
+                    matched_ = true;
+                }
+            } else {
+                // Leftmost-biased mode: this match is by definition
+                // better than what we've already found (see next line).
+                CopyCapture(match_, t->capture);
+                match_[1] = p - 1;
+                matched_ = true;
+
+                // Cut off the threads that can only find matches
+                // worse than the one we just found: don't run the
+                // rest of the current Threadq.
+                Decref(t);
+                for (++i; i != runq->end(); ++i) {
+                    if (i->value() != NULL)
+                        Decref(i->value());
+                }
+                runq->clear();
+                return 0;
+            }
+            break;
+        }
+        }
+        Decref(t);
+    }
+    runq->clear();
+    return 0;
+}
+
+std::string NFA::FormatCapture(const char** capture) {
+    std::string s;
+    for (int i = 0; i < ncapture_; i += 2) {
+        if (capture[i] == NULL)
+            s += "(?,?)";
+        else if (capture[i + 1] == NULL)
+            s += StringPrintf("(%td,?)", capture[i] - btext_);
+        else
+            s += StringPrintf("(%td,%td)", capture[i] - btext_, capture[i + 1] - btext_);
+    }
+    return s;
+}
+
+bool NFA::Search(const StringPiece& text, const StringPiece& const_context, bool anchored,
+    bool longest, StringPiece* submatch, int nsubmatch) {
+    if (start_ == 0)
+        return false;
+
+    StringPiece context = const_context;
+    if (context.data() == NULL)
+        context = text;
+
+    // Sanity check: make sure that text lies within context.
+    if (BeginPtr(text) < BeginPtr(context) || EndPtr(text) > EndPtr(context)) {
+        LOG(DFATAL) << "context does not contain text";
+        return false;
+    }
+
+    if (prog_->anchor_start() && BeginPtr(context) != BeginPtr(text))
+        return false;
+    if (prog_->anchor_end() && EndPtr(context) != EndPtr(text))
+        return false;
+    anchored |= prog_->anchor_start();
+    if (prog_->anchor_end()) {
+        longest = true;
+        endmatch_ = true;
+    }
+
+    if (nsubmatch < 0) {
+        LOG(DFATAL) << "Bad args: nsubmatch=" << nsubmatch;
+        return false;
+    }
+
+    // Save search parameters.
+    ncapture_ = 2 * nsubmatch;
+    longest_ = longest;
+
+    if (nsubmatch == 0) {
+        // We need to maintain match[0], both to distinguish the
+        // longest match (if longest is true) and also to tell
+        // whether we've seen any matches at all.
+        ncapture_ = 2;
+    }
+
+    match_ = new const char*[ncapture_];
+    memset(match_, 0, ncapture_ * sizeof match_[0]);
+    matched_ = false;
+
+    // For debugging prints.
+    btext_ = context.data();
+    // For convenience.
+    etext_ = text.data() + text.size();
+
+    if (ExtraDebug)
+        fprintf(stderr, "NFA::Search %s (context: %s) anchored=%d longest=%d\n",
+            std::string(text).c_str(), std::string(context).c_str(), anchored, longest);
+
+    // Set up search.
+    Threadq* runq = &q0_;
+    Threadq* nextq = &q1_;
+    runq->clear();
+    nextq->clear();
+
+    // Loop over the text, stepping the machine.
+    for (const char* p = text.data();; p++) {
+        if (ExtraDebug) {
+            int c = 0;
+            if (p == btext_)
+                c = '^';
+            else if (p > etext_)
+                c = '$';
+            else if (p < etext_)
+                c = p[0] & 0xFF;
+
+            fprintf(stderr, "%c:", c);
+            for (Threadq::iterator i = runq->begin(); i != runq->end(); ++i) {
+                Thread* t = i->value();
+                if (t == NULL)
+                    continue;
+                fprintf(stderr, " %d%s", i->index(), FormatCapture(t->capture).c_str());
+            }
+            fprintf(stderr, "\n");
+        }
+
+        // This is a no-op the first time around the loop because runq is empty.
+        int id = Step(runq, nextq, p < etext_ ? p[0] & 0xFF : -1, context, p);
+        DCHECK_EQ(runq->size(), 0);
+        using std::swap;
+        swap(nextq, runq);
+        nextq->clear();
+        if (id != 0) {
+            // We're done: full match ahead.
+            p = etext_;
+            for (;;) {
+                Prog::Inst* ip = prog_->inst(id);
+                switch (ip->opcode()) {
+                default:
+                    LOG(DFATAL) << "Unexpected opcode in short circuit: " << ip->opcode();
+                    break;
+
+                case kInstCapture:
+                    if (ip->cap() < ncapture_)
+                        match_[ip->cap()] = p;
+                    id = ip->out();
+                    continue;
+
+                case kInstNop:
+                    id = ip->out();
+                    continue;
+
+                case kInstMatch:
+                    match_[1] = p;
+                    matched_ = true;
+                    break;
+                }
+                break;
+            }
+            break;
+        }
+
+        if (p > etext_)
+            break;
+
+        // Start a new thread if there have not been any matches.
+        // (No point in starting a new thread if there have been
+        // matches, since it would be to the right of the match
+        // we already found.)
+        if (!matched_ && (!anchored || p == text.data())) {
+            // Try to use prefix accel (e.g. memchr) to skip ahead.
+            // The search must be unanchored and there must be zero
+            // possible matches already.
+            if (!anchored && runq->size() == 0 && p < etext_ && prog_->can_prefix_accel()) {
+                p = reinterpret_cast<const char*>(prog_->PrefixAccel(p, etext_ - p));
+                if (p == NULL)
+                    p = etext_;
+            }
+
+            Thread* t = AllocThread();
+            CopyCapture(t->capture, match_);
+            t->capture[0] = p;
+            AddToThreadq(runq, start_, p < etext_ ? p[0] & 0xFF : -1, context, p, t);
+            Decref(t);
+        }
+
+        // If all the threads have died, stop early.
+        if (runq->size() == 0) {
+            if (ExtraDebug)
+                fprintf(stderr, "dead\n");
+            break;
+        }
+
+        // Avoid invoking undefined behavior (arithmetic on a null pointer)
+        // by simply not continuing the loop.
+        // This complements the special case in NFA::Step().
+        if (p == NULL) {
+            (void)Step(runq, nextq, -1, context, p);
+            DCHECK_EQ(runq->size(), 0);
+            using std::swap;
+            swap(nextq, runq);
+            nextq->clear();
+            break;
+        }
+    }
+
+    for (Threadq::iterator i = runq->begin(); i != runq->end(); ++i) {
+        if (i->value() != NULL)
+            Decref(i->value());
+    }
+
+    if (matched_) {
+        for (int i = 0; i < nsubmatch; i++)
+            submatch[i] =
+                StringPiece(match_[2 * i], static_cast<size_t>(match_[2 * i + 1] - match_[2 * i]));
+        if (ExtraDebug)
+            fprintf(stderr, "match (%td,%td)\n", match_[0] - btext_, match_[1] - btext_);
+        return true;
+    }
+    return false;
+}
+
+bool Prog::SearchNFA(const StringPiece& text, const StringPiece& context, Anchor anchor,
+    MatchKind kind, StringPiece* match, int nmatch) {
+    if (ExtraDebug)
+        Dump();
+
+    NFA nfa(this);
+    StringPiece sp;
+    if (kind == kFullMatch) {
+        anchor = kAnchored;
+        if (nmatch == 0) {
+            match = &sp;
+            nmatch = 1;
+        }
+    }
+    if (!nfa.Search(text, context, anchor == kAnchored, kind != kFirstMatch, match, nmatch))
+        return false;
+    if (kind == kFullMatch && EndPtr(match[0]) != EndPtr(text))
+        return false;
+    return true;
+}
+
+// For each instruction i in the program reachable from the start, compute the
+// number of instructions reachable from i by following only empty transitions
+// and record that count as fanout[i].
+//
+// fanout holds the results and is also the work queue for the outer iteration.
+// reachable holds the reached nodes for the inner iteration.
+void Prog::Fanout(SparseArray<int>* fanout) {
+    DCHECK_EQ(fanout->max_size(), size());
+    SparseSet reachable(size());
+    fanout->clear();
+    fanout->set_new(start(), 0);
+    for (SparseArray<int>::iterator i = fanout->begin(); i != fanout->end(); ++i) {
+        int* count = &i->value();
+        reachable.clear();
+        reachable.insert(i->index());
+        for (SparseSet::iterator j = reachable.begin(); j != reachable.end(); ++j) {
+            int id = *j;
+            Prog::Inst* ip = inst(id);
+            switch (ip->opcode()) {
+            default:
+                LOG(DFATAL) << "unhandled " << ip->opcode() << " in Prog::Fanout()";
+                break;
+
+            case kInstByteRange:
+                if (!ip->last())
+                    reachable.insert(id + 1);
+
+                (*count)++;
+                if (!fanout->has_index(ip->out())) {
+                    fanout->set_new(ip->out(), 0);
+                }
+                break;
+
+            case kInstAltMatch:
+                DCHECK(!ip->last());
+                reachable.insert(id + 1);
+                break;
+
+            case kInstCapture:
+            case kInstEmptyWidth:
+            case kInstNop:
+                if (!ip->last())
+                    reachable.insert(id + 1);
+
+                reachable.insert(ip->out());
+                break;
+
+            case kInstMatch:
+                if (!ip->last())
+                    reachable.insert(id + 1);
+                break;
+
+            case kInstFail:
+                break;
+            }
+        }
+    }
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/onepass.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/onepass.cpp
new file mode 100644
index 0000000000..7ae13833b2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/onepass.cpp
@@ -0,0 +1,571 @@
+// Copyright 2008 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Tested by search_test.cc.
+//
+// Prog::SearchOnePass is an efficient implementation of
+// regular expression search with submatch tracking for
+// what I call "one-pass regular expressions".  (An alternate
+// name might be "backtracking-free regular expressions".)
+//
+// One-pass regular expressions have the property that
+// at each input byte during an anchored match, there may be
+// multiple alternatives but only one can proceed for any
+// given input byte.
+//
+// For example, the regexp /x*yx*/ is one-pass: you read
+// x's until a y, then you read the y, then you keep reading x's.
+// At no point do you have to guess what to do or back up
+// and try a different guess.
+//
+// On the other hand, /x*x/ is not one-pass: when you're
+// looking at an input "x", it's not clear whether you should
+// use it to extend the x* or as the final x.
+//
+// More examples: /([^ ]*) (.*)/ is one-pass; /(.*) (.*)/ is not.
+// /(\d+)-(\d+)/ is one-pass; /(\d+).(\d+)/ is not.
+//
+// A simple intuition for identifying one-pass regular expressions
+// is that it's always immediately obvious when a repetition ends.
+// It must also be immediately obvious which branch of an | to take:
+//
+// /x(y|z)/ is one-pass, but /(xy|xz)/ is not.
+//
+// The NFA-based search in nfa.cc does some bookkeeping to
+// avoid the need for backtracking and its associated exponential blowup.
+// But if we have a one-pass regular expression, there is no
+// possibility of backtracking, so there is no need for the
+// extra bookkeeping.  Hence, this code.
+//
+// On a one-pass regular expression, the NFA code in nfa.cc
+// runs at about 1/20 of the backtracking-based PCRE speed.
+// In contrast, the code in this file runs at about the same
+// speed as PCRE.
+//
+// One-pass regular expressions get used a lot when RE is
+// used for parsing simple strings, so it pays off to
+// notice them and handle them efficiently.
+//
+// See also Anne Brüggemann-Klein and Derick Wood,
+// "One-unambiguous regular languages", Information and Computation 142(2).
+
+#include <stdint.h>
+#include <string.h>
+
+#include <algorithm>
+#include <map>
+#include <string>
+#include <vector>
+
+#include "logging.h"
+#include "pod_array.h"
+#include "prog.h"
+#include "sparse_set.h"
+#include "stringpiece.h"
+#include "strutil.h"
+#include "utf.h"
+#include "util.h"
+
+// Silence "zero-sized array in struct/union" warning for OneState::action.
+#ifdef _MSC_VER
+//#pragma warning(disable: 4200)
+#endif
+
+namespace lbug {
+namespace regex {
+
+// The key insight behind this implementation is that the
+// non-determinism in an NFA for a one-pass regular expression
+// is contained.  To explain what that means, first a
+// refresher about what regular expression programs look like
+// and how the usual NFA execution runs.
+//
+// In a regular expression program, only the kInstByteRange
+// instruction processes an input byte c and moves on to the
+// next byte in the string (it does so if c is in the given range).
+// The kInstByteRange instructions correspond to literal characters
+// and character classes in the regular expression.
+//
+// The kInstAlt instructions are used as wiring to connect the
+// kInstByteRange instructions together in interesting ways when
+// implementing | + and *.
+// The kInstAlt instruction forks execution, like a goto that
+// jumps to ip->out() and ip->out1() in parallel.  Each of the
+// resulting computation paths is called a thread.
+//
+// The other instructions -- kInstEmptyWidth, kInstMatch, kInstCapture --
+// are interesting in their own right but like kInstAlt they don't
+// advance the input pointer.  Only kInstByteRange does.
+//
+// The automaton execution in nfa.cc runs all the possible
+// threads of execution in lock-step over the input.  To process
+// a particular byte, each thread gets run until it either dies
+// or finds a kInstByteRange instruction matching the byte.
+// If the latter happens, the thread stops just past the
+// kInstByteRange instruction (at ip->out()) and waits for
+// the other threads to finish processing the input byte.
+// Then, once all the threads have processed that input byte,
+// the whole process repeats.  The kInstAlt state instruction
+// might create new threads during input processing, but no
+// matter what, all the threads stop after a kInstByteRange
+// and wait for the other threads to "catch up".
+// Running in lock step like this ensures that the NFA reads
+// the input string only once.
+//
+// Each thread maintains its own set of capture registers
+// (the string positions at which it executed the kInstCapture
+// instructions corresponding to capturing parentheses in the
+// regular expression).  Repeated copying of the capture registers
+// is the main performance bottleneck in the NFA implementation.
+//
+// A regular expression program is "one-pass" if, no matter what
+// the input string, there is only one thread that makes it
+// past a kInstByteRange instruction at each input byte.  This means
+// that there is in some sense only one active thread throughout
+// the execution.  Other threads might be created during the
+// processing of an input byte, but they are ephemeral: only one
+// thread is left to start processing the next input byte.
+// This is what I meant above when I said the non-determinism
+// was "contained".
+//
+// To execute a one-pass regular expression program, we can build
+// a DFA (no non-determinism) that has at most as many states as
+// the NFA (compare this to the possibly exponential number of states
+// in the general case).  Each state records, for each possible
+// input byte, the next state along with the conditions required
+// before entering that state -- empty-width flags that must be true
+// and capture operations that must be performed.  It also records
+// whether a set of conditions required to finish a match at that
+// point in the input rather than process the next byte.
+
+// A state in the one-pass NFA - just an array of actions indexed
+// by the bytemap_[] of the next input byte.  (The bytemap
+// maps next input bytes into equivalence classes, to reduce
+// the memory footprint.)
+struct OneState {
+    uint32_t matchcond; // conditions to match right now.
+    uint32_t action[1];
+};
+
+// The uint32_t conditions in the action are a combination of
+// condition and capture bits and the next state.  The bottom 16 bits
+// are the condition and capture bits, and the top 16 are the index of
+// the next state.
+//
+// Bits 0-5 are the empty-width flags from prog.h.
+// Bit 6 is kMatchWins, which means the match takes
+// priority over moving to next in a first-match search.
+// The remaining bits mark capture registers that should
+// be set to the current input position.  The capture bits
+// start at index 2, since the search loop can take care of
+// cap[0], cap[1] (the overall match position).
+// That means we can handle up to 5 capturing parens: $1 through $4, plus $0.
+// No input position can satisfy both kEmptyWordBoundary
+// and kEmptyNonWordBoundary, so we can use that as a sentinel
+// instead of needing an extra bit.
+
+static const int kIndexShift = 16; // number of bits below index
+static const int kEmptyShift = 6;  // number of empty flags in prog.h
+static const int kRealCapShift = kEmptyShift + 1;
+static const int kRealMaxCap = (kIndexShift - kRealCapShift) / 2 * 2;
+
+// Parameters used to skip over cap[0], cap[1].
+static const int kCapShift = kRealCapShift - 2;
+static const int kMaxCap = kRealMaxCap + 2;
+
+static const uint32_t kMatchWins = 1 << kEmptyShift;
+static const uint32_t kCapMask = ((1 << kRealMaxCap) - 1) << kRealCapShift;
+
+static const uint32_t kImpossible = kEmptyWordBoundary | kEmptyNonWordBoundary;
+
+// Check, at compile time, that prog.h agrees with math above.
+// This function is never called.
+void OnePass_Checks() {
+    static_assert(
+        (1 << kEmptyShift) - 1 == kEmptyAllFlags, "kEmptyShift disagrees with kEmptyAllFlags");
+    // kMaxCap counts pointers, kMaxOnePassCapture counts pairs.
+    static_assert(
+        kMaxCap == Prog::kMaxOnePassCapture * 2, "kMaxCap disagrees with kMaxOnePassCapture");
+}
+
+static bool Satisfy(uint32_t cond, const StringPiece& context, const char* p) {
+    uint32_t satisfied = Prog::EmptyFlags(context, p);
+    if (cond & kEmptyAllFlags & ~satisfied)
+        return false;
+    return true;
+}
+
+// Apply the capture bits in cond, saving p to the appropriate
+// locations in cap[].
+static void ApplyCaptures(uint32_t cond, const char* p, const char** cap, int ncap) {
+    for (int i = 2; i < ncap; i++)
+        if (cond & (1 << kCapShift << i))
+            cap[i] = p;
+}
+
+// Computes the OneState* for the given nodeindex.
+static inline OneState* IndexToNode(uint8_t* nodes, int statesize, int nodeindex) {
+    return reinterpret_cast<OneState*>(nodes + statesize * nodeindex);
+}
+
+bool Prog::SearchOnePass(const StringPiece& text, const StringPiece& const_context, Anchor anchor,
+    MatchKind kind, StringPiece* match, int nmatch) {
+    if (anchor != kAnchored && kind != kFullMatch) {
+        LOG(DFATAL) << "Cannot use SearchOnePass for unanchored matches.";
+        return false;
+    }
+
+    // Make sure we have at least cap[1],
+    // because we use it to tell if we matched.
+    int ncap = 2 * nmatch;
+    if (ncap < 2)
+        ncap = 2;
+
+    const char* cap[kMaxCap];
+    for (int i = 0; i < ncap; i++)
+        cap[i] = NULL;
+
+    const char* matchcap[kMaxCap];
+    for (int i = 0; i < ncap; i++)
+        matchcap[i] = NULL;
+
+    StringPiece context = const_context;
+    if (context.begin() == NULL)
+        context = text;
+    if (anchor_start() && context.begin() != text.begin())
+        return false;
+    if (anchor_end() && context.end() != text.end())
+        return false;
+    if (anchor_end())
+        kind = kFullMatch;
+
+    uint8_t* nodes = onepass_nodes_.data();
+    int statesize = sizeof(OneState) + bytemap_range() * sizeof(uint32_t);
+    // start() is always mapped to the zeroth OneState.
+    OneState* state = IndexToNode(nodes, statesize, 0);
+    uint8_t* bytemap = bytemap_;
+    const char* bp = text.begin();
+    const char* ep = text.end();
+    const char* p;
+    bool matched = false;
+    matchcap[0] = bp;
+    cap[0] = bp;
+    uint32_t nextmatchcond = state->matchcond;
+    for (p = bp; p < ep; p++) {
+        int c = bytemap[*p & 0xFF];
+        uint32_t matchcond = nextmatchcond;
+        uint32_t cond = state->action[c];
+
+        // Determine whether we can reach act->next.
+        // If so, advance state and nextmatchcond.
+        if ((cond & kEmptyAllFlags) == 0 || Satisfy(cond, context, p)) {
+            uint32_t nextindex = cond >> kIndexShift;
+            state = IndexToNode(nodes, statesize, nextindex);
+            nextmatchcond = state->matchcond;
+        } else {
+            state = NULL;
+            nextmatchcond = kImpossible;
+        }
+
+        // This code section is carefully tuned.
+        // The goto sequence is about 10% faster than the
+        // obvious rewrite as a large if statement in the
+        // ASCIIMatchRE2 and DotMatchRE2 benchmarks.
+
+        // Saving the match capture registers is expensive.
+        // Is this intermediate match worth thinking about?
+
+        // Not if we want a full match.
+        if (kind == kFullMatch)
+            goto skipmatch;
+
+        // Not if it's impossible.
+        if (matchcond == kImpossible)
+            goto skipmatch;
+
+        // Not if the possible match is beaten by the certain
+        // match at the next byte.  When this test is useless
+        // (e.g., HTTPPartialMatchRE2) it slows the loop by
+        // about 10%, but when it avoids work (e.g., DotMatchRE2),
+        // it cuts the loop execution by about 45%.
+        if ((cond & kMatchWins) == 0 && (nextmatchcond & kEmptyAllFlags) == 0)
+            goto skipmatch;
+
+        // Finally, the match conditions must be satisfied.
+        if ((matchcond & kEmptyAllFlags) == 0 || Satisfy(matchcond, context, p)) {
+            for (int i = 2; i < 2 * nmatch; i++)
+                matchcap[i] = cap[i];
+            if (nmatch > 1 && (matchcond & kCapMask))
+                ApplyCaptures(matchcond, p, matchcap, ncap);
+            matchcap[1] = p;
+            matched = true;
+
+            // If we're in longest match mode, we have to keep
+            // going and see if we find a longer match.
+            // In first match mode, we can stop if the match
+            // takes priority over the next state for this input byte.
+            // That bit is per-input byte and thus in cond, not matchcond.
+            if (kind == kFirstMatch && (cond & kMatchWins))
+                goto done;
+        }
+
+    skipmatch:
+        if (state == NULL)
+            goto done;
+        if ((cond & kCapMask) && nmatch > 1)
+            ApplyCaptures(cond, p, cap, ncap);
+    }
+
+    // Look for match at end of input.
+    {
+        uint32_t matchcond = state->matchcond;
+        if (matchcond != kImpossible &&
+            ((matchcond & kEmptyAllFlags) == 0 || Satisfy(matchcond, context, p))) {
+            if (nmatch > 1 && (matchcond & kCapMask))
+                ApplyCaptures(matchcond, p, cap, ncap);
+            for (int i = 2; i < ncap; i++)
+                matchcap[i] = cap[i];
+            matchcap[1] = p;
+            matched = true;
+        }
+    }
+
+done:
+    if (!matched)
+        return false;
+    for (int i = 0; i < nmatch; i++)
+        match[i] = StringPiece(
+            matchcap[2 * i], static_cast<size_t>(matchcap[2 * i + 1] - matchcap[2 * i]));
+    return true;
+}
+
+// Analysis to determine whether a given regexp program is one-pass.
+
+// If ip is not on workq, adds ip to work queue and returns true.
+// If ip is already on work queue, does nothing and returns false.
+// If ip is NULL, does nothing and returns true (pretends to add it).
+typedef SparseSet Instq;
+static bool AddQ(Instq* q, int id) {
+    if (id == 0)
+        return true;
+    if (q->contains(id))
+        return false;
+    q->insert(id);
+    return true;
+}
+
+struct InstCond {
+    int id;
+    uint32_t cond;
+};
+
+// Returns whether this is a one-pass program; that is,
+// returns whether it is safe to use SearchOnePass on this program.
+// These conditions must be true for any instruction ip:
+//
+//   (1) for any other Inst nip, there is at most one input-free
+//       path from ip to nip.
+//   (2) there is at most one kInstByte instruction reachable from
+//       ip that matches any particular byte c.
+//   (3) there is at most one input-free path from ip to a kInstMatch
+//       instruction.
+//
+// This is actually just a conservative approximation: it might
+// return false when the answer is true, when kInstEmptyWidth
+// instructions are involved.
+// Constructs and saves corresponding one-pass NFA on success.
+bool Prog::IsOnePass() {
+    if (did_onepass_)
+        return onepass_nodes_.data() != NULL;
+    did_onepass_ = true;
+
+    if (start() == 0) // no match
+        return false;
+
+    // Steal memory for the one-pass NFA from the overall DFA budget.
+    // Willing to use at most 1/4 of the DFA budget (heuristic).
+    // Limit max node count to 65000 as a conservative estimate to
+    // avoid overflowing 16-bit node index in encoding.
+    int maxnodes = 2 + inst_count(kInstByteRange);
+    int statesize = sizeof(OneState) + bytemap_range() * sizeof(uint32_t);
+    if (maxnodes >= 65000 || dfa_mem_ / 4 / statesize < maxnodes)
+        return false;
+
+    // Flood the graph starting at the start state, and check
+    // that in each reachable state, each possible byte leads
+    // to a unique next state.
+    int stacksize = inst_count(kInstCapture) + inst_count(kInstEmptyWidth) + inst_count(kInstNop) +
+                    1; // + 1 for start inst
+    PODArray<InstCond> stack(stacksize);
+
+    int size = this->size();
+    PODArray<int> nodebyid(size); // indexed by ip
+    memset(nodebyid.data(), 0xFF, size * sizeof nodebyid[0]);
+
+    // Originally, nodes was a uint8_t[maxnodes*statesize], but that was
+    // unnecessarily optimistic: why allocate a large amount of memory
+    // upfront for a large program when it is unlikely to be one-pass?
+    std::vector<uint8_t> nodes;
+
+    Instq tovisit(size), workq(size);
+    AddQ(&tovisit, start());
+    nodebyid[start()] = 0;
+    int nalloc = 1;
+    nodes.insert(nodes.end(), statesize, 0);
+    for (Instq::iterator it = tovisit.begin(); it != tovisit.end(); ++it) {
+        int id = *it;
+        int nodeindex = nodebyid[id];
+        OneState* node = IndexToNode(nodes.data(), statesize, nodeindex);
+
+        // Flood graph using manual stack, filling in actions as found.
+        // Default is none.
+        for (int b = 0; b < bytemap_range_; b++)
+            node->action[b] = kImpossible;
+        node->matchcond = kImpossible;
+
+        workq.clear();
+        bool matched = false;
+        int nstack = 0;
+        stack[nstack].id = id;
+        stack[nstack++].cond = 0;
+        while (nstack > 0) {
+            int id = stack[--nstack].id;
+            uint32_t cond = stack[nstack].cond;
+
+        Loop:
+            Prog::Inst* ip = inst(id);
+            switch (ip->opcode()) {
+            default:
+                LOG(DFATAL) << "unhandled opcode: " << ip->opcode();
+                break;
+
+            case kInstAltMatch:
+                // TODO(rsc): Ignoring kInstAltMatch optimization.
+                // Should implement it in this engine, but it's subtle.
+                DCHECK(!ip->last());
+                // If already on work queue, (1) is violated: bail out.
+                if (!AddQ(&workq, id + 1))
+                    goto fail;
+                id = id + 1;
+                goto Loop;
+
+            case kInstByteRange: {
+                int nextindex = nodebyid[ip->out()];
+                if (nextindex == -1) {
+                    if (nalloc >= maxnodes) {
+                        goto fail;
+                    }
+                    nextindex = nalloc;
+                    AddQ(&tovisit, ip->out());
+                    nodebyid[ip->out()] = nalloc;
+                    nalloc++;
+                    nodes.insert(nodes.end(), statesize, 0);
+                    // Update node because it might have been invalidated.
+                    node = IndexToNode(nodes.data(), statesize, nodeindex);
+                }
+                for (int c = ip->lo(); c <= ip->hi(); c++) {
+                    int b = bytemap_[c];
+                    // Skip any bytes immediately after c that are also in b.
+                    while (c < 256 - 1 && bytemap_[c + 1] == b)
+                        c++;
+                    uint32_t act = node->action[b];
+                    uint32_t newact = (nextindex << kIndexShift) | cond;
+                    if (matched)
+                        newact |= kMatchWins;
+                    if ((act & kImpossible) == kImpossible) {
+                        node->action[b] = newact;
+                    } else if (act != newact) {
+                        goto fail;
+                    }
+                }
+                if (ip->foldcase()) {
+                    Rune lo = std::max<Rune>(ip->lo(), 'a') + 'A' - 'a';
+                    Rune hi = std::min<Rune>(ip->hi(), 'z') + 'A' - 'a';
+                    for (int c = lo; c <= hi; c++) {
+                        int b = bytemap_[c];
+                        // Skip any bytes immediately after c that are also in b.
+                        while (c < 256 - 1 && bytemap_[c + 1] == b)
+                            c++;
+                        uint32_t act = node->action[b];
+                        uint32_t newact = (nextindex << kIndexShift) | cond;
+                        if (matched)
+                            newact |= kMatchWins;
+                        if ((act & kImpossible) == kImpossible) {
+                            node->action[b] = newact;
+                        } else if (act != newact) {
+                            goto fail;
+                        }
+                    }
+                }
+
+                if (ip->last())
+                    break;
+                // If already on work queue, (1) is violated: bail out.
+                if (!AddQ(&workq, id + 1))
+                    goto fail;
+                id = id + 1;
+                goto Loop;
+            }
+
+            case kInstCapture:
+            case kInstEmptyWidth:
+            case kInstNop:
+                if (!ip->last()) {
+                    // If already on work queue, (1) is violated: bail out.
+                    if (!AddQ(&workq, id + 1))
+                        goto fail;
+                    stack[nstack].id = id + 1;
+                    stack[nstack++].cond = cond;
+                }
+
+                if (ip->opcode() == kInstCapture && ip->cap() < kMaxCap)
+                    cond |= (1 << kCapShift) << ip->cap();
+                if (ip->opcode() == kInstEmptyWidth)
+                    cond |= ip->empty();
+
+                // kInstCapture and kInstNop always proceed to ip->out().
+                // kInstEmptyWidth only sometimes proceeds to ip->out(),
+                // but as a conservative approximation we assume it always does.
+                // We could be a little more precise by looking at what c
+                // is, but that seems like overkill.
+
+                // If already on work queue, (1) is violated: bail out.
+                if (!AddQ(&workq, ip->out())) {
+                    goto fail;
+                }
+                id = ip->out();
+                goto Loop;
+
+            case kInstMatch:
+                if (matched) {
+                    // (3) is violated
+                    goto fail;
+                }
+                matched = true;
+                node->matchcond = cond;
+
+                if (ip->last())
+                    break;
+                // If already on work queue, (1) is violated: bail out.
+                if (!AddQ(&workq, id + 1))
+                    goto fail;
+                id = id + 1;
+                goto Loop;
+
+            case kInstFail:
+                break;
+            }
+        }
+    }
+    dfa_mem_ -= nalloc * statesize;
+    onepass_nodes_ = PODArray<uint8_t>(nalloc * statesize);
+    memmove(onepass_nodes_.data(), nodes.data(), nalloc * statesize);
+    return true;
+
+fail:
+    return false;
+}
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/parse.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/parse.cpp
new file mode 100644
index 0000000000..d3d7098a89
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/parse.cpp
@@ -0,0 +1,2418 @@
+// Copyright 2006 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Regular expression parser.
+
+// The parser is a simple precedence-based parser with a
+// manual stack.  The parsing work is done by the methods
+// of the ParseState class.  The Regexp::Parse function is
+// essentially just a lexer that calls the ParseState method
+// for each token.
+
+// The parser recognizes POSIX extended regular expressions
+// excluding backreferences, collating elements, and collating
+// classes.  It also allows the empty string as a regular expression
+// and recognizes the Perl escape sequences \d, \s, \w, \D, \S, and \W.
+// See regexp.h for rationale.
+
+#include <ctype.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <string.h>
+
+#include <algorithm>
+#include <map>
+#include <string>
+#include <vector>
+
+#include "logging.h"
+#include "pod_array.h"
+#include "regexp.h"
+#include "stringpiece.h"
+#include "strutil.h"
+#include "unicode_casefold.h"
+#include "unicode_groups.h"
+#include "utf.h"
+#include "util.h"
+#include "walker-inl.h"
+
+#if defined(RE2_USE_ICU)
+#include "unicode/uniset.h"
+#include "unicode/unistr.h"
+#include "unicode/utypes.h"
+#endif
+
+namespace lbug {
+namespace regex {
+
+// Controls the maximum repeat count permitted by the parser.
+static int maximum_repeat_count = 1000;
+
+void Regexp::FUZZING_ONLY_set_maximum_repeat_count(int i) {
+    maximum_repeat_count = i;
+}
+
+// Regular expression parse state.
+// The list of parsed regexps so far is maintained as a vector of
+// Regexp pointers called the stack.  Left parenthesis and vertical
+// bar markers are also placed on the stack, as Regexps with
+// non-standard opcodes.
+// Scanning a left parenthesis causes the parser to push a left parenthesis
+// marker on the stack.
+// Scanning a vertical bar causes the parser to pop the stack until it finds a
+// vertical bar or left parenthesis marker (not popping the marker),
+// concatenate all the popped results, and push them back on
+// the stack (DoConcatenation).
+// Scanning a right parenthesis causes the parser to act as though it
+// has seen a vertical bar, which then leaves the top of the stack in the
+// form LeftParen regexp VerticalBar regexp VerticalBar ... regexp VerticalBar.
+// The parser pops all this off the stack and creates an alternation of the
+// regexps (DoAlternation).
+
+class Regexp::ParseState {
+public:
+    ParseState(ParseFlags flags, const StringPiece& whole_regexp, RegexpStatus* status);
+    ~ParseState();
+
+    ParseFlags flags() { return flags_; }
+    int rune_max() { return rune_max_; }
+
+    // Parse methods.  All public methods return a bool saying
+    // whether parsing should continue.  If a method returns
+    // false, it has set fields in *status_, and the parser
+    // should return NULL.
+
+    // Pushes the given regular expression onto the stack.
+    // Could check for too much memory used here.
+    bool PushRegexp(Regexp* re);
+
+    // Pushes the literal rune r onto the stack.
+    bool PushLiteral(Rune r);
+
+    // Pushes a regexp with the given op (and no args) onto the stack.
+    bool PushSimpleOp(RegexpOp op);
+
+    // Pushes a ^ onto the stack.
+    bool PushCaret();
+
+    // Pushes a \b (word == true) or \B (word == false) onto the stack.
+    bool PushWordBoundary(bool word);
+
+    // Pushes a $ onto the stack.
+    bool PushDollar();
+
+    // Pushes a . onto the stack
+    bool PushDot();
+
+    // Pushes a repeat operator regexp onto the stack.
+    // A valid argument for the operator must already be on the stack.
+    // s is the name of the operator, for use in error messages.
+    bool PushRepeatOp(RegexpOp op, const StringPiece& s, bool nongreedy);
+
+    // Pushes a repetition regexp onto the stack.
+    // A valid argument for the operator must already be on the stack.
+    bool PushRepetition(int min, int max, const StringPiece& s, bool nongreedy);
+
+    // Checks whether a particular regexp op is a marker.
+    bool IsMarker(RegexpOp op);
+
+    // Processes a left parenthesis in the input.
+    // Pushes a marker onto the stack.
+    bool DoLeftParen(const StringPiece& name);
+    bool DoLeftParenNoCapture();
+
+    // Processes a vertical bar in the input.
+    bool DoVerticalBar();
+
+    // Processes a right parenthesis in the input.
+    bool DoRightParen();
+
+    // Processes the end of input, returning the final regexp.
+    Regexp* DoFinish();
+
+    // Finishes the regexp if necessary, preparing it for use
+    // in a more complicated expression.
+    // If it is a CharClassBuilder, converts into a CharClass.
+    Regexp* FinishRegexp(Regexp*);
+
+    // These routines don't manipulate the parse stack
+    // directly, but they do need to look at flags_.
+    // ParseCharClass also manipulates the internals of Regexp
+    // while creating *out_re.
+
+    // Parse a character class into *out_re.
+    // Removes parsed text from s.
+    bool ParseCharClass(StringPiece* s, Regexp** out_re, RegexpStatus* status);
+
+    // Parse a character class character into *rp.
+    // Removes parsed text from s.
+    bool ParseCCCharacter(
+        StringPiece* s, Rune* rp, const StringPiece& whole_class, RegexpStatus* status);
+
+    // Parse a character class range into rr.
+    // Removes parsed text from s.
+    bool ParseCCRange(
+        StringPiece* s, RuneRange* rr, const StringPiece& whole_class, RegexpStatus* status);
+
+    // Parse a Perl flag set or non-capturing group from s.
+    bool ParsePerlFlags(StringPiece* s);
+
+    // Finishes the current concatenation,
+    // collapsing it into a single regexp on the stack.
+    void DoConcatenation();
+
+    // Finishes the current alternation,
+    // collapsing it to a single regexp on the stack.
+    void DoAlternation();
+
+    // Generalized DoAlternation/DoConcatenation.
+    void DoCollapse(RegexpOp op);
+
+    // Maybe concatenate Literals into LiteralString.
+    bool MaybeConcatString(int r, ParseFlags flags);
+
+private:
+    ParseFlags flags_;
+    StringPiece whole_regexp_;
+    RegexpStatus* status_;
+    Regexp* stacktop_;
+    int ncap_;     // number of capturing parens seen
+    int rune_max_; // maximum char value for this encoding
+
+    ParseState(const ParseState&) = delete;
+    ParseState& operator=(const ParseState&) = delete;
+};
+
+// Pseudo-operators - only on parse stack.
+const RegexpOp kLeftParen = static_cast<RegexpOp>(kMaxRegexpOp + 1);
+const RegexpOp kVerticalBar = static_cast<RegexpOp>(kMaxRegexpOp + 2);
+
+Regexp::ParseState::ParseState(
+    ParseFlags flags, const StringPiece& whole_regexp, RegexpStatus* status)
+    : flags_(flags), whole_regexp_(whole_regexp), status_(status), stacktop_(NULL), ncap_(0) {
+    if (flags_ & Latin1)
+        rune_max_ = 0xFF;
+    else
+        rune_max_ = Runemax;
+}
+
+// Cleans up by freeing all the regexps on the stack.
+Regexp::ParseState::~ParseState() {
+    Regexp* next;
+    for (Regexp* re = stacktop_; re != NULL; re = next) {
+        next = re->down_;
+        re->down_ = NULL;
+        if (re->op() == kLeftParen)
+            delete re->name_;
+        re->Decref();
+    }
+}
+
+// Finishes the regexp if necessary, preparing it for use in
+// a more complex expression.
+// If it is a CharClassBuilder, converts into a CharClass.
+Regexp* Regexp::ParseState::FinishRegexp(Regexp* re) {
+    if (re == NULL)
+        return NULL;
+    re->down_ = NULL;
+
+    if (re->op_ == kRegexpCharClass && re->ccb_ != NULL) {
+        CharClassBuilder* ccb = re->ccb_;
+        re->ccb_ = NULL;
+        re->cc_ = ccb->GetCharClass();
+        delete ccb;
+    }
+
+    return re;
+}
+
+// Pushes the given regular expression onto the stack.
+// Could check for too much memory used here.
+bool Regexp::ParseState::PushRegexp(Regexp* re) {
+    MaybeConcatString(-1, NoParseFlags);
+
+    // Special case: a character class of one character is just
+    // a literal.  This is a common idiom for escaping
+    // single characters (e.g., [.] instead of \.), and some
+    // analysis does better with fewer character classes.
+    // Similarly, [Aa] can be rewritten as a literal A with ASCII case folding.
+    if (re->op_ == kRegexpCharClass && re->ccb_ != NULL) {
+        re->ccb_->RemoveAbove(rune_max_);
+        if (re->ccb_->size() == 1) {
+            Rune r = re->ccb_->begin()->lo;
+            re->Decref();
+            re = new Regexp(kRegexpLiteral, flags_);
+            re->rune_ = r;
+        } else if (re->ccb_->size() == 2) {
+            Rune r = re->ccb_->begin()->lo;
+            if ('A' <= r && r <= 'Z' && re->ccb_->Contains(r + 'a' - 'A')) {
+                re->Decref();
+                re = new Regexp(kRegexpLiteral, flags_ | FoldCase);
+                re->rune_ = r + 'a' - 'A';
+            }
+        }
+    }
+
+    if (!IsMarker(re->op()))
+        re->simple_ = re->ComputeSimple();
+    re->down_ = stacktop_;
+    stacktop_ = re;
+    return true;
+}
+
+// Searches the case folding tables and returns the CaseFold* that contains r.
+// If there isn't one, returns the CaseFold* with smallest f->lo bigger than r.
+// If there isn't one, returns NULL.
+const CaseFold* LookupCaseFold(const CaseFold* f, int n, Rune r) {
+    const CaseFold* ef = f + n;
+
+    // Binary search for entry containing r.
+    while (n > 0) {
+        int m = n / 2;
+        if (f[m].lo <= r && r <= f[m].hi)
+            return &f[m];
+        if (r < f[m].lo) {
+            n = m;
+        } else {
+            f += m + 1;
+            n -= m + 1;
+        }
+    }
+
+    // There is no entry that contains r, but f points
+    // where it would have been.  Unless f points at
+    // the end of the array, it points at the next entry
+    // after r.
+    if (f < ef)
+        return f;
+
+    // No entry contains r; no entry contains runes > r.
+    return NULL;
+}
+
+// Returns the result of applying the fold f to the rune r.
+Rune ApplyFold(const CaseFold* f, Rune r) {
+    switch (f->delta) {
+    default:
+        return r + f->delta;
+
+    case EvenOddSkip: // even <-> odd but only applies to every other
+        if ((r - f->lo) % 2)
+            return r;
+        FALLTHROUGH_INTENDED;
+    case EvenOdd: // even <-> odd
+        if (r % 2 == 0)
+            return r + 1;
+        return r - 1;
+
+    case OddEvenSkip: // odd <-> even but only applies to every other
+        if ((r - f->lo) % 2)
+            return r;
+        FALLTHROUGH_INTENDED;
+    case OddEven: // odd <-> even
+        if (r % 2 == 1)
+            return r + 1;
+        return r - 1;
+    }
+}
+
+// Returns the next Rune in r's folding cycle (see unicode_casefold.h).
+// Examples:
+//   CycleFoldRune('A') = 'a'
+//   CycleFoldRune('a') = 'A'
+//
+//   CycleFoldRune('K') = 'k'
+//   CycleFoldRune('k') = 0x212A (Kelvin)
+//   CycleFoldRune(0x212A) = 'K'
+//
+//   CycleFoldRune('?') = '?'
+Rune CycleFoldRune(Rune r) {
+    const CaseFold* f = LookupCaseFold(unicode_casefold, num_unicode_casefold, r);
+    if (f == NULL || r < f->lo)
+        return r;
+    return ApplyFold(f, r);
+}
+
+// Add lo-hi to the class, along with their fold-equivalent characters.
+// If lo-hi is already in the class, assume that the fold-equivalent
+// chars are there too, so there's no work to do.
+static void AddFoldedRange(CharClassBuilder* cc, Rune lo, Rune hi, int depth) {
+    // AddFoldedRange calls itself recursively for each rune in the fold cycle.
+    // Most folding cycles are small: there aren't any bigger than four in the
+    // current Unicode tables.  make_unicode_casefold.py checks that
+    // the cycles are not too long, and we double-check here using depth.
+    if (depth > 10) {
+        LOG(DFATAL) << "AddFoldedRange recurses too much.";
+        return;
+    }
+
+    if (!cc->AddRange(lo, hi)) // lo-hi was already there? we're done
+        return;
+
+    while (lo <= hi) {
+        const CaseFold* f = LookupCaseFold(unicode_casefold, num_unicode_casefold, lo);
+        if (f == NULL) // lo has no fold, nor does anything above lo
+            break;
+        if (lo < f->lo) { // lo has no fold; next rune with a fold is f->lo
+            lo = f->lo;
+            continue;
+        }
+
+        // Add in the result of folding the range lo - f->hi
+        // and that range's fold, recursively.
+        Rune lo1 = lo;
+        Rune hi1 = std::min<Rune>(hi, f->hi);
+        switch (f->delta) {
+        default:
+            lo1 += f->delta;
+            hi1 += f->delta;
+            break;
+        case EvenOdd:
+            if (lo1 % 2 == 1)
+                lo1--;
+            if (hi1 % 2 == 0)
+                hi1++;
+            break;
+        case OddEven:
+            if (lo1 % 2 == 0)
+                lo1--;
+            if (hi1 % 2 == 1)
+                hi1++;
+            break;
+        }
+        AddFoldedRange(cc, lo1, hi1, depth + 1);
+
+        // Pick up where this fold left off.
+        lo = f->hi + 1;
+    }
+}
+
+// Pushes the literal rune r onto the stack.
+bool Regexp::ParseState::PushLiteral(Rune r) {
+    // Do case folding if needed.
+    if ((flags_ & FoldCase) && CycleFoldRune(r) != r) {
+        Regexp* re = new Regexp(kRegexpCharClass, flags_ & ~FoldCase);
+        re->ccb_ = new CharClassBuilder;
+        Rune r1 = r;
+        do {
+            if (!(flags_ & NeverNL) || r != '\n') {
+                re->ccb_->AddRange(r, r);
+            }
+            r = CycleFoldRune(r);
+        } while (r != r1);
+        return PushRegexp(re);
+    }
+
+    // Exclude newline if applicable.
+    if ((flags_ & NeverNL) && r == '\n')
+        return PushRegexp(new Regexp(kRegexpNoMatch, flags_));
+
+    // No fancy stuff worked.  Ordinary literal.
+    if (MaybeConcatString(r, flags_))
+        return true;
+
+    Regexp* re = new Regexp(kRegexpLiteral, flags_);
+    re->rune_ = r;
+    return PushRegexp(re);
+}
+
+// Pushes a ^ onto the stack.
+bool Regexp::ParseState::PushCaret() {
+    if (flags_ & OneLine) {
+        return PushSimpleOp(kRegexpBeginText);
+    }
+    return PushSimpleOp(kRegexpBeginLine);
+}
+
+// Pushes a \b or \B onto the stack.
+bool Regexp::ParseState::PushWordBoundary(bool word) {
+    if (word)
+        return PushSimpleOp(kRegexpWordBoundary);
+    return PushSimpleOp(kRegexpNoWordBoundary);
+}
+
+// Pushes a $ onto the stack.
+bool Regexp::ParseState::PushDollar() {
+    if (flags_ & OneLine) {
+        // Clumsy marker so that MimicsPCRE() can tell whether
+        // this kRegexpEndText was a $ and not a \z.
+        Regexp::ParseFlags oflags = flags_;
+        flags_ = flags_ | WasDollar;
+        bool ret = PushSimpleOp(kRegexpEndText);
+        flags_ = oflags;
+        return ret;
+    }
+    return PushSimpleOp(kRegexpEndLine);
+}
+
+// Pushes a . onto the stack.
+bool Regexp::ParseState::PushDot() {
+    if ((flags_ & DotNL) && !(flags_ & NeverNL))
+        return PushSimpleOp(kRegexpAnyChar);
+    // Rewrite . into [^\n]
+    Regexp* re = new Regexp(kRegexpCharClass, flags_ & ~FoldCase);
+    re->ccb_ = new CharClassBuilder;
+    re->ccb_->AddRange(0, '\n' - 1);
+    re->ccb_->AddRange('\n' + 1, rune_max_);
+    return PushRegexp(re);
+}
+
+// Pushes a regexp with the given op (and no args) onto the stack.
+bool Regexp::ParseState::PushSimpleOp(RegexpOp op) {
+    Regexp* re = new Regexp(op, flags_);
+    return PushRegexp(re);
+}
+
+// Pushes a repeat operator regexp onto the stack.
+// A valid argument for the operator must already be on the stack.
+// The char c is the name of the operator, for use in error messages.
+bool Regexp::ParseState::PushRepeatOp(RegexpOp op, const StringPiece& s, bool nongreedy) {
+    if (stacktop_ == NULL || IsMarker(stacktop_->op())) {
+        status_->set_code(kRegexpRepeatArgument);
+        status_->set_error_arg(s);
+        return false;
+    }
+    Regexp::ParseFlags fl = flags_;
+    if (nongreedy)
+        fl = fl ^ NonGreedy;
+
+    // Squash **, ++ and ??. Regexp::Star() et al. handle this too, but
+    // they're mostly for use during simplification, not during parsing.
+    if (op == stacktop_->op() && fl == stacktop_->parse_flags())
+        return true;
+
+    // Squash *+, *?, +*, +?, ?* and ?+. They all squash to *, so because
+    // op is a repeat, we just have to check that stacktop_->op() is too,
+    // then adjust stacktop_.
+    if ((stacktop_->op() == kRegexpStar || stacktop_->op() == kRegexpPlus ||
+            stacktop_->op() == kRegexpQuest) &&
+        fl == stacktop_->parse_flags()) {
+        stacktop_->op_ = kRegexpStar;
+        return true;
+    }
+
+    Regexp* re = new Regexp(op, fl);
+    re->AllocSub(1);
+    re->down_ = stacktop_->down_;
+    re->sub()[0] = FinishRegexp(stacktop_);
+    re->simple_ = re->ComputeSimple();
+    stacktop_ = re;
+    return true;
+}
+
+// RepetitionWalker reports whether the repetition regexp is valid.
+// Valid means that the combination of the top-level repetition
+// and any inner repetitions does not exceed n copies of the
+// innermost thing.
+// This rewalks the regexp tree and is called for every repetition,
+// so we have to worry about inducing quadratic behavior in the parser.
+// We avoid this by only using RepetitionWalker when min or max >= 2.
+// In that case the depth of any >= 2 nesting can only get to 9 without
+// triggering a parse error, so each subtree can only be rewalked 9 times.
+class RepetitionWalker : public Regexp::Walker<int> {
+public:
+    RepetitionWalker() {}
+    virtual int PreVisit(Regexp* re, int parent_arg, bool* stop);
+    virtual int PostVisit(
+        Regexp* re, int parent_arg, int pre_arg, int* child_args, int nchild_args);
+    virtual int ShortVisit(Regexp* re, int parent_arg);
+
+private:
+    RepetitionWalker(const RepetitionWalker&) = delete;
+    RepetitionWalker& operator=(const RepetitionWalker&) = delete;
+};
+
+int RepetitionWalker::PreVisit(Regexp* re, int parent_arg, bool* stop) {
+    int arg = parent_arg;
+    if (re->op() == kRegexpRepeat) {
+        int m = re->max();
+        if (m < 0) {
+            m = re->min();
+        }
+        if (m > 0) {
+            arg /= m;
+        }
+    }
+    return arg;
+}
+
+int RepetitionWalker::PostVisit(
+    Regexp* re, int parent_arg, int pre_arg, int* child_args, int nchild_args) {
+    int arg = pre_arg;
+    for (int i = 0; i < nchild_args; i++) {
+        if (child_args[i] < arg) {
+            arg = child_args[i];
+        }
+    }
+    return arg;
+}
+
+int RepetitionWalker::ShortVisit(Regexp* re, int parent_arg) {
+    // Should never be called: we use Walk(), not WalkExponential().
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+    LOG(DFATAL) << "RepetitionWalker::ShortVisit called";
+#endif
+    return 0;
+}
+
+// Pushes a repetition regexp onto the stack.
+// A valid argument for the operator must already be on the stack.
+bool Regexp::ParseState::PushRepetition(int min, int max, const StringPiece& s, bool nongreedy) {
+    if ((max != -1 && max < min) || min > maximum_repeat_count || max > maximum_repeat_count) {
+        status_->set_code(kRegexpRepeatSize);
+        status_->set_error_arg(s);
+        return false;
+    }
+    if (stacktop_ == NULL || IsMarker(stacktop_->op())) {
+        status_->set_code(kRegexpRepeatArgument);
+        status_->set_error_arg(s);
+        return false;
+    }
+    Regexp::ParseFlags fl = flags_;
+    if (nongreedy)
+        fl = fl ^ NonGreedy;
+    Regexp* re = new Regexp(kRegexpRepeat, fl);
+    re->min_ = min;
+    re->max_ = max;
+    re->AllocSub(1);
+    re->down_ = stacktop_->down_;
+    re->sub()[0] = FinishRegexp(stacktop_);
+    re->simple_ = re->ComputeSimple();
+    stacktop_ = re;
+    if (min >= 2 || max >= 2) {
+        RepetitionWalker w;
+        if (w.Walk(stacktop_, maximum_repeat_count) == 0) {
+            status_->set_code(kRegexpRepeatSize);
+            status_->set_error_arg(s);
+            return false;
+        }
+    }
+    return true;
+}
+
+// Checks whether a particular regexp op is a marker.
+bool Regexp::ParseState::IsMarker(RegexpOp op) {
+    return op >= kLeftParen;
+}
+
+// Processes a left parenthesis in the input.
+// Pushes a marker onto the stack.
+bool Regexp::ParseState::DoLeftParen(const StringPiece& name) {
+    Regexp* re = new Regexp(kLeftParen, flags_);
+    re->cap_ = ++ncap_;
+    if (name.data() != NULL)
+        re->name_ = new std::string(name);
+    return PushRegexp(re);
+}
+
+// Pushes a non-capturing marker onto the stack.
+bool Regexp::ParseState::DoLeftParenNoCapture() {
+    Regexp* re = new Regexp(kLeftParen, flags_);
+    re->cap_ = -1;
+    return PushRegexp(re);
+}
+
+// Processes a vertical bar in the input.
+bool Regexp::ParseState::DoVerticalBar() {
+    MaybeConcatString(-1, NoParseFlags);
+    DoConcatenation();
+
+    // Below the vertical bar is a list to alternate.
+    // Above the vertical bar is a list to concatenate.
+    // We just did the concatenation, so either swap
+    // the result below the vertical bar or push a new
+    // vertical bar on the stack.
+    Regexp* r1;
+    Regexp* r2;
+    if ((r1 = stacktop_) != NULL && (r2 = r1->down_) != NULL && r2->op() == kVerticalBar) {
+        Regexp* r3;
+        if ((r3 = r2->down_) != NULL &&
+            (r1->op() == kRegexpAnyChar || r3->op() == kRegexpAnyChar)) {
+            // AnyChar is above or below the vertical bar. Let it subsume
+            // the other when the other is Literal, CharClass or AnyChar.
+            if (r3->op() == kRegexpAnyChar &&
+                (r1->op() == kRegexpLiteral || r1->op() == kRegexpCharClass ||
+                    r1->op() == kRegexpAnyChar)) {
+                // Discard r1.
+                stacktop_ = r2;
+                r1->Decref();
+                return true;
+            }
+            if (r1->op() == kRegexpAnyChar &&
+                (r3->op() == kRegexpLiteral || r3->op() == kRegexpCharClass ||
+                    r3->op() == kRegexpAnyChar)) {
+                // Rearrange the stack and discard r3.
+                r1->down_ = r3->down_;
+                r2->down_ = r1;
+                stacktop_ = r2;
+                r3->Decref();
+                return true;
+            }
+        }
+        // Swap r1 below vertical bar (r2).
+        r1->down_ = r2->down_;
+        r2->down_ = r1;
+        stacktop_ = r2;
+        return true;
+    }
+    return PushSimpleOp(kVerticalBar);
+}
+
+// Processes a right parenthesis in the input.
+bool Regexp::ParseState::DoRightParen() {
+    // Finish the current concatenation and alternation.
+    DoAlternation();
+
+    // The stack should be: LeftParen regexp
+    // Remove the LeftParen, leaving the regexp,
+    // parenthesized.
+    Regexp* r1;
+    Regexp* r2;
+    if ((r1 = stacktop_) == NULL || (r2 = r1->down_) == NULL || r2->op() != kLeftParen) {
+        status_->set_code(kRegexpUnexpectedParen);
+        status_->set_error_arg(whole_regexp_);
+        return false;
+    }
+
+    // Pop off r1, r2.  Will Decref or reuse below.
+    stacktop_ = r2->down_;
+
+    // Restore flags from when paren opened.
+    Regexp* re = r2;
+    flags_ = re->parse_flags();
+
+    // Rewrite LeftParen as capture if needed.
+    if (re->cap_ > 0) {
+        re->op_ = kRegexpCapture;
+        // re->cap_ is already set
+        re->AllocSub(1);
+        re->sub()[0] = FinishRegexp(r1);
+        re->simple_ = re->ComputeSimple();
+    } else {
+        re->Decref();
+        re = r1;
+    }
+    return PushRegexp(re);
+}
+
+// Processes the end of input, returning the final regexp.
+Regexp* Regexp::ParseState::DoFinish() {
+    DoAlternation();
+    Regexp* re = stacktop_;
+    if (re != NULL && re->down_ != NULL) {
+        status_->set_code(kRegexpMissingParen);
+        status_->set_error_arg(whole_regexp_);
+        return NULL;
+    }
+    stacktop_ = NULL;
+    return FinishRegexp(re);
+}
+
+// Returns the leading regexp that re starts with.
+// The returned Regexp* points into a piece of re,
+// so it must not be used after the caller calls re->Decref().
+Regexp* Regexp::LeadingRegexp(Regexp* re) {
+    if (re->op() == kRegexpEmptyMatch)
+        return NULL;
+    if (re->op() == kRegexpConcat && re->nsub() >= 2) {
+        Regexp** sub = re->sub();
+        if (sub[0]->op() == kRegexpEmptyMatch)
+            return NULL;
+        return sub[0];
+    }
+    return re;
+}
+
+// Removes LeadingRegexp(re) from re and returns what's left.
+// Consumes the reference to re and may edit it in place.
+// If caller wants to hold on to LeadingRegexp(re),
+// must have already Incref'ed it.
+Regexp* Regexp::RemoveLeadingRegexp(Regexp* re) {
+    if (re->op() == kRegexpEmptyMatch)
+        return re;
+    if (re->op() == kRegexpConcat && re->nsub() >= 2) {
+        Regexp** sub = re->sub();
+        if (sub[0]->op() == kRegexpEmptyMatch)
+            return re;
+        sub[0]->Decref();
+        sub[0] = NULL;
+        if (re->nsub() == 2) {
+            // Collapse concatenation to single regexp.
+            Regexp* nre = sub[1];
+            sub[1] = NULL;
+            re->Decref();
+            return nre;
+        }
+        // 3 or more -> 2 or more.
+        re->nsub_--;
+        memmove(sub, sub + 1, re->nsub_ * sizeof sub[0]);
+        return re;
+    }
+    Regexp::ParseFlags pf = re->parse_flags();
+    re->Decref();
+    return new Regexp(kRegexpEmptyMatch, pf);
+}
+
+// Returns the leading string that re starts with.
+// The returned Rune* points into a piece of re,
+// so it must not be used after the caller calls re->Decref().
+Rune* Regexp::LeadingString(Regexp* re, int* nrune, Regexp::ParseFlags* flags) {
+    while (re->op() == kRegexpConcat && re->nsub() > 0)
+        re = re->sub()[0];
+
+    *flags = static_cast<Regexp::ParseFlags>(re->parse_flags_ & Regexp::FoldCase);
+
+    if (re->op() == kRegexpLiteral) {
+        *nrune = 1;
+        return &re->rune_;
+    }
+
+    if (re->op() == kRegexpLiteralString) {
+        *nrune = re->nrunes_;
+        return re->runes_;
+    }
+
+    *nrune = 0;
+    return NULL;
+}
+
+// Removes the first n leading runes from the beginning of re.
+// Edits re in place.
+void Regexp::RemoveLeadingString(Regexp* re, int n) {
+    // Chase down concats to find first string.
+    // For regexps generated by parser, nested concats are
+    // flattened except when doing so would overflow the 16-bit
+    // limit on the size of a concatenation, so we should never
+    // see more than two here.
+    Regexp* stk[4];
+    size_t d = 0;
+    while (re->op() == kRegexpConcat) {
+        if (d < arraysize(stk))
+            stk[d++] = re;
+        re = re->sub()[0];
+    }
+
+    // Remove leading string from re.
+    if (re->op() == kRegexpLiteral) {
+        re->rune_ = 0;
+        re->op_ = kRegexpEmptyMatch;
+    } else if (re->op() == kRegexpLiteralString) {
+        if (n >= re->nrunes_) {
+            delete[] re->runes_;
+            re->runes_ = NULL;
+            re->nrunes_ = 0;
+            re->op_ = kRegexpEmptyMatch;
+        } else if (n == re->nrunes_ - 1) {
+            Rune rune = re->runes_[re->nrunes_ - 1];
+            delete[] re->runes_;
+            re->runes_ = NULL;
+            re->nrunes_ = 0;
+            re->rune_ = rune;
+            re->op_ = kRegexpLiteral;
+        } else {
+            re->nrunes_ -= n;
+            memmove(re->runes_, re->runes_ + n, re->nrunes_ * sizeof re->runes_[0]);
+        }
+    }
+
+    // If re is now empty, concatenations might simplify too.
+    while (d > 0) {
+        re = stk[--d];
+        Regexp** sub = re->sub();
+        if (sub[0]->op() == kRegexpEmptyMatch) {
+            sub[0]->Decref();
+            sub[0] = NULL;
+            // Delete first element of concat.
+            switch (re->nsub()) {
+            case 0:
+            case 1:
+                // Impossible.
+                LOG(DFATAL) << "Concat of " << re->nsub();
+                re->submany_ = NULL;
+                re->op_ = kRegexpEmptyMatch;
+                break;
+
+            case 2: {
+                // Replace re with sub[1].
+                Regexp* old = sub[1];
+                sub[1] = NULL;
+                re->Swap(old);
+                old->Decref();
+                break;
+            }
+
+            default:
+                // Slide down.
+                re->nsub_--;
+                memmove(sub, sub + 1, re->nsub_ * sizeof sub[0]);
+                break;
+            }
+        }
+    }
+}
+
+// In the context of factoring alternations, a Splice is: a factored prefix or
+// merged character class computed by one iteration of one round of factoring;
+// the span of subexpressions of the alternation to be "spliced" (i.e. removed
+// and replaced); and, for a factored prefix, the number of suffixes after any
+// factoring that might have subsequently been performed on them. For a merged
+// character class, there are no suffixes, of course, so the field is ignored.
+struct Splice {
+    Splice(Regexp* prefix, Regexp** sub, int nsub)
+        : prefix(prefix), sub(sub), nsub(nsub), nsuffix(-1) {}
+
+    Regexp* prefix;
+    Regexp** sub;
+    int nsub;
+    int nsuffix;
+};
+
+// Named so because it is used to implement an explicit stack, a Frame is: the
+// span of subexpressions of the alternation to be factored; the current round
+// of factoring; any Splices computed; and, for a factored prefix, an iterator
+// to the next Splice to be factored (i.e. in another Frame) because suffixes.
+struct Frame {
+    Frame(Regexp** sub, int nsub) : sub(sub), nsub(nsub), round(0) {}
+
+    Regexp** sub;
+    int nsub;
+    int round;
+    std::vector<Splice> splices;
+    int spliceidx;
+};
+
+// Bundled into a class for friend access to Regexp without needing to declare
+// (or define) Splice in regexp.h.
+class FactorAlternationImpl {
+public:
+    static void Round1(
+        Regexp** sub, int nsub, Regexp::ParseFlags flags, std::vector<Splice>* splices);
+    static void Round2(
+        Regexp** sub, int nsub, Regexp::ParseFlags flags, std::vector<Splice>* splices);
+    static void Round3(
+        Regexp** sub, int nsub, Regexp::ParseFlags flags, std::vector<Splice>* splices);
+};
+
+// Factors common prefixes from alternation.
+// For example,
+//     ABC|ABD|AEF|BCX|BCY
+// simplifies to
+//     A(B(C|D)|EF)|BC(X|Y)
+// and thence to
+//     A(B[CD]|EF)|BC[XY]
+//
+// Rewrites sub to contain simplified list to alternate and returns
+// the new length of sub.  Adjusts reference counts accordingly
+// (incoming sub[i] decremented, outgoing sub[i] incremented).
+int Regexp::FactorAlternation(Regexp** sub, int nsub, ParseFlags flags) {
+    std::vector<Frame> stk;
+    stk.emplace_back(sub, nsub);
+
+    for (;;) {
+        auto& sub = stk.back().sub;
+        auto& nsub = stk.back().nsub;
+        auto& round = stk.back().round;
+        auto& splices = stk.back().splices;
+        auto& spliceidx = stk.back().spliceidx;
+
+        if (splices.empty()) {
+            // Advance to the next round of factoring. Note that this covers
+            // the initialised state: when splices is empty and round is 0.
+            round++;
+        } else if (spliceidx < static_cast<int>(splices.size())) {
+            // We have at least one more Splice to factor. Recurse logically.
+            stk.emplace_back(splices[spliceidx].sub, splices[spliceidx].nsub);
+            continue;
+        } else {
+            // We have no more Splices to factor. Apply them.
+            auto iter = splices.begin();
+            int out = 0;
+            for (int i = 0; i < nsub;) {
+                // Copy until we reach where the next Splice begins.
+                while (sub + i < iter->sub)
+                    sub[out++] = sub[i++];
+                switch (round) {
+                case 1:
+                case 2: {
+                    // Assemble the Splice prefix and the suffixes.
+                    Regexp* re[2];
+                    re[0] = iter->prefix;
+                    re[1] = Regexp::AlternateNoFactor(iter->sub, iter->nsuffix, flags);
+                    sub[out++] = Regexp::Concat(re, 2, flags);
+                    i += iter->nsub;
+                    break;
+                }
+                case 3:
+                    // Just use the Splice prefix.
+                    sub[out++] = iter->prefix;
+                    i += iter->nsub;
+                    break;
+                default:
+                    LOG(DFATAL) << "unknown round: " << round;
+                    break;
+                }
+                // If we are done, copy until the end of sub.
+                if (++iter == splices.end()) {
+                    while (i < nsub)
+                        sub[out++] = sub[i++];
+                }
+            }
+            splices.clear();
+            nsub = out;
+            // Advance to the next round of factoring.
+            round++;
+        }
+
+        switch (round) {
+        case 1:
+            FactorAlternationImpl::Round1(sub, nsub, flags, &splices);
+            break;
+        case 2:
+            FactorAlternationImpl::Round2(sub, nsub, flags, &splices);
+            break;
+        case 3:
+            FactorAlternationImpl::Round3(sub, nsub, flags, &splices);
+            break;
+        case 4:
+            if (stk.size() == 1) {
+                // We are at the top of the stack. Just return.
+                return nsub;
+            } else {
+                // Pop the stack and set the number of suffixes.
+                // (Note that references will be invalidated!)
+                int nsuffix = nsub;
+                stk.pop_back();
+                stk.back().splices[stk.back().spliceidx].nsuffix = nsuffix;
+                ++stk.back().spliceidx;
+                continue;
+            }
+        default:
+            LOG(DFATAL) << "unknown round: " << round;
+            break;
+        }
+
+        // Set spliceidx depending on whether we have Splices to factor.
+        if (splices.empty() || round == 3) {
+            spliceidx = static_cast<int>(splices.size());
+        } else {
+            spliceidx = 0;
+        }
+    }
+}
+
+void FactorAlternationImpl::Round1(
+    Regexp** sub, int nsub, Regexp::ParseFlags flags, std::vector<Splice>* splices) {
+    // Round 1: Factor out common literal prefixes.
+    int start = 0;
+    Rune* rune = NULL;
+    int nrune = 0;
+    Regexp::ParseFlags runeflags = Regexp::NoParseFlags;
+    for (int i = 0; i <= nsub; i++) {
+        // Invariant: sub[start:i] consists of regexps that all
+        // begin with rune[0:nrune].
+        Rune* rune_i = NULL;
+        int nrune_i = 0;
+        Regexp::ParseFlags runeflags_i = Regexp::NoParseFlags;
+        if (i < nsub) {
+            rune_i = Regexp::LeadingString(sub[i], &nrune_i, &runeflags_i);
+            if (runeflags_i == runeflags) {
+                int same = 0;
+                while (same < nrune && same < nrune_i && rune[same] == rune_i[same])
+                    same++;
+                if (same > 0) {
+                    // Matches at least one rune in current range.  Keep going around.
+                    nrune = same;
+                    continue;
+                }
+            }
+        }
+
+        // Found end of a run with common leading literal string:
+        // sub[start:i] all begin with rune[0:nrune],
+        // but sub[i] does not even begin with rune[0].
+        if (i == start) {
+            // Nothing to do - first iteration.
+        } else if (i == start + 1) {
+            // Just one: don't bother factoring.
+        } else {
+            Regexp* prefix = Regexp::LiteralString(rune, nrune, runeflags);
+            for (int j = start; j < i; j++)
+                Regexp::RemoveLeadingString(sub[j], nrune);
+            splices->emplace_back(prefix, sub + start, i - start);
+        }
+
+        // Prepare for next iteration (if there is one).
+        if (i < nsub) {
+            start = i;
+            rune = rune_i;
+            nrune = nrune_i;
+            runeflags = runeflags_i;
+        }
+    }
+}
+
+void FactorAlternationImpl::Round2(
+    Regexp** sub, int nsub, Regexp::ParseFlags flags, std::vector<Splice>* splices) {
+    // Round 2: Factor out common simple prefixes,
+    // just the first piece of each concatenation.
+    // This will be good enough a lot of the time.
+    //
+    // Complex subexpressions (e.g. involving quantifiers)
+    // are not safe to factor because that collapses their
+    // distinct paths through the automaton, which affects
+    // correctness in some cases.
+    int start = 0;
+    Regexp* first = NULL;
+    for (int i = 0; i <= nsub; i++) {
+        // Invariant: sub[start:i] consists of regexps that all
+        // begin with first.
+        Regexp* first_i = NULL;
+        if (i < nsub) {
+            first_i = Regexp::LeadingRegexp(sub[i]);
+            if (first != NULL &&
+                // first must be an empty-width op
+                // OR a char class, any char or any byte
+                // OR a fixed repeat of a literal, char class, any char or any byte.
+                (first->op() == kRegexpBeginLine || first->op() == kRegexpEndLine ||
+                    first->op() == kRegexpWordBoundary || first->op() == kRegexpNoWordBoundary ||
+                    first->op() == kRegexpBeginText || first->op() == kRegexpEndText ||
+                    first->op() == kRegexpCharClass || first->op() == kRegexpAnyChar ||
+                    first->op() == kRegexpAnyByte ||
+                    (first->op() == kRegexpRepeat && first->min() == first->max() &&
+                        (first->sub()[0]->op() == kRegexpLiteral ||
+                            first->sub()[0]->op() == kRegexpCharClass ||
+                            first->sub()[0]->op() == kRegexpAnyChar ||
+                            first->sub()[0]->op() == kRegexpAnyByte))) &&
+                Regexp::Equal(first, first_i))
+                continue;
+        }
+
+        // Found end of a run with common leading regexp:
+        // sub[start:i] all begin with first,
+        // but sub[i] does not.
+        if (i == start) {
+            // Nothing to do - first iteration.
+        } else if (i == start + 1) {
+            // Just one: don't bother factoring.
+        } else {
+            Regexp* prefix = first->Incref();
+            for (int j = start; j < i; j++)
+                sub[j] = Regexp::RemoveLeadingRegexp(sub[j]);
+            splices->emplace_back(prefix, sub + start, i - start);
+        }
+
+        // Prepare for next iteration (if there is one).
+        if (i < nsub) {
+            start = i;
+            first = first_i;
+        }
+    }
+}
+
+void FactorAlternationImpl::Round3(
+    Regexp** sub, int nsub, Regexp::ParseFlags flags, std::vector<Splice>* splices) {
+    // Round 3: Merge runs of literals and/or character classes.
+    int start = 0;
+    Regexp* first = NULL;
+    for (int i = 0; i <= nsub; i++) {
+        // Invariant: sub[start:i] consists of regexps that all
+        // are either literals (i.e. runes) or character classes.
+        Regexp* first_i = NULL;
+        if (i < nsub) {
+            first_i = sub[i];
+            if (first != NULL &&
+                (first->op() == kRegexpLiteral || first->op() == kRegexpCharClass) &&
+                (first_i->op() == kRegexpLiteral || first_i->op() == kRegexpCharClass))
+                continue;
+        }
+
+        // Found end of a run of Literal/CharClass:
+        // sub[start:i] all are either one or the other,
+        // but sub[i] is not.
+        if (i == start) {
+            // Nothing to do - first iteration.
+        } else if (i == start + 1) {
+            // Just one: don't bother factoring.
+        } else {
+            CharClassBuilder ccb;
+            for (int j = start; j < i; j++) {
+                Regexp* re = sub[j];
+                if (re->op() == kRegexpCharClass) {
+                    CharClass* cc = re->cc();
+                    for (CharClass::iterator it = cc->begin(); it != cc->end(); ++it)
+                        ccb.AddRange(it->lo, it->hi);
+                } else if (re->op() == kRegexpLiteral) {
+                    ccb.AddRangeFlags(re->rune(), re->rune(), re->parse_flags());
+                } else {
+                    LOG(DFATAL) << "RE2: unexpected op: " << re->op() << " " << re->ToString();
+                }
+                re->Decref();
+            }
+            Regexp* re = Regexp::NewCharClass(ccb.GetCharClass(), flags);
+            splices->emplace_back(re, sub + start, i - start);
+        }
+
+        // Prepare for next iteration (if there is one).
+        if (i < nsub) {
+            start = i;
+            first = first_i;
+        }
+    }
+}
+
+// Collapse the regexps on top of the stack, down to the
+// first marker, into a new op node (op == kRegexpAlternate
+// or op == kRegexpConcat).
+void Regexp::ParseState::DoCollapse(RegexpOp op) {
+    // Scan backward to marker, counting children of composite.
+    int n = 0;
+    Regexp* next = NULL;
+    Regexp* sub;
+    for (sub = stacktop_; sub != NULL && !IsMarker(sub->op()); sub = next) {
+        next = sub->down_;
+        if (sub->op_ == op)
+            n += sub->nsub_;
+        else
+            n++;
+    }
+
+    // If there's just one child, leave it alone.
+    // (Concat of one thing is that one thing; alternate of one thing is same.)
+    if (stacktop_ != NULL && stacktop_->down_ == next)
+        return;
+
+    // Construct op (alternation or concatenation), flattening op of op.
+    PODArray<Regexp*> subs(n);
+    next = NULL;
+    int i = n;
+    for (sub = stacktop_; sub != NULL && !IsMarker(sub->op()); sub = next) {
+        next = sub->down_;
+        if (sub->op_ == op) {
+            Regexp** sub_subs = sub->sub();
+            for (int k = sub->nsub_ - 1; k >= 0; k--)
+                subs[--i] = sub_subs[k]->Incref();
+            sub->Decref();
+        } else {
+            subs[--i] = FinishRegexp(sub);
+        }
+    }
+
+    Regexp* re = ConcatOrAlternate(op, subs.data(), n, flags_, true);
+    re->simple_ = re->ComputeSimple();
+    re->down_ = next;
+    stacktop_ = re;
+}
+
+// Finishes the current concatenation,
+// collapsing it into a single regexp on the stack.
+void Regexp::ParseState::DoConcatenation() {
+    Regexp* r1 = stacktop_;
+    if (r1 == NULL || IsMarker(r1->op())) {
+        // empty concatenation is special case
+        Regexp* re = new Regexp(kRegexpEmptyMatch, flags_);
+        PushRegexp(re);
+    }
+    DoCollapse(kRegexpConcat);
+}
+
+// Finishes the current alternation,
+// collapsing it to a single regexp on the stack.
+void Regexp::ParseState::DoAlternation() {
+    DoVerticalBar();
+    // Now stack top is kVerticalBar.
+    Regexp* r1 = stacktop_;
+    stacktop_ = r1->down_;
+    r1->Decref();
+    DoCollapse(kRegexpAlternate);
+}
+
+// Incremental conversion of concatenated literals into strings.
+// If top two elements on stack are both literal or string,
+// collapse into single string.
+// Don't walk down the stack -- the parser calls this frequently
+// enough that below the bottom two is known to be collapsed.
+// Only called when another regexp is about to be pushed
+// on the stack, so that the topmost literal is not being considered.
+// (Otherwise ab* would turn into (ab)*.)
+// If r >= 0, consider pushing a literal r on the stack.
+// Return whether that happened.
+bool Regexp::ParseState::MaybeConcatString(int r, ParseFlags flags) {
+    Regexp* re1;
+    Regexp* re2;
+    if ((re1 = stacktop_) == NULL || (re2 = re1->down_) == NULL)
+        return false;
+
+    if (re1->op_ != kRegexpLiteral && re1->op_ != kRegexpLiteralString)
+        return false;
+    if (re2->op_ != kRegexpLiteral && re2->op_ != kRegexpLiteralString)
+        return false;
+    if ((re1->parse_flags_ & FoldCase) != (re2->parse_flags_ & FoldCase))
+        return false;
+
+    if (re2->op_ == kRegexpLiteral) {
+        // convert into string
+        Rune rune = re2->rune_;
+        re2->op_ = kRegexpLiteralString;
+        re2->nrunes_ = 0;
+        re2->runes_ = NULL;
+        re2->AddRuneToString(rune);
+    }
+
+    // push re1 into re2.
+    if (re1->op_ == kRegexpLiteral) {
+        re2->AddRuneToString(re1->rune_);
+    } else {
+        for (int i = 0; i < re1->nrunes_; i++)
+            re2->AddRuneToString(re1->runes_[i]);
+        re1->nrunes_ = 0;
+        delete[] re1->runes_;
+        re1->runes_ = NULL;
+    }
+
+    // reuse re1 if possible
+    if (r >= 0) {
+        re1->op_ = kRegexpLiteral;
+        re1->rune_ = r;
+        re1->parse_flags_ = static_cast<uint16_t>(flags);
+        return true;
+    }
+
+    stacktop_ = re2;
+    re1->Decref();
+    return false;
+}
+
+// Lexing routines.
+
+// Parses a decimal integer, storing it in *np.
+// Sets *s to span the remainder of the string.
+static bool ParseInteger(StringPiece* s, int* np) {
+    if (s->empty() || !isdigit((*s)[0] & 0xFF))
+        return false;
+    // Disallow leading zeros.
+    if (s->size() >= 2 && (*s)[0] == '0' && isdigit((*s)[1] & 0xFF))
+        return false;
+    int n = 0;
+    int c;
+    while (!s->empty() && isdigit(c = (*s)[0] & 0xFF)) {
+        // Avoid overflow.
+        if (n >= 100000000)
+            return false;
+        n = n * 10 + c - '0';
+        s->remove_prefix(1); // digit
+    }
+    *np = n;
+    return true;
+}
+
+// Parses a repetition suffix like {1,2} or {2} or {2,}.
+// Sets *s to span the remainder of the string on success.
+// Sets *lo and *hi to the given range.
+// In the case of {2,}, the high number is unbounded;
+// sets *hi to -1 to signify this.
+// {,2} is NOT a valid suffix.
+// The Maybe in the name signifies that the regexp parse
+// doesn't fail even if ParseRepetition does, so the StringPiece
+// s must NOT be edited unless MaybeParseRepetition returns true.
+static bool MaybeParseRepetition(StringPiece* sp, int* lo, int* hi) {
+    StringPiece s = *sp;
+    if (s.empty() || s[0] != '{')
+        return false;
+    s.remove_prefix(1); // '{'
+    if (!ParseInteger(&s, lo))
+        return false;
+    if (s.empty())
+        return false;
+    if (s[0] == ',') {
+        s.remove_prefix(1); // ','
+        if (s.empty())
+            return false;
+        if (s[0] == '}') {
+            // {2,} means at least 2
+            *hi = -1;
+        } else {
+            // {2,4} means 2, 3, or 4.
+            if (!ParseInteger(&s, hi))
+                return false;
+        }
+    } else {
+        // {2} means exactly two
+        *hi = *lo;
+    }
+    if (s.empty() || s[0] != '}')
+        return false;
+    s.remove_prefix(1); // '}'
+    *sp = s;
+    return true;
+}
+
+// Removes the next Rune from the StringPiece and stores it in *r.
+// Returns number of bytes removed from sp.
+// Behaves as though there is a terminating NUL at the end of sp.
+// Argument order is backwards from usual Google style
+// but consistent with chartorune.
+static int StringPieceToRune(Rune* r, StringPiece* sp, RegexpStatus* status) {
+    // fullrune() takes int, not size_t. However, it just looks
+    // at the leading byte and treats any length >= 4 the same.
+    if (fullrune(sp->data(), static_cast<int>(std::min(size_t{4}, sp->size())))) {
+        int n = chartorune(r, sp->data());
+        // Some copies of chartorune have a bug that accepts
+        // encodings of values in (10FFFF, 1FFFFF] as valid.
+        // Those values break the character class algorithm,
+        // which assumes Runemax is the largest rune.
+        if (*r > Runemax) {
+            n = 1;
+            *r = Runeerror;
+        }
+        if (!(n == 1 && *r == Runeerror)) { // no decoding error
+            sp->remove_prefix(n);
+            return n;
+        }
+    }
+
+    if (status != NULL) {
+        status->set_code(kRegexpBadUTF8);
+        status->set_error_arg(StringPiece());
+    }
+    return -1;
+}
+
+// Returns whether name is valid UTF-8.
+// If not, sets status to kRegexpBadUTF8.
+static bool IsValidUTF8(const StringPiece& s, RegexpStatus* status) {
+    StringPiece t = s;
+    Rune r;
+    while (!t.empty()) {
+        if (StringPieceToRune(&r, &t, status) < 0)
+            return false;
+    }
+    return true;
+}
+
+// Is c a hex digit?
+static int IsHex(int c) {
+    return ('0' <= c && c <= '9') || ('A' <= c && c <= 'F') || ('a' <= c && c <= 'f');
+}
+
+// Convert hex digit to value.
+static int UnHex(int c) {
+    if ('0' <= c && c <= '9')
+        return c - '0';
+    if ('A' <= c && c <= 'F')
+        return c - 'A' + 10;
+    if ('a' <= c && c <= 'f')
+        return c - 'a' + 10;
+    LOG(DFATAL) << "Bad hex digit " << c;
+    return 0;
+}
+
+// Parse an escape sequence (e.g., \n, \{).
+// Sets *s to span the remainder of the string.
+// Sets *rp to the named character.
+static bool ParseEscape(StringPiece* s, Rune* rp, RegexpStatus* status, int rune_max) {
+    const char* begin = s->data();
+    if (s->empty() || (*s)[0] != '\\') {
+        // Should not happen - caller always checks.
+        status->set_code(kRegexpInternalError);
+        status->set_error_arg(StringPiece());
+        return false;
+    }
+    if (s->size() == 1) {
+        status->set_code(kRegexpTrailingBackslash);
+        status->set_error_arg(StringPiece());
+        return false;
+    }
+    Rune c, c1;
+    s->remove_prefix(1); // backslash
+    if (StringPieceToRune(&c, s, status) < 0)
+        return false;
+    int code;
+    switch (c) {
+    default:
+        if (c < Runeself && !isalpha(c) && !isdigit(c)) {
+            // Escaped non-word characters are always themselves.
+            // PCRE is not quite so rigorous: it accepts things like
+            // \q, but we don't.  We once rejected \_, but too many
+            // programs and people insist on using it, so allow \_.
+            *rp = c;
+            return true;
+        }
+        goto BadEscape;
+
+    // Octal escapes.
+    case '1':
+    case '2':
+    case '3':
+    case '4':
+    case '5':
+    case '6':
+    case '7':
+        // Single non-zero octal digit is a backreference; not supported.
+        if (s->empty() || (*s)[0] < '0' || (*s)[0] > '7')
+            goto BadEscape;
+        FALLTHROUGH_INTENDED;
+    case '0':
+        // consume up to three octal digits; already have one.
+        code = c - '0';
+        if (!s->empty() && '0' <= (c = (*s)[0]) && c <= '7') {
+            code = code * 8 + c - '0';
+            s->remove_prefix(1); // digit
+            if (!s->empty()) {
+                c = (*s)[0];
+                if ('0' <= c && c <= '7') {
+                    code = code * 8 + c - '0';
+                    s->remove_prefix(1); // digit
+                }
+            }
+        }
+        if (code > rune_max)
+            goto BadEscape;
+        *rp = code;
+        return true;
+
+    // Hexadecimal escapes
+    case 'x':
+        if (s->empty())
+            goto BadEscape;
+        if (StringPieceToRune(&c, s, status) < 0)
+            return false;
+        if (c == '{') {
+            // Any number of digits in braces.
+            // Update n as we consume the string, so that
+            // the whole thing gets shown in the error message.
+            // Perl accepts any text at all; it ignores all text
+            // after the first non-hex digit.  We require only hex digits,
+            // and at least one.
+            if (StringPieceToRune(&c, s, status) < 0)
+                return false;
+            int nhex = 0;
+            code = 0;
+            while (IsHex(c)) {
+                nhex++;
+                code = code * 16 + UnHex(c);
+                if (code > rune_max)
+                    goto BadEscape;
+                if (s->empty())
+                    goto BadEscape;
+                if (StringPieceToRune(&c, s, status) < 0)
+                    return false;
+            }
+            if (c != '}' || nhex == 0)
+                goto BadEscape;
+            *rp = code;
+            return true;
+        }
+        // Easy case: two hex digits.
+        if (s->empty())
+            goto BadEscape;
+        if (StringPieceToRune(&c1, s, status) < 0)
+            return false;
+        if (!IsHex(c) || !IsHex(c1))
+            goto BadEscape;
+        *rp = UnHex(c) * 16 + UnHex(c1);
+        return true;
+
+    // C escapes.
+    case 'n':
+        *rp = '\n';
+        return true;
+    case 'r':
+        *rp = '\r';
+        return true;
+    case 't':
+        *rp = '\t';
+        return true;
+
+    // Less common C escapes.
+    case 'a':
+        *rp = '\a';
+        return true;
+    case 'f':
+        *rp = '\f';
+        return true;
+    case 'v':
+        *rp = '\v';
+        return true;
+
+        // This code is disabled to avoid misparsing
+        // the Perl word-boundary \b as a backspace
+        // when in POSIX regexp mode.  Surprisingly,
+        // in Perl, \b means word-boundary but [\b]
+        // means backspace.  We don't support that:
+        // if you want a backspace embed a literal
+        // backspace character or use \x08.
+        //
+        // case 'b':
+        //   *rp = '\b';
+        //   return true;
+    }
+
+BadEscape:
+    // Unrecognized escape sequence.
+    status->set_code(kRegexpBadEscape);
+    status->set_error_arg(StringPiece(begin, static_cast<size_t>(s->data() - begin)));
+    return false;
+}
+
+// Add a range to the character class, but exclude newline if asked.
+// Also handle case folding.
+void CharClassBuilder::AddRangeFlags(Rune lo, Rune hi, Regexp::ParseFlags parse_flags) {
+
+    // Take out \n if the flags say so.
+    bool cutnl = !(parse_flags & Regexp::ClassNL) || (parse_flags & Regexp::NeverNL);
+    if (cutnl && lo <= '\n' && '\n' <= hi) {
+        if (lo < '\n')
+            AddRangeFlags(lo, '\n' - 1, parse_flags);
+        if (hi > '\n')
+            AddRangeFlags('\n' + 1, hi, parse_flags);
+        return;
+    }
+
+    // If folding case, add fold-equivalent characters too.
+    if (parse_flags & Regexp::FoldCase)
+        AddFoldedRange(this, lo, hi, 0);
+    else
+        AddRange(lo, hi);
+}
+
+// Look for a group with the given name.
+static const UGroup* LookupGroup(const StringPiece& name, const UGroup* groups, int ngroups) {
+    // Simple name lookup.
+    for (int i = 0; i < ngroups; i++)
+        if (StringPiece(groups[i].name) == name)
+            return &groups[i];
+    return NULL;
+}
+
+// Look for a POSIX group with the given name (e.g., "[:^alpha:]")
+static const UGroup* LookupPosixGroup(const StringPiece& name) {
+    return LookupGroup(name, posix_groups, num_posix_groups);
+}
+
+static const UGroup* LookupPerlGroup(const StringPiece& name) {
+    return LookupGroup(name, perl_groups, num_perl_groups);
+}
+
+#if !defined(RE2_USE_ICU)
+// Fake UGroup containing all Runes
+static URange16 any16[] = {{0, 65535}};
+static URange32 any32[] = {{65536, Runemax}};
+static UGroup anygroup = {"Any", +1, any16, 1, any32, 1};
+
+// Look for a Unicode group with the given name (e.g., "Han")
+static const UGroup* LookupUnicodeGroup(const StringPiece& name) {
+    // Special case: "Any" means any.
+    if (name == StringPiece("Any"))
+        return &anygroup;
+    return LookupGroup(name, unicode_groups, num_unicode_groups);
+}
+#endif
+
+// Add a UGroup or its negation to the character class.
+static void AddUGroup(
+    CharClassBuilder* cc, const UGroup* g, int sign, Regexp::ParseFlags parse_flags) {
+    if (sign == +1) {
+        for (int i = 0; i < g->nr16; i++) {
+            cc->AddRangeFlags(g->r16[i].lo, g->r16[i].hi, parse_flags);
+        }
+        for (int i = 0; i < g->nr32; i++) {
+            cc->AddRangeFlags(g->r32[i].lo, g->r32[i].hi, parse_flags);
+        }
+    } else {
+        if (parse_flags & Regexp::FoldCase) {
+            // Normally adding a case-folded group means
+            // adding all the extra fold-equivalent runes too.
+            // But if we're adding the negation of the group,
+            // we have to exclude all the runes that are fold-equivalent
+            // to what's already missing.  Too hard, so do in two steps.
+            CharClassBuilder ccb1;
+            AddUGroup(&ccb1, g, +1, parse_flags);
+            // If the flags say to take out \n, put it in, so that negating will take it out.
+            // Normally AddRangeFlags does this, but we're bypassing AddRangeFlags.
+            bool cutnl = !(parse_flags & Regexp::ClassNL) || (parse_flags & Regexp::NeverNL);
+            if (cutnl) {
+                ccb1.AddRange('\n', '\n');
+            }
+            ccb1.Negate();
+            cc->AddCharClass(&ccb1);
+            return;
+        }
+        int next = 0;
+        for (int i = 0; i < g->nr16; i++) {
+            if (next < g->r16[i].lo)
+                cc->AddRangeFlags(next, g->r16[i].lo - 1, parse_flags);
+            next = g->r16[i].hi + 1;
+        }
+        for (int i = 0; i < g->nr32; i++) {
+            if (next < g->r32[i].lo)
+                cc->AddRangeFlags(next, g->r32[i].lo - 1, parse_flags);
+            next = g->r32[i].hi + 1;
+        }
+        if (next <= Runemax)
+            cc->AddRangeFlags(next, Runemax, parse_flags);
+    }
+}
+
+// Maybe parse a Perl character class escape sequence.
+// Only recognizes the Perl character classes (\d \s \w \D \S \W),
+// not the Perl empty-string classes (\b \B \A \Z \z).
+// On success, sets *s to span the remainder of the string
+// and returns the corresponding UGroup.
+// The StringPiece must *NOT* be edited unless the call succeeds.
+const UGroup* MaybeParsePerlCCEscape(StringPiece* s, Regexp::ParseFlags parse_flags) {
+    if (!(parse_flags & Regexp::PerlClasses))
+        return NULL;
+    if (s->size() < 2 || (*s)[0] != '\\')
+        return NULL;
+    // Could use StringPieceToRune, but there aren't
+    // any non-ASCII Perl group names.
+    StringPiece name(s->data(), 2);
+    const UGroup* g = LookupPerlGroup(name);
+    if (g == NULL)
+        return NULL;
+    s->remove_prefix(name.size());
+    return g;
+}
+
+enum ParseStatus {
+    kParseOk,      // Did some parsing.
+    kParseError,   // Found an error.
+    kParseNothing, // Decided not to parse.
+};
+
+// Maybe parses a Unicode character group like \p{Han} or \P{Han}
+// (the latter is a negated group).
+ParseStatus ParseUnicodeGroup(
+    StringPiece* s, Regexp::ParseFlags parse_flags, CharClassBuilder* cc, RegexpStatus* status) {
+    // Decide whether to parse.
+    if (!(parse_flags & Regexp::UnicodeGroups))
+        return kParseNothing;
+    if (s->size() < 2 || (*s)[0] != '\\')
+        return kParseNothing;
+    Rune c = (*s)[1];
+    if (c != 'p' && c != 'P')
+        return kParseNothing;
+
+    // Committed to parse.  Results:
+    int sign = +1; // -1 = negated char class
+    if (c == 'P')
+        sign = -sign;
+    StringPiece seq = *s; // \p{Han} or \pL
+    StringPiece name;     // Han or L
+    s->remove_prefix(2);  // '\\', 'p'
+
+    if (!StringPieceToRune(&c, s, status))
+        return kParseError;
+    if (c != '{') {
+        // Name is the bit of string we just skipped over for c.
+        const char* p = seq.data() + 2;
+        name = StringPiece(p, static_cast<size_t>(s->data() - p));
+    } else {
+        // Name is in braces. Look for closing }
+        size_t end = s->find('}', 0);
+        if (end == StringPiece::npos) {
+            if (!IsValidUTF8(seq, status))
+                return kParseError;
+            status->set_code(kRegexpBadCharRange);
+            status->set_error_arg(seq);
+            return kParseError;
+        }
+        name = StringPiece(s->data(), end); // without '}'
+        s->remove_prefix(end + 1);          // with '}'
+        if (!IsValidUTF8(name, status))
+            return kParseError;
+    }
+
+    // Chop seq where s now begins.
+    seq = StringPiece(seq.data(), static_cast<size_t>(s->data() - seq.data()));
+
+    if (!name.empty() && name[0] == '^') {
+        sign = -sign;
+        name.remove_prefix(1); // '^'
+    }
+
+#if !defined(RE2_USE_ICU)
+    // Look up the group in the RE2 Unicode data.
+    const UGroup* g = LookupUnicodeGroup(name);
+    if (g == NULL) {
+        status->set_code(kRegexpBadCharRange);
+        status->set_error_arg(seq);
+        return kParseError;
+    }
+
+    AddUGroup(cc, g, sign, parse_flags);
+#else
+    // Look up the group in the ICU Unicode data. Because ICU provides full
+    // Unicode properties support, this could be more than a lookup by name.
+    ::icu::UnicodeString ustr =
+        ::icu::UnicodeString::fromUTF8(std::string("\\p{") + std::string(name) + std::string("}"));
+    UErrorCode uerr = U_ZERO_ERROR;
+    ::icu::UnicodeSet uset(ustr, uerr);
+    if (U_FAILURE(uerr)) {
+        status->set_code(kRegexpBadCharRange);
+        status->set_error_arg(seq);
+        return kParseError;
+    }
+
+    // Convert the UnicodeSet to a URange32 and UGroup that we can add.
+    int nr = uset.getRangeCount();
+    PODArray<URange32> r(nr);
+    for (int i = 0; i < nr; i++) {
+        r[i].lo = uset.getRangeStart(i);
+        r[i].hi = uset.getRangeEnd(i);
+    }
+    UGroup g = {"", +1, 0, 0, r.data(), nr};
+    AddUGroup(cc, &g, sign, parse_flags);
+#endif
+
+    return kParseOk;
+}
+
+// Parses a character class name like [:alnum:].
+// Sets *s to span the remainder of the string.
+// Adds the ranges corresponding to the class to ranges.
+static ParseStatus ParseCCName(
+    StringPiece* s, Regexp::ParseFlags parse_flags, CharClassBuilder* cc, RegexpStatus* status) {
+    // Check begins with [:
+    const char* p = s->data();
+    const char* ep = s->data() + s->size();
+    if (ep - p < 2 || p[0] != '[' || p[1] != ':')
+        return kParseNothing;
+
+    // Look for closing :].
+    const char* q;
+    for (q = p + 2; q <= ep - 2 && (*q != ':' || *(q + 1) != ']'); q++)
+        ;
+
+    // If no closing :], then ignore.
+    if (q > ep - 2)
+        return kParseNothing;
+
+    // Got it.  Check that it's valid.
+    q += 2;
+    StringPiece name(p, static_cast<size_t>(q - p));
+
+    const UGroup* g = LookupPosixGroup(name);
+    if (g == NULL) {
+        status->set_code(kRegexpBadCharRange);
+        status->set_error_arg(name);
+        return kParseError;
+    }
+
+    s->remove_prefix(name.size());
+    AddUGroup(cc, g, g->sign, parse_flags);
+    return kParseOk;
+}
+
+// Parses a character inside a character class.
+// There are fewer special characters here than in the rest of the regexp.
+// Sets *s to span the remainder of the string.
+// Sets *rp to the character.
+bool Regexp::ParseState::ParseCCCharacter(
+    StringPiece* s, Rune* rp, const StringPiece& whole_class, RegexpStatus* status) {
+    if (s->empty()) {
+        status->set_code(kRegexpMissingBracket);
+        status->set_error_arg(whole_class);
+        return false;
+    }
+
+    // Allow regular escape sequences even though
+    // many need not be escaped in this context.
+    if ((*s)[0] == '\\')
+        return ParseEscape(s, rp, status, rune_max_);
+
+    // Otherwise take the next rune.
+    return StringPieceToRune(rp, s, status) >= 0;
+}
+
+// Parses a character class character, or, if the character
+// is followed by a hyphen, parses a character class range.
+// For single characters, rr->lo == rr->hi.
+// Sets *s to span the remainder of the string.
+// Sets *rp to the character.
+bool Regexp::ParseState::ParseCCRange(
+    StringPiece* s, RuneRange* rr, const StringPiece& whole_class, RegexpStatus* status) {
+    StringPiece os = *s;
+    if (!ParseCCCharacter(s, &rr->lo, whole_class, status))
+        return false;
+    // [a-] means (a|-), so check for final ].
+    if (s->size() >= 2 && (*s)[0] == '-' && (*s)[1] != ']') {
+        s->remove_prefix(1); // '-'
+        if (!ParseCCCharacter(s, &rr->hi, whole_class, status))
+            return false;
+        if (rr->hi < rr->lo) {
+            status->set_code(kRegexpBadCharRange);
+            status->set_error_arg(
+                StringPiece(os.data(), static_cast<size_t>(s->data() - os.data())));
+            return false;
+        }
+    } else {
+        rr->hi = rr->lo;
+    }
+    return true;
+}
+
+// Parses a possibly-negated character class expression like [^abx-z[:digit:]].
+// Sets *s to span the remainder of the string.
+// Sets *out_re to the regexp for the class.
+bool Regexp::ParseState::ParseCharClass(StringPiece* s, Regexp** out_re, RegexpStatus* status) {
+    StringPiece whole_class = *s;
+    if (s->empty() || (*s)[0] != '[') {
+        // Caller checked this.
+        status->set_code(kRegexpInternalError);
+        status->set_error_arg(StringPiece());
+        return false;
+    }
+    bool negated = false;
+    Regexp* re = new Regexp(kRegexpCharClass, flags_ & ~FoldCase);
+    re->ccb_ = new CharClassBuilder;
+    s->remove_prefix(1); // '['
+    if (!s->empty() && (*s)[0] == '^') {
+        s->remove_prefix(1); // '^'
+        negated = true;
+        if (!(flags_ & ClassNL) || (flags_ & NeverNL)) {
+            // If NL can't match implicitly, then pretend
+            // negated classes include a leading \n.
+            re->ccb_->AddRange('\n', '\n');
+        }
+    }
+    bool first = true; // ] is okay as first char in class
+    while (!s->empty() && ((*s)[0] != ']' || first)) {
+        // - is only okay unescaped as first or last in class.
+        // Except that Perl allows - anywhere.
+        if ((*s)[0] == '-' && !first && !(flags_ & PerlX) && (s->size() == 1 || (*s)[1] != ']')) {
+            StringPiece t = *s;
+            t.remove_prefix(1); // '-'
+            Rune r;
+            int n = StringPieceToRune(&r, &t, status);
+            if (n < 0) {
+                re->Decref();
+                return false;
+            }
+            status->set_code(kRegexpBadCharRange);
+            status->set_error_arg(StringPiece(s->data(), 1 + n));
+            re->Decref();
+            return false;
+        }
+        first = false;
+
+        // Look for [:alnum:] etc.
+        if (s->size() > 2 && (*s)[0] == '[' && (*s)[1] == ':') {
+            switch (ParseCCName(s, flags_, re->ccb_, status)) {
+            case kParseOk:
+                continue;
+            case kParseError:
+                re->Decref();
+                return false;
+            case kParseNothing:
+                break;
+            }
+        }
+
+        // Look for Unicode character group like \p{Han}
+        if (s->size() > 2 && (*s)[0] == '\\' && ((*s)[1] == 'p' || (*s)[1] == 'P')) {
+            switch (ParseUnicodeGroup(s, flags_, re->ccb_, status)) {
+            case kParseOk:
+                continue;
+            case kParseError:
+                re->Decref();
+                return false;
+            case kParseNothing:
+                break;
+            }
+        }
+
+        // Look for Perl character class symbols (extension).
+        const UGroup* g = MaybeParsePerlCCEscape(s, flags_);
+        if (g != NULL) {
+            AddUGroup(re->ccb_, g, g->sign, flags_);
+            continue;
+        }
+
+        // Otherwise assume single character or simple range.
+        RuneRange rr;
+        if (!ParseCCRange(s, &rr, whole_class, status)) {
+            re->Decref();
+            return false;
+        }
+        // AddRangeFlags is usually called in response to a class like
+        // \p{Foo} or [[:foo:]]; for those, it filters \n out unless
+        // Regexp::ClassNL is set.  In an explicit range or singleton
+        // like we just parsed, we do not filter \n out, so set ClassNL
+        // in the flags.
+        re->ccb_->AddRangeFlags(rr.lo, rr.hi, flags_ | Regexp::ClassNL);
+    }
+    if (s->empty()) {
+        status->set_code(kRegexpMissingBracket);
+        status->set_error_arg(whole_class);
+        re->Decref();
+        return false;
+    }
+    s->remove_prefix(1); // ']'
+
+    if (negated)
+        re->ccb_->Negate();
+
+    *out_re = re;
+    return true;
+}
+
+// Returns whether name is a valid capture name.
+static bool IsValidCaptureName(const StringPiece& name) {
+    if (name.empty())
+        return false;
+
+    // Historically, we effectively used [0-9A-Za-z_]+ to validate; that
+    // followed Python 2 except for not restricting the first character.
+    // As of Python 3, Unicode characters beyond ASCII are also allowed;
+    // accordingly, we permit the Lu, Ll, Lt, Lm, Lo, Nl, Mn, Mc, Nd and
+    // Pc categories, but again without restricting the first character.
+    // Also, Unicode normalization (e.g. NFKC) isn't performed: Python 3
+    // performs it for identifiers, but seemingly not for capture names;
+    // if they start doing that for capture names, we won't follow suit.
+    static const CharClass* const cc = []() {
+        CharClassBuilder ccb;
+        for (StringPiece group : {"Lu", "Ll", "Lt", "Lm", "Lo", "Nl", "Mn", "Mc", "Nd", "Pc"})
+            AddUGroup(&ccb, LookupGroup(group, unicode_groups, num_unicode_groups), +1,
+                Regexp::NoParseFlags);
+        return ccb.GetCharClass();
+    }();
+
+    StringPiece t = name;
+    Rune r;
+    while (!t.empty()) {
+        if (StringPieceToRune(&r, &t, NULL) < 0)
+            return false;
+        if (cc->Contains(r))
+            continue;
+        return false;
+    }
+    return true;
+}
+
+// Parses a Perl flag setting or non-capturing group or both,
+// like (?i) or (?: or (?i:.  Removes from s, updates parse state.
+// The caller must check that s begins with "(?".
+// Returns true on success.  If the Perl flag is not
+// well-formed or not supported, sets status_ and returns false.
+bool Regexp::ParseState::ParsePerlFlags(StringPiece* s) {
+    StringPiece t = *s;
+
+    // Caller is supposed to check this.
+    if (!(flags_ & PerlX) || t.size() < 2 || t[0] != '(' || t[1] != '?') {
+        status_->set_code(kRegexpInternalError);
+        LOG(DFATAL) << "Bad call to ParseState::ParsePerlFlags";
+        return false;
+    }
+
+    t.remove_prefix(2); // "(?"
+
+    // Check for named captures, first introduced in Python's regexp library.
+    // As usual, there are three slightly different syntaxes:
+    //
+    //   (?P<name>expr)   the original, introduced by Python
+    //   (?<name>expr)    the .NET alteration, adopted by Perl 5.10
+    //   (?'name'expr)    another .NET alteration, adopted by Perl 5.10
+    //
+    // Perl 5.10 gave in and implemented the Python version too,
+    // but they claim that the last two are the preferred forms.
+    // PCRE and languages based on it (specifically, PHP and Ruby)
+    // support all three as well.  EcmaScript 4 uses only the Python form.
+    //
+    // In both the open source world (via Code Search) and the
+    // Google source tree, (?P<expr>name) is the dominant form,
+    // so that's the one we implement.  One is enough.
+    if (t.size() > 2 && t[0] == 'P' && t[1] == '<') {
+        // Pull out name.
+        size_t end = t.find('>', 2);
+        if (end == StringPiece::npos) {
+            if (!IsValidUTF8(*s, status_))
+                return false;
+            status_->set_code(kRegexpBadNamedCapture);
+            status_->set_error_arg(*s);
+            return false;
+        }
+
+        // t is "P<name>...", t[end] == '>'
+        StringPiece capture(t.data() - 2, end + 3); // "(?P<name>"
+        StringPiece name(t.data() + 2, end - 2);    // "name"
+        if (!IsValidUTF8(name, status_))
+            return false;
+        if (!IsValidCaptureName(name)) {
+            status_->set_code(kRegexpBadNamedCapture);
+            status_->set_error_arg(capture);
+            return false;
+        }
+
+        if (!DoLeftParen(name)) {
+            // DoLeftParen's failure set status_.
+            return false;
+        }
+
+        s->remove_prefix(static_cast<size_t>(capture.data() + capture.size() - s->data()));
+        return true;
+    }
+
+    bool negated = false;
+    bool sawflags = false;
+    int nflags = flags_;
+    Rune c;
+    for (bool done = false; !done;) {
+        if (t.empty())
+            goto BadPerlOp;
+        if (StringPieceToRune(&c, &t, status_) < 0)
+            return false;
+        switch (c) {
+        default:
+            goto BadPerlOp;
+
+        // Parse flags.
+        case 'i':
+            sawflags = true;
+            if (negated)
+                nflags &= ~FoldCase;
+            else
+                nflags |= FoldCase;
+            break;
+
+        case 'm': // opposite of our OneLine
+            sawflags = true;
+            if (negated)
+                nflags |= OneLine;
+            else
+                nflags &= ~OneLine;
+            break;
+
+        case 's':
+            sawflags = true;
+            if (negated)
+                nflags &= ~DotNL;
+            else
+                nflags |= DotNL;
+            break;
+
+        case 'U':
+            sawflags = true;
+            if (negated)
+                nflags &= ~NonGreedy;
+            else
+                nflags |= NonGreedy;
+            break;
+
+        // Negation
+        case '-':
+            if (negated)
+                goto BadPerlOp;
+            negated = true;
+            sawflags = false;
+            break;
+
+        // Open new group.
+        case ':':
+            if (!DoLeftParenNoCapture()) {
+                // DoLeftParenNoCapture's failure set status_.
+                return false;
+            }
+            done = true;
+            break;
+
+        // Finish flags.
+        case ')':
+            done = true;
+            break;
+        }
+    }
+
+    if (negated && !sawflags)
+        goto BadPerlOp;
+
+    flags_ = static_cast<Regexp::ParseFlags>(nflags);
+    *s = t;
+    return true;
+
+BadPerlOp:
+    status_->set_code(kRegexpBadPerlOp);
+    status_->set_error_arg(StringPiece(s->data(), static_cast<size_t>(t.data() - s->data())));
+    return false;
+}
+
+// Converts latin1 (assumed to be encoded as Latin1 bytes)
+// into UTF8 encoding in string.
+// Can't use EncodingUtils::EncodeLatin1AsUTF8 because it is
+// deprecated and because it rejects code points 0x80-0x9F.
+void ConvertLatin1ToUTF8(const StringPiece& latin1, std::string* utf) {
+    char buf[UTFmax];
+
+    utf->clear();
+    for (size_t i = 0; i < latin1.size(); i++) {
+        Rune r = latin1[i] & 0xFF;
+        int n = runetochar(buf, &r);
+        utf->append(buf, n);
+    }
+}
+
+// Parses the regular expression given by s,
+// returning the corresponding Regexp tree.
+// The caller must Decref the return value when done with it.
+// Returns NULL on error.
+Regexp* Regexp::Parse(const StringPiece& s, ParseFlags global_flags, RegexpStatus* status) {
+    // Make status non-NULL (easier on everyone else).
+    RegexpStatus xstatus;
+    if (status == NULL)
+        status = &xstatus;
+
+    ParseState ps(global_flags, s, status);
+    StringPiece t = s;
+
+    // Convert regexp to UTF-8 (easier on the rest of the parser).
+    if (global_flags & Latin1) {
+        std::string* tmp = new std::string;
+        ConvertLatin1ToUTF8(t, tmp);
+        status->set_tmp(tmp);
+        t = *tmp;
+    }
+
+    if (global_flags & Literal) {
+        // Special parse loop for literal string.
+        while (!t.empty()) {
+            Rune r;
+            if (StringPieceToRune(&r, &t, status) < 0)
+                return NULL;
+            if (!ps.PushLiteral(r))
+                return NULL;
+        }
+        return ps.DoFinish();
+    }
+
+    StringPiece lastunary = StringPiece();
+    while (!t.empty()) {
+        StringPiece isunary = StringPiece();
+        switch (t[0]) {
+        default: {
+            Rune r;
+            if (StringPieceToRune(&r, &t, status) < 0)
+                return NULL;
+            if (!ps.PushLiteral(r))
+                return NULL;
+            break;
+        }
+
+        case '(':
+            // "(?" introduces Perl escape.
+            if ((ps.flags() & PerlX) && (t.size() >= 2 && t[1] == '?')) {
+                // Flag changes and non-capturing groups.
+                if (!ps.ParsePerlFlags(&t))
+                    return NULL;
+                break;
+            }
+            if (ps.flags() & NeverCapture) {
+                if (!ps.DoLeftParenNoCapture())
+                    return NULL;
+            } else {
+                if (!ps.DoLeftParen(StringPiece()))
+                    return NULL;
+            }
+            t.remove_prefix(1); // '('
+            break;
+
+        case '|':
+            if (!ps.DoVerticalBar())
+                return NULL;
+            t.remove_prefix(1); // '|'
+            break;
+
+        case ')':
+            if (!ps.DoRightParen())
+                return NULL;
+            t.remove_prefix(1); // ')'
+            break;
+
+        case '^': // Beginning of line.
+            if (!ps.PushCaret())
+                return NULL;
+            t.remove_prefix(1); // '^'
+            break;
+
+        case '$': // End of line.
+            if (!ps.PushDollar())
+                return NULL;
+            t.remove_prefix(1); // '$'
+            break;
+
+        case '.': // Any character (possibly except newline).
+            if (!ps.PushDot())
+                return NULL;
+            t.remove_prefix(1); // '.'
+            break;
+
+        case '[': { // Character class.
+            Regexp* re;
+            if (!ps.ParseCharClass(&t, &re, status))
+                return NULL;
+            if (!ps.PushRegexp(re))
+                return NULL;
+            break;
+        }
+
+        case '*': { // Zero or more.
+            RegexpOp op;
+            op = kRegexpStar;
+            goto Rep;
+        case '+': // One or more.
+            op = kRegexpPlus;
+            goto Rep;
+        case '?': // Zero or one.
+            op = kRegexpQuest;
+            goto Rep;
+        Rep:
+            StringPiece opstr = t;
+            bool nongreedy = false;
+            t.remove_prefix(1); // '*' or '+' or '?'
+            if (ps.flags() & PerlX) {
+                if (!t.empty() && t[0] == '?') {
+                    nongreedy = true;
+                    t.remove_prefix(1); // '?'
+                }
+                if (!lastunary.empty()) {
+                    // In Perl it is not allowed to stack repetition operators:
+                    //   a** is a syntax error, not a double-star.
+                    // (and a++ means something else entirely, which we don't support!)
+                    status->set_code(kRegexpRepeatOp);
+                    status->set_error_arg(StringPiece(
+                        lastunary.data(), static_cast<size_t>(t.data() - lastunary.data())));
+                    return NULL;
+                }
+            }
+            opstr = StringPiece(opstr.data(), static_cast<size_t>(t.data() - opstr.data()));
+            if (!ps.PushRepeatOp(op, opstr, nongreedy))
+                return NULL;
+            isunary = opstr;
+            break;
+        }
+
+        case '{': { // Counted repetition.
+            int lo, hi;
+            StringPiece opstr = t;
+            if (!MaybeParseRepetition(&t, &lo, &hi)) {
+                // Treat like a literal.
+                if (!ps.PushLiteral('{'))
+                    return NULL;
+                t.remove_prefix(1); // '{'
+                break;
+            }
+            bool nongreedy = false;
+            if (ps.flags() & PerlX) {
+                if (!t.empty() && t[0] == '?') {
+                    nongreedy = true;
+                    t.remove_prefix(1); // '?'
+                }
+                if (!lastunary.empty()) {
+                    // Not allowed to stack repetition operators.
+                    status->set_code(kRegexpRepeatOp);
+                    status->set_error_arg(StringPiece(
+                        lastunary.data(), static_cast<size_t>(t.data() - lastunary.data())));
+                    return NULL;
+                }
+            }
+            opstr = StringPiece(opstr.data(), static_cast<size_t>(t.data() - opstr.data()));
+            if (!ps.PushRepetition(lo, hi, opstr, nongreedy))
+                return NULL;
+            isunary = opstr;
+            break;
+        }
+
+        case '\\': { // Escaped character or Perl sequence.
+            // \b and \B: word boundary or not
+            if ((ps.flags() & Regexp::PerlB) && t.size() >= 2 && (t[1] == 'b' || t[1] == 'B')) {
+                if (!ps.PushWordBoundary(t[1] == 'b'))
+                    return NULL;
+                t.remove_prefix(2); // '\\', 'b'
+                break;
+            }
+
+            if ((ps.flags() & Regexp::PerlX) && t.size() >= 2) {
+                if (t[1] == 'A') {
+                    if (!ps.PushSimpleOp(kRegexpBeginText))
+                        return NULL;
+                    t.remove_prefix(2); // '\\', 'A'
+                    break;
+                }
+                if (t[1] == 'z') {
+                    if (!ps.PushSimpleOp(kRegexpEndText))
+                        return NULL;
+                    t.remove_prefix(2); // '\\', 'z'
+                    break;
+                }
+                // Do not recognize \Z, because this library can't
+                // implement the exact Perl/PCRE semantics.
+                // (This library treats "(?-m)$" as \z, even though
+                // in Perl and PCRE it is equivalent to \Z.)
+
+                if (t[1] == 'C') { // \C: any byte [sic]
+                    if (!ps.PushSimpleOp(kRegexpAnyByte))
+                        return NULL;
+                    t.remove_prefix(2); // '\\', 'C'
+                    break;
+                }
+
+                if (t[1] == 'Q') {      // \Q ... \E: the ... is always literals
+                    t.remove_prefix(2); // '\\', 'Q'
+                    while (!t.empty()) {
+                        if (t.size() >= 2 && t[0] == '\\' && t[1] == 'E') {
+                            t.remove_prefix(2); // '\\', 'E'
+                            break;
+                        }
+                        Rune r;
+                        if (StringPieceToRune(&r, &t, status) < 0)
+                            return NULL;
+                        if (!ps.PushLiteral(r))
+                            return NULL;
+                    }
+                    break;
+                }
+            }
+
+            if (t.size() >= 2 && (t[1] == 'p' || t[1] == 'P')) {
+                Regexp* re = new Regexp(kRegexpCharClass, ps.flags() & ~FoldCase);
+                re->ccb_ = new CharClassBuilder;
+                switch (ParseUnicodeGroup(&t, ps.flags(), re->ccb_, status)) {
+                case kParseOk:
+                    if (!ps.PushRegexp(re))
+                        return NULL;
+                    goto Break2;
+                case kParseError:
+                    re->Decref();
+                    return NULL;
+                case kParseNothing:
+                    re->Decref();
+                    break;
+                }
+            }
+
+            const UGroup* g = MaybeParsePerlCCEscape(&t, ps.flags());
+            if (g != NULL) {
+                Regexp* re = new Regexp(kRegexpCharClass, ps.flags() & ~FoldCase);
+                re->ccb_ = new CharClassBuilder;
+                AddUGroup(re->ccb_, g, g->sign, ps.flags());
+                if (!ps.PushRegexp(re))
+                    return NULL;
+                break;
+            }
+
+            Rune r;
+            if (!ParseEscape(&t, &r, status, ps.rune_max()))
+                return NULL;
+            if (!ps.PushLiteral(r))
+                return NULL;
+            break;
+        }
+        }
+    Break2:
+        lastunary = isunary;
+    }
+    return ps.DoFinish();
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/perl_groups.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/perl_groups.cpp
new file mode 100644
index 0000000000..cfd6c13f08
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/perl_groups.cpp
@@ -0,0 +1,138 @@
+// GENERATED BY make_perl_groups.pl; DO NOT EDIT.
+// make_perl_groups.pl >perl_groups.cc
+
+#include "unicode_groups.h"
+
+namespace lbug {
+namespace regex {
+
+static const URange16 code1[] = {
+    /* \d */
+    {0x30, 0x39},
+};
+static const URange16 code2[] = {
+    /* \s */
+    {0x9, 0xa},
+    {0xc, 0xd},
+    {0x20, 0x20},
+};
+static const URange16 code3[] = {
+    /* \w */
+    {0x30, 0x39},
+    {0x41, 0x5a},
+    {0x5f, 0x5f},
+    {0x61, 0x7a},
+};
+const UGroup perl_groups[] = {
+    {"\\d", +1, code1, 1, nullptr, 0},
+    {"\\D", -1, code1, 1, nullptr, 0},
+    {"\\s", +1, code2, 3, nullptr, 0},
+    {"\\S", -1, code2, 3, nullptr, 0},
+    {"\\w", +1, code3, 4, nullptr, 0},
+    {"\\W", -1, code3, 4, nullptr, 0},
+};
+const int num_perl_groups = 6;
+static const URange16 code4[] = {
+    /* [:alnum:] */
+    {0x30, 0x39},
+    {0x41, 0x5a},
+    {0x61, 0x7a},
+};
+static const URange16 code5[] = {
+    /* [:alpha:] */
+    {0x41, 0x5a},
+    {0x61, 0x7a},
+};
+static const URange16 code6[] = {
+    /* [:ascii:] */
+    {0x0, 0x7f},
+};
+static const URange16 code7[] = {
+    /* [:blank:] */
+    {0x9, 0x9},
+    {0x20, 0x20},
+};
+static const URange16 code8[] = {
+    /* [:cntrl:] */
+    {0x0, 0x1f},
+    {0x7f, 0x7f},
+};
+static const URange16 code9[] = {
+    /* [:digit:] */
+    {0x30, 0x39},
+};
+static const URange16 code10[] = {
+    /* [:graph:] */
+    {0x21, 0x7e},
+};
+static const URange16 code11[] = {
+    /* [:lower:] */
+    {0x61, 0x7a},
+};
+static const URange16 code12[] = {
+    /* [:print:] */
+    {0x20, 0x7e},
+};
+static const URange16 code13[] = {
+    /* [:punct:] */
+    {0x21, 0x2f},
+    {0x3a, 0x40},
+    {0x5b, 0x60},
+    {0x7b, 0x7e},
+};
+static const URange16 code14[] = {
+    /* [:space:] */
+    {0x9, 0xd},
+    {0x20, 0x20},
+};
+static const URange16 code15[] = {
+    /* [:upper:] */
+    {0x41, 0x5a},
+};
+static const URange16 code16[] = {
+    /* [:word:] */
+    {0x30, 0x39},
+    {0x41, 0x5a},
+    {0x5f, 0x5f},
+    {0x61, 0x7a},
+};
+static const URange16 code17[] = {
+    /* [:xdigit:] */
+    {0x30, 0x39},
+    {0x41, 0x46},
+    {0x61, 0x66},
+};
+const UGroup posix_groups[] = {
+    {"[:alnum:]", +1, code4, 3, nullptr, 0},
+    {"[:^alnum:]", -1, code4, 3, nullptr, 0},
+    {"[:alpha:]", +1, code5, 2, nullptr, 0},
+    {"[:^alpha:]", -1, code5, 2, nullptr, 0},
+    {"[:ascii:]", +1, code6, 1, nullptr, 0},
+    {"[:^ascii:]", -1, code6, 1, nullptr, 0},
+    {"[:blank:]", +1, code7, 2, nullptr, 0},
+    {"[:^blank:]", -1, code7, 2, nullptr, 0},
+    {"[:cntrl:]", +1, code8, 2, nullptr, 0},
+    {"[:^cntrl:]", -1, code8, 2, nullptr, 0},
+    {"[:digit:]", +1, code9, 1, nullptr, 0},
+    {"[:^digit:]", -1, code9, 1, nullptr, 0},
+    {"[:graph:]", +1, code10, 1, nullptr, 0},
+    {"[:^graph:]", -1, code10, 1, nullptr, 0},
+    {"[:lower:]", +1, code11, 1, nullptr, 0},
+    {"[:^lower:]", -1, code11, 1, nullptr, 0},
+    {"[:print:]", +1, code12, 1, nullptr, 0},
+    {"[:^print:]", -1, code12, 1, nullptr, 0},
+    {"[:punct:]", +1, code13, 4, nullptr, 0},
+    {"[:^punct:]", -1, code13, 4, nullptr, 0},
+    {"[:space:]", +1, code14, 2, nullptr, 0},
+    {"[:^space:]", -1, code14, 2, nullptr, 0},
+    {"[:upper:]", +1, code15, 1, nullptr, 0},
+    {"[:^upper:]", -1, code15, 1, nullptr, 0},
+    {"[:word:]", +1, code16, 4, nullptr, 0},
+    {"[:^word:]", -1, code16, 4, nullptr, 0},
+    {"[:xdigit:]", +1, code17, 3, nullptr, 0},
+    {"[:^xdigit:]", -1, code17, 3, nullptr, 0},
+};
+const int num_posix_groups = 28;
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/prefilter.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/prefilter.cpp
new file mode 100644
index 0000000000..0fd767d054
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/prefilter.cpp
@@ -0,0 +1,694 @@
+// Copyright 2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#include "prefilter.h"
+
+#include <stddef.h>
+#include <stdint.h>
+
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "logging.h"
+#include "re2.h"
+#include "strutil.h"
+#include "unicode_casefold.h"
+#include "utf.h"
+#include "util.h"
+#include "walker-inl.h"
+
+namespace lbug {
+namespace regex {
+
+static const bool ExtraDebug = false;
+
+// Initializes a Prefilter, allocating subs_ as necessary.
+Prefilter::Prefilter(Op op) {
+    op_ = op;
+    subs_ = NULL;
+    if (op_ == AND || op_ == OR)
+        subs_ = new std::vector<Prefilter*>;
+}
+
+// Destroys a Prefilter.
+Prefilter::~Prefilter() {
+    if (subs_) {
+        for (size_t i = 0; i < subs_->size(); i++)
+            delete (*subs_)[i];
+        delete subs_;
+        subs_ = NULL;
+    }
+}
+
+// Simplify if the node is an empty Or or And.
+Prefilter* Prefilter::Simplify() {
+    if (op_ != AND && op_ != OR) {
+        return this;
+    }
+
+    // Nothing left in the AND/OR.
+    if (subs_->empty()) {
+        if (op_ == AND)
+            op_ = ALL; // AND of nothing is true
+        else
+            op_ = NONE; // OR of nothing is false
+
+        return this;
+    }
+
+    // Just one subnode: throw away wrapper.
+    if (subs_->size() == 1) {
+        Prefilter* a = (*subs_)[0];
+        subs_->clear();
+        delete this;
+        return a->Simplify();
+    }
+
+    return this;
+}
+
+// Combines two Prefilters together to create an "op" (AND or OR).
+// The passed Prefilters will be part of the returned Prefilter or deleted.
+// Does lots of work to avoid creating unnecessarily complicated structures.
+Prefilter* Prefilter::AndOr(Op op, Prefilter* a, Prefilter* b) {
+    // If a, b can be rewritten as op, do so.
+    a = a->Simplify();
+    b = b->Simplify();
+
+    // Canonicalize: a->op <= b->op.
+    if (a->op() > b->op()) {
+        Prefilter* t = a;
+        a = b;
+        b = t;
+    }
+
+    // Trivial cases.
+    //    ALL AND b = b
+    //    NONE OR b = b
+    //    ALL OR b   = ALL
+    //    NONE AND b = NONE
+    // Don't need to look at b, because of canonicalization above.
+    // ALL and NONE are smallest opcodes.
+    if (a->op() == ALL || a->op() == NONE) {
+        if ((a->op() == ALL && op == AND) || (a->op() == NONE && op == OR)) {
+            delete a;
+            return b;
+        } else {
+            delete b;
+            return a;
+        }
+    }
+
+    // If a and b match op, merge their contents.
+    if (a->op() == op && b->op() == op) {
+        for (size_t i = 0; i < b->subs()->size(); i++) {
+            Prefilter* bb = (*b->subs())[i];
+            a->subs()->push_back(bb);
+        }
+        b->subs()->clear();
+        delete b;
+        return a;
+    }
+
+    // If a already has the same op as the op that is under construction
+    // add in b (similarly if b already has the same op, add in a).
+    if (b->op() == op) {
+        Prefilter* t = a;
+        a = b;
+        b = t;
+    }
+    if (a->op() == op) {
+        a->subs()->push_back(b);
+        return a;
+    }
+
+    // Otherwise just return the op.
+    Prefilter* c = new Prefilter(op);
+    c->subs()->push_back(a);
+    c->subs()->push_back(b);
+    return c;
+}
+
+Prefilter* Prefilter::And(Prefilter* a, Prefilter* b) {
+    return AndOr(AND, a, b);
+}
+
+Prefilter* Prefilter::Or(Prefilter* a, Prefilter* b) {
+    return AndOr(OR, a, b);
+}
+
+void Prefilter::SimplifyStringSet(SSet* ss) {
+    // Now make sure that the strings aren't redundant.  For example, if
+    // we know "ab" is a required string, then it doesn't help at all to
+    // know that "abc" is also a required string, so delete "abc". This
+    // is because, when we are performing a string search to filter
+    // regexps, matching "ab" will already allow this regexp to be a
+    // candidate for match, so further matching "abc" is redundant.
+    // Note that we must ignore "" because find() would find it at the
+    // start of everything and thus we would end up erasing everything.
+    //
+    // The SSet sorts strings by length, then lexicographically. Note that
+    // smaller strings appear first and all strings must be unique. These
+    // observations let us skip string comparisons when possible.
+    SSIter i = ss->begin();
+    if (i != ss->end() && i->empty()) {
+        ++i;
+    }
+    for (; i != ss->end(); ++i) {
+        SSIter j = i;
+        ++j;
+        while (j != ss->end()) {
+            if (j->size() > i->size() && j->find(*i) != std::string::npos) {
+                j = ss->erase(j);
+                continue;
+            }
+            ++j;
+        }
+    }
+}
+
+Prefilter* Prefilter::OrStrings(SSet* ss) {
+    Prefilter* or_prefilter = new Prefilter(NONE);
+    SimplifyStringSet(ss);
+    for (SSIter i = ss->begin(); i != ss->end(); ++i)
+        or_prefilter = Or(or_prefilter, FromString(*i));
+    return or_prefilter;
+}
+
+static Rune ToLowerRune(Rune r) {
+    if (r < Runeself) {
+        if ('A' <= r && r <= 'Z')
+            r += 'a' - 'A';
+        return r;
+    }
+
+    const CaseFold* f = LookupCaseFold(unicode_tolower, num_unicode_tolower, r);
+    if (f == NULL || r < f->lo)
+        return r;
+    return ApplyFold(f, r);
+}
+
+static Rune ToLowerRuneLatin1(Rune r) {
+    if ('A' <= r && r <= 'Z')
+        r += 'a' - 'A';
+    return r;
+}
+
+Prefilter* Prefilter::FromString(const std::string& str) {
+    Prefilter* m = new Prefilter(Prefilter::ATOM);
+    m->atom_ = str;
+    return m;
+}
+
+// Information about a regexp used during computation of Prefilter.
+// Can be thought of as information about the set of strings matching
+// the given regular expression.
+class Prefilter::Info {
+public:
+    Info();
+    ~Info();
+
+    // More constructors.  They delete their Info* arguments.
+    static Info* Alt(Info* a, Info* b);
+    static Info* Concat(Info* a, Info* b);
+    static Info* And(Info* a, Info* b);
+    static Info* Star(Info* a);
+    static Info* Plus(Info* a);
+    static Info* Quest(Info* a);
+    static Info* EmptyString();
+    static Info* NoMatch();
+    static Info* AnyCharOrAnyByte();
+    static Info* CClass(CharClass* cc, bool latin1);
+    static Info* Literal(Rune r);
+    static Info* LiteralLatin1(Rune r);
+    static Info* AnyMatch();
+
+    // Format Info as a string.
+    std::string ToString();
+
+    // Caller takes ownership of the Prefilter.
+    Prefilter* TakeMatch();
+
+    SSet& exact() { return exact_; }
+
+    bool is_exact() const { return is_exact_; }
+
+    class Walker;
+
+private:
+    SSet exact_;
+
+    // When is_exact_ is true, the strings that match
+    // are placed in exact_. When it is no longer an exact
+    // set of strings that match this RE, then is_exact_
+    // is false and the match_ contains the required match
+    // criteria.
+    bool is_exact_;
+
+    // Accumulated Prefilter query that any
+    // match for this regexp is guaranteed to match.
+    Prefilter* match_;
+};
+
+Prefilter::Info::Info() : is_exact_(false), match_(NULL) {}
+
+Prefilter::Info::~Info() {
+    delete match_;
+}
+
+Prefilter* Prefilter::Info::TakeMatch() {
+    if (is_exact_) {
+        match_ = Prefilter::OrStrings(&exact_);
+        is_exact_ = false;
+    }
+    Prefilter* m = match_;
+    match_ = NULL;
+    return m;
+}
+
+// Format a Info in string form.
+std::string Prefilter::Info::ToString() {
+    if (is_exact_) {
+        int n = 0;
+        std::string s;
+        for (SSIter i = exact_.begin(); i != exact_.end(); ++i) {
+            if (n++ > 0)
+                s += ",";
+            s += *i;
+        }
+        return s;
+    }
+
+    if (match_)
+        return match_->DebugString();
+
+    return "";
+}
+
+void Prefilter::CrossProduct(const SSet& a, const SSet& b, SSet* dst) {
+    for (ConstSSIter i = a.begin(); i != a.end(); ++i)
+        for (ConstSSIter j = b.begin(); j != b.end(); ++j)
+            dst->insert(*i + *j);
+}
+
+// Concats a and b. Requires that both are exact sets.
+// Forms an exact set that is a crossproduct of a and b.
+Prefilter::Info* Prefilter::Info::Concat(Info* a, Info* b) {
+    if (a == NULL)
+        return b;
+    DCHECK(a->is_exact_);
+    DCHECK(b && b->is_exact_);
+    Info* ab = new Info();
+
+    CrossProduct(a->exact_, b->exact_, &ab->exact_);
+    ab->is_exact_ = true;
+
+    delete a;
+    delete b;
+    return ab;
+}
+
+// Constructs an inexact Info for ab given a and b.
+// Used only when a or b is not exact or when the
+// exact cross product is likely to be too big.
+Prefilter::Info* Prefilter::Info::And(Info* a, Info* b) {
+    if (a == NULL)
+        return b;
+    if (b == NULL)
+        return a;
+
+    Info* ab = new Info();
+
+    ab->match_ = Prefilter::And(a->TakeMatch(), b->TakeMatch());
+    ab->is_exact_ = false;
+    delete a;
+    delete b;
+    return ab;
+}
+
+// Constructs Info for a|b given a and b.
+Prefilter::Info* Prefilter::Info::Alt(Info* a, Info* b) {
+    Info* ab = new Info();
+
+    if (a->is_exact_ && b->is_exact_) {
+        // Avoid string copies by moving the larger exact_ set into
+        // ab directly, then merge in the smaller set.
+        if (a->exact_.size() < b->exact_.size()) {
+            using std::swap;
+            swap(a, b);
+        }
+        ab->exact_ = std::move(a->exact_);
+        ab->exact_.insert(b->exact_.begin(), b->exact_.end());
+        ab->is_exact_ = true;
+    } else {
+        // Either a or b has is_exact_ = false. If the other
+        // one has is_exact_ = true, we move it to match_ and
+        // then create a OR of a,b. The resulting Info has
+        // is_exact_ = false.
+        ab->match_ = Prefilter::Or(a->TakeMatch(), b->TakeMatch());
+        ab->is_exact_ = false;
+    }
+
+    delete a;
+    delete b;
+    return ab;
+}
+
+// Constructs Info for a? given a.
+Prefilter::Info* Prefilter::Info::Quest(Info* a) {
+    Info* ab = new Info();
+
+    ab->is_exact_ = false;
+    ab->match_ = new Prefilter(ALL);
+    delete a;
+    return ab;
+}
+
+// Constructs Info for a* given a.
+// Same as a? -- not much to do.
+Prefilter::Info* Prefilter::Info::Star(Info* a) {
+    return Quest(a);
+}
+
+// Constructs Info for a+ given a. If a was exact set, it isn't
+// anymore.
+Prefilter::Info* Prefilter::Info::Plus(Info* a) {
+    Info* ab = new Info();
+
+    ab->match_ = a->TakeMatch();
+    ab->is_exact_ = false;
+
+    delete a;
+    return ab;
+}
+
+static std::string RuneToString(Rune r) {
+    char buf[UTFmax];
+    int n = runetochar(buf, &r);
+    return std::string(buf, n);
+}
+
+static std::string RuneToStringLatin1(Rune r) {
+    char c = r & 0xff;
+    return std::string(&c, 1);
+}
+
+// Constructs Info for literal rune.
+Prefilter::Info* Prefilter::Info::Literal(Rune r) {
+    Info* info = new Info();
+    info->exact_.insert(RuneToString(ToLowerRune(r)));
+    info->is_exact_ = true;
+    return info;
+}
+
+// Constructs Info for literal rune for Latin1 encoded string.
+Prefilter::Info* Prefilter::Info::LiteralLatin1(Rune r) {
+    Info* info = new Info();
+    info->exact_.insert(RuneToStringLatin1(ToLowerRuneLatin1(r)));
+    info->is_exact_ = true;
+    return info;
+}
+
+// Constructs Info for dot (any character) or \C (any byte).
+Prefilter::Info* Prefilter::Info::AnyCharOrAnyByte() {
+    Prefilter::Info* info = new Prefilter::Info();
+    info->match_ = new Prefilter(ALL);
+    return info;
+}
+
+// Constructs Prefilter::Info for no possible match.
+Prefilter::Info* Prefilter::Info::NoMatch() {
+    Prefilter::Info* info = new Prefilter::Info();
+    info->match_ = new Prefilter(NONE);
+    return info;
+}
+
+// Constructs Prefilter::Info for any possible match.
+// This Prefilter::Info is valid for any regular expression,
+// since it makes no assertions whatsoever about the
+// strings being matched.
+Prefilter::Info* Prefilter::Info::AnyMatch() {
+    Prefilter::Info* info = new Prefilter::Info();
+    info->match_ = new Prefilter(ALL);
+    return info;
+}
+
+// Constructs Prefilter::Info for just the empty string.
+Prefilter::Info* Prefilter::Info::EmptyString() {
+    Prefilter::Info* info = new Prefilter::Info();
+    info->is_exact_ = true;
+    info->exact_.insert("");
+    return info;
+}
+
+// Constructs Prefilter::Info for a character class.
+typedef CharClass::iterator CCIter;
+Prefilter::Info* Prefilter::Info::CClass(CharClass* cc, bool latin1) {
+    if (ExtraDebug) {
+        LOG(ERROR) << "CharClassInfo:";
+        for (CCIter i = cc->begin(); i != cc->end(); ++i)
+            LOG(ERROR) << "  " << i->lo << "-" << i->hi;
+    }
+
+    // If the class is too large, it's okay to overestimate.
+    if (cc->size() > 10)
+        return AnyCharOrAnyByte();
+
+    Prefilter::Info* a = new Prefilter::Info();
+    for (CCIter i = cc->begin(); i != cc->end(); ++i)
+        for (Rune r = i->lo; r <= i->hi; r++) {
+            if (latin1) {
+                a->exact_.insert(RuneToStringLatin1(ToLowerRuneLatin1(r)));
+            } else {
+                a->exact_.insert(RuneToString(ToLowerRune(r)));
+            }
+        }
+
+    a->is_exact_ = true;
+
+    if (ExtraDebug)
+        LOG(ERROR) << " = " << a->ToString();
+
+    return a;
+}
+
+class Prefilter::Info::Walker : public Regexp::Walker<Prefilter::Info*> {
+public:
+    Walker(bool latin1) : latin1_(latin1) {}
+
+    virtual Info* PostVisit(
+        Regexp* re, Info* parent_arg, Info* pre_arg, Info** child_args, int nchild_args);
+
+    virtual Info* ShortVisit(Regexp* re, Info* parent_arg);
+
+    bool latin1() { return latin1_; }
+
+private:
+    bool latin1_;
+
+    Walker(const Walker&) = delete;
+    Walker& operator=(const Walker&) = delete;
+};
+
+Prefilter::Info* Prefilter::BuildInfo(Regexp* re) {
+    if (ExtraDebug)
+        LOG(ERROR) << "BuildPrefilter::Info: " << re->ToString();
+
+    bool latin1 = (re->parse_flags() & Regexp::Latin1) != 0;
+    Prefilter::Info::Walker w(latin1);
+    Prefilter::Info* info = w.WalkExponential(re, NULL, 100000);
+
+    if (w.stopped_early()) {
+        delete info;
+        return NULL;
+    }
+
+    return info;
+}
+
+Prefilter::Info* Prefilter::Info::Walker::ShortVisit(Regexp* re, Prefilter::Info* parent_arg) {
+    return AnyMatch();
+}
+
+// Constructs the Prefilter::Info for the given regular expression.
+// Assumes re is simplified.
+Prefilter::Info* Prefilter::Info::Walker::PostVisit(Regexp* re, Prefilter::Info* parent_arg,
+    Prefilter::Info* pre_arg, Prefilter::Info** child_args, int nchild_args) {
+    Prefilter::Info* info;
+    switch (re->op()) {
+    default:
+    case kRegexpRepeat:
+        info = EmptyString();
+        LOG(DFATAL) << "Bad regexp op " << re->op();
+        break;
+
+    case kRegexpNoMatch:
+        info = NoMatch();
+        break;
+
+    // These ops match the empty string:
+    case kRegexpEmptyMatch:     // anywhere
+    case kRegexpBeginLine:      // at beginning of line
+    case kRegexpEndLine:        // at end of line
+    case kRegexpBeginText:      // at beginning of text
+    case kRegexpEndText:        // at end of text
+    case kRegexpWordBoundary:   // at word boundary
+    case kRegexpNoWordBoundary: // not at word boundary
+        info = EmptyString();
+        break;
+
+    case kRegexpLiteral:
+        if (latin1()) {
+            info = LiteralLatin1(re->rune());
+        } else {
+            info = Literal(re->rune());
+        }
+        break;
+
+    case kRegexpLiteralString:
+        if (re->nrunes() == 0) {
+            info = NoMatch();
+            break;
+        }
+        if (latin1()) {
+            info = LiteralLatin1(re->runes()[0]);
+            for (int i = 1; i < re->nrunes(); i++) {
+                info = Concat(info, LiteralLatin1(re->runes()[i]));
+            }
+        } else {
+            info = Literal(re->runes()[0]);
+            for (int i = 1; i < re->nrunes(); i++) {
+                info = Concat(info, Literal(re->runes()[i]));
+            }
+        }
+        break;
+
+    case kRegexpConcat: {
+        // Accumulate in info.
+        // Exact is concat of recent contiguous exact nodes.
+        info = NULL;
+        Info* exact = NULL;
+        for (int i = 0; i < nchild_args; i++) {
+            Info* ci = child_args[i]; // child info
+            if (!ci->is_exact() || (exact && ci->exact().size() * exact->exact().size() > 16)) {
+                // Exact run is over.
+                info = And(info, exact);
+                exact = NULL;
+                // Add this child's info.
+                info = And(info, ci);
+            } else {
+                // Append to exact run.
+                exact = Concat(exact, ci);
+            }
+        }
+        info = And(info, exact);
+    } break;
+
+    case kRegexpAlternate:
+        info = child_args[0];
+        for (int i = 1; i < nchild_args; i++)
+            info = Alt(info, child_args[i]);
+        break;
+
+    case kRegexpStar:
+        info = Star(child_args[0]);
+        break;
+
+    case kRegexpQuest:
+        info = Quest(child_args[0]);
+        break;
+
+    case kRegexpPlus:
+        info = Plus(child_args[0]);
+        break;
+
+    case kRegexpAnyChar:
+    case kRegexpAnyByte:
+        // Claim nothing, except that it's not empty.
+        info = AnyCharOrAnyByte();
+        break;
+
+    case kRegexpCharClass:
+        info = CClass(re->cc(), latin1());
+        break;
+
+    case kRegexpCapture:
+        // These don't affect the set of matching strings.
+        info = child_args[0];
+        break;
+    }
+
+    if (ExtraDebug)
+        LOG(ERROR) << "BuildInfo " << re->ToString() << ": " << (info ? info->ToString() : "");
+
+    return info;
+}
+
+Prefilter* Prefilter::FromRegexp(Regexp* re) {
+    if (re == NULL)
+        return NULL;
+
+    Regexp* simple = re->Simplify();
+    if (simple == NULL)
+        return NULL;
+
+    Prefilter::Info* info = BuildInfo(simple);
+    simple->Decref();
+    if (info == NULL)
+        return NULL;
+
+    Prefilter* m = info->TakeMatch();
+    delete info;
+    return m;
+}
+
+std::string Prefilter::DebugString() const {
+    switch (op_) {
+    default:
+        LOG(DFATAL) << "Bad op in Prefilter::DebugString: " << op_;
+        return StringPrintf("op%d", op_);
+    case NONE:
+        return "*no-matches*";
+    case ATOM:
+        return atom_;
+    case ALL:
+        return "";
+    case AND: {
+        std::string s = "";
+        for (size_t i = 0; i < subs_->size(); i++) {
+            if (i > 0)
+                s += " ";
+            Prefilter* sub = (*subs_)[i];
+            s += sub ? sub->DebugString() : "<nil>";
+        }
+        return s;
+    }
+    case OR: {
+        std::string s = "(";
+        for (size_t i = 0; i < subs_->size(); i++) {
+            if (i > 0)
+                s += "|";
+            Prefilter* sub = (*subs_)[i];
+            s += sub ? sub->DebugString() : "<nil>";
+        }
+        s += ")";
+        return s;
+    }
+    }
+}
+
+Prefilter* Prefilter::FromRE2(const RE2* re2) {
+    if (re2 == NULL)
+        return NULL;
+
+    Regexp* regexp = re2->getEntireRegex();
+    if (regexp == NULL)
+        return NULL;
+
+    return FromRegexp(regexp);
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/prefilter_tree.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/prefilter_tree.cpp
new file mode 100644
index 0000000000..2226d2881d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/prefilter_tree.cpp
@@ -0,0 +1,387 @@
+// Copyright 2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#include "prefilter_tree.h"
+
+#include <stddef.h>
+
+#include <algorithm>
+#include <map>
+#include <memory>
+#include <set>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "logging.h"
+#include "prefilter.h"
+#include "re2.h"
+#include "strutil.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+PrefilterTree::PrefilterTree() : compiled_(false), min_atom_len_(3) {}
+
+PrefilterTree::PrefilterTree(int min_atom_len) : compiled_(false), min_atom_len_(min_atom_len) {}
+
+PrefilterTree::~PrefilterTree() {
+    for (size_t i = 0; i < prefilter_vec_.size(); i++)
+        delete prefilter_vec_[i];
+
+    for (size_t i = 0; i < entries_.size(); i++)
+        delete entries_[i].parents;
+}
+
+void PrefilterTree::Add(Prefilter* prefilter) {
+    if (compiled_) {
+        LOG(DFATAL) << "Add called after Compile.";
+        return;
+    }
+    if (prefilter != NULL && !KeepNode(prefilter)) {
+        delete prefilter;
+        prefilter = NULL;
+    }
+
+    prefilter_vec_.push_back(prefilter);
+}
+
+void PrefilterTree::Compile(std::vector<std::string>* atom_vec) {
+    if (compiled_) {
+        LOG(DFATAL) << "Compile called already.";
+        return;
+    }
+
+    // Some legacy users of PrefilterTree call Compile() before
+    // adding any regexps and expect Compile() to have no effect.
+    if (prefilter_vec_.empty())
+        return;
+
+    compiled_ = true;
+
+    // TODO(junyer): Use std::unordered_set<Prefilter*> instead?
+    NodeMap nodes;
+    AssignUniqueIds(&nodes, atom_vec);
+
+    // Identify nodes that are too common among prefilters and are
+    // triggering too many parents. Then get rid of them if possible.
+    // Note that getting rid of a prefilter node simply means they are
+    // no longer necessary for their parent to trigger; that is, we do
+    // not miss out on any regexps triggering by getting rid of a
+    // prefilter node.
+    for (size_t i = 0; i < entries_.size(); i++) {
+        StdIntMap* parents = entries_[i].parents;
+        if (parents->size() > 8) {
+            // This one triggers too many things. If all the parents are AND
+            // nodes and have other things guarding them, then get rid of
+            // this trigger. TODO(vsri): Adjust the threshold appropriately,
+            // make it a function of total number of nodes?
+            bool have_other_guard = true;
+            for (StdIntMap::iterator it = parents->begin(); it != parents->end(); ++it) {
+                have_other_guard =
+                    have_other_guard && (entries_[it->first].propagate_up_at_count > 1);
+            }
+
+            if (have_other_guard) {
+                for (StdIntMap::iterator it = parents->begin(); it != parents->end(); ++it)
+                    entries_[it->first].propagate_up_at_count -= 1;
+
+                parents->clear(); // Forget the parents
+            }
+        }
+    }
+}
+
+Prefilter* PrefilterTree::CanonicalNode(NodeMap* nodes, Prefilter* node) {
+    std::string node_string = NodeString(node);
+    std::map<std::string, Prefilter*>::iterator iter = nodes->find(node_string);
+    if (iter == nodes->end())
+        return NULL;
+    return (*iter).second;
+}
+
+std::string PrefilterTree::NodeString(Prefilter* node) const {
+    // Adding the operation disambiguates AND/OR/atom nodes.
+    std::string s = StringPrintf("%d", node->op()) + ":";
+    if (node->op() == Prefilter::ATOM) {
+        s += node->atom();
+    } else {
+        for (size_t i = 0; i < node->subs()->size(); i++) {
+            if (i > 0)
+                s += ',';
+            s += StringPrintf("%d", (*node->subs())[i]->unique_id());
+        }
+    }
+    return s;
+}
+
+bool PrefilterTree::KeepNode(Prefilter* node) const {
+    if (node == NULL)
+        return false;
+
+    switch (node->op()) {
+    default:
+        LOG(DFATAL) << "Unexpected op in KeepNode: " << node->op();
+        return false;
+
+    case Prefilter::ALL:
+    case Prefilter::NONE:
+        return false;
+
+    case Prefilter::ATOM:
+        return node->atom().size() >= static_cast<size_t>(min_atom_len_);
+
+    case Prefilter::AND: {
+        int j = 0;
+        std::vector<Prefilter*>* subs = node->subs();
+        for (size_t i = 0; i < subs->size(); i++)
+            if (KeepNode((*subs)[i]))
+                (*subs)[j++] = (*subs)[i];
+            else
+                delete (*subs)[i];
+
+        subs->resize(j);
+        return j > 0;
+    }
+
+    case Prefilter::OR:
+        for (size_t i = 0; i < node->subs()->size(); i++)
+            if (!KeepNode((*node->subs())[i]))
+                return false;
+        return true;
+    }
+}
+
+void PrefilterTree::AssignUniqueIds(NodeMap* nodes, std::vector<std::string>* atom_vec) {
+    atom_vec->clear();
+
+    // Build vector of all filter nodes, sorted topologically
+    // from top to bottom in v.
+    std::vector<Prefilter*> v;
+
+    // Add the top level nodes of each regexp prefilter.
+    for (size_t i = 0; i < prefilter_vec_.size(); i++) {
+        Prefilter* f = prefilter_vec_[i];
+        if (f == NULL)
+            unfiltered_.push_back(static_cast<int>(i));
+
+        // We push NULL also on to v, so that we maintain the
+        // mapping of index==regexpid for level=0 prefilter nodes.
+        v.push_back(f);
+    }
+
+    // Now add all the descendant nodes.
+    for (size_t i = 0; i < v.size(); i++) {
+        Prefilter* f = v[i];
+        if (f == NULL)
+            continue;
+        if (f->op() == Prefilter::AND || f->op() == Prefilter::OR) {
+            const std::vector<Prefilter*>& subs = *f->subs();
+            for (size_t j = 0; j < subs.size(); j++)
+                v.push_back(subs[j]);
+        }
+    }
+
+    // Identify unique nodes.
+    int unique_id = 0;
+    for (int i = static_cast<int>(v.size()) - 1; i >= 0; i--) {
+        Prefilter* node = v[i];
+        if (node == NULL)
+            continue;
+        node->set_unique_id(-1);
+        Prefilter* canonical = CanonicalNode(nodes, node);
+        if (canonical == NULL) {
+            // Any further nodes that have the same node string
+            // will find this node as the canonical node.
+            nodes->emplace(NodeString(node), node);
+            if (node->op() == Prefilter::ATOM) {
+                atom_vec->push_back(node->atom());
+                atom_index_to_id_.push_back(unique_id);
+            }
+            node->set_unique_id(unique_id++);
+        } else {
+            node->set_unique_id(canonical->unique_id());
+        }
+    }
+    entries_.resize(nodes->size());
+
+    // Create parent StdIntMap for the entries.
+    for (int i = static_cast<int>(v.size()) - 1; i >= 0; i--) {
+        Prefilter* prefilter = v[i];
+        if (prefilter == NULL)
+            continue;
+
+        if (CanonicalNode(nodes, prefilter) != prefilter)
+            continue;
+
+        Entry* entry = &entries_[prefilter->unique_id()];
+        entry->parents = new StdIntMap();
+    }
+
+    // Fill the entries.
+    for (int i = static_cast<int>(v.size()) - 1; i >= 0; i--) {
+        Prefilter* prefilter = v[i];
+        if (prefilter == NULL)
+            continue;
+
+        if (CanonicalNode(nodes, prefilter) != prefilter)
+            continue;
+
+        Entry* entry = &entries_[prefilter->unique_id()];
+
+        switch (prefilter->op()) {
+        default:
+        case Prefilter::ALL:
+            LOG(DFATAL) << "Unexpected op: " << prefilter->op();
+            return;
+
+        case Prefilter::ATOM:
+            entry->propagate_up_at_count = 1;
+            break;
+
+        case Prefilter::OR:
+        case Prefilter::AND: {
+            std::set<int> uniq_child;
+            for (size_t j = 0; j < prefilter->subs()->size(); j++) {
+                Prefilter* child = (*prefilter->subs())[j];
+                Prefilter* canonical = CanonicalNode(nodes, child);
+                if (canonical == NULL) {
+                    LOG(DFATAL) << "Null canonical node";
+                    return;
+                }
+                int child_id = canonical->unique_id();
+                uniq_child.insert(child_id);
+                // To the child, we want to add to parent indices.
+                Entry* child_entry = &entries_[child_id];
+                if (child_entry->parents->find(prefilter->unique_id()) ==
+                    child_entry->parents->end()) {
+                    (*child_entry->parents)[prefilter->unique_id()] = 1;
+                }
+            }
+            entry->propagate_up_at_count =
+                prefilter->op() == Prefilter::AND ? static_cast<int>(uniq_child.size()) : 1;
+
+            break;
+        }
+        }
+    }
+
+    // For top level nodes, populate regexp id.
+    for (size_t i = 0; i < prefilter_vec_.size(); i++) {
+        if (prefilter_vec_[i] == NULL)
+            continue;
+        int id = CanonicalNode(nodes, prefilter_vec_[i])->unique_id();
+        DCHECK_LE(0, id);
+        Entry* entry = &entries_[id];
+        entry->regexps.push_back(static_cast<int>(i));
+    }
+}
+
+// Functions for triggering during search.
+void PrefilterTree::RegexpsGivenStrings(
+    const std::vector<int>& matched_atoms, std::vector<int>* regexps) const {
+    regexps->clear();
+    if (!compiled_) {
+        // Some legacy users of PrefilterTree call Compile() before
+        // adding any regexps and expect Compile() to have no effect.
+        // This kludge is a counterpart to that kludge.
+        if (prefilter_vec_.empty())
+            return;
+
+        LOG(ERROR) << "RegexpsGivenStrings called before Compile.";
+        for (size_t i = 0; i < prefilter_vec_.size(); i++)
+            regexps->push_back(static_cast<int>(i));
+    } else {
+        IntMap regexps_map(static_cast<int>(prefilter_vec_.size()));
+        std::vector<int> matched_atom_ids;
+        for (size_t j = 0; j < matched_atoms.size(); j++)
+            matched_atom_ids.push_back(atom_index_to_id_[matched_atoms[j]]);
+        PropagateMatch(matched_atom_ids, &regexps_map);
+        for (IntMap::iterator it = regexps_map.begin(); it != regexps_map.end(); ++it)
+            regexps->push_back(it->index());
+
+        regexps->insert(regexps->end(), unfiltered_.begin(), unfiltered_.end());
+    }
+    std::sort(regexps->begin(), regexps->end());
+}
+
+void PrefilterTree::PropagateMatch(const std::vector<int>& atom_ids, IntMap* regexps) const {
+    IntMap count(static_cast<int>(entries_.size()));
+    IntMap work(static_cast<int>(entries_.size()));
+    for (size_t i = 0; i < atom_ids.size(); i++)
+        work.set(atom_ids[i], 1);
+    for (IntMap::iterator it = work.begin(); it != work.end(); ++it) {
+        const Entry& entry = entries_[it->index()];
+        // Record regexps triggered.
+        for (size_t i = 0; i < entry.regexps.size(); i++)
+            regexps->set(entry.regexps[i], 1);
+        int c;
+        // Pass trigger up to parents.
+        for (StdIntMap::iterator it = entry.parents->begin(); it != entry.parents->end(); ++it) {
+            int j = it->first;
+            const Entry& parent = entries_[j];
+            // Delay until all the children have succeeded.
+            if (parent.propagate_up_at_count > 1) {
+                if (count.has_index(j)) {
+                    c = count.get_existing(j) + 1;
+                    count.set_existing(j, c);
+                } else {
+                    c = 1;
+                    count.set_new(j, c);
+                }
+                if (c < parent.propagate_up_at_count)
+                    continue;
+            }
+            // Trigger the parent.
+            work.set(j, 1);
+        }
+    }
+}
+
+// Debugging help.
+void PrefilterTree::PrintPrefilter(int regexpid) {
+    LOG(ERROR) << DebugNodeString(prefilter_vec_[regexpid]);
+}
+
+void PrefilterTree::PrintDebugInfo(NodeMap* nodes) {
+    LOG(ERROR) << "#Unique Atoms: " << atom_index_to_id_.size();
+    LOG(ERROR) << "#Unique Nodes: " << entries_.size();
+
+    for (size_t i = 0; i < entries_.size(); i++) {
+        StdIntMap* parents = entries_[i].parents;
+        const std::vector<int>& regexps = entries_[i].regexps;
+        LOG(ERROR) << "EntryId: " << i << " N: " << parents->size() << " R: " << regexps.size();
+        for (StdIntMap::iterator it = parents->begin(); it != parents->end(); ++it)
+            LOG(ERROR) << it->first;
+    }
+    LOG(ERROR) << "Map:";
+    for (std::map<std::string, Prefilter*>::const_iterator iter = nodes->begin();
+         iter != nodes->end(); ++iter)
+        LOG(ERROR) << "NodeId: " << (*iter).second->unique_id() << " Str: " << (*iter).first;
+}
+
+std::string PrefilterTree::DebugNodeString(Prefilter* node) const {
+    std::string node_string = "";
+    if (node->op() == Prefilter::ATOM) {
+        DCHECK(!node->atom().empty());
+        node_string += node->atom();
+    } else {
+        // Adding the operation disambiguates AND and OR nodes.
+        node_string += node->op() == Prefilter::AND ? "AND" : "OR";
+        node_string += "(";
+        for (size_t i = 0; i < node->subs()->size(); i++) {
+            if (i > 0)
+                node_string += ',';
+            node_string += StringPrintf("%d", (*node->subs())[i]->unique_id());
+            node_string += ":";
+            node_string += DebugNodeString((*node->subs())[i]);
+        }
+        node_string += ")";
+    }
+    return node_string;
+}
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/prog.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/prog.cpp
new file mode 100644
index 0000000000..c72dab2e9c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/prog.cpp
@@ -0,0 +1,1151 @@
+// Copyright 2007 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Compiled regular expression representation.
+// Tested by compile_test.cc
+
+#include "prog.h"
+
+#if defined(__AVX2__)
+#include <immintrin.h>
+#ifdef _MSC_VER
+#include <intrin.h>
+#endif
+#endif
+#include <stdint.h>
+#include <string.h>
+
+#include <algorithm>
+#include <memory>
+#include <utility>
+
+#include "bitmap256.h"
+#include "logging.h"
+#include "stringpiece.h"
+#include "strutil.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+// Constructors per Inst opcode
+
+void Prog::Inst::InitAlt(uint32_t out, uint32_t out1) {
+    DCHECK_EQ(out_opcode_, 0);
+    set_out_opcode(out, kInstAlt);
+    out1_ = out1;
+}
+
+void Prog::Inst::InitByteRange(int lo, int hi, int foldcase, uint32_t out) {
+    DCHECK_EQ(out_opcode_, 0);
+    set_out_opcode(out, kInstByteRange);
+    lo_ = lo & 0xFF;
+    hi_ = hi & 0xFF;
+    hint_foldcase_ = foldcase & 1;
+}
+
+void Prog::Inst::InitCapture(int cap, uint32_t out) {
+    DCHECK_EQ(out_opcode_, 0);
+    set_out_opcode(out, kInstCapture);
+    cap_ = cap;
+}
+
+void Prog::Inst::InitEmptyWidth(EmptyOp empty, uint32_t out) {
+    DCHECK_EQ(out_opcode_, 0);
+    set_out_opcode(out, kInstEmptyWidth);
+    empty_ = empty;
+}
+
+void Prog::Inst::InitMatch(int32_t id) {
+    DCHECK_EQ(out_opcode_, 0);
+    set_opcode(kInstMatch);
+    match_id_ = id;
+}
+
+void Prog::Inst::InitNop(uint32_t out) {
+    DCHECK_EQ(out_opcode_, 0);
+    set_opcode(kInstNop);
+}
+
+void Prog::Inst::InitFail() {
+    DCHECK_EQ(out_opcode_, 0);
+    set_opcode(kInstFail);
+}
+
+std::string Prog::Inst::Dump() {
+    switch (opcode()) {
+    default:
+        return StringPrintf("opcode %d", static_cast<int>(opcode()));
+
+    case kInstAlt:
+        return StringPrintf("alt -> %d | %d", out(), out1_);
+
+    case kInstAltMatch:
+        return StringPrintf("altmatch -> %d | %d", out(), out1_);
+
+    case kInstByteRange:
+        return StringPrintf(
+            "byte%s [%02x-%02x] %d -> %d", foldcase() ? "/i" : "", lo_, hi_, hint(), out());
+
+    case kInstCapture:
+        return StringPrintf("capture %d -> %d", cap_, out());
+
+    case kInstEmptyWidth:
+        return StringPrintf("emptywidth %#x -> %d", static_cast<int>(empty_), out());
+
+    case kInstMatch:
+        return StringPrintf("match! %d", match_id());
+
+    case kInstNop:
+        return StringPrintf("nop -> %d", out());
+
+    case kInstFail:
+        return StringPrintf("fail");
+    }
+}
+
+Prog::Prog()
+    : anchor_start_(false), anchor_end_(false), reversed_(false), did_flatten_(false),
+      did_onepass_(false), start_(0), start_unanchored_(0), size_(0), bytemap_range_(0),
+      prefix_foldcase_(false), prefix_size_(0), list_count_(0), bit_state_text_max_size_(0),
+      dfa_mem_(0), dfa_first_(NULL), dfa_longest_(NULL) {}
+
+Prog::~Prog() {
+    DeleteDFA(dfa_longest_);
+    DeleteDFA(dfa_first_);
+    if (prefix_foldcase_)
+        delete[] prefix_dfa_;
+}
+
+typedef SparseSet Workq;
+
+static inline void AddToQueue(Workq* q, int id) {
+    if (id != 0)
+        q->insert(id);
+}
+
+static std::string ProgToString(Prog* prog, Workq* q) {
+    std::string s;
+    for (Workq::iterator i = q->begin(); i != q->end(); ++i) {
+        int id = *i;
+        Prog::Inst* ip = prog->inst(id);
+        s += StringPrintf("%d. %s\n", id, ip->Dump().c_str());
+        AddToQueue(q, ip->out());
+        if (ip->opcode() == kInstAlt || ip->opcode() == kInstAltMatch)
+            AddToQueue(q, ip->out1());
+    }
+    return s;
+}
+
+static std::string FlattenedProgToString(Prog* prog, int start) {
+    std::string s;
+    for (int id = start; id < prog->size(); id++) {
+        Prog::Inst* ip = prog->inst(id);
+        if (ip->last())
+            s += StringPrintf("%d. %s\n", id, ip->Dump().c_str());
+        else
+            s += StringPrintf("%d+ %s\n", id, ip->Dump().c_str());
+    }
+    return s;
+}
+
+std::string Prog::Dump() {
+    if (did_flatten_)
+        return FlattenedProgToString(this, start_);
+
+    Workq q(size_);
+    AddToQueue(&q, start_);
+    return ProgToString(this, &q);
+}
+
+std::string Prog::DumpUnanchored() {
+    if (did_flatten_)
+        return FlattenedProgToString(this, start_unanchored_);
+
+    Workq q(size_);
+    AddToQueue(&q, start_unanchored_);
+    return ProgToString(this, &q);
+}
+
+std::string Prog::DumpByteMap() {
+    std::string map;
+    for (int c = 0; c < 256; c++) {
+        int b = bytemap_[c];
+        int lo = c;
+        while (c < 256 - 1 && bytemap_[c + 1] == b)
+            c++;
+        int hi = c;
+        map += StringPrintf("[%02x-%02x] -> %d\n", lo, hi, b);
+    }
+    return map;
+}
+
+// Is ip a guaranteed match at end of text, perhaps after some capturing?
+static bool IsMatch(Prog* prog, Prog::Inst* ip) {
+    for (;;) {
+        switch (ip->opcode()) {
+        default:
+            LOG(DFATAL) << "Unexpected opcode in IsMatch: " << ip->opcode();
+            return false;
+
+        case kInstAlt:
+        case kInstAltMatch:
+        case kInstByteRange:
+        case kInstFail:
+        case kInstEmptyWidth:
+            return false;
+
+        case kInstCapture:
+        case kInstNop:
+            ip = prog->inst(ip->out());
+            break;
+
+        case kInstMatch:
+            return true;
+        }
+    }
+}
+
+// Peep-hole optimizer.
+void Prog::Optimize() {
+    Workq q(size_);
+
+    // Eliminate nops.  Most are taken out during compilation
+    // but a few are hard to avoid.
+    q.clear();
+    AddToQueue(&q, start_);
+    for (Workq::iterator i = q.begin(); i != q.end(); ++i) {
+        int id = *i;
+
+        Inst* ip = inst(id);
+        int j = ip->out();
+        Inst* jp;
+        while (j != 0 && (jp = inst(j))->opcode() == kInstNop) {
+            j = jp->out();
+        }
+        ip->set_out(j);
+        AddToQueue(&q, ip->out());
+
+        if (ip->opcode() == kInstAlt) {
+            j = ip->out1();
+            while (j != 0 && (jp = inst(j))->opcode() == kInstNop) {
+                j = jp->out();
+            }
+            ip->out1_ = j;
+            AddToQueue(&q, ip->out1());
+        }
+    }
+
+    // Insert kInstAltMatch instructions
+    // Look for
+    //   ip: Alt -> j | k
+    //	  j: ByteRange [00-FF] -> ip
+    //    k: Match
+    // or the reverse (the above is the greedy one).
+    // Rewrite Alt to AltMatch.
+    q.clear();
+    AddToQueue(&q, start_);
+    for (Workq::iterator i = q.begin(); i != q.end(); ++i) {
+        int id = *i;
+        Inst* ip = inst(id);
+        AddToQueue(&q, ip->out());
+        if (ip->opcode() == kInstAlt)
+            AddToQueue(&q, ip->out1());
+
+        if (ip->opcode() == kInstAlt) {
+            Inst* j = inst(ip->out());
+            Inst* k = inst(ip->out1());
+            if (j->opcode() == kInstByteRange && j->out() == id && j->lo() == 0x00 &&
+                j->hi() == 0xFF && IsMatch(this, k)) {
+                ip->set_opcode(kInstAltMatch);
+                continue;
+            }
+            if (IsMatch(this, j) && k->opcode() == kInstByteRange && k->out() == id &&
+                k->lo() == 0x00 && k->hi() == 0xFF) {
+                ip->set_opcode(kInstAltMatch);
+            }
+        }
+    }
+}
+
+uint32_t Prog::EmptyFlags(const StringPiece& text, const char* p) {
+    int flags = 0;
+
+    // ^ and \A
+    if (p == text.data())
+        flags |= kEmptyBeginText | kEmptyBeginLine;
+    else if (p[-1] == '\n')
+        flags |= kEmptyBeginLine;
+
+    // $ and \z
+    if (p == text.data() + text.size())
+        flags |= kEmptyEndText | kEmptyEndLine;
+    else if (p < text.data() + text.size() && p[0] == '\n')
+        flags |= kEmptyEndLine;
+
+    // \b and \B
+    if (p == text.data() && p == text.data() + text.size()) {
+        // no word boundary here
+    } else if (p == text.data()) {
+        if (IsWordChar(p[0]))
+            flags |= kEmptyWordBoundary;
+    } else if (p == text.data() + text.size()) {
+        if (IsWordChar(p[-1]))
+            flags |= kEmptyWordBoundary;
+    } else {
+        if (IsWordChar(p[-1]) != IsWordChar(p[0]))
+            flags |= kEmptyWordBoundary;
+    }
+    if (!(flags & kEmptyWordBoundary))
+        flags |= kEmptyNonWordBoundary;
+
+    return flags;
+}
+
+// ByteMapBuilder implements a coloring algorithm.
+//
+// The first phase is a series of "mark and merge" batches: we mark one or more
+// [lo-hi] ranges, then merge them into our internal state. Batching is not for
+// performance; rather, it means that the ranges are treated indistinguishably.
+//
+// Internally, the ranges are represented using a bitmap that stores the splits
+// and a vector that stores the colors; both of them are indexed by the ranges'
+// last bytes. Thus, in order to merge a [lo-hi] range, we split at lo-1 and at
+// hi (if not already split), then recolor each range in between. The color map
+// (i.e. from the old color to the new color) is maintained for the lifetime of
+// the batch and so underpins this somewhat obscure approach to set operations.
+//
+// The second phase builds the bytemap from our internal state: we recolor each
+// range, then store the new color (which is now the byte class) in each of the
+// corresponding array elements. Finally, we output the number of byte classes.
+class ByteMapBuilder {
+public:
+    ByteMapBuilder() {
+        // Initial state: the [0-255] range has color 256.
+        // This will avoid problems during the second phase,
+        // in which we assign byte classes numbered from 0.
+        splits_.Set(255);
+        colors_[255] = 256;
+        nextcolor_ = 257;
+    }
+
+    void Mark(int lo, int hi);
+    void Merge();
+    void Build(uint8_t* bytemap, int* bytemap_range);
+
+private:
+    int Recolor(int oldcolor);
+
+    Bitmap256 splits_;
+    int colors_[256];
+    int nextcolor_;
+    std::vector<std::pair<int, int>> colormap_;
+    std::vector<std::pair<int, int>> ranges_;
+
+    ByteMapBuilder(const ByteMapBuilder&) = delete;
+    ByteMapBuilder& operator=(const ByteMapBuilder&) = delete;
+};
+
+void ByteMapBuilder::Mark(int lo, int hi) {
+    DCHECK_GE(lo, 0);
+    DCHECK_GE(hi, 0);
+    DCHECK_LE(lo, 255);
+    DCHECK_LE(hi, 255);
+    DCHECK_LE(lo, hi);
+
+    // Ignore any [0-255] ranges. They cause us to recolor every range, which
+    // has no effect on the eventual result and is therefore a waste of time.
+    if (lo == 0 && hi == 255)
+        return;
+
+    ranges_.emplace_back(lo, hi);
+}
+
+void ByteMapBuilder::Merge() {
+    for (std::vector<std::pair<int, int>>::const_iterator it = ranges_.begin(); it != ranges_.end();
+         ++it) {
+        int lo = it->first - 1;
+        int hi = it->second;
+
+        if (0 <= lo && !splits_.Test(lo)) {
+            splits_.Set(lo);
+            int next = splits_.FindNextSetBit(lo + 1);
+            colors_[lo] = colors_[next];
+        }
+        if (!splits_.Test(hi)) {
+            splits_.Set(hi);
+            int next = splits_.FindNextSetBit(hi + 1);
+            colors_[hi] = colors_[next];
+        }
+
+        int c = lo + 1;
+        while (c < 256) {
+            int next = splits_.FindNextSetBit(c);
+            colors_[next] = Recolor(colors_[next]);
+            if (next == hi)
+                break;
+            c = next + 1;
+        }
+    }
+    colormap_.clear();
+    ranges_.clear();
+}
+
+void ByteMapBuilder::Build(uint8_t* bytemap, int* bytemap_range) {
+    // Assign byte classes numbered from 0.
+    nextcolor_ = 0;
+
+    int c = 0;
+    while (c < 256) {
+        int next = splits_.FindNextSetBit(c);
+        uint8_t b = static_cast<uint8_t>(Recolor(colors_[next]));
+        while (c <= next) {
+            bytemap[c] = b;
+            c++;
+        }
+    }
+
+    *bytemap_range = nextcolor_;
+}
+
+int ByteMapBuilder::Recolor(int oldcolor) {
+    // Yes, this is a linear search. There can be at most 256
+    // colors and there will typically be far fewer than that.
+    // Also, we need to consider keys *and* values in order to
+    // avoid recoloring a given range more than once per batch.
+    std::vector<std::pair<int, int>>::const_iterator it = std::find_if(
+        colormap_.begin(), colormap_.end(), [=](const std::pair<int, int>& kv) -> bool {
+            return kv.first == oldcolor || kv.second == oldcolor;
+        });
+    if (it != colormap_.end())
+        return it->second;
+    int newcolor = nextcolor_;
+    nextcolor_++;
+    colormap_.emplace_back(oldcolor, newcolor);
+    return newcolor;
+}
+
+void Prog::ComputeByteMap() {
+    // Fill in bytemap with byte classes for the program.
+    // Ranges of bytes that are treated indistinguishably
+    // will be mapped to a single byte class.
+    ByteMapBuilder builder;
+
+    // Don't repeat the work for ^ and $.
+    bool marked_line_boundaries = false;
+    // Don't repeat the work for \b and \B.
+    bool marked_word_boundaries = false;
+
+    for (int id = 0; id < size(); id++) {
+        Inst* ip = inst(id);
+        if (ip->opcode() == kInstByteRange) {
+            int lo = ip->lo();
+            int hi = ip->hi();
+            builder.Mark(lo, hi);
+            if (ip->foldcase() && lo <= 'z' && hi >= 'a') {
+                int foldlo = lo;
+                int foldhi = hi;
+                if (foldlo < 'a')
+                    foldlo = 'a';
+                if (foldhi > 'z')
+                    foldhi = 'z';
+                if (foldlo <= foldhi) {
+                    foldlo += 'A' - 'a';
+                    foldhi += 'A' - 'a';
+                    builder.Mark(foldlo, foldhi);
+                }
+            }
+            // If this Inst is not the last Inst in its list AND the next Inst is
+            // also a ByteRange AND the Insts have the same out, defer the merge.
+            if (!ip->last() && inst(id + 1)->opcode() == kInstByteRange &&
+                ip->out() == inst(id + 1)->out())
+                continue;
+            builder.Merge();
+        } else if (ip->opcode() == kInstEmptyWidth) {
+            if (ip->empty() & (kEmptyBeginLine | kEmptyEndLine) && !marked_line_boundaries) {
+                builder.Mark('\n', '\n');
+                builder.Merge();
+                marked_line_boundaries = true;
+            }
+            if (ip->empty() & (kEmptyWordBoundary | kEmptyNonWordBoundary) &&
+                !marked_word_boundaries) {
+                // We require two batches here: the first for ranges that are word
+                // characters, the second for ranges that are not word characters.
+                for (bool isword : {true, false}) {
+                    int j;
+                    for (int i = 0; i < 256; i = j) {
+                        for (j = i + 1; j < 256 && Prog::IsWordChar(static_cast<uint8_t>(i)) ==
+                                                       Prog::IsWordChar(static_cast<uint8_t>(j));
+                             j++)
+                            ;
+                        if (Prog::IsWordChar(static_cast<uint8_t>(i)) == isword)
+                            builder.Mark(i, j - 1);
+                    }
+                    builder.Merge();
+                }
+                marked_word_boundaries = true;
+            }
+        }
+    }
+
+    builder.Build(bytemap_, &bytemap_range_);
+
+    if ((0)) { // For debugging, use trivial bytemap.
+        LOG(ERROR) << "Using trivial bytemap.";
+        for (int i = 0; i < 256; i++)
+            bytemap_[i] = static_cast<uint8_t>(i);
+        bytemap_range_ = 256;
+    }
+}
+
+// Prog::Flatten() implements a graph rewriting algorithm.
+//
+// The overall process is similar to epsilon removal, but retains some epsilon
+// transitions: those from Capture and EmptyWidth instructions; and those from
+// nullable subexpressions. (The latter avoids quadratic blowup in transitions
+// in the worst case.) It might be best thought of as Alt instruction elision.
+//
+// In conceptual terms, it divides the Prog into "trees" of instructions, then
+// traverses the "trees" in order to produce "lists" of instructions. A "tree"
+// is one or more instructions that grow from one "root" instruction to one or
+// more "leaf" instructions; if a "tree" has exactly one instruction, then the
+// "root" is also the "leaf". In most cases, a "root" is the successor of some
+// "leaf" (i.e. the "leaf" instruction's out() returns the "root" instruction)
+// and is considered a "successor root". A "leaf" can be a ByteRange, Capture,
+// EmptyWidth or Match instruction. However, this is insufficient for handling
+// nested nullable subexpressions correctly, so in some cases, a "root" is the
+// dominator of the instructions reachable from some "successor root" (i.e. it
+// has an unreachable predecessor) and is considered a "dominator root". Since
+// only Alt instructions can be "dominator roots" (other instructions would be
+// "leaves"), only Alt instructions are required to be marked as predecessors.
+//
+// Dividing the Prog into "trees" comprises two passes: marking the "successor
+// roots" and the predecessors; and marking the "dominator roots". Sorting the
+// "successor roots" by their bytecode offsets enables iteration in order from
+// greatest to least during the second pass; by working backwards in this case
+// and flooding the graph no further than "leaves" and already marked "roots",
+// it becomes possible to mark "dominator roots" without doing excessive work.
+//
+// Traversing the "trees" is just iterating over the "roots" in order of their
+// marking and flooding the graph no further than "leaves" and "roots". When a
+// "leaf" is reached, the instruction is copied with its successor remapped to
+// its "root" number. When a "root" is reached, a Nop instruction is generated
+// with its successor remapped similarly. As each "list" is produced, its last
+// instruction is marked as such. After all of the "lists" have been produced,
+// a pass over their instructions remaps their successors to bytecode offsets.
+void Prog::Flatten() {
+    if (did_flatten_)
+        return;
+    did_flatten_ = true;
+
+    // Scratch structures. It's important that these are reused by functions
+    // that we call in loops because they would thrash the heap otherwise.
+    SparseSet reachable(size());
+    std::vector<int> stk;
+    stk.reserve(size());
+
+    // First pass: Marks "successor roots" and predecessors.
+    // Builds the mapping from inst-ids to root-ids.
+    SparseArray<int> rootmap(size());
+    SparseArray<int> predmap(size());
+    std::vector<std::vector<int>> predvec;
+    MarkSuccessors(&rootmap, &predmap, &predvec, &reachable, &stk);
+
+    // Second pass: Marks "dominator roots".
+    SparseArray<int> sorted(rootmap);
+    std::sort(sorted.begin(), sorted.end(), sorted.less);
+    for (SparseArray<int>::const_iterator i = sorted.end() - 1; i != sorted.begin(); --i) {
+        if (i->index() != start_unanchored() && i->index() != start())
+            MarkDominator(i->index(), &rootmap, &predmap, &predvec, &reachable, &stk);
+    }
+
+    // Third pass: Emits "lists". Remaps outs to root-ids.
+    // Builds the mapping from root-ids to flat-ids.
+    std::vector<int> flatmap(rootmap.size());
+    std::vector<Inst> flat;
+    flat.reserve(size());
+    for (SparseArray<int>::const_iterator i = rootmap.begin(); i != rootmap.end(); ++i) {
+        flatmap[i->value()] = static_cast<int>(flat.size());
+        EmitList(i->index(), &rootmap, &flat, &reachable, &stk);
+        flat.back().set_last();
+        // We have the bounds of the "list", so this is the
+        // most convenient point at which to compute hints.
+        ComputeHints(&flat, flatmap[i->value()], static_cast<int>(flat.size()));
+    }
+
+    list_count_ = static_cast<int>(flatmap.size());
+    for (int i = 0; i < kNumInst; i++)
+        inst_count_[i] = 0;
+
+    // Fourth pass: Remaps outs to flat-ids.
+    // Counts instructions by opcode.
+    for (int id = 0; id < static_cast<int>(flat.size()); id++) {
+        Inst* ip = &flat[id];
+        if (ip->opcode() != kInstAltMatch) // handled in EmitList()
+            ip->set_out(flatmap[ip->out()]);
+        inst_count_[ip->opcode()]++;
+    }
+
+#if !defined(NDEBUG)
+    // Address a `-Wunused-but-set-variable' warning from Clang 13.x.
+    size_t total = 0;
+    for (int i = 0; i < kNumInst; i++)
+        total += inst_count_[i];
+    CHECK_EQ(total, flat.size());
+#endif
+
+    // Remap start_unanchored and start.
+    if (start_unanchored() == 0) {
+        DCHECK_EQ(start(), 0);
+    } else if (start_unanchored() == start()) {
+        set_start_unanchored(flatmap[1]);
+        set_start(flatmap[1]);
+    } else {
+        set_start_unanchored(flatmap[1]);
+        set_start(flatmap[2]);
+    }
+
+    // Finally, replace the old instructions with the new instructions.
+    size_ = static_cast<int>(flat.size());
+    inst_ = PODArray<Inst>(size_);
+    memmove(inst_.data(), flat.data(), size_ * sizeof inst_[0]);
+
+    // Populate the list heads for BitState.
+    // 512 instructions limits the memory footprint to 1KiB.
+    if (size_ <= 512) {
+        list_heads_ = PODArray<uint16_t>(size_);
+        // 0xFF makes it more obvious if we try to look up a non-head.
+        memset(list_heads_.data(), 0xFF, size_ * sizeof list_heads_[0]);
+        for (int i = 0; i < list_count_; ++i)
+            list_heads_[flatmap[i]] = i;
+    }
+
+    // BitState allocates a bitmap of size list_count_ * (text.size()+1)
+    // for tracking pairs of possibilities that it has already explored.
+    const size_t kBitStateBitmapMaxSize = 256 * 1024; // max size in bits
+    bit_state_text_max_size_ = kBitStateBitmapMaxSize / list_count_ - 1;
+}
+
+void Prog::MarkSuccessors(SparseArray<int>* rootmap, SparseArray<int>* predmap,
+    std::vector<std::vector<int>>* predvec, SparseSet* reachable, std::vector<int>* stk) {
+    // Mark the kInstFail instruction.
+    rootmap->set_new(0, rootmap->size());
+
+    // Mark the start_unanchored and start instructions.
+    if (!rootmap->has_index(start_unanchored()))
+        rootmap->set_new(start_unanchored(), rootmap->size());
+    if (!rootmap->has_index(start()))
+        rootmap->set_new(start(), rootmap->size());
+
+    reachable->clear();
+    stk->clear();
+    stk->push_back(start_unanchored());
+    while (!stk->empty()) {
+        int id = stk->back();
+        stk->pop_back();
+    Loop:
+        if (reachable->contains(id))
+            continue;
+        reachable->insert_new(id);
+
+        Inst* ip = inst(id);
+        switch (ip->opcode()) {
+        default:
+            LOG(DFATAL) << "unhandled opcode: " << ip->opcode();
+            break;
+
+        case kInstAltMatch:
+        case kInstAlt:
+            // Mark this instruction as a predecessor of each out.
+            for (int out : {ip->out(), ip->out1()}) {
+                if (!predmap->has_index(out)) {
+                    predmap->set_new(out, static_cast<int>(predvec->size()));
+                    predvec->emplace_back();
+                }
+                (*predvec)[predmap->get_existing(out)].emplace_back(id);
+            }
+            stk->push_back(ip->out1());
+            id = ip->out();
+            goto Loop;
+
+        case kInstByteRange:
+        case kInstCapture:
+        case kInstEmptyWidth:
+            // Mark the out of this instruction as a "root".
+            if (!rootmap->has_index(ip->out()))
+                rootmap->set_new(ip->out(), rootmap->size());
+            id = ip->out();
+            goto Loop;
+
+        case kInstNop:
+            id = ip->out();
+            goto Loop;
+
+        case kInstMatch:
+        case kInstFail:
+            break;
+        }
+    }
+}
+
+void Prog::MarkDominator(int root, SparseArray<int>* rootmap, SparseArray<int>* predmap,
+    std::vector<std::vector<int>>* predvec, SparseSet* reachable, std::vector<int>* stk) {
+    reachable->clear();
+    stk->clear();
+    stk->push_back(root);
+    while (!stk->empty()) {
+        int id = stk->back();
+        stk->pop_back();
+    Loop:
+        if (reachable->contains(id))
+            continue;
+        reachable->insert_new(id);
+
+        if (id != root && rootmap->has_index(id)) {
+            // We reached another "tree" via epsilon transition.
+            continue;
+        }
+
+        Inst* ip = inst(id);
+        switch (ip->opcode()) {
+        default:
+            LOG(DFATAL) << "unhandled opcode: " << ip->opcode();
+            break;
+
+        case kInstAltMatch:
+        case kInstAlt:
+            stk->push_back(ip->out1());
+            id = ip->out();
+            goto Loop;
+
+        case kInstByteRange:
+        case kInstCapture:
+        case kInstEmptyWidth:
+            break;
+
+        case kInstNop:
+            id = ip->out();
+            goto Loop;
+
+        case kInstMatch:
+        case kInstFail:
+            break;
+        }
+    }
+
+    for (SparseSet::const_iterator i = reachable->begin(); i != reachable->end(); ++i) {
+        int id = *i;
+        if (predmap->has_index(id)) {
+            for (int pred : (*predvec)[predmap->get_existing(id)]) {
+                if (!reachable->contains(pred)) {
+                    // id has a predecessor that cannot be reached from root!
+                    // Therefore, id must be a "root" too - mark it as such.
+                    if (!rootmap->has_index(id))
+                        rootmap->set_new(id, rootmap->size());
+                }
+            }
+        }
+    }
+}
+
+void Prog::EmitList(int root, SparseArray<int>* rootmap, std::vector<Inst>* flat,
+    SparseSet* reachable, std::vector<int>* stk) {
+    reachable->clear();
+    stk->clear();
+    stk->push_back(root);
+    while (!stk->empty()) {
+        int id = stk->back();
+        stk->pop_back();
+    Loop:
+        if (reachable->contains(id))
+            continue;
+        reachable->insert_new(id);
+
+        if (id != root && rootmap->has_index(id)) {
+            // We reached another "tree" via epsilon transition. Emit a kInstNop
+            // instruction so that the Prog does not become quadratically larger.
+            flat->emplace_back();
+            flat->back().set_opcode(kInstNop);
+            flat->back().set_out(rootmap->get_existing(id));
+            continue;
+        }
+
+        Inst* ip = inst(id);
+        switch (ip->opcode()) {
+        default:
+            LOG(DFATAL) << "unhandled opcode: " << ip->opcode();
+            break;
+
+        case kInstAltMatch:
+            flat->emplace_back();
+            flat->back().set_opcode(kInstAltMatch);
+            flat->back().set_out(static_cast<int>(flat->size()));
+            flat->back().out1_ = static_cast<uint32_t>(flat->size()) + 1;
+            FALLTHROUGH_INTENDED;
+
+        case kInstAlt:
+            stk->push_back(ip->out1());
+            id = ip->out();
+            goto Loop;
+
+        case kInstByteRange:
+        case kInstCapture:
+        case kInstEmptyWidth:
+            flat->emplace_back();
+            memmove(&flat->back(), ip, sizeof *ip);
+            flat->back().set_out(rootmap->get_existing(ip->out()));
+            break;
+
+        case kInstNop:
+            id = ip->out();
+            goto Loop;
+
+        case kInstMatch:
+        case kInstFail:
+            flat->emplace_back();
+            memmove(&flat->back(), ip, sizeof *ip);
+            break;
+        }
+    }
+}
+
+// For each ByteRange instruction in [begin, end), computes a hint to execution
+// engines: the delta to the next instruction (in flat) worth exploring iff the
+// current instruction matched.
+//
+// Implements a coloring algorithm related to ByteMapBuilder, but in this case,
+// colors are instructions and recoloring ranges precisely identifies conflicts
+// between instructions. Iterating backwards over [begin, end) is guaranteed to
+// identify the nearest conflict (if any) with only linear complexity.
+void Prog::ComputeHints(std::vector<Inst>* flat, int begin, int end) {
+    Bitmap256 splits;
+    int colors[256];
+
+    bool dirty = false;
+    for (int id = end; id >= begin; --id) {
+        if (id == end || (*flat)[id].opcode() != kInstByteRange) {
+            if (dirty) {
+                dirty = false;
+                splits.Clear();
+            }
+            splits.Set(255);
+            colors[255] = id;
+            // At this point, the [0-255] range is colored with id.
+            // Thus, hints cannot point beyond id; and if id == end,
+            // hints that would have pointed to id will be 0 instead.
+            continue;
+        }
+        dirty = true;
+
+        // We recolor the [lo-hi] range with id. Note that first ratchets backwards
+        // from end to the nearest conflict (if any) during recoloring.
+        int first = end;
+        auto Recolor = [&](int lo, int hi) {
+            // Like ByteMapBuilder, we split at lo-1 and at hi.
+            --lo;
+
+            if (0 <= lo && !splits.Test(lo)) {
+                splits.Set(lo);
+                int next = splits.FindNextSetBit(lo + 1);
+                colors[lo] = colors[next];
+            }
+            if (!splits.Test(hi)) {
+                splits.Set(hi);
+                int next = splits.FindNextSetBit(hi + 1);
+                colors[hi] = colors[next];
+            }
+
+            int c = lo + 1;
+            while (c < 256) {
+                int next = splits.FindNextSetBit(c);
+                CHECK(next != -1);
+                // Ratchet backwards...
+                first = std::min(first, colors[next]);
+                // Recolor with id - because it's the new nearest conflict!
+                colors[next] = id;
+                if (next == hi)
+                    break;
+                c = next + 1;
+            }
+        };
+
+        Inst* ip = &(*flat)[id];
+        int lo = ip->lo();
+        int hi = ip->hi();
+        Recolor(lo, hi);
+        if (ip->foldcase() && lo <= 'z' && hi >= 'a') {
+            int foldlo = lo;
+            int foldhi = hi;
+            if (foldlo < 'a')
+                foldlo = 'a';
+            if (foldhi > 'z')
+                foldhi = 'z';
+            if (foldlo <= foldhi) {
+                foldlo += 'A' - 'a';
+                foldhi += 'A' - 'a';
+                Recolor(foldlo, foldhi);
+            }
+        }
+
+        if (first != end) {
+            uint16_t hint = static_cast<uint16_t>(std::min(first - id, 32767));
+            ip->hint_foldcase_ |= hint << 1;
+        }
+    }
+}
+
+// The final state will always be this, which frees up a register for the hot
+// loop and thus avoids the spilling that can occur when building with Clang.
+static const size_t kShiftDFAFinal = 9;
+
+// This function takes the prefix as std::string (i.e. not const std::string&
+// as normal) because it's going to clobber it, so a temporary is convenient.
+static uint64_t* BuildShiftDFA(std::string prefix) {
+    // This constant is for convenience now and also for correctness later when
+    // we clobber the prefix, but still need to know how long it was initially.
+    const size_t size = prefix.size();
+
+    // Construct the NFA.
+    // The table is indexed by input byte; each element is a bitfield of states
+    // reachable by the input byte. Given a bitfield of the current states, the
+    // bitfield of states reachable from those is - for this specific purpose -
+    // always ((ncurr << 1) | 1). Intersecting the reachability bitfields gives
+    // the bitfield of the next states reached by stepping over the input byte.
+    // Credits for this technique: the Hyperscan paper by Geoff Langdale et al.
+    uint16_t nfa[256]{};
+    for (size_t i = 0; i < size; ++i) {
+        uint8_t b = prefix[i];
+        nfa[b] |= 1 << (i + 1);
+    }
+    // This is the `\C*?` for unanchored search.
+    for (int b = 0; b < 256; ++b)
+        nfa[b] |= 1;
+
+    // This maps from DFA state to NFA states; the reverse mapping is used when
+    // recording transitions and gets implemented with plain old linear search.
+    // The "Shift DFA" technique limits this to ten states when using uint64_t;
+    // to allow for the initial state, we use at most nine bytes of the prefix.
+    // That same limit is also why uint16_t is sufficient for the NFA bitfield.
+    uint16_t states[kShiftDFAFinal + 1]{};
+    states[0] = 1;
+    for (size_t dcurr = 0; dcurr < size; ++dcurr) {
+        uint8_t b = prefix[dcurr];
+        uint16_t ncurr = states[dcurr];
+        uint16_t nnext = nfa[b] & ((ncurr << 1) | 1);
+        size_t dnext = dcurr + 1;
+        if (dnext == size)
+            dnext = kShiftDFAFinal;
+        states[dnext] = nnext;
+    }
+
+    // Sort and unique the bytes of the prefix to avoid repeating work while we
+    // record transitions. This clobbers the prefix, but it's no longer needed.
+    std::sort(prefix.begin(), prefix.end());
+    prefix.erase(std::unique(prefix.begin(), prefix.end()), prefix.end());
+
+    // Construct the DFA.
+    // The table is indexed by input byte; each element is effectively a packed
+    // array of uint6_t; each array value will be multiplied by six in order to
+    // avoid having to do so later in the hot loop as well as masking/shifting.
+    // Credits for this technique: "Shift-based DFAs" on GitHub by Per Vognsen.
+    uint64_t* dfa = new uint64_t[256]{};
+    // Record a transition from each state for each of the bytes of the prefix.
+    // Note that all other input bytes go back to the initial state by default.
+    for (size_t dcurr = 0; dcurr < size; ++dcurr) {
+        for (uint8_t b : prefix) {
+            uint16_t ncurr = states[dcurr];
+            uint16_t nnext = nfa[b] & ((ncurr << 1) | 1);
+            size_t dnext = 0;
+            while (states[dnext] != nnext)
+                ++dnext;
+            dfa[b] |= static_cast<uint64_t>(dnext * 6) << (dcurr * 6);
+            // Convert ASCII letters to uppercase and record the extra transitions.
+            // Note that ASCII letters are guaranteed to be lowercase at this point
+            // because that's how the parser normalises them. #FunFact: 'k' and 's'
+            // match U+212A and U+017F, respectively, so they won't occur here when
+            // using UTF-8 encoding because the parser will emit character classes.
+            if ('a' <= b && b <= 'z') {
+                b -= 'a' - 'A';
+                dfa[b] |= static_cast<uint64_t>(dnext * 6) << (dcurr * 6);
+            }
+        }
+    }
+    // This lets the final state "saturate", which will matter for performance:
+    // in the hot loop, we check for a match only at the end of each iteration,
+    // so we must keep signalling the match until we get around to checking it.
+    for (int b = 0; b < 256; ++b)
+        dfa[b] |= static_cast<uint64_t>(kShiftDFAFinal * 6) << (kShiftDFAFinal * 6);
+
+    return dfa;
+}
+
+void Prog::ConfigurePrefixAccel(const std::string& prefix, bool prefix_foldcase) {
+    prefix_foldcase_ = prefix_foldcase;
+    prefix_size_ = prefix.size();
+    if (prefix_foldcase_) {
+        // Use PrefixAccel_ShiftDFA().
+        // ... and no more than nine bytes of the prefix. (See above for details.)
+        prefix_size_ = std::min(prefix_size_, kShiftDFAFinal);
+        prefix_dfa_ = BuildShiftDFA(prefix.substr(0, prefix_size_));
+    } else if (prefix_size_ != 1) {
+        // Use PrefixAccel_FrontAndBack().
+        prefix_front_ = prefix.front();
+        prefix_back_ = prefix.back();
+    } else {
+        // Use memchr(3).
+        prefix_front_ = prefix.front();
+    }
+}
+
+const void* Prog::PrefixAccel_ShiftDFA(const void* data, size_t size) {
+    if (size < prefix_size_)
+        return NULL;
+
+    uint64_t curr = 0;
+
+    // At the time of writing, rough benchmarks on a Broadwell machine showed
+    // that this unroll factor (i.e. eight) achieves a speedup factor of two.
+    if (size >= 8) {
+        const uint8_t* p = reinterpret_cast<const uint8_t*>(data);
+        const uint8_t* endp = p + (size & ~7);
+        do {
+            uint8_t b0 = p[0];
+            uint8_t b1 = p[1];
+            uint8_t b2 = p[2];
+            uint8_t b3 = p[3];
+            uint8_t b4 = p[4];
+            uint8_t b5 = p[5];
+            uint8_t b6 = p[6];
+            uint8_t b7 = p[7];
+
+            uint64_t next0 = prefix_dfa_[b0];
+            uint64_t next1 = prefix_dfa_[b1];
+            uint64_t next2 = prefix_dfa_[b2];
+            uint64_t next3 = prefix_dfa_[b3];
+            uint64_t next4 = prefix_dfa_[b4];
+            uint64_t next5 = prefix_dfa_[b5];
+            uint64_t next6 = prefix_dfa_[b6];
+            uint64_t next7 = prefix_dfa_[b7];
+
+            uint64_t curr0 = next0 >> (curr & 63);
+            uint64_t curr1 = next1 >> (curr0 & 63);
+            uint64_t curr2 = next2 >> (curr1 & 63);
+            uint64_t curr3 = next3 >> (curr2 & 63);
+            uint64_t curr4 = next4 >> (curr3 & 63);
+            uint64_t curr5 = next5 >> (curr4 & 63);
+            uint64_t curr6 = next6 >> (curr5 & 63);
+            uint64_t curr7 = next7 >> (curr6 & 63);
+
+            if ((curr7 & 63) == kShiftDFAFinal * 6) {
+                // At the time of writing, using the same masking subexpressions from
+                // the preceding lines caused Clang to clutter the hot loop computing
+                // them - even though they aren't actually needed for shifting! Hence
+                // these rewritten conditions, which achieve a speedup factor of two.
+                if (((curr7 - curr0) & 63) == 0)
+                    return p + 1 - prefix_size_;
+                if (((curr7 - curr1) & 63) == 0)
+                    return p + 2 - prefix_size_;
+                if (((curr7 - curr2) & 63) == 0)
+                    return p + 3 - prefix_size_;
+                if (((curr7 - curr3) & 63) == 0)
+                    return p + 4 - prefix_size_;
+                if (((curr7 - curr4) & 63) == 0)
+                    return p + 5 - prefix_size_;
+                if (((curr7 - curr5) & 63) == 0)
+                    return p + 6 - prefix_size_;
+                if (((curr7 - curr6) & 63) == 0)
+                    return p + 7 - prefix_size_;
+                if (((curr7 - curr7) & 63) == 0)
+                    return p + 8 - prefix_size_;
+            }
+
+            curr = curr7;
+            p += 8;
+        } while (p != endp);
+        data = p;
+        size = size & 7;
+    }
+
+    const uint8_t* p = reinterpret_cast<const uint8_t*>(data);
+    const uint8_t* endp = p + size;
+    while (p != endp) {
+        uint8_t b = *p++;
+        uint64_t next = prefix_dfa_[b];
+        curr = next >> (curr & 63);
+        if ((curr & 63) == kShiftDFAFinal * 6)
+            return p - prefix_size_;
+    }
+    return NULL;
+}
+
+#if defined(__AVX2__)
+// Finds the least significant non-zero bit in n.
+static int FindLSBSet(uint32_t n) {
+    DCHECK_NE(n, 0);
+#if defined(__GNUC__)
+    return __builtin_ctz(n);
+#elif defined(_MSC_VER) && (defined(_M_X64) || defined(_M_IX86))
+    unsigned long c;
+    _BitScanForward(&c, n);
+    return static_cast<int>(c);
+#else
+    int c = 31;
+    for (int shift = 1 << 4; shift != 0; shift >>= 1) {
+        uint32_t word = n << shift;
+        if (word != 0) {
+            n = word;
+            c -= shift;
+        }
+    }
+    return c;
+#endif
+}
+#endif
+
+const void* Prog::PrefixAccel_FrontAndBack(const void* data, size_t size) {
+    DCHECK_GE(prefix_size_, 2);
+    if (size < prefix_size_)
+        return NULL;
+    // Don't bother searching the last prefix_size_-1 bytes for prefix_front_.
+    // This also means that probing for prefix_back_ doesn't go out of bounds.
+    size -= prefix_size_ - 1;
+
+#if defined(__AVX2__)
+    // Use AVX2 to look for prefix_front_ and prefix_back_ 32 bytes at a time.
+    if (size >= sizeof(__m256i)) {
+        const __m256i* fp = reinterpret_cast<const __m256i*>(reinterpret_cast<const char*>(data));
+        const __m256i* bp = reinterpret_cast<const __m256i*>(
+            reinterpret_cast<const char*>(data) + prefix_size_ - 1);
+        const __m256i* endfp = fp + size / sizeof(__m256i);
+        const __m256i f_set1 = _mm256_set1_epi8(prefix_front_);
+        const __m256i b_set1 = _mm256_set1_epi8(prefix_back_);
+        do {
+            const __m256i f_loadu = _mm256_loadu_si256(fp++);
+            const __m256i b_loadu = _mm256_loadu_si256(bp++);
+            const __m256i f_cmpeq = _mm256_cmpeq_epi8(f_set1, f_loadu);
+            const __m256i b_cmpeq = _mm256_cmpeq_epi8(b_set1, b_loadu);
+            const int fb_testz = _mm256_testz_si256(f_cmpeq, b_cmpeq);
+            if (fb_testz == 0) { // ZF: 1 means zero, 0 means non-zero.
+                const __m256i fb_and = _mm256_and_si256(f_cmpeq, b_cmpeq);
+                const int fb_movemask = _mm256_movemask_epi8(fb_and);
+                const int fb_ctz = FindLSBSet(fb_movemask);
+                return reinterpret_cast<const char*>(fp - 1) + fb_ctz;
+            }
+        } while (fp != endfp);
+        data = fp;
+        size = size % sizeof(__m256i);
+    }
+#endif
+
+    const char* p0 = reinterpret_cast<const char*>(data);
+    for (const char* p = p0;; p++) {
+        DCHECK_GE(size, static_cast<size_t>(p - p0));
+        p = reinterpret_cast<const char*>(memchr(p, prefix_front_, size - (p - p0)));
+        if (p == NULL || p[prefix_size_ - 1] == prefix_back_)
+            return p;
+    }
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/re2.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/re2.cpp
new file mode 100644
index 0000000000..41068c0ceb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/re2.cpp
@@ -0,0 +1,1358 @@
+// Copyright 2003-2009 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Regular expression interface RE2.
+//
+// Originally the PCRE C++ wrapper, but adapted to use
+// the new automata-based regular expression engines.
+
+#include "re2.h"
+
+#include <assert.h>
+#include <ctype.h>
+#include <errno.h>
+#ifdef _MSC_VER
+#include <intrin.h>
+#endif
+#include <stdint.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include <algorithm>
+#include <atomic>
+#include <iterator>
+#include <mutex>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "logging.h"
+#include "prog.h"
+#include "regexp.h"
+#include "sparse_array.h"
+#include "strutil.h"
+#include "utf.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+// Controls the maximum count permitted by GlobalReplace(); -1 is unlimited.
+static int maximum_global_replace_count = -1;
+
+void RE2::FUZZING_ONLY_set_maximum_global_replace_count(int i) {
+    maximum_global_replace_count = i;
+}
+
+// Maximum number of args we can set
+static const int kMaxArgs = 16;
+static const int kVecSize = 1 + kMaxArgs;
+
+const int RE2::Options::kDefaultMaxMem; // initialized in re2.h
+
+RE2::Options::Options(RE2::CannedOptions opt)
+    : max_mem_(kDefaultMaxMem), encoding_(opt == RE2::Latin1 ? EncodingLatin1 : EncodingUTF8),
+      posix_syntax_(opt == RE2::POSIX), longest_match_(opt == RE2::POSIX),
+      log_errors_(opt != RE2::Quiet), literal_(false), never_nl_(false), dot_nl_(false),
+      never_capture_(false), case_sensitive_(true), perl_classes_(false), word_boundary_(false),
+      one_line_(false) {}
+
+// Empty objects for use as const references.
+// Statically allocating the storage and then
+// lazily constructing the objects (in a once
+// in RE2::Init()) avoids global constructors
+// and the false positives (thanks, Valgrind)
+// about memory leaks at program termination.
+struct EmptyStorage {
+    std::string empty_string;
+    std::map<std::string, int> empty_named_groups;
+    std::map<int, std::string> empty_group_names;
+};
+alignas(EmptyStorage) static char empty_storage[sizeof(EmptyStorage)];
+
+static inline std::string* empty_string() {
+    return &reinterpret_cast<EmptyStorage*>(empty_storage)->empty_string;
+}
+
+static inline std::map<std::string, int>* empty_named_groups() {
+    return &reinterpret_cast<EmptyStorage*>(empty_storage)->empty_named_groups;
+}
+
+static inline std::map<int, std::string>* empty_group_names() {
+    return &reinterpret_cast<EmptyStorage*>(empty_storage)->empty_group_names;
+}
+
+// Converts from Regexp error code to RE2 error code.
+// Maybe some day they will diverge.  In any event, this
+// hides the existence of Regexp from RE2 users.
+static RE2::ErrorCode RegexpErrorToRE2(RegexpStatusCode code) {
+    switch (code) {
+    case kRegexpSuccess:
+        return RE2::NoError;
+    case kRegexpInternalError:
+        return RE2::ErrorInternal;
+    case kRegexpBadEscape:
+        return RE2::ErrorBadEscape;
+    case kRegexpBadCharClass:
+        return RE2::ErrorBadCharClass;
+    case kRegexpBadCharRange:
+        return RE2::ErrorBadCharRange;
+    case kRegexpMissingBracket:
+        return RE2::ErrorMissingBracket;
+    case kRegexpMissingParen:
+        return RE2::ErrorMissingParen;
+    case kRegexpUnexpectedParen:
+        return RE2::ErrorUnexpectedParen;
+    case kRegexpTrailingBackslash:
+        return RE2::ErrorTrailingBackslash;
+    case kRegexpRepeatArgument:
+        return RE2::ErrorRepeatArgument;
+    case kRegexpRepeatSize:
+        return RE2::ErrorRepeatSize;
+    case kRegexpRepeatOp:
+        return RE2::ErrorRepeatOp;
+    case kRegexpBadPerlOp:
+        return RE2::ErrorBadPerlOp;
+    case kRegexpBadUTF8:
+        return RE2::ErrorBadUTF8;
+    case kRegexpBadNamedCapture:
+        return RE2::ErrorBadNamedCapture;
+    }
+    return RE2::ErrorInternal;
+}
+
+static std::string trunc(const StringPiece& pattern) {
+    if (pattern.size() < 100)
+        return std::string(pattern);
+    return std::string(pattern.substr(0, 100)) + "...";
+}
+
+RE2::RE2(const char* pattern) {
+    Init(pattern, DefaultOptions);
+}
+
+RE2::RE2(const std::string& pattern) {
+    Init(pattern, DefaultOptions);
+}
+
+RE2::RE2(const StringPiece& pattern) {
+    Init(pattern, DefaultOptions);
+}
+
+RE2::RE2(const StringPiece& pattern, const Options& options) {
+    Init(pattern, options);
+}
+
+int RE2::Options::ParseFlags() const {
+    int flags = Regexp::ClassNL;
+    switch (encoding()) {
+    default:
+        if (log_errors())
+            LOG(ERROR) << "Unknown encoding " << encoding();
+        break;
+    case RE2::Options::EncodingUTF8:
+        break;
+    case RE2::Options::EncodingLatin1:
+        flags |= Regexp::Latin1;
+        break;
+    }
+
+    if (!posix_syntax())
+        flags |= Regexp::LikePerl;
+
+    if (literal())
+        flags |= Regexp::Literal;
+
+    if (never_nl())
+        flags |= Regexp::NeverNL;
+
+    if (dot_nl())
+        flags |= Regexp::DotNL;
+
+    if (never_capture())
+        flags |= Regexp::NeverCapture;
+
+    if (!case_sensitive())
+        flags |= Regexp::FoldCase;
+
+    if (perl_classes())
+        flags |= Regexp::PerlClasses;
+
+    if (word_boundary())
+        flags |= Regexp::PerlB;
+
+    if (one_line())
+        flags |= Regexp::OneLine;
+
+    return flags;
+}
+
+void RE2::Init(const StringPiece& pattern, const Options& options) {
+    static std::once_flag empty_once;
+    std::call_once(empty_once, []() { (void)new (empty_storage) EmptyStorage; });
+
+    pattern_ = new std::string(pattern);
+    options_.Copy(options);
+    entire_regexp_ = NULL;
+    suffix_regexp_ = NULL;
+    error_ = empty_string();
+    error_arg_ = empty_string();
+
+    num_captures_ = -1;
+    error_code_ = NoError;
+    longest_match_ = options_.longest_match();
+    is_one_pass_ = false;
+    prefix_foldcase_ = false;
+    prefix_.clear();
+    prog_ = NULL;
+
+    rprog_ = NULL;
+    named_groups_ = NULL;
+    group_names_ = NULL;
+
+    RegexpStatus status;
+    entire_regexp_ =
+        Regexp::Parse(*pattern_, static_cast<Regexp::ParseFlags>(options_.ParseFlags()), &status);
+    if (entire_regexp_ == NULL) {
+        if (options_.log_errors()) {
+            LOG(ERROR) << "Error parsing '" << trunc(*pattern_) << "': " << status.Text();
+        }
+        error_ = new std::string(status.Text());
+        error_code_ = RegexpErrorToRE2(status.code());
+        error_arg_ = new std::string(status.error_arg());
+        return;
+    }
+
+    bool foldcase;
+    Regexp* suffix;
+    if (entire_regexp_->RequiredPrefix(&prefix_, &foldcase, &suffix)) {
+        prefix_foldcase_ = foldcase;
+        suffix_regexp_ = suffix;
+    } else {
+        suffix_regexp_ = entire_regexp_->Incref();
+    }
+
+    // Two thirds of the memory goes to the forward Prog,
+    // one third to the reverse prog, because the forward
+    // Prog has two DFAs but the reverse prog has one.
+    prog_ = suffix_regexp_->CompileToProg(options_.max_mem() * 2 / 3);
+    if (prog_ == NULL) {
+        if (options_.log_errors())
+            LOG(ERROR) << "Error compiling '" << trunc(*pattern_) << "'";
+        error_ = new std::string("pattern too large - compile failed");
+        error_code_ = RE2::ErrorPatternTooLarge;
+        return;
+    }
+
+    // We used to compute this lazily, but it's used during the
+    // typical control flow for a match call, so we now compute
+    // it eagerly, which avoids the overhead of std::once_flag.
+    num_captures_ = suffix_regexp_->NumCaptures();
+
+    // Could delay this until the first match call that
+    // cares about submatch information, but the one-pass
+    // machine's memory gets cut from the DFA memory budget,
+    // and that is harder to do if the DFA has already
+    // been built.
+    is_one_pass_ = prog_->IsOnePass();
+}
+
+// Returns rprog_, computing it if needed.
+Prog* RE2::ReverseProg() const {
+    std::call_once(
+        rprog_once_,
+        [](const RE2* re) {
+            re->rprog_ = re->suffix_regexp_->CompileToReverseProg(re->options_.max_mem() / 3);
+            if (re->rprog_ == NULL) {
+                if (re->options_.log_errors())
+                    LOG(ERROR) << "Error reverse compiling '" << trunc(*re->pattern_) << "'";
+                // We no longer touch error_ and error_code_ because failing to compile
+                // the reverse Prog is not a showstopper: falling back to NFA execution
+                // is fine. More importantly, an RE2 object is supposed to be logically
+                // immutable: whatever ok() would have returned after Init() completed,
+                // it should continue to return that no matter what ReverseProg() does.
+            }
+        },
+        this);
+    return rprog_;
+}
+
+RE2::~RE2() {
+    if (group_names_ != empty_group_names())
+        delete group_names_;
+    if (named_groups_ != empty_named_groups())
+        delete named_groups_;
+    delete rprog_;
+    delete prog_;
+    if (error_arg_ != empty_string())
+        delete error_arg_;
+    if (error_ != empty_string())
+        delete error_;
+    if (suffix_regexp_)
+        suffix_regexp_->Decref();
+    if (entire_regexp_)
+        entire_regexp_->Decref();
+    delete pattern_;
+}
+
+int RE2::ProgramSize() const {
+    if (prog_ == NULL)
+        return -1;
+    return prog_->size();
+}
+
+int RE2::ReverseProgramSize() const {
+    if (prog_ == NULL)
+        return -1;
+    Prog* prog = ReverseProg();
+    if (prog == NULL)
+        return -1;
+    return prog->size();
+}
+
+// Finds the most significant non-zero bit in n.
+static int FindMSBSet(uint32_t n) {
+    DCHECK_NE(n, 0);
+#if defined(__GNUC__)
+    return 31 ^ __builtin_clz(n);
+#elif defined(_MSC_VER) && (defined(_M_X64) || defined(_M_IX86))
+    unsigned long c;
+    _BitScanReverse(&c, n);
+    return static_cast<int>(c);
+#else
+    int c = 0;
+    for (int shift = 1 << 4; shift != 0; shift >>= 1) {
+        uint32_t word = n >> shift;
+        if (word != 0) {
+            n = word;
+            c += shift;
+        }
+    }
+    return c;
+#endif
+}
+
+static int Fanout(Prog* prog, std::vector<int>* histogram) {
+    SparseArray<int> fanout(prog->size());
+    prog->Fanout(&fanout);
+    int data[32] = {};
+    int size = 0;
+    for (SparseArray<int>::iterator i = fanout.begin(); i != fanout.end(); ++i) {
+        if (i->value() == 0)
+            continue;
+        uint32_t value = i->value();
+        int bucket = FindMSBSet(value);
+        bucket += value & (value - 1) ? 1 : 0;
+        ++data[bucket];
+        size = std::max(size, bucket + 1);
+    }
+    if (histogram != NULL)
+        histogram->assign(data, data + size);
+    return size - 1;
+}
+
+int RE2::ProgramFanout(std::vector<int>* histogram) const {
+    if (prog_ == NULL)
+        return -1;
+    return Fanout(prog_, histogram);
+}
+
+int RE2::ReverseProgramFanout(std::vector<int>* histogram) const {
+    if (prog_ == NULL)
+        return -1;
+    Prog* prog = ReverseProg();
+    if (prog == NULL)
+        return -1;
+    return Fanout(prog, histogram);
+}
+
+// Returns named_groups_, computing it if needed.
+const std::map<std::string, int>& RE2::NamedCapturingGroups() const {
+    std::call_once(
+        named_groups_once_,
+        [](const RE2* re) {
+            if (re->suffix_regexp_ != NULL)
+                re->named_groups_ = re->suffix_regexp_->NamedCaptures();
+            if (re->named_groups_ == NULL)
+                re->named_groups_ = empty_named_groups();
+        },
+        this);
+    return *named_groups_;
+}
+
+// Returns group_names_, computing it if needed.
+const std::map<int, std::string>& RE2::CapturingGroupNames() const {
+    std::call_once(
+        group_names_once_,
+        [](const RE2* re) {
+            if (re->suffix_regexp_ != NULL)
+                re->group_names_ = re->suffix_regexp_->CaptureNames();
+            if (re->group_names_ == NULL)
+                re->group_names_ = empty_group_names();
+        },
+        this);
+    return *group_names_;
+}
+
+/***** Convenience interfaces *****/
+
+bool RE2::FullMatchN(const StringPiece& text, const RE2& re, const Arg* const args[], int n) {
+    return re.DoMatch(text, ANCHOR_BOTH, NULL, args, n);
+}
+
+bool RE2::PartialMatchN(const StringPiece& text, const RE2& re, const Arg* const args[], int n) {
+    return re.DoMatch(text, UNANCHORED, NULL, args, n);
+}
+
+bool RE2::ConsumeN(StringPiece* input, const RE2& re, const Arg* const args[], int n) {
+    size_t consumed;
+    if (re.DoMatch(*input, ANCHOR_START, &consumed, args, n)) {
+        input->remove_prefix(consumed);
+        return true;
+    } else {
+        return false;
+    }
+}
+
+bool RE2::FindAndConsumeN(StringPiece* input, const RE2& re, const Arg* const args[], int n) {
+    size_t consumed;
+    if (re.DoMatch(*input, UNANCHORED, &consumed, args, n)) {
+        input->remove_prefix(consumed);
+        return true;
+    } else {
+        return false;
+    }
+}
+
+bool RE2::Replace(std::string* str, const RE2& re, const StringPiece& rewrite) {
+    StringPiece vec[kVecSize];
+    int nvec = 1 + MaxSubmatch(rewrite);
+    if (nvec > 1 + re.NumberOfCapturingGroups())
+        return false;
+    if (nvec > static_cast<int>(arraysize(vec)))
+        return false;
+    if (!re.Match(*str, 0, str->size(), UNANCHORED, vec, nvec))
+        return false;
+
+    std::string s;
+    if (!re.Rewrite(&s, rewrite, vec, nvec))
+        return false;
+
+    assert(vec[0].data() >= str->data());
+    assert(vec[0].data() + vec[0].size() <= str->data() + str->size());
+    str->replace(vec[0].data() - str->data(), vec[0].size(), s);
+    return true;
+}
+
+int RE2::GlobalReplace(std::string* str, const RE2& re, const StringPiece& rewrite) {
+    StringPiece vec[kVecSize];
+    int nvec = 1 + MaxSubmatch(rewrite);
+    if (nvec > 1 + re.NumberOfCapturingGroups())
+        return false;
+    if (nvec > static_cast<int>(arraysize(vec)))
+        return false;
+
+    const char* p = str->data();
+    const char* ep = p + str->size();
+    const char* lastend = NULL;
+    std::string out;
+    int count = 0;
+    while (p <= ep) {
+        if (maximum_global_replace_count != -1 && count >= maximum_global_replace_count)
+            break;
+        if (!re.Match(
+                *str, static_cast<size_t>(p - str->data()), str->size(), UNANCHORED, vec, nvec))
+            break;
+        if (p < vec[0].data())
+            out.append(p, vec[0].data() - p);
+        if (vec[0].data() == lastend && vec[0].empty()) {
+            // Disallow empty match at end of last match: skip ahead.
+            //
+            // fullrune() takes int, not ptrdiff_t. However, it just looks
+            // at the leading byte and treats any length >= 4 the same.
+            if (re.options().encoding() == RE2::Options::EncodingUTF8 &&
+                fullrune(p, static_cast<int>(std::min(ptrdiff_t{4}, ep - p)))) {
+                // re is in UTF-8 mode and there is enough left of str
+                // to allow us to advance by up to UTFmax bytes.
+                Rune r;
+                int n = chartorune(&r, p);
+                // Some copies of chartorune have a bug that accepts
+                // encodings of values in (10FFFF, 1FFFFF] as valid.
+                if (r > Runemax) {
+                    n = 1;
+                    r = Runeerror;
+                }
+                if (!(n == 1 && r == Runeerror)) { // no decoding error
+                    out.append(p, n);
+                    p += n;
+                    continue;
+                }
+            }
+            // Most likely, re is in Latin-1 mode. If it is in UTF-8 mode,
+            // we fell through from above and the GIGO principle applies.
+            if (p < ep)
+                out.append(p, 1);
+            p++;
+            continue;
+        }
+        re.Rewrite(&out, rewrite, vec, nvec);
+        p = vec[0].data() + vec[0].size();
+        lastend = p;
+        count++;
+    }
+
+    if (count == 0)
+        return 0;
+
+    if (p < ep)
+        out.append(p, ep - p);
+    using std::swap;
+    swap(out, *str);
+    return count;
+}
+
+bool RE2::Extract(
+    const StringPiece& text, const RE2& re, const StringPiece& rewrite, std::string* out) {
+    StringPiece vec[kVecSize];
+    int nvec = 1 + MaxSubmatch(rewrite);
+    if (nvec > 1 + re.NumberOfCapturingGroups())
+        return false;
+    if (nvec > static_cast<int>(arraysize(vec)))
+        return false;
+    if (!re.Match(text, 0, text.size(), UNANCHORED, vec, nvec))
+        return false;
+
+    out->clear();
+    return re.Rewrite(out, rewrite, vec, nvec);
+}
+
+std::string RE2::QuoteMeta(const StringPiece& unquoted) {
+    std::string result;
+    result.reserve(unquoted.size() << 1);
+
+    // Escape any ascii character not in [A-Za-z_0-9].
+    //
+    // Note that it's legal to escape a character even if it has no
+    // special meaning in a regular expression -- so this function does
+    // that.  (This also makes it identical to the perl function of the
+    // same name except for the null-character special case;
+    // see `perldoc -f quotemeta`.)
+    for (size_t ii = 0; ii < unquoted.size(); ++ii) {
+        // Note that using 'isalnum' here raises the benchmark time from
+        // 32ns to 58ns:
+        if ((unquoted[ii] < 'a' || unquoted[ii] > 'z') &&
+            (unquoted[ii] < 'A' || unquoted[ii] > 'Z') &&
+            (unquoted[ii] < '0' || unquoted[ii] > '9') && unquoted[ii] != '_' &&
+            // If this is the part of a UTF8 or Latin1 character, we need
+            // to copy this byte without escaping.  Experimentally this is
+            // what works correctly with the regexp library.
+            !(unquoted[ii] & 128)) {
+            if (unquoted[ii] == '\0') { // Special handling for null chars.
+                // Note that this special handling is not strictly required for RE2,
+                // but this quoting is required for other regexp libraries such as
+                // PCRE.
+                // Can't use "\\0" since the next character might be a digit.
+                result += "\\x00";
+                continue;
+            }
+            result += '\\';
+        }
+        result += unquoted[ii];
+    }
+
+    return result;
+}
+
+bool RE2::PossibleMatchRange(std::string* min, std::string* max, int maxlen) const {
+    if (prog_ == NULL)
+        return false;
+
+    int n = static_cast<int>(prefix_.size());
+    if (n > maxlen)
+        n = maxlen;
+
+    // Determine initial min max from prefix_ literal.
+    *min = prefix_.substr(0, n);
+    *max = prefix_.substr(0, n);
+    if (prefix_foldcase_) {
+        // prefix is ASCII lowercase; change *min to uppercase.
+        for (int i = 0; i < n; i++) {
+            char& c = (*min)[i];
+            if ('a' <= c && c <= 'z')
+                c += 'A' - 'a';
+        }
+    }
+
+    // Add to prefix min max using PossibleMatchRange on regexp.
+    std::string dmin, dmax;
+    maxlen -= n;
+    if (maxlen > 0 && prog_->PossibleMatchRange(&dmin, &dmax, maxlen)) {
+        min->append(dmin);
+        max->append(dmax);
+    } else if (!max->empty()) {
+        // prog_->PossibleMatchRange has failed us,
+        // but we still have useful information from prefix_.
+        // Round up *max to allow any possible suffix.
+        PrefixSuccessor(max);
+    } else {
+        // Nothing useful.
+        *min = "";
+        *max = "";
+        return false;
+    }
+
+    return true;
+}
+
+// Avoid possible locale nonsense in standard strcasecmp.
+// The string a is known to be all lowercase.
+static int ascii_strcasecmp(const char* a, const char* b, size_t len) {
+    const char* ae = a + len;
+
+    for (; a < ae; a++, b++) {
+        uint8_t x = *a;
+        uint8_t y = *b;
+        if ('A' <= y && y <= 'Z')
+            y += 'a' - 'A';
+        if (x != y)
+            return x - y;
+    }
+    return 0;
+}
+
+/***** Actual matching and rewriting code *****/
+
+bool RE2::Match(const StringPiece& text, size_t startpos, size_t endpos, Anchor re_anchor,
+    StringPiece* submatch, int nsubmatch) const {
+    if (!ok()) {
+        if (options_.log_errors())
+            LOG(ERROR) << "Invalid RE2: " << *error_;
+        return false;
+    }
+
+    if (startpos > endpos || endpos > text.size()) {
+        if (options_.log_errors())
+            LOG(ERROR) << "RE2: invalid startpos, endpos pair. ["
+                       << "startpos: " << startpos << ", "
+                       << "endpos: " << endpos << ", "
+                       << "text size: " << text.size() << "]";
+        return false;
+    }
+
+    StringPiece subtext = text;
+    subtext.remove_prefix(startpos);
+    subtext.remove_suffix(text.size() - endpos);
+
+    // Use DFAs to find exact location of match, filter out non-matches.
+
+    // Don't ask for the location if we won't use it.
+    // SearchDFA can do extra optimizations in that case.
+    StringPiece match;
+    StringPiece* matchp = &match;
+    if (nsubmatch == 0)
+        matchp = NULL;
+
+    int ncap = 1 + NumberOfCapturingGroups();
+    if (ncap > nsubmatch)
+        ncap = nsubmatch;
+
+    // If the regexp is anchored explicitly, must not be in middle of text.
+    if (prog_->anchor_start() && startpos != 0)
+        return false;
+    if (prog_->anchor_end() && endpos != text.size())
+        return false;
+
+    // If the regexp is anchored explicitly, update re_anchor
+    // so that we can potentially fall into a faster case below.
+    if (prog_->anchor_start() && prog_->anchor_end())
+        re_anchor = ANCHOR_BOTH;
+    else if (prog_->anchor_start() && re_anchor != ANCHOR_BOTH)
+        re_anchor = ANCHOR_START;
+
+    // Check for the required prefix, if any.
+    size_t prefixlen = 0;
+    if (!prefix_.empty()) {
+        if (startpos != 0)
+            return false;
+        prefixlen = prefix_.size();
+        if (prefixlen > subtext.size())
+            return false;
+        if (prefix_foldcase_) {
+            if (ascii_strcasecmp(&prefix_[0], subtext.data(), prefixlen) != 0)
+                return false;
+        } else {
+            if (memcmp(&prefix_[0], subtext.data(), prefixlen) != 0)
+                return false;
+        }
+        subtext.remove_prefix(prefixlen);
+        // If there is a required prefix, the anchor must be at least ANCHOR_START.
+        if (re_anchor != ANCHOR_BOTH)
+            re_anchor = ANCHOR_START;
+    }
+
+    Prog::Anchor anchor = Prog::kUnanchored;
+    Prog::MatchKind kind = longest_match_ ? Prog::kLongestMatch : Prog::kFirstMatch;
+
+    bool can_one_pass = is_one_pass_ && ncap <= Prog::kMaxOnePassCapture;
+    bool can_bit_state = prog_->CanBitState();
+    size_t bit_state_text_max_size = prog_->bit_state_text_max_size();
+
+#ifdef RE2_HAVE_THREAD_LOCAL
+    hooks::context = this;
+#endif
+    bool dfa_failed = false;
+    bool skipped_test = false;
+    switch (re_anchor) {
+    default:
+        LOG(DFATAL) << "Unexpected re_anchor value: " << re_anchor;
+        return false;
+
+    case UNANCHORED: {
+        if (prog_->anchor_end()) {
+            // This is a very special case: we don't need the forward DFA because
+            // we already know where the match must end! Instead, the reverse DFA
+            // can say whether there is a match and (optionally) where it starts.
+            Prog* prog = ReverseProg();
+            if (prog == NULL) {
+                // Fall back to NFA below.
+                skipped_test = true;
+                break;
+            }
+            if (!prog->SearchDFA(subtext, text, Prog::kAnchored, Prog::kLongestMatch, matchp,
+                    &dfa_failed, NULL)) {
+                if (dfa_failed) {
+                    if (options_.log_errors())
+                        LOG(ERROR) << "DFA out of memory: "
+                                   << "pattern length " << pattern_->size() << ", "
+                                   << "program size " << prog->size() << ", "
+                                   << "list count " << prog->list_count() << ", "
+                                   << "bytemap range " << prog->bytemap_range();
+                    // Fall back to NFA below.
+                    skipped_test = true;
+                    break;
+                }
+                return false;
+            }
+            if (matchp == NULL) // Matched.  Don't care where.
+                return true;
+            break;
+        }
+
+        if (!prog_->SearchDFA(subtext, text, anchor, kind, matchp, &dfa_failed, NULL)) {
+            if (dfa_failed) {
+                if (options_.log_errors())
+                    LOG(ERROR) << "DFA out of memory: "
+                               << "pattern length " << pattern_->size() << ", "
+                               << "program size " << prog_->size() << ", "
+                               << "list count " << prog_->list_count() << ", "
+                               << "bytemap range " << prog_->bytemap_range();
+                // Fall back to NFA below.
+                skipped_test = true;
+                break;
+            }
+            return false;
+        }
+        if (matchp == NULL) // Matched.  Don't care where.
+            return true;
+        // SearchDFA set match.end() but didn't know where the
+        // match started.  Run the regexp backward from match.end()
+        // to find the longest possible match -- that's where it started.
+        Prog* prog = ReverseProg();
+        if (prog == NULL) {
+            // Fall back to NFA below.
+            skipped_test = true;
+            break;
+        }
+        if (!prog->SearchDFA(
+                match, text, Prog::kAnchored, Prog::kLongestMatch, &match, &dfa_failed, NULL)) {
+            if (dfa_failed) {
+                if (options_.log_errors())
+                    LOG(ERROR) << "DFA out of memory: "
+                               << "pattern length " << pattern_->size() << ", "
+                               << "program size " << prog->size() << ", "
+                               << "list count " << prog->list_count() << ", "
+                               << "bytemap range " << prog->bytemap_range();
+                // Fall back to NFA below.
+                skipped_test = true;
+                break;
+            }
+            if (options_.log_errors())
+                LOG(ERROR) << "SearchDFA inconsistency";
+            return false;
+        }
+        break;
+    }
+
+    case ANCHOR_BOTH:
+    case ANCHOR_START:
+        if (re_anchor == ANCHOR_BOTH)
+            kind = Prog::kFullMatch;
+        anchor = Prog::kAnchored;
+
+        // If only a small amount of text and need submatch
+        // information anyway and we're going to use OnePass or BitState
+        // to get it, we might as well not even bother with the DFA:
+        // OnePass or BitState will be fast enough.
+        // On tiny texts, OnePass outruns even the DFA, and
+        // it doesn't have the shared state and occasional mutex that
+        // the DFA does.
+        if (can_one_pass && text.size() <= 4096 && (ncap > 1 || text.size() <= 16)) {
+            skipped_test = true;
+            break;
+        }
+        if (can_bit_state && text.size() <= bit_state_text_max_size && ncap > 1) {
+            skipped_test = true;
+            break;
+        }
+        if (!prog_->SearchDFA(subtext, text, anchor, kind, &match, &dfa_failed, NULL)) {
+            if (dfa_failed) {
+                if (options_.log_errors())
+                    LOG(ERROR) << "DFA out of memory: "
+                               << "pattern length " << pattern_->size() << ", "
+                               << "program size " << prog_->size() << ", "
+                               << "list count " << prog_->list_count() << ", "
+                               << "bytemap range " << prog_->bytemap_range();
+                // Fall back to NFA below.
+                skipped_test = true;
+                break;
+            }
+            return false;
+        }
+        break;
+    }
+
+    if (!skipped_test && ncap <= 1) {
+        // We know exactly where it matches.  That's enough.
+        if (ncap == 1)
+            submatch[0] = match;
+    } else {
+        StringPiece subtext1;
+        if (skipped_test) {
+            // DFA ran out of memory or was skipped:
+            // need to search in entire original text.
+            subtext1 = subtext;
+        } else {
+            // DFA found the exact match location:
+            // let NFA run an anchored, full match search
+            // to find submatch locations.
+            subtext1 = match;
+            anchor = Prog::kAnchored;
+            kind = Prog::kFullMatch;
+        }
+
+        if (can_one_pass && anchor != Prog::kUnanchored) {
+            if (!prog_->SearchOnePass(subtext1, text, anchor, kind, submatch, ncap)) {
+                if (!skipped_test && options_.log_errors())
+                    LOG(ERROR) << "SearchOnePass inconsistency";
+                return false;
+            }
+        } else if (can_bit_state && subtext1.size() <= bit_state_text_max_size) {
+            if (!prog_->SearchBitState(subtext1, text, anchor, kind, submatch, ncap)) {
+                if (!skipped_test && options_.log_errors())
+                    LOG(ERROR) << "SearchBitState inconsistency";
+                return false;
+            }
+        } else {
+            if (!prog_->SearchNFA(subtext1, text, anchor, kind, submatch, ncap)) {
+                if (!skipped_test && options_.log_errors())
+                    LOG(ERROR) << "SearchNFA inconsistency";
+                return false;
+            }
+        }
+    }
+
+    // Adjust overall match for required prefix that we stripped off.
+    if (prefixlen > 0 && nsubmatch > 0)
+        submatch[0] = StringPiece(submatch[0].data() - prefixlen, submatch[0].size() + prefixlen);
+
+    // Zero submatches that don't exist in the regexp.
+    for (int i = ncap; i < nsubmatch; i++)
+        submatch[i] = StringPiece();
+    return true;
+}
+
+// Internal matcher - like Match() but takes Args not StringPieces.
+bool RE2::DoMatch(const StringPiece& text, Anchor re_anchor, size_t* consumed,
+    const Arg* const* args, int n) const {
+    if (!ok()) {
+        if (options_.log_errors())
+            LOG(ERROR) << "Invalid RE2: " << *error_;
+        return false;
+    }
+
+    if (NumberOfCapturingGroups() < n) {
+        // RE has fewer capturing groups than number of Arg pointers passed in.
+        return false;
+    }
+
+    // Count number of capture groups needed.
+    int nvec;
+    if (n == 0 && consumed == NULL)
+        nvec = 0;
+    else
+        nvec = n + 1;
+
+    StringPiece* vec;
+    StringPiece stkvec[kVecSize];
+    StringPiece* heapvec = NULL;
+
+    if (nvec <= static_cast<int>(arraysize(stkvec))) {
+        vec = stkvec;
+    } else {
+        vec = new StringPiece[nvec];
+        heapvec = vec;
+    }
+
+    if (!Match(text, 0, text.size(), re_anchor, vec, nvec)) {
+        delete[] heapvec;
+        return false;
+    }
+
+    if (consumed != NULL)
+        *consumed = static_cast<size_t>(EndPtr(vec[0]) - BeginPtr(text));
+
+    if (n == 0 || args == NULL) {
+        // We are not interested in results
+        delete[] heapvec;
+        return true;
+    }
+
+    // If we got here, we must have matched the whole pattern.
+    for (int i = 0; i < n; i++) {
+        const StringPiece& s = vec[i + 1];
+        if (!args[i]->Parse(s.data(), s.size())) {
+            // TODO: Should we indicate what the error was?
+            delete[] heapvec;
+            return false;
+        }
+    }
+
+    delete[] heapvec;
+    return true;
+}
+
+// Checks that the rewrite string is well-formed with respect to this
+// regular expression.
+bool RE2::CheckRewriteString(const StringPiece& rewrite, std::string* error) const {
+    int max_token = -1;
+    for (const char *s = rewrite.data(), *end = s + rewrite.size(); s < end; s++) {
+        int c = *s;
+        if (c != '\\') {
+            continue;
+        }
+        if (++s == end) {
+            *error = "Rewrite schema error: '\\' not allowed at end.";
+            return false;
+        }
+        c = *s;
+        if (c == '\\') {
+            continue;
+        }
+        if (!isdigit(c)) {
+            *error = "Rewrite schema error: "
+                     "'\\' must be followed by a digit or '\\'.";
+            return false;
+        }
+        int n = (c - '0');
+        if (max_token < n) {
+            max_token = n;
+        }
+    }
+
+    if (max_token > NumberOfCapturingGroups()) {
+        *error = StringPrintf("Rewrite schema requests %d matches, but the regexp only has %d "
+                              "parenthesized subexpressions.",
+            max_token, NumberOfCapturingGroups());
+        return false;
+    }
+    return true;
+}
+
+// Returns the maximum submatch needed for the rewrite to be done by Replace().
+// E.g. if rewrite == "foo \\2,\\1", returns 2.
+int RE2::MaxSubmatch(const StringPiece& rewrite) {
+    int max = 0;
+    for (const char *s = rewrite.data(), *end = s + rewrite.size(); s < end; s++) {
+        if (*s == '\\') {
+            s++;
+            int c = (s < end) ? *s : -1;
+            if (isdigit(c)) {
+                int n = (c - '0');
+                if (n > max)
+                    max = n;
+            }
+        }
+    }
+    return max;
+}
+
+// Append the "rewrite" string, with backslash subsitutions from "vec",
+// to string "out".
+bool RE2::Rewrite(
+    std::string* out, const StringPiece& rewrite, const StringPiece* vec, int veclen) const {
+    for (const char *s = rewrite.data(), *end = s + rewrite.size(); s < end; s++) {
+        if (*s != '\\') {
+            out->push_back(*s);
+            continue;
+        }
+        s++;
+        int c = (s < end) ? *s : -1;
+        if (isdigit(c)) {
+            int n = (c - '0');
+            if (n >= veclen) {
+                if (options_.log_errors()) {
+                    LOG(ERROR) << "invalid substitution \\" << n << " from " << veclen << " groups";
+                }
+                return false;
+            }
+            StringPiece snip = vec[n];
+            if (!snip.empty())
+                out->append(snip.data(), snip.size());
+        } else if (c == '\\') {
+            out->push_back('\\');
+        } else {
+            if (options_.log_errors())
+                LOG(ERROR) << "invalid rewrite pattern: " << rewrite.data();
+            return false;
+        }
+    }
+    return true;
+}
+
+/***** Parsers for various types *****/
+
+namespace re2_internal {
+
+template<>
+bool Parse(const char* str, size_t n, void* dest) {
+    // We fail if somebody asked us to store into a non-NULL void* pointer
+    return (dest == NULL);
+}
+
+template<>
+bool Parse(const char* str, size_t n, std::string* dest) {
+    if (dest == NULL)
+        return true;
+    dest->assign(str, n);
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, StringPiece* dest) {
+    if (dest == NULL)
+        return true;
+    *dest = StringPiece(str, n);
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, char* dest) {
+    if (n != 1)
+        return false;
+    if (dest == NULL)
+        return true;
+    *dest = str[0];
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, signed char* dest) {
+    if (n != 1)
+        return false;
+    if (dest == NULL)
+        return true;
+    *dest = str[0];
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, unsigned char* dest) {
+    if (n != 1)
+        return false;
+    if (dest == NULL)
+        return true;
+    *dest = str[0];
+    return true;
+}
+
+// Largest number spec that we are willing to parse
+static const int kMaxNumberLength = 32;
+
+// REQUIRES "buf" must have length at least nbuf.
+// Copies "str" into "buf" and null-terminates.
+// Overwrites *np with the new length.
+static const char* TerminateNumber(
+    char* buf, size_t nbuf, const char* str, size_t* np, bool accept_spaces) {
+    size_t n = *np;
+    if (n == 0)
+        return "";
+    if (n > 0 && isspace(*str)) {
+        // We are less forgiving than the strtoxxx() routines and do not
+        // allow leading spaces. We do allow leading spaces for floats.
+        if (!accept_spaces) {
+            return "";
+        }
+        while (n > 0 && isspace(*str)) {
+            n--;
+            str++;
+        }
+    }
+
+    // Although buf has a fixed maximum size, we can still handle
+    // arbitrarily large integers correctly by omitting leading zeros.
+    // (Numbers that are still too long will be out of range.)
+    // Before deciding whether str is too long,
+    // remove leading zeros with s/000+/00/.
+    // Leaving the leading two zeros in place means that
+    // we don't change 0000x123 (invalid) into 0x123 (valid).
+    // Skip over leading - before replacing.
+    bool neg = false;
+    if (n >= 1 && str[0] == '-') {
+        neg = true;
+        n--;
+        str++;
+    }
+
+    if (n >= 3 && str[0] == '0' && str[1] == '0') {
+        while (n >= 3 && str[2] == '0') {
+            n--;
+            str++;
+        }
+    }
+
+    if (neg) { // make room in buf for -
+        n++;
+        str--;
+    }
+
+    if (n > nbuf - 1)
+        return "";
+
+    memmove(buf, str, n);
+    if (neg) {
+        buf[0] = '-';
+    }
+    buf[n] = '\0';
+    *np = n;
+    return buf;
+}
+
+template<>
+bool Parse(const char* str, size_t n, float* dest) {
+    if (n == 0)
+        return false;
+    static const int kMaxLength = 200;
+    char buf[kMaxLength + 1];
+    str = TerminateNumber(buf, sizeof buf, str, &n, true);
+    char* end;
+    errno = 0;
+    float r = strtof(str, &end);
+    if (end != str + n)
+        return false; // Leftover junk
+    if (errno)
+        return false;
+    if (dest == NULL)
+        return true;
+    *dest = r;
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, double* dest) {
+    if (n == 0)
+        return false;
+    static const int kMaxLength = 200;
+    char buf[kMaxLength + 1];
+    str = TerminateNumber(buf, sizeof buf, str, &n, true);
+    char* end;
+    errno = 0;
+    double r = strtod(str, &end);
+    if (end != str + n)
+        return false; // Leftover junk
+    if (errno)
+        return false;
+    if (dest == NULL)
+        return true;
+    *dest = r;
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, long* dest, int radix) {
+    if (n == 0)
+        return false;
+    char buf[kMaxNumberLength + 1];
+    str = TerminateNumber(buf, sizeof buf, str, &n, false);
+    char* end;
+    errno = 0;
+    long r = strtol(str, &end, radix);
+    if (end != str + n)
+        return false; // Leftover junk
+    if (errno)
+        return false;
+    if (dest == NULL)
+        return true;
+    *dest = r;
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, unsigned long* dest, int radix) {
+    if (n == 0)
+        return false;
+    char buf[kMaxNumberLength + 1];
+    str = TerminateNumber(buf, sizeof buf, str, &n, false);
+    if (str[0] == '-') {
+        // strtoul() will silently accept negative numbers and parse
+        // them.  This module is more strict and treats them as errors.
+        return false;
+    }
+
+    char* end;
+    errno = 0;
+    unsigned long r = strtoul(str, &end, radix);
+    if (end != str + n)
+        return false; // Leftover junk
+    if (errno)
+        return false;
+    if (dest == NULL)
+        return true;
+    *dest = r;
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, short* dest, int radix) {
+    long r;
+    if (!Parse(str, n, &r, radix))
+        return false; // Could not parse
+    if ((short)r != r)
+        return false; // Out of range
+    if (dest == NULL)
+        return true;
+    *dest = (short)r;
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, unsigned short* dest, int radix) {
+    unsigned long r;
+    if (!Parse(str, n, &r, radix))
+        return false; // Could not parse
+    if ((unsigned short)r != r)
+        return false; // Out of range
+    if (dest == NULL)
+        return true;
+    *dest = (unsigned short)r;
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, int* dest, int radix) {
+    long r;
+    if (!Parse(str, n, &r, radix))
+        return false; // Could not parse
+    if ((int)r != r)
+        return false; // Out of range
+    if (dest == NULL)
+        return true;
+    *dest = (int)r;
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, unsigned int* dest, int radix) {
+    unsigned long r;
+    if (!Parse(str, n, &r, radix))
+        return false; // Could not parse
+    if ((unsigned int)r != r)
+        return false; // Out of range
+    if (dest == NULL)
+        return true;
+    *dest = (unsigned int)r;
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, long long* dest, int radix) {
+    if (n == 0)
+        return false;
+    char buf[kMaxNumberLength + 1];
+    str = TerminateNumber(buf, sizeof buf, str, &n, false);
+    char* end;
+    errno = 0;
+    long long r = strtoll(str, &end, radix);
+    if (end != str + n)
+        return false; // Leftover junk
+    if (errno)
+        return false;
+    if (dest == NULL)
+        return true;
+    *dest = r;
+    return true;
+}
+
+template<>
+bool Parse(const char* str, size_t n, unsigned long long* dest, int radix) {
+    if (n == 0)
+        return false;
+    char buf[kMaxNumberLength + 1];
+    str = TerminateNumber(buf, sizeof buf, str, &n, false);
+    if (str[0] == '-') {
+        // strtoull() will silently accept negative numbers and parse
+        // them.  This module is more strict and treats them as errors.
+        return false;
+    }
+    char* end;
+    errno = 0;
+    unsigned long long r = strtoull(str, &end, radix);
+    if (end != str + n)
+        return false; // Leftover junk
+    if (errno)
+        return false;
+    if (dest == NULL)
+        return true;
+    *dest = r;
+    return true;
+}
+
+} // namespace re2_internal
+
+namespace hooks {
+
+#ifdef RE2_HAVE_THREAD_LOCAL
+thread_local const RE2* context = NULL;
+#endif
+
+template<typename T>
+union Hook {
+    void Store(T* cb) { cb_.store(cb, std::memory_order_release); }
+    T* Load() const { return cb_.load(std::memory_order_acquire); }
+
+#if !defined(__clang__) && defined(_MSC_VER)
+    // Citing https://github.com/protocolbuffers/protobuf/pull/4777 as precedent,
+    // this is a gross hack to make std::atomic<T*> constant-initialized on MSVC.
+    static_assert(ATOMIC_POINTER_LOCK_FREE == 2, "std::atomic<T*> must be always lock-free");
+    T* cb_for_constinit_;
+#endif
+
+    std::atomic<T*> cb_;
+};
+
+template<typename T>
+static void DoNothing(const T&) {}
+
+#define DEFINE_HOOK(type, name)                                                                    \
+    static Hook<type##Callback> name##_hook = {{&DoNothing<type>}};                                \
+    void Set##type##Hook(type##Callback* cb) { name##_hook.Store(cb); }                            \
+    type##Callback* Get##type##Hook() { return name##_hook.Load(); }
+
+DEFINE_HOOK(DFAStateCacheReset, dfa_state_cache_reset)
+DEFINE_HOOK(DFASearchFailure, dfa_search_failure)
+
+#undef DEFINE_HOOK
+
+} // namespace hooks
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/regexp.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/regexp.cpp
new file mode 100644
index 0000000000..555474fb0c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/regexp.cpp
@@ -0,0 +1,982 @@
+// Copyright 2006 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Regular expression representation.
+// Tested by parse_test.cc
+
+#include "regexp.h"
+
+#include <stddef.h>
+#include <stdint.h>
+#include <string.h>
+
+#include <algorithm>
+#include <map>
+#include <mutex>
+#include <string>
+#include <vector>
+
+#include "logging.h"
+#include "mutex.h"
+#include "pod_array.h"
+#include "stringpiece.h"
+#include "utf.h"
+#include "util.h"
+#include "walker-inl.h"
+
+namespace lbug {
+namespace regex {
+
+// Constructor.  Allocates vectors as appropriate for operator.
+Regexp::Regexp(RegexpOp op, ParseFlags parse_flags)
+    : op_(static_cast<uint8_t>(op)), simple_(false),
+      parse_flags_(static_cast<uint16_t>(parse_flags)), ref_(1), nsub_(0), down_(NULL) {
+    subone_ = NULL;
+    memset(the_union_, 0, sizeof the_union_);
+}
+
+// Destructor.  Assumes already cleaned up children.
+// Private: use Decref() instead of delete to destroy Regexps.
+// Can't call Decref on the sub-Regexps here because
+// that could cause arbitrarily deep recursion, so
+// required Decref() to have handled them for us.
+Regexp::~Regexp() {
+    if (nsub_ > 0)
+        LOG(DFATAL) << "Regexp not destroyed.";
+
+    switch (op_) {
+    default:
+        break;
+    case kRegexpCapture:
+        delete name_;
+        break;
+    case kRegexpLiteralString:
+        delete[] runes_;
+        break;
+    case kRegexpCharClass:
+        if (cc_)
+            cc_->Delete();
+        delete ccb_;
+        break;
+    }
+}
+
+// If it's possible to destroy this regexp without recurring,
+// do so and return true.  Else return false.
+bool Regexp::QuickDestroy() {
+    if (nsub_ == 0) {
+        delete this;
+        return true;
+    }
+    return false;
+}
+
+// Similar to EmptyStorage in re2.cc.
+struct RefStorage {
+    Mutex ref_mutex;
+    std::map<Regexp*, int> ref_map;
+};
+alignas(RefStorage) static char ref_storage[sizeof(RefStorage)];
+
+static inline Mutex* ref_mutex() {
+    return &reinterpret_cast<RefStorage*>(ref_storage)->ref_mutex;
+}
+
+static inline std::map<Regexp*, int>* ref_map() {
+    return &reinterpret_cast<RefStorage*>(ref_storage)->ref_map;
+}
+
+int Regexp::Ref() {
+    if (ref_ < kMaxRef)
+        return ref_;
+
+    MutexLock l(ref_mutex());
+    return (*ref_map())[this];
+}
+
+// Increments reference count, returns object as convenience.
+Regexp* Regexp::Incref() {
+    if (ref_ >= kMaxRef - 1) {
+        static std::once_flag ref_once;
+        std::call_once(ref_once, []() { (void)new (ref_storage) RefStorage; });
+
+        // Store ref count in overflow map.
+        MutexLock l(ref_mutex());
+        if (ref_ == kMaxRef) {
+            // already overflowed
+            (*ref_map())[this]++;
+        } else {
+            // overflowing now
+            (*ref_map())[this] = kMaxRef;
+            ref_ = kMaxRef;
+        }
+        return this;
+    }
+
+    ref_++;
+    return this;
+}
+
+// Decrements reference count and deletes this object if count reaches 0.
+void Regexp::Decref() {
+    if (ref_ == kMaxRef) {
+        // Ref count is stored in overflow map.
+        MutexLock l(ref_mutex());
+        int r = (*ref_map())[this] - 1;
+        if (r < kMaxRef) {
+            ref_ = static_cast<uint16_t>(r);
+            ref_map()->erase(this);
+        } else {
+            (*ref_map())[this] = r;
+        }
+        return;
+    }
+    ref_--;
+    if (ref_ == 0)
+        Destroy();
+}
+
+// Deletes this object; ref count has count reached 0.
+void Regexp::Destroy() {
+    if (QuickDestroy())
+        return;
+
+    // Handle recursive Destroy with explicit stack
+    // to avoid arbitrarily deep recursion on process stack [sigh].
+    down_ = NULL;
+    Regexp* stack = this;
+    while (stack != NULL) {
+        Regexp* re = stack;
+        stack = re->down_;
+        if (re->ref_ != 0)
+            LOG(DFATAL) << "Bad reference count " << re->ref_;
+        if (re->nsub_ > 0) {
+            Regexp** subs = re->sub();
+            for (int i = 0; i < re->nsub_; i++) {
+                Regexp* sub = subs[i];
+                if (sub == NULL)
+                    continue;
+                if (sub->ref_ == kMaxRef)
+                    sub->Decref();
+                else
+                    --sub->ref_;
+                if (sub->ref_ == 0 && !sub->QuickDestroy()) {
+                    sub->down_ = stack;
+                    stack = sub;
+                }
+            }
+            if (re->nsub_ > 1)
+                delete[] subs;
+            re->nsub_ = 0;
+        }
+        delete re;
+    }
+}
+
+void Regexp::AddRuneToString(Rune r) {
+    DCHECK(op_ == kRegexpLiteralString);
+    if (nrunes_ == 0) {
+        // start with 8
+        runes_ = new Rune[8];
+    } else if (nrunes_ >= 8 && (nrunes_ & (nrunes_ - 1)) == 0) {
+        // double on powers of two
+        Rune* old = runes_;
+        runes_ = new Rune[nrunes_ * 2];
+        for (int i = 0; i < nrunes_; i++)
+            runes_[i] = old[i];
+        delete[] old;
+    }
+
+    runes_[nrunes_++] = r;
+}
+
+Regexp* Regexp::HaveMatch(int match_id, ParseFlags flags) {
+    Regexp* re = new Regexp(kRegexpHaveMatch, flags);
+    re->match_id_ = match_id;
+    return re;
+}
+
+Regexp* Regexp::StarPlusOrQuest(RegexpOp op, Regexp* sub, ParseFlags flags) {
+    // Squash **, ++ and ??.
+    if (op == sub->op() && flags == sub->parse_flags())
+        return sub;
+
+    // Squash *+, *?, +*, +?, ?* and ?+. They all squash to *, so because
+    // op is Star/Plus/Quest, we just have to check that sub->op() is too.
+    if ((sub->op() == kRegexpStar || sub->op() == kRegexpPlus || sub->op() == kRegexpQuest) &&
+        flags == sub->parse_flags()) {
+        // If sub is Star, no need to rewrite it.
+        if (sub->op() == kRegexpStar)
+            return sub;
+
+        // Rewrite sub to Star.
+        Regexp* re = new Regexp(kRegexpStar, flags);
+        re->AllocSub(1);
+        re->sub()[0] = sub->sub()[0]->Incref();
+        sub->Decref(); // We didn't consume the reference after all.
+        return re;
+    }
+
+    Regexp* re = new Regexp(op, flags);
+    re->AllocSub(1);
+    re->sub()[0] = sub;
+    return re;
+}
+
+Regexp* Regexp::Plus(Regexp* sub, ParseFlags flags) {
+    return StarPlusOrQuest(kRegexpPlus, sub, flags);
+}
+
+Regexp* Regexp::Star(Regexp* sub, ParseFlags flags) {
+    return StarPlusOrQuest(kRegexpStar, sub, flags);
+}
+
+Regexp* Regexp::Quest(Regexp* sub, ParseFlags flags) {
+    return StarPlusOrQuest(kRegexpQuest, sub, flags);
+}
+
+Regexp* Regexp::ConcatOrAlternate(
+    RegexpOp op, Regexp** sub, int nsub, ParseFlags flags, bool can_factor) {
+    if (nsub == 1)
+        return sub[0];
+
+    if (nsub == 0) {
+        if (op == kRegexpAlternate)
+            return new Regexp(kRegexpNoMatch, flags);
+        else
+            return new Regexp(kRegexpEmptyMatch, flags);
+    }
+
+    PODArray<Regexp*> subcopy;
+    if (op == kRegexpAlternate && can_factor) {
+        // Going to edit sub; make a copy so we don't step on caller.
+        subcopy = PODArray<Regexp*>(nsub);
+        memmove(subcopy.data(), sub, nsub * sizeof sub[0]);
+        sub = subcopy.data();
+        nsub = FactorAlternation(sub, nsub, flags);
+        if (nsub == 1) {
+            Regexp* re = sub[0];
+            return re;
+        }
+    }
+
+    if (nsub > kMaxNsub) {
+        // Too many subexpressions to fit in a single Regexp.
+        // Make a two-level tree.  Two levels gets us to 65535^2.
+        int nbigsub = (nsub + kMaxNsub - 1) / kMaxNsub;
+        Regexp* re = new Regexp(op, flags);
+        re->AllocSub(nbigsub);
+        Regexp** subs = re->sub();
+        for (int i = 0; i < nbigsub - 1; i++)
+            subs[i] = ConcatOrAlternate(op, sub + i * kMaxNsub, kMaxNsub, flags, false);
+        subs[nbigsub - 1] = ConcatOrAlternate(
+            op, sub + (nbigsub - 1) * kMaxNsub, nsub - (nbigsub - 1) * kMaxNsub, flags, false);
+        return re;
+    }
+
+    Regexp* re = new Regexp(op, flags);
+    re->AllocSub(nsub);
+    Regexp** subs = re->sub();
+    for (int i = 0; i < nsub; i++)
+        subs[i] = sub[i];
+    return re;
+}
+
+Regexp* Regexp::Concat(Regexp** sub, int nsub, ParseFlags flags) {
+    return ConcatOrAlternate(kRegexpConcat, sub, nsub, flags, false);
+}
+
+Regexp* Regexp::Alternate(Regexp** sub, int nsub, ParseFlags flags) {
+    return ConcatOrAlternate(kRegexpAlternate, sub, nsub, flags, true);
+}
+
+Regexp* Regexp::AlternateNoFactor(Regexp** sub, int nsub, ParseFlags flags) {
+    return ConcatOrAlternate(kRegexpAlternate, sub, nsub, flags, false);
+}
+
+Regexp* Regexp::Capture(Regexp* sub, ParseFlags flags, int cap) {
+    Regexp* re = new Regexp(kRegexpCapture, flags);
+    re->AllocSub(1);
+    re->sub()[0] = sub;
+    re->cap_ = cap;
+    return re;
+}
+
+Regexp* Regexp::Repeat(Regexp* sub, ParseFlags flags, int min, int max) {
+    Regexp* re = new Regexp(kRegexpRepeat, flags);
+    re->AllocSub(1);
+    re->sub()[0] = sub;
+    re->min_ = min;
+    re->max_ = max;
+    return re;
+}
+
+Regexp* Regexp::NewLiteral(Rune rune, ParseFlags flags) {
+    Regexp* re = new Regexp(kRegexpLiteral, flags);
+    re->rune_ = rune;
+    return re;
+}
+
+Regexp* Regexp::LiteralString(Rune* runes, int nrunes, ParseFlags flags) {
+    if (nrunes <= 0)
+        return new Regexp(kRegexpEmptyMatch, flags);
+    if (nrunes == 1)
+        return NewLiteral(runes[0], flags);
+    Regexp* re = new Regexp(kRegexpLiteralString, flags);
+    for (int i = 0; i < nrunes; i++)
+        re->AddRuneToString(runes[i]);
+    return re;
+}
+
+Regexp* Regexp::NewCharClass(CharClass* cc, ParseFlags flags) {
+    Regexp* re = new Regexp(kRegexpCharClass, flags);
+    re->cc_ = cc;
+    return re;
+}
+
+void Regexp::Swap(Regexp* that) {
+    // Regexp is not trivially copyable, so we cannot freely copy it with
+    // memmove(3), but swapping objects like so is safe for our purposes.
+    char tmp[sizeof *this];
+    void* vthis = reinterpret_cast<void*>(this);
+    void* vthat = reinterpret_cast<void*>(that);
+    memmove(tmp, vthis, sizeof *this);
+    memmove(vthis, vthat, sizeof *this);
+    memmove(vthat, tmp, sizeof *this);
+}
+
+// Tests equality of all top-level structure but not subregexps.
+static bool TopEqual(Regexp* a, Regexp* b) {
+    if (a->op() != b->op())
+        return false;
+
+    switch (a->op()) {
+    case kRegexpNoMatch:
+    case kRegexpEmptyMatch:
+    case kRegexpAnyChar:
+    case kRegexpAnyByte:
+    case kRegexpBeginLine:
+    case kRegexpEndLine:
+    case kRegexpWordBoundary:
+    case kRegexpNoWordBoundary:
+    case kRegexpBeginText:
+        return true;
+
+    case kRegexpEndText:
+        // The parse flags remember whether it's \z or (?-m:$),
+        // which matters when testing against PCRE.
+        return ((a->parse_flags() ^ b->parse_flags()) & Regexp::WasDollar) == 0;
+
+    case kRegexpLiteral:
+        return a->rune() == b->rune() &&
+               ((a->parse_flags() ^ b->parse_flags()) & Regexp::FoldCase) == 0;
+
+    case kRegexpLiteralString:
+        return a->nrunes() == b->nrunes() &&
+               ((a->parse_flags() ^ b->parse_flags()) & Regexp::FoldCase) == 0 &&
+               memcmp(a->runes(), b->runes(), a->nrunes() * sizeof a->runes()[0]) == 0;
+
+    case kRegexpAlternate:
+    case kRegexpConcat:
+        return a->nsub() == b->nsub();
+
+    case kRegexpStar:
+    case kRegexpPlus:
+    case kRegexpQuest:
+        return ((a->parse_flags() ^ b->parse_flags()) & Regexp::NonGreedy) == 0;
+
+    case kRegexpRepeat:
+        return ((a->parse_flags() ^ b->parse_flags()) & Regexp::NonGreedy) == 0 &&
+               a->min() == b->min() && a->max() == b->max();
+
+    case kRegexpCapture:
+        return a->cap() == b->cap() && a->name() == b->name();
+
+    case kRegexpHaveMatch:
+        return a->match_id() == b->match_id();
+
+    case kRegexpCharClass: {
+        CharClass* acc = a->cc();
+        CharClass* bcc = b->cc();
+        return acc->size() == bcc->size() &&
+               acc->end() - acc->begin() == bcc->end() - bcc->begin() &&
+               memcmp(acc->begin(), bcc->begin(),
+                   (acc->end() - acc->begin()) * sizeof acc->begin()[0]) == 0;
+    }
+    }
+
+    LOG(DFATAL) << "Unexpected op in Regexp::Equal: " << a->op();
+    return 0;
+}
+
+bool Regexp::Equal(Regexp* a, Regexp* b) {
+    if (a == NULL || b == NULL)
+        return a == b;
+
+    if (!TopEqual(a, b))
+        return false;
+
+    // Fast path:
+    // return without allocating vector if there are no subregexps.
+    switch (a->op()) {
+    case kRegexpAlternate:
+    case kRegexpConcat:
+    case kRegexpStar:
+    case kRegexpPlus:
+    case kRegexpQuest:
+    case kRegexpRepeat:
+    case kRegexpCapture:
+        break;
+
+    default:
+        return true;
+    }
+
+    // Committed to doing real work.
+    // The stack (vector) has pairs of regexps waiting to
+    // be compared.  The regexps are only equal if
+    // all the pairs end up being equal.
+    std::vector<Regexp*> stk;
+
+    for (;;) {
+        // Invariant: TopEqual(a, b) == true.
+        Regexp* a2;
+        Regexp* b2;
+        switch (a->op()) {
+        default:
+            break;
+        case kRegexpAlternate:
+        case kRegexpConcat:
+            for (int i = 0; i < a->nsub(); i++) {
+                a2 = a->sub()[i];
+                b2 = b->sub()[i];
+                if (!TopEqual(a2, b2))
+                    return false;
+                stk.push_back(a2);
+                stk.push_back(b2);
+            }
+            break;
+
+        case kRegexpStar:
+        case kRegexpPlus:
+        case kRegexpQuest:
+        case kRegexpRepeat:
+        case kRegexpCapture:
+            a2 = a->sub()[0];
+            b2 = b->sub()[0];
+            if (!TopEqual(a2, b2))
+                return false;
+            // Really:
+            //   stk.push_back(a2);
+            //   stk.push_back(b2);
+            //   break;
+            // but faster to assign directly and loop.
+            a = a2;
+            b = b2;
+            continue;
+        }
+
+        size_t n = stk.size();
+        if (n == 0)
+            break;
+
+        DCHECK_GE(n, 2);
+        a = stk[n - 2];
+        b = stk[n - 1];
+        stk.resize(n - 2);
+    }
+
+    return true;
+}
+
+// Keep in sync with enum RegexpStatusCode in regexp.h
+static const char* kErrorStrings[] = {
+    "no error",
+    "unexpected error",
+    "invalid escape sequence",
+    "invalid character class",
+    "invalid character class range",
+    "missing ]",
+    "missing )",
+    "unexpected )",
+    "trailing \\",
+    "no argument for repetition operator",
+    "invalid repetition size",
+    "bad repetition operator",
+    "invalid perl operator",
+    "invalid UTF-8",
+    "invalid named capture group",
+};
+
+std::string RegexpStatus::CodeText(enum RegexpStatusCode code) {
+    if (code < 0 || code >= arraysize(kErrorStrings))
+        code = kRegexpInternalError;
+    return kErrorStrings[code];
+}
+
+std::string RegexpStatus::Text() const {
+    if (error_arg_.empty())
+        return CodeText(code_);
+    std::string s;
+    s.append(CodeText(code_));
+    s.append(": ");
+    s.append(error_arg_.data(), error_arg_.size());
+    return s;
+}
+
+void RegexpStatus::Copy(const RegexpStatus& status) {
+    code_ = status.code_;
+    error_arg_ = status.error_arg_;
+}
+
+typedef int Ignored; // Walker<void> doesn't exist
+
+// Walker subclass to count capturing parens in regexp.
+class NumCapturesWalker : public Regexp::Walker<Ignored> {
+public:
+    NumCapturesWalker() : ncapture_(0) {}
+    int ncapture() { return ncapture_; }
+
+    virtual Ignored PreVisit(Regexp* re, Ignored ignored, bool* stop) {
+        if (re->op() == kRegexpCapture)
+            ncapture_++;
+        return ignored;
+    }
+
+    virtual Ignored ShortVisit(Regexp* re, Ignored ignored) {
+        // Should never be called: we use Walk(), not WalkExponential().
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+        LOG(DFATAL) << "NumCapturesWalker::ShortVisit called";
+#endif
+        return ignored;
+    }
+
+private:
+    int ncapture_;
+
+    NumCapturesWalker(const NumCapturesWalker&) = delete;
+    NumCapturesWalker& operator=(const NumCapturesWalker&) = delete;
+};
+
+int Regexp::NumCaptures() {
+    NumCapturesWalker w;
+    w.Walk(this, 0);
+    return w.ncapture();
+}
+
+// Walker class to build map of named capture groups and their indices.
+class NamedCapturesWalker : public Regexp::Walker<Ignored> {
+public:
+    NamedCapturesWalker() : map_(NULL) {}
+    ~NamedCapturesWalker() { delete map_; }
+
+    std::map<std::string, int>* TakeMap() {
+        std::map<std::string, int>* m = map_;
+        map_ = NULL;
+        return m;
+    }
+
+    virtual Ignored PreVisit(Regexp* re, Ignored ignored, bool* stop) {
+        if (re->op() == kRegexpCapture && re->name() != NULL) {
+            // Allocate map once we find a name.
+            if (map_ == NULL)
+                map_ = new std::map<std::string, int>;
+
+            // Record first occurrence of each name.
+            // (The rule is that if you have the same name
+            // multiple times, only the leftmost one counts.)
+            map_->insert({*re->name(), re->cap()});
+        }
+        return ignored;
+    }
+
+    virtual Ignored ShortVisit(Regexp* re, Ignored ignored) {
+        // Should never be called: we use Walk(), not WalkExponential().
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+        LOG(DFATAL) << "NamedCapturesWalker::ShortVisit called";
+#endif
+        return ignored;
+    }
+
+private:
+    std::map<std::string, int>* map_;
+
+    NamedCapturesWalker(const NamedCapturesWalker&) = delete;
+    NamedCapturesWalker& operator=(const NamedCapturesWalker&) = delete;
+};
+
+std::map<std::string, int>* Regexp::NamedCaptures() {
+    NamedCapturesWalker w;
+    w.Walk(this, 0);
+    return w.TakeMap();
+}
+
+// Walker class to build map from capture group indices to their names.
+class CaptureNamesWalker : public Regexp::Walker<Ignored> {
+public:
+    CaptureNamesWalker() : map_(NULL) {}
+    ~CaptureNamesWalker() { delete map_; }
+
+    std::map<int, std::string>* TakeMap() {
+        std::map<int, std::string>* m = map_;
+        map_ = NULL;
+        return m;
+    }
+
+    virtual Ignored PreVisit(Regexp* re, Ignored ignored, bool* stop) {
+        if (re->op() == kRegexpCapture && re->name() != NULL) {
+            // Allocate map once we find a name.
+            if (map_ == NULL)
+                map_ = new std::map<int, std::string>;
+
+            (*map_)[re->cap()] = *re->name();
+        }
+        return ignored;
+    }
+
+    virtual Ignored ShortVisit(Regexp* re, Ignored ignored) {
+        // Should never be called: we use Walk(), not WalkExponential().
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+        LOG(DFATAL) << "CaptureNamesWalker::ShortVisit called";
+#endif
+        return ignored;
+    }
+
+private:
+    std::map<int, std::string>* map_;
+
+    CaptureNamesWalker(const CaptureNamesWalker&) = delete;
+    CaptureNamesWalker& operator=(const CaptureNamesWalker&) = delete;
+};
+
+std::map<int, std::string>* Regexp::CaptureNames() {
+    CaptureNamesWalker w;
+    w.Walk(this, 0);
+    return w.TakeMap();
+}
+
+void ConvertRunesToBytes(bool latin1, Rune* runes, int nrunes, std::string* bytes) {
+    if (latin1) {
+        bytes->resize(nrunes);
+        for (int i = 0; i < nrunes; i++)
+            (*bytes)[i] = static_cast<char>(runes[i]);
+    } else {
+        bytes->resize(nrunes * UTFmax); // worst case
+        char* p = &(*bytes)[0];
+        for (int i = 0; i < nrunes; i++)
+            p += runetochar(p, &runes[i]);
+        bytes->resize(p - &(*bytes)[0]);
+        bytes->shrink_to_fit();
+    }
+}
+
+// Determines whether regexp matches must be anchored
+// with a fixed string prefix.  If so, returns the prefix and
+// the regexp that remains after the prefix.  The prefix might
+// be ASCII case-insensitive.
+bool Regexp::RequiredPrefix(std::string* prefix, bool* foldcase, Regexp** suffix) {
+    prefix->clear();
+    *foldcase = false;
+    *suffix = NULL;
+
+    // No need for a walker: the regexp must be of the form
+    // 1. some number of ^ anchors
+    // 2. a literal char or string
+    // 3. the rest
+    if (op_ != kRegexpConcat)
+        return false;
+    int i = 0;
+    while (i < nsub_ && sub()[i]->op_ == kRegexpBeginText)
+        i++;
+    if (i == 0 || i >= nsub_)
+        return false;
+    Regexp* re = sub()[i];
+    if (re->op_ != kRegexpLiteral && re->op_ != kRegexpLiteralString)
+        return false;
+    i++;
+    if (i < nsub_) {
+        for (int j = i; j < nsub_; j++)
+            sub()[j]->Incref();
+        *suffix = Concat(sub() + i, nsub_ - i, parse_flags());
+    } else {
+        *suffix = new Regexp(kRegexpEmptyMatch, parse_flags());
+    }
+
+    bool latin1 = (re->parse_flags() & Latin1) != 0;
+    Rune* runes = re->op_ == kRegexpLiteral ? &re->rune_ : re->runes_;
+    int nrunes = re->op_ == kRegexpLiteral ? 1 : re->nrunes_;
+    ConvertRunesToBytes(latin1, runes, nrunes, prefix);
+    *foldcase = (re->parse_flags() & FoldCase) != 0;
+    return true;
+}
+
+// Determines whether regexp matches must be unanchored
+// with a fixed string prefix.  If so, returns the prefix.
+// The prefix might be ASCII case-insensitive.
+bool Regexp::RequiredPrefixForAccel(std::string* prefix, bool* foldcase) {
+    prefix->clear();
+    *foldcase = false;
+
+    // No need for a walker: the regexp must either begin with or be
+    // a literal char or string. We "see through" capturing groups,
+    // but make no effort to glue multiple prefix fragments together.
+    Regexp* re = op_ == kRegexpConcat && nsub_ > 0 ? sub()[0] : this;
+    while (re->op_ == kRegexpCapture) {
+        re = re->sub()[0];
+        if (re->op_ == kRegexpConcat && re->nsub_ > 0)
+            re = re->sub()[0];
+    }
+    if (re->op_ != kRegexpLiteral && re->op_ != kRegexpLiteralString)
+        return false;
+
+    bool latin1 = (re->parse_flags() & Latin1) != 0;
+    Rune* runes = re->op_ == kRegexpLiteral ? &re->rune_ : re->runes_;
+    int nrunes = re->op_ == kRegexpLiteral ? 1 : re->nrunes_;
+    ConvertRunesToBytes(latin1, runes, nrunes, prefix);
+    *foldcase = (re->parse_flags() & FoldCase) != 0;
+    return true;
+}
+
+// Character class builder is a balanced binary tree (STL set)
+// containing non-overlapping, non-abutting RuneRanges.
+// The less-than operator used in the tree treats two
+// ranges as equal if they overlap at all, so that
+// lookups for a particular Rune are possible.
+
+CharClassBuilder::CharClassBuilder() {
+    nrunes_ = 0;
+    upper_ = 0;
+    lower_ = 0;
+}
+
+// Add lo-hi to the class; return whether class got bigger.
+bool CharClassBuilder::AddRange(Rune lo, Rune hi) {
+    if (hi < lo)
+        return false;
+
+    if (lo <= 'z' && hi >= 'A') {
+        // Overlaps some alpha, maybe not all.
+        // Update bitmaps telling which ASCII letters are in the set.
+        Rune lo1 = std::max<Rune>(lo, 'A');
+        Rune hi1 = std::min<Rune>(hi, 'Z');
+        if (lo1 <= hi1)
+            upper_ |= ((1 << (hi1 - lo1 + 1)) - 1) << (lo1 - 'A');
+
+        lo1 = std::max<Rune>(lo, 'a');
+        hi1 = std::min<Rune>(hi, 'z');
+        if (lo1 <= hi1)
+            lower_ |= ((1 << (hi1 - lo1 + 1)) - 1) << (lo1 - 'a');
+    }
+
+    { // Check whether lo, hi is already in the class.
+        iterator it = ranges_.find(RuneRange(lo, lo));
+        if (it != end() && it->lo <= lo && hi <= it->hi)
+            return false;
+    }
+
+    // Look for a range abutting lo on the left.
+    // If it exists, take it out and increase our range.
+    if (lo > 0) {
+        iterator it = ranges_.find(RuneRange(lo - 1, lo - 1));
+        if (it != end()) {
+            lo = it->lo;
+            if (it->hi > hi)
+                hi = it->hi;
+            nrunes_ -= it->hi - it->lo + 1;
+            ranges_.erase(it);
+        }
+    }
+
+    // Look for a range abutting hi on the right.
+    // If it exists, take it out and increase our range.
+    if (hi < Runemax) {
+        iterator it = ranges_.find(RuneRange(hi + 1, hi + 1));
+        if (it != end()) {
+            hi = it->hi;
+            nrunes_ -= it->hi - it->lo + 1;
+            ranges_.erase(it);
+        }
+    }
+
+    // Look for ranges between lo and hi.  Take them out.
+    // This is only safe because the set has no overlapping ranges.
+    // We've already removed any ranges abutting lo and hi, so
+    // any that overlap [lo, hi] must be contained within it.
+    for (;;) {
+        iterator it = ranges_.find(RuneRange(lo, hi));
+        if (it == end())
+            break;
+        nrunes_ -= it->hi - it->lo + 1;
+        ranges_.erase(it);
+    }
+
+    // Finally, add [lo, hi].
+    nrunes_ += hi - lo + 1;
+    ranges_.insert(RuneRange(lo, hi));
+    return true;
+}
+
+void CharClassBuilder::AddCharClass(CharClassBuilder* cc) {
+    for (iterator it = cc->begin(); it != cc->end(); ++it)
+        AddRange(it->lo, it->hi);
+}
+
+bool CharClassBuilder::Contains(Rune r) {
+    return ranges_.find(RuneRange(r, r)) != end();
+}
+
+// Does the character class behave the same on A-Z as on a-z?
+bool CharClassBuilder::FoldsASCII() {
+    return ((upper_ ^ lower_) & AlphaMask) == 0;
+}
+
+CharClassBuilder* CharClassBuilder::Copy() {
+    CharClassBuilder* cc = new CharClassBuilder;
+    for (iterator it = begin(); it != end(); ++it)
+        cc->ranges_.insert(RuneRange(it->lo, it->hi));
+    cc->upper_ = upper_;
+    cc->lower_ = lower_;
+    cc->nrunes_ = nrunes_;
+    return cc;
+}
+
+void CharClassBuilder::RemoveAbove(Rune r) {
+    if (r >= Runemax)
+        return;
+
+    if (r < 'z') {
+        if (r < 'a')
+            lower_ = 0;
+        else
+            lower_ &= AlphaMask >> ('z' - r);
+    }
+
+    if (r < 'Z') {
+        if (r < 'A')
+            upper_ = 0;
+        else
+            upper_ &= AlphaMask >> ('Z' - r);
+    }
+
+    for (;;) {
+
+        iterator it = ranges_.find(RuneRange(r + 1, Runemax));
+        if (it == end())
+            break;
+        RuneRange rr = *it;
+        ranges_.erase(it);
+        nrunes_ -= rr.hi - rr.lo + 1;
+        if (rr.lo <= r) {
+            rr.hi = r;
+            ranges_.insert(rr);
+            nrunes_ += rr.hi - rr.lo + 1;
+        }
+    }
+}
+
+void CharClassBuilder::Negate() {
+    // Build up negation and then copy in.
+    // Could edit ranges in place, but C++ won't let me.
+    std::vector<RuneRange> v;
+    v.reserve(ranges_.size() + 1);
+
+    // In negation, first range begins at 0, unless
+    // the current class begins at 0.
+    iterator it = begin();
+    if (it == end()) {
+        v.push_back(RuneRange(0, Runemax));
+    } else {
+        int nextlo = 0;
+        if (it->lo == 0) {
+            nextlo = it->hi + 1;
+            ++it;
+        }
+        for (; it != end(); ++it) {
+            v.push_back(RuneRange(nextlo, it->lo - 1));
+            nextlo = it->hi + 1;
+        }
+        if (nextlo <= Runemax)
+            v.push_back(RuneRange(nextlo, Runemax));
+    }
+
+    ranges_.clear();
+    for (size_t i = 0; i < v.size(); i++)
+        ranges_.insert(v[i]);
+
+    upper_ = AlphaMask & ~upper_;
+    lower_ = AlphaMask & ~lower_;
+    nrunes_ = Runemax + 1 - nrunes_;
+}
+
+// Character class is a sorted list of ranges.
+// The ranges are allocated in the same block as the header,
+// necessitating a special allocator and Delete method.
+
+CharClass* CharClass::New(size_t maxranges) {
+    CharClass* cc;
+    uint8_t* data = new uint8_t[sizeof *cc + maxranges * sizeof cc->ranges_[0]];
+    cc = reinterpret_cast<CharClass*>(data);
+    cc->ranges_ = reinterpret_cast<RuneRange*>(data + sizeof *cc);
+    cc->nranges_ = 0;
+    cc->folds_ascii_ = false;
+    cc->nrunes_ = 0;
+    return cc;
+}
+
+void CharClass::Delete() {
+    uint8_t* data = reinterpret_cast<uint8_t*>(this);
+    delete[] data;
+}
+
+CharClass* CharClass::Negate() {
+    CharClass* cc = CharClass::New(static_cast<size_t>(nranges_ + 1));
+    cc->folds_ascii_ = folds_ascii_;
+    cc->nrunes_ = Runemax + 1 - nrunes_;
+    int n = 0;
+    int nextlo = 0;
+    for (CharClass::iterator it = begin(); it != end(); ++it) {
+        if (it->lo == nextlo) {
+            nextlo = it->hi + 1;
+        } else {
+            cc->ranges_[n++] = RuneRange(nextlo, it->lo - 1);
+            nextlo = it->hi + 1;
+        }
+    }
+    if (nextlo <= Runemax)
+        cc->ranges_[n++] = RuneRange(nextlo, Runemax);
+    cc->nranges_ = n;
+    return cc;
+}
+
+bool CharClass::Contains(Rune r) const {
+    RuneRange* rr = ranges_;
+    int n = nranges_;
+    while (n > 0) {
+        int m = n / 2;
+        if (rr[m].hi < r) {
+            rr += m + 1;
+            n -= m + 1;
+        } else if (r < rr[m].lo) {
+            n = m;
+        } else { // rr[m].lo <= r && r <= rr[m].hi
+            return true;
+        }
+    }
+    return false;
+}
+
+CharClass* CharClassBuilder::GetCharClass() {
+    CharClass* cc = CharClass::New(ranges_.size());
+    int n = 0;
+    for (iterator it = begin(); it != end(); ++it)
+        cc->ranges_[n++] = *it;
+    cc->nranges_ = n;
+    DCHECK_LE(n, static_cast<int>(ranges_.size()));
+    cc->nrunes_ = nrunes_;
+    cc->folds_ascii_ = FoldsASCII();
+    return cc;
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/rune.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/rune.cpp
new file mode 100644
index 0000000000..fc5ae6934c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/rune.cpp
@@ -0,0 +1,247 @@
+/*
+ * The authors of this software are Rob Pike and Ken Thompson.
+ *              Copyright (c) 2002 by Lucent Technologies.
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose without fee is hereby granted, provided that this entire notice
+ * is included in all copies of any software which is or includes a copy
+ * or modification of this software and in all copies of the supporting
+ * documentation for such software.
+ * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
+ * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY
+ * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
+ * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
+ */
+
+#include <stdarg.h>
+#include <string.h>
+
+#include "utf.h"
+
+namespace lbug {
+namespace regex {
+
+enum {
+    Bit1 = 7,
+    Bitx = 6,
+    Bit2 = 5,
+    Bit3 = 4,
+    Bit4 = 3,
+    Bit5 = 2,
+
+    T1 = ((1 << (Bit1 + 1)) - 1) ^ 0xFF, /* 0000 0000 */
+    Tx = ((1 << (Bitx + 1)) - 1) ^ 0xFF, /* 1000 0000 */
+    T2 = ((1 << (Bit2 + 1)) - 1) ^ 0xFF, /* 1100 0000 */
+    T3 = ((1 << (Bit3 + 1)) - 1) ^ 0xFF, /* 1110 0000 */
+    T4 = ((1 << (Bit4 + 1)) - 1) ^ 0xFF, /* 1111 0000 */
+    T5 = ((1 << (Bit5 + 1)) - 1) ^ 0xFF, /* 1111 1000 */
+
+    Rune1 = (1 << (Bit1 + 0 * Bitx)) - 1, /* 0000 0000 0111 1111 */
+    Rune2 = (1 << (Bit2 + 1 * Bitx)) - 1, /* 0000 0111 1111 1111 */
+    Rune3 = (1 << (Bit3 + 2 * Bitx)) - 1, /* 1111 1111 1111 1111 */
+    Rune4 = (1 << (Bit4 + 3 * Bitx)) - 1,
+    /* 0001 1111 1111 1111 1111 1111 */
+
+    Maskx = (1 << Bitx) - 1, /* 0011 1111 */
+    Testx = Maskx ^ 0xFF,    /* 1100 0000 */
+
+    Bad = Runeerror,
+};
+
+int chartorune(Rune* rune, const char* str) {
+    int c, c1, c2, c3;
+    long l;
+
+    /*
+     * one character sequence
+     *	00000-0007F => T1
+     */
+    c = *(unsigned char*)str;
+    if (c < Tx) {
+        *rune = c;
+        return 1;
+    }
+
+    /*
+     * two character sequence
+     *	0080-07FF => T2 Tx
+     */
+    c1 = *(unsigned char*)(str + 1) ^ Tx;
+    if (c1 & Testx)
+        goto bad;
+    if (c < T3) {
+        if (c < T2)
+            goto bad;
+        l = ((c << Bitx) | c1) & Rune2;
+        if (l <= Rune1)
+            goto bad;
+        *rune = l;
+        return 2;
+    }
+
+    /*
+     * three character sequence
+     *	0800-FFFF => T3 Tx Tx
+     */
+    c2 = *(unsigned char*)(str + 2) ^ Tx;
+    if (c2 & Testx)
+        goto bad;
+    if (c < T4) {
+        l = ((((c << Bitx) | c1) << Bitx) | c2) & Rune3;
+        if (l <= Rune2)
+            goto bad;
+        *rune = l;
+        return 3;
+    }
+
+    /*
+     * four character sequence (21-bit value)
+     *	10000-1FFFFF => T4 Tx Tx Tx
+     */
+    c3 = *(unsigned char*)(str + 3) ^ Tx;
+    if (c3 & Testx)
+        goto bad;
+    if (c < T5) {
+        l = ((((((c << Bitx) | c1) << Bitx) | c2) << Bitx) | c3) & Rune4;
+        if (l <= Rune3)
+            goto bad;
+        *rune = l;
+        return 4;
+    }
+
+    /*
+     * Support for 5-byte or longer UTF-8 would go here, but
+     * since we don't have that, we'll just fall through to bad.
+     */
+
+    /*
+     * bad decoding
+     */
+bad:
+    *rune = Bad;
+    return 1;
+}
+
+int runetochar(char* str, const Rune* rune) {
+    /* Runes are signed, so convert to unsigned for range check. */
+    unsigned long c;
+
+    /*
+     * one character sequence
+     *	00000-0007F => 00-7F
+     */
+    c = *rune;
+    if (c <= Rune1) {
+        str[0] = static_cast<char>(c);
+        return 1;
+    }
+
+    /*
+     * two character sequence
+     *	0080-07FF => T2 Tx
+     */
+    if (c <= Rune2) {
+        str[0] = T2 | static_cast<char>(c >> 1 * Bitx);
+        str[1] = Tx | (c & Maskx);
+        return 2;
+    }
+
+    /*
+     * If the Rune is out of range, convert it to the error rune.
+     * Do this test here because the error rune encodes to three bytes.
+     * Doing it earlier would duplicate work, since an out of range
+     * Rune wouldn't have fit in one or two bytes.
+     */
+    if (c > Runemax)
+        c = Runeerror;
+
+    /*
+     * three character sequence
+     *	0800-FFFF => T3 Tx Tx
+     */
+    if (c <= Rune3) {
+        str[0] = T3 | static_cast<char>(c >> 2 * Bitx);
+        str[1] = Tx | ((c >> 1 * Bitx) & Maskx);
+        str[2] = Tx | (c & Maskx);
+        return 3;
+    }
+
+    /*
+     * four character sequence (21-bit value)
+     *     10000-1FFFFF => T4 Tx Tx Tx
+     */
+    str[0] = T4 | static_cast<char>(c >> 3 * Bitx);
+    str[1] = Tx | ((c >> 2 * Bitx) & Maskx);
+    str[2] = Tx | ((c >> 1 * Bitx) & Maskx);
+    str[3] = Tx | (c & Maskx);
+    return 4;
+}
+
+int runelen(Rune rune) {
+    char str[10];
+
+    return runetochar(str, &rune);
+}
+
+int fullrune(const char* str, int n) {
+    if (n > 0) {
+        int c = *(unsigned char*)str;
+        if (c < Tx)
+            return 1;
+        if (n > 1) {
+            if (c < T3)
+                return 1;
+            if (n > 2) {
+                if (c < T4 || n > 3)
+                    return 1;
+            }
+        }
+    }
+    return 0;
+}
+
+int utflen(const char* s) {
+    int c;
+    long n;
+    Rune rune;
+
+    n = 0;
+    for (;;) {
+        c = *(unsigned char*)s;
+        if (c < Runeself) {
+            if (c == 0)
+                return n;
+            s++;
+        } else
+            s += chartorune(&rune, s);
+        n++;
+    }
+    return 0;
+}
+
+char* utfrune(const char* s, Rune c) {
+    long c1;
+    Rune r;
+    int n;
+
+    if (c < Runesync) /* not part of utf sequence */
+        return strchr((char*)s, c);
+
+    for (;;) {
+        c1 = *(unsigned char*)s;
+        if (c1 < Runeself) { /* one byte rune */
+            if (c1 == 0)
+                return 0;
+            if (c1 == c)
+                return (char*)s;
+            s++;
+            continue;
+        }
+        n = chartorune(&r, s);
+        if (r == c)
+            return (char*)s;
+        s += n;
+    }
+    return 0;
+}
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/set.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/set.cpp
new file mode 100644
index 0000000000..f5d94777d7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/set.cpp
@@ -0,0 +1,151 @@
+// Copyright 2010 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#include "set.h"
+
+#include <stddef.h>
+
+#include <algorithm>
+#include <memory>
+
+#include "logging.h"
+#include "pod_array.h"
+#include "prog.h"
+#include "re2.h"
+#include "regexp.h"
+#include "stringpiece.h"
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+RE2::Set::Set(const RE2::Options& options, RE2::Anchor anchor) {
+    options_.Copy(options);
+    options_.set_never_capture(true); // might unblock some optimisations
+    anchor_ = anchor;
+    prog_ = NULL;
+    compiled_ = false;
+    size_ = 0;
+}
+
+RE2::Set::~Set() {
+    for (size_t i = 0; i < elem_.size(); i++)
+        elem_[i].second->Decref();
+    delete prog_;
+}
+
+int RE2::Set::Add(const StringPiece& pattern, std::string* error) {
+    if (compiled_) {
+        LOG(DFATAL) << "RE2::Set::Add() called after compiling";
+        return -1;
+    }
+
+    Regexp::ParseFlags pf = static_cast<Regexp::ParseFlags>(options_.ParseFlags());
+    RegexpStatus status;
+    lbug::regex::Regexp* re = Regexp::Parse(pattern, pf, &status);
+    if (re == NULL) {
+        if (error != NULL)
+            *error = status.Text();
+        if (options_.log_errors())
+            LOG(ERROR) << "Error parsing '" << pattern << "': " << status.Text();
+        return -1;
+    }
+
+    // Concatenate with match index and push on vector.
+    int n = static_cast<int>(elem_.size());
+    lbug::regex::Regexp* m = lbug::regex::Regexp::HaveMatch(n, pf);
+    if (re->op() == kRegexpConcat) {
+        int nsub = re->nsub();
+        PODArray<lbug::regex::Regexp*> sub(nsub + 1);
+        for (int i = 0; i < nsub; i++)
+            sub[i] = re->sub()[i]->Incref();
+        sub[nsub] = m;
+        re->Decref();
+        re = lbug::regex::Regexp::Concat(sub.data(), nsub + 1, pf);
+    } else {
+        lbug::regex::Regexp* sub[2];
+        sub[0] = re;
+        sub[1] = m;
+        re = lbug::regex::Regexp::Concat(sub, 2, pf);
+    }
+    elem_.emplace_back(std::string(pattern), re);
+    return n;
+}
+
+bool RE2::Set::Compile() {
+    if (compiled_) {
+        LOG(DFATAL) << "RE2::Set::Compile() called more than once";
+        return false;
+    }
+    compiled_ = true;
+    size_ = static_cast<int>(elem_.size());
+
+    // Sort the elements by their patterns. This is good enough for now
+    // until we have a Regexp comparison function. (Maybe someday...)
+    std::sort(elem_.begin(), elem_.end(),
+        [](const Elem& a, const Elem& b) -> bool { return a.first < b.first; });
+
+    PODArray<lbug::regex::Regexp*> sub(size_);
+    for (int i = 0; i < size_; i++)
+        sub[i] = elem_[i].second;
+    elem_.clear();
+    elem_.shrink_to_fit();
+
+    Regexp::ParseFlags pf = static_cast<Regexp::ParseFlags>(options_.ParseFlags());
+    lbug::regex::Regexp* re = lbug::regex::Regexp::Alternate(sub.data(), size_, pf);
+
+    prog_ = Prog::CompileSet(re, anchor_, options_.max_mem());
+    re->Decref();
+    return prog_ != NULL;
+}
+
+bool RE2::Set::Match(const StringPiece& text, std::vector<int>* v) const {
+    return Match(text, v, NULL);
+}
+
+bool RE2::Set::Match(const StringPiece& text, std::vector<int>* v, ErrorInfo* error_info) const {
+    if (!compiled_) {
+        LOG(DFATAL) << "RE2::Set::Match() called before compiling";
+        if (error_info != NULL)
+            error_info->kind = kNotCompiled;
+        return false;
+    }
+    bool dfa_failed = false;
+    std::unique_ptr<SparseSet> matches;
+    if (v != NULL) {
+        matches.reset(new SparseSet(size_));
+        v->clear();
+    }
+    bool ret = prog_->SearchDFA(
+        text, text, Prog::kAnchored, Prog::kManyMatch, NULL, &dfa_failed, matches.get());
+    if (dfa_failed) {
+        if (options_.log_errors())
+            LOG(ERROR) << "DFA out of memory: size " << prog_->size() << ", "
+                       << "bytemap range " << prog_->bytemap_range() << ", "
+                       << "list count " << prog_->list_count();
+        if (error_info != NULL)
+            error_info->kind = kOutOfMemory;
+        return false;
+    }
+    if (ret == false) {
+        if (error_info != NULL)
+            error_info->kind = kNoError;
+        return false;
+    }
+    if (v != NULL) {
+        if (matches->empty()) {
+            LOG(DFATAL) << "RE2::Set::Match() matched, but no matches returned?!";
+            if (error_info != NULL)
+                error_info->kind = kInconsistent;
+            return false;
+        }
+        v->assign(matches->begin(), matches->end());
+    }
+    if (error_info != NULL)
+        error_info->kind = kNoError;
+    return true;
+}
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/simplify.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/simplify.cpp
new file mode 100644
index 0000000000..6239595129
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/simplify.cpp
@@ -0,0 +1,644 @@
+// Copyright 2006 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Rewrite POSIX and other features in re
+// to use simple extended regular expression features.
+// Also sort and simplify character classes.
+
+#include <string>
+
+#include "logging.h"
+#include "pod_array.h"
+#include "regexp.h"
+#include "utf.h"
+#include "util.h"
+#include "walker-inl.h"
+
+namespace lbug {
+namespace regex {
+
+// Parses the regexp src and then simplifies it and sets *dst to the
+// string representation of the simplified form.  Returns true on success.
+// Returns false and sets *error (if error != NULL) on error.
+bool Regexp::SimplifyRegexp(
+    const StringPiece& src, ParseFlags flags, std::string* dst, RegexpStatus* status) {
+    Regexp* re = Parse(src, flags, status);
+    if (re == NULL)
+        return false;
+    Regexp* sre = re->Simplify();
+    re->Decref();
+    if (sre == NULL) {
+        if (status) {
+            status->set_code(kRegexpInternalError);
+            status->set_error_arg(src);
+        }
+        return false;
+    }
+    *dst = sre->ToString();
+    sre->Decref();
+    return true;
+}
+
+// Assuming the simple_ flags on the children are accurate,
+// is this Regexp* simple?
+bool Regexp::ComputeSimple() {
+    Regexp** subs;
+    switch (op_) {
+    case kRegexpNoMatch:
+    case kRegexpEmptyMatch:
+    case kRegexpLiteral:
+    case kRegexpLiteralString:
+    case kRegexpBeginLine:
+    case kRegexpEndLine:
+    case kRegexpBeginText:
+    case kRegexpWordBoundary:
+    case kRegexpNoWordBoundary:
+    case kRegexpEndText:
+    case kRegexpAnyChar:
+    case kRegexpAnyByte:
+    case kRegexpHaveMatch:
+        return true;
+    case kRegexpConcat:
+    case kRegexpAlternate:
+        // These are simple as long as the subpieces are simple.
+        subs = sub();
+        for (int i = 0; i < nsub_; i++)
+            if (!subs[i]->simple())
+                return false;
+        return true;
+    case kRegexpCharClass:
+        // Simple as long as the char class is not empty, not full.
+        if (ccb_ != NULL)
+            return !ccb_->empty() && !ccb_->full();
+        return !cc_->empty() && !cc_->full();
+    case kRegexpCapture:
+        subs = sub();
+        return subs[0]->simple();
+    case kRegexpStar:
+    case kRegexpPlus:
+    case kRegexpQuest:
+        subs = sub();
+        if (!subs[0]->simple())
+            return false;
+        switch (subs[0]->op_) {
+        case kRegexpStar:
+        case kRegexpPlus:
+        case kRegexpQuest:
+        case kRegexpEmptyMatch:
+        case kRegexpNoMatch:
+            return false;
+        default:
+            break;
+        }
+        return true;
+    case kRegexpRepeat:
+        return false;
+    }
+    LOG(DFATAL) << "Case not handled in ComputeSimple: " << op_;
+    return false;
+}
+
+// Walker subclass used by Simplify.
+// Coalesces runs of star/plus/quest/repeat of the same literal along with any
+// occurrences of that literal into repeats of that literal. It also works for
+// char classes, any char and any byte.
+// PostVisit creates the coalesced result, which should then be simplified.
+class CoalesceWalker : public Regexp::Walker<Regexp*> {
+public:
+    CoalesceWalker() {}
+    virtual Regexp* PostVisit(
+        Regexp* re, Regexp* parent_arg, Regexp* pre_arg, Regexp** child_args, int nchild_args);
+    virtual Regexp* Copy(Regexp* re);
+    virtual Regexp* ShortVisit(Regexp* re, Regexp* parent_arg);
+
+private:
+    // These functions are declared inside CoalesceWalker so that
+    // they can edit the private fields of the Regexps they construct.
+
+    // Returns true if r1 and r2 can be coalesced. In particular, ensures that
+    // the parse flags are consistent. (They will not be checked again later.)
+    static bool CanCoalesce(Regexp* r1, Regexp* r2);
+
+    // Coalesces *r1ptr and *r2ptr. In most cases, the array elements afterwards
+    // will be empty match and the coalesced op. In other cases, where part of a
+    // literal string was removed to be coalesced, the array elements afterwards
+    // will be the coalesced op and the remainder of the literal string.
+    static void DoCoalesce(Regexp** r1ptr, Regexp** r2ptr);
+
+    CoalesceWalker(const CoalesceWalker&) = delete;
+    CoalesceWalker& operator=(const CoalesceWalker&) = delete;
+};
+
+// Walker subclass used by Simplify.
+// The simplify walk is purely post-recursive: given the simplified children,
+// PostVisit creates the simplified result.
+// The child_args are simplified Regexp*s.
+class SimplifyWalker : public Regexp::Walker<Regexp*> {
+public:
+    SimplifyWalker() {}
+    virtual Regexp* PreVisit(Regexp* re, Regexp* parent_arg, bool* stop);
+    virtual Regexp* PostVisit(
+        Regexp* re, Regexp* parent_arg, Regexp* pre_arg, Regexp** child_args, int nchild_args);
+    virtual Regexp* Copy(Regexp* re);
+    virtual Regexp* ShortVisit(Regexp* re, Regexp* parent_arg);
+
+private:
+    // These functions are declared inside SimplifyWalker so that
+    // they can edit the private fields of the Regexps they construct.
+
+    // Creates a concatenation of two Regexp, consuming refs to re1 and re2.
+    // Caller must Decref return value when done with it.
+    static Regexp* Concat2(Regexp* re1, Regexp* re2, Regexp::ParseFlags flags);
+
+    // Simplifies the expression re{min,max} in terms of *, +, and ?.
+    // Returns a new regexp.  Does not edit re.  Does not consume reference to re.
+    // Caller must Decref return value when done with it.
+    static Regexp* SimplifyRepeat(Regexp* re, int min, int max, Regexp::ParseFlags parse_flags);
+
+    // Simplifies a character class by expanding any named classes
+    // into rune ranges.  Does not edit re.  Does not consume ref to re.
+    // Caller must Decref return value when done with it.
+    static Regexp* SimplifyCharClass(Regexp* re);
+
+    SimplifyWalker(const SimplifyWalker&) = delete;
+    SimplifyWalker& operator=(const SimplifyWalker&) = delete;
+};
+
+// Simplifies a regular expression, returning a new regexp.
+// The new regexp uses traditional Unix egrep features only,
+// plus the Perl (?:) non-capturing parentheses.
+// Otherwise, no POSIX or Perl additions.  The new regexp
+// captures exactly the same subexpressions (with the same indices)
+// as the original.
+// Does not edit current object.
+// Caller must Decref() return value when done with it.
+
+Regexp* Regexp::Simplify() {
+    CoalesceWalker cw;
+    Regexp* cre = cw.Walk(this, NULL);
+    if (cre == NULL)
+        return NULL;
+    if (cw.stopped_early()) {
+        cre->Decref();
+        return NULL;
+    }
+    SimplifyWalker sw;
+    Regexp* sre = sw.Walk(cre, NULL);
+    cre->Decref();
+    if (sre == NULL)
+        return NULL;
+    if (sw.stopped_early()) {
+        sre->Decref();
+        return NULL;
+    }
+    return sre;
+}
+
+#define Simplify DontCallSimplify // Avoid accidental recursion
+
+// Utility function for PostVisit implementations that compares re->sub() with
+// child_args to determine whether any child_args changed. In the common case,
+// where nothing changed, calls Decref() for all child_args and returns false,
+// so PostVisit must return re->Incref(). Otherwise, returns true.
+static bool ChildArgsChanged(Regexp* re, Regexp** child_args) {
+    for (int i = 0; i < re->nsub(); i++) {
+        Regexp* sub = re->sub()[i];
+        Regexp* newsub = child_args[i];
+        if (newsub != sub)
+            return true;
+    }
+    for (int i = 0; i < re->nsub(); i++) {
+        Regexp* newsub = child_args[i];
+        newsub->Decref();
+    }
+    return false;
+}
+
+Regexp* CoalesceWalker::Copy(Regexp* re) {
+    return re->Incref();
+}
+
+Regexp* CoalesceWalker::ShortVisit(Regexp* re, Regexp* parent_arg) {
+    // Should never be called: we use Walk(), not WalkExponential().
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+    LOG(DFATAL) << "CoalesceWalker::ShortVisit called";
+#endif
+    return re->Incref();
+}
+
+Regexp* CoalesceWalker::PostVisit(
+    Regexp* re, Regexp* parent_arg, Regexp* pre_arg, Regexp** child_args, int nchild_args) {
+    if (re->nsub() == 0)
+        return re->Incref();
+
+    if (re->op() != kRegexpConcat) {
+        if (!ChildArgsChanged(re, child_args))
+            return re->Incref();
+
+        // Something changed. Build a new op.
+        Regexp* nre = new Regexp(re->op(), re->parse_flags());
+        nre->AllocSub(re->nsub());
+        Regexp** nre_subs = nre->sub();
+        for (int i = 0; i < re->nsub(); i++)
+            nre_subs[i] = child_args[i];
+        // Repeats and Captures have additional data that must be copied.
+        if (re->op() == kRegexpRepeat) {
+            nre->min_ = re->min();
+            nre->max_ = re->max();
+        } else if (re->op() == kRegexpCapture) {
+            nre->cap_ = re->cap();
+        }
+        return nre;
+    }
+
+    bool can_coalesce = false;
+    for (int i = 0; i < re->nsub(); i++) {
+        if (i + 1 < re->nsub() && CanCoalesce(child_args[i], child_args[i + 1])) {
+            can_coalesce = true;
+            break;
+        }
+    }
+    if (!can_coalesce) {
+        if (!ChildArgsChanged(re, child_args))
+            return re->Incref();
+
+        // Something changed. Build a new op.
+        Regexp* nre = new Regexp(re->op(), re->parse_flags());
+        nre->AllocSub(re->nsub());
+        Regexp** nre_subs = nre->sub();
+        for (int i = 0; i < re->nsub(); i++)
+            nre_subs[i] = child_args[i];
+        return nre;
+    }
+
+    for (int i = 0; i < re->nsub(); i++) {
+        if (i + 1 < re->nsub() && CanCoalesce(child_args[i], child_args[i + 1]))
+            DoCoalesce(&child_args[i], &child_args[i + 1]);
+    }
+    // Determine how many empty matches were left by DoCoalesce.
+    int n = 0;
+    for (int i = n; i < re->nsub(); i++) {
+        if (child_args[i]->op() == kRegexpEmptyMatch)
+            n++;
+    }
+    // Build a new op.
+    Regexp* nre = new Regexp(re->op(), re->parse_flags());
+    nre->AllocSub(re->nsub() - n);
+    Regexp** nre_subs = nre->sub();
+    for (int i = 0, j = 0; i < re->nsub(); i++) {
+        if (child_args[i]->op() == kRegexpEmptyMatch) {
+            child_args[i]->Decref();
+            continue;
+        }
+        nre_subs[j] = child_args[i];
+        j++;
+    }
+    return nre;
+}
+
+bool CoalesceWalker::CanCoalesce(Regexp* r1, Regexp* r2) {
+    // r1 must be a star/plus/quest/repeat of a literal, char class, any char or
+    // any byte.
+    if ((r1->op() == kRegexpStar || r1->op() == kRegexpPlus || r1->op() == kRegexpQuest ||
+            r1->op() == kRegexpRepeat) &&
+        (r1->sub()[0]->op() == kRegexpLiteral || r1->sub()[0]->op() == kRegexpCharClass ||
+            r1->sub()[0]->op() == kRegexpAnyChar || r1->sub()[0]->op() == kRegexpAnyByte)) {
+        // r2 must be a star/plus/quest/repeat of the same literal, char class,
+        // any char or any byte.
+        if ((r2->op() == kRegexpStar || r2->op() == kRegexpPlus || r2->op() == kRegexpQuest ||
+                r2->op() == kRegexpRepeat) &&
+            Regexp::Equal(r1->sub()[0], r2->sub()[0]) &&
+            // The parse flags must be consistent.
+            ((r1->parse_flags() & Regexp::NonGreedy) == (r2->parse_flags() & Regexp::NonGreedy))) {
+            return true;
+        }
+        // ... OR an occurrence of that literal, char class, any char or any byte
+        if (Regexp::Equal(r1->sub()[0], r2)) {
+            return true;
+        }
+        // ... OR a literal string that begins with that literal.
+        if (r1->sub()[0]->op() == kRegexpLiteral && r2->op() == kRegexpLiteralString &&
+            r2->runes()[0] == r1->sub()[0]->rune() &&
+            // The parse flags must be consistent.
+            ((r1->sub()[0]->parse_flags() & Regexp::FoldCase) ==
+                (r2->parse_flags() & Regexp::FoldCase))) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void CoalesceWalker::DoCoalesce(Regexp** r1ptr, Regexp** r2ptr) {
+    Regexp* r1 = *r1ptr;
+    Regexp* r2 = *r2ptr;
+
+    Regexp* nre = Regexp::Repeat(r1->sub()[0]->Incref(), r1->parse_flags(), 0, 0);
+
+    switch (r1->op()) {
+    case kRegexpStar:
+        nre->min_ = 0;
+        nre->max_ = -1;
+        break;
+
+    case kRegexpPlus:
+        nre->min_ = 1;
+        nre->max_ = -1;
+        break;
+
+    case kRegexpQuest:
+        nre->min_ = 0;
+        nre->max_ = 1;
+        break;
+
+    case kRegexpRepeat:
+        nre->min_ = r1->min();
+        nre->max_ = r1->max();
+        break;
+
+    default:
+        nre->Decref();
+        LOG(DFATAL) << "DoCoalesce failed: r1->op() is " << r1->op();
+        return;
+    }
+
+    switch (r2->op()) {
+    case kRegexpStar:
+        nre->max_ = -1;
+        goto LeaveEmpty;
+
+    case kRegexpPlus:
+        nre->min_++;
+        nre->max_ = -1;
+        goto LeaveEmpty;
+
+    case kRegexpQuest:
+        if (nre->max() != -1)
+            nre->max_++;
+        goto LeaveEmpty;
+
+    case kRegexpRepeat:
+        nre->min_ += r2->min();
+        if (r2->max() == -1)
+            nre->max_ = -1;
+        else if (nre->max() != -1)
+            nre->max_ += r2->max();
+        goto LeaveEmpty;
+
+    case kRegexpLiteral:
+    case kRegexpCharClass:
+    case kRegexpAnyChar:
+    case kRegexpAnyByte:
+        nre->min_++;
+        if (nre->max() != -1)
+            nre->max_++;
+        goto LeaveEmpty;
+
+    LeaveEmpty:
+        *r1ptr = new Regexp(kRegexpEmptyMatch, Regexp::NoParseFlags);
+        *r2ptr = nre;
+        break;
+
+    case kRegexpLiteralString: {
+        Rune r = r1->sub()[0]->rune();
+        // Determine how much of the literal string is removed.
+        // We know that we have at least one rune. :)
+        int n = 1;
+        while (n < r2->nrunes() && r2->runes()[n] == r)
+            n++;
+        nre->min_ += n;
+        if (nre->max() != -1)
+            nre->max_ += n;
+        if (n == r2->nrunes())
+            goto LeaveEmpty;
+        *r1ptr = nre;
+        *r2ptr = Regexp::LiteralString(&r2->runes()[n], r2->nrunes() - n, r2->parse_flags());
+        break;
+    }
+
+    default:
+        nre->Decref();
+        LOG(DFATAL) << "DoCoalesce failed: r2->op() is " << r2->op();
+        return;
+    }
+
+    r1->Decref();
+    r2->Decref();
+}
+
+Regexp* SimplifyWalker::Copy(Regexp* re) {
+    return re->Incref();
+}
+
+Regexp* SimplifyWalker::ShortVisit(Regexp* re, Regexp* parent_arg) {
+    // Should never be called: we use Walk(), not WalkExponential().
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+    LOG(DFATAL) << "SimplifyWalker::ShortVisit called";
+#endif
+    return re->Incref();
+}
+
+Regexp* SimplifyWalker::PreVisit(Regexp* re, Regexp* parent_arg, bool* stop) {
+    if (re->simple()) {
+        *stop = true;
+        return re->Incref();
+    }
+    return NULL;
+}
+
+Regexp* SimplifyWalker::PostVisit(
+    Regexp* re, Regexp* parent_arg, Regexp* pre_arg, Regexp** child_args, int nchild_args) {
+    switch (re->op()) {
+    case kRegexpNoMatch:
+    case kRegexpEmptyMatch:
+    case kRegexpLiteral:
+    case kRegexpLiteralString:
+    case kRegexpBeginLine:
+    case kRegexpEndLine:
+    case kRegexpBeginText:
+    case kRegexpWordBoundary:
+    case kRegexpNoWordBoundary:
+    case kRegexpEndText:
+    case kRegexpAnyChar:
+    case kRegexpAnyByte:
+    case kRegexpHaveMatch:
+        // All these are always simple.
+        re->simple_ = true;
+        return re->Incref();
+
+    case kRegexpConcat:
+    case kRegexpAlternate: {
+        // These are simple as long as the subpieces are simple.
+        if (!ChildArgsChanged(re, child_args)) {
+            re->simple_ = true;
+            return re->Incref();
+        }
+        Regexp* nre = new Regexp(re->op(), re->parse_flags());
+        nre->AllocSub(re->nsub());
+        Regexp** nre_subs = nre->sub();
+        for (int i = 0; i < re->nsub(); i++)
+            nre_subs[i] = child_args[i];
+        nre->simple_ = true;
+        return nre;
+    }
+
+    case kRegexpCapture: {
+        Regexp* newsub = child_args[0];
+        if (newsub == re->sub()[0]) {
+            newsub->Decref();
+            re->simple_ = true;
+            return re->Incref();
+        }
+        Regexp* nre = new Regexp(kRegexpCapture, re->parse_flags());
+        nre->AllocSub(1);
+        nre->sub()[0] = newsub;
+        nre->cap_ = re->cap();
+        nre->simple_ = true;
+        return nre;
+    }
+
+    case kRegexpStar:
+    case kRegexpPlus:
+    case kRegexpQuest: {
+        Regexp* newsub = child_args[0];
+        // Special case: repeat the empty string as much as
+        // you want, but it's still the empty string.
+        if (newsub->op() == kRegexpEmptyMatch)
+            return newsub;
+
+        // These are simple as long as the subpiece is simple.
+        if (newsub == re->sub()[0]) {
+            newsub->Decref();
+            re->simple_ = true;
+            return re->Incref();
+        }
+
+        // These are also idempotent if flags are constant.
+        if (re->op() == newsub->op() && re->parse_flags() == newsub->parse_flags())
+            return newsub;
+
+        Regexp* nre = new Regexp(re->op(), re->parse_flags());
+        nre->AllocSub(1);
+        nre->sub()[0] = newsub;
+        nre->simple_ = true;
+        return nre;
+    }
+
+    case kRegexpRepeat: {
+        Regexp* newsub = child_args[0];
+        // Special case: repeat the empty string as much as
+        // you want, but it's still the empty string.
+        if (newsub->op() == kRegexpEmptyMatch)
+            return newsub;
+
+        Regexp* nre = SimplifyRepeat(newsub, re->min_, re->max_, re->parse_flags());
+        newsub->Decref();
+        nre->simple_ = true;
+        return nre;
+    }
+
+    case kRegexpCharClass: {
+        Regexp* nre = SimplifyCharClass(re);
+        nre->simple_ = true;
+        return nre;
+    }
+    }
+
+    LOG(ERROR) << "Simplify case not handled: " << re->op();
+    return re->Incref();
+}
+
+// Creates a concatenation of two Regexp, consuming refs to re1 and re2.
+// Returns a new Regexp, handing the ref to the caller.
+Regexp* SimplifyWalker::Concat2(Regexp* re1, Regexp* re2, Regexp::ParseFlags parse_flags) {
+    Regexp* re = new Regexp(kRegexpConcat, parse_flags);
+    re->AllocSub(2);
+    Regexp** subs = re->sub();
+    subs[0] = re1;
+    subs[1] = re2;
+    return re;
+}
+
+// Simplifies the expression re{min,max} in terms of *, +, and ?.
+// Returns a new regexp.  Does not edit re.  Does not consume reference to re.
+// Caller must Decref return value when done with it.
+// The result will *not* necessarily have the right capturing parens
+// if you call ToString() and re-parse it: (x){2} becomes (x)(x),
+// but in the Regexp* representation, both (x) are marked as $1.
+Regexp* SimplifyWalker::SimplifyRepeat(Regexp* re, int min, int max, Regexp::ParseFlags f) {
+    // x{n,} means at least n matches of x.
+    if (max == -1) {
+        // Special case: x{0,} is x*
+        if (min == 0)
+            return Regexp::Star(re->Incref(), f);
+
+        // Special case: x{1,} is x+
+        if (min == 1)
+            return Regexp::Plus(re->Incref(), f);
+
+        // General case: x{4,} is xxxx+
+        PODArray<Regexp*> nre_subs(min);
+        for (int i = 0; i < min - 1; i++)
+            nre_subs[i] = re->Incref();
+        nre_subs[min - 1] = Regexp::Plus(re->Incref(), f);
+        return Regexp::Concat(nre_subs.data(), min, f);
+    }
+
+    // Special case: (x){0} matches only empty string.
+    if (min == 0 && max == 0)
+        return new Regexp(kRegexpEmptyMatch, f);
+
+    // Special case: x{1} is just x.
+    if (min == 1 && max == 1)
+        return re->Incref();
+
+    // General case: x{n,m} means n copies of x and m copies of x?.
+    // The machine will do less work if we nest the final m copies,
+    // so that x{2,5} = xx(x(x(x)?)?)?
+
+    // Build leading prefix: xx.  Capturing only on the last one.
+    Regexp* nre = NULL;
+    if (min > 0) {
+        PODArray<Regexp*> nre_subs(min);
+        for (int i = 0; i < min; i++)
+            nre_subs[i] = re->Incref();
+        nre = Regexp::Concat(nre_subs.data(), min, f);
+    }
+
+    // Build and attach suffix: (x(x(x)?)?)?
+    if (max > min) {
+        Regexp* suf = Regexp::Quest(re->Incref(), f);
+        for (int i = min + 1; i < max; i++)
+            suf = Regexp::Quest(Concat2(re->Incref(), suf, f), f);
+        if (nre == NULL)
+            nre = suf;
+        else
+            nre = Concat2(nre, suf, f);
+    }
+
+    if (nre == NULL) {
+        // Some degenerate case, like min > max, or min < max < 0.
+        // This shouldn't happen, because the parser rejects such regexps.
+        LOG(DFATAL) << "Malformed repeat " << re->ToString() << " " << min << " " << max;
+        return new Regexp(kRegexpNoMatch, f);
+    }
+
+    return nre;
+}
+
+// Simplifies a character class.
+// Caller must Decref return value when done with it.
+Regexp* SimplifyWalker::SimplifyCharClass(Regexp* re) {
+    CharClass* cc = re->cc();
+
+    // Special cases
+    if (cc->empty())
+        return new Regexp(kRegexpNoMatch, re->parse_flags());
+    if (cc->full())
+        return new Regexp(kRegexpAnyChar, re->parse_flags());
+
+    return re->Incref();
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/stringpiece.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/stringpiece.cpp
new file mode 100644
index 0000000000..2a58f7af92
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/stringpiece.cpp
@@ -0,0 +1,71 @@
+// Copyright 2004 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#include "stringpiece.h"
+
+#include <ostream>
+
+#include "util.h"
+
+namespace lbug {
+namespace regex {
+
+const StringPiece::size_type StringPiece::npos; // initialized in stringpiece.h
+
+StringPiece::size_type StringPiece::copy(char* buf, size_type n, size_type pos) const {
+    size_type ret = std::min(size_ - pos, n);
+    memcpy(buf, data_ + pos, ret);
+    return ret;
+}
+
+StringPiece StringPiece::substr(size_type pos, size_type n) const {
+    if (pos > size_)
+        pos = size_;
+    if (n > size_ - pos)
+        n = size_ - pos;
+    return StringPiece(data_ + pos, n);
+}
+
+StringPiece::size_type StringPiece::find(const StringPiece& s, size_type pos) const {
+    if (pos > size_)
+        return npos;
+    const_pointer result = std::search(data_ + pos, data_ + size_, s.data_, s.data_ + s.size_);
+    size_type xpos = result - data_;
+    return xpos + s.size_ <= size_ ? xpos : npos;
+}
+
+StringPiece::size_type StringPiece::find(char c, size_type pos) const {
+    if (size_ <= 0 || pos >= size_)
+        return npos;
+    const_pointer result = std::find(data_ + pos, data_ + size_, c);
+    return result != data_ + size_ ? result - data_ : npos;
+}
+
+StringPiece::size_type StringPiece::rfind(const StringPiece& s, size_type pos) const {
+    if (size_ < s.size_)
+        return npos;
+    if (s.size_ == 0)
+        return std::min(size_, pos);
+    const_pointer last = data_ + std::min(size_ - s.size_, pos) + s.size_;
+    const_pointer result = std::find_end(data_, last, s.data_, s.data_ + s.size_);
+    return result != last ? result - data_ : npos;
+}
+
+StringPiece::size_type StringPiece::rfind(char c, size_type pos) const {
+    if (size_ <= 0)
+        return npos;
+    for (size_t i = std::min(pos + 1, size_); i != 0;) {
+        if (data_[--i] == c)
+            return i;
+    }
+    return npos;
+}
+
+std::ostream& operator<<(std::ostream& o, const StringPiece& p) {
+    o.write(p.data(), p.size());
+    return o;
+}
+
+} // namespace regex
+} // namespace lbug
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/strutil.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/strutil.cpp
new file mode 100644
index 0000000000..a2e9fa8a7a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/strutil.cpp
@@ -0,0 +1,183 @@
+// Copyright 1999-2005 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+#include "strutil.h"
+
+#include <stdarg.h>
+#include <stdio.h>
+
+#ifdef _WIN32
+#define snprintf _snprintf
+#define vsnprintf _vsnprintf
+#endif
+
+namespace lbug {
+namespace regex {
+
+// ----------------------------------------------------------------------
+// CEscapeString()
+//    Copies 'src' to 'dest', escaping dangerous characters using
+//    C-style escape sequences.  'src' and 'dest' should not overlap.
+//    Returns the number of bytes written to 'dest' (not including the \0)
+//    or (size_t)-1 if there was insufficient space.
+// ----------------------------------------------------------------------
+static size_t CEscapeString(const char* src, size_t src_len, char* dest, size_t dest_len) {
+    const char* src_end = src + src_len;
+    size_t used = 0;
+
+    for (; src < src_end; src++) {
+        if (dest_len - used < 2) // space for two-character escape
+            return (size_t)-1;
+
+        unsigned char c = *src;
+        switch (c) {
+        case '\n':
+            dest[used++] = '\\';
+            dest[used++] = 'n';
+            break;
+        case '\r':
+            dest[used++] = '\\';
+            dest[used++] = 'r';
+            break;
+        case '\t':
+            dest[used++] = '\\';
+            dest[used++] = 't';
+            break;
+        case '\"':
+            dest[used++] = '\\';
+            dest[used++] = '\"';
+            break;
+        case '\'':
+            dest[used++] = '\\';
+            dest[used++] = '\'';
+            break;
+        case '\\':
+            dest[used++] = '\\';
+            dest[used++] = '\\';
+            break;
+        default:
+            // Note that if we emit \xNN and the src character after that is a hex
+            // digit then that digit must be escaped too to prevent it being
+            // interpreted as part of the character code by C.
+            if (c < ' ' || c > '~') {
+                if (dest_len - used < 5) // space for four-character escape + \0
+                    return (size_t)-1;
+                snprintf(dest + used, 5, "\\%03o", c);
+                used += 4;
+            } else {
+                dest[used++] = c;
+                break;
+            }
+        }
+    }
+
+    if (dest_len - used < 1) // make sure that there is room for \0
+        return (size_t)-1;
+
+    dest[used] = '\0'; // doesn't count towards return value though
+    return used;
+}
+
+// ----------------------------------------------------------------------
+// CEscape()
+//    Copies 'src' to result, escaping dangerous characters using
+//    C-style escape sequences.  'src' and 'dest' should not overlap.
+// ----------------------------------------------------------------------
+std::string CEscape(const StringPiece& src) {
+    const size_t dest_len = src.size() * 4 + 1; // Maximum possible expansion
+    char* dest = new char[dest_len];
+    const size_t used = CEscapeString(src.data(), src.size(), dest, dest_len);
+    std::string s = std::string(dest, used);
+    delete[] dest;
+    return s;
+}
+
+void PrefixSuccessor(std::string* prefix) {
+    // We can increment the last character in the string and be done
+    // unless that character is 255, in which case we have to erase the
+    // last character and increment the previous character, unless that
+    // is 255, etc. If the string is empty or consists entirely of
+    // 255's, we just return the empty string.
+    while (!prefix->empty()) {
+        char& c = prefix->back();
+        if (c == '\xff') { // char literal avoids signed/unsigned.
+            prefix->pop_back();
+        } else {
+            ++c;
+            break;
+        }
+    }
+}
+
+static void StringAppendV(std::string* dst, const char* format, va_list ap) {
+    // First try with a small fixed size buffer
+    char space[1024];
+
+    // It's possible for methods that use a va_list to invalidate
+    // the data in it upon use.  The fix is to make a copy
+    // of the structure before using it and use that copy instead.
+    va_list backup_ap;
+    va_copy(backup_ap, ap);
+    int result = vsnprintf(space, sizeof(space), format, backup_ap);
+    va_end(backup_ap);
+
+    if ((result >= 0) && (static_cast<size_t>(result) < sizeof(space))) {
+        // It fit
+        dst->append(space, result);
+        return;
+    }
+
+    // Repeatedly increase buffer size until it fits
+    int length = sizeof(space);
+    while (true) {
+        if (result < 0) {
+            // Older behavior: just try doubling the buffer size
+            length *= 2;
+        } else {
+            // We need exactly "result+1" characters
+            length = result + 1;
+        }
+        char* buf = new char[length];
+
+        // Restore the va_list before we use it again
+        va_copy(backup_ap, ap);
+        result = vsnprintf(buf, length, format, backup_ap);
+        va_end(backup_ap);
+
+        if ((result >= 0) && (result < length)) {
+            // It fit
+            dst->append(buf, result);
+            delete[] buf;
+            return;
+        }
+        delete[] buf;
+    }
+}
+
+std::string StringPrintf(const char* format, ...) {
+    va_list ap;
+    va_start(ap, format);
+    std::string result;
+    StringAppendV(&result, format, ap);
+    va_end(ap);
+    return result;
+}
+
+void SStringPrintf(std::string* dst, const char* format, ...) {
+    va_list ap;
+    va_start(ap, format);
+    dst->clear();
+    StringAppendV(dst, format, ap);
+    va_end(ap);
+}
+
+void StringAppendF(std::string* dst, const char* format, ...) {
+    va_list ap;
+    va_start(ap, format);
+    StringAppendV(dst, format, ap);
+    va_end(ap);
+}
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/tostring.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/tostring.cpp
new file mode 100644
index 0000000000..a548829b62
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/tostring.cpp
@@ -0,0 +1,348 @@
+// Copyright 2006 The RE2 Authors.  All Rights Reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Format a regular expression structure as a string.
+// Tested by parse_test.cc
+
+#include <string.h>
+
+#include <string>
+
+#include "logging.h"
+#include "regexp.h"
+#include "strutil.h"
+#include "utf.h"
+#include "util.h"
+#include "walker-inl.h"
+
+namespace lbug {
+namespace regex {
+
+enum {
+    PrecAtom,
+    PrecUnary,
+    PrecConcat,
+    PrecAlternate,
+    PrecEmpty,
+    PrecParen,
+    PrecToplevel,
+};
+
+// Helper function.  See description below.
+static void AppendCCRange(std::string* t, Rune lo, Rune hi);
+
+// Walker to generate string in s_.
+// The arg pointers are actually integers giving the
+// context precedence.
+// The child_args are always NULL.
+class ToStringWalker : public Regexp::Walker<int> {
+public:
+    explicit ToStringWalker(std::string* t) : t_(t) {}
+
+    virtual int PreVisit(Regexp* re, int parent_arg, bool* stop);
+    virtual int PostVisit(
+        Regexp* re, int parent_arg, int pre_arg, int* child_args, int nchild_args);
+    virtual int ShortVisit(Regexp* re, int parent_arg) { return 0; }
+
+private:
+    std::string* t_; // The string the walker appends to.
+
+    ToStringWalker(const ToStringWalker&) = delete;
+    ToStringWalker& operator=(const ToStringWalker&) = delete;
+};
+
+std::string Regexp::ToString() {
+    std::string t;
+    ToStringWalker w(&t);
+    w.WalkExponential(this, PrecToplevel, 100000);
+    if (w.stopped_early())
+        t += " [truncated]";
+    return t;
+}
+
+// Visits re before children are processed.
+// Appends ( if needed and passes new precedence to children.
+int ToStringWalker::PreVisit(Regexp* re, int parent_arg, bool* stop) {
+    int prec = parent_arg;
+    int nprec = PrecAtom;
+
+    switch (re->op()) {
+    case kRegexpNoMatch:
+    case kRegexpEmptyMatch:
+    case kRegexpLiteral:
+    case kRegexpAnyChar:
+    case kRegexpAnyByte:
+    case kRegexpBeginLine:
+    case kRegexpEndLine:
+    case kRegexpBeginText:
+    case kRegexpEndText:
+    case kRegexpWordBoundary:
+    case kRegexpNoWordBoundary:
+    case kRegexpCharClass:
+    case kRegexpHaveMatch:
+        nprec = PrecAtom;
+        break;
+
+    case kRegexpConcat:
+    case kRegexpLiteralString:
+        if (prec < PrecConcat)
+            t_->append("(?:");
+        nprec = PrecConcat;
+        break;
+
+    case kRegexpAlternate:
+        if (prec < PrecAlternate)
+            t_->append("(?:");
+        nprec = PrecAlternate;
+        break;
+
+    case kRegexpCapture:
+        t_->append("(");
+        if (re->cap() == 0)
+            LOG(DFATAL) << "kRegexpCapture cap() == 0";
+        if (re->name()) {
+            t_->append("?P<");
+            t_->append(*re->name());
+            t_->append(">");
+        }
+        nprec = PrecParen;
+        break;
+
+    case kRegexpStar:
+    case kRegexpPlus:
+    case kRegexpQuest:
+    case kRegexpRepeat:
+        if (prec < PrecUnary)
+            t_->append("(?:");
+        // The subprecedence here is PrecAtom instead of PrecUnary
+        // because PCRE treats two unary ops in a row as a parse error.
+        nprec = PrecAtom;
+        break;
+    }
+
+    return nprec;
+}
+
+static void AppendLiteral(std::string* t, Rune r, bool foldcase) {
+    if (r != 0 && r < 0x80 && strchr("(){}[]*+?|.^$\\", r)) {
+        t->append(1, '\\');
+        t->append(1, static_cast<char>(r));
+    } else if (foldcase && 'a' <= r && r <= 'z') {
+        r -= 'a' - 'A';
+        t->append(1, '[');
+        t->append(1, static_cast<char>(r));
+        t->append(1, static_cast<char>(r) + 'a' - 'A');
+        t->append(1, ']');
+    } else {
+        AppendCCRange(t, r, r);
+    }
+}
+
+// Visits re after children are processed.
+// For childless regexps, all the work is done here.
+// For regexps with children, append any unary suffixes or ).
+int ToStringWalker::PostVisit(
+    Regexp* re, int parent_arg, int pre_arg, int* child_args, int nchild_args) {
+    int prec = parent_arg;
+    switch (re->op()) {
+    case kRegexpNoMatch:
+        // There's no simple symbol for "no match", but
+        // [^0-Runemax] excludes everything.
+        t_->append("[^\\x00-\\x{10ffff}]");
+        break;
+
+    case kRegexpEmptyMatch:
+        // Append (?:) to make empty string visible,
+        // unless this is already being parenthesized.
+        if (prec < PrecEmpty)
+            t_->append("(?:)");
+        break;
+
+    case kRegexpLiteral:
+        AppendLiteral(t_, re->rune(), (re->parse_flags() & Regexp::FoldCase) != 0);
+        break;
+
+    case kRegexpLiteralString:
+        for (int i = 0; i < re->nrunes(); i++)
+            AppendLiteral(t_, re->runes()[i], (re->parse_flags() & Regexp::FoldCase) != 0);
+        if (prec < PrecConcat)
+            t_->append(")");
+        break;
+
+    case kRegexpConcat:
+        if (prec < PrecConcat)
+            t_->append(")");
+        break;
+
+    case kRegexpAlternate:
+        // Clumsy but workable: the children all appended |
+        // at the end of their strings, so just remove the last one.
+        if ((*t_)[t_->size() - 1] == '|')
+            t_->erase(t_->size() - 1);
+        else
+            LOG(DFATAL) << "Bad final char: " << t_;
+        if (prec < PrecAlternate)
+            t_->append(")");
+        break;
+
+    case kRegexpStar:
+        t_->append("*");
+        if (re->parse_flags() & Regexp::NonGreedy)
+            t_->append("?");
+        if (prec < PrecUnary)
+            t_->append(")");
+        break;
+
+    case kRegexpPlus:
+        t_->append("+");
+        if (re->parse_flags() & Regexp::NonGreedy)
+            t_->append("?");
+        if (prec < PrecUnary)
+            t_->append(")");
+        break;
+
+    case kRegexpQuest:
+        t_->append("?");
+        if (re->parse_flags() & Regexp::NonGreedy)
+            t_->append("?");
+        if (prec < PrecUnary)
+            t_->append(")");
+        break;
+
+    case kRegexpRepeat:
+        if (re->max() == -1)
+            t_->append(StringPrintf("{%d,}", re->min()));
+        else if (re->min() == re->max())
+            t_->append(StringPrintf("{%d}", re->min()));
+        else
+            t_->append(StringPrintf("{%d,%d}", re->min(), re->max()));
+        if (re->parse_flags() & Regexp::NonGreedy)
+            t_->append("?");
+        if (prec < PrecUnary)
+            t_->append(")");
+        break;
+
+    case kRegexpAnyChar:
+        t_->append(".");
+        break;
+
+    case kRegexpAnyByte:
+        t_->append("\\C");
+        break;
+
+    case kRegexpBeginLine:
+        t_->append("^");
+        break;
+
+    case kRegexpEndLine:
+        t_->append("$");
+        break;
+
+    case kRegexpBeginText:
+        t_->append("(?-m:^)");
+        break;
+
+    case kRegexpEndText:
+        if (re->parse_flags() & Regexp::WasDollar)
+            t_->append("(?-m:$)");
+        else
+            t_->append("\\z");
+        break;
+
+    case kRegexpWordBoundary:
+        t_->append("\\b");
+        break;
+
+    case kRegexpNoWordBoundary:
+        t_->append("\\B");
+        break;
+
+    case kRegexpCharClass: {
+        if (re->cc()->size() == 0) {
+            t_->append("[^\\x00-\\x{10ffff}]");
+            break;
+        }
+        t_->append("[");
+        // Heuristic: show class as negated if it contains the
+        // non-character 0xFFFE.
+        CharClass* cc = re->cc();
+        if (cc->Contains(0xFFFE)) {
+            cc = cc->Negate();
+            t_->append("^");
+        }
+        for (CharClass::iterator i = cc->begin(); i != cc->end(); ++i)
+            AppendCCRange(t_, i->lo, i->hi);
+        if (cc != re->cc())
+            cc->Delete();
+        t_->append("]");
+        break;
+    }
+
+    case kRegexpCapture:
+        t_->append(")");
+        break;
+
+    case kRegexpHaveMatch:
+        // There's no syntax accepted by the parser to generate
+        // this node (it is generated by RE2::Set) so make something
+        // up that is readable but won't compile.
+        t_->append("(?HaveMatch:%d)", re->match_id());
+        break;
+    }
+
+    // If the parent is an alternation, append the | for it.
+    if (prec == PrecAlternate)
+        t_->append("|");
+
+    return 0;
+}
+
+// Appends a rune for use in a character class to the string t.
+static void AppendCCChar(std::string* t, Rune r) {
+    if (0x20 <= r && r <= 0x7E) {
+        if (strchr("[]^-\\", r))
+            t->append("\\");
+        t->append(1, static_cast<char>(r));
+        return;
+    }
+    switch (r) {
+    default:
+        break;
+
+    case '\r':
+        t->append("\\r");
+        return;
+
+    case '\t':
+        t->append("\\t");
+        return;
+
+    case '\n':
+        t->append("\\n");
+        return;
+
+    case '\f':
+        t->append("\\f");
+        return;
+    }
+
+    if (r < 0x100) {
+        StringAppendF(t, "\\x%02x", static_cast<int>(r));
+        return;
+    }
+    StringAppendF(t, "\\x{%x}", static_cast<int>(r));
+}
+
+static void AppendCCRange(std::string* t, Rune lo, Rune hi) {
+    if (lo > hi)
+        return;
+    AppendCCChar(t, lo);
+    if (lo < hi) {
+        t->append("-");
+        AppendCCChar(t, hi);
+    }
+}
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/unicode_casefold.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/unicode_casefold.cpp
new file mode 100644
index 0000000000..469dd261cc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/unicode_casefold.cpp
@@ -0,0 +1,564 @@
+
+// GENERATED BY make_unicode_casefold.py; DO NOT EDIT.
+// make_unicode_casefold.py >unicode_casefold.cc
+
+#include "unicode_casefold.h"
+
+namespace lbug {
+namespace regex {
+
+// 1374 groups, 2778 pairs, 349 ranges
+const CaseFold unicode_casefold[] = {
+    {65, 90, 32},
+    {97, 106, -32},
+    {107, 107, 8383},
+    {108, 114, -32},
+    {115, 115, 268},
+    {116, 122, -32},
+    {181, 181, 743},
+    {192, 214, 32},
+    {216, 222, 32},
+    {223, 223, 7615},
+    {224, 228, -32},
+    {229, 229, 8262},
+    {230, 246, -32},
+    {248, 254, -32},
+    {255, 255, 121},
+    {256, 303, EvenOdd},
+    {306, 311, EvenOdd},
+    {313, 328, OddEven},
+    {330, 375, EvenOdd},
+    {376, 376, -121},
+    {377, 382, OddEven},
+    {383, 383, -300},
+    {384, 384, 195},
+    {385, 385, 210},
+    {386, 389, EvenOdd},
+    {390, 390, 206},
+    {391, 392, OddEven},
+    {393, 394, 205},
+    {395, 396, OddEven},
+    {398, 398, 79},
+    {399, 399, 202},
+    {400, 400, 203},
+    {401, 402, OddEven},
+    {403, 403, 205},
+    {404, 404, 207},
+    {405, 405, 97},
+    {406, 406, 211},
+    {407, 407, 209},
+    {408, 409, EvenOdd},
+    {410, 410, 163},
+    {412, 412, 211},
+    {413, 413, 213},
+    {414, 414, 130},
+    {415, 415, 214},
+    {416, 421, EvenOdd},
+    {422, 422, 218},
+    {423, 424, OddEven},
+    {425, 425, 218},
+    {428, 429, EvenOdd},
+    {430, 430, 218},
+    {431, 432, OddEven},
+    {433, 434, 217},
+    {435, 438, OddEven},
+    {439, 439, 219},
+    {440, 441, EvenOdd},
+    {444, 445, EvenOdd},
+    {447, 447, 56},
+    {452, 452, EvenOdd},
+    {453, 453, OddEven},
+    {454, 454, -2},
+    {455, 455, OddEven},
+    {456, 456, EvenOdd},
+    {457, 457, -2},
+    {458, 458, EvenOdd},
+    {459, 459, OddEven},
+    {460, 460, -2},
+    {461, 476, OddEven},
+    {477, 477, -79},
+    {478, 495, EvenOdd},
+    {497, 497, OddEven},
+    {498, 498, EvenOdd},
+    {499, 499, -2},
+    {500, 501, EvenOdd},
+    {502, 502, -97},
+    {503, 503, -56},
+    {504, 543, EvenOdd},
+    {544, 544, -130},
+    {546, 563, EvenOdd},
+    {570, 570, 10795},
+    {571, 572, OddEven},
+    {573, 573, -163},
+    {574, 574, 10792},
+    {575, 576, 10815},
+    {577, 578, OddEven},
+    {579, 579, -195},
+    {580, 580, 69},
+    {581, 581, 71},
+    {582, 591, EvenOdd},
+    {592, 592, 10783},
+    {593, 593, 10780},
+    {594, 594, 10782},
+    {595, 595, -210},
+    {596, 596, -206},
+    {598, 599, -205},
+    {601, 601, -202},
+    {603, 603, -203},
+    {604, 604, 42319},
+    {608, 608, -205},
+    {609, 609, 42315},
+    {611, 611, -207},
+    {613, 613, 42280},
+    {614, 614, 42308},
+    {616, 616, -209},
+    {617, 617, -211},
+    {618, 618, 42308},
+    {619, 619, 10743},
+    {620, 620, 42305},
+    {623, 623, -211},
+    {625, 625, 10749},
+    {626, 626, -213},
+    {629, 629, -214},
+    {637, 637, 10727},
+    {640, 640, -218},
+    {643, 643, -218},
+    {647, 647, 42282},
+    {648, 648, -218},
+    {649, 649, -69},
+    {650, 651, -217},
+    {652, 652, -71},
+    {658, 658, -219},
+    {669, 669, 42261},
+    {670, 670, 42258},
+    {837, 837, 84},
+    {880, 883, EvenOdd},
+    {886, 887, EvenOdd},
+    {891, 893, 130},
+    {895, 895, 116},
+    {902, 902, 38},
+    {904, 906, 37},
+    {908, 908, 64},
+    {910, 911, 63},
+    {913, 929, 32},
+    {931, 931, 31},
+    {932, 939, 32},
+    {940, 940, -38},
+    {941, 943, -37},
+    {945, 945, -32},
+    {946, 946, 30},
+    {947, 948, -32},
+    {949, 949, 64},
+    {950, 951, -32},
+    {952, 952, 25},
+    {953, 953, 7173},
+    {954, 954, 54},
+    {955, 955, -32},
+    {956, 956, -775},
+    {957, 959, -32},
+    {960, 960, 22},
+    {961, 961, 48},
+    {962, 962, EvenOdd},
+    {963, 965, -32},
+    {966, 966, 15},
+    {967, 968, -32},
+    {969, 969, 7517},
+    {970, 971, -32},
+    {972, 972, -64},
+    {973, 974, -63},
+    {975, 975, 8},
+    {976, 976, -62},
+    {977, 977, 35},
+    {981, 981, -47},
+    {982, 982, -54},
+    {983, 983, -8},
+    {984, 1007, EvenOdd},
+    {1008, 1008, -86},
+    {1009, 1009, -80},
+    {1010, 1010, 7},
+    {1011, 1011, -116},
+    {1012, 1012, -92},
+    {1013, 1013, -96},
+    {1015, 1016, OddEven},
+    {1017, 1017, -7},
+    {1018, 1019, EvenOdd},
+    {1021, 1023, -130},
+    {1024, 1039, 80},
+    {1040, 1071, 32},
+    {1072, 1073, -32},
+    {1074, 1074, 6222},
+    {1075, 1075, -32},
+    {1076, 1076, 6221},
+    {1077, 1085, -32},
+    {1086, 1086, 6212},
+    {1087, 1088, -32},
+    {1089, 1090, 6210},
+    {1091, 1097, -32},
+    {1098, 1098, 6204},
+    {1099, 1103, -32},
+    {1104, 1119, -80},
+    {1120, 1122, EvenOdd},
+    {1123, 1123, 6180},
+    {1124, 1153, EvenOdd},
+    {1162, 1215, EvenOdd},
+    {1216, 1216, 15},
+    {1217, 1230, OddEven},
+    {1231, 1231, -15},
+    {1232, 1327, EvenOdd},
+    {1329, 1366, 48},
+    {1377, 1414, -48},
+    {4256, 4293, 7264},
+    {4295, 4295, 7264},
+    {4301, 4301, 7264},
+    {4304, 4346, 3008},
+    {4349, 4351, 3008},
+    {5024, 5103, 38864},
+    {5104, 5109, 8},
+    {5112, 5117, -8},
+    {7296, 7296, -6254},
+    {7297, 7297, -6253},
+    {7298, 7298, -6244},
+    {7299, 7299, -6242},
+    {7300, 7300, EvenOdd},
+    {7301, 7301, -6243},
+    {7302, 7302, -6236},
+    {7303, 7303, -6181},
+    {7304, 7304, 35266},
+    {7312, 7354, -3008},
+    {7357, 7359, -3008},
+    {7545, 7545, 35332},
+    {7549, 7549, 3814},
+    {7680, 7776, EvenOdd},
+    {7777, 7777, 58},
+    {7778, 7829, EvenOdd},
+    {7835, 7835, -59},
+    {7838, 7838, -7615},
+    {7840, 7935, EvenOdd},
+    {7936, 7943, 8},
+    {7944, 7951, -8},
+    {7952, 7957, 8},
+    {7960, 7965, -8},
+    {7968, 7975, 8},
+    {7976, 7983, -8},
+    {7984, 7991, 8},
+    {7992, 7999, -8},
+    {8000, 8005, 8},
+    {8008, 8013, -8},
+    {8017, 8017, 8},
+    {8019, 8019, 8},
+    {8021, 8021, 8},
+    {8023, 8023, 8},
+    {8025, 8025, -8},
+    {8027, 8027, -8},
+    {8029, 8029, -8},
+    {8031, 8031, -8},
+    {8032, 8039, 8},
+    {8040, 8047, -8},
+    {8048, 8049, 74},
+    {8050, 8053, 86},
+    {8054, 8055, 100},
+    {8056, 8057, 128},
+    {8058, 8059, 112},
+    {8060, 8061, 126},
+    {8064, 8071, 8},
+    {8072, 8079, -8},
+    {8080, 8087, 8},
+    {8088, 8095, -8},
+    {8096, 8103, 8},
+    {8104, 8111, -8},
+    {8112, 8113, 8},
+    {8115, 8115, 9},
+    {8120, 8121, -8},
+    {8122, 8123, -74},
+    {8124, 8124, -9},
+    {8126, 8126, -7289},
+    {8131, 8131, 9},
+    {8136, 8139, -86},
+    {8140, 8140, -9},
+    {8144, 8145, 8},
+    {8152, 8153, -8},
+    {8154, 8155, -100},
+    {8160, 8161, 8},
+    {8165, 8165, 7},
+    {8168, 8169, -8},
+    {8170, 8171, -112},
+    {8172, 8172, -7},
+    {8179, 8179, 9},
+    {8184, 8185, -128},
+    {8186, 8187, -126},
+    {8188, 8188, -9},
+    {8486, 8486, -7549},
+    {8490, 8490, -8415},
+    {8491, 8491, -8294},
+    {8498, 8498, 28},
+    {8526, 8526, -28},
+    {8544, 8559, 16},
+    {8560, 8575, -16},
+    {8579, 8580, OddEven},
+    {9398, 9423, 26},
+    {9424, 9449, -26},
+    {11264, 11310, 48},
+    {11312, 11358, -48},
+    {11360, 11361, EvenOdd},
+    {11362, 11362, -10743},
+    {11363, 11363, -3814},
+    {11364, 11364, -10727},
+    {11365, 11365, -10795},
+    {11366, 11366, -10792},
+    {11367, 11372, OddEven},
+    {11373, 11373, -10780},
+    {11374, 11374, -10749},
+    {11375, 11375, -10783},
+    {11376, 11376, -10782},
+    {11378, 11379, EvenOdd},
+    {11381, 11382, OddEven},
+    {11390, 11391, -10815},
+    {11392, 11491, EvenOdd},
+    {11499, 11502, OddEven},
+    {11506, 11507, EvenOdd},
+    {11520, 11557, -7264},
+    {11559, 11559, -7264},
+    {11565, 11565, -7264},
+    {42560, 42570, EvenOdd},
+    {42571, 42571, -35267},
+    {42572, 42605, EvenOdd},
+    {42624, 42651, EvenOdd},
+    {42786, 42799, EvenOdd},
+    {42802, 42863, EvenOdd},
+    {42873, 42876, OddEven},
+    {42877, 42877, -35332},
+    {42878, 42887, EvenOdd},
+    {42891, 42892, OddEven},
+    {42893, 42893, -42280},
+    {42896, 42899, EvenOdd},
+    {42902, 42921, EvenOdd},
+    {42922, 42922, -42308},
+    {42923, 42923, -42319},
+    {42924, 42924, -42315},
+    {42925, 42925, -42305},
+    {42926, 42926, -42308},
+    {42928, 42928, -42258},
+    {42929, 42929, -42282},
+    {42930, 42930, -42261},
+    {42931, 42931, 928},
+    {42932, 42937, EvenOdd},
+    {43859, 43859, -928},
+    {43888, 43967, -38864},
+    {65313, 65338, 32},
+    {65345, 65370, -32},
+    {66560, 66599, 40},
+    {66600, 66639, -40},
+    {66736, 66771, 40},
+    {66776, 66811, -40},
+    {68736, 68786, 64},
+    {68800, 68850, -64},
+    {71840, 71871, 32},
+    {71872, 71903, -32},
+    {93760, 93791, 32},
+    {93792, 93823, -32},
+    {125184, 125217, 34},
+    {125218, 125251, -34},
+};
+const int num_unicode_casefold = 349;
+
+// 1374 groups, 1404 pairs, 194 ranges
+const CaseFold unicode_tolower[] = {
+    {65, 90, 32},
+    {181, 181, 775},
+    {192, 214, 32},
+    {216, 222, 32},
+    {256, 302, EvenOddSkip},
+    {306, 310, EvenOddSkip},
+    {313, 327, OddEvenSkip},
+    {330, 374, EvenOddSkip},
+    {376, 376, -121},
+    {377, 381, OddEvenSkip},
+    {383, 383, -268},
+    {385, 385, 210},
+    {386, 388, EvenOddSkip},
+    {390, 390, 206},
+    {391, 391, OddEven},
+    {393, 394, 205},
+    {395, 395, OddEven},
+    {398, 398, 79},
+    {399, 399, 202},
+    {400, 400, 203},
+    {401, 401, OddEven},
+    {403, 403, 205},
+    {404, 404, 207},
+    {406, 406, 211},
+    {407, 407, 209},
+    {408, 408, EvenOdd},
+    {412, 412, 211},
+    {413, 413, 213},
+    {415, 415, 214},
+    {416, 420, EvenOddSkip},
+    {422, 422, 218},
+    {423, 423, OddEven},
+    {425, 425, 218},
+    {428, 428, EvenOdd},
+    {430, 430, 218},
+    {431, 431, OddEven},
+    {433, 434, 217},
+    {435, 437, OddEvenSkip},
+    {439, 439, 219},
+    {440, 440, EvenOdd},
+    {444, 444, EvenOdd},
+    {452, 452, 2},
+    {453, 453, OddEven},
+    {455, 455, 2},
+    {456, 456, EvenOdd},
+    {458, 458, 2},
+    {459, 475, OddEvenSkip},
+    {478, 494, EvenOddSkip},
+    {497, 497, 2},
+    {498, 500, EvenOddSkip},
+    {502, 502, -97},
+    {503, 503, -56},
+    {504, 542, EvenOddSkip},
+    {544, 544, -130},
+    {546, 562, EvenOddSkip},
+    {570, 570, 10795},
+    {571, 571, OddEven},
+    {573, 573, -163},
+    {574, 574, 10792},
+    {577, 577, OddEven},
+    {579, 579, -195},
+    {580, 580, 69},
+    {581, 581, 71},
+    {582, 590, EvenOddSkip},
+    {837, 837, 116},
+    {880, 882, EvenOddSkip},
+    {886, 886, EvenOdd},
+    {895, 895, 116},
+    {902, 902, 38},
+    {904, 906, 37},
+    {908, 908, 64},
+    {910, 911, 63},
+    {913, 929, 32},
+    {931, 939, 32},
+    {962, 962, EvenOdd},
+    {975, 975, 8},
+    {976, 976, -30},
+    {977, 977, -25},
+    {981, 981, -15},
+    {982, 982, -22},
+    {984, 1006, EvenOddSkip},
+    {1008, 1008, -54},
+    {1009, 1009, -48},
+    {1012, 1012, -60},
+    {1013, 1013, -64},
+    {1015, 1015, OddEven},
+    {1017, 1017, -7},
+    {1018, 1018, EvenOdd},
+    {1021, 1023, -130},
+    {1024, 1039, 80},
+    {1040, 1071, 32},
+    {1120, 1152, EvenOddSkip},
+    {1162, 1214, EvenOddSkip},
+    {1216, 1216, 15},
+    {1217, 1229, OddEvenSkip},
+    {1232, 1326, EvenOddSkip},
+    {1329, 1366, 48},
+    {4256, 4293, 7264},
+    {4295, 4295, 7264},
+    {4301, 4301, 7264},
+    {5112, 5117, -8},
+    {7296, 7296, -6222},
+    {7297, 7297, -6221},
+    {7298, 7298, -6212},
+    {7299, 7300, -6210},
+    {7301, 7301, -6211},
+    {7302, 7302, -6204},
+    {7303, 7303, -6180},
+    {7304, 7304, 35267},
+    {7312, 7354, -3008},
+    {7357, 7359, -3008},
+    {7680, 7828, EvenOddSkip},
+    {7835, 7835, -58},
+    {7838, 7838, -7615},
+    {7840, 7934, EvenOddSkip},
+    {7944, 7951, -8},
+    {7960, 7965, -8},
+    {7976, 7983, -8},
+    {7992, 7999, -8},
+    {8008, 8013, -8},
+    {8025, 8025, -8},
+    {8027, 8027, -8},
+    {8029, 8029, -8},
+    {8031, 8031, -8},
+    {8040, 8047, -8},
+    {8072, 8079, -8},
+    {8088, 8095, -8},
+    {8104, 8111, -8},
+    {8120, 8121, -8},
+    {8122, 8123, -74},
+    {8124, 8124, -9},
+    {8126, 8126, -7173},
+    {8136, 8139, -86},
+    {8140, 8140, -9},
+    {8152, 8153, -8},
+    {8154, 8155, -100},
+    {8168, 8169, -8},
+    {8170, 8171, -112},
+    {8172, 8172, -7},
+    {8184, 8185, -128},
+    {8186, 8187, -126},
+    {8188, 8188, -9},
+    {8486, 8486, -7517},
+    {8490, 8490, -8383},
+    {8491, 8491, -8262},
+    {8498, 8498, 28},
+    {8544, 8559, 16},
+    {8579, 8579, OddEven},
+    {9398, 9423, 26},
+    {11264, 11310, 48},
+    {11360, 11360, EvenOdd},
+    {11362, 11362, -10743},
+    {11363, 11363, -3814},
+    {11364, 11364, -10727},
+    {11367, 11371, OddEvenSkip},
+    {11373, 11373, -10780},
+    {11374, 11374, -10749},
+    {11375, 11375, -10783},
+    {11376, 11376, -10782},
+    {11378, 11378, EvenOdd},
+    {11381, 11381, OddEven},
+    {11390, 11391, -10815},
+    {11392, 11490, EvenOddSkip},
+    {11499, 11501, OddEvenSkip},
+    {11506, 11506, EvenOdd},
+    {42560, 42604, EvenOddSkip},
+    {42624, 42650, EvenOddSkip},
+    {42786, 42798, EvenOddSkip},
+    {42802, 42862, EvenOddSkip},
+    {42873, 42875, OddEvenSkip},
+    {42877, 42877, -35332},
+    {42878, 42886, EvenOddSkip},
+    {42891, 42891, OddEven},
+    {42893, 42893, -42280},
+    {42896, 42898, EvenOddSkip},
+    {42902, 42920, EvenOddSkip},
+    {42922, 42922, -42308},
+    {42923, 42923, -42319},
+    {42924, 42924, -42315},
+    {42925, 42925, -42305},
+    {42926, 42926, -42308},
+    {42928, 42928, -42258},
+    {42929, 42929, -42282},
+    {42930, 42930, -42261},
+    {42931, 42931, 928},
+    {42932, 42936, EvenOddSkip},
+    {43888, 43967, -38864},
+    {65313, 65338, 32},
+    {66560, 66599, 40},
+    {66736, 66771, 40},
+    {68736, 68786, 64},
+    {71840, 71871, 32},
+    {93760, 93791, 32},
+    {125184, 125217, 34},
+};
+const int num_unicode_tolower = 194;
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/unicode_groups.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/unicode_groups.cpp
new file mode 100644
index 0000000000..7bbd54278c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/re2/unicode_groups.cpp
@@ -0,0 +1,6057 @@
+
+// GENERATED BY make_unicode_groups.py; DO NOT EDIT.
+// make_unicode_groups.py >unicode_groups.cc
+
+#include "unicode_groups.h"
+
+namespace lbug {
+namespace regex {
+
+static const URange16 Ps_range16[] = {
+    {40, 40},
+    {91, 91},
+    {123, 123},
+    {3898, 3898},
+    {3900, 3900},
+    {5787, 5787},
+    {8218, 8218},
+    {8222, 8222},
+    {8261, 8261},
+    {8317, 8317},
+    {8333, 8333},
+    {8968, 8968},
+    {8970, 8970},
+    {9001, 9001},
+    {10088, 10088},
+    {10090, 10090},
+    {10092, 10092},
+    {10094, 10094},
+    {10096, 10096},
+    {10098, 10098},
+    {10100, 10100},
+    {10181, 10181},
+    {10214, 10214},
+    {10216, 10216},
+    {10218, 10218},
+    {10220, 10220},
+    {10222, 10222},
+    {10627, 10627},
+    {10629, 10629},
+    {10631, 10631},
+    {10633, 10633},
+    {10635, 10635},
+    {10637, 10637},
+    {10639, 10639},
+    {10641, 10641},
+    {10643, 10643},
+    {10645, 10645},
+    {10647, 10647},
+    {10712, 10712},
+    {10714, 10714},
+    {10748, 10748},
+    {11810, 11810},
+    {11812, 11812},
+    {11814, 11814},
+    {11816, 11816},
+    {11842, 11842},
+    {12296, 12296},
+    {12298, 12298},
+    {12300, 12300},
+    {12302, 12302},
+    {12304, 12304},
+    {12308, 12308},
+    {12310, 12310},
+    {12312, 12312},
+    {12314, 12314},
+    {12317, 12317},
+    {64831, 64831},
+    {65047, 65047},
+    {65077, 65077},
+    {65079, 65079},
+    {65081, 65081},
+    {65083, 65083},
+    {65085, 65085},
+    {65087, 65087},
+    {65089, 65089},
+    {65091, 65091},
+    {65095, 65095},
+    {65113, 65113},
+    {65115, 65115},
+    {65117, 65117},
+    {65288, 65288},
+    {65339, 65339},
+    {65371, 65371},
+    {65375, 65375},
+    {65378, 65378},
+};
+static const URange16 Nl_range16[] = {
+    {5870, 5872},
+    {8544, 8578},
+    {8581, 8584},
+    {12295, 12295},
+    {12321, 12329},
+    {12344, 12346},
+    {42726, 42735},
+};
+static const URange32 Nl_range32[] = {
+    {65856, 65908},
+    {66369, 66369},
+    {66378, 66378},
+    {66513, 66517},
+    {74752, 74862},
+};
+static const URange16 No_range16[] = {
+    {178, 179},
+    {185, 185},
+    {188, 190},
+    {2548, 2553},
+    {2930, 2935},
+    {3056, 3058},
+    {3192, 3198},
+    {3416, 3422},
+    {3440, 3448},
+    {3882, 3891},
+    {4969, 4988},
+    {6128, 6137},
+    {6618, 6618},
+    {8304, 8304},
+    {8308, 8313},
+    {8320, 8329},
+    {8528, 8543},
+    {8585, 8585},
+    {9312, 9371},
+    {9450, 9471},
+    {10102, 10131},
+    {11517, 11517},
+    {12690, 12693},
+    {12832, 12841},
+    {12872, 12879},
+    {12881, 12895},
+    {12928, 12937},
+    {12977, 12991},
+    {43056, 43061},
+};
+static const URange32 No_range32[] = {
+    {65799, 65843},
+    {65909, 65912},
+    {65930, 65931},
+    {66273, 66299},
+    {66336, 66339},
+    {67672, 67679},
+    {67705, 67711},
+    {67751, 67759},
+    {67835, 67839},
+    {67862, 67867},
+    {68028, 68029},
+    {68032, 68047},
+    {68050, 68095},
+    {68160, 68168},
+    {68221, 68222},
+    {68253, 68255},
+    {68331, 68335},
+    {68440, 68447},
+    {68472, 68479},
+    {68521, 68527},
+    {68858, 68863},
+    {69216, 69246},
+    {69405, 69414},
+    {69457, 69460},
+    {69714, 69733},
+    {70113, 70132},
+    {71482, 71483},
+    {71914, 71922},
+    {72794, 72812},
+    {93019, 93025},
+    {93824, 93846},
+    {119520, 119539},
+    {119648, 119672},
+    {125127, 125135},
+    {126065, 126123},
+    {126125, 126127},
+    {126129, 126132},
+    {127232, 127244},
+};
+static const URange16 Lo_range16[] = {
+    {170, 170},
+    {186, 186},
+    {443, 443},
+    {448, 451},
+    {660, 660},
+    {1488, 1514},
+    {1519, 1522},
+    {1568, 1599},
+    {1601, 1610},
+    {1646, 1647},
+    {1649, 1747},
+    {1749, 1749},
+    {1774, 1775},
+    {1786, 1788},
+    {1791, 1791},
+    {1808, 1808},
+    {1810, 1839},
+    {1869, 1957},
+    {1969, 1969},
+    {1994, 2026},
+    {2048, 2069},
+    {2112, 2136},
+    {2144, 2154},
+    {2208, 2228},
+    {2230, 2237},
+    {2308, 2361},
+    {2365, 2365},
+    {2384, 2384},
+    {2392, 2401},
+    {2418, 2432},
+    {2437, 2444},
+    {2447, 2448},
+    {2451, 2472},
+    {2474, 2480},
+    {2482, 2482},
+    {2486, 2489},
+    {2493, 2493},
+    {2510, 2510},
+    {2524, 2525},
+    {2527, 2529},
+    {2544, 2545},
+    {2556, 2556},
+    {2565, 2570},
+    {2575, 2576},
+    {2579, 2600},
+    {2602, 2608},
+    {2610, 2611},
+    {2613, 2614},
+    {2616, 2617},
+    {2649, 2652},
+    {2654, 2654},
+    {2674, 2676},
+    {2693, 2701},
+    {2703, 2705},
+    {2707, 2728},
+    {2730, 2736},
+    {2738, 2739},
+    {2741, 2745},
+    {2749, 2749},
+    {2768, 2768},
+    {2784, 2785},
+    {2809, 2809},
+    {2821, 2828},
+    {2831, 2832},
+    {2835, 2856},
+    {2858, 2864},
+    {2866, 2867},
+    {2869, 2873},
+    {2877, 2877},
+    {2908, 2909},
+    {2911, 2913},
+    {2929, 2929},
+    {2947, 2947},
+    {2949, 2954},
+    {2958, 2960},
+    {2962, 2965},
+    {2969, 2970},
+    {2972, 2972},
+    {2974, 2975},
+    {2979, 2980},
+    {2984, 2986},
+    {2990, 3001},
+    {3024, 3024},
+    {3077, 3084},
+    {3086, 3088},
+    {3090, 3112},
+    {3114, 3129},
+    {3133, 3133},
+    {3160, 3162},
+    {3168, 3169},
+    {3200, 3200},
+    {3205, 3212},
+    {3214, 3216},
+    {3218, 3240},
+    {3242, 3251},
+    {3253, 3257},
+    {3261, 3261},
+    {3294, 3294},
+    {3296, 3297},
+    {3313, 3314},
+    {3333, 3340},
+    {3342, 3344},
+    {3346, 3386},
+    {3389, 3389},
+    {3406, 3406},
+    {3412, 3414},
+    {3423, 3425},
+    {3450, 3455},
+    {3461, 3478},
+    {3482, 3505},
+    {3507, 3515},
+    {3517, 3517},
+    {3520, 3526},
+    {3585, 3632},
+    {3634, 3635},
+    {3648, 3653},
+    {3713, 3714},
+    {3716, 3716},
+    {3719, 3720},
+    {3722, 3722},
+    {3725, 3725},
+    {3732, 3735},
+    {3737, 3743},
+    {3745, 3747},
+    {3749, 3749},
+    {3751, 3751},
+    {3754, 3755},
+    {3757, 3760},
+    {3762, 3763},
+    {3773, 3773},
+    {3776, 3780},
+    {3804, 3807},
+    {3840, 3840},
+    {3904, 3911},
+    {3913, 3948},
+    {3976, 3980},
+    {4096, 4138},
+    {4159, 4159},
+    {4176, 4181},
+    {4186, 4189},
+    {4193, 4193},
+    {4197, 4198},
+    {4206, 4208},
+    {4213, 4225},
+    {4238, 4238},
+    {4352, 4680},
+    {4682, 4685},
+    {4688, 4694},
+    {4696, 4696},
+    {4698, 4701},
+    {4704, 4744},
+    {4746, 4749},
+    {4752, 4784},
+    {4786, 4789},
+    {4792, 4798},
+    {4800, 4800},
+    {4802, 4805},
+    {4808, 4822},
+    {4824, 4880},
+    {4882, 4885},
+    {4888, 4954},
+    {4992, 5007},
+    {5121, 5740},
+    {5743, 5759},
+    {5761, 5786},
+    {5792, 5866},
+    {5873, 5880},
+    {5888, 5900},
+    {5902, 5905},
+    {5920, 5937},
+    {5952, 5969},
+    {5984, 5996},
+    {5998, 6000},
+    {6016, 6067},
+    {6108, 6108},
+    {6176, 6210},
+    {6212, 6264},
+    {6272, 6276},
+    {6279, 6312},
+    {6314, 6314},
+    {6320, 6389},
+    {6400, 6430},
+    {6480, 6509},
+    {6512, 6516},
+    {6528, 6571},
+    {6576, 6601},
+    {6656, 6678},
+    {6688, 6740},
+    {6917, 6963},
+    {6981, 6987},
+    {7043, 7072},
+    {7086, 7087},
+    {7098, 7141},
+    {7168, 7203},
+    {7245, 7247},
+    {7258, 7287},
+    {7401, 7404},
+    {7406, 7409},
+    {7413, 7414},
+    {8501, 8504},
+    {11568, 11623},
+    {11648, 11670},
+    {11680, 11686},
+    {11688, 11694},
+    {11696, 11702},
+    {11704, 11710},
+    {11712, 11718},
+    {11720, 11726},
+    {11728, 11734},
+    {11736, 11742},
+    {12294, 12294},
+    {12348, 12348},
+    {12353, 12438},
+    {12447, 12447},
+    {12449, 12538},
+    {12543, 12543},
+    {12549, 12591},
+    {12593, 12686},
+    {12704, 12730},
+    {12784, 12799},
+    {13312, 19893},
+    {19968, 40943},
+    {40960, 40980},
+    {40982, 42124},
+    {42192, 42231},
+    {42240, 42507},
+    {42512, 42527},
+    {42538, 42539},
+    {42606, 42606},
+    {42656, 42725},
+    {42895, 42895},
+    {42999, 42999},
+    {43003, 43009},
+    {43011, 43013},
+    {43015, 43018},
+    {43020, 43042},
+    {43072, 43123},
+    {43138, 43187},
+    {43250, 43255},
+    {43259, 43259},
+    {43261, 43262},
+    {43274, 43301},
+    {43312, 43334},
+    {43360, 43388},
+    {43396, 43442},
+    {43488, 43492},
+    {43495, 43503},
+    {43514, 43518},
+    {43520, 43560},
+    {43584, 43586},
+    {43588, 43595},
+    {43616, 43631},
+    {43633, 43638},
+    {43642, 43642},
+    {43646, 43695},
+    {43697, 43697},
+    {43701, 43702},
+    {43705, 43709},
+    {43712, 43712},
+    {43714, 43714},
+    {43739, 43740},
+    {43744, 43754},
+    {43762, 43762},
+    {43777, 43782},
+    {43785, 43790},
+    {43793, 43798},
+    {43808, 43814},
+    {43816, 43822},
+    {43968, 44002},
+    {44032, 55203},
+    {55216, 55238},
+    {55243, 55291},
+    {63744, 64109},
+    {64112, 64217},
+    {64285, 64285},
+    {64287, 64296},
+    {64298, 64310},
+    {64312, 64316},
+    {64318, 64318},
+    {64320, 64321},
+    {64323, 64324},
+    {64326, 64433},
+    {64467, 64829},
+    {64848, 64911},
+    {64914, 64967},
+    {65008, 65019},
+    {65136, 65140},
+    {65142, 65276},
+    {65382, 65391},
+    {65393, 65437},
+    {65440, 65470},
+    {65474, 65479},
+    {65482, 65487},
+    {65490, 65495},
+    {65498, 65500},
+};
+static const URange32 Lo_range32[] = {
+    {65536, 65547},
+    {65549, 65574},
+    {65576, 65594},
+    {65596, 65597},
+    {65599, 65613},
+    {65616, 65629},
+    {65664, 65786},
+    {66176, 66204},
+    {66208, 66256},
+    {66304, 66335},
+    {66349, 66368},
+    {66370, 66377},
+    {66384, 66421},
+    {66432, 66461},
+    {66464, 66499},
+    {66504, 66511},
+    {66640, 66717},
+    {66816, 66855},
+    {66864, 66915},
+    {67072, 67382},
+    {67392, 67413},
+    {67424, 67431},
+    {67584, 67589},
+    {67592, 67592},
+    {67594, 67637},
+    {67639, 67640},
+    {67644, 67644},
+    {67647, 67669},
+    {67680, 67702},
+    {67712, 67742},
+    {67808, 67826},
+    {67828, 67829},
+    {67840, 67861},
+    {67872, 67897},
+    {67968, 68023},
+    {68030, 68031},
+    {68096, 68096},
+    {68112, 68115},
+    {68117, 68119},
+    {68121, 68149},
+    {68192, 68220},
+    {68224, 68252},
+    {68288, 68295},
+    {68297, 68324},
+    {68352, 68405},
+    {68416, 68437},
+    {68448, 68466},
+    {68480, 68497},
+    {68608, 68680},
+    {68864, 68899},
+    {69376, 69404},
+    {69415, 69415},
+    {69424, 69445},
+    {69635, 69687},
+    {69763, 69807},
+    {69840, 69864},
+    {69891, 69926},
+    {69956, 69956},
+    {69968, 70002},
+    {70006, 70006},
+    {70019, 70066},
+    {70081, 70084},
+    {70106, 70106},
+    {70108, 70108},
+    {70144, 70161},
+    {70163, 70187},
+    {70272, 70278},
+    {70280, 70280},
+    {70282, 70285},
+    {70287, 70301},
+    {70303, 70312},
+    {70320, 70366},
+    {70405, 70412},
+    {70415, 70416},
+    {70419, 70440},
+    {70442, 70448},
+    {70450, 70451},
+    {70453, 70457},
+    {70461, 70461},
+    {70480, 70480},
+    {70493, 70497},
+    {70656, 70708},
+    {70727, 70730},
+    {70784, 70831},
+    {70852, 70853},
+    {70855, 70855},
+    {71040, 71086},
+    {71128, 71131},
+    {71168, 71215},
+    {71236, 71236},
+    {71296, 71338},
+    {71424, 71450},
+    {71680, 71723},
+    {71935, 71935},
+    {72192, 72192},
+    {72203, 72242},
+    {72250, 72250},
+    {72272, 72272},
+    {72284, 72323},
+    {72326, 72329},
+    {72349, 72349},
+    {72384, 72440},
+    {72704, 72712},
+    {72714, 72750},
+    {72768, 72768},
+    {72818, 72847},
+    {72960, 72966},
+    {72968, 72969},
+    {72971, 73008},
+    {73030, 73030},
+    {73056, 73061},
+    {73063, 73064},
+    {73066, 73097},
+    {73112, 73112},
+    {73440, 73458},
+    {73728, 74649},
+    {74880, 75075},
+    {77824, 78894},
+    {82944, 83526},
+    {92160, 92728},
+    {92736, 92766},
+    {92880, 92909},
+    {92928, 92975},
+    {93027, 93047},
+    {93053, 93071},
+    {93952, 94020},
+    {94032, 94032},
+    {94208, 100337},
+    {100352, 101106},
+    {110592, 110878},
+    {110960, 111355},
+    {113664, 113770},
+    {113776, 113788},
+    {113792, 113800},
+    {113808, 113817},
+    {124928, 125124},
+    {126464, 126467},
+    {126469, 126495},
+    {126497, 126498},
+    {126500, 126500},
+    {126503, 126503},
+    {126505, 126514},
+    {126516, 126519},
+    {126521, 126521},
+    {126523, 126523},
+    {126530, 126530},
+    {126535, 126535},
+    {126537, 126537},
+    {126539, 126539},
+    {126541, 126543},
+    {126545, 126546},
+    {126548, 126548},
+    {126551, 126551},
+    {126553, 126553},
+    {126555, 126555},
+    {126557, 126557},
+    {126559, 126559},
+    {126561, 126562},
+    {126564, 126564},
+    {126567, 126570},
+    {126572, 126578},
+    {126580, 126583},
+    {126585, 126588},
+    {126590, 126590},
+    {126592, 126601},
+    {126603, 126619},
+    {126625, 126627},
+    {126629, 126633},
+    {126635, 126651},
+    {131072, 173782},
+    {173824, 177972},
+    {177984, 178205},
+    {178208, 183969},
+    {183984, 191456},
+    {194560, 195101},
+};
+static const URange16 Ll_range16[] = {
+    {97, 122},
+    {181, 181},
+    {223, 246},
+    {248, 255},
+    {257, 257},
+    {259, 259},
+    {261, 261},
+    {263, 263},
+    {265, 265},
+    {267, 267},
+    {269, 269},
+    {271, 271},
+    {273, 273},
+    {275, 275},
+    {277, 277},
+    {279, 279},
+    {281, 281},
+    {283, 283},
+    {285, 285},
+    {287, 287},
+    {289, 289},
+    {291, 291},
+    {293, 293},
+    {295, 295},
+    {297, 297},
+    {299, 299},
+    {301, 301},
+    {303, 303},
+    {305, 305},
+    {307, 307},
+    {309, 309},
+    {311, 312},
+    {314, 314},
+    {316, 316},
+    {318, 318},
+    {320, 320},
+    {322, 322},
+    {324, 324},
+    {326, 326},
+    {328, 329},
+    {331, 331},
+    {333, 333},
+    {335, 335},
+    {337, 337},
+    {339, 339},
+    {341, 341},
+    {343, 343},
+    {345, 345},
+    {347, 347},
+    {349, 349},
+    {351, 351},
+    {353, 353},
+    {355, 355},
+    {357, 357},
+    {359, 359},
+    {361, 361},
+    {363, 363},
+    {365, 365},
+    {367, 367},
+    {369, 369},
+    {371, 371},
+    {373, 373},
+    {375, 375},
+    {378, 378},
+    {380, 380},
+    {382, 384},
+    {387, 387},
+    {389, 389},
+    {392, 392},
+    {396, 397},
+    {402, 402},
+    {405, 405},
+    {409, 411},
+    {414, 414},
+    {417, 417},
+    {419, 419},
+    {421, 421},
+    {424, 424},
+    {426, 427},
+    {429, 429},
+    {432, 432},
+    {436, 436},
+    {438, 438},
+    {441, 442},
+    {445, 447},
+    {454, 454},
+    {457, 457},
+    {460, 460},
+    {462, 462},
+    {464, 464},
+    {466, 466},
+    {468, 468},
+    {470, 470},
+    {472, 472},
+    {474, 474},
+    {476, 477},
+    {479, 479},
+    {481, 481},
+    {483, 483},
+    {485, 485},
+    {487, 487},
+    {489, 489},
+    {491, 491},
+    {493, 493},
+    {495, 496},
+    {499, 499},
+    {501, 501},
+    {505, 505},
+    {507, 507},
+    {509, 509},
+    {511, 511},
+    {513, 513},
+    {515, 515},
+    {517, 517},
+    {519, 519},
+    {521, 521},
+    {523, 523},
+    {525, 525},
+    {527, 527},
+    {529, 529},
+    {531, 531},
+    {533, 533},
+    {535, 535},
+    {537, 537},
+    {539, 539},
+    {541, 541},
+    {543, 543},
+    {545, 545},
+    {547, 547},
+    {549, 549},
+    {551, 551},
+    {553, 553},
+    {555, 555},
+    {557, 557},
+    {559, 559},
+    {561, 561},
+    {563, 569},
+    {572, 572},
+    {575, 576},
+    {578, 578},
+    {583, 583},
+    {585, 585},
+    {587, 587},
+    {589, 589},
+    {591, 659},
+    {661, 687},
+    {881, 881},
+    {883, 883},
+    {887, 887},
+    {891, 893},
+    {912, 912},
+    {940, 974},
+    {976, 977},
+    {981, 983},
+    {985, 985},
+    {987, 987},
+    {989, 989},
+    {991, 991},
+    {993, 993},
+    {995, 995},
+    {997, 997},
+    {999, 999},
+    {1001, 1001},
+    {1003, 1003},
+    {1005, 1005},
+    {1007, 1011},
+    {1013, 1013},
+    {1016, 1016},
+    {1019, 1020},
+    {1072, 1119},
+    {1121, 1121},
+    {1123, 1123},
+    {1125, 1125},
+    {1127, 1127},
+    {1129, 1129},
+    {1131, 1131},
+    {1133, 1133},
+    {1135, 1135},
+    {1137, 1137},
+    {1139, 1139},
+    {1141, 1141},
+    {1143, 1143},
+    {1145, 1145},
+    {1147, 1147},
+    {1149, 1149},
+    {1151, 1151},
+    {1153, 1153},
+    {1163, 1163},
+    {1165, 1165},
+    {1167, 1167},
+    {1169, 1169},
+    {1171, 1171},
+    {1173, 1173},
+    {1175, 1175},
+    {1177, 1177},
+    {1179, 1179},
+    {1181, 1181},
+    {1183, 1183},
+    {1185, 1185},
+    {1187, 1187},
+    {1189, 1189},
+    {1191, 1191},
+    {1193, 1193},
+    {1195, 1195},
+    {1197, 1197},
+    {1199, 1199},
+    {1201, 1201},
+    {1203, 1203},
+    {1205, 1205},
+    {1207, 1207},
+    {1209, 1209},
+    {1211, 1211},
+    {1213, 1213},
+    {1215, 1215},
+    {1218, 1218},
+    {1220, 1220},
+    {1222, 1222},
+    {1224, 1224},
+    {1226, 1226},
+    {1228, 1228},
+    {1230, 1231},
+    {1233, 1233},
+    {1235, 1235},
+    {1237, 1237},
+    {1239, 1239},
+    {1241, 1241},
+    {1243, 1243},
+    {1245, 1245},
+    {1247, 1247},
+    {1249, 1249},
+    {1251, 1251},
+    {1253, 1253},
+    {1255, 1255},
+    {1257, 1257},
+    {1259, 1259},
+    {1261, 1261},
+    {1263, 1263},
+    {1265, 1265},
+    {1267, 1267},
+    {1269, 1269},
+    {1271, 1271},
+    {1273, 1273},
+    {1275, 1275},
+    {1277, 1277},
+    {1279, 1279},
+    {1281, 1281},
+    {1283, 1283},
+    {1285, 1285},
+    {1287, 1287},
+    {1289, 1289},
+    {1291, 1291},
+    {1293, 1293},
+    {1295, 1295},
+    {1297, 1297},
+    {1299, 1299},
+    {1301, 1301},
+    {1303, 1303},
+    {1305, 1305},
+    {1307, 1307},
+    {1309, 1309},
+    {1311, 1311},
+    {1313, 1313},
+    {1315, 1315},
+    {1317, 1317},
+    {1319, 1319},
+    {1321, 1321},
+    {1323, 1323},
+    {1325, 1325},
+    {1327, 1327},
+    {1376, 1416},
+    {4304, 4346},
+    {4349, 4351},
+    {5112, 5117},
+    {7296, 7304},
+    {7424, 7467},
+    {7531, 7543},
+    {7545, 7578},
+    {7681, 7681},
+    {7683, 7683},
+    {7685, 7685},
+    {7687, 7687},
+    {7689, 7689},
+    {7691, 7691},
+    {7693, 7693},
+    {7695, 7695},
+    {7697, 7697},
+    {7699, 7699},
+    {7701, 7701},
+    {7703, 7703},
+    {7705, 7705},
+    {7707, 7707},
+    {7709, 7709},
+    {7711, 7711},
+    {7713, 7713},
+    {7715, 7715},
+    {7717, 7717},
+    {7719, 7719},
+    {7721, 7721},
+    {7723, 7723},
+    {7725, 7725},
+    {7727, 7727},
+    {7729, 7729},
+    {7731, 7731},
+    {7733, 7733},
+    {7735, 7735},
+    {7737, 7737},
+    {7739, 7739},
+    {7741, 7741},
+    {7743, 7743},
+    {7745, 7745},
+    {7747, 7747},
+    {7749, 7749},
+    {7751, 7751},
+    {7753, 7753},
+    {7755, 7755},
+    {7757, 7757},
+    {7759, 7759},
+    {7761, 7761},
+    {7763, 7763},
+    {7765, 7765},
+    {7767, 7767},
+    {7769, 7769},
+    {7771, 7771},
+    {7773, 7773},
+    {7775, 7775},
+    {7777, 7777},
+    {7779, 7779},
+    {7781, 7781},
+    {7783, 7783},
+    {7785, 7785},
+    {7787, 7787},
+    {7789, 7789},
+    {7791, 7791},
+    {7793, 7793},
+    {7795, 7795},
+    {7797, 7797},
+    {7799, 7799},
+    {7801, 7801},
+    {7803, 7803},
+    {7805, 7805},
+    {7807, 7807},
+    {7809, 7809},
+    {7811, 7811},
+    {7813, 7813},
+    {7815, 7815},
+    {7817, 7817},
+    {7819, 7819},
+    {7821, 7821},
+    {7823, 7823},
+    {7825, 7825},
+    {7827, 7827},
+    {7829, 7837},
+    {7839, 7839},
+    {7841, 7841},
+    {7843, 7843},
+    {7845, 7845},
+    {7847, 7847},
+    {7849, 7849},
+    {7851, 7851},
+    {7853, 7853},
+    {7855, 7855},
+    {7857, 7857},
+    {7859, 7859},
+    {7861, 7861},
+    {7863, 7863},
+    {7865, 7865},
+    {7867, 7867},
+    {7869, 7869},
+    {7871, 7871},
+    {7873, 7873},
+    {7875, 7875},
+    {7877, 7877},
+    {7879, 7879},
+    {7881, 7881},
+    {7883, 7883},
+    {7885, 7885},
+    {7887, 7887},
+    {7889, 7889},
+    {7891, 7891},
+    {7893, 7893},
+    {7895, 7895},
+    {7897, 7897},
+    {7899, 7899},
+    {7901, 7901},
+    {7903, 7903},
+    {7905, 7905},
+    {7907, 7907},
+    {7909, 7909},
+    {7911, 7911},
+    {7913, 7913},
+    {7915, 7915},
+    {7917, 7917},
+    {7919, 7919},
+    {7921, 7921},
+    {7923, 7923},
+    {7925, 7925},
+    {7927, 7927},
+    {7929, 7929},
+    {7931, 7931},
+    {7933, 7933},
+    {7935, 7943},
+    {7952, 7957},
+    {7968, 7975},
+    {7984, 7991},
+    {8000, 8005},
+    {8016, 8023},
+    {8032, 8039},
+    {8048, 8061},
+    {8064, 8071},
+    {8080, 8087},
+    {8096, 8103},
+    {8112, 8116},
+    {8118, 8119},
+    {8126, 8126},
+    {8130, 8132},
+    {8134, 8135},
+    {8144, 8147},
+    {8150, 8151},
+    {8160, 8167},
+    {8178, 8180},
+    {8182, 8183},
+    {8458, 8458},
+    {8462, 8463},
+    {8467, 8467},
+    {8495, 8495},
+    {8500, 8500},
+    {8505, 8505},
+    {8508, 8509},
+    {8518, 8521},
+    {8526, 8526},
+    {8580, 8580},
+    {11312, 11358},
+    {11361, 11361},
+    {11365, 11366},
+    {11368, 11368},
+    {11370, 11370},
+    {11372, 11372},
+    {11377, 11377},
+    {11379, 11380},
+    {11382, 11387},
+    {11393, 11393},
+    {11395, 11395},
+    {11397, 11397},
+    {11399, 11399},
+    {11401, 11401},
+    {11403, 11403},
+    {11405, 11405},
+    {11407, 11407},
+    {11409, 11409},
+    {11411, 11411},
+    {11413, 11413},
+    {11415, 11415},
+    {11417, 11417},
+    {11419, 11419},
+    {11421, 11421},
+    {11423, 11423},
+    {11425, 11425},
+    {11427, 11427},
+    {11429, 11429},
+    {11431, 11431},
+    {11433, 11433},
+    {11435, 11435},
+    {11437, 11437},
+    {11439, 11439},
+    {11441, 11441},
+    {11443, 11443},
+    {11445, 11445},
+    {11447, 11447},
+    {11449, 11449},
+    {11451, 11451},
+    {11453, 11453},
+    {11455, 11455},
+    {11457, 11457},
+    {11459, 11459},
+    {11461, 11461},
+    {11463, 11463},
+    {11465, 11465},
+    {11467, 11467},
+    {11469, 11469},
+    {11471, 11471},
+    {11473, 11473},
+    {11475, 11475},
+    {11477, 11477},
+    {11479, 11479},
+    {11481, 11481},
+    {11483, 11483},
+    {11485, 11485},
+    {11487, 11487},
+    {11489, 11489},
+    {11491, 11492},
+    {11500, 11500},
+    {11502, 11502},
+    {11507, 11507},
+    {11520, 11557},
+    {11559, 11559},
+    {11565, 11565},
+    {42561, 42561},
+    {42563, 42563},
+    {42565, 42565},
+    {42567, 42567},
+    {42569, 42569},
+    {42571, 42571},
+    {42573, 42573},
+    {42575, 42575},
+    {42577, 42577},
+    {42579, 42579},
+    {42581, 42581},
+    {42583, 42583},
+    {42585, 42585},
+    {42587, 42587},
+    {42589, 42589},
+    {42591, 42591},
+    {42593, 42593},
+    {42595, 42595},
+    {42597, 42597},
+    {42599, 42599},
+    {42601, 42601},
+    {42603, 42603},
+    {42605, 42605},
+    {42625, 42625},
+    {42627, 42627},
+    {42629, 42629},
+    {42631, 42631},
+    {42633, 42633},
+    {42635, 42635},
+    {42637, 42637},
+    {42639, 42639},
+    {42641, 42641},
+    {42643, 42643},
+    {42645, 42645},
+    {42647, 42647},
+    {42649, 42649},
+    {42651, 42651},
+    {42787, 42787},
+    {42789, 42789},
+    {42791, 42791},
+    {42793, 42793},
+    {42795, 42795},
+    {42797, 42797},
+    {42799, 42801},
+    {42803, 42803},
+    {42805, 42805},
+    {42807, 42807},
+    {42809, 42809},
+    {42811, 42811},
+    {42813, 42813},
+    {42815, 42815},
+    {42817, 42817},
+    {42819, 42819},
+    {42821, 42821},
+    {42823, 42823},
+    {42825, 42825},
+    {42827, 42827},
+    {42829, 42829},
+    {42831, 42831},
+    {42833, 42833},
+    {42835, 42835},
+    {42837, 42837},
+    {42839, 42839},
+    {42841, 42841},
+    {42843, 42843},
+    {42845, 42845},
+    {42847, 42847},
+    {42849, 42849},
+    {42851, 42851},
+    {42853, 42853},
+    {42855, 42855},
+    {42857, 42857},
+    {42859, 42859},
+    {42861, 42861},
+    {42863, 42863},
+    {42865, 42872},
+    {42874, 42874},
+    {42876, 42876},
+    {42879, 42879},
+    {42881, 42881},
+    {42883, 42883},
+    {42885, 42885},
+    {42887, 42887},
+    {42892, 42892},
+    {42894, 42894},
+    {42897, 42897},
+    {42899, 42901},
+    {42903, 42903},
+    {42905, 42905},
+    {42907, 42907},
+    {42909, 42909},
+    {42911, 42911},
+    {42913, 42913},
+    {42915, 42915},
+    {42917, 42917},
+    {42919, 42919},
+    {42921, 42921},
+    {42927, 42927},
+    {42933, 42933},
+    {42935, 42935},
+    {42937, 42937},
+    {43002, 43002},
+    {43824, 43866},
+    {43872, 43877},
+    {43888, 43967},
+    {64256, 64262},
+    {64275, 64279},
+    {65345, 65370},
+};
+static const URange32 Ll_range32[] = {
+    {66600, 66639},
+    {66776, 66811},
+    {68800, 68850},
+    {71872, 71903},
+    {93792, 93823},
+    {119834, 119859},
+    {119886, 119892},
+    {119894, 119911},
+    {119938, 119963},
+    {119990, 119993},
+    {119995, 119995},
+    {119997, 120003},
+    {120005, 120015},
+    {120042, 120067},
+    {120094, 120119},
+    {120146, 120171},
+    {120198, 120223},
+    {120250, 120275},
+    {120302, 120327},
+    {120354, 120379},
+    {120406, 120431},
+    {120458, 120485},
+    {120514, 120538},
+    {120540, 120545},
+    {120572, 120596},
+    {120598, 120603},
+    {120630, 120654},
+    {120656, 120661},
+    {120688, 120712},
+    {120714, 120719},
+    {120746, 120770},
+    {120772, 120777},
+    {120779, 120779},
+    {125218, 125251},
+};
+static const URange16 Lm_range16[] = {
+    {688, 705},
+    {710, 721},
+    {736, 740},
+    {748, 748},
+    {750, 750},
+    {884, 884},
+    {890, 890},
+    {1369, 1369},
+    {1600, 1600},
+    {1765, 1766},
+    {2036, 2037},
+    {2042, 2042},
+    {2074, 2074},
+    {2084, 2084},
+    {2088, 2088},
+    {2417, 2417},
+    {3654, 3654},
+    {3782, 3782},
+    {4348, 4348},
+    {6103, 6103},
+    {6211, 6211},
+    {6823, 6823},
+    {7288, 7293},
+    {7468, 7530},
+    {7544, 7544},
+    {7579, 7615},
+    {8305, 8305},
+    {8319, 8319},
+    {8336, 8348},
+    {11388, 11389},
+    {11631, 11631},
+    {11823, 11823},
+    {12293, 12293},
+    {12337, 12341},
+    {12347, 12347},
+    {12445, 12446},
+    {12540, 12542},
+    {40981, 40981},
+    {42232, 42237},
+    {42508, 42508},
+    {42623, 42623},
+    {42652, 42653},
+    {42775, 42783},
+    {42864, 42864},
+    {42888, 42888},
+    {43000, 43001},
+    {43471, 43471},
+    {43494, 43494},
+    {43632, 43632},
+    {43741, 43741},
+    {43763, 43764},
+    {43868, 43871},
+    {65392, 65392},
+    {65438, 65439},
+};
+static const URange32 Lm_range32[] = {
+    {92992, 92995},
+    {94099, 94111},
+    {94176, 94177},
+};
+static const URange16 Nd_range16[] = {
+    {48, 57},
+    {1632, 1641},
+    {1776, 1785},
+    {1984, 1993},
+    {2406, 2415},
+    {2534, 2543},
+    {2662, 2671},
+    {2790, 2799},
+    {2918, 2927},
+    {3046, 3055},
+    {3174, 3183},
+    {3302, 3311},
+    {3430, 3439},
+    {3558, 3567},
+    {3664, 3673},
+    {3792, 3801},
+    {3872, 3881},
+    {4160, 4169},
+    {4240, 4249},
+    {6112, 6121},
+    {6160, 6169},
+    {6470, 6479},
+    {6608, 6617},
+    {6784, 6793},
+    {6800, 6809},
+    {6992, 7001},
+    {7088, 7097},
+    {7232, 7241},
+    {7248, 7257},
+    {42528, 42537},
+    {43216, 43225},
+    {43264, 43273},
+    {43472, 43481},
+    {43504, 43513},
+    {43600, 43609},
+    {44016, 44025},
+    {65296, 65305},
+};
+static const URange32 Nd_range32[] = {
+    {66720, 66729},
+    {68912, 68921},
+    {69734, 69743},
+    {69872, 69881},
+    {69942, 69951},
+    {70096, 70105},
+    {70384, 70393},
+    {70736, 70745},
+    {70864, 70873},
+    {71248, 71257},
+    {71360, 71369},
+    {71472, 71481},
+    {71904, 71913},
+    {72784, 72793},
+    {73040, 73049},
+    {73120, 73129},
+    {92768, 92777},
+    {93008, 93017},
+    {120782, 120831},
+    {125264, 125273},
+};
+static const URange16 Pc_range16[] = {
+    {95, 95},
+    {8255, 8256},
+    {8276, 8276},
+    {65075, 65076},
+    {65101, 65103},
+    {65343, 65343},
+};
+static const URange16 Lt_range16[] = {
+    {453, 453},
+    {456, 456},
+    {459, 459},
+    {498, 498},
+    {8072, 8079},
+    {8088, 8095},
+    {8104, 8111},
+    {8124, 8124},
+    {8140, 8140},
+    {8188, 8188},
+};
+static const URange16 Lu_range16[] = {
+    {65, 90},
+    {192, 214},
+    {216, 222},
+    {256, 256},
+    {258, 258},
+    {260, 260},
+    {262, 262},
+    {264, 264},
+    {266, 266},
+    {268, 268},
+    {270, 270},
+    {272, 272},
+    {274, 274},
+    {276, 276},
+    {278, 278},
+    {280, 280},
+    {282, 282},
+    {284, 284},
+    {286, 286},
+    {288, 288},
+    {290, 290},
+    {292, 292},
+    {294, 294},
+    {296, 296},
+    {298, 298},
+    {300, 300},
+    {302, 302},
+    {304, 304},
+    {306, 306},
+    {308, 308},
+    {310, 310},
+    {313, 313},
+    {315, 315},
+    {317, 317},
+    {319, 319},
+    {321, 321},
+    {323, 323},
+    {325, 325},
+    {327, 327},
+    {330, 330},
+    {332, 332},
+    {334, 334},
+    {336, 336},
+    {338, 338},
+    {340, 340},
+    {342, 342},
+    {344, 344},
+    {346, 346},
+    {348, 348},
+    {350, 350},
+    {352, 352},
+    {354, 354},
+    {356, 356},
+    {358, 358},
+    {360, 360},
+    {362, 362},
+    {364, 364},
+    {366, 366},
+    {368, 368},
+    {370, 370},
+    {372, 372},
+    {374, 374},
+    {376, 377},
+    {379, 379},
+    {381, 381},
+    {385, 386},
+    {388, 388},
+    {390, 391},
+    {393, 395},
+    {398, 401},
+    {403, 404},
+    {406, 408},
+    {412, 413},
+    {415, 416},
+    {418, 418},
+    {420, 420},
+    {422, 423},
+    {425, 425},
+    {428, 428},
+    {430, 431},
+    {433, 435},
+    {437, 437},
+    {439, 440},
+    {444, 444},
+    {452, 452},
+    {455, 455},
+    {458, 458},
+    {461, 461},
+    {463, 463},
+    {465, 465},
+    {467, 467},
+    {469, 469},
+    {471, 471},
+    {473, 473},
+    {475, 475},
+    {478, 478},
+    {480, 480},
+    {482, 482},
+    {484, 484},
+    {486, 486},
+    {488, 488},
+    {490, 490},
+    {492, 492},
+    {494, 494},
+    {497, 497},
+    {500, 500},
+    {502, 504},
+    {506, 506},
+    {508, 508},
+    {510, 510},
+    {512, 512},
+    {514, 514},
+    {516, 516},
+    {518, 518},
+    {520, 520},
+    {522, 522},
+    {524, 524},
+    {526, 526},
+    {528, 528},
+    {530, 530},
+    {532, 532},
+    {534, 534},
+    {536, 536},
+    {538, 538},
+    {540, 540},
+    {542, 542},
+    {544, 544},
+    {546, 546},
+    {548, 548},
+    {550, 550},
+    {552, 552},
+    {554, 554},
+    {556, 556},
+    {558, 558},
+    {560, 560},
+    {562, 562},
+    {570, 571},
+    {573, 574},
+    {577, 577},
+    {579, 582},
+    {584, 584},
+    {586, 586},
+    {588, 588},
+    {590, 590},
+    {880, 880},
+    {882, 882},
+    {886, 886},
+    {895, 895},
+    {902, 902},
+    {904, 906},
+    {908, 908},
+    {910, 911},
+    {913, 929},
+    {931, 939},
+    {975, 975},
+    {978, 980},
+    {984, 984},
+    {986, 986},
+    {988, 988},
+    {990, 990},
+    {992, 992},
+    {994, 994},
+    {996, 996},
+    {998, 998},
+    {1000, 1000},
+    {1002, 1002},
+    {1004, 1004},
+    {1006, 1006},
+    {1012, 1012},
+    {1015, 1015},
+    {1017, 1018},
+    {1021, 1071},
+    {1120, 1120},
+    {1122, 1122},
+    {1124, 1124},
+    {1126, 1126},
+    {1128, 1128},
+    {1130, 1130},
+    {1132, 1132},
+    {1134, 1134},
+    {1136, 1136},
+    {1138, 1138},
+    {1140, 1140},
+    {1142, 1142},
+    {1144, 1144},
+    {1146, 1146},
+    {1148, 1148},
+    {1150, 1150},
+    {1152, 1152},
+    {1162, 1162},
+    {1164, 1164},
+    {1166, 1166},
+    {1168, 1168},
+    {1170, 1170},
+    {1172, 1172},
+    {1174, 1174},
+    {1176, 1176},
+    {1178, 1178},
+    {1180, 1180},
+    {1182, 1182},
+    {1184, 1184},
+    {1186, 1186},
+    {1188, 1188},
+    {1190, 1190},
+    {1192, 1192},
+    {1194, 1194},
+    {1196, 1196},
+    {1198, 1198},
+    {1200, 1200},
+    {1202, 1202},
+    {1204, 1204},
+    {1206, 1206},
+    {1208, 1208},
+    {1210, 1210},
+    {1212, 1212},
+    {1214, 1214},
+    {1216, 1217},
+    {1219, 1219},
+    {1221, 1221},
+    {1223, 1223},
+    {1225, 1225},
+    {1227, 1227},
+    {1229, 1229},
+    {1232, 1232},
+    {1234, 1234},
+    {1236, 1236},
+    {1238, 1238},
+    {1240, 1240},
+    {1242, 1242},
+    {1244, 1244},
+    {1246, 1246},
+    {1248, 1248},
+    {1250, 1250},
+    {1252, 1252},
+    {1254, 1254},
+    {1256, 1256},
+    {1258, 1258},
+    {1260, 1260},
+    {1262, 1262},
+    {1264, 1264},
+    {1266, 1266},
+    {1268, 1268},
+    {1270, 1270},
+    {1272, 1272},
+    {1274, 1274},
+    {1276, 1276},
+    {1278, 1278},
+    {1280, 1280},
+    {1282, 1282},
+    {1284, 1284},
+    {1286, 1286},
+    {1288, 1288},
+    {1290, 1290},
+    {1292, 1292},
+    {1294, 1294},
+    {1296, 1296},
+    {1298, 1298},
+    {1300, 1300},
+    {1302, 1302},
+    {1304, 1304},
+    {1306, 1306},
+    {1308, 1308},
+    {1310, 1310},
+    {1312, 1312},
+    {1314, 1314},
+    {1316, 1316},
+    {1318, 1318},
+    {1320, 1320},
+    {1322, 1322},
+    {1324, 1324},
+    {1326, 1326},
+    {1329, 1366},
+    {4256, 4293},
+    {4295, 4295},
+    {4301, 4301},
+    {5024, 5109},
+    {7312, 7354},
+    {7357, 7359},
+    {7680, 7680},
+    {7682, 7682},
+    {7684, 7684},
+    {7686, 7686},
+    {7688, 7688},
+    {7690, 7690},
+    {7692, 7692},
+    {7694, 7694},
+    {7696, 7696},
+    {7698, 7698},
+    {7700, 7700},
+    {7702, 7702},
+    {7704, 7704},
+    {7706, 7706},
+    {7708, 7708},
+    {7710, 7710},
+    {7712, 7712},
+    {7714, 7714},
+    {7716, 7716},
+    {7718, 7718},
+    {7720, 7720},
+    {7722, 7722},
+    {7724, 7724},
+    {7726, 7726},
+    {7728, 7728},
+    {7730, 7730},
+    {7732, 7732},
+    {7734, 7734},
+    {7736, 7736},
+    {7738, 7738},
+    {7740, 7740},
+    {7742, 7742},
+    {7744, 7744},
+    {7746, 7746},
+    {7748, 7748},
+    {7750, 7750},
+    {7752, 7752},
+    {7754, 7754},
+    {7756, 7756},
+    {7758, 7758},
+    {7760, 7760},
+    {7762, 7762},
+    {7764, 7764},
+    {7766, 7766},
+    {7768, 7768},
+    {7770, 7770},
+    {7772, 7772},
+    {7774, 7774},
+    {7776, 7776},
+    {7778, 7778},
+    {7780, 7780},
+    {7782, 7782},
+    {7784, 7784},
+    {7786, 7786},
+    {7788, 7788},
+    {7790, 7790},
+    {7792, 7792},
+    {7794, 7794},
+    {7796, 7796},
+    {7798, 7798},
+    {7800, 7800},
+    {7802, 7802},
+    {7804, 7804},
+    {7806, 7806},
+    {7808, 7808},
+    {7810, 7810},
+    {7812, 7812},
+    {7814, 7814},
+    {7816, 7816},
+    {7818, 7818},
+    {7820, 7820},
+    {7822, 7822},
+    {7824, 7824},
+    {7826, 7826},
+    {7828, 7828},
+    {7838, 7838},
+    {7840, 7840},
+    {7842, 7842},
+    {7844, 7844},
+    {7846, 7846},
+    {7848, 7848},
+    {7850, 7850},
+    {7852, 7852},
+    {7854, 7854},
+    {7856, 7856},
+    {7858, 7858},
+    {7860, 7860},
+    {7862, 7862},
+    {7864, 7864},
+    {7866, 7866},
+    {7868, 7868},
+    {7870, 7870},
+    {7872, 7872},
+    {7874, 7874},
+    {7876, 7876},
+    {7878, 7878},
+    {7880, 7880},
+    {7882, 7882},
+    {7884, 7884},
+    {7886, 7886},
+    {7888, 7888},
+    {7890, 7890},
+    {7892, 7892},
+    {7894, 7894},
+    {7896, 7896},
+    {7898, 7898},
+    {7900, 7900},
+    {7902, 7902},
+    {7904, 7904},
+    {7906, 7906},
+    {7908, 7908},
+    {7910, 7910},
+    {7912, 7912},
+    {7914, 7914},
+    {7916, 7916},
+    {7918, 7918},
+    {7920, 7920},
+    {7922, 7922},
+    {7924, 7924},
+    {7926, 7926},
+    {7928, 7928},
+    {7930, 7930},
+    {7932, 7932},
+    {7934, 7934},
+    {7944, 7951},
+    {7960, 7965},
+    {7976, 7983},
+    {7992, 7999},
+    {8008, 8013},
+    {8025, 8025},
+    {8027, 8027},
+    {8029, 8029},
+    {8031, 8031},
+    {8040, 8047},
+    {8120, 8123},
+    {8136, 8139},
+    {8152, 8155},
+    {8168, 8172},
+    {8184, 8187},
+    {8450, 8450},
+    {8455, 8455},
+    {8459, 8461},
+    {8464, 8466},
+    {8469, 8469},
+    {8473, 8477},
+    {8484, 8484},
+    {8486, 8486},
+    {8488, 8488},
+    {8490, 8493},
+    {8496, 8499},
+    {8510, 8511},
+    {8517, 8517},
+    {8579, 8579},
+    {11264, 11310},
+    {11360, 11360},
+    {11362, 11364},
+    {11367, 11367},
+    {11369, 11369},
+    {11371, 11371},
+    {11373, 11376},
+    {11378, 11378},
+    {11381, 11381},
+    {11390, 11392},
+    {11394, 11394},
+    {11396, 11396},
+    {11398, 11398},
+    {11400, 11400},
+    {11402, 11402},
+    {11404, 11404},
+    {11406, 11406},
+    {11408, 11408},
+    {11410, 11410},
+    {11412, 11412},
+    {11414, 11414},
+    {11416, 11416},
+    {11418, 11418},
+    {11420, 11420},
+    {11422, 11422},
+    {11424, 11424},
+    {11426, 11426},
+    {11428, 11428},
+    {11430, 11430},
+    {11432, 11432},
+    {11434, 11434},
+    {11436, 11436},
+    {11438, 11438},
+    {11440, 11440},
+    {11442, 11442},
+    {11444, 11444},
+    {11446, 11446},
+    {11448, 11448},
+    {11450, 11450},
+    {11452, 11452},
+    {11454, 11454},
+    {11456, 11456},
+    {11458, 11458},
+    {11460, 11460},
+    {11462, 11462},
+    {11464, 11464},
+    {11466, 11466},
+    {11468, 11468},
+    {11470, 11470},
+    {11472, 11472},
+    {11474, 11474},
+    {11476, 11476},
+    {11478, 11478},
+    {11480, 11480},
+    {11482, 11482},
+    {11484, 11484},
+    {11486, 11486},
+    {11488, 11488},
+    {11490, 11490},
+    {11499, 11499},
+    {11501, 11501},
+    {11506, 11506},
+    {42560, 42560},
+    {42562, 42562},
+    {42564, 42564},
+    {42566, 42566},
+    {42568, 42568},
+    {42570, 42570},
+    {42572, 42572},
+    {42574, 42574},
+    {42576, 42576},
+    {42578, 42578},
+    {42580, 42580},
+    {42582, 42582},
+    {42584, 42584},
+    {42586, 42586},
+    {42588, 42588},
+    {42590, 42590},
+    {42592, 42592},
+    {42594, 42594},
+    {42596, 42596},
+    {42598, 42598},
+    {42600, 42600},
+    {42602, 42602},
+    {42604, 42604},
+    {42624, 42624},
+    {42626, 42626},
+    {42628, 42628},
+    {42630, 42630},
+    {42632, 42632},
+    {42634, 42634},
+    {42636, 42636},
+    {42638, 42638},
+    {42640, 42640},
+    {42642, 42642},
+    {42644, 42644},
+    {42646, 42646},
+    {42648, 42648},
+    {42650, 42650},
+    {42786, 42786},
+    {42788, 42788},
+    {42790, 42790},
+    {42792, 42792},
+    {42794, 42794},
+    {42796, 42796},
+    {42798, 42798},
+    {42802, 42802},
+    {42804, 42804},
+    {42806, 42806},
+    {42808, 42808},
+    {42810, 42810},
+    {42812, 42812},
+    {42814, 42814},
+    {42816, 42816},
+    {42818, 42818},
+    {42820, 42820},
+    {42822, 42822},
+    {42824, 42824},
+    {42826, 42826},
+    {42828, 42828},
+    {42830, 42830},
+    {42832, 42832},
+    {42834, 42834},
+    {42836, 42836},
+    {42838, 42838},
+    {42840, 42840},
+    {42842, 42842},
+    {42844, 42844},
+    {42846, 42846},
+    {42848, 42848},
+    {42850, 42850},
+    {42852, 42852},
+    {42854, 42854},
+    {42856, 42856},
+    {42858, 42858},
+    {42860, 42860},
+    {42862, 42862},
+    {42873, 42873},
+    {42875, 42875},
+    {42877, 42878},
+    {42880, 42880},
+    {42882, 42882},
+    {42884, 42884},
+    {42886, 42886},
+    {42891, 42891},
+    {42893, 42893},
+    {42896, 42896},
+    {42898, 42898},
+    {42902, 42902},
+    {42904, 42904},
+    {42906, 42906},
+    {42908, 42908},
+    {42910, 42910},
+    {42912, 42912},
+    {42914, 42914},
+    {42916, 42916},
+    {42918, 42918},
+    {42920, 42920},
+    {42922, 42926},
+    {42928, 42932},
+    {42934, 42934},
+    {42936, 42936},
+    {65313, 65338},
+};
+static const URange32 Lu_range32[] = {
+    {66560, 66599},
+    {66736, 66771},
+    {68736, 68786},
+    {71840, 71871},
+    {93760, 93791},
+    {119808, 119833},
+    {119860, 119885},
+    {119912, 119937},
+    {119964, 119964},
+    {119966, 119967},
+    {119970, 119970},
+    {119973, 119974},
+    {119977, 119980},
+    {119982, 119989},
+    {120016, 120041},
+    {120068, 120069},
+    {120071, 120074},
+    {120077, 120084},
+    {120086, 120092},
+    {120120, 120121},
+    {120123, 120126},
+    {120128, 120132},
+    {120134, 120134},
+    {120138, 120144},
+    {120172, 120197},
+    {120224, 120249},
+    {120276, 120301},
+    {120328, 120353},
+    {120380, 120405},
+    {120432, 120457},
+    {120488, 120512},
+    {120546, 120570},
+    {120604, 120628},
+    {120662, 120686},
+    {120720, 120744},
+    {120778, 120778},
+    {125184, 125217},
+};
+static const URange16 Pf_range16[] = {
+    {187, 187},
+    {8217, 8217},
+    {8221, 8221},
+    {8250, 8250},
+    {11779, 11779},
+    {11781, 11781},
+    {11786, 11786},
+    {11789, 11789},
+    {11805, 11805},
+    {11809, 11809},
+};
+static const URange16 Pd_range16[] = {
+    {45, 45},
+    {1418, 1418},
+    {1470, 1470},
+    {5120, 5120},
+    {6150, 6150},
+    {8208, 8213},
+    {11799, 11799},
+    {11802, 11802},
+    {11834, 11835},
+    {11840, 11840},
+    {12316, 12316},
+    {12336, 12336},
+    {12448, 12448},
+    {65073, 65074},
+    {65112, 65112},
+    {65123, 65123},
+    {65293, 65293},
+};
+static const URange16 Pe_range16[] = {
+    {41, 41},
+    {93, 93},
+    {125, 125},
+    {3899, 3899},
+    {3901, 3901},
+    {5788, 5788},
+    {8262, 8262},
+    {8318, 8318},
+    {8334, 8334},
+    {8969, 8969},
+    {8971, 8971},
+    {9002, 9002},
+    {10089, 10089},
+    {10091, 10091},
+    {10093, 10093},
+    {10095, 10095},
+    {10097, 10097},
+    {10099, 10099},
+    {10101, 10101},
+    {10182, 10182},
+    {10215, 10215},
+    {10217, 10217},
+    {10219, 10219},
+    {10221, 10221},
+    {10223, 10223},
+    {10628, 10628},
+    {10630, 10630},
+    {10632, 10632},
+    {10634, 10634},
+    {10636, 10636},
+    {10638, 10638},
+    {10640, 10640},
+    {10642, 10642},
+    {10644, 10644},
+    {10646, 10646},
+    {10648, 10648},
+    {10713, 10713},
+    {10715, 10715},
+    {10749, 10749},
+    {11811, 11811},
+    {11813, 11813},
+    {11815, 11815},
+    {11817, 11817},
+    {12297, 12297},
+    {12299, 12299},
+    {12301, 12301},
+    {12303, 12303},
+    {12305, 12305},
+    {12309, 12309},
+    {12311, 12311},
+    {12313, 12313},
+    {12315, 12315},
+    {12318, 12319},
+    {64830, 64830},
+    {65048, 65048},
+    {65078, 65078},
+    {65080, 65080},
+    {65082, 65082},
+    {65084, 65084},
+    {65086, 65086},
+    {65088, 65088},
+    {65090, 65090},
+    {65092, 65092},
+    {65096, 65096},
+    {65114, 65114},
+    {65116, 65116},
+    {65118, 65118},
+    {65289, 65289},
+    {65341, 65341},
+    {65373, 65373},
+    {65376, 65376},
+    {65379, 65379},
+};
+static const URange16 Pi_range16[] = {
+    {171, 171},
+    {8216, 8216},
+    {8219, 8220},
+    {8223, 8223},
+    {8249, 8249},
+    {11778, 11778},
+    {11780, 11780},
+    {11785, 11785},
+    {11788, 11788},
+    {11804, 11804},
+    {11808, 11808},
+};
+static const URange16 Po_range16[] = {
+    {33, 35},
+    {37, 39},
+    {42, 42},
+    {44, 44},
+    {46, 47},
+    {58, 59},
+    {63, 64},
+    {92, 92},
+    {161, 161},
+    {167, 167},
+    {182, 183},
+    {191, 191},
+    {894, 894},
+    {903, 903},
+    {1370, 1375},
+    {1417, 1417},
+    {1472, 1472},
+    {1475, 1475},
+    {1478, 1478},
+    {1523, 1524},
+    {1545, 1546},
+    {1548, 1549},
+    {1563, 1563},
+    {1566, 1567},
+    {1642, 1645},
+    {1748, 1748},
+    {1792, 1805},
+    {2039, 2041},
+    {2096, 2110},
+    {2142, 2142},
+    {2404, 2405},
+    {2416, 2416},
+    {2557, 2557},
+    {2678, 2678},
+    {2800, 2800},
+    {3204, 3204},
+    {3572, 3572},
+    {3663, 3663},
+    {3674, 3675},
+    {3844, 3858},
+    {3860, 3860},
+    {3973, 3973},
+    {4048, 4052},
+    {4057, 4058},
+    {4170, 4175},
+    {4347, 4347},
+    {4960, 4968},
+    {5741, 5742},
+    {5867, 5869},
+    {5941, 5942},
+    {6100, 6102},
+    {6104, 6106},
+    {6144, 6149},
+    {6151, 6154},
+    {6468, 6469},
+    {6686, 6687},
+    {6816, 6822},
+    {6824, 6829},
+    {7002, 7008},
+    {7164, 7167},
+    {7227, 7231},
+    {7294, 7295},
+    {7360, 7367},
+    {7379, 7379},
+    {8214, 8215},
+    {8224, 8231},
+    {8240, 8248},
+    {8251, 8254},
+    {8257, 8259},
+    {8263, 8273},
+    {8275, 8275},
+    {8277, 8286},
+    {11513, 11516},
+    {11518, 11519},
+    {11632, 11632},
+    {11776, 11777},
+    {11782, 11784},
+    {11787, 11787},
+    {11790, 11798},
+    {11800, 11801},
+    {11803, 11803},
+    {11806, 11807},
+    {11818, 11822},
+    {11824, 11833},
+    {11836, 11839},
+    {11841, 11841},
+    {11843, 11854},
+    {12289, 12291},
+    {12349, 12349},
+    {12539, 12539},
+    {42238, 42239},
+    {42509, 42511},
+    {42611, 42611},
+    {42622, 42622},
+    {42738, 42743},
+    {43124, 43127},
+    {43214, 43215},
+    {43256, 43258},
+    {43260, 43260},
+    {43310, 43311},
+    {43359, 43359},
+    {43457, 43469},
+    {43486, 43487},
+    {43612, 43615},
+    {43742, 43743},
+    {43760, 43761},
+    {44011, 44011},
+    {65040, 65046},
+    {65049, 65049},
+    {65072, 65072},
+    {65093, 65094},
+    {65097, 65100},
+    {65104, 65106},
+    {65108, 65111},
+    {65119, 65121},
+    {65128, 65128},
+    {65130, 65131},
+    {65281, 65283},
+    {65285, 65287},
+    {65290, 65290},
+    {65292, 65292},
+    {65294, 65295},
+    {65306, 65307},
+    {65311, 65312},
+    {65340, 65340},
+    {65377, 65377},
+    {65380, 65381},
+};
+static const URange32 Po_range32[] = {
+    {65792, 65794},
+    {66463, 66463},
+    {66512, 66512},
+    {66927, 66927},
+    {67671, 67671},
+    {67871, 67871},
+    {67903, 67903},
+    {68176, 68184},
+    {68223, 68223},
+    {68336, 68342},
+    {68409, 68415},
+    {68505, 68508},
+    {69461, 69465},
+    {69703, 69709},
+    {69819, 69820},
+    {69822, 69825},
+    {69952, 69955},
+    {70004, 70005},
+    {70085, 70088},
+    {70093, 70093},
+    {70107, 70107},
+    {70109, 70111},
+    {70200, 70205},
+    {70313, 70313},
+    {70731, 70735},
+    {70747, 70747},
+    {70749, 70749},
+    {70854, 70854},
+    {71105, 71127},
+    {71233, 71235},
+    {71264, 71276},
+    {71484, 71486},
+    {71739, 71739},
+    {72255, 72262},
+    {72346, 72348},
+    {72350, 72354},
+    {72769, 72773},
+    {72816, 72817},
+    {73463, 73464},
+    {74864, 74868},
+    {92782, 92783},
+    {92917, 92917},
+    {92983, 92987},
+    {92996, 92996},
+    {93847, 93850},
+    {113823, 113823},
+    {121479, 121483},
+    {125278, 125279},
+};
+static const URange16 Me_range16[] = {
+    {1160, 1161},
+    {6846, 6846},
+    {8413, 8416},
+    {8418, 8420},
+    {42608, 42610},
+};
+static const URange16 C_range16[] = {
+    {0, 31},
+    {127, 159},
+    {173, 173},
+    {1536, 1541},
+    {1564, 1564},
+    {1757, 1757},
+    {1807, 1807},
+    {2274, 2274},
+    {6158, 6158},
+    {8203, 8207},
+    {8234, 8238},
+    {8288, 8292},
+    {8294, 8303},
+    {55296, 63743},
+    {65279, 65279},
+    {65529, 65531},
+};
+static const URange32 C_range32[] = {
+    {69821, 69821},
+    {69837, 69837},
+    {113824, 113827},
+    {119155, 119162},
+    {917505, 917505},
+    {917536, 917631},
+    {983040, 1048573},
+    {1048576, 1114109},
+};
+static const URange16 Mc_range16[] = {
+    {2307, 2307},
+    {2363, 2363},
+    {2366, 2368},
+    {2377, 2380},
+    {2382, 2383},
+    {2434, 2435},
+    {2494, 2496},
+    {2503, 2504},
+    {2507, 2508},
+    {2519, 2519},
+    {2563, 2563},
+    {2622, 2624},
+    {2691, 2691},
+    {2750, 2752},
+    {2761, 2761},
+    {2763, 2764},
+    {2818, 2819},
+    {2878, 2878},
+    {2880, 2880},
+    {2887, 2888},
+    {2891, 2892},
+    {2903, 2903},
+    {3006, 3007},
+    {3009, 3010},
+    {3014, 3016},
+    {3018, 3020},
+    {3031, 3031},
+    {3073, 3075},
+    {3137, 3140},
+    {3202, 3203},
+    {3262, 3262},
+    {3264, 3268},
+    {3271, 3272},
+    {3274, 3275},
+    {3285, 3286},
+    {3330, 3331},
+    {3390, 3392},
+    {3398, 3400},
+    {3402, 3404},
+    {3415, 3415},
+    {3458, 3459},
+    {3535, 3537},
+    {3544, 3551},
+    {3570, 3571},
+    {3902, 3903},
+    {3967, 3967},
+    {4139, 4140},
+    {4145, 4145},
+    {4152, 4152},
+    {4155, 4156},
+    {4182, 4183},
+    {4194, 4196},
+    {4199, 4205},
+    {4227, 4228},
+    {4231, 4236},
+    {4239, 4239},
+    {4250, 4252},
+    {6070, 6070},
+    {6078, 6085},
+    {6087, 6088},
+    {6435, 6438},
+    {6441, 6443},
+    {6448, 6449},
+    {6451, 6456},
+    {6681, 6682},
+    {6741, 6741},
+    {6743, 6743},
+    {6753, 6753},
+    {6755, 6756},
+    {6765, 6770},
+    {6916, 6916},
+    {6965, 6965},
+    {6971, 6971},
+    {6973, 6977},
+    {6979, 6980},
+    {7042, 7042},
+    {7073, 7073},
+    {7078, 7079},
+    {7082, 7082},
+    {7143, 7143},
+    {7146, 7148},
+    {7150, 7150},
+    {7154, 7155},
+    {7204, 7211},
+    {7220, 7221},
+    {7393, 7393},
+    {7410, 7411},
+    {7415, 7415},
+    {12334, 12335},
+    {43043, 43044},
+    {43047, 43047},
+    {43136, 43137},
+    {43188, 43203},
+    {43346, 43347},
+    {43395, 43395},
+    {43444, 43445},
+    {43450, 43451},
+    {43453, 43456},
+    {43567, 43568},
+    {43571, 43572},
+    {43597, 43597},
+    {43643, 43643},
+    {43645, 43645},
+    {43755, 43755},
+    {43758, 43759},
+    {43765, 43765},
+    {44003, 44004},
+    {44006, 44007},
+    {44009, 44010},
+    {44012, 44012},
+};
+static const URange32 Mc_range32[] = {
+    {69632, 69632},
+    {69634, 69634},
+    {69762, 69762},
+    {69808, 69810},
+    {69815, 69816},
+    {69932, 69932},
+    {69957, 69958},
+    {70018, 70018},
+    {70067, 70069},
+    {70079, 70080},
+    {70188, 70190},
+    {70194, 70195},
+    {70197, 70197},
+    {70368, 70370},
+    {70402, 70403},
+    {70462, 70463},
+    {70465, 70468},
+    {70471, 70472},
+    {70475, 70477},
+    {70487, 70487},
+    {70498, 70499},
+    {70709, 70711},
+    {70720, 70721},
+    {70725, 70725},
+    {70832, 70834},
+    {70841, 70841},
+    {70843, 70846},
+    {70849, 70849},
+    {71087, 71089},
+    {71096, 71099},
+    {71102, 71102},
+    {71216, 71218},
+    {71227, 71228},
+    {71230, 71230},
+    {71340, 71340},
+    {71342, 71343},
+    {71350, 71350},
+    {71456, 71457},
+    {71462, 71462},
+    {71724, 71726},
+    {71736, 71736},
+    {72249, 72249},
+    {72279, 72280},
+    {72343, 72343},
+    {72751, 72751},
+    {72766, 72766},
+    {72873, 72873},
+    {72881, 72881},
+    {72884, 72884},
+    {73098, 73102},
+    {73107, 73108},
+    {73110, 73110},
+    {73461, 73462},
+    {94033, 94078},
+    {119141, 119142},
+    {119149, 119154},
+};
+static const URange16 Mn_range16[] = {
+    {768, 879},
+    {1155, 1159},
+    {1425, 1469},
+    {1471, 1471},
+    {1473, 1474},
+    {1476, 1477},
+    {1479, 1479},
+    {1552, 1562},
+    {1611, 1631},
+    {1648, 1648},
+    {1750, 1756},
+    {1759, 1764},
+    {1767, 1768},
+    {1770, 1773},
+    {1809, 1809},
+    {1840, 1866},
+    {1958, 1968},
+    {2027, 2035},
+    {2045, 2045},
+    {2070, 2073},
+    {2075, 2083},
+    {2085, 2087},
+    {2089, 2093},
+    {2137, 2139},
+    {2259, 2273},
+    {2275, 2306},
+    {2362, 2362},
+    {2364, 2364},
+    {2369, 2376},
+    {2381, 2381},
+    {2385, 2391},
+    {2402, 2403},
+    {2433, 2433},
+    {2492, 2492},
+    {2497, 2500},
+    {2509, 2509},
+    {2530, 2531},
+    {2558, 2558},
+    {2561, 2562},
+    {2620, 2620},
+    {2625, 2626},
+    {2631, 2632},
+    {2635, 2637},
+    {2641, 2641},
+    {2672, 2673},
+    {2677, 2677},
+    {2689, 2690},
+    {2748, 2748},
+    {2753, 2757},
+    {2759, 2760},
+    {2765, 2765},
+    {2786, 2787},
+    {2810, 2815},
+    {2817, 2817},
+    {2876, 2876},
+    {2879, 2879},
+    {2881, 2884},
+    {2893, 2893},
+    {2902, 2902},
+    {2914, 2915},
+    {2946, 2946},
+    {3008, 3008},
+    {3021, 3021},
+    {3072, 3072},
+    {3076, 3076},
+    {3134, 3136},
+    {3142, 3144},
+    {3146, 3149},
+    {3157, 3158},
+    {3170, 3171},
+    {3201, 3201},
+    {3260, 3260},
+    {3263, 3263},
+    {3270, 3270},
+    {3276, 3277},
+    {3298, 3299},
+    {3328, 3329},
+    {3387, 3388},
+    {3393, 3396},
+    {3405, 3405},
+    {3426, 3427},
+    {3530, 3530},
+    {3538, 3540},
+    {3542, 3542},
+    {3633, 3633},
+    {3636, 3642},
+    {3655, 3662},
+    {3761, 3761},
+    {3764, 3769},
+    {3771, 3772},
+    {3784, 3789},
+    {3864, 3865},
+    {3893, 3893},
+    {3895, 3895},
+    {3897, 3897},
+    {3953, 3966},
+    {3968, 3972},
+    {3974, 3975},
+    {3981, 3991},
+    {3993, 4028},
+    {4038, 4038},
+    {4141, 4144},
+    {4146, 4151},
+    {4153, 4154},
+    {4157, 4158},
+    {4184, 4185},
+    {4190, 4192},
+    {4209, 4212},
+    {4226, 4226},
+    {4229, 4230},
+    {4237, 4237},
+    {4253, 4253},
+    {4957, 4959},
+    {5906, 5908},
+    {5938, 5940},
+    {5970, 5971},
+    {6002, 6003},
+    {6068, 6069},
+    {6071, 6077},
+    {6086, 6086},
+    {6089, 6099},
+    {6109, 6109},
+    {6155, 6157},
+    {6277, 6278},
+    {6313, 6313},
+    {6432, 6434},
+    {6439, 6440},
+    {6450, 6450},
+    {6457, 6459},
+    {6679, 6680},
+    {6683, 6683},
+    {6742, 6742},
+    {6744, 6750},
+    {6752, 6752},
+    {6754, 6754},
+    {6757, 6764},
+    {6771, 6780},
+    {6783, 6783},
+    {6832, 6845},
+    {6912, 6915},
+    {6964, 6964},
+    {6966, 6970},
+    {6972, 6972},
+    {6978, 6978},
+    {7019, 7027},
+    {7040, 7041},
+    {7074, 7077},
+    {7080, 7081},
+    {7083, 7085},
+    {7142, 7142},
+    {7144, 7145},
+    {7149, 7149},
+    {7151, 7153},
+    {7212, 7219},
+    {7222, 7223},
+    {7376, 7378},
+    {7380, 7392},
+    {7394, 7400},
+    {7405, 7405},
+    {7412, 7412},
+    {7416, 7417},
+    {7616, 7673},
+    {7675, 7679},
+    {8400, 8412},
+    {8417, 8417},
+    {8421, 8432},
+    {11503, 11505},
+    {11647, 11647},
+    {11744, 11775},
+    {12330, 12333},
+    {12441, 12442},
+    {42607, 42607},
+    {42612, 42621},
+    {42654, 42655},
+    {42736, 42737},
+    {43010, 43010},
+    {43014, 43014},
+    {43019, 43019},
+    {43045, 43046},
+    {43204, 43205},
+    {43232, 43249},
+    {43263, 43263},
+    {43302, 43309},
+    {43335, 43345},
+    {43392, 43394},
+    {43443, 43443},
+    {43446, 43449},
+    {43452, 43452},
+    {43493, 43493},
+    {43561, 43566},
+    {43569, 43570},
+    {43573, 43574},
+    {43587, 43587},
+    {43596, 43596},
+    {43644, 43644},
+    {43696, 43696},
+    {43698, 43700},
+    {43703, 43704},
+    {43710, 43711},
+    {43713, 43713},
+    {43756, 43757},
+    {43766, 43766},
+    {44005, 44005},
+    {44008, 44008},
+    {44013, 44013},
+    {64286, 64286},
+    {65024, 65039},
+    {65056, 65071},
+};
+static const URange32 Mn_range32[] = {
+    {66045, 66045},
+    {66272, 66272},
+    {66422, 66426},
+    {68097, 68099},
+    {68101, 68102},
+    {68108, 68111},
+    {68152, 68154},
+    {68159, 68159},
+    {68325, 68326},
+    {68900, 68903},
+    {69446, 69456},
+    {69633, 69633},
+    {69688, 69702},
+    {69759, 69761},
+    {69811, 69814},
+    {69817, 69818},
+    {69888, 69890},
+    {69927, 69931},
+    {69933, 69940},
+    {70003, 70003},
+    {70016, 70017},
+    {70070, 70078},
+    {70089, 70092},
+    {70191, 70193},
+    {70196, 70196},
+    {70198, 70199},
+    {70206, 70206},
+    {70367, 70367},
+    {70371, 70378},
+    {70400, 70401},
+    {70459, 70460},
+    {70464, 70464},
+    {70502, 70508},
+    {70512, 70516},
+    {70712, 70719},
+    {70722, 70724},
+    {70726, 70726},
+    {70750, 70750},
+    {70835, 70840},
+    {70842, 70842},
+    {70847, 70848},
+    {70850, 70851},
+    {71090, 71093},
+    {71100, 71101},
+    {71103, 71104},
+    {71132, 71133},
+    {71219, 71226},
+    {71229, 71229},
+    {71231, 71232},
+    {71339, 71339},
+    {71341, 71341},
+    {71344, 71349},
+    {71351, 71351},
+    {71453, 71455},
+    {71458, 71461},
+    {71463, 71467},
+    {71727, 71735},
+    {71737, 71738},
+    {72193, 72202},
+    {72243, 72248},
+    {72251, 72254},
+    {72263, 72263},
+    {72273, 72278},
+    {72281, 72283},
+    {72330, 72342},
+    {72344, 72345},
+    {72752, 72758},
+    {72760, 72765},
+    {72767, 72767},
+    {72850, 72871},
+    {72874, 72880},
+    {72882, 72883},
+    {72885, 72886},
+    {73009, 73014},
+    {73018, 73018},
+    {73020, 73021},
+    {73023, 73029},
+    {73031, 73031},
+    {73104, 73105},
+    {73109, 73109},
+    {73111, 73111},
+    {73459, 73460},
+    {92912, 92916},
+    {92976, 92982},
+    {94095, 94098},
+    {113821, 113822},
+    {119143, 119145},
+    {119163, 119170},
+    {119173, 119179},
+    {119210, 119213},
+    {119362, 119364},
+    {121344, 121398},
+    {121403, 121452},
+    {121461, 121461},
+    {121476, 121476},
+    {121499, 121503},
+    {121505, 121519},
+    {122880, 122886},
+    {122888, 122904},
+    {122907, 122913},
+    {122915, 122916},
+    {122918, 122922},
+    {125136, 125142},
+    {125252, 125258},
+    {917760, 917999},
+};
+static const URange16 M_range16[] = {
+    {768, 879},
+    {1155, 1161},
+    {1425, 1469},
+    {1471, 1471},
+    {1473, 1474},
+    {1476, 1477},
+    {1479, 1479},
+    {1552, 1562},
+    {1611, 1631},
+    {1648, 1648},
+    {1750, 1756},
+    {1759, 1764},
+    {1767, 1768},
+    {1770, 1773},
+    {1809, 1809},
+    {1840, 1866},
+    {1958, 1968},
+    {2027, 2035},
+    {2045, 2045},
+    {2070, 2073},
+    {2075, 2083},
+    {2085, 2087},
+    {2089, 2093},
+    {2137, 2139},
+    {2259, 2273},
+    {2275, 2307},
+    {2362, 2364},
+    {2366, 2383},
+    {2385, 2391},
+    {2402, 2403},
+    {2433, 2435},
+    {2492, 2492},
+    {2494, 2500},
+    {2503, 2504},
+    {2507, 2509},
+    {2519, 2519},
+    {2530, 2531},
+    {2558, 2558},
+    {2561, 2563},
+    {2620, 2620},
+    {2622, 2626},
+    {2631, 2632},
+    {2635, 2637},
+    {2641, 2641},
+    {2672, 2673},
+    {2677, 2677},
+    {2689, 2691},
+    {2748, 2748},
+    {2750, 2757},
+    {2759, 2761},
+    {2763, 2765},
+    {2786, 2787},
+    {2810, 2815},
+    {2817, 2819},
+    {2876, 2876},
+    {2878, 2884},
+    {2887, 2888},
+    {2891, 2893},
+    {2902, 2903},
+    {2914, 2915},
+    {2946, 2946},
+    {3006, 3010},
+    {3014, 3016},
+    {3018, 3021},
+    {3031, 3031},
+    {3072, 3076},
+    {3134, 3140},
+    {3142, 3144},
+    {3146, 3149},
+    {3157, 3158},
+    {3170, 3171},
+    {3201, 3203},
+    {3260, 3260},
+    {3262, 3268},
+    {3270, 3272},
+    {3274, 3277},
+    {3285, 3286},
+    {3298, 3299},
+    {3328, 3331},
+    {3387, 3388},
+    {3390, 3396},
+    {3398, 3400},
+    {3402, 3405},
+    {3415, 3415},
+    {3426, 3427},
+    {3458, 3459},
+    {3530, 3530},
+    {3535, 3540},
+    {3542, 3542},
+    {3544, 3551},
+    {3570, 3571},
+    {3633, 3633},
+    {3636, 3642},
+    {3655, 3662},
+    {3761, 3761},
+    {3764, 3769},
+    {3771, 3772},
+    {3784, 3789},
+    {3864, 3865},
+    {3893, 3893},
+    {3895, 3895},
+    {3897, 3897},
+    {3902, 3903},
+    {3953, 3972},
+    {3974, 3975},
+    {3981, 3991},
+    {3993, 4028},
+    {4038, 4038},
+    {4139, 4158},
+    {4182, 4185},
+    {4190, 4192},
+    {4194, 4196},
+    {4199, 4205},
+    {4209, 4212},
+    {4226, 4237},
+    {4239, 4239},
+    {4250, 4253},
+    {4957, 4959},
+    {5906, 5908},
+    {5938, 5940},
+    {5970, 5971},
+    {6002, 6003},
+    {6068, 6099},
+    {6109, 6109},
+    {6155, 6157},
+    {6277, 6278},
+    {6313, 6313},
+    {6432, 6443},
+    {6448, 6459},
+    {6679, 6683},
+    {6741, 6750},
+    {6752, 6780},
+    {6783, 6783},
+    {6832, 6846},
+    {6912, 6916},
+    {6964, 6980},
+    {7019, 7027},
+    {7040, 7042},
+    {7073, 7085},
+    {7142, 7155},
+    {7204, 7223},
+    {7376, 7378},
+    {7380, 7400},
+    {7405, 7405},
+    {7410, 7412},
+    {7415, 7417},
+    {7616, 7673},
+    {7675, 7679},
+    {8400, 8432},
+    {11503, 11505},
+    {11647, 11647},
+    {11744, 11775},
+    {12330, 12335},
+    {12441, 12442},
+    {42607, 42610},
+    {42612, 42621},
+    {42654, 42655},
+    {42736, 42737},
+    {43010, 43010},
+    {43014, 43014},
+    {43019, 43019},
+    {43043, 43047},
+    {43136, 43137},
+    {43188, 43205},
+    {43232, 43249},
+    {43263, 43263},
+    {43302, 43309},
+    {43335, 43347},
+    {43392, 43395},
+    {43443, 43456},
+    {43493, 43493},
+    {43561, 43574},
+    {43587, 43587},
+    {43596, 43597},
+    {43643, 43645},
+    {43696, 43696},
+    {43698, 43700},
+    {43703, 43704},
+    {43710, 43711},
+    {43713, 43713},
+    {43755, 43759},
+    {43765, 43766},
+    {44003, 44010},
+    {44012, 44013},
+    {64286, 64286},
+    {65024, 65039},
+    {65056, 65071},
+};
+static const URange32 M_range32[] = {
+    {66045, 66045},
+    {66272, 66272},
+    {66422, 66426},
+    {68097, 68099},
+    {68101, 68102},
+    {68108, 68111},
+    {68152, 68154},
+    {68159, 68159},
+    {68325, 68326},
+    {68900, 68903},
+    {69446, 69456},
+    {69632, 69634},
+    {69688, 69702},
+    {69759, 69762},
+    {69808, 69818},
+    {69888, 69890},
+    {69927, 69940},
+    {69957, 69958},
+    {70003, 70003},
+    {70016, 70018},
+    {70067, 70080},
+    {70089, 70092},
+    {70188, 70199},
+    {70206, 70206},
+    {70367, 70378},
+    {70400, 70403},
+    {70459, 70460},
+    {70462, 70468},
+    {70471, 70472},
+    {70475, 70477},
+    {70487, 70487},
+    {70498, 70499},
+    {70502, 70508},
+    {70512, 70516},
+    {70709, 70726},
+    {70750, 70750},
+    {70832, 70851},
+    {71087, 71093},
+    {71096, 71104},
+    {71132, 71133},
+    {71216, 71232},
+    {71339, 71351},
+    {71453, 71467},
+    {71724, 71738},
+    {72193, 72202},
+    {72243, 72249},
+    {72251, 72254},
+    {72263, 72263},
+    {72273, 72283},
+    {72330, 72345},
+    {72751, 72758},
+    {72760, 72767},
+    {72850, 72871},
+    {72873, 72886},
+    {73009, 73014},
+    {73018, 73018},
+    {73020, 73021},
+    {73023, 73029},
+    {73031, 73031},
+    {73098, 73102},
+    {73104, 73105},
+    {73107, 73111},
+    {73459, 73462},
+    {92912, 92916},
+    {92976, 92982},
+    {94033, 94078},
+    {94095, 94098},
+    {113821, 113822},
+    {119141, 119145},
+    {119149, 119154},
+    {119163, 119170},
+    {119173, 119179},
+    {119210, 119213},
+    {119362, 119364},
+    {121344, 121398},
+    {121403, 121452},
+    {121461, 121461},
+    {121476, 121476},
+    {121499, 121503},
+    {121505, 121519},
+    {122880, 122886},
+    {122888, 122904},
+    {122907, 122913},
+    {122915, 122916},
+    {122918, 122922},
+    {125136, 125142},
+    {125252, 125258},
+    {917760, 917999},
+};
+static const URange16 L_range16[] = {
+    {65, 90},
+    {97, 122},
+    {170, 170},
+    {181, 181},
+    {186, 186},
+    {192, 214},
+    {216, 246},
+    {248, 705},
+    {710, 721},
+    {736, 740},
+    {748, 748},
+    {750, 750},
+    {880, 884},
+    {886, 887},
+    {890, 893},
+    {895, 895},
+    {902, 902},
+    {904, 906},
+    {908, 908},
+    {910, 929},
+    {931, 1013},
+    {1015, 1153},
+    {1162, 1327},
+    {1329, 1366},
+    {1369, 1369},
+    {1376, 1416},
+    {1488, 1514},
+    {1519, 1522},
+    {1568, 1610},
+    {1646, 1647},
+    {1649, 1747},
+    {1749, 1749},
+    {1765, 1766},
+    {1774, 1775},
+    {1786, 1788},
+    {1791, 1791},
+    {1808, 1808},
+    {1810, 1839},
+    {1869, 1957},
+    {1969, 1969},
+    {1994, 2026},
+    {2036, 2037},
+    {2042, 2042},
+    {2048, 2069},
+    {2074, 2074},
+    {2084, 2084},
+    {2088, 2088},
+    {2112, 2136},
+    {2144, 2154},
+    {2208, 2228},
+    {2230, 2237},
+    {2308, 2361},
+    {2365, 2365},
+    {2384, 2384},
+    {2392, 2401},
+    {2417, 2432},
+    {2437, 2444},
+    {2447, 2448},
+    {2451, 2472},
+    {2474, 2480},
+    {2482, 2482},
+    {2486, 2489},
+    {2493, 2493},
+    {2510, 2510},
+    {2524, 2525},
+    {2527, 2529},
+    {2544, 2545},
+    {2556, 2556},
+    {2565, 2570},
+    {2575, 2576},
+    {2579, 2600},
+    {2602, 2608},
+    {2610, 2611},
+    {2613, 2614},
+    {2616, 2617},
+    {2649, 2652},
+    {2654, 2654},
+    {2674, 2676},
+    {2693, 2701},
+    {2703, 2705},
+    {2707, 2728},
+    {2730, 2736},
+    {2738, 2739},
+    {2741, 2745},
+    {2749, 2749},
+    {2768, 2768},
+    {2784, 2785},
+    {2809, 2809},
+    {2821, 2828},
+    {2831, 2832},
+    {2835, 2856},
+    {2858, 2864},
+    {2866, 2867},
+    {2869, 2873},
+    {2877, 2877},
+    {2908, 2909},
+    {2911, 2913},
+    {2929, 2929},
+    {2947, 2947},
+    {2949, 2954},
+    {2958, 2960},
+    {2962, 2965},
+    {2969, 2970},
+    {2972, 2972},
+    {2974, 2975},
+    {2979, 2980},
+    {2984, 2986},
+    {2990, 3001},
+    {3024, 3024},
+    {3077, 3084},
+    {3086, 3088},
+    {3090, 3112},
+    {3114, 3129},
+    {3133, 3133},
+    {3160, 3162},
+    {3168, 3169},
+    {3200, 3200},
+    {3205, 3212},
+    {3214, 3216},
+    {3218, 3240},
+    {3242, 3251},
+    {3253, 3257},
+    {3261, 3261},
+    {3294, 3294},
+    {3296, 3297},
+    {3313, 3314},
+    {3333, 3340},
+    {3342, 3344},
+    {3346, 3386},
+    {3389, 3389},
+    {3406, 3406},
+    {3412, 3414},
+    {3423, 3425},
+    {3450, 3455},
+    {3461, 3478},
+    {3482, 3505},
+    {3507, 3515},
+    {3517, 3517},
+    {3520, 3526},
+    {3585, 3632},
+    {3634, 3635},
+    {3648, 3654},
+    {3713, 3714},
+    {3716, 3716},
+    {3719, 3720},
+    {3722, 3722},
+    {3725, 3725},
+    {3732, 3735},
+    {3737, 3743},
+    {3745, 3747},
+    {3749, 3749},
+    {3751, 3751},
+    {3754, 3755},
+    {3757, 3760},
+    {3762, 3763},
+    {3773, 3773},
+    {3776, 3780},
+    {3782, 3782},
+    {3804, 3807},
+    {3840, 3840},
+    {3904, 3911},
+    {3913, 3948},
+    {3976, 3980},
+    {4096, 4138},
+    {4159, 4159},
+    {4176, 4181},
+    {4186, 4189},
+    {4193, 4193},
+    {4197, 4198},
+    {4206, 4208},
+    {4213, 4225},
+    {4238, 4238},
+    {4256, 4293},
+    {4295, 4295},
+    {4301, 4301},
+    {4304, 4346},
+    {4348, 4680},
+    {4682, 4685},
+    {4688, 4694},
+    {4696, 4696},
+    {4698, 4701},
+    {4704, 4744},
+    {4746, 4749},
+    {4752, 4784},
+    {4786, 4789},
+    {4792, 4798},
+    {4800, 4800},
+    {4802, 4805},
+    {4808, 4822},
+    {4824, 4880},
+    {4882, 4885},
+    {4888, 4954},
+    {4992, 5007},
+    {5024, 5109},
+    {5112, 5117},
+    {5121, 5740},
+    {5743, 5759},
+    {5761, 5786},
+    {5792, 5866},
+    {5873, 5880},
+    {5888, 5900},
+    {5902, 5905},
+    {5920, 5937},
+    {5952, 5969},
+    {5984, 5996},
+    {5998, 6000},
+    {6016, 6067},
+    {6103, 6103},
+    {6108, 6108},
+    {6176, 6264},
+    {6272, 6276},
+    {6279, 6312},
+    {6314, 6314},
+    {6320, 6389},
+    {6400, 6430},
+    {6480, 6509},
+    {6512, 6516},
+    {6528, 6571},
+    {6576, 6601},
+    {6656, 6678},
+    {6688, 6740},
+    {6823, 6823},
+    {6917, 6963},
+    {6981, 6987},
+    {7043, 7072},
+    {7086, 7087},
+    {7098, 7141},
+    {7168, 7203},
+    {7245, 7247},
+    {7258, 7293},
+    {7296, 7304},
+    {7312, 7354},
+    {7357, 7359},
+    {7401, 7404},
+    {7406, 7409},
+    {7413, 7414},
+    {7424, 7615},
+    {7680, 7957},
+    {7960, 7965},
+    {7968, 8005},
+    {8008, 8013},
+    {8016, 8023},
+    {8025, 8025},
+    {8027, 8027},
+    {8029, 8029},
+    {8031, 8061},
+    {8064, 8116},
+    {8118, 8124},
+    {8126, 8126},
+    {8130, 8132},
+    {8134, 8140},
+    {8144, 8147},
+    {8150, 8155},
+    {8160, 8172},
+    {8178, 8180},
+    {8182, 8188},
+    {8305, 8305},
+    {8319, 8319},
+    {8336, 8348},
+    {8450, 8450},
+    {8455, 8455},
+    {8458, 8467},
+    {8469, 8469},
+    {8473, 8477},
+    {8484, 8484},
+    {8486, 8486},
+    {8488, 8488},
+    {8490, 8493},
+    {8495, 8505},
+    {8508, 8511},
+    {8517, 8521},
+    {8526, 8526},
+    {8579, 8580},
+    {11264, 11310},
+    {11312, 11358},
+    {11360, 11492},
+    {11499, 11502},
+    {11506, 11507},
+    {11520, 11557},
+    {11559, 11559},
+    {11565, 11565},
+    {11568, 11623},
+    {11631, 11631},
+    {11648, 11670},
+    {11680, 11686},
+    {11688, 11694},
+    {11696, 11702},
+    {11704, 11710},
+    {11712, 11718},
+    {11720, 11726},
+    {11728, 11734},
+    {11736, 11742},
+    {11823, 11823},
+    {12293, 12294},
+    {12337, 12341},
+    {12347, 12348},
+    {12353, 12438},
+    {12445, 12447},
+    {12449, 12538},
+    {12540, 12543},
+    {12549, 12591},
+    {12593, 12686},
+    {12704, 12730},
+    {12784, 12799},
+    {13312, 19893},
+    {19968, 40943},
+    {40960, 42124},
+    {42192, 42237},
+    {42240, 42508},
+    {42512, 42527},
+    {42538, 42539},
+    {42560, 42606},
+    {42623, 42653},
+    {42656, 42725},
+    {42775, 42783},
+    {42786, 42888},
+    {42891, 42937},
+    {42999, 43009},
+    {43011, 43013},
+    {43015, 43018},
+    {43020, 43042},
+    {43072, 43123},
+    {43138, 43187},
+    {43250, 43255},
+    {43259, 43259},
+    {43261, 43262},
+    {43274, 43301},
+    {43312, 43334},
+    {43360, 43388},
+    {43396, 43442},
+    {43471, 43471},
+    {43488, 43492},
+    {43494, 43503},
+    {43514, 43518},
+    {43520, 43560},
+    {43584, 43586},
+    {43588, 43595},
+    {43616, 43638},
+    {43642, 43642},
+    {43646, 43695},
+    {43697, 43697},
+    {43701, 43702},
+    {43705, 43709},
+    {43712, 43712},
+    {43714, 43714},
+    {43739, 43741},
+    {43744, 43754},
+    {43762, 43764},
+    {43777, 43782},
+    {43785, 43790},
+    {43793, 43798},
+    {43808, 43814},
+    {43816, 43822},
+    {43824, 43866},
+    {43868, 43877},
+    {43888, 44002},
+    {44032, 55203},
+    {55216, 55238},
+    {55243, 55291},
+    {63744, 64109},
+    {64112, 64217},
+    {64256, 64262},
+    {64275, 64279},
+    {64285, 64285},
+    {64287, 64296},
+    {64298, 64310},
+    {64312, 64316},
+    {64318, 64318},
+    {64320, 64321},
+    {64323, 64324},
+    {64326, 64433},
+    {64467, 64829},
+    {64848, 64911},
+    {64914, 64967},
+    {65008, 65019},
+    {65136, 65140},
+    {65142, 65276},
+    {65313, 65338},
+    {65345, 65370},
+    {65382, 65470},
+    {65474, 65479},
+    {65482, 65487},
+    {65490, 65495},
+    {65498, 65500},
+};
+static const URange32 L_range32[] = {
+    {65536, 65547},
+    {65549, 65574},
+    {65576, 65594},
+    {65596, 65597},
+    {65599, 65613},
+    {65616, 65629},
+    {65664, 65786},
+    {66176, 66204},
+    {66208, 66256},
+    {66304, 66335},
+    {66349, 66368},
+    {66370, 66377},
+    {66384, 66421},
+    {66432, 66461},
+    {66464, 66499},
+    {66504, 66511},
+    {66560, 66717},
+    {66736, 66771},
+    {66776, 66811},
+    {66816, 66855},
+    {66864, 66915},
+    {67072, 67382},
+    {67392, 67413},
+    {67424, 67431},
+    {67584, 67589},
+    {67592, 67592},
+    {67594, 67637},
+    {67639, 67640},
+    {67644, 67644},
+    {67647, 67669},
+    {67680, 67702},
+    {67712, 67742},
+    {67808, 67826},
+    {67828, 67829},
+    {67840, 67861},
+    {67872, 67897},
+    {67968, 68023},
+    {68030, 68031},
+    {68096, 68096},
+    {68112, 68115},
+    {68117, 68119},
+    {68121, 68149},
+    {68192, 68220},
+    {68224, 68252},
+    {68288, 68295},
+    {68297, 68324},
+    {68352, 68405},
+    {68416, 68437},
+    {68448, 68466},
+    {68480, 68497},
+    {68608, 68680},
+    {68736, 68786},
+    {68800, 68850},
+    {68864, 68899},
+    {69376, 69404},
+    {69415, 69415},
+    {69424, 69445},
+    {69635, 69687},
+    {69763, 69807},
+    {69840, 69864},
+    {69891, 69926},
+    {69956, 69956},
+    {69968, 70002},
+    {70006, 70006},
+    {70019, 70066},
+    {70081, 70084},
+    {70106, 70106},
+    {70108, 70108},
+    {70144, 70161},
+    {70163, 70187},
+    {70272, 70278},
+    {70280, 70280},
+    {70282, 70285},
+    {70287, 70301},
+    {70303, 70312},
+    {70320, 70366},
+    {70405, 70412},
+    {70415, 70416},
+    {70419, 70440},
+    {70442, 70448},
+    {70450, 70451},
+    {70453, 70457},
+    {70461, 70461},
+    {70480, 70480},
+    {70493, 70497},
+    {70656, 70708},
+    {70727, 70730},
+    {70784, 70831},
+    {70852, 70853},
+    {70855, 70855},
+    {71040, 71086},
+    {71128, 71131},
+    {71168, 71215},
+    {71236, 71236},
+    {71296, 71338},
+    {71424, 71450},
+    {71680, 71723},
+    {71840, 71903},
+    {71935, 71935},
+    {72192, 72192},
+    {72203, 72242},
+    {72250, 72250},
+    {72272, 72272},
+    {72284, 72323},
+    {72326, 72329},
+    {72349, 72349},
+    {72384, 72440},
+    {72704, 72712},
+    {72714, 72750},
+    {72768, 72768},
+    {72818, 72847},
+    {72960, 72966},
+    {72968, 72969},
+    {72971, 73008},
+    {73030, 73030},
+    {73056, 73061},
+    {73063, 73064},
+    {73066, 73097},
+    {73112, 73112},
+    {73440, 73458},
+    {73728, 74649},
+    {74880, 75075},
+    {77824, 78894},
+    {82944, 83526},
+    {92160, 92728},
+    {92736, 92766},
+    {92880, 92909},
+    {92928, 92975},
+    {92992, 92995},
+    {93027, 93047},
+    {93053, 93071},
+    {93760, 93823},
+    {93952, 94020},
+    {94032, 94032},
+    {94099, 94111},
+    {94176, 94177},
+    {94208, 100337},
+    {100352, 101106},
+    {110592, 110878},
+    {110960, 111355},
+    {113664, 113770},
+    {113776, 113788},
+    {113792, 113800},
+    {113808, 113817},
+    {119808, 119892},
+    {119894, 119964},
+    {119966, 119967},
+    {119970, 119970},
+    {119973, 119974},
+    {119977, 119980},
+    {119982, 119993},
+    {119995, 119995},
+    {119997, 120003},
+    {120005, 120069},
+    {120071, 120074},
+    {120077, 120084},
+    {120086, 120092},
+    {120094, 120121},
+    {120123, 120126},
+    {120128, 120132},
+    {120134, 120134},
+    {120138, 120144},
+    {120146, 120485},
+    {120488, 120512},
+    {120514, 120538},
+    {120540, 120570},
+    {120572, 120596},
+    {120598, 120628},
+    {120630, 120654},
+    {120656, 120686},
+    {120688, 120712},
+    {120714, 120744},
+    {120746, 120770},
+    {120772, 120779},
+    {124928, 125124},
+    {125184, 125251},
+    {126464, 126467},
+    {126469, 126495},
+    {126497, 126498},
+    {126500, 126500},
+    {126503, 126503},
+    {126505, 126514},
+    {126516, 126519},
+    {126521, 126521},
+    {126523, 126523},
+    {126530, 126530},
+    {126535, 126535},
+    {126537, 126537},
+    {126539, 126539},
+    {126541, 126543},
+    {126545, 126546},
+    {126548, 126548},
+    {126551, 126551},
+    {126553, 126553},
+    {126555, 126555},
+    {126557, 126557},
+    {126559, 126559},
+    {126561, 126562},
+    {126564, 126564},
+    {126567, 126570},
+    {126572, 126578},
+    {126580, 126583},
+    {126585, 126588},
+    {126590, 126590},
+    {126592, 126601},
+    {126603, 126619},
+    {126625, 126627},
+    {126629, 126633},
+    {126635, 126651},
+    {131072, 173782},
+    {173824, 177972},
+    {177984, 178205},
+    {178208, 183969},
+    {183984, 191456},
+    {194560, 195101},
+};
+static const URange16 N_range16[] = {
+    {48, 57},
+    {178, 179},
+    {185, 185},
+    {188, 190},
+    {1632, 1641},
+    {1776, 1785},
+    {1984, 1993},
+    {2406, 2415},
+    {2534, 2543},
+    {2548, 2553},
+    {2662, 2671},
+    {2790, 2799},
+    {2918, 2927},
+    {2930, 2935},
+    {3046, 3058},
+    {3174, 3183},
+    {3192, 3198},
+    {3302, 3311},
+    {3416, 3422},
+    {3430, 3448},
+    {3558, 3567},
+    {3664, 3673},
+    {3792, 3801},
+    {3872, 3891},
+    {4160, 4169},
+    {4240, 4249},
+    {4969, 4988},
+    {5870, 5872},
+    {6112, 6121},
+    {6128, 6137},
+    {6160, 6169},
+    {6470, 6479},
+    {6608, 6618},
+    {6784, 6793},
+    {6800, 6809},
+    {6992, 7001},
+    {7088, 7097},
+    {7232, 7241},
+    {7248, 7257},
+    {8304, 8304},
+    {8308, 8313},
+    {8320, 8329},
+    {8528, 8578},
+    {8581, 8585},
+    {9312, 9371},
+    {9450, 9471},
+    {10102, 10131},
+    {11517, 11517},
+    {12295, 12295},
+    {12321, 12329},
+    {12344, 12346},
+    {12690, 12693},
+    {12832, 12841},
+    {12872, 12879},
+    {12881, 12895},
+    {12928, 12937},
+    {12977, 12991},
+    {42528, 42537},
+    {42726, 42735},
+    {43056, 43061},
+    {43216, 43225},
+    {43264, 43273},
+    {43472, 43481},
+    {43504, 43513},
+    {43600, 43609},
+    {44016, 44025},
+    {65296, 65305},
+};
+static const URange32 N_range32[] = {
+    {65799, 65843},
+    {65856, 65912},
+    {65930, 65931},
+    {66273, 66299},
+    {66336, 66339},
+    {66369, 66369},
+    {66378, 66378},
+    {66513, 66517},
+    {66720, 66729},
+    {67672, 67679},
+    {67705, 67711},
+    {67751, 67759},
+    {67835, 67839},
+    {67862, 67867},
+    {68028, 68029},
+    {68032, 68047},
+    {68050, 68095},
+    {68160, 68168},
+    {68221, 68222},
+    {68253, 68255},
+    {68331, 68335},
+    {68440, 68447},
+    {68472, 68479},
+    {68521, 68527},
+    {68858, 68863},
+    {68912, 68921},
+    {69216, 69246},
+    {69405, 69414},
+    {69457, 69460},
+    {69714, 69743},
+    {69872, 69881},
+    {69942, 69951},
+    {70096, 70105},
+    {70113, 70132},
+    {70384, 70393},
+    {70736, 70745},
+    {70864, 70873},
+    {71248, 71257},
+    {71360, 71369},
+    {71472, 71483},
+    {71904, 71922},
+    {72784, 72812},
+    {73040, 73049},
+    {73120, 73129},
+    {74752, 74862},
+    {92768, 92777},
+    {93008, 93017},
+    {93019, 93025},
+    {93824, 93846},
+    {119520, 119539},
+    {119648, 119672},
+    {120782, 120831},
+    {125127, 125135},
+    {125264, 125273},
+    {126065, 126123},
+    {126125, 126127},
+    {126129, 126132},
+    {127232, 127244},
+};
+static const URange16 Sk_range16[] = {
+    {94, 94},
+    {96, 96},
+    {168, 168},
+    {175, 175},
+    {180, 180},
+    {184, 184},
+    {706, 709},
+    {722, 735},
+    {741, 747},
+    {749, 749},
+    {751, 767},
+    {885, 885},
+    {900, 901},
+    {8125, 8125},
+    {8127, 8129},
+    {8141, 8143},
+    {8157, 8159},
+    {8173, 8175},
+    {8189, 8190},
+    {12443, 12444},
+    {42752, 42774},
+    {42784, 42785},
+    {42889, 42890},
+    {43867, 43867},
+    {64434, 64449},
+    {65342, 65342},
+    {65344, 65344},
+    {65507, 65507},
+};
+static const URange32 Sk_range32[] = {
+    {127995, 127999},
+};
+static const URange16 P_range16[] = {
+    {33, 35},
+    {37, 42},
+    {44, 47},
+    {58, 59},
+    {63, 64},
+    {91, 93},
+    {95, 95},
+    {123, 123},
+    {125, 125},
+    {161, 161},
+    {167, 167},
+    {171, 171},
+    {182, 183},
+    {187, 187},
+    {191, 191},
+    {894, 894},
+    {903, 903},
+    {1370, 1375},
+    {1417, 1418},
+    {1470, 1470},
+    {1472, 1472},
+    {1475, 1475},
+    {1478, 1478},
+    {1523, 1524},
+    {1545, 1546},
+    {1548, 1549},
+    {1563, 1563},
+    {1566, 1567},
+    {1642, 1645},
+    {1748, 1748},
+    {1792, 1805},
+    {2039, 2041},
+    {2096, 2110},
+    {2142, 2142},
+    {2404, 2405},
+    {2416, 2416},
+    {2557, 2557},
+    {2678, 2678},
+    {2800, 2800},
+    {3204, 3204},
+    {3572, 3572},
+    {3663, 3663},
+    {3674, 3675},
+    {3844, 3858},
+    {3860, 3860},
+    {3898, 3901},
+    {3973, 3973},
+    {4048, 4052},
+    {4057, 4058},
+    {4170, 4175},
+    {4347, 4347},
+    {4960, 4968},
+    {5120, 5120},
+    {5741, 5742},
+    {5787, 5788},
+    {5867, 5869},
+    {5941, 5942},
+    {6100, 6102},
+    {6104, 6106},
+    {6144, 6154},
+    {6468, 6469},
+    {6686, 6687},
+    {6816, 6822},
+    {6824, 6829},
+    {7002, 7008},
+    {7164, 7167},
+    {7227, 7231},
+    {7294, 7295},
+    {7360, 7367},
+    {7379, 7379},
+    {8208, 8231},
+    {8240, 8259},
+    {8261, 8273},
+    {8275, 8286},
+    {8317, 8318},
+    {8333, 8334},
+    {8968, 8971},
+    {9001, 9002},
+    {10088, 10101},
+    {10181, 10182},
+    {10214, 10223},
+    {10627, 10648},
+    {10712, 10715},
+    {10748, 10749},
+    {11513, 11516},
+    {11518, 11519},
+    {11632, 11632},
+    {11776, 11822},
+    {11824, 11854},
+    {12289, 12291},
+    {12296, 12305},
+    {12308, 12319},
+    {12336, 12336},
+    {12349, 12349},
+    {12448, 12448},
+    {12539, 12539},
+    {42238, 42239},
+    {42509, 42511},
+    {42611, 42611},
+    {42622, 42622},
+    {42738, 42743},
+    {43124, 43127},
+    {43214, 43215},
+    {43256, 43258},
+    {43260, 43260},
+    {43310, 43311},
+    {43359, 43359},
+    {43457, 43469},
+    {43486, 43487},
+    {43612, 43615},
+    {43742, 43743},
+    {43760, 43761},
+    {44011, 44011},
+    {64830, 64831},
+    {65040, 65049},
+    {65072, 65106},
+    {65108, 65121},
+    {65123, 65123},
+    {65128, 65128},
+    {65130, 65131},
+    {65281, 65283},
+    {65285, 65290},
+    {65292, 65295},
+    {65306, 65307},
+    {65311, 65312},
+    {65339, 65341},
+    {65343, 65343},
+    {65371, 65371},
+    {65373, 65373},
+    {65375, 65381},
+};
+static const URange32 P_range32[] = {
+    {65792, 65794},
+    {66463, 66463},
+    {66512, 66512},
+    {66927, 66927},
+    {67671, 67671},
+    {67871, 67871},
+    {67903, 67903},
+    {68176, 68184},
+    {68223, 68223},
+    {68336, 68342},
+    {68409, 68415},
+    {68505, 68508},
+    {69461, 69465},
+    {69703, 69709},
+    {69819, 69820},
+    {69822, 69825},
+    {69952, 69955},
+    {70004, 70005},
+    {70085, 70088},
+    {70093, 70093},
+    {70107, 70107},
+    {70109, 70111},
+    {70200, 70205},
+    {70313, 70313},
+    {70731, 70735},
+    {70747, 70747},
+    {70749, 70749},
+    {70854, 70854},
+    {71105, 71127},
+    {71233, 71235},
+    {71264, 71276},
+    {71484, 71486},
+    {71739, 71739},
+    {72255, 72262},
+    {72346, 72348},
+    {72350, 72354},
+    {72769, 72773},
+    {72816, 72817},
+    {73463, 73464},
+    {74864, 74868},
+    {92782, 92783},
+    {92917, 92917},
+    {92983, 92987},
+    {92996, 92996},
+    {93847, 93850},
+    {113823, 113823},
+    {121479, 121483},
+    {125278, 125279},
+};
+static const URange16 S_range16[] = {
+    {36, 36},
+    {43, 43},
+    {60, 62},
+    {94, 94},
+    {96, 96},
+    {124, 124},
+    {126, 126},
+    {162, 166},
+    {168, 169},
+    {172, 172},
+    {174, 177},
+    {180, 180},
+    {184, 184},
+    {215, 215},
+    {247, 247},
+    {706, 709},
+    {722, 735},
+    {741, 747},
+    {749, 749},
+    {751, 767},
+    {885, 885},
+    {900, 901},
+    {1014, 1014},
+    {1154, 1154},
+    {1421, 1423},
+    {1542, 1544},
+    {1547, 1547},
+    {1550, 1551},
+    {1758, 1758},
+    {1769, 1769},
+    {1789, 1790},
+    {2038, 2038},
+    {2046, 2047},
+    {2546, 2547},
+    {2554, 2555},
+    {2801, 2801},
+    {2928, 2928},
+    {3059, 3066},
+    {3199, 3199},
+    {3407, 3407},
+    {3449, 3449},
+    {3647, 3647},
+    {3841, 3843},
+    {3859, 3859},
+    {3861, 3863},
+    {3866, 3871},
+    {3892, 3892},
+    {3894, 3894},
+    {3896, 3896},
+    {4030, 4037},
+    {4039, 4044},
+    {4046, 4047},
+    {4053, 4056},
+    {4254, 4255},
+    {5008, 5017},
+    {6107, 6107},
+    {6464, 6464},
+    {6622, 6655},
+    {7009, 7018},
+    {7028, 7036},
+    {8125, 8125},
+    {8127, 8129},
+    {8141, 8143},
+    {8157, 8159},
+    {8173, 8175},
+    {8189, 8190},
+    {8260, 8260},
+    {8274, 8274},
+    {8314, 8316},
+    {8330, 8332},
+    {8352, 8383},
+    {8448, 8449},
+    {8451, 8454},
+    {8456, 8457},
+    {8468, 8468},
+    {8470, 8472},
+    {8478, 8483},
+    {8485, 8485},
+    {8487, 8487},
+    {8489, 8489},
+    {8494, 8494},
+    {8506, 8507},
+    {8512, 8516},
+    {8522, 8525},
+    {8527, 8527},
+    {8586, 8587},
+    {8592, 8967},
+    {8972, 9000},
+    {9003, 9254},
+    {9280, 9290},
+    {9372, 9449},
+    {9472, 10087},
+    {10132, 10180},
+    {10183, 10213},
+    {10224, 10626},
+    {10649, 10711},
+    {10716, 10747},
+    {10750, 11123},
+    {11126, 11157},
+    {11160, 11208},
+    {11210, 11262},
+    {11493, 11498},
+    {11904, 11929},
+    {11931, 12019},
+    {12032, 12245},
+    {12272, 12283},
+    {12292, 12292},
+    {12306, 12307},
+    {12320, 12320},
+    {12342, 12343},
+    {12350, 12351},
+    {12443, 12444},
+    {12688, 12689},
+    {12694, 12703},
+    {12736, 12771},
+    {12800, 12830},
+    {12842, 12871},
+    {12880, 12880},
+    {12896, 12927},
+    {12938, 12976},
+    {12992, 13054},
+    {13056, 13311},
+    {19904, 19967},
+    {42128, 42182},
+    {42752, 42774},
+    {42784, 42785},
+    {42889, 42890},
+    {43048, 43051},
+    {43062, 43065},
+    {43639, 43641},
+    {43867, 43867},
+    {64297, 64297},
+    {64434, 64449},
+    {65020, 65021},
+    {65122, 65122},
+    {65124, 65126},
+    {65129, 65129},
+    {65284, 65284},
+    {65291, 65291},
+    {65308, 65310},
+    {65342, 65342},
+    {65344, 65344},
+    {65372, 65372},
+    {65374, 65374},
+    {65504, 65510},
+    {65512, 65518},
+    {65532, 65533},
+};
+static const URange32 S_range32[] = {
+    {65847, 65855},
+    {65913, 65929},
+    {65932, 65934},
+    {65936, 65947},
+    {65952, 65952},
+    {66000, 66044},
+    {67703, 67704},
+    {68296, 68296},
+    {71487, 71487},
+    {92988, 92991},
+    {92997, 92997},
+    {113820, 113820},
+    {118784, 119029},
+    {119040, 119078},
+    {119081, 119140},
+    {119146, 119148},
+    {119171, 119172},
+    {119180, 119209},
+    {119214, 119272},
+    {119296, 119361},
+    {119365, 119365},
+    {119552, 119638},
+    {120513, 120513},
+    {120539, 120539},
+    {120571, 120571},
+    {120597, 120597},
+    {120629, 120629},
+    {120655, 120655},
+    {120687, 120687},
+    {120713, 120713},
+    {120745, 120745},
+    {120771, 120771},
+    {120832, 121343},
+    {121399, 121402},
+    {121453, 121460},
+    {121462, 121475},
+    {121477, 121478},
+    {126124, 126124},
+    {126128, 126128},
+    {126704, 126705},
+    {126976, 127019},
+    {127024, 127123},
+    {127136, 127150},
+    {127153, 127167},
+    {127169, 127183},
+    {127185, 127221},
+    {127248, 127339},
+    {127344, 127404},
+    {127462, 127490},
+    {127504, 127547},
+    {127552, 127560},
+    {127568, 127569},
+    {127584, 127589},
+    {127744, 128724},
+    {128736, 128748},
+    {128752, 128761},
+    {128768, 128883},
+    {128896, 128984},
+    {129024, 129035},
+    {129040, 129095},
+    {129104, 129113},
+    {129120, 129159},
+    {129168, 129197},
+    {129280, 129291},
+    {129296, 129342},
+    {129344, 129392},
+    {129395, 129398},
+    {129402, 129402},
+    {129404, 129442},
+    {129456, 129465},
+    {129472, 129474},
+    {129488, 129535},
+    {129632, 129645},
+};
+static const URange16 So_range16[] = {
+    {166, 166},
+    {169, 169},
+    {174, 174},
+    {176, 176},
+    {1154, 1154},
+    {1421, 1422},
+    {1550, 1551},
+    {1758, 1758},
+    {1769, 1769},
+    {1789, 1790},
+    {2038, 2038},
+    {2554, 2554},
+    {2928, 2928},
+    {3059, 3064},
+    {3066, 3066},
+    {3199, 3199},
+    {3407, 3407},
+    {3449, 3449},
+    {3841, 3843},
+    {3859, 3859},
+    {3861, 3863},
+    {3866, 3871},
+    {3892, 3892},
+    {3894, 3894},
+    {3896, 3896},
+    {4030, 4037},
+    {4039, 4044},
+    {4046, 4047},
+    {4053, 4056},
+    {4254, 4255},
+    {5008, 5017},
+    {6464, 6464},
+    {6622, 6655},
+    {7009, 7018},
+    {7028, 7036},
+    {8448, 8449},
+    {8451, 8454},
+    {8456, 8457},
+    {8468, 8468},
+    {8470, 8471},
+    {8478, 8483},
+    {8485, 8485},
+    {8487, 8487},
+    {8489, 8489},
+    {8494, 8494},
+    {8506, 8507},
+    {8522, 8522},
+    {8524, 8525},
+    {8527, 8527},
+    {8586, 8587},
+    {8597, 8601},
+    {8604, 8607},
+    {8609, 8610},
+    {8612, 8613},
+    {8615, 8621},
+    {8623, 8653},
+    {8656, 8657},
+    {8659, 8659},
+    {8661, 8691},
+    {8960, 8967},
+    {8972, 8991},
+    {8994, 9000},
+    {9003, 9083},
+    {9085, 9114},
+    {9140, 9179},
+    {9186, 9254},
+    {9280, 9290},
+    {9372, 9449},
+    {9472, 9654},
+    {9656, 9664},
+    {9666, 9719},
+    {9728, 9838},
+    {9840, 10087},
+    {10132, 10175},
+    {10240, 10495},
+    {11008, 11055},
+    {11077, 11078},
+    {11085, 11123},
+    {11126, 11157},
+    {11160, 11208},
+    {11210, 11262},
+    {11493, 11498},
+    {11904, 11929},
+    {11931, 12019},
+    {12032, 12245},
+    {12272, 12283},
+    {12292, 12292},
+    {12306, 12307},
+    {12320, 12320},
+    {12342, 12343},
+    {12350, 12351},
+    {12688, 12689},
+    {12694, 12703},
+    {12736, 12771},
+    {12800, 12830},
+    {12842, 12871},
+    {12880, 12880},
+    {12896, 12927},
+    {12938, 12976},
+    {12992, 13054},
+    {13056, 13311},
+    {19904, 19967},
+    {42128, 42182},
+    {43048, 43051},
+    {43062, 43063},
+    {43065, 43065},
+    {43639, 43641},
+    {65021, 65021},
+    {65508, 65508},
+    {65512, 65512},
+    {65517, 65518},
+    {65532, 65533},
+};
+static const URange32 So_range32[] = {
+    {65847, 65855},
+    {65913, 65929},
+    {65932, 65934},
+    {65936, 65947},
+    {65952, 65952},
+    {66000, 66044},
+    {67703, 67704},
+    {68296, 68296},
+    {71487, 71487},
+    {92988, 92991},
+    {92997, 92997},
+    {113820, 113820},
+    {118784, 119029},
+    {119040, 119078},
+    {119081, 119140},
+    {119146, 119148},
+    {119171, 119172},
+    {119180, 119209},
+    {119214, 119272},
+    {119296, 119361},
+    {119365, 119365},
+    {119552, 119638},
+    {120832, 121343},
+    {121399, 121402},
+    {121453, 121460},
+    {121462, 121475},
+    {121477, 121478},
+    {126124, 126124},
+    {126976, 127019},
+    {127024, 127123},
+    {127136, 127150},
+    {127153, 127167},
+    {127169, 127183},
+    {127185, 127221},
+    {127248, 127339},
+    {127344, 127404},
+    {127462, 127490},
+    {127504, 127547},
+    {127552, 127560},
+    {127568, 127569},
+    {127584, 127589},
+    {127744, 127994},
+    {128000, 128724},
+    {128736, 128748},
+    {128752, 128761},
+    {128768, 128883},
+    {128896, 128984},
+    {129024, 129035},
+    {129040, 129095},
+    {129104, 129113},
+    {129120, 129159},
+    {129168, 129197},
+    {129280, 129291},
+    {129296, 129342},
+    {129344, 129392},
+    {129395, 129398},
+    {129402, 129402},
+    {129404, 129442},
+    {129456, 129465},
+    {129472, 129474},
+    {129488, 129535},
+    {129632, 129645},
+};
+static const URange16 Sm_range16[] = {
+    {43, 43},
+    {60, 62},
+    {124, 124},
+    {126, 126},
+    {172, 172},
+    {177, 177},
+    {215, 215},
+    {247, 247},
+    {1014, 1014},
+    {1542, 1544},
+    {8260, 8260},
+    {8274, 8274},
+    {8314, 8316},
+    {8330, 8332},
+    {8472, 8472},
+    {8512, 8516},
+    {8523, 8523},
+    {8592, 8596},
+    {8602, 8603},
+    {8608, 8608},
+    {8611, 8611},
+    {8614, 8614},
+    {8622, 8622},
+    {8654, 8655},
+    {8658, 8658},
+    {8660, 8660},
+    {8692, 8959},
+    {8992, 8993},
+    {9084, 9084},
+    {9115, 9139},
+    {9180, 9185},
+    {9655, 9655},
+    {9665, 9665},
+    {9720, 9727},
+    {9839, 9839},
+    {10176, 10180},
+    {10183, 10213},
+    {10224, 10239},
+    {10496, 10626},
+    {10649, 10711},
+    {10716, 10747},
+    {10750, 11007},
+    {11056, 11076},
+    {11079, 11084},
+    {64297, 64297},
+    {65122, 65122},
+    {65124, 65126},
+    {65291, 65291},
+    {65308, 65310},
+    {65372, 65372},
+    {65374, 65374},
+    {65506, 65506},
+    {65513, 65516},
+};
+static const URange32 Sm_range32[] = {
+    {120513, 120513},
+    {120539, 120539},
+    {120571, 120571},
+    {120597, 120597},
+    {120629, 120629},
+    {120655, 120655},
+    {120687, 120687},
+    {120713, 120713},
+    {120745, 120745},
+    {120771, 120771},
+    {126704, 126705},
+};
+static const URange16 Sc_range16[] = {
+    {36, 36},
+    {162, 165},
+    {1423, 1423},
+    {1547, 1547},
+    {2046, 2047},
+    {2546, 2547},
+    {2555, 2555},
+    {2801, 2801},
+    {3065, 3065},
+    {3647, 3647},
+    {6107, 6107},
+    {8352, 8383},
+    {43064, 43064},
+    {65020, 65020},
+    {65129, 65129},
+    {65284, 65284},
+    {65504, 65505},
+    {65509, 65510},
+};
+static const URange32 Sc_range32[] = {
+    {126128, 126128},
+};
+static const URange16 Z_range16[] = {
+    {32, 32},
+    {160, 160},
+    {5760, 5760},
+    {8192, 8202},
+    {8232, 8233},
+    {8239, 8239},
+    {8287, 8287},
+    {12288, 12288},
+};
+static const URange16 Zl_range16[] = {
+    {8232, 8232},
+};
+static const URange16 Co_range16[] = {
+    {57344, 63743},
+};
+static const URange32 Co_range32[] = {
+    {983040, 1048573},
+    {1048576, 1114109},
+};
+static const URange16 Cc_range16[] = {
+    {0, 31},
+    {127, 159},
+};
+static const URange16 Cf_range16[] = {
+    {173, 173},
+    {1536, 1541},
+    {1564, 1564},
+    {1757, 1757},
+    {1807, 1807},
+    {2274, 2274},
+    {6158, 6158},
+    {8203, 8207},
+    {8234, 8238},
+    {8288, 8292},
+    {8294, 8303},
+    {65279, 65279},
+    {65529, 65531},
+};
+static const URange32 Cf_range32[] = {
+    {69821, 69821},
+    {69837, 69837},
+    {113824, 113827},
+    {119155, 119162},
+    {917505, 917505},
+    {917536, 917631},
+};
+static const URange16 Cs_range16[] = {
+    {55296, 57343},
+};
+static const URange16 Zp_range16[] = {
+    {8233, 8233},
+};
+static const URange16 Zs_range16[] = {
+    {32, 32},
+    {160, 160},
+    {5760, 5760},
+    {8192, 8202},
+    {8239, 8239},
+    {8287, 8287},
+    {12288, 12288},
+};
+static const URange32 Tangut_range32[] = {
+    {94176, 94176},
+    {94208, 100337},
+    {100352, 101106},
+};
+static const URange16 Thaana_range16[] = {
+    {1920, 1969},
+};
+static const URange32 Adlam_range32[] = {
+    {125184, 125258},
+    {125264, 125273},
+    {125278, 125279},
+};
+static const URange16 Telugu_range16[] = {
+    {3072, 3084},
+    {3086, 3088},
+    {3090, 3112},
+    {3114, 3129},
+    {3133, 3140},
+    {3142, 3144},
+    {3146, 3149},
+    {3157, 3158},
+    {3160, 3162},
+    {3168, 3171},
+    {3174, 3183},
+    {3192, 3199},
+};
+static const URange16 Cyrillic_range16[] = {
+    {1024, 1156},
+    {1159, 1327},
+    {7296, 7304},
+    {7467, 7467},
+    {7544, 7544},
+    {11744, 11775},
+    {42560, 42655},
+    {65070, 65071},
+};
+static const URange32 Zanabazar_Square_range32[] = {
+    {72192, 72263},
+};
+static const URange16 Hangul_range16[] = {
+    {4352, 4607},
+    {12334, 12335},
+    {12593, 12686},
+    {12800, 12830},
+    {12896, 12926},
+    {43360, 43388},
+    {44032, 55203},
+    {55216, 55238},
+    {55243, 55291},
+    {65440, 65470},
+    {65474, 65479},
+    {65482, 65487},
+    {65490, 65495},
+    {65498, 65500},
+};
+static const URange32 Old_South_Arabian_range32[] = {
+    {68192, 68223},
+};
+static const URange16 Ethiopic_range16[] = {
+    {4608, 4680},
+    {4682, 4685},
+    {4688, 4694},
+    {4696, 4696},
+    {4698, 4701},
+    {4704, 4744},
+    {4746, 4749},
+    {4752, 4784},
+    {4786, 4789},
+    {4792, 4798},
+    {4800, 4800},
+    {4802, 4805},
+    {4808, 4822},
+    {4824, 4880},
+    {4882, 4885},
+    {4888, 4954},
+    {4957, 4988},
+    {4992, 5017},
+    {11648, 11670},
+    {11680, 11686},
+    {11688, 11694},
+    {11696, 11702},
+    {11704, 11710},
+    {11712, 11718},
+    {11720, 11726},
+    {11728, 11734},
+    {11736, 11742},
+    {43777, 43782},
+    {43785, 43790},
+    {43793, 43798},
+    {43808, 43814},
+    {43816, 43822},
+};
+static const URange16 Inherited_range16[] = {
+    {768, 879},
+    {1157, 1158},
+    {1611, 1621},
+    {1648, 1648},
+    {2385, 2386},
+    {6832, 6846},
+    {7376, 7378},
+    {7380, 7392},
+    {7394, 7400},
+    {7405, 7405},
+    {7412, 7412},
+    {7416, 7417},
+    {7616, 7673},
+    {7675, 7679},
+    {8204, 8205},
+    {8400, 8432},
+    {12330, 12333},
+    {12441, 12442},
+    {65024, 65039},
+    {65056, 65069},
+};
+static const URange32 Inherited_range32[] = {
+    {66045, 66045},
+    {66272, 66272},
+    {70459, 70459},
+    {119143, 119145},
+    {119163, 119170},
+    {119173, 119179},
+    {119210, 119213},
+    {917760, 917999},
+};
+static const URange32 Meroitic_Cursive_range32[] = {
+    {68000, 68023},
+    {68028, 68047},
+    {68050, 68095},
+};
+static const URange32 Bhaiksuki_range32[] = {
+    {72704, 72712},
+    {72714, 72758},
+    {72760, 72773},
+    {72784, 72812},
+};
+static const URange32 Ahom_range32[] = {
+    {71424, 71450},
+    {71453, 71467},
+    {71472, 71487},
+};
+static const URange16 Han_range16[] = {
+    {11904, 11929},
+    {11931, 12019},
+    {12032, 12245},
+    {12293, 12293},
+    {12295, 12295},
+    {12321, 12329},
+    {12344, 12347},
+    {13312, 19893},
+    {19968, 40943},
+    {63744, 64109},
+    {64112, 64217},
+};
+static const URange32 Han_range32[] = {
+    {131072, 173782},
+    {173824, 177972},
+    {177984, 178205},
+    {178208, 183969},
+    {183984, 191456},
+    {194560, 195101},
+};
+static const URange32 Old_North_Arabian_range32[] = {
+    {68224, 68255},
+};
+static const URange16 Armenian_range16[] = {
+    {1329, 1366},
+    {1369, 1416},
+    {1418, 1418},
+    {1421, 1423},
+    {64275, 64279},
+};
+static const URange16 Tamil_range16[] = {
+    {2946, 2947},
+    {2949, 2954},
+    {2958, 2960},
+    {2962, 2965},
+    {2969, 2970},
+    {2972, 2972},
+    {2974, 2975},
+    {2979, 2980},
+    {2984, 2986},
+    {2990, 3001},
+    {3006, 3010},
+    {3014, 3016},
+    {3018, 3021},
+    {3024, 3024},
+    {3031, 3031},
+    {3046, 3066},
+};
+static const URange16 Bopomofo_range16[] = {
+    {746, 747},
+    {12549, 12591},
+    {12704, 12730},
+};
+static const URange32 Bassa_Vah_range32[] = {
+    {92880, 92909},
+    {92912, 92917},
+};
+static const URange16 Sundanese_range16[] = {
+    {7040, 7103},
+    {7360, 7367},
+};
+static const URange32 Osage_range32[] = {
+    {66736, 66771},
+    {66776, 66811},
+};
+static const URange32 Old_Sogdian_range32[] = {
+    {69376, 69415},
+};
+static const URange16 Tagalog_range16[] = {
+    {5888, 5900},
+    {5902, 5908},
+};
+static const URange16 Malayalam_range16[] = {
+    {3328, 3331},
+    {3333, 3340},
+    {3342, 3344},
+    {3346, 3396},
+    {3398, 3400},
+    {3402, 3407},
+    {3412, 3427},
+    {3430, 3455},
+};
+static const URange32 Marchen_range32[] = {
+    {72816, 72847},
+    {72850, 72871},
+    {72873, 72886},
+};
+static const URange32 Carian_range32[] = {
+    {66208, 66256},
+};
+static const URange16 Hiragana_range16[] = {
+    {12353, 12438},
+    {12445, 12447},
+};
+static const URange32 Hiragana_range32[] = {
+    {110593, 110878},
+    {127488, 127488},
+};
+static const URange16 Tagbanwa_range16[] = {
+    {5984, 5996},
+    {5998, 6000},
+    {6002, 6003},
+};
+static const URange16 Meetei_Mayek_range16[] = {
+    {43744, 43766},
+    {43968, 44013},
+    {44016, 44025},
+};
+static const URange32 Hanifi_Rohingya_range32[] = {
+    {68864, 68903},
+    {68912, 68921},
+};
+static const URange32 Pahawh_Hmong_range32[] = {
+    {92928, 92997},
+    {93008, 93017},
+    {93019, 93025},
+    {93027, 93047},
+    {93053, 93071},
+};
+static const URange16 Tai_Le_range16[] = {
+    {6480, 6509},
+    {6512, 6516},
+};
+static const URange16 Kayah_Li_range16[] = {
+    {43264, 43309},
+    {43311, 43311},
+};
+static const URange16 Buginese_range16[] = {
+    {6656, 6683},
+    {6686, 6687},
+};
+static const URange32 Kharoshthi_range32[] = {
+    {68096, 68099},
+    {68101, 68102},
+    {68108, 68115},
+    {68117, 68119},
+    {68121, 68149},
+    {68152, 68154},
+    {68159, 68168},
+    {68176, 68184},
+};
+static const URange16 Tai_Tham_range16[] = {
+    {6688, 6750},
+    {6752, 6780},
+    {6783, 6793},
+    {6800, 6809},
+    {6816, 6829},
+};
+static const URange32 Old_Italic_range32[] = {
+    {66304, 66339},
+    {66349, 66351},
+};
+static const URange32 Old_Persian_range32[] = {
+    {66464, 66499},
+    {66504, 66517},
+};
+static const URange32 Warang_Citi_range32[] = {
+    {71840, 71922},
+    {71935, 71935},
+};
+static const URange16 Latin_range16[] = {
+    {65, 90},
+    {97, 122},
+    {170, 170},
+    {186, 186},
+    {192, 214},
+    {216, 246},
+    {248, 696},
+    {736, 740},
+    {7424, 7461},
+    {7468, 7516},
+    {7522, 7525},
+    {7531, 7543},
+    {7545, 7614},
+    {7680, 7935},
+    {8305, 8305},
+    {8319, 8319},
+    {8336, 8348},
+    {8490, 8491},
+    {8498, 8498},
+    {8526, 8526},
+    {8544, 8584},
+    {11360, 11391},
+    {42786, 42887},
+    {42891, 42937},
+    {42999, 43007},
+    {43824, 43866},
+    {43868, 43876},
+    {64256, 64262},
+    {65313, 65338},
+    {65345, 65370},
+};
+static const URange16 Saurashtra_range16[] = {
+    {43136, 43205},
+    {43214, 43225},
+};
+static const URange32 Shavian_range32[] = {
+    {66640, 66687},
+};
+static const URange16 Georgian_range16[] = {
+    {4256, 4293},
+    {4295, 4295},
+    {4301, 4301},
+    {4304, 4346},
+    {4348, 4351},
+    {7312, 7354},
+    {7357, 7359},
+    {11520, 11557},
+    {11559, 11559},
+    {11565, 11565},
+};
+static const URange32 Grantha_range32[] = {
+    {70400, 70403},
+    {70405, 70412},
+    {70415, 70416},
+    {70419, 70440},
+    {70442, 70448},
+    {70450, 70451},
+    {70453, 70457},
+    {70460, 70468},
+    {70471, 70472},
+    {70475, 70477},
+    {70480, 70480},
+    {70487, 70487},
+    {70493, 70499},
+    {70502, 70508},
+    {70512, 70516},
+};
+static const URange32 Duployan_range32[] = {
+    {113664, 113770},
+    {113776, 113788},
+    {113792, 113800},
+    {113808, 113817},
+    {113820, 113823},
+};
+static const URange16 Batak_range16[] = {
+    {7104, 7155},
+    {7164, 7167},
+};
+static const URange16 Devanagari_range16[] = {
+    {2304, 2384},
+    {2387, 2403},
+    {2406, 2431},
+    {43232, 43263},
+};
+static const URange16 Thai_range16[] = {
+    {3585, 3642},
+    {3648, 3675},
+};
+static const URange16 Tibetan_range16[] = {
+    {3840, 3911},
+    {3913, 3948},
+    {3953, 3991},
+    {3993, 4028},
+    {4030, 4044},
+    {4046, 4052},
+    {4057, 4058},
+};
+static const URange16 Tifinagh_range16[] = {
+    {11568, 11623},
+    {11631, 11632},
+    {11647, 11647},
+};
+static const URange32 Ugaritic_range32[] = {
+    {66432, 66461},
+    {66463, 66463},
+};
+static const URange16 Braille_range16[] = {
+    {10240, 10495},
+};
+static const URange32 Anatolian_Hieroglyphs_range32[] = {
+    {82944, 83526},
+};
+static const URange16 Greek_range16[] = {
+    {880, 883},
+    {885, 887},
+    {890, 893},
+    {895, 895},
+    {900, 900},
+    {902, 902},
+    {904, 906},
+    {908, 908},
+    {910, 929},
+    {931, 993},
+    {1008, 1023},
+    {7462, 7466},
+    {7517, 7521},
+    {7526, 7530},
+    {7615, 7615},
+    {7936, 7957},
+    {7960, 7965},
+    {7968, 8005},
+    {8008, 8013},
+    {8016, 8023},
+    {8025, 8025},
+    {8027, 8027},
+    {8029, 8029},
+    {8031, 8061},
+    {8064, 8116},
+    {8118, 8132},
+    {8134, 8147},
+    {8150, 8155},
+    {8157, 8175},
+    {8178, 8180},
+    {8182, 8190},
+    {8486, 8486},
+    {43877, 43877},
+};
+static const URange32 Greek_range32[] = {
+    {65856, 65934},
+    {65952, 65952},
+    {119296, 119365},
+};
+static const URange32 Lycian_range32[] = {
+    {66176, 66204},
+};
+static const URange32 Mende_Kikakui_range32[] = {
+    {124928, 125124},
+    {125127, 125142},
+};
+static const URange16 Tai_Viet_range16[] = {
+    {43648, 43714},
+    {43739, 43743},
+};
+static const URange16 Vai_range16[] = {
+    {42240, 42539},
+};
+static const URange16 Ogham_range16[] = {
+    {5760, 5788},
+};
+static const URange32 Inscriptional_Parthian_range32[] = {
+    {68416, 68437},
+    {68440, 68447},
+};
+static const URange16 Cham_range16[] = {
+    {43520, 43574},
+    {43584, 43597},
+    {43600, 43609},
+    {43612, 43615},
+};
+static const URange16 Syriac_range16[] = {
+    {1792, 1805},
+    {1807, 1866},
+    {1869, 1871},
+    {2144, 2154},
+};
+static const URange16 Runic_range16[] = {
+    {5792, 5866},
+    {5870, 5880},
+};
+static const URange32 Gothic_range32[] = {
+    {66352, 66378},
+};
+static const URange32 Mahajani_range32[] = {
+    {69968, 70006},
+};
+static const URange16 Katakana_range16[] = {
+    {12449, 12538},
+    {12541, 12543},
+    {12784, 12799},
+    {13008, 13054},
+    {13056, 13143},
+    {65382, 65391},
+    {65393, 65437},
+};
+static const URange32 Katakana_range32[] = {
+    {110592, 110592},
+};
+static const URange32 Osmanya_range32[] = {
+    {66688, 66717},
+    {66720, 66729},
+};
+static const URange16 New_Tai_Lue_range16[] = {
+    {6528, 6571},
+    {6576, 6601},
+    {6608, 6618},
+    {6622, 6623},
+};
+static const URange16 Ol_Chiki_range16[] = {
+    {7248, 7295},
+};
+static const URange32 Newa_range32[] = {
+    {70656, 70745},
+    {70747, 70747},
+    {70749, 70750},
+};
+static const URange16 Limbu_range16[] = {
+    {6400, 6430},
+    {6432, 6443},
+    {6448, 6459},
+    {6464, 6464},
+    {6468, 6479},
+};
+static const URange32 Pau_Cin_Hau_range32[] = {
+    {72384, 72440},
+};
+static const URange16 Cherokee_range16[] = {
+    {5024, 5109},
+    {5112, 5117},
+    {43888, 43967},
+};
+static const URange32 Miao_range32[] = {
+    {93952, 94020},
+    {94032, 94078},
+    {94095, 94111},
+};
+static const URange16 Oriya_range16[] = {
+    {2817, 2819},
+    {2821, 2828},
+    {2831, 2832},
+    {2835, 2856},
+    {2858, 2864},
+    {2866, 2867},
+    {2869, 2873},
+    {2876, 2884},
+    {2887, 2888},
+    {2891, 2893},
+    {2902, 2903},
+    {2908, 2909},
+    {2911, 2915},
+    {2918, 2935},
+};
+static const URange32 Medefaidrin_range32[] = {
+    {93760, 93850},
+};
+static const URange32 Sharada_range32[] = {
+    {70016, 70093},
+    {70096, 70111},
+};
+static const URange16 Gujarati_range16[] = {
+    {2689, 2691},
+    {2693, 2701},
+    {2703, 2705},
+    {2707, 2728},
+    {2730, 2736},
+    {2738, 2739},
+    {2741, 2745},
+    {2748, 2757},
+    {2759, 2761},
+    {2763, 2765},
+    {2768, 2768},
+    {2784, 2787},
+    {2790, 2801},
+    {2809, 2815},
+};
+static const URange32 Nushu_range32[] = {
+    {94177, 94177},
+    {110960, 111355},
+};
+static const URange32 Modi_range32[] = {
+    {71168, 71236},
+    {71248, 71257},
+};
+static const URange32 Gunjala_Gondi_range32[] = {
+    {73056, 73061},
+    {73063, 73064},
+    {73066, 73102},
+    {73104, 73105},
+    {73107, 73112},
+    {73120, 73129},
+};
+static const URange32 Inscriptional_Pahlavi_range32[] = {
+    {68448, 68466},
+    {68472, 68479},
+};
+static const URange32 Manichaean_range32[] = {
+    {68288, 68326},
+    {68331, 68342},
+};
+static const URange16 Khmer_range16[] = {
+    {6016, 6109},
+    {6112, 6121},
+    {6128, 6137},
+    {6624, 6655},
+};
+static const URange32 Cuneiform_range32[] = {
+    {73728, 74649},
+    {74752, 74862},
+    {74864, 74868},
+    {74880, 75075},
+};
+static const URange32 Khudawadi_range32[] = {
+    {70320, 70378},
+    {70384, 70393},
+};
+static const URange16 Mandaic_range16[] = {
+    {2112, 2139},
+    {2142, 2142},
+};
+static const URange32 Hatran_range32[] = {
+    {67808, 67826},
+    {67828, 67829},
+    {67835, 67839},
+};
+static const URange16 Syloti_Nagri_range16[] = {
+    {43008, 43051},
+};
+static const URange16 Nko_range16[] = {
+    {1984, 2042},
+    {2045, 2047},
+};
+static const URange16 Canadian_Aboriginal_range16[] = {
+    {5120, 5759},
+    {6320, 6389},
+};
+static const URange32 Meroitic_Hieroglyphs_range32[] = {
+    {67968, 67999},
+};
+static const URange32 Phoenician_range32[] = {
+    {67840, 67867},
+    {67871, 67871},
+};
+static const URange32 Nabataean_range32[] = {
+    {67712, 67742},
+    {67751, 67759},
+};
+static const URange16 Bengali_range16[] = {
+    {2432, 2435},
+    {2437, 2444},
+    {2447, 2448},
+    {2451, 2472},
+    {2474, 2480},
+    {2482, 2482},
+    {2486, 2489},
+    {2492, 2500},
+    {2503, 2504},
+    {2507, 2510},
+    {2519, 2519},
+    {2524, 2525},
+    {2527, 2531},
+    {2534, 2558},
+};
+static const URange32 Kaithi_range32[] = {
+    {69760, 69825},
+    {69837, 69837},
+};
+static const URange16 Glagolitic_range16[] = {
+    {11264, 11310},
+    {11312, 11358},
+};
+static const URange32 Glagolitic_range32[] = {
+    {122880, 122886},
+    {122888, 122904},
+    {122907, 122913},
+    {122915, 122916},
+    {122918, 122922},
+};
+static const URange32 Imperial_Aramaic_range32[] = {
+    {67648, 67669},
+    {67671, 67679},
+};
+static const URange32 Sora_Sompeng_range32[] = {
+    {69840, 69864},
+    {69872, 69881},
+};
+static const URange16 Gurmukhi_range16[] = {
+    {2561, 2563},
+    {2565, 2570},
+    {2575, 2576},
+    {2579, 2600},
+    {2602, 2608},
+    {2610, 2611},
+    {2613, 2614},
+    {2616, 2617},
+    {2620, 2620},
+    {2622, 2626},
+    {2631, 2632},
+    {2635, 2637},
+    {2641, 2641},
+    {2649, 2652},
+    {2654, 2654},
+    {2662, 2678},
+};
+static const URange16 Javanese_range16[] = {
+    {43392, 43469},
+    {43472, 43481},
+    {43486, 43487},
+};
+static const URange32 Old_Permic_range32[] = {
+    {66384, 66426},
+};
+static const URange16 Phags_Pa_range16[] = {
+    {43072, 43127},
+};
+static const URange32 Cypriot_range32[] = {
+    {67584, 67589},
+    {67592, 67592},
+    {67594, 67637},
+    {67639, 67640},
+    {67644, 67644},
+    {67647, 67647},
+};
+static const URange16 Kannada_range16[] = {
+    {3200, 3212},
+    {3214, 3216},
+    {3218, 3240},
+    {3242, 3251},
+    {3253, 3257},
+    {3260, 3268},
+    {3270, 3272},
+    {3274, 3277},
+    {3285, 3286},
+    {3294, 3294},
+    {3296, 3299},
+    {3302, 3311},
+    {3313, 3314},
+};
+static const URange32 Khojki_range32[] = {
+    {70144, 70161},
+    {70163, 70206},
+};
+static const URange16 Mongolian_range16[] = {
+    {6144, 6145},
+    {6148, 6148},
+    {6150, 6158},
+    {6160, 6169},
+    {6176, 6264},
+    {6272, 6314},
+};
+static const URange32 Mongolian_range32[] = {
+    {71264, 71276},
+};
+static const URange16 Sinhala_range16[] = {
+    {3458, 3459},
+    {3461, 3478},
+    {3482, 3505},
+    {3507, 3515},
+    {3517, 3517},
+    {3520, 3526},
+    {3530, 3530},
+    {3535, 3540},
+    {3542, 3542},
+    {3544, 3551},
+    {3558, 3567},
+    {3570, 3572},
+};
+static const URange32 Sinhala_range32[] = {
+    {70113, 70132},
+};
+static const URange32 Brahmi_range32[] = {
+    {69632, 69709},
+    {69714, 69743},
+    {69759, 69759},
+};
+static const URange32 Elbasan_range32[] = {
+    {66816, 66855},
+};
+static const URange32 Deseret_range32[] = {
+    {66560, 66639},
+};
+static const URange16 Rejang_range16[] = {
+    {43312, 43347},
+    {43359, 43359},
+};
+static const URange32 SignWriting_range32[] = {
+    {120832, 121483},
+    {121499, 121503},
+    {121505, 121519},
+};
+static const URange32 Multani_range32[] = {
+    {70272, 70278},
+    {70280, 70280},
+    {70282, 70285},
+    {70287, 70301},
+    {70303, 70313},
+};
+static const URange16 Yi_range16[] = {
+    {40960, 42124},
+    {42128, 42182},
+};
+static const URange16 Balinese_range16[] = {
+    {6912, 6987},
+    {6992, 7036},
+};
+static const URange16 Lao_range16[] = {
+    {3713, 3714},
+    {3716, 3716},
+    {3719, 3720},
+    {3722, 3722},
+    {3725, 3725},
+    {3732, 3735},
+    {3737, 3743},
+    {3745, 3747},
+    {3749, 3749},
+    {3751, 3751},
+    {3754, 3755},
+    {3757, 3769},
+    {3771, 3773},
+    {3776, 3780},
+    {3782, 3782},
+    {3784, 3789},
+    {3792, 3801},
+    {3804, 3807},
+};
+static const URange16 Hanunoo_range16[] = {
+    {5920, 5940},
+};
+static const URange32 Masaram_Gondi_range32[] = {
+    {72960, 72966},
+    {72968, 72969},
+    {72971, 73014},
+    {73018, 73018},
+    {73020, 73021},
+    {73023, 73031},
+    {73040, 73049},
+};
+static const URange32 Linear_B_range32[] = {
+    {65536, 65547},
+    {65549, 65574},
+    {65576, 65594},
+    {65596, 65597},
+    {65599, 65613},
+    {65616, 65629},
+    {65664, 65786},
+};
+static const URange32 Linear_A_range32[] = {
+    {67072, 67382},
+    {67392, 67413},
+    {67424, 67431},
+};
+static const URange32 Dogra_range32[] = {
+    {71680, 71739},
+};
+static const URange32 Old_Turkic_range32[] = {
+    {68608, 68680},
+};
+static const URange16 Lepcha_range16[] = {
+    {7168, 7223},
+    {7227, 7241},
+    {7245, 7247},
+};
+static const URange32 Lydian_range32[] = {
+    {67872, 67897},
+    {67903, 67903},
+};
+static const URange32 Egyptian_Hieroglyphs_range32[] = {
+    {77824, 78894},
+};
+static const URange32 Sogdian_range32[] = {
+    {69424, 69465},
+};
+static const URange32 Caucasian_Albanian_range32[] = {
+    {66864, 66915},
+    {66927, 66927},
+};
+static const URange32 Makasar_range32[] = {
+    {73440, 73464},
+};
+static const URange32 Old_Hungarian_range32[] = {
+    {68736, 68786},
+    {68800, 68850},
+    {68858, 68863},
+};
+static const URange16 Samaritan_range16[] = {
+    {2048, 2093},
+    {2096, 2110},
+};
+static const URange16 Lisu_range16[] = {
+    {42192, 42239},
+};
+static const URange16 Buhid_range16[] = {
+    {5952, 5971},
+};
+static const URange32 Palmyrene_range32[] = {
+    {67680, 67711},
+};
+static const URange32 Tirhuta_range32[] = {
+    {70784, 70855},
+    {70864, 70873},
+};
+static const URange32 Mro_range32[] = {
+    {92736, 92766},
+    {92768, 92777},
+    {92782, 92783},
+};
+static const URange16 Common_range16[] = {
+    {0, 64},
+    {91, 96},
+    {123, 169},
+    {171, 185},
+    {187, 191},
+    {215, 215},
+    {247, 247},
+    {697, 735},
+    {741, 745},
+    {748, 767},
+    {884, 884},
+    {894, 894},
+    {901, 901},
+    {903, 903},
+    {1417, 1417},
+    {1541, 1541},
+    {1548, 1548},
+    {1563, 1563},
+    {1567, 1567},
+    {1600, 1600},
+    {1757, 1757},
+    {2274, 2274},
+    {2404, 2405},
+    {3647, 3647},
+    {4053, 4056},
+    {4347, 4347},
+    {5867, 5869},
+    {5941, 5942},
+    {6146, 6147},
+    {6149, 6149},
+    {7379, 7379},
+    {7393, 7393},
+    {7401, 7404},
+    {7406, 7411},
+    {7413, 7415},
+    {8192, 8203},
+    {8206, 8292},
+    {8294, 8304},
+    {8308, 8318},
+    {8320, 8334},
+    {8352, 8383},
+    {8448, 8485},
+    {8487, 8489},
+    {8492, 8497},
+    {8499, 8525},
+    {8527, 8543},
+    {8585, 8587},
+    {8592, 9254},
+    {9280, 9290},
+    {9312, 10239},
+    {10496, 11123},
+    {11126, 11157},
+    {11160, 11208},
+    {11210, 11262},
+    {11776, 11854},
+    {12272, 12283},
+    {12288, 12292},
+    {12294, 12294},
+    {12296, 12320},
+    {12336, 12343},
+    {12348, 12351},
+    {12443, 12444},
+    {12448, 12448},
+    {12539, 12540},
+    {12688, 12703},
+    {12736, 12771},
+    {12832, 12895},
+    {12927, 13007},
+    {13144, 13311},
+    {19904, 19967},
+    {42752, 42785},
+    {42888, 42890},
+    {43056, 43065},
+    {43310, 43310},
+    {43471, 43471},
+    {43867, 43867},
+    {64830, 64831},
+    {65040, 65049},
+    {65072, 65106},
+    {65108, 65126},
+    {65128, 65131},
+    {65279, 65279},
+    {65281, 65312},
+    {65339, 65344},
+    {65371, 65381},
+    {65392, 65392},
+    {65438, 65439},
+    {65504, 65510},
+    {65512, 65518},
+    {65529, 65533},
+};
+static const URange32 Common_range32[] = {
+    {65792, 65794},
+    {65799, 65843},
+    {65847, 65855},
+    {65936, 65947},
+    {66000, 66044},
+    {66273, 66299},
+    {113824, 113827},
+    {118784, 119029},
+    {119040, 119078},
+    {119081, 119142},
+    {119146, 119162},
+    {119171, 119172},
+    {119180, 119209},
+    {119214, 119272},
+    {119520, 119539},
+    {119552, 119638},
+    {119648, 119672},
+    {119808, 119892},
+    {119894, 119964},
+    {119966, 119967},
+    {119970, 119970},
+    {119973, 119974},
+    {119977, 119980},
+    {119982, 119993},
+    {119995, 119995},
+    {119997, 120003},
+    {120005, 120069},
+    {120071, 120074},
+    {120077, 120084},
+    {120086, 120092},
+    {120094, 120121},
+    {120123, 120126},
+    {120128, 120132},
+    {120134, 120134},
+    {120138, 120144},
+    {120146, 120485},
+    {120488, 120779},
+    {120782, 120831},
+    {126065, 126132},
+    {126976, 127019},
+    {127024, 127123},
+    {127136, 127150},
+    {127153, 127167},
+    {127169, 127183},
+    {127185, 127221},
+    {127232, 127244},
+    {127248, 127339},
+    {127344, 127404},
+    {127462, 127487},
+    {127489, 127490},
+    {127504, 127547},
+    {127552, 127560},
+    {127568, 127569},
+    {127584, 127589},
+    {127744, 128724},
+    {128736, 128748},
+    {128752, 128761},
+    {128768, 128883},
+    {128896, 128984},
+    {129024, 129035},
+    {129040, 129095},
+    {129104, 129113},
+    {129120, 129159},
+    {129168, 129197},
+    {129280, 129291},
+    {129296, 129342},
+    {129344, 129392},
+    {129395, 129398},
+    {129402, 129402},
+    {129404, 129442},
+    {129456, 129465},
+    {129472, 129474},
+    {129488, 129535},
+    {129632, 129645},
+    {917505, 917505},
+    {917536, 917631},
+};
+static const URange16 Coptic_range16[] = {
+    {994, 1007},
+    {11392, 11507},
+    {11513, 11519},
+};
+static const URange32 Chakma_range32[] = {
+    {69888, 69940},
+    {69942, 69958},
+};
+static const URange16 Arabic_range16[] = {
+    {1536, 1540},
+    {1542, 1547},
+    {1549, 1562},
+    {1564, 1564},
+    {1566, 1566},
+    {1568, 1599},
+    {1601, 1610},
+    {1622, 1647},
+    {1649, 1756},
+    {1758, 1791},
+    {1872, 1919},
+    {2208, 2228},
+    {2230, 2237},
+    {2259, 2273},
+    {2275, 2303},
+    {64336, 64449},
+    {64467, 64829},
+    {64848, 64911},
+    {64914, 64967},
+    {65008, 65021},
+    {65136, 65140},
+    {65142, 65276},
+};
+static const URange32 Arabic_range32[] = {
+    {69216, 69246},
+    {126464, 126467},
+    {126469, 126495},
+    {126497, 126498},
+    {126500, 126500},
+    {126503, 126503},
+    {126505, 126514},
+    {126516, 126519},
+    {126521, 126521},
+    {126523, 126523},
+    {126530, 126530},
+    {126535, 126535},
+    {126537, 126537},
+    {126539, 126539},
+    {126541, 126543},
+    {126545, 126546},
+    {126548, 126548},
+    {126551, 126551},
+    {126553, 126553},
+    {126555, 126555},
+    {126557, 126557},
+    {126559, 126559},
+    {126561, 126562},
+    {126564, 126564},
+    {126567, 126570},
+    {126572, 126578},
+    {126580, 126583},
+    {126585, 126588},
+    {126590, 126590},
+    {126592, 126601},
+    {126603, 126619},
+    {126625, 126627},
+    {126629, 126633},
+    {126635, 126651},
+    {126704, 126705},
+};
+static const URange16 Bamum_range16[] = {
+    {42656, 42743},
+};
+static const URange32 Bamum_range32[] = {
+    {92160, 92728},
+};
+static const URange16 Myanmar_range16[] = {
+    {4096, 4255},
+    {43488, 43518},
+    {43616, 43647},
+};
+static const URange32 Siddham_range32[] = {
+    {71040, 71093},
+    {71096, 71133},
+};
+static const URange32 Soyombo_range32[] = {
+    {72272, 72323},
+    {72326, 72354},
+};
+static const URange32 Avestan_range32[] = {
+    {68352, 68405},
+    {68409, 68415},
+};
+static const URange16 Hebrew_range16[] = {
+    {1425, 1479},
+    {1488, 1514},
+    {1519, 1524},
+    {64285, 64310},
+    {64312, 64316},
+    {64318, 64318},
+    {64320, 64321},
+    {64323, 64324},
+    {64326, 64335},
+};
+static const URange32 Psalter_Pahlavi_range32[] = {
+    {68480, 68497},
+    {68505, 68508},
+    {68521, 68527},
+};
+static const URange32 Takri_range32[] = {
+    {71296, 71351},
+    {71360, 71369},
+};
+// 3994 16-bit ranges, 1429 32-bit ranges
+const UGroup unicode_groups[] = {
+    {"Adlam", +1, 0, 0, Adlam_range32, 3},
+    {"Ahom", +1, 0, 0, Ahom_range32, 3},
+    {"Anatolian_Hieroglyphs", +1, 0, 0, Anatolian_Hieroglyphs_range32, 1},
+    {"Arabic", +1, Arabic_range16, 22, Arabic_range32, 35},
+    {"Armenian", +1, Armenian_range16, 5, 0, 0},
+    {"Avestan", +1, 0, 0, Avestan_range32, 2},
+    {"Balinese", +1, Balinese_range16, 2, 0, 0},
+    {"Bamum", +1, Bamum_range16, 1, Bamum_range32, 1},
+    {"Bassa_Vah", +1, 0, 0, Bassa_Vah_range32, 2},
+    {"Batak", +1, Batak_range16, 2, 0, 0},
+    {"Bengali", +1, Bengali_range16, 14, 0, 0},
+    {"Bhaiksuki", +1, 0, 0, Bhaiksuki_range32, 4},
+    {"Bopomofo", +1, Bopomofo_range16, 3, 0, 0},
+    {"Brahmi", +1, 0, 0, Brahmi_range32, 3},
+    {"Braille", +1, Braille_range16, 1, 0, 0},
+    {"Buginese", +1, Buginese_range16, 2, 0, 0},
+    {"Buhid", +1, Buhid_range16, 1, 0, 0},
+    {"C", +1, C_range16, 16, C_range32, 8},
+    {"Canadian_Aboriginal", +1, Canadian_Aboriginal_range16, 2, 0, 0},
+    {"Carian", +1, 0, 0, Carian_range32, 1},
+    {"Caucasian_Albanian", +1, 0, 0, Caucasian_Albanian_range32, 2},
+    {"Cc", +1, Cc_range16, 2, 0, 0},
+    {"Cf", +1, Cf_range16, 13, Cf_range32, 6},
+    {"Chakma", +1, 0, 0, Chakma_range32, 2},
+    {"Cham", +1, Cham_range16, 4, 0, 0},
+    {"Cherokee", +1, Cherokee_range16, 3, 0, 0},
+    {"Co", +1, Co_range16, 1, Co_range32, 2},
+    {"Common", +1, Common_range16, 90, Common_range32, 76},
+    {"Coptic", +1, Coptic_range16, 3, 0, 0},
+    {"Cs", +1, Cs_range16, 1, 0, 0},
+    {"Cuneiform", +1, 0, 0, Cuneiform_range32, 4},
+    {"Cypriot", +1, 0, 0, Cypriot_range32, 6},
+    {"Cyrillic", +1, Cyrillic_range16, 8, 0, 0},
+    {"Deseret", +1, 0, 0, Deseret_range32, 1},
+    {"Devanagari", +1, Devanagari_range16, 4, 0, 0},
+    {"Dogra", +1, 0, 0, Dogra_range32, 1},
+    {"Duployan", +1, 0, 0, Duployan_range32, 5},
+    {"Egyptian_Hieroglyphs", +1, 0, 0, Egyptian_Hieroglyphs_range32, 1},
+    {"Elbasan", +1, 0, 0, Elbasan_range32, 1},
+    {"Ethiopic", +1, Ethiopic_range16, 32, 0, 0},
+    {"Georgian", +1, Georgian_range16, 10, 0, 0},
+    {"Glagolitic", +1, Glagolitic_range16, 2, Glagolitic_range32, 5},
+    {"Gothic", +1, 0, 0, Gothic_range32, 1},
+    {"Grantha", +1, 0, 0, Grantha_range32, 15},
+    {"Greek", +1, Greek_range16, 33, Greek_range32, 3},
+    {"Gujarati", +1, Gujarati_range16, 14, 0, 0},
+    {"Gunjala_Gondi", +1, 0, 0, Gunjala_Gondi_range32, 6},
+    {"Gurmukhi", +1, Gurmukhi_range16, 16, 0, 0},
+    {"Han", +1, Han_range16, 11, Han_range32, 6},
+    {"Hangul", +1, Hangul_range16, 14, 0, 0},
+    {"Hanifi_Rohingya", +1, 0, 0, Hanifi_Rohingya_range32, 2},
+    {"Hanunoo", +1, Hanunoo_range16, 1, 0, 0},
+    {"Hatran", +1, 0, 0, Hatran_range32, 3},
+    {"Hebrew", +1, Hebrew_range16, 9, 0, 0},
+    {"Hiragana", +1, Hiragana_range16, 2, Hiragana_range32, 2},
+    {"Imperial_Aramaic", +1, 0, 0, Imperial_Aramaic_range32, 2},
+    {"Inherited", +1, Inherited_range16, 20, Inherited_range32, 8},
+    {"Inscriptional_Pahlavi", +1, 0, 0, Inscriptional_Pahlavi_range32, 2},
+    {"Inscriptional_Parthian", +1, 0, 0, Inscriptional_Parthian_range32, 2},
+    {"Javanese", +1, Javanese_range16, 3, 0, 0},
+    {"Kaithi", +1, 0, 0, Kaithi_range32, 2},
+    {"Kannada", +1, Kannada_range16, 13, 0, 0},
+    {"Katakana", +1, Katakana_range16, 7, Katakana_range32, 1},
+    {"Kayah_Li", +1, Kayah_Li_range16, 2, 0, 0},
+    {"Kharoshthi", +1, 0, 0, Kharoshthi_range32, 8},
+    {"Khmer", +1, Khmer_range16, 4, 0, 0},
+    {"Khojki", +1, 0, 0, Khojki_range32, 2},
+    {"Khudawadi", +1, 0, 0, Khudawadi_range32, 2},
+    {"L", +1, L_range16, 384, L_range32, 215},
+    {"Lao", +1, Lao_range16, 18, 0, 0},
+    {"Latin", +1, Latin_range16, 30, 0, 0},
+    {"Lepcha", +1, Lepcha_range16, 3, 0, 0},
+    {"Limbu", +1, Limbu_range16, 5, 0, 0},
+    {"Linear_A", +1, 0, 0, Linear_A_range32, 3},
+    {"Linear_B", +1, 0, 0, Linear_B_range32, 7},
+    {"Lisu", +1, Lisu_range16, 1, 0, 0},
+    {"Ll", +1, Ll_range16, 604, Ll_range32, 34},
+    {"Lm", +1, Lm_range16, 54, Lm_range32, 3},
+    {"Lo", +1, Lo_range16, 295, Lo_range32, 175},
+    {"Lt", +1, Lt_range16, 10, 0, 0},
+    {"Lu", +1, Lu_range16, 594, Lu_range32, 37},
+    {"Lycian", +1, 0, 0, Lycian_range32, 1},
+    {"Lydian", +1, 0, 0, Lydian_range32, 2},
+    {"M", +1, M_range16, 187, M_range32, 88},
+    {"Mahajani", +1, 0, 0, Mahajani_range32, 1},
+    {"Makasar", +1, 0, 0, Makasar_range32, 1},
+    {"Malayalam", +1, Malayalam_range16, 8, 0, 0},
+    {"Mandaic", +1, Mandaic_range16, 2, 0, 0},
+    {"Manichaean", +1, 0, 0, Manichaean_range32, 2},
+    {"Marchen", +1, 0, 0, Marchen_range32, 3},
+    {"Masaram_Gondi", +1, 0, 0, Masaram_Gondi_range32, 7},
+    {"Mc", +1, Mc_range16, 110, Mc_range32, 56},
+    {"Me", +1, Me_range16, 5, 0, 0},
+    {"Medefaidrin", +1, 0, 0, Medefaidrin_range32, 1},
+    {"Meetei_Mayek", +1, Meetei_Mayek_range16, 3, 0, 0},
+    {"Mende_Kikakui", +1, 0, 0, Mende_Kikakui_range32, 2},
+    {"Meroitic_Cursive", +1, 0, 0, Meroitic_Cursive_range32, 3},
+    {"Meroitic_Hieroglyphs", +1, 0, 0, Meroitic_Hieroglyphs_range32, 1},
+    {"Miao", +1, 0, 0, Miao_range32, 3},
+    {"Mn", +1, Mn_range16, 208, Mn_range32, 105},
+    {"Modi", +1, 0, 0, Modi_range32, 2},
+    {"Mongolian", +1, Mongolian_range16, 6, Mongolian_range32, 1},
+    {"Mro", +1, 0, 0, Mro_range32, 3},
+    {"Multani", +1, 0, 0, Multani_range32, 5},
+    {"Myanmar", +1, Myanmar_range16, 3, 0, 0},
+    {"N", +1, N_range16, 67, N_range32, 58},
+    {"Nabataean", +1, 0, 0, Nabataean_range32, 2},
+    {"Nd", +1, Nd_range16, 37, Nd_range32, 20},
+    {"New_Tai_Lue", +1, New_Tai_Lue_range16, 4, 0, 0},
+    {"Newa", +1, 0, 0, Newa_range32, 3},
+    {"Nko", +1, Nko_range16, 2, 0, 0},
+    {"Nl", +1, Nl_range16, 7, Nl_range32, 5},
+    {"No", +1, No_range16, 29, No_range32, 38},
+    {"Nushu", +1, 0, 0, Nushu_range32, 2},
+    {"Ogham", +1, Ogham_range16, 1, 0, 0},
+    {"Ol_Chiki", +1, Ol_Chiki_range16, 1, 0, 0},
+    {"Old_Hungarian", +1, 0, 0, Old_Hungarian_range32, 3},
+    {"Old_Italic", +1, 0, 0, Old_Italic_range32, 2},
+    {"Old_North_Arabian", +1, 0, 0, Old_North_Arabian_range32, 1},
+    {"Old_Permic", +1, 0, 0, Old_Permic_range32, 1},
+    {"Old_Persian", +1, 0, 0, Old_Persian_range32, 2},
+    {"Old_Sogdian", +1, 0, 0, Old_Sogdian_range32, 1},
+    {"Old_South_Arabian", +1, 0, 0, Old_South_Arabian_range32, 1},
+    {"Old_Turkic", +1, 0, 0, Old_Turkic_range32, 1},
+    {"Oriya", +1, Oriya_range16, 14, 0, 0},
+    {"Osage", +1, 0, 0, Osage_range32, 2},
+    {"Osmanya", +1, 0, 0, Osmanya_range32, 2},
+    {"P", +1, P_range16, 130, P_range32, 48},
+    {"Pahawh_Hmong", +1, 0, 0, Pahawh_Hmong_range32, 5},
+    {"Palmyrene", +1, 0, 0, Palmyrene_range32, 1},
+    {"Pau_Cin_Hau", +1, 0, 0, Pau_Cin_Hau_range32, 1},
+    {"Pc", +1, Pc_range16, 6, 0, 0},
+    {"Pd", +1, Pd_range16, 17, 0, 0},
+    {"Pe", +1, Pe_range16, 72, 0, 0},
+    {"Pf", +1, Pf_range16, 10, 0, 0},
+    {"Phags_Pa", +1, Phags_Pa_range16, 1, 0, 0},
+    {"Phoenician", +1, 0, 0, Phoenician_range32, 2},
+    {"Pi", +1, Pi_range16, 11, 0, 0},
+    {"Po", +1, Po_range16, 127, Po_range32, 48},
+    {"Ps", +1, Ps_range16, 75, 0, 0},
+    {"Psalter_Pahlavi", +1, 0, 0, Psalter_Pahlavi_range32, 3},
+    {"Rejang", +1, Rejang_range16, 2, 0, 0},
+    {"Runic", +1, Runic_range16, 2, 0, 0},
+    {"S", +1, S_range16, 147, S_range32, 73},
+    {"Samaritan", +1, Samaritan_range16, 2, 0, 0},
+    {"Saurashtra", +1, Saurashtra_range16, 2, 0, 0},
+    {"Sc", +1, Sc_range16, 18, Sc_range32, 1},
+    {"Sharada", +1, 0, 0, Sharada_range32, 2},
+    {"Shavian", +1, 0, 0, Shavian_range32, 1},
+    {"Siddham", +1, 0, 0, Siddham_range32, 2},
+    {"SignWriting", +1, 0, 0, SignWriting_range32, 3},
+    {"Sinhala", +1, Sinhala_range16, 12, Sinhala_range32, 1},
+    {"Sk", +1, Sk_range16, 28, Sk_range32, 1},
+    {"Sm", +1, Sm_range16, 53, Sm_range32, 11},
+    {"So", +1, So_range16, 112, So_range32, 62},
+    {"Sogdian", +1, 0, 0, Sogdian_range32, 1},
+    {"Sora_Sompeng", +1, 0, 0, Sora_Sompeng_range32, 2},
+    {"Soyombo", +1, 0, 0, Soyombo_range32, 2},
+    {"Sundanese", +1, Sundanese_range16, 2, 0, 0},
+    {"Syloti_Nagri", +1, Syloti_Nagri_range16, 1, 0, 0},
+    {"Syriac", +1, Syriac_range16, 4, 0, 0},
+    {"Tagalog", +1, Tagalog_range16, 2, 0, 0},
+    {"Tagbanwa", +1, Tagbanwa_range16, 3, 0, 0},
+    {"Tai_Le", +1, Tai_Le_range16, 2, 0, 0},
+    {"Tai_Tham", +1, Tai_Tham_range16, 5, 0, 0},
+    {"Tai_Viet", +1, Tai_Viet_range16, 2, 0, 0},
+    {"Takri", +1, 0, 0, Takri_range32, 2},
+    {"Tamil", +1, Tamil_range16, 16, 0, 0},
+    {"Tangut", +1, 0, 0, Tangut_range32, 3},
+    {"Telugu", +1, Telugu_range16, 12, 0, 0},
+    {"Thaana", +1, Thaana_range16, 1, 0, 0},
+    {"Thai", +1, Thai_range16, 2, 0, 0},
+    {"Tibetan", +1, Tibetan_range16, 7, 0, 0},
+    {"Tifinagh", +1, Tifinagh_range16, 3, 0, 0},
+    {"Tirhuta", +1, 0, 0, Tirhuta_range32, 2},
+    {"Ugaritic", +1, 0, 0, Ugaritic_range32, 2},
+    {"Vai", +1, Vai_range16, 1, 0, 0},
+    {"Warang_Citi", +1, 0, 0, Warang_Citi_range32, 2},
+    {"Yi", +1, Yi_range16, 2, 0, 0},
+    {"Z", +1, Z_range16, 8, 0, 0},
+    {"Zanabazar_Square", +1, 0, 0, Zanabazar_Square_range32, 1},
+    {"Zl", +1, Zl_range16, 1, 0, 0},
+    {"Zp", +1, Zp_range16, 1, 0, 0},
+    {"Zs", +1, Zs_range16, 7, 0, 0},
+};
+const int num_unicode_groups = 184;
+
+} // namespace regex
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/CMakeLists.txt
new file mode 100644
index 0000000000..91d24c9878
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/CMakeLists.txt
@@ -0,0 +1,9 @@
+if (POLICY CMP0063)
+    cmake_policy(SET CMP0063 NEW)
+endif ()
+
+add_library(roaring_bitmap STATIC roaring.c)
+
+target_include_directories(
+        roaring_bitmap
+        PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/roaring.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/roaring.c
new file mode 100644
index 0000000000..f037c1cdff
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/roaring.c
@@ -0,0 +1,26017 @@
+// !!! DO NOT EDIT - THIS IS AN AUTO-GENERATED FILE !!!
+// Created by amalgamation.sh on 2024-09-21T13:18:57Z
+
+/*
+ * The CRoaring project is under a dual license (Apache/MIT).
+ * Users of the library may choose one or the other license.
+ */
+/*
+ * Copyright 2016-2022 The CRoaring authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *    http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ *
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/*
+ * MIT License
+ *
+ * Copyright 2016-2022 The CRoaring authors
+ *
+ * Permission is hereby granted, free of charge, to any
+ * person obtaining a copy of this software and associated
+ * documentation files (the "Software"), to deal in the
+ * Software without restriction, including without
+ * limitation the rights to use, copy, modify, merge,
+ * publish, distribute, sublicense, and/or sell copies of
+ * the Software, and to permit persons to whom the Software
+ * is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice
+ * shall be included in all copies or substantial portions
+ * of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ * ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+ * TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+ * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+ * SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+ * IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+ * DEALINGS IN THE SOFTWARE.
+ *
+ * SPDX-License-Identifier: MIT
+ */
+
+#include "roaring.h"
+
+/* used for http://dmalloc.com/ Dmalloc - Debug Malloc Library */
+#ifdef DMALLOC
+#include "dmalloc.h"
+#endif
+
+#include "roaring.h"  /* include public API definitions */
+/* begin file include/roaring/isadetection.h */
+#ifndef ROARING_ISADETECTION_H
+#define ROARING_ISADETECTION_H
+#if defined(__x86_64__) || defined(_M_AMD64)  // x64
+
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#ifdef __has_include
+// We want to make sure that the AVX-512 functions are only built on compilers
+// fully supporting AVX-512.
+#if __has_include(<avx512vbmi2intrin.h>)
+#define CROARING_COMPILER_SUPPORTS_AVX512 1
+#endif  // #if __has_include(<avx512vbmi2intrin.h>)
+#endif  // #ifdef __has_include
+
+// Visual Studio 2019 and up support AVX-512
+#ifdef _MSC_VER
+#if _MSC_VER >= 1920
+#define CROARING_COMPILER_SUPPORTS_AVX512 1
+#endif  // #if _MSC_VER >= 1920
+#endif  // #ifdef _MSC_VER
+
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#define CROARING_COMPILER_SUPPORTS_AVX512 0
+#endif  // #ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#endif  // #ifndef CROARING_COMPILER_SUPPORTS_AVX512
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+enum {
+    ROARING_SUPPORTS_AVX2 = 1,
+    ROARING_SUPPORTS_AVX512 = 2,
+};
+int croaring_hardware_support(void);
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+#endif  // x64
+#endif  // ROARING_ISADETECTION_H
+/* end file include/roaring/isadetection.h */
+/* begin file include/roaring/containers/perfparameters.h */
+#ifndef PERFPARAMETERS_H_
+#define PERFPARAMETERS_H_
+
+#include <stdbool.h>
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/**
+During lazy computations, we can transform array containers into bitset
+containers as
+long as we can expect them to have  ARRAY_LAZY_LOWERBOUND values.
+*/
+enum { ARRAY_LAZY_LOWERBOUND = 1024 };
+
+/* default initial size of a run container
+   setting it to zero delays the malloc.*/
+enum { RUN_DEFAULT_INIT_SIZE = 0 };
+
+/* default initial size of an array container
+   setting it to zero delays the malloc */
+enum { ARRAY_DEFAULT_INIT_SIZE = 0 };
+
+/* automatic bitset conversion during lazy or */
+#ifndef LAZY_OR_BITSET_CONVERSION
+#define LAZY_OR_BITSET_CONVERSION true
+#endif
+
+/* automatically attempt to convert a bitset to a full run during lazy
+ * evaluation */
+#ifndef LAZY_OR_BITSET_CONVERSION_TO_FULL
+#define LAZY_OR_BITSET_CONVERSION_TO_FULL true
+#endif
+
+/* automatically attempt to convert a bitset to a full run */
+#ifndef OR_BITSET_CONVERSION_TO_FULL
+#define OR_BITSET_CONVERSION_TO_FULL true
+#endif
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif
+/* end file include/roaring/containers/perfparameters.h */
+/* begin file include/roaring/containers/container_defs.h */
+/*
+ * container_defs.h
+ *
+ * Unlike containers.h (which is a file aggregating all the container includes,
+ * like array.h, bitset.h, and run.h) this is a file included BY those headers
+ * to do things like define the container base class `container_t`.
+ */
+
+#ifndef INCLUDE_CONTAINERS_CONTAINER_DEFS_H_
+#define INCLUDE_CONTAINERS_CONTAINER_DEFS_H_
+
+#ifdef __cplusplus
+#include <type_traits>  // used by casting helper for compile-time check
+#endif
+
+// The preferences are a separate file to separate out tweakable parameters
+
+#ifdef __cplusplus
+namespace roaring {
+namespace internal {  // No extern "C" (contains template)
+#endif
+
+/*
+ * Since roaring_array_t's definition is not opaque, the container type is
+ * part of the API.  If it's not going to be `void*` then it needs a name, and
+ * expectations are to prefix C library-exported names with `roaring_` etc.
+ *
+ * Rather than force the whole codebase to use the name `roaring_container_t`,
+ * the few API appearances use the macro ROARING_CONTAINER_T.  Those includes
+ * are prior to containers.h, so make a short private alias of `container_t`.
+ * Then undefine the awkward macro so it's not used any more than it has to be.
+ */
+typedef ROARING_CONTAINER_T container_t;
+#undef ROARING_CONTAINER_T
+
+/*
+ * See ROARING_CONTAINER_T for notes on using container_t as a base class.
+ * This macro helps make the following pattern look nicer:
+ *
+ *     #ifdef __cplusplus
+ *     struct roaring_array_s : public container_t {
+ *     #else
+ *     struct roaring_array_s {
+ *     #endif
+ *         int32_t cardinality;
+ *         int32_t capacity;
+ *         uint16_t *array;
+ *     }
+ */
+#if defined(__cplusplus)
+#define STRUCT_CONTAINER(name) struct name : public container_t /* { ... } */
+#else
+#define STRUCT_CONTAINER(name) struct name /* { ... } */
+#endif
+
+/**
+ * Since container_t* is not void* in C++, "dangerous" casts are not needed to
+ * downcast; only a static_cast<> is needed.  Define a macro for static casting
+ * which helps make casts more visible, and catches problems at compile-time
+ * when building the C sources in C++ mode:
+ *
+ *     void some_func(container_t **c, ...) {  // double pointer, not single
+ *         array_container_t *ac1 = (array_container_t *)(c);  // uncaught!!
+ *
+ *         array_container_t *ac2 = CAST(array_container_t *, c)  // C++ errors
+ *         array_container_t *ac3 = CAST_array(c);  // shorthand for #2, errors
+ *     }
+ *
+ * Trickier to do is a cast from `container**` to `array_container_t**`.  This
+ * needs a reinterpret_cast<>, which sacrifices safety...so a template is used
+ * leveraging <type_traits> to make sure it's legal in the C++ build.
+ */
+#ifdef __cplusplus
+#define CAST(type, value) static_cast<type>(value)
+#define movable_CAST(type, value) movable_CAST_HELPER<type>(value)
+
+template <typename PPDerived, typename Base>
+PPDerived movable_CAST_HELPER(Base **ptr_to_ptr) {
+    typedef typename std::remove_pointer<PPDerived>::type PDerived;
+    typedef typename std::remove_pointer<PDerived>::type Derived;
+    static_assert(std::is_base_of<Base, Derived>::value,
+        "use movable_CAST() for container_t** => xxx_container_t**");
+    return reinterpret_cast<Derived **>(ptr_to_ptr);
+}
+#else
+#define CAST(type, value) ((type)value)
+#define movable_CAST(type, value) ((type)value)
+#endif
+
+// Use for converting e.g. an `array_container_t**` to a `container_t**`
+//
+#define movable_CAST_base(c) movable_CAST(container_t **, c)
+
+#ifdef __cplusplus
+}
+}  // namespace roaring { namespace internal {
+#endif
+
+#endif /* INCLUDE_CONTAINERS_CONTAINER_DEFS_H_ */
+/* end file include/roaring/containers/container_defs.h */
+/* begin file include/roaring/array_util.h */
+#ifndef CROARING_ARRAY_UTIL_H
+#define CROARING_ARRAY_UTIL_H
+
+#include <stddef.h>  // for size_t
+#include <stdint.h>
+
+
+#if CROARING_IS_X64
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#error "CROARING_COMPILER_SUPPORTS_AVX512 needs to be defined."
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wuninitialized"
+#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
+#endif
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/*
+ *  Good old binary search.
+ *  Assumes that array is sorted, has logarithmic complexity.
+ *  if the result is x, then:
+ *     if ( x>0 )  you have array[x] = ikey
+ *     if ( x<0 ) then inserting ikey at position -x-1 in array (insuring that
+ * array[-x-1]=ikey) keys the array sorted.
+ */
+inline int32_t binarySearch(const uint16_t *array, int32_t lenarray,
+    uint16_t ikey) {
+    int32_t low = 0;
+    int32_t high = lenarray - 1;
+    while (low <= high) {
+        int32_t middleIndex = (low + high) >> 1;
+        uint16_t middleValue = array[middleIndex];
+        if (middleValue < ikey) {
+            low = middleIndex + 1;
+        } else if (middleValue > ikey) {
+            high = middleIndex - 1;
+        } else {
+            return middleIndex;
+        }
+    }
+    return -(low + 1);
+}
+
+/**
+ * Galloping search
+ * Assumes that array is sorted, has logarithmic complexity.
+ * if the result is x, then if x = length, you have that all values in array
+ * between pos and length are smaller than min. otherwise returns the first
+ * index x such that array[x] >= min.
+ */
+static inline int32_t advanceUntil(const uint16_t *array, int32_t pos,
+    int32_t length, uint16_t min) {
+    int32_t lower = pos + 1;
+
+    if ((lower >= length) || (array[lower] >= min)) {
+        return lower;
+    }
+
+    int32_t spansize = 1;
+
+    while ((lower + spansize < length) && (array[lower + spansize] < min)) {
+        spansize <<= 1;
+    }
+    int32_t upper = (lower + spansize < length) ? lower + spansize : length - 1;
+
+    if (array[upper] == min) {
+        return upper;
+    }
+    if (array[upper] < min) {
+        // means
+        // array
+        // has no
+        // item
+        // >= min
+        // pos = array.length;
+        return length;
+    }
+
+    // we know that the next-smallest span was too small
+    lower += (spansize >> 1);
+
+    int32_t mid = 0;
+    while (lower + 1 != upper) {
+        mid = (lower + upper) >> 1;
+        if (array[mid] == min) {
+            return mid;
+        } else if (array[mid] < min) {
+            lower = mid;
+        } else {
+            upper = mid;
+        }
+    }
+    return upper;
+}
+
+/**
+ * Returns number of elements which are less than ikey.
+ * Array elements must be unique and sorted.
+ */
+static inline int32_t count_less(const uint16_t *array, int32_t lenarray,
+    uint16_t ikey) {
+    if (lenarray == 0) return 0;
+    int32_t pos = binarySearch(array, lenarray, ikey);
+    return pos >= 0 ? pos : -(pos + 1);
+}
+
+/**
+ * Returns number of elements which are greater than ikey.
+ * Array elements must be unique and sorted.
+ */
+static inline int32_t count_greater(const uint16_t *array, int32_t lenarray,
+    uint16_t ikey) {
+    if (lenarray == 0) return 0;
+    int32_t pos = binarySearch(array, lenarray, ikey);
+    if (pos >= 0) {
+        return lenarray - (pos + 1);
+    } else {
+        return lenarray - (-pos - 1);
+    }
+}
+
+/**
+ * From Schlegel et al., Fast Sorted-Set Intersection using SIMD Instructions
+ * Optimized by D. Lemire on May 3rd 2013
+ *
+ * C should have capacity greater than the minimum of s_1 and s_b + 8
+ * where 8 is sizeof(__m128i)/sizeof(uint16_t).
+ */
+int32_t intersect_vector16(const uint16_t *__restrict__ A, size_t s_a,
+    const uint16_t *__restrict__ B, size_t s_b,
+    uint16_t *C);
+
+int32_t intersect_vector16_inplace(uint16_t *__restrict__ A, size_t s_a,
+    const uint16_t *__restrict__ B, size_t s_b);
+
+/**
+ * Take an array container and write it out to a 32-bit array, using base
+ * as the offset.
+ */
+int array_container_to_uint32_array_vector16(void *vout, const uint16_t *array,
+    size_t cardinality, uint32_t base);
+#if CROARING_COMPILER_SUPPORTS_AVX512
+int avx512_array_container_to_uint32_array(void *vout, const uint16_t *array,
+    size_t cardinality, uint32_t base);
+#endif
+/**
+ * Compute the cardinality of the intersection using SSE4 instructions
+ */
+int32_t intersect_vector16_cardinality(const uint16_t *__restrict__ A,
+    size_t s_a,
+    const uint16_t *__restrict__ B,
+    size_t s_b);
+
+/* Computes the intersection between one small and one large set of uint16_t.
+ * Stores the result into buffer and return the number of elements. */
+int32_t intersect_skewed_uint16(const uint16_t *smallarray, size_t size_s,
+    const uint16_t *largearray, size_t size_l,
+    uint16_t *buffer);
+
+/* Computes the size of the intersection between one small and one large set of
+ * uint16_t. */
+int32_t intersect_skewed_uint16_cardinality(const uint16_t *smallarray,
+    size_t size_s,
+    const uint16_t *largearray,
+    size_t size_l);
+
+/* Check whether the size of the intersection between one small and one large
+ * set of uint16_t is non-zero. */
+bool intersect_skewed_uint16_nonempty(const uint16_t *smallarray, size_t size_s,
+    const uint16_t *largearray,
+    size_t size_l);
+/**
+ * Generic intersection function.
+ */
+int32_t intersect_uint16(const uint16_t *A, const size_t lenA,
+    const uint16_t *B, const size_t lenB, uint16_t *out);
+/**
+ * Compute the size of the intersection (generic).
+ */
+int32_t intersect_uint16_cardinality(const uint16_t *A, const size_t lenA,
+    const uint16_t *B, const size_t lenB);
+
+/**
+ * Checking whether the size of the intersection  is non-zero.
+ */
+bool intersect_uint16_nonempty(const uint16_t *A, const size_t lenA,
+    const uint16_t *B, const size_t lenB);
+/**
+ * Generic union function.
+ */
+size_t union_uint16(const uint16_t *set_1, size_t size_1, const uint16_t *set_2,
+    size_t size_2, uint16_t *buffer);
+
+/**
+ * Generic XOR function.
+ */
+int32_t xor_uint16(const uint16_t *array_1, int32_t card_1,
+    const uint16_t *array_2, int32_t card_2, uint16_t *out);
+
+/**
+ * Generic difference function (ANDNOT).
+ */
+int difference_uint16(const uint16_t *a1, int length1, const uint16_t *a2,
+    int length2, uint16_t *a_out);
+
+/**
+ * Generic intersection function.
+ */
+size_t intersection_uint32(const uint32_t *A, const size_t lenA,
+    const uint32_t *B, const size_t lenB, uint32_t *out);
+
+/**
+ * Generic intersection function, returns just the cardinality.
+ */
+size_t intersection_uint32_card(const uint32_t *A, const size_t lenA,
+    const uint32_t *B, const size_t lenB);
+
+/**
+ * Generic union function.
+ */
+size_t union_uint32(const uint32_t *set_1, size_t size_1, const uint32_t *set_2,
+    size_t size_2, uint32_t *buffer);
+
+/**
+ * A fast SSE-based union function.
+ */
+uint32_t union_vector16(const uint16_t *__restrict__ set_1, uint32_t size_1,
+    const uint16_t *__restrict__ set_2, uint32_t size_2,
+    uint16_t *__restrict__ buffer);
+/**
+ * A fast SSE-based XOR function.
+ */
+uint32_t xor_vector16(const uint16_t *__restrict__ array1, uint32_t length1,
+    const uint16_t *__restrict__ array2, uint32_t length2,
+    uint16_t *__restrict__ output);
+
+/**
+ * A fast SSE-based difference function.
+ */
+int32_t difference_vector16(const uint16_t *__restrict__ A, size_t s_a,
+    const uint16_t *__restrict__ B, size_t s_b,
+    uint16_t *C);
+
+/**
+ * Generic union function, returns just the cardinality.
+ */
+size_t union_uint32_card(const uint32_t *set_1, size_t size_1,
+    const uint32_t *set_2, size_t size_2);
+
+/**
+ * combines union_uint16 and  union_vector16 optimally
+ */
+size_t fast_union_uint16(const uint16_t *set_1, size_t size_1,
+    const uint16_t *set_2, size_t size_2,
+    uint16_t *buffer);
+
+bool memequals(const void *s1, const void *s2, size_t n);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic pop
+#endif
+#endif
+/* end file include/roaring/array_util.h */
+/* begin file include/roaring/utilasm.h */
+/*
+ * utilasm.h
+ *
+ */
+
+#ifndef INCLUDE_UTILASM_H_
+#define INCLUDE_UTILASM_H_
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+#endif
+
+#if defined(CROARING_INLINE_ASM)
+#define CROARING_ASMBITMANIPOPTIMIZATION  // optimization flag
+
+#define ASM_SHIFT_RIGHT(srcReg, bitsReg, destReg) \
+    __asm volatile("shrx %1, %2, %0"              \
+                   : "=r"(destReg)                \
+                   :             /* write */      \
+                   "r"(bitsReg), /* read only */  \
+                   "r"(srcReg)   /* read only */  \
+    )
+
+#define ASM_INPLACESHIFT_RIGHT(srcReg, bitsReg)  \
+    __asm volatile("shrx %1, %0, %0"             \
+                   : "+r"(srcReg)                \
+                   :            /* read/write */ \
+                   "r"(bitsReg) /* read only */  \
+    )
+
+#define ASM_SHIFT_LEFT(srcReg, bitsReg, destReg) \
+    __asm volatile("shlx %1, %2, %0"             \
+                   : "=r"(destReg)               \
+                   :             /* write */     \
+                   "r"(bitsReg), /* read only */ \
+                   "r"(srcReg)   /* read only */ \
+    )
+// set bit at position testBit within testByte to 1 and
+// copy cmovDst to cmovSrc if that bit was previously clear
+#define ASM_SET_BIT_INC_WAS_CLEAR(testByte, testBit, count) \
+    __asm volatile(                                         \
+        "bts %2, %0\n"                                      \
+        "sbb $-1, %1\n"                                     \
+        : "+r"(testByte), /* read/write */                  \
+          "+r"(count)                                       \
+        :            /* read/write */                       \
+        "r"(testBit) /* read only */                        \
+    )
+
+#define ASM_CLEAR_BIT_DEC_WAS_SET(testByte, testBit, count) \
+    __asm volatile(                                         \
+        "btr %2, %0\n"                                      \
+        "sbb $0, %1\n"                                      \
+        : "+r"(testByte), /* read/write */                  \
+          "+r"(count)                                       \
+        :            /* read/write */                       \
+        "r"(testBit) /* read only */                        \
+    )
+
+#define ASM_BT64(testByte, testBit, count) \
+    __asm volatile(                        \
+        "bt %2,%1\n"                       \
+        "sbb %0,%0" /*could use setb */    \
+        : "=r"(count)                      \
+        :              /* write */         \
+        "r"(testByte), /* read only */     \
+        "r"(testBit)   /* read only */     \
+    )
+
+#endif
+
+#ifdef __cplusplus
+}
+}  // extern "C" { namespace roaring {
+#endif
+
+#endif /* INCLUDE_UTILASM_H_ */
+/* end file include/roaring/utilasm.h */
+/* begin file include/roaring/bitset_util.h */
+#ifndef CROARING_BITSET_UTIL_H
+#define CROARING_BITSET_UTIL_H
+
+#include <stdint.h>
+
+
+#if CROARING_IS_X64
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#error "CROARING_COMPILER_SUPPORTS_AVX512 needs to be defined."
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wuninitialized"
+#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
+#endif
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/*
+ * Set all bits in indexes [begin,end) to true.
+ */
+static inline void bitset_set_range(uint64_t *words, uint32_t start,
+    uint32_t end) {
+    if (start == end) return;
+    uint32_t firstword = start / 64;
+    uint32_t endword = (end - 1) / 64;
+    if (firstword == endword) {
+        words[firstword] |= ((~UINT64_C(0)) << (start % 64)) &
+                            ((~UINT64_C(0)) >> ((~end + 1) % 64));
+        return;
+    }
+    words[firstword] |= (~UINT64_C(0)) << (start % 64);
+    for (uint32_t i = firstword + 1; i < endword; i++) {
+        words[i] = ~UINT64_C(0);
+    }
+    words[endword] |= (~UINT64_C(0)) >> ((~end + 1) % 64);
+}
+
+/*
+ * Find the cardinality of the bitset in [begin,begin+lenminusone]
+ */
+static inline int bitset_lenrange_cardinality(const uint64_t *words,
+    uint32_t start,
+    uint32_t lenminusone) {
+    uint32_t firstword = start / 64;
+    uint32_t endword = (start + lenminusone) / 64;
+    if (firstword == endword) {
+        return roaring_hamming(words[firstword] &
+                               ((~UINT64_C(0)) >> ((63 - lenminusone) % 64))
+                                   << (start % 64));
+    }
+    int answer =
+        roaring_hamming(words[firstword] & ((~UINT64_C(0)) << (start % 64)));
+    for (uint32_t i = firstword + 1; i < endword; i++) {
+        answer += roaring_hamming(words[i]);
+    }
+    answer += roaring_hamming(words[endword] &
+                              (~UINT64_C(0)) >>
+                                  (((~start + 1) - lenminusone - 1) % 64));
+    return answer;
+}
+
+/*
+ * Check whether the cardinality of the bitset in [begin,begin+lenminusone] is 0
+ */
+static inline bool bitset_lenrange_empty(const uint64_t *words, uint32_t start,
+    uint32_t lenminusone) {
+    uint32_t firstword = start / 64;
+    uint32_t endword = (start + lenminusone) / 64;
+    if (firstword == endword) {
+        return (words[firstword] & ((~UINT64_C(0)) >> ((63 - lenminusone) % 64))
+                                       << (start % 64)) == 0;
+    }
+    if (((words[firstword] & ((~UINT64_C(0)) << (start % 64)))) != 0) {
+        return false;
+    }
+    for (uint32_t i = firstword + 1; i < endword; i++) {
+        if (words[i] != 0) {
+            return false;
+        }
+    }
+    if ((words[endword] &
+            (~UINT64_C(0)) >> (((~start + 1) - lenminusone - 1) % 64)) != 0) {
+        return false;
+    }
+    return true;
+}
+
+/*
+ * Set all bits in indexes [begin,begin+lenminusone] to true.
+ */
+static inline void bitset_set_lenrange(uint64_t *words, uint32_t start,
+    uint32_t lenminusone) {
+    uint32_t firstword = start / 64;
+    uint32_t endword = (start + lenminusone) / 64;
+    if (firstword == endword) {
+        words[firstword] |= ((~UINT64_C(0)) >> ((63 - lenminusone) % 64))
+                            << (start % 64);
+        return;
+    }
+    uint64_t temp = words[endword];
+    words[firstword] |= (~UINT64_C(0)) << (start % 64);
+    for (uint32_t i = firstword + 1; i < endword; i += 2)
+        words[i] = words[i + 1] = ~UINT64_C(0);
+    words[endword] =
+        temp | (~UINT64_C(0)) >> (((~start + 1) - lenminusone - 1) % 64);
+}
+
+/*
+ * Flip all the bits in indexes [begin,end).
+ */
+static inline void bitset_flip_range(uint64_t *words, uint32_t start,
+    uint32_t end) {
+    if (start == end) return;
+    uint32_t firstword = start / 64;
+    uint32_t endword = (end - 1) / 64;
+    words[firstword] ^= ~((~UINT64_C(0)) << (start % 64));
+    for (uint32_t i = firstword; i < endword; i++) {
+        words[i] = ~words[i];
+    }
+    words[endword] ^= ((~UINT64_C(0)) >> ((~end + 1) % 64));
+}
+
+/*
+ * Set all bits in indexes [begin,end) to false.
+ */
+static inline void bitset_reset_range(uint64_t *words, uint32_t start,
+    uint32_t end) {
+    if (start == end) return;
+    uint32_t firstword = start / 64;
+    uint32_t endword = (end - 1) / 64;
+    if (firstword == endword) {
+        words[firstword] &= ~(((~UINT64_C(0)) << (start % 64)) &
+                              ((~UINT64_C(0)) >> ((~end + 1) % 64)));
+        return;
+    }
+    words[firstword] &= ~((~UINT64_C(0)) << (start % 64));
+    for (uint32_t i = firstword + 1; i < endword; i++) {
+        words[i] = UINT64_C(0);
+    }
+    words[endword] &= ~((~UINT64_C(0)) >> ((~end + 1) % 64));
+}
+
+/*
+ * Given a bitset containing "length" 64-bit words, write out the position
+ * of all the set bits to "out", values start at "base".
+ *
+ * The "out" pointer should be sufficient to store the actual number of bits
+ * set.
+ *
+ * Returns how many values were actually decoded.
+ *
+ * This function should only be expected to be faster than
+ * bitset_extract_setbits
+ * when the density of the bitset is high.
+ *
+ * This function uses AVX2 decoding.
+ */
+size_t bitset_extract_setbits_avx2(const uint64_t *words, size_t length,
+    uint32_t *out, size_t outcapacity,
+    uint32_t base);
+
+size_t bitset_extract_setbits_avx512(const uint64_t *words, size_t length,
+    uint32_t *out, size_t outcapacity,
+    uint32_t base);
+/*
+ * Given a bitset containing "length" 64-bit words, write out the position
+ * of all the set bits to "out", values start at "base".
+ *
+ * The "out" pointer should be sufficient to store the actual number of bits
+ *set.
+ *
+ * Returns how many values were actually decoded.
+ */
+size_t bitset_extract_setbits(const uint64_t *words, size_t length,
+    uint32_t *out, uint32_t base);
+
+/*
+ * Given a bitset containing "length" 64-bit words, write out the position
+ * of all the set bits to "out" as 16-bit integers, values start at "base" (can
+ *be set to zero)
+ *
+ * The "out" pointer should be sufficient to store the actual number of bits
+ *set.
+ *
+ * Returns how many values were actually decoded.
+ *
+ * This function should only be expected to be faster than
+ *bitset_extract_setbits_uint16
+ * when the density of the bitset is high.
+ *
+ * This function uses SSE decoding.
+ */
+size_t bitset_extract_setbits_sse_uint16(const uint64_t *words, size_t length,
+    uint16_t *out, size_t outcapacity,
+    uint16_t base);
+
+size_t bitset_extract_setbits_avx512_uint16(const uint64_t *words,
+    size_t length, uint16_t *out,
+    size_t outcapacity, uint16_t base);
+
+/*
+ * Given a bitset containing "length" 64-bit words, write out the position
+ * of all the set bits to "out",  values start at "base"
+ * (can be set to zero)
+ *
+ * The "out" pointer should be sufficient to store the actual number of bits
+ *set.
+ *
+ * Returns how many values were actually decoded.
+ */
+size_t bitset_extract_setbits_uint16(const uint64_t *words, size_t length,
+    uint16_t *out, uint16_t base);
+
+/*
+ * Given two bitsets containing "length" 64-bit words, write out the position
+ * of all the common set bits to "out", values start at "base"
+ * (can be set to zero)
+ *
+ * The "out" pointer should be sufficient to store the actual number of bits
+ * set.
+ *
+ * Returns how many values were actually decoded.
+ */
+size_t bitset_extract_intersection_setbits_uint16(
+    const uint64_t *__restrict__ words1, const uint64_t *__restrict__ words2,
+    size_t length, uint16_t *out, uint16_t base);
+
+/*
+ * Given a bitset having cardinality card, set all bit values in the list (there
+ * are length of them)
+ * and return the updated cardinality. This evidently assumes that the bitset
+ * already contained data.
+ */
+uint64_t bitset_set_list_withcard(uint64_t *words, uint64_t card,
+    const uint16_t *list, uint64_t length);
+/*
+ * Given a bitset, set all bit values in the list (there
+ * are length of them).
+ */
+void bitset_set_list(uint64_t *words, const uint16_t *list, uint64_t length);
+
+/*
+ * Given a bitset having cardinality card, unset all bit values in the list
+ * (there are length of them)
+ * and return the updated cardinality. This evidently assumes that the bitset
+ * already contained data.
+ */
+uint64_t bitset_clear_list(uint64_t *words, uint64_t card, const uint16_t *list,
+    uint64_t length);
+
+/*
+ * Given a bitset having cardinality card, toggle all bit values in the list
+ * (there are length of them)
+ * and return the updated cardinality. This evidently assumes that the bitset
+ * already contained data.
+ */
+
+uint64_t bitset_flip_list_withcard(uint64_t *words, uint64_t card,
+    const uint16_t *list, uint64_t length);
+
+void bitset_flip_list(uint64_t *words, const uint16_t *list, uint64_t length);
+
+#if CROARING_IS_X64
+/***
+ * BEGIN Harley-Seal popcount functions.
+ */
+CROARING_TARGET_AVX2
+/**
+ * Compute the population count of a 256-bit word
+ * This is not especially fast, but it is convenient as part of other functions.
+ */
+static inline __m256i popcount256(__m256i v) {
+    const __m256i lookuppos = _mm256_setr_epi8(
+        /* 0 */ 4 + 0, /* 1 */ 4 + 1, /* 2 */ 4 + 1, /* 3 */ 4 + 2,
+        /* 4 */ 4 + 1, /* 5 */ 4 + 2, /* 6 */ 4 + 2, /* 7 */ 4 + 3,
+        /* 8 */ 4 + 1, /* 9 */ 4 + 2, /* a */ 4 + 2, /* b */ 4 + 3,
+        /* c */ 4 + 2, /* d */ 4 + 3, /* e */ 4 + 3, /* f */ 4 + 4,
+
+        /* 0 */ 4 + 0, /* 1 */ 4 + 1, /* 2 */ 4 + 1, /* 3 */ 4 + 2,
+        /* 4 */ 4 + 1, /* 5 */ 4 + 2, /* 6 */ 4 + 2, /* 7 */ 4 + 3,
+        /* 8 */ 4 + 1, /* 9 */ 4 + 2, /* a */ 4 + 2, /* b */ 4 + 3,
+        /* c */ 4 + 2, /* d */ 4 + 3, /* e */ 4 + 3, /* f */ 4 + 4);
+    const __m256i lookupneg = _mm256_setr_epi8(
+        /* 0 */ 4 - 0, /* 1 */ 4 - 1, /* 2 */ 4 - 1, /* 3 */ 4 - 2,
+        /* 4 */ 4 - 1, /* 5 */ 4 - 2, /* 6 */ 4 - 2, /* 7 */ 4 - 3,
+        /* 8 */ 4 - 1, /* 9 */ 4 - 2, /* a */ 4 - 2, /* b */ 4 - 3,
+        /* c */ 4 - 2, /* d */ 4 - 3, /* e */ 4 - 3, /* f */ 4 - 4,
+
+        /* 0 */ 4 - 0, /* 1 */ 4 - 1, /* 2 */ 4 - 1, /* 3 */ 4 - 2,
+        /* 4 */ 4 - 1, /* 5 */ 4 - 2, /* 6 */ 4 - 2, /* 7 */ 4 - 3,
+        /* 8 */ 4 - 1, /* 9 */ 4 - 2, /* a */ 4 - 2, /* b */ 4 - 3,
+        /* c */ 4 - 2, /* d */ 4 - 3, /* e */ 4 - 3, /* f */ 4 - 4);
+    const __m256i low_mask = _mm256_set1_epi8(0x0f);
+
+    const __m256i lo = _mm256_and_si256(v, low_mask);
+    const __m256i hi = _mm256_and_si256(_mm256_srli_epi16(v, 4), low_mask);
+    const __m256i popcnt1 = _mm256_shuffle_epi8(lookuppos, lo);
+    const __m256i popcnt2 = _mm256_shuffle_epi8(lookupneg, hi);
+    return _mm256_sad_epu8(popcnt1, popcnt2);
+}
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+/**
+ * Simple CSA over 256 bits
+ */
+static inline void CSA(__m256i *h, __m256i *l, __m256i a, __m256i b,
+    __m256i c) {
+    const __m256i u = _mm256_xor_si256(a, b);
+    *h = _mm256_or_si256(_mm256_and_si256(a, b), _mm256_and_si256(u, c));
+    *l = _mm256_xor_si256(u, c);
+}
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+/**
+ * Fast Harley-Seal AVX population count function
+ */
+inline static uint64_t avx2_harley_seal_popcount256(const __m256i *data,
+    const uint64_t size) {
+    __m256i total = _mm256_setzero_si256();
+    __m256i ones = _mm256_setzero_si256();
+    __m256i twos = _mm256_setzero_si256();
+    __m256i fours = _mm256_setzero_si256();
+    __m256i eights = _mm256_setzero_si256();
+    __m256i sixteens = _mm256_setzero_si256();
+    __m256i twosA, twosB, foursA, foursB, eightsA, eightsB;
+
+    const uint64_t limit = size - size % 16;
+    uint64_t i = 0;
+
+    for (; i < limit; i += 16) {
+        CSA(&twosA, &ones, ones, _mm256_lddqu_si256(data + i),
+            _mm256_lddqu_si256(data + i + 1));
+        CSA(&twosB, &ones, ones, _mm256_lddqu_si256(data + i + 2),
+            _mm256_lddqu_si256(data + i + 3));
+        CSA(&foursA, &twos, twos, twosA, twosB);
+        CSA(&twosA, &ones, ones, _mm256_lddqu_si256(data + i + 4),
+            _mm256_lddqu_si256(data + i + 5));
+        CSA(&twosB, &ones, ones, _mm256_lddqu_si256(data + i + 6),
+            _mm256_lddqu_si256(data + i + 7));
+        CSA(&foursB, &twos, twos, twosA, twosB);
+        CSA(&eightsA, &fours, fours, foursA, foursB);
+        CSA(&twosA, &ones, ones, _mm256_lddqu_si256(data + i + 8),
+            _mm256_lddqu_si256(data + i + 9));
+        CSA(&twosB, &ones, ones, _mm256_lddqu_si256(data + i + 10),
+            _mm256_lddqu_si256(data + i + 11));
+        CSA(&foursA, &twos, twos, twosA, twosB);
+        CSA(&twosA, &ones, ones, _mm256_lddqu_si256(data + i + 12),
+            _mm256_lddqu_si256(data + i + 13));
+        CSA(&twosB, &ones, ones, _mm256_lddqu_si256(data + i + 14),
+            _mm256_lddqu_si256(data + i + 15));
+        CSA(&foursB, &twos, twos, twosA, twosB);
+        CSA(&eightsB, &fours, fours, foursA, foursB);
+        CSA(&sixteens, &eights, eights, eightsA, eightsB);
+
+        total = _mm256_add_epi64(total, popcount256(sixteens));
+    }
+
+    total = _mm256_slli_epi64(total, 4);  // * 16
+    total = _mm256_add_epi64(
+        total, _mm256_slli_epi64(popcount256(eights), 3));  // += 8 * ...
+    total = _mm256_add_epi64(
+        total, _mm256_slli_epi64(popcount256(fours), 2));  // += 4 * ...
+    total = _mm256_add_epi64(
+        total, _mm256_slli_epi64(popcount256(twos), 1));  // += 2 * ...
+    total = _mm256_add_epi64(total, popcount256(ones));
+    for (; i < size; i++)
+        total =
+            _mm256_add_epi64(total, popcount256(_mm256_lddqu_si256(data + i)));
+
+    return (uint64_t)(_mm256_extract_epi64(total, 0)) +
+           (uint64_t)(_mm256_extract_epi64(total, 1)) +
+           (uint64_t)(_mm256_extract_epi64(total, 2)) +
+           (uint64_t)(_mm256_extract_epi64(total, 3));
+}
+CROARING_UNTARGET_AVX2
+
+#define CROARING_AVXPOPCNTFNC(opname, avx_intrinsic)                           \
+    static inline uint64_t avx2_harley_seal_popcount256_##opname(              \
+        const __m256i *data1, const __m256i *data2, const uint64_t size) {     \
+        __m256i total = _mm256_setzero_si256();                                \
+        __m256i ones = _mm256_setzero_si256();                                 \
+        __m256i twos = _mm256_setzero_si256();                                 \
+        __m256i fours = _mm256_setzero_si256();                                \
+        __m256i eights = _mm256_setzero_si256();                               \
+        __m256i sixteens = _mm256_setzero_si256();                             \
+        __m256i twosA, twosB, foursA, foursB, eightsA, eightsB;                \
+        __m256i A1, A2;                                                        \
+        const uint64_t limit = size - size % 16;                               \
+        uint64_t i = 0;                                                        \
+        for (; i < limit; i += 16) {                                           \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i),                  \
+                               _mm256_lddqu_si256(data2 + i));                 \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 1),              \
+                               _mm256_lddqu_si256(data2 + i + 1));             \
+            CSA(&twosA, &ones, ones, A1, A2);                                  \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 2),              \
+                               _mm256_lddqu_si256(data2 + i + 2));             \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 3),              \
+                               _mm256_lddqu_si256(data2 + i + 3));             \
+            CSA(&twosB, &ones, ones, A1, A2);                                  \
+            CSA(&foursA, &twos, twos, twosA, twosB);                           \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 4),              \
+                               _mm256_lddqu_si256(data2 + i + 4));             \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 5),              \
+                               _mm256_lddqu_si256(data2 + i + 5));             \
+            CSA(&twosA, &ones, ones, A1, A2);                                  \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 6),              \
+                               _mm256_lddqu_si256(data2 + i + 6));             \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 7),              \
+                               _mm256_lddqu_si256(data2 + i + 7));             \
+            CSA(&twosB, &ones, ones, A1, A2);                                  \
+            CSA(&foursB, &twos, twos, twosA, twosB);                           \
+            CSA(&eightsA, &fours, fours, foursA, foursB);                      \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 8),              \
+                               _mm256_lddqu_si256(data2 + i + 8));             \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 9),              \
+                               _mm256_lddqu_si256(data2 + i + 9));             \
+            CSA(&twosA, &ones, ones, A1, A2);                                  \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 10),             \
+                               _mm256_lddqu_si256(data2 + i + 10));            \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 11),             \
+                               _mm256_lddqu_si256(data2 + i + 11));            \
+            CSA(&twosB, &ones, ones, A1, A2);                                  \
+            CSA(&foursA, &twos, twos, twosA, twosB);                           \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 12),             \
+                               _mm256_lddqu_si256(data2 + i + 12));            \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 13),             \
+                               _mm256_lddqu_si256(data2 + i + 13));            \
+            CSA(&twosA, &ones, ones, A1, A2);                                  \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 14),             \
+                               _mm256_lddqu_si256(data2 + i + 14));            \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 15),             \
+                               _mm256_lddqu_si256(data2 + i + 15));            \
+            CSA(&twosB, &ones, ones, A1, A2);                                  \
+            CSA(&foursB, &twos, twos, twosA, twosB);                           \
+            CSA(&eightsB, &fours, fours, foursA, foursB);                      \
+            CSA(&sixteens, &eights, eights, eightsA, eightsB);                 \
+            total = _mm256_add_epi64(total, popcount256(sixteens));            \
+        }                                                                      \
+        total = _mm256_slli_epi64(total, 4);                                   \
+        total = _mm256_add_epi64(total,                                        \
+                                 _mm256_slli_epi64(popcount256(eights), 3));   \
+        total =                                                                \
+            _mm256_add_epi64(total, _mm256_slli_epi64(popcount256(fours), 2)); \
+        total =                                                                \
+            _mm256_add_epi64(total, _mm256_slli_epi64(popcount256(twos), 1));  \
+        total = _mm256_add_epi64(total, popcount256(ones));                    \
+        for (; i < size; i++) {                                                \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i),                  \
+                               _mm256_lddqu_si256(data2 + i));                 \
+            total = _mm256_add_epi64(total, popcount256(A1));                  \
+        }                                                                      \
+        return (uint64_t)(_mm256_extract_epi64(total, 0)) +                    \
+               (uint64_t)(_mm256_extract_epi64(total, 1)) +                    \
+               (uint64_t)(_mm256_extract_epi64(total, 2)) +                    \
+               (uint64_t)(_mm256_extract_epi64(total, 3));                     \
+    }                                                                          \
+    static inline uint64_t avx2_harley_seal_popcount256andstore_##opname(      \
+        const __m256i *__restrict__ data1, const __m256i *__restrict__ data2,  \
+        __m256i *__restrict__ out, const uint64_t size) {                      \
+        __m256i total = _mm256_setzero_si256();                                \
+        __m256i ones = _mm256_setzero_si256();                                 \
+        __m256i twos = _mm256_setzero_si256();                                 \
+        __m256i fours = _mm256_setzero_si256();                                \
+        __m256i eights = _mm256_setzero_si256();                               \
+        __m256i sixteens = _mm256_setzero_si256();                             \
+        __m256i twosA, twosB, foursA, foursB, eightsA, eightsB;                \
+        __m256i A1, A2;                                                        \
+        const uint64_t limit = size - size % 16;                               \
+        uint64_t i = 0;                                                        \
+        for (; i < limit; i += 16) {                                           \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i),                  \
+                               _mm256_lddqu_si256(data2 + i));                 \
+            _mm256_storeu_si256(out + i, A1);                                  \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 1),              \
+                               _mm256_lddqu_si256(data2 + i + 1));             \
+            _mm256_storeu_si256(out + i + 1, A2);                              \
+            CSA(&twosA, &ones, ones, A1, A2);                                  \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 2),              \
+                               _mm256_lddqu_si256(data2 + i + 2));             \
+            _mm256_storeu_si256(out + i + 2, A1);                              \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 3),              \
+                               _mm256_lddqu_si256(data2 + i + 3));             \
+            _mm256_storeu_si256(out + i + 3, A2);                              \
+            CSA(&twosB, &ones, ones, A1, A2);                                  \
+            CSA(&foursA, &twos, twos, twosA, twosB);                           \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 4),              \
+                               _mm256_lddqu_si256(data2 + i + 4));             \
+            _mm256_storeu_si256(out + i + 4, A1);                              \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 5),              \
+                               _mm256_lddqu_si256(data2 + i + 5));             \
+            _mm256_storeu_si256(out + i + 5, A2);                              \
+            CSA(&twosA, &ones, ones, A1, A2);                                  \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 6),              \
+                               _mm256_lddqu_si256(data2 + i + 6));             \
+            _mm256_storeu_si256(out + i + 6, A1);                              \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 7),              \
+                               _mm256_lddqu_si256(data2 + i + 7));             \
+            _mm256_storeu_si256(out + i + 7, A2);                              \
+            CSA(&twosB, &ones, ones, A1, A2);                                  \
+            CSA(&foursB, &twos, twos, twosA, twosB);                           \
+            CSA(&eightsA, &fours, fours, foursA, foursB);                      \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 8),              \
+                               _mm256_lddqu_si256(data2 + i + 8));             \
+            _mm256_storeu_si256(out + i + 8, A1);                              \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 9),              \
+                               _mm256_lddqu_si256(data2 + i + 9));             \
+            _mm256_storeu_si256(out + i + 9, A2);                              \
+            CSA(&twosA, &ones, ones, A1, A2);                                  \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 10),             \
+                               _mm256_lddqu_si256(data2 + i + 10));            \
+            _mm256_storeu_si256(out + i + 10, A1);                             \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 11),             \
+                               _mm256_lddqu_si256(data2 + i + 11));            \
+            _mm256_storeu_si256(out + i + 11, A2);                             \
+            CSA(&twosB, &ones, ones, A1, A2);                                  \
+            CSA(&foursA, &twos, twos, twosA, twosB);                           \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 12),             \
+                               _mm256_lddqu_si256(data2 + i + 12));            \
+            _mm256_storeu_si256(out + i + 12, A1);                             \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 13),             \
+                               _mm256_lddqu_si256(data2 + i + 13));            \
+            _mm256_storeu_si256(out + i + 13, A2);                             \
+            CSA(&twosA, &ones, ones, A1, A2);                                  \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 14),             \
+                               _mm256_lddqu_si256(data2 + i + 14));            \
+            _mm256_storeu_si256(out + i + 14, A1);                             \
+            A2 = avx_intrinsic(_mm256_lddqu_si256(data1 + i + 15),             \
+                               _mm256_lddqu_si256(data2 + i + 15));            \
+            _mm256_storeu_si256(out + i + 15, A2);                             \
+            CSA(&twosB, &ones, ones, A1, A2);                                  \
+            CSA(&foursB, &twos, twos, twosA, twosB);                           \
+            CSA(&eightsB, &fours, fours, foursA, foursB);                      \
+            CSA(&sixteens, &eights, eights, eightsA, eightsB);                 \
+            total = _mm256_add_epi64(total, popcount256(sixteens));            \
+        }                                                                      \
+        total = _mm256_slli_epi64(total, 4);                                   \
+        total = _mm256_add_epi64(total,                                        \
+                                 _mm256_slli_epi64(popcount256(eights), 3));   \
+        total =                                                                \
+            _mm256_add_epi64(total, _mm256_slli_epi64(popcount256(fours), 2)); \
+        total =                                                                \
+            _mm256_add_epi64(total, _mm256_slli_epi64(popcount256(twos), 1));  \
+        total = _mm256_add_epi64(total, popcount256(ones));                    \
+        for (; i < size; i++) {                                                \
+            A1 = avx_intrinsic(_mm256_lddqu_si256(data1 + i),                  \
+                               _mm256_lddqu_si256(data2 + i));                 \
+            _mm256_storeu_si256(out + i, A1);                                  \
+            total = _mm256_add_epi64(total, popcount256(A1));                  \
+        }                                                                      \
+        return (uint64_t)(_mm256_extract_epi64(total, 0)) +                    \
+               (uint64_t)(_mm256_extract_epi64(total, 1)) +                    \
+               (uint64_t)(_mm256_extract_epi64(total, 2)) +                    \
+               (uint64_t)(_mm256_extract_epi64(total, 3));                     \
+    }
+
+CROARING_TARGET_AVX2
+CROARING_AVXPOPCNTFNC(or, _mm256_or_si256)
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+CROARING_AVXPOPCNTFNC(union, _mm256_or_si256)
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+CROARING_AVXPOPCNTFNC(and, _mm256_and_si256)
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+CROARING_AVXPOPCNTFNC(intersection, _mm256_and_si256)
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+CROARING_AVXPOPCNTFNC(xor, _mm256_xor_si256)
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+CROARING_AVXPOPCNTFNC(andnot, _mm256_andnot_si256)
+CROARING_UNTARGET_AVX2
+
+#define VPOPCNT_AND_ADD(ptr, i, accu)                                  \
+    const __m512i v##i = _mm512_loadu_si512((const __m512i *)ptr + i); \
+    const __m512i p##i = _mm512_popcnt_epi64(v##i);                    \
+    accu = _mm512_add_epi64(accu, p##i);
+
+#if CROARING_COMPILER_SUPPORTS_AVX512
+CROARING_TARGET_AVX512
+static inline uint64_t sum_epu64_256(const __m256i v) {
+    return (uint64_t)(_mm256_extract_epi64(v, 0)) +
+           (uint64_t)(_mm256_extract_epi64(v, 1)) +
+           (uint64_t)(_mm256_extract_epi64(v, 2)) +
+           (uint64_t)(_mm256_extract_epi64(v, 3));
+}
+
+static inline uint64_t simd_sum_epu64(const __m512i v) {
+    __m256i lo = _mm512_extracti64x4_epi64(v, 0);
+    __m256i hi = _mm512_extracti64x4_epi64(v, 1);
+
+    return sum_epu64_256(lo) + sum_epu64_256(hi);
+}
+
+static inline uint64_t avx512_vpopcount(const __m512i *data,
+    const uint64_t size) {
+    const uint64_t limit = size - size % 4;
+    __m512i total = _mm512_setzero_si512();
+    uint64_t i = 0;
+
+    for (; i < limit; i += 4) {
+        VPOPCNT_AND_ADD(data + i, 0, total);
+        VPOPCNT_AND_ADD(data + i, 1, total);
+        VPOPCNT_AND_ADD(data + i, 2, total);
+        VPOPCNT_AND_ADD(data + i, 3, total);
+    }
+
+    for (; i < size; i++) {
+        total = _mm512_add_epi64(
+            total, _mm512_popcnt_epi64(_mm512_loadu_si512(data + i)));
+    }
+
+    return simd_sum_epu64(total);
+}
+CROARING_UNTARGET_AVX512
+#endif
+
+#define CROARING_AVXPOPCNTFNC512(opname, avx_intrinsic)                       \
+    static inline uint64_t avx512_harley_seal_popcount512_##opname(           \
+        const __m512i *data1, const __m512i *data2, const uint64_t size) {    \
+        __m512i total = _mm512_setzero_si512();                               \
+        const uint64_t limit = size - size % 4;                               \
+        uint64_t i = 0;                                                       \
+        for (; i < limit; i += 4) {                                           \
+            __m512i a1 = avx_intrinsic(_mm512_loadu_si512(data1 + i),         \
+                                       _mm512_loadu_si512(data2 + i));        \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a1));         \
+            __m512i a2 = avx_intrinsic(_mm512_loadu_si512(data1 + i + 1),     \
+                                       _mm512_loadu_si512(data2 + i + 1));    \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a2));         \
+            __m512i a3 = avx_intrinsic(_mm512_loadu_si512(data1 + i + 2),     \
+                                       _mm512_loadu_si512(data2 + i + 2));    \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a3));         \
+            __m512i a4 = avx_intrinsic(_mm512_loadu_si512(data1 + i + 3),     \
+                                       _mm512_loadu_si512(data2 + i + 3));    \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a4));         \
+        }                                                                     \
+        for (; i < size; i++) {                                               \
+            __m512i a = avx_intrinsic(_mm512_loadu_si512(data1 + i),          \
+                                      _mm512_loadu_si512(data2 + i));         \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a));          \
+        }                                                                     \
+        return simd_sum_epu64(total);                                         \
+    }                                                                         \
+    static inline uint64_t avx512_harley_seal_popcount512andstore_##opname(   \
+        const __m512i *__restrict__ data1, const __m512i *__restrict__ data2, \
+        __m512i *__restrict__ out, const uint64_t size) {                     \
+        __m512i total = _mm512_setzero_si512();                               \
+        const uint64_t limit = size - size % 4;                               \
+        uint64_t i = 0;                                                       \
+        for (; i < limit; i += 4) {                                           \
+            __m512i a1 = avx_intrinsic(_mm512_loadu_si512(data1 + i),         \
+                                       _mm512_loadu_si512(data2 + i));        \
+            _mm512_storeu_si512(out + i, a1);                                 \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a1));         \
+            __m512i a2 = avx_intrinsic(_mm512_loadu_si512(data1 + i + 1),     \
+                                       _mm512_loadu_si512(data2 + i + 1));    \
+            _mm512_storeu_si512(out + i + 1, a2);                             \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a2));         \
+            __m512i a3 = avx_intrinsic(_mm512_loadu_si512(data1 + i + 2),     \
+                                       _mm512_loadu_si512(data2 + i + 2));    \
+            _mm512_storeu_si512(out + i + 2, a3);                             \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a3));         \
+            __m512i a4 = avx_intrinsic(_mm512_loadu_si512(data1 + i + 3),     \
+                                       _mm512_loadu_si512(data2 + i + 3));    \
+            _mm512_storeu_si512(out + i + 3, a4);                             \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a4));         \
+        }                                                                     \
+        for (; i < size; i++) {                                               \
+            __m512i a = avx_intrinsic(_mm512_loadu_si512(data1 + i),          \
+                                      _mm512_loadu_si512(data2 + i));         \
+            _mm512_storeu_si512(out + i, a);                                  \
+            total = _mm512_add_epi64(total, _mm512_popcnt_epi64(a));          \
+        }                                                                     \
+        return simd_sum_epu64(total);                                         \
+    }
+
+#if CROARING_COMPILER_SUPPORTS_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVXPOPCNTFNC512(or, _mm512_or_si512)
+CROARING_AVXPOPCNTFNC512(union, _mm512_or_si512)
+CROARING_AVXPOPCNTFNC512(and, _mm512_and_si512)
+CROARING_AVXPOPCNTFNC512(intersection, _mm512_and_si512)
+CROARING_AVXPOPCNTFNC512(xor, _mm512_xor_si512)
+CROARING_AVXPOPCNTFNC512(andnot, _mm512_andnot_si512)
+CROARING_UNTARGET_AVX512
+#endif
+/***
+ * END Harley-Seal popcount functions.
+ */
+
+#endif  // CROARING_IS_X64
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic pop
+#endif
+#endif
+/* end file include/roaring/bitset_util.h */
+/* begin file include/roaring/containers/array.h */
+/*
+ * array.h
+ *
+ */
+
+#ifndef INCLUDE_CONTAINERS_ARRAY_H_
+#define INCLUDE_CONTAINERS_ARRAY_H_
+
+#include <string.h>
+
+
+// Include other headers after roaring_types.h
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+
+// Note: in pure C++ code, you should avoid putting `using` in header files
+using api::roaring_iterator;
+using api::roaring_iterator64;
+
+namespace internal {
+#endif
+
+/* Containers with DEFAULT_MAX_SIZE or less integers should be arrays */
+enum { DEFAULT_MAX_SIZE = 4096 };
+
+/* struct array_container - sparse representation of a bitmap
+ *
+ * @cardinality: number of indices in `array` (and the bitmap)
+ * @capacity:    allocated size of `array`
+ * @array:       sorted list of integers
+ */
+STRUCT_CONTAINER(array_container_s) {
+    int32_t cardinality;
+    int32_t capacity;
+    uint16_t *array;
+};
+
+typedef struct array_container_s array_container_t;
+
+#define CAST_array(c) CAST(array_container_t *, c)  // safer downcast
+#define const_CAST_array(c) CAST(const array_container_t *, c)
+#define movable_CAST_array(c) movable_CAST(array_container_t **, c)
+
+/* Create a new array with default. Return NULL in case of failure. See also
+ * array_container_create_given_capacity. */
+array_container_t *array_container_create(void);
+
+/* Create a new array with a specified capacity size. Return NULL in case of
+ * failure. */
+array_container_t *array_container_create_given_capacity(int32_t size);
+
+/* Create a new array containing all values in [min,max). */
+array_container_t *array_container_create_range(uint32_t min, uint32_t max);
+
+/*
+ * Shrink the capacity to the actual size, return the number of bytes saved.
+ */
+int array_container_shrink_to_fit(array_container_t *src);
+
+/* Free memory owned by `array'. */
+void array_container_free(array_container_t *array);
+
+/* Duplicate container */
+array_container_t *array_container_clone(const array_container_t *src);
+
+/* Get the cardinality of `array'. */
+ALLOW_UNALIGNED
+static inline int array_container_cardinality(const array_container_t *array) {
+    return array->cardinality;
+}
+
+static inline bool array_container_nonzero_cardinality(
+    const array_container_t *array) {
+    return array->cardinality > 0;
+}
+
+/* Copy one container into another. We assume that they are distinct. */
+void array_container_copy(const array_container_t *src, array_container_t *dst);
+
+/*  Add all the values in [min,max) (included) at a distance k*step from min.
+    The container must have a size less or equal to DEFAULT_MAX_SIZE after this
+   addition. */
+void array_container_add_from_range(array_container_t *arr, uint32_t min,
+    uint32_t max, uint16_t step);
+
+static inline bool array_container_empty(const array_container_t *array) {
+    return array->cardinality == 0;
+}
+
+/* check whether the cardinality is equal to the capacity (this does not mean
+ * that it contains 1<<16 elements) */
+static inline bool array_container_full(const array_container_t *array) {
+    return array->cardinality == array->capacity;
+}
+
+/* Compute the union of `src_1' and `src_2' and write the result to `dst'
+ * It is assumed that `dst' is distinct from both `src_1' and `src_2'. */
+void array_container_union(const array_container_t *src_1,
+    const array_container_t *src_2,
+    array_container_t *dst);
+
+/* symmetric difference, see array_container_union */
+void array_container_xor(const array_container_t *array_1,
+    const array_container_t *array_2,
+    array_container_t *out);
+
+/* Computes the intersection of src_1 and src_2 and write the result to
+ * dst. It is assumed that dst is distinct from both src_1 and src_2. */
+void array_container_intersection(const array_container_t *src_1,
+    const array_container_t *src_2,
+    array_container_t *dst);
+
+/* Check whether src_1 and src_2 intersect. */
+bool array_container_intersect(const array_container_t *src_1,
+    const array_container_t *src_2);
+
+/* computers the size of the intersection between two arrays.
+ */
+int array_container_intersection_cardinality(const array_container_t *src_1,
+    const array_container_t *src_2);
+
+/* computes the intersection of array1 and array2 and write the result to
+ * array1.
+ * */
+void array_container_intersection_inplace(array_container_t *src_1,
+    const array_container_t *src_2);
+
+/*
+ * Write out the 16-bit integers contained in this container as a list of 32-bit
+ * integers using base
+ * as the starting value (it might be expected that base has zeros in its 16
+ * least significant bits).
+ * The function returns the number of values written.
+ * The caller is responsible for allocating enough memory in out.
+ */
+int array_container_to_uint32_array(void *vout, const array_container_t *cont,
+    uint32_t base);
+
+/* Compute the number of runs */
+int32_t array_container_number_of_runs(const array_container_t *ac);
+
+/*
+ * Print this container using printf (useful for debugging).
+ */
+void array_container_printf(const array_container_t *v);
+
+/*
+ * Print this container using printf as a comma-separated list of 32-bit
+ * integers starting at base.
+ */
+void array_container_printf_as_uint32_array(const array_container_t *v,
+    uint32_t base);
+
+bool array_container_validate(const array_container_t *v, const char **reason);
+
+/**
+ * Return the serialized size in bytes of a container having cardinality "card".
+ */
+static inline int32_t array_container_serialized_size_in_bytes(int32_t card) {
+    return card * 2 + 2;
+}
+
+/**
+ * Increase capacity to at least min.
+ * Whether the existing data needs to be copied over depends on the "preserve"
+ * parameter. If preserve is false, then the new content will be uninitialized,
+ * otherwise the old content is copied.
+ */
+void array_container_grow(array_container_t *container, int32_t min,
+    bool preserve);
+
+bool array_container_iterate(const array_container_t *cont, uint32_t base,
+    roaring_iterator iterator, void *ptr);
+bool array_container_iterate64(const array_container_t *cont, uint32_t base,
+    roaring_iterator64 iterator, uint64_t high_bits,
+    void *ptr);
+
+/**
+ * Writes the underlying array to buf, outputs how many bytes were written.
+ * This is meant to be byte-by-byte compatible with the Java and Go versions of
+ * Roaring.
+ * The number of bytes written should be
+ * array_container_size_in_bytes(container).
+ *
+ */
+int32_t array_container_write(const array_container_t *container, char *buf);
+/**
+ * Reads the instance from buf, outputs how many bytes were read.
+ * This is meant to be byte-by-byte compatible with the Java and Go versions of
+ * Roaring.
+ * The number of bytes read should be array_container_size_in_bytes(container).
+ * You need to provide the (known) cardinality.
+ */
+int32_t array_container_read(int32_t cardinality, array_container_t *container,
+    const char *buf);
+
+/**
+ * Return the serialized size in bytes of a container (see
+ * bitset_container_write)
+ * This is meant to be compatible with the Java and Go versions of Roaring and
+ * assumes
+ * that the cardinality of the container is already known.
+ *
+ */
+ALLOW_UNALIGNED
+static inline int32_t array_container_size_in_bytes(
+    const array_container_t *container) {
+    return container->cardinality * sizeof(uint16_t);
+}
+
+/**
+ * Return true if the two arrays have the same content.
+ */
+ALLOW_UNALIGNED
+static inline bool array_container_equals(const array_container_t *container1,
+    const array_container_t *container2) {
+    if (container1->cardinality != container2->cardinality) {
+        return false;
+    }
+    return memequals(container1->array, container2->array,
+        container1->cardinality * 2);
+}
+
+/**
+ * Return true if container1 is a subset of container2.
+ */
+bool array_container_is_subset(const array_container_t *container1,
+    const array_container_t *container2);
+
+/**
+ * If the element of given rank is in this container, supposing that the first
+ * element has rank start_rank, then the function returns true and sets element
+ * accordingly.
+ * Otherwise, it returns false and update start_rank.
+ */
+static inline bool array_container_select(const array_container_t *container,
+    uint32_t *start_rank, uint32_t rank,
+    uint32_t *element) {
+    int card = array_container_cardinality(container);
+    if (*start_rank + card <= rank) {
+        *start_rank += card;
+        return false;
+    } else {
+        *element = container->array[rank - *start_rank];
+        return true;
+    }
+}
+
+/* Computes the  difference of array1 and array2 and write the result
+ * to array out.
+ * Array out does not need to be distinct from array_1
+ */
+void array_container_andnot(const array_container_t *array_1,
+    const array_container_t *array_2,
+    array_container_t *out);
+
+/* Append x to the set. Assumes that the value is larger than any preceding
+ * values.  */
+static inline void array_container_append(array_container_t *arr,
+    uint16_t pos) {
+    const int32_t capacity = arr->capacity;
+
+    if (array_container_full(arr)) {
+        array_container_grow(arr, capacity + 1, true);
+    }
+
+    arr->array[arr->cardinality++] = pos;
+}
+
+/**
+ * Add value to the set if final cardinality doesn't exceed max_cardinality.
+ * Return code:
+ * 1  -- value was added
+ * 0  -- value was already present
+ * -1 -- value was not added because cardinality would exceed max_cardinality
+ */
+static inline int array_container_try_add(array_container_t *arr,
+    uint16_t value,
+    int32_t max_cardinality) {
+    const int32_t cardinality = arr->cardinality;
+
+    // best case, we can append.
+    if ((array_container_empty(arr) || arr->array[cardinality - 1] < value) &&
+        cardinality < max_cardinality) {
+        array_container_append(arr, value);
+        return 1;
+    }
+
+    const int32_t loc = binarySearch(arr->array, cardinality, value);
+
+    if (loc >= 0) {
+        return 0;
+    } else if (cardinality < max_cardinality) {
+        if (array_container_full(arr)) {
+            array_container_grow(arr, arr->capacity + 1, true);
+        }
+        const int32_t insert_idx = -loc - 1;
+        memmove(arr->array + insert_idx + 1, arr->array + insert_idx,
+            (cardinality - insert_idx) * sizeof(uint16_t));
+        arr->array[insert_idx] = value;
+        arr->cardinality++;
+        return 1;
+    } else {
+        return -1;
+    }
+}
+
+/* Add value to the set. Returns true if x was not already present.  */
+static inline bool array_container_add(array_container_t *arr, uint16_t value) {
+    return array_container_try_add(arr, value, INT32_MAX) == 1;
+}
+
+/* Remove x from the set. Returns true if x was present.  */
+static inline bool array_container_remove(array_container_t *arr,
+    uint16_t pos) {
+    const int32_t idx = binarySearch(arr->array, arr->cardinality, pos);
+    const bool is_present = idx >= 0;
+    if (is_present) {
+        memmove(arr->array + idx, arr->array + idx + 1,
+            (arr->cardinality - idx - 1) * sizeof(uint16_t));
+        arr->cardinality--;
+    }
+
+    return is_present;
+}
+
+/* Check whether x is present.  */
+inline bool array_container_contains(const array_container_t *arr,
+    uint16_t pos) {
+    //    return binarySearch(arr->array, arr->cardinality, pos) >= 0;
+    // binary search with fallback to linear search for short ranges
+    int32_t low = 0;
+    const uint16_t *carr = (const uint16_t *)arr->array;
+    int32_t high = arr->cardinality - 1;
+    //    while (high - low >= 0) {
+    while (high >= low + 16) {
+        int32_t middleIndex = (low + high) >> 1;
+        uint16_t middleValue = carr[middleIndex];
+        if (middleValue < pos) {
+            low = middleIndex + 1;
+        } else if (middleValue > pos) {
+            high = middleIndex - 1;
+        } else {
+            return true;
+        }
+    }
+
+    for (int i = low; i <= high; i++) {
+        uint16_t v = carr[i];
+        if (v == pos) {
+            return true;
+        }
+        if (v > pos) return false;
+    }
+    return false;
+}
+
+void array_container_offset(const array_container_t *c, container_t **loc,
+    container_t **hic, uint16_t offset);
+
+//* Check whether a range of values from range_start (included) to range_end
+//(excluded) is present. */
+static inline bool array_container_contains_range(const array_container_t *arr,
+    uint32_t range_start,
+    uint32_t range_end) {
+    const int32_t range_count = range_end - range_start;
+    const uint16_t rs_included = (uint16_t)range_start;
+    const uint16_t re_included = (uint16_t)(range_end - 1);
+
+    // Empty range is always included
+    if (range_count <= 0) {
+        return true;
+    }
+    if (range_count > arr->cardinality) {
+        return false;
+    }
+
+    const int32_t start =
+        binarySearch(arr->array, arr->cardinality, rs_included);
+    // If this sorted array contains all items in the range:
+    // * the start item must be found
+    // * the last item in range range_count must exist, and be the expected end
+    // value
+    return (start >= 0) && (arr->cardinality >= start + range_count) &&
+           (arr->array[start + range_count - 1] == re_included);
+}
+
+/* Returns the smallest value (assumes not empty) */
+inline uint16_t array_container_minimum(const array_container_t *arr) {
+    if (arr->cardinality == 0) return 0;
+    return arr->array[0];
+}
+
+/* Returns the largest value (assumes not empty) */
+inline uint16_t array_container_maximum(const array_container_t *arr) {
+    if (arr->cardinality == 0) return 0;
+    return arr->array[arr->cardinality - 1];
+}
+
+/* Returns the number of values equal or smaller than x */
+inline int array_container_rank(const array_container_t *arr, uint16_t x) {
+    const int32_t idx = binarySearch(arr->array, arr->cardinality, x);
+    const bool is_present = idx >= 0;
+    if (is_present) {
+        return idx + 1;
+    } else {
+        return -idx - 1;
+    }
+}
+
+/*  bulk version of array_container_rank(); return number of consumed elements
+ */
+inline uint32_t array_container_rank_many(const array_container_t *arr,
+    uint64_t start_rank,
+    const uint32_t *begin,
+    const uint32_t *end, uint64_t *ans) {
+    const uint16_t high = (uint16_t)((*begin) >> 16);
+    uint32_t pos = 0;
+    const uint32_t *iter = begin;
+    for (; iter != end; iter++) {
+        uint32_t x = *iter;
+        uint16_t xhigh = (uint16_t)(x >> 16);
+        if (xhigh != high) return iter - begin;  // stop at next container
+
+        const int32_t idx =
+            binarySearch(arr->array + pos, arr->cardinality - pos, (uint16_t)x);
+        const bool is_present = idx >= 0;
+        if (is_present) {
+            *(ans++) = start_rank + pos + (idx + 1);
+            pos = idx + 1;
+        } else {
+            *(ans++) = start_rank + pos + (-idx - 1);
+        }
+    }
+    return iter - begin;
+}
+
+/* Returns the index of x , if not exsist return -1 */
+inline int array_container_get_index(const array_container_t *arr, uint16_t x) {
+    const int32_t idx = binarySearch(arr->array, arr->cardinality, x);
+    const bool is_present = idx >= 0;
+    if (is_present) {
+        return idx;
+    } else {
+        return -1;
+    }
+}
+
+/* Returns the index of the first value equal or larger than x, or -1 */
+inline int array_container_index_equalorlarger(const array_container_t *arr,
+    uint16_t x) {
+    const int32_t idx = binarySearch(arr->array, arr->cardinality, x);
+    const bool is_present = idx >= 0;
+    if (is_present) {
+        return idx;
+    } else {
+        int32_t candidate = -idx - 1;
+        if (candidate < arr->cardinality) return candidate;
+        return -1;
+    }
+}
+
+/*
+ * Adds all values in range [min,max] using hint:
+ *   nvals_less is the number of array values less than $min
+ *   nvals_greater is the number of array values greater than $max
+ */
+static inline void array_container_add_range_nvals(array_container_t *array,
+    uint32_t min, uint32_t max,
+    int32_t nvals_less,
+    int32_t nvals_greater) {
+    int32_t union_cardinality = nvals_less + (max - min + 1) + nvals_greater;
+    if (union_cardinality > array->capacity) {
+        array_container_grow(array, union_cardinality, true);
+    }
+    memmove(&(array->array[union_cardinality - nvals_greater]),
+        &(array->array[array->cardinality - nvals_greater]),
+        nvals_greater * sizeof(uint16_t));
+    for (uint32_t i = 0; i <= max - min; i++) {
+        array->array[nvals_less + i] = (uint16_t)(min + i);
+    }
+    array->cardinality = union_cardinality;
+}
+
+/**
+ * Adds all values in range [min,max]. This function is currently unused
+ * and left as a documentation.
+ */
+/*static inline void array_container_add_range(array_container_t *array,
+                                             uint32_t min, uint32_t max) {
+    int32_t nvals_greater = count_greater(array->array, array->cardinality,
+max); int32_t nvals_less = count_less(array->array, array->cardinality -
+nvals_greater, min); array_container_add_range_nvals(array, min, max,
+nvals_less, nvals_greater);
+}*/
+
+/*
+ * Removes all elements array[pos] .. array[pos+count-1]
+ */
+static inline void array_container_remove_range(array_container_t *array,
+    uint32_t pos, uint32_t count) {
+    if (count != 0) {
+        memmove(&(array->array[pos]), &(array->array[pos + count]),
+            (array->cardinality - pos - count) * sizeof(uint16_t));
+        array->cardinality -= count;
+    }
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif /* INCLUDE_CONTAINERS_ARRAY_H_ */
+/* end file include/roaring/containers/array.h */
+/* begin file include/roaring/containers/bitset.h */
+/*
+ * bitset.h
+ *
+ */
+
+#ifndef INCLUDE_CONTAINERS_BITSET_H_
+#define INCLUDE_CONTAINERS_BITSET_H_
+
+#include <stdbool.h>
+#include <stdint.h>
+
+
+// Include other headers after roaring_types.h
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+
+// Note: in pure C++ code, you should avoid putting `using` in header files
+using api::roaring_iterator;
+using api::roaring_iterator64;
+
+namespace internal {
+#endif
+
+enum {
+    BITSET_CONTAINER_SIZE_IN_WORDS = (1 << 16) / 64,
+    BITSET_UNKNOWN_CARDINALITY = -1
+};
+
+STRUCT_CONTAINER(bitset_container_s) {
+    int32_t cardinality;
+    uint64_t *words;
+};
+
+typedef struct bitset_container_s bitset_container_t;
+
+#define CAST_bitset(c) CAST(bitset_container_t *, c)  // safer downcast
+#define const_CAST_bitset(c) CAST(const bitset_container_t *, c)
+#define movable_CAST_bitset(c) movable_CAST(bitset_container_t **, c)
+
+/* Create a new bitset. Return NULL in case of failure. */
+bitset_container_t *bitset_container_create(void);
+
+/* Free memory. */
+void bitset_container_free(bitset_container_t *bitset);
+
+/* Clear bitset (sets bits to 0). */
+void bitset_container_clear(bitset_container_t *bitset);
+
+/* Set all bits to 1. */
+void bitset_container_set_all(bitset_container_t *bitset);
+
+/* Duplicate bitset */
+bitset_container_t *bitset_container_clone(const bitset_container_t *src);
+
+/* Set the bit in [begin,end). WARNING: as of April 2016, this method is slow
+ * and
+ * should not be used in performance-sensitive code. Ever.  */
+void bitset_container_set_range(bitset_container_t *bitset, uint32_t begin,
+    uint32_t end);
+
+#if defined(CROARING_ASMBITMANIPOPTIMIZATION) && defined(__AVX2__)
+/* Set the ith bit.  */
+static inline void bitset_container_set(bitset_container_t *bitset,
+    uint16_t pos) {
+    uint64_t shift = 6;
+    uint64_t offset;
+    uint64_t p = pos;
+    ASM_SHIFT_RIGHT(p, shift, offset);
+    uint64_t load = bitset->words[offset];
+    ASM_SET_BIT_INC_WAS_CLEAR(load, p, bitset->cardinality);
+    bitset->words[offset] = load;
+}
+
+/* Unset the ith bit. Currently unused. Could be used for optimization. */
+/*static inline void bitset_container_unset(bitset_container_t *bitset,
+                                          uint16_t pos) {
+    uint64_t shift = 6;
+    uint64_t offset;
+    uint64_t p = pos;
+    ASM_SHIFT_RIGHT(p, shift, offset);
+    uint64_t load = bitset->words[offset];
+    ASM_CLEAR_BIT_DEC_WAS_SET(load, p, bitset->cardinality);
+    bitset->words[offset] = load;
+}*/
+
+/* Add `pos' to `bitset'. Returns true if `pos' was not present. Might be slower
+ * than bitset_container_set.  */
+static inline bool bitset_container_add(bitset_container_t *bitset,
+    uint16_t pos) {
+    uint64_t shift = 6;
+    uint64_t offset;
+    uint64_t p = pos;
+    ASM_SHIFT_RIGHT(p, shift, offset);
+    uint64_t load = bitset->words[offset];
+    // could be possibly slightly further optimized
+    const int32_t oldcard = bitset->cardinality;
+    ASM_SET_BIT_INC_WAS_CLEAR(load, p, bitset->cardinality);
+    bitset->words[offset] = load;
+    return bitset->cardinality - oldcard;
+}
+
+/* Remove `pos' from `bitset'. Returns true if `pos' was present.  Might be
+ * slower than bitset_container_unset.  */
+static inline bool bitset_container_remove(bitset_container_t *bitset,
+    uint16_t pos) {
+    uint64_t shift = 6;
+    uint64_t offset;
+    uint64_t p = pos;
+    ASM_SHIFT_RIGHT(p, shift, offset);
+    uint64_t load = bitset->words[offset];
+    // could be possibly slightly further optimized
+    const int32_t oldcard = bitset->cardinality;
+    ASM_CLEAR_BIT_DEC_WAS_SET(load, p, bitset->cardinality);
+    bitset->words[offset] = load;
+    return oldcard - bitset->cardinality;
+}
+
+/* Get the value of the ith bit.  */
+inline bool bitset_container_get(const bitset_container_t *bitset,
+    uint16_t pos) {
+    uint64_t word = bitset->words[pos >> 6];
+    const uint64_t p = pos;
+    ASM_INPLACESHIFT_RIGHT(word, p);
+    return word & 1;
+}
+
+#else
+
+/* Set the ith bit.  */
+static inline void bitset_container_set(bitset_container_t *bitset,
+    uint16_t pos) {
+    const uint64_t old_word = bitset->words[pos >> 6];
+    const int index = pos & 63;
+    const uint64_t new_word = old_word | (UINT64_C(1) << index);
+    bitset->cardinality += (uint32_t)((old_word ^ new_word) >> index);
+    bitset->words[pos >> 6] = new_word;
+}
+
+/* Unset the ith bit. Currently unused.  */
+/*static inline void bitset_container_unset(bitset_container_t *bitset,
+                                          uint16_t pos) {
+    const uint64_t old_word = bitset->words[pos >> 6];
+    const int index = pos & 63;
+    const uint64_t new_word = old_word & (~(UINT64_C(1) << index));
+    bitset->cardinality -= (uint32_t)((old_word ^ new_word) >> index);
+    bitset->words[pos >> 6] = new_word;
+}*/
+
+/* Add `pos' to `bitset'. Returns true if `pos' was not present. Might be slower
+ * than bitset_container_set.  */
+static inline bool bitset_container_add(bitset_container_t *bitset,
+    uint16_t pos) {
+    const uint64_t old_word = bitset->words[pos >> 6];
+    const int index = pos & 63;
+    const uint64_t new_word = old_word | (UINT64_C(1) << index);
+    const uint64_t increment = (old_word ^ new_word) >> index;
+    bitset->cardinality += (uint32_t)increment;
+    bitset->words[pos >> 6] = new_word;
+    return increment > 0;
+}
+
+/* Remove `pos' from `bitset'. Returns true if `pos' was present.  Might be
+ * slower than bitset_container_unset.  */
+static inline bool bitset_container_remove(bitset_container_t *bitset,
+    uint16_t pos) {
+    const uint64_t old_word = bitset->words[pos >> 6];
+    const int index = pos & 63;
+    const uint64_t new_word = old_word & (~(UINT64_C(1) << index));
+    const uint64_t increment = (old_word ^ new_word) >> index;
+    bitset->cardinality -= (uint32_t)increment;
+    bitset->words[pos >> 6] = new_word;
+    return increment > 0;
+}
+
+/* Get the value of the ith bit.  */
+inline bool bitset_container_get(const bitset_container_t *bitset,
+    uint16_t pos) {
+    const uint64_t word = bitset->words[pos >> 6];
+    return (word >> (pos & 63)) & 1;
+}
+
+#endif
+
+/*
+ * Check if all bits are set in a range of positions from pos_start (included)
+ * to pos_end (excluded).
+ */
+static inline bool bitset_container_get_range(const bitset_container_t *bitset,
+    uint32_t pos_start,
+    uint32_t pos_end) {
+    const uint32_t start = pos_start >> 6;
+    const uint32_t end = pos_end >> 6;
+
+    const uint64_t first = ~((1ULL << (pos_start & 0x3F)) - 1);
+    const uint64_t last = (1ULL << (pos_end & 0x3F)) - 1;
+
+    if (start == end)
+        return ((bitset->words[end] & first & last) == (first & last));
+    if ((bitset->words[start] & first) != first) return false;
+
+    if ((end < BITSET_CONTAINER_SIZE_IN_WORDS) &&
+        ((bitset->words[end] & last) != last)) {
+        return false;
+    }
+
+    for (uint32_t i = start + 1;
+        (i < BITSET_CONTAINER_SIZE_IN_WORDS) && (i < end); ++i) {
+        if (bitset->words[i] != UINT64_C(0xFFFFFFFFFFFFFFFF)) return false;
+    }
+
+    return true;
+}
+
+/* Check whether `bitset' is present in `array'.  Calls bitset_container_get. */
+inline bool bitset_container_contains(const bitset_container_t *bitset,
+    uint16_t pos) {
+    return bitset_container_get(bitset, pos);
+}
+
+/*
+ * Check whether a range of bits from position `pos_start' (included) to
+ * `pos_end' (excluded) is present in `bitset'.  Calls bitset_container_get_all.
+ */
+static inline bool bitset_container_contains_range(
+    const bitset_container_t *bitset, uint32_t pos_start, uint32_t pos_end) {
+    return bitset_container_get_range(bitset, pos_start, pos_end);
+}
+
+/* Get the number of bits set */
+ALLOW_UNALIGNED
+static inline int bitset_container_cardinality(
+    const bitset_container_t *bitset) {
+    return bitset->cardinality;
+}
+
+/* Copy one container into another. We assume that they are distinct. */
+void bitset_container_copy(const bitset_container_t *source,
+    bitset_container_t *dest);
+
+/*  Add all the values [min,max) at a distance k*step from min: min,
+ * min+step,.... */
+void bitset_container_add_from_range(bitset_container_t *bitset, uint32_t min,
+    uint32_t max, uint16_t step);
+
+/* Get the number of bits set (force computation). This does not modify bitset.
+ * To update the cardinality, you should do
+ * bitset->cardinality =  bitset_container_compute_cardinality(bitset).*/
+int bitset_container_compute_cardinality(const bitset_container_t *bitset);
+
+/* Check whether this bitset is empty,
+ *  it never modifies the bitset struct. */
+static inline bool bitset_container_empty(const bitset_container_t *bitset) {
+    if (bitset->cardinality == BITSET_UNKNOWN_CARDINALITY) {
+        for (int i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i++) {
+            if ((bitset->words[i]) != 0) return false;
+        }
+        return true;
+    }
+    return bitset->cardinality == 0;
+}
+
+/* Get whether there is at least one bit set  (see bitset_container_empty for
+   the reverse), the bitset is never modified */
+static inline bool bitset_container_const_nonzero_cardinality(
+    const bitset_container_t *bitset) {
+    return !bitset_container_empty(bitset);
+}
+
+/*
+ * Check whether the two bitsets intersect
+ */
+bool bitset_container_intersect(const bitset_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/* Computes the union of bitsets `src_1' and `src_2' into `dst'  and return the
+ * cardinality. */
+int bitset_container_or(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the union of bitsets `src_1' and `src_2' and return the cardinality.
+ */
+int bitset_container_or_justcard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/* Computes the union of bitsets `src_1' and `src_2' into `dst' and return the
+ * cardinality. Same as bitset_container_or. */
+int bitset_container_union(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the union of bitsets `src_1' and `src_2'  and return the
+ * cardinality. Same as bitset_container_or_justcard. */
+int bitset_container_union_justcard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/* Computes the union of bitsets `src_1' and `src_2' into `dst', but does
+ * not update the cardinality. Provided to optimize chained operations. */
+int bitset_container_union_nocard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the union of bitsets `src_1' and `src_2' into `dst', but does not
+ * update the cardinality. Provided to optimize chained operations. */
+int bitset_container_or_nocard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the intersection of bitsets `src_1' and `src_2' into `dst' and
+ * return the cardinality. */
+int bitset_container_and(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the intersection of bitsets `src_1' and `src_2'  and return the
+ * cardinality. */
+int bitset_container_and_justcard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/* Computes the intersection of bitsets `src_1' and `src_2' into `dst' and
+ * return the cardinality. Same as bitset_container_and. */
+int bitset_container_intersection(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the intersection of bitsets `src_1' and `src_2' and return the
+ * cardinality. Same as bitset_container_and_justcard. */
+int bitset_container_intersection_justcard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/* Computes the intersection of bitsets `src_1' and `src_2' into `dst', but does
+ * not update the cardinality. Provided to optimize chained operations. */
+int bitset_container_intersection_nocard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the intersection of bitsets `src_1' and `src_2' into `dst', but does
+ * not update the cardinality. Provided to optimize chained operations. */
+int bitset_container_and_nocard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the exclusive or of bitsets `src_1' and `src_2' into `dst' and
+ * return the cardinality. */
+int bitset_container_xor(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the exclusive or of bitsets `src_1' and `src_2' and return the
+ * cardinality. */
+int bitset_container_xor_justcard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/* Computes the exclusive or of bitsets `src_1' and `src_2' into `dst', but does
+ * not update the cardinality. Provided to optimize chained operations. */
+int bitset_container_xor_nocard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the and not of bitsets `src_1' and `src_2' into `dst' and return the
+ * cardinality. */
+int bitset_container_andnot(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Computes the and not of bitsets `src_1' and `src_2'  and return the
+ * cardinality. */
+int bitset_container_andnot_justcard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/* Computes the and not or of bitsets `src_1' and `src_2' into `dst', but does
+ * not update the cardinality. Provided to optimize chained operations. */
+int bitset_container_andnot_nocard(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+void bitset_container_offset(const bitset_container_t *c, container_t **loc,
+    container_t **hic, uint16_t offset);
+/*
+ * Write out the 16-bit integers contained in this container as a list of 32-bit
+ * integers using base
+ * as the starting value (it might be expected that base has zeros in its 16
+ * least significant bits).
+ * The function returns the number of values written.
+ * The caller is responsible for allocating enough memory in out.
+ * The out pointer should point to enough memory (the cardinality times 32
+ * bits).
+ */
+int bitset_container_to_uint32_array(uint32_t *out,
+    const bitset_container_t *bc,
+    uint32_t base);
+
+/*
+ * Print this container using printf (useful for debugging).
+ */
+void bitset_container_printf(const bitset_container_t *v);
+
+/*
+ * Print this container using printf as a comma-separated list of 32-bit
+ * integers starting at base.
+ */
+void bitset_container_printf_as_uint32_array(const bitset_container_t *v,
+    uint32_t base);
+
+bool bitset_container_validate(const bitset_container_t *v,
+    const char **reason);
+
+/**
+ * Return the serialized size in bytes of a container.
+ */
+static inline int32_t bitset_container_serialized_size_in_bytes(void) {
+    return BITSET_CONTAINER_SIZE_IN_WORDS * 8;
+}
+
+/**
+ * Return the the number of runs.
+ */
+int bitset_container_number_of_runs(bitset_container_t *bc);
+
+bool bitset_container_iterate(const bitset_container_t *cont, uint32_t base,
+    roaring_iterator iterator, void *ptr);
+bool bitset_container_iterate64(const bitset_container_t *cont, uint32_t base,
+    roaring_iterator64 iterator, uint64_t high_bits,
+    void *ptr);
+
+/**
+ * Writes the underlying array to buf, outputs how many bytes were written.
+ * This is meant to be byte-by-byte compatible with the Java and Go versions of
+ * Roaring.
+ * The number of bytes written should be
+ * bitset_container_size_in_bytes(container).
+ */
+int32_t bitset_container_write(const bitset_container_t *container, char *buf);
+
+/**
+ * Reads the instance from buf, outputs how many bytes were read.
+ * This is meant to be byte-by-byte compatible with the Java and Go versions of
+ * Roaring.
+ * The number of bytes read should be bitset_container_size_in_bytes(container).
+ * You need to provide the (known) cardinality.
+ */
+int32_t bitset_container_read(int32_t cardinality,
+    bitset_container_t *container, const char *buf);
+/**
+ * Return the serialized size in bytes of a container (see
+ * bitset_container_write).
+ * This is meant to be compatible with the Java and Go versions of Roaring and
+ * assumes
+ * that the cardinality of the container is already known or can be computed.
+ */
+static inline int32_t bitset_container_size_in_bytes(
+    const bitset_container_t *container) {
+    (void)container;
+    return BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t);
+}
+
+/**
+ * Return true if the two containers have the same content.
+ */
+bool bitset_container_equals(const bitset_container_t *container1,
+    const bitset_container_t *container2);
+
+/**
+ * Return true if container1 is a subset of container2.
+ */
+bool bitset_container_is_subset(const bitset_container_t *container1,
+    const bitset_container_t *container2);
+
+/**
+ * If the element of given rank is in this container, supposing that the first
+ * element has rank start_rank, then the function returns true and sets element
+ * accordingly.
+ * Otherwise, it returns false and update start_rank.
+ */
+bool bitset_container_select(const bitset_container_t *container,
+    uint32_t *start_rank, uint32_t rank,
+    uint32_t *element);
+
+/* Returns the smallest value (assumes not empty) */
+uint16_t bitset_container_minimum(const bitset_container_t *container);
+
+/* Returns the largest value (assumes not empty) */
+uint16_t bitset_container_maximum(const bitset_container_t *container);
+
+/* Returns the number of values equal or smaller than x */
+int bitset_container_rank(const bitset_container_t *container, uint16_t x);
+
+/* bulk version of bitset_container_rank(); return number of consumed elements
+ */
+uint32_t bitset_container_rank_many(const bitset_container_t *container,
+    uint64_t start_rank, const uint32_t *begin,
+    const uint32_t *end, uint64_t *ans);
+
+/* Returns the index of x , if not exsist return -1 */
+int bitset_container_get_index(const bitset_container_t *container, uint16_t x);
+
+/* Returns the index of the first value equal or larger than x, or -1 */
+int bitset_container_index_equalorlarger(const bitset_container_t *container,
+    uint16_t x);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif /* INCLUDE_CONTAINERS_BITSET_H_ */
+/* end file include/roaring/containers/bitset.h */
+/* begin file include/roaring/containers/run.h */
+/*
+ * run.h
+ *
+ */
+
+#ifndef INCLUDE_CONTAINERS_RUN_H_
+#define INCLUDE_CONTAINERS_RUN_H_
+
+
+// Include other headers after roaring_types.h
+#include <assert.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include <string.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+
+// Note: in pure C++ code, you should avoid putting `using` in header files
+using api::roaring_iterator;
+using api::roaring_iterator64;
+
+namespace internal {
+#endif
+
+/* struct rle16_s - run length pair
+ *
+ * @value:  start position of the run
+ * @length: length of the run is `length + 1`
+ *
+ * An RLE pair {v, l} would represent the integers between the interval
+ * [v, v+l+1], e.g. {3, 2} = [3, 4, 5].
+ */
+struct rle16_s {
+    uint16_t value;
+    uint16_t length;
+};
+
+typedef struct rle16_s rle16_t;
+
+#ifdef __cplusplus
+#define CROARING_MAKE_RLE16(val, len) \
+    { (uint16_t)(val), (uint16_t)(len) }  // no tagged structs until c++20
+#else
+#define CROARING_MAKE_RLE16(val, len) \
+    (rle16_t) { .value = (uint16_t)(val), .length = (uint16_t)(len) }
+#endif
+
+/* struct run_container_s - run container bitmap
+ *
+ * @n_runs:   number of rle_t pairs in `runs`.
+ * @capacity: capacity in rle_t pairs `runs` can hold.
+ * @runs:     pairs of rle_t.
+ */
+STRUCT_CONTAINER(run_container_s) {
+    int32_t n_runs;
+    int32_t capacity;
+    rle16_t *runs;
+};
+
+typedef struct run_container_s run_container_t;
+
+#define CAST_run(c) CAST(run_container_t *, c)  // safer downcast
+#define const_CAST_run(c) CAST(const run_container_t *, c)
+#define movable_CAST_run(c) movable_CAST(run_container_t **, c)
+
+/* Create a new run container. Return NULL in case of failure. */
+run_container_t *run_container_create(void);
+
+/* Create a new run container with given capacity. Return NULL in case of
+ * failure. */
+run_container_t *run_container_create_given_capacity(int32_t size);
+
+/*
+ * Shrink the capacity to the actual size, return the number of bytes saved.
+ */
+int run_container_shrink_to_fit(run_container_t *src);
+
+/* Free memory owned by `run'. */
+void run_container_free(run_container_t *run);
+
+/* Duplicate container */
+run_container_t *run_container_clone(const run_container_t *src);
+
+/*
+ * Effectively deletes the value at index index, repacking data.
+ */
+static inline void recoverRoomAtIndex(run_container_t *run, uint16_t index) {
+    memmove(run->runs + index, run->runs + (1 + index),
+        (run->n_runs - index - 1) * sizeof(rle16_t));
+    run->n_runs--;
+}
+
+/**
+ * Good old binary search through rle data
+ */
+inline int32_t interleavedBinarySearch(const rle16_t *array, int32_t lenarray,
+    uint16_t ikey) {
+    int32_t low = 0;
+    int32_t high = lenarray - 1;
+    while (low <= high) {
+        int32_t middleIndex = (low + high) >> 1;
+        uint16_t middleValue = array[middleIndex].value;
+        if (middleValue < ikey) {
+            low = middleIndex + 1;
+        } else if (middleValue > ikey) {
+            high = middleIndex - 1;
+        } else {
+            return middleIndex;
+        }
+    }
+    return -(low + 1);
+}
+
+/*
+ * Returns index of the run which contains $ikey
+ */
+static inline int32_t rle16_find_run(const rle16_t *array, int32_t lenarray,
+    uint16_t ikey) {
+    int32_t low = 0;
+    int32_t high = lenarray - 1;
+    while (low <= high) {
+        int32_t middleIndex = (low + high) >> 1;
+        uint16_t min = array[middleIndex].value;
+        uint16_t max = array[middleIndex].value + array[middleIndex].length;
+        if (ikey > max) {
+            low = middleIndex + 1;
+        } else if (ikey < min) {
+            high = middleIndex - 1;
+        } else {
+            return middleIndex;
+        }
+    }
+    return -(low + 1);
+}
+
+/**
+ * Returns number of runs which can'be be merged with the key because they
+ * are less than the key.
+ * Note that [5,6,7,8] can be merged with the key 9 and won't be counted.
+ */
+static inline int32_t rle16_count_less(const rle16_t *array, int32_t lenarray,
+    uint16_t key) {
+    if (lenarray == 0) return 0;
+    int32_t low = 0;
+    int32_t high = lenarray - 1;
+    while (low <= high) {
+        int32_t middleIndex = (low + high) >> 1;
+        uint16_t min_value = array[middleIndex].value;
+        uint16_t max_value =
+            array[middleIndex].value + array[middleIndex].length;
+        if (max_value + UINT32_C(1) < key) {  // uint32 arithmetic
+            low = middleIndex + 1;
+        } else if (key < min_value) {
+            high = middleIndex - 1;
+        } else {
+            return middleIndex;
+        }
+    }
+    return low;
+}
+
+static inline int32_t rle16_count_greater(const rle16_t *array,
+    int32_t lenarray, uint16_t key) {
+    if (lenarray == 0) return 0;
+    int32_t low = 0;
+    int32_t high = lenarray - 1;
+    while (low <= high) {
+        int32_t middleIndex = (low + high) >> 1;
+        uint16_t min_value = array[middleIndex].value;
+        uint16_t max_value =
+            array[middleIndex].value + array[middleIndex].length;
+        if (max_value < key) {
+            low = middleIndex + 1;
+        } else if (key + UINT32_C(1) < min_value) {  // uint32 arithmetic
+            high = middleIndex - 1;
+        } else {
+            return lenarray - (middleIndex + 1);
+        }
+    }
+    return lenarray - low;
+}
+
+/**
+ * increase capacity to at least min. Whether the
+ * existing data needs to be copied over depends on copy. If "copy" is false,
+ * then the new content will be uninitialized, otherwise a copy is made.
+ */
+void run_container_grow(run_container_t *run, int32_t min, bool copy);
+
+/**
+ * Moves the data so that we can write data at index
+ */
+static inline void makeRoomAtIndex(run_container_t *run, uint16_t index) {
+    /* This function calls realloc + memmove sequentially to move by one index.
+     * Potentially copying twice the array.
+     */
+    if (run->n_runs + 1 > run->capacity)
+        run_container_grow(run, run->n_runs + 1, true);
+    memmove(run->runs + 1 + index, run->runs + index,
+        (run->n_runs - index) * sizeof(rle16_t));
+    run->n_runs++;
+}
+
+/* Add `pos' to `run'. Returns true if `pos' was not present. */
+bool run_container_add(run_container_t *run, uint16_t pos);
+
+/* Remove `pos' from `run'. Returns true if `pos' was present. */
+static inline bool run_container_remove(run_container_t *run, uint16_t pos) {
+    int32_t index = interleavedBinarySearch(run->runs, run->n_runs, pos);
+    if (index >= 0) {
+        int32_t le = run->runs[index].length;
+        if (le == 0) {
+            recoverRoomAtIndex(run, (uint16_t)index);
+        } else {
+            run->runs[index].value++;
+            run->runs[index].length--;
+        }
+        return true;
+    }
+    index = -index - 2;  // points to preceding value, possibly -1
+    if (index >= 0) {    // possible match
+        int32_t offset = pos - run->runs[index].value;
+        int32_t le = run->runs[index].length;
+        if (offset < le) {
+            // need to break in two
+            run->runs[index].length = (uint16_t)(offset - 1);
+            // need to insert
+            uint16_t newvalue = pos + 1;
+            int32_t newlength = le - offset - 1;
+            makeRoomAtIndex(run, (uint16_t)(index + 1));
+            run->runs[index + 1].value = newvalue;
+            run->runs[index + 1].length = (uint16_t)newlength;
+            return true;
+
+        } else if (offset == le) {
+            run->runs[index].length--;
+            return true;
+        }
+    }
+    // no match
+    return false;
+}
+
+/* Check whether `pos' is present in `run'.  */
+inline bool run_container_contains(const run_container_t *run, uint16_t pos) {
+    int32_t index = interleavedBinarySearch(run->runs, run->n_runs, pos);
+    if (index >= 0) return true;
+    index = -index - 2;  // points to preceding value, possibly -1
+    if (index != -1) {   // possible match
+        int32_t offset = pos - run->runs[index].value;
+        int32_t le = run->runs[index].length;
+        if (offset <= le) return true;
+    }
+    return false;
+}
+
+/*
+ * Check whether all positions in a range of positions from pos_start (included)
+ * to pos_end (excluded) is present in `run'.
+ */
+static inline bool run_container_contains_range(const run_container_t *run,
+    uint32_t pos_start,
+    uint32_t pos_end) {
+    uint32_t count = 0;
+    int32_t index =
+        interleavedBinarySearch(run->runs, run->n_runs, (uint16_t)pos_start);
+    if (index < 0) {
+        index = -index - 2;
+        if ((index == -1) ||
+            ((pos_start - run->runs[index].value) > run->runs[index].length)) {
+            return false;
+        }
+    }
+    for (int32_t i = index; i < run->n_runs; ++i) {
+        const uint32_t stop = run->runs[i].value + run->runs[i].length;
+        if (run->runs[i].value >= pos_end) break;
+        if (stop >= pos_end) {
+            count += (((pos_end - run->runs[i].value) > 0)
+                          ? (pos_end - run->runs[i].value)
+                          : 0);
+            break;
+        }
+        const uint32_t min = (stop - pos_start) > 0 ? (stop - pos_start) : 0;
+        count += (min < run->runs[i].length) ? min : run->runs[i].length;
+    }
+    return count >= (pos_end - pos_start - 1);
+}
+
+/* Get the cardinality of `run'. Requires an actual computation. */
+int run_container_cardinality(const run_container_t *run);
+
+/* Card > 0?, see run_container_empty for the reverse */
+static inline bool run_container_nonzero_cardinality(
+    const run_container_t *run) {
+    return run->n_runs > 0;  // runs never empty
+}
+
+/* Card == 0?, see run_container_nonzero_cardinality for the reverse */
+static inline bool run_container_empty(const run_container_t *run) {
+    return run->n_runs == 0;  // runs never empty
+}
+
+/* Copy one container into another. We assume that they are distinct. */
+void run_container_copy(const run_container_t *src, run_container_t *dst);
+
+/**
+ * Append run described by vl to the run container, possibly merging.
+ * It is assumed that the run would be inserted at the end of the container, no
+ * check is made.
+ * It is assumed that the run container has the necessary capacity: caller is
+ * responsible for checking memory capacity.
+ *
+ *
+ * This is not a safe function, it is meant for performance: use with care.
+ */
+static inline void run_container_append(run_container_t *run, rle16_t vl,
+    rle16_t *previousrl) {
+    const uint32_t previousend = previousrl->value + previousrl->length;
+    if (vl.value > previousend + 1) {  // we add a new one
+        run->runs[run->n_runs] = vl;
+        run->n_runs++;
+        *previousrl = vl;
+    } else {
+        uint32_t newend = vl.value + vl.length + UINT32_C(1);
+        if (newend > previousend) {  // we merge
+            previousrl->length = (uint16_t)(newend - 1 - previousrl->value);
+            run->runs[run->n_runs - 1] = *previousrl;
+        }
+    }
+}
+
+/**
+ * Like run_container_append but it is assumed that the content of run is empty.
+ */
+static inline rle16_t run_container_append_first(run_container_t *run,
+    rle16_t vl) {
+    run->runs[run->n_runs] = vl;
+    run->n_runs++;
+    return vl;
+}
+
+/**
+ * append a single value  given by val to the run container, possibly merging.
+ * It is assumed that the value would be inserted at the end of the container,
+ * no check is made.
+ * It is assumed that the run container has the necessary capacity: caller is
+ * responsible for checking memory capacity.
+ *
+ * This is not a safe function, it is meant for performance: use with care.
+ */
+static inline void run_container_append_value(run_container_t *run,
+    uint16_t val,
+    rle16_t *previousrl) {
+    const uint32_t previousend = previousrl->value + previousrl->length;
+    if (val > previousend + 1) {  // we add a new one
+        *previousrl = CROARING_MAKE_RLE16(val, 0);
+        run->runs[run->n_runs] = *previousrl;
+        run->n_runs++;
+    } else if (val == previousend + 1) {  // we merge
+        previousrl->length++;
+        run->runs[run->n_runs - 1] = *previousrl;
+    }
+}
+
+/**
+ * Like run_container_append_value but it is assumed that the content of run is
+ * empty.
+ */
+static inline rle16_t run_container_append_value_first(run_container_t *run,
+    uint16_t val) {
+    rle16_t newrle = CROARING_MAKE_RLE16(val, 0);
+    run->runs[run->n_runs] = newrle;
+    run->n_runs++;
+    return newrle;
+}
+
+/* Check whether the container spans the whole chunk (cardinality = 1<<16).
+ * This check can be done in constant time (inexpensive). */
+static inline bool run_container_is_full(const run_container_t *run) {
+    rle16_t vl = run->runs[0];
+    return (run->n_runs == 1) && (vl.value == 0) && (vl.length == 0xFFFF);
+}
+
+/* Compute the union of `src_1' and `src_2' and write the result to `dst'
+ * It is assumed that `dst' is distinct from both `src_1' and `src_2'. */
+void run_container_union(const run_container_t *src_1,
+    const run_container_t *src_2, run_container_t *dst);
+
+/* Compute the union of `src_1' and `src_2' and write the result to `src_1' */
+void run_container_union_inplace(run_container_t *src_1,
+    const run_container_t *src_2);
+
+/* Compute the intersection of src_1 and src_2 and write the result to
+ * dst. It is assumed that dst is distinct from both src_1 and src_2. */
+void run_container_intersection(const run_container_t *src_1,
+    const run_container_t *src_2,
+    run_container_t *dst);
+
+/* Compute the size of the intersection of src_1 and src_2 . */
+int run_container_intersection_cardinality(const run_container_t *src_1,
+    const run_container_t *src_2);
+
+/* Check whether src_1 and src_2 intersect. */
+bool run_container_intersect(const run_container_t *src_1,
+    const run_container_t *src_2);
+
+/* Compute the symmetric difference of `src_1' and `src_2' and write the result
+ * to `dst'
+ * It is assumed that `dst' is distinct from both `src_1' and `src_2'. */
+void run_container_xor(const run_container_t *src_1,
+    const run_container_t *src_2, run_container_t *dst);
+
+/*
+ * Write out the 16-bit integers contained in this container as a list of 32-bit
+ * integers using base
+ * as the starting value (it might be expected that base has zeros in its 16
+ * least significant bits).
+ * The function returns the number of values written.
+ * The caller is responsible for allocating enough memory in out.
+ */
+int run_container_to_uint32_array(void *vout, const run_container_t *cont,
+    uint32_t base);
+
+/*
+ * Print this container using printf (useful for debugging).
+ */
+void run_container_printf(const run_container_t *v);
+
+/*
+ * Print this container using printf as a comma-separated list of 32-bit
+ * integers starting at base.
+ */
+void run_container_printf_as_uint32_array(const run_container_t *v,
+    uint32_t base);
+
+bool run_container_validate(const run_container_t *run, const char **reason);
+
+/**
+ * Return the serialized size in bytes of a container having "num_runs" runs.
+ */
+static inline int32_t run_container_serialized_size_in_bytes(int32_t num_runs) {
+    return sizeof(uint16_t) +
+           sizeof(rle16_t) * num_runs;  // each run requires 2 2-byte entries.
+}
+
+bool run_container_iterate(const run_container_t *cont, uint32_t base,
+    roaring_iterator iterator, void *ptr);
+bool run_container_iterate64(const run_container_t *cont, uint32_t base,
+    roaring_iterator64 iterator, uint64_t high_bits,
+    void *ptr);
+
+/**
+ * Writes the underlying array to buf, outputs how many bytes were written.
+ * This is meant to be byte-by-byte compatible with the Java and Go versions of
+ * Roaring.
+ * The number of bytes written should be run_container_size_in_bytes(container).
+ */
+int32_t run_container_write(const run_container_t *container, char *buf);
+
+/**
+ * Reads the instance from buf, outputs how many bytes were read.
+ * This is meant to be byte-by-byte compatible with the Java and Go versions of
+ * Roaring.
+ * The number of bytes read should be bitset_container_size_in_bytes(container).
+ * The cardinality parameter is provided for consistency with other containers,
+ * but
+ * it might be effectively ignored..
+ */
+int32_t run_container_read(int32_t cardinality, run_container_t *container,
+    const char *buf);
+
+/**
+ * Return the serialized size in bytes of a container (see run_container_write).
+ * This is meant to be compatible with the Java and Go versions of Roaring.
+ */
+ALLOW_UNALIGNED
+static inline int32_t run_container_size_in_bytes(
+    const run_container_t *container) {
+    return run_container_serialized_size_in_bytes(container->n_runs);
+}
+
+/**
+ * Return true if the two containers have the same content.
+ */
+ALLOW_UNALIGNED
+static inline bool run_container_equals(const run_container_t *container1,
+    const run_container_t *container2) {
+    if (container1->n_runs != container2->n_runs) {
+        return false;
+    }
+    return memequals(container1->runs, container2->runs,
+        container1->n_runs * sizeof(rle16_t));
+}
+
+/**
+ * Return true if container1 is a subset of container2.
+ */
+bool run_container_is_subset(const run_container_t *container1,
+    const run_container_t *container2);
+
+/**
+ * Used in a start-finish scan that appends segments, for XOR and NOT
+ */
+
+void run_container_smart_append_exclusive(run_container_t *src,
+    const uint16_t start,
+    const uint16_t length);
+
+/**
+ * The new container consists of a single run [start,stop).
+ * It is required that stop>start, the caller is responsability for this check.
+ * It is required that stop <= (1<<16), the caller is responsability for this
+ * check. The cardinality of the created container is stop - start. Returns NULL
+ * on failure
+ */
+static inline run_container_t *run_container_create_range(uint32_t start,
+    uint32_t stop) {
+    run_container_t *rc = run_container_create_given_capacity(1);
+    if (rc) {
+        rle16_t r;
+        r.value = (uint16_t)start;
+        r.length = (uint16_t)(stop - start - 1);
+        run_container_append_first(rc, r);
+    }
+    return rc;
+}
+
+/**
+ * If the element of given rank is in this container, supposing that the first
+ * element has rank start_rank, then the function returns true and sets element
+ * accordingly.
+ * Otherwise, it returns false and update start_rank.
+ */
+bool run_container_select(const run_container_t *container,
+    uint32_t *start_rank, uint32_t rank,
+    uint32_t *element);
+
+/* Compute the difference of src_1 and src_2 and write the result to
+ * dst. It is assumed that dst is distinct from both src_1 and src_2. */
+
+void run_container_andnot(const run_container_t *src_1,
+    const run_container_t *src_2, run_container_t *dst);
+
+void run_container_offset(const run_container_t *c, container_t **loc,
+    container_t **hic, uint16_t offset);
+
+/* Returns the smallest value (assumes not empty) */
+inline uint16_t run_container_minimum(const run_container_t *run) {
+    if (run->n_runs == 0) return 0;
+    return run->runs[0].value;
+}
+
+/* Returns the largest value (assumes not empty) */
+inline uint16_t run_container_maximum(const run_container_t *run) {
+    if (run->n_runs == 0) return 0;
+    return run->runs[run->n_runs - 1].value + run->runs[run->n_runs - 1].length;
+}
+
+/* Returns the number of values equal or smaller than x */
+int run_container_rank(const run_container_t *arr, uint16_t x);
+
+/* bulk version of run_container_rank(); return number of consumed elements */
+uint32_t run_container_rank_many(const run_container_t *arr,
+    uint64_t start_rank, const uint32_t *begin,
+    const uint32_t *end, uint64_t *ans);
+
+/* Returns the index of x, if not exsist return -1 */
+int run_container_get_index(const run_container_t *arr, uint16_t x);
+
+/* Returns the index of the first run containing a value at least as large as x,
+ * or -1 */
+inline int run_container_index_equalorlarger(const run_container_t *arr,
+    uint16_t x) {
+    int32_t index = interleavedBinarySearch(arr->runs, arr->n_runs, x);
+    if (index >= 0) return index;
+    index = -index - 2;  // points to preceding run, possibly -1
+    if (index != -1) {   // possible match
+        int32_t offset = x - arr->runs[index].value;
+        int32_t le = arr->runs[index].length;
+        if (offset <= le) return index;
+    }
+    index += 1;
+    if (index < arr->n_runs) {
+        return index;
+    }
+    return -1;
+}
+
+/*
+ * Add all values in range [min, max] using hint.
+ */
+static inline void run_container_add_range_nruns(run_container_t *run,
+    uint32_t min, uint32_t max,
+    int32_t nruns_less,
+    int32_t nruns_greater) {
+    int32_t nruns_common = run->n_runs - nruns_less - nruns_greater;
+    if (nruns_common == 0) {
+        makeRoomAtIndex(run, (uint16_t)nruns_less);
+        run->runs[nruns_less].value = (uint16_t)min;
+        run->runs[nruns_less].length = (uint16_t)(max - min);
+    } else {
+        uint32_t common_min = run->runs[nruns_less].value;
+        uint32_t common_max = run->runs[nruns_less + nruns_common - 1].value +
+                              run->runs[nruns_less + nruns_common - 1].length;
+        uint32_t result_min = (common_min < min) ? common_min : min;
+        uint32_t result_max = (common_max > max) ? common_max : max;
+
+        run->runs[nruns_less].value = (uint16_t)result_min;
+        run->runs[nruns_less].length = (uint16_t)(result_max - result_min);
+
+        memmove(&(run->runs[nruns_less + 1]),
+            &(run->runs[run->n_runs - nruns_greater]),
+            nruns_greater * sizeof(rle16_t));
+        run->n_runs = nruns_less + 1 + nruns_greater;
+    }
+}
+
+/**
+ * Add all values in range [min, max]. This function is currently unused
+ * and left as documentation.
+ */
+/*static inline void run_container_add_range(run_container_t* run,
+                                           uint32_t min, uint32_t max) {
+    int32_t nruns_greater = rle16_count_greater(run->runs, run->n_runs, max);
+    int32_t nruns_less = rle16_count_less(run->runs, run->n_runs -
+nruns_greater, min); run_container_add_range_nruns(run, min, max, nruns_less,
+nruns_greater);
+}*/
+
+/**
+ * Shifts last $count elements either left (distance < 0) or right (distance >
+ * 0)
+ */
+static inline void run_container_shift_tail(run_container_t *run, int32_t count,
+    int32_t distance) {
+    if (distance > 0) {
+        if (run->capacity < count + distance) {
+            run_container_grow(run, count + distance, true);
+        }
+    }
+    int32_t srcpos = run->n_runs - count;
+    int32_t dstpos = srcpos + distance;
+    memmove(&(run->runs[dstpos]), &(run->runs[srcpos]),
+        sizeof(rle16_t) * count);
+    run->n_runs += distance;
+}
+
+/**
+ * Remove all elements in range [min, max]
+ */
+static inline void run_container_remove_range(run_container_t *run,
+    uint32_t min, uint32_t max) {
+    int32_t first = rle16_find_run(run->runs, run->n_runs, (uint16_t)min);
+    int32_t last = rle16_find_run(run->runs, run->n_runs, (uint16_t)max);
+
+    if (first >= 0 && min > run->runs[first].value &&
+        max < ((uint32_t)run->runs[first].value +
+                  (uint32_t)run->runs[first].length)) {
+        // split this run into two adjacent runs
+
+        // right subinterval
+        makeRoomAtIndex(run, (uint16_t)(first + 1));
+        run->runs[first + 1].value = (uint16_t)(max + 1);
+        run->runs[first + 1].length =
+            (uint16_t)((run->runs[first].value + run->runs[first].length) -
+                       (max + 1));
+
+        // left subinterval
+        run->runs[first].length =
+            (uint16_t)((min - 1) - run->runs[first].value);
+
+        return;
+    }
+
+    // update left-most partial run
+    if (first >= 0) {
+        if (min > run->runs[first].value) {
+            run->runs[first].length =
+                (uint16_t)((min - 1) - run->runs[first].value);
+            first++;
+        }
+    } else {
+        first = -first - 1;
+    }
+
+    // update right-most run
+    if (last >= 0) {
+        uint16_t run_max = run->runs[last].value + run->runs[last].length;
+        if (run_max > max) {
+            run->runs[last].value = (uint16_t)(max + 1);
+            run->runs[last].length = (uint16_t)(run_max - (max + 1));
+            last--;
+        }
+    } else {
+        last = (-last - 1) - 1;
+    }
+
+    // remove intermediate runs
+    if (first <= last) {
+        run_container_shift_tail(run, run->n_runs - (last + 1),
+            -(last - first + 1));
+    }
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif /* INCLUDE_CONTAINERS_RUN_H_ */
+/* end file include/roaring/containers/run.h */
+/* begin file include/roaring/containers/convert.h */
+/*
+ * convert.h
+ *
+ */
+
+#ifndef INCLUDE_CONTAINERS_CONVERT_H_
+#define INCLUDE_CONTAINERS_CONVERT_H_
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Convert an array into a bitset. The input container is not freed or modified.
+ */
+bitset_container_t *bitset_container_from_array(const array_container_t *arr);
+
+/* Convert a run into a bitset. The input container is not freed or modified. */
+bitset_container_t *bitset_container_from_run(const run_container_t *arr);
+
+/* Convert a run into an array. The input container is not freed or modified. */
+array_container_t *array_container_from_run(const run_container_t *arr);
+
+/* Convert a bitset into an array. The input container is not freed or modified.
+ */
+array_container_t *array_container_from_bitset(const bitset_container_t *bits);
+
+/* Convert an array into a run. The input container is not freed or modified.
+ */
+run_container_t *run_container_from_array(const array_container_t *c);
+
+/* convert a run into either an array or a bitset
+ * might free the container. This does not free the input run container. */
+container_t *convert_to_bitset_or_array_container(run_container_t *rc,
+    int32_t card,
+    uint8_t *resulttype);
+
+/* convert containers to and from runcontainers, as is most space efficient.
+ * The container might be freed. */
+container_t *convert_run_optimize(container_t *c, uint8_t typecode_original,
+    uint8_t *typecode_after);
+
+/* converts a run container to either an array or a bitset, IF it saves space.
+ */
+/* If a conversion occurs, the caller is responsible to free the original
+ * container and
+ * he becomes reponsible to free the new one. */
+container_t *convert_run_to_efficient_container(run_container_t *c,
+    uint8_t *typecode_after);
+
+// like convert_run_to_efficient_container but frees the old result if needed
+container_t *convert_run_to_efficient_container_and_free(
+    run_container_t *c, uint8_t *typecode_after);
+
+/**
+ * Create new container which is a union of run container and
+ * range [min, max]. Caller is responsible for freeing run container.
+ */
+container_t *container_from_run_range(const run_container_t *run, uint32_t min,
+    uint32_t max, uint8_t *typecode_after);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif /* INCLUDE_CONTAINERS_CONVERT_H_ */
+/* end file include/roaring/containers/convert.h */
+/* begin file include/roaring/containers/mixed_equal.h */
+/*
+ * mixed_equal.h
+ *
+ */
+
+#ifndef CONTAINERS_MIXED_EQUAL_H_
+#define CONTAINERS_MIXED_EQUAL_H_
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/**
+ * Return true if the two containers have the same content.
+ */
+bool array_container_equal_bitset(const array_container_t* container1,
+    const bitset_container_t* container2);
+
+/**
+ * Return true if the two containers have the same content.
+ */
+bool run_container_equals_array(const run_container_t* container1,
+    const array_container_t* container2);
+/**
+ * Return true if the two containers have the same content.
+ */
+bool run_container_equals_bitset(const run_container_t* container1,
+    const bitset_container_t* container2);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif /* CONTAINERS_MIXED_EQUAL_H_ */
+/* end file include/roaring/containers/mixed_equal.h */
+/* begin file include/roaring/containers/mixed_subset.h */
+/*
+ * mixed_subset.h
+ *
+ */
+
+#ifndef CONTAINERS_MIXED_SUBSET_H_
+#define CONTAINERS_MIXED_SUBSET_H_
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/**
+ * Return true if container1 is a subset of container2.
+ */
+bool array_container_is_subset_bitset(const array_container_t* container1,
+    const bitset_container_t* container2);
+
+/**
+ * Return true if container1 is a subset of container2.
+ */
+bool run_container_is_subset_array(const run_container_t* container1,
+    const array_container_t* container2);
+
+/**
+ * Return true if container1 is a subset of container2.
+ */
+bool array_container_is_subset_run(const array_container_t* container1,
+    const run_container_t* container2);
+
+/**
+ * Return true if container1 is a subset of container2.
+ */
+bool run_container_is_subset_bitset(const run_container_t* container1,
+    const bitset_container_t* container2);
+
+/**
+ * Return true if container1 is a subset of container2.
+ */
+bool bitset_container_is_subset_run(const bitset_container_t* container1,
+    const run_container_t* container2);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif /* CONTAINERS_MIXED_SUBSET_H_ */
+/* end file include/roaring/containers/mixed_subset.h */
+/* begin file include/roaring/containers/mixed_andnot.h */
+/*
+ * mixed_andnot.h
+ */
+#ifndef INCLUDE_CONTAINERS_MIXED_ANDNOT_H_
+#define INCLUDE_CONTAINERS_MIXED_ANDNOT_H_
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst, a valid array container that could be the same as dst.*/
+void array_bitset_container_andnot(const array_container_t *src_1,
+    const bitset_container_t *src_2,
+    array_container_t *dst);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * src_1 */
+
+void array_bitset_container_iandnot(array_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst, which does not initially have a valid container.
+ * Return true for a bitset result; false for array
+ */
+
+bool bitset_array_container_andnot(const bitset_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+bool bitset_array_container_iandnot(bitset_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset"). dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool run_bitset_container_andnot(const run_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset"). dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool run_bitset_container_iandnot(run_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset").  dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool bitset_run_container_andnot(const bitset_container_t *src_1,
+    const run_container_t *src_2,
+    container_t **dst);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+bool bitset_run_container_iandnot(bitset_container_t *src_1,
+    const run_container_t *src_2,
+    container_t **dst);
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any type of container.
+ */
+
+int run_array_container_andnot(const run_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+int run_array_container_iandnot(run_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/* dst must be a valid array container, allowed to be src_1 */
+
+void array_run_container_andnot(const array_container_t *src_1,
+    const run_container_t *src_2,
+    array_container_t *dst);
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+void array_run_container_iandnot(array_container_t *src_1,
+    const run_container_t *src_2);
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+int run_run_container_andnot(const run_container_t *src_1,
+    const run_container_t *src_2, container_t **dst);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+int run_run_container_iandnot(run_container_t *src_1,
+    const run_container_t *src_2, container_t **dst);
+
+/*
+ * dst is a valid array container and may be the same as src_1
+ */
+
+void array_array_container_andnot(const array_container_t *src_1,
+    const array_container_t *src_2,
+    array_container_t *dst);
+
+/* inplace array-array andnot will always be able to reuse the space of
+ * src_1 */
+void array_array_container_iandnot(array_container_t *src_1,
+    const array_container_t *src_2);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially). Return value is
+ * "dst is a bitset"
+ */
+
+bool bitset_bitset_container_andnot(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+bool bitset_bitset_container_iandnot(bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif
+/* end file include/roaring/containers/mixed_andnot.h */
+/* begin file include/roaring/containers/mixed_intersection.h */
+/*
+ * mixed_intersection.h
+ *
+ */
+
+#ifndef INCLUDE_CONTAINERS_MIXED_INTERSECTION_H_
+#define INCLUDE_CONTAINERS_MIXED_INTERSECTION_H_
+
+/* These functions appear to exclude cases where the
+ * inputs have the same type and the output is guaranteed
+ * to have the same type as the inputs.  Eg, array intersection
+ */
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Compute the intersection of src_1 and src_2 and write the result to
+ * dst. It is allowed for dst to be equal to src_1. We assume that dst is a
+ * valid container. */
+void array_bitset_container_intersection(const array_container_t *src_1,
+    const bitset_container_t *src_2,
+    array_container_t *dst);
+
+/* Compute the size of the intersection of src_1 and src_2. */
+int array_bitset_container_intersection_cardinality(
+    const array_container_t *src_1, const bitset_container_t *src_2);
+
+/* Checking whether src_1 and src_2 intersect. */
+bool array_bitset_container_intersect(const array_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/*
+ * Compute the intersection between src_1 and src_2 and write the result
+ * to *dst. If the return function is true, the result is a bitset_container_t
+ * otherwise is a array_container_t. We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+bool bitset_bitset_container_intersection(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+/* Compute the intersection between src_1 and src_2 and write the result to
+ * dst. It is allowed for dst to be equal to src_1. We assume that dst is a
+ * valid container. */
+void array_run_container_intersection(const array_container_t *src_1,
+    const run_container_t *src_2,
+    array_container_t *dst);
+
+/* Compute the intersection between src_1 and src_2 and write the result to
+ * *dst. If the result is true then the result is a bitset_container_t
+ * otherwise is a array_container_t.
+ * If *dst == src_2, then an in-place intersection is attempted
+ **/
+bool run_bitset_container_intersection(const run_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+/* Compute the size of the intersection between src_1 and src_2 . */
+int array_run_container_intersection_cardinality(const array_container_t *src_1,
+    const run_container_t *src_2);
+
+/* Compute the size of the intersection  between src_1 and src_2
+ **/
+int run_bitset_container_intersection_cardinality(
+    const run_container_t *src_1, const bitset_container_t *src_2);
+
+/* Check that src_1 and src_2 intersect. */
+bool array_run_container_intersect(const array_container_t *src_1,
+    const run_container_t *src_2);
+
+/* Check that src_1 and src_2 intersect.
+ **/
+bool run_bitset_container_intersect(const run_container_t *src_1,
+    const bitset_container_t *src_2);
+
+/*
+ * Same as bitset_bitset_container_intersection except that if the output is to
+ * be a
+ * bitset_container_t, then src_1 is modified and no allocation is made.
+ * If the output is to be an array_container_t, then caller is responsible
+ * to free the container.
+ * In all cases, the result is in *dst.
+ */
+bool bitset_bitset_container_intersection_inplace(
+    bitset_container_t *src_1, const bitset_container_t *src_2,
+    container_t **dst);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif /* INCLUDE_CONTAINERS_MIXED_INTERSECTION_H_ */
+/* end file include/roaring/containers/mixed_intersection.h */
+/* begin file include/roaring/containers/mixed_negation.h */
+/*
+ * mixed_negation.h
+ *
+ */
+
+#ifndef INCLUDE_CONTAINERS_MIXED_NEGATION_H_
+#define INCLUDE_CONTAINERS_MIXED_NEGATION_H_
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Negation across the entire range of the container.
+ * Compute the  negation of src  and write the result
+ * to *dst. The complement of a
+ * sufficiently sparse set will always be dense and a hence a bitmap
+ * We assume that dst is pre-allocated and a valid bitset container
+ * There can be no in-place version.
+ */
+void array_container_negation(const array_container_t *src,
+    bitset_container_t *dst);
+
+/* Negation across the entire range of the container
+ * Compute the  negation of src  and write the result
+ * to *dst.  A true return value indicates a bitset result,
+ * otherwise the result is an array container.
+ *  We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+bool bitset_container_negation(const bitset_container_t *src,
+    container_t **dst);
+
+/* inplace version */
+/*
+ * Same as bitset_container_negation except that if the output is to
+ * be a
+ * bitset_container_t, then src is modified and no allocation is made.
+ * If the output is to be an array_container_t, then caller is responsible
+ * to free the container.
+ * In all cases, the result is in *dst.
+ */
+bool bitset_container_negation_inplace(bitset_container_t *src,
+    container_t **dst);
+
+/* Negation across the entire range of container
+ * Compute the  negation of src  and write the result
+ * to *dst.
+ * Return values are the *_TYPECODES as defined * in containers.h
+ *  We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+int run_container_negation(const run_container_t *src, container_t **dst);
+
+/*
+ * Same as run_container_negation except that if the output is to
+ * be a
+ * run_container_t, and has the capacity to hold the result,
+ * then src is modified and no allocation is made.
+ * In all cases, the result is in *dst.
+ */
+int run_container_negation_inplace(run_container_t *src, container_t **dst);
+
+/* Negation across a range of the container.
+ * Compute the  negation of src  and write the result
+ * to *dst. Returns true if the result is a bitset container
+ * and false for an array container.  *dst is not preallocated.
+ */
+bool array_container_negation_range(const array_container_t *src,
+    const int range_start, const int range_end,
+    container_t **dst);
+
+/* Even when the result would fit, it is unclear how to make an
+ * inplace version without inefficient copying.  Thus this routine
+ * may be a wrapper for the non-in-place version
+ */
+bool array_container_negation_range_inplace(array_container_t *src,
+    const int range_start,
+    const int range_end,
+    container_t **dst);
+
+/* Negation across a range of the container
+ * Compute the  negation of src  and write the result
+ * to *dst.  A true return value indicates a bitset result,
+ * otherwise the result is an array container.
+ *  We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+bool bitset_container_negation_range(const bitset_container_t *src,
+    const int range_start, const int range_end,
+    container_t **dst);
+
+/* inplace version */
+/*
+ * Same as bitset_container_negation except that if the output is to
+ * be a
+ * bitset_container_t, then src is modified and no allocation is made.
+ * If the output is to be an array_container_t, then caller is responsible
+ * to free the container.
+ * In all cases, the result is in *dst.
+ */
+bool bitset_container_negation_range_inplace(bitset_container_t *src,
+    const int range_start,
+    const int range_end,
+    container_t **dst);
+
+/* Negation across a range of container
+ * Compute the  negation of src  and write the result
+ * to *dst.  Return values are the *_TYPECODES as defined * in containers.h
+ *  We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+int run_container_negation_range(const run_container_t *src,
+    const int range_start, const int range_end,
+    container_t **dst);
+
+/*
+ * Same as run_container_negation except that if the output is to
+ * be a
+ * run_container_t, and has the capacity to hold the result,
+ * then src is modified and no allocation is made.
+ * In all cases, the result is in *dst.
+ */
+int run_container_negation_range_inplace(run_container_t *src,
+    const int range_start,
+    const int range_end,
+    container_t **dst);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif /* INCLUDE_CONTAINERS_MIXED_NEGATION_H_ */
+/* end file include/roaring/containers/mixed_negation.h */
+/* begin file include/roaring/containers/mixed_union.h */
+/*
+ * mixed_intersection.h
+ *
+ */
+
+#ifndef INCLUDE_CONTAINERS_MIXED_UNION_H_
+#define INCLUDE_CONTAINERS_MIXED_UNION_H_
+
+/* These functions appear to exclude cases where the
+ * inputs have the same type and the output is guaranteed
+ * to have the same type as the inputs.  Eg, bitset unions
+ */
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Compute the union of src_1 and src_2 and write the result to
+ * dst. It is allowed for src_2 to be dst.   */
+void array_bitset_container_union(const array_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Compute the union of src_1 and src_2 and write the result to
+ * dst. It is allowed for src_2 to be dst.  This version does not
+ * update the cardinality of dst (it is set to BITSET_UNKNOWN_CARDINALITY). */
+void array_bitset_container_lazy_union(const array_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/*
+ * Compute the union between src_1 and src_2 and write the result
+ * to *dst. If the return function is true, the result is a bitset_container_t
+ * otherwise is a array_container_t. We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+bool array_array_container_union(const array_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/*
+ * Compute the union between src_1 and src_2 and write the result
+ * to *dst if it cannot be written to src_1. If the return function is true,
+ * the result is a bitset_container_t
+ * otherwise is a array_container_t. When the result is an array_container_t, it
+ * it either written to src_1 (if *dst is null) or to *dst.
+ * If the result is a bitset_container_t and *dst is null, then there was a
+ * failure.
+ */
+bool array_array_container_inplace_union(array_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/*
+ * Same as array_array_container_union except that it will more eagerly produce
+ * a bitset.
+ */
+bool array_array_container_lazy_union(const array_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/*
+ * Same as array_array_container_inplace_union except that it will more eagerly
+ * produce a bitset.
+ */
+bool array_array_container_lazy_inplace_union(array_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/* Compute the union of src_1 and src_2 and write the result to
+ * dst. We assume that dst is a
+ * valid container. The result might need to be further converted to array or
+ * bitset container,
+ * the caller is responsible for the eventual conversion. */
+void array_run_container_union(const array_container_t *src_1,
+    const run_container_t *src_2,
+    run_container_t *dst);
+
+/* Compute the union of src_1 and src_2 and write the result to
+ * src2. The result might need to be further converted to array or
+ * bitset container,
+ * the caller is responsible for the eventual conversion. */
+void array_run_container_inplace_union(const array_container_t *src_1,
+    run_container_t *src_2);
+
+/* Compute the union of src_1 and src_2 and write the result to
+ * dst. It is allowed for dst to be src_2.
+ * If run_container_is_full(src_1) is true, you must not be calling this
+ *function.
+ **/
+void run_bitset_container_union(const run_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* Compute the union of src_1 and src_2 and write the result to
+ * dst. It is allowed for dst to be src_2.  This version does not
+ * update the cardinality of dst (it is set to BITSET_UNKNOWN_CARDINALITY).
+ * If run_container_is_full(src_1) is true, you must not be calling this
+ * function.
+ * */
+void run_bitset_container_lazy_union(const run_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif /* INCLUDE_CONTAINERS_MIXED_UNION_H_ */
+/* end file include/roaring/containers/mixed_union.h */
+/* begin file include/roaring/containers/mixed_xor.h */
+/*
+ * mixed_xor.h
+ *
+ */
+
+#ifndef INCLUDE_CONTAINERS_MIXED_XOR_H_
+#define INCLUDE_CONTAINERS_MIXED_XOR_H_
+
+/* These functions appear to exclude cases where the
+ * inputs have the same type and the output is guaranteed
+ * to have the same type as the inputs.  Eg, bitset unions
+ */
+
+/*
+ * Java implementation (as of May 2016) for array_run, run_run
+ * and  bitset_run don't do anything different for inplace.
+ * (They are not truly in place.)
+ */
+
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst (which has no container initially).
+ * Result is true iff dst is a bitset  */
+bool array_bitset_container_xor(const array_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst. It is allowed for src_2 to be dst.  This version does not
+ * update the cardinality of dst (it is set to BITSET_UNKNOWN_CARDINALITY).
+ */
+
+void array_bitset_container_lazy_xor(const array_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst (which has no container initially). Return value is
+ * "dst is a bitset"
+ */
+
+bool bitset_bitset_container_xor(const bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset"). dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool run_bitset_container_xor(const run_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+/* lazy xor.  Dst is initialized and may be equal to src_2.
+ *  Result is left as a bitset container, even if actual
+ *  cardinality would dictate an array container.
+ */
+
+void run_bitset_container_lazy_xor(const run_container_t *src_1,
+    const bitset_container_t *src_2,
+    bitset_container_t *dst);
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+int array_run_container_xor(const array_container_t *src_1,
+    const run_container_t *src_2, container_t **dst);
+
+/* dst does not initially have a valid container.  Creates either
+ * an array or a bitset container, indicated by return code
+ */
+
+bool array_array_container_xor(const array_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/* dst does not initially have a valid container.  Creates either
+ * an array or a bitset container, indicated by return code.
+ * A bitset container will not have a valid cardinality and the
+ * container type might not be correct for the actual cardinality
+ */
+
+bool array_array_container_lazy_xor(const array_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+/* Dst is a valid run container. (Can it be src_2? Let's say not.)
+ * Leaves result as run container, even if other options are
+ * smaller.
+ */
+
+void array_run_container_lazy_xor(const array_container_t *src_1,
+    const run_container_t *src_2,
+    run_container_t *dst);
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+int run_run_container_xor(const run_container_t *src_1,
+    const run_container_t *src_2, container_t **dst);
+
+/* INPLACE versions (initial implementation may not exploit all inplace
+ * opportunities (if any...)
+ */
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+bool bitset_array_container_ixor(bitset_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+bool bitset_bitset_container_ixor(bitset_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+bool array_bitset_container_ixor(array_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset"). dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool run_bitset_container_ixor(run_container_t *src_1,
+    const bitset_container_t *src_2,
+    container_t **dst);
+
+bool bitset_run_container_ixor(bitset_container_t *src_1,
+    const run_container_t *src_2, container_t **dst);
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+int array_run_container_ixor(array_container_t *src_1,
+    const run_container_t *src_2, container_t **dst);
+
+int run_array_container_ixor(run_container_t *src_1,
+    const array_container_t *src_2, container_t **dst);
+
+bool array_array_container_ixor(array_container_t *src_1,
+    const array_container_t *src_2,
+    container_t **dst);
+
+int run_run_container_ixor(run_container_t *src_1, const run_container_t *src_2,
+    container_t **dst);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif
+/* end file include/roaring/containers/mixed_xor.h */
+/* begin file include/roaring/containers/containers.h */
+#ifndef CONTAINERS_CONTAINERS_H
+#define CONTAINERS_CONTAINERS_H
+
+#include <assert.h>
+#include <stdbool.h>
+#include <stdio.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+// would enum be possible or better?
+
+/**
+ * The switch case statements follow
+ * BITSET_CONTAINER_TYPE -- ARRAY_CONTAINER_TYPE -- RUN_CONTAINER_TYPE
+ * so it makes more sense to number them 1, 2, 3 (in the vague hope that the
+ * compiler might exploit this ordering).
+ */
+
+#define BITSET_CONTAINER_TYPE 1
+#define ARRAY_CONTAINER_TYPE 2
+#define RUN_CONTAINER_TYPE 3
+#define SHARED_CONTAINER_TYPE 4
+
+/**
+ * Macros for pairing container type codes, suitable for switch statements.
+ * Use PAIR_CONTAINER_TYPES() for the switch, CONTAINER_PAIR() for the cases:
+ *
+ *     switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+ *        case CONTAINER_PAIR(BITSET,ARRAY):
+ *        ...
+ *     }
+ */
+#define PAIR_CONTAINER_TYPES(type1, type2) (4 * (type1) + (type2))
+
+#define CONTAINER_PAIR(name1, name2) \
+    (4 * (name1##_CONTAINER_TYPE) + (name2##_CONTAINER_TYPE))
+
+/**
+ * A shared container is a wrapper around a container
+ * with reference counting.
+ */
+STRUCT_CONTAINER(shared_container_s) {
+    container_t *container;
+    uint8_t typecode;
+    croaring_refcount_t counter;  // to be managed atomically
+};
+
+typedef struct shared_container_s shared_container_t;
+
+#define CAST_shared(c) CAST(shared_container_t *, c)  // safer downcast
+#define const_CAST_shared(c) CAST(const shared_container_t *, c)
+#define movable_CAST_shared(c) movable_CAST(shared_container_t **, c)
+
+/*
+ * With copy_on_write = true
+ *  Create a new shared container if the typecode is not SHARED_CONTAINER_TYPE,
+ * otherwise, increase the count
+ * If copy_on_write = false, then clone.
+ * Return NULL in case of failure.
+ **/
+container_t *get_copy_of_container(container_t *container, uint8_t *typecode,
+    bool copy_on_write);
+
+/* Frees a shared container (actually decrement its counter and only frees when
+ * the counter falls to zero). */
+void shared_container_free(shared_container_t *container);
+
+/* extract a copy from the shared container, freeing the shared container if
+there is just one instance left,
+clone instances when the counter is higher than one
+*/
+container_t *shared_container_extract_copy(shared_container_t *container,
+    uint8_t *typecode);
+
+/* access to container underneath */
+static inline const container_t *container_unwrap_shared(
+    const container_t *candidate_shared_container, uint8_t *type) {
+    if (*type == SHARED_CONTAINER_TYPE) {
+        *type = const_CAST_shared(candidate_shared_container)->typecode;
+        assert(*type != SHARED_CONTAINER_TYPE);
+        return const_CAST_shared(candidate_shared_container)->container;
+    } else {
+        return candidate_shared_container;
+    }
+}
+
+/* access to container underneath */
+static inline container_t *container_mutable_unwrap_shared(container_t *c,
+    uint8_t *type) {
+    if (*type == SHARED_CONTAINER_TYPE) {  // the passed in container is shared
+        *type = CAST_shared(c)->typecode;
+        assert(*type != SHARED_CONTAINER_TYPE);
+        return CAST_shared(c)->container;  // return the enclosed container
+    } else {
+        return c;  // wasn't shared, so return as-is
+    }
+}
+
+/* access to container underneath and queries its type */
+static inline uint8_t get_container_type(const container_t *c, uint8_t type) {
+    if (type == SHARED_CONTAINER_TYPE) {
+        return const_CAST_shared(c)->typecode;
+    } else {
+        return type;
+    }
+}
+
+/**
+ * Copies a container, requires a typecode. This allocates new memory, caller
+ * is responsible for deallocation. If the container is not shared, then it is
+ * physically cloned. Sharable containers are not cloneable.
+ */
+container_t *container_clone(const container_t *container, uint8_t typecode);
+
+/* access to container underneath, cloning it if needed */
+static inline container_t *get_writable_copy_if_shared(container_t *c,
+    uint8_t *type) {
+    if (*type == SHARED_CONTAINER_TYPE) {  // shared, return enclosed container
+        return shared_container_extract_copy(CAST_shared(c), type);
+    } else {
+        return c;  // not shared, so return as-is
+    }
+}
+
+/**
+ * End of shared container code
+ */
+
+static const char *container_names[] = {"bitset", "array", "run", "shared"};
+static const char *shared_container_names[] = {
+    "bitset (shared)", "array (shared)", "run (shared)"};
+
+// no matter what the initial container was, convert it to a bitset
+// if a new container is produced, caller responsible for freeing the previous
+// one
+// container should not be a shared container
+static inline bitset_container_t *container_to_bitset(container_t *c,
+    uint8_t typecode) {
+    bitset_container_t *result = NULL;
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return CAST_bitset(c);  // nothing to do
+    case ARRAY_CONTAINER_TYPE:
+        result = bitset_container_from_array(CAST_array(c));
+        return result;
+    case RUN_CONTAINER_TYPE:
+        result = bitset_container_from_run(CAST_run(c));
+        return result;
+    case SHARED_CONTAINER_TYPE:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;  // unreached
+}
+
+/**
+ * Get the container name from the typecode
+ * (unused at time of writing)
+ */
+/*static inline const char *get_container_name(uint8_t typecode) {
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE:
+            return container_names[0];
+        case ARRAY_CONTAINER_TYPE:
+            return container_names[1];
+        case RUN_CONTAINER_TYPE:
+            return container_names[2];
+        case SHARED_CONTAINER_TYPE:
+            return container_names[3];
+        default:
+            assert(false);
+            roaring_unreachable;
+            return "unknown";
+    }
+}*/
+
+static inline const char *get_full_container_name(const container_t *c,
+    uint8_t typecode) {
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return container_names[0];
+    case ARRAY_CONTAINER_TYPE:
+        return container_names[1];
+    case RUN_CONTAINER_TYPE:
+        return container_names[2];
+    case SHARED_CONTAINER_TYPE:
+        switch (const_CAST_shared(c)->typecode) {
+        case BITSET_CONTAINER_TYPE:
+            return shared_container_names[0];
+        case ARRAY_CONTAINER_TYPE:
+            return shared_container_names[1];
+        case RUN_CONTAINER_TYPE:
+            return shared_container_names[2];
+        default:
+            assert(false);
+            roaring_unreachable;
+            return "unknown";
+        }
+        break;
+    default:
+        assert(false);
+        roaring_unreachable;
+        return "unknown";
+    }
+    roaring_unreachable;
+    return NULL;
+}
+
+/**
+ * Get the container cardinality (number of elements), requires a  typecode
+ */
+static inline int container_get_cardinality(const container_t *c,
+    uint8_t typecode) {
+    c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_cardinality(const_CAST_bitset(c));
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_cardinality(const_CAST_array(c));
+    case RUN_CONTAINER_TYPE:
+        return run_container_cardinality(const_CAST_run(c));
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;  // unreached
+}
+
+// returns true if a container is known to be full. Note that a lazy bitset
+// container
+// might be full without us knowing
+static inline bool container_is_full(const container_t *c, uint8_t typecode) {
+    c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_cardinality(const_CAST_bitset(c)) ==
+               (1 << 16);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_cardinality(const_CAST_array(c)) ==
+               (1 << 16);
+    case RUN_CONTAINER_TYPE:
+        return run_container_is_full(const_CAST_run(c));
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;  // unreached
+}
+
+static inline int container_shrink_to_fit(container_t *c, uint8_t type) {
+    c = container_mutable_unwrap_shared(c, &type);
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        return 0;  // no shrinking possible
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_shrink_to_fit(CAST_array(c));
+    case RUN_CONTAINER_TYPE:
+        return run_container_shrink_to_fit(CAST_run(c));
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;  // unreached
+}
+
+/**
+ * make a container with a run of ones
+ */
+/* initially always use a run container, even if an array might be
+ * marginally
+ * smaller */
+static inline container_t *container_range_of_ones(uint32_t range_start,
+    uint32_t range_end,
+    uint8_t *result_type) {
+    assert(range_end >= range_start);
+    uint64_t cardinality = range_end - range_start + 1;
+    if (cardinality <= 2) {
+        *result_type = ARRAY_CONTAINER_TYPE;
+        return array_container_create_range(range_start, range_end);
+    } else {
+        *result_type = RUN_CONTAINER_TYPE;
+        return run_container_create_range(range_start, range_end);
+    }
+}
+
+/*  Create a container with all the values between in [min,max) at a
+    distance k*step from min. */
+static inline container_t *container_from_range(uint8_t *type, uint32_t min,
+    uint32_t max, uint16_t step) {
+    if (step == 0) return NULL;  // being paranoid
+    if (step == 1) {
+        return container_range_of_ones(min, max, type);
+        // Note: the result is not always a run (need to check the cardinality)
+        //*type = RUN_CONTAINER_TYPE;
+        // return run_container_create_range(min, max);
+    }
+    int size = (max - min + step - 1) / step;
+    if (size <= DEFAULT_MAX_SIZE) {  // array container
+        *type = ARRAY_CONTAINER_TYPE;
+        array_container_t *array = array_container_create_given_capacity(size);
+        array_container_add_from_range(array, min, max, step);
+        assert(array->cardinality == size);
+        return array;
+    } else {  // bitset container
+        *type = BITSET_CONTAINER_TYPE;
+        bitset_container_t *bitset = bitset_container_create();
+        bitset_container_add_from_range(bitset, min, max, step);
+        assert(bitset->cardinality == size);
+        return bitset;
+    }
+}
+
+/**
+ * "repair" the container after lazy operations.
+ */
+static inline container_t *container_repair_after_lazy(container_t *c,
+    uint8_t *type) {
+    c = get_writable_copy_if_shared(c, type);  // !!! unnecessary cloning
+    container_t *result = NULL;
+    switch (*type) {
+    case BITSET_CONTAINER_TYPE: {
+        bitset_container_t *bc = CAST_bitset(c);
+        bc->cardinality = bitset_container_compute_cardinality(bc);
+        if (bc->cardinality <= DEFAULT_MAX_SIZE) {
+            result = array_container_from_bitset(bc);
+            bitset_container_free(bc);
+            *type = ARRAY_CONTAINER_TYPE;
+            return result;
+        }
+        return c;
+    }
+    case ARRAY_CONTAINER_TYPE:
+        return c;  // nothing to do
+    case RUN_CONTAINER_TYPE:
+        return convert_run_to_efficient_container_and_free(CAST_run(c),
+            type);
+    case SHARED_CONTAINER_TYPE:
+        assert(false);
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;  // unreached
+}
+
+/**
+ * Writes the underlying array to buf, outputs how many bytes were written.
+ * This is meant to be byte-by-byte compatible with the Java and Go versions of
+ * Roaring.
+ * The number of bytes written should be
+ * container_write(container, buf).
+ *
+ */
+static inline int32_t container_write(const container_t *c, uint8_t typecode,
+    char *buf) {
+    c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_write(const_CAST_bitset(c), buf);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_write(const_CAST_array(c), buf);
+    case RUN_CONTAINER_TYPE:
+        return run_container_write(const_CAST_run(c), buf);
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;  // unreached
+}
+
+/**
+ * Get the container size in bytes under portable serialization (see
+ * container_write), requires a
+ * typecode
+ */
+static inline int32_t container_size_in_bytes(const container_t *c,
+    uint8_t typecode) {
+    c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_size_in_bytes(const_CAST_bitset(c));
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_size_in_bytes(const_CAST_array(c));
+    case RUN_CONTAINER_TYPE:
+        return run_container_size_in_bytes(const_CAST_run(c));
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;  // unreached
+}
+
+/**
+ * print the container (useful for debugging), requires a  typecode
+ */
+void container_printf(const container_t *container, uint8_t typecode);
+
+/**
+ * print the content of the container as a comma-separated list of 32-bit values
+ * starting at base, requires a  typecode
+ */
+void container_printf_as_uint32_array(const container_t *container,
+    uint8_t typecode, uint32_t base);
+
+bool container_internal_validate(const container_t *container, uint8_t typecode,
+    const char **reason);
+
+/**
+ * Checks whether a container is not empty, requires a  typecode
+ */
+static inline bool container_nonzero_cardinality(const container_t *c,
+    uint8_t typecode) {
+    c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_const_nonzero_cardinality(
+            const_CAST_bitset(c));
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_nonzero_cardinality(const_CAST_array(c));
+    case RUN_CONTAINER_TYPE:
+        return run_container_nonzero_cardinality(const_CAST_run(c));
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;  // unreached
+}
+
+/**
+ * Recover memory from a container, requires a  typecode
+ */
+void container_free(container_t *container, uint8_t typecode);
+
+/**
+ * Convert a container to an array of values, requires a  typecode as well as a
+ * "base" (most significant values)
+ * Returns number of ints added.
+ */
+static inline int container_to_uint32_array(uint32_t *output,
+    const container_t *c,
+    uint8_t typecode, uint32_t base) {
+    c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_to_uint32_array(output,
+            const_CAST_bitset(c), base);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_to_uint32_array(output, const_CAST_array(c),
+            base);
+    case RUN_CONTAINER_TYPE:
+        return run_container_to_uint32_array(output, const_CAST_run(c),
+            base);
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;  // unreached
+}
+
+/**
+ * Add a value to a container, requires a  typecode, fills in new_typecode and
+ * return (possibly different) container.
+ * This function may allocate a new container, and caller is responsible for
+ * memory deallocation
+ */
+static inline container_t *container_add(
+    container_t *c, uint16_t val,
+    uint8_t typecode,  // !!! should be second argument?
+    uint8_t *new_typecode) {
+    c = get_writable_copy_if_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        bitset_container_set(CAST_bitset(c), val);
+        *new_typecode = BITSET_CONTAINER_TYPE;
+        return c;
+    case ARRAY_CONTAINER_TYPE: {
+        array_container_t *ac = CAST_array(c);
+        if (array_container_try_add(ac, val, DEFAULT_MAX_SIZE) != -1) {
+            *new_typecode = ARRAY_CONTAINER_TYPE;
+            return ac;
+        } else {
+            bitset_container_t *bitset = bitset_container_from_array(ac);
+            bitset_container_add(bitset, val);
+            *new_typecode = BITSET_CONTAINER_TYPE;
+            return bitset;
+        }
+    } break;
+    case RUN_CONTAINER_TYPE:
+        // per Java, no container type adjustments are done (revisit?)
+        run_container_add(CAST_run(c), val);
+        *new_typecode = RUN_CONTAINER_TYPE;
+        return c;
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;
+    }
+}
+
+/**
+ * Remove a value from a container, requires a  typecode, fills in new_typecode
+ * and
+ * return (possibly different) container.
+ * This function may allocate a new container, and caller is responsible for
+ * memory deallocation
+ */
+static inline container_t *container_remove(
+    container_t *c, uint16_t val,
+    uint8_t typecode,  // !!! should be second argument?
+    uint8_t *new_typecode) {
+    c = get_writable_copy_if_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        if (bitset_container_remove(CAST_bitset(c), val)) {
+            int card = bitset_container_cardinality(CAST_bitset(c));
+            if (card <= DEFAULT_MAX_SIZE) {
+                *new_typecode = ARRAY_CONTAINER_TYPE;
+                return array_container_from_bitset(CAST_bitset(c));
+            }
+        }
+        *new_typecode = typecode;
+        return c;
+    case ARRAY_CONTAINER_TYPE:
+        *new_typecode = typecode;
+        array_container_remove(CAST_array(c), val);
+        return c;
+    case RUN_CONTAINER_TYPE:
+        // per Java, no container type adjustments are done (revisit?)
+        run_container_remove(CAST_run(c), val);
+        *new_typecode = RUN_CONTAINER_TYPE;
+        return c;
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;
+    }
+}
+
+/**
+ * Check whether a value is in a container, requires a  typecode
+ */
+static inline bool container_contains(
+    const container_t *c, uint16_t val,
+    uint8_t typecode  // !!! should be second argument?
+) {
+    c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_get(const_CAST_bitset(c), val);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_contains(const_CAST_array(c), val);
+    case RUN_CONTAINER_TYPE:
+        return run_container_contains(const_CAST_run(c), val);
+    default:
+        assert(false);
+        roaring_unreachable;
+        return false;
+    }
+}
+
+/**
+ * Check whether a range of values from range_start (included) to range_end
+ * (excluded) is in a container, requires a typecode
+ */
+static inline bool container_contains_range(
+    const container_t *c, uint32_t range_start, uint32_t range_end,
+    uint8_t typecode  // !!! should be second argument?
+) {
+    c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_get_range(const_CAST_bitset(c), range_start,
+            range_end);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_contains_range(const_CAST_array(c),
+            range_start, range_end);
+    case RUN_CONTAINER_TYPE:
+        return run_container_contains_range(const_CAST_run(c), range_start,
+            range_end);
+    default:
+        assert(false);
+        roaring_unreachable;
+        return false;
+    }
+}
+
+/**
+ * Returns true if the two containers have the same content. Note that
+ * two containers having different types can be "equal" in this sense.
+ */
+static inline bool container_equals(const container_t *c1, uint8_t type1,
+    const container_t *c2, uint8_t type2) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        return bitset_container_equals(const_CAST_bitset(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        return run_container_equals_bitset(const_CAST_run(c2),
+            const_CAST_bitset(c1));
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        return run_container_equals_bitset(const_CAST_run(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        // java would always return false?
+        return array_container_equal_bitset(const_CAST_array(c2),
+            const_CAST_bitset(c1));
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        // java would always return false?
+        return array_container_equal_bitset(const_CAST_array(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        return run_container_equals_array(const_CAST_run(c2),
+            const_CAST_array(c1));
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        return run_container_equals_array(const_CAST_run(c1),
+            const_CAST_array(c2));
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        return array_container_equals(const_CAST_array(c1),
+            const_CAST_array(c2));
+
+    case CONTAINER_PAIR(RUN, RUN):
+        return run_container_equals(const_CAST_run(c1), const_CAST_run(c2));
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return false;
+    }
+}
+
+/**
+ * Returns true if the container c1 is a subset of the container c2. Note that
+ * c1 can be a subset of c2 even if they have a different type.
+ */
+static inline bool container_is_subset(const container_t *c1, uint8_t type1,
+    const container_t *c2, uint8_t type2) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        return bitset_container_is_subset(const_CAST_bitset(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        return bitset_container_is_subset_run(const_CAST_bitset(c1),
+            const_CAST_run(c2));
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        return run_container_is_subset_bitset(const_CAST_run(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        return false;  // by construction, size(c1) > size(c2)
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        return array_container_is_subset_bitset(const_CAST_array(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        return array_container_is_subset_run(const_CAST_array(c1),
+            const_CAST_run(c2));
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        return run_container_is_subset_array(const_CAST_run(c1),
+            const_CAST_array(c2));
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        return array_container_is_subset(const_CAST_array(c1),
+            const_CAST_array(c2));
+
+    case CONTAINER_PAIR(RUN, RUN):
+        return run_container_is_subset(const_CAST_run(c1),
+            const_CAST_run(c2));
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return false;
+    }
+}
+
+// macro-izations possibilities for generic non-inplace binary-op dispatch
+
+/**
+ * Compute intersection between two containers, generate a new container (having
+ * type result_type), requires a typecode. This allocates new memory, caller
+ * is responsible for deallocation.
+ */
+static inline container_t *container_and(const container_t *c1, uint8_t type1,
+    const container_t *c2, uint8_t type2,
+    uint8_t *result_type) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        *result_type =
+            bitset_bitset_container_intersection(
+                const_CAST_bitset(c1), const_CAST_bitset(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        result = array_container_create();
+        array_container_intersection(
+            const_CAST_array(c1), const_CAST_array(c2), CAST_array(result));
+        *result_type = ARRAY_CONTAINER_TYPE;  // never bitset
+        return result;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        result = run_container_create();
+        run_container_intersection(const_CAST_run(c1), const_CAST_run(c2),
+            CAST_run(result));
+        return convert_run_to_efficient_container_and_free(CAST_run(result),
+            result_type);
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        result = array_container_create();
+        array_bitset_container_intersection(const_CAST_array(c2),
+            const_CAST_bitset(c1),
+            CAST_array(result));
+        *result_type = ARRAY_CONTAINER_TYPE;  // never bitset
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        result = array_container_create();
+        *result_type = ARRAY_CONTAINER_TYPE;  // never bitset
+        array_bitset_container_intersection(const_CAST_array(c1),
+            const_CAST_bitset(c2),
+            CAST_array(result));
+        return result;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        *result_type =
+            run_bitset_container_intersection(
+                const_CAST_run(c2), const_CAST_bitset(c1), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        *result_type =
+            run_bitset_container_intersection(
+                const_CAST_run(c1), const_CAST_bitset(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        result = array_container_create();
+        *result_type = ARRAY_CONTAINER_TYPE;  // never bitset
+        array_run_container_intersection(
+            const_CAST_array(c1), const_CAST_run(c2), CAST_array(result));
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        result = array_container_create();
+        *result_type = ARRAY_CONTAINER_TYPE;  // never bitset
+        array_run_container_intersection(
+            const_CAST_array(c2), const_CAST_run(c1), CAST_array(result));
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;
+    }
+}
+
+/**
+ * Compute the size of the intersection between two containers.
+ */
+static inline int container_and_cardinality(const container_t *c1,
+    uint8_t type1,
+    const container_t *c2,
+    uint8_t type2) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        return bitset_container_and_justcard(const_CAST_bitset(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        return array_container_intersection_cardinality(
+            const_CAST_array(c1), const_CAST_array(c2));
+
+    case CONTAINER_PAIR(RUN, RUN):
+        return run_container_intersection_cardinality(const_CAST_run(c1),
+            const_CAST_run(c2));
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        return array_bitset_container_intersection_cardinality(
+            const_CAST_array(c2), const_CAST_bitset(c1));
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        return array_bitset_container_intersection_cardinality(
+            const_CAST_array(c1), const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        return run_bitset_container_intersection_cardinality(
+            const_CAST_run(c2), const_CAST_bitset(c1));
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        return run_bitset_container_intersection_cardinality(
+            const_CAST_run(c1), const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        return array_run_container_intersection_cardinality(
+            const_CAST_array(c1), const_CAST_run(c2));
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        return array_run_container_intersection_cardinality(
+            const_CAST_array(c2), const_CAST_run(c1));
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return 0;
+    }
+}
+
+/**
+ * Check whether two containers intersect.
+ */
+static inline bool container_intersect(const container_t *c1, uint8_t type1,
+    const container_t *c2, uint8_t type2) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        return bitset_container_intersect(const_CAST_bitset(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        return array_container_intersect(const_CAST_array(c1),
+            const_CAST_array(c2));
+
+    case CONTAINER_PAIR(RUN, RUN):
+        return run_container_intersect(const_CAST_run(c1),
+            const_CAST_run(c2));
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        return array_bitset_container_intersect(const_CAST_array(c2),
+            const_CAST_bitset(c1));
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        return array_bitset_container_intersect(const_CAST_array(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        return run_bitset_container_intersect(const_CAST_run(c2),
+            const_CAST_bitset(c1));
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        return run_bitset_container_intersect(const_CAST_run(c1),
+            const_CAST_bitset(c2));
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        return array_run_container_intersect(const_CAST_array(c1),
+            const_CAST_run(c2));
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        return array_run_container_intersect(const_CAST_array(c2),
+            const_CAST_run(c1));
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return 0;
+    }
+}
+
+/**
+ * Compute intersection between two containers, with result in the first
+ container if possible. If the returned pointer is identical to c1,
+ then the container has been modified. If the returned pointer is different
+ from c1, then a new container has been created and the caller is responsible
+ for freeing it.
+ The type of the first container may change. Returns the modified
+ (and possibly new) container.
+*/
+static inline container_t *container_iand(container_t *c1, uint8_t type1,
+    const container_t *c2, uint8_t type2,
+    uint8_t *result_type) {
+    c1 = get_writable_copy_if_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        *result_type = bitset_bitset_container_intersection_inplace(
+                           CAST_bitset(c1), const_CAST_bitset(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        array_container_intersection_inplace(CAST_array(c1),
+            const_CAST_array(c2));
+        *result_type = ARRAY_CONTAINER_TYPE;
+        return c1;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        result = run_container_create();
+        run_container_intersection(const_CAST_run(c1), const_CAST_run(c2),
+            CAST_run(result));
+        // as of January 2016, Java code used non-in-place intersection for
+        // two runcontainers
+        return convert_run_to_efficient_container_and_free(CAST_run(result),
+            result_type);
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        // c1 is a bitmap so no inplace possible
+        result = array_container_create();
+        array_bitset_container_intersection(const_CAST_array(c2),
+            const_CAST_bitset(c1),
+            CAST_array(result));
+        *result_type = ARRAY_CONTAINER_TYPE;  // never bitset
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        *result_type = ARRAY_CONTAINER_TYPE;  // never bitset
+        array_bitset_container_intersection(
+            const_CAST_array(c1), const_CAST_bitset(c2),
+            CAST_array(c1));  // result is allowed to be same as c1
+        return c1;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        // will attempt in-place computation
+        *result_type = run_bitset_container_intersection(
+                           const_CAST_run(c2), const_CAST_bitset(c1), &c1)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return c1;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        *result_type =
+            run_bitset_container_intersection(
+                const_CAST_run(c1), const_CAST_bitset(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        result = array_container_create();
+        *result_type = ARRAY_CONTAINER_TYPE;  // never bitset
+        array_run_container_intersection(
+            const_CAST_array(c1), const_CAST_run(c2), CAST_array(result));
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        result = array_container_create();
+        *result_type = ARRAY_CONTAINER_TYPE;  // never bitset
+        array_run_container_intersection(
+            const_CAST_array(c2), const_CAST_run(c1), CAST_array(result));
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;
+    }
+}
+
+/**
+ * Compute union between two containers, generate a new container (having type
+ * result_type), requires a typecode. This allocates new memory, caller
+ * is responsible for deallocation.
+ */
+static inline container_t *container_or(const container_t *c1, uint8_t type1,
+    const container_t *c2, uint8_t type2,
+    uint8_t *result_type) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        result = bitset_container_create();
+        bitset_container_or(const_CAST_bitset(c1), const_CAST_bitset(c2),
+            CAST_bitset(result));
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        *result_type =
+            array_array_container_union(const_CAST_array(c1),
+                const_CAST_array(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        result = run_container_create();
+        run_container_union(const_CAST_run(c1), const_CAST_run(c2),
+            CAST_run(result));
+        *result_type = RUN_CONTAINER_TYPE;
+        // todo: could be optimized since will never convert to array
+        result = convert_run_to_efficient_container_and_free(
+            CAST_run(result), result_type);
+        return result;
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        result = bitset_container_create();
+        array_bitset_container_union(const_CAST_array(c2),
+            const_CAST_bitset(c1),
+            CAST_bitset(result));
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        result = bitset_container_create();
+        array_bitset_container_union(const_CAST_array(c1),
+            const_CAST_bitset(c2),
+            CAST_bitset(result));
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        if (run_container_is_full(const_CAST_run(c2))) {
+            result = run_container_create();
+            *result_type = RUN_CONTAINER_TYPE;
+            run_container_copy(const_CAST_run(c2), CAST_run(result));
+            return result;
+        }
+        result = bitset_container_create();
+        run_bitset_container_union(
+            const_CAST_run(c2), const_CAST_bitset(c1), CAST_bitset(result));
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        if (run_container_is_full(const_CAST_run(c1))) {
+            result = run_container_create();
+            *result_type = RUN_CONTAINER_TYPE;
+            run_container_copy(const_CAST_run(c1), CAST_run(result));
+            return result;
+        }
+        result = bitset_container_create();
+        run_bitset_container_union(
+            const_CAST_run(c1), const_CAST_bitset(c2), CAST_bitset(result));
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        result = run_container_create();
+        array_run_container_union(const_CAST_array(c1), const_CAST_run(c2),
+            CAST_run(result));
+        result = convert_run_to_efficient_container_and_free(
+            CAST_run(result), result_type);
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        result = run_container_create();
+        array_run_container_union(const_CAST_array(c2), const_CAST_run(c1),
+            CAST_run(result));
+        result = convert_run_to_efficient_container_and_free(
+            CAST_run(result), result_type);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;  // unreached
+    }
+}
+
+/**
+ * Compute union between two containers, generate a new container (having type
+ * result_type), requires a typecode. This allocates new memory, caller
+ * is responsible for deallocation.
+ *
+ * This lazy version delays some operations such as the maintenance of the
+ * cardinality. It requires repair later on the generated containers.
+ */
+static inline container_t *container_lazy_or(const container_t *c1,
+    uint8_t type1,
+    const container_t *c2,
+    uint8_t type2,
+    uint8_t *result_type) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        result = bitset_container_create();
+        bitset_container_or_nocard(const_CAST_bitset(c1),
+            const_CAST_bitset(c2),
+            CAST_bitset(result));  // is lazy
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        *result_type =
+            array_array_container_lazy_union(const_CAST_array(c1),
+                const_CAST_array(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        result = run_container_create();
+        run_container_union(const_CAST_run(c1), const_CAST_run(c2),
+            CAST_run(result));
+        *result_type = RUN_CONTAINER_TYPE;
+        // we are being lazy
+        result = convert_run_to_efficient_container_and_free(
+            CAST_run(result), result_type);
+        return result;
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        result = bitset_container_create();
+        array_bitset_container_lazy_union(const_CAST_array(c2),
+            const_CAST_bitset(c1),
+            CAST_bitset(result));  // is lazy
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        result = bitset_container_create();
+        array_bitset_container_lazy_union(const_CAST_array(c1),
+            const_CAST_bitset(c2),
+            CAST_bitset(result));  // is lazy
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        if (run_container_is_full(const_CAST_run(c2))) {
+            result = run_container_create();
+            *result_type = RUN_CONTAINER_TYPE;
+            run_container_copy(const_CAST_run(c2), CAST_run(result));
+            return result;
+        }
+        result = bitset_container_create();
+        run_bitset_container_lazy_union(const_CAST_run(c2),
+            const_CAST_bitset(c1),
+            CAST_bitset(result));  // is lazy
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        if (run_container_is_full(const_CAST_run(c1))) {
+            result = run_container_create();
+            *result_type = RUN_CONTAINER_TYPE;
+            run_container_copy(const_CAST_run(c1), CAST_run(result));
+            return result;
+        }
+        result = bitset_container_create();
+        run_bitset_container_lazy_union(const_CAST_run(c1),
+            const_CAST_bitset(c2),
+            CAST_bitset(result));  // is lazy
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        result = run_container_create();
+        array_run_container_union(const_CAST_array(c1), const_CAST_run(c2),
+            CAST_run(result));
+        *result_type = RUN_CONTAINER_TYPE;
+        // next line skipped since we are lazy
+        // result = convert_run_to_efficient_container(result, result_type);
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        result = run_container_create();
+        array_run_container_union(const_CAST_array(c2), const_CAST_run(c1),
+            CAST_run(result));  // TODO make lazy
+        *result_type = RUN_CONTAINER_TYPE;
+        // next line skipped since we are lazy
+        // result = convert_run_to_efficient_container(result, result_type);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;  // unreached
+    }
+}
+
+/**
+ * Compute the union between two containers, with result in the first container.
+ * If the returned pointer is identical to c1, then the container has been
+ * modified.
+ * If the returned pointer is different from c1, then a new container has been
+ * created and the caller is responsible for freeing it.
+ * The type of the first container may change. Returns the modified
+ * (and possibly new) container
+ */
+static inline container_t *container_ior(container_t *c1, uint8_t type1,
+    const container_t *c2, uint8_t type2,
+    uint8_t *result_type) {
+    c1 = get_writable_copy_if_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        bitset_container_or(const_CAST_bitset(c1), const_CAST_bitset(c2),
+            CAST_bitset(c1));
+#ifdef OR_BITSET_CONVERSION_TO_FULL
+        if (CAST_bitset(c1)->cardinality == (1 << 16)) {  // we convert
+            result = run_container_create_range(0, (1 << 16));
+            *result_type = RUN_CONTAINER_TYPE;
+            return result;
+        }
+#endif
+        *result_type = BITSET_CONTAINER_TYPE;
+        return c1;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        *result_type = array_array_container_inplace_union(
+                           CAST_array(c1), const_CAST_array(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        if ((result == NULL) && (*result_type == ARRAY_CONTAINER_TYPE)) {
+            return c1;  // the computation was done in-place!
+        }
+        return result;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        run_container_union_inplace(CAST_run(c1), const_CAST_run(c2));
+        return convert_run_to_efficient_container(CAST_run(c1),
+            result_type);
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        array_bitset_container_union(
+            const_CAST_array(c2), const_CAST_bitset(c1), CAST_bitset(c1));
+        *result_type = BITSET_CONTAINER_TYPE;  // never array
+        return c1;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        // c1 is an array, so no in-place possible
+        result = bitset_container_create();
+        *result_type = BITSET_CONTAINER_TYPE;
+        array_bitset_container_union(const_CAST_array(c1),
+            const_CAST_bitset(c2),
+            CAST_bitset(result));
+        return result;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        if (run_container_is_full(const_CAST_run(c2))) {
+            result = run_container_create();
+            *result_type = RUN_CONTAINER_TYPE;
+            run_container_copy(const_CAST_run(c2), CAST_run(result));
+            return result;
+        }
+        run_bitset_container_union(const_CAST_run(c2),
+            const_CAST_bitset(c1),
+            CAST_bitset(c1));  // allowed
+        *result_type = BITSET_CONTAINER_TYPE;
+        return c1;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        if (run_container_is_full(const_CAST_run(c1))) {
+            *result_type = RUN_CONTAINER_TYPE;
+            return c1;
+        }
+        result = bitset_container_create();
+        run_bitset_container_union(
+            const_CAST_run(c1), const_CAST_bitset(c2), CAST_bitset(result));
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        result = run_container_create();
+        array_run_container_union(const_CAST_array(c1), const_CAST_run(c2),
+            CAST_run(result));
+        result = convert_run_to_efficient_container_and_free(
+            CAST_run(result), result_type);
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        array_run_container_inplace_union(const_CAST_array(c2),
+            CAST_run(c1));
+        c1 = convert_run_to_efficient_container(CAST_run(c1), result_type);
+        return c1;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;
+    }
+}
+
+/**
+ * Compute the union between two containers, with result in the first container.
+ * If the returned pointer is identical to c1, then the container has been
+ * modified.
+ * If the returned pointer is different from c1, then a new container has been
+ * created and the caller is responsible for freeing it.
+ * The type of the first container may change. Returns the modified
+ * (and possibly new) container
+ *
+ * This lazy version delays some operations such as the maintenance of the
+ * cardinality. It requires repair later on the generated containers.
+ */
+static inline container_t *container_lazy_ior(container_t *c1, uint8_t type1,
+    const container_t *c2,
+    uint8_t type2,
+    uint8_t *result_type) {
+    assert(type1 != SHARED_CONTAINER_TYPE);
+    // c1 = get_writable_copy_if_shared(c1,&type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+#ifdef LAZY_OR_BITSET_CONVERSION_TO_FULL
+        // if we have two bitsets, we might as well compute the cardinality
+        bitset_container_or(const_CAST_bitset(c1), const_CAST_bitset(c2),
+            CAST_bitset(c1));
+        // it is possible that two bitsets can lead to a full container
+        if (CAST_bitset(c1)->cardinality == (1 << 16)) {  // we convert
+            result = run_container_create_range(0, (1 << 16));
+            *result_type = RUN_CONTAINER_TYPE;
+            return result;
+        }
+#else
+        bitset_container_or_nocard(const_CAST_bitset(c1),
+            const_CAST_bitset(c2), CAST_bitset(c1));
+
+#endif
+        *result_type = BITSET_CONTAINER_TYPE;
+        return c1;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        *result_type = array_array_container_lazy_inplace_union(
+                           CAST_array(c1), const_CAST_array(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        if ((result == NULL) && (*result_type == ARRAY_CONTAINER_TYPE)) {
+            return c1;  // the computation was done in-place!
+        }
+        return result;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        run_container_union_inplace(CAST_run(c1), const_CAST_run(c2));
+        *result_type = RUN_CONTAINER_TYPE;
+        return convert_run_to_efficient_container(CAST_run(c1),
+            result_type);
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        array_bitset_container_lazy_union(const_CAST_array(c2),
+            const_CAST_bitset(c1),
+            CAST_bitset(c1));  // is lazy
+        *result_type = BITSET_CONTAINER_TYPE;                // never array
+        return c1;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        // c1 is an array, so no in-place possible
+        result = bitset_container_create();
+        *result_type = BITSET_CONTAINER_TYPE;
+        array_bitset_container_lazy_union(const_CAST_array(c1),
+            const_CAST_bitset(c2),
+            CAST_bitset(result));  // is lazy
+        return result;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        if (run_container_is_full(const_CAST_run(c2))) {
+            result = run_container_create();
+            *result_type = RUN_CONTAINER_TYPE;
+            run_container_copy(const_CAST_run(c2), CAST_run(result));
+            return result;
+        }
+        run_bitset_container_lazy_union(
+            const_CAST_run(c2), const_CAST_bitset(c1),
+            CAST_bitset(c1));  // allowed //  lazy
+        *result_type = BITSET_CONTAINER_TYPE;
+        return c1;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        if (run_container_is_full(const_CAST_run(c1))) {
+            *result_type = RUN_CONTAINER_TYPE;
+            return c1;
+        }
+        result = bitset_container_create();
+        run_bitset_container_lazy_union(const_CAST_run(c1),
+            const_CAST_bitset(c2),
+            CAST_bitset(result));  //  lazy
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        result = run_container_create();
+        array_run_container_union(const_CAST_array(c1), const_CAST_run(c2),
+            CAST_run(result));
+        *result_type = RUN_CONTAINER_TYPE;
+        // next line skipped since we are lazy
+        // result = convert_run_to_efficient_container_and_free(result,
+        // result_type);
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        array_run_container_inplace_union(const_CAST_array(c2),
+            CAST_run(c1));
+        *result_type = RUN_CONTAINER_TYPE;
+        // next line skipped since we are lazy
+        // result = convert_run_to_efficient_container_and_free(result,
+        // result_type);
+        return c1;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;
+    }
+}
+
+/**
+ * Compute symmetric difference (xor) between two containers, generate a new
+ * container (having type result_type), requires a typecode. This allocates new
+ * memory, caller is responsible for deallocation.
+ */
+static inline container_t *container_xor(const container_t *c1, uint8_t type1,
+    const container_t *c2, uint8_t type2,
+    uint8_t *result_type) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        *result_type =
+            bitset_bitset_container_xor(const_CAST_bitset(c1),
+                const_CAST_bitset(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        *result_type =
+            array_array_container_xor(const_CAST_array(c1),
+                const_CAST_array(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        *result_type = (uint8_t)run_run_container_xor(
+            const_CAST_run(c1), const_CAST_run(c2), &result);
+        return result;
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        *result_type =
+            array_bitset_container_xor(const_CAST_array(c2),
+                const_CAST_bitset(c1), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        *result_type =
+            array_bitset_container_xor(const_CAST_array(c1),
+                const_CAST_bitset(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        *result_type =
+            run_bitset_container_xor(const_CAST_run(c2),
+                const_CAST_bitset(c1), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        *result_type =
+            run_bitset_container_xor(const_CAST_run(c1),
+                const_CAST_bitset(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        *result_type = (uint8_t)array_run_container_xor(
+            const_CAST_array(c1), const_CAST_run(c2), &result);
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        *result_type = (uint8_t)array_run_container_xor(
+            const_CAST_array(c2), const_CAST_run(c1), &result);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;  // unreached
+    }
+}
+
+/* Applies an offset to the non-empty container 'c'.
+ * The results are stored in new containers returned via 'lo' and 'hi', for the
+ * low and high halves of the result (where the low half matches the original
+ * key and the high one corresponds to values for the following key). Either one
+ * of 'lo' and 'hi' are allowed to be 'NULL', but not both. Whenever one of them
+ * is not 'NULL', it should point to a 'NULL' container. Whenever one of them is
+ * 'NULL' the shifted elements for that part will not be computed. If either of
+ * the resulting containers turns out to be empty, the pointed container will
+ * remain 'NULL'.
+ */
+static inline void container_add_offset(const container_t *c, uint8_t type,
+    container_t **lo, container_t **hi,
+    uint16_t offset) {
+    assert(offset != 0);
+    assert(container_nonzero_cardinality(c, type));
+    assert(lo != NULL || hi != NULL);
+    assert(lo == NULL || *lo == NULL);
+    assert(hi == NULL || *hi == NULL);
+
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        bitset_container_offset(const_CAST_bitset(c), lo, hi, offset);
+        break;
+    case ARRAY_CONTAINER_TYPE:
+        array_container_offset(const_CAST_array(c), lo, hi, offset);
+        break;
+    case RUN_CONTAINER_TYPE:
+        run_container_offset(const_CAST_run(c), lo, hi, offset);
+        break;
+    default:
+        assert(false);
+        roaring_unreachable;
+        break;
+    }
+}
+
+/**
+ * Compute xor between two containers, generate a new container (having type
+ * result_type), requires a typecode. This allocates new memory, caller
+ * is responsible for deallocation.
+ *
+ * This lazy version delays some operations such as the maintenance of the
+ * cardinality. It requires repair later on the generated containers.
+ */
+static inline container_t *container_lazy_xor(const container_t *c1,
+    uint8_t type1,
+    const container_t *c2,
+    uint8_t type2,
+    uint8_t *result_type) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        result = bitset_container_create();
+        bitset_container_xor_nocard(const_CAST_bitset(c1),
+            const_CAST_bitset(c2),
+            CAST_bitset(result));  // is lazy
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        *result_type =
+            array_array_container_lazy_xor(const_CAST_array(c1),
+                const_CAST_array(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        // nothing special done yet.
+        *result_type = (uint8_t)run_run_container_xor(
+            const_CAST_run(c1), const_CAST_run(c2), &result);
+        return result;
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        result = bitset_container_create();
+        *result_type = BITSET_CONTAINER_TYPE;
+        array_bitset_container_lazy_xor(const_CAST_array(c2),
+            const_CAST_bitset(c1),
+            CAST_bitset(result));
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        result = bitset_container_create();
+        *result_type = BITSET_CONTAINER_TYPE;
+        array_bitset_container_lazy_xor(const_CAST_array(c1),
+            const_CAST_bitset(c2),
+            CAST_bitset(result));
+        return result;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        result = bitset_container_create();
+        run_bitset_container_lazy_xor(
+            const_CAST_run(c2), const_CAST_bitset(c1), CAST_bitset(result));
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        result = bitset_container_create();
+        run_bitset_container_lazy_xor(
+            const_CAST_run(c1), const_CAST_bitset(c2), CAST_bitset(result));
+        *result_type = BITSET_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        result = run_container_create();
+        array_run_container_lazy_xor(const_CAST_array(c1),
+            const_CAST_run(c2), CAST_run(result));
+        *result_type = RUN_CONTAINER_TYPE;
+        // next line skipped since we are lazy
+        // result = convert_run_to_efficient_container(result, result_type);
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        result = run_container_create();
+        array_run_container_lazy_xor(const_CAST_array(c2),
+            const_CAST_run(c1), CAST_run(result));
+        *result_type = RUN_CONTAINER_TYPE;
+        // next line skipped since we are lazy
+        // result = convert_run_to_efficient_container(result, result_type);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;  // unreached
+    }
+}
+
+/**
+ * Compute the xor between two containers, with result in the first container.
+ * If the returned pointer is identical to c1, then the container has been
+ * modified.
+ * If the returned pointer is different from c1, then a new container has been
+ * created. The original container is freed by container_ixor.
+ * The type of the first container may change. Returns the modified (and
+ * possibly new) container.
+ */
+static inline container_t *container_ixor(container_t *c1, uint8_t type1,
+    const container_t *c2, uint8_t type2,
+    uint8_t *result_type) {
+    c1 = get_writable_copy_if_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        *result_type = bitset_bitset_container_ixor(
+                           CAST_bitset(c1), const_CAST_bitset(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        *result_type = array_array_container_ixor(
+                           CAST_array(c1), const_CAST_array(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        *result_type = (uint8_t)run_run_container_ixor(
+            CAST_run(c1), const_CAST_run(c2), &result);
+        return result;
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        *result_type = bitset_array_container_ixor(
+                           CAST_bitset(c1), const_CAST_array(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        *result_type = array_bitset_container_ixor(
+                           CAST_array(c1), const_CAST_bitset(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        *result_type = bitset_run_container_ixor(
+                           CAST_bitset(c1), const_CAST_run(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+
+        return result;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        *result_type = run_bitset_container_ixor(
+                           CAST_run(c1), const_CAST_bitset(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        *result_type = (uint8_t)array_run_container_ixor(
+            CAST_array(c1), const_CAST_run(c2), &result);
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        *result_type = (uint8_t)run_array_container_ixor(
+            CAST_run(c1), const_CAST_array(c2), &result);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;
+    }
+}
+
+/**
+ * Compute the xor between two containers, with result in the first container.
+ * If the returned pointer is identical to c1, then the container has been
+ * modified.
+ * If the returned pointer is different from c1, then a new container has been
+ * created and the caller is responsible for freeing it.
+ * The type of the first container may change. Returns the modified
+ * (and possibly new) container
+ *
+ * This lazy version delays some operations such as the maintenance of the
+ * cardinality. It requires repair later on the generated containers.
+ */
+static inline container_t *container_lazy_ixor(container_t *c1, uint8_t type1,
+    const container_t *c2,
+    uint8_t type2,
+    uint8_t *result_type) {
+    assert(type1 != SHARED_CONTAINER_TYPE);
+    // c1 = get_writable_copy_if_shared(c1,&type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        bitset_container_xor_nocard(CAST_bitset(c1), const_CAST_bitset(c2),
+            CAST_bitset(c1));  // is lazy
+        *result_type = BITSET_CONTAINER_TYPE;
+        return c1;
+
+    // TODO: other cases being lazy, esp. when we know inplace not likely
+    // could see the corresponding code for union
+    default:
+        // we may have a dirty bitset (without a precomputed cardinality)
+        // and calling container_ixor on it might be unsafe.
+        if (type1 == BITSET_CONTAINER_TYPE) {
+            bitset_container_t *bc = CAST_bitset(c1);
+            if (bc->cardinality == BITSET_UNKNOWN_CARDINALITY) {
+                bc->cardinality = bitset_container_compute_cardinality(bc);
+            }
+        }
+        return container_ixor(c1, type1, c2, type2, result_type);
+    }
+}
+
+/**
+ * Compute difference (andnot) between two containers, generate a new
+ * container (having type result_type), requires a typecode. This allocates new
+ * memory, caller is responsible for deallocation.
+ */
+static inline container_t *container_andnot(const container_t *c1,
+    uint8_t type1,
+    const container_t *c2,
+    uint8_t type2,
+    uint8_t *result_type) {
+    c1 = container_unwrap_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        *result_type =
+            bitset_bitset_container_andnot(const_CAST_bitset(c1),
+                const_CAST_bitset(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        result = array_container_create();
+        array_array_container_andnot(
+            const_CAST_array(c1), const_CAST_array(c2), CAST_array(result));
+        *result_type = ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        if (run_container_is_full(const_CAST_run(c2))) {
+            result = array_container_create();
+            *result_type = ARRAY_CONTAINER_TYPE;
+            return result;
+        }
+        *result_type = (uint8_t)run_run_container_andnot(
+            const_CAST_run(c1), const_CAST_run(c2), &result);
+        return result;
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        *result_type =
+            bitset_array_container_andnot(const_CAST_bitset(c1),
+                const_CAST_array(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        result = array_container_create();
+        array_bitset_container_andnot(const_CAST_array(c1),
+            const_CAST_bitset(c2),
+            CAST_array(result));
+        *result_type = ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        if (run_container_is_full(const_CAST_run(c2))) {
+            result = array_container_create();
+            *result_type = ARRAY_CONTAINER_TYPE;
+            return result;
+        }
+        *result_type =
+            bitset_run_container_andnot(const_CAST_bitset(c1),
+                const_CAST_run(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        *result_type =
+            run_bitset_container_andnot(const_CAST_run(c1),
+                const_CAST_bitset(c2), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        if (run_container_is_full(const_CAST_run(c2))) {
+            result = array_container_create();
+            *result_type = ARRAY_CONTAINER_TYPE;
+            return result;
+        }
+        result = array_container_create();
+        array_run_container_andnot(const_CAST_array(c1), const_CAST_run(c2),
+            CAST_array(result));
+        *result_type = ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        *result_type = (uint8_t)run_array_container_andnot(
+            const_CAST_run(c1), const_CAST_array(c2), &result);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;  // unreached
+    }
+}
+
+/**
+ * Compute the andnot between two containers, with result in the first
+ * container.
+ * If the returned pointer is identical to c1, then the container has been
+ * modified.
+ * If the returned pointer is different from c1, then a new container has been
+ * created. The original container is freed by container_iandnot.
+ * The type of the first container may change. Returns the modified (and
+ * possibly new) container.
+ */
+static inline container_t *container_iandnot(container_t *c1, uint8_t type1,
+    const container_t *c2,
+    uint8_t type2,
+    uint8_t *result_type) {
+    c1 = get_writable_copy_if_shared(c1, &type1);
+    c2 = container_unwrap_shared(c2, &type2);
+    container_t *result = NULL;
+    switch (PAIR_CONTAINER_TYPES(type1, type2)) {
+    case CONTAINER_PAIR(BITSET, BITSET):
+        *result_type = bitset_bitset_container_iandnot(
+                           CAST_bitset(c1), const_CAST_bitset(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, ARRAY):
+        array_array_container_iandnot(CAST_array(c1), const_CAST_array(c2));
+        *result_type = ARRAY_CONTAINER_TYPE;
+        return c1;
+
+    case CONTAINER_PAIR(RUN, RUN):
+        *result_type = (uint8_t)run_run_container_iandnot(
+            CAST_run(c1), const_CAST_run(c2), &result);
+        return result;
+
+    case CONTAINER_PAIR(BITSET, ARRAY):
+        *result_type = bitset_array_container_iandnot(
+                           CAST_bitset(c1), const_CAST_array(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, BITSET):
+        *result_type = ARRAY_CONTAINER_TYPE;
+        array_bitset_container_iandnot(CAST_array(c1),
+            const_CAST_bitset(c2));
+        return c1;
+
+    case CONTAINER_PAIR(BITSET, RUN):
+        *result_type = bitset_run_container_iandnot(
+                           CAST_bitset(c1), const_CAST_run(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(RUN, BITSET):
+        *result_type = run_bitset_container_iandnot(
+                           CAST_run(c1), const_CAST_bitset(c2), &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+
+    case CONTAINER_PAIR(ARRAY, RUN):
+        *result_type = ARRAY_CONTAINER_TYPE;
+        array_run_container_iandnot(CAST_array(c1), const_CAST_run(c2));
+        return c1;
+
+    case CONTAINER_PAIR(RUN, ARRAY):
+        *result_type = (uint8_t)run_array_container_iandnot(
+            CAST_run(c1), const_CAST_array(c2), &result);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+        return NULL;
+    }
+}
+
+/**
+ * Visit all values x of the container once, passing (base+x,ptr)
+ * to iterator. You need to specify a container and its type.
+ * Returns true if the iteration should continue.
+ */
+static inline bool container_iterate(const container_t *c, uint8_t type,
+    uint32_t base, roaring_iterator iterator,
+    void *ptr) {
+    c = container_unwrap_shared(c, &type);
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_iterate(const_CAST_bitset(c), base,
+            iterator, ptr);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_iterate(const_CAST_array(c), base, iterator,
+            ptr);
+    case RUN_CONTAINER_TYPE:
+        return run_container_iterate(const_CAST_run(c), base, iterator,
+            ptr);
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return false;
+}
+
+static inline bool container_iterate64(const container_t *c, uint8_t type,
+    uint32_t base,
+    roaring_iterator64 iterator,
+    uint64_t high_bits, void *ptr) {
+    c = container_unwrap_shared(c, &type);
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_iterate64(const_CAST_bitset(c), base,
+            iterator, high_bits, ptr);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_iterate64(const_CAST_array(c), base,
+            iterator, high_bits, ptr);
+    case RUN_CONTAINER_TYPE:
+        return run_container_iterate64(const_CAST_run(c), base, iterator,
+            high_bits, ptr);
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return false;
+}
+
+static inline container_t *container_not(const container_t *c, uint8_t type,
+    uint8_t *result_type) {
+    c = container_unwrap_shared(c, &type);
+    container_t *result = NULL;
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        *result_type =
+            bitset_container_negation(const_CAST_bitset(c), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+    case ARRAY_CONTAINER_TYPE:
+        result = bitset_container_create();
+        *result_type = BITSET_CONTAINER_TYPE;
+        array_container_negation(const_CAST_array(c), CAST_bitset(result));
+        return result;
+    case RUN_CONTAINER_TYPE:
+        *result_type =
+            (uint8_t)run_container_negation(const_CAST_run(c), &result);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return NULL;
+}
+
+static inline container_t *container_not_range(const container_t *c,
+    uint8_t type,
+    uint32_t range_start,
+    uint32_t range_end,
+    uint8_t *result_type) {
+    c = container_unwrap_shared(c, &type);
+    container_t *result = NULL;
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        *result_type =
+            bitset_container_negation_range(const_CAST_bitset(c),
+                range_start, range_end, &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+    case ARRAY_CONTAINER_TYPE:
+        *result_type =
+            array_container_negation_range(const_CAST_array(c), range_start,
+                range_end, &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+    case RUN_CONTAINER_TYPE:
+        *result_type = (uint8_t)run_container_negation_range(
+            const_CAST_run(c), range_start, range_end, &result);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return NULL;
+}
+
+static inline container_t *container_inot(container_t *c, uint8_t type,
+    uint8_t *result_type) {
+    c = get_writable_copy_if_shared(c, &type);
+    container_t *result = NULL;
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        *result_type =
+            bitset_container_negation_inplace(CAST_bitset(c), &result)
+                ? BITSET_CONTAINER_TYPE
+                : ARRAY_CONTAINER_TYPE;
+        return result;
+    case ARRAY_CONTAINER_TYPE:
+        // will never be inplace
+        result = bitset_container_create();
+        *result_type = BITSET_CONTAINER_TYPE;
+        array_container_negation(CAST_array(c), CAST_bitset(result));
+        array_container_free(CAST_array(c));
+        return result;
+    case RUN_CONTAINER_TYPE:
+        *result_type =
+            (uint8_t)run_container_negation_inplace(CAST_run(c), &result);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return NULL;
+}
+
+static inline container_t *container_inot_range(container_t *c, uint8_t type,
+    uint32_t range_start,
+    uint32_t range_end,
+    uint8_t *result_type) {
+    c = get_writable_copy_if_shared(c, &type);
+    container_t *result = NULL;
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        *result_type = bitset_container_negation_range_inplace(
+                           CAST_bitset(c), range_start, range_end, &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+    case ARRAY_CONTAINER_TYPE:
+        *result_type = array_container_negation_range_inplace(
+                           CAST_array(c), range_start, range_end, &result)
+                           ? BITSET_CONTAINER_TYPE
+                           : ARRAY_CONTAINER_TYPE;
+        return result;
+    case RUN_CONTAINER_TYPE:
+        *result_type = (uint8_t)run_container_negation_range_inplace(
+            CAST_run(c), range_start, range_end, &result);
+        return result;
+
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return NULL;
+}
+
+/**
+ * If the element of given rank is in this container, supposing that
+ * the first
+ * element has rank start_rank, then the function returns true and
+ * sets element
+ * accordingly.
+ * Otherwise, it returns false and update start_rank.
+ */
+static inline bool container_select(const container_t *c, uint8_t type,
+    uint32_t *start_rank, uint32_t rank,
+    uint32_t *element) {
+    c = container_unwrap_shared(c, &type);
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_select(const_CAST_bitset(c), start_rank,
+            rank, element);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_select(const_CAST_array(c), start_rank, rank,
+            element);
+    case RUN_CONTAINER_TYPE:
+        return run_container_select(const_CAST_run(c), start_rank, rank,
+            element);
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return false;
+}
+
+static inline uint16_t container_maximum(const container_t *c, uint8_t type) {
+    c = container_unwrap_shared(c, &type);
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_maximum(const_CAST_bitset(c));
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_maximum(const_CAST_array(c));
+    case RUN_CONTAINER_TYPE:
+        return run_container_maximum(const_CAST_run(c));
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return false;
+}
+
+static inline uint16_t container_minimum(const container_t *c, uint8_t type) {
+    c = container_unwrap_shared(c, &type);
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_minimum(const_CAST_bitset(c));
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_minimum(const_CAST_array(c));
+    case RUN_CONTAINER_TYPE:
+        return run_container_minimum(const_CAST_run(c));
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return false;
+}
+
+// number of values smaller or equal to x
+static inline int container_rank(const container_t *c, uint8_t type,
+    uint16_t x) {
+    c = container_unwrap_shared(c, &type);
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_rank(const_CAST_bitset(c), x);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_rank(const_CAST_array(c), x);
+    case RUN_CONTAINER_TYPE:
+        return run_container_rank(const_CAST_run(c), x);
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return false;
+}
+
+// bulk version of container_rank(); return number of consumed elements
+static inline uint32_t container_rank_many(const container_t *c, uint8_t type,
+    uint64_t start_rank,
+    const uint32_t *begin,
+    const uint32_t *end, uint64_t *ans) {
+    c = container_unwrap_shared(c, &type);
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_rank_many(const_CAST_bitset(c), start_rank,
+            begin, end, ans);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_rank_many(const_CAST_array(c), start_rank,
+            begin, end, ans);
+    case RUN_CONTAINER_TYPE:
+        return run_container_rank_many(const_CAST_run(c), start_rank, begin,
+            end, ans);
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return 0;
+}
+
+// return the index of x, if not exsist return -1
+static inline int container_get_index(const container_t *c, uint8_t type,
+    uint16_t x) {
+    c = container_unwrap_shared(c, &type);
+    switch (type) {
+    case BITSET_CONTAINER_TYPE:
+        return bitset_container_get_index(const_CAST_bitset(c), x);
+    case ARRAY_CONTAINER_TYPE:
+        return array_container_get_index(const_CAST_array(c), x);
+    case RUN_CONTAINER_TYPE:
+        return run_container_get_index(const_CAST_run(c), x);
+    default:
+        assert(false);
+        roaring_unreachable;
+    }
+    assert(false);
+    roaring_unreachable;
+    return false;
+}
+
+/**
+ * Add all values in range [min, max] to a given container.
+ *
+ * If the returned pointer is different from $container, then a new container
+ * has been created and the caller is responsible for freeing it.
+ * The type of the first container may change. Returns the modified
+ * (and possibly new) container.
+ */
+static inline container_t *container_add_range(container_t *c, uint8_t type,
+    uint32_t min, uint32_t max,
+    uint8_t *result_type) {
+    // NB: when selecting new container type, we perform only inexpensive checks
+    switch (type) {
+    case BITSET_CONTAINER_TYPE: {
+        bitset_container_t *bitset = CAST_bitset(c);
+
+        int32_t union_cardinality = 0;
+        union_cardinality += bitset->cardinality;
+        union_cardinality += max - min + 1;
+        union_cardinality -=
+            bitset_lenrange_cardinality(bitset->words, min, max - min);
+
+        if (union_cardinality == INT32_C(0x10000)) {
+            *result_type = RUN_CONTAINER_TYPE;
+            return run_container_create_range(0, INT32_C(0x10000));
+        } else {
+            *result_type = BITSET_CONTAINER_TYPE;
+            bitset_set_lenrange(bitset->words, min, max - min);
+            bitset->cardinality = union_cardinality;
+            return bitset;
+        }
+    }
+    case ARRAY_CONTAINER_TYPE: {
+        array_container_t *array = CAST_array(c);
+
+        int32_t nvals_greater =
+            count_greater(array->array, array->cardinality, (uint16_t)max);
+        int32_t nvals_less =
+            count_less(array->array, array->cardinality - nvals_greater,
+                (uint16_t)min);
+        int32_t union_cardinality =
+            nvals_less + (max - min + 1) + nvals_greater;
+
+        if (union_cardinality == INT32_C(0x10000)) {
+            *result_type = RUN_CONTAINER_TYPE;
+            return run_container_create_range(0, INT32_C(0x10000));
+        } else if (union_cardinality <= DEFAULT_MAX_SIZE) {
+            *result_type = ARRAY_CONTAINER_TYPE;
+            array_container_add_range_nvals(array, min, max, nvals_less,
+                nvals_greater);
+            return array;
+        } else {
+            *result_type = BITSET_CONTAINER_TYPE;
+            bitset_container_t *bitset = bitset_container_from_array(array);
+            bitset_set_lenrange(bitset->words, min, max - min);
+            bitset->cardinality = union_cardinality;
+            return bitset;
+        }
+    }
+    case RUN_CONTAINER_TYPE: {
+        run_container_t *run = CAST_run(c);
+
+        int32_t nruns_greater =
+            rle16_count_greater(run->runs, run->n_runs, (uint16_t)max);
+        int32_t nruns_less = rle16_count_less(
+            run->runs, run->n_runs - nruns_greater, (uint16_t)min);
+
+        int32_t run_size_bytes =
+            (nruns_less + 1 + nruns_greater) * sizeof(rle16_t);
+        int32_t bitset_size_bytes =
+            BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t);
+
+        if (run_size_bytes <= bitset_size_bytes) {
+            run_container_add_range_nruns(run, min, max, nruns_less,
+                nruns_greater);
+            *result_type = RUN_CONTAINER_TYPE;
+            return run;
+        } else {
+            return container_from_run_range(run, min, max, result_type);
+        }
+    }
+    default:
+        roaring_unreachable;
+    }
+}
+
+/*
+ * Removes all elements in range [min, max].
+ * Returns one of:
+ *   - NULL if no elements left
+ *   - pointer to the original container
+ *   - pointer to a newly-allocated container (if it is more efficient)
+ *
+ * If the returned pointer is different from $container, then a new container
+ * has been created and the caller is responsible for freeing the original
+ * container.
+ */
+static inline container_t *container_remove_range(container_t *c, uint8_t type,
+    uint32_t min, uint32_t max,
+    uint8_t *result_type) {
+    switch (type) {
+    case BITSET_CONTAINER_TYPE: {
+        bitset_container_t *bitset = CAST_bitset(c);
+
+        int32_t result_cardinality =
+            bitset->cardinality -
+            bitset_lenrange_cardinality(bitset->words, min, max - min);
+
+        if (result_cardinality == 0) {
+            return NULL;
+        } else if (result_cardinality <= DEFAULT_MAX_SIZE) {
+            *result_type = ARRAY_CONTAINER_TYPE;
+            bitset_reset_range(bitset->words, min, max + 1);
+            bitset->cardinality = result_cardinality;
+            return array_container_from_bitset(bitset);
+        } else {
+            *result_type = BITSET_CONTAINER_TYPE;
+            bitset_reset_range(bitset->words, min, max + 1);
+            bitset->cardinality = result_cardinality;
+            return bitset;
+        }
+    }
+    case ARRAY_CONTAINER_TYPE: {
+        array_container_t *array = CAST_array(c);
+
+        int32_t nvals_greater =
+            count_greater(array->array, array->cardinality, (uint16_t)max);
+        int32_t nvals_less =
+            count_less(array->array, array->cardinality - nvals_greater,
+                (uint16_t)min);
+        int32_t result_cardinality = nvals_less + nvals_greater;
+
+        if (result_cardinality == 0) {
+            return NULL;
+        } else {
+            *result_type = ARRAY_CONTAINER_TYPE;
+            array_container_remove_range(
+                array, nvals_less, array->cardinality - result_cardinality);
+            return array;
+        }
+    }
+    case RUN_CONTAINER_TYPE: {
+        run_container_t *run = CAST_run(c);
+
+        if (run->n_runs == 0) {
+            return NULL;
+        }
+        if (min <= run_container_minimum(run) &&
+            max >= run_container_maximum(run)) {
+            return NULL;
+        }
+
+        run_container_remove_range(run, min, max);
+        return convert_run_to_efficient_container(run, result_type);
+    }
+    default:
+        roaring_unreachable;
+    }
+}
+
+#ifdef __cplusplus
+using api::roaring_container_iterator_t;
+#endif
+
+/**
+ * Initializes the iterator at the first entry in the container.
+ */
+roaring_container_iterator_t container_init_iterator(const container_t *c,
+    uint8_t typecode,
+    uint16_t *value);
+
+/**
+ * Initializes the iterator at the last entry in the container.
+ */
+roaring_container_iterator_t container_init_iterator_last(const container_t *c,
+    uint8_t typecode,
+    uint16_t *value);
+
+/**
+ * Moves the iterator to the next entry. Returns true and sets `value` if a
+ * value is present.
+ */
+bool container_iterator_next(const container_t *c, uint8_t typecode,
+    roaring_container_iterator_t *it, uint16_t *value);
+
+/**
+ * Moves the iterator to the previous entry. Returns true and sets `value` if a
+ * value is present.
+ */
+bool container_iterator_prev(const container_t *c, uint8_t typecode,
+    roaring_container_iterator_t *it, uint16_t *value);
+
+/**
+ * Moves the iterator to the smallest entry that is greater than or equal to
+ * `val`. Returns true and sets `value_out` if a value is present. `value_out`
+ * should be initialized to a value.
+ */
+bool container_iterator_lower_bound(const container_t *c, uint8_t typecode,
+    roaring_container_iterator_t *it,
+    uint16_t *value_out, uint16_t val);
+
+/**
+ * Reads up to `count` entries from the container, and writes them into `buf`
+ * as `high16 | entry`. Returns true and sets `value_out` if a value is present
+ * after reading the entries. Sets `consumed` to the number of values read.
+ * `count` should be greater than zero.
+ */
+bool container_iterator_read_into_uint32(const container_t *c, uint8_t typecode,
+    roaring_container_iterator_t *it,
+    uint32_t high16, uint32_t *buf,
+    uint32_t count, uint32_t *consumed,
+    uint16_t *value_out);
+
+/**
+ * Reads up to `count` entries from the container, and writes them into `buf`
+ * as `high48 | entry`. Returns true and sets `value_out` if a value is present
+ * after reading the entries. Sets `consumed` to the number of values read.
+ * `count` should be greater than zero.
+ */
+bool container_iterator_read_into_uint64(const container_t *c, uint8_t typecode,
+    roaring_container_iterator_t *it,
+    uint64_t high48, uint64_t *buf,
+    uint32_t count, uint32_t *consumed,
+    uint16_t *value_out);
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#endif
+/* end file include/roaring/containers/containers.h */
+/* begin file include/roaring/roaring_array.h */
+#ifndef INCLUDE_ROARING_ARRAY_H
+#define INCLUDE_ROARING_ARRAY_H
+
+#include <assert.h>
+#include <stdbool.h>
+#include <stdint.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+
+// Note: in pure C++ code, you should avoid putting `using` in header files
+using api::roaring_array_t;
+
+namespace internal {
+#endif
+
+enum {
+    SERIAL_COOKIE_NO_RUNCONTAINER = 12346,
+    SERIAL_COOKIE = 12347,
+    FROZEN_COOKIE = 13766,
+    NO_OFFSET_THRESHOLD = 4
+};
+
+/**
+ * Create a new roaring array
+ */
+roaring_array_t *ra_create(void);
+
+/**
+ * Initialize an existing roaring array with the specified capacity (in number
+ * of containers)
+ */
+bool ra_init_with_capacity(roaring_array_t *new_ra, uint32_t cap);
+
+/**
+ * Initialize with zero capacity
+ */
+void ra_init(roaring_array_t *t);
+
+/**
+ * Copies this roaring array, we assume that dest is not initialized
+ */
+bool ra_copy(const roaring_array_t *source, roaring_array_t *dest,
+    bool copy_on_write);
+
+/*
+ * Shrinks the capacity, returns the number of bytes saved.
+ */
+int ra_shrink_to_fit(roaring_array_t *ra);
+
+/**
+ * Copies this roaring array, we assume that dest is initialized
+ */
+bool ra_overwrite(const roaring_array_t *source, roaring_array_t *dest,
+    bool copy_on_write);
+
+/**
+ * Frees the memory used by a roaring array
+ */
+void ra_clear(roaring_array_t *r);
+
+/**
+ * Frees the memory used by a roaring array, but does not free the containers
+ */
+void ra_clear_without_containers(roaring_array_t *r);
+
+/**
+ * Frees just the containers
+ */
+void ra_clear_containers(roaring_array_t *ra);
+
+/**
+ * Get the index corresponding to a 16-bit key
+ */
+inline int32_t ra_get_index(const roaring_array_t *ra, uint16_t x) {
+    if ((ra->size == 0) || ra->keys[ra->size - 1] == x) return ra->size - 1;
+    return binarySearch(ra->keys, (int32_t)ra->size, x);
+}
+
+/**
+ * Retrieves the container at index i, filling in the typecode
+ */
+inline container_t *ra_get_container_at_index(const roaring_array_t *ra,
+    uint16_t i, uint8_t *typecode) {
+    *typecode = ra->typecodes[i];
+    return ra->containers[i];
+}
+
+/**
+ * Retrieves the key at index i
+ */
+inline uint16_t ra_get_key_at_index(const roaring_array_t *ra, uint16_t i) {
+    return ra->keys[i];
+}
+
+/**
+ * Add a new key-value pair at index i
+ */
+void ra_insert_new_key_value_at(roaring_array_t *ra, int32_t i, uint16_t key,
+    container_t *c, uint8_t typecode);
+
+/**
+ * Append a new key-value pair
+ */
+void ra_append(roaring_array_t *ra, uint16_t key, container_t *c,
+    uint8_t typecode);
+
+/**
+ * Append a new key-value pair to ra, cloning (in COW sense) a value from sa
+ * at index index
+ */
+void ra_append_copy(roaring_array_t *ra, const roaring_array_t *sa,
+    uint16_t index, bool copy_on_write);
+
+/**
+ * Append new key-value pairs to ra, cloning (in COW sense)  values from sa
+ * at indexes
+ * [start_index, end_index)
+ */
+void ra_append_copy_range(roaring_array_t *ra, const roaring_array_t *sa,
+    int32_t start_index, int32_t end_index,
+    bool copy_on_write);
+
+/** appends from sa to ra, ending with the greatest key that is
+ * is less or equal stopping_key
+ */
+void ra_append_copies_until(roaring_array_t *ra, const roaring_array_t *sa,
+    uint16_t stopping_key, bool copy_on_write);
+
+/** appends from sa to ra, starting with the smallest key that is
+ * is strictly greater than before_start
+ */
+
+void ra_append_copies_after(roaring_array_t *ra, const roaring_array_t *sa,
+    uint16_t before_start, bool copy_on_write);
+
+/**
+ * Move the key-value pairs to ra from sa at indexes
+ * [start_index, end_index), old array should not be freed
+ * (use ra_clear_without_containers)
+ **/
+void ra_append_move_range(roaring_array_t *ra, roaring_array_t *sa,
+    int32_t start_index, int32_t end_index);
+/**
+ * Append new key-value pairs to ra,  from sa at indexes
+ * [start_index, end_index)
+ */
+void ra_append_range(roaring_array_t *ra, roaring_array_t *sa,
+    int32_t start_index, int32_t end_index,
+    bool copy_on_write);
+
+/**
+ * Set the container at the corresponding index using the specified
+ * typecode.
+ */
+inline void ra_set_container_at_index(const roaring_array_t *ra, int32_t i,
+    container_t *c, uint8_t typecode) {
+    assert(i < ra->size);
+    ra->containers[i] = c;
+    ra->typecodes[i] = typecode;
+}
+
+container_t *ra_get_container(roaring_array_t *ra, uint16_t x,
+    uint8_t *typecode);
+
+/**
+ * If needed, increase the capacity of the array so that it can fit k values
+ * (at
+ * least);
+ */
+bool extend_array(roaring_array_t *ra, int32_t k);
+
+inline int32_t ra_get_size(const roaring_array_t *ra) { return ra->size; }
+
+static inline int32_t ra_advance_until(const roaring_array_t *ra, uint16_t x,
+    int32_t pos) {
+    return advanceUntil(ra->keys, pos, ra->size, x);
+}
+
+int32_t ra_advance_until_freeing(roaring_array_t *ra, uint16_t x, int32_t pos);
+
+void ra_downsize(roaring_array_t *ra, int32_t new_length);
+
+inline void ra_replace_key_and_container_at_index(roaring_array_t *ra,
+    int32_t i, uint16_t key,
+    container_t *c,
+    uint8_t typecode) {
+    assert(i < ra->size);
+
+    ra->keys[i] = key;
+    ra->containers[i] = c;
+    ra->typecodes[i] = typecode;
+}
+
+// write set bits to an array
+void ra_to_uint32_array(const roaring_array_t *ra, uint32_t *ans);
+
+bool ra_range_uint32_array(const roaring_array_t *ra, size_t offset,
+    size_t limit, uint32_t *ans);
+
+/**
+ * write a bitmap to a buffer. This is meant to be compatible with
+ * the
+ * Java and Go versions. Return the size in bytes of the serialized
+ * output (which should be ra_portable_size_in_bytes(ra)).
+ */
+size_t ra_portable_serialize(const roaring_array_t *ra, char *buf);
+
+/**
+ * read a bitmap from a serialized version. This is meant to be compatible
+ * with the Java and Go versions.
+ * maxbytes  indicates how many bytes available from buf.
+ * When the function returns true, roaring_array_t is populated with the data
+ * and *readbytes indicates how many bytes were read. In all cases, if the
+ * function returns true, then maxbytes >= *readbytes.
+ */
+bool ra_portable_deserialize(roaring_array_t *ra, const char *buf,
+    const size_t maxbytes, size_t *readbytes);
+
+/**
+ * Quickly checks whether there is a serialized bitmap at the pointer,
+ * not exceeding size "maxbytes" in bytes. This function does not allocate
+ * memory dynamically.
+ *
+ * This function returns 0 if and only if no valid bitmap is found.
+ * Otherwise, it returns how many bytes are occupied by the bitmap data.
+ */
+size_t ra_portable_deserialize_size(const char *buf, const size_t maxbytes);
+
+/**
+ * How many bytes are required to serialize this bitmap (meant to be
+ * compatible
+ * with Java and Go versions)
+ */
+size_t ra_portable_size_in_bytes(const roaring_array_t *ra);
+
+/**
+ * return true if it contains at least one run container.
+ */
+bool ra_has_run_container(const roaring_array_t *ra);
+
+/**
+ * Size of the header when serializing (meant to be compatible
+ * with Java and Go versions)
+ */
+uint32_t ra_portable_header_size(const roaring_array_t *ra);
+
+/**
+ * If the container at the index i is share, unshare it (creating a local
+ * copy if needed).
+ */
+static inline void ra_unshare_container_at_index(roaring_array_t *ra,
+    uint16_t i) {
+    assert(i < ra->size);
+    ra->containers[i] =
+        get_writable_copy_if_shared(ra->containers[i], &ra->typecodes[i]);
+}
+
+/**
+ * remove at index i, sliding over all entries after i
+ */
+void ra_remove_at_index(roaring_array_t *ra, int32_t i);
+
+/**
+ * clears all containers, sets the size at 0 and shrinks the memory usage.
+ */
+void ra_reset(roaring_array_t *ra);
+
+/**
+ * remove at index i, sliding over all entries after i. Free removed container.
+ */
+void ra_remove_at_index_and_free(roaring_array_t *ra, int32_t i);
+
+/**
+ * remove a chunk of indices, sliding over entries after it
+ */
+// void ra_remove_index_range(roaring_array_t *ra, int32_t begin, int32_t end);
+
+// used in inplace andNot only, to slide left the containers from
+// the mutated RoaringBitmap that are after the largest container of
+// the argument RoaringBitmap.  It is followed by a call to resize.
+//
+void ra_copy_range(roaring_array_t *ra, uint32_t begin, uint32_t end,
+    uint32_t new_begin);
+
+/**
+ * Shifts rightmost $count containers to the left (distance < 0) or
+ * to the right (distance > 0).
+ * Allocates memory if necessary.
+ * This function doesn't free or create new containers.
+ * Caller is responsible for that.
+ */
+void ra_shift_tail(roaring_array_t *ra, int32_t count, int32_t distance);
+
+#ifdef __cplusplus
+}  // namespace internal
+}
+}  // extern "C" { namespace roaring {
+#endif
+
+#endif
+/* end file include/roaring/roaring_array.h */
+/* begin file include/roaring/art/art.h */
+#ifndef ART_ART_H
+#define ART_ART_H
+
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+
+/*
+ * This file contains an implementation of an Adaptive Radix Tree as described
+ * in https://db.in.tum.de/~leis/papers/ART.pdf.
+ *
+ * The ART contains the keys in _byte lexographical_ order.
+ *
+ * Other features:
+ *  * Fixed 48 bit key length: all keys are assumed to be be 48 bits in size.
+ *    This allows us to put the key and key prefixes directly in nodes, reducing
+ *    indirection at no additional memory overhead.
+ *  * Key compression: the only inner nodes created are at points where key
+ *    chunks _differ_. This means that if there are two entries with different
+ *    high 48 bits, then there is only one inner node containing the common key
+ *    prefix, and two leaves.
+ *  * Intrusive leaves: the leaf struct is included in user values. This removes
+ *    a layer of indirection.
+ */
+
+// Fixed length of keys in the ART. All keys are assumed to be of this length.
+#define ART_KEY_BYTES 6
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+typedef uint8_t art_key_chunk_t;
+typedef struct art_node_s art_node_t;
+
+/**
+ * Wrapper to allow an empty tree.
+ */
+typedef struct art_s {
+    art_node_t *root;
+} art_t;
+
+/**
+ * Values inserted into the tree have to be cast-able to art_val_t. This
+ * improves performance by reducing indirection.
+ *
+ * NOTE: Value pointers must be unique! This is because each value struct
+ * contains the key corresponding to the value.
+ */
+typedef struct art_val_s {
+    art_key_chunk_t key[ART_KEY_BYTES];
+} art_val_t;
+
+/**
+ * Compares two keys, returns their relative order:
+ *  * Key 1 <  key 2: returns a negative value
+ *  * Key 1 == key 2: returns 0
+ *  * Key 1 >  key 2: returns a positive value
+ */
+int art_compare_keys(const art_key_chunk_t key1[],
+    const art_key_chunk_t key2[]);
+
+/**
+ * Inserts the given key and value.
+ */
+void art_insert(art_t *art, const art_key_chunk_t *key, art_val_t *val);
+
+/**
+ * Returns the value erased, NULL if not found.
+ */
+art_val_t *art_erase(art_t *art, const art_key_chunk_t *key);
+
+/**
+ * Returns the value associated with the given key, NULL if not found.
+ */
+art_val_t *art_find(const art_t *art, const art_key_chunk_t *key);
+
+/**
+ * Returns true if the ART is empty.
+ */
+bool art_is_empty(const art_t *art);
+
+/**
+ * Frees the nodes of the ART except the values, which the user is expected to
+ * free.
+ */
+void art_free(art_t *art);
+
+/**
+ * Returns the size in bytes of the ART. Includes size of pointers to values,
+ * but not the values themselves.
+ */
+size_t art_size_in_bytes(const art_t *art);
+
+/**
+ * Prints the ART using printf, useful for debugging.
+ */
+void art_printf(const art_t *art);
+
+/**
+ * Callback for validating the value stored in a leaf.
+ *
+ * Should return true if the value is valid, false otherwise
+ * If false is returned, `*reason` should be set to a static string describing
+ * the reason for the failure.
+ */
+typedef bool (*art_validate_cb_t)(const art_val_t *val, const char **reason);
+
+/**
+ * Validate the ART tree, ensuring it is internally consistent.
+ */
+bool art_internal_validate(const art_t *art, const char **reason,
+    art_validate_cb_t validate_cb);
+
+/**
+ * ART-internal iterator bookkeeping. Users should treat this as an opaque type.
+ */
+typedef struct art_iterator_frame_s {
+    art_node_t *node;
+    uint8_t index_in_node;
+} art_iterator_frame_t;
+
+/**
+ * Users should only access `key` and `value` in iterators. The iterator is
+ * valid when `value != NULL`.
+ */
+typedef struct art_iterator_s {
+    art_key_chunk_t key[ART_KEY_BYTES];
+    art_val_t *value;
+
+    uint8_t depth;  // Key depth
+    uint8_t frame;  // Node depth
+
+    // State for each node in the ART the iterator has travelled from the root.
+    // This is `ART_KEY_BYTES + 1` because it includes state for the leaf too.
+    art_iterator_frame_t frames[ART_KEY_BYTES + 1];
+} art_iterator_t;
+
+/**
+ * Creates an iterator initialzed to the first or last entry in the ART,
+ * depending on `first`. The iterator is not valid if there are no entries in
+ * the ART.
+ */
+art_iterator_t art_init_iterator(const art_t *art, bool first);
+
+/**
+ * Returns an initialized iterator positioned at a key equal to or greater than
+ * the given key, if it exists.
+ */
+art_iterator_t art_lower_bound(const art_t *art, const art_key_chunk_t *key);
+
+/**
+ * Returns an initialized iterator positioned at a key greater than the given
+ * key, if it exists.
+ */
+art_iterator_t art_upper_bound(const art_t *art, const art_key_chunk_t *key);
+
+/**
+ * The following iterator movement functions return true if a new entry was
+ * encountered.
+ */
+bool art_iterator_move(art_iterator_t *iterator, bool forward);
+bool art_iterator_next(art_iterator_t *iterator);
+bool art_iterator_prev(art_iterator_t *iterator);
+
+/**
+ * Moves the iterator forward to a key equal to or greater than the given key.
+ */
+bool art_iterator_lower_bound(art_iterator_t *iterator,
+    const art_key_chunk_t *key);
+
+/**
+ * Insert the value and positions the iterator at the key.
+ */
+void art_iterator_insert(art_t *art, art_iterator_t *iterator,
+    const art_key_chunk_t *key, art_val_t *val);
+
+/**
+ * Erase the value pointed at by the iterator. Moves the iterator to the next
+ * leaf. Returns the value erased or NULL if nothing was erased.
+ */
+art_val_t *art_iterator_erase(art_t *art, art_iterator_t *iterator);
+
+#ifdef __cplusplus
+}  // extern "C"
+}  // namespace roaring
+}  // namespace internal
+#endif
+
+#endif
+/* end file include/roaring/art/art.h */
+/* begin file src/array_util.c */
+#include <assert.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+#if CROARING_IS_X64
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#error "CROARING_COMPILER_SUPPORTS_AVX512 needs to be defined."
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+#endif
+
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wuninitialized"
+#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
+#endif
+#ifdef __cplusplus
+using namespace ::roaring::internal;
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+extern inline int32_t binarySearch(const uint16_t *array, int32_t lenarray,
+    uint16_t ikey);
+
+#if CROARING_IS_X64
+// used by intersect_vector16
+ALIGNED(0x1000)
+static const uint8_t shuffle_mask16[] = {
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    6,    7,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,    0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    6,    7,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    6,    7,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    6,    7,    0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    6,    7,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    6,    7,    0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 8,    9,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    8,    9,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    8,    9,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    8,    9,    0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    8,    9,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    8,    9,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    8,    9,    0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    8,    9,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    6,    7,    8,    9,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,    8,    9,    0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,
+    8,    9,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    6,    7,    8,    9,    0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,    8,    9,    0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    6,    7,    8,    9,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    6,    7,    8,    9,    0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    6,    7,
+    8,    9,    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 10,   11,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    10,   11,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,
+    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    6,    7,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    6,    7,    10,   11,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,
+    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    6,    7,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    6,    7,    10,   11,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    6,    7,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    8,    9,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    8,    9,    10,   11,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    8,    9,
+    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    8,    9,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    8,    9,    10,   11,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    8,    9,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    8,    9,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    8,    9,
+    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    8,    9,
+    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    6,    7,    8,    9,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,    8,    9,    10,   11,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    6,    7,    8,    9,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    6,    7,    8,    9,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    6,    7,    8,    9,
+    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    6,    7,    8,    9,    10,   11,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    6,    7,    8,    9,    10,   11,
+    0xFF, 0xFF, 0xFF, 0xFF, 12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    12,   13,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    12,   13,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    6,    7,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,    12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    6,    7,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,    12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    6,    7,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    6,    7,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    6,    7,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 8,    9,    12,   13,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    8,    9,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    8,    9,    12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    8,    9,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    8,    9,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    8,    9,    12,   13,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    8,    9,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    8,    9,    12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    8,    9,    12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,
+    8,    9,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    6,    7,    8,    9,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    6,    7,    8,    9,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,
+    8,    9,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    6,    7,    8,    9,    12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    6,    7,    8,    9,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    6,    7,    8,    9,    12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    10,   11,   12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    10,   11,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    10,   11,   12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    10,   11,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    10,   11,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    6,    7,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,    10,   11,   12,   13,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    6,    7,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    6,    7,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    6,    7,    10,   11,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    6,    7,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    6,    7,    10,   11,   12,   13,
+    0xFF, 0xFF, 0xFF, 0xFF, 8,    9,    10,   11,   12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    8,    9,
+    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    8,    9,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    8,    9,    10,   11,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    8,    9,
+    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    8,    9,    10,   11,   12,   13,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    8,    9,    10,   11,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    8,    9,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    6,    7,    8,    9,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,    8,    9,    10,   11,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,
+    8,    9,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    6,    7,    8,    9,    10,   11,   12,   13,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,    8,    9,    10,   11,
+    12,   13,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    6,    7,    8,    9,    10,   11,   12,   13,   0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    6,    7,    8,    9,    10,   11,   12,   13,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    6,    7,
+    8,    9,    10,   11,   12,   13,   0xFF, 0xFF, 14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    6,    7,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    6,    7,    14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    6,    7,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    6,    7,    14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    6,    7,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    8,    9,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    8,    9,    14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    8,    9,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    8,    9,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    8,    9,    14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    8,    9,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    8,    9,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    8,    9,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    8,    9,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    6,    7,    8,    9,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,    8,    9,    14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    6,    7,    8,    9,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    6,    7,    8,    9,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    6,    7,    8,    9,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    6,    7,    8,    9,    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    6,    7,    8,    9,    14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    10,   11,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    10,   11,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    10,   11,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    10,   11,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    6,    7,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,    10,   11,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,
+    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    6,    7,    10,   11,   14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,    10,   11,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    6,    7,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    6,    7,    10,   11,   14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    6,    7,
+    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 8,    9,    10,   11,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    8,    9,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    8,    9,    10,   11,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    8,    9,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    8,    9,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    8,    9,    10,   11,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    8,    9,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    8,    9,    10,   11,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    8,    9,    10,   11,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,
+    8,    9,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    6,    7,    8,    9,    10,   11,   14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    6,    7,    8,    9,
+    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,
+    8,    9,    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    6,    7,    8,    9,    10,   11,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    6,    7,    8,    9,
+    10,   11,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    6,    7,    8,    9,    10,   11,   14,   15,   0xFF, 0xFF,
+    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    12,   13,   14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    12,   13,   14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    6,    7,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,    12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    6,    7,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    6,    7,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    6,    7,    12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    6,    7,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    6,    7,    12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 8,    9,    12,   13,   14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    8,    9,
+    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    8,    9,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    8,    9,    12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    8,    9,
+    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    8,    9,    12,   13,   14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    8,    9,    12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    8,    9,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    6,    7,    8,    9,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,    8,    9,    12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,
+    8,    9,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    6,    7,    8,    9,    12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,    8,    9,    12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    6,    7,    8,    9,    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    6,    7,    8,    9,    12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    6,    7,
+    8,    9,    12,   13,   14,   15,   0xFF, 0xFF, 10,   11,   12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    10,   11,   12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    4,    5,    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    10,   11,   12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,
+    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    10,   11,   12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 6,    7,    10,   11,   12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    6,    7,
+    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    6,    7,    10,   11,   12,   13,   14,   15,   0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    6,    7,    10,   11,
+    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    6,    7,
+    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    4,    5,    6,    7,    10,   11,   12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    4,    5,    6,    7,    10,   11,
+    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    4,    5,    6,    7,    10,   11,   12,   13,   14,   15,   0xFF, 0xFF,
+    8,    9,    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    8,    9,    10,   11,   12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    8,    9,
+    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    2,    3,    8,    9,    10,   11,   12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 4,    5,    8,    9,    10,   11,   12,   13,
+    14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,
+    8,    9,    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF,
+    2,    3,    4,    5,    8,    9,    10,   11,   12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,    4,    5,    8,    9,
+    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 6,    7,    8,    9,
+    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0,    1,    6,    7,    8,    9,    10,   11,   12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 2,    3,    6,    7,    8,    9,    10,   11,
+    12,   13,   14,   15,   0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    2,    3,
+    6,    7,    8,    9,    10,   11,   12,   13,   14,   15,   0xFF, 0xFF,
+    4,    5,    6,    7,    8,    9,    10,   11,   12,   13,   14,   15,
+    0xFF, 0xFF, 0xFF, 0xFF, 0,    1,    4,    5,    6,    7,    8,    9,
+    10,   11,   12,   13,   14,   15,   0xFF, 0xFF, 2,    3,    4,    5,
+    6,    7,    8,    9,    10,   11,   12,   13,   14,   15,   0xFF, 0xFF,
+    0,    1,    2,    3,    4,    5,    6,    7,    8,    9,    10,   11,
+    12,   13,   14,   15};
+
+/**
+ * From Schlegel et al., Fast Sorted-Set Intersection using SIMD Instructions
+ * Optimized by D. Lemire on May 3rd 2013
+ */
+CROARING_TARGET_AVX2
+int32_t intersect_vector16(const uint16_t *__restrict__ A, size_t s_a,
+    const uint16_t *__restrict__ B, size_t s_b,
+    uint16_t *C) {
+    size_t count = 0;
+    size_t i_a = 0, i_b = 0;
+    const int vectorlength = sizeof(__m128i) / sizeof(uint16_t);
+    const size_t st_a = (s_a / vectorlength) * vectorlength;
+    const size_t st_b = (s_b / vectorlength) * vectorlength;
+    __m128i v_a, v_b;
+    if ((i_a < st_a) && (i_b < st_b)) {
+        v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+        v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+        while ((A[i_a] == 0) || (B[i_b] == 0)) {
+            const __m128i res_v = _mm_cmpestrm(
+                v_b, vectorlength, v_a, vectorlength,
+                _SIDD_UWORD_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_BIT_MASK);
+            const int r = _mm_extract_epi32(res_v, 0);
+            __m128i sm16 = _mm_loadu_si128((const __m128i *)shuffle_mask16 + r);
+            __m128i p = _mm_shuffle_epi8(v_a, sm16);
+            _mm_storeu_si128((__m128i *)&C[count], p);  // can overflow
+            count += _mm_popcnt_u32(r);
+            const uint16_t a_max = A[i_a + vectorlength - 1];
+            const uint16_t b_max = B[i_b + vectorlength - 1];
+            if (a_max <= b_max) {
+                i_a += vectorlength;
+                if (i_a == st_a) break;
+                v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+            }
+            if (b_max <= a_max) {
+                i_b += vectorlength;
+                if (i_b == st_b) break;
+                v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+            }
+        }
+        if ((i_a < st_a) && (i_b < st_b))
+            while (true) {
+                const __m128i res_v = _mm_cmpistrm(
+                    v_b, v_a,
+                    _SIDD_UWORD_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_BIT_MASK);
+                const int r = _mm_extract_epi32(res_v, 0);
+                __m128i sm16 =
+                    _mm_loadu_si128((const __m128i *)shuffle_mask16 + r);
+                __m128i p = _mm_shuffle_epi8(v_a, sm16);
+                _mm_storeu_si128((__m128i *)&C[count], p);  // can overflow
+                count += _mm_popcnt_u32(r);
+                const uint16_t a_max = A[i_a + vectorlength - 1];
+                const uint16_t b_max = B[i_b + vectorlength - 1];
+                if (a_max <= b_max) {
+                    i_a += vectorlength;
+                    if (i_a == st_a) break;
+                    v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+                }
+                if (b_max <= a_max) {
+                    i_b += vectorlength;
+                    if (i_b == st_b) break;
+                    v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+                }
+            }
+    }
+    // intersect the tail using scalar intersection
+    while (i_a < s_a && i_b < s_b) {
+        uint16_t a = A[i_a];
+        uint16_t b = B[i_b];
+        if (a < b) {
+            i_a++;
+        } else if (b < a) {
+            i_b++;
+        } else {
+            C[count] = a;  //==b;
+            count++;
+            i_a++;
+            i_b++;
+        }
+    }
+    return (int32_t)count;
+}
+
+ALLOW_UNALIGNED
+int array_container_to_uint32_array_vector16(void *vout, const uint16_t *array,
+    size_t cardinality,
+    uint32_t base) {
+    int outpos = 0;
+    uint32_t *out = (uint32_t *)vout;
+    size_t i = 0;
+    for (; i + sizeof(__m128i) / sizeof(uint16_t) <= cardinality;
+        i += sizeof(__m128i) / sizeof(uint16_t)) {
+        __m128i vinput = _mm_loadu_si128((const __m128i *)(array + i));
+        __m256i voutput = _mm256_add_epi32(_mm256_cvtepu16_epi32(vinput),
+            _mm256_set1_epi32(base));
+        _mm256_storeu_si256((__m256i *)(out + outpos), voutput);
+        outpos += sizeof(__m256i) / sizeof(uint32_t);
+    }
+    for (; i < cardinality; ++i) {
+        const uint32_t val = base + array[i];
+        memcpy(out + outpos, &val,
+            sizeof(uint32_t));  // should be compiled as a MOV on x64
+        outpos++;
+    }
+    return outpos;
+}
+
+int32_t intersect_vector16_inplace(uint16_t *__restrict__ A, size_t s_a,
+    const uint16_t *__restrict__ B, size_t s_b) {
+    size_t count = 0;
+    size_t i_a = 0, i_b = 0;
+    const int vectorlength = sizeof(__m128i) / sizeof(uint16_t);
+    const size_t st_a = (s_a / vectorlength) * vectorlength;
+    const size_t st_b = (s_b / vectorlength) * vectorlength;
+    __m128i v_a, v_b;
+    if ((i_a < st_a) && (i_b < st_b)) {
+        v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+        v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+        __m128i tmp[2] = {_mm_setzero_si128()};
+        size_t tmp_count = 0;
+        while ((A[i_a] == 0) || (B[i_b] == 0)) {
+            const __m128i res_v = _mm_cmpestrm(
+                v_b, vectorlength, v_a, vectorlength,
+                _SIDD_UWORD_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_BIT_MASK);
+            const int r = _mm_extract_epi32(res_v, 0);
+            __m128i sm16 = _mm_loadu_si128((const __m128i *)shuffle_mask16 + r);
+            __m128i p = _mm_shuffle_epi8(v_a, sm16);
+            _mm_storeu_si128((__m128i *)&((uint16_t *)tmp)[tmp_count], p);
+            tmp_count += _mm_popcnt_u32(r);
+            const uint16_t a_max = A[i_a + vectorlength - 1];
+            const uint16_t b_max = B[i_b + vectorlength - 1];
+            if (a_max <= b_max) {
+                _mm_storeu_si128((__m128i *)&A[count], tmp[0]);
+                _mm_storeu_si128(tmp, _mm_setzero_si128());
+                count += tmp_count;
+                tmp_count = 0;
+                i_a += vectorlength;
+                if (i_a == st_a) break;
+                v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+            }
+            if (b_max <= a_max) {
+                i_b += vectorlength;
+                if (i_b == st_b) break;
+                v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+            }
+        }
+        if ((i_a < st_a) && (i_b < st_b)) {
+            while (true) {
+                const __m128i res_v = _mm_cmpistrm(
+                    v_b, v_a,
+                    _SIDD_UWORD_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_BIT_MASK);
+                const int r = _mm_extract_epi32(res_v, 0);
+                __m128i sm16 =
+                    _mm_loadu_si128((const __m128i *)shuffle_mask16 + r);
+                __m128i p = _mm_shuffle_epi8(v_a, sm16);
+                _mm_storeu_si128((__m128i *)&((uint16_t *)tmp)[tmp_count], p);
+                tmp_count += _mm_popcnt_u32(r);
+                const uint16_t a_max = A[i_a + vectorlength - 1];
+                const uint16_t b_max = B[i_b + vectorlength - 1];
+                if (a_max <= b_max) {
+                    _mm_storeu_si128((__m128i *)&A[count], tmp[0]);
+                    _mm_storeu_si128(tmp, _mm_setzero_si128());
+                    count += tmp_count;
+                    tmp_count = 0;
+                    i_a += vectorlength;
+                    if (i_a == st_a) break;
+                    v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+                }
+                if (b_max <= a_max) {
+                    i_b += vectorlength;
+                    if (i_b == st_b) break;
+                    v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+                }
+            }
+        }
+        // tmp_count <= 8, so this does not affect efficiency so much
+        for (size_t i = 0; i < tmp_count; i++) {
+            A[count] = ((uint16_t *)tmp)[i];
+            count++;
+        }
+        i_a += tmp_count;  // We can at least jump pass $tmp_count elements in A
+    }
+    // intersect the tail using scalar intersection
+    while (i_a < s_a && i_b < s_b) {
+        uint16_t a = A[i_a];
+        uint16_t b = B[i_b];
+        if (a < b) {
+            i_a++;
+        } else if (b < a) {
+            i_b++;
+        } else {
+            A[count] = a;  //==b;
+            count++;
+            i_a++;
+            i_b++;
+        }
+    }
+    return (int32_t)count;
+}
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+int32_t intersect_vector16_cardinality(const uint16_t *__restrict__ A,
+    size_t s_a,
+    const uint16_t *__restrict__ B,
+    size_t s_b) {
+    size_t count = 0;
+    size_t i_a = 0, i_b = 0;
+    const int vectorlength = sizeof(__m128i) / sizeof(uint16_t);
+    const size_t st_a = (s_a / vectorlength) * vectorlength;
+    const size_t st_b = (s_b / vectorlength) * vectorlength;
+    __m128i v_a, v_b;
+    if ((i_a < st_a) && (i_b < st_b)) {
+        v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+        v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+        while ((A[i_a] == 0) || (B[i_b] == 0)) {
+            const __m128i res_v = _mm_cmpestrm(
+                v_b, vectorlength, v_a, vectorlength,
+                _SIDD_UWORD_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_BIT_MASK);
+            const int r = _mm_extract_epi32(res_v, 0);
+            count += _mm_popcnt_u32(r);
+            const uint16_t a_max = A[i_a + vectorlength - 1];
+            const uint16_t b_max = B[i_b + vectorlength - 1];
+            if (a_max <= b_max) {
+                i_a += vectorlength;
+                if (i_a == st_a) break;
+                v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+            }
+            if (b_max <= a_max) {
+                i_b += vectorlength;
+                if (i_b == st_b) break;
+                v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+            }
+        }
+        if ((i_a < st_a) && (i_b < st_b))
+            while (true) {
+                const __m128i res_v = _mm_cmpistrm(
+                    v_b, v_a,
+                    _SIDD_UWORD_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_BIT_MASK);
+                const int r = _mm_extract_epi32(res_v, 0);
+                count += _mm_popcnt_u32(r);
+                const uint16_t a_max = A[i_a + vectorlength - 1];
+                const uint16_t b_max = B[i_b + vectorlength - 1];
+                if (a_max <= b_max) {
+                    i_a += vectorlength;
+                    if (i_a == st_a) break;
+                    v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+                }
+                if (b_max <= a_max) {
+                    i_b += vectorlength;
+                    if (i_b == st_b) break;
+                    v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+                }
+            }
+    }
+    // intersect the tail using scalar intersection
+    while (i_a < s_a && i_b < s_b) {
+        uint16_t a = A[i_a];
+        uint16_t b = B[i_b];
+        if (a < b) {
+            i_a++;
+        } else if (b < a) {
+            i_b++;
+        } else {
+            count++;
+            i_a++;
+            i_b++;
+        }
+    }
+    return (int32_t)count;
+}
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+/////////
+// Warning:
+// This function may not be safe if A == C or B == C.
+/////////
+int32_t difference_vector16(const uint16_t *__restrict__ A, size_t s_a,
+    const uint16_t *__restrict__ B, size_t s_b,
+    uint16_t *C) {
+    // we handle the degenerate case
+    if (s_a == 0) return 0;
+    if (s_b == 0) {
+        if (A != C) memcpy(C, A, sizeof(uint16_t) * s_a);
+        return (int32_t)s_a;
+    }
+    // handle the leading zeroes, it is messy but it allows us to use the fast
+    // _mm_cmpistrm instrinsic safely
+    int32_t count = 0;
+    if ((A[0] == 0) || (B[0] == 0)) {
+        if ((A[0] == 0) && (B[0] == 0)) {
+            A++;
+            s_a--;
+            B++;
+            s_b--;
+        } else if (A[0] == 0) {
+            C[count++] = 0;
+            A++;
+            s_a--;
+        } else {
+            B++;
+            s_b--;
+        }
+    }
+    // at this point, we have two non-empty arrays, made of non-zero
+    // increasing values.
+    size_t i_a = 0, i_b = 0;
+    const size_t vectorlength = sizeof(__m128i) / sizeof(uint16_t);
+    const size_t st_a = (s_a / vectorlength) * vectorlength;
+    const size_t st_b = (s_b / vectorlength) * vectorlength;
+    if ((i_a < st_a) && (i_b < st_b)) {  // this is the vectorized code path
+        __m128i v_a, v_b;                //, v_bmax;
+        // we load a vector from A and a vector from B
+        v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+        v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+        // we have a runningmask which indicates which values from A have been
+        // spotted in B, these don't get written out.
+        __m128i runningmask_a_found_in_b = _mm_setzero_si128();
+        /****
+         * start of the main vectorized loop
+         *****/
+        while (true) {
+            // afoundinb will contain a mask indicate for each entry in A
+            // whether it is seen
+            // in B
+            const __m128i a_found_in_b = _mm_cmpistrm(
+                v_b, v_a,
+                _SIDD_UWORD_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_BIT_MASK);
+            runningmask_a_found_in_b =
+                _mm_or_si128(runningmask_a_found_in_b, a_found_in_b);
+            // we always compare the last values of A and B
+            const uint16_t a_max = A[i_a + vectorlength - 1];
+            const uint16_t b_max = B[i_b + vectorlength - 1];
+            if (a_max <= b_max) {
+                // Ok. In this code path, we are ready to write our v_a
+                // because there is no need to read more from B, they will
+                // all be large values.
+                const int bitmask_belongs_to_difference =
+                    _mm_extract_epi32(runningmask_a_found_in_b, 0) ^ 0xFF;
+                /*** next few lines are probably expensive *****/
+                __m128i sm16 = _mm_loadu_si128((const __m128i *)shuffle_mask16 +
+                                               bitmask_belongs_to_difference);
+                __m128i p = _mm_shuffle_epi8(v_a, sm16);
+                _mm_storeu_si128((__m128i *)&C[count], p);  // can overflow
+                count += _mm_popcnt_u32(bitmask_belongs_to_difference);
+                // we advance a
+                i_a += vectorlength;
+                if (i_a == st_a)  // no more
+                    break;
+                runningmask_a_found_in_b = _mm_setzero_si128();
+                v_a = _mm_lddqu_si128((__m128i *)&A[i_a]);
+            }
+            if (b_max <= a_max) {
+                // in this code path, the current v_b has become useless
+                i_b += vectorlength;
+                if (i_b == st_b) break;
+                v_b = _mm_lddqu_si128((__m128i *)&B[i_b]);
+            }
+        }
+        // at this point, either we have i_a == st_a, which is the end of the
+        // vectorized processing,
+        // or we have i_b == st_b,  and we are not done processing the vector...
+        // so we need to finish it off.
+        if (i_a < st_a) {        // we have unfinished business...
+            uint16_t buffer[8];  // buffer to do a masked load
+            memset(buffer, 0, 8 * sizeof(uint16_t));
+            memcpy(buffer, B + i_b, (s_b - i_b) * sizeof(uint16_t));
+            v_b = _mm_lddqu_si128((__m128i *)buffer);
+            const __m128i a_found_in_b = _mm_cmpistrm(
+                v_b, v_a,
+                _SIDD_UWORD_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_BIT_MASK);
+            runningmask_a_found_in_b =
+                _mm_or_si128(runningmask_a_found_in_b, a_found_in_b);
+            const int bitmask_belongs_to_difference =
+                _mm_extract_epi32(runningmask_a_found_in_b, 0) ^ 0xFF;
+            __m128i sm16 = _mm_loadu_si128((const __m128i *)shuffle_mask16 +
+                                           bitmask_belongs_to_difference);
+            __m128i p = _mm_shuffle_epi8(v_a, sm16);
+            _mm_storeu_si128((__m128i *)&C[count], p);  // can overflow
+            count += _mm_popcnt_u32(bitmask_belongs_to_difference);
+            i_a += vectorlength;
+        }
+        // at this point we should have i_a == st_a and i_b == st_b
+    }
+    // do the tail using scalar code
+    while (i_a < s_a && i_b < s_b) {
+        uint16_t a = A[i_a];
+        uint16_t b = B[i_b];
+        if (b < a) {
+            i_b++;
+        } else if (a < b) {
+            C[count] = a;
+            count++;
+            i_a++;
+        } else {  //==
+            i_a++;
+            i_b++;
+        }
+    }
+    if (i_a < s_a) {
+        if (C == A) {
+            assert((size_t)count <= i_a);
+            if ((size_t)count < i_a) {
+                memmove(C + count, A + i_a, sizeof(uint16_t) * (s_a - i_a));
+            }
+        } else {
+            for (size_t i = 0; i < (s_a - i_a); i++) {
+                C[count + i] = A[i + i_a];
+            }
+        }
+        count += (int32_t)(s_a - i_a);
+    }
+    return count;
+}
+CROARING_UNTARGET_AVX2
+#endif  // CROARING_IS_X64
+
+/**
+ * Branchless binary search going after 4 values at once.
+ * Assumes that array is sorted.
+ * You have that array[*index1] >= target1, array[*index12] >= target2, ...
+ * except when *index1 = n, in which case you know that all values in array are
+ * smaller than target1, and so forth.
+ * It has logarithmic complexity.
+ */
+static void binarySearch4(const uint16_t *array, int32_t n, uint16_t target1,
+    uint16_t target2, uint16_t target3, uint16_t target4,
+    int32_t *index1, int32_t *index2, int32_t *index3,
+    int32_t *index4) {
+    const uint16_t *base1 = array;
+    const uint16_t *base2 = array;
+    const uint16_t *base3 = array;
+    const uint16_t *base4 = array;
+    if (n == 0) return;
+    while (n > 1) {
+        int32_t half = n >> 1;
+        base1 = (base1[half] < target1) ? &base1[half] : base1;
+        base2 = (base2[half] < target2) ? &base2[half] : base2;
+        base3 = (base3[half] < target3) ? &base3[half] : base3;
+        base4 = (base4[half] < target4) ? &base4[half] : base4;
+        n -= half;
+    }
+    *index1 = (int32_t)((*base1 < target1) + base1 - array);
+    *index2 = (int32_t)((*base2 < target2) + base2 - array);
+    *index3 = (int32_t)((*base3 < target3) + base3 - array);
+    *index4 = (int32_t)((*base4 < target4) + base4 - array);
+}
+
+/**
+ * Branchless binary search going after 2 values at once.
+ * Assumes that array is sorted.
+ * You have that array[*index1] >= target1, array[*index12] >= target2.
+ * except when *index1 = n, in which case you know that all values in array are
+ * smaller than target1, and so forth.
+ * It has logarithmic complexity.
+ */
+static void binarySearch2(const uint16_t *array, int32_t n, uint16_t target1,
+    uint16_t target2, int32_t *index1, int32_t *index2) {
+    const uint16_t *base1 = array;
+    const uint16_t *base2 = array;
+    if (n == 0) return;
+    while (n > 1) {
+        int32_t half = n >> 1;
+        base1 = (base1[half] < target1) ? &base1[half] : base1;
+        base2 = (base2[half] < target2) ? &base2[half] : base2;
+        n -= half;
+    }
+    *index1 = (int32_t)((*base1 < target1) + base1 - array);
+    *index2 = (int32_t)((*base2 < target2) + base2 - array);
+}
+
+/* Computes the intersection between one small and one large set of uint16_t.
+ * Stores the result into buffer and return the number of elements.
+ * Processes the small set in blocks of 4 values calling binarySearch4
+ * and binarySearch2. This approach can be slightly superior to a conventional
+ * galloping search in some instances.
+ */
+int32_t intersect_skewed_uint16(const uint16_t *small, size_t size_s,
+    const uint16_t *large, size_t size_l,
+    uint16_t *buffer) {
+    size_t pos = 0, idx_l = 0, idx_s = 0;
+
+    if (0 == size_s) {
+        return 0;
+    }
+    int32_t index1 = 0, index2 = 0, index3 = 0, index4 = 0;
+    while ((idx_s + 4 <= size_s) && (idx_l < size_l)) {
+        uint16_t target1 = small[idx_s];
+        uint16_t target2 = small[idx_s + 1];
+        uint16_t target3 = small[idx_s + 2];
+        uint16_t target4 = small[idx_s + 3];
+        binarySearch4(large + idx_l, (int32_t)(size_l - idx_l), target1,
+            target2, target3, target4, &index1, &index2, &index3,
+            &index4);
+        if ((index1 + idx_l < size_l) && (large[idx_l + index1] == target1)) {
+            buffer[pos++] = target1;
+        }
+        if ((index2 + idx_l < size_l) && (large[idx_l + index2] == target2)) {
+            buffer[pos++] = target2;
+        }
+        if ((index3 + idx_l < size_l) && (large[idx_l + index3] == target3)) {
+            buffer[pos++] = target3;
+        }
+        if ((index4 + idx_l < size_l) && (large[idx_l + index4] == target4)) {
+            buffer[pos++] = target4;
+        }
+        idx_s += 4;
+        idx_l += index4;
+    }
+    if ((idx_s + 2 <= size_s) && (idx_l < size_l)) {
+        uint16_t target1 = small[idx_s];
+        uint16_t target2 = small[idx_s + 1];
+        binarySearch2(large + idx_l, (int32_t)(size_l - idx_l), target1,
+            target2, &index1, &index2);
+        if ((index1 + idx_l < size_l) && (large[idx_l + index1] == target1)) {
+            buffer[pos++] = target1;
+        }
+        if ((index2 + idx_l < size_l) && (large[idx_l + index2] == target2)) {
+            buffer[pos++] = target2;
+        }
+        idx_s += 2;
+        idx_l += index2;
+    }
+    if ((idx_s < size_s) && (idx_l < size_l)) {
+        uint16_t val_s = small[idx_s];
+        int32_t index =
+            binarySearch(large + idx_l, (int32_t)(size_l - idx_l), val_s);
+        if (index >= 0) buffer[pos++] = val_s;
+    }
+    return (int32_t)pos;
+}
+
+// TODO: this could be accelerated, possibly, by using binarySearch4 as above.
+int32_t intersect_skewed_uint16_cardinality(const uint16_t *small,
+    size_t size_s,
+    const uint16_t *large,
+    size_t size_l) {
+    size_t pos = 0, idx_l = 0, idx_s = 0;
+
+    if (0 == size_s) {
+        return 0;
+    }
+
+    uint16_t val_l = large[idx_l], val_s = small[idx_s];
+
+    while (true) {
+        if (val_l < val_s) {
+            idx_l = advanceUntil(large, (int32_t)idx_l, (int32_t)size_l, val_s);
+            if (idx_l == size_l) break;
+            val_l = large[idx_l];
+        } else if (val_s < val_l) {
+            idx_s++;
+            if (idx_s == size_s) break;
+            val_s = small[idx_s];
+        } else {
+            pos++;
+            idx_s++;
+            if (idx_s == size_s) break;
+            val_s = small[idx_s];
+            idx_l = advanceUntil(large, (int32_t)idx_l, (int32_t)size_l, val_s);
+            if (idx_l == size_l) break;
+            val_l = large[idx_l];
+        }
+    }
+
+    return (int32_t)pos;
+}
+
+bool intersect_skewed_uint16_nonempty(const uint16_t *small, size_t size_s,
+    const uint16_t *large, size_t size_l) {
+    size_t idx_l = 0, idx_s = 0;
+
+    if (0 == size_s) {
+        return false;
+    }
+
+    uint16_t val_l = large[idx_l], val_s = small[idx_s];
+
+    while (true) {
+        if (val_l < val_s) {
+            idx_l = advanceUntil(large, (int32_t)idx_l, (int32_t)size_l, val_s);
+            if (idx_l == size_l) break;
+            val_l = large[idx_l];
+        } else if (val_s < val_l) {
+            idx_s++;
+            if (idx_s == size_s) break;
+            val_s = small[idx_s];
+        } else {
+            return true;
+        }
+    }
+
+    return false;
+}
+
+/**
+ * Generic intersection function.
+ */
+int32_t intersect_uint16(const uint16_t *A, const size_t lenA,
+    const uint16_t *B, const size_t lenB, uint16_t *out) {
+    const uint16_t *initout = out;
+    if (lenA == 0 || lenB == 0) return 0;
+    const uint16_t *endA = A + lenA;
+    const uint16_t *endB = B + lenB;
+
+    while (1) {
+        while (*A < *B) {
+        SKIP_FIRST_COMPARE:
+            if (++A == endA) return (int32_t)(out - initout);
+        }
+        while (*A > *B) {
+            if (++B == endB) return (int32_t)(out - initout);
+        }
+        if (*A == *B) {
+            *out++ = *A;
+            if (++A == endA || ++B == endB) return (int32_t)(out - initout);
+        } else {
+            goto SKIP_FIRST_COMPARE;
+        }
+    }
+    // return (int32_t)(out - initout);  // NOTREACHED
+}
+
+int32_t intersect_uint16_cardinality(const uint16_t *A, const size_t lenA,
+    const uint16_t *B, const size_t lenB) {
+    int32_t answer = 0;
+    if (lenA == 0 || lenB == 0) return 0;
+    const uint16_t *endA = A + lenA;
+    const uint16_t *endB = B + lenB;
+
+    while (1) {
+        while (*A < *B) {
+        SKIP_FIRST_COMPARE:
+            if (++A == endA) return answer;
+        }
+        while (*A > *B) {
+            if (++B == endB) return answer;
+        }
+        if (*A == *B) {
+            ++answer;
+            if (++A == endA || ++B == endB) return answer;
+        } else {
+            goto SKIP_FIRST_COMPARE;
+        }
+    }
+    // return answer;  // NOTREACHED
+}
+
+bool intersect_uint16_nonempty(const uint16_t *A, const size_t lenA,
+    const uint16_t *B, const size_t lenB) {
+    if (lenA == 0 || lenB == 0) return 0;
+    const uint16_t *endA = A + lenA;
+    const uint16_t *endB = B + lenB;
+
+    while (1) {
+        while (*A < *B) {
+        SKIP_FIRST_COMPARE:
+            if (++A == endA) return false;
+        }
+        while (*A > *B) {
+            if (++B == endB) return false;
+        }
+        if (*A == *B) {
+            return true;
+        } else {
+            goto SKIP_FIRST_COMPARE;
+        }
+    }
+    return false;  // NOTREACHED
+}
+
+/**
+ * Generic intersection function.
+ */
+size_t intersection_uint32(const uint32_t *A, const size_t lenA,
+    const uint32_t *B, const size_t lenB,
+    uint32_t *out) {
+    const uint32_t *initout = out;
+    if (lenA == 0 || lenB == 0) return 0;
+    const uint32_t *endA = A + lenA;
+    const uint32_t *endB = B + lenB;
+
+    while (1) {
+        while (*A < *B) {
+        SKIP_FIRST_COMPARE:
+            if (++A == endA) return (out - initout);
+        }
+        while (*A > *B) {
+            if (++B == endB) return (out - initout);
+        }
+        if (*A == *B) {
+            *out++ = *A;
+            if (++A == endA || ++B == endB) return (out - initout);
+        } else {
+            goto SKIP_FIRST_COMPARE;
+        }
+    }
+    // return (out - initout);  // NOTREACHED
+}
+
+size_t intersection_uint32_card(const uint32_t *A, const size_t lenA,
+    const uint32_t *B, const size_t lenB) {
+    if (lenA == 0 || lenB == 0) return 0;
+    size_t card = 0;
+    const uint32_t *endA = A + lenA;
+    const uint32_t *endB = B + lenB;
+
+    while (1) {
+        while (*A < *B) {
+        SKIP_FIRST_COMPARE:
+            if (++A == endA) return card;
+        }
+        while (*A > *B) {
+            if (++B == endB) return card;
+        }
+        if (*A == *B) {
+            card++;
+            if (++A == endA || ++B == endB) return card;
+        } else {
+            goto SKIP_FIRST_COMPARE;
+        }
+    }
+    // return card;  // NOTREACHED
+}
+
+// can one vectorize the computation of the union? (Update: Yes! See
+// union_vector16).
+
+size_t union_uint16(const uint16_t *set_1, size_t size_1, const uint16_t *set_2,
+    size_t size_2, uint16_t *buffer) {
+    size_t pos = 0, idx_1 = 0, idx_2 = 0;
+
+    if (0 == size_2) {
+        memmove(buffer, set_1, size_1 * sizeof(uint16_t));
+        return size_1;
+    }
+    if (0 == size_1) {
+        memmove(buffer, set_2, size_2 * sizeof(uint16_t));
+        return size_2;
+    }
+
+    uint16_t val_1 = set_1[idx_1], val_2 = set_2[idx_2];
+
+    while (true) {
+        if (val_1 < val_2) {
+            buffer[pos++] = val_1;
+            ++idx_1;
+            if (idx_1 >= size_1) break;
+            val_1 = set_1[idx_1];
+        } else if (val_2 < val_1) {
+            buffer[pos++] = val_2;
+            ++idx_2;
+            if (idx_2 >= size_2) break;
+            val_2 = set_2[idx_2];
+        } else {
+            buffer[pos++] = val_1;
+            ++idx_1;
+            ++idx_2;
+            if (idx_1 >= size_1 || idx_2 >= size_2) break;
+            val_1 = set_1[idx_1];
+            val_2 = set_2[idx_2];
+        }
+    }
+
+    if (idx_1 < size_1) {
+        const size_t n_elems = size_1 - idx_1;
+        memmove(buffer + pos, set_1 + idx_1, n_elems * sizeof(uint16_t));
+        pos += n_elems;
+    } else if (idx_2 < size_2) {
+        const size_t n_elems = size_2 - idx_2;
+        memmove(buffer + pos, set_2 + idx_2, n_elems * sizeof(uint16_t));
+        pos += n_elems;
+    }
+
+    return pos;
+}
+
+int difference_uint16(const uint16_t *a1, int length1, const uint16_t *a2,
+    int length2, uint16_t *a_out) {
+    int out_card = 0;
+    int k1 = 0, k2 = 0;
+    if (length1 == 0) return 0;
+    if (length2 == 0) {
+        if (a1 != a_out) memcpy(a_out, a1, sizeof(uint16_t) * length1);
+        return length1;
+    }
+    uint16_t s1 = a1[k1];
+    uint16_t s2 = a2[k2];
+    while (true) {
+        if (s1 < s2) {
+            a_out[out_card++] = s1;
+            ++k1;
+            if (k1 >= length1) {
+                break;
+            }
+            s1 = a1[k1];
+        } else if (s1 == s2) {
+            ++k1;
+            ++k2;
+            if (k1 >= length1) {
+                break;
+            }
+            if (k2 >= length2) {
+                memmove(a_out + out_card, a1 + k1,
+                    sizeof(uint16_t) * (length1 - k1));
+                return out_card + length1 - k1;
+            }
+            s1 = a1[k1];
+            s2 = a2[k2];
+        } else {  // if (val1>val2)
+            ++k2;
+            if (k2 >= length2) {
+                memmove(a_out + out_card, a1 + k1,
+                    sizeof(uint16_t) * (length1 - k1));
+                return out_card + length1 - k1;
+            }
+            s2 = a2[k2];
+        }
+    }
+    return out_card;
+}
+
+int32_t xor_uint16(const uint16_t *array_1, int32_t card_1,
+    const uint16_t *array_2, int32_t card_2, uint16_t *out) {
+    int32_t pos1 = 0, pos2 = 0, pos_out = 0;
+    while (pos1 < card_1 && pos2 < card_2) {
+        const uint16_t v1 = array_1[pos1];
+        const uint16_t v2 = array_2[pos2];
+        if (v1 == v2) {
+            ++pos1;
+            ++pos2;
+            continue;
+        }
+        if (v1 < v2) {
+            out[pos_out++] = v1;
+            ++pos1;
+        } else {
+            out[pos_out++] = v2;
+            ++pos2;
+        }
+    }
+    if (pos1 < card_1) {
+        const size_t n_elems = card_1 - pos1;
+        memcpy(out + pos_out, array_1 + pos1, n_elems * sizeof(uint16_t));
+        pos_out += (int32_t)n_elems;
+    } else if (pos2 < card_2) {
+        const size_t n_elems = card_2 - pos2;
+        memcpy(out + pos_out, array_2 + pos2, n_elems * sizeof(uint16_t));
+        pos_out += (int32_t)n_elems;
+    }
+    return pos_out;
+}
+
+#if CROARING_IS_X64
+
+/***
+ * start of the SIMD 16-bit union code
+ *
+ */
+CROARING_TARGET_AVX2
+
+// Assuming that vInput1 and vInput2 are sorted, produces a sorted output going
+// from vecMin all the way to vecMax
+// developed originally for merge sort using SIMD instructions.
+// Standard merge. See, e.g., Inoue and Taura, SIMD- and Cache-Friendly
+// Algorithm for Sorting an Array of Structures
+static inline void sse_merge(const __m128i *vInput1,
+    const __m128i *vInput2,              // input 1 & 2
+    __m128i *vecMin, __m128i *vecMax) {  // output
+    __m128i vecTmp;
+    vecTmp = _mm_min_epu16(*vInput1, *vInput2);
+    *vecMax = _mm_max_epu16(*vInput1, *vInput2);
+    vecTmp = _mm_alignr_epi8(vecTmp, vecTmp, 2);
+    *vecMin = _mm_min_epu16(vecTmp, *vecMax);
+    *vecMax = _mm_max_epu16(vecTmp, *vecMax);
+    vecTmp = _mm_alignr_epi8(*vecMin, *vecMin, 2);
+    *vecMin = _mm_min_epu16(vecTmp, *vecMax);
+    *vecMax = _mm_max_epu16(vecTmp, *vecMax);
+    vecTmp = _mm_alignr_epi8(*vecMin, *vecMin, 2);
+    *vecMin = _mm_min_epu16(vecTmp, *vecMax);
+    *vecMax = _mm_max_epu16(vecTmp, *vecMax);
+    vecTmp = _mm_alignr_epi8(*vecMin, *vecMin, 2);
+    *vecMin = _mm_min_epu16(vecTmp, *vecMax);
+    *vecMax = _mm_max_epu16(vecTmp, *vecMax);
+    vecTmp = _mm_alignr_epi8(*vecMin, *vecMin, 2);
+    *vecMin = _mm_min_epu16(vecTmp, *vecMax);
+    *vecMax = _mm_max_epu16(vecTmp, *vecMax);
+    vecTmp = _mm_alignr_epi8(*vecMin, *vecMin, 2);
+    *vecMin = _mm_min_epu16(vecTmp, *vecMax);
+    *vecMax = _mm_max_epu16(vecTmp, *vecMax);
+    vecTmp = _mm_alignr_epi8(*vecMin, *vecMin, 2);
+    *vecMin = _mm_min_epu16(vecTmp, *vecMax);
+    *vecMax = _mm_max_epu16(vecTmp, *vecMax);
+    *vecMin = _mm_alignr_epi8(*vecMin, *vecMin, 2);
+}
+CROARING_UNTARGET_AVX2
+// used by store_unique, generated by simdunion.py
+static uint8_t uniqshuf[] = {
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,
+    0xc,  0xd,  0xe,  0xf,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,
+    0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF,
+    0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0x8,  0x9,
+    0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,
+    0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0x8,  0x9,  0xa,  0xb,
+    0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x8,  0x9,
+    0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x8,  0x9,
+    0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,
+    0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0x6,  0x7,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,  0xa,  0xb,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x6,  0x7,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x6,  0x7,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,  0xa,  0xb,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0xa,  0xb,
+    0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0xa,  0xb,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0xa,  0xb,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0xa,  0xb,
+    0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xa,  0xb,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,
+    0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,
+    0x8,  0x9,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0x8,  0x9,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,  0x8,  0x9,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,
+    0x8,  0x9,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x6,  0x7,  0x8,  0x9,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x8,  0x9,
+    0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0x8,  0x9,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0x8,  0x9,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x8,  0x9,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x8,  0x9,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x8,  0x9,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x8,  0x9,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x8,  0x9,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0x6,  0x7,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0x6,  0x7,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,
+    0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x6,  0x7,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0xc,  0xd,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0xc,  0xd,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xc,  0xd,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,
+    0x8,  0x9,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0x8,  0x9,
+    0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x8,  0x9,  0xa,  0xb,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0x8,  0x9,  0xa,  0xb,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0x8,  0x9,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0x8,  0x9,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x8,  0x9,  0xa,  0xb,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x8,  0x9,
+    0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x8,  0x9,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x8,  0x9,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0x6,  0x7,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0xa,  0xb,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,
+    0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,  0xa,  0xb,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,
+    0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x6,  0x7,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0xa,  0xb,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0xa,  0xb,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xa,  0xb,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0x6,  0x7,  0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0x8,  0x9,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,
+    0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x6,  0x7,  0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0x8,  0x9,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x8,  0x9,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x8,  0x9,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x8,  0x9,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0x6,  0x7,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x6,  0x7,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x6,  0x7,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0xe,  0xf,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0xe,  0xf,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xe,  0xf,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,
+    0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,
+    0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,
+    0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x8,  0x9,
+    0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x8,  0x9,  0xa,  0xb,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x8,  0x9,  0xa,  0xb,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0xa,  0xb,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0xa,  0xb,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0x6,  0x7,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0x6,  0x7,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0xa,  0xb,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,
+    0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x6,  0x7,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0xa,  0xb,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0xa,  0xb,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0xa,  0xb,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xa,  0xb,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,
+    0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0x6,  0x7,  0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x6,  0x7,  0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x6,  0x7,  0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,  0x8,  0x9,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0x8,  0x9,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0x8,  0x9,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x8,  0x9,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x8,  0x9,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x8,  0x9,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0x6,  0x7,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,  0xc,  0xd,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x6,  0x7,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0xc,  0xd,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0xc,  0xd,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xc,  0xd,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,
+    0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0x8,  0x9,
+    0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,
+    0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0x8,  0x9,  0xa,  0xb,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x8,  0x9,
+    0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x8,  0x9,
+    0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x8,  0x9,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,
+    0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0x6,  0x7,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,  0xa,  0xb,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x6,  0x7,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x6,  0x7,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,  0xa,  0xb,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0xa,  0xb,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0xa,  0xb,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0xa,  0xb,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0xa,  0xb,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xa,  0xb,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0x6,  0x7,  0x8,  0x9,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x6,  0x7,
+    0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,  0x8,  0x9,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x6,  0x7,
+    0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x6,  0x7,  0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x8,  0x9,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,
+    0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x4,  0x5,  0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x8,  0x9,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x8,  0x9,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x4,  0x5,  0x6,  0x7,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,
+    0x6,  0x7,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x4,  0x5,  0x6,  0x7,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,  0x6,  0x7,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0x6,  0x7,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x6,  0x7,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x6,  0x7,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x2,  0x3,
+    0x4,  0x5,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x2,  0x3,  0x4,  0x5,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0x4,  0x5,  0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x4,  0x5,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0x0,  0x1,  0x2,  0x3,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0x2,  0x3,  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0,  0x1,  0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+    0xFF, 0xFF, 0xFF, 0xFF};
+CROARING_TARGET_AVX2
+// write vector new, while omitting repeated values assuming that previously
+// written vector was "old"
+static inline int store_unique(__m128i old, __m128i newval, uint16_t *output) {
+    __m128i vecTmp = _mm_alignr_epi8(newval, old, 16 - 2);
+    // lots of high latency instructions follow (optimize?)
+    int M = _mm_movemask_epi8(
+        _mm_packs_epi16(_mm_cmpeq_epi16(vecTmp, newval), _mm_setzero_si128()));
+    int numberofnewvalues = 8 - _mm_popcnt_u32(M);
+    __m128i key = _mm_lddqu_si128((const __m128i *)uniqshuf + M);
+    __m128i val = _mm_shuffle_epi8(newval, key);
+    _mm_storeu_si128((__m128i *)output, val);
+    return numberofnewvalues;
+}
+CROARING_UNTARGET_AVX2
+
+// working in-place, this function overwrites the repeated values
+// could be avoided?
+static inline uint32_t unique(uint16_t *out, uint32_t len) {
+    uint32_t pos = 1;
+    for (uint32_t i = 1; i < len; ++i) {
+        if (out[i] != out[i - 1]) {
+            out[pos++] = out[i];
+        }
+    }
+    return pos;
+}
+
+// use with qsort, could be avoided
+static int uint16_compare(const void *a, const void *b) {
+    return (*(uint16_t *)a - *(uint16_t *)b);
+}
+
+CROARING_TARGET_AVX2
+// a one-pass SSE union algorithm
+// This function may not be safe if array1 == output or array2 == output.
+uint32_t union_vector16(const uint16_t *__restrict__ array1, uint32_t length1,
+    const uint16_t *__restrict__ array2, uint32_t length2,
+    uint16_t *__restrict__ output) {
+    if ((length1 < 8) || (length2 < 8)) {
+        return (uint32_t)union_uint16(array1, length1, array2, length2, output);
+    }
+    __m128i vA, vB, V, vecMin, vecMax;
+    __m128i laststore;
+    uint16_t *initoutput = output;
+    uint32_t len1 = length1 / 8;
+    uint32_t len2 = length2 / 8;
+    uint32_t pos1 = 0;
+    uint32_t pos2 = 0;
+    // we start the machine
+    vA = _mm_lddqu_si128((const __m128i *)array1 + pos1);
+    pos1++;
+    vB = _mm_lddqu_si128((const __m128i *)array2 + pos2);
+    pos2++;
+    sse_merge(&vA, &vB, &vecMin, &vecMax);
+    laststore = _mm_set1_epi16(-1);
+    output += store_unique(laststore, vecMin, output);
+    laststore = vecMin;
+    if ((pos1 < len1) && (pos2 < len2)) {
+        uint16_t curA, curB;
+        curA = array1[8 * pos1];
+        curB = array2[8 * pos2];
+        while (true) {
+            if (curA <= curB) {
+                V = _mm_lddqu_si128((const __m128i *)array1 + pos1);
+                pos1++;
+                if (pos1 < len1) {
+                    curA = array1[8 * pos1];
+                } else {
+                    break;
+                }
+            } else {
+                V = _mm_lddqu_si128((const __m128i *)array2 + pos2);
+                pos2++;
+                if (pos2 < len2) {
+                    curB = array2[8 * pos2];
+                } else {
+                    break;
+                }
+            }
+            sse_merge(&V, &vecMax, &vecMin, &vecMax);
+            output += store_unique(laststore, vecMin, output);
+            laststore = vecMin;
+        }
+        sse_merge(&V, &vecMax, &vecMin, &vecMax);
+        output += store_unique(laststore, vecMin, output);
+        laststore = vecMin;
+    }
+    // we finish the rest off using a scalar algorithm
+    // could be improved?
+    //
+    // copy the small end on a tmp buffer
+    uint32_t len = (uint32_t)(output - initoutput);
+    uint16_t buffer[16];
+    uint32_t leftoversize = store_unique(laststore, vecMax, buffer);
+    if (pos1 == len1) {
+        memcpy(buffer + leftoversize, array1 + 8 * pos1,
+            (length1 - 8 * len1) * sizeof(uint16_t));
+        leftoversize += length1 - 8 * len1;
+        qsort(buffer, leftoversize, sizeof(uint16_t), uint16_compare);
+
+        leftoversize = unique(buffer, leftoversize);
+        len += (uint32_t)union_uint16(buffer, leftoversize, array2 + 8 * pos2,
+            length2 - 8 * pos2, output);
+    } else {
+        memcpy(buffer + leftoversize, array2 + 8 * pos2,
+            (length2 - 8 * len2) * sizeof(uint16_t));
+        leftoversize += length2 - 8 * len2;
+        qsort(buffer, leftoversize, sizeof(uint16_t), uint16_compare);
+        leftoversize = unique(buffer, leftoversize);
+        len += (uint32_t)union_uint16(buffer, leftoversize, array1 + 8 * pos1,
+            length1 - 8 * pos1, output);
+    }
+    return len;
+}
+CROARING_UNTARGET_AVX2
+
+/**
+ * End of the SIMD 16-bit union code
+ *
+ */
+
+/**
+ * Start of SIMD 16-bit XOR code
+ */
+
+CROARING_TARGET_AVX2
+// write vector new, while omitting repeated values assuming that previously
+// written vector was "old"
+static inline int store_unique_xor(__m128i old, __m128i newval,
+    uint16_t *output) {
+    __m128i vecTmp1 = _mm_alignr_epi8(newval, old, 16 - 4);
+    __m128i vecTmp2 = _mm_alignr_epi8(newval, old, 16 - 2);
+    __m128i equalleft = _mm_cmpeq_epi16(vecTmp2, vecTmp1);
+    __m128i equalright = _mm_cmpeq_epi16(vecTmp2, newval);
+    __m128i equalleftoright = _mm_or_si128(equalleft, equalright);
+    int M = _mm_movemask_epi8(
+        _mm_packs_epi16(equalleftoright, _mm_setzero_si128()));
+    int numberofnewvalues = 8 - _mm_popcnt_u32(M);
+    __m128i key = _mm_lddqu_si128((const __m128i *)uniqshuf + M);
+    __m128i val = _mm_shuffle_epi8(vecTmp2, key);
+    _mm_storeu_si128((__m128i *)output, val);
+    return numberofnewvalues;
+}
+CROARING_UNTARGET_AVX2
+
+// working in-place, this function overwrites the repeated values
+// could be avoided? Warning: assumes len > 0
+static inline uint32_t unique_xor(uint16_t *out, uint32_t len) {
+    uint32_t pos = 1;
+    for (uint32_t i = 1; i < len; ++i) {
+        if (out[i] != out[i - 1]) {
+            out[pos++] = out[i];
+        } else
+            pos--;  // if it is identical to previous, delete it
+    }
+    return pos;
+}
+CROARING_TARGET_AVX2
+// a one-pass SSE xor algorithm
+uint32_t xor_vector16(const uint16_t *__restrict__ array1, uint32_t length1,
+    const uint16_t *__restrict__ array2, uint32_t length2,
+    uint16_t *__restrict__ output) {
+    if ((length1 < 8) || (length2 < 8)) {
+        return xor_uint16(array1, length1, array2, length2, output);
+    }
+    __m128i vA, vB, V, vecMin, vecMax;
+    __m128i laststore;
+    uint16_t *initoutput = output;
+    uint32_t len1 = length1 / 8;
+    uint32_t len2 = length2 / 8;
+    uint32_t pos1 = 0;
+    uint32_t pos2 = 0;
+    // we start the machine
+    vA = _mm_lddqu_si128((const __m128i *)array1 + pos1);
+    pos1++;
+    vB = _mm_lddqu_si128((const __m128i *)array2 + pos2);
+    pos2++;
+    sse_merge(&vA, &vB, &vecMin, &vecMax);
+    laststore = _mm_set1_epi16(-1);
+    uint16_t buffer[17];
+    output += store_unique_xor(laststore, vecMin, output);
+
+    laststore = vecMin;
+    if ((pos1 < len1) && (pos2 < len2)) {
+        uint16_t curA, curB;
+        curA = array1[8 * pos1];
+        curB = array2[8 * pos2];
+        while (true) {
+            if (curA <= curB) {
+                V = _mm_lddqu_si128((const __m128i *)array1 + pos1);
+                pos1++;
+                if (pos1 < len1) {
+                    curA = array1[8 * pos1];
+                } else {
+                    break;
+                }
+            } else {
+                V = _mm_lddqu_si128((const __m128i *)array2 + pos2);
+                pos2++;
+                if (pos2 < len2) {
+                    curB = array2[8 * pos2];
+                } else {
+                    break;
+                }
+            }
+            sse_merge(&V, &vecMax, &vecMin, &vecMax);
+            // conditionally stores the last value of laststore as well as all
+            // but the
+            // last value of vecMin
+            output += store_unique_xor(laststore, vecMin, output);
+            laststore = vecMin;
+        }
+        sse_merge(&V, &vecMax, &vecMin, &vecMax);
+        // conditionally stores the last value of laststore as well as all but
+        // the
+        // last value of vecMin
+        output += store_unique_xor(laststore, vecMin, output);
+        laststore = vecMin;
+    }
+    uint32_t len = (uint32_t)(output - initoutput);
+
+    // we finish the rest off using a scalar algorithm
+    // could be improved?
+    // conditionally stores the last value of laststore as well as all but the
+    // last value of vecMax,
+    // we store to "buffer"
+    int leftoversize = store_unique_xor(laststore, vecMax, buffer);
+    uint16_t vec7 = (uint16_t)_mm_extract_epi16(vecMax, 7);
+    uint16_t vec6 = (uint16_t)_mm_extract_epi16(vecMax, 6);
+    if (vec7 != vec6) buffer[leftoversize++] = vec7;
+    if (pos1 == len1) {
+        memcpy(buffer + leftoversize, array1 + 8 * pos1,
+            (length1 - 8 * len1) * sizeof(uint16_t));
+        leftoversize += length1 - 8 * len1;
+        if (leftoversize == 0) {  // trivial case
+            memcpy(output, array2 + 8 * pos2,
+                (length2 - 8 * pos2) * sizeof(uint16_t));
+            len += (length2 - 8 * pos2);
+        } else {
+            qsort(buffer, leftoversize, sizeof(uint16_t), uint16_compare);
+            leftoversize = unique_xor(buffer, leftoversize);
+            len += xor_uint16(buffer, leftoversize, array2 + 8 * pos2,
+                length2 - 8 * pos2, output);
+        }
+    } else {
+        memcpy(buffer + leftoversize, array2 + 8 * pos2,
+            (length2 - 8 * len2) * sizeof(uint16_t));
+        leftoversize += length2 - 8 * len2;
+        if (leftoversize == 0) {  // trivial case
+            memcpy(output, array1 + 8 * pos1,
+                (length1 - 8 * pos1) * sizeof(uint16_t));
+            len += (length1 - 8 * pos1);
+        } else {
+            qsort(buffer, leftoversize, sizeof(uint16_t), uint16_compare);
+            leftoversize = unique_xor(buffer, leftoversize);
+            len += xor_uint16(buffer, leftoversize, array1 + 8 * pos1,
+                length1 - 8 * pos1, output);
+        }
+    }
+    return len;
+}
+CROARING_UNTARGET_AVX2
+/**
+ * End of SIMD 16-bit XOR code
+ */
+
+#endif  // CROARING_IS_X64
+
+size_t union_uint32(const uint32_t *set_1, size_t size_1, const uint32_t *set_2,
+    size_t size_2, uint32_t *buffer) {
+    size_t pos = 0, idx_1 = 0, idx_2 = 0;
+
+    if (0 == size_2) {
+        memmove(buffer, set_1, size_1 * sizeof(uint32_t));
+        return size_1;
+    }
+    if (0 == size_1) {
+        memmove(buffer, set_2, size_2 * sizeof(uint32_t));
+        return size_2;
+    }
+
+    uint32_t val_1 = set_1[idx_1], val_2 = set_2[idx_2];
+
+    while (true) {
+        if (val_1 < val_2) {
+            buffer[pos++] = val_1;
+            ++idx_1;
+            if (idx_1 >= size_1) break;
+            val_1 = set_1[idx_1];
+        } else if (val_2 < val_1) {
+            buffer[pos++] = val_2;
+            ++idx_2;
+            if (idx_2 >= size_2) break;
+            val_2 = set_2[idx_2];
+        } else {
+            buffer[pos++] = val_1;
+            ++idx_1;
+            ++idx_2;
+            if (idx_1 >= size_1 || idx_2 >= size_2) break;
+            val_1 = set_1[idx_1];
+            val_2 = set_2[idx_2];
+        }
+    }
+
+    if (idx_1 < size_1) {
+        const size_t n_elems = size_1 - idx_1;
+        memmove(buffer + pos, set_1 + idx_1, n_elems * sizeof(uint32_t));
+        pos += n_elems;
+    } else if (idx_2 < size_2) {
+        const size_t n_elems = size_2 - idx_2;
+        memmove(buffer + pos, set_2 + idx_2, n_elems * sizeof(uint32_t));
+        pos += n_elems;
+    }
+
+    return pos;
+}
+
+size_t union_uint32_card(const uint32_t *set_1, size_t size_1,
+    const uint32_t *set_2, size_t size_2) {
+    size_t pos = 0, idx_1 = 0, idx_2 = 0;
+
+    if (0 == size_2) {
+        return size_1;
+    }
+    if (0 == size_1) {
+        return size_2;
+    }
+
+    uint32_t val_1 = set_1[idx_1], val_2 = set_2[idx_2];
+
+    while (true) {
+        if (val_1 < val_2) {
+            ++idx_1;
+            ++pos;
+            if (idx_1 >= size_1) break;
+            val_1 = set_1[idx_1];
+        } else if (val_2 < val_1) {
+            ++idx_2;
+            ++pos;
+            if (idx_2 >= size_2) break;
+            val_2 = set_2[idx_2];
+        } else {
+            ++idx_1;
+            ++idx_2;
+            ++pos;
+            if (idx_1 >= size_1 || idx_2 >= size_2) break;
+            val_1 = set_1[idx_1];
+            val_2 = set_2[idx_2];
+        }
+    }
+
+    if (idx_1 < size_1) {
+        const size_t n_elems = size_1 - idx_1;
+        pos += n_elems;
+    } else if (idx_2 < size_2) {
+        const size_t n_elems = size_2 - idx_2;
+        pos += n_elems;
+    }
+    return pos;
+}
+
+size_t fast_union_uint16(const uint16_t *set_1, size_t size_1,
+    const uint16_t *set_2, size_t size_2,
+    uint16_t *buffer) {
+#if CROARING_IS_X64
+    if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+        // compute union with smallest array first
+        if (size_1 < size_2) {
+            return union_vector16(set_1, (uint32_t)size_1, set_2,
+                (uint32_t)size_2, buffer);
+        } else {
+            return union_vector16(set_2, (uint32_t)size_2, set_1,
+                (uint32_t)size_1, buffer);
+        }
+    } else {
+        // compute union with smallest array first
+        if (size_1 < size_2) {
+            return union_uint16(set_1, size_1, set_2, size_2, buffer);
+        } else {
+            return union_uint16(set_2, size_2, set_1, size_1, buffer);
+        }
+    }
+#else
+    // compute union with smallest array first
+    if (size_1 < size_2) {
+        return union_uint16(set_1, size_1, set_2, size_2, buffer);
+    } else {
+        return union_uint16(set_2, size_2, set_1, size_1, buffer);
+    }
+#endif
+}
+#if CROARING_IS_X64
+#if CROARING_COMPILER_SUPPORTS_AVX512
+CROARING_TARGET_AVX512
+static inline bool _avx512_memequals(const void *s1, const void *s2, size_t n) {
+    const uint8_t *ptr1 = (const uint8_t *)s1;
+    const uint8_t *ptr2 = (const uint8_t *)s2;
+    const uint8_t *end1 = ptr1 + n;
+    const uint8_t *end8 = ptr1 + ((n >> 3) << 3);
+    const uint8_t *end32 = ptr1 + ((n >> 5) << 5);
+    const uint8_t *end64 = ptr1 + ((n >> 6) << 6);
+
+    while (ptr1 < end64) {
+        __m512i r1 = _mm512_loadu_si512((const __m512i *)ptr1);
+        __m512i r2 = _mm512_loadu_si512((const __m512i *)ptr2);
+
+        uint64_t mask = _mm512_cmpeq_epi8_mask(r1, r2);
+
+        if (mask != UINT64_MAX) {
+            return false;
+        }
+
+        ptr1 += 64;
+        ptr2 += 64;
+    }
+
+    while (ptr1 < end32) {
+        __m256i r1 = _mm256_loadu_si256((const __m256i *)ptr1);
+        __m256i r2 = _mm256_loadu_si256((const __m256i *)ptr2);
+        int mask = _mm256_movemask_epi8(_mm256_cmpeq_epi8(r1, r2));
+        if ((uint32_t)mask != UINT32_MAX) {
+            return false;
+        }
+        ptr1 += 32;
+        ptr2 += 32;
+    }
+
+    while (ptr1 < end8) {
+        uint64_t v1, v2;
+        memcpy(&v1, ptr1, sizeof(uint64_t));
+        memcpy(&v2, ptr2, sizeof(uint64_t));
+        if (v1 != v2) {
+            return false;
+        }
+        ptr1 += 8;
+        ptr2 += 8;
+    }
+
+    while (ptr1 < end1) {
+        if (*ptr1 != *ptr2) {
+            return false;
+        }
+        ptr1++;
+        ptr2++;
+    }
+
+    return true;
+}
+CROARING_UNTARGET_AVX512
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+
+CROARING_TARGET_AVX2
+static inline bool _avx2_memequals(const void *s1, const void *s2, size_t n) {
+    const uint8_t *ptr1 = (const uint8_t *)s1;
+    const uint8_t *ptr2 = (const uint8_t *)s2;
+    const uint8_t *end1 = ptr1 + n;
+    const uint8_t *end8 = ptr1 + n / 8 * 8;
+    const uint8_t *end32 = ptr1 + n / 32 * 32;
+
+    while (ptr1 < end32) {
+        __m256i r1 = _mm256_loadu_si256((const __m256i *)ptr1);
+        __m256i r2 = _mm256_loadu_si256((const __m256i *)ptr2);
+        int mask = _mm256_movemask_epi8(_mm256_cmpeq_epi8(r1, r2));
+        if ((uint32_t)mask != UINT32_MAX) {
+            return false;
+        }
+        ptr1 += 32;
+        ptr2 += 32;
+    }
+
+    while (ptr1 < end8) {
+        uint64_t v1, v2;
+        memcpy(&v1, ptr1, sizeof(uint64_t));
+        memcpy(&v2, ptr2, sizeof(uint64_t));
+        if (v1 != v2) {
+            return false;
+        }
+        ptr1 += 8;
+        ptr2 += 8;
+    }
+
+    while (ptr1 < end1) {
+        if (*ptr1 != *ptr2) {
+            return false;
+        }
+        ptr1++;
+        ptr2++;
+    }
+
+    return true;
+}
+CROARING_UNTARGET_AVX2
+#endif
+
+bool memequals(const void *s1, const void *s2, size_t n) {
+    if (n == 0) {
+        return true;
+    }
+#if CROARING_IS_X64
+    int support = croaring_hardware_support();
+#if CROARING_COMPILER_SUPPORTS_AVX512
+    if (support & ROARING_SUPPORTS_AVX512) {
+        return _avx512_memequals(s1, s2, n);
+    } else
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+        if (support & ROARING_SUPPORTS_AVX2) {
+            return _avx2_memequals(s1, s2, n);
+        } else {
+            return memcmp(s1, s2, n) == 0;
+        }
+#else
+    return memcmp(s1, s2, n) == 0;
+#endif
+}
+
+#if CROARING_IS_X64
+#if CROARING_COMPILER_SUPPORTS_AVX512
+CROARING_TARGET_AVX512
+ALLOW_UNALIGNED
+int avx512_array_container_to_uint32_array(void *vout, const uint16_t *array,
+    size_t cardinality, uint32_t base) {
+    int outpos = 0;
+    uint32_t *out = (uint32_t *)vout;
+    size_t i = 0;
+    for (; i + sizeof(__m256i) / sizeof(uint16_t) <= cardinality;
+        i += sizeof(__m256i) / sizeof(uint16_t)) {
+        __m256i vinput = _mm256_loadu_si256((const __m256i *)(array + i));
+        __m512i voutput = _mm512_add_epi32(_mm512_cvtepu16_epi32(vinput),
+            _mm512_set1_epi32(base));
+        _mm512_storeu_si512((__m512i *)(out + outpos), voutput);
+        outpos += sizeof(__m512i) / sizeof(uint32_t);
+    }
+    for (; i < cardinality; ++i) {
+        const uint32_t val = base + array[i];
+        memcpy(out + outpos, &val,
+            sizeof(uint32_t));  // should be compiled as a MOV on x64
+        outpos++;
+    }
+    return outpos;
+}
+CROARING_UNTARGET_AVX512
+#endif  // #if CROARING_COMPILER_SUPPORTS_AVX512
+#endif  // #if CROARING_IS_X64
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic pop
+#endif/* end file src/array_util.c */
+/* begin file src/art/art.c */
+#include <assert.h>
+#include <stdio.h>
+#include <string.h>
+
+
+#define CROARING_ART_NODE4_TYPE 0
+#define CROARING_ART_NODE16_TYPE 1
+#define CROARING_ART_NODE48_TYPE 2
+#define CROARING_ART_NODE256_TYPE 3
+#define CROARING_ART_NUM_TYPES 4
+
+// Node48 placeholder value to indicate no child is present at this key index.
+#define CROARING_ART_NODE48_EMPTY_VAL 48
+
+// We use the least significant bit of node pointers to indicate whether a node
+// is a leaf or an inner node. This is never surfaced to the user.
+//
+// Using pointer tagging to indicate leaves not only saves a bit of memory by
+// sparing the typecode, but also allows us to use an intrusive leaf struct.
+// Using an intrusive leaf struct leaves leaf allocation up to the user. Upon
+// deallocation of the ART, we know not to free the leaves without having to
+// dereference the leaf pointers.
+//
+// All internal operations on leaves should use CROARING_CAST_LEAF before using
+// the leaf. The only places that use CROARING_SET_LEAF are locations where a
+// field is directly assigned to a leaf pointer. After using CROARING_SET_LEAF,
+// the leaf should be treated as a node of unknown type.
+#define CROARING_IS_LEAF(p) (((uintptr_t)(p) & 1))
+#define CROARING_SET_LEAF(p) ((art_node_t *)((uintptr_t)(p) | 1))
+#define CROARING_CAST_LEAF(p) ((art_leaf_t *)((void *)((uintptr_t)(p) & ~1)))
+
+#define CROARING_NODE48_AVAILABLE_CHILDREN_MASK ((UINT64_C(1) << 48) - 1)
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+typedef uint8_t art_typecode_t;
+
+// Aliasing with a "leaf" naming so that its purpose is clearer in the context
+// of the trie internals.
+typedef art_val_t art_leaf_t;
+
+typedef struct art_internal_validate_s {
+    const char **reason;
+    art_validate_cb_t validate_cb;
+
+    int depth;
+    art_key_chunk_t current_key[ART_KEY_BYTES];
+} art_internal_validate_t;
+
+// Set the reason message, and return false for convenience.
+static inline bool art_validate_fail(const art_internal_validate_t *validate,
+    const char *msg) {
+    *validate->reason = msg;
+    return false;
+}
+
+// Inner node, with prefix.
+//
+// We use a fixed-length array as a pointer would be larger than the array.
+typedef struct art_inner_node_s {
+    art_typecode_t typecode;
+    uint8_t prefix_size;
+    uint8_t prefix[ART_KEY_BYTES - 1];
+} art_inner_node_t;
+
+// Inner node types.
+
+// Node4: key[i] corresponds with children[i]. Keys are sorted.
+typedef struct art_node4_s {
+    art_inner_node_t base;
+    uint8_t count;
+    uint8_t keys[4];
+    art_node_t *children[4];
+} art_node4_t;
+
+// Node16: key[i] corresponds with children[i]. Keys are sorted.
+typedef struct art_node16_s {
+    art_inner_node_t base;
+    uint8_t count;
+    uint8_t keys[16];
+    art_node_t *children[16];
+} art_node16_t;
+
+// Node48: key[i] corresponds with children[key[i]] if key[i] !=
+// CROARING_ART_NODE48_EMPTY_VAL. Keys are naturally sorted due to direct
+// indexing.
+typedef struct art_node48_s {
+    art_inner_node_t base;
+    uint8_t count;
+    // Bitset where the ith bit is set if children[i] is available
+    // Because there are at most 48 children, only the bottom 48 bits are used.
+    uint64_t available_children;
+    uint8_t keys[256];
+    art_node_t *children[48];
+} art_node48_t;
+
+// Node256: children[i] is directly indexed by key chunk. A child is present if
+// children[i] != NULL.
+typedef struct art_node256_s {
+    art_inner_node_t base;
+    uint16_t count;
+    art_node_t *children[256];
+} art_node256_t;
+
+// Helper struct to refer to a child within a node at a specific index.
+typedef struct art_indexed_child_s {
+    art_node_t *child;
+    uint8_t index;
+    art_key_chunk_t key_chunk;
+} art_indexed_child_t;
+
+static inline bool art_is_leaf(const art_node_t *node) {
+    return CROARING_IS_LEAF(node);
+}
+
+static void art_leaf_populate(art_leaf_t *leaf, const art_key_chunk_t key[]) {
+    memcpy(leaf->key, key, ART_KEY_BYTES);
+}
+
+static inline uint8_t art_get_type(const art_inner_node_t *node) {
+    return node->typecode;
+}
+
+static inline void art_init_inner_node(art_inner_node_t *node,
+    art_typecode_t typecode,
+    const art_key_chunk_t prefix[],
+    uint8_t prefix_size) {
+    node->typecode = typecode;
+    node->prefix_size = prefix_size;
+    memcpy(node->prefix, prefix, prefix_size * sizeof(art_key_chunk_t));
+}
+
+static void art_free_node(art_node_t *node);
+
+// ===================== Start of node-specific functions ======================
+
+static art_node4_t *art_node4_create(const art_key_chunk_t prefix[],
+    uint8_t prefix_size);
+static art_node16_t *art_node16_create(const art_key_chunk_t prefix[],
+    uint8_t prefix_size);
+static art_node48_t *art_node48_create(const art_key_chunk_t prefix[],
+    uint8_t prefix_size);
+static art_node256_t *art_node256_create(const art_key_chunk_t prefix[],
+    uint8_t prefix_size);
+
+static art_node_t *art_node4_insert(art_node4_t *node, art_node_t *child,
+    uint8_t key);
+static art_node_t *art_node16_insert(art_node16_t *node, art_node_t *child,
+    uint8_t key);
+static art_node_t *art_node48_insert(art_node48_t *node, art_node_t *child,
+    uint8_t key);
+static art_node_t *art_node256_insert(art_node256_t *node, art_node_t *child,
+    uint8_t key);
+
+static art_node4_t *art_node4_create(const art_key_chunk_t prefix[],
+    uint8_t prefix_size) {
+    art_node4_t *node = (art_node4_t *)roaring_malloc(sizeof(art_node4_t));
+    art_init_inner_node(&node->base, CROARING_ART_NODE4_TYPE, prefix,
+        prefix_size);
+    node->count = 0;
+    return node;
+}
+
+static void art_free_node4(art_node4_t *node) {
+    for (size_t i = 0; i < node->count; ++i) {
+        art_free_node(node->children[i]);
+    }
+    roaring_free(node);
+}
+
+static inline art_node_t *art_node4_find_child(const art_node4_t *node,
+    art_key_chunk_t key) {
+    for (size_t i = 0; i < node->count; ++i) {
+        if (node->keys[i] == key) {
+            return node->children[i];
+        }
+    }
+    return NULL;
+}
+
+static art_node_t *art_node4_insert(art_node4_t *node, art_node_t *child,
+    uint8_t key) {
+    if (node->count < 4) {
+        size_t idx = 0;
+        for (; idx < node->count; ++idx) {
+            if (node->keys[idx] > key) {
+                break;
+            }
+        }
+        size_t after = node->count - idx;
+        // Shift other keys to maintain sorted order.
+        memmove(node->keys + idx + 1, node->keys + idx,
+            after * sizeof(art_key_chunk_t));
+        memmove(node->children + idx + 1, node->children + idx,
+            after * sizeof(art_node_t *));
+
+        node->children[idx] = child;
+        node->keys[idx] = key;
+        node->count++;
+        return (art_node_t *)node;
+    }
+    art_node16_t *new_node =
+        art_node16_create(node->base.prefix, node->base.prefix_size);
+    // Instead of calling insert, this could be specialized to 2x memcpy and
+    // setting the count.
+    for (size_t i = 0; i < 4; ++i) {
+        art_node16_insert(new_node, node->children[i], node->keys[i]);
+    }
+    roaring_free(node);
+    return art_node16_insert(new_node, child, key);
+}
+
+static inline art_node_t *art_node4_erase(art_node4_t *node,
+    art_key_chunk_t key_chunk) {
+    int idx = -1;
+    for (size_t i = 0; i < node->count; ++i) {
+        if (node->keys[i] == key_chunk) {
+            idx = i;
+        }
+    }
+    if (idx == -1) {
+        return (art_node_t *)node;
+    }
+    if (node->count == 2) {
+        // Only one child remains after erasing, so compress the path by
+        // removing this node.
+        uint8_t other_idx = idx ^ 1;
+        art_node_t *remaining_child = node->children[other_idx];
+        art_key_chunk_t remaining_child_key = node->keys[other_idx];
+        if (!art_is_leaf(remaining_child)) {
+            // Correct the prefix of the child node.
+            art_inner_node_t *inner_node = (art_inner_node_t *)remaining_child;
+            memmove(inner_node->prefix + node->base.prefix_size + 1,
+                inner_node->prefix, inner_node->prefix_size);
+            memcpy(inner_node->prefix, node->base.prefix,
+                node->base.prefix_size);
+            inner_node->prefix[node->base.prefix_size] = remaining_child_key;
+            inner_node->prefix_size += node->base.prefix_size + 1;
+        }
+        roaring_free(node);
+        return remaining_child;
+    }
+    // Shift other keys to maintain sorted order.
+    size_t after_next = node->count - idx - 1;
+    memmove(node->keys + idx, node->keys + idx + 1,
+        after_next * sizeof(art_key_chunk_t));
+    memmove(node->children + idx, node->children + idx + 1,
+        after_next * sizeof(art_node_t *));
+    node->count--;
+    return (art_node_t *)node;
+}
+
+static inline void art_node4_replace(art_node4_t *node,
+    art_key_chunk_t key_chunk,
+    art_node_t *new_child) {
+    for (size_t i = 0; i < node->count; ++i) {
+        if (node->keys[i] == key_chunk) {
+            node->children[i] = new_child;
+            return;
+        }
+    }
+}
+
+static inline art_indexed_child_t art_node4_next_child(const art_node4_t *node,
+    int index) {
+    art_indexed_child_t indexed_child;
+    index++;
+    if (index >= node->count) {
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    indexed_child.index = index;
+    indexed_child.child = node->children[index];
+    indexed_child.key_chunk = node->keys[index];
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node4_prev_child(const art_node4_t *node,
+    int index) {
+    if (index > node->count) {
+        index = node->count;
+    }
+    index--;
+    art_indexed_child_t indexed_child;
+    if (index < 0) {
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    indexed_child.index = index;
+    indexed_child.child = node->children[index];
+    indexed_child.key_chunk = node->keys[index];
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node4_child_at(const art_node4_t *node,
+    int index) {
+    art_indexed_child_t indexed_child;
+    if (index < 0 || index >= node->count) {
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    indexed_child.index = index;
+    indexed_child.child = node->children[index];
+    indexed_child.key_chunk = node->keys[index];
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node4_lower_bound(
+    art_node4_t *node, art_key_chunk_t key_chunk) {
+    art_indexed_child_t indexed_child;
+    for (size_t i = 0; i < node->count; ++i) {
+        if (node->keys[i] >= key_chunk) {
+            indexed_child.index = i;
+            indexed_child.child = node->children[i];
+            indexed_child.key_chunk = node->keys[i];
+            return indexed_child;
+        }
+    }
+    indexed_child.child = NULL;
+    return indexed_child;
+}
+
+static bool art_internal_validate_at(const art_node_t *node,
+    art_internal_validate_t validator);
+
+static bool art_node4_internal_validate(const art_node4_t *node,
+    art_internal_validate_t validator) {
+    if (node->count == 0) {
+        return art_validate_fail(&validator, "Node4 has no children");
+    }
+    if (node->count > 4) {
+        return art_validate_fail(&validator, "Node4 has too many children");
+    }
+    if (node->count == 1) {
+        return art_validate_fail(
+            &validator, "Node4 and child node should have been combined");
+    }
+    validator.depth++;
+    for (int i = 0; i < node->count; ++i) {
+        if (i > 0) {
+            if (node->keys[i - 1] >= node->keys[i]) {
+                return art_validate_fail(
+                    &validator, "Node4 keys are not strictly increasing");
+            }
+        }
+        for (int j = i + 1; j < node->count; ++j) {
+            if (node->children[i] == node->children[j]) {
+                return art_validate_fail(&validator,
+                    "Node4 has duplicate children");
+            }
+        }
+        validator.current_key[validator.depth - 1] = node->keys[i];
+        if (!art_internal_validate_at(node->children[i], validator)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+static art_node16_t *art_node16_create(const art_key_chunk_t prefix[],
+    uint8_t prefix_size) {
+    art_node16_t *node = (art_node16_t *)roaring_malloc(sizeof(art_node16_t));
+    art_init_inner_node(&node->base, CROARING_ART_NODE16_TYPE, prefix,
+        prefix_size);
+    node->count = 0;
+    return node;
+}
+
+static void art_free_node16(art_node16_t *node) {
+    for (size_t i = 0; i < node->count; ++i) {
+        art_free_node(node->children[i]);
+    }
+    roaring_free(node);
+}
+
+static inline art_node_t *art_node16_find_child(const art_node16_t *node,
+    art_key_chunk_t key) {
+    for (size_t i = 0; i < node->count; ++i) {
+        if (node->keys[i] == key) {
+            return node->children[i];
+        }
+    }
+    return NULL;
+}
+
+static art_node_t *art_node16_insert(art_node16_t *node, art_node_t *child,
+    uint8_t key) {
+    if (node->count < 16) {
+        size_t idx = 0;
+        for (; idx < node->count; ++idx) {
+            if (node->keys[idx] > key) {
+                break;
+            }
+        }
+        size_t after = node->count - idx;
+        // Shift other keys to maintain sorted order.
+        memmove(node->keys + idx + 1, node->keys + idx,
+            after * sizeof(art_key_chunk_t));
+        memmove(node->children + idx + 1, node->children + idx,
+            after * sizeof(art_node_t *));
+
+        node->children[idx] = child;
+        node->keys[idx] = key;
+        node->count++;
+        return (art_node_t *)node;
+    }
+    art_node48_t *new_node =
+        art_node48_create(node->base.prefix, node->base.prefix_size);
+    for (size_t i = 0; i < 16; ++i) {
+        art_node48_insert(new_node, node->children[i], node->keys[i]);
+    }
+    roaring_free(node);
+    return art_node48_insert(new_node, child, key);
+}
+
+static inline art_node_t *art_node16_erase(art_node16_t *node,
+    uint8_t key_chunk) {
+    for (size_t i = 0; i < node->count; ++i) {
+        if (node->keys[i] == key_chunk) {
+            // Shift other keys to maintain sorted order.
+            size_t after_next = node->count - i - 1;
+            memmove(node->keys + i, node->keys + i + 1,
+                after_next * sizeof(key_chunk));
+            memmove(node->children + i, node->children + i + 1,
+                after_next * sizeof(art_node_t *));
+            node->count--;
+            break;
+        }
+    }
+    if (node->count > 4) {
+        return (art_node_t *)node;
+    }
+    art_node4_t *new_node =
+        art_node4_create(node->base.prefix, node->base.prefix_size);
+    // Instead of calling insert, this could be specialized to 2x memcpy and
+    // setting the count.
+    for (size_t i = 0; i < 4; ++i) {
+        art_node4_insert(new_node, node->children[i], node->keys[i]);
+    }
+    roaring_free(node);
+    return (art_node_t *)new_node;
+}
+
+static inline void art_node16_replace(art_node16_t *node,
+    art_key_chunk_t key_chunk,
+    art_node_t *new_child) {
+    for (uint8_t i = 0; i < node->count; ++i) {
+        if (node->keys[i] == key_chunk) {
+            node->children[i] = new_child;
+            return;
+        }
+    }
+}
+
+static inline art_indexed_child_t art_node16_next_child(
+    const art_node16_t *node, int index) {
+    art_indexed_child_t indexed_child;
+    index++;
+    if (index >= node->count) {
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    indexed_child.index = index;
+    indexed_child.child = node->children[index];
+    indexed_child.key_chunk = node->keys[index];
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node16_prev_child(
+    const art_node16_t *node, int index) {
+    if (index > node->count) {
+        index = node->count;
+    }
+    index--;
+    art_indexed_child_t indexed_child;
+    if (index < 0) {
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    indexed_child.index = index;
+    indexed_child.child = node->children[index];
+    indexed_child.key_chunk = node->keys[index];
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node16_child_at(const art_node16_t *node,
+    int index) {
+    art_indexed_child_t indexed_child;
+    if (index < 0 || index >= node->count) {
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    indexed_child.index = index;
+    indexed_child.child = node->children[index];
+    indexed_child.key_chunk = node->keys[index];
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node16_lower_bound(
+    art_node16_t *node, art_key_chunk_t key_chunk) {
+    art_indexed_child_t indexed_child;
+    for (size_t i = 0; i < node->count; ++i) {
+        if (node->keys[i] >= key_chunk) {
+            indexed_child.index = i;
+            indexed_child.child = node->children[i];
+            indexed_child.key_chunk = node->keys[i];
+            return indexed_child;
+        }
+    }
+    indexed_child.child = NULL;
+    return indexed_child;
+}
+
+static bool art_node16_internal_validate(const art_node16_t *node,
+    art_internal_validate_t validator) {
+    if (node->count <= 4) {
+        return art_validate_fail(&validator, "Node16 has too few children");
+    }
+    if (node->count > 16) {
+        return art_validate_fail(&validator, "Node16 has too many children");
+    }
+    validator.depth++;
+    for (int i = 0; i < node->count; ++i) {
+        if (i > 0) {
+            if (node->keys[i - 1] >= node->keys[i]) {
+                return art_validate_fail(
+                    &validator, "Node16 keys are not strictly increasing");
+            }
+        }
+        for (int j = i + 1; j < node->count; ++j) {
+            if (node->children[i] == node->children[j]) {
+                return art_validate_fail(&validator,
+                    "Node16 has duplicate children");
+            }
+        }
+        validator.current_key[validator.depth - 1] = node->keys[i];
+        if (!art_internal_validate_at(node->children[i], validator)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+static art_node48_t *art_node48_create(const art_key_chunk_t prefix[],
+    uint8_t prefix_size) {
+    art_node48_t *node = (art_node48_t *)roaring_malloc(sizeof(art_node48_t));
+    art_init_inner_node(&node->base, CROARING_ART_NODE48_TYPE, prefix,
+        prefix_size);
+    node->count = 0;
+    node->available_children = CROARING_NODE48_AVAILABLE_CHILDREN_MASK;
+    for (size_t i = 0; i < 256; ++i) {
+        node->keys[i] = CROARING_ART_NODE48_EMPTY_VAL;
+    }
+    return node;
+}
+
+static void art_free_node48(art_node48_t *node) {
+    uint64_t used_children =
+        (node->available_children) ^ CROARING_NODE48_AVAILABLE_CHILDREN_MASK;
+    while (used_children != 0) {
+        // We checked above that used_children is not zero
+        uint8_t child_idx = roaring_trailing_zeroes(used_children);
+        art_free_node(node->children[child_idx]);
+        used_children &= ~(UINT64_C(1) << child_idx);
+    }
+    roaring_free(node);
+}
+
+static inline art_node_t *art_node48_find_child(const art_node48_t *node,
+    art_key_chunk_t key) {
+    uint8_t val_idx = node->keys[key];
+    if (val_idx != CROARING_ART_NODE48_EMPTY_VAL) {
+        return node->children[val_idx];
+    }
+    return NULL;
+}
+
+static art_node_t *art_node48_insert(art_node48_t *node, art_node_t *child,
+    uint8_t key) {
+    if (node->count < 48) {
+        // node->available_children is only zero when the node is full (count ==
+        // 48), we just checked count < 48
+        uint8_t val_idx = roaring_trailing_zeroes(node->available_children);
+        node->keys[key] = val_idx;
+        node->children[val_idx] = child;
+        node->count++;
+        node->available_children &= ~(UINT64_C(1) << val_idx);
+        return (art_node_t *)node;
+    }
+    art_node256_t *new_node =
+        art_node256_create(node->base.prefix, node->base.prefix_size);
+    for (size_t i = 0; i < 256; ++i) {
+        uint8_t val_idx = node->keys[i];
+        if (val_idx != CROARING_ART_NODE48_EMPTY_VAL) {
+            art_node256_insert(new_node, node->children[val_idx], i);
+        }
+    }
+    roaring_free(node);
+    return art_node256_insert(new_node, child, key);
+}
+
+static inline art_node_t *art_node48_erase(art_node48_t *node,
+    uint8_t key_chunk) {
+    uint8_t val_idx = node->keys[key_chunk];
+    if (val_idx == CROARING_ART_NODE48_EMPTY_VAL) {
+        return (art_node_t *)node;
+    }
+    node->keys[key_chunk] = CROARING_ART_NODE48_EMPTY_VAL;
+    node->available_children |= UINT64_C(1) << val_idx;
+    node->count--;
+    if (node->count > 16) {
+        return (art_node_t *)node;
+    }
+
+    art_node16_t *new_node =
+        art_node16_create(node->base.prefix, node->base.prefix_size);
+    for (size_t i = 0; i < 256; ++i) {
+        val_idx = node->keys[i];
+        if (val_idx != CROARING_ART_NODE48_EMPTY_VAL) {
+            art_node16_insert(new_node, node->children[val_idx], i);
+        }
+    }
+    roaring_free(node);
+    return (art_node_t *)new_node;
+}
+
+static inline void art_node48_replace(art_node48_t *node,
+    art_key_chunk_t key_chunk,
+    art_node_t *new_child) {
+    uint8_t val_idx = node->keys[key_chunk];
+    assert(val_idx != CROARING_ART_NODE48_EMPTY_VAL);
+    node->children[val_idx] = new_child;
+}
+
+static inline art_indexed_child_t art_node48_next_child(
+    const art_node48_t *node, int index) {
+    art_indexed_child_t indexed_child;
+    index++;
+    for (size_t i = index; i < 256; ++i) {
+        if (node->keys[i] != CROARING_ART_NODE48_EMPTY_VAL) {
+            indexed_child.index = i;
+            indexed_child.child = node->children[node->keys[i]];
+            indexed_child.key_chunk = i;
+            return indexed_child;
+        }
+    }
+    indexed_child.child = NULL;
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node48_prev_child(
+    const art_node48_t *node, int index) {
+    if (index > 256) {
+        index = 256;
+    }
+    index--;
+    art_indexed_child_t indexed_child;
+    for (int i = index; i >= 0; --i) {
+        if (node->keys[i] != CROARING_ART_NODE48_EMPTY_VAL) {
+            indexed_child.index = i;
+            indexed_child.child = node->children[node->keys[i]];
+            indexed_child.key_chunk = i;
+            return indexed_child;
+        }
+    }
+    indexed_child.child = NULL;
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node48_child_at(const art_node48_t *node,
+    int index) {
+    art_indexed_child_t indexed_child;
+    if (index < 0 || index >= 256) {
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    indexed_child.index = index;
+    indexed_child.child = node->children[node->keys[index]];
+    indexed_child.key_chunk = index;
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node48_lower_bound(
+    art_node48_t *node, art_key_chunk_t key_chunk) {
+    art_indexed_child_t indexed_child;
+    for (size_t i = key_chunk; i < 256; ++i) {
+        if (node->keys[i] != CROARING_ART_NODE48_EMPTY_VAL) {
+            indexed_child.index = i;
+            indexed_child.child = node->children[node->keys[i]];
+            indexed_child.key_chunk = i;
+            return indexed_child;
+        }
+    }
+    indexed_child.child = NULL;
+    return indexed_child;
+}
+
+static bool art_node48_internal_validate(const art_node48_t *node,
+    art_internal_validate_t validator) {
+    if (node->count <= 16) {
+        return art_validate_fail(&validator, "Node48 has too few children");
+    }
+    if (node->count > 48) {
+        return art_validate_fail(&validator, "Node48 has too many children");
+    }
+    uint64_t used_children = 0;
+    for (int i = 0; i < 256; ++i) {
+        uint8_t child_idx = node->keys[i];
+        if (child_idx != CROARING_ART_NODE48_EMPTY_VAL) {
+            if (used_children & (UINT64_C(1) << child_idx)) {
+                return art_validate_fail(
+                    &validator, "Node48 keys point to the same child index");
+            }
+
+            art_node_t *child = node->children[child_idx];
+            if (child == NULL) {
+                return art_validate_fail(&validator, "Node48 has a NULL child");
+            }
+            used_children |= UINT64_C(1) << child_idx;
+        }
+    }
+    uint64_t expected_used_children =
+        (node->available_children) ^ CROARING_NODE48_AVAILABLE_CHILDREN_MASK;
+    if (used_children != expected_used_children) {
+        return art_validate_fail(
+            &validator,
+            "Node48 available_children does not match actual children");
+    }
+    while (used_children != 0) {
+        uint8_t child_idx = roaring_trailing_zeroes(used_children);
+        used_children &= used_children - 1;
+
+        uint64_t other_children = used_children;
+        while (other_children != 0) {
+            uint8_t other_child_idx = roaring_trailing_zeroes(other_children);
+            if (node->children[child_idx] == node->children[other_child_idx]) {
+                return art_validate_fail(&validator,
+                    "Node48 has duplicate children");
+            }
+            other_children &= other_children - 1;
+        }
+    }
+
+    validator.depth++;
+    for (int i = 0; i < 256; ++i) {
+        if (node->keys[i] != CROARING_ART_NODE48_EMPTY_VAL) {
+            validator.current_key[validator.depth - 1] = i;
+            if (!art_internal_validate_at(node->children[node->keys[i]],
+                    validator)) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+static art_node256_t *art_node256_create(const art_key_chunk_t prefix[],
+    uint8_t prefix_size) {
+    art_node256_t *node =
+        (art_node256_t *)roaring_malloc(sizeof(art_node256_t));
+    art_init_inner_node(&node->base, CROARING_ART_NODE256_TYPE, prefix,
+        prefix_size);
+    node->count = 0;
+    for (size_t i = 0; i < 256; ++i) {
+        node->children[i] = NULL;
+    }
+    return node;
+}
+
+static void art_free_node256(art_node256_t *node) {
+    for (size_t i = 0; i < 256; ++i) {
+        if (node->children[i] != NULL) {
+            art_free_node(node->children[i]);
+        }
+    }
+    roaring_free(node);
+}
+
+static inline art_node_t *art_node256_find_child(const art_node256_t *node,
+    art_key_chunk_t key) {
+    return node->children[key];
+}
+
+static art_node_t *art_node256_insert(art_node256_t *node, art_node_t *child,
+    uint8_t key) {
+    node->children[key] = child;
+    node->count++;
+    return (art_node_t *)node;
+}
+
+static inline art_node_t *art_node256_erase(art_node256_t *node,
+    uint8_t key_chunk) {
+    node->children[key_chunk] = NULL;
+    node->count--;
+    if (node->count > 48) {
+        return (art_node_t *)node;
+    }
+
+    art_node48_t *new_node =
+        art_node48_create(node->base.prefix, node->base.prefix_size);
+    for (size_t i = 0; i < 256; ++i) {
+        if (node->children[i] != NULL) {
+            art_node48_insert(new_node, node->children[i], i);
+        }
+    }
+    roaring_free(node);
+    return (art_node_t *)new_node;
+}
+
+static inline void art_node256_replace(art_node256_t *node,
+    art_key_chunk_t key_chunk,
+    art_node_t *new_child) {
+    node->children[key_chunk] = new_child;
+}
+
+static inline art_indexed_child_t art_node256_next_child(
+    const art_node256_t *node, int index) {
+    art_indexed_child_t indexed_child;
+    index++;
+    for (size_t i = index; i < 256; ++i) {
+        if (node->children[i] != NULL) {
+            indexed_child.index = i;
+            indexed_child.child = node->children[i];
+            indexed_child.key_chunk = i;
+            return indexed_child;
+        }
+    }
+    indexed_child.child = NULL;
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node256_prev_child(
+    const art_node256_t *node, int index) {
+    if (index > 256) {
+        index = 256;
+    }
+    index--;
+    art_indexed_child_t indexed_child;
+    for (int i = index; i >= 0; --i) {
+        if (node->children[i] != NULL) {
+            indexed_child.index = i;
+            indexed_child.child = node->children[i];
+            indexed_child.key_chunk = i;
+            return indexed_child;
+        }
+    }
+    indexed_child.child = NULL;
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node256_child_at(
+    const art_node256_t *node, int index) {
+    art_indexed_child_t indexed_child;
+    if (index < 0 || index >= 256) {
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    indexed_child.index = index;
+    indexed_child.child = node->children[index];
+    indexed_child.key_chunk = index;
+    return indexed_child;
+}
+
+static inline art_indexed_child_t art_node256_lower_bound(
+    art_node256_t *node, art_key_chunk_t key_chunk) {
+    art_indexed_child_t indexed_child;
+    for (size_t i = key_chunk; i < 256; ++i) {
+        if (node->children[i] != NULL) {
+            indexed_child.index = i;
+            indexed_child.child = node->children[i];
+            indexed_child.key_chunk = i;
+            return indexed_child;
+        }
+    }
+    indexed_child.child = NULL;
+    return indexed_child;
+}
+
+static bool art_node256_internal_validate(const art_node256_t *node,
+    art_internal_validate_t validator) {
+    if (node->count <= 48) {
+        return art_validate_fail(&validator, "Node256 has too few children");
+    }
+    if (node->count > 256) {
+        return art_validate_fail(&validator, "Node256 has too many children");
+    }
+    validator.depth++;
+    int actual_count = 0;
+    for (int i = 0; i < 256; ++i) {
+        if (node->children[i] != NULL) {
+            actual_count++;
+
+            for (int j = i + 1; j < 256; ++j) {
+                if (node->children[i] == node->children[j]) {
+                    return art_validate_fail(&validator,
+                        "Node256 has duplicate children");
+                }
+            }
+
+            validator.current_key[validator.depth - 1] = i;
+            if (!art_internal_validate_at(node->children[i], validator)) {
+                return false;
+            }
+        }
+    }
+    if (actual_count != node->count) {
+        return art_validate_fail(
+            &validator, "Node256 count does not match actual children");
+    }
+    return true;
+}
+
+// Finds the child with the given key chunk in the inner node, returns NULL if
+// no such child is found.
+static art_node_t *art_find_child(const art_inner_node_t *node,
+    art_key_chunk_t key_chunk) {
+    switch (art_get_type(node)) {
+    case CROARING_ART_NODE4_TYPE:
+        return art_node4_find_child((art_node4_t *)node, key_chunk);
+    case CROARING_ART_NODE16_TYPE:
+        return art_node16_find_child((art_node16_t *)node, key_chunk);
+    case CROARING_ART_NODE48_TYPE:
+        return art_node48_find_child((art_node48_t *)node, key_chunk);
+    case CROARING_ART_NODE256_TYPE:
+        return art_node256_find_child((art_node256_t *)node, key_chunk);
+    default:
+        assert(false);
+        return NULL;
+    }
+}
+
+// Replaces the child with the given key chunk in the inner node.
+static void art_replace(art_inner_node_t *node, art_key_chunk_t key_chunk,
+    art_node_t *new_child) {
+    switch (art_get_type(node)) {
+    case CROARING_ART_NODE4_TYPE:
+        art_node4_replace((art_node4_t *)node, key_chunk, new_child);
+        break;
+    case CROARING_ART_NODE16_TYPE:
+        art_node16_replace((art_node16_t *)node, key_chunk, new_child);
+        break;
+    case CROARING_ART_NODE48_TYPE:
+        art_node48_replace((art_node48_t *)node, key_chunk, new_child);
+        break;
+    case CROARING_ART_NODE256_TYPE:
+        art_node256_replace((art_node256_t *)node, key_chunk, new_child);
+        break;
+    default:
+        assert(false);
+    }
+}
+
+// Erases the child with the given key chunk from the inner node, returns the
+// updated node (the same as the initial node if it was not shrunk).
+static art_node_t *art_node_erase(art_inner_node_t *node,
+    art_key_chunk_t key_chunk) {
+    switch (art_get_type(node)) {
+    case CROARING_ART_NODE4_TYPE:
+        return art_node4_erase((art_node4_t *)node, key_chunk);
+    case CROARING_ART_NODE16_TYPE:
+        return art_node16_erase((art_node16_t *)node, key_chunk);
+    case CROARING_ART_NODE48_TYPE:
+        return art_node48_erase((art_node48_t *)node, key_chunk);
+    case CROARING_ART_NODE256_TYPE:
+        return art_node256_erase((art_node256_t *)node, key_chunk);
+    default:
+        assert(false);
+        return NULL;
+    }
+}
+
+// Inserts the leaf with the given key chunk in the inner node, returns a
+// pointer to the (possibly expanded) node.
+static art_node_t *art_node_insert_leaf(art_inner_node_t *node,
+    art_key_chunk_t key_chunk,
+    art_leaf_t *leaf) {
+    art_node_t *child = (art_node_t *)(CROARING_SET_LEAF(leaf));
+    switch (art_get_type(node)) {
+    case CROARING_ART_NODE4_TYPE:
+        return art_node4_insert((art_node4_t *)node, child, key_chunk);
+    case CROARING_ART_NODE16_TYPE:
+        return art_node16_insert((art_node16_t *)node, child, key_chunk);
+    case CROARING_ART_NODE48_TYPE:
+        return art_node48_insert((art_node48_t *)node, child, key_chunk);
+    case CROARING_ART_NODE256_TYPE:
+        return art_node256_insert((art_node256_t *)node, child, key_chunk);
+    default:
+        assert(false);
+        return NULL;
+    }
+}
+
+// Frees the node and its children. Leaves are freed by the user.
+static void art_free_node(art_node_t *node) {
+    if (art_is_leaf(node)) {
+        // We leave it up to the user to free leaves.
+        return;
+    }
+    switch (art_get_type((art_inner_node_t *)node)) {
+    case CROARING_ART_NODE4_TYPE:
+        art_free_node4((art_node4_t *)node);
+        break;
+    case CROARING_ART_NODE16_TYPE:
+        art_free_node16((art_node16_t *)node);
+        break;
+    case CROARING_ART_NODE48_TYPE:
+        art_free_node48((art_node48_t *)node);
+        break;
+    case CROARING_ART_NODE256_TYPE:
+        art_free_node256((art_node256_t *)node);
+        break;
+    default:
+        assert(false);
+    }
+}
+
+// Returns the next child in key order, or NULL if called on a leaf.
+// Provided index may be in the range [-1, 255].
+static art_indexed_child_t art_node_next_child(const art_node_t *node,
+    int index) {
+    if (art_is_leaf(node)) {
+        art_indexed_child_t indexed_child;
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    switch (art_get_type((art_inner_node_t *)node)) {
+    case CROARING_ART_NODE4_TYPE:
+        return art_node4_next_child((art_node4_t *)node, index);
+    case CROARING_ART_NODE16_TYPE:
+        return art_node16_next_child((art_node16_t *)node, index);
+    case CROARING_ART_NODE48_TYPE:
+        return art_node48_next_child((art_node48_t *)node, index);
+    case CROARING_ART_NODE256_TYPE:
+        return art_node256_next_child((art_node256_t *)node, index);
+    default:
+        assert(false);
+        return (art_indexed_child_t){0, 0, 0};
+    }
+}
+
+// Returns the previous child in key order, or NULL if called on a leaf.
+// Provided index may be in the range [0, 256].
+static art_indexed_child_t art_node_prev_child(const art_node_t *node,
+    int index) {
+    if (art_is_leaf(node)) {
+        art_indexed_child_t indexed_child;
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    switch (art_get_type((art_inner_node_t *)node)) {
+    case CROARING_ART_NODE4_TYPE:
+        return art_node4_prev_child((art_node4_t *)node, index);
+    case CROARING_ART_NODE16_TYPE:
+        return art_node16_prev_child((art_node16_t *)node, index);
+    case CROARING_ART_NODE48_TYPE:
+        return art_node48_prev_child((art_node48_t *)node, index);
+    case CROARING_ART_NODE256_TYPE:
+        return art_node256_prev_child((art_node256_t *)node, index);
+    default:
+        assert(false);
+        return (art_indexed_child_t){0, 0, 0};
+    }
+}
+
+// Returns the child found at the provided index, or NULL if called on a leaf.
+// Provided index is only valid if returned by art_node_(next|prev)_child.
+static art_indexed_child_t art_node_child_at(const art_node_t *node,
+    int index) {
+    if (art_is_leaf(node)) {
+        art_indexed_child_t indexed_child;
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    switch (art_get_type((art_inner_node_t *)node)) {
+    case CROARING_ART_NODE4_TYPE:
+        return art_node4_child_at((art_node4_t *)node, index);
+    case CROARING_ART_NODE16_TYPE:
+        return art_node16_child_at((art_node16_t *)node, index);
+    case CROARING_ART_NODE48_TYPE:
+        return art_node48_child_at((art_node48_t *)node, index);
+    case CROARING_ART_NODE256_TYPE:
+        return art_node256_child_at((art_node256_t *)node, index);
+    default:
+        assert(false);
+        return (art_indexed_child_t){0, 0, 0};
+    }
+}
+
+// Returns the child with the smallest key equal to or greater than the given
+// key chunk, NULL if called on a leaf or no such child was found.
+static art_indexed_child_t art_node_lower_bound(const art_node_t *node,
+    art_key_chunk_t key_chunk) {
+    if (art_is_leaf(node)) {
+        art_indexed_child_t indexed_child;
+        indexed_child.child = NULL;
+        return indexed_child;
+    }
+    switch (art_get_type((art_inner_node_t *)node)) {
+    case CROARING_ART_NODE4_TYPE:
+        return art_node4_lower_bound((art_node4_t *)node, key_chunk);
+    case CROARING_ART_NODE16_TYPE:
+        return art_node16_lower_bound((art_node16_t *)node, key_chunk);
+    case CROARING_ART_NODE48_TYPE:
+        return art_node48_lower_bound((art_node48_t *)node, key_chunk);
+    case CROARING_ART_NODE256_TYPE:
+        return art_node256_lower_bound((art_node256_t *)node, key_chunk);
+    default:
+        assert(false);
+        return (art_indexed_child_t){0, 0, 0};
+    }
+}
+
+// ====================== End of node-specific functions =======================
+
+// Compares the given ranges of two keys, returns their relative order:
+// * Key range 1 <  key range 2: a negative value
+// * Key range 1 == key range 2: 0
+// * Key range 1 >  key range 2: a positive value
+static inline int art_compare_prefix(const art_key_chunk_t key1[],
+    uint8_t key1_from,
+    const art_key_chunk_t key2[],
+    uint8_t key2_from, uint8_t length) {
+    return memcmp(key1 + key1_from, key2 + key2_from, length);
+}
+
+// Compares two keys in full, see art_compare_prefix.
+int art_compare_keys(const art_key_chunk_t key1[],
+    const art_key_chunk_t key2[]) {
+    return art_compare_prefix(key1, 0, key2, 0, ART_KEY_BYTES);
+}
+
+// Returns the length of the common prefix between two key ranges.
+static uint8_t art_common_prefix(const art_key_chunk_t key1[],
+    uint8_t key1_from, uint8_t key1_to,
+    const art_key_chunk_t key2[],
+    uint8_t key2_from, uint8_t key2_to) {
+    uint8_t min_len = key1_to - key1_from;
+    uint8_t key2_len = key2_to - key2_from;
+    if (key2_len < min_len) {
+        min_len = key2_len;
+    }
+    uint8_t offset = 0;
+    for (; offset < min_len; ++offset) {
+        if (key1[key1_from + offset] != key2[key2_from + offset]) {
+            return offset;
+        }
+    }
+    return offset;
+}
+
+// Returns a pointer to the rootmost node where the value was inserted, may not
+// be equal to `node`.
+static art_node_t *art_insert_at(art_node_t *node, const art_key_chunk_t key[],
+    uint8_t depth, art_leaf_t *new_leaf) {
+    if (art_is_leaf(node)) {
+        art_leaf_t *leaf = CROARING_CAST_LEAF(node);
+        uint8_t common_prefix = art_common_prefix(
+            leaf->key, depth, ART_KEY_BYTES, key, depth, ART_KEY_BYTES);
+
+        // Previously this was a leaf, create an inner node instead and add both
+        // the existing and new leaf to it.
+        art_node_t *new_node =
+            (art_node_t *)art_node4_create(key + depth, common_prefix);
+
+        new_node = art_node_insert_leaf((art_inner_node_t *)new_node,
+            leaf->key[depth + common_prefix], leaf);
+        new_node = art_node_insert_leaf((art_inner_node_t *)new_node,
+            key[depth + common_prefix], new_leaf);
+
+        // The new inner node is now the rootmost node.
+        return new_node;
+    }
+    art_inner_node_t *inner_node = (art_inner_node_t *)node;
+    // Not a leaf: inner node
+    uint8_t common_prefix =
+        art_common_prefix(inner_node->prefix, 0, inner_node->prefix_size, key,
+            depth, ART_KEY_BYTES);
+    if (common_prefix != inner_node->prefix_size) {
+        // Partial prefix match.  Create a new internal node to hold the common
+        // prefix.
+        art_node4_t *node4 =
+            art_node4_create(inner_node->prefix, common_prefix);
+
+        // Make the existing internal node a child of the new internal node.
+        node4 = (art_node4_t *)art_node4_insert(
+            node4, node, inner_node->prefix[common_prefix]);
+
+        // Correct the prefix of the moved internal node, trimming off the chunk
+        // inserted into the new internal node.
+        inner_node->prefix_size = inner_node->prefix_size - common_prefix - 1;
+        if (inner_node->prefix_size > 0) {
+            // Move the remaining prefix to the correct position.
+            memmove(inner_node->prefix, inner_node->prefix + common_prefix + 1,
+                inner_node->prefix_size);
+        }
+
+        // Insert the value in the new internal node.
+        return art_node_insert_leaf(&node4->base, key[common_prefix + depth],
+            new_leaf);
+    }
+    // Prefix matches entirely or node has no prefix. Look for an existing
+    // child.
+    art_key_chunk_t key_chunk = key[depth + common_prefix];
+    art_node_t *child = art_find_child(inner_node, key_chunk);
+    if (child != NULL) {
+        art_node_t *new_child =
+            art_insert_at(child, key, depth + common_prefix + 1, new_leaf);
+        if (new_child != child) {
+            // Node type changed.
+            art_replace(inner_node, key_chunk, new_child);
+        }
+        return node;
+    }
+    return art_node_insert_leaf(inner_node, key_chunk, new_leaf);
+}
+
+// Erase helper struct.
+typedef struct art_erase_result_s {
+    // The rootmost node where the value was erased, may not be equal to `node`.
+    // If no value was removed, this is null.
+    art_node_t *rootmost_node;
+
+    // Value removed, null if not removed.
+    art_val_t *value_erased;
+} art_erase_result_t;
+
+// Searches for the given key starting at `node`, erases it if found.
+static art_erase_result_t art_erase_at(art_node_t *node,
+    const art_key_chunk_t *key,
+    uint8_t depth) {
+    art_erase_result_t result;
+    result.rootmost_node = NULL;
+    result.value_erased = NULL;
+
+    if (art_is_leaf(node)) {
+        art_leaf_t *leaf = CROARING_CAST_LEAF(node);
+        uint8_t common_prefix = art_common_prefix(leaf->key, 0, ART_KEY_BYTES,
+            key, 0, ART_KEY_BYTES);
+        if (common_prefix != ART_KEY_BYTES) {
+            // Leaf key mismatch.
+            return result;
+        }
+        result.value_erased = (art_val_t *)leaf;
+        return result;
+    }
+    art_inner_node_t *inner_node = (art_inner_node_t *)node;
+    uint8_t common_prefix =
+        art_common_prefix(inner_node->prefix, 0, inner_node->prefix_size, key,
+            depth, ART_KEY_BYTES);
+    if (common_prefix != inner_node->prefix_size) {
+        // Prefix mismatch.
+        return result;
+    }
+    art_key_chunk_t key_chunk = key[depth + common_prefix];
+    art_node_t *child = art_find_child(inner_node, key_chunk);
+    if (child == NULL) {
+        // No child with key chunk.
+        return result;
+    }
+    // Try to erase the key further down. Skip the key chunk associated with the
+    // child in the node.
+    art_erase_result_t child_result =
+        art_erase_at(child, key, depth + common_prefix + 1);
+    if (child_result.value_erased == NULL) {
+        return result;
+    }
+    result.value_erased = child_result.value_erased;
+    result.rootmost_node = node;
+    if (child_result.rootmost_node == NULL) {
+        // Child node was fully erased, erase it from this node's children.
+        result.rootmost_node = art_node_erase(inner_node, key_chunk);
+    } else if (child_result.rootmost_node != child) {
+        // Child node was not fully erased, update the pointer to it in this
+        // node.
+        art_replace(inner_node, key_chunk, child_result.rootmost_node);
+    }
+    return result;
+}
+
+// Searches for the given key starting at `node`, returns NULL if the key was
+// not found.
+static art_val_t *art_find_at(const art_node_t *node,
+    const art_key_chunk_t *key, uint8_t depth) {
+    while (!art_is_leaf(node)) {
+        art_inner_node_t *inner_node = (art_inner_node_t *)node;
+        uint8_t common_prefix =
+            art_common_prefix(inner_node->prefix, 0, inner_node->prefix_size,
+                key, depth, ART_KEY_BYTES);
+        if (common_prefix != inner_node->prefix_size) {
+            return NULL;
+        }
+        art_node_t *child =
+            art_find_child(inner_node, key[depth + inner_node->prefix_size]);
+        if (child == NULL) {
+            return NULL;
+        }
+        node = child;
+        // Include both the prefix and the child key chunk in the depth.
+        depth += inner_node->prefix_size + 1;
+    }
+    art_leaf_t *leaf = CROARING_CAST_LEAF(node);
+    if (depth >= ART_KEY_BYTES) {
+        return (art_val_t *)leaf;
+    }
+    uint8_t common_prefix =
+        art_common_prefix(leaf->key, 0, ART_KEY_BYTES, key, 0, ART_KEY_BYTES);
+    if (common_prefix == ART_KEY_BYTES) {
+        return (art_val_t *)leaf;
+    }
+    return NULL;
+}
+
+// Returns the size in bytes of the subtrie.
+size_t art_size_in_bytes_at(const art_node_t *node) {
+    if (art_is_leaf(node)) {
+        return 0;
+    }
+    size_t size = 0;
+    switch (art_get_type((art_inner_node_t *)node)) {
+    case CROARING_ART_NODE4_TYPE: {
+        size += sizeof(art_node4_t);
+    } break;
+    case CROARING_ART_NODE16_TYPE: {
+        size += sizeof(art_node16_t);
+    } break;
+    case CROARING_ART_NODE48_TYPE: {
+        size += sizeof(art_node48_t);
+    } break;
+    case CROARING_ART_NODE256_TYPE: {
+        size += sizeof(art_node256_t);
+    } break;
+    default:
+        assert(false);
+        break;
+    }
+    art_indexed_child_t indexed_child = art_node_next_child(node, -1);
+    while (indexed_child.child != NULL) {
+        size += art_size_in_bytes_at(indexed_child.child);
+        indexed_child = art_node_next_child(node, indexed_child.index);
+    }
+    return size;
+}
+
+static void art_node_print_type(const art_node_t *node) {
+    if (art_is_leaf(node)) {
+        printf("Leaf");
+        return;
+    }
+    switch (art_get_type((art_inner_node_t *)node)) {
+    case CROARING_ART_NODE4_TYPE:
+        printf("Node4");
+        return;
+    case CROARING_ART_NODE16_TYPE:
+        printf("Node16");
+        return;
+    case CROARING_ART_NODE48_TYPE:
+        printf("Node48");
+        return;
+    case CROARING_ART_NODE256_TYPE:
+        printf("Node256");
+        return;
+    default:
+        assert(false);
+        return;
+    }
+}
+
+void art_node_printf(const art_node_t *node, uint8_t depth) {
+    if (art_is_leaf(node)) {
+        printf("{ type: Leaf, key: ");
+        art_leaf_t *leaf = CROARING_CAST_LEAF(node);
+        for (size_t i = 0; i < ART_KEY_BYTES; ++i) {
+            printf("%02x", leaf->key[i]);
+        }
+        printf(" }\n");
+        return;
+    }
+    printf("{\n");
+    depth++;
+
+    printf("%*s", depth, "");
+    printf("type: ");
+    art_node_print_type(node);
+    printf("\n");
+
+    art_inner_node_t *inner_node = (art_inner_node_t *)node;
+    printf("%*s", depth, "");
+    printf("prefix_size: %d\n", inner_node->prefix_size);
+
+    printf("%*s", depth, "");
+    printf("prefix: ");
+    for (uint8_t i = 0; i < inner_node->prefix_size; ++i) {
+        printf("%02x", inner_node->prefix[i]);
+    }
+    printf("\n");
+
+    switch (art_get_type(inner_node)) {
+    case CROARING_ART_NODE4_TYPE: {
+        art_node4_t *node4 = (art_node4_t *)node;
+        for (uint8_t i = 0; i < node4->count; ++i) {
+            printf("%*s", depth, "");
+            printf("key: %02x ", node4->keys[i]);
+            art_node_printf(node4->children[i], depth);
+        }
+    } break;
+    case CROARING_ART_NODE16_TYPE: {
+        art_node16_t *node16 = (art_node16_t *)node;
+        for (uint8_t i = 0; i < node16->count; ++i) {
+            printf("%*s", depth, "");
+            printf("key: %02x ", node16->keys[i]);
+            art_node_printf(node16->children[i], depth);
+        }
+    } break;
+    case CROARING_ART_NODE48_TYPE: {
+        art_node48_t *node48 = (art_node48_t *)node;
+        for (int i = 0; i < 256; ++i) {
+            if (node48->keys[i] != CROARING_ART_NODE48_EMPTY_VAL) {
+                printf("%*s", depth, "");
+                printf("key: %02x ", i);
+                printf("child: %02x ", node48->keys[i]);
+                art_node_printf(node48->children[node48->keys[i]], depth);
+            }
+        }
+    } break;
+    case CROARING_ART_NODE256_TYPE: {
+        art_node256_t *node256 = (art_node256_t *)node;
+        for (int i = 0; i < 256; ++i) {
+            if (node256->children[i] != NULL) {
+                printf("%*s", depth, "");
+                printf("key: %02x ", i);
+                art_node_printf(node256->children[i], depth);
+            }
+        }
+    } break;
+    default:
+        assert(false);
+        break;
+    }
+    depth--;
+    printf("%*s", depth, "");
+    printf("}\n");
+}
+
+void art_insert(art_t *art, const art_key_chunk_t *key, art_val_t *val) {
+    art_leaf_t *leaf = (art_leaf_t *)val;
+    art_leaf_populate(leaf, key);
+    if (art->root == NULL) {
+        art->root = (art_node_t *)CROARING_SET_LEAF(leaf);
+        return;
+    }
+    art->root = art_insert_at(art->root, key, 0, leaf);
+}
+
+art_val_t *art_erase(art_t *art, const art_key_chunk_t *key) {
+    if (art->root == NULL) {
+        return NULL;
+    }
+    art_erase_result_t result = art_erase_at(art->root, key, 0);
+    if (result.value_erased == NULL) {
+        return NULL;
+    }
+    art->root = result.rootmost_node;
+    return result.value_erased;
+}
+
+art_val_t *art_find(const art_t *art, const art_key_chunk_t *key) {
+    if (art->root == NULL) {
+        return NULL;
+    }
+    return art_find_at(art->root, key, 0);
+}
+
+bool art_is_empty(const art_t *art) { return art->root == NULL; }
+
+void art_free(art_t *art) {
+    if (art->root == NULL) {
+        return;
+    }
+    art_free_node(art->root);
+}
+
+size_t art_size_in_bytes(const art_t *art) {
+    size_t size = sizeof(art_t);
+    if (art->root != NULL) {
+        size += art_size_in_bytes_at(art->root);
+    }
+    return size;
+}
+
+void art_printf(const art_t *art) {
+    if (art->root == NULL) {
+        return;
+    }
+    art_node_printf(art->root, 0);
+}
+
+// Returns the current node that the iterator is positioned at.
+static inline art_node_t *art_iterator_node(art_iterator_t *iterator) {
+    return iterator->frames[iterator->frame].node;
+}
+
+// Sets the iterator key and value to the leaf's key and value. Always returns
+// true for convenience.
+static inline bool art_iterator_valid_loc(art_iterator_t *iterator,
+    art_leaf_t *leaf) {
+    iterator->frames[iterator->frame].node = CROARING_SET_LEAF(leaf);
+    iterator->frames[iterator->frame].index_in_node = 0;
+    memcpy(iterator->key, leaf->key, ART_KEY_BYTES);
+    iterator->value = (art_val_t *)leaf;
+    return true;
+}
+
+// Invalidates the iterator key and value. Always returns false for convenience.
+static inline bool art_iterator_invalid_loc(art_iterator_t *iterator) {
+    memset(iterator->key, 0, ART_KEY_BYTES);
+    iterator->value = NULL;
+    return false;
+}
+
+// Moves the iterator one level down in the tree, given a node at the current
+// level and the index of the child that we're going down to.
+//
+// Note: does not set the index at the new level.
+static void art_iterator_down(art_iterator_t *iterator,
+    const art_inner_node_t *node,
+    uint8_t index_in_node) {
+    iterator->frames[iterator->frame].node = (art_node_t *)node;
+    iterator->frames[iterator->frame].index_in_node = index_in_node;
+    iterator->frame++;
+    art_indexed_child_t indexed_child =
+        art_node_child_at((art_node_t *)node, index_in_node);
+    assert(indexed_child.child != NULL);
+    iterator->frames[iterator->frame].node = indexed_child.child;
+    iterator->depth += node->prefix_size + 1;
+}
+
+// Moves the iterator to the next/previous child of the current node. Returns
+// the child moved to, or NULL if there is no neighboring child.
+static art_node_t *art_iterator_neighbor_child(
+    art_iterator_t *iterator, const art_inner_node_t *inner_node,
+    bool forward) {
+    art_iterator_frame_t frame = iterator->frames[iterator->frame];
+    art_indexed_child_t indexed_child;
+    if (forward) {
+        indexed_child = art_node_next_child(frame.node, frame.index_in_node);
+    } else {
+        indexed_child = art_node_prev_child(frame.node, frame.index_in_node);
+    }
+    if (indexed_child.child != NULL) {
+        art_iterator_down(iterator, inner_node, indexed_child.index);
+    }
+    return indexed_child.child;
+}
+
+// Moves the iterator one level up in the tree, returns false if not possible.
+static bool art_iterator_up(art_iterator_t *iterator) {
+    if (iterator->frame == 0) {
+        return false;
+    }
+    iterator->frame--;
+    // We went up, so we are at an inner node.
+    iterator->depth -=
+        ((art_inner_node_t *)art_iterator_node(iterator))->prefix_size + 1;
+    return true;
+}
+
+// Moves the iterator one level, followed by a move to the next / previous leaf.
+// Sets the status of the iterator.
+static bool art_iterator_up_and_move(art_iterator_t *iterator, bool forward) {
+    if (!art_iterator_up(iterator)) {
+        // We're at the root.
+        return art_iterator_invalid_loc(iterator);
+    }
+    return art_iterator_move(iterator, forward);
+}
+
+// Initializes the iterator at the first / last leaf of the given node.
+// Returns true for convenience.
+static bool art_node_init_iterator(const art_node_t *node,
+    art_iterator_t *iterator, bool first) {
+    while (!art_is_leaf(node)) {
+        art_indexed_child_t indexed_child;
+        if (first) {
+            indexed_child = art_node_next_child(node, -1);
+        } else {
+            indexed_child = art_node_prev_child(node, 256);
+        }
+        art_iterator_down(iterator, (art_inner_node_t *)node,
+            indexed_child.index);
+        node = indexed_child.child;
+    }
+    // We're at a leaf.
+    iterator->frames[iterator->frame].node = (art_node_t *)node;
+    iterator->frames[iterator->frame].index_in_node = 0;  // Should not matter.
+    return art_iterator_valid_loc(iterator, CROARING_CAST_LEAF(node));
+}
+
+bool art_iterator_move(art_iterator_t *iterator, bool forward) {
+    if (art_is_leaf(art_iterator_node(iterator))) {
+        bool went_up = art_iterator_up(iterator);
+        if (!went_up) {
+            // This leaf is the root, we're done.
+            return art_iterator_invalid_loc(iterator);
+        }
+    }
+    // Advance within inner node.
+    art_node_t *neighbor_child = art_iterator_neighbor_child(
+        iterator, (art_inner_node_t *)art_iterator_node(iterator), forward);
+    if (neighbor_child != NULL) {
+        // There is another child at this level, go down to the first or last
+        // leaf.
+        return art_node_init_iterator(neighbor_child, iterator, forward);
+    }
+    // No more children at this level, go up.
+    return art_iterator_up_and_move(iterator, forward);
+}
+
+// Assumes the iterator is positioned at a node with an equal prefix path up to
+// the depth of the iterator.
+static bool art_node_iterator_lower_bound(const art_node_t *node,
+    art_iterator_t *iterator,
+    const art_key_chunk_t key[]) {
+    while (!art_is_leaf(node)) {
+        art_inner_node_t *inner_node = (art_inner_node_t *)node;
+        int prefix_comparison =
+            art_compare_prefix(inner_node->prefix, 0, key, iterator->depth,
+                inner_node->prefix_size);
+        if (prefix_comparison < 0) {
+            // Prefix so far has been equal, but we've found a smaller key.
+            // Since we take the lower bound within each node, we can return the
+            // next leaf.
+            return art_iterator_up_and_move(iterator, true);
+        } else if (prefix_comparison > 0) {
+            // No key equal to the key we're looking for, return the first leaf.
+            return art_node_init_iterator(node, iterator, true);
+        }
+        // Prefix is equal, move to lower bound child.
+        art_key_chunk_t key_chunk =
+            key[iterator->depth + inner_node->prefix_size];
+        art_indexed_child_t indexed_child =
+            art_node_lower_bound(node, key_chunk);
+        if (indexed_child.child == NULL) {
+            // Only smaller keys among children.
+            return art_iterator_up_and_move(iterator, true);
+        }
+        if (indexed_child.key_chunk > key_chunk) {
+            // Only larger children, return the first larger child.
+            art_iterator_down(iterator, inner_node, indexed_child.index);
+            return art_node_init_iterator(indexed_child.child, iterator, true);
+        }
+        // We found a child with an equal prefix.
+        art_iterator_down(iterator, inner_node, indexed_child.index);
+        node = indexed_child.child;
+    }
+    art_leaf_t *leaf = CROARING_CAST_LEAF(node);
+    if (art_compare_keys(leaf->key, key) >= 0) {
+        // Leaf has an equal or larger key.
+        return art_iterator_valid_loc(iterator, leaf);
+    }
+    // Leaf has an equal prefix, but the full key is smaller. Move to the next
+    // leaf.
+    return art_iterator_up_and_move(iterator, true);
+}
+
+art_iterator_t art_init_iterator(const art_t *art, bool first) {
+    art_iterator_t iterator = CROARING_ZERO_INITIALIZER;
+    if (art->root == NULL) {
+        return iterator;
+    }
+    art_node_init_iterator(art->root, &iterator, first);
+    return iterator;
+}
+
+bool art_iterator_next(art_iterator_t *iterator) {
+    return art_iterator_move(iterator, true);
+}
+
+bool art_iterator_prev(art_iterator_t *iterator) {
+    return art_iterator_move(iterator, false);
+}
+
+bool art_iterator_lower_bound(art_iterator_t *iterator,
+    const art_key_chunk_t *key) {
+    if (iterator->value == NULL) {
+        // We're beyond the end / start of the ART so the iterator does not have
+        // a valid key. Start from the root.
+        iterator->frame = 0;
+        iterator->depth = 0;
+        art_node_t *root = art_iterator_node(iterator);
+        if (root == NULL) {
+            return false;
+        }
+        return art_node_iterator_lower_bound(root, iterator, key);
+    }
+    int compare_result =
+        art_compare_prefix(iterator->key, 0, key, 0, ART_KEY_BYTES);
+    // Move up until we have an equal prefix, after which we can do a normal
+    // lower bound search.
+    while (compare_result != 0) {
+        if (!art_iterator_up(iterator)) {
+            if (compare_result < 0) {
+                // Only smaller keys found.
+                return art_iterator_invalid_loc(iterator);
+            } else {
+                return art_node_init_iterator(art_iterator_node(iterator),
+                    iterator, true);
+            }
+        }
+        // Since we're only moving up, we can keep comparing against the
+        // iterator key.
+        art_inner_node_t *inner_node =
+            (art_inner_node_t *)art_iterator_node(iterator);
+        compare_result =
+            art_compare_prefix(iterator->key, 0, key, 0,
+                iterator->depth + inner_node->prefix_size);
+    }
+    if (compare_result > 0) {
+        return art_node_init_iterator(art_iterator_node(iterator), iterator,
+            true);
+    }
+    return art_node_iterator_lower_bound(art_iterator_node(iterator), iterator,
+        key);
+}
+
+art_iterator_t art_lower_bound(const art_t *art, const art_key_chunk_t *key) {
+    art_iterator_t iterator = CROARING_ZERO_INITIALIZER;
+    if (art->root != NULL) {
+        art_node_iterator_lower_bound(art->root, &iterator, key);
+    }
+    return iterator;
+}
+
+art_iterator_t art_upper_bound(const art_t *art, const art_key_chunk_t *key) {
+    art_iterator_t iterator = CROARING_ZERO_INITIALIZER;
+    if (art->root != NULL) {
+        if (art_node_iterator_lower_bound(art->root, &iterator, key) &&
+            art_compare_keys(iterator.key, key) == 0) {
+            art_iterator_next(&iterator);
+        }
+    }
+    return iterator;
+}
+
+void art_iterator_insert(art_t *art, art_iterator_t *iterator,
+    const art_key_chunk_t *key, art_val_t *val) {
+    // TODO: This can likely be faster.
+    art_insert(art, key, val);
+    assert(art->root != NULL);
+    iterator->frame = 0;
+    iterator->depth = 0;
+    art_node_iterator_lower_bound(art->root, iterator, key);
+}
+
+// TODO: consider keeping `art_t *art` in the iterator.
+art_val_t *art_iterator_erase(art_t *art, art_iterator_t *iterator) {
+    if (iterator->value == NULL) {
+        return NULL;
+    }
+    art_key_chunk_t initial_key[ART_KEY_BYTES];
+    memcpy(initial_key, iterator->key, ART_KEY_BYTES);
+
+    art_val_t *value_erased = iterator->value;
+    bool went_up = art_iterator_up(iterator);
+    if (!went_up) {
+        // We're erasing the root.
+        art->root = NULL;
+        art_iterator_invalid_loc(iterator);
+        return value_erased;
+    }
+
+    // Erase the leaf.
+    art_inner_node_t *parent_node =
+        (art_inner_node_t *)art_iterator_node(iterator);
+    art_key_chunk_t key_chunk_in_parent =
+        iterator->key[iterator->depth + parent_node->prefix_size];
+    art_node_t *new_parent_node =
+        art_node_erase(parent_node, key_chunk_in_parent);
+
+    if (new_parent_node != ((art_node_t *)parent_node)) {
+        // Replace the pointer to the inner node we erased from in its
+        // parent (it may be a leaf now).
+        iterator->frames[iterator->frame].node = new_parent_node;
+        went_up = art_iterator_up(iterator);
+        if (went_up) {
+            art_inner_node_t *grandparent_node =
+                (art_inner_node_t *)art_iterator_node(iterator);
+            art_key_chunk_t key_chunk_in_grandparent =
+                iterator->key[iterator->depth + grandparent_node->prefix_size];
+            art_replace(grandparent_node, key_chunk_in_grandparent,
+                new_parent_node);
+        } else {
+            // We were already at the rootmost node.
+            art->root = new_parent_node;
+        }
+    }
+
+    iterator->frame = 0;
+    iterator->depth = 0;
+    // Do a lower bound search for the initial key, which will find the first
+    // greater key if it exists. This can likely be mildly faster if we instead
+    // start from the current position.
+    art_node_iterator_lower_bound(art->root, iterator, initial_key);
+    return value_erased;
+}
+
+static bool art_internal_validate_at(const art_node_t *node,
+    art_internal_validate_t validator) {
+    if (node == NULL) {
+        return art_validate_fail(&validator, "node is null");
+    }
+    if (art_is_leaf(node)) {
+        art_leaf_t *leaf = CROARING_CAST_LEAF(node);
+        if (art_compare_prefix(leaf->key, 0, validator.current_key, 0,
+                validator.depth) != 0) {
+            return art_validate_fail(
+                &validator,
+                "leaf key does not match its position's prefix in the tree");
+        }
+        if (validator.validate_cb != NULL &&
+            !validator.validate_cb(leaf, validator.reason)) {
+            if (*validator.reason == NULL) {
+                *validator.reason = "leaf validation failed";
+            }
+            return false;
+        }
+    } else {
+        art_inner_node_t *inner_node = (art_inner_node_t *)node;
+
+        if (validator.depth + inner_node->prefix_size + 1 > ART_KEY_BYTES) {
+            return art_validate_fail(&validator,
+                "node has too much prefix at given depth");
+        }
+        memcpy(validator.current_key + validator.depth, inner_node->prefix,
+            inner_node->prefix_size);
+        validator.depth += inner_node->prefix_size;
+
+        switch (inner_node->typecode) {
+        case CROARING_ART_NODE4_TYPE:
+            if (!art_node4_internal_validate((art_node4_t *)inner_node,
+                    validator)) {
+                return false;
+            }
+            break;
+        case CROARING_ART_NODE16_TYPE:
+            if (!art_node16_internal_validate((art_node16_t *)inner_node,
+                    validator)) {
+                return false;
+            }
+            break;
+        case CROARING_ART_NODE48_TYPE:
+            if (!art_node48_internal_validate((art_node48_t *)inner_node,
+                    validator)) {
+                return false;
+            }
+            break;
+        case CROARING_ART_NODE256_TYPE:
+            if (!art_node256_internal_validate((art_node256_t *)inner_node,
+                    validator)) {
+                return false;
+            }
+            break;
+        default:
+            return art_validate_fail(&validator, "invalid node type");
+        }
+    }
+    return true;
+}
+
+bool art_internal_validate(const art_t *art, const char **reason,
+    art_validate_cb_t validate_cb) {
+    const char *reason_local;
+    if (reason == NULL) {
+        // Always allow assigning through *reason
+        reason = &reason_local;
+    }
+    *reason = NULL;
+    if (art->root == NULL) {
+        return true;
+    }
+    art_internal_validate_t validator = {
+        .reason = reason,
+        .validate_cb = validate_cb,
+        .depth = 0,
+        .current_key = {0},
+    };
+    return art_internal_validate_at(art->root, validator);
+}
+
+#ifdef __cplusplus
+}  // extern "C"
+}  // namespace roaring
+}  // namespace internal
+#endif
+/* end file src/art/art.c */
+/* begin file src/bitset.c */
+#include <limits.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+extern inline void bitset_print(const bitset_t *b);
+extern inline bool bitset_for_each(const bitset_t *b, bitset_iterator iterator,
+    void *ptr);
+extern inline size_t bitset_next_set_bits(const bitset_t *bitset,
+    size_t *buffer, size_t capacity,
+    size_t *startfrom);
+extern inline void bitset_set_to_value(bitset_t *bitset, size_t i, bool flag);
+extern inline bool bitset_next_set_bit(const bitset_t *bitset, size_t *i);
+extern inline void bitset_set(bitset_t *bitset, size_t i);
+extern inline bool bitset_get(const bitset_t *bitset, size_t i);
+extern inline size_t bitset_size_in_words(const bitset_t *bitset);
+extern inline size_t bitset_size_in_bits(const bitset_t *bitset);
+extern inline size_t bitset_size_in_bytes(const bitset_t *bitset);
+
+/* Create a new bitset. Return NULL in case of failure. */
+bitset_t *bitset_create(void) {
+    bitset_t *bitset = NULL;
+    /* Allocate the bitset itself. */
+    if ((bitset = (bitset_t *)roaring_malloc(sizeof(bitset_t))) == NULL) {
+        return NULL;
+    }
+    bitset->array = NULL;
+    bitset->arraysize = 0;
+    bitset->capacity = 0;
+    return bitset;
+}
+
+/* Create a new bitset able to contain size bits. Return NULL in case of
+ * failure. */
+bitset_t *bitset_create_with_capacity(size_t size) {
+    bitset_t *bitset = NULL;
+    /* Allocate the bitset itself. */
+    if ((bitset = (bitset_t *)roaring_malloc(sizeof(bitset_t))) == NULL) {
+        return NULL;
+    }
+    bitset->arraysize =
+        (size + sizeof(uint64_t) * 8 - 1) / (sizeof(uint64_t) * 8);
+    bitset->capacity = bitset->arraysize;
+    if ((bitset->array = (uint64_t *)roaring_calloc(
+             bitset->arraysize, sizeof(uint64_t))) == NULL) {
+        roaring_free(bitset);
+        return NULL;
+    }
+    return bitset;
+}
+
+/* Create a copy */
+bitset_t *bitset_copy(const bitset_t *bitset) {
+    bitset_t *copy = NULL;
+    /* Allocate the bitset itself. */
+    if ((copy = (bitset_t *)roaring_malloc(sizeof(bitset_t))) == NULL) {
+        return NULL;
+    }
+    memcpy(copy, bitset, sizeof(bitset_t));
+    copy->capacity = copy->arraysize;
+    if ((copy->array = (uint64_t *)roaring_malloc(sizeof(uint64_t) *
+                                                 bitset->arraysize)) == NULL) {
+        roaring_free(copy);
+        return NULL;
+    }
+    memcpy(copy->array, bitset->array, sizeof(uint64_t) * bitset->arraysize);
+    return copy;
+}
+
+void bitset_clear(bitset_t *bitset) {
+    memset(bitset->array, 0, sizeof(uint64_t) * bitset->arraysize);
+}
+
+void bitset_fill(bitset_t *bitset) {
+    memset(bitset->array, 0xff, sizeof(uint64_t) * bitset->arraysize);
+}
+
+void bitset_shift_left(bitset_t *bitset, size_t s) {
+    size_t extra_words = s / 64;
+    int inword_shift = s % 64;
+    size_t as = bitset->arraysize;
+    if (inword_shift == 0) {
+        bitset_resize(bitset, as + extra_words, false);
+        // could be done with a memmove
+        for (size_t i = as + extra_words; i > extra_words; i--) {
+            bitset->array[i - 1] = bitset->array[i - 1 - extra_words];
+        }
+    } else {
+        bitset_resize(bitset, as + extra_words + 1, true);
+        bitset->array[as + extra_words] =
+            bitset->array[as - 1] >> (64 - inword_shift);
+        for (size_t i = as + extra_words; i >= extra_words + 2; i--) {
+            bitset->array[i - 1] =
+                (bitset->array[i - 1 - extra_words] << inword_shift) |
+                (bitset->array[i - 2 - extra_words] >> (64 - inword_shift));
+        }
+        bitset->array[extra_words] = bitset->array[0] << inword_shift;
+    }
+    for (size_t i = 0; i < extra_words; i++) {
+        bitset->array[i] = 0;
+    }
+}
+
+void bitset_shift_right(bitset_t *bitset, size_t s) {
+    size_t extra_words = s / 64;
+    int inword_shift = s % 64;
+    size_t as = bitset->arraysize;
+    if (inword_shift == 0) {
+        // could be done with a memmove
+        for (size_t i = 0; i < as - extra_words; i++) {
+            bitset->array[i] = bitset->array[i + extra_words];
+        }
+        bitset_resize(bitset, as - extra_words, false);
+
+    } else {
+        for (size_t i = 0; i + extra_words + 1 < as; i++) {
+            bitset->array[i] =
+                (bitset->array[i + extra_words] >> inword_shift) |
+                (bitset->array[i + extra_words + 1] << (64 - inword_shift));
+        }
+        bitset->array[as - extra_words - 1] =
+            (bitset->array[as - 1] >> inword_shift);
+        bitset_resize(bitset, as - extra_words, false);
+    }
+}
+
+/* Free memory. */
+void bitset_free(bitset_t *bitset) {
+    if (bitset == NULL) {
+        return;
+    }
+    roaring_free(bitset->array);
+    roaring_free(bitset);
+}
+
+/* Resize the bitset so that it can support newarraysize * 64 bits. Return true
+ * in case of success, false for failure. */
+bool bitset_resize(bitset_t *bitset, size_t newarraysize, bool padwithzeroes) {
+    if (newarraysize > SIZE_MAX / 64) {
+        return false;
+    }
+    size_t smallest =
+        newarraysize < bitset->arraysize ? newarraysize : bitset->arraysize;
+    if (bitset->capacity < newarraysize) {
+        uint64_t *newarray;
+        size_t newcapacity = bitset->capacity;
+        if (newcapacity == 0) {
+            newcapacity = 1;
+        }
+        while (newcapacity < newarraysize) {
+            newcapacity *= 2;
+        }
+        if ((newarray = (uint64_t *)roaring_realloc(
+                 bitset->array, sizeof(uint64_t) * newcapacity)) == NULL) {
+            return false;
+        }
+        bitset->capacity = newcapacity;
+        bitset->array = newarray;
+    }
+    if (padwithzeroes && (newarraysize > smallest))
+        memset(bitset->array + smallest, 0,
+            sizeof(uint64_t) * (newarraysize - smallest));
+    bitset->arraysize = newarraysize;
+    return true;  // success!
+}
+
+size_t bitset_count(const bitset_t *bitset) {
+    size_t card = 0;
+    size_t k = 0;
+    for (; k + 7 < bitset->arraysize; k += 8) {
+        card += roaring_hamming(bitset->array[k]);
+        card += roaring_hamming(bitset->array[k + 1]);
+        card += roaring_hamming(bitset->array[k + 2]);
+        card += roaring_hamming(bitset->array[k + 3]);
+        card += roaring_hamming(bitset->array[k + 4]);
+        card += roaring_hamming(bitset->array[k + 5]);
+        card += roaring_hamming(bitset->array[k + 6]);
+        card += roaring_hamming(bitset->array[k + 7]);
+    }
+    for (; k + 3 < bitset->arraysize; k += 4) {
+        card += roaring_hamming(bitset->array[k]);
+        card += roaring_hamming(bitset->array[k + 1]);
+        card += roaring_hamming(bitset->array[k + 2]);
+        card += roaring_hamming(bitset->array[k + 3]);
+    }
+    for (; k < bitset->arraysize; k++) {
+        card += roaring_hamming(bitset->array[k]);
+    }
+    return card;
+}
+
+bool bitset_inplace_union(bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+    for (size_t k = 0; k < minlength; ++k) {
+        b1->array[k] |= b2->array[k];
+    }
+    if (b2->arraysize > b1->arraysize) {
+        size_t oldsize = b1->arraysize;
+        if (!bitset_resize(b1, b2->arraysize, false)) return false;
+        memcpy(b1->array + oldsize, b2->array + oldsize,
+            (b2->arraysize - oldsize) * sizeof(uint64_t));
+    }
+    return true;
+}
+
+size_t bitset_minimum(const bitset_t *bitset) {
+    for (size_t k = 0; k < bitset->arraysize; k++) {
+        uint64_t w = bitset->array[k];
+        if (w != 0) {
+            return roaring_trailing_zeroes(w) + k * 64;
+        }
+    }
+    return 0;
+}
+
+bool bitset_grow(bitset_t *bitset, size_t newarraysize) {
+    if (newarraysize < bitset->arraysize) {
+        return false;
+    }
+    if (newarraysize > SIZE_MAX / 64) {
+        return false;
+    }
+    if (bitset->capacity < newarraysize) {
+        uint64_t *newarray;
+        size_t newcapacity = (UINT64_C(0xFFFFFFFFFFFFFFFF) >>
+                                 roaring_leading_zeroes(newarraysize)) +
+                             1;
+        while (newcapacity < newarraysize) {
+            newcapacity *= 2;
+        }
+        if ((newarray = (uint64_t *)roaring_realloc(
+                 bitset->array, sizeof(uint64_t) * newcapacity)) == NULL) {
+            return false;
+        }
+        bitset->capacity = newcapacity;
+        bitset->array = newarray;
+    }
+    memset(bitset->array + bitset->arraysize, 0,
+        sizeof(uint64_t) * (newarraysize - bitset->arraysize));
+    bitset->arraysize = newarraysize;
+    return true;  // success!
+}
+
+size_t bitset_maximum(const bitset_t *bitset) {
+    for (size_t k = bitset->arraysize; k > 0; k--) {
+        uint64_t w = bitset->array[k - 1];
+        if (w != 0) {
+            return 63 - roaring_leading_zeroes(w) + (k - 1) * 64;
+        }
+    }
+    return 0;
+}
+
+/* Returns true if bitsets share no common elements, false otherwise.
+ *
+ * Performs early-out if common element found. */
+bool bitsets_disjoint(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+
+    for (size_t k = 0; k < minlength; k++) {
+        if ((b1->array[k] & b2->array[k]) != 0) return false;
+    }
+    return true;
+}
+
+/* Returns true if bitsets contain at least 1 common element, false if they are
+ * disjoint.
+ *
+ * Performs early-out if common element found. */
+bool bitsets_intersect(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+
+    for (size_t k = 0; k < minlength; k++) {
+        if ((b1->array[k] & b2->array[k]) != 0) return true;
+    }
+    return false;
+}
+
+/* Returns true if b has any bits set in or after b->array[starting_loc]. */
+static bool any_bits_set(const bitset_t *b, size_t starting_loc) {
+    if (starting_loc >= b->arraysize) {
+        return false;
+    }
+    for (size_t k = starting_loc; k < b->arraysize; k++) {
+        if (b->array[k] != 0) return true;
+    }
+    return false;
+}
+
+/* Returns true if b1 has all of b2's bits set.
+ *
+ * Performs early out if a bit is found in b2 that is not found in b1. */
+bool bitset_contains_all(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t min_size = b1->arraysize;
+    if (b1->arraysize > b2->arraysize) {
+        min_size = b2->arraysize;
+    }
+    for (size_t k = 0; k < min_size; k++) {
+        if ((b1->array[k] & b2->array[k]) != b2->array[k]) {
+            return false;
+        }
+    }
+    if (b2->arraysize > b1->arraysize) {
+        /* Need to check if b2 has any bits set beyond b1's array */
+        return !any_bits_set(b2, b1->arraysize);
+    }
+    return true;
+}
+
+size_t bitset_union_count(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t answer = 0;
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+    size_t k = 0;
+    for (; k + 3 < minlength; k += 4) {
+        answer += roaring_hamming(b1->array[k] | b2->array[k]);
+        answer += roaring_hamming(b1->array[k + 1] | b2->array[k + 1]);
+        answer += roaring_hamming(b1->array[k + 2] | b2->array[k + 2]);
+        answer += roaring_hamming(b1->array[k + 3] | b2->array[k + 3]);
+    }
+    for (; k < minlength; ++k) {
+        answer += roaring_hamming(b1->array[k] | b2->array[k]);
+    }
+    if (b2->arraysize > b1->arraysize) {
+        // k is equal to b1->arraysize
+        for (; k + 3 < b2->arraysize; k += 4) {
+            answer += roaring_hamming(b2->array[k]);
+            answer += roaring_hamming(b2->array[k + 1]);
+            answer += roaring_hamming(b2->array[k + 2]);
+            answer += roaring_hamming(b2->array[k + 3]);
+        }
+        for (; k < b2->arraysize; ++k) {
+            answer += roaring_hamming(b2->array[k]);
+        }
+    } else {
+        // k is equal to b2->arraysize
+        for (; k + 3 < b1->arraysize; k += 4) {
+            answer += roaring_hamming(b1->array[k]);
+            answer += roaring_hamming(b1->array[k + 1]);
+            answer += roaring_hamming(b1->array[k + 2]);
+            answer += roaring_hamming(b1->array[k + 3]);
+        }
+        for (; k < b1->arraysize; ++k) {
+            answer += roaring_hamming(b1->array[k]);
+        }
+    }
+    return answer;
+}
+
+void bitset_inplace_intersection(bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+    size_t k = 0;
+    for (; k < minlength; ++k) {
+        b1->array[k] &= b2->array[k];
+    }
+    for (; k < b1->arraysize; ++k) {
+        b1->array[k] = 0;  // memset could, maybe, be a tiny bit faster
+    }
+}
+
+size_t bitset_intersection_count(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t answer = 0;
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+    for (size_t k = 0; k < minlength; ++k) {
+        answer += roaring_hamming(b1->array[k] & b2->array[k]);
+    }
+    return answer;
+}
+
+void bitset_inplace_difference(bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+    size_t k = 0;
+    for (; k < minlength; ++k) {
+        b1->array[k] &= ~(b2->array[k]);
+    }
+}
+
+size_t bitset_difference_count(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+    size_t k = 0;
+    size_t answer = 0;
+    for (; k < minlength; ++k) {
+        answer += roaring_hamming(b1->array[k] & ~(b2->array[k]));
+    }
+    for (; k < b1->arraysize; ++k) {
+        answer += roaring_hamming(b1->array[k]);
+    }
+    return answer;
+}
+
+bool bitset_inplace_symmetric_difference(
+    bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+    size_t k = 0;
+    for (; k < minlength; ++k) {
+        b1->array[k] ^= b2->array[k];
+    }
+    if (b2->arraysize > b1->arraysize) {
+        size_t oldsize = b1->arraysize;
+        if (!bitset_resize(b1, b2->arraysize, false)) return false;
+        memcpy(b1->array + oldsize, b2->array + oldsize,
+            (b2->arraysize - oldsize) * sizeof(uint64_t));
+    }
+    return true;
+}
+
+size_t bitset_symmetric_difference_count(
+    const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2) {
+    size_t minlength =
+        b1->arraysize < b2->arraysize ? b1->arraysize : b2->arraysize;
+    size_t k = 0;
+    size_t answer = 0;
+    for (; k < minlength; ++k) {
+        answer += roaring_hamming(b1->array[k] ^ b2->array[k]);
+    }
+    if (b2->arraysize > b1->arraysize) {
+        for (; k < b2->arraysize; ++k) {
+            answer += roaring_hamming(b2->array[k]);
+        }
+    } else {
+        for (; k < b1->arraysize; ++k) {
+            answer += roaring_hamming(b1->array[k]);
+        }
+    }
+    return answer;
+}
+
+bool bitset_trim(bitset_t *bitset) {
+    size_t newsize = bitset->arraysize;
+    while (newsize > 0) {
+        if (bitset->array[newsize - 1] == 0)
+            newsize -= 1;
+        else
+            break;
+    }
+    if (bitset->capacity == newsize) return true;  // nothing to do
+    uint64_t *newarray;
+    if ((newarray = (uint64_t *)roaring_realloc(
+             bitset->array, sizeof(uint64_t) * newsize)) == NULL) {
+        return false;
+    }
+    bitset->array = newarray;
+    bitset->capacity = newsize;
+    bitset->arraysize = newsize;
+    return true;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/bitset.c */
+/* begin file src/bitset_util.c */
+#include <assert.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+#if CROARING_IS_X64
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#error "CROARING_COMPILER_SUPPORTS_AVX512 needs to be defined."
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wuninitialized"
+#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
+#endif
+#ifdef __cplusplus
+using namespace ::roaring::internal;
+extern "C" {
+namespace roaring {
+namespace api {
+#endif
+
+#if CROARING_IS_X64
+static uint8_t lengthTable[256] = {
+    0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 4,
+    2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
+    2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4,
+    2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+    2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6,
+    4, 5, 5, 6, 5, 6, 6, 7, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
+    2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5,
+    3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
+    2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6,
+    4, 5, 5, 6, 5, 6, 6, 7, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
+    4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8};
+#endif
+
+#if CROARING_IS_X64
+ALIGNED(32)
+static uint32_t vecDecodeTable[256][8] = {
+    {0, 0, 0, 0, 0, 0, 0, 0}, /* 0x00 (00000000) */
+    {1, 0, 0, 0, 0, 0, 0, 0}, /* 0x01 (00000001) */
+    {2, 0, 0, 0, 0, 0, 0, 0}, /* 0x02 (00000010) */
+    {1, 2, 0, 0, 0, 0, 0, 0}, /* 0x03 (00000011) */
+    {3, 0, 0, 0, 0, 0, 0, 0}, /* 0x04 (00000100) */
+    {1, 3, 0, 0, 0, 0, 0, 0}, /* 0x05 (00000101) */
+    {2, 3, 0, 0, 0, 0, 0, 0}, /* 0x06 (00000110) */
+    {1, 2, 3, 0, 0, 0, 0, 0}, /* 0x07 (00000111) */
+    {4, 0, 0, 0, 0, 0, 0, 0}, /* 0x08 (00001000) */
+    {1, 4, 0, 0, 0, 0, 0, 0}, /* 0x09 (00001001) */
+    {2, 4, 0, 0, 0, 0, 0, 0}, /* 0x0A (00001010) */
+    {1, 2, 4, 0, 0, 0, 0, 0}, /* 0x0B (00001011) */
+    {3, 4, 0, 0, 0, 0, 0, 0}, /* 0x0C (00001100) */
+    {1, 3, 4, 0, 0, 0, 0, 0}, /* 0x0D (00001101) */
+    {2, 3, 4, 0, 0, 0, 0, 0}, /* 0x0E (00001110) */
+    {1, 2, 3, 4, 0, 0, 0, 0}, /* 0x0F (00001111) */
+    {5, 0, 0, 0, 0, 0, 0, 0}, /* 0x10 (00010000) */
+    {1, 5, 0, 0, 0, 0, 0, 0}, /* 0x11 (00010001) */
+    {2, 5, 0, 0, 0, 0, 0, 0}, /* 0x12 (00010010) */
+    {1, 2, 5, 0, 0, 0, 0, 0}, /* 0x13 (00010011) */
+    {3, 5, 0, 0, 0, 0, 0, 0}, /* 0x14 (00010100) */
+    {1, 3, 5, 0, 0, 0, 0, 0}, /* 0x15 (00010101) */
+    {2, 3, 5, 0, 0, 0, 0, 0}, /* 0x16 (00010110) */
+    {1, 2, 3, 5, 0, 0, 0, 0}, /* 0x17 (00010111) */
+    {4, 5, 0, 0, 0, 0, 0, 0}, /* 0x18 (00011000) */
+    {1, 4, 5, 0, 0, 0, 0, 0}, /* 0x19 (00011001) */
+    {2, 4, 5, 0, 0, 0, 0, 0}, /* 0x1A (00011010) */
+    {1, 2, 4, 5, 0, 0, 0, 0}, /* 0x1B (00011011) */
+    {3, 4, 5, 0, 0, 0, 0, 0}, /* 0x1C (00011100) */
+    {1, 3, 4, 5, 0, 0, 0, 0}, /* 0x1D (00011101) */
+    {2, 3, 4, 5, 0, 0, 0, 0}, /* 0x1E (00011110) */
+    {1, 2, 3, 4, 5, 0, 0, 0}, /* 0x1F (00011111) */
+    {6, 0, 0, 0, 0, 0, 0, 0}, /* 0x20 (00100000) */
+    {1, 6, 0, 0, 0, 0, 0, 0}, /* 0x21 (00100001) */
+    {2, 6, 0, 0, 0, 0, 0, 0}, /* 0x22 (00100010) */
+    {1, 2, 6, 0, 0, 0, 0, 0}, /* 0x23 (00100011) */
+    {3, 6, 0, 0, 0, 0, 0, 0}, /* 0x24 (00100100) */
+    {1, 3, 6, 0, 0, 0, 0, 0}, /* 0x25 (00100101) */
+    {2, 3, 6, 0, 0, 0, 0, 0}, /* 0x26 (00100110) */
+    {1, 2, 3, 6, 0, 0, 0, 0}, /* 0x27 (00100111) */
+    {4, 6, 0, 0, 0, 0, 0, 0}, /* 0x28 (00101000) */
+    {1, 4, 6, 0, 0, 0, 0, 0}, /* 0x29 (00101001) */
+    {2, 4, 6, 0, 0, 0, 0, 0}, /* 0x2A (00101010) */
+    {1, 2, 4, 6, 0, 0, 0, 0}, /* 0x2B (00101011) */
+    {3, 4, 6, 0, 0, 0, 0, 0}, /* 0x2C (00101100) */
+    {1, 3, 4, 6, 0, 0, 0, 0}, /* 0x2D (00101101) */
+    {2, 3, 4, 6, 0, 0, 0, 0}, /* 0x2E (00101110) */
+    {1, 2, 3, 4, 6, 0, 0, 0}, /* 0x2F (00101111) */
+    {5, 6, 0, 0, 0, 0, 0, 0}, /* 0x30 (00110000) */
+    {1, 5, 6, 0, 0, 0, 0, 0}, /* 0x31 (00110001) */
+    {2, 5, 6, 0, 0, 0, 0, 0}, /* 0x32 (00110010) */
+    {1, 2, 5, 6, 0, 0, 0, 0}, /* 0x33 (00110011) */
+    {3, 5, 6, 0, 0, 0, 0, 0}, /* 0x34 (00110100) */
+    {1, 3, 5, 6, 0, 0, 0, 0}, /* 0x35 (00110101) */
+    {2, 3, 5, 6, 0, 0, 0, 0}, /* 0x36 (00110110) */
+    {1, 2, 3, 5, 6, 0, 0, 0}, /* 0x37 (00110111) */
+    {4, 5, 6, 0, 0, 0, 0, 0}, /* 0x38 (00111000) */
+    {1, 4, 5, 6, 0, 0, 0, 0}, /* 0x39 (00111001) */
+    {2, 4, 5, 6, 0, 0, 0, 0}, /* 0x3A (00111010) */
+    {1, 2, 4, 5, 6, 0, 0, 0}, /* 0x3B (00111011) */
+    {3, 4, 5, 6, 0, 0, 0, 0}, /* 0x3C (00111100) */
+    {1, 3, 4, 5, 6, 0, 0, 0}, /* 0x3D (00111101) */
+    {2, 3, 4, 5, 6, 0, 0, 0}, /* 0x3E (00111110) */
+    {1, 2, 3, 4, 5, 6, 0, 0}, /* 0x3F (00111111) */
+    {7, 0, 0, 0, 0, 0, 0, 0}, /* 0x40 (01000000) */
+    {1, 7, 0, 0, 0, 0, 0, 0}, /* 0x41 (01000001) */
+    {2, 7, 0, 0, 0, 0, 0, 0}, /* 0x42 (01000010) */
+    {1, 2, 7, 0, 0, 0, 0, 0}, /* 0x43 (01000011) */
+    {3, 7, 0, 0, 0, 0, 0, 0}, /* 0x44 (01000100) */
+    {1, 3, 7, 0, 0, 0, 0, 0}, /* 0x45 (01000101) */
+    {2, 3, 7, 0, 0, 0, 0, 0}, /* 0x46 (01000110) */
+    {1, 2, 3, 7, 0, 0, 0, 0}, /* 0x47 (01000111) */
+    {4, 7, 0, 0, 0, 0, 0, 0}, /* 0x48 (01001000) */
+    {1, 4, 7, 0, 0, 0, 0, 0}, /* 0x49 (01001001) */
+    {2, 4, 7, 0, 0, 0, 0, 0}, /* 0x4A (01001010) */
+    {1, 2, 4, 7, 0, 0, 0, 0}, /* 0x4B (01001011) */
+    {3, 4, 7, 0, 0, 0, 0, 0}, /* 0x4C (01001100) */
+    {1, 3, 4, 7, 0, 0, 0, 0}, /* 0x4D (01001101) */
+    {2, 3, 4, 7, 0, 0, 0, 0}, /* 0x4E (01001110) */
+    {1, 2, 3, 4, 7, 0, 0, 0}, /* 0x4F (01001111) */
+    {5, 7, 0, 0, 0, 0, 0, 0}, /* 0x50 (01010000) */
+    {1, 5, 7, 0, 0, 0, 0, 0}, /* 0x51 (01010001) */
+    {2, 5, 7, 0, 0, 0, 0, 0}, /* 0x52 (01010010) */
+    {1, 2, 5, 7, 0, 0, 0, 0}, /* 0x53 (01010011) */
+    {3, 5, 7, 0, 0, 0, 0, 0}, /* 0x54 (01010100) */
+    {1, 3, 5, 7, 0, 0, 0, 0}, /* 0x55 (01010101) */
+    {2, 3, 5, 7, 0, 0, 0, 0}, /* 0x56 (01010110) */
+    {1, 2, 3, 5, 7, 0, 0, 0}, /* 0x57 (01010111) */
+    {4, 5, 7, 0, 0, 0, 0, 0}, /* 0x58 (01011000) */
+    {1, 4, 5, 7, 0, 0, 0, 0}, /* 0x59 (01011001) */
+    {2, 4, 5, 7, 0, 0, 0, 0}, /* 0x5A (01011010) */
+    {1, 2, 4, 5, 7, 0, 0, 0}, /* 0x5B (01011011) */
+    {3, 4, 5, 7, 0, 0, 0, 0}, /* 0x5C (01011100) */
+    {1, 3, 4, 5, 7, 0, 0, 0}, /* 0x5D (01011101) */
+    {2, 3, 4, 5, 7, 0, 0, 0}, /* 0x5E (01011110) */
+    {1, 2, 3, 4, 5, 7, 0, 0}, /* 0x5F (01011111) */
+    {6, 7, 0, 0, 0, 0, 0, 0}, /* 0x60 (01100000) */
+    {1, 6, 7, 0, 0, 0, 0, 0}, /* 0x61 (01100001) */
+    {2, 6, 7, 0, 0, 0, 0, 0}, /* 0x62 (01100010) */
+    {1, 2, 6, 7, 0, 0, 0, 0}, /* 0x63 (01100011) */
+    {3, 6, 7, 0, 0, 0, 0, 0}, /* 0x64 (01100100) */
+    {1, 3, 6, 7, 0, 0, 0, 0}, /* 0x65 (01100101) */
+    {2, 3, 6, 7, 0, 0, 0, 0}, /* 0x66 (01100110) */
+    {1, 2, 3, 6, 7, 0, 0, 0}, /* 0x67 (01100111) */
+    {4, 6, 7, 0, 0, 0, 0, 0}, /* 0x68 (01101000) */
+    {1, 4, 6, 7, 0, 0, 0, 0}, /* 0x69 (01101001) */
+    {2, 4, 6, 7, 0, 0, 0, 0}, /* 0x6A (01101010) */
+    {1, 2, 4, 6, 7, 0, 0, 0}, /* 0x6B (01101011) */
+    {3, 4, 6, 7, 0, 0, 0, 0}, /* 0x6C (01101100) */
+    {1, 3, 4, 6, 7, 0, 0, 0}, /* 0x6D (01101101) */
+    {2, 3, 4, 6, 7, 0, 0, 0}, /* 0x6E (01101110) */
+    {1, 2, 3, 4, 6, 7, 0, 0}, /* 0x6F (01101111) */
+    {5, 6, 7, 0, 0, 0, 0, 0}, /* 0x70 (01110000) */
+    {1, 5, 6, 7, 0, 0, 0, 0}, /* 0x71 (01110001) */
+    {2, 5, 6, 7, 0, 0, 0, 0}, /* 0x72 (01110010) */
+    {1, 2, 5, 6, 7, 0, 0, 0}, /* 0x73 (01110011) */
+    {3, 5, 6, 7, 0, 0, 0, 0}, /* 0x74 (01110100) */
+    {1, 3, 5, 6, 7, 0, 0, 0}, /* 0x75 (01110101) */
+    {2, 3, 5, 6, 7, 0, 0, 0}, /* 0x76 (01110110) */
+    {1, 2, 3, 5, 6, 7, 0, 0}, /* 0x77 (01110111) */
+    {4, 5, 6, 7, 0, 0, 0, 0}, /* 0x78 (01111000) */
+    {1, 4, 5, 6, 7, 0, 0, 0}, /* 0x79 (01111001) */
+    {2, 4, 5, 6, 7, 0, 0, 0}, /* 0x7A (01111010) */
+    {1, 2, 4, 5, 6, 7, 0, 0}, /* 0x7B (01111011) */
+    {3, 4, 5, 6, 7, 0, 0, 0}, /* 0x7C (01111100) */
+    {1, 3, 4, 5, 6, 7, 0, 0}, /* 0x7D (01111101) */
+    {2, 3, 4, 5, 6, 7, 0, 0}, /* 0x7E (01111110) */
+    {1, 2, 3, 4, 5, 6, 7, 0}, /* 0x7F (01111111) */
+    {8, 0, 0, 0, 0, 0, 0, 0}, /* 0x80 (10000000) */
+    {1, 8, 0, 0, 0, 0, 0, 0}, /* 0x81 (10000001) */
+    {2, 8, 0, 0, 0, 0, 0, 0}, /* 0x82 (10000010) */
+    {1, 2, 8, 0, 0, 0, 0, 0}, /* 0x83 (10000011) */
+    {3, 8, 0, 0, 0, 0, 0, 0}, /* 0x84 (10000100) */
+    {1, 3, 8, 0, 0, 0, 0, 0}, /* 0x85 (10000101) */
+    {2, 3, 8, 0, 0, 0, 0, 0}, /* 0x86 (10000110) */
+    {1, 2, 3, 8, 0, 0, 0, 0}, /* 0x87 (10000111) */
+    {4, 8, 0, 0, 0, 0, 0, 0}, /* 0x88 (10001000) */
+    {1, 4, 8, 0, 0, 0, 0, 0}, /* 0x89 (10001001) */
+    {2, 4, 8, 0, 0, 0, 0, 0}, /* 0x8A (10001010) */
+    {1, 2, 4, 8, 0, 0, 0, 0}, /* 0x8B (10001011) */
+    {3, 4, 8, 0, 0, 0, 0, 0}, /* 0x8C (10001100) */
+    {1, 3, 4, 8, 0, 0, 0, 0}, /* 0x8D (10001101) */
+    {2, 3, 4, 8, 0, 0, 0, 0}, /* 0x8E (10001110) */
+    {1, 2, 3, 4, 8, 0, 0, 0}, /* 0x8F (10001111) */
+    {5, 8, 0, 0, 0, 0, 0, 0}, /* 0x90 (10010000) */
+    {1, 5, 8, 0, 0, 0, 0, 0}, /* 0x91 (10010001) */
+    {2, 5, 8, 0, 0, 0, 0, 0}, /* 0x92 (10010010) */
+    {1, 2, 5, 8, 0, 0, 0, 0}, /* 0x93 (10010011) */
+    {3, 5, 8, 0, 0, 0, 0, 0}, /* 0x94 (10010100) */
+    {1, 3, 5, 8, 0, 0, 0, 0}, /* 0x95 (10010101) */
+    {2, 3, 5, 8, 0, 0, 0, 0}, /* 0x96 (10010110) */
+    {1, 2, 3, 5, 8, 0, 0, 0}, /* 0x97 (10010111) */
+    {4, 5, 8, 0, 0, 0, 0, 0}, /* 0x98 (10011000) */
+    {1, 4, 5, 8, 0, 0, 0, 0}, /* 0x99 (10011001) */
+    {2, 4, 5, 8, 0, 0, 0, 0}, /* 0x9A (10011010) */
+    {1, 2, 4, 5, 8, 0, 0, 0}, /* 0x9B (10011011) */
+    {3, 4, 5, 8, 0, 0, 0, 0}, /* 0x9C (10011100) */
+    {1, 3, 4, 5, 8, 0, 0, 0}, /* 0x9D (10011101) */
+    {2, 3, 4, 5, 8, 0, 0, 0}, /* 0x9E (10011110) */
+    {1, 2, 3, 4, 5, 8, 0, 0}, /* 0x9F (10011111) */
+    {6, 8, 0, 0, 0, 0, 0, 0}, /* 0xA0 (10100000) */
+    {1, 6, 8, 0, 0, 0, 0, 0}, /* 0xA1 (10100001) */
+    {2, 6, 8, 0, 0, 0, 0, 0}, /* 0xA2 (10100010) */
+    {1, 2, 6, 8, 0, 0, 0, 0}, /* 0xA3 (10100011) */
+    {3, 6, 8, 0, 0, 0, 0, 0}, /* 0xA4 (10100100) */
+    {1, 3, 6, 8, 0, 0, 0, 0}, /* 0xA5 (10100101) */
+    {2, 3, 6, 8, 0, 0, 0, 0}, /* 0xA6 (10100110) */
+    {1, 2, 3, 6, 8, 0, 0, 0}, /* 0xA7 (10100111) */
+    {4, 6, 8, 0, 0, 0, 0, 0}, /* 0xA8 (10101000) */
+    {1, 4, 6, 8, 0, 0, 0, 0}, /* 0xA9 (10101001) */
+    {2, 4, 6, 8, 0, 0, 0, 0}, /* 0xAA (10101010) */
+    {1, 2, 4, 6, 8, 0, 0, 0}, /* 0xAB (10101011) */
+    {3, 4, 6, 8, 0, 0, 0, 0}, /* 0xAC (10101100) */
+    {1, 3, 4, 6, 8, 0, 0, 0}, /* 0xAD (10101101) */
+    {2, 3, 4, 6, 8, 0, 0, 0}, /* 0xAE (10101110) */
+    {1, 2, 3, 4, 6, 8, 0, 0}, /* 0xAF (10101111) */
+    {5, 6, 8, 0, 0, 0, 0, 0}, /* 0xB0 (10110000) */
+    {1, 5, 6, 8, 0, 0, 0, 0}, /* 0xB1 (10110001) */
+    {2, 5, 6, 8, 0, 0, 0, 0}, /* 0xB2 (10110010) */
+    {1, 2, 5, 6, 8, 0, 0, 0}, /* 0xB3 (10110011) */
+    {3, 5, 6, 8, 0, 0, 0, 0}, /* 0xB4 (10110100) */
+    {1, 3, 5, 6, 8, 0, 0, 0}, /* 0xB5 (10110101) */
+    {2, 3, 5, 6, 8, 0, 0, 0}, /* 0xB6 (10110110) */
+    {1, 2, 3, 5, 6, 8, 0, 0}, /* 0xB7 (10110111) */
+    {4, 5, 6, 8, 0, 0, 0, 0}, /* 0xB8 (10111000) */
+    {1, 4, 5, 6, 8, 0, 0, 0}, /* 0xB9 (10111001) */
+    {2, 4, 5, 6, 8, 0, 0, 0}, /* 0xBA (10111010) */
+    {1, 2, 4, 5, 6, 8, 0, 0}, /* 0xBB (10111011) */
+    {3, 4, 5, 6, 8, 0, 0, 0}, /* 0xBC (10111100) */
+    {1, 3, 4, 5, 6, 8, 0, 0}, /* 0xBD (10111101) */
+    {2, 3, 4, 5, 6, 8, 0, 0}, /* 0xBE (10111110) */
+    {1, 2, 3, 4, 5, 6, 8, 0}, /* 0xBF (10111111) */
+    {7, 8, 0, 0, 0, 0, 0, 0}, /* 0xC0 (11000000) */
+    {1, 7, 8, 0, 0, 0, 0, 0}, /* 0xC1 (11000001) */
+    {2, 7, 8, 0, 0, 0, 0, 0}, /* 0xC2 (11000010) */
+    {1, 2, 7, 8, 0, 0, 0, 0}, /* 0xC3 (11000011) */
+    {3, 7, 8, 0, 0, 0, 0, 0}, /* 0xC4 (11000100) */
+    {1, 3, 7, 8, 0, 0, 0, 0}, /* 0xC5 (11000101) */
+    {2, 3, 7, 8, 0, 0, 0, 0}, /* 0xC6 (11000110) */
+    {1, 2, 3, 7, 8, 0, 0, 0}, /* 0xC7 (11000111) */
+    {4, 7, 8, 0, 0, 0, 0, 0}, /* 0xC8 (11001000) */
+    {1, 4, 7, 8, 0, 0, 0, 0}, /* 0xC9 (11001001) */
+    {2, 4, 7, 8, 0, 0, 0, 0}, /* 0xCA (11001010) */
+    {1, 2, 4, 7, 8, 0, 0, 0}, /* 0xCB (11001011) */
+    {3, 4, 7, 8, 0, 0, 0, 0}, /* 0xCC (11001100) */
+    {1, 3, 4, 7, 8, 0, 0, 0}, /* 0xCD (11001101) */
+    {2, 3, 4, 7, 8, 0, 0, 0}, /* 0xCE (11001110) */
+    {1, 2, 3, 4, 7, 8, 0, 0}, /* 0xCF (11001111) */
+    {5, 7, 8, 0, 0, 0, 0, 0}, /* 0xD0 (11010000) */
+    {1, 5, 7, 8, 0, 0, 0, 0}, /* 0xD1 (11010001) */
+    {2, 5, 7, 8, 0, 0, 0, 0}, /* 0xD2 (11010010) */
+    {1, 2, 5, 7, 8, 0, 0, 0}, /* 0xD3 (11010011) */
+    {3, 5, 7, 8, 0, 0, 0, 0}, /* 0xD4 (11010100) */
+    {1, 3, 5, 7, 8, 0, 0, 0}, /* 0xD5 (11010101) */
+    {2, 3, 5, 7, 8, 0, 0, 0}, /* 0xD6 (11010110) */
+    {1, 2, 3, 5, 7, 8, 0, 0}, /* 0xD7 (11010111) */
+    {4, 5, 7, 8, 0, 0, 0, 0}, /* 0xD8 (11011000) */
+    {1, 4, 5, 7, 8, 0, 0, 0}, /* 0xD9 (11011001) */
+    {2, 4, 5, 7, 8, 0, 0, 0}, /* 0xDA (11011010) */
+    {1, 2, 4, 5, 7, 8, 0, 0}, /* 0xDB (11011011) */
+    {3, 4, 5, 7, 8, 0, 0, 0}, /* 0xDC (11011100) */
+    {1, 3, 4, 5, 7, 8, 0, 0}, /* 0xDD (11011101) */
+    {2, 3, 4, 5, 7, 8, 0, 0}, /* 0xDE (11011110) */
+    {1, 2, 3, 4, 5, 7, 8, 0}, /* 0xDF (11011111) */
+    {6, 7, 8, 0, 0, 0, 0, 0}, /* 0xE0 (11100000) */
+    {1, 6, 7, 8, 0, 0, 0, 0}, /* 0xE1 (11100001) */
+    {2, 6, 7, 8, 0, 0, 0, 0}, /* 0xE2 (11100010) */
+    {1, 2, 6, 7, 8, 0, 0, 0}, /* 0xE3 (11100011) */
+    {3, 6, 7, 8, 0, 0, 0, 0}, /* 0xE4 (11100100) */
+    {1, 3, 6, 7, 8, 0, 0, 0}, /* 0xE5 (11100101) */
+    {2, 3, 6, 7, 8, 0, 0, 0}, /* 0xE6 (11100110) */
+    {1, 2, 3, 6, 7, 8, 0, 0}, /* 0xE7 (11100111) */
+    {4, 6, 7, 8, 0, 0, 0, 0}, /* 0xE8 (11101000) */
+    {1, 4, 6, 7, 8, 0, 0, 0}, /* 0xE9 (11101001) */
+    {2, 4, 6, 7, 8, 0, 0, 0}, /* 0xEA (11101010) */
+    {1, 2, 4, 6, 7, 8, 0, 0}, /* 0xEB (11101011) */
+    {3, 4, 6, 7, 8, 0, 0, 0}, /* 0xEC (11101100) */
+    {1, 3, 4, 6, 7, 8, 0, 0}, /* 0xED (11101101) */
+    {2, 3, 4, 6, 7, 8, 0, 0}, /* 0xEE (11101110) */
+    {1, 2, 3, 4, 6, 7, 8, 0}, /* 0xEF (11101111) */
+    {5, 6, 7, 8, 0, 0, 0, 0}, /* 0xF0 (11110000) */
+    {1, 5, 6, 7, 8, 0, 0, 0}, /* 0xF1 (11110001) */
+    {2, 5, 6, 7, 8, 0, 0, 0}, /* 0xF2 (11110010) */
+    {1, 2, 5, 6, 7, 8, 0, 0}, /* 0xF3 (11110011) */
+    {3, 5, 6, 7, 8, 0, 0, 0}, /* 0xF4 (11110100) */
+    {1, 3, 5, 6, 7, 8, 0, 0}, /* 0xF5 (11110101) */
+    {2, 3, 5, 6, 7, 8, 0, 0}, /* 0xF6 (11110110) */
+    {1, 2, 3, 5, 6, 7, 8, 0}, /* 0xF7 (11110111) */
+    {4, 5, 6, 7, 8, 0, 0, 0}, /* 0xF8 (11111000) */
+    {1, 4, 5, 6, 7, 8, 0, 0}, /* 0xF9 (11111001) */
+    {2, 4, 5, 6, 7, 8, 0, 0}, /* 0xFA (11111010) */
+    {1, 2, 4, 5, 6, 7, 8, 0}, /* 0xFB (11111011) */
+    {3, 4, 5, 6, 7, 8, 0, 0}, /* 0xFC (11111100) */
+    {1, 3, 4, 5, 6, 7, 8, 0}, /* 0xFD (11111101) */
+    {2, 3, 4, 5, 6, 7, 8, 0}, /* 0xFE (11111110) */
+    {1, 2, 3, 4, 5, 6, 7, 8}  /* 0xFF (11111111) */
+};
+
+#endif  // #if CROARING_IS_X64
+
+#if CROARING_IS_X64
+// same as vecDecodeTable but in 16 bits
+ALIGNED(32)
+static uint16_t vecDecodeTable_uint16[256][8] = {
+    {0, 0, 0, 0, 0, 0, 0, 0}, /* 0x00 (00000000) */
+    {1, 0, 0, 0, 0, 0, 0, 0}, /* 0x01 (00000001) */
+    {2, 0, 0, 0, 0, 0, 0, 0}, /* 0x02 (00000010) */
+    {1, 2, 0, 0, 0, 0, 0, 0}, /* 0x03 (00000011) */
+    {3, 0, 0, 0, 0, 0, 0, 0}, /* 0x04 (00000100) */
+    {1, 3, 0, 0, 0, 0, 0, 0}, /* 0x05 (00000101) */
+    {2, 3, 0, 0, 0, 0, 0, 0}, /* 0x06 (00000110) */
+    {1, 2, 3, 0, 0, 0, 0, 0}, /* 0x07 (00000111) */
+    {4, 0, 0, 0, 0, 0, 0, 0}, /* 0x08 (00001000) */
+    {1, 4, 0, 0, 0, 0, 0, 0}, /* 0x09 (00001001) */
+    {2, 4, 0, 0, 0, 0, 0, 0}, /* 0x0A (00001010) */
+    {1, 2, 4, 0, 0, 0, 0, 0}, /* 0x0B (00001011) */
+    {3, 4, 0, 0, 0, 0, 0, 0}, /* 0x0C (00001100) */
+    {1, 3, 4, 0, 0, 0, 0, 0}, /* 0x0D (00001101) */
+    {2, 3, 4, 0, 0, 0, 0, 0}, /* 0x0E (00001110) */
+    {1, 2, 3, 4, 0, 0, 0, 0}, /* 0x0F (00001111) */
+    {5, 0, 0, 0, 0, 0, 0, 0}, /* 0x10 (00010000) */
+    {1, 5, 0, 0, 0, 0, 0, 0}, /* 0x11 (00010001) */
+    {2, 5, 0, 0, 0, 0, 0, 0}, /* 0x12 (00010010) */
+    {1, 2, 5, 0, 0, 0, 0, 0}, /* 0x13 (00010011) */
+    {3, 5, 0, 0, 0, 0, 0, 0}, /* 0x14 (00010100) */
+    {1, 3, 5, 0, 0, 0, 0, 0}, /* 0x15 (00010101) */
+    {2, 3, 5, 0, 0, 0, 0, 0}, /* 0x16 (00010110) */
+    {1, 2, 3, 5, 0, 0, 0, 0}, /* 0x17 (00010111) */
+    {4, 5, 0, 0, 0, 0, 0, 0}, /* 0x18 (00011000) */
+    {1, 4, 5, 0, 0, 0, 0, 0}, /* 0x19 (00011001) */
+    {2, 4, 5, 0, 0, 0, 0, 0}, /* 0x1A (00011010) */
+    {1, 2, 4, 5, 0, 0, 0, 0}, /* 0x1B (00011011) */
+    {3, 4, 5, 0, 0, 0, 0, 0}, /* 0x1C (00011100) */
+    {1, 3, 4, 5, 0, 0, 0, 0}, /* 0x1D (00011101) */
+    {2, 3, 4, 5, 0, 0, 0, 0}, /* 0x1E (00011110) */
+    {1, 2, 3, 4, 5, 0, 0, 0}, /* 0x1F (00011111) */
+    {6, 0, 0, 0, 0, 0, 0, 0}, /* 0x20 (00100000) */
+    {1, 6, 0, 0, 0, 0, 0, 0}, /* 0x21 (00100001) */
+    {2, 6, 0, 0, 0, 0, 0, 0}, /* 0x22 (00100010) */
+    {1, 2, 6, 0, 0, 0, 0, 0}, /* 0x23 (00100011) */
+    {3, 6, 0, 0, 0, 0, 0, 0}, /* 0x24 (00100100) */
+    {1, 3, 6, 0, 0, 0, 0, 0}, /* 0x25 (00100101) */
+    {2, 3, 6, 0, 0, 0, 0, 0}, /* 0x26 (00100110) */
+    {1, 2, 3, 6, 0, 0, 0, 0}, /* 0x27 (00100111) */
+    {4, 6, 0, 0, 0, 0, 0, 0}, /* 0x28 (00101000) */
+    {1, 4, 6, 0, 0, 0, 0, 0}, /* 0x29 (00101001) */
+    {2, 4, 6, 0, 0, 0, 0, 0}, /* 0x2A (00101010) */
+    {1, 2, 4, 6, 0, 0, 0, 0}, /* 0x2B (00101011) */
+    {3, 4, 6, 0, 0, 0, 0, 0}, /* 0x2C (00101100) */
+    {1, 3, 4, 6, 0, 0, 0, 0}, /* 0x2D (00101101) */
+    {2, 3, 4, 6, 0, 0, 0, 0}, /* 0x2E (00101110) */
+    {1, 2, 3, 4, 6, 0, 0, 0}, /* 0x2F (00101111) */
+    {5, 6, 0, 0, 0, 0, 0, 0}, /* 0x30 (00110000) */
+    {1, 5, 6, 0, 0, 0, 0, 0}, /* 0x31 (00110001) */
+    {2, 5, 6, 0, 0, 0, 0, 0}, /* 0x32 (00110010) */
+    {1, 2, 5, 6, 0, 0, 0, 0}, /* 0x33 (00110011) */
+    {3, 5, 6, 0, 0, 0, 0, 0}, /* 0x34 (00110100) */
+    {1, 3, 5, 6, 0, 0, 0, 0}, /* 0x35 (00110101) */
+    {2, 3, 5, 6, 0, 0, 0, 0}, /* 0x36 (00110110) */
+    {1, 2, 3, 5, 6, 0, 0, 0}, /* 0x37 (00110111) */
+    {4, 5, 6, 0, 0, 0, 0, 0}, /* 0x38 (00111000) */
+    {1, 4, 5, 6, 0, 0, 0, 0}, /* 0x39 (00111001) */
+    {2, 4, 5, 6, 0, 0, 0, 0}, /* 0x3A (00111010) */
+    {1, 2, 4, 5, 6, 0, 0, 0}, /* 0x3B (00111011) */
+    {3, 4, 5, 6, 0, 0, 0, 0}, /* 0x3C (00111100) */
+    {1, 3, 4, 5, 6, 0, 0, 0}, /* 0x3D (00111101) */
+    {2, 3, 4, 5, 6, 0, 0, 0}, /* 0x3E (00111110) */
+    {1, 2, 3, 4, 5, 6, 0, 0}, /* 0x3F (00111111) */
+    {7, 0, 0, 0, 0, 0, 0, 0}, /* 0x40 (01000000) */
+    {1, 7, 0, 0, 0, 0, 0, 0}, /* 0x41 (01000001) */
+    {2, 7, 0, 0, 0, 0, 0, 0}, /* 0x42 (01000010) */
+    {1, 2, 7, 0, 0, 0, 0, 0}, /* 0x43 (01000011) */
+    {3, 7, 0, 0, 0, 0, 0, 0}, /* 0x44 (01000100) */
+    {1, 3, 7, 0, 0, 0, 0, 0}, /* 0x45 (01000101) */
+    {2, 3, 7, 0, 0, 0, 0, 0}, /* 0x46 (01000110) */
+    {1, 2, 3, 7, 0, 0, 0, 0}, /* 0x47 (01000111) */
+    {4, 7, 0, 0, 0, 0, 0, 0}, /* 0x48 (01001000) */
+    {1, 4, 7, 0, 0, 0, 0, 0}, /* 0x49 (01001001) */
+    {2, 4, 7, 0, 0, 0, 0, 0}, /* 0x4A (01001010) */
+    {1, 2, 4, 7, 0, 0, 0, 0}, /* 0x4B (01001011) */
+    {3, 4, 7, 0, 0, 0, 0, 0}, /* 0x4C (01001100) */
+    {1, 3, 4, 7, 0, 0, 0, 0}, /* 0x4D (01001101) */
+    {2, 3, 4, 7, 0, 0, 0, 0}, /* 0x4E (01001110) */
+    {1, 2, 3, 4, 7, 0, 0, 0}, /* 0x4F (01001111) */
+    {5, 7, 0, 0, 0, 0, 0, 0}, /* 0x50 (01010000) */
+    {1, 5, 7, 0, 0, 0, 0, 0}, /* 0x51 (01010001) */
+    {2, 5, 7, 0, 0, 0, 0, 0}, /* 0x52 (01010010) */
+    {1, 2, 5, 7, 0, 0, 0, 0}, /* 0x53 (01010011) */
+    {3, 5, 7, 0, 0, 0, 0, 0}, /* 0x54 (01010100) */
+    {1, 3, 5, 7, 0, 0, 0, 0}, /* 0x55 (01010101) */
+    {2, 3, 5, 7, 0, 0, 0, 0}, /* 0x56 (01010110) */
+    {1, 2, 3, 5, 7, 0, 0, 0}, /* 0x57 (01010111) */
+    {4, 5, 7, 0, 0, 0, 0, 0}, /* 0x58 (01011000) */
+    {1, 4, 5, 7, 0, 0, 0, 0}, /* 0x59 (01011001) */
+    {2, 4, 5, 7, 0, 0, 0, 0}, /* 0x5A (01011010) */
+    {1, 2, 4, 5, 7, 0, 0, 0}, /* 0x5B (01011011) */
+    {3, 4, 5, 7, 0, 0, 0, 0}, /* 0x5C (01011100) */
+    {1, 3, 4, 5, 7, 0, 0, 0}, /* 0x5D (01011101) */
+    {2, 3, 4, 5, 7, 0, 0, 0}, /* 0x5E (01011110) */
+    {1, 2, 3, 4, 5, 7, 0, 0}, /* 0x5F (01011111) */
+    {6, 7, 0, 0, 0, 0, 0, 0}, /* 0x60 (01100000) */
+    {1, 6, 7, 0, 0, 0, 0, 0}, /* 0x61 (01100001) */
+    {2, 6, 7, 0, 0, 0, 0, 0}, /* 0x62 (01100010) */
+    {1, 2, 6, 7, 0, 0, 0, 0}, /* 0x63 (01100011) */
+    {3, 6, 7, 0, 0, 0, 0, 0}, /* 0x64 (01100100) */
+    {1, 3, 6, 7, 0, 0, 0, 0}, /* 0x65 (01100101) */
+    {2, 3, 6, 7, 0, 0, 0, 0}, /* 0x66 (01100110) */
+    {1, 2, 3, 6, 7, 0, 0, 0}, /* 0x67 (01100111) */
+    {4, 6, 7, 0, 0, 0, 0, 0}, /* 0x68 (01101000) */
+    {1, 4, 6, 7, 0, 0, 0, 0}, /* 0x69 (01101001) */
+    {2, 4, 6, 7, 0, 0, 0, 0}, /* 0x6A (01101010) */
+    {1, 2, 4, 6, 7, 0, 0, 0}, /* 0x6B (01101011) */
+    {3, 4, 6, 7, 0, 0, 0, 0}, /* 0x6C (01101100) */
+    {1, 3, 4, 6, 7, 0, 0, 0}, /* 0x6D (01101101) */
+    {2, 3, 4, 6, 7, 0, 0, 0}, /* 0x6E (01101110) */
+    {1, 2, 3, 4, 6, 7, 0, 0}, /* 0x6F (01101111) */
+    {5, 6, 7, 0, 0, 0, 0, 0}, /* 0x70 (01110000) */
+    {1, 5, 6, 7, 0, 0, 0, 0}, /* 0x71 (01110001) */
+    {2, 5, 6, 7, 0, 0, 0, 0}, /* 0x72 (01110010) */
+    {1, 2, 5, 6, 7, 0, 0, 0}, /* 0x73 (01110011) */
+    {3, 5, 6, 7, 0, 0, 0, 0}, /* 0x74 (01110100) */
+    {1, 3, 5, 6, 7, 0, 0, 0}, /* 0x75 (01110101) */
+    {2, 3, 5, 6, 7, 0, 0, 0}, /* 0x76 (01110110) */
+    {1, 2, 3, 5, 6, 7, 0, 0}, /* 0x77 (01110111) */
+    {4, 5, 6, 7, 0, 0, 0, 0}, /* 0x78 (01111000) */
+    {1, 4, 5, 6, 7, 0, 0, 0}, /* 0x79 (01111001) */
+    {2, 4, 5, 6, 7, 0, 0, 0}, /* 0x7A (01111010) */
+    {1, 2, 4, 5, 6, 7, 0, 0}, /* 0x7B (01111011) */
+    {3, 4, 5, 6, 7, 0, 0, 0}, /* 0x7C (01111100) */
+    {1, 3, 4, 5, 6, 7, 0, 0}, /* 0x7D (01111101) */
+    {2, 3, 4, 5, 6, 7, 0, 0}, /* 0x7E (01111110) */
+    {1, 2, 3, 4, 5, 6, 7, 0}, /* 0x7F (01111111) */
+    {8, 0, 0, 0, 0, 0, 0, 0}, /* 0x80 (10000000) */
+    {1, 8, 0, 0, 0, 0, 0, 0}, /* 0x81 (10000001) */
+    {2, 8, 0, 0, 0, 0, 0, 0}, /* 0x82 (10000010) */
+    {1, 2, 8, 0, 0, 0, 0, 0}, /* 0x83 (10000011) */
+    {3, 8, 0, 0, 0, 0, 0, 0}, /* 0x84 (10000100) */
+    {1, 3, 8, 0, 0, 0, 0, 0}, /* 0x85 (10000101) */
+    {2, 3, 8, 0, 0, 0, 0, 0}, /* 0x86 (10000110) */
+    {1, 2, 3, 8, 0, 0, 0, 0}, /* 0x87 (10000111) */
+    {4, 8, 0, 0, 0, 0, 0, 0}, /* 0x88 (10001000) */
+    {1, 4, 8, 0, 0, 0, 0, 0}, /* 0x89 (10001001) */
+    {2, 4, 8, 0, 0, 0, 0, 0}, /* 0x8A (10001010) */
+    {1, 2, 4, 8, 0, 0, 0, 0}, /* 0x8B (10001011) */
+    {3, 4, 8, 0, 0, 0, 0, 0}, /* 0x8C (10001100) */
+    {1, 3, 4, 8, 0, 0, 0, 0}, /* 0x8D (10001101) */
+    {2, 3, 4, 8, 0, 0, 0, 0}, /* 0x8E (10001110) */
+    {1, 2, 3, 4, 8, 0, 0, 0}, /* 0x8F (10001111) */
+    {5, 8, 0, 0, 0, 0, 0, 0}, /* 0x90 (10010000) */
+    {1, 5, 8, 0, 0, 0, 0, 0}, /* 0x91 (10010001) */
+    {2, 5, 8, 0, 0, 0, 0, 0}, /* 0x92 (10010010) */
+    {1, 2, 5, 8, 0, 0, 0, 0}, /* 0x93 (10010011) */
+    {3, 5, 8, 0, 0, 0, 0, 0}, /* 0x94 (10010100) */
+    {1, 3, 5, 8, 0, 0, 0, 0}, /* 0x95 (10010101) */
+    {2, 3, 5, 8, 0, 0, 0, 0}, /* 0x96 (10010110) */
+    {1, 2, 3, 5, 8, 0, 0, 0}, /* 0x97 (10010111) */
+    {4, 5, 8, 0, 0, 0, 0, 0}, /* 0x98 (10011000) */
+    {1, 4, 5, 8, 0, 0, 0, 0}, /* 0x99 (10011001) */
+    {2, 4, 5, 8, 0, 0, 0, 0}, /* 0x9A (10011010) */
+    {1, 2, 4, 5, 8, 0, 0, 0}, /* 0x9B (10011011) */
+    {3, 4, 5, 8, 0, 0, 0, 0}, /* 0x9C (10011100) */
+    {1, 3, 4, 5, 8, 0, 0, 0}, /* 0x9D (10011101) */
+    {2, 3, 4, 5, 8, 0, 0, 0}, /* 0x9E (10011110) */
+    {1, 2, 3, 4, 5, 8, 0, 0}, /* 0x9F (10011111) */
+    {6, 8, 0, 0, 0, 0, 0, 0}, /* 0xA0 (10100000) */
+    {1, 6, 8, 0, 0, 0, 0, 0}, /* 0xA1 (10100001) */
+    {2, 6, 8, 0, 0, 0, 0, 0}, /* 0xA2 (10100010) */
+    {1, 2, 6, 8, 0, 0, 0, 0}, /* 0xA3 (10100011) */
+    {3, 6, 8, 0, 0, 0, 0, 0}, /* 0xA4 (10100100) */
+    {1, 3, 6, 8, 0, 0, 0, 0}, /* 0xA5 (10100101) */
+    {2, 3, 6, 8, 0, 0, 0, 0}, /* 0xA6 (10100110) */
+    {1, 2, 3, 6, 8, 0, 0, 0}, /* 0xA7 (10100111) */
+    {4, 6, 8, 0, 0, 0, 0, 0}, /* 0xA8 (10101000) */
+    {1, 4, 6, 8, 0, 0, 0, 0}, /* 0xA9 (10101001) */
+    {2, 4, 6, 8, 0, 0, 0, 0}, /* 0xAA (10101010) */
+    {1, 2, 4, 6, 8, 0, 0, 0}, /* 0xAB (10101011) */
+    {3, 4, 6, 8, 0, 0, 0, 0}, /* 0xAC (10101100) */
+    {1, 3, 4, 6, 8, 0, 0, 0}, /* 0xAD (10101101) */
+    {2, 3, 4, 6, 8, 0, 0, 0}, /* 0xAE (10101110) */
+    {1, 2, 3, 4, 6, 8, 0, 0}, /* 0xAF (10101111) */
+    {5, 6, 8, 0, 0, 0, 0, 0}, /* 0xB0 (10110000) */
+    {1, 5, 6, 8, 0, 0, 0, 0}, /* 0xB1 (10110001) */
+    {2, 5, 6, 8, 0, 0, 0, 0}, /* 0xB2 (10110010) */
+    {1, 2, 5, 6, 8, 0, 0, 0}, /* 0xB3 (10110011) */
+    {3, 5, 6, 8, 0, 0, 0, 0}, /* 0xB4 (10110100) */
+    {1, 3, 5, 6, 8, 0, 0, 0}, /* 0xB5 (10110101) */
+    {2, 3, 5, 6, 8, 0, 0, 0}, /* 0xB6 (10110110) */
+    {1, 2, 3, 5, 6, 8, 0, 0}, /* 0xB7 (10110111) */
+    {4, 5, 6, 8, 0, 0, 0, 0}, /* 0xB8 (10111000) */
+    {1, 4, 5, 6, 8, 0, 0, 0}, /* 0xB9 (10111001) */
+    {2, 4, 5, 6, 8, 0, 0, 0}, /* 0xBA (10111010) */
+    {1, 2, 4, 5, 6, 8, 0, 0}, /* 0xBB (10111011) */
+    {3, 4, 5, 6, 8, 0, 0, 0}, /* 0xBC (10111100) */
+    {1, 3, 4, 5, 6, 8, 0, 0}, /* 0xBD (10111101) */
+    {2, 3, 4, 5, 6, 8, 0, 0}, /* 0xBE (10111110) */
+    {1, 2, 3, 4, 5, 6, 8, 0}, /* 0xBF (10111111) */
+    {7, 8, 0, 0, 0, 0, 0, 0}, /* 0xC0 (11000000) */
+    {1, 7, 8, 0, 0, 0, 0, 0}, /* 0xC1 (11000001) */
+    {2, 7, 8, 0, 0, 0, 0, 0}, /* 0xC2 (11000010) */
+    {1, 2, 7, 8, 0, 0, 0, 0}, /* 0xC3 (11000011) */
+    {3, 7, 8, 0, 0, 0, 0, 0}, /* 0xC4 (11000100) */
+    {1, 3, 7, 8, 0, 0, 0, 0}, /* 0xC5 (11000101) */
+    {2, 3, 7, 8, 0, 0, 0, 0}, /* 0xC6 (11000110) */
+    {1, 2, 3, 7, 8, 0, 0, 0}, /* 0xC7 (11000111) */
+    {4, 7, 8, 0, 0, 0, 0, 0}, /* 0xC8 (11001000) */
+    {1, 4, 7, 8, 0, 0, 0, 0}, /* 0xC9 (11001001) */
+    {2, 4, 7, 8, 0, 0, 0, 0}, /* 0xCA (11001010) */
+    {1, 2, 4, 7, 8, 0, 0, 0}, /* 0xCB (11001011) */
+    {3, 4, 7, 8, 0, 0, 0, 0}, /* 0xCC (11001100) */
+    {1, 3, 4, 7, 8, 0, 0, 0}, /* 0xCD (11001101) */
+    {2, 3, 4, 7, 8, 0, 0, 0}, /* 0xCE (11001110) */
+    {1, 2, 3, 4, 7, 8, 0, 0}, /* 0xCF (11001111) */
+    {5, 7, 8, 0, 0, 0, 0, 0}, /* 0xD0 (11010000) */
+    {1, 5, 7, 8, 0, 0, 0, 0}, /* 0xD1 (11010001) */
+    {2, 5, 7, 8, 0, 0, 0, 0}, /* 0xD2 (11010010) */
+    {1, 2, 5, 7, 8, 0, 0, 0}, /* 0xD3 (11010011) */
+    {3, 5, 7, 8, 0, 0, 0, 0}, /* 0xD4 (11010100) */
+    {1, 3, 5, 7, 8, 0, 0, 0}, /* 0xD5 (11010101) */
+    {2, 3, 5, 7, 8, 0, 0, 0}, /* 0xD6 (11010110) */
+    {1, 2, 3, 5, 7, 8, 0, 0}, /* 0xD7 (11010111) */
+    {4, 5, 7, 8, 0, 0, 0, 0}, /* 0xD8 (11011000) */
+    {1, 4, 5, 7, 8, 0, 0, 0}, /* 0xD9 (11011001) */
+    {2, 4, 5, 7, 8, 0, 0, 0}, /* 0xDA (11011010) */
+    {1, 2, 4, 5, 7, 8, 0, 0}, /* 0xDB (11011011) */
+    {3, 4, 5, 7, 8, 0, 0, 0}, /* 0xDC (11011100) */
+    {1, 3, 4, 5, 7, 8, 0, 0}, /* 0xDD (11011101) */
+    {2, 3, 4, 5, 7, 8, 0, 0}, /* 0xDE (11011110) */
+    {1, 2, 3, 4, 5, 7, 8, 0}, /* 0xDF (11011111) */
+    {6, 7, 8, 0, 0, 0, 0, 0}, /* 0xE0 (11100000) */
+    {1, 6, 7, 8, 0, 0, 0, 0}, /* 0xE1 (11100001) */
+    {2, 6, 7, 8, 0, 0, 0, 0}, /* 0xE2 (11100010) */
+    {1, 2, 6, 7, 8, 0, 0, 0}, /* 0xE3 (11100011) */
+    {3, 6, 7, 8, 0, 0, 0, 0}, /* 0xE4 (11100100) */
+    {1, 3, 6, 7, 8, 0, 0, 0}, /* 0xE5 (11100101) */
+    {2, 3, 6, 7, 8, 0, 0, 0}, /* 0xE6 (11100110) */
+    {1, 2, 3, 6, 7, 8, 0, 0}, /* 0xE7 (11100111) */
+    {4, 6, 7, 8, 0, 0, 0, 0}, /* 0xE8 (11101000) */
+    {1, 4, 6, 7, 8, 0, 0, 0}, /* 0xE9 (11101001) */
+    {2, 4, 6, 7, 8, 0, 0, 0}, /* 0xEA (11101010) */
+    {1, 2, 4, 6, 7, 8, 0, 0}, /* 0xEB (11101011) */
+    {3, 4, 6, 7, 8, 0, 0, 0}, /* 0xEC (11101100) */
+    {1, 3, 4, 6, 7, 8, 0, 0}, /* 0xED (11101101) */
+    {2, 3, 4, 6, 7, 8, 0, 0}, /* 0xEE (11101110) */
+    {1, 2, 3, 4, 6, 7, 8, 0}, /* 0xEF (11101111) */
+    {5, 6, 7, 8, 0, 0, 0, 0}, /* 0xF0 (11110000) */
+    {1, 5, 6, 7, 8, 0, 0, 0}, /* 0xF1 (11110001) */
+    {2, 5, 6, 7, 8, 0, 0, 0}, /* 0xF2 (11110010) */
+    {1, 2, 5, 6, 7, 8, 0, 0}, /* 0xF3 (11110011) */
+    {3, 5, 6, 7, 8, 0, 0, 0}, /* 0xF4 (11110100) */
+    {1, 3, 5, 6, 7, 8, 0, 0}, /* 0xF5 (11110101) */
+    {2, 3, 5, 6, 7, 8, 0, 0}, /* 0xF6 (11110110) */
+    {1, 2, 3, 5, 6, 7, 8, 0}, /* 0xF7 (11110111) */
+    {4, 5, 6, 7, 8, 0, 0, 0}, /* 0xF8 (11111000) */
+    {1, 4, 5, 6, 7, 8, 0, 0}, /* 0xF9 (11111001) */
+    {2, 4, 5, 6, 7, 8, 0, 0}, /* 0xFA (11111010) */
+    {1, 2, 4, 5, 6, 7, 8, 0}, /* 0xFB (11111011) */
+    {3, 4, 5, 6, 7, 8, 0, 0}, /* 0xFC (11111100) */
+    {1, 3, 4, 5, 6, 7, 8, 0}, /* 0xFD (11111101) */
+    {2, 3, 4, 5, 6, 7, 8, 0}, /* 0xFE (11111110) */
+    {1, 2, 3, 4, 5, 6, 7, 8}  /* 0xFF (11111111) */
+};
+
+#endif
+
+#if CROARING_IS_X64
+#if CROARING_COMPILER_SUPPORTS_AVX512
+CROARING_TARGET_AVX512
+const uint8_t vbmi2_table[64] = {
+    0,  1,  2,  3,  4,  5,  6,  7,  8,  9,  10, 11, 12, 13, 14, 15,
+    16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
+    32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
+    48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63};
+size_t bitset_extract_setbits_avx512(const uint64_t *words, size_t length,
+    uint32_t *vout, size_t outcapacity,
+    uint32_t base) {
+    uint32_t *out = (uint32_t *)vout;
+    uint32_t *initout = out;
+    uint32_t *safeout = out + outcapacity;
+    __m512i base_v = _mm512_set1_epi32(base);
+    __m512i index_table = _mm512_loadu_si512(vbmi2_table);
+    size_t i = 0;
+
+    for (; (i < length) && ((out + 64) < safeout); i += 1) {
+        uint64_t v = words[i];
+        __m512i vec = _mm512_maskz_compress_epi8(v, index_table);
+
+        uint8_t advance = (uint8_t)roaring_hamming(v);
+
+        __m512i vbase =
+            _mm512_add_epi32(base_v, _mm512_set1_epi32((int)(i * 64)));
+        __m512i r1 = _mm512_cvtepi8_epi32(_mm512_extracti32x4_epi32(vec, 0));
+        __m512i r2 = _mm512_cvtepi8_epi32(_mm512_extracti32x4_epi32(vec, 1));
+        __m512i r3 = _mm512_cvtepi8_epi32(_mm512_extracti32x4_epi32(vec, 2));
+        __m512i r4 = _mm512_cvtepi8_epi32(_mm512_extracti32x4_epi32(vec, 3));
+
+        r1 = _mm512_add_epi32(r1, vbase);
+        r2 = _mm512_add_epi32(r2, vbase);
+        r3 = _mm512_add_epi32(r3, vbase);
+        r4 = _mm512_add_epi32(r4, vbase);
+        _mm512_storeu_si512((__m512i *)out, r1);
+        _mm512_storeu_si512((__m512i *)(out + 16), r2);
+        _mm512_storeu_si512((__m512i *)(out + 32), r3);
+        _mm512_storeu_si512((__m512i *)(out + 48), r4);
+
+        out += advance;
+    }
+
+    base += i * 64;
+
+    for (; (i < length) && (out < safeout); ++i) {
+        uint64_t w = words[i];
+        while ((w != 0) && (out < safeout)) {
+            int r =
+                roaring_trailing_zeroes(w);  // on x64, should compile to TZCNT
+            uint32_t val = r + base;
+            memcpy(out, &val,
+                sizeof(uint32_t));  // should be compiled as a MOV on x64
+            out++;
+            w &= (w - 1);
+        }
+        base += 64;
+    }
+
+    return out - initout;
+}
+
+// Reference:
+// https://lemire.me/blog/2022/05/10/faster-bitset-decoding-using-intel-avx-512/
+size_t bitset_extract_setbits_avx512_uint16(const uint64_t *array,
+    size_t length, uint16_t *vout,
+    size_t capacity, uint16_t base) {
+    uint16_t *out = (uint16_t *)vout;
+    uint16_t *initout = out;
+    uint16_t *safeout = vout + capacity;
+
+    __m512i base_v = _mm512_set1_epi16(base);
+    __m512i index_table = _mm512_loadu_si512(vbmi2_table);
+    size_t i = 0;
+
+    for (; (i < length) && ((out + 64) < safeout); i++) {
+        uint64_t v = array[i];
+        __m512i vec = _mm512_maskz_compress_epi8(v, index_table);
+
+        uint8_t advance = (uint8_t)roaring_hamming(v);
+
+        __m512i vbase =
+            _mm512_add_epi16(base_v, _mm512_set1_epi16((short)(i * 64)));
+        __m512i r1 = _mm512_cvtepi8_epi16(_mm512_extracti32x8_epi32(vec, 0));
+        __m512i r2 = _mm512_cvtepi8_epi16(_mm512_extracti32x8_epi32(vec, 1));
+
+        r1 = _mm512_add_epi16(r1, vbase);
+        r2 = _mm512_add_epi16(r2, vbase);
+
+        _mm512_storeu_si512((__m512i *)out, r1);
+        _mm512_storeu_si512((__m512i *)(out + 32), r2);
+        out += advance;
+    }
+
+    base += i * 64;
+
+    for (; (i < length) && (out < safeout); ++i) {
+        uint64_t w = array[i];
+        while ((w != 0) && (out < safeout)) {
+            int r =
+                roaring_trailing_zeroes(w);  // on x64, should compile to TZCNT
+            uint32_t val = r + base;
+            memcpy(out, &val, sizeof(uint16_t));
+            out++;
+            w &= (w - 1);
+        }
+        base += 64;
+    }
+
+    return out - initout;
+}
+CROARING_UNTARGET_AVX512
+#endif
+
+CROARING_TARGET_AVX2
+size_t bitset_extract_setbits_avx2(const uint64_t *words, size_t length,
+    uint32_t *out, size_t outcapacity,
+    uint32_t base) {
+    uint32_t *initout = out;
+    __m256i baseVec = _mm256_set1_epi32(base - 1);
+    __m256i incVec = _mm256_set1_epi32(64);
+    __m256i add8 = _mm256_set1_epi32(8);
+    uint32_t *safeout = out + outcapacity;
+    size_t i = 0;
+    for (; (i < length) && (out + 64 <= safeout); ++i) {
+        uint64_t w = words[i];
+        if (w == 0) {
+            baseVec = _mm256_add_epi32(baseVec, incVec);
+        } else {
+            for (int k = 0; k < 4; ++k) {
+                uint8_t byteA = (uint8_t)w;
+                uint8_t byteB = (uint8_t)(w >> 8);
+                w >>= 16;
+                __m256i vecA =
+                    _mm256_loadu_si256((const __m256i *)vecDecodeTable[byteA]);
+                __m256i vecB =
+                    _mm256_loadu_si256((const __m256i *)vecDecodeTable[byteB]);
+                uint8_t advanceA = lengthTable[byteA];
+                uint8_t advanceB = lengthTable[byteB];
+                vecA = _mm256_add_epi32(baseVec, vecA);
+                baseVec = _mm256_add_epi32(baseVec, add8);
+                vecB = _mm256_add_epi32(baseVec, vecB);
+                baseVec = _mm256_add_epi32(baseVec, add8);
+                _mm256_storeu_si256((__m256i *)out, vecA);
+                out += advanceA;
+                _mm256_storeu_si256((__m256i *)out, vecB);
+                out += advanceB;
+            }
+        }
+    }
+    base += i * 64;
+    for (; (i < length) && (out < safeout); ++i) {
+        uint64_t w = words[i];
+        while ((w != 0) && (out < safeout)) {
+            int r =
+                roaring_trailing_zeroes(w);  // on x64, should compile to TZCNT
+            uint32_t val = r + base;
+            memcpy(out, &val,
+                sizeof(uint32_t));  // should be compiled as a MOV on x64
+            out++;
+            w &= (w - 1);
+        }
+        base += 64;
+    }
+    return out - initout;
+}
+CROARING_UNTARGET_AVX2
+#endif  // CROARING_IS_X64
+
+size_t bitset_extract_setbits(const uint64_t *words, size_t length,
+    uint32_t *out, uint32_t base) {
+    int outpos = 0;
+    for (size_t i = 0; i < length; ++i) {
+        uint64_t w = words[i];
+        while (w != 0) {
+            int r =
+                roaring_trailing_zeroes(w);  // on x64, should compile to TZCNT
+            uint32_t val = r + base;
+            memcpy(out + outpos, &val,
+                sizeof(uint32_t));  // should be compiled as a MOV on x64
+            outpos++;
+            w &= (w - 1);
+        }
+        base += 64;
+    }
+    return outpos;
+}
+
+size_t bitset_extract_intersection_setbits_uint16(
+    const uint64_t *__restrict__ words1, const uint64_t *__restrict__ words2,
+    size_t length, uint16_t *out, uint16_t base) {
+    int outpos = 0;
+    for (size_t i = 0; i < length; ++i) {
+        uint64_t w = words1[i] & words2[i];
+        while (w != 0) {
+            int r = roaring_trailing_zeroes(w);
+            out[outpos++] = (uint16_t)(r + base);
+            w &= (w - 1);
+        }
+        base += 64;
+    }
+    return outpos;
+}
+
+#if CROARING_IS_X64
+/*
+ * Given a bitset containing "length" 64-bit words, write out the position
+ * of all the set bits to "out" as 16-bit integers, values start at "base" (can
+ *be set to zero).
+ *
+ * The "out" pointer should be sufficient to store the actual number of bits
+ *set.
+ *
+ * Returns how many values were actually decoded.
+ *
+ * This function uses SSE decoding.
+ */
+CROARING_TARGET_AVX2
+size_t bitset_extract_setbits_sse_uint16(const uint64_t *words, size_t length,
+    uint16_t *out, size_t outcapacity,
+    uint16_t base) {
+    uint16_t *initout = out;
+    __m128i baseVec = _mm_set1_epi16(base - 1);
+    __m128i incVec = _mm_set1_epi16(64);
+    __m128i add8 = _mm_set1_epi16(8);
+    uint16_t *safeout = out + outcapacity;
+    const int numberofbytes = 2;  // process two bytes at a time
+    size_t i = 0;
+    for (; (i < length) && (out + numberofbytes * 8 <= safeout); ++i) {
+        uint64_t w = words[i];
+        if (w == 0) {
+            baseVec = _mm_add_epi16(baseVec, incVec);
+        } else {
+            for (int k = 0; k < 4; ++k) {
+                uint8_t byteA = (uint8_t)w;
+                uint8_t byteB = (uint8_t)(w >> 8);
+                w >>= 16;
+                __m128i vecA = _mm_loadu_si128(
+                    (const __m128i *)vecDecodeTable_uint16[byteA]);
+                __m128i vecB = _mm_loadu_si128(
+                    (const __m128i *)vecDecodeTable_uint16[byteB]);
+                uint8_t advanceA = lengthTable[byteA];
+                uint8_t advanceB = lengthTable[byteB];
+                vecA = _mm_add_epi16(baseVec, vecA);
+                baseVec = _mm_add_epi16(baseVec, add8);
+                vecB = _mm_add_epi16(baseVec, vecB);
+                baseVec = _mm_add_epi16(baseVec, add8);
+                _mm_storeu_si128((__m128i *)out, vecA);
+                out += advanceA;
+                _mm_storeu_si128((__m128i *)out, vecB);
+                out += advanceB;
+            }
+        }
+    }
+    base += (uint16_t)(i * 64);
+    for (; (i < length) && (out < safeout); ++i) {
+        uint64_t w = words[i];
+        while ((w != 0) && (out < safeout)) {
+            int r = roaring_trailing_zeroes(w);
+            *out = (uint16_t)(r + base);
+            out++;
+            w &= (w - 1);
+        }
+        base += 64;
+    }
+    return out - initout;
+}
+CROARING_UNTARGET_AVX2
+#endif
+
+/*
+ * Given a bitset containing "length" 64-bit words, write out the position
+ * of all the set bits to "out", values start at "base" (can be set to zero).
+ *
+ * The "out" pointer should be sufficient to store the actual number of bits
+ *set.
+ *
+ * Returns how many values were actually decoded.
+ */
+size_t bitset_extract_setbits_uint16(const uint64_t *words, size_t length,
+    uint16_t *out, uint16_t base) {
+    int outpos = 0;
+    for (size_t i = 0; i < length; ++i) {
+        uint64_t w = words[i];
+        while (w != 0) {
+            int r = roaring_trailing_zeroes(w);
+            out[outpos++] = (uint16_t)(r + base);
+            w &= (w - 1);
+        }
+        base += 64;
+    }
+    return outpos;
+}
+
+#if defined(CROARING_ASMBITMANIPOPTIMIZATION) && defined(CROARING_IS_X64)
+
+static inline uint64_t _asm_bitset_set_list_withcard(uint64_t *words,
+    uint64_t card,
+    const uint16_t *list,
+    uint64_t length) {
+    uint64_t offset, load, pos;
+    uint64_t shift = 6;
+    const uint16_t *end = list + length;
+    if (!length) return card;
+    // TODO: could unroll for performance, see bitset_set_list
+    // bts is not available as an intrinsic in GCC
+    __asm volatile(
+        "1:\n"
+        "movzwq (%[list]), %[pos]\n"
+        "shrx %[shift], %[pos], %[offset]\n"
+        "mov (%[words],%[offset],8), %[load]\n"
+        "bts %[pos], %[load]\n"
+        "mov %[load], (%[words],%[offset],8)\n"
+        "sbb $-1, %[card]\n"
+        "add $2, %[list]\n"
+        "cmp %[list], %[end]\n"
+        "jnz 1b"
+        : [card] "+&r"(card), [list] "+&r"(list), [load] "=&r"(load),
+        [pos] "=&r"(pos), [offset] "=&r"(offset)
+        : [end] "r"(end), [words] "r"(words), [shift] "r"(shift));
+    return card;
+}
+
+static inline void _asm_bitset_set_list(uint64_t *words, const uint16_t *list,
+    uint64_t length) {
+    uint64_t pos;
+    const uint16_t *end = list + length;
+
+    uint64_t shift = 6;
+    uint64_t offset;
+    uint64_t load;
+    for (; list + 3 < end; list += 4) {
+        pos = list[0];
+        __asm volatile(
+            "shrx %[shift], %[pos], %[offset]\n"
+            "mov (%[words],%[offset],8), %[load]\n"
+            "bts %[pos], %[load]\n"
+            "mov %[load], (%[words],%[offset],8)"
+            : [load] "=&r"(load), [offset] "=&r"(offset)
+            : [words] "r"(words), [shift] "r"(shift), [pos] "r"(pos));
+        pos = list[1];
+        __asm volatile(
+            "shrx %[shift], %[pos], %[offset]\n"
+            "mov (%[words],%[offset],8), %[load]\n"
+            "bts %[pos], %[load]\n"
+            "mov %[load], (%[words],%[offset],8)"
+            : [load] "=&r"(load), [offset] "=&r"(offset)
+            : [words] "r"(words), [shift] "r"(shift), [pos] "r"(pos));
+        pos = list[2];
+        __asm volatile(
+            "shrx %[shift], %[pos], %[offset]\n"
+            "mov (%[words],%[offset],8), %[load]\n"
+            "bts %[pos], %[load]\n"
+            "mov %[load], (%[words],%[offset],8)"
+            : [load] "=&r"(load), [offset] "=&r"(offset)
+            : [words] "r"(words), [shift] "r"(shift), [pos] "r"(pos));
+        pos = list[3];
+        __asm volatile(
+            "shrx %[shift], %[pos], %[offset]\n"
+            "mov (%[words],%[offset],8), %[load]\n"
+            "bts %[pos], %[load]\n"
+            "mov %[load], (%[words],%[offset],8)"
+            : [load] "=&r"(load), [offset] "=&r"(offset)
+            : [words] "r"(words), [shift] "r"(shift), [pos] "r"(pos));
+    }
+
+    while (list != end) {
+        pos = list[0];
+        __asm volatile(
+            "shrx %[shift], %[pos], %[offset]\n"
+            "mov (%[words],%[offset],8), %[load]\n"
+            "bts %[pos], %[load]\n"
+            "mov %[load], (%[words],%[offset],8)"
+            : [load] "=&r"(load), [offset] "=&r"(offset)
+            : [words] "r"(words), [shift] "r"(shift), [pos] "r"(pos));
+        list++;
+    }
+}
+
+static inline uint64_t _asm_bitset_clear_list(uint64_t *words, uint64_t card,
+    const uint16_t *list,
+    uint64_t length) {
+    uint64_t offset, load, pos;
+    uint64_t shift = 6;
+    const uint16_t *end = list + length;
+    if (!length) return card;
+    // btr is not available as an intrinsic in GCC
+    __asm volatile(
+        "1:\n"
+        "movzwq (%[list]), %[pos]\n"
+        "shrx %[shift], %[pos], %[offset]\n"
+        "mov (%[words],%[offset],8), %[load]\n"
+        "btr %[pos], %[load]\n"
+        "mov %[load], (%[words],%[offset],8)\n"
+        "sbb $0, %[card]\n"
+        "add $2, %[list]\n"
+        "cmp %[list], %[end]\n"
+        "jnz 1b"
+        : [card] "+&r"(card), [list] "+&r"(list), [load] "=&r"(load),
+        [pos] "=&r"(pos), [offset] "=&r"(offset)
+        : [end] "r"(end), [words] "r"(words), [shift] "r"(shift)
+        :
+        /* clobbers */ "memory");
+    return card;
+}
+
+static inline uint64_t _scalar_bitset_clear_list(uint64_t *words, uint64_t card,
+    const uint16_t *list,
+    uint64_t length) {
+    uint64_t offset, load, newload, pos, index;
+    const uint16_t *end = list + length;
+    while (list != end) {
+        pos = *(const uint16_t *)list;
+        offset = pos >> 6;
+        index = pos % 64;
+        load = words[offset];
+        newload = load & ~(UINT64_C(1) << index);
+        card -= (load ^ newload) >> index;
+        words[offset] = newload;
+        list++;
+    }
+    return card;
+}
+
+static inline uint64_t _scalar_bitset_set_list_withcard(uint64_t *words,
+    uint64_t card,
+    const uint16_t *list,
+    uint64_t length) {
+    uint64_t offset, load, newload, pos, index;
+    const uint16_t *end = list + length;
+    while (list != end) {
+        pos = *list;
+        offset = pos >> 6;
+        index = pos % 64;
+        load = words[offset];
+        newload = load | (UINT64_C(1) << index);
+        card += (load ^ newload) >> index;
+        words[offset] = newload;
+        list++;
+    }
+    return card;
+}
+
+static inline void _scalar_bitset_set_list(uint64_t *words,
+    const uint16_t *list,
+    uint64_t length) {
+    uint64_t offset, load, newload, pos, index;
+    const uint16_t *end = list + length;
+    while (list != end) {
+        pos = *list;
+        offset = pos >> 6;
+        index = pos % 64;
+        load = words[offset];
+        newload = load | (UINT64_C(1) << index);
+        words[offset] = newload;
+        list++;
+    }
+}
+
+uint64_t bitset_clear_list(uint64_t *words, uint64_t card, const uint16_t *list,
+    uint64_t length) {
+    if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+        return _asm_bitset_clear_list(words, card, list, length);
+    } else {
+        return _scalar_bitset_clear_list(words, card, list, length);
+    }
+}
+
+uint64_t bitset_set_list_withcard(uint64_t *words, uint64_t card,
+    const uint16_t *list, uint64_t length) {
+    if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+        return _asm_bitset_set_list_withcard(words, card, list, length);
+    } else {
+        return _scalar_bitset_set_list_withcard(words, card, list, length);
+    }
+}
+
+void bitset_set_list(uint64_t *words, const uint16_t *list, uint64_t length) {
+    if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+        _asm_bitset_set_list(words, list, length);
+    } else {
+        _scalar_bitset_set_list(words, list, length);
+    }
+}
+#else
+uint64_t bitset_clear_list(uint64_t *words, uint64_t card, const uint16_t *list,
+    uint64_t length) {
+    uint64_t offset, load, newload, pos, index;
+    const uint16_t *end = list + length;
+    while (list != end) {
+        pos = *(const uint16_t *)list;
+        offset = pos >> 6;
+        index = pos % 64;
+        load = words[offset];
+        newload = load & ~(UINT64_C(1) << index);
+        card -= (load ^ newload) >> index;
+        words[offset] = newload;
+        list++;
+    }
+    return card;
+}
+
+uint64_t bitset_set_list_withcard(uint64_t *words, uint64_t card,
+    const uint16_t *list, uint64_t length) {
+    uint64_t offset, load, newload, pos, index;
+    const uint16_t *end = list + length;
+    while (list != end) {
+        pos = *list;
+        offset = pos >> 6;
+        index = pos % 64;
+        load = words[offset];
+        newload = load | (UINT64_C(1) << index);
+        card += (load ^ newload) >> index;
+        words[offset] = newload;
+        list++;
+    }
+    return card;
+}
+
+void bitset_set_list(uint64_t *words, const uint16_t *list, uint64_t length) {
+    uint64_t offset, load, newload, pos, index;
+    const uint16_t *end = list + length;
+    while (list != end) {
+        pos = *list;
+        offset = pos >> 6;
+        index = pos % 64;
+        load = words[offset];
+        newload = load | (UINT64_C(1) << index);
+        words[offset] = newload;
+        list++;
+    }
+}
+
+#endif
+
+/* flip specified bits */
+/* TODO: consider whether worthwhile to make an asm version */
+
+uint64_t bitset_flip_list_withcard(uint64_t *words, uint64_t card,
+    const uint16_t *list, uint64_t length) {
+    uint64_t offset, load, newload, pos, index;
+    const uint16_t *end = list + length;
+    while (list != end) {
+        pos = *list;
+        offset = pos >> 6;
+        index = pos % 64;
+        load = words[offset];
+        newload = load ^ (UINT64_C(1) << index);
+        // todo: is a branch here all that bad?
+        card +=
+            (1 - 2 * (((UINT64_C(1) << index) & load) >> index));  // +1 or -1
+        words[offset] = newload;
+        list++;
+    }
+    return card;
+}
+
+void bitset_flip_list(uint64_t *words, const uint16_t *list, uint64_t length) {
+    uint64_t offset, load, newload, pos, index;
+    const uint16_t *end = list + length;
+    while (list != end) {
+        pos = *list;
+        offset = pos >> 6;
+        index = pos % 64;
+        load = words[offset];
+        newload = load ^ (UINT64_C(1) << index);
+        words[offset] = newload;
+        list++;
+    }
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace api {
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic pop
+#endif
+/* end file src/bitset_util.c */
+/* begin file src/containers/array.c */
+/*
+ * array.c
+ *
+ */
+
+#include <assert.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+
+#if CROARING_IS_X64
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#error "CROARING_COMPILER_SUPPORTS_AVX512 needs to be defined."
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+extern inline uint16_t array_container_minimum(const array_container_t *arr);
+extern inline uint16_t array_container_maximum(const array_container_t *arr);
+extern inline int array_container_index_equalorlarger(
+    const array_container_t *arr, uint16_t x);
+
+extern inline int array_container_rank(const array_container_t *arr,
+    uint16_t x);
+extern inline uint32_t array_container_rank_many(const array_container_t *arr,
+    uint64_t start_rank,
+    const uint32_t *begin,
+    const uint32_t *end,
+    uint64_t *ans);
+extern inline int array_container_get_index(const array_container_t *arr,
+    uint16_t x);
+extern inline bool array_container_contains(const array_container_t *arr,
+    uint16_t pos);
+extern inline int array_container_cardinality(const array_container_t *array);
+extern inline bool array_container_nonzero_cardinality(
+    const array_container_t *array);
+extern inline int32_t array_container_serialized_size_in_bytes(int32_t card);
+extern inline bool array_container_empty(const array_container_t *array);
+extern inline bool array_container_full(const array_container_t *array);
+
+/* Create a new array with capacity size. Return NULL in case of failure. */
+array_container_t *array_container_create_given_capacity(int32_t size) {
+    array_container_t *container;
+
+    if ((container = (array_container_t *)roaring_malloc(
+             sizeof(array_container_t))) == NULL) {
+        return NULL;
+    }
+
+    if (size <= 0) {  // we don't want to rely on malloc(0)
+        container->array = NULL;
+    } else if ((container->array = (uint16_t *)roaring_malloc(sizeof(uint16_t) *
+                                                             size)) == NULL) {
+        roaring_free(container);
+        return NULL;
+    }
+
+    container->capacity = size;
+    container->cardinality = 0;
+
+    return container;
+}
+
+/* Create a new array. Return NULL in case of failure. */
+array_container_t *array_container_create(void) {
+    return array_container_create_given_capacity(ARRAY_DEFAULT_INIT_SIZE);
+}
+
+/* Create a new array containing all values in [min,max). */
+array_container_t *array_container_create_range(uint32_t min, uint32_t max) {
+    array_container_t *answer =
+        array_container_create_given_capacity(max - min + 1);
+    if (answer == NULL) return answer;
+    answer->cardinality = 0;
+    for (uint32_t k = min; k < max; k++) {
+        answer->array[answer->cardinality++] = k;
+    }
+    return answer;
+}
+
+/* Duplicate container */
+ALLOW_UNALIGNED
+array_container_t *array_container_clone(const array_container_t *src) {
+    array_container_t *newcontainer =
+        array_container_create_given_capacity(src->capacity);
+    if (newcontainer == NULL) return NULL;
+
+    newcontainer->cardinality = src->cardinality;
+
+    memcpy(newcontainer->array, src->array,
+        src->cardinality * sizeof(uint16_t));
+
+    return newcontainer;
+}
+
+void array_container_offset(const array_container_t *c, container_t **loc,
+    container_t **hic, uint16_t offset) {
+    array_container_t *lo = NULL, *hi = NULL;
+    int top, lo_cap, hi_cap;
+
+    top = (1 << 16) - offset;
+
+    lo_cap = count_less(c->array, c->cardinality, top);
+    if (loc && lo_cap) {
+        lo = array_container_create_given_capacity(lo_cap);
+        for (int i = 0; i < lo_cap; ++i) {
+            array_container_add(lo, c->array[i] + offset);
+        }
+        *loc = (container_t *)lo;
+    }
+
+    hi_cap = c->cardinality - lo_cap;
+    if (hic && hi_cap) {
+        hi = array_container_create_given_capacity(hi_cap);
+        for (int i = lo_cap; i < c->cardinality; ++i) {
+            array_container_add(hi, c->array[i] + offset);
+        }
+        *hic = (container_t *)hi;
+    }
+}
+
+int array_container_shrink_to_fit(array_container_t *src) {
+    if (src->cardinality == src->capacity) return 0;  // nothing to do
+    int savings = src->capacity - src->cardinality;
+    src->capacity = src->cardinality;
+    if (src->capacity ==
+        0) {  // we do not want to rely on realloc for zero allocs
+        roaring_free(src->array);
+        src->array = NULL;
+    } else {
+        uint16_t *oldarray = src->array;
+        src->array = (uint16_t *)roaring_realloc(
+            oldarray, src->capacity * sizeof(uint16_t));
+        if (src->array == NULL) roaring_free(oldarray);  // should never happen?
+    }
+    return savings;
+}
+
+/* Free memory. */
+void array_container_free(array_container_t *arr) {
+    if (arr == NULL) return;
+    roaring_free(arr->array);
+    roaring_free(arr);
+}
+
+static inline int32_t grow_capacity(int32_t capacity) {
+    return (capacity <= 0)   ? ARRAY_DEFAULT_INIT_SIZE
+           : capacity < 64   ? capacity * 2
+           : capacity < 1024 ? capacity * 3 / 2
+                             : capacity * 5 / 4;
+}
+
+static inline int32_t clamp(int32_t val, int32_t min, int32_t max) {
+    return ((val < min) ? min : (val > max) ? max : val);
+}
+
+void array_container_grow(array_container_t *container, int32_t min,
+    bool preserve) {
+    int32_t max = (min <= DEFAULT_MAX_SIZE ? DEFAULT_MAX_SIZE : 65536);
+    int32_t new_capacity = clamp(grow_capacity(container->capacity), min, max);
+
+    container->capacity = new_capacity;
+    uint16_t *array = container->array;
+
+    if (preserve) {
+        container->array =
+            (uint16_t *)roaring_realloc(array, new_capacity * sizeof(uint16_t));
+        if (container->array == NULL) roaring_free(array);
+    } else {
+        roaring_free(array);
+        container->array =
+            (uint16_t *)roaring_malloc(new_capacity * sizeof(uint16_t));
+    }
+
+    // if realloc fails, we have container->array == NULL.
+}
+
+/* Copy one container into another. We assume that they are distinct. */
+void array_container_copy(const array_container_t *src,
+    array_container_t *dst) {
+    const int32_t cardinality = src->cardinality;
+    if (cardinality > dst->capacity) {
+        array_container_grow(dst, cardinality, false);
+    }
+
+    dst->cardinality = cardinality;
+    memcpy(dst->array, src->array, cardinality * sizeof(uint16_t));
+}
+
+void array_container_add_from_range(array_container_t *arr, uint32_t min,
+    uint32_t max, uint16_t step) {
+    for (uint32_t value = min; value < max; value += step) {
+        array_container_append(arr, value);
+    }
+}
+
+/* Computes the union of array1 and array2 and write the result to arrayout.
+ * It is assumed that arrayout is distinct from both array1 and array2.
+ */
+void array_container_union(const array_container_t *array_1,
+    const array_container_t *array_2,
+    array_container_t *out) {
+    const int32_t card_1 = array_1->cardinality, card_2 = array_2->cardinality;
+    const int32_t max_cardinality = card_1 + card_2;
+
+    if (out->capacity < max_cardinality) {
+        array_container_grow(out, max_cardinality, false);
+    }
+    out->cardinality = (int32_t)fast_union_uint16(
+        array_1->array, card_1, array_2->array, card_2, out->array);
+}
+
+/* Computes the  difference of array1 and array2 and write the result
+ * to array out.
+ * Array out does not need to be distinct from array_1
+ */
+void array_container_andnot(const array_container_t *array_1,
+    const array_container_t *array_2,
+    array_container_t *out) {
+    if (out->capacity < array_1->cardinality)
+        array_container_grow(out, array_1->cardinality, false);
+#if CROARING_IS_X64
+    if ((croaring_hardware_support() & ROARING_SUPPORTS_AVX2) &&
+        (out != array_1) && (out != array_2)) {
+        out->cardinality = difference_vector16(
+            array_1->array, array_1->cardinality, array_2->array,
+            array_2->cardinality, out->array);
+    } else {
+        out->cardinality =
+            difference_uint16(array_1->array, array_1->cardinality,
+                array_2->array, array_2->cardinality, out->array);
+    }
+#else
+    out->cardinality =
+        difference_uint16(array_1->array, array_1->cardinality, array_2->array,
+            array_2->cardinality, out->array);
+#endif
+}
+
+/* Computes the symmetric difference of array1 and array2 and write the
+ * result
+ * to arrayout.
+ * It is assumed that arrayout is distinct from both array1 and array2.
+ */
+void array_container_xor(const array_container_t *array_1,
+    const array_container_t *array_2,
+    array_container_t *out) {
+    const int32_t card_1 = array_1->cardinality, card_2 = array_2->cardinality;
+    const int32_t max_cardinality = card_1 + card_2;
+    if (out->capacity < max_cardinality) {
+        array_container_grow(out, max_cardinality, false);
+    }
+
+#if CROARING_IS_X64
+    if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+        out->cardinality =
+            xor_vector16(array_1->array, array_1->cardinality, array_2->array,
+                array_2->cardinality, out->array);
+    } else {
+        out->cardinality =
+            xor_uint16(array_1->array, array_1->cardinality, array_2->array,
+                array_2->cardinality, out->array);
+    }
+#else
+    out->cardinality =
+        xor_uint16(array_1->array, array_1->cardinality, array_2->array,
+            array_2->cardinality, out->array);
+#endif
+}
+
+static inline int32_t minimum_int32(int32_t a, int32_t b) {
+    return (a < b) ? a : b;
+}
+
+/* computes the intersection of array1 and array2 and write the result to
+ * arrayout.
+ * It is assumed that arrayout is distinct from both array1 and array2.
+ * */
+void array_container_intersection(const array_container_t *array1,
+    const array_container_t *array2,
+    array_container_t *out) {
+    int32_t card_1 = array1->cardinality, card_2 = array2->cardinality,
+            min_card = minimum_int32(card_1, card_2);
+    const int threshold = 64;  // subject to tuning
+#if CROARING_IS_X64
+    if (out->capacity < min_card) {
+        array_container_grow(out, min_card + sizeof(__m128i) / sizeof(uint16_t),
+            false);
+    }
+#else
+    if (out->capacity < min_card) {
+        array_container_grow(out, min_card, false);
+    }
+#endif
+
+    if (card_1 * threshold < card_2) {
+        out->cardinality = intersect_skewed_uint16(
+            array1->array, card_1, array2->array, card_2, out->array);
+    } else if (card_2 * threshold < card_1) {
+        out->cardinality = intersect_skewed_uint16(
+            array2->array, card_2, array1->array, card_1, out->array);
+    } else {
+#if CROARING_IS_X64
+        if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+            out->cardinality = intersect_vector16(
+                array1->array, card_1, array2->array, card_2, out->array);
+        } else {
+            out->cardinality = intersect_uint16(
+                array1->array, card_1, array2->array, card_2, out->array);
+        }
+#else
+        out->cardinality = intersect_uint16(array1->array, card_1,
+            array2->array, card_2, out->array);
+#endif
+    }
+}
+
+/* computes the size of the intersection of array1 and array2
+ * */
+int array_container_intersection_cardinality(const array_container_t *array1,
+    const array_container_t *array2) {
+    int32_t card_1 = array1->cardinality, card_2 = array2->cardinality;
+    const int threshold = 64;  // subject to tuning
+    if (card_1 * threshold < card_2) {
+        return intersect_skewed_uint16_cardinality(array1->array, card_1,
+            array2->array, card_2);
+    } else if (card_2 * threshold < card_1) {
+        return intersect_skewed_uint16_cardinality(array2->array, card_2,
+            array1->array, card_1);
+    } else {
+#if CROARING_IS_X64
+        if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+            return intersect_vector16_cardinality(array1->array, card_1,
+                array2->array, card_2);
+        } else {
+            return intersect_uint16_cardinality(array1->array, card_1,
+                array2->array, card_2);
+        }
+#else
+        return intersect_uint16_cardinality(array1->array, card_1,
+            array2->array, card_2);
+#endif
+    }
+}
+
+bool array_container_intersect(const array_container_t *array1,
+    const array_container_t *array2) {
+    int32_t card_1 = array1->cardinality, card_2 = array2->cardinality;
+    const int threshold = 64;  // subject to tuning
+    if (card_1 * threshold < card_2) {
+        return intersect_skewed_uint16_nonempty(array1->array, card_1,
+            array2->array, card_2);
+    } else if (card_2 * threshold < card_1) {
+        return intersect_skewed_uint16_nonempty(array2->array, card_2,
+            array1->array, card_1);
+    } else {
+        // we do not bother vectorizing
+        return intersect_uint16_nonempty(array1->array, card_1, array2->array,
+            card_2);
+    }
+}
+
+/* computes the intersection of array1 and array2 and write the result to
+ * array1.
+ * */
+void array_container_intersection_inplace(array_container_t *src_1,
+    const array_container_t *src_2) {
+    int32_t card_1 = src_1->cardinality, card_2 = src_2->cardinality;
+    const int threshold = 64;  // subject to tuning
+    if (card_1 * threshold < card_2) {
+        src_1->cardinality = intersect_skewed_uint16(
+            src_1->array, card_1, src_2->array, card_2, src_1->array);
+    } else if (card_2 * threshold < card_1) {
+        src_1->cardinality = intersect_skewed_uint16(
+            src_2->array, card_2, src_1->array, card_1, src_1->array);
+    } else {
+#if CROARING_IS_X64
+        if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+            src_1->cardinality = intersect_vector16_inplace(
+                src_1->array, card_1, src_2->array, card_2);
+        } else {
+            src_1->cardinality = intersect_uint16(
+                src_1->array, card_1, src_2->array, card_2, src_1->array);
+        }
+#else
+        src_1->cardinality = intersect_uint16(
+            src_1->array, card_1, src_2->array, card_2, src_1->array);
+#endif
+    }
+}
+
+ALLOW_UNALIGNED
+int array_container_to_uint32_array(void *vout, const array_container_t *cont,
+    uint32_t base) {
+#if CROARING_IS_X64
+    int support = croaring_hardware_support();
+#if CROARING_COMPILER_SUPPORTS_AVX512
+    if (support & ROARING_SUPPORTS_AVX512) {
+        return avx512_array_container_to_uint32_array(vout, cont->array,
+            cont->cardinality, base);
+    }
+#endif
+    if (support & ROARING_SUPPORTS_AVX2) {
+        return array_container_to_uint32_array_vector16(
+            vout, cont->array, cont->cardinality, base);
+    }
+#endif  // CROARING_IS_X64
+    int outpos = 0;
+    uint32_t *out = (uint32_t *)vout;
+    size_t i = 0;
+    for (; i < (size_t)cont->cardinality; ++i) {
+        const uint32_t val = base + cont->array[i];
+        memcpy(out + outpos, &val,
+            sizeof(uint32_t));  // should be compiled as a MOV on x64
+        outpos++;
+    }
+    return outpos;
+}
+
+void array_container_printf(const array_container_t *v) {
+    if (v->cardinality == 0) {
+        printf("{}");
+        return;
+    }
+    printf("{");
+    printf("%d", v->array[0]);
+    for (int i = 1; i < v->cardinality; ++i) {
+        printf(",%d", v->array[i]);
+    }
+    printf("}");
+}
+
+void array_container_printf_as_uint32_array(const array_container_t *v,
+    uint32_t base) {
+    if (v->cardinality == 0) {
+        return;
+    }
+    printf("%u", v->array[0] + base);
+    for (int i = 1; i < v->cardinality; ++i) {
+        printf(",%u", v->array[i] + base);
+    }
+}
+
+/*
+ * Validate the container. Returns true if valid.
+ */
+bool array_container_validate(const array_container_t *v, const char **reason) {
+    if (v->capacity < 0) {
+        *reason = "negative capacity";
+        return false;
+    }
+    if (v->cardinality < 0) {
+        *reason = "negative cardinality";
+        return false;
+    }
+    if (v->cardinality > v->capacity) {
+        *reason = "cardinality exceeds capacity";
+        return false;
+    }
+    if (v->cardinality > DEFAULT_MAX_SIZE) {
+        *reason = "cardinality exceeds DEFAULT_MAX_SIZE";
+        return false;
+    }
+    if (v->cardinality == 0) {
+        *reason = "zero cardinality";
+        return false;
+    }
+
+    if (v->array == NULL) {
+        *reason = "NULL array pointer";
+        return false;
+    }
+    uint16_t prev = v->array[0];
+    for (int i = 1; i < v->cardinality; ++i) {
+        if (v->array[i] <= prev) {
+            *reason = "array elements not strictly increasing";
+            return false;
+        }
+        prev = v->array[i];
+    }
+
+    return true;
+}
+
+/* Compute the number of runs */
+int32_t array_container_number_of_runs(const array_container_t *ac) {
+    // Can SIMD work here?
+    int32_t nr_runs = 0;
+    int32_t prev = -2;
+    for (const uint16_t *p = ac->array; p != ac->array + ac->cardinality; ++p) {
+        if (*p != prev + 1) nr_runs++;
+        prev = *p;
+    }
+    return nr_runs;
+}
+
+/**
+ * Writes the underlying array to buf, outputs how many bytes were written.
+ * The number of bytes written should be
+ * array_container_size_in_bytes(container).
+ *
+ */
+int32_t array_container_write(const array_container_t *container, char *buf) {
+    memcpy(buf, container->array, container->cardinality * sizeof(uint16_t));
+    return array_container_size_in_bytes(container);
+}
+
+bool array_container_is_subset(const array_container_t *container1,
+    const array_container_t *container2) {
+    if (container1->cardinality > container2->cardinality) {
+        return false;
+    }
+    int i1 = 0, i2 = 0;
+    while (i1 < container1->cardinality && i2 < container2->cardinality) {
+        if (container1->array[i1] == container2->array[i2]) {
+            i1++;
+            i2++;
+        } else if (container1->array[i1] > container2->array[i2]) {
+            i2++;
+        } else {  // container1->array[i1] < container2->array[i2]
+            return false;
+        }
+    }
+    if (i1 == container1->cardinality) {
+        return true;
+    } else {
+        return false;
+    }
+}
+
+int32_t array_container_read(int32_t cardinality, array_container_t *container,
+    const char *buf) {
+    if (container->capacity < cardinality) {
+        array_container_grow(container, cardinality, false);
+    }
+    container->cardinality = cardinality;
+    memcpy(container->array, buf, container->cardinality * sizeof(uint16_t));
+
+    return array_container_size_in_bytes(container);
+}
+
+bool array_container_iterate(const array_container_t *cont, uint32_t base,
+    roaring_iterator iterator, void *ptr) {
+    for (int i = 0; i < cont->cardinality; i++)
+        if (!iterator(cont->array[i] + base, ptr)) return false;
+    return true;
+}
+
+bool array_container_iterate64(const array_container_t *cont, uint32_t base,
+    roaring_iterator64 iterator, uint64_t high_bits,
+    void *ptr) {
+    for (int i = 0; i < cont->cardinality; i++)
+        if (!iterator(high_bits | (uint64_t)(cont->array[i] + base), ptr))
+            return false;
+    return true;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/containers/array.c */
+/* begin file src/containers/bitset.c */
+/*
+ * bitset.c
+ *
+ */
+#ifndef _POSIX_C_SOURCE
+#define _POSIX_C_SOURCE 200809L
+#endif
+#include <assert.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+#if CROARING_IS_X64
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#error "CROARING_COMPILER_SUPPORTS_AVX512 needs to be defined."
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+#endif
+
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wuninitialized"
+#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
+#endif
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+extern inline int bitset_container_cardinality(
+    const bitset_container_t *bitset);
+extern inline void bitset_container_set(bitset_container_t *bitset,
+    uint16_t pos);
+// unused at this time:
+// extern inline void bitset_container_unset(bitset_container_t *bitset,
+// uint16_t pos);
+extern inline bool bitset_container_get(const bitset_container_t *bitset,
+    uint16_t pos);
+extern inline int32_t bitset_container_serialized_size_in_bytes(void);
+extern inline bool bitset_container_add(bitset_container_t *bitset,
+    uint16_t pos);
+extern inline bool bitset_container_remove(bitset_container_t *bitset,
+    uint16_t pos);
+extern inline bool bitset_container_contains(const bitset_container_t *bitset,
+    uint16_t pos);
+
+void bitset_container_clear(bitset_container_t *bitset) {
+    memset(bitset->words, 0, sizeof(uint64_t) * BITSET_CONTAINER_SIZE_IN_WORDS);
+    bitset->cardinality = 0;
+}
+
+void bitset_container_set_all(bitset_container_t *bitset) {
+    memset(bitset->words, INT64_C(-1),
+        sizeof(uint64_t) * BITSET_CONTAINER_SIZE_IN_WORDS);
+    bitset->cardinality = (1 << 16);
+}
+
+/* Create a new bitset. Return NULL in case of failure. */
+bitset_container_t *bitset_container_create(void) {
+    bitset_container_t *bitset =
+        (bitset_container_t *)roaring_malloc(sizeof(bitset_container_t));
+
+    if (!bitset) {
+        return NULL;
+    }
+
+    size_t align_size = 32;
+#if CROARING_IS_X64
+    int support = croaring_hardware_support();
+    if (support & ROARING_SUPPORTS_AVX512) {
+        // sizeof(__m512i) == 64
+        align_size = 64;
+    } else {
+        // sizeof(__m256i) == 32
+        align_size = 32;
+    }
+#endif
+    bitset->words = (uint64_t *)roaring_aligned_malloc(
+        align_size, sizeof(uint64_t) * BITSET_CONTAINER_SIZE_IN_WORDS);
+    if (!bitset->words) {
+        roaring_free(bitset);
+        return NULL;
+    }
+    bitset_container_clear(bitset);
+    return bitset;
+}
+
+/* Copy one container into another. We assume that they are distinct. */
+void bitset_container_copy(const bitset_container_t *source,
+    bitset_container_t *dest) {
+    dest->cardinality = source->cardinality;
+    memcpy(dest->words, source->words,
+        sizeof(uint64_t) * BITSET_CONTAINER_SIZE_IN_WORDS);
+}
+
+void bitset_container_add_from_range(bitset_container_t *bitset, uint32_t min,
+    uint32_t max, uint16_t step) {
+    if (step == 0) return;   // refuse to crash
+    if ((64 % step) == 0) {  // step divides 64
+        uint64_t mask = 0;   // construct the repeated mask
+        for (uint32_t value = (min % step); value < 64; value += step) {
+            mask |= ((uint64_t)1 << value);
+        }
+        uint32_t firstword = min / 64;
+        uint32_t endword = (max - 1) / 64;
+        bitset->cardinality = (max - min + step - 1) / step;
+        if (firstword == endword) {
+            bitset->words[firstword] |=
+                mask & (((~UINT64_C(0)) << (min % 64)) &
+                           ((~UINT64_C(0)) >> ((~max + 1) % 64)));
+            return;
+        }
+        bitset->words[firstword] = mask & ((~UINT64_C(0)) << (min % 64));
+        for (uint32_t i = firstword + 1; i < endword; i++)
+            bitset->words[i] = mask;
+        bitset->words[endword] = mask & ((~UINT64_C(0)) >> ((~max + 1) % 64));
+    } else {
+        for (uint32_t value = min; value < max; value += step) {
+            bitset_container_add(bitset, value);
+        }
+    }
+}
+
+/* Free memory. */
+void bitset_container_free(bitset_container_t *bitset) {
+    if (bitset == NULL) return;
+    roaring_aligned_free(bitset->words);
+    roaring_free(bitset);
+}
+
+/* duplicate container. */
+ALLOW_UNALIGNED
+bitset_container_t *bitset_container_clone(const bitset_container_t *src) {
+    bitset_container_t *bitset =
+        (bitset_container_t *)roaring_malloc(sizeof(bitset_container_t));
+
+    if (!bitset) {
+        return NULL;
+    }
+
+    size_t align_size = 32;
+#if CROARING_IS_X64
+    if (croaring_hardware_support() & ROARING_SUPPORTS_AVX512) {
+        // sizeof(__m512i) == 64
+        align_size = 64;
+    } else {
+        // sizeof(__m256i) == 32
+        align_size = 32;
+    }
+#endif
+    bitset->words = (uint64_t *)roaring_aligned_malloc(
+        align_size, sizeof(uint64_t) * BITSET_CONTAINER_SIZE_IN_WORDS);
+    if (!bitset->words) {
+        roaring_free(bitset);
+        return NULL;
+    }
+    bitset->cardinality = src->cardinality;
+    memcpy(bitset->words, src->words,
+        sizeof(uint64_t) * BITSET_CONTAINER_SIZE_IN_WORDS);
+    return bitset;
+}
+
+void bitset_container_offset(const bitset_container_t *c, container_t **loc,
+    container_t **hic, uint16_t offset) {
+    bitset_container_t *bc = NULL;
+    uint64_t val;
+    uint16_t b, i, end;
+
+    b = offset >> 6;
+    i = offset % 64;
+    end = 1024 - b;
+
+    if (loc != NULL) {
+        bc = bitset_container_create();
+        if (i == 0) {
+            memcpy(bc->words + b, c->words, 8 * end);
+        } else {
+            bc->words[b] = c->words[0] << i;
+            for (uint32_t k = 1; k < end; ++k) {
+                val = c->words[k] << i;
+                val |= c->words[k - 1] >> (64 - i);
+                bc->words[b + k] = val;
+            }
+        }
+
+        bc->cardinality = bitset_container_compute_cardinality(bc);
+        if (bc->cardinality != 0) {
+            *loc = bc;
+        }
+        if (bc->cardinality == c->cardinality) {
+            return;
+        }
+    }
+
+    if (hic == NULL) {
+        // Both hic and loc can't be NULL, so bc is never NULL here
+        if (bc->cardinality == 0) {
+            bitset_container_free(bc);
+        }
+        return;
+    }
+
+    if (bc == NULL || bc->cardinality != 0) {
+        bc = bitset_container_create();
+    }
+
+    if (i == 0) {
+        memcpy(bc->words, c->words + end, 8 * b);
+    } else {
+        for (uint32_t k = end; k < 1024; ++k) {
+            val = c->words[k] << i;
+            val |= c->words[k - 1] >> (64 - i);
+            bc->words[k - end] = val;
+        }
+        bc->words[b] = c->words[1023] >> (64 - i);
+    }
+
+    bc->cardinality = bitset_container_compute_cardinality(bc);
+    if (bc->cardinality == 0) {
+        bitset_container_free(bc);
+        return;
+    }
+    *hic = bc;
+}
+
+void bitset_container_set_range(bitset_container_t *bitset, uint32_t begin,
+    uint32_t end) {
+    bitset_set_range(bitset->words, begin, end);
+    bitset->cardinality =
+        bitset_container_compute_cardinality(bitset);  // could be smarter
+}
+
+bool bitset_container_intersect(const bitset_container_t *src_1,
+    const bitset_container_t *src_2) {
+    // could vectorize, but this is probably already quite fast in practice
+    const uint64_t *__restrict__ words_1 = src_1->words;
+    const uint64_t *__restrict__ words_2 = src_2->words;
+    for (int i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i++) {
+        if ((words_1[i] & words_2[i]) != 0) return true;
+    }
+    return false;
+}
+
+#if CROARING_IS_X64
+#ifndef CROARING_WORDS_IN_AVX2_REG
+#define CROARING_WORDS_IN_AVX2_REG sizeof(__m256i) / sizeof(uint64_t)
+#endif
+#ifndef WORDS_IN_AVX512_REG
+#define WORDS_IN_AVX512_REG sizeof(__m512i) / sizeof(uint64_t)
+#endif
+/* Get the number of bits set (force computation) */
+static inline int _scalar_bitset_container_compute_cardinality(
+    const bitset_container_t *bitset) {
+    const uint64_t *words = bitset->words;
+    int32_t sum = 0;
+    for (int i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 4) {
+        sum += roaring_hamming(words[i]);
+        sum += roaring_hamming(words[i + 1]);
+        sum += roaring_hamming(words[i + 2]);
+        sum += roaring_hamming(words[i + 3]);
+    }
+    return sum;
+}
+/* Get the number of bits set (force computation) */
+int bitset_container_compute_cardinality(const bitset_container_t *bitset) {
+    int support = croaring_hardware_support();
+#if CROARING_COMPILER_SUPPORTS_AVX512
+    if (support & ROARING_SUPPORTS_AVX512) {
+        return (int)avx512_vpopcount(
+            (const __m512i *)bitset->words,
+            BITSET_CONTAINER_SIZE_IN_WORDS / (WORDS_IN_AVX512_REG));
+    } else
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+        if (support & ROARING_SUPPORTS_AVX2) {
+            return (int)avx2_harley_seal_popcount256(
+                (const __m256i *)bitset->words,
+                BITSET_CONTAINER_SIZE_IN_WORDS / (CROARING_WORDS_IN_AVX2_REG));
+        } else {
+            return _scalar_bitset_container_compute_cardinality(bitset);
+        }
+}
+
+#elif defined(CROARING_USENEON)
+int bitset_container_compute_cardinality(const bitset_container_t *bitset) {
+    uint16x8_t n0 = vdupq_n_u16(0);
+    uint16x8_t n1 = vdupq_n_u16(0);
+    uint16x8_t n2 = vdupq_n_u16(0);
+    uint16x8_t n3 = vdupq_n_u16(0);
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 8) {
+        uint64x2_t c0 = vld1q_u64(&bitset->words[i + 0]);
+        n0 = vaddq_u16(n0, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c0))));
+        uint64x2_t c1 = vld1q_u64(&bitset->words[i + 2]);
+        n1 = vaddq_u16(n1, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c1))));
+        uint64x2_t c2 = vld1q_u64(&bitset->words[i + 4]);
+        n2 = vaddq_u16(n2, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c2))));
+        uint64x2_t c3 = vld1q_u64(&bitset->words[i + 6]);
+        n3 = vaddq_u16(n3, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c3))));
+    }
+    uint64x2_t n = vdupq_n_u64(0);
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n0)));
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n1)));
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n2)));
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n3)));
+    return vgetq_lane_u64(n, 0) + vgetq_lane_u64(n, 1);
+}
+
+#else  // CROARING_IS_X64
+
+/* Get the number of bits set (force computation) */
+int bitset_container_compute_cardinality(const bitset_container_t *bitset) {
+    const uint64_t *words = bitset->words;
+    int32_t sum = 0;
+    for (int i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 4) {
+        sum += roaring_hamming(words[i]);
+        sum += roaring_hamming(words[i + 1]);
+        sum += roaring_hamming(words[i + 2]);
+        sum += roaring_hamming(words[i + 3]);
+    }
+    return sum;
+}
+
+#endif  // CROARING_IS_X64
+
+#if CROARING_IS_X64
+
+#define CROARING_BITSET_CONTAINER_FN_REPEAT 8
+#ifndef WORDS_IN_AVX512_REG
+#define WORDS_IN_AVX512_REG sizeof(__m512i) / sizeof(uint64_t)
+#endif  // WORDS_IN_AVX512_REG
+
+/* Computes a binary operation (eg union) on bitset1 and bitset2 and write the
+   result to bitsetout */
+// clang-format off
+#define CROARING_AVX512_BITSET_CONTAINER_FN1(before, opname, opsymbol, avx_intrinsic,   \
+                                neon_intrinsic, after)                         \
+  static inline int _avx512_bitset_container_##opname##_nocard(                \
+      const bitset_container_t *src_1, const bitset_container_t *src_2,        \
+      bitset_container_t *dst) {                                               \
+    const uint8_t * __restrict__ words_1 = (const uint8_t *)src_1->words;      \
+    const uint8_t * __restrict__ words_2 = (const uint8_t *)src_2->words;      \
+    /* not using the blocking optimization for some reason*/                   \
+    uint8_t *out = (uint8_t*)dst->words;                                       \
+    const int innerloop = 8;                                                   \
+    for (size_t i = 0;                                                         \
+        i < BITSET_CONTAINER_SIZE_IN_WORDS / (WORDS_IN_AVX512_REG);            \
+                                                         i+=innerloop) {       \
+        __m512i A1, A2, AO;                                                    \
+        A1 = _mm512_loadu_si512((const __m512i *)(words_1));                   \
+        A2 = _mm512_loadu_si512((const __m512i *)(words_2));                   \
+        AO = avx_intrinsic(A2, A1);                                            \
+        _mm512_storeu_si512((__m512i *)out, AO);                               \
+        A1 = _mm512_loadu_si512((const __m512i *)(words_1 + 64));              \
+        A2 = _mm512_loadu_si512((const __m512i *)(words_2 + 64));              \
+        AO = avx_intrinsic(A2, A1);                                            \
+        _mm512_storeu_si512((__m512i *)(out+64), AO);                          \
+        A1 = _mm512_loadu_si512((const __m512i *)(words_1 + 128));             \
+        A2 = _mm512_loadu_si512((const __m512i *)(words_2 + 128));             \
+        AO = avx_intrinsic(A2, A1);                                            \
+        _mm512_storeu_si512((__m512i *)(out+128), AO);                         \
+        A1 = _mm512_loadu_si512((const __m512i *)(words_1 + 192));             \
+        A2 = _mm512_loadu_si512((const __m512i *)(words_2 + 192));             \
+        AO = avx_intrinsic(A2, A1);                                            \
+        _mm512_storeu_si512((__m512i *)(out+192), AO);                         \
+        A1 = _mm512_loadu_si512((const __m512i *)(words_1 + 256));             \
+        A2 = _mm512_loadu_si512((const __m512i *)(words_2 + 256));             \
+        AO = avx_intrinsic(A2, A1);                                            \
+        _mm512_storeu_si512((__m512i *)(out+256), AO);                         \
+        A1 = _mm512_loadu_si512((const __m512i *)(words_1 + 320));             \
+        A2 = _mm512_loadu_si512((const __m512i *)(words_2 + 320));             \
+        AO = avx_intrinsic(A2, A1);                                            \
+        _mm512_storeu_si512((__m512i *)(out+320), AO);                         \
+        A1 = _mm512_loadu_si512((const __m512i *)(words_1 + 384));             \
+        A2 = _mm512_loadu_si512((const __m512i *)(words_2 + 384));             \
+        AO = avx_intrinsic(A2, A1);                                            \
+        _mm512_storeu_si512((__m512i *)(out+384), AO);                         \
+        A1 = _mm512_loadu_si512((const __m512i *)(words_1 + 448));             \
+        A2 = _mm512_loadu_si512((const __m512i *)(words_2 + 448));             \
+        AO = avx_intrinsic(A2, A1);                                     \
+        _mm512_storeu_si512((__m512i *)(out+448), AO);                  \
+        out+=512;                                                       \
+        words_1 += 512;                                                 \
+        words_2 += 512;                                                 \
+    }                                                                   \
+    dst->cardinality = BITSET_UNKNOWN_CARDINALITY;                      \
+    return dst->cardinality;                                            \
+  }
+
+#define CROARING_AVX512_BITSET_CONTAINER_FN2(before, opname, opsymbol, avx_intrinsic,           \
+                                neon_intrinsic, after)                                 \
+  /* next, a version that updates cardinality*/                                        \
+  static inline int _avx512_bitset_container_##opname(const bitset_container_t *src_1, \
+                                      const bitset_container_t *src_2,                 \
+                                      bitset_container_t *dst) {                       \
+    const __m512i * __restrict__ words_1 = (const __m512i *) src_1->words;             \
+    const __m512i * __restrict__ words_2 = (const __m512i *) src_2->words;             \
+    __m512i *out = (__m512i *) dst->words;                                             \
+    dst->cardinality = (int32_t)avx512_harley_seal_popcount512andstore_##opname(words_2,\
+				words_1, out,BITSET_CONTAINER_SIZE_IN_WORDS / (WORDS_IN_AVX512_REG));           \
+    return dst->cardinality;                                                            \
+  }
+
+#define CROARING_AVX512_BITSET_CONTAINER_FN3(before, opname, opsymbol, avx_intrinsic,            \
+                                neon_intrinsic, after)                                  \
+  /* next, a version that just computes the cardinality*/                               \
+  static inline int _avx512_bitset_container_##opname##_justcard(                       \
+      const bitset_container_t *src_1, const bitset_container_t *src_2) {               \
+    const __m512i * __restrict__ data1 = (const __m512i *) src_1->words;                \
+    const __m512i * __restrict__ data2 = (const __m512i *) src_2->words;                \
+    return (int)avx512_harley_seal_popcount512_##opname(data2,                          \
+				data1, BITSET_CONTAINER_SIZE_IN_WORDS / (WORDS_IN_AVX512_REG));                 \
+  }
+
+
+// we duplicate the function because other containers use the "or" term, makes API more consistent
+#if CROARING_COMPILER_SUPPORTS_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX512, or,    |, _mm512_or_si512, vorrq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX512, union, |, _mm512_or_si512, vorrq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+
+// we duplicate the function because other containers use the "intersection" term, makes API more consistent
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX512, and,          &, _mm512_and_si512, vandq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX512, intersection, &, _mm512_and_si512, vandq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX512, xor,    ^,  _mm512_xor_si512,    veorq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX512, andnot, &~, _mm512_andnot_si512, vbicq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+
+// we duplicate the function because other containers use the "or" term, makes API more consistent
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX512, or,    |, _mm512_or_si512, vorrq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX512, union, |, _mm512_or_si512, vorrq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+
+// we duplicate the function because other containers use the "intersection" term, makes API more consistent
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX512, and,          &, _mm512_and_si512, vandq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX512, intersection, &, _mm512_and_si512, vandq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX512, xor,    ^,  _mm512_xor_si512,    veorq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX512, andnot, &~, _mm512_andnot_si512, vbicq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+
+// we duplicate the function because other containers use the "or" term, makes API more consistent
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX512, or,    |, _mm512_or_si512, vorrq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX512, union, |, _mm512_or_si512, vorrq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+
+// we duplicate the function because other containers use the "intersection" term, makes API more consistent
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX512, and,          &, _mm512_and_si512, vandq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX512, intersection, &, _mm512_and_si512, vandq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX512, xor,    ^,  _mm512_xor_si512,    veorq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+CROARING_TARGET_AVX512
+CROARING_AVX512_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX512, andnot, &~, _mm512_andnot_si512, vbicq_u64, CROARING_UNTARGET_AVX512)
+CROARING_UNTARGET_AVX512
+#endif // CROARING_COMPILER_SUPPORTS_AVX512
+
+#ifndef CROARING_WORDS_IN_AVX2_REG
+#define CROARING_WORDS_IN_AVX2_REG sizeof(__m256i) / sizeof(uint64_t)
+#endif // CROARING_WORDS_IN_AVX2_REG
+#define CROARING_LOOP_SIZE                    \
+    BITSET_CONTAINER_SIZE_IN_WORDS / \
+        ((CROARING_WORDS_IN_AVX2_REG)*CROARING_BITSET_CONTAINER_FN_REPEAT)
+
+/* Computes a binary operation (eg union) on bitset1 and bitset2 and write the
+   result to bitsetout */
+// clang-format off
+#define CROARING_AVX_BITSET_CONTAINER_FN1(before, opname, opsymbol, avx_intrinsic,               \
+                                neon_intrinsic, after)                                \
+  static inline int _avx2_bitset_container_##opname##_nocard(                                \
+      const bitset_container_t *src_1, const bitset_container_t *src_2,        \
+      bitset_container_t *dst) {                                               \
+    const uint8_t *__restrict__ words_1 = (const uint8_t *)src_1->words;       \
+    const uint8_t *__restrict__ words_2 = (const uint8_t *)src_2->words;       \
+    /* not using the blocking optimization for some reason*/                   \
+    uint8_t *out = (uint8_t *)dst->words;                                      \
+    const int innerloop = 8;                                                   \
+    for (size_t i = 0;                                                         \
+         i < BITSET_CONTAINER_SIZE_IN_WORDS / (CROARING_WORDS_IN_AVX2_REG);             \
+         i += innerloop) {                                                     \
+      __m256i A1, A2, AO;                                                      \
+      A1 = _mm256_lddqu_si256((const __m256i *)(words_1));                     \
+      A2 = _mm256_lddqu_si256((const __m256i *)(words_2));                     \
+      AO = avx_intrinsic(A2, A1);                                              \
+      _mm256_storeu_si256((__m256i *)out, AO);                                 \
+      A1 = _mm256_lddqu_si256((const __m256i *)(words_1 + 32));                \
+      A2 = _mm256_lddqu_si256((const __m256i *)(words_2 + 32));                \
+      AO = avx_intrinsic(A2, A1);                                              \
+      _mm256_storeu_si256((__m256i *)(out + 32), AO);                          \
+      A1 = _mm256_lddqu_si256((const __m256i *)(words_1 + 64));                \
+      A2 = _mm256_lddqu_si256((const __m256i *)(words_2 + 64));                \
+      AO = avx_intrinsic(A2, A1);                                              \
+      _mm256_storeu_si256((__m256i *)(out + 64), AO);                          \
+      A1 = _mm256_lddqu_si256((const __m256i *)(words_1 + 96));                \
+      A2 = _mm256_lddqu_si256((const __m256i *)(words_2 + 96));                \
+      AO = avx_intrinsic(A2, A1);                                              \
+      _mm256_storeu_si256((__m256i *)(out + 96), AO);                          \
+      A1 = _mm256_lddqu_si256((const __m256i *)(words_1 + 128));               \
+      A2 = _mm256_lddqu_si256((const __m256i *)(words_2 + 128));               \
+      AO = avx_intrinsic(A2, A1);                                              \
+      _mm256_storeu_si256((__m256i *)(out + 128), AO);                         \
+      A1 = _mm256_lddqu_si256((const __m256i *)(words_1 + 160));               \
+      A2 = _mm256_lddqu_si256((const __m256i *)(words_2 + 160));               \
+      AO = avx_intrinsic(A2, A1);                                              \
+      _mm256_storeu_si256((__m256i *)(out + 160), AO);                         \
+      A1 = _mm256_lddqu_si256((const __m256i *)(words_1 + 192));               \
+      A2 = _mm256_lddqu_si256((const __m256i *)(words_2 + 192));               \
+      AO = avx_intrinsic(A2, A1);                                              \
+      _mm256_storeu_si256((__m256i *)(out + 192), AO);                         \
+      A1 = _mm256_lddqu_si256((const __m256i *)(words_1 + 224));               \
+      A2 = _mm256_lddqu_si256((const __m256i *)(words_2 + 224));               \
+      AO = avx_intrinsic(A2, A1);                                              \
+      _mm256_storeu_si256((__m256i *)(out + 224), AO);                         \
+      out += 256;                                                              \
+      words_1 += 256;                                                          \
+      words_2 += 256;                                                          \
+    }                                                                          \
+    dst->cardinality = BITSET_UNKNOWN_CARDINALITY;                             \
+    return dst->cardinality;                                                   \
+  }
+
+#define CROARING_AVX_BITSET_CONTAINER_FN2(before, opname, opsymbol, avx_intrinsic,               \
+                                neon_intrinsic, after)                                \
+  /* next, a version that updates cardinality*/                                \
+  static inline int _avx2_bitset_container_##opname(const bitset_container_t *src_1,         \
+                                      const bitset_container_t *src_2,         \
+                                      bitset_container_t *dst) {               \
+    const __m256i *__restrict__ words_1 = (const __m256i *)src_1->words;       \
+    const __m256i *__restrict__ words_2 = (const __m256i *)src_2->words;       \
+    __m256i *out = (__m256i *)dst->words;                                      \
+    dst->cardinality = (int32_t)avx2_harley_seal_popcount256andstore_##opname( \
+        words_2, words_1, out,                                                 \
+        BITSET_CONTAINER_SIZE_IN_WORDS / (CROARING_WORDS_IN_AVX2_REG));                 \
+    return dst->cardinality;                                                   \
+  }                                                                            \
+
+#define CROARING_AVX_BITSET_CONTAINER_FN3(before, opname, opsymbol, avx_intrinsic,               \
+                                neon_intrinsic, after)                                \
+  /* next, a version that just computes the cardinality*/                      \
+  static inline int _avx2_bitset_container_##opname##_justcard(                              \
+      const bitset_container_t *src_1, const bitset_container_t *src_2) {      \
+    const __m256i *__restrict__ data1 = (const __m256i *)src_1->words;         \
+    const __m256i *__restrict__ data2 = (const __m256i *)src_2->words;         \
+    return (int)avx2_harley_seal_popcount256_##opname(                         \
+        data2, data1, BITSET_CONTAINER_SIZE_IN_WORDS / (CROARING_WORDS_IN_AVX2_REG));   \
+  }
+
+
+// we duplicate the function because other containers use the "or" term, makes API more consistent
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX2, or,    |, _mm256_or_si256, vorrq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX2, union, |, _mm256_or_si256, vorrq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+
+// we duplicate the function because other containers use the "intersection" term, makes API more consistent
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX2, and,          &, _mm256_and_si256, vandq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX2, intersection, &, _mm256_and_si256, vandq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX2, xor,    ^,  _mm256_xor_si256,    veorq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN1(CROARING_TARGET_AVX2, andnot, &~, _mm256_andnot_si256, vbicq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+
+// we duplicate the function because other containers use the "or" term, makes API more consistent
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX2, or,    |, _mm256_or_si256, vorrq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX2, union, |, _mm256_or_si256, vorrq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+
+// we duplicate the function because other containers use the "intersection" term, makes API more consistent
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX2, and,          &, _mm256_and_si256, vandq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX2, intersection, &, _mm256_and_si256, vandq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX2, xor,    ^,  _mm256_xor_si256,    veorq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN2(CROARING_TARGET_AVX2, andnot, &~, _mm256_andnot_si256, vbicq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+
+// we duplicate the function because other containers use the "or" term, makes API more consistent
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX2, or,    |, _mm256_or_si256, vorrq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX2, union, |, _mm256_or_si256, vorrq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+
+// we duplicate the function because other containers use the "intersection" term, makes API more consistent
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX2, and,          &, _mm256_and_si256, vandq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX2, intersection, &, _mm256_and_si256, vandq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX2, xor,    ^,  _mm256_xor_si256,    veorq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+CROARING_TARGET_AVX2
+CROARING_AVX_BITSET_CONTAINER_FN3(CROARING_TARGET_AVX2, andnot, &~, _mm256_andnot_si256, vbicq_u64, CROARING_UNTARGET_AVX2)
+CROARING_UNTARGET_AVX2
+
+
+#define SCALAR_BITSET_CONTAINER_FN(opname, opsymbol, avx_intrinsic,            \
+                                   neon_intrinsic)                             \
+  static inline int _scalar_bitset_container_##opname(const bitset_container_t *src_1,       \
+                                        const bitset_container_t *src_2,       \
+                                        bitset_container_t *dst) {             \
+    const uint64_t *__restrict__ words_1 = src_1->words;                       \
+    const uint64_t *__restrict__ words_2 = src_2->words;                       \
+    uint64_t *out = dst->words;                                                \
+    int32_t sum = 0;                                                           \
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 2) {           \
+      const uint64_t word_1 = (words_1[i])opsymbol(words_2[i]),                \
+                     word_2 = (words_1[i + 1]) opsymbol(words_2[i + 1]);       \
+      out[i] = word_1;                                                         \
+      out[i + 1] = word_2;                                                     \
+      sum += roaring_hamming(word_1);                                                  \
+      sum += roaring_hamming(word_2);                                                  \
+    }                                                                          \
+    dst->cardinality = sum;                                                    \
+    return dst->cardinality;                                                   \
+  }                                                                            \
+  static inline int _scalar_bitset_container_##opname##_nocard(                              \
+      const bitset_container_t *src_1, const bitset_container_t *src_2,        \
+      bitset_container_t *dst) {                                               \
+    const uint64_t *__restrict__ words_1 = src_1->words;                       \
+    const uint64_t *__restrict__ words_2 = src_2->words;                       \
+    uint64_t *out = dst->words;                                                \
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i++) {              \
+      out[i] = (words_1[i])opsymbol(words_2[i]);                               \
+    }                                                                          \
+    dst->cardinality = BITSET_UNKNOWN_CARDINALITY;                             \
+    return dst->cardinality;                                                   \
+  }                                                                            \
+  static inline int _scalar_bitset_container_##opname##_justcard(                            \
+      const bitset_container_t *src_1, const bitset_container_t *src_2) {      \
+    const uint64_t *__restrict__ words_1 = src_1->words;                       \
+    const uint64_t *__restrict__ words_2 = src_2->words;                       \
+    int32_t sum = 0;                                                           \
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 2) {           \
+      const uint64_t word_1 = (words_1[i])opsymbol(words_2[i]),                \
+                     word_2 = (words_1[i + 1]) opsymbol(words_2[i + 1]);       \
+      sum += roaring_hamming(word_1);                                                  \
+      sum += roaring_hamming(word_2);                                                  \
+    }                                                                          \
+    return sum;                                                                \
+  }
+
+// we duplicate the function because other containers use the "or" term, makes API more consistent
+SCALAR_BITSET_CONTAINER_FN(or,    |, _mm256_or_si256, vorrq_u64)
+SCALAR_BITSET_CONTAINER_FN(union, |, _mm256_or_si256, vorrq_u64)
+
+// we duplicate the function because other containers use the "intersection" term, makes API more consistent
+SCALAR_BITSET_CONTAINER_FN(and,          &, _mm256_and_si256, vandq_u64)
+SCALAR_BITSET_CONTAINER_FN(intersection, &, _mm256_and_si256, vandq_u64)
+
+SCALAR_BITSET_CONTAINER_FN(xor,    ^,  _mm256_xor_si256,    veorq_u64)
+SCALAR_BITSET_CONTAINER_FN(andnot, &~, _mm256_andnot_si256, vbicq_u64)
+
+#if CROARING_COMPILER_SUPPORTS_AVX512
+#define CROARING_BITSET_CONTAINER_FN(opname, opsymbol, avx_intrinsic, neon_intrinsic)   \
+  int bitset_container_##opname(const bitset_container_t *src_1,               \
+                                const bitset_container_t *src_2,               \
+                                bitset_container_t *dst) {                     \
+    int support = croaring_hardware_support();                                 \
+    if ( support & ROARING_SUPPORTS_AVX512 ) {                                 \
+      return _avx512_bitset_container_##opname(src_1, src_2, dst);             \
+    }                                                                          \
+    else if ( support & ROARING_SUPPORTS_AVX2 ) {                              \
+      return _avx2_bitset_container_##opname(src_1, src_2, dst);               \
+    } else {                                                                   \
+      return _scalar_bitset_container_##opname(src_1, src_2, dst);             \
+    }                                                                          \
+  }                                                                            \
+  int bitset_container_##opname##_nocard(const bitset_container_t *src_1,      \
+                                         const bitset_container_t *src_2,      \
+                                         bitset_container_t *dst) {            \
+    int support = croaring_hardware_support();                                 \
+    if ( support & ROARING_SUPPORTS_AVX512 ) {                                 \
+      return _avx512_bitset_container_##opname##_nocard(src_1, src_2, dst);    \
+    }                                                                          \
+    else if ( support & ROARING_SUPPORTS_AVX2 ) {                              \
+      return _avx2_bitset_container_##opname##_nocard(src_1, src_2, dst);      \
+    } else {                                                                   \
+      return _scalar_bitset_container_##opname##_nocard(src_1, src_2, dst);    \
+    }                                                                          \
+  }                                                                            \
+  int bitset_container_##opname##_justcard(const bitset_container_t *src_1,    \
+                                           const bitset_container_t *src_2) {  \
+     int support = croaring_hardware_support();                                \
+    if ( support & ROARING_SUPPORTS_AVX512 ) {                                 \
+      return _avx512_bitset_container_##opname##_justcard(src_1, src_2);       \
+    }                                                                          \
+    else if ( support & ROARING_SUPPORTS_AVX2 ) {                              \
+      return _avx2_bitset_container_##opname##_justcard(src_1, src_2);         \
+    } else {                                                                   \
+      return _scalar_bitset_container_##opname##_justcard(src_1, src_2);       \
+    }                                                                          \
+  }
+
+#else // CROARING_COMPILER_SUPPORTS_AVX512
+
+
+#define CROARING_BITSET_CONTAINER_FN(opname, opsymbol, avx_intrinsic, neon_intrinsic)   \
+  int bitset_container_##opname(const bitset_container_t *src_1,               \
+                                const bitset_container_t *src_2,               \
+                                bitset_container_t *dst) {                     \
+    if ( croaring_hardware_support() & ROARING_SUPPORTS_AVX2 ) {               \
+      return _avx2_bitset_container_##opname(src_1, src_2, dst);               \
+    } else {                                                                   \
+      return _scalar_bitset_container_##opname(src_1, src_2, dst);             \
+    }                                                                          \
+  }                                                                            \
+  int bitset_container_##opname##_nocard(const bitset_container_t *src_1,      \
+                                         const bitset_container_t *src_2,      \
+                                         bitset_container_t *dst) {            \
+    if ( croaring_hardware_support() & ROARING_SUPPORTS_AVX2 ) {               \
+      return _avx2_bitset_container_##opname##_nocard(src_1, src_2, dst);      \
+    } else {                                                                   \
+      return _scalar_bitset_container_##opname##_nocard(src_1, src_2, dst);    \
+    }                                                                          \
+  }                                                                            \
+  int bitset_container_##opname##_justcard(const bitset_container_t *src_1,    \
+                                           const bitset_container_t *src_2) {  \
+    if ( croaring_hardware_support() & ROARING_SUPPORTS_AVX2 ) {               \
+      return _avx2_bitset_container_##opname##_justcard(src_1, src_2);         \
+    } else {                                                                   \
+      return _scalar_bitset_container_##opname##_justcard(src_1, src_2);       \
+    }                                                                          \
+  }
+
+#endif //  CROARING_COMPILER_SUPPORTS_AVX512
+
+#elif defined(CROARING_USENEON)
+
+#define CROARING_BITSET_CONTAINER_FN(opname, opsymbol, avx_intrinsic, neon_intrinsic)  \
+int bitset_container_##opname(const bitset_container_t *src_1,                \
+                              const bitset_container_t *src_2,                \
+                              bitset_container_t *dst) {                      \
+    const uint64_t * __restrict__ words_1 = src_1->words;                     \
+    const uint64_t * __restrict__ words_2 = src_2->words;                     \
+    uint64_t *out = dst->words;                                               \
+    uint16x8_t n0 = vdupq_n_u16(0);                                           \
+    uint16x8_t n1 = vdupq_n_u16(0);                                           \
+    uint16x8_t n2 = vdupq_n_u16(0);                                           \
+    uint16x8_t n3 = vdupq_n_u16(0);                                           \
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 8) {          \
+        uint64x2_t c0 = neon_intrinsic(vld1q_u64(&words_1[i + 0]),            \
+                                       vld1q_u64(&words_2[i + 0]));           \
+        n0 = vaddq_u16(n0, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c0))));   \
+        vst1q_u64(&out[i + 0], c0);                                           \
+        uint64x2_t c1 = neon_intrinsic(vld1q_u64(&words_1[i + 2]),            \
+                                       vld1q_u64(&words_2[i + 2]));           \
+        n1 = vaddq_u16(n1, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c1))));   \
+        vst1q_u64(&out[i + 2], c1);                                           \
+        uint64x2_t c2 = neon_intrinsic(vld1q_u64(&words_1[i + 4]),            \
+                                       vld1q_u64(&words_2[i + 4]));           \
+        n2 = vaddq_u16(n2, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c2))));   \
+        vst1q_u64(&out[i + 4], c2);                                           \
+        uint64x2_t c3 = neon_intrinsic(vld1q_u64(&words_1[i + 6]),            \
+                                       vld1q_u64(&words_2[i + 6]));           \
+        n3 = vaddq_u16(n3, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c3))));   \
+        vst1q_u64(&out[i + 6], c3);                                           \
+    }                                                                         \
+    uint64x2_t n = vdupq_n_u64(0);                                            \
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n0)));                           \
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n1)));                           \
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n2)));                           \
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n3)));                           \
+    dst->cardinality = vgetq_lane_u64(n, 0) + vgetq_lane_u64(n, 1);           \
+    return dst->cardinality;                                                  \
+}                                                                             \
+int bitset_container_##opname##_nocard(const bitset_container_t *src_1,       \
+                                       const bitset_container_t *src_2,       \
+                                             bitset_container_t *dst) {       \
+    const uint64_t * __restrict__ words_1 = src_1->words;                     \
+    const uint64_t * __restrict__ words_2 = src_2->words;                     \
+    uint64_t *out = dst->words;                                               \
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 8) {          \
+        vst1q_u64(&out[i + 0], neon_intrinsic(vld1q_u64(&words_1[i + 0]),     \
+                                              vld1q_u64(&words_2[i + 0])));   \
+        vst1q_u64(&out[i + 2], neon_intrinsic(vld1q_u64(&words_1[i + 2]),     \
+                                              vld1q_u64(&words_2[i + 2])));   \
+        vst1q_u64(&out[i + 4], neon_intrinsic(vld1q_u64(&words_1[i + 4]),     \
+                                              vld1q_u64(&words_2[i + 4])));   \
+        vst1q_u64(&out[i + 6], neon_intrinsic(vld1q_u64(&words_1[i + 6]),     \
+                                              vld1q_u64(&words_2[i + 6])));   \
+    }                                                                         \
+    dst->cardinality = BITSET_UNKNOWN_CARDINALITY;                            \
+    return dst->cardinality;                                                  \
+}                                                                             \
+int bitset_container_##opname##_justcard(const bitset_container_t *src_1,     \
+                                         const bitset_container_t *src_2) {   \
+    const uint64_t * __restrict__ words_1 = src_1->words;                     \
+    const uint64_t * __restrict__ words_2 = src_2->words;                     \
+    uint16x8_t n0 = vdupq_n_u16(0);                                           \
+    uint16x8_t n1 = vdupq_n_u16(0);                                           \
+    uint16x8_t n2 = vdupq_n_u16(0);                                           \
+    uint16x8_t n3 = vdupq_n_u16(0);                                           \
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 8) {          \
+        uint64x2_t c0 = neon_intrinsic(vld1q_u64(&words_1[i + 0]),            \
+                                       vld1q_u64(&words_2[i + 0]));           \
+        n0 = vaddq_u16(n0, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c0))));   \
+        uint64x2_t c1 = neon_intrinsic(vld1q_u64(&words_1[i + 2]),            \
+                                       vld1q_u64(&words_2[i + 2]));           \
+        n1 = vaddq_u16(n1, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c1))));   \
+        uint64x2_t c2 = neon_intrinsic(vld1q_u64(&words_1[i + 4]),            \
+                                       vld1q_u64(&words_2[i + 4]));           \
+        n2 = vaddq_u16(n2, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c2))));   \
+        uint64x2_t c3 = neon_intrinsic(vld1q_u64(&words_1[i + 6]),            \
+                                       vld1q_u64(&words_2[i + 6]));           \
+        n3 = vaddq_u16(n3, vpaddlq_u8(vcntq_u8(vreinterpretq_u8_u64(c3))));   \
+    }                                                                         \
+    uint64x2_t n = vdupq_n_u64(0);                                            \
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n0)));                           \
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n1)));                           \
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n2)));                           \
+    n = vaddq_u64(n, vpaddlq_u32(vpaddlq_u16(n3)));                           \
+    return vgetq_lane_u64(n, 0) + vgetq_lane_u64(n, 1);                       \
+}
+
+#else
+
+#define CROARING_BITSET_CONTAINER_FN(opname, opsymbol, avx_intrinsic, neon_intrinsic)  \
+int bitset_container_##opname(const bitset_container_t *src_1,            \
+                              const bitset_container_t *src_2,            \
+                              bitset_container_t *dst) {                  \
+    const uint64_t * __restrict__ words_1 = src_1->words;                 \
+    const uint64_t * __restrict__ words_2 = src_2->words;                 \
+    uint64_t *out = dst->words;                                           \
+    int32_t sum = 0;                                                      \
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 2) {      \
+        const uint64_t word_1 = (words_1[i])opsymbol(words_2[i]),         \
+                       word_2 = (words_1[i + 1])opsymbol(words_2[i + 1]); \
+        out[i] = word_1;                                                  \
+        out[i + 1] = word_2;                                              \
+        sum += roaring_hamming(word_1);                                    \
+        sum += roaring_hamming(word_2);                                    \
+    }                                                                     \
+    dst->cardinality = sum;                                               \
+    return dst->cardinality;                                              \
+}                                                                         \
+int bitset_container_##opname##_nocard(const bitset_container_t *src_1,   \
+                                       const bitset_container_t *src_2,   \
+                                       bitset_container_t *dst) {         \
+    const uint64_t * __restrict__ words_1 = src_1->words;                 \
+    const uint64_t * __restrict__ words_2 = src_2->words;                 \
+    uint64_t *out = dst->words;                                           \
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i++) {         \
+        out[i] = (words_1[i])opsymbol(words_2[i]);                        \
+    }                                                                     \
+    dst->cardinality = BITSET_UNKNOWN_CARDINALITY;                        \
+    return dst->cardinality;                                              \
+}                                                                         \
+int bitset_container_##opname##_justcard(const bitset_container_t *src_1, \
+                              const bitset_container_t *src_2) {          \
+   printf("A1\n"); const uint64_t * __restrict__ words_1 = src_1->words;                 \
+    const uint64_t * __restrict__ words_2 = src_2->words;                 \
+    int32_t sum = 0;                                                      \
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 2) {      \
+        const uint64_t word_1 = (words_1[i])opsymbol(words_2[i]),         \
+                       word_2 = (words_1[i + 1])opsymbol(words_2[i + 1]); \
+        sum += roaring_hamming(word_1);                                    \
+        sum += roaring_hamming(word_2);                                    \
+    }                                                                     \
+    return sum;                                                           \
+}
+
+#endif // CROARING_IS_X64
+
+// we duplicate the function because other containers use the "or" term, makes API more consistent
+CROARING_BITSET_CONTAINER_FN(or,    |, _mm256_or_si256, vorrq_u64)
+CROARING_BITSET_CONTAINER_FN(union, |, _mm256_or_si256, vorrq_u64)
+
+// we duplicate the function because other containers use the "intersection" term, makes API more consistent
+CROARING_BITSET_CONTAINER_FN(and,          &, _mm256_and_si256, vandq_u64)
+CROARING_BITSET_CONTAINER_FN(intersection, &, _mm256_and_si256, vandq_u64)
+
+CROARING_BITSET_CONTAINER_FN(xor,    ^,  _mm256_xor_si256,    veorq_u64)
+CROARING_BITSET_CONTAINER_FN(andnot, &~, _mm256_andnot_si256, vbicq_u64)
+// clang-format On
+
+
+ALLOW_UNALIGNED
+int bitset_container_to_uint32_array(
+    uint32_t *out,
+    const bitset_container_t *bc,
+    uint32_t base
+){
+#if CROARING_IS_X64
+   int support = croaring_hardware_support();
+#if CROARING_COMPILER_SUPPORTS_AVX512
+   if(( support & ROARING_SUPPORTS_AVX512 ) &&  (bc->cardinality >= 8192))  // heuristic
+		return (int) bitset_extract_setbits_avx512(bc->words,
+                BITSET_CONTAINER_SIZE_IN_WORDS, out, bc->cardinality, base);
+   else
+#endif
+   if(( support & ROARING_SUPPORTS_AVX2 ) &&  (bc->cardinality >= 8192))  // heuristic
+		return (int) bitset_extract_setbits_avx2(bc->words,
+                BITSET_CONTAINER_SIZE_IN_WORDS, out, bc->cardinality, base);
+	else
+		return (int) bitset_extract_setbits(bc->words,
+                BITSET_CONTAINER_SIZE_IN_WORDS, out, base);
+#else
+	return (int) bitset_extract_setbits(bc->words,
+                BITSET_CONTAINER_SIZE_IN_WORDS, out, base);
+#endif
+}
+
+/*
+ * Print this container using printf (useful for debugging).
+ */
+void bitset_container_printf(const bitset_container_t * v) {
+	printf("{");
+	uint32_t base = 0;
+	bool iamfirst = true;// TODO: rework so that this is not necessary yet still readable
+	for (int i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; ++i) {
+		uint64_t w = v->words[i];
+		while (w != 0) {
+			uint64_t t = w & (~w + 1);
+			int r = roaring_trailing_zeroes(w);
+			if(iamfirst) {// predicted to be false
+				printf("%u",base + r);
+				iamfirst = false;
+			} else {
+				printf(",%u",base + r);
+			}
+			w ^= t;
+		}
+		base += 64;
+	}
+	printf("}");
+}
+
+
+/*
+ * Print this container using printf as a comma-separated list of 32-bit integers starting at base.
+ */
+void bitset_container_printf_as_uint32_array(const bitset_container_t * v, uint32_t base) {
+	bool iamfirst = true;// TODO: rework so that this is not necessary yet still readable
+	for (int i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; ++i) {
+		uint64_t w = v->words[i];
+		while (w != 0) {
+			uint64_t t = w & (~w + 1);
+			int r = roaring_trailing_zeroes(w);
+			if(iamfirst) {// predicted to be false
+				printf("%u", r + base);
+				iamfirst = false;
+			} else {
+				printf(",%u",r + base);
+			}
+			w ^= t;
+		}
+		base += 64;
+	}
+}
+
+/*
+ * Validate the container. Returns true if valid.
+ */
+bool bitset_container_validate(const bitset_container_t *v, const char **reason) {
+    if (v->words == NULL) {
+        *reason = "words is NULL";
+        return false;
+    }
+    if (v->cardinality != bitset_container_compute_cardinality(v)) {
+        *reason = "cardinality is incorrect";
+        return false;
+    }
+    if (v->cardinality <= DEFAULT_MAX_SIZE) {
+        *reason = "cardinality is too small for a bitmap container";
+        return false;
+    }
+    // Attempt to forcibly load the first and last words, hopefully causing
+    // a segfault or an address sanitizer error if words is not allocated.
+    volatile uint64_t *words = v->words;
+    (void) words[0];
+    (void) words[BITSET_CONTAINER_SIZE_IN_WORDS - 1];
+    return true;
+}
+
+
+// TODO: use the fast lower bound, also
+int bitset_container_number_of_runs(bitset_container_t *bc) {
+  int num_runs = 0;
+  uint64_t next_word = bc->words[0];
+
+  for (int i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS-1; ++i) {
+    uint64_t word = next_word;
+    next_word = bc->words[i+1];
+    num_runs += roaring_hamming((~word) & (word << 1)) + ( (word >> 63) & ~next_word);
+  }
+
+  uint64_t word = next_word;
+  num_runs += roaring_hamming((~word) & (word << 1));
+  if((word & 0x8000000000000000ULL) != 0)
+    num_runs++;
+  return num_runs;
+}
+
+
+int32_t bitset_container_write(const bitset_container_t *container,
+                                  char *buf) {
+	memcpy(buf, container->words, BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t));
+	return bitset_container_size_in_bytes(container);
+}
+
+
+int32_t bitset_container_read(int32_t cardinality, bitset_container_t *container,
+		const char *buf)  {
+	container->cardinality = cardinality;
+	memcpy(container->words, buf, BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t));
+	return bitset_container_size_in_bytes(container);
+}
+
+bool bitset_container_iterate(const bitset_container_t *cont, uint32_t base, roaring_iterator iterator, void *ptr) {
+  for (int32_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; ++i ) {
+    uint64_t w = cont->words[i];
+    while (w != 0) {
+      uint64_t t = w & (~w + 1);
+      int r = roaring_trailing_zeroes(w);
+      if(!iterator(r + base, ptr)) return false;
+      w ^= t;
+    }
+    base += 64;
+  }
+  return true;
+}
+
+bool bitset_container_iterate64(const bitset_container_t *cont, uint32_t base, roaring_iterator64 iterator, uint64_t high_bits, void *ptr) {
+  for (int32_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; ++i ) {
+    uint64_t w = cont->words[i];
+    while (w != 0) {
+      uint64_t t = w & (~w + 1);
+      int r = roaring_trailing_zeroes(w);
+      if(!iterator(high_bits | (uint64_t)(r + base), ptr)) return false;
+      w ^= t;
+    }
+    base += 64;
+  }
+  return true;
+}
+
+#if CROARING_IS_X64
+#if CROARING_COMPILER_SUPPORTS_AVX512
+CROARING_TARGET_AVX512
+ALLOW_UNALIGNED
+static inline bool _avx512_bitset_container_equals(const bitset_container_t *container1, const bitset_container_t *container2) {
+  const __m512i *ptr1 = (const __m512i*)container1->words;
+  const __m512i *ptr2 = (const __m512i*)container2->words;
+  for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS*sizeof(uint64_t)/64; i++) {
+      __m512i r1 = _mm512_loadu_si512(ptr1+i);
+      __m512i r2 = _mm512_loadu_si512(ptr2+i);
+      __mmask64 mask = _mm512_cmpeq_epi8_mask(r1, r2);
+      if ((uint64_t)mask != UINT64_MAX) {
+          return false;
+      }
+  }
+	return true;
+}
+CROARING_UNTARGET_AVX512
+#endif // CROARING_COMPILER_SUPPORTS_AVX512
+CROARING_TARGET_AVX2
+ALLOW_UNALIGNED
+static inline bool _avx2_bitset_container_equals(const bitset_container_t *container1, const bitset_container_t *container2) {
+    const __m256i *ptr1 = (const __m256i*)container1->words;
+    const __m256i *ptr2 = (const __m256i*)container2->words;
+    for (size_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS*sizeof(uint64_t)/32; i++) {
+      __m256i r1 = _mm256_loadu_si256(ptr1+i);
+      __m256i r2 = _mm256_loadu_si256(ptr2+i);
+      int mask = _mm256_movemask_epi8(_mm256_cmpeq_epi8(r1, r2));
+      if ((uint32_t)mask != UINT32_MAX) {
+          return false;
+      }
+  }
+	return true;
+}
+CROARING_UNTARGET_AVX2
+#endif // CROARING_IS_X64
+
+ALLOW_UNALIGNED
+bool bitset_container_equals(const bitset_container_t *container1, const bitset_container_t *container2) {
+  if((container1->cardinality != BITSET_UNKNOWN_CARDINALITY) && (container2->cardinality != BITSET_UNKNOWN_CARDINALITY)) {
+    if(container1->cardinality != container2->cardinality) {
+      return false;
+    }
+    if (container1->cardinality == INT32_C(0x10000)) {
+      return true;
+    }
+  }
+#if CROARING_IS_X64
+  int support = croaring_hardware_support();
+#if CROARING_COMPILER_SUPPORTS_AVX512
+  if( support & ROARING_SUPPORTS_AVX512 ) {
+    return _avx512_bitset_container_equals(container1, container2);
+  }
+  else
+#endif
+  if( support & ROARING_SUPPORTS_AVX2 ) {
+    return _avx2_bitset_container_equals(container1, container2);
+  }
+#endif
+  return memcmp(container1->words,
+                container2->words,
+                BITSET_CONTAINER_SIZE_IN_WORDS*sizeof(uint64_t)) == 0;
+}
+
+bool bitset_container_is_subset(const bitset_container_t *container1,
+                          const bitset_container_t *container2) {
+    if((container1->cardinality != BITSET_UNKNOWN_CARDINALITY) && (container2->cardinality != BITSET_UNKNOWN_CARDINALITY)) {
+        if(container1->cardinality > container2->cardinality) {
+            return false;
+        }
+    }
+    for(int32_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; ++i ) {
+		if((container1->words[i] & container2->words[i]) != container1->words[i]) {
+			return false;
+		}
+	}
+	return true;
+}
+
+bool bitset_container_select(const bitset_container_t *container, uint32_t *start_rank, uint32_t rank, uint32_t *element) {
+    int card = bitset_container_cardinality(container);
+    if(rank >= *start_rank + card) {
+        *start_rank += card;
+        return false;
+    }
+    const uint64_t *words = container->words;
+    int32_t size;
+    for (int i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; i += 1) {
+        size = roaring_hamming(words[i]);
+        if(rank <= *start_rank + size) {
+            uint64_t w = container->words[i];
+            uint16_t base = i*64;
+            while (w != 0) {
+                uint64_t t = w & (~w + 1);
+                int r = roaring_trailing_zeroes(w);
+                if(*start_rank == rank) {
+                    *element = r+base;
+                    return true;
+                }
+                w ^= t;
+                *start_rank += 1;
+            }
+        }
+        else
+            *start_rank += size;
+    }
+    assert(false);
+    roaring_unreachable;
+}
+
+
+/* Returns the smallest value (assumes not empty) */
+uint16_t bitset_container_minimum(const bitset_container_t *container) {
+  for (int32_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; ++i ) {
+    uint64_t w = container->words[i];
+    if (w != 0) {
+      int r = roaring_trailing_zeroes(w);
+      return r + i * 64;
+    }
+  }
+  return UINT16_MAX;
+}
+
+/* Returns the largest value (assumes not empty) */
+uint16_t bitset_container_maximum(const bitset_container_t *container) {
+  for (int32_t i = BITSET_CONTAINER_SIZE_IN_WORDS - 1; i > 0; --i ) {
+    uint64_t w = container->words[i];
+    if (w != 0) {
+      int r = roaring_leading_zeroes(w);
+      return i * 64 + 63  - r;
+    }
+  }
+  return 0;
+}
+
+/* Returns the number of values equal or smaller than x */
+int bitset_container_rank(const bitset_container_t *container, uint16_t x) {
+  // credit: aqrit
+  int sum = 0;
+  int i = 0;
+  for (int end = x / 64; i < end; i++){
+    sum += roaring_hamming(container->words[i]);
+  }
+  uint64_t lastword = container->words[i];
+  uint64_t lastpos = UINT64_C(1) << (x % 64);
+  uint64_t mask = lastpos + lastpos - 1; // smear right
+  sum += roaring_hamming(lastword & mask);
+  return sum;
+}
+
+uint32_t bitset_container_rank_many(const bitset_container_t *container, uint64_t start_rank, const uint32_t* begin, const uint32_t* end, uint64_t* ans){
+  const uint16_t high = (uint16_t)((*begin) >> 16);
+  int i = 0;
+  int sum = 0;
+  const uint32_t* iter = begin;
+  for(; iter != end; iter++) {
+      uint32_t x = *iter;
+      uint16_t xhigh = (uint16_t)(x >> 16);
+      if(xhigh != high) return iter - begin; // stop at next container
+
+      uint16_t xlow = (uint16_t)x;
+      for(int count = xlow / 64; i < count; i++){
+        sum += roaring_hamming(container->words[i]);
+      }
+      uint64_t lastword = container->words[i];
+      uint64_t lastpos = UINT64_C(1) << (xlow % 64);
+      uint64_t mask = lastpos + lastpos - 1; // smear right
+      *(ans++) = start_rank + sum + roaring_hamming(lastword & mask);
+  }
+  return iter - begin;
+}
+
+
+/* Returns the index of x , if not exsist return -1 */
+int bitset_container_get_index(const bitset_container_t *container, uint16_t x) {
+  if (bitset_container_get(container, x)) {
+    // credit: aqrit
+    int sum = 0;
+    int i = 0;
+    for (int end = x / 64; i < end; i++){
+      sum += roaring_hamming(container->words[i]);
+    }
+    uint64_t lastword = container->words[i];
+    uint64_t lastpos = UINT64_C(1) << (x % 64);
+    uint64_t mask = lastpos + lastpos - 1; // smear right
+    sum += roaring_hamming(lastword & mask);
+    return sum - 1;
+  } else {
+    return -1;
+  }
+}
+
+/* Returns the index of the first value equal or larger than x, or -1 */
+int bitset_container_index_equalorlarger(const bitset_container_t *container, uint16_t x) {
+  uint32_t x32 = x;
+  uint32_t k = x32 / 64;
+  uint64_t word = container->words[k];
+  const int diff = x32 - k * 64; // in [0,64)
+  word = (word >> diff) << diff; // a mask is faster, but we don't care
+  while(word == 0) {
+    k++;
+    if(k == BITSET_CONTAINER_SIZE_IN_WORDS) return -1;
+    word = container->words[k];
+  }
+  return k * 64 + roaring_trailing_zeroes(word);
+}
+
+#ifdef __cplusplus
+} } }  // extern "C" { namespace roaring { namespace internal {
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic pop
+#endif/* end file src/containers/bitset.c */
+/* begin file src/containers/containers.c */
+
+
+#ifdef __cplusplus
+extern "C" {
+// In Windows MSVC C++ compiler, (type){init} does not compile,
+// it causes C4576: a parenthesized type followed by an initializer list is a
+// non-standard explicit type conversion syntax The correct syntax is type{init}
+#define ROARING_INIT_ROARING_CONTAINER_ITERATOR_T roaring_container_iterator_t
+namespace roaring {
+namespace internal {
+#else
+#define ROARING_INIT_ROARING_CONTAINER_ITERATOR_T (roaring_container_iterator_t)
+#endif
+
+static inline uint32_t minimum_uint32(uint32_t a, uint32_t b) {
+    return (a < b) ? a : b;
+}
+
+extern inline const container_t *container_unwrap_shared(
+    const container_t *candidate_shared_container, uint8_t *type);
+
+extern inline container_t *container_mutable_unwrap_shared(
+    container_t *candidate_shared_container, uint8_t *type);
+
+extern inline int container_get_cardinality(const container_t *c,
+                                            uint8_t typecode);
+
+extern inline container_t *container_iand(container_t *c1, uint8_t type1,
+                                          const container_t *c2, uint8_t type2,
+                                          uint8_t *result_type);
+
+extern inline container_t *container_ior(container_t *c1, uint8_t type1,
+                                         const container_t *c2, uint8_t type2,
+                                         uint8_t *result_type);
+
+extern inline container_t *container_ixor(container_t *c1, uint8_t type1,
+                                          const container_t *c2, uint8_t type2,
+                                          uint8_t *result_type);
+
+extern inline container_t *container_iandnot(container_t *c1, uint8_t type1,
+                                             const container_t *c2,
+                                             uint8_t type2,
+                                             uint8_t *result_type);
+
+void container_free(container_t *c, uint8_t type) {
+    switch (type) {
+        case BITSET_CONTAINER_TYPE:
+            bitset_container_free(CAST_bitset(c));
+            break;
+        case ARRAY_CONTAINER_TYPE:
+            array_container_free(CAST_array(c));
+            break;
+        case RUN_CONTAINER_TYPE:
+            run_container_free(CAST_run(c));
+            break;
+        case SHARED_CONTAINER_TYPE:
+            shared_container_free(CAST_shared(c));
+            break;
+        default:
+            assert(false);
+            roaring_unreachable;
+    }
+}
+
+void container_printf(const container_t *c, uint8_t type) {
+    c = container_unwrap_shared(c, &type);
+    switch (type) {
+        case BITSET_CONTAINER_TYPE:
+            bitset_container_printf(const_CAST_bitset(c));
+            return;
+        case ARRAY_CONTAINER_TYPE:
+            array_container_printf(const_CAST_array(c));
+            return;
+        case RUN_CONTAINER_TYPE:
+            run_container_printf(const_CAST_run(c));
+            return;
+        default:
+            roaring_unreachable;
+    }
+}
+
+void container_printf_as_uint32_array(const container_t *c, uint8_t typecode,
+                                      uint32_t base) {
+    c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE:
+            bitset_container_printf_as_uint32_array(const_CAST_bitset(c), base);
+            return;
+        case ARRAY_CONTAINER_TYPE:
+            array_container_printf_as_uint32_array(const_CAST_array(c), base);
+            return;
+        case RUN_CONTAINER_TYPE:
+            run_container_printf_as_uint32_array(const_CAST_run(c), base);
+            return;
+        default:
+            roaring_unreachable;
+    }
+}
+
+bool container_internal_validate(const container_t *container, uint8_t typecode,
+                                 const char **reason) {
+    if (container == NULL) {
+        *reason = "container is NULL";
+        return false;
+    }
+    // Not using container_unwrap_shared because it asserts if shared containers
+    // are nested
+    if (typecode == SHARED_CONTAINER_TYPE) {
+        const shared_container_t *shared_container =
+            const_CAST_shared(container);
+        if (croaring_refcount_get(&shared_container->counter) == 0) {
+            *reason = "shared container has zero refcount";
+            return false;
+        }
+        if (shared_container->typecode == SHARED_CONTAINER_TYPE) {
+            *reason = "shared container is nested";
+            return false;
+        }
+        if (shared_container->container == NULL) {
+            *reason = "shared container has NULL container";
+            return false;
+        }
+        container = shared_container->container;
+        typecode = shared_container->typecode;
+    }
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE:
+            return bitset_container_validate(const_CAST_bitset(container),
+                                             reason);
+        case ARRAY_CONTAINER_TYPE:
+            return array_container_validate(const_CAST_array(container),
+                                            reason);
+        case RUN_CONTAINER_TYPE:
+            return run_container_validate(const_CAST_run(container), reason);
+        default:
+            *reason = "invalid typecode";
+            return false;
+    }
+}
+
+extern inline bool container_nonzero_cardinality(const container_t *c,
+                                                 uint8_t typecode);
+
+extern inline int container_to_uint32_array(uint32_t *output,
+                                            const container_t *c,
+                                            uint8_t typecode, uint32_t base);
+
+extern inline container_t *container_add(container_t *c, uint16_t val,
+                                         uint8_t typecode,  // !!! 2nd arg?
+                                         uint8_t *new_typecode);
+
+extern inline bool container_contains(const container_t *c, uint16_t val,
+                                      uint8_t typecode);  // !!! 2nd arg?
+
+extern inline container_t *container_and(const container_t *c1, uint8_t type1,
+                                         const container_t *c2, uint8_t type2,
+                                         uint8_t *result_type);
+
+extern inline container_t *container_or(const container_t *c1, uint8_t type1,
+                                        const container_t *c2, uint8_t type2,
+                                        uint8_t *result_type);
+
+extern inline container_t *container_xor(const container_t *c1, uint8_t type1,
+                                         const container_t *c2, uint8_t type2,
+                                         uint8_t *result_type);
+
+container_t *get_copy_of_container(container_t *c, uint8_t *typecode,
+                                   bool copy_on_write) {
+    if (copy_on_write) {
+        shared_container_t *shared_container;
+        if (*typecode == SHARED_CONTAINER_TYPE) {
+            shared_container = CAST_shared(c);
+            croaring_refcount_inc(&shared_container->counter);
+            return shared_container;
+        }
+        assert(*typecode != SHARED_CONTAINER_TYPE);
+
+        if ((shared_container = (shared_container_t *)roaring_malloc(
+                 sizeof(shared_container_t))) == NULL) {
+            return NULL;
+        }
+
+        shared_container->container = c;
+        shared_container->typecode = *typecode;
+        // At this point, we are creating new shared container
+        // so there should be no other references, and setting
+        // the counter to 2 - even non-atomically - is safe as
+        // long as the value is set before the return statement.
+        shared_container->counter = 2;
+        *typecode = SHARED_CONTAINER_TYPE;
+
+        return shared_container;
+    }  // copy_on_write
+    // otherwise, no copy on write...
+    const container_t *actual_container = container_unwrap_shared(c, typecode);
+    assert(*typecode != SHARED_CONTAINER_TYPE);
+    return container_clone(actual_container, *typecode);
+}
+
+/**
+ * Copies a container, requires a typecode. This allocates new memory, caller
+ * is responsible for deallocation.
+ */
+container_t *container_clone(const container_t *c, uint8_t typecode) {
+    // We do not want to allow cloning of shared containers.
+    // c = container_unwrap_shared(c, &typecode);
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE:
+            return bitset_container_clone(const_CAST_bitset(c));
+        case ARRAY_CONTAINER_TYPE:
+            return array_container_clone(const_CAST_array(c));
+        case RUN_CONTAINER_TYPE:
+            return run_container_clone(const_CAST_run(c));
+        case SHARED_CONTAINER_TYPE:
+            // Shared containers are not cloneable. Are you mixing COW and
+            // non-COW bitmaps?
+            return NULL;
+        default:
+            assert(false);
+            roaring_unreachable;
+            return NULL;
+    }
+}
+
+container_t *shared_container_extract_copy(shared_container_t *sc,
+                                           uint8_t *typecode) {
+    assert(sc->typecode != SHARED_CONTAINER_TYPE);
+    *typecode = sc->typecode;
+    container_t *answer;
+    if (croaring_refcount_dec(&sc->counter)) {
+        answer = sc->container;
+        sc->container = NULL;  // paranoid
+        roaring_free(sc);
+    } else {
+        answer = container_clone(sc->container, *typecode);
+    }
+    assert(*typecode != SHARED_CONTAINER_TYPE);
+    return answer;
+}
+
+void shared_container_free(shared_container_t *container) {
+    if (croaring_refcount_dec(&container->counter)) {
+        assert(container->typecode != SHARED_CONTAINER_TYPE);
+        container_free(container->container, container->typecode);
+        container->container = NULL;  // paranoid
+        roaring_free(container);
+    }
+}
+
+extern inline container_t *container_not(const container_t *c1, uint8_t type1,
+                                         uint8_t *result_type);
+
+extern inline container_t *container_not_range(const container_t *c1,
+                                               uint8_t type1,
+                                               uint32_t range_start,
+                                               uint32_t range_end,
+                                               uint8_t *result_type);
+
+extern inline container_t *container_inot(container_t *c1, uint8_t type1,
+                                          uint8_t *result_type);
+
+extern inline container_t *container_inot_range(container_t *c1, uint8_t type1,
+                                                uint32_t range_start,
+                                                uint32_t range_end,
+                                                uint8_t *result_type);
+
+extern inline container_t *container_range_of_ones(uint32_t range_start,
+                                                   uint32_t range_end,
+                                                   uint8_t *result_type);
+
+// where are the correponding things for union and intersection??
+extern inline container_t *container_lazy_xor(const container_t *c1,
+                                              uint8_t type1,
+                                              const container_t *c2,
+                                              uint8_t type2,
+                                              uint8_t *result_type);
+
+extern inline container_t *container_lazy_ixor(container_t *c1, uint8_t type1,
+                                               const container_t *c2,
+                                               uint8_t type2,
+                                               uint8_t *result_type);
+
+extern inline container_t *container_andnot(const container_t *c1,
+                                            uint8_t type1,
+                                            const container_t *c2,
+                                            uint8_t type2,
+                                            uint8_t *result_type);
+
+roaring_container_iterator_t container_init_iterator(const container_t *c,
+                                                     uint8_t typecode,
+                                                     uint16_t *value) {
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE: {
+            const bitset_container_t *bc = const_CAST_bitset(c);
+            uint32_t wordindex = 0;
+            uint64_t word;
+            while ((word = bc->words[wordindex]) == 0) {
+                wordindex++;
+            }
+            // word is non-zero
+            int32_t index = wordindex * 64 + roaring_trailing_zeroes(word);
+            *value = index;
+            return ROARING_INIT_ROARING_CONTAINER_ITERATOR_T{
+                .index = index,
+            };
+        }
+        case ARRAY_CONTAINER_TYPE: {
+            const array_container_t *ac = const_CAST_array(c);
+            *value = ac->array[0];
+            return ROARING_INIT_ROARING_CONTAINER_ITERATOR_T{
+                .index = 0,
+            };
+        }
+        case RUN_CONTAINER_TYPE: {
+            const run_container_t *rc = const_CAST_run(c);
+            *value = rc->runs[0].value;
+            return ROARING_INIT_ROARING_CONTAINER_ITERATOR_T{
+                .index = 0,
+            };
+        }
+        default:
+            assert(false);
+            roaring_unreachable;
+            return ROARING_INIT_ROARING_CONTAINER_ITERATOR_T{0};
+    }
+}
+
+roaring_container_iterator_t container_init_iterator_last(const container_t *c,
+                                                          uint8_t typecode,
+                                                          uint16_t *value) {
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE: {
+            const bitset_container_t *bc = const_CAST_bitset(c);
+            uint32_t wordindex = BITSET_CONTAINER_SIZE_IN_WORDS - 1;
+            uint64_t word;
+            while ((word = bc->words[wordindex]) == 0) {
+                wordindex--;
+            }
+            // word is non-zero
+            int32_t index =
+                wordindex * 64 + (63 - roaring_leading_zeroes(word));
+            *value = index;
+            return ROARING_INIT_ROARING_CONTAINER_ITERATOR_T{
+                .index = index,
+            };
+        }
+        case ARRAY_CONTAINER_TYPE: {
+            const array_container_t *ac = const_CAST_array(c);
+            int32_t index = ac->cardinality - 1;
+            *value = ac->array[index];
+            return ROARING_INIT_ROARING_CONTAINER_ITERATOR_T{
+                .index = index,
+            };
+        }
+        case RUN_CONTAINER_TYPE: {
+            const run_container_t *rc = const_CAST_run(c);
+            int32_t run_index = rc->n_runs - 1;
+            const rle16_t *last_run = &rc->runs[run_index];
+            *value = last_run->value + last_run->length;
+            return ROARING_INIT_ROARING_CONTAINER_ITERATOR_T{
+                .index = run_index,
+            };
+        }
+        default:
+            assert(false);
+            roaring_unreachable;
+            return ROARING_INIT_ROARING_CONTAINER_ITERATOR_T{0};
+    }
+}
+
+bool container_iterator_next(const container_t *c, uint8_t typecode,
+                             roaring_container_iterator_t *it,
+                             uint16_t *value) {
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE: {
+            const bitset_container_t *bc = const_CAST_bitset(c);
+            it->index++;
+
+            uint32_t wordindex = it->index / 64;
+            if (wordindex >= BITSET_CONTAINER_SIZE_IN_WORDS) {
+                return false;
+            }
+
+            uint64_t word =
+                bc->words[wordindex] & (UINT64_MAX << (it->index % 64));
+            // next part could be optimized/simplified
+            while (word == 0 &&
+                   (wordindex + 1 < BITSET_CONTAINER_SIZE_IN_WORDS)) {
+                wordindex++;
+                word = bc->words[wordindex];
+            }
+            if (word != 0) {
+                it->index = wordindex * 64 + roaring_trailing_zeroes(word);
+                *value = it->index;
+                return true;
+            }
+            return false;
+        }
+        case ARRAY_CONTAINER_TYPE: {
+            const array_container_t *ac = const_CAST_array(c);
+            it->index++;
+            if (it->index < ac->cardinality) {
+                *value = ac->array[it->index];
+                return true;
+            }
+            return false;
+        }
+        case RUN_CONTAINER_TYPE: {
+            if (*value == UINT16_MAX) {  // Avoid overflow to zero
+                return false;
+            }
+
+            const run_container_t *rc = const_CAST_run(c);
+            uint32_t limit =
+                rc->runs[it->index].value + rc->runs[it->index].length;
+            if (*value < limit) {
+                (*value)++;
+                return true;
+            }
+
+            it->index++;
+            if (it->index < rc->n_runs) {
+                *value = rc->runs[it->index].value;
+                return true;
+            }
+            return false;
+        }
+        default:
+            assert(false);
+            roaring_unreachable;
+            return false;
+    }
+}
+
+bool container_iterator_prev(const container_t *c, uint8_t typecode,
+                             roaring_container_iterator_t *it,
+                             uint16_t *value) {
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE: {
+            if (--it->index < 0) {
+                return false;
+            }
+
+            const bitset_container_t *bc = const_CAST_bitset(c);
+            int32_t wordindex = it->index / 64;
+            uint64_t word =
+                bc->words[wordindex] & (UINT64_MAX >> (63 - (it->index % 64)));
+
+            while (word == 0 && --wordindex >= 0) {
+                word = bc->words[wordindex];
+            }
+            if (word == 0) {
+                return false;
+            }
+
+            it->index = (wordindex * 64) + (63 - roaring_leading_zeroes(word));
+            *value = it->index;
+            return true;
+        }
+        case ARRAY_CONTAINER_TYPE: {
+            if (--it->index < 0) {
+                return false;
+            }
+            const array_container_t *ac = const_CAST_array(c);
+            *value = ac->array[it->index];
+            return true;
+        }
+        case RUN_CONTAINER_TYPE: {
+            if (*value == 0) {
+                return false;
+            }
+
+            const run_container_t *rc = const_CAST_run(c);
+            (*value)--;
+            if (*value >= rc->runs[it->index].value) {
+                return true;
+            }
+
+            if (--it->index < 0) {
+                return false;
+            }
+
+            *value = rc->runs[it->index].value + rc->runs[it->index].length;
+            return true;
+        }
+        default:
+            assert(false);
+            roaring_unreachable;
+            return false;
+    }
+}
+
+bool container_iterator_lower_bound(const container_t *c, uint8_t typecode,
+                                    roaring_container_iterator_t *it,
+                                    uint16_t *value_out, uint16_t val) {
+    if (val > container_maximum(c, typecode)) {
+        return false;
+    }
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE: {
+            const bitset_container_t *bc = const_CAST_bitset(c);
+            it->index = bitset_container_index_equalorlarger(bc, val);
+            *value_out = it->index;
+            return true;
+        }
+        case ARRAY_CONTAINER_TYPE: {
+            const array_container_t *ac = const_CAST_array(c);
+            it->index = array_container_index_equalorlarger(ac, val);
+            *value_out = ac->array[it->index];
+            return true;
+        }
+        case RUN_CONTAINER_TYPE: {
+            const run_container_t *rc = const_CAST_run(c);
+            it->index = run_container_index_equalorlarger(rc, val);
+            if (rc->runs[it->index].value <= val) {
+                *value_out = val;
+            } else {
+                *value_out = rc->runs[it->index].value;
+            }
+            return true;
+        }
+        default:
+            assert(false);
+            roaring_unreachable;
+            return false;
+    }
+}
+
+bool container_iterator_read_into_uint32(const container_t *c, uint8_t typecode,
+                                         roaring_container_iterator_t *it,
+                                         uint32_t high16, uint32_t *buf,
+                                         uint32_t count, uint32_t *consumed,
+                                         uint16_t *value_out) {
+    *consumed = 0;
+    if (count == 0) {
+        return false;
+    }
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE: {
+            const bitset_container_t *bc = const_CAST_bitset(c);
+            uint32_t wordindex = it->index / 64;
+            uint64_t word =
+                bc->words[wordindex] & (UINT64_MAX << (it->index % 64));
+            do {
+                // Read set bits.
+                while (word != 0 && *consumed < count) {
+                    *buf = high16 |
+                           (wordindex * 64 + roaring_trailing_zeroes(word));
+                    word = word & (word - 1);
+                    buf++;
+                    (*consumed)++;
+                }
+                // Skip unset bits.
+                while (word == 0 &&
+                       wordindex + 1 < BITSET_CONTAINER_SIZE_IN_WORDS) {
+                    wordindex++;
+                    word = bc->words[wordindex];
+                }
+            } while (word != 0 && *consumed < count);
+
+            if (word != 0) {
+                it->index = wordindex * 64 + roaring_trailing_zeroes(word);
+                *value_out = it->index;
+                return true;
+            }
+            return false;
+        }
+        case ARRAY_CONTAINER_TYPE: {
+            const array_container_t *ac = const_CAST_array(c);
+            uint32_t num_values =
+                minimum_uint32(ac->cardinality - it->index, count);
+            for (uint32_t i = 0; i < num_values; i++) {
+                buf[i] = high16 | ac->array[it->index + i];
+            }
+            *consumed += num_values;
+            it->index += num_values;
+            if (it->index < ac->cardinality) {
+                *value_out = ac->array[it->index];
+                return true;
+            }
+            return false;
+        }
+        case RUN_CONTAINER_TYPE: {
+            const run_container_t *rc = const_CAST_run(c);
+            do {
+                uint32_t largest_run_value =
+                    rc->runs[it->index].value + rc->runs[it->index].length;
+                uint32_t num_values = minimum_uint32(
+                    largest_run_value - *value_out + 1, count - *consumed);
+                for (uint32_t i = 0; i < num_values; i++) {
+                    buf[i] = high16 | (*value_out + i);
+                }
+                *value_out += num_values;
+                buf += num_values;
+                *consumed += num_values;
+
+                // We check for `value == 0` because `it->value += num_values`
+                // can overflow when `value == UINT16_MAX`, and `count >
+                // length`. In this case `value` will overflow to 0.
+                if (*value_out > largest_run_value || *value_out == 0) {
+                    it->index++;
+                    if (it->index < rc->n_runs) {
+                        *value_out = rc->runs[it->index].value;
+                    } else {
+                        return false;
+                    }
+                }
+            } while (*consumed < count);
+            return true;
+        }
+        default:
+            assert(false);
+            roaring_unreachable;
+            return 0;
+    }
+}
+
+bool container_iterator_read_into_uint64(const container_t *c, uint8_t typecode,
+                                         roaring_container_iterator_t *it,
+                                         uint64_t high48, uint64_t *buf,
+                                         uint32_t count, uint32_t *consumed,
+                                         uint16_t *value_out) {
+    *consumed = 0;
+    if (count == 0) {
+        return false;
+    }
+    switch (typecode) {
+        case BITSET_CONTAINER_TYPE: {
+            const bitset_container_t *bc = const_CAST_bitset(c);
+            uint32_t wordindex = it->index / 64;
+            uint64_t word =
+                bc->words[wordindex] & (UINT64_MAX << (it->index % 64));
+            do {
+                // Read set bits.
+                while (word != 0 && *consumed < count) {
+                    *buf = high48 |
+                           (wordindex * 64 + roaring_trailing_zeroes(word));
+                    word = word & (word - 1);
+                    buf++;
+                    (*consumed)++;
+                }
+                // Skip unset bits.
+                while (word == 0 &&
+                       wordindex + 1 < BITSET_CONTAINER_SIZE_IN_WORDS) {
+                    wordindex++;
+                    word = bc->words[wordindex];
+                }
+            } while (word != 0 && *consumed < count);
+
+            if (word != 0) {
+                it->index = wordindex * 64 + roaring_trailing_zeroes(word);
+                *value_out = it->index;
+                return true;
+            }
+            return false;
+        }
+        case ARRAY_CONTAINER_TYPE: {
+            const array_container_t *ac = const_CAST_array(c);
+            uint32_t num_values =
+                minimum_uint32(ac->cardinality - it->index, count);
+            for (uint32_t i = 0; i < num_values; i++) {
+                buf[i] = high48 | ac->array[it->index + i];
+            }
+            *consumed += num_values;
+            it->index += num_values;
+            if (it->index < ac->cardinality) {
+                *value_out = ac->array[it->index];
+                return true;
+            }
+            return false;
+        }
+        case RUN_CONTAINER_TYPE: {
+            const run_container_t *rc = const_CAST_run(c);
+            do {
+                uint32_t largest_run_value =
+                    rc->runs[it->index].value + rc->runs[it->index].length;
+                uint32_t num_values = minimum_uint32(
+                    largest_run_value - *value_out + 1, count - *consumed);
+                for (uint32_t i = 0; i < num_values; i++) {
+                    buf[i] = high48 | (*value_out + i);
+                }
+                *value_out += num_values;
+                buf += num_values;
+                *consumed += num_values;
+
+                // We check for `value == 0` because `it->value += num_values`
+                // can overflow when `value == UINT16_MAX`, and `count >
+                // length`. In this case `value` will overflow to 0.
+                if (*value_out > largest_run_value || *value_out == 0) {
+                    it->index++;
+                    if (it->index < rc->n_runs) {
+                        *value_out = rc->runs[it->index].value;
+                    } else {
+                        return false;
+                    }
+                }
+            } while (*consumed < count);
+            return true;
+        }
+        default:
+            assert(false);
+            roaring_unreachable;
+            return 0;
+    }
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+
+#undef ROARING_INIT_ROARING_CONTAINER_ITERATOR_T
+/* end file src/containers/containers.c */
+/* begin file src/containers/convert.c */
+#include <stdio.h>
+
+
+#if CROARING_IS_X64
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#error "CROARING_COMPILER_SUPPORTS_AVX512 needs to be defined."
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+// file contains grubby stuff that must know impl. details of all container
+// types.
+bitset_container_t *bitset_container_from_array(const array_container_t *ac) {
+    bitset_container_t *ans = bitset_container_create();
+    int limit = array_container_cardinality(ac);
+    for (int i = 0; i < limit; ++i) bitset_container_set(ans, ac->array[i]);
+    return ans;
+}
+
+bitset_container_t *bitset_container_from_run(const run_container_t *arr) {
+    int card = run_container_cardinality(arr);
+    bitset_container_t *answer = bitset_container_create();
+    for (int rlepos = 0; rlepos < arr->n_runs; ++rlepos) {
+        rle16_t vl = arr->runs[rlepos];
+        bitset_set_lenrange(answer->words, vl.value, vl.length);
+    }
+    answer->cardinality = card;
+    return answer;
+}
+
+array_container_t *array_container_from_run(const run_container_t *arr) {
+    array_container_t *answer =
+        array_container_create_given_capacity(run_container_cardinality(arr));
+    answer->cardinality = 0;
+    for (int rlepos = 0; rlepos < arr->n_runs; ++rlepos) {
+        int run_start = arr->runs[rlepos].value;
+        int run_end = run_start + arr->runs[rlepos].length;
+
+        for (int run_value = run_start; run_value <= run_end; ++run_value) {
+            answer->array[answer->cardinality++] = (uint16_t)run_value;
+        }
+    }
+    return answer;
+}
+
+array_container_t *array_container_from_bitset(const bitset_container_t *bits) {
+    array_container_t *result =
+        array_container_create_given_capacity(bits->cardinality);
+    result->cardinality = bits->cardinality;
+#if CROARING_IS_X64
+#if CROARING_COMPILER_SUPPORTS_AVX512
+    if (croaring_hardware_support() & ROARING_SUPPORTS_AVX512) {
+        bitset_extract_setbits_avx512_uint16(
+            bits->words, BITSET_CONTAINER_SIZE_IN_WORDS, result->array,
+            bits->cardinality, 0);
+    } else
+#endif
+    {
+        //  sse version ends up being slower here
+        // (bitset_extract_setbits_sse_uint16)
+        // because of the sparsity of the data
+        bitset_extract_setbits_uint16(
+            bits->words, BITSET_CONTAINER_SIZE_IN_WORDS, result->array, 0);
+    }
+#else
+    // If the system is not x64, then we have no accelerated function.
+    bitset_extract_setbits_uint16(bits->words, BITSET_CONTAINER_SIZE_IN_WORDS,
+                                  result->array, 0);
+#endif
+
+    return result;
+}
+
+/* assumes that container has adequate space.  Run from [s,e] (inclusive) */
+static void add_run(run_container_t *rc, int s, int e) {
+    rc->runs[rc->n_runs].value = s;
+    rc->runs[rc->n_runs].length = e - s;
+    rc->n_runs++;
+}
+
+run_container_t *run_container_from_array(const array_container_t *c) {
+    int32_t n_runs = array_container_number_of_runs(c);
+    run_container_t *answer = run_container_create_given_capacity(n_runs);
+    int prev = -2;
+    int run_start = -1;
+    int32_t card = c->cardinality;
+    if (card == 0) return answer;
+    for (int i = 0; i < card; ++i) {
+        const uint16_t cur_val = c->array[i];
+        if (cur_val != prev + 1) {
+            // new run starts; flush old one, if any
+            if (run_start != -1) add_run(answer, run_start, prev);
+            run_start = cur_val;
+        }
+        prev = c->array[i];
+    }
+    // now prev is the last seen value
+    add_run(answer, run_start, prev);
+    // assert(run_container_cardinality(answer) == c->cardinality);
+    return answer;
+}
+
+/**
+ * Convert the runcontainer to either a Bitmap or an Array Container, depending
+ * on the cardinality.  Frees the container.
+ * Allocates and returns new container, which caller is responsible for freeing.
+ * It does not free the run container.
+ */
+container_t *convert_to_bitset_or_array_container(run_container_t *rc,
+                                                  int32_t card,
+                                                  uint8_t *resulttype) {
+    if (card <= DEFAULT_MAX_SIZE) {
+        array_container_t *answer = array_container_create_given_capacity(card);
+        answer->cardinality = 0;
+        for (int rlepos = 0; rlepos < rc->n_runs; ++rlepos) {
+            uint16_t run_start = rc->runs[rlepos].value;
+            uint16_t run_end = run_start + rc->runs[rlepos].length;
+            for (uint16_t run_value = run_start; run_value < run_end;
+                 ++run_value) {
+                answer->array[answer->cardinality++] = run_value;
+            }
+            answer->array[answer->cardinality++] = run_end;
+        }
+        assert(card == answer->cardinality);
+        *resulttype = ARRAY_CONTAINER_TYPE;
+        // run_container_free(r);
+        return answer;
+    }
+    bitset_container_t *answer = bitset_container_create();
+    for (int rlepos = 0; rlepos < rc->n_runs; ++rlepos) {
+        uint16_t run_start = rc->runs[rlepos].value;
+        bitset_set_lenrange(answer->words, run_start, rc->runs[rlepos].length);
+    }
+    answer->cardinality = card;
+    *resulttype = BITSET_CONTAINER_TYPE;
+    // run_container_free(r);
+    return answer;
+}
+
+/* Converts a run container to either an array or a bitset, IF it saves space.
+ */
+/* If a conversion occurs, the caller is responsible to free the original
+ * container and
+ * he becomes responsible to free the new one. */
+container_t *convert_run_to_efficient_container(run_container_t *c,
+                                                uint8_t *typecode_after) {
+    int32_t size_as_run_container =
+        run_container_serialized_size_in_bytes(c->n_runs);
+
+    int32_t size_as_bitset_container =
+        bitset_container_serialized_size_in_bytes();
+    int32_t card = run_container_cardinality(c);
+    int32_t size_as_array_container =
+        array_container_serialized_size_in_bytes(card);
+
+    int32_t min_size_non_run =
+        size_as_bitset_container < size_as_array_container
+            ? size_as_bitset_container
+            : size_as_array_container;
+    if (size_as_run_container <= min_size_non_run) {  // no conversion
+        *typecode_after = RUN_CONTAINER_TYPE;
+        return c;
+    }
+    if (card <= DEFAULT_MAX_SIZE) {
+        // to array
+        array_container_t *answer = array_container_create_given_capacity(card);
+        answer->cardinality = 0;
+        for (int rlepos = 0; rlepos < c->n_runs; ++rlepos) {
+            int run_start = c->runs[rlepos].value;
+            int run_end = run_start + c->runs[rlepos].length;
+
+            for (int run_value = run_start; run_value <= run_end; ++run_value) {
+                answer->array[answer->cardinality++] = (uint16_t)run_value;
+            }
+        }
+        *typecode_after = ARRAY_CONTAINER_TYPE;
+        return answer;
+    }
+
+    // else to bitset
+    bitset_container_t *answer = bitset_container_create();
+
+    for (int rlepos = 0; rlepos < c->n_runs; ++rlepos) {
+        int start = c->runs[rlepos].value;
+        int end = start + c->runs[rlepos].length;
+        bitset_set_range(answer->words, start, end + 1);
+    }
+    answer->cardinality = card;
+    *typecode_after = BITSET_CONTAINER_TYPE;
+    return answer;
+}
+
+// like convert_run_to_efficient_container but frees the old result if needed
+container_t *convert_run_to_efficient_container_and_free(
+    run_container_t *c, uint8_t *typecode_after) {
+    container_t *answer = convert_run_to_efficient_container(c, typecode_after);
+    if (answer != c) run_container_free(c);
+    return answer;
+}
+
+/* once converted, the original container is disposed here, rather than
+   in roaring_array
+*/
+
+// TODO: split into run-  array-  and bitset-  subfunctions for sanity;
+// a few function calls won't really matter.
+
+container_t *convert_run_optimize(container_t *c, uint8_t typecode_original,
+                                  uint8_t *typecode_after) {
+    if (typecode_original == RUN_CONTAINER_TYPE) {
+        container_t *newc =
+            convert_run_to_efficient_container(CAST_run(c), typecode_after);
+        if (newc != c) {
+            container_free(c, typecode_original);
+        }
+        return newc;
+    } else if (typecode_original == ARRAY_CONTAINER_TYPE) {
+        // it might need to be converted to a run container.
+        array_container_t *c_qua_array = CAST_array(c);
+        int32_t n_runs = array_container_number_of_runs(c_qua_array);
+        int32_t size_as_run_container =
+            run_container_serialized_size_in_bytes(n_runs);
+        int32_t card = array_container_cardinality(c_qua_array);
+        int32_t size_as_array_container =
+            array_container_serialized_size_in_bytes(card);
+
+        if (size_as_run_container >= size_as_array_container) {
+            *typecode_after = ARRAY_CONTAINER_TYPE;
+            return c;
+        }
+        // else convert array to run container
+        run_container_t *answer = run_container_create_given_capacity(n_runs);
+        int prev = -2;
+        int run_start = -1;
+
+        assert(card > 0);
+        for (int i = 0; i < card; ++i) {
+            uint16_t cur_val = c_qua_array->array[i];
+            if (cur_val != prev + 1) {
+                // new run starts; flush old one, if any
+                if (run_start != -1) add_run(answer, run_start, prev);
+                run_start = cur_val;
+            }
+            prev = c_qua_array->array[i];
+        }
+        assert(run_start >= 0);
+        // now prev is the last seen value
+        add_run(answer, run_start, prev);
+        *typecode_after = RUN_CONTAINER_TYPE;
+        array_container_free(c_qua_array);
+        return answer;
+    } else if (typecode_original ==
+               BITSET_CONTAINER_TYPE) {  // run conversions on bitset
+        // does bitset need conversion to run?
+        bitset_container_t *c_qua_bitset = CAST_bitset(c);
+        int32_t n_runs = bitset_container_number_of_runs(c_qua_bitset);
+        int32_t size_as_run_container =
+            run_container_serialized_size_in_bytes(n_runs);
+        int32_t size_as_bitset_container =
+            bitset_container_serialized_size_in_bytes();
+
+        if (size_as_bitset_container <= size_as_run_container) {
+            // no conversion needed.
+            *typecode_after = BITSET_CONTAINER_TYPE;
+            return c;
+        }
+        // bitset to runcontainer (ported from Java  RunContainer(
+        // BitmapContainer bc, int nbrRuns))
+        assert(n_runs > 0);  // no empty bitmaps
+        run_container_t *answer = run_container_create_given_capacity(n_runs);
+
+        int long_ctr = 0;
+        uint64_t cur_word = c_qua_bitset->words[0];
+        while (true) {
+            while (cur_word == UINT64_C(0) &&
+                   long_ctr < BITSET_CONTAINER_SIZE_IN_WORDS - 1)
+                cur_word = c_qua_bitset->words[++long_ctr];
+
+            if (cur_word == UINT64_C(0)) {
+                bitset_container_free(c_qua_bitset);
+                *typecode_after = RUN_CONTAINER_TYPE;
+                return answer;
+            }
+
+            int local_run_start = roaring_trailing_zeroes(cur_word);
+            int run_start = local_run_start + 64 * long_ctr;
+            uint64_t cur_word_with_1s = cur_word | (cur_word - 1);
+
+            int run_end = 0;
+            while (cur_word_with_1s == UINT64_C(0xFFFFFFFFFFFFFFFF) &&
+                   long_ctr < BITSET_CONTAINER_SIZE_IN_WORDS - 1)
+                cur_word_with_1s = c_qua_bitset->words[++long_ctr];
+
+            if (cur_word_with_1s == UINT64_C(0xFFFFFFFFFFFFFFFF)) {
+                run_end = 64 + long_ctr * 64;  // exclusive, I guess
+                add_run(answer, run_start, run_end - 1);
+                bitset_container_free(c_qua_bitset);
+                *typecode_after = RUN_CONTAINER_TYPE;
+                return answer;
+            }
+            int local_run_end = roaring_trailing_zeroes(~cur_word_with_1s);
+            run_end = local_run_end + long_ctr * 64;
+            add_run(answer, run_start, run_end - 1);
+            cur_word = cur_word_with_1s & (cur_word_with_1s + 1);
+        }
+        return answer;
+    } else {
+        assert(false);
+        roaring_unreachable;
+        return NULL;
+    }
+}
+
+container_t *container_from_run_range(const run_container_t *run, uint32_t min,
+                                      uint32_t max, uint8_t *typecode_after) {
+    // We expect most of the time to end up with a bitset container
+    bitset_container_t *bitset = bitset_container_create();
+    *typecode_after = BITSET_CONTAINER_TYPE;
+    int32_t union_cardinality = 0;
+    for (int32_t i = 0; i < run->n_runs; ++i) {
+        uint32_t rle_min = run->runs[i].value;
+        uint32_t rle_max = rle_min + run->runs[i].length;
+        bitset_set_lenrange(bitset->words, rle_min, rle_max - rle_min);
+        union_cardinality += run->runs[i].length + 1;
+    }
+    union_cardinality += max - min + 1;
+    union_cardinality -=
+        bitset_lenrange_cardinality(bitset->words, min, max - min);
+    bitset_set_lenrange(bitset->words, min, max - min);
+    bitset->cardinality = union_cardinality;
+    if (bitset->cardinality <= DEFAULT_MAX_SIZE) {
+        // we need to convert to an array container
+        array_container_t *array = array_container_from_bitset(bitset);
+        *typecode_after = ARRAY_CONTAINER_TYPE;
+        bitset_container_free(bitset);
+        return array;
+    }
+    return bitset;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/containers/convert.c */
+/* begin file src/containers/mixed_andnot.c */
+/*
+ * mixed_andnot.c.  More methods since operation is not symmetric,
+ * except no "wide" andnot , so no lazy options motivated.
+ */
+
+#include <assert.h>
+#include <string.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst, a valid array container that could be the same as dst.*/
+void array_bitset_container_andnot(const array_container_t *src_1,
+                                   const bitset_container_t *src_2,
+                                   array_container_t *dst) {
+    // follows Java implementation as of June 2016
+    if (dst->capacity < src_1->cardinality) {
+        array_container_grow(dst, src_1->cardinality, false);
+    }
+    int32_t newcard = 0;
+    const int32_t origcard = src_1->cardinality;
+    for (int i = 0; i < origcard; ++i) {
+        uint16_t key = src_1->array[i];
+        dst->array[newcard] = key;
+        newcard += 1 - bitset_container_contains(src_2, key);
+    }
+    dst->cardinality = newcard;
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * src_1 */
+
+void array_bitset_container_iandnot(array_container_t *src_1,
+                                    const bitset_container_t *src_2) {
+    array_bitset_container_andnot(src_1, src_2, src_1);
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst, which does not initially have a valid container.
+ * Return true for a bitset result; false for array
+ */
+
+bool bitset_array_container_andnot(const bitset_container_t *src_1,
+                                   const array_container_t *src_2,
+                                   container_t **dst) {
+    // Java did this directly, but we have option of asm or avx
+    bitset_container_t *result = bitset_container_create();
+    bitset_container_copy(src_1, result);
+    result->cardinality =
+        (int32_t)bitset_clear_list(result->words, (uint64_t)result->cardinality,
+                                   src_2->array, (uint64_t)src_2->cardinality);
+
+    // do required type conversions.
+    if (result->cardinality <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(result);
+        bitset_container_free(result);
+        return false;
+    }
+    *dst = result;
+    return true;
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+bool bitset_array_container_iandnot(bitset_container_t *src_1,
+                                    const array_container_t *src_2,
+                                    container_t **dst) {
+    *dst = src_1;
+    src_1->cardinality =
+        (int32_t)bitset_clear_list(src_1->words, (uint64_t)src_1->cardinality,
+                                   src_2->array, (uint64_t)src_2->cardinality);
+
+    if (src_1->cardinality <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(src_1);
+        bitset_container_free(src_1);
+        return false;  // not bitset
+    } else
+        return true;
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset"). dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool run_bitset_container_andnot(const run_container_t *src_1,
+                                 const bitset_container_t *src_2,
+                                 container_t **dst) {
+    // follows the Java implementation as of June 2016
+    int card = run_container_cardinality(src_1);
+    if (card <= DEFAULT_MAX_SIZE) {
+        // must be an array
+        array_container_t *answer = array_container_create_given_capacity(card);
+        answer->cardinality = 0;
+        for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+            rle16_t rle = src_1->runs[rlepos];
+            for (int run_value = rle.value; run_value <= rle.value + rle.length;
+                 ++run_value) {
+                if (!bitset_container_get(src_2, (uint16_t)run_value)) {
+                    answer->array[answer->cardinality++] = (uint16_t)run_value;
+                }
+            }
+        }
+        *dst = answer;
+        return false;
+    } else {  // we guess it will be a bitset, though have to check guess when
+              // done
+        bitset_container_t *answer = bitset_container_clone(src_2);
+
+        uint32_t last_pos = 0;
+        for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+            rle16_t rle = src_1->runs[rlepos];
+
+            uint32_t start = rle.value;
+            uint32_t end = start + rle.length + 1;
+            bitset_reset_range(answer->words, last_pos, start);
+            bitset_flip_range(answer->words, start, end);
+            last_pos = end;
+        }
+        bitset_reset_range(answer->words, last_pos, (uint32_t)(1 << 16));
+
+        answer->cardinality = bitset_container_compute_cardinality(answer);
+
+        if (answer->cardinality <= DEFAULT_MAX_SIZE) {
+            *dst = array_container_from_bitset(answer);
+            bitset_container_free(answer);
+            return false;  // not bitset
+        }
+        *dst = answer;
+        return true;  // bitset
+    }
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset"). dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool run_bitset_container_iandnot(run_container_t *src_1,
+                                  const bitset_container_t *src_2,
+                                  container_t **dst) {
+    // dummy implementation
+    bool ans = run_bitset_container_andnot(src_1, src_2, dst);
+    run_container_free(src_1);
+    return ans;
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset").  dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool bitset_run_container_andnot(const bitset_container_t *src_1,
+                                 const run_container_t *src_2,
+                                 container_t **dst) {
+    // follows Java implementation
+    bitset_container_t *result = bitset_container_create();
+
+    bitset_container_copy(src_1, result);
+    for (int32_t rlepos = 0; rlepos < src_2->n_runs; ++rlepos) {
+        rle16_t rle = src_2->runs[rlepos];
+        bitset_reset_range(result->words, rle.value,
+                           rle.value + rle.length + UINT32_C(1));
+    }
+    result->cardinality = bitset_container_compute_cardinality(result);
+
+    if (result->cardinality <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(result);
+        bitset_container_free(result);
+        return false;  // not bitset
+    }
+    *dst = result;
+    return true;  // bitset
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+bool bitset_run_container_iandnot(bitset_container_t *src_1,
+                                  const run_container_t *src_2,
+                                  container_t **dst) {
+    *dst = src_1;
+
+    for (int32_t rlepos = 0; rlepos < src_2->n_runs; ++rlepos) {
+        rle16_t rle = src_2->runs[rlepos];
+        bitset_reset_range(src_1->words, rle.value,
+                           rle.value + rle.length + UINT32_C(1));
+    }
+    src_1->cardinality = bitset_container_compute_cardinality(src_1);
+
+    if (src_1->cardinality <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(src_1);
+        bitset_container_free(src_1);
+        return false;  // not bitset
+    } else
+        return true;
+}
+
+/* helper. a_out must be a valid array container with adequate capacity.
+ * Returns the cardinality of the output container. Partly Based on Java
+ * implementation Util.unsignedDifference.
+ *
+ * TODO: Util.unsignedDifference does not use advanceUntil.  Is it cheaper
+ * to avoid advanceUntil?
+ */
+
+static int run_array_array_subtract(const run_container_t *rc,
+                                    const array_container_t *a_in,
+                                    array_container_t *a_out) {
+    int out_card = 0;
+    int32_t in_array_pos =
+        -1;  // since advanceUntil always assumes we start the search AFTER this
+
+    for (int rlepos = 0; rlepos < rc->n_runs; rlepos++) {
+        int32_t start = rc->runs[rlepos].value;
+        int32_t end = start + rc->runs[rlepos].length + 1;
+
+        in_array_pos = advanceUntil(a_in->array, in_array_pos,
+                                    a_in->cardinality, (uint16_t)start);
+
+        if (in_array_pos >= a_in->cardinality) {  // run has no items subtracted
+            for (int32_t i = start; i < end; ++i)
+                a_out->array[out_card++] = (uint16_t)i;
+        } else {
+            uint16_t next_nonincluded = a_in->array[in_array_pos];
+            if (next_nonincluded >= end) {
+                // another case when run goes unaltered
+                for (int32_t i = start; i < end; ++i)
+                    a_out->array[out_card++] = (uint16_t)i;
+                in_array_pos--;  // ensure we see this item again if necessary
+            } else {
+                for (int32_t i = start; i < end; ++i)
+                    if (i != next_nonincluded)
+                        a_out->array[out_card++] = (uint16_t)i;
+                    else  // 0 should ensure  we don't match
+                        next_nonincluded =
+                            (in_array_pos + 1 >= a_in->cardinality)
+                                ? 0
+                                : a_in->array[++in_array_pos];
+                in_array_pos--;  // see again
+            }
+        }
+    }
+    return out_card;
+}
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any type of container.
+ */
+
+int run_array_container_andnot(const run_container_t *src_1,
+                               const array_container_t *src_2,
+                               container_t **dst) {
+    // follows the Java impl as of June 2016
+
+    int card = run_container_cardinality(src_1);
+    const int arbitrary_threshold = 32;
+
+    if (card <= arbitrary_threshold) {
+        if (src_2->cardinality == 0) {
+            *dst = run_container_clone(src_1);
+            return RUN_CONTAINER_TYPE;
+        }
+        // Java's "lazyandNot.toEfficientContainer" thing
+        run_container_t *answer = run_container_create_given_capacity(
+            card + array_container_cardinality(src_2));
+
+        int rlepos = 0;
+        int xrlepos = 0;  // "x" is src_2
+        rle16_t rle = src_1->runs[rlepos];
+        int32_t start = rle.value;
+        int32_t end = start + rle.length + 1;
+        int32_t xstart = src_2->array[xrlepos];
+
+        while ((rlepos < src_1->n_runs) && (xrlepos < src_2->cardinality)) {
+            if (end <= xstart) {
+                // output the first run
+                answer->runs[answer->n_runs++] =
+                    CROARING_MAKE_RLE16(start, end - start - 1);
+                rlepos++;
+                if (rlepos < src_1->n_runs) {
+                    start = src_1->runs[rlepos].value;
+                    end = start + src_1->runs[rlepos].length + 1;
+                }
+            } else if (xstart + 1 <= start) {
+                // exit the second run
+                xrlepos++;
+                if (xrlepos < src_2->cardinality) {
+                    xstart = src_2->array[xrlepos];
+                }
+            } else {
+                if (start < xstart) {
+                    answer->runs[answer->n_runs++] =
+                        CROARING_MAKE_RLE16(start, xstart - start - 1);
+                }
+                if (xstart + 1 < end) {
+                    start = xstart + 1;
+                } else {
+                    rlepos++;
+                    if (rlepos < src_1->n_runs) {
+                        start = src_1->runs[rlepos].value;
+                        end = start + src_1->runs[rlepos].length + 1;
+                    }
+                }
+            }
+        }
+        if (rlepos < src_1->n_runs) {
+            answer->runs[answer->n_runs++] =
+                CROARING_MAKE_RLE16(start, end - start - 1);
+            rlepos++;
+            if (rlepos < src_1->n_runs) {
+                memcpy(answer->runs + answer->n_runs, src_1->runs + rlepos,
+                       (src_1->n_runs - rlepos) * sizeof(rle16_t));
+                answer->n_runs += (src_1->n_runs - rlepos);
+            }
+        }
+        uint8_t return_type;
+        *dst = convert_run_to_efficient_container(answer, &return_type);
+        if (answer != *dst) run_container_free(answer);
+        return return_type;
+    }
+    // else it's a bitmap or array
+
+    if (card <= DEFAULT_MAX_SIZE) {
+        array_container_t *ac = array_container_create_given_capacity(card);
+        // nb Java code used a generic iterator-based merge to compute
+        // difference
+        ac->cardinality = run_array_array_subtract(src_1, src_2, ac);
+        *dst = ac;
+        return ARRAY_CONTAINER_TYPE;
+    }
+    bitset_container_t *ans = bitset_container_from_run(src_1);
+    bool result_is_bitset = bitset_array_container_iandnot(ans, src_2, dst);
+    return (result_is_bitset ? BITSET_CONTAINER_TYPE : ARRAY_CONTAINER_TYPE);
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+int run_array_container_iandnot(run_container_t *src_1,
+                                const array_container_t *src_2,
+                                container_t **dst) {
+    // dummy implementation same as June 2016 Java
+    int ans = run_array_container_andnot(src_1, src_2, dst);
+    run_container_free(src_1);
+    return ans;
+}
+
+/* dst must be a valid array container, allowed to be src_1 */
+
+void array_run_container_andnot(const array_container_t *src_1,
+                                const run_container_t *src_2,
+                                array_container_t *dst) {
+    // basically following Java impl as of June 2016
+    if (src_1->cardinality > dst->capacity) {
+        array_container_grow(dst, src_1->cardinality, false);
+    }
+
+    if (src_2->n_runs == 0) {
+        memmove(dst->array, src_1->array,
+                sizeof(uint16_t) * src_1->cardinality);
+        dst->cardinality = src_1->cardinality;
+        return;
+    }
+    int32_t run_start = src_2->runs[0].value;
+    int32_t run_end = run_start + src_2->runs[0].length;
+    int which_run = 0;
+
+    uint16_t val = 0;
+    int dest_card = 0;
+    for (int i = 0; i < src_1->cardinality; ++i) {
+        val = src_1->array[i];
+        if (val < run_start)
+            dst->array[dest_card++] = val;
+        else if (val <= run_end) {
+            ;  // omitted item
+        } else {
+            do {
+                if (which_run + 1 < src_2->n_runs) {
+                    ++which_run;
+                    run_start = src_2->runs[which_run].value;
+                    run_end = run_start + src_2->runs[which_run].length;
+
+                } else
+                    run_start = run_end = (1 << 16) + 1;
+            } while (val > run_end);
+            --i;
+        }
+    }
+    dst->cardinality = dest_card;
+}
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+void array_run_container_iandnot(array_container_t *src_1,
+                                 const run_container_t *src_2) {
+    array_run_container_andnot(src_1, src_2, src_1);
+}
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+int run_run_container_andnot(const run_container_t *src_1,
+                             const run_container_t *src_2, container_t **dst) {
+    run_container_t *ans = run_container_create();
+    run_container_andnot(src_1, src_2, ans);
+    uint8_t typecode_after;
+    *dst = convert_run_to_efficient_container_and_free(ans, &typecode_after);
+    return typecode_after;
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+int run_run_container_iandnot(run_container_t *src_1,
+                              const run_container_t *src_2, container_t **dst) {
+    // following Java impl as of June 2016 (dummy)
+    int ans = run_run_container_andnot(src_1, src_2, dst);
+    run_container_free(src_1);
+    return ans;
+}
+
+/*
+ * dst is a valid array container and may be the same as src_1
+ */
+
+void array_array_container_andnot(const array_container_t *src_1,
+                                  const array_container_t *src_2,
+                                  array_container_t *dst) {
+    array_container_andnot(src_1, src_2, dst);
+}
+
+/* inplace array-array andnot will always be able to reuse the space of
+ * src_1 */
+void array_array_container_iandnot(array_container_t *src_1,
+                                   const array_container_t *src_2) {
+    array_container_andnot(src_1, src_2, src_1);
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially). Return value is
+ * "dst is a bitset"
+ */
+
+bool bitset_bitset_container_andnot(const bitset_container_t *src_1,
+                                    const bitset_container_t *src_2,
+                                    container_t **dst) {
+    bitset_container_t *ans = bitset_container_create();
+    int card = bitset_container_andnot(src_1, src_2, ans);
+    if (card <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(ans);
+        bitset_container_free(ans);
+        return false;  // not bitset
+    } else {
+        *dst = ans;
+        return true;
+    }
+}
+
+/* Compute the andnot of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+bool bitset_bitset_container_iandnot(bitset_container_t *src_1,
+                                     const bitset_container_t *src_2,
+                                     container_t **dst) {
+    int card = bitset_container_andnot(src_1, src_2, src_1);
+    if (card <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(src_1);
+        bitset_container_free(src_1);
+        return false;  // not bitset
+    } else {
+        *dst = src_1;
+        return true;
+    }
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/containers/mixed_andnot.c */
+/* begin file src/containers/mixed_equal.c */
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+bool array_container_equal_bitset(const array_container_t* container1,
+                                  const bitset_container_t* container2) {
+    if (container2->cardinality != BITSET_UNKNOWN_CARDINALITY) {
+        if (container2->cardinality != container1->cardinality) {
+            return false;
+        }
+    }
+    int32_t pos = 0;
+    for (int32_t i = 0; i < BITSET_CONTAINER_SIZE_IN_WORDS; ++i) {
+        uint64_t w = container2->words[i];
+        while (w != 0) {
+            uint64_t t = w & (~w + 1);
+            uint16_t r = i * 64 + roaring_trailing_zeroes(w);
+            if (pos >= container1->cardinality) {
+                return false;
+            }
+            if (container1->array[pos] != r) {
+                return false;
+            }
+            ++pos;
+            w ^= t;
+        }
+    }
+    return (pos == container1->cardinality);
+}
+
+bool run_container_equals_array(const run_container_t* container1,
+                                const array_container_t* container2) {
+    if (run_container_cardinality(container1) != container2->cardinality)
+        return false;
+    int32_t pos = 0;
+    for (int i = 0; i < container1->n_runs; ++i) {
+        const uint32_t run_start = container1->runs[i].value;
+        const uint32_t le = container1->runs[i].length;
+
+        if (container2->array[pos] != run_start) {
+            return false;
+        }
+
+        if (container2->array[pos + le] != run_start + le) {
+            return false;
+        }
+
+        pos += le + 1;
+    }
+    return true;
+}
+
+bool run_container_equals_bitset(const run_container_t* container1,
+                                 const bitset_container_t* container2) {
+    int run_card = run_container_cardinality(container1);
+    int bitset_card = (container2->cardinality != BITSET_UNKNOWN_CARDINALITY)
+                          ? container2->cardinality
+                          : bitset_container_compute_cardinality(container2);
+    if (bitset_card != run_card) {
+        return false;
+    }
+
+    for (int32_t i = 0; i < container1->n_runs; i++) {
+        uint32_t begin = container1->runs[i].value;
+        if (container1->runs[i].length) {
+            uint32_t end = begin + container1->runs[i].length + 1;
+            if (!bitset_container_contains_range(container2, begin, end)) {
+                return false;
+            }
+        } else {
+            if (!bitset_container_contains(container2, begin)) {
+                return false;
+            }
+        }
+    }
+
+    return true;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/containers/mixed_equal.c */
+/* begin file src/containers/mixed_intersection.c */
+/*
+ * mixed_intersection.c
+ *
+ */
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Compute the intersection of src_1 and src_2 and write the result to
+ * dst.  */
+void array_bitset_container_intersection(const array_container_t *src_1,
+                                         const bitset_container_t *src_2,
+                                         array_container_t *dst) {
+    if (dst->capacity < src_1->cardinality) {
+        array_container_grow(dst, src_1->cardinality, false);
+    }
+    int32_t newcard = 0;  // dst could be src_1
+    const int32_t origcard = src_1->cardinality;
+    for (int i = 0; i < origcard; ++i) {
+        uint16_t key = src_1->array[i];
+        // this branchless approach is much faster...
+        dst->array[newcard] = key;
+        newcard += bitset_container_contains(src_2, key);
+        /**
+         * we could do it this way instead...
+         * if (bitset_container_contains(src_2, key)) {
+         * dst->array[newcard++] = key;
+         * }
+         * but if the result is unpredictible, the processor generates
+         * many mispredicted branches.
+         * Difference can be huge (from 3 cycles when predictible all the way
+         * to 16 cycles when unpredictible.
+         * See
+         * https://github.com/lemire/Code-used-on-Daniel-Lemire-s-blog/blob/master/extra/bitset/c/arraybitsetintersection.c
+         */
+    }
+    dst->cardinality = newcard;
+}
+
+/* Compute the size of the intersection of src_1 and src_2. */
+int array_bitset_container_intersection_cardinality(
+    const array_container_t *src_1, const bitset_container_t *src_2) {
+    int32_t newcard = 0;
+    const int32_t origcard = src_1->cardinality;
+    for (int i = 0; i < origcard; ++i) {
+        uint16_t key = src_1->array[i];
+        newcard += bitset_container_contains(src_2, key);
+    }
+    return newcard;
+}
+
+bool array_bitset_container_intersect(const array_container_t *src_1,
+                                      const bitset_container_t *src_2) {
+    const int32_t origcard = src_1->cardinality;
+    for (int i = 0; i < origcard; ++i) {
+        uint16_t key = src_1->array[i];
+        if (bitset_container_contains(src_2, key)) return true;
+    }
+    return false;
+}
+
+/* Compute the intersection of src_1 and src_2 and write the result to
+ * dst. It is allowed for dst to be equal to src_1. We assume that dst is a
+ * valid container. */
+void array_run_container_intersection(const array_container_t *src_1,
+                                      const run_container_t *src_2,
+                                      array_container_t *dst) {
+    if (run_container_is_full(src_2)) {
+        if (dst != src_1) array_container_copy(src_1, dst);
+        return;
+    }
+    if (dst->capacity < src_1->cardinality) {
+        array_container_grow(dst, src_1->cardinality, false);
+    }
+    if (src_2->n_runs == 0) {
+        return;
+    }
+    int32_t rlepos = 0;
+    int32_t arraypos = 0;
+    rle16_t rle = src_2->runs[rlepos];
+    int32_t newcard = 0;
+    while (arraypos < src_1->cardinality) {
+        const uint16_t arrayval = src_1->array[arraypos];
+        while (rle.value + rle.length <
+               arrayval) {  // this will frequently be false
+            ++rlepos;
+            if (rlepos == src_2->n_runs) {
+                dst->cardinality = newcard;
+                return;  // we are done
+            }
+            rle = src_2->runs[rlepos];
+        }
+        if (rle.value > arrayval) {
+            arraypos = advanceUntil(src_1->array, arraypos, src_1->cardinality,
+                                    rle.value);
+        } else {
+            dst->array[newcard] = arrayval;
+            newcard++;
+            arraypos++;
+        }
+    }
+    dst->cardinality = newcard;
+}
+
+/* Compute the intersection of src_1 and src_2 and write the result to
+ * *dst. If the result is true then the result is a bitset_container_t
+ * otherwise is a array_container_t. If *dst ==  src_2, an in-place processing
+ * is attempted.*/
+bool run_bitset_container_intersection(const run_container_t *src_1,
+                                       const bitset_container_t *src_2,
+                                       container_t **dst) {
+    if (run_container_is_full(src_1)) {
+        if (*dst != src_2) *dst = bitset_container_clone(src_2);
+        return true;
+    }
+    int32_t card = run_container_cardinality(src_1);
+    if (card <= DEFAULT_MAX_SIZE) {
+        // result can only be an array (assuming that we never make a
+        // RunContainer)
+        if (card > src_2->cardinality) {
+            card = src_2->cardinality;
+        }
+        array_container_t *answer = array_container_create_given_capacity(card);
+        *dst = answer;
+        if (*dst == NULL) {
+            return false;
+        }
+        for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+            rle16_t rle = src_1->runs[rlepos];
+            uint32_t endofrun = (uint32_t)rle.value + rle.length;
+            for (uint32_t runValue = rle.value; runValue <= endofrun;
+                 ++runValue) {
+                answer->array[answer->cardinality] = (uint16_t)runValue;
+                answer->cardinality +=
+                    bitset_container_contains(src_2, runValue);
+            }
+        }
+        return false;
+    }
+    if (*dst == src_2) {  // we attempt in-place
+        bitset_container_t *answer = CAST_bitset(*dst);
+        uint32_t start = 0;
+        for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+            const rle16_t rle = src_1->runs[rlepos];
+            uint32_t end = rle.value;
+            bitset_reset_range(src_2->words, start, end);
+
+            start = end + rle.length + 1;
+        }
+        bitset_reset_range(src_2->words, start, UINT32_C(1) << 16);
+        answer->cardinality = bitset_container_compute_cardinality(answer);
+        if (src_2->cardinality > DEFAULT_MAX_SIZE) {
+            return true;
+        } else {
+            array_container_t *newanswer = array_container_from_bitset(src_2);
+            if (newanswer == NULL) {
+                *dst = NULL;
+                return false;
+            }
+            *dst = newanswer;
+            return false;
+        }
+    } else {  // no inplace
+        // we expect the answer to be a bitmap (if we are lucky)
+        bitset_container_t *answer = bitset_container_clone(src_2);
+
+        *dst = answer;
+        if (answer == NULL) {
+            return true;
+        }
+        uint32_t start = 0;
+        for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+            const rle16_t rle = src_1->runs[rlepos];
+            uint32_t end = rle.value;
+            bitset_reset_range(answer->words, start, end);
+            start = end + rle.length + 1;
+        }
+        bitset_reset_range(answer->words, start, UINT32_C(1) << 16);
+        answer->cardinality = bitset_container_compute_cardinality(answer);
+
+        if (answer->cardinality > DEFAULT_MAX_SIZE) {
+            return true;
+        } else {
+            array_container_t *newanswer = array_container_from_bitset(answer);
+            bitset_container_free(CAST_bitset(*dst));
+            if (newanswer == NULL) {
+                *dst = NULL;
+                return false;
+            }
+            *dst = newanswer;
+            return false;
+        }
+    }
+}
+
+/* Compute the size of the intersection between src_1 and src_2 . */
+int array_run_container_intersection_cardinality(const array_container_t *src_1,
+                                                 const run_container_t *src_2) {
+    if (run_container_is_full(src_2)) {
+        return src_1->cardinality;
+    }
+    if (src_2->n_runs == 0) {
+        return 0;
+    }
+    int32_t rlepos = 0;
+    int32_t arraypos = 0;
+    rle16_t rle = src_2->runs[rlepos];
+    int32_t newcard = 0;
+    while (arraypos < src_1->cardinality) {
+        const uint16_t arrayval = src_1->array[arraypos];
+        while (rle.value + rle.length <
+               arrayval) {  // this will frequently be false
+            ++rlepos;
+            if (rlepos == src_2->n_runs) {
+                return newcard;  // we are done
+            }
+            rle = src_2->runs[rlepos];
+        }
+        if (rle.value > arrayval) {
+            arraypos = advanceUntil(src_1->array, arraypos, src_1->cardinality,
+                                    rle.value);
+        } else {
+            newcard++;
+            arraypos++;
+        }
+    }
+    return newcard;
+}
+
+/* Compute the intersection  between src_1 and src_2
+ **/
+int run_bitset_container_intersection_cardinality(
+    const run_container_t *src_1, const bitset_container_t *src_2) {
+    if (run_container_is_full(src_1)) {
+        return bitset_container_cardinality(src_2);
+    }
+    int answer = 0;
+    for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+        rle16_t rle = src_1->runs[rlepos];
+        answer +=
+            bitset_lenrange_cardinality(src_2->words, rle.value, rle.length);
+    }
+    return answer;
+}
+
+bool array_run_container_intersect(const array_container_t *src_1,
+                                   const run_container_t *src_2) {
+    if (run_container_is_full(src_2)) {
+        return !array_container_empty(src_1);
+    }
+    if (src_2->n_runs == 0) {
+        return false;
+    }
+    int32_t rlepos = 0;
+    int32_t arraypos = 0;
+    rle16_t rle = src_2->runs[rlepos];
+    while (arraypos < src_1->cardinality) {
+        const uint16_t arrayval = src_1->array[arraypos];
+        while (rle.value + rle.length <
+               arrayval) {  // this will frequently be false
+            ++rlepos;
+            if (rlepos == src_2->n_runs) {
+                return false;  // we are done
+            }
+            rle = src_2->runs[rlepos];
+        }
+        if (rle.value > arrayval) {
+            arraypos = advanceUntil(src_1->array, arraypos, src_1->cardinality,
+                                    rle.value);
+        } else {
+            return true;
+        }
+    }
+    return false;
+}
+
+/* Compute the intersection  between src_1 and src_2
+ **/
+bool run_bitset_container_intersect(const run_container_t *src_1,
+                                    const bitset_container_t *src_2) {
+    if (run_container_is_full(src_1)) {
+        return !bitset_container_empty(src_2);
+    }
+    for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+        rle16_t rle = src_1->runs[rlepos];
+        if (!bitset_lenrange_empty(src_2->words, rle.value, rle.length))
+            return true;
+    }
+    return false;
+}
+
+/*
+ * Compute the intersection between src_1 and src_2 and write the result
+ * to *dst. If the return function is true, the result is a bitset_container_t
+ * otherwise is a array_container_t.
+ */
+bool bitset_bitset_container_intersection(const bitset_container_t *src_1,
+                                          const bitset_container_t *src_2,
+                                          container_t **dst) {
+    const int newCardinality = bitset_container_and_justcard(src_1, src_2);
+    if (newCardinality > DEFAULT_MAX_SIZE) {
+        *dst = bitset_container_create();
+        if (*dst != NULL) {
+            bitset_container_and_nocard(src_1, src_2, CAST_bitset(*dst));
+            CAST_bitset(*dst)->cardinality = newCardinality;
+        }
+        return true;  // it is a bitset
+    }
+    *dst = array_container_create_given_capacity(newCardinality);
+    if (*dst != NULL) {
+        CAST_array(*dst)->cardinality = newCardinality;
+        bitset_extract_intersection_setbits_uint16(
+            src_1->words, src_2->words, BITSET_CONTAINER_SIZE_IN_WORDS,
+            CAST_array(*dst)->array, 0);
+    }
+    return false;  // not a bitset
+}
+
+bool bitset_bitset_container_intersection_inplace(
+    bitset_container_t *src_1, const bitset_container_t *src_2,
+    container_t **dst) {
+    const int newCardinality = bitset_container_and_justcard(src_1, src_2);
+    if (newCardinality > DEFAULT_MAX_SIZE) {
+        *dst = src_1;
+        bitset_container_and_nocard(src_1, src_2, src_1);
+        CAST_bitset(*dst)->cardinality = newCardinality;
+        return true;  // it is a bitset
+    }
+    *dst = array_container_create_given_capacity(newCardinality);
+    if (*dst != NULL) {
+        CAST_array(*dst)->cardinality = newCardinality;
+        bitset_extract_intersection_setbits_uint16(
+            src_1->words, src_2->words, BITSET_CONTAINER_SIZE_IN_WORDS,
+            CAST_array(*dst)->array, 0);
+    }
+    return false;  // not a bitset
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/containers/mixed_intersection.c */
+/* begin file src/containers/mixed_negation.c */
+/*
+ * mixed_negation.c
+ *
+ */
+
+#include <assert.h>
+#include <string.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+// TODO: make simplified and optimized negation code across
+// the full range.
+
+/* Negation across the entire range of the container.
+ * Compute the  negation of src  and write the result
+ * to *dst. The complement of a
+ * sufficiently sparse set will always be dense and a hence a bitmap
+' * We assume that dst is pre-allocated and a valid bitset container
+ * There can be no in-place version.
+ */
+void array_container_negation(const array_container_t *src,
+                              bitset_container_t *dst) {
+    uint64_t card = UINT64_C(1 << 16);
+    bitset_container_set_all(dst);
+
+    if (src->cardinality == 0) {
+        return;
+    }
+
+    dst->cardinality = (int32_t)bitset_clear_list(dst->words, card, src->array,
+                                                  (uint64_t)src->cardinality);
+}
+
+/* Negation across the entire range of the container
+ * Compute the  negation of src  and write the result
+ * to *dst.  A true return value indicates a bitset result,
+ * otherwise the result is an array container.
+ *  We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+bool bitset_container_negation(const bitset_container_t *src,
+                               container_t **dst) {
+    return bitset_container_negation_range(src, 0, (1 << 16), dst);
+}
+
+/* inplace version */
+/*
+ * Same as bitset_container_negation except that if the output is to
+ * be a
+ * bitset_container_t, then src is modified and no allocation is made.
+ * If the output is to be an array_container_t, then caller is responsible
+ * to free the container.
+ * In all cases, the result is in *dst.
+ */
+bool bitset_container_negation_inplace(bitset_container_t *src,
+                                       container_t **dst) {
+    return bitset_container_negation_range_inplace(src, 0, (1 << 16), dst);
+}
+
+/* Negation across the entire range of container
+ * Compute the  negation of src  and write the result
+ * to *dst.  Return values are the *_TYPECODES as defined * in containers.h
+ *  We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+int run_container_negation(const run_container_t *src, container_t **dst) {
+    return run_container_negation_range(src, 0, (1 << 16), dst);
+}
+
+/*
+ * Same as run_container_negation except that if the output is to
+ * be a
+ * run_container_t, and has the capacity to hold the result,
+ * then src is modified and no allocation is made.
+ * In all cases, the result is in *dst.
+ */
+int run_container_negation_inplace(run_container_t *src, container_t **dst) {
+    return run_container_negation_range_inplace(src, 0, (1 << 16), dst);
+}
+
+/* Negation across a range of the container.
+ * Compute the  negation of src  and write the result
+ * to *dst. Returns true if the result is a bitset container
+ * and false for an array container.  *dst is not preallocated.
+ */
+bool array_container_negation_range(const array_container_t *src,
+                                    const int range_start, const int range_end,
+                                    container_t **dst) {
+    /* close port of the Java implementation */
+    if (range_start >= range_end) {
+        *dst = array_container_clone(src);
+        return false;
+    }
+
+    int32_t start_index =
+        binarySearch(src->array, src->cardinality, (uint16_t)range_start);
+    if (start_index < 0) start_index = -start_index - 1;
+
+    int32_t last_index =
+        binarySearch(src->array, src->cardinality, (uint16_t)(range_end - 1));
+    if (last_index < 0) last_index = -last_index - 2;
+
+    const int32_t current_values_in_range = last_index - start_index + 1;
+    const int32_t span_to_be_flipped = range_end - range_start;
+    const int32_t new_values_in_range =
+        span_to_be_flipped - current_values_in_range;
+    const int32_t cardinality_change =
+        new_values_in_range - current_values_in_range;
+    const int32_t new_cardinality = src->cardinality + cardinality_change;
+
+    if (new_cardinality > DEFAULT_MAX_SIZE) {
+        bitset_container_t *temp = bitset_container_from_array(src);
+        bitset_flip_range(temp->words, (uint32_t)range_start,
+                          (uint32_t)range_end);
+        temp->cardinality = new_cardinality;
+        *dst = temp;
+        return true;
+    }
+
+    array_container_t *arr =
+        array_container_create_given_capacity(new_cardinality);
+    *dst = (container_t *)arr;
+    if (new_cardinality == 0) {
+        arr->cardinality = new_cardinality;
+        return false;  // we are done.
+    }
+    // copy stuff before the active area
+    memcpy(arr->array, src->array, start_index * sizeof(uint16_t));
+
+    // work on the range
+    int32_t out_pos = start_index, in_pos = start_index;
+    int32_t val_in_range = range_start;
+    for (; val_in_range < range_end && in_pos <= last_index; ++val_in_range) {
+        if ((uint16_t)val_in_range != src->array[in_pos]) {
+            arr->array[out_pos++] = (uint16_t)val_in_range;
+        } else {
+            ++in_pos;
+        }
+    }
+    for (; val_in_range < range_end; ++val_in_range)
+        arr->array[out_pos++] = (uint16_t)val_in_range;
+
+    // content after the active range
+    memcpy(arr->array + out_pos, src->array + (last_index + 1),
+           (src->cardinality - (last_index + 1)) * sizeof(uint16_t));
+    arr->cardinality = new_cardinality;
+    return false;
+}
+
+/* Even when the result would fit, it is unclear how to make an
+ * inplace version without inefficient copying.
+ */
+
+bool array_container_negation_range_inplace(array_container_t *src,
+                                            const int range_start,
+                                            const int range_end,
+                                            container_t **dst) {
+    bool ans = array_container_negation_range(src, range_start, range_end, dst);
+    // TODO : try a real inplace version
+    array_container_free(src);
+    return ans;
+}
+
+/* Negation across a range of the container
+ * Compute the  negation of src  and write the result
+ * to *dst.  A true return value indicates a bitset result,
+ * otherwise the result is an array container.
+ *  We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+bool bitset_container_negation_range(const bitset_container_t *src,
+                                     const int range_start, const int range_end,
+                                     container_t **dst) {
+    // TODO maybe consider density-based estimate
+    // and sometimes build result directly as array, with
+    // conversion back to bitset if wrong.  Or determine
+    // actual result cardinality, then go directly for the known final cont.
+
+    // keep computation using bitsets as long as possible.
+    bitset_container_t *t = bitset_container_clone(src);
+    bitset_flip_range(t->words, (uint32_t)range_start, (uint32_t)range_end);
+    t->cardinality = bitset_container_compute_cardinality(t);
+
+    if (t->cardinality > DEFAULT_MAX_SIZE) {
+        *dst = t;
+        return true;
+    } else {
+        *dst = array_container_from_bitset(t);
+        bitset_container_free(t);
+        return false;
+    }
+}
+
+/* inplace version */
+/*
+ * Same as bitset_container_negation except that if the output is to
+ * be a
+ * bitset_container_t, then src is modified and no allocation is made.
+ * If the output is to be an array_container_t, then caller is responsible
+ * to free the container.
+ * In all cases, the result is in *dst.
+ */
+bool bitset_container_negation_range_inplace(bitset_container_t *src,
+                                             const int range_start,
+                                             const int range_end,
+                                             container_t **dst) {
+    bitset_flip_range(src->words, (uint32_t)range_start, (uint32_t)range_end);
+    src->cardinality = bitset_container_compute_cardinality(src);
+    if (src->cardinality > DEFAULT_MAX_SIZE) {
+        *dst = src;
+        return true;
+    }
+    *dst = array_container_from_bitset(src);
+    bitset_container_free(src);
+    return false;
+}
+
+/* Negation across a range of container
+ * Compute the  negation of src  and write the result
+ * to *dst. Return values are the *_TYPECODES as defined * in containers.h
+ *  We assume that dst is not pre-allocated. In
+ * case of failure, *dst will be NULL.
+ */
+int run_container_negation_range(const run_container_t *src,
+                                 const int range_start, const int range_end,
+                                 container_t **dst) {
+    uint8_t return_typecode;
+
+    // follows the Java implementation
+    if (range_end <= range_start) {
+        *dst = run_container_clone(src);
+        return RUN_CONTAINER_TYPE;
+    }
+
+    run_container_t *ans = run_container_create_given_capacity(
+        src->n_runs + 1);  // src->n_runs + 1);
+    int k = 0;
+    for (; k < src->n_runs && src->runs[k].value < range_start; ++k) {
+        ans->runs[k] = src->runs[k];
+        ans->n_runs++;
+    }
+
+    run_container_smart_append_exclusive(
+        ans, (uint16_t)range_start, (uint16_t)(range_end - range_start - 1));
+
+    for (; k < src->n_runs; ++k) {
+        run_container_smart_append_exclusive(ans, src->runs[k].value,
+                                             src->runs[k].length);
+    }
+
+    *dst = convert_run_to_efficient_container(ans, &return_typecode);
+    if (return_typecode != RUN_CONTAINER_TYPE) run_container_free(ans);
+
+    return return_typecode;
+}
+
+/*
+ * Same as run_container_negation except that if the output is to
+ * be a
+ * run_container_t, and has the capacity to hold the result,
+ * then src is modified and no allocation is made.
+ * In all cases, the result is in *dst.
+ */
+int run_container_negation_range_inplace(run_container_t *src,
+                                         const int range_start,
+                                         const int range_end,
+                                         container_t **dst) {
+    uint8_t return_typecode;
+
+    if (range_end <= range_start) {
+        *dst = src;
+        return RUN_CONTAINER_TYPE;
+    }
+
+    // TODO: efficient special case when range is 0 to 65535 inclusive
+
+    if (src->capacity == src->n_runs) {
+        // no excess room.  More checking to see if result can fit
+        bool last_val_before_range = false;
+        bool first_val_in_range = false;
+        bool last_val_in_range = false;
+        bool first_val_past_range = false;
+
+        if (range_start > 0)
+            last_val_before_range =
+                run_container_contains(src, (uint16_t)(range_start - 1));
+        first_val_in_range = run_container_contains(src, (uint16_t)range_start);
+
+        if (last_val_before_range == first_val_in_range) {
+            last_val_in_range =
+                run_container_contains(src, (uint16_t)(range_end - 1));
+            if (range_end != 0x10000)
+                first_val_past_range =
+                    run_container_contains(src, (uint16_t)range_end);
+
+            if (last_val_in_range ==
+                first_val_past_range) {  // no space for inplace
+                int ans = run_container_negation_range(src, range_start,
+                                                       range_end, dst);
+                run_container_free(src);
+                return ans;
+            }
+        }
+    }
+    // all other cases: result will fit
+
+    run_container_t *ans = src;
+    int my_nbr_runs = src->n_runs;
+
+    ans->n_runs = 0;
+    int k = 0;
+    for (; (k < my_nbr_runs) && (src->runs[k].value < range_start); ++k) {
+        // ans->runs[k] = src->runs[k]; (would be self-copy)
+        ans->n_runs++;
+    }
+
+    // as with Java implementation, use locals to give self a buffer of depth 1
+    rle16_t buffered = CROARING_MAKE_RLE16(0, 0);
+    rle16_t next = buffered;
+    if (k < my_nbr_runs) buffered = src->runs[k];
+
+    run_container_smart_append_exclusive(
+        ans, (uint16_t)range_start, (uint16_t)(range_end - range_start - 1));
+
+    for (; k < my_nbr_runs; ++k) {
+        if (k + 1 < my_nbr_runs) next = src->runs[k + 1];
+
+        run_container_smart_append_exclusive(ans, buffered.value,
+                                             buffered.length);
+        buffered = next;
+    }
+
+    *dst = convert_run_to_efficient_container(ans, &return_typecode);
+    if (return_typecode != RUN_CONTAINER_TYPE) run_container_free(ans);
+
+    return return_typecode;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/containers/mixed_negation.c */
+/* begin file src/containers/mixed_subset.c */
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+bool array_container_is_subset_bitset(const array_container_t* container1,
+                                      const bitset_container_t* container2) {
+    if (container2->cardinality != BITSET_UNKNOWN_CARDINALITY) {
+        if (container2->cardinality < container1->cardinality) {
+            return false;
+        }
+    }
+    for (int i = 0; i < container1->cardinality; ++i) {
+        if (!bitset_container_contains(container2, container1->array[i])) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool run_container_is_subset_array(const run_container_t* container1,
+                                   const array_container_t* container2) {
+    if (run_container_cardinality(container1) > container2->cardinality)
+        return false;
+    int32_t start_pos = -1, stop_pos = -1;
+    for (int i = 0; i < container1->n_runs; ++i) {
+        int32_t start = container1->runs[i].value;
+        int32_t stop = start + container1->runs[i].length;
+        start_pos = advanceUntil(container2->array, stop_pos,
+                                 container2->cardinality, start);
+        stop_pos = advanceUntil(container2->array, stop_pos,
+                                container2->cardinality, stop);
+        if (stop_pos == container2->cardinality) {
+            return false;
+        } else if (stop_pos - start_pos != stop - start ||
+                   container2->array[start_pos] != start ||
+                   container2->array[stop_pos] != stop) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool array_container_is_subset_run(const array_container_t* container1,
+                                   const run_container_t* container2) {
+    if (container1->cardinality > run_container_cardinality(container2))
+        return false;
+    int i_array = 0, i_run = 0;
+    while (i_array < container1->cardinality && i_run < container2->n_runs) {
+        uint32_t start = container2->runs[i_run].value;
+        uint32_t stop = start + container2->runs[i_run].length;
+        if (container1->array[i_array] < start) {
+            return false;
+        } else if (container1->array[i_array] > stop) {
+            i_run++;
+        } else {  // the value of the array is in the run
+            i_array++;
+        }
+    }
+    if (i_array == container1->cardinality) {
+        return true;
+    } else {
+        return false;
+    }
+}
+
+bool run_container_is_subset_bitset(const run_container_t* container1,
+                                    const bitset_container_t* container2) {
+    // todo: this code could be much faster
+    if (container2->cardinality != BITSET_UNKNOWN_CARDINALITY) {
+        if (container2->cardinality < run_container_cardinality(container1)) {
+            return false;
+        }
+    } else {
+        int32_t card = bitset_container_compute_cardinality(
+            container2);  // modify container2?
+        if (card < run_container_cardinality(container1)) {
+            return false;
+        }
+    }
+    for (int i = 0; i < container1->n_runs; ++i) {
+        uint32_t run_start = container1->runs[i].value;
+        uint32_t le = container1->runs[i].length;
+        for (uint32_t j = run_start; j <= run_start + le; ++j) {
+            if (!bitset_container_contains(container2, j)) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+bool bitset_container_is_subset_run(const bitset_container_t* container1,
+                                    const run_container_t* container2) {
+    // todo: this code could be much faster
+    if (container1->cardinality != BITSET_UNKNOWN_CARDINALITY) {
+        if (container1->cardinality > run_container_cardinality(container2)) {
+            return false;
+        }
+    }
+    int32_t i_bitset = 0, i_run = 0;
+    while (i_bitset < BITSET_CONTAINER_SIZE_IN_WORDS &&
+           i_run < container2->n_runs) {
+        uint64_t w = container1->words[i_bitset];
+        while (w != 0 && i_run < container2->n_runs) {
+            uint32_t start = container2->runs[i_run].value;
+            uint32_t stop = start + container2->runs[i_run].length;
+            uint64_t t = w & (~w + 1);
+            uint16_t r = i_bitset * 64 + roaring_trailing_zeroes(w);
+            if (r < start) {
+                return false;
+            } else if (r > stop) {
+                i_run++;
+                continue;
+            } else {
+                w ^= t;
+            }
+        }
+        if (w == 0) {
+            i_bitset++;
+        } else {
+            return false;
+        }
+    }
+    if (i_bitset < BITSET_CONTAINER_SIZE_IN_WORDS) {
+        // terminated iterating on the run containers, check that rest of bitset
+        // is empty
+        for (; i_bitset < BITSET_CONTAINER_SIZE_IN_WORDS; i_bitset++) {
+            if (container1->words[i_bitset] != 0) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/containers/mixed_subset.c */
+/* begin file src/containers/mixed_union.c */
+/*
+ * mixed_union.c
+ *
+ */
+
+#include <assert.h>
+#include <string.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Compute the union of src_1 and src_2 and write the result to
+ * dst.  */
+void array_bitset_container_union(const array_container_t *src_1,
+                                  const bitset_container_t *src_2,
+                                  bitset_container_t *dst) {
+    if (src_2 != dst) bitset_container_copy(src_2, dst);
+    dst->cardinality = (int32_t)bitset_set_list_withcard(
+        dst->words, dst->cardinality, src_1->array, src_1->cardinality);
+}
+
+/* Compute the union of src_1 and src_2 and write the result to
+ * dst. It is allowed for src_2 to be dst.  This version does not
+ * update the cardinality of dst (it is set to BITSET_UNKNOWN_CARDINALITY). */
+void array_bitset_container_lazy_union(const array_container_t *src_1,
+                                       const bitset_container_t *src_2,
+                                       bitset_container_t *dst) {
+    if (src_2 != dst) bitset_container_copy(src_2, dst);
+    bitset_set_list(dst->words, src_1->array, src_1->cardinality);
+    dst->cardinality = BITSET_UNKNOWN_CARDINALITY;
+}
+
+void run_bitset_container_union(const run_container_t *src_1,
+                                const bitset_container_t *src_2,
+                                bitset_container_t *dst) {
+    assert(!run_container_is_full(src_1));  // catch this case upstream
+    if (src_2 != dst) bitset_container_copy(src_2, dst);
+    for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+        rle16_t rle = src_1->runs[rlepos];
+        bitset_set_lenrange(dst->words, rle.value, rle.length);
+    }
+    dst->cardinality = bitset_container_compute_cardinality(dst);
+}
+
+void run_bitset_container_lazy_union(const run_container_t *src_1,
+                                     const bitset_container_t *src_2,
+                                     bitset_container_t *dst) {
+    assert(!run_container_is_full(src_1));  // catch this case upstream
+    if (src_2 != dst) bitset_container_copy(src_2, dst);
+    for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+        rle16_t rle = src_1->runs[rlepos];
+        bitset_set_lenrange(dst->words, rle.value, rle.length);
+    }
+    dst->cardinality = BITSET_UNKNOWN_CARDINALITY;
+}
+
+// why do we leave the result as a run container??
+void array_run_container_union(const array_container_t *src_1,
+                               const run_container_t *src_2,
+                               run_container_t *dst) {
+    if (run_container_is_full(src_2)) {
+        run_container_copy(src_2, dst);
+        return;
+    }
+    // TODO: see whether the "2*" is spurious
+    run_container_grow(dst, 2 * (src_1->cardinality + src_2->n_runs), false);
+    int32_t rlepos = 0;
+    int32_t arraypos = 0;
+    rle16_t previousrle;
+    if (src_2->runs[rlepos].value <= src_1->array[arraypos]) {
+        previousrle = run_container_append_first(dst, src_2->runs[rlepos]);
+        rlepos++;
+    } else {
+        previousrle =
+            run_container_append_value_first(dst, src_1->array[arraypos]);
+        arraypos++;
+    }
+    while ((rlepos < src_2->n_runs) && (arraypos < src_1->cardinality)) {
+        if (src_2->runs[rlepos].value <= src_1->array[arraypos]) {
+            run_container_append(dst, src_2->runs[rlepos], &previousrle);
+            rlepos++;
+        } else {
+            run_container_append_value(dst, src_1->array[arraypos],
+                                       &previousrle);
+            arraypos++;
+        }
+    }
+    if (arraypos < src_1->cardinality) {
+        while (arraypos < src_1->cardinality) {
+            run_container_append_value(dst, src_1->array[arraypos],
+                                       &previousrle);
+            arraypos++;
+        }
+    } else {
+        while (rlepos < src_2->n_runs) {
+            run_container_append(dst, src_2->runs[rlepos], &previousrle);
+            rlepos++;
+        }
+    }
+}
+
+void array_run_container_inplace_union(const array_container_t *src_1,
+                                       run_container_t *src_2) {
+    if (run_container_is_full(src_2)) {
+        return;
+    }
+    const int32_t maxoutput = src_1->cardinality + src_2->n_runs;
+    const int32_t neededcapacity = maxoutput + src_2->n_runs;
+    if (src_2->capacity < neededcapacity)
+        run_container_grow(src_2, neededcapacity, true);
+    memmove(src_2->runs + maxoutput, src_2->runs,
+            src_2->n_runs * sizeof(rle16_t));
+    rle16_t *inputsrc2 = src_2->runs + maxoutput;
+    int32_t rlepos = 0;
+    int32_t arraypos = 0;
+    int src2nruns = src_2->n_runs;
+    src_2->n_runs = 0;
+
+    rle16_t previousrle;
+
+    if (inputsrc2[rlepos].value <= src_1->array[arraypos]) {
+        previousrle = run_container_append_first(src_2, inputsrc2[rlepos]);
+        rlepos++;
+    } else {
+        previousrle =
+            run_container_append_value_first(src_2, src_1->array[arraypos]);
+        arraypos++;
+    }
+
+    while ((rlepos < src2nruns) && (arraypos < src_1->cardinality)) {
+        if (inputsrc2[rlepos].value <= src_1->array[arraypos]) {
+            run_container_append(src_2, inputsrc2[rlepos], &previousrle);
+            rlepos++;
+        } else {
+            run_container_append_value(src_2, src_1->array[arraypos],
+                                       &previousrle);
+            arraypos++;
+        }
+    }
+    if (arraypos < src_1->cardinality) {
+        while (arraypos < src_1->cardinality) {
+            run_container_append_value(src_2, src_1->array[arraypos],
+                                       &previousrle);
+            arraypos++;
+        }
+    } else {
+        while (rlepos < src2nruns) {
+            run_container_append(src_2, inputsrc2[rlepos], &previousrle);
+            rlepos++;
+        }
+    }
+}
+
+bool array_array_container_union(const array_container_t *src_1,
+                                 const array_container_t *src_2,
+                                 container_t **dst) {
+    int totalCardinality = src_1->cardinality + src_2->cardinality;
+    if (totalCardinality <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_create_given_capacity(totalCardinality);
+        if (*dst != NULL) {
+            array_container_union(src_1, src_2, CAST_array(*dst));
+        } else {
+            return true;  // otherwise failure won't be caught
+        }
+        return false;  // not a bitset
+    }
+    *dst = bitset_container_create();
+    bool returnval = true;  // expect a bitset
+    if (*dst != NULL) {
+        bitset_container_t *ourbitset = CAST_bitset(*dst);
+        bitset_set_list(ourbitset->words, src_1->array, src_1->cardinality);
+        ourbitset->cardinality = (int32_t)bitset_set_list_withcard(
+            ourbitset->words, src_1->cardinality, src_2->array,
+            src_2->cardinality);
+        if (ourbitset->cardinality <= DEFAULT_MAX_SIZE) {
+            // need to convert!
+            *dst = array_container_from_bitset(ourbitset);
+            bitset_container_free(ourbitset);
+            returnval = false;  // not going to be a bitset
+        }
+    }
+    return returnval;
+}
+
+bool array_array_container_inplace_union(array_container_t *src_1,
+                                         const array_container_t *src_2,
+                                         container_t **dst) {
+    int totalCardinality = src_1->cardinality + src_2->cardinality;
+    *dst = NULL;
+    if (totalCardinality <= DEFAULT_MAX_SIZE) {
+        if (src_1->capacity < totalCardinality) {
+            *dst = array_container_create_given_capacity(
+                2 * totalCardinality);  // be purposefully generous
+            if (*dst != NULL) {
+                array_container_union(src_1, src_2, CAST_array(*dst));
+            } else {
+                return true;  // otherwise failure won't be caught
+            }
+            return false;  // not a bitset
+        } else {
+            memmove(src_1->array + src_2->cardinality, src_1->array,
+                    src_1->cardinality * sizeof(uint16_t));
+            // In theory, we could use fast_union_uint16, but it is unsafe. It
+            // fails with Intel compilers in particular.
+            // https://github.com/RoaringBitmap/CRoaring/pull/452
+            // See report https://github.com/RoaringBitmap/CRoaring/issues/476
+            src_1->cardinality = (int32_t)union_uint16(
+                src_1->array + src_2->cardinality, src_1->cardinality,
+                src_2->array, src_2->cardinality, src_1->array);
+            return false;  // not a bitset
+        }
+    }
+    *dst = bitset_container_create();
+    bool returnval = true;  // expect a bitset
+    if (*dst != NULL) {
+        bitset_container_t *ourbitset = CAST_bitset(*dst);
+        bitset_set_list(ourbitset->words, src_1->array, src_1->cardinality);
+        ourbitset->cardinality = (int32_t)bitset_set_list_withcard(
+            ourbitset->words, src_1->cardinality, src_2->array,
+            src_2->cardinality);
+        if (ourbitset->cardinality <= DEFAULT_MAX_SIZE) {
+            // need to convert!
+            if (src_1->capacity < ourbitset->cardinality) {
+                array_container_grow(src_1, ourbitset->cardinality, false);
+            }
+
+            bitset_extract_setbits_uint16(ourbitset->words,
+                                          BITSET_CONTAINER_SIZE_IN_WORDS,
+                                          src_1->array, 0);
+            src_1->cardinality = ourbitset->cardinality;
+            *dst = src_1;
+            bitset_container_free(ourbitset);
+            returnval = false;  // not going to be a bitset
+        }
+    }
+    return returnval;
+}
+
+bool array_array_container_lazy_union(const array_container_t *src_1,
+                                      const array_container_t *src_2,
+                                      container_t **dst) {
+    int totalCardinality = src_1->cardinality + src_2->cardinality;
+    //
+    // We assume that operations involving bitset containers will be faster than
+    // operations involving solely array containers, except maybe when array
+    // containers are small. Indeed, for example, it is cheap to compute the
+    // union between an array and a bitset container, generally more so than
+    // between a large array and another array. So it is advantageous to favour
+    // bitset containers during the computation. Of course, if we convert array
+    // containers eagerly to bitset containers, we may later need to revert the
+    // bitset containers to array containerr to satisfy the Roaring format
+    // requirements, but such one-time conversions at the end may not be overly
+    // expensive. We arrived to this design based on extensive benchmarking.
+    //
+    if (totalCardinality <= ARRAY_LAZY_LOWERBOUND) {
+        *dst = array_container_create_given_capacity(totalCardinality);
+        if (*dst != NULL) {
+            array_container_union(src_1, src_2, CAST_array(*dst));
+        } else {
+            return true;  // otherwise failure won't be caught
+        }
+        return false;  // not a bitset
+    }
+    *dst = bitset_container_create();
+    bool returnval = true;  // expect a bitset
+    if (*dst != NULL) {
+        bitset_container_t *ourbitset = CAST_bitset(*dst);
+        bitset_set_list(ourbitset->words, src_1->array, src_1->cardinality);
+        bitset_set_list(ourbitset->words, src_2->array, src_2->cardinality);
+        ourbitset->cardinality = BITSET_UNKNOWN_CARDINALITY;
+    }
+    return returnval;
+}
+
+bool array_array_container_lazy_inplace_union(array_container_t *src_1,
+                                              const array_container_t *src_2,
+                                              container_t **dst) {
+    int totalCardinality = src_1->cardinality + src_2->cardinality;
+    *dst = NULL;
+    //
+    // We assume that operations involving bitset containers will be faster than
+    // operations involving solely array containers, except maybe when array
+    // containers are small. Indeed, for example, it is cheap to compute the
+    // union between an array and a bitset container, generally more so than
+    // between a large array and another array. So it is advantageous to favour
+    // bitset containers during the computation. Of course, if we convert array
+    // containers eagerly to bitset containers, we may later need to revert the
+    // bitset containers to array containerr to satisfy the Roaring format
+    // requirements, but such one-time conversions at the end may not be overly
+    // expensive. We arrived to this design based on extensive benchmarking.
+    //
+    if (totalCardinality <= ARRAY_LAZY_LOWERBOUND) {
+        if (src_1->capacity < totalCardinality) {
+            *dst = array_container_create_given_capacity(
+                2 * totalCardinality);  // be purposefully generous
+            if (*dst != NULL) {
+                array_container_union(src_1, src_2, CAST_array(*dst));
+            } else {
+                return true;  // otherwise failure won't be caught
+            }
+            return false;  // not a bitset
+        } else {
+            memmove(src_1->array + src_2->cardinality, src_1->array,
+                    src_1->cardinality * sizeof(uint16_t));
+            /*
+              Next line is safe:
+
+              We just need to focus on the reading and writing performed on
+              array1. In `union_vector16`, both vectorized and scalar code still
+              obey the basic rule: read from two inputs, do the union, and then
+              write the output.
+
+              Let's say the length(cardinality) of input2 is L2:
+              ```
+                  |<-  L2  ->|
+              array1: [output--- |input 1---|---]
+              array2: [input 2---]
+              ```
+              Let's define 3 __m128i pointers, `pos1` starts from `input1`,
+              `pos2` starts from `input2`, these 2 point at the next byte to
+              read, `out` starts from `output`, pointing at the next byte to
+              overwrite.
+              ```
+              array1: [output--- |input 1---|---]
+                          ^          ^
+                      out        pos1
+              array2: [input 2---]
+                          ^
+                          pos2
+              ```
+              The union output always contains less or equal number of elements
+              than all inputs added, so we have:
+              ```
+              out <= pos1 + pos2
+              ```
+              therefore:
+              ```
+              out <= pos1 + L2
+              ```
+              which means you will not overwrite data beyond pos1, so the data
+              haven't read is safe, and we don't care the data already read.
+            */
+            src_1->cardinality = (int32_t)fast_union_uint16(
+                src_1->array + src_2->cardinality, src_1->cardinality,
+                src_2->array, src_2->cardinality, src_1->array);
+            return false;  // not a bitset
+        }
+    }
+    *dst = bitset_container_create();
+    bool returnval = true;  // expect a bitset
+    if (*dst != NULL) {
+        bitset_container_t *ourbitset = CAST_bitset(*dst);
+        bitset_set_list(ourbitset->words, src_1->array, src_1->cardinality);
+        bitset_set_list(ourbitset->words, src_2->array, src_2->cardinality);
+        ourbitset->cardinality = BITSET_UNKNOWN_CARDINALITY;
+    }
+    return returnval;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/containers/mixed_union.c */
+/* begin file src/containers/mixed_xor.c */
+/*
+ * mixed_xor.c
+ */
+
+#include <assert.h>
+#include <string.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst (which has no container initially).
+ * Result is true iff dst is a bitset  */
+bool array_bitset_container_xor(const array_container_t *src_1,
+                                const bitset_container_t *src_2,
+                                container_t **dst) {
+    bitset_container_t *result = bitset_container_create();
+    bitset_container_copy(src_2, result);
+    result->cardinality = (int32_t)bitset_flip_list_withcard(
+        result->words, result->cardinality, src_1->array, src_1->cardinality);
+
+    // do required type conversions.
+    if (result->cardinality <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(result);
+        bitset_container_free(result);
+        return false;  // not bitset
+    }
+    *dst = result;
+    return true;  // bitset
+}
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst. It is allowed for src_2 to be dst.  This version does not
+ * update the cardinality of dst (it is set to BITSET_UNKNOWN_CARDINALITY).
+ */
+
+void array_bitset_container_lazy_xor(const array_container_t *src_1,
+                                     const bitset_container_t *src_2,
+                                     bitset_container_t *dst) {
+    if (src_2 != dst) bitset_container_copy(src_2, dst);
+    bitset_flip_list(dst->words, src_1->array, src_1->cardinality);
+    dst->cardinality = BITSET_UNKNOWN_CARDINALITY;
+}
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset"). dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool run_bitset_container_xor(const run_container_t *src_1,
+                              const bitset_container_t *src_2,
+                              container_t **dst) {
+    bitset_container_t *result = bitset_container_create();
+
+    bitset_container_copy(src_2, result);
+    for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+        rle16_t rle = src_1->runs[rlepos];
+        bitset_flip_range(result->words, rle.value,
+                          rle.value + rle.length + UINT32_C(1));
+    }
+    result->cardinality = bitset_container_compute_cardinality(result);
+
+    if (result->cardinality <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(result);
+        bitset_container_free(result);
+        return false;  // not bitset
+    }
+    *dst = result;
+    return true;  // bitset
+}
+
+/* lazy xor.  Dst is initialized and may be equal to src_2.
+ *  Result is left as a bitset container, even if actual
+ *  cardinality would dictate an array container.
+ */
+
+void run_bitset_container_lazy_xor(const run_container_t *src_1,
+                                   const bitset_container_t *src_2,
+                                   bitset_container_t *dst) {
+    if (src_2 != dst) bitset_container_copy(src_2, dst);
+    for (int32_t rlepos = 0; rlepos < src_1->n_runs; ++rlepos) {
+        rle16_t rle = src_1->runs[rlepos];
+        bitset_flip_range(dst->words, rle.value,
+                          rle.value + rle.length + UINT32_C(1));
+    }
+    dst->cardinality = BITSET_UNKNOWN_CARDINALITY;
+}
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+int array_run_container_xor(const array_container_t *src_1,
+                            const run_container_t *src_2, container_t **dst) {
+    // semi following Java XOR implementation as of May 2016
+    // the C OR implementation works quite differently and can return a run
+    // container
+    // TODO could optimize for full run containers.
+
+    // use of lazy following Java impl.
+    const int arbitrary_threshold = 32;
+    if (src_1->cardinality < arbitrary_threshold) {
+        run_container_t *ans = run_container_create();
+        array_run_container_lazy_xor(src_1, src_2, ans);  // keeps runs.
+        uint8_t typecode_after;
+        *dst =
+            convert_run_to_efficient_container_and_free(ans, &typecode_after);
+        return typecode_after;
+    }
+
+    int card = run_container_cardinality(src_2);
+    if (card <= DEFAULT_MAX_SIZE) {
+        // Java implementation works with the array, xoring the run elements via
+        // iterator
+        array_container_t *temp = array_container_from_run(src_2);
+        bool ret_is_bitset = array_array_container_xor(temp, src_1, dst);
+        array_container_free(temp);
+        return ret_is_bitset ? BITSET_CONTAINER_TYPE : ARRAY_CONTAINER_TYPE;
+
+    } else {  // guess that it will end up as a bitset
+        bitset_container_t *result = bitset_container_from_run(src_2);
+        bool is_bitset = bitset_array_container_ixor(result, src_1, dst);
+        // any necessary type conversion has been done by the ixor
+        int retval = (is_bitset ? BITSET_CONTAINER_TYPE : ARRAY_CONTAINER_TYPE);
+        return retval;
+    }
+}
+
+/* Dst is a valid run container. (Can it be src_2? Let's say not.)
+ * Leaves result as run container, even if other options are
+ * smaller.
+ */
+
+void array_run_container_lazy_xor(const array_container_t *src_1,
+                                  const run_container_t *src_2,
+                                  run_container_t *dst) {
+    run_container_grow(dst, src_1->cardinality + src_2->n_runs, false);
+    int32_t rlepos = 0;
+    int32_t arraypos = 0;
+    dst->n_runs = 0;
+
+    while ((rlepos < src_2->n_runs) && (arraypos < src_1->cardinality)) {
+        if (src_2->runs[rlepos].value <= src_1->array[arraypos]) {
+            run_container_smart_append_exclusive(dst, src_2->runs[rlepos].value,
+                                                 src_2->runs[rlepos].length);
+            rlepos++;
+        } else {
+            run_container_smart_append_exclusive(dst, src_1->array[arraypos],
+                                                 0);
+            arraypos++;
+        }
+    }
+    while (arraypos < src_1->cardinality) {
+        run_container_smart_append_exclusive(dst, src_1->array[arraypos], 0);
+        arraypos++;
+    }
+    while (rlepos < src_2->n_runs) {
+        run_container_smart_append_exclusive(dst, src_2->runs[rlepos].value,
+                                             src_2->runs[rlepos].length);
+        rlepos++;
+    }
+}
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+int run_run_container_xor(const run_container_t *src_1,
+                          const run_container_t *src_2, container_t **dst) {
+    run_container_t *ans = run_container_create();
+    run_container_xor(src_1, src_2, ans);
+    uint8_t typecode_after;
+    *dst = convert_run_to_efficient_container_and_free(ans, &typecode_after);
+    return typecode_after;
+}
+
+/*
+ * Java implementation (as of May 2016) for array_run, run_run
+ * and  bitset_run don't do anything different for inplace.
+ * Could adopt the mixed_union.c approach instead (ie, using
+ * smart_append_exclusive)
+ *
+ */
+
+bool array_array_container_xor(const array_container_t *src_1,
+                               const array_container_t *src_2,
+                               container_t **dst) {
+    int totalCardinality =
+        src_1->cardinality + src_2->cardinality;  // upper bound
+    if (totalCardinality <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_create_given_capacity(totalCardinality);
+        array_container_xor(src_1, src_2, CAST_array(*dst));
+        return false;  // not a bitset
+    }
+    *dst = bitset_container_from_array(src_1);
+    bool returnval = true;  // expect a bitset
+    bitset_container_t *ourbitset = CAST_bitset(*dst);
+    ourbitset->cardinality = (uint32_t)bitset_flip_list_withcard(
+        ourbitset->words, src_1->cardinality, src_2->array, src_2->cardinality);
+    if (ourbitset->cardinality <= DEFAULT_MAX_SIZE) {
+        // need to convert!
+        *dst = array_container_from_bitset(ourbitset);
+        bitset_container_free(ourbitset);
+        returnval = false;  // not going to be a bitset
+    }
+
+    return returnval;
+}
+
+bool array_array_container_lazy_xor(const array_container_t *src_1,
+                                    const array_container_t *src_2,
+                                    container_t **dst) {
+    int totalCardinality = src_1->cardinality + src_2->cardinality;
+    //
+    // We assume that operations involving bitset containers will be faster than
+    // operations involving solely array containers, except maybe when array
+    // containers are small. Indeed, for example, it is cheap to compute the
+    // exclusive union between an array and a bitset container, generally more
+    // so than between a large array and another array. So it is advantageous to
+    // favour bitset containers during the computation. Of course, if we convert
+    // array containers eagerly to bitset containers, we may later need to
+    // revert the bitset containers to array containerr to satisfy the Roaring
+    // format requirements, but such one-time conversions at the end may not be
+    // overly expensive. We arrived to this design based on extensive
+    // benchmarking on unions. For XOR/exclusive union, we simply followed the
+    // heuristic used by the unions (see  mixed_union.c). Further tuning is
+    // possible.
+    //
+    if (totalCardinality <= ARRAY_LAZY_LOWERBOUND) {
+        *dst = array_container_create_given_capacity(totalCardinality);
+        if (*dst != NULL) array_container_xor(src_1, src_2, CAST_array(*dst));
+        return false;  // not a bitset
+    }
+    *dst = bitset_container_from_array(src_1);
+    bool returnval = true;  // expect a bitset (maybe, for XOR??)
+    if (*dst != NULL) {
+        bitset_container_t *ourbitset = CAST_bitset(*dst);
+        bitset_flip_list(ourbitset->words, src_2->array, src_2->cardinality);
+        ourbitset->cardinality = BITSET_UNKNOWN_CARDINALITY;
+    }
+    return returnval;
+}
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst (which has no container initially). Return value is
+ * "dst is a bitset"
+ */
+
+bool bitset_bitset_container_xor(const bitset_container_t *src_1,
+                                 const bitset_container_t *src_2,
+                                 container_t **dst) {
+    bitset_container_t *ans = bitset_container_create();
+    int card = bitset_container_xor(src_1, src_2, ans);
+    if (card <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(ans);
+        bitset_container_free(ans);
+        return false;  // not bitset
+    } else {
+        *dst = ans;
+        return true;
+    }
+}
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst (which has no container initially).  It will modify src_1
+ * to be dst if the result is a bitset.  Otherwise, it will
+ * free src_1 and dst will be a new array container.  In both
+ * cases, the caller is responsible for deallocating dst.
+ * Returns true iff dst is a bitset  */
+
+bool bitset_array_container_ixor(bitset_container_t *src_1,
+                                 const array_container_t *src_2,
+                                 container_t **dst) {
+    *dst = src_1;
+    src_1->cardinality = (uint32_t)bitset_flip_list_withcard(
+        src_1->words, src_1->cardinality, src_2->array, src_2->cardinality);
+
+    if (src_1->cardinality <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(src_1);
+        bitset_container_free(src_1);
+        return false;  // not bitset
+    } else
+        return true;
+}
+
+/* a bunch of in-place, some of which may not *really* be inplace.
+ * TODO: write actual inplace routine if efficiency warrants it
+ * Anything inplace with a bitset is a good candidate
+ */
+
+bool bitset_bitset_container_ixor(bitset_container_t *src_1,
+                                  const bitset_container_t *src_2,
+                                  container_t **dst) {
+    int card = bitset_container_xor(src_1, src_2, src_1);
+    if (card <= DEFAULT_MAX_SIZE) {
+        *dst = array_container_from_bitset(src_1);
+        bitset_container_free(src_1);
+        return false;  // not bitset
+    } else {
+        *dst = src_1;
+        return true;
+    }
+}
+
+bool array_bitset_container_ixor(array_container_t *src_1,
+                                 const bitset_container_t *src_2,
+                                 container_t **dst) {
+    bool ans = array_bitset_container_xor(src_1, src_2, dst);
+    array_container_free(src_1);
+    return ans;
+}
+
+/* Compute the xor of src_1 and src_2 and write the result to
+ * dst. Result may be either a bitset or an array container
+ * (returns "result is bitset"). dst does not initially have
+ * any container, but becomes either a bitset container (return
+ * result true) or an array container.
+ */
+
+bool run_bitset_container_ixor(run_container_t *src_1,
+                               const bitset_container_t *src_2,
+                               container_t **dst) {
+    bool ans = run_bitset_container_xor(src_1, src_2, dst);
+    run_container_free(src_1);
+    return ans;
+}
+
+bool bitset_run_container_ixor(bitset_container_t *src_1,
+                               const run_container_t *src_2,
+                               container_t **dst) {
+    bool ans = run_bitset_container_xor(src_2, src_1, dst);
+    bitset_container_free(src_1);
+    return ans;
+}
+
+/* dst does not indicate a valid container initially.  Eventually it
+ * can become any kind of container.
+ */
+
+int array_run_container_ixor(array_container_t *src_1,
+                             const run_container_t *src_2, container_t **dst) {
+    int ans = array_run_container_xor(src_1, src_2, dst);
+    array_container_free(src_1);
+    return ans;
+}
+
+int run_array_container_ixor(run_container_t *src_1,
+                             const array_container_t *src_2,
+                             container_t **dst) {
+    int ans = array_run_container_xor(src_2, src_1, dst);
+    run_container_free(src_1);
+    return ans;
+}
+
+bool array_array_container_ixor(array_container_t *src_1,
+                                const array_container_t *src_2,
+                                container_t **dst) {
+    bool ans = array_array_container_xor(src_1, src_2, dst);
+    array_container_free(src_1);
+    return ans;
+}
+
+int run_run_container_ixor(run_container_t *src_1, const run_container_t *src_2,
+                           container_t **dst) {
+    int ans = run_run_container_xor(src_1, src_2, dst);
+    run_container_free(src_1);
+    return ans;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/containers/mixed_xor.c */
+/* begin file src/containers/run.c */
+#include <stdio.h>
+#include <stdlib.h>
+
+
+#if CROARING_IS_X64
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#error "CROARING_COMPILER_SUPPORTS_AVX512 needs to be defined."
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wuninitialized"
+#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
+#endif
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+extern inline uint16_t run_container_minimum(const run_container_t *run);
+extern inline uint16_t run_container_maximum(const run_container_t *run);
+extern inline int32_t interleavedBinarySearch(const rle16_t *array,
+                                              int32_t lenarray, uint16_t ikey);
+extern inline bool run_container_contains(const run_container_t *run,
+                                          uint16_t pos);
+extern inline int run_container_index_equalorlarger(const run_container_t *arr,
+                                                    uint16_t x);
+extern inline bool run_container_is_full(const run_container_t *run);
+extern inline bool run_container_nonzero_cardinality(const run_container_t *rc);
+extern inline int32_t run_container_serialized_size_in_bytes(int32_t num_runs);
+extern inline run_container_t *run_container_create_range(uint32_t start,
+                                                          uint32_t stop);
+extern inline int run_container_cardinality(const run_container_t *run);
+
+bool run_container_add(run_container_t *run, uint16_t pos) {
+    int32_t index = interleavedBinarySearch(run->runs, run->n_runs, pos);
+    if (index >= 0) return false;  // already there
+    index = -index - 2;            // points to preceding value, possibly -1
+    if (index >= 0) {              // possible match
+        int32_t offset = pos - run->runs[index].value;
+        int32_t le = run->runs[index].length;
+        if (offset <= le) return false;  // already there
+        if (offset == le + 1) {
+            // we may need to fuse
+            if (index + 1 < run->n_runs) {
+                if (run->runs[index + 1].value == pos + 1) {
+                    // indeed fusion is needed
+                    run->runs[index].length = run->runs[index + 1].value +
+                                              run->runs[index + 1].length -
+                                              run->runs[index].value;
+                    recoverRoomAtIndex(run, (uint16_t)(index + 1));
+                    return true;
+                }
+            }
+            run->runs[index].length++;
+            return true;
+        }
+        if (index + 1 < run->n_runs) {
+            // we may need to fuse
+            if (run->runs[index + 1].value == pos + 1) {
+                // indeed fusion is needed
+                run->runs[index + 1].value = pos;
+                run->runs[index + 1].length = run->runs[index + 1].length + 1;
+                return true;
+            }
+        }
+    }
+    if (index == -1) {
+        // we may need to extend the first run
+        if (0 < run->n_runs) {
+            if (run->runs[0].value == pos + 1) {
+                run->runs[0].length++;
+                run->runs[0].value--;
+                return true;
+            }
+        }
+    }
+    makeRoomAtIndex(run, (uint16_t)(index + 1));
+    run->runs[index + 1].value = pos;
+    run->runs[index + 1].length = 0;
+    return true;
+}
+
+/* Create a new run container. Return NULL in case of failure. */
+run_container_t *run_container_create_given_capacity(int32_t size) {
+    run_container_t *run;
+    /* Allocate the run container itself. */
+    if ((run = (run_container_t *)roaring_malloc(sizeof(run_container_t))) ==
+        NULL) {
+        return NULL;
+    }
+    if (size <= 0) {  // we don't want to rely on malloc(0)
+        run->runs = NULL;
+    } else if ((run->runs = (rle16_t *)roaring_malloc(sizeof(rle16_t) *
+                                                      size)) == NULL) {
+        roaring_free(run);
+        return NULL;
+    }
+    run->capacity = size;
+    run->n_runs = 0;
+    return run;
+}
+
+int run_container_shrink_to_fit(run_container_t *src) {
+    if (src->n_runs == src->capacity) return 0;  // nothing to do
+    int savings = src->capacity - src->n_runs;
+    src->capacity = src->n_runs;
+    rle16_t *oldruns = src->runs;
+    src->runs =
+        (rle16_t *)roaring_realloc(oldruns, src->capacity * sizeof(rle16_t));
+    if (src->runs == NULL) roaring_free(oldruns);  // should never happen?
+    return savings;
+}
+/* Create a new run container. Return NULL in case of failure. */
+run_container_t *run_container_create(void) {
+    return run_container_create_given_capacity(RUN_DEFAULT_INIT_SIZE);
+}
+
+ALLOW_UNALIGNED
+run_container_t *run_container_clone(const run_container_t *src) {
+    run_container_t *run = run_container_create_given_capacity(src->capacity);
+    if (run == NULL) return NULL;
+    run->capacity = src->capacity;
+    run->n_runs = src->n_runs;
+    memcpy(run->runs, src->runs, src->n_runs * sizeof(rle16_t));
+    return run;
+}
+
+void run_container_offset(const run_container_t *c, container_t **loc,
+                          container_t **hic, uint16_t offset) {
+    run_container_t *lo = NULL, *hi = NULL;
+
+    bool split;
+    int lo_cap, hi_cap;
+    int top, pivot;
+
+    top = (1 << 16) - offset;
+    pivot = run_container_index_equalorlarger(c, top);
+
+    if (pivot == -1) {
+        split = false;
+        lo_cap = c->n_runs;
+        hi_cap = 0;
+    } else {
+        split = c->runs[pivot].value < top;
+        lo_cap = pivot + (split ? 1 : 0);
+        hi_cap = c->n_runs - pivot;
+    }
+
+    if (loc && lo_cap) {
+        lo = run_container_create_given_capacity(lo_cap);
+        memcpy(lo->runs, c->runs, lo_cap * sizeof(rle16_t));
+        lo->n_runs = lo_cap;
+        for (int i = 0; i < lo_cap; ++i) {
+            lo->runs[i].value += offset;
+        }
+        *loc = (container_t *)lo;
+    }
+
+    if (hic && hi_cap) {
+        hi = run_container_create_given_capacity(hi_cap);
+        memcpy(hi->runs, c->runs + pivot, hi_cap * sizeof(rle16_t));
+        hi->n_runs = hi_cap;
+        for (int i = 0; i < hi_cap; ++i) {
+            hi->runs[i].value += offset;
+        }
+        *hic = (container_t *)hi;
+    }
+
+    // Fix the split.
+    if (split) {
+        if (lo != NULL) {
+            // Add the missing run to 'lo', exhausting length.
+            lo->runs[lo->n_runs - 1].length =
+                (1 << 16) - lo->runs[lo->n_runs - 1].value - 1;
+        }
+
+        if (hi != NULL) {
+            // Fix the first run in 'hi'.
+            hi->runs[0].length -= UINT16_MAX - hi->runs[0].value + 1;
+            hi->runs[0].value = 0;
+        }
+    }
+}
+
+/* Free memory. */
+void run_container_free(run_container_t *run) {
+    if (run == NULL) return;
+    roaring_free(run->runs);
+    roaring_free(run);
+}
+
+void run_container_grow(run_container_t *run, int32_t min, bool copy) {
+    int32_t newCapacity = (run->capacity == 0)   ? RUN_DEFAULT_INIT_SIZE
+                          : run->capacity < 64   ? run->capacity * 2
+                          : run->capacity < 1024 ? run->capacity * 3 / 2
+                                                 : run->capacity * 5 / 4;
+    if (newCapacity < min) newCapacity = min;
+    run->capacity = newCapacity;
+    assert(run->capacity >= min);
+    if (copy) {
+        rle16_t *oldruns = run->runs;
+        run->runs = (rle16_t *)roaring_realloc(oldruns,
+                                               run->capacity * sizeof(rle16_t));
+        if (run->runs == NULL) roaring_free(oldruns);
+    } else {
+        roaring_free(run->runs);
+        run->runs = (rle16_t *)roaring_malloc(run->capacity * sizeof(rle16_t));
+    }
+    // We may have run->runs == NULL.
+}
+
+/* copy one container into another */
+void run_container_copy(const run_container_t *src, run_container_t *dst) {
+    const int32_t n_runs = src->n_runs;
+    if (src->n_runs > dst->capacity) {
+        run_container_grow(dst, n_runs, false);
+    }
+    dst->n_runs = n_runs;
+    memcpy(dst->runs, src->runs, sizeof(rle16_t) * n_runs);
+}
+
+/* Compute the union of `src_1' and `src_2' and write the result to `dst'
+ * It is assumed that `dst' is distinct from both `src_1' and `src_2'. */
+void run_container_union(const run_container_t *src_1,
+                         const run_container_t *src_2, run_container_t *dst) {
+    // TODO: this could be a lot more efficient
+
+    // we start out with inexpensive checks
+    const bool if1 = run_container_is_full(src_1);
+    const bool if2 = run_container_is_full(src_2);
+    if (if1 || if2) {
+        if (if1) {
+            run_container_copy(src_1, dst);
+            return;
+        }
+        if (if2) {
+            run_container_copy(src_2, dst);
+            return;
+        }
+    }
+    const int32_t neededcapacity = src_1->n_runs + src_2->n_runs;
+    if (dst->capacity < neededcapacity)
+        run_container_grow(dst, neededcapacity, false);
+    dst->n_runs = 0;
+    int32_t rlepos = 0;
+    int32_t xrlepos = 0;
+
+    rle16_t previousrle;
+    if (src_1->runs[rlepos].value <= src_2->runs[xrlepos].value) {
+        previousrle = run_container_append_first(dst, src_1->runs[rlepos]);
+        rlepos++;
+    } else {
+        previousrle = run_container_append_first(dst, src_2->runs[xrlepos]);
+        xrlepos++;
+    }
+
+    while ((xrlepos < src_2->n_runs) && (rlepos < src_1->n_runs)) {
+        rle16_t newrl;
+        if (src_1->runs[rlepos].value <= src_2->runs[xrlepos].value) {
+            newrl = src_1->runs[rlepos];
+            rlepos++;
+        } else {
+            newrl = src_2->runs[xrlepos];
+            xrlepos++;
+        }
+        run_container_append(dst, newrl, &previousrle);
+    }
+    while (xrlepos < src_2->n_runs) {
+        run_container_append(dst, src_2->runs[xrlepos], &previousrle);
+        xrlepos++;
+    }
+    while (rlepos < src_1->n_runs) {
+        run_container_append(dst, src_1->runs[rlepos], &previousrle);
+        rlepos++;
+    }
+}
+
+/* Compute the union of `src_1' and `src_2' and write the result to `src_1'
+ */
+void run_container_union_inplace(run_container_t *src_1,
+                                 const run_container_t *src_2) {
+    // TODO: this could be a lot more efficient
+
+    // we start out with inexpensive checks
+    const bool if1 = run_container_is_full(src_1);
+    const bool if2 = run_container_is_full(src_2);
+    if (if1 || if2) {
+        if (if1) {
+            return;
+        }
+        if (if2) {
+            run_container_copy(src_2, src_1);
+            return;
+        }
+    }
+    // we move the data to the end of the current array
+    const int32_t maxoutput = src_1->n_runs + src_2->n_runs;
+    const int32_t neededcapacity = maxoutput + src_1->n_runs;
+    if (src_1->capacity < neededcapacity)
+        run_container_grow(src_1, neededcapacity, true);
+    memmove(src_1->runs + maxoutput, src_1->runs,
+            src_1->n_runs * sizeof(rle16_t));
+    rle16_t *inputsrc1 = src_1->runs + maxoutput;
+    const int32_t input1nruns = src_1->n_runs;
+    src_1->n_runs = 0;
+    int32_t rlepos = 0;
+    int32_t xrlepos = 0;
+
+    rle16_t previousrle;
+    if (inputsrc1[rlepos].value <= src_2->runs[xrlepos].value) {
+        previousrle = run_container_append_first(src_1, inputsrc1[rlepos]);
+        rlepos++;
+    } else {
+        previousrle = run_container_append_first(src_1, src_2->runs[xrlepos]);
+        xrlepos++;
+    }
+    while ((xrlepos < src_2->n_runs) && (rlepos < input1nruns)) {
+        rle16_t newrl;
+        if (inputsrc1[rlepos].value <= src_2->runs[xrlepos].value) {
+            newrl = inputsrc1[rlepos];
+            rlepos++;
+        } else {
+            newrl = src_2->runs[xrlepos];
+            xrlepos++;
+        }
+        run_container_append(src_1, newrl, &previousrle);
+    }
+    while (xrlepos < src_2->n_runs) {
+        run_container_append(src_1, src_2->runs[xrlepos], &previousrle);
+        xrlepos++;
+    }
+    while (rlepos < input1nruns) {
+        run_container_append(src_1, inputsrc1[rlepos], &previousrle);
+        rlepos++;
+    }
+}
+
+/* Compute the symmetric difference of `src_1' and `src_2' and write the result
+ * to `dst'
+ * It is assumed that `dst' is distinct from both `src_1' and `src_2'. */
+void run_container_xor(const run_container_t *src_1,
+                       const run_container_t *src_2, run_container_t *dst) {
+    // don't bother to convert xor with full range into negation
+    // since negation is implemented similarly
+
+    const int32_t neededcapacity = src_1->n_runs + src_2->n_runs;
+    if (dst->capacity < neededcapacity)
+        run_container_grow(dst, neededcapacity, false);
+
+    int32_t pos1 = 0;
+    int32_t pos2 = 0;
+    dst->n_runs = 0;
+
+    while ((pos1 < src_1->n_runs) && (pos2 < src_2->n_runs)) {
+        if (src_1->runs[pos1].value <= src_2->runs[pos2].value) {
+            run_container_smart_append_exclusive(dst, src_1->runs[pos1].value,
+                                                 src_1->runs[pos1].length);
+            pos1++;
+        } else {
+            run_container_smart_append_exclusive(dst, src_2->runs[pos2].value,
+                                                 src_2->runs[pos2].length);
+            pos2++;
+        }
+    }
+    while (pos1 < src_1->n_runs) {
+        run_container_smart_append_exclusive(dst, src_1->runs[pos1].value,
+                                             src_1->runs[pos1].length);
+        pos1++;
+    }
+
+    while (pos2 < src_2->n_runs) {
+        run_container_smart_append_exclusive(dst, src_2->runs[pos2].value,
+                                             src_2->runs[pos2].length);
+        pos2++;
+    }
+}
+
+/* Compute the intersection of src_1 and src_2 and write the result to
+ * dst. It is assumed that dst is distinct from both src_1 and src_2. */
+void run_container_intersection(const run_container_t *src_1,
+                                const run_container_t *src_2,
+                                run_container_t *dst) {
+    const bool if1 = run_container_is_full(src_1);
+    const bool if2 = run_container_is_full(src_2);
+    if (if1 || if2) {
+        if (if1) {
+            run_container_copy(src_2, dst);
+            return;
+        }
+        if (if2) {
+            run_container_copy(src_1, dst);
+            return;
+        }
+    }
+    // TODO: this could be a lot more efficient, could use SIMD optimizations
+    const int32_t neededcapacity = src_1->n_runs + src_2->n_runs;
+    if (dst->capacity < neededcapacity)
+        run_container_grow(dst, neededcapacity, false);
+    dst->n_runs = 0;
+    int32_t rlepos = 0;
+    int32_t xrlepos = 0;
+    int32_t start = src_1->runs[rlepos].value;
+    int32_t end = start + src_1->runs[rlepos].length + 1;
+    int32_t xstart = src_2->runs[xrlepos].value;
+    int32_t xend = xstart + src_2->runs[xrlepos].length + 1;
+    while ((rlepos < src_1->n_runs) && (xrlepos < src_2->n_runs)) {
+        if (end <= xstart) {
+            ++rlepos;
+            if (rlepos < src_1->n_runs) {
+                start = src_1->runs[rlepos].value;
+                end = start + src_1->runs[rlepos].length + 1;
+            }
+        } else if (xend <= start) {
+            ++xrlepos;
+            if (xrlepos < src_2->n_runs) {
+                xstart = src_2->runs[xrlepos].value;
+                xend = xstart + src_2->runs[xrlepos].length + 1;
+            }
+        } else {  // they overlap
+            const int32_t lateststart = start > xstart ? start : xstart;
+            int32_t earliestend;
+            if (end == xend) {  // improbable
+                earliestend = end;
+                rlepos++;
+                xrlepos++;
+                if (rlepos < src_1->n_runs) {
+                    start = src_1->runs[rlepos].value;
+                    end = start + src_1->runs[rlepos].length + 1;
+                }
+                if (xrlepos < src_2->n_runs) {
+                    xstart = src_2->runs[xrlepos].value;
+                    xend = xstart + src_2->runs[xrlepos].length + 1;
+                }
+            } else if (end < xend) {
+                earliestend = end;
+                rlepos++;
+                if (rlepos < src_1->n_runs) {
+                    start = src_1->runs[rlepos].value;
+                    end = start + src_1->runs[rlepos].length + 1;
+                }
+
+            } else {  // end > xend
+                earliestend = xend;
+                xrlepos++;
+                if (xrlepos < src_2->n_runs) {
+                    xstart = src_2->runs[xrlepos].value;
+                    xend = xstart + src_2->runs[xrlepos].length + 1;
+                }
+            }
+            dst->runs[dst->n_runs].value = (uint16_t)lateststart;
+            dst->runs[dst->n_runs].length =
+                (uint16_t)(earliestend - lateststart - 1);
+            dst->n_runs++;
+        }
+    }
+}
+
+/* Compute the size of the intersection of src_1 and src_2 . */
+int run_container_intersection_cardinality(const run_container_t *src_1,
+                                           const run_container_t *src_2) {
+    const bool if1 = run_container_is_full(src_1);
+    const bool if2 = run_container_is_full(src_2);
+    if (if1 || if2) {
+        if (if1) {
+            return run_container_cardinality(src_2);
+        }
+        if (if2) {
+            return run_container_cardinality(src_1);
+        }
+    }
+    int answer = 0;
+    int32_t rlepos = 0;
+    int32_t xrlepos = 0;
+    int32_t start = src_1->runs[rlepos].value;
+    int32_t end = start + src_1->runs[rlepos].length + 1;
+    int32_t xstart = src_2->runs[xrlepos].value;
+    int32_t xend = xstart + src_2->runs[xrlepos].length + 1;
+    while ((rlepos < src_1->n_runs) && (xrlepos < src_2->n_runs)) {
+        if (end <= xstart) {
+            ++rlepos;
+            if (rlepos < src_1->n_runs) {
+                start = src_1->runs[rlepos].value;
+                end = start + src_1->runs[rlepos].length + 1;
+            }
+        } else if (xend <= start) {
+            ++xrlepos;
+            if (xrlepos < src_2->n_runs) {
+                xstart = src_2->runs[xrlepos].value;
+                xend = xstart + src_2->runs[xrlepos].length + 1;
+            }
+        } else {  // they overlap
+            const int32_t lateststart = start > xstart ? start : xstart;
+            int32_t earliestend;
+            if (end == xend) {  // improbable
+                earliestend = end;
+                rlepos++;
+                xrlepos++;
+                if (rlepos < src_1->n_runs) {
+                    start = src_1->runs[rlepos].value;
+                    end = start + src_1->runs[rlepos].length + 1;
+                }
+                if (xrlepos < src_2->n_runs) {
+                    xstart = src_2->runs[xrlepos].value;
+                    xend = xstart + src_2->runs[xrlepos].length + 1;
+                }
+            } else if (end < xend) {
+                earliestend = end;
+                rlepos++;
+                if (rlepos < src_1->n_runs) {
+                    start = src_1->runs[rlepos].value;
+                    end = start + src_1->runs[rlepos].length + 1;
+                }
+
+            } else {  // end > xend
+                earliestend = xend;
+                xrlepos++;
+                if (xrlepos < src_2->n_runs) {
+                    xstart = src_2->runs[xrlepos].value;
+                    xend = xstart + src_2->runs[xrlepos].length + 1;
+                }
+            }
+            answer += earliestend - lateststart;
+        }
+    }
+    return answer;
+}
+
+bool run_container_intersect(const run_container_t *src_1,
+                             const run_container_t *src_2) {
+    const bool if1 = run_container_is_full(src_1);
+    const bool if2 = run_container_is_full(src_2);
+    if (if1 || if2) {
+        if (if1) {
+            return !run_container_empty(src_2);
+        }
+        if (if2) {
+            return !run_container_empty(src_1);
+        }
+    }
+    int32_t rlepos = 0;
+    int32_t xrlepos = 0;
+    int32_t start = src_1->runs[rlepos].value;
+    int32_t end = start + src_1->runs[rlepos].length + 1;
+    int32_t xstart = src_2->runs[xrlepos].value;
+    int32_t xend = xstart + src_2->runs[xrlepos].length + 1;
+    while ((rlepos < src_1->n_runs) && (xrlepos < src_2->n_runs)) {
+        if (end <= xstart) {
+            ++rlepos;
+            if (rlepos < src_1->n_runs) {
+                start = src_1->runs[rlepos].value;
+                end = start + src_1->runs[rlepos].length + 1;
+            }
+        } else if (xend <= start) {
+            ++xrlepos;
+            if (xrlepos < src_2->n_runs) {
+                xstart = src_2->runs[xrlepos].value;
+                xend = xstart + src_2->runs[xrlepos].length + 1;
+            }
+        } else {  // they overlap
+            return true;
+        }
+    }
+    return false;
+}
+
+/* Compute the difference of src_1 and src_2 and write the result to
+ * dst. It is assumed that dst is distinct from both src_1 and src_2. */
+void run_container_andnot(const run_container_t *src_1,
+                          const run_container_t *src_2, run_container_t *dst) {
+    // following Java implementation as of June 2016
+
+    if (dst->capacity < src_1->n_runs + src_2->n_runs)
+        run_container_grow(dst, src_1->n_runs + src_2->n_runs, false);
+
+    dst->n_runs = 0;
+
+    int rlepos1 = 0;
+    int rlepos2 = 0;
+    int32_t start = src_1->runs[rlepos1].value;
+    int32_t end = start + src_1->runs[rlepos1].length + 1;
+    int32_t start2 = src_2->runs[rlepos2].value;
+    int32_t end2 = start2 + src_2->runs[rlepos2].length + 1;
+
+    while ((rlepos1 < src_1->n_runs) && (rlepos2 < src_2->n_runs)) {
+        if (end <= start2) {
+            // output the first run
+            dst->runs[dst->n_runs++] =
+                CROARING_MAKE_RLE16(start, end - start - 1);
+            rlepos1++;
+            if (rlepos1 < src_1->n_runs) {
+                start = src_1->runs[rlepos1].value;
+                end = start + src_1->runs[rlepos1].length + 1;
+            }
+        } else if (end2 <= start) {
+            // exit the second run
+            rlepos2++;
+            if (rlepos2 < src_2->n_runs) {
+                start2 = src_2->runs[rlepos2].value;
+                end2 = start2 + src_2->runs[rlepos2].length + 1;
+            }
+        } else {
+            if (start < start2) {
+                dst->runs[dst->n_runs++] =
+                    CROARING_MAKE_RLE16(start, start2 - start - 1);
+            }
+            if (end2 < end) {
+                start = end2;
+            } else {
+                rlepos1++;
+                if (rlepos1 < src_1->n_runs) {
+                    start = src_1->runs[rlepos1].value;
+                    end = start + src_1->runs[rlepos1].length + 1;
+                }
+            }
+        }
+    }
+    if (rlepos1 < src_1->n_runs) {
+        dst->runs[dst->n_runs++] = CROARING_MAKE_RLE16(start, end - start - 1);
+        rlepos1++;
+        if (rlepos1 < src_1->n_runs) {
+            memcpy(dst->runs + dst->n_runs, src_1->runs + rlepos1,
+                   sizeof(rle16_t) * (src_1->n_runs - rlepos1));
+            dst->n_runs += src_1->n_runs - rlepos1;
+        }
+    }
+}
+
+/*
+ * Print this container using printf (useful for debugging).
+ */
+void run_container_printf(const run_container_t *cont) {
+    for (int i = 0; i < cont->n_runs; ++i) {
+        uint16_t run_start = cont->runs[i].value;
+        uint16_t le = cont->runs[i].length;
+        printf("[%d,%d]", run_start, run_start + le);
+    }
+}
+
+/*
+ * Print this container using printf as a comma-separated list of 32-bit
+ * integers starting at base.
+ */
+void run_container_printf_as_uint32_array(const run_container_t *cont,
+                                          uint32_t base) {
+    if (cont->n_runs == 0) return;
+    {
+        uint32_t run_start = base + cont->runs[0].value;
+        uint16_t le = cont->runs[0].length;
+        printf("%u", run_start);
+        for (uint32_t j = 1; j <= le; ++j) printf(",%u", run_start + j);
+    }
+    for (int32_t i = 1; i < cont->n_runs; ++i) {
+        uint32_t run_start = base + cont->runs[i].value;
+        uint16_t le = cont->runs[i].length;
+        for (uint32_t j = 0; j <= le; ++j) printf(",%u", run_start + j);
+    }
+}
+
+/*
+ * Validate the container. Returns true if valid.
+ */
+bool run_container_validate(const run_container_t *run, const char **reason) {
+    if (run->n_runs < 0) {
+        *reason = "negative run count";
+        return false;
+    }
+    if (run->capacity < 0) {
+        *reason = "negative run capacity";
+        return false;
+    }
+    if (run->capacity < run->n_runs) {
+        *reason = "capacity less than run count";
+        return false;
+    }
+
+    if (run->n_runs == 0) {
+        *reason = "zero run count";
+        return false;
+    }
+    if (run->runs == NULL) {
+        *reason = "NULL runs";
+        return false;
+    }
+
+    // Use uint32_t to avoid overflow issues on ranges that contain UINT16_MAX.
+    uint32_t last_end = 0;
+    for (int i = 0; i < run->n_runs; ++i) {
+        uint32_t start = run->runs[i].value;
+        uint32_t end = start + run->runs[i].length + 1;
+        if (end <= start) {
+            *reason = "run start + length overflow";
+            return false;
+        }
+        if (end > (1 << 16)) {
+            *reason = "run start + length too large";
+            return false;
+        }
+        if (start < last_end) {
+            *reason = "run start less than last end";
+            return false;
+        }
+        if (start == last_end && last_end != 0) {
+            *reason = "run start equal to last end, should have combined";
+            return false;
+        }
+        last_end = end;
+    }
+    return true;
+}
+
+int32_t run_container_write(const run_container_t *container, char *buf) {
+    uint16_t cast_16 = container->n_runs;
+    memcpy(buf, &cast_16, sizeof(uint16_t));
+    memcpy(buf + sizeof(uint16_t), container->runs,
+           container->n_runs * sizeof(rle16_t));
+    return run_container_size_in_bytes(container);
+}
+
+int32_t run_container_read(int32_t cardinality, run_container_t *container,
+                           const char *buf) {
+    (void)cardinality;
+    uint16_t cast_16;
+    memcpy(&cast_16, buf, sizeof(uint16_t));
+    container->n_runs = cast_16;
+    if (container->n_runs > container->capacity)
+        run_container_grow(container, container->n_runs, false);
+    if (container->n_runs > 0) {
+        memcpy(container->runs, buf + sizeof(uint16_t),
+               container->n_runs * sizeof(rle16_t));
+    }
+    return run_container_size_in_bytes(container);
+}
+
+bool run_container_iterate(const run_container_t *cont, uint32_t base,
+                           roaring_iterator iterator, void *ptr) {
+    for (int i = 0; i < cont->n_runs; ++i) {
+        uint32_t run_start = base + cont->runs[i].value;
+        uint16_t le = cont->runs[i].length;
+
+        for (int j = 0; j <= le; ++j)
+            if (!iterator(run_start + j, ptr)) return false;
+    }
+    return true;
+}
+
+bool run_container_iterate64(const run_container_t *cont, uint32_t base,
+                             roaring_iterator64 iterator, uint64_t high_bits,
+                             void *ptr) {
+    for (int i = 0; i < cont->n_runs; ++i) {
+        uint32_t run_start = base + cont->runs[i].value;
+        uint16_t le = cont->runs[i].length;
+
+        for (int j = 0; j <= le; ++j)
+            if (!iterator(high_bits | (uint64_t)(run_start + j), ptr))
+                return false;
+    }
+    return true;
+}
+
+bool run_container_is_subset(const run_container_t *container1,
+                             const run_container_t *container2) {
+    int i1 = 0, i2 = 0;
+    while (i1 < container1->n_runs && i2 < container2->n_runs) {
+        int start1 = container1->runs[i1].value;
+        int stop1 = start1 + container1->runs[i1].length;
+        int start2 = container2->runs[i2].value;
+        int stop2 = start2 + container2->runs[i2].length;
+        if (start1 < start2) {
+            return false;
+        } else {  // start1 >= start2
+            if (stop1 < stop2) {
+                i1++;
+            } else if (stop1 == stop2) {
+                i1++;
+                i2++;
+            } else {  // stop1 > stop2
+                i2++;
+            }
+        }
+    }
+    if (i1 == container1->n_runs) {
+        return true;
+    } else {
+        return false;
+    }
+}
+
+// TODO: write smart_append_exclusive version to match the overloaded 1 param
+// Java version (or  is it even used?)
+
+// follows the Java implementation closely
+// length is the rle-value.  Ie, run [10,12) uses a length value 1.
+void run_container_smart_append_exclusive(run_container_t *src,
+                                          const uint16_t start,
+                                          const uint16_t length) {
+    int old_end;
+    rle16_t *last_run = src->n_runs ? src->runs + (src->n_runs - 1) : NULL;
+    rle16_t *appended_last_run = src->runs + src->n_runs;
+
+    if (!src->n_runs ||
+        (start > (old_end = last_run->value + last_run->length + 1))) {
+        *appended_last_run = CROARING_MAKE_RLE16(start, length);
+        src->n_runs++;
+        return;
+    }
+    if (old_end == start) {
+        // we merge
+        last_run->length += (length + 1);
+        return;
+    }
+    int new_end = start + length + 1;
+
+    if (start == last_run->value) {
+        // wipe out previous
+        if (new_end < old_end) {
+            *last_run = CROARING_MAKE_RLE16(new_end, old_end - new_end - 1);
+            return;
+        } else if (new_end > old_end) {
+            *last_run = CROARING_MAKE_RLE16(old_end, new_end - old_end - 1);
+            return;
+        } else {
+            src->n_runs--;
+            return;
+        }
+    }
+    last_run->length = start - last_run->value - 1;
+    if (new_end < old_end) {
+        *appended_last_run =
+            CROARING_MAKE_RLE16(new_end, old_end - new_end - 1);
+        src->n_runs++;
+    } else if (new_end > old_end) {
+        *appended_last_run =
+            CROARING_MAKE_RLE16(old_end, new_end - old_end - 1);
+        src->n_runs++;
+    }
+}
+
+bool run_container_select(const run_container_t *container,
+                          uint32_t *start_rank, uint32_t rank,
+                          uint32_t *element) {
+    for (int i = 0; i < container->n_runs; i++) {
+        uint16_t length = container->runs[i].length;
+        if (rank <= *start_rank + length) {
+            uint16_t value = container->runs[i].value;
+            *element = value + rank - (*start_rank);
+            return true;
+        } else
+            *start_rank += length + 1;
+    }
+    return false;
+}
+
+int run_container_rank(const run_container_t *container, uint16_t x) {
+    int sum = 0;
+    uint32_t x32 = x;
+    for (int i = 0; i < container->n_runs; i++) {
+        uint32_t startpoint = container->runs[i].value;
+        uint32_t length = container->runs[i].length;
+        uint32_t endpoint = length + startpoint;
+        if (x <= endpoint) {
+            if (x < startpoint) break;
+            return sum + (x32 - startpoint) + 1;
+        } else {
+            sum += length + 1;
+        }
+    }
+    return sum;
+}
+uint32_t run_container_rank_many(const run_container_t *container,
+                                 uint64_t start_rank, const uint32_t *begin,
+                                 const uint32_t *end, uint64_t *ans) {
+    const uint16_t high = (uint16_t)((*begin) >> 16);
+    const uint32_t *iter = begin;
+    int sum = 0;
+    int i = 0;
+    for (; iter != end; iter++) {
+        uint32_t x = *iter;
+        uint16_t xhigh = (uint16_t)(x >> 16);
+        if (xhigh != high) return iter - begin;  // stop at next container
+
+        uint32_t x32 = x & 0xFFFF;
+        while (i < container->n_runs) {
+            uint32_t startpoint = container->runs[i].value;
+            uint32_t length = container->runs[i].length;
+            uint32_t endpoint = length + startpoint;
+            if (x32 <= endpoint) {
+                if (x32 < startpoint) {
+                    *(ans++) = start_rank + sum;
+                } else {
+                    *(ans++) = start_rank + sum + (x32 - startpoint) + 1;
+                }
+                break;
+            } else {
+                sum += length + 1;
+                i++;
+            }
+        }
+        if (i >= container->n_runs) *(ans++) = start_rank + sum;
+    }
+
+    return iter - begin;
+}
+
+int run_container_get_index(const run_container_t *container, uint16_t x) {
+    if (run_container_contains(container, x)) {
+        int sum = 0;
+        uint32_t x32 = x;
+        for (int i = 0; i < container->n_runs; i++) {
+            uint32_t startpoint = container->runs[i].value;
+            uint32_t length = container->runs[i].length;
+            uint32_t endpoint = length + startpoint;
+            if (x <= endpoint) {
+                if (x < startpoint) break;
+                return sum + (x32 - startpoint);
+            } else {
+                sum += length + 1;
+            }
+        }
+        return sum - 1;
+    } else {
+        return -1;
+    }
+}
+
+#if defined(CROARING_IS_X64) && CROARING_COMPILER_SUPPORTS_AVX512
+
+CROARING_TARGET_AVX512
+ALLOW_UNALIGNED
+/* Get the cardinality of `run'. Requires an actual computation. */
+static inline int _avx512_run_container_cardinality(
+    const run_container_t *run) {
+    const int32_t n_runs = run->n_runs;
+    const rle16_t *runs = run->runs;
+
+    /* by initializing with n_runs, we omit counting the +1 for each pair. */
+    int sum = n_runs;
+    int32_t k = 0;
+    const int32_t step = sizeof(__m512i) / sizeof(rle16_t);
+    if (n_runs > step) {
+        __m512i total = _mm512_setzero_si512();
+        for (; k + step <= n_runs; k += step) {
+            __m512i ymm1 = _mm512_loadu_si512((const __m512i *)(runs + k));
+            __m512i justlengths = _mm512_srli_epi32(ymm1, 16);
+            total = _mm512_add_epi32(total, justlengths);
+        }
+
+        __m256i lo = _mm512_extracti32x8_epi32(total, 0);
+        __m256i hi = _mm512_extracti32x8_epi32(total, 1);
+
+        // a store might be faster than extract?
+        uint32_t buffer[sizeof(__m256i) / sizeof(rle16_t)];
+        _mm256_storeu_si256((__m256i *)buffer, lo);
+        sum += (buffer[0] + buffer[1]) + (buffer[2] + buffer[3]) +
+               (buffer[4] + buffer[5]) + (buffer[6] + buffer[7]);
+
+        _mm256_storeu_si256((__m256i *)buffer, hi);
+        sum += (buffer[0] + buffer[1]) + (buffer[2] + buffer[3]) +
+               (buffer[4] + buffer[5]) + (buffer[6] + buffer[7]);
+    }
+    for (; k < n_runs; ++k) {
+        sum += runs[k].length;
+    }
+
+    return sum;
+}
+
+CROARING_UNTARGET_AVX512
+
+CROARING_TARGET_AVX2
+ALLOW_UNALIGNED
+/* Get the cardinality of `run'. Requires an actual computation. */
+static inline int _avx2_run_container_cardinality(const run_container_t *run) {
+    const int32_t n_runs = run->n_runs;
+    const rle16_t *runs = run->runs;
+
+    /* by initializing with n_runs, we omit counting the +1 for each pair. */
+    int sum = n_runs;
+    int32_t k = 0;
+    const int32_t step = sizeof(__m256i) / sizeof(rle16_t);
+    if (n_runs > step) {
+        __m256i total = _mm256_setzero_si256();
+        for (; k + step <= n_runs; k += step) {
+            __m256i ymm1 = _mm256_lddqu_si256((const __m256i *)(runs + k));
+            __m256i justlengths = _mm256_srli_epi32(ymm1, 16);
+            total = _mm256_add_epi32(total, justlengths);
+        }
+        // a store might be faster than extract?
+        uint32_t buffer[sizeof(__m256i) / sizeof(rle16_t)];
+        _mm256_storeu_si256((__m256i *)buffer, total);
+        sum += (buffer[0] + buffer[1]) + (buffer[2] + buffer[3]) +
+               (buffer[4] + buffer[5]) + (buffer[6] + buffer[7]);
+    }
+    for (; k < n_runs; ++k) {
+        sum += runs[k].length;
+    }
+
+    return sum;
+}
+
+ALLOW_UNALIGNED
+int _avx2_run_container_to_uint32_array(void *vout, const run_container_t *cont,
+                                        uint32_t base) {
+    int outpos = 0;
+    uint32_t *out = (uint32_t *)vout;
+
+    for (int i = 0; i < cont->n_runs; ++i) {
+        uint32_t run_start = base + cont->runs[i].value;
+        uint16_t le = cont->runs[i].length;
+        if (le < 8) {
+            for (int j = 0; j <= le; ++j) {
+                uint32_t val = run_start + j;
+                memcpy(out + outpos, &val,
+                       sizeof(uint32_t));  // should be compiled as a MOV on x64
+                outpos++;
+            }
+        } else {
+            int j = 0;
+            __m256i run_start_v = _mm256_set1_epi32(run_start);
+            // [8,8,8,8....]
+            __m256i inc = _mm256_set1_epi32(8);
+            // used for generate sequence:
+            // [0, 1, 2, 3...], [8, 9, 10,...]
+            __m256i delta = _mm256_setr_epi32(0, 1, 2, 3, 4, 5, 6, 7);
+            for (j = 0; j + 8 <= le; j += 8) {
+                __m256i val_v = _mm256_add_epi32(run_start_v, delta);
+                _mm256_storeu_si256((__m256i *)(out + outpos), val_v);
+                delta = _mm256_add_epi32(inc, delta);
+                outpos += 8;
+            }
+            for (; j <= le; ++j) {
+                uint32_t val = run_start + j;
+                memcpy(out + outpos, &val,
+                       sizeof(uint32_t));  // should be compiled as a MOV on x64
+                outpos++;
+            }
+        }
+    }
+    return outpos;
+}
+
+CROARING_UNTARGET_AVX2
+
+/* Get the cardinality of `run'. Requires an actual computation. */
+static inline int _scalar_run_container_cardinality(
+    const run_container_t *run) {
+    const int32_t n_runs = run->n_runs;
+    const rle16_t *runs = run->runs;
+
+    /* by initializing with n_runs, we omit counting the +1 for each pair. */
+    int sum = n_runs;
+    for (int k = 0; k < n_runs; ++k) {
+        sum += runs[k].length;
+    }
+
+    return sum;
+}
+
+int run_container_cardinality(const run_container_t *run) {
+#if CROARING_COMPILER_SUPPORTS_AVX512
+    if (croaring_hardware_support() & ROARING_SUPPORTS_AVX512) {
+        return _avx512_run_container_cardinality(run);
+    } else
+#endif
+        if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+        return _avx2_run_container_cardinality(run);
+    } else {
+        return _scalar_run_container_cardinality(run);
+    }
+}
+
+int _scalar_run_container_to_uint32_array(void *vout,
+                                          const run_container_t *cont,
+                                          uint32_t base) {
+    int outpos = 0;
+    uint32_t *out = (uint32_t *)vout;
+    for (int i = 0; i < cont->n_runs; ++i) {
+        uint32_t run_start = base + cont->runs[i].value;
+        uint16_t le = cont->runs[i].length;
+        for (int j = 0; j <= le; ++j) {
+            uint32_t val = run_start + j;
+            memcpy(out + outpos, &val,
+                   sizeof(uint32_t));  // should be compiled as a MOV on x64
+            outpos++;
+        }
+    }
+    return outpos;
+}
+
+int run_container_to_uint32_array(void *vout, const run_container_t *cont,
+                                  uint32_t base) {
+    if (croaring_hardware_support() & ROARING_SUPPORTS_AVX2) {
+        return _avx2_run_container_to_uint32_array(vout, cont, base);
+    } else {
+        return _scalar_run_container_to_uint32_array(vout, cont, base);
+    }
+}
+
+#else
+
+/* Get the cardinality of `run'. Requires an actual computation. */
+ALLOW_UNALIGNED
+int run_container_cardinality(const run_container_t *run) {
+    const int32_t n_runs = run->n_runs;
+    const rle16_t *runs = run->runs;
+
+    /* by initializing with n_runs, we omit counting the +1 for each pair. */
+    int sum = n_runs;
+    for (int k = 0; k < n_runs; ++k) {
+        sum += runs[k].length;
+    }
+
+    return sum;
+}
+
+ALLOW_UNALIGNED
+int run_container_to_uint32_array(void *vout, const run_container_t *cont,
+                                  uint32_t base) {
+    int outpos = 0;
+    uint32_t *out = (uint32_t *)vout;
+    for (int i = 0; i < cont->n_runs; ++i) {
+        uint32_t run_start = base + cont->runs[i].value;
+        uint16_t le = cont->runs[i].length;
+        for (int j = 0; j <= le; ++j) {
+            uint32_t val = run_start + j;
+            memcpy(out + outpos, &val,
+                   sizeof(uint32_t));  // should be compiled as a MOV on x64
+            outpos++;
+        }
+    }
+    return outpos;
+}
+
+#endif
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic pop
+#endif/* end file src/containers/run.c */
+/* begin file src/isadetection.c */
+
+/* From
+https://github.com/endorno/pytorch/blob/master/torch/lib/TH/generic/simd/simd.h
+Highly modified.
+
+Copyright (c) 2016-     Facebook, Inc            (Adam Paszke)
+Copyright (c) 2014-     Facebook, Inc            (Soumith Chintala)
+Copyright (c) 2011-2014 Idiap Research Institute (Ronan Collobert)
+Copyright (c) 2012-2014 Deepmind Technologies    (Koray Kavukcuoglu)
+Copyright (c) 2011-2012 NEC Laboratories America (Koray Kavukcuoglu)
+Copyright (c) 2011-2013 NYU                      (Clement Farabet)
+Copyright (c) 2006-2010 NEC Laboratories America (Ronan Collobert, Leon Bottou,
+Iain Melvin, Jason Weston) Copyright (c) 2006      Idiap Research Institute
+(Samy Bengio) Copyright (c) 2001-2004 Idiap Research Institute (Ronan Collobert,
+Samy Bengio, Johnny Mariethoz)
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+3. Neither the names of Facebook, Deepmind Technologies, NYU, NEC Laboratories
+America and IDIAP Research Institute nor the names of its contributors may be
+   used to endorse or promote products derived from this software without
+   specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include <stdbool.h>
+#include <stdint.h>
+#include <stdlib.h>
+
+// Binaries produced by Visual Studio 19.38 with solely AVX2 routines
+// can compile to AVX-512 thus causing crashes on non-AVX-512 systems.
+// This appears to affect VS 17.8 and 17.9. We disable AVX-512 and AVX2
+// on these systems. It seems that ClangCL is not affected.
+// https://github.com/RoaringBitmap/CRoaring/pull/603
+#ifndef __clang__
+#if _MSC_VER == 1938
+#define ROARING_DISABLE_AVX 1
+#endif  // _MSC_VER == 1938
+#endif  // __clang__
+
+// We need portability.h to be included first, see
+// https://github.com/RoaringBitmap/CRoaring/issues/394
+#if CROARING_REGULAR_VISUAL_STUDIO
+#include <intrin.h>
+#elif defined(HAVE_GCC_GET_CPUID) && defined(USE_GCC_GET_CPUID)
+#include <cpuid.h>
+#endif  // CROARING_REGULAR_VISUAL_STUDIO
+
+#if CROARING_IS_X64
+#ifndef CROARING_COMPILER_SUPPORTS_AVX512
+#error "CROARING_COMPILER_SUPPORTS_AVX512 needs to be defined."
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+enum croaring_instruction_set {
+    CROARING_DEFAULT = 0x0,
+    CROARING_NEON = 0x1,
+    CROARING_AVX2 = 0x4,
+    CROARING_SSE42 = 0x8,
+    CROARING_PCLMULQDQ = 0x10,
+    CROARING_BMI1 = 0x20,
+    CROARING_BMI2 = 0x40,
+    CROARING_ALTIVEC = 0x80,
+    CROARING_AVX512F = 0x100,
+    CROARING_AVX512DQ = 0x200,
+    CROARING_AVX512BW = 0x400,
+    CROARING_AVX512VBMI2 = 0x800,
+    CROARING_AVX512BITALG = 0x1000,
+    CROARING_AVX512VPOPCNTDQ = 0x2000,
+    CROARING_UNINITIALIZED = 0x8000
+};
+
+#if CROARING_COMPILER_SUPPORTS_AVX512
+unsigned int CROARING_AVX512_REQUIRED =
+    (CROARING_AVX512F | CROARING_AVX512DQ | CROARING_AVX512BW |
+     CROARING_AVX512VBMI2 | CROARING_AVX512BITALG | CROARING_AVX512VPOPCNTDQ);
+#endif
+
+#if defined(__x86_64__) || defined(_M_AMD64)  // x64
+
+static inline void cpuid(uint32_t *eax, uint32_t *ebx, uint32_t *ecx,
+                         uint32_t *edx) {
+#if CROARING_REGULAR_VISUAL_STUDIO
+    int cpu_info[4];
+    __cpuidex(cpu_info, *eax, *ecx);
+    *eax = cpu_info[0];
+    *ebx = cpu_info[1];
+    *ecx = cpu_info[2];
+    *edx = cpu_info[3];
+#elif defined(HAVE_GCC_GET_CPUID) && defined(USE_GCC_GET_CPUID)
+    uint32_t level = *eax;
+    __get_cpuid(level, eax, ebx, ecx, edx);
+#else
+    uint32_t a = *eax, b, c = *ecx, d;
+    __asm__("cpuid\n\t" : "+a"(a), "=b"(b), "+c"(c), "=d"(d));
+    *eax = a;
+    *ebx = b;
+    *ecx = c;
+    *edx = d;
+#endif
+}
+
+static inline uint64_t xgetbv(void) {
+#if defined(_MSC_VER)
+    return _xgetbv(0);
+#else
+    uint32_t xcr0_lo, xcr0_hi;
+    __asm__("xgetbv\n\t" : "=a"(xcr0_lo), "=d"(xcr0_hi) : "c"(0));
+    return xcr0_lo | ((uint64_t)xcr0_hi << 32);
+#endif
+}
+
+/**
+ * This is a relatively expensive function but it will get called at most
+ * *once* per compilation units. Normally, the CRoaring library is built
+ * as one compilation unit.
+ */
+static inline uint32_t dynamic_croaring_detect_supported_architectures(void) {
+    uint32_t eax, ebx, ecx, edx;
+    uint32_t host_isa = 0x0;
+    // Can be found on Intel ISA Reference for CPUID
+    static uint32_t cpuid_avx2_bit =
+        1 << 5;  ///< @private Bit 5 of EBX for EAX=0x7
+    static uint32_t cpuid_bmi1_bit =
+        1 << 3;  ///< @private bit 3 of EBX for EAX=0x7
+    static uint32_t cpuid_bmi2_bit =
+        1 << 8;  ///< @private bit 8 of EBX for EAX=0x7
+    static uint32_t cpuid_avx512f_bit =
+        1 << 16;  ///< @private bit 16 of EBX for EAX=0x7
+    static uint32_t cpuid_avx512dq_bit =
+        1 << 17;  ///< @private bit 17 of EBX for EAX=0x7
+    static uint32_t cpuid_avx512bw_bit =
+        1 << 30;  ///< @private bit 30 of EBX for EAX=0x7
+    static uint32_t cpuid_avx512vbmi2_bit =
+        1 << 6;  ///< @private bit 6 of ECX for EAX=0x7
+    static uint32_t cpuid_avx512bitalg_bit =
+        1 << 12;  ///< @private bit 12 of ECX for EAX=0x7
+    static uint32_t cpuid_avx512vpopcntdq_bit =
+        1 << 14;  ///< @private bit 14 of ECX for EAX=0x7
+    static uint64_t cpuid_avx256_saved = 1 << 2;  ///< @private bit 2 = AVX
+    static uint64_t cpuid_avx512_saved =
+        7 << 5;  ///< @private bits 5,6,7 = opmask, ZMM_hi256, hi16_ZMM
+    static uint32_t cpuid_sse42_bit =
+        1 << 20;  ///< @private bit 20 of ECX for EAX=0x1
+    static uint32_t cpuid_osxsave =
+        (1 << 26) | (1 << 27);  ///< @private bits 26+27 of ECX for EAX=0x1
+    static uint32_t cpuid_pclmulqdq_bit =
+        1 << 1;  ///< @private bit  1 of ECX for EAX=0x1
+
+    // EBX for EAX=0x1
+    eax = 0x1;
+    ecx = 0x0;
+    cpuid(&eax, &ebx, &ecx, &edx);
+
+    if (ecx & cpuid_sse42_bit) {
+        host_isa |= CROARING_SSE42;
+    } else {
+        return host_isa;  // everything after is redundant
+    }
+
+    if (ecx & cpuid_pclmulqdq_bit) {
+        host_isa |= CROARING_PCLMULQDQ;
+    }
+
+    if ((ecx & cpuid_osxsave) != cpuid_osxsave) {
+        return host_isa;
+    }
+
+    // xgetbv for checking if the OS saves registers
+    uint64_t xcr0 = xgetbv();
+
+    if ((xcr0 & cpuid_avx256_saved) == 0) {
+        return host_isa;
+    }
+
+    // ECX for EAX=0x7
+    eax = 0x7;
+    ecx = 0x0;
+    cpuid(&eax, &ebx, &ecx, &edx);
+    if (ebx & cpuid_avx2_bit) {
+        host_isa |= CROARING_AVX2;
+    }
+    if (ebx & cpuid_bmi1_bit) {
+        host_isa |= CROARING_BMI1;
+    }
+
+    if (ebx & cpuid_bmi2_bit) {
+        host_isa |= CROARING_BMI2;
+    }
+
+    if (!((xcr0 & cpuid_avx512_saved) == cpuid_avx512_saved)) {
+        return host_isa;
+    }
+
+    if (ebx & cpuid_avx512f_bit) {
+        host_isa |= CROARING_AVX512F;
+    }
+
+    if (ebx & cpuid_avx512bw_bit) {
+        host_isa |= CROARING_AVX512BW;
+    }
+
+    if (ebx & cpuid_avx512dq_bit) {
+        host_isa |= CROARING_AVX512DQ;
+    }
+
+    if (ecx & cpuid_avx512vbmi2_bit) {
+        host_isa |= CROARING_AVX512VBMI2;
+    }
+
+    if (ecx & cpuid_avx512bitalg_bit) {
+        host_isa |= CROARING_AVX512BITALG;
+    }
+
+    if (ecx & cpuid_avx512vpopcntdq_bit) {
+        host_isa |= CROARING_AVX512VPOPCNTDQ;
+    }
+
+    return host_isa;
+}
+
+#endif  // end SIMD extension detection code
+
+#if defined(__x86_64__) || defined(_M_AMD64)  // x64
+
+#if CROARING_ATOMIC_IMPL == CROARING_ATOMIC_IMPL_CPP
+static inline uint32_t croaring_detect_supported_architectures(void) {
+    // thread-safe as per the C++11 standard.
+    static uint32_t buffer = dynamic_croaring_detect_supported_architectures();
+    return buffer;
+}
+#elif CROARING_ATOMIC_IMPL == CROARING_ATOMIC_IMPL_C
+static uint32_t croaring_detect_supported_architectures(void) {
+    // we use an atomic for thread safety
+    static _Atomic uint32_t buffer = CROARING_UNINITIALIZED;
+    if (buffer == CROARING_UNINITIALIZED) {
+        // atomicity is sufficient
+        buffer = dynamic_croaring_detect_supported_architectures();
+    }
+    return buffer;
+}
+#else
+// If we do not have atomics, we do the best we can.
+static inline uint32_t croaring_detect_supported_architectures(void) {
+    static uint32_t buffer = CROARING_UNINITIALIZED;
+    if (buffer == CROARING_UNINITIALIZED) {
+        buffer = dynamic_croaring_detect_supported_architectures();
+    }
+    return buffer;
+}
+#endif  // CROARING_C_ATOMIC
+
+#ifdef ROARING_DISABLE_AVX
+
+int croaring_hardware_support(void) { return 0; }
+
+#elif defined(__AVX512F__) && defined(__AVX512DQ__) &&   \
+    defined(__AVX512BW__) && defined(__AVX512VBMI2__) && \
+    defined(__AVX512BITALG__) && defined(__AVX512VPOPCNTDQ__)
+int croaring_hardware_support(void) {
+    return ROARING_SUPPORTS_AVX2 | ROARING_SUPPORTS_AVX512;
+}
+#elif defined(__AVX2__)
+
+int croaring_hardware_support(void) {
+    static
+#if CROARING_ATOMIC_IMPL == CROARING_ATOMIC_IMPL_C
+        _Atomic
+#endif
+        int support = 0xFFFFFFF;
+    if (support == 0xFFFFFFF) {
+        bool avx512_support = false;
+#if CROARING_COMPILER_SUPPORTS_AVX512
+        avx512_support =
+            ((croaring_detect_supported_architectures() &
+              CROARING_AVX512_REQUIRED) == CROARING_AVX512_REQUIRED);
+#endif
+        support = ROARING_SUPPORTS_AVX2 |
+                  (avx512_support ? ROARING_SUPPORTS_AVX512 : 0);
+    }
+    return support;
+}
+#else
+
+int croaring_hardware_support(void) {
+    static
+#if CROARING_ATOMIC_IMPL == CROARING_ATOMIC_IMPL_C
+        _Atomic
+#endif
+        int support = 0xFFFFFFF;
+    if (support == 0xFFFFFFF) {
+        bool has_avx2 = (croaring_detect_supported_architectures() &
+                         CROARING_AVX2) == CROARING_AVX2;
+        bool has_avx512 = false;
+#if CROARING_COMPILER_SUPPORTS_AVX512
+        has_avx512 = (croaring_detect_supported_architectures() &
+                      CROARING_AVX512_REQUIRED) == CROARING_AVX512_REQUIRED;
+#endif  // CROARING_COMPILER_SUPPORTS_AVX512
+        support = (has_avx2 ? ROARING_SUPPORTS_AVX2 : 0) |
+                  (has_avx512 ? ROARING_SUPPORTS_AVX512 : 0);
+    }
+    return support;
+}
+#endif
+
+#endif  // defined(__x86_64__) || defined(_M_AMD64) // x64
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/isadetection.c */
+/* begin file src/memory.c */
+#include <stdlib.h>
+
+
+// without the following, we get lots of warnings about posix_memalign
+#ifndef __cplusplus
+extern int posix_memalign(void** __memptr, size_t __alignment, size_t __size);
+#endif  //__cplusplus // C++ does not have a well defined signature
+
+// portable version of  posix_memalign
+static void* roaring_bitmap_aligned_malloc(size_t alignment, size_t size) {
+    void* p;
+#ifdef _MSC_VER
+    p = _aligned_malloc(size, alignment);
+#elif defined(__MINGW32__) || defined(__MINGW64__)
+    p = __mingw_aligned_malloc(size, alignment);
+#else
+    // somehow, if this is used before including "x86intrin.h", it creates an
+    // implicit defined warning.
+    if (posix_memalign(&p, alignment, size) != 0) return NULL;
+#endif
+    return p;
+}
+
+static void roaring_bitmap_aligned_free(void* memblock) {
+#ifdef _MSC_VER
+    _aligned_free(memblock);
+#elif defined(__MINGW32__) || defined(__MINGW64__)
+    __mingw_aligned_free(memblock);
+#else
+    free(memblock);
+#endif
+}
+
+static roaring_memory_t global_memory_hook = {
+    .malloc = malloc,
+    .realloc = realloc,
+    .calloc = calloc,
+    .free = free,
+    .aligned_malloc = roaring_bitmap_aligned_malloc,
+    .aligned_free = roaring_bitmap_aligned_free,
+};
+
+void roaring_init_memory_hook(roaring_memory_t memory_hook) {
+    global_memory_hook = memory_hook;
+}
+
+void* roaring_malloc(size_t n) { return global_memory_hook.malloc(n); }
+
+void* roaring_realloc(void* p, size_t new_sz) {
+    return global_memory_hook.realloc(p, new_sz);
+}
+
+void* roaring_calloc(size_t n_elements, size_t element_size) {
+    return global_memory_hook.calloc(n_elements, element_size);
+}
+
+void roaring_free(void* p) { global_memory_hook.free(p); }
+
+void* roaring_aligned_malloc(size_t alignment, size_t size) {
+    return global_memory_hook.aligned_malloc(alignment, size);
+}
+
+void roaring_aligned_free(void* p) { global_memory_hook.aligned_free(p); }
+/* end file src/memory.c */
+/* begin file src/roaring.c */
+#include <assert.h>
+#include <inttypes.h>
+#include <stdarg.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <string.h>
+
+
+// Include after roaring.h
+
+#ifdef __cplusplus
+using namespace ::roaring::internal;
+
+extern "C" {
+namespace roaring {
+namespace api {
+#endif
+
+#define CROARING_SERIALIZATION_ARRAY_UINT32 1
+#define CROARING_SERIALIZATION_CONTAINER 2
+extern inline int roaring_trailing_zeroes(unsigned long long input_num);
+extern inline int roaring_leading_zeroes(unsigned long long input_num);
+extern inline void roaring_bitmap_init_cleared(roaring_bitmap_t *r);
+extern inline bool roaring_bitmap_get_copy_on_write(const roaring_bitmap_t *r);
+extern inline void roaring_bitmap_set_copy_on_write(roaring_bitmap_t *r,
+                                                    bool cow);
+extern inline roaring_bitmap_t *roaring_bitmap_create(void);
+extern inline void roaring_bitmap_add_range(roaring_bitmap_t *r, uint64_t min,
+                                            uint64_t max);
+extern inline void roaring_bitmap_remove_range(roaring_bitmap_t *r,
+                                               uint64_t min, uint64_t max);
+
+static inline bool is_cow(const roaring_bitmap_t *r) {
+    return r->high_low_container.flags & ROARING_FLAG_COW;
+}
+static inline bool is_frozen(const roaring_bitmap_t *r) {
+    return r->high_low_container.flags & ROARING_FLAG_FROZEN;
+}
+
+// this is like roaring_bitmap_add, but it populates pointer arguments in such a
+// way
+// that we can recover the container touched, which, in turn can be used to
+// accelerate some functions (when you repeatedly need to add to the same
+// container)
+static inline container_t *containerptr_roaring_bitmap_add(roaring_bitmap_t *r,
+                                                           uint32_t val,
+                                                           uint8_t *type,
+                                                           int *index) {
+    roaring_array_t *ra = &r->high_low_container;
+
+    uint16_t hb = val >> 16;
+    const int i = ra_get_index(ra, hb);
+    if (i >= 0) {
+        ra_unshare_container_at_index(ra, (uint16_t)i);
+        container_t *c = ra_get_container_at_index(ra, (uint16_t)i, type);
+        uint8_t new_type = *type;
+        container_t *c2 = container_add(c, val & 0xFFFF, *type, &new_type);
+        *index = i;
+        if (c2 != c) {
+            container_free(c, *type);
+            ra_set_container_at_index(ra, i, c2, new_type);
+            *type = new_type;
+            return c2;
+        } else {
+            return c;
+        }
+    } else {
+        array_container_t *new_ac = array_container_create();
+        container_t *c =
+            container_add(new_ac, val & 0xFFFF, ARRAY_CONTAINER_TYPE, type);
+        // we could just assume that it stays an array container
+        ra_insert_new_key_value_at(ra, -i - 1, hb, c, *type);
+        *index = -i - 1;
+        return c;
+    }
+}
+
+roaring_bitmap_t *roaring_bitmap_create_with_capacity(uint32_t cap) {
+    roaring_bitmap_t *ans =
+        (roaring_bitmap_t *)roaring_malloc(sizeof(roaring_bitmap_t));
+    if (!ans) {
+        return NULL;
+    }
+    bool is_ok = ra_init_with_capacity(&ans->high_low_container, cap);
+    if (!is_ok) {
+        roaring_free(ans);
+        return NULL;
+    }
+    return ans;
+}
+
+bool roaring_bitmap_init_with_capacity(roaring_bitmap_t *r, uint32_t cap) {
+    return ra_init_with_capacity(&r->high_low_container, cap);
+}
+
+static inline void add_bulk_impl(roaring_bitmap_t *r,
+                                 roaring_bulk_context_t *context,
+                                 uint32_t val) {
+    uint16_t key = val >> 16;
+    if (context->container == NULL || context->key != key) {
+        uint8_t typecode;
+        int idx;
+        context->container =
+            containerptr_roaring_bitmap_add(r, val, &typecode, &idx);
+        context->typecode = typecode;
+        context->idx = idx;
+        context->key = key;
+    } else {
+        // no need to seek the container, it is at hand
+        // because we already have the container at hand, we can do the
+        // insertion directly, bypassing the roaring_bitmap_add call
+        uint8_t new_typecode;
+        container_t *container2 = container_add(
+            context->container, val & 0xFFFF, context->typecode, &new_typecode);
+        if (container2 != context->container) {
+            // rare instance when we need to change the container type
+            container_free(context->container, context->typecode);
+            ra_set_container_at_index(&r->high_low_container, context->idx,
+                                      container2, new_typecode);
+            context->typecode = new_typecode;
+            context->container = container2;
+        }
+    }
+}
+
+void roaring_bitmap_add_many(roaring_bitmap_t *r, size_t n_args,
+                             const uint32_t *vals) {
+    uint32_t val;
+    const uint32_t *start = vals;
+    const uint32_t *end = vals + n_args;
+    const uint32_t *current_val = start;
+
+    if (n_args == 0) {
+        return;
+    }
+
+    uint8_t typecode;
+    int idx;
+    container_t *container;
+    val = *current_val;
+    container = containerptr_roaring_bitmap_add(r, val, &typecode, &idx);
+    roaring_bulk_context_t context = {container, idx, (uint16_t)(val >> 16),
+                                      typecode};
+
+    for (; current_val != end; current_val++) {
+        memcpy(&val, current_val, sizeof(val));
+        add_bulk_impl(r, &context, val);
+    }
+}
+
+void roaring_bitmap_add_bulk(roaring_bitmap_t *r,
+                             roaring_bulk_context_t *context, uint32_t val) {
+    add_bulk_impl(r, context, val);
+}
+
+bool roaring_bitmap_contains_bulk(const roaring_bitmap_t *r,
+                                  roaring_bulk_context_t *context,
+                                  uint32_t val) {
+    uint16_t key = val >> 16;
+    if (context->container == NULL || context->key != key) {
+        int32_t start_idx = -1;
+        if (context->container != NULL && context->key < key) {
+            start_idx = context->idx;
+        }
+        int idx = ra_advance_until(&r->high_low_container, key, start_idx);
+        if (idx == ra_get_size(&r->high_low_container)) {
+            return false;
+        }
+        uint8_t typecode;
+        context->container = ra_get_container_at_index(
+            &r->high_low_container, (uint16_t)idx, &typecode);
+        context->typecode = typecode;
+        context->idx = idx;
+        context->key =
+            ra_get_key_at_index(&r->high_low_container, (uint16_t)idx);
+        // ra_advance_until finds the next key >= the target, we found a later
+        // container.
+        if (context->key != key) {
+            return false;
+        }
+    }
+    // context is now set up
+    return container_contains(context->container, val & 0xFFFF,
+                              context->typecode);
+}
+
+roaring_bitmap_t *roaring_bitmap_of_ptr(size_t n_args, const uint32_t *vals) {
+    roaring_bitmap_t *answer = roaring_bitmap_create();
+    roaring_bitmap_add_many(answer, n_args, vals);
+    return answer;
+}
+
+roaring_bitmap_t *roaring_bitmap_of(size_t n_args, ...) {
+    // todo: could be greatly optimized but we do not expect this call to ever
+    // include long lists
+    roaring_bitmap_t *answer = roaring_bitmap_create();
+    roaring_bulk_context_t context = CROARING_ZERO_INITIALIZER;
+    va_list ap;
+    va_start(ap, n_args);
+    for (size_t i = 0; i < n_args; i++) {
+        uint32_t val = va_arg(ap, uint32_t);
+        roaring_bitmap_add_bulk(answer, &context, val);
+    }
+    va_end(ap);
+    return answer;
+}
+
+static inline uint64_t minimum_uint64(uint64_t a, uint64_t b) {
+    return (a < b) ? a : b;
+}
+
+roaring_bitmap_t *roaring_bitmap_from_range(uint64_t min, uint64_t max,
+                                            uint32_t step) {
+    if (max >= UINT64_C(0x100000000)) {
+        max = UINT64_C(0x100000000);
+    }
+    if (step == 0) return NULL;
+    if (max <= min) return NULL;
+    roaring_bitmap_t *answer = roaring_bitmap_create();
+    if (step >= (1 << 16)) {
+        for (uint32_t value = (uint32_t)min; value < max; value += step) {
+            roaring_bitmap_add(answer, value);
+        }
+        return answer;
+    }
+    uint64_t min_tmp = min;
+    do {
+        uint32_t key = (uint32_t)min_tmp >> 16;
+        uint32_t container_min = min_tmp & 0xFFFF;
+        uint32_t container_max =
+            (uint32_t)minimum_uint64(max - (key << 16), 1 << 16);
+        uint8_t type;
+        container_t *container = container_from_range(
+            &type, container_min, container_max, (uint16_t)step);
+        ra_append(&answer->high_low_container, (uint16_t)key, container, type);
+        uint32_t gap = container_max - container_min + step - 1;
+        min_tmp += gap - (gap % step);
+    } while (min_tmp < max);
+    // cardinality of bitmap will be ((uint64_t) max - min + step - 1 ) / step
+    return answer;
+}
+
+void roaring_bitmap_add_range_closed(roaring_bitmap_t *r, uint32_t min,
+                                     uint32_t max) {
+    if (min > max) {
+        return;
+    }
+
+    roaring_array_t *ra = &r->high_low_container;
+
+    uint32_t min_key = min >> 16;
+    uint32_t max_key = max >> 16;
+
+    int32_t num_required_containers = max_key - min_key + 1;
+    int32_t suffix_length =
+        count_greater(ra->keys, ra->size, (uint16_t)max_key);
+    int32_t prefix_length =
+        count_less(ra->keys, ra->size - suffix_length, (uint16_t)min_key);
+    int32_t common_length = ra->size - prefix_length - suffix_length;
+
+    if (num_required_containers > common_length) {
+        ra_shift_tail(ra, suffix_length,
+                      num_required_containers - common_length);
+    }
+
+    int32_t src = prefix_length + common_length - 1;
+    int32_t dst = ra->size - suffix_length - 1;
+    for (uint32_t key = max_key; key != min_key - 1;
+         key--) {  // beware of min_key==0
+        uint32_t container_min = (min_key == key) ? (min & 0xffff) : 0;
+        uint32_t container_max = (max_key == key) ? (max & 0xffff) : 0xffff;
+        container_t *new_container;
+        uint8_t new_type;
+
+        if (src >= 0 && ra->keys[src] == key) {
+            ra_unshare_container_at_index(ra, (uint16_t)src);
+            new_container =
+                container_add_range(ra->containers[src], ra->typecodes[src],
+                                    container_min, container_max, &new_type);
+            if (new_container != ra->containers[src]) {
+                container_free(ra->containers[src], ra->typecodes[src]);
+            }
+            src--;
+        } else {
+            new_container = container_from_range(&new_type, container_min,
+                                                 container_max + 1, 1);
+        }
+        ra_replace_key_and_container_at_index(ra, dst, (uint16_t)key,
+                                              new_container, new_type);
+        dst--;
+    }
+}
+
+void roaring_bitmap_remove_range_closed(roaring_bitmap_t *r, uint32_t min,
+                                        uint32_t max) {
+    if (min > max) {
+        return;
+    }
+
+    roaring_array_t *ra = &r->high_low_container;
+
+    uint32_t min_key = min >> 16;
+    uint32_t max_key = max >> 16;
+
+    int32_t src = count_less(ra->keys, ra->size, (uint16_t)min_key);
+    int32_t dst = src;
+    while (src < ra->size && ra->keys[src] <= max_key) {
+        uint32_t container_min =
+            (min_key == ra->keys[src]) ? (min & 0xffff) : 0;
+        uint32_t container_max =
+            (max_key == ra->keys[src]) ? (max & 0xffff) : 0xffff;
+        ra_unshare_container_at_index(ra, (uint16_t)src);
+        container_t *new_container;
+        uint8_t new_type;
+        new_container =
+            container_remove_range(ra->containers[src], ra->typecodes[src],
+                                   container_min, container_max, &new_type);
+        if (new_container != ra->containers[src]) {
+            container_free(ra->containers[src], ra->typecodes[src]);
+        }
+        if (new_container) {
+            ra_replace_key_and_container_at_index(ra, dst, ra->keys[src],
+                                                  new_container, new_type);
+            dst++;
+        }
+        src++;
+    }
+    if (src > dst) {
+        ra_shift_tail(ra, ra->size - src, dst - src);
+    }
+}
+
+void roaring_bitmap_printf(const roaring_bitmap_t *r) {
+    const roaring_array_t *ra = &r->high_low_container;
+
+    printf("{");
+    for (int i = 0; i < ra->size; ++i) {
+        container_printf_as_uint32_array(ra->containers[i], ra->typecodes[i],
+                                         ((uint32_t)ra->keys[i]) << 16);
+
+        if (i + 1 < ra->size) {
+            printf(",");
+        }
+    }
+    printf("}");
+}
+
+void roaring_bitmap_printf_describe(const roaring_bitmap_t *r) {
+    const roaring_array_t *ra = &r->high_low_container;
+
+    printf("{");
+    for (int i = 0; i < ra->size; ++i) {
+        printf("%d: %s (%d)", ra->keys[i],
+               get_full_container_name(ra->containers[i], ra->typecodes[i]),
+               container_get_cardinality(ra->containers[i], ra->typecodes[i]));
+        if (ra->typecodes[i] == SHARED_CONTAINER_TYPE) {
+            printf("(shared count = %" PRIu32 " )",
+                   croaring_refcount_get(
+                       &(CAST_shared(ra->containers[i])->counter)));
+        }
+
+        if (i + 1 < ra->size) {
+            printf(", ");
+        }
+    }
+    printf("}");
+}
+
+/**
+ *  (For advanced users.)
+ * Collect statistics about the bitmap
+ */
+void roaring_bitmap_statistics(const roaring_bitmap_t *r,
+                               roaring_statistics_t *stat) {
+    const roaring_array_t *ra = &r->high_low_container;
+
+    memset(stat, 0, sizeof(*stat));
+    stat->n_containers = ra->size;
+    stat->min_value = roaring_bitmap_minimum(r);
+    stat->max_value = roaring_bitmap_maximum(r);
+
+    for (int i = 0; i < ra->size; ++i) {
+        uint8_t truetype =
+            get_container_type(ra->containers[i], ra->typecodes[i]);
+        uint32_t card =
+            container_get_cardinality(ra->containers[i], ra->typecodes[i]);
+        uint32_t sbytes =
+            container_size_in_bytes(ra->containers[i], ra->typecodes[i]);
+        stat->cardinality += card;
+        switch (truetype) {
+            case BITSET_CONTAINER_TYPE:
+                stat->n_bitset_containers++;
+                stat->n_values_bitset_containers += card;
+                stat->n_bytes_bitset_containers += sbytes;
+                break;
+            case ARRAY_CONTAINER_TYPE:
+                stat->n_array_containers++;
+                stat->n_values_array_containers += card;
+                stat->n_bytes_array_containers += sbytes;
+                break;
+            case RUN_CONTAINER_TYPE:
+                stat->n_run_containers++;
+                stat->n_values_run_containers += card;
+                stat->n_bytes_run_containers += sbytes;
+                break;
+            default:
+                assert(false);
+                roaring_unreachable;
+        }
+    }
+}
+
+/*
+ * Checks that:
+ * - Array containers are sorted and contain no duplicates
+ * - Range containers are sorted and contain no overlapping ranges
+ * - Roaring containers are sorted by key and there are no duplicate keys
+ * - The correct container type is use for each container (e.g. bitmaps aren't
+ * used for small containers)
+ */
+bool roaring_bitmap_internal_validate(const roaring_bitmap_t *r,
+                                      const char **reason) {
+    const char *reason_local;
+    if (reason == NULL) {
+        // Always allow assigning through *reason
+        reason = &reason_local;
+    }
+    *reason = NULL;
+    const roaring_array_t *ra = &r->high_low_container;
+    if (ra->size < 0) {
+        *reason = "negative size";
+        return false;
+    }
+    if (ra->allocation_size < 0) {
+        *reason = "negative allocation size";
+        return false;
+    }
+    if (ra->size > ra->allocation_size) {
+        *reason = "more containers than allocated space";
+        return false;
+    }
+    if (ra->flags & ~(ROARING_FLAG_COW | ROARING_FLAG_FROZEN)) {
+        *reason = "invalid flags";
+        return false;
+    }
+    if (ra->size == 0) {
+        return true;
+    }
+
+    if (ra->keys == NULL) {
+        *reason = "keys is NULL";
+        return false;
+    }
+    if (ra->typecodes == NULL) {
+        *reason = "typecodes is NULL";
+        return false;
+    }
+    if (ra->containers == NULL) {
+        *reason = "containers is NULL";
+        return false;
+    }
+
+    uint32_t prev_key = ra->keys[0];
+    for (int32_t i = 1; i < ra->size; ++i) {
+        if (ra->keys[i] <= prev_key) {
+            *reason = "keys not strictly increasing";
+            return false;
+        }
+        prev_key = ra->keys[i];
+    }
+
+    for (int32_t i = 0; i < ra->size; ++i) {
+        if (!container_internal_validate(ra->containers[i], ra->typecodes[i],
+                                         reason)) {
+            // reason should already be set
+            if (*reason == NULL) {
+                *reason = "container failed to validate but no reason given";
+            }
+            return false;
+        }
+    }
+
+    return true;
+}
+
+roaring_bitmap_t *roaring_bitmap_copy(const roaring_bitmap_t *r) {
+    roaring_bitmap_t *ans =
+        (roaring_bitmap_t *)roaring_malloc(sizeof(roaring_bitmap_t));
+    if (!ans) {
+        return NULL;
+    }
+    if (!ra_init_with_capacity(  // allocation of list of containers can fail
+            &ans->high_low_container, r->high_low_container.size)) {
+        roaring_free(ans);
+        return NULL;
+    }
+    if (!ra_overwrite(  // memory allocation of individual containers may fail
+            &r->high_low_container, &ans->high_low_container, is_cow(r))) {
+        roaring_bitmap_free(ans);  // overwrite should leave in freeable state
+        return NULL;
+    }
+    roaring_bitmap_set_copy_on_write(ans, is_cow(r));
+    return ans;
+}
+
+bool roaring_bitmap_overwrite(roaring_bitmap_t *dest,
+                              const roaring_bitmap_t *src) {
+    roaring_bitmap_set_copy_on_write(dest, is_cow(src));
+    return ra_overwrite(&src->high_low_container, &dest->high_low_container,
+                        is_cow(src));
+}
+
+void roaring_bitmap_free(const roaring_bitmap_t *r) {
+    if (r == NULL) {
+        return;
+    }
+    if (!is_frozen(r)) {
+        ra_clear((roaring_array_t *)&r->high_low_container);
+    }
+    roaring_free((roaring_bitmap_t *)r);
+}
+
+void roaring_bitmap_clear(roaring_bitmap_t *r) {
+    ra_reset(&r->high_low_container);
+}
+
+void roaring_bitmap_add(roaring_bitmap_t *r, uint32_t val) {
+    roaring_array_t *ra = &r->high_low_container;
+
+    const uint16_t hb = val >> 16;
+    const int i = ra_get_index(ra, hb);
+    uint8_t typecode;
+    if (i >= 0) {
+        ra_unshare_container_at_index(ra, (uint16_t)i);
+        container_t *container =
+            ra_get_container_at_index(ra, (uint16_t)i, &typecode);
+        uint8_t newtypecode = typecode;
+        container_t *container2 =
+            container_add(container, val & 0xFFFF, typecode, &newtypecode);
+        if (container2 != container) {
+            container_free(container, typecode);
+            ra_set_container_at_index(&r->high_low_container, i, container2,
+                                      newtypecode);
+        }
+    } else {
+        array_container_t *newac = array_container_create();
+        container_t *container =
+            container_add(newac, val & 0xFFFF, ARRAY_CONTAINER_TYPE, &typecode);
+        // we could just assume that it stays an array container
+        ra_insert_new_key_value_at(&r->high_low_container, -i - 1, hb,
+                                   container, typecode);
+    }
+}
+
+bool roaring_bitmap_add_checked(roaring_bitmap_t *r, uint32_t val) {
+    const uint16_t hb = val >> 16;
+    const int i = ra_get_index(&r->high_low_container, hb);
+    uint8_t typecode;
+    bool result = false;
+    if (i >= 0) {
+        ra_unshare_container_at_index(&r->high_low_container, (uint16_t)i);
+        container_t *container = ra_get_container_at_index(
+            &r->high_low_container, (uint16_t)i, &typecode);
+
+        const int oldCardinality =
+            container_get_cardinality(container, typecode);
+
+        uint8_t newtypecode = typecode;
+        container_t *container2 =
+            container_add(container, val & 0xFFFF, typecode, &newtypecode);
+        if (container2 != container) {
+            container_free(container, typecode);
+            ra_set_container_at_index(&r->high_low_container, i, container2,
+                                      newtypecode);
+            result = true;
+        } else {
+            const int newCardinality =
+                container_get_cardinality(container, newtypecode);
+
+            result = oldCardinality != newCardinality;
+        }
+    } else {
+        array_container_t *newac = array_container_create();
+        container_t *container =
+            container_add(newac, val & 0xFFFF, ARRAY_CONTAINER_TYPE, &typecode);
+        // we could just assume that it stays an array container
+        ra_insert_new_key_value_at(&r->high_low_container, -i - 1, hb,
+                                   container, typecode);
+        result = true;
+    }
+
+    return result;
+}
+
+void roaring_bitmap_remove(roaring_bitmap_t *r, uint32_t val) {
+    const uint16_t hb = val >> 16;
+    const int i = ra_get_index(&r->high_low_container, hb);
+    uint8_t typecode;
+    if (i >= 0) {
+        ra_unshare_container_at_index(&r->high_low_container, (uint16_t)i);
+        container_t *container = ra_get_container_at_index(
+            &r->high_low_container, (uint16_t)i, &typecode);
+        uint8_t newtypecode = typecode;
+        container_t *container2 =
+            container_remove(container, val & 0xFFFF, typecode, &newtypecode);
+        if (container2 != container) {
+            container_free(container, typecode);
+            ra_set_container_at_index(&r->high_low_container, i, container2,
+                                      newtypecode);
+        }
+        if (container_get_cardinality(container2, newtypecode) != 0) {
+            ra_set_container_at_index(&r->high_low_container, i, container2,
+                                      newtypecode);
+        } else {
+            ra_remove_at_index_and_free(&r->high_low_container, i);
+        }
+    }
+}
+
+bool roaring_bitmap_remove_checked(roaring_bitmap_t *r, uint32_t val) {
+    const uint16_t hb = val >> 16;
+    const int i = ra_get_index(&r->high_low_container, hb);
+    uint8_t typecode;
+    bool result = false;
+    if (i >= 0) {
+        ra_unshare_container_at_index(&r->high_low_container, (uint16_t)i);
+        container_t *container = ra_get_container_at_index(
+            &r->high_low_container, (uint16_t)i, &typecode);
+
+        const int oldCardinality =
+            container_get_cardinality(container, typecode);
+
+        uint8_t newtypecode = typecode;
+        container_t *container2 =
+            container_remove(container, val & 0xFFFF, typecode, &newtypecode);
+        if (container2 != container) {
+            container_free(container, typecode);
+            ra_set_container_at_index(&r->high_low_container, i, container2,
+                                      newtypecode);
+        }
+
+        const int newCardinality =
+            container_get_cardinality(container2, newtypecode);
+
+        if (newCardinality != 0) {
+            ra_set_container_at_index(&r->high_low_container, i, container2,
+                                      newtypecode);
+        } else {
+            ra_remove_at_index_and_free(&r->high_low_container, i);
+        }
+
+        result = oldCardinality != newCardinality;
+    }
+    return result;
+}
+
+void roaring_bitmap_remove_many(roaring_bitmap_t *r, size_t n_args,
+                                const uint32_t *vals) {
+    if (n_args == 0 || r->high_low_container.size == 0) {
+        return;
+    }
+    int32_t pos =
+        -1;  // position of the container used in the previous iteration
+    for (size_t i = 0; i < n_args; i++) {
+        uint16_t key = (uint16_t)(vals[i] >> 16);
+        if (pos < 0 || key != r->high_low_container.keys[pos]) {
+            pos = ra_get_index(&r->high_low_container, key);
+        }
+        if (pos >= 0) {
+            uint8_t new_typecode;
+            container_t *new_container;
+            new_container = container_remove(
+                r->high_low_container.containers[pos], vals[i] & 0xffff,
+                r->high_low_container.typecodes[pos], &new_typecode);
+            if (new_container != r->high_low_container.containers[pos]) {
+                container_free(r->high_low_container.containers[pos],
+                               r->high_low_container.typecodes[pos]);
+                ra_replace_key_and_container_at_index(&r->high_low_container,
+                                                      pos, key, new_container,
+                                                      new_typecode);
+            }
+            if (!container_nonzero_cardinality(new_container, new_typecode)) {
+                container_free(new_container, new_typecode);
+                ra_remove_at_index(&r->high_low_container, pos);
+                pos = -1;
+            }
+        }
+    }
+}
+
+// there should be some SIMD optimizations possible here
+roaring_bitmap_t *roaring_bitmap_and(const roaring_bitmap_t *x1,
+                                     const roaring_bitmap_t *x2) {
+    uint8_t result_type = 0;
+    const int length1 = x1->high_low_container.size,
+              length2 = x2->high_low_container.size;
+    uint32_t neededcap = length1 > length2 ? length2 : length1;
+    roaring_bitmap_t *answer = roaring_bitmap_create_with_capacity(neededcap);
+    roaring_bitmap_set_copy_on_write(answer, is_cow(x1) || is_cow(x2));
+
+    int pos1 = 0, pos2 = 0;
+
+    while (pos1 < length1 && pos2 < length2) {
+        const uint16_t s1 =
+            ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+        const uint16_t s2 =
+            ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        if (s1 == s2) {
+            uint8_t type1, type2;
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            container_t *c = container_and(c1, type1, c2, type2, &result_type);
+
+            if (container_nonzero_cardinality(c, result_type)) {
+                ra_append(&answer->high_low_container, s1, c, result_type);
+            } else {
+                container_free(c, result_type);  // otherwise: memory leak!
+            }
+            ++pos1;
+            ++pos2;
+        } else if (s1 < s2) {  // s1 < s2
+            pos1 = ra_advance_until(&x1->high_low_container, s2, pos1);
+        } else {  // s1 > s2
+            pos2 = ra_advance_until(&x2->high_low_container, s1, pos2);
+        }
+    }
+    return answer;
+}
+
+/**
+ * Compute the union of 'number' bitmaps.
+ */
+roaring_bitmap_t *roaring_bitmap_or_many(size_t number,
+                                         const roaring_bitmap_t **x) {
+    if (number == 0) {
+        return roaring_bitmap_create();
+    }
+    if (number == 1) {
+        return roaring_bitmap_copy(x[0]);
+    }
+    roaring_bitmap_t *answer =
+        roaring_bitmap_lazy_or(x[0], x[1], LAZY_OR_BITSET_CONVERSION);
+    for (size_t i = 2; i < number; i++) {
+        roaring_bitmap_lazy_or_inplace(answer, x[i], LAZY_OR_BITSET_CONVERSION);
+    }
+    roaring_bitmap_repair_after_lazy(answer);
+    return answer;
+}
+
+/**
+ * Compute the xor of 'number' bitmaps.
+ */
+roaring_bitmap_t *roaring_bitmap_xor_many(size_t number,
+                                          const roaring_bitmap_t **x) {
+    if (number == 0) {
+        return roaring_bitmap_create();
+    }
+    if (number == 1) {
+        return roaring_bitmap_copy(x[0]);
+    }
+    roaring_bitmap_t *answer = roaring_bitmap_lazy_xor(x[0], x[1]);
+    for (size_t i = 2; i < number; i++) {
+        roaring_bitmap_lazy_xor_inplace(answer, x[i]);
+    }
+    roaring_bitmap_repair_after_lazy(answer);
+    return answer;
+}
+
+// inplace and (modifies its first argument).
+void roaring_bitmap_and_inplace(roaring_bitmap_t *x1,
+                                const roaring_bitmap_t *x2) {
+    if (x1 == x2) return;
+    int pos1 = 0, pos2 = 0, intersection_size = 0;
+    const int length1 = ra_get_size(&x1->high_low_container);
+    const int length2 = ra_get_size(&x2->high_low_container);
+
+    // any skipped-over or newly emptied containers in x1
+    // have to be freed.
+    while (pos1 < length1 && pos2 < length2) {
+        const uint16_t s1 =
+            ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+        const uint16_t s2 =
+            ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        if (s1 == s2) {
+            uint8_t type1, type2, result_type;
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+
+            // We do the computation "in place" only when c1 is not a shared
+            // container. Rationale: using a shared container safely with in
+            // place computation would require making a copy and then doing the
+            // computation in place which is likely less efficient than avoiding
+            // in place entirely and always generating a new container.
+            container_t *c =
+                (type1 == SHARED_CONTAINER_TYPE)
+                    ? container_and(c1, type1, c2, type2, &result_type)
+                    : container_iand(c1, type1, c2, type2, &result_type);
+
+            if (c != c1) {  // in this instance a new container was created, and
+                            // we need to free the old one
+                container_free(c1, type1);
+            }
+            if (container_nonzero_cardinality(c, result_type)) {
+                ra_replace_key_and_container_at_index(&x1->high_low_container,
+                                                      intersection_size, s1, c,
+                                                      result_type);
+                intersection_size++;
+            } else {
+                container_free(c, result_type);
+            }
+            ++pos1;
+            ++pos2;
+        } else if (s1 < s2) {
+            pos1 = ra_advance_until_freeing(&x1->high_low_container, s2, pos1);
+        } else {  // s1 > s2
+            pos2 = ra_advance_until(&x2->high_low_container, s1, pos2);
+        }
+    }
+
+    // if we ended early because x2 ran out, then all remaining in x1 should be
+    // freed
+    while (pos1 < length1) {
+        container_free(x1->high_low_container.containers[pos1],
+                       x1->high_low_container.typecodes[pos1]);
+        ++pos1;
+    }
+
+    // all containers after this have either been copied or freed
+    ra_downsize(&x1->high_low_container, intersection_size);
+}
+
+roaring_bitmap_t *roaring_bitmap_or(const roaring_bitmap_t *x1,
+                                    const roaring_bitmap_t *x2) {
+    uint8_t result_type = 0;
+    const int length1 = x1->high_low_container.size,
+              length2 = x2->high_low_container.size;
+    if (0 == length1) {
+        return roaring_bitmap_copy(x2);
+    }
+    if (0 == length2) {
+        return roaring_bitmap_copy(x1);
+    }
+    roaring_bitmap_t *answer =
+        roaring_bitmap_create_with_capacity(length1 + length2);
+    roaring_bitmap_set_copy_on_write(answer, is_cow(x1) || is_cow(x2));
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            container_t *c = container_or(c1, type1, c2, type2, &result_type);
+
+            // since we assume that the initial containers are non-empty, the
+            // result here
+            // can only be non-empty
+            ra_append(&answer->high_low_container, s1, c, result_type);
+            ++pos1;
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            // c1 = container_clone(c1, type1);
+            c1 = get_copy_of_container(c1, &type1, is_cow(x1));
+            if (is_cow(x1)) {
+                ra_set_container_at_index(&x1->high_low_container, pos1, c1,
+                                          type1);
+            }
+            ra_append(&answer->high_low_container, s1, c1, type1);
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            // c2 = container_clone(c2, type2);
+            c2 = get_copy_of_container(c2, &type2, is_cow(x2));
+            if (is_cow(x2)) {
+                ra_set_container_at_index(&x2->high_low_container, pos2, c2,
+                                          type2);
+            }
+            ra_append(&answer->high_low_container, s2, c2, type2);
+            pos2++;
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+    if (pos1 == length1) {
+        ra_append_copy_range(&answer->high_low_container,
+                             &x2->high_low_container, pos2, length2,
+                             is_cow(x2));
+    } else if (pos2 == length2) {
+        ra_append_copy_range(&answer->high_low_container,
+                             &x1->high_low_container, pos1, length1,
+                             is_cow(x1));
+    }
+    return answer;
+}
+
+// inplace or (modifies its first argument).
+void roaring_bitmap_or_inplace(roaring_bitmap_t *x1,
+                               const roaring_bitmap_t *x2) {
+    uint8_t result_type = 0;
+    int length1 = x1->high_low_container.size;
+    const int length2 = x2->high_low_container.size;
+
+    if (0 == length2) return;
+
+    if (0 == length1) {
+        roaring_bitmap_overwrite(x1, x2);
+        return;
+    }
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            if (!container_is_full(c1, type1)) {
+                container_t *c2 = ra_get_container_at_index(
+                    &x2->high_low_container, (uint16_t)pos2, &type2);
+                container_t *c =
+                    (type1 == SHARED_CONTAINER_TYPE)
+                        ? container_or(c1, type1, c2, type2, &result_type)
+                        : container_ior(c1, type1, c2, type2, &result_type);
+
+                if (c != c1) {  // in this instance a new container was created,
+                                // and we need to free the old one
+                    container_free(c1, type1);
+                }
+                ra_set_container_at_index(&x1->high_low_container, pos1, c,
+                                          result_type);
+            }
+            ++pos1;
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            c2 = get_copy_of_container(c2, &type2, is_cow(x2));
+            if (is_cow(x2)) {
+                ra_set_container_at_index(&x2->high_low_container, pos2, c2,
+                                          type2);
+            }
+
+            // container_t *c2_clone = container_clone(c2, type2);
+            ra_insert_new_key_value_at(&x1->high_low_container, pos1, s2, c2,
+                                       type2);
+            pos1++;
+            length1++;
+            pos2++;
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+    if (pos1 == length1) {
+        ra_append_copy_range(&x1->high_low_container, &x2->high_low_container,
+                             pos2, length2, is_cow(x2));
+    }
+}
+
+roaring_bitmap_t *roaring_bitmap_xor(const roaring_bitmap_t *x1,
+                                     const roaring_bitmap_t *x2) {
+    uint8_t result_type = 0;
+    const int length1 = x1->high_low_container.size,
+              length2 = x2->high_low_container.size;
+    if (0 == length1) {
+        return roaring_bitmap_copy(x2);
+    }
+    if (0 == length2) {
+        return roaring_bitmap_copy(x1);
+    }
+    roaring_bitmap_t *answer =
+        roaring_bitmap_create_with_capacity(length1 + length2);
+    roaring_bitmap_set_copy_on_write(answer, is_cow(x1) || is_cow(x2));
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            container_t *c = container_xor(c1, type1, c2, type2, &result_type);
+
+            if (container_nonzero_cardinality(c, result_type)) {
+                ra_append(&answer->high_low_container, s1, c, result_type);
+            } else {
+                container_free(c, result_type);
+            }
+            ++pos1;
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            c1 = get_copy_of_container(c1, &type1, is_cow(x1));
+            if (is_cow(x1)) {
+                ra_set_container_at_index(&x1->high_low_container, pos1, c1,
+                                          type1);
+            }
+            ra_append(&answer->high_low_container, s1, c1, type1);
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            c2 = get_copy_of_container(c2, &type2, is_cow(x2));
+            if (is_cow(x2)) {
+                ra_set_container_at_index(&x2->high_low_container, pos2, c2,
+                                          type2);
+            }
+            ra_append(&answer->high_low_container, s2, c2, type2);
+            pos2++;
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+    if (pos1 == length1) {
+        ra_append_copy_range(&answer->high_low_container,
+                             &x2->high_low_container, pos2, length2,
+                             is_cow(x2));
+    } else if (pos2 == length2) {
+        ra_append_copy_range(&answer->high_low_container,
+                             &x1->high_low_container, pos1, length1,
+                             is_cow(x1));
+    }
+    return answer;
+}
+
+// inplace xor (modifies its first argument).
+
+void roaring_bitmap_xor_inplace(roaring_bitmap_t *x1,
+                                const roaring_bitmap_t *x2) {
+    assert(x1 != x2);
+    uint8_t result_type = 0;
+    int length1 = x1->high_low_container.size;
+    const int length2 = x2->high_low_container.size;
+
+    if (0 == length2) return;
+
+    if (0 == length1) {
+        roaring_bitmap_overwrite(x1, x2);
+        return;
+    }
+
+    // XOR can have new containers inserted from x2, but can also
+    // lose containers when x1 and x2 are nonempty and identical.
+
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+
+            // We do the computation "in place" only when c1 is not a shared
+            // container. Rationale: using a shared container safely with in
+            // place computation would require making a copy and then doing the
+            // computation in place which is likely less efficient than avoiding
+            // in place entirely and always generating a new container.
+
+            container_t *c;
+            if (type1 == SHARED_CONTAINER_TYPE) {
+                c = container_xor(c1, type1, c2, type2, &result_type);
+                shared_container_free(CAST_shared(c1));  // so release
+            } else {
+                c = container_ixor(c1, type1, c2, type2, &result_type);
+            }
+
+            if (container_nonzero_cardinality(c, result_type)) {
+                ra_set_container_at_index(&x1->high_low_container, pos1, c,
+                                          result_type);
+                ++pos1;
+            } else {
+                container_free(c, result_type);
+                ra_remove_at_index(&x1->high_low_container, pos1);
+                --length1;
+            }
+
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            c2 = get_copy_of_container(c2, &type2, is_cow(x2));
+            if (is_cow(x2)) {
+                ra_set_container_at_index(&x2->high_low_container, pos2, c2,
+                                          type2);
+            }
+
+            ra_insert_new_key_value_at(&x1->high_low_container, pos1, s2, c2,
+                                       type2);
+            pos1++;
+            length1++;
+            pos2++;
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+    if (pos1 == length1) {
+        ra_append_copy_range(&x1->high_low_container, &x2->high_low_container,
+                             pos2, length2, is_cow(x2));
+    }
+}
+
+roaring_bitmap_t *roaring_bitmap_andnot(const roaring_bitmap_t *x1,
+                                        const roaring_bitmap_t *x2) {
+    uint8_t result_type = 0;
+    const int length1 = x1->high_low_container.size,
+              length2 = x2->high_low_container.size;
+    if (0 == length1) {
+        roaring_bitmap_t *empty_bitmap = roaring_bitmap_create();
+        roaring_bitmap_set_copy_on_write(empty_bitmap,
+                                         is_cow(x1) || is_cow(x2));
+        return empty_bitmap;
+    }
+    if (0 == length2) {
+        return roaring_bitmap_copy(x1);
+    }
+    roaring_bitmap_t *answer = roaring_bitmap_create_with_capacity(length1);
+    roaring_bitmap_set_copy_on_write(answer, is_cow(x1) || is_cow(x2));
+
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = 0;
+    uint16_t s2 = 0;
+    while (true) {
+        s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+        s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            container_t *c =
+                container_andnot(c1, type1, c2, type2, &result_type);
+
+            if (container_nonzero_cardinality(c, result_type)) {
+                ra_append(&answer->high_low_container, s1, c, result_type);
+            } else {
+                container_free(c, result_type);
+            }
+            ++pos1;
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+        } else if (s1 < s2) {  // s1 < s2
+            const int next_pos1 =
+                ra_advance_until(&x1->high_low_container, s2, pos1);
+            ra_append_copy_range(&answer->high_low_container,
+                                 &x1->high_low_container, pos1, next_pos1,
+                                 is_cow(x1));
+            // TODO : perhaps some of the copy_on_write should be based on
+            // answer rather than x1 (more stringent?).  Many similar cases
+            pos1 = next_pos1;
+            if (pos1 == length1) break;
+        } else {  // s1 > s2
+            pos2 = ra_advance_until(&x2->high_low_container, s1, pos2);
+            if (pos2 == length2) break;
+        }
+    }
+    if (pos2 == length2) {
+        ra_append_copy_range(&answer->high_low_container,
+                             &x1->high_low_container, pos1, length1,
+                             is_cow(x1));
+    }
+    return answer;
+}
+
+// inplace andnot (modifies its first argument).
+
+void roaring_bitmap_andnot_inplace(roaring_bitmap_t *x1,
+                                   const roaring_bitmap_t *x2) {
+    assert(x1 != x2);
+
+    uint8_t result_type = 0;
+    int length1 = x1->high_low_container.size;
+    const int length2 = x2->high_low_container.size;
+    int intersection_size = 0;
+
+    if (0 == length2) return;
+
+    if (0 == length1) {
+        roaring_bitmap_clear(x1);
+        return;
+    }
+
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+
+            // We do the computation "in place" only when c1 is not a shared
+            // container. Rationale: using a shared container safely with in
+            // place computation would require making a copy and then doing the
+            // computation in place which is likely less efficient than avoiding
+            // in place entirely and always generating a new container.
+
+            container_t *c;
+            if (type1 == SHARED_CONTAINER_TYPE) {
+                c = container_andnot(c1, type1, c2, type2, &result_type);
+                shared_container_free(CAST_shared(c1));  // release
+            } else {
+                c = container_iandnot(c1, type1, c2, type2, &result_type);
+            }
+
+            if (container_nonzero_cardinality(c, result_type)) {
+                ra_replace_key_and_container_at_index(&x1->high_low_container,
+                                                      intersection_size++, s1,
+                                                      c, result_type);
+            } else {
+                container_free(c, result_type);
+            }
+
+            ++pos1;
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            if (pos1 != intersection_size) {
+                container_t *c1 = ra_get_container_at_index(
+                    &x1->high_low_container, (uint16_t)pos1, &type1);
+
+                ra_replace_key_and_container_at_index(
+                    &x1->high_low_container, intersection_size, s1, c1, type1);
+            }
+            intersection_size++;
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            pos2 = ra_advance_until(&x2->high_low_container, s1, pos2);
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+
+    if (pos1 < length1) {
+        // all containers between intersection_size and
+        // pos1 are junk.  However, they have either been moved
+        // (thus still referenced) or involved in an iandnot
+        // that will clean up all containers that could not be reused.
+        // Thus we should not free the junk containers between
+        // intersection_size and pos1.
+        if (pos1 > intersection_size) {
+            // left slide of remaining items
+            ra_copy_range(&x1->high_low_container, pos1, length1,
+                          intersection_size);
+        }
+        // else current placement is fine
+        intersection_size += (length1 - pos1);
+    }
+    ra_downsize(&x1->high_low_container, intersection_size);
+}
+
+uint64_t roaring_bitmap_get_cardinality(const roaring_bitmap_t *r) {
+    const roaring_array_t *ra = &r->high_low_container;
+
+    uint64_t card = 0;
+    for (int i = 0; i < ra->size; ++i)
+        card += container_get_cardinality(ra->containers[i], ra->typecodes[i]);
+    return card;
+}
+
+uint64_t roaring_bitmap_range_cardinality(const roaring_bitmap_t *r,
+                                          uint64_t range_start,
+                                          uint64_t range_end) {
+    const roaring_array_t *ra = &r->high_low_container;
+
+    if (range_end > UINT32_MAX) {
+        range_end = UINT32_MAX + UINT64_C(1);
+    }
+    if (range_start >= range_end) {
+        return 0;
+    }
+    range_end--;  // make range_end inclusive
+    // now we have: 0 <= range_start <= range_end <= UINT32_MAX
+
+    uint16_t minhb = (uint16_t)(range_start >> 16);
+    uint16_t maxhb = (uint16_t)(range_end >> 16);
+
+    uint64_t card = 0;
+
+    int i = ra_get_index(ra, minhb);
+    if (i >= 0) {
+        if (minhb == maxhb) {
+            card += container_rank(ra->containers[i], ra->typecodes[i],
+                                   range_end & 0xffff);
+        } else {
+            card +=
+                container_get_cardinality(ra->containers[i], ra->typecodes[i]);
+        }
+        if ((range_start & 0xffff) != 0) {
+            card -= container_rank(ra->containers[i], ra->typecodes[i],
+                                   (range_start & 0xffff) - 1);
+        }
+        i++;
+    } else {
+        i = -i - 1;
+    }
+
+    for (; i < ra->size; i++) {
+        uint16_t key = ra->keys[i];
+        if (key < maxhb) {
+            card +=
+                container_get_cardinality(ra->containers[i], ra->typecodes[i]);
+        } else if (key == maxhb) {
+            card += container_rank(ra->containers[i], ra->typecodes[i],
+                                   range_end & 0xffff);
+            break;
+        } else {
+            break;
+        }
+    }
+
+    return card;
+}
+
+bool roaring_bitmap_is_empty(const roaring_bitmap_t *r) {
+    return r->high_low_container.size == 0;
+}
+
+void roaring_bitmap_to_uint32_array(const roaring_bitmap_t *r, uint32_t *ans) {
+    ra_to_uint32_array(&r->high_low_container, ans);
+}
+
+bool roaring_bitmap_range_uint32_array(const roaring_bitmap_t *r, size_t offset,
+                                       size_t limit, uint32_t *ans) {
+    return ra_range_uint32_array(&r->high_low_container, offset, limit, ans);
+}
+
+/** convert array and bitmap containers to run containers when it is more
+ * efficient;
+ * also convert from run containers when more space efficient.  Returns
+ * true if the result has at least one run container.
+ */
+bool roaring_bitmap_run_optimize(roaring_bitmap_t *r) {
+    bool answer = false;
+    for (int i = 0; i < r->high_low_container.size; i++) {
+        uint8_t type_original, type_after;
+        ra_unshare_container_at_index(
+            &r->high_low_container,
+            (uint16_t)i);  // TODO: this introduces extra cloning!
+        container_t *c = ra_get_container_at_index(&r->high_low_container,
+                                                   (uint16_t)i, &type_original);
+        container_t *c1 = convert_run_optimize(c, type_original, &type_after);
+        if (type_after == RUN_CONTAINER_TYPE) {
+            answer = true;
+        }
+        ra_set_container_at_index(&r->high_low_container, i, c1, type_after);
+    }
+    return answer;
+}
+
+size_t roaring_bitmap_shrink_to_fit(roaring_bitmap_t *r) {
+    size_t answer = 0;
+    for (int i = 0; i < r->high_low_container.size; i++) {
+        uint8_t type_original;
+        container_t *c = ra_get_container_at_index(&r->high_low_container,
+                                                   (uint16_t)i, &type_original);
+        answer += container_shrink_to_fit(c, type_original);
+    }
+    answer += ra_shrink_to_fit(&r->high_low_container);
+    return answer;
+}
+
+/**
+ *  Remove run-length encoding even when it is more space efficient
+ *  return whether a change was applied
+ */
+bool roaring_bitmap_remove_run_compression(roaring_bitmap_t *r) {
+    bool answer = false;
+    for (int i = 0; i < r->high_low_container.size; i++) {
+        uint8_t type_original, type_after;
+        container_t *c = ra_get_container_at_index(&r->high_low_container,
+                                                   (uint16_t)i, &type_original);
+        if (get_container_type(c, type_original) == RUN_CONTAINER_TYPE) {
+            answer = true;
+            if (type_original == SHARED_CONTAINER_TYPE) {
+                run_container_t *truec = CAST_run(CAST_shared(c)->container);
+                int32_t card = run_container_cardinality(truec);
+                container_t *c1 = convert_to_bitset_or_array_container(
+                    truec, card, &type_after);
+                shared_container_free(CAST_shared(c));  // frees run as needed
+                ra_set_container_at_index(&r->high_low_container, i, c1,
+                                          type_after);
+
+            } else {
+                int32_t card = run_container_cardinality(CAST_run(c));
+                container_t *c1 = convert_to_bitset_or_array_container(
+                    CAST_run(c), card, &type_after);
+                run_container_free(CAST_run(c));
+                ra_set_container_at_index(&r->high_low_container, i, c1,
+                                          type_after);
+            }
+        }
+    }
+    return answer;
+}
+
+size_t roaring_bitmap_serialize(const roaring_bitmap_t *r, char *buf) {
+    size_t portablesize = roaring_bitmap_portable_size_in_bytes(r);
+    uint64_t cardinality = roaring_bitmap_get_cardinality(r);
+    uint64_t sizeasarray = cardinality * sizeof(uint32_t) + sizeof(uint32_t);
+    if (portablesize < sizeasarray) {
+        buf[0] = CROARING_SERIALIZATION_CONTAINER;
+        return roaring_bitmap_portable_serialize(r, buf + 1) + 1;
+    } else {
+        buf[0] = CROARING_SERIALIZATION_ARRAY_UINT32;
+        memcpy(buf + 1, &cardinality, sizeof(uint32_t));
+        roaring_bitmap_to_uint32_array(
+            r, (uint32_t *)(buf + 1 + sizeof(uint32_t)));
+        return 1 + (size_t)sizeasarray;
+    }
+}
+
+size_t roaring_bitmap_size_in_bytes(const roaring_bitmap_t *r) {
+    size_t portablesize = roaring_bitmap_portable_size_in_bytes(r);
+    uint64_t sizeasarray =
+        roaring_bitmap_get_cardinality(r) * sizeof(uint32_t) + sizeof(uint32_t);
+    return portablesize < sizeasarray ? portablesize + 1
+                                      : (size_t)sizeasarray + 1;
+}
+
+size_t roaring_bitmap_portable_size_in_bytes(const roaring_bitmap_t *r) {
+    return ra_portable_size_in_bytes(&r->high_low_container);
+}
+
+roaring_bitmap_t *roaring_bitmap_portable_deserialize_safe(const char *buf,
+                                                           size_t maxbytes) {
+    roaring_bitmap_t *ans =
+        (roaring_bitmap_t *)roaring_malloc(sizeof(roaring_bitmap_t));
+    if (ans == NULL) {
+        return NULL;
+    }
+    size_t bytesread;
+    bool is_ok = ra_portable_deserialize(&ans->high_low_container, buf,
+                                         maxbytes, &bytesread);
+    if (!is_ok) {
+        roaring_free(ans);
+        return NULL;
+    }
+    roaring_bitmap_set_copy_on_write(ans, false);
+    if (!is_ok) {
+        roaring_free(ans);
+        return NULL;
+    }
+    return ans;
+}
+
+roaring_bitmap_t *roaring_bitmap_portable_deserialize(const char *buf) {
+    return roaring_bitmap_portable_deserialize_safe(buf, SIZE_MAX);
+}
+
+size_t roaring_bitmap_portable_deserialize_size(const char *buf,
+                                                size_t maxbytes) {
+    return ra_portable_deserialize_size(buf, maxbytes);
+}
+
+size_t roaring_bitmap_portable_serialize(const roaring_bitmap_t *r, char *buf) {
+    return ra_portable_serialize(&r->high_low_container, buf);
+}
+
+roaring_bitmap_t *roaring_bitmap_deserialize(const void *buf) {
+    const char *bufaschar = (const char *)buf;
+    if (bufaschar[0] == CROARING_SERIALIZATION_ARRAY_UINT32) {
+        /* This looks like a compressed set of uint32_t elements */
+        uint32_t card;
+
+        memcpy(&card, bufaschar + 1, sizeof(uint32_t));
+
+        const uint32_t *elems =
+            (const uint32_t *)(bufaschar + 1 + sizeof(uint32_t));
+
+        roaring_bitmap_t *bitmap = roaring_bitmap_create();
+        if (bitmap == NULL) {
+            return NULL;
+        }
+        roaring_bulk_context_t context = CROARING_ZERO_INITIALIZER;
+        for (uint32_t i = 0; i < card; i++) {
+            // elems may not be aligned, read with memcpy
+            uint32_t elem;
+            memcpy(&elem, elems + i, sizeof(elem));
+            roaring_bitmap_add_bulk(bitmap, &context, elem);
+        }
+        return bitmap;
+
+    } else if (bufaschar[0] == CROARING_SERIALIZATION_CONTAINER) {
+        return roaring_bitmap_portable_deserialize(bufaschar + 1);
+    } else
+        return (NULL);
+}
+
+roaring_bitmap_t *roaring_bitmap_deserialize_safe(const void *buf,
+                                                  size_t maxbytes) {
+    if (maxbytes < 1) {
+        return NULL;
+    }
+
+    const char *bufaschar = (const char *)buf;
+    if (bufaschar[0] == CROARING_SERIALIZATION_ARRAY_UINT32) {
+        if (maxbytes < 1 + sizeof(uint32_t)) {
+            return NULL;
+        }
+
+        /* This looks like a compressed set of uint32_t elements */
+        uint32_t card;
+        memcpy(&card, bufaschar + 1, sizeof(uint32_t));
+
+        // Check the buffer is big enough to contain card uint32_t elements
+        if (maxbytes < 1 + sizeof(uint32_t) + card * sizeof(uint32_t)) {
+            return NULL;
+        }
+
+        const uint32_t *elems =
+            (const uint32_t *)(bufaschar + 1 + sizeof(uint32_t));
+
+        roaring_bitmap_t *bitmap = roaring_bitmap_create();
+        if (bitmap == NULL) {
+            return NULL;
+        }
+        roaring_bulk_context_t context = CROARING_ZERO_INITIALIZER;
+        for (uint32_t i = 0; i < card; i++) {
+            // elems may not be aligned, read with memcpy
+            uint32_t elem;
+            memcpy(&elem, elems + i, sizeof(elem));
+            roaring_bitmap_add_bulk(bitmap, &context, elem);
+        }
+        return bitmap;
+
+    } else if (bufaschar[0] == CROARING_SERIALIZATION_CONTAINER) {
+        return roaring_bitmap_portable_deserialize_safe(bufaschar + 1,
+                                                        maxbytes - 1);
+    } else
+        return (NULL);
+}
+
+bool roaring_iterate(const roaring_bitmap_t *r, roaring_iterator iterator,
+                     void *ptr) {
+    const roaring_array_t *ra = &r->high_low_container;
+
+    for (int i = 0; i < ra->size; ++i)
+        if (!container_iterate(ra->containers[i], ra->typecodes[i],
+                               ((uint32_t)ra->keys[i]) << 16, iterator, ptr)) {
+            return false;
+        }
+    return true;
+}
+
+bool roaring_iterate64(const roaring_bitmap_t *r, roaring_iterator64 iterator,
+                       uint64_t high_bits, void *ptr) {
+    const roaring_array_t *ra = &r->high_low_container;
+
+    for (int i = 0; i < ra->size; ++i)
+        if (!container_iterate64(ra->containers[i], ra->typecodes[i],
+                                 ((uint32_t)ra->keys[i]) << 16, iterator,
+                                 high_bits, ptr)) {
+            return false;
+        }
+    return true;
+}
+
+/****
+ * begin roaring_uint32_iterator_t
+ *****/
+
+/**
+ * Partially initializes the iterator. Leaves it in either state:
+ * 1. Invalid due to `has_value = false`, or
+ * 2. At a container, with the high bits set, `has_value = true`.
+ */
+CROARING_WARN_UNUSED static bool iter_new_container_partial_init(
+    roaring_uint32_iterator_t *newit) {
+    newit->current_value = 0;
+    if (newit->container_index >= newit->parent->high_low_container.size ||
+        newit->container_index < 0) {
+        newit->current_value = UINT32_MAX;
+        return (newit->has_value = false);
+    }
+    newit->has_value = true;
+    // we precompute container, typecode and highbits so that successive
+    // iterators do not have to grab them from odd memory locations
+    // and have to worry about the (easily predicted) container_unwrap_shared
+    // call.
+    newit->container =
+        newit->parent->high_low_container.containers[newit->container_index];
+    newit->typecode =
+        newit->parent->high_low_container.typecodes[newit->container_index];
+    newit->highbits =
+        ((uint32_t)
+             newit->parent->high_low_container.keys[newit->container_index])
+        << 16;
+    newit->container =
+        container_unwrap_shared(newit->container, &(newit->typecode));
+    return true;
+}
+
+/**
+ * Positions the iterator at the first value of the current container that the
+ * iterator points at, if available.
+ */
+CROARING_WARN_UNUSED static bool loadfirstvalue(
+    roaring_uint32_iterator_t *newit) {
+    if (iter_new_container_partial_init(newit)) {
+        uint16_t value = 0;
+        newit->container_it =
+            container_init_iterator(newit->container, newit->typecode, &value);
+        newit->current_value = newit->highbits | value;
+    }
+    return newit->has_value;
+}
+
+/**
+ * Positions the iterator at the last value of the current container that the
+ * iterator points at, if available.
+ */
+CROARING_WARN_UNUSED static bool loadlastvalue(
+    roaring_uint32_iterator_t *newit) {
+    if (iter_new_container_partial_init(newit)) {
+        uint16_t value = 0;
+        newit->container_it = container_init_iterator_last(
+            newit->container, newit->typecode, &value);
+        newit->current_value = newit->highbits | value;
+    }
+    return newit->has_value;
+}
+
+/**
+ * Positions the iterator at the smallest value that is larger than or equal to
+ * `val` within the current container that the iterator points at. Assumes such
+ * a value exists within the current container.
+ */
+CROARING_WARN_UNUSED static bool loadfirstvalue_largeorequal(
+    roaring_uint32_iterator_t *newit, uint32_t val) {
+    bool partial_init = iter_new_container_partial_init(newit);
+    assert(partial_init);
+    if (!partial_init) {
+        return false;
+    }
+    uint16_t value = 0;
+    newit->container_it =
+        container_init_iterator(newit->container, newit->typecode, &value);
+    bool found = container_iterator_lower_bound(
+        newit->container, newit->typecode, &newit->container_it, &value,
+        val & 0xFFFF);
+    assert(found);
+    if (!found) {
+        return false;
+    }
+    newit->current_value = newit->highbits | value;
+    return true;
+}
+
+void roaring_iterator_init(const roaring_bitmap_t *r,
+                           roaring_uint32_iterator_t *newit) {
+    newit->parent = r;
+    newit->container_index = 0;
+    newit->has_value = loadfirstvalue(newit);
+}
+
+void roaring_iterator_init_last(const roaring_bitmap_t *r,
+                                roaring_uint32_iterator_t *newit) {
+    newit->parent = r;
+    newit->container_index = newit->parent->high_low_container.size - 1;
+    newit->has_value = loadlastvalue(newit);
+}
+
+roaring_uint32_iterator_t *roaring_iterator_create(const roaring_bitmap_t *r) {
+    roaring_uint32_iterator_t *newit =
+        (roaring_uint32_iterator_t *)roaring_malloc(
+            sizeof(roaring_uint32_iterator_t));
+    if (newit == NULL) return NULL;
+    roaring_iterator_init(r, newit);
+    return newit;
+}
+
+roaring_uint32_iterator_t *roaring_uint32_iterator_copy(
+    const roaring_uint32_iterator_t *it) {
+    roaring_uint32_iterator_t *newit =
+        (roaring_uint32_iterator_t *)roaring_malloc(
+            sizeof(roaring_uint32_iterator_t));
+    memcpy(newit, it, sizeof(roaring_uint32_iterator_t));
+    return newit;
+}
+
+bool roaring_uint32_iterator_move_equalorlarger(roaring_uint32_iterator_t *it,
+                                                uint32_t val) {
+    uint16_t hb = val >> 16;
+    const int i = ra_get_index(&it->parent->high_low_container, hb);
+    if (i >= 0) {
+        uint32_t lowvalue =
+            container_maximum(it->parent->high_low_container.containers[i],
+                              it->parent->high_low_container.typecodes[i]);
+        uint16_t lb = val & 0xFFFF;
+        if (lowvalue < lb) {
+            // will have to load first value of next container
+            it->container_index = i + 1;
+        } else {
+            // the value is necessarily within the range of the container
+            it->container_index = i;
+            it->has_value = loadfirstvalue_largeorequal(it, val);
+            return it->has_value;
+        }
+    } else {
+        // there is no matching, so we are going for the next container
+        it->container_index = -i - 1;
+    }
+    it->has_value = loadfirstvalue(it);
+    return it->has_value;
+}
+
+bool roaring_uint32_iterator_advance(roaring_uint32_iterator_t *it) {
+    if (it->container_index >= it->parent->high_low_container.size) {
+        return (it->has_value = false);
+    }
+    if (it->container_index < 0) {
+        it->container_index = 0;
+        return (it->has_value = loadfirstvalue(it));
+    }
+    uint16_t low16 = (uint16_t)it->current_value;
+    if (container_iterator_next(it->container, it->typecode, &it->container_it,
+                                &low16)) {
+        it->current_value = it->highbits | low16;
+        return (it->has_value = true);
+    }
+    it->container_index++;
+    return (it->has_value = loadfirstvalue(it));
+}
+
+bool roaring_uint32_iterator_previous(roaring_uint32_iterator_t *it) {
+    if (it->container_index < 0) {
+        return (it->has_value = false);
+    }
+    if (it->container_index >= it->parent->high_low_container.size) {
+        it->container_index = it->parent->high_low_container.size - 1;
+        return (it->has_value = loadlastvalue(it));
+    }
+    uint16_t low16 = (uint16_t)it->current_value;
+    if (container_iterator_prev(it->container, it->typecode, &it->container_it,
+                                &low16)) {
+        it->current_value = it->highbits | low16;
+        return (it->has_value = true);
+    }
+    it->container_index--;
+    return (it->has_value = loadlastvalue(it));
+}
+
+uint32_t roaring_uint32_iterator_read(roaring_uint32_iterator_t *it,
+                                      uint32_t *buf, uint32_t count) {
+    uint32_t ret = 0;
+    while (it->has_value && ret < count) {
+        uint32_t consumed;
+        uint16_t low16 = (uint16_t)it->current_value;
+        bool has_value = container_iterator_read_into_uint32(
+            it->container, it->typecode, &it->container_it, it->highbits, buf,
+            count - ret, &consumed, &low16);
+        ret += consumed;
+        buf += consumed;
+        if (has_value) {
+            it->has_value = true;
+            it->current_value = it->highbits | low16;
+            assert(ret == count);
+            return ret;
+        }
+        it->container_index++;
+        it->has_value = loadfirstvalue(it);
+    }
+    return ret;
+}
+
+void roaring_uint32_iterator_free(roaring_uint32_iterator_t *it) {
+    roaring_free(it);
+}
+
+/****
+ * end of roaring_uint32_iterator_t
+ *****/
+
+bool roaring_bitmap_equals(const roaring_bitmap_t *r1,
+                           const roaring_bitmap_t *r2) {
+    const roaring_array_t *ra1 = &r1->high_low_container;
+    const roaring_array_t *ra2 = &r2->high_low_container;
+
+    if (ra1->size != ra2->size) {
+        return false;
+    }
+    for (int i = 0; i < ra1->size; ++i) {
+        if (ra1->keys[i] != ra2->keys[i]) {
+            return false;
+        }
+    }
+    for (int i = 0; i < ra1->size; ++i) {
+        bool areequal = container_equals(ra1->containers[i], ra1->typecodes[i],
+                                         ra2->containers[i], ra2->typecodes[i]);
+        if (!areequal) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool roaring_bitmap_is_subset(const roaring_bitmap_t *r1,
+                              const roaring_bitmap_t *r2) {
+    const roaring_array_t *ra1 = &r1->high_low_container;
+    const roaring_array_t *ra2 = &r2->high_low_container;
+
+    const int length1 = ra1->size, length2 = ra2->size;
+
+    int pos1 = 0, pos2 = 0;
+
+    while (pos1 < length1 && pos2 < length2) {
+        const uint16_t s1 = ra_get_key_at_index(ra1, (uint16_t)pos1);
+        const uint16_t s2 = ra_get_key_at_index(ra2, (uint16_t)pos2);
+
+        if (s1 == s2) {
+            uint8_t type1, type2;
+            container_t *c1 =
+                ra_get_container_at_index(ra1, (uint16_t)pos1, &type1);
+            container_t *c2 =
+                ra_get_container_at_index(ra2, (uint16_t)pos2, &type2);
+            if (!container_is_subset(c1, type1, c2, type2)) return false;
+            ++pos1;
+            ++pos2;
+        } else if (s1 < s2) {  // s1 < s2
+            return false;
+        } else {  // s1 > s2
+            pos2 = ra_advance_until(ra2, s1, pos2);
+        }
+    }
+    if (pos1 == length1)
+        return true;
+    else
+        return false;
+}
+
+static void insert_flipped_container(roaring_array_t *ans_arr,
+                                     const roaring_array_t *x1_arr, uint16_t hb,
+                                     uint16_t lb_start, uint16_t lb_end) {
+    const int i = ra_get_index(x1_arr, hb);
+    const int j = ra_get_index(ans_arr, hb);
+    uint8_t ctype_in, ctype_out;
+    container_t *flipped_container = NULL;
+    if (i >= 0) {
+        container_t *container_to_flip =
+            ra_get_container_at_index(x1_arr, (uint16_t)i, &ctype_in);
+        flipped_container =
+            container_not_range(container_to_flip, ctype_in, (uint32_t)lb_start,
+                                (uint32_t)(lb_end + 1), &ctype_out);
+
+        if (container_get_cardinality(flipped_container, ctype_out))
+            ra_insert_new_key_value_at(ans_arr, -j - 1, hb, flipped_container,
+                                       ctype_out);
+        else {
+            container_free(flipped_container, ctype_out);
+        }
+    } else {
+        flipped_container = container_range_of_ones(
+            (uint32_t)lb_start, (uint32_t)(lb_end + 1), &ctype_out);
+        ra_insert_new_key_value_at(ans_arr, -j - 1, hb, flipped_container,
+                                   ctype_out);
+    }
+}
+
+static void inplace_flip_container(roaring_array_t *x1_arr, uint16_t hb,
+                                   uint16_t lb_start, uint16_t lb_end) {
+    const int i = ra_get_index(x1_arr, hb);
+    uint8_t ctype_in, ctype_out;
+    container_t *flipped_container = NULL;
+    if (i >= 0) {
+        container_t *container_to_flip =
+            ra_get_container_at_index(x1_arr, (uint16_t)i, &ctype_in);
+        flipped_container = container_inot_range(
+            container_to_flip, ctype_in, (uint32_t)lb_start,
+            (uint32_t)(lb_end + 1), &ctype_out);
+        // if a new container was created, the old one was already freed
+        if (container_get_cardinality(flipped_container, ctype_out)) {
+            ra_set_container_at_index(x1_arr, i, flipped_container, ctype_out);
+        } else {
+            container_free(flipped_container, ctype_out);
+            ra_remove_at_index(x1_arr, i);
+        }
+
+    } else {
+        flipped_container = container_range_of_ones(
+            (uint32_t)lb_start, (uint32_t)(lb_end + 1), &ctype_out);
+        ra_insert_new_key_value_at(x1_arr, -i - 1, hb, flipped_container,
+                                   ctype_out);
+    }
+}
+
+static void insert_fully_flipped_container(roaring_array_t *ans_arr,
+                                           const roaring_array_t *x1_arr,
+                                           uint16_t hb) {
+    const int i = ra_get_index(x1_arr, hb);
+    const int j = ra_get_index(ans_arr, hb);
+    uint8_t ctype_in, ctype_out;
+    container_t *flipped_container = NULL;
+    if (i >= 0) {
+        container_t *container_to_flip =
+            ra_get_container_at_index(x1_arr, (uint16_t)i, &ctype_in);
+        flipped_container =
+            container_not(container_to_flip, ctype_in, &ctype_out);
+        if (container_get_cardinality(flipped_container, ctype_out))
+            ra_insert_new_key_value_at(ans_arr, -j - 1, hb, flipped_container,
+                                       ctype_out);
+        else {
+            container_free(flipped_container, ctype_out);
+        }
+    } else {
+        flipped_container = container_range_of_ones(0U, 0x10000U, &ctype_out);
+        ra_insert_new_key_value_at(ans_arr, -j - 1, hb, flipped_container,
+                                   ctype_out);
+    }
+}
+
+static void inplace_fully_flip_container(roaring_array_t *x1_arr, uint16_t hb) {
+    const int i = ra_get_index(x1_arr, hb);
+    uint8_t ctype_in, ctype_out;
+    container_t *flipped_container = NULL;
+    if (i >= 0) {
+        container_t *container_to_flip =
+            ra_get_container_at_index(x1_arr, (uint16_t)i, &ctype_in);
+        flipped_container =
+            container_inot(container_to_flip, ctype_in, &ctype_out);
+
+        if (container_get_cardinality(flipped_container, ctype_out)) {
+            ra_set_container_at_index(x1_arr, i, flipped_container, ctype_out);
+        } else {
+            container_free(flipped_container, ctype_out);
+            ra_remove_at_index(x1_arr, i);
+        }
+
+    } else {
+        flipped_container = container_range_of_ones(0U, 0x10000U, &ctype_out);
+        ra_insert_new_key_value_at(x1_arr, -i - 1, hb, flipped_container,
+                                   ctype_out);
+    }
+}
+
+roaring_bitmap_t *roaring_bitmap_flip(const roaring_bitmap_t *x1,
+                                      uint64_t range_start,
+                                      uint64_t range_end) {
+    if (range_start >= range_end) {
+        return roaring_bitmap_copy(x1);
+    }
+    if (range_end >= UINT64_C(0x100000000)) {
+        range_end = UINT64_C(0x100000000);
+    }
+
+    roaring_bitmap_t *ans = roaring_bitmap_create();
+    roaring_bitmap_set_copy_on_write(ans, is_cow(x1));
+
+    uint16_t hb_start = (uint16_t)(range_start >> 16);
+    const uint16_t lb_start = (uint16_t)range_start;  // & 0xFFFF;
+    uint16_t hb_end = (uint16_t)((range_end - 1) >> 16);
+    const uint16_t lb_end = (uint16_t)(range_end - 1);  // & 0xFFFF;
+
+    ra_append_copies_until(&ans->high_low_container, &x1->high_low_container,
+                           hb_start, is_cow(x1));
+    if (hb_start == hb_end) {
+        insert_flipped_container(&ans->high_low_container,
+                                 &x1->high_low_container, hb_start, lb_start,
+                                 lb_end);
+    } else {
+        // start and end containers are distinct
+        if (lb_start > 0) {
+            // handle first (partial) container
+            insert_flipped_container(&ans->high_low_container,
+                                     &x1->high_low_container, hb_start,
+                                     lb_start, 0xFFFF);
+            ++hb_start;  // for the full containers.  Can't wrap.
+        }
+
+        if (lb_end != 0xFFFF) --hb_end;  // later we'll handle the partial block
+
+        for (uint32_t hb = hb_start; hb <= hb_end; ++hb) {
+            insert_fully_flipped_container(&ans->high_low_container,
+                                           &x1->high_low_container,
+                                           (uint16_t)hb);
+        }
+
+        // handle a partial final container
+        if (lb_end != 0xFFFF) {
+            insert_flipped_container(&ans->high_low_container,
+                                     &x1->high_low_container, hb_end + 1, 0,
+                                     lb_end);
+            ++hb_end;
+        }
+    }
+    ra_append_copies_after(&ans->high_low_container, &x1->high_low_container,
+                           hb_end, is_cow(x1));
+    return ans;
+}
+
+void roaring_bitmap_flip_inplace(roaring_bitmap_t *x1, uint64_t range_start,
+                                 uint64_t range_end) {
+    if (range_start >= range_end) {
+        return;  // empty range
+    }
+    if (range_end >= UINT64_C(0x100000000)) {
+        range_end = UINT64_C(0x100000000);
+    }
+
+    uint16_t hb_start = (uint16_t)(range_start >> 16);
+    const uint16_t lb_start = (uint16_t)range_start;
+    uint16_t hb_end = (uint16_t)((range_end - 1) >> 16);
+    const uint16_t lb_end = (uint16_t)(range_end - 1);
+
+    if (hb_start == hb_end) {
+        inplace_flip_container(&x1->high_low_container, hb_start, lb_start,
+                               lb_end);
+    } else {
+        // start and end containers are distinct
+        if (lb_start > 0) {
+            // handle first (partial) container
+            inplace_flip_container(&x1->high_low_container, hb_start, lb_start,
+                                   0xFFFF);
+            ++hb_start;  // for the full containers.  Can't wrap.
+        }
+
+        if (lb_end != 0xFFFF) --hb_end;
+
+        for (uint32_t hb = hb_start; hb <= hb_end; ++hb) {
+            inplace_fully_flip_container(&x1->high_low_container, (uint16_t)hb);
+        }
+        // handle a partial final container
+        if (lb_end != 0xFFFF) {
+            inplace_flip_container(&x1->high_low_container, hb_end + 1, 0,
+                                   lb_end);
+            ++hb_end;
+        }
+    }
+}
+
+static void offset_append_with_merge(roaring_array_t *ra, int k, container_t *c,
+                                     uint8_t t) {
+    int size = ra_get_size(ra);
+    if (size == 0 || ra_get_key_at_index(ra, (uint16_t)(size - 1)) != k) {
+        // No merge.
+        ra_append(ra, (uint16_t)k, c, t);
+        return;
+    }
+
+    uint8_t last_t, new_t;
+    container_t *last_c, *new_c;
+
+    // NOTE: we don't need to unwrap here, since we added last_c ourselves
+    // we have the certainty it's not a shared container.
+    // The same applies to c, as it's the result of calling container_offset.
+    last_c = ra_get_container_at_index(ra, (uint16_t)(size - 1), &last_t);
+    new_c = container_ior(last_c, last_t, c, t, &new_t);
+
+    ra_set_container_at_index(ra, size - 1, new_c, new_t);
+
+    // Comparison of pointers of different origin is UB (or so claim some
+    // compiler makers), so we compare their bit representation only.
+    if ((uintptr_t)last_c != (uintptr_t)new_c) {
+        container_free(last_c, last_t);
+    }
+    container_free(c, t);
+}
+
+// roaring_bitmap_add_offset adds the value 'offset' to each and every value in
+// a bitmap, generating a new bitmap in the process. If offset + element is
+// outside of the range [0,2^32), that the element will be dropped.
+// We need "offset" to be 64 bits because we want to support values
+// between -0xFFFFFFFF up to +0xFFFFFFFF.
+roaring_bitmap_t *roaring_bitmap_add_offset(const roaring_bitmap_t *bm,
+                                            int64_t offset) {
+    roaring_bitmap_t *answer;
+    roaring_array_t *ans_ra;
+    int64_t container_offset;
+    uint16_t in_offset;
+
+    const roaring_array_t *bm_ra = &bm->high_low_container;
+    int length = bm_ra->size;
+
+    if (offset == 0) {
+        return roaring_bitmap_copy(bm);
+    }
+
+    container_offset = offset >> 16;
+    in_offset = (uint16_t)(offset - container_offset * (1 << 16));
+
+    answer = roaring_bitmap_create();
+    bool cow = is_cow(bm);
+    roaring_bitmap_set_copy_on_write(answer, cow);
+
+    ans_ra = &answer->high_low_container;
+
+    if (in_offset == 0) {
+        ans_ra = &answer->high_low_container;
+
+        for (int i = 0, j = 0; i < length; ++i) {
+            int64_t key = ra_get_key_at_index(bm_ra, (uint16_t)i);
+            key += container_offset;
+
+            if (key < 0 || key >= (1 << 16)) {
+                continue;
+            }
+            ra_append_copy(ans_ra, bm_ra, (uint16_t)i, cow);
+            ans_ra->keys[j++] = (uint16_t)key;
+        }
+        return answer;
+    }
+
+    uint8_t t;
+    const container_t *c;
+    container_t *lo, *hi, **lo_ptr, **hi_ptr;
+    int64_t k;
+
+    for (int i = 0; i < length; ++i) {
+        lo = hi = NULL;
+        lo_ptr = hi_ptr = NULL;
+
+        k = ra_get_key_at_index(bm_ra, (uint16_t)i) + container_offset;
+        if (k >= 0 && k < (1 << 16)) {
+            lo_ptr = &lo;
+        }
+        if (k + 1 >= 0 && k + 1 < (1 << 16)) {
+            hi_ptr = &hi;
+        }
+        if (lo_ptr == NULL && hi_ptr == NULL) {
+            continue;
+        }
+        c = ra_get_container_at_index(bm_ra, (uint16_t)i, &t);
+        c = container_unwrap_shared(c, &t);
+
+        container_add_offset(c, t, lo_ptr, hi_ptr, in_offset);
+        if (lo != NULL) {
+            offset_append_with_merge(ans_ra, (int)k, lo, t);
+        }
+        if (hi != NULL) {
+            ra_append(ans_ra, (uint16_t)(k + 1), hi, t);
+        }
+        // the `lo` and `hi` container type always keep same as container `c`.
+        // in the case of `container_add_offset` on bitset container, `lo` and
+        // `hi` may has small cardinality, they must be repaired to array
+        // container.
+    }
+
+    roaring_bitmap_repair_after_lazy(answer);  // do required type conversions.
+    return answer;
+}
+
+roaring_bitmap_t *roaring_bitmap_lazy_or(const roaring_bitmap_t *x1,
+                                         const roaring_bitmap_t *x2,
+                                         const bool bitsetconversion) {
+    uint8_t result_type = 0;
+    const int length1 = x1->high_low_container.size,
+              length2 = x2->high_low_container.size;
+    if (0 == length1) {
+        return roaring_bitmap_copy(x2);
+    }
+    if (0 == length2) {
+        return roaring_bitmap_copy(x1);
+    }
+    roaring_bitmap_t *answer =
+        roaring_bitmap_create_with_capacity(length1 + length2);
+    roaring_bitmap_set_copy_on_write(answer, is_cow(x1) || is_cow(x2));
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            container_t *c;
+            if (bitsetconversion &&
+                (get_container_type(c1, type1) != BITSET_CONTAINER_TYPE) &&
+                (get_container_type(c2, type2) != BITSET_CONTAINER_TYPE)) {
+                container_t *newc1 =
+                    container_mutable_unwrap_shared(c1, &type1);
+                newc1 = container_to_bitset(newc1, type1);
+                type1 = BITSET_CONTAINER_TYPE;
+                c = container_lazy_ior(newc1, type1, c2, type2, &result_type);
+                if (c != newc1) {  // should not happen
+                    container_free(newc1, type1);
+                }
+            } else {
+                c = container_lazy_or(c1, type1, c2, type2, &result_type);
+            }
+            // since we assume that the initial containers are non-empty,
+            // the
+            // result here
+            // can only be non-empty
+            ra_append(&answer->high_low_container, s1, c, result_type);
+            ++pos1;
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            c1 = get_copy_of_container(c1, &type1, is_cow(x1));
+            if (is_cow(x1)) {
+                ra_set_container_at_index(&x1->high_low_container, pos1, c1,
+                                          type1);
+            }
+            ra_append(&answer->high_low_container, s1, c1, type1);
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            c2 = get_copy_of_container(c2, &type2, is_cow(x2));
+            if (is_cow(x2)) {
+                ra_set_container_at_index(&x2->high_low_container, pos2, c2,
+                                          type2);
+            }
+            ra_append(&answer->high_low_container, s2, c2, type2);
+            pos2++;
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+    if (pos1 == length1) {
+        ra_append_copy_range(&answer->high_low_container,
+                             &x2->high_low_container, pos2, length2,
+                             is_cow(x2));
+    } else if (pos2 == length2) {
+        ra_append_copy_range(&answer->high_low_container,
+                             &x1->high_low_container, pos1, length1,
+                             is_cow(x1));
+    }
+    return answer;
+}
+
+void roaring_bitmap_lazy_or_inplace(roaring_bitmap_t *x1,
+                                    const roaring_bitmap_t *x2,
+                                    const bool bitsetconversion) {
+    uint8_t result_type = 0;
+    int length1 = x1->high_low_container.size;
+    const int length2 = x2->high_low_container.size;
+
+    if (0 == length2) return;
+
+    if (0 == length1) {
+        roaring_bitmap_overwrite(x1, x2);
+        return;
+    }
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            if (!container_is_full(c1, type1)) {
+                if ((bitsetconversion == false) ||
+                    (get_container_type(c1, type1) == BITSET_CONTAINER_TYPE)) {
+                    c1 = get_writable_copy_if_shared(c1, &type1);
+                } else {
+                    // convert to bitset
+                    container_t *old_c1 = c1;
+                    uint8_t old_type1 = type1;
+                    c1 = container_mutable_unwrap_shared(c1, &type1);
+                    c1 = container_to_bitset(c1, type1);
+                    container_free(old_c1, old_type1);
+                    type1 = BITSET_CONTAINER_TYPE;
+                }
+
+                container_t *c2 = ra_get_container_at_index(
+                    &x2->high_low_container, (uint16_t)pos2, &type2);
+                container_t *c =
+                    container_lazy_ior(c1, type1, c2, type2, &result_type);
+
+                if (c != c1) {  // in this instance a new container was created,
+                                // and we need to free the old one
+                    container_free(c1, type1);
+                }
+
+                ra_set_container_at_index(&x1->high_low_container, pos1, c,
+                                          result_type);
+            }
+            ++pos1;
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            // container_t *c2_clone = container_clone(c2, type2);
+            c2 = get_copy_of_container(c2, &type2, is_cow(x2));
+            if (is_cow(x2)) {
+                ra_set_container_at_index(&x2->high_low_container, pos2, c2,
+                                          type2);
+            }
+            ra_insert_new_key_value_at(&x1->high_low_container, pos1, s2, c2,
+                                       type2);
+            pos1++;
+            length1++;
+            pos2++;
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+    if (pos1 == length1) {
+        ra_append_copy_range(&x1->high_low_container, &x2->high_low_container,
+                             pos2, length2, is_cow(x2));
+    }
+}
+
+roaring_bitmap_t *roaring_bitmap_lazy_xor(const roaring_bitmap_t *x1,
+                                          const roaring_bitmap_t *x2) {
+    uint8_t result_type = 0;
+    const int length1 = x1->high_low_container.size,
+              length2 = x2->high_low_container.size;
+    if (0 == length1) {
+        return roaring_bitmap_copy(x2);
+    }
+    if (0 == length2) {
+        return roaring_bitmap_copy(x1);
+    }
+    roaring_bitmap_t *answer =
+        roaring_bitmap_create_with_capacity(length1 + length2);
+    roaring_bitmap_set_copy_on_write(answer, is_cow(x1) || is_cow(x2));
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            container_t *c =
+                container_lazy_xor(c1, type1, c2, type2, &result_type);
+
+            if (container_nonzero_cardinality(c, result_type)) {
+                ra_append(&answer->high_low_container, s1, c, result_type);
+            } else {
+                container_free(c, result_type);
+            }
+
+            ++pos1;
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            c1 = get_copy_of_container(c1, &type1, is_cow(x1));
+            if (is_cow(x1)) {
+                ra_set_container_at_index(&x1->high_low_container, pos1, c1,
+                                          type1);
+            }
+            ra_append(&answer->high_low_container, s1, c1, type1);
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            c2 = get_copy_of_container(c2, &type2, is_cow(x2));
+            if (is_cow(x2)) {
+                ra_set_container_at_index(&x2->high_low_container, pos2, c2,
+                                          type2);
+            }
+            ra_append(&answer->high_low_container, s2, c2, type2);
+            pos2++;
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+    if (pos1 == length1) {
+        ra_append_copy_range(&answer->high_low_container,
+                             &x2->high_low_container, pos2, length2,
+                             is_cow(x2));
+    } else if (pos2 == length2) {
+        ra_append_copy_range(&answer->high_low_container,
+                             &x1->high_low_container, pos1, length1,
+                             is_cow(x1));
+    }
+    return answer;
+}
+
+void roaring_bitmap_lazy_xor_inplace(roaring_bitmap_t *x1,
+                                     const roaring_bitmap_t *x2) {
+    assert(x1 != x2);
+    uint8_t result_type = 0;
+    int length1 = x1->high_low_container.size;
+    const int length2 = x2->high_low_container.size;
+
+    if (0 == length2) return;
+
+    if (0 == length1) {
+        roaring_bitmap_overwrite(x1, x2);
+        return;
+    }
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+
+            // We do the computation "in place" only when c1 is not a shared
+            // container. Rationale: using a shared container safely with in
+            // place computation would require making a copy and then doing the
+            // computation in place which is likely less efficient than avoiding
+            // in place entirely and always generating a new container.
+
+            container_t *c;
+            if (type1 == SHARED_CONTAINER_TYPE) {
+                c = container_lazy_xor(c1, type1, c2, type2, &result_type);
+                shared_container_free(CAST_shared(c1));  // release
+            } else {
+                c = container_lazy_ixor(c1, type1, c2, type2, &result_type);
+            }
+
+            if (container_nonzero_cardinality(c, result_type)) {
+                ra_set_container_at_index(&x1->high_low_container, pos1, c,
+                                          result_type);
+                ++pos1;
+            } else {
+                container_free(c, result_type);
+                ra_remove_at_index(&x1->high_low_container, pos1);
+                --length1;
+            }
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            // container_t *c2_clone = container_clone(c2, type2);
+            c2 = get_copy_of_container(c2, &type2, is_cow(x2));
+            if (is_cow(x2)) {
+                ra_set_container_at_index(&x2->high_low_container, pos2, c2,
+                                          type2);
+            }
+            ra_insert_new_key_value_at(&x1->high_low_container, pos1, s2, c2,
+                                       type2);
+            pos1++;
+            length1++;
+            pos2++;
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+    if (pos1 == length1) {
+        ra_append_copy_range(&x1->high_low_container, &x2->high_low_container,
+                             pos2, length2, is_cow(x2));
+    }
+}
+
+void roaring_bitmap_repair_after_lazy(roaring_bitmap_t *r) {
+    roaring_array_t *ra = &r->high_low_container;
+
+    for (int i = 0; i < ra->size; ++i) {
+        const uint8_t old_type = ra->typecodes[i];
+        container_t *old_c = ra->containers[i];
+        uint8_t new_type = old_type;
+        container_t *new_c = container_repair_after_lazy(old_c, &new_type);
+        ra->containers[i] = new_c;
+        ra->typecodes[i] = new_type;
+    }
+}
+
+/**
+ * roaring_bitmap_rank returns the number of integers that are smaller or equal
+ * to x.
+ */
+uint64_t roaring_bitmap_rank(const roaring_bitmap_t *bm, uint32_t x) {
+    uint64_t size = 0;
+    uint32_t xhigh = x >> 16;
+    for (int i = 0; i < bm->high_low_container.size; i++) {
+        uint32_t key = bm->high_low_container.keys[i];
+        if (xhigh > key) {
+            size +=
+                container_get_cardinality(bm->high_low_container.containers[i],
+                                          bm->high_low_container.typecodes[i]);
+        } else if (xhigh == key) {
+            return size + container_rank(bm->high_low_container.containers[i],
+                                         bm->high_low_container.typecodes[i],
+                                         x & 0xFFFF);
+        } else {
+            return size;
+        }
+    }
+    return size;
+}
+void roaring_bitmap_rank_many(const roaring_bitmap_t *bm, const uint32_t *begin,
+                              const uint32_t *end, uint64_t *ans) {
+    uint64_t size = 0;
+
+    int i = 0;
+    const uint32_t *iter = begin;
+    while (i < bm->high_low_container.size && iter != end) {
+        uint32_t x = *iter;
+        uint32_t xhigh = x >> 16;
+        uint32_t key = bm->high_low_container.keys[i];
+        if (xhigh > key) {
+            size +=
+                container_get_cardinality(bm->high_low_container.containers[i],
+                                          bm->high_low_container.typecodes[i]);
+            i++;
+        } else if (xhigh == key) {
+            uint32_t consumed = container_rank_many(
+                bm->high_low_container.containers[i],
+                bm->high_low_container.typecodes[i], size, iter, end, ans);
+            iter += consumed;
+            ans += consumed;
+        } else {
+            *(ans++) = size;
+            iter++;
+        }
+    }
+}
+
+/**
+ * roaring_bitmap_get_index returns the index of x, if not exsist return -1.
+ */
+int64_t roaring_bitmap_get_index(const roaring_bitmap_t *bm, uint32_t x) {
+    int64_t index = 0;
+    const uint16_t xhigh = x >> 16;
+    int32_t high_idx = ra_get_index(&bm->high_low_container, xhigh);
+    if (high_idx < 0) return -1;
+
+    for (int i = 0; i < bm->high_low_container.size; i++) {
+        uint32_t key = bm->high_low_container.keys[i];
+        if (xhigh > key) {
+            index +=
+                container_get_cardinality(bm->high_low_container.containers[i],
+                                          bm->high_low_container.typecodes[i]);
+        } else if (xhigh == key) {
+            int32_t low_idx = container_get_index(
+                bm->high_low_container.containers[high_idx],
+                bm->high_low_container.typecodes[high_idx], x & 0xFFFF);
+            if (low_idx < 0) return -1;
+            return index + low_idx;
+        } else {
+            return -1;
+        }
+    }
+    return index;
+}
+
+/**
+ * roaring_bitmap_smallest returns the smallest value in the set.
+ * Returns UINT32_MAX if the set is empty.
+ */
+uint32_t roaring_bitmap_minimum(const roaring_bitmap_t *bm) {
+    if (bm->high_low_container.size > 0) {
+        container_t *c = bm->high_low_container.containers[0];
+        uint8_t type = bm->high_low_container.typecodes[0];
+        uint32_t key = bm->high_low_container.keys[0];
+        uint32_t lowvalue = container_minimum(c, type);
+        return lowvalue | (key << 16);
+    }
+    return UINT32_MAX;
+}
+
+/**
+ * roaring_bitmap_smallest returns the greatest value in the set.
+ * Returns 0 if the set is empty.
+ */
+uint32_t roaring_bitmap_maximum(const roaring_bitmap_t *bm) {
+    if (bm->high_low_container.size > 0) {
+        container_t *container =
+            bm->high_low_container.containers[bm->high_low_container.size - 1];
+        uint8_t typecode =
+            bm->high_low_container.typecodes[bm->high_low_container.size - 1];
+        uint32_t key =
+            bm->high_low_container.keys[bm->high_low_container.size - 1];
+        uint32_t lowvalue = container_maximum(container, typecode);
+        return lowvalue | (key << 16);
+    }
+    return 0;
+}
+
+bool roaring_bitmap_select(const roaring_bitmap_t *bm, uint32_t rank,
+                           uint32_t *element) {
+    container_t *container;
+    uint8_t typecode;
+    uint16_t key;
+    uint32_t start_rank = 0;
+    int i = 0;
+    bool valid = false;
+    while (!valid && i < bm->high_low_container.size) {
+        container = bm->high_low_container.containers[i];
+        typecode = bm->high_low_container.typecodes[i];
+        valid =
+            container_select(container, typecode, &start_rank, rank, element);
+        i++;
+    }
+
+    if (valid) {
+        key = bm->high_low_container.keys[i - 1];
+        *element |= (((uint32_t)key) << 16);  // w/o cast, key promotes signed
+        return true;
+    } else
+        return false;
+}
+
+bool roaring_bitmap_intersect(const roaring_bitmap_t *x1,
+                              const roaring_bitmap_t *x2) {
+    const int length1 = x1->high_low_container.size,
+              length2 = x2->high_low_container.size;
+    uint64_t answer = 0;
+    int pos1 = 0, pos2 = 0;
+
+    while (pos1 < length1 && pos2 < length2) {
+        const uint16_t s1 =
+            ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+        const uint16_t s2 =
+            ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        if (s1 == s2) {
+            uint8_t type1, type2;
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            if (container_intersect(c1, type1, c2, type2)) return true;
+            ++pos1;
+            ++pos2;
+        } else if (s1 < s2) {  // s1 < s2
+            pos1 = ra_advance_until(&x1->high_low_container, s2, pos1);
+        } else {  // s1 > s2
+            pos2 = ra_advance_until(&x2->high_low_container, s1, pos2);
+        }
+    }
+    return answer != 0;
+}
+
+bool roaring_bitmap_intersect_with_range(const roaring_bitmap_t *bm, uint64_t x,
+                                         uint64_t y) {
+    if (x >= y) {
+        // Empty range.
+        return false;
+    }
+    roaring_uint32_iterator_t it;
+    roaring_iterator_init(bm, &it);
+    if (!roaring_uint32_iterator_move_equalorlarger(&it, (uint32_t)x)) {
+        // No values above x.
+        return false;
+    }
+    if (it.current_value >= y) {
+        // No values below y.
+        return false;
+    }
+    return true;
+}
+
+uint64_t roaring_bitmap_and_cardinality(const roaring_bitmap_t *x1,
+                                        const roaring_bitmap_t *x2) {
+    const int length1 = x1->high_low_container.size,
+              length2 = x2->high_low_container.size;
+    uint64_t answer = 0;
+    int pos1 = 0, pos2 = 0;
+    while (pos1 < length1 && pos2 < length2) {
+        const uint16_t s1 =
+            ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+        const uint16_t s2 =
+            ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        if (s1 == s2) {
+            uint8_t type1, type2;
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            answer += container_and_cardinality(c1, type1, c2, type2);
+            ++pos1;
+            ++pos2;
+        } else if (s1 < s2) {  // s1 < s2
+            pos1 = ra_advance_until(&x1->high_low_container, s2, pos1);
+        } else {  // s1 > s2
+            pos2 = ra_advance_until(&x2->high_low_container, s1, pos2);
+        }
+    }
+    return answer;
+}
+
+double roaring_bitmap_jaccard_index(const roaring_bitmap_t *x1,
+                                    const roaring_bitmap_t *x2) {
+    const uint64_t c1 = roaring_bitmap_get_cardinality(x1);
+    const uint64_t c2 = roaring_bitmap_get_cardinality(x2);
+    const uint64_t inter = roaring_bitmap_and_cardinality(x1, x2);
+    return (double)inter / (double)(c1 + c2 - inter);
+}
+
+uint64_t roaring_bitmap_or_cardinality(const roaring_bitmap_t *x1,
+                                       const roaring_bitmap_t *x2) {
+    const uint64_t c1 = roaring_bitmap_get_cardinality(x1);
+    const uint64_t c2 = roaring_bitmap_get_cardinality(x2);
+    const uint64_t inter = roaring_bitmap_and_cardinality(x1, x2);
+    return c1 + c2 - inter;
+}
+
+uint64_t roaring_bitmap_andnot_cardinality(const roaring_bitmap_t *x1,
+                                           const roaring_bitmap_t *x2) {
+    const uint64_t c1 = roaring_bitmap_get_cardinality(x1);
+    const uint64_t inter = roaring_bitmap_and_cardinality(x1, x2);
+    return c1 - inter;
+}
+
+uint64_t roaring_bitmap_xor_cardinality(const roaring_bitmap_t *x1,
+                                        const roaring_bitmap_t *x2) {
+    const uint64_t c1 = roaring_bitmap_get_cardinality(x1);
+    const uint64_t c2 = roaring_bitmap_get_cardinality(x2);
+    const uint64_t inter = roaring_bitmap_and_cardinality(x1, x2);
+    return c1 + c2 - 2 * inter;
+}
+
+bool roaring_bitmap_contains(const roaring_bitmap_t *r, uint32_t val) {
+    const uint16_t hb = val >> 16;
+    /*
+     * the next function call involves a binary search and lots of branching.
+     */
+    int32_t i = ra_get_index(&r->high_low_container, hb);
+    if (i < 0) return false;
+
+    uint8_t typecode;
+    // next call ought to be cheap
+    container_t *container = ra_get_container_at_index(&r->high_low_container,
+                                                       (uint16_t)i, &typecode);
+    // rest might be a tad expensive, possibly involving another round of binary
+    // search
+    return container_contains(container, val & 0xFFFF, typecode);
+}
+
+/**
+ * Check whether a range of values from range_start (included) to range_end
+ * (excluded) is present
+ */
+bool roaring_bitmap_contains_range(const roaring_bitmap_t *r,
+                                   uint64_t range_start, uint64_t range_end) {
+    if (range_end >= UINT64_C(0x100000000)) {
+        range_end = UINT64_C(0x100000000);
+    }
+    if (range_start >= range_end)
+        return true;  // empty range are always contained!
+    if (range_end - range_start == 1)
+        return roaring_bitmap_contains(r, (uint32_t)range_start);
+    uint16_t hb_rs = (uint16_t)(range_start >> 16);
+    uint16_t hb_re = (uint16_t)((range_end - 1) >> 16);
+    const int32_t span = hb_re - hb_rs;
+    const int32_t hlc_sz = ra_get_size(&r->high_low_container);
+    if (hlc_sz < span + 1) {
+        return false;
+    }
+    int32_t is = ra_get_index(&r->high_low_container, hb_rs);
+    int32_t ie = ra_get_index(&r->high_low_container, hb_re);
+    if ((ie < 0) || (is < 0) || ((ie - is) != span) || ie >= hlc_sz) {
+        return false;
+    }
+    const uint32_t lb_rs = range_start & 0xFFFF;
+    const uint32_t lb_re = ((range_end - 1) & 0xFFFF) + 1;
+    uint8_t type;
+    container_t *c =
+        ra_get_container_at_index(&r->high_low_container, (uint16_t)is, &type);
+    if (hb_rs == hb_re) {
+        return container_contains_range(c, lb_rs, lb_re, type);
+    }
+    if (!container_contains_range(c, lb_rs, 1 << 16, type)) {
+        return false;
+    }
+    c = ra_get_container_at_index(&r->high_low_container, (uint16_t)ie, &type);
+    if (!container_contains_range(c, 0, lb_re, type)) {
+        return false;
+    }
+    for (int32_t i = is + 1; i < ie; ++i) {
+        c = ra_get_container_at_index(&r->high_low_container, (uint16_t)i,
+                                      &type);
+        if (!container_is_full(c, type)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool roaring_bitmap_is_strict_subset(const roaring_bitmap_t *r1,
+                                     const roaring_bitmap_t *r2) {
+    return (roaring_bitmap_get_cardinality(r2) >
+                roaring_bitmap_get_cardinality(r1) &&
+            roaring_bitmap_is_subset(r1, r2));
+}
+
+/*
+ * FROZEN SERIALIZATION FORMAT DESCRIPTION
+ *
+ * -- (beginning must be aligned by 32 bytes) --
+ * <bitset_data> uint64_t[BITSET_CONTAINER_SIZE_IN_WORDS *
+ * num_bitset_containers] <run_data>    rle16_t[total number of rle elements in
+ * all run containers] <array_data>  uint16_t[total number of array elements in
+ * all array containers] <keys>        uint16_t[num_containers] <counts>
+ * uint16_t[num_containers] <typecodes>   uint8_t[num_containers] <header>
+ * uint32_t
+ *
+ * <header> is a 4-byte value which is a bit union of FROZEN_COOKIE (15 bits)
+ * and the number of containers (17 bits).
+ *
+ * <counts> stores number of elements for every container.
+ * Its meaning depends on container type.
+ * For array and bitset containers, this value is the container cardinality
+ * minus one. For run container, it is the number of rle_t elements (n_runs).
+ *
+ * <bitset_data>,<array_data>,<run_data> are flat arrays of elements of
+ * all containers of respective type.
+ *
+ * <*_data> and <keys> are kept close together because they are not accessed
+ * during deserilization. This may reduce IO in case of large mmaped bitmaps.
+ * All members have their native alignments during deserilization except
+ * <header>, which is not guaranteed to be aligned by 4 bytes.
+ */
+
+size_t roaring_bitmap_frozen_size_in_bytes(const roaring_bitmap_t *rb) {
+    const roaring_array_t *ra = &rb->high_low_container;
+    size_t num_bytes = 0;
+    for (int32_t i = 0; i < ra->size; i++) {
+        switch (ra->typecodes[i]) {
+            case BITSET_CONTAINER_TYPE: {
+                num_bytes += BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t);
+                break;
+            }
+            case RUN_CONTAINER_TYPE: {
+                const run_container_t *rc = const_CAST_run(ra->containers[i]);
+                num_bytes += rc->n_runs * sizeof(rle16_t);
+                break;
+            }
+            case ARRAY_CONTAINER_TYPE: {
+                const array_container_t *ac =
+                    const_CAST_array(ra->containers[i]);
+                num_bytes += ac->cardinality * sizeof(uint16_t);
+                break;
+            }
+            default:
+                roaring_unreachable;
+        }
+    }
+    num_bytes += (2 + 2 + 1) * ra->size;  // keys, counts, typecodes
+    num_bytes += 4;                       // header
+    return num_bytes;
+}
+
+inline static void *arena_alloc(char **arena, size_t num_bytes) {
+    char *res = *arena;
+    *arena += num_bytes;
+    return res;
+}
+
+void roaring_bitmap_frozen_serialize(const roaring_bitmap_t *rb, char *buf) {
+    /*
+     * Note: we do not require user to supply a specifically aligned buffer.
+     * Thus we have to use memcpy() everywhere.
+     */
+
+    const roaring_array_t *ra = &rb->high_low_container;
+
+    size_t bitset_zone_size = 0;
+    size_t run_zone_size = 0;
+    size_t array_zone_size = 0;
+    for (int32_t i = 0; i < ra->size; i++) {
+        switch (ra->typecodes[i]) {
+            case BITSET_CONTAINER_TYPE: {
+                bitset_zone_size +=
+                    BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t);
+                break;
+            }
+            case RUN_CONTAINER_TYPE: {
+                const run_container_t *rc = const_CAST_run(ra->containers[i]);
+                run_zone_size += rc->n_runs * sizeof(rle16_t);
+                break;
+            }
+            case ARRAY_CONTAINER_TYPE: {
+                const array_container_t *ac =
+                    const_CAST_array(ra->containers[i]);
+                array_zone_size += ac->cardinality * sizeof(uint16_t);
+                break;
+            }
+            default:
+                roaring_unreachable;
+        }
+    }
+
+    uint64_t *bitset_zone = (uint64_t *)arena_alloc(&buf, bitset_zone_size);
+    rle16_t *run_zone = (rle16_t *)arena_alloc(&buf, run_zone_size);
+    uint16_t *array_zone = (uint16_t *)arena_alloc(&buf, array_zone_size);
+    uint16_t *key_zone = (uint16_t *)arena_alloc(&buf, 2 * ra->size);
+    uint16_t *count_zone = (uint16_t *)arena_alloc(&buf, 2 * ra->size);
+    uint8_t *typecode_zone = (uint8_t *)arena_alloc(&buf, ra->size);
+    uint32_t *header_zone = (uint32_t *)arena_alloc(&buf, 4);
+
+    for (int32_t i = 0; i < ra->size; i++) {
+        uint16_t count;
+        switch (ra->typecodes[i]) {
+            case BITSET_CONTAINER_TYPE: {
+                const bitset_container_t *bc =
+                    const_CAST_bitset(ra->containers[i]);
+                memcpy(bitset_zone, bc->words,
+                       BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t));
+                bitset_zone += BITSET_CONTAINER_SIZE_IN_WORDS;
+                if (bc->cardinality != BITSET_UNKNOWN_CARDINALITY) {
+                    count = (uint16_t)(bc->cardinality - 1);
+                } else {
+                    count =
+                        (uint16_t)(bitset_container_compute_cardinality(bc) -
+                                   1);
+                }
+                break;
+            }
+            case RUN_CONTAINER_TYPE: {
+                const run_container_t *rc = const_CAST_run(ra->containers[i]);
+                size_t num_bytes = rc->n_runs * sizeof(rle16_t);
+                memcpy(run_zone, rc->runs, num_bytes);
+                run_zone += rc->n_runs;
+                count = (uint16_t)rc->n_runs;
+                break;
+            }
+            case ARRAY_CONTAINER_TYPE: {
+                const array_container_t *ac =
+                    const_CAST_array(ra->containers[i]);
+                size_t num_bytes = ac->cardinality * sizeof(uint16_t);
+                memcpy(array_zone, ac->array, num_bytes);
+                array_zone += ac->cardinality;
+                count = (uint16_t)(ac->cardinality - 1);
+                break;
+            }
+            default:
+                roaring_unreachable;
+        }
+        memcpy(&count_zone[i], &count, 2);
+    }
+    memcpy(key_zone, ra->keys, ra->size * sizeof(uint16_t));
+    memcpy(typecode_zone, ra->typecodes, ra->size * sizeof(uint8_t));
+    uint32_t header = ((uint32_t)ra->size << 15) | FROZEN_COOKIE;
+    memcpy(header_zone, &header, 4);
+}
+
+const roaring_bitmap_t *roaring_bitmap_frozen_view(const char *buf,
+                                                   size_t length) {
+    if ((uintptr_t)buf % 32 != 0) {
+        return NULL;
+    }
+
+    // cookie and num_containers
+    if (length < 4) {
+        return NULL;
+    }
+    uint32_t header;
+    memcpy(&header, buf + length - 4, 4);  // header may be misaligned
+    if ((header & 0x7FFF) != FROZEN_COOKIE) {
+        return NULL;
+    }
+    int32_t num_containers = (header >> 15);
+
+    // typecodes, counts and keys
+    if (length < 4 + (size_t)num_containers * (1 + 2 + 2)) {
+        return NULL;
+    }
+    uint16_t *keys = (uint16_t *)(buf + length - 4 - num_containers * 5);
+    uint16_t *counts = (uint16_t *)(buf + length - 4 - num_containers * 3);
+    uint8_t *typecodes = (uint8_t *)(buf + length - 4 - num_containers * 1);
+
+    // {bitset,array,run}_zone
+    int32_t num_bitset_containers = 0;
+    int32_t num_run_containers = 0;
+    int32_t num_array_containers = 0;
+    size_t bitset_zone_size = 0;
+    size_t run_zone_size = 0;
+    size_t array_zone_size = 0;
+    for (int32_t i = 0; i < num_containers; i++) {
+        switch (typecodes[i]) {
+            case BITSET_CONTAINER_TYPE:
+                num_bitset_containers++;
+                bitset_zone_size +=
+                    BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t);
+                break;
+            case RUN_CONTAINER_TYPE:
+                num_run_containers++;
+                run_zone_size += counts[i] * sizeof(rle16_t);
+                break;
+            case ARRAY_CONTAINER_TYPE:
+                num_array_containers++;
+                array_zone_size += (counts[i] + UINT32_C(1)) * sizeof(uint16_t);
+                break;
+            default:
+                return NULL;
+        }
+    }
+    if (length != bitset_zone_size + run_zone_size + array_zone_size +
+                      5 * num_containers + 4) {
+        return NULL;
+    }
+    uint64_t *bitset_zone = (uint64_t *)(buf);
+    rle16_t *run_zone = (rle16_t *)(buf + bitset_zone_size);
+    uint16_t *array_zone = (uint16_t *)(buf + bitset_zone_size + run_zone_size);
+
+    size_t alloc_size = 0;
+    alloc_size += sizeof(roaring_bitmap_t);
+    alloc_size += num_containers * sizeof(container_t *);
+    alloc_size += num_bitset_containers * sizeof(bitset_container_t);
+    alloc_size += num_run_containers * sizeof(run_container_t);
+    alloc_size += num_array_containers * sizeof(array_container_t);
+
+    char *arena = (char *)roaring_malloc(alloc_size);
+    if (arena == NULL) {
+        return NULL;
+    }
+
+    roaring_bitmap_t *rb =
+        (roaring_bitmap_t *)arena_alloc(&arena, sizeof(roaring_bitmap_t));
+    rb->high_low_container.flags = ROARING_FLAG_FROZEN;
+    rb->high_low_container.allocation_size = num_containers;
+    rb->high_low_container.size = num_containers;
+    rb->high_low_container.keys = (uint16_t *)keys;
+    rb->high_low_container.typecodes = (uint8_t *)typecodes;
+    rb->high_low_container.containers = (container_t **)arena_alloc(
+        &arena, sizeof(container_t *) * num_containers);
+    // Ensure offset of high_low_container.containers is known distance used in
+    // C++ wrapper. sizeof(roaring_bitmap_t) is used as it is the size of the
+    // only allocation that precedes high_low_container.containers. If this is
+    // changed (new allocation or changed order), this offset will also need to
+    // be changed in the C++ wrapper.
+    assert(rb ==
+           (roaring_bitmap_t *)((char *)rb->high_low_container.containers -
+                                sizeof(roaring_bitmap_t)));
+    for (int32_t i = 0; i < num_containers; i++) {
+        switch (typecodes[i]) {
+            case BITSET_CONTAINER_TYPE: {
+                bitset_container_t *bitset = (bitset_container_t *)arena_alloc(
+                    &arena, sizeof(bitset_container_t));
+                bitset->words = bitset_zone;
+                bitset->cardinality = counts[i] + UINT32_C(1);
+                rb->high_low_container.containers[i] = bitset;
+                bitset_zone += BITSET_CONTAINER_SIZE_IN_WORDS;
+                break;
+            }
+            case RUN_CONTAINER_TYPE: {
+                run_container_t *run = (run_container_t *)arena_alloc(
+                    &arena, sizeof(run_container_t));
+                run->capacity = counts[i];
+                run->n_runs = counts[i];
+                run->runs = run_zone;
+                rb->high_low_container.containers[i] = run;
+                run_zone += run->n_runs;
+                break;
+            }
+            case ARRAY_CONTAINER_TYPE: {
+                array_container_t *array = (array_container_t *)arena_alloc(
+                    &arena, sizeof(array_container_t));
+                array->capacity = counts[i] + UINT32_C(1);
+                array->cardinality = counts[i] + UINT32_C(1);
+                array->array = array_zone;
+                rb->high_low_container.containers[i] = array;
+                array_zone += counts[i] + UINT32_C(1);
+                break;
+            }
+            default:
+                roaring_free(arena);
+                return NULL;
+        }
+    }
+
+    return rb;
+}
+
+ALLOW_UNALIGNED
+roaring_bitmap_t *roaring_bitmap_portable_deserialize_frozen(const char *buf) {
+    char *start_of_buf = (char *)buf;
+    uint32_t cookie;
+    int32_t num_containers;
+    uint16_t *descriptive_headers;
+    uint32_t *offset_headers = NULL;
+    const char *run_flag_bitset = NULL;
+    bool hasrun = false;
+
+    // deserialize cookie
+    memcpy(&cookie, buf, sizeof(uint32_t));
+    buf += sizeof(uint32_t);
+    if (cookie == SERIAL_COOKIE_NO_RUNCONTAINER) {
+        memcpy(&num_containers, buf, sizeof(int32_t));
+        buf += sizeof(int32_t);
+        descriptive_headers = (uint16_t *)buf;
+        buf += num_containers * 2 * sizeof(uint16_t);
+        offset_headers = (uint32_t *)buf;
+        buf += num_containers * sizeof(uint32_t);
+    } else if ((cookie & 0xFFFF) == SERIAL_COOKIE) {
+        num_containers = (cookie >> 16) + 1;
+        hasrun = true;
+        int32_t run_flag_bitset_size = (num_containers + 7) / 8;
+        run_flag_bitset = buf;
+        buf += run_flag_bitset_size;
+        descriptive_headers = (uint16_t *)buf;
+        buf += num_containers * 2 * sizeof(uint16_t);
+        if (num_containers >= NO_OFFSET_THRESHOLD) {
+            offset_headers = (uint32_t *)buf;
+            buf += num_containers * sizeof(uint32_t);
+        }
+    } else {
+        return NULL;
+    }
+
+    // calculate total size for allocation
+    int32_t num_bitset_containers = 0;
+    int32_t num_run_containers = 0;
+    int32_t num_array_containers = 0;
+
+    for (int32_t i = 0; i < num_containers; i++) {
+        uint16_t tmp;
+        memcpy(&tmp, descriptive_headers + 2 * i + 1, sizeof(tmp));
+        uint32_t cardinality = tmp + 1;
+        bool isbitmap = (cardinality > DEFAULT_MAX_SIZE);
+        bool isrun = false;
+        if (hasrun) {
+            if ((run_flag_bitset[i / 8] & (1 << (i % 8))) != 0) {
+                isbitmap = false;
+                isrun = true;
+            }
+        }
+
+        if (isbitmap) {
+            num_bitset_containers++;
+        } else if (isrun) {
+            num_run_containers++;
+        } else {
+            num_array_containers++;
+        }
+    }
+
+    size_t alloc_size = 0;
+    alloc_size += sizeof(roaring_bitmap_t);
+    alloc_size += num_containers * sizeof(container_t *);
+    alloc_size += num_bitset_containers * sizeof(bitset_container_t);
+    alloc_size += num_run_containers * sizeof(run_container_t);
+    alloc_size += num_array_containers * sizeof(array_container_t);
+    alloc_size += num_containers * sizeof(uint16_t);  // keys
+    alloc_size += num_containers * sizeof(uint8_t);   // typecodes
+
+    // allocate bitmap and construct containers
+    char *arena = (char *)roaring_malloc(alloc_size);
+    if (arena == NULL) {
+        return NULL;
+    }
+
+    roaring_bitmap_t *rb =
+        (roaring_bitmap_t *)arena_alloc(&arena, sizeof(roaring_bitmap_t));
+    rb->high_low_container.flags = ROARING_FLAG_FROZEN;
+    rb->high_low_container.allocation_size = num_containers;
+    rb->high_low_container.size = num_containers;
+    rb->high_low_container.containers = (container_t **)arena_alloc(
+        &arena, sizeof(container_t *) * num_containers);
+
+    uint16_t *keys =
+        (uint16_t *)arena_alloc(&arena, num_containers * sizeof(uint16_t));
+    uint8_t *typecodes =
+        (uint8_t *)arena_alloc(&arena, num_containers * sizeof(uint8_t));
+
+    rb->high_low_container.keys = keys;
+    rb->high_low_container.typecodes = typecodes;
+
+    for (int32_t i = 0; i < num_containers; i++) {
+        uint16_t tmp;
+        memcpy(&tmp, descriptive_headers + 2 * i + 1, sizeof(tmp));
+        int32_t cardinality = tmp + 1;
+        bool isbitmap = (cardinality > DEFAULT_MAX_SIZE);
+        bool isrun = false;
+        if (hasrun) {
+            if ((run_flag_bitset[i / 8] & (1 << (i % 8))) != 0) {
+                isbitmap = false;
+                isrun = true;
+            }
+        }
+
+        keys[i] = descriptive_headers[2 * i];
+
+        if (isbitmap) {
+            typecodes[i] = BITSET_CONTAINER_TYPE;
+            bitset_container_t *c = (bitset_container_t *)arena_alloc(
+                &arena, sizeof(bitset_container_t));
+            c->cardinality = cardinality;
+            if (offset_headers != NULL) {
+                c->words = (uint64_t *)(start_of_buf + offset_headers[i]);
+            } else {
+                c->words = (uint64_t *)buf;
+                buf += BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t);
+            }
+            rb->high_low_container.containers[i] = c;
+        } else if (isrun) {
+            typecodes[i] = RUN_CONTAINER_TYPE;
+            run_container_t *c =
+                (run_container_t *)arena_alloc(&arena, sizeof(run_container_t));
+            c->capacity = cardinality;
+            uint16_t n_runs;
+            if (offset_headers != NULL) {
+                memcpy(&n_runs, start_of_buf + offset_headers[i],
+                       sizeof(uint16_t));
+                c->n_runs = n_runs;
+                c->runs = (rle16_t *)(start_of_buf + offset_headers[i] +
+                                      sizeof(uint16_t));
+            } else {
+                memcpy(&n_runs, buf, sizeof(uint16_t));
+                c->n_runs = n_runs;
+                buf += sizeof(uint16_t);
+                c->runs = (rle16_t *)buf;
+                buf += c->n_runs * sizeof(rle16_t);
+            }
+            rb->high_low_container.containers[i] = c;
+        } else {
+            typecodes[i] = ARRAY_CONTAINER_TYPE;
+            array_container_t *c = (array_container_t *)arena_alloc(
+                &arena, sizeof(array_container_t));
+            c->cardinality = cardinality;
+            c->capacity = cardinality;
+            if (offset_headers != NULL) {
+                c->array = (uint16_t *)(start_of_buf + offset_headers[i]);
+            } else {
+                c->array = (uint16_t *)buf;
+                buf += cardinality * sizeof(uint16_t);
+            }
+            rb->high_low_container.containers[i] = c;
+        }
+    }
+
+    return rb;
+}
+
+bool roaring_bitmap_to_bitset(const roaring_bitmap_t *r, bitset_t *bitset) {
+    uint32_t max_value = roaring_bitmap_maximum(r);
+    size_t new_array_size = (size_t)(max_value / 64 + 1);
+    bool resize_ok = bitset_resize(bitset, new_array_size, true);
+    if (!resize_ok) {
+        return false;
+    }
+    const roaring_array_t *ra = &r->high_low_container;
+    for (int i = 0; i < ra->size; ++i) {
+        uint64_t *words = bitset->array + (ra->keys[i] << 10);
+        uint8_t type = ra->typecodes[i];
+        const container_t *c = ra->containers[i];
+        if (type == SHARED_CONTAINER_TYPE) {
+            c = container_unwrap_shared(c, &type);
+        }
+        switch (type) {
+            case BITSET_CONTAINER_TYPE: {
+                size_t max_word_index = new_array_size - (ra->keys[i] << 10);
+                if (max_word_index > 1024) {
+                    max_word_index = 1024;
+                }
+                const bitset_container_t *src = const_CAST_bitset(c);
+                memcpy(words, src->words, max_word_index * sizeof(uint64_t));
+            } break;
+            case ARRAY_CONTAINER_TYPE: {
+                const array_container_t *src = const_CAST_array(c);
+                bitset_set_list(words, src->array, src->cardinality);
+            } break;
+            case RUN_CONTAINER_TYPE: {
+                const run_container_t *src = const_CAST_run(c);
+                for (int32_t rlepos = 0; rlepos < src->n_runs; ++rlepos) {
+                    rle16_t rle = src->runs[rlepos];
+                    bitset_set_lenrange(words, rle.value, rle.length);
+                }
+            } break;
+            default:
+                roaring_unreachable;
+        }
+    }
+    return true;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring {
+#endif
+/* end file src/roaring.c */
+/* begin file src/roaring64.c */
+#include <assert.h>
+#include <stdarg.h>
+#include <stdint.h>
+#include <string.h>
+
+
+// For serialization / deserialization
+// containers.h last to avoid conflict with ROARING_CONTAINER_T.
+
+#ifdef __cplusplus
+using namespace ::roaring::internal;
+
+extern "C" {
+namespace roaring {
+namespace api {
+#endif
+
+// TODO: Copy on write.
+// TODO: Error on failed allocation.
+
+typedef struct roaring64_bitmap_s {
+    art_t art;
+    uint8_t flags;
+} roaring64_bitmap_t;
+
+// Leaf type of the ART used to keep the high 48 bits of each entry.
+typedef struct roaring64_leaf_s {
+    art_val_t _pad;
+    uint8_t typecode;
+    container_t *container;
+} roaring64_leaf_t;
+
+// Alias to make it easier to work with, since it's an internal-only type
+// anyway.
+typedef struct roaring64_leaf_s leaf_t;
+
+// Iterator struct to hold iteration state.
+typedef struct roaring64_iterator_s {
+    const roaring64_bitmap_t *parent;
+    art_iterator_t art_it;
+    roaring_container_iterator_t container_it;
+    uint64_t high48;  // Key that art_it points to.
+
+    uint64_t value;
+    bool has_value;
+
+    // If has_value is false, then the iterator is saturated. This field
+    // indicates the direction of saturation. If true, there are no more values
+    // in the forward direction. If false, there are no more values in the
+    // backward direction.
+    bool saturated_forward;
+} roaring64_iterator_t;
+
+// Splits the given uint64 key into high 48 bit and low 16 bit components.
+// Expects high48_out to be of length ART_KEY_BYTES.
+static inline uint16_t split_key(uint64_t key, uint8_t high48_out[]) {
+    uint64_t tmp = croaring_htobe64(key);
+    memcpy(high48_out, (uint8_t *)(&tmp), ART_KEY_BYTES);
+    return (uint16_t)key;
+}
+
+// Recombines the high 48 bit and low 16 bit components into a uint64 key.
+// Expects high48_out to be of length ART_KEY_BYTES.
+static inline uint64_t combine_key(const uint8_t high48[], uint16_t low16) {
+    uint64_t result = 0;
+    memcpy((uint8_t *)(&result), high48, ART_KEY_BYTES);
+    return croaring_be64toh(result) | low16;
+}
+
+static inline uint64_t minimum(uint64_t a, uint64_t b) {
+    return (a < b) ? a : b;
+}
+
+static inline leaf_t *create_leaf(container_t *container, uint8_t typecode) {
+    leaf_t *leaf = (leaf_t *)roaring_malloc(sizeof(leaf_t));
+    leaf->container = container;
+    leaf->typecode = typecode;
+    return leaf;
+}
+
+static inline leaf_t *copy_leaf_container(const leaf_t *leaf) {
+    leaf_t *result_leaf = (leaf_t *)roaring_malloc(sizeof(leaf_t));
+    result_leaf->typecode = leaf->typecode;
+    // get_copy_of_container modifies the typecode passed in.
+    result_leaf->container = get_copy_of_container(
+        leaf->container, &result_leaf->typecode, /*copy_on_write=*/false);
+    return result_leaf;
+}
+
+static inline void free_leaf(leaf_t *leaf) { roaring_free(leaf); }
+
+static inline int compare_high48(art_key_chunk_t key1[],
+                                 art_key_chunk_t key2[]) {
+    return art_compare_keys(key1, key2);
+}
+
+static inline bool roaring64_iterator_init_at_leaf_first(
+    roaring64_iterator_t *it) {
+    it->high48 = combine_key(it->art_it.key, 0);
+    leaf_t *leaf = (leaf_t *)it->art_it.value;
+    uint16_t low16 = 0;
+    it->container_it =
+        container_init_iterator(leaf->container, leaf->typecode, &low16);
+    it->value = it->high48 | low16;
+    return (it->has_value = true);
+}
+
+static inline bool roaring64_iterator_init_at_leaf_last(
+    roaring64_iterator_t *it) {
+    it->high48 = combine_key(it->art_it.key, 0);
+    leaf_t *leaf = (leaf_t *)it->art_it.value;
+    uint16_t low16 = 0;
+    it->container_it =
+        container_init_iterator_last(leaf->container, leaf->typecode, &low16);
+    it->value = it->high48 | low16;
+    return (it->has_value = true);
+}
+
+static inline roaring64_iterator_t *roaring64_iterator_init_at(
+    const roaring64_bitmap_t *r, roaring64_iterator_t *it, bool first) {
+    it->parent = r;
+    it->art_it = art_init_iterator(&r->art, first);
+    it->has_value = it->art_it.value != NULL;
+    if (it->has_value) {
+        if (first) {
+            roaring64_iterator_init_at_leaf_first(it);
+        } else {
+            roaring64_iterator_init_at_leaf_last(it);
+        }
+    } else {
+        it->saturated_forward = first;
+    }
+    return it;
+}
+
+roaring64_bitmap_t *roaring64_bitmap_create(void) {
+    roaring64_bitmap_t *r =
+        (roaring64_bitmap_t *)roaring_malloc(sizeof(roaring64_bitmap_t));
+    r->art.root = NULL;
+    r->flags = 0;
+    return r;
+}
+
+void roaring64_bitmap_free(roaring64_bitmap_t *r) {
+    if (!r) {
+        return;
+    }
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    while (it.value != NULL) {
+        leaf_t *leaf = (leaf_t *)it.value;
+        container_free(leaf->container, leaf->typecode);
+        free_leaf(leaf);
+        art_iterator_next(&it);
+    }
+    art_free(&r->art);
+    roaring_free(r);
+}
+
+roaring64_bitmap_t *roaring64_bitmap_copy(const roaring64_bitmap_t *r) {
+    roaring64_bitmap_t *result = roaring64_bitmap_create();
+
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    while (it.value != NULL) {
+        leaf_t *leaf = (leaf_t *)it.value;
+        uint8_t result_typecode = leaf->typecode;
+        container_t *result_container = get_copy_of_container(
+            leaf->container, &result_typecode, /*copy_on_write=*/false);
+        leaf_t *result_leaf = create_leaf(result_container, result_typecode);
+        art_insert(&result->art, it.key, (art_val_t *)result_leaf);
+        art_iterator_next(&it);
+    }
+    return result;
+}
+
+/**
+ * Steal the containers from a 32-bit bitmap and insert them into a 64-bit
+ * bitmap (with an offset)
+ *
+ * After calling this function, the original bitmap will be empty, and the
+ * returned bitmap will contain all the values from the original bitmap.
+ */
+static void move_from_roaring32_offset(roaring64_bitmap_t *dst,
+                                       roaring_bitmap_t *src,
+                                       uint32_t high_bits) {
+    uint64_t key_base = ((uint64_t)high_bits) << 32;
+    uint32_t r32_size = ra_get_size(&src->high_low_container);
+    for (uint32_t i = 0; i < r32_size; ++i) {
+        uint16_t key = ra_get_key_at_index(&src->high_low_container, i);
+        uint8_t typecode;
+        container_t *container = ra_get_container_at_index(
+            &src->high_low_container, (uint16_t)i, &typecode);
+
+        uint8_t high48[ART_KEY_BYTES];
+        uint64_t high48_bits = key_base | ((uint64_t)key << 16);
+        split_key(high48_bits, high48);
+        leaf_t *leaf = create_leaf(container, typecode);
+        art_insert(&dst->art, high48, (art_val_t *)leaf);
+    }
+    // We stole all the containers, so leave behind a size of zero
+    src->high_low_container.size = 0;
+}
+
+roaring64_bitmap_t *roaring64_bitmap_move_from_roaring32(
+    roaring_bitmap_t *bitmap32) {
+    roaring64_bitmap_t *result = roaring64_bitmap_create();
+
+    move_from_roaring32_offset(result, bitmap32, 0);
+
+    return result;
+}
+
+roaring64_bitmap_t *roaring64_bitmap_from_range(uint64_t min, uint64_t max,
+                                                uint64_t step) {
+    if (step == 0 || max <= min) {
+        return NULL;
+    }
+    roaring64_bitmap_t *r = roaring64_bitmap_create();
+    if (step >= (1 << 16)) {
+        // Only one value per container.
+        for (uint64_t value = min; value < max; value += step) {
+            roaring64_bitmap_add(r, value);
+            if (value > UINT64_MAX - step) {
+                break;
+            }
+        }
+        return r;
+    }
+    do {
+        uint64_t high_bits = min & 0xFFFFFFFFFFFF0000;
+        uint16_t container_min = min & 0xFFFF;
+        uint32_t container_max = (uint32_t)minimum(max - high_bits, 1 << 16);
+
+        uint8_t typecode;
+        container_t *container = container_from_range(
+            &typecode, container_min, container_max, (uint16_t)step);
+
+        uint8_t high48[ART_KEY_BYTES];
+        split_key(min, high48);
+        leaf_t *leaf = create_leaf(container, typecode);
+        art_insert(&r->art, high48, (art_val_t *)leaf);
+
+        uint64_t gap = container_max - container_min + step - 1;
+        uint64_t increment = gap - (gap % step);
+        if (min > UINT64_MAX - increment) {
+            break;
+        }
+        min += increment;
+    } while (min < max);
+    return r;
+}
+
+roaring64_bitmap_t *roaring64_bitmap_of_ptr(size_t n_args,
+                                            const uint64_t *vals) {
+    roaring64_bitmap_t *r = roaring64_bitmap_create();
+    roaring64_bitmap_add_many(r, n_args, vals);
+    return r;
+}
+
+roaring64_bitmap_t *roaring64_bitmap_of(size_t n_args, ...) {
+    roaring64_bitmap_t *r = roaring64_bitmap_create();
+    roaring64_bulk_context_t context = CROARING_ZERO_INITIALIZER;
+    va_list ap;
+    va_start(ap, n_args);
+    for (size_t i = 0; i < n_args; i++) {
+        uint64_t val = va_arg(ap, uint64_t);
+        roaring64_bitmap_add_bulk(r, &context, val);
+    }
+    va_end(ap);
+    return r;
+}
+
+static inline leaf_t *containerptr_roaring64_bitmap_add(roaring64_bitmap_t *r,
+                                                        uint8_t *high48,
+                                                        uint16_t low16,
+                                                        leaf_t *leaf) {
+    if (leaf != NULL) {
+        uint8_t typecode2;
+        container_t *container2 =
+            container_add(leaf->container, low16, leaf->typecode, &typecode2);
+        if (container2 != leaf->container) {
+            container_free(leaf->container, leaf->typecode);
+            leaf->container = container2;
+            leaf->typecode = typecode2;
+        }
+        return leaf;
+    } else {
+        array_container_t *ac = array_container_create();
+        uint8_t typecode;
+        container_t *container =
+            container_add(ac, low16, ARRAY_CONTAINER_TYPE, &typecode);
+        assert(ac == container);
+        leaf = create_leaf(container, typecode);
+        art_insert(&r->art, high48, (art_val_t *)leaf);
+        return leaf;
+    }
+}
+
+void roaring64_bitmap_add(roaring64_bitmap_t *r, uint64_t val) {
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+    leaf_t *leaf = (leaf_t *)art_find(&r->art, high48);
+    containerptr_roaring64_bitmap_add(r, high48, low16, leaf);
+}
+
+bool roaring64_bitmap_add_checked(roaring64_bitmap_t *r, uint64_t val) {
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+    leaf_t *leaf = (leaf_t *)art_find(&r->art, high48);
+
+    int old_cardinality = 0;
+    if (leaf != NULL) {
+        old_cardinality =
+            container_get_cardinality(leaf->container, leaf->typecode);
+    }
+    leaf = containerptr_roaring64_bitmap_add(r, high48, low16, leaf);
+    int new_cardinality =
+        container_get_cardinality(leaf->container, leaf->typecode);
+    return old_cardinality != new_cardinality;
+}
+
+void roaring64_bitmap_add_bulk(roaring64_bitmap_t *r,
+                               roaring64_bulk_context_t *context,
+                               uint64_t val) {
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+    if (context->leaf != NULL &&
+        compare_high48(context->high_bytes, high48) == 0) {
+        // We're at a container with the correct high bits.
+        uint8_t typecode2;
+        container_t *container2 =
+            container_add(context->leaf->container, low16,
+                          context->leaf->typecode, &typecode2);
+        if (container2 != context->leaf->container) {
+            container_free(context->leaf->container, context->leaf->typecode);
+            context->leaf->container = container2;
+            context->leaf->typecode = typecode2;
+        }
+    } else {
+        // We're not positioned anywhere yet or the high bits of the key
+        // differ.
+        leaf_t *leaf = (leaf_t *)art_find(&r->art, high48);
+        context->leaf =
+            containerptr_roaring64_bitmap_add(r, high48, low16, leaf);
+        memcpy(context->high_bytes, high48, ART_KEY_BYTES);
+    }
+}
+
+void roaring64_bitmap_add_many(roaring64_bitmap_t *r, size_t n_args,
+                               const uint64_t *vals) {
+    if (n_args == 0) {
+        return;
+    }
+    const uint64_t *end = vals + n_args;
+    roaring64_bulk_context_t context = CROARING_ZERO_INITIALIZER;
+    for (const uint64_t *current_val = vals; current_val != end;
+         current_val++) {
+        roaring64_bitmap_add_bulk(r, &context, *current_val);
+    }
+}
+
+static inline void add_range_closed_at(art_t *art, uint8_t *high48,
+                                       uint16_t min, uint16_t max) {
+    leaf_t *leaf = (leaf_t *)art_find(art, high48);
+    if (leaf != NULL) {
+        uint8_t typecode2;
+        container_t *container2 = container_add_range(
+            leaf->container, leaf->typecode, min, max, &typecode2);
+        if (container2 != leaf->container) {
+            container_free(leaf->container, leaf->typecode);
+            leaf->container = container2;
+            leaf->typecode = typecode2;
+        }
+        return;
+    }
+    uint8_t typecode;
+    // container_add_range is inclusive, but `container_range_of_ones` is
+    // exclusive.
+    container_t *container = container_range_of_ones(min, max + 1, &typecode);
+    leaf = create_leaf(container, typecode);
+    art_insert(art, high48, (art_val_t *)leaf);
+}
+
+void roaring64_bitmap_add_range(roaring64_bitmap_t *r, uint64_t min,
+                                uint64_t max) {
+    if (min >= max) {
+        return;
+    }
+    roaring64_bitmap_add_range_closed(r, min, max - 1);
+}
+
+void roaring64_bitmap_add_range_closed(roaring64_bitmap_t *r, uint64_t min,
+                                       uint64_t max) {
+    if (min > max) {
+        return;
+    }
+
+    art_t *art = &r->art;
+    uint8_t min_high48[ART_KEY_BYTES];
+    uint16_t min_low16 = split_key(min, min_high48);
+    uint8_t max_high48[ART_KEY_BYTES];
+    uint16_t max_low16 = split_key(max, max_high48);
+    if (compare_high48(min_high48, max_high48) == 0) {
+        // Only populate range within one container.
+        add_range_closed_at(art, min_high48, min_low16, max_low16);
+        return;
+    }
+
+    // Populate a range across containers. Fill intermediate containers
+    // entirely.
+    add_range_closed_at(art, min_high48, min_low16, 0xffff);
+    uint64_t min_high_bits = min >> 16;
+    uint64_t max_high_bits = max >> 16;
+    for (uint64_t current = min_high_bits + 1; current < max_high_bits;
+         ++current) {
+        uint8_t current_high48[ART_KEY_BYTES];
+        split_key(current << 16, current_high48);
+        add_range_closed_at(art, current_high48, 0, 0xffff);
+    }
+    add_range_closed_at(art, max_high48, 0, max_low16);
+}
+
+bool roaring64_bitmap_contains(const roaring64_bitmap_t *r, uint64_t val) {
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+    leaf_t *leaf = (leaf_t *)art_find(&r->art, high48);
+    if (leaf != NULL) {
+        return container_contains(leaf->container, low16, leaf->typecode);
+    }
+    return false;
+}
+
+bool roaring64_bitmap_contains_range(const roaring64_bitmap_t *r, uint64_t min,
+                                     uint64_t max) {
+    if (min >= max) {
+        return true;
+    }
+
+    uint8_t min_high48[ART_KEY_BYTES];
+    uint16_t min_low16 = split_key(min, min_high48);
+    uint8_t max_high48[ART_KEY_BYTES];
+    uint16_t max_low16 = split_key(max, max_high48);
+    uint64_t max_high48_bits = (max - 1) & 0xFFFFFFFFFFFF0000;  // Inclusive
+
+    art_iterator_t it = art_lower_bound(&r->art, min_high48);
+    if (it.value == NULL || combine_key(it.key, 0) > min) {
+        return false;
+    }
+    uint64_t prev_high48_bits = min & 0xFFFFFFFFFFFF0000;
+    while (it.value != NULL) {
+        uint64_t current_high48_bits = combine_key(it.key, 0);
+        if (current_high48_bits > max_high48_bits) {
+            // We've passed the end of the range with all containers containing
+            // the range.
+            return true;
+        }
+        if (current_high48_bits - prev_high48_bits > 0x10000) {
+            // There is a gap in the iterator that falls in the range.
+            return false;
+        }
+
+        leaf_t *leaf = (leaf_t *)it.value;
+        uint32_t container_min = 0;
+        if (compare_high48(it.key, min_high48) == 0) {
+            container_min = min_low16;
+        }
+        uint32_t container_max = 0xFFFF + 1;  // Exclusive
+        if (compare_high48(it.key, max_high48) == 0) {
+            container_max = max_low16;
+        }
+
+        // For the first and last containers we use container_contains_range,
+        // for the intermediate containers we can use container_is_full.
+        if (container_min == 0 && container_max == 0xFFFF + 1) {
+            if (!container_is_full(leaf->container, leaf->typecode)) {
+                return false;
+            }
+        } else if (!container_contains_range(leaf->container, container_min,
+                                             container_max, leaf->typecode)) {
+            return false;
+        }
+        prev_high48_bits = current_high48_bits;
+        art_iterator_next(&it);
+    }
+    return prev_high48_bits == max_high48_bits;
+}
+
+bool roaring64_bitmap_contains_bulk(const roaring64_bitmap_t *r,
+                                    roaring64_bulk_context_t *context,
+                                    uint64_t val) {
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+
+    if (context->leaf == NULL ||
+        art_compare_keys(context->high_bytes, high48) != 0) {
+        // We're not positioned anywhere yet or the high bits of the key
+        // differ.
+        leaf_t *leaf = (leaf_t *)art_find(&r->art, high48);
+        if (leaf == NULL) {
+            return false;
+        }
+        context->leaf = leaf;
+        memcpy(context->high_bytes, high48, ART_KEY_BYTES);
+    }
+    return container_contains(context->leaf->container, low16,
+                              context->leaf->typecode);
+}
+
+bool roaring64_bitmap_select(const roaring64_bitmap_t *r, uint64_t rank,
+                             uint64_t *element) {
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    uint64_t start_rank = 0;
+    while (it.value != NULL) {
+        leaf_t *leaf = (leaf_t *)it.value;
+        uint64_t cardinality =
+            container_get_cardinality(leaf->container, leaf->typecode);
+        if (start_rank + cardinality > rank) {
+            uint32_t uint32_start = 0;
+            uint32_t uint32_rank = rank - start_rank;
+            uint32_t uint32_element = 0;
+            if (container_select(leaf->container, leaf->typecode, &uint32_start,
+                                 uint32_rank, &uint32_element)) {
+                *element = combine_key(it.key, (uint16_t)uint32_element);
+                return true;
+            }
+            return false;
+        }
+        start_rank += cardinality;
+        art_iterator_next(&it);
+    }
+    return false;
+}
+
+uint64_t roaring64_bitmap_rank(const roaring64_bitmap_t *r, uint64_t val) {
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    uint64_t rank = 0;
+    while (it.value != NULL) {
+        leaf_t *leaf = (leaf_t *)it.value;
+        int compare_result = compare_high48(it.key, high48);
+        if (compare_result < 0) {
+            rank += container_get_cardinality(leaf->container, leaf->typecode);
+        } else if (compare_result == 0) {
+            return rank +
+                   container_rank(leaf->container, leaf->typecode, low16);
+        } else {
+            return rank;
+        }
+        art_iterator_next(&it);
+    }
+    return rank;
+}
+
+bool roaring64_bitmap_get_index(const roaring64_bitmap_t *r, uint64_t val,
+                                uint64_t *out_index) {
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    uint64_t index = 0;
+    while (it.value != NULL) {
+        leaf_t *leaf = (leaf_t *)it.value;
+        int compare_result = compare_high48(it.key, high48);
+        if (compare_result < 0) {
+            index += container_get_cardinality(leaf->container, leaf->typecode);
+        } else if (compare_result == 0) {
+            int index16 =
+                container_get_index(leaf->container, leaf->typecode, low16);
+            if (index16 < 0) {
+                return false;
+            }
+            *out_index = index + index16;
+            return true;
+        } else {
+            return false;
+        }
+        art_iterator_next(&it);
+    }
+    return false;
+}
+
+static inline leaf_t *containerptr_roaring64_bitmap_remove(
+    roaring64_bitmap_t *r, uint8_t *high48, uint16_t low16, leaf_t *leaf) {
+    if (leaf == NULL) {
+        return NULL;
+    }
+
+    container_t *container = leaf->container;
+    uint8_t typecode = leaf->typecode;
+    uint8_t typecode2;
+    container_t *container2 =
+        container_remove(container, low16, typecode, &typecode2);
+    if (container2 != container) {
+        container_free(container, typecode);
+        leaf->container = container2;
+        leaf->typecode = typecode2;
+    }
+    if (!container_nonzero_cardinality(container2, typecode2)) {
+        container_free(container2, typecode2);
+        leaf = (leaf_t *)art_erase(&r->art, high48);
+        if (leaf != NULL) {
+            free_leaf(leaf);
+        }
+        return NULL;
+    }
+    return leaf;
+}
+
+void roaring64_bitmap_remove(roaring64_bitmap_t *r, uint64_t val) {
+    art_t *art = &r->art;
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+
+    leaf_t *leaf = (leaf_t *)art_find(art, high48);
+    containerptr_roaring64_bitmap_remove(r, high48, low16, leaf);
+}
+
+bool roaring64_bitmap_remove_checked(roaring64_bitmap_t *r, uint64_t val) {
+    art_t *art = &r->art;
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+    leaf_t *leaf = (leaf_t *)art_find(art, high48);
+
+    if (leaf == NULL) {
+        return false;
+    }
+    int old_cardinality =
+        container_get_cardinality(leaf->container, leaf->typecode);
+    leaf = containerptr_roaring64_bitmap_remove(r, high48, low16, leaf);
+    if (leaf == NULL) {
+        return true;
+    }
+    int new_cardinality =
+        container_get_cardinality(leaf->container, leaf->typecode);
+    return new_cardinality != old_cardinality;
+}
+
+void roaring64_bitmap_remove_bulk(roaring64_bitmap_t *r,
+                                  roaring64_bulk_context_t *context,
+                                  uint64_t val) {
+    art_t *art = &r->art;
+    uint8_t high48[ART_KEY_BYTES];
+    uint16_t low16 = split_key(val, high48);
+    if (context->leaf != NULL &&
+        compare_high48(context->high_bytes, high48) == 0) {
+        // We're at a container with the correct high bits.
+        uint8_t typecode2;
+        container_t *container2 =
+            container_remove(context->leaf->container, low16,
+                             context->leaf->typecode, &typecode2);
+        if (container2 != context->leaf->container) {
+            container_free(context->leaf->container, context->leaf->typecode);
+            context->leaf->container = container2;
+            context->leaf->typecode = typecode2;
+        }
+        if (!container_nonzero_cardinality(container2, typecode2)) {
+            leaf_t *leaf = (leaf_t *)art_erase(art, high48);
+            container_free(container2, typecode2);
+            free_leaf(leaf);
+        }
+    } else {
+        // We're not positioned anywhere yet or the high bits of the key
+        // differ.
+        leaf_t *leaf = (leaf_t *)art_find(art, high48);
+        context->leaf =
+            containerptr_roaring64_bitmap_remove(r, high48, low16, leaf);
+        memcpy(context->high_bytes, high48, ART_KEY_BYTES);
+    }
+}
+
+void roaring64_bitmap_remove_many(roaring64_bitmap_t *r, size_t n_args,
+                                  const uint64_t *vals) {
+    if (n_args == 0) {
+        return;
+    }
+    const uint64_t *end = vals + n_args;
+    roaring64_bulk_context_t context = CROARING_ZERO_INITIALIZER;
+    for (const uint64_t *current_val = vals; current_val != end;
+         current_val++) {
+        roaring64_bitmap_remove_bulk(r, &context, *current_val);
+    }
+}
+
+static inline void remove_range_closed_at(art_t *art, uint8_t *high48,
+                                          uint16_t min, uint16_t max) {
+    leaf_t *leaf = (leaf_t *)art_find(art, high48);
+    if (leaf == NULL) {
+        return;
+    }
+    uint8_t typecode2;
+    container_t *container2 = container_remove_range(
+        leaf->container, leaf->typecode, min, max, &typecode2);
+    if (container2 != leaf->container) {
+        container_free(leaf->container, leaf->typecode);
+        if (container2 != NULL) {
+            leaf->container = container2;
+            leaf->typecode = typecode2;
+        } else {
+            art_erase(art, high48);
+            free_leaf(leaf);
+        }
+    }
+}
+
+void roaring64_bitmap_remove_range(roaring64_bitmap_t *r, uint64_t min,
+                                   uint64_t max) {
+    if (min >= max) {
+        return;
+    }
+    roaring64_bitmap_remove_range_closed(r, min, max - 1);
+}
+
+void roaring64_bitmap_remove_range_closed(roaring64_bitmap_t *r, uint64_t min,
+                                          uint64_t max) {
+    if (min > max) {
+        return;
+    }
+
+    art_t *art = &r->art;
+    uint8_t min_high48[ART_KEY_BYTES];
+    uint16_t min_low16 = split_key(min, min_high48);
+    uint8_t max_high48[ART_KEY_BYTES];
+    uint16_t max_low16 = split_key(max, max_high48);
+    if (compare_high48(min_high48, max_high48) == 0) {
+        // Only remove a range within one container.
+        remove_range_closed_at(art, min_high48, min_low16, max_low16);
+        return;
+    }
+
+    // Remove a range across containers. Remove intermediate containers
+    // entirely.
+    remove_range_closed_at(art, min_high48, min_low16, 0xffff);
+
+    art_iterator_t it = art_upper_bound(art, min_high48);
+    while (it.value != NULL && art_compare_keys(it.key, max_high48) < 0) {
+        leaf_t *leaf = (leaf_t *)art_iterator_erase(art, &it);
+        container_free(leaf->container, leaf->typecode);
+        free_leaf(leaf);
+    }
+    remove_range_closed_at(art, max_high48, 0, max_low16);
+}
+
+void roaring64_bitmap_clear(roaring64_bitmap_t *r) {
+    roaring64_bitmap_remove_range_closed(r, 0, UINT64_MAX);
+}
+
+uint64_t roaring64_bitmap_get_cardinality(const roaring64_bitmap_t *r) {
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    uint64_t cardinality = 0;
+    while (it.value != NULL) {
+        leaf_t *leaf = (leaf_t *)it.value;
+        cardinality +=
+            container_get_cardinality(leaf->container, leaf->typecode);
+        art_iterator_next(&it);
+    }
+    return cardinality;
+}
+
+uint64_t roaring64_bitmap_range_cardinality(const roaring64_bitmap_t *r,
+                                            uint64_t min, uint64_t max) {
+    if (min >= max) {
+        return 0;
+    }
+    // Convert to a closed range
+    // No underflow here: passing the above condition implies min < max, so
+    // there is a number less than max
+    return roaring64_bitmap_range_closed_cardinality(r, min, max - 1);
+}
+
+uint64_t roaring64_bitmap_range_closed_cardinality(const roaring64_bitmap_t *r,
+                                                   uint64_t min, uint64_t max) {
+    if (min > max) {
+        return 0;
+    }
+
+    uint64_t cardinality = 0;
+    uint8_t min_high48[ART_KEY_BYTES];
+    uint16_t min_low16 = split_key(min, min_high48);
+    uint8_t max_high48[ART_KEY_BYTES];
+    uint16_t max_low16 = split_key(max, max_high48);
+
+    art_iterator_t it = art_lower_bound(&r->art, min_high48);
+    while (it.value != NULL) {
+        int max_compare_result = compare_high48(it.key, max_high48);
+        if (max_compare_result > 0) {
+            // We're outside the range.
+            break;
+        }
+
+        leaf_t *leaf = (leaf_t *)it.value;
+        if (max_compare_result == 0) {
+            // We're at the max high key, add only the range up to the low
+            // 16 bits of max.
+            cardinality +=
+                container_rank(leaf->container, leaf->typecode, max_low16);
+        } else {
+            // We're not yet at the max high key, add the full container
+            // range.
+            cardinality +=
+                container_get_cardinality(leaf->container, leaf->typecode);
+        }
+        if (compare_high48(it.key, min_high48) == 0 && min_low16 > 0) {
+            // We're at the min high key, remove the range up to the low 16
+            // bits of min.
+            cardinality -=
+                container_rank(leaf->container, leaf->typecode, min_low16 - 1);
+        }
+        art_iterator_next(&it);
+    }
+    return cardinality;
+}
+
+bool roaring64_bitmap_is_empty(const roaring64_bitmap_t *r) {
+    return art_is_empty(&r->art);
+}
+
+uint64_t roaring64_bitmap_minimum(const roaring64_bitmap_t *r) {
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    if (it.value == NULL) {
+        return UINT64_MAX;
+    }
+    leaf_t *leaf = (leaf_t *)it.value;
+    return combine_key(it.key,
+                       container_minimum(leaf->container, leaf->typecode));
+}
+
+uint64_t roaring64_bitmap_maximum(const roaring64_bitmap_t *r) {
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/false);
+    if (it.value == NULL) {
+        return 0;
+    }
+    leaf_t *leaf = (leaf_t *)it.value;
+    return combine_key(it.key,
+                       container_maximum(leaf->container, leaf->typecode));
+}
+
+bool roaring64_bitmap_run_optimize(roaring64_bitmap_t *r) {
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    bool has_run_container = false;
+    while (it.value != NULL) {
+        leaf_t *leaf = (leaf_t *)it.value;
+        uint8_t new_typecode;
+        // We don't need to free the existing container if a new one was
+        // created, convert_run_optimize does that internally.
+        leaf->container = convert_run_optimize(leaf->container, leaf->typecode,
+                                               &new_typecode);
+        leaf->typecode = new_typecode;
+        has_run_container |= new_typecode == RUN_CONTAINER_TYPE;
+        art_iterator_next(&it);
+    }
+    return has_run_container;
+}
+
+/**
+ *  (For advanced users.)
+ * Collect statistics about the bitmap
+ */
+void roaring64_bitmap_statistics(const roaring64_bitmap_t *r,
+                                 roaring64_statistics_t *stat) {
+    memset(stat, 0, sizeof(*stat));
+    stat->min_value = roaring64_bitmap_minimum(r);
+    stat->max_value = roaring64_bitmap_maximum(r);
+
+    art_iterator_t it = art_init_iterator(&r->art, true);
+    while (it.value != NULL) {
+        leaf_t *leaf = (leaf_t *)it.value;
+        stat->n_containers++;
+        uint8_t truetype = get_container_type(leaf->container, leaf->typecode);
+        uint32_t card =
+            container_get_cardinality(leaf->container, leaf->typecode);
+        uint32_t sbytes =
+            container_size_in_bytes(leaf->container, leaf->typecode);
+        stat->cardinality += card;
+        switch (truetype) {
+            case BITSET_CONTAINER_TYPE:
+                stat->n_bitset_containers++;
+                stat->n_values_bitset_containers += card;
+                stat->n_bytes_bitset_containers += sbytes;
+                break;
+            case ARRAY_CONTAINER_TYPE:
+                stat->n_array_containers++;
+                stat->n_values_array_containers += card;
+                stat->n_bytes_array_containers += sbytes;
+                break;
+            case RUN_CONTAINER_TYPE:
+                stat->n_run_containers++;
+                stat->n_values_run_containers += card;
+                stat->n_bytes_run_containers += sbytes;
+                break;
+            default:
+                assert(false);
+                roaring_unreachable;
+        }
+        art_iterator_next(&it);
+    }
+}
+
+static bool roaring64_leaf_internal_validate(const art_val_t *val,
+                                             const char **reason) {
+    leaf_t *leaf = (leaf_t *)val;
+    return container_internal_validate(leaf->container, leaf->typecode, reason);
+}
+
+bool roaring64_bitmap_internal_validate(const roaring64_bitmap_t *r,
+                                        const char **reason) {
+    return art_internal_validate(&r->art, reason,
+                                 roaring64_leaf_internal_validate);
+}
+
+bool roaring64_bitmap_equals(const roaring64_bitmap_t *r1,
+                             const roaring64_bitmap_t *r2) {
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL && it2.value != NULL) {
+        if (compare_high48(it1.key, it2.key) != 0) {
+            return false;
+        }
+        leaf_t *leaf1 = (leaf_t *)it1.value;
+        leaf_t *leaf2 = (leaf_t *)it2.value;
+        if (!container_equals(leaf1->container, leaf1->typecode,
+                              leaf2->container, leaf2->typecode)) {
+            return false;
+        }
+        art_iterator_next(&it1);
+        art_iterator_next(&it2);
+    }
+    return it1.value == NULL && it2.value == NULL;
+}
+
+bool roaring64_bitmap_is_subset(const roaring64_bitmap_t *r1,
+                                const roaring64_bitmap_t *r2) {
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL) {
+        bool it2_present = it2.value != NULL;
+
+        int compare_result = 0;
+        if (it2_present) {
+            compare_result = compare_high48(it1.key, it2.key);
+            if (compare_result == 0) {
+                leaf_t *leaf1 = (leaf_t *)it1.value;
+                leaf_t *leaf2 = (leaf_t *)it2.value;
+                if (!container_is_subset(leaf1->container, leaf1->typecode,
+                                         leaf2->container, leaf2->typecode)) {
+                    return false;
+                }
+                art_iterator_next(&it1);
+                art_iterator_next(&it2);
+            }
+        }
+        if (!it2_present || compare_result < 0) {
+            return false;
+        } else if (compare_result > 0) {
+            art_iterator_lower_bound(&it2, it1.key);
+        }
+    }
+    return true;
+}
+
+bool roaring64_bitmap_is_strict_subset(const roaring64_bitmap_t *r1,
+                                       const roaring64_bitmap_t *r2) {
+    return roaring64_bitmap_get_cardinality(r1) <
+               roaring64_bitmap_get_cardinality(r2) &&
+           roaring64_bitmap_is_subset(r1, r2);
+}
+
+roaring64_bitmap_t *roaring64_bitmap_and(const roaring64_bitmap_t *r1,
+                                         const roaring64_bitmap_t *r2) {
+    roaring64_bitmap_t *result = roaring64_bitmap_create();
+
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL && it2.value != NULL) {
+        // Cases:
+        // 1. it1 <  it2 -> it1++
+        // 2. it1 == it1 -> output it1 & it2, it1++, it2++
+        // 3. it1 >  it2 -> it2++
+        int compare_result = compare_high48(it1.key, it2.key);
+        if (compare_result == 0) {
+            // Case 2: iterators at the same high key position.
+            leaf_t *result_leaf = (leaf_t *)roaring_malloc(sizeof(leaf_t));
+            leaf_t *leaf1 = (leaf_t *)it1.value;
+            leaf_t *leaf2 = (leaf_t *)it2.value;
+            result_leaf->container = container_and(
+                leaf1->container, leaf1->typecode, leaf2->container,
+                leaf2->typecode, &result_leaf->typecode);
+
+            if (container_nonzero_cardinality(result_leaf->container,
+                                              result_leaf->typecode)) {
+                art_insert(&result->art, it1.key, (art_val_t *)result_leaf);
+            } else {
+                container_free(result_leaf->container, result_leaf->typecode);
+                free_leaf(result_leaf);
+            }
+            art_iterator_next(&it1);
+            art_iterator_next(&it2);
+        } else if (compare_result < 0) {
+            // Case 1: it1 is before it2.
+            art_iterator_lower_bound(&it1, it2.key);
+        } else {
+            // Case 3: it2 is before it1.
+            art_iterator_lower_bound(&it2, it1.key);
+        }
+    }
+    return result;
+}
+
+uint64_t roaring64_bitmap_and_cardinality(const roaring64_bitmap_t *r1,
+                                          const roaring64_bitmap_t *r2) {
+    uint64_t result = 0;
+
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL && it2.value != NULL) {
+        // Cases:
+        // 1. it1 <  it2 -> it1++
+        // 2. it1 == it1 -> output cardinaltiy it1 & it2, it1++, it2++
+        // 3. it1 >  it2 -> it2++
+        int compare_result = compare_high48(it1.key, it2.key);
+        if (compare_result == 0) {
+            // Case 2: iterators at the same high key position.
+            leaf_t *leaf1 = (leaf_t *)it1.value;
+            leaf_t *leaf2 = (leaf_t *)it2.value;
+            result +=
+                container_and_cardinality(leaf1->container, leaf1->typecode,
+                                          leaf2->container, leaf2->typecode);
+            art_iterator_next(&it1);
+            art_iterator_next(&it2);
+        } else if (compare_result < 0) {
+            // Case 1: it1 is before it2.
+            art_iterator_lower_bound(&it1, it2.key);
+        } else {
+            // Case 3: it2 is before it1.
+            art_iterator_lower_bound(&it2, it1.key);
+        }
+    }
+    return result;
+}
+
+// Inplace and (modifies its first argument).
+void roaring64_bitmap_and_inplace(roaring64_bitmap_t *r1,
+                                  const roaring64_bitmap_t *r2) {
+    if (r1 == r2) {
+        return;
+    }
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL) {
+        // Cases:
+        // 1. !it2_present -> erase it1
+        // 2. it2_present
+        //    a. it1 <  it2 -> erase it1
+        //    b. it1 == it2 -> output it1 & it2, it1++, it2++
+        //    c. it1 >  it2 -> it2++
+        bool it2_present = it2.value != NULL;
+        int compare_result = 0;
+        if (it2_present) {
+            compare_result = compare_high48(it1.key, it2.key);
+            if (compare_result == 0) {
+                // Case 2a: iterators at the same high key position.
+                leaf_t *leaf1 = (leaf_t *)it1.value;
+                leaf_t *leaf2 = (leaf_t *)it2.value;
+
+                // We do the computation "in place" only when c1 is not a
+                // shared container. Rationale: using a shared container
+                // safely with in place computation would require making a
+                // copy and then doing the computation in place which is
+                // likely less efficient than avoiding in place entirely and
+                // always generating a new container.
+                uint8_t typecode2;
+                container_t *container2;
+                if (leaf1->typecode == SHARED_CONTAINER_TYPE) {
+                    container2 = container_and(
+                        leaf1->container, leaf1->typecode, leaf2->container,
+                        leaf2->typecode, &typecode2);
+                } else {
+                    container2 = container_iand(
+                        leaf1->container, leaf1->typecode, leaf2->container,
+                        leaf2->typecode, &typecode2);
+                }
+
+                if (container2 != leaf1->container) {
+                    container_free(leaf1->container, leaf1->typecode);
+                    leaf1->container = container2;
+                    leaf1->typecode = typecode2;
+                }
+                if (!container_nonzero_cardinality(container2, typecode2)) {
+                    container_free(container2, typecode2);
+                    art_iterator_erase(&r1->art, &it1);
+                    free_leaf(leaf1);
+                } else {
+                    // Only advance the iterator if we didn't delete the
+                    // leaf, as erasing advances by itself.
+                    art_iterator_next(&it1);
+                }
+                art_iterator_next(&it2);
+            }
+        }
+
+        if (!it2_present || compare_result < 0) {
+            // Cases 1 and 3a: it1 is the only iterator or is before it2.
+            leaf_t *leaf = (leaf_t *)art_iterator_erase(&r1->art, &it1);
+            assert(leaf != NULL);
+            container_free(leaf->container, leaf->typecode);
+            free_leaf(leaf);
+        } else if (compare_result > 0) {
+            // Case 2c: it1 is after it2.
+            art_iterator_lower_bound(&it2, it1.key);
+        }
+    }
+}
+
+bool roaring64_bitmap_intersect(const roaring64_bitmap_t *r1,
+                                const roaring64_bitmap_t *r2) {
+    bool intersect = false;
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL && it2.value != NULL) {
+        // Cases:
+        // 1. it1 <  it2 -> it1++
+        // 2. it1 == it1 -> intersect |= it1 & it2, it1++, it2++
+        // 3. it1 >  it2 -> it2++
+        int compare_result = compare_high48(it1.key, it2.key);
+        if (compare_result == 0) {
+            // Case 2: iterators at the same high key position.
+            leaf_t *leaf1 = (leaf_t *)it1.value;
+            leaf_t *leaf2 = (leaf_t *)it2.value;
+            intersect |= container_intersect(leaf1->container, leaf1->typecode,
+                                             leaf2->container, leaf2->typecode);
+            art_iterator_next(&it1);
+            art_iterator_next(&it2);
+        } else if (compare_result < 0) {
+            // Case 1: it1 is before it2.
+            art_iterator_lower_bound(&it1, it2.key);
+        } else {
+            // Case 3: it2 is before it1.
+            art_iterator_lower_bound(&it2, it1.key);
+        }
+    }
+    return intersect;
+}
+
+bool roaring64_bitmap_intersect_with_range(const roaring64_bitmap_t *r,
+                                           uint64_t min, uint64_t max) {
+    if (min >= max) {
+        return false;
+    }
+    roaring64_iterator_t it;
+    roaring64_iterator_init_at(r, &it, /*first=*/true);
+    if (!roaring64_iterator_move_equalorlarger(&it, min)) {
+        return false;
+    }
+    return roaring64_iterator_has_value(&it) &&
+           roaring64_iterator_value(&it) < max;
+}
+
+double roaring64_bitmap_jaccard_index(const roaring64_bitmap_t *r1,
+                                      const roaring64_bitmap_t *r2) {
+    uint64_t c1 = roaring64_bitmap_get_cardinality(r1);
+    uint64_t c2 = roaring64_bitmap_get_cardinality(r2);
+    uint64_t inter = roaring64_bitmap_and_cardinality(r1, r2);
+    return (double)inter / (double)(c1 + c2 - inter);
+}
+
+roaring64_bitmap_t *roaring64_bitmap_or(const roaring64_bitmap_t *r1,
+                                        const roaring64_bitmap_t *r2) {
+    roaring64_bitmap_t *result = roaring64_bitmap_create();
+
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL || it2.value != NULL) {
+        bool it1_present = it1.value != NULL;
+        bool it2_present = it2.value != NULL;
+
+        // Cases:
+        // 1. it1_present  && !it2_present -> output it1, it1++
+        // 2. !it1_present && it2_present  -> output it2, it2++
+        // 3. it1_present  && it2_present
+        //    a. it1 <  it2 -> output it1, it1++
+        //    b. it1 == it2 -> output it1 | it2, it1++, it2++
+        //    c. it1 >  it2 -> output it2, it2++
+        int compare_result = 0;
+        if (it1_present && it2_present) {
+            compare_result = compare_high48(it1.key, it2.key);
+            if (compare_result == 0) {
+                // Case 3b: iterators at the same high key position.
+                leaf_t *leaf1 = (leaf_t *)it1.value;
+                leaf_t *leaf2 = (leaf_t *)it2.value;
+                leaf_t *result_leaf = (leaf_t *)roaring_malloc(sizeof(leaf_t));
+                result_leaf->container = container_or(
+                    leaf1->container, leaf1->typecode, leaf2->container,
+                    leaf2->typecode, &result_leaf->typecode);
+                art_insert(&result->art, it1.key, (art_val_t *)result_leaf);
+                art_iterator_next(&it1);
+                art_iterator_next(&it2);
+            }
+        }
+        if ((it1_present && !it2_present) || compare_result < 0) {
+            // Cases 1 and 3a: it1 is the only iterator or is before it2.
+            leaf_t *result_leaf = copy_leaf_container((leaf_t *)it1.value);
+            art_insert(&result->art, it1.key, (art_val_t *)result_leaf);
+            art_iterator_next(&it1);
+        } else if ((!it1_present && it2_present) || compare_result > 0) {
+            // Cases 2 and 3c: it2 is the only iterator or is before it1.
+            leaf_t *result_leaf = copy_leaf_container((leaf_t *)it2.value);
+            art_insert(&result->art, it2.key, (art_val_t *)result_leaf);
+            art_iterator_next(&it2);
+        }
+    }
+    return result;
+}
+
+uint64_t roaring64_bitmap_or_cardinality(const roaring64_bitmap_t *r1,
+                                         const roaring64_bitmap_t *r2) {
+    uint64_t c1 = roaring64_bitmap_get_cardinality(r1);
+    uint64_t c2 = roaring64_bitmap_get_cardinality(r2);
+    uint64_t inter = roaring64_bitmap_and_cardinality(r1, r2);
+    return c1 + c2 - inter;
+}
+
+void roaring64_bitmap_or_inplace(roaring64_bitmap_t *r1,
+                                 const roaring64_bitmap_t *r2) {
+    if (r1 == r2) {
+        return;
+    }
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL || it2.value != NULL) {
+        bool it1_present = it1.value != NULL;
+        bool it2_present = it2.value != NULL;
+
+        // Cases:
+        // 1. it1_present  && !it2_present -> it1++
+        // 2. !it1_present && it2_present  -> add it2, it2++
+        // 3. it1_present  && it2_present
+        //    a. it1 <  it2 -> it1++
+        //    b. it1 == it2 -> it1 | it2, it1++, it2++
+        //    c. it1 >  it2 -> add it2, it2++
+        int compare_result = 0;
+        if (it1_present && it2_present) {
+            compare_result = compare_high48(it1.key, it2.key);
+            if (compare_result == 0) {
+                // Case 3b: iterators at the same high key position.
+                leaf_t *leaf1 = (leaf_t *)it1.value;
+                leaf_t *leaf2 = (leaf_t *)it2.value;
+                uint8_t typecode2;
+                container_t *container2;
+                if (leaf1->typecode == SHARED_CONTAINER_TYPE) {
+                    container2 = container_or(leaf1->container, leaf1->typecode,
+                                              leaf2->container, leaf2->typecode,
+                                              &typecode2);
+                } else {
+                    container2 = container_ior(
+                        leaf1->container, leaf1->typecode, leaf2->container,
+                        leaf2->typecode, &typecode2);
+                }
+                if (container2 != leaf1->container) {
+                    container_free(leaf1->container, leaf1->typecode);
+                    leaf1->container = container2;
+                    leaf1->typecode = typecode2;
+                }
+                art_iterator_next(&it1);
+                art_iterator_next(&it2);
+            }
+        }
+        if ((it1_present && !it2_present) || compare_result < 0) {
+            // Cases 1 and 3a: it1 is the only iterator or is before it2.
+            art_iterator_next(&it1);
+        } else if ((!it1_present && it2_present) || compare_result > 0) {
+            // Cases 2 and 3c: it2 is the only iterator or is before it1.
+            leaf_t *result_leaf = copy_leaf_container((leaf_t *)it2.value);
+            art_iterator_insert(&r1->art, &it1, it2.key,
+                                (art_val_t *)result_leaf);
+            art_iterator_next(&it2);
+        }
+    }
+}
+
+roaring64_bitmap_t *roaring64_bitmap_xor(const roaring64_bitmap_t *r1,
+                                         const roaring64_bitmap_t *r2) {
+    roaring64_bitmap_t *result = roaring64_bitmap_create();
+
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL || it2.value != NULL) {
+        bool it1_present = it1.value != NULL;
+        bool it2_present = it2.value != NULL;
+
+        // Cases:
+        // 1. it1_present  && !it2_present -> output it1, it1++
+        // 2. !it1_present && it2_present  -> output it2, it2++
+        // 3. it1_present  && it2_present
+        //    a. it1 <  it2 -> output it1, it1++
+        //    b. it1 == it2 -> output it1 ^ it2, it1++, it2++
+        //    c. it1 >  it2 -> output it2, it2++
+        int compare_result = 0;
+        if (it1_present && it2_present) {
+            compare_result = compare_high48(it1.key, it2.key);
+            if (compare_result == 0) {
+                // Case 3b: iterators at the same high key position.
+                leaf_t *leaf1 = (leaf_t *)it1.value;
+                leaf_t *leaf2 = (leaf_t *)it2.value;
+                leaf_t *result_leaf = (leaf_t *)roaring_malloc(sizeof(leaf_t));
+                result_leaf->container = container_xor(
+                    leaf1->container, leaf1->typecode, leaf2->container,
+                    leaf2->typecode, &result_leaf->typecode);
+                if (container_nonzero_cardinality(result_leaf->container,
+                                                  result_leaf->typecode)) {
+                    art_insert(&result->art, it1.key, (art_val_t *)result_leaf);
+                } else {
+                    container_free(result_leaf->container,
+                                   result_leaf->typecode);
+                    free_leaf(result_leaf);
+                }
+                art_iterator_next(&it1);
+                art_iterator_next(&it2);
+            }
+        }
+        if ((it1_present && !it2_present) || compare_result < 0) {
+            // Cases 1 and 3a: it1 is the only iterator or is before it2.
+            leaf_t *result_leaf = copy_leaf_container((leaf_t *)it1.value);
+            art_insert(&result->art, it1.key, (art_val_t *)result_leaf);
+            art_iterator_next(&it1);
+        } else if ((!it1_present && it2_present) || compare_result > 0) {
+            // Cases 2 and 3c: it2 is the only iterator or is before it1.
+            leaf_t *result_leaf = copy_leaf_container((leaf_t *)it2.value);
+            art_insert(&result->art, it2.key, (art_val_t *)result_leaf);
+            art_iterator_next(&it2);
+        }
+    }
+    return result;
+}
+
+uint64_t roaring64_bitmap_xor_cardinality(const roaring64_bitmap_t *r1,
+                                          const roaring64_bitmap_t *r2) {
+    uint64_t c1 = roaring64_bitmap_get_cardinality(r1);
+    uint64_t c2 = roaring64_bitmap_get_cardinality(r2);
+    uint64_t inter = roaring64_bitmap_and_cardinality(r1, r2);
+    return c1 + c2 - 2 * inter;
+}
+
+void roaring64_bitmap_xor_inplace(roaring64_bitmap_t *r1,
+                                  const roaring64_bitmap_t *r2) {
+    assert(r1 != r2);
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL || it2.value != NULL) {
+        bool it1_present = it1.value != NULL;
+        bool it2_present = it2.value != NULL;
+
+        // Cases:
+        // 1.  it1_present && !it2_present -> it1++
+        // 2. !it1_present &&  it2_present -> add it2, it2++
+        // 3.  it1_present &&  it2_present
+        //    a. it1 <  it2 -> it1++
+        //    b. it1 == it2 -> it1 ^ it2, it1++, it2++
+        //    c. it1 >  it2 -> add it2, it2++
+        int compare_result = 0;
+        if (it1_present && it2_present) {
+            compare_result = compare_high48(it1.key, it2.key);
+            if (compare_result == 0) {
+                // Case 3b: iterators at the same high key position.
+                leaf_t *leaf1 = (leaf_t *)it1.value;
+                leaf_t *leaf2 = (leaf_t *)it2.value;
+                container_t *container1 = leaf1->container;
+                uint8_t typecode1 = leaf1->typecode;
+                uint8_t typecode2;
+                container_t *container2;
+                if (leaf1->typecode == SHARED_CONTAINER_TYPE) {
+                    container2 = container_xor(
+                        leaf1->container, leaf1->typecode, leaf2->container,
+                        leaf2->typecode, &typecode2);
+                    if (container2 != container1) {
+                        // We only free when doing container_xor, not
+                        // container_ixor, as ixor frees the original
+                        // internally.
+                        container_free(container1, typecode1);
+                    }
+                } else {
+                    container2 = container_ixor(
+                        leaf1->container, leaf1->typecode, leaf2->container,
+                        leaf2->typecode, &typecode2);
+                }
+                leaf1->container = container2;
+                leaf1->typecode = typecode2;
+
+                if (!container_nonzero_cardinality(container2, typecode2)) {
+                    container_free(container2, typecode2);
+                    art_iterator_erase(&r1->art, &it1);
+                    free_leaf(leaf1);
+                } else {
+                    // Only advance the iterator if we didn't delete the
+                    // leaf, as erasing advances by itself.
+                    art_iterator_next(&it1);
+                }
+                art_iterator_next(&it2);
+            }
+        }
+        if ((it1_present && !it2_present) || compare_result < 0) {
+            // Cases 1 and 3a: it1 is the only iterator or is before it2.
+            art_iterator_next(&it1);
+        } else if ((!it1_present && it2_present) || compare_result > 0) {
+            // Cases 2 and 3c: it2 is the only iterator or is before it1.
+            leaf_t *result_leaf = copy_leaf_container((leaf_t *)it2.value);
+            if (it1_present) {
+                art_iterator_insert(&r1->art, &it1, it2.key,
+                                    (art_val_t *)result_leaf);
+                art_iterator_next(&it1);
+            } else {
+                art_insert(&r1->art, it2.key, (art_val_t *)result_leaf);
+            }
+            art_iterator_next(&it2);
+        }
+    }
+}
+
+roaring64_bitmap_t *roaring64_bitmap_andnot(const roaring64_bitmap_t *r1,
+                                            const roaring64_bitmap_t *r2) {
+    roaring64_bitmap_t *result = roaring64_bitmap_create();
+
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL) {
+        // Cases:
+        // 1. it1_present && !it2_present -> output it1, it1++
+        // 2. it1_present && it2_present
+        //    a. it1 <  it2 -> output it1, it1++
+        //    b. it1 == it2 -> output it1 - it2, it1++, it2++
+        //    c. it1 >  it2 -> it2++
+        bool it2_present = it2.value != NULL;
+        int compare_result = 0;
+        if (it2_present) {
+            compare_result = compare_high48(it1.key, it2.key);
+            if (compare_result == 0) {
+                // Case 2b: iterators at the same high key position.
+                leaf_t *result_leaf = (leaf_t *)roaring_malloc(sizeof(leaf_t));
+                leaf_t *leaf1 = (leaf_t *)it1.value;
+                leaf_t *leaf2 = (leaf_t *)it2.value;
+                result_leaf->container = container_andnot(
+                    leaf1->container, leaf1->typecode, leaf2->container,
+                    leaf2->typecode, &result_leaf->typecode);
+
+                if (container_nonzero_cardinality(result_leaf->container,
+                                                  result_leaf->typecode)) {
+                    art_insert(&result->art, it1.key, (art_val_t *)result_leaf);
+                } else {
+                    container_free(result_leaf->container,
+                                   result_leaf->typecode);
+                    free_leaf(result_leaf);
+                }
+                art_iterator_next(&it1);
+                art_iterator_next(&it2);
+            }
+        }
+        if (!it2_present || compare_result < 0) {
+            // Cases 1 and 2a: it1 is the only iterator or is before it2.
+            leaf_t *result_leaf = copy_leaf_container((leaf_t *)it1.value);
+            art_insert(&result->art, it1.key, (art_val_t *)result_leaf);
+            art_iterator_next(&it1);
+        } else if (compare_result > 0) {
+            // Case 2c: it1 is after it2.
+            art_iterator_next(&it2);
+        }
+    }
+    return result;
+}
+
+uint64_t roaring64_bitmap_andnot_cardinality(const roaring64_bitmap_t *r1,
+                                             const roaring64_bitmap_t *r2) {
+    uint64_t c1 = roaring64_bitmap_get_cardinality(r1);
+    uint64_t inter = roaring64_bitmap_and_cardinality(r1, r2);
+    return c1 - inter;
+}
+
+void roaring64_bitmap_andnot_inplace(roaring64_bitmap_t *r1,
+                                     const roaring64_bitmap_t *r2) {
+    art_iterator_t it1 = art_init_iterator(&r1->art, /*first=*/true);
+    art_iterator_t it2 = art_init_iterator(&r2->art, /*first=*/true);
+
+    while (it1.value != NULL) {
+        // Cases:
+        // 1. it1_present && !it2_present -> it1++
+        // 2. it1_present &&  it2_present
+        //    a. it1 <  it2 -> it1++
+        //    b. it1 == it2 -> it1 - it2, it1++, it2++
+        //    c. it1 >  it2 -> it2++
+        bool it2_present = it2.value != NULL;
+        int compare_result = 0;
+        if (it2_present) {
+            compare_result = compare_high48(it1.key, it2.key);
+            if (compare_result == 0) {
+                // Case 2b: iterators at the same high key position.
+                leaf_t *leaf1 = (leaf_t *)it1.value;
+                leaf_t *leaf2 = (leaf_t *)it2.value;
+                container_t *container1 = leaf1->container;
+                uint8_t typecode1 = leaf1->typecode;
+                uint8_t typecode2;
+                container_t *container2;
+                if (leaf1->typecode == SHARED_CONTAINER_TYPE) {
+                    container2 = container_andnot(
+                        leaf1->container, leaf1->typecode, leaf2->container,
+                        leaf2->typecode, &typecode2);
+                    if (container2 != container1) {
+                        // We only free when doing container_andnot, not
+                        // container_iandnot, as iandnot frees the original
+                        // internally.
+                        container_free(container1, typecode1);
+                    }
+                } else {
+                    container2 = container_iandnot(
+                        leaf1->container, leaf1->typecode, leaf2->container,
+                        leaf2->typecode, &typecode2);
+                }
+                if (container2 != container1) {
+                    leaf1->container = container2;
+                    leaf1->typecode = typecode2;
+                }
+
+                if (!container_nonzero_cardinality(container2, typecode2)) {
+                    container_free(container2, typecode2);
+                    art_iterator_erase(&r1->art, &it1);
+                    free_leaf(leaf1);
+                } else {
+                    // Only advance the iterator if we didn't delete the
+                    // leaf, as erasing advances by itself.
+                    art_iterator_next(&it1);
+                }
+                art_iterator_next(&it2);
+            }
+        }
+        if (!it2_present || compare_result < 0) {
+            // Cases 1 and 2a: it1 is the only iterator or is before it2.
+            art_iterator_next(&it1);
+        } else if (compare_result > 0) {
+            // Case 2c: it1 is after it2.
+            art_iterator_next(&it2);
+        }
+    }
+}
+
+/**
+ * Flips the leaf at high48 in the range [min, max), returning a new leaf with a
+ * new container. If the high48 key is not found in the existing bitmap, a new
+ * container is created. Returns null if the negation results in an empty range.
+ */
+static leaf_t *roaring64_flip_leaf(const roaring64_bitmap_t *r,
+                                   uint8_t high48[], uint32_t min,
+                                   uint32_t max) {
+    leaf_t *leaf1 = (leaf_t *)art_find(&r->art, high48);
+    container_t *container2;
+    uint8_t typecode2;
+    if (leaf1 == NULL) {
+        // No container at this key, create a full container.
+        container2 = container_range_of_ones(min, max, &typecode2);
+    } else if (min == 0 && max > 0xFFFF) {
+        // Flip whole container.
+        container2 =
+            container_not(leaf1->container, leaf1->typecode, &typecode2);
+    } else {
+        // Partially flip a container.
+        container2 = container_not_range(leaf1->container, leaf1->typecode, min,
+                                         max, &typecode2);
+    }
+    if (container_nonzero_cardinality(container2, typecode2)) {
+        return create_leaf(container2, typecode2);
+    }
+    container_free(container2, typecode2);
+    return NULL;
+}
+
+/**
+ * Flips the leaf at high48 in the range [min, max). If the high48 key is not
+ * found in the bitmap, a new container is created. Deletes the leaf and
+ * associated container if the negation results in an empty range.
+ */
+static void roaring64_flip_leaf_inplace(roaring64_bitmap_t *r, uint8_t high48[],
+                                        uint32_t min, uint32_t max) {
+    leaf_t *leaf = (leaf_t *)art_find(&r->art, high48);
+    container_t *container2;
+    uint8_t typecode2;
+    if (leaf == NULL) {
+        // No container at this key, insert a full container.
+        container2 = container_range_of_ones(min, max, &typecode2);
+        art_insert(&r->art, high48,
+                   (art_val_t *)create_leaf(container2, typecode2));
+        return;
+    }
+
+    if (min == 0 && max > 0xFFFF) {
+        // Flip whole container.
+        container2 =
+            container_inot(leaf->container, leaf->typecode, &typecode2);
+    } else {
+        // Partially flip a container.
+        container2 = container_inot_range(leaf->container, leaf->typecode, min,
+                                          max, &typecode2);
+    }
+
+    leaf->container = container2;
+    leaf->typecode = typecode2;
+
+    if (!container_nonzero_cardinality(leaf->container, leaf->typecode)) {
+        art_erase(&r->art, high48);
+        container_free(leaf->container, leaf->typecode);
+        free_leaf(leaf);
+    }
+}
+
+roaring64_bitmap_t *roaring64_bitmap_flip(const roaring64_bitmap_t *r,
+                                          uint64_t min, uint64_t max) {
+    if (min >= max) {
+        return roaring64_bitmap_copy(r);
+    }
+    return roaring64_bitmap_flip_closed(r, min, max - 1);
+}
+
+roaring64_bitmap_t *roaring64_bitmap_flip_closed(const roaring64_bitmap_t *r1,
+                                                 uint64_t min, uint64_t max) {
+    if (min > max) {
+        return roaring64_bitmap_copy(r1);
+    }
+    uint8_t min_high48_key[ART_KEY_BYTES];
+    uint16_t min_low16 = split_key(min, min_high48_key);
+    uint8_t max_high48_key[ART_KEY_BYTES];
+    uint16_t max_low16 = split_key(max, max_high48_key);
+    uint64_t min_high48_bits = (min & 0xFFFFFFFFFFFF0000ULL) >> 16;
+    uint64_t max_high48_bits = (max & 0xFFFFFFFFFFFF0000ULL) >> 16;
+
+    roaring64_bitmap_t *r2 = roaring64_bitmap_create();
+    art_iterator_t it = art_init_iterator(&r1->art, /*first=*/true);
+
+    // Copy the containers before min unchanged.
+    while (it.value != NULL && compare_high48(it.key, min_high48_key) < 0) {
+        leaf_t *leaf1 = (leaf_t *)it.value;
+        uint8_t typecode2 = leaf1->typecode;
+        container_t *container2 = get_copy_of_container(
+            leaf1->container, &typecode2, /*copy_on_write=*/false);
+        art_insert(&r2->art, it.key,
+                   (art_val_t *)create_leaf(container2, typecode2));
+        art_iterator_next(&it);
+    }
+
+    // Flip the range (including non-existent containers!) between min and max.
+    for (uint64_t high48_bits = min_high48_bits; high48_bits <= max_high48_bits;
+         high48_bits++) {
+        uint8_t current_high48_key[ART_KEY_BYTES];
+        split_key(high48_bits << 16, current_high48_key);
+
+        uint32_t min_container = 0;
+        if (high48_bits == min_high48_bits) {
+            min_container = min_low16;
+        }
+        uint32_t max_container = 0xFFFF + 1;  // Exclusive range.
+        if (high48_bits == max_high48_bits) {
+            max_container = max_low16 + 1;  // Exclusive.
+        }
+
+        leaf_t *leaf = roaring64_flip_leaf(r1, current_high48_key,
+                                           min_container, max_container);
+        if (leaf != NULL) {
+            art_insert(&r2->art, current_high48_key, (art_val_t *)leaf);
+        }
+    }
+
+    // Copy the containers after max unchanged.
+    it = art_upper_bound(&r1->art, max_high48_key);
+    while (it.value != NULL) {
+        leaf_t *leaf1 = (leaf_t *)it.value;
+        uint8_t typecode2 = leaf1->typecode;
+        container_t *container2 = get_copy_of_container(
+            leaf1->container, &typecode2, /*copy_on_write=*/false);
+        art_insert(&r2->art, it.key,
+                   (art_val_t *)create_leaf(container2, typecode2));
+        art_iterator_next(&it);
+    }
+
+    return r2;
+}
+
+void roaring64_bitmap_flip_inplace(roaring64_bitmap_t *r, uint64_t min,
+                                   uint64_t max) {
+    if (min >= max) {
+        return;
+    }
+    roaring64_bitmap_flip_closed_inplace(r, min, max - 1);
+}
+
+void roaring64_bitmap_flip_closed_inplace(roaring64_bitmap_t *r, uint64_t min,
+                                          uint64_t max) {
+    if (min > max) {
+        return;
+    }
+    uint16_t min_low16 = (uint16_t)min;
+    uint16_t max_low16 = (uint16_t)max;
+    uint64_t min_high48_bits = (min & 0xFFFFFFFFFFFF0000ULL) >> 16;
+    uint64_t max_high48_bits = (max & 0xFFFFFFFFFFFF0000ULL) >> 16;
+
+    // Flip the range (including non-existent containers!) between min and max.
+    for (uint64_t high48_bits = min_high48_bits; high48_bits <= max_high48_bits;
+         high48_bits++) {
+        uint8_t current_high48_key[ART_KEY_BYTES];
+        split_key(high48_bits << 16, current_high48_key);
+
+        uint32_t min_container = 0;
+        if (high48_bits == min_high48_bits) {
+            min_container = min_low16;
+        }
+        uint32_t max_container = 0xFFFF + 1;  // Exclusive range.
+        if (high48_bits == max_high48_bits) {
+            max_container = max_low16 + 1;  // Exclusive.
+        }
+
+        roaring64_flip_leaf_inplace(r, current_high48_key, min_container,
+                                    max_container);
+    }
+}
+
+// Returns the number of distinct high 32-bit entries in the bitmap.
+static inline uint64_t count_high32(const roaring64_bitmap_t *r) {
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    uint64_t high32_count = 0;
+    uint32_t prev_high32 = 0;
+    while (it.value != NULL) {
+        uint32_t current_high32 = (uint32_t)(combine_key(it.key, 0) >> 32);
+        if (high32_count == 0 || prev_high32 != current_high32) {
+            high32_count++;
+            prev_high32 = current_high32;
+        }
+        art_iterator_next(&it);
+    }
+    return high32_count;
+}
+
+// Frees the (32-bit!) bitmap without freeing the containers.
+static inline void roaring_bitmap_free_without_containers(roaring_bitmap_t *r) {
+    ra_clear_without_containers(&r->high_low_container);
+    roaring_free(r);
+}
+
+size_t roaring64_bitmap_portable_size_in_bytes(const roaring64_bitmap_t *r) {
+    // https://github.com/RoaringBitmap/RoaringFormatSpec#extension-for-64-bit-implementations
+    size_t size = 0;
+
+    // Write as uint64 the distinct number of "buckets", where a bucket is
+    // defined as the most significant 32 bits of an element.
+    uint64_t high32_count;
+    size += sizeof(high32_count);
+
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    uint32_t prev_high32 = 0;
+    roaring_bitmap_t *bitmap32 = NULL;
+
+    // Iterate through buckets ordered by increasing keys.
+    while (it.value != NULL) {
+        uint32_t current_high32 = (uint32_t)(combine_key(it.key, 0) >> 32);
+        if (bitmap32 == NULL || prev_high32 != current_high32) {
+            if (bitmap32 != NULL) {
+                // Write as uint32 the most significant 32 bits of the bucket.
+                size += sizeof(prev_high32);
+
+                // Write the 32-bit Roaring bitmaps representing the least
+                // significant bits of a set of elements.
+                size += roaring_bitmap_portable_size_in_bytes(bitmap32);
+                roaring_bitmap_free_without_containers(bitmap32);
+            }
+
+            // Start a new 32-bit bitmap with the current high 32 bits.
+            art_iterator_t it2 = it;
+            uint32_t containers_with_high32 = 0;
+            while (it2.value != NULL && (uint32_t)(combine_key(it2.key, 0) >>
+                                                   32) == current_high32) {
+                containers_with_high32++;
+                art_iterator_next(&it2);
+            }
+            bitmap32 =
+                roaring_bitmap_create_with_capacity(containers_with_high32);
+
+            prev_high32 = current_high32;
+        }
+        leaf_t *leaf = (leaf_t *)it.value;
+        ra_append(&bitmap32->high_low_container,
+                  (uint16_t)(current_high32 >> 16), leaf->container,
+                  leaf->typecode);
+        art_iterator_next(&it);
+    }
+
+    if (bitmap32 != NULL) {
+        // Write as uint32 the most significant 32 bits of the bucket.
+        size += sizeof(prev_high32);
+
+        // Write the 32-bit Roaring bitmaps representing the least
+        // significant bits of a set of elements.
+        size += roaring_bitmap_portable_size_in_bytes(bitmap32);
+        roaring_bitmap_free_without_containers(bitmap32);
+    }
+
+    return size;
+}
+
+size_t roaring64_bitmap_portable_serialize(const roaring64_bitmap_t *r,
+                                           char *buf) {
+    // https://github.com/RoaringBitmap/RoaringFormatSpec#extension-for-64-bit-implementations
+    if (buf == NULL) {
+        return 0;
+    }
+    const char *initial_buf = buf;
+
+    // Write as uint64 the distinct number of "buckets", where a bucket is
+    // defined as the most significant 32 bits of an element.
+    uint64_t high32_count = count_high32(r);
+    memcpy(buf, &high32_count, sizeof(high32_count));
+    buf += sizeof(high32_count);
+
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    uint32_t prev_high32 = 0;
+    roaring_bitmap_t *bitmap32 = NULL;
+
+    // Iterate through buckets ordered by increasing keys.
+    while (it.value != NULL) {
+        uint64_t current_high48 = combine_key(it.key, 0);
+        uint32_t current_high32 = (uint32_t)(current_high48 >> 32);
+        if (bitmap32 == NULL || prev_high32 != current_high32) {
+            if (bitmap32 != NULL) {
+                // Write as uint32 the most significant 32 bits of the bucket.
+                memcpy(buf, &prev_high32, sizeof(prev_high32));
+                buf += sizeof(prev_high32);
+
+                // Write the 32-bit Roaring bitmaps representing the least
+                // significant bits of a set of elements.
+                buf += roaring_bitmap_portable_serialize(bitmap32, buf);
+                roaring_bitmap_free_without_containers(bitmap32);
+            }
+
+            // Start a new 32-bit bitmap with the current high 32 bits.
+            art_iterator_t it2 = it;
+            uint32_t containers_with_high32 = 0;
+            while (it2.value != NULL &&
+                   (uint32_t)combine_key(it2.key, 0) == current_high32) {
+                containers_with_high32++;
+                art_iterator_next(&it2);
+            }
+            bitmap32 =
+                roaring_bitmap_create_with_capacity(containers_with_high32);
+
+            prev_high32 = current_high32;
+        }
+        leaf_t *leaf = (leaf_t *)it.value;
+        ra_append(&bitmap32->high_low_container,
+                  (uint16_t)(current_high48 >> 16), leaf->container,
+                  leaf->typecode);
+        art_iterator_next(&it);
+    }
+
+    if (bitmap32 != NULL) {
+        // Write as uint32 the most significant 32 bits of the bucket.
+        memcpy(buf, &prev_high32, sizeof(prev_high32));
+        buf += sizeof(prev_high32);
+
+        // Write the 32-bit Roaring bitmaps representing the least
+        // significant bits of a set of elements.
+        buf += roaring_bitmap_portable_serialize(bitmap32, buf);
+        roaring_bitmap_free_without_containers(bitmap32);
+    }
+
+    return buf - initial_buf;
+}
+
+size_t roaring64_bitmap_portable_deserialize_size(const char *buf,
+                                                  size_t maxbytes) {
+    // https://github.com/RoaringBitmap/RoaringFormatSpec#extension-for-64-bit-implementations
+    if (buf == NULL) {
+        return 0;
+    }
+    size_t read_bytes = 0;
+
+    // Read as uint64 the distinct number of "buckets", where a bucket is
+    // defined as the most significant 32 bits of an element.
+    uint64_t buckets;
+    if (read_bytes + sizeof(buckets) > maxbytes) {
+        return 0;
+    }
+    memcpy(&buckets, buf, sizeof(buckets));
+    buf += sizeof(buckets);
+    read_bytes += sizeof(buckets);
+
+    // Buckets should be 32 bits with 4 bits of zero padding.
+    if (buckets > UINT32_MAX) {
+        return 0;
+    }
+
+    // Iterate through buckets ordered by increasing keys.
+    for (uint64_t bucket = 0; bucket < buckets; ++bucket) {
+        // Read as uint32 the most significant 32 bits of the bucket.
+        uint32_t high32;
+        if (read_bytes + sizeof(high32) > maxbytes) {
+            return 0;
+        }
+        buf += sizeof(high32);
+        read_bytes += sizeof(high32);
+
+        // Read the 32-bit Roaring bitmaps representing the least significant
+        // bits of a set of elements.
+        size_t bitmap32_size = roaring_bitmap_portable_deserialize_size(
+            buf, maxbytes - read_bytes);
+        if (bitmap32_size == 0) {
+            return 0;
+        }
+        buf += bitmap32_size;
+        read_bytes += bitmap32_size;
+    }
+    return read_bytes;
+}
+
+roaring64_bitmap_t *roaring64_bitmap_portable_deserialize_safe(
+    const char *buf, size_t maxbytes) {
+    // https://github.com/RoaringBitmap/RoaringFormatSpec#extension-for-64-bit-implementations
+    if (buf == NULL) {
+        return NULL;
+    }
+    size_t read_bytes = 0;
+
+    // Read as uint64 the distinct number of "buckets", where a bucket is
+    // defined as the most significant 32 bits of an element.
+    uint64_t buckets;
+    if (read_bytes + sizeof(buckets) > maxbytes) {
+        return NULL;
+    }
+    memcpy(&buckets, buf, sizeof(buckets));
+    buf += sizeof(buckets);
+    read_bytes += sizeof(buckets);
+
+    // Buckets should be 32 bits with 4 bits of zero padding.
+    if (buckets > UINT32_MAX) {
+        return NULL;
+    }
+
+    roaring64_bitmap_t *r = roaring64_bitmap_create();
+    // Iterate through buckets ordered by increasing keys.
+    int64_t previous_high32 = -1;
+    for (uint64_t bucket = 0; bucket < buckets; ++bucket) {
+        // Read as uint32 the most significant 32 bits of the bucket.
+        uint32_t high32;
+        if (read_bytes + sizeof(high32) > maxbytes) {
+            roaring64_bitmap_free(r);
+            return NULL;
+        }
+        memcpy(&high32, buf, sizeof(high32));
+        buf += sizeof(high32);
+        read_bytes += sizeof(high32);
+        // High 32 bits must be strictly increasing.
+        if (high32 <= previous_high32) {
+            roaring64_bitmap_free(r);
+            return NULL;
+        }
+        previous_high32 = high32;
+
+        // Read the 32-bit Roaring bitmaps representing the least significant
+        // bits of a set of elements.
+        size_t bitmap32_size = roaring_bitmap_portable_deserialize_size(
+            buf, maxbytes - read_bytes);
+        if (bitmap32_size == 0) {
+            roaring64_bitmap_free(r);
+            return NULL;
+        }
+
+        roaring_bitmap_t *bitmap32 = roaring_bitmap_portable_deserialize_safe(
+            buf, maxbytes - read_bytes);
+        if (bitmap32 == NULL) {
+            roaring64_bitmap_free(r);
+            return NULL;
+        }
+        buf += bitmap32_size;
+        read_bytes += bitmap32_size;
+
+        // While we don't attempt to validate much, we must ensure that there
+        // is no duplication in the high 48 bits - inserting into the ART
+        // assumes (or UB) no duplicate keys. The top 32 bits must be unique
+        // because we check for strict increasing values of  high32, but we
+        // must also ensure the top 16 bits within each 32-bit bitmap are also
+        // at least unique (we ensure they're strictly increasing as well,
+        // which they must be for a _valid_ bitmap, since it's cheaper to check)
+        int32_t last_bitmap_key = -1;
+        for (int i = 0; i < bitmap32->high_low_container.size; i++) {
+            uint16_t key = bitmap32->high_low_container.keys[i];
+            if (key <= last_bitmap_key) {
+                roaring_bitmap_free(bitmap32);
+                roaring64_bitmap_free(r);
+                return NULL;
+            }
+            last_bitmap_key = key;
+        }
+
+        // Insert all containers of the 32-bit bitmap into the 64-bit bitmap.
+        move_from_roaring32_offset(r, bitmap32, high32);
+        roaring_bitmap_free(bitmap32);
+    }
+    return r;
+}
+
+bool roaring64_bitmap_iterate(const roaring64_bitmap_t *r,
+                              roaring_iterator64 iterator, void *ptr) {
+    art_iterator_t it = art_init_iterator(&r->art, /*first=*/true);
+    while (it.value != NULL) {
+        uint64_t high48 = combine_key(it.key, 0);
+        uint64_t high32 = high48 & 0xFFFFFFFF00000000ULL;
+        uint32_t low32 = high48;
+        leaf_t *leaf = (leaf_t *)it.value;
+        if (!container_iterate64(leaf->container, leaf->typecode, low32,
+                                 iterator, high32, ptr)) {
+            return false;
+        }
+        art_iterator_next(&it);
+    }
+    return true;
+}
+
+void roaring64_bitmap_to_uint64_array(const roaring64_bitmap_t *r,
+                                      uint64_t *out) {
+    roaring64_iterator_t it;  // gets initialized in the next line
+    roaring64_iterator_init_at(r, &it, /*first=*/true);
+    roaring64_iterator_read(&it, out, UINT64_MAX);
+}
+
+roaring64_iterator_t *roaring64_iterator_create(const roaring64_bitmap_t *r) {
+    roaring64_iterator_t *it =
+        (roaring64_iterator_t *)roaring_malloc(sizeof(roaring64_iterator_t));
+    return roaring64_iterator_init_at(r, it, /*first=*/true);
+}
+
+roaring64_iterator_t *roaring64_iterator_create_last(
+    const roaring64_bitmap_t *r) {
+    roaring64_iterator_t *it =
+        (roaring64_iterator_t *)roaring_malloc(sizeof(roaring64_iterator_t));
+    return roaring64_iterator_init_at(r, it, /*first=*/false);
+}
+
+void roaring64_iterator_reinit(const roaring64_bitmap_t *r,
+                               roaring64_iterator_t *it) {
+    roaring64_iterator_init_at(r, it, /*first=*/true);
+}
+
+void roaring64_iterator_reinit_last(const roaring64_bitmap_t *r,
+                                    roaring64_iterator_t *it) {
+    roaring64_iterator_init_at(r, it, /*first=*/false);
+}
+
+roaring64_iterator_t *roaring64_iterator_copy(const roaring64_iterator_t *it) {
+    roaring64_iterator_t *new_it =
+        (roaring64_iterator_t *)roaring_malloc(sizeof(roaring64_iterator_t));
+    memcpy(new_it, it, sizeof(*it));
+    return new_it;
+}
+
+void roaring64_iterator_free(roaring64_iterator_t *it) { roaring_free(it); }
+
+bool roaring64_iterator_has_value(const roaring64_iterator_t *it) {
+    return it->has_value;
+}
+
+uint64_t roaring64_iterator_value(const roaring64_iterator_t *it) {
+    return it->value;
+}
+
+bool roaring64_iterator_advance(roaring64_iterator_t *it) {
+    if (it->art_it.value == NULL) {
+        if (it->saturated_forward) {
+            return (it->has_value = false);
+        }
+        roaring64_iterator_init_at(it->parent, it, /*first=*/true);
+        return it->has_value;
+    }
+    leaf_t *leaf = (leaf_t *)it->art_it.value;
+    uint16_t low16 = (uint16_t)it->value;
+    if (container_iterator_next(leaf->container, leaf->typecode,
+                                &it->container_it, &low16)) {
+        it->value = it->high48 | low16;
+        return (it->has_value = true);
+    }
+    if (art_iterator_next(&it->art_it)) {
+        return roaring64_iterator_init_at_leaf_first(it);
+    }
+    it->saturated_forward = true;
+    return (it->has_value = false);
+}
+
+bool roaring64_iterator_previous(roaring64_iterator_t *it) {
+    if (it->art_it.value == NULL) {
+        if (!it->saturated_forward) {
+            // Saturated backward.
+            return (it->has_value = false);
+        }
+        roaring64_iterator_init_at(it->parent, it, /*first=*/false);
+        return it->has_value;
+    }
+    leaf_t *leaf = (leaf_t *)it->art_it.value;
+    uint16_t low16 = (uint16_t)it->value;
+    if (container_iterator_prev(leaf->container, leaf->typecode,
+                                &it->container_it, &low16)) {
+        it->value = it->high48 | low16;
+        return (it->has_value = true);
+    }
+    if (art_iterator_prev(&it->art_it)) {
+        return roaring64_iterator_init_at_leaf_last(it);
+    }
+    it->saturated_forward = false;  // Saturated backward.
+    return (it->has_value = false);
+}
+
+bool roaring64_iterator_move_equalorlarger(roaring64_iterator_t *it,
+                                           uint64_t val) {
+    uint8_t val_high48[ART_KEY_BYTES];
+    uint16_t val_low16 = split_key(val, val_high48);
+    if (!it->has_value || it->high48 != (val & 0xFFFFFFFFFFFF0000)) {
+        // The ART iterator is before or after the high48 bits of `val` (or
+        // beyond the ART altogether), so we need to move to a leaf with a key
+        // equal or greater.
+        if (!art_iterator_lower_bound(&it->art_it, val_high48)) {
+            // Only smaller keys found.
+            it->saturated_forward = true;
+            return (it->has_value = false);
+        }
+        it->high48 = combine_key(it->art_it.key, 0);
+        // Fall through to the next if statement.
+    }
+
+    if (it->high48 == (val & 0xFFFFFFFFFFFF0000)) {
+        // We're at equal high bits, check if a suitable value can be found in
+        // this container.
+        leaf_t *leaf = (leaf_t *)it->art_it.value;
+        uint16_t low16 = (uint16_t)it->value;
+        if (container_iterator_lower_bound(leaf->container, leaf->typecode,
+                                           &it->container_it, &low16,
+                                           val_low16)) {
+            it->value = it->high48 | low16;
+            return (it->has_value = true);
+        }
+        // Only smaller entries in this container, move to the next.
+        if (!art_iterator_next(&it->art_it)) {
+            it->saturated_forward = true;
+            return (it->has_value = false);
+        }
+    }
+
+    // We're at a leaf with high bits greater than `val`, so the first entry in
+    // this container is our result.
+    return roaring64_iterator_init_at_leaf_first(it);
+}
+
+uint64_t roaring64_iterator_read(roaring64_iterator_t *it, uint64_t *buf,
+                                 uint64_t count) {
+    uint64_t consumed = 0;
+    while (it->has_value && consumed < count) {
+        uint32_t container_consumed;
+        leaf_t *leaf = (leaf_t *)it->art_it.value;
+        uint16_t low16 = (uint16_t)it->value;
+        uint32_t container_count = UINT32_MAX;
+        if (count - consumed < (uint64_t)UINT32_MAX) {
+            container_count = count - consumed;
+        }
+        bool has_value = container_iterator_read_into_uint64(
+            leaf->container, leaf->typecode, &it->container_it, it->high48, buf,
+            container_count, &container_consumed, &low16);
+        consumed += container_consumed;
+        buf += container_consumed;
+        if (has_value) {
+            it->has_value = true;
+            it->value = it->high48 | low16;
+            assert(consumed == count);
+            return consumed;
+        }
+        it->has_value = art_iterator_next(&it->art_it);
+        if (it->has_value) {
+            roaring64_iterator_init_at_leaf_first(it);
+        }
+    }
+    return consumed;
+}
+
+#ifdef __cplusplus
+}  // extern "C"
+}  // namespace roaring
+}  // namespace api
+#endif
+/* end file src/roaring64.c */
+/* begin file src/roaring_array.c */
+#include <assert.h>
+#include <inttypes.h>
+#include <stdbool.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace internal {
+#endif
+
+// Convention: [0,ra->size) all elements are initialized
+//  [ra->size, ra->allocation_size) is junk and contains nothing needing freeing
+
+extern inline int32_t ra_get_size(const roaring_array_t *ra);
+extern inline int32_t ra_get_index(const roaring_array_t *ra, uint16_t x);
+
+extern inline container_t *ra_get_container_at_index(const roaring_array_t *ra,
+                                                     uint16_t i,
+                                                     uint8_t *typecode);
+
+extern inline void ra_unshare_container_at_index(roaring_array_t *ra,
+                                                 uint16_t i);
+
+extern inline void ra_replace_key_and_container_at_index(roaring_array_t *ra,
+                                                         int32_t i,
+                                                         uint16_t key,
+                                                         container_t *c,
+                                                         uint8_t typecode);
+
+extern inline void ra_set_container_at_index(const roaring_array_t *ra,
+                                             int32_t i, container_t *c,
+                                             uint8_t typecode);
+
+static bool realloc_array(roaring_array_t *ra, int32_t new_capacity) {
+    //
+    // Note: not implemented using C's realloc(), because the memory layout is
+    // Struct-of-Arrays vs. Array-of-Structs:
+    // https://github.com/RoaringBitmap/CRoaring/issues/256
+
+    if (new_capacity == 0) {
+        roaring_free(ra->containers);
+        ra->containers = NULL;
+        ra->keys = NULL;
+        ra->typecodes = NULL;
+        ra->allocation_size = 0;
+        return true;
+    }
+    const size_t memoryneeded =
+        new_capacity *
+        (sizeof(uint16_t) + sizeof(container_t *) + sizeof(uint8_t));
+    void *bigalloc = roaring_malloc(memoryneeded);
+    if (!bigalloc) return false;
+    void *oldbigalloc = ra->containers;
+    container_t **newcontainers = (container_t **)bigalloc;
+    uint16_t *newkeys = (uint16_t *)(newcontainers + new_capacity);
+    uint8_t *newtypecodes = (uint8_t *)(newkeys + new_capacity);
+    assert((char *)(newtypecodes + new_capacity) ==
+           (char *)bigalloc + memoryneeded);
+    if (ra->size > 0) {
+        memcpy(newcontainers, ra->containers, sizeof(container_t *) * ra->size);
+        memcpy(newkeys, ra->keys, sizeof(uint16_t) * ra->size);
+        memcpy(newtypecodes, ra->typecodes, sizeof(uint8_t) * ra->size);
+    }
+    ra->containers = newcontainers;
+    ra->keys = newkeys;
+    ra->typecodes = newtypecodes;
+    ra->allocation_size = new_capacity;
+    roaring_free(oldbigalloc);
+    return true;
+}
+
+bool ra_init_with_capacity(roaring_array_t *new_ra, uint32_t cap) {
+    if (!new_ra) return false;
+    ra_init(new_ra);
+
+    // Containers hold 64Ki elements, so 64Ki containers is enough to hold
+    // `0x10000 * 0x10000` (all 2^32) elements
+    if (cap > 0x10000) {
+        cap = 0x10000;
+    }
+
+    if (cap > 0) {
+        void *bigalloc = roaring_malloc(
+            cap * (sizeof(uint16_t) + sizeof(container_t *) + sizeof(uint8_t)));
+        if (bigalloc == NULL) return false;
+        new_ra->containers = (container_t **)bigalloc;
+        new_ra->keys = (uint16_t *)(new_ra->containers + cap);
+        new_ra->typecodes = (uint8_t *)(new_ra->keys + cap);
+        // Narrowing is safe because of above check
+        new_ra->allocation_size = (int32_t)cap;
+    }
+    return true;
+}
+
+int ra_shrink_to_fit(roaring_array_t *ra) {
+    int savings = (ra->allocation_size - ra->size) *
+                  (sizeof(uint16_t) + sizeof(container_t *) + sizeof(uint8_t));
+    if (!realloc_array(ra, ra->size)) {
+        return 0;
+    }
+    ra->allocation_size = ra->size;
+    return savings;
+}
+
+void ra_init(roaring_array_t *new_ra) {
+    if (!new_ra) {
+        return;
+    }
+    new_ra->keys = NULL;
+    new_ra->containers = NULL;
+    new_ra->typecodes = NULL;
+
+    new_ra->allocation_size = 0;
+    new_ra->size = 0;
+    new_ra->flags = 0;
+}
+
+bool ra_overwrite(const roaring_array_t *source, roaring_array_t *dest,
+                  bool copy_on_write) {
+    ra_clear_containers(dest);  // we are going to overwrite them
+    if (source->size == 0) {    // Note: can't call memcpy(NULL), even w/size
+        dest->size = 0;         // <--- This is important.
+        return true;            // output was just cleared, so they match
+    }
+    if (dest->allocation_size < source->size) {
+        if (!realloc_array(dest, source->size)) {
+            return false;
+        }
+    }
+    dest->size = source->size;
+    memcpy(dest->keys, source->keys, dest->size * sizeof(uint16_t));
+    // we go through the containers, turning them into shared containers...
+    if (copy_on_write) {
+        for (int32_t i = 0; i < dest->size; ++i) {
+            source->containers[i] = get_copy_of_container(
+                source->containers[i], &source->typecodes[i], copy_on_write);
+        }
+        // we do a shallow copy to the other bitmap
+        memcpy(dest->containers, source->containers,
+               dest->size * sizeof(container_t *));
+        memcpy(dest->typecodes, source->typecodes,
+               dest->size * sizeof(uint8_t));
+    } else {
+        memcpy(dest->typecodes, source->typecodes,
+               dest->size * sizeof(uint8_t));
+        for (int32_t i = 0; i < dest->size; i++) {
+            dest->containers[i] =
+                container_clone(source->containers[i], source->typecodes[i]);
+            if (dest->containers[i] == NULL) {
+                for (int32_t j = 0; j < i; j++) {
+                    container_free(dest->containers[j], dest->typecodes[j]);
+                }
+                ra_clear_without_containers(dest);
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+void ra_clear_containers(roaring_array_t *ra) {
+    for (int32_t i = 0; i < ra->size; ++i) {
+        container_free(ra->containers[i], ra->typecodes[i]);
+    }
+}
+
+void ra_reset(roaring_array_t *ra) {
+    ra_clear_containers(ra);
+    ra->size = 0;
+    ra_shrink_to_fit(ra);
+}
+
+void ra_clear_without_containers(roaring_array_t *ra) {
+    roaring_free(
+        ra->containers);  // keys and typecodes are allocated with containers
+    ra->size = 0;
+    ra->allocation_size = 0;
+    ra->containers = NULL;
+    ra->keys = NULL;
+    ra->typecodes = NULL;
+}
+
+void ra_clear(roaring_array_t *ra) {
+    ra_clear_containers(ra);
+    ra_clear_without_containers(ra);
+}
+
+bool extend_array(roaring_array_t *ra, int32_t k) {
+    int32_t desired_size = ra->size + k;
+    const int32_t max_containers = 65536;
+    assert(desired_size <= max_containers);
+    if (desired_size > ra->allocation_size) {
+        int32_t new_capacity =
+            (ra->size < 1024) ? 2 * desired_size : 5 * desired_size / 4;
+        if (new_capacity > max_containers) {
+            new_capacity = max_containers;
+        }
+
+        return realloc_array(ra, new_capacity);
+    }
+    return true;
+}
+
+void ra_append(roaring_array_t *ra, uint16_t key, container_t *c,
+               uint8_t typecode) {
+    extend_array(ra, 1);
+    const int32_t pos = ra->size;
+
+    ra->keys[pos] = key;
+    ra->containers[pos] = c;
+    ra->typecodes[pos] = typecode;
+    ra->size++;
+}
+
+void ra_append_copy(roaring_array_t *ra, const roaring_array_t *sa,
+                    uint16_t index, bool copy_on_write) {
+    extend_array(ra, 1);
+    const int32_t pos = ra->size;
+
+    // old contents is junk that does not need freeing
+    ra->keys[pos] = sa->keys[index];
+    // the shared container will be in two bitmaps
+    if (copy_on_write) {
+        sa->containers[index] = get_copy_of_container(
+            sa->containers[index], &sa->typecodes[index], copy_on_write);
+        ra->containers[pos] = sa->containers[index];
+        ra->typecodes[pos] = sa->typecodes[index];
+    } else {
+        ra->containers[pos] =
+            container_clone(sa->containers[index], sa->typecodes[index]);
+        ra->typecodes[pos] = sa->typecodes[index];
+    }
+    ra->size++;
+}
+
+void ra_append_copies_until(roaring_array_t *ra, const roaring_array_t *sa,
+                            uint16_t stopping_key, bool copy_on_write) {
+    for (int32_t i = 0; i < sa->size; ++i) {
+        if (sa->keys[i] >= stopping_key) break;
+        ra_append_copy(ra, sa, (uint16_t)i, copy_on_write);
+    }
+}
+
+void ra_append_copy_range(roaring_array_t *ra, const roaring_array_t *sa,
+                          int32_t start_index, int32_t end_index,
+                          bool copy_on_write) {
+    extend_array(ra, end_index - start_index);
+    for (int32_t i = start_index; i < end_index; ++i) {
+        const int32_t pos = ra->size;
+        ra->keys[pos] = sa->keys[i];
+        if (copy_on_write) {
+            sa->containers[i] = get_copy_of_container(
+                sa->containers[i], &sa->typecodes[i], copy_on_write);
+            ra->containers[pos] = sa->containers[i];
+            ra->typecodes[pos] = sa->typecodes[i];
+        } else {
+            ra->containers[pos] =
+                container_clone(sa->containers[i], sa->typecodes[i]);
+            ra->typecodes[pos] = sa->typecodes[i];
+        }
+        ra->size++;
+    }
+}
+
+void ra_append_copies_after(roaring_array_t *ra, const roaring_array_t *sa,
+                            uint16_t before_start, bool copy_on_write) {
+    int start_location = ra_get_index(sa, before_start);
+    if (start_location >= 0)
+        ++start_location;
+    else
+        start_location = -start_location - 1;
+    ra_append_copy_range(ra, sa, start_location, sa->size, copy_on_write);
+}
+
+void ra_append_move_range(roaring_array_t *ra, roaring_array_t *sa,
+                          int32_t start_index, int32_t end_index) {
+    extend_array(ra, end_index - start_index);
+
+    for (int32_t i = start_index; i < end_index; ++i) {
+        const int32_t pos = ra->size;
+
+        ra->keys[pos] = sa->keys[i];
+        ra->containers[pos] = sa->containers[i];
+        ra->typecodes[pos] = sa->typecodes[i];
+        ra->size++;
+    }
+}
+
+void ra_append_range(roaring_array_t *ra, roaring_array_t *sa,
+                     int32_t start_index, int32_t end_index,
+                     bool copy_on_write) {
+    extend_array(ra, end_index - start_index);
+
+    for (int32_t i = start_index; i < end_index; ++i) {
+        const int32_t pos = ra->size;
+        ra->keys[pos] = sa->keys[i];
+        if (copy_on_write) {
+            sa->containers[i] = get_copy_of_container(
+                sa->containers[i], &sa->typecodes[i], copy_on_write);
+            ra->containers[pos] = sa->containers[i];
+            ra->typecodes[pos] = sa->typecodes[i];
+        } else {
+            ra->containers[pos] =
+                container_clone(sa->containers[i], sa->typecodes[i]);
+            ra->typecodes[pos] = sa->typecodes[i];
+        }
+        ra->size++;
+    }
+}
+
+container_t *ra_get_container(roaring_array_t *ra, uint16_t x,
+                              uint8_t *typecode) {
+    int i = binarySearch(ra->keys, (int32_t)ra->size, x);
+    if (i < 0) return NULL;
+    *typecode = ra->typecodes[i];
+    return ra->containers[i];
+}
+
+extern inline container_t *ra_get_container_at_index(const roaring_array_t *ra,
+                                                     uint16_t i,
+                                                     uint8_t *typecode);
+
+extern inline uint16_t ra_get_key_at_index(const roaring_array_t *ra,
+                                           uint16_t i);
+
+extern inline int32_t ra_get_index(const roaring_array_t *ra, uint16_t x);
+
+extern inline int32_t ra_advance_until(const roaring_array_t *ra, uint16_t x,
+                                       int32_t pos);
+
+// everything skipped over is freed
+int32_t ra_advance_until_freeing(roaring_array_t *ra, uint16_t x, int32_t pos) {
+    while (pos < ra->size && ra->keys[pos] < x) {
+        container_free(ra->containers[pos], ra->typecodes[pos]);
+        ++pos;
+    }
+    return pos;
+}
+
+void ra_insert_new_key_value_at(roaring_array_t *ra, int32_t i, uint16_t key,
+                                container_t *c, uint8_t typecode) {
+    extend_array(ra, 1);
+    // May be an optimization opportunity with DIY memmove
+    memmove(&(ra->keys[i + 1]), &(ra->keys[i]),
+            sizeof(uint16_t) * (ra->size - i));
+    memmove(&(ra->containers[i + 1]), &(ra->containers[i]),
+            sizeof(container_t *) * (ra->size - i));
+    memmove(&(ra->typecodes[i + 1]), &(ra->typecodes[i]),
+            sizeof(uint8_t) * (ra->size - i));
+    ra->keys[i] = key;
+    ra->containers[i] = c;
+    ra->typecodes[i] = typecode;
+    ra->size++;
+}
+
+// note: Java routine set things to 0, enabling GC.
+// Java called it "resize" but it was always used to downsize.
+// Allowing upsize would break the conventions about
+// valid containers below ra->size.
+
+void ra_downsize(roaring_array_t *ra, int32_t new_length) {
+    assert(new_length <= ra->size);
+    ra->size = new_length;
+}
+
+void ra_remove_at_index(roaring_array_t *ra, int32_t i) {
+    memmove(&(ra->containers[i]), &(ra->containers[i + 1]),
+            sizeof(container_t *) * (ra->size - i - 1));
+    memmove(&(ra->keys[i]), &(ra->keys[i + 1]),
+            sizeof(uint16_t) * (ra->size - i - 1));
+    memmove(&(ra->typecodes[i]), &(ra->typecodes[i + 1]),
+            sizeof(uint8_t) * (ra->size - i - 1));
+    ra->size--;
+}
+
+void ra_remove_at_index_and_free(roaring_array_t *ra, int32_t i) {
+    container_free(ra->containers[i], ra->typecodes[i]);
+    ra_remove_at_index(ra, i);
+}
+
+// used in inplace andNot only, to slide left the containers from
+// the mutated RoaringBitmap that are after the largest container of
+// the argument RoaringBitmap.  In use it should be followed by a call to
+// downsize.
+//
+void ra_copy_range(roaring_array_t *ra, uint32_t begin, uint32_t end,
+                   uint32_t new_begin) {
+    assert(begin <= end);
+    assert(new_begin < begin);
+
+    const int range = end - begin;
+
+    // We ensure to previously have freed overwritten containers
+    // that are not copied elsewhere
+
+    memmove(&(ra->containers[new_begin]), &(ra->containers[begin]),
+            sizeof(container_t *) * range);
+    memmove(&(ra->keys[new_begin]), &(ra->keys[begin]),
+            sizeof(uint16_t) * range);
+    memmove(&(ra->typecodes[new_begin]), &(ra->typecodes[begin]),
+            sizeof(uint8_t) * range);
+}
+
+void ra_shift_tail(roaring_array_t *ra, int32_t count, int32_t distance) {
+    if (distance > 0) {
+        extend_array(ra, distance);
+    }
+    int32_t srcpos = ra->size - count;
+    int32_t dstpos = srcpos + distance;
+    memmove(&(ra->keys[dstpos]), &(ra->keys[srcpos]), sizeof(uint16_t) * count);
+    memmove(&(ra->containers[dstpos]), &(ra->containers[srcpos]),
+            sizeof(container_t *) * count);
+    memmove(&(ra->typecodes[dstpos]), &(ra->typecodes[srcpos]),
+            sizeof(uint8_t) * count);
+    ra->size += distance;
+}
+
+void ra_to_uint32_array(const roaring_array_t *ra, uint32_t *ans) {
+    size_t ctr = 0;
+    for (int32_t i = 0; i < ra->size; ++i) {
+        int num_added = container_to_uint32_array(
+            ans + ctr, ra->containers[i], ra->typecodes[i],
+            ((uint32_t)ra->keys[i]) << 16);
+        ctr += num_added;
+    }
+}
+
+bool ra_range_uint32_array(const roaring_array_t *ra, size_t offset,
+                           size_t limit, uint32_t *ans) {
+    size_t ctr = 0;
+    size_t dtr = 0;
+
+    size_t t_limit = 0;
+
+    bool first = false;
+    size_t first_skip = 0;
+
+    uint32_t *t_ans = NULL;
+    size_t cur_len = 0;
+
+    for (int i = 0; i < ra->size; ++i) {
+        const container_t *c =
+            container_unwrap_shared(ra->containers[i], &ra->typecodes[i]);
+        switch (ra->typecodes[i]) {
+            case BITSET_CONTAINER_TYPE:
+                t_limit = (const_CAST_bitset(c))->cardinality;
+                break;
+            case ARRAY_CONTAINER_TYPE:
+                t_limit = (const_CAST_array(c))->cardinality;
+                break;
+            case RUN_CONTAINER_TYPE:
+                t_limit = run_container_cardinality(const_CAST_run(c));
+                break;
+        }
+        if (ctr + t_limit - 1 >= offset && ctr < offset + limit) {
+            if (!first) {
+                // first_skip = t_limit - (ctr + t_limit - offset);
+                first_skip = offset - ctr;
+                first = true;
+                t_ans = (uint32_t *)roaring_malloc(sizeof(*t_ans) *
+                                                   (first_skip + limit));
+                if (t_ans == NULL) {
+                    return false;
+                }
+                memset(t_ans, 0, sizeof(*t_ans) * (first_skip + limit));
+                cur_len = first_skip + limit;
+            }
+            if (dtr + t_limit > cur_len) {
+                uint32_t *append_ans = (uint32_t *)roaring_malloc(
+                    sizeof(*append_ans) * (cur_len + t_limit));
+                if (append_ans == NULL) {
+                    if (t_ans != NULL) roaring_free(t_ans);
+                    return false;
+                }
+                memset(append_ans, 0,
+                       sizeof(*append_ans) * (cur_len + t_limit));
+                cur_len = cur_len + t_limit;
+                memcpy(append_ans, t_ans, dtr * sizeof(uint32_t));
+                roaring_free(t_ans);
+                t_ans = append_ans;
+            }
+            switch (ra->typecodes[i]) {
+                case BITSET_CONTAINER_TYPE:
+                    container_to_uint32_array(t_ans + dtr, const_CAST_bitset(c),
+                                              ra->typecodes[i],
+                                              ((uint32_t)ra->keys[i]) << 16);
+                    break;
+                case ARRAY_CONTAINER_TYPE:
+                    container_to_uint32_array(t_ans + dtr, const_CAST_array(c),
+                                              ra->typecodes[i],
+                                              ((uint32_t)ra->keys[i]) << 16);
+                    break;
+                case RUN_CONTAINER_TYPE:
+                    container_to_uint32_array(t_ans + dtr, const_CAST_run(c),
+                                              ra->typecodes[i],
+                                              ((uint32_t)ra->keys[i]) << 16);
+                    break;
+            }
+            dtr += t_limit;
+        }
+        ctr += t_limit;
+        if (dtr - first_skip >= limit) break;
+    }
+    if (t_ans != NULL) {
+        memcpy(ans, t_ans + first_skip, limit * sizeof(uint32_t));
+        free(t_ans);
+    }
+    return true;
+}
+
+bool ra_has_run_container(const roaring_array_t *ra) {
+    for (int32_t k = 0; k < ra->size; ++k) {
+        if (get_container_type(ra->containers[k], ra->typecodes[k]) ==
+            RUN_CONTAINER_TYPE)
+            return true;
+    }
+    return false;
+}
+
+uint32_t ra_portable_header_size(const roaring_array_t *ra) {
+    if (ra_has_run_container(ra)) {
+        if (ra->size <
+            NO_OFFSET_THRESHOLD) {  // for small bitmaps, we omit the offsets
+            return 4 + (ra->size + 7) / 8 + 4 * ra->size;
+        }
+        return 4 + (ra->size + 7) / 8 +
+               8 * ra->size;  // - 4 because we pack the size with the cookie
+    } else {
+        return 4 + 4 + 8 * ra->size;
+    }
+}
+
+size_t ra_portable_size_in_bytes(const roaring_array_t *ra) {
+    size_t count = ra_portable_header_size(ra);
+
+    for (int32_t k = 0; k < ra->size; ++k) {
+        count += container_size_in_bytes(ra->containers[k], ra->typecodes[k]);
+    }
+    return count;
+}
+
+// This function is endian-sensitive.
+size_t ra_portable_serialize(const roaring_array_t *ra, char *buf) {
+    char *initbuf = buf;
+    uint32_t startOffset = 0;
+    bool hasrun = ra_has_run_container(ra);
+    if (hasrun) {
+        uint32_t cookie = SERIAL_COOKIE | ((uint32_t)(ra->size - 1) << 16);
+        memcpy(buf, &cookie, sizeof(cookie));
+        buf += sizeof(cookie);
+        uint32_t s = (ra->size + 7) / 8;
+        uint8_t *bitmapOfRunContainers = (uint8_t *)roaring_calloc(s, 1);
+        assert(bitmapOfRunContainers != NULL);  // todo: handle
+        for (int32_t i = 0; i < ra->size; ++i) {
+            if (get_container_type(ra->containers[i], ra->typecodes[i]) ==
+                RUN_CONTAINER_TYPE) {
+                bitmapOfRunContainers[i / 8] |= (1 << (i % 8));
+            }
+        }
+        memcpy(buf, bitmapOfRunContainers, s);
+        buf += s;
+        roaring_free(bitmapOfRunContainers);
+        if (ra->size < NO_OFFSET_THRESHOLD) {
+            startOffset = 4 + 4 * ra->size + s;
+        } else {
+            startOffset = 4 + 8 * ra->size + s;
+        }
+    } else {  // backwards compatibility
+        uint32_t cookie = SERIAL_COOKIE_NO_RUNCONTAINER;
+
+        memcpy(buf, &cookie, sizeof(cookie));
+        buf += sizeof(cookie);
+        memcpy(buf, &ra->size, sizeof(ra->size));
+        buf += sizeof(ra->size);
+
+        startOffset = 4 + 4 + 4 * ra->size + 4 * ra->size;
+    }
+    for (int32_t k = 0; k < ra->size; ++k) {
+        memcpy(buf, &ra->keys[k], sizeof(ra->keys[k]));
+        buf += sizeof(ra->keys[k]);
+        // get_cardinality returns a value in [1,1<<16], subtracting one
+        // we get [0,1<<16 - 1] which fits in 16 bits
+        uint16_t card = (uint16_t)(container_get_cardinality(ra->containers[k],
+                                                             ra->typecodes[k]) -
+                                   1);
+        memcpy(buf, &card, sizeof(card));
+        buf += sizeof(card);
+    }
+    if ((!hasrun) || (ra->size >= NO_OFFSET_THRESHOLD)) {
+        // writing the containers offsets
+        for (int32_t k = 0; k < ra->size; k++) {
+            memcpy(buf, &startOffset, sizeof(startOffset));
+            buf += sizeof(startOffset);
+            startOffset =
+                startOffset +
+                container_size_in_bytes(ra->containers[k], ra->typecodes[k]);
+        }
+    }
+    for (int32_t k = 0; k < ra->size; ++k) {
+        buf += container_write(ra->containers[k], ra->typecodes[k], buf);
+    }
+    return buf - initbuf;
+}
+
+// Quickly checks whether there is a serialized bitmap at the pointer,
+// not exceeding size "maxbytes" in bytes. This function does not allocate
+// memory dynamically.
+//
+// This function returns 0 if and only if no valid bitmap is found.
+// Otherwise, it returns how many bytes are occupied.
+//
+size_t ra_portable_deserialize_size(const char *buf, const size_t maxbytes) {
+    size_t bytestotal = sizeof(int32_t);  // for cookie
+    if (bytestotal > maxbytes) return 0;
+    uint32_t cookie;
+    memcpy(&cookie, buf, sizeof(int32_t));
+    buf += sizeof(uint32_t);
+    if ((cookie & 0xFFFF) != SERIAL_COOKIE &&
+        cookie != SERIAL_COOKIE_NO_RUNCONTAINER) {
+        return 0;
+    }
+    int32_t size;
+
+    if ((cookie & 0xFFFF) == SERIAL_COOKIE)
+        size = (cookie >> 16) + 1;
+    else {
+        bytestotal += sizeof(int32_t);
+        if (bytestotal > maxbytes) return 0;
+        memcpy(&size, buf, sizeof(int32_t));
+        buf += sizeof(uint32_t);
+    }
+    if (size > (1 << 16) || size < 0) {
+        return 0;
+    }
+    char *bitmapOfRunContainers = NULL;
+    bool hasrun = (cookie & 0xFFFF) == SERIAL_COOKIE;
+    if (hasrun) {
+        int32_t s = (size + 7) / 8;
+        bytestotal += s;
+        if (bytestotal > maxbytes) return 0;
+        bitmapOfRunContainers = (char *)buf;
+        buf += s;
+    }
+    bytestotal += size * 2 * sizeof(uint16_t);
+    if (bytestotal > maxbytes) return 0;
+    uint16_t *keyscards = (uint16_t *)buf;
+    buf += size * 2 * sizeof(uint16_t);
+    if ((!hasrun) || (size >= NO_OFFSET_THRESHOLD)) {
+        // skipping the offsets
+        bytestotal += size * 4;
+        if (bytestotal > maxbytes) return 0;
+        buf += size * 4;
+    }
+    // Reading the containers
+    for (int32_t k = 0; k < size; ++k) {
+        uint16_t tmp;
+        memcpy(&tmp, keyscards + 2 * k + 1, sizeof(tmp));
+        uint32_t thiscard = tmp + 1;
+        bool isbitmap = (thiscard > DEFAULT_MAX_SIZE);
+        bool isrun = false;
+        if (hasrun) {
+            if ((bitmapOfRunContainers[k / 8] & (1 << (k % 8))) != 0) {
+                isbitmap = false;
+                isrun = true;
+            }
+        }
+        if (isbitmap) {
+            size_t containersize =
+                BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t);
+            bytestotal += containersize;
+            if (bytestotal > maxbytes) return 0;
+            buf += containersize;
+        } else if (isrun) {
+            bytestotal += sizeof(uint16_t);
+            if (bytestotal > maxbytes) return 0;
+            uint16_t n_runs;
+            memcpy(&n_runs, buf, sizeof(uint16_t));
+            buf += sizeof(uint16_t);
+            size_t containersize = n_runs * sizeof(rle16_t);
+            bytestotal += containersize;
+            if (bytestotal > maxbytes) return 0;
+            buf += containersize;
+        } else {
+            size_t containersize = thiscard * sizeof(uint16_t);
+            bytestotal += containersize;
+            if (bytestotal > maxbytes) return 0;
+            buf += containersize;
+        }
+    }
+    return bytestotal;
+}
+
+// This function populates answer from the content of buf (reading up to
+// maxbytes bytes). The function returns false if a properly serialized bitmap
+// cannot be found. If it returns true, readbytes is populated by how many bytes
+// were read, we have that *readbytes <= maxbytes.
+//
+// This function is endian-sensitive.
+bool ra_portable_deserialize(roaring_array_t *answer, const char *buf,
+                             const size_t maxbytes, size_t *readbytes) {
+    *readbytes = sizeof(int32_t);  // for cookie
+    if (*readbytes > maxbytes) {
+        // Ran out of bytes while reading first 4 bytes.
+        return false;
+    }
+    uint32_t cookie;
+    memcpy(&cookie, buf, sizeof(int32_t));
+    buf += sizeof(uint32_t);
+    if ((cookie & 0xFFFF) != SERIAL_COOKIE &&
+        cookie != SERIAL_COOKIE_NO_RUNCONTAINER) {
+        // "I failed to find one of the right cookies.
+        return false;
+    }
+    int32_t size;
+
+    if ((cookie & 0xFFFF) == SERIAL_COOKIE)
+        size = (cookie >> 16) + 1;
+    else {
+        *readbytes += sizeof(int32_t);
+        if (*readbytes > maxbytes) {
+            // Ran out of bytes while reading second part of the cookie.
+            return false;
+        }
+        memcpy(&size, buf, sizeof(int32_t));
+        buf += sizeof(uint32_t);
+    }
+    if (size < 0) {
+        // You cannot have a negative number of containers, the data must be
+        // corrupted.
+        return false;
+    }
+    if (size > (1 << 16)) {
+        // You cannot have so many containers, the data must be corrupted.
+        return false;
+    }
+    const char *bitmapOfRunContainers = NULL;
+    bool hasrun = (cookie & 0xFFFF) == SERIAL_COOKIE;
+    if (hasrun) {
+        int32_t s = (size + 7) / 8;
+        *readbytes += s;
+        if (*readbytes > maxbytes) {  // data is corrupted?
+            // Ran out of bytes while reading run bitmap.
+            return false;
+        }
+        bitmapOfRunContainers = buf;
+        buf += s;
+    }
+    uint16_t *keyscards = (uint16_t *)buf;
+
+    *readbytes += size * 2 * sizeof(uint16_t);
+    if (*readbytes > maxbytes) {
+        // Ran out of bytes while reading key-cardinality array.
+        return false;
+    }
+    buf += size * 2 * sizeof(uint16_t);
+
+    bool is_ok = ra_init_with_capacity(answer, size);
+    if (!is_ok) {
+        // Failed to allocate memory for roaring array. Bailing out.
+        return false;
+    }
+
+    for (int32_t k = 0; k < size; ++k) {
+        uint16_t tmp;
+        memcpy(&tmp, keyscards + 2 * k, sizeof(tmp));
+        answer->keys[k] = tmp;
+    }
+    if ((!hasrun) || (size >= NO_OFFSET_THRESHOLD)) {
+        *readbytes += size * 4;
+        if (*readbytes > maxbytes) {  // data is corrupted?
+            // Ran out of bytes while reading offsets.
+            ra_clear(answer);  // we need to clear the containers already
+                               // allocated, and the roaring array
+            return false;
+        }
+
+        // skipping the offsets
+        buf += size * 4;
+    }
+    // Reading the containers
+    for (int32_t k = 0; k < size; ++k) {
+        uint16_t tmp;
+        memcpy(&tmp, keyscards + 2 * k + 1, sizeof(tmp));
+        uint32_t thiscard = tmp + 1;
+        bool isbitmap = (thiscard > DEFAULT_MAX_SIZE);
+        bool isrun = false;
+        if (hasrun) {
+            if ((bitmapOfRunContainers[k / 8] & (1 << (k % 8))) != 0) {
+                isbitmap = false;
+                isrun = true;
+            }
+        }
+        if (isbitmap) {
+            // we check that the read is allowed
+            size_t containersize =
+                BITSET_CONTAINER_SIZE_IN_WORDS * sizeof(uint64_t);
+            *readbytes += containersize;
+            if (*readbytes > maxbytes) {
+                // Running out of bytes while reading a bitset container.
+                ra_clear(answer);  // we need to clear the containers already
+                                   // allocated, and the roaring array
+                return false;
+            }
+            // it is now safe to read
+            bitset_container_t *c = bitset_container_create();
+            if (c == NULL) {  // memory allocation failure
+                // Failed to allocate memory for a bitset container.
+                ra_clear(answer);  // we need to clear the containers already
+                                   // allocated, and the roaring array
+                return false;
+            }
+            answer->size++;
+            buf += bitset_container_read(thiscard, c, buf);
+            answer->containers[k] = c;
+            answer->typecodes[k] = BITSET_CONTAINER_TYPE;
+        } else if (isrun) {
+            // we check that the read is allowed
+            *readbytes += sizeof(uint16_t);
+            if (*readbytes > maxbytes) {
+                // Running out of bytes while reading a run container (header).
+                ra_clear(answer);  // we need to clear the containers already
+                                   // allocated, and the roaring array
+                return false;
+            }
+            uint16_t n_runs;
+            memcpy(&n_runs, buf, sizeof(uint16_t));
+            size_t containersize = n_runs * sizeof(rle16_t);
+            *readbytes += containersize;
+            if (*readbytes > maxbytes) {  // data is corrupted?
+                // Running out of bytes while reading a run container.
+                ra_clear(answer);  // we need to clear the containers already
+                                   // allocated, and the roaring array
+                return false;
+            }
+            // it is now safe to read
+
+            run_container_t *c = run_container_create();
+            if (c == NULL) {  // memory allocation failure
+                // Failed to allocate memory for a run container.
+                ra_clear(answer);  // we need to clear the containers already
+                                   // allocated, and the roaring array
+                return false;
+            }
+            answer->size++;
+            buf += run_container_read(thiscard, c, buf);
+            answer->containers[k] = c;
+            answer->typecodes[k] = RUN_CONTAINER_TYPE;
+        } else {
+            // we check that the read is allowed
+            size_t containersize = thiscard * sizeof(uint16_t);
+            *readbytes += containersize;
+            if (*readbytes > maxbytes) {  // data is corrupted?
+                // Running out of bytes while reading an array container.
+                ra_clear(answer);  // we need to clear the containers already
+                                   // allocated, and the roaring array
+                return false;
+            }
+            // it is now safe to read
+            array_container_t *c =
+                array_container_create_given_capacity(thiscard);
+            if (c == NULL) {  // memory allocation failure
+                // Failed to allocate memory for an array container.
+                ra_clear(answer);  // we need to clear the containers already
+                                   // allocated, and the roaring array
+                return false;
+            }
+            answer->size++;
+            buf += array_container_read(thiscard, c, buf);
+            answer->containers[k] = c;
+            answer->typecodes[k] = ARRAY_CONTAINER_TYPE;
+        }
+    }
+    return true;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace internal {
+#endif
+/* end file src/roaring_array.c */
+/* begin file src/roaring_priority_queue.c */
+
+#ifdef __cplusplus
+using namespace ::roaring::internal;
+
+extern "C" {
+namespace roaring {
+namespace api {
+#endif
+
+struct roaring_pq_element_s {
+    uint64_t size;
+    bool is_temporary;
+    roaring_bitmap_t *bitmap;
+};
+
+typedef struct roaring_pq_element_s roaring_pq_element_t;
+
+struct roaring_pq_s {
+    roaring_pq_element_t *elements;
+    uint64_t size;
+};
+
+typedef struct roaring_pq_s roaring_pq_t;
+
+static inline bool compare(roaring_pq_element_t *t1, roaring_pq_element_t *t2) {
+    return t1->size < t2->size;
+}
+
+static void pq_add(roaring_pq_t *pq, roaring_pq_element_t *t) {
+    uint64_t i = pq->size;
+    pq->elements[pq->size++] = *t;
+    while (i > 0) {
+        uint64_t p = (i - 1) >> 1;
+        roaring_pq_element_t ap = pq->elements[p];
+        if (!compare(t, &ap)) break;
+        pq->elements[i] = ap;
+        i = p;
+    }
+    pq->elements[i] = *t;
+}
+
+static void pq_free(roaring_pq_t *pq) { roaring_free(pq); }
+
+static void percolate_down(roaring_pq_t *pq, uint32_t i) {
+    uint32_t size = (uint32_t)pq->size;
+    uint32_t hsize = size >> 1;
+    roaring_pq_element_t ai = pq->elements[i];
+    while (i < hsize) {
+        uint32_t l = (i << 1) + 1;
+        uint32_t r = l + 1;
+        roaring_pq_element_t bestc = pq->elements[l];
+        if (r < size) {
+            if (compare(pq->elements + r, &bestc)) {
+                l = r;
+                bestc = pq->elements[r];
+            }
+        }
+        if (!compare(&bestc, &ai)) {
+            break;
+        }
+        pq->elements[i] = bestc;
+        i = l;
+    }
+    pq->elements[i] = ai;
+}
+
+static roaring_pq_t *create_pq(const roaring_bitmap_t **arr, uint32_t length) {
+    size_t alloc_size =
+        sizeof(roaring_pq_t) + sizeof(roaring_pq_element_t) * length;
+    roaring_pq_t *answer = (roaring_pq_t *)roaring_malloc(alloc_size);
+    answer->elements = (roaring_pq_element_t *)(answer + 1);
+    answer->size = length;
+    for (uint32_t i = 0; i < length; i++) {
+        answer->elements[i].bitmap = (roaring_bitmap_t *)arr[i];
+        answer->elements[i].is_temporary = false;
+        answer->elements[i].size =
+            roaring_bitmap_portable_size_in_bytes(arr[i]);
+    }
+    for (int32_t i = (length >> 1); i >= 0; i--) {
+        percolate_down(answer, i);
+    }
+    return answer;
+}
+
+static roaring_pq_element_t pq_poll(roaring_pq_t *pq) {
+    roaring_pq_element_t ans = *pq->elements;
+    if (pq->size > 1) {
+        pq->elements[0] = pq->elements[--pq->size];
+        percolate_down(pq, 0);
+    } else
+        --pq->size;
+    // memmove(pq->elements,pq->elements+1,(pq->size-1)*sizeof(roaring_pq_element_t));--pq->size;
+    return ans;
+}
+
+// this function consumes and frees the inputs
+static roaring_bitmap_t *lazy_or_from_lazy_inputs(roaring_bitmap_t *x1,
+                                                  roaring_bitmap_t *x2) {
+    uint8_t result_type = 0;
+    const int length1 = ra_get_size(&x1->high_low_container),
+              length2 = ra_get_size(&x2->high_low_container);
+    if (0 == length1) {
+        roaring_bitmap_free(x1);
+        return x2;
+    }
+    if (0 == length2) {
+        roaring_bitmap_free(x2);
+        return x1;
+    }
+    uint32_t neededcap = length1 > length2 ? length2 : length1;
+    roaring_bitmap_t *answer = roaring_bitmap_create_with_capacity(neededcap);
+    int pos1 = 0, pos2 = 0;
+    uint8_t type1, type2;
+    uint16_t s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+    uint16_t s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+    while (true) {
+        if (s1 == s2) {
+            // todo: unsharing can be inefficient as it may create a clone where
+            // none
+            // is needed, but it has the benefit of being easy to reason about.
+
+            ra_unshare_container_at_index(&x1->high_low_container,
+                                          (uint16_t)pos1);
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            assert(type1 != SHARED_CONTAINER_TYPE);
+
+            ra_unshare_container_at_index(&x2->high_low_container,
+                                          (uint16_t)pos2);
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            assert(type2 != SHARED_CONTAINER_TYPE);
+
+            container_t *c;
+
+            if ((type2 == BITSET_CONTAINER_TYPE) &&
+                (type1 != BITSET_CONTAINER_TYPE)) {
+                c = container_lazy_ior(c2, type2, c1, type1, &result_type);
+                container_free(c1, type1);
+                if (c != c2) {
+                    container_free(c2, type2);
+                }
+            } else {
+                c = container_lazy_ior(c1, type1, c2, type2, &result_type);
+                container_free(c2, type2);
+                if (c != c1) {
+                    container_free(c1, type1);
+                }
+            }
+            // since we assume that the initial containers are non-empty, the
+            // result here
+            // can only be non-empty
+            ra_append(&answer->high_low_container, s1, c, result_type);
+            ++pos1;
+            ++pos2;
+            if (pos1 == length1) break;
+            if (pos2 == length2) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+
+        } else if (s1 < s2) {  // s1 < s2
+            container_t *c1 = ra_get_container_at_index(&x1->high_low_container,
+                                                        (uint16_t)pos1, &type1);
+            ra_append(&answer->high_low_container, s1, c1, type1);
+            pos1++;
+            if (pos1 == length1) break;
+            s1 = ra_get_key_at_index(&x1->high_low_container, (uint16_t)pos1);
+
+        } else {  // s1 > s2
+            container_t *c2 = ra_get_container_at_index(&x2->high_low_container,
+                                                        (uint16_t)pos2, &type2);
+            ra_append(&answer->high_low_container, s2, c2, type2);
+            pos2++;
+            if (pos2 == length2) break;
+            s2 = ra_get_key_at_index(&x2->high_low_container, (uint16_t)pos2);
+        }
+    }
+    if (pos1 == length1) {
+        ra_append_move_range(&answer->high_low_container,
+                             &x2->high_low_container, pos2, length2);
+    } else if (pos2 == length2) {
+        ra_append_move_range(&answer->high_low_container,
+                             &x1->high_low_container, pos1, length1);
+    }
+    ra_clear_without_containers(&x1->high_low_container);
+    ra_clear_without_containers(&x2->high_low_container);
+    roaring_free(x1);
+    roaring_free(x2);
+    return answer;
+}
+
+/**
+ * Compute the union of 'number' bitmaps using a heap. This can
+ * sometimes be faster than roaring_bitmap_or_many which uses
+ * a naive algorithm. Caller is responsible for freeing the
+ * result.
+ */
+roaring_bitmap_t *roaring_bitmap_or_many_heap(uint32_t number,
+                                              const roaring_bitmap_t **x) {
+    if (number == 0) {
+        return roaring_bitmap_create();
+    }
+    if (number == 1) {
+        return roaring_bitmap_copy(x[0]);
+    }
+    roaring_pq_t *pq = create_pq(x, number);
+    while (pq->size > 1) {
+        roaring_pq_element_t x1 = pq_poll(pq);
+        roaring_pq_element_t x2 = pq_poll(pq);
+
+        if (x1.is_temporary && x2.is_temporary) {
+            roaring_bitmap_t *newb =
+                lazy_or_from_lazy_inputs(x1.bitmap, x2.bitmap);
+            // should normally return a fresh new bitmap *except* that
+            // it can return x1.bitmap or x2.bitmap in degenerate cases
+            bool temporary = !((newb == x1.bitmap) && (newb == x2.bitmap));
+            uint64_t bsize = roaring_bitmap_portable_size_in_bytes(newb);
+            roaring_pq_element_t newelement = {
+                .size = bsize, .is_temporary = temporary, .bitmap = newb};
+            pq_add(pq, &newelement);
+        } else if (x2.is_temporary) {
+            roaring_bitmap_lazy_or_inplace(x2.bitmap, x1.bitmap, false);
+            x2.size = roaring_bitmap_portable_size_in_bytes(x2.bitmap);
+            pq_add(pq, &x2);
+        } else if (x1.is_temporary) {
+            roaring_bitmap_lazy_or_inplace(x1.bitmap, x2.bitmap, false);
+            x1.size = roaring_bitmap_portable_size_in_bytes(x1.bitmap);
+
+            pq_add(pq, &x1);
+        } else {
+            roaring_bitmap_t *newb =
+                roaring_bitmap_lazy_or(x1.bitmap, x2.bitmap, false);
+            uint64_t bsize = roaring_bitmap_portable_size_in_bytes(newb);
+            roaring_pq_element_t newelement = {
+                .size = bsize, .is_temporary = true, .bitmap = newb};
+
+            pq_add(pq, &newelement);
+        }
+    }
+    roaring_pq_element_t X = pq_poll(pq);
+    roaring_bitmap_t *answer = X.bitmap;
+    roaring_bitmap_repair_after_lazy(answer);
+    pq_free(pq);
+    return answer;
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace api {
+#endif
+/* end file src/roaring_priority_queue.c */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/roaring.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/roaring.h
new file mode 100644
index 0000000000..822d64f214
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/roaring.h
@@ -0,0 +1,3013 @@
+// !!! DO NOT EDIT - THIS IS AN AUTO-GENERATED FILE !!!
+// Created by amalgamation.sh on 2024-09-21T13:18:57Z
+
+/*
+ * The CRoaring project is under a dual license (Apache/MIT).
+ * Users of the library may choose one or the other license.
+ */
+/*
+ * Copyright 2016-2022 The CRoaring authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *    http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ *
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/*
+ * MIT License
+ *
+ * Copyright 2016-2022 The CRoaring authors
+ *
+ * Permission is hereby granted, free of charge, to any
+ * person obtaining a copy of this software and associated
+ * documentation files (the "Software"), to deal in the
+ * Software without restriction, including without
+ * limitation the rights to use, copy, modify, merge,
+ * publish, distribute, sublicense, and/or sell copies of
+ * the Software, and to permit persons to whom the Software
+ * is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice
+ * shall be included in all copies or substantial portions
+ * of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ * ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+ * TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+ * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+ * SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+ * IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+ * DEALINGS IN THE SOFTWARE.
+ *
+ * SPDX-License-Identifier: MIT
+ */
+
+/* begin file include/roaring/roaring_version.h */
+// clang-format off
+// /include/roaring/roaring_version.h automatically generated by release.py, do not change by hand
+#ifndef ROARING_INCLUDE_ROARING_VERSION
+#define ROARING_INCLUDE_ROARING_VERSION
+#define ROARING_VERSION "4.1.7"
+enum {
+    ROARING_VERSION_MAJOR = 4,
+    ROARING_VERSION_MINOR = 1,
+    ROARING_VERSION_REVISION = 7
+};
+#endif // ROARING_INCLUDE_ROARING_VERSION
+// clang-format on/* end file include/roaring/roaring_version.h */
+/* begin file include/roaring/portability.h */
+/*
+ * portability.h
+ *
+ */
+
+/**
+ * All macros should be prefixed with either CROARING or ROARING.
+ * The library uses both ROARING_...
+ * as well as CROAIRING_ as prefixes. The ROARING_ prefix is for
+ * macros that are provided by the build system or that are closely
+ * related to the format. The header macros may also use ROARING_.
+ * The CROARING_ prefix is for internal macros that a user is unlikely
+ * to ever interact with.
+ */
+
+#ifndef CROARING_INCLUDE_PORTABILITY_H_
+#define CROARING_INCLUDE_PORTABILITY_H_
+
+#ifndef _GNU_SOURCE
+#define _GNU_SOURCE 1
+#endif  // _GNU_SOURCE
+#ifndef __STDC_FORMAT_MACROS
+#define __STDC_FORMAT_MACROS 1
+#endif  // __STDC_FORMAT_MACROS
+
+#ifdef _MSC_VER
+#define CROARING_VISUAL_STUDIO 1
+/**
+ * We want to differentiate carefully between
+ * clang under visual studio and regular visual
+ * studio.
+ */
+#ifdef __clang__
+// clang under visual studio
+#define CROARING_CLANG_VISUAL_STUDIO 1
+#else
+// just regular visual studio (best guess)
+#define CROARING_REGULAR_VISUAL_STUDIO 1
+#endif  // __clang__
+#endif  // _MSC_VER
+#ifndef CROARING_VISUAL_STUDIO
+#define CROARING_VISUAL_STUDIO 0
+#endif
+#ifndef CROARING_CLANG_VISUAL_STUDIO
+#define CROARING_CLANG_VISUAL_STUDIO 0
+#endif
+#ifndef CROARING_REGULAR_VISUAL_STUDIO
+#define CROARING_REGULAR_VISUAL_STUDIO 0
+#endif
+
+#if defined(_POSIX_C_SOURCE) && (_POSIX_C_SOURCE < 200809L)
+#undef _POSIX_C_SOURCE
+#endif
+
+#ifndef _POSIX_C_SOURCE
+#define _POSIX_C_SOURCE 200809L
+#endif  // !(defined(_POSIX_C_SOURCE)) || (_POSIX_C_SOURCE < 200809L)
+#if !(defined(_XOPEN_SOURCE)) || (_XOPEN_SOURCE < 700)
+#define _XOPEN_SOURCE 700
+#endif  // !(defined(_XOPEN_SOURCE)) || (_XOPEN_SOURCE < 700)
+
+#ifdef __illumos__
+#define __EXTENSIONS__
+#endif
+
+#include <stdbool.h>
+#include <stdint.h>
+#include <stdlib.h>  // will provide posix_memalign with _POSIX_C_SOURCE as defined above
+#ifdef __GLIBC__
+#include <malloc.h>  // this should never be needed but there are some reports that it is needed.
+#endif
+
+#ifdef __cplusplus
+extern "C" {  // portability definitions are in global scope, not a namespace
+#endif
+
+#if defined(__SIZEOF_LONG_LONG__) && __SIZEOF_LONG_LONG__ != 8
+#error This code assumes  64-bit long longs (by use of the GCC intrinsics). Your system is not currently supported.
+#endif
+
+#if CROARING_REGULAR_VISUAL_STUDIO
+#ifndef __restrict__
+#define __restrict__ __restrict
+#endif  // __restrict__
+#endif  // CROARING_REGULAR_VISUAL_STUDIO
+
+#if defined(__x86_64__) || defined(_M_X64)
+// we have an x64 processor
+#define CROARING_IS_X64 1
+
+#if defined(_MSC_VER) && (_MSC_VER < 1910)
+// Old visual studio systems won't support AVX2 well.
+#undef CROARING_IS_X64
+#endif
+
+#if defined(__clang_major__) && (__clang_major__ <= 8) && !defined(__AVX2__)
+// Older versions of clang have a bug affecting us
+// https://stackoverflow.com/questions/57228537/how-does-one-use-pragma-clang-attribute-push-with-c-namespaces
+#undef CROARING_IS_X64
+#endif
+
+#ifdef ROARING_DISABLE_X64
+#undef CROARING_IS_X64
+#endif
+// we include the intrinsic header
+#if !CROARING_REGULAR_VISUAL_STUDIO
+/* Non-Microsoft C/C++-compatible compiler */
+#include <x86intrin.h>  // on some recent GCC, this will declare posix_memalign
+
+#if CROARING_CLANG_VISUAL_STUDIO
+
+/**
+ * You are not supposed, normally, to include these
+ * headers directly. Instead you should either include intrin.h
+ * or x86intrin.h. However, when compiling with clang
+ * under Windows (i.e., when _MSC_VER is set), these headers
+ * only get included *if* the corresponding features are detected
+ * from macros:
+ * e.g., if __AVX2__ is set... in turn,  we normally set these
+ * macros by compiling against the corresponding architecture
+ * (e.g., arch:AVX2, -mavx2, etc.) which compiles the whole
+ * software with these advanced instructions. These headers would
+ * normally guard against such usage, but we carefully included
+ * <x86intrin.h>  (or <intrin.h>) before, so the headers
+ * are fooled.
+ */
+// To avoid reordering imports:
+// clang-format off
+#include <bmiintrin.h>   // for _blsr_u64
+#include <lzcntintrin.h> // for  __lzcnt64
+#include <immintrin.h>   // for most things (AVX2, AVX512, _popcnt64)
+#include <smmintrin.h>
+#include <tmmintrin.h>
+#include <avxintrin.h>
+#include <avx2intrin.h>
+#include <wmmintrin.h>
+#if _MSC_VER >= 1920
+// Important: we need the AVX-512 headers:
+#include <avx512fintrin.h>
+#include <avx512dqintrin.h>
+#include <avx512cdintrin.h>
+#include <avx512bwintrin.h>
+#include <avx512vlintrin.h>
+#include <avx512vbmiintrin.h>
+#include <avx512vbmi2intrin.h>
+#include <avx512vpopcntdqintrin.h>
+// clang-format on
+#endif  // _MSC_VER >= 1920
+// unfortunately, we may not get _blsr_u64, but, thankfully, clang
+// has it as a macro.
+#ifndef _blsr_u64
+// we roll our own
+#define _blsr_u64(n) ((n - 1) & n)
+#endif  //  _blsr_u64
+#endif  // SIMDJSON_CLANG_VISUAL_STUDIO
+
+#endif  // CROARING_REGULAR_VISUAL_STUDIO
+#endif  // defined(__x86_64__) || defined(_M_X64)
+
+#if !defined(CROARING_USENEON) && !defined(DISABLENEON) && defined(__ARM_NEON)
+#define CROARING_USENEON
+#endif
+#if defined(CROARING_USENEON)
+#include <arm_neon.h>
+#endif
+
+#if !CROARING_REGULAR_VISUAL_STUDIO
+/* Non-Microsoft C/C++-compatible compiler, assumes that it supports inline
+ * assembly */
+#define CROARING_INLINE_ASM 1
+#endif  // _MSC_VER
+
+#if CROARING_REGULAR_VISUAL_STUDIO
+/* Microsoft C/C++-compatible compiler */
+#include <intrin.h>
+
+#ifndef __clang__  // if one compiles with MSVC *with* clang, then these
+                  // intrinsics are defined!!!
+#define CROARING_INTRINSICS 1
+// sadly there is no way to check whether we are missing these intrinsics
+// specifically.
+
+/* wrappers for Visual Studio built-ins that look like gcc built-ins
+ * __builtin_ctzll */
+/** result might be undefined when input_num is zero */
+inline int roaring_trailing_zeroes(unsigned long long input_num) {
+    unsigned long index;
+#ifdef _WIN64  // highly recommended!!!
+    _BitScanForward64(&index, input_num);
+#else   // if we must support 32-bit Windows
+    if ((uint32_t)input_num != 0) {
+        _BitScanForward(&index, (uint32_t)input_num);
+    } else {
+        _BitScanForward(&index, (uint32_t)(input_num >> 32));
+        index += 32;
+    }
+#endif  // _WIN64
+    return index;
+}
+
+/* wrappers for Visual Studio built-ins that look like gcc built-ins
+ * __builtin_clzll */
+/** result might be undefined when input_num is zero */
+inline int roaring_leading_zeroes(unsigned long long input_num) {
+    unsigned long index;
+#ifdef _WIN64  // highly recommended!!!
+    _BitScanReverse64(&index, input_num);
+#else   // if we must support 32-bit Windows
+    if (input_num > 0xFFFFFFFF) {
+        _BitScanReverse(&index, (uint32_t)(input_num >> 32));
+        index += 32;
+    } else {
+        _BitScanReverse(&index, (uint32_t)(input_num));
+    }
+#endif  // _WIN64
+    return 63 - index;
+}
+
+/* Use #define so this is effective even under /Ob0 (no inline) */
+#define roaring_unreachable __assume(0)
+#endif  // __clang__
+
+#endif  // CROARING_REGULAR_VISUAL_STUDIO
+
+#ifndef CROARING_INTRINSICS
+#define CROARING_INTRINSICS 1
+#define roaring_unreachable __builtin_unreachable()
+/** result might be undefined when input_num is zero */
+inline int roaring_trailing_zeroes(unsigned long long input_num) {
+    return __builtin_ctzll(input_num);
+}
+/** result might be undefined when input_num is zero */
+inline int roaring_leading_zeroes(unsigned long long input_num) {
+    return __builtin_clzll(input_num);
+}
+#endif
+
+#if CROARING_REGULAR_VISUAL_STUDIO
+#define ALIGNED(x) __declspec(align(x))
+#elif defined(__GNUC__) || defined(__clang__)
+#define ALIGNED(x) __attribute__((aligned(x)))
+#else
+#warning "Warning. Unrecognized compiler."
+#define ALIGNED(x)
+#endif
+
+#if defined(__GNUC__) || defined(__clang__)
+#define CROARING_WARN_UNUSED __attribute__((warn_unused_result))
+#else
+#define CROARING_WARN_UNUSED
+#endif
+
+#define IS_BIG_ENDIAN (*(uint16_t *)"\0\xff" < 0x100)
+
+#ifdef CROARING_USENEON
+// we can always compute the popcount fast.
+#elif (defined(_M_ARM) || defined(_M_ARM64)) && \
+    ((defined(_WIN64) || defined(_WIN32)) &&    \
+     defined(CROARING_REGULAR_VISUAL_STUDIO) && \
+     CROARING_REGULAR_VISUAL_STUDIO)
+// we will need this function:
+static inline int roaring_hamming_backup(uint64_t x) {
+    uint64_t c1 = UINT64_C(0x5555555555555555);
+    uint64_t c2 = UINT64_C(0x3333333333333333);
+    uint64_t c4 = UINT64_C(0x0F0F0F0F0F0F0F0F);
+    x -= (x >> 1) & c1;
+    x = ((x >> 2) & c2) + (x & c2);
+    x = (x + (x >> 4)) & c4;
+    x *= UINT64_C(0x0101010101010101);
+    return x >> 56;
+}
+#endif
+
+static inline int roaring_hamming(uint64_t x) {
+#if defined(_WIN64) && defined(CROARING_REGULAR_VISUAL_STUDIO) && \
+    CROARING_REGULAR_VISUAL_STUDIO
+#ifdef CROARING_USENEON
+    return vaddv_u8(vcnt_u8(vcreate_u8(input_num)));
+#elif defined(_M_ARM64)
+    return roaring_hamming_backup(x);
+    // (int) _CountOneBits64(x); is unavailable
+#else   // _M_ARM64
+    return (int)__popcnt64(x);
+#endif  // _M_ARM64
+#elif defined(_WIN32) && defined(CROARING_REGULAR_VISUAL_STUDIO) && \
+    CROARING_REGULAR_VISUAL_STUDIO
+#ifdef _M_ARM
+    return roaring_hamming_backup(x);
+    // _CountOneBits is unavailable
+#else   // _M_ARM
+    return (int)__popcnt((unsigned int)x) +
+           (int)__popcnt((unsigned int)(x >> 32));
+#endif  // _M_ARM
+#else
+    return __builtin_popcountll(x);
+#endif
+}
+
+#ifndef UINT64_C
+#define UINT64_C(c) (c##ULL)
+#endif  // UINT64_C
+
+#ifndef UINT32_C
+#define UINT32_C(c) (c##UL)
+#endif  // UINT32_C
+
+#ifdef __cplusplus
+}  // extern "C" {
+#endif  // __cplusplus
+
+// this is almost standard?
+#undef STRINGIFY_IMPLEMENTATION_
+#undef STRINGIFY
+#define STRINGIFY_IMPLEMENTATION_(a) #a
+#define STRINGIFY(a) STRINGIFY_IMPLEMENTATION_(a)
+
+// Our fast kernels require 64-bit systems.
+//
+// On 32-bit x86, we lack 64-bit popcnt, lzcnt, blsr instructions.
+// Furthermore, the number of SIMD registers is reduced.
+//
+// On 32-bit ARM, we would have smaller registers.
+//
+// The library should still have the fallback kernel. It is
+// slower, but it should run everywhere.
+
+//
+// Enable valid runtime implementations, and select
+// CROARING_BUILTIN_IMPLEMENTATION
+//
+
+// We are going to use runtime dispatch.
+#if CROARING_IS_X64
+#ifdef __clang__
+// clang does not have GCC push pop
+// warning: clang attribute push can't be used within a namespace in clang up
+// til 8.0 so CROARING_TARGET_REGION and CROARING_UNTARGET_REGION must be
+// *outside* of a namespace.
+#define CROARING_TARGET_REGION(T)                                      \
+    _Pragma(STRINGIFY(clang attribute push(__attribute__((target(T))), \
+                                           apply_to = function)))
+#define CROARING_UNTARGET_REGION _Pragma("clang attribute pop")
+#elif defined(__GNUC__)
+// GCC is easier
+#define CROARING_TARGET_REGION(T) \
+    _Pragma("GCC push_options") _Pragma(STRINGIFY(GCC target(T)))
+#define CROARING_UNTARGET_REGION _Pragma("GCC pop_options")
+#endif  // clang then gcc
+
+#endif  // CROARING_IS_X64
+
+// Default target region macros don't do anything.
+#ifndef CROARING_TARGET_REGION
+#define CROARING_TARGET_REGION(T)
+#define CROARING_UNTARGET_REGION
+#endif
+
+#define CROARING_TARGET_AVX2 \
+    CROARING_TARGET_REGION("avx2,bmi,pclmul,lzcnt,popcnt")
+#define CROARING_TARGET_AVX512                                         \
+    CROARING_TARGET_REGION(                                            \
+        "avx2,bmi,bmi2,pclmul,lzcnt,popcnt,avx512f,avx512dq,avx512bw," \
+        "avx512vbmi2,avx512bitalg,avx512vpopcntdq")
+#define CROARING_UNTARGET_AVX2 CROARING_UNTARGET_REGION
+#define CROARING_UNTARGET_AVX512 CROARING_UNTARGET_REGION
+
+#ifdef __AVX2__
+// No need for runtime dispatching.
+// It is unnecessary and harmful to old clang to tag regions.
+#undef CROARING_TARGET_AVX2
+#define CROARING_TARGET_AVX2
+#undef CROARING_UNTARGET_AVX2
+#define CROARING_UNTARGET_AVX2
+#endif
+
+#if defined(__AVX512F__) && defined(__AVX512DQ__) && defined(__AVX512BW__) && \
+    defined(__AVX512VBMI2__) && defined(__AVX512BITALG__) &&                  \
+    defined(__AVX512VPOPCNTDQ__)
+// No need for runtime dispatching.
+// It is unnecessary and harmful to old clang to tag regions.
+#undef CROARING_TARGET_AVX512
+#define CROARING_TARGET_AVX512
+#undef CROARING_UNTARGET_AVX512
+#define CROARING_UNTARGET_AVX512
+#endif
+
+// Allow unaligned memory access
+#if defined(__GNUC__) || defined(__clang__)
+#define ALLOW_UNALIGNED __attribute__((no_sanitize("alignment")))
+#else
+#define ALLOW_UNALIGNED
+#endif
+
+#if defined(__BYTE_ORDER__) && defined(__ORDER_BIG_ENDIAN__)
+#define CROARING_IS_BIG_ENDIAN (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)
+#elif defined(_WIN32)
+#define CROARING_IS_BIG_ENDIAN 0
+#else
+#if defined(__APPLE__) || \
+    defined(__FreeBSD__)  // defined __BYTE_ORDER__ && defined
+                         // __ORDER_BIG_ENDIAN__
+#include <machine/endian.h>
+#elif defined(sun) || \
+    defined(__sun)  // defined(__APPLE__) || defined(__FreeBSD__)
+#include <sys/byteorder.h>
+#else  // defined(__APPLE__) || defined(__FreeBSD__)
+
+#ifdef __has_include
+#if __has_include(<endian.h>)
+#include <endian.h>
+#endif  //__has_include(<endian.h>)
+#endif  //__has_include
+
+#endif  // defined(__APPLE__) || defined(__FreeBSD__)
+
+#ifndef !defined(__BYTE_ORDER__) || !defined(__ORDER_LITTLE_ENDIAN__)
+#define CROARING_IS_BIG_ENDIAN 0
+#endif
+
+#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
+#define CROARING_IS_BIG_ENDIAN 0
+#else  // __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
+#define CROARING_IS_BIG_ENDIAN 1
+#endif  // __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
+#endif
+
+// Host <-> big endian conversion.
+#if CROARING_IS_BIG_ENDIAN
+#define croaring_htobe64(x) (x)
+
+#elif defined(_WIN32) || defined(_WIN64)  // CROARING_IS_BIG_ENDIAN
+#include <stdlib.h>
+#define croaring_htobe64(x) _byteswap_uint64(x)
+
+#elif defined(__APPLE__)  // CROARING_IS_BIG_ENDIAN
+#include <libkern/OSByteOrder.h>
+#define croaring_htobe64(x) OSSwapInt64(x)
+
+#elif defined(__has_include) && \
+    __has_include(              \
+        <byteswap.h>)  && (defined(__linux__) || defined(__FreeBSD__))  // CROARING_IS_BIG_ENDIAN
+#include <byteswap.h>
+#if defined(__linux__)
+#define croaring_htobe64(x) bswap_64(x)
+#elif defined(__FreeBSD__)
+#define croaring_htobe64(x) bswap64(x)
+#else
+#warning "Unknown platform, report as an error"
+#endif
+
+#else  // CROARING_IS_BIG_ENDIAN
+// Gets compiled to bswap or equivalent on most compilers.
+#define croaring_htobe64(x)                                                    \
+    (((x & 0x00000000000000FFULL) << 56) |                                     \
+     ((x & 0x000000000000FF00ULL) << 40) |                                     \
+     ((x & 0x0000000000FF0000ULL) << 24) |                                     \
+     ((x & 0x00000000FF000000ULL) << 8) | ((x & 0x000000FF00000000ULL) >> 8) | \
+     ((x & 0x0000FF0000000000ULL) >> 24) |                                     \
+     ((x & 0x00FF000000000000ULL) >> 40) |                                     \
+     ((x & 0xFF00000000000000ULL) >> 56))
+#endif  // CROARING_IS_BIG_ENDIAN
+#define croaring_be64toh(x) croaring_htobe64(x)
+// End of host <-> big endian conversion.
+
+// Defines for the possible CROARING atomic implementations
+#define CROARING_ATOMIC_IMPL_NONE 1
+#define CROARING_ATOMIC_IMPL_CPP 2
+#define CROARING_ATOMIC_IMPL_C 3
+#define CROARING_ATOMIC_IMPL_C_WINDOWS 4
+
+// If the use has forced a specific implementation, use that, otherwise,
+// figure out the best implementation we can use.
+#if !defined(CROARING_ATOMIC_IMPL)
+#if defined(__cplusplus) && __cplusplus >= 201103L
+#ifdef __has_include
+#if __has_include(<atomic>)
+#define CROARING_ATOMIC_IMPL CROARING_ATOMIC_IMPL_CPP
+#endif  //__has_include(<atomic>)
+#else
+  // We lack __has_include to check:
+#define CROARING_ATOMIC_IMPL CROARING_ATOMIC_IMPL_CPP
+#endif  //__has_include
+#elif __STDC_VERSION__ >= 201112L && !defined(__STDC_NO_ATOMICS__)
+#define CROARING_ATOMIC_IMPL CROARING_ATOMIC_IMPL_C
+#elif CROARING_REGULAR_VISUAL_STUDIO
+  // https://www.technetworkhub.com/c11-atomics-in-visual-studio-2022-version-17/
+#define CROARING_ATOMIC_IMPL CROARING_ATOMIC_IMPL_C_WINDOWS
+#endif
+#endif  // !defined(CROARING_ATOMIC_IMPL)
+
+#if CROARING_ATOMIC_IMPL == CROARING_ATOMIC_IMPL_C
+#include <stdatomic.h>
+typedef _Atomic(uint32_t) croaring_refcount_t;
+
+static inline void croaring_refcount_inc(croaring_refcount_t *val) {
+    // Increasing the reference counter can always be done with
+    // memory_order_relaxed: New references to an object can only be formed from
+    // an existing reference, and passing an existing reference from one thread
+    // to another must already provide any required synchronization.
+    atomic_fetch_add_explicit(val, 1, memory_order_relaxed);
+}
+
+static inline bool croaring_refcount_dec(croaring_refcount_t *val) {
+    // It is important to enforce any possible access to the object in one
+    // thread (through an existing reference) to happen before deleting the
+    // object in a different thread. This is achieved by a "release" operation
+    // after dropping a reference (any access to the object through this
+    // reference must obviously happened before), and an "acquire" operation
+    // before deleting the object.
+    bool is_zero = atomic_fetch_sub_explicit(val, 1, memory_order_release) == 1;
+    if (is_zero) {
+        atomic_thread_fence(memory_order_acquire);
+    }
+    return is_zero;
+}
+
+static inline uint32_t croaring_refcount_get(const croaring_refcount_t *val) {
+    return atomic_load_explicit(val, memory_order_relaxed);
+}
+#elif CROARING_ATOMIC_IMPL == CROARING_ATOMIC_IMPL_CPP
+#include <atomic>
+typedef std::atomic<uint32_t> croaring_refcount_t;
+
+static inline void croaring_refcount_inc(croaring_refcount_t *val) {
+    val->fetch_add(1, std::memory_order_relaxed);
+}
+
+static inline bool croaring_refcount_dec(croaring_refcount_t *val) {
+    // See above comments on the c11 atomic implementation for memory ordering
+    bool is_zero = val->fetch_sub(1, std::memory_order_release) == 1;
+    if (is_zero) {
+        std::atomic_thread_fence(std::memory_order_acquire);
+    }
+    return is_zero;
+}
+
+static inline uint32_t croaring_refcount_get(const croaring_refcount_t *val) {
+    return val->load(std::memory_order_relaxed);
+}
+#elif CROARING_ATOMIC_IMPL == CROARING_ATOMIC_IMPL_C_WINDOWS
+#include <intrin.h>
+#pragma intrinsic(_InterlockedIncrement)
+#pragma intrinsic(_InterlockedDecrement)
+
+// _InterlockedIncrement and _InterlockedDecrement take a (signed) long, and
+// overflow is defined to wrap, so we can pretend it is a uint32_t for our case
+typedef volatile long croaring_refcount_t;
+
+static inline void croaring_refcount_inc(croaring_refcount_t *val) {
+    _InterlockedIncrement(val);
+}
+
+static inline bool croaring_refcount_dec(croaring_refcount_t *val) {
+    return _InterlockedDecrement(val) == 0;
+}
+
+static inline uint32_t croaring_refcount_get(const croaring_refcount_t *val) {
+    // Per
+    // https://learn.microsoft.com/en-us/windows/win32/sync/interlocked-variable-access
+    // > Simple reads and writes to properly-aligned 32-bit variables are atomic
+    // > operations. In other words, you will not end up with only one portion
+    // > of the variable updated; all bits are updated in an atomic fashion.
+    return *val;
+}
+#elif CROARING_ATOMIC_IMPL == CROARING_ATOMIC_IMPL_NONE
+#include <assert.h>
+typedef uint32_t croaring_refcount_t;
+
+static inline void croaring_refcount_inc(croaring_refcount_t *val) {
+    *val += 1;
+}
+
+static inline bool croaring_refcount_dec(croaring_refcount_t *val) {
+    assert(*val > 0);
+    *val -= 1;
+    return val == 0;
+}
+
+static inline uint32_t croaring_refcount_get(const croaring_refcount_t *val) {
+    return *val;
+}
+#else
+#error "Unknown atomic implementation"
+#endif
+
+#if defined(__GNUC__) || defined(__clang__)
+#define CROARING_DEPRECATED __attribute__((deprecated))
+#elif defined(_MSC_VER)
+#define CROARING_DEPRECATED __declspec(deprecated)
+#else
+#define CROARING_DEPRECATED
+#endif  // defined(__GNUC__) || defined(__clang__)
+
+// We want to initialize structs to zero portably (C and C++), without
+// warnings. We can do mystruct s = CROARING_ZERO_INITIALIZER;
+#if __cplusplus
+#define CROARING_ZERO_INITIALIZER \
+    {}
+#else
+#define CROARING_ZERO_INITIALIZER \
+    { 0 }
+#endif
+
+// We need portability.h to be included first,
+// but we also always want isadetection.h to be
+// included (right after).
+// See https://github.com/RoaringBitmap/CRoaring/issues/394
+// There is no scenario where we want portability.h to
+// be included, but not isadetection.h: the latter is a
+// strict requirement.
+#endif                             /* INCLUDE_PORTABILITY_H_ */
+/* end file include/roaring/portability.h */
+/* begin file include/roaring/roaring_types.h */
+/*
+  Typedefs used by various components
+*/
+
+#ifndef ROARING_TYPES_H
+#define ROARING_TYPES_H
+
+#include <stdbool.h>
+#include <stdint.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace api {
+#endif
+
+/**
+ * When building .c files as C++, there's added compile-time checking if the
+ * container types are derived from a `container_t` base class.  So long as
+ * such a base class is empty, the struct will behave compatibly with C structs
+ * despite the derivation.  This is due to the Empty Base Class Optimization:
+ *
+ * https://en.cppreference.com/w/cpp/language/ebo
+ *
+ * But since C isn't namespaced, taking `container_t` globally might collide
+ * with other projects.  So roaring.h uses ROARING_CONTAINER_T, while internal
+ * code #undefs that after declaring `typedef ROARING_CONTAINER_T container_t;`
+ */
+#if defined(__cplusplus)
+extern "C++" {
+struct container_s {};
+}
+#define ROARING_CONTAINER_T ::roaring::api::container_s
+#else
+#define ROARING_CONTAINER_T void  // no compile-time checking
+#endif
+
+#define ROARING_FLAG_COW UINT8_C(0x1)
+#define ROARING_FLAG_FROZEN UINT8_C(0x2)
+
+/**
+ * Roaring arrays are array-based key-value pairs having containers as values
+ * and 16-bit integer keys. A roaring bitmap  might be implemented as such.
+ */
+
+// parallel arrays.  Element sizes quite different.
+// Alternative is array
+// of structs.  Which would have better
+// cache performance through binary searches?
+
+typedef struct roaring_array_s {
+    int32_t size;
+    int32_t allocation_size;
+    ROARING_CONTAINER_T **containers;  // Use container_t in non-API files!
+    uint16_t *keys;
+    uint8_t *typecodes;
+    uint8_t flags;
+} roaring_array_t;
+
+typedef bool (*roaring_iterator)(uint32_t value, void *param);
+typedef bool (*roaring_iterator64)(uint64_t value, void *param);
+
+/**
+ *  (For advanced users.)
+ * The roaring_statistics_t can be used to collect detailed statistics about
+ * the composition of a roaring bitmap.
+ */
+typedef struct roaring_statistics_s {
+    uint32_t n_containers; /* number of containers */
+
+    uint32_t n_array_containers;  /* number of array containers */
+    uint32_t n_run_containers;    /* number of run containers */
+    uint32_t n_bitset_containers; /* number of bitmap containers */
+
+    uint32_t
+        n_values_array_containers;    /* number of values in array containers */
+    uint32_t n_values_run_containers; /* number of values in run containers */
+    uint32_t
+        n_values_bitset_containers; /* number of values in  bitmap containers */
+
+    uint32_t n_bytes_array_containers;  /* number of allocated bytes in array
+                                           containers */
+    uint32_t n_bytes_run_containers;    /* number of allocated bytes in run
+                                           containers */
+    uint32_t n_bytes_bitset_containers; /* number of allocated bytes in  bitmap
+                                           containers */
+
+    uint32_t
+        max_value; /* the maximal value, undefined if cardinality is zero */
+    uint32_t
+        min_value; /* the minimal value, undefined if cardinality is zero */
+
+    CROARING_DEPRECATED
+    uint64_t sum_value; /* deprecated always zero */
+
+    uint64_t cardinality; /* total number of values stored in the bitmap */
+
+    // and n_values_arrays, n_values_rle, n_values_bitmap
+} roaring_statistics_t;
+
+/**
+ *  (For advanced users.)
+ * The roaring64_statistics_t can be used to collect detailed statistics about
+ * the composition of a roaring64 bitmap.
+ */
+typedef struct roaring64_statistics_s {
+    uint64_t n_containers; /* number of containers */
+
+    uint64_t n_array_containers;  /* number of array containers */
+    uint64_t n_run_containers;    /* number of run containers */
+    uint64_t n_bitset_containers; /* number of bitmap containers */
+
+    uint64_t
+        n_values_array_containers;    /* number of values in array containers */
+    uint64_t n_values_run_containers; /* number of values in run containers */
+    uint64_t
+        n_values_bitset_containers; /* number of values in  bitmap containers */
+
+    uint64_t n_bytes_array_containers;  /* number of allocated bytes in array
+                                           containers */
+    uint64_t n_bytes_run_containers;    /* number of allocated bytes in run
+                                           containers */
+    uint64_t n_bytes_bitset_containers; /* number of allocated bytes in  bitmap
+                                           containers */
+
+    uint64_t
+        max_value; /* the maximal value, undefined if cardinality is zero */
+    uint64_t
+        min_value; /* the minimal value, undefined if cardinality is zero */
+
+    uint64_t cardinality; /* total number of values stored in the bitmap */
+
+    // and n_values_arrays, n_values_rle, n_values_bitmap
+} roaring64_statistics_t;
+
+/**
+ * Roaring-internal type used to iterate within a roaring container.
+ */
+typedef struct roaring_container_iterator_s {
+    // For bitset and array containers this is the index of the bit / entry.
+    // For run containers this points at the run.
+    int32_t index;
+} roaring_container_iterator_t;
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace api {
+#endif
+
+#endif /* ROARING_TYPES_H */
+/* end file include/roaring/roaring_types.h */
+/* begin file include/roaring/bitset/bitset.h */
+#ifndef CROARING_CBITSET_BITSET_H
+#define CROARING_CBITSET_BITSET_H
+
+// For compatibility with MSVC with the use of `restrict`
+#if (__STDC_VERSION__ >= 199901L) || \
+    (defined(__GNUC__) && defined(__STDC_VERSION__))
+#define CROARING_CBITSET_RESTRICT restrict
+#else
+#define CROARING_CBITSET_RESTRICT
+#endif  // (__STDC_VERSION__ >= 199901L) || (defined(__GNUC__) &&
+       // defined(__STDC_VERSION__ ))
+
+#include <stdbool.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace api {
+#endif
+
+struct bitset_s {
+    uint64_t *CROARING_CBITSET_RESTRICT array;
+    /* For simplicity and performance, we prefer to have a size and a capacity
+     * that is a multiple of 64 bits. Thus we only track the size and the
+     * capacity in terms of 64-bit words allocated */
+    size_t arraysize;
+    size_t capacity;
+};
+
+typedef struct bitset_s bitset_t;
+
+/* Create a new bitset. Return NULL in case of failure. */
+bitset_t *bitset_create(void);
+
+/* Create a new bitset able to contain size bits. Return NULL in case of
+ * failure. */
+bitset_t *bitset_create_with_capacity(size_t size);
+
+/* Free memory. */
+void bitset_free(bitset_t *bitset);
+
+/* Set all bits to zero. */
+void bitset_clear(bitset_t *bitset);
+
+/* Set all bits to one. */
+void bitset_fill(bitset_t *bitset);
+
+/* Create a copy */
+bitset_t *bitset_copy(const bitset_t *bitset);
+
+/* For advanced users: Resize the bitset so that it can support newarraysize *
+ * 64 bits. Return true in case of success, false for failure. Pad with zeroes
+ * new buffer areas if requested. */
+bool bitset_resize(bitset_t *bitset, size_t newarraysize, bool padwithzeroes);
+
+/* returns how many bytes of memory the backend buffer uses */
+inline size_t bitset_size_in_bytes(const bitset_t *bitset) {
+    return bitset->arraysize * sizeof(uint64_t);
+}
+
+/* returns how many bits can be accessed */
+inline size_t bitset_size_in_bits(const bitset_t *bitset) {
+    return bitset->arraysize * 64;
+}
+
+/* returns how many words (64-bit) of memory the backend buffer uses */
+inline size_t bitset_size_in_words(const bitset_t *bitset) {
+    return bitset->arraysize;
+}
+
+/* For advanced users: Grow the bitset so that it can support newarraysize * 64
+ * bits with padding. Return true in case of success, false for failure. */
+bool bitset_grow(bitset_t *bitset, size_t newarraysize);
+
+/* attempts to recover unused memory, return false in case of
+ * roaring_reallocation failure */
+bool bitset_trim(bitset_t *bitset);
+
+/* shifts all bits by 's' positions so that the bitset representing values
+ * 1,2,10 would represent values 1+s, 2+s, 10+s */
+void bitset_shift_left(bitset_t *bitset, size_t s);
+
+/* shifts all bits by 's' positions so that the bitset representing values
+ * 1,2,10 would represent values 1-s, 2-s, 10-s, negative values are deleted */
+void bitset_shift_right(bitset_t *bitset, size_t s);
+
+/* Set the ith bit. Attempts to resize the bitset if needed (may silently fail)
+ */
+inline void bitset_set(bitset_t *bitset, size_t i) {
+    size_t shiftedi = i / 64;
+    if (shiftedi >= bitset->arraysize) {
+        if (!bitset_grow(bitset, shiftedi + 1)) {
+            return;
+        }
+    }
+    bitset->array[shiftedi] |= ((uint64_t)1) << (i % 64);
+}
+
+/* Set the ith bit to the specified value. Attempts to resize the bitset if
+ * needed (may silently fail) */
+inline void bitset_set_to_value(bitset_t *bitset, size_t i, bool flag) {
+    size_t shiftedi = i / 64;
+    uint64_t mask = ((uint64_t)1) << (i % 64);
+    uint64_t dynmask = ((uint64_t)flag) << (i % 64);
+    if (shiftedi >= bitset->arraysize) {
+        if (!bitset_grow(bitset, shiftedi + 1)) {
+            return;
+        }
+    }
+    uint64_t w = bitset->array[shiftedi];
+    w &= ~mask;
+    w |= dynmask;
+    bitset->array[shiftedi] = w;
+}
+
+/* Get the value of the ith bit.  */
+inline bool bitset_get(const bitset_t *bitset, size_t i) {
+    size_t shiftedi = i / 64;
+    if (shiftedi >= bitset->arraysize) {
+        return false;
+    }
+    return (bitset->array[shiftedi] & (((uint64_t)1) << (i % 64))) != 0;
+}
+
+/* Count number of bits set.  */
+size_t bitset_count(const bitset_t *bitset);
+
+/* Find the index of the first bit set. Or zero if the bitset is empty.  */
+size_t bitset_minimum(const bitset_t *bitset);
+
+/* Find the index of the last bit set. Or zero if the bitset is empty.  */
+size_t bitset_maximum(const bitset_t *bitset);
+
+/* compute the union in-place (to b1), returns true if successful, to generate a
+ * new bitset first call bitset_copy */
+bool bitset_inplace_union(bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* report the size of the union (without materializing it) */
+size_t bitset_union_count(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* compute the intersection in-place (to b1), to generate a new bitset first
+ * call bitset_copy */
+void bitset_inplace_intersection(bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* report the size of the intersection (without materializing it) */
+size_t bitset_intersection_count(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* returns true if the bitsets contain no common elements */
+bool bitsets_disjoint(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* returns true if the bitsets contain any common elements */
+bool bitsets_intersect(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* returns true if b1 contains all of the set bits of b2 */
+bool bitset_contains_all(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* compute the difference in-place (to b1), to generate a new bitset first call
+ * bitset_copy */
+void bitset_inplace_difference(bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* compute the size of the difference */
+size_t bitset_difference_count(const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* compute the symmetric difference in-place (to b1), return true if successful,
+ * to generate a new bitset first call bitset_copy */
+bool bitset_inplace_symmetric_difference(
+    bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* compute the size of the symmetric difference  */
+size_t bitset_symmetric_difference_count(
+    const bitset_t *CROARING_CBITSET_RESTRICT b1,
+    const bitset_t *CROARING_CBITSET_RESTRICT b2);
+
+/* iterate over the set bits
+ like so :
+  for(size_t i = 0; bitset_next_set_bit(b,&i) ; i++) {
+    //.....
+  }
+  */
+inline bool bitset_next_set_bit(const bitset_t *bitset, size_t *i) {
+    size_t x = *i / 64;
+    if (x >= bitset->arraysize) {
+        return false;
+    }
+    uint64_t w = bitset->array[x];
+    w >>= (*i & 63);
+    if (w != 0) {
+        *i += roaring_trailing_zeroes(w);
+        return true;
+    }
+    x++;
+    while (x < bitset->arraysize) {
+        w = bitset->array[x];
+        if (w != 0) {
+            *i = x * 64 + roaring_trailing_zeroes(w);
+            return true;
+        }
+        x++;
+    }
+    return false;
+}
+
+/* iterate over the set bits
+ like so :
+   size_t buffer[256];
+   size_t howmany = 0;
+  for(size_t startfrom = 0; (howmany = bitset_next_set_bits(b,buffer,256,
+ &startfrom)) > 0 ; startfrom++) {
+    //.....
+  }
+  */
+inline size_t bitset_next_set_bits(const bitset_t *bitset, size_t *buffer,
+    size_t capacity, size_t *startfrom) {
+    if (capacity == 0) return 0;  // sanity check
+    size_t x = *startfrom / 64;
+    if (x >= bitset->arraysize) {
+        return 0;  // nothing more to iterate over
+    }
+    uint64_t w = bitset->array[x];
+    w >>= (*startfrom & 63);
+    size_t howmany = 0;
+    size_t base = x << 6;
+    while (howmany < capacity) {
+        while (w != 0) {
+            uint64_t t = w & (~w + 1);
+            int r = roaring_trailing_zeroes(w);
+            buffer[howmany++] = r + base;
+            if (howmany == capacity) goto end;
+            w ^= t;
+        }
+        x += 1;
+        if (x == bitset->arraysize) {
+            break;
+        }
+        base += 64;
+        w = bitset->array[x];
+    }
+end:
+    if (howmany > 0) {
+        *startfrom = buffer[howmany - 1];
+    }
+    return howmany;
+}
+
+typedef bool (*bitset_iterator)(size_t value, void *param);
+
+// return true if uninterrupted
+inline bool bitset_for_each(const bitset_t *b, bitset_iterator iterator,
+    void *ptr) {
+    size_t base = 0;
+    for (size_t i = 0; i < b->arraysize; ++i) {
+        uint64_t w = b->array[i];
+        while (w != 0) {
+            uint64_t t = w & (~w + 1);
+            int r = roaring_trailing_zeroes(w);
+            if (!iterator(r + base, ptr)) return false;
+            w ^= t;
+        }
+        base += 64;
+    }
+    return true;
+}
+
+inline void bitset_print(const bitset_t *b) {
+    printf("{");
+    for (size_t i = 0; bitset_next_set_bit(b, &i); i++) {
+        printf("%zu, ", i);
+    }
+    printf("}");
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace api {
+#endif
+
+#endif
+/* end file include/roaring/bitset/bitset.h */
+/* begin file include/roaring/roaring.h */
+/*
+ * An implementation of Roaring Bitmaps in C.
+ */
+
+#ifndef ROARING_H
+#define ROARING_H
+
+#include <stdbool.h>
+#include <stddef.h>  // for `size_t`
+#include <stdint.h>
+
+
+// Include other headers after roaring_types.h
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace api {
+#endif
+
+typedef struct roaring_bitmap_s {
+    roaring_array_t high_low_container;
+} roaring_bitmap_t;
+
+/**
+ * Dynamically allocates a new bitmap (initially empty).
+ * Returns NULL if the allocation fails.
+ * Capacity is a performance hint for how many "containers" the data will need.
+ * Client is responsible for calling `roaring_bitmap_free()`.
+ */
+roaring_bitmap_t *roaring_bitmap_create_with_capacity(uint32_t cap);
+
+/**
+ * Dynamically allocates a new bitmap (initially empty).
+ * Returns NULL if the allocation fails.
+ * Client is responsible for calling `roaring_bitmap_free()`.
+ */
+inline roaring_bitmap_t *roaring_bitmap_create(void) {
+    return roaring_bitmap_create_with_capacity(0);
+}
+
+/**
+ * Initialize a roaring bitmap structure in memory controlled by client.
+ * Capacity is a performance hint for how many "containers" the data will need.
+ * Can return false if auxiliary allocations fail when capacity greater than 0.
+ */
+bool roaring_bitmap_init_with_capacity(roaring_bitmap_t *r, uint32_t cap);
+
+/**
+ * Initialize a roaring bitmap structure in memory controlled by client.
+ * The bitmap will be in a "clear" state, with no auxiliary allocations.
+ * Since this performs no allocations, the function will not fail.
+ */
+inline void roaring_bitmap_init_cleared(roaring_bitmap_t *r) {
+    roaring_bitmap_init_with_capacity(r, 0);
+}
+
+/**
+ * Add all the values between min (included) and max (excluded) that are at a
+ * distance k*step from min.
+ */
+roaring_bitmap_t *roaring_bitmap_from_range(uint64_t min, uint64_t max,
+    uint32_t step);
+
+/**
+ * Creates a new bitmap from a pointer of uint32_t integers
+ */
+roaring_bitmap_t *roaring_bitmap_of_ptr(size_t n_args, const uint32_t *vals);
+
+/*
+ * Whether you want to use copy-on-write.
+ * Saves memory and avoids copies, but needs more care in a threaded context.
+ * Most users should ignore this flag.
+ *
+ * Note: If you do turn this flag to 'true', enabling COW, then ensure that you
+ * do so for all of your bitmaps, since interactions between bitmaps with and
+ * without COW is unsafe.
+ */
+inline bool roaring_bitmap_get_copy_on_write(const roaring_bitmap_t *r) {
+    return r->high_low_container.flags & ROARING_FLAG_COW;
+}
+inline void roaring_bitmap_set_copy_on_write(roaring_bitmap_t *r, bool cow) {
+    if (cow) {
+        r->high_low_container.flags |= ROARING_FLAG_COW;
+    } else {
+        r->high_low_container.flags &= ~ROARING_FLAG_COW;
+    }
+}
+
+roaring_bitmap_t *roaring_bitmap_add_offset(const roaring_bitmap_t *bm,
+    int64_t offset);
+/**
+ * Describe the inner structure of the bitmap.
+ */
+void roaring_bitmap_printf_describe(const roaring_bitmap_t *r);
+
+/**
+ * Creates a new bitmap from a list of uint32_t integers
+ *
+ * This function is deprecated, use `roaring_bitmap_from` instead, which
+ * doesn't require the number of elements to be passed in.
+ *
+ * @see roaring_bitmap_from
+ */
+CROARING_DEPRECATED roaring_bitmap_t *roaring_bitmap_of(size_t n, ...);
+
+#ifdef __cplusplus
+/**
+ * Creates a new bitmap which contains all values passed in as arguments.
+ *
+ * To create a bitmap from a variable number of arguments, use the
+ * `roaring_bitmap_of_ptr` function instead.
+ */
+// Use an immediately invoked closure, capturing by reference
+// (in case __VA_ARGS__ refers to context outside the closure)
+// Include a 0 at the beginning of the array to make the array length > 0
+// (zero sized arrays are not valid in standard c/c++)
+#define roaring_bitmap_from(...)                                              \
+    [&]() {                                                                   \
+        const uint32_t roaring_bitmap_from_array[] = {0, __VA_ARGS__};        \
+        return roaring_bitmap_of_ptr((sizeof(roaring_bitmap_from_array) /     \
+                                      sizeof(roaring_bitmap_from_array[0])) - \
+                                         1,                                   \
+                                     &roaring_bitmap_from_array[1]);          \
+    }()
+#else
+/**
+ * Creates a new bitmap which contains all values passed in as arguments.
+ *
+ * To create a bitmap from a variable number of arguments, use the
+ * `roaring_bitmap_of_ptr` function instead.
+ */
+// While __VA_ARGS__ occurs twice in expansion, one of the times is in a sizeof
+// expression, which is an unevaluated context, so it's even safe in the case
+// where expressions passed have side effects (roaring64_bitmap_from(my_func(),
+// ++i))
+// Include a 0 at the beginning of the array to make the array length > 0
+// (zero sized arrays are not valid in standard c/c++)
+#define roaring_bitmap_from(...)                                             \
+    roaring_bitmap_of_ptr(                                                   \
+        (sizeof((const uint32_t[]){0, __VA_ARGS__}) / sizeof(uint32_t)) - 1, \
+        &((const uint32_t[]){0, __VA_ARGS__})[1])
+#endif
+
+/**
+ * Copies a bitmap (this does memory allocation).
+ * The caller is responsible for memory management.
+ */
+roaring_bitmap_t *roaring_bitmap_copy(const roaring_bitmap_t *r);
+
+/**
+ * Copies a bitmap from src to dest. It is assumed that the pointer dest
+ * is to an already allocated bitmap. The content of the dest bitmap is
+ * freed/deleted.
+ *
+ * It might be preferable and simpler to call roaring_bitmap_copy except
+ * that roaring_bitmap_overwrite can save on memory allocations.
+ *
+ * Returns true if successful, or false if there was an error. On failure,
+ * the dest bitmap is left in a valid, empty state (even if it was not empty
+ * before).
+ */
+bool roaring_bitmap_overwrite(roaring_bitmap_t *dest,
+    const roaring_bitmap_t *src);
+
+/**
+ * Print the content of the bitmap.
+ */
+void roaring_bitmap_printf(const roaring_bitmap_t *r);
+
+/**
+ * Computes the intersection between two bitmaps and returns new bitmap. The
+ * caller is responsible for memory management.
+ *
+ * Performance hint: if you are computing the intersection between several
+ * bitmaps, two-by-two, it is best to start with the smallest bitmap.
+ * You may also rely on roaring_bitmap_and_inplace to avoid creating
+ * many temporary bitmaps.
+ */
+roaring_bitmap_t *roaring_bitmap_and(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Computes the size of the intersection between two bitmaps.
+ */
+uint64_t roaring_bitmap_and_cardinality(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Check whether two bitmaps intersect.
+ */
+bool roaring_bitmap_intersect(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Check whether a bitmap and an open range intersect.
+ */
+bool roaring_bitmap_intersect_with_range(const roaring_bitmap_t *bm, uint64_t x,
+    uint64_t y);
+
+/**
+ * Computes the Jaccard index between two bitmaps. (Also known as the Tanimoto
+ * distance, or the Jaccard similarity coefficient)
+ *
+ * The Jaccard index is undefined if both bitmaps are empty.
+ */
+double roaring_bitmap_jaccard_index(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Computes the size of the union between two bitmaps.
+ */
+uint64_t roaring_bitmap_or_cardinality(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Computes the size of the difference (andnot) between two bitmaps.
+ */
+uint64_t roaring_bitmap_andnot_cardinality(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Computes the size of the symmetric difference (xor) between two bitmaps.
+ */
+uint64_t roaring_bitmap_xor_cardinality(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Inplace version of `roaring_bitmap_and()`, modifies r1
+ * r1 == r2 is allowed.
+ *
+ * Performance hint: if you are computing the intersection between several
+ * bitmaps, two-by-two, it is best to start with the smallest bitmap.
+ */
+void roaring_bitmap_and_inplace(roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Computes the union between two bitmaps and returns new bitmap. The caller is
+ * responsible for memory management.
+ */
+roaring_bitmap_t *roaring_bitmap_or(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Inplace version of `roaring_bitmap_or(), modifies r1.
+ * TODO: decide whether r1 == r2 ok
+ */
+void roaring_bitmap_or_inplace(roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Compute the union of 'number' bitmaps.
+ * Caller is responsible for freeing the result.
+ * See also `roaring_bitmap_or_many_heap()`
+ */
+roaring_bitmap_t *roaring_bitmap_or_many(size_t number,
+    const roaring_bitmap_t **rs);
+
+/**
+ * Compute the union of 'number' bitmaps using a heap. This can sometimes be
+ * faster than `roaring_bitmap_or_many() which uses a naive algorithm.
+ * Caller is responsible for freeing the result.
+ */
+roaring_bitmap_t *roaring_bitmap_or_many_heap(uint32_t number,
+    const roaring_bitmap_t **rs);
+
+/**
+ * Computes the symmetric difference (xor) between two bitmaps
+ * and returns new bitmap. The caller is responsible for memory management.
+ */
+roaring_bitmap_t *roaring_bitmap_xor(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Inplace version of roaring_bitmap_xor, modifies r1, r1 != r2.
+ */
+void roaring_bitmap_xor_inplace(roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Compute the xor of 'number' bitmaps.
+ * Caller is responsible for freeing the result.
+ */
+roaring_bitmap_t *roaring_bitmap_xor_many(size_t number,
+    const roaring_bitmap_t **rs);
+
+/**
+ * Computes the difference (andnot) between two bitmaps and returns new bitmap.
+ * Caller is responsible for freeing the result.
+ */
+roaring_bitmap_t *roaring_bitmap_andnot(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Inplace version of roaring_bitmap_andnot, modifies r1, r1 != r2.
+ */
+void roaring_bitmap_andnot_inplace(roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * TODO: consider implementing:
+ *
+ * "Compute the xor of 'number' bitmaps using a heap. This can sometimes be
+ *  faster than roaring_bitmap_xor_many which uses a naive algorithm. Caller is
+ *  responsible for freeing the result.""
+ *
+ * roaring_bitmap_t *roaring_bitmap_xor_many_heap(uint32_t number,
+ *                                                const roaring_bitmap_t **rs);
+ */
+
+/**
+ * Frees the memory.
+ */
+void roaring_bitmap_free(const roaring_bitmap_t *r);
+
+/**
+ * A bit of context usable with `roaring_bitmap_*_bulk()` functions
+ *
+ * Should be initialized with `{0}` (or `memset()` to all zeros).
+ * Callers should treat it as an opaque type.
+ *
+ * A context may only be used with a single bitmap
+ * (unless re-initialized to zero), and any modification to a bitmap
+ * (other than modifications performed with `_bulk()` functions with the context
+ * passed) will invalidate any contexts associated with that bitmap.
+ */
+typedef struct roaring_bulk_context_s {
+    ROARING_CONTAINER_T *container;
+    int idx;
+    uint16_t key;
+    uint8_t typecode;
+} roaring_bulk_context_t;
+
+/**
+ * Add an item, using context from a previous insert for speed optimization.
+ *
+ * `context` will be used to store information between calls to make bulk
+ * operations faster. `*context` should be zero-initialized before the first
+ * call to this function.
+ *
+ * Modifying the bitmap in any way (other than `-bulk` suffixed functions)
+ * will invalidate the stored context, calling this function with a non-zero
+ * context after doing any modification invokes undefined behavior.
+ *
+ * In order to exploit this optimization, the caller should call this function
+ * with values with the same "key" (high 16 bits of the value) consecutively.
+ */
+void roaring_bitmap_add_bulk(roaring_bitmap_t *r,
+    roaring_bulk_context_t *context, uint32_t val);
+
+/**
+ * Add value n_args from pointer vals, faster than repeatedly calling
+ * `roaring_bitmap_add()`
+ *
+ * In order to exploit this optimization, the caller should attempt to keep
+ * values with the same "key" (high 16 bits of the value) as consecutive
+ * elements in `vals`
+ */
+void roaring_bitmap_add_many(roaring_bitmap_t *r, size_t n_args,
+    const uint32_t *vals);
+
+/**
+ * Add value x
+ */
+void roaring_bitmap_add(roaring_bitmap_t *r, uint32_t x);
+
+/**
+ * Add value x
+ * Returns true if a new value was added, false if the value already existed.
+ */
+bool roaring_bitmap_add_checked(roaring_bitmap_t *r, uint32_t x);
+
+/**
+ * Add all values in range [min, max]
+ */
+void roaring_bitmap_add_range_closed(roaring_bitmap_t *r, uint32_t min,
+    uint32_t max);
+
+/**
+ * Add all values in range [min, max)
+ */
+inline void roaring_bitmap_add_range(roaring_bitmap_t *r, uint64_t min,
+    uint64_t max) {
+    if (max <= min) return;
+    roaring_bitmap_add_range_closed(r, (uint32_t)min, (uint32_t)(max - 1));
+}
+
+/**
+ * Remove value x
+ */
+void roaring_bitmap_remove(roaring_bitmap_t *r, uint32_t x);
+
+/**
+ * Remove all values in range [min, max]
+ */
+void roaring_bitmap_remove_range_closed(roaring_bitmap_t *r, uint32_t min,
+    uint32_t max);
+
+/**
+ * Remove all values in range [min, max)
+ */
+inline void roaring_bitmap_remove_range(roaring_bitmap_t *r, uint64_t min,
+    uint64_t max) {
+    if (max <= min) return;
+    roaring_bitmap_remove_range_closed(r, (uint32_t)min, (uint32_t)(max - 1));
+}
+
+/**
+ * Remove multiple values
+ */
+void roaring_bitmap_remove_many(roaring_bitmap_t *r, size_t n_args,
+    const uint32_t *vals);
+
+/**
+ * Remove value x
+ * Returns true if a new value was removed, false if the value was not existing.
+ */
+bool roaring_bitmap_remove_checked(roaring_bitmap_t *r, uint32_t x);
+
+/**
+ * Check if value is present
+ */
+bool roaring_bitmap_contains(const roaring_bitmap_t *r, uint32_t val);
+
+/**
+ * Check whether a range of values from range_start (included)
+ * to range_end (excluded) is present
+ */
+bool roaring_bitmap_contains_range(const roaring_bitmap_t *r,
+    uint64_t range_start, uint64_t range_end);
+
+/**
+ * Check if an items is present, using context from a previous insert or search
+ * for speed optimization.
+ *
+ * `context` will be used to store information between calls to make bulk
+ * operations faster. `*context` should be zero-initialized before the first
+ * call to this function.
+ *
+ * Modifying the bitmap in any way (other than `-bulk` suffixed functions)
+ * will invalidate the stored context, calling this function with a non-zero
+ * context after doing any modification invokes undefined behavior.
+ *
+ * In order to exploit this optimization, the caller should call this function
+ * with values with the same "key" (high 16 bits of the value) consecutively.
+ */
+bool roaring_bitmap_contains_bulk(const roaring_bitmap_t *r,
+    roaring_bulk_context_t *context,
+    uint32_t val);
+
+/**
+ * Get the cardinality of the bitmap (number of elements).
+ */
+uint64_t roaring_bitmap_get_cardinality(const roaring_bitmap_t *r);
+
+/**
+ * Returns the number of elements in the range [range_start, range_end).
+ */
+uint64_t roaring_bitmap_range_cardinality(const roaring_bitmap_t *r,
+    uint64_t range_start,
+    uint64_t range_end);
+
+/**
+ * Returns true if the bitmap is empty (cardinality is zero).
+ */
+bool roaring_bitmap_is_empty(const roaring_bitmap_t *r);
+
+/**
+ * Empties the bitmap.  It will have no auxiliary allocations (so if the bitmap
+ * was initialized in client memory via roaring_bitmap_init(), then a call to
+ * roaring_bitmap_clear() would be enough to "free" it)
+ */
+void roaring_bitmap_clear(roaring_bitmap_t *r);
+
+/**
+ * Convert the bitmap to a sorted array, output in `ans`.
+ *
+ * Caller is responsible to ensure that there is enough memory allocated, e.g.
+ *
+ *     ans = malloc(roaring_bitmap_get_cardinality(bitmap) * sizeof(uint32_t));
+ */
+void roaring_bitmap_to_uint32_array(const roaring_bitmap_t *r, uint32_t *ans);
+
+/**
+ * Store the bitmap to a bitset. This can be useful for people
+ * who need the performance and simplicity of a standard bitset.
+ * We assume that the input bitset is originally empty (does not
+ * have any set bit).
+ *
+ *   bitset_t * out = bitset_create();
+ *   // if the bitset has content in it, call "bitset_clear(out)"
+ *   bool success = roaring_bitmap_to_bitset(mybitmap, out);
+ *   // on failure, success will be false.
+ *   // You can then query the bitset:
+ *   bool is_present = bitset_get(out,  10011 );
+ *   // you must free the memory:
+ *   bitset_free(out);
+ *
+ */
+bool roaring_bitmap_to_bitset(const roaring_bitmap_t *r, bitset_t *bitset);
+
+/**
+ * Convert the bitmap to a sorted array from `offset` by `limit`, output in
+ * `ans`.
+ *
+ * Caller is responsible to ensure that there is enough memory allocated, e.g.
+ *
+ *     ans = malloc(roaring_bitmap_get_cardinality(limit) * sizeof(uint32_t));
+ *
+ * Return false in case of failure (e.g., insufficient memory)
+ */
+bool roaring_bitmap_range_uint32_array(const roaring_bitmap_t *r, size_t offset,
+    size_t limit, uint32_t *ans);
+
+/**
+ * Remove run-length encoding even when it is more space efficient.
+ * Return whether a change was applied.
+ */
+bool roaring_bitmap_remove_run_compression(roaring_bitmap_t *r);
+
+/**
+ * Convert array and bitmap containers to run containers when it is more
+ * efficient; also convert from run containers when more space efficient.
+ *
+ * Returns true if the result has at least one run container.
+ * Additional savings might be possible by calling `shrinkToFit()`.
+ */
+bool roaring_bitmap_run_optimize(roaring_bitmap_t *r);
+
+/**
+ * If needed, reallocate memory to shrink the memory usage.
+ * Returns the number of bytes saved.
+ */
+size_t roaring_bitmap_shrink_to_fit(roaring_bitmap_t *r);
+
+/**
+ * Write the bitmap to an output pointer, this output buffer should refer to
+ * at least `roaring_bitmap_size_in_bytes(r)` allocated bytes.
+ *
+ * See `roaring_bitmap_portable_serialize()` if you want a format that's
+ * compatible with Java and Go implementations.  This format can sometimes be
+ * more space efficient than the portable form, e.g. when the data is sparse.
+ *
+ * Returns how many bytes written, should be `roaring_bitmap_size_in_bytes(r)`.
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ *
+ * When serializing data to a file, we recommend that you also use
+ * checksums so that, at deserialization, you can be confident
+ * that you are recovering the correct data.
+ */
+size_t roaring_bitmap_serialize(const roaring_bitmap_t *r, char *buf);
+
+/**
+ * Use with `roaring_bitmap_serialize()`.
+ *
+ * (See `roaring_bitmap_portable_deserialize()` if you want a format that's
+ * compatible with Java and Go implementations).
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ */
+roaring_bitmap_t *roaring_bitmap_deserialize(const void *buf);
+
+/**
+ * Use with `roaring_bitmap_serialize()`.
+ *
+ * (See `roaring_bitmap_portable_deserialize_safe()` if you want a format that's
+ * compatible with Java and Go implementations).
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ *
+ * The difference with `roaring_bitmap_deserialize()` is that this function
+ * checks that the input buffer is a valid bitmap.  If the buffer is too small,
+ * NULL is returned.
+ */
+roaring_bitmap_t *roaring_bitmap_deserialize_safe(const void *buf,
+    size_t maxbytes);
+
+/**
+ * How many bytes are required to serialize this bitmap (NOT compatible
+ * with Java and Go versions)
+ */
+size_t roaring_bitmap_size_in_bytes(const roaring_bitmap_t *r);
+
+/**
+ * Read bitmap from a serialized buffer.
+ * In case of failure, NULL is returned.
+ *
+ * This function is unsafe in the sense that if there is no valid serialized
+ * bitmap at the pointer, then many bytes could be read, possibly causing a
+ * buffer overflow.  See also roaring_bitmap_portable_deserialize_safe().
+ *
+ * This is meant to be compatible with the Java and Go versions:
+ * https://github.com/RoaringBitmap/RoaringFormatSpec
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ */
+roaring_bitmap_t *roaring_bitmap_portable_deserialize(const char *buf);
+
+/**
+ * Read bitmap from a serialized buffer safely (reading up to maxbytes).
+ * In case of failure, NULL is returned.
+ *
+ * This is meant to be compatible with the Java and Go versions:
+ * https://github.com/RoaringBitmap/RoaringFormatSpec
+ *
+ * The function itself is safe in the sense that it will not cause buffer
+ * overflows: it will not read beyond the scope of the provided buffer
+ * (buf,maxbytes).
+ *
+ * However, for correct operations, it is assumed that the bitmap
+ * read was once serialized from a valid bitmap (i.e., it follows the format
+ * specification). If you provided an incorrect input (garbage), then the bitmap
+ * read may not be in a valid state and following operations may not lead to
+ * sensible results. In particular, the serialized array containers need to be
+ * in sorted order, and the run containers should be in sorted non-overlapping
+ * order. This is is guaranteed to happen when serializing an existing bitmap,
+ * but not for random inputs.
+ *
+ * You may use roaring_bitmap_internal_validate to check the validity of the
+ * bitmap prior to using it.
+ *
+ * We recommend that you use checksums to check that serialized data corresponds
+ * to a serialized bitmap.
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ */
+roaring_bitmap_t *roaring_bitmap_portable_deserialize_safe(const char *buf,
+    size_t maxbytes);
+
+/**
+ * Read bitmap from a serialized buffer.
+ * In case of failure, NULL is returned.
+ *
+ * Bitmap returned by this function can be used in all readonly contexts.
+ * Bitmap must be freed as usual, by calling roaring_bitmap_free().
+ * Underlying buffer must not be freed or modified while it backs any bitmaps.
+ *
+ * The function is unsafe in the following ways:
+ * 1) It may execute unaligned memory accesses.
+ * 2) A buffer overflow may occur if buf does not point to a valid serialized
+ *    bitmap.
+ *
+ * This is meant to be compatible with the Java and Go versions:
+ * https://github.com/RoaringBitmap/RoaringFormatSpec
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ */
+roaring_bitmap_t *roaring_bitmap_portable_deserialize_frozen(const char *buf);
+
+/**
+ * Check how many bytes would be read (up to maxbytes) at this pointer if there
+ * is a bitmap, returns zero if there is no valid bitmap.
+ *
+ * This is meant to be compatible with the Java and Go versions:
+ * https://github.com/RoaringBitmap/RoaringFormatSpec
+ */
+size_t roaring_bitmap_portable_deserialize_size(const char *buf,
+    size_t maxbytes);
+
+/**
+ * How many bytes are required to serialize this bitmap.
+ *
+ * This is meant to be compatible with the Java and Go versions:
+ * https://github.com/RoaringBitmap/RoaringFormatSpec
+ */
+size_t roaring_bitmap_portable_size_in_bytes(const roaring_bitmap_t *r);
+
+/**
+ * Write a bitmap to a char buffer.  The output buffer should refer to at least
+ * `roaring_bitmap_portable_size_in_bytes(r)` bytes of allocated memory.
+ *
+ * Returns how many bytes were written which should match
+ * `roaring_bitmap_portable_size_in_bytes(r)`.
+ *
+ * This is meant to be compatible with the Java and Go versions:
+ * https://github.com/RoaringBitmap/RoaringFormatSpec
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ *
+ * When serializing data to a file, we recommend that you also use
+ * checksums so that, at deserialization, you can be confident
+ * that you are recovering the correct data.
+ */
+size_t roaring_bitmap_portable_serialize(const roaring_bitmap_t *r, char *buf);
+
+/*
+ * "Frozen" serialization format imitates memory layout of roaring_bitmap_t.
+ * Deserialized bitmap is a constant view of the underlying buffer.
+ * This significantly reduces amount of allocations and copying required during
+ * deserialization.
+ * It can be used with memory mapped files.
+ * Example can be found in benchmarks/frozen_benchmark.c
+ *
+ *         [#####] const roaring_bitmap_t *
+ *          | | |
+ *     +----+ | +-+
+ *     |      |   |
+ * [#####################################] underlying buffer
+ *
+ * Note that because frozen serialization format imitates C memory layout
+ * of roaring_bitmap_t, it is not fixed. It is different on big/little endian
+ * platforms and can be changed in future.
+ */
+
+/**
+ * Returns number of bytes required to serialize bitmap using frozen format.
+ */
+size_t roaring_bitmap_frozen_size_in_bytes(const roaring_bitmap_t *r);
+
+/**
+ * Serializes bitmap using frozen format.
+ * Buffer size must be at least roaring_bitmap_frozen_size_in_bytes().
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ *
+ * When serializing data to a file, we recommend that you also use
+ * checksums so that, at deserialization, you can be confident
+ * that you are recovering the correct data.
+ */
+void roaring_bitmap_frozen_serialize(const roaring_bitmap_t *r, char *buf);
+
+/**
+ * Creates constant bitmap that is a view of a given buffer.
+ * Buffer data should have been written by `roaring_bitmap_frozen_serialize()`
+ * Its beginning must also be aligned by 32 bytes.
+ * Length must be equal exactly to `roaring_bitmap_frozen_size_in_bytes()`.
+ * In case of failure, NULL is returned.
+ *
+ * Bitmap returned by this function can be used in all readonly contexts.
+ * Bitmap must be freed as usual, by calling roaring_bitmap_free().
+ * Underlying buffer must not be freed or modified while it backs any bitmaps.
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ */
+const roaring_bitmap_t *roaring_bitmap_frozen_view(const char *buf,
+    size_t length);
+
+/**
+ * Iterate over the bitmap elements. The function iterator is called once for
+ * all the values with ptr (can be NULL) as the second parameter of each call.
+ *
+ * `roaring_iterator` is simply a pointer to a function that returns bool
+ * (true means that the iteration should continue while false means that it
+ * should stop), and takes (uint32_t,void*) as inputs.
+ *
+ * Returns true if the roaring_iterator returned true throughout (so that all
+ * data points were necessarily visited).
+ *
+ * Iteration is ordered: from the smallest to the largest elements.
+ */
+bool roaring_iterate(const roaring_bitmap_t *r, roaring_iterator iterator,
+    void *ptr);
+
+bool roaring_iterate64(const roaring_bitmap_t *r, roaring_iterator64 iterator,
+    uint64_t high_bits, void *ptr);
+
+/**
+ * Return true if the two bitmaps contain the same elements.
+ */
+bool roaring_bitmap_equals(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Return true if all the elements of r1 are also in r2.
+ */
+bool roaring_bitmap_is_subset(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Return true if all the elements of r1 are also in r2, and r2 is strictly
+ * greater than r1.
+ */
+bool roaring_bitmap_is_strict_subset(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * (For expert users who seek high performance.)
+ *
+ * Computes the union between two bitmaps and returns new bitmap. The caller is
+ * responsible for memory management.
+ *
+ * The lazy version defers some computations such as the maintenance of the
+ * cardinality counts. Thus you must call `roaring_bitmap_repair_after_lazy()`
+ * after executing "lazy" computations.
+ *
+ * It is safe to repeatedly call roaring_bitmap_lazy_or_inplace on the result.
+ *
+ * `bitsetconversion` is a flag which determines whether container-container
+ * operations force a bitset conversion.
+ */
+roaring_bitmap_t *roaring_bitmap_lazy_or(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2,
+    const bool bitsetconversion);
+
+/**
+ * (For expert users who seek high performance.)
+ *
+ * Inplace version of roaring_bitmap_lazy_or, modifies r1.
+ *
+ * `bitsetconversion` is a flag which determines whether container-container
+ * operations force a bitset conversion.
+ */
+void roaring_bitmap_lazy_or_inplace(roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2,
+    const bool bitsetconversion);
+
+/**
+ * (For expert users who seek high performance.)
+ *
+ * Execute maintenance on a bitmap created from `roaring_bitmap_lazy_or()`
+ * or modified with `roaring_bitmap_lazy_or_inplace()`.
+ */
+void roaring_bitmap_repair_after_lazy(roaring_bitmap_t *r1);
+
+/**
+ * Computes the symmetric difference between two bitmaps and returns new bitmap.
+ * The caller is responsible for memory management.
+ *
+ * The lazy version defers some computations such as the maintenance of the
+ * cardinality counts. Thus you must call `roaring_bitmap_repair_after_lazy()`
+ * after executing "lazy" computations.
+ *
+ * It is safe to repeatedly call `roaring_bitmap_lazy_xor_inplace()` on
+ * the result.
+ */
+roaring_bitmap_t *roaring_bitmap_lazy_xor(const roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * (For expert users who seek high performance.)
+ *
+ * Inplace version of roaring_bitmap_lazy_xor, modifies r1. r1 != r2
+ */
+void roaring_bitmap_lazy_xor_inplace(roaring_bitmap_t *r1,
+    const roaring_bitmap_t *r2);
+
+/**
+ * Compute the negation of the bitmap in the interval [range_start, range_end).
+ * The number of negated values is range_end - range_start.
+ * Areas outside the range are passed through unchanged.
+ */
+roaring_bitmap_t *roaring_bitmap_flip(const roaring_bitmap_t *r1,
+    uint64_t range_start, uint64_t range_end);
+
+/**
+ * compute (in place) the negation of the roaring bitmap within a specified
+ * interval: [range_start, range_end). The number of negated values is
+ * range_end - range_start.
+ * Areas outside the range are passed through unchanged.
+ */
+void roaring_bitmap_flip_inplace(roaring_bitmap_t *r1, uint64_t range_start,
+    uint64_t range_end);
+
+/**
+ * Selects the element at index 'rank' where the smallest element is at index 0.
+ * If the size of the roaring bitmap is strictly greater than rank, then this
+ * function returns true and sets element to the element of given rank.
+ * Otherwise, it returns false.
+ */
+bool roaring_bitmap_select(const roaring_bitmap_t *r, uint32_t rank,
+    uint32_t *element);
+
+/**
+ * roaring_bitmap_rank returns the number of integers that are smaller or equal
+ * to x. Thus if x is the first element, this function will return 1. If
+ * x is smaller than the smallest element, this function will return 0.
+ *
+ * The indexing convention differs between roaring_bitmap_select and
+ * roaring_bitmap_rank: roaring_bitmap_select refers to the smallest value
+ * as having index 0, whereas roaring_bitmap_rank returns 1 when ranking
+ * the smallest value.
+ */
+uint64_t roaring_bitmap_rank(const roaring_bitmap_t *r, uint32_t x);
+
+/**
+ * roaring_bitmap_rank_many is an `Bulk` version of `roaring_bitmap_rank`
+ * it puts rank value of each element in `[begin .. end)` to `ans[]`
+ *
+ * the values in `[begin .. end)` must be sorted in Ascending order;
+ * Caller is responsible to ensure that there is enough memory allocated, e.g.
+ *
+ *     ans = malloc((end-begin) * sizeof(uint64_t));
+ */
+void roaring_bitmap_rank_many(const roaring_bitmap_t *r, const uint32_t *begin,
+    const uint32_t *end, uint64_t *ans);
+
+/**
+ * Returns the index of x in the given roaring bitmap.
+ * If the roaring bitmap doesn't contain x , this function will return -1.
+ * The difference with rank function is that this function will return -1 when x
+ * is not the element of roaring bitmap, but the rank function will return a
+ * non-negative number.
+ */
+int64_t roaring_bitmap_get_index(const roaring_bitmap_t *r, uint32_t x);
+
+/**
+ * Returns the smallest value in the set, or UINT32_MAX if the set is empty.
+ */
+uint32_t roaring_bitmap_minimum(const roaring_bitmap_t *r);
+
+/**
+ * Returns the greatest value in the set, or 0 if the set is empty.
+ */
+uint32_t roaring_bitmap_maximum(const roaring_bitmap_t *r);
+
+/**
+ * (For advanced users.)
+ *
+ * Collect statistics about the bitmap, see roaring_types.h for
+ * a description of roaring_statistics_t
+ */
+void roaring_bitmap_statistics(const roaring_bitmap_t *r,
+    roaring_statistics_t *stat);
+
+/**
+ * Perform internal consistency checks. Returns true if the bitmap is
+ * consistent. It may be useful to call this after deserializing bitmaps from
+ * untrusted sources. If roaring_bitmap_internal_validate returns true, then the
+ * bitmap should be consistent and can be trusted not to cause crashes or memory
+ * corruption.
+ *
+ * Note that some operations intentionally leave bitmaps in an inconsistent
+ * state temporarily, for example, `roaring_bitmap_lazy_*` functions, until
+ * `roaring_bitmap_repair_after_lazy` is called.
+ *
+ * If reason is non-null, it will be set to a string describing the first
+ * inconsistency found if any.
+ */
+bool roaring_bitmap_internal_validate(const roaring_bitmap_t *r,
+    const char **reason);
+
+/*********************
+* What follows is code use to iterate through values in a roaring bitmap
+
+roaring_bitmap_t *r =...
+roaring_uint32_iterator_t i;
+roaring_iterator_create(r, &i);
+while(i.has_value) {
+  printf("value = %d\n", i.current_value);
+  roaring_uint32_iterator_advance(&i);
+}
+
+Obviously, if you modify the underlying bitmap, the iterator
+becomes invalid. So don't.
+*/
+
+/**
+ * A struct used to keep iterator state. Users should only access
+ * `current_value` and `has_value`, the rest of the type should be treated as
+ * opaque.
+ */
+typedef struct roaring_uint32_iterator_s {
+    const roaring_bitmap_t *parent;        // Owner
+    const ROARING_CONTAINER_T *container;  // Current container
+    uint8_t typecode;                      // Typecode of current container
+    int32_t container_index;               // Current container index
+    uint32_t highbits;                     // High 16 bits of the current value
+    roaring_container_iterator_t container_it;
+
+    uint32_t current_value;
+    bool has_value;
+} roaring_uint32_iterator_t;
+
+/**
+ * Initialize an iterator object that can be used to iterate through the values.
+ * If there is a  value, then this iterator points to the first value and
+ * `it->has_value` is true. The value is in `it->current_value`.
+ */
+void roaring_iterator_init(const roaring_bitmap_t *r,
+    roaring_uint32_iterator_t *newit);
+
+/** DEPRECATED, use `roaring_iterator_init`. */
+CROARING_DEPRECATED static inline void roaring_init_iterator(
+    const roaring_bitmap_t *r, roaring_uint32_iterator_t *newit) {
+    roaring_iterator_init(r, newit);
+}
+
+/**
+ * Initialize an iterator object that can be used to iterate through the values.
+ * If there is a value, then this iterator points to the last value and
+ * `it->has_value` is true. The value is in `it->current_value`.
+ */
+void roaring_iterator_init_last(const roaring_bitmap_t *r,
+    roaring_uint32_iterator_t *newit);
+
+/** DEPRECATED, use `roaring_iterator_init_last`. */
+CROARING_DEPRECATED static inline void roaring_init_iterator_last(
+    const roaring_bitmap_t *r, roaring_uint32_iterator_t *newit) {
+    roaring_iterator_init_last(r, newit);
+}
+
+/**
+ * Create an iterator object that can be used to iterate through the values.
+ * Caller is responsible for calling `roaring_free_iterator()`.
+ *
+ * The iterator is initialized (this function calls `roaring_iterator_init()`)
+ * If there is a value, then this iterator points to the first value and
+ * `it->has_value` is true.  The value is in `it->current_value`.
+ */
+roaring_uint32_iterator_t *roaring_iterator_create(const roaring_bitmap_t *r);
+
+/** DEPRECATED, use `roaring_iterator_create`. */
+CROARING_DEPRECATED static inline roaring_uint32_iterator_t *
+roaring_create_iterator(const roaring_bitmap_t *r) {
+    return roaring_iterator_create(r);
+}
+
+/**
+ * Advance the iterator. If there is a new value, then `it->has_value` is true.
+ * The new value is in `it->current_value`. Values are traversed in increasing
+ * orders. For convenience, returns `it->has_value`.
+ *
+ * Once `it->has_value` is false, `roaring_uint32_iterator_advance` should not
+ * be called on the iterator again. Calling `roaring_uint32_iterator_previous`
+ * is allowed.
+ */
+bool roaring_uint32_iterator_advance(roaring_uint32_iterator_t *it);
+
+/** DEPRECATED, use `roaring_uint32_iterator_advance`. */
+CROARING_DEPRECATED static inline bool roaring_advance_uint32_iterator(
+    roaring_uint32_iterator_t *it) {
+    return roaring_uint32_iterator_advance(it);
+}
+
+/**
+ * Decrement the iterator. If there's a new value, then `it->has_value` is true.
+ * The new value is in `it->current_value`. Values are traversed in decreasing
+ * order. For convenience, returns `it->has_value`.
+ *
+ * Once `it->has_value` is false, `roaring_uint32_iterator_previous` should not
+ * be called on the iterator again. Calling `roaring_uint32_iterator_advance` is
+ * allowed.
+ */
+bool roaring_uint32_iterator_previous(roaring_uint32_iterator_t *it);
+
+/** DEPRECATED, use `roaring_uint32_iterator_previous`. */
+CROARING_DEPRECATED static inline bool roaring_previous_uint32_iterator(
+    roaring_uint32_iterator_t *it) {
+    return roaring_uint32_iterator_previous(it);
+}
+
+/**
+ * Move the iterator to the first value >= `val`. If there is a such a value,
+ * then `it->has_value` is true. The new value is in `it->current_value`.
+ * For convenience, returns `it->has_value`.
+ */
+bool roaring_uint32_iterator_move_equalorlarger(roaring_uint32_iterator_t *it,
+    uint32_t val);
+
+/** DEPRECATED, use `roaring_uint32_iterator_move_equalorlarger`. */
+CROARING_DEPRECATED static inline bool
+roaring_move_uint32_iterator_equalorlarger(roaring_uint32_iterator_t *it,
+    uint32_t val) {
+    return roaring_uint32_iterator_move_equalorlarger(it, val);
+}
+
+/**
+ * Creates a copy of an iterator.
+ * Caller must free it.
+ */
+roaring_uint32_iterator_t *roaring_uint32_iterator_copy(
+    const roaring_uint32_iterator_t *it);
+
+/** DEPRECATED, use `roaring_uint32_iterator_copy`. */
+CROARING_DEPRECATED static inline roaring_uint32_iterator_t *
+roaring_copy_uint32_iterator(const roaring_uint32_iterator_t *it) {
+    return roaring_uint32_iterator_copy(it);
+}
+
+/**
+ * Free memory following `roaring_iterator_create()`
+ */
+void roaring_uint32_iterator_free(roaring_uint32_iterator_t *it);
+
+/** DEPRECATED, use `roaring_uint32_iterator_free`. */
+CROARING_DEPRECATED static inline void roaring_free_uint32_iterator(
+    roaring_uint32_iterator_t *it) {
+    roaring_uint32_iterator_free(it);
+}
+
+/*
+ * Reads next ${count} values from iterator into user-supplied ${buf}.
+ * Returns the number of read elements.
+ * This number can be smaller than ${count}, which means that iterator is
+ * drained.
+ *
+ * This function satisfies semantics of iteration and can be used together with
+ * other iterator functions.
+ *  - first value is copied from ${it}->current_value
+ *  - after function returns, iterator is positioned at the next element
+ */
+uint32_t roaring_uint32_iterator_read(roaring_uint32_iterator_t *it,
+    uint32_t *buf, uint32_t count);
+
+/** DEPRECATED, use `roaring_uint32_iterator_read`. */
+CROARING_DEPRECATED static inline uint32_t roaring_read_uint32_iterator(
+    roaring_uint32_iterator_t *it, uint32_t *buf, uint32_t count) {
+    return roaring_uint32_iterator_read(it, buf, count);
+}
+
+#ifdef __cplusplus
+}
+}
+}  // extern "C" { namespace roaring { namespace api {
+#endif
+
+#endif /* ROARING_H */
+
+#ifdef __cplusplus
+/**
+ * Best practices for C++ headers is to avoid polluting global scope.
+ * But for C compatibility when just `roaring.h` is included building as
+ * C++, default to global access for the C public API.
+ *
+ * BUT when `roaring.hh` is included instead, it sets this flag.  That way
+ * explicit namespacing must be used to get the C functions.
+ *
+ * This is outside the include guard so that if you include BOTH headers,
+ * the order won't matter; you still get the global definitions.
+ */
+#if !defined(ROARING_API_NOT_IN_GLOBAL_NAMESPACE)
+using namespace ::roaring::api;
+#endif
+#endif
+/* end file include/roaring/roaring.h */
+/* begin file include/roaring/memory.h */
+#ifndef INCLUDE_ROARING_MEMORY_H_
+#define INCLUDE_ROARING_MEMORY_H_
+
+#include <stddef.h>  // for size_t
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef void* (*roaring_malloc_p)(size_t);
+typedef void* (*roaring_realloc_p)(void*, size_t);
+typedef void* (*roaring_calloc_p)(size_t, size_t);
+typedef void (*roaring_free_p)(void*);
+typedef void* (*roaring_aligned_malloc_p)(size_t, size_t);
+typedef void (*roaring_aligned_free_p)(void*);
+
+typedef struct roaring_memory_s {
+    roaring_malloc_p malloc;
+    roaring_realloc_p realloc;
+    roaring_calloc_p calloc;
+    roaring_free_p free;
+    roaring_aligned_malloc_p aligned_malloc;
+    roaring_aligned_free_p aligned_free;
+} roaring_memory_t;
+
+void roaring_init_memory_hook(roaring_memory_t memory_hook);
+
+void* roaring_malloc(size_t);
+void* roaring_realloc(void*, size_t);
+void* roaring_calloc(size_t, size_t);
+void roaring_free(void*);
+void* roaring_aligned_malloc(size_t, size_t);
+void roaring_aligned_free(void*);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif  // INCLUDE_ROARING_MEMORY_H_
+/* end file include/roaring/memory.h */
+/* begin file include/roaring/roaring64.h */
+#ifndef ROARING64_H
+#define ROARING64_H
+
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+namespace roaring {
+namespace api {
+#endif
+
+typedef struct roaring64_bitmap_s roaring64_bitmap_t;
+typedef struct roaring64_leaf_s roaring64_leaf_t;
+typedef struct roaring64_iterator_s roaring64_iterator_t;
+
+/**
+ * A bit of context usable with `roaring64_bitmap_*_bulk()` functions.
+ *
+ * Should be initialized with `{0}` (or `memset()` to all zeros).
+ * Callers should treat it as an opaque type.
+ *
+ * A context may only be used with a single bitmap (unless re-initialized to
+ * zero), and any modification to a bitmap (other than modifications performed
+ * with `_bulk()` functions with the context passed) will invalidate any
+ * contexts associated with that bitmap.
+ */
+typedef struct roaring64_bulk_context_s {
+    uint8_t high_bytes[6];
+    roaring64_leaf_t *leaf;
+} roaring64_bulk_context_t;
+
+/**
+ * Dynamically allocates a new bitmap (initially empty).
+ * Client is responsible for calling `roaring64_bitmap_free()`.
+ */
+roaring64_bitmap_t *roaring64_bitmap_create(void);
+void roaring64_bitmap_free(roaring64_bitmap_t *r);
+
+/**
+ * Returns a copy of a bitmap.
+ */
+roaring64_bitmap_t *roaring64_bitmap_copy(const roaring64_bitmap_t *r);
+
+/**
+ * Creates a new bitmap of a pointer to N 64-bit integers.
+ */
+roaring64_bitmap_t *roaring64_bitmap_of_ptr(size_t n_args,
+    const uint64_t *vals);
+
+#ifdef __cplusplus
+/**
+ * Creates a new bitmap which contains all values passed in as arguments.
+ *
+ * To create a bitmap from a variable number of arguments, use the
+ * `roaring64_bitmap_of_ptr` function instead.
+ */
+// Use an immediately invoked closure, capturing by reference
+// (in case __VA_ARGS__ refers to context outside the closure)
+// Include a 0 at the beginning of the array to make the array length > 0
+// (zero sized arrays are not valid in standard c/c++)
+#define roaring64_bitmap_from(...)                                       \
+    [&]() {                                                              \
+        const uint64_t roaring64_bitmap_from_array[] = {0, __VA_ARGS__}; \
+        return roaring64_bitmap_of_ptr(                                  \
+            (sizeof(roaring64_bitmap_from_array) /                       \
+             sizeof(roaring64_bitmap_from_array[0])) -                   \
+                1,                                                       \
+            &roaring64_bitmap_from_array[1]);                            \
+    }()
+#else
+/**
+ * Creates a new bitmap which contains all values passed in as arguments.
+ *
+ * To create a bitmap from a variable number of arguments, use the
+ * `roaring64_bitmap_of_ptr` function instead.
+ */
+// While __VA_ARGS__ occurs twice in expansion, one of the times is in a sizeof
+// expression, which is an unevaluated context, so it's even safe in the case
+// where expressions passed have side effects (roaring64_bitmap_from(my_func(),
+// ++i))
+// Include a 0 at the beginning of the array to make the array length > 0
+// (zero sized arrays are not valid in standard c/c++)
+#define roaring64_bitmap_from(...)                                           \
+    roaring64_bitmap_of_ptr(                                                 \
+        (sizeof((const uint64_t[]){0, __VA_ARGS__}) / sizeof(uint64_t)) - 1, \
+        &((const uint64_t[]){0, __VA_ARGS__})[1])
+#endif
+
+/**
+ * Create a new bitmap by moving containers from a 32 bit roaring bitmap.
+ *
+ * After calling this function, the original bitmap will be empty, and the
+ * returned bitmap will contain all the values from the original bitmap.
+ */
+roaring64_bitmap_t *roaring64_bitmap_move_from_roaring32(roaring_bitmap_t *r);
+
+/**
+ * Create a new bitmap containing all the values in [min, max) that are at a
+ * distance k*step from min.
+ */
+roaring64_bitmap_t *roaring64_bitmap_from_range(uint64_t min, uint64_t max,
+    uint64_t step);
+
+/**
+ * Adds the provided value to the bitmap.
+ */
+void roaring64_bitmap_add(roaring64_bitmap_t *r, uint64_t val);
+
+/**
+ * Adds the provided value to the bitmap.
+ * Returns true if a new value was added, false if the value already existed.
+ */
+bool roaring64_bitmap_add_checked(roaring64_bitmap_t *r, uint64_t val);
+
+/**
+ * Add an item, using context from a previous insert for faster insertion.
+ *
+ * `context` will be used to store information between calls to make bulk
+ * operations faster. `*context` should be zero-initialized before the first
+ * call to this function.
+ *
+ * Modifying the bitmap in any way (other than `-bulk` suffixed functions)
+ * will invalidate the stored context, calling this function with a non-zero
+ * context after doing any modification invokes undefined behavior.
+ *
+ * In order to exploit this optimization, the caller should call this function
+ * with values with the same high 48 bits of the value consecutively.
+ */
+void roaring64_bitmap_add_bulk(roaring64_bitmap_t *r,
+    roaring64_bulk_context_t *context, uint64_t val);
+
+/**
+ * Add `n_args` values from `vals`, faster than repeatedly calling
+ * `roaring64_bitmap_add()`
+ *
+ * In order to exploit this optimization, the caller should attempt to keep
+ * values with the same high 48 bits of the value as consecutive elements in
+ * `vals`.
+ */
+void roaring64_bitmap_add_many(roaring64_bitmap_t *r, size_t n_args,
+    const uint64_t *vals);
+
+/**
+ * Add all values in range [min, max).
+ */
+void roaring64_bitmap_add_range(roaring64_bitmap_t *r, uint64_t min,
+    uint64_t max);
+
+/**
+ * Add all values in range [min, max].
+ */
+void roaring64_bitmap_add_range_closed(roaring64_bitmap_t *r, uint64_t min,
+    uint64_t max);
+
+/**
+ * Removes a value from the bitmap if present.
+ */
+void roaring64_bitmap_remove(roaring64_bitmap_t *r, uint64_t val);
+
+/**
+ * Removes a value from the bitmap if present, returns true if the value was
+ * removed and false if the value was not present.
+ */
+bool roaring64_bitmap_remove_checked(roaring64_bitmap_t *r, uint64_t val);
+
+/**
+ * Remove an item, using context from a previous insert for faster removal.
+ *
+ * `context` will be used to store information between calls to make bulk
+ * operations faster. `*context` should be zero-initialized before the first
+ * call to this function.
+ *
+ * Modifying the bitmap in any way (other than `-bulk` suffixed functions)
+ * will invalidate the stored context, calling this function with a non-zero
+ * context after doing any modification invokes undefined behavior.
+ *
+ * In order to exploit this optimization, the caller should call this function
+ * with values with the same high 48 bits of the value consecutively.
+ */
+void roaring64_bitmap_remove_bulk(roaring64_bitmap_t *r,
+    roaring64_bulk_context_t *context,
+    uint64_t val);
+
+/**
+ * Remove `n_args` values from `vals`, faster than repeatedly calling
+ * `roaring64_bitmap_remove()`
+ *
+ * In order to exploit this optimization, the caller should attempt to keep
+ * values with the same high 48 bits of the value as consecutive elements in
+ * `vals`.
+ */
+void roaring64_bitmap_remove_many(roaring64_bitmap_t *r, size_t n_args,
+    const uint64_t *vals);
+
+/**
+ * Remove all values in range [min, max).
+ */
+void roaring64_bitmap_remove_range(roaring64_bitmap_t *r, uint64_t min,
+    uint64_t max);
+
+/**
+ * Remove all values in range [min, max].
+ */
+void roaring64_bitmap_remove_range_closed(roaring64_bitmap_t *r, uint64_t min,
+    uint64_t max);
+
+/**
+ * Empties the bitmap.
+ */
+void roaring64_bitmap_clear(roaring64_bitmap_t *r);
+
+/**
+ * Returns true if the provided value is present.
+ */
+bool roaring64_bitmap_contains(const roaring64_bitmap_t *r, uint64_t val);
+
+/**
+ * Returns true if all values in the range [min, max) are present.
+ */
+bool roaring64_bitmap_contains_range(const roaring64_bitmap_t *r, uint64_t min,
+    uint64_t max);
+
+/**
+ * Check if an item is present using context from a previous insert or search
+ * for faster search.
+ *
+ * `context` will be used to store information between calls to make bulk
+ * operations faster. `*context` should be zero-initialized before the first
+ * call to this function.
+ *
+ * Modifying the bitmap in any way (other than `-bulk` suffixed functions)
+ * will invalidate the stored context, calling this function with a non-zero
+ * context after doing any modification invokes undefined behavior.
+ *
+ * In order to exploit this optimization, the caller should call this function
+ * with values with the same high 48 bits of the value consecutively.
+ */
+bool roaring64_bitmap_contains_bulk(const roaring64_bitmap_t *r,
+    roaring64_bulk_context_t *context,
+    uint64_t val);
+
+/**
+ * Selects the element at index 'rank' where the smallest element is at index 0.
+ * If the size of the bitmap is strictly greater than rank, then this function
+ * returns true and sets element to the element of given rank. Otherwise, it
+ * returns false.
+ */
+bool roaring64_bitmap_select(const roaring64_bitmap_t *r, uint64_t rank,
+    uint64_t *element);
+
+/**
+ * Returns the number of integers that are smaller or equal to x. Thus if x is
+ * the first element, this function will return 1. If x is smaller than the
+ * smallest element, this function will return 0.
+ *
+ * The indexing convention differs between roaring64_bitmap_select and
+ * roaring64_bitmap_rank: roaring_bitmap64_select refers to the smallest value
+ * as having index 0, whereas roaring64_bitmap_rank returns 1 when ranking
+ * the smallest value.
+ */
+uint64_t roaring64_bitmap_rank(const roaring64_bitmap_t *r, uint64_t val);
+
+/**
+ * Returns true if the given value is in the bitmap, and sets `out_index` to the
+ * (0-based) index of the value in the bitmap. Returns false if the value is not
+ * in the bitmap.
+ */
+bool roaring64_bitmap_get_index(const roaring64_bitmap_t *r, uint64_t val,
+    uint64_t *out_index);
+
+/**
+ * Returns the number of values in the bitmap.
+ */
+uint64_t roaring64_bitmap_get_cardinality(const roaring64_bitmap_t *r);
+
+/**
+ * Returns the number of elements in the range [min, max).
+ */
+uint64_t roaring64_bitmap_range_cardinality(const roaring64_bitmap_t *r,
+    uint64_t min, uint64_t max);
+
+/**
+ * Returns the number of elements in the range [min, max]
+ */
+uint64_t roaring64_bitmap_range_closed_cardinality(const roaring64_bitmap_t *r,
+    uint64_t min, uint64_t max);
+
+/**
+ * Returns true if the bitmap is empty (cardinality is zero).
+ */
+bool roaring64_bitmap_is_empty(const roaring64_bitmap_t *r);
+
+/**
+ * Returns the smallest value in the set, or UINT64_MAX if the set is empty.
+ */
+uint64_t roaring64_bitmap_minimum(const roaring64_bitmap_t *r);
+
+/**
+ * Returns the largest value in the set, or 0 if empty.
+ */
+uint64_t roaring64_bitmap_maximum(const roaring64_bitmap_t *r);
+
+/**
+ * Returns true if the result has at least one run container.
+ */
+bool roaring64_bitmap_run_optimize(roaring64_bitmap_t *r);
+
+/**
+ *  (For advanced users.)
+ * Collect statistics about the bitmap
+ */
+void roaring64_bitmap_statistics(const roaring64_bitmap_t *r,
+    roaring64_statistics_t *stat);
+
+/**
+ * Perform internal consistency checks.
+ *
+ * Returns true if the bitmap is consistent. It may be useful to call this
+ * after deserializing bitmaps from untrusted sources. If
+ * roaring64_bitmap_internal_validate returns true, then the bitmap is
+ * consistent and can be trusted not to cause crashes or memory corruption.
+ *
+ * If reason is non-null, it will be set to a string describing the first
+ * inconsistency found if any.
+ */
+bool roaring64_bitmap_internal_validate(const roaring64_bitmap_t *r,
+    const char **reason);
+
+/**
+ * Return true if the two bitmaps contain the same elements.
+ */
+bool roaring64_bitmap_equals(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Return true if all the elements of r1 are also in r2.
+ */
+bool roaring64_bitmap_is_subset(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Return true if all the elements of r1 are also in r2, and r2 is strictly
+ * greater than r1.
+ */
+bool roaring64_bitmap_is_strict_subset(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Computes the intersection between two bitmaps and returns new bitmap. The
+ * caller is responsible for free-ing the result.
+ *
+ * Performance hint: if you are computing the intersection between several
+ * bitmaps, two-by-two, it is best to start with the smallest bitmaps. You may
+ * also rely on roaring64_bitmap_and_inplace to avoid creating many temporary
+ * bitmaps.
+ */
+roaring64_bitmap_t *roaring64_bitmap_and(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Computes the size of the intersection between two bitmaps.
+ */
+uint64_t roaring64_bitmap_and_cardinality(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * In-place version of `roaring64_bitmap_and()`, modifies `r1`. `r1` and `r2`
+ * are allowed to be equal.
+ *
+ * Performance hint: if you are computing the intersection between several
+ * bitmaps, two-by-two, it is best to start with the smallest bitmaps.
+ */
+void roaring64_bitmap_and_inplace(roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Check whether two bitmaps intersect.
+ */
+bool roaring64_bitmap_intersect(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Check whether a bitmap intersects the range [min, max).
+ */
+bool roaring64_bitmap_intersect_with_range(const roaring64_bitmap_t *r,
+    uint64_t min, uint64_t max);
+
+/**
+ * Computes the Jaccard index between two bitmaps. (Also known as the Tanimoto
+ * distance, or the Jaccard similarity coefficient)
+ *
+ * The Jaccard index is undefined if both bitmaps are empty.
+ */
+double roaring64_bitmap_jaccard_index(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Computes the union between two bitmaps and returns new bitmap. The caller is
+ * responsible for free-ing the result.
+ */
+roaring64_bitmap_t *roaring64_bitmap_or(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Computes the size of the union between two bitmaps.
+ */
+uint64_t roaring64_bitmap_or_cardinality(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * In-place version of `roaring64_bitmap_or(), modifies `r1`.
+ */
+void roaring64_bitmap_or_inplace(roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Computes the symmetric difference (xor) between two bitmaps and returns a new
+ * bitmap. The caller is responsible for free-ing the result.
+ */
+roaring64_bitmap_t *roaring64_bitmap_xor(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Computes the size of the symmetric difference (xor) between two bitmaps.
+ */
+uint64_t roaring64_bitmap_xor_cardinality(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * In-place version of `roaring64_bitmap_xor()`, modifies `r1`. `r1` and `r2`
+ * are not allowed to be equal (that would result in an empty bitmap).
+ */
+void roaring64_bitmap_xor_inplace(roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Computes the difference (andnot) between two bitmaps and returns a new
+ * bitmap. The caller is responsible for free-ing the result.
+ */
+roaring64_bitmap_t *roaring64_bitmap_andnot(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Computes the size of the difference (andnot) between two bitmaps.
+ */
+uint64_t roaring64_bitmap_andnot_cardinality(const roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * In-place version of `roaring64_bitmap_andnot()`, modifies `r1`. `r1` and `r2`
+ * are not allowed to be equal (that would result in an empty bitmap).
+ */
+void roaring64_bitmap_andnot_inplace(roaring64_bitmap_t *r1,
+    const roaring64_bitmap_t *r2);
+
+/**
+ * Compute the negation of the bitmap in the interval [min, max).
+ * The number of negated values is `max - min`. Areas outside the range are
+ * passed through unchanged.
+ */
+roaring64_bitmap_t *roaring64_bitmap_flip(const roaring64_bitmap_t *r,
+    uint64_t min, uint64_t max);
+
+/**
+ * Compute the negation of the bitmap in the interval [min, max].
+ * The number of negated values is `max - min + 1`. Areas outside the range are
+ * passed through unchanged.
+ */
+roaring64_bitmap_t *roaring64_bitmap_flip_closed(const roaring64_bitmap_t *r,
+    uint64_t min, uint64_t max);
+
+/**
+ * In-place version of `roaring64_bitmap_flip`. Compute the negation of the
+ * bitmap in the interval [min, max). The number of negated values is `max -
+ * min`. Areas outside the range are passed through unchanged.
+ */
+void roaring64_bitmap_flip_inplace(roaring64_bitmap_t *r, uint64_t min,
+    uint64_t max);
+/**
+ * In-place version of `roaring64_bitmap_flip_closed`. Compute the negation of
+ * the bitmap in the interval [min, max]. The number of negated values is `max -
+ * min + 1`. Areas outside the range are passed through unchanged.
+ */
+void roaring64_bitmap_flip_closed_inplace(roaring64_bitmap_t *r, uint64_t min,
+    uint64_t max);
+/**
+ * How many bytes are required to serialize this bitmap.
+ *
+ * This is meant to be compatible with other languages:
+ * https://github.com/RoaringBitmap/RoaringFormatSpec#extension-for-64-bit-implementations
+ */
+size_t roaring64_bitmap_portable_size_in_bytes(const roaring64_bitmap_t *r);
+
+/**
+ * Write a bitmap to a buffer. The output buffer should refer to at least
+ * `roaring64_bitmap_portable_size_in_bytes(r)` bytes of allocated memory.
+ *
+ * Returns how many bytes were written, which should match
+ * `roaring64_bitmap_portable_size_in_bytes(r)`.
+ *
+ * This is meant to be compatible with other languages:
+ * https://github.com/RoaringBitmap/RoaringFormatSpec#extension-for-64-bit-implementations
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ *
+ * When serializing data to a file, we recommend that you also use
+ * checksums so that, at deserialization, you can be confident
+ * that you are recovering the correct data.
+ */
+size_t roaring64_bitmap_portable_serialize(const roaring64_bitmap_t *r,
+    char *buf);
+/**
+ * Check how many bytes would be read (up to maxbytes) at this pointer if there
+ * is a valid bitmap, returns zero if there is no valid bitmap.
+ *
+ * This is meant to be compatible with other languages
+ * https://github.com/RoaringBitmap/RoaringFormatSpec#extension-for-64-bit-implementations
+ */
+size_t roaring64_bitmap_portable_deserialize_size(const char *buf,
+    size_t maxbytes);
+
+/**
+ * Read a bitmap from a serialized buffer (reading up to maxbytes).
+ * In case of failure, NULL is returned.
+ *
+ * This is meant to be compatible with other languages
+ * https://github.com/RoaringBitmap/RoaringFormatSpec#extension-for-64-bit-implementations
+ *
+ * The function itself is safe in the sense that it will not cause buffer
+ * overflows: it will not read beyond the scope of the provided buffer
+ * (buf,maxbytes).
+ *
+ * However, for correct operations, it is assumed that the bitmap
+ * read was once serialized from a valid bitmap (i.e., it follows the format
+ * specification). If you provided an incorrect input (garbage), then the bitmap
+ * read may not be in a valid state and following operations may not lead to
+ * sensible results. In particular, the serialized array containers need to be
+ * in sorted order, and the run containers should be in sorted non-overlapping
+ * order. This is is guaranteed to happen when serializing an existing bitmap,
+ * but not for random inputs.
+ *
+ * You may use roaring64_bitmap_internal_validate to check the validity of the
+ * bitmap prior to using it.
+ *
+ * We recommend that you use checksums to check that serialized data corresponds
+ * to a serialized bitmap.
+ *
+ * This function is endian-sensitive. If you have a big-endian system (e.g., a
+ * mainframe IBM s390x), the data format is going to be big-endian and not
+ * compatible with little-endian systems.
+ */
+roaring64_bitmap_t *roaring64_bitmap_portable_deserialize_safe(const char *buf,
+    size_t maxbytes);
+
+/**
+ * Iterate over the bitmap elements. The function `iterator` is called once for
+ * all the values with `ptr` (can be NULL) as the second parameter of each call.
+ *
+ * `roaring_iterator64` is simply a pointer to a function that returns a bool
+ * and takes `(uint64_t, void*)` as inputs. True means that the iteration should
+ * continue, while false means that it should stop.
+ *
+ * Returns true if the `roaring64_iterator` returned true throughout (so that
+ * all data points were necessarily visited).
+ *
+ * Iteration is ordered from the smallest to the largest elements.
+ */
+bool roaring64_bitmap_iterate(const roaring64_bitmap_t *r,
+    roaring_iterator64 iterator, void *ptr);
+
+/**
+ * Convert the bitmap to a sorted array `out`.
+ *
+ * Caller is responsible to ensure that there is enough memory allocated, e.g.
+ * ```
+ * out = malloc(roaring64_bitmap_get_cardinality(bitmap) * sizeof(uint64_t));
+ * ```
+ */
+void roaring64_bitmap_to_uint64_array(const roaring64_bitmap_t *r,
+    uint64_t *out);
+
+/**
+ * Create an iterator object that can be used to iterate through the values.
+ * Caller is responsible for calling `roaring64_iterator_free()`.
+ *
+ * The iterator is initialized. If there is a value, then this iterator points
+ * to the first value and `roaring64_iterator_has_value()` returns true. The
+ * value can be retrieved with `roaring64_iterator_value()`.
+ */
+roaring64_iterator_t *roaring64_iterator_create(const roaring64_bitmap_t *r);
+
+/**
+ * Create an iterator object that can be used to iterate through the values.
+ * Caller is responsible for calling `roaring64_iterator_free()`.
+ *
+ * The iterator is initialized. If there is a value, then this iterator points
+ * to the last value and `roaring64_iterator_has_value()` returns true. The
+ * value can be retrieved with `roaring64_iterator_value()`.
+ */
+roaring64_iterator_t *roaring64_iterator_create_last(
+    const roaring64_bitmap_t *r);
+
+/**
+ * Re-initializes an existing iterator. Functionally the same as
+ * `roaring64_iterator_create` without a allocation.
+ */
+void roaring64_iterator_reinit(const roaring64_bitmap_t *r,
+    roaring64_iterator_t *it);
+
+/**
+ * Re-initializes an existing iterator. Functionally the same as
+ * `roaring64_iterator_create_last` without a allocation.
+ */
+void roaring64_iterator_reinit_last(const roaring64_bitmap_t *r,
+    roaring64_iterator_t *it);
+
+/**
+ * Creates a copy of the iterator. Caller is responsible for calling
+ * `roaring64_iterator_free()` on the resulting iterator.
+ */
+roaring64_iterator_t *roaring64_iterator_copy(const roaring64_iterator_t *it);
+
+/**
+ * Free the iterator.
+ */
+void roaring64_iterator_free(roaring64_iterator_t *it);
+
+/**
+ * Returns true if the iterator currently points to a value. If so, calling
+ * `roaring64_iterator_value()` returns the value.
+ */
+bool roaring64_iterator_has_value(const roaring64_iterator_t *it);
+
+/**
+ * Returns the value the iterator currently points to. Should only be called if
+ * `roaring64_iterator_has_value()` returns true.
+ */
+uint64_t roaring64_iterator_value(const roaring64_iterator_t *it);
+
+/**
+ * Advance the iterator. If there is a new value, then
+ * `roaring64_iterator_has_value()` returns true. Values are traversed in
+ * increasing order. For convenience, returns the result of
+ * `roaring64_iterator_has_value()`.
+ *
+ * Once this returns false, `roaring64_iterator_advance` should not be called on
+ * the iterator again. Calling `roaring64_iterator_previous` is allowed.
+ */
+bool roaring64_iterator_advance(roaring64_iterator_t *it);
+
+/**
+ * Decrement the iterator. If there is a new value, then
+ * `roaring64_iterator_has_value()` returns true. Values are traversed in
+ * decreasing order. For convenience, returns the result of
+ * `roaring64_iterator_has_value()`.
+ *
+ * Once this returns false, `roaring64_iterator_previous` should not be called
+ * on the iterator again. Calling `roaring64_iterator_advance` is allowed.
+ */
+bool roaring64_iterator_previous(roaring64_iterator_t *it);
+
+/**
+ * Move the iterator to the first value greater than or equal to `val`, if it
+ * exists at or after the current position of the iterator. If there is a new
+ * value, then `roaring64_iterator_has_value()` returns true. Values are
+ * traversed in increasing order. For convenience, returns the result of
+ * `roaring64_iterator_has_value()`.
+ */
+bool roaring64_iterator_move_equalorlarger(roaring64_iterator_t *it,
+    uint64_t val);
+
+/**
+ * Reads up to `count` values from the iterator into the given `buf`. Returns
+ * the number of elements read. The number of elements read can be smaller than
+ * `count`, which means that there are no more elements in the bitmap.
+ *
+ * This function can be used together with other iterator functions.
+ */
+uint64_t roaring64_iterator_read(roaring64_iterator_t *it, uint64_t *buf,
+    uint64_t count);
+
+#ifdef __cplusplus
+}  // extern "C"
+}  // namespace roaring
+}  // namespace api
+#endif
+
+#endif /* ROARING64_H */
+/* end file include/roaring/roaring64.h */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/roaring.hh b/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/roaring.hh
new file mode 100644
index 0000000000..977ac3904a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/roaring_bitmap/roaring.hh
@@ -0,0 +1,2934 @@
+// !!! DO NOT EDIT - THIS IS AN AUTO-GENERATED FILE !!!
+// Created by amalgamation.sh on 2024-09-21T13:18:57Z
+
+/*
+ * The CRoaring project is under a dual license (Apache/MIT).
+ * Users of the library may choose one or the other license.
+ */
+/*
+ * Copyright 2016-2022 The CRoaring authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *    http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ *
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/*
+ * MIT License
+ *
+ * Copyright 2016-2022 The CRoaring authors
+ *
+ * Permission is hereby granted, free of charge, to any
+ * person obtaining a copy of this software and associated
+ * documentation files (the "Software"), to deal in the
+ * Software without restriction, including without
+ * limitation the rights to use, copy, modify, merge,
+ * publish, distribute, sublicense, and/or sell copies of
+ * the Software, and to permit persons to whom the Software
+ * is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice
+ * shall be included in all copies or substantial portions
+ * of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ * ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+ * TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+ * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+ * SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+ * IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+ * DEALINGS IN THE SOFTWARE.
+ *
+ * SPDX-License-Identifier: MIT
+ */
+
+#define ROARING_API_NOT_IN_GLOBAL_NAMESPACE  // see remarks in roaring.h
+#include "roaring.h"
+#undef ROARING_API_NOT_IN_GLOBAL_NAMESPACE
+/* begin file cpp/roaring.hh */
+/*
+A C++ header for Roaring Bitmaps.
+*/
+#ifndef INCLUDE_ROARING_HH_
+#define INCLUDE_ROARING_HH_
+
+#include <algorithm>
+#include <cstdarg>
+#include <initializer_list>
+#include <new>
+#include <stdexcept>
+#include <string>
+
+#if !defined(ROARING_EXCEPTIONS)
+// __cpp_exceptions is required by C++98 and we require C++11 or better.
+#ifndef __cpp_exceptions
+#error "__cpp_exceptions should be defined"
+#endif
+#if __cpp_exceptions
+#define ROARING_EXCEPTIONS 1
+#else
+#define ROARING_EXCEPTIONS 0
+#endif
+#endif
+
+#ifndef ROARING_TERMINATE
+#if ROARING_EXCEPTIONS
+#define ROARING_TERMINATE(_s) throw std::runtime_error(_s)
+#else
+#define ROARING_TERMINATE(_s) std::terminate()
+#endif
+#endif
+
+#define ROARING_API_NOT_IN_GLOBAL_NAMESPACE  // see remarks in roaring.h
+#undef ROARING_API_NOT_IN_GLOBAL_NAMESPACE
+
+
+namespace roaring {
+
+class RoaringSetBitForwardIterator;
+
+/**
+ * A bit of context usable with `*Bulk()` functions.
+ *
+ * A context may only be used with a single bitmap, and any modification to a
+ * bitmap (other than modifications performed with `Bulk()` functions with the
+ * context passed) will invalidate any contexts associated with that bitmap.
+ */
+class BulkContext {
+public:
+    friend class Roaring;
+    using roaring_bitmap_bulk_context_t = api::roaring_bulk_context_t;
+    BulkContext() : context_{nullptr, 0, 0, 0} {}
+
+    BulkContext(const BulkContext &) = delete;
+    BulkContext &operator=(const BulkContext &) = delete;
+    BulkContext(BulkContext &&) noexcept = default;
+    BulkContext &operator=(BulkContext &&) noexcept = default;
+
+private:
+    roaring_bitmap_bulk_context_t context_;
+};
+
+class Roaring {
+    typedef api::roaring_bitmap_t roaring_bitmap_t;  // class-local name alias
+
+public:
+    /**
+     * Create an empty bitmap in the existing memory for the class.
+     * The bitmap will be in the "clear" state with no auxiliary allocations.
+     */
+    Roaring() : roaring{} {
+        // The empty constructor roaring{} silences warnings from pedantic
+        // static analyzers.
+        api::roaring_bitmap_init_cleared(&roaring);
+    }
+
+    /**
+     * Construct a bitmap from a list of 32-bit integer values.
+     */
+    Roaring(size_t n, const uint32_t *data) : Roaring() {
+        api::roaring_bitmap_add_many(&roaring, n, data);
+    }
+
+    /**
+     * Construct a bitmap from an initializer list.
+     */
+    Roaring(std::initializer_list<uint32_t> l) : Roaring() {
+        addMany(l.size(), l.begin());
+    }
+
+    /**
+     * Copy constructor.
+     * It may throw std::runtime_error if there is insufficient memory.
+     */
+    Roaring(const Roaring &r) : Roaring() {
+        if (!api::roaring_bitmap_overwrite(&roaring, &r.roaring)) {
+            ROARING_TERMINATE("failed roaring_bitmap_overwrite in constructor");
+        }
+        api::roaring_bitmap_set_copy_on_write(
+            &roaring, api::roaring_bitmap_get_copy_on_write(&r.roaring));
+    }
+
+    /**
+     * Move constructor. The moved-from object remains valid but empty, i.e.
+     * it behaves as though it was just freshly constructed.
+     */
+    Roaring(Roaring &&r) noexcept : roaring(r.roaring) {
+        //
+        // !!! This clones the bits of the roaring structure to a new location
+        // and then overwrites the old bits...assuming that this will still
+        // work.  There are scenarios where this could break; e.g. if some of
+        // those bits were pointers into the structure memory itself.  If such
+        // things were possible, a roaring_bitmap_move() API would be needed.
+        //
+        api::roaring_bitmap_init_cleared(&r.roaring);
+    }
+
+    /**
+     * Construct a roaring object by taking control of a malloc()'d C struct.
+     *
+     * Passing a NULL pointer is unsafe.
+     * The pointer to the C struct will be invalid after the call.
+     */
+    explicit Roaring(roaring_bitmap_t *s) noexcept : roaring(*s) {
+        roaring_free(s);  // deallocate the passed-in pointer
+    }
+
+    /**
+     * Construct a bitmap from a list of uint32_t values.
+     */
+    static Roaring bitmapOf(size_t n, ...) {
+        Roaring ans;
+        va_list vl;
+        va_start(vl, n);
+        for (size_t i = 0; i < n; i++) {
+            ans.add(va_arg(vl, uint32_t));
+        }
+        va_end(vl);
+        return ans;
+    }
+
+    /**
+     * Construct a bitmap from a list of uint32_t values.
+     * E.g., bitmapOfList({1,2,3}).
+     */
+    static Roaring bitmapOfList(std::initializer_list<uint32_t> l) {
+        Roaring ans;
+        ans.addMany(l.size(), l.begin());
+        return ans;
+    }
+
+    /**
+     * Add value x
+     */
+    void add(uint32_t x) noexcept { api::roaring_bitmap_add(&roaring, x); }
+
+    /**
+     * Add value x
+     * Returns true if a new value was added, false if the value was already
+     * existing.
+     */
+    bool addChecked(uint32_t x) noexcept {
+        return api::roaring_bitmap_add_checked(&roaring, x);
+    }
+
+    /**
+     * Add all values in range [min, max)
+     */
+    void addRange(const uint64_t min, const uint64_t max) noexcept {
+        return api::roaring_bitmap_add_range(&roaring, min, max);
+    }
+
+    /**
+     * Add all values in range [min, max]
+     */
+    void addRangeClosed(const uint32_t min, const uint32_t max) noexcept {
+        return api::roaring_bitmap_add_range_closed(&roaring, min, max);
+    }
+
+    /**
+     * Add value n_args from pointer vals
+     */
+    void addMany(size_t n_args, const uint32_t *vals) noexcept {
+        api::roaring_bitmap_add_many(&roaring, n_args, vals);
+    }
+
+    /**
+     * Add value val, using context from a previous insert for speed
+     * optimization.
+     *
+     * `context` will be used to store information between calls to make bulk
+     * operations faster. `context` should be default-initialized before the
+     * first call to this function.
+     */
+    void addBulk(BulkContext &context, uint32_t x) noexcept {
+        api::roaring_bitmap_add_bulk(&roaring, &context.context_, x);
+    }
+
+    /**
+     * Check if item x is present, using context from a previous insert or
+     * search for speed optimization.
+     *
+     * `context` will be used to store information between calls to make bulk
+     * operations faster. `context` should be default-initialized before the
+     * first call to this function.
+     */
+    bool containsBulk(BulkContext &context, uint32_t x) const noexcept {
+        return api::roaring_bitmap_contains_bulk(&roaring, &context.context_,
+            x);
+    }
+
+    /**
+     * Remove value x
+     */
+    void remove(uint32_t x) noexcept {
+        api::roaring_bitmap_remove(&roaring, x);
+    }
+
+    /**
+     * Remove value x
+     * Returns true if a new value was removed, false if the value was not
+     * existing.
+     */
+    bool removeChecked(uint32_t x) noexcept {
+        return api::roaring_bitmap_remove_checked(&roaring, x);
+    }
+
+    /**
+     * Remove all values in range [min, max)
+     */
+    void removeRange(uint64_t min, uint64_t max) noexcept {
+        return api::roaring_bitmap_remove_range(&roaring, min, max);
+    }
+
+    /**
+     * Remove all values in range [min, max]
+     */
+    void removeRangeClosed(uint32_t min, uint32_t max) noexcept {
+        return api::roaring_bitmap_remove_range_closed(&roaring, min, max);
+    }
+
+    /**
+     * Return the largest value (if not empty)
+     */
+    uint32_t maximum() const noexcept {
+        return api::roaring_bitmap_maximum(&roaring);
+    }
+
+    /**
+     * Return the smallest value (if not empty)
+     */
+    uint32_t minimum() const noexcept {
+        return api::roaring_bitmap_minimum(&roaring);
+    }
+
+    /**
+     * Check if value x is present
+     */
+    bool contains(uint32_t x) const noexcept {
+        return api::roaring_bitmap_contains(&roaring, x);
+    }
+
+    /**
+     * Check if all values from x (included) to y (excluded) are present
+     */
+    bool containsRange(const uint64_t x, const uint64_t y) const noexcept {
+        return api::roaring_bitmap_contains_range(&roaring, x, y);
+    }
+
+    /**
+     * Destructor.  By contract, calling roaring_bitmap_clear() is enough to
+     * release all auxiliary memory used by the structure.
+     */
+    ~Roaring() {
+        if (!(roaring.high_low_container.flags & ROARING_FLAG_FROZEN)) {
+            api::roaring_bitmap_clear(&roaring);
+        } else {
+            // The roaring member variable copies the `roaring_bitmap_t` and
+            // nested `roaring_array_t` structures by value and is freed in the
+            // constructor, however the underlying memory arena used for the
+            // container data is not freed with it. Here we derive the arena
+            // pointer from the second arena allocation in
+            // `roaring_bitmap_frozen_view` and free it as well.
+            roaring_bitmap_free(
+                (roaring_bitmap_t *)((char *)
+                                        roaring.high_low_container.containers -
+                                    sizeof(roaring_bitmap_t)));
+        }
+    }
+
+    /**
+     * Copies the content of the provided bitmap, and
+     * discard the current content.
+     * It may throw std::runtime_error if there is insufficient memory.
+     */
+    Roaring &operator=(const Roaring &r) {
+        if (!api::roaring_bitmap_overwrite(&roaring, &r.roaring)) {
+            ROARING_TERMINATE("failed memory alloc in assignment");
+        }
+        api::roaring_bitmap_set_copy_on_write(
+            &roaring, api::roaring_bitmap_get_copy_on_write(&r.roaring));
+        return *this;
+    }
+
+    /**
+     * Moves the content of the provided bitmap, and
+     * discard the current content.
+     */
+    Roaring &operator=(Roaring &&r) noexcept {
+        api::roaring_bitmap_clear(&roaring);  // free this class's allocations
+
+        // !!! See notes in the Move Constructor regarding roaring_bitmap_move()
+        //
+        roaring = r.roaring;
+        api::roaring_bitmap_init_cleared(&r.roaring);
+
+        return *this;
+    }
+
+    /**
+     * Assignment from an initializer list.
+     */
+    Roaring &operator=(std::initializer_list<uint32_t> l) {
+        // Delegate to move assignment operator
+        *this = Roaring(l);
+        return *this;
+    }
+
+    /**
+     * Compute the intersection between the current bitmap and the provided
+     * bitmap, writing the result in the current bitmap. The provided bitmap
+     * is not modified.
+     *
+     * Performance hint: if you are computing the intersection between several
+     * bitmaps, two-by-two, it is best to start with the smallest bitmap.
+     */
+    Roaring &operator&=(const Roaring &r) noexcept {
+        api::roaring_bitmap_and_inplace(&roaring, &r.roaring);
+        return *this;
+    }
+
+    /**
+     * Compute the difference between the current bitmap and the provided
+     * bitmap, writing the result in the current bitmap. The provided bitmap
+     * is not modified.
+     */
+    Roaring &operator-=(const Roaring &r) noexcept {
+        api::roaring_bitmap_andnot_inplace(&roaring, &r.roaring);
+        return *this;
+    }
+
+    /**
+     * Compute the union between the current bitmap and the provided bitmap,
+     * writing the result in the current bitmap. The provided bitmap is not
+     * modified.
+     *
+     * See also the fastunion function to aggregate many bitmaps more quickly.
+     */
+    Roaring &operator|=(const Roaring &r) noexcept {
+        api::roaring_bitmap_or_inplace(&roaring, &r.roaring);
+        return *this;
+    }
+
+    /**
+     * Compute the symmetric union between the current bitmap and the provided
+     * bitmap, writing the result in the current bitmap. The provided bitmap
+     * is not modified.
+     */
+    Roaring &operator^=(const Roaring &r) noexcept {
+        api::roaring_bitmap_xor_inplace(&roaring, &r.roaring);
+        return *this;
+    }
+
+    /**
+     * Exchange the content of this bitmap with another.
+     */
+    void swap(Roaring &r) noexcept { std::swap(r.roaring, roaring); }
+
+    /**
+     * Get the cardinality of the bitmap (number of elements).
+     */
+    uint64_t cardinality() const noexcept {
+        return api::roaring_bitmap_get_cardinality(&roaring);
+    }
+
+    /**
+     * Returns true if the bitmap is empty (cardinality is zero).
+     */
+    bool isEmpty() const noexcept {
+        return api::roaring_bitmap_is_empty(&roaring);
+    }
+
+    /**
+     * Returns true if the bitmap is subset of the other.
+     */
+    bool isSubset(const Roaring &r) const noexcept {
+        return api::roaring_bitmap_is_subset(&roaring, &r.roaring);
+    }
+
+    /**
+     * Returns true if the bitmap is strict subset of the other.
+     */
+    bool isStrictSubset(const Roaring &r) const noexcept {
+        return api::roaring_bitmap_is_strict_subset(&roaring, &r.roaring);
+    }
+
+    /**
+     * Convert the bitmap to an array. Write the output to "ans", caller is
+     * responsible to ensure that there is enough memory allocated
+     * (e.g., ans = new uint32[mybitmap.cardinality()];)
+     */
+    void toUint32Array(uint32_t *ans) const noexcept {
+        api::roaring_bitmap_to_uint32_array(&roaring, ans);
+    }
+    /**
+     * To int array with pagination
+     */
+    void rangeUint32Array(uint32_t *ans, size_t offset,
+        size_t limit) const noexcept {
+        api::roaring_bitmap_range_uint32_array(&roaring, offset, limit, ans);
+    }
+
+    /**
+     * Return true if the two bitmaps contain the same elements.
+     */
+    bool operator==(const Roaring &r) const noexcept {
+        return api::roaring_bitmap_equals(&roaring, &r.roaring);
+    }
+
+    /**
+     * Compute the negation of the roaring bitmap within the half-open interval
+     * [range_start, range_end). Areas outside the interval are unchanged.
+     */
+    void flip(uint64_t range_start, uint64_t range_end) noexcept {
+        api::roaring_bitmap_flip_inplace(&roaring, range_start, range_end);
+    }
+
+    /**
+     * Compute the negation of the roaring bitmap within the closed interval
+     * [range_start, range_end]. Areas outside the interval are unchanged.
+     */
+    void flipClosed(uint32_t range_start, uint32_t range_end) noexcept {
+        api::roaring_bitmap_flip_inplace(&roaring, range_start,
+            uint64_t(range_end) + 1);
+    }
+
+    /**
+     * Remove run-length encoding even when it is more space efficient.
+     * Return whether a change was applied.
+     */
+    bool removeRunCompression() noexcept {
+        return api::roaring_bitmap_remove_run_compression(&roaring);
+    }
+
+    /**
+     * Convert array and bitmap containers to run containers when it is more
+     * efficient; also convert from run containers when more space efficient.
+     * Returns true if the result has at least one run container.  Additional
+     * savings might be possible by calling shrinkToFit().
+     */
+    bool runOptimize() noexcept {
+        return api::roaring_bitmap_run_optimize(&roaring);
+    }
+
+    /**
+     * If needed, reallocate memory to shrink the memory usage. Returns
+     * the number of bytes saved.
+     */
+    size_t shrinkToFit() noexcept {
+        return api::roaring_bitmap_shrink_to_fit(&roaring);
+    }
+
+    /**
+     * Iterate over the bitmap elements. The function iterator is called once
+     * for all the values with ptr (can be NULL) as the second parameter of
+     * each call.
+     *
+     * roaring_iterator is simply a pointer to a function that returns bool
+     * (true means that the iteration should continue while false means that it
+     * should stop), and takes (uint32_t,void*) as inputs.
+     */
+    void iterate(api::roaring_iterator iterator, void *ptr) const {
+        api::roaring_iterate(&roaring, iterator, ptr);
+    }
+
+    /**
+     * Selects the value at index rnk in the bitmap, where the smallest value
+     * is at index 0.
+     *
+     * If the size of the roaring bitmap is strictly greater than rank, then
+     * this function returns true and sets element to the element of given rank.
+     * Otherwise, it returns false.
+     */
+    bool select(uint32_t rnk, uint32_t *element) const noexcept {
+        return api::roaring_bitmap_select(&roaring, rnk, element);
+    }
+
+    /**
+     * Computes the size of the intersection between two bitmaps.
+     */
+    uint64_t and_cardinality(const Roaring &r) const noexcept {
+        return api::roaring_bitmap_and_cardinality(&roaring, &r.roaring);
+    }
+
+    /**
+     * Check whether the two bitmaps intersect.
+     */
+    bool intersect(const Roaring &r) const noexcept {
+        return api::roaring_bitmap_intersect(&roaring, &r.roaring);
+    }
+
+    /**
+     * Computes the Jaccard index between two bitmaps. (Also known as the
+     * Tanimoto distance,
+     * or the Jaccard similarity coefficient)
+     *
+     * The Jaccard index is undefined if both bitmaps are empty.
+     */
+    double jaccard_index(const Roaring &r) const noexcept {
+        return api::roaring_bitmap_jaccard_index(&roaring, &r.roaring);
+    }
+
+    /**
+     * Computes the size of the union between two bitmaps.
+     */
+    uint64_t or_cardinality(const Roaring &r) const noexcept {
+        return api::roaring_bitmap_or_cardinality(&roaring, &r.roaring);
+    }
+
+    /**
+     * Computes the size of the difference (andnot) between two bitmaps.
+     */
+    uint64_t andnot_cardinality(const Roaring &r) const noexcept {
+        return api::roaring_bitmap_andnot_cardinality(&roaring, &r.roaring);
+    }
+
+    /**
+     * Computes the size of the symmetric difference (andnot) between two
+     * bitmaps.
+     */
+    uint64_t xor_cardinality(const Roaring &r) const noexcept {
+        return api::roaring_bitmap_xor_cardinality(&roaring, &r.roaring);
+    }
+
+    /**
+     * Returns the number of integers that are smaller or equal to x.
+     * Thus the rank of the smallest element is one.  If
+     * x is smaller than the smallest element, this function will return 0.
+     * The rank and select functions differ in convention: this function returns
+     * 1 when ranking the smallest value, but the select function returns the
+     * smallest value when using index 0.
+     */
+    uint64_t rank(uint32_t x) const noexcept {
+        return api::roaring_bitmap_rank(&roaring, x);
+    }
+
+    /**
+     * Get `rank()` values in bulk. The values in `[begin .. end)` must be in
+     * Ascending order. possible implementation: for(auto* iter = begin; iter !=
+     * end; ++iter) *(ans++) = rank(*iter);
+     */
+    void rank_many(const uint32_t *begin, const uint32_t *end,
+        uint64_t *ans) const noexcept {
+        return api::roaring_bitmap_rank_many(&roaring, begin, end, ans);
+    }
+
+    /**
+     * Returns the index of x in the set, index start from 0.
+     * If the set doesn't contain x , this function will return -1.
+     * The difference with rank function is that this function will return -1
+     * when x isn't in the set, but the rank function will return a
+     * non-negative number.
+     */
+    int64_t getIndex(uint32_t x) const noexcept {
+        return api::roaring_bitmap_get_index(&roaring, x);
+    }
+
+    /**
+     * Write a bitmap to a char buffer. This is meant to be compatible with
+     * the Java and Go versions. Returns how many bytes were written which
+     * should be getSizeInBytes().
+     *
+     * Setting the portable flag to false enable a custom format that
+     * can save space compared to the portable format (e.g., for very
+     * sparse bitmaps).
+     *
+     * Boost users can serialize bitmaps in this manner:
+     *
+     *       BOOST_SERIALIZATION_SPLIT_FREE(Roaring)
+     *       namespace boost {
+     *       namespace serialization {
+     *
+     *       template <class Archive>
+     *       void save(Archive& ar, const Roaring& bitmask,
+     *          const unsigned int version) {
+     *         std::size_t expected_size_in_bytes = bitmask.getSizeInBytes();
+     *         std::vector<char> buffer(expected_size_in_bytes);
+     *         std::size_t       size_in_bytes = bitmask.write(buffer.data());
+     *
+     *         ar& size_in_bytes;
+     *         ar& boost::serialization::make_binary_object(buffer.data(),
+     *             size_in_bytes);
+     *      }
+     *      template <class Archive>
+     *      void load(Archive& ar, Roaring& bitmask,
+     *          const unsigned int version) {
+     *         std::size_t size_in_bytes = 0;
+     *         ar& size_in_bytes;
+     *         std::vector<char> buffer(size_in_bytes);
+     *         ar&  boost::serialization::make_binary_object(buffer.data(),
+     *            size_in_bytes);
+     *         bitmask = Roaring::readSafe(buffer.data(), size_in_bytes);
+     *      }
+     *      }  // namespace serialization
+     *      }  // namespace boost
+     */
+    size_t write(char *buf, bool portable = true) const noexcept {
+        if (portable) {
+            return api::roaring_bitmap_portable_serialize(&roaring, buf);
+        } else {
+            return api::roaring_bitmap_serialize(&roaring, buf);
+        }
+    }
+
+    /**
+     * Read a bitmap from a serialized version. This is meant to be compatible
+     * with the Java and Go versions.
+     *
+     * Setting the portable flag to false enable a custom format that
+     * can save space compared to the portable format (e.g., for very
+     * sparse bitmaps).
+     *
+     * This function is unsafe in the sense that if you provide bad data,
+     * many, many bytes could be read. See also readSafe.
+     *
+     * The function may throw std::runtime_error if a bitmap could not be read.
+     * Not that even if it does not throw, the bitmap could still be unusable if
+     * the loaded data does not match the portable Roaring specification: you
+     * should ensure that the data you load come from a serialized bitmap.
+     */
+    static Roaring read(const char *buf, bool portable = true) {
+        roaring_bitmap_t *r =
+            portable ? api::roaring_bitmap_portable_deserialize(buf)
+                       : api::roaring_bitmap_deserialize(buf);
+        if (r == NULL) {
+            ROARING_TERMINATE("failed alloc while reading");
+        }
+        return Roaring(r);
+    }
+
+    /**
+     * Read a bitmap from a serialized version, reading no more than maxbytes
+     * bytes.  This is meant to be compatible with the Java and Go versions.
+     * The function itself is safe in the sense that it will not cause buffer
+     * overflows. However, for correct operations, it is assumed that the bitmap
+     * read was once serialized from a valid bitmap. If you provided an
+     * incorrect input (garbage), then the bitmap read may not be in a valid
+     * state and following operations may not lead to sensible results. It is
+     * your responsability to ensure that the input bytes follow the format
+     * specification if you want a usable bitmap:
+     * https://github.com/RoaringBitmap/RoaringFormatSpec
+     * In particular, the serialized array containers need to be in sorted
+     * order, and the run containers should be in sorted non-overlapping order.
+     * This is is guaranteed to happen when serializing an existing bitmap, but
+     * not for random inputs. Note that this function assumes that your bitmap
+     * was serialized in *portable* mode (which is the default with the 'write'
+     * method).
+     *
+     * The function may throw std::runtime_error if a bitmap could not be read.
+     * Not that even if it does not throw, the bitmap could still be unusable if
+     * the loaded data does not match the portable Roaring specification: you
+     * should ensure that the data you load come from a serialized bitmap.
+     */
+    static Roaring readSafe(const char *buf, size_t maxbytes) {
+        roaring_bitmap_t *r =
+            api::roaring_bitmap_portable_deserialize_safe(buf, maxbytes);
+        if (r == NULL) {
+            ROARING_TERMINATE("failed alloc while reading");
+        }
+        return Roaring(r);
+    }
+
+    /**
+     * How many bytes are required to serialize this bitmap (meant to be
+     * compatible with Java and Go versions)
+     *
+     * Setting the portable flag to false enable a custom format that
+     * can save space compared to the portable format (e.g., for very
+     * sparse bitmaps).
+     */
+    size_t getSizeInBytes(bool portable = true) const noexcept {
+        if (portable) {
+            return api::roaring_bitmap_portable_size_in_bytes(&roaring);
+        } else {
+            return api::roaring_bitmap_size_in_bytes(&roaring);
+        }
+    }
+
+    /**
+     * For advanced users.
+     * This function may throw std::runtime_error.
+     */
+    static const Roaring frozenView(const char *buf, size_t length) {
+        const roaring_bitmap_t *s =
+            api::roaring_bitmap_frozen_view(buf, length);
+        if (s == NULL) {
+            ROARING_TERMINATE("failed to read frozen bitmap");
+        }
+        Roaring r;
+        r.roaring = *s;
+        return r;
+    }
+
+    /**
+     * For advanced users; see roaring_bitmap_portable_deserialize_frozen.
+     * This function may throw std::runtime_error.
+     */
+    static const Roaring portableDeserializeFrozen(const char *buf) {
+        const roaring_bitmap_t *s =
+            api::roaring_bitmap_portable_deserialize_frozen(buf);
+        if (s == NULL) {
+            ROARING_TERMINATE("failed to read portable frozen bitmap");
+        }
+        Roaring r;
+        r.roaring = *s;
+        return r;
+    }
+
+    /**
+     * For advanced users.
+     */
+    void writeFrozen(char *buf) const noexcept {
+        roaring_bitmap_frozen_serialize(&roaring, buf);
+    }
+
+    /**
+     * For advanced users.
+     */
+    size_t getFrozenSizeInBytes() const noexcept {
+        return roaring_bitmap_frozen_size_in_bytes(&roaring);
+    }
+
+    /**
+     * Computes the intersection between two bitmaps and returns new bitmap.
+     * The current bitmap and the provided bitmap are unchanged.
+     *
+     * Performance hint: if you are computing the intersection between several
+     * bitmaps, two-by-two, it is best to start with the smallest bitmap.
+     * Consider also using the operator &= to avoid needlessly creating
+     * many temporary bitmaps.
+     * This function may throw std::runtime_error.
+     */
+    Roaring operator&(const Roaring &o) const {
+        roaring_bitmap_t *r = api::roaring_bitmap_and(&roaring, &o.roaring);
+        if (r == NULL) {
+            ROARING_TERMINATE("failed materalization in and");
+        }
+        return Roaring(r);
+    }
+
+    /**
+     * Computes the difference between two bitmaps and returns new bitmap.
+     * The current bitmap and the provided bitmap are unchanged.
+     * This function may throw std::runtime_error.
+     */
+    Roaring operator-(const Roaring &o) const {
+        roaring_bitmap_t *r = api::roaring_bitmap_andnot(&roaring, &o.roaring);
+        if (r == NULL) {
+            ROARING_TERMINATE("failed materalization in andnot");
+        }
+        return Roaring(r);
+    }
+
+    /**
+     * Computes the union between two bitmaps and returns new bitmap.
+     * The current bitmap and the provided bitmap are unchanged.
+     * This function may throw std::runtime_error.
+     */
+    Roaring operator|(const Roaring &o) const {
+        roaring_bitmap_t *r = api::roaring_bitmap_or(&roaring, &o.roaring);
+        if (r == NULL) {
+            ROARING_TERMINATE("failed materalization in or");
+        }
+        return Roaring(r);
+    }
+
+    /**
+     * Computes the symmetric union between two bitmaps and returns new bitmap.
+     * The current bitmap and the provided bitmap are unchanged.
+     * This function may throw std::runtime_error.
+     */
+    Roaring operator^(const Roaring &o) const {
+        roaring_bitmap_t *r = api::roaring_bitmap_xor(&roaring, &o.roaring);
+        if (r == NULL) {
+            ROARING_TERMINATE("failed materalization in xor");
+        }
+        return Roaring(r);
+    }
+
+    /**
+     * Whether or not we apply copy and write.
+     */
+    void setCopyOnWrite(bool val) noexcept {
+        api::roaring_bitmap_set_copy_on_write(&roaring, val);
+    }
+
+    /**
+     * Print the content of the bitmap
+     */
+    void printf() const noexcept { api::roaring_bitmap_printf(&roaring); }
+
+    /**
+     * Print the content of the bitmap into a string
+     */
+    std::string toString() const noexcept {
+        struct iter_data {
+            std::string str{};  // The empty constructor silences warnings from
+                               // pedantic static analyzers.
+            char first_char = '{';
+        } outer_iter_data;
+        if (!isEmpty()) {
+            iterate(
+                [](uint32_t value, void *inner_iter_data) -> bool {
+                    ((iter_data *)inner_iter_data)->str +=
+                        ((iter_data *)inner_iter_data)->first_char;
+                    ((iter_data *)inner_iter_data)->str +=
+                        std::to_string(value);
+                    ((iter_data *)inner_iter_data)->first_char = ',';
+                    return true;
+                },
+                (void *)&outer_iter_data);
+        } else
+            outer_iter_data.str = '{';
+        outer_iter_data.str += '}';
+        return outer_iter_data.str;
+    }
+
+    /**
+     * Whether or not copy and write is active.
+     */
+    bool getCopyOnWrite() const noexcept {
+        return api::roaring_bitmap_get_copy_on_write(&roaring);
+    }
+
+    /**
+     * Computes the logical or (union) between "n" bitmaps (referenced by a
+     * pointer).
+     * This function may throw std::runtime_error.
+     */
+    static Roaring fastunion(size_t n, const Roaring **inputs) {
+        const roaring_bitmap_t **x = (const roaring_bitmap_t **)roaring_malloc(
+            n * sizeof(roaring_bitmap_t *));
+        if (x == NULL) {
+            ROARING_TERMINATE("failed memory alloc in fastunion");
+        }
+        for (size_t k = 0; k < n; ++k) x[k] = &inputs[k]->roaring;
+
+        roaring_bitmap_t *c_ans = api::roaring_bitmap_or_many(n, x);
+        if (c_ans == NULL) {
+            roaring_free(x);
+            ROARING_TERMINATE("failed memory alloc in fastunion");
+        }
+        Roaring ans(c_ans);
+        roaring_free(x);
+        return ans;
+    }
+
+    typedef RoaringSetBitForwardIterator const_iterator;
+
+    /**
+     * Returns an iterator that can be used to access the position of the set
+     * bits. The running time complexity of a full scan is proportional to the
+     * number of set bits: be aware that if you have long strings of 1s, this
+     * can be very inefficient.
+     *
+     * It can be much faster to use the toArray method if you want to retrieve
+     * the set bits.
+     */
+    const_iterator begin() const;
+
+    /**
+     * A bogus iterator that can be used together with begin()
+     * for constructions such as for (auto i = b.begin(); * i!=b.end(); ++i) {}
+     */
+    const_iterator &end() const;
+
+    roaring_bitmap_t roaring;
+};
+
+/**
+ * Used to go through the set bits. Not optimally fast, but convenient.
+ */
+class RoaringSetBitForwardIterator final {
+public:
+    typedef std::forward_iterator_tag iterator_category;
+    typedef uint32_t *pointer;
+    typedef uint32_t &reference_type;
+    typedef uint32_t value_type;
+    typedef int32_t difference_type;
+    typedef RoaringSetBitForwardIterator type_of_iterator;
+
+    /**
+     * Provides the location of the set bit.
+     */
+    value_type operator*() const { return i.current_value; }
+
+    bool operator<(const type_of_iterator &o) const {
+        if (!i.has_value) return false;
+        if (!o.i.has_value) return true;
+        return i.current_value < *o;
+    }
+
+    bool operator<=(const type_of_iterator &o) const {
+        if (!o.i.has_value) return true;
+        if (!i.has_value) return false;
+        return i.current_value <= *o;
+    }
+
+    bool operator>(const type_of_iterator &o) const {
+        if (!o.i.has_value) return false;
+        if (!i.has_value) return true;
+        return i.current_value > *o;
+    }
+
+    bool operator>=(const type_of_iterator &o) const {
+        if (!i.has_value) return true;
+        if (!o.i.has_value) return false;
+        return i.current_value >= *o;
+    }
+
+    /**
+     * Move the iterator to the first value >= val.
+     */
+    void equalorlarger(uint32_t val) {
+        api::roaring_uint32_iterator_move_equalorlarger(&i, val);
+    }
+
+    type_of_iterator &operator++() {  // ++i, must returned inc. value
+        api::roaring_uint32_iterator_advance(&i);
+        return *this;
+    }
+
+    type_of_iterator operator++(int) {  // i++, must return orig. value
+        RoaringSetBitForwardIterator orig(*this);
+        api::roaring_uint32_iterator_advance(&i);
+        return orig;
+    }
+
+    type_of_iterator &operator--() {  // prefix --
+        api::roaring_uint32_iterator_previous(&i);
+        return *this;
+    }
+
+    type_of_iterator operator--(int) {  // postfix --
+        RoaringSetBitForwardIterator orig(*this);
+        api::roaring_uint32_iterator_previous(&i);
+        return orig;
+    }
+
+    bool operator==(const RoaringSetBitForwardIterator &o) const {
+        return i.current_value == *o && i.has_value == o.i.has_value;
+    }
+
+    bool operator!=(const RoaringSetBitForwardIterator &o) const {
+        return i.current_value != *o || i.has_value != o.i.has_value;
+    }
+
+    explicit RoaringSetBitForwardIterator(const Roaring &parent,
+        bool exhausted = false) {
+        if (exhausted) {
+            i.parent = &parent.roaring;
+            i.container_index = INT32_MAX;
+            i.has_value = false;
+            i.current_value = UINT32_MAX;
+        } else {
+            api::roaring_iterator_init(&parent.roaring, &i);
+        }
+    }
+
+    api::roaring_uint32_iterator_t
+        i{};  // The empty constructor silences warnings from pedantic static
+             // analyzers.
+};
+
+inline RoaringSetBitForwardIterator Roaring::begin() const {
+    return RoaringSetBitForwardIterator(*this);
+}
+
+inline RoaringSetBitForwardIterator &Roaring::end() const {
+    static RoaringSetBitForwardIterator e(*this, true);
+    return e;
+}
+
+}  // namespace roaring
+
+#endif /* INCLUDE_ROARING_HH_ */
+/* end file cpp/roaring.hh */
+/* begin file cpp/roaring64map.hh */
+/**
+ * A C++ header for 64-bit Roaring Bitmaps,
+ * implemented by way of a map of many
+ * 32-bit Roaring Bitmaps.
+ *
+ * Reference (format specification) :
+ * https://github.com/RoaringBitmap/RoaringFormatSpec#extention-for-64-bit-implementations
+ */
+#ifndef INCLUDE_ROARING_64_MAP_HH_
+#define INCLUDE_ROARING_64_MAP_HH_
+
+#include <algorithm>
+#include <cinttypes>  // PRIu64 macro
+#include <cstdarg>    // for va_list handling in bitmapOf()
+#include <cstdio>     // for std::printf() in the printf() method
+#include <cstring>    // for std::memcpy()
+#include <functional>
+#include <initializer_list>
+#include <limits>
+#include <map>
+#include <new>
+#include <numeric>
+#include <queue>
+#include <stdexcept>
+#include <string>
+#include <utility>
+
+
+namespace roaring {
+
+using roaring::Roaring;
+
+class Roaring64MapSetBitBiDirectionalIterator;
+
+// For backwards compatibility; there used to be two kinds of iterators
+// (forward and bidirectional) and now there's only one.
+typedef Roaring64MapSetBitBiDirectionalIterator
+    Roaring64MapSetBitForwardIterator;
+
+class Roaring64Map {
+    typedef api::roaring_bitmap_t roaring_bitmap_t;
+
+public:
+    /**
+     * Create an empty bitmap
+     */
+    Roaring64Map() = default;
+
+    /**
+     * Construct a bitmap from a list of 32-bit integer values.
+     */
+    Roaring64Map(size_t n, const uint32_t *data) { addMany(n, data); }
+
+    /**
+     * Construct a bitmap from a list of 64-bit integer values.
+     */
+    Roaring64Map(size_t n, const uint64_t *data) { addMany(n, data); }
+
+    /**
+     * Construct a bitmap from an initializer list.
+     */
+    Roaring64Map(std::initializer_list<uint64_t> l) {
+        addMany(l.size(), l.begin());
+    }
+
+    /**
+     * Construct a 64-bit map from a 32-bit one
+     */
+    explicit Roaring64Map(const Roaring &r) { emplaceOrInsert(0, r); }
+
+    /**
+     * Construct a 64-bit map from a 32-bit rvalue
+     */
+    explicit Roaring64Map(Roaring &&r) { emplaceOrInsert(0, std::move(r)); }
+
+    /**
+     * Construct a roaring object from the C struct.
+     *
+     * Passing a NULL point is unsafe.
+     */
+    explicit Roaring64Map(roaring_bitmap_t *s) {
+        emplaceOrInsert(0, Roaring(s));
+    }
+
+    Roaring64Map(const Roaring64Map &r) = default;
+
+    Roaring64Map(Roaring64Map &&r) noexcept = default;
+
+    /**
+     * Copy assignment operator.
+     */
+    Roaring64Map &operator=(const Roaring64Map &r) = default;
+
+    /**
+     * Move assignment operator.
+     */
+    Roaring64Map &operator=(Roaring64Map &&r) noexcept = default;
+
+    /**
+     * Assignment from an initializer list.
+     */
+    Roaring64Map &operator=(std::initializer_list<uint64_t> l) {
+        // Delegate to move assignment operator
+        *this = Roaring64Map(l);
+        return *this;
+    }
+
+    /**
+     * Construct a bitmap from a list of uint64_t values.
+     */
+    static Roaring64Map bitmapOf(size_t n...) {
+        Roaring64Map ans;
+        va_list vl;
+        va_start(vl, n);
+        for (size_t i = 0; i < n; i++) {
+            ans.add(va_arg(vl, uint64_t));
+        }
+        va_end(vl);
+        return ans;
+    }
+
+    /**
+     * Construct a bitmap from a list of uint64_t values.
+     * E.g., bitmapOfList({1,2,3}).
+     */
+    static Roaring64Map bitmapOfList(std::initializer_list<uint64_t> l) {
+        Roaring64Map ans;
+        ans.addMany(l.size(), l.begin());
+        return ans;
+    }
+
+    /**
+     * Adds value x.
+     */
+    void add(uint32_t x) { lookupOrCreateInner(0).add(x); }
+
+    /**
+     * Adds value x.
+     */
+    void add(uint64_t x) { lookupOrCreateInner(highBytes(x)).add(lowBytes(x)); }
+
+    /**
+     * Adds value x.
+     * Returns true if a new value was added, false if the value was already
+     * present.
+     */
+    bool addChecked(uint32_t x) { return lookupOrCreateInner(0).addChecked(x); }
+
+    /**
+     * Adds value x.
+     * Returns true if a new value was added, false if the value was already
+     * present.
+     */
+    bool addChecked(uint64_t x) {
+        return lookupOrCreateInner(highBytes(x)).addChecked(lowBytes(x));
+    }
+
+    /**
+     * Adds all values in the half-open interval [min, max).
+     */
+    void addRange(uint64_t min, uint64_t max) {
+        if (min >= max) {
+            return;
+        }
+        addRangeClosed(min, max - 1);
+    }
+
+    /**
+     * Adds all values in the closed interval [min, max].
+     */
+    void addRangeClosed(uint32_t min, uint32_t max) {
+        lookupOrCreateInner(0).addRangeClosed(min, max);
+    }
+
+    /**
+     * Adds all values in the closed interval [min, max]
+     */
+    void addRangeClosed(uint64_t min, uint64_t max) {
+        if (min > max) {
+            return;
+        }
+        uint32_t start_high = highBytes(min);
+        uint32_t start_low = lowBytes(min);
+        uint32_t end_high = highBytes(max);
+        uint32_t end_low = lowBytes(max);
+
+        // We put std::numeric_limits<>::max in parentheses to avoid a
+        // clash with the Windows.h header under Windows.
+        const uint32_t uint32_max = (std::numeric_limits<uint32_t>::max)();
+
+        // Fill in any nonexistent slots with empty Roarings. This simplifies
+        // the logic below, allowing it to simply iterate over the map between
+        // 'start_high' and 'end_high' in a linear fashion.
+        auto current_iter = ensureRangePopulated(start_high, end_high);
+
+        // If start and end land on the same inner bitmap, then we can do the
+        // whole operation in one call.
+        if (start_high == end_high) {
+            auto &bitmap = current_iter->second;
+            bitmap.addRangeClosed(start_low, end_low);
+            return;
+        }
+
+        // Because start and end don't land on the same inner bitmap,
+        // we need to do this in multiple steps:
+        // 1. Partially fill the first bitmap with values from the closed
+        //    interval [start_low, uint32_max]
+        // 2. Fill intermediate bitmaps completely: [0, uint32_max]
+        // 3. Partially fill the last bitmap with values from the closed
+        //    interval [0, end_low]
+        auto num_intermediate_bitmaps = end_high - start_high - 1;
+
+        // Step 1: Partially fill the first bitmap.
+        {
+            auto &bitmap = current_iter->second;
+            bitmap.addRangeClosed(start_low, uint32_max);
+            ++current_iter;
+        }
+
+        // Step 2. Fill intermediate bitmaps completely.
+        if (num_intermediate_bitmaps != 0) {
+            auto &first_intermediate = current_iter->second;
+            first_intermediate.addRangeClosed(0, uint32_max);
+            ++current_iter;
+
+            // Now make (num_intermediate_bitmaps - 1) copies of this.
+            for (uint32_t i = 1; i != num_intermediate_bitmaps; ++i) {
+                auto &next_intermediate = current_iter->second;
+                next_intermediate = first_intermediate;
+                ++current_iter;
+            }
+        }
+
+        // Step 3: Partially fill the last bitmap.
+        auto &bitmap = current_iter->second;
+        bitmap.addRangeClosed(0, end_low);
+    }
+
+    /**
+     * Adds 'n_args' values from the contiguous memory range starting at 'vals'.
+     */
+    void addMany(size_t n_args, const uint32_t *vals) {
+        lookupOrCreateInner(0).addMany(n_args, vals);
+    }
+
+    /**
+     * Adds 'n_args' values from the contiguous memory range starting at 'vals'.
+     */
+    void addMany(size_t n_args, const uint64_t *vals) {
+        // Potentially reduce outer map lookups by optimistically
+        // assuming that adjacent values will belong to the same inner bitmap.
+        Roaring *last_inner_bitmap = nullptr;
+        uint32_t last_value_high = 0;
+        BulkContext last_bulk_context;
+        for (size_t lcv = 0; lcv < n_args; lcv++) {
+            auto value = vals[lcv];
+            auto value_high = highBytes(value);
+            auto value_low = lowBytes(value);
+            if (last_inner_bitmap == nullptr || value_high != last_value_high) {
+                last_inner_bitmap = &lookupOrCreateInner(value_high);
+                last_value_high = value_high;
+                last_bulk_context = BulkContext{};
+            }
+            last_inner_bitmap->addBulk(last_bulk_context, value_low);
+        }
+    }
+
+    /**
+     * Removes value x.
+     */
+    void remove(uint32_t x) {
+        auto iter = roarings.begin();
+        // Since x is a uint32_t, highbytes(x) == 0. The inner bitmap we are
+        // looking for, if it exists, will be at the first slot of 'roarings'.
+        if (iter == roarings.end() || iter->first != 0) {
+            return;
+        }
+        auto &bitmap = iter->second;
+        bitmap.remove(x);
+        eraseIfEmpty(iter);
+    }
+
+    /**
+     * Removes value x.
+     */
+    void remove(uint64_t x) {
+        auto iter = roarings.find(highBytes(x));
+        if (iter == roarings.end()) {
+            return;
+        }
+        auto &bitmap = iter->second;
+        bitmap.remove(lowBytes(x));
+        eraseIfEmpty(iter);
+    }
+
+    /**
+     * Removes value x
+     * Returns true if a new value was removed, false if the value was not
+     * present.
+     */
+    bool removeChecked(uint32_t x) {
+        auto iter = roarings.begin();
+        // Since x is a uint32_t, highbytes(x) == 0. The inner bitmap we are
+        // looking for, if it exists, will be at the first slot of 'roarings'.
+        if (iter == roarings.end() || iter->first != 0) {
+            return false;
+        }
+        auto &bitmap = iter->second;
+        if (!bitmap.removeChecked(x)) {
+            return false;
+        }
+        eraseIfEmpty(iter);
+        return true;
+    }
+
+    /**
+     * Remove value x
+     * Returns true if a new value was removed, false if the value was not
+     * present.
+     */
+    bool removeChecked(uint64_t x) {
+        auto iter = roarings.find(highBytes(x));
+        if (iter == roarings.end()) {
+            return false;
+        }
+        auto &bitmap = iter->second;
+        if (!bitmap.removeChecked(lowBytes(x))) {
+            return false;
+        }
+        eraseIfEmpty(iter);
+        return true;
+    }
+
+    /**
+     * Removes all values in the half-open interval [min, max).
+     */
+    void removeRange(uint64_t min, uint64_t max) {
+        if (min >= max) {
+            return;
+        }
+        return removeRangeClosed(min, max - 1);
+    }
+
+    /**
+     * Removes all values in the closed interval [min, max].
+     */
+    void removeRangeClosed(uint32_t min, uint32_t max) {
+        auto iter = roarings.begin();
+        // Since min and max are uint32_t, highbytes(min or max) == 0. The inner
+        // bitmap we are looking for, if it exists, will be at the first slot of
+        // 'roarings'.
+        if (iter == roarings.end() || iter->first != 0) {
+            return;
+        }
+        auto &bitmap = iter->second;
+        bitmap.removeRangeClosed(min, max);
+        eraseIfEmpty(iter);
+    }
+
+    /**
+     * Removes all values in the closed interval [min, max].
+     */
+    void removeRangeClosed(uint64_t min, uint64_t max) {
+        if (min > max) {
+            return;
+        }
+        uint32_t start_high = highBytes(min);
+        uint32_t start_low = lowBytes(min);
+        uint32_t end_high = highBytes(max);
+        uint32_t end_low = lowBytes(max);
+
+        // We put std::numeric_limits<>::max in parentheses to avoid a
+        // clash with the Windows.h header under Windows.
+        const uint32_t uint32_max = (std::numeric_limits<uint32_t>::max)();
+
+        // If the outer map is empty, end_high is less than the first key,
+        // or start_high is greater than the last key, then exit now because
+        // there is no work to do.
+        if (roarings.empty() || end_high < roarings.cbegin()->first ||
+            start_high > (roarings.crbegin())->first) {
+            return;
+        }
+
+        // If we get here, start_iter points to the first entry in the outer map
+        // with key >= start_high. Such an entry is known to exist (i.e. the
+        // iterator will not be equal to end()) because start_high <= the last
+        // key in the map (thanks to the above if statement).
+        auto start_iter = roarings.lower_bound(start_high);
+        // end_iter points to the first entry in the outer map with
+        // key >= end_high, if such a key exists. Otherwise, it equals end().
+        auto end_iter = roarings.lower_bound(end_high);
+
+        // Note that the 'lower_bound' method will find the start and end slots,
+        // if they exist; otherwise it will find the next-higher slots.
+        // In the case where 'start' landed on an existing slot, we need to do a
+        // partial erase of that slot, and likewise for 'end'. But all the slots
+        // in between can be fully erased. More precisely:
+        //
+        // 1. If the start point falls on an existing entry, there are two
+        //    subcases:
+        //    a. if the end point falls on that same entry, remove the closed
+        //       interval [start_low, end_low] from that entry and we are done.
+        //    b. Otherwise, remove the closed interval [start_low, uint32_max]
+        //       from that entry, advance start_iter, and fall through to
+        //       step 2.
+        // 2. Completely erase all slots in the half-open interval
+        //    [start_iter, end_iter)
+        // 3. If the end point falls on an existing entry, remove the closed
+        //    interval [0, end_high] from it.
+
+        // Step 1. If the start point falls on an existing entry...
+        if (start_iter->first == start_high) {
+            auto &start_inner = start_iter->second;
+            // 1a. if the end point falls on that same entry...
+            if (start_iter == end_iter) {
+                start_inner.removeRangeClosed(start_low, end_low);
+                eraseIfEmpty(start_iter);
+                return;
+            }
+
+            // 1b. Otherwise, remove the closed range [start_low, uint32_max]...
+            start_inner.removeRangeClosed(start_low, uint32_max);
+            // Advance start_iter, but keep the old value so we can check the
+            // bitmap we just modified for emptiness and erase if it necessary.
+            auto temp = start_iter++;
+            eraseIfEmpty(temp);
+        }
+
+        // 2. Completely erase all slots in the half-open interval...
+        roarings.erase(start_iter, end_iter);
+
+        // 3. If the end point falls on an existing entry...
+        if (end_iter != roarings.end() && end_iter->first == end_high) {
+            auto &end_inner = end_iter->second;
+            end_inner.removeRangeClosed(0, end_low);
+            eraseIfEmpty(end_iter);
+        }
+    }
+
+    /**
+     * Clears the bitmap.
+     */
+    void clear() { roarings.clear(); }
+
+    /**
+     * Return the largest value (if not empty)
+     */
+    uint64_t maximum() const {
+        for (auto roaring_iter = roarings.crbegin();
+            roaring_iter != roarings.crend(); ++roaring_iter) {
+            if (!roaring_iter->second.isEmpty()) {
+                return uniteBytes(roaring_iter->first,
+                    roaring_iter->second.maximum());
+            }
+        }
+        // we put std::numeric_limits<>::max/min in parentheses
+        // to avoid a clash with the Windows.h header under Windows
+        return (std::numeric_limits<uint64_t>::min)();
+    }
+
+    /**
+     * Return the smallest value (if not empty)
+     */
+    uint64_t minimum() const {
+        for (auto roaring_iter = roarings.cbegin();
+            roaring_iter != roarings.cend(); ++roaring_iter) {
+            if (!roaring_iter->second.isEmpty()) {
+                return uniteBytes(roaring_iter->first,
+                    roaring_iter->second.minimum());
+            }
+        }
+        // we put std::numeric_limits<>::max/min in parentheses
+        // to avoid a clash with the Windows.h header under Windows
+        return (std::numeric_limits<uint64_t>::max)();
+    }
+
+    /**
+     * Check if value x is present
+     */
+    bool contains(uint32_t x) const {
+        auto iter = roarings.find(0);
+        if (iter == roarings.end()) {
+            return false;
+        }
+        return iter->second.contains(x);
+    }
+    bool contains(uint64_t x) const {
+        auto iter = roarings.find(highBytes(x));
+        if (iter == roarings.end()) {
+            return false;
+        }
+        return iter->second.contains(lowBytes(x));
+    }
+
+    /**
+     * Compute the intersection of the current bitmap and the provided bitmap,
+     * writing the result in the current bitmap. The provided bitmap is not
+     * modified.
+     *
+     * Performance hint: if you are computing the intersection between several
+     * bitmaps, two-by-two, it is best to start with the smallest bitmap.
+     */
+    Roaring64Map &operator&=(const Roaring64Map &other) {
+        if (this == &other) {
+            // ANDing *this with itself is a no-op.
+            return *this;
+        }
+
+        // Logic table summarizing what to do when a given outer key is
+        // present vs. absent from self and other.
+        //
+        // self     other    (self & other)  work to do
+        // --------------------------------------------
+        // absent   absent   empty           None
+        // absent   present  empty           None
+        // present  absent   empty           Erase self
+        // present  present  empty or not    Intersect self with other, but
+        //                                   erase self if result is empty.
+        //
+        // Because there is only work to do when a key is present in 'self', the
+        // main for loop iterates over entries in 'self'.
+
+        decltype(roarings.begin()) self_next;
+        for (auto self_iter = roarings.begin(); self_iter != roarings.end();
+            self_iter = self_next) {
+            // Do the 'next' operation now, so we don't have to worry about
+            // invalidation of self_iter down below with the 'erase' operation.
+            self_next = std::next(self_iter);
+
+            auto self_key = self_iter->first;
+            auto &self_bitmap = self_iter->second;
+
+            auto other_iter = other.roarings.find(self_key);
+            if (other_iter == other.roarings.end()) {
+                // 'other' doesn't have self_key. In the logic table above,
+                // this reflects the case (self.present & other.absent).
+                // So, erase self.
+                roarings.erase(self_iter);
+                continue;
+            }
+
+            // Both sides have self_key. In the logic table above, this reflects
+            // the case (self.present & other.present). So, intersect self with
+            // other.
+            const auto &other_bitmap = other_iter->second;
+            self_bitmap &= other_bitmap;
+            if (self_bitmap.isEmpty()) {
+                // ...but if intersection is empty, remove it altogether.
+                roarings.erase(self_iter);
+            }
+        }
+        return *this;
+    }
+
+    /**
+     * Compute the difference between the current bitmap and the provided
+     * bitmap, writing the result in the current bitmap. The provided bitmap
+     * is not modified.
+     */
+    Roaring64Map &operator-=(const Roaring64Map &other) {
+        if (this == &other) {
+            // Subtracting *this from itself results in the empty map.
+            roarings.clear();
+            return *this;
+        }
+
+        // Logic table summarizing what to do when a given outer key is
+        // present vs. absent from self and other.
+        //
+        // self     other    (self - other)  work to do
+        // --------------------------------------------
+        // absent   absent   empty           None
+        // absent   present  empty           None
+        // present  absent   unchanged       None
+        // present  present  empty or not    Subtract other from self, but
+        //                                   erase self if result is empty
+        //
+        // Because there is only work to do when a key is present in both 'self'
+        // and 'other', the main while loop ping-pongs back and forth until it
+        // finds the next key that is the same on both sides.
+
+        auto self_iter = roarings.begin();
+        auto other_iter = other.roarings.cbegin();
+
+        while (self_iter != roarings.end() &&
+               other_iter != other.roarings.cend()) {
+            auto self_key = self_iter->first;
+            auto other_key = other_iter->first;
+            if (self_key < other_key) {
+                // Because self_key is < other_key, advance self_iter to the
+                // first point where self_key >= other_key (or end).
+                self_iter = roarings.lower_bound(other_key);
+                continue;
+            }
+
+            if (self_key > other_key) {
+                // Because self_key is > other_key, advance other_iter to the
+                // first point where other_key >= self_key (or end).
+                other_iter = other.roarings.lower_bound(self_key);
+                continue;
+            }
+
+            // Both sides have self_key. In the logic table above, this reflects
+            // the case (self.present & other.present). So subtract other from
+            // self.
+            auto &self_bitmap = self_iter->second;
+            const auto &other_bitmap = other_iter->second;
+            self_bitmap -= other_bitmap;
+
+            if (self_bitmap.isEmpty()) {
+                // ...but if subtraction is empty, remove it altogether.
+                self_iter = roarings.erase(self_iter);
+            } else {
+                ++self_iter;
+            }
+            ++other_iter;
+        }
+        return *this;
+    }
+
+    /**
+     * Compute the union of the current bitmap and the provided bitmap,
+     * writing the result in the current bitmap. The provided bitmap is not
+     * modified.
+     *
+     * See also the fastunion function to aggregate many bitmaps more quickly.
+     */
+    Roaring64Map &operator|=(const Roaring64Map &other) {
+        if (this == &other) {
+            // ORing *this with itself is a no-op.
+            return *this;
+        }
+
+        // Logic table summarizing what to do when a given outer key is
+        // present vs. absent from self and other.
+        //
+        // self     other    (self | other)  work to do
+        // --------------------------------------------
+        // absent   absent   empty           None
+        // absent   present  not empty       Copy other to self and set flags
+        // present  absent   unchanged       None
+        // present  present  not empty       self |= other
+        //
+        // Because there is only work to do when a key is present in 'other',
+        // the main for loop iterates over entries in 'other'.
+
+        for (const auto &other_entry : other.roarings) {
+            const auto &other_bitmap = other_entry.second;
+
+            // Try to insert other_bitmap into self at other_key. We take
+            // advantage of the fact that std::map::insert will not overwrite an
+            // existing entry.
+            auto insert_result = roarings.insert(other_entry);
+            auto self_iter = insert_result.first;
+            auto insert_happened = insert_result.second;
+            auto &self_bitmap = self_iter->second;
+
+            if (insert_happened) {
+                // Key was not present in self, so insert was performed above.
+                // In the logic table above, this reflects the case
+                // (self.absent | other.present). Because the copy has already
+                // happened, thanks to the 'insert' operation above, we just
+                // need to set the copyOnWrite flag.
+                self_bitmap.setCopyOnWrite(copyOnWrite);
+                continue;
+            }
+
+            // Both sides have self_key, and the insert was not performed. In
+            // the logic table above, this reflects the case
+            // (self.present & other.present). So OR other into self.
+            self_bitmap |= other_bitmap;
+        }
+        return *this;
+    }
+
+    /**
+     * Compute the XOR of the current bitmap and the provided bitmap, writing
+     * the result in the current bitmap. The provided bitmap is not modified.
+     */
+    Roaring64Map &operator^=(const Roaring64Map &other) {
+        if (this == &other) {
+            // XORing *this with itself results in the empty map.
+            roarings.clear();
+            return *this;
+        }
+
+        // Logic table summarizing what to do when a given outer key is
+        // present vs. absent from self and other.
+        //
+        // self     other    (self ^ other)  work to do
+        // --------------------------------------------
+        // absent   absent   empty           None
+        // absent   present  non-empty       Copy other to self and set flags
+        // present  absent   unchanged       None
+        // present  present  empty or not    XOR other into self, but erase self
+        //                                   if result is empty.
+        //
+        // Because there is only work to do when a key is present in 'other',
+        // the main for loop iterates over entries in 'other'.
+
+        for (const auto &other_entry : other.roarings) {
+            const auto &other_bitmap = other_entry.second;
+
+            // Try to insert other_bitmap into self at other_key. We take
+            // advantage of the fact that std::map::insert will not overwrite an
+            // existing entry.
+            auto insert_result = roarings.insert(other_entry);
+            auto self_iter = insert_result.first;
+            auto insert_happened = insert_result.second;
+            auto &self_bitmap = self_iter->second;
+
+            if (insert_happened) {
+                // Key was not present in self, so insert was performed above.
+                // In the logic table above, this reflects the case
+                // (self.absent ^ other.present). Because the copy has already
+                // happened, thanks to the 'insert' operation above, we just
+                // need to set the copyOnWrite flag.
+                self_bitmap.setCopyOnWrite(copyOnWrite);
+                continue;
+            }
+
+            // Both sides have self_key, and the insert was not performed. In
+            // the logic table above, this reflects the case
+            // (self.present ^ other.present). So XOR other into self.
+            self_bitmap ^= other_bitmap;
+
+            if (self_bitmap.isEmpty()) {
+                // ...but if intersection is empty, remove it altogether.
+                roarings.erase(self_iter);
+            }
+        }
+        return *this;
+    }
+
+    /**
+     * Exchange the content of this bitmap with another.
+     */
+    void swap(Roaring64Map &r) { roarings.swap(r.roarings); }
+
+    /**
+     * Get the cardinality of the bitmap (number of elements).
+     * Throws std::length_error in the special case where the bitmap is full
+     * (cardinality() == 2^64). Check isFull() before calling to avoid
+     * exception.
+     */
+    uint64_t cardinality() const {
+        if (isFull()) {
+#if ROARING_EXCEPTIONS
+            throw std::length_error(
+                "bitmap is full, cardinality is 2^64, "
+                "unable to represent in a 64-bit integer");
+#else
+            ROARING_TERMINATE(
+                "bitmap is full, cardinality is 2^64, "
+                "unable to represent in a 64-bit integer");
+#endif
+        }
+        return std::accumulate(
+            roarings.cbegin(), roarings.cend(), (uint64_t)0,
+            [](uint64_t previous,
+                const std::pair<const uint32_t, Roaring> &map_entry) {
+                return previous + map_entry.second.cardinality();
+            });
+    }
+
+    /**
+     * Returns true if the bitmap is empty (cardinality is zero).
+     */
+    bool isEmpty() const {
+        return std::all_of(
+            roarings.cbegin(), roarings.cend(),
+            [](const std::pair<const uint32_t, Roaring> &map_entry) {
+                return map_entry.second.isEmpty();
+            });
+    }
+
+    /**
+     * Returns true if the bitmap is full (cardinality is max uint64_t + 1).
+     */
+    bool isFull() const {
+        // only bother to check if map is fully saturated
+        //
+        // we put std::numeric_limits<>::max/min in parentheses
+        // to avoid a clash with the Windows.h header under Windows
+        return roarings.size() ==
+                       ((uint64_t)(std::numeric_limits<uint32_t>::max)()) + 1
+                   ? std::all_of(
+                       roarings.cbegin(), roarings.cend(),
+                       [](const std::pair<const uint32_t, Roaring>
+                               &roaring_map_entry) {
+                           // roarings within map are saturated if cardinality
+                           // is uint32_t max + 1
+                           return roaring_map_entry.second.cardinality() ==
+                                  ((uint64_t)(std::numeric_limits<
+                                      uint32_t>::max)()) +
+                                      1;
+                       })
+                   : false;
+    }
+
+    /**
+     * Returns true if the bitmap is subset of the other.
+     */
+    bool isSubset(const Roaring64Map &r) const {
+        for (const auto &map_entry : roarings) {
+            if (map_entry.second.isEmpty()) {
+                continue;
+            }
+            auto roaring_iter = r.roarings.find(map_entry.first);
+            if (roaring_iter == r.roarings.cend())
+                return false;
+            else if (!map_entry.second.isSubset(roaring_iter->second))
+                return false;
+        }
+        return true;
+    }
+
+    /**
+     * Returns true if the bitmap is strict subset of the other.
+     * Throws std::length_error in the special case where the bitmap is full
+     * (cardinality() == 2^64). Check isFull() before calling to avoid
+     * exception.
+     */
+    bool isStrictSubset(const Roaring64Map &r) const {
+        return isSubset(r) && cardinality() != r.cardinality();
+    }
+
+    /**
+     * Convert the bitmap to an array. Write the output to "ans",
+     * caller is responsible to ensure that there is enough memory
+     * allocated
+     * (e.g., ans = new uint32[mybitmap.cardinality()];)
+     */
+    void toUint64Array(uint64_t *ans) const {
+        // Annoyingly, VS 2017 marks std::accumulate() as [[nodiscard]]
+        (void)std::accumulate(
+            roarings.cbegin(), roarings.cend(), ans,
+            [](uint64_t *previous,
+                const std::pair<const uint32_t, Roaring> &map_entry) {
+                for (uint32_t low_bits : map_entry.second)
+                    *previous++ = uniteBytes(map_entry.first, low_bits);
+                return previous;
+            });
+    }
+
+    /**
+     * Return true if the two bitmaps contain the same elements.
+     */
+    bool operator==(const Roaring64Map &r) const {
+        // we cannot use operator == on the map because either side may contain
+        // empty Roaring Bitmaps
+        auto lhs_iter = roarings.cbegin();
+        auto lhs_cend = roarings.cend();
+        auto rhs_iter = r.roarings.cbegin();
+        auto rhs_cend = r.roarings.cend();
+        while (lhs_iter != lhs_cend && rhs_iter != rhs_cend) {
+            auto lhs_key = lhs_iter->first, rhs_key = rhs_iter->first;
+            const auto &lhs_map = lhs_iter->second, &rhs_map = rhs_iter->second;
+            if (lhs_map.isEmpty()) {
+                ++lhs_iter;
+                continue;
+            }
+            if (rhs_map.isEmpty()) {
+                ++rhs_iter;
+                continue;
+            }
+            if (!(lhs_key == rhs_key)) {
+                return false;
+            }
+            if (!(lhs_map == rhs_map)) {
+                return false;
+            }
+            ++lhs_iter;
+            ++rhs_iter;
+        }
+        while (lhs_iter != lhs_cend) {
+            if (!lhs_iter->second.isEmpty()) {
+                return false;
+            }
+            ++lhs_iter;
+        }
+        while (rhs_iter != rhs_cend) {
+            if (!rhs_iter->second.isEmpty()) {
+                return false;
+            }
+            ++rhs_iter;
+        }
+        return true;
+    }
+
+    /**
+     * Computes the negation of the roaring bitmap within the half-open interval
+     * [min, max). Areas outside the interval are unchanged.
+     */
+    void flip(uint64_t min, uint64_t max) {
+        if (min >= max) {
+            return;
+        }
+        flipClosed(min, max - 1);
+    }
+
+    /**
+     * Computes the negation of the roaring bitmap within the closed interval
+     * [min, max]. Areas outside the interval are unchanged.
+     */
+    void flipClosed(uint32_t min, uint32_t max) {
+        auto iter = roarings.begin();
+        // Since min and max are uint32_t, highbytes(min or max) == 0. The inner
+        // bitmap we are looking for, if it exists, will be at the first slot of
+        // 'roarings'. If it does not exist, we have to create it.
+        if (iter == roarings.end() || iter->first != 0) {
+            iter = roarings.emplace_hint(iter, std::piecewise_construct,
+                std::forward_as_tuple(0),
+                std::forward_as_tuple());
+            auto &bitmap = iter->second;
+            bitmap.setCopyOnWrite(copyOnWrite);
+        }
+        auto &bitmap = iter->second;
+        bitmap.flipClosed(min, max);
+        eraseIfEmpty(iter);
+    }
+
+    /**
+     * Computes the negation of the roaring bitmap within the closed interval
+     * [min, max]. Areas outside the interval are unchanged.
+     */
+    void flipClosed(uint64_t min, uint64_t max) {
+        if (min > max) {
+            return;
+        }
+        uint32_t start_high = highBytes(min);
+        uint32_t start_low = lowBytes(min);
+        uint32_t end_high = highBytes(max);
+        uint32_t end_low = lowBytes(max);
+
+        // We put std::numeric_limits<>::max in parentheses to avoid a
+        // clash with the Windows.h header under Windows.
+        const uint32_t uint32_max = (std::numeric_limits<uint32_t>::max)();
+
+        // Fill in any nonexistent slots with empty Roarings. This simplifies
+        // the logic below, allowing it to simply iterate over the map between
+        // 'start_high' and 'end_high' in a linear fashion.
+        auto current_iter = ensureRangePopulated(start_high, end_high);
+
+        // If start and end land on the same inner bitmap, then we can do the
+        // whole operation in one call.
+        if (start_high == end_high) {
+            auto &bitmap = current_iter->second;
+            bitmap.flipClosed(start_low, end_low);
+            eraseIfEmpty(current_iter);
+            return;
+        }
+
+        // Because start and end don't land on the same inner bitmap,
+        // we need to do this in multiple steps:
+        // 1. Partially flip the first bitmap in the closed interval
+        //    [start_low, uint32_max]
+        // 2. Flip intermediate bitmaps completely: [0, uint32_max]
+        // 3. Partially flip the last bitmap in the closed interval
+        //    [0, end_low]
+
+        auto num_intermediate_bitmaps = end_high - start_high - 1;
+
+        // 1. Partially flip the first bitmap.
+        {
+            auto &bitmap = current_iter->second;
+            bitmap.flipClosed(start_low, uint32_max);
+            auto temp = current_iter++;
+            eraseIfEmpty(temp);
+        }
+
+        // 2. Flip intermediate bitmaps completely.
+        for (uint32_t i = 0; i != num_intermediate_bitmaps; ++i) {
+            auto &bitmap = current_iter->second;
+            bitmap.flipClosed(0, uint32_max);
+            auto temp = current_iter++;
+            eraseIfEmpty(temp);
+        }
+
+        // 3. Partially flip the last bitmap.
+        auto &bitmap = current_iter->second;
+        bitmap.flipClosed(0, end_low);
+        eraseIfEmpty(current_iter);
+    }
+
+    /**
+     * Remove run-length encoding even when it is more space efficient
+     * return whether a change was applied
+     */
+    bool removeRunCompression() {
+        return std::accumulate(
+            roarings.begin(), roarings.end(), true,
+            [](bool previous, std::pair<const uint32_t, Roaring> &map_entry) {
+                return map_entry.second.removeRunCompression() && previous;
+            });
+    }
+
+    /**
+     * Convert array and bitmap containers to run containers when it is more
+     * efficient; also convert from run containers when more space efficient.
+     * Returns true if the result has at least one run container.
+     * Additional savings might be possible by calling shrinkToFit().
+     */
+    bool runOptimize() {
+        return std::accumulate(
+            roarings.begin(), roarings.end(), true,
+            [](bool previous, std::pair<const uint32_t, Roaring> &map_entry) {
+                return map_entry.second.runOptimize() && previous;
+            });
+    }
+
+    /**
+     * If needed, reallocate memory to shrink the memory usage.
+     * Returns the number of bytes saved.
+     */
+    size_t shrinkToFit() {
+        size_t savedBytes = 0;
+        auto iter = roarings.begin();
+        while (iter != roarings.cend()) {
+            if (iter->second.isEmpty()) {
+                // empty Roarings are 84 bytes
+                savedBytes += 88;
+                roarings.erase(iter++);
+            } else {
+                savedBytes += iter->second.shrinkToFit();
+                iter++;
+            }
+        }
+        return savedBytes;
+    }
+
+    /**
+     * Iterate over the bitmap elements in order(start from the smallest one)
+     * and call iterator once for every element until the iterator function
+     * returns false. To iterate over all values, the iterator function should
+     * always return true.
+     *
+     * The roaring_iterator64 parameter is a pointer to a function that
+     * returns bool (true means that the iteration should continue while false
+     * means that it should stop), and takes (uint64_t element, void* ptr) as
+     * inputs.
+     */
+    void iterate(api::roaring_iterator64 iterator, void *ptr) const {
+        for (const auto &map_entry : roarings) {
+            bool should_continue =
+                roaring_iterate64(&map_entry.second.roaring, iterator,
+                    uint64_t(map_entry.first) << 32, ptr);
+            if (!should_continue) {
+                break;
+            }
+        }
+    }
+
+    /**
+     * Selects the value at index 'rank' in the bitmap, where the smallest value
+     * is at index 0. If 'rank' < cardinality(), returns true with *element set
+     * to the element of the specified rank. Otherwise, returns false and the
+     * contents of *element are unspecified.
+     */
+    bool select(uint64_t rank, uint64_t *element) const {
+        for (const auto &map_entry : roarings) {
+            auto key = map_entry.first;
+            const auto &bitmap = map_entry.second;
+
+            uint64_t sub_cardinality = bitmap.cardinality();
+            if (rank < sub_cardinality) {
+                uint32_t low_bytes;
+                // Casting rank to uint32_t is safe because
+                // rank < sub_cardinality and sub_cardinality <= 2^32.
+                if (!bitmap.select((uint32_t)rank, &low_bytes)) {
+                    ROARING_TERMINATE(
+                        "Logic error: bitmap.select() "
+                        "returned false despite rank < cardinality()");
+                }
+                *element = uniteBytes(key, low_bytes);
+                return true;
+            }
+            rank -= sub_cardinality;
+        }
+        return false;
+    }
+
+    /**
+     * Returns the number of integers that are smaller or equal to x.
+     */
+    uint64_t rank(uint64_t x) const {
+        uint64_t result = 0;
+        // Find the first bitmap >= x's bucket. If that is the bucket x would be
+        // in, find it's rank in that bucket. Either way, we're left with a
+        // range of all buckets strictly smaller than x's bucket, add all their
+        // cardinalities together.
+        auto end = roarings.lower_bound(highBytes(x));
+        if (end != roarings.cend() && end->first == highBytes(x)) {
+            result += end->second.rank(lowBytes(x));
+        }
+        for (auto iter = roarings.cbegin(); iter != end; ++iter) {
+            result += iter->second.cardinality();
+        }
+        return result;
+    }
+
+    /**
+     * Returns the index of x in the set, index start from 0.
+     * If the set doesn't contain x , this function will return -1.
+     * The difference with rank function is that this function will return -1
+     * when x isn't in the set, but the rank function will return a
+     * non-negative number.
+     */
+    int64_t getIndex(uint64_t x) const {
+        int64_t index = 0;
+        auto roaring_destination = roarings.find(highBytes(x));
+        if (roaring_destination != roarings.cend()) {
+            for (auto roaring_iter = roarings.cbegin();
+                roaring_iter != roaring_destination; ++roaring_iter) {
+                index += roaring_iter->second.cardinality();
+            }
+            auto low_idx = roaring_destination->second.getIndex(lowBytes(x));
+            if (low_idx < 0) return -1;
+            index += low_idx;
+            return index;
+        }
+        return -1;
+    }
+
+    /**
+     * Write a bitmap to a char buffer. This is meant to be compatible with
+     * the Java and Go versions. Returns how many bytes were written which
+     * should be getSizeInBytes().
+     *
+     * Setting the portable flag to false enables a custom format that
+     * can save space compared to the portable format (e.g., for very
+     * sparse bitmaps).
+     */
+    size_t write(char *buf, bool portable = true) const {
+        const char *orig = buf;
+        // push map size
+        uint64_t map_size = roarings.size();
+        std::memcpy(buf, &map_size, sizeof(uint64_t));
+        buf += sizeof(uint64_t);
+        std::for_each(roarings.cbegin(), roarings.cend(),
+            [&buf, portable](
+                const std::pair<const uint32_t, Roaring> &map_entry) {
+                // push map key
+                std::memcpy(buf, &map_entry.first, sizeof(uint32_t));
+                // ^-- Note: `*((uint32_t*)buf) = map_entry.first;` is
+                // undefined
+
+                buf += sizeof(uint32_t);
+                // push map value Roaring
+                buf += map_entry.second.write(buf, portable);
+            });
+        return buf - orig;
+    }
+
+    /**
+     * Read a bitmap from a serialized version. This is meant to be compatible
+     * with the Java and Go versions.
+     *
+     * Setting the portable flag to false enable a custom format that
+     * can save space compared to the portable format (e.g., for very
+     * sparse bitmaps).
+     *
+     * This function is unsafe in the sense that if you provide bad data, many
+     * bytes could be read, possibly causing a buffer overflow. See also
+     * readSafe.
+     */
+    static Roaring64Map read(const char *buf, bool portable = true) {
+        Roaring64Map result;
+        // get map size
+        uint64_t map_size;
+        std::memcpy(&map_size, buf, sizeof(uint64_t));
+        buf += sizeof(uint64_t);
+        for (uint64_t lcv = 0; lcv < map_size; lcv++) {
+            // get map key
+            uint32_t key;
+            std::memcpy(&key, buf, sizeof(uint32_t));
+            // ^-- Note: `uint32_t key = *((uint32_t*)buf);` is undefined
+
+            buf += sizeof(uint32_t);
+            // read map value Roaring
+            Roaring read_var = Roaring::read(buf, portable);
+            // forward buffer past the last Roaring Bitmap
+            buf += read_var.getSizeInBytes(portable);
+            result.emplaceOrInsert(key, std::move(read_var));
+        }
+        return result;
+    }
+
+    /**
+     * Read a bitmap from a serialized version, reading no more than maxbytes
+     * bytes.  This is meant to be compatible with the Java and Go versions.
+     *
+     * Setting the portable flag to false enable a custom format that can save
+     * space compared to the portable format (e.g., for very sparse bitmaps).
+     */
+    static Roaring64Map readSafe(const char *buf, size_t maxbytes) {
+        if (maxbytes < sizeof(uint64_t)) {
+            ROARING_TERMINATE("ran out of bytes");
+        }
+        Roaring64Map result;
+        uint64_t map_size;
+        std::memcpy(&map_size, buf, sizeof(uint64_t));
+        buf += sizeof(uint64_t);
+        maxbytes -= sizeof(uint64_t);
+        for (uint64_t lcv = 0; lcv < map_size; lcv++) {
+            if (maxbytes < sizeof(uint32_t)) {
+                ROARING_TERMINATE("ran out of bytes");
+            }
+            uint32_t key;
+            std::memcpy(&key, buf, sizeof(uint32_t));
+            // ^-- Note: `uint32_t key = *((uint32_t*)buf);` is undefined
+
+            buf += sizeof(uint32_t);
+            maxbytes -= sizeof(uint32_t);
+            // read map value Roaring
+            Roaring read_var = Roaring::readSafe(buf, maxbytes);
+            // forward buffer past the last Roaring Bitmap
+            size_t tz = read_var.getSizeInBytes(true);
+            buf += tz;
+            maxbytes -= tz;
+            result.emplaceOrInsert(key, std::move(read_var));
+        }
+        return result;
+    }
+
+    /**
+     * Return the number of bytes required to serialize this bitmap (meant to
+     * be compatible with Java and Go versions)
+     *
+     * Setting the portable flag to false enable a custom format that can save
+     * space compared to the portable format (e.g., for very sparse bitmaps).
+     */
+    size_t getSizeInBytes(bool portable = true) const {
+        // start with, respectively, map size and size of keys for each map
+        // entry
+        return std::accumulate(
+            roarings.cbegin(), roarings.cend(),
+            sizeof(uint64_t) + roarings.size() * sizeof(uint32_t),
+            [=](size_t previous,
+                const std::pair<const uint32_t, Roaring> &map_entry) {
+                // add in bytes used by each Roaring
+                return previous + map_entry.second.getSizeInBytes(portable);
+            });
+    }
+
+    static const Roaring64Map frozenView(const char *buf) {
+        // size of bitmap buffer and key
+        const size_t metadata_size = sizeof(size_t) + sizeof(uint32_t);
+
+        Roaring64Map result;
+
+        // get map size
+        uint64_t map_size;
+        memcpy(&map_size, buf, sizeof(uint64_t));
+        buf += sizeof(uint64_t);
+
+        for (uint64_t lcv = 0; lcv < map_size; lcv++) {
+            // pad to 32 bytes minus the metadata size
+            while (((uintptr_t)buf + metadata_size) % 32 != 0) buf++;
+
+            // get bitmap size
+            size_t len;
+            memcpy(&len, buf, sizeof(size_t));
+            buf += sizeof(size_t);
+
+            // get map key
+            uint32_t key;
+            memcpy(&key, buf, sizeof(uint32_t));
+            buf += sizeof(uint32_t);
+
+            // read map value Roaring
+            const Roaring read = Roaring::frozenView(buf, len);
+            result.emplaceOrInsert(key, read);
+
+            // forward buffer past the last Roaring Bitmap
+            buf += len;
+        }
+        return result;
+    }
+
+    static const Roaring64Map portableDeserializeFrozen(const char *buf) {
+        Roaring64Map result;
+        // get map size
+        uint64_t map_size;
+        std::memcpy(&map_size, buf, sizeof(uint64_t));
+        buf += sizeof(uint64_t);
+        for (uint64_t lcv = 0; lcv < map_size; lcv++) {
+            // get map key
+            uint32_t key;
+            std::memcpy(&key, buf, sizeof(uint32_t));
+            buf += sizeof(uint32_t);
+            // read map value Roaring
+            Roaring read_var = Roaring::portableDeserializeFrozen(buf);
+            // forward buffer past the last Roaring bitmap
+            buf += read_var.getSizeInBytes(true);
+            result.emplaceOrInsert(key, std::move(read_var));
+        }
+        return result;
+    }
+
+    // As with serialized 64-bit bitmaps, 64-bit frozen bitmaps are serialized
+    // by concatenating one or more Roaring::write output buffers with the
+    // preceeding map key. Unlike standard bitmap serialization, frozen bitmaps
+    // must be 32-byte aligned and requires a buffer length to parse. As a
+    // result, each concatenated output of Roaring::writeFrozen is preceeded by
+    // padding, the buffer size (size_t), and the map key (uint32_t). The
+    // padding is used to ensure 32-byte alignment, but since it is followed by
+    // the buffer size and map key, it actually pads to `(x - sizeof(size_t) +
+    // sizeof(uint32_t)) mod 32` to leave room for the metadata.
+    void writeFrozen(char *buf) const {
+        // size of bitmap buffer and key
+        const size_t metadata_size = sizeof(size_t) + sizeof(uint32_t);
+
+        // push map size
+        uint64_t map_size = roarings.size();
+        memcpy(buf, &map_size, sizeof(uint64_t));
+        buf += sizeof(uint64_t);
+
+        for (auto &map_entry : roarings) {
+            size_t frozenSizeInBytes = map_entry.second.getFrozenSizeInBytes();
+
+            // pad to 32 bytes minus the metadata size
+            while (((uintptr_t)buf + metadata_size) % 32 != 0) buf++;
+
+            // push bitmap size
+            memcpy(buf, &frozenSizeInBytes, sizeof(size_t));
+            buf += sizeof(size_t);
+
+            // push map key
+            memcpy(buf, &map_entry.first, sizeof(uint32_t));
+            buf += sizeof(uint32_t);
+
+            // push map value Roaring
+            map_entry.second.writeFrozen(buf);
+            buf += map_entry.second.getFrozenSizeInBytes();
+        }
+    }
+
+    size_t getFrozenSizeInBytes() const {
+        // size of bitmap size and map key
+        const size_t metadata_size = sizeof(size_t) + sizeof(uint32_t);
+        size_t ret = 0;
+
+        // map size
+        ret += sizeof(uint64_t);
+
+        for (auto &map_entry : roarings) {
+            // pad to 32 bytes minus the metadata size
+            while ((ret + metadata_size) % 32 != 0) ret++;
+            ret += metadata_size;
+
+            // frozen bitmaps must be 32-byte aligned
+            ret += map_entry.second.getFrozenSizeInBytes();
+        }
+        return ret;
+    }
+
+    /**
+     * Computes the intersection between two bitmaps and returns new bitmap.
+     * The current bitmap and the provided bitmap are unchanged.
+     *
+     * Performance hint: if you are computing the intersection between several
+     * bitmaps, two-by-two, it is best to start with the smallest bitmap.
+     * Consider also using the operator &= to avoid needlessly creating
+     * many temporary bitmaps.
+     */
+    Roaring64Map operator&(const Roaring64Map &o) const {
+        return Roaring64Map(*this) &= o;
+    }
+
+    /**
+     * Computes the difference between two bitmaps and returns new bitmap.
+     * The current bitmap and the provided bitmap are unchanged.
+     */
+    Roaring64Map operator-(const Roaring64Map &o) const {
+        return Roaring64Map(*this) -= o;
+    }
+
+    /**
+     * Computes the union between two bitmaps and returns new bitmap.
+     * The current bitmap and the provided bitmap are unchanged.
+     */
+    Roaring64Map operator|(const Roaring64Map &o) const {
+        return Roaring64Map(*this) |= o;
+    }
+
+    /**
+     * Computes the symmetric union between two bitmaps and returns new bitmap.
+     * The current bitmap and the provided bitmap are unchanged.
+     */
+    Roaring64Map operator^(const Roaring64Map &o) const {
+        return Roaring64Map(*this) ^= o;
+    }
+
+    /**
+     * Whether or not we apply copy and write.
+     */
+    void setCopyOnWrite(bool val) {
+        if (copyOnWrite == val) return;
+        copyOnWrite = val;
+        std::for_each(roarings.begin(), roarings.end(),
+            [=](std::pair<const uint32_t, Roaring> &map_entry) {
+                map_entry.second.setCopyOnWrite(val);
+            });
+    }
+
+    /**
+     * Print the contents of the bitmap to stdout.
+     * Note: this method adds a final newline, but toString() does not.
+     */
+    void printf() const {
+        auto sink = [](const std::string &s) { fputs(s.c_str(), stdout); };
+        printToSink(sink);
+        sink("\n");
+    }
+
+    /**
+     * Print the contents of the bitmap into a string.
+     */
+    std::string toString() const {
+        std::string result;
+        auto sink = [&result](const std::string &s) { result += s; };
+        printToSink(sink);
+        return result;
+    }
+
+    /**
+     * Whether or not copy and write is active.
+     */
+    bool getCopyOnWrite() const { return copyOnWrite; }
+
+    /**
+     * Computes the logical or (union) between "n" bitmaps (referenced by a
+     * pointer).
+     */
+    static Roaring64Map fastunion(size_t n, const Roaring64Map **inputs) {
+        // The strategy here is to basically do a "group by" operation.
+        // We group the input roarings by key, do a 32-bit
+        // roaring_bitmap_or_many on each group, and collect the results.
+        // We accomplish the "group by" operation using a priority queue, which
+        // tracks the next key for each of our input maps. At each step, our
+        // algorithm takes the next subset of maps that share the same next key,
+        // runs roaring_bitmap_or_many on those bitmaps, and then advances the
+        // current_iter on all the affected entries and then repeats.
+
+        // There is an entry in our priority queue for each of the 'n' inputs.
+        // For a given Roaring64Map, we look at its underlying 'roarings'
+        // std::map, and take its begin() and end(). This forms our half-open
+        // interval [current_iter, end_iter), which we keep in the priority
+        // queue as a pq_entry. These entries are updated (removed and then
+        // reinserted with the pq_entry.iterator field advanced by one step) as
+        // our algorithm progresses. But when a given interval becomes empty
+        // (i.e. pq_entry.iterator == pq_entry.end) it is not returned to the
+        // priority queue.
+        struct pq_entry {
+            roarings_t::const_iterator iterator;
+            roarings_t::const_iterator end;
+        };
+
+        // Custom comparator for the priority queue.
+        auto pq_comp = [](const pq_entry &lhs, const pq_entry &rhs) {
+            auto left_key = lhs.iterator->first;
+            auto right_key = rhs.iterator->first;
+
+            // We compare in the opposite direction than normal because priority
+            // queues normally order from largest to smallest, but we want
+            // smallest to largest.
+            return left_key > right_key;
+        };
+
+        // Create and populate the priority queue.
+        std::priority_queue<pq_entry, std::vector<pq_entry>, decltype(pq_comp)>
+            pq(pq_comp);
+        for (size_t i = 0; i < n; ++i) {
+            const auto &roarings = inputs[i]->roarings;
+            if (roarings.begin() != roarings.end()) {
+                pq.push({roarings.begin(), roarings.end()});
+            }
+        }
+
+        // A reusable vector that holds the pointers to the inner bitmaps that
+        // we pass to the underlying 32-bit fastunion operation.
+        std::vector<const roaring_bitmap_t *> group_bitmaps;
+
+        // Summary of the algorithm:
+        // 1. While the priority queue is not empty:
+        //    A. Get its lowest key. Call this group_key
+        //    B. While the lowest entry in the priority queue has a key equal to
+        //       group_key:
+        //       1. Remove this entry (the pair {current_iter, end_iter}) from
+        //          the priority queue.
+        //       2. Add the bitmap pointed to by current_iter to a list of
+        //          32-bit bitmaps to process.
+        //       3. Advance current_iter. Now it will point to a bitmap entry
+        //          with some key greater than group_key (or it will point to
+        //          end()).
+        //       4. If current_iter != end_iter, reinsert the pair into the
+        //          priority queue.
+        //    C. Invoke the 32-bit roaring_bitmap_or_many() and add to result
+        Roaring64Map result;
+        while (!pq.empty()) {
+            // Find the next key (the lowest key) in the priority queue.
+            auto group_key = pq.top().iterator->first;
+
+            // The purpose of the inner loop is to gather all the inner bitmaps
+            // that share "group_key" into "group_bitmaps" so that they can be
+            // fed to roaring_bitmap_or_many(). While we are doing this, we
+            // advance those iterators to their next value and reinsert them
+            // into the priority queue (unless they reach their end).
+            group_bitmaps.clear();
+            while (!pq.empty()) {
+                auto candidate_current_iter = pq.top().iterator;
+                auto candidate_end_iter = pq.top().end;
+
+                auto candidate_key = candidate_current_iter->first;
+                const auto &candidate_bitmap = candidate_current_iter->second;
+
+                // This element will either be in the group (having
+                // key == group_key) or it will not be in the group (having
+                // key > group_key). (Note it cannot have key < group_key
+                // because of the ordered nature of the priority queue itself
+                // and the ordered nature of all the underlying roaring maps).
+                if (candidate_key != group_key) {
+                    // This entry, and (thanks to the nature of the priority
+                    // queue) all other entries as well, are all greater than
+                    // group_key, so we're done collecting elements for the
+                    // current group. Because of the way this loop was written,
+                    // the group will will always contain at least one element.
+                    break;
+                }
+
+                group_bitmaps.push_back(&candidate_bitmap.roaring);
+                // Remove this entry from the priority queue. Note this
+                // invalidates pq.top() so make sure you don't have any dangling
+                // references to it.
+                pq.pop();
+
+                // Advance 'candidate_current_iter' and insert a new entry
+                // {candidate_current_iter, candidate_end_iter} into the
+                // priority queue (unless it has reached its end).
+                ++candidate_current_iter;
+                if (candidate_current_iter != candidate_end_iter) {
+                    pq.push({candidate_current_iter, candidate_end_iter});
+                }
+            }
+
+            // Use the fast inner union to combine these.
+            auto *inner_result = roaring_bitmap_or_many(group_bitmaps.size(),
+                group_bitmaps.data());
+            // Insert the 32-bit result at end of the 'roarings' map of the
+            // result we are building.
+            result.roarings.insert(
+                result.roarings.end(),
+                std::make_pair(group_key, Roaring(inner_result)));
+        }
+        return result;
+    }
+
+    friend class Roaring64MapSetBitBiDirectionalIterator;
+    typedef Roaring64MapSetBitBiDirectionalIterator const_iterator;
+    typedef Roaring64MapSetBitBiDirectionalIterator
+        const_bidirectional_iterator;
+
+    /**
+     * Returns an iterator that can be used to access the position of the set
+     * bits. The running time complexity of a full scan is proportional to the
+     * number of set bits: be aware that if you have long strings of 1s, this
+     * can be very inefficient.
+     *
+     * It can be much faster to use the toArray method if you want to
+     * retrieve the set bits.
+     */
+    const_iterator begin() const;
+
+    /**
+     * A bogus iterator that can be used together with begin()
+     * for constructions such as: for (auto i = b.begin(); * i!=b.end(); ++i) {}
+     */
+    const_iterator end() const;
+
+private:
+    typedef std::map<uint32_t, Roaring> roarings_t;
+    roarings_t roarings{};  // The empty constructor silences warnings from
+                           // pedantic static analyzers.
+    bool copyOnWrite{false};
+    static constexpr uint32_t highBytes(const uint64_t in) {
+        return uint32_t(in >> 32);
+    }
+    static constexpr uint32_t lowBytes(const uint64_t in) {
+        return uint32_t(in);
+    }
+    static constexpr uint64_t uniteBytes(const uint32_t highBytes,
+        const uint32_t lowBytes) {
+        return (uint64_t(highBytes) << 32) | uint64_t(lowBytes);
+    }
+    // this is needed to tolerate gcc's C++11 libstdc++ lacking emplace
+    // prior to version 4.8
+    void emplaceOrInsert(const uint32_t key, const Roaring &value) {
+#if defined(__GLIBCXX__) && __GLIBCXX__ < 20130322
+        roarings.insert(std::make_pair(key, value));
+#else
+        roarings.emplace(std::make_pair(key, value));
+#endif
+    }
+
+    void emplaceOrInsert(const uint32_t key, Roaring &&value) {
+#if defined(__GLIBCXX__) && __GLIBCXX__ < 20130322
+        roarings.insert(std::make_pair(key, std::move(value)));
+#else
+        roarings.emplace(key, std::move(value));
+#endif
+    }
+
+    /*
+     * Look up 'key' in the 'roarings' map. If it does not exist, create it.
+     * Also, set its copyOnWrite flag to 'copyOnWrite'. Then return a reference
+     * to the (already existing or newly created) inner bitmap.
+     */
+    Roaring &lookupOrCreateInner(uint32_t key) {
+        auto &bitmap = roarings[key];
+        bitmap.setCopyOnWrite(copyOnWrite);
+        return bitmap;
+    }
+
+    /**
+     * Prints the contents of the bitmap to a caller-provided sink function.
+     */
+    void printToSink(
+        const std::function<void(const std::string &)> &sink) const {
+        sink("{");
+
+        // Storage for snprintf. Big enough to store the decimal representation
+        // of the largest uint64_t value and trailing \0.
+        char buffer[32];
+        const char *separator = "";
+        // Reusable, and therefore avoids many repeated heap allocations.
+        std::string callback_string;
+        for (const auto &entry : roarings) {
+            auto high_bits = entry.first;
+            const auto &bitmap = entry.second;
+            for (const auto low_bits : bitmap) {
+                auto value = uniteBytes(high_bits, low_bits);
+                snprintf(buffer, sizeof(buffer), "%" PRIu64, value);
+                callback_string = separator;
+                callback_string.append(buffer);
+                sink(callback_string);
+                separator = ",";
+            }
+        }
+        sink("}");
+    }
+
+    /**
+     * Ensures that every key in the closed interval [start_high, end_high]
+     * refers to a Roaring bitmap rather being an empty slot. Inserts empty
+     * Roaring bitmaps if necessary. The interval must be valid and non-empty.
+     * Returns an iterator to the bitmap at start_high.
+     */
+    roarings_t::iterator ensureRangePopulated(uint32_t start_high,
+        uint32_t end_high) {
+        if (start_high > end_high) {
+            ROARING_TERMINATE("Logic error: start_high > end_high");
+        }
+        // next_populated_iter points to the first entry in the outer map with
+        // key >= start_high, or end().
+        auto next_populated_iter = roarings.lower_bound(start_high);
+
+        // Use uint64_t to avoid an infinite loop when end_high == uint32_max.
+        roarings_t::iterator start_iter{};  // Definitely assigned in loop.
+        for (uint64_t slot = start_high; slot <= end_high; ++slot) {
+            roarings_t::iterator slot_iter;
+            if (next_populated_iter != roarings.end() &&
+                next_populated_iter->first == slot) {
+                // 'slot' index has caught up to next_populated_iter.
+                // Note it here and advance next_populated_iter.
+                slot_iter = next_populated_iter++;
+            } else {
+                // 'slot' index has not yet caught up to next_populated_iter.
+                // Make a fresh entry {key = 'slot', value = Roaring()}, insert
+                // it just prior to next_populated_iter, and set its copy
+                // on write flag. We take pains to use emplace_hint and
+                // piecewise_construct to minimize effort.
+                slot_iter = roarings.emplace_hint(
+                    next_populated_iter, std::piecewise_construct,
+                    std::forward_as_tuple(uint32_t(slot)),
+                    std::forward_as_tuple());
+                auto &bitmap = slot_iter->second;
+                bitmap.setCopyOnWrite(copyOnWrite);
+            }
+
+            // Make a note of the iterator of the starting slot. It will be
+            // needed for the return value.
+            if (slot == start_high) {
+                start_iter = slot_iter;
+            }
+        }
+        return start_iter;
+    }
+
+    /**
+     * Erases the entry pointed to by 'iter' from the 'roarings' map. Warning:
+     * this invalidates 'iter'.
+     */
+    void eraseIfEmpty(roarings_t::iterator iter) {
+        const auto &bitmap = iter->second;
+        if (bitmap.isEmpty()) {
+            roarings.erase(iter);
+        }
+    }
+};
+
+/**
+ * Used to go through the set bits. Not optimally fast, but convenient.
+ */
+class Roaring64MapSetBitBiDirectionalIterator {
+public:
+    typedef std::bidirectional_iterator_tag iterator_category;
+    typedef uint64_t *pointer;
+    typedef uint64_t &reference;
+    typedef uint64_t value_type;
+    typedef int64_t difference_type;
+    typedef Roaring64MapSetBitBiDirectionalIterator type_of_iterator;
+
+    Roaring64MapSetBitBiDirectionalIterator(const Roaring64Map &parent,
+        bool exhausted = false)
+        : p(&parent.roarings) {
+        if (exhausted || parent.roarings.empty()) {
+            map_iter = p->cend();
+        } else {
+            map_iter = parent.roarings.cbegin();
+            roaring_iterator_init(&map_iter->second.roaring, &i);
+            while (!i.has_value) {
+                map_iter++;
+                if (map_iter == p->cend()) return;
+                roaring_iterator_init(&map_iter->second.roaring, &i);
+            }
+        }
+    }
+
+    /**
+     * Provides the location of the set bit.
+     */
+    value_type operator*() const {
+        return Roaring64Map::uniteBytes(map_iter->first, i.current_value);
+    }
+
+    bool operator<(const type_of_iterator &o) const {
+        if (map_iter == p->cend()) return false;
+        if (o.map_iter == o.p->cend()) return true;
+        return **this < *o;
+    }
+
+    bool operator<=(const type_of_iterator &o) const {
+        if (o.map_iter == o.p->cend()) return true;
+        if (map_iter == p->cend()) return false;
+        return **this <= *o;
+    }
+
+    bool operator>(const type_of_iterator &o) const {
+        if (o.map_iter == o.p->cend()) return false;
+        if (map_iter == p->cend()) return true;
+        return **this > *o;
+    }
+
+    bool operator>=(const type_of_iterator &o) const {
+        if (map_iter == p->cend()) return true;
+        if (o.map_iter == o.p->cend()) return false;
+        return **this >= *o;
+    }
+
+    type_of_iterator &operator++() {  // ++i, must returned inc. value
+        if (i.has_value == true) roaring_uint32_iterator_advance(&i);
+        while (!i.has_value) {
+            ++map_iter;
+            if (map_iter == p->cend()) return *this;
+            roaring_iterator_init(&map_iter->second.roaring, &i);
+        }
+        return *this;
+    }
+
+    type_of_iterator operator++(int) {  // i++, must return orig. value
+        Roaring64MapSetBitBiDirectionalIterator orig(*this);
+        roaring_uint32_iterator_advance(&i);
+        while (!i.has_value) {
+            ++map_iter;
+            if (map_iter == p->cend()) return orig;
+            roaring_iterator_init(&map_iter->second.roaring, &i);
+        }
+        return orig;
+    }
+
+    bool move(const value_type &x) {
+        map_iter = p->lower_bound(Roaring64Map::highBytes(x));
+        if (map_iter != p->cend()) {
+            roaring_iterator_init(&map_iter->second.roaring, &i);
+            if (map_iter->first == Roaring64Map::highBytes(x)) {
+                if (roaring_uint32_iterator_move_equalorlarger(
+                        &i, Roaring64Map::lowBytes(x)))
+                    return true;
+                ++map_iter;
+                if (map_iter == p->cend()) return false;
+                roaring_iterator_init(&map_iter->second.roaring, &i);
+            }
+            return true;
+        }
+        return false;
+    }
+
+    type_of_iterator &operator--() {  //  --i, must return dec.value
+        if (map_iter == p->cend()) {
+            --map_iter;
+            roaring_iterator_init_last(&map_iter->second.roaring, &i);
+            if (i.has_value) return *this;
+        }
+
+        roaring_uint32_iterator_previous(&i);
+        while (!i.has_value) {
+            if (map_iter == p->cbegin()) return *this;
+            map_iter--;
+            roaring_iterator_init_last(&map_iter->second.roaring, &i);
+        }
+        return *this;
+    }
+
+    type_of_iterator operator--(int) {  // i--, must return orig. value
+        Roaring64MapSetBitBiDirectionalIterator orig(*this);
+        if (map_iter == p->cend()) {
+            --map_iter;
+            roaring_iterator_init_last(&map_iter->second.roaring, &i);
+            return orig;
+        }
+
+        roaring_uint32_iterator_previous(&i);
+        while (!i.has_value) {
+            if (map_iter == p->cbegin()) return orig;
+            map_iter--;
+            roaring_iterator_init_last(&map_iter->second.roaring, &i);
+        }
+        return orig;
+    }
+
+    bool operator==(const Roaring64MapSetBitBiDirectionalIterator &o) const {
+        if (map_iter == p->cend() && o.map_iter == o.p->cend()) return true;
+        if (o.map_iter == o.p->cend()) return false;
+        return **this == *o;
+    }
+
+    bool operator!=(const Roaring64MapSetBitBiDirectionalIterator &o) const {
+        if (map_iter == p->cend() && o.map_iter == o.p->cend()) return false;
+        if (o.map_iter == o.p->cend()) return true;
+        return **this != *o;
+    }
+
+private:
+    const std::map<uint32_t, Roaring> *p{nullptr};
+    std::map<uint32_t, Roaring>::const_iterator
+        map_iter{};  // The empty constructor silences warnings from pedantic
+                    // static analyzers.
+    api::roaring_uint32_iterator_t
+        i{};  // The empty constructor silences warnings from pedantic static
+             // analyzers.
+};
+
+inline Roaring64MapSetBitBiDirectionalIterator Roaring64Map::begin() const {
+    return Roaring64MapSetBitBiDirectionalIterator(*this);
+}
+
+inline Roaring64MapSetBitBiDirectionalIterator Roaring64Map::end() const {
+    return Roaring64MapSetBitBiDirectionalIterator(*this, true);
+}
+
+}  // namespace roaring
+
+#endif /* INCLUDE_ROARING_64_MAP_HH_ */
+/* end file cpp/roaring64map.hh */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/CMakeLists.txt
new file mode 100644
index 0000000000..b846406ee8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/CMakeLists.txt
@@ -0,0 +1,12 @@
+add_library(simsimd
+        STATIC
+        lib.c)
+
+target_include_directories(simsimd PUBLIC
+        ${CMAKE_CURRENT_SOURCE_DIR})
+
+if(NOT MSVC)
+    target_compile_options(simsimd PRIVATE -w)
+elseif (MSVC)
+    target_compile_options(simsimd PRIVATE /w)
+endif()
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/LICENSE
new file mode 100644
index 0000000000..261eeb9e9f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/LICENSE
@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/binary.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/binary.h
new file mode 100644
index 0000000000..79622a00ef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/binary.h
@@ -0,0 +1,485 @@
+/**
+ *  @file       binary.h
+ *  @brief      SIMD-accelerated Binary Similarity Measures.
+ *  @author     Ash Vardanian
+ *  @date       July 1, 2023
+ *
+ *  Contains:
+ *  - Hamming distance
+ *  - Jaccard similarity (Tanimoto coefficient)
+ *
+ *  For hardware architectures:
+ *  - Arm: NEON, SVE
+ *  - x86: Haswell, Ice Lake
+ *
+ *  The hardest part of optimizing binary similarity measures is the population count operation.
+ *  It's natively supported by almost every insrtuction set, but the throughput and latency can
+ *  be suboptimal. There are several ways to optimize this operation:
+ *
+ *  - Lookup tables, mostly using nibbles (4-bit lookups)
+ *  - Harley-Seal population counts: https://arxiv.org/pdf/1611.07612
+ *
+ *  On binary vectors, when computing Jaccard similarity we can clearly see how the CPU struggles
+ *  to compute that many population counts. There are several instructions we should keep in mind
+ *  for future optimizations:
+ *
+ *  - `_mm512_popcnt_epi64` maps to `VPOPCNTQ (ZMM, K, ZMM)`:
+ *      - On Ice Lake: 3 cycles latency, ports: 1*p5
+ *      - On Genoa: 2 cycles latency, ports: 1*FP01
+ *  - `_mm512_shuffle_epi8` maps to `VPSHUFB (ZMM, ZMM, ZMM)`:
+ *      - On Ice Lake: 1 cycles latency, ports: 1*p5
+ *      - On Genoa: 2 cycles latency, ports: 1*FP12
+ *  - `_mm512_sad_epu8` maps to `VPSADBW (ZMM, ZMM, ZMM)`:
+ *      - On Ice Lake: 3 cycles latency, ports: 1*p5
+ *      - On Zen4: 3 cycles latency, ports: 1*FP01
+ *  - `_mm512_tertiarylogic_epi64` maps to `VPTERNLOGQ (ZMM, ZMM, ZMM, I8)`:
+ *      - On Ice Lake: 1 cycles latency, ports: 1*p05
+ *      - On Zen4: 1 cycles latency, ports: 1*FP0123
+ *  - `_mm512_gf2p8mul_epi8` maps to `VPGF2P8AFFINEQB (ZMM, ZMM, ZMM)`:
+ *      - On Ice Lake: 5 cycles latency, ports: 1*p0
+ *      - On Zen4: 3 cycles latency, ports: 1*FP01
+ *
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide/
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics/
+ *  SSE POPCOUNT experiments by Wojciech Muła: https://github.com/WojciechMula/sse-popcount
+ *  R&D progress tracker: https://github.com/ashvardanian/SimSIMD/pull/138
+ */
+#ifndef SIMSIMD_BINARY_H
+#define SIMSIMD_BINARY_H
+
+#include "types.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// clang-format off
+
+/*  Serial backends for bitsets. */
+SIMSIMD_PUBLIC void simsimd_hamming_b8_serial(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_serial(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+
+/*  Arm NEON backend for bitsets. */
+SIMSIMD_PUBLIC void simsimd_hamming_b8_neon(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_neon(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+
+/*  Arm SVE backend for bitsets. */
+SIMSIMD_PUBLIC void simsimd_hamming_b8_sve(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_sve(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+
+/*  x86 AVX2 backend for bitsets for Intel Haswell CPUs and newer, needs only POPCNT extensions. */
+SIMSIMD_PUBLIC void simsimd_hamming_b8_haswell(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_haswell(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+
+/*  x86 AVX512 backend for bitsets for Intel Ice Lake CPUs and newer, using VPOPCNTDQ extensions. */
+SIMSIMD_PUBLIC void simsimd_hamming_b8_ice(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_ice(simsimd_b8_t const* a, simsimd_b8_t const* b, simsimd_size_t n_words, simsimd_distance_t* distance);
+// clang-format on
+
+SIMSIMD_PUBLIC unsigned char simsimd_popcount_b8(simsimd_b8_t x) {
+    static unsigned char lookup_table[] = {
+        0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, //
+        1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+        1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+        2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
+        1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+        2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
+        2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
+        3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8};
+    return lookup_table[x];
+}
+
+SIMSIMD_PUBLIC void simsimd_hamming_b8_serial(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                              simsimd_distance_t *result) {
+    simsimd_i32_t differences = 0;
+    for (simsimd_size_t i = 0; i != n_words; ++i) differences += simsimd_popcount_b8(a[i] ^ b[i]);
+    *result = differences;
+}
+
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_serial(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                              simsimd_distance_t *result) {
+    simsimd_i32_t intersection = 0, union_ = 0;
+    for (simsimd_size_t i = 0; i != n_words; ++i)
+        intersection += simsimd_popcount_b8(a[i] & b[i]), union_ += simsimd_popcount_b8(a[i] | b[i]);
+    *result = (union_ != 0) ? 1 - (simsimd_f64_t)intersection / (simsimd_f64_t)union_ : 1;
+}
+
+#if _SIMSIMD_TARGET_ARM
+#if SIMSIMD_TARGET_NEON
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd"))), apply_to = function)
+
+SIMSIMD_INTERNAL simsimd_u32_t _simsimd_reduce_u8x16_neon(uint8x16_t vec) {
+    // Split the vector into two halves and widen to `uint16x8_t`
+    uint16x8_t low_half = vmovl_u8(vget_low_u8(vec));   // widen lower 8 elements
+    uint16x8_t high_half = vmovl_u8(vget_high_u8(vec)); // widen upper 8 elements
+
+    // Sum the widened halves
+    uint16x8_t sum16 = vaddq_u16(low_half, high_half);
+
+    // Now reduce the `uint16x8_t` to a single `simsimd_u32_t`
+    uint32x4_t sum32 = vpaddlq_u16(sum16);       // pairwise add into 32-bit integers
+    uint64x2_t sum64 = vpaddlq_u32(sum32);       // pairwise add into 64-bit integers
+    simsimd_u32_t final_sum = vaddvq_u64(sum64); // final horizontal add to 32-bit result
+    return final_sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_hamming_b8_neon(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                            simsimd_distance_t *result) {
+    simsimd_i32_t differences = 0;
+    simsimd_size_t i = 0;
+    // In each 8-bit word we may have up to 8 differences.
+    // So for up-to 31 cycles (31 * 16 = 496 word-dimensions = 3968 bits)
+    // we can aggregate the differences into a `uint8x16_t` vector,
+    // where each component will be up-to 255.
+    while (i + 16 <= n_words) {
+        uint8x16_t differences_cycle_vec = vdupq_n_u8(0);
+        for (simsimd_size_t cycle = 0; cycle < 31 && i + 16 <= n_words; ++cycle, i += 16) {
+            uint8x16_t a_vec = vld1q_u8(a + i);
+            uint8x16_t b_vec = vld1q_u8(b + i);
+            uint8x16_t xor_count_vec = vcntq_u8(veorq_u8(a_vec, b_vec));
+            differences_cycle_vec = vaddq_u8(differences_cycle_vec, xor_count_vec);
+        }
+        differences += _simsimd_reduce_u8x16_neon(differences_cycle_vec);
+    }
+    // Handle the tail
+    for (; i != n_words; ++i) differences += simsimd_popcount_b8(a[i] ^ b[i]);
+    *result = differences;
+}
+
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_neon(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                            simsimd_distance_t *result) {
+    simsimd_i32_t intersection = 0, union_ = 0;
+    simsimd_size_t i = 0;
+    // In each 8-bit word we may have up to 8 intersections/unions.
+    // So for up-to 31 cycles (31 * 16 = 496 word-dimensions = 3968 bits)
+    // we can aggregate the intersections/unions into a `uint8x16_t` vector,
+    // where each component will be up-to 255.
+    while (i + 16 <= n_words) {
+        uint8x16_t intersections_cycle_vec = vdupq_n_u8(0);
+        uint8x16_t unions_cycle_vec = vdupq_n_u8(0);
+        for (simsimd_size_t cycle = 0; cycle < 31 && i + 16 <= n_words; ++cycle, i += 16) {
+            uint8x16_t a_vec = vld1q_u8(a + i);
+            uint8x16_t b_vec = vld1q_u8(b + i);
+            uint8x16_t and_count_vec = vcntq_u8(vandq_u8(a_vec, b_vec));
+            uint8x16_t or_count_vec = vcntq_u8(vorrq_u8(a_vec, b_vec));
+            intersections_cycle_vec = vaddq_u8(intersections_cycle_vec, and_count_vec);
+            unions_cycle_vec = vaddq_u8(unions_cycle_vec, or_count_vec);
+        }
+        intersection += _simsimd_reduce_u8x16_neon(intersections_cycle_vec);
+        union_ += _simsimd_reduce_u8x16_neon(unions_cycle_vec);
+    }
+    // Handle the tail
+    for (; i != n_words; ++i)
+        intersection += simsimd_popcount_b8(a[i] & b[i]), union_ += simsimd_popcount_b8(a[i] | b[i]);
+    *result = (union_ != 0) ? 1 - (simsimd_f64_t)intersection / (simsimd_f64_t)union_ : 1;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON
+
+#if SIMSIMD_TARGET_SVE
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+sve")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+sve"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_hamming_b8_sve(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                           simsimd_distance_t *result) {
+
+    // On very small register sizes, NEON is at least as fast as SVE.
+    simsimd_size_t const words_per_register = svcntb();
+    if (words_per_register <= 32) {
+        simsimd_hamming_b8_neon(a, b, n_words, result);
+        return;
+    }
+
+    // On larger register sizes, SVE is faster.
+    simsimd_size_t i = 0, cycle = 0;
+    simsimd_i32_t differences = 0;
+    svuint8_t differences_cycle_vec = svdup_n_u8(0);
+    svbool_t const all_vec = svptrue_b8();
+    while (i < n_words) {
+        do {
+            svbool_t pg_vec = svwhilelt_b8((unsigned int)i, (unsigned int)n_words);
+            svuint8_t a_vec = svld1_u8(pg_vec, a + i);
+            svuint8_t b_vec = svld1_u8(pg_vec, b + i);
+            differences_cycle_vec =
+                svadd_u8_z(all_vec, differences_cycle_vec, svcnt_u8_x(all_vec, sveor_u8_m(all_vec, a_vec, b_vec)));
+            i += words_per_register;
+            ++cycle;
+        } while (i < n_words && cycle < 31);
+        differences += svaddv_u8(all_vec, differences_cycle_vec);
+        differences_cycle_vec = svdup_n_u8(0);
+        cycle = 0; // Reset the cycle counter.
+    }
+
+    *result = differences;
+}
+
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_sve(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                           simsimd_distance_t *result) {
+
+    // On very small register sizes, NEON is at least as fast as SVE.
+    simsimd_size_t const words_per_register = svcntb();
+    if (words_per_register <= 32) {
+        simsimd_jaccard_b8_neon(a, b, n_words, result);
+        return;
+    }
+
+    // On larger register sizes, SVE is faster.
+    simsimd_size_t i = 0, cycle = 0;
+    simsimd_i32_t intersection = 0, union_ = 0;
+    svuint8_t intersection_cycle_vec = svdup_n_u8(0);
+    svuint8_t union_cycle_vec = svdup_n_u8(0);
+    svbool_t const all_vec = svptrue_b8();
+    while (i < n_words) {
+        do {
+            svbool_t pg_vec = svwhilelt_b8((unsigned int)i, (unsigned int)n_words);
+            svuint8_t a_vec = svld1_u8(pg_vec, a + i);
+            svuint8_t b_vec = svld1_u8(pg_vec, b + i);
+            intersection_cycle_vec =
+                svadd_u8_z(all_vec, intersection_cycle_vec, svcnt_u8_x(all_vec, svand_u8_m(all_vec, a_vec, b_vec)));
+            union_cycle_vec =
+                svadd_u8_z(all_vec, union_cycle_vec, svcnt_u8_x(all_vec, svorr_u8_m(all_vec, a_vec, b_vec)));
+            i += words_per_register;
+            ++cycle;
+        } while (i < n_words && cycle < 31);
+        intersection += svaddv_u8(all_vec, intersection_cycle_vec);
+        intersection_cycle_vec = svdup_n_u8(0);
+        union_ += svaddv_u8(all_vec, union_cycle_vec);
+        union_cycle_vec = svdup_n_u8(0);
+        cycle = 0; // Reset the cycle counter.
+    }
+
+    *result = (union_ != 0) ? 1 - (simsimd_f64_t)intersection / (simsimd_f64_t)union_ : 1;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SVE
+#endif // _SIMSIMD_TARGET_ARM
+
+#if _SIMSIMD_TARGET_X86
+#if SIMSIMD_TARGET_ICE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512bw", "avx512vpopcntdq")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512bw,avx512vpopcntdq"))), \
+                             apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_hamming_b8_ice(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                           simsimd_distance_t *result) {
+
+    simsimd_size_t xor_count;
+    // It's harder to squeeze out performance from tiny representations, so we unroll the loops for binary metrics.
+    if (n_words <= 64) { // Up to 512 bits.
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words);
+        __m512i a_vec = _mm512_maskz_loadu_epi8(mask, a);
+        __m512i b_vec = _mm512_maskz_loadu_epi8(mask, b);
+        __m512i xor_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a_vec, b_vec));
+        xor_count = _mm512_reduce_add_epi64(xor_count_vec);
+    }
+    else if (n_words <= 128) { // Up to 1024 bits.
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words - 64);
+        __m512i a1_vec = _mm512_loadu_epi8(a);
+        __m512i b1_vec = _mm512_loadu_epi8(b);
+        __m512i a2_vec = _mm512_maskz_loadu_epi8(mask, a + 64);
+        __m512i b2_vec = _mm512_maskz_loadu_epi8(mask, b + 64);
+        __m512i xor1_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a1_vec, b1_vec));
+        __m512i xor2_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a2_vec, b2_vec));
+        xor_count = _mm512_reduce_add_epi64(_mm512_add_epi64(xor2_count_vec, xor1_count_vec));
+    }
+    else if (n_words <= 196) { // Up to 1568 bits.
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words - 128);
+        __m512i a1_vec = _mm512_loadu_epi8(a);
+        __m512i b1_vec = _mm512_loadu_epi8(b);
+        __m512i a2_vec = _mm512_loadu_epi8(a + 64);
+        __m512i b2_vec = _mm512_loadu_epi8(b + 64);
+        __m512i a3_vec = _mm512_maskz_loadu_epi8(mask, a + 128);
+        __m512i b3_vec = _mm512_maskz_loadu_epi8(mask, b + 128);
+        __m512i xor1_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a1_vec, b1_vec));
+        __m512i xor2_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a2_vec, b2_vec));
+        __m512i xor3_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a3_vec, b3_vec));
+        xor_count =
+            _mm512_reduce_add_epi64(_mm512_add_epi64(xor3_count_vec, _mm512_add_epi64(xor2_count_vec, xor1_count_vec)));
+    }
+    else if (n_words <= 256) { // Up to 2048 bits.
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words - 192);
+        __m512i a1_vec = _mm512_loadu_epi8(a);
+        __m512i b1_vec = _mm512_loadu_epi8(b);
+        __m512i a2_vec = _mm512_loadu_epi8(a + 64);
+        __m512i b2_vec = _mm512_loadu_epi8(b + 64);
+        __m512i a3_vec = _mm512_loadu_epi8(a + 128);
+        __m512i b3_vec = _mm512_loadu_epi8(b + 128);
+        __m512i a4_vec = _mm512_maskz_loadu_epi8(mask, a + 192);
+        __m512i b4_vec = _mm512_maskz_loadu_epi8(mask, b + 192);
+        __m512i xor1_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a1_vec, b1_vec));
+        __m512i xor2_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a2_vec, b2_vec));
+        __m512i xor3_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a3_vec, b3_vec));
+        __m512i xor4_count_vec = _mm512_popcnt_epi64(_mm512_xor_si512(a4_vec, b4_vec));
+        xor_count = _mm512_reduce_add_epi64(_mm512_add_epi64(_mm512_add_epi64(xor4_count_vec, xor3_count_vec),
+                                                             _mm512_add_epi64(xor2_count_vec, xor1_count_vec)));
+    }
+    else {
+        __m512i xor_count_vec = _mm512_setzero_si512();
+        __m512i a_vec, b_vec;
+
+    simsimd_hamming_b8_ice_cycle:
+        if (n_words < 64) {
+            __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words);
+            a_vec = _mm512_maskz_loadu_epi8(mask, a);
+            b_vec = _mm512_maskz_loadu_epi8(mask, b);
+            n_words = 0;
+        }
+        else {
+            a_vec = _mm512_loadu_epi8(a);
+            b_vec = _mm512_loadu_epi8(b);
+            a += 64, b += 64, n_words -= 64;
+        }
+        __m512i xor_vec = _mm512_xor_si512(a_vec, b_vec);
+        xor_count_vec = _mm512_add_epi64(xor_count_vec, _mm512_popcnt_epi64(xor_vec));
+        if (n_words) goto simsimd_hamming_b8_ice_cycle;
+
+        xor_count = _mm512_reduce_add_epi64(xor_count_vec);
+    }
+    *result = xor_count;
+}
+
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_ice(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                           simsimd_distance_t *result) {
+
+    simsimd_size_t intersection = 0, union_ = 0;
+    //  It's harder to squeeze out performance from tiny representations, so we unroll the loops for binary metrics.
+    if (n_words <= 64) { // Up to 512 bits.
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words);
+        __m512i a_vec = _mm512_maskz_loadu_epi8(mask, a);
+        __m512i b_vec = _mm512_maskz_loadu_epi8(mask, b);
+        __m512i and_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a_vec, b_vec));
+        __m512i or_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a_vec, b_vec));
+        intersection = _mm512_reduce_add_epi64(and_count_vec);
+        union_ = _mm512_reduce_add_epi64(or_count_vec);
+    }
+    else if (n_words <= 128) { // Up to 1024 bits.
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words - 64);
+        __m512i a1_vec = _mm512_loadu_epi8(a);
+        __m512i b1_vec = _mm512_loadu_epi8(b);
+        __m512i a2_vec = _mm512_maskz_loadu_epi8(mask, a + 64);
+        __m512i b2_vec = _mm512_maskz_loadu_epi8(mask, b + 64);
+        __m512i and1_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a1_vec, b1_vec));
+        __m512i or1_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a1_vec, b1_vec));
+        __m512i and2_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a2_vec, b2_vec));
+        __m512i or2_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a2_vec, b2_vec));
+        intersection = _mm512_reduce_add_epi64(_mm512_add_epi64(and2_count_vec, and1_count_vec));
+        union_ = _mm512_reduce_add_epi64(_mm512_add_epi64(or2_count_vec, or1_count_vec));
+    }
+    else if (n_words <= 196) { // Up to 1568 bits.
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words - 128);
+        __m512i a1_vec = _mm512_loadu_epi8(a);
+        __m512i b1_vec = _mm512_loadu_epi8(b);
+        __m512i a2_vec = _mm512_loadu_epi8(a + 64);
+        __m512i b2_vec = _mm512_loadu_epi8(b + 64);
+        __m512i a3_vec = _mm512_maskz_loadu_epi8(mask, a + 128);
+        __m512i b3_vec = _mm512_maskz_loadu_epi8(mask, b + 128);
+        __m512i and1_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a1_vec, b1_vec));
+        __m512i or1_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a1_vec, b1_vec));
+        __m512i and2_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a2_vec, b2_vec));
+        __m512i or2_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a2_vec, b2_vec));
+        __m512i and3_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a3_vec, b3_vec));
+        __m512i or3_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a3_vec, b3_vec));
+        intersection = _mm512_reduce_add_epi64( //
+            _mm512_add_epi64(and3_count_vec, _mm512_add_epi64(and2_count_vec, and1_count_vec)));
+        union_ = _mm512_reduce_add_epi64( //
+            _mm512_add_epi64(or3_count_vec, _mm512_add_epi64(or2_count_vec, or1_count_vec)));
+    }
+    else if (n_words <= 256) { // Up to 2048 bits.
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words - 192);
+        __m512i a1_vec = _mm512_loadu_epi8(a);
+        __m512i b1_vec = _mm512_loadu_epi8(b);
+        __m512i a2_vec = _mm512_loadu_epi8(a + 64);
+        __m512i b2_vec = _mm512_loadu_epi8(b + 64);
+        __m512i a3_vec = _mm512_loadu_epi8(a + 128);
+        __m512i b3_vec = _mm512_loadu_epi8(b + 128);
+        __m512i a4_vec = _mm512_maskz_loadu_epi8(mask, a + 192);
+        __m512i b4_vec = _mm512_maskz_loadu_epi8(mask, b + 192);
+        __m512i and1_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a1_vec, b1_vec));
+        __m512i or1_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a1_vec, b1_vec));
+        __m512i and2_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a2_vec, b2_vec));
+        __m512i or2_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a2_vec, b2_vec));
+        __m512i and3_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a3_vec, b3_vec));
+        __m512i or3_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a3_vec, b3_vec));
+        __m512i and4_count_vec = _mm512_popcnt_epi64(_mm512_and_si512(a4_vec, b4_vec));
+        __m512i or4_count_vec = _mm512_popcnt_epi64(_mm512_or_si512(a4_vec, b4_vec));
+        intersection = _mm512_reduce_add_epi64(_mm512_add_epi64(_mm512_add_epi64(and4_count_vec, and3_count_vec),
+                                                                _mm512_add_epi64(and2_count_vec, and1_count_vec)));
+        union_ = _mm512_reduce_add_epi64(_mm512_add_epi64(_mm512_add_epi64(or4_count_vec, or3_count_vec),
+                                                          _mm512_add_epi64(or2_count_vec, or1_count_vec)));
+    }
+    else {
+        __m512i and_count_vec = _mm512_setzero_si512(), or_count_vec = _mm512_setzero_si512();
+        __m512i a_vec, b_vec;
+
+    simsimd_jaccard_b8_ice_cycle:
+        if (n_words < 64) {
+            __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words);
+            a_vec = _mm512_maskz_loadu_epi8(mask, a);
+            b_vec = _mm512_maskz_loadu_epi8(mask, b);
+            n_words = 0;
+        }
+        else {
+            a_vec = _mm512_loadu_epi8(a);
+            b_vec = _mm512_loadu_epi8(b);
+            a += 64, b += 64, n_words -= 64;
+        }
+        __m512i and_vec = _mm512_and_si512(a_vec, b_vec);
+        __m512i or_vec = _mm512_or_si512(a_vec, b_vec);
+        and_count_vec = _mm512_add_epi64(and_count_vec, _mm512_popcnt_epi64(and_vec));
+        or_count_vec = _mm512_add_epi64(or_count_vec, _mm512_popcnt_epi64(or_vec));
+        if (n_words) goto simsimd_jaccard_b8_ice_cycle;
+
+        intersection = _mm512_reduce_add_epi64(and_count_vec);
+        union_ = _mm512_reduce_add_epi64(or_count_vec);
+    }
+    *result = (union_ != 0) ? 1 - (simsimd_f64_t)intersection / (simsimd_f64_t)union_ : 1;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_ICE
+
+#if SIMSIMD_TARGET_HASWELL
+#pragma GCC push_options
+#pragma GCC target("popcnt")
+#pragma clang attribute push(__attribute__((target("popcnt"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_hamming_b8_haswell(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                               simsimd_distance_t *result) {
+    // x86 supports unaligned loads and works just fine with the scalar version for small vectors.
+    simsimd_size_t differences = 0;
+    for (; n_words >= 8; n_words -= 8, a += 8, b += 8)
+        differences += _mm_popcnt_u64(*(simsimd_u64_t const *)a ^ *(simsimd_u64_t const *)b);
+    for (; n_words; --n_words, ++a, ++b) differences += _mm_popcnt_u32(*a ^ *b);
+    *result = differences;
+}
+
+SIMSIMD_PUBLIC void simsimd_jaccard_b8_haswell(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n_words,
+                                               simsimd_distance_t *result) {
+    // x86 supports unaligned loads and works just fine with the scalar version for small vectors.
+    simsimd_size_t intersection = 0, union_ = 0;
+    for (; n_words >= 8; n_words -= 8, a += 8, b += 8)
+        intersection += _mm_popcnt_u64(*(simsimd_u64_t const *)a & *(simsimd_u64_t const *)b),
+            union_ += _mm_popcnt_u64(*(simsimd_u64_t const *)a | *(simsimd_u64_t const *)b);
+    for (; n_words; --n_words, ++a, ++b) intersection += _mm_popcnt_u32(*a & *b), union_ += _mm_popcnt_u32(*a | *b);
+    *result = (union_ != 0) ? 1 - (simsimd_f64_t)intersection / (simsimd_f64_t)union_ : 1;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_HASWELL
+#endif // _SIMSIMD_TARGET_X86
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/curved.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/curved.h
new file mode 100644
index 0000000000..df79b4f207
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/curved.h
@@ -0,0 +1,1540 @@
+/**
+ *  @file       curved.h
+ *  @brief      SIMD-accelerated Similarity Measures for curved spaces.
+ *  @author     Ash Vardanian
+ *  @date       August 27, 2024
+ *
+ *  Contains:
+ *  - Mahalanobis distance
+ *  - Bilinear form multiplication
+ *  - Bilinear form multiplication over complex numbers
+ *
+ *  For datatypes:
+ *  - 64-bit floating point numbers
+ *  - 32-bit floating point numbers
+ *  - 16-bit floating point numbers
+ *  - 16-bit brain-floating point numbers
+ *
+ *  For hardware architectures:
+ *  - Arm: NEON
+ *  - x86: Haswell, Ice Lake, Skylake, Genoa, Sapphire
+ *
+ *  Most kernels in this file are designed for BLAS level 2 operations, where the operands are
+ *  a combination of matrices and vectors, generally forming a chain of multiplications.
+ *  Most kernels exploit the fact that matrix multiplication is associative, and the order of
+ *  operations can be changed to minimize the number of operations: `(A * B) * C = A * (B * C)`.
+ *  To optimize the performance, we minimize the number of memory accesses, and maximize the
+ *  number of arithmetic operations, by using SIMD instructions.
+ *
+ *  When A and C are vectors, and B is a matrix, we can load every element in B just once, and
+ *  reuse it for every element in A and C.
+ *
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide/
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics/
+ */
+#ifndef SIMSIMD_CURVED_H
+#define SIMSIMD_CURVED_H
+
+#include "types.h"
+
+#include "dot.h"     // `_simsimd_partial_load_f16x4_neon` and friends
+#include "spatial.h" // `_simsimd_substract_bf16x32_genoa`
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// clang-format off
+
+/*  Serial backends for all numeric types.
+ *  By default they use 32-bit arithmetic, unless the arguments themselves contain 64-bit floats.
+ *  For double-precision computation check out the "*_accurate" variants of those "*_serial" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_bilinear_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_f64_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f64c_serial(simsimd_f64c_t const* a, simsimd_f64c_t const* b, simsimd_f64c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_f64_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_f32_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f32c_serial(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_f32c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_f32_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f16c_serial(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_f16c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16c_serial(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_bf16c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+
+/*  Double-precision serial backends for all numeric types.
+ *  For single-precision computation check out the "*_serial" counterparts of those "*_accurate" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_bilinear_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_f32_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f32c_accurate(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_f32c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_f32_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f16c_accurate(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_f16c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16_accurate(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16c_accurate(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_bf16c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_bf16_accurate(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+
+/*  SIMD-powered backends for Arm NEON, mostly using 32-bit arithmetic over 128-bit words.
+ *  By far the most portable backend, covering most Arm v8 devices, over a billion phones, and almost all
+ *  server CPUs produced before 2023.
+ */
+SIMSIMD_PUBLIC void simsimd_bilinear_f32_neon(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_f32_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f32c_neon(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_f32c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f32_neon(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_f32_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f16_neon(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f16c_neon(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_f16c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f16_neon(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16_neon(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16c_neon(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_bf16c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_bf16_neon(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+
+/*  SIMD-powered backends for AVX2 CPUs of Haswell generation and newer, using 32-bit arithmetic over 256-bit words.
+ *  First demonstrated in 2011, at least one Haswell-based processor was still being sold in 2022 — the Pentium G3420.
+ *  Practically all modern x86 CPUs support AVX2, FMA, and F16C, making it a perfect baseline for SIMD algorithms.
+ *  On other hand, there is no need to implement AVX2 versions of `f32` and `f64` functions, as those are
+ *  properly vectorized by recent compilers.
+ */
+SIMSIMD_PUBLIC void simsimd_bilinear_f16_haswell(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f16_haswell(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16_haswell(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_bf16_haswell(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+
+/*  SIMD-powered backends for various generations of AVX512 CPUs.
+ *  Skylake is handy, as it supports masked loads and other operations, avoiding the need for the tail loop.
+ *  Ice Lake added VNNI, VPOPCNTDQ, IFMA, VBMI, VAES, GFNI, VBMI2, BITALG, VPCLMULQDQ, and other extensions for integral operations.
+ *  Sapphire Rapids added tiled matrix operations, but we are most interested in the new mixed-precision FMA instructions.
+ */
+SIMSIMD_PUBLIC void simsimd_bilinear_f64_skylake(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_f64_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f64c_skylake(simsimd_f64c_t const* a, simsimd_f64c_t const* b, simsimd_f64c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f64_skylake(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_f64_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f32_skylake(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_f32_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f32c_skylake(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_f32c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f32_skylake(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_f32_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16_genoa(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16c_genoa(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_bf16c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_bf16_genoa(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_bf16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f16_sapphire(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_bilinear_f16c_sapphire(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_f16c_t const* c, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f16_sapphire(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_f16_t const* c, simsimd_size_t n, simsimd_distance_t* result);
+// clang-format on
+
+#define SIMSIMD_MAKE_BILINEAR(name, input_type, accumulator_type, load_and_convert)                              \
+    SIMSIMD_PUBLIC void simsimd_bilinear_##input_type##_##name(                                                  \
+        simsimd_##input_type##_t const *a, simsimd_##input_type##_t const *b, simsimd_##input_type##_t const *c, \
+        simsimd_size_t n, simsimd_distance_t *result) {                                                          \
+        simsimd_##accumulator_type##_t sum = 0;                                                                  \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                                \
+            simsimd_##accumulator_type##_t cb_j = 0;                                                             \
+            simsimd_##accumulator_type##_t a_i = load_and_convert(a + i);                                        \
+            for (simsimd_size_t j = 0; j != n; ++j) {                                                            \
+                simsimd_##accumulator_type##_t b_j = load_and_convert(b + j);                                    \
+                simsimd_##accumulator_type##_t c_ij = load_and_convert(c + i * n + j);                           \
+                cb_j += c_ij * b_j;                                                                              \
+            }                                                                                                    \
+            sum += a_i * cb_j;                                                                                   \
+        }                                                                                                        \
+        *result = (simsimd_distance_t)sum;                                                                       \
+    }
+
+#define SIMSIMD_MAKE_COMPLEX_BILINEAR(name, input_type, accumulator_type, load_and_convert)                \
+    SIMSIMD_PUBLIC void simsimd_bilinear_##input_type##_##name(                                            \
+        simsimd_##input_type##_t const *a_pairs, simsimd_##input_type##_t const *b_pairs,                  \
+        simsimd_##input_type##_t const *c_pairs, simsimd_size_t n, simsimd_distance_t *results) {          \
+        simsimd_##accumulator_type##_t sum_real = 0;                                                       \
+        simsimd_##accumulator_type##_t sum_imag = 0;                                                       \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                          \
+            simsimd_##accumulator_type##_t cb_j_real = 0;                                                  \
+            simsimd_##accumulator_type##_t cb_j_imag = 0;                                                  \
+            simsimd_##accumulator_type##_t a_i_real = load_and_convert(&(a_pairs + i)->real);              \
+            simsimd_##accumulator_type##_t a_i_imag = load_and_convert(&(a_pairs + i)->imag);              \
+            for (simsimd_size_t j = 0; j != n; ++j) {                                                      \
+                simsimd_##accumulator_type##_t b_j_real = load_and_convert(&(b_pairs + j)->real);          \
+                simsimd_##accumulator_type##_t b_j_imag = load_and_convert(&(b_pairs + j)->imag);          \
+                simsimd_##accumulator_type##_t c_ij_real = load_and_convert(&(c_pairs + i * n + j)->real); \
+                simsimd_##accumulator_type##_t c_ij_imag = load_and_convert(&(c_pairs + i * n + j)->imag); \
+                /* Complex multiplication: (c_ij * b_j) */                                                 \
+                cb_j_real += c_ij_real * b_j_real - c_ij_imag * b_j_imag;                                  \
+                cb_j_imag += c_ij_real * b_j_imag + c_ij_imag * b_j_real;                                  \
+            }                                                                                              \
+            /* Complex multiplication: (a_i * cb_j) */                                                     \
+            sum_real += a_i_real * cb_j_real - a_i_imag * cb_j_imag;                                       \
+            sum_imag += a_i_real * cb_j_imag + a_i_imag * cb_j_real;                                       \
+        }                                                                                                  \
+        results[0] = (simsimd_distance_t)sum_real;                                                         \
+        results[1] = (simsimd_distance_t)sum_imag;                                                         \
+    }
+
+#define SIMSIMD_MAKE_MAHALANOBIS(name, input_type, accumulator_type, load_and_convert)                           \
+    SIMSIMD_PUBLIC void simsimd_mahalanobis_##input_type##_##name(                                               \
+        simsimd_##input_type##_t const *a, simsimd_##input_type##_t const *b, simsimd_##input_type##_t const *c, \
+        simsimd_size_t n, simsimd_distance_t *result) {                                                          \
+        simsimd_##accumulator_type##_t sum = 0;                                                                  \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                                \
+            simsimd_##accumulator_type##_t cdiff_j = 0;                                                          \
+            simsimd_##accumulator_type##_t diff_i = load_and_convert(a + i) - load_and_convert(b + i);           \
+            for (simsimd_size_t j = 0; j != n; ++j) {                                                            \
+                simsimd_##accumulator_type##_t diff_j = load_and_convert(a + j) - load_and_convert(b + j);       \
+                simsimd_##accumulator_type##_t c_ij = load_and_convert(c + i * n + j);                           \
+                cdiff_j += c_ij * diff_j;                                                                        \
+            }                                                                                                    \
+            sum += diff_i * cdiff_j;                                                                             \
+        }                                                                                                        \
+        *result = (simsimd_distance_t)SIMSIMD_SQRT(sum);                                                         \
+    }
+
+SIMSIMD_MAKE_BILINEAR(serial, f64, f64, SIMSIMD_DEREFERENCE)          // simsimd_bilinear_f64_serial
+SIMSIMD_MAKE_COMPLEX_BILINEAR(serial, f64c, f64, SIMSIMD_DEREFERENCE) // simsimd_bilinear_f64c_serial
+SIMSIMD_MAKE_MAHALANOBIS(serial, f64, f64, SIMSIMD_DEREFERENCE)       // simsimd_mahalanobis_f64_serial
+
+SIMSIMD_MAKE_BILINEAR(serial, f32, f32, SIMSIMD_DEREFERENCE)          // simsimd_bilinear_f32_serial
+SIMSIMD_MAKE_COMPLEX_BILINEAR(serial, f32c, f32, SIMSIMD_DEREFERENCE) // simsimd_bilinear_f32c_serial
+SIMSIMD_MAKE_MAHALANOBIS(serial, f32, f32, SIMSIMD_DEREFERENCE)       // simsimd_mahalanobis_f32_serial
+
+SIMSIMD_MAKE_BILINEAR(serial, f16, f32, SIMSIMD_F16_TO_F32)          // simsimd_bilinear_f16_serial
+SIMSIMD_MAKE_COMPLEX_BILINEAR(serial, f16c, f32, SIMSIMD_F16_TO_F32) // simsimd_bilinear_f16c_serial
+SIMSIMD_MAKE_MAHALANOBIS(serial, f16, f32, SIMSIMD_F16_TO_F32)       // simsimd_mahalanobis_f16_serial
+
+SIMSIMD_MAKE_BILINEAR(serial, bf16, f32, SIMSIMD_BF16_TO_F32)          // simsimd_bilinear_bf16_serial
+SIMSIMD_MAKE_COMPLEX_BILINEAR(serial, bf16c, f32, SIMSIMD_BF16_TO_F32) // simsimd_bilinear_bf16c_serial
+SIMSIMD_MAKE_MAHALANOBIS(serial, bf16, f32, SIMSIMD_BF16_TO_F32)       // simsimd_mahalanobis_bf16_serial
+
+SIMSIMD_MAKE_BILINEAR(accurate, f32, f64, SIMSIMD_DEREFERENCE)          // simsimd_bilinear_f32_accurate
+SIMSIMD_MAKE_COMPLEX_BILINEAR(accurate, f32c, f64, SIMSIMD_DEREFERENCE) // simsimd_bilinear_f32c_accurate
+SIMSIMD_MAKE_MAHALANOBIS(accurate, f32, f64, SIMSIMD_DEREFERENCE)       // simsimd_mahalanobis_f32_accurate
+
+SIMSIMD_MAKE_BILINEAR(accurate, f16, f64, SIMSIMD_F16_TO_F32)          // simsimd_bilinear_f16_accurate
+SIMSIMD_MAKE_COMPLEX_BILINEAR(accurate, f16c, f64, SIMSIMD_F16_TO_F32) // simsimd_bilinear_f16c_accurate
+SIMSIMD_MAKE_MAHALANOBIS(accurate, f16, f64, SIMSIMD_F16_TO_F32)       // simsimd_mahalanobis_f16_accurate
+
+SIMSIMD_MAKE_BILINEAR(accurate, bf16, f64, SIMSIMD_BF16_TO_F32)          // simsimd_bilinear_bf16_accurate
+SIMSIMD_MAKE_COMPLEX_BILINEAR(accurate, bf16c, f64, SIMSIMD_BF16_TO_F32) // simsimd_bilinear_bf16c_accurate
+SIMSIMD_MAKE_MAHALANOBIS(accurate, bf16, f64, SIMSIMD_BF16_TO_F32)       // simsimd_mahalanobis_bf16_accurate
+
+#if _SIMSIMD_TARGET_ARM
+#if SIMSIMD_TARGET_NEON
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f32_neon(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c,
+                                              simsimd_size_t n, simsimd_distance_t *result) {
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        float32x4_t a_vec = vdupq_n_f32(a[i]);
+        float32x4_t cb_j_vec = vdupq_n_f32(0);
+        for (simsimd_size_t j = 0; j + 4 <= n; j += 4) {
+            float32x4_t b_vec = vld1q_f32(b + j);
+            float32x4_t c_vec = vld1q_f32(c + i * n + j);
+            cb_j_vec = vmlaq_f32(cb_j_vec, b_vec, c_vec);
+        }
+        sum_vec = vmlaq_f32(sum_vec, a_vec, cb_j_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f64_t sum = vaddvq_f32(sum_vec);
+    simsimd_size_t const tail_length = n % 4;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t cb_j = 0;
+            for (simsimd_size_t j = tail_start; j != n; ++j) cb_j += b[j] * c[i * n + j];
+            sum += a[i] * cb_j;
+        }
+    }
+
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f32_neon(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c,
+                                                 simsimd_size_t n, simsimd_distance_t *result) {
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        float32x4_t diff_i_vec = vdupq_n_f32(a[i] - b[i]);
+        float32x4_t cdiff_j_vec = vdupq_n_f32(0);
+        for (simsimd_size_t j = 0; j + 4 <= n; j += 4) {
+            float32x4_t diff_j_vec = vsubq_f32(vld1q_f32(a + j), vld1q_f32(b + j));
+            float32x4_t c_vec = vld1q_f32(c + i * n + j);
+            cdiff_j_vec = vmlaq_f32(cdiff_j_vec, diff_j_vec, c_vec);
+        }
+
+        sum_vec = vmlaq_f32(sum_vec, diff_i_vec, cdiff_j_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f64_t sum = vaddvq_f32(sum_vec);
+    simsimd_size_t const tail_length = n % 4;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t diff_i = a[i] - b[i];
+            simsimd_f32_t cdiff_j = 0;
+            for (simsimd_size_t j = tail_start; j != n; ++j) {
+                simsimd_f32_t diff_j = a[j] - b[j];
+                cdiff_j += diff_j * c[i * n + j];
+            }
+            sum += diff_i * cdiff_j;
+        }
+    }
+
+    *result = _simsimd_sqrt_f64_neon(sum);
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f32c_neon(simsimd_f32c_t const *a, simsimd_f32c_t const *b,
+                                               simsimd_f32c_t const *c, simsimd_size_t n, simsimd_distance_t *results) {
+    simsimd_f32_t sum_real = 0;
+    simsimd_f32_t sum_imag = 0;
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        simsimd_f32c_t a_i = a[i];
+        simsimd_f32c_t cb_j;
+        float32x4_t cb_j_real_vec = vdupq_n_f32(0);
+        float32x4_t cb_j_imag_vec = vdupq_n_f32(0);
+        for (simsimd_size_t j = 0; j + 4 <= n; j += 4) {
+            // Unpack the input arrays into real and imaginary parts:
+            float32x4x2_t b_vec = vld2q_f32((simsimd_f32_t const *)(b + j));
+            float32x4x2_t c_vec = vld2q_f32((simsimd_f32_t const *)(c + i * n + j));
+            float32x4_t b_real_vec = b_vec.val[0];
+            float32x4_t b_imag_vec = b_vec.val[1];
+            float32x4_t c_real_vec = c_vec.val[0];
+            float32x4_t c_imag_vec = c_vec.val[1];
+
+            // Compute the dot product:
+            cb_j_real_vec = vfmaq_f32(cb_j_real_vec, c_real_vec, b_real_vec);
+            cb_j_real_vec = vfmsq_f32(cb_j_real_vec, c_imag_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f32(cb_j_imag_vec, c_real_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f32(cb_j_imag_vec, c_imag_vec, b_real_vec);
+        }
+        cb_j.real = vaddvq_f32(cb_j_real_vec);
+        cb_j.imag = vaddvq_f32(cb_j_imag_vec);
+        sum_real += a_i.real * cb_j.real - a_i.imag * cb_j.imag;
+        sum_imag += a_i.real * cb_j.imag + a_i.imag * cb_j.real;
+    }
+
+    // Handle the tail of every row
+    simsimd_size_t const tail_length = n % 4;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32c_t a_i = a[i];
+            simsimd_f32c_t cb_j = {0, 0};
+            for (simsimd_size_t j = tail_start; j != n; ++j) {
+                simsimd_f32c_t b_j = b[j];
+                simsimd_f32c_t c_ij = c[i * n + j];
+                cb_j.real += b_j.real * c_ij.real - b_j.imag * c_ij.imag;
+                cb_j.imag += b_j.real * c_ij.imag + b_j.imag * c_ij.real;
+            }
+            sum_real += a_i.real * cb_j.real - a_i.imag * cb_j.imag;
+            sum_imag += a_i.real * cb_j.imag + a_i.imag * cb_j.real;
+        }
+    }
+
+    results[0] = sum_real;
+    results[1] = sum_imag;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON
+
+#if SIMSIMD_TARGET_NEON_F16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd+fp16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd+fp16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f16_neon(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c,
+                                              simsimd_size_t n, simsimd_distance_t *result) {
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        // MSVC doesn't recognize `vdup_n_f16` as a valid intrinsic
+        float32x4_t a_vec = vcvt_f32_f16(vreinterpret_f16_s16(vdup_n_s16(*(short const *)(a + i))));
+        float32x4_t cb_j_vec = vdupq_n_f32(0);
+        for (simsimd_size_t j = 0; j + 4 <= n; j += 4) {
+            float32x4_t b_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)(b + j)));
+            float32x4_t c_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)(c + i * n + j)));
+            cb_j_vec = vmlaq_f32(cb_j_vec, b_vec, c_vec);
+        }
+        sum_vec = vmlaq_f32(sum_vec, a_vec, cb_j_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f64_t sum = vaddvq_f32(sum_vec);
+    simsimd_size_t const tail_length = n % 4;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t a_i = vaddvq_f32(vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(a + i, 1)));
+            float32x4_t b_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(b + tail_start, tail_length));
+            float32x4_t c_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(c + i * n + tail_start, tail_length));
+            simsimd_f32_t cb_j = vaddvq_f32(vmulq_f32(b_vec, c_vec));
+            sum += a_i * cb_j;
+        }
+    }
+
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f16_neon(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c,
+                                                 simsimd_size_t n, simsimd_distance_t *result) {
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        // MSVC doesn't recognize `vdup_n_f16` as a valid intrinsic
+        float32x4_t a_i_vec = vcvt_f32_f16(vreinterpret_f16_s16(vdup_n_s16(*(short const *)(a + i))));
+        float32x4_t b_i_vec = vcvt_f32_f16(vreinterpret_f16_s16(vdup_n_s16(*(short const *)(b + i))));
+        float32x4_t diff_i_vec = vsubq_f32(a_i_vec, b_i_vec);
+        float32x4_t cdiff_j_vec = vdupq_n_f32(0);
+        for (simsimd_size_t j = 0; j + 4 <= n; j += 4) {
+            float32x4_t a_j_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)(a + j)));
+            float32x4_t b_j_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)(b + j)));
+            float32x4_t diff_j_vec = vsubq_f32(a_j_vec, b_j_vec);
+            float32x4_t c_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)(c + i * n + j)));
+            cdiff_j_vec = vmlaq_f32(cdiff_j_vec, diff_j_vec, c_vec);
+        }
+        sum_vec = vmlaq_f32(sum_vec, diff_i_vec, cdiff_j_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f32_t sum = vaddvq_f32(sum_vec);
+    simsimd_size_t const tail_length = n % 4;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t a_i = vaddvq_f32(vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(a + i, 1)));
+            simsimd_f32_t b_i = vaddvq_f32(vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(b + i, 1)));
+            simsimd_f32_t diff_i = a_i - b_i;
+            float32x4_t a_j_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(a + tail_start, tail_length));
+            float32x4_t b_j_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(b + tail_start, tail_length));
+            float32x4_t diff_j_vec = vsubq_f32(a_j_vec, b_j_vec);
+            float32x4_t c_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(c + i * n + tail_start, tail_length));
+            simsimd_f32_t cdiff_j = vaddvq_f32(vmulq_f32(diff_j_vec, c_vec));
+            sum += diff_i * cdiff_j;
+        }
+    }
+
+    *result = _simsimd_sqrt_f32_neon(sum);
+}
+
+SIMSIMD_INTERNAL simsimd_f32_t _simsimd_reduce_f16x8_neon(float16x8_t vec) {
+    // Split the 8-element vector into two 4-element vectors
+    float16x4_t low = vget_low_f16(vec);   // Lower 4 elements
+    float16x4_t high = vget_high_f16(vec); // Upper 4 elements
+
+    // Add the lower and upper parts
+    float16x4_t sum = vadd_f16(low, high);
+
+    // Perform pairwise addition to reduce 4 elements to 2, then to 1
+    sum = vpadd_f16(sum, sum); // First reduction: 4 -> 2
+    sum = vpadd_f16(sum, sum); // Second reduction: 2 -> 1
+
+    // Convert the remaining half-precision value to single-precision and return
+    return vgetq_lane_f32(vcvt_f32_f16(sum), 0);
+}
+
+SIMSIMD_INTERNAL float16x8x2_t _simsimd_partial_load_f16x8x2_neon(simsimd_f16c_t const *x, simsimd_size_t n) {
+    union {
+        float16x8x2_t vecs;
+        simsimd_f16_t scalars[2][8];
+    } result;
+    simsimd_size_t i = 0;
+    for (; i < n; ++i) result.scalars[0][i] = x[i].real, result.scalars[1][i] = x[i].imag;
+    for (; i < 8; ++i) result.scalars[0][i] = 0, result.scalars[1][i] = 0;
+    return result.vecs;
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f16c_neon(simsimd_f16c_t const *a, simsimd_f16c_t const *b,
+                                               simsimd_f16c_t const *c, simsimd_size_t n, simsimd_distance_t *results) {
+    simsimd_f32_t sum_real = 0;
+    simsimd_f32_t sum_imag = 0;
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        simsimd_f32c_t a_i = {simsimd_f16_to_f32(&a[i].real), simsimd_f16_to_f32(&a[i].imag)};
+        float16x8_t cb_j_real_vec = vdupq_n_f16(0);
+        float16x8_t cb_j_imag_vec = vdupq_n_f16(0);
+        for (simsimd_size_t j = 0; j + 8 <= n; j += 8) {
+            // Unpack the input arrays into real and imaginary parts:
+            float16x8x2_t b_vec = vld2q_f16((float16_t const *)(b + j));
+            float16x8x2_t c_vec = vld2q_f16((float16_t const *)(c + i * n + j));
+            float16x8_t b_real_vec = b_vec.val[0];
+            float16x8_t b_imag_vec = b_vec.val[1];
+            float16x8_t c_real_vec = c_vec.val[0];
+            float16x8_t c_imag_vec = c_vec.val[1];
+
+            // Compute the dot product:
+            cb_j_real_vec = vfmaq_f16(cb_j_real_vec, c_real_vec, b_real_vec);
+            cb_j_real_vec = vfmsq_f16(cb_j_real_vec, c_imag_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f16(cb_j_imag_vec, c_real_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f16(cb_j_imag_vec, c_imag_vec, b_real_vec);
+        }
+        // Handle row tails
+        if (tail_length) {
+            // Unpack the input arrays into real and imaginary parts:
+            float16x8x2_t b_vec = _simsimd_partial_load_f16x8x2_neon(b + tail_start, tail_length);
+            float16x8x2_t c_vec = _simsimd_partial_load_f16x8x2_neon(c + i * n + tail_start, tail_length);
+            float16x8_t b_real_vec = b_vec.val[0];
+            float16x8_t b_imag_vec = b_vec.val[1];
+            float16x8_t c_real_vec = c_vec.val[0];
+            float16x8_t c_imag_vec = c_vec.val[1];
+
+            // Compute the dot product:
+            cb_j_real_vec = vfmaq_f16(cb_j_real_vec, c_real_vec, b_real_vec);
+            cb_j_real_vec = vfmsq_f16(cb_j_real_vec, c_imag_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f16(cb_j_imag_vec, c_real_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f16(cb_j_imag_vec, c_imag_vec, b_real_vec);
+        }
+
+        simsimd_f32c_t cb_j;
+        cb_j.real = _simsimd_reduce_f16x8_neon(cb_j_real_vec);
+        cb_j.imag = _simsimd_reduce_f16x8_neon(cb_j_imag_vec);
+        sum_real += a_i.real * cb_j.real - a_i.imag * cb_j.imag;
+        sum_imag += a_i.real * cb_j.imag + a_i.imag * cb_j.real;
+    }
+
+    results[0] = sum_real;
+    results[1] = sum_imag;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_F16
+
+#if SIMSIMD_TARGET_NEON_BF16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.6-a+simd+bf16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.6-a+simd+bf16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16_neon(simsimd_bf16_t const *a, simsimd_bf16_t const *b,
+                                               simsimd_bf16_t const *c, simsimd_size_t n, simsimd_distance_t *result) {
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        float32x4_t a_vec = vdupq_n_f32(simsimd_bf16_to_f32(a + i));
+        float32x4_t cb_j_vec = vdupq_n_f32(0);
+        for (simsimd_size_t j = 0; j + 8 <= n; j += 8) {
+            bfloat16x8_t b_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)(b + j));
+            bfloat16x8_t c_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)(c + i * n + j));
+            cb_j_vec = vbfdotq_f32(cb_j_vec, b_vec, c_vec);
+        }
+        sum_vec = vmlaq_f32(sum_vec, a_vec, cb_j_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f64_t sum = vaddvq_f32(sum_vec);
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t a_i = simsimd_bf16_to_f32(a + i);
+            bfloat16x8_t b_vec = _simsimd_partial_load_bf16x8_neon(b + tail_start, tail_length);
+            bfloat16x8_t c_vec = _simsimd_partial_load_bf16x8_neon(c + i * n + tail_start, tail_length);
+            simsimd_f32_t cb_j = vaddvq_f32(vbfdotq_f32(vdupq_n_f32(0), b_vec, c_vec));
+            sum += a_i * cb_j;
+        }
+    }
+
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_mahalanobis_bf16_neon(simsimd_bf16_t const *a, simsimd_bf16_t const *b,
+                                                  simsimd_bf16_t const *c, simsimd_size_t n,
+                                                  simsimd_distance_t *result) {
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        simsimd_f32_t a_i = simsimd_bf16_to_f32(a + i);
+        simsimd_f32_t b_i = simsimd_bf16_to_f32(b + i);
+        float32x4_t diff_i_vec = vdupq_n_f32(a_i - b_i);
+        float32x4_t cdiff_j_vec = vdupq_n_f32(0);
+        for (simsimd_size_t j = 0; j + 8 <= n; j += 8) {
+            bfloat16x8_t a_j_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)(a + j));
+            bfloat16x8_t b_j_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)(b + j));
+
+            // Arm NEON does not have a native subtraction instruction for `bf16`,
+            // so we need to convert to `f32` first, subtract, and only then get back to `bf16`
+            // for multiplication.
+            float32x4_t a_j_vec_high = vcvt_f32_bf16(vget_high_bf16(a_j_vec));
+            float32x4_t a_j_vec_low = vcvt_f32_bf16(vget_low_bf16(a_j_vec));
+            float32x4_t b_j_vec_high = vcvt_f32_bf16(vget_high_bf16(b_j_vec));
+            float32x4_t b_j_vec_low = vcvt_f32_bf16(vget_low_bf16(b_j_vec));
+            float32x4_t diff_j_vec_high = vsubq_f32(a_j_vec_high, b_j_vec_high);
+            float32x4_t diff_j_vec_low = vsubq_f32(a_j_vec_low, b_j_vec_low);
+            bfloat16x8_t diff_j_vec = vcombine_bf16(vcvt_bf16_f32(diff_j_vec_low), vcvt_bf16_f32(diff_j_vec_high));
+
+            bfloat16x8_t c_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)(c + i * n + j));
+            cdiff_j_vec = vbfdotq_f32(cdiff_j_vec, diff_j_vec, c_vec);
+        }
+        sum_vec = vmlaq_f32(sum_vec, diff_i_vec, cdiff_j_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f32_t sum = vaddvq_f32(sum_vec);
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t a_i = simsimd_bf16_to_f32(a + i);
+            simsimd_f32_t b_i = simsimd_bf16_to_f32(b + i);
+            simsimd_f32_t diff_i = a_i - b_i;
+            bfloat16x8_t a_j_vec = _simsimd_partial_load_bf16x8_neon(a + tail_start, tail_length);
+            bfloat16x8_t b_j_vec = _simsimd_partial_load_bf16x8_neon(b + tail_start, tail_length);
+
+            // Again, upcast for subtraction
+            float32x4_t a_j_vec_high = vcvt_f32_bf16(vget_high_bf16(a_j_vec));
+            float32x4_t a_j_vec_low = vcvt_f32_bf16(vget_low_bf16(a_j_vec));
+            float32x4_t b_j_vec_high = vcvt_f32_bf16(vget_high_bf16(b_j_vec));
+            float32x4_t b_j_vec_low = vcvt_f32_bf16(vget_low_bf16(b_j_vec));
+            float32x4_t diff_j_vec_high = vsubq_f32(a_j_vec_high, b_j_vec_high);
+            float32x4_t diff_j_vec_low = vsubq_f32(a_j_vec_low, b_j_vec_low);
+            bfloat16x8_t diff_j_vec = vcombine_bf16(vcvt_bf16_f32(diff_j_vec_low), vcvt_bf16_f32(diff_j_vec_high));
+
+            bfloat16x8_t c_vec = _simsimd_partial_load_bf16x8_neon(c + i * n + tail_start, tail_length);
+            simsimd_f32_t cdiff_j = vaddvq_f32(vbfdotq_f32(vdupq_n_f32(0), diff_j_vec, c_vec));
+            sum += diff_i * cdiff_j;
+        }
+    }
+
+    *result = _simsimd_sqrt_f32_neon(sum);
+}
+
+SIMSIMD_INTERNAL int16x4x2_t _simsimd_partial_load_bf16x4x2_neon(simsimd_bf16c_t const *x, simsimd_size_t n) {
+    union {
+        int16x4x2_t vec;
+        simsimd_bf16_t scalars[2][4];
+    } result;
+    simsimd_size_t i = 0;
+    for (; i < n; ++i) result.scalars[0][i] = x[i].real, result.scalars[1][i] = x[i].imag;
+    for (; i < 4; ++i) result.scalars[1][i] = 0, result.scalars[1][i] = 0;
+    return result.vec;
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16c_neon(simsimd_bf16c_t const *a, simsimd_bf16c_t const *b,
+                                                simsimd_bf16c_t const *c, simsimd_size_t n,
+                                                simsimd_distance_t *results) {
+    simsimd_f32_t sum_real = 0;
+    simsimd_f32_t sum_imag = 0;
+    simsimd_size_t const tail_length = n % 4;
+    simsimd_size_t const tail_start = n - tail_length;
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        simsimd_f32c_t a_i = {simsimd_bf16_to_f32(&a[i].real), simsimd_bf16_to_f32(&a[i].imag)};
+        // A nicer approach is to use `bf16` arithmetic for the dot product, but that requires
+        // FMLA extensions available on Arm v8.3 and later. That we can also process 16 entries
+        // at once. That's how the original implementation worked, but compiling it was a nightmare :)
+        float32x4_t cb_j_real_vec = vdupq_n_f32(0);
+        float32x4_t cb_j_imag_vec = vdupq_n_f32(0);
+        for (simsimd_size_t j = 0; j + 4 <= n; j += 4) {
+            // Unpack the input arrays into real and imaginary parts.
+            // MSVC sadly doesn't recognize the `vld2_bf16`, so we load the  data as signed
+            // integers of the same size and reinterpret with `vreinterpret_bf16_s16` afterwards.
+            int16x4x2_t b_vec = vld2_s16((short const *)(b + j));
+            int16x4x2_t c_vec = vld2_s16((short const *)(c + i * n + j));
+            float32x4_t b_real_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(b_vec.val[0]));
+            float32x4_t b_imag_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(b_vec.val[1]));
+            float32x4_t c_real_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(c_vec.val[0]));
+            float32x4_t c_imag_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(c_vec.val[1]));
+
+            // Compute the dot product:
+            cb_j_real_vec = vfmaq_f32(cb_j_real_vec, c_real_vec, b_real_vec);
+            cb_j_real_vec = vfmsq_f32(cb_j_real_vec, c_imag_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f32(cb_j_imag_vec, c_real_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f32(cb_j_imag_vec, c_imag_vec, b_real_vec);
+        }
+        // Handle row tails
+        if (tail_length) {
+            // Unpack the input arrays into real and imaginary parts:
+            int16x4x2_t b_vec = _simsimd_partial_load_bf16x4x2_neon(b + tail_start, tail_length);
+            int16x4x2_t c_vec = _simsimd_partial_load_bf16x4x2_neon(c + i * n + tail_start, tail_length);
+            float32x4_t b_real_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(b_vec.val[0]));
+            float32x4_t b_imag_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(b_vec.val[1]));
+            float32x4_t c_real_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(c_vec.val[0]));
+            float32x4_t c_imag_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(c_vec.val[1]));
+
+            // Compute the dot product:
+            cb_j_real_vec = vfmaq_f32(cb_j_real_vec, c_real_vec, b_real_vec);
+            cb_j_real_vec = vfmsq_f32(cb_j_real_vec, c_imag_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f32(cb_j_imag_vec, c_real_vec, b_imag_vec);
+            cb_j_imag_vec = vfmaq_f32(cb_j_imag_vec, c_imag_vec, b_real_vec);
+        }
+
+        simsimd_f32c_t cb_j;
+        cb_j.real = vaddvq_f32(cb_j_real_vec);
+        cb_j.imag = vaddvq_f32(cb_j_imag_vec);
+        sum_real += a_i.real * cb_j.real - a_i.imag * cb_j.imag;
+        sum_imag += a_i.real * cb_j.imag + a_i.imag * cb_j.real;
+    }
+
+    results[0] = sum_real;
+    results[1] = sum_imag;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_BF16
+
+#endif // _SIMSIMD_TARGET_ARM
+
+#if _SIMSIMD_TARGET_X86
+#if SIMSIMD_TARGET_HASWELL
+#pragma GCC push_options
+#pragma GCC target("avx2", "f16c", "fma")
+#pragma clang attribute push(__attribute__((target("avx2,f16c,fma"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f16_haswell(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c,
+                                                 simsimd_size_t n, simsimd_distance_t *result) {
+    __m256 sum_vec = _mm256_setzero_ps();
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m256 a_vec = _mm256_cvtph_ps(_mm_set1_epi16(*(short const *)(a + i)));
+        __m256 cb_j_vec = _mm256_setzero_ps();
+        for (simsimd_size_t j = 0; j + 8 <= n; j += 8) {
+            __m256 b_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)(b + j)));
+            __m256 c_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)(c + i * n + j)));
+            cb_j_vec = _mm256_fmadd_ps(b_vec, c_vec, cb_j_vec);
+        }
+        sum_vec = _mm256_fmadd_ps(a_vec, cb_j_vec, sum_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f32_t sum = _simsimd_reduce_f32x8_haswell(sum_vec);
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t a_i = _mm256_cvtss_f32(_mm256_cvtph_ps(_mm_set1_epi16(*(short const *)(a + i))));
+            __m256 b_vec = _simsimd_partial_load_f16x8_haswell(b + tail_start, tail_length);
+            __m256 c_vec = _simsimd_partial_load_f16x8_haswell(c + i * n + tail_start, tail_length);
+            simsimd_f32_t cb_j = _simsimd_reduce_f32x8_haswell(_mm256_mul_ps(b_vec, c_vec));
+            sum += a_i * cb_j;
+        }
+    }
+
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f16_haswell(simsimd_f16_t const *a, simsimd_f16_t const *b,
+                                                    simsimd_f16_t const *c, simsimd_size_t n,
+                                                    simsimd_distance_t *result) {
+    __m256 sum_vec = _mm256_setzero_ps();
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m256 diff_i_vec = _mm256_sub_ps(                            //
+            _mm256_cvtph_ps(_mm_set1_epi16(*(short const *)(a + i))), //
+            _mm256_cvtph_ps(_mm_set1_epi16(*(short const *)(b + i))));
+        __m256 cdiff_j_vec = _mm256_setzero_ps();
+        for (simsimd_size_t j = 0; j + 8 <= n; j += 8) {
+            __m256 diff_j_vec = _mm256_sub_ps( //
+                _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)(a + j))),
+                _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)(b + j))));
+            __m256 c_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)(c + i * n + j)));
+            cdiff_j_vec = _mm256_fmadd_ps(diff_j_vec, c_vec, cdiff_j_vec);
+        }
+        sum_vec = _mm256_fmadd_ps(diff_i_vec, cdiff_j_vec, sum_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f32_t sum = _simsimd_reduce_f32x8_haswell(sum_vec);
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t diff_i = _mm256_cvtss_f32(_mm256_sub_ps(        //
+                _mm256_cvtph_ps(_mm_set1_epi16(*(short const *)(a + i))), //
+                _mm256_cvtph_ps(_mm_set1_epi16(*(short const *)(b + i)))));
+            __m256 diff_j_vec = _mm256_sub_ps( //
+                _simsimd_partial_load_f16x8_haswell(a + tail_start, tail_length),
+                _simsimd_partial_load_f16x8_haswell(b + tail_start, tail_length));
+            __m256 c_vec = _simsimd_partial_load_f16x8_haswell(c + i * n + tail_start, tail_length);
+            simsimd_f32_t cdiff_j = _simsimd_reduce_f32x8_haswell(_mm256_mul_ps(diff_j_vec, c_vec));
+            sum += diff_i * cdiff_j;
+        }
+    }
+
+    *result = _simsimd_sqrt_f32_haswell(sum);
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16_haswell(simsimd_bf16_t const *a, simsimd_bf16_t const *b,
+                                                  simsimd_bf16_t const *c, simsimd_size_t n,
+                                                  simsimd_distance_t *result) {
+    __m256 sum_vec = _mm256_setzero_ps();
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        // The `simsimd_bf16_to_f32` is cheaper than `_simsimd_bf16x8_to_f32x8_haswell`
+        __m256 a_vec = _mm256_set1_ps(simsimd_bf16_to_f32(a + i));
+        __m256 cb_j_vec = _mm256_setzero_ps();
+        for (simsimd_size_t j = 0; j + 8 <= n; j += 8) {
+            __m256 b_vec = _simsimd_bf16x8_to_f32x8_haswell(_mm_lddqu_si128((__m128i const *)(b + j)));
+            __m256 c_vec = _simsimd_bf16x8_to_f32x8_haswell(_mm_lddqu_si128((__m128i const *)(c + i * n + j)));
+            cb_j_vec = _mm256_fmadd_ps(b_vec, c_vec, cb_j_vec);
+        }
+        sum_vec = _mm256_fmadd_ps(a_vec, cb_j_vec, sum_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f32_t sum = _simsimd_reduce_f32x8_haswell(sum_vec);
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t a_i = simsimd_bf16_to_f32(a + i);
+            __m256 b_vec = _simsimd_bf16x8_to_f32x8_haswell( //
+                _simsimd_partial_load_bf16x8_haswell(b + tail_start, tail_length));
+            __m256 c_vec = _simsimd_bf16x8_to_f32x8_haswell( //
+                _simsimd_partial_load_bf16x8_haswell(c + i * n + tail_start, tail_length));
+            simsimd_f32_t cb_j = _simsimd_reduce_f32x8_haswell(_mm256_mul_ps(b_vec, c_vec));
+            sum += a_i * cb_j;
+        }
+    }
+
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_mahalanobis_bf16_haswell(simsimd_bf16_t const *a, simsimd_bf16_t const *b,
+                                                     simsimd_bf16_t const *c, simsimd_size_t n,
+                                                     simsimd_distance_t *result) {
+    __m256 sum_vec = _mm256_setzero_ps();
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m256 diff_i_vec = _mm256_sub_ps(              //
+            _mm256_set1_ps(simsimd_bf16_to_f32(a + i)), //
+            _mm256_set1_ps(simsimd_bf16_to_f32(b + i)));
+        __m256 cdiff_j_vec = _mm256_setzero_ps();
+        for (simsimd_size_t j = 0; j + 8 <= n; j += 8) {
+            __m256 diff_j_vec = _mm256_sub_ps(                                               //
+                _simsimd_bf16x8_to_f32x8_haswell(_mm_lddqu_si128((__m128i const *)(a + j))), //
+                _simsimd_bf16x8_to_f32x8_haswell(_mm_lddqu_si128((__m128i const *)(b + j))));
+            __m256 c_vec = _simsimd_bf16x8_to_f32x8_haswell(_mm_lddqu_si128((__m128i const *)(c + i * n + j)));
+            cdiff_j_vec = _mm256_fmadd_ps(diff_j_vec, c_vec, cdiff_j_vec);
+        }
+        sum_vec = _mm256_fmadd_ps(diff_i_vec, cdiff_j_vec, sum_vec);
+    }
+
+    // Handle the tail of every row
+    simsimd_f32_t sum = _simsimd_reduce_f32x8_haswell(sum_vec);
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    if (tail_length) {
+        for (simsimd_size_t i = 0; i != n; ++i) {
+            simsimd_f32_t diff_i = simsimd_bf16_to_f32(a + i) - simsimd_bf16_to_f32(b + i);
+            __m256 diff_j_vec = _mm256_sub_ps( //
+                _simsimd_bf16x8_to_f32x8_haswell(_simsimd_partial_load_bf16x8_haswell(a + tail_start, tail_length)),
+                _simsimd_bf16x8_to_f32x8_haswell(_simsimd_partial_load_bf16x8_haswell(b + tail_start, tail_length)));
+            __m256 c_vec = _simsimd_bf16x8_to_f32x8_haswell(
+                _simsimd_partial_load_bf16x8_haswell(c + i * n + tail_start, tail_length));
+            simsimd_f32_t cdiff_j = _simsimd_reduce_f32x8_haswell(_mm256_mul_ps(diff_j_vec, c_vec));
+            sum += diff_i * cdiff_j;
+        }
+    }
+
+    *result = _simsimd_sqrt_f32_haswell(sum);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_HASWELL
+
+#if SIMSIMD_TARGET_SKYLAKE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f32_skylake_under16unrolled(simsimd_f32_t const *a, simsimd_f32_t const *b,
+                                                                 simsimd_f32_t const *c, simsimd_size_t n,
+                                                                 simsimd_distance_t *result) {
+    // The goal of this optimization is to avoid horizontal accumulation of the cb_j sums
+    // until the very end of the computation.
+    __mmask16 const mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+    __m512 const b_vec = _mm512_maskz_loadu_ps(mask, b);
+
+    __m512 cb_j1 = _mm512_setzero_ps();
+    __m512 cb_j2 = _mm512_setzero_ps();
+    __m512 cb_j3 = _mm512_setzero_ps();
+    __m512 cb_j4 = _mm512_setzero_ps();
+
+    // Unroll the loop to process 4x ZMM registers at a time.
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        cb_j1 = _mm512_fmadd_ps(_mm512_maskz_loadu_ps(mask, c + n * (i + 0)),
+                                _mm512_mul_ps(b_vec, _mm512_set1_ps(a[i + 0])), cb_j1);
+        cb_j2 = _mm512_fmadd_ps(_mm512_maskz_loadu_ps(mask, c + n * (i + 1)),
+                                _mm512_mul_ps(b_vec, _mm512_set1_ps(a[i + 1])), cb_j2);
+        cb_j3 = _mm512_fmadd_ps(_mm512_maskz_loadu_ps(mask, c + n * (i + 2)),
+                                _mm512_mul_ps(b_vec, _mm512_set1_ps(a[i + 2])), cb_j3);
+        cb_j4 = _mm512_fmadd_ps(_mm512_maskz_loadu_ps(mask, c + n * (i + 3)),
+                                _mm512_mul_ps(b_vec, _mm512_set1_ps(a[i + 3])), cb_j4);
+    }
+
+    if (i + 0 < n)
+        cb_j1 = _mm512_fmadd_ps(_mm512_maskz_loadu_ps(mask, c + n * (i + 0)),
+                                _mm512_mul_ps(b_vec, _mm512_set1_ps(a[i + 0])), cb_j1);
+    if (i + 1 < n)
+        cb_j2 = _mm512_fmadd_ps(_mm512_maskz_loadu_ps(mask, c + n * (i + 1)),
+                                _mm512_mul_ps(b_vec, _mm512_set1_ps(a[i + 1])), cb_j2);
+    if (i + 2 < n)
+        cb_j3 = _mm512_fmadd_ps(_mm512_maskz_loadu_ps(mask, c + n * (i + 2)),
+                                _mm512_mul_ps(b_vec, _mm512_set1_ps(a[i + 2])), cb_j3);
+    if (i + 3 < n)
+        cb_j4 = _mm512_fmadd_ps(_mm512_maskz_loadu_ps(mask, c + n * (i + 3)),
+                                _mm512_mul_ps(b_vec, _mm512_set1_ps(a[i + 3])), cb_j4);
+
+    // Combine cb_j sums
+    __m512 sum_vec = _mm512_add_ps(  //
+        _mm512_add_ps(cb_j1, cb_j2), //
+        _mm512_add_ps(cb_j3, cb_j4));
+    *result = _mm512_reduce_add_ps(sum_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f32_skylake(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c,
+                                                 simsimd_size_t n, simsimd_distance_t *result) {
+
+    // On modern x86 CPUs we have enough register space to load fairly large matrices with up to 16 cells
+    // per row and 16 rows at a time, still keeping enough register space for temporaries.
+    if (n <= 16) {
+        simsimd_bilinear_f32_skylake_under16unrolled(a, b, c, n, result);
+        return;
+    }
+
+    // Default case for arbitrary size `n`
+    simsimd_size_t const tail_length = n % 16;
+    simsimd_size_t const tail_start = n - tail_length;
+    __m512 sum_vec = _mm512_setzero_ps();
+    __mmask16 const tail_mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, tail_length);
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m512 a_vec = _mm512_set1_ps(a[i]);
+        __m512 cb_j_vec = _mm512_setzero_ps();
+        __m512 b_vec, c_vec;
+        simsimd_size_t j = 0;
+
+    simsimd_bilinear_f32_skylake_cycle:
+        if (j + 16 <= n) {
+            b_vec = _mm512_loadu_ps(b + j);
+            c_vec = _mm512_loadu_ps(c + i * n + j);
+        }
+        else {
+            b_vec = _mm512_maskz_loadu_ps(tail_mask, b + tail_start);
+            c_vec = _mm512_maskz_loadu_ps(tail_mask, c + i * n + tail_start);
+        }
+        cb_j_vec = _mm512_fmadd_ps(b_vec, c_vec, cb_j_vec);
+        j += 16;
+        if (j < n) goto simsimd_bilinear_f32_skylake_cycle;
+        sum_vec = _mm512_fmadd_ps(a_vec, cb_j_vec, sum_vec);
+    }
+
+    *result = _mm512_reduce_add_ps(sum_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f32_skylake(simsimd_f32_t const *a, simsimd_f32_t const *b,
+                                                    simsimd_f32_t const *c, simsimd_size_t n,
+                                                    simsimd_distance_t *result) {
+    simsimd_size_t const tail_length = n % 16;
+    simsimd_size_t const tail_start = n - tail_length;
+    __m512 sum_vec = _mm512_setzero_ps();
+    __mmask16 const tail_mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, tail_length);
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m512 diff_i_vec = _mm512_set1_ps(a[i] - b[i]);
+        __m512 cdiff_j_vec = _mm512_setzero_ps(), cdiff_j_bot_vec = _mm512_setzero_ps();
+        __m512 a_j_vec, b_j_vec, diff_j_vec, c_vec;
+        simsimd_size_t j = 0;
+
+        // The nested loop is cleaner to implement with a `goto` in this case:
+    simsimd_bilinear_f32_skylake_cycle:
+        if (j + 16 <= n) {
+            a_j_vec = _mm512_loadu_ps(a + j);
+            b_j_vec = _mm512_loadu_ps(b + j);
+            c_vec = _mm512_loadu_ps(c + i * n + j);
+        }
+        else {
+            a_j_vec = _mm512_maskz_loadu_ps(tail_mask, a + tail_start);
+            b_j_vec = _mm512_maskz_loadu_ps(tail_mask, b + tail_start);
+            c_vec = _mm512_maskz_loadu_ps(tail_mask, c + i * n + tail_start);
+        }
+        diff_j_vec = _mm512_sub_ps(a_j_vec, b_j_vec);
+        cdiff_j_vec = _mm512_fmadd_ps(diff_j_vec, c_vec, cdiff_j_vec);
+        j += 16;
+        if (j < n) goto simsimd_bilinear_f32_skylake_cycle;
+        sum_vec = _mm512_fmadd_ps(diff_i_vec, cdiff_j_vec, sum_vec);
+    }
+
+    *result = _simsimd_sqrt_f64_haswell(_mm512_reduce_add_ps(sum_vec));
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f32c_skylake(simsimd_f32c_t const *a, simsimd_f32c_t const *b,
+                                                  simsimd_f32c_t const *c, simsimd_size_t n,
+                                                  simsimd_distance_t *results) {
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set1_epi64(0x8000000000000000);
+
+    // Default case for arbitrary size `n`
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    __mmask16 const tail_mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, tail_length * 2);
+    simsimd_f32_t sum_real = 0;
+    simsimd_f32_t sum_imag = 0;
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        simsimd_f32_t const a_i_real = a[i].real;
+        simsimd_f32_t const a_i_imag = a[i].imag;
+        __m512 cb_j_real_vec = _mm512_setzero_ps();
+        __m512 cb_j_imag_vec = _mm512_setzero_ps();
+        __m512 b_vec, c_vec;
+        simsimd_size_t j = 0;
+
+    simsimd_bilinear_f32c_skylake_cycle:
+        if (j + 8 <= n) {
+            b_vec = _mm512_loadu_ps((simsimd_f32_t const *)(b + j));
+            c_vec = _mm512_loadu_ps((simsimd_f32_t const *)(c + i * n + j));
+        }
+        else {
+            b_vec = _mm512_maskz_loadu_ps(tail_mask, (simsimd_f32_t const *)(b + tail_start));
+            c_vec = _mm512_maskz_loadu_ps(tail_mask, (simsimd_f32_t const *)(c + i * n + tail_start));
+        }
+        // The real part of the product: b.real * c.real - b.imag * c.imag.
+        // The subtraction will be performed later with a sign flip.
+        cb_j_real_vec = _mm512_fmadd_ps(c_vec, b_vec, cb_j_real_vec);
+        // The imaginary part of the product: b.real * c.imag + b.imag * c.real.
+        // Swap the imaginary and real parts of `c` before multiplication:
+        c_vec = _mm512_permute_ps(c_vec, 0xB1); //? Swap adjacent entries within each pair
+        cb_j_imag_vec = _mm512_fmadd_ps(c_vec, b_vec, cb_j_imag_vec);
+        j += 8;
+        if (j < n) goto simsimd_bilinear_f32c_skylake_cycle;
+        // Flip the sign bit in every second scalar before accumulation:
+        cb_j_real_vec = _mm512_castsi512_ps(_mm512_xor_si512(_mm512_castps_si512(cb_j_real_vec), sign_flip_vec));
+        // Horizontal sums are the expensive part of the computation:
+        simsimd_f32_t const cb_j_real = _mm512_reduce_add_ps(cb_j_real_vec);
+        simsimd_f32_t const cb_j_imag = _mm512_reduce_add_ps(cb_j_imag_vec);
+        sum_real += a_i_real * cb_j_real - a_i_imag * cb_j_imag;
+        sum_imag += a_i_real * cb_j_imag + a_i_imag * cb_j_real;
+    }
+
+    // Reduce horizontal sums:
+    results[0] = sum_real;
+    results[1] = sum_imag;
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f64_skylake_under8unrolled(simsimd_f64_t const *a, simsimd_f64_t const *b,
+                                                                simsimd_f64_t const *c, simsimd_size_t n,
+                                                                simsimd_distance_t *result) {
+
+    // The goal of this optimization is to avoid horizontal accumulation of the cb_j sums
+    // until the very end of the computation.
+    __mmask8 const row_mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, n);
+    __m512d const b_vec = _mm512_maskz_loadu_pd(row_mask, b);
+
+    __m512d cb_j1 = _mm512_setzero_pd();
+    __m512d cb_j2 = _mm512_setzero_pd();
+    __m512d cb_j3 = _mm512_setzero_pd();
+    __m512d cb_j4 = _mm512_setzero_pd();
+
+    // clang-format off
+    if (n > 0) cb_j1 = _mm512_fmadd_pd(_mm512_maskz_loadu_pd(row_mask, c + n * 0), _mm512_mul_pd(b_vec, _mm512_set1_pd(a[0])), cb_j1);
+    if (n > 1) cb_j2 = _mm512_fmadd_pd(_mm512_maskz_loadu_pd(row_mask, c + n * 1), _mm512_mul_pd(b_vec, _mm512_set1_pd(a[1])), cb_j2);
+    if (n > 2) cb_j3 = _mm512_fmadd_pd(_mm512_maskz_loadu_pd(row_mask, c + n * 2), _mm512_mul_pd(b_vec, _mm512_set1_pd(a[2])), cb_j3);
+    if (n > 3) cb_j4 = _mm512_fmadd_pd(_mm512_maskz_loadu_pd(row_mask, c + n * 3), _mm512_mul_pd(b_vec, _mm512_set1_pd(a[3])), cb_j4);
+
+    if (n > 4) cb_j1 = _mm512_fmadd_pd(_mm512_maskz_loadu_pd(row_mask, c + n * 4), _mm512_mul_pd(b_vec, _mm512_set1_pd(a[4])), cb_j1);
+    if (n > 5) cb_j2 = _mm512_fmadd_pd(_mm512_maskz_loadu_pd(row_mask, c + n * 5), _mm512_mul_pd(b_vec, _mm512_set1_pd(a[5])), cb_j2);
+    if (n > 6) cb_j3 = _mm512_fmadd_pd(_mm512_maskz_loadu_pd(row_mask, c + n * 6), _mm512_mul_pd(b_vec, _mm512_set1_pd(a[6])), cb_j3);
+    if (n > 7) cb_j4 = _mm512_fmadd_pd(_mm512_maskz_loadu_pd(row_mask, c + n * 7), _mm512_mul_pd(b_vec, _mm512_set1_pd(a[7])), cb_j4);
+    // clang-format on
+
+    // Combine cb_j sums
+    __m512d sum_vec = _mm512_add_pd( //
+        _mm512_add_pd(cb_j1, cb_j2), //
+        _mm512_add_pd(cb_j3, cb_j4));
+    *result = _mm512_reduce_add_pd(sum_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f64_skylake(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_f64_t const *c,
+                                                 simsimd_size_t n, simsimd_distance_t *result) {
+
+    // On modern x86 CPUs we have enough register space to load fairly large matrices with up to 16 cells
+    // per row and 8 rows at a time, still keeping enough register space for temporaries.
+    if (n <= 8) {
+        simsimd_bilinear_f64_skylake_under8unrolled(a, b, c, n, result);
+        return;
+    }
+
+    // Default case for arbitrary size `n`
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    __m512d sum_vec = _mm512_setzero_pd();
+    __mmask8 const tail_mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, tail_length);
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m512d a_vec = _mm512_set1_pd(a[i]);
+        __m512d cb_j_vec = _mm512_setzero_pd();
+        __m512d b_vec, c_vec;
+        simsimd_size_t j = 0;
+
+    simsimd_bilinear_f64_skylake_cycle:
+        if (j + 8 <= n) {
+            b_vec = _mm512_loadu_pd(b + j);
+            c_vec = _mm512_loadu_pd(c + i * n + j);
+        }
+        else {
+            b_vec = _mm512_maskz_loadu_pd(tail_mask, b + tail_start);
+            c_vec = _mm512_maskz_loadu_pd(tail_mask, c + i * n + tail_start);
+        }
+        cb_j_vec = _mm512_fmadd_pd(b_vec, c_vec, cb_j_vec);
+        j += 8;
+        if (j < n) goto simsimd_bilinear_f64_skylake_cycle;
+        sum_vec = _mm512_fmadd_pd(a_vec, cb_j_vec, sum_vec);
+    }
+
+    *result = _mm512_reduce_add_pd(sum_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f64_skylake(simsimd_f64_t const *a, simsimd_f64_t const *b,
+                                                    simsimd_f64_t const *c, simsimd_size_t n,
+                                                    simsimd_distance_t *result) {
+    simsimd_size_t const tail_length = n % 8;
+    simsimd_size_t const tail_start = n - tail_length;
+    __mmask8 const tail_mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, tail_length);
+    __m512d sum_vec = _mm512_setzero_pd();
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m512d diff_i_vec = _mm512_set1_pd(a[i] - b[i]);
+        __m512d cdiff_j_vec = _mm512_setzero_pd();
+        __m512d a_j_vec, b_j_vec, diff_j_vec, c_vec;
+        simsimd_size_t j = 0;
+
+        // The nested loop is cleaner to implement with a `goto` in this case:
+    simsimd_bilinear_f64_skylake_cycle:
+        if (j + 8 <= n) {
+            a_j_vec = _mm512_loadu_pd(a + j);
+            b_j_vec = _mm512_loadu_pd(b + j);
+            c_vec = _mm512_loadu_pd(c + i * n + j);
+        }
+        else {
+            a_j_vec = _mm512_maskz_loadu_pd(tail_mask, a + tail_start);
+            b_j_vec = _mm512_maskz_loadu_pd(tail_mask, b + tail_start);
+            c_vec = _mm512_maskz_loadu_pd(tail_mask, c + i * n + tail_start);
+        }
+        diff_j_vec = _mm512_sub_pd(a_j_vec, b_j_vec);
+        cdiff_j_vec = _mm512_fmadd_pd(diff_j_vec, c_vec, cdiff_j_vec);
+        j += 8;
+        if (j < n) goto simsimd_bilinear_f64_skylake_cycle;
+        sum_vec = _mm512_fmadd_pd(diff_i_vec, cdiff_j_vec, sum_vec);
+    }
+
+    *result = _simsimd_sqrt_f64_haswell(_mm512_reduce_add_pd(sum_vec));
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f64c_skylake(simsimd_f64c_t const *a, simsimd_f64c_t const *b,
+                                                  simsimd_f64c_t const *c, simsimd_size_t n,
+                                                  simsimd_distance_t *results) {
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set_epi64(                                     //
+        0x8000000000000000, 0x0000000000000000, 0x8000000000000000, 0x0000000000000000, //
+        0x8000000000000000, 0x0000000000000000, 0x8000000000000000, 0x0000000000000000  //
+    );
+
+    // Default case for arbitrary size `n`
+    simsimd_size_t const tail_length = n % 4;
+    simsimd_size_t const tail_start = n - tail_length;
+    __mmask8 const tail_mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, tail_length * 2);
+    simsimd_f64_t sum_real = 0;
+    simsimd_f64_t sum_imag = 0;
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        simsimd_f64_t const a_i_real = a[i].real;
+        simsimd_f64_t const a_i_imag = a[i].imag;
+        __m512d cb_j_real_vec = _mm512_setzero_pd();
+        __m512d cb_j_imag_vec = _mm512_setzero_pd();
+        __m512d b_vec, c_vec;
+        simsimd_size_t j = 0;
+
+    simsimd_bilinear_f64c_skylake_cycle:
+        if (j + 4 <= n) {
+            b_vec = _mm512_loadu_pd((simsimd_f64_t const *)(b + j));
+            c_vec = _mm512_loadu_pd((simsimd_f64_t const *)(c + i * n + j));
+        }
+        else {
+            b_vec = _mm512_maskz_loadu_pd(tail_mask, (simsimd_f64_t const *)(b + tail_start));
+            c_vec = _mm512_maskz_loadu_pd(tail_mask, (simsimd_f64_t const *)(c + i * n + tail_start));
+        }
+        // The real part of the product: b.real * c.real - b.imag * c.imag.
+        // The subtraction will be performed later with a sign flip.
+        cb_j_real_vec = _mm512_fmadd_pd(c_vec, b_vec, cb_j_real_vec);
+        // The imaginary part of the product: b.real * c.imag + b.imag * c.real.
+        // Swap the imaginary and real parts of `c` before multiplication:
+        c_vec = _mm512_permute_pd(c_vec, 0x55); //? Same as 0b01010101.
+        cb_j_imag_vec = _mm512_fmadd_pd(c_vec, b_vec, cb_j_imag_vec);
+        j += 4;
+        if (j < n) goto simsimd_bilinear_f64c_skylake_cycle;
+        // Flip the sign bit in every second scalar before accumulation:
+        cb_j_real_vec = _mm512_castsi512_pd(_mm512_xor_si512(_mm512_castpd_si512(cb_j_real_vec), sign_flip_vec));
+        // Horizontal sums are the expensive part of the computation:
+        simsimd_f64_t const cb_j_real = _mm512_reduce_add_pd(cb_j_real_vec);
+        simsimd_f64_t const cb_j_imag = _mm512_reduce_add_pd(cb_j_imag_vec);
+        sum_real += a_i_real * cb_j_real - a_i_imag * cb_j_imag;
+        sum_imag += a_i_real * cb_j_imag + a_i_imag * cb_j_real;
+    }
+
+    // Reduce horizontal sums:
+    results[0] = sum_real;
+    results[1] = sum_imag;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SKYLAKE
+
+#if SIMSIMD_TARGET_GENOA
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512bw", "avx512bf16")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512bw,avx512bf16"))), \
+                             apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16_genoa(simsimd_bf16_t const *a, simsimd_bf16_t const *b,
+                                                simsimd_bf16_t const *c, simsimd_size_t n, simsimd_distance_t *result) {
+    simsimd_size_t const tail_length = n % 32;
+    simsimd_size_t const tail_start = n - tail_length;
+    __mmask32 const tail_mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, tail_length);
+    __m512 sum_vec = _mm512_setzero_ps();
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m512 a_vec = _mm512_set1_ps(simsimd_bf16_to_f32(a + i));
+        __m512 cb_j_vec = _mm512_setzero_ps();
+        __m512i b_vec, c_vec;
+        simsimd_size_t j = 0;
+
+    simsimd_bilinear_bf16_genoa_cycle:
+        if (j + 32 <= n) {
+            b_vec = _mm512_loadu_epi16(b + j);
+            c_vec = _mm512_loadu_epi16(c + i * n + j);
+        }
+        else {
+            b_vec = _mm512_maskz_loadu_epi16(tail_mask, b + tail_start);
+            c_vec = _mm512_maskz_loadu_epi16(tail_mask, c + i * n + tail_start);
+        }
+        cb_j_vec = _mm512_dpbf16_ps(cb_j_vec, (__m512bh)(b_vec), (__m512bh)(c_vec));
+        j += 32;
+        if (j < n) goto simsimd_bilinear_bf16_genoa_cycle;
+        sum_vec = _mm512_fmadd_ps(a_vec, cb_j_vec, sum_vec);
+    }
+
+    *result = _mm512_reduce_add_ps(sum_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_mahalanobis_bf16_genoa(simsimd_bf16_t const *a, simsimd_bf16_t const *b,
+                                                   simsimd_bf16_t const *c, simsimd_size_t n,
+                                                   simsimd_distance_t *result) {
+    simsimd_size_t const tail_length = n % 32;
+    simsimd_size_t const tail_start = n - tail_length;
+    __mmask32 const tail_mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, tail_length);
+    __m512 sum_vec = _mm512_setzero_ps();
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m512 diff_i_vec = _mm512_set1_ps(simsimd_bf16_to_f32(a + i) - simsimd_bf16_to_f32(b + i));
+        __m512 cdiff_j_vec = _mm512_setzero_ps();
+        __m512i a_j_vec, b_j_vec, diff_j_vec, c_vec;
+        simsimd_size_t j = 0;
+
+        // The nested loop is cleaner to implement with a `goto` in this case:
+    simsimd_mahalanobis_bf16_genoa_cycle:
+        if (j + 32 <= n) {
+            a_j_vec = _mm512_loadu_epi16(a + j);
+            b_j_vec = _mm512_loadu_epi16(b + j);
+            c_vec = _mm512_loadu_epi16(c + i * n + j);
+        }
+        else {
+            a_j_vec = _mm512_maskz_loadu_epi16(tail_mask, a + tail_start);
+            b_j_vec = _mm512_maskz_loadu_epi16(tail_mask, b + tail_start);
+            c_vec = _mm512_maskz_loadu_epi16(tail_mask, c + i * n + tail_start);
+        }
+        diff_j_vec = _simsimd_substract_bf16x32_genoa(a_j_vec, b_j_vec);
+        cdiff_j_vec = _mm512_dpbf16_ps(cdiff_j_vec, (__m512bh)(diff_j_vec), (__m512bh)(c_vec));
+        j += 32;
+        if (j < n) goto simsimd_mahalanobis_bf16_genoa_cycle;
+        sum_vec = _mm512_fmadd_ps(diff_i_vec, cdiff_j_vec, sum_vec);
+    }
+
+    *result = _simsimd_sqrt_f32_haswell(_mm512_reduce_add_ps(sum_vec));
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16c_genoa(simsimd_bf16c_t const *a, simsimd_bf16c_t const *b,
+                                                 simsimd_bf16c_t const *c, simsimd_size_t n,
+                                                 simsimd_distance_t *results) {
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set1_epi32(0x80000000);
+    __m512i const swap_adjacent_vec = _mm512_set_epi8(                  //
+        61, 60, 63, 62, 57, 56, 59, 58, 53, 52, 55, 54, 49, 48, 51, 50, // 4th 128-bit lane
+        45, 44, 47, 46, 41, 40, 43, 42, 37, 36, 39, 38, 33, 32, 35, 34, // 3rd 128-bit lane
+        29, 28, 31, 30, 25, 24, 27, 26, 21, 20, 23, 22, 17, 16, 19, 18, // 2nd 128-bit lane
+        13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2            // 1st 128-bit lane
+    );
+
+    // Default case for arbitrary size `n`
+    simsimd_size_t const tail_length = n % 16;
+    simsimd_size_t const tail_start = n - tail_length;
+    __mmask32 const tail_mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, tail_length * 2);
+    simsimd_f64_t sum_real = 0;
+    simsimd_f64_t sum_imag = 0;
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        simsimd_f32_t const a_i_real = a[i].real;
+        simsimd_f32_t const a_i_imag = a[i].imag;
+        __m512 cb_j_real_vec = _mm512_setzero_ps();
+        __m512 cb_j_imag_vec = _mm512_setzero_ps();
+        __m512i b_vec, c_vec;
+        simsimd_size_t j = 0;
+
+    simsimd_bilinear_bf16c_skylake_cycle:
+        if (j + 16 <= n) {
+            b_vec = _mm512_loadu_epi16((simsimd_i16_t const *)(b + j));
+            c_vec = _mm512_loadu_epi16((simsimd_i16_t const *)(c + i * n + j));
+        }
+        else {
+            b_vec = _mm512_maskz_loadu_epi16(tail_mask, (simsimd_i16_t const *)(b + tail_start));
+            c_vec = _mm512_maskz_loadu_epi16(tail_mask, (simsimd_i16_t const *)(c + i * n + tail_start));
+        }
+        cb_j_real_vec = _mm512_dpbf16_ps(                       //
+            cb_j_real_vec,                                      //
+            (__m512bh)(_mm512_xor_si512(c_vec, sign_flip_vec)), //
+            (__m512bh)b_vec);
+        cb_j_imag_vec = _mm512_dpbf16_ps(                              //
+            cb_j_imag_vec,                                             //
+            (__m512bh)(_mm512_shuffle_epi8(c_vec, swap_adjacent_vec)), //
+            (__m512bh)b_vec);
+        j += 16;
+        if (j < n) goto simsimd_bilinear_bf16c_skylake_cycle;
+        // Horizontal sums are the expensive part of the computation:
+        simsimd_f64_t const cb_j_real = _simsimd_reduce_f32x16_skylake(cb_j_real_vec);
+        simsimd_f64_t const cb_j_imag = _simsimd_reduce_f32x16_skylake(cb_j_imag_vec);
+        sum_real += a_i_real * cb_j_real - a_i_imag * cb_j_imag;
+        sum_imag += a_i_real * cb_j_imag + a_i_imag * cb_j_real;
+    }
+
+    // Reduce horizontal sums:
+    results[0] = sum_real;
+    results[1] = sum_imag;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_GENOA
+
+#if SIMSIMD_TARGET_SAPPHIRE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512bw", "avx512fp16")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512bw,avx512fp16"))), \
+                             apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f16_sapphire_under32unrolled(simsimd_f16_t const *a, simsimd_f16_t const *b,
+                                                                  simsimd_f16_t const *c, simsimd_size_t const n,
+                                                                  simsimd_distance_t *result) {
+    // The goal of this optimization is to avoid horizontal accumulation of the cb_j sums
+    // until the very end of the computation.
+    __mmask32 const mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+    __m512h const b_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, b));
+
+    // Independently accumulate the partial sums into separate variables to avoid data-dependencies.
+    __m512h cb_j1 = _mm512_setzero_ph();
+    __m512h cb_j2 = _mm512_setzero_ph();
+    __m512h cb_j3 = _mm512_setzero_ph();
+    __m512h cb_j4 = _mm512_setzero_ph();
+
+    // Unroll the loop to process 4x ZMM registers at a time.
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        // If the code is compiled without native support for `_Float16`, we need a workaround
+        // to avoid implicit casts from out `simsimd_f16_t` to `_Float16`.
+        cb_j1 = _mm512_fmadd_ph(
+            _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, c + n * (i + 0))),
+            _mm512_mul_ph(b_vec, _mm512_castsi512_ph(_mm512_set1_epi16(((simsimd_i16_t const *)a)[i + 0]))), cb_j1);
+        cb_j2 = _mm512_fmadd_ph(
+            _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, c + n * (i + 1))),
+            _mm512_mul_ph(b_vec, _mm512_castsi512_ph(_mm512_set1_epi16(((simsimd_i16_t const *)a)[i + 1]))), cb_j2);
+        cb_j3 = _mm512_fmadd_ph(
+            _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, c + n * (i + 2))),
+            _mm512_mul_ph(b_vec, _mm512_castsi512_ph(_mm512_set1_epi16(((simsimd_i16_t const *)a)[i + 2]))), cb_j3);
+        cb_j4 = _mm512_fmadd_ph(
+            _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, c + n * (i + 3))),
+            _mm512_mul_ph(b_vec, _mm512_castsi512_ph(_mm512_set1_epi16(((simsimd_i16_t const *)a)[i + 3]))), cb_j4);
+    }
+
+    // Handle the tail of the loop:
+    if (i + 0 < n)
+        cb_j1 = _mm512_fmadd_ph(
+            _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, c + n * (i + 0))),
+            _mm512_mul_ph(b_vec, _mm512_castsi512_ph(_mm512_set1_epi16(((simsimd_i16_t const *)a)[i + 0]))), cb_j1);
+    if (i + 1 < n)
+        cb_j2 = _mm512_fmadd_ph(
+            _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, c + n * (i + 1))),
+            _mm512_mul_ph(b_vec, _mm512_castsi512_ph(_mm512_set1_epi16(((simsimd_i16_t const *)a)[i + 1]))), cb_j2);
+    if (i + 2 < n)
+        cb_j3 = _mm512_fmadd_ph(
+            _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, c + n * (i + 2))),
+            _mm512_mul_ph(b_vec, _mm512_castsi512_ph(_mm512_set1_epi16(((simsimd_i16_t const *)a)[i + 2]))), cb_j3);
+    if (i + 3 < n)
+        cb_j4 = _mm512_fmadd_ph(
+            _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, c + n * (i + 3))),
+            _mm512_mul_ph(b_vec, _mm512_castsi512_ph(_mm512_set1_epi16(((simsimd_i16_t const *)a)[i + 3]))), cb_j4);
+
+    // Combine cb_j sums
+    __m512h sum_vec = _mm512_add_ph( //
+        _mm512_add_ph(cb_j1, cb_j2), //
+        _mm512_add_ph(cb_j3, cb_j4));
+    *result = _mm512_reduce_add_ph(sum_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f16_sapphire(simsimd_f16_t const *a, simsimd_f16_t const *b,
+                                                  simsimd_f16_t const *c, simsimd_size_t n,
+                                                  simsimd_distance_t *result) {
+
+    // On modern x86 CPUs we have enough register space to load fairly large matrices with up to 32 cells
+    // per row and 32 rows at a time, still keeping enough register space for temporaries.
+    if (n <= 32) {
+        simsimd_bilinear_f16_sapphire_under32unrolled(a, b, c, n, result);
+        return;
+    }
+
+    simsimd_size_t const tail_length = n % 32;
+    simsimd_size_t const tail_start = n - tail_length;
+    __mmask32 const tail_mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, tail_length);
+    __m512h sum_vec = _mm512_setzero_ph();
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m512h a_vec = _mm512_castsi512_ph(_mm512_set1_epi16(*(short const *)(a + i)));
+        __m512h cb_j_vec = _mm512_setzero_ph();
+        __m512i b_vec, c_vec;
+        simsimd_size_t j = 0;
+
+    simsimd_bilinear_f16_sapphire_cycle:
+        if (j + 32 <= n) {
+            b_vec = _mm512_loadu_epi16(b + j);
+            c_vec = _mm512_loadu_epi16(c + i * n + j);
+        }
+        else {
+            b_vec = _mm512_maskz_loadu_epi16(tail_mask, b + tail_start);
+            c_vec = _mm512_maskz_loadu_epi16(tail_mask, c + i * n + tail_start);
+        }
+        cb_j_vec = _mm512_fmadd_ph(_mm512_castsi512_ph(b_vec), _mm512_castsi512_ph(c_vec), cb_j_vec);
+        j += 32;
+        if (j < n) goto simsimd_bilinear_f16_sapphire_cycle;
+        sum_vec = _mm512_fmadd_ph(a_vec, cb_j_vec, sum_vec);
+    }
+
+    *result = _mm512_reduce_add_ph(sum_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f16_sapphire(simsimd_f16_t const *a, simsimd_f16_t const *b,
+                                                     simsimd_f16_t const *c, simsimd_size_t n,
+                                                     simsimd_distance_t *result) {
+    simsimd_size_t const tail_length = n % 32;
+    simsimd_size_t const tail_start = n - tail_length;
+    __mmask32 const tail_mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, tail_length);
+    __m512h sum_vec = _mm512_setzero_ph();
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        __m512h a_i_vec = _mm512_castsi512_ph(_mm512_set1_epi16(*(short const *)(a + i)));
+        __m512h b_i_vec = _mm512_castsi512_ph(_mm512_set1_epi16(*(short const *)(b + i)));
+        __m512h diff_i_vec = _mm512_sub_ph(a_i_vec, b_i_vec);
+        __m512h cdiff_j_vec = _mm512_setzero_ph();
+        __m512h diff_j_vec;
+        __m512i a_j_vec, b_j_vec, c_vec;
+        simsimd_size_t j = 0;
+
+        // The nested loop is cleaner to implement with a `goto` in this case:
+    simsimd_mahalanobis_f16_sapphire_cycle:
+        if (j + 32 <= n) {
+            a_j_vec = _mm512_loadu_epi16(a + j);
+            b_j_vec = _mm512_loadu_epi16(b + j);
+            c_vec = _mm512_loadu_epi16(c + i * n + j);
+        }
+        else {
+            a_j_vec = _mm512_maskz_loadu_epi16(tail_mask, a + tail_start);
+            b_j_vec = _mm512_maskz_loadu_epi16(tail_mask, b + tail_start);
+            c_vec = _mm512_maskz_loadu_epi16(tail_mask, c + i * n + tail_start);
+        }
+        diff_j_vec = _mm512_sub_ph(_mm512_castsi512_ph(a_j_vec), _mm512_castsi512_ph(b_j_vec));
+        cdiff_j_vec = _mm512_fmadd_ph(diff_j_vec, _mm512_castsi512_ph(c_vec), cdiff_j_vec);
+        j += 32;
+        if (j < n) goto simsimd_mahalanobis_f16_sapphire_cycle;
+        sum_vec = _mm512_fmadd_ph(diff_i_vec, cdiff_j_vec, sum_vec);
+    }
+
+    *result = _simsimd_sqrt_f32_haswell(_mm512_reduce_add_ph(sum_vec));
+}
+
+SIMSIMD_PUBLIC void simsimd_bilinear_f16c_sapphire(simsimd_f16c_t const *a, simsimd_f16c_t const *b,
+                                                   simsimd_f16c_t const *c, simsimd_size_t n,
+                                                   simsimd_distance_t *results) {
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set1_epi32(0x80000000);
+    __m512i const swap_adjacent_vec = _mm512_set_epi8(                  //
+        61, 60, 63, 62, 57, 56, 59, 58, 53, 52, 55, 54, 49, 48, 51, 50, // 4th 128-bit lane
+        45, 44, 47, 46, 41, 40, 43, 42, 37, 36, 39, 38, 33, 32, 35, 34, // 3rd 128-bit lane
+        29, 28, 31, 30, 25, 24, 27, 26, 21, 20, 23, 22, 17, 16, 19, 18, // 2nd 128-bit lane
+        13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2            // 1st 128-bit lane
+    );
+
+    // Default case for arbitrary size `n`
+    simsimd_size_t const tail_length = n % 16;
+    simsimd_size_t const tail_start = n - tail_length;
+    __mmask32 const tail_mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, tail_length * 2);
+    simsimd_f32_t sum_real = 0;
+    simsimd_f32_t sum_imag = 0;
+
+    for (simsimd_size_t i = 0; i != n; ++i) {
+        simsimd_f32_t const a_i_real = a[i].real;
+        simsimd_f32_t const a_i_imag = a[i].imag;
+        __m512h cb_j_real_vec = _mm512_setzero_ph();
+        __m512h cb_j_imag_vec = _mm512_setzero_ph();
+        __m512i b_vec, c_vec;
+        simsimd_size_t j = 0;
+
+    simsimd_bilinear_f16c_skylake_cycle:
+        if (j + 16 <= n) {
+            b_vec = _mm512_loadu_epi16((simsimd_i16_t const *)(b + j));
+            c_vec = _mm512_loadu_epi16((simsimd_i16_t const *)(c + i * n + j));
+        }
+        else {
+            b_vec = _mm512_maskz_loadu_epi16(tail_mask, (simsimd_i16_t const *)(b + tail_start));
+            c_vec = _mm512_maskz_loadu_epi16(tail_mask, (simsimd_i16_t const *)(c + i * n + tail_start));
+        }
+        cb_j_real_vec = _mm512_fmadd_ph(                                 //
+            _mm512_castsi512_ph(_mm512_xor_si512(c_vec, sign_flip_vec)), //
+            _mm512_castsi512_ph(b_vec), cb_j_real_vec);
+        cb_j_imag_vec = _mm512_fmadd_ph(                                        //
+            _mm512_castsi512_ph(_mm512_shuffle_epi8(c_vec, swap_adjacent_vec)), //
+            _mm512_castsi512_ph(b_vec), cb_j_imag_vec);
+        j += 16;
+        if (j < n) goto simsimd_bilinear_f16c_skylake_cycle;
+        // Horizontal sums are the expensive part of the computation:
+        simsimd_f32_t const cb_j_real = _mm512_reduce_add_ph(cb_j_real_vec);
+        simsimd_f32_t const cb_j_imag = _mm512_reduce_add_ph(cb_j_imag_vec);
+        sum_real += a_i_real * cb_j_real - a_i_imag * cb_j_imag;
+        sum_imag += a_i_real * cb_j_imag + a_i_imag * cb_j_real;
+    }
+
+    // Reduce horizontal sums:
+    results[0] = sum_real;
+    results[1] = sum_imag;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SAPPHIRE
+#endif // _SIMSIMD_TARGET_X86
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/dot.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/dot.h
new file mode 100644
index 0000000000..5f38210392
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/dot.h
@@ -0,0 +1,1842 @@
+/**
+ *  @file       dot.h
+ *  @brief      SIMD-accelerated Dot Products for Real and Complex numbers.
+ *  @author     Ash Vardanian
+ *  @date       February 24, 2024
+ *
+ *  Contains:
+ *  - Dot Product for Real and Complex vectors
+ *  - Conjugate Dot Product for Complex vectors
+ *
+ *  For datatypes:
+ *  - 64-bit IEEE floating point numbers
+ *  - 32-bit IEEE floating point numbers
+ *  - 16-bit IEEE floating point numbers
+ *  - 16-bit brain floating point numbers
+ *  - 8-bit unsigned integers
+ *  - 8-bit signed integers
+ *
+ *  For hardware architectures:
+ *  - Arm: NEON, SVE
+ *  - x86: Haswell, Ice Lake, Skylake, Genoa, Sapphire
+ *
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide/
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics/
+ */
+#ifndef SIMSIMD_DOT_H
+#define SIMSIMD_DOT_H
+
+#include "types.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// clang-format off
+
+/*  Serial backends for all numeric types.
+ *  By default they use 32-bit arithmetic, unless the arguments themselves contain 64-bit floats.
+ *  For double-precision computation check out the "*_accurate" variants of those "*_serial" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_dot_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f64c_serial(simsimd_f64c_t const* a, simsimd_f64c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f64c_serial(simsimd_f64c_t const* a, simsimd_f64c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f32c_serial(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_serial(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f16c_serial(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_serial(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_bf16c_serial(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_bf16c_serial(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_i8_serial(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_u8_serial(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+
+/*  Double-precision serial backends for all numeric types.
+ *  For single-precision computation check out the "*_serial" counterparts of those "*_accurate" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_dot_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f32c_accurate(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_accurate(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f16c_accurate(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_accurate(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16_accurate(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_bf16c_accurate(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_bf16c_accurate(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+/*  SIMD-powered backends for Arm NEON, mostly using 32-bit arithmetic over 128-bit words.
+ *  By far the most portable backend, covering most Arm v8 devices, over a billion phones, and almost all
+ *  server CPUs produced before 2023.
+ */
+SIMSIMD_PUBLIC void simsimd_dot_f32_neon(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f32c_neon(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_neon(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_neon(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f16c_neon(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_neon(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_i8_neon(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_u8_neon(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16_neon(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_bf16c_neon(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_bf16c_neon(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+/*  SIMD-powered backends for Arm SVE, mostly using 32-bit arithmetic over variable-length platform-defined word sizes.
+ *  Designed for Arm Graviton 3, Microsoft Cobalt, as well as Nvidia Grace and newer Ampere Altra CPUs.
+ */
+SIMSIMD_PUBLIC void simsimd_dot_f32_sve(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f32c_sve(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_sve(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_sve(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f16c_sve(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_sve(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_f64_sve(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f64c_sve(simsimd_f64c_t const* a, simsimd_f64c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f64c_sve(simsimd_f64c_t const* a, simsimd_f64c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+/*  SIMD-powered backends for AVX2 CPUs of Haswell generation and newer, using 32-bit arithmetic over 256-bit words.
+ *  First demonstrated in 2011, at least one Haswell-based processor was still being sold in 2022 — the Pentium G3420.
+ *  Practically all modern x86 CPUs support AVX2, FMA, and F16C, making it a perfect baseline for SIMD algorithms.
+ *  On other hand, there is no need to implement AVX2 versions of `f32` and `f64` functions, as those are
+ *  properly vectorized by recent compilers.
+ */
+SIMSIMD_PUBLIC void simsimd_dot_f32_haswell(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f32c_haswell(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_haswell(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_haswell(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f16c_haswell(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_haswell(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16_haswell(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+
+SIMSIMD_PUBLIC void simsimd_dot_i8_haswell(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_u8_haswell(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+
+/*  SIMD-powered backends for various generations of AVX512 CPUs.
+ *  Skylake is handy, as it supports masked loads and other operations, avoiding the need for the tail loop.
+ *  Ice Lake added VNNI, VPOPCNTDQ, IFMA, VBMI, VAES, GFNI, VBMI2, BITALG, VPCLMULQDQ, and other extensions for integral operations.
+ *  Genoa added only BF16.
+ *  Sapphire Rapids added tiled matrix operations, but we are most interested in the new mixed-precision FMA instructions.
+ */
+SIMSIMD_PUBLIC void simsimd_dot_f64_skylake(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f64c_skylake(simsimd_f64c_t const* a, simsimd_f64c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f64c_skylake(simsimd_f64c_t const* a, simsimd_f64c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_f32_skylake(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f32c_skylake(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_skylake(simsimd_f32c_t const* a, simsimd_f32c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_i8_ice(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_u8_ice(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16_genoa(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_bf16c_genoa(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_bf16c_genoa(simsimd_bf16c_t const* a, simsimd_bf16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_sapphire(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_dot_f16c_sapphire(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_sapphire(simsimd_f16c_t const* a, simsimd_f16c_t const* b, simsimd_size_t n, simsimd_distance_t* results);
+
+SIMSIMD_PUBLIC void simsimd_dot_i8_sierra(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* result);
+// clang-format on
+
+#define SIMSIMD_MAKE_DOT(name, input_type, accumulator_type, load_and_convert)                                 \
+    SIMSIMD_PUBLIC void simsimd_dot_##input_type##_##name(simsimd_##input_type##_t const *a,                   \
+                                                          simsimd_##input_type##_t const *b, simsimd_size_t n, \
+                                                          simsimd_distance_t *result) {                        \
+        simsimd_##accumulator_type##_t ab = 0;                                                                 \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                              \
+            simsimd_##accumulator_type##_t ai = load_and_convert(a + i);                                       \
+            simsimd_##accumulator_type##_t bi = load_and_convert(b + i);                                       \
+            ab += ai * bi;                                                                                     \
+        }                                                                                                      \
+        *result = ab;                                                                                          \
+    }
+
+#define SIMSIMD_MAKE_COMPLEX_DOT(name, input_type, accumulator_type, load_and_convert)                               \
+    SIMSIMD_PUBLIC void simsimd_dot_##input_type##_##name(simsimd_##input_type##_t const *a_pairs,                   \
+                                                          simsimd_##input_type##_t const *b_pairs,                   \
+                                                          simsimd_size_t count_pairs, simsimd_distance_t *results) { \
+        simsimd_##accumulator_type##_t ab_real = 0, ab_imag = 0;                                                     \
+        for (simsimd_size_t i = 0; i != count_pairs; ++i) {                                                          \
+            simsimd_##accumulator_type##_t ar = load_and_convert(&(a_pairs + i)->real);                              \
+            simsimd_##accumulator_type##_t br = load_and_convert(&(b_pairs + i)->real);                              \
+            simsimd_##accumulator_type##_t ai = load_and_convert(&(a_pairs + i)->imag);                              \
+            simsimd_##accumulator_type##_t bi = load_and_convert(&(b_pairs + i)->imag);                              \
+            ab_real += ar * br - ai * bi;                                                                            \
+            ab_imag += ar * bi + ai * br;                                                                            \
+        }                                                                                                            \
+        results[0] = ab_real;                                                                                        \
+        results[1] = ab_imag;                                                                                        \
+    }
+
+#define SIMSIMD_MAKE_COMPLEX_VDOT(name, input_type, accumulator_type, load_and_convert)                               \
+    SIMSIMD_PUBLIC void simsimd_vdot_##input_type##_##name(simsimd_##input_type##_t const *a_pairs,                   \
+                                                           simsimd_##input_type##_t const *b_pairs,                   \
+                                                           simsimd_size_t count_pairs, simsimd_distance_t *results) { \
+        simsimd_##accumulator_type##_t ab_real = 0, ab_imag = 0;                                                      \
+        for (simsimd_size_t i = 0; i != count_pairs; ++i) {                                                           \
+            simsimd_##accumulator_type##_t ar = load_and_convert(&(a_pairs + i)->real);                               \
+            simsimd_##accumulator_type##_t br = load_and_convert(&(b_pairs + i)->real);                               \
+            simsimd_##accumulator_type##_t ai = load_and_convert(&(a_pairs + i)->imag);                               \
+            simsimd_##accumulator_type##_t bi = load_and_convert(&(b_pairs + i)->imag);                               \
+            ab_real += ar * br + ai * bi;                                                                             \
+            ab_imag += ar * bi - ai * br;                                                                             \
+        }                                                                                                             \
+        results[0] = ab_real;                                                                                         \
+        results[1] = ab_imag;                                                                                         \
+    }
+
+SIMSIMD_MAKE_DOT(serial, f64, f64, SIMSIMD_DEREFERENCE)           // simsimd_dot_f64_serial
+SIMSIMD_MAKE_COMPLEX_DOT(serial, f64c, f64, SIMSIMD_DEREFERENCE)  // simsimd_dot_f64c_serial
+SIMSIMD_MAKE_COMPLEX_VDOT(serial, f64c, f64, SIMSIMD_DEREFERENCE) // simsimd_vdot_f64c_serial
+
+SIMSIMD_MAKE_DOT(serial, f32, f32, SIMSIMD_DEREFERENCE)           // simsimd_dot_f32_serial
+SIMSIMD_MAKE_COMPLEX_DOT(serial, f32c, f32, SIMSIMD_DEREFERENCE)  // simsimd_dot_f32c_serial
+SIMSIMD_MAKE_COMPLEX_VDOT(serial, f32c, f32, SIMSIMD_DEREFERENCE) // simsimd_vdot_f32c_serial
+
+SIMSIMD_MAKE_DOT(serial, f16, f32, SIMSIMD_F16_TO_F32)           // simsimd_dot_f16_serial
+SIMSIMD_MAKE_COMPLEX_DOT(serial, f16c, f32, SIMSIMD_F16_TO_F32)  // simsimd_dot_f16c_serial
+SIMSIMD_MAKE_COMPLEX_VDOT(serial, f16c, f32, SIMSIMD_F16_TO_F32) // simsimd_vdot_f16c_serial
+
+SIMSIMD_MAKE_DOT(serial, bf16, f32, SIMSIMD_BF16_TO_F32)           // simsimd_dot_bf16_serial
+SIMSIMD_MAKE_COMPLEX_DOT(serial, bf16c, f32, SIMSIMD_BF16_TO_F32)  // simsimd_dot_bf16c_serial
+SIMSIMD_MAKE_COMPLEX_VDOT(serial, bf16c, f32, SIMSIMD_BF16_TO_F32) // simsimd_vdot_bf16c_serial
+
+SIMSIMD_MAKE_DOT(serial, i8, i64, SIMSIMD_DEREFERENCE) // simsimd_dot_i8_serial
+SIMSIMD_MAKE_DOT(serial, u8, i64, SIMSIMD_DEREFERENCE) // simsimd_dot_u8_serial
+
+SIMSIMD_MAKE_DOT(accurate, f32, f64, SIMSIMD_DEREFERENCE)           // simsimd_dot_f32_accurate
+SIMSIMD_MAKE_COMPLEX_DOT(accurate, f32c, f64, SIMSIMD_DEREFERENCE)  // simsimd_dot_f32c_accurate
+SIMSIMD_MAKE_COMPLEX_VDOT(accurate, f32c, f64, SIMSIMD_DEREFERENCE) // simsimd_vdot_f32c_accurate
+
+SIMSIMD_MAKE_DOT(accurate, f16, f64, SIMSIMD_F16_TO_F32)           // simsimd_dot_f16_accurate
+SIMSIMD_MAKE_COMPLEX_DOT(accurate, f16c, f64, SIMSIMD_F16_TO_F32)  // simsimd_dot_f16c_accurate
+SIMSIMD_MAKE_COMPLEX_VDOT(accurate, f16c, f64, SIMSIMD_F16_TO_F32) // simsimd_vdot_f16c_accurate
+
+SIMSIMD_MAKE_DOT(accurate, bf16, f64, SIMSIMD_BF16_TO_F32)           // simsimd_dot_bf16_accurate
+SIMSIMD_MAKE_COMPLEX_DOT(accurate, bf16c, f64, SIMSIMD_BF16_TO_F32)  // simsimd_dot_bf16c_accurate
+SIMSIMD_MAKE_COMPLEX_VDOT(accurate, bf16c, f64, SIMSIMD_BF16_TO_F32) // simsimd_vdot_bf16c_accurate
+
+#if _SIMSIMD_TARGET_ARM
+#if SIMSIMD_TARGET_NEON
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd"))), apply_to = function)
+
+SIMSIMD_INTERNAL float32x4_t _simsimd_partial_load_f32x4_neon(simsimd_f32_t const *x, simsimd_size_t n) {
+    union {
+        float32x4_t vec;
+        simsimd_f32_t scalars[4];
+    } result;
+    simsimd_size_t i = 0;
+    for (; i < n; ++i) result.scalars[i] = x[i];
+    for (; i < 4; ++i) result.scalars[i] = 0;
+    return result.vec;
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f32_neon(simsimd_f32_t const *a_scalars, simsimd_f32_t const *b_scalars,
+                                         simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    float32x4_t ab_vec = vdupq_n_f32(0);
+    simsimd_size_t idx_scalars = 0;
+    for (; idx_scalars + 4 <= count_scalars; idx_scalars += 4) {
+        float32x4_t a_vec = vld1q_f32(a_scalars + idx_scalars);
+        float32x4_t b_vec = vld1q_f32(b_scalars + idx_scalars);
+        ab_vec = vfmaq_f32(ab_vec, a_vec, b_vec);
+    }
+    simsimd_f32_t ab = vaddvq_f32(ab_vec);
+    for (; idx_scalars < count_scalars; ++idx_scalars) ab += a_scalars[idx_scalars] * b_scalars[idx_scalars];
+    *result = ab;
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f32c_neon(simsimd_f32c_t const *a_pairs, simsimd_f32c_t const *b_pairs,
+                                          simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    float32x4_t ab_real_vec = vdupq_n_f32(0);
+    float32x4_t ab_imag_vec = vdupq_n_f32(0);
+    simsimd_size_t idx_pairs = 0;
+    for (; idx_pairs + 4 <= count_pairs; idx_pairs += 4) {
+        // Unpack the input arrays into real and imaginary parts:
+        float32x4x2_t a_vec = vld2q_f32((simsimd_f32_t const *)(a_pairs + idx_pairs));
+        float32x4x2_t b_vec = vld2q_f32((simsimd_f32_t const *)(b_pairs + idx_pairs));
+        float32x4_t a_real_vec = a_vec.val[0];
+        float32x4_t a_imag_vec = a_vec.val[1];
+        float32x4_t b_real_vec = b_vec.val[0];
+        float32x4_t b_imag_vec = b_vec.val[1];
+
+        // Compute the dot product:
+        ab_real_vec = vfmaq_f32(ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = vfmsq_f32(ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = vfmaq_f32(ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = vfmaq_f32(ab_imag_vec, a_imag_vec, b_real_vec);
+    }
+
+    // Reduce horizontal sums:
+    simsimd_f32_t ab_real = vaddvq_f32(ab_real_vec);
+    simsimd_f32_t ab_imag = vaddvq_f32(ab_imag_vec);
+
+    // Handle the tail:
+    for (; idx_pairs != count_pairs; ++idx_pairs) {
+        simsimd_f32c_t a_pair = a_pairs[idx_pairs], b_pair = b_pairs[idx_pairs];
+        simsimd_f32_t ar = a_pair.real, ai = a_pair.imag, br = b_pair.real, bi = b_pair.imag;
+        ab_real += ar * br - ai * bi;
+        ab_imag += ar * bi + ai * br;
+    }
+    results[0] = ab_real;
+    results[1] = ab_imag;
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_neon(simsimd_f32c_t const *a_pairs, simsimd_f32c_t const *b_pairs,
+                                           simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    float32x4_t ab_real_vec = vdupq_n_f32(0);
+    float32x4_t ab_imag_vec = vdupq_n_f32(0);
+    simsimd_size_t idx_pairs = 0;
+    for (; idx_pairs + 4 <= count_pairs; idx_pairs += 4) {
+        // Unpack the input arrays into real and imaginary parts:
+        float32x4x2_t a_vec = vld2q_f32((simsimd_f32_t const *)(a_pairs + idx_pairs));
+        float32x4x2_t b_vec = vld2q_f32((simsimd_f32_t const *)(b_pairs + idx_pairs));
+        float32x4_t a_real_vec = a_vec.val[0];
+        float32x4_t a_imag_vec = a_vec.val[1];
+        float32x4_t b_real_vec = b_vec.val[0];
+        float32x4_t b_imag_vec = b_vec.val[1];
+
+        // Compute the dot product:
+        ab_real_vec = vfmaq_f32(ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = vfmaq_f32(ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = vfmaq_f32(ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = vfmsq_f32(ab_imag_vec, a_imag_vec, b_real_vec);
+    }
+
+    // Reduce horizontal sums:
+    simsimd_f32_t ab_real = vaddvq_f32(ab_real_vec);
+    simsimd_f32_t ab_imag = vaddvq_f32(ab_imag_vec);
+
+    // Handle the tail:
+    for (; idx_pairs != count_pairs; ++idx_pairs) {
+        simsimd_f32c_t a_pair = a_pairs[idx_pairs], b_pair = b_pairs[idx_pairs];
+        simsimd_f32_t ar = a_pair.real, ai = a_pair.imag, br = b_pair.real, bi = b_pair.imag;
+        ab_real += ar * br + ai * bi;
+        ab_imag += ar * bi - ai * br;
+    }
+    results[0] = ab_real;
+    results[1] = ab_imag;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON
+
+#if SIMSIMD_TARGET_NEON_I8
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+dotprod")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+dotprod"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_dot_i8_neon(simsimd_i8_t const *a_scalars, simsimd_i8_t const *b_scalars,
+                                        simsimd_size_t count_scalars, simsimd_distance_t *result) {
+
+    int32x4_t ab_vec = vdupq_n_s32(0);
+    simsimd_size_t idx_scalars = 0;
+
+    // If the 128-bit `vdot_s32` intrinsic is unavailable, we can use the 64-bit `vdot_s32`.
+    // for (simsimd_size_t idx_scalars = 0; idx_scalars != n; idx_scalars += 8) {
+    //     int16x8_t a_vec = vmovl_s8(vld1_s8(a_scalars + idx_scalars));
+    //     int16x8_t b_vec = vmovl_s8(vld1_s8(b_scalars + idx_scalars));
+    //     int16x8_t ab_part_vec = vmulq_s16(a_vec, b_vec);
+    //     ab_vec = vaddq_s32(ab_vec, vaddq_s32(vmovl_s16(vget_high_s16(ab_part_vec)), //
+    //                                          vmovl_s16(vget_low_s16(ab_part_vec))));
+    // }
+    for (; idx_scalars + 16 <= count_scalars; idx_scalars += 16) {
+        int8x16_t a_vec = vld1q_s8(a_scalars + idx_scalars);
+        int8x16_t b_vec = vld1q_s8(b_scalars + idx_scalars);
+        ab_vec = vdotq_s32(ab_vec, a_vec, b_vec);
+    }
+
+    // Take care of the tail:
+    simsimd_i32_t ab = vaddvq_s32(ab_vec);
+    for (; idx_scalars < count_scalars; ++idx_scalars) {
+        simsimd_i32_t ai = a_scalars[idx_scalars], bi = b_scalars[idx_scalars];
+        ab += ai * bi;
+    }
+
+    *result = ab;
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_u8_neon(simsimd_u8_t const *a_scalars, simsimd_u8_t const *b_scalars,
+                                        simsimd_size_t count_scalars, simsimd_distance_t *result) {
+
+    uint32x4_t ab_vec = vdupq_n_u32(0);
+    simsimd_size_t idx_scalars = 0;
+    for (; idx_scalars + 16 <= count_scalars; idx_scalars += 16) {
+        uint8x16_t a_vec = vld1q_u8(a_scalars + idx_scalars);
+        uint8x16_t b_vec = vld1q_u8(b_scalars + idx_scalars);
+        ab_vec = vdotq_u32(ab_vec, a_vec, b_vec);
+    }
+
+    // Take care of the tail:
+    simsimd_u32_t ab = vaddvq_u32(ab_vec);
+    for (; idx_scalars < count_scalars; ++idx_scalars) {
+        simsimd_u32_t ai = a_scalars[idx_scalars], bi = b_scalars[idx_scalars];
+        ab += ai * bi;
+    }
+
+    *result = ab;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_I8
+
+#if SIMSIMD_TARGET_NEON_F16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd+fp16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd+fp16"))), apply_to = function)
+
+SIMSIMD_INTERNAL float16x4_t _simsimd_partial_load_f16x4_neon(simsimd_f16_t const *x, simsimd_size_t n) {
+    // In case the software emulation for `f16` scalars is enabled, the `simsimd_f16_to_f32`
+    // function will run. It is extremely slow, so even for the tail, let's combine serial
+    // loads and stores with vectorized math.
+    union {
+        float16x4_t vec;
+        simsimd_f16_t scalars[4];
+    } result;
+    simsimd_size_t i = 0;
+    for (; i < n; ++i) result.scalars[i] = x[i];
+    for (; i < 4; ++i) result.scalars[i] = 0;
+    return result.vec;
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_neon(simsimd_f16_t const *a_scalars, simsimd_f16_t const *b_scalars,
+                                         simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    float32x4_t a_vec, b_vec;
+    float32x4_t ab_vec = vdupq_n_f32(0);
+
+simsimd_dot_f16_neon_cycle:
+    if (count_scalars < 4) {
+        a_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(a_scalars, count_scalars));
+        b_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(b_scalars, count_scalars));
+        count_scalars = 0;
+    }
+    else {
+        a_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)a_scalars));
+        b_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)b_scalars));
+        a_scalars += 4, b_scalars += 4, count_scalars -= 4;
+    }
+    ab_vec = vfmaq_f32(ab_vec, a_vec, b_vec);
+    if (count_scalars) goto simsimd_dot_f16_neon_cycle;
+    *result = vaddvq_f32(ab_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f16c_neon(simsimd_f16c_t const *a_pairs, simsimd_f16c_t const *b_pairs,
+                                          simsimd_size_t count_pairs, simsimd_distance_t *results) {
+
+    // A nicer approach is to use `f16` arithmetic for the dot product, but that requires
+    // FMLA extensions available on Arm v8.3 and later. That we can also process 16 entries
+    // at once. That's how the original implementation worked, but compiling it was a nightmare :)
+    float32x4_t ab_real_vec = vdupq_n_f32(0);
+    float32x4_t ab_imag_vec = vdupq_n_f32(0);
+
+    while (count_pairs >= 4) {
+        // Unpack the input arrays into real and imaginary parts.
+        // MSVC sadly doesn't recognize the `vld2_f16`, so we load the  data as signed
+        // integers of the same size and reinterpret with `vreinterpret_f16_s16` afterwards.
+        int16x4x2_t a_vec = vld2_s16((short *)a_pairs);
+        int16x4x2_t b_vec = vld2_s16((short *)b_pairs);
+        float32x4_t a_real_vec = vcvt_f32_f16(vreinterpret_f16_s16(a_vec.val[0]));
+        float32x4_t a_imag_vec = vcvt_f32_f16(vreinterpret_f16_s16(a_vec.val[1]));
+        float32x4_t b_real_vec = vcvt_f32_f16(vreinterpret_f16_s16(b_vec.val[0]));
+        float32x4_t b_imag_vec = vcvt_f32_f16(vreinterpret_f16_s16(b_vec.val[1]));
+
+        // Compute the dot product:
+        ab_real_vec = vfmaq_f32(ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = vfmsq_f32(ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = vfmaq_f32(ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = vfmaq_f32(ab_imag_vec, a_imag_vec, b_real_vec);
+
+        count_pairs -= 4, a_pairs += 4, b_pairs += 4;
+    }
+
+    // Reduce horizontal sums and aggregate with the tail:
+    simsimd_dot_f16c_serial(a_pairs, b_pairs, count_pairs, results);
+    results[0] += vaddvq_f32(ab_real_vec);
+    results[1] += vaddvq_f32(ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_neon(simsimd_f16c_t const *a_pairs, simsimd_f16c_t const *b_pairs,
+                                           simsimd_size_t count_pairs, simsimd_distance_t *results) {
+
+    // A nicer approach is to use `f16` arithmetic for the dot product, but that requires
+    // FMLA extensions available on Arm v8.3 and later. That we can also process 16 entries
+    // at once. That's how the original implementation worked, but compiling it was a nightmare :)
+    float32x4_t ab_real_vec = vdupq_n_f32(0);
+    float32x4_t ab_imag_vec = vdupq_n_f32(0);
+
+    while (count_pairs >= 4) {
+        // Unpack the input arrays into real and imaginary parts.
+        // MSVC sadly doesn't recognize the `vld2_f16`, so we load the  data as signed
+        // integers of the same size and reinterpret with `vreinterpret_f16_s16` afterwards.
+        int16x4x2_t a_vec = vld2_s16((short *)a_pairs);
+        int16x4x2_t b_vec = vld2_s16((short *)b_pairs);
+        float32x4_t a_real_vec = vcvt_f32_f16(vreinterpret_f16_s16(a_vec.val[0]));
+        float32x4_t a_imag_vec = vcvt_f32_f16(vreinterpret_f16_s16(a_vec.val[1]));
+        float32x4_t b_real_vec = vcvt_f32_f16(vreinterpret_f16_s16(b_vec.val[0]));
+        float32x4_t b_imag_vec = vcvt_f32_f16(vreinterpret_f16_s16(b_vec.val[1]));
+
+        // Compute the dot product:
+        ab_real_vec = vfmaq_f32(ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = vfmaq_f32(ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = vfmaq_f32(ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = vfmsq_f32(ab_imag_vec, a_imag_vec, b_real_vec);
+
+        count_pairs -= 4, a_pairs += 4, b_pairs += 4;
+    }
+
+    // Reduce horizontal sums and aggregate with the tail:
+    simsimd_vdot_f16c_serial(a_pairs, b_pairs, count_pairs, results);
+    results[0] += vaddvq_f32(ab_real_vec);
+    results[1] += vaddvq_f32(ab_imag_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_F16
+
+#if SIMSIMD_TARGET_NEON_BF16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.6-a+simd+bf16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.6-a+simd+bf16"))), apply_to = function)
+
+SIMSIMD_INTERNAL bfloat16x8_t _simsimd_partial_load_bf16x8_neon(simsimd_bf16_t const *x, simsimd_size_t n) {
+    union {
+        bfloat16x8_t vec;
+        simsimd_bf16_t scalars[8];
+    } result;
+    simsimd_size_t i = 0;
+    for (; i < n; ++i) result.scalars[i] = x[i];
+    for (; i < 8; ++i) result.scalars[i] = 0;
+    return result.vec;
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16_neon(simsimd_bf16_t const *a_scalars, simsimd_bf16_t const *b_scalars,
+                                          simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    bfloat16x8_t a_vec, b_vec;
+    float32x4_t ab_vec = vdupq_n_f32(0);
+
+simsimd_dot_bf16_neon_cycle:
+    if (count_scalars < 4) {
+        a_vec = _simsimd_partial_load_bf16x8_neon(a_scalars, count_scalars);
+        b_vec = _simsimd_partial_load_bf16x8_neon(b_scalars, count_scalars);
+        count_scalars = 0;
+    }
+    else {
+        a_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)a_scalars);
+        b_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)b_scalars);
+        a_scalars += 4, b_scalars += 4, count_scalars -= 4;
+    }
+    ab_vec = vbfdotq_f32(ab_vec, a_vec, b_vec);
+    if (count_scalars) goto simsimd_dot_bf16_neon_cycle;
+
+    *result = vaddvq_f32(ab_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16c_neon(simsimd_bf16c_t const *a_pairs, simsimd_bf16c_t const *b_pairs,
+                                           simsimd_size_t count_pairs, simsimd_distance_t *results) {
+
+    // A nicer approach is to use `bf16` arithmetic for the dot product, but that requires
+    // FMLA extensions available on Arm v8.3 and later. That we can also process 16 entries
+    // at once. That's how the original implementation worked, but compiling it was a nightmare :)
+    float32x4_t ab_real_vec = vdupq_n_f32(0);
+    float32x4_t ab_imag_vec = vdupq_n_f32(0);
+
+    while (count_pairs >= 4) {
+        // Unpack the input arrays into real and imaginary parts.
+        // MSVC sadly doesn't recognize the `vld2_bf16`, so we load the  data as signed
+        // integers of the same size and reinterpret with `vreinterpret_bf16_s16` afterwards.
+        int16x4x2_t a_vec = vld2_s16((short const *)a_pairs);
+        int16x4x2_t b_vec = vld2_s16((short const *)b_pairs);
+        float32x4_t a_real_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(a_vec.val[0]));
+        float32x4_t a_imag_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(a_vec.val[1]));
+        float32x4_t b_real_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(b_vec.val[0]));
+        float32x4_t b_imag_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(b_vec.val[1]));
+
+        // Compute the dot product:
+        ab_real_vec = vfmaq_f32(ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = vfmsq_f32(ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = vfmaq_f32(ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = vfmaq_f32(ab_imag_vec, a_imag_vec, b_real_vec);
+
+        count_pairs -= 4, a_pairs += 4, b_pairs += 4;
+    }
+
+    // Reduce horizontal sums and aggregate with the tail:
+    simsimd_dot_bf16c_serial(a_pairs, b_pairs, count_pairs, results);
+    results[0] += vaddvq_f32(ab_real_vec);
+    results[1] += vaddvq_f32(ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_bf16c_neon(simsimd_bf16c_t const *a_pairs, simsimd_bf16c_t const *b_pairs,
+                                            simsimd_size_t count_pairs, simsimd_distance_t *results) {
+
+    // A nicer approach is to use `bf16` arithmetic for the dot product, but that requires
+    // FMLA extensions available on Arm v8.3 and later. That we can also process 16 entries
+    // at once. That's how the original implementation worked, but compiling it was a nightmare :)
+    float32x4_t ab_real_vec = vdupq_n_f32(0);
+    float32x4_t ab_imag_vec = vdupq_n_f32(0);
+
+    while (count_pairs >= 4) {
+        // Unpack the input arrays into real and imaginary parts.
+        // MSVC sadly doesn't recognize the `vld2_bf16`, so we load the  data as signed
+        // integers of the same size and reinterpret with `vreinterpret_bf16_s16` afterwards.
+        int16x4x2_t a_vec = vld2_s16((short const *)a_pairs);
+        int16x4x2_t b_vec = vld2_s16((short const *)b_pairs);
+        float32x4_t a_real_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(a_vec.val[0]));
+        float32x4_t a_imag_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(a_vec.val[1]));
+        float32x4_t b_real_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(b_vec.val[0]));
+        float32x4_t b_imag_vec = vcvt_f32_bf16(vreinterpret_bf16_s16(b_vec.val[1]));
+
+        // Compute the dot product:
+        ab_real_vec = vfmaq_f32(ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = vfmaq_f32(ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = vfmaq_f32(ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = vfmsq_f32(ab_imag_vec, a_imag_vec, b_real_vec);
+
+        count_pairs -= 4, a_pairs += 4, b_pairs += 4;
+    }
+
+    // Reduce horizontal sums and aggregate with the tail:
+    simsimd_vdot_bf16c_serial(a_pairs, b_pairs, count_pairs, results);
+    results[0] += vaddvq_f32(ab_real_vec);
+    results[1] += vaddvq_f32(ab_imag_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_BF16
+
+#if SIMSIMD_TARGET_SVE
+
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+sve")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+sve"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_dot_f32_sve(simsimd_f32_t const *a_scalars, simsimd_f32_t const *b_scalars,
+                                        simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    simsimd_size_t idx_scalars = 0;
+    svfloat32_t ab_vec = svdup_f32(0.f);
+    do {
+        svbool_t pg_vec = svwhilelt_b32((unsigned int)idx_scalars, (unsigned int)count_scalars);
+        svfloat32_t a_vec = svld1_f32(pg_vec, a_scalars + idx_scalars);
+        svfloat32_t b_vec = svld1_f32(pg_vec, b_scalars + idx_scalars);
+        ab_vec = svmla_f32_x(pg_vec, ab_vec, a_vec, b_vec);
+        idx_scalars += svcntw();
+    } while (idx_scalars < count_scalars);
+    *result = svaddv_f32(svptrue_b32(), ab_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f32c_sve(simsimd_f32c_t const *a_pairs, simsimd_f32c_t const *b_pairs,
+                                         simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    simsimd_size_t idx_pairs = 0;
+    svfloat32_t ab_real_vec = svdup_f32(0.f);
+    svfloat32_t ab_imag_vec = svdup_f32(0.f);
+    do {
+        svbool_t pg_vec = svwhilelt_b32((unsigned int)idx_pairs, (unsigned int)count_pairs);
+        svfloat32x2_t a_vec = svld2_f32(pg_vec, (simsimd_f32_t const *)(a_pairs + idx_pairs));
+        svfloat32x2_t b_vec = svld2_f32(pg_vec, (simsimd_f32_t const *)(b_pairs + idx_pairs));
+        svfloat32_t a_real_vec = svget2_f32(a_vec, 0);
+        svfloat32_t a_imag_vec = svget2_f32(a_vec, 1);
+        svfloat32_t b_real_vec = svget2_f32(b_vec, 0);
+        svfloat32_t b_imag_vec = svget2_f32(b_vec, 1);
+        ab_real_vec = svmla_f32_x(pg_vec, ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = svmls_f32_x(pg_vec, ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = svmla_f32_x(pg_vec, ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = svmla_f32_x(pg_vec, ab_imag_vec, a_imag_vec, b_real_vec);
+        idx_pairs += svcntw();
+    } while (idx_pairs < count_pairs);
+    results[0] = svaddv_f32(svptrue_b32(), ab_real_vec);
+    results[1] = svaddv_f32(svptrue_b32(), ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_sve(simsimd_f32c_t const *a_pairs, simsimd_f32c_t const *b_pairs,
+                                          simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    simsimd_size_t idx_pairs = 0;
+    svfloat32_t ab_real_vec = svdup_f32(0.f);
+    svfloat32_t ab_imag_vec = svdup_f32(0.f);
+    do {
+        svbool_t pg_vec = svwhilelt_b32((unsigned int)idx_pairs, (unsigned int)count_pairs);
+        svfloat32x2_t a_vec = svld2_f32(pg_vec, (simsimd_f32_t const *)(a_pairs + idx_pairs));
+        svfloat32x2_t b_vec = svld2_f32(pg_vec, (simsimd_f32_t const *)(b_pairs + idx_pairs));
+        svfloat32_t a_real_vec = svget2_f32(a_vec, 0);
+        svfloat32_t a_imag_vec = svget2_f32(a_vec, 1);
+        svfloat32_t b_real_vec = svget2_f32(b_vec, 0);
+        svfloat32_t b_imag_vec = svget2_f32(b_vec, 1);
+        ab_real_vec = svmla_f32_x(pg_vec, ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = svmla_f32_x(pg_vec, ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = svmla_f32_x(pg_vec, ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = svmls_f32_x(pg_vec, ab_imag_vec, a_imag_vec, b_real_vec);
+        idx_pairs += svcntw();
+    } while (idx_pairs < count_pairs);
+    results[0] = svaddv_f32(svptrue_b32(), ab_real_vec);
+    results[1] = svaddv_f32(svptrue_b32(), ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f64_sve(simsimd_f64_t const *a_scalars, simsimd_f64_t const *b_scalars,
+                                        simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    simsimd_size_t idx_scalars = 0;
+    svfloat64_t ab_vec = svdup_f64(0.);
+    do {
+        svbool_t pg_vec = svwhilelt_b64((unsigned int)idx_scalars, (unsigned int)count_scalars);
+        svfloat64_t a_vec = svld1_f64(pg_vec, a_scalars + idx_scalars);
+        svfloat64_t b_vec = svld1_f64(pg_vec, b_scalars + idx_scalars);
+        ab_vec = svmla_f64_x(pg_vec, ab_vec, a_vec, b_vec);
+        idx_scalars += svcntd();
+    } while (idx_scalars < count_scalars);
+    *result = svaddv_f64(svptrue_b32(), ab_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f64c_sve(simsimd_f64c_t const *a_pairs, simsimd_f64c_t const *b_pairs,
+                                         simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    simsimd_size_t idx_pairs = 0;
+    svfloat64_t ab_real_vec = svdup_f64(0.);
+    svfloat64_t ab_imag_vec = svdup_f64(0.);
+    do {
+        svbool_t pg_vec = svwhilelt_b64((unsigned int)idx_pairs, (unsigned int)count_pairs);
+        svfloat64x2_t a_vec = svld2_f64(pg_vec, (simsimd_f64_t const *)(a_pairs + idx_pairs));
+        svfloat64x2_t b_vec = svld2_f64(pg_vec, (simsimd_f64_t const *)(b_pairs + idx_pairs));
+        svfloat64_t a_real_vec = svget2_f64(a_vec, 0);
+        svfloat64_t a_imag_vec = svget2_f64(a_vec, 1);
+        svfloat64_t b_real_vec = svget2_f64(b_vec, 0);
+        svfloat64_t b_imag_vec = svget2_f64(b_vec, 1);
+        ab_real_vec = svmla_f64_x(pg_vec, ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = svmls_f64_x(pg_vec, ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = svmla_f64_x(pg_vec, ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = svmla_f64_x(pg_vec, ab_imag_vec, a_imag_vec, b_real_vec);
+        idx_pairs += svcntd();
+    } while (idx_pairs < count_pairs);
+    results[0] = svaddv_f64(svptrue_b64(), ab_real_vec);
+    results[1] = svaddv_f64(svptrue_b64(), ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f64c_sve(simsimd_f64c_t const *a_pairs, simsimd_f64c_t const *b_pairs,
+                                          simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    simsimd_size_t idx_pairs = 0;
+    svfloat64_t ab_real_vec = svdup_f64(0.);
+    svfloat64_t ab_imag_vec = svdup_f64(0.);
+    do {
+        svbool_t pg_vec = svwhilelt_b64((unsigned int)idx_pairs, (unsigned int)count_pairs);
+        svfloat64x2_t a_vec = svld2_f64(pg_vec, (simsimd_f64_t const *)(a_pairs + idx_pairs));
+        svfloat64x2_t b_vec = svld2_f64(pg_vec, (simsimd_f64_t const *)(b_pairs + idx_pairs));
+        svfloat64_t a_real_vec = svget2_f64(a_vec, 0);
+        svfloat64_t a_imag_vec = svget2_f64(a_vec, 1);
+        svfloat64_t b_real_vec = svget2_f64(b_vec, 0);
+        svfloat64_t b_imag_vec = svget2_f64(b_vec, 1);
+        ab_real_vec = svmla_f64_x(pg_vec, ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = svmla_f64_x(pg_vec, ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = svmla_f64_x(pg_vec, ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = svmls_f64_x(pg_vec, ab_imag_vec, a_imag_vec, b_real_vec);
+        idx_pairs += svcntd();
+    } while (idx_pairs < count_pairs);
+    results[0] = svaddv_f64(svptrue_b64(), ab_real_vec);
+    results[1] = svaddv_f64(svptrue_b64(), ab_imag_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+sve+fp16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+sve+fp16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_sve(simsimd_f16_t const *a_scalars, simsimd_f16_t const *b_scalars,
+                                        simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    simsimd_size_t idx_scalars = 0;
+    svfloat16_t ab_vec = svdup_f16(0);
+    do {
+        svbool_t pg_vec = svwhilelt_b16((unsigned int)idx_scalars, (unsigned int)count_scalars);
+        svfloat16_t a_vec = svld1_f16(pg_vec, (simsimd_f16_for_arm_simd_t const *)(a_scalars + idx_scalars));
+        svfloat16_t b_vec = svld1_f16(pg_vec, (simsimd_f16_for_arm_simd_t const *)(b_scalars + idx_scalars));
+        ab_vec = svmla_f16_x(pg_vec, ab_vec, a_vec, b_vec);
+        idx_scalars += svcnth();
+    } while (idx_scalars < count_scalars);
+    simsimd_f16_for_arm_simd_t ab = svaddv_f16(svptrue_b16(), ab_vec);
+    *result = ab;
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f16c_sve(simsimd_f16c_t const *a_pairs, simsimd_f16c_t const *b_pairs,
+                                         simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    simsimd_size_t idx_pairs = 0;
+    svfloat16_t ab_real_vec = svdup_f16(0);
+    svfloat16_t ab_imag_vec = svdup_f16(0);
+    do {
+        svbool_t pg_vec = svwhilelt_b32((unsigned int)idx_pairs, (unsigned int)count_pairs);
+        svfloat16x2_t a_vec = svld2_f16(pg_vec, (simsimd_f16_for_arm_simd_t const *)(a_pairs + idx_pairs));
+        svfloat16x2_t b_vec = svld2_f16(pg_vec, (simsimd_f16_for_arm_simd_t const *)(b_pairs + idx_pairs));
+        svfloat16_t a_real_vec = svget2_f16(a_vec, 0);
+        svfloat16_t a_imag_vec = svget2_f16(a_vec, 1);
+        svfloat16_t b_real_vec = svget2_f16(b_vec, 0);
+        svfloat16_t b_imag_vec = svget2_f16(b_vec, 1);
+        ab_real_vec = svmla_f16_x(pg_vec, ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = svmls_f16_x(pg_vec, ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = svmla_f16_x(pg_vec, ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = svmla_f16_x(pg_vec, ab_imag_vec, a_imag_vec, b_real_vec);
+        idx_pairs += svcnth();
+    } while (idx_pairs < count_pairs);
+    results[0] = svaddv_f16(svptrue_b16(), ab_real_vec);
+    results[1] = svaddv_f16(svptrue_b16(), ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_sve(simsimd_f16c_t const *a_pairs, simsimd_f16c_t const *b_pairs,
+                                          simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    simsimd_size_t idx_pairs = 0;
+    svfloat16_t ab_real_vec = svdup_f16(0);
+    svfloat16_t ab_imag_vec = svdup_f16(0);
+    do {
+        svbool_t pg_vec = svwhilelt_b32((unsigned int)idx_pairs, (unsigned int)count_pairs);
+        svfloat16x2_t a_vec = svld2_f16(pg_vec, (simsimd_f16_for_arm_simd_t const *)(a_pairs + idx_pairs));
+        svfloat16x2_t b_vec = svld2_f16(pg_vec, (simsimd_f16_for_arm_simd_t const *)(b_pairs + idx_pairs));
+        svfloat16_t a_real_vec = svget2_f16(a_vec, 0);
+        svfloat16_t a_imag_vec = svget2_f16(a_vec, 1);
+        svfloat16_t b_real_vec = svget2_f16(b_vec, 0);
+        svfloat16_t b_imag_vec = svget2_f16(b_vec, 1);
+        ab_real_vec = svmla_f16_x(pg_vec, ab_real_vec, a_real_vec, b_real_vec);
+        ab_real_vec = svmla_f16_x(pg_vec, ab_real_vec, a_imag_vec, b_imag_vec);
+        ab_imag_vec = svmla_f16_x(pg_vec, ab_imag_vec, a_real_vec, b_imag_vec);
+        ab_imag_vec = svmls_f16_x(pg_vec, ab_imag_vec, a_imag_vec, b_real_vec);
+        idx_pairs += svcnth();
+    } while (idx_pairs < count_pairs);
+    results[0] = svaddv_f16(svptrue_b16(), ab_real_vec);
+    results[1] = svaddv_f16(svptrue_b16(), ab_imag_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SVE
+#endif // _SIMSIMD_TARGET_ARM
+
+#if _SIMSIMD_TARGET_X86
+#if SIMSIMD_TARGET_HASWELL
+#pragma GCC push_options
+#pragma GCC target("avx2", "f16c", "fma")
+#pragma clang attribute push(__attribute__((target("avx2,f16c,fma"))), apply_to = function)
+
+SIMSIMD_INTERNAL simsimd_f64_t _simsimd_reduce_f64x4_haswell(__m256d vec) {
+    // Reduce the double-precision vector to a scalar
+    // Horizontal add the first and second double-precision values, and third and fourth
+    __m128d vec_low = _mm256_castpd256_pd128(vec);
+    __m128d vec_high = _mm256_extractf128_pd(vec, 1);
+    __m128d vec128 = _mm_add_pd(vec_low, vec_high);
+
+    // Horizontal add again to accumulate all four values into one
+    vec128 = _mm_hadd_pd(vec128, vec128);
+
+    // Convert the final sum to a scalar double-precision value and return
+    return _mm_cvtsd_f64(vec128);
+}
+
+SIMSIMD_INTERNAL simsimd_f64_t _simsimd_reduce_f32x8_haswell(__m256 vec) {
+    // Convert the lower and higher 128-bit lanes of the input vector to double precision
+    __m128 low_f32 = _mm256_castps256_ps128(vec);
+    __m128 high_f32 = _mm256_extractf128_ps(vec, 1);
+
+    // Convert single-precision (float) vectors to double-precision (double) vectors
+    __m256d low_f64 = _mm256_cvtps_pd(low_f32);
+    __m256d high_f64 = _mm256_cvtps_pd(high_f32);
+
+    // Perform the addition in double-precision
+    __m256d sum = _mm256_add_pd(low_f64, high_f64);
+    return _simsimd_reduce_f64x4_haswell(sum);
+}
+
+SIMSIMD_INTERNAL simsimd_i32_t _simsimd_reduce_i32x8_haswell(__m256i vec) {
+    __m128i low = _mm256_castsi256_si128(vec);
+    __m128i high = _mm256_extracti128_si256(vec, 1);
+    __m128i sum = _mm_add_epi32(low, high);
+    sum = _mm_hadd_epi32(sum, sum);
+    sum = _mm_hadd_epi32(sum, sum);
+    return _mm_cvtsi128_si32(sum);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f32_haswell(simsimd_f32_t const *a_scalars, simsimd_f32_t const *b_scalars,
+                                            simsimd_size_t count_scalars, simsimd_distance_t *results) {
+
+    __m256 ab_vec = _mm256_setzero_ps();
+    simsimd_size_t idx_scalars = 0;
+    for (; idx_scalars + 8 <= count_scalars; idx_scalars += 8) {
+        __m256 a_vec = _mm256_loadu_ps(a_scalars + idx_scalars);
+        __m256 b_vec = _mm256_loadu_ps(b_scalars + idx_scalars);
+        ab_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_vec);
+    }
+    simsimd_f64_t ab = _simsimd_reduce_f32x8_haswell(ab_vec);
+    for (; idx_scalars < count_scalars; ++idx_scalars) ab += a_scalars[idx_scalars] * b_scalars[idx_scalars];
+    *results = ab;
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f32c_haswell(simsimd_f32c_t const *a_pairs, simsimd_f32c_t const *b_pairs,
+                                             simsimd_size_t count_pairs, simsimd_distance_t *results) {
+
+    // The naive approach would be to use FMA and FMS instructions on different parts of the vectors.
+    // Prior to that we would need to shuffle the input vectors to separate real and imaginary parts.
+    // Both operations are quite expensive, and the resulting kernel would run at 2.5 GB/s.
+    // __m128 ab_real_vec = _mm_setzero_ps();
+    // __m128 ab_imag_vec = _mm_setzero_ps();
+    // __m256i permute_vec = _mm256_set_epi32(7, 5, 3, 1, 6, 4, 2, 0);
+    // simsimd_size_t idx_pairs = 0;
+    // for (; idx_pairs + 4 <= count_pairs; idx_pairs += 4) {
+    //     __m256 a_vec = _mm256_loadu_ps((simsimd_f32_t const *)(a_pairs + idx_pairs));
+    //     __m256 b_vec = _mm256_loadu_ps((simsimd_f32_t const *)(b_pairs + idx_pairs));
+    //     __m256 a_shuffled = _mm256_permutevar8x32_ps(a_vec, permute_vec);
+    //     __m256 b_shuffled = _mm256_permutevar8x32_ps(b_vec, permute_vec);
+    //     __m128 a_real_vec = _mm256_extractf128_ps(a_shuffled, 0);
+    //     __m128 a_imag_vec = _mm256_extractf128_ps(a_shuffled, 1);
+    //     __m128 b_real_vec = _mm256_extractf128_ps(b_shuffled, 0);
+    //     __m128 b_imag_vec = _mm256_extractf128_ps(b_shuffled, 1);
+    //     ab_real_vec = _mm_fmadd_ps(a_real_vec, b_real_vec, ab_real_vec);
+    //     ab_real_vec = _mm_fnmadd_ps(a_imag_vec, b_imag_vec, ab_real_vec);
+    //     ab_imag_vec = _mm_fmadd_ps(a_real_vec, b_imag_vec, ab_imag_vec);
+    //     ab_imag_vec = _mm_fmadd_ps(a_imag_vec, b_real_vec, ab_imag_vec);
+    // }
+    //
+    // Instead, we take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors. Moreover, `XOR` can be placed after the primary loop.
+    // Both operations are quite cheap, and the throughput doubles from 2.5 GB/s to 5 GB/s.
+    __m256 ab_real_vec = _mm256_setzero_ps();
+    __m256 ab_imag_vec = _mm256_setzero_ps();
+    __m256i sign_flip_vec = _mm256_set1_epi64x(0x8000000000000000);
+    __m256i swap_adjacent_vec = _mm256_set_epi8( //
+        11, 10, 9, 8,                            // Points to the third f32 in 128-bit lane
+        15, 14, 13, 12,                          // Points to the fourth f32 in 128-bit lane
+        3, 2, 1, 0,                              // Points to the first f32 in 128-bit lane
+        7, 6, 5, 4,                              // Points to the second f32 in 128-bit lane
+        11, 10, 9, 8,                            // Points to the third f32 in 128-bit lane
+        15, 14, 13, 12,                          // Points to the fourth f32 in 128-bit lane
+        3, 2, 1, 0,                              // Points to the first f32 in 128-bit lane
+        7, 6, 5, 4                               // Points to the second f32 in 128-bit lane
+    );
+
+    simsimd_size_t idx_pairs = 0;
+    for (; idx_pairs + 4 <= count_pairs; idx_pairs += 4) {
+        __m256 a_vec = _mm256_loadu_ps((simsimd_f32_t const *)(a_pairs + idx_pairs));
+        __m256 b_vec = _mm256_loadu_ps((simsimd_f32_t const *)(b_pairs + idx_pairs));
+        __m256 b_swapped_vec = _mm256_castsi256_ps(_mm256_shuffle_epi8(_mm256_castps_si256(b_vec), swap_adjacent_vec));
+        ab_real_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_real_vec);
+        ab_imag_vec = _mm256_fmadd_ps(a_vec, b_swapped_vec, ab_imag_vec);
+    }
+
+    // Flip the sign bit in every second scalar before accumulation:
+    ab_real_vec = _mm256_castsi256_ps(_mm256_xor_si256(_mm256_castps_si256(ab_real_vec), sign_flip_vec));
+
+    // Reduce horizontal sums:
+    simsimd_distance_t ab_real = _simsimd_reduce_f32x8_haswell(ab_real_vec);
+    simsimd_distance_t ab_imag = _simsimd_reduce_f32x8_haswell(ab_imag_vec);
+
+    // Handle the tail:
+    for (; idx_pairs != count_pairs; ++idx_pairs) {
+        simsimd_f32c_t a_pair = a_pairs[idx_pairs], b_pair = b_pairs[idx_pairs];
+        simsimd_f32_t ar = a_pair.real, ai = a_pair.imag, br = b_pair.real, bi = b_pair.imag;
+        ab_real += ar * br - ai * bi;
+        ab_imag += ar * bi + ai * br;
+    }
+    results[0] = ab_real;
+    results[1] = ab_imag;
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_haswell(simsimd_f32c_t const *a_pairs, simsimd_f32c_t const *b_pairs,
+                                              simsimd_size_t count_pairs, simsimd_distance_t *results) {
+
+    __m256 ab_real_vec = _mm256_setzero_ps();
+    __m256 ab_imag_vec = _mm256_setzero_ps();
+    __m256i sign_flip_vec = _mm256_set1_epi64x(0x8000000000000000);
+    __m256i swap_adjacent_vec = _mm256_set_epi8( //
+        11, 10, 9, 8,                            // Points to the third f32 in 128-bit lane
+        15, 14, 13, 12,                          // Points to the fourth f32 in 128-bit lane
+        3, 2, 1, 0,                              // Points to the first f32 in 128-bit lane
+        7, 6, 5, 4,                              // Points to the second f32 in 128-bit lane
+        11, 10, 9, 8,                            // Points to the third f32 in 128-bit lane
+        15, 14, 13, 12,                          // Points to the fourth f32 in 128-bit lane
+        3, 2, 1, 0,                              // Points to the first f32 in 128-bit lane
+        7, 6, 5, 4                               // Points to the second f32 in 128-bit lane
+    );
+
+    simsimd_size_t idx_pairs = 0;
+    for (; idx_pairs + 4 <= count_pairs; idx_pairs += 4) {
+        __m256 a_vec = _mm256_loadu_ps((simsimd_f32_t const *)(a_pairs + idx_pairs));
+        __m256 b_vec = _mm256_loadu_ps((simsimd_f32_t const *)(b_pairs + idx_pairs));
+        ab_real_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_real_vec);
+        b_vec = _mm256_castsi256_ps(_mm256_shuffle_epi8(_mm256_castps_si256(b_vec), swap_adjacent_vec));
+        ab_imag_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_imag_vec);
+    }
+
+    // Flip the sign bit in every second scalar before accumulation:
+    ab_imag_vec = _mm256_castsi256_ps(_mm256_xor_si256(_mm256_castps_si256(ab_imag_vec), sign_flip_vec));
+
+    // Reduce horizontal sums:
+    simsimd_distance_t ab_real = _simsimd_reduce_f32x8_haswell(ab_real_vec);
+    simsimd_distance_t ab_imag = _simsimd_reduce_f32x8_haswell(ab_imag_vec);
+
+    // Handle the tail:
+    for (; idx_pairs != count_pairs; ++idx_pairs) {
+        simsimd_f32c_t a_pair = a_pairs[idx_pairs], b_pair = b_pairs[idx_pairs];
+        simsimd_f32_t ar = a_pair.real, ai = a_pair.imag, br = b_pair.real, bi = b_pair.imag;
+        ab_real += ar * br + ai * bi;
+        ab_imag += ar * bi - ai * br;
+    }
+    results[0] = ab_real;
+    results[1] = ab_imag;
+}
+
+SIMSIMD_INTERNAL __m256 _simsimd_partial_load_f16x8_haswell(simsimd_f16_t const *a, simsimd_size_t n) {
+    // In case the software emulation for `f16` scalars is enabled, the `simsimd_f16_to_f32`
+    // function will run. It is extremely slow, so even for the tail, let's combine serial
+    // loads and stores with vectorized math.
+    union {
+        __m128i vec;
+        simsimd_f16_t scalars[8];
+    } result;
+    simsimd_size_t i = 0;
+    for (; i < n; ++i) result.scalars[i] = a[i];
+    for (; i < 8; ++i) result.scalars[i] = 0;
+    return _mm256_cvtph_ps(result.vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_haswell(simsimd_f16_t const *a_scalars, simsimd_f16_t const *b_scalars,
+                                            simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    __m256 a_vec, b_vec;
+    __m256 ab_vec = _mm256_setzero_ps();
+
+simsimd_dot_f16_haswell_cycle:
+    if (count_scalars < 8) {
+        a_vec = _simsimd_partial_load_f16x8_haswell(a_scalars, count_scalars);
+        b_vec = _simsimd_partial_load_f16x8_haswell(b_scalars, count_scalars);
+        count_scalars = 0;
+    }
+    else {
+        a_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)a_scalars));
+        b_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)b_scalars));
+        count_scalars -= 8, a_scalars += 8, b_scalars += 8;
+    }
+    // We can silence the NaNs using blends:
+    //
+    //     __m256 a_is_nan = _mm256_cmp_ps(a_vec, a_vec, _CMP_UNORD_Q);
+    //     __m256 b_is_nan = _mm256_cmp_ps(b_vec, b_vec, _CMP_UNORD_Q);
+    //     ab_vec = _mm256_blendv_ps(_mm256_fmadd_ps(a_vec, b_vec, ab_vec), ab_vec, _mm256_or_ps(a_is_nan, b_is_nan));
+    //
+    ab_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_vec);
+    if (count_scalars) goto simsimd_dot_f16_haswell_cycle;
+
+    *result = _simsimd_reduce_f32x8_haswell(ab_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f16c_haswell(simsimd_f16c_t const *a_pairs, simsimd_f16c_t const *b_pairs,
+                                             simsimd_size_t count_pairs, simsimd_distance_t *results) {
+
+    // Ideally the implementation would load 256 bits worth of vector data at a time,
+    // shuffle those within a register, split in halfs, and only then upcast.
+    // That way, we are stepping through 32x 16-bit vector components at a time, or 16 dimensions.
+    // Sadly, shuffling 16-bit entries in a YMM register is hard to implement efficiently.
+    //
+    // Simpler approach is to load 128 bits at a time, upcast, and then shuffle.
+    // This mostly replicates the `simsimd_dot_f32c_haswell`.
+    __m256 ab_real_vec = _mm256_setzero_ps();
+    __m256 ab_imag_vec = _mm256_setzero_ps();
+    __m256i sign_flip_vec = _mm256_set1_epi64x(0x8000000000000000);
+    __m256i swap_adjacent_vec = _mm256_set_epi8( //
+        11, 10, 9, 8,                            // Points to the third f32 in 128-bit lane
+        15, 14, 13, 12,                          // Points to the fourth f32 in 128-bit lane
+        3, 2, 1, 0,                              // Points to the first f32 in 128-bit lane
+        7, 6, 5, 4,                              // Points to the second f32 in 128-bit lane
+        11, 10, 9, 8,                            // Points to the third f32 in 128-bit lane
+        15, 14, 13, 12,                          // Points to the fourth f32 in 128-bit lane
+        3, 2, 1, 0,                              // Points to the first f32 in 128-bit lane
+        7, 6, 5, 4                               // Points to the second f32 in 128-bit lane
+    );
+
+    while (count_pairs >= 4) {
+        __m256 a_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)a_pairs));
+        __m256 b_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)b_pairs));
+        __m256 b_swapped_vec = _mm256_castsi256_ps(_mm256_shuffle_epi8(_mm256_castps_si256(b_vec), swap_adjacent_vec));
+        ab_real_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_real_vec);
+        ab_imag_vec = _mm256_fmadd_ps(a_vec, b_swapped_vec, ab_imag_vec);
+        count_pairs -= 4, a_pairs += 4, b_pairs += 4;
+    }
+
+    // Flip the sign bit in every second scalar before accumulation:
+    ab_real_vec = _mm256_castsi256_ps(_mm256_xor_si256(_mm256_castps_si256(ab_real_vec), sign_flip_vec));
+
+    // Reduce horizontal sums and aggregate with the tail:
+    simsimd_dot_f16c_serial(a_pairs, b_pairs, count_pairs, results);
+    results[0] += _simsimd_reduce_f32x8_haswell(ab_real_vec);
+    results[1] += _simsimd_reduce_f32x8_haswell(ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_haswell(simsimd_f16c_t const *a_pairs, simsimd_f16c_t const *b_pairs,
+                                              simsimd_size_t count_pairs, simsimd_distance_t *results) {
+
+    // Ideally the implementation would load 256 bits worth of vector data at a time,
+    // shuffle those within a register, split in halfs, and only then upcast.
+    // That way, we are stepping through 32x 16-bit vector components at a time, or 16 dimensions.
+    // Sadly, shuffling 16-bit entries in a YMM register is hard to implement efficiently.
+    //
+    // Simpler approach is to load 128 bits at a time, upcast, and then shuffle.
+    // This mostly replicates the `simsimd_vdot_f32c_haswell`.
+    __m256 ab_real_vec = _mm256_setzero_ps();
+    __m256 ab_imag_vec = _mm256_setzero_ps();
+    __m256i sign_flip_vec = _mm256_set1_epi64x(0x8000000000000000);
+    __m256i swap_adjacent_vec = _mm256_set_epi8( //
+        11, 10, 9, 8,                            // Points to the third f32 in 128-bit lane
+        15, 14, 13, 12,                          // Points to the fourth f32 in 128-bit lane
+        3, 2, 1, 0,                              // Points to the first f32 in 128-bit lane
+        7, 6, 5, 4,                              // Points to the second f32 in 128-bit lane
+        11, 10, 9, 8,                            // Points to the third f32 in 128-bit lane
+        15, 14, 13, 12,                          // Points to the fourth f32 in 128-bit lane
+        3, 2, 1, 0,                              // Points to the first f32 in 128-bit lane
+        7, 6, 5, 4                               // Points to the second f32 in 128-bit lane
+    );
+
+    while (count_pairs >= 4) {
+        __m256 a_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)a_pairs));
+        __m256 b_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)b_pairs));
+        ab_real_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_real_vec);
+        b_vec = _mm256_castsi256_ps(_mm256_shuffle_epi8(_mm256_castps_si256(b_vec), swap_adjacent_vec));
+        ab_imag_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_imag_vec);
+        count_pairs -= 4, a_pairs += 4, b_pairs += 4;
+    }
+
+    // Flip the sign bit in every second scalar before accumulation:
+    ab_imag_vec = _mm256_castsi256_ps(_mm256_xor_si256(_mm256_castps_si256(ab_imag_vec), sign_flip_vec));
+
+    // Reduce horizontal sums and aggregate with the tail:
+    simsimd_dot_f16c_serial(a_pairs, b_pairs, count_pairs, results);
+    results[0] += _simsimd_reduce_f32x8_haswell(ab_real_vec);
+    results[1] += _simsimd_reduce_f32x8_haswell(ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_i8_haswell(simsimd_i8_t const *a_scalars, simsimd_i8_t const *b_scalars,
+                                           simsimd_size_t count_scalars, simsimd_distance_t *result) {
+
+    __m256i ab_i32_low_vec = _mm256_setzero_si256();
+    __m256i ab_i32_high_vec = _mm256_setzero_si256();
+
+    // AVX2 has no instructions for 8-bit signed integer dot-products,
+    // but it has a weird instruction for mixed signed-unsigned 8-bit dot-product.
+    // So we need to normalize the first vector to its absolute value,
+    // and shift the product sign into the second vector.
+    //
+    //      __m256i a_i8_abs_vec = _mm256_abs_epi8(a_i8_vec);
+    //      __m256i b_i8_flipped_vec = _mm256_sign_epi8(b_i8_vec, a_i8_vec);
+    //      __m256i ab_i16_vec = _mm256_maddubs_epi16(a_i8_abs_vec, b_i8_flipped_vec);
+    //
+    // The problem with this approach, however, is the `-128` value in the second vector.
+    // Flipping it's sign will do nothing, and the result will be incorrect.
+    // This can easily lead to noticeable numerical errors in the final result.
+    simsimd_size_t idx_scalars = 0;
+    for (; idx_scalars + 32 <= count_scalars; idx_scalars += 32) {
+        __m256i a_i8_vec = _mm256_lddqu_si256((__m256i const *)(a_scalars + idx_scalars));
+        __m256i b_i8_vec = _mm256_lddqu_si256((__m256i const *)(b_scalars + idx_scalars));
+
+        // Upcast `int8` to `int16`
+        __m256i a_i16_low_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(a_i8_vec, 0));
+        __m256i a_i16_high_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(a_i8_vec, 1));
+        __m256i b_i16_low_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(b_i8_vec, 0));
+        __m256i b_i16_high_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(b_i8_vec, 1));
+
+        // Multiply and accumulate at int16 level, accumulate at `int32` level
+        ab_i32_low_vec = _mm256_add_epi32(ab_i32_low_vec, _mm256_madd_epi16(a_i16_low_vec, b_i16_low_vec));
+        ab_i32_high_vec = _mm256_add_epi32(ab_i32_high_vec, _mm256_madd_epi16(a_i16_high_vec, b_i16_high_vec));
+    }
+
+    // Horizontal sum across the 256-bit register
+    int ab = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(ab_i32_low_vec, ab_i32_high_vec));
+
+    // Take care of the tail:
+    for (; idx_scalars < count_scalars; ++idx_scalars) ab += (int)(a_scalars[idx_scalars]) * b_scalars[idx_scalars];
+    *result = ab;
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_u8_haswell(simsimd_u8_t const *a_scalars, simsimd_u8_t const *b_scalars,
+                                           simsimd_size_t count_scalars, simsimd_distance_t *result) {
+
+    __m256i ab_i32_low_vec = _mm256_setzero_si256();
+    __m256i ab_i32_high_vec = _mm256_setzero_si256();
+    __m256i const zeros_vec = _mm256_setzero_si256();
+
+    // AVX2 has no instructions for unsigned 8-bit integer dot-products,
+    // but it has a weird instruction for mixed signed-unsigned 8-bit dot-product.
+    simsimd_size_t idx_scalars = 0;
+    for (; idx_scalars + 32 <= count_scalars; idx_scalars += 32) {
+        __m256i a_u8_vec = _mm256_lddqu_si256((__m256i const *)(a_scalars + idx_scalars));
+        __m256i b_u8_vec = _mm256_lddqu_si256((__m256i const *)(b_scalars + idx_scalars));
+
+        // Upcast `uint8` to `int16`. Unlike the signed version, we can use the unpacking
+        // instructions instead of extracts, as they are much faster and more efficient.
+        __m256i a_i16_low_vec = _mm256_unpacklo_epi8(a_u8_vec, zeros_vec);
+        __m256i a_i16_high_vec = _mm256_unpackhi_epi8(a_u8_vec, zeros_vec);
+        __m256i b_i16_low_vec = _mm256_unpacklo_epi8(b_u8_vec, zeros_vec);
+        __m256i b_i16_high_vec = _mm256_unpackhi_epi8(b_u8_vec, zeros_vec);
+
+        // Multiply and accumulate at int16 level, accumulate at int32 level
+        ab_i32_low_vec = _mm256_add_epi32(ab_i32_low_vec, _mm256_madd_epi16(a_i16_low_vec, b_i16_low_vec));
+        ab_i32_high_vec = _mm256_add_epi32(ab_i32_high_vec, _mm256_madd_epi16(a_i16_high_vec, b_i16_high_vec));
+    }
+
+    // Horizontal sum across the 256-bit register
+    int ab = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(ab_i32_low_vec, ab_i32_high_vec));
+
+    // Take care of the tail:
+    for (; idx_scalars < count_scalars; ++idx_scalars) ab += (int)(a_scalars[idx_scalars]) * b_scalars[idx_scalars];
+    *result = ab;
+}
+
+SIMSIMD_INTERNAL __m256 _simsimd_bf16x8_to_f32x8_haswell(__m128i x) {
+    // Upcasting from `bf16` to `f32` is done by shifting the `bf16` values by 16 bits to the left, like:
+    return _mm256_castsi256_ps(_mm256_slli_epi32(_mm256_cvtepu16_epi32(x), 16));
+}
+
+SIMSIMD_INTERNAL __m128i _simsimd_f32x8_to_bf16x8_haswell(__m256 x) {
+    // Pack the 32-bit integers into 16-bit integers.
+    // This is less trivial than unpacking: https://stackoverflow.com/a/77781241/2766161
+    // The best approach is to shuffle within lanes first: https://stackoverflow.com/a/49723746/2766161
+    // Our shuffling mask will drop the low 2-bytes from every 4-byte word.
+    __m256i trunc_elements = _mm256_shuffle_epi8(                       //
+        _mm256_castps_si256(x),                                         //
+        _mm256_set_epi8(                                                //
+            -1, -1, -1, -1, -1, -1, -1, -1, 15, 14, 11, 10, 7, 6, 3, 2, //
+            -1, -1, -1, -1, -1, -1, -1, -1, 15, 14, 11, 10, 7, 6, 3, 2  //
+            ));
+    __m256i ordered = _mm256_permute4x64_epi64(trunc_elements, 0x58);
+    __m128i result = _mm256_castsi256_si128(ordered);
+    return result;
+}
+
+SIMSIMD_INTERNAL __m128i _simsimd_partial_load_bf16x8_haswell(simsimd_bf16_t const *a, simsimd_size_t n) {
+    // In case the software emulation for `bf16` scalars is enabled, the `simsimd_bf16_to_f32`
+    // function will run. It is extremely slow, so even for the tail, let's combine serial
+    // loads and stores with vectorized math.
+    union {
+        __m128i vec;
+        simsimd_bf16_t scalars[8];
+    } result;
+    simsimd_size_t i = 0;
+    for (; i < n; ++i) result.scalars[i] = a[i];
+    for (; i < 8; ++i) result.scalars[i] = 0;
+    return result.vec;
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16_haswell(simsimd_bf16_t const *a_scalars, simsimd_bf16_t const *b_scalars,
+                                             simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    __m128i a_vec, b_vec;
+    __m256 ab_vec = _mm256_setzero_ps();
+
+simsimd_dot_bf16_haswell_cycle:
+    if (count_scalars < 8) {
+        a_vec = _simsimd_partial_load_bf16x8_haswell(a_scalars, count_scalars);
+        b_vec = _simsimd_partial_load_bf16x8_haswell(b_scalars, count_scalars);
+        count_scalars = 0;
+    }
+    else {
+        a_vec = _mm_lddqu_si128((__m128i const *)a_scalars);
+        b_vec = _mm_lddqu_si128((__m128i const *)b_scalars);
+        a_scalars += 8, b_scalars += 8, count_scalars -= 8;
+    }
+    ab_vec = _mm256_fmadd_ps(_simsimd_bf16x8_to_f32x8_haswell(a_vec), _simsimd_bf16x8_to_f32x8_haswell(b_vec), ab_vec);
+    if (count_scalars) goto simsimd_dot_bf16_haswell_cycle;
+
+    *result = _simsimd_reduce_f32x8_haswell(ab_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_HASWELL
+
+#if SIMSIMD_TARGET_SKYLAKE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "avx512bw", "bmi2")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,avx512bw,bmi2"))), apply_to = function)
+
+SIMSIMD_INTERNAL simsimd_f64_t _simsimd_reduce_f32x16_skylake(__m512 a) {
+    __m512 x = _mm512_add_ps(a, _mm512_shuffle_f32x4(a, a, _MM_SHUFFLE(0, 0, 3, 2)));
+    __m128 r = _mm512_castps512_ps128(_mm512_add_ps(x, _mm512_shuffle_f32x4(x, x, _MM_SHUFFLE(0, 0, 0, 1))));
+    r = _mm_hadd_ps(r, r);
+    return _mm_cvtss_f32(_mm_hadd_ps(r, r));
+}
+
+SIMSIMD_INTERNAL __m512 _simsimd_bf16x16_to_f32x16_skylake(__m256i a) {
+    // Upcasting from `bf16` to `f32` is done by shifting the `bf16` values by 16 bits to the left, like:
+    return _mm512_castsi512_ps(_mm512_slli_epi32(_mm512_cvtepu16_epi32(a), 16));
+}
+
+SIMSIMD_INTERNAL __m256i _simsimd_f32x16_to_bf16x16_skylake(__m512 a) {
+    // Add 2^15 and right shift 16 to do round-nearest
+    __m512i x = _mm512_srli_epi32(_mm512_add_epi32(_mm512_castps_si512(a), _mm512_set1_epi32(1 << 15)), 16);
+    return _mm512_cvtepi32_epi16(x);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f32_skylake(simsimd_f32_t const *a_scalars, simsimd_f32_t const *b_scalars,
+                                            simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    __m512 a_vec, b_vec;
+    __m512 ab_vec = _mm512_setzero();
+
+simsimd_dot_f32_skylake_cycle:
+    if (count_scalars < 16) {
+        __mmask16 mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, count_scalars);
+        a_vec = _mm512_maskz_loadu_ps(mask, a_scalars);
+        b_vec = _mm512_maskz_loadu_ps(mask, b_scalars);
+        count_scalars = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps(a_scalars);
+        b_vec = _mm512_loadu_ps(b_scalars);
+        a_scalars += 16, b_scalars += 16, count_scalars -= 16;
+    }
+    ab_vec = _mm512_fmadd_ps(a_vec, b_vec, ab_vec);
+    if (count_scalars) goto simsimd_dot_f32_skylake_cycle;
+
+    *result = _simsimd_reduce_f32x16_skylake(ab_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f64_skylake(simsimd_f64_t const *a_scalars, simsimd_f64_t const *b_scalars,
+                                            simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    __m512d a_vec, b_vec;
+    __m512d ab_vec = _mm512_setzero_pd();
+
+simsimd_dot_f64_skylake_cycle:
+    if (count_scalars < 8) {
+        __mmask8 mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, count_scalars);
+        a_vec = _mm512_maskz_loadu_pd(mask, a_scalars);
+        b_vec = _mm512_maskz_loadu_pd(mask, b_scalars);
+        count_scalars = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_pd(a_scalars);
+        b_vec = _mm512_loadu_pd(b_scalars);
+        a_scalars += 8, b_scalars += 8, count_scalars -= 8;
+    }
+    ab_vec = _mm512_fmadd_pd(a_vec, b_vec, ab_vec);
+    if (count_scalars) goto simsimd_dot_f64_skylake_cycle;
+
+    *result = _mm512_reduce_add_pd(ab_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f32c_skylake(simsimd_f32c_t const *a_pairs, simsimd_f32c_t const *b_pairs,
+                                             simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    __m512 a_vec, b_vec;
+    __m512 ab_real_vec = _mm512_setzero();
+    __m512 ab_imag_vec = _mm512_setzero();
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set1_epi64(0x8000000000000000);
+simsimd_dot_f32c_skylake_cycle:
+    if (count_pairs < 8) {
+        __mmask16 mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, count_pairs * 2);
+        a_vec = _mm512_maskz_loadu_ps(mask, a_pairs);
+        b_vec = _mm512_maskz_loadu_ps(mask, b_pairs);
+        count_pairs = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps(a_pairs);
+        b_vec = _mm512_loadu_ps(b_pairs);
+        a_pairs += 8, b_pairs += 8, count_pairs -= 8;
+    }
+    ab_real_vec = _mm512_fmadd_ps(b_vec, a_vec, ab_real_vec);
+    b_vec = _mm512_permute_ps(b_vec, 0xB1); //? Swap adjacent entries within each pair
+    ab_imag_vec = _mm512_fmadd_ps(b_vec, a_vec, ab_imag_vec);
+    if (count_pairs) goto simsimd_dot_f32c_skylake_cycle;
+
+    // Flip the sign bit in every second scalar before accumulation:
+    ab_real_vec = _mm512_castsi512_ps(_mm512_xor_si512(_mm512_castps_si512(ab_real_vec), sign_flip_vec));
+
+    // Reduce horizontal sums:
+    results[0] = _simsimd_reduce_f32x16_skylake(ab_real_vec);
+    results[1] = _simsimd_reduce_f32x16_skylake(ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f32c_skylake(simsimd_f32c_t const *a_pairs, simsimd_f32c_t const *b_pairs,
+                                              simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    __m512 a_vec, b_vec;
+    __m512 ab_real_vec = _mm512_setzero();
+    __m512 ab_imag_vec = _mm512_setzero();
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set1_epi64(0x8000000000000000);
+    __m512i const swap_adjacent_vec = _mm512_set_epi8(                  //
+        59, 58, 57, 56, 63, 62, 61, 60, 51, 50, 49, 48, 55, 54, 53, 52, // 4th 128-bit lane
+        43, 42, 41, 40, 47, 46, 45, 44, 35, 34, 33, 32, 39, 38, 37, 36, // 3rd 128-bit lane
+        27, 26, 25, 24, 31, 30, 29, 28, 19, 18, 17, 16, 23, 22, 21, 20, // 2nd 128-bit lane
+        11, 10, 9, 8, 15, 14, 13, 12, 3, 2, 1, 0, 7, 6, 5, 4            // 1st 128-bit lane
+    );
+simsimd_vdot_f32c_skylake_cycle:
+    if (count_pairs < 8) {
+        __mmask16 mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, count_pairs * 2);
+        a_vec = _mm512_maskz_loadu_ps(mask, (simsimd_f32_t const *)a_pairs);
+        b_vec = _mm512_maskz_loadu_ps(mask, (simsimd_f32_t const *)b_pairs);
+        count_pairs = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps((simsimd_f32_t const *)a_pairs);
+        b_vec = _mm512_loadu_ps((simsimd_f32_t const *)b_pairs);
+        a_pairs += 8, b_pairs += 8, count_pairs -= 8;
+    }
+    ab_real_vec = _mm512_fmadd_ps(a_vec, b_vec, ab_real_vec);
+    b_vec = _mm512_permute_ps(b_vec, 0xB1); //? Swap adjacent entries within each pair
+    ab_imag_vec = _mm512_fmadd_ps(a_vec, b_vec, ab_imag_vec);
+    if (count_pairs) goto simsimd_vdot_f32c_skylake_cycle;
+
+    // Flip the sign bit in every second scalar before accumulation:
+    ab_imag_vec = _mm512_castsi512_ps(_mm512_xor_si512(_mm512_castps_si512(ab_imag_vec), sign_flip_vec));
+
+    // Reduce horizontal sums:
+    results[0] = _simsimd_reduce_f32x16_skylake(ab_real_vec);
+    results[1] = _simsimd_reduce_f32x16_skylake(ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f64c_skylake(simsimd_f64c_t const *a_pairs, simsimd_f64c_t const *b_pairs,
+                                             simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    __m512d a_vec, b_vec;
+    __m512d ab_real_vec = _mm512_setzero_pd();
+    __m512d ab_imag_vec = _mm512_setzero_pd();
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set_epi64(                                     //
+        0x8000000000000000, 0x0000000000000000, 0x8000000000000000, 0x0000000000000000, //
+        0x8000000000000000, 0x0000000000000000, 0x8000000000000000, 0x0000000000000000  //
+    );
+simsimd_dot_f64c_skylake_cycle:
+    if (count_pairs < 4) {
+        __mmask8 mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, count_pairs * 2);
+        a_vec = _mm512_maskz_loadu_pd(mask, a_pairs);
+        b_vec = _mm512_maskz_loadu_pd(mask, b_pairs);
+        count_pairs = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_pd(a_pairs);
+        b_vec = _mm512_loadu_pd(b_pairs);
+        a_pairs += 4, b_pairs += 4, count_pairs -= 4;
+    }
+    ab_real_vec = _mm512_fmadd_pd(b_vec, a_vec, ab_real_vec);
+    b_vec = _mm512_permute_pd(b_vec, 0x55); //? Same as 0b01010101.
+    ab_imag_vec = _mm512_fmadd_pd(b_vec, a_vec, ab_imag_vec);
+    if (count_pairs) goto simsimd_dot_f64c_skylake_cycle;
+
+    // Flip the sign bit in every second scalar before accumulation:
+    ab_real_vec = _mm512_castsi512_pd(_mm512_xor_si512(_mm512_castpd_si512(ab_real_vec), sign_flip_vec));
+
+    // Reduce horizontal sums:
+    results[0] = _mm512_reduce_add_pd(ab_real_vec);
+    results[1] = _mm512_reduce_add_pd(ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f64c_skylake(simsimd_f64c_t const *a_pairs, simsimd_f64c_t const *b_pairs,
+                                              simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    __m512d a_vec, b_vec;
+    __m512d ab_real_vec = _mm512_setzero_pd();
+    __m512d ab_imag_vec = _mm512_setzero_pd();
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set_epi64(                                     //
+        0x8000000000000000, 0x0000000000000000, 0x8000000000000000, 0x0000000000000000, //
+        0x8000000000000000, 0x0000000000000000, 0x8000000000000000, 0x0000000000000000  //
+    );
+simsimd_vdot_f64c_skylake_cycle:
+    if (count_pairs < 4) {
+        __mmask8 mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, count_pairs * 2);
+        a_vec = _mm512_maskz_loadu_pd(mask, (simsimd_f32_t const *)a_pairs);
+        b_vec = _mm512_maskz_loadu_pd(mask, (simsimd_f32_t const *)b_pairs);
+        count_pairs = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_pd((simsimd_f32_t const *)a_pairs);
+        b_vec = _mm512_loadu_pd((simsimd_f32_t const *)b_pairs);
+        a_pairs += 4, b_pairs += 4, count_pairs -= 4;
+    }
+    ab_real_vec = _mm512_fmadd_pd(a_vec, b_vec, ab_real_vec);
+    b_vec = _mm512_permute_pd(b_vec, 0x55); //? Same as 0b01010101.
+    ab_imag_vec = _mm512_fmadd_pd(a_vec, b_vec, ab_imag_vec);
+    if (count_pairs) goto simsimd_vdot_f64c_skylake_cycle;
+
+    // Flip the sign bit in every second scalar before accumulation:
+    ab_imag_vec = _mm512_castsi512_pd(_mm512_xor_si512(_mm512_castpd_si512(ab_imag_vec), sign_flip_vec));
+
+    // Reduce horizontal sums:
+    results[0] = _mm512_reduce_add_pd(ab_real_vec);
+    results[1] = _mm512_reduce_add_pd(ab_imag_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SKYLAKE
+
+#if SIMSIMD_TARGET_GENOA
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512bw", "avx512bf16")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512bw,avx512bf16"))), \
+                             apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16_genoa(simsimd_bf16_t const *a_scalars, simsimd_bf16_t const *b_scalars,
+                                           simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    __m512i a_i16_vec, b_i16_vec;
+    __m512 ab_vec = _mm512_setzero_ps();
+
+simsimd_dot_bf16_genoa_cycle:
+    if (count_scalars < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, count_scalars);
+        a_i16_vec = _mm512_maskz_loadu_epi16(mask, a_scalars);
+        b_i16_vec = _mm512_maskz_loadu_epi16(mask, b_scalars);
+        count_scalars = 0;
+    }
+    else {
+        a_i16_vec = _mm512_loadu_epi16(a_scalars);
+        b_i16_vec = _mm512_loadu_epi16(b_scalars);
+        a_scalars += 32, b_scalars += 32, count_scalars -= 32;
+    }
+    ab_vec = _mm512_dpbf16_ps(ab_vec, (__m512bh)(a_i16_vec), (__m512bh)(b_i16_vec));
+    if (count_scalars) goto simsimd_dot_bf16_genoa_cycle;
+
+    *result = _simsimd_reduce_f32x16_skylake(ab_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_bf16c_genoa(simsimd_bf16c_t const *a_pairs, simsimd_bf16c_t const *b_pairs,
+                                            simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    __m512i a_vec, b_vec;
+    __m512 ab_real_vec = _mm512_setzero_ps();
+    __m512 ab_imag_vec = _mm512_setzero_ps();
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set1_epi32(0x80000000);
+    __m512i const swap_adjacent_vec = _mm512_set_epi8(                  //
+        61, 60, 63, 62, 57, 56, 59, 58, 53, 52, 55, 54, 49, 48, 51, 50, // 4th 128-bit lane
+        45, 44, 47, 46, 41, 40, 43, 42, 37, 36, 39, 38, 33, 32, 35, 34, // 3rd 128-bit lane
+        29, 28, 31, 30, 25, 24, 27, 26, 21, 20, 23, 22, 17, 16, 19, 18, // 2nd 128-bit lane
+        13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2            // 1st 128-bit lane
+    );
+
+simsimd_dot_bf16c_genoa_cycle:
+    if (count_pairs < 16) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, count_pairs * 2);
+        a_vec = _mm512_maskz_loadu_epi16(mask, (simsimd_i16_t const *)a_pairs);
+        b_vec = _mm512_maskz_loadu_epi16(mask, (simsimd_i16_t const *)b_pairs);
+        count_pairs = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_epi16((simsimd_i16_t const *)a_pairs);
+        b_vec = _mm512_loadu_epi16((simsimd_i16_t const *)b_pairs);
+        a_pairs += 16, b_pairs += 16, count_pairs -= 16;
+    }
+    ab_real_vec = _mm512_dpbf16_ps(ab_real_vec, (__m512bh)(_mm512_xor_si512(b_vec, sign_flip_vec)), (__m512bh)(a_vec));
+    ab_imag_vec =
+        _mm512_dpbf16_ps(ab_imag_vec, (__m512bh)(_mm512_shuffle_epi8(b_vec, swap_adjacent_vec)), (__m512bh)(a_vec));
+    if (count_pairs) goto simsimd_dot_bf16c_genoa_cycle;
+
+    // Reduce horizontal sums:
+    results[0] = _simsimd_reduce_f32x16_skylake(ab_real_vec);
+    results[1] = _simsimd_reduce_f32x16_skylake(ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_bf16c_genoa(simsimd_bf16c_t const *a_pairs, simsimd_bf16c_t const *b_pairs,
+                                             simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    __m512i a_vec, b_vec;
+    __m512 ab_real_vec = _mm512_setzero_ps();
+    __m512 ab_imag_vec = _mm512_setzero_ps();
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set1_epi32(0x80000000);
+    __m512i const swap_adjacent_vec = _mm512_set_epi8(                  //
+        61, 60, 63, 62, 57, 56, 59, 58, 53, 52, 55, 54, 49, 48, 51, 50, // 4th 128-bit lane
+        45, 44, 47, 46, 41, 40, 43, 42, 37, 36, 39, 38, 33, 32, 35, 34, // 3rd 128-bit lane
+        29, 28, 31, 30, 25, 24, 27, 26, 21, 20, 23, 22, 17, 16, 19, 18, // 2nd 128-bit lane
+        13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2            // 1st 128-bit lane
+    );
+
+simsimd_dot_bf16c_genoa_cycle:
+    if (count_pairs < 16) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, count_pairs * 2);
+        a_vec = _mm512_maskz_loadu_epi16(mask, (simsimd_i16_t const *)a_pairs);
+        b_vec = _mm512_maskz_loadu_epi16(mask, (simsimd_i16_t const *)b_pairs);
+        count_pairs = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_epi16((simsimd_i16_t const *)a_pairs);
+        b_vec = _mm512_loadu_epi16((simsimd_i16_t const *)b_pairs);
+        a_pairs += 16, b_pairs += 16, count_pairs -= 16;
+    }
+    ab_real_vec = _mm512_dpbf16_ps(ab_real_vec, (__m512bh)(a_vec), (__m512bh)(b_vec));
+    a_vec = _mm512_xor_si512(a_vec, sign_flip_vec);
+    b_vec = _mm512_shuffle_epi8(b_vec, swap_adjacent_vec);
+    ab_imag_vec = _mm512_dpbf16_ps(ab_imag_vec, (__m512bh)(a_vec), (__m512bh)(b_vec));
+    if (count_pairs) goto simsimd_dot_bf16c_genoa_cycle;
+
+    // Reduce horizontal sums:
+    results[0] = _simsimd_reduce_f32x16_skylake(ab_real_vec);
+    results[1] = _simsimd_reduce_f32x16_skylake(ab_imag_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_GENOA
+
+#if SIMSIMD_TARGET_SAPPHIRE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512bw", "avx512fp16")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512bw,avx512fp16"))), \
+                             apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_dot_f16_sapphire(simsimd_f16_t const *a_scalars, simsimd_f16_t const *b_scalars,
+                                             simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    __m512i a_i16_vec, b_i16_vec;
+    __m512h ab_vec = _mm512_setzero_ph();
+
+simsimd_dot_f16_sapphire_cycle:
+    if (count_scalars < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, count_scalars);
+        a_i16_vec = _mm512_maskz_loadu_epi16(mask, a_scalars);
+        b_i16_vec = _mm512_maskz_loadu_epi16(mask, b_scalars);
+        count_scalars = 0;
+    }
+    else {
+        a_i16_vec = _mm512_loadu_epi16(a_scalars);
+        b_i16_vec = _mm512_loadu_epi16(b_scalars);
+        a_scalars += 32, b_scalars += 32, count_scalars -= 32;
+    }
+    ab_vec = _mm512_fmadd_ph(_mm512_castsi512_ph(a_i16_vec), _mm512_castsi512_ph(b_i16_vec), ab_vec);
+    if (count_scalars) goto simsimd_dot_f16_sapphire_cycle;
+
+    *result = _mm512_reduce_add_ph(ab_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_f16c_sapphire(simsimd_f16c_t const *a_pairs, simsimd_f16c_t const *b_pairs,
+                                              simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    __m512i a_vec, b_vec;
+    __m512h ab_real_vec = _mm512_setzero_ph();
+    __m512h ab_imag_vec = _mm512_setzero_ph();
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set1_epi32(0x80000000);
+    __m512i const swap_adjacent_vec = _mm512_set_epi8(                  //
+        61, 60, 63, 62, 57, 56, 59, 58, 53, 52, 55, 54, 49, 48, 51, 50, // 4th 128-bit lane
+        45, 44, 47, 46, 41, 40, 43, 42, 37, 36, 39, 38, 33, 32, 35, 34, // 3rd 128-bit lane
+        29, 28, 31, 30, 25, 24, 27, 26, 21, 20, 23, 22, 17, 16, 19, 18, // 2nd 128-bit lane
+        13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2            // 1st 128-bit lane
+    );
+
+simsimd_dot_f16c_sapphire_cycle:
+    if (count_pairs < 16) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, count_pairs * 2);
+        a_vec = _mm512_maskz_loadu_epi16(mask, a_pairs);
+        b_vec = _mm512_maskz_loadu_epi16(mask, b_pairs);
+        count_pairs = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_epi16(a_pairs);
+        b_vec = _mm512_loadu_epi16(b_pairs);
+        a_pairs += 16, b_pairs += 16, count_pairs -= 16;
+    }
+    // TODO: Consider using `_mm512_fmaddsub` and `_mm512_fcmadd_pch`
+    ab_real_vec = _mm512_fmadd_ph(_mm512_castsi512_ph(_mm512_xor_si512(b_vec, sign_flip_vec)),
+                                  _mm512_castsi512_ph(a_vec), ab_real_vec);
+    ab_imag_vec = _mm512_fmadd_ph(_mm512_castsi512_ph(_mm512_shuffle_epi8(b_vec, swap_adjacent_vec)),
+                                  _mm512_castsi512_ph(a_vec), ab_imag_vec);
+    if (count_pairs) goto simsimd_dot_f16c_sapphire_cycle;
+
+    // Reduce horizontal sums:
+    // TODO: Optimize this with tree-like reductions
+    results[0] = _mm512_reduce_add_ph(ab_real_vec);
+    results[1] = _mm512_reduce_add_ph(ab_imag_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_vdot_f16c_sapphire(simsimd_f16c_t const *a_pairs, simsimd_f16c_t const *b_pairs,
+                                               simsimd_size_t count_pairs, simsimd_distance_t *results) {
+    __m512i a_vec, b_vec;
+    __m512h ab_real_vec = _mm512_setzero_ph();
+    __m512h ab_imag_vec = _mm512_setzero_ph();
+
+    // We take into account, that FMS is the same as FMA with a negative multiplier.
+    // To multiply a floating-point value by -1, we can use the `XOR` instruction to flip the sign bit.
+    // This way we can avoid the shuffling and the need for separate real and imaginary parts.
+    // For the imaginary part of the product, we would need to swap the real and imaginary parts of
+    // one of the vectors.
+    __m512i const sign_flip_vec = _mm512_set1_epi32(0x80000000);
+    __m512i const swap_adjacent_vec = _mm512_set_epi8(                  //
+        61, 60, 63, 62, 57, 56, 59, 58, 53, 52, 55, 54, 49, 48, 51, 50, // 4th 128-bit lane
+        45, 44, 47, 46, 41, 40, 43, 42, 37, 36, 39, 38, 33, 32, 35, 34, // 3rd 128-bit lane
+        29, 28, 31, 30, 25, 24, 27, 26, 21, 20, 23, 22, 17, 16, 19, 18, // 2nd 128-bit lane
+        13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2            // 1st 128-bit lane
+    );
+
+simsimd_dot_f16c_sapphire_cycle:
+    if (count_pairs < 16) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, count_pairs * 2);
+        a_vec = _mm512_maskz_loadu_epi16(mask, a_pairs);
+        b_vec = _mm512_maskz_loadu_epi16(mask, b_pairs);
+        count_pairs = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_epi16(a_pairs);
+        b_vec = _mm512_loadu_epi16(b_pairs);
+        a_pairs += 16, b_pairs += 16, count_pairs -= 16;
+    }
+    // TODO: Consider using `_mm512_fmaddsub` and `_mm512_fcmadd_pch`
+    ab_real_vec = _mm512_fmadd_ph(_mm512_castsi512_ph(a_vec), _mm512_castsi512_ph(b_vec), ab_real_vec);
+    a_vec = _mm512_xor_si512(a_vec, sign_flip_vec);
+    b_vec = _mm512_shuffle_epi8(b_vec, swap_adjacent_vec);
+    ab_imag_vec = _mm512_fmadd_ph(_mm512_castsi512_ph(a_vec), _mm512_castsi512_ph(b_vec), ab_imag_vec);
+    if (count_pairs) goto simsimd_dot_f16c_sapphire_cycle;
+
+    // Reduce horizontal sums:
+    results[0] = _mm512_reduce_add_ph(ab_real_vec);
+    results[1] = _mm512_reduce_add_ph(ab_imag_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SAPPHIRE
+
+#if SIMSIMD_TARGET_ICE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512bw", "avx512vnni")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512bw,avx512vnni"))), \
+                             apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_dot_i8_ice(simsimd_i8_t const *a_scalars, simsimd_i8_t const *b_scalars,
+                                       simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    __m512i a_i16_vec, b_i16_vec;
+    __m512i ab_i32_vec = _mm512_setzero_si512();
+
+simsimd_dot_i8_ice_cycle:
+    if (count_scalars < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, count_scalars);
+        a_i16_vec = _mm512_cvtepi8_epi16(_mm256_maskz_loadu_epi8(mask, a_scalars));
+        b_i16_vec = _mm512_cvtepi8_epi16(_mm256_maskz_loadu_epi8(mask, b_scalars));
+        count_scalars = 0;
+    }
+    else {
+        a_i16_vec = _mm512_cvtepi8_epi16(_mm256_lddqu_si256((__m256i const *)a_scalars));
+        b_i16_vec = _mm512_cvtepi8_epi16(_mm256_lddqu_si256((__m256i const *)b_scalars));
+        a_scalars += 32, b_scalars += 32, count_scalars -= 32;
+    }
+    // Unfortunately we can't use the `_mm512_dpbusd_epi32` intrinsics here either,
+    // as it's asymmetric with respect to the sign of the input arguments:
+    //      Signed(ZeroExtend16(a_scalars.byte[4*j]) * SignExtend16(b_scalars.byte[4*j]))
+    // So we have to use the `_mm512_dpwssd_epi32` intrinsics instead, upcasting
+    // to 16-bit beforehand.
+    ab_i32_vec = _mm512_dpwssd_epi32(ab_i32_vec, a_i16_vec, b_i16_vec);
+    if (count_scalars) goto simsimd_dot_i8_ice_cycle;
+
+    *result = _mm512_reduce_add_epi32(ab_i32_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_dot_u8_ice(simsimd_u8_t const *a_scalars, simsimd_u8_t const *b_scalars,
+                                       simsimd_size_t count_scalars, simsimd_distance_t *result) {
+    __m512i a_u8_vec, b_u8_vec;
+    __m512i a_i16_low_vec, a_i16_high_vec, b_i16_low_vec, b_i16_high_vec;
+    __m512i ab_i32_low_vec = _mm512_setzero_si512();
+    __m512i ab_i32_high_vec = _mm512_setzero_si512();
+    __m512i const zeros_vec = _mm512_setzero_si512();
+
+simsimd_dot_u8_ice_cycle:
+    if (count_scalars < 64) {
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, count_scalars);
+        a_u8_vec = _mm512_maskz_loadu_epi8(mask, a_scalars);
+        b_u8_vec = _mm512_maskz_loadu_epi8(mask, b_scalars);
+        count_scalars = 0;
+    }
+    else {
+        a_u8_vec = _mm512_loadu_si512(a_scalars);
+        b_u8_vec = _mm512_loadu_si512(b_scalars);
+        a_scalars += 64, b_scalars += 64, count_scalars -= 64;
+    }
+
+    // Upcast `uint8` to `int16`. Unlike the signed version, we can use the unpacking
+    // instructions instead of extracts, as they are much faster and more efficient.
+    a_i16_low_vec = _mm512_unpacklo_epi8(a_u8_vec, zeros_vec);
+    a_i16_high_vec = _mm512_unpackhi_epi8(a_u8_vec, zeros_vec);
+    b_i16_low_vec = _mm512_unpacklo_epi8(b_u8_vec, zeros_vec);
+    b_i16_high_vec = _mm512_unpackhi_epi8(b_u8_vec, zeros_vec);
+    // Unfortunately we can't use the `_mm512_dpbusd_epi32` intrinsics here either,
+    // as it's asymmetric with respect to the sign of the input arguments:
+    //      Signed(ZeroExtend16(a.byte[4*j]) * SignExtend16(b.byte[4*j]))
+    // So we have to use the `_mm512_dpwssd_epi32` intrinsics instead, upcasting
+    // to 16-bit beforehand.
+    ab_i32_low_vec = _mm512_dpwssd_epi32(ab_i32_low_vec, a_i16_low_vec, b_i16_low_vec);
+    ab_i32_high_vec = _mm512_dpwssd_epi32(ab_i32_high_vec, a_i16_high_vec, b_i16_high_vec);
+    if (count_scalars) goto simsimd_dot_u8_ice_cycle;
+
+    *result = _mm512_reduce_add_epi32(_mm512_add_epi32(ab_i32_low_vec, ab_i32_high_vec));
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_ICE
+
+#if SIMSIMD_TARGET_SIERRA
+#pragma GCC push_options
+#pragma GCC target("avx2", "bmi2", "avx2vnni")
+#pragma clang attribute push(__attribute__((target("avx2,bmi2,avx2vnni"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_dot_i8_sierra(simsimd_i8_t const *a_scalars, simsimd_i8_t const *b_scalars,
+                                          simsimd_size_t count_scalars, simsimd_distance_t *result) {
+
+    __m256i ab_i32_vec = _mm256_setzero_si256();
+    simsimd_size_t idx_scalars = 0;
+    for (; idx_scalars + 32 <= count_scalars; idx_scalars += 32) {
+        __m256i a_i8_vec = _mm256_lddqu_si256((__m256i const *)(a_scalars + idx_scalars));
+        __m256i b_i8_vec = _mm256_lddqu_si256((__m256i const *)(b_scalars + idx_scalars));
+        ab_i32_vec = _mm256_dpbssds_epi32(ab_i32_vec, a_i8_vec, b_i8_vec);
+    }
+
+    // Further reduce to a single sum for each vector
+    int ab = _simsimd_reduce_i32x8_haswell(ab_i32_vec);
+
+    // Take care of the tail:
+    for (; idx_scalars < count_scalars; ++idx_scalars) ab += (int)(a_scalars[idx_scalars]) * b_scalars[idx_scalars];
+    *result = ab;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SIERRA
+#endif // _SIMSIMD_TARGET_X86
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/elementwise.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/elementwise.h
new file mode 100644
index 0000000000..fb3e72a569
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/elementwise.h
@@ -0,0 +1,2456 @@
+/**
+ *  @file       elementwise.h
+ *  @brief      SIMD-accelerated mixed-precision element-wise operations.
+ *  @author     Ash Vardanian
+ *  @date       October 16, 2024
+ *
+ *  Contains following element-wise operations:
+ *  - Sum (Add): R[i] = A[i] + B[i]
+ *  - Scale (Multiply): R[i] = Alpha * A[i]
+ *  - WSum or Weighted-Sum: R[i] = Alpha * A[i] + Beta * B[i]
+ *  - FMA or Fused-Multiply-Add: R[i] = Alpha * A[i] * B[i] + Beta * C[i]
+ *
+ *  This tiny set of operations if enough to implement a wide range of algorithms.
+ *  To scale a vector by a scalar, just call WSum with $Beta$ = 0.
+ *  To sum two vectors, just call WSum with $Alpha$ = $Beta$ = 1.
+ *  To average two vectors, just call WSum with $Alpha$ = $Beta$ = 0.5.
+ *  To multiply vectors element-wise, just call FMA with $Beta$ = 0.
+ *
+ *  For datatypes:
+ *  - 64-bit IEEE floating point numbers
+ *  - 32-bit IEEE floating point numbers
+ *  - 16-bit IEEE floating point numbers
+ *  - 16-bit brain floating point numbers
+ *  - 8-bit unsigned integers
+ *  - 8-bit signed integers
+ *
+ *  For hardware architectures:
+ *  - Arm: NEON
+ *  - x86: Haswell, Skylake, Sapphire
+ *
+ *  We use `f16` for `i8` and `u8` arithmetic. This is because Arm received `f16` support earlier than `bf16`.
+ *  For example, Apple M1 has `f16` support and `bf16` was only added in M2. On the other hand, on paper,
+ *  AMD Genoa has `bf16` support, and `f16` is only available on Intel Sapphire Rapids and newer.
+ *  Sadly, the SIMD support for `bf16` is limited to mixed-precision dot-products, which makes it useless here.
+ *
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide/
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics/
+ */
+#ifndef SIMSIMD_ELEMENTWISE_H
+#define SIMSIMD_ELEMENTWISE_H
+
+#include "types.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*  Serial backends for all numeric types.
+ *  By default they use 32-bit arithmetic, unless the arguments themselves contain 64-bit floats.
+ *  For double-precision computation check out the "*_accurate" variants of those "*_serial" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_wsum_f64_serial(                          //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_f32_serial(                          //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_f16_serial(                          //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_bf16_serial(                           //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_i8_serial(                         //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_u8_serial(                         //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result);
+
+SIMSIMD_PUBLIC void simsimd_fma_f64_serial(                                                   //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_f64_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_f32_serial(                                                   //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_f16_serial(                                                   //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_bf16_serial(                                                     //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_i8_serial(                                                 //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_i8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_u8_serial(                                                 //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_u8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result);
+
+#define SIMSIMD_MAKE_WSUM(name, input_type, accumulator_type, load_and_convert, convert_and_store)   \
+    SIMSIMD_PUBLIC void simsimd_wsum_##input_type##_##name(                                          \
+        simsimd_##input_type##_t const *a, simsimd_##input_type##_t const *b, simsimd_size_t n,      \
+        simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_##input_type##_t *result) {       \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                    \
+            simsimd_##accumulator_type##_t ai = load_and_convert(a + i);                             \
+            simsimd_##accumulator_type##_t bi = load_and_convert(b + i);                             \
+            simsimd_##accumulator_type##_t ai_scaled = (simsimd_##accumulator_type##_t)(ai * alpha); \
+            simsimd_##accumulator_type##_t bi_scaled = (simsimd_##accumulator_type##_t)(bi * beta);  \
+            simsimd_##accumulator_type##_t sum = ai_scaled + bi_scaled;                              \
+            convert_and_store(sum, result + i);                                                      \
+        }                                                                                            \
+    }
+
+#define SIMSIMD_MAKE_FMA(name, input_type, accumulator_type, load_and_convert, convert_and_store)                \
+    SIMSIMD_PUBLIC void simsimd_fma_##input_type##_##name(                                                       \
+        simsimd_##input_type##_t const *a, simsimd_##input_type##_t const *b, simsimd_##input_type##_t const *c, \
+        simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_##input_type##_t *result) { \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                                \
+            simsimd_##accumulator_type##_t ai = load_and_convert(a + i);                                         \
+            simsimd_##accumulator_type##_t bi = load_and_convert(b + i);                                         \
+            simsimd_##accumulator_type##_t ci = load_and_convert(c + i);                                         \
+            simsimd_##accumulator_type##_t abi_scaled = (simsimd_##accumulator_type##_t)(ai * bi * alpha);       \
+            simsimd_##accumulator_type##_t ci_scaled = (simsimd_##accumulator_type##_t)(ci * beta);              \
+            simsimd_##accumulator_type##_t sum = abi_scaled + ci_scaled;                                         \
+            convert_and_store(sum, result + i);                                                                  \
+        }                                                                                                        \
+    }
+
+SIMSIMD_MAKE_WSUM(serial, f64, f64, SIMSIMD_DEREFERENCE, SIMSIMD_EXPORT)       // simsimd_wsum_f64_serial
+SIMSIMD_MAKE_WSUM(serial, f32, f32, SIMSIMD_DEREFERENCE, SIMSIMD_EXPORT)       // simsimd_wsum_f32_serial
+SIMSIMD_MAKE_WSUM(serial, f16, f32, SIMSIMD_F16_TO_F32, SIMSIMD_F32_TO_F16)    // simsimd_wsum_f16_serial
+SIMSIMD_MAKE_WSUM(serial, bf16, f32, SIMSIMD_BF16_TO_F32, SIMSIMD_F32_TO_BF16) // simsimd_wsum_bf16_serial
+SIMSIMD_MAKE_WSUM(serial, i8, f32, SIMSIMD_DEREFERENCE, SIMSIMD_F32_TO_I8)     // simsimd_wsum_i8_serial
+SIMSIMD_MAKE_WSUM(serial, u8, f32, SIMSIMD_DEREFERENCE, SIMSIMD_F32_TO_U8)     // simsimd_wsum_u8_serial
+
+SIMSIMD_MAKE_WSUM(accurate, f32, f64, SIMSIMD_DEREFERENCE, SIMSIMD_EXPORT)       // simsimd_wsum_f32_accurate
+SIMSIMD_MAKE_WSUM(accurate, f16, f64, SIMSIMD_F16_TO_F32, SIMSIMD_F32_TO_F16)    // simsimd_wsum_f16_accurate
+SIMSIMD_MAKE_WSUM(accurate, bf16, f64, SIMSIMD_BF16_TO_F32, SIMSIMD_F32_TO_BF16) // simsimd_wsum_bf16_accurate
+SIMSIMD_MAKE_WSUM(accurate, i8, f64, SIMSIMD_DEREFERENCE, SIMSIMD_F64_TO_I8)     // simsimd_wsum_i8_accurate
+SIMSIMD_MAKE_WSUM(accurate, u8, f64, SIMSIMD_DEREFERENCE, SIMSIMD_F64_TO_U8)     // simsimd_wsum_u8_accurate
+
+SIMSIMD_MAKE_FMA(serial, f64, f64, SIMSIMD_DEREFERENCE, SIMSIMD_EXPORT)       // simsimd_fma_f64_serial
+SIMSIMD_MAKE_FMA(serial, f32, f32, SIMSIMD_DEREFERENCE, SIMSIMD_EXPORT)       // simsimd_fma_f32_serial
+SIMSIMD_MAKE_FMA(serial, f16, f32, SIMSIMD_F16_TO_F32, SIMSIMD_F32_TO_F16)    // simsimd_fma_f16_serial
+SIMSIMD_MAKE_FMA(serial, bf16, f32, SIMSIMD_BF16_TO_F32, SIMSIMD_F32_TO_BF16) // simsimd_fma_bf16_serial
+SIMSIMD_MAKE_FMA(serial, i8, f32, SIMSIMD_DEREFERENCE, SIMSIMD_F32_TO_I8)     // simsimd_fma_i8_serial
+SIMSIMD_MAKE_FMA(serial, u8, f32, SIMSIMD_DEREFERENCE, SIMSIMD_F32_TO_U8)     // simsimd_fma_u8_serial
+
+SIMSIMD_MAKE_FMA(accurate, f32, f64, SIMSIMD_DEREFERENCE, SIMSIMD_EXPORT)       // simsimd_fma_f32_accurate
+SIMSIMD_MAKE_FMA(accurate, f16, f64, SIMSIMD_F16_TO_F32, SIMSIMD_F32_TO_F16)    // simsimd_fma_f16_accurate
+SIMSIMD_MAKE_FMA(accurate, bf16, f64, SIMSIMD_BF16_TO_F32, SIMSIMD_F32_TO_BF16) // simsimd_fma_bf16_accurate
+SIMSIMD_MAKE_FMA(accurate, i8, f64, SIMSIMD_DEREFERENCE, SIMSIMD_F64_TO_I8)     // simsimd_fma_i8_accurate
+SIMSIMD_MAKE_FMA(accurate, u8, f64, SIMSIMD_DEREFERENCE, SIMSIMD_F64_TO_U8)     // simsimd_fma_u8_accurate
+
+/*  SIMD-powered backends for Arm NEON, mostly using 32-bit arithmetic over 128-bit words.
+ *  By far the most portable backend, covering most Arm v8 devices, over a billion phones, and almost all
+ *  server CPUs produced before 2023.
+ */
+SIMSIMD_PUBLIC void simsimd_wsum_f32_neon(                            //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_f16_neon(                            //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_bf16_neon(                             //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_u8_neon(                           //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_i8_neon(                           //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result);
+
+SIMSIMD_PUBLIC void simsimd_fma_f32_neon(                                   //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_f16_neon(                                   //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_bf16_neon(                                     //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_u8_neon(                                 //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_u8_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_i8_neon(                                 //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_i8_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result);
+
+/*  SIMD-powered backends for AVX2 CPUs of Haswell generation and newer, using 32-bit arithmetic over 256-bit words.
+ *  First demonstrated in 2011, at least one Haswell-based processor was still being sold in 2022 — the Pentium G3420.
+ *  Practically all modern x86 CPUs support AVX2, FMA, and F16C, making it a perfect baseline for SIMD algorithms.
+ *  On other hand, there is no need to implement AVX2 versions of `f32` and `f64` functions, as those are
+ *  properly vectorized by recent compilers.
+ */
+SIMSIMD_PUBLIC void simsimd_wsum_f64_haswell(                         //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_f32_haswell(                         //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_f16_haswell(                         //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_bf16_haswell(                          //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_i8_haswell(                        //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_u8_haswell(                        //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_f64_haswell(                                                  //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_f64_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_f32_haswell(                                                  //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_f16_haswell(                                                  //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_bf16_haswell(                                                    //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_i8_haswell(                                                //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_i8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_u8_haswell(                                                //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_u8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result);
+
+/*  SIMD-powered backends for various generations of AVX512 CPUs.
+ *  Unlike the distance metrics, the SIMD implementation of FMA and WSum benefits from aligned stores.
+ *  Assuming the size of ZMM register matches the width of the cache line, we skip the unaligned head
+ *  and tail of the output buffer, and only use aligned stores in the main loop.
+ */
+SIMSIMD_PUBLIC void simsimd_wsum_f64_skylake(                         //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_f32_skylake(                         //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_bf16_skylake(                          //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result);
+
+SIMSIMD_PUBLIC void simsimd_fma_f64_skylake(                                                  //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_f64_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_f32_skylake(                                                  //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_bf16_skylake(                                                    //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result);
+
+SIMSIMD_PUBLIC void simsimd_wsum_f16_sapphire(                        //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_i8_sapphire(                       //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result);
+SIMSIMD_PUBLIC void simsimd_wsum_u8_sapphire(                       //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result);
+
+SIMSIMD_PUBLIC void simsimd_fma_f16_sapphire(                                                 //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_i8_sapphire(                                               //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_i8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result);
+SIMSIMD_PUBLIC void simsimd_fma_u8_sapphire(                                               //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_u8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result);
+
+#if _SIMSIMD_TARGET_X86
+#if SIMSIMD_TARGET_HASWELL
+#pragma GCC push_options
+#pragma GCC target("avx2", "f16c", "fma")
+#pragma clang attribute push(__attribute__((target("avx2,f16c,fma"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_sum_f32_haswell(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                            simsimd_f32_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m256 a_vec = _mm256_loadu_ps(a + i);
+        __m256 b_vec = _mm256_loadu_ps(b + i);
+        __m256 sum_vec = _mm256_add_ps(a_vec, b_vec);
+        _mm256_storeu_ps(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = a[i] + b[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_f32_haswell(simsimd_f32_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                              simsimd_f32_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m256 a_vec = _mm256_loadu_ps(a + i);
+        __m256 sum_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        _mm256_storeu_ps(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = alpha_f32 * a[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f32_haswell(                         //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_f32_haswell(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_f32_haswell(a, n, alpha, result); }
+        else { simsimd_scale_f32_haswell(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m256 a_vec = _mm256_loadu_ps(a + i);
+        __m256 b_vec = _mm256_loadu_ps(b + i);
+        __m256 a_scaled_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        __m256 b_scaled_vec = _mm256_mul_ps(b_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(a_scaled_vec, b_scaled_vec);
+        _mm256_storeu_ps(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = alpha_f32 * a[i] + beta_f32 * b[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_f64_haswell(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                            simsimd_f64_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        __m256d a_vec = _mm256_loadu_pd(a + i);
+        __m256d b_vec = _mm256_loadu_pd(b + i);
+        __m256d sum_vec = _mm256_add_pd(a_vec, b_vec);
+        _mm256_storeu_pd(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = a[i] + b[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_f64_haswell(simsimd_f64_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                              simsimd_f64_t *result) {
+    __m256d alpha_vec = _mm256_set1_pd(alpha);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        __m256d a_vec = _mm256_loadu_pd(a + i);
+        __m256d sum_vec = _mm256_mul_pd(a_vec, alpha_vec);
+        _mm256_storeu_pd(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = alpha * a[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f64_haswell(                         //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_f64_haswell(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_f64_haswell(a, n, alpha, result); }
+        else { simsimd_scale_f64_haswell(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    __m256d alpha_vec = _mm256_set1_pd(alpha);
+    __m256d beta_vec = _mm256_set1_pd(beta);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        __m256d a_vec = _mm256_loadu_pd(a + i);
+        __m256d b_vec = _mm256_loadu_pd(b + i);
+        __m256d a_scaled_vec = _mm256_mul_pd(a_vec, alpha_vec);
+        __m256d b_scaled_vec = _mm256_mul_pd(b_vec, beta_vec);
+        __m256d sum_vec = _mm256_add_pd(a_scaled_vec, b_scaled_vec);
+        _mm256_storeu_pd(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = alpha * a[i] + beta * b[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_f16_haswell(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                            simsimd_f16_t *result) {
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m128i a_f16 = _mm_lddqu_si128((__m128i const *)(a + i));
+        __m128i b_f16 = _mm_lddqu_si128((__m128i const *)(b + i));
+        __m256 a_vec = _mm256_cvtph_ps(a_f16);
+        __m256 b_vec = _mm256_cvtph_ps(b_f16);
+        __m256 sum_vec = _mm256_add_ps(a_vec, b_vec);
+        __m128i sum_f16 = _mm256_cvtps_ph(sum_vec, _MM_FROUND_TO_NEAREST_INT | _MM_FROUND_NO_EXC);
+        _mm_storeu_si128((__m128i *)(result + i), sum_f16);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = SIMSIMD_F16_TO_F32(a + i);
+        simsimd_f32_t bi = SIMSIMD_F16_TO_F32(b + i);
+        simsimd_f32_t sum = ai + bi;
+        SIMSIMD_F32_TO_F16(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_f16_haswell(simsimd_f16_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                              simsimd_f16_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m128i a_f16 = _mm_lddqu_si128((__m128i const *)(a + i));
+        __m256 a_vec = _mm256_cvtph_ps(a_f16);
+        __m256 sum_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        __m128i sum_f16 = _mm256_cvtps_ph(sum_vec, _MM_FROUND_TO_NEAREST_INT | _MM_FROUND_NO_EXC);
+        _mm_storeu_si128((__m128i *)(result + i), sum_f16);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = SIMSIMD_F16_TO_F32(a + i);
+        simsimd_f32_t sum = alpha_f32 * ai;
+        SIMSIMD_F32_TO_F16(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f16_haswell(                         //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_f16_haswell(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_f16_haswell(a, n, alpha, result); }
+        else { simsimd_scale_f16_haswell(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m128i a_f16 = _mm_lddqu_si128((__m128i const *)(a + i));
+        __m128i b_f16 = _mm_lddqu_si128((__m128i const *)(b + i));
+        __m256 a_vec = _mm256_cvtph_ps(a_f16);
+        __m256 b_vec = _mm256_cvtph_ps(b_f16);
+        __m256 a_scaled_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        __m256 b_scaled_vec = _mm256_mul_ps(b_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(a_scaled_vec, b_scaled_vec);
+        __m128i sum_f16 = _mm256_cvtps_ph(sum_vec, _MM_FROUND_TO_NEAREST_INT | _MM_FROUND_NO_EXC);
+        _mm_storeu_si128((__m128i *)(result + i), sum_f16);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = SIMSIMD_F16_TO_F32(a + i);
+        simsimd_f32_t bi = SIMSIMD_F16_TO_F32(b + i);
+        simsimd_f32_t sum = alpha_f32 * ai + beta_f32 * bi;
+        SIMSIMD_F32_TO_F16(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_bf16_haswell(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                             simsimd_bf16_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m128i a_bf16 = _mm_lddqu_si128((__m128i const *)(a + i));
+        __m128i b_bf16 = _mm_lddqu_si128((__m128i const *)(b + i));
+        __m256 a_vec = _simsimd_bf16x8_to_f32x8_haswell(a_bf16);
+        __m256 b_vec = _simsimd_bf16x8_to_f32x8_haswell(b_bf16);
+        __m256 sum_vec = _mm256_add_ps(a_vec, b_vec);
+        __m128i sum_bf16 = _simsimd_f32x8_to_bf16x8_haswell(sum_vec);
+        _mm_storeu_si128((__m128i *)(result + i), sum_bf16);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = SIMSIMD_BF16_TO_F32(a + i);
+        simsimd_f32_t bi = SIMSIMD_BF16_TO_F32(b + i);
+        simsimd_f32_t sum = ai + bi;
+        SIMSIMD_F32_TO_BF16(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_bf16_haswell(simsimd_bf16_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                               simsimd_bf16_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m128i a_bf16 = _mm_lddqu_si128((__m128i const *)(a + i));
+        __m256 a_vec = _simsimd_bf16x8_to_f32x8_haswell(a_bf16);
+        __m256 sum_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        __m128i sum_bf16 = _simsimd_f32x8_to_bf16x8_haswell(sum_vec);
+        _mm_storeu_si128((__m128i *)(result + i), sum_bf16);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = SIMSIMD_BF16_TO_F32(a + i);
+        simsimd_f32_t sum = alpha_f32 * ai;
+        SIMSIMD_F32_TO_BF16(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_bf16_haswell(                          //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_bf16_haswell(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_bf16_haswell(a, n, alpha, result); }
+        else { simsimd_scale_bf16_haswell(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m128i a_bf16 = _mm_lddqu_si128((__m128i const *)(a + i));
+        __m128i b_bf16 = _mm_lddqu_si128((__m128i const *)(b + i));
+        __m256 a_vec = _simsimd_bf16x8_to_f32x8_haswell(a_bf16);
+        __m256 b_vec = _simsimd_bf16x8_to_f32x8_haswell(b_bf16);
+        __m256 a_scaled_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        __m256 b_scaled_vec = _mm256_mul_ps(b_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(a_scaled_vec, b_scaled_vec);
+        __m128i sum_bf16 = _simsimd_f32x8_to_bf16x8_haswell(sum_vec);
+        _mm_storeu_si128((__m128i *)(result + i), sum_bf16);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = SIMSIMD_BF16_TO_F32(a + i);
+        simsimd_f32_t bi = SIMSIMD_BF16_TO_F32(b + i);
+        simsimd_f32_t sum = alpha_f32 * ai + beta_f32 * bi;
+        SIMSIMD_F32_TO_BF16(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f32_haswell(                                //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m256 a_vec = _mm256_loadu_ps(a + i);
+        __m256 b_vec = _mm256_loadu_ps(b + i);
+        __m256 c_vec = _mm256_loadu_ps(c + i);
+        __m256 ab_vec = _mm256_mul_ps(a_vec, b_vec);
+        __m256 ab_scaled_vec = _mm256_mul_ps(ab_vec, alpha_vec);
+        __m256 c_scaled_vec = _mm256_mul_ps(c_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(ab_scaled_vec, c_scaled_vec);
+        _mm256_storeu_ps(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = alpha_f32 * a[i] * b[i] + beta_f32 * c[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f64_haswell(                                //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_f64_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result) {
+    __m256d alpha_vec = _mm256_set1_pd(alpha);
+    __m256d beta_vec = _mm256_set1_pd(beta);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        __m256d a_vec = _mm256_loadu_pd(a + i);
+        __m256d b_vec = _mm256_loadu_pd(b + i);
+        __m256d c_vec = _mm256_loadu_pd(c + i);
+        __m256d ab_vec = _mm256_mul_pd(a_vec, b_vec);
+        __m256d ab_scaled_vec = _mm256_mul_pd(ab_vec, alpha_vec);
+        __m256d c_scaled_vec = _mm256_mul_pd(c_vec, beta_vec);
+        __m256d sum_vec = _mm256_add_pd(ab_scaled_vec, c_scaled_vec);
+        _mm256_storeu_pd(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = alpha * a[i] * b[i] + beta * c[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f16_haswell(                                //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m128i a_f16 = _mm_lddqu_si128((__m128i const *)(a + i));
+        __m128i b_f16 = _mm_lddqu_si128((__m128i const *)(b + i));
+        __m128i c_f16 = _mm_lddqu_si128((__m128i const *)(c + i));
+        __m256 a_vec = _mm256_cvtph_ps(a_f16);
+        __m256 b_vec = _mm256_cvtph_ps(b_f16);
+        __m256 c_vec = _mm256_cvtph_ps(c_f16);
+        __m256 ab_vec = _mm256_mul_ps(a_vec, b_vec);
+        __m256 ab_scaled_vec = _mm256_mul_ps(ab_vec, alpha_vec);
+        __m256 c_scaled_vec = _mm256_mul_ps(c_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(ab_scaled_vec, c_scaled_vec);
+        __m128i sum_f16 = _mm256_cvtps_ph(sum_vec, _MM_FROUND_TO_NEAREST_INT | _MM_FROUND_NO_EXC);
+        _mm_storeu_si128((__m128i *)(result + i), sum_f16);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = SIMSIMD_F16_TO_F32(a + i);
+        simsimd_f32_t bi = SIMSIMD_F16_TO_F32(b + i);
+        simsimd_f32_t ci = SIMSIMD_F16_TO_F32(c + i);
+        simsimd_f32_t sum = alpha * ai * bi + beta * ci;
+        SIMSIMD_F32_TO_F16(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_bf16_haswell(                                  //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m128i a_bf16 = _mm_lddqu_si128((__m128i const *)(a + i));
+        __m128i b_bf16 = _mm_lddqu_si128((__m128i const *)(b + i));
+        __m128i c_bf16 = _mm_lddqu_si128((__m128i const *)(c + i));
+        __m256 a_vec = _simsimd_bf16x8_to_f32x8_haswell(a_bf16);
+        __m256 b_vec = _simsimd_bf16x8_to_f32x8_haswell(b_bf16);
+        __m256 c_vec = _simsimd_bf16x8_to_f32x8_haswell(c_bf16);
+        __m256 ab_vec = _mm256_mul_ps(a_vec, b_vec);
+        __m256 ab_scaled_vec = _mm256_mul_ps(ab_vec, alpha_vec);
+        __m256 c_scaled_vec = _mm256_mul_ps(c_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(ab_scaled_vec, c_scaled_vec);
+        __m128i sum_bf16 = _simsimd_f32x8_to_bf16x8_haswell(sum_vec);
+        _mm_storeu_si128((__m128i *)(result + i), sum_bf16);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = SIMSIMD_BF16_TO_F32(a + i);
+        simsimd_f32_t bi = SIMSIMD_BF16_TO_F32(b + i);
+        simsimd_f32_t ci = SIMSIMD_BF16_TO_F32(c + i);
+        simsimd_f32_t sum = alpha * ai * bi + beta * ci;
+        SIMSIMD_F32_TO_BF16(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_i8_haswell(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                           simsimd_i8_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 32 <= n; i += 32) {
+        __m256i a_vec = _mm256_lddqu_si256((__m256i *)(a + i));
+        __m256i b_vec = _mm256_lddqu_si256((__m256i *)(b + i));
+        __m256i sum_vec = _mm256_adds_epi8(a_vec, b_vec);
+        _mm256_storeu_si256((__m256i *)(result + i), sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = a[i], bi = b[i];
+        simsimd_f32_t sum = ai + bi;
+        SIMSIMD_F32_TO_U8(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_i8_haswell(simsimd_i8_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                             simsimd_i8_t *result) {
+
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    int sum_i32s[8], a_i32s[8];
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        //? Handling loads and stores with SIMD is tricky. Not because of upcasting, but the
+        //? downcasting at the end of the loop. In AVX2 it's a drag! Keep it for another day.
+        a_i32s[0] = a[i + 0], a_i32s[1] = a[i + 1], a_i32s[2] = a[i + 2], a_i32s[3] = a[i + 3], //
+            a_i32s[4] = a[i + 4], a_i32s[5] = a[i + 5], a_i32s[6] = a[i + 6], a_i32s[7] = a[i + 7];
+        //! This can be done at least 50% faster if we convert 8-bit integers to floats instead
+        //! of relying on the slow `_mm256_cvtepi32_ps` instruction.
+        __m256 a_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)a_i32s));
+        // The normal part.
+        __m256 sum_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        // Instead of serial calls to expensive `SIMSIMD_F32_TO_U8`, convert and clip with SIMD.
+        __m256i sum_i32_vec = _mm256_cvtps_epi32(sum_vec);
+        sum_i32_vec = _mm256_max_epi32(sum_i32_vec, _mm256_set1_epi32(-128));
+        sum_i32_vec = _mm256_min_epi32(sum_i32_vec, _mm256_set1_epi32(127));
+        // Export into a serial buffer.
+        _mm256_storeu_si256((__m256i *)sum_i32s, sum_i32_vec);
+        result[i + 0] = (simsimd_i8_t)sum_i32s[0];
+        result[i + 1] = (simsimd_i8_t)sum_i32s[1];
+        result[i + 2] = (simsimd_i8_t)sum_i32s[2];
+        result[i + 3] = (simsimd_i8_t)sum_i32s[3];
+        result[i + 4] = (simsimd_i8_t)sum_i32s[4];
+        result[i + 5] = (simsimd_i8_t)sum_i32s[5];
+        result[i + 6] = (simsimd_i8_t)sum_i32s[6];
+        result[i + 7] = (simsimd_i8_t)sum_i32s[7];
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = a[i];
+        simsimd_f32_t sum = alpha_f32 * ai;
+        SIMSIMD_F32_TO_I8(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_i8_haswell(                        //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_i8_haswell(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_i8_haswell(a, n, alpha, result); }
+        else { simsimd_scale_i8_haswell(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+    int sum_i32s[8], a_i32s[8], b_i32s[8];
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        //? Handling loads and stores with SIMD is tricky. Not because of upcasting, but the
+        //? downcasting at the end of the loop. In AVX2 it's a drag! Keep it for another day.
+        a_i32s[0] = a[i + 0], a_i32s[1] = a[i + 1], a_i32s[2] = a[i + 2], a_i32s[3] = a[i + 3], //
+            a_i32s[4] = a[i + 4], a_i32s[5] = a[i + 5], a_i32s[6] = a[i + 6], a_i32s[7] = a[i + 7];
+        b_i32s[0] = b[i + 0], b_i32s[1] = b[i + 1], b_i32s[2] = b[i + 2], b_i32s[3] = b[i + 3], //
+            b_i32s[4] = b[i + 4], b_i32s[5] = b[i + 5], b_i32s[6] = b[i + 6], b_i32s[7] = b[i + 7];
+        //! This can be done at least 50% faster if we convert 8-bit integers to floats instead
+        //! of relying on the slow `_mm256_cvtepi32_ps` instruction.
+        __m256 a_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)a_i32s));
+        __m256 b_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)b_i32s));
+        // The normal part.
+        __m256 a_scaled_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        __m256 b_scaled_vec = _mm256_mul_ps(b_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(a_scaled_vec, b_scaled_vec);
+        // Instead of serial calls to expensive `SIMSIMD_F32_TO_U8`, convert and clip with SIMD.
+        __m256i sum_i32_vec = _mm256_cvtps_epi32(sum_vec);
+        sum_i32_vec = _mm256_max_epi32(sum_i32_vec, _mm256_set1_epi32(-128));
+        sum_i32_vec = _mm256_min_epi32(sum_i32_vec, _mm256_set1_epi32(127));
+        // Export into a serial buffer.
+        _mm256_storeu_si256((__m256i *)sum_i32s, sum_i32_vec);
+        result[i + 0] = (simsimd_i8_t)sum_i32s[0];
+        result[i + 1] = (simsimd_i8_t)sum_i32s[1];
+        result[i + 2] = (simsimd_i8_t)sum_i32s[2];
+        result[i + 3] = (simsimd_i8_t)sum_i32s[3];
+        result[i + 4] = (simsimd_i8_t)sum_i32s[4];
+        result[i + 5] = (simsimd_i8_t)sum_i32s[5];
+        result[i + 6] = (simsimd_i8_t)sum_i32s[6];
+        result[i + 7] = (simsimd_i8_t)sum_i32s[7];
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = a[i], bi = b[i];
+        simsimd_f32_t sum = alpha_f32 * ai + beta_f32 * bi;
+        SIMSIMD_F32_TO_I8(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_u8_haswell(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                           simsimd_u8_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 32 <= n; i += 32) {
+        __m256i a_vec = _mm256_lddqu_si256((__m256i *)(a + i));
+        __m256i b_vec = _mm256_lddqu_si256((__m256i *)(b + i));
+        __m256i sum_vec = _mm256_adds_epu8(a_vec, b_vec);
+        _mm256_storeu_si256((__m256i *)(result + i), sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = a[i], bi = b[i];
+        simsimd_f32_t sum = ai + bi;
+        SIMSIMD_F32_TO_U8(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_u8_haswell(simsimd_u8_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                             simsimd_u8_t *result) {
+
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    int sum_i32s[8], a_i32s[8];
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        //? Handling loads and stores with SIMD is tricky. Not because of upcasting, but the
+        //? downcasting at the end of the loop. In AVX2 it's a drag! Keep it for another day.
+        a_i32s[0] = a[i + 0], a_i32s[1] = a[i + 1], a_i32s[2] = a[i + 2], a_i32s[3] = a[i + 3], //
+            a_i32s[4] = a[i + 4], a_i32s[5] = a[i + 5], a_i32s[6] = a[i + 6], a_i32s[7] = a[i + 7];
+        //! This can be done at least 50% faster if we convert 8-bit integers to floats instead
+        //! of relying on the slow `_mm256_cvtepi32_ps` instruction.
+        __m256 a_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)a_i32s));
+        // The normal part.
+        __m256 sum_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        // Instead of serial calls to expensive `SIMSIMD_F32_TO_U8`, convert and clip with SIMD.
+        __m256i sum_i32_vec = _mm256_cvtps_epi32(sum_vec);
+        sum_i32_vec = _mm256_max_epi32(sum_i32_vec, _mm256_set1_epi32(0));
+        sum_i32_vec = _mm256_min_epi32(sum_i32_vec, _mm256_set1_epi32(255));
+        // Export into a serial buffer.
+        _mm256_storeu_si256((__m256i *)sum_i32s, sum_i32_vec);
+        result[i + 0] = (simsimd_u8_t)sum_i32s[0];
+        result[i + 1] = (simsimd_u8_t)sum_i32s[1];
+        result[i + 2] = (simsimd_u8_t)sum_i32s[2];
+        result[i + 3] = (simsimd_u8_t)sum_i32s[3];
+        result[i + 4] = (simsimd_u8_t)sum_i32s[4];
+        result[i + 5] = (simsimd_u8_t)sum_i32s[5];
+        result[i + 6] = (simsimd_u8_t)sum_i32s[6];
+        result[i + 7] = (simsimd_u8_t)sum_i32s[7];
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = a[i];
+        simsimd_f32_t sum = alpha_f32 * ai;
+        SIMSIMD_F32_TO_U8(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_u8_haswell(                        //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_u8_haswell(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_u8_haswell(a, n, alpha, result); }
+        else { simsimd_scale_u8_haswell(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+    int sum_i32s[8], a_i32s[8], b_i32s[8];
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        //? Handling loads and stores with SIMD is tricky. Not because of upcasting, but the
+        //? downcasting at the end of the loop. In AVX2 it's a drag! Keep it for another day.
+        a_i32s[0] = a[i + 0], a_i32s[1] = a[i + 1], a_i32s[2] = a[i + 2], a_i32s[3] = a[i + 3], //
+            a_i32s[4] = a[i + 4], a_i32s[5] = a[i + 5], a_i32s[6] = a[i + 6], a_i32s[7] = a[i + 7];
+        b_i32s[0] = b[i + 0], b_i32s[1] = b[i + 1], b_i32s[2] = b[i + 2], b_i32s[3] = b[i + 3], //
+            b_i32s[4] = b[i + 4], b_i32s[5] = b[i + 5], b_i32s[6] = b[i + 6], b_i32s[7] = b[i + 7];
+        //! This can be done at least 50% faster if we convert 8-bit integers to floats instead
+        //! of relying on the slow `_mm256_cvtepi32_ps` instruction.
+        __m256 a_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)a_i32s));
+        __m256 b_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)b_i32s));
+        // The normal part.
+        __m256 a_scaled_vec = _mm256_mul_ps(a_vec, alpha_vec);
+        __m256 b_scaled_vec = _mm256_mul_ps(b_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(a_scaled_vec, b_scaled_vec);
+        // Instead of serial calls to expensive `SIMSIMD_F32_TO_U8`, convert and clip with SIMD.
+        __m256i sum_i32_vec = _mm256_cvtps_epi32(sum_vec);
+        sum_i32_vec = _mm256_max_epi32(sum_i32_vec, _mm256_set1_epi32(0));
+        sum_i32_vec = _mm256_min_epi32(sum_i32_vec, _mm256_set1_epi32(255));
+        // Export into a serial buffer.
+        _mm256_storeu_si256((__m256i *)sum_i32s, sum_i32_vec);
+        result[i + 0] = (simsimd_u8_t)sum_i32s[0];
+        result[i + 1] = (simsimd_u8_t)sum_i32s[1];
+        result[i + 2] = (simsimd_u8_t)sum_i32s[2];
+        result[i + 3] = (simsimd_u8_t)sum_i32s[3];
+        result[i + 4] = (simsimd_u8_t)sum_i32s[4];
+        result[i + 5] = (simsimd_u8_t)sum_i32s[5];
+        result[i + 6] = (simsimd_u8_t)sum_i32s[6];
+        result[i + 7] = (simsimd_u8_t)sum_i32s[7];
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = a[i], bi = b[i];
+        simsimd_f32_t sum = alpha_f32 * ai + beta_f32 * bi;
+        SIMSIMD_F32_TO_U8(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_i8_haswell(                                                //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_i8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result) {
+
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+    int sum_i32s[8], a_i32s[8], b_i32s[8], c_i32s[8];
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        //? Handling loads and stores with SIMD is tricky. Not because of upcasting, but the
+        //? downcasting at the end of the loop. In AVX2 it's a drag! Keep it for another day.
+        a_i32s[0] = a[i + 0], a_i32s[1] = a[i + 1], a_i32s[2] = a[i + 2], a_i32s[3] = a[i + 3], //
+            a_i32s[4] = a[i + 4], a_i32s[5] = a[i + 5], a_i32s[6] = a[i + 6], a_i32s[7] = a[i + 7];
+        b_i32s[0] = b[i + 0], b_i32s[1] = b[i + 1], b_i32s[2] = b[i + 2], b_i32s[3] = b[i + 3], //
+            b_i32s[4] = b[i + 4], b_i32s[5] = b[i + 5], b_i32s[6] = b[i + 6], b_i32s[7] = b[i + 7];
+        c_i32s[0] = c[i + 0], c_i32s[1] = c[i + 1], c_i32s[2] = c[i + 2], c_i32s[3] = c[i + 3], //
+            c_i32s[4] = c[i + 4], c_i32s[5] = c[i + 5], c_i32s[6] = c[i + 6], c_i32s[7] = c[i + 7];
+        //! This can be done at least 50% faster if we convert 8-bit integers to floats instead
+        //! of relying on the slow `_mm256_cvtepi32_ps` instruction.
+        __m256 a_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)a_i32s));
+        __m256 b_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)b_i32s));
+        __m256 c_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)c_i32s));
+        // The normal part.
+        __m256 ab_vec = _mm256_mul_ps(a_vec, b_vec);
+        __m256 ab_scaled_vec = _mm256_mul_ps(ab_vec, alpha_vec);
+        __m256 c_scaled_vec = _mm256_mul_ps(c_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(ab_scaled_vec, c_scaled_vec);
+        // Instead of serial calls to expensive `SIMSIMD_F32_TO_U8`, convert and clip with SIMD.
+        __m256i sum_i32_vec = _mm256_cvtps_epi32(sum_vec);
+        sum_i32_vec = _mm256_max_epi32(sum_i32_vec, _mm256_set1_epi32(-128));
+        sum_i32_vec = _mm256_min_epi32(sum_i32_vec, _mm256_set1_epi32(127));
+        // Export into a serial buffer.
+        _mm256_storeu_si256((__m256i *)sum_i32s, sum_i32_vec);
+        result[i + 0] = (simsimd_i8_t)sum_i32s[0];
+        result[i + 1] = (simsimd_i8_t)sum_i32s[1];
+        result[i + 2] = (simsimd_i8_t)sum_i32s[2];
+        result[i + 3] = (simsimd_i8_t)sum_i32s[3];
+        result[i + 4] = (simsimd_i8_t)sum_i32s[4];
+        result[i + 5] = (simsimd_i8_t)sum_i32s[5];
+        result[i + 6] = (simsimd_i8_t)sum_i32s[6];
+        result[i + 7] = (simsimd_i8_t)sum_i32s[7];
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = a[i], bi = b[i], ci = c[i];
+        simsimd_f32_t sum = alpha_f32 * ai * bi + beta_f32 * ci;
+        SIMSIMD_F32_TO_I8(sum, result + i);
+    }
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_u8_haswell(                                                //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_u8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result) {
+
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+    __m256 alpha_vec = _mm256_set1_ps(alpha_f32);
+    __m256 beta_vec = _mm256_set1_ps(beta_f32);
+    int sum_i32s[8], a_i32s[8], b_i32s[8], c_i32s[8];
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        //? Handling loads and stores with SIMD is tricky. Not because of upcasting, but the
+        //? downcasting at the end of the loop. In AVX2 it's a drag! Keep it for another day.
+        a_i32s[0] = a[i + 0], a_i32s[1] = a[i + 1], a_i32s[2] = a[i + 2], a_i32s[3] = a[i + 3], //
+            a_i32s[4] = a[i + 4], a_i32s[5] = a[i + 5], a_i32s[6] = a[i + 6], a_i32s[7] = a[i + 7];
+        b_i32s[0] = b[i + 0], b_i32s[1] = b[i + 1], b_i32s[2] = b[i + 2], b_i32s[3] = b[i + 3], //
+            b_i32s[4] = b[i + 4], b_i32s[5] = b[i + 5], b_i32s[6] = b[i + 6], b_i32s[7] = b[i + 7];
+        c_i32s[0] = c[i + 0], c_i32s[1] = c[i + 1], c_i32s[2] = c[i + 2], c_i32s[3] = c[i + 3], //
+            c_i32s[4] = c[i + 4], c_i32s[5] = c[i + 5], c_i32s[6] = c[i + 6], c_i32s[7] = c[i + 7];
+        //! This can be done at least 50% faster if we convert 8-bit integers to floats instead
+        //! of relying on the slow `_mm256_cvtepi32_ps` instruction.
+        __m256 a_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)a_i32s));
+        __m256 b_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)b_i32s));
+        __m256 c_vec = _mm256_cvtepi32_ps(_mm256_lddqu_si256((__m256i *)c_i32s));
+        // The normal part.
+        __m256 ab_vec = _mm256_mul_ps(a_vec, b_vec);
+        __m256 ab_scaled_vec = _mm256_mul_ps(ab_vec, alpha_vec);
+        __m256 c_scaled_vec = _mm256_mul_ps(c_vec, beta_vec);
+        __m256 sum_vec = _mm256_add_ps(ab_scaled_vec, c_scaled_vec);
+        // Instead of serial calls to expensive `SIMSIMD_F32_TO_U8`, convert and clip with SIMD.
+        __m256i sum_i32_vec = _mm256_cvtps_epi32(sum_vec);
+        sum_i32_vec = _mm256_max_epi32(sum_i32_vec, _mm256_set1_epi32(0));
+        sum_i32_vec = _mm256_min_epi32(sum_i32_vec, _mm256_set1_epi32(255));
+        // Export into a serial buffer.
+        _mm256_storeu_si256((__m256i *)sum_i32s, sum_i32_vec);
+        result[i + 0] = (simsimd_u8_t)sum_i32s[0];
+        result[i + 1] = (simsimd_u8_t)sum_i32s[1];
+        result[i + 2] = (simsimd_u8_t)sum_i32s[2];
+        result[i + 3] = (simsimd_u8_t)sum_i32s[3];
+        result[i + 4] = (simsimd_u8_t)sum_i32s[4];
+        result[i + 5] = (simsimd_u8_t)sum_i32s[5];
+        result[i + 6] = (simsimd_u8_t)sum_i32s[6];
+        result[i + 7] = (simsimd_u8_t)sum_i32s[7];
+    }
+
+    // The tail:
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = a[i], bi = b[i], ci = c[i];
+        simsimd_f32_t sum = alpha_f32 * ai * bi + beta_f32 * ci;
+        SIMSIMD_F32_TO_U8(sum, result + i);
+    }
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_HASWELL
+
+#if SIMSIMD_TARGET_SKYLAKE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "avx512bw", "bmi2")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,avx512bw,bmi2"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_sum_f64_skylake(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                            simsimd_f64_t *result) {
+    __m512d a_vec, b_vec, sum_vec;
+    __mmask8 mask = 0xFF;
+simsimd_sum_f64_skylake_cycle:
+    if (n < 8) {
+        mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_pd(mask, a);
+        b_vec = _mm512_maskz_loadu_pd(mask, b);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_pd(a);
+        b_vec = _mm512_loadu_pd(b);
+        a += 8, b += 8, n -= 8;
+    }
+    sum_vec = _mm512_add_pd(a_vec, b_vec);
+    _mm512_mask_storeu_pd(result, mask, sum_vec);
+    result += 8;
+    if (n) goto simsimd_sum_f64_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_f64_skylake(simsimd_f64_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                              simsimd_f64_t *result) {
+    __m512d alpha_vec = _mm512_set1_pd(alpha);
+    __m512d a_vec, b_vec, a_scaled_vec, sum_vec;
+    __mmask8 mask = 0xFF;
+simsimd_scale_f64_skylake_cycle:
+    if (n < 8) {
+        mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_pd(mask, a);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_pd(a);
+        a += 8, n -= 8;
+    }
+    sum_vec = _mm512_mul_pd(a_vec, alpha_vec);
+    _mm512_mask_storeu_pd(result, mask, sum_vec);
+    result += 8;
+    if (n) goto simsimd_scale_f64_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f64_skylake(                         //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_f64_skylake(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_f64_skylake(a, n, alpha, result); }
+        else { simsimd_scale_f64_skylake(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    __m512d alpha_vec = _mm512_set1_pd(alpha);
+    __m512d beta_vec = _mm512_set1_pd(beta);
+    __m512d a_vec, b_vec, a_scaled_vec, sum_vec;
+    __mmask8 mask = 0xFF;
+simsimd_wsum_f64_skylake_cycle:
+    if (n < 8) {
+        mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_pd(mask, a);
+        b_vec = _mm512_maskz_loadu_pd(mask, b);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_pd(a);
+        b_vec = _mm512_loadu_pd(b);
+        a += 8, b += 8, n -= 8;
+    }
+    a_scaled_vec = _mm512_mul_pd(a_vec, alpha_vec);
+    sum_vec = _mm512_fmadd_pd(b_vec, beta_vec, a_scaled_vec);
+    _mm512_mask_storeu_pd(result, mask, sum_vec);
+    result += 8;
+    if (n) goto simsimd_wsum_f64_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_f32_skylake(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                            simsimd_f32_t *result) {
+    __m512 a_vec, b_vec, sum_vec;
+    __mmask16 mask = 0xFFFF;
+
+simsimd_sum_f32_skylake_cycle:
+    if (n < 16) {
+        mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_ps(mask, a);
+        b_vec = _mm512_maskz_loadu_ps(mask, b);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps(a);
+        b_vec = _mm512_loadu_ps(b);
+        a += 16, b += 16, n -= 16;
+    }
+    sum_vec = _mm512_add_ps(a_vec, b_vec);
+    _mm512_mask_storeu_ps(result, mask, sum_vec);
+    result += 16;
+    if (n) goto simsimd_sum_f32_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_f32_skylake(simsimd_f32_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                              simsimd_f32_t *result) {
+    __m512 alpha_vec = _mm512_set1_ps(alpha);
+    __m512 a_vec, sum_vec;
+    __mmask16 mask = 0xFFFF;
+
+simsimd_scale_f32_skylake_cycle:
+    if (n < 16) {
+        mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_ps(mask, a);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps(a);
+        a += 16, n -= 16;
+    }
+    sum_vec = _mm512_mul_ps(a_vec, alpha_vec);
+    _mm512_mask_storeu_ps(result, mask, sum_vec);
+    result += 16;
+    if (n) goto simsimd_scale_f32_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f32_skylake(                         //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_f32_skylake(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_f32_skylake(a, n, alpha, result); }
+        else { simsimd_scale_f32_skylake(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    __m512 alpha_vec = _mm512_set1_ps(alpha);
+    __m512 beta_vec = _mm512_set1_ps(beta);
+    __m512 a_vec, b_vec, a_scaled_vec, sum_vec;
+    __mmask16 mask = 0xFFFF;
+simsimd_wsum_f32_skylake_cycle:
+    if (n < 16) {
+        mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_ps(mask, a);
+        b_vec = _mm512_maskz_loadu_ps(mask, b);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps(a);
+        b_vec = _mm512_loadu_ps(b);
+        a += 16, b += 16, n -= 16;
+    }
+    a_scaled_vec = _mm512_mul_ps(a_vec, alpha_vec);
+    sum_vec = _mm512_fmadd_ps(b_vec, beta_vec, a_scaled_vec);
+    _mm512_mask_storeu_ps(result, mask, sum_vec);
+    result += 16;
+    if (n) goto simsimd_wsum_f32_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_bf16_skylake(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                             simsimd_bf16_t *result) {
+    __m256i a_bf16_vec, b_bf16_vec, sum_bf16_vec;
+    __m512 a_vec, b_vec, sum_vec;
+    __mmask16 mask = 0xFFFF;
+simsimd_sum_bf16_skylake_cycle:
+    if (n < 16) {
+        mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_bf16_vec = _mm256_maskz_loadu_epi16(mask, a);
+        b_bf16_vec = _mm256_maskz_loadu_epi16(mask, b);
+        n = 0;
+    }
+    else {
+        a_bf16_vec = _mm256_loadu_epi16(a);
+        b_bf16_vec = _mm256_loadu_epi16(b);
+        a += 16, b += 16, n -= 16;
+    }
+    a_vec = _simsimd_bf16x16_to_f32x16_skylake(a_bf16_vec);
+    b_vec = _simsimd_bf16x16_to_f32x16_skylake(b_bf16_vec);
+    sum_vec = _mm512_add_ps(a_vec, b_vec);
+    sum_bf16_vec = _simsimd_f32x16_to_bf16x16_skylake(sum_vec);
+    _mm256_mask_storeu_epi16(result, mask, sum_bf16_vec);
+    result += 16;
+    if (n) goto simsimd_sum_bf16_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_bf16_skylake(simsimd_bf16_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                               simsimd_bf16_t *result) {
+    __m512 alpha_vec = _mm512_set1_ps(alpha);
+    __m256i a_bf16_vec, b_bf16_vec, sum_bf16_vec;
+    __m512 a_vec, b_vec, sum_vec;
+    __mmask16 mask = 0xFFFF;
+simsimd_wsum_bf16_skylake_cycle:
+    if (n < 16) {
+        mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_bf16_vec = _mm256_maskz_loadu_epi16(mask, a);
+        n = 0;
+    }
+    else {
+        a_bf16_vec = _mm256_loadu_epi16(a);
+        a += 16, n -= 16;
+    }
+    a_vec = _simsimd_bf16x16_to_f32x16_skylake(a_bf16_vec);
+    sum_vec = _mm512_mul_ps(a_vec, alpha_vec);
+    sum_bf16_vec = _simsimd_f32x16_to_bf16x16_skylake(sum_vec);
+    _mm256_mask_storeu_epi16(result, mask, sum_bf16_vec);
+    result += 16;
+    if (n) goto simsimd_wsum_bf16_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_bf16_skylake(                          //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_bf16_skylake(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_bf16_skylake(a, n, alpha, result); }
+        else { simsimd_scale_bf16_skylake(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    __m512 alpha_vec = _mm512_set1_ps(alpha);
+    __m512 beta_vec = _mm512_set1_ps(beta);
+    __m256i a_bf16_vec, b_bf16_vec, sum_bf16_vec;
+    __m512 a_vec, b_vec, a_scaled_vec, sum_vec;
+    __mmask16 mask = 0xFFFF;
+simsimd_wsum_bf16_skylake_cycle:
+    if (n < 16) {
+        mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_bf16_vec = _mm256_maskz_loadu_epi16(mask, a);
+        b_bf16_vec = _mm256_maskz_loadu_epi16(mask, b);
+        n = 0;
+    }
+    else {
+        a_bf16_vec = _mm256_loadu_epi16(a);
+        b_bf16_vec = _mm256_loadu_epi16(b);
+        a += 16, b += 16, n -= 16;
+    }
+    a_vec = _simsimd_bf16x16_to_f32x16_skylake(a_bf16_vec);
+    b_vec = _simsimd_bf16x16_to_f32x16_skylake(b_bf16_vec);
+    a_scaled_vec = _mm512_mul_ps(a_vec, alpha_vec);
+    sum_vec = _mm512_fmadd_ps(b_vec, beta_vec, a_scaled_vec);
+    sum_bf16_vec = _simsimd_f32x16_to_bf16x16_skylake(sum_vec);
+    _mm256_mask_storeu_epi16(result, mask, sum_bf16_vec);
+    result += 16;
+    if (n) goto simsimd_wsum_bf16_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f64_skylake(                                                  //
+    simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_f64_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *result) {
+    __m512d alpha_vec = _mm512_set1_pd(alpha);
+    __m512d beta_vec = _mm512_set1_pd(beta);
+    __m512d a_vec, b_vec, c_vec, ab_vec, ab_scaled_vec, sum_vec;
+    __mmask8 mask = 0xFF;
+
+simsimd_fma_f64_skylake_cycle:
+    if (n < 8) {
+        mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_pd(mask, a);
+        b_vec = _mm512_maskz_loadu_pd(mask, b);
+        c_vec = _mm512_maskz_loadu_pd(mask, c);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_pd(a);
+        b_vec = _mm512_loadu_pd(b);
+        c_vec = _mm512_loadu_pd(c);
+        a += 8, b += 8, c += 8, n -= 8;
+    }
+    ab_vec = _mm512_mul_pd(a_vec, b_vec);
+    ab_scaled_vec = _mm512_mul_pd(ab_vec, alpha_vec);
+    sum_vec = _mm512_fmadd_pd(c_vec, beta_vec, ab_scaled_vec);
+    _mm512_mask_storeu_pd(result, mask, sum_vec);
+    result += 8;
+    if (n) goto simsimd_fma_f64_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f32_skylake(                                                  //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result) {
+    __m512 alpha_vec = _mm512_set1_ps(alpha);
+    __m512 beta_vec = _mm512_set1_ps(beta);
+    __m512 a_vec, b_vec, c_vec, ab_vec, ab_scaled_vec, sum_vec;
+    __mmask16 mask = 0xFFFF;
+
+simsimd_fma_f32_skylake_cycle:
+    if (n < 16) {
+        mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_ps(mask, a);
+        b_vec = _mm512_maskz_loadu_ps(mask, b);
+        c_vec = _mm512_maskz_loadu_ps(mask, c);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps(a);
+        b_vec = _mm512_loadu_ps(b);
+        c_vec = _mm512_loadu_ps(c);
+        a += 16, b += 16, c += 16, n -= 16;
+    }
+    ab_vec = _mm512_mul_ps(a_vec, b_vec);
+    ab_scaled_vec = _mm512_mul_ps(ab_vec, alpha_vec);
+    sum_vec = _mm512_fmadd_ps(c_vec, beta_vec, ab_scaled_vec);
+    _mm512_mask_storeu_ps(result, mask, sum_vec);
+    result += 16;
+    if (n) goto simsimd_fma_f32_skylake_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_bf16_skylake(                                                    //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result) {
+    __m512 alpha_vec = _mm512_set1_ps(alpha);
+    __m512 beta_vec = _mm512_set1_ps(beta);
+    __m256i a_bf16_vec, b_bf16_vec, c_bf16_vec, sum_bf16_vec;
+    __m512 a_vec, b_vec, c_vec, ab_vec, ab_scaled_vec, sum_vec;
+    __mmask16 mask = 0xFFFF;
+
+simsimd_fma_bf16_skylake_cycle:
+    if (n < 16) {
+        mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_bf16_vec = _mm256_maskz_loadu_epi16(mask, a);
+        b_bf16_vec = _mm256_maskz_loadu_epi16(mask, b);
+        c_bf16_vec = _mm256_maskz_loadu_epi16(mask, c);
+        n = 0;
+    }
+    else {
+        a_bf16_vec = _mm256_loadu_epi16(a);
+        b_bf16_vec = _mm256_loadu_epi16(b);
+        c_bf16_vec = _mm256_loadu_epi16(c);
+        a += 16, b += 16, c += 16, n -= 16;
+    }
+    a_vec = _simsimd_bf16x16_to_f32x16_skylake(a_bf16_vec);
+    b_vec = _simsimd_bf16x16_to_f32x16_skylake(b_bf16_vec);
+    c_vec = _simsimd_bf16x16_to_f32x16_skylake(c_bf16_vec);
+    ab_vec = _mm512_mul_ps(a_vec, b_vec);
+    ab_scaled_vec = _mm512_mul_ps(ab_vec, alpha_vec);
+    sum_vec = _mm512_fmadd_ps(c_vec, beta_vec, ab_scaled_vec);
+    sum_bf16_vec = _simsimd_f32x16_to_bf16x16_skylake(sum_vec);
+    _mm256_mask_storeu_epi16(result, mask, sum_bf16_vec);
+    result += 16;
+    if (n) goto simsimd_fma_bf16_skylake_cycle;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SKYLAKE
+
+#if SIMSIMD_TARGET_SAPPHIRE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512bw", "avx512fp16")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512bw,avx512fp16"))), \
+                             apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_sum_f16_sapphire(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                             simsimd_f16_t *result) {
+    __mmask32 mask = 0xFFFFFFFF;
+    __m512h a_f16_vec, b_f16_vec;
+    __m512h sum_f16_vec;
+simsimd_sum_f16_sapphire_cycle:
+    if (n < 32) {
+        mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_f16_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, a));
+        b_f16_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, b));
+        n = 0;
+    }
+    else {
+        a_f16_vec = _mm512_loadu_ph(a);
+        b_f16_vec = _mm512_loadu_ph(b);
+        a += 32, b += 32, n -= 32;
+    }
+    sum_f16_vec = _mm512_add_ph(a_f16_vec, b_f16_vec);
+    _mm512_mask_storeu_epi16(result, mask, _mm512_castph_si512(sum_f16_vec));
+    result += 32;
+    if (n) goto simsimd_sum_f16_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_f16_sapphire(simsimd_f16_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                               simsimd_f16_t *result) {
+
+    __mmask32 mask = 0xFFFFFFFF;
+    __m512h alpha_vec = _mm512_set1_ph((_Float16)alpha);
+    __m512h a_f16_vec, b_f16_vec;
+    __m512h sum_f16_vec;
+simsimd_scale_f16_sapphire_cycle:
+    if (n < 32) {
+        mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_f16_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, a));
+        n = 0;
+    }
+    else {
+        a_f16_vec = _mm512_loadu_ph(a);
+        a += 32, n -= 32;
+    }
+    sum_f16_vec = _mm512_mul_ph(a_f16_vec, alpha_vec);
+    _mm512_mask_storeu_epi16(result, mask, _mm512_castph_si512(sum_f16_vec));
+    result += 32;
+    if (n) goto simsimd_scale_f16_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f16_sapphire(                        //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_f16_sapphire(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_f16_sapphire(a, n, alpha, result); }
+        else { simsimd_scale_f16_sapphire(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    __mmask32 mask = 0xFFFFFFFF;
+    __m512h alpha_vec = _mm512_set1_ph((_Float16)alpha);
+    __m512h beta_vec = _mm512_set1_ph((_Float16)beta);
+    __m512h a_f16_vec, b_f16_vec;
+    __m512h a_scaled_f16_vec, sum_f16_vec;
+simsimd_wsum_f16_sapphire_cycle:
+    if (n < 32) {
+        mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_f16_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, a));
+        b_f16_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, b));
+        n = 0;
+    }
+    else {
+        a_f16_vec = _mm512_loadu_ph(a);
+        b_f16_vec = _mm512_loadu_ph(b);
+        a += 32, b += 32, n -= 32;
+    }
+    a_scaled_f16_vec = _mm512_mul_ph(a_f16_vec, alpha_vec);
+    sum_f16_vec = _mm512_fmadd_ph(b_f16_vec, beta_vec, a_scaled_f16_vec);
+    _mm512_mask_storeu_epi16(result, mask, _mm512_castph_si512(sum_f16_vec));
+    result += 32;
+    if (n) goto simsimd_wsum_f16_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f16_sapphire(                                                 //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result) {
+
+    __mmask32 mask = 0xFFFFFFFF;
+    __m512h alpha_vec = _mm512_set1_ph((_Float16)alpha);
+    __m512h beta_vec = _mm512_set1_ph((_Float16)beta);
+    __m512h a_f16_vec, b_f16_vec, c_f16_vec;
+    __m512h ab_f16_vec, ab_scaled_f16_vec, sum_f16_vec;
+simsimd_fma_f16_sapphire_cycle:
+    if (n < 32) {
+        mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_f16_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, a));
+        b_f16_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, b));
+        c_f16_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, c));
+        n = 0;
+    }
+    else {
+        a_f16_vec = _mm512_loadu_ph(a);
+        b_f16_vec = _mm512_loadu_ph(b);
+        c_f16_vec = _mm512_loadu_ph(c);
+        a += 32, b += 32, c += 32, n -= 32;
+    }
+    ab_f16_vec = _mm512_mul_ph(a_f16_vec, b_f16_vec);
+    ab_scaled_f16_vec = _mm512_mul_ph(ab_f16_vec, alpha_vec);
+    sum_f16_vec = _mm512_fmadd_ph(c_f16_vec, beta_vec, ab_scaled_f16_vec);
+    _mm512_mask_storeu_epi16(result, mask, _mm512_castph_si512(sum_f16_vec));
+    result += 32;
+    if (n) goto simsimd_fma_f16_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_u8_sapphire(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                            simsimd_u8_t *result) {
+    __mmask64 mask = 0xFFFFFFFFFFFFFFFFull;
+    __m512i a_u8_vec, b_u8_vec, sum_u8_vec;
+simsimd_sum_u8_sapphire_cycle:
+    if (n < 64) {
+        mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFFull, n);
+        a_u8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_u8_vec = _mm512_maskz_loadu_epi8(mask, b);
+        n = 0;
+    }
+    else {
+        a_u8_vec = _mm512_loadu_epi8(a);
+        b_u8_vec = _mm512_loadu_epi8(b);
+        a += 64, b += 64, n -= 64;
+    }
+    sum_u8_vec = _mm512_adds_epu8(a_u8_vec, b_u8_vec);
+    _mm512_mask_storeu_epi8(result, mask, sum_u8_vec);
+    result += 64;
+    if (n) goto simsimd_sum_u8_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_u8_sapphire(simsimd_u8_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                              simsimd_u8_t *result) {
+    __mmask64 mask = 0xFFFFFFFFFFFFFFFFull;
+    __m512h alpha_vec = _mm512_set1_ph((_Float16)alpha);
+    __m512i a_u8_vec, b_u8_vec, sum_u8_vec;
+    __m512h a_f16_low_vec, a_f16_high_vec;
+    __m512h a_scaled_f16_low_vec, a_scaled_f16_high_vec, sum_f16_low_vec, sum_f16_high_vec;
+    __m512i sum_i16_low_vec, sum_i16_high_vec;
+simsimd_scale_u8_sapphire_cycle:
+    if (n < 64) {
+        mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFFull, n);
+        a_u8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        n = 0;
+    }
+    else {
+        a_u8_vec = _mm512_loadu_epi8(a);
+        a += 64, n -= 64;
+    }
+    // Upcast:
+    a_f16_low_vec = _mm512_cvtepi16_ph(_mm512_unpacklo_epi8(a_u8_vec, _mm512_setzero_si512()));
+    a_f16_high_vec = _mm512_cvtepi16_ph(_mm512_unpackhi_epi8(a_u8_vec, _mm512_setzero_si512()));
+    // Scale:
+    sum_f16_low_vec = _mm512_mul_ph(a_f16_low_vec, alpha_vec);
+    sum_f16_high_vec = _mm512_mul_ph(a_f16_high_vec, alpha_vec);
+    // Downcast:
+    sum_i16_low_vec = _mm512_cvtph_epi16(sum_f16_low_vec);
+    sum_i16_high_vec = _mm512_cvtph_epi16(sum_f16_high_vec);
+    sum_u8_vec = _mm512_packus_epi16(sum_i16_low_vec, sum_i16_high_vec);
+    _mm512_mask_storeu_epi8(result, mask, sum_u8_vec);
+    result += 64;
+    if (n) goto simsimd_scale_u8_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_u8_sapphire(                       //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_u8_sapphire(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_u8_sapphire(a, n, alpha, result); }
+        else { simsimd_scale_u8_sapphire(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    __mmask64 mask = 0xFFFFFFFFFFFFFFFFull;
+    __m512h alpha_vec = _mm512_set1_ph((_Float16)alpha);
+    __m512h beta_vec = _mm512_set1_ph((_Float16)beta);
+    __m512i a_u8_vec, b_u8_vec, sum_u8_vec;
+    __m512h a_f16_low_vec, a_f16_high_vec, b_f16_low_vec, b_f16_high_vec;
+    __m512h a_scaled_f16_low_vec, a_scaled_f16_high_vec, sum_f16_low_vec, sum_f16_high_vec;
+    __m512i sum_i16_low_vec, sum_i16_high_vec;
+simsimd_wsum_u8_sapphire_cycle:
+    if (n < 64) {
+        mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFFull, n);
+        a_u8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_u8_vec = _mm512_maskz_loadu_epi8(mask, b);
+        n = 0;
+    }
+    else {
+        a_u8_vec = _mm512_loadu_epi8(a);
+        b_u8_vec = _mm512_loadu_epi8(b);
+        a += 64, b += 64, n -= 64;
+    }
+    // Upcast:
+    a_f16_low_vec = _mm512_cvtepi16_ph(_mm512_unpacklo_epi8(a_u8_vec, _mm512_setzero_si512()));
+    a_f16_high_vec = _mm512_cvtepi16_ph(_mm512_unpackhi_epi8(a_u8_vec, _mm512_setzero_si512()));
+    b_f16_low_vec = _mm512_cvtepi16_ph(_mm512_unpacklo_epi8(b_u8_vec, _mm512_setzero_si512()));
+    b_f16_high_vec = _mm512_cvtepi16_ph(_mm512_unpackhi_epi8(b_u8_vec, _mm512_setzero_si512()));
+    // Scale:
+    a_scaled_f16_low_vec = _mm512_mul_ph(a_f16_low_vec, alpha_vec);
+    a_scaled_f16_high_vec = _mm512_mul_ph(a_f16_high_vec, alpha_vec);
+    // Add:
+    sum_f16_low_vec = _mm512_fmadd_ph(b_f16_low_vec, beta_vec, a_scaled_f16_low_vec);
+    sum_f16_high_vec = _mm512_fmadd_ph(b_f16_high_vec, beta_vec, a_scaled_f16_high_vec);
+    // Downcast:
+    sum_i16_low_vec = _mm512_cvtph_epi16(sum_f16_low_vec);
+    sum_i16_high_vec = _mm512_cvtph_epi16(sum_f16_high_vec);
+    sum_u8_vec = _mm512_packus_epi16(sum_i16_low_vec, sum_i16_high_vec);
+    _mm512_mask_storeu_epi8(result, mask, sum_u8_vec);
+    result += 64;
+    if (n) goto simsimd_wsum_u8_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_i8_sapphire(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                            simsimd_i8_t *result) {
+
+    __mmask64 mask = 0xFFFFFFFFFFFFFFFFull;
+    __m512i a_i8_vec, b_i8_vec, sum_i8_vec;
+    __m512h a_f16_low_vec, a_f16_high_vec, b_f16_low_vec, b_f16_high_vec;
+    __m512h a_scaled_f16_low_vec, a_scaled_f16_high_vec, sum_f16_low_vec, sum_f16_high_vec;
+    __m512i sum_i16_low_vec, sum_i16_high_vec;
+
+simsimd_sum_i8_sapphire_cycle:
+    if (n < 64) {
+        mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFFull, n);
+        a_i8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_i8_vec = _mm512_maskz_loadu_epi8(mask, b);
+        n = 0;
+    }
+    else {
+        a_i8_vec = _mm512_loadu_epi8(a);
+        b_i8_vec = _mm512_loadu_epi8(b);
+        a += 64, b += 64, n -= 64;
+    }
+    sum_i8_vec = _mm512_adds_epi8(a_i8_vec, b_i8_vec);
+    _mm512_mask_storeu_epi8(result, mask, sum_i8_vec);
+    result += 64;
+    if (n) goto simsimd_sum_i8_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_i8_sapphire(simsimd_i8_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                              simsimd_i8_t *result) {
+
+    __mmask64 mask = 0xFFFFFFFFFFFFFFFFull;
+    __m512h alpha_vec = _mm512_set1_ph((_Float16)alpha);
+    __m512i a_i8_vec, sum_i8_vec;
+    __m512h a_f16_low_vec, a_f16_high_vec;
+    __m512h sum_f16_low_vec, sum_f16_high_vec;
+    __m512i sum_i16_low_vec, sum_i16_high_vec;
+simsimd_wsum_i8_sapphire_cycle:
+    if (n < 64) {
+        mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFFull, n);
+        a_i8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        n = 0;
+    }
+    else {
+        a_i8_vec = _mm512_loadu_epi8(a);
+        a += 64, n -= 64;
+    }
+    // Upcast:
+    a_f16_low_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_castsi512_si256(a_i8_vec)));
+    a_f16_high_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(a_i8_vec, 1)));
+    // Scale:
+    sum_f16_low_vec = _mm512_mul_ph(a_f16_low_vec, alpha_vec);
+    sum_f16_high_vec = _mm512_mul_ph(a_f16_high_vec, alpha_vec);
+    // Downcast:
+    sum_i16_low_vec = _mm512_cvtph_epi16(sum_f16_low_vec);
+    sum_i16_high_vec = _mm512_cvtph_epi16(sum_f16_high_vec);
+    sum_i8_vec = _mm512_inserti64x4(_mm512_castsi256_si512(_mm512_cvtsepi16_epi8(sum_i16_low_vec)),
+                                    _mm512_cvtsepi16_epi8(sum_i16_high_vec), 1);
+    _mm512_mask_storeu_epi8(result, mask, sum_i8_vec);
+    result += 64;
+    if (n) goto simsimd_wsum_i8_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_i8_sapphire(                       //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_i8_sapphire(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_i8_sapphire(a, n, alpha, result); }
+        else { simsimd_scale_i8_sapphire(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    __mmask64 mask = 0xFFFFFFFFFFFFFFFFull;
+    __m512h alpha_vec = _mm512_set1_ph((_Float16)alpha);
+    __m512h beta_vec = _mm512_set1_ph((_Float16)beta);
+    __m512i a_i8_vec, b_i8_vec, sum_i8_vec;
+    __m512h a_f16_low_vec, a_f16_high_vec, b_f16_low_vec, b_f16_high_vec;
+    __m512h a_scaled_f16_low_vec, a_scaled_f16_high_vec, sum_f16_low_vec, sum_f16_high_vec;
+    __m512i sum_i16_low_vec, sum_i16_high_vec;
+
+simsimd_wsum_i8_sapphire_cycle:
+    if (n < 64) {
+        mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFFull, n);
+        a_i8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_i8_vec = _mm512_maskz_loadu_epi8(mask, b);
+        n = 0;
+    }
+    else {
+        a_i8_vec = _mm512_loadu_epi8(a);
+        b_i8_vec = _mm512_loadu_epi8(b);
+        a += 64, b += 64, n -= 64;
+    }
+    // Upcast:
+    a_f16_low_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_castsi512_si256(a_i8_vec)));
+    a_f16_high_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(a_i8_vec, 1)));
+    b_f16_low_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_castsi512_si256(b_i8_vec)));
+    b_f16_high_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(b_i8_vec, 1)));
+    // Scale:
+    a_scaled_f16_low_vec = _mm512_mul_ph(a_f16_low_vec, alpha_vec);
+    a_scaled_f16_high_vec = _mm512_mul_ph(a_f16_high_vec, alpha_vec);
+    // Add:
+    sum_f16_low_vec = _mm512_fmadd_ph(b_f16_low_vec, beta_vec, a_scaled_f16_low_vec);
+    sum_f16_high_vec = _mm512_fmadd_ph(b_f16_high_vec, beta_vec, a_scaled_f16_high_vec);
+    // Downcast:
+    sum_i16_low_vec = _mm512_cvtph_epi16(sum_f16_low_vec);
+    sum_i16_high_vec = _mm512_cvtph_epi16(sum_f16_high_vec);
+    sum_i8_vec = _mm512_inserti64x4(_mm512_castsi256_si512(_mm512_cvtsepi16_epi8(sum_i16_low_vec)),
+                                    _mm512_cvtsepi16_epi8(sum_i16_high_vec), 1);
+    _mm512_mask_storeu_epi8(result, mask, sum_i8_vec);
+    result += 64;
+    if (n) goto simsimd_wsum_i8_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_i8_sapphire(                                               //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_i8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result) {
+
+    __mmask64 mask = 0xFFFFFFFFFFFFFFFF;
+    __m512h alpha_vec = _mm512_set1_ph((_Float16)alpha);
+    __m512h beta_vec = _mm512_set1_ph((_Float16)beta);
+    __m512i a_i8_vec, b_i8_vec, c_i8_vec, sum_i8_vec;
+    __m512h a_f16_low_vec, a_f16_high_vec, b_f16_low_vec, b_f16_high_vec;
+    __m512h c_f16_low_vec, c_f16_high_vec, ab_f16_low_vec, ab_f16_high_vec;
+    __m512h ab_scaled_f16_low_vec, ab_scaled_f16_high_vec, sum_f16_low_vec, sum_f16_high_vec;
+    __m512i sum_i16_low_vec, sum_i16_high_vec;
+
+simsimd_fma_i8_sapphire_cycle:
+    if (n < 64) {
+        mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n);
+        a_i8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_i8_vec = _mm512_maskz_loadu_epi8(mask, b);
+        c_i8_vec = _mm512_maskz_loadu_epi8(mask, c);
+        n = 0;
+    }
+    else {
+        a_i8_vec = _mm512_loadu_epi8(a);
+        b_i8_vec = _mm512_loadu_epi8(b);
+        c_i8_vec = _mm512_loadu_epi8(c);
+        a += 64, b += 64, c += 64, n -= 64;
+    }
+    // Upcast:
+    a_f16_low_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_castsi512_si256(a_i8_vec)));
+    a_f16_high_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(a_i8_vec, 1)));
+    b_f16_low_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_castsi512_si256(b_i8_vec)));
+    b_f16_high_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(b_i8_vec, 1)));
+    c_f16_low_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_castsi512_si256(c_i8_vec)));
+    c_f16_high_vec = _mm512_cvtepi16_ph(_mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(c_i8_vec, 1)));
+    // Multiply:
+    ab_f16_low_vec = _mm512_mul_ph(a_f16_low_vec, b_f16_low_vec);
+    ab_f16_high_vec = _mm512_mul_ph(a_f16_high_vec, b_f16_high_vec);
+    // Scale:
+    ab_scaled_f16_low_vec = _mm512_mul_ph(ab_f16_low_vec, alpha_vec);
+    ab_scaled_f16_high_vec = _mm512_mul_ph(ab_f16_high_vec, alpha_vec);
+    // Add:
+    sum_f16_low_vec = _mm512_fmadd_ph(c_f16_low_vec, beta_vec, ab_scaled_f16_low_vec);
+    sum_f16_high_vec = _mm512_fmadd_ph(c_f16_high_vec, beta_vec, ab_scaled_f16_high_vec);
+    // Downcast:
+    sum_i16_low_vec = _mm512_cvtph_epi16(sum_f16_low_vec);
+    sum_i16_high_vec = _mm512_cvtph_epi16(sum_f16_high_vec);
+    sum_i8_vec = _mm512_inserti64x4(_mm512_castsi256_si512(_mm512_cvtsepi16_epi8(sum_i16_low_vec)),
+                                    _mm512_cvtsepi16_epi8(sum_i16_high_vec), 1);
+    _mm512_mask_storeu_epi8(result, mask, sum_i8_vec);
+    result += 64;
+    if (n) goto simsimd_fma_i8_sapphire_cycle;
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_u8_sapphire(                                               //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_u8_t const *c, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result) {
+
+    __mmask64 mask = 0xFFFFFFFFFFFFFFFF;
+    __m512h alpha_vec = _mm512_set1_ph((_Float16)alpha);
+    __m512h beta_vec = _mm512_set1_ph((_Float16)beta);
+    __m512i a_u8_vec, b_u8_vec, c_u8_vec, sum_u8_vec;
+    __m512h a_f16_low_vec, a_f16_high_vec, b_f16_low_vec, b_f16_high_vec;
+    __m512h c_f16_low_vec, c_f16_high_vec, ab_f16_low_vec, ab_f16_high_vec;
+    __m512h ab_scaled_f16_low_vec, ab_scaled_f16_high_vec, sum_f16_low_vec, sum_f16_high_vec;
+    __m512i sum_i16_low_vec, sum_i16_high_vec;
+
+simsimd_fma_u8_sapphire_cycle:
+    if (n < 64) {
+        mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n);
+        a_u8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_u8_vec = _mm512_maskz_loadu_epi8(mask, b);
+        c_u8_vec = _mm512_maskz_loadu_epi8(mask, c);
+        n = 0;
+    }
+    else {
+        a_u8_vec = _mm512_loadu_epi8(a);
+        b_u8_vec = _mm512_loadu_epi8(b);
+        c_u8_vec = _mm512_loadu_epi8(c);
+        a += 64, b += 64, c += 64, n -= 64;
+    }
+    // Upcast:
+    a_f16_low_vec = _mm512_cvtepi16_ph(_mm512_unpacklo_epi8(a_u8_vec, _mm512_setzero_si512()));
+    a_f16_high_vec = _mm512_cvtepi16_ph(_mm512_unpackhi_epi8(a_u8_vec, _mm512_setzero_si512()));
+    b_f16_low_vec = _mm512_cvtepi16_ph(_mm512_unpacklo_epi8(b_u8_vec, _mm512_setzero_si512()));
+    b_f16_high_vec = _mm512_cvtepi16_ph(_mm512_unpackhi_epi8(b_u8_vec, _mm512_setzero_si512()));
+    c_f16_low_vec = _mm512_cvtepi16_ph(_mm512_unpacklo_epi8(c_u8_vec, _mm512_setzero_si512()));
+    c_f16_high_vec = _mm512_cvtepi16_ph(_mm512_unpackhi_epi8(c_u8_vec, _mm512_setzero_si512()));
+    // Multiply:
+    ab_f16_low_vec = _mm512_mul_ph(a_f16_low_vec, b_f16_low_vec);
+    ab_f16_high_vec = _mm512_mul_ph(a_f16_high_vec, b_f16_high_vec);
+    // Scale:
+    ab_scaled_f16_low_vec = _mm512_mul_ph(ab_f16_low_vec, alpha_vec);
+    ab_scaled_f16_high_vec = _mm512_mul_ph(ab_f16_high_vec, alpha_vec);
+    // Add:
+    sum_f16_low_vec = _mm512_fmadd_ph(c_f16_low_vec, beta_vec, ab_scaled_f16_low_vec);
+    sum_f16_high_vec = _mm512_fmadd_ph(c_f16_high_vec, beta_vec, ab_scaled_f16_high_vec);
+    // Downcast:
+    sum_i16_low_vec = _mm512_cvtph_epi16(sum_f16_low_vec);
+    sum_i16_high_vec = _mm512_cvtph_epi16(sum_f16_high_vec);
+    sum_u8_vec = _mm512_packus_epi16(sum_i16_low_vec, sum_i16_high_vec);
+    _mm512_mask_storeu_epi8(result, mask, sum_u8_vec);
+    result += 64;
+    if (n) goto simsimd_fma_u8_sapphire_cycle;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SAPPHIRE
+#endif // _SIMSIMD_TARGET_X86
+
+#if _SIMSIMD_TARGET_ARM
+#if SIMSIMD_TARGET_NEON
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_sum_f32_neon(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                         simsimd_f32_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vld1q_f32(a + i);
+        float32x4_t b_vec = vld1q_f32(b + i);
+        float32x4_t sum_vec = vaddq_f32(a_vec, b_vec);
+        vst1q_f32(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = a[i] + b[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_f32_neon(simsimd_f32_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                           simsimd_f32_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vld1q_f32(a + i);
+        float32x4_t sum_vec = vmulq_n_f32(a_vec, alpha_f32);
+        vst1q_f32(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = alpha_f32 * a[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f32_neon(                            //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_f32_neon(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_f32_neon(a, n, alpha, result); }
+        else { simsimd_scale_f32_neon(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vld1q_f32(a + i);
+        float32x4_t b_vec = vld1q_f32(b + i);
+        float32x4_t a_scaled_vec = vmulq_n_f32(a_vec, alpha_f32);
+        float32x4_t b_scaled_vec = vmulq_n_f32(b_vec, beta_f32);
+        float32x4_t sum_vec = vaddq_f32(a_scaled_vec, b_scaled_vec);
+        vst1q_f32(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = alpha_f32 * a[i] + beta_f32 * b[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f32_neon(                                   //
+    simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vld1q_f32(a + i);
+        float32x4_t b_vec = vld1q_f32(b + i);
+        float32x4_t c_vec = vld1q_f32(c + i);
+        float32x4_t ab_vec = vmulq_f32(a_vec, b_vec);
+        float32x4_t ab_scaled_vec = vmulq_n_f32(ab_vec, alpha_f32);
+        float32x4_t sum_vec = vfmaq_n_f32(ab_scaled_vec, c_vec, beta_f32);
+        vst1q_f32(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) result[i] = alpha_f32 * a[i] * b[i] + beta_f32 * c[i];
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON
+
+#if SIMSIMD_TARGET_NEON_BF16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.6-a+simd+bf16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.6-a+simd+bf16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_sum_bf16_neon(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                          simsimd_bf16_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vcvt_f32_bf16(vld1_bf16((bfloat16_t const *)a + i));
+        float32x4_t b_vec = vcvt_f32_bf16(vld1_bf16((bfloat16_t const *)b + i));
+        float32x4_t sum_vec = vaddq_f32(a_vec, b_vec);
+        vst1_bf16((bfloat16_t *)result + i, vcvt_bf16_f32(sum_vec));
+    }
+
+    // The tail:
+    for (; i < n; ++i) simsimd_f32_to_bf16(simsimd_bf16_to_f32(a + i) + simsimd_bf16_to_f32(b + i), result + i);
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_bf16_neon(simsimd_bf16_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                            simsimd_bf16_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vcvt_f32_bf16(vld1_bf16((bfloat16_t const *)a + i));
+        float32x4_t sum_vec = vmulq_n_f32(a_vec, alpha_f32);
+        vst1_bf16((bfloat16_t *)result + i, vcvt_bf16_f32(sum_vec));
+    }
+
+    // The tail:
+    for (; i < n; ++i) simsimd_f32_to_bf16(alpha_f32 * simsimd_bf16_to_f32(a + i), result + i);
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_bf16_neon(                             //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_bf16_neon(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_bf16_neon(a, n, alpha, result); }
+        else { simsimd_scale_bf16_neon(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vcvt_f32_bf16(vld1_bf16((bfloat16_t const *)a + i));
+        float32x4_t b_vec = vcvt_f32_bf16(vld1_bf16((bfloat16_t const *)b + i));
+        float32x4_t a_scaled_vec = vmulq_n_f32(a_vec, alpha_f32);
+        float32x4_t b_scaled_vec = vmulq_n_f32(b_vec, beta_f32);
+        float32x4_t sum_vec = vaddq_f32(a_scaled_vec, b_scaled_vec);
+        vst1_bf16((bfloat16_t *)result + i, vcvt_bf16_f32(sum_vec));
+    }
+
+    // The tail:
+    for (; i < n; ++i)
+        simsimd_f32_to_bf16(alpha_f32 * simsimd_bf16_to_f32(a + i) + beta_f32 * simsimd_bf16_to_f32(b + i), result + i);
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_bf16_neon(                                     //
+    simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *result) {
+    simsimd_f32_t alpha_f32 = (simsimd_f32_t)alpha;
+    simsimd_f32_t beta_f32 = (simsimd_f32_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vcvt_f32_bf16(vld1_bf16((bfloat16_t const *)a + i));
+        float32x4_t b_vec = vcvt_f32_bf16(vld1_bf16((bfloat16_t const *)b + i));
+        float32x4_t c_vec = vcvt_f32_bf16(vld1_bf16((bfloat16_t const *)c + i));
+        float32x4_t ab_vec = vmulq_f32(a_vec, b_vec);
+        float32x4_t ab_scaled_vec = vmulq_n_f32(ab_vec, alpha_f32);
+        float32x4_t sum_vec = vfmaq_n_f32(ab_scaled_vec, c_vec, beta_f32);
+        vst1_bf16((bfloat16_t *)result + i, vcvt_bf16_f32(sum_vec));
+    }
+
+    // The tail:
+    for (; i < n; ++i)
+        simsimd_f32_to_bf16(
+            alpha_f32 * simsimd_bf16_to_f32(a + i) * simsimd_bf16_to_f32(b + i) + beta_f32 * simsimd_bf16_to_f32(c + i),
+            result + i);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_BF16
+
+#if SIMSIMD_TARGET_NEON_F16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd+fp16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd+fp16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_sum_f16_neon(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                         simsimd_f16_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        float16x8_t a_vec = vld1q_f16((float16_t const *)a + i);
+        float16x8_t b_vec = vld1q_f16((float16_t const *)b + i);
+        float16x8_t sum_vec = vaddq_f16(a_vec, b_vec);
+        vst1q_f16((float16_t *)result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) ((float16_t *)result)[i] = ((float16_t const *)a)[i] + ((float16_t const *)b)[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_f16_neon(simsimd_f16_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                           simsimd_f16_t *result) {
+    float16_t alpha_f16 = (float16_t)alpha;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        float16x8_t a_vec = vld1q_f16((float16_t const *)a + i);
+        float16x8_t sum_vec = vmulq_n_f16(a_vec, alpha_f16);
+        vst1q_f16((float16_t *)result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) ((float16_t *)result)[i] = alpha_f16 * ((float16_t const *)a)[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f16_neon(                            //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result) {
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_f16_neon(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_f16_neon(a, n, alpha, result); }
+        else { simsimd_scale_f16_neon(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    float16_t alpha_f16 = (float16_t)alpha;
+    float16_t beta_f16 = (float16_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        float16x8_t a_vec = vld1q_f16((float16_t const *)a + i);
+        float16x8_t b_vec = vld1q_f16((float16_t const *)b + i);
+        float16x8_t a_scaled_vec = vmulq_n_f16(a_vec, alpha_f16);
+        float16x8_t b_scaled_vec = vmulq_n_f16(b_vec, beta_f16);
+        float16x8_t sum_vec = vaddq_f16(a_scaled_vec, b_scaled_vec);
+        vst1q_f16((float16_t *)result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i)
+        ((float16_t *)result)[i] = alpha_f16 * ((float16_t const *)a)[i] + beta_f16 * ((float16_t const *)b)[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f16_neon(                                   //
+    simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *result) {
+    float16_t alpha_f16 = (float16_t)alpha;
+    float16_t beta_f16 = (float16_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        float16x8_t a_vec = vld1q_f16((float16_t const *)a + i);
+        float16x8_t b_vec = vld1q_f16((float16_t const *)b + i);
+        float16x8_t c_vec = vld1q_f16((float16_t const *)c + i);
+        float16x8_t ab_vec = vmulq_f16(a_vec, b_vec);
+        float16x8_t ab_scaled_vec = vmulq_n_f16(ab_vec, alpha_f16);
+        float16x8_t sum_vec = vfmaq_n_f16(ab_scaled_vec, c_vec, beta_f16);
+        vst1q_f16((float16_t *)result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i)
+        ((float16_t *)result)[i] =
+            alpha_f16 * ((float16_t const *)a)[i] * ((float16_t const *)b)[i] + beta_f16 * ((float16_t const *)c)[i];
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_u8_neon(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                        simsimd_u8_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 16 <= n; i += 16) {
+        uint8x16_t a_vec = vld1q_u8(a + i);
+        uint8x16_t b_vec = vld1q_u8(b + i);
+        uint8x16_t sum_vec = vqaddq_u8(a_vec, b_vec);
+        vst1q_u8(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) { SIMSIMD_F32_TO_U8(a[i] + b[i], result + i); }
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_u8_neon(simsimd_u8_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                          simsimd_u8_t *result) {
+    float16_t alpha_f16 = (float16_t)alpha;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        uint8x8_t a_u8_vec = vld1_u8(a + i);
+        float16x8_t a_vec = vcvtq_f16_u16(vmovl_u8(a_u8_vec));
+        float16x8_t sum_vec = vmulq_n_f16(a_vec, alpha_f16);
+        uint8x8_t sum_u8_vec = vqmovn_u16(vcvtaq_u16_f16(sum_vec));
+        vst1_u8(result + i, sum_u8_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) { SIMSIMD_F32_TO_U8(alpha_f16 * a[i], result + i); }
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_u8_neon(                           //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_u8_neon(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_u8_neon(a, n, alpha, result); }
+        else { simsimd_scale_u8_neon(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    float16_t alpha_f16 = (float16_t)alpha;
+    float16_t beta_f16 = (float16_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        uint8x8_t a_u8_vec = vld1_u8(a + i);
+        uint8x8_t b_u8_vec = vld1_u8(b + i);
+        float16x8_t a_vec = vcvtq_f16_u16(vmovl_u8(a_u8_vec));
+        float16x8_t b_vec = vcvtq_f16_u16(vmovl_u8(b_u8_vec));
+        float16x8_t a_scaled_vec = vmulq_n_f16(a_vec, alpha_f16);
+        float16x8_t b_scaled_vec = vmulq_n_f16(b_vec, beta_f16);
+        float16x8_t sum_vec = vaddq_f16(a_scaled_vec, b_scaled_vec);
+        uint8x8_t sum_u8_vec = vqmovn_u16(vcvtaq_u16_f16(sum_vec));
+        vst1_u8(result + i, sum_u8_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) { SIMSIMD_F32_TO_U8(alpha_f16 * a[i] + beta_f16 * b[i], result + i); }
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_u8_neon(                                 //
+    simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_u8_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *result) {
+    float16_t alpha_f16 = (float16_t)alpha;
+    float16_t beta_f16 = (float16_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        uint8x8_t a_u8_vec = vld1_u8(a + i);
+        uint8x8_t b_u8_vec = vld1_u8(b + i);
+        uint8x8_t c_u8_vec = vld1_u8(c + i);
+        float16x8_t a_vec = vcvtq_f16_u16(vmovl_u8(a_u8_vec));
+        float16x8_t b_vec = vcvtq_f16_u16(vmovl_u8(b_u8_vec));
+        float16x8_t c_vec = vcvtq_f16_u16(vmovl_u8(c_u8_vec));
+        float16x8_t ab_vec = vmulq_f16(a_vec, b_vec);
+        float16x8_t ab_scaled_vec = vmulq_n_f16(ab_vec, alpha_f16);
+        float16x8_t sum_vec = vfmaq_n_f16(ab_scaled_vec, c_vec, beta_f16);
+        uint8x8_t sum_u8_vec = vqmovn_u16(vcvtaq_u16_f16(sum_vec));
+        vst1_u8(result + i, sum_u8_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) { SIMSIMD_F32_TO_U8(alpha_f16 * a[i] * b[i] + beta_f16 * c[i], result + i); }
+}
+
+SIMSIMD_PUBLIC void simsimd_sum_i8_neon(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                        simsimd_i8_t *result) {
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 16 <= n; i += 16) {
+        int8x16_t a_vec = vld1q_s8(a + i);
+        int8x16_t b_vec = vld1q_s8(b + i);
+        int8x16_t sum_vec = vqaddq_s8(a_vec, b_vec);
+        vst1q_s8(result + i, sum_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) { SIMSIMD_F32_TO_I8(a[i] + b[i], result + i); }
+}
+
+SIMSIMD_PUBLIC void simsimd_scale_i8_neon(simsimd_i8_t const *a, simsimd_size_t n, simsimd_distance_t alpha,
+                                          simsimd_i8_t *result) {
+    float16_t alpha_f16 = (float16_t)alpha;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        int8x8_t a_i8_vec = vld1_s8(a + i);
+        float16x8_t a_vec = vcvtq_f16_s16(vmovl_s8(a_i8_vec));
+        float16x8_t sum_vec = vmulq_n_f16(a_vec, alpha_f16);
+        int8x8_t sum_i8_vec = vqmovn_s16(vcvtaq_s16_f16(sum_vec));
+        vst1_s8(result + i, sum_i8_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) { SIMSIMD_F32_TO_I8(alpha_f16 * a[i], result + i); }
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_i8_neon(                           //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n, //
+    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result) {
+
+    // There are are several special cases we may want to implement:
+    // 1. Simple addition, when both weights are equal to 1.0.
+    if (alpha == 1 && beta == 1) {
+        // In this case we can avoid expensive multiplications.
+        simsimd_sum_i8_neon(a, b, n, result);
+        return;
+    }
+    // 2. Just scaling, when one of the weights is equal to zero.
+    else if (alpha == 0 || beta == 0) {
+        // In this case we can avoid half of the load instructions.
+        if (beta == 0) { simsimd_scale_i8_neon(a, n, alpha, result); }
+        else { simsimd_scale_i8_neon(b, n, beta, result); }
+        return;
+    }
+
+    // The general case.
+    float16_t alpha_f16 = (float16_t)alpha;
+    float16_t beta_f16 = (float16_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        int8x8_t a_i8_vec = vld1_s8(a + i);
+        int8x8_t b_i8_vec = vld1_s8(b + i);
+        float16x8_t a_vec = vcvtq_f16_s16(vmovl_s8(a_i8_vec));
+        float16x8_t b_vec = vcvtq_f16_s16(vmovl_s8(b_i8_vec));
+        float16x8_t a_scaled_vec = vmulq_n_f16(a_vec, alpha_f16);
+        float16x8_t b_scaled_vec = vmulq_n_f16(b_vec, beta_f16);
+        float16x8_t sum_vec = vaddq_f16(a_scaled_vec, b_scaled_vec);
+        int8x8_t sum_i8_vec = vqmovn_s16(vcvtaq_s16_f16(sum_vec));
+        vst1_s8(result + i, sum_i8_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) { SIMSIMD_F32_TO_I8(alpha_f16 * a[i] + beta_f16 * b[i], result + i); }
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_i8_neon(                                 //
+    simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_i8_t const *c, //
+    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *result) {
+    float16_t alpha_f16 = (float16_t)alpha;
+    float16_t beta_f16 = (float16_t)beta;
+
+    // The main loop:
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        int8x8_t a_i8_vec = vld1_s8(a + i);
+        int8x8_t b_i8_vec = vld1_s8(b + i);
+        int8x8_t c_i8_vec = vld1_s8(c + i);
+        float16x8_t a_vec = vcvtq_f16_s16(vmovl_s8(a_i8_vec));
+        float16x8_t b_vec = vcvtq_f16_s16(vmovl_s8(b_i8_vec));
+        float16x8_t c_vec = vcvtq_f16_s16(vmovl_s8(c_i8_vec));
+        float16x8_t ab_vec = vmulq_f16(a_vec, b_vec);
+        float16x8_t ab_scaled_vec = vmulq_n_f16(ab_vec, alpha_f16);
+        float16x8_t sum_vec = vfmaq_n_f16(ab_scaled_vec, c_vec, beta_f16);
+        int8x8_t sum_i8_vec = vqmovn_s16(vcvtaq_s16_f16(sum_vec));
+        vst1_s8(result + i, sum_i8_vec);
+    }
+
+    // The tail:
+    for (; i < n; ++i) { SIMSIMD_F32_TO_I8(alpha_f16 * a[i] * b[i] + beta_f16 * c[i], result + i); }
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_F16
+#endif // _SIMSIMD_TARGET_ARM
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/geospatial.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/geospatial.h
new file mode 100644
index 0000000000..91f2d6f930
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/geospatial.h
@@ -0,0 +1,43 @@
+/**
+ *  @file       geospatial.h
+ *  @brief      SIMD-accelerated Geo-Spatial distance functions.
+ *  @author     Ash Vardanian
+ *  @date       July 1, 2023
+ *
+ *  Contains:
+ *  - Haversine (Great Circle) distance
+ *  - Vincenty's distance function for Oblate Spheroid Geodesics
+ *
+ *  For datatypes:
+ *  - 32-bit IEEE-754 floating point
+ *  - 64-bit IEEE-754 floating point
+ *
+ *  For hardware architectures:
+ *  - Arm: NEON
+ *  - x86: Haswell
+ *
+ *  In most cases, for distance computations, we don't need the exact Haversine formula.
+ *  The very last part of the computation applies `asin(sqrt(x))` non-linear transformation.
+ *  Both `asin` and `sqrt` are monotonically increasing functions, so their product is also
+ *  monotonically increasing. This means, for relative similarity/closeness computation we
+ *  can avoid that expensive last step.
+ *
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide/
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics/
+ *  Oblate Spheroid Geodesic: https://mathworld.wolfram.com/OblateSpheroidGeodesic.html
+ *  Staging experiments: https://github.com/ashvardanian/HaversineSimSIMD
+ */
+#ifndef SIMSIMD_GEOSPATIAL_H
+#define SIMSIMD_GEOSPATIAL_H
+
+#include "types.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/mesh.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/mesh.h
new file mode 100644
index 0000000000..2d3c16c27f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/mesh.h
@@ -0,0 +1,69 @@
+/**
+ *  @file       mesh.h
+ *  @brief      SIMD-accelerated similarity measures for meshes and rigid 3D bodies.
+ *  @author     Ash Vardanian
+ *  @date       June 19, 2024
+ *
+ *  Contains:
+ *  - Root Mean Square Deviation (RMSD) for rigid body superposition
+ *  - Kabsch algorithm for optimal rigid body superposition
+ *
+ *  For datatypes:
+ *  - 64-bit IEEE-754 floating point
+ *  - 32-bit IEEE-754 floating point
+ *  - 16-bit IEEE-754 floating point
+ *  - 16-bit brain-floating point
+ *
+ *  For hardware architectures:
+ *  - Arm: Neon
+ *  - x86: Genoa, Sapphire
+ *
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide/
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics/
+ */
+#ifndef SIMSIMD_MESH_H
+#define SIMSIMD_MESH_H
+
+#include "types.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// clang-format off
+
+/*  Serial backends for all numeric types.
+ *  By default they use 32-bit arithmetic, unless the arguments themselves contain 64-bit floats.
+ *  For double-precision computation check out the "*_accurate" variants of those "*_serial" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_rmsd_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_f64_t* a_centroid, simsimd_f64_t* b_centroid, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_kabsch_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_f64_t* a_centroid, simsimd_f64_t* b_centroid, simsimd_distance_t* result);
+
+SIMSIMD_PUBLIC void simsimd_rmsd_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_f32_t* a_centroid, simsimd_f32_t* b_centroid, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_kabsch_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_f32_t* a_centroid, simsimd_f32_t* b_centroid, simsimd_distance_t* result);
+
+SIMSIMD_PUBLIC void simsimd_rmsd_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_f16_t* a_centroid, simsimd_f16_t* b_centroid, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_kabsch_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_f16_t* a_centroid, simsimd_f16_t* b_centroid, simsimd_distance_t* result);
+
+SIMSIMD_PUBLIC void simsimd_rmsd_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_bf16_t* a_centroid, simsimd_bf16_t* b_centroid, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_kabsch_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_bf16_t* a_centroid, simsimd_bf16_t* b_centroid, simsimd_distance_t* result);
+
+/*  Double-precision serial backends for all numeric types.
+ *  For single-precision computation check out the "*_serial" counterparts of those "*_accurate" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_rmsd_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_f32_t* a_centroid, simsimd_f32_t* b_centroid, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_kabsch_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_f32_t* a_centroid, simsimd_f32_t* b_centroid, simsimd_distance_t* result);
+
+SIMSIMD_PUBLIC void simsimd_rmsd_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_f16_t* a_centroid, simsimd_f16_t* b_centroid, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_kabsch_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_f16_t* a_centroid, simsimd_f16_t* b_centroid, simsimd_distance_t* result);
+
+SIMSIMD_PUBLIC void simsimd_rmsd_bf16_accurate(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_bf16_t* a_centroid, simsimd_bf16_t* b_centroid, simsimd_distance_t* result);
+SIMSIMD_PUBLIC void simsimd_kabsch_bf16_accurate(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_bf16_t* a_centroid, simsimd_bf16_t* b_centroid, simsimd_distance_t* result);
+
+// clang-format on
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/probability.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/probability.h
new file mode 100644
index 0000000000..b043299c70
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/probability.h
@@ -0,0 +1,606 @@
+/**
+ *  @file       probability.h
+ *  @brief      SIMD-accelerated Similarity Measures for Probability Distributions.
+ *  @author     Ash Vardanian
+ *  @date       October 20, 2023
+ *
+ *  Contains:
+ *  - Kullback-Leibler divergence
+ *  - Jensen–Shannon divergence
+ *
+ *  For datatypes:
+ *  - 32-bit floating point numbers
+ *  - 16-bit floating point numbers
+ *  - 16-bit brain-floating point numbers
+ *
+ *  For hardware architectures:
+ *  - Arm: NEON
+ *  - x86: Haswell, Skylake, Sapphire
+ *
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide/
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics/
+ */
+#ifndef SIMSIMD_PROBABILITY_H
+#define SIMSIMD_PROBABILITY_H
+
+#include "types.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// clang-format off
+
+/*  Serial backends for all numeric types.
+ *  By default they use 32-bit arithmetic, unless the arguments themselves contain 64-bit floats.
+ *  For double-precision computation check out the "*_accurate" variants of those "*_serial" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_kl_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_kl_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_kl_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_kl_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+
+/*  Double-precision serial backends for all numeric types.
+ *  For single-precision computation check out the "*_serial" counterparts of those "*_accurate" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_kl_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_kl_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_kl_bf16_accurate(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_bf16_accurate(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+
+/*  SIMD-powered backends for Arm NEON, mostly using 32-bit arithmetic over 128-bit words.
+ *  By far the most portable backend, covering most Arm v8 devices, over a billion phones, and almost all
+ *  server CPUs produced before 2023.
+ */
+SIMSIMD_PUBLIC void simsimd_kl_f32_neon(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f32_neon(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_kl_f16_neon(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f16_neon(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+
+/*  SIMD-powered backends for AVX2 CPUs of Haswell generation and newer, using 32-bit arithmetic over 256-bit words.
+ *  First demonstrated in 2011, at least one Haswell-based processor was still being sold in 2022 — the Pentium G3420.
+ *  Practically all modern x86 CPUs support AVX2, FMA, and F16C, making it a perfect baseline for SIMD algorithms.
+ *  On other hand, there is no need to implement AVX2 versions of `f32` and `f64` functions, as those are
+ *  properly vectorized by recent compilers.
+ */
+SIMSIMD_PUBLIC void simsimd_kl_f16_haswell(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f16_haswell(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+
+/*  SIMD-powered backends for various generations of AVX512 CPUs.
+ *  Skylake is handy, as it supports masked loads and other operations, avoiding the need for the tail loop.
+ *  Ice Lake added VNNI, VPOPCNTDQ, IFMA, VBMI, VAES, GFNI, VBMI2, BITALG, VPCLMULQDQ, and other extensions for integral operations.
+ *  Sapphire Rapids added tiled matrix operations, but we are most interested in the new mixed-precision FMA instructions.
+ */
+SIMSIMD_PUBLIC void simsimd_kl_f32_skylake(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f32_skylake(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_kl_f16_sapphire(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+SIMSIMD_PUBLIC void simsimd_js_f16_sapphire(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* divergence);
+// clang-format on
+
+#define SIMSIMD_MAKE_KL(name, input_type, accumulator_type, load_and_convert, epsilon)                        \
+    SIMSIMD_PUBLIC void simsimd_kl_##input_type##_##name(simsimd_##input_type##_t const *a,                   \
+                                                         simsimd_##input_type##_t const *b, simsimd_size_t n, \
+                                                         simsimd_distance_t *result) {                        \
+        simsimd_##accumulator_type##_t d = 0;                                                                 \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                             \
+            simsimd_##accumulator_type##_t ai = load_and_convert(a + i);                                      \
+            simsimd_##accumulator_type##_t bi = load_and_convert(b + i);                                      \
+            d += ai * SIMSIMD_LOG((ai + epsilon) / (bi + epsilon));                                           \
+        }                                                                                                     \
+        *result = (simsimd_distance_t)d;                                                                      \
+    }
+
+#define SIMSIMD_MAKE_JS(name, input_type, accumulator_type, load_and_convert, epsilon)                        \
+    SIMSIMD_PUBLIC void simsimd_js_##input_type##_##name(simsimd_##input_type##_t const *a,                   \
+                                                         simsimd_##input_type##_t const *b, simsimd_size_t n, \
+                                                         simsimd_distance_t *result) {                        \
+        simsimd_##accumulator_type##_t d = 0;                                                                 \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                             \
+            simsimd_##accumulator_type##_t ai = load_and_convert(a + i);                                      \
+            simsimd_##accumulator_type##_t bi = load_and_convert(b + i);                                      \
+            simsimd_##accumulator_type##_t mi = (ai + bi) / 2;                                                \
+            d += ai * SIMSIMD_LOG((ai + epsilon) / (mi + epsilon));                                           \
+            d += bi * SIMSIMD_LOG((bi + epsilon) / (mi + epsilon));                                           \
+        }                                                                                                     \
+        *result = SIMSIMD_SQRT(((simsimd_distance_t)d / 2));                                                  \
+    }
+
+SIMSIMD_MAKE_KL(serial, f64, f64, SIMSIMD_DEREFERENCE, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_kl_f64_serial
+SIMSIMD_MAKE_JS(serial, f64, f64, SIMSIMD_DEREFERENCE, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_js_f64_serial
+
+SIMSIMD_MAKE_KL(serial, f32, f32, SIMSIMD_DEREFERENCE, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_kl_f32_serial
+SIMSIMD_MAKE_JS(serial, f32, f32, SIMSIMD_DEREFERENCE, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_js_f32_serial
+
+SIMSIMD_MAKE_KL(serial, f16, f32, SIMSIMD_F16_TO_F32, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_kl_f16_serial
+SIMSIMD_MAKE_JS(serial, f16, f32, SIMSIMD_F16_TO_F32, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_js_f16_serial
+
+SIMSIMD_MAKE_KL(serial, bf16, f32, SIMSIMD_BF16_TO_F32, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_kl_bf16_serial
+SIMSIMD_MAKE_JS(serial, bf16, f32, SIMSIMD_BF16_TO_F32, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_js_bf16_serial
+
+SIMSIMD_MAKE_KL(accurate, f32, f64, SIMSIMD_DEREFERENCE, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_kl_f32_accurate
+SIMSIMD_MAKE_JS(accurate, f32, f64, SIMSIMD_DEREFERENCE, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_js_f32_accurate
+
+SIMSIMD_MAKE_KL(accurate, f16, f64, SIMSIMD_F16_TO_F32, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_kl_f16_accurate
+SIMSIMD_MAKE_JS(accurate, f16, f64, SIMSIMD_F16_TO_F32, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_js_f16_accurate
+
+SIMSIMD_MAKE_KL(accurate, bf16, f64, SIMSIMD_BF16_TO_F32, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_kl_bf16_accurate
+SIMSIMD_MAKE_JS(accurate, bf16, f64, SIMSIMD_BF16_TO_F32, SIMSIMD_F32_DIVISION_EPSILON) // simsimd_js_bf16_accurate
+
+#if _SIMSIMD_TARGET_ARM
+#if SIMSIMD_TARGET_NEON
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd"))), apply_to = function)
+
+SIMSIMD_PUBLIC float32x4_t _simsimd_log2_f32_neon(float32x4_t x) {
+    // Extracting the exponent
+    int32x4_t i = vreinterpretq_s32_f32(x);
+    int32x4_t e = vsubq_s32(vshrq_n_s32(vandq_s32(i, vdupq_n_s32(0x7F800000)), 23), vdupq_n_s32(127));
+    float32x4_t e_float = vcvtq_f32_s32(e);
+
+    // Extracting the mantissa
+    float32x4_t m = vreinterpretq_f32_s32(vorrq_s32(vandq_s32(i, vdupq_n_s32(0x007FFFFF)), vdupq_n_s32(0x3F800000)));
+
+    // Constants for polynomial
+    float32x4_t one = vdupq_n_f32(1.0f);
+    float32x4_t p = vdupq_n_f32(-3.4436006e-2f);
+
+    // Compute polynomial using Horner's method
+    p = vmlaq_f32(vdupq_n_f32(3.1821337e-1f), m, p);
+    p = vmlaq_f32(vdupq_n_f32(-1.2315303f), m, p);
+    p = vmlaq_f32(vdupq_n_f32(2.5988452f), m, p);
+    p = vmlaq_f32(vdupq_n_f32(-3.3241990f), m, p);
+    p = vmlaq_f32(vdupq_n_f32(3.1157899f), m, p);
+
+    // Final computation
+    float32x4_t result = vaddq_f32(vmulq_f32(p, vsubq_f32(m, one)), e_float);
+    return result;
+}
+
+SIMSIMD_PUBLIC void simsimd_kl_f32_neon(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    simsimd_f32_t epsilon = SIMSIMD_F32_DIVISION_EPSILON;
+    float32x4_t epsilon_vec = vdupq_n_f32(epsilon);
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    float32x4_t a_vec, b_vec;
+
+simsimd_kl_f32_neon_cycle:
+    if (n < 4) {
+        a_vec = _simsimd_partial_load_f32x4_neon(a, n);
+        b_vec = _simsimd_partial_load_f32x4_neon(b, n);
+        n = 0;
+    }
+    else {
+        a_vec = vld1q_f32(a);
+        b_vec = vld1q_f32(b);
+        n -= 4, a += 4, b += 4;
+    }
+
+    float32x4_t ratio_vec = vdivq_f32(vaddq_f32(a_vec, epsilon_vec), vaddq_f32(b_vec, epsilon_vec));
+    float32x4_t log_ratio_vec = _simsimd_log2_f32_neon(ratio_vec);
+    float32x4_t prod_vec = vmulq_f32(a_vec, log_ratio_vec);
+    sum_vec = vaddq_f32(sum_vec, prod_vec);
+    if (n != 0) goto simsimd_kl_f32_neon_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    simsimd_f32_t sum = vaddvq_f32(sum_vec) * log2_normalizer;
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_js_f32_neon(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    simsimd_f32_t epsilon = SIMSIMD_F32_DIVISION_EPSILON;
+    float32x4_t epsilon_vec = vdupq_n_f32(epsilon);
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    float32x4_t a_vec, b_vec;
+
+simsimd_js_f32_neon_cycle:
+    if (n < 4) {
+        a_vec = _simsimd_partial_load_f32x4_neon(a, n);
+        b_vec = _simsimd_partial_load_f32x4_neon(b, n);
+        n = 0;
+    }
+    else {
+        a_vec = vld1q_f32(a);
+        b_vec = vld1q_f32(b);
+        n -= 4, a += 4, b += 4;
+    }
+
+    float32x4_t m_vec = vmulq_f32(vaddq_f32(a_vec, b_vec), vdupq_n_f32(0.5));
+    float32x4_t ratio_a_vec = vdivq_f32(vaddq_f32(a_vec, epsilon_vec), vaddq_f32(m_vec, epsilon_vec));
+    float32x4_t ratio_b_vec = vdivq_f32(vaddq_f32(b_vec, epsilon_vec), vaddq_f32(m_vec, epsilon_vec));
+    float32x4_t log_ratio_a_vec = _simsimd_log2_f32_neon(ratio_a_vec);
+    float32x4_t log_ratio_b_vec = _simsimd_log2_f32_neon(ratio_b_vec);
+    float32x4_t prod_a_vec = vmulq_f32(a_vec, log_ratio_a_vec);
+    float32x4_t prod_b_vec = vmulq_f32(b_vec, log_ratio_b_vec);
+
+    sum_vec = vaddq_f32(sum_vec, vaddq_f32(prod_a_vec, prod_b_vec));
+    if (n != 0) goto simsimd_js_f32_neon_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    simsimd_f32_t sum = vaddvq_f32(sum_vec) * log2_normalizer / 2;
+    *result = _simsimd_sqrt_f32_neon(sum);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON
+
+#if SIMSIMD_TARGET_NEON_F16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd+fp16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd+fp16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_kl_f16_neon(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    simsimd_f32_t epsilon = SIMSIMD_F32_DIVISION_EPSILON;
+    float32x4_t epsilon_vec = vdupq_n_f32(epsilon);
+    float32x4_t a_vec, b_vec;
+
+simsimd_kl_f16_neon_cycle:
+    if (n < 4) {
+        a_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(a, n));
+        b_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(b, n));
+        n = 0;
+    }
+    else {
+        a_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)a));
+        b_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)b));
+        n -= 4, a += 4, b += 4;
+    }
+
+    float32x4_t ratio_vec = vdivq_f32(vaddq_f32(a_vec, epsilon_vec), vaddq_f32(b_vec, epsilon_vec));
+    float32x4_t log_ratio_vec = _simsimd_log2_f32_neon(ratio_vec);
+    float32x4_t prod_vec = vmulq_f32(a_vec, log_ratio_vec);
+    sum_vec = vaddq_f32(sum_vec, prod_vec);
+    if (n) goto simsimd_kl_f16_neon_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    simsimd_f32_t sum = vaddvq_f32(sum_vec) * log2_normalizer;
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_js_f16_neon(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    simsimd_f32_t epsilon = SIMSIMD_F32_DIVISION_EPSILON;
+    float32x4_t epsilon_vec = vdupq_n_f32(epsilon);
+    float32x4_t a_vec, b_vec;
+
+simsimd_js_f16_neon_cycle:
+    if (n < 4) {
+        a_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(a, n));
+        b_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(b, n));
+        n = 0;
+    }
+    else {
+        a_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)a));
+        b_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)b));
+        n -= 4, a += 4, b += 4;
+    }
+
+    float32x4_t m_vec = vmulq_f32(vaddq_f32(a_vec, b_vec), vdupq_n_f32(0.5));
+    float32x4_t ratio_a_vec = vdivq_f32(vaddq_f32(a_vec, epsilon_vec), vaddq_f32(m_vec, epsilon_vec));
+    float32x4_t ratio_b_vec = vdivq_f32(vaddq_f32(b_vec, epsilon_vec), vaddq_f32(m_vec, epsilon_vec));
+    float32x4_t log_ratio_a_vec = _simsimd_log2_f32_neon(ratio_a_vec);
+    float32x4_t log_ratio_b_vec = _simsimd_log2_f32_neon(ratio_b_vec);
+    float32x4_t prod_a_vec = vmulq_f32(a_vec, log_ratio_a_vec);
+    float32x4_t prod_b_vec = vmulq_f32(b_vec, log_ratio_b_vec);
+    sum_vec = vaddq_f32(sum_vec, vaddq_f32(prod_a_vec, prod_b_vec));
+    if (n) goto simsimd_js_f16_neon_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    simsimd_f32_t sum = vaddvq_f32(sum_vec) * log2_normalizer / 2;
+    *result = _simsimd_sqrt_f32_neon(sum);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_F16
+#endif // _SIMSIMD_TARGET_ARM
+
+#if _SIMSIMD_TARGET_X86
+#if SIMSIMD_TARGET_HASWELL
+#pragma GCC push_options
+#pragma GCC target("avx2", "f16c", "fma")
+#pragma clang attribute push(__attribute__((target("avx2,f16c,fma"))), apply_to = function)
+
+SIMSIMD_INTERNAL __m256 _simsimd_log2_f32_haswell(__m256 x) {
+    // Extracting the exponent
+    __m256i i = _mm256_castps_si256(x);
+    __m256i e = _mm256_srli_epi32(_mm256_and_si256(i, _mm256_set1_epi32(0x7F800000)), 23);
+    e = _mm256_sub_epi32(e, _mm256_set1_epi32(127)); // removing the bias
+    __m256 e_float = _mm256_cvtepi32_ps(e);
+
+    // Extracting the mantissa
+    __m256 m = _mm256_castsi256_ps(
+        _mm256_or_si256(_mm256_and_si256(i, _mm256_set1_epi32(0x007FFFFF)), _mm256_set1_epi32(0x3F800000)));
+
+    // Constants for polynomial
+    __m256 one = _mm256_set1_ps(1.0f);
+    __m256 p = _mm256_set1_ps(-3.4436006e-2f);
+
+    // Compute the polynomial using Horner's method
+    p = _mm256_fmadd_ps(m, p, _mm256_set1_ps(3.1821337e-1f));
+    p = _mm256_fmadd_ps(m, p, _mm256_set1_ps(-1.2315303f));
+    p = _mm256_fmadd_ps(m, p, _mm256_set1_ps(2.5988452f));
+    p = _mm256_fmadd_ps(m, p, _mm256_set1_ps(-3.3241990f));
+    p = _mm256_fmadd_ps(m, p, _mm256_set1_ps(3.1157899f));
+
+    // Final computation
+    __m256 result = _mm256_add_ps(_mm256_mul_ps(p, _mm256_sub_ps(m, one)), e_float);
+    return result;
+}
+
+SIMSIMD_PUBLIC void simsimd_kl_f16_haswell(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    __m256 sum_vec = _mm256_setzero_ps();
+    simsimd_f32_t epsilon = SIMSIMD_F32_DIVISION_EPSILON;
+    __m256 epsilon_vec = _mm256_set1_ps(epsilon);
+    __m256 a_vec, b_vec;
+
+simsimd_kl_f16_haswell_cycle:
+    if (n < 8) {
+        a_vec = _simsimd_partial_load_f16x8_haswell(a, n);
+        b_vec = _simsimd_partial_load_f16x8_haswell(b, n);
+        n = 0;
+    }
+    else {
+        a_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)a));
+        b_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)b));
+        n -= 8, a += 8, b += 8;
+    }
+    a_vec = _mm256_add_ps(a_vec, epsilon_vec);
+    b_vec = _mm256_add_ps(b_vec, epsilon_vec);
+    __m256 ratio_vec = _mm256_div_ps(a_vec, b_vec);
+    __m256 log_ratio_vec = _simsimd_log2_f32_haswell(ratio_vec);
+    __m256 prod_vec = _mm256_mul_ps(a_vec, log_ratio_vec);
+    sum_vec = _mm256_add_ps(sum_vec, prod_vec);
+    if (n) goto simsimd_kl_f16_haswell_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    simsimd_f32_t sum = _simsimd_reduce_f32x8_haswell(sum_vec);
+    sum *= log2_normalizer;
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_js_f16_haswell(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    simsimd_f32_t epsilon = SIMSIMD_F32_DIVISION_EPSILON;
+    __m256 epsilon_vec = _mm256_set1_ps(epsilon);
+    __m256 sum_vec = _mm256_setzero_ps();
+    __m256 a_vec, b_vec;
+
+simsimd_js_f16_haswell_cycle:
+    if (n < 8) {
+        a_vec = _simsimd_partial_load_f16x8_haswell(a, n);
+        b_vec = _simsimd_partial_load_f16x8_haswell(b, n);
+        n = 0;
+    }
+    else {
+        a_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)a));
+        b_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)b));
+        n -= 8, a += 8, b += 8;
+    }
+    a_vec = _mm256_add_ps(a_vec, epsilon_vec);
+    b_vec = _mm256_add_ps(b_vec, epsilon_vec);
+    __m256 m_vec = _mm256_mul_ps(_mm256_add_ps(a_vec, b_vec), _mm256_set1_ps(0.5f)); // M = (P + Q) / 2
+    __m256 ratio_a_vec = _mm256_div_ps(a_vec, m_vec);
+    __m256 ratio_b_vec = _mm256_div_ps(b_vec, m_vec);
+    __m256 log_ratio_a_vec = _simsimd_log2_f32_haswell(ratio_a_vec);
+    __m256 log_ratio_b_vec = _simsimd_log2_f32_haswell(ratio_b_vec);
+    __m256 prod_a_vec = _mm256_mul_ps(a_vec, log_ratio_a_vec);
+    __m256 prod_b_vec = _mm256_mul_ps(b_vec, log_ratio_b_vec);
+    sum_vec = _mm256_add_ps(sum_vec, prod_a_vec);
+    sum_vec = _mm256_add_ps(sum_vec, prod_b_vec);
+    if (n) goto simsimd_js_f16_haswell_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    simsimd_f32_t sum = _simsimd_reduce_f32x8_haswell(sum_vec);
+    sum *= log2_normalizer / 2;
+    *result = _simsimd_sqrt_f32_haswell(sum);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_HASWELL
+
+#if SIMSIMD_TARGET_SKYLAKE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2"))), apply_to = function)
+
+SIMSIMD_INTERNAL __m512 _simsimd_log2_f32_skylake(__m512 x) {
+    // Extract the exponent and mantissa
+    __m512 one = _mm512_set1_ps(1.0f);
+    __m512 e = _mm512_getexp_ps(x);
+    __m512 m = _mm512_getmant_ps(x, _MM_MANT_NORM_1_2, _MM_MANT_SIGN_src);
+
+    // Compute the polynomial using Horner's method
+    __m512 p = _mm512_set1_ps(-3.4436006e-2f);
+    p = _mm512_fmadd_ps(m, p, _mm512_set1_ps(3.1821337e-1f));
+    p = _mm512_fmadd_ps(m, p, _mm512_set1_ps(-1.2315303f));
+    p = _mm512_fmadd_ps(m, p, _mm512_set1_ps(2.5988452f));
+    p = _mm512_fmadd_ps(m, p, _mm512_set1_ps(-3.3241990f));
+    p = _mm512_fmadd_ps(m, p, _mm512_set1_ps(3.1157899f));
+
+    return _mm512_add_ps(_mm512_mul_ps(p, _mm512_sub_ps(m, one)), e);
+}
+
+SIMSIMD_PUBLIC void simsimd_kl_f32_skylake(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    __m512 sum_vec = _mm512_setzero();
+    simsimd_f32_t epsilon = SIMSIMD_F32_DIVISION_EPSILON;
+    __m512 epsilon_vec = _mm512_set1_ps(epsilon);
+    __m512 a_vec, b_vec;
+
+simsimd_kl_f32_skylake_cycle:
+    if (n < 16) {
+        __mmask16 mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_add_ps(_mm512_maskz_loadu_ps(mask, a), epsilon_vec);
+        b_vec = _mm512_add_ps(_mm512_maskz_loadu_ps(mask, b), epsilon_vec);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_add_ps(_mm512_loadu_ps(a), epsilon_vec);
+        b_vec = _mm512_add_ps(_mm512_loadu_ps(b), epsilon_vec);
+        a += 16, b += 16, n -= 16;
+    }
+    __m512 ratio_vec = _mm512_div_ps(a_vec, b_vec);
+    __m512 log_ratio_vec = _simsimd_log2_f32_skylake(ratio_vec);
+    __m512 prod_vec = _mm512_mul_ps(a_vec, log_ratio_vec);
+    sum_vec = _mm512_add_ps(sum_vec, prod_vec);
+    if (n) goto simsimd_kl_f32_skylake_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    *result = _mm512_reduce_add_ps(sum_vec) * log2_normalizer;
+}
+
+SIMSIMD_PUBLIC void simsimd_js_f32_skylake(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    __m512 sum_a_vec = _mm512_setzero();
+    __m512 sum_b_vec = _mm512_setzero();
+    simsimd_f32_t epsilon = SIMSIMD_F32_DIVISION_EPSILON;
+    __m512 epsilon_vec = _mm512_set1_ps(epsilon);
+    __m512 a_vec, b_vec;
+
+simsimd_js_f32_skylake_cycle:
+    if (n < 16) {
+        __mmask16 mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_ps(mask, a);
+        b_vec = _mm512_maskz_loadu_ps(mask, b);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps(a);
+        b_vec = _mm512_loadu_ps(b);
+        a += 16, b += 16, n -= 16;
+    }
+    __m512 m_vec = _mm512_mul_ps(_mm512_add_ps(a_vec, b_vec), _mm512_set1_ps(0.5f));
+    __mmask16 nonzero_mask_a = _mm512_cmp_ps_mask(a_vec, epsilon_vec, _CMP_GE_OQ);
+    __mmask16 nonzero_mask_b = _mm512_cmp_ps_mask(b_vec, epsilon_vec, _CMP_GE_OQ);
+    __mmask16 nonzero_mask = nonzero_mask_a & nonzero_mask_b;
+    __m512 m_recip_approx = _mm512_rcp14_ps(m_vec);
+    __m512 ratio_a_vec = _mm512_mul_ps(a_vec, m_recip_approx);
+    __m512 ratio_b_vec = _mm512_mul_ps(b_vec, m_recip_approx);
+    __m512 log_ratio_a_vec = _simsimd_log2_f32_skylake(ratio_a_vec);
+    __m512 log_ratio_b_vec = _simsimd_log2_f32_skylake(ratio_b_vec);
+    sum_a_vec = _mm512_maskz_fmadd_ps(nonzero_mask, a_vec, log_ratio_a_vec, sum_a_vec);
+    sum_b_vec = _mm512_maskz_fmadd_ps(nonzero_mask, b_vec, log_ratio_b_vec, sum_b_vec);
+    if (n) goto simsimd_js_f32_skylake_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    simsimd_f32_t sum = _mm512_reduce_add_ps(_mm512_add_ps(sum_a_vec, sum_b_vec));
+    sum *= log2_normalizer / 2;
+    *result = _simsimd_sqrt_f32_haswell(sum);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_HASWELL
+
+#if SIMSIMD_TARGET_SAPPHIRE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512fp16")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512fp16"))), apply_to = function)
+
+SIMSIMD_INTERNAL __m512h _simsimd_log2_f16_sapphire(__m512h x) {
+    // Extract the exponent and mantissa
+    __m512h one = _mm512_set1_ph((simsimd_f16_t)1);
+    __m512h e = _mm512_getexp_ph(x);
+    __m512h m = _mm512_getmant_ph(x, _MM_MANT_NORM_1_2, _MM_MANT_SIGN_src);
+
+    // Compute the polynomial using Horner's method
+    __m512h p = _mm512_set1_ph((simsimd_f16_t)-3.4436006e-2f);
+    p = _mm512_fmadd_ph(m, p, _mm512_set1_ph((simsimd_f16_t)3.1821337e-1f));
+    p = _mm512_fmadd_ph(m, p, _mm512_set1_ph((simsimd_f16_t)-1.2315303f));
+    p = _mm512_fmadd_ph(m, p, _mm512_set1_ph((simsimd_f16_t)2.5988452f));
+    p = _mm512_fmadd_ph(m, p, _mm512_set1_ph((simsimd_f16_t)-3.3241990f));
+    p = _mm512_fmadd_ph(m, p, _mm512_set1_ph((simsimd_f16_t)3.1157899f));
+
+    return _mm512_add_ph(_mm512_mul_ph(p, _mm512_sub_ph(m, one)), e);
+}
+
+SIMSIMD_PUBLIC void simsimd_kl_f16_sapphire(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+    __m512h sum_vec = _mm512_setzero_ph();
+    __m512h epsilon_vec = _mm512_set1_ph((simsimd_f16_t)SIMSIMD_F16_DIVISION_EPSILON);
+    __m512h a_vec, b_vec;
+
+simsimd_kl_f16_sapphire_cycle:
+    if (n < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_add_ph(mask, _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, a)), epsilon_vec);
+        b_vec = _mm512_maskz_add_ph(mask, _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, b)), epsilon_vec);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_add_ph(_mm512_castsi512_ph(_mm512_loadu_epi16(a)), epsilon_vec);
+        b_vec = _mm512_add_ph(_mm512_castsi512_ph(_mm512_loadu_epi16(b)), epsilon_vec);
+        a += 32, b += 32, n -= 32;
+    }
+    __m512h ratio_vec = _mm512_div_ph(a_vec, b_vec);
+    __m512h log_ratio_vec = _simsimd_log2_f16_sapphire(ratio_vec);
+    __m512h prod_vec = _mm512_mul_ph(a_vec, log_ratio_vec);
+    sum_vec = _mm512_add_ph(sum_vec, prod_vec);
+    if (n) goto simsimd_kl_f16_sapphire_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    *result = _mm512_reduce_add_ph(sum_vec) * log2_normalizer;
+}
+
+SIMSIMD_PUBLIC void simsimd_js_f16_sapphire(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+    __m512h sum_a_vec = _mm512_setzero_ph();
+    __m512h sum_b_vec = _mm512_setzero_ph();
+    __m512h epsilon_vec = _mm512_set1_ph((simsimd_f16_t)SIMSIMD_F16_DIVISION_EPSILON);
+    __m512h a_vec, b_vec;
+
+simsimd_js_f16_sapphire_cycle:
+    if (n < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, a));
+        b_vec = _mm512_castsi512_ph(_mm512_maskz_loadu_epi16(mask, b));
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_castsi512_ph(_mm512_loadu_epi16(a));
+        b_vec = _mm512_castsi512_ph(_mm512_loadu_epi16(b));
+        a += 32, b += 32, n -= 32;
+    }
+    __m512h m_vec = _mm512_mul_ph(_mm512_add_ph(a_vec, b_vec), _mm512_set1_ph((simsimd_f16_t)0.5f));
+    __mmask32 nonzero_mask_a = _mm512_cmp_ph_mask(a_vec, epsilon_vec, _CMP_GE_OQ);
+    __mmask32 nonzero_mask_b = _mm512_cmp_ph_mask(b_vec, epsilon_vec, _CMP_GE_OQ);
+    __mmask32 nonzero_mask = nonzero_mask_a & nonzero_mask_b;
+    __m512h m_recip_approx = _mm512_rcp_ph(m_vec);
+    __m512h ratio_a_vec = _mm512_mul_ph(a_vec, m_recip_approx);
+    __m512h ratio_b_vec = _mm512_mul_ph(b_vec, m_recip_approx);
+    __m512h log_ratio_a_vec = _simsimd_log2_f16_sapphire(ratio_a_vec);
+    __m512h log_ratio_b_vec = _simsimd_log2_f16_sapphire(ratio_b_vec);
+    sum_a_vec = _mm512_maskz_fmadd_ph(nonzero_mask, a_vec, log_ratio_a_vec, sum_a_vec);
+    sum_b_vec = _mm512_maskz_fmadd_ph(nonzero_mask, b_vec, log_ratio_b_vec, sum_b_vec);
+    if (n) goto simsimd_js_f16_sapphire_cycle;
+
+    simsimd_f32_t log2_normalizer = 0.693147181f;
+    simsimd_f32_t sum = _mm512_reduce_add_ph(_mm512_add_ph(sum_a_vec, sum_b_vec));
+    sum *= log2_normalizer / 2;
+    *result = _simsimd_sqrt_f32_haswell(sum);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SAPPHIRE
+#endif // _SIMSIMD_TARGET_X86
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/simsimd.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/simsimd.h
new file mode 100644
index 0000000000..14bbbdf928
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/simsimd.h
@@ -0,0 +1,2411 @@
+/**
+ *  @file       simsimd.h
+ *  @brief      SIMD-accelerated Similarity Measures and Distance Functions.
+ *  @author     Ash Vardanian
+ *  @date       March 14, 2023
+ *  @copyright  Copyright (c) 2023
+ *
+ *  References:
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics
+ *  Detecting target CPU features at compile time: https://stackoverflow.com/a/28939692/2766161
+ *
+ *  @section    Choosing x86 Target Generations
+ *
+ *  It's important to provide fine-grained controls over AVX512 families, as they are very fragmented:
+ *
+ *  - Intel Skylake servers: F, CD, VL, DQ, BW
+ *  - Intel Cascade Lake workstations: F, CD, VL, DQ, BW, VNNI
+ *       > In other words, it extends Skylake with VNNI support
+ *  - Intel Sunny Cove (Ice Lake) servers:
+ *         F, CD, VL, DQ, BW, VNNI, VPOPCNTDQ, IFMA, VBMI, VAES, GFNI, VBMI2, BITALG, VPCLMULQDQ
+ *  - AMD Zen4 (Genoa):
+ *         F, CD, VL, DQ, BW, VNNI, VPOPCNTDQ, IFMA, VBMI, VAES, GFNI, VBMI2, BITALG, VPCLMULQDQ, BF16
+ *       > In other words, it extends Sunny Cove with BF16 support
+ *  - Intel Golden Cove (Sapphire Rapids): extends Zen4 and Sunny Cove with FP16 support
+ *  - AMD Zen5 (Turin): makes VP2INTERSECT cool again
+ *
+ *  Intel Palm Cove was an irrelevant intermediate release extending Skylake with IFMA and VBMI.
+ *  Intel Willow Cove was an irrelevant intermediate release extending Sunny Cove with VP2INTERSECT,
+ *  that aren't supported by any other CPU built to date... and those are only available in Tiger Lake laptops.
+ *  Intel Cooper Lake was the only intermediary platform, that supported BF16, but not FP16.
+ *  It's mostly used in 4-socket and 8-socket high-memory configurations.
+ *
+ *  In practical terms, it makes sense to differentiate only 3 AVX512 generations:
+ *  1. Intel Skylake (pre 2019): supports single-precision dot-products.
+ *  2. Intel Ice Lake (2019-2021): advanced integer algorithms.
+ *  3. AMD Genoa (2023+): brain-floating point support.
+ *  4. Intel Sapphire Rapids (2023+): advanced mixed-precision float processing.
+ *  5. AMD Turin (2024+): advanced sparse algorithms.
+ *
+ *  To list all available macros for x86, take a recent compiler, like GCC 12 and run:
+ *       gcc-12 -march=sapphirerapids -dM -E - < /dev/null | egrep "SSE|AVX" | sort
+ *  On Arm machines you may want to check for other flags:
+ *       gcc-12 -march=native -dM -E - < /dev/null | egrep "NEON|SVE|FP16|FMA" | sort
+ *
+ *  @section    Choosing Arm Target Generations
+ *
+ *  Arm CPUs share design IP, but are produced by different vendors, potentially making the platform
+ *  even more fragmented than x86. There are 2 important families of SIMD extensions - NEON and SVE.
+ *
+ *  - Armv8-A: +fp, +simd
+ *  - Armv8.1-A: armv8-a, +crc, +lse, +rdma
+ *  - Armv8.2-A: armv8.1-a
+ *  - Armv8.3-A: armv8.2-a, +pauth
+ *  - Armv8.4-A: armv8.3-a, +flagm, +fp16fml, +dotprod
+ *  - Armv8.5-A: armv8.4-a, +sb, +ssbs, +predres
+ *  - Armv8.6-A: armv8.5-a, +bf16, +i8mm
+ *  - Armv8.7-A: armv8.6-a, +ls64
+ *  - Armv8.8-A: armv8.7-a, +mops
+ *  - Armv8.9-A: armv8.8-a
+ *  - Armv9-A: armv8.5-a, +sve, +sve2
+ *  - Armv9.1-A: armv9-a, +bf16, +i8mm
+ *  - Armv9.2-A: armv9.1-a, +ls64
+ *  - Armv9.3-A: armv9.2-a, +mops
+ *  - Armv9.4-A: armv9.3-a
+ *
+ *  SVE has been optional since Armv8.2-A, but it's a requirement for Armv9.0-A.
+ *  A 512-bit SVE variant has already been implemented on the Fugaku supercomputer.
+ *  A more flexible version, 2x256 SVE, was implemented by the AWS Graviton3 ARM processor.
+ *  Here are the most important recent families of CPU cores designed by Arm:
+ *
+ *  - Neoverse N1: armv8.2-a, extended with Armv8.4 "dotprod" instructions.
+ *    Used in AWS @b Graviton2 and Ampere @b Altra.
+ *    https://developer.arm.com/Processors/Neoverse%20N1
+ *  - Neoverse V1: armv8.4-a, extended with Armv8.6 bfloat/int8 "matmul" instructions.
+ *    Used in AWS @b Graviton3, which also enables `sve`, `svebf16`, and `svei8mm`.
+ *    https://developer.arm.com/Processors/Neoverse%20V1
+ *  - Neoverse V2: armv9.0 with SVE2 and SVE bit-permutes
+ *    Used in AWS @b Graviton4, NVIDIA @b Grace, Google @b Axion.
+ *    https://developer.arm.com/Processors/Neoverse%20V2
+ *    The N2 core is very similar to V2 and is used by Microsoft @b Cobalt.
+ *    https://developer.arm.com/Processors/Neoverse%20N2
+ *
+ *  On Consumer side, Apple is the biggest player with mobile @b A chips and desktop @b M chips.
+ *  The M1 implements Armv8.5-A, both M2 and M3 implement Armv8.6-A, and M4 is expected to have Armv9.1-A.
+ */
+
+#ifndef SIMSIMD_H
+#define SIMSIMD_H
+
+#define SIMSIMD_VERSION_MAJOR 6
+#define SIMSIMD_VERSION_MINOR 2
+#define SIMSIMD_VERSION_PATCH 1
+
+/**
+ *  @brief  Removes compile-time dispatching, and replaces it with runtime dispatching.
+ *          So the `simsimd_dot_f32` function will invoke the most advanced backend supported by the CPU,
+ *          that runs the program, rather than the most advanced backend supported by the CPU
+ *          used to compile the library or the downstream application.
+ */
+#ifndef SIMSIMD_DYNAMIC_DISPATCH
+#define SIMSIMD_DYNAMIC_DISPATCH (1) // true or false
+#endif
+
+#include "binary.h"      // Hamming, Jaccard
+#include "curved.h"      // Mahalanobis, Bilinear Forms
+#include "dot.h"         // Inner (dot) product, and its conjugate
+#include "elementwise.h" // Weighted Sum, Fused-Multiply-Add
+#include "geospatial.h"  // Haversine and Vincenty
+#include "probability.h" // Kullback-Leibler, Jensen–Shannon
+#include "sparse.h"      // Intersect
+#include "spatial.h"     // L2, Cosine
+
+// On Apple Silicon, `mrs` is not allowed in user-space, so we need to use the `sysctl` API.
+#if defined(_SIMSIMD_DEFINED_APPLE)
+#include <sys/sysctl.h>
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ *  @brief  Enumeration of supported metric kinds.
+ *          Some have aliases for convenience.
+ */
+typedef enum {
+    simsimd_metric_unknown_k = 0, ///< Unknown metric kind
+
+    // Classics:
+    simsimd_metric_dot_k = 'i',   ///< Inner product
+    simsimd_metric_inner_k = 'i', ///< Inner product alias
+
+    simsimd_metric_vdot_k = 'v', ///< Complex inner product
+
+    simsimd_metric_cos_k = 'c',     ///< Cosine similarity
+    simsimd_metric_cosine_k = 'c',  ///< Cosine similarity alias
+    simsimd_metric_angular_k = 'c', ///< Cosine similarity alias
+
+    simsimd_metric_l2_k = '2',          ///< Euclidean distance alias
+    simsimd_metric_euclidean_k = '2',   ///< Euclidean distance alias
+    simsimd_metric_l2sq_k = 'e',        ///< Squared Euclidean distance
+    simsimd_metric_sqeuclidean_k = 'e', ///< Squared Euclidean distance alias
+
+    // Binary:
+    simsimd_metric_hamming_k = 'h',   ///< Hamming distance
+    simsimd_metric_manhattan_k = 'h', ///< Manhattan distance is same as Hamming
+
+    simsimd_metric_jaccard_k = 'j',  ///< Jaccard coefficient
+    simsimd_metric_tanimoto_k = 'j', ///< Tanimoto coefficient is same as Jaccard
+
+    // Sets:
+    simsimd_metric_intersect_k = 'x',     ///< Equivalent to unnormalized Jaccard
+    simsimd_metric_spdot_counts_k = 'y',  ///< Sparse sets with integer weights
+    simsimd_metric_spdot_weights_k = 'z', ///< Sparse sets with brain floating-point weights
+
+    // Curved Spaces:
+    simsimd_metric_bilinear_k = 'b',    ///< Bilinear form
+    simsimd_metric_mahalanobis_k = 'm', ///< Mahalanobis distance
+
+    // Probability:
+    simsimd_metric_kl_k = 'k',               ///< Kullback-Leibler divergence
+    simsimd_metric_kullback_leibler_k = 'k', ///< Kullback-Leibler divergence alias
+
+    simsimd_metric_js_k = 's',             ///< Jensen-Shannon divergence
+    simsimd_metric_jensen_shannon_k = 's', ///< Jensen-Shannon divergence alias
+
+    // BLAS-like operations:
+    simsimd_metric_fma_k = 'f',  ///< Fused Multiply-Add
+    simsimd_metric_wsum_k = 'w', ///< Weighted Sum
+
+} simsimd_metric_kind_t;
+
+/**
+ *  @brief  Enumeration of SIMD capabilities of the target architecture.
+ */
+typedef enum {
+    simsimd_cap_serial_k = 1,       ///< Serial (non-SIMD) capability
+    simsimd_cap_any_k = 0x7FFFFFFF, ///< Mask representing any capability with `INT_MAX`
+
+    simsimd_cap_haswell_k = 1 << 10,  ///< x86 AVX2 capability with FMA and F16C extensions
+    simsimd_cap_skylake_k = 1 << 11,  ///< x86 AVX512 baseline capability
+    simsimd_cap_ice_k = 1 << 12,      ///< x86 AVX512 capability with advanced integer algos
+    simsimd_cap_genoa_k = 1 << 13,    ///< x86 AVX512 capability with `bf16` support
+    simsimd_cap_sapphire_k = 1 << 14, ///< x86 AVX512 capability with `f16` support
+    simsimd_cap_turin_k = 1 << 15,    ///< x86 AVX512 capability with conflict detection
+    simsimd_cap_sierra_k = 1 << 16,   ///< x86 AVX2+VNNI capability with `i8` dot-products
+
+    simsimd_cap_neon_k = 1 << 20,      ///< ARM NEON baseline capability
+    simsimd_cap_neon_f16_k = 1 << 21,  ///< ARM NEON `f16` capability
+    simsimd_cap_neon_bf16_k = 1 << 22, ///< ARM NEON `bf16` capability
+    simsimd_cap_neon_i8_k = 1 << 23,   ///< ARM NEON `i8` capability
+    simsimd_cap_sve_k = 1 << 24,       ///< ARM SVE baseline capability
+    simsimd_cap_sve_f16_k = 1 << 25,   ///< ARM SVE `f16` capability
+    simsimd_cap_sve_bf16_k = 1 << 26,  ///< ARM SVE `bf16` capability
+    simsimd_cap_sve_i8_k = 1 << 27,    ///< ARM SVE `i8` capability
+    simsimd_cap_sve2_k = 1 << 28,      ///< ARM SVE2 capability
+    simsimd_cap_sve2p1_k = 1 << 29,    ///< ARM SVE2p1 capability
+
+} simsimd_capability_t;
+
+/**
+ *  @brief  Enumeration of supported data types.
+ *
+ *  Includes complex type descriptors which in C code would use the real counterparts,
+ *  but the independent flags contain metadata to be passed between programming language
+ *  interfaces.
+ */
+typedef enum {
+    simsimd_datatype_unknown_k = 0,                  ///< Unknown data type
+    simsimd_datatype_b8_k = 1 << 1,                  ///< Single-bit values packed into 8-bit words
+    simsimd_datatype_b1x8_k = simsimd_datatype_b8_k, ///< Single-bit values packed into 8-bit words
+    simsimd_datatype_i4x2_k = 1 << 19,               ///< 4-bit signed integers packed into 8-bit words
+
+    simsimd_datatype_i8_k = 1 << 2,  ///< 8-bit signed integer
+    simsimd_datatype_i16_k = 1 << 3, ///< 16-bit signed integer
+    simsimd_datatype_i32_k = 1 << 4, ///< 32-bit signed integer
+    simsimd_datatype_i64_k = 1 << 5, ///< 64-bit signed integer
+
+    simsimd_datatype_u8_k = 1 << 6,  ///< 8-bit unsigned integer
+    simsimd_datatype_u16_k = 1 << 7, ///< 16-bit unsigned integer
+    simsimd_datatype_u32_k = 1 << 8, ///< 32-bit unsigned integer
+    simsimd_datatype_u64_k = 1 << 9, ///< 64-bit unsigned integer
+
+    simsimd_datatype_f64_k = 1 << 10,  ///< Double precision floating point
+    simsimd_datatype_f32_k = 1 << 11,  ///< Single precision floating point
+    simsimd_datatype_f16_k = 1 << 12,  ///< Half precision floating point
+    simsimd_datatype_bf16_k = 1 << 13, ///< Brain floating point
+
+    simsimd_datatype_f64c_k = 1 << 20,  ///< Complex double precision floating point
+    simsimd_datatype_f32c_k = 1 << 21,  ///< Complex single precision floating point
+    simsimd_datatype_f16c_k = 1 << 22,  ///< Complex half precision floating point
+    simsimd_datatype_bf16c_k = 1 << 23, ///< Complex brain floating point
+} simsimd_datatype_t;
+
+/**
+ *  @brief  Type-punned function pointer for dense vector representations and simplest similarity measures.
+ *
+ *  @param[in] a    Pointer to the first data array.
+ *  @param[in] b    Pointer to the second data array.
+ *  @param[in] n    Number of scalar words in the input arrays.
+ *                  When dealing with sub-byte types, the number of scalar words is the number of bytes.
+ *                  When dealing with complex types, the number of scalar words is the sum of real and imaginary parts.
+ *  @param[out] d   Output value as a double-precision float.
+ *                  In complex dot-products @b two scalars are exported for the real and imaginary parts.
+ */
+typedef void (*simsimd_metric_dense_punned_t)(void const *a, void const *b, simsimd_size_t n, simsimd_distance_t *d);
+
+/**
+ *  @brief  Type-punned function pointer for sparse vector representations and similarity measures.
+ *
+ *  @param[in] a          Pointer to the first data array, generally a sorted array of integers.
+ *  @param[in] b          Pointer to the second data array, generally a sorted array of integers.
+ *  @param[in] a_length   Number of scalar words in the first input array.
+ *  @param[in] b_length   Number of scalar words in the second input array.
+ *  @param[out] d         Output value as a double-precision float, generally without decimals.
+ */
+typedef void (*simsimd_metric_sparse_punned_t)(void const *a, void const *b,                     //
+                                               simsimd_size_t a_length, simsimd_size_t b_length, //
+                                               simsimd_distance_t *d);
+
+/**
+ *  @brief  Type-punned function pointer for curved vector spaces and similarity measures.
+ *
+ *  @param[in] a    Pointer to the first data array.
+ *  @param[in] b    Pointer to the second data array.
+ *  @param[in] c    Pointer to the metric tensor array or some covariance matrix.
+ *  @param[in] n    Number of scalar words in the input arrays.
+ *  @param[out] d   Output value as a double-precision float.
+ */
+typedef void (*simsimd_metric_curved_punned_t)(void const *a, void const *b, void const *c, //
+                                               simsimd_size_t n, simsimd_distance_t *d);
+
+/**
+ *  @brief  Type-punned function pointer for FMA operations on dense vector representations.
+ *          Implements the `y = alpha * a * b + beta * c` operation.
+ *
+ *  @param[in] a        Pointer to the first data array.
+ *  @param[in] b        Pointer to the second data array.
+ *  @param[in] c        Pointer to the third data array.
+ *  @param[in] n        Number of scalar words in the input arrays.
+ *  @param[in] alpha    Scaling factor for the first two arrays.
+ *  @param[in] beta     Scaling factor for the third array.
+ *  @param[out] y       Output value in the same precision as the input arrays.
+ */
+typedef void (*simsimd_kernel_fma_punned_t)(void const *a, void const *b, void const *c, //
+                                            simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta,
+                                            void *y);
+
+/**
+ *  @brief  Type-punned function pointer for Weighted Sum operations on dense vector representations.
+ *          Implements the `y = alpha * a + beta * b` operation.
+ *
+ *  @param[in] a        Pointer to the first data array.
+ *  @param[in] b        Pointer to the second data array.
+ *  @param[in] n        Number of scalar words in the input arrays.
+ *  @param[in] alpha    Scaling factor for the first array.
+ *  @param[in] beta     Scaling factor for the second array.
+ *  @param[out] y       Output value in the same precision as the input arrays.
+ */
+typedef void (*simsimd_kernel_wsum_punned_t)(void const *a, void const *b, //
+                                             simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta,
+                                             void *y);
+
+/**
+ *  @brief  Type-punned function pointer for a SimSIMD public interface.
+ *
+ *  Can be a `simsimd_metric_dense_punned_t`, `simsimd_metric_sparse_punned_t`, `simsimd_metric_curved_punned_t`,
+ *  `simsimd_kernel_fma_punned_t`, or `simsimd_kernel_wsum_punned_t`.
+ */
+typedef void (*simsimd_kernel_punned_t)(void *);
+
+#if SIMSIMD_DYNAMIC_DISPATCH
+SIMSIMD_DYNAMIC simsimd_capability_t simsimd_capabilities(void);
+SIMSIMD_DYNAMIC void simsimd_find_kernel_punned( //
+    simsimd_metric_kind_t kind,                  //
+    simsimd_datatype_t datatype,                 //
+    simsimd_capability_t supported,              //
+    simsimd_capability_t allowed,                //
+    simsimd_kernel_punned_t *kernel_output,      //
+    simsimd_capability_t *capability_output);
+#else
+SIMSIMD_PUBLIC simsimd_capability_t simsimd_capabilities(void);
+SIMSIMD_PUBLIC void simsimd_find_kernel_punned( //
+    simsimd_metric_kind_t kind,                 //
+    simsimd_datatype_t datatype,                //
+    simsimd_capability_t supported,             //
+    simsimd_capability_t allowed,               //
+    simsimd_kernel_punned_t *kernel_output,     //
+    simsimd_capability_t *capability_output);
+#endif
+
+#if _SIMSIMD_TARGET_X86
+
+/**
+ *  @brief  Function to determine the SIMD capabilities of the current 64-bit x86 machine at @b runtime.
+ *  @return A bitmask of the SIMD capabilities represented as a `simsimd_capability_t` enum value.
+ */
+SIMSIMD_PUBLIC simsimd_capability_t _simsimd_capabilities_x86(void) {
+
+    /// The states of 4 registers populated for a specific "cpuid" assembly call
+    union four_registers_t {
+        int array[4];
+        struct separate_t {
+            unsigned eax, ebx, ecx, edx;
+        } named;
+    } info1, info7, info7sub1;
+
+#if defined(_MSC_VER)
+    __cpuidex(info1.array, 1, 0);
+    __cpuidex(info7.array, 7, 0);
+    __cpuidex(info7sub1.array, 7, 1);
+#else
+    __asm__ __volatile__("cpuid"
+                         : "=a"(info1.named.eax), "=b"(info1.named.ebx), "=c"(info1.named.ecx), "=d"(info1.named.edx)
+                         : "a"(1), "c"(0));
+    __asm__ __volatile__("cpuid"
+                         : "=a"(info7.named.eax), "=b"(info7.named.ebx), "=c"(info7.named.ecx), "=d"(info7.named.edx)
+                         : "a"(7), "c"(0));
+    __asm__ __volatile__("cpuid"
+                         : "=a"(info7sub1.named.eax), "=b"(info7sub1.named.ebx), "=c"(info7sub1.named.ecx),
+                           "=d"(info7sub1.named.edx)
+                         : "a"(7), "c"(1));
+#endif
+
+    // Check for AVX2 (Function ID 7, EBX register)
+    // https://github.com/llvm/llvm-project/blob/50598f0ff44f3a4e75706f8c53f3380fe7faa896/clang/lib/Headers/cpuid.h#L148
+    unsigned supports_avx2 = (info7.named.ebx & 0x00000020) != 0;
+    // Check for F16C (Function ID 1, ECX register)
+    // https://github.com/llvm/llvm-project/blob/50598f0ff44f3a4e75706f8c53f3380fe7faa896/clang/lib/Headers/cpuid.h#L107
+    unsigned supports_f16c = (info1.named.ecx & 0x20000000) != 0;
+    unsigned supports_fma = (info1.named.ecx & 0x00001000) != 0;
+    // Check for AVX512F (Function ID 7, EBX register)
+    // https://github.com/llvm/llvm-project/blob/50598f0ff44f3a4e75706f8c53f3380fe7faa896/clang/lib/Headers/cpuid.h#L155
+    unsigned supports_avx512f = (info7.named.ebx & 0x00010000) != 0;
+    // Check for AVX512FP16 (Function ID 7, EDX register)
+    // https://github.com/llvm/llvm-project/blob/50598f0ff44f3a4e75706f8c53f3380fe7faa896/clang/lib/Headers/cpuid.h#L198C9-L198C23
+    unsigned supports_avx512fp16 = (info7.named.edx & 0x00800000) != 0;
+    // Check for AVX512VNNI (Function ID 7, ECX register)
+    unsigned supports_avx512vnni = (info7.named.ecx & 0x00000800) != 0;
+    // Check for AVX512IFMA (Function ID 7, EBX register)
+    unsigned supports_avx512ifma = (info7.named.ebx & 0x00200000) != 0;
+    // Check for AVX512BITALG (Function ID 7, ECX register)
+    unsigned supports_avx512bitalg = (info7.named.ecx & 0x00001000) != 0;
+    // Check for AVX512VBMI2 (Function ID 7, ECX register)
+    unsigned supports_avx512vbmi2 = (info7.named.ecx & 0x00000040) != 0;
+    // Check for AVX512VPOPCNTDQ (Function ID 7, ECX register)
+    unsigned supports_avx512vpopcntdq = (info7.named.ecx & 0x00004000) != 0;
+    // Check for AVX512BF16 (Function ID 7, Sub-leaf 1, EAX register)
+    // https://github.com/llvm/llvm-project/blob/50598f0ff44f3a4e75706f8c53f3380fe7faa896/clang/lib/Headers/cpuid.h#L205
+    unsigned supports_avx512bf16 = (info7sub1.named.eax & 0x00000020) != 0;
+    // Clang doesn't show the VP2INTERSECT flag, but we can get it from QEMU
+    // https://stackoverflow.com/a/68289220/2766161
+    unsigned supports_avx512vp2intersect = (info7.named.edx & 0x00000100) != 0;
+
+    // Convert specific features into CPU generations
+    unsigned supports_haswell = supports_avx2 && supports_f16c && supports_fma;
+    unsigned supports_skylake = supports_avx512f;
+    unsigned supports_ice = supports_avx512vnni && supports_avx512ifma && supports_avx512bitalg &&
+                            supports_avx512vbmi2 && supports_avx512vpopcntdq;
+    unsigned supports_genoa = supports_avx512bf16;
+    unsigned supports_sapphire = supports_avx512fp16;
+    // We don't want to accidently enable AVX512VP2INTERSECT on Intel Tiger Lake CPUs
+    unsigned supports_turin = supports_avx512vp2intersect && supports_avx512bf16;
+    unsigned supports_sierra = 0;
+
+    return (simsimd_capability_t)(                     //
+        (simsimd_cap_haswell_k * supports_haswell) |   //
+        (simsimd_cap_skylake_k * supports_skylake) |   //
+        (simsimd_cap_ice_k * supports_ice) |           //
+        (simsimd_cap_genoa_k * supports_genoa) |       //
+        (simsimd_cap_sapphire_k * supports_sapphire) | //
+        (simsimd_cap_turin_k * supports_turin) |       //
+        (simsimd_cap_sierra_k * supports_sierra) |     //
+        (simsimd_cap_serial_k));
+}
+
+#endif // _SIMSIMD_TARGET_X86
+
+#if _SIMSIMD_TARGET_ARM
+
+/*  Compiling the next section one may get: selected processor does not support system register name 'id_aa64zfr0_el1'.
+ *  Suppressing assembler errors is very complicated, so when dealing with older ARM CPUs it's simpler to compile this
+ *  function targeting newer ones.
+ */
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.5-a+sve")
+#pragma clang attribute push(__attribute__((target("arch=armv8.5-a+sve"))), apply_to = function)
+
+/**
+ *  @brief  Function to determine the SIMD capabilities of the current 64-bit Arm machine at @b runtime.
+ *  @return A bitmask of the SIMD capabilities represented as a `simsimd_capability_t` enum value.
+ */
+SIMSIMD_PUBLIC simsimd_capability_t _simsimd_capabilities_arm(void) {
+#if defined(_SIMSIMD_DEFINED_APPLE)
+    // On Apple Silicon, `mrs` is not allowed in user-space, so we need to use the `sysctl` API.
+    unsigned supports_neon = 0, supports_fp16 = 0, supports_bf16 = 0, supports_i8mm = 0;
+    size_t size = sizeof(supports_neon);
+    if (sysctlbyname("hw.optional.neon", &supports_neon, &size, NULL, 0) != 0) supports_neon = 0;
+    if (sysctlbyname("hw.optional.arm.FEAT_FP16", &supports_fp16, &size, NULL, 0) != 0) supports_fp16 = 0;
+    if (sysctlbyname("hw.optional.arm.FEAT_BF16", &supports_bf16, &size, NULL, 0) != 0) supports_bf16 = 0;
+    if (sysctlbyname("hw.optional.arm.FEAT_I8MM", &supports_i8mm, &size, NULL, 0) != 0) supports_i8mm = 0;
+
+    return (simsimd_capability_t)(                                     //
+        (simsimd_cap_neon_k * (supports_neon)) |                       //
+        (simsimd_cap_neon_f16_k * (supports_neon && supports_fp16)) |  //
+        (simsimd_cap_neon_bf16_k * (supports_neon && supports_bf16)) | //
+        (simsimd_cap_neon_i8_k * (supports_neon && supports_i8mm)) |   //
+        (simsimd_cap_serial_k));
+
+#elif defined(_SIMSIMD_DEFINED_LINUX)
+
+    // Read CPUID registers directly
+    unsigned long id_aa64isar0_el1 = 0, id_aa64isar1_el1 = 0, id_aa64pfr0_el1 = 0, id_aa64zfr0_el1 = 0;
+
+    // Now let's unpack the status flags from ID_AA64ISAR0_EL1
+    // https://developer.arm.com/documentation/ddi0601/2024-03/AArch64-Registers/ID-AA64ISAR0-EL1--AArch64-Instruction-Set-Attribute-Register-0?lang=en
+    __asm__ __volatile__("mrs %0, ID_AA64ISAR0_EL1" : "=r"(id_aa64isar0_el1));
+    // DP, bits [47:44] of ID_AA64ISAR0_EL1
+    unsigned supports_integer_dot_products = ((id_aa64isar0_el1 >> 44) & 0xF) >= 1;
+    // Now let's unpack the status flags from ID_AA64ISAR1_EL1
+    // https://developer.arm.com/documentation/ddi0601/2024-03/AArch64-Registers/ID-AA64ISAR1-EL1--AArch64-Instruction-Set-Attribute-Register-1?lang=en
+    __asm__ __volatile__("mrs %0, ID_AA64ISAR1_EL1" : "=r"(id_aa64isar1_el1));
+    // I8MM, bits [55:52] of ID_AA64ISAR1_EL1
+    unsigned supports_i8mm = ((id_aa64isar1_el1 >> 52) & 0xF) >= 1;
+    // BF16, bits [47:44] of ID_AA64ISAR1_EL1
+    unsigned supports_bf16 = ((id_aa64isar1_el1 >> 44) & 0xF) >= 1;
+
+    // Now let's unpack the status flags from ID_AA64PFR0_EL1
+    // https://developer.arm.com/documentation/ddi0601/2024-03/AArch64-Registers/ID-AA64PFR0-EL1--AArch64-Processor-Feature-Register-0?lang=en
+    __asm__ __volatile__("mrs %0, ID_AA64PFR0_EL1" : "=r"(id_aa64pfr0_el1));
+    // SVE, bits [35:32] of ID_AA64PFR0_EL1
+    unsigned supports_sve = ((id_aa64pfr0_el1 >> 32) & 0xF) >= 1;
+    // AdvSIMD, bits [23:20] of ID_AA64PFR0_EL1 can be used to check for `fp16` support
+    //  - 0b0000: integers, single, double precision arithmetic
+    //  - 0b0001: includes support for half-precision floating-point arithmetic
+    unsigned supports_fp16 = ((id_aa64pfr0_el1 >> 20) & 0xF) == 1;
+
+    // Now let's unpack the status flags from ID_AA64ZFR0_EL1
+    // https://developer.arm.com/documentation/ddi0601/2024-03/AArch64-Registers/ID-AA64ZFR0-EL1--SVE-Feature-ID-Register-0?lang=en
+    if (supports_sve) __asm__ __volatile__("mrs %0, ID_AA64ZFR0_EL1" : "=r"(id_aa64zfr0_el1));
+    // I8MM, bits [47:44] of ID_AA64ZFR0_EL1
+    unsigned supports_sve_i8mm = ((id_aa64zfr0_el1 >> 44) & 0xF) >= 1;
+    // BF16, bits [23:20] of ID_AA64ZFR0_EL1
+    unsigned supports_sve_bf16 = ((id_aa64zfr0_el1 >> 20) & 0xF) >= 1;
+    // SVEver, bits [3:0] can be used to check for capability levels:
+    //  - 0b0000: SVE is implemented
+    //  - 0b0001: SVE2 is implemented
+    //  - 0b0010: SVE2.1 is implemented
+    // This value must match the existing indicator obtained from ID_AA64PFR0_EL1:
+    unsigned supports_sve2 = ((id_aa64zfr0_el1) & 0xF) >= 1;
+    unsigned supports_sve2p1 = ((id_aa64zfr0_el1) & 0xF) >= 2;
+    unsigned supports_neon = 1; // NEON is always supported
+
+    return (simsimd_capability_t)(                                                                    //
+        (simsimd_cap_neon_k * (supports_neon)) |                                                      //
+        (simsimd_cap_neon_f16_k * (supports_neon && supports_fp16)) |                                 //
+        (simsimd_cap_neon_bf16_k * (supports_neon && supports_bf16)) |                                //
+        (simsimd_cap_neon_i8_k * (supports_neon && supports_i8mm && supports_integer_dot_products)) | //
+        (simsimd_cap_sve_k * (supports_sve)) |                                                        //
+        (simsimd_cap_sve_f16_k * (supports_sve && supports_fp16)) |                                   //
+        (simsimd_cap_sve_bf16_k * (supports_sve && supports_sve_bf16)) |                              //
+        (simsimd_cap_sve_i8_k * (supports_sve && supports_sve_i8mm)) |                                //
+        (simsimd_cap_sve2_k * (supports_sve2)) |                                                      //
+        (simsimd_cap_sve2p1_k * (supports_sve2p1)) |                                                  //
+        (simsimd_cap_serial_k));
+#else // if !_SIMSIMD_DEFINED_LINUX
+    return simsimd_cap_serial_k;
+#endif
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+
+#endif
+
+/**
+ *  @brief  Function to determine the SIMD capabilities of the current 64-bit x86 machine at @b runtime.
+ *  @return A bitmask of the SIMD capabilities represented as a `simsimd_capability_t` enum value.
+ */
+SIMSIMD_PUBLIC simsimd_capability_t _simsimd_capabilities_implementation(void) {
+#if _SIMSIMD_TARGET_X86
+    return _simsimd_capabilities_x86();
+#endif // _SIMSIMD_TARGET_X86
+#if _SIMSIMD_TARGET_ARM
+    return _simsimd_capabilities_arm();
+#endif // _SIMSIMD_TARGET_ARM
+    return simsimd_cap_serial_k;
+}
+
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wcast-function-type"
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wcast-function-type"
+
+#ifdef __cplusplus //! option ‘-Wvolatile’ is valid for C++/ObjC++ but not for C
+#pragma GCC diagnostic ignored "-Wvolatile"
+#pragma clang diagnostic ignored "-Wvolatile"
+#endif
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_f64(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                      simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE
+    if (v & simsimd_cap_sve_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f64_sve, *c = simsimd_cap_sve_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f64_sve, *c = simsimd_cap_sve_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f64_sve, *c = simsimd_cap_sve_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f64_sve, *c = simsimd_cap_sve_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON
+    if (v & simsimd_cap_neon_k) switch (k) {
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f64_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f64_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f64_neon, *c = simsimd_cap_neon_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_SKYLAKE
+    if (v & simsimd_cap_skylake_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f64_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f64_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f64_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f64_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f64_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f64_skylake, *c = simsimd_cap_skylake_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_HASWELL
+    if (v & simsimd_cap_haswell_k) switch (k) {
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f64_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f64_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f64_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f64_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f64_haswell, *c = simsimd_cap_haswell_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f64_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f64_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f64_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f64_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_js_k: *m = (m_t)&simsimd_js_f64_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_kl_k: *m = (m_t)&simsimd_kl_f64_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f64_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_mahalanobis_k: *m = (m_t)&simsimd_mahalanobis_f64_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f64_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f64_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_f32(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                      simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE
+    if (v & simsimd_cap_sve_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32_sve, *c = simsimd_cap_sve_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f32_sve, *c = simsimd_cap_sve_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f32_sve, *c = simsimd_cap_sve_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f32_sve, *c = simsimd_cap_sve_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON
+    if (v & simsimd_cap_neon_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f32_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f32_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f32_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_js_k: *m = (m_t)&simsimd_js_f32_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_kl_k: *m = (m_t)&simsimd_kl_f32_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f32_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f32_neon, *c = simsimd_cap_neon_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_SKYLAKE
+    if (v & simsimd_cap_skylake_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f32_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f32_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f32_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_js_k: *m = (m_t)&simsimd_js_f32_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_kl_k: *m = (m_t)&simsimd_kl_f32_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f32_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_mahalanobis_k:
+            *m = (m_t)&simsimd_mahalanobis_f32_skylake, *c = simsimd_cap_skylake_k;
+            return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f32_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f32_skylake, *c = simsimd_cap_skylake_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_HASWELL
+    if (v & simsimd_cap_haswell_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f32_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f32_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f32_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f32_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f32_haswell, *c = simsimd_cap_haswell_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f32_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f32_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f32_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_js_k: *m = (m_t)&simsimd_js_f32_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_kl_k: *m = (m_t)&simsimd_kl_f32_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f32_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_mahalanobis_k: *m = (m_t)&simsimd_mahalanobis_f32_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f32_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f32_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_f16(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                      simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE_F16
+    if (v & simsimd_cap_sve_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16_sve, *c = simsimd_cap_sve_f16_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f16_sve, *c = simsimd_cap_sve_f16_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f16_sve, *c = simsimd_cap_sve_f16_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f16_sve, *c = simsimd_cap_sve_f16_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON_F16
+    if (v & simsimd_cap_neon_f16_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_js_k: *m = (m_t)&simsimd_js_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_kl_k: *m = (m_t)&simsimd_kl_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_mahalanobis_k: *m = (m_t)&simsimd_mahalanobis_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f16_neon, *c = simsimd_cap_neon_f16_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_SAPPHIRE
+    if (v & simsimd_cap_sapphire_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f16_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f16_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f16_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_js_k: *m = (m_t)&simsimd_js_f16_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_kl_k: *m = (m_t)&simsimd_kl_f16_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f16_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_mahalanobis_k:
+            *m = (m_t)&simsimd_mahalanobis_f16_sapphire, *c = simsimd_cap_sapphire_k;
+            return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f16_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f16_sapphire, *c = simsimd_cap_sapphire_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_HASWELL
+    if (v & simsimd_cap_haswell_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_js_k: *m = (m_t)&simsimd_js_f16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_kl_k: *m = (m_t)&simsimd_kl_f16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_mahalanobis_k:
+            *m = (m_t)&simsimd_mahalanobis_f16_haswell, *c = simsimd_cap_haswell_k;
+            return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f16_haswell, *c = simsimd_cap_haswell_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_f16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_f16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_f16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_js_k: *m = (m_t)&simsimd_js_f16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_kl_k: *m = (m_t)&simsimd_kl_f16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_mahalanobis_k: *m = (m_t)&simsimd_mahalanobis_f16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_f16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_f16_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_bf16(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                       simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE_BF16
+    if (v & simsimd_cap_sve_bf16_k) switch (k) {
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_bf16_sve, *c = simsimd_cap_sve_bf16_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_bf16_sve, *c = simsimd_cap_sve_bf16_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_bf16_sve, *c = simsimd_cap_sve_bf16_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON_BF16
+    if (v & simsimd_cap_neon_bf16_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_bf16_neon, *c = simsimd_cap_neon_bf16_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_bf16_neon, *c = simsimd_cap_neon_bf16_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_bf16_neon, *c = simsimd_cap_neon_bf16_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_bf16_neon, *c = simsimd_cap_neon_bf16_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_bf16_neon, *c = simsimd_cap_neon_bf16_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_bf16_neon, *c = simsimd_cap_neon_bf16_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_GENOA
+    if (v & simsimd_cap_genoa_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_bf16_genoa, *c = simsimd_cap_genoa_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_bf16_genoa, *c = simsimd_cap_genoa_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_bf16_genoa, *c = simsimd_cap_genoa_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_bf16_genoa, *c = simsimd_cap_genoa_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_bf16_genoa, *c = simsimd_cap_genoa_k; return;
+        case simsimd_metric_mahalanobis_k: *m = (m_t)&simsimd_mahalanobis_bf16_genoa, *c = simsimd_cap_genoa_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_SKYLAKE
+    if (v & simsimd_cap_skylake_k) switch (k) {
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_bf16_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_bf16_skylake, *c = simsimd_cap_skylake_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_HASWELL
+    if (v & simsimd_cap_haswell_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_bf16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_bf16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_bf16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_bf16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_bf16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_mahalanobis_k:
+            *m = (m_t)&simsimd_mahalanobis_bf16_haswell, *c = simsimd_cap_haswell_k;
+            return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_bf16_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_bf16_haswell, *c = simsimd_cap_haswell_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_bf16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_bf16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_bf16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_bf16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_js_k: *m = (m_t)&simsimd_js_bf16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_kl_k: *m = (m_t)&simsimd_kl_bf16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_bf16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_mahalanobis_k:
+            *m = (m_t)&simsimd_mahalanobis_bf16_serial, *c = simsimd_cap_serial_k;
+            return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_bf16_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_bf16_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_i8(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                     simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_NEON_I8
+    if (v & simsimd_cap_neon_i8_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_i8_neon, *c = simsimd_cap_neon_i8_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_i8_neon, *c = simsimd_cap_neon_i8_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_i8_neon, *c = simsimd_cap_neon_i8_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_i8_neon, *c = simsimd_cap_neon_i8_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON_F16 //! Scaling of 8-bit integers is performed using 16-bit floats.
+    if (v & simsimd_cap_neon_f16_k) switch (k) {
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_i8_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_i8_neon, *c = simsimd_cap_neon_f16_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_SAPPHIRE //! Scaling of 8-bit integers is performed using 16-bit floats.
+    if (v & simsimd_cap_sapphire_k) switch (k) {
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_i8_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_i8_sapphire, *c = simsimd_cap_sapphire_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_ICE
+    if (v & simsimd_cap_ice_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_i8_ice, *c = simsimd_cap_ice_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_i8_ice, *c = simsimd_cap_ice_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_i8_ice, *c = simsimd_cap_ice_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_i8_ice, *c = simsimd_cap_ice_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_HASWELL
+    if (v & simsimd_cap_haswell_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_i8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_i8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_i8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_i8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_i8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_i8_haswell, *c = simsimd_cap_haswell_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_i8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_i8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_i8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_i8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_i8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_i8_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_u8(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                     simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_NEON_I8
+    if (v & simsimd_cap_neon_i8_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_u8_neon, *c = simsimd_cap_neon_i8_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_u8_neon, *c = simsimd_cap_neon_i8_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_u8_neon, *c = simsimd_cap_neon_i8_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_u8_neon, *c = simsimd_cap_neon_i8_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON_F16 //! Scaling of 8-bit integers is performed using 16-bit floats.
+    if (v & simsimd_cap_neon_f16_k) switch (k) {
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_u8_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_u8_neon, *c = simsimd_cap_neon_f16_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_SAPPHIRE //! Scaling of 8-bit integers is performed using 16-bit floats.
+    if (v & simsimd_cap_sapphire_k) switch (k) {
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_u8_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_u8_sapphire, *c = simsimd_cap_sapphire_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_ICE
+    if (v & simsimd_cap_ice_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_u8_ice, *c = simsimd_cap_ice_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_u8_ice, *c = simsimd_cap_ice_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_u8_ice, *c = simsimd_cap_ice_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_u8_ice, *c = simsimd_cap_ice_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_HASWELL
+    if (v & simsimd_cap_haswell_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_u8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_u8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_u8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_u8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_u8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_u8_haswell, *c = simsimd_cap_haswell_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_u8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_cos_k: *m = (m_t)&simsimd_cos_u8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2sq_k: *m = (m_t)&simsimd_l2sq_u8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_l2_k: *m = (m_t)&simsimd_l2_u8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_fma_k: *m = (m_t)&simsimd_fma_u8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_wsum_k: *m = (m_t)&simsimd_wsum_u8_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_b8(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                     simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE
+    if (v & simsimd_cap_sve_k) switch (k) {
+        case simsimd_metric_hamming_k: *m = (m_t)&simsimd_hamming_b8_sve, *c = simsimd_cap_sve_k; return;
+        case simsimd_metric_jaccard_k: *m = (m_t)&simsimd_jaccard_b8_sve, *c = simsimd_cap_sve_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON
+    if (v & simsimd_cap_neon_k) switch (k) {
+        case simsimd_metric_hamming_k: *m = (m_t)&simsimd_hamming_b8_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_jaccard_k: *m = (m_t)&simsimd_jaccard_b8_neon, *c = simsimd_cap_neon_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_ICE
+    if (v & simsimd_cap_ice_k) switch (k) {
+        case simsimd_metric_hamming_k: *m = (m_t)&simsimd_hamming_b8_ice, *c = simsimd_cap_ice_k; return;
+        case simsimd_metric_jaccard_k: *m = (m_t)&simsimd_jaccard_b8_ice, *c = simsimd_cap_ice_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_HASWELL
+    if (v & simsimd_cap_haswell_k) switch (k) {
+        case simsimd_metric_hamming_k: *m = (m_t)&simsimd_hamming_b8_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_jaccard_k: *m = (m_t)&simsimd_jaccard_b8_haswell, *c = simsimd_cap_haswell_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_hamming_k: *m = (m_t)&simsimd_hamming_b8_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_jaccard_k: *m = (m_t)&simsimd_jaccard_b8_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_f64c(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                       simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE
+    if (v & simsimd_cap_sve_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f64c_sve, *c = simsimd_cap_sve_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f64c_sve, *c = simsimd_cap_sve_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_SKYLAKE
+    if (v & simsimd_cap_skylake_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f64c_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f64c_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f64c_skylake, *c = simsimd_cap_skylake_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f64c_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f64c_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f64c_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_f32c(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                       simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE
+    if (v & simsimd_cap_sve_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32c_sve, *c = simsimd_cap_sve_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f32c_sve, *c = simsimd_cap_sve_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON
+    if (v & simsimd_cap_neon_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32c_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f32c_neon, *c = simsimd_cap_neon_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f32c_neon, *c = simsimd_cap_neon_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_SKYLAKE
+    if (v & simsimd_cap_skylake_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32c_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f32c_skylake, *c = simsimd_cap_skylake_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f32c_skylake, *c = simsimd_cap_skylake_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_HASWELL
+    if (v & simsimd_cap_haswell_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32c_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f32c_haswell, *c = simsimd_cap_haswell_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f32c_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f32c_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f32c_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_f16c(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                       simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE_F16
+    if (v & simsimd_cap_sve_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16c_sve, *c = simsimd_cap_sve_f16_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f16c_sve, *c = simsimd_cap_sve_f16_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON_F16
+    if (v & simsimd_cap_neon_f16_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16c_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f16c_neon, *c = simsimd_cap_neon_f16_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f16c_neon, *c = simsimd_cap_neon_bf16_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_SAPPHIRE
+    if (v & simsimd_cap_sapphire_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16c_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f16c_sapphire, *c = simsimd_cap_sapphire_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f16c_sapphire, *c = simsimd_cap_sapphire_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_HASWELL
+    if (v & simsimd_cap_haswell_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16c_haswell, *c = simsimd_cap_haswell_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f16c_haswell, *c = simsimd_cap_haswell_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_f16c_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_f16c_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_f16c_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_bf16c(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                        simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_NEON_BF16
+    if (v & simsimd_cap_neon_bf16_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_bf16c_neon, *c = simsimd_cap_neon_bf16_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_bf16c_neon, *c = simsimd_cap_neon_bf16_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_bf16c_neon, *c = simsimd_cap_neon_bf16_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_GENOA
+    if (v & simsimd_cap_genoa_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_bf16c_genoa, *c = simsimd_cap_genoa_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_bf16c_genoa, *c = simsimd_cap_genoa_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_bf16c_genoa, *c = simsimd_cap_genoa_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_dot_k: *m = (m_t)&simsimd_dot_bf16c_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_vdot_k: *m = (m_t)&simsimd_vdot_bf16c_serial, *c = simsimd_cap_serial_k; return;
+        case simsimd_metric_bilinear_k: *m = (m_t)&simsimd_bilinear_bf16c_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_u16(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                      simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE2
+    if (v & simsimd_cap_sve2_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u16_sve2, *c = simsimd_cap_sve2_k; return;
+        case simsimd_metric_spdot_counts_k: *m = (m_t)&simsimd_spdot_counts_u16_sve2, *c = simsimd_cap_sve2_k; return;
+#if SIMSIMD_TARGET_SVE_BF16 //! We also need `bf16` support for weights
+        case simsimd_metric_spdot_weights_k: *m = (m_t)&simsimd_spdot_weights_u16_sve2, *c = simsimd_cap_sve2_k; return;
+#endif
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON
+    if (v & simsimd_cap_neon_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u16_neon, *c = simsimd_cap_neon_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_TURIN
+    if (v & simsimd_cap_turin_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u16_turin, *c = simsimd_cap_turin_k; return;
+        case simsimd_metric_spdot_counts_k: *m = (m_t)&simsimd_spdot_counts_u16_turin, *c = simsimd_cap_turin_k; return;
+        case simsimd_metric_spdot_weights_k:
+            *m = (m_t)&simsimd_spdot_weights_u16_turin, *c = simsimd_cap_turin_k;
+            return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_ICE
+    if (v & simsimd_cap_ice_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u16_ice, *c = simsimd_cap_skylake_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u16_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_u32(simsimd_capability_t v, simsimd_metric_kind_t k,
+                                                      simsimd_kernel_punned_t *m, simsimd_capability_t *c) {
+    typedef simsimd_kernel_punned_t m_t;
+#if SIMSIMD_TARGET_SVE2
+    if (v & simsimd_cap_sve2_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u32_sve2, *c = simsimd_cap_sve2_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_NEON
+    if (v & simsimd_cap_neon_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u32_neon, *c = simsimd_cap_neon_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_TURIN
+    if (v & simsimd_cap_turin_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u32_turin, *c = simsimd_cap_skylake_k; return;
+        default: break;
+        }
+#endif
+#if SIMSIMD_TARGET_ICE
+    if (v & simsimd_cap_ice_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u32_ice, *c = simsimd_cap_skylake_k; return;
+        default: break;
+        }
+#endif
+    if (v & simsimd_cap_serial_k) switch (k) {
+        case simsimd_metric_intersect_k: *m = (m_t)&simsimd_intersect_u32_serial, *c = simsimd_cap_serial_k; return;
+        default: break;
+        }
+}
+
+/**
+ *  @brief  Determines the best suited metric implementation based on the given datatype,
+ *          supported and allowed by hardware capabilities.
+ *
+ *  @param kind The kind of metric to be evaluated.
+ *  @param datatype The data type for which the metric needs to be evaluated.
+ *  @param supported The hardware capabilities supported by the CPU.
+ *  @param allowed The hardware capabilities allowed for use.
+ *  @param kernel_output Output variable for the selected similarity function.
+ *  @param capability_output Output variable for the utilized hardware capabilities.
+ */
+SIMSIMD_INTERNAL void _simsimd_find_kernel_punned_implementation( //
+    simsimd_metric_kind_t kind,                                   //
+    simsimd_datatype_t datatype,                                  //
+    simsimd_capability_t supported,                               //
+    simsimd_capability_t allowed,                                 //
+    simsimd_kernel_punned_t *kernel_output,                       //
+    simsimd_capability_t *capability_output) {
+
+    // Modern compilers abso-freaking-lutely love optimizing-out my logic!
+    // Just marking the variables as `volatile` is not enough, so we have
+    // to add inline assembly to further discourage them!
+#if defined(_MSC_VER)
+    _ReadWriteBarrier();
+#else
+    __asm__ __volatile__("" ::: "memory");
+#endif
+
+    simsimd_kernel_punned_t *m = kernel_output;
+    simsimd_capability_t *c = capability_output;
+    simsimd_capability_t viable = (simsimd_capability_t)(supported & allowed);
+
+    switch (datatype) {
+
+    case simsimd_datatype_f64_k: _simsimd_find_kernel_punned_f64(viable, kind, m, c); return;
+    case simsimd_datatype_f32_k: _simsimd_find_kernel_punned_f32(viable, kind, m, c); return;
+    case simsimd_datatype_f16_k: _simsimd_find_kernel_punned_f16(viable, kind, m, c); return;
+    case simsimd_datatype_bf16_k: _simsimd_find_kernel_punned_bf16(viable, kind, m, c); return;
+    case simsimd_datatype_i8_k: _simsimd_find_kernel_punned_i8(viable, kind, m, c); return;
+    case simsimd_datatype_u8_k: _simsimd_find_kernel_punned_u8(viable, kind, m, c); return;
+    case simsimd_datatype_b8_k: _simsimd_find_kernel_punned_b8(viable, kind, m, c); return;
+    case simsimd_datatype_f32c_k: _simsimd_find_kernel_punned_f32c(viable, kind, m, c); return;
+    case simsimd_datatype_f64c_k: _simsimd_find_kernel_punned_f64c(viable, kind, m, c); return;
+    case simsimd_datatype_f16c_k: _simsimd_find_kernel_punned_f16c(viable, kind, m, c); return;
+    case simsimd_datatype_bf16c_k: _simsimd_find_kernel_punned_bf16c(viable, kind, m, c); return;
+    case simsimd_datatype_u16_k: _simsimd_find_kernel_punned_u16(viable, kind, m, c); return;
+    case simsimd_datatype_u32_k: _simsimd_find_kernel_punned_u32(viable, kind, m, c); return;
+
+    // These data-types are not supported yet
+    case simsimd_datatype_i4x2_k: break;
+    case simsimd_datatype_i16_k: break;
+    case simsimd_datatype_i32_k: break;
+    case simsimd_datatype_i64_k: break;
+    case simsimd_datatype_u64_k: break;
+    case simsimd_datatype_unknown_k: break;
+    default: break;
+    }
+
+    // Replace with zeros if no suitable implementation was found
+    *m = (simsimd_kernel_punned_t)0;
+    *c = (simsimd_capability_t)0;
+
+    // Modern compilers abso-freaking-lutely love optimizing-out my logic!
+    // Just marking the variables as `volatile` is not enough, so we have
+    // to add inline assembly to further discourage them!
+#if defined(_MSC_VER)
+    _ReadWriteBarrier();
+#else
+    __asm__ __volatile__("" ::: "memory");
+#endif
+}
+
+#pragma GCC diagnostic pop
+#pragma clang diagnostic pop
+
+/**
+ *  @brief  Selects the most suitable metric implementation based on the given metric kind, datatype,
+ *          and allowed capabilities. @b Don't call too often and prefer caching the `simsimd_capabilities()`.
+ *
+ *  @param kind The kind of metric to be evaluated.
+ *  @param datatype The data type for which the metric needs to be evaluated.
+ *  @param allowed The hardware capabilities allowed for use.
+ *  @return A function pointer to the selected metric implementation.
+ */
+SIMSIMD_PUBLIC simsimd_kernel_punned_t simsimd_metric_punned( //
+    simsimd_metric_kind_t kind,                               //
+    simsimd_datatype_t datatype,                              //
+    simsimd_capability_t allowed) {
+
+    simsimd_kernel_punned_t result = 0;
+    simsimd_capability_t c = simsimd_cap_serial_k;
+    simsimd_capability_t supported = simsimd_capabilities();
+    simsimd_find_kernel_punned(kind, datatype, supported, allowed, &result, &c);
+    return result;
+}
+
+#if SIMSIMD_DYNAMIC_DISPATCH
+
+/*  Run-time feature-testing functions
+ *  - Check if the CPU supports NEON or SVE extensions on Arm
+ *  - Check if the CPU supports AVX2 and F16C extensions on Haswell x86 CPUs and newer
+ *  - Check if the CPU supports AVX512F and AVX512BW extensions on Skylake x86 CPUs and newer
+ *  - Check if the CPU supports AVX512VNNI, AVX512IFMA, AVX512BITALG, AVX512VBMI2, and AVX512VPOPCNTDQ
+ *    extensions on Ice Lake x86 CPUs and newer
+ *  - Check if the CPU supports AVX512BF16 extensions on Genoa x86 CPUs and newer
+ *  - Check if the CPU supports AVX512FP16 extensions on Sapphire Rapids x86 CPUs and newer
+ *  - Check if the CPU supports AVX2VP2INTERSECT extensions on Turin x86 CPUs and newer
+ *
+ *  @return 1 if the CPU supports the SIMD instruction set, 0 otherwise.
+ */
+SIMSIMD_DYNAMIC simsimd_capability_t simsimd_capabilities(void);
+SIMSIMD_DYNAMIC int simsimd_uses_dynamic_dispatch(void);
+SIMSIMD_DYNAMIC int simsimd_uses_neon(void);
+SIMSIMD_DYNAMIC int simsimd_uses_neon_f16(void);
+SIMSIMD_DYNAMIC int simsimd_uses_neon_bf16(void);
+SIMSIMD_DYNAMIC int simsimd_uses_neon_i8(void);
+SIMSIMD_DYNAMIC int simsimd_uses_sve(void);
+SIMSIMD_DYNAMIC int simsimd_uses_sve_f16(void);
+SIMSIMD_DYNAMIC int simsimd_uses_sve_bf16(void);
+SIMSIMD_DYNAMIC int simsimd_uses_sve_i8(void);
+SIMSIMD_DYNAMIC int simsimd_uses_sve2(void);
+SIMSIMD_DYNAMIC int simsimd_uses_haswell(void);
+SIMSIMD_DYNAMIC int simsimd_uses_skylake(void);
+SIMSIMD_DYNAMIC int simsimd_uses_ice(void);
+SIMSIMD_DYNAMIC int simsimd_uses_genoa(void);
+SIMSIMD_DYNAMIC int simsimd_uses_sapphire(void);
+SIMSIMD_DYNAMIC int simsimd_uses_turin(void);
+SIMSIMD_DYNAMIC int simsimd_uses_sierra(void);
+
+/*  Inner products
+ *  - Dot product: the sum of the products of the corresponding elements of two vectors.
+ *  - Complex Dot product: dot product with a conjugate first argument.
+ *  - Complex Conjugate Dot product: dot product with a conjugate first argument.
+ *
+ *  @param a The first vector.
+ *  @param b The second vector.
+ *  @param n The number of elements in the vectors. Even for complex variants (the number of scalars).
+ *  @param d The output distance value.
+ *
+ *  @note The dot product can be negative, to use as a distance, take `1 - a * b`.
+ *  @note The dot product is zero if and only if the two vectors are orthogonal.
+ *  @note Defined only for floating-point and integer data types.
+ */
+SIMSIMD_DYNAMIC void simsimd_dot_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_dot_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_dot_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_dot_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_dot_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_dot_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_dot_f16c(simsimd_f16c_t const *a, simsimd_f16c_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_dot_bf16c(simsimd_bf16c_t const *a, simsimd_bf16c_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_dot_f32c(simsimd_f32c_t const *a, simsimd_f32c_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_dot_f64c(simsimd_f64c_t const *a, simsimd_f64c_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_vdot_f16c(simsimd_f16c_t const *a, simsimd_f16c_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_vdot_bf16c(simsimd_bf16c_t const *a, simsimd_bf16c_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_vdot_f32c(simsimd_f32c_t const *a, simsimd_f32c_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_vdot_f64c(simsimd_f64c_t const *a, simsimd_f64c_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *d);
+
+/*  Spatial distances
+ *  - Cosine distance: the cosine of the angle between two vectors.
+ *  - L2 squared distance: the squared Euclidean distance between two vectors.
+ *
+ *  @param a The first vector.
+ *  @param b The second vector.
+ *  @param n The number of elements in the vectors.
+ *  @param d The output distance value.
+ *
+ *  @note The output distance value is non-negative.
+ *  @note The output distance value is zero if and only if the two vectors are identical.
+ *  @note Defined only for floating-point and integer data types.
+ */
+SIMSIMD_DYNAMIC void simsimd_cos_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_cos_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_cos_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_cos_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_cos_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_cos_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2sq_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2sq_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2sq_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2sq_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2sq_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2sq_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_l2_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+
+/*  Binary distances
+ *  - Hamming distance: the number of positions at which the corresponding bits are different.
+ *  - Jaccard distance: ratio of bit-level matching positions (intersection) to the total number of positions (union).
+ *
+ *  @param a The first binary vector.
+ *  @param b The second binary vector.
+ *  @param n The number of 8-bit words in the vectors.
+ *  @param d The output distance value.
+ *
+ *  @note The output distance value is non-negative.
+ *  @note The output distance value is zero if and only if the two vectors are identical.
+ *  @note Defined only for binary data.
+ */
+SIMSIMD_DYNAMIC void simsimd_hamming_b8(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_jaccard_b8(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *d);
+
+/*  Probability distributions
+ *  - Jensen-Shannon divergence: a measure of similarity between two probability distributions.
+ *  - Kullback-Leibler divergence: a measure of how one probability distribution diverges from a second.
+ *
+ *  @param a The first discrete probability distribution.
+ *  @param b The second discrete probability distribution.
+ *  @param n The number of elements in the discrete distributions.
+ *  @param d The output divergence value.
+ *
+ *  @note The distributions are assumed to be normalized.
+ *  @note The output divergence value is non-negative.
+ *  @note The output divergence value is zero if and only if the two distributions are identical.
+ *  @note Defined only for floating-point data types.
+ */
+SIMSIMD_DYNAMIC void simsimd_kl_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_kl_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_kl_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_kl_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_js_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_js_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_js_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+SIMSIMD_DYNAMIC void simsimd_js_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d);
+
+#else
+
+/*  Compile-time feature-testing functions
+ *  - Check if the CPU supports NEON or SVE extensions on Arm
+ *  - Check if the CPU supports AVX2 and F16C extensions on Haswell x86 CPUs and newer
+ *  - Check if the CPU supports AVX512F and AVX512BW extensions on Skylake x86 CPUs and newer
+ *  - Check if the CPU supports AVX512VNNI, AVX512IFMA, AVX512BITALG, AVX512VBMI2, and AVX512VPOPCNTDQ
+ *    extensions on Ice Lake x86 CPUs and newer
+ *  - Check if the CPU supports AVX512BF16 extensions on Genoa x86 CPUs and newer
+ *  - Check if the CPU supports AVX512FP16 extensions on Sapphire Rapids x86 CPUs and newer
+ *
+ *  @return 1 if the CPU supports the SIMD instruction set, 0 otherwise.
+ */
+
+// clang-format off
+SIMSIMD_PUBLIC int simsimd_uses_neon(void) { return _SIMSIMD_TARGET_ARM && SIMSIMD_TARGET_NEON; }
+SIMSIMD_PUBLIC int simsimd_uses_neon_f16(void) { return _SIMSIMD_TARGET_ARM && SIMSIMD_TARGET_NEON_F16 ; }
+SIMSIMD_PUBLIC int simsimd_uses_neon_bf16(void) { return _SIMSIMD_TARGET_ARM && SIMSIMD_TARGET_NEON_BF16; }
+SIMSIMD_PUBLIC int simsimd_uses_neon_i8(void) { return _SIMSIMD_TARGET_ARM && SIMSIMD_TARGET_NEON_I8; }
+SIMSIMD_PUBLIC int simsimd_uses_sve(void) { return _SIMSIMD_TARGET_ARM && SIMSIMD_TARGET_SVE; }
+SIMSIMD_PUBLIC int simsimd_uses_sve_f16(void) { return _SIMSIMD_TARGET_ARM && SIMSIMD_TARGET_SVE_F16; }
+SIMSIMD_PUBLIC int simsimd_uses_sve_bf16(void) { return _SIMSIMD_TARGET_ARM && SIMSIMD_TARGET_SVE_BF16; }
+SIMSIMD_PUBLIC int simsimd_uses_sve_i8(void) { return _SIMSIMD_TARGET_ARM && SIMSIMD_TARGET_SVE_I8; }
+SIMSIMD_PUBLIC int simsimd_uses_sve2(void) { return _SIMSIMD_TARGET_ARM && SIMSIMD_TARGET_SVE2; }
+SIMSIMD_PUBLIC int simsimd_uses_haswell(void) { return _SIMSIMD_TARGET_X86 && SIMSIMD_TARGET_HASWELL; }
+SIMSIMD_PUBLIC int simsimd_uses_skylake(void) { return _SIMSIMD_TARGET_X86 && SIMSIMD_TARGET_SKYLAKE; }
+SIMSIMD_PUBLIC int simsimd_uses_ice(void) { return _SIMSIMD_TARGET_X86 && SIMSIMD_TARGET_ICE; }
+SIMSIMD_PUBLIC int simsimd_uses_genoa(void) { return _SIMSIMD_TARGET_X86 && SIMSIMD_TARGET_GENOA; }
+SIMSIMD_PUBLIC int simsimd_uses_sapphire(void) { return _SIMSIMD_TARGET_X86 && SIMSIMD_TARGET_SAPPHIRE; }
+SIMSIMD_PUBLIC int simsimd_uses_turin(void) { return _SIMSIMD_TARGET_X86 && SIMSIMD_TARGET_TURIN; }
+SIMSIMD_PUBLIC int simsimd_uses_sierra(void) { return _SIMSIMD_TARGET_X86 && SIMSIMD_TARGET_SIERRA; }
+SIMSIMD_PUBLIC int simsimd_uses_dynamic_dispatch(void) { return 0; }
+SIMSIMD_PUBLIC simsimd_capability_t simsimd_capabilities(void) { return _simsimd_capabilities_implementation(); }
+SIMSIMD_PUBLIC void simsimd_find_kernel_punned( //
+    simsimd_metric_kind_t kind,                 //
+    simsimd_datatype_t datatype,                //
+    simsimd_capability_t supported,             //
+    simsimd_capability_t allowed,               //
+    simsimd_kernel_punned_t* kernel_output,     //
+    simsimd_capability_t* capability_output) {
+    _simsimd_find_kernel_punned_implementation(kind, datatype, supported, allowed, kernel_output, capability_output);
+}
+// clang-format on
+
+/*  Inner products
+ *  - Dot product: the sum of the products of the corresponding elements of two vectors.
+ *  - Complex Dot product: dot product with a conjugate first argument.
+ *  - Complex Conjugate Dot product: dot product with a conjugate first argument.
+ *
+ *  @param a The first vector.
+ *  @param b The second vector.
+ *  @param n The number of elements in the vectors. Even for complex variants (the number of scalars).
+ *  @param d The output distance value.
+ *
+ *  @note The dot product can be negative, to use as a distance, take `1 - a * b`.
+ *  @note The dot product is zero if and only if the two vectors are orthogonal.
+ *  @note Defined only for floating-point and integer data types.
+ */
+SIMSIMD_PUBLIC void simsimd_dot_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON_F16
+    simsimd_dot_i8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_dot_i8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_dot_i8_haswell(a, b, n, d);
+#else
+    simsimd_dot_i8_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_dot_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON_F16
+    simsimd_dot_u8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_dot_u8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_dot_u8_haswell(a, b, n, d);
+#else
+    simsimd_dot_u8_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_dot_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE_F16
+    simsimd_dot_f16_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_dot_f16_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SAPPHIRE
+    simsimd_dot_f16_sapphire(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_dot_f16_haswell(a, b, n, d);
+#else
+    simsimd_dot_f16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_dot_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_GENOA
+    simsimd_dot_bf16_genoa(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_dot_bf16_haswell(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_BF16
+    simsimd_dot_bf16_neon(a, b, n, d);
+#else
+    simsimd_dot_bf16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_dot_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_dot_f32_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_dot_f32_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_dot_f32_skylake(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_dot_f32_haswell(a, b, n, d);
+#else
+    simsimd_dot_f32_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_dot_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_dot_f64_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_dot_f64_skylake(a, b, n, d);
+#else
+    simsimd_dot_f64_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_dot_f16c(simsimd_f16c_t const *a, simsimd_f16c_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE_F16
+    simsimd_dot_f16c_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_dot_f16c_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SAPPHIRE
+    simsimd_dot_f16c_sapphire(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_dot_f16c_haswell(a, b, n, d);
+#else
+    simsimd_dot_f16c_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_dot_bf16c(simsimd_bf16c_t const *a, simsimd_bf16c_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_GENOA
+    simsimd_dot_bf16c_genoa(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_BF16
+    simsimd_dot_bf16c_neon(a, b, n, d);
+#else
+    simsimd_dot_bf16c_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_dot_f32c(simsimd_f32c_t const *a, simsimd_f32c_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_dot_f32c_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_dot_f32c_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_dot_f32c_skylake(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_dot_f32c_haswell(a, b, n, d);
+#else
+    simsimd_dot_f32c_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_dot_f64c(simsimd_f64c_t const *a, simsimd_f64c_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_dot_f64c_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_dot_f64c_skylake(a, b, n, d);
+#else
+    simsimd_dot_f64c_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_vdot_f16c(simsimd_f16c_t const *a, simsimd_f16c_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_vdot_f16c_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_dot_f16c_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SAPPHIRE
+    simsimd_dot_f16c_sapphire(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_dot_f16c_haswell(a, b, n, d);
+#else
+    simsimd_vdot_f16c_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_vdot_bf16c(simsimd_bf16c_t const *a, simsimd_bf16c_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_GENOA
+    simsimd_vdot_bf16c_genoa(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_BF16
+    simsimd_dot_bf16c_neon(a, b, n, d);
+#else
+    simsimd_vdot_bf16c_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_vdot_f32c(simsimd_f32c_t const *a, simsimd_f32c_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_vdot_f32c_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_dot_f32c_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_dot_f32c_skylake(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_dot_f32c_haswell(a, b, n, d);
+#else
+    simsimd_vdot_f32c_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_vdot_f64c(simsimd_f64c_t const *a, simsimd_f64c_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_vdot_f64c_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_vdot_f64c_skylake(a, b, n, d);
+#else
+    simsimd_vdot_f64c_serial(a, b, n, d);
+#endif
+}
+
+/*  Spatial distances
+ *  - Cosine distance: the cosine of the angle between two vectors.
+ *  - L2 squared distance: the squared Euclidean distance between two vectors.
+ *
+ *  @param a The first vector.
+ *  @param b The second vector.
+ *  @param n The number of elements in the vectors.
+ *  @param d The output distance value.
+ *
+ *  @note The output distance value is non-negative.
+ *  @note The output distance value is zero if and only if the two vectors are identical.
+ *  @note Defined only for floating-point and integer data types.
+ */
+SIMSIMD_PUBLIC void simsimd_cos_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_cos_i8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_cos_i8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_cos_i8_haswell(a, b, n, d);
+#else
+    simsimd_cos_i8_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_cos_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_cos_u8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_cos_u8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_cos_u8_haswell(a, b, n, d);
+#else
+    simsimd_cos_u8_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_cos_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE_F16
+    simsimd_cos_f16_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_cos_f16_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SAPPHIRE
+    simsimd_cos_f16_sapphire(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_cos_f16_haswell(a, b, n, d);
+#else
+    simsimd_cos_f16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_cos_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_GENOA
+    simsimd_cos_bf16_genoa(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_cos_bf16_haswell(a, b, n, d);
+#elif SIMSIMD_TARGET_SVE_BF16
+    simsimd_cos_bf16_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_BF16
+    simsimd_cos_bf16_neon(a, b, n, d);
+#else
+    simsimd_cos_bf16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_cos_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_cos_f32_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_cos_f32_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_cos_f32_skylake(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_cos_f32_haswell(a, b, n, d);
+#else
+    simsimd_cos_f32_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_cos_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_cos_f64_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_cos_f64_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_cos_f64_skylake(a, b, n, d);
+#else
+    simsimd_cos_f64_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_l2sq_i8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_l2sq_i8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2sq_i8_haswell(a, b, n, d);
+#else
+    simsimd_l2sq_i8_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_l2sq_u8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_l2sq_u8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2sq_u8_haswell(a, b, n, d);
+#else
+    simsimd_l2sq_u8_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE_F16
+    simsimd_l2sq_f16_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_l2sq_f16_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SAPPHIRE
+    simsimd_l2sq_f16_sapphire(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2sq_f16_haswell(a, b, n, d);
+#else
+    simsimd_l2sq_f16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_GENOA
+    simsimd_l2sq_bf16_genoa(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2sq_bf16_haswell(a, b, n, d);
+#elif SIMSIMD_TARGET_SVE_BF16
+    simsimd_l2sq_bf16_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_BF16
+    simsimd_l2sq_bf16_neon(a, b, n, d);
+#else
+    simsimd_l2sq_bf16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_l2sq_f32_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_l2sq_f32_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_l2sq_f32_skylake(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2sq_f32_haswell(a, b, n, d);
+#else
+    simsimd_l2sq_f32_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_l2sq_f64_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_l2sq_f64_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_l2sq_f64_skylake(a, b, n, d);
+#else
+    simsimd_l2sq_f64_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                  simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_l2_i8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_l2_i8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2_i8_haswell(a, b, n, d);
+#else
+    simsimd_l2_i8_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                  simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_l2_u8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_l2_u8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2_u8_haswell(a, b, n, d);
+#else
+    simsimd_l2_u8_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE_F16
+    simsimd_l2_f16_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_l2_f16_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SAPPHIRE
+    simsimd_l2_f16_sapphire(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2_f16_haswell(a, b, n, d);
+#else
+    simsimd_l2_f16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_GENOA
+    simsimd_l2_bf16_genoa(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2_bf16_haswell(a, b, n, d);
+#elif SIMSIMD_TARGET_SVE_BF16
+    simsimd_l2_bf16_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON_BF16
+    simsimd_l2_bf16_neon(a, b, n, d);
+#else
+    simsimd_l2_bf16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_l2_f32_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_l2_f32_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_l2_f32_skylake(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_l2_f32_haswell(a, b, n, d);
+#else
+    simsimd_l2_f32_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_l2_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_l2_f64_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_l2_f64_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_l2_f64_skylake(a, b, n, d);
+#else
+    simsimd_l2_f64_serial(a, b, n, d);
+#endif
+}
+
+/*  Binary distances
+ *  - Hamming distance: the number of positions at which the corresponding bits are different.
+ *  - Jaccard distance: ratio of bit-level matching positions (intersection) to the total number of positions (union).
+ *
+ *  @param a The first binary vector.
+ *  @param b The second binary vector.
+ *  @param n The number of 8-bit words in the vectors.
+ *  @param d The output distance value.
+ *
+ *  @note The output distance value is non-negative.
+ *  @note The output distance value is zero if and only if the two vectors are identical.
+ *  @note Defined only for binary data.
+ */
+SIMSIMD_PUBLIC void simsimd_hamming_b8(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_hamming_b8_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_hamming_b8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_hamming_b8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_hamming_b8_haswell(a, b, n, d);
+#else
+    simsimd_hamming_b8_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_jaccard_b8(simsimd_b8_t const *a, simsimd_b8_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE
+    simsimd_jaccard_b8_sve(a, b, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_jaccard_b8_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_jaccard_b8_ice(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_jaccard_b8_haswell(a, b, n, d);
+#else
+    simsimd_jaccard_b8_serial(a, b, n, d);
+#endif
+}
+
+/*  Probability distributions
+ *  - Jensen-Shannon divergence: a measure of similarity between two probability distributions.
+ *  - Kullback-Leibler divergence: a measure of how one probability distribution diverges from a second.
+ *
+ *  @param a The first discrete probability distribution.
+ *  @param b The second discrete probability distribution.
+ *  @param n The number of elements in the discrete distributions.
+ *  @param d The output divergence value.
+ *
+ *  @note The distributions are assumed to be normalized.
+ *  @note The output divergence value is non-negative.
+ *  @note The output divergence value is zero if and only if the two distributions are identical.
+ *  @note Defined only for floating-point data types.
+ */
+SIMSIMD_PUBLIC void simsimd_kl_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_kl_f16_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_kl_f16_haswell(a, b, n, d);
+#else
+    simsimd_kl_f16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_kl_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+    simsimd_kl_bf16_serial(a, b, n, d);
+}
+SIMSIMD_PUBLIC void simsimd_kl_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_kl_f32_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_kl_f32_skylake(a, b, n, d);
+#else
+    simsimd_kl_f32_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_kl_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+    simsimd_kl_f64_serial(a, b, n, d);
+}
+SIMSIMD_PUBLIC void simsimd_js_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_js_f16_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_js_f16_haswell(a, b, n, d);
+#else
+    simsimd_js_f16_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_js_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t *d) {
+    simsimd_js_bf16_serial(a, b, n, d);
+}
+SIMSIMD_PUBLIC void simsimd_js_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_NEON
+    simsimd_js_f32_neon(a, b, n, d);
+#elif SIMSIMD_TARGET_SKYLAKE
+    simsimd_js_f32_skylake(a, b, n, d);
+#else
+    simsimd_js_f32_serial(a, b, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_js_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                   simsimd_distance_t *d) {
+    simsimd_js_f64_serial(a, b, n, d);
+}
+
+/*  Set operations
+ *
+ *  @param a The first sorted array of integers.
+ *  @param b The second sorted array of integers.
+ *  @param a_length The number of elements in the first array.
+ *  @param b_length The number of elements in the second array.
+ *  @param d The output for the number of elements in the intersection.
+ */
+SIMSIMD_PUBLIC void simsimd_intersect_u16(simsimd_u16_t const *a, simsimd_u16_t const *b, simsimd_size_t a_length,
+                                          simsimd_size_t b_length, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE2
+    simsimd_intersect_u16_sve2(a, b, a_length, b_length, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_intersect_u16_neon(a, b, a_length, b_length, d);
+#elif SIMSIMD_TARGET_TURIN
+    simsimd_intersect_u16_turin(a, b, a_length, b_length, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_intersect_u16_ice(a, b, a_length, b_length, d);
+#else
+    simsimd_intersect_u16_serial(a, b, a_length, b_length, d);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_intersect_u32(simsimd_u32_t const *a, simsimd_u32_t const *b, simsimd_size_t a_length,
+                                          simsimd_size_t b_length, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE2
+    simsimd_intersect_u32_sve2(a, b, a_length, b_length, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_intersect_u32_neon(a, b, a_length, b_length, d);
+#elif SIMSIMD_TARGET_TURIN
+    simsimd_intersect_u32_turin(a, b, a_length, b_length, d);
+#elif SIMSIMD_TARGET_ICE
+    simsimd_intersect_u32_ice(a, b, a_length, b_length, d);
+#else
+    simsimd_intersect_u32_serial(a, b, a_length, b_length, d);
+#endif
+}
+
+/*  Weighted set operations
+ *
+ *  @param a The first sorted array of integers.
+ *  @param b The second sorted array of integers.
+ *  @param a_weights The weights for the first array.
+ *  @param b_weights The weights for the second array.
+ *  @param a_length The number of elements in the first array.
+ *  @param b_length The number of elements in the second array.
+ *  @param d The output for the number of elements in the intersection.
+ */
+SIMSIMD_PUBLIC void simsimd_spdot_counts_u16(simsimd_u16_t const *a, simsimd_u16_t const *b,
+                                             simsimd_i16_t const *a_weights, simsimd_i16_t const *b_weights,
+                                             simsimd_size_t a_length, simsimd_size_t b_length, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE2
+    simsimd_spdot_counts_u16_sve2(a, b, a_weights, b_weights, a_length, b_length, d);
+#elif SIMSIMD_TARGET_TURIN
+    simsimd_spdot_counts_u16_turin(a, b, a_weights, b_weights, a_length, b_length, d);
+#else
+    simsimd_spdot_counts_u16_serial(a, b, a_weights, b_weights, a_length, b_length, d);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_spdot_weights_u16(simsimd_u16_t const *a, simsimd_u16_t const *b,
+                                              simsimd_bf16_t const *a_weights, simsimd_bf16_t const *b_weights,
+                                              simsimd_size_t a_length, simsimd_size_t b_length, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SVE2
+    simsimd_spdot_weights_u16_sve2(a, b, a_weights, b_weights, a_length, b_length, d);
+#elif SIMSIMD_TARGET_TURIN
+    simsimd_spdot_weights_u16_turin(a, b, a_weights, b_weights, a_length, b_length, d);
+#else
+    simsimd_spdot_weights_u16_serial(a, b, a_weights, b_weights, a_length, b_length, d);
+#endif
+}
+
+/*  Curved space distances
+ *
+ *  @param a The first vector of floating point values.
+ *  @param b The second vector of floating point values.
+ *  @param c The metric tensor or covariance matrix.
+ *  @param n The number of dimensions in the vectors.
+ *  @param d The output for the number of elements in the intersection.
+ */
+SIMSIMD_PUBLIC void simsimd_bilinear_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_f64_t const *c,
+                                         simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_bilinear_f64_skylake(a, b, c, n, d);
+#else
+    simsimd_bilinear_f64_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_bilinear_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c,
+                                         simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_bilinear_f32_skylake(a, b, c, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_bilinear_f32_neon(a, b, c, n, d);
+#else
+    simsimd_bilinear_f32_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_bilinear_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c,
+                                         simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SAPPHIRE
+    simsimd_bilinear_f16_sapphire(a, b, c, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_bilinear_f16_haswell(a, b, c, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_bilinear_f16_neon(a, b, c, n, d);
+#else
+    simsimd_bilinear_f16_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c,
+                                          simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_GENOA
+    simsimd_bilinear_bf16_genoa(a, b, c, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_bilinear_bf16_haswell(a, b, c, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_bilinear_bf16_neon(a, b, c, n, d);
+#else
+    simsimd_bilinear_bf16_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_bilinear_f64c(simsimd_f64c_t const *a, simsimd_f64c_t const *b, simsimd_f64c_t const *c,
+                                          simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_bilinear_f64c_skylake(a, b, c, n, d);
+#else
+    simsimd_bilinear_f64c_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_bilinear_f32c(simsimd_f32c_t const *a, simsimd_f32c_t const *b, simsimd_f32c_t const *c,
+                                          simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_bilinear_f32c_skylake(a, b, c, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_bilinear_f32c_neon(a, b, c, n, d);
+#else
+    simsimd_bilinear_f32c_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_bilinear_f16c(simsimd_f16c_t const *a, simsimd_f16c_t const *b, simsimd_f16c_t const *c,
+                                          simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SAPPHIRE
+    simsimd_bilinear_f16c_sapphire(a, b, c, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_bilinear_f16c_neon(a, b, c, n, d);
+#else
+    simsimd_bilinear_f16c_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_bilinear_bf16c(simsimd_bf16c_t const *a, simsimd_bf16c_t const *b, simsimd_bf16c_t const *c,
+                                           simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_GENOA
+    simsimd_bilinear_bf16c_genoa(a, b, c, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_bilinear_bf16c_neon(a, b, c, n, d);
+#else
+    simsimd_bilinear_bf16c_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_f64_t const *c,
+                                            simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_mahalanobis_f64_skylake(a, b, c, n, d);
+#else
+    simsimd_mahalanobis_f64_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c,
+                                            simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_mahalanobis_f32_skylake(a, b, c, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_mahalanobis_f32_neon(a, b, c, n, d);
+#else
+    simsimd_mahalanobis_f32_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_mahalanobis_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c,
+                                            simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_SAPPHIRE
+    simsimd_mahalanobis_f16_sapphire(a, b, c, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_mahalanobis_f16_haswell(a, b, c, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_mahalanobis_f16_neon(a, b, c, n, d);
+#else
+    simsimd_mahalanobis_f16_serial(a, b, c, n, d);
+#endif
+}
+SIMSIMD_PUBLIC void simsimd_mahalanobis_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c,
+                                             simsimd_size_t n, simsimd_distance_t *d) {
+#if SIMSIMD_TARGET_GENOA
+    simsimd_mahalanobis_bf16_genoa(a, b, c, n, d);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_mahalanobis_bf16_haswell(a, b, c, n, d);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_mahalanobis_bf16_neon(a, b, c, n, d);
+#else
+    simsimd_mahalanobis_bf16_serial(a, b, c, n, d);
+#endif
+}
+
+/*  Elementwise operations
+ *
+ *  @param a The first vector of integral or floating point values.
+ *  @param b The second vector of integral or floating point values.
+ *  @param c The third vector of integral or floating point values.
+ *  @param n The number of dimensions in the vectors.
+ *  @param alpha The first scaling factor.
+ *  @param beta The first scaling factor.
+ *  @param r The output vector or integral or floating point values.
+ */
+SIMSIMD_PUBLIC void simsimd_wsum_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f64_t *r) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_wsum_f64_skylake(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_wsum_f64_haswell(a, b, n, alpha, beta, r);
+#else
+    simsimd_wsum_f64_serial(a, b, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f32_t *r) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_wsum_f32_skylake(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_wsum_f32_haswell(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_wsum_f32_neon(a, b, n, alpha, beta, r);
+#else
+    simsimd_wsum_f32_serial(a, b, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_bf16_t *r) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_wsum_bf16_skylake(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_wsum_bf16_haswell(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_wsum_bf16_neon(a, b, n, alpha, beta, r);
+#else
+    simsimd_wsum_bf16_serial(a, b, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                     simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_f16_t *r) {
+#if SIMSIMD_TARGET_SAPPHIRE
+    simsimd_wsum_f16_sapphire(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_wsum_f16_haswell(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_wsum_f16_neon(a, b, n, alpha, beta, r);
+#else
+    simsimd_wsum_f16_serial(a, b, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_i8_t *r) {
+#if SIMSIMD_TARGET_SAPPHIRE
+    simsimd_wsum_i8_sapphire(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_wsum_i8_haswell(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_wsum_i8_neon(a, b, n, alpha, beta, r);
+#else
+    simsimd_wsum_i8_serial(a, b, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_wsum_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                    simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_u8_t *r) {
+#if SIMSIMD_TARGET_SAPPHIRE
+    simsimd_wsum_u8_sapphire(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_wsum_u8_haswell(a, b, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_wsum_u8_neon(a, b, n, alpha, beta, r);
+#else
+    simsimd_wsum_u8_serial(a, b, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f64(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_f64_t const *c,
+                                    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta,
+                                    simsimd_f64_t *r) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_fma_f64_skylake(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_fma_f64_haswell(a, b, c, n, alpha, beta, r);
+#else
+    simsimd_fma_f64_serial(a, b, c, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f32(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_f32_t const *c,
+                                    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta,
+                                    simsimd_f32_t *r) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_fma_f32_skylake(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_fma_f32_haswell(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_fma_f32_neon(a, b, c, n, alpha, beta, r);
+#else
+    simsimd_fma_f32_serial(a, b, c, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_bf16(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_bf16_t const *c,
+                                     simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta,
+                                     simsimd_bf16_t *r) {
+#if SIMSIMD_TARGET_SKYLAKE
+    simsimd_fma_bf16_skylake(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_fma_bf16_haswell(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON
+    simsimd_fma_bf16_neon(a, b, c, n, alpha, beta, r);
+#else
+    simsimd_fma_bf16_serial(a, b, c, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_f16(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_f16_t const *c,
+                                    simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta,
+                                    simsimd_f16_t *r) {
+#if SIMSIMD_TARGET_SAPPHIRE
+    simsimd_fma_f16_sapphire(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_fma_f16_haswell(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_fma_f16_neon(a, b, c, n, alpha, beta, r);
+#else
+    simsimd_fma_f16_serial(a, b, c, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_i8(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_i8_t const *c,
+                                   simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta,
+                                   simsimd_i8_t *r) {
+#if SIMSIMD_TARGET_SAPPHIRE
+    simsimd_fma_i8_sapphire(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_fma_i8_haswell(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_fma_i8_neon(a, b, c, n, alpha, beta, r);
+#else
+    simsimd_fma_i8_serial(a, b, c, n, alpha, beta, r);
+#endif
+}
+
+SIMSIMD_PUBLIC void simsimd_fma_u8(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_u8_t const *c,
+                                   simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta,
+                                   simsimd_u8_t *r) {
+#if SIMSIMD_TARGET_SAPPHIRE
+    simsimd_fma_u8_sapphire(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_HASWELL
+    simsimd_fma_u8_haswell(a, b, c, n, alpha, beta, r);
+#elif SIMSIMD_TARGET_NEON_F16
+    simsimd_fma_u8_neon(a, b, c, n, alpha, beta, r);
+#else
+    simsimd_fma_u8_serial(a, b, c, n, alpha, beta, r);
+#endif
+}
+
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // SIMSIMD_H
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/sparse.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/sparse.h
new file mode 100644
index 0000000000..493828bb01
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/sparse.h
@@ -0,0 +1,1428 @@
+/**
+ *  @file       sparse.h
+ *  @brief      SIMD-accelerated functions for Sparse Vectors.
+ *  @author     Ash Vardanian
+ *  @date       March 21, 2024
+ *
+ *  Contains:
+ *  - Set Intersection ~ Jaccard Distance
+ *  - Sparse Dot Products, outputting the count and weighted product
+ *
+ *  For datatypes:
+ *  - u16: for vocabularies under 64 thousand tokens
+ *  - u32: for vocabularies under 4 billion tokens
+ *  - u16 indicies + i16 weights: for weighted word counts
+ *  - u16 indicies + bf16 weights: for sparse matrices
+ *
+ *  For hardware architectures:
+ *  - x86: Ice Lake, Turin
+ *  - Arm: SVE2
+ *
+ *  Interestingly, to implement sparse distances and products, the most important function
+ *  is analogous to `std::set_intersection`, that outputs the intersection of two sorted
+ *  sequences. The naive implementation of that function would look like:
+ *
+ *      std::size_t intersection_size = 0;
+ *      while (i != a_length && j != b_length) {
+ *          scalar_t ai = a[i], bj = b[j];
+ *          intersection_size += ai == bj;
+ *          i += ai < bj;
+ *          j += ai >= bj;
+ *      }
+ *
+ *  Assuming we are dealing with sparse arrays, most of the time we are just evaluating
+ *  branches and skipping entries. So what if we could skip multiple entries at a time
+ *  searching for the next chunk, where an intersection is possible. For weighted arrays:
+ *
+ *      double product = 0;
+ *      while (i != a_length && j != b_length) {
+ *          scalar_t ai = a[i], bj = b[j];
+ *          product += ai == bj ? a_weights[i] * b_weights[j] : 0;
+ *          i += ai < bj;
+ *          j += ai >= bj;
+ *      }
+ *
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide/
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics/
+ */
+#ifndef SIMSIMD_SPARSE_H
+#define SIMSIMD_SPARSE_H
+
+#include "types.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*  Implements the serial set intersection algorithm, similar to `std::set_intersection in C++ STL`,
+ *  but uses clever galloping logic, if the arrays significantly differ in size.
+ */
+SIMSIMD_PUBLIC void simsimd_intersect_u16_serial(     //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_intersect_u32_serial(     //
+    simsimd_u32_t const *a, simsimd_u32_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_spdot_counts_u16_serial(                //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                 //
+    simsimd_i16_t const *a_weights, simsimd_i16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,               //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_spdot_weights_u16_serial(                 //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                   //
+    simsimd_bf16_t const *a_weights, simsimd_bf16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,                 //
+    simsimd_distance_t *results);
+
+/*  Implements the most naive set intersection algorithm, similar to `std::set_intersection in C++ STL`,
+ *  naively enumerating the elements of two arrays.
+ */
+SIMSIMD_PUBLIC void simsimd_intersect_u16_accurate(   //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_intersect_u32_accurate(   //
+    simsimd_u32_t const *a, simsimd_u32_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_spdot_counts_u16_accurate(              //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                 //
+    simsimd_i16_t const *a_weights, simsimd_i16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,               //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_spdot_weights_u16_accurate(               //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                   //
+    simsimd_bf16_t const *a_weights, simsimd_bf16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,                 //
+    simsimd_distance_t *results);
+
+/*  SIMD-powered backends for Arm SVE, mostly using 32-bit arithmetic over variable-length platform-defined word sizes.
+ *  Designed for Arm Graviton 3, Microsoft Cobalt, as well as Nvidia Grace and newer Ampere Altra CPUs.
+ */
+SIMSIMD_PUBLIC void simsimd_intersect_u16_sve2(       //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_intersect_u32_sve2(       //
+    simsimd_u32_t const *a, simsimd_u32_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_spdot_counts_u16_sve2(                  //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                 //
+    simsimd_i16_t const *a_weights, simsimd_i16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,               //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_spdot_weights_u16_sve2(                   //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                   //
+    simsimd_bf16_t const *a_weights, simsimd_bf16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,                 //
+    simsimd_distance_t *results);
+
+/*  SIMD-powered backends for various generations of AVX512 CPUs.
+ *  Skylake is handy, as it supports masked loads and other operations, avoiding the need for the tail loop.
+ *  Ice Lake, however, is needed even for the most basic kernels to perform integer matching.
+ */
+SIMSIMD_PUBLIC void simsimd_intersect_u16_ice(        //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_intersect_u32_ice(        //
+    simsimd_u32_t const *a, simsimd_u32_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+
+/*  SIMD-powered backends for AMD Turin CPUs with cheap VP2INTERSECT instructions.
+ *  On the Intel side, only mobile Tiger Lake support them, but have prohibitively high latency.
+ */
+SIMSIMD_PUBLIC void simsimd_intersect_u16_turin(      //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_intersect_u32_turin(      //
+    simsimd_u32_t const *a, simsimd_u32_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_spdot_counts_u16_turin(                 //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                 //
+    simsimd_i16_t const *a_weights, simsimd_i16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,               //
+    simsimd_distance_t *results);
+SIMSIMD_PUBLIC void simsimd_spdot_weights_u16_turin(                  //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                   //
+    simsimd_bf16_t const *a_weights, simsimd_bf16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,                 //
+    simsimd_distance_t *results);
+
+#define SIMSIMD_MAKE_INTERSECT_LINEAR(name, input_type, counter_type)                                  \
+    SIMSIMD_PUBLIC void simsimd_intersect_##input_type##_##name(                                       \
+        simsimd_##input_type##_t const *a, simsimd_##input_type##_t const *b, simsimd_size_t a_length, \
+        simsimd_size_t b_length, simsimd_distance_t *result) {                                         \
+        simsimd_##counter_type##_t intersection_size = 0;                                              \
+        simsimd_size_t i = 0, j = 0;                                                                   \
+        while (i != a_length && j != b_length) {                                                       \
+            simsimd_##input_type##_t ai = a[i];                                                        \
+            simsimd_##input_type##_t bj = b[j];                                                        \
+            intersection_size += ai == bj;                                                             \
+            i += ai < bj;                                                                              \
+            j += ai >= bj;                                                                             \
+        }                                                                                              \
+        *result = intersection_size;                                                                   \
+    }
+
+SIMSIMD_MAKE_INTERSECT_LINEAR(accurate, u16, size) // simsimd_intersect_u16_accurate
+SIMSIMD_MAKE_INTERSECT_LINEAR(accurate, u32, size) // simsimd_intersect_u32_accurate
+
+#define SIMSIMD_MAKE_INTERSECT_WEIGHTED(name, variation, input_type, counter_type, weight_type, accumulator_type, \
+                                        load_and_convert)                                                         \
+    SIMSIMD_PUBLIC void simsimd_##variation##_##input_type##_##name(                                              \
+        simsimd_##input_type##_t const *a, simsimd_##input_type##_t const *b,                                     \
+        simsimd_##weight_type##_t const *a_weights, simsimd_##weight_type##_t const *b_weights,                   \
+        simsimd_size_t a_length, simsimd_size_t b_length, simsimd_distance_t *results) {                          \
+        simsimd_##counter_type##_t intersection_size = 0;                                                         \
+        simsimd_##accumulator_type##_t weights_product = 0;                                                       \
+        simsimd_size_t i = 0, j = 0;                                                                              \
+        while (i != a_length && j != b_length) {                                                                  \
+            simsimd_##input_type##_t ai = a[i];                                                                   \
+            simsimd_##input_type##_t bj = b[j];                                                                   \
+            int matches = ai == bj;                                                                               \
+            simsimd_##counter_type##_t awi = load_and_convert(a_weights + i);                                     \
+            simsimd_##counter_type##_t bwi = load_and_convert(b_weights + i);                                     \
+            weights_product += matches * awi * bwi;                                                               \
+            intersection_size += matches;                                                                         \
+            i += ai < bj;                                                                                         \
+            j += ai >= bj;                                                                                        \
+        }                                                                                                         \
+        results[0] = intersection_size;                                                                           \
+        results[1] = weights_product;                                                                             \
+    }
+
+SIMSIMD_MAKE_INTERSECT_WEIGHTED(accurate, spdot_counts, u16, size, i16, i64,
+                                SIMSIMD_DEREFERENCE) // simsimd_spdot_counts_u16_accurate
+SIMSIMD_MAKE_INTERSECT_WEIGHTED(accurate, spdot_weights, u16, size, bf16, f64,
+                                SIMSIMD_BF16_TO_F32) // simsimd_spdot_weights_u16_accurate
+
+#define SIMSIMD_MAKE_INTERSECT_GALLOPING(name, input_type, counter_type)                                             \
+    SIMSIMD_PUBLIC simsimd_size_t simsimd_galloping_search_##input_type(simsimd_##input_type##_t const *array,       \
+                                                                        simsimd_size_t start, simsimd_size_t length, \
+                                                                        simsimd_##input_type##_t val) {              \
+        simsimd_size_t low = start;                                                                                  \
+        simsimd_size_t high = start + 1;                                                                             \
+        while (high < length && array[high] < val) {                                                                 \
+            low = high;                                                                                              \
+            high = (2 * high < length) ? 2 * high : length;                                                          \
+        }                                                                                                            \
+        while (low < high) {                                                                                         \
+            simsimd_size_t mid = low + (high - low) / 2;                                                             \
+            if (array[mid] < val) { low = mid + 1; }                                                                 \
+            else { high = mid; }                                                                                     \
+        }                                                                                                            \
+        return low;                                                                                                  \
+    }                                                                                                                \
+                                                                                                                     \
+    SIMSIMD_PUBLIC void simsimd_intersect_##input_type##_##name(                                                     \
+        simsimd_##input_type##_t const *shorter, simsimd_##input_type##_t const *longer,                             \
+        simsimd_size_t shorter_length, simsimd_size_t longer_length, simsimd_distance_t *result) {                   \
+        /* Swap arrays if necessary, as we want "longer" to be larger than "shorter" */                              \
+        if (longer_length < shorter_length) {                                                                        \
+            simsimd_##input_type##_t const *temp = shorter;                                                          \
+            shorter = longer;                                                                                        \
+            longer = temp;                                                                                           \
+            simsimd_size_t temp_length = shorter_length;                                                             \
+            shorter_length = longer_length;                                                                          \
+            longer_length = temp_length;                                                                             \
+        }                                                                                                            \
+                                                                                                                     \
+        /* Use the accurate implementation if galloping is not beneficial */                                         \
+        if (longer_length < 64 * shorter_length) {                                                                   \
+            simsimd_intersect_##input_type##_accurate(shorter, longer, shorter_length, longer_length, result);       \
+            return;                                                                                                  \
+        }                                                                                                            \
+                                                                                                                     \
+        /* Perform galloping, shrinking the target range */                                                          \
+        simsimd_##counter_type##_t intersection_size = 0;                                                            \
+        simsimd_size_t j = 0;                                                                                        \
+        for (simsimd_size_t i = 0; i < shorter_length; ++i) {                                                        \
+            simsimd_##input_type##_t shorter_i = shorter[i];                                                         \
+            j = simsimd_galloping_search_##input_type(longer, j, longer_length, shorter_i);                          \
+            if (j < longer_length && longer[j] == shorter_i) { intersection_size++; }                                \
+        }                                                                                                            \
+        *result = intersection_size;                                                                                 \
+    }
+
+SIMSIMD_MAKE_INTERSECT_GALLOPING(serial, u16, size) // simsimd_intersect_u16_serial
+SIMSIMD_MAKE_INTERSECT_GALLOPING(serial, u32, size) // simsimd_intersect_u32_serial
+SIMSIMD_MAKE_INTERSECT_WEIGHTED(serial, spdot_counts, u16, size, i16, i32,
+                                SIMSIMD_DEREFERENCE) // simsimd_spdot_counts_u16_serial
+SIMSIMD_MAKE_INTERSECT_WEIGHTED(serial, spdot_weights, u16, size, bf16, f32,
+                                SIMSIMD_BF16_TO_F32) // simsimd_spdot_weights_u16_serial
+
+/*  The AVX-512 implementations are inspired by the "Faster-Than-Native Alternatives
+ *  for x86 VP2INTERSECT Instructions" paper by Guille Diez-Canas, 2022.
+ *
+ *      https://github.com/mozonaut/vp2intersect
+ *      https://arxiv.org/pdf/2112.06342.pdf
+ *
+ *  For R&D purposes, it's important to keep the following latencies in mind:
+ *
+ *   - `_mm512_permutex_epi64` - needs F - 3 cycles latency
+ *   - `_mm512_shuffle_epi8` - needs BW - 1 cycle latency
+ *   - `_mm512_permutexvar_epi16` - needs BW - 4-6 cycles latency
+ *   - `_mm512_permutexvar_epi8` - needs VBMI - 3 cycles latency
+ */
+#if _SIMSIMD_TARGET_X86
+#if SIMSIMD_TARGET_ICE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "lzcnt", "popcnt", "avx512bw", "avx512vbmi2")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,lzcnt,popcnt,avx512bw,avx512vbmi2"))), \
+                             apply_to = function)
+
+/**
+ *  @brief  Analogous to `_mm512_2intersect_epi16_mask`, but compatible with Ice Lake CPUs,
+ *          slightly faster than the native Tiger Lake implementation, but returns only one mask.
+ */
+SIMSIMD_INTERNAL simsimd_u32_t _simsimd_intersect_u16x32_ice(__m512i a, __m512i b) {
+    __m512i a1 = _mm512_alignr_epi32(a, a, 4);
+    __m512i a2 = _mm512_alignr_epi32(a, a, 8);
+    __m512i a3 = _mm512_alignr_epi32(a, a, 12);
+
+    __m512i b1 = _mm512_shuffle_epi32(b, _MM_PERM_ADCB);
+    __m512i b2 = _mm512_shuffle_epi32(b, _MM_PERM_BADC);
+    __m512i b3 = _mm512_shuffle_epi32(b, _MM_PERM_CBAD);
+
+    __m512i b01 = _mm512_shrdi_epi32(b, b, 16);
+    __m512i b11 = _mm512_shrdi_epi32(b1, b1, 16);
+    __m512i b21 = _mm512_shrdi_epi32(b2, b2, 16);
+    __m512i b31 = _mm512_shrdi_epi32(b3, b3, 16);
+
+    __mmask32 nm00 = _mm512_cmpneq_epi16_mask(a, b);
+    __mmask32 nm01 = _mm512_cmpneq_epi16_mask(a1, b);
+    __mmask32 nm02 = _mm512_cmpneq_epi16_mask(a2, b);
+    __mmask32 nm03 = _mm512_cmpneq_epi16_mask(a3, b);
+
+    __mmask32 nm10 = _mm512_mask_cmpneq_epi16_mask(nm00, a, b01);
+    __mmask32 nm11 = _mm512_mask_cmpneq_epi16_mask(nm01, a1, b01);
+    __mmask32 nm12 = _mm512_mask_cmpneq_epi16_mask(nm02, a2, b01);
+    __mmask32 nm13 = _mm512_mask_cmpneq_epi16_mask(nm03, a3, b01);
+
+    __mmask32 nm20 = _mm512_mask_cmpneq_epi16_mask(nm10, a, b1);
+    __mmask32 nm21 = _mm512_mask_cmpneq_epi16_mask(nm11, a1, b1);
+    __mmask32 nm22 = _mm512_mask_cmpneq_epi16_mask(nm12, a2, b1);
+    __mmask32 nm23 = _mm512_mask_cmpneq_epi16_mask(nm13, a3, b1);
+
+    __mmask32 nm30 = _mm512_mask_cmpneq_epi16_mask(nm20, a, b11);
+    __mmask32 nm31 = _mm512_mask_cmpneq_epi16_mask(nm21, a1, b11);
+    __mmask32 nm32 = _mm512_mask_cmpneq_epi16_mask(nm22, a2, b11);
+    __mmask32 nm33 = _mm512_mask_cmpneq_epi16_mask(nm23, a3, b11);
+
+    __mmask32 nm40 = _mm512_mask_cmpneq_epi16_mask(nm30, a, b2);
+    __mmask32 nm41 = _mm512_mask_cmpneq_epi16_mask(nm31, a1, b2);
+    __mmask32 nm42 = _mm512_mask_cmpneq_epi16_mask(nm32, a2, b2);
+    __mmask32 nm43 = _mm512_mask_cmpneq_epi16_mask(nm33, a3, b2);
+
+    __mmask32 nm50 = _mm512_mask_cmpneq_epi16_mask(nm40, a, b21);
+    __mmask32 nm51 = _mm512_mask_cmpneq_epi16_mask(nm41, a1, b21);
+    __mmask32 nm52 = _mm512_mask_cmpneq_epi16_mask(nm42, a2, b21);
+    __mmask32 nm53 = _mm512_mask_cmpneq_epi16_mask(nm43, a3, b21);
+
+    __mmask32 nm60 = _mm512_mask_cmpneq_epi16_mask(nm50, a, b3);
+    __mmask32 nm61 = _mm512_mask_cmpneq_epi16_mask(nm51, a1, b3);
+    __mmask32 nm62 = _mm512_mask_cmpneq_epi16_mask(nm52, a2, b3);
+    __mmask32 nm63 = _mm512_mask_cmpneq_epi16_mask(nm53, a3, b3);
+
+    __mmask32 nm70 = _mm512_mask_cmpneq_epi16_mask(nm60, a, b31);
+    __mmask32 nm71 = _mm512_mask_cmpneq_epi16_mask(nm61, a1, b31);
+    __mmask32 nm72 = _mm512_mask_cmpneq_epi16_mask(nm62, a2, b31);
+    __mmask32 nm73 = _mm512_mask_cmpneq_epi16_mask(nm63, a3, b31);
+
+    return ~(simsimd_u32_t)(nm70 & simsimd_u32_rol(nm71, 8) & simsimd_u32_rol(nm72, 16) & simsimd_u32_ror(nm73, 8));
+}
+
+/**
+ *  @brief  Analogous to `_mm512_2intersect_epi32`, but compatible with Ice Lake CPUs,
+ *          slightly faster than the native Tiger Lake implementation, but returns only one mask.
+ *
+ *  Some latencies to keep in mind:
+ *
+ *  - `_mm512_shuffle_epi32` - "VPSHUFD (ZMM, ZMM, I8)":
+ *      - 1 cycle latency on Ice Lake: 1*p5
+ *      - 1 cycle latency on Genoa: 1*FP123
+ *  - `_mm512_mask_cmpneq_epi32_mask` - "VPCMPD (K, ZMM, ZMM, I8)":
+ *      - 3 cycle latency on Ice Lake: 1*p5
+ *      - 1 cycle latency on Genoa: 1*FP01
+ *  - `_mm512_alignr_epi32` - "VPALIGNR (ZMM, ZMM, ZMM, I8)":
+ *      - 1 cycle latency on Ice Lake: 1*p5
+ *      - 2 cycle latency on Genoa: 1*FP12
+ *  - `_mm512_conflict_epi32` - "VPCONFLICTD (ZMM, ZMM)":
+ *      - up to 26 cycles latency on Ice Lake: 11*p0+9*p05+17*p5
+ *      - up to 7 cycle latency on Genoa: 1*FP01+1*FP12
+ */
+SIMSIMD_INTERNAL simsimd_u16_t _simsimd_intersect_u32x16_ice(__m512i a, __m512i b) {
+    __m512i a1 = _mm512_alignr_epi32(a, a, 4);
+    __m512i b1 = _mm512_shuffle_epi32(b, _MM_PERM_ADCB);
+    __mmask16 nm00 = _mm512_cmpneq_epi32_mask(a, b);
+
+    __m512i a2 = _mm512_alignr_epi32(a, a, 8);
+    __m512i a3 = _mm512_alignr_epi32(a, a, 12);
+    __mmask16 nm01 = _mm512_cmpneq_epi32_mask(a1, b);
+    __mmask16 nm02 = _mm512_cmpneq_epi32_mask(a2, b);
+
+    __mmask16 nm03 = _mm512_cmpneq_epi32_mask(a3, b);
+    __mmask16 nm10 = _mm512_mask_cmpneq_epi32_mask(nm00, a, b1);
+    __mmask16 nm11 = _mm512_mask_cmpneq_epi32_mask(nm01, a1, b1);
+
+    __m512i b2 = _mm512_shuffle_epi32(b, _MM_PERM_BADC);
+    __mmask16 nm12 = _mm512_mask_cmpneq_epi32_mask(nm02, a2, b1);
+    __mmask16 nm13 = _mm512_mask_cmpneq_epi32_mask(nm03, a3, b1);
+    __mmask16 nm20 = _mm512_mask_cmpneq_epi32_mask(nm10, a, b2);
+
+    __m512i b3 = _mm512_shuffle_epi32(b, _MM_PERM_CBAD);
+    __mmask16 nm21 = _mm512_mask_cmpneq_epi32_mask(nm11, a1, b2);
+    __mmask16 nm22 = _mm512_mask_cmpneq_epi32_mask(nm12, a2, b2);
+    __mmask16 nm23 = _mm512_mask_cmpneq_epi32_mask(nm13, a3, b2);
+
+    __mmask16 nm0 = _mm512_mask_cmpneq_epi32_mask(nm20, a, b3);
+    __mmask16 nm1 = _mm512_mask_cmpneq_epi32_mask(nm21, a1, b3);
+    __mmask16 nm2 = _mm512_mask_cmpneq_epi32_mask(nm22, a2, b3);
+    __mmask16 nm3 = _mm512_mask_cmpneq_epi32_mask(nm23, a3, b3);
+
+    return ~(simsimd_u16_t)(nm0 & simsimd_u16_rol(nm1, 4) & simsimd_u16_rol(nm2, 8) & simsimd_u16_ror(nm3, 4));
+}
+
+SIMSIMD_PUBLIC void simsimd_intersect_u16_ice(        //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results) {
+
+    // The baseline implementation for very small arrays (2 registers or less) can be quite simple:
+    if (a_length < 64 && b_length < 64) {
+        simsimd_intersect_u16_serial(a, b, a_length, b_length, results);
+        return;
+    }
+
+    simsimd_u16_t const *const a_end = a + a_length;
+    simsimd_u16_t const *const b_end = b + b_length;
+    simsimd_size_t c = 0;
+    union vec_t {
+        __m512i zmm;
+        simsimd_u16_t u16[32];
+        simsimd_u8_t u8[64];
+    } a_vec, b_vec;
+
+    while (a + 32 < a_end && b + 32 < b_end) {
+        a_vec.zmm = _mm512_loadu_si512((__m512i const *)a);
+        b_vec.zmm = _mm512_loadu_si512((__m512i const *)b);
+
+        // Intersecting registers with `_simsimd_intersect_u16x32_ice` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u16_t a_min;
+        simsimd_u16_t a_max = a_vec.u16[31];
+        simsimd_u16_t b_min = b_vec.u16[0];
+        simsimd_u16_t b_max = b_vec.u16[31];
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && a + 64 < a_end) {
+            a += 32;
+            a_vec.zmm = _mm512_loadu_si512((__m512i const *)a);
+            a_max = a_vec.u16[31];
+        }
+        a_min = a_vec.u16[0];
+        while (b_max < a_min && b + 64 < b_end) {
+            b += 32;
+            b_vec.zmm = _mm512_loadu_si512((__m512i const *)b);
+            b_max = b_vec.u16[31];
+        }
+        b_min = b_vec.u16[0];
+
+        // Now we are likely to have some overlap, so we can intersect the registers
+        __mmask32 a_matches = _simsimd_intersect_u16x32_ice(a_vec.zmm, b_vec.zmm);
+
+        // The paper also contained a very nice procedure for exporting the matches,
+        // but we don't need it here:
+        //      _mm512_mask_compressstoreu_epi16(c, a_matches, a_vec);
+        c += _mm_popcnt_u32(a_matches); // MSVC has no `_popcnt32`
+
+        __m512i a_last_broadcasted = _mm512_set1_epi16(*(short const *)&a_max);
+        __m512i b_last_broadcasted = _mm512_set1_epi16(*(short const *)&b_max);
+        __mmask32 a_step_mask = _mm512_cmple_epu16_mask(a_vec.zmm, b_last_broadcasted);
+        __mmask32 b_step_mask = _mm512_cmple_epu16_mask(b_vec.zmm, a_last_broadcasted);
+        a += 32 - _lzcnt_u32((simsimd_u32_t)a_step_mask);
+        b += 32 - _lzcnt_u32((simsimd_u32_t)b_step_mask);
+    }
+
+    simsimd_intersect_u16_serial(a, b, a_end - a, b_end - b, results);
+    *results += c;
+}
+
+SIMSIMD_PUBLIC void simsimd_intersect_u32_ice(        //
+    simsimd_u32_t const *a, simsimd_u32_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results) {
+
+    // The baseline implementation for very small arrays (2 registers or less) can be quite simple:
+    if (a_length < 32 && b_length < 32) {
+        simsimd_intersect_u32_serial(a, b, a_length, b_length, results);
+        return;
+    }
+
+    simsimd_u32_t const *const a_end = a + a_length;
+    simsimd_u32_t const *const b_end = b + b_length;
+    simsimd_size_t c = 0;
+    union vec_t {
+        __m512i zmm;
+        simsimd_u32_t u32[16];
+        simsimd_u8_t u8[64];
+    } a_vec, b_vec;
+
+    while (a + 16 < a_end && b + 16 < b_end) {
+        a_vec.zmm = _mm512_loadu_si512((__m512i const *)a);
+        b_vec.zmm = _mm512_loadu_si512((__m512i const *)b);
+
+        // Intersecting registers with `_simsimd_intersect_u32x16_ice` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u32_t a_min;
+        simsimd_u32_t a_max = a_vec.u32[15];
+        simsimd_u32_t b_min = b_vec.u32[0];
+        simsimd_u32_t b_max = b_vec.u32[15];
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && a + 32 < a_end) {
+            a += 16;
+            a_vec.zmm = _mm512_loadu_si512((__m512i const *)a);
+            a_max = a_vec.u32[15];
+        }
+        a_min = a_vec.u32[0];
+        while (b_max < a_min && b + 32 < b_end) {
+            b += 16;
+            b_vec.zmm = _mm512_loadu_si512((__m512i const *)b);
+            b_max = b_vec.u32[15];
+        }
+        b_min = b_vec.u32[0];
+
+        // Now we are likely to have some overlap, so we can intersect the registers
+        __mmask16 a_matches = _simsimd_intersect_u32x16_ice(a_vec.zmm, b_vec.zmm);
+
+        // The paper also contained a very nice procedure for exporting the matches,
+        // but we don't need it here:
+        //      _mm512_mask_compressstoreu_epi32(c, a_matches, a_vec);
+        c += _mm_popcnt_u32(a_matches); // MSVC has no `_popcnt32`
+
+        __m512i a_last_broadcasted = _mm512_set1_epi32(*(int const *)&a_max);
+        __m512i b_last_broadcasted = _mm512_set1_epi32(*(int const *)&b_max);
+        __mmask16 a_step_mask = _mm512_cmple_epu32_mask(a_vec.zmm, b_last_broadcasted);
+        __mmask16 b_step_mask = _mm512_cmple_epu32_mask(b_vec.zmm, a_last_broadcasted);
+        a += 32 - _lzcnt_u32((simsimd_u32_t)a_step_mask);
+        b += 32 - _lzcnt_u32((simsimd_u32_t)b_step_mask);
+    }
+
+    simsimd_intersect_u32_serial(a, b, a_end - a, b_end - b, results);
+    *results += c;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_ICE
+
+#if SIMSIMD_TARGET_TURIN
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "lzcnt", "popcnt", "avx512bw", "avx512vbmi2", "avx512bf16", \
+                   "avx512vnni", "avx512vp2intersect")
+#pragma clang attribute push(                                                                                       \
+    __attribute__((target(                                                                                          \
+        "avx2,avx512f,avx512vl,bmi2,lzcnt,popcnt,avx512bw,avx512vbmi2,avx512bf16,avx512vnni,avx512vp2intersect"))), \
+    apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_intersect_u16_turin(      //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results) {
+
+    // The baseline implementation for very small arrays (2 registers or less) can be quite simple:
+    if (a_length < 64 && b_length < 64) {
+        simsimd_intersect_u16_serial(a, b, a_length, b_length, results);
+        return;
+    }
+
+    //! There is no such thing as `_mm512_2intersect_epi16`, only the 32-bit variant!
+    //! So instead of jumping through 32 entries at a time, like on Ice Lake, we will
+    //! step through 16 entries at a time.
+    simsimd_u16_t const *const a_end = a + a_length;
+    simsimd_u16_t const *const b_end = b + b_length;
+    simsimd_size_t c = 0;
+    union vec_t {
+        __m256i ymm;
+        simsimd_u16_t u16[16];
+        simsimd_u8_t u8[32];
+    } a_vec, b_vec;
+
+    while (a + 16 < a_end && b + 16 < b_end) {
+        a_vec.ymm = _mm256_lddqu_si256((__m256i const *)a);
+        b_vec.ymm = _mm256_lddqu_si256((__m256i const *)b);
+
+        // Intersecting registers with `_mm512_2intersect_epi16_mask` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u16_t a_min;
+        simsimd_u16_t a_max = a_vec.u16[15];
+        simsimd_u16_t b_min = b_vec.u16[0];
+        simsimd_u16_t b_max = b_vec.u16[15];
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && a + 32 < a_end) {
+            a += 16;
+            a_vec.ymm = _mm256_lddqu_si256((__m256i const *)a);
+            a_max = a_vec.u16[15];
+        }
+        a_min = a_vec.u16[0];
+        while (b_max < a_min && b + 32 < b_end) {
+            b += 16;
+            b_vec.ymm = _mm256_lddqu_si256((__m256i const *)b);
+            b_max = b_vec.u16[15];
+        }
+        b_min = b_vec.u16[0];
+
+        // Now we are likely to have some overlap, so we can intersect the registers
+        __m512i a_i32_vec = _mm512_cvtepu16_epi32(a_vec.ymm);
+        __m512i b_i32_vec = _mm512_cvtepu16_epi32(b_vec.ymm);
+        __mmask16 a_matches_any_in_b, b_matches_any_in_a;
+        _mm512_2intersect_epi32(a_i32_vec, b_i32_vec, &a_matches_any_in_b, &b_matches_any_in_a);
+
+        // The paper also contained a very nice procedure for exporting the matches,
+        // but we don't need it here:
+        //      _mm512_mask_compressstoreu_epi16(c, a_matches_any_in_b, a_vec);
+        c += _mm_popcnt_u32(a_matches_any_in_b); // MSVC has no `_popcnt32`
+
+        __m256i a_last_broadcasted = _mm256_set1_epi16(*(short const *)&a_max);
+        __m256i b_last_broadcasted = _mm256_set1_epi16(*(short const *)&b_max);
+        __mmask16 a_step_mask = _mm256_cmple_epu16_mask(a_vec.ymm, b_last_broadcasted);
+        __mmask16 b_step_mask = _mm256_cmple_epu16_mask(b_vec.ymm, a_last_broadcasted);
+        a += 32 - _lzcnt_u32((simsimd_u32_t)a_step_mask); //? Is this correct? Needs testing!
+        b += 32 - _lzcnt_u32((simsimd_u32_t)b_step_mask);
+    }
+
+    simsimd_intersect_u16_serial(a, b, a_end - a, b_end - b, results);
+    *results += c;
+}
+
+SIMSIMD_PUBLIC void simsimd_intersect_u32_turin(      //
+    simsimd_u32_t const *a, simsimd_u32_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results) {
+
+    // The baseline implementation for very small arrays (2 registers or less) can be quite simple:
+    if (a_length < 32 && b_length < 32) {
+        simsimd_intersect_u32_serial(a, b, a_length, b_length, results);
+        return;
+    }
+
+    simsimd_u32_t const *const a_end = a + a_length;
+    simsimd_u32_t const *const b_end = b + b_length;
+    simsimd_size_t c = 0;
+    union vec_t {
+        __m512i zmm;
+        simsimd_u32_t u32[16];
+        simsimd_u8_t u8[64];
+    } a_vec, b_vec;
+
+    while (a + 16 < a_end && b + 16 < b_end) {
+        a_vec.zmm = _mm512_loadu_si512((__m512i const *)a);
+        b_vec.zmm = _mm512_loadu_si512((__m512i const *)b);
+
+        // Intersecting registers with `_mm512_2intersect_epi32` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u32_t a_min;
+        simsimd_u32_t a_max = a_vec.u32[15];
+        simsimd_u32_t b_min = b_vec.u32[0];
+        simsimd_u32_t b_max = b_vec.u32[15];
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && a + 32 < a_end) {
+            a += 16;
+            a_vec.zmm = _mm512_loadu_si512((__m512i const *)a);
+            a_max = a_vec.u32[15];
+        }
+        a_min = a_vec.u32[0];
+        while (b_max < a_min && b + 32 < b_end) {
+            b += 16;
+            b_vec.zmm = _mm512_loadu_si512((__m512i const *)b);
+            b_max = b_vec.u32[15];
+        }
+        b_min = b_vec.u32[0];
+
+        // Now we are likely to have some overlap, so we can intersect the registers
+        __mmask16 a_matches_any_in_b, b_matches_any_in_a;
+        _mm512_2intersect_epi32(a_vec.zmm, b_vec.zmm, &a_matches_any_in_b, &b_matches_any_in_a);
+
+        // The paper also contained a very nice procedure for exporting the matches,
+        // but we don't need it here:
+        //      _mm512_mask_compressstoreu_epi32(c, a_matches_any_in_b, a_vec);
+        c += _mm_popcnt_u32(a_matches_any_in_b); // MSVC has no `_popcnt32`
+
+        __m512i a_last_broadcasted = _mm512_set1_epi32(*(int const *)&a_max);
+        __m512i b_last_broadcasted = _mm512_set1_epi32(*(int const *)&b_max);
+        __mmask16 a_step_mask = _mm512_cmple_epu32_mask(a_vec.zmm, b_last_broadcasted);
+        __mmask16 b_step_mask = _mm512_cmple_epu32_mask(b_vec.zmm, a_last_broadcasted);
+        a += 32 - _lzcnt_u32((simsimd_u32_t)a_step_mask);
+        b += 32 - _lzcnt_u32((simsimd_u32_t)b_step_mask);
+    }
+
+    simsimd_intersect_u32_serial(a, b, a_end - a, b_end - b, results);
+    *results += c;
+}
+
+SIMSIMD_PUBLIC void simsimd_spdot_weights_u16_turin(                  //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                   //
+    simsimd_bf16_t const *a_weights, simsimd_bf16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,                 //
+    simsimd_distance_t *results) {
+
+    // The baseline implementation for very small arrays (2 registers or less) can be quite simple:
+    if (a_length < 64 && b_length < 64) {
+        simsimd_intersect_u16_serial(a, b, a_length, b_length, results);
+        return;
+    }
+
+    //! There is no such thing as `_mm512_2intersect_epi16`, only the 32-bit variant!
+    //! So instead of jumping through 32 entries at a time, like on Ice Lake, we will
+    //! step through 16 entries at a time.
+    simsimd_u16_t const *const a_end = a + a_length;
+    simsimd_u16_t const *const b_end = b + b_length;
+    simsimd_size_t intersection_size = 0;
+    union vec_t {
+        __m256i ymm;
+        __m256 ymmps;
+        simsimd_u16_t u16[16];
+        simsimd_u8_t u8[32];
+    } a_vec, b_vec, product_vec;
+    product_vec.ymmps = _mm256_setzero_ps();
+
+    while (a + 16 < a_end && b + 16 < b_end) {
+        a_vec.ymm = _mm256_lddqu_si256((__m256i const *)a);
+        b_vec.ymm = _mm256_lddqu_si256((__m256i const *)b);
+
+        // Intersecting registers with `_mm512_2intersect_epi16_mask` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u16_t a_min;
+        simsimd_u16_t a_max = a_vec.u16[15];
+        simsimd_u16_t b_min = b_vec.u16[0];
+        simsimd_u16_t b_max = b_vec.u16[15];
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && a + 32 < a_end) {
+            a += 16, a_weights += 16;
+            a_vec.ymm = _mm256_lddqu_si256((__m256i const *)a);
+            a_max = a_vec.u16[15];
+        }
+        a_min = a_vec.u16[0];
+        while (b_max < a_min && b + 32 < b_end) {
+            b += 16, b_weights += 16;
+            b_vec.ymm = _mm256_lddqu_si256((__m256i const *)b);
+            b_max = b_vec.u16[15];
+        }
+        b_min = b_vec.u16[0];
+
+        // Now we are likely to have some overlap, so we can intersect the registers
+        __m512i a_i32_vec = _mm512_cvtepu16_epi32(a_vec.ymm);
+        __m512i b_i32_vec = _mm512_cvtepu16_epi32(b_vec.ymm);
+        __mmask16 a_matches_any_in_b, b_matches_any_in_a;
+        _mm512_2intersect_epi32(a_i32_vec, b_i32_vec, &a_matches_any_in_b, &b_matches_any_in_a);
+
+        // The paper also contained a very nice procedure for exporting the matches,
+        // but we don't need it here:
+        //      _mm512_mask_compressstoreu_epi16(intersection_size, a_matches_any_in_b, a_vec);
+        int a_matches_count_in_b = _mm_popcnt_u32(a_matches_any_in_b); // MSVC has no `_popcnt32`
+        intersection_size += a_matches_count_in_b;
+
+        // Load and shift all the relevant weights to the start of the vector before doing the dot product
+        if (a_matches_count_in_b) {
+            __m256i a_weights_vec = _mm256_lddqu_si256((__m256i const *)a_weights);
+            a_weights_vec = _mm256_maskz_compress_epi16(a_matches_any_in_b, a_weights_vec);
+            __m256i b_weights_vec = _mm256_lddqu_si256((__m256i const *)b_weights);
+            b_weights_vec = _mm256_maskz_compress_epi16(b_matches_any_in_a, b_weights_vec);
+            product_vec.ymmps = _mm256_dpbf16_ps(product_vec.ymmps, (__m256bh)a_weights_vec, (__m256bh)b_weights_vec);
+        }
+
+        __m256i a_last_broadcasted = _mm256_set1_epi16(*(short const *)&a_max);
+        __m256i b_last_broadcasted = _mm256_set1_epi16(*(short const *)&b_max);
+        __mmask16 a_step_mask = _mm256_cmple_epu16_mask(a_vec.ymm, b_last_broadcasted);
+        __mmask16 b_step_mask = _mm256_cmple_epu16_mask(b_vec.ymm, a_last_broadcasted);
+        int a_step = 32 - _lzcnt_u32((simsimd_u32_t)a_step_mask); //? Is this correct? Needs testing!
+        int b_step = 32 - _lzcnt_u32((simsimd_u32_t)b_step_mask);
+        a += a_step, a_weights += a_step;
+        b += b_step, b_weights += b_step;
+    }
+
+    simsimd_intersect_u16_serial(a, b, a_end - a, b_end - b, results);
+    *results += intersection_size;
+}
+
+SIMSIMD_PUBLIC void simsimd_spdot_counts_u16_turin(                 //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                 //
+    simsimd_i16_t const *a_weights, simsimd_i16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,               //
+    simsimd_distance_t *results) {
+
+    // The baseline implementation for very small arrays (2 registers or less) can be quite simple:
+    if (a_length < 64 && b_length < 64) {
+        simsimd_intersect_u16_serial(a, b, a_length, b_length, results);
+        return;
+    }
+
+    //! There is no such thing as `_mm512_2intersect_epi16`, only the 32-bit variant!
+    //! So instead of jumping through 32 entries at a time, like on Ice Lake, we will
+    //! step through 16 entries at a time.
+    simsimd_u16_t const *const a_end = a + a_length;
+    simsimd_u16_t const *const b_end = b + b_length;
+    simsimd_size_t intersection_size = 0;
+    union vec_t {
+        __m256i ymm;
+        simsimd_u16_t u16[16];
+        simsimd_u8_t u8[32];
+    } a_vec, b_vec, product_vec;
+    product_vec.ymm = _mm256_setzero_si256();
+
+    while (a + 16 < a_end && b + 16 < b_end) {
+        a_vec.ymm = _mm256_lddqu_si256((__m256i const *)a);
+        b_vec.ymm = _mm256_lddqu_si256((__m256i const *)b);
+
+        // Intersecting registers with `_mm512_2intersect_epi16_mask` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u16_t a_min;
+        simsimd_u16_t a_max = a_vec.u16[15];
+        simsimd_u16_t b_min = b_vec.u16[0];
+        simsimd_u16_t b_max = b_vec.u16[15];
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && a + 32 < a_end) {
+            a += 16, a_weights += 16;
+            a_vec.ymm = _mm256_lddqu_si256((__m256i const *)a);
+            a_max = a_vec.u16[15];
+        }
+        a_min = a_vec.u16[0];
+        while (b_max < a_min && b + 32 < b_end) {
+            b += 16, b_weights += 16;
+            b_vec.ymm = _mm256_lddqu_si256((__m256i const *)b);
+            b_max = b_vec.u16[15];
+        }
+        b_min = b_vec.u16[0];
+
+        // Now we are likely to have some overlap, so we can intersect the registers
+        __m512i a_i32_vec = _mm512_cvtepu16_epi32(a_vec.ymm);
+        __m512i b_i32_vec = _mm512_cvtepu16_epi32(b_vec.ymm);
+        __mmask16 a_matches_any_in_b, b_matches_any_in_a;
+        _mm512_2intersect_epi32(a_i32_vec, b_i32_vec, &a_matches_any_in_b, &b_matches_any_in_a);
+
+        // The paper also contained a very nice procedure for exporting the matches,
+        // but we don't need it here:
+        //      _mm512_mask_compressstoreu_epi16(intersection_size, a_matches_any_in_b, a_vec);
+        int a_matches_count_in_b = _mm_popcnt_u32(a_matches_any_in_b); // MSVC has no `_popcnt32`
+        intersection_size += a_matches_count_in_b;
+
+        // Load and shift all the relevant weights to the start of the vector before doing the dot product
+        if (a_matches_count_in_b) {
+            __m256i a_weights_vec = _mm256_lddqu_si256((__m256i const *)a_weights);
+            a_weights_vec = _mm256_maskz_compress_epi16(a_matches_any_in_b, a_weights_vec);
+            __m256i b_weights_vec = _mm256_lddqu_si256((__m256i const *)b_weights);
+            b_weights_vec = _mm256_maskz_compress_epi16(b_matches_any_in_a, b_weights_vec);
+            product_vec.ymm = _mm256_dpwssds_epi32(product_vec.ymm, a_weights_vec, b_weights_vec);
+        }
+
+        __m256i a_last_broadcasted = _mm256_set1_epi16(*(short const *)&a_max);
+        __m256i b_last_broadcasted = _mm256_set1_epi16(*(short const *)&b_max);
+        __mmask16 a_step_mask = _mm256_cmple_epu16_mask(a_vec.ymm, b_last_broadcasted);
+        __mmask16 b_step_mask = _mm256_cmple_epu16_mask(b_vec.ymm, a_last_broadcasted);
+        int a_step = 32 - _lzcnt_u32((simsimd_u32_t)a_step_mask); //? Is this correct? Needs testing!
+        int b_step = 32 - _lzcnt_u32((simsimd_u32_t)b_step_mask);
+        a += a_step, a_weights += a_step;
+        b += b_step, b_weights += b_step;
+    }
+
+    simsimd_intersect_u16_serial(a, b, a_end - a, b_end - b, results);
+    *results += intersection_size;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_TURIN
+#endif // _SIMSIMD_TARGET_X86
+
+#if _SIMSIMD_TARGET_ARM
+#if SIMSIMD_TARGET_NEON
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a"))), apply_to = function)
+
+/**
+ *  @brief  Uses `vshrn` to produce a bitmask, similar to `movemask` in SSE.
+ *  https://community.arm.com/arm-community-blogs/b/infrastructure-solutions-blog/posts/porting-x86-vector-bitmask-optimizations-to-arm-neon
+ */
+SIMSIMD_INTERNAL simsimd_u64_t _simsimd_u8_to_u4_neon(uint8x16_t vec) {
+    return vget_lane_u64(vreinterpret_u64_u8(vshrn_n_u16(vreinterpretq_u16_u8(vec), 4)), 0);
+}
+
+SIMSIMD_INTERNAL int _simsimd_clz_u64(simsimd_u64_t x) {
+// On GCC and Clang use the builtin, otherwise use the generic implementation
+#if defined(__GNUC__) || defined(__clang__)
+    return __builtin_clzll(x);
+#else
+    int n = 0;
+    while ((x & 0x8000000000000000ull) == 0) n++, x <<= 1;
+    return n;
+#endif
+}
+
+SIMSIMD_INTERNAL uint32x4_t _simsimd_intersect_u32x4_neon(uint32x4_t a, uint32x4_t b) {
+    uint32x4_t b1 = vextq_u32(b, b, 1);
+    uint32x4_t b2 = vextq_u32(b, b, 2);
+    uint32x4_t b3 = vextq_u32(b, b, 3);
+    uint32x4_t nm00 = vceqq_u32(a, b);
+    uint32x4_t nm01 = vceqq_u32(a, b1);
+    uint32x4_t nm02 = vceqq_u32(a, b2);
+    uint32x4_t nm03 = vceqq_u32(a, b3);
+    uint32x4_t nm = vorrq_u32(vorrq_u32(nm00, nm01), vorrq_u32(nm02, nm03));
+    return nm;
+}
+
+SIMSIMD_INTERNAL uint16x8_t _simsimd_intersect_u16x8_neon(uint16x8_t a, uint16x8_t b) {
+    uint16x8_t b1 = vextq_u16(b, b, 1);
+    uint16x8_t b2 = vextq_u16(b, b, 2);
+    uint16x8_t b3 = vextq_u16(b, b, 3);
+    uint16x8_t b4 = vextq_u16(b, b, 4);
+    uint16x8_t b5 = vextq_u16(b, b, 5);
+    uint16x8_t b6 = vextq_u16(b, b, 6);
+    uint16x8_t b7 = vextq_u16(b, b, 7);
+    uint16x8_t nm00 = vceqq_u16(a, b);
+    uint16x8_t nm01 = vceqq_u16(a, b1);
+    uint16x8_t nm02 = vceqq_u16(a, b2);
+    uint16x8_t nm03 = vceqq_u16(a, b3);
+    uint16x8_t nm04 = vceqq_u16(a, b4);
+    uint16x8_t nm05 = vceqq_u16(a, b5);
+    uint16x8_t nm06 = vceqq_u16(a, b6);
+    uint16x8_t nm07 = vceqq_u16(a, b7);
+    uint16x8_t nm = vorrq_u16(vorrq_u16(vorrq_u16(nm00, nm01), vorrq_u16(nm02, nm03)),
+                              vorrq_u16(vorrq_u16(nm04, nm05), vorrq_u16(nm06, nm07)));
+    return nm;
+}
+
+SIMSIMD_PUBLIC void simsimd_intersect_u16_neon(       //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results) {
+
+    // The baseline implementation for very small arrays (2 registers or less) can be quite simple:
+    if (a_length < 32 && b_length < 32) {
+        simsimd_intersect_u16_serial(a, b, a_length, b_length, results);
+        return;
+    }
+
+    simsimd_u16_t const *const a_end = a + a_length;
+    simsimd_u16_t const *const b_end = b + b_length;
+    union vec_t {
+        uint16x8_t u16x8;
+        simsimd_u16_t u16[8];
+        simsimd_u8_t u8[16];
+    } a_vec, b_vec, c_counts_vec;
+    c_counts_vec.u16x8 = vdupq_n_u16(0);
+
+    while (a + 8 < a_end && b + 8 < b_end) {
+        a_vec.u16x8 = vld1q_u16(a);
+        b_vec.u16x8 = vld1q_u16(b);
+
+        // Intersecting registers with `_simsimd_intersect_u16x8_neon` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u16_t a_min;
+        simsimd_u16_t a_max = a_vec.u16[7];
+        simsimd_u16_t b_min = b_vec.u16[0];
+        simsimd_u16_t b_max = b_vec.u16[7];
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && a + 16 < a_end) {
+            a += 8;
+            a_vec.u16x8 = vld1q_u16(a);
+            a_max = a_vec.u16[7];
+        }
+        a_min = a_vec.u16[0];
+        while (b_max < a_min && b + 16 < b_end) {
+            b += 8;
+            b_vec.u16x8 = vld1q_u16(b);
+            b_max = b_vec.u16[7];
+        }
+        b_min = b_vec.u16[0];
+
+        // Now we are likely to have some overlap, so we can intersect the registers.
+        // We can do it by performing a population count at every cycle, but it's not the cheapest in terms of cycles.
+        //
+        //      simsimd_u64_t a_matches = __builtin_popcountll(
+        //          _simsimd_u8_to_u4_neon(vreinterpretq_u8_u16(
+        //              _simsimd_intersect_u16x8_neon(a_vec.u16x8, b_vec.u16x8))));
+        //      c += a_matches / 8;
+        //
+        // Alternatively, we can we can transform match-masks into "ones", accumulate them between the cycles,
+        // and merge all together in the end.
+        uint16x8_t a_matches = _simsimd_intersect_u16x8_neon(a_vec.u16x8, b_vec.u16x8);
+        c_counts_vec.u16x8 = vaddq_u16(c_counts_vec.u16x8, vandq_u16(a_matches, vdupq_n_u16(1)));
+
+        // Counting leading zeros is tricky. On Arm we can use inline Assembly to get the result,
+        // but MSVC doesn't support that:
+        //
+        //      SIMSIMD_INTERNAL int _simsimd_clz_u64(simsimd_u64_t value) {
+        //          simsimd_u64_t result;
+        //          __asm__("clz %x0, %x1" : "=r"(result) : "r"(value));
+        //          return (int)result;
+        //      }
+        //
+        // Alternatively, we can use the `vclz_u32` NEON intrinsic.
+        // It will compute the leading zeros number for both `a_step` and `b_step` in parallel.
+        uint16x8_t a_last_broadcasted = vdupq_n_u16(a_max);
+        uint16x8_t b_last_broadcasted = vdupq_n_u16(b_max);
+        simsimd_u64_t a_step = _simsimd_clz_u64(_simsimd_u8_to_u4_neon( //
+            vreinterpretq_u8_u16(vcleq_u16(a_vec.u16x8, b_last_broadcasted))));
+        simsimd_u64_t b_step = _simsimd_clz_u64(_simsimd_u8_to_u4_neon( //
+            vreinterpretq_u8_u16(vcleq_u16(b_vec.u16x8, a_last_broadcasted))));
+        a += (64 - a_step) / 8;
+        b += (64 - b_step) / 8;
+    }
+
+    simsimd_intersect_u16_serial(a, b, a_end - a, b_end - b, results);
+    *results += vaddvq_u16(c_counts_vec.u16x8);
+}
+
+SIMSIMD_PUBLIC void simsimd_intersect_u32_neon(       //
+    simsimd_u32_t const *a, simsimd_u32_t const *b,   //
+    simsimd_size_t a_length, simsimd_size_t b_length, //
+    simsimd_distance_t *results) {
+
+    // The baseline implementation for very small arrays (2 registers or less) can be quite simple:
+    if (a_length < 32 && b_length < 32) {
+        simsimd_intersect_u32_serial(a, b, a_length, b_length, results);
+        return;
+    }
+
+    simsimd_u32_t const *const a_end = a + a_length;
+    simsimd_u32_t const *const b_end = b + b_length;
+    union vec_t {
+        uint32x4_t u32x4;
+        simsimd_u32_t u32[4];
+        simsimd_u8_t u8[16];
+    } a_vec, b_vec, c_counts_vec;
+    c_counts_vec.u32x4 = vdupq_n_u32(0);
+
+    while (a + 4 < a_end && b + 4 < b_end) {
+        a_vec.u32x4 = vld1q_u32(a);
+        b_vec.u32x4 = vld1q_u32(b);
+
+        // Intersecting registers with `_simsimd_intersect_u32x4_neon` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u32_t a_min;
+        simsimd_u32_t a_max = a_vec.u32[3];
+        simsimd_u32_t b_min = b_vec.u32[0];
+        simsimd_u32_t b_max = b_vec.u32[3];
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && a + 8 < a_end) {
+            a += 4;
+            a_vec.u32x4 = vld1q_u32(a);
+            a_max = a_vec.u32[3];
+        }
+        a_min = a_vec.u32[0];
+        while (b_max < a_min && b + 8 < b_end) {
+            b += 4;
+            b_vec.u32x4 = vld1q_u32(b);
+            b_max = b_vec.u32[3];
+        }
+        b_min = b_vec.u32[0];
+
+        // Now we are likely to have some overlap, so we can intersect the registers
+        // We can do it by performing a population count at every cycle, but it's not the cheapest in terms of cycles.
+        //
+        //     simsimd_u64_t a_matches = __builtin_popcountll(
+        //         _simsimd_u8_to_u4_neon(vreinterpretq_u8_u32(
+        //             _simsimd_intersect_u32x4_neon(a_vec.u32x4, b_vec.u32x4))));
+        //     c += a_matches / 16;
+        //
+        // Alternatively, we can we can transform match-masks into "ones", accumulate them between the cycles,
+        // and merge all together in the end.
+        uint32x4_t a_matches = _simsimd_intersect_u32x4_neon(a_vec.u32x4, b_vec.u32x4);
+        c_counts_vec.u32x4 = vaddq_u32(c_counts_vec.u32x4, vandq_u32(a_matches, vdupq_n_u32(1)));
+
+        uint32x4_t a_last_broadcasted = vdupq_n_u32(a_max);
+        uint32x4_t b_last_broadcasted = vdupq_n_u32(b_max);
+        simsimd_u64_t a_step = _simsimd_clz_u64(_simsimd_u8_to_u4_neon( //
+            vreinterpretq_u8_u32(vcleq_u32(a_vec.u32x4, b_last_broadcasted))));
+        simsimd_u64_t b_step = _simsimd_clz_u64(_simsimd_u8_to_u4_neon( //
+            vreinterpretq_u8_u32(vcleq_u32(b_vec.u32x4, a_last_broadcasted))));
+        a += (64 - a_step) / 16;
+        b += (64 - b_step) / 16;
+    }
+
+    simsimd_intersect_u32_serial(a, b, a_end - a, b_end - b, results);
+    *results += vaddvq_u32(c_counts_vec.u32x4);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON
+
+/*  SVE2 introduces many new integer-oriented instructions, extending some of the NEON functionality
+ *  to variable-length SVE registers. Those include "compare multiple" intrinsics:
+ *
+ *  - `svmatch[_u16]` that matches each scalar in first vector against all members of a 128-bit lane in the second.
+ *  - `svhistcnt[_s32]_z` does something similar, performing an inclusive prefix scan.
+ *  - `svtbx[_u16]` does extended table lookup
+ *
+ *  Other notable instructions:
+ *
+ *  - `DUP`: Broadcast indexed predicate element
+ *    https://developer.arm.com/documentation/ddi0602/2021-06/SVE-Instructions/DUP--predicate---Broadcast-indexed-predicate-element-?lang=en
+ *  - `SCLAMP` and `UCLAMP`: clamp values, i.e. combined min+max
+ *    https://developer.arm.com/documentation/ddi0602/2021-06/SVE-Instructions/SCLAMP--Signed-clamp-to-minimum-maximum-vector-?lang=en
+ *    https://developer.arm.com/documentation/ddi0602/2021-06/SVE-Instructions/UCLAMP--Unsigned-clamp-to-minimum-maximum-vector-?lang=en
+ *  - `TBLQ`: Table lookup quadword
+ *    https://developer.arm.com/documentation/ddi0602/2022-12/SVE-Instructions/TBLQ--Programmable-table-lookup-within-each-quadword-vector-segment--zeroing--?lang=en
+ *
+ *  Great resources for SVE2 intrinsics:
+ *
+ *  > ARM’s Scalable Vector Extensions: A Critical Look at SVE2 For Integer Workloads
+ *    https://gist.github.com/zingaburga/805669eb891c820bd220418ee3f0d6bd
+ */
+#if SIMSIMD_TARGET_SVE2
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+sve+sve2")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+sve+sve2"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_intersect_u16_sve2(     //
+    simsimd_u16_t const *a, simsimd_u16_t const *b, //
+    simsimd_size_t a_length,
+    simsimd_size_t b_length, //
+    simsimd_distance_t *results) {
+
+    // A single SVE lane is 128 bits wide, so one lane fits 8 values.
+    simsimd_size_t const register_size = svcnth();
+    simsimd_size_t const lanes_count = register_size / 8;
+    simsimd_size_t a_idx = 0, b_idx = 0;
+    simsimd_size_t c = 0;
+
+    while (a_idx < a_length && b_idx < b_length) {
+        // Load `a_member` and broadcast it, load `b_members_vec` from memory
+        svbool_t a_progress = svwhilelt_b16_u64(a_idx, a_length);
+        svbool_t b_progress = svwhilelt_b16_u64(b_idx, b_length);
+        svuint16_t a_vec = svld1_u16(a_progress, a + a_idx);
+        svuint16_t b_vec = svld1_u16(b_progress, b + b_idx);
+
+        // Intersecting registers with `svmatch_u16` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u16_t a_min;
+        simsimd_u16_t a_max = svlastb(a_progress, a_vec);
+        simsimd_u16_t b_min = svlasta(svpfalse_b(), b_vec);
+        simsimd_u16_t b_max = svlastb(b_progress, b_vec);
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && (a_idx + register_size) < a_length) {
+            a_idx += register_size;
+            a_progress = svwhilelt_b16_u64(a_idx, a_length);
+            a_vec = svld1_u16(a_progress, a + a_idx);
+            a_max = svlastb(a_progress, a_vec);
+        }
+        a_min = svlasta(svpfalse_b(), a_vec);
+        while (b_max < a_min && (b_idx + register_size) < b_length) {
+            b_idx += register_size;
+            b_progress = svwhilelt_b16_u64(b_idx, b_length);
+            b_vec = svld1_u16(b_progress, b + b_idx);
+            b_max = svlastb(b_progress, b_vec);
+        }
+        b_min = svlasta(svpfalse_b(), b_vec);
+
+        // Before we evaluate the intersection size, obfurscating the order in `b_vec`,
+        // let's estimate how much we will need to advance the pointers afterwards.
+        // For that, we don't even need to broadcast the values in SVE, as the whole
+        // register can be compared against a scalar:
+        //
+        //      svuint16_t a_last_broadcasted =  svdup_n_u16(a_max);
+        //      svuint16_t b_last_broadcasted =  svdup_n_u16(b_max);
+        svbool_t a_mask = svcmple_n_u16(a_progress, a_vec, b_max);
+        svbool_t b_mask = svcmple_n_u16(b_progress, b_vec, a_max);
+        simsimd_u64_t a_step = svcntp_b16(a_progress, a_mask);
+        simsimd_u64_t b_step = svcntp_b16(b_progress, b_mask);
+
+        // Compare `a_vec` with each lane of `b_vec`
+        svbool_t equal_mask = svmatch_u16(a_progress, a_vec, b_vec);
+        for (simsimd_size_t i = 1; i < lanes_count; i++) {
+            b_vec = svext_u16(b_vec, b_vec, 8);
+            equal_mask = svorr_z(svptrue_b16(), equal_mask, svmatch_u16(a_progress, a_vec, b_vec));
+        }
+        simsimd_size_t equal_count = svcntp_b16(svptrue_b16(), equal_mask);
+
+        // Advance
+        a_idx += a_step;
+        b_idx += b_step;
+        c += equal_count;
+    }
+    *results = c;
+}
+
+SIMSIMD_PUBLIC void simsimd_intersect_u32_sve2(simsimd_u32_t const *a, simsimd_u32_t const *b, simsimd_size_t a_length,
+                                               simsimd_size_t b_length, simsimd_distance_t *results) {
+
+    // A single SVE lane is 128 bits wide, so one lane fits 4 values.
+    simsimd_size_t const register_size = svcntw();
+    simsimd_size_t const lanes_count = register_size / 4;
+    simsimd_size_t a_idx = 0, b_idx = 0;
+    simsimd_size_t c = 0;
+
+    while (a_idx < a_length && b_idx < b_length) {
+        // Load `a_member` and broadcast it, load `b_members_vec` from memory
+        svbool_t a_progress = svwhilelt_b32_u64(a_idx, a_length);
+        svbool_t b_progress = svwhilelt_b32_u64(b_idx, b_length);
+        svuint32_t a_vec = svld1_u32(a_progress, a + a_idx);
+        svuint32_t b_vec = svld1_u32(b_progress, b + b_idx);
+
+        // Intersecting registers with `svmatch_u16` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u32_t a_min;
+        simsimd_u32_t a_max = svlastb(a_progress, a_vec);
+        simsimd_u32_t b_min = svlasta(svpfalse_b(), b_vec);
+        simsimd_u32_t b_max = svlastb(b_progress, b_vec);
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && (a_idx + register_size) < a_length) {
+            a_idx += register_size;
+            a_progress = svwhilelt_b32_u64(a_idx, a_length);
+            a_vec = svld1_u32(a_progress, a + a_idx);
+            a_max = svlastb(a_progress, a_vec);
+        }
+        a_min = svlasta(svpfalse_b(), a_vec);
+        while (b_max < a_min && (b_idx + register_size) < b_length) {
+            b_idx += register_size;
+            b_progress = svwhilelt_b32_u64(b_idx, b_length);
+            b_vec = svld1_u32(b_progress, b + b_idx);
+            b_max = svlastb(b_progress, b_vec);
+        }
+        b_min = svlasta(svpfalse_b(), b_vec);
+
+        // Before we evaluate the intersection size, obfurscating the order in `b_vec`,
+        // let's estimate how much we will need to advance the pointers afterwards.
+        // For that, we don't even need to broadcast the values in SVE, as the whole
+        // register can be compared against a scalar:
+        //
+        //      svuint32_t a_last_broadcasted =  svdup_n_u32(a_max);
+        //      svuint32_t b_last_broadcasted =  svdup_n_u32(b_max);
+        svbool_t a_mask = svcmple_n_u32(a_progress, a_vec, b_max);
+        svbool_t b_mask = svcmple_n_u32(b_progress, b_vec, a_max);
+        simsimd_u64_t a_step = svcntp_b32(a_progress, a_mask);
+        simsimd_u64_t b_step = svcntp_b32(b_progress, b_mask);
+
+        // Comparing `a_vec` with each lane of `b_vec` can't be done with `svmatch`,
+        // the same way as in `simsimd_intersect_u16_sve2`, as that instruction is only
+        // available for 8-bit and 16-bit integers.
+        //
+        //      svbool_t equal_mask = svpfalse_b();
+        //      for (simsimd_size_t i = 0; i < register_size; i++) {
+        //          equal_mask = svorr_z(svptrue_b32(), equal_mask, svcmpeq_u32(a_progress, a_vec, b_vec));
+        //          b_vec = svext_u32(b_vec, b_vec, 1);
+        //      }
+        //      simsimd_size_t equal_count = svcntp_b32(a_progress, equal_mask);
+        //
+        // Alternatively, one can use histogram instructions, like `svhistcnt_u32_z`.
+        // They practically compute the prefix-matching count, which is equivalent to
+        // the lower triangle of the row-major intersection matrix.
+        // To compute the upper triangle, we can reverse (with `svrev_b32`) the order of
+        // elements and repeat the operation, accumulating the results for top and bottom.
+        // Let's look at 4x element registers as an example:
+        //
+        //      ⊐ α = {A, B, C, D}, β = {X, Y, Z, W}:
+        //
+        //      hist(α, β):           hist(α_rev, β_rev):
+        //
+        //        X Y Z W               W Z Y X
+        //      A 1 0 0 0             D 1 0 0 0
+        //      B 1 1 0 0             C 1 1 0 0
+        //      C 1 1 1 0             B 1 1 1 0
+        //      D 1 1 1 1             A 1 1 1 1
+        //
+        svuint32_t hist_lower = svhistcnt_u32_z(a_progress, a_vec, b_vec);
+        svuint32_t a_rev_vec = svrev_u32(a_vec);
+        svuint32_t b_rev_vec = svrev_u32(b_vec);
+        svuint32_t hist_upper = svrev_u32(svhistcnt_u32_z(svptrue_b32(), a_rev_vec, b_rev_vec));
+        svuint32_t hist = svorr_u32_x(a_progress, hist_lower, hist_upper);
+        svbool_t equal_mask = svcmpne_n_u32(a_progress, hist, 0);
+        simsimd_size_t equal_count = svcntp_b32(a_progress, equal_mask);
+
+        // Advance
+        a_idx += a_step;
+        b_idx += b_step;
+        c += equal_count;
+    }
+    *results = c;
+}
+
+SIMSIMD_PUBLIC void simsimd_spdot_counts_u16_sve2(                  //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                 //
+    simsimd_i16_t const *a_weights, simsimd_i16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,               //
+    simsimd_distance_t *results) {
+
+    // A single SVE lane is 128 bits wide, so one lane fits 8 values.
+    simsimd_size_t const register_size = svcnth();
+    simsimd_size_t const lanes_count = register_size / 8;
+    simsimd_size_t a_idx = 0, b_idx = 0;
+    svint64_t product_vec = svdupq_n_s64(0, 0);
+    simsimd_size_t intersection_size = 0;
+
+    while (a_idx < a_length && b_idx < b_length) {
+        // Load `a_member` and broadcast it, load `b_members_vec` from memory
+        svbool_t a_progress = svwhilelt_b16_u64(a_idx, a_length);
+        svbool_t b_progress = svwhilelt_b16_u64(b_idx, b_length);
+        svuint16_t a_vec = svld1_u16(a_progress, a + a_idx);
+        svuint16_t b_vec = svld1_u16(b_progress, b + b_idx);
+
+        // Intersecting registers with `svmatch_u16` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u16_t a_min;
+        simsimd_u16_t a_max = svlastb(a_progress, a_vec);
+        simsimd_u16_t b_min = svlasta(svpfalse_b(), b_vec);
+        simsimd_u16_t b_max = svlastb(b_progress, b_vec);
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && (a_idx + register_size) < a_length) {
+            a_idx += register_size;
+            a_progress = svwhilelt_b16_u64(a_idx, a_length);
+            a_vec = svld1_u16(a_progress, a + a_idx);
+            a_max = svlastb(a_progress, a_vec);
+        }
+        a_min = svlasta(svpfalse_b(), a_vec);
+        while (b_max < a_min && (b_idx + register_size) < b_length) {
+            b_idx += register_size;
+            b_progress = svwhilelt_b16_u64(b_idx, b_length);
+            b_vec = svld1_u16(b_progress, b + b_idx);
+            b_max = svlastb(b_progress, b_vec);
+        }
+        b_min = svlasta(svpfalse_b(), b_vec);
+
+        // Before we evaluate the intersection size, obfurscating the order in `b_vec`,
+        // let's estimate how much we will need to advance the pointers afterwards.
+        // For that, we don't even need to broadcast the values in SVE, as the whole
+        // register can be compared against a scalar:
+        //
+        //      svuint16_t a_last_broadcasted =  svdup_n_u16(a_max);
+        //      svuint16_t b_last_broadcasted =  svdup_n_u16(b_max);
+        svbool_t a_mask = svcmple_n_u16(a_progress, a_vec, b_max);
+        svbool_t b_mask = svcmple_n_u16(b_progress, b_vec, a_max);
+        simsimd_u64_t a_step = svcntp_b16(a_progress, a_mask);
+        simsimd_u64_t b_step = svcntp_b16(b_progress, b_mask);
+
+        // Compare `a_vec` with each lane of `b_vec`
+        svint16_t a_weights_vec = svld1_s16(a_progress, a_weights + a_idx);
+        svint16_t b_weights_vec = svld1_s16(b_progress, b_weights + b_idx);
+        for (simsimd_size_t i = 0; i < lanes_count; i++) {
+            svbool_t equal_mask = svmatch_u16(a_progress, a_vec, b_vec);
+            svint16_t b_equal_weights_vec = svsel_s16(equal_mask, b_weights_vec, svdup_n_s16(0.f));
+            product_vec = svdot_s64(product_vec, a_weights_vec, b_equal_weights_vec);
+            b_vec = svext_u16(b_vec, b_vec, 8);
+            intersection_size += svcntp_b16(svptrue_b16(), equal_mask);
+        }
+
+        // Advance
+        a_idx += a_step;
+        b_idx += b_step;
+    }
+    results[0] = (simsimd_distance_t)intersection_size;
+    results[1] = svaddv_s64(svptrue_b64(), product_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SVE2
+
+#if SIMSIMD_TARGET_SVE2 && SIMSIMD_TARGET_SVE_BF16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.6-a+sve+sve2+bf16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.6-a+sve+sve2+bf16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_spdot_weights_u16_sve2(                   //
+    simsimd_u16_t const *a, simsimd_u16_t const *b,                   //
+    simsimd_bf16_t const *a_weights, simsimd_bf16_t const *b_weights, //
+    simsimd_size_t a_length, simsimd_size_t b_length,                 //
+    simsimd_distance_t *results) {
+
+    // A single SVE lane is 128 bits wide, so one lane fits 8 values.
+    simsimd_size_t const register_size = svcnth();
+    simsimd_size_t const lanes_count = register_size / 8;
+    simsimd_size_t a_idx = 0, b_idx = 0;
+    svfloat32_t product_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    simsimd_size_t intersection_size = 0;
+
+    while (a_idx < a_length && b_idx < b_length) {
+        // Load `a_member` and broadcast it, load `b_members_vec` from memory
+        svbool_t a_progress = svwhilelt_b16_u64(a_idx, a_length);
+        svbool_t b_progress = svwhilelt_b16_u64(b_idx, b_length);
+        svuint16_t a_vec = svld1_u16(a_progress, a + a_idx);
+        svuint16_t b_vec = svld1_u16(b_progress, b + b_idx);
+
+        // Intersecting registers with `svmatch_u16` involves a lot of shuffling
+        // and comparisons, so we want to avoid it if the slices don't overlap at all..
+        simsimd_u16_t a_min;
+        simsimd_u16_t a_max = svlastb(a_progress, a_vec);
+        simsimd_u16_t b_min = svlasta(svpfalse_b(), b_vec);
+        simsimd_u16_t b_max = svlastb(b_progress, b_vec);
+
+        // If the slices don't overlap, advance the appropriate pointer
+        while (a_max < b_min && (a_idx + register_size) < a_length) {
+            a_idx += register_size;
+            a_progress = svwhilelt_b16_u64(a_idx, a_length);
+            a_vec = svld1_u16(a_progress, a + a_idx);
+            a_max = svlastb(a_progress, a_vec);
+        }
+        a_min = svlasta(svpfalse_b(), a_vec);
+        while (b_max < a_min && (b_idx + register_size) < b_length) {
+            b_idx += register_size;
+            b_progress = svwhilelt_b16_u64(b_idx, b_length);
+            b_vec = svld1_u16(b_progress, b + b_idx);
+            b_max = svlastb(b_progress, b_vec);
+        }
+        b_min = svlasta(svpfalse_b(), b_vec);
+
+        // Before we evaluate the intersection size, obfurscating the order in `b_vec`,
+        // let's estimate how much we will need to advance the pointers afterwards.
+        // For that, we don't even need to broadcast the values in SVE, as the whole
+        // register can be compared against a scalar:
+        //
+        //      svuint16_t a_last_broadcasted =  svdup_n_u16(a_max);
+        //      svuint16_t b_last_broadcasted =  svdup_n_u16(b_max);
+        svbool_t a_mask = svcmple_n_u16(a_progress, a_vec, b_max);
+        svbool_t b_mask = svcmple_n_u16(b_progress, b_vec, a_max);
+        simsimd_u64_t a_step = svcntp_b16(a_progress, a_mask);
+        simsimd_u64_t b_step = svcntp_b16(b_progress, b_mask);
+
+        // Compare `a_vec` with each lane of `b_vec`
+        svbfloat16_t a_weights_vec = svld1_bf16(a_progress, (__bf16 const *)a_weights + a_idx);
+        svbfloat16_t b_weights_vec = svld1_bf16(b_progress, (__bf16 const *)b_weights + b_idx);
+        for (simsimd_size_t i = 0; i < lanes_count; i++) {
+            svbool_t equal_mask = svmatch_u16(a_progress, a_vec, b_vec);
+            //! The `svsel_bf16` intrinsic is broken in many compilers, not returning the correct type.
+            //! So we reinterprete floats as integers and apply `svsel_s16`, but the `svreinterpret_s16_bs16`
+            //! and `svreinterpret_bf16_s16` are not always properly defined!
+            svint16_t b_equal_weights_vec =
+                svsel_s16(equal_mask, svreinterpret_s16_bf16(b_weights_vec), svdup_n_s16(0));
+            product_vec = svbfdot_f32(product_vec, a_weights_vec, svreinterpret_bf16_s16(b_equal_weights_vec));
+            b_vec = svext_u16(b_vec, b_vec, 8);
+            intersection_size += svcntp_b16(svptrue_b16(), equal_mask);
+        }
+
+        // Advance
+        a_idx += a_step;
+        b_idx += b_step;
+    }
+    results[0] = (simsimd_distance_t)intersection_size;
+    results[1] = svaddv_f32(svptrue_b32(), product_vec);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SVE2 && SIMSIMD_TARGET_SVE_BF16
+#endif // _SIMSIMD_TARGET_ARM
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/spatial.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/spatial.h
new file mode 100644
index 0000000000..9b3db04867
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/spatial.h
@@ -0,0 +1,2324 @@
+/**
+ *  @file       spatial.h
+ *  @brief      SIMD-accelerated Spatial Similarity Measures.
+ *  @author     Ash Vardanian
+ *  @date       March 14, 2023
+ *
+ *  Contains:
+ *  - L2 (Euclidean) regular and squared distance
+ *  - Cosine (Angular) distance - @b not similarity!
+ *
+ *  For datatypes:
+ *  - 64-bit IEEE floating point numbers
+ *  - 32-bit IEEE floating point numbers
+ *  - 16-bit IEEE floating point numbers
+ *  - 16-bit brain floating point numbers
+ *  - 8-bit unsigned integral numbers
+ *  - 8-bit signed integral numbers
+ *  - 4-bit signed integral numbers
+ *
+ *  For hardware architectures:
+ *  - Arm: NEON, SVE
+ *  - x86: Haswell, Skylake, Ice Lake, Genoa, Sapphire
+ *
+ *  x86 intrinsics: https://www.intel.com/content/www/us/en/docs/intrinsics-guide/
+ *  Arm intrinsics: https://developer.arm.com/architectures/instruction-sets/intrinsics/
+ */
+#ifndef SIMSIMD_SPATIAL_H
+#define SIMSIMD_SPATIAL_H
+
+#include "types.h"
+
+#include "dot.h" // `_simsimd_reduce_f32x8_haswell`
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// clang-format off
+
+/*  Serial backends for all numeric types.
+ *  By default they use 32-bit arithmetic, unless the arguments themselves contain 64-bit floats.
+ *  For double-precision computation check out the "*_accurate" variants of those "*_serial" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_l2_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f64_serial(simsimd_f64_t const* a, simsimd_f64_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f32_serial(simsimd_f32_t const* a, simsimd_f32_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f16_serial(simsimd_f16_t const* a, simsimd_f16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_bf16_serial(simsimd_bf16_t const* a, simsimd_bf16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_i8_serial(simsimd_i8_t const* a, simsimd_i8_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_i8_serial(simsimd_i8_t const* a, simsimd_i8_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_i8_serial(simsimd_i8_t const* a, simsimd_i8_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_u8_serial(simsimd_u8_t const* a, simsimd_u8_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_u8_serial(simsimd_u8_t const* a, simsimd_u8_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_u8_serial(simsimd_u8_t const* a, simsimd_u8_t const*, simsimd_size_t n, simsimd_distance_t* d);
+
+/*  Double-precision serial backends for all numeric types.
+ *  For single-precision computation check out the "*_serial" counterparts of those "*_accurate" functions.
+ */
+SIMSIMD_PUBLIC void simsimd_l2_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f32_accurate(simsimd_f32_t const* a, simsimd_f32_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f16_accurate(simsimd_f16_t const* a, simsimd_f16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_bf16_accurate(simsimd_bf16_t const* a, simsimd_bf16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_accurate(simsimd_bf16_t const* a, simsimd_bf16_t const*, simsimd_size_t n, simsimd_distance_t* d);
+
+/*  SIMD-powered backends for Arm NEON, mostly using 32-bit arithmetic over 128-bit words.
+ *  By far the most portable backend, covering most Arm v8 devices, over a billion phones, and almost all
+ *  server CPUs produced before 2023.
+ */
+SIMSIMD_PUBLIC void simsimd_l2_f64_neon(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f64_neon(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f64_neon(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f32_neon(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_neon(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f32_neon(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f16_neon(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_neon(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f16_neon(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_bf16_neon(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_neon(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_bf16_neon(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_i8_neon(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_i8_neon(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_i8_neon(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_u8_neon(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_u8_neon(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_u8_neon(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+
+/*  SIMD-powered backends for Arm SVE, mostly using 32-bit arithmetic over variable-length platform-defined word sizes.
+ *  Designed for Arm Graviton 3, Microsoft Cobalt, as well as Nvidia Grace and newer Ampere Altra CPUs.
+ */
+SIMSIMD_PUBLIC void simsimd_l2_f32_sve(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_sve(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f32_sve(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f16_sve(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_sve(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f16_sve(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_bf16_sve(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_sve(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_bf16_sve(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f64_sve(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f64_sve(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f64_sve(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+
+/*  SIMD-powered backends for AVX2 CPUs of Haswell generation and newer, using 32-bit arithmetic over 256-bit words.
+ *  First demonstrated in 2011, at least one Haswell-based processor was still being sold in 2022 — the Pentium G3420.
+ *  Practically all modern x86 CPUs support AVX2, FMA, and F16C, making it a perfect baseline for SIMD algorithms.
+ *  On other hand, there is no need to implement AVX2 versions of `f32` and `f64` functions, as those are
+ *  properly vectorized by recent compilers.
+ */
+SIMSIMD_PUBLIC void simsimd_l2_i8_haswell(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_i8_haswell(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_i8_haswell(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_u8_haswell(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_u8_haswell(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_u8_haswell(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f16_haswell(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_haswell(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f16_haswell(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_bf16_haswell(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_haswell(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_bf16_haswell(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f32_haswell(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_haswell(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f32_haswell(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f64_haswell(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f64_haswell(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f64_haswell(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+
+/*  SIMD-powered backends for AVX512 CPUs of Skylake generation and newer, using 32-bit arithmetic over 512-bit words.
+ *  Skylake was launched in 2015, and discontinued in 2019. Skylake had support for F, CD, VL, DQ, and BW extensions,
+ *  as well as masked operations. This is enough to supersede auto-vectorization on `f32` and `f64` types.
+ */
+SIMSIMD_PUBLIC void simsimd_l2_f32_skylake(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_skylake(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f32_skylake(simsimd_f32_t const* a, simsimd_f32_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f64_skylake(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f64_skylake(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f64_skylake(simsimd_f64_t const* a, simsimd_f64_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+
+/*  SIMD-powered backends for AVX512 CPUs of Ice Lake generation and newer, using mixed arithmetic over 512-bit words.
+ *  Ice Lake added VNNI, VPOPCNTDQ, IFMA, VBMI, VAES, GFNI, VBMI2, BITALG, VPCLMULQDQ, and other extensions for integral operations.
+ *  Sapphire Rapids added tiled matrix operations, but we are most interested in the new mixed-precision FMA instructions.
+ */
+SIMSIMD_PUBLIC void simsimd_l2_i4x2_ice(simsimd_i4x2_t const* a, simsimd_i4x2_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_i4x2_ice(simsimd_i4x2_t const* a, simsimd_i4x2_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_i4x2_ice(simsimd_i4x2_t const* a, simsimd_i4x2_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_i8_ice(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_i8_ice(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_i8_ice(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_u8_ice(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_u8_ice(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_u8_ice(simsimd_u8_t const* a, simsimd_u8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_bf16_genoa(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_genoa(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_bf16_genoa(simsimd_bf16_t const* a, simsimd_bf16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2_f16_sapphire(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_sapphire(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+SIMSIMD_PUBLIC void simsimd_cos_f16_sapphire(simsimd_f16_t const* a, simsimd_f16_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+
+/*  SIMD-powered backends for AVX-INT8-VNNI extensions on Xeon 6 CPUs, including Sierra Forest and Granite Rapids.
+ *  The packs many "efficiency" cores into a single socket, avoiding heavy 512-bit operations, and focusing on 256-bit ones.
+ */
+SIMSIMD_PUBLIC void simsimd_cos_i8_sierra(simsimd_i8_t const* a, simsimd_i8_t const* b, simsimd_size_t n, simsimd_distance_t* d);
+// clang-format on
+
+#define SIMSIMD_MAKE_L2SQ(name, input_type, accumulator_type, load_and_convert)                                 \
+    SIMSIMD_PUBLIC void simsimd_l2sq_##input_type##_##name(simsimd_##input_type##_t const *a,                   \
+                                                           simsimd_##input_type##_t const *b, simsimd_size_t n, \
+                                                           simsimd_distance_t *result) {                        \
+        simsimd_##accumulator_type##_t d2 = 0;                                                                  \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                               \
+            simsimd_##accumulator_type##_t ai = load_and_convert(a + i);                                        \
+            simsimd_##accumulator_type##_t bi = load_and_convert(b + i);                                        \
+            d2 += (ai - bi) * (ai - bi);                                                                        \
+        }                                                                                                       \
+        *result = d2;                                                                                           \
+    }
+
+#define SIMSIMD_MAKE_L2(name, input_type, accumulator_type, load_and_convert)                                 \
+    SIMSIMD_PUBLIC void simsimd_l2_##input_type##_##name(simsimd_##input_type##_t const *a,                   \
+                                                         simsimd_##input_type##_t const *b, simsimd_size_t n, \
+                                                         simsimd_distance_t *result) {                        \
+        simsimd_l2sq_##input_type##_##name(a, b, n, result);                                                  \
+        *result = SIMSIMD_SQRT(*result);                                                                      \
+    }
+
+#define SIMSIMD_MAKE_COS(name, input_type, accumulator_type, load_and_convert)                                 \
+    SIMSIMD_PUBLIC void simsimd_cos_##input_type##_##name(simsimd_##input_type##_t const *a,                   \
+                                                          simsimd_##input_type##_t const *b, simsimd_size_t n, \
+                                                          simsimd_distance_t *result) {                        \
+        simsimd_##accumulator_type##_t ab = 0, a2 = 0, b2 = 0;                                                 \
+        for (simsimd_size_t i = 0; i != n; ++i) {                                                              \
+            simsimd_##accumulator_type##_t ai = load_and_convert(a + i);                                       \
+            simsimd_##accumulator_type##_t bi = load_and_convert(b + i);                                       \
+            ab += ai * bi;                                                                                     \
+            a2 += ai * ai;                                                                                     \
+            b2 += bi * bi;                                                                                     \
+        }                                                                                                      \
+        if (a2 == 0 && b2 == 0) { *result = 0; }                                                               \
+        else if (ab == 0) { *result = 1; }                                                                     \
+        else {                                                                                                 \
+            simsimd_distance_t unclipped_result = 1 - ab * SIMSIMD_RSQRT(a2) * SIMSIMD_RSQRT(b2);              \
+            *result = unclipped_result > 0 ? unclipped_result : 0;                                             \
+        }                                                                                                      \
+    }
+
+SIMSIMD_MAKE_COS(serial, f64, f64, SIMSIMD_DEREFERENCE)  // simsimd_cos_f64_serial
+SIMSIMD_MAKE_L2SQ(serial, f64, f64, SIMSIMD_DEREFERENCE) // simsimd_l2sq_f64_serial
+SIMSIMD_MAKE_L2(serial, f64, f64, SIMSIMD_DEREFERENCE)   // simsimd_l2_f64_serial
+
+SIMSIMD_MAKE_COS(serial, f32, f32, SIMSIMD_DEREFERENCE)  // simsimd_cos_f32_serial
+SIMSIMD_MAKE_L2SQ(serial, f32, f32, SIMSIMD_DEREFERENCE) // simsimd_l2sq_f32_serial
+SIMSIMD_MAKE_L2(serial, f32, f32, SIMSIMD_DEREFERENCE)   // simsimd_l2_f32_serial
+
+SIMSIMD_MAKE_COS(serial, f16, f32, SIMSIMD_F16_TO_F32)  // simsimd_cos_f16_serial
+SIMSIMD_MAKE_L2SQ(serial, f16, f32, SIMSIMD_F16_TO_F32) // simsimd_l2sq_f16_serial
+SIMSIMD_MAKE_L2(serial, f16, f32, SIMSIMD_F16_TO_F32)   // simsimd_l2_f16_serial
+
+SIMSIMD_MAKE_COS(serial, bf16, f32, SIMSIMD_BF16_TO_F32)  // simsimd_cos_bf16_serial
+SIMSIMD_MAKE_L2SQ(serial, bf16, f32, SIMSIMD_BF16_TO_F32) // simsimd_l2sq_bf16_serial
+SIMSIMD_MAKE_L2(serial, bf16, f32, SIMSIMD_BF16_TO_F32)   // simsimd_l2_bf16_serial
+
+SIMSIMD_MAKE_COS(serial, i8, i32, SIMSIMD_DEREFERENCE)  // simsimd_cos_i8_serial
+SIMSIMD_MAKE_L2SQ(serial, i8, i32, SIMSIMD_DEREFERENCE) // simsimd_l2sq_i8_serial
+SIMSIMD_MAKE_L2(serial, i8, i32, SIMSIMD_DEREFERENCE)   // simsimd_l2_i8_serial
+
+SIMSIMD_MAKE_COS(serial, u8, i32, SIMSIMD_DEREFERENCE)  // simsimd_cos_u8_serial
+SIMSIMD_MAKE_L2SQ(serial, u8, i32, SIMSIMD_DEREFERENCE) // simsimd_l2sq_u8_serial
+SIMSIMD_MAKE_L2(serial, u8, i32, SIMSIMD_DEREFERENCE)   // simsimd_l2_u8_serial
+
+SIMSIMD_MAKE_COS(accurate, f32, f64, SIMSIMD_DEREFERENCE)  // simsimd_cos_f32_accurate
+SIMSIMD_MAKE_L2SQ(accurate, f32, f64, SIMSIMD_DEREFERENCE) // simsimd_l2sq_f32_accurate
+SIMSIMD_MAKE_L2(accurate, f32, f64, SIMSIMD_DEREFERENCE)   // simsimd_l2_f32_accurate
+
+SIMSIMD_MAKE_COS(accurate, f16, f64, SIMSIMD_F16_TO_F32)  // simsimd_cos_f16_accurate
+SIMSIMD_MAKE_L2SQ(accurate, f16, f64, SIMSIMD_F16_TO_F32) // simsimd_l2sq_f16_accurate
+SIMSIMD_MAKE_L2(accurate, f16, f64, SIMSIMD_F16_TO_F32)   // simsimd_l2_f16_accurate
+
+SIMSIMD_MAKE_COS(accurate, bf16, f64, SIMSIMD_BF16_TO_F32)  // simsimd_cos_bf16_accurate
+SIMSIMD_MAKE_L2SQ(accurate, bf16, f64, SIMSIMD_BF16_TO_F32) // simsimd_l2sq_bf16_accurate
+SIMSIMD_MAKE_L2(accurate, bf16, f64, SIMSIMD_BF16_TO_F32)   // simsimd_l2_bf16_accurate
+
+#if _SIMSIMD_TARGET_ARM
+#if SIMSIMD_TARGET_NEON
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd"))), apply_to = function)
+
+SIMSIMD_INTERNAL simsimd_f32_t _simsimd_sqrt_f32_neon(simsimd_f32_t x) {
+    return vget_lane_f32(vsqrt_f32(vdup_n_f32(x)), 0);
+}
+SIMSIMD_INTERNAL simsimd_f64_t _simsimd_sqrt_f64_neon(simsimd_f64_t x) {
+    return vget_lane_f64(vsqrt_f64(vdup_n_f64(x)), 0);
+}
+SIMSIMD_INTERNAL simsimd_distance_t _simsimd_cos_normalize_f32_neon(simsimd_f32_t ab, simsimd_f32_t a2,
+                                                                    simsimd_f32_t b2) {
+    if (a2 == 0 && b2 == 0) return 0;
+    if (ab == 0) return 1;
+    simsimd_f32_t squares_arr[2] = {a2, b2};
+    float32x2_t squares = vld1_f32(squares_arr);
+    // Unlike x86, Arm NEON manuals don't explicitly mention the accuracy of their `rsqrt` approximation.
+    // Third party research suggests, that it's less accurate than SSE instructions, having an error of 1.5*2^-12.
+    // One or two rounds of Newton-Raphson refinement are recommended to improve the accuracy.
+    // https://github.com/lighttransport/embree-aarch64/issues/24
+    // https://github.com/lighttransport/embree-aarch64/blob/3f75f8cb4e553d13dced941b5fefd4c826835a6b/common/math/math.h#L137-L145
+    float32x2_t rsqrts = vrsqrte_f32(squares);
+    // Perform two rounds of Newton-Raphson refinement:
+    // https://en.wikipedia.org/wiki/Newton%27s_method
+    rsqrts = vmul_f32(rsqrts, vrsqrts_f32(vmul_f32(squares, rsqrts), rsqrts));
+    rsqrts = vmul_f32(rsqrts, vrsqrts_f32(vmul_f32(squares, rsqrts), rsqrts));
+    vst1_f32(squares_arr, rsqrts);
+    simsimd_distance_t result = 1 - ab * squares_arr[0] * squares_arr[1];
+    return result > 0 ? result : 0;
+}
+
+SIMSIMD_INTERNAL simsimd_distance_t _simsimd_cos_normalize_f64_neon(simsimd_f64_t ab, simsimd_f64_t a2,
+                                                                    simsimd_f64_t b2) {
+    if (a2 == 0 && b2 == 0) return 0;
+    if (ab == 0) return 1;
+    simsimd_f64_t squares_arr[2] = {a2, b2};
+    float64x2_t squares = vld1q_f64(squares_arr);
+
+    // Unlike x86, Arm NEON manuals don't explicitly mention the accuracy of their `rsqrt` approximation.
+    // Third party research suggests, that it's less accurate than SSE instructions, having an error of 1.5*2^-12.
+    // One or two rounds of Newton-Raphson refinement are recommended to improve the accuracy.
+    // https://github.com/lighttransport/embree-aarch64/issues/24
+    // https://github.com/lighttransport/embree-aarch64/blob/3f75f8cb4e553d13dced941b5fefd4c826835a6b/common/math/math.h#L137-L145
+    float64x2_t rsqrts = vrsqrteq_f64(squares);
+    // Perform two rounds of Newton-Raphson refinement:
+    // https://en.wikipedia.org/wiki/Newton%27s_method
+    rsqrts = vmulq_f64(rsqrts, vrsqrtsq_f64(vmulq_f64(squares, rsqrts), rsqrts));
+    rsqrts = vmulq_f64(rsqrts, vrsqrtsq_f64(vmulq_f64(squares, rsqrts), rsqrts));
+    vst1q_f64(squares_arr, rsqrts);
+    simsimd_distance_t result = 1 - ab * squares_arr[0] * squares_arr[1];
+    return result > 0 ? result : 0;
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_f32_neon(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    simsimd_l2sq_f32_neon(a, b, n, result);
+    *result = _simsimd_sqrt_f64_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_neon(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                          simsimd_distance_t *result) {
+    float32x4_t sum_vec = vdupq_n_f32(0);
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vld1q_f32(a + i);
+        float32x4_t b_vec = vld1q_f32(b + i);
+        float32x4_t diff_vec = vsubq_f32(a_vec, b_vec);
+        sum_vec = vfmaq_f32(sum_vec, diff_vec, diff_vec);
+    }
+    simsimd_f32_t sum = vaddvq_f32(sum_vec);
+    for (; i < n; ++i) {
+        simsimd_f32_t diff = a[i] - b[i];
+        sum += diff * diff;
+    }
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f32_neon(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+    float32x4_t ab_vec = vdupq_n_f32(0), a2_vec = vdupq_n_f32(0), b2_vec = vdupq_n_f32(0);
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        float32x4_t a_vec = vld1q_f32(a + i);
+        float32x4_t b_vec = vld1q_f32(b + i);
+        ab_vec = vfmaq_f32(ab_vec, a_vec, b_vec);
+        a2_vec = vfmaq_f32(a2_vec, a_vec, a_vec);
+        b2_vec = vfmaq_f32(b2_vec, b_vec, b_vec);
+    }
+    simsimd_f32_t ab = vaddvq_f32(ab_vec), a2 = vaddvq_f32(a2_vec), b2 = vaddvq_f32(b2_vec);
+    for (; i < n; ++i) {
+        simsimd_f32_t ai = a[i], bi = b[i];
+        ab += ai * bi, a2 += ai * ai, b2 += bi * bi;
+    }
+
+    *result = _simsimd_cos_normalize_f64_neon(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_f64_neon(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    simsimd_l2sq_f64_neon(a, b, n, result);
+    *result = _simsimd_sqrt_f64_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f64_neon(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                          simsimd_distance_t *result) {
+    float64x2_t sum_vec = vdupq_n_f64(0);
+    simsimd_size_t i = 0;
+    for (; i + 2 <= n; i += 2) {
+        float64x2_t a_vec = vld1q_f64(a + i);
+        float64x2_t b_vec = vld1q_f64(b + i);
+        float64x2_t diff_vec = vsubq_f64(a_vec, b_vec);
+        sum_vec = vfmaq_f64(sum_vec, diff_vec, diff_vec);
+    }
+    simsimd_f64_t sum = vaddvq_f64(sum_vec);
+    for (; i < n; ++i) {
+        simsimd_f64_t diff = a[i] - b[i];
+        sum += diff * diff;
+    }
+    *result = sum;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f64_neon(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+    float64x2_t ab_vec = vdupq_n_f64(0), a2_vec = vdupq_n_f64(0), b2_vec = vdupq_n_f64(0);
+    simsimd_size_t i = 0;
+    for (; i + 2 <= n; i += 2) {
+        float64x2_t a_vec = vld1q_f64(a + i);
+        float64x2_t b_vec = vld1q_f64(b + i);
+        ab_vec = vfmaq_f64(ab_vec, a_vec, b_vec);
+        a2_vec = vfmaq_f64(a2_vec, a_vec, a_vec);
+        b2_vec = vfmaq_f64(b2_vec, b_vec, b_vec);
+    }
+    simsimd_f64_t ab = vaddvq_f64(ab_vec), a2 = vaddvq_f64(a2_vec), b2 = vaddvq_f64(b2_vec);
+    for (; i < n; ++i) {
+        simsimd_f64_t ai = a[i], bi = b[i];
+        ab += ai * bi, a2 += ai * ai, b2 += bi * bi;
+    }
+
+    *result = _simsimd_cos_normalize_f64_neon(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON
+
+#if SIMSIMD_TARGET_NEON_F16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+simd+fp16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+simd+fp16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_l2_f16_neon(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    simsimd_l2sq_f16_neon(a, b, n, result);
+    *result = _simsimd_sqrt_f32_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_neon(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                          simsimd_distance_t *result) {
+    float32x4_t a_vec, b_vec;
+    float32x4_t sum_vec = vdupq_n_f32(0);
+
+simsimd_l2sq_f16_neon_cycle:
+    if (n < 4) {
+        a_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(a, n));
+        b_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(b, n));
+        n = 0;
+    }
+    else {
+        a_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)a));
+        b_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)b));
+        n -= 4, a += 4, b += 4;
+    }
+    float32x4_t diff_vec = vsubq_f32(a_vec, b_vec);
+    sum_vec = vfmaq_f32(sum_vec, diff_vec, diff_vec);
+    if (n) goto simsimd_l2sq_f16_neon_cycle;
+
+    *result = vaddvq_f32(sum_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f16_neon(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+    float32x4_t ab_vec = vdupq_n_f32(0), a2_vec = vdupq_n_f32(0), b2_vec = vdupq_n_f32(0);
+    float32x4_t a_vec, b_vec;
+
+simsimd_cos_f16_neon_cycle:
+    if (n < 4) {
+        a_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(a, n));
+        b_vec = vcvt_f32_f16(_simsimd_partial_load_f16x4_neon(b, n));
+        n = 0;
+    }
+    else {
+        a_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)a));
+        b_vec = vcvt_f32_f16(vld1_f16((simsimd_f16_for_arm_simd_t const *)b));
+        n -= 4, a += 4, b += 4;
+    }
+    ab_vec = vfmaq_f32(ab_vec, a_vec, b_vec);
+    a2_vec = vfmaq_f32(a2_vec, a_vec, a_vec);
+    b2_vec = vfmaq_f32(b2_vec, b_vec, b_vec);
+    if (n) goto simsimd_cos_f16_neon_cycle;
+
+    simsimd_f32_t ab = vaddvq_f32(ab_vec), a2 = vaddvq_f32(a2_vec), b2 = vaddvq_f32(b2_vec);
+    *result = _simsimd_cos_normalize_f32_neon(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_F16
+
+#if SIMSIMD_TARGET_NEON_BF16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.6-a+simd+bf16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.6-a+simd+bf16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_cos_bf16_neon(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                          simsimd_distance_t *result) {
+
+    // Similar to `simsimd_cos_i8_neon`, we can use the `BFMMLA` instruction through
+    // the `vbfmmlaq_f32` intrinsic to compute matrix products and later drop 1/4 of values.
+    // The only difference is that `zip` isn't provided for `bf16` and we need to reinterpret back
+    // and forth before zipping. Same as with integers, on modern Arm CPUs, this "smart"
+    // approach is actually slower by around 25%.
+    //
+    //   float32x4_t products_low_vec = vdupq_n_f32(0.0f);
+    //   float32x4_t products_high_vec = vdupq_n_f32(0.0f);
+    //   for (; i + 8 <= n; i += 8) {
+    //       bfloat16x8_t a_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const*)a + i);
+    //       bfloat16x8_t b_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const*)b + i);
+    //       int16x8_t a_vec_s16 = vreinterpretq_s16_bf16(a_vec);
+    //       int16x8_t b_vec_s16 = vreinterpretq_s16_bf16(b_vec);
+    //       int16x8x2_t y_w_vecs_s16 = vzipq_s16(a_vec_s16, b_vec_s16);
+    //       bfloat16x8_t y_vec = vreinterpretq_bf16_s16(y_w_vecs_s16.val[0]);
+    //       bfloat16x8_t w_vec = vreinterpretq_bf16_s16(y_w_vecs_s16.val[1]);
+    //       bfloat16x4_t a_low = vget_low_bf16(a_vec);
+    //       bfloat16x4_t b_low = vget_low_bf16(b_vec);
+    //       bfloat16x4_t a_high = vget_high_bf16(a_vec);
+    //       bfloat16x4_t b_high = vget_high_bf16(b_vec);
+    //       bfloat16x8_t x_vec = vcombine_bf16(a_low, b_low);
+    //       bfloat16x8_t v_vec = vcombine_bf16(a_high, b_high);
+    //       products_low_vec = vbfmmlaq_f32(products_low_vec, x_vec, y_vec);
+    //       products_high_vec = vbfmmlaq_f32(products_high_vec, v_vec, w_vec);
+    //   }
+    //   float32x4_t products_vec = vaddq_f32(products_high_vec, products_low_vec);
+    //   simsimd_f32_t a2 = products_vec[0], ab = products_vec[1], b2 = products_vec[3];
+    //
+    // Another way of accomplishing the same thing is to process the odd and even elements separately,
+    // using special `vbfmlaltq_f32` and `vbfmlalbq_f32` intrinsics:
+    //
+    //      ab_high_vec = vbfmlaltq_f32(ab_high_vec, a_vec, b_vec);
+    //      ab_low_vec = vbfmlalbq_f32(ab_low_vec, a_vec, b_vec);
+    //      a2_high_vec = vbfmlaltq_f32(a2_high_vec, a_vec, a_vec);
+    //      a2_low_vec = vbfmlalbq_f32(a2_low_vec, a_vec, a_vec);
+    //      b2_high_vec = vbfmlaltq_f32(b2_high_vec, b_vec, b_vec);
+    //      b2_low_vec = vbfmlalbq_f32(b2_low_vec, b_vec, b_vec);
+    //
+
+    float32x4_t ab_vec = vdupq_n_f32(0);
+    float32x4_t a2_vec = vdupq_n_f32(0);
+    float32x4_t b2_vec = vdupq_n_f32(0);
+    bfloat16x8_t a_vec, b_vec;
+
+simsimd_cos_bf16_neon_cycle:
+    if (n < 8) {
+        a_vec = _simsimd_partial_load_bf16x8_neon(a, n);
+        b_vec = _simsimd_partial_load_bf16x8_neon(b, n);
+        n = 0;
+    }
+    else {
+        a_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)a);
+        b_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)b);
+        n -= 8, a += 8, b += 8;
+    }
+    ab_vec = vbfdotq_f32(ab_vec, a_vec, b_vec);
+    a2_vec = vbfdotq_f32(a2_vec, a_vec, a_vec);
+    b2_vec = vbfdotq_f32(b2_vec, b_vec, b_vec);
+    if (n) goto simsimd_cos_bf16_neon_cycle;
+
+    // Avoid `simsimd_approximate_inverse_square_root` on Arm NEON
+    simsimd_f32_t ab = vaddvq_f32(ab_vec), a2 = vaddvq_f32(a2_vec), b2 = vaddvq_f32(b2_vec);
+    *result = _simsimd_cos_normalize_f32_neon(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_bf16_neon(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+    simsimd_l2sq_bf16_neon(a, b, n, result);
+    *result = _simsimd_sqrt_f64_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_neon(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    float32x4_t diff_high_vec, diff_low_vec;
+    float32x4_t sum_high_vec = vdupq_n_f32(0), sum_low_vec = vdupq_n_f32(0);
+
+simsimd_l2sq_bf16_neon_cycle:
+    if (n < 8) {
+        bfloat16x8_t a_vec = _simsimd_partial_load_bf16x8_neon(a, n);
+        bfloat16x8_t b_vec = _simsimd_partial_load_bf16x8_neon(b, n);
+        diff_high_vec = vsubq_f32(vcvt_f32_bf16(vget_high_bf16(a_vec)), vcvt_f32_bf16(vget_high_bf16(b_vec)));
+        diff_low_vec = vsubq_f32(vcvt_f32_bf16(vget_low_bf16(a_vec)), vcvt_f32_bf16(vget_low_bf16(b_vec)));
+        n = 0;
+    }
+    else {
+        bfloat16x8_t a_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)a);
+        bfloat16x8_t b_vec = vld1q_bf16((simsimd_bf16_for_arm_simd_t const *)b);
+        diff_high_vec = vsubq_f32(vcvt_f32_bf16(vget_high_bf16(a_vec)), vcvt_f32_bf16(vget_high_bf16(b_vec)));
+        diff_low_vec = vsubq_f32(vcvt_f32_bf16(vget_low_bf16(a_vec)), vcvt_f32_bf16(vget_low_bf16(b_vec)));
+        n -= 8, a += 8, b += 8;
+    }
+    sum_high_vec = vfmaq_f32(sum_high_vec, diff_high_vec, diff_high_vec);
+    sum_low_vec = vfmaq_f32(sum_low_vec, diff_low_vec, diff_low_vec);
+    if (n) goto simsimd_l2sq_bf16_neon_cycle;
+
+    *result = vaddvq_f32(vaddq_f32(sum_high_vec, sum_low_vec));
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_BF16
+
+#if SIMSIMD_TARGET_NEON_I8
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+dotprod+i8mm")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+dotprod+i8mm"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_l2_i8_neon(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *result) {
+    simsimd_l2sq_i8_neon(a, b, n, result);
+    *result = _simsimd_sqrt_f32_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_i8_neon(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+
+    // The naive approach is to upcast 8-bit signed integers into 16-bit signed integers
+    // for subtraction, then multiply within 16-bit integers and accumulate the results
+    // into 32-bit integers. This approach is slow on modern Arm CPUs. On Graviton 4,
+    // that approach results in 17 GB/s of throughput, compared to 39 GB/s for `i8`
+    // dot-products.
+    //
+    // Luckily we can use the `vabdq_s8` which technically returns `i8` values, but it's a
+    // matter of reinterpret-casting! That approach boosts us to 33 GB/s of throughput.
+    uint32x4_t d2_vec = vdupq_n_u32(0);
+    simsimd_size_t i = 0;
+    for (; i + 16 <= n; i += 16) {
+        int8x16_t a_vec = vld1q_s8(a + i);
+        int8x16_t b_vec = vld1q_s8(b + i);
+        uint8x16_t d_vec = vreinterpretq_u8_s8(vabdq_s8(a_vec, b_vec));
+        d2_vec = vdotq_u32(d2_vec, d_vec, d_vec);
+    }
+    simsimd_u32_t d2 = vaddvq_u32(d2_vec);
+    for (; i < n; ++i) {
+        simsimd_i32_t n = (simsimd_i32_t)a[i] - b[i];
+        d2 += (simsimd_u32_t)(n * n);
+    }
+    *result = d2;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_i8_neon(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+
+    simsimd_size_t i = 0;
+
+    // Variant 1.
+    // If the 128-bit `vdot_s32` intrinsic is unavailable, we can use the 64-bit `vdot_s32`.
+    //
+    //  int32x4_t ab_vec = vdupq_n_s32(0);
+    //  int32x4_t a2_vec = vdupq_n_s32(0);
+    //  int32x4_t b2_vec = vdupq_n_s32(0);
+    //  for (simsimd_size_t i = 0; i != n; i += 8) {
+    //      int16x8_t a_vec = vmovl_s8(vld1_s8(a + i));
+    //      int16x8_t b_vec = vmovl_s8(vld1_s8(b + i));
+    //      int16x8_t ab_part_vec = vmulq_s16(a_vec, b_vec);
+    //      int16x8_t a2_part_vec = vmulq_s16(a_vec, a_vec);
+    //      int16x8_t b2_part_vec = vmulq_s16(b_vec, b_vec);
+    //      ab_vec = vaddq_s32(ab_vec, vaddq_s32(vmovl_s16(vget_high_s16(ab_part_vec)), //
+    //                                           vmovl_s16(vget_low_s16(ab_part_vec))));
+    //      a2_vec = vaddq_s32(a2_vec, vaddq_s32(vmovl_s16(vget_high_s16(a2_part_vec)), //
+    //                                           vmovl_s16(vget_low_s16(a2_part_vec))));
+    //      b2_vec = vaddq_s32(b2_vec, vaddq_s32(vmovl_s16(vget_high_s16(b2_part_vec)), //
+    //                                           vmovl_s16(vget_low_s16(b2_part_vec))));
+    //  }
+    //
+    // Variant 2.
+    // With the 128-bit `vdotq_s32` intrinsic, we can use the following code:
+    //
+    //  for (; i + 16 <= n; i += 16) {
+    //      int8x16_t a_vec = vld1q_s8(a + i);
+    //      int8x16_t b_vec = vld1q_s8(b + i);
+    //      ab_vec = vdotq_s32(ab_vec, a_vec, b_vec);
+    //      a2_vec = vdotq_s32(a2_vec, a_vec, a_vec);
+    //      b2_vec = vdotq_s32(b2_vec, b_vec, b_vec);
+    //  }
+    //
+    // Variant 3.
+    // To use MMLA instructions, we need to reorganize the contents of the vectors.
+    // On input we have `a_vec` and `b_vec`:
+    //
+    //   a[0], a[1], a[2], a[3], a[4], a[5], a[6], a[7], a[8], a[9], a[10], a[11], a[12], a[13], a[14], a[15]
+    //   b[0], b[1], b[2], b[3], b[4], b[5], b[6], b[7], b[8], b[9], b[10], b[11], b[12], b[13], b[14], b[15]
+    //
+    // We will be multiplying matrices of size 2x8 and 8x2. So we need to perform a few shuffles:
+    //
+    //   X =
+    //      a[0], a[1], a[2], a[3], a[4], a[5], a[6], a[7],
+    //      b[0], b[1], b[2], b[3], b[4], b[5], b[6], b[7]
+    //   Y =
+    //      a[0], b[0],
+    //      a[1], b[1],
+    //      a[2], b[2],
+    //      a[3], b[3],
+    //      a[4], b[4],
+    //      a[5], b[5],
+    //      a[6], b[6],
+    //      a[7], b[7]
+    //
+    //   V =
+    //      a[8], a[9], a[10], a[11], a[12], a[13], a[14], a[15],
+    //      b[8], b[9], b[10], b[11], b[12], b[13], b[14], b[15]
+    //   W =
+    //      a[8],   b[8],
+    //      a[9],   b[9],
+    //      a[10],  b[10],
+    //      a[11],  b[11],
+    //      a[12],  b[12],
+    //      a[13],  b[13],
+    //      a[14],  b[14],
+    //      a[15],  b[15]
+    //
+    // Performing matrix multiplications we can aggregate into a matrix `products_low_vec` and `products_high_vec`:
+    //
+    //      X * X, X * Y                V * W, V * V
+    //      Y * X, Y * Y                W * W, W * V
+    //
+    // Of those values we need only 3/4, as the (X * Y) and (Y * X) are the same.
+    //
+    //      int32x4_t products_low_vec = vdupq_n_s32(0), products_high_vec = vdupq_n_s32(0);
+    //      int8x16_t a_low_b_low_vec, a_high_b_high_vec;
+    //      for (; i + 16 <= n; i += 16) {
+    //          int8x16_t a_vec = vld1q_s8(a + i);
+    //          int8x16_t b_vec = vld1q_s8(b + i);
+    //          int8x16x2_t y_w_vecs = vzipq_s8(a_vec, b_vec);
+    //          int8x16_t x_vec = vcombine_s8(vget_low_s8(a_vec), vget_low_s8(b_vec));
+    //          int8x16_t v_vec = vcombine_s8(vget_high_s8(a_vec), vget_high_s8(b_vec));
+    //          products_low_vec = vmmlaq_s32(products_low_vec, x_vec, y_w_vecs.val[0]);
+    //          products_high_vec = vmmlaq_s32(products_high_vec, v_vec, y_w_vecs.val[1]);
+    //      }
+    //      int32x4_t products_vec = vaddq_s32(products_high_vec, products_low_vec);
+    //      simsimd_i32_t a2 = products_vec[0];
+    //      simsimd_i32_t ab = products_vec[1];
+    //      simsimd_i32_t b2 = products_vec[3];
+    //
+    // That solution is elegant, but it requires the additional `+i8mm` extension and is currently slower,
+    // at least on AWS Graviton 3.
+    int32x4_t ab_vec = vdupq_n_s32(0);
+    int32x4_t a2_vec = vdupq_n_s32(0);
+    int32x4_t b2_vec = vdupq_n_s32(0);
+    for (; i + 16 <= n; i += 16) {
+        int8x16_t a_vec = vld1q_s8(a + i);
+        int8x16_t b_vec = vld1q_s8(b + i);
+        ab_vec = vdotq_s32(ab_vec, a_vec, b_vec);
+        a2_vec = vdotq_s32(a2_vec, a_vec, a_vec);
+        b2_vec = vdotq_s32(b2_vec, b_vec, b_vec);
+    }
+    simsimd_i32_t ab = vaddvq_s32(ab_vec);
+    simsimd_i32_t a2 = vaddvq_s32(a2_vec);
+    simsimd_i32_t b2 = vaddvq_s32(b2_vec);
+
+    // Take care of the tail:
+    for (; i < n; ++i) {
+        simsimd_i32_t ai = a[i], bi = b[i];
+        ab += ai * bi, a2 += ai * ai, b2 += bi * bi;
+    }
+
+    *result = _simsimd_cos_normalize_f32_neon(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_u8_neon(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *result) {
+    simsimd_l2sq_u8_neon(a, b, n, result);
+    *result = _simsimd_sqrt_f32_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_u8_neon(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+    uint32x4_t d2_vec = vdupq_n_u32(0);
+    simsimd_size_t i = 0;
+    for (; i + 16 <= n; i += 16) {
+        uint8x16_t a_vec = vld1q_u8(a + i);
+        uint8x16_t b_vec = vld1q_u8(b + i);
+        uint8x16_t d_vec = vabdq_u8(a_vec, b_vec);
+        d2_vec = vdotq_u32(d2_vec, d_vec, d_vec);
+    }
+    simsimd_u32_t d2 = vaddvq_u32(d2_vec);
+    for (; i < n; ++i) {
+        simsimd_i32_t n = (simsimd_i32_t)a[i] - b[i];
+        d2 += (simsimd_u32_t)(n * n);
+    }
+    *result = d2;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_u8_neon(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+
+    simsimd_size_t i = 0;
+    uint32x4_t ab_vec = vdupq_n_u32(0);
+    uint32x4_t a2_vec = vdupq_n_u32(0);
+    uint32x4_t b2_vec = vdupq_n_u32(0);
+    for (; i + 16 <= n; i += 16) {
+        uint8x16_t a_vec = vld1q_u8(a + i);
+        uint8x16_t b_vec = vld1q_u8(b + i);
+        ab_vec = vdotq_u32(ab_vec, a_vec, b_vec);
+        a2_vec = vdotq_u32(a2_vec, a_vec, a_vec);
+        b2_vec = vdotq_u32(b2_vec, b_vec, b_vec);
+    }
+    simsimd_u32_t ab = vaddvq_u32(ab_vec);
+    simsimd_u32_t a2 = vaddvq_u32(a2_vec);
+    simsimd_u32_t b2 = vaddvq_u32(b2_vec);
+
+    // Take care of the tail:
+    for (; i < n; ++i) {
+        simsimd_u32_t ai = a[i], bi = b[i];
+        ab += ai * bi, a2 += ai * ai, b2 += bi * bi;
+    }
+
+    *result = _simsimd_cos_normalize_f32_neon(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_NEON_I8
+
+#if SIMSIMD_TARGET_SVE
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+sve")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+sve"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_l2_f32_sve(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *result) {
+    simsimd_l2sq_f32_sve(a, b, n, result);
+    *result = _simsimd_sqrt_f64_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_sve(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+    simsimd_size_t i = 0;
+    svfloat32_t d2_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    do {
+        svbool_t pg_vec = svwhilelt_b32((unsigned int)i, (unsigned int)n);
+        svfloat32_t a_vec = svld1_f32(pg_vec, a + i);
+        svfloat32_t b_vec = svld1_f32(pg_vec, b + i);
+        svfloat32_t a_minus_b_vec = svsub_f32_x(pg_vec, a_vec, b_vec);
+        d2_vec = svmla_f32_x(pg_vec, d2_vec, a_minus_b_vec, a_minus_b_vec);
+        i += svcntw();
+    } while (i < n);
+    simsimd_f32_t d2 = svaddv_f32(svptrue_b32(), d2_vec);
+    *result = d2;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f32_sve(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    simsimd_size_t i = 0;
+    svfloat32_t ab_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    svfloat32_t a2_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    svfloat32_t b2_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    do {
+        svbool_t pg_vec = svwhilelt_b32((unsigned int)i, (unsigned int)n);
+        svfloat32_t a_vec = svld1_f32(pg_vec, a + i);
+        svfloat32_t b_vec = svld1_f32(pg_vec, b + i);
+        ab_vec = svmla_f32_x(pg_vec, ab_vec, a_vec, b_vec);
+        a2_vec = svmla_f32_x(pg_vec, a2_vec, a_vec, a_vec);
+        b2_vec = svmla_f32_x(pg_vec, b2_vec, b_vec, b_vec);
+        i += svcntw();
+    } while (i < n);
+
+    simsimd_f32_t ab = svaddv_f32(svptrue_b32(), ab_vec);
+    simsimd_f32_t a2 = svaddv_f32(svptrue_b32(), a2_vec);
+    simsimd_f32_t b2 = svaddv_f32(svptrue_b32(), b2_vec);
+    *result = _simsimd_cos_normalize_f64_neon(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_f64_sve(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *result) {
+    simsimd_l2sq_f64_sve(a, b, n, result);
+    *result = _simsimd_sqrt_f64_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f64_sve(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+    simsimd_size_t i = 0;
+    svfloat64_t d2_vec = svdupq_n_f64(0.0, 0.0);
+    do {
+        svbool_t pg_vec = svwhilelt_b64((unsigned int)i, (unsigned int)n);
+        svfloat64_t a_vec = svld1_f64(pg_vec, a + i);
+        svfloat64_t b_vec = svld1_f64(pg_vec, b + i);
+        svfloat64_t a_minus_b_vec = svsub_f64_x(pg_vec, a_vec, b_vec);
+        d2_vec = svmla_f64_x(pg_vec, d2_vec, a_minus_b_vec, a_minus_b_vec);
+        i += svcntd();
+    } while (i < n);
+    simsimd_f64_t d2 = svaddv_f64(svptrue_b32(), d2_vec);
+    *result = d2;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f64_sve(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    simsimd_size_t i = 0;
+    svfloat64_t ab_vec = svdupq_n_f64(0.0, 0.0);
+    svfloat64_t a2_vec = svdupq_n_f64(0.0, 0.0);
+    svfloat64_t b2_vec = svdupq_n_f64(0.0, 0.0);
+    do {
+        svbool_t pg_vec = svwhilelt_b64((unsigned int)i, (unsigned int)n);
+        svfloat64_t a_vec = svld1_f64(pg_vec, a + i);
+        svfloat64_t b_vec = svld1_f64(pg_vec, b + i);
+        ab_vec = svmla_f64_x(pg_vec, ab_vec, a_vec, b_vec);
+        a2_vec = svmla_f64_x(pg_vec, a2_vec, a_vec, a_vec);
+        b2_vec = svmla_f64_x(pg_vec, b2_vec, b_vec, b_vec);
+        i += svcntd();
+    } while (i < n);
+
+    simsimd_f64_t ab = svaddv_f64(svptrue_b32(), ab_vec);
+    simsimd_f64_t a2 = svaddv_f64(svptrue_b32(), a2_vec);
+    simsimd_f64_t b2 = svaddv_f64(svptrue_b32(), b2_vec);
+    *result = _simsimd_cos_normalize_f64_neon(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SVE
+
+#if SIMSIMD_TARGET_SVE_F16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+sve+fp16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+sve+fp16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_l2_f16_sve(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *result) {
+    simsimd_l2sq_f16_sve(a, b, n, result);
+    *result = _simsimd_sqrt_f32_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_sve(simsimd_f16_t const *a_enum, simsimd_f16_t const *b_enum, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+    simsimd_size_t i = 0;
+    svfloat16_t d2_vec = svdupq_n_f16(0, 0, 0, 0, 0, 0, 0, 0);
+    simsimd_f16_for_arm_simd_t const *a = (simsimd_f16_for_arm_simd_t const *)(a_enum);
+    simsimd_f16_for_arm_simd_t const *b = (simsimd_f16_for_arm_simd_t const *)(b_enum);
+    do {
+        svbool_t pg_vec = svwhilelt_b16((unsigned int)i, (unsigned int)n);
+        svfloat16_t a_vec = svld1_f16(pg_vec, a + i);
+        svfloat16_t b_vec = svld1_f16(pg_vec, b + i);
+        svfloat16_t a_minus_b_vec = svsub_f16_x(pg_vec, a_vec, b_vec);
+        d2_vec = svmla_f16_x(pg_vec, d2_vec, a_minus_b_vec, a_minus_b_vec);
+        i += svcnth();
+    } while (i < n);
+    simsimd_f16_for_arm_simd_t d2_f16 = svaddv_f16(svptrue_b16(), d2_vec);
+    *result = d2_f16;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f16_sve(simsimd_f16_t const *a_enum, simsimd_f16_t const *b_enum, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    simsimd_size_t i = 0;
+    svfloat16_t ab_vec = svdupq_n_f16(0, 0, 0, 0, 0, 0, 0, 0);
+    svfloat16_t a2_vec = svdupq_n_f16(0, 0, 0, 0, 0, 0, 0, 0);
+    svfloat16_t b2_vec = svdupq_n_f16(0, 0, 0, 0, 0, 0, 0, 0);
+    simsimd_f16_for_arm_simd_t const *a = (simsimd_f16_for_arm_simd_t const *)(a_enum);
+    simsimd_f16_for_arm_simd_t const *b = (simsimd_f16_for_arm_simd_t const *)(b_enum);
+    do {
+        svbool_t pg_vec = svwhilelt_b16((unsigned int)i, (unsigned int)n);
+        svfloat16_t a_vec = svld1_f16(pg_vec, a + i);
+        svfloat16_t b_vec = svld1_f16(pg_vec, b + i);
+        ab_vec = svmla_f16_x(pg_vec, ab_vec, a_vec, b_vec);
+        a2_vec = svmla_f16_x(pg_vec, a2_vec, a_vec, a_vec);
+        b2_vec = svmla_f16_x(pg_vec, b2_vec, b_vec, b_vec);
+        i += svcnth();
+    } while (i < n);
+
+    simsimd_f16_for_arm_simd_t ab = svaddv_f16(svptrue_b16(), ab_vec);
+    simsimd_f16_for_arm_simd_t a2 = svaddv_f16(svptrue_b16(), a2_vec);
+    simsimd_f16_for_arm_simd_t b2 = svaddv_f16(svptrue_b16(), b2_vec);
+    *result = _simsimd_cos_normalize_f32_neon(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SVE_F16
+
+#if SIMSIMD_TARGET_SVE_BF16
+#pragma GCC push_options
+#pragma GCC target("arch=armv8.2-a+sve+bf16")
+#pragma clang attribute push(__attribute__((target("arch=armv8.2-a+sve+bf16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_l2_bf16_sve(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    simsimd_l2sq_bf16_sve(a, b, n, result);
+    *result = _simsimd_sqrt_f32_neon(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_sve(simsimd_bf16_t const *a_enum, simsimd_bf16_t const *b_enum, simsimd_size_t n,
+                                          simsimd_distance_t *result) {
+    simsimd_size_t i = 0;
+    svfloat32_t d2_low_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    svfloat32_t d2_high_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    simsimd_u16_t const *a = (simsimd_u16_t const *)(a_enum);
+    simsimd_u16_t const *b = (simsimd_u16_t const *)(b_enum);
+    do {
+        svbool_t pg_vec = svwhilelt_b16((unsigned int)i, (unsigned int)n);
+        svuint16_t a_vec = svld1_u16(pg_vec, a + i);
+        svuint16_t b_vec = svld1_u16(pg_vec, b + i);
+
+        // There is no `bf16` subtraction in SVE, so we need to convert to `u32` and shift.
+        svbool_t pg_low_vec = svwhilelt_b32((unsigned int)(i), (unsigned int)n);
+        svbool_t pg_high_vec = svwhilelt_b32((unsigned int)(i + svcnth() / 2), (unsigned int)n);
+        svfloat32_t a_low_vec = svreinterpret_f32_u32(svlsl_n_u32_x(pg_low_vec, svunpklo_u32(a_vec), 16));
+        svfloat32_t a_high_vec = svreinterpret_f32_u32(svlsl_n_u32_x(pg_high_vec, svunpkhi_u32(a_vec), 16));
+        svfloat32_t b_low_vec = svreinterpret_f32_u32(svlsl_n_u32_x(pg_low_vec, svunpklo_u32(b_vec), 16));
+        svfloat32_t b_high_vec = svreinterpret_f32_u32(svlsl_n_u32_x(pg_high_vec, svunpkhi_u32(b_vec), 16));
+
+        svfloat32_t a_minus_b_low_vec = svsub_f32_x(pg_low_vec, a_low_vec, b_low_vec);
+        svfloat32_t a_minus_b_high_vec = svsub_f32_x(pg_high_vec, a_high_vec, b_high_vec);
+        d2_low_vec = svmla_f32_x(pg_vec, d2_low_vec, a_minus_b_low_vec, a_minus_b_low_vec);
+        d2_high_vec = svmla_f32_x(pg_vec, d2_high_vec, a_minus_b_low_vec, a_minus_b_low_vec);
+        i += svcnth();
+    } while (i < n);
+    simsimd_f32_t d2 = svaddv_f32(svptrue_b32(), d2_low_vec) + svaddv_f32(svptrue_b32(), d2_high_vec);
+    *result = d2;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_bf16_sve(simsimd_bf16_t const *a_enum, simsimd_bf16_t const *b_enum, simsimd_size_t n,
+                                         simsimd_distance_t *result) {
+    simsimd_size_t i = 0;
+    svfloat32_t ab_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    svfloat32_t a2_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    svfloat32_t b2_vec = svdupq_n_f32(0.f, 0.f, 0.f, 0.f);
+    simsimd_bf16_for_arm_simd_t const *a = (simsimd_bf16_for_arm_simd_t const *)(a_enum);
+    simsimd_bf16_for_arm_simd_t const *b = (simsimd_bf16_for_arm_simd_t const *)(b_enum);
+    do {
+        svbool_t pg_vec = svwhilelt_b16((unsigned int)i, (unsigned int)n);
+        svbfloat16_t a_vec = svld1_bf16(pg_vec, a + i);
+        svbfloat16_t b_vec = svld1_bf16(pg_vec, b + i);
+        ab_vec = svbfdot_f32(ab_vec, a_vec, b_vec);
+        a2_vec = svbfdot_f32(a2_vec, a_vec, a_vec);
+        b2_vec = svbfdot_f32(b2_vec, b_vec, b_vec);
+        i += svcnth();
+    } while (i < n);
+
+    simsimd_f32_t ab = svaddv_f32(svptrue_b32(), ab_vec);
+    simsimd_f32_t a2 = svaddv_f32(svptrue_b32(), a2_vec);
+    simsimd_f32_t b2 = svaddv_f32(svptrue_b32(), b2_vec);
+    *result = _simsimd_cos_normalize_f32_neon(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SVE_BF16
+#endif // _SIMSIMD_TARGET_ARM
+
+#if _SIMSIMD_TARGET_X86
+#if SIMSIMD_TARGET_HASWELL
+#pragma GCC push_options
+#pragma GCC target("avx2")
+#pragma clang attribute push(__attribute__((target("avx2"))), apply_to = function)
+
+SIMSIMD_INTERNAL simsimd_f32_t _simsimd_sqrt_f32_haswell(simsimd_f32_t x) {
+    return _mm_cvtss_f32(_mm_sqrt_ps(_mm_set_ss(x)));
+}
+SIMSIMD_INTERNAL simsimd_f64_t _simsimd_sqrt_f64_haswell(simsimd_f64_t x) {
+    return _mm_cvtsd_f64(_mm_sqrt_pd(_mm_set_sd(x)));
+}
+
+SIMSIMD_INTERNAL simsimd_distance_t _simsimd_cos_normalize_f64_haswell(simsimd_f64_t ab, simsimd_f64_t a2,
+                                                                       simsimd_f64_t b2) {
+
+    // If both vectors have magnitude 0, the distance is 0.
+    if (a2 == 0 && b2 == 0) return 0;
+    // If any one of the vectors is 0, the square root of the product is 0,
+    // the division is illformed, and the result is 1.
+    else if (ab == 0)
+        return 1;
+    // We want to avoid the `simsimd_approximate_inverse_square_root` due to high latency:
+    // https://web.archive.org/web/20210208132927/http://assemblyrequired.crashworks.org/timing-square-root/
+    // The latency of the native instruction is 4 cycles and it's broadly supported.
+    // For single-precision floats it has a maximum relative error of 1.5*2^-12.
+    // Higher precision isn't implemented on older CPUs. See `_simsimd_cos_normalize_f64_skylake` for that.
+    __m128d squares = _mm_set_pd(a2, b2);
+    __m128d rsqrts = _mm_cvtps_pd(_mm_rsqrt_ps(_mm_cvtpd_ps(squares)));
+    // Newton-Raphson iteration for reciprocal square root:
+    // https://en.wikipedia.org/wiki/Newton%27s_method
+    rsqrts = _mm_add_pd( //
+        _mm_mul_pd(_mm_set1_pd(1.5), rsqrts),
+        _mm_mul_pd(_mm_mul_pd(_mm_mul_pd(squares, _mm_set1_pd(-0.5)), rsqrts), _mm_mul_pd(rsqrts, rsqrts)));
+
+    simsimd_f64_t a2_reciprocal = _mm_cvtsd_f64(_mm_unpackhi_pd(rsqrts, rsqrts));
+    simsimd_f64_t b2_reciprocal = _mm_cvtsd_f64(rsqrts);
+    simsimd_distance_t result = 1 - ab * a2_reciprocal * b2_reciprocal;
+    return result > 0 ? result : 0;
+}
+
+SIMSIMD_INTERNAL simsimd_distance_t _simsimd_cos_normalize_f32_haswell(simsimd_f32_t ab, simsimd_f32_t a2,
+                                                                       simsimd_f32_t b2) {
+
+    // If both vectors have magnitude 0, the distance is 0.
+    if (a2 == 0.0f && b2 == 0.0f) return 0.0f;
+    // If any one of the vectors is 0, the square root of the product is 0,
+    // the division is illformed, and the result is 1.
+    else if (ab == 0.0f)
+        return 1.0f;
+
+    // Load the squares into an __m128 register for single-precision floating-point operations
+    __m128 squares = _mm_set_ps(a2, b2, a2, b2); // We replicate to make use of full register
+
+    // Compute the reciprocal square root of the squares using `_mm_rsqrt_ps` (single-precision)
+    __m128 rsqrts = _mm_rsqrt_ps(squares);
+
+    // Perform one iteration of Newton-Raphson refinement to improve the precision of rsqrt:
+    // Formula: y' = y * (1.5 - 0.5 * x * y * y)
+    __m128 half = _mm_set1_ps(0.5f);
+    __m128 three_halves = _mm_set1_ps(1.5f);
+    rsqrts =
+        _mm_mul_ps(rsqrts, _mm_sub_ps(three_halves, _mm_mul_ps(half, _mm_mul_ps(squares, _mm_mul_ps(rsqrts, rsqrts)))));
+
+    // Extract the reciprocal square roots of a2 and b2 from the __m128 register
+    simsimd_f32_t a2_reciprocal = _mm_cvtss_f32(_mm_shuffle_ps(rsqrts, rsqrts, _MM_SHUFFLE(0, 0, 0, 1)));
+    simsimd_f32_t b2_reciprocal = _mm_cvtss_f32(rsqrts);
+
+    // Calculate the cosine distance: 1 - ab * a2_reciprocal * b2_reciprocal
+    simsimd_distance_t result = 1.0f - ab * a2_reciprocal * b2_reciprocal;
+    return result > 0 ? result : 0;
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_HASWELL
+#endif // _SIMSIMD_TARGET_X86
+
+#if _SIMSIMD_TARGET_X86
+#if SIMSIMD_TARGET_HASWELL
+#pragma GCC push_options
+#pragma GCC target("avx2", "f16c", "fma")
+#pragma clang attribute push(__attribute__((target("avx2,f16c,fma"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_l2_f16_haswell(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    simsimd_l2sq_f16_haswell(a, b, n, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_haswell(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                             simsimd_distance_t *result) {
+    __m256 a_vec, b_vec;
+    __m256 d2_vec = _mm256_setzero_ps();
+
+simsimd_l2sq_f16_haswell_cycle:
+    if (n < 8) {
+        a_vec = _simsimd_partial_load_f16x8_haswell(a, n);
+        b_vec = _simsimd_partial_load_f16x8_haswell(b, n);
+        n = 0;
+    }
+    else {
+        a_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)a));
+        b_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)b));
+        n -= 8, a += 8, b += 8;
+    }
+    __m256 d_vec = _mm256_sub_ps(a_vec, b_vec);
+    d2_vec = _mm256_fmadd_ps(d_vec, d_vec, d2_vec);
+    if (n) goto simsimd_l2sq_f16_haswell_cycle;
+
+    *result = _simsimd_reduce_f32x8_haswell(d2_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f16_haswell(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+    __m256 a_vec, b_vec;
+    __m256 ab_vec = _mm256_setzero_ps(), a2_vec = _mm256_setzero_ps(), b2_vec = _mm256_setzero_ps();
+
+simsimd_cos_f16_haswell_cycle:
+    if (n < 8) {
+        a_vec = _simsimd_partial_load_f16x8_haswell(a, n);
+        b_vec = _simsimd_partial_load_f16x8_haswell(b, n);
+        n = 0;
+    }
+    else {
+        a_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)a));
+        b_vec = _mm256_cvtph_ps(_mm_lddqu_si128((__m128i const *)b));
+        n -= 8, a += 8, b += 8;
+    }
+    ab_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_vec);
+    a2_vec = _mm256_fmadd_ps(a_vec, a_vec, a2_vec);
+    b2_vec = _mm256_fmadd_ps(b_vec, b_vec, b2_vec);
+    if (n) goto simsimd_cos_f16_haswell_cycle;
+
+    simsimd_f32_t ab = _simsimd_reduce_f32x8_haswell(ab_vec);
+    simsimd_f32_t a2 = _simsimd_reduce_f32x8_haswell(a2_vec);
+    simsimd_f32_t b2 = _simsimd_reduce_f32x8_haswell(b2_vec);
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_bf16_haswell(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+    simsimd_l2sq_bf16_haswell(a, b, n, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_haswell(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                              simsimd_distance_t *result) {
+    __m256 a_vec, b_vec;
+    __m256 d2_vec = _mm256_setzero_ps();
+
+simsimd_l2sq_bf16_haswell_cycle:
+    if (n < 8) {
+        a_vec = _simsimd_bf16x8_to_f32x8_haswell(_simsimd_partial_load_bf16x8_haswell(a, n));
+        b_vec = _simsimd_bf16x8_to_f32x8_haswell(_simsimd_partial_load_bf16x8_haswell(b, n));
+        n = 0;
+    }
+    else {
+        a_vec = _simsimd_bf16x8_to_f32x8_haswell(_mm_lddqu_si128((__m128i const *)a));
+        b_vec = _simsimd_bf16x8_to_f32x8_haswell(_mm_lddqu_si128((__m128i const *)b));
+        n -= 8, a += 8, b += 8;
+    }
+    __m256 d_vec = _mm256_sub_ps(a_vec, b_vec);
+    d2_vec = _mm256_fmadd_ps(d_vec, d_vec, d2_vec);
+    if (n) goto simsimd_l2sq_bf16_haswell_cycle;
+
+    *result = _simsimd_reduce_f32x8_haswell(d2_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_bf16_haswell(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                             simsimd_distance_t *result) {
+    __m256 a_vec, b_vec;
+    __m256 ab_vec = _mm256_setzero_ps(), a2_vec = _mm256_setzero_ps(), b2_vec = _mm256_setzero_ps();
+
+simsimd_cos_bf16_haswell_cycle:
+    if (n < 8) {
+        a_vec = _simsimd_bf16x8_to_f32x8_haswell(_simsimd_partial_load_bf16x8_haswell(a, n));
+        b_vec = _simsimd_bf16x8_to_f32x8_haswell(_simsimd_partial_load_bf16x8_haswell(b, n));
+        n = 0;
+    }
+    else {
+        a_vec = _simsimd_bf16x8_to_f32x8_haswell(_mm_lddqu_si128((__m128i const *)a));
+        b_vec = _simsimd_bf16x8_to_f32x8_haswell(_mm_lddqu_si128((__m128i const *)b));
+        n -= 8, a += 8, b += 8;
+    }
+    ab_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_vec);
+    a2_vec = _mm256_fmadd_ps(a_vec, a_vec, a2_vec);
+    b2_vec = _mm256_fmadd_ps(b_vec, b_vec, b2_vec);
+    if (n) goto simsimd_cos_bf16_haswell_cycle;
+
+    simsimd_f32_t ab = _simsimd_reduce_f32x8_haswell(ab_vec);
+    simsimd_f32_t a2 = _simsimd_reduce_f32x8_haswell(a2_vec);
+    simsimd_f32_t b2 = _simsimd_reduce_f32x8_haswell(b2_vec);
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_i8_haswell(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                          simsimd_distance_t *result) {
+    simsimd_l2sq_i8_haswell(a, b, n, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_i8_haswell(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+
+    __m256i d2_i32_low_vec = _mm256_setzero_si256();
+    __m256i d2_i32_high_vec = _mm256_setzero_si256();
+
+    simsimd_size_t i = 0;
+    for (; i + 32 <= n; i += 32) {
+        __m256i a_i8_vec = _mm256_lddqu_si256((__m256i const *)(a + i));
+        __m256i b_i8_vec = _mm256_lddqu_si256((__m256i const *)(b + i));
+
+        // Sign extend `i8` to `i16`
+        __m256i a_i16_low_vec = _mm256_cvtepi8_epi16(_mm256_castsi256_si128(a_i8_vec));
+        __m256i a_i16_high_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(a_i8_vec, 1));
+        __m256i b_i16_low_vec = _mm256_cvtepi8_epi16(_mm256_castsi256_si128(b_i8_vec));
+        __m256i b_i16_high_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(b_i8_vec, 1));
+
+        // Subtract
+        // After this we will be squaring the values. The sign will be dropped
+        // and each difference will be in the range [0, 255].
+        __m256i d_i16_low_vec = _mm256_sub_epi16(a_i16_low_vec, b_i16_low_vec);
+        __m256i d_i16_high_vec = _mm256_sub_epi16(a_i16_high_vec, b_i16_high_vec);
+
+        // Accumulate into `i32` vectors
+        d2_i32_low_vec = _mm256_add_epi32(d2_i32_low_vec, _mm256_madd_epi16(d_i16_low_vec, d_i16_low_vec));
+        d2_i32_high_vec = _mm256_add_epi32(d2_i32_high_vec, _mm256_madd_epi16(d_i16_high_vec, d_i16_high_vec));
+    }
+
+    // Accumulate the 32-bit integers from `d2_i32_high_vec` and `d2_i32_low_vec`
+    int d2 = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(d2_i32_low_vec, d2_i32_high_vec));
+
+    // Take care of the tail:
+    for (; i < n; ++i) {
+        int n = (int)(a[i]) - b[i];
+        d2 += n * n;
+    }
+
+    *result = (simsimd_f64_t)d2;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_i8_haswell(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+
+    __m256i ab_i32_low_vec = _mm256_setzero_si256();
+    __m256i ab_i32_high_vec = _mm256_setzero_si256();
+    __m256i a2_i32_low_vec = _mm256_setzero_si256();
+    __m256i a2_i32_high_vec = _mm256_setzero_si256();
+    __m256i b2_i32_low_vec = _mm256_setzero_si256();
+    __m256i b2_i32_high_vec = _mm256_setzero_si256();
+
+    // AVX2 has no instructions for 8-bit signed integer dot-products,
+    // but it has a weird instruction for mixed signed-unsigned 8-bit dot-product.
+    // So we need to normalize the first vector to its absolute value,
+    // and shift the product sign into the second vector.
+    //
+    //      __m256i a_i8_abs_vec = _mm256_abs_epi8(a_i8_vec);
+    //      __m256i b_i8_flipped_vec = _mm256_sign_epi8(b_i8_vec, a_i8_vec);
+    //      __m256i ab_i16_vec = _mm256_maddubs_epi16(a_i8_abs_vec, b_i8_flipped_vec);
+    //
+    // The problem with this approach, however, is the `-128` value in the second vector.
+    // Flipping it's sign will do nothing, and the result will be incorrect.
+    // This can easily lead to noticeable numerical errors in the final result.
+    simsimd_size_t i = 0;
+    for (; i + 32 <= n; i += 32) {
+        __m256i a_i8_vec = _mm256_lddqu_si256((__m256i const *)(a + i));
+        __m256i b_i8_vec = _mm256_lddqu_si256((__m256i const *)(b + i));
+
+        // Unpack `int8` to `int16`
+        __m256i a_i16_low_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(a_i8_vec, 0));
+        __m256i a_i16_high_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(a_i8_vec, 1));
+        __m256i b_i16_low_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(b_i8_vec, 0));
+        __m256i b_i16_high_vec = _mm256_cvtepi8_epi16(_mm256_extracti128_si256(b_i8_vec, 1));
+
+        // Multiply and accumulate as `int16`, accumulate products as `int32`:
+        ab_i32_low_vec = _mm256_add_epi32(ab_i32_low_vec, _mm256_madd_epi16(a_i16_low_vec, b_i16_low_vec));
+        ab_i32_high_vec = _mm256_add_epi32(ab_i32_high_vec, _mm256_madd_epi16(a_i16_high_vec, b_i16_high_vec));
+        a2_i32_low_vec = _mm256_add_epi32(a2_i32_low_vec, _mm256_madd_epi16(a_i16_low_vec, a_i16_low_vec));
+        a2_i32_high_vec = _mm256_add_epi32(a2_i32_high_vec, _mm256_madd_epi16(a_i16_high_vec, a_i16_high_vec));
+        b2_i32_low_vec = _mm256_add_epi32(b2_i32_low_vec, _mm256_madd_epi16(b_i16_low_vec, b_i16_low_vec));
+        b2_i32_high_vec = _mm256_add_epi32(b2_i32_high_vec, _mm256_madd_epi16(b_i16_high_vec, b_i16_high_vec));
+    }
+
+    // Further reduce to a single sum for each vector
+    int ab = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(ab_i32_low_vec, ab_i32_high_vec));
+    int a2 = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(a2_i32_low_vec, a2_i32_high_vec));
+    int b2 = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(b2_i32_low_vec, b2_i32_high_vec));
+
+    // Take care of the tail:
+    for (; i < n; ++i) {
+        int ai = a[i], bi = b[i];
+        ab += ai * bi, a2 += ai * ai, b2 += bi * bi;
+    }
+
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_u8_haswell(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                          simsimd_distance_t *result) {
+    simsimd_l2sq_u8_haswell(a, b, n, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_u8_haswell(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+
+    __m256i d2_i32_low_vec = _mm256_setzero_si256();
+    __m256i d2_i32_high_vec = _mm256_setzero_si256();
+    __m256i const zeros_vec = _mm256_setzero_si256();
+
+    simsimd_size_t i = 0;
+    for (; i + 32 <= n; i += 32) {
+        __m256i a_u8_vec = _mm256_lddqu_si256((__m256i const *)(a + i));
+        __m256i b_u8_vec = _mm256_lddqu_si256((__m256i const *)(b + i));
+
+        // Substracting unsigned vectors in AVX2 is done by saturating subtraction:
+        __m256i d_u8_vec = _mm256_or_si256(_mm256_subs_epu8(a_u8_vec, b_u8_vec), _mm256_subs_epu8(b_u8_vec, a_u8_vec));
+
+        // Upcast `uint8` to `int16`. Unlike the signed version, we can use the unpacking
+        // instructions instead of extracts, as they are much faster and more efficient.
+        __m256i d_i16_low_vec = _mm256_unpacklo_epi8(d_u8_vec, zeros_vec);
+        __m256i d_i16_high_vec = _mm256_unpackhi_epi8(d_u8_vec, zeros_vec);
+
+        // Multiply and accumulate at `int16` level, accumulate at `int32` level:
+        d2_i32_low_vec = _mm256_add_epi32(d2_i32_low_vec, _mm256_madd_epi16(d_i16_low_vec, d_i16_low_vec));
+        d2_i32_high_vec = _mm256_add_epi32(d2_i32_high_vec, _mm256_madd_epi16(d_i16_high_vec, d_i16_high_vec));
+    }
+
+    // Accumulate the 32-bit integers from `d2_i32_high_vec` and `d2_i32_low_vec`
+    int d2 = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(d2_i32_low_vec, d2_i32_high_vec));
+
+    // Take care of the tail:
+    for (; i < n; ++i) {
+        int n = (int)(a[i]) - b[i];
+        d2 += n * n;
+    }
+
+    *result = (simsimd_f64_t)d2;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_u8_haswell(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+
+    __m256i ab_i32_low_vec = _mm256_setzero_si256();
+    __m256i ab_i32_high_vec = _mm256_setzero_si256();
+    __m256i a2_i32_low_vec = _mm256_setzero_si256();
+    __m256i a2_i32_high_vec = _mm256_setzero_si256();
+    __m256i b2_i32_low_vec = _mm256_setzero_si256();
+    __m256i b2_i32_high_vec = _mm256_setzero_si256();
+    __m256i const zeros_vec = _mm256_setzero_si256();
+
+    // AVX2 has no instructions for 8-bit signed integer dot-products,
+    // but it has a weird instruction for mixed signed-unsigned 8-bit dot-product.
+    // So we need to normalize the first vector to its absolute value,
+    // and shift the product sign into the second vector.
+    //
+    //      __m256i a_i8_abs_vec = _mm256_abs_epi8(a_i8_vec);
+    //      __m256i b_i8_flipped_vec = _mm256_sign_epi8(b_i8_vec, a_i8_vec);
+    //      __m256i ab_i16_vec = _mm256_maddubs_epi16(a_i8_abs_vec, b_i8_flipped_vec);
+    //
+    // The problem with this approach, however, is the `-128` value in the second vector.
+    // Flipping it's sign will do nothing, and the result will be incorrect.
+    // This can easily lead to noticeable numerical errors in the final result.
+    simsimd_size_t i = 0;
+    for (; i + 32 <= n; i += 32) {
+        __m256i a_u8_vec = _mm256_lddqu_si256((__m256i const *)(a + i));
+        __m256i b_u8_vec = _mm256_lddqu_si256((__m256i const *)(b + i));
+
+        // Upcast `uint8` to `int16`. Unlike the signed version, we can use the unpacking
+        // instructions instead of extracts, as they are much faster and more efficient.
+        __m256i a_i16_low_vec = _mm256_unpacklo_epi8(a_u8_vec, zeros_vec);
+        __m256i a_i16_high_vec = _mm256_unpackhi_epi8(a_u8_vec, zeros_vec);
+        __m256i b_i16_low_vec = _mm256_unpacklo_epi8(b_u8_vec, zeros_vec);
+        __m256i b_i16_high_vec = _mm256_unpackhi_epi8(b_u8_vec, zeros_vec);
+
+        // Multiply and accumulate as `int16`, accumulate products as `int32`
+        ab_i32_low_vec = _mm256_add_epi32(ab_i32_low_vec, _mm256_madd_epi16(a_i16_low_vec, b_i16_low_vec));
+        ab_i32_high_vec = _mm256_add_epi32(ab_i32_high_vec, _mm256_madd_epi16(a_i16_high_vec, b_i16_high_vec));
+        a2_i32_low_vec = _mm256_add_epi32(a2_i32_low_vec, _mm256_madd_epi16(a_i16_low_vec, a_i16_low_vec));
+        a2_i32_high_vec = _mm256_add_epi32(a2_i32_high_vec, _mm256_madd_epi16(a_i16_high_vec, a_i16_high_vec));
+        b2_i32_low_vec = _mm256_add_epi32(b2_i32_low_vec, _mm256_madd_epi16(b_i16_low_vec, b_i16_low_vec));
+        b2_i32_high_vec = _mm256_add_epi32(b2_i32_high_vec, _mm256_madd_epi16(b_i16_high_vec, b_i16_high_vec));
+    }
+
+    // Further reduce to a single sum for each vector
+    int ab = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(ab_i32_low_vec, ab_i32_high_vec));
+    int a2 = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(a2_i32_low_vec, a2_i32_high_vec));
+    int b2 = _simsimd_reduce_i32x8_haswell(_mm256_add_epi32(b2_i32_low_vec, b2_i32_high_vec));
+
+    // Take care of the tail:
+    for (; i < n; ++i) {
+        int ai = a[i], bi = b[i];
+        ab += ai * bi, a2 += ai * ai, b2 += bi * bi;
+    }
+
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_f32_haswell(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    simsimd_l2sq_f32_haswell(a, b, n, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_haswell(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                             simsimd_distance_t *result) {
+
+    __m256 d2_vec = _mm256_setzero_ps();
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m256 a_vec = _mm256_loadu_ps(a + i);
+        __m256 b_vec = _mm256_loadu_ps(b + i);
+        __m256 d_vec = _mm256_sub_ps(a_vec, b_vec);
+        d2_vec = _mm256_fmadd_ps(d_vec, d_vec, d2_vec);
+    }
+
+    simsimd_f64_t d2 = _simsimd_reduce_f32x8_haswell(d2_vec);
+    for (; i < n; ++i) {
+        float d = a[i] - b[i];
+        d2 += d * d;
+    }
+
+    *result = d2;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f32_haswell(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+
+    __m256 ab_vec = _mm256_setzero_ps();
+    __m256 a2_vec = _mm256_setzero_ps();
+    __m256 b2_vec = _mm256_setzero_ps();
+    simsimd_size_t i = 0;
+    for (; i + 8 <= n; i += 8) {
+        __m256 a_vec = _mm256_loadu_ps(a + i);
+        __m256 b_vec = _mm256_loadu_ps(b + i);
+        ab_vec = _mm256_fmadd_ps(a_vec, b_vec, ab_vec);
+        a2_vec = _mm256_fmadd_ps(a_vec, a_vec, a2_vec);
+        b2_vec = _mm256_fmadd_ps(b_vec, b_vec, b2_vec);
+    }
+
+    simsimd_f64_t ab = _simsimd_reduce_f32x8_haswell(ab_vec);
+    simsimd_f64_t a2 = _simsimd_reduce_f32x8_haswell(a2_vec);
+    simsimd_f64_t b2 = _simsimd_reduce_f32x8_haswell(b2_vec);
+    for (; i < n; ++i) {
+        float ai = a[i], bi = b[i];
+        ab += ai * bi, a2 += ai * ai, b2 += bi * bi;
+    }
+    *result = _simsimd_cos_normalize_f64_haswell(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_f64_haswell(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    simsimd_l2sq_f64_haswell(a, b, n, result);
+    *result = _simsimd_sqrt_f64_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f64_haswell(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                             simsimd_distance_t *result) {
+
+    __m256d d2_vec = _mm256_setzero_pd();
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        __m256d a_vec = _mm256_loadu_pd(a + i);
+        __m256d b_vec = _mm256_loadu_pd(b + i);
+        __m256d d_vec = _mm256_sub_pd(a_vec, b_vec);
+        d2_vec = _mm256_fmadd_pd(d_vec, d_vec, d2_vec);
+    }
+
+    simsimd_f64_t d2 = _simsimd_reduce_f64x4_haswell(d2_vec);
+    for (; i < n; ++i) {
+        simsimd_f64_t d = a[i] - b[i];
+        d2 += d * d;
+    }
+
+    *result = d2;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f64_haswell(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+
+    __m256d ab_vec = _mm256_setzero_pd();
+    __m256d a2_vec = _mm256_setzero_pd();
+    __m256d b2_vec = _mm256_setzero_pd();
+    simsimd_size_t i = 0;
+    for (; i + 4 <= n; i += 4) {
+        __m256d a_vec = _mm256_loadu_pd(a + i);
+        __m256d b_vec = _mm256_loadu_pd(b + i);
+        ab_vec = _mm256_fmadd_pd(a_vec, b_vec, ab_vec);
+        a2_vec = _mm256_fmadd_pd(a_vec, a_vec, a2_vec);
+        b2_vec = _mm256_fmadd_pd(b_vec, b_vec, b2_vec);
+    }
+
+    simsimd_f64_t ab = _simsimd_reduce_f64x4_haswell(ab_vec);
+    simsimd_f64_t a2 = _simsimd_reduce_f64x4_haswell(a2_vec);
+    simsimd_f64_t b2 = _simsimd_reduce_f64x4_haswell(b2_vec);
+    for (; i < n; ++i) {
+        simsimd_f64_t ai = a[i], bi = b[i];
+        ab += ai * bi, a2 += ai * ai, b2 += bi * bi;
+    }
+    *result = _simsimd_cos_normalize_f64_haswell(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_HASWELL
+
+#if SIMSIMD_TARGET_SKYLAKE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512bw", "avx512vl", "bmi2")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512bw,avx512vl,bmi2"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_l2_f32_skylake(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    simsimd_l2sq_f32_skylake(a, b, n, result);
+    *result = _simsimd_sqrt_f64_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f32_skylake(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                             simsimd_distance_t *result) {
+    __m512 d2_vec = _mm512_setzero();
+    __m512 a_vec, b_vec;
+
+simsimd_l2sq_f32_skylake_cycle:
+    if (n < 16) {
+        __mmask16 mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_ps(mask, a);
+        b_vec = _mm512_maskz_loadu_ps(mask, b);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps(a);
+        b_vec = _mm512_loadu_ps(b);
+        a += 16, b += 16, n -= 16;
+    }
+    __m512 d_vec = _mm512_sub_ps(a_vec, b_vec);
+    d2_vec = _mm512_fmadd_ps(d_vec, d_vec, d2_vec);
+    if (n) goto simsimd_l2sq_f32_skylake_cycle;
+
+    *result = _simsimd_reduce_f32x16_skylake(d2_vec);
+}
+
+SIMSIMD_INTERNAL simsimd_distance_t _simsimd_cos_normalize_f64_skylake(simsimd_f64_t ab, simsimd_f64_t a2,
+                                                                       simsimd_f64_t b2) {
+
+    // If both vectors have magnitude 0, the distance is 0.
+    if (a2 == 0 && b2 == 0) return 0;
+    // If any one of the vectors is 0, the square root of the product is 0,
+    // the division is illformed, and the result is 1.
+    else if (ab == 0)
+        return 1;
+
+    // We want to avoid the `simsimd_approximate_inverse_square_root` due to high latency:
+    // https://web.archive.org/web/20210208132927/http://assemblyrequired.crashworks.org/timing-square-root/
+    // The maximum relative error for this approximation is less than 2^-14, which is 6x lower than
+    // for single-precision floats in the `_simsimd_cos_normalize_f64_haswell` implementation.
+    // Mysteriously, MSVC has no `_mm_rsqrt14_pd` intrinsic, but has it's masked variants,
+    // so let's use `_mm_maskz_rsqrt14_pd(0xFF, ...)` instead.
+    __m128d squares = _mm_set_pd(a2, b2);
+    __m128d rsqrts = _mm_maskz_rsqrt14_pd(0xFF, squares);
+
+    // Let's implement a single Newton-Raphson iteration to refine the result.
+    // This is how it affects downstream applications:
+    //
+    // +--------+------+----------+---------------------+---------------------+---------------------+
+    // | Metric | NDim |  DType   |   Baseline Error    |  Old SimSIMD Error  |  New SimSIMD Error  |
+    // +--------+------+----------+---------------------+---------------------+---------------------+
+    // | cosine | 1536 | bfloat16 | 1.89e-08 ± 1.59e-08 | 3.07e-07 ± 3.09e-07 | 3.53e-09 ± 2.70e-09 |
+    // | cosine | 1536 | float16  | 1.67e-02 ± 1.44e-02 | 2.68e-05 ± 1.95e-05 | 2.02e-05 ± 1.39e-05 |
+    // | cosine | 1536 | float32  | 2.21e-08 ± 1.65e-08 | 3.47e-07 ± 3.49e-07 | 3.77e-09 ± 2.84e-09 |
+    // | cosine | 1536 | float64  | 0.00e+00 ± 0.00e+00 | 3.80e-07 ± 4.50e-07 | 1.35e-11 ± 1.85e-11 |
+    // | cosine | 1536 |   int8   | 0.00e+00 ± 0.00e+00 | 4.60e-04 ± 3.36e-04 | 4.20e-04 ± 4.88e-04 |
+    // +--------+------+----------+---------------------+---------------------+---------------------+
+    //
+    // https://en.wikipedia.org/wiki/Newton%27s_method
+    rsqrts = _mm_add_pd( //
+        _mm_mul_pd(_mm_set1_pd(1.5), rsqrts),
+        _mm_mul_pd(_mm_mul_pd(_mm_mul_pd(squares, _mm_set1_pd(-0.5)), rsqrts), _mm_mul_pd(rsqrts, rsqrts)));
+
+    simsimd_f64_t a2_reciprocal = _mm_cvtsd_f64(_mm_unpackhi_pd(rsqrts, rsqrts));
+    simsimd_f64_t b2_reciprocal = _mm_cvtsd_f64(rsqrts);
+    simsimd_distance_t result = 1 - ab * a2_reciprocal * b2_reciprocal;
+    return result > 0 ? result : 0;
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f32_skylake(simsimd_f32_t const *a, simsimd_f32_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+    __m512 ab_vec = _mm512_setzero();
+    __m512 a2_vec = _mm512_setzero();
+    __m512 b2_vec = _mm512_setzero();
+    __m512 a_vec, b_vec;
+
+simsimd_cos_f32_skylake_cycle:
+    if (n < 16) {
+        __mmask16 mask = (__mmask16)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_ps(mask, a);
+        b_vec = _mm512_maskz_loadu_ps(mask, b);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_ps(a);
+        b_vec = _mm512_loadu_ps(b);
+        a += 16, b += 16, n -= 16;
+    }
+    ab_vec = _mm512_fmadd_ps(a_vec, b_vec, ab_vec);
+    a2_vec = _mm512_fmadd_ps(a_vec, a_vec, a2_vec);
+    b2_vec = _mm512_fmadd_ps(b_vec, b_vec, b2_vec);
+    if (n) goto simsimd_cos_f32_skylake_cycle;
+
+    simsimd_f64_t ab = _simsimd_reduce_f32x16_skylake(ab_vec);
+    simsimd_f64_t a2 = _simsimd_reduce_f32x16_skylake(a2_vec);
+    simsimd_f64_t b2 = _simsimd_reduce_f32x16_skylake(b2_vec);
+    *result = _simsimd_cos_normalize_f64_skylake(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_f64_skylake(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    simsimd_l2sq_f64_skylake(a, b, n, result);
+    *result = _simsimd_sqrt_f64_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f64_skylake(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                             simsimd_distance_t *result) {
+    __m512d d2_vec = _mm512_setzero_pd();
+    __m512d a_vec, b_vec;
+
+simsimd_l2sq_f64_skylake_cycle:
+    if (n < 8) {
+        __mmask8 mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_pd(mask, a);
+        b_vec = _mm512_maskz_loadu_pd(mask, b);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_pd(a);
+        b_vec = _mm512_loadu_pd(b);
+        a += 8, b += 8, n -= 8;
+    }
+    __m512d d_vec = _mm512_sub_pd(a_vec, b_vec);
+    d2_vec = _mm512_fmadd_pd(d_vec, d_vec, d2_vec);
+    if (n) goto simsimd_l2sq_f64_skylake_cycle;
+
+    *result = _mm512_reduce_add_pd(d2_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f64_skylake(simsimd_f64_t const *a, simsimd_f64_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+    __m512d ab_vec = _mm512_setzero_pd();
+    __m512d a2_vec = _mm512_setzero_pd();
+    __m512d b2_vec = _mm512_setzero_pd();
+    __m512d a_vec, b_vec;
+
+simsimd_cos_f64_skylake_cycle:
+    if (n < 8) {
+        __mmask8 mask = (__mmask8)_bzhi_u32(0xFFFFFFFF, n);
+        a_vec = _mm512_maskz_loadu_pd(mask, a);
+        b_vec = _mm512_maskz_loadu_pd(mask, b);
+        n = 0;
+    }
+    else {
+        a_vec = _mm512_loadu_pd(a);
+        b_vec = _mm512_loadu_pd(b);
+        a += 8, b += 8, n -= 8;
+    }
+    ab_vec = _mm512_fmadd_pd(a_vec, b_vec, ab_vec);
+    a2_vec = _mm512_fmadd_pd(a_vec, a_vec, a2_vec);
+    b2_vec = _mm512_fmadd_pd(b_vec, b_vec, b2_vec);
+    if (n) goto simsimd_cos_f64_skylake_cycle;
+
+    simsimd_f64_t ab = _mm512_reduce_add_pd(ab_vec);
+    simsimd_f64_t a2 = _mm512_reduce_add_pd(a2_vec);
+    simsimd_f64_t b2 = _mm512_reduce_add_pd(b2_vec);
+    *result = _simsimd_cos_normalize_f64_skylake(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SKYLAKE
+
+#if SIMSIMD_TARGET_GENOA
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512bw", "avx512bf16")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512bw,avx512bf16"))), \
+                             apply_to = function)
+
+SIMSIMD_INTERNAL __m512i _simsimd_substract_bf16x32_genoa(__m512i a_i16, __m512i b_i16) {
+
+    union {
+        __m512 fvec;
+        __m512i ivec;
+        simsimd_f32_t f32[16];
+        simsimd_u16_t u16[32];
+        simsimd_bf16_t bf16[32];
+    } d_odd, d_even, d, a_f32_even, b_f32_even, d_f32_even, a_f32_odd, b_f32_odd, d_f32_odd, a, b;
+    a.ivec = a_i16;
+    b.ivec = b_i16;
+
+    // There are several approaches to perform subtraction in `bf16`. The first one is:
+    //
+    //      Perform a couple of casts - each is a bitshift. To convert `bf16` to `f32`,
+    //      expand it to 32-bit integers, then shift the bits by 16 to the left.
+    //      Then subtract as floats, and shift back. During expansion, we will double the space,
+    //      and should use separate registers for top and bottom halves.
+    //      Some compilers don't have `_mm512_extracti32x8_epi32`, so we use `_mm512_extracti64x4_epi64`:
+    //
+    //          a_f32_bot.fvec = _mm512_castsi512_ps(_mm512_slli_epi32(
+    //              _mm512_cvtepu16_epi32(_mm512_castsi512_si256(a_i16)), 16));
+    //          b_f32_bot.fvec = _mm512_castsi512_ps(_mm512_slli_epi32(
+    //              _mm512_cvtepu16_epi32(_mm512_castsi512_si256(b_i16)), 16));
+    //          a_f32_top.fvec =_mm512_castsi512_ps(
+    //              _mm512_slli_epi32(_mm512_cvtepu16_epi32(_mm512_extracti64x4_epi64(a_i16, 1)), 16));
+    //          b_f32_top.fvec =_mm512_castsi512_ps(
+    //              _mm512_slli_epi32(_mm512_cvtepu16_epi32(_mm512_extracti64x4_epi64(b_i16, 1)), 16));
+    //          d_f32_top.fvec = _mm512_sub_ps(a_f32_top.fvec, b_f32_top.fvec);
+    //          d_f32_bot.fvec = _mm512_sub_ps(a_f32_bot.fvec, b_f32_bot.fvec);
+    //          d.ivec = _mm512_castsi256_si512(_mm512_cvtepi32_epi16(
+    //              _mm512_srli_epi32(_mm512_castps_si512(d_f32_bot.fvec), 16)));
+    //          d.ivec = _mm512_inserti64x4(d.ivec, _mm512_cvtepi32_epi16(
+    //              _mm512_srli_epi32(_mm512_castps_si512(d_f32_top.fvec), 16)), 1);
+    //
+    // Instead of using multple shifts and an insertion, we can achieve similar result with fewer expensive
+    // calls to `_mm512_permutex2var_epi16`, or a cheap `_mm512_mask_shuffle_epi8` and blend:
+    //
+    a_f32_odd.ivec = _mm512_and_si512(a_i16, _mm512_set1_epi32(0xFFFF0000));
+    a_f32_even.ivec = _mm512_slli_epi32(a_i16, 16);
+    b_f32_odd.ivec = _mm512_and_si512(b_i16, _mm512_set1_epi32(0xFFFF0000));
+    b_f32_even.ivec = _mm512_slli_epi32(b_i16, 16);
+
+    d_f32_odd.fvec = _mm512_sub_ps(a_f32_odd.fvec, b_f32_odd.fvec);
+    d_f32_even.fvec = _mm512_sub_ps(a_f32_even.fvec, b_f32_even.fvec);
+
+    d_f32_even.ivec = _mm512_srli_epi32(d_f32_even.ivec, 16);
+    d.ivec = _mm512_mask_blend_epi16(0x55555555, d_f32_odd.ivec, d_f32_even.ivec);
+
+    return d.ivec;
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_bf16_genoa(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                          simsimd_distance_t *result) {
+    simsimd_l2sq_bf16_genoa(a, b, n, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_bf16_genoa(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+    __m512 d2_vec = _mm512_setzero_ps();
+    __m512i a_i16_vec, b_i16_vec, d_i16_vec;
+
+simsimd_l2sq_bf16_genoa_cycle:
+    if (n < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_i16_vec = _mm512_maskz_loadu_epi16(mask, a);
+        b_i16_vec = _mm512_maskz_loadu_epi16(mask, b);
+        n = 0;
+    }
+    else {
+        a_i16_vec = _mm512_loadu_epi16(a);
+        b_i16_vec = _mm512_loadu_epi16(b);
+        a += 32, b += 32, n -= 32;
+    }
+    d_i16_vec = _simsimd_substract_bf16x32_genoa(a_i16_vec, b_i16_vec);
+    d2_vec = _mm512_dpbf16_ps(d2_vec, (__m512bh)(d_i16_vec), (__m512bh)(d_i16_vec));
+    if (n) goto simsimd_l2sq_bf16_genoa_cycle;
+
+    *result = _simsimd_reduce_f32x16_skylake(d2_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_bf16_genoa(simsimd_bf16_t const *a, simsimd_bf16_t const *b, simsimd_size_t n,
+                                           simsimd_distance_t *result) {
+    __m512 ab_vec = _mm512_setzero_ps();
+    __m512 a2_vec = _mm512_setzero_ps();
+    __m512 b2_vec = _mm512_setzero_ps();
+    __m512i a_i16_vec, b_i16_vec;
+
+simsimd_cos_bf16_genoa_cycle:
+    if (n < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_i16_vec = _mm512_maskz_loadu_epi16(mask, a);
+        b_i16_vec = _mm512_maskz_loadu_epi16(mask, b);
+        n = 0;
+    }
+    else {
+        a_i16_vec = _mm512_loadu_epi16(a);
+        b_i16_vec = _mm512_loadu_epi16(b);
+        a += 32, b += 32, n -= 32;
+    }
+    ab_vec = _mm512_dpbf16_ps(ab_vec, (__m512bh)(a_i16_vec), (__m512bh)(b_i16_vec));
+    a2_vec = _mm512_dpbf16_ps(a2_vec, (__m512bh)(a_i16_vec), (__m512bh)(a_i16_vec));
+    b2_vec = _mm512_dpbf16_ps(b2_vec, (__m512bh)(b_i16_vec), (__m512bh)(b_i16_vec));
+    if (n) goto simsimd_cos_bf16_genoa_cycle;
+
+    simsimd_f32_t ab = _simsimd_reduce_f32x16_skylake(ab_vec);
+    simsimd_f32_t a2 = _simsimd_reduce_f32x16_skylake(a2_vec);
+    simsimd_f32_t b2 = _simsimd_reduce_f32x16_skylake(b2_vec);
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_GENOA
+
+#if SIMSIMD_TARGET_SAPPHIRE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512fp16")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512fp16"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_l2_f16_sapphire(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                            simsimd_distance_t *result) {
+    simsimd_l2sq_f16_sapphire(a, b, n, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_f16_sapphire(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                              simsimd_distance_t *result) {
+    __m512h d2_vec = _mm512_setzero_ph();
+    __m512i a_i16_vec, b_i16_vec;
+
+simsimd_l2sq_f16_sapphire_cycle:
+    if (n < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_i16_vec = _mm512_maskz_loadu_epi16(mask, a);
+        b_i16_vec = _mm512_maskz_loadu_epi16(mask, b);
+        n = 0;
+    }
+    else {
+        a_i16_vec = _mm512_loadu_epi16(a);
+        b_i16_vec = _mm512_loadu_epi16(b);
+        a += 32, b += 32, n -= 32;
+    }
+    __m512h d_vec = _mm512_sub_ph(_mm512_castsi512_ph(a_i16_vec), _mm512_castsi512_ph(b_i16_vec));
+    d2_vec = _mm512_fmadd_ph(d_vec, d_vec, d2_vec);
+    if (n) goto simsimd_l2sq_f16_sapphire_cycle;
+
+    *result = _mm512_reduce_add_ph(d2_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_f16_sapphire(simsimd_f16_t const *a, simsimd_f16_t const *b, simsimd_size_t n,
+                                             simsimd_distance_t *result) {
+    __m512h ab_vec = _mm512_setzero_ph();
+    __m512h a2_vec = _mm512_setzero_ph();
+    __m512h b2_vec = _mm512_setzero_ph();
+    __m512i a_i16_vec, b_i16_vec;
+
+simsimd_cos_f16_sapphire_cycle:
+    if (n < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_i16_vec = _mm512_maskz_loadu_epi16(mask, a);
+        b_i16_vec = _mm512_maskz_loadu_epi16(mask, b);
+        n = 0;
+    }
+    else {
+        a_i16_vec = _mm512_loadu_epi16(a);
+        b_i16_vec = _mm512_loadu_epi16(b);
+        a += 32, b += 32, n -= 32;
+    }
+    ab_vec = _mm512_fmadd_ph(_mm512_castsi512_ph(a_i16_vec), _mm512_castsi512_ph(b_i16_vec), ab_vec);
+    a2_vec = _mm512_fmadd_ph(_mm512_castsi512_ph(a_i16_vec), _mm512_castsi512_ph(a_i16_vec), a2_vec);
+    b2_vec = _mm512_fmadd_ph(_mm512_castsi512_ph(b_i16_vec), _mm512_castsi512_ph(b_i16_vec), b2_vec);
+    if (n) goto simsimd_cos_f16_sapphire_cycle;
+
+    simsimd_f32_t ab = _mm512_reduce_add_ph(ab_vec);
+    simsimd_f32_t a2 = _mm512_reduce_add_ph(a2_vec);
+    simsimd_f32_t b2 = _mm512_reduce_add_ph(b2_vec);
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SAPPHIRE
+
+#if SIMSIMD_TARGET_ICE
+#pragma GCC push_options
+#pragma GCC target("avx2", "avx512f", "avx512vl", "bmi2", "avx512bw", "avx512vnni")
+#pragma clang attribute push(__attribute__((target("avx2,avx512f,avx512vl,bmi2,avx512bw,avx512vnni"))), \
+                             apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_l2_i8_ice(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *result) {
+    simsimd_l2sq_i8_ice(a, b, n, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_i8_ice(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    __m512i d2_i32_vec = _mm512_setzero_si512();
+    __m512i a_i16_vec, b_i16_vec, d_i16s_vec;
+
+simsimd_l2sq_i8_ice_cycle:
+    if (n < 32) { // TODO: Avoid eaarly i16 upcast to step through 64 values at a time
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_i16_vec = _mm512_cvtepi8_epi16(_mm256_maskz_loadu_epi8(mask, a));
+        b_i16_vec = _mm512_cvtepi8_epi16(_mm256_maskz_loadu_epi8(mask, b));
+        n = 0;
+    }
+    else {
+        a_i16_vec = _mm512_cvtepi8_epi16(_mm256_lddqu_si256((__m256i const *)a));
+        b_i16_vec = _mm512_cvtepi8_epi16(_mm256_lddqu_si256((__m256i const *)b));
+        a += 32, b += 32, n -= 32;
+    }
+    d_i16s_vec = _mm512_sub_epi16(a_i16_vec, b_i16_vec);
+    d2_i32_vec = _mm512_dpwssd_epi32(d2_i32_vec, d_i16s_vec, d_i16s_vec);
+    if (n) goto simsimd_l2sq_i8_ice_cycle;
+
+    *result = _mm512_reduce_add_epi32(d2_i32_vec);
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_i8_ice(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *result) {
+
+    __m512i ab_i32_vec = _mm512_setzero_si512();
+    __m512i a2_i32_vec = _mm512_setzero_si512();
+    __m512i b2_i32_vec = _mm512_setzero_si512();
+    __m512i a_i16_vec, b_i16_vec;
+simsimd_cos_i8_ice_cycle:
+    if (n < 32) {
+        __mmask32 mask = (__mmask32)_bzhi_u32(0xFFFFFFFF, n);
+        a_i16_vec = _mm512_cvtepi8_epi16(_mm256_maskz_loadu_epi8(mask, a));
+        b_i16_vec = _mm512_cvtepi8_epi16(_mm256_maskz_loadu_epi8(mask, b));
+        n = 0;
+    }
+    else {
+        a_i16_vec = _mm512_cvtepi8_epi16(_mm256_lddqu_si256((__m256i const *)a));
+        b_i16_vec = _mm512_cvtepi8_epi16(_mm256_lddqu_si256((__m256i const *)b));
+        a += 32, b += 32, n -= 32;
+    }
+
+    // We can't directly use the `_mm512_dpbusd_epi32` intrinsic everywhere,
+    // as it's asymmetric with respect to the sign of the input arguments:
+    //
+    //      Signed(ZeroExtend16(a.byte[4*j]) * SignExtend16(b.byte[4*j]))
+    //
+    // To compute the squares, we could just drop the sign bit of the second argument.
+    // But this would lead to big-big problems on values like `-128`!
+    // For dot-products we don't have the luxury of optimizing the sign bit away.
+    // Assuming this is an approximate kernel (with reciprocal square root approximations)
+    // in the end, we can allow clamping the value to [-127, 127] range.
+    //
+    // On Ice Lake:
+    //
+    //  1. `VPDPBUSDS (ZMM, ZMM, ZMM)` can only execute on port 0, with 5 cycle latency.
+    //  2. `VPDPWSSDS (ZMM, ZMM, ZMM)` can also only execute on port 0, with 5 cycle latency.
+    //  3. `VPMADDWD (ZMM, ZMM, ZMM)` can execute on ports 0 and 5, with 5 cycle latency.
+    //
+    // On Zen4 Genoa:
+    //
+    //  1. `VPDPBUSDS (ZMM, ZMM, ZMM)` can execute on ports 0 and 1, with 4 cycle latency.
+    //  2. `VPDPWSSDS (ZMM, ZMM, ZMM)` can also execute on ports 0 and 1, with 4 cycle latency.
+    //  3. `VPMADDWD (ZMM, ZMM, ZMM)` can execute on ports 0 and 1, with 3 cycle latency.
+    //
+    // The old solution was complex replied on 1. and 2.:
+    //
+    //    a_i8_abs_vec = _mm512_abs_epi8(a_i8_vec);
+    //    b_i8_abs_vec = _mm512_abs_epi8(b_i8_vec);
+    //    a2_i32_vec = _mm512_dpbusds_epi32(a2_i32_vec, a_i8_abs_vec, a_i8_abs_vec);
+    //    b2_i32_vec = _mm512_dpbusds_epi32(b2_i32_vec, b_i8_abs_vec, b_i8_abs_vec);
+    //    ab_i32_low_vec = _mm512_dpwssds_epi32(                      //
+    //        ab_i32_low_vec,                                         //
+    //        _mm512_cvtepi8_epi16(_mm512_castsi512_si256(a_i8_vec)), //
+    //        _mm512_cvtepi8_epi16(_mm512_castsi512_si256(b_i8_vec)));
+    //    ab_i32_high_vec = _mm512_dpwssds_epi32(                           //
+    //        ab_i32_high_vec,                                              //
+    //        _mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(a_i8_vec, 1)), //
+    //        _mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(b_i8_vec, 1)));
+    //
+    // The new solution is simpler and relies on 3.:
+    ab_i32_vec = _mm512_add_epi32(ab_i32_vec, _mm512_madd_epi16(a_i16_vec, b_i16_vec));
+    a2_i32_vec = _mm512_add_epi32(a2_i32_vec, _mm512_madd_epi16(a_i16_vec, a_i16_vec));
+    b2_i32_vec = _mm512_add_epi32(b2_i32_vec, _mm512_madd_epi16(b_i16_vec, b_i16_vec));
+    if (n) goto simsimd_cos_i8_ice_cycle;
+
+    int ab = _mm512_reduce_add_epi32(ab_i32_vec);
+    int a2 = _mm512_reduce_add_epi32(a2_i32_vec);
+    int b2 = _mm512_reduce_add_epi32(b2_i32_vec);
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+SIMSIMD_PUBLIC void simsimd_l2_u8_ice(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                      simsimd_distance_t *result) {
+    simsimd_l2sq_u8_ice(a, b, n, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_u8_ice(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                        simsimd_distance_t *result) {
+    __m512i d2_i32_low_vec = _mm512_setzero_si512();
+    __m512i d2_i32_high_vec = _mm512_setzero_si512();
+    __m512i const zeros_vec = _mm512_setzero_si512();
+    __m512i d_i16_low_vec, d_i16_high_vec;
+    __m512i a_u8_vec, b_u8_vec, d_u8_vec;
+
+simsimd_l2sq_u8_ice_cycle:
+    if (n < 64) {
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n);
+        a_u8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_u8_vec = _mm512_maskz_loadu_epi8(mask, b);
+        n = 0;
+    }
+    else {
+        a_u8_vec = _mm512_loadu_si512(a);
+        b_u8_vec = _mm512_loadu_si512(b);
+        a += 64, b += 64, n -= 64;
+    }
+
+    // Substracting unsigned vectors in AVX-512 is done by saturating subtraction:
+    d_u8_vec = _mm512_or_si512(_mm512_subs_epu8(a_u8_vec, b_u8_vec), _mm512_subs_epu8(b_u8_vec, a_u8_vec));
+    d_i16_low_vec = _mm512_unpacklo_epi8(d_u8_vec, zeros_vec);
+    d_i16_high_vec = _mm512_unpackhi_epi8(d_u8_vec, zeros_vec);
+
+    // Multiply and accumulate at `int16` level, accumulate at `int32` level:
+    d2_i32_low_vec = _mm512_dpwssd_epi32(d2_i32_low_vec, d_i16_low_vec, d_i16_low_vec);
+    d2_i32_high_vec = _mm512_dpwssd_epi32(d2_i32_high_vec, d_i16_high_vec, d_i16_high_vec);
+    if (n) goto simsimd_l2sq_u8_ice_cycle;
+
+    *result = _mm512_reduce_add_epi32(_mm512_add_epi32(d2_i32_low_vec, d2_i32_high_vec));
+}
+
+SIMSIMD_PUBLIC void simsimd_cos_u8_ice(simsimd_u8_t const *a, simsimd_u8_t const *b, simsimd_size_t n,
+                                       simsimd_distance_t *result) {
+
+    __m512i ab_i32_low_vec = _mm512_setzero_si512();
+    __m512i ab_i32_high_vec = _mm512_setzero_si512();
+    __m512i a2_i32_low_vec = _mm512_setzero_si512();
+    __m512i a2_i32_high_vec = _mm512_setzero_si512();
+    __m512i b2_i32_low_vec = _mm512_setzero_si512();
+    __m512i b2_i32_high_vec = _mm512_setzero_si512();
+    __m512i const zeros_vec = _mm512_setzero_si512();
+    __m512i a_i16_low_vec, a_i16_high_vec, b_i16_low_vec, b_i16_high_vec;
+    __m512i a_u8_vec, b_u8_vec;
+
+simsimd_cos_u8_ice_cycle:
+    if (n < 64) {
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n);
+        a_u8_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_u8_vec = _mm512_maskz_loadu_epi8(mask, b);
+        n = 0;
+    }
+    else {
+        a_u8_vec = _mm512_loadu_si512(a);
+        b_u8_vec = _mm512_loadu_si512(b);
+        a += 64, b += 64, n -= 64;
+    }
+
+    // Upcast `uint8` to `int16`. Unlike the signed version, we can use the unpacking
+    // instructions instead of extracts, as they are much faster and more efficient.
+    a_i16_low_vec = _mm512_unpacklo_epi8(a_u8_vec, zeros_vec);
+    a_i16_high_vec = _mm512_unpackhi_epi8(a_u8_vec, zeros_vec);
+    b_i16_low_vec = _mm512_unpacklo_epi8(b_u8_vec, zeros_vec);
+    b_i16_high_vec = _mm512_unpackhi_epi8(b_u8_vec, zeros_vec);
+
+    // Multiply and accumulate as `int16`, accumulate products as `int32`:
+    ab_i32_low_vec = _mm512_dpwssds_epi32(ab_i32_low_vec, a_i16_low_vec, b_i16_low_vec);
+    ab_i32_high_vec = _mm512_dpwssds_epi32(ab_i32_high_vec, a_i16_high_vec, b_i16_high_vec);
+    a2_i32_low_vec = _mm512_dpwssds_epi32(a2_i32_low_vec, a_i16_low_vec, a_i16_low_vec);
+    a2_i32_high_vec = _mm512_dpwssds_epi32(a2_i32_high_vec, a_i16_high_vec, a_i16_high_vec);
+    b2_i32_low_vec = _mm512_dpwssds_epi32(b2_i32_low_vec, b_i16_low_vec, b_i16_low_vec);
+    b2_i32_high_vec = _mm512_dpwssds_epi32(b2_i32_high_vec, b_i16_high_vec, b_i16_high_vec);
+    if (n) goto simsimd_cos_u8_ice_cycle;
+
+    int ab = _mm512_reduce_add_epi32(_mm512_add_epi32(ab_i32_low_vec, ab_i32_high_vec));
+    int a2 = _mm512_reduce_add_epi32(_mm512_add_epi32(a2_i32_low_vec, a2_i32_high_vec));
+    int b2 = _mm512_reduce_add_epi32(_mm512_add_epi32(b2_i32_low_vec, b2_i32_high_vec));
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+
+SIMSIMD_PUBLIC void simsimd_l2_i4x2_ice(simsimd_i4x2_t const *a, simsimd_i4x2_t const *b, simsimd_size_t n_words,
+                                        simsimd_distance_t *result) {
+    simsimd_l2sq_i4x2_ice(a, b, n_words, result);
+    *result = _simsimd_sqrt_f32_haswell(*result);
+}
+SIMSIMD_PUBLIC void simsimd_l2sq_i4x2_ice(simsimd_i4x2_t const *a, simsimd_i4x2_t const *b, simsimd_size_t n_words,
+                                          simsimd_distance_t *result) {
+
+    // While `int8_t` covers the range [-128, 127], `int4_t` covers only [-8, 7].
+    // The absolute difference between two 4-bit integers is at most 15 and it is always a `uint4_t` value!
+    // Moreover, it's square is at most 225, which fits into `uint8_t` and can be computed with a single
+    // lookup table. Accumulating those values is similar to checksumming, a piece of cake for SIMD!
+    __m512i const i4_to_i8_lookup_vec = _mm512_set_epi8(        //
+        -1, -2, -3, -4, -5, -6, -7, -8, 7, 6, 5, 4, 3, 2, 1, 0, //
+        -1, -2, -3, -4, -5, -6, -7, -8, 7, 6, 5, 4, 3, 2, 1, 0, //
+        -1, -2, -3, -4, -5, -6, -7, -8, 7, 6, 5, 4, 3, 2, 1, 0, //
+        -1, -2, -3, -4, -5, -6, -7, -8, 7, 6, 5, 4, 3, 2, 1, 0);
+    __m512i const u4_squares_lookup_vec = _mm512_set_epi8(                                        //
+        (char)225, (char)196, (char)169, (char)144, 121, 100, 81, 64, 49, 36, 25, 16, 9, 4, 1, 0, //
+        (char)225, (char)196, (char)169, (char)144, 121, 100, 81, 64, 49, 36, 25, 16, 9, 4, 1, 0, //
+        (char)225, (char)196, (char)169, (char)144, 121, 100, 81, 64, 49, 36, 25, 16, 9, 4, 1, 0, //
+        (char)225, (char)196, (char)169, (char)144, 121, 100, 81, 64, 49, 36, 25, 16, 9, 4, 1, 0);
+
+    /// The mask used to take the low nibble of each byte.
+    __m512i const i4_nibble_vec = _mm512_set1_epi8(0x0F);
+
+    // Temporaries:
+    __m512i a_i4x2_vec, b_i4x2_vec;
+    __m512i a_i8_low_vec, a_i8_high_vec, b_i8_low_vec, b_i8_high_vec;
+    __m512i d_u8_low_vec, d_u8_high_vec; //! Only the low 4 bits are actually used
+    __m512i d2_u8_low_vec, d2_u8_high_vec;
+    __m512i d2_u16_low_vec, d2_u16_high_vec;
+
+    // Accumulators:
+    __m512i d2_u32_vec = _mm512_setzero_si512();
+
+simsimd_l2sq_i4x2_ice_cycle:
+    if (n_words < 64) {
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words);
+        a_i4x2_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_i4x2_vec = _mm512_maskz_loadu_epi8(mask, b);
+        n_words = 0;
+    }
+    else {
+        a_i4x2_vec = _mm512_loadu_epi8(a);
+        b_i4x2_vec = _mm512_loadu_epi8(b);
+        a += 64, b += 64, n_words -= 64;
+    }
+
+    // Unpack the 4-bit values into 8-bit values with an empty top nibble.
+    a_i8_low_vec = _mm512_and_si512(a_i4x2_vec, i4_nibble_vec);
+    a_i8_high_vec = _mm512_and_si512(_mm512_srli_epi64(a_i4x2_vec, 4), i4_nibble_vec);
+    b_i8_low_vec = _mm512_and_si512(b_i4x2_vec, i4_nibble_vec);
+    b_i8_high_vec = _mm512_and_si512(_mm512_srli_epi64(b_i4x2_vec, 4), i4_nibble_vec);
+    a_i8_low_vec = _mm512_shuffle_epi8(i4_to_i8_lookup_vec, a_i8_low_vec);
+    a_i8_high_vec = _mm512_shuffle_epi8(i4_to_i8_lookup_vec, a_i8_high_vec);
+    b_i8_low_vec = _mm512_shuffle_epi8(i4_to_i8_lookup_vec, b_i8_low_vec);
+    b_i8_high_vec = _mm512_shuffle_epi8(i4_to_i8_lookup_vec, b_i8_high_vec);
+
+    // We can implement subtraction with a lookup table, or using `_mm512_sub_epi8`.
+    d_u8_low_vec = _mm512_abs_epi8(_mm512_sub_epi8(a_i8_low_vec, b_i8_low_vec));
+    d_u8_high_vec = _mm512_abs_epi8(_mm512_sub_epi8(a_i8_high_vec, b_i8_high_vec));
+
+    // Now we can use the lookup table to compute the squares of the 4-bit unsigned integers
+    // in the low nibbles of the `d_u8_low_vec` and `d_u8_high_vec` vectors.
+    d2_u8_low_vec = _mm512_shuffle_epi8(u4_squares_lookup_vec, d_u8_low_vec);
+    d2_u8_high_vec = _mm512_shuffle_epi8(u4_squares_lookup_vec, d_u8_high_vec);
+
+    // Aggregating into 16-bit integers, we need to first upcast our 8-bit values to 16 bits.
+    // After that, we will perform one more operation, upcasting further into 32-bit integers.
+    d2_u16_low_vec =      //
+        _mm512_add_epi16( //
+            _mm512_unpacklo_epi8(d2_u8_low_vec, _mm512_setzero_si512()),
+            _mm512_unpackhi_epi8(d2_u8_low_vec, _mm512_setzero_si512()));
+    d2_u16_high_vec =     //
+        _mm512_add_epi16( //
+            _mm512_unpacklo_epi8(d2_u8_high_vec, _mm512_setzero_si512()),
+            _mm512_unpackhi_epi8(d2_u8_high_vec, _mm512_setzero_si512()));
+    d2_u32_vec = _mm512_add_epi32(d2_u32_vec, _mm512_unpacklo_epi16(d2_u16_low_vec, _mm512_setzero_si512()));
+    d2_u32_vec = _mm512_add_epi32(d2_u32_vec, _mm512_unpacklo_epi16(d2_u16_high_vec, _mm512_setzero_si512()));
+    if (n_words) goto simsimd_l2sq_i4x2_ice_cycle;
+
+    // Finally, we can reduce the 16-bit integers to 32-bit integers and sum them up.
+    int d2 = _mm512_reduce_add_epi32(d2_u32_vec);
+    *result = d2;
+}
+SIMSIMD_PUBLIC void simsimd_cos_i4x2_ice(simsimd_i4x2_t const *a, simsimd_i4x2_t const *b, simsimd_size_t n_words,
+                                         simsimd_distance_t *result) {
+
+    // We need to compose a lookup table for all the scalar products of 4-bit integers.
+    // While `int8_t` covers the range [-128, 127], `int4_t` covers only [-8, 7].
+    // Practically speaking, the product of two 4-bit signed integers is a 7-bit integer,
+    // as the maximum absolute value of the product is `abs(-8 * -8) == 64`.
+    //
+    // To store 128 possible values of 2^7 bits we only need 128 single-byte scalars,
+    // or just 2x ZMM registers. In that case our lookup will only take `vpermi2b` instruction,
+    // easily inokable with `_mm512_permutex2var_epi8` intrinsic with latency of 6 on Sapphire Rapids.
+    // The problem is converting 2d indices of our symmetric matrix into 1d offsets in the dense array.
+    //
+    // Alternatively, we can take the entire symmetric (16 x 16) matrix of products,
+    // put into 4x ZMM registers, and use it with `_mm512_shuffle_epi8`, remembering
+    // that it can only lookup with 128-bit lanes (16x 8-bit values).
+    // That intrinsic has latency 1, but will need to be repeated and combined with
+    // multiple iterations of `_mm512_shuffle_i64x2` that has latency 3.
+    //
+    // Altenatively, we can get down to 3 cycles per lookup with `vpermb` and `_mm512_permutexvar_epi8` intrinsics.
+    // For that we can split our (16 x 16) matrix into 4x (8 x 8) submatrices, and use 4x ZMM registers.
+    //
+    // Still, all of those solutions are quite heavy compared to two parallel calls to `_mm512_dpbusds_epi32`
+    // for the dot product. But we can still use the `_mm512_permutexvar_epi8` to compute the squares of the
+    // 16 possible `int4_t` values faster.
+    //
+    // Here is how our `int4_t` range looks:
+    //
+    //      dec:     0   1   2   3   4   5   6   7  -8  -7  -6  -5  -4  -3  -2  -1
+    //      hex:     0   1   2   3   4   5   6   7   8   9   A   B   C   D   E   F
+    //
+    // Squared:
+    //
+    //      dec2:    0   1   4   9  16  25  36  49  64  49  36  25  16   9   4   1
+    //      hex2:    0   1   4   9  10  19  24  31  40  31  24  19  10   9   4   1
+    //
+    // Broadcast it to every lane, so that: `square(x) == _mm512_shuffle_epi8(i4_squares_lookup_vec, x)`.
+    __m512i const i4_to_i8_lookup_vec = _mm512_set_epi8(        //
+        -1, -2, -3, -4, -5, -6, -7, -8, 7, 6, 5, 4, 3, 2, 1, 0, //
+        -1, -2, -3, -4, -5, -6, -7, -8, 7, 6, 5, 4, 3, 2, 1, 0, //
+        -1, -2, -3, -4, -5, -6, -7, -8, 7, 6, 5, 4, 3, 2, 1, 0, //
+        -1, -2, -3, -4, -5, -6, -7, -8, 7, 6, 5, 4, 3, 2, 1, 0);
+    __m512i const i4_squares_lookup_vec = _mm512_set_epi8(       //
+        1, 4, 9, 16, 25, 36, 49, 64, 49, 36, 25, 16, 9, 4, 1, 0, //
+        1, 4, 9, 16, 25, 36, 49, 64, 49, 36, 25, 16, 9, 4, 1, 0, //
+        1, 4, 9, 16, 25, 36, 49, 64, 49, 36, 25, 16, 9, 4, 1, 0, //
+        1, 4, 9, 16, 25, 36, 49, 64, 49, 36, 25, 16, 9, 4, 1, 0);
+
+    /// The mask used to take the low nibble of each byte.
+    __m512i const i4_nibble_vec = _mm512_set1_epi8(0x0F);
+
+    // Temporaries:
+    __m512i a_i4x2_vec, b_i4x2_vec;
+    __m512i a_i8_low_vec, a_i8_high_vec, b_i8_low_vec, b_i8_high_vec;
+    __m512i a2_u8_vec, b2_u8_vec;
+
+    // Accumulators:
+    __m512i a2_u16_low_vec = _mm512_setzero_si512();
+    __m512i a2_u16_high_vec = _mm512_setzero_si512();
+    __m512i b2_u16_low_vec = _mm512_setzero_si512();
+    __m512i b2_u16_high_vec = _mm512_setzero_si512();
+    __m512i ab_i32_low_vec = _mm512_setzero_si512();
+    __m512i ab_i32_high_vec = _mm512_setzero_si512();
+
+simsimd_cos_i4x2_ice_cycle:
+    if (n_words < 64) {
+        __mmask64 mask = (__mmask64)_bzhi_u64(0xFFFFFFFFFFFFFFFF, n_words);
+        a_i4x2_vec = _mm512_maskz_loadu_epi8(mask, a);
+        b_i4x2_vec = _mm512_maskz_loadu_epi8(mask, b);
+        n_words = 0;
+    }
+    else {
+        a_i4x2_vec = _mm512_loadu_epi8(a);
+        b_i4x2_vec = _mm512_loadu_epi8(b);
+        a += 64, b += 64, n_words -= 64;
+    }
+
+    // Unpack the 4-bit values into 8-bit values with an empty top nibble.
+    // For now, they are not really 8-bit integers, as they are not sign-extended.
+    // That part will come later, using the `i4_to_i8_lookup_vec` lookup.
+    a_i8_low_vec = _mm512_and_si512(a_i4x2_vec, i4_nibble_vec);
+    a_i8_high_vec = _mm512_and_si512(_mm512_srli_epi64(a_i4x2_vec, 4), i4_nibble_vec);
+    b_i8_low_vec = _mm512_and_si512(b_i4x2_vec, i4_nibble_vec);
+    b_i8_high_vec = _mm512_and_si512(_mm512_srli_epi64(b_i4x2_vec, 4), i4_nibble_vec);
+
+    // Compute the squares of the 4-bit integers.
+    // For symmetry we could have used 4 registers, aka "a2_i8_low_vec", "a2_i8_high_vec", "b2_i8_low_vec",
+    // "b2_i8_high_vec". But the largest square value is just 64, so we can safely aggregate into 8-bit unsigned values.
+    a2_u8_vec = _mm512_add_epi8(_mm512_shuffle_epi8(i4_squares_lookup_vec, a_i8_low_vec),
+                                _mm512_shuffle_epi8(i4_squares_lookup_vec, a_i8_high_vec));
+    b2_u8_vec = _mm512_add_epi8(_mm512_shuffle_epi8(i4_squares_lookup_vec, b_i8_low_vec),
+                                _mm512_shuffle_epi8(i4_squares_lookup_vec, b_i8_high_vec));
+
+    // We can safely aggregate into just 16-bit sums without overflow, if the vectors have less than:
+    //      (2 scalars / byte) * (64 bytes / register) * (256 non-overflowing 8-bit additions in 16-bit intesgers)
+    //      = 32'768 dimensions.
+    //
+    // We use saturated addition here to clearly inform in case of overflow.
+    a2_u16_low_vec = _mm512_adds_epu16(a2_u16_low_vec, _mm512_cvtepu8_epi16(_mm512_castsi512_si256(a2_u8_vec)));
+    a2_u16_high_vec = _mm512_adds_epu16(a2_u16_high_vec, _mm512_cvtepu8_epi16(_mm512_extracti64x4_epi64(a2_u8_vec, 1)));
+    b2_u16_low_vec = _mm512_adds_epu16(b2_u16_low_vec, _mm512_cvtepu8_epi16(_mm512_castsi512_si256(a2_u8_vec)));
+    b2_u16_high_vec = _mm512_adds_epu16(b2_u16_high_vec, _mm512_cvtepu8_epi16(_mm512_extracti64x4_epi64(a2_u8_vec, 1)));
+
+    // Time to perform the proper sign extension of the 4-bit integers to 8-bit integers.
+    a_i8_low_vec = _mm512_shuffle_epi8(i4_to_i8_lookup_vec, a_i8_low_vec);
+    a_i8_high_vec = _mm512_shuffle_epi8(i4_to_i8_lookup_vec, a_i8_high_vec);
+    b_i8_low_vec = _mm512_shuffle_epi8(i4_to_i8_lookup_vec, b_i8_low_vec);
+    b_i8_high_vec = _mm512_shuffle_epi8(i4_to_i8_lookup_vec, b_i8_high_vec);
+
+    // The same trick won't work for the primary dot-product, as the signs vector
+    // components may differ significantly. So we have to use two `_mm512_dpwssds_epi32`
+    // intrinsics instead, upcasting four chunks to 16-bit integers beforehand!
+    // Alternatively, we can flip the signs of the second argument and use `_mm512_dpbusds_epi32`,
+    // but it ends up taking more instructions.
+    ab_i32_low_vec = _mm512_dpwssds_epi32(                          //
+        ab_i32_low_vec,                                             //
+        _mm512_cvtepi8_epi16(_mm512_castsi512_si256(a_i8_low_vec)), //
+        _mm512_cvtepi8_epi16(_mm512_castsi512_si256(b_i8_low_vec)));
+    ab_i32_low_vec = _mm512_dpwssds_epi32(                                //
+        ab_i32_low_vec,                                                   //
+        _mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(a_i8_low_vec, 1)), //
+        _mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(b_i8_low_vec, 1)));
+    ab_i32_high_vec = _mm512_dpwssds_epi32(                          //
+        ab_i32_high_vec,                                             //
+        _mm512_cvtepi8_epi16(_mm512_castsi512_si256(a_i8_high_vec)), //
+        _mm512_cvtepi8_epi16(_mm512_castsi512_si256(b_i8_high_vec)));
+    ab_i32_high_vec = _mm512_dpwssds_epi32(                                //
+        ab_i32_high_vec,                                                   //
+        _mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(a_i8_high_vec, 1)), //
+        _mm512_cvtepi8_epi16(_mm512_extracti64x4_epi64(b_i8_high_vec, 1)));
+    if (n_words) goto simsimd_cos_i4x2_ice_cycle;
+
+    int ab = _mm512_reduce_add_epi32(_mm512_add_epi32(ab_i32_low_vec, ab_i32_high_vec));
+    unsigned short a2_u16[32], b2_u16[32];
+    _mm512_storeu_si512(a2_u16, _mm512_add_epi16(a2_u16_low_vec, a2_u16_high_vec));
+    unsigned int a2 = 0, b2 = 0;
+    for (int i = 0; i < 32; ++i) a2 += a2_u16[i], b2 += b2_u16[i];
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_ICE
+
+#if SIMSIMD_TARGET_SIERRA
+#pragma GCC push_options
+#pragma GCC target("avx2", "bmi2", "avx2vnni")
+#pragma clang attribute push(__attribute__((target("avx2,bmi2,avx2vnni"))), apply_to = function)
+
+SIMSIMD_PUBLIC void simsimd_cos_i8_sierra(simsimd_i8_t const *a, simsimd_i8_t const *b, simsimd_size_t n,
+                                          simsimd_distance_t *result) {
+
+    __m256i ab_i32_vec = _mm256_setzero_si256();
+    __m256i a2_i32_vec = _mm256_setzero_si256();
+    __m256i b2_i32_vec = _mm256_setzero_si256();
+
+    simsimd_size_t i = 0;
+    for (; i + 32 <= n; i += 32) {
+        __m256i a_i8_vec = _mm256_lddqu_si256((__m256i const *)(a + i));
+        __m256i b_i8_vec = _mm256_lddqu_si256((__m256i const *)(b + i));
+        ab_i32_vec = _mm256_dpbssds_epi32(ab_i32_vec, a_i8_vec, b_i8_vec);
+        a2_i32_vec = _mm256_dpbssds_epi32(a2_i32_vec, a_i8_vec, a_i8_vec);
+        b2_i32_vec = _mm256_dpbssds_epi32(b2_i32_vec, b_i8_vec, b_i8_vec);
+    }
+
+    // Further reduce to a single sum for each vector
+    int ab = _simsimd_reduce_i32x8_haswell(ab_i32_vec);
+    int a2 = _simsimd_reduce_i32x8_haswell(a2_i32_vec);
+    int b2 = _simsimd_reduce_i32x8_haswell(b2_i32_vec);
+
+    // Take care of the tail:
+    for (; i < n; ++i) {
+        int ai = a[i], bi = b[i];
+        ab += ai * bi, a2 += ai * ai, b2 += bi * bi;
+    }
+
+    *result = _simsimd_cos_normalize_f32_haswell(ab, a2, b2);
+}
+
+#pragma clang attribute pop
+#pragma GCC pop_options
+#endif // SIMSIMD_TARGET_SIERRA
+#endif // _SIMSIMD_TARGET_X86
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/types.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/types.h
new file mode 100644
index 0000000000..3771956920
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/include/types.h
@@ -0,0 +1,637 @@
+/**
+ *  @file       types.h
+ *  @brief      Shared definitions for the SimSIMD library.
+ *  @author     Ash Vardanian
+ *  @date       October 2, 2023
+ *
+ *  Defines:
+ *  - Sized aliases for numeric types, like: `simsimd_i32_t` and `simsimd_f64_t`.
+ *  - Macros for internal compiler/hardware checks, like: `_SIMSIMD_TARGET_ARM`.
+ *  - Macros for feature controls, like: `SIMSIMD_TARGET_NEON`
+ */
+#ifndef SIMSIMD_TYPES_H
+#define SIMSIMD_TYPES_H
+
+// Inferring target OS: Windows, MacOS, or Linux
+#if defined(WIN32) || defined(_WIN32) || defined(__WIN32__) || defined(__NT__)
+#define _SIMSIMD_DEFINED_WINDOWS 1
+#elif defined(__APPLE__) && defined(__MACH__)
+#define _SIMSIMD_DEFINED_APPLE 1
+#elif defined(__linux__)
+#define _SIMSIMD_DEFINED_LINUX 1
+#endif
+
+// Annotation for the public API symbols:
+//
+// - `SIMSIMD_PUBLIC` is used for functions that are part of the public API.
+// - `SIMSIMD_INTERNAL` is used for internal helper functions with unstable APIs.
+// - `SIMSIMD_DYNAMIC` is used for functions that are part of the public API, but are dispatched at
+// runtime.
+//
+#if defined(_WIN32) || defined(__CYGWIN__)
+#define SIMSIMD_DYNAMIC __declspec(dllexport)
+#define SIMSIMD_PUBLIC inline static
+#define SIMSIMD_INTERNAL inline static
+#elif defined(__GNUC__) || defined(__clang__)
+#define SIMSIMD_DYNAMIC __attribute__((visibility("default")))
+#define SIMSIMD_PUBLIC __attribute__((unused)) inline static
+#define SIMSIMD_INTERNAL inline static
+#else
+#define SIMSIMD_DYNAMIC
+#define SIMSIMD_PUBLIC inline static
+#define SIMSIMD_INTERNAL inline static
+#endif
+
+// Compiling for Arm: _SIMSIMD_TARGET_ARM
+#if !defined(_SIMSIMD_TARGET_ARM)
+#if defined(__aarch64__) || defined(_M_ARM64)
+#define _SIMSIMD_TARGET_ARM 1
+#else
+#define _SIMSIMD_TARGET_ARM 0
+#endif // defined(__aarch64__) || defined(_M_ARM64)
+#endif // !defined(_SIMSIMD_TARGET_ARM)
+
+// Compiling for x86: _SIMSIMD_TARGET_X86
+#if !defined(_SIMSIMD_TARGET_X86)
+#if defined(__x86_64__) || defined(_M_X64)
+#define _SIMSIMD_TARGET_X86 1
+#else
+#define _SIMSIMD_TARGET_X86 0
+#endif // defined(__x86_64__) || defined(_M_X64)
+#endif // !defined(_SIMSIMD_TARGET_X86)
+
+// Compiling for Arm: SIMSIMD_TARGET_NEON
+#if !defined(SIMSIMD_TARGET_NEON) || (SIMSIMD_TARGET_NEON && !_SIMSIMD_TARGET_ARM)
+#if defined(__ARM_NEON)
+#define SIMSIMD_TARGET_NEON _SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_NEON
+#define SIMSIMD_TARGET_NEON 0
+#endif // defined(__ARM_NEON)
+#endif // !defined(SIMSIMD_TARGET_NEON) || ...
+
+// Compiling for Arm: SIMSIMD_TARGET_NEON_I8
+#if !defined(SIMSIMD_TARGET_NEON_I8) || (SIMSIMD_TARGET_NEON_I8 && !_SIMSIMD_TARGET_ARM)
+#if defined(__ARM_NEON)
+#define SIMSIMD_TARGET_NEON_I8 _SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_NEON_I8
+#define SIMSIMD_TARGET_NEON_I8 0
+#endif // defined(__ARM_NEON)
+#endif // !defined(SIMSIMD_TARGET_NEON_I8) || ...
+
+// Compiling for Arm: SIMSIMD_TARGET_NEON_F16
+#if !defined(SIMSIMD_TARGET_NEON_F16) || (SIMSIMD_TARGET_NEON_F16 && !_SIMSIMD_TARGET_ARM)
+#if defined(__ARM_NEON)
+#define SIMSIMD_TARGET_NEON_F16 _SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_NEON_F16
+#define SIMSIMD_TARGET_NEON_F16 0
+#endif // defined(__ARM_NEON)
+#endif // !defined(SIMSIMD_TARGET_NEON_F16) || ...
+
+// Compiling for Arm: SIMSIMD_TARGET_NEON_BF16
+#if !defined(SIMSIMD_TARGET_NEON_BF16) || (SIMSIMD_TARGET_NEON_BF16 && !_SIMSIMD_TARGET_ARM)
+#if defined(__ARM_NEON)
+#define SIMSIMD_TARGET_NEON_BF16 _SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_NEON_BF16
+#define SIMSIMD_TARGET_NEON_BF16 0
+#endif // defined(__ARM_NEON)
+#endif // !defined(SIMSIMD_TARGET_NEON_BF16) || ...
+
+// Compiling for Arm: SIMSIMD_TARGET_SVE
+#if !defined(SIMSIMD_TARGET_SVE) || (SIMSIMD_TARGET_SVE && !_SIMSIMD_TARGET_ARM)
+#if defined(__ARM_FEATURE_SVE)
+#define SIMSIMD_TARGET_SVE _SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_SVE
+#define SIMSIMD_TARGET_SVE 0
+#endif // defined(__ARM_FEATURE_SVE)
+#endif // !defined(SIMSIMD_TARGET_SVE) || ...
+
+// Compiling for Arm: SIMSIMD_TARGET_SVE_I8
+#if !defined(SIMSIMD_TARGET_SVE_I8) || (SIMSIMD_TARGET_SVE_I8 && !_SIMSIMD_TARGET_ARM)
+#if defined(__ARM_FEATURE_SVE)
+#define SIMSIMD_TARGET_SVE_I8 _SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_SVE_I8
+#define SIMSIMD_TARGET_SVE_I8 0
+#endif // defined(__ARM_FEATURE_SVE)
+#endif // !defined(SIMSIMD_TARGET_SVE_I8) || ...
+
+// Compiling for Arm: SIMSIMD_TARGET_SVE_F16
+#if !defined(SIMSIMD_TARGET_SVE_F16) || (SIMSIMD_TARGET_SVE_F16 && !_SIMSIMD_TARGET_ARM)
+#if defined(__ARM_FEATURE_SVE)
+#define SIMSIMD_TARGET_SVE_F16 _SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_SVE_F16
+#define SIMSIMD_TARGET_SVE_F16 0
+#endif // defined(__ARM_FEATURE_SVE)
+#endif // !defined(SIMSIMD_TARGET_SVE_F16) || ...
+
+// Compiling for Arm: SIMSIMD_TARGET_SVE_BF16
+#if !defined(SIMSIMD_TARGET_SVE_BF16) || (SIMSIMD_TARGET_SVE_BF16 && !_SIMSIMD_TARGET_ARM)
+#if defined(__ARM_FEATURE_SVE)
+#define SIMSIMD_TARGET_SVE_BF16 _SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_SVE_BF16
+#define SIMSIMD_TARGET_SVE_BF16 0
+#endif // defined(__ARM_FEATURE_SVE)
+#endif // !defined(SIMSIMD_TARGET_SVE_BF16) || ...
+
+// Compiling for Arm: SIMSIMD_TARGET_SVE2
+#if !defined(SIMSIMD_TARGET_SVE2) || (SIMSIMD_TARGET_SVE2 && !_SIMSIMD_TARGET_ARM)
+#if defined(__ARM_FEATURE_SVE)
+#define SIMSIMD_TARGET_SVE2 _SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_SVE2
+#define SIMSIMD_TARGET_SVE2 0
+#endif // defined(__ARM_FEATURE_SVE)
+#endif // !defined(SIMSIMD_TARGET_SVE2) || ...
+
+// Compiling for x86: SIMSIMD_TARGET_HASWELL
+//
+// Starting with Ivy Bridge, Intel supports the `F16C` extensions for fast half-precision
+// to single-precision floating-point conversions. On AMD those instructions
+// are supported on all CPUs starting with Jaguar 2009.
+// Starting with Sandy Bridge, Intel adds basic AVX support in their CPUs and in 2013
+// extends it with AVX2 in the Haswell generation. Moreover, Haswell adds FMA support.
+#if !defined(SIMSIMD_TARGET_HASWELL) || (SIMSIMD_TARGET_HASWELL && !_SIMSIMD_TARGET_X86)
+#if defined(__AVX2__) && defined(__FMA__) && defined(__F16C__)
+#define SIMSIMD_TARGET_HASWELL 1
+#else
+#undef SIMSIMD_TARGET_HASWELL
+#define SIMSIMD_TARGET_HASWELL 0
+#endif // defined(__AVX2__)
+#endif // !defined(SIMSIMD_TARGET_HASWELL) || ...
+
+// Compiling for x86: SIMSIMD_TARGET_SKYLAKE, SIMSIMD_TARGET_ICE, SIMSIMD_TARGET_GENOA,
+// SIMSIMD_TARGET_SAPPHIRE, SIMSIMD_TARGET_TURIN, SIMSIMD_TARGET_SIERRA
+//
+// To list all available macros for x86, take a recent compiler, like GCC 12 and run:
+//      gcc-12 -march=sapphirerapids -dM -E - < /dev/null | egrep "SSE|AVX" | sort
+// On Arm machines you may want to check for other flags:
+//      gcc-12 -march=native -dM -E - < /dev/null | egrep "NEON|SVE|FP16|FMA" | sort
+#if !defined(SIMSIMD_TARGET_SKYLAKE) || (SIMSIMD_TARGET_SKYLAKE && !_SIMSIMD_TARGET_X86)
+#if defined(__AVX512F__) && defined(__AVX512CD__) && defined(__AVX512VL__) &&                      \
+    defined(__AVX512DQ__) && defined(__AVX512BW__)
+#define SIMSIMD_TARGET_SKYLAKE 1
+#else
+#undef SIMSIMD_TARGET_SKYLAKE
+#define SIMSIMD_TARGET_SKYLAKE 0
+#endif
+#endif // !defined(SIMSIMD_TARGET_SKYLAKE) || ...
+#if !defined(SIMSIMD_TARGET_ICE) || (SIMSIMD_TARGET_ICE && !_SIMSIMD_TARGET_X86)
+#if defined(__AVX512VNNI__) && defined(__AVX512IFMA__) && defined(__AVX512BITALG__) &&             \
+    defined(__AVX512VBMI2__) && defined(__AVX512VPOPCNTDQ__)
+#define SIMSIMD_TARGET_ICE 1
+#else
+#undef SIMSIMD_TARGET_ICE
+#define SIMSIMD_TARGET_ICE 0
+#endif
+#endif // !defined(SIMSIMD_TARGET_ICE) || ...
+#if !defined(SIMSIMD_TARGET_GENOA) || (SIMSIMD_TARGET_GENOA && !_SIMSIMD_TARGET_X86)
+#if defined(__AVX512BF16__)
+#define SIMSIMD_TARGET_GENOA 1
+#else
+#undef SIMSIMD_TARGET_GENOA
+#define SIMSIMD_TARGET_GENOA 0
+#endif
+#endif // !defined(SIMSIMD_TARGET_GENOA) || ...
+#if !defined(SIMSIMD_TARGET_SAPPHIRE) || (SIMSIMD_TARGET_SAPPHIRE && !_SIMSIMD_TARGET_X86)
+#if defined(__AVX512FP16__)
+#define SIMSIMD_TARGET_SAPPHIRE 1
+#else
+#undef SIMSIMD_TARGET_SAPPHIRE
+#define SIMSIMD_TARGET_SAPPHIRE 0
+#endif
+#endif // !defined(SIMSIMD_TARGET_SAPPHIRE) || ...
+#if !defined(SIMSIMD_TARGET_TURIN) || (SIMSIMD_TARGET_TURIN && !_SIMSIMD_TARGET_X86)
+#if defined(__AVX512VP2INTERSECT__)
+#define SIMSIMD_TARGET_TURIN 1
+#else
+#undef SIMSIMD_TARGET_TURIN
+#define SIMSIMD_TARGET_TURIN 0
+#endif
+#endif // !defined(SIMSIMD_TARGET_TURIN) || ...
+#if !defined(SIMSIMD_TARGET_SIERRA) || (SIMSIMD_TARGET_SIERRA && !_SIMSIMD_TARGET_X86)
+#if defined(__AVX2_VNNI__)
+#define SIMSIMD_TARGET_SIERRA 1
+#else
+#undef SIMSIMD_TARGET_SIERRA
+#define SIMSIMD_TARGET_SIERRA 0
+#endif
+#endif // !defined(SIMSIMD_TARGET_SIERRA) || ...
+
+#ifdef _MSC_VER
+#include <intrin.h>
+#else
+
+#if SIMSIMD_TARGET_NEON
+#include <arm_neon.h>
+#endif
+
+#if SIMSIMD_TARGET_SVE || SIMSIMD_TARGET_SVE2
+#include <arm_sve.h>
+#endif
+
+#if SIMSIMD_TARGET_HASWELL || SIMSIMD_TARGET_SKYLAKE || SIMSIMD_TARGET_ICE ||                      \
+    SIMSIMD_TARGET_GENOA || SIMSIMD_TARGET_SAPPHIRE || SIMSIMD_TARGET_TURIN
+#include <immintrin.h>
+#endif
+
+#endif
+
+#if !defined(SIMSIMD_SQRT)
+#include <math.h>
+#define SIMSIMD_SQRT(x) (sqrt(x))
+#endif
+
+#if !defined(SIMSIMD_RSQRT)
+#include <math.h>
+#define SIMSIMD_RSQRT(x) (1 / SIMSIMD_SQRT(x))
+#endif
+
+#if !defined(SIMSIMD_LOG)
+#include <math.h>
+#define SIMSIMD_LOG(x) (log(x))
+#endif
+
+#if !defined(SIMSIMD_F32_DIVISION_EPSILON)
+#define SIMSIMD_F32_DIVISION_EPSILON (1e-7)
+#endif
+
+#if !defined(SIMSIMD_F16_DIVISION_EPSILON)
+#define SIMSIMD_F16_DIVISION_EPSILON (1e-3)
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef unsigned char simsimd_b8_t;
+typedef unsigned char simsimd_i4x2_t;
+
+typedef signed char simsimd_i8_t;
+typedef unsigned char simsimd_u8_t;
+typedef signed short simsimd_i16_t;
+typedef unsigned short simsimd_u16_t;
+typedef signed int simsimd_i32_t;
+typedef unsigned int simsimd_u32_t;
+typedef signed long long simsimd_i64_t;
+typedef unsigned long long simsimd_u64_t;
+
+typedef float simsimd_f32_t;
+typedef double simsimd_f64_t;
+
+typedef simsimd_u64_t simsimd_size_t;
+typedef simsimd_f64_t simsimd_distance_t;
+
+/*  @brief  Half-precision floating-point type.
+ *
+ *  - GCC or Clang on 64-bit Arm: `__fp16`, may require `-mfp16-format` option.
+ *  - GCC or Clang on 64-bit x86: `_Float16`.
+ *  - Default: `unsigned short`.
+ */
+#if !defined(SIMSIMD_NATIVE_F16) || SIMSIMD_NATIVE_F16
+#if (defined(__GNUC__) || defined(__clang__)) && (defined(__ARM_ARCH) || defined(__aarch64__)) &&  \
+    (defined(__ARM_FP16_FORMAT_IEEE))
+#undef SIMSIMD_NATIVE_F16
+#define SIMSIMD_NATIVE_F16 1
+typedef __fp16 simsimd_f16_t;
+#elif ((defined(__GNUC__) || defined(__clang__)) && (defined(__x86_64__) || defined(__i386__)) &&  \
+       (defined(__AVX512FP16__)))
+typedef _Float16 simsimd_f16_t;
+#undef SIMSIMD_NATIVE_F16
+#define SIMSIMD_NATIVE_F16 1
+#else                                       // Unknown compiler or architecture
+#if defined(__GNUC__) || defined(__clang__) // Some compilers don't support warning pragmas
+// #warning "Unknown compiler or architecture for float16."
+#endif
+#undef SIMSIMD_NATIVE_F16
+#define SIMSIMD_NATIVE_F16 0
+#endif // Unknown compiler or architecture
+#endif // !SIMSIMD_NATIVE_F16
+
+#if !SIMSIMD_NATIVE_F16
+typedef unsigned short simsimd_f16_t;
+#endif
+
+#if !defined(SIMSIMD_NATIVE_BF16) || SIMSIMD_NATIVE_BF16
+/**
+ *  @brief  Half-precision brain-float type.
+ *
+ *  - GCC or Clang on 64-bit Arm: `__bf16`
+ *  - GCC or Clang on 64-bit x86: `_BFloat16`.
+ *  - Default: `unsigned short`.
+ *
+ *  The compilers have added `__bf16` support in compliance with the x86-64 psABI spec.
+ *  The motivation for this new special type is summed up as:
+ *
+ *      Currently `__bfloat16` is a typedef of short, which creates a problem where the
+ *      compiler does not raise any alarms if it is used to add, subtract, multiply or
+ *      divide, but the result of the calculation is actually meaningless.
+ *      To solve this problem, a real scalar type `__Bfloat16` needs to be introduced.
+ *      It is mainly used for intrinsics, not available for C standard operators.
+ *      `__Bfloat16` will also be used for movement like passing parameter, load and store,
+ *      vector initialization, vector shuffle, and etc. It creates a need for a
+ *      corresponding psABI.
+ *
+ *  @warning Apple Clang has hard time with bf16.
+ *  https://developer.apple.com/documentation/xcode/writing-arm64-code-for-apple-platforms
+ *  https://forums.developer.apple.com/forums/thread/726201
+ *  https://www.phoronix.com/news/GCC-LLVM-bf16-BFloat16-Type
+ */
+#if (defined(__GNUC__) || defined(__clang__)) && (defined(__ARM_ARCH) || defined(__aarch64__)) &&  \
+    (defined(__ARM_BF16_FORMAT_ALTERNATIVE))
+#undef SIMSIMD_NATIVE_BF16
+#define SIMSIMD_NATIVE_BF16 1
+typedef __bf16 simsimd_bf16_t;
+#elif ((defined(__GNUC__) || defined(__clang__)) && (defined(__x86_64__) || defined(__i386__)) &&  \
+       (defined(__AVX512BF16__)))
+typedef __bfloat16 simsimd_bf16_t;
+#undef SIMSIMD_NATIVE_BF16
+#define SIMSIMD_NATIVE_BF16 1
+#else                                       // Unknown compiler or architecture
+#if defined(__GNUC__) || defined(__clang__) // Some compilers don't support warning pragmas
+// #warning "Unknown compiler or architecture for bfloat16."
+#endif
+#undef SIMSIMD_NATIVE_BF16
+#define SIMSIMD_NATIVE_BF16 0
+#endif // Unknown compiler or architecture
+#endif // !SIMSIMD_NATIVE_BF16
+
+#if !SIMSIMD_NATIVE_BF16
+typedef unsigned short simsimd_bf16_t;
+#endif
+
+/**
+ *  @brief  Alias for the half-precision floating-point type on Arm.
+ *
+ *  Clang and GCC bring the `float16_t` symbol when you compile for Aarch64.
+ *  MSVC lacks it, and it's `vld1_f16`-like intrinsics are in reality macros,
+ *  that cast to 16-bit integers internally, instead of using floats.
+ *  Some of those are defined as aliases, so we use `#define` preprocessor
+ *  directives instead of `typedef` to avoid errors.
+ */
+#if _SIMSIMD_TARGET_ARM
+#if defined(_MSC_VER)
+#define simsimd_f16_for_arm_simd_t simsimd_f16_t
+#define simsimd_bf16_for_arm_simd_t simsimd_bf16_t
+#else
+#define simsimd_f16_for_arm_simd_t float16_t
+#define simsimd_bf16_for_arm_simd_t bfloat16_t
+#endif
+#endif
+
+/*
+ *  Let's make sure the sizes of the types are as expected.
+ *  In C the `_Static_assert` is only available with C 11 and later.
+ */
+#define SIMSIMD_STATIC_ASSERT(cond, msg) typedef char static_assertion_##msg[(cond) ? 1 : -1]
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_b8_t) == 1, simsimd_b8_t_must_be_1_byte);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_i4x2_t) == 1, simsimd_i4x2_t_must_be_1_byte);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_i8_t) == 1, simsimd_i8_t_must_be_1_byte);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_u8_t) == 1, simsimd_u8_t_must_be_1_byte);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_i16_t) == 2, simsimd_i16_t_must_be_2_bytes);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_u16_t) == 2, simsimd_u16_t_must_be_2_bytes);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_i32_t) == 4, simsimd_i32_t_must_be_4_bytes);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_u32_t) == 4, simsimd_u32_t_must_be_4_bytes);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_i64_t) == 8, simsimd_i64_t_must_be_8_bytes);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_u64_t) == 8, simsimd_u64_t_must_be_8_bytes);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_f32_t) == 4, simsimd_f32_t_must_be_4_bytes);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_f64_t) == 8, simsimd_f64_t_must_be_8_bytes);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_f16_t) == 2, simsimd_f16_t_must_be_2_bytes);
+SIMSIMD_STATIC_ASSERT(sizeof(simsimd_bf16_t) == 2, simsimd_bf16_t_must_be_2_bytes);
+
+#define SIMSIMD_DEREFERENCE(x) (*(x))
+#define SIMSIMD_EXPORT(x, y) *(y) = x
+
+/**
+ *  @brief  Returns the value of the half-precision floating-point number,
+ *          potentially decompressed into single-precision.
+ */
+#if !defined(SIMSIMD_F16_TO_F32)
+#if SIMSIMD_NATIVE_F16
+#define SIMSIMD_F16_TO_F32(x) (SIMSIMD_DEREFERENCE(x))
+#define SIMSIMD_F32_TO_F16(x, y) (SIMSIMD_EXPORT(x, y))
+#else
+#define SIMSIMD_F16_TO_F32(x) (simsimd_f16_to_f32(x))
+#define SIMSIMD_F32_TO_F16(x, y) (simsimd_f32_to_f16(x, y))
+#endif
+#endif
+
+/**
+ *  @brief  Returns the value of the half-precision brain floating-point number,
+ *          potentially decompressed into single-precision.
+ */
+#if !defined(SIMSIMD_BF16_TO_F32)
+#if SIMSIMD_NATIVE_BF16
+#define SIMSIMD_BF16_TO_F32(x) (SIMSIMD_DEREFERENCE(x))
+#define SIMSIMD_F32_TO_BF16(x, y) (SIMSIMD_EXPORT(x, y))
+#else
+#define SIMSIMD_BF16_TO_F32(x) (simsimd_bf16_to_f32(x))
+#define SIMSIMD_F32_TO_BF16(x, y) (simsimd_f32_to_bf16(x, y))
+#endif
+#endif
+
+#if !defined(SIMSIMD_F32_TO_I8)
+#define SIMSIMD_F32_TO_I8(x, y)                                                                    \
+    *(y) = (simsimd_i8_t)((x) > 127 ? 127 :                                                        \
+                                      ((x) < -128 ? -128 : (int)((x) + ((x) < 0 ? -0.5f : 0.5f))))
+#endif
+#if !defined(SIMSIMD_F32_TO_U8)
+#define SIMSIMD_F32_TO_U8(x, y)                                                                    \
+    *(y) = (simsimd_u8_t)((x) > 255 ? 255 : ((x) < 0 ? 0 : (int)((x) + ((x) < 0 ? -0.5f : 0.5f))))
+#endif
+#if !defined(SIMSIMD_F64_TO_I8)
+#define SIMSIMD_F64_TO_I8(x, y)                                                                    \
+    *(y) = (simsimd_i8_t)((x) > 127 ? 127 :                                                        \
+                                      ((x) < -128 ? -128 : (int)((x) + ((x) < 0 ? -0.5 : 0.5))))
+#endif
+#if !defined(SIMSIMD_F64_TO_U8)
+#define SIMSIMD_F64_TO_U8(x, y)                                                                    \
+    *(y) = (simsimd_u8_t)((x) > 255 ? 255 : ((x) < 0 ? 0 : (int)((x) + ((x) < 0 ? -0.5 : 0.5))))
+#endif
+
+/** @brief  Convenience type for half-precision floating-point type conversions. */
+typedef union {
+    unsigned i;
+    float f;
+} simsimd_f32i32_t;
+
+/** @brief  Convenience type addressing the real and imaginary parts of a half-precision complex
+ * number. */
+typedef struct {
+    simsimd_f16_t real;
+    simsimd_f16_t imag;
+} simsimd_f16c_t;
+
+/** @brief  Convenience type addressing the real and imaginary parts of a half-precision brain-float
+ * complex number. */
+typedef struct {
+    simsimd_bf16_t real;
+    simsimd_bf16_t imag;
+} simsimd_bf16c_t;
+
+/** @brief  Convenience type addressing the real and imaginary parts of a single-precision complex
+ * number. */
+typedef struct {
+    simsimd_f32_t real;
+    simsimd_f32_t imag;
+} simsimd_f32c_t;
+
+/** @brief  Convenience type addressing the real and imaginary parts of a double-precision complex
+ * number. */
+typedef struct {
+    simsimd_f64_t real;
+    simsimd_f64_t imag;
+} simsimd_f64c_t;
+
+/**
+ *  @brief  Computes `1/sqrt(x)` using the trick from Quake 3,
+ *          replacing the magic numbers with the ones suggested by Jan Kadlec.
+ *
+ *  Subsequent additions by hardware manufacturers have made this algorithm redundant for the most
+ * part. For example, on x86, Intel introduced the SSE instruction `rsqrtss` in 1999. In a 2009
+ * benchmark on the Intel Core 2, this instruction took 0.85ns per float compared to 3.54ns for the
+ * fast inverse square root algorithm, and had less error. Carmack's Magic Number `rsqrt` had an
+ * average error of 0.0990%, while SSE `rsqrtss` had 0.0094%, a 10x improvement.
+ *
+ *  https://web.archive.org/web/20210208132927/http://assemblyrequired.crashworks.org/timing-square-root/
+ *  https://stackoverflow.com/a/41460625/2766161
+ */
+SIMSIMD_INTERNAL simsimd_f32_t simsimd_approximate_inverse_square_root(simsimd_f32_t number) {
+    simsimd_f32i32_t conv;
+    conv.f = number;
+    conv.i = 0x5F1FFFF9 - (conv.i >> 1);
+    // Refine using a Newton-Raphson step for better accuracy
+    conv.f *= 0.703952253f * (2.38924456f - number * conv.f * conv.f);
+    return conv.f;
+}
+
+/**
+ *  @brief  Approximates `sqrt(x)` using the fast inverse square root trick
+ *          with adjustments for direct square root approximation.
+ *
+ *  Similar to `rsqrt` approximation but multiplies by `number` to get `sqrt`.
+ *  This technique is useful where `sqrt` approximation is needed in performance-critical code,
+ *  though modern hardware provides optimized alternatives.
+ */
+SIMSIMD_INTERNAL simsimd_f32_t simsimd_approximate_square_root(simsimd_f32_t number) {
+    return number * simsimd_approximate_inverse_square_root(number);
+}
+
+/**
+ *  @brief  Computes `log(x)` using the Mercator series.
+ *          The series converges to the natural logarithm for args between -1 and 1.
+ *          Published in 1668 in "Logarithmotechnia".
+ */
+SIMSIMD_INTERNAL simsimd_f32_t simsimd_approximate_log(simsimd_f32_t number) {
+    simsimd_f32_t x = number - 1;
+    simsimd_f32_t x2 = x * x;
+    simsimd_f32_t x3 = x * x * x;
+    return x - x2 / 2 + x3 / 3;
+}
+
+/**
+ *  @brief  For compilers that don't natively support the `_Float16` type,
+ *          upcasts contents into a more conventional `float`.
+ *
+ *  @warning  This function won't handle boundary conditions well.
+ *
+ *  https://stackoverflow.com/a/60047308
+ *  https://gist.github.com/milhidaka/95863906fe828198f47991c813dbe233
+ *  https://github.com/OpenCyphal/libcanard/blob/636795f4bc395f56af8d2c61d3757b5e762bb9e5/canard.c#L811-L834
+ */
+SIMSIMD_INTERNAL simsimd_f32_t simsimd_f16_to_f32(simsimd_f16_t const* x_ptr) {
+    unsigned short x = *(unsigned short const*)x_ptr;
+    unsigned int exponent = (x & 0x7C00) >> 10;
+    unsigned int mantissa = (x & 0x03FF) << 13;
+    simsimd_f32i32_t mantissa_conv;
+    mantissa_conv.f = (float)mantissa;
+    unsigned int v = (mantissa_conv.i) >> 23;
+    simsimd_f32i32_t conv;
+    conv.i = (x & 0x8000) << 16 | (exponent != 0) * ((exponent + 112) << 23 | mantissa) |
+             ((exponent == 0) & (mantissa != 0)) *
+                 ((v - 37) << 23 | ((mantissa << (150 - v)) & 0x007FE000));
+    return conv.f;
+}
+
+/**
+ *  @brief  Compresses a `float` to an `f16` representation (IEEE-754 16-bit floating-point format).
+ *
+ *  @warning  This function won't handle boundary conditions well.
+ *
+ *  https://stackoverflow.com/a/60047308
+ *  https://gist.github.com/milhidaka/95863906fe828198f47991c813dbe233
+ *  https://github.com/OpenCyphal/libcanard/blob/636795f4bc395f56af8d2c61d3757b5e762bb9e5/canard.c#L811-L834
+ */
+SIMSIMD_INTERNAL void simsimd_f32_to_f16(simsimd_f32_t x, simsimd_f16_t* result_ptr) {
+    simsimd_f32i32_t conv;
+    conv.f = x;
+    unsigned int b = conv.i + 0x00001000;
+    unsigned int e = (b & 0x7F800000) >> 23;
+    unsigned int m = b & 0x007FFFFF;
+    unsigned short result = ((b & 0x80000000) >> 16) |
+                            (e > 112) * ((((e - 112) << 10) & 0x7C00) | (m >> 13)) |
+                            ((e < 113) & (e > 101)) * ((((0x007FF000 + m) >> (125 - e)) + 1) >> 1) |
+                            ((e > 143) * 0x7FFF);
+    *(unsigned short*)result_ptr = result;
+}
+
+/**
+ *  @brief  For compilers that don't natively support the `__bf16` type,
+ *          upcasts contents into a more conventional `float`.
+ *
+ *  https://stackoverflow.com/questions/55253233/convert-fp32-to-bfloat16-in-c/55254307#55254307
+ *  https://cloud.google.com/blog/products/ai-machine-learning/bfloat16-the-secret-to-high-performance-on-cloud-tpus
+ */
+SIMSIMD_INTERNAL simsimd_f32_t simsimd_bf16_to_f32(simsimd_bf16_t const* x_ptr) {
+    unsigned short x = *(unsigned short const*)x_ptr;
+    simsimd_f32i32_t conv;
+    conv.i = x << 16; // Zero extends the mantissa
+    return conv.f;
+}
+
+/**
+ *  @brief  Compresses a `float` to a `bf16` representation.
+ *
+ *  https://stackoverflow.com/questions/55253233/convert-fp32-to-bfloat16-in-c/55254307#55254307
+ *  https://cloud.google.com/blog/products/ai-machine-learning/bfloat16-the-secret-to-high-performance-on-cloud-tpus
+ */
+SIMSIMD_INTERNAL void simsimd_f32_to_bf16(simsimd_f32_t x, simsimd_bf16_t* result_ptr) {
+    simsimd_f32i32_t conv;
+    conv.f = x;
+    conv.i += 0x8000; // Rounding is optional
+    conv.i >>= 16;
+    // The top 16 bits will be zeroed out anyways
+    // conv.i &= 0xFFFF;
+    *(unsigned short*)result_ptr = (unsigned short)conv.i;
+}
+
+SIMSIMD_INTERNAL simsimd_u32_t simsimd_u32_rol(simsimd_u32_t x, int n) {
+    return (x << n) | (x >> (32 - n));
+}
+SIMSIMD_INTERNAL simsimd_u16_t simsimd_u16_rol(simsimd_u16_t x, int n) {
+    return (x << n) | (x >> (16 - n));
+}
+SIMSIMD_INTERNAL simsimd_u8_t simsimd_u8_rol(simsimd_u8_t x, int n) {
+    return (x << n) | (x >> (8 - n));
+}
+SIMSIMD_INTERNAL simsimd_u32_t simsimd_u32_ror(simsimd_u32_t x, int n) {
+    return (x >> n) | (x << (32 - n));
+}
+SIMSIMD_INTERNAL simsimd_u16_t simsimd_u16_ror(simsimd_u16_t x, int n) {
+    return (x >> n) | (x << (16 - n));
+}
+SIMSIMD_INTERNAL simsimd_u8_t simsimd_u8_ror(simsimd_u8_t x, int n) {
+    return (x >> n) | (x << (8 - n));
+}
+
+#ifdef __cplusplus
+} // extern "C"
+#endif
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/lib.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/lib.c
new file mode 100644
index 0000000000..b414ba22fe
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/simsimd/lib.c
@@ -0,0 +1,348 @@
+/**
+ *  @brief  Dynamic dispatch library for SimSIMD.
+ *  @note   Compile with the most recent compiler available.
+ *  @file   lib.c
+ */
+#define SIMSIMD_DYNAMIC_DISPATCH 1
+#define SIMSIMD_NATIVE_F16 0
+#define SIMSIMD_NATIVE_BF16 0
+
+/*  Depending on the Operating System, the following intrinsics are available
+ *  on recent compiler toolchains:
+ *
+ *  - Linux: everything is available in GCC 12+ and Clang 16+.
+ *  - Windows - MSVC: everything except Sapphire Rapids and ARM SVE.
+ *  - MacOS - Apple Clang: only Arm NEON and x86 AVX2 Haswell extensions are available.
+ */
+#if !defined(SIMSIMD_TARGET_NEON) && (defined(__APPLE__) || defined(__linux__))
+#define SIMSIMD_TARGET_NEON 1
+#endif
+#if !defined(SIMSIMD_TARGET_SVE) && (defined(__linux__))
+#define SIMSIMD_TARGET_SVE 1
+#endif
+#if !defined(SIMSIMD_TARGET_SVE2) && (defined(__linux__))
+#define SIMSIMD_TARGET_SVE2 1
+#endif
+#if !defined(SIMSIMD_TARGET_HASWELL) && (defined(_MSC_VER) || defined(__APPLE__) || defined(__linux__))
+#define SIMSIMD_TARGET_HASWELL 1
+#endif
+#if !defined(SIMSIMD_TARGET_SKYLAKE) && (defined(_MSC_VER) || defined(__linux__))
+#define SIMSIMD_TARGET_SKYLAKE 1
+#endif
+#if !defined(SIMSIMD_TARGET_ICE) && (defined(_MSC_VER) || defined(__linux__))
+#define SIMSIMD_TARGET_ICE 1
+#endif
+#if !defined(SIMSIMD_TARGET_GENOA) && (defined(__linux__))
+#define SIMSIMD_TARGET_GENOA 1
+#endif
+#if !defined(SIMSIMD_TARGET_SAPPHIRE) && (defined(__linux__))
+#define SIMSIMD_TARGET_SAPPHIRE 1
+#endif
+#if !defined(SIMSIMD_TARGET_TURIN) && (defined(__linux__))
+#define SIMSIMD_TARGET_TURIN 1
+#endif
+#if !defined(SIMSIMD_TARGET_SIERRA) && (defined(__linux__)) && 0 // TODO: Add target spec to GCC & Clang
+#define SIMSIMD_TARGET_SIERRA 1
+#endif
+
+#include <simsimd.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// Every time a function is called, it checks if the metric is already loaded. If not, it fetches it.
+// If no metric is found, it returns NaN. We can obtain NaN by dividing 0.0 by 0.0, but that annoys
+// the MSVC compiler. Instead we can directly write-in the signaling NaN (0x7FF0000000000001)
+// or the qNaN (0x7FF8000000000000).
+#define SIMSIMD_DECLARATION_DENSE(name, extension)                                                                    \
+    SIMSIMD_DYNAMIC void simsimd_##name##_##extension(simsimd_##extension##_t const *a,                               \
+                                                      simsimd_##extension##_t const *b, simsimd_size_t n,             \
+                                                      simsimd_distance_t *results) {                                  \
+        static simsimd_metric_dense_punned_t metric = 0;                                                              \
+        if (metric == 0) {                                                                                            \
+            simsimd_capability_t used_capability;                                                                     \
+            simsimd_find_kernel_punned(simsimd_metric_##name##_k, simsimd_datatype_##extension##_k,                   \
+                                       simsimd_capabilities(), simsimd_cap_any_k, (simsimd_kernel_punned_t *)&metric, \
+                                       &used_capability);                                                             \
+            if (!metric) {                                                                                            \
+                *(simsimd_u64_t *)results = 0x7FF0000000000001ull;                                                    \
+                return;                                                                                               \
+            }                                                                                                         \
+        }                                                                                                             \
+        metric(a, b, n, results);                                                                                     \
+    }
+
+#define SIMSIMD_DECLARATION_SPARSE(name, extension, type)                                                       \
+    SIMSIMD_DYNAMIC void simsimd_##name##_##extension(simsimd_##type##_t const *a, simsimd_##type##_t const *b, \
+                                                      simsimd_size_t a_length, simsimd_size_t b_length,         \
+                                                      simsimd_distance_t *result) {                             \
+        static simsimd_metric_sparse_punned_t metric = 0;                                                       \
+        if (metric == 0) {                                                                                      \
+            simsimd_capability_t used_capability;                                                               \
+            simsimd_find_kernel_punned(simsimd_metric_##name##_k, simsimd_datatype_##extension##_k,             \
+                                       simsimd_capabilities(), simsimd_cap_any_k,                               \
+                                       (simsimd_kernel_punned_t *)(&metric), &used_capability);                 \
+            if (!metric) {                                                                                      \
+                *(simsimd_u64_t *)result = 0x7FF0000000000001ull;                                               \
+                return;                                                                                         \
+            }                                                                                                   \
+        }                                                                                                       \
+        metric(a, b, a_length, b_length, result);                                                               \
+    }
+
+#define SIMSIMD_DECLARATION_CURVED(name, extension)                                                           \
+    SIMSIMD_DYNAMIC void simsimd_##name##_##extension(                                                        \
+        simsimd_##extension##_t const *a, simsimd_##extension##_t const *b, simsimd_##extension##_t const *c, \
+        simsimd_size_t n, simsimd_distance_t *result) {                                                       \
+        static simsimd_metric_curved_punned_t metric = 0;                                                     \
+        if (metric == 0) {                                                                                    \
+            simsimd_capability_t used_capability;                                                             \
+            simsimd_find_kernel_punned(simsimd_metric_##name##_k, simsimd_datatype_##extension##_k,           \
+                                       simsimd_capabilities(), simsimd_cap_any_k,                             \
+                                       (simsimd_kernel_punned_t *)(&metric), &used_capability);               \
+            if (!metric) {                                                                                    \
+                *(simsimd_u64_t *)result = 0x7FF0000000000001ull;                                             \
+                return;                                                                                       \
+            }                                                                                                 \
+        }                                                                                                     \
+        metric(a, b, c, n, result);                                                                           \
+    }
+
+#define SIMSIMD_DECLARATION_FMA(name, extension)                                                                \
+    SIMSIMD_DYNAMIC void simsimd_##name##_##extension(                                                          \
+        simsimd_##extension##_t const *a, simsimd_##extension##_t const *b, simsimd_##extension##_t const *c,   \
+        simsimd_size_t n, simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_##extension##_t *result) { \
+        static simsimd_kernel_fma_punned_t metric = 0;                                                          \
+        if (metric == 0) {                                                                                      \
+            simsimd_capability_t used_capability;                                                               \
+            simsimd_find_kernel_punned(simsimd_metric_##name##_k, simsimd_datatype_##extension##_k,             \
+                                       simsimd_capabilities(), simsimd_cap_any_k,                               \
+                                       (simsimd_kernel_punned_t *)(&metric), &used_capability);                 \
+        }                                                                                                       \
+        metric(a, b, c, n, alpha, beta, result);                                                                \
+    }
+
+#define SIMSIMD_DECLARATION_WSUM(name, extension)                                                   \
+    SIMSIMD_DYNAMIC void simsimd_##name##_##extension(                                              \
+        simsimd_##extension##_t const *a, simsimd_##extension##_t const *b, simsimd_size_t n,       \
+        simsimd_distance_t alpha, simsimd_distance_t beta, simsimd_##extension##_t *result) {       \
+        static simsimd_kernel_wsum_punned_t metric = 0;                                             \
+        if (metric == 0) {                                                                          \
+            simsimd_capability_t used_capability;                                                   \
+            simsimd_find_kernel_punned(simsimd_metric_##name##_k, simsimd_datatype_##extension##_k, \
+                                       simsimd_capabilities(), simsimd_cap_any_k,                   \
+                                       (simsimd_kernel_punned_t *)(&metric), &used_capability);     \
+        }                                                                                           \
+        metric(a, b, n, alpha, beta, result);                                                       \
+    }
+
+// Dot products
+SIMSIMD_DECLARATION_DENSE(dot, i8)
+SIMSIMD_DECLARATION_DENSE(dot, u8)
+SIMSIMD_DECLARATION_DENSE(dot, f16)
+SIMSIMD_DECLARATION_DENSE(dot, bf16)
+SIMSIMD_DECLARATION_DENSE(dot, f32)
+SIMSIMD_DECLARATION_DENSE(dot, f64)
+SIMSIMD_DECLARATION_DENSE(dot, f16c)
+SIMSIMD_DECLARATION_DENSE(dot, bf16c)
+SIMSIMD_DECLARATION_DENSE(dot, f32c)
+SIMSIMD_DECLARATION_DENSE(dot, f64c)
+SIMSIMD_DECLARATION_DENSE(vdot, f16c)
+SIMSIMD_DECLARATION_DENSE(vdot, bf16c)
+SIMSIMD_DECLARATION_DENSE(vdot, f32c)
+SIMSIMD_DECLARATION_DENSE(vdot, f64c)
+
+// Spatial distances
+SIMSIMD_DECLARATION_DENSE(cos, i8)
+SIMSIMD_DECLARATION_DENSE(cos, u8)
+SIMSIMD_DECLARATION_DENSE(cos, f16)
+SIMSIMD_DECLARATION_DENSE(cos, bf16)
+SIMSIMD_DECLARATION_DENSE(cos, f32)
+SIMSIMD_DECLARATION_DENSE(cos, f64)
+SIMSIMD_DECLARATION_DENSE(l2sq, i8)
+SIMSIMD_DECLARATION_DENSE(l2sq, u8)
+SIMSIMD_DECLARATION_DENSE(l2sq, f16)
+SIMSIMD_DECLARATION_DENSE(l2sq, bf16)
+SIMSIMD_DECLARATION_DENSE(l2sq, f32)
+SIMSIMD_DECLARATION_DENSE(l2sq, f64)
+SIMSIMD_DECLARATION_DENSE(l2, i8)
+SIMSIMD_DECLARATION_DENSE(l2, u8)
+SIMSIMD_DECLARATION_DENSE(l2, f16)
+SIMSIMD_DECLARATION_DENSE(l2, bf16)
+SIMSIMD_DECLARATION_DENSE(l2, f32)
+SIMSIMD_DECLARATION_DENSE(l2, f64)
+
+// Binary distances
+SIMSIMD_DECLARATION_DENSE(hamming, b8)
+SIMSIMD_DECLARATION_DENSE(jaccard, b8)
+
+// Probability distributions
+SIMSIMD_DECLARATION_DENSE(kl, f16)
+SIMSIMD_DECLARATION_DENSE(kl, bf16)
+SIMSIMD_DECLARATION_DENSE(kl, f32)
+SIMSIMD_DECLARATION_DENSE(kl, f64)
+SIMSIMD_DECLARATION_DENSE(js, f16)
+SIMSIMD_DECLARATION_DENSE(js, bf16)
+SIMSIMD_DECLARATION_DENSE(js, f32)
+SIMSIMD_DECLARATION_DENSE(js, f64)
+
+// Sparse sets
+SIMSIMD_DECLARATION_SPARSE(intersect, u16, u16)
+SIMSIMD_DECLARATION_SPARSE(intersect, u32, u32)
+
+// Curved spaces
+SIMSIMD_DECLARATION_CURVED(bilinear, f64)
+SIMSIMD_DECLARATION_CURVED(bilinear, f64c)
+SIMSIMD_DECLARATION_CURVED(mahalanobis, f64)
+SIMSIMD_DECLARATION_CURVED(bilinear, f32)
+SIMSIMD_DECLARATION_CURVED(bilinear, f32c)
+SIMSIMD_DECLARATION_CURVED(mahalanobis, f32)
+SIMSIMD_DECLARATION_CURVED(bilinear, f16)
+SIMSIMD_DECLARATION_CURVED(bilinear, f16c)
+SIMSIMD_DECLARATION_CURVED(mahalanobis, f16)
+SIMSIMD_DECLARATION_CURVED(bilinear, bf16)
+SIMSIMD_DECLARATION_CURVED(bilinear, bf16c)
+SIMSIMD_DECLARATION_CURVED(mahalanobis, bf16)
+
+// Element-wise operations
+SIMSIMD_DECLARATION_FMA(fma, f64)
+SIMSIMD_DECLARATION_FMA(fma, f32)
+SIMSIMD_DECLARATION_FMA(fma, f16)
+SIMSIMD_DECLARATION_FMA(fma, bf16)
+SIMSIMD_DECLARATION_FMA(fma, i8)
+SIMSIMD_DECLARATION_FMA(fma, u8)
+SIMSIMD_DECLARATION_WSUM(wsum, f64)
+SIMSIMD_DECLARATION_WSUM(wsum, f32)
+SIMSIMD_DECLARATION_WSUM(wsum, f16)
+SIMSIMD_DECLARATION_WSUM(wsum, bf16)
+SIMSIMD_DECLARATION_WSUM(wsum, i8)
+SIMSIMD_DECLARATION_WSUM(wsum, u8)
+
+SIMSIMD_DYNAMIC int simsimd_uses_neon(void) { return (simsimd_capabilities() & simsimd_cap_neon_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_neon_f16(void) { return (simsimd_capabilities() & simsimd_cap_neon_f16_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_neon_bf16(void) { return (simsimd_capabilities() & simsimd_cap_neon_bf16_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_neon_i8(void) { return (simsimd_capabilities() & simsimd_cap_neon_i8_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_sve(void) { return (simsimd_capabilities() & simsimd_cap_sve_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_sve_f16(void) { return (simsimd_capabilities() & simsimd_cap_sve_f16_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_sve_bf16(void) { return (simsimd_capabilities() & simsimd_cap_sve_bf16_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_sve_i8(void) { return (simsimd_capabilities() & simsimd_cap_sve_i8_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_haswell(void) { return (simsimd_capabilities() & simsimd_cap_haswell_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_skylake(void) { return (simsimd_capabilities() & simsimd_cap_skylake_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_ice(void) { return (simsimd_capabilities() & simsimd_cap_ice_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_genoa(void) { return (simsimd_capabilities() & simsimd_cap_genoa_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_sapphire(void) { return (simsimd_capabilities() & simsimd_cap_sapphire_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_turin(void) { return (simsimd_capabilities() & simsimd_cap_turin_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_sierra(void) { return (simsimd_capabilities() & simsimd_cap_sierra_k) != 0; }
+SIMSIMD_DYNAMIC int simsimd_uses_dynamic_dispatch(void) { return 1; }
+//SIMSIMD_DYNAMIC int simsimd_flush_denormals(void) { return _simsimd_flush_denormals(); }
+
+SIMSIMD_DYNAMIC simsimd_capability_t simsimd_capabilities(void) {
+    //! The latency of the CPUID instruction can be over 100 cycles, so we cache the result.
+    static simsimd_capability_t static_capabilities = simsimd_cap_any_k;
+    if (static_capabilities != simsimd_cap_any_k) return static_capabilities;
+
+    static_capabilities = _simsimd_capabilities_implementation();
+
+    // In multithreaded applications we need to ensure that the function pointers are pre-initialized,
+    // so the first time we are probing for capabilities, we should also probe all of our metrics
+    // with dummy inputs:
+    simsimd_distance_t dummy_results_buffer[2];
+    simsimd_distance_t *dummy_results = &dummy_results_buffer[0];
+    void *x = 0;
+
+    // Dense:
+    simsimd_dot_i8((simsimd_i8_t *)x, (simsimd_i8_t *)x, 0, dummy_results);
+    simsimd_dot_u8((simsimd_u8_t *)x, (simsimd_u8_t *)x, 0, dummy_results);
+    simsimd_dot_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, dummy_results);
+    simsimd_dot_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, dummy_results);
+    simsimd_dot_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, dummy_results);
+    simsimd_dot_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, dummy_results);
+
+    simsimd_dot_f16c((simsimd_f16c_t *)x, (simsimd_f16c_t *)x, 0, dummy_results);
+    simsimd_dot_bf16c((simsimd_bf16c_t *)x, (simsimd_bf16c_t *)x, 0, dummy_results);
+    simsimd_dot_f32c((simsimd_f32c_t *)x, (simsimd_f32c_t *)x, 0, dummy_results);
+    simsimd_dot_f64c((simsimd_f64c_t *)x, (simsimd_f64c_t *)x, 0, dummy_results);
+    simsimd_vdot_f16c((simsimd_f16c_t *)x, (simsimd_f16c_t *)x, 0, dummy_results);
+    simsimd_vdot_bf16c((simsimd_bf16c_t *)x, (simsimd_bf16c_t *)x, 0, dummy_results);
+    simsimd_vdot_f32c((simsimd_f32c_t *)x, (simsimd_f32c_t *)x, 0, dummy_results);
+    simsimd_vdot_f64c((simsimd_f64c_t *)x, (simsimd_f64c_t *)x, 0, dummy_results);
+
+    simsimd_cos_i8((simsimd_i8_t *)x, (simsimd_i8_t *)x, 0, dummy_results);
+    simsimd_cos_u8((simsimd_u8_t *)x, (simsimd_u8_t *)x, 0, dummy_results);
+    simsimd_cos_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, dummy_results);
+    simsimd_cos_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, dummy_results);
+    simsimd_cos_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, dummy_results);
+    simsimd_cos_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, dummy_results);
+
+    simsimd_l2sq_i8((simsimd_i8_t *)x, (simsimd_i8_t *)x, 0, dummy_results);
+    simsimd_l2sq_u8((simsimd_u8_t *)x, (simsimd_u8_t *)x, 0, dummy_results);
+    simsimd_l2sq_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, dummy_results);
+    simsimd_l2sq_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, dummy_results);
+    simsimd_l2sq_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, dummy_results);
+    simsimd_l2sq_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, dummy_results);
+
+    simsimd_l2_i8((simsimd_i8_t *)x, (simsimd_i8_t *)x, 0, dummy_results);
+    simsimd_l2_i8((simsimd_i8_t *)x, (simsimd_i8_t *)x, 0, dummy_results);
+    simsimd_l2_u8((simsimd_u8_t *)x, (simsimd_u8_t *)x, 0, dummy_results);
+    simsimd_l2_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, dummy_results);
+    simsimd_l2_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, dummy_results);
+    simsimd_l2_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, dummy_results);
+    simsimd_l2_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, dummy_results);
+
+    simsimd_hamming_b8((simsimd_b8_t *)x, (simsimd_b8_t *)x, 0, dummy_results);
+    simsimd_jaccard_b8((simsimd_b8_t *)x, (simsimd_b8_t *)x, 0, dummy_results);
+
+    simsimd_kl_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, dummy_results);
+    simsimd_kl_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, dummy_results);
+    simsimd_kl_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, dummy_results);
+    simsimd_kl_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, dummy_results);
+    simsimd_js_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, dummy_results);
+    simsimd_js_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, dummy_results);
+    simsimd_js_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, dummy_results);
+    simsimd_js_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, dummy_results);
+
+    // Sparse
+    simsimd_intersect_u16((simsimd_u16_t *)x, (simsimd_u16_t *)x, 0, 0, dummy_results);
+    simsimd_intersect_u32((simsimd_u32_t *)x, (simsimd_u32_t *)x, 0, 0, dummy_results);
+
+    // Curved:
+    simsimd_bilinear_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, dummy_results);
+    simsimd_mahalanobis_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, dummy_results);
+    simsimd_bilinear_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, dummy_results);
+    simsimd_mahalanobis_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, dummy_results);
+    simsimd_bilinear_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, dummy_results);
+    simsimd_mahalanobis_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, dummy_results);
+    simsimd_bilinear_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, dummy_results);
+    simsimd_mahalanobis_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, dummy_results);
+
+    // Elementwise
+    simsimd_wsum_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, 0, 0, (simsimd_f64_t *)x);
+    simsimd_wsum_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, 0, 0, (simsimd_f32_t *)x);
+    simsimd_wsum_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, 0, 0, (simsimd_f16_t *)x);
+    simsimd_wsum_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, 0, 0, (simsimd_bf16_t *)x);
+    simsimd_wsum_i8((simsimd_i8_t *)x, (simsimd_i8_t *)x, 0, 0, 0, (simsimd_i8_t *)x);
+    simsimd_wsum_u8((simsimd_u8_t *)x, (simsimd_u8_t *)x, 0, 0, 0, (simsimd_u8_t *)x);
+    simsimd_fma_f64((simsimd_f64_t *)x, (simsimd_f64_t *)x, (simsimd_f64_t *)x, 0, 0, 0, (simsimd_f64_t *)x);
+    simsimd_fma_f32((simsimd_f32_t *)x, (simsimd_f32_t *)x, (simsimd_f32_t *)x, 0, 0, 0, (simsimd_f32_t *)x);
+    simsimd_fma_f16((simsimd_f16_t *)x, (simsimd_f16_t *)x, (simsimd_f16_t *)x, 0, 0, 0, (simsimd_f16_t *)x);
+    simsimd_fma_bf16((simsimd_bf16_t *)x, (simsimd_bf16_t *)x, (simsimd_bf16_t *)x, 0, 0, 0, (simsimd_bf16_t *)x);
+    simsimd_fma_i8((simsimd_i8_t *)x, (simsimd_i8_t *)x, (simsimd_i8_t *)x, 0, 0, 0, (simsimd_i8_t *)x);
+    simsimd_fma_u8((simsimd_u8_t *)x, (simsimd_u8_t *)x, (simsimd_u8_t *)x, 0, 0, 0, (simsimd_u8_t *)x);
+
+    return static_capabilities;
+}
+
+SIMSIMD_DYNAMIC void simsimd_find_kernel_punned( //
+    simsimd_metric_kind_t kind,                  //
+    simsimd_datatype_t datatype,                 //
+    simsimd_capability_t supported,              //
+    simsimd_capability_t allowed,                //
+    simsimd_kernel_punned_t *kernel_output,      //
+    simsimd_capability_t *capability_output) {
+    _simsimd_find_kernel_punned_implementation(kind, datatype, supported, allowed, kernel_output, capability_output);
+}
+
+#ifdef __cplusplus
+}
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/CMakeLists.txt
new file mode 100644
index 0000000000..2486e01b27
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/CMakeLists.txt
@@ -0,0 +1,6 @@
+add_library(snappy
+    STATIC
+    snappy.cc
+    snappy-sinksource.cc)
+
+target_include_directories(snappy PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/LICENSE
new file mode 100644
index 0000000000..bd0e5971db
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/LICENSE
@@ -0,0 +1,54 @@
+Copyright 2011, Google Inc.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+    * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+    * Neither the name of Google Inc. nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+===
+
+Some of the benchmark data in testdata/ is licensed differently:
+
+ - fireworks.jpeg is Copyright 2013 Steinar H. Gunderson, and
+   is licensed under the Creative Commons Attribution 3.0 license
+   (CC-BY-3.0). See https://creativecommons.org/licenses/by/3.0/
+   for more information.
+
+ - kppkn.gtb is taken from the Gaviota chess tablebase set, and
+   is licensed under the MIT License. See
+   https://sites.google.com/site/gaviotachessengine/Home/endgame-tablebases-1
+   for more information.
+
+ - paper-100k.pdf is an excerpt (bytes 92160 to 194560) from the paper
+   “Combinatorial Modeling of Chromatin Features Quantitatively Predicts DNA
+   Replication Timing in _Drosophila_” by Federico Comoglio and Renato Paro,
+   which is licensed under the CC-BY license. See
+   http://www.ploscompbiol.org/static/license for more ifnormation.
+
+ - alice29.txt, asyoulik.txt, plrabn12.txt and lcet10.txt are from Project
+   Gutenberg. The first three have expired copyrights and are in the public
+   domain; the latter does not have expired copyright, but is still in the
+   public domain according to the license information
+   (http://www.gutenberg.org/ebooks/53).
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-internal.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-internal.h
new file mode 100755
index 0000000000..9b568be08c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-internal.h
@@ -0,0 +1,647 @@
+// Copyright 2008 Google Inc. All Rights Reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//     * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+// Internals shared between the Snappy implementation and its unittest.
+
+#ifndef THIRD_PARTY_SNAPPY_SNAPPY_INTERNAL_H_
+#define THIRD_PARTY_SNAPPY_SNAPPY_INTERNAL_H_
+
+#include "snappy_version.hpp"
+
+#if SNAPPY_NEW_VERSION
+
+#include <utility>
+
+#include "snappy-stubs-internal.h"
+
+#if SNAPPY_HAVE_SSSE3
+// Please do not replace with <x86intrin.h> or with headers that assume more
+// advanced SSE versions without checking with all the OWNERS.
+#include <emmintrin.h>
+#include <tmmintrin.h>
+#endif
+
+#if SNAPPY_HAVE_NEON
+#include <arm_neon.h>
+#endif
+
+#if SNAPPY_HAVE_SSSE3 || SNAPPY_HAVE_NEON
+#define SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE 1
+#else
+#define SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE 0
+#endif
+
+namespace lbug_snappy {
+namespace internal {
+
+#if SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+#if SNAPPY_HAVE_SSSE3
+using V128 = __m128i;
+#elif SNAPPY_HAVE_NEON
+using V128 = uint8x16_t;
+#endif
+
+// Load 128 bits of integer data. `src` must be 16-byte aligned.
+inline V128 V128_Load(const V128* src);
+
+// Load 128 bits of integer data. `src` does not need to be aligned.
+inline V128 V128_LoadU(const V128* src);
+
+// Store 128 bits of integer data. `dst` does not need to be aligned.
+inline void V128_StoreU(V128* dst, V128 val);
+
+// Shuffle packed 8-bit integers using a shuffle mask.
+// Each packed integer in the shuffle mask must be in [0,16).
+inline V128 V128_Shuffle(V128 input, V128 shuffle_mask);
+
+// Constructs V128 with 16 chars |c|.
+inline V128 V128_DupChar(char c);
+
+#if SNAPPY_HAVE_SSSE3
+inline V128 V128_Load(const V128* src) { return _mm_load_si128(src); }
+
+inline V128 V128_LoadU(const V128* src) { return _mm_loadu_si128(src); }
+
+inline void V128_StoreU(V128* dst, V128 val) { _mm_storeu_si128(dst, val); }
+
+inline V128 V128_Shuffle(V128 input, V128 shuffle_mask) {
+  return _mm_shuffle_epi8(input, shuffle_mask);
+}
+
+inline V128 V128_DupChar(char c) { return _mm_set1_epi8(c); }
+
+#elif SNAPPY_HAVE_NEON
+inline V128 V128_Load(const V128* src) {
+  return vld1q_u8(reinterpret_cast<const uint8_t*>(src));
+}
+
+inline V128 V128_LoadU(const V128* src) {
+  return vld1q_u8(reinterpret_cast<const uint8_t*>(src));
+}
+
+inline void V128_StoreU(V128* dst, V128 val) {
+  vst1q_u8(reinterpret_cast<uint8_t*>(dst), val);
+}
+
+inline V128 V128_Shuffle(V128 input, V128 shuffle_mask) {
+  assert(vminvq_u8(shuffle_mask) >= 0 && vmaxvq_u8(shuffle_mask) <= 15);
+  return vqtbl1q_u8(input, shuffle_mask);
+}
+
+inline V128 V128_DupChar(char c) { return vdupq_n_u8(c); }
+#endif
+#endif  // SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+
+// Working memory performs a single allocation to hold all scratch space
+// required for compression.
+class WorkingMemory {
+ public:
+  explicit WorkingMemory(size_t input_size);
+  ~WorkingMemory();
+
+  // Allocates and clears a hash table using memory in "*this",
+  // stores the number of buckets in "*table_size" and returns a pointer to
+  // the base of the hash table.
+  uint16_t* GetHashTable(size_t fragment_size, int* table_size) const;
+  char* GetScratchInput() const { return input_; }
+  char* GetScratchOutput() const { return output_; }
+
+ private:
+  char* mem_;        // the allocated memory, never nullptr
+  size_t size_;      // the size of the allocated memory, never 0
+  uint16_t* table_;  // the pointer to the hashtable
+  char* input_;      // the pointer to the input scratch buffer
+  char* output_;     // the pointer to the output scratch buffer
+
+  // No copying
+  WorkingMemory(const WorkingMemory&);
+  void operator=(const WorkingMemory&);
+};
+
+// Flat array compression that does not emit the "uncompressed length"
+// prefix. Compresses "input" string to the "*op" buffer.
+//
+// REQUIRES: "input_length <= kBlockSize"
+// REQUIRES: "op" points to an array of memory that is at least
+// "MaxCompressedLength(input_length)" in size.
+// REQUIRES: All elements in "table[0..table_size-1]" are initialized to zero.
+// REQUIRES: "table_size" is a power of two
+//
+// Returns an "end" pointer into "op" buffer.
+// "end - op" is the compressed size of "input".
+char* CompressFragment(const char* input,
+                       size_t input_length,
+                       char* op,
+                       uint16_t* table,
+                       const int table_size);
+
+// Find the largest n such that
+//
+//   s1[0,n-1] == s2[0,n-1]
+//   and n <= (s2_limit - s2).
+//
+// Return make_pair(n, n < 8).
+// Does not read *s2_limit or beyond.
+// Does not read *(s1 + (s2_limit - s2)) or beyond.
+// Requires that s2_limit >= s2.
+//
+// In addition populate *data with the next 5 bytes from the end of the match.
+// This is only done if 8 bytes are available (s2_limit - s2 >= 8). The point is
+// that on some arch's this can be done faster in this routine than subsequent
+// loading from s2 + n.
+//
+// Separate implementation for 64-bit, little-endian cpus.
+#if !SNAPPY_IS_BIG_ENDIAN && \
+    (defined(__x86_64__) || defined(_M_X64) || defined(ARCH_PPC) || \
+     defined(ARCH_ARM))
+static inline std::pair<size_t, bool> FindMatchLength(const char* s1,
+                                                      const char* s2,
+                                                      const char* s2_limit,
+                                                      uint64_t* data) {
+  assert(s2_limit >= s2);
+  size_t matched = 0;
+
+  // This block isn't necessary for correctness; we could just start looping
+  // immediately.  As an optimization though, it is useful.  It creates some not
+  // uncommon code paths that determine, without extra effort, whether the match
+  // length is less than 8.  In short, we are hoping to avoid a conditional
+  // branch, and perhaps get better code layout from the C++ compiler.
+  if (SNAPPY_PREDICT_TRUE(s2 <= s2_limit - 16)) {
+    uint64_t a1 = UNALIGNED_LOAD64(s1);
+    uint64_t a2 = UNALIGNED_LOAD64(s2);
+    if (SNAPPY_PREDICT_TRUE(a1 != a2)) {
+      // This code is critical for performance. The reason is that it determines
+      // how much to advance `ip` (s2). This obviously depends on both the loads
+      // from the `candidate` (s1) and `ip`. Furthermore the next `candidate`
+      // depends on the advanced `ip` calculated here through a load, hash and
+      // new candidate hash lookup (a lot of cycles). This makes s1 (ie.
+      // `candidate`) the variable that limits throughput. This is the reason we
+      // go through hoops to have this function update `data` for the next iter.
+      // The straightforward code would use *data, given by
+      //
+      // *data = UNALIGNED_LOAD64(s2 + matched_bytes) (Latency of 5 cycles),
+      //
+      // as input for the hash table lookup to find next candidate. However
+      // this forces the load on the data dependency chain of s1, because
+      // matched_bytes directly depends on s1. However matched_bytes is 0..7, so
+      // we can also calculate *data by
+      //
+      // *data = AlignRight(UNALIGNED_LOAD64(s2), UNALIGNED_LOAD64(s2 + 8),
+      //                    matched_bytes);
+      //
+      // The loads do not depend on s1 anymore and are thus off the bottleneck.
+      // The straightforward implementation on x86_64 would be to use
+      //
+      // shrd rax, rdx, cl  (cl being matched_bytes * 8)
+      //
+      // unfortunately shrd with a variable shift has a 4 cycle latency. So this
+      // only wins 1 cycle. The BMI2 shrx instruction is a 1 cycle variable
+      // shift instruction but can only shift 64 bits. If we focus on just
+      // obtaining the least significant 4 bytes, we can obtain this by
+      //
+      // *data = ConditionalMove(matched_bytes < 4, UNALIGNED_LOAD64(s2),
+      //     UNALIGNED_LOAD64(s2 + 4) >> ((matched_bytes & 3) * 8);
+      //
+      // Writen like above this is not a big win, the conditional move would be
+      // a cmp followed by a cmov (2 cycles) followed by a shift (1 cycle).
+      // However matched_bytes < 4 is equal to
+      // static_cast<uint32_t>(xorval) != 0. Writen that way, the conditional
+      // move (2 cycles) can execute in parallel with FindLSBSetNonZero64
+      // (tzcnt), which takes 3 cycles.
+      uint64_t xorval = a1 ^ a2;
+      int shift = Bits::FindLSBSetNonZero64(xorval);
+      size_t matched_bytes = shift >> 3;
+      uint64_t a3 = UNALIGNED_LOAD64(s2 + 4);
+#ifndef __x86_64__
+      a2 = static_cast<uint32_t>(xorval) == 0 ? a3 : a2;
+#else
+      // Ideally this would just be
+      //
+      // a2 = static_cast<uint32_t>(xorval) == 0 ? a3 : a2;
+      //
+      // However clang correctly infers that the above statement participates on
+      // a critical data dependency chain and thus, unfortunately, refuses to
+      // use a conditional move (it's tuned to cut data dependencies). In this
+      // case there is a longer parallel chain anyway AND this will be fairly
+      // unpredictable.
+      asm("testl %k2, %k2\n\t"
+          "cmovzq %1, %0\n\t"
+          : "+r"(a2)
+          : "r"(a3), "r"(xorval)
+          : "cc");
+#endif
+      *data = a2 >> (shift & (3 * 8));
+      return std::pair<size_t, bool>(matched_bytes, true);
+    } else {
+      matched = 8;
+      s2 += 8;
+    }
+  }
+  SNAPPY_PREFETCH(s1 + 64);
+  SNAPPY_PREFETCH(s2 + 64);
+
+  // Find out how long the match is. We loop over the data 64 bits at a
+  // time until we find a 64-bit block that doesn't match; then we find
+  // the first non-matching bit and use that to calculate the total
+  // length of the match.
+  while (SNAPPY_PREDICT_TRUE(s2 <= s2_limit - 16)) {
+    uint64_t a1 = UNALIGNED_LOAD64(s1 + matched);
+    uint64_t a2 = UNALIGNED_LOAD64(s2);
+    if (a1 == a2) {
+      s2 += 8;
+      matched += 8;
+    } else {
+      uint64_t xorval = a1 ^ a2;
+      int shift = Bits::FindLSBSetNonZero64(xorval);
+      size_t matched_bytes = shift >> 3;
+      uint64_t a3 = UNALIGNED_LOAD64(s2 + 4);
+#ifndef __x86_64__
+      a2 = static_cast<uint32_t>(xorval) == 0 ? a3 : a2;
+#else
+      asm("testl %k2, %k2\n\t"
+          "cmovzq %1, %0\n\t"
+          : "+r"(a2)
+          : "r"(a3), "r"(xorval)
+          : "cc");
+#endif
+      *data = a2 >> (shift & (3 * 8));
+      matched += matched_bytes;
+      assert(matched >= 8);
+      return std::pair<size_t, bool>(matched, false);
+    }
+  }
+  while (SNAPPY_PREDICT_TRUE(s2 < s2_limit)) {
+    if (s1[matched] == *s2) {
+      ++s2;
+      ++matched;
+    } else {
+      if (s2 <= s2_limit - 8) {
+        *data = UNALIGNED_LOAD64(s2);
+      }
+      return std::pair<size_t, bool>(matched, matched < 8);
+    }
+  }
+  return std::pair<size_t, bool>(matched, matched < 8);
+}
+#else
+static inline std::pair<size_t, bool> FindMatchLength(const char* s1,
+                                                      const char* s2,
+                                                      const char* s2_limit,
+                                                      uint64_t* data) {
+  // Implementation based on the x86-64 version, above.
+  assert(s2_limit >= s2);
+  int matched = 0;
+
+  while (s2 <= s2_limit - 4 &&
+         UNALIGNED_LOAD32(s2) == UNALIGNED_LOAD32(s1 + matched)) {
+    s2 += 4;
+    matched += 4;
+  }
+  if (LittleEndian::IsLittleEndian() && s2 <= s2_limit - 4) {
+    uint32_t x = UNALIGNED_LOAD32(s2) ^ UNALIGNED_LOAD32(s1 + matched);
+    int matching_bits = Bits::FindLSBSetNonZero(x);
+    matched += matching_bits >> 3;
+    s2 += matching_bits >> 3;
+  } else {
+    while ((s2 < s2_limit) && (s1[matched] == *s2)) {
+      ++s2;
+      ++matched;
+    }
+  }
+  if (s2 <= s2_limit - 8) *data = LittleEndian::Load64(s2);
+  return std::pair<size_t, bool>(matched, matched < 8);
+}
+#endif
+
+static inline size_t FindMatchLengthPlain(const char* s1, const char* s2,
+                                          const char* s2_limit) {
+  // Implementation based on the x86-64 version, above.
+  assert(s2_limit >= s2);
+  int matched = 0;
+
+  while (s2 <= s2_limit - 8 &&
+         UNALIGNED_LOAD64(s2) == UNALIGNED_LOAD64(s1 + matched)) {
+    s2 += 8;
+    matched += 8;
+  }
+  if (LittleEndian::IsLittleEndian() && s2 <= s2_limit - 8) {
+    uint64_t x = UNALIGNED_LOAD64(s2) ^ UNALIGNED_LOAD64(s1 + matched);
+    int matching_bits = Bits::FindLSBSetNonZero64(x);
+    matched += matching_bits >> 3;
+    s2 += matching_bits >> 3;
+  } else {
+    while ((s2 < s2_limit) && (s1[matched] == *s2)) {
+      ++s2;
+      ++matched;
+    }
+  }
+  return matched;
+}
+
+// Lookup tables for decompression code.  Give --snappy_dump_decompression_table
+// to the unit test to recompute char_table.
+
+enum {
+  LITERAL = 0,
+  COPY_1_BYTE_OFFSET = 1,  // 3 bit length + 3 bits of offset in opcode
+  COPY_2_BYTE_OFFSET = 2,
+  COPY_4_BYTE_OFFSET = 3
+};
+static const int kMaximumTagLength = 5;  // COPY_4_BYTE_OFFSET plus the actual offset.
+
+// Data stored per entry in lookup table:
+//      Range   Bits-used       Description
+//      ------------------------------------
+//      1..64   0..7            Literal/copy length encoded in opcode byte
+//      0..7    8..10           Copy offset encoded in opcode byte / 256
+//      0..4    11..13          Extra bytes after opcode
+//
+// We use eight bits for the length even though 7 would have sufficed
+// because of efficiency reasons:
+//      (1) Extracting a byte is faster than a bit-field
+//      (2) It properly aligns copy offset so we do not need a <<8
+static constexpr uint16_t char_table[256] = {
+    // clang-format off
+  0x0001, 0x0804, 0x1001, 0x2001, 0x0002, 0x0805, 0x1002, 0x2002,
+  0x0003, 0x0806, 0x1003, 0x2003, 0x0004, 0x0807, 0x1004, 0x2004,
+  0x0005, 0x0808, 0x1005, 0x2005, 0x0006, 0x0809, 0x1006, 0x2006,
+  0x0007, 0x080a, 0x1007, 0x2007, 0x0008, 0x080b, 0x1008, 0x2008,
+  0x0009, 0x0904, 0x1009, 0x2009, 0x000a, 0x0905, 0x100a, 0x200a,
+  0x000b, 0x0906, 0x100b, 0x200b, 0x000c, 0x0907, 0x100c, 0x200c,
+  0x000d, 0x0908, 0x100d, 0x200d, 0x000e, 0x0909, 0x100e, 0x200e,
+  0x000f, 0x090a, 0x100f, 0x200f, 0x0010, 0x090b, 0x1010, 0x2010,
+  0x0011, 0x0a04, 0x1011, 0x2011, 0x0012, 0x0a05, 0x1012, 0x2012,
+  0x0013, 0x0a06, 0x1013, 0x2013, 0x0014, 0x0a07, 0x1014, 0x2014,
+  0x0015, 0x0a08, 0x1015, 0x2015, 0x0016, 0x0a09, 0x1016, 0x2016,
+  0x0017, 0x0a0a, 0x1017, 0x2017, 0x0018, 0x0a0b, 0x1018, 0x2018,
+  0x0019, 0x0b04, 0x1019, 0x2019, 0x001a, 0x0b05, 0x101a, 0x201a,
+  0x001b, 0x0b06, 0x101b, 0x201b, 0x001c, 0x0b07, 0x101c, 0x201c,
+  0x001d, 0x0b08, 0x101d, 0x201d, 0x001e, 0x0b09, 0x101e, 0x201e,
+  0x001f, 0x0b0a, 0x101f, 0x201f, 0x0020, 0x0b0b, 0x1020, 0x2020,
+  0x0021, 0x0c04, 0x1021, 0x2021, 0x0022, 0x0c05, 0x1022, 0x2022,
+  0x0023, 0x0c06, 0x1023, 0x2023, 0x0024, 0x0c07, 0x1024, 0x2024,
+  0x0025, 0x0c08, 0x1025, 0x2025, 0x0026, 0x0c09, 0x1026, 0x2026,
+  0x0027, 0x0c0a, 0x1027, 0x2027, 0x0028, 0x0c0b, 0x1028, 0x2028,
+  0x0029, 0x0d04, 0x1029, 0x2029, 0x002a, 0x0d05, 0x102a, 0x202a,
+  0x002b, 0x0d06, 0x102b, 0x202b, 0x002c, 0x0d07, 0x102c, 0x202c,
+  0x002d, 0x0d08, 0x102d, 0x202d, 0x002e, 0x0d09, 0x102e, 0x202e,
+  0x002f, 0x0d0a, 0x102f, 0x202f, 0x0030, 0x0d0b, 0x1030, 0x2030,
+  0x0031, 0x0e04, 0x1031, 0x2031, 0x0032, 0x0e05, 0x1032, 0x2032,
+  0x0033, 0x0e06, 0x1033, 0x2033, 0x0034, 0x0e07, 0x1034, 0x2034,
+  0x0035, 0x0e08, 0x1035, 0x2035, 0x0036, 0x0e09, 0x1036, 0x2036,
+  0x0037, 0x0e0a, 0x1037, 0x2037, 0x0038, 0x0e0b, 0x1038, 0x2038,
+  0x0039, 0x0f04, 0x1039, 0x2039, 0x003a, 0x0f05, 0x103a, 0x203a,
+  0x003b, 0x0f06, 0x103b, 0x203b, 0x003c, 0x0f07, 0x103c, 0x203c,
+  0x0801, 0x0f08, 0x103d, 0x203d, 0x1001, 0x0f09, 0x103e, 0x203e,
+  0x1801, 0x0f0a, 0x103f, 0x203f, 0x2001, 0x0f0b, 0x1040, 0x2040,
+    // clang-format on
+};
+
+}  // end namespace internal
+}  // end namespace lbug_snappy
+
+#else // #if SNAPPY_NEW_VERSION
+
+#include "snappy-stubs-internal.h"
+
+namespace lbug_snappy {
+namespace internal {
+
+// Working memory performs a single allocation to hold all scratch space
+// required for compression.
+class WorkingMemory {
+ public:
+  explicit WorkingMemory(size_t input_size);
+  ~WorkingMemory();
+
+  // Allocates and clears a hash table using memory in "*this",
+  // stores the number of buckets in "*table_size" and returns a pointer to
+  // the base of the hash table.
+  uint16* GetHashTable(size_t fragment_size, int* table_size) const;
+  char* GetScratchInput() const { return input_; }
+  char* GetScratchOutput() const { return output_; }
+
+ private:
+  char* mem_;      // the allocated memory, never nullptr
+  size_t size_;    // the size of the allocated memory, never 0
+  uint16* table_;  // the pointer to the hashtable
+  char* input_;    // the pointer to the input scratch buffer
+  char* output_;   // the pointer to the output scratch buffer
+
+  // No copying
+  WorkingMemory(const WorkingMemory&);
+  void operator=(const WorkingMemory&);
+};
+
+// Flat array compression that does not emit the "uncompressed length"
+// prefix. Compresses "input" string to the "*op" buffer.
+//
+// REQUIRES: "input_length <= kBlockSize"
+// REQUIRES: "op" points to an array of memory that is at least
+// "MaxCompressedLength(input_length)" in size.
+// REQUIRES: All elements in "table[0..table_size-1]" are initialized to zero.
+// REQUIRES: "table_size" is a power of two
+//
+// Returns an "end" pointer into "op" buffer.
+// "end - op" is the compressed size of "input".
+char* CompressFragment(const char* input,
+                       size_t input_length,
+                       char* op,
+                       uint16* table,
+                       const int table_size);
+
+// Find the largest n such that
+//
+//   s1[0,n-1] == s2[0,n-1]
+//   and n <= (s2_limit - s2).
+//
+// Return make_pair(n, n < 8).
+// Does not read *s2_limit or beyond.
+// Does not read *(s1 + (s2_limit - s2)) or beyond.
+// Requires that s2_limit >= s2.
+//
+// Separate implementation for 64-bit, little-endian cpus.
+#if !defined(SNAPPY_IS_BIG_ENDIAN) && \
+    (defined(ARCH_K8) || defined(ARCH_PPC) || defined(ARCH_ARM))
+static inline std::pair<size_t, bool> FindMatchLength(const char* s1,
+                                                      const char* s2,
+                                                      const char* s2_limit) {
+  assert(s2_limit >= s2);
+  size_t matched = 0;
+
+  // This block isn't necessary for correctness; we could just start looping
+  // immediately.  As an optimization though, it is useful.  It creates some not
+  // uncommon code paths that determine, without extra effort, whether the match
+  // length is less than 8.  In short, we are hoping to avoid a conditional
+  // branch, and perhaps get better code layout from the C++ compiler.
+  if (SNAPPY_PREDICT_TRUE(s2 <= s2_limit - 8)) {
+    uint64 a1 = UNALIGNED_LOAD64(s1);
+    uint64 a2 = UNALIGNED_LOAD64(s2);
+    if (a1 != a2) {
+      return std::pair<size_t, bool>(Bits::FindLSBSetNonZero64(a1 ^ a2) >> 3,
+                                     true);
+    } else {
+      matched = 8;
+      s2 += 8;
+    }
+  }
+
+  // Find out how long the match is. We loop over the data 64 bits at a
+  // time until we find a 64-bit block that doesn't match; then we find
+  // the first non-matching bit and use that to calculate the total
+  // length of the match.
+  while (SNAPPY_PREDICT_TRUE(s2 <= s2_limit - 8)) {
+    if (UNALIGNED_LOAD64(s2) == UNALIGNED_LOAD64(s1 + matched)) {
+      s2 += 8;
+      matched += 8;
+    } else {
+      uint64 x = UNALIGNED_LOAD64(s2) ^ UNALIGNED_LOAD64(s1 + matched);
+      int matching_bits = Bits::FindLSBSetNonZero64(x);
+      matched += matching_bits >> 3;
+      assert(matched >= 8);
+      return std::pair<size_t, bool>(matched, false);
+    }
+  }
+  while (SNAPPY_PREDICT_TRUE(s2 < s2_limit)) {
+    if (s1[matched] == *s2) {
+      ++s2;
+      ++matched;
+    } else {
+      return std::pair<size_t, bool>(matched, matched < 8);
+    }
+  }
+  return std::pair<size_t, bool>(matched, matched < 8);
+}
+#else
+static inline std::pair<size_t, bool> FindMatchLength(const char* s1,
+                                                      const char* s2,
+                                                      const char* s2_limit) {
+  // Implementation based on the x86-64 version, above.
+  assert(s2_limit >= s2);
+  int matched = 0;
+
+  while (s2 <= s2_limit - 4 &&
+         UNALIGNED_LOAD32(s2) == UNALIGNED_LOAD32(s1 + matched)) {
+    s2 += 4;
+    matched += 4;
+  }
+  if (LittleEndian::IsLittleEndian() && s2 <= s2_limit - 4) {
+    uint32 x = UNALIGNED_LOAD32(s2) ^ UNALIGNED_LOAD32(s1 + matched);
+    int matching_bits = Bits::FindLSBSetNonZero(x);
+    matched += matching_bits >> 3;
+  } else {
+    while ((s2 < s2_limit) && (s1[matched] == *s2)) {
+      ++s2;
+      ++matched;
+    }
+  }
+  return std::pair<size_t, bool>(matched, matched < 8);
+}
+#endif
+
+// Lookup tables for decompression code.  Give --snappy_dump_decompression_table
+// to the unit test to recompute char_table.
+
+enum {
+  LITERAL = 0,
+  COPY_1_BYTE_OFFSET = 1,  // 3 bit length + 3 bits of offset in opcode
+  COPY_2_BYTE_OFFSET = 2,
+  COPY_4_BYTE_OFFSET = 3
+};
+static const int kMaximumTagLength = 5;  // COPY_4_BYTE_OFFSET plus the actual offset.
+
+// Data stored per entry in lookup table:
+//      Range   Bits-used       Description
+//      ------------------------------------
+//      1..64   0..7            Literal/copy length encoded in opcode byte
+//      0..7    8..10           Copy offset encoded in opcode byte / 256
+//      0..4    11..13          Extra bytes after opcode
+//
+// We use eight bits for the length even though 7 would have sufficed
+// because of efficiency reasons:
+//      (1) Extracting a byte is faster than a bit-field
+//      (2) It properly aligns copy offset so we do not need a <<8
+static const uint16 char_table[256] = {
+  0x0001, 0x0804, 0x1001, 0x2001, 0x0002, 0x0805, 0x1002, 0x2002,
+  0x0003, 0x0806, 0x1003, 0x2003, 0x0004, 0x0807, 0x1004, 0x2004,
+  0x0005, 0x0808, 0x1005, 0x2005, 0x0006, 0x0809, 0x1006, 0x2006,
+  0x0007, 0x080a, 0x1007, 0x2007, 0x0008, 0x080b, 0x1008, 0x2008,
+  0x0009, 0x0904, 0x1009, 0x2009, 0x000a, 0x0905, 0x100a, 0x200a,
+  0x000b, 0x0906, 0x100b, 0x200b, 0x000c, 0x0907, 0x100c, 0x200c,
+  0x000d, 0x0908, 0x100d, 0x200d, 0x000e, 0x0909, 0x100e, 0x200e,
+  0x000f, 0x090a, 0x100f, 0x200f, 0x0010, 0x090b, 0x1010, 0x2010,
+  0x0011, 0x0a04, 0x1011, 0x2011, 0x0012, 0x0a05, 0x1012, 0x2012,
+  0x0013, 0x0a06, 0x1013, 0x2013, 0x0014, 0x0a07, 0x1014, 0x2014,
+  0x0015, 0x0a08, 0x1015, 0x2015, 0x0016, 0x0a09, 0x1016, 0x2016,
+  0x0017, 0x0a0a, 0x1017, 0x2017, 0x0018, 0x0a0b, 0x1018, 0x2018,
+  0x0019, 0x0b04, 0x1019, 0x2019, 0x001a, 0x0b05, 0x101a, 0x201a,
+  0x001b, 0x0b06, 0x101b, 0x201b, 0x001c, 0x0b07, 0x101c, 0x201c,
+  0x001d, 0x0b08, 0x101d, 0x201d, 0x001e, 0x0b09, 0x101e, 0x201e,
+  0x001f, 0x0b0a, 0x101f, 0x201f, 0x0020, 0x0b0b, 0x1020, 0x2020,
+  0x0021, 0x0c04, 0x1021, 0x2021, 0x0022, 0x0c05, 0x1022, 0x2022,
+  0x0023, 0x0c06, 0x1023, 0x2023, 0x0024, 0x0c07, 0x1024, 0x2024,
+  0x0025, 0x0c08, 0x1025, 0x2025, 0x0026, 0x0c09, 0x1026, 0x2026,
+  0x0027, 0x0c0a, 0x1027, 0x2027, 0x0028, 0x0c0b, 0x1028, 0x2028,
+  0x0029, 0x0d04, 0x1029, 0x2029, 0x002a, 0x0d05, 0x102a, 0x202a,
+  0x002b, 0x0d06, 0x102b, 0x202b, 0x002c, 0x0d07, 0x102c, 0x202c,
+  0x002d, 0x0d08, 0x102d, 0x202d, 0x002e, 0x0d09, 0x102e, 0x202e,
+  0x002f, 0x0d0a, 0x102f, 0x202f, 0x0030, 0x0d0b, 0x1030, 0x2030,
+  0x0031, 0x0e04, 0x1031, 0x2031, 0x0032, 0x0e05, 0x1032, 0x2032,
+  0x0033, 0x0e06, 0x1033, 0x2033, 0x0034, 0x0e07, 0x1034, 0x2034,
+  0x0035, 0x0e08, 0x1035, 0x2035, 0x0036, 0x0e09, 0x1036, 0x2036,
+  0x0037, 0x0e0a, 0x1037, 0x2037, 0x0038, 0x0e0b, 0x1038, 0x2038,
+  0x0039, 0x0f04, 0x1039, 0x2039, 0x003a, 0x0f05, 0x103a, 0x203a,
+  0x003b, 0x0f06, 0x103b, 0x203b, 0x003c, 0x0f07, 0x103c, 0x203c,
+  0x0801, 0x0f08, 0x103d, 0x203d, 0x1001, 0x0f09, 0x103e, 0x203e,
+  0x1801, 0x0f0a, 0x103f, 0x203f, 0x2001, 0x0f0b, 0x1040, 0x2040
+};
+
+}  // end namespace internal
+
+
+// The size of a compression block. Note that many parts of the compression
+// code assumes that kBlockSize <= 65536; in particular, the hash table
+// can only store 16-bit offsets, and EmitCopy() also assumes the offset
+// is 65535 bytes or less. Note also that if you change this, it will
+// affect the framing format (see framing_format.txt).
+//
+// Note that there might be older data around that is compressed with larger
+// block sizes, so the decompression code should not rely on the
+// non-existence of long backreferences.
+static const int kBlockLog = 16;
+static const size_t kBlockSize = 1 << kBlockLog;
+
+static const int kMaxHashTableBits = 14;
+static const size_t kMaxHashTableSize = 1 << kMaxHashTableBits;
+
+
+}  // end namespace lbug_snappy
+
+#endif  // #if SNAPPY_NEW_VERSION # else
+
+#endif  // THIRD_PARTY_SNAPPY_SNAPPY_INTERNAL_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-sinksource.cc b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-sinksource.cc
new file mode 100644
index 0000000000..867ca36d04
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-sinksource.cc
@@ -0,0 +1,206 @@
+// Copyright 2011 Google Inc. All Rights Reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//     * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#include "snappy_version.hpp"
+
+#if SNAPPY_NEW_VERSION
+
+#include <stddef.h>
+#include <cstring>
+
+#include "snappy-sinksource.h"
+
+namespace lbug_snappy {
+
+Source::~Source() = default;
+
+Sink::~Sink() = default;
+
+char* Sink::GetAppendBuffer(size_t length, char* scratch) {
+  // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+  (void)length;
+
+  return scratch;
+}
+
+char* Sink::GetAppendBufferVariable(
+      size_t min_size, size_t desired_size_hint, char* scratch,
+      size_t scratch_size, size_t* allocated_size) {
+  // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+  (void)min_size;
+  (void)desired_size_hint;
+
+  *allocated_size = scratch_size;
+  return scratch;
+}
+
+void Sink::AppendAndTakeOwnership(
+    char* bytes, size_t n,
+    void (*deleter)(void*, const char*, size_t),
+    void *deleter_arg) {
+  Append(bytes, n);
+  (*deleter)(deleter_arg, bytes, n);
+}
+
+ByteArraySource::~ByteArraySource() = default;
+
+size_t ByteArraySource::Available() const { return left_; }
+
+const char* ByteArraySource::Peek(size_t* len) {
+  *len = left_;
+  return ptr_;
+}
+
+void ByteArraySource::Skip(size_t n) {
+  left_ -= n;
+  ptr_ += n;
+}
+
+UncheckedByteArraySink::~UncheckedByteArraySink() { }
+
+void UncheckedByteArraySink::Append(const char* data, size_t n) {
+  // Do no copying if the caller filled in the result of GetAppendBuffer()
+  if (data != dest_) {
+    std::memcpy(dest_, data, n);
+  }
+  dest_ += n;
+}
+
+char* UncheckedByteArraySink::GetAppendBuffer(size_t len, char* scratch) {
+  // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+  (void)len;
+  (void)scratch;
+
+  return dest_;
+}
+
+void UncheckedByteArraySink::AppendAndTakeOwnership(
+    char* bytes, size_t n,
+    void (*deleter)(void*, const char*, size_t),
+    void *deleter_arg) {
+  if (bytes != dest_) {
+    std::memcpy(dest_, bytes, n);
+    (*deleter)(deleter_arg, bytes, n);
+  }
+  dest_ += n;
+}
+
+char* UncheckedByteArraySink::GetAppendBufferVariable(
+      size_t min_size, size_t desired_size_hint, char* scratch,
+      size_t scratch_size, size_t* allocated_size) {
+  // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+  (void)min_size;
+  (void)scratch;
+  (void)scratch_size;
+
+  *allocated_size = desired_size_hint;
+  return dest_;
+}
+
+}  // namespace lbug_snappy
+
+#else // #if SNAPPY_NEW_VERSION
+
+#include <string.h>
+
+#include "snappy-sinksource.h"
+
+namespace lbug_snappy {
+
+Source::~Source() { }
+
+Sink::~Sink() { }
+
+char* Sink::GetAppendBuffer(size_t length, char* scratch) {
+	return scratch;
+}
+
+char* Sink::GetAppendBufferVariable(
+	  size_t min_size, size_t desired_size_hint, char* scratch,
+	  size_t scratch_size, size_t* allocated_size) {
+	*allocated_size = scratch_size;
+	return scratch;
+}
+
+void Sink::AppendAndTakeOwnership(
+	char* bytes, size_t n,
+	void (*deleter)(void*, const char*, size_t),
+	void *deleter_arg) {
+	Append(bytes, n);
+	(*deleter)(deleter_arg, bytes, n);
+}
+
+ByteArraySource::~ByteArraySource() { }
+
+size_t ByteArraySource::Available() const { return left_; }
+
+const char* ByteArraySource::Peek(size_t* len) {
+	*len = left_;
+	return ptr_;
+}
+
+void ByteArraySource::Skip(size_t n) {
+	left_ -= n;
+	ptr_ += n;
+}
+
+UncheckedByteArraySink::~UncheckedByteArraySink() { }
+
+void UncheckedByteArraySink::Append(const char* data, size_t n) {
+	// Do no copying if the caller filled in the result of GetAppendBuffer()
+	if (data != dest_) {
+		memcpy(dest_, data, n);
+	}
+	dest_ += n;
+}
+
+char* UncheckedByteArraySink::GetAppendBuffer(size_t len, char* scratch) {
+	return dest_;
+}
+
+void UncheckedByteArraySink::AppendAndTakeOwnership(
+	char* data, size_t n,
+	void (*deleter)(void*, const char*, size_t),
+	void *deleter_arg) {
+	if (data != dest_) {
+		memcpy(dest_, data, n);
+		(*deleter)(deleter_arg, data, n);
+	}
+	dest_ += n;
+}
+
+char* UncheckedByteArraySink::GetAppendBufferVariable(
+	  size_t min_size, size_t desired_size_hint, char* scratch,
+	  size_t scratch_size, size_t* allocated_size) {
+	*allocated_size = desired_size_hint;
+	return dest_;
+}
+
+}  // namespace lbug_snappy
+
+#endif  // #if SNAPPY_NEW_VERSION # else
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-sinksource.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-sinksource.h
new file mode 100644
index 0000000000..7e07eb75de
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-sinksource.h
@@ -0,0 +1,340 @@
+// Copyright 2011 Google Inc. All Rights Reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//     * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#ifndef THIRD_PARTY_SNAPPY_SNAPPY_SINKSOURCE_H_
+#define THIRD_PARTY_SNAPPY_SNAPPY_SINKSOURCE_H_
+
+#include "snappy_version.hpp"
+
+#if SNAPPY_NEW_VERSION
+
+#include <stddef.h>
+
+namespace lbug_snappy {
+
+// A Sink is an interface that consumes a sequence of bytes.
+class Sink {
+ public:
+  Sink() { }
+  virtual ~Sink();
+
+  // Append "bytes[0,n-1]" to this.
+  virtual void Append(const char* bytes, size_t n) = 0;
+
+  // Returns a writable buffer of the specified length for appending.
+  // May return a pointer to the caller-owned scratch buffer which
+  // must have at least the indicated length.  The returned buffer is
+  // only valid until the next operation on this Sink.
+  //
+  // After writing at most "length" bytes, call Append() with the
+  // pointer returned from this function and the number of bytes
+  // written.  Many Append() implementations will avoid copying
+  // bytes if this function returned an internal buffer.
+  //
+  // If a non-scratch buffer is returned, the caller may only pass a
+  // prefix of it to Append().  That is, it is not correct to pass an
+  // interior pointer of the returned array to Append().
+  //
+  // The default implementation always returns the scratch buffer.
+  virtual char* GetAppendBuffer(size_t length, char* scratch);
+
+  // For higher performance, Sink implementations can provide custom
+  // AppendAndTakeOwnership() and GetAppendBufferVariable() methods.
+  // These methods can reduce the number of copies done during
+  // compression/decompression.
+
+  // Append "bytes[0,n-1] to the sink. Takes ownership of "bytes"
+  // and calls the deleter function as (*deleter)(deleter_arg, bytes, n)
+  // to free the buffer. deleter function must be non NULL.
+  //
+  // The default implementation just calls Append and frees "bytes".
+  // Other implementations may avoid a copy while appending the buffer.
+  virtual void AppendAndTakeOwnership(
+      char* bytes, size_t n, void (*deleter)(void*, const char*, size_t),
+      void *deleter_arg);
+
+  // Returns a writable buffer for appending and writes the buffer's capacity to
+  // *allocated_size. Guarantees *allocated_size >= min_size.
+  // May return a pointer to the caller-owned scratch buffer which must have
+  // scratch_size >= min_size.
+  //
+  // The returned buffer is only valid until the next operation
+  // on this ByteSink.
+  //
+  // After writing at most *allocated_size bytes, call Append() with the
+  // pointer returned from this function and the number of bytes written.
+  // Many Append() implementations will avoid copying bytes if this function
+  // returned an internal buffer.
+  //
+  // If the sink implementation allocates or reallocates an internal buffer,
+  // it should use the desired_size_hint if appropriate. If a caller cannot
+  // provide a reasonable guess at the desired capacity, it should set
+  // desired_size_hint = 0.
+  //
+  // If a non-scratch buffer is returned, the caller may only pass
+  // a prefix to it to Append(). That is, it is not correct to pass an
+  // interior pointer to Append().
+  //
+  // The default implementation always returns the scratch buffer.
+  virtual char* GetAppendBufferVariable(
+      size_t min_size, size_t desired_size_hint, char* scratch,
+      size_t scratch_size, size_t* allocated_size);
+
+ private:
+  // No copying
+  Sink(const Sink&);
+  void operator=(const Sink&);
+};
+
+// A Source is an interface that yields a sequence of bytes
+class Source {
+ public:
+  Source() { }
+  virtual ~Source();
+
+  // Return the number of bytes left to read from the source
+  virtual size_t Available() const = 0;
+
+  // Peek at the next flat region of the source.  Does not reposition
+  // the source.  The returned region is empty iff Available()==0.
+  //
+  // Returns a pointer to the beginning of the region and store its
+  // length in *len.
+  //
+  // The returned region is valid until the next call to Skip() or
+  // until this object is destroyed, whichever occurs first.
+  //
+  // The returned region may be larger than Available() (for example
+  // if this ByteSource is a view on a substring of a larger source).
+  // The caller is responsible for ensuring that it only reads the
+  // Available() bytes.
+  virtual const char* Peek(size_t* len) = 0;
+
+  // Skip the next n bytes.  Invalidates any buffer returned by
+  // a previous call to Peek().
+  // REQUIRES: Available() >= n
+  virtual void Skip(size_t n) = 0;
+
+ private:
+  // No copying
+  Source(const Source&);
+  void operator=(const Source&);
+};
+
+// A Source implementation that yields the contents of a flat array
+class ByteArraySource : public Source {
+ public:
+  ByteArraySource(const char* p, size_t n) : ptr_(p), left_(n) { }
+  ~ByteArraySource() override;
+  size_t Available() const override;
+  const char* Peek(size_t* len) override;
+  void Skip(size_t n) override;
+ private:
+  const char* ptr_;
+  size_t left_;
+};
+
+// A Sink implementation that writes to a flat array without any bound checks.
+class UncheckedByteArraySink : public Sink {
+ public:
+  explicit UncheckedByteArraySink(char* dest) : dest_(dest) { }
+  ~UncheckedByteArraySink() override;
+  void Append(const char* data, size_t n) override;
+  char* GetAppendBuffer(size_t len, char* scratch) override;
+  char* GetAppendBufferVariable(
+      size_t min_size, size_t desired_size_hint, char* scratch,
+      size_t scratch_size, size_t* allocated_size) override;
+  void AppendAndTakeOwnership(
+      char* bytes, size_t n, void (*deleter)(void*, const char*, size_t),
+      void *deleter_arg) override;
+
+  // Return the current output pointer so that a caller can see how
+  // many bytes were produced.
+  // Note: this is not a Sink method.
+  char* CurrentDestination() const { return dest_; }
+ private:
+  char* dest_;
+};
+
+}  // namespace lbug_snappy
+
+#else // #if SNAPPY_NEW_VERSION
+
+#include <stddef.h>
+
+namespace lbug_snappy {
+
+// A Sink is an interface that consumes a sequence of bytes.
+class Sink {
+ public:
+  Sink() { }
+  virtual ~Sink();
+
+  // Append "bytes[0,n-1]" to this.
+  virtual void Append(const char* bytes, size_t n) = 0;
+
+  // Returns a writable buffer of the specified length for appending.
+  // May return a pointer to the caller-owned scratch buffer which
+  // must have at least the indicated length.  The returned buffer is
+  // only valid until the next operation on this Sink.
+  //
+  // After writing at most "length" bytes, call Append() with the
+  // pointer returned from this function and the number of bytes
+  // written.  Many Append() implementations will avoid copying
+  // bytes if this function returned an internal buffer.
+  //
+  // If a non-scratch buffer is returned, the caller may only pass a
+  // prefix of it to Append().  That is, it is not correct to pass an
+  // interior pointer of the returned array to Append().
+  //
+  // The default implementation always returns the scratch buffer.
+  virtual char* GetAppendBuffer(size_t length, char* scratch);
+
+  // For higher performance, Sink implementations can provide custom
+  // AppendAndTakeOwnership() and GetAppendBufferVariable() methods.
+  // These methods can reduce the number of copies done during
+  // compression/decompression.
+
+  // Append "bytes[0,n-1] to the sink. Takes ownership of "bytes"
+  // and calls the deleter function as (*deleter)(deleter_arg, bytes, n)
+  // to free the buffer. deleter function must be non NULL.
+  //
+  // The default implementation just calls Append and frees "bytes".
+  // Other implementations may avoid a copy while appending the buffer.
+  virtual void AppendAndTakeOwnership(
+      char* bytes, size_t n, void (*deleter)(void*, const char*, size_t),
+      void *deleter_arg);
+
+  // Returns a writable buffer for appending and writes the buffer's capacity to
+  // *allocated_size. Guarantees *allocated_size >= min_size.
+  // May return a pointer to the caller-owned scratch buffer which must have
+  // scratch_size >= min_size.
+  //
+  // The returned buffer is only valid until the next operation
+  // on this ByteSink.
+  //
+  // After writing at most *allocated_size bytes, call Append() with the
+  // pointer returned from this function and the number of bytes written.
+  // Many Append() implementations will avoid copying bytes if this function
+  // returned an internal buffer.
+  //
+  // If the sink implementation allocates or reallocates an internal buffer,
+  // it should use the desired_size_hint if appropriate. If a caller cannot
+  // provide a reasonable guess at the desired capacity, it should set
+  // desired_size_hint = 0.
+  //
+  // If a non-scratch buffer is returned, the caller may only pass
+  // a prefix to it to Append(). That is, it is not correct to pass an
+  // interior pointer to Append().
+  //
+  // The default implementation always returns the scratch buffer.
+  virtual char* GetAppendBufferVariable(
+      size_t min_size, size_t desired_size_hint, char* scratch,
+      size_t scratch_size, size_t* allocated_size);
+
+ private:
+  // No copying
+  Sink(const Sink&);
+  void operator=(const Sink&);
+};
+
+// A Source is an interface that yields a sequence of bytes
+class Source {
+ public:
+  Source() { }
+  virtual ~Source();
+
+  // Return the number of bytes left to read from the source
+  virtual size_t Available() const = 0;
+
+  // Peek at the next flat region of the source.  Does not reposition
+  // the source.  The returned region is empty iff Available()==0.
+  //
+  // Returns a pointer to the beginning of the region and store its
+  // length in *len.
+  //
+  // The returned region is valid until the next call to Skip() or
+  // until this object is destroyed, whichever occurs first.
+  //
+  // The returned region may be larger than Available() (for example
+  // if this ByteSource is a view on a substring of a larger source).
+  // The caller is responsible for ensuring that it only reads the
+  // Available() bytes.
+  virtual const char* Peek(size_t* len) = 0;
+
+  // Skip the next n bytes.  Invalidates any buffer returned by
+  // a previous call to Peek().
+  // REQUIRES: Available() >= n
+  virtual void Skip(size_t n) = 0;
+
+ private:
+  // No copying
+  Source(const Source&);
+  void operator=(const Source&);
+};
+
+// A Source implementation that yields the contents of a flat array
+class ByteArraySource : public Source {
+ public:
+  ByteArraySource(const char* p, size_t n) : ptr_(p), left_(n) { }
+  virtual ~ByteArraySource();
+  virtual size_t Available() const;
+  virtual const char* Peek(size_t* len);
+  virtual void Skip(size_t n);
+ private:
+  const char* ptr_;
+  size_t left_;
+};
+
+// A Sink implementation that writes to a flat array without any bound checks.
+class UncheckedByteArraySink : public Sink {
+ public:
+  explicit UncheckedByteArraySink(char* dest) : dest_(dest) { }
+  virtual ~UncheckedByteArraySink();
+  virtual void Append(const char* data, size_t n);
+  virtual char* GetAppendBuffer(size_t len, char* scratch);
+  virtual char* GetAppendBufferVariable(
+      size_t min_size, size_t desired_size_hint, char* scratch,
+      size_t scratch_size, size_t* allocated_size);
+  virtual void AppendAndTakeOwnership(
+      char* bytes, size_t n, void (*deleter)(void*, const char*, size_t),
+      void *deleter_arg);
+
+  // Return the current output pointer so that a caller can see how
+  // many bytes were produced.
+  // Note: this is not a Sink method.
+  char* CurrentDestination() const { return dest_; }
+ private:
+  char* dest_;
+};
+
+}  // namespace lbug_snappy
+
+#endif  // #if SNAPPY_NEW_VERSION # else
+
+#endif  // THIRD_PARTY_SNAPPY_SNAPPY_SINKSOURCE_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-internal.cc b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-internal.cc
new file mode 100644
index 0000000000..5ce2cab7f5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-internal.cc
@@ -0,0 +1,42 @@
+// Copyright 2011 Google Inc. All Rights Reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//     * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#include <algorithm>
+#include <string>
+
+#include "snappy-stubs-internal.h"
+
+namespace lbug_snappy {
+
+void Varint::Append32(std::string* s, uint32_t value) {
+  char buf[Varint::kMax32];
+  const char* p = Varint::Encode32(buf, value);
+  s->append(buf, p - buf);
+}
+
+}  // namespace lbug_snappy
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-internal.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-internal.h
new file mode 100644
index 0000000000..8e274ec203
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-internal.h
@@ -0,0 +1,1028 @@
+// Copyright 2011 Google Inc. All Rights Reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//     * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+// Various stubs for the open-source version of Snappy.
+
+#ifndef THIRD_PARTY_SNAPPY_OPENSOURCE_SNAPPY_STUBS_INTERNAL_H_
+#define THIRD_PARTY_SNAPPY_OPENSOURCE_SNAPPY_STUBS_INTERNAL_H_
+
+#include "snappy_version.hpp"
+
+#if SNAPPY_NEW_VERSION
+
+#if HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include <stdint.h>
+
+#include <cassert>
+#include <cstdlib>
+#include <cstring>
+#include <limits>
+#include <string>
+
+// lbug - LNK: define here instead of in CMake
+#ifdef __GNUC__
+#define HAVE_BUILTIN_EXPECT 1
+#define HAVE_BUILTIN_CTZ 1
+#define HAVE_BUILTIN_PREFETCH 1
+#endif
+
+
+#if HAVE_SYS_MMAN_H
+#include <sys/mman.h>
+#endif
+
+#if HAVE_UNISTD_H
+#include <unistd.h>
+#endif
+
+#if defined(_MSC_VER)
+#include <intrin.h>
+#endif  // defined(_MSC_VER)
+
+#ifndef __has_feature
+#define __has_feature(x) 0
+#endif
+
+#if __has_feature(memory_sanitizer)
+#include <sanitizer/msan_interface.h>
+#define SNAPPY_ANNOTATE_MEMORY_IS_INITIALIZED(address, size) \
+    __msan_unpoison((address), (size))
+#else
+#define SNAPPY_ANNOTATE_MEMORY_IS_INITIALIZED(address, size) /* empty */
+#endif  // __has_feature(memory_sanitizer)
+
+#include "snappy-stubs-public.h"
+
+// Used to enable 64-bit optimized versions of some routines.
+#if defined(__PPC64__) || defined(__powerpc64__)
+#define ARCH_PPC 1
+#elif defined(__aarch64__) || defined(_M_ARM64)
+#define ARCH_ARM 1
+#endif
+
+// Needed by OS X, among others.
+#ifndef MAP_ANONYMOUS
+#define MAP_ANONYMOUS MAP_ANON
+#endif
+
+// The size of an array, if known at compile-time.
+// Will give unexpected results if used on a pointer.
+// We undefine it first, since some compilers already have a definition.
+#ifdef ARRAYSIZE
+#undef ARRAYSIZE
+#endif
+#define ARRAYSIZE(a) int{sizeof(a) / sizeof(*(a))}
+
+// Static prediction hints.
+#if HAVE_BUILTIN_EXPECT
+#define SNAPPY_PREDICT_FALSE(x) (__builtin_expect(x, 0))
+#define SNAPPY_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
+#else
+#define SNAPPY_PREDICT_FALSE(x) x
+#define SNAPPY_PREDICT_TRUE(x) x
+#endif  // HAVE_BUILTIN_EXPECT
+
+// Inlining hints.
+#if HAVE_ATTRIBUTE_ALWAYS_INLINE
+#define SNAPPY_ATTRIBUTE_ALWAYS_INLINE __attribute__((always_inline))
+#else
+#define SNAPPY_ATTRIBUTE_ALWAYS_INLINE
+#endif  // HAVE_ATTRIBUTE_ALWAYS_INLINE
+
+#if HAVE_BUILTIN_PREFETCH
+#define SNAPPY_PREFETCH(ptr) __builtin_prefetch(ptr, 0, 3)
+#else
+#define SNAPPY_PREFETCH(ptr) (void)(ptr)
+#endif
+
+// Stubbed version of ABSL_FLAG.
+//
+// In the open source version, flags can only be changed at compile time.
+#define SNAPPY_FLAG(flag_type, flag_name, default_value, help) \
+  flag_type FLAGS_ ## flag_name = default_value
+
+namespace lbug_snappy {
+
+// Stubbed version of absl::GetFlag().
+template <typename T>
+inline T GetFlag(T flag) { return flag; }
+
+static const uint32_t kuint32max = std::numeric_limits<uint32_t>::max();
+static const int64_t kint64max = std::numeric_limits<int64_t>::max();
+
+// Potentially unaligned loads and stores.
+
+inline uint16_t UNALIGNED_LOAD16(const void *p) {
+  // Compiles to a single movzx/ldrh on clang/gcc/msvc.
+  uint16_t v;
+  std::memcpy(&v, p, sizeof(v));
+  return v;
+}
+
+inline uint32_t UNALIGNED_LOAD32(const void *p) {
+  // Compiles to a single mov/ldr on clang/gcc/msvc.
+  uint32_t v;
+  std::memcpy(&v, p, sizeof(v));
+  return v;
+}
+
+inline uint64_t UNALIGNED_LOAD64(const void *p) {
+  // Compiles to a single mov/ldr on clang/gcc/msvc.
+  uint64_t v;
+  std::memcpy(&v, p, sizeof(v));
+  return v;
+}
+
+inline void UNALIGNED_STORE16(void *p, uint16_t v) {
+  // Compiles to a single mov/strh on clang/gcc/msvc.
+  std::memcpy(p, &v, sizeof(v));
+}
+
+inline void UNALIGNED_STORE32(void *p, uint32_t v) {
+  // Compiles to a single mov/str on clang/gcc/msvc.
+  std::memcpy(p, &v, sizeof(v));
+}
+
+inline void UNALIGNED_STORE64(void *p, uint64_t v) {
+  // Compiles to a single mov/str on clang/gcc/msvc.
+  std::memcpy(p, &v, sizeof(v));
+}
+
+// Convert to little-endian storage, opposite of network format.
+// Convert x from host to little endian: x = LittleEndian.FromHost(x);
+// convert x from little endian to host: x = LittleEndian.ToHost(x);
+//
+//  Store values into unaligned memory converting to little endian order:
+//    LittleEndian.Store16(p, x);
+//
+//  Load unaligned values stored in little endian converting to host order:
+//    x = LittleEndian.Load16(p);
+class LittleEndian {
+ public:
+  // Functions to do unaligned loads and stores in little-endian order.
+  static inline uint16_t Load16(const void *ptr) {
+    // Compiles to a single mov/str on recent clang and gcc.
+#if SNAPPY_IS_BIG_ENDIAN
+    const uint8_t* const buffer = reinterpret_cast<const uint8_t*>(ptr);
+    return (static_cast<uint16_t>(buffer[0])) |
+            (static_cast<uint16_t>(buffer[1]) << 8);
+#else
+    // memcpy() turns into a single instruction early in the optimization
+    // pipeline (relatively to a series of byte accesses). So, using memcpy
+    // instead of byte accesses may lead to better decisions in more stages of
+    // the optimization pipeline.
+    uint16_t value;
+    std::memcpy(&value, ptr, 2);
+    return value;
+#endif
+  }
+
+  static inline uint32_t Load32(const void *ptr) {
+    // Compiles to a single mov/str on recent clang and gcc.
+#if SNAPPY_IS_BIG_ENDIAN
+    const uint8_t* const buffer = reinterpret_cast<const uint8_t*>(ptr);
+    return (static_cast<uint32_t>(buffer[0])) |
+            (static_cast<uint32_t>(buffer[1]) << 8) |
+            (static_cast<uint32_t>(buffer[2]) << 16) |
+            (static_cast<uint32_t>(buffer[3]) << 24);
+#else
+    // See Load16() for the rationale of using memcpy().
+    uint32_t value;
+    std::memcpy(&value, ptr, 4);
+    return value;
+#endif
+  }
+
+  static inline uint64_t Load64(const void *ptr) {
+    // Compiles to a single mov/str on recent clang and gcc.
+#if SNAPPY_IS_BIG_ENDIAN
+    const uint8_t* const buffer = reinterpret_cast<const uint8_t*>(ptr);
+    return (static_cast<uint64_t>(buffer[0])) |
+            (static_cast<uint64_t>(buffer[1]) << 8) |
+            (static_cast<uint64_t>(buffer[2]) << 16) |
+            (static_cast<uint64_t>(buffer[3]) << 24) |
+            (static_cast<uint64_t>(buffer[4]) << 32) |
+            (static_cast<uint64_t>(buffer[5]) << 40) |
+            (static_cast<uint64_t>(buffer[6]) << 48) |
+            (static_cast<uint64_t>(buffer[7]) << 56);
+#else
+    // See Load16() for the rationale of using memcpy().
+    uint64_t value;
+    std::memcpy(&value, ptr, 8);
+    return value;
+#endif
+  }
+
+  static inline void Store16(void *dst, uint16_t value) {
+    // Compiles to a single mov/str on recent clang and gcc.
+#if SNAPPY_IS_BIG_ENDIAN
+    uint8_t* const buffer = reinterpret_cast<uint8_t*>(dst);
+    buffer[0] = static_cast<uint8_t>(value);
+    buffer[1] = static_cast<uint8_t>(value >> 8);
+#else
+    // See Load16() for the rationale of using memcpy().
+    std::memcpy(dst, &value, 2);
+#endif
+  }
+
+  static void Store32(void *dst, uint32_t value) {
+    // Compiles to a single mov/str on recent clang and gcc.
+#if SNAPPY_IS_BIG_ENDIAN
+    uint8_t* const buffer = reinterpret_cast<uint8_t*>(dst);
+    buffer[0] = static_cast<uint8_t>(value);
+    buffer[1] = static_cast<uint8_t>(value >> 8);
+    buffer[2] = static_cast<uint8_t>(value >> 16);
+    buffer[3] = static_cast<uint8_t>(value >> 24);
+#else
+    // See Load16() for the rationale of using memcpy().
+    std::memcpy(dst, &value, 4);
+#endif
+  }
+
+  static void Store64(void* dst, uint64_t value) {
+    // Compiles to a single mov/str on recent clang and gcc.
+#if SNAPPY_IS_BIG_ENDIAN
+    uint8_t* const buffer = reinterpret_cast<uint8_t*>(dst);
+    buffer[0] = static_cast<uint8_t>(value);
+    buffer[1] = static_cast<uint8_t>(value >> 8);
+    buffer[2] = static_cast<uint8_t>(value >> 16);
+    buffer[3] = static_cast<uint8_t>(value >> 24);
+    buffer[4] = static_cast<uint8_t>(value >> 32);
+    buffer[5] = static_cast<uint8_t>(value >> 40);
+    buffer[6] = static_cast<uint8_t>(value >> 48);
+    buffer[7] = static_cast<uint8_t>(value >> 56);
+#else
+    // See Load16() for the rationale of using memcpy().
+    std::memcpy(dst, &value, 8);
+#endif
+  }
+
+  static inline constexpr bool IsLittleEndian() {
+#if SNAPPY_IS_BIG_ENDIAN
+    return false;
+#else
+    return true;
+#endif  // SNAPPY_IS_BIG_ENDIAN
+  }
+};
+
+// Some bit-manipulation functions.
+class Bits {
+ public:
+  // Return floor(log2(n)) for positive integer n.
+  static int Log2FloorNonZero(uint32_t n);
+
+  // Return floor(log2(n)) for positive integer n.  Returns -1 iff n == 0.
+  static int Log2Floor(uint32_t n);
+
+  // Return the first set least / most significant bit, 0-indexed.  Returns an
+  // undefined value if n == 0.  FindLSBSetNonZero() is similar to ffs() except
+  // that it's 0-indexed.
+  static int FindLSBSetNonZero(uint32_t n);
+
+  static int FindLSBSetNonZero64(uint64_t n);
+
+ private:
+  // No copying
+  Bits(const Bits&);
+  void operator=(const Bits&);
+};
+
+#if HAVE_BUILTIN_CTZ
+
+inline int Bits::Log2FloorNonZero(uint32_t n) {
+  assert(n != 0);
+  // (31 ^ x) is equivalent to (31 - x) for x in [0, 31]. An easy proof
+  // represents subtraction in base 2 and observes that there's no carry.
+  //
+  // GCC and Clang represent __builtin_clz on x86 as 31 ^ _bit_scan_reverse(x).
+  // Using "31 ^" here instead of "31 -" allows the optimizer to strip the
+  // function body down to _bit_scan_reverse(x).
+  return 31 ^ __builtin_clz(n);
+}
+
+inline int Bits::Log2Floor(uint32_t n) {
+  return (n == 0) ? -1 : Bits::Log2FloorNonZero(n);
+}
+
+inline int Bits::FindLSBSetNonZero(uint32_t n) {
+  assert(n != 0);
+  return __builtin_ctz(n);
+}
+
+#elif defined(_MSC_VER)
+
+inline int Bits::Log2FloorNonZero(uint32_t n) {
+  assert(n != 0);
+  // NOLINTNEXTLINE(runtime/int): The MSVC intrinsic demands unsigned long.
+  unsigned long where;
+  _BitScanReverse(&where, n);
+  return static_cast<int>(where);
+}
+
+inline int Bits::Log2Floor(uint32_t n) {
+  // NOLINTNEXTLINE(runtime/int): The MSVC intrinsic demands unsigned long.
+  unsigned long where;
+  if (_BitScanReverse(&where, n))
+    return static_cast<int>(where);
+  return -1;
+}
+
+inline int Bits::FindLSBSetNonZero(uint32_t n) {
+  assert(n != 0);
+  // NOLINTNEXTLINE(runtime/int): The MSVC intrinsic demands unsigned long.
+  unsigned long where;
+  if (_BitScanForward(&where, n))
+    return static_cast<int>(where);
+  return 32;
+}
+
+#else  // Portable versions.
+
+inline int Bits::Log2FloorNonZero(uint32_t n) {
+  assert(n != 0);
+
+  int log = 0;
+  uint32_t value = n;
+  for (int i = 4; i >= 0; --i) {
+    int shift = (1 << i);
+    uint32_t x = value >> shift;
+    if (x != 0) {
+      value = x;
+      log += shift;
+    }
+  }
+  assert(value == 1);
+  return log;
+}
+
+inline int Bits::Log2Floor(uint32_t n) {
+  return (n == 0) ? -1 : Bits::Log2FloorNonZero(n);
+}
+
+inline int Bits::FindLSBSetNonZero(uint32_t n) {
+  assert(n != 0);
+
+  int rc = 31;
+  for (int i = 4, shift = 1 << 4; i >= 0; --i) {
+    const uint32_t x = n << shift;
+    if (x != 0) {
+      n = x;
+      rc -= shift;
+    }
+    shift >>= 1;
+  }
+  return rc;
+}
+
+#endif  // End portable versions.
+
+#if HAVE_BUILTIN_CTZ
+
+inline int Bits::FindLSBSetNonZero64(uint64_t n) {
+  assert(n != 0);
+  return __builtin_ctzll(n);
+}
+
+#elif defined(_MSC_VER) && (defined(_M_X64) || defined(_M_ARM64))
+// _BitScanForward64() is only available on x64 and ARM64.
+
+inline int Bits::FindLSBSetNonZero64(uint64_t n) {
+  assert(n != 0);
+  // NOLINTNEXTLINE(runtime/int): The MSVC intrinsic demands unsigned long.
+  unsigned long where;
+  if (_BitScanForward64(&where, n))
+    return static_cast<int>(where);
+  return 64;
+}
+
+#else  // Portable version.
+
+// FindLSBSetNonZero64() is defined in terms of FindLSBSetNonZero().
+inline int Bits::FindLSBSetNonZero64(uint64_t n) {
+  assert(n != 0);
+
+  const uint32_t bottombits = static_cast<uint32_t>(n);
+  if (bottombits == 0) {
+    // Bottom bits are zero, so scan the top bits.
+    return 32 + FindLSBSetNonZero(static_cast<uint32_t>(n >> 32));
+  } else {
+    return FindLSBSetNonZero(bottombits);
+  }
+}
+
+#endif  // HAVE_BUILTIN_CTZ
+
+// Variable-length integer encoding.
+class Varint {
+ public:
+  // Maximum lengths of varint encoding of uint32_t.
+  static const int kMax32 = 5;
+
+  // Attempts to parse a varint32 from a prefix of the bytes in [ptr,limit-1].
+  // Never reads a character at or beyond limit.  If a valid/terminated varint32
+  // was found in the range, stores it in *OUTPUT and returns a pointer just
+  // past the last byte of the varint32. Else returns NULL.  On success,
+  // "result <= limit".
+  static const char* Parse32WithLimit(const char* ptr, const char* limit,
+                                      uint32_t* OUTPUT);
+
+  // REQUIRES   "ptr" points to a buffer of length sufficient to hold "v".
+  // EFFECTS    Encodes "v" into "ptr" and returns a pointer to the
+  //            byte just past the last encoded byte.
+  static char* Encode32(char* ptr, uint32_t v);
+
+  // EFFECTS    Appends the varint representation of "value" to "*s".
+  static void Append32(std::string* s, uint32_t value);
+};
+
+inline const char* Varint::Parse32WithLimit(const char* p,
+                                            const char* l,
+                                            uint32_t* OUTPUT) {
+  const unsigned char* ptr = reinterpret_cast<const unsigned char*>(p);
+  const unsigned char* limit = reinterpret_cast<const unsigned char*>(l);
+  uint32_t b, result;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result = b & 127;          if (b < 128) goto done;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result |= (b & 127) <<  7; if (b < 128) goto done;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result |= (b & 127) << 14; if (b < 128) goto done;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result |= (b & 127) << 21; if (b < 128) goto done;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result |= (b & 127) << 28; if (b < 16) goto done;
+  return NULL;       // Value is too long to be a varint32
+ done:
+  *OUTPUT = result;
+  return reinterpret_cast<const char*>(ptr);
+}
+
+inline char* Varint::Encode32(char* sptr, uint32_t v) {
+  // Operate on characters as unsigneds
+  uint8_t* ptr = reinterpret_cast<uint8_t*>(sptr);
+  static const uint8_t B = 128;
+  if (v < (1 << 7)) {
+    *(ptr++) = static_cast<uint8_t>(v);
+  } else if (v < (1 << 14)) {
+    *(ptr++) = static_cast<uint8_t>(v | B);
+    *(ptr++) = static_cast<uint8_t>(v >> 7);
+  } else if (v < (1 << 21)) {
+    *(ptr++) = static_cast<uint8_t>(v | B);
+    *(ptr++) = static_cast<uint8_t>((v >> 7) | B);
+    *(ptr++) = static_cast<uint8_t>(v >> 14);
+  } else if (v < (1 << 28)) {
+    *(ptr++) = static_cast<uint8_t>(v | B);
+    *(ptr++) = static_cast<uint8_t>((v >> 7) | B);
+    *(ptr++) = static_cast<uint8_t>((v >> 14) | B);
+    *(ptr++) = static_cast<uint8_t>(v >> 21);
+  } else {
+    *(ptr++) = static_cast<uint8_t>(v | B);
+    *(ptr++) = static_cast<uint8_t>((v>>7) | B);
+    *(ptr++) = static_cast<uint8_t>((v>>14) | B);
+    *(ptr++) = static_cast<uint8_t>((v>>21) | B);
+    *(ptr++) = static_cast<uint8_t>(v >> 28);
+  }
+  return reinterpret_cast<char*>(ptr);
+}
+
+// If you know the internal layout of the std::string in use, you can
+// replace this function with one that resizes the string without
+// filling the new space with zeros (if applicable) --
+// it will be non-portable but faster.
+inline void STLStringResizeUninitialized(std::string* s, size_t new_size) {
+  s->resize(new_size);
+}
+
+// Return a mutable char* pointing to a string's internal buffer,
+// which may not be null-terminated. Writing through this pointer will
+// modify the string.
+//
+// string_as_array(&str)[i] is valid for 0 <= i < str.size() until the
+// next call to a string method that invalidates iterators.
+//
+// As of 2006-04, there is no standard-blessed way of getting a
+// mutable reference to a string's internal buffer. However, issue 530
+// (http://www.open-std.org/JTC1/SC22/WG21/docs/lwg-defects.html#530)
+// proposes this as the method. It will officially be part of the standard
+// for C++0x. This should already work on all current implementations.
+inline char* string_as_array(std::string* str) {
+  return str->empty() ? NULL : &*str->begin();
+}
+
+}  // namespace lbug_snappy
+
+#else // #if SNAPPY_NEW_VERSION
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include <string>
+
+#include <assert.h>
+#include <stdlib.h>
+#include <string.h>
+
+// lbug - LNK: define here instead of in CMake
+#ifdef __GNUC__
+#define HAVE_BUILTIN_EXPECT
+#define HAVE_BUILTIN_CTZ
+#define HAVE_BUILTIN_PREFETCH
+#endif
+
+#ifdef HAVE_SYS_MMAN_H
+#include <sys/mman.h>
+#endif
+
+#ifdef HAVE_UNISTD_H
+#include <unistd.h>
+#endif
+
+#if defined(_MSC_VER)
+#include <intrin.h>
+#endif  // defined(_MSC_VER)
+
+#ifndef __has_feature
+#define __has_feature(x) 0
+#endif
+
+#if __has_feature(memory_sanitizer)
+#include <sanitizer/msan_interface.h>
+#define SNAPPY_ANNOTATE_MEMORY_IS_INITIALIZED(address, size) \
+    __msan_unpoison((address), (size))
+#else
+#define SNAPPY_ANNOTATE_MEMORY_IS_INITIALIZED(address, size) /* empty */
+#endif  // __has_feature(memory_sanitizer)
+
+#include "snappy-stubs-public.h"
+
+#if defined(__x86_64__)
+
+// Enable 64-bit optimized versions of some routines.
+#define ARCH_K8 1
+
+#elif defined(__ppc64__)
+
+#define ARCH_PPC 1
+
+#elif defined(__aarch64__)
+
+#define ARCH_ARM 1
+
+#endif
+
+// Needed by OS X, among others.
+#ifndef MAP_ANONYMOUS
+#define MAP_ANONYMOUS MAP_ANON
+#endif
+
+// The size of an array, if known at compile-time.
+// Will give unexpected results if used on a pointer.
+// We undefine it first, since some compilers already have a definition.
+#ifdef ARRAYSIZE
+#undef ARRAYSIZE
+#endif
+#define ARRAYSIZE(a) (sizeof(a) / sizeof(*(a)))
+
+// Static prediction hints.
+#ifdef HAVE_BUILTIN_EXPECT
+#define SNAPPY_PREDICT_FALSE(x) (__builtin_expect(x, 0))
+#define SNAPPY_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
+#else
+#define SNAPPY_PREDICT_FALSE(x) x
+#define SNAPPY_PREDICT_TRUE(x) x
+#endif
+
+// This is only used for recomputing the tag byte table used during
+// decompression; for simplicity we just remove it from the open-source
+// version (anyone who wants to regenerate it can just do the call
+// themselves within main()).
+#define DEFINE_bool(flag_name, default_value, description) \
+  bool FLAGS_ ## flag_name = default_value
+#define DECLARE_bool(flag_name) \
+  extern bool FLAGS_ ## flag_name
+
+namespace lbug_snappy {
+
+//static const uint32 kuint32max = static_cast<uint32>(0xFFFFFFFF);
+//static const int64 kint64max = static_cast<int64>(0x7FFFFFFFFFFFFFFFLL);
+
+
+// HM: Always use aligned load to keep ourselves out of trouble. Sorry.
+
+inline uint16 UNALIGNED_LOAD16(const void *p) {
+  uint16 t;
+  memcpy(&t, p, sizeof t);
+  return t;
+}
+
+inline uint32 UNALIGNED_LOAD32(const void *p) {
+  uint32 t;
+  memcpy(&t, p, sizeof t);
+  return t;
+}
+
+inline uint64 UNALIGNED_LOAD64(const void *p) {
+  uint64 t;
+  memcpy(&t, p, sizeof t);
+  return t;
+}
+
+inline void UNALIGNED_STORE16(void *p, uint16 v) {
+  memcpy(p, &v, sizeof v);
+}
+
+inline void UNALIGNED_STORE32(void *p, uint32 v) {
+  memcpy(p, &v, sizeof v);
+}
+
+inline void UNALIGNED_STORE64(void *p, uint64 v) {
+  memcpy(p, &v, sizeof v);
+}
+
+
+// The following guarantees declaration of the byte swap functions.
+#if defined(SNAPPY_IS_BIG_ENDIAN)
+
+#ifdef HAVE_SYS_BYTEORDER_H
+#include <sys/byteorder.h>
+#endif
+
+#ifdef HAVE_SYS_ENDIAN_H
+#include <sys/endian.h>
+#endif
+
+#ifdef _MSC_VER
+#include <stdlib.h>
+#define bswap_16(x) _byteswap_ushort(x)
+#define bswap_32(x) _byteswap_ulong(x)
+#define bswap_64(x) _byteswap_uint64(x)
+
+#elif defined(__APPLE__)
+// Mac OS X / Darwin features
+#include <libkern/OSByteOrder.h>
+#define bswap_16(x) OSSwapInt16(x)
+#define bswap_32(x) OSSwapInt32(x)
+#define bswap_64(x) OSSwapInt64(x)
+
+#elif defined(HAVE_BYTESWAP_H)
+#include <byteswap.h>
+
+#elif defined(bswap32)
+// FreeBSD defines bswap{16,32,64} in <sys/endian.h> (already #included).
+#define bswap_16(x) bswap16(x)
+#define bswap_32(x) bswap32(x)
+#define bswap_64(x) bswap64(x)
+
+#elif defined(BSWAP_64)
+// Solaris 10 defines BSWAP_{16,32,64} in <sys/byteorder.h> (already #included).
+#define bswap_16(x) BSWAP_16(x)
+#define bswap_32(x) BSWAP_32(x)
+#define bswap_64(x) BSWAP_64(x)
+
+#else
+
+inline uint16 bswap_16(uint16 x) {
+  return (x << 8) | (x >> 8);
+}
+
+inline uint32 bswap_32(uint32 x) {
+  x = ((x & 0xff00ff00UL) >> 8) | ((x & 0x00ff00ffUL) << 8);
+  return (x >> 16) | (x << 16);
+}
+
+inline uint64 bswap_64(uint64 x) {
+  x = ((x & 0xff00ff00ff00ff00ULL) >> 8) | ((x & 0x00ff00ff00ff00ffULL) << 8);
+  x = ((x & 0xffff0000ffff0000ULL) >> 16) | ((x & 0x0000ffff0000ffffULL) << 16);
+  return (x >> 32) | (x << 32);
+}
+
+#endif
+
+#endif  // defined(SNAPPY_IS_BIG_ENDIAN)
+
+// Convert to little-endian storage, opposite of network format.
+// Convert x from host to little endian: x = LittleEndian.FromHost(x);
+// convert x from little endian to host: x = LittleEndian.ToHost(x);
+//
+//  Store values into unaligned memory converting to little endian order:
+//    LittleEndian.Store16(p, x);
+//
+//  Load unaligned values stored in little endian converting to host order:
+//    x = LittleEndian.Load16(p);
+class LittleEndian {
+ public:
+  // Conversion functions.
+#if defined(SNAPPY_IS_BIG_ENDIAN)
+
+  static uint16 FromHost16(uint16 x) { return bswap_16(x); }
+  static uint16 ToHost16(uint16 x) { return bswap_16(x); }
+
+  static uint32 FromHost32(uint32 x) { return bswap_32(x); }
+  static uint32 ToHost32(uint32 x) { return bswap_32(x); }
+
+  static bool IsLittleEndian() { return false; }
+
+#else  // !defined(SNAPPY_IS_BIG_ENDIAN)
+
+  static uint16 FromHost16(uint16 x) { return x; }
+  static uint16 ToHost16(uint16 x) { return x; }
+
+  static uint32 FromHost32(uint32 x) { return x; }
+  static uint32 ToHost32(uint32 x) { return x; }
+
+  static bool IsLittleEndian() { return true; }
+
+#endif  // !defined(SNAPPY_IS_BIG_ENDIAN)
+
+  // Functions to do unaligned loads and stores in little-endian order.
+  static uint16 Load16(const void *p) {
+    return ToHost16(UNALIGNED_LOAD16(p));
+  }
+
+  static void Store16(void *p, uint16 v) {
+    UNALIGNED_STORE16(p, FromHost16(v));
+  }
+
+  static uint32 Load32(const void *p) {
+    return ToHost32(UNALIGNED_LOAD32(p));
+  }
+
+  static void Store32(void *p, uint32 v) {
+    UNALIGNED_STORE32(p, FromHost32(v));
+  }
+};
+
+// Some bit-manipulation functions.
+class Bits {
+ public:
+  // Return floor(log2(n)) for positive integer n.
+  static int Log2FloorNonZero(uint32 n);
+
+  // Return floor(log2(n)) for positive integer n.  Returns -1 iff n == 0.
+  static int Log2Floor(uint32 n);
+
+  // Return the first set least / most significant bit, 0-indexed.  Returns an
+  // undefined value if n == 0.  FindLSBSetNonZero() is similar to ffs() except
+  // that it's 0-indexed.
+  static int FindLSBSetNonZero(uint32 n);
+
+#if defined(ARCH_K8) || defined(ARCH_PPC) || defined(ARCH_ARM)
+  static int FindLSBSetNonZero64(uint64 n);
+#endif  // defined(ARCH_K8) || defined(ARCH_PPC) || defined(ARCH_ARM)
+
+ private:
+  // No copying
+  Bits(const Bits&);
+  void operator=(const Bits&);
+};
+
+#ifdef HAVE_BUILTIN_CTZ
+
+inline int Bits::Log2FloorNonZero(uint32 n) {
+  assert(n != 0);
+  // (31 ^ x) is equivalent to (31 - x) for x in [0, 31]. An easy proof
+  // represents subtraction in base 2 and observes that there's no carry.
+  //
+  // GCC and Clang represent __builtin_clz on x86 as 31 ^ _bit_scan_reverse(x).
+  // Using "31 ^" here instead of "31 -" allows the optimizer to strip the
+  // function body down to _bit_scan_reverse(x).
+  return 31 ^ __builtin_clz(n);
+}
+
+inline int Bits::Log2Floor(uint32 n) {
+  return (n == 0) ? -1 : Bits::Log2FloorNonZero(n);
+}
+
+inline int Bits::FindLSBSetNonZero(uint32 n) {
+  assert(n != 0);
+  return __builtin_ctz(n);
+}
+
+#if defined(ARCH_K8) || defined(ARCH_PPC) || defined(ARCH_ARM)
+inline int Bits::FindLSBSetNonZero64(uint64 n) {
+  assert(n != 0);
+  return __builtin_ctzll(n);
+}
+#endif  // defined(ARCH_K8) || defined(ARCH_PPC) || defined(ARCH_ARM)
+
+#elif defined(_MSC_VER)
+
+inline int Bits::Log2FloorNonZero(uint32 n) {
+  assert(n != 0);
+  unsigned long where;
+  _BitScanReverse(&where, n);
+  return static_cast<int>(where);
+}
+
+inline int Bits::Log2Floor(uint32 n) {
+  unsigned long where;
+  if (_BitScanReverse(&where, n))
+    return static_cast<int>(where);
+  return -1;
+}
+
+inline int Bits::FindLSBSetNonZero(uint32 n) {
+  assert(n != 0);
+  unsigned long where;
+  if (_BitScanForward(&where, n))
+    return static_cast<int>(where);
+  return 32;
+}
+
+#if defined(ARCH_K8) || defined(ARCH_PPC) || defined(ARCH_ARM)
+inline int Bits::FindLSBSetNonZero64(uint64 n) {
+  assert(n != 0);
+  unsigned long where;
+  if (_BitScanForward64(&where, n))
+    return static_cast<int>(where);
+  return 64;
+}
+#endif  // defined(ARCH_K8) || defined(ARCH_PPC) || defined(ARCH_ARM)
+
+#else  // Portable versions.
+
+inline int Bits::Log2FloorNonZero(uint32 n) {
+  assert(n != 0);
+
+  int log = 0;
+  uint32 value = n;
+  for (int i = 4; i >= 0; --i) {
+    int shift = (1 << i);
+    uint32 x = value >> shift;
+    if (x != 0) {
+      value = x;
+      log += shift;
+    }
+  }
+  assert(value == 1);
+  return log;
+}
+
+inline int Bits::Log2Floor(uint32 n) {
+  return (n == 0) ? -1 : Bits::Log2FloorNonZero(n);
+}
+
+inline int Bits::FindLSBSetNonZero(uint32 n) {
+  assert(n != 0);
+
+  int rc = 31;
+  for (int i = 4, shift = 1 << 4; i >= 0; --i) {
+    const uint32 x = n << shift;
+    if (x != 0) {
+      n = x;
+      rc -= shift;
+    }
+    shift >>= 1;
+  }
+  return rc;
+}
+
+#if defined(ARCH_K8) || defined(ARCH_PPC) || defined(ARCH_ARM)
+// FindLSBSetNonZero64() is defined in terms of FindLSBSetNonZero().
+inline int Bits::FindLSBSetNonZero64(uint64 n) {
+  assert(n != 0);
+
+  const uint32 bottombits = static_cast<uint32>(n);
+  if (bottombits == 0) {
+    // Bottom bits are zero, so scan in top bits
+    return 32 + FindLSBSetNonZero(static_cast<uint32>(n >> 32));
+  } else {
+    return FindLSBSetNonZero(bottombits);
+  }
+}
+#endif  // defined(ARCH_K8) || defined(ARCH_PPC) || defined(ARCH_ARM)
+
+#endif  // End portable versions.
+
+// Variable-length integer encoding.
+class Varint {
+ public:
+  // Maximum lengths of varint encoding of uint32.
+  static const int kMax32 = 5;
+
+  // Attempts to parse a varint32 from a prefix of the bytes in [ptr,limit-1].
+  // Never reads a character at or beyond limit.  If a valid/terminated varint32
+  // was found in the range, stores it in *OUTPUT and returns a pointer just
+  // past the last byte of the varint32. Else returns NULL.  On success,
+  // "result <= limit".
+  static const char* Parse32WithLimit(const char* ptr, const char* limit,
+                                      uint32* OUTPUT);
+
+  // REQUIRES   "ptr" points to a buffer of length sufficient to hold "v".
+  // EFFECTS    Encodes "v" into "ptr" and returns a pointer to the
+  //            byte just past the last encoded byte.
+  static char* Encode32(char* ptr, uint32 v);
+
+  // EFFECTS    Appends the varint representation of "value" to "*s".
+  static void Append32(string* s, uint32 value);
+};
+
+inline const char* Varint::Parse32WithLimit(const char* p,
+                                            const char* l,
+                                            uint32* OUTPUT) {
+  const unsigned char* ptr = reinterpret_cast<const unsigned char*>(p);
+  const unsigned char* limit = reinterpret_cast<const unsigned char*>(l);
+  uint32 b, result;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result = b & 127;          if (b < 128) goto done;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result |= (b & 127) <<  7; if (b < 128) goto done;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result |= (b & 127) << 14; if (b < 128) goto done;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result |= (b & 127) << 21; if (b < 128) goto done;
+  if (ptr >= limit) return NULL;
+  b = *(ptr++); result |= (b & 127) << 28; if (b < 16) goto done;
+  return NULL;       // Value is too long to be a varint32
+ done:
+  *OUTPUT = result;
+  return reinterpret_cast<const char*>(ptr);
+}
+
+inline char* Varint::Encode32(char* sptr, uint32 v) {
+  // Operate on characters as unsigneds
+  unsigned char* ptr = reinterpret_cast<unsigned char*>(sptr);
+  static const int B = 128;
+  if (v < (1<<7)) {
+    *(ptr++) = v;
+  } else if (v < (1<<14)) {
+    *(ptr++) = v | B;
+    *(ptr++) = v>>7;
+  } else if (v < (1<<21)) {
+    *(ptr++) = v | B;
+    *(ptr++) = (v>>7) | B;
+    *(ptr++) = v>>14;
+  } else if (v < (1<<28)) {
+    *(ptr++) = v | B;
+    *(ptr++) = (v>>7) | B;
+    *(ptr++) = (v>>14) | B;
+    *(ptr++) = v>>21;
+  } else {
+    *(ptr++) = v | B;
+    *(ptr++) = (v>>7) | B;
+    *(ptr++) = (v>>14) | B;
+    *(ptr++) = (v>>21) | B;
+    *(ptr++) = v>>28;
+  }
+  return reinterpret_cast<char*>(ptr);
+}
+
+// If you know the internal layout of the std::string in use, you can
+// replace this function with one that resizes the string without
+// filling the new space with zeros (if applicable) --
+// it will be non-portable but faster.
+inline void STLStringResizeUninitialized(string* s, size_t new_size) {
+  s->resize(new_size);
+}
+
+// Return a mutable char* pointing to a string's internal buffer,
+// which may not be null-terminated. Writing through this pointer will
+// modify the string.
+//
+// string_as_array(&str)[i] is valid for 0 <= i < str.size() until the
+// next call to a string method that invalidates iterators.
+//
+// As of 2006-04, there is no standard-blessed way of getting a
+// mutable reference to a string's internal buffer. However, issue 530
+// (http://www.open-std.org/JTC1/SC22/WG21/docs/lwg-defects.html#530)
+// proposes this as the method. It will officially be part of the standard
+// for C++0x. This should already work on all current implementations.
+inline char* string_as_array(string* str) {
+  return str->empty() ? NULL : &*str->begin();
+}
+
+}  // namespace lbug_snappy
+
+#endif  // #if SNAPPY_NEW_VERSION # else
+
+#endif  // THIRD_PARTY_SNAPPY_OPENSOURCE_SNAPPY_STUBS_INTERNAL_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-public.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-public.h
new file mode 100755
index 0000000000..6d5f42cf70
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-public.h
@@ -0,0 +1,109 @@
+// Copyright 2011 Google Inc. All Rights Reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//     * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+// Various type stubs for the open-source version of Snappy.
+//
+// This file cannot include config.h, as it is included from snappy.h,
+// which is a public header. Instead, snappy-stubs-public.h is generated by
+// from snappy-stubs-public.h.in at configure time.
+
+#ifndef THIRD_PARTY_SNAPPY_OPENSOURCE_SNAPPY_STUBS_PUBLIC_H_
+#define THIRD_PARTY_SNAPPY_OPENSOURCE_SNAPPY_STUBS_PUBLIC_H_
+
+#include "snappy_version.hpp"
+
+#if SNAPPY_NEW_VERSION
+
+#include <cstddef>
+
+#ifndef _WIN32  // HAVE_SYS_UIO_H
+#include <sys/uio.h>
+#endif  // HAVE_SYS_UIO_H
+
+#define SNAPPY_MAJOR 1
+#define SNAPPY_MINOR 2
+#define SNAPPY_PATCHLEVEL 1
+#define SNAPPY_VERSION \
+    ((SNAPPY_MAJOR << 16) | (SNAPPY_MINOR << 8) | SNAPPY_PATCHLEVEL)
+
+namespace lbug_snappy {
+
+#ifdef _WIN32  // !HAVE_SYS_UIO_H
+// Windows does not have an iovec type, yet the concept is universally useful.
+// It is simple to define it ourselves, so we put it inside our own namespace.
+struct iovec {
+  void* iov_base;
+  size_t iov_len;
+};
+#endif  // !HAVE_SYS_UIO_H
+
+}  // namespace lbug_snappy
+
+#else // #if SNAPPY_NEW_VERSION
+
+#include <cstddef>
+#include <cstdint>
+#include <string>
+
+#ifndef _WIN32  // HAVE_SYS_UIO_H
+#include <sys/uio.h>
+#endif  // HAVE_SYS_UIO_H
+
+#define SNAPPY_MAJOR 1
+#define SNAPPY_MINOR 1
+#define SNAPPY_PATCHLEVEL 7
+#define SNAPPY_VERSION \
+((SNAPPY_MAJOR << 16) | (SNAPPY_MINOR << 8) | SNAPPY_PATCHLEVEL)
+
+namespace lbug_snappy {
+
+using int8 = std::int8_t;
+using uint8 = std::uint8_t;
+using int16 = std::int16_t;
+using uint16 = std::uint16_t;
+using int32 = std::int32_t;
+using uint32 = std::uint32_t;
+using int64 = std::int64_t;
+using uint64 = std::uint64_t;
+
+using string = std::string;
+
+#ifdef _WIN32  // !HAVE_SYS_UIO_H
+// Windows does not have an iovec type, yet the concept is universally useful.
+// It is simple to define it ourselves, so we put it inside our own namespace.
+struct iovec {
+  void* iov_base;
+  size_t iov_len;
+};
+#endif  // !HAVE_SYS_UIO_H
+
+}  // namespace lbug_snappy
+
+#endif  // #if SNAPPY_NEW_VERSION # else
+
+#endif  // THIRD_PARTY_SNAPPY_OPENSOURCE_SNAPPY_STUBS_PUBLIC_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-public.h.in b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-public.h.in
new file mode 100644
index 0000000000..02947fabd5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy-stubs-public.h.in
@@ -0,0 +1,63 @@
+// Copyright 2011 Google Inc. All Rights Reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//     * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+// Various type stubs for the open-source version of Snappy.
+//
+// This file cannot include config.h, as it is included from snappy.h,
+// which is a public header. Instead, snappy-stubs-public.h is generated by
+// from snappy-stubs-public.h.in at configure time.
+
+#ifndef THIRD_PARTY_SNAPPY_OPENSOURCE_SNAPPY_STUBS_PUBLIC_H_
+#define THIRD_PARTY_SNAPPY_OPENSOURCE_SNAPPY_STUBS_PUBLIC_H_
+
+#include <cstddef>
+
+#if ${HAVE_SYS_UIO_H_01}  // HAVE_SYS_UIO_H
+#include <sys/uio.h>
+#endif  // HAVE_SYS_UIO_H
+
+#define SNAPPY_MAJOR ${PROJECT_VERSION_MAJOR}
+#define SNAPPY_MINOR ${PROJECT_VERSION_MINOR}
+#define SNAPPY_PATCHLEVEL ${PROJECT_VERSION_PATCH}
+#define SNAPPY_VERSION \
+    ((SNAPPY_MAJOR << 16) | (SNAPPY_MINOR << 8) | SNAPPY_PATCHLEVEL)
+
+namespace snappy {
+
+#if !${HAVE_SYS_UIO_H_01}  // !HAVE_SYS_UIO_H
+// Windows does not have an iovec type, yet the concept is universally useful.
+// It is simple to define it ourselves, so we put it inside our own namespace.
+struct iovec {
+  void* iov_base;
+  size_t iov_len;
+};
+#endif  // !HAVE_SYS_UIO_H
+
+}  // namespace snappy
+
+#endif  // THIRD_PARTY_SNAPPY_OPENSOURCE_SNAPPY_STUBS_PUBLIC_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy.cc b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy.cc
new file mode 100644
index 0000000000..7638121b37
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy.cc
@@ -0,0 +1,4288 @@
+// Copyright 2005 Google Inc. All Rights Reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//     * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#include "snappy_version.hpp"
+
+#if SNAPPY_NEW_VERSION
+
+#include "snappy-internal.h"
+#include "snappy-sinksource.h"
+#include "snappy.h"
+#if !defined(SNAPPY_HAVE_BMI2)
+// __BMI2__ is defined by GCC and Clang. Visual Studio doesn't target BMI2
+// specifically, but it does define __AVX2__ when AVX2 support is available.
+// Fortunately, AVX2 was introduced in Haswell, just like BMI2.
+//
+// BMI2 is not defined as a subset of AVX2 (unlike SSSE3 and AVX above). So,
+// GCC and Clang can build code with AVX2 enabled but BMI2 disabled, in which
+// case issuing BMI2 instructions results in a compiler error.
+#if defined(__BMI2__) || (defined(_MSC_VER) && defined(__AVX2__))
+#define SNAPPY_HAVE_BMI2 1
+#else
+#define SNAPPY_HAVE_BMI2 0
+#endif
+#endif  // !defined(SNAPPY_HAVE_BMI2)
+
+#if !defined(SNAPPY_HAVE_X86_CRC32)
+#if defined(__SSE4_2__)
+#define SNAPPY_HAVE_X86_CRC32 1
+#else
+#define SNAPPY_HAVE_X86_CRC32 0
+#endif
+#endif  // !defined(SNAPPY_HAVE_X86_CRC32)
+
+#if !defined(SNAPPY_HAVE_NEON_CRC32)
+#if SNAPPY_HAVE_NEON && defined(__ARM_FEATURE_CRC32)
+#define SNAPPY_HAVE_NEON_CRC32 1
+#else
+#define SNAPPY_HAVE_NEON_CRC32 0
+#endif
+#endif  // !defined(SNAPPY_HAVE_NEON_CRC32)
+
+#if SNAPPY_HAVE_BMI2 || SNAPPY_HAVE_X86_CRC32
+// Please do not replace with <x86intrin.h>. or with headers that assume more
+// advanced SSE versions without checking with all the OWNERS.
+#include <immintrin.h>
+#elif SNAPPY_HAVE_NEON_CRC32
+#include <arm_acle.h>
+#endif
+
+#include <algorithm>
+#include <array>
+#include <cstddef>
+#include <cstdint>
+#include <cstdio>
+#include <cstring>
+#include <memory>
+#include <string>
+#include <utility>
+#include <vector>
+
+namespace lbug_snappy {
+
+namespace {
+
+// The amount of slop bytes writers are using for unconditional copies.
+constexpr int kSlopBytes = 64;
+
+using internal::char_table;
+using internal::COPY_1_BYTE_OFFSET;
+using internal::COPY_2_BYTE_OFFSET;
+using internal::COPY_4_BYTE_OFFSET;
+using internal::kMaximumTagLength;
+using internal::LITERAL;
+#if SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+using internal::V128;
+using internal::V128_Load;
+using internal::V128_LoadU;
+using internal::V128_Shuffle;
+using internal::V128_StoreU;
+using internal::V128_DupChar;
+#endif
+
+// We translate the information encoded in a tag through a lookup table to a
+// format that requires fewer instructions to decode. Effectively we store
+// the length minus the tag part of the offset. The lowest significant byte
+// thus stores the length. While total length - offset is given by
+// entry - ExtractOffset(type). The nice thing is that the subtraction
+// immediately sets the flags for the necessary check that offset >= length.
+// This folds the cmp with sub. We engineer the long literals and copy-4 to
+// always fail this check, so their presence doesn't affect the fast path.
+// To prevent literals from triggering the guard against offset < length (offset
+// does not apply to literals) the table is giving them a spurious offset of
+// 256.
+inline constexpr int16_t MakeEntry(int16_t len, int16_t offset) {
+  return len - (offset << 8);
+}
+
+inline constexpr int16_t LengthMinusOffset(int data, int type) {
+  return type == 3   ? 0xFF                    // copy-4 (or type == 3)
+         : type == 2 ? MakeEntry(data + 1, 0)  // copy-2
+         : type == 1 ? MakeEntry((data & 7) + 4, data >> 3)  // copy-1
+         : data < 60 ? MakeEntry(data + 1, 1)  // note spurious offset.
+                     : 0xFF;                   // long literal
+}
+
+inline constexpr int16_t LengthMinusOffset(uint8_t tag) {
+  return LengthMinusOffset(tag >> 2, tag & 3);
+}
+
+template <size_t... Ints>
+struct index_sequence {};
+
+template <std::size_t N, size_t... Is>
+struct make_index_sequence : make_index_sequence<N - 1, N - 1, Is...> {};
+
+template <size_t... Is>
+struct make_index_sequence<0, Is...> : index_sequence<Is...> {};
+
+template <size_t... seq>
+constexpr std::array<int16_t, 256> MakeTable(index_sequence<seq...>) {
+  return std::array<int16_t, 256>{LengthMinusOffset(seq)...};
+}
+
+alignas(64) const std::array<int16_t, 256> kLengthMinusOffset =
+    MakeTable(make_index_sequence<256>{});
+
+// Given a table of uint16_t whose size is mask / 2 + 1, return a pointer to the
+// relevant entry, if any, for the given bytes.  Any hash function will do,
+// but a good hash function reduces the number of collisions and thus yields
+// better compression for compressible input.
+//
+// REQUIRES: mask is 2 * (table_size - 1), and table_size is a power of two.
+inline uint16_t* TableEntry(uint16_t* table, uint32_t bytes, uint32_t mask) {
+  // Our choice is quicker-and-dirtier than the typical hash function;
+  // empirically, that seems beneficial.  The upper bits of kMagic * bytes are a
+  // higher-quality hash than the lower bits, so when using kMagic * bytes we
+  // also shift right to get a higher-quality end result.  There's no similar
+  // issue with a CRC because all of the output bits of a CRC are equally good
+  // "hashes." So, a CPU instruction for CRC, if available, tends to be a good
+  // choice.
+#if SNAPPY_HAVE_NEON_CRC32
+  // We use mask as the second arg to the CRC function, as it's about to
+  // be used anyway; it'd be equally correct to use 0 or some constant.
+  // Mathematically, _mm_crc32_u32 (or similar) is a function of the
+  // xor of its arguments.
+  const uint32_t hash = __crc32cw(bytes, mask);
+#elif SNAPPY_HAVE_X86_CRC32
+  const uint32_t hash = _mm_crc32_u32(bytes, mask);
+#else
+  constexpr uint32_t kMagic = 0x1e35a7bd;
+  const uint32_t hash = (kMagic * bytes) >> (31 - kMaxHashTableBits);
+#endif
+  return reinterpret_cast<uint16_t*>(reinterpret_cast<uintptr_t>(table) +
+                                     (hash & mask));
+}
+
+inline uint16_t* TableEntry4ByteMatch(uint16_t* table, uint32_t bytes,
+                                      uint32_t mask) {
+  constexpr uint32_t kMagic = 2654435761U;
+  const uint32_t hash = (kMagic * bytes) >> (32 - kMaxHashTableBits);
+  return reinterpret_cast<uint16_t*>(reinterpret_cast<uintptr_t>(table) +
+                                     (hash & mask));
+}
+
+inline uint16_t* TableEntry8ByteMatch(uint16_t* table, uint64_t bytes,
+                                      uint32_t mask) {
+  constexpr uint64_t kMagic = 58295818150454627ULL;
+  const uint32_t hash = (kMagic * bytes) >> (64 - kMaxHashTableBits);
+  return reinterpret_cast<uint16_t*>(reinterpret_cast<uintptr_t>(table) +
+                                     (hash & mask));
+}
+
+}  // namespace
+
+size_t MaxCompressedLength(size_t source_bytes) {
+  // Compressed data can be defined as:
+  //    compressed := item* literal*
+  //    item       := literal* copy
+  //
+  // The trailing literal sequence has a space blowup of at most 62/60
+  // since a literal of length 60 needs one tag byte + one extra byte
+  // for length information.
+  //
+  // Item blowup is trickier to measure.  Suppose the "copy" op copies
+  // 4 bytes of data.  Because of a special check in the encoding code,
+  // we produce a 4-byte copy only if the offset is < 65536.  Therefore
+  // the copy op takes 3 bytes to encode, and this type of item leads
+  // to at most the 62/60 blowup for representing literals.
+  //
+  // Suppose the "copy" op copies 5 bytes of data.  If the offset is big
+  // enough, it will take 5 bytes to encode the copy op.  Therefore the
+  // worst case here is a one-byte literal followed by a five-byte copy.
+  // I.e., 6 bytes of input turn into 7 bytes of "compressed" data.
+  //
+  // This last factor dominates the blowup, so the final estimate is:
+  return 32 + source_bytes + source_bytes / 6;
+}
+
+namespace {
+
+void UnalignedCopy64(const void* src, void* dst) {
+  char tmp[8];
+  std::memcpy(tmp, src, 8);
+  std::memcpy(dst, tmp, 8);
+}
+
+void UnalignedCopy128(const void* src, void* dst) {
+  // std::memcpy() gets vectorized when the appropriate compiler options are
+  // used. For example, x86 compilers targeting SSE2+ will optimize to an SSE2
+  // load and store.
+  char tmp[16];
+  std::memcpy(tmp, src, 16);
+  std::memcpy(dst, tmp, 16);
+}
+
+template <bool use_16bytes_chunk>
+inline void ConditionalUnalignedCopy128(const char* src, char* dst) {
+  if (use_16bytes_chunk) {
+    UnalignedCopy128(src, dst);
+  } else {
+    UnalignedCopy64(src, dst);
+    UnalignedCopy64(src + 8, dst + 8);
+  }
+}
+
+// Copy [src, src+(op_limit-op)) to [op, (op_limit-op)) a byte at a time. Used
+// for handling COPY operations where the input and output regions may overlap.
+// For example, suppose:
+//    src       == "ab"
+//    op        == src + 2
+//    op_limit  == op + 20
+// After IncrementalCopySlow(src, op, op_limit), the result will have eleven
+// copies of "ab"
+//    ababababababababababab
+// Note that this does not match the semantics of either std::memcpy() or
+// std::memmove().
+inline char* IncrementalCopySlow(const char* src, char* op,
+                                 char* const op_limit) {
+  // TODO: Remove pragma when LLVM is aware this
+  // function is only called in cold regions and when cold regions don't get
+  // vectorized or unrolled.
+#ifdef __clang__
+#pragma clang loop unroll(disable)
+#endif
+  while (op < op_limit) {
+    *op++ = *src++;
+  }
+  return op_limit;
+}
+
+#if SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+
+// Computes the bytes for shuffle control mask (please read comments on
+// 'pattern_generation_masks' as well) for the given index_offset and
+// pattern_size. For example, when the 'offset' is 6, it will generate a
+// repeating pattern of size 6. So, the first 16 byte indexes will correspond to
+// the pattern-bytes {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3} and the
+// next 16 byte indexes will correspond to the pattern-bytes {4, 5, 0, 1, 2, 3,
+// 4, 5, 0, 1, 2, 3, 4, 5, 0, 1}. These byte index sequences are generated by
+// calling MakePatternMaskBytes(0, 6, index_sequence<16>()) and
+// MakePatternMaskBytes(16, 6, index_sequence<16>()) respectively.
+template <size_t... indexes>
+inline constexpr std::array<char, sizeof...(indexes)> MakePatternMaskBytes(
+    int index_offset, int pattern_size, index_sequence<indexes...>) {
+  return {static_cast<char>((index_offset + indexes) % pattern_size)...};
+}
+
+// Computes the shuffle control mask bytes array for given pattern-sizes and
+// returns an array.
+template <size_t... pattern_sizes_minus_one>
+inline constexpr std::array<std::array<char, sizeof(V128)>,
+                            sizeof...(pattern_sizes_minus_one)>
+MakePatternMaskBytesTable(int index_offset,
+                          index_sequence<pattern_sizes_minus_one...>) {
+  return {
+      MakePatternMaskBytes(index_offset, pattern_sizes_minus_one + 1,
+                           make_index_sequence</*indexes=*/sizeof(V128)>())...};
+}
+
+// This is an array of shuffle control masks that can be used as the source
+// operand for PSHUFB to permute the contents of the destination XMM register
+// into a repeating byte pattern.
+alignas(16) constexpr std::array<std::array<char, sizeof(V128)>,
+                                 16> pattern_generation_masks =
+    MakePatternMaskBytesTable(
+        /*index_offset=*/0,
+        /*pattern_sizes_minus_one=*/make_index_sequence<16>());
+
+// Similar to 'pattern_generation_masks', this table is used to "rotate" the
+// pattern so that we can copy the *next 16 bytes* consistent with the pattern.
+// Basically, pattern_reshuffle_masks is a continuation of
+// pattern_generation_masks. It follows that, pattern_reshuffle_masks is same as
+// pattern_generation_masks for offsets 1, 2, 4, 8 and 16.
+alignas(16) constexpr std::array<std::array<char, sizeof(V128)>,
+                                 16> pattern_reshuffle_masks =
+    MakePatternMaskBytesTable(
+        /*index_offset=*/16,
+        /*pattern_sizes_minus_one=*/make_index_sequence<16>());
+
+SNAPPY_ATTRIBUTE_ALWAYS_INLINE
+static inline V128 LoadPattern(const char* src, const size_t pattern_size) {
+  V128 generation_mask = V128_Load(reinterpret_cast<const V128*>(
+      pattern_generation_masks[pattern_size - 1].data()));
+  // Uninitialized bytes are masked out by the shuffle mask.
+  // TODO: remove annotation and macro defs once MSan is fixed.
+  SNAPPY_ANNOTATE_MEMORY_IS_INITIALIZED(src + pattern_size, 16 - pattern_size);
+  return V128_Shuffle(V128_LoadU(reinterpret_cast<const V128*>(src)),
+                      generation_mask);
+}
+
+SNAPPY_ATTRIBUTE_ALWAYS_INLINE
+static inline std::pair<V128 /* pattern */, V128 /* reshuffle_mask */>
+LoadPatternAndReshuffleMask(const char* src, const size_t pattern_size) {
+  V128 pattern = LoadPattern(src, pattern_size);
+
+  // This mask will generate the next 16 bytes in-place. Doing so enables us to
+  // write data by at most 4 V128_StoreU.
+  //
+  // For example, suppose pattern is:        abcdefabcdefabcd
+  // Shuffling with this mask will generate: efabcdefabcdefab
+  // Shuffling again will generate:          cdefabcdefabcdef
+  V128 reshuffle_mask = V128_Load(reinterpret_cast<const V128*>(
+      pattern_reshuffle_masks[pattern_size - 1].data()));
+  return {pattern, reshuffle_mask};
+}
+
+#endif  // SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+
+// Fallback for when we need to copy while extending the pattern, for example
+// copying 10 bytes from 3 positions back abc -> abcabcabcabca.
+//
+// REQUIRES: [dst - offset, dst + 64) is a valid address range.
+SNAPPY_ATTRIBUTE_ALWAYS_INLINE
+static inline bool Copy64BytesWithPatternExtension(char* dst, size_t offset) {
+#if SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+  if (SNAPPY_PREDICT_TRUE(offset <= 16)) {
+    switch (offset) {
+      case 0:
+        return false;
+      case 1: {
+        // TODO: Ideally we should memset, move back once the
+        // codegen issues are fixed.
+        V128 pattern = V128_DupChar(dst[-1]);
+        for (int i = 0; i < 4; i++) {
+          V128_StoreU(reinterpret_cast<V128*>(dst + 16 * i), pattern);
+        }
+        return true;
+      }
+      case 2:
+      case 4:
+      case 8:
+      case 16: {
+        V128 pattern = LoadPattern(dst - offset, offset);
+        for (int i = 0; i < 4; i++) {
+          V128_StoreU(reinterpret_cast<V128*>(dst + 16 * i), pattern);
+        }
+        return true;
+      }
+      default: {
+        auto pattern_and_reshuffle_mask =
+            LoadPatternAndReshuffleMask(dst - offset, offset);
+        V128 pattern = pattern_and_reshuffle_mask.first;
+        V128 reshuffle_mask = pattern_and_reshuffle_mask.second;
+        for (int i = 0; i < 4; i++) {
+          V128_StoreU(reinterpret_cast<V128*>(dst + 16 * i), pattern);
+          pattern = V128_Shuffle(pattern, reshuffle_mask);
+        }
+        return true;
+      }
+    }
+  }
+#else
+  if (SNAPPY_PREDICT_TRUE(offset < 16)) {
+    if (SNAPPY_PREDICT_FALSE(offset == 0)) return false;
+    // Extend the pattern to the first 16 bytes.
+    // The simpler formulation of `dst[i - offset]` induces undefined behavior.
+    for (int i = 0; i < 16; i++) dst[i] = (dst - offset)[i];
+    // Find a multiple of pattern >= 16.
+    static std::array<uint8_t, 16> pattern_sizes = []() {
+      std::array<uint8_t, 16> res;
+      for (int i = 1; i < 16; i++) res[i] = (16 / i + 1) * i;
+      return res;
+    }();
+    offset = pattern_sizes[offset];
+    for (int i = 1; i < 4; i++) {
+      std::memcpy(dst + i * 16, dst + i * 16 - offset, 16);
+    }
+    return true;
+  }
+#endif  // SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+
+  // Very rare.
+  for (int i = 0; i < 4; i++) {
+    std::memcpy(dst + i * 16, dst + i * 16 - offset, 16);
+  }
+  return true;
+}
+
+// Copy [src, src+(op_limit-op)) to [op, op_limit) but faster than
+// IncrementalCopySlow. buf_limit is the address past the end of the writable
+// region of the buffer.
+inline char* IncrementalCopy(const char* src, char* op, char* const op_limit,
+                             char* const buf_limit) {
+#if SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+  constexpr int big_pattern_size_lower_bound = 16;
+#else
+  constexpr int big_pattern_size_lower_bound = 8;
+#endif
+
+  // Terminology:
+  //
+  // slop = buf_limit - op
+  // pat  = op - src
+  // len  = op_limit - op
+  assert(src < op);
+  assert(op < op_limit);
+  assert(op_limit <= buf_limit);
+  // NOTE: The copy tags use 3 or 6 bits to store the copy length, so len <= 64.
+  assert(op_limit - op <= 64);
+  // NOTE: In practice the compressor always emits len >= 4, so it is ok to
+  // assume that to optimize this function, but this is not guaranteed by the
+  // compression format, so we have to also handle len < 4 in case the input
+  // does not satisfy these conditions.
+
+  size_t pattern_size = op - src;
+  // The cases are split into different branches to allow the branch predictor,
+  // FDO, and static prediction hints to work better. For each input we list the
+  // ratio of invocations that match each condition.
+  //
+  // input        slop < 16   pat < 8  len > 16
+  // ------------------------------------------
+  // html|html4|cp   0%         1.01%    27.73%
+  // urls            0%         0.88%    14.79%
+  // jpg             0%        64.29%     7.14%
+  // pdf             0%         2.56%    58.06%
+  // txt[1-4]        0%         0.23%     0.97%
+  // pb              0%         0.96%    13.88%
+  // bin             0.01%     22.27%    41.17%
+  //
+  // It is very rare that we don't have enough slop for doing block copies. It
+  // is also rare that we need to expand a pattern. Small patterns are common
+  // for incompressible formats and for those we are plenty fast already.
+  // Lengths are normally not greater than 16 but they vary depending on the
+  // input. In general if we always predict len <= 16 it would be an ok
+  // prediction.
+  //
+  // In order to be fast we want a pattern >= 16 bytes (or 8 bytes in non-SSE)
+  // and an unrolled loop copying 1x 16 bytes (or 2x 8 bytes in non-SSE) at a
+  // time.
+
+  // Handle the uncommon case where pattern is less than 16 (or 8 in non-SSE)
+  // bytes.
+  if (pattern_size < big_pattern_size_lower_bound) {
+#if SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+    // Load the first eight bytes into an 128-bit XMM register, then use PSHUFB
+    // to permute the register's contents in-place into a repeating sequence of
+    // the first "pattern_size" bytes.
+    // For example, suppose:
+    //    src       == "abc"
+    //    op        == op + 3
+    // After V128_Shuffle(), "pattern" will have five copies of "abc"
+    // followed by one byte of slop: abcabcabcabcabca.
+    //
+    // The non-SSE fallback implementation suffers from store-forwarding stalls
+    // because its loads and stores partly overlap. By expanding the pattern
+    // in-place, we avoid the penalty.
+
+    // Typically, the op_limit is the gating factor so try to simplify the loop
+    // based on that.
+    if (SNAPPY_PREDICT_TRUE(op_limit <= buf_limit - 15)) {
+      auto pattern_and_reshuffle_mask =
+          LoadPatternAndReshuffleMask(src, pattern_size);
+      V128 pattern = pattern_and_reshuffle_mask.first;
+      V128 reshuffle_mask = pattern_and_reshuffle_mask.second;
+
+      // There is at least one, and at most four 16-byte blocks. Writing four
+      // conditionals instead of a loop allows FDO to layout the code with
+      // respect to the actual probabilities of each length.
+      // TODO: Replace with loop with trip count hint.
+      V128_StoreU(reinterpret_cast<V128*>(op), pattern);
+
+      if (op + 16 < op_limit) {
+        pattern = V128_Shuffle(pattern, reshuffle_mask);
+        V128_StoreU(reinterpret_cast<V128*>(op + 16), pattern);
+      }
+      if (op + 32 < op_limit) {
+        pattern = V128_Shuffle(pattern, reshuffle_mask);
+        V128_StoreU(reinterpret_cast<V128*>(op + 32), pattern);
+      }
+      if (op + 48 < op_limit) {
+        pattern = V128_Shuffle(pattern, reshuffle_mask);
+        V128_StoreU(reinterpret_cast<V128*>(op + 48), pattern);
+      }
+      return op_limit;
+    }
+    char* const op_end = buf_limit - 15;
+    if (SNAPPY_PREDICT_TRUE(op < op_end)) {
+      auto pattern_and_reshuffle_mask =
+          LoadPatternAndReshuffleMask(src, pattern_size);
+      V128 pattern = pattern_and_reshuffle_mask.first;
+      V128 reshuffle_mask = pattern_and_reshuffle_mask.second;
+
+      // This code path is relatively cold however so we save code size
+      // by avoiding unrolling and vectorizing.
+      //
+      // TODO: Remove pragma when when cold regions don't get
+      // vectorized or unrolled.
+#ifdef __clang__
+#pragma clang loop unroll(disable)
+#endif
+      do {
+        V128_StoreU(reinterpret_cast<V128*>(op), pattern);
+        pattern = V128_Shuffle(pattern, reshuffle_mask);
+        op += 16;
+      } while (SNAPPY_PREDICT_TRUE(op < op_end));
+    }
+    return IncrementalCopySlow(op - pattern_size, op, op_limit);
+#else   // !SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+    // If plenty of buffer space remains, expand the pattern to at least 8
+    // bytes. The way the following loop is written, we need 8 bytes of buffer
+    // space if pattern_size >= 4, 11 bytes if pattern_size is 1 or 3, and 10
+    // bytes if pattern_size is 2.  Precisely encoding that is probably not
+    // worthwhile; instead, invoke the slow path if we cannot write 11 bytes
+    // (because 11 are required in the worst case).
+    if (SNAPPY_PREDICT_TRUE(op <= buf_limit - 11)) {
+      while (pattern_size < 8) {
+        UnalignedCopy64(src, op);
+        op += pattern_size;
+        pattern_size *= 2;
+      }
+      if (SNAPPY_PREDICT_TRUE(op >= op_limit)) return op_limit;
+    } else {
+      return IncrementalCopySlow(src, op, op_limit);
+    }
+#endif  // SNAPPY_HAVE_VECTOR_BYTE_SHUFFLE
+  }
+  assert(pattern_size >= big_pattern_size_lower_bound);
+  constexpr bool use_16bytes_chunk = big_pattern_size_lower_bound == 16;
+
+  // Copy 1x 16 bytes (or 2x 8 bytes in non-SSE) at a time. Because op - src can
+  // be < 16 in non-SSE, a single UnalignedCopy128 might overwrite data in op.
+  // UnalignedCopy64 is safe because expanding the pattern to at least 8 bytes
+  // guarantees that op - src >= 8.
+  //
+  // Typically, the op_limit is the gating factor so try to simplify the loop
+  // based on that.
+  if (SNAPPY_PREDICT_TRUE(op_limit <= buf_limit - 15)) {
+    // There is at least one, and at most four 16-byte blocks. Writing four
+    // conditionals instead of a loop allows FDO to layout the code with respect
+    // to the actual probabilities of each length.
+    // TODO: Replace with loop with trip count hint.
+    ConditionalUnalignedCopy128<use_16bytes_chunk>(src, op);
+    if (op + 16 < op_limit) {
+      ConditionalUnalignedCopy128<use_16bytes_chunk>(src + 16, op + 16);
+    }
+    if (op + 32 < op_limit) {
+      ConditionalUnalignedCopy128<use_16bytes_chunk>(src + 32, op + 32);
+    }
+    if (op + 48 < op_limit) {
+      ConditionalUnalignedCopy128<use_16bytes_chunk>(src + 48, op + 48);
+    }
+    return op_limit;
+  }
+
+  // Fall back to doing as much as we can with the available slop in the
+  // buffer. This code path is relatively cold however so we save code size by
+  // avoiding unrolling and vectorizing.
+  //
+  // TODO: Remove pragma when when cold regions don't get vectorized
+  // or unrolled.
+#ifdef __clang__
+#pragma clang loop unroll(disable)
+#endif
+  for (char* op_end = buf_limit - 16; op < op_end; op += 16, src += 16) {
+    ConditionalUnalignedCopy128<use_16bytes_chunk>(src, op);
+  }
+  if (op >= op_limit) return op_limit;
+
+  // We only take this branch if we didn't have enough slop and we can do a
+  // single 8 byte copy.
+  if (SNAPPY_PREDICT_FALSE(op <= buf_limit - 8)) {
+    UnalignedCopy64(src, op);
+    src += 8;
+    op += 8;
+  }
+  return IncrementalCopySlow(src, op, op_limit);
+}
+
+}  // namespace
+
+template <bool allow_fast_path>
+static inline char* EmitLiteral(char* op, const char* literal, int len) {
+  // The vast majority of copies are below 16 bytes, for which a
+  // call to std::memcpy() is overkill. This fast path can sometimes
+  // copy up to 15 bytes too much, but that is okay in the
+  // main loop, since we have a bit to go on for both sides:
+  //
+  //   - The input will always have kInputMarginBytes = 15 extra
+  //     available bytes, as long as we're in the main loop, and
+  //     if not, allow_fast_path = false.
+  //   - The output will always have 32 spare bytes (see
+  //     MaxCompressedLength).
+  assert(len > 0);  // Zero-length literals are disallowed
+  int n = len - 1;
+  if (allow_fast_path && len <= 16) {
+    // Fits in tag byte
+    *op++ = LITERAL | (n << 2);
+
+    UnalignedCopy128(literal, op);
+    return op + len;
+  }
+
+  if (n < 60) {
+    // Fits in tag byte
+    *op++ = LITERAL | (n << 2);
+  } else {
+    int count = (Bits::Log2Floor(n) >> 3) + 1;
+    assert(count >= 1);
+    assert(count <= 4);
+    *op++ = LITERAL | ((59 + count) << 2);
+    // Encode in upcoming bytes.
+    // Write 4 bytes, though we may care about only 1 of them. The output buffer
+    // is guaranteed to have at least 3 more spaces left as 'len >= 61' holds
+    // here and there is a std::memcpy() of size 'len' below.
+    LittleEndian::Store32(op, n);
+    op += count;
+  }
+  // When allow_fast_path is true, we can overwrite up to 16 bytes.
+  if (allow_fast_path) {
+    char* destination = op;
+    const char* source = literal;
+    const char* end = destination + len;
+    do {
+      std::memcpy(destination, source, 16);
+      destination += 16;
+      source += 16;
+    } while (destination < end);
+  } else {
+    std::memcpy(op, literal, len);
+  }
+  return op + len;
+}
+
+template <bool len_less_than_12>
+static inline char* EmitCopyAtMost64(char* op, size_t offset, size_t len) {
+  assert(len <= 64);
+  assert(len >= 4);
+  assert(offset < 65536);
+  assert(len_less_than_12 == (len < 12));
+
+  if (len_less_than_12) {
+    uint32_t u = (len << 2) + (offset << 8);
+    uint32_t copy1 = COPY_1_BYTE_OFFSET - (4 << 2) + ((offset >> 3) & 0xe0);
+    uint32_t copy2 = COPY_2_BYTE_OFFSET - (1 << 2);
+    // It turns out that offset < 2048 is a difficult to predict branch.
+    // `perf record` shows this is the highest percentage of branch misses in
+    // benchmarks. This code produces branch free code, the data dependency
+    // chain that bottlenecks the throughput is so long that a few extra
+    // instructions are completely free (IPC << 6 because of data deps).
+    u += offset < 2048 ? copy1 : copy2;
+    LittleEndian::Store32(op, u);
+    op += offset < 2048 ? 2 : 3;
+  } else {
+    // Write 4 bytes, though we only care about 3 of them.  The output buffer
+    // is required to have some slack, so the extra byte won't overrun it.
+    uint32_t u = COPY_2_BYTE_OFFSET + ((len - 1) << 2) + (offset << 8);
+    LittleEndian::Store32(op, u);
+    op += 3;
+  }
+  return op;
+}
+
+template <bool len_less_than_12>
+static inline char* EmitCopy(char* op, size_t offset, size_t len) {
+  assert(len_less_than_12 == (len < 12));
+  if (len_less_than_12) {
+    return EmitCopyAtMost64</*len_less_than_12=*/true>(op, offset, len);
+  } else {
+    // A special case for len <= 64 might help, but so far measurements suggest
+    // it's in the noise.
+
+    // Emit 64 byte copies but make sure to keep at least four bytes reserved.
+    while (SNAPPY_PREDICT_FALSE(len >= 68)) {
+      op = EmitCopyAtMost64</*len_less_than_12=*/false>(op, offset, 64);
+      len -= 64;
+    }
+
+    // One or two copies will now finish the job.
+    if (len > 64) {
+      op = EmitCopyAtMost64</*len_less_than_12=*/false>(op, offset, 60);
+      len -= 60;
+    }
+
+    // Emit remainder.
+    if (len < 12) {
+      op = EmitCopyAtMost64</*len_less_than_12=*/true>(op, offset, len);
+    } else {
+      op = EmitCopyAtMost64</*len_less_than_12=*/false>(op, offset, len);
+    }
+    return op;
+  }
+}
+
+bool GetUncompressedLength(const char* start, size_t n, size_t* result) {
+  uint32_t v = 0;
+  const char* limit = start + n;
+  if (Varint::Parse32WithLimit(start, limit, &v) != NULL) {
+    *result = v;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+namespace {
+uint32_t CalculateTableSize(uint32_t input_size) {
+  static_assert(
+      kMaxHashTableSize >= kMinHashTableSize,
+      "kMaxHashTableSize should be greater or equal to kMinHashTableSize.");
+  if (input_size > kMaxHashTableSize) {
+    return kMaxHashTableSize;
+  }
+  if (input_size < kMinHashTableSize) {
+    return kMinHashTableSize;
+  }
+  // This is equivalent to Log2Ceiling(input_size), assuming input_size > 1.
+  // 2 << Log2Floor(x - 1) is equivalent to 1 << (1 + Log2Floor(x - 1)).
+  return 2u << Bits::Log2Floor(input_size - 1);
+}
+}  // namespace
+
+namespace internal {
+WorkingMemory::WorkingMemory(size_t input_size) {
+  const size_t max_fragment_size = std::min(input_size, kBlockSize);
+  const size_t table_size = CalculateTableSize(max_fragment_size);
+  size_ = table_size * sizeof(*table_) + max_fragment_size +
+          MaxCompressedLength(max_fragment_size);
+  mem_ = std::allocator<char>().allocate(size_);
+  table_ = reinterpret_cast<uint16_t*>(mem_);
+  input_ = mem_ + table_size * sizeof(*table_);
+  output_ = input_ + max_fragment_size;
+}
+
+WorkingMemory::~WorkingMemory() {
+  std::allocator<char>().deallocate(mem_, size_);
+}
+
+uint16_t* WorkingMemory::GetHashTable(size_t fragment_size,
+                                      int* table_size) const {
+  const size_t htsize = CalculateTableSize(fragment_size);
+  memset(table_, 0, htsize * sizeof(*table_));
+  *table_size = htsize;
+  return table_;
+}
+}  // end namespace internal
+
+// Flat array compression that does not emit the "uncompressed length"
+// prefix. Compresses "input" string to the "*op" buffer.
+//
+// REQUIRES: "input" is at most "kBlockSize" bytes long.
+// REQUIRES: "op" points to an array of memory that is at least
+// "MaxCompressedLength(input.size())" in size.
+// REQUIRES: All elements in "table[0..table_size-1]" are initialized to zero.
+// REQUIRES: "table_size" is a power of two
+//
+// Returns an "end" pointer into "op" buffer.
+// "end - op" is the compressed size of "input".
+namespace internal {
+char* CompressFragment(const char* input, size_t input_size, char* op,
+                       uint16_t* table, const int table_size) {
+  // "ip" is the input pointer, and "op" is the output pointer.
+  const char* ip = input;
+  assert(input_size <= kBlockSize);
+  assert((table_size & (table_size - 1)) == 0);  // table must be power of two
+  const uint32_t mask = 2 * (table_size - 1);
+  const char* ip_end = input + input_size;
+  const char* base_ip = ip;
+
+  const size_t kInputMarginBytes = 15;
+  if (SNAPPY_PREDICT_TRUE(input_size >= kInputMarginBytes)) {
+    const char* ip_limit = input + input_size - kInputMarginBytes;
+
+    for (uint32_t preload = LittleEndian::Load32(ip + 1);;) {
+      // Bytes in [next_emit, ip) will be emitted as literal bytes.  Or
+      // [next_emit, ip_end) after the main loop.
+      const char* next_emit = ip++;
+      uint64_t data = LittleEndian::Load64(ip);
+      // The body of this loop calls EmitLiteral once and then EmitCopy one or
+      // more times.  (The exception is that when we're close to exhausting
+      // the input we goto emit_remainder.)
+      //
+      // In the first iteration of this loop we're just starting, so
+      // there's nothing to copy, so calling EmitLiteral once is
+      // necessary.  And we only start a new iteration when the
+      // current iteration has determined that a call to EmitLiteral will
+      // precede the next call to EmitCopy (if any).
+      //
+      // Step 1: Scan forward in the input looking for a 4-byte-long match.
+      // If we get close to exhausting the input then goto emit_remainder.
+      //
+      // Heuristic match skipping: If 32 bytes are scanned with no matches
+      // found, start looking only at every other byte. If 32 more bytes are
+      // scanned (or skipped), look at every third byte, etc.. When a match is
+      // found, immediately go back to looking at every byte. This is a small
+      // loss (~5% performance, ~0.1% density) for compressible data due to more
+      // bookkeeping, but for non-compressible data (such as JPEG) it's a huge
+      // win since the compressor quickly "realizes" the data is incompressible
+      // and doesn't bother looking for matches everywhere.
+      //
+      // The "skip" variable keeps track of how many bytes there are since the
+      // last match; dividing it by 32 (ie. right-shifting by five) gives the
+      // number of bytes to move ahead for each iteration.
+      uint32_t skip = 32;
+
+      const char* candidate;
+      if (ip_limit - ip >= 16) {
+        auto delta = ip - base_ip;
+        for (int j = 0; j < 4; ++j) {
+          for (int k = 0; k < 4; ++k) {
+            int i = 4 * j + k;
+            // These for-loops are meant to be unrolled. So we can freely
+            // special case the first iteration to use the value already
+            // loaded in preload.
+            uint32_t dword = i == 0 ? preload : static_cast<uint32_t>(data);
+            assert(dword == LittleEndian::Load32(ip + i));
+            uint16_t* table_entry = TableEntry(table, dword, mask);
+            candidate = base_ip + *table_entry;
+            assert(candidate >= base_ip);
+            assert(candidate < ip + i);
+            *table_entry = delta + i;
+            if (SNAPPY_PREDICT_FALSE(LittleEndian::Load32(candidate) == dword)) {
+              *op = LITERAL | (i << 2);
+              UnalignedCopy128(next_emit, op + 1);
+              ip += i;
+              op = op + i + 2;
+              goto emit_match;
+            }
+            data >>= 8;
+          }
+          data = LittleEndian::Load64(ip + 4 * j + 4);
+        }
+        ip += 16;
+        skip += 16;
+      }
+      while (true) {
+        assert(static_cast<uint32_t>(data) == LittleEndian::Load32(ip));
+        uint16_t* table_entry = TableEntry(table, data, mask);
+        uint32_t bytes_between_hash_lookups = skip >> 5;
+        skip += bytes_between_hash_lookups;
+        const char* next_ip = ip + bytes_between_hash_lookups;
+        if (SNAPPY_PREDICT_FALSE(next_ip > ip_limit)) {
+          ip = next_emit;
+          goto emit_remainder;
+        }
+        candidate = base_ip + *table_entry;
+        assert(candidate >= base_ip);
+        assert(candidate < ip);
+
+        *table_entry = ip - base_ip;
+        if (SNAPPY_PREDICT_FALSE(static_cast<uint32_t>(data) ==
+                                LittleEndian::Load32(candidate))) {
+          break;
+        }
+        data = LittleEndian::Load32(next_ip);
+        ip = next_ip;
+      }
+
+      // Step 2: A 4-byte match has been found.  We'll later see if more
+      // than 4 bytes match.  But, prior to the match, input
+      // bytes [next_emit, ip) are unmatched.  Emit them as "literal bytes."
+      assert(next_emit + 16 <= ip_end);
+      op = EmitLiteral</*allow_fast_path=*/true>(op, next_emit, ip - next_emit);
+
+      // Step 3: Call EmitCopy, and then see if another EmitCopy could
+      // be our next move.  Repeat until we find no match for the
+      // input immediately after what was consumed by the last EmitCopy call.
+      //
+      // If we exit this loop normally then we need to call EmitLiteral next,
+      // though we don't yet know how big the literal will be.  We handle that
+      // by proceeding to the next iteration of the main loop.  We also can exit
+      // this loop via goto if we get close to exhausting the input.
+    emit_match:
+      do {
+        // We have a 4-byte match at ip, and no need to emit any
+        // "literal bytes" prior to ip.
+        const char* base = ip;
+        std::pair<size_t, bool> p =
+            FindMatchLength(candidate + 4, ip + 4, ip_end, &data);
+        size_t matched = 4 + p.first;
+        ip += matched;
+        size_t offset = base - candidate;
+        assert(0 == memcmp(base, candidate, matched));
+        if (p.second) {
+          op = EmitCopy</*len_less_than_12=*/true>(op, offset, matched);
+        } else {
+          op = EmitCopy</*len_less_than_12=*/false>(op, offset, matched);
+        }
+        if (SNAPPY_PREDICT_FALSE(ip >= ip_limit)) {
+          goto emit_remainder;
+        }
+        // Expect 5 bytes to match
+        assert((data & 0xFFFFFFFFFF) ==
+               (LittleEndian::Load64(ip) & 0xFFFFFFFFFF));
+        // We are now looking for a 4-byte match again.  We read
+        // table[Hash(ip, mask)] for that.  To improve compression,
+        // we also update table[Hash(ip - 1, mask)] and table[Hash(ip, mask)].
+        *TableEntry(table, LittleEndian::Load32(ip - 1), mask) =
+            ip - base_ip - 1;
+        uint16_t* table_entry = TableEntry(table, data, mask);
+        candidate = base_ip + *table_entry;
+        *table_entry = ip - base_ip;
+        // Measurements on the benchmarks have shown the following probabilities
+        // for the loop to exit (ie. avg. number of iterations is reciprocal).
+        // BM_Flat/6  txt1    p = 0.3-0.4
+        // BM_Flat/7  txt2    p = 0.35
+        // BM_Flat/8  txt3    p = 0.3-0.4
+        // BM_Flat/9  txt3    p = 0.34-0.4
+        // BM_Flat/10 pb      p = 0.4
+        // BM_Flat/11 gaviota p = 0.1
+        // BM_Flat/12 cp      p = 0.5
+        // BM_Flat/13 c       p = 0.3
+      } while (static_cast<uint32_t>(data) == LittleEndian::Load32(candidate));
+      // Because the least significant 5 bytes matched, we can utilize data
+      // for the next iteration.
+      preload = data >> 8;
+    }
+  }
+
+emit_remainder:
+  // Emit the remaining bytes as a literal
+  if (ip < ip_end) {
+    op = EmitLiteral</*allow_fast_path=*/false>(op, ip, ip_end - ip);
+  }
+
+  return op;
+}
+
+char* CompressFragmentDoubleHash(const char* input, size_t input_size, char* op,
+                                 uint16_t* table, const int table_size,
+                                 uint16_t* table2, const int table_size2) {
+  (void)table_size2;
+  assert(table_size == table_size2);
+  // "ip" is the input pointer, and "op" is the output pointer.
+  const char* ip = input;
+  assert(input_size <= kBlockSize);
+  assert((table_size & (table_size - 1)) == 0);  // table must be power of two
+  const uint32_t mask = 2 * (table_size - 1);
+  const char* ip_end = input + input_size;
+  const char* base_ip = ip;
+
+  const size_t kInputMarginBytes = 15;
+  if (SNAPPY_PREDICT_TRUE(input_size >= kInputMarginBytes)) {
+    const char* ip_limit = input + input_size - kInputMarginBytes;
+
+    for (;;) {
+      const char* next_emit = ip++;
+      uint64_t data = LittleEndian::Load64(ip);
+      uint32_t skip = 512;
+
+      const char* candidate;
+      uint32_t candidate_length;
+      while (true) {
+        assert(static_cast<uint32_t>(data) == LittleEndian::Load32(ip));
+        uint16_t* table_entry2 = TableEntry8ByteMatch(table2, data, mask);
+        uint32_t bytes_between_hash_lookups = skip >> 9;
+        skip++;
+        const char* next_ip = ip + bytes_between_hash_lookups;
+        if (SNAPPY_PREDICT_FALSE(next_ip > ip_limit)) {
+          ip = next_emit;
+          goto emit_remainder;
+        }
+        candidate = base_ip + *table_entry2;
+        assert(candidate >= base_ip);
+        assert(candidate < ip);
+
+        *table_entry2 = ip - base_ip;
+        if (SNAPPY_PREDICT_FALSE(static_cast<uint32_t>(data) ==
+                                LittleEndian::Load32(candidate))) {
+          candidate_length =
+              FindMatchLengthPlain(candidate + 4, ip + 4, ip_end) + 4;
+          break;
+        }
+
+        uint16_t* table_entry = TableEntry4ByteMatch(table, data, mask);
+        candidate = base_ip + *table_entry;
+        assert(candidate >= base_ip);
+        assert(candidate < ip);
+
+        *table_entry = ip - base_ip;
+        if (SNAPPY_PREDICT_FALSE(static_cast<uint32_t>(data) ==
+                                LittleEndian::Load32(candidate))) {
+          candidate_length =
+              FindMatchLengthPlain(candidate + 4, ip + 4, ip_end) + 4;
+          table_entry2 =
+              TableEntry8ByteMatch(table2, LittleEndian::Load64(ip + 1), mask);
+          auto candidate2 = base_ip + *table_entry2;
+          size_t candidate_length2 =
+              FindMatchLengthPlain(candidate2, ip + 1, ip_end);
+          if (candidate_length2 > candidate_length) {
+            *table_entry2 = ip - base_ip;
+            candidate = candidate2;
+            candidate_length = candidate_length2;
+            ++ip;
+          }
+          break;
+        }
+        data = LittleEndian::Load64(next_ip);
+        ip = next_ip;
+      }
+      // Backtrack to the point it matches fully.
+      while (ip > next_emit && candidate > base_ip &&
+             *(ip - 1) == *(candidate - 1)) {
+        --ip;
+        --candidate;
+        ++candidate_length;
+      }
+      *TableEntry8ByteMatch(table2, LittleEndian::Load64(ip + 1), mask) =
+          ip - base_ip + 1;
+      *TableEntry8ByteMatch(table2, LittleEndian::Load64(ip + 2), mask) =
+          ip - base_ip + 2;
+      *TableEntry4ByteMatch(table, LittleEndian::Load32(ip + 1), mask) =
+          ip - base_ip + 1;
+      // Step 2: A 4-byte or 8-byte match has been found.
+      // We'll later see if more than 4 bytes match.  But, prior to the match,
+      // input bytes [next_emit, ip) are unmatched.  Emit them as
+      // "literal bytes."
+      assert(next_emit + 16 <= ip_end);
+      if (ip - next_emit > 0) {
+        op = EmitLiteral</*allow_fast_path=*/true>(op, next_emit,
+                                                   ip - next_emit);
+      }
+      // Step 3: Call EmitCopy, and then see if another EmitCopy could
+      // be our next move.  Repeat until we find no match for the
+      // input immediately after what was consumed by the last EmitCopy call.
+      //
+      // If we exit this loop normally then we need to call EmitLiteral next,
+      // though we don't yet know how big the literal will be.  We handle that
+      // by proceeding to the next iteration of the main loop.  We also can exit
+      // this loop via goto if we get close to exhausting the input.
+      do {
+        // We have a 4-byte match at ip, and no need to emit any
+        // "literal bytes" prior to ip.
+        const char* base = ip;
+        ip += candidate_length;
+        size_t offset = base - candidate;
+        if (candidate_length < 12) {
+          op =
+              EmitCopy</*len_less_than_12=*/true>(op, offset, candidate_length);
+        } else {
+          op = EmitCopy</*len_less_than_12=*/false>(op, offset,
+                                                    candidate_length);
+        }
+        if (SNAPPY_PREDICT_FALSE(ip >= ip_limit)) {
+          goto emit_remainder;
+        }
+        // We are now looking for a 4-byte match again.  We read
+        // table[Hash(ip, mask)] for that. To improve compression,
+        // we also update several previous table entries.
+        if (ip - base_ip > 7) {
+          *TableEntry8ByteMatch(table2, LittleEndian::Load64(ip - 7), mask) =
+              ip - base_ip - 7;
+          *TableEntry8ByteMatch(table2, LittleEndian::Load64(ip - 4), mask) =
+              ip - base_ip - 4;
+        }
+        *TableEntry8ByteMatch(table2, LittleEndian::Load64(ip - 3), mask) =
+            ip - base_ip - 3;
+        *TableEntry8ByteMatch(table2, LittleEndian::Load64(ip - 2), mask) =
+            ip - base_ip - 2;
+        *TableEntry4ByteMatch(table, LittleEndian::Load32(ip - 2), mask) =
+            ip - base_ip - 2;
+        *TableEntry4ByteMatch(table, LittleEndian::Load32(ip - 1), mask) =
+            ip - base_ip - 1;
+
+        uint16_t* table_entry =
+            TableEntry8ByteMatch(table2, LittleEndian::Load64(ip), mask);
+        candidate = base_ip + *table_entry;
+        *table_entry = ip - base_ip;
+        if (LittleEndian::Load32(ip) == LittleEndian::Load32(candidate)) {
+          candidate_length =
+              FindMatchLengthPlain(candidate + 4, ip + 4, ip_end) + 4;
+          continue;
+        }
+        table_entry =
+            TableEntry4ByteMatch(table, LittleEndian::Load32(ip), mask);
+        candidate = base_ip + *table_entry;
+        *table_entry = ip - base_ip;
+        if (LittleEndian::Load32(ip) == LittleEndian::Load32(candidate)) {
+          candidate_length =
+              FindMatchLengthPlain(candidate + 4, ip + 4, ip_end) + 4;
+          continue;
+        }
+        break;
+      } while (true);
+    }
+  }
+
+emit_remainder:
+  // Emit the remaining bytes as a literal
+  if (ip < ip_end) {
+    op = EmitLiteral</*allow_fast_path=*/false>(op, ip, ip_end - ip);
+  }
+
+  return op;
+}
+}  // end namespace internal
+
+static inline void Report(int token, const char *algorithm, size_t
+compressed_size, size_t uncompressed_size) {
+  // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+  (void)token;
+  (void)algorithm;
+  (void)compressed_size;
+  (void)uncompressed_size;
+}
+
+// Signature of output types needed by decompression code.
+// The decompression code is templatized on a type that obeys this
+// signature so that we do not pay virtual function call overhead in
+// the middle of a tight decompression loop.
+//
+// class DecompressionWriter {
+//  public:
+//   // Called before decompression
+//   void SetExpectedLength(size_t length);
+//
+//   // For performance a writer may choose to donate the cursor variable to the
+//   // decompression function. The decompression will inject it in all its
+//   // function calls to the writer. Keeping the important output cursor as a
+//   // function local stack variable allows the compiler to keep it in
+//   // register, which greatly aids performance by avoiding loads and stores of
+//   // this variable in the fast path loop iterations.
+//   T GetOutputPtr() const;
+//
+//   // At end of decompression the loop donates the ownership of the cursor
+//   // variable back to the writer by calling this function.
+//   void SetOutputPtr(T op);
+//
+//   // Called after decompression
+//   bool CheckLength() const;
+//
+//   // Called repeatedly during decompression
+//   // Each function get a pointer to the op (output pointer), that the writer
+//   // can use and update. Note it's important that these functions get fully
+//   // inlined so that no actual address of the local variable needs to be
+//   // taken.
+//   bool Append(const char* ip, size_t length, T* op);
+//   bool AppendFromSelf(uint32_t offset, size_t length, T* op);
+//
+//   // The rules for how TryFastAppend differs from Append are somewhat
+//   // convoluted:
+//   //
+//   //  - TryFastAppend is allowed to decline (return false) at any
+//   //    time, for any reason -- just "return false" would be
+//   //    a perfectly legal implementation of TryFastAppend.
+//   //    The intention is for TryFastAppend to allow a fast path
+//   //    in the common case of a small append.
+//   //  - TryFastAppend is allowed to read up to <available> bytes
+//   //    from the input buffer, whereas Append is allowed to read
+//   //    <length>. However, if it returns true, it must leave
+//   //    at least five (kMaximumTagLength) bytes in the input buffer
+//   //    afterwards, so that there is always enough space to read the
+//   //    next tag without checking for a refill.
+//   //  - TryFastAppend must always return decline (return false)
+//   //    if <length> is 61 or more, as in this case the literal length is not
+//   //    decoded fully. In practice, this should not be a big problem,
+//   //    as it is unlikely that one would implement a fast path accepting
+//   //    this much data.
+//   //
+//   bool TryFastAppend(const char* ip, size_t available, size_t length, T* op);
+// };
+
+static inline uint32_t ExtractLowBytes(const uint32_t& v, int n) {
+  assert(n >= 0);
+  assert(n <= 4);
+#if SNAPPY_HAVE_BMI2
+  return _bzhi_u32(v, 8 * n);
+#else
+  // This needs to be wider than uint32_t otherwise `mask << 32` will be
+  // undefined.
+  uint64_t mask = 0xffffffff;
+  return v & ~(mask << (8 * n));
+#endif
+}
+
+static inline bool LeftShiftOverflows(uint8_t value, uint32_t shift) {
+  assert(shift < 32);
+  static const uint8_t masks[] = {
+      0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,  //
+      0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,  //
+      0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,  //
+      0x00, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe};
+  return (value & masks[shift]) != 0;
+}
+
+inline bool Copy64BytesWithPatternExtension(ptrdiff_t dst, size_t offset) {
+  // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+  (void)dst;
+  return offset != 0;
+}
+
+// Copies between size bytes and 64 bytes from src to dest.  size cannot exceed
+// 64.  More than size bytes, but never exceeding 64, might be copied if doing
+// so gives better performance.  [src, src + size) must not overlap with
+// [dst, dst + size), but [src, src + 64) may overlap with [dst, dst + 64).
+void MemCopy64(char* dst, const void* src, size_t size) {
+  // Always copy this many bytes.  If that's below size then copy the full 64.
+  constexpr int kShortMemCopy = 32;
+
+  assert(size <= 64);
+  assert(std::less_equal<const void*>()(static_cast<const char*>(src) + size,
+                                        dst) ||
+         std::less_equal<const void*>()(dst + size, src));
+
+  // We know that src and dst are at least size bytes apart. However, because we
+  // might copy more than size bytes the copy still might overlap past size.
+  // E.g. if src and dst appear consecutively in memory (src + size >= dst).
+  // TODO: Investigate wider copies on other platforms.
+#if defined(__x86_64__) && defined(__AVX__)
+  assert(kShortMemCopy <= 32);
+  __m256i data = _mm256_lddqu_si256(static_cast<const __m256i *>(src));
+  _mm256_storeu_si256(reinterpret_cast<__m256i *>(dst), data);
+  // Profiling shows that nearly all copies are short.
+  if (SNAPPY_PREDICT_FALSE(size > kShortMemCopy)) {
+    data = _mm256_lddqu_si256(static_cast<const __m256i *>(src) + 1);
+    _mm256_storeu_si256(reinterpret_cast<__m256i *>(dst) + 1, data);
+  }
+#else
+  std::memmove(dst, src, kShortMemCopy);
+  // Profiling shows that nearly all copies are short.
+  if (SNAPPY_PREDICT_FALSE(size > kShortMemCopy)) {
+    std::memmove(dst + kShortMemCopy,
+                 static_cast<const uint8_t*>(src) + kShortMemCopy,
+                 64 - kShortMemCopy);
+  }
+#endif
+}
+
+void MemCopy64(ptrdiff_t dst, const void* src, size_t size) {
+  // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+  (void)dst;
+  (void)src;
+  (void)size;
+}
+
+void ClearDeferred(const void** deferred_src, size_t* deferred_length,
+                   uint8_t* safe_source) {
+  *deferred_src = safe_source;
+  *deferred_length = 0;
+}
+
+void DeferMemCopy(const void** deferred_src, size_t* deferred_length,
+                  const void* src, size_t length) {
+  *deferred_src = src;
+  *deferred_length = length;
+}
+
+SNAPPY_ATTRIBUTE_ALWAYS_INLINE
+inline size_t AdvanceToNextTagARMOptimized(const uint8_t** ip_p, size_t* tag) {
+  const uint8_t*& ip = *ip_p;
+  // This section is crucial for the throughput of the decompression loop.
+  // The latency of an iteration is fundamentally constrained by the
+  // following data chain on ip.
+  // ip -> c = Load(ip) -> delta1 = (c & 3)        -> ip += delta1 or delta2
+  //                       delta2 = ((c >> 2) + 1)    ip++
+  // This is different from X86 optimizations because ARM has conditional add
+  // instruction (csinc) and it removes several register moves.
+  const size_t tag_type = *tag & 3;
+  const bool is_literal = (tag_type == 0);
+  if (is_literal) {
+    size_t next_literal_tag = (*tag >> 2) + 1;
+    *tag = ip[next_literal_tag];
+    ip += next_literal_tag + 1;
+  } else {
+    *tag = ip[tag_type];
+    ip += tag_type + 1;
+  }
+  return tag_type;
+}
+
+SNAPPY_ATTRIBUTE_ALWAYS_INLINE
+inline size_t AdvanceToNextTagX86Optimized(const uint8_t** ip_p, size_t* tag) {
+  const uint8_t*& ip = *ip_p;
+  // This section is crucial for the throughput of the decompression loop.
+  // The latency of an iteration is fundamentally constrained by the
+  // following data chain on ip.
+  // ip -> c = Load(ip) -> ip1 = ip + 1 + (c & 3) -> ip = ip1 or ip2
+  //                       ip2 = ip + 2 + (c >> 2)
+  // This amounts to 8 cycles.
+  // 5 (load) + 1 (c & 3) + 1 (lea ip1, [ip + (c & 3) + 1]) + 1 (cmov)
+  size_t literal_len = *tag >> 2;
+  size_t tag_type = *tag;
+  bool is_literal;
+#if defined(__GCC_ASM_FLAG_OUTPUTS__) && defined(__x86_64__)
+  // TODO clang misses the fact that the (c & 3) already correctly
+  // sets the zero flag.
+  asm("and $3, %k[tag_type]\n\t"
+      : [tag_type] "+r"(tag_type), "=@ccz"(is_literal)
+      :: "cc");
+#else
+  tag_type &= 3;
+  is_literal = (tag_type == 0);
+#endif
+  // TODO
+  // This is code is subtle. Loading the values first and then cmov has less
+  // latency then cmov ip and then load. However clang would move the loads
+  // in an optimization phase, volatile prevents this transformation.
+  // Note that we have enough slop bytes (64) that the loads are always valid.
+  size_t tag_literal =
+      static_cast<const volatile uint8_t*>(ip)[1 + literal_len];
+  size_t tag_copy = static_cast<const volatile uint8_t*>(ip)[tag_type];
+  *tag = is_literal ? tag_literal : tag_copy;
+  const uint8_t* ip_copy = ip + 1 + tag_type;
+  const uint8_t* ip_literal = ip + 2 + literal_len;
+  ip = is_literal ? ip_literal : ip_copy;
+#if defined(__GNUC__) && defined(__x86_64__)
+  // TODO Clang is "optimizing" zero-extension (a totally free
+  // operation) this means that after the cmov of tag, it emits another movzb
+  // tag, byte(tag). It really matters as it's on the core chain. This dummy
+  // asm, persuades clang to do the zero-extension at the load (it's automatic)
+  // removing the expensive movzb.
+  asm("" ::"r"(tag_copy));
+#endif
+  return tag_type;
+}
+
+// Extract the offset for copy-1 and copy-2 returns 0 for literals or copy-4.
+inline uint32_t ExtractOffset(uint32_t val, size_t tag_type) {
+  // For x86 non-static storage works better. For ARM static storage is better.
+  // TODO: Once the array is recognized as a register, improve the
+  // readability for x86.
+#if defined(__x86_64__)
+  constexpr uint64_t kExtractMasksCombined = 0x0000FFFF00FF0000ull;
+  uint16_t result;
+  memcpy(&result,
+         reinterpret_cast<const char*>(&kExtractMasksCombined) + 2 * tag_type,
+         sizeof(result));
+  return val & result;
+#elif defined(__aarch64__)
+  constexpr uint64_t kExtractMasksCombined = 0x0000FFFF00FF0000ull;
+  return val & static_cast<uint32_t>(
+      (kExtractMasksCombined >> (tag_type * 16)) & 0xFFFF);
+#else
+  static constexpr uint32_t kExtractMasks[4] = {0, 0xFF, 0xFFFF, 0};
+  return val & kExtractMasks[tag_type];
+#endif
+};
+
+// Core decompression loop, when there is enough data available.
+// Decompresses the input buffer [ip, ip_limit) into the output buffer
+// [op, op_limit_min_slop). Returning when either we are too close to the end
+// of the input buffer, or we exceed op_limit_min_slop or when a exceptional
+// tag is encountered (literal of length > 60) or a copy-4.
+// Returns {ip, op} at the points it stopped decoding.
+// TODO This function probably does not need to be inlined, as it
+// should decode large chunks at a time. This allows runtime dispatch to
+// implementations based on CPU capability (BMI2 / perhaps 32 / 64 byte memcpy).
+template <typename T>
+std::pair<const uint8_t*, ptrdiff_t> DecompressBranchless(
+    const uint8_t* ip, const uint8_t* ip_limit, ptrdiff_t op, T op_base,
+    ptrdiff_t op_limit_min_slop) {
+  // If deferred_src is invalid point it here.
+  uint8_t safe_source[64];
+  const void* deferred_src;
+  size_t deferred_length;
+  ClearDeferred(&deferred_src, &deferred_length, safe_source);
+
+  // We unroll the inner loop twice so we need twice the spare room.
+  op_limit_min_slop -= kSlopBytes;
+  if (2 * (kSlopBytes + 1) < ip_limit - ip && op < op_limit_min_slop) {
+    const uint8_t* const ip_limit_min_slop = ip_limit - 2 * kSlopBytes - 1;
+    ip++;
+    // ip points just past the tag and we are touching at maximum kSlopBytes
+    // in an iteration.
+    size_t tag = ip[-1];
+#if defined(__clang__) && defined(__aarch64__)
+    // Workaround for https://bugs.llvm.org/show_bug.cgi?id=51317
+    // when loading 1 byte, clang for aarch64 doesn't realize that it(ldrb)
+    // comes with free zero-extension, so clang generates another
+    // 'and xn, xm, 0xff' before it use that as the offset. This 'and' is
+    // redundant and can be removed by adding this dummy asm, which gives
+    // clang a hint that we're doing the zero-extension at the load.
+    asm("" ::"r"(tag));
+#endif
+    do {
+      // The throughput is limited by instructions, unrolling the inner loop
+      // twice reduces the amount of instructions checking limits and also
+      // leads to reduced mov's.
+
+      SNAPPY_PREFETCH(ip + 128);
+      for (int i = 0; i < 2; i++) {
+        const uint8_t* old_ip = ip;
+        assert(tag == ip[-1]);
+        // For literals tag_type = 0, hence we will always obtain 0 from
+        // ExtractLowBytes. For literals offset will thus be kLiteralOffset.
+        ptrdiff_t len_minus_offset = kLengthMinusOffset[tag];
+        uint32_t next;
+#if defined(__aarch64__)
+        size_t tag_type = AdvanceToNextTagARMOptimized(&ip, &tag);
+        // We never need more than 16 bits. Doing a Load16 allows the compiler
+        // to elide the masking operation in ExtractOffset.
+        next = LittleEndian::Load16(old_ip);
+#else
+        size_t tag_type = AdvanceToNextTagX86Optimized(&ip, &tag);
+        next = LittleEndian::Load32(old_ip);
+#endif
+        size_t len = len_minus_offset & 0xFF;
+        ptrdiff_t extracted = ExtractOffset(next, tag_type);
+        ptrdiff_t len_min_offset = len_minus_offset - extracted;
+        if (SNAPPY_PREDICT_FALSE(len_minus_offset > extracted)) {
+          if (SNAPPY_PREDICT_FALSE(len & 0x80)) {
+            // Exceptional case (long literal or copy 4).
+            // Actually doing the copy here is negatively impacting the main
+            // loop due to compiler incorrectly allocating a register for
+            // this fallback. Hence we just break.
+          break_loop:
+            ip = old_ip;
+            goto exit;
+          }
+          // Only copy-1 or copy-2 tags can get here.
+          assert(tag_type == 1 || tag_type == 2);
+          std::ptrdiff_t delta = (op + deferred_length) + len_min_offset - len;
+          // Guard against copies before the buffer start.
+          // Execute any deferred MemCopy since we write to dst here.
+          MemCopy64(op_base + op, deferred_src, deferred_length);
+          op += deferred_length;
+          ClearDeferred(&deferred_src, &deferred_length, safe_source);
+          if (SNAPPY_PREDICT_FALSE(delta < 0 ||
+                                  !Copy64BytesWithPatternExtension(
+                                      op_base + op, len - len_min_offset))) {
+            goto break_loop;
+          }
+          // We aren't deferring this copy so add length right away.
+          op += len;
+          continue;
+        }
+        std::ptrdiff_t delta = (op + deferred_length) + len_min_offset - len;
+        if (SNAPPY_PREDICT_FALSE(delta < 0)) {
+          // Due to the spurious offset in literals have this will trigger
+          // at the start of a block when op is still smaller than 256.
+          if (tag_type != 0) goto break_loop;
+          MemCopy64(op_base + op, deferred_src, deferred_length);
+          op += deferred_length;
+          DeferMemCopy(&deferred_src, &deferred_length, old_ip, len);
+          continue;
+        }
+
+        // For copies we need to copy from op_base + delta, for literals
+        // we need to copy from ip instead of from the stream.
+        const void* from =
+            tag_type ? reinterpret_cast<void*>(op_base + delta) : old_ip;
+        MemCopy64(op_base + op, deferred_src, deferred_length);
+        op += deferred_length;
+        DeferMemCopy(&deferred_src, &deferred_length, from, len);
+      }
+    } while (ip < ip_limit_min_slop &&
+             static_cast<ptrdiff_t>(op + deferred_length) < op_limit_min_slop);
+  exit:
+    ip--;
+    assert(ip <= ip_limit);
+  }
+  // If we deferred a copy then we can perform.  If we are up to date then we
+  // might not have enough slop bytes and could run past the end.
+  if (deferred_length) {
+    MemCopy64(op_base + op, deferred_src, deferred_length);
+    op += deferred_length;
+    ClearDeferred(&deferred_src, &deferred_length, safe_source);
+  }
+  return {ip, op};
+}
+
+// Helper class for decompression
+class SnappyDecompressor {
+ private:
+  Source* reader_;        // Underlying source of bytes to decompress
+  const char* ip_;        // Points to next buffered byte
+  const char* ip_limit_;  // Points just past buffered bytes
+  // If ip < ip_limit_min_maxtaglen_ it's safe to read kMaxTagLength from
+  // buffer.
+  const char* ip_limit_min_maxtaglen_;
+  uint32_t peeked_;                  // Bytes peeked from reader (need to skip)
+  bool eof_;                         // Hit end of input without an error?
+  char scratch_[kMaximumTagLength];  // See RefillTag().
+
+  // Ensure that all of the tag metadata for the next tag is available
+  // in [ip_..ip_limit_-1].  Also ensures that [ip,ip+4] is readable even
+  // if (ip_limit_ - ip_ < 5).
+  //
+  // Returns true on success, false on error or end of input.
+  bool RefillTag();
+
+  void ResetLimit(const char* ip) {
+    ip_limit_min_maxtaglen_ =
+        ip_limit_ - std::min<ptrdiff_t>(ip_limit_ - ip, kMaximumTagLength - 1);
+  }
+
+ public:
+  explicit SnappyDecompressor(Source* reader)
+      : reader_(reader), ip_(NULL), ip_limit_(NULL), peeked_(0), eof_(false) {}
+
+  ~SnappyDecompressor() {
+    // Advance past any bytes we peeked at from the reader
+    reader_->Skip(peeked_);
+  }
+
+  // Returns true iff we have hit the end of the input without an error.
+  bool eof() const { return eof_; }
+
+  // Read the uncompressed length stored at the start of the compressed data.
+  // On success, stores the length in *result and returns true.
+  // On failure, returns false.
+  bool ReadUncompressedLength(uint32_t* result) {
+    assert(ip_ == NULL);  // Must not have read anything yet
+    // Length is encoded in 1..5 bytes
+    *result = 0;
+    uint32_t shift = 0;
+    while (true) {
+      if (shift >= 32) return false;
+      size_t n;
+      const char* ip = reader_->Peek(&n);
+      if (n == 0) return false;
+      const unsigned char c = *(reinterpret_cast<const unsigned char*>(ip));
+      reader_->Skip(1);
+      uint32_t val = c & 0x7f;
+      if (LeftShiftOverflows(static_cast<uint8_t>(val), shift)) return false;
+      *result |= val << shift;
+      if (c < 128) {
+        break;
+      }
+      shift += 7;
+    }
+    return true;
+  }
+
+  // Process the next item found in the input.
+  // Returns true if successful, false on error or end of input.
+  template <class Writer>
+#if defined(__GNUC__) && defined(__x86_64__)
+  __attribute__((aligned(32)))
+#endif
+  void
+  DecompressAllTags(Writer* writer) {
+    const char* ip = ip_;
+    ResetLimit(ip);
+    auto op = writer->GetOutputPtr();
+    // We could have put this refill fragment only at the beginning of the loop.
+    // However, duplicating it at the end of each branch gives the compiler more
+    // scope to optimize the <ip_limit_ - ip> expression based on the local
+    // context, which overall increases speed.
+#define MAYBE_REFILL()                                      \
+  if (SNAPPY_PREDICT_FALSE(ip >= ip_limit_min_maxtaglen_)) { \
+    ip_ = ip;                                               \
+    if (SNAPPY_PREDICT_FALSE(!RefillTag())) goto exit;       \
+    ip = ip_;                                               \
+    ResetLimit(ip);                                         \
+  }                                                         \
+  preload = static_cast<uint8_t>(*ip)
+
+    // At the start of the for loop below the least significant byte of preload
+    // contains the tag.
+    uint32_t preload;
+    MAYBE_REFILL();
+    for (;;) {
+      {
+        ptrdiff_t op_limit_min_slop;
+        auto op_base = writer->GetBase(&op_limit_min_slop);
+        if (op_base) {
+          auto res =
+              DecompressBranchless(reinterpret_cast<const uint8_t*>(ip),
+                                   reinterpret_cast<const uint8_t*>(ip_limit_),
+                                   op - op_base, op_base, op_limit_min_slop);
+          ip = reinterpret_cast<const char*>(res.first);
+          op = op_base + res.second;
+          MAYBE_REFILL();
+        }
+      }
+      const uint8_t c = static_cast<uint8_t>(preload);
+      ip++;
+
+      // Ratio of iterations that have LITERAL vs non-LITERAL for different
+      // inputs.
+      //
+      // input          LITERAL  NON_LITERAL
+      // -----------------------------------
+      // html|html4|cp   23%        77%
+      // urls            36%        64%
+      // jpg             47%        53%
+      // pdf             19%        81%
+      // txt[1-4]        25%        75%
+      // pb              24%        76%
+      // bin             24%        76%
+      if (SNAPPY_PREDICT_FALSE((c & 0x3) == LITERAL)) {
+        size_t literal_length = (c >> 2) + 1u;
+        if (writer->TryFastAppend(ip, ip_limit_ - ip, literal_length, &op)) {
+          assert(literal_length < 61);
+          ip += literal_length;
+          // NOTE: There is no MAYBE_REFILL() here, as TryFastAppend()
+          // will not return true unless there's already at least five spare
+          // bytes in addition to the literal.
+          preload = static_cast<uint8_t>(*ip);
+          continue;
+        }
+        if (SNAPPY_PREDICT_FALSE(literal_length >= 61)) {
+          // Long literal.
+          const size_t literal_length_length = literal_length - 60;
+          literal_length =
+              ExtractLowBytes(LittleEndian::Load32(ip), literal_length_length) +
+              1;
+          ip += literal_length_length;
+        }
+
+        size_t avail = ip_limit_ - ip;
+        while (avail < literal_length) {
+          if (!writer->Append(ip, avail, &op)) goto exit;
+          literal_length -= avail;
+          reader_->Skip(peeked_);
+          size_t n;
+          ip = reader_->Peek(&n);
+          avail = n;
+          peeked_ = avail;
+          if (avail == 0) goto exit;
+          ip_limit_ = ip + avail;
+          ResetLimit(ip);
+        }
+        if (!writer->Append(ip, literal_length, &op)) goto exit;
+        ip += literal_length;
+        MAYBE_REFILL();
+      } else {
+        if (SNAPPY_PREDICT_FALSE((c & 3) == COPY_4_BYTE_OFFSET)) {
+          const size_t copy_offset = LittleEndian::Load32(ip);
+          const size_t length = (c >> 2) + 1;
+          ip += 4;
+
+          if (!writer->AppendFromSelf(copy_offset, length, &op)) goto exit;
+        } else {
+          const ptrdiff_t entry = kLengthMinusOffset[c];
+          preload = LittleEndian::Load32(ip);
+          const uint32_t trailer = ExtractLowBytes(preload, c & 3);
+          const uint32_t length = entry & 0xff;
+          assert(length > 0);
+
+          // copy_offset/256 is encoded in bits 8..10.  By just fetching
+          // those bits, we get copy_offset (since the bit-field starts at
+          // bit 8).
+          const uint32_t copy_offset = trailer - entry + length;
+          if (!writer->AppendFromSelf(copy_offset, length, &op)) goto exit;
+
+          ip += (c & 3);
+          // By using the result of the previous load we reduce the critical
+          // dependency chain of ip to 4 cycles.
+          preload >>= (c & 3) * 8;
+          if (ip < ip_limit_min_maxtaglen_) continue;
+        }
+        MAYBE_REFILL();
+      }
+    }
+#undef MAYBE_REFILL
+  exit:
+    writer->SetOutputPtr(op);
+  }
+};
+
+constexpr uint32_t CalculateNeeded(uint8_t tag) {
+  return ((tag & 3) == 0 && tag >= (60 * 4))
+             ? (tag >> 2) - 58
+             : (0x05030201 >> ((tag * 8) & 31)) & 0xFF;
+}
+
+#if __cplusplus >= 201402L
+constexpr bool VerifyCalculateNeeded() {
+  for (int i = 0; i < 1; i++) {
+    if (CalculateNeeded(i) != (char_table[i] >> 11) + 1) return false;
+  }
+  return true;
+}
+
+// Make sure CalculateNeeded is correct by verifying it against the established
+// table encoding the number of added bytes needed.
+static_assert(VerifyCalculateNeeded(), "");
+#endif  // c++14
+
+bool SnappyDecompressor::RefillTag() {
+  const char* ip = ip_;
+  if (ip == ip_limit_) {
+    // Fetch a new fragment from the reader
+    reader_->Skip(peeked_);  // All peeked bytes are used up
+    size_t n;
+    ip = reader_->Peek(&n);
+    peeked_ = n;
+    eof_ = (n == 0);
+    if (eof_) return false;
+    ip_limit_ = ip + n;
+  }
+
+  // Read the tag character
+  assert(ip < ip_limit_);
+  const unsigned char c = *(reinterpret_cast<const unsigned char*>(ip));
+  // At this point make sure that the data for the next tag is consecutive.
+  // For copy 1 this means the next 2 bytes (tag and 1 byte offset)
+  // For copy 2 the next 3 bytes (tag and 2 byte offset)
+  // For copy 4 the next 5 bytes (tag and 4 byte offset)
+  // For all small literals we only need 1 byte buf for literals 60...63 the
+  // length is encoded in 1...4 extra bytes.
+  const uint32_t needed = CalculateNeeded(c);
+  assert(needed <= sizeof(scratch_));
+
+  // Read more bytes from reader if needed
+  uint32_t nbuf = ip_limit_ - ip;
+  if (nbuf < needed) {
+    // Stitch together bytes from ip and reader to form the word
+    // contents.  We store the needed bytes in "scratch_".  They
+    // will be consumed immediately by the caller since we do not
+    // read more than we need.
+    std::memmove(scratch_, ip, nbuf);
+    reader_->Skip(peeked_);  // All peeked bytes are used up
+    peeked_ = 0;
+    while (nbuf < needed) {
+      size_t length;
+      const char* src = reader_->Peek(&length);
+      if (length == 0) return false;
+      uint32_t to_add = std::min<uint32_t>(needed - nbuf, length);
+      std::memcpy(scratch_ + nbuf, src, to_add);
+      nbuf += to_add;
+      reader_->Skip(to_add);
+    }
+    assert(nbuf == needed);
+    ip_ = scratch_;
+    ip_limit_ = scratch_ + needed;
+  } else if (nbuf < kMaximumTagLength) {
+    // Have enough bytes, but move into scratch_ so that we do not
+    // read past end of input
+    std::memmove(scratch_, ip, nbuf);
+    reader_->Skip(peeked_);  // All peeked bytes are used up
+    peeked_ = 0;
+    ip_ = scratch_;
+    ip_limit_ = scratch_ + nbuf;
+  } else {
+    // Pass pointer to buffer returned by reader_.
+    ip_ = ip;
+  }
+  return true;
+}
+
+template <typename Writer>
+static bool InternalUncompress(Source* r, Writer* writer) {
+  // Read the uncompressed length from the front of the compressed input
+  SnappyDecompressor decompressor(r);
+  uint32_t uncompressed_len = 0;
+  if (!decompressor.ReadUncompressedLength(&uncompressed_len)) return false;
+
+  return InternalUncompressAllTags(&decompressor, writer, r->Available(),
+                                   uncompressed_len);
+}
+
+template <typename Writer>
+static bool InternalUncompressAllTags(SnappyDecompressor* decompressor,
+                                      Writer* writer, uint32_t compressed_len,
+                                      uint32_t uncompressed_len) {
+    int token = 0;
+  Report(token, "snappy_uncompress", compressed_len, uncompressed_len);
+
+  writer->SetExpectedLength(uncompressed_len);
+
+  // Process the entire input
+  decompressor->DecompressAllTags(writer);
+  writer->Flush();
+  return (decompressor->eof() && writer->CheckLength());
+}
+
+bool GetUncompressedLength(Source* source, uint32_t* result) {
+  SnappyDecompressor decompressor(source);
+  return decompressor.ReadUncompressedLength(result);
+}
+
+size_t Compress(Source* reader, Sink* writer) {
+  return Compress(reader, writer, CompressionOptions{});
+}
+
+size_t Compress(Source* reader, Sink* writer, CompressionOptions options) {
+  assert(options.level == 1 || options.level == 2);
+  int token = 0;
+  size_t written = 0;
+  size_t N = reader->Available();
+  const size_t uncompressed_size = N;
+  char ulength[Varint::kMax32];
+  char* p = Varint::Encode32(ulength, N);
+  writer->Append(ulength, p - ulength);
+  written += (p - ulength);
+
+  internal::WorkingMemory wmem(N);
+
+  while (N > 0) {
+    // Get next block to compress (without copying if possible)
+    size_t fragment_size;
+    const char* fragment = reader->Peek(&fragment_size);
+    assert(fragment_size != 0);  // premature end of input
+    const size_t num_to_read = std::min(N, kBlockSize);
+    size_t bytes_read = fragment_size;
+
+    size_t pending_advance = 0;
+    if (bytes_read >= num_to_read) {
+      // Buffer returned by reader is large enough
+      pending_advance = num_to_read;
+      fragment_size = num_to_read;
+    } else {
+      char* scratch = wmem.GetScratchInput();
+      std::memcpy(scratch, fragment, bytes_read);
+      reader->Skip(bytes_read);
+
+      while (bytes_read < num_to_read) {
+        fragment = reader->Peek(&fragment_size);
+        size_t n = std::min<size_t>(fragment_size, num_to_read - bytes_read);
+        std::memcpy(scratch + bytes_read, fragment, n);
+        bytes_read += n;
+        reader->Skip(n);
+      }
+      assert(bytes_read == num_to_read);
+      fragment = scratch;
+      fragment_size = num_to_read;
+    }
+    assert(fragment_size == num_to_read);
+
+    // Get encoding table for compression
+    int table_size;
+    uint16_t* table = wmem.GetHashTable(num_to_read, &table_size);
+
+    // Compress input_fragment and append to dest
+    int max_output = MaxCompressedLength(num_to_read);
+
+    // Since we encode kBlockSize regions followed by a region
+    // which is <= kBlockSize in length, a previously allocated
+    // scratch_output[] region is big enough for this iteration.
+    // Need a scratch buffer for the output, in case the byte sink doesn't
+    // have room for us directly.
+    char* dest = writer->GetAppendBuffer(max_output, wmem.GetScratchOutput());
+    char* end = nullptr;
+    if (options.level == 1) {
+      end = internal::CompressFragment(fragment, fragment_size, dest, table,
+                                       table_size);
+    } else if (options.level == 2) {
+      end = internal::CompressFragmentDoubleHash(
+          fragment, fragment_size, dest, table, table_size >> 1,
+          table + (table_size >> 1), table_size >> 1);
+    }
+    writer->Append(dest, end - dest);
+    written += (end - dest);
+
+    N -= num_to_read;
+    reader->Skip(pending_advance);
+  }
+
+  Report(token, "snappy_compress", written, uncompressed_size);
+  return written;
+}
+
+// -----------------------------------------------------------------------
+// IOVec interfaces
+// -----------------------------------------------------------------------
+
+// A `Source` implementation that yields the contents of an `iovec` array. Note
+// that `total_size` is the total number of bytes to be read from the elements
+// of `iov` (_not_ the total number of elements in `iov`).
+class SnappyIOVecReader : public Source {
+ public:
+  SnappyIOVecReader(const struct iovec* iov, size_t total_size)
+      : curr_iov_(iov),
+        curr_pos_(total_size > 0 ? reinterpret_cast<const char*>(iov->iov_base)
+                                 : nullptr),
+        curr_size_remaining_(total_size > 0 ? iov->iov_len : 0),
+        total_size_remaining_(total_size) {
+    // Skip empty leading `iovec`s.
+    if (total_size > 0 && curr_size_remaining_ == 0) Advance();
+  }
+
+  ~SnappyIOVecReader() override = default;
+
+  size_t Available() const override { return total_size_remaining_; }
+
+  const char* Peek(size_t* len) override {
+    *len = curr_size_remaining_;
+    return curr_pos_;
+  }
+
+  void Skip(size_t n) override {
+    while (n >= curr_size_remaining_ && n > 0) {
+      n -= curr_size_remaining_;
+      Advance();
+    }
+    curr_size_remaining_ -= n;
+    total_size_remaining_ -= n;
+    curr_pos_ += n;
+  }
+
+ private:
+  // Advances to the next nonempty `iovec` and updates related variables.
+  void Advance() {
+    do {
+      assert(total_size_remaining_ >= curr_size_remaining_);
+      total_size_remaining_ -= curr_size_remaining_;
+      if (total_size_remaining_ == 0) {
+        curr_pos_ = nullptr;
+        curr_size_remaining_ = 0;
+        return;
+      }
+      ++curr_iov_;
+      curr_pos_ = reinterpret_cast<const char*>(curr_iov_->iov_base);
+      curr_size_remaining_ = curr_iov_->iov_len;
+    } while (curr_size_remaining_ == 0);
+  }
+
+  // The `iovec` currently being read.
+  const struct iovec* curr_iov_;
+  // The location in `curr_iov_` currently being read.
+  const char* curr_pos_;
+  // The amount of unread data in `curr_iov_`.
+  size_t curr_size_remaining_;
+  // The amount of unread data in the entire input array.
+  size_t total_size_remaining_;
+};
+
+// A type that writes to an iovec.
+// Note that this is not a "ByteSink", but a type that matches the
+// Writer template argument to SnappyDecompressor::DecompressAllTags().
+class SnappyIOVecWriter {
+ private:
+  // output_iov_end_ is set to iov + count and used to determine when
+  // the end of the iovs is reached.
+  const struct iovec* output_iov_end_;
+
+#if !defined(NDEBUG)
+  const struct iovec* output_iov_;
+#endif  // !defined(NDEBUG)
+
+  // Current iov that is being written into.
+  const struct iovec* curr_iov_;
+
+  // Pointer to current iov's write location.
+  char* curr_iov_output_;
+
+  // Remaining bytes to write into curr_iov_output.
+  size_t curr_iov_remaining_;
+
+  // Total bytes decompressed into output_iov_ so far.
+  size_t total_written_;
+
+  // Maximum number of bytes that will be decompressed into output_iov_.
+  size_t output_limit_;
+
+  static inline char* GetIOVecPointer(const struct iovec* iov, size_t offset) {
+    return reinterpret_cast<char*>(iov->iov_base) + offset;
+  }
+
+ public:
+  // Does not take ownership of iov. iov must be valid during the
+  // entire lifetime of the SnappyIOVecWriter.
+  inline SnappyIOVecWriter(const struct iovec* iov, size_t iov_count)
+      : output_iov_end_(iov + iov_count),
+#if !defined(NDEBUG)
+        output_iov_(iov),
+#endif  // !defined(NDEBUG)
+        curr_iov_(iov),
+        curr_iov_output_(iov_count ? reinterpret_cast<char*>(iov->iov_base)
+                                   : nullptr),
+        curr_iov_remaining_(iov_count ? iov->iov_len : 0),
+        total_written_(0),
+        output_limit_(-1) {
+  }
+
+  inline void SetExpectedLength(size_t len) { output_limit_ = len; }
+
+  inline bool CheckLength() const { return total_written_ == output_limit_; }
+
+  inline bool Append(const char* ip, size_t len, char**) {
+    if (total_written_ + len > output_limit_) {
+      return false;
+    }
+
+    return AppendNoCheck(ip, len);
+  }
+
+  char* GetOutputPtr() { return nullptr; }
+  char* GetBase(ptrdiff_t*) { return nullptr; }
+  void SetOutputPtr(char* op) {
+    // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+    (void)op;
+  }
+
+  inline bool AppendNoCheck(const char* ip, size_t len) {
+    while (len > 0) {
+      if (curr_iov_remaining_ == 0) {
+        // This iovec is full. Go to the next one.
+        if (curr_iov_ + 1 >= output_iov_end_) {
+          return false;
+        }
+        ++curr_iov_;
+        curr_iov_output_ = reinterpret_cast<char*>(curr_iov_->iov_base);
+        curr_iov_remaining_ = curr_iov_->iov_len;
+      }
+
+      const size_t to_write = std::min(len, curr_iov_remaining_);
+      std::memcpy(curr_iov_output_, ip, to_write);
+      curr_iov_output_ += to_write;
+      curr_iov_remaining_ -= to_write;
+      total_written_ += to_write;
+      ip += to_write;
+      len -= to_write;
+    }
+
+    return true;
+  }
+
+  inline bool TryFastAppend(const char* ip, size_t available, size_t len,
+                            char**) {
+    const size_t space_left = output_limit_ - total_written_;
+    if (len <= 16 && available >= 16 + kMaximumTagLength && space_left >= 16 &&
+        curr_iov_remaining_ >= 16) {
+      // Fast path, used for the majority (about 95%) of invocations.
+      UnalignedCopy128(ip, curr_iov_output_);
+      curr_iov_output_ += len;
+      curr_iov_remaining_ -= len;
+      total_written_ += len;
+      return true;
+    }
+
+    return false;
+  }
+
+  inline bool AppendFromSelf(size_t offset, size_t len, char**) {
+    // See SnappyArrayWriter::AppendFromSelf for an explanation of
+    // the "offset - 1u" trick.
+    if (offset - 1u >= total_written_) {
+      return false;
+    }
+    const size_t space_left = output_limit_ - total_written_;
+    if (len > space_left) {
+      return false;
+    }
+
+    // Locate the iovec from which we need to start the copy.
+    const iovec* from_iov = curr_iov_;
+    size_t from_iov_offset = curr_iov_->iov_len - curr_iov_remaining_;
+    while (offset > 0) {
+      if (from_iov_offset >= offset) {
+        from_iov_offset -= offset;
+        break;
+      }
+
+      offset -= from_iov_offset;
+      --from_iov;
+#if !defined(NDEBUG)
+      assert(from_iov >= output_iov_);
+#endif  // !defined(NDEBUG)
+      from_iov_offset = from_iov->iov_len;
+    }
+
+    // Copy <len> bytes starting from the iovec pointed to by from_iov_index to
+    // the current iovec.
+    while (len > 0) {
+      assert(from_iov <= curr_iov_);
+      if (from_iov != curr_iov_) {
+        const size_t to_copy =
+            std::min(from_iov->iov_len - from_iov_offset, len);
+        AppendNoCheck(GetIOVecPointer(from_iov, from_iov_offset), to_copy);
+        len -= to_copy;
+        if (len > 0) {
+          ++from_iov;
+          from_iov_offset = 0;
+        }
+      } else {
+        size_t to_copy = curr_iov_remaining_;
+        if (to_copy == 0) {
+          // This iovec is full. Go to the next one.
+          if (curr_iov_ + 1 >= output_iov_end_) {
+            return false;
+          }
+          ++curr_iov_;
+          curr_iov_output_ = reinterpret_cast<char*>(curr_iov_->iov_base);
+          curr_iov_remaining_ = curr_iov_->iov_len;
+          continue;
+        }
+        if (to_copy > len) {
+          to_copy = len;
+        }
+        assert(to_copy > 0);
+
+        IncrementalCopy(GetIOVecPointer(from_iov, from_iov_offset),
+                        curr_iov_output_, curr_iov_output_ + to_copy,
+                        curr_iov_output_ + curr_iov_remaining_);
+        curr_iov_output_ += to_copy;
+        curr_iov_remaining_ -= to_copy;
+        from_iov_offset += to_copy;
+        total_written_ += to_copy;
+        len -= to_copy;
+      }
+    }
+
+    return true;
+  }
+
+  inline void Flush() {}
+};
+
+bool RawUncompressToIOVec(const char* compressed, size_t compressed_length,
+                          const struct iovec* iov, size_t iov_cnt) {
+  ByteArraySource reader(compressed, compressed_length);
+  return RawUncompressToIOVec(&reader, iov, iov_cnt);
+}
+
+bool RawUncompressToIOVec(Source* compressed, const struct iovec* iov,
+                          size_t iov_cnt) {
+  SnappyIOVecWriter output(iov, iov_cnt);
+  return InternalUncompress(compressed, &output);
+}
+
+// -----------------------------------------------------------------------
+// Flat array interfaces
+// -----------------------------------------------------------------------
+
+// A type that writes to a flat array.
+// Note that this is not a "ByteSink", but a type that matches the
+// Writer template argument to SnappyDecompressor::DecompressAllTags().
+class SnappyArrayWriter {
+ private:
+  char* base_;
+  char* op_;
+  char* op_limit_;
+  // If op < op_limit_min_slop_ then it's safe to unconditionally write
+  // kSlopBytes starting at op.
+  char* op_limit_min_slop_;
+
+ public:
+  inline explicit SnappyArrayWriter(char* dst)
+      : base_(dst),
+        op_(dst),
+        op_limit_(dst),
+        op_limit_min_slop_(dst) {}  // Safe default see invariant.
+
+  inline void SetExpectedLength(size_t len) {
+    op_limit_ = op_ + len;
+    // Prevent pointer from being past the buffer.
+    op_limit_min_slop_ = op_limit_ - std::min<size_t>(kSlopBytes - 1, len);
+  }
+
+  inline bool CheckLength() const { return op_ == op_limit_; }
+
+  char* GetOutputPtr() { return op_; }
+  char* GetBase(ptrdiff_t* op_limit_min_slop) {
+    *op_limit_min_slop = op_limit_min_slop_ - base_;
+    return base_;
+  }
+  void SetOutputPtr(char* op) { op_ = op; }
+
+  inline bool Append(const char* ip, size_t len, char** op_p) {
+    char* op = *op_p;
+    const size_t space_left = op_limit_ - op;
+    if (space_left < len) return false;
+    std::memcpy(op, ip, len);
+    *op_p = op + len;
+    return true;
+  }
+
+  inline bool TryFastAppend(const char* ip, size_t available, size_t len,
+                            char** op_p) {
+    char* op = *op_p;
+    const size_t space_left = op_limit_ - op;
+    if (len <= 16 && available >= 16 + kMaximumTagLength && space_left >= 16) {
+      // Fast path, used for the majority (about 95%) of invocations.
+      UnalignedCopy128(ip, op);
+      *op_p = op + len;
+      return true;
+    } else {
+      return false;
+    }
+  }
+
+  SNAPPY_ATTRIBUTE_ALWAYS_INLINE
+  inline bool AppendFromSelf(size_t offset, size_t len, char** op_p) {
+    assert(len > 0);
+    char* const op = *op_p;
+    assert(op >= base_);
+    char* const op_end = op + len;
+
+    // Check if we try to append from before the start of the buffer.
+    if (SNAPPY_PREDICT_FALSE(static_cast<size_t>(op - base_) < offset))
+      return false;
+
+    if (SNAPPY_PREDICT_FALSE((kSlopBytes < 64 && len > kSlopBytes) ||
+                            op >= op_limit_min_slop_ || offset < len)) {
+      if (op_end > op_limit_ || offset == 0) return false;
+      *op_p = IncrementalCopy(op - offset, op, op_end, op_limit_);
+      return true;
+    }
+    std::memmove(op, op - offset, kSlopBytes);
+    *op_p = op_end;
+    return true;
+  }
+  inline size_t Produced() const {
+    assert(op_ >= base_);
+    return op_ - base_;
+  }
+  inline void Flush() {}
+};
+
+bool RawUncompress(const char* compressed, size_t compressed_length,
+                   char* uncompressed) {
+  ByteArraySource reader(compressed, compressed_length);
+  return RawUncompress(&reader, uncompressed);
+}
+
+bool RawUncompress(Source* compressed, char* uncompressed) {
+  SnappyArrayWriter output(uncompressed);
+  return InternalUncompress(compressed, &output);
+}
+
+bool Uncompress(const char* compressed, size_t compressed_length,
+                std::string* uncompressed) {
+  size_t ulength;
+  if (!GetUncompressedLength(compressed, compressed_length, &ulength)) {
+    return false;
+  }
+  // On 32-bit builds: max_size() < kuint32max.  Check for that instead
+  // of crashing (e.g., consider externally specified compressed data).
+  if (ulength > uncompressed->max_size()) {
+    return false;
+  }
+  STLStringResizeUninitialized(uncompressed, ulength);
+  return RawUncompress(compressed, compressed_length,
+                       string_as_array(uncompressed));
+}
+
+// A Writer that drops everything on the floor and just does validation
+class SnappyDecompressionValidator {
+ private:
+  size_t expected_;
+  size_t produced_;
+
+ public:
+  inline SnappyDecompressionValidator() : expected_(0), produced_(0) {}
+  inline void SetExpectedLength(size_t len) { expected_ = len; }
+  size_t GetOutputPtr() { return produced_; }
+  size_t GetBase(ptrdiff_t* op_limit_min_slop) {
+    *op_limit_min_slop = std::numeric_limits<ptrdiff_t>::max() - kSlopBytes + 1;
+    return 1;
+  }
+  void SetOutputPtr(size_t op) { produced_ = op; }
+  inline bool CheckLength() const { return expected_ == produced_; }
+  inline bool Append(const char* ip, size_t len, size_t* produced) {
+    // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+    (void)ip;
+
+    *produced += len;
+    return *produced <= expected_;
+  }
+  inline bool TryFastAppend(const char* ip, size_t available, size_t length,
+                            size_t* produced) {
+    // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+    (void)ip;
+    (void)available;
+    (void)length;
+    (void)produced;
+
+    return false;
+  }
+  inline bool AppendFromSelf(size_t offset, size_t len, size_t* produced) {
+    // See SnappyArrayWriter::AppendFromSelf for an explanation of
+    // the "offset - 1u" trick.
+    if (*produced <= offset - 1u) return false;
+    *produced += len;
+    return *produced <= expected_;
+  }
+  inline void Flush() {}
+};
+
+bool IsValidCompressedBuffer(const char* compressed, size_t compressed_length) {
+  ByteArraySource reader(compressed, compressed_length);
+  SnappyDecompressionValidator writer;
+  return InternalUncompress(&reader, &writer);
+}
+
+bool IsValidCompressed(Source* compressed) {
+  SnappyDecompressionValidator writer;
+  return InternalUncompress(compressed, &writer);
+}
+
+void RawCompress(const char* input, size_t input_length, char* compressed,
+                 size_t* compressed_length) {
+  RawCompress(input, input_length, compressed, compressed_length,
+              CompressionOptions{});
+}
+
+void RawCompress(const char* input, size_t input_length, char* compressed,
+                 size_t* compressed_length, CompressionOptions options) {
+  ByteArraySource reader(input, input_length);
+  UncheckedByteArraySink writer(compressed);
+  Compress(&reader, &writer, options);
+
+  // Compute how many bytes were added
+  *compressed_length = (writer.CurrentDestination() - compressed);
+}
+
+void RawCompressFromIOVec(const struct iovec* iov, size_t uncompressed_length,
+                          char* compressed, size_t* compressed_length) {
+  RawCompressFromIOVec(iov, uncompressed_length, compressed, compressed_length,
+                       CompressionOptions{});
+}
+
+void RawCompressFromIOVec(const struct iovec* iov, size_t uncompressed_length,
+                          char* compressed, size_t* compressed_length,
+                          CompressionOptions options) {
+  SnappyIOVecReader reader(iov, uncompressed_length);
+  UncheckedByteArraySink writer(compressed);
+  Compress(&reader, &writer, options);
+
+  // Compute how many bytes were added.
+  *compressed_length = writer.CurrentDestination() - compressed;
+}
+
+size_t Compress(const char* input, size_t input_length,
+                std::string* compressed) {
+  return Compress(input, input_length, compressed, CompressionOptions{});
+}
+
+size_t Compress(const char* input, size_t input_length, std::string* compressed,
+                CompressionOptions options) {
+  // Pre-grow the buffer to the max length of the compressed output
+  STLStringResizeUninitialized(compressed, MaxCompressedLength(input_length));
+
+  size_t compressed_length;
+  RawCompress(input, input_length, string_as_array(compressed),
+              &compressed_length, options);
+  compressed->erase(compressed_length);
+  return compressed_length;
+}
+
+size_t CompressFromIOVec(const struct iovec* iov, size_t iov_cnt,
+                         std::string* compressed) {
+  return CompressFromIOVec(iov, iov_cnt, compressed, CompressionOptions{});
+}
+
+size_t CompressFromIOVec(const struct iovec* iov, size_t iov_cnt,
+                         std::string* compressed, CompressionOptions options) {
+  // Compute the number of bytes to be compressed.
+  size_t uncompressed_length = 0;
+  for (size_t i = 0; i < iov_cnt; ++i) {
+    uncompressed_length += iov[i].iov_len;
+  }
+
+  // Pre-grow the buffer to the max length of the compressed output.
+  STLStringResizeUninitialized(compressed, MaxCompressedLength(
+      uncompressed_length));
+
+  size_t compressed_length;
+  RawCompressFromIOVec(iov, uncompressed_length, string_as_array(compressed),
+                       &compressed_length, options);
+  compressed->erase(compressed_length);
+  return compressed_length;
+}
+
+// -----------------------------------------------------------------------
+// Sink interface
+// -----------------------------------------------------------------------
+
+// A type that decompresses into a Sink. The template parameter
+// Allocator must export one method "char* Allocate(int size);", which
+// allocates a buffer of "size" and appends that to the destination.
+template <typename Allocator>
+class SnappyScatteredWriter {
+  Allocator allocator_;
+
+  // We need random access into the data generated so far.  Therefore
+  // we keep track of all of the generated data as an array of blocks.
+  // All of the blocks except the last have length kBlockSize.
+  std::vector<char*> blocks_;
+  size_t expected_;
+
+  // Total size of all fully generated blocks so far
+  size_t full_size_;
+
+  // Pointer into current output block
+  char* op_base_;   // Base of output block
+  char* op_ptr_;    // Pointer to next unfilled byte in block
+  char* op_limit_;  // Pointer just past block
+  // If op < op_limit_min_slop_ then it's safe to unconditionally write
+  // kSlopBytes starting at op.
+  char* op_limit_min_slop_;
+
+  inline size_t Size() const { return full_size_ + (op_ptr_ - op_base_); }
+
+  bool SlowAppend(const char* ip, size_t len);
+  bool SlowAppendFromSelf(size_t offset, size_t len);
+
+ public:
+  inline explicit SnappyScatteredWriter(const Allocator& allocator)
+      : allocator_(allocator),
+        full_size_(0),
+        op_base_(NULL),
+        op_ptr_(NULL),
+        op_limit_(NULL),
+        op_limit_min_slop_(NULL) {}
+  char* GetOutputPtr() { return op_ptr_; }
+  char* GetBase(ptrdiff_t* op_limit_min_slop) {
+    *op_limit_min_slop = op_limit_min_slop_ - op_base_;
+    return op_base_;
+  }
+  void SetOutputPtr(char* op) { op_ptr_ = op; }
+
+  inline void SetExpectedLength(size_t len) {
+    assert(blocks_.empty());
+    expected_ = len;
+  }
+
+  inline bool CheckLength() const { return Size() == expected_; }
+
+  // Return the number of bytes actually uncompressed so far
+  inline size_t Produced() const { return Size(); }
+
+  inline bool Append(const char* ip, size_t len, char** op_p) {
+    char* op = *op_p;
+    size_t avail = op_limit_ - op;
+    if (len <= avail) {
+      // Fast path
+      std::memcpy(op, ip, len);
+      *op_p = op + len;
+      return true;
+    } else {
+      op_ptr_ = op;
+      bool res = SlowAppend(ip, len);
+      *op_p = op_ptr_;
+      return res;
+    }
+  }
+
+  inline bool TryFastAppend(const char* ip, size_t available, size_t length,
+                            char** op_p) {
+    char* op = *op_p;
+    const int space_left = op_limit_ - op;
+    if (length <= 16 && available >= 16 + kMaximumTagLength &&
+        space_left >= 16) {
+      // Fast path, used for the majority (about 95%) of invocations.
+      UnalignedCopy128(ip, op);
+      *op_p = op + length;
+      return true;
+    } else {
+      return false;
+    }
+  }
+
+  inline bool AppendFromSelf(size_t offset, size_t len, char** op_p) {
+    char* op = *op_p;
+    assert(op >= op_base_);
+    // Check if we try to append from before the start of the buffer.
+    if (SNAPPY_PREDICT_FALSE((kSlopBytes < 64 && len > kSlopBytes) ||
+                            static_cast<size_t>(op - op_base_) < offset ||
+                            op >= op_limit_min_slop_ || offset < len)) {
+      if (offset == 0) return false;
+      if (SNAPPY_PREDICT_FALSE(static_cast<size_t>(op - op_base_) < offset ||
+                              op + len > op_limit_)) {
+        op_ptr_ = op;
+        bool res = SlowAppendFromSelf(offset, len);
+        *op_p = op_ptr_;
+        return res;
+      }
+      *op_p = IncrementalCopy(op - offset, op, op + len, op_limit_);
+      return true;
+    }
+    // Fast path
+    char* const op_end = op + len;
+    std::memmove(op, op - offset, kSlopBytes);
+    *op_p = op_end;
+    return true;
+  }
+
+  // Called at the end of the decompress. We ask the allocator
+  // write all blocks to the sink.
+  inline void Flush() { allocator_.Flush(Produced()); }
+};
+
+template <typename Allocator>
+bool SnappyScatteredWriter<Allocator>::SlowAppend(const char* ip, size_t len) {
+  size_t avail = op_limit_ - op_ptr_;
+  while (len > avail) {
+    // Completely fill this block
+    std::memcpy(op_ptr_, ip, avail);
+    op_ptr_ += avail;
+    assert(op_limit_ - op_ptr_ == 0);
+    full_size_ += (op_ptr_ - op_base_);
+    len -= avail;
+    ip += avail;
+
+    // Bounds check
+    if (full_size_ + len > expected_) return false;
+
+    // Make new block
+    size_t bsize = std::min<size_t>(kBlockSize, expected_ - full_size_);
+    op_base_ = allocator_.Allocate(bsize);
+    op_ptr_ = op_base_;
+    op_limit_ = op_base_ + bsize;
+    op_limit_min_slop_ = op_limit_ - std::min<size_t>(kSlopBytes - 1, bsize);
+
+    blocks_.push_back(op_base_);
+    avail = bsize;
+  }
+
+  std::memcpy(op_ptr_, ip, len);
+  op_ptr_ += len;
+  return true;
+}
+
+template <typename Allocator>
+bool SnappyScatteredWriter<Allocator>::SlowAppendFromSelf(size_t offset,
+                                                         size_t len) {
+  // Overflow check
+  // See SnappyArrayWriter::AppendFromSelf for an explanation of
+  // the "offset - 1u" trick.
+  const size_t cur = Size();
+  if (offset - 1u >= cur) return false;
+  if (expected_ - cur < len) return false;
+
+  // Currently we shouldn't ever hit this path because Compress() chops the
+  // input into blocks and does not create cross-block copies. However, it is
+  // nice if we do not rely on that, since we can get better compression if we
+  // allow cross-block copies and thus might want to change the compressor in
+  // the future.
+  // TODO Replace this with a properly optimized path. This is not
+  // triggered right now. But this is so super slow, that it would regress
+  // performance unacceptably if triggered.
+  size_t src = cur - offset;
+  char* op = op_ptr_;
+  while (len-- > 0) {
+    char c = blocks_[src >> kBlockLog][src & (kBlockSize - 1)];
+    if (!Append(&c, 1, &op)) {
+      op_ptr_ = op;
+      return false;
+    }
+    src++;
+  }
+  op_ptr_ = op;
+  return true;
+}
+
+class SnappySinkAllocator {
+ public:
+  explicit SnappySinkAllocator(Sink* dest) : dest_(dest) {}
+
+  char* Allocate(int size) {
+    Datablock block(new char[size], size);
+    blocks_.push_back(block);
+    return block.data;
+  }
+
+  // We flush only at the end, because the writer wants
+  // random access to the blocks and once we hand the
+  // block over to the sink, we can't access it anymore.
+  // Also we don't write more than has been actually written
+  // to the blocks.
+  void Flush(size_t size) {
+    size_t size_written = 0;
+    for (Datablock& block : blocks_) {
+      size_t block_size = std::min<size_t>(block.size, size - size_written);
+      dest_->AppendAndTakeOwnership(block.data, block_size,
+                                    &SnappySinkAllocator::Deleter, NULL);
+      size_written += block_size;
+    }
+    blocks_.clear();
+  }
+
+ private:
+  struct Datablock {
+    char* data;
+    size_t size;
+    Datablock(char* p, size_t s) : data(p), size(s) {}
+  };
+
+  static void Deleter(void* arg, const char* bytes, size_t size) {
+    // TODO: Switch to [[maybe_unused]] when we can assume C++17.
+    (void)arg;
+    (void)size;
+
+    delete[] bytes;
+  }
+
+  Sink* dest_;
+  std::vector<Datablock> blocks_;
+
+  // Note: copying this object is allowed
+};
+
+size_t UncompressAsMuchAsPossible(Source* compressed, Sink* uncompressed) {
+  SnappySinkAllocator allocator(uncompressed);
+  SnappyScatteredWriter<SnappySinkAllocator> writer(allocator);
+  InternalUncompress(compressed, &writer);
+  return writer.Produced();
+}
+
+bool Uncompress(Source* compressed, Sink* uncompressed) {
+  // Read the uncompressed length from the front of the compressed input
+  SnappyDecompressor decompressor(compressed);
+  uint32_t uncompressed_len = 0;
+  if (!decompressor.ReadUncompressedLength(&uncompressed_len)) {
+    return false;
+  }
+
+  char c;
+  size_t allocated_size;
+  char* buf = uncompressed->GetAppendBufferVariable(1, uncompressed_len, &c, 1,
+                                                    &allocated_size);
+
+  const size_t compressed_len = compressed->Available();
+  // If we can get a flat buffer, then use it, otherwise do block by block
+  // uncompression
+  if (allocated_size >= uncompressed_len) {
+    SnappyArrayWriter writer(buf);
+    bool result = InternalUncompressAllTags(&decompressor, &writer,
+                                            compressed_len, uncompressed_len);
+    uncompressed->Append(buf, writer.Produced());
+    return result;
+  } else {
+    SnappySinkAllocator allocator(uncompressed);
+    SnappyScatteredWriter<SnappySinkAllocator> writer(allocator);
+    return InternalUncompressAllTags(&decompressor, &writer, compressed_len,
+                                     uncompressed_len);
+  }
+}
+
+}  // namespace lbug_snappy
+
+#else // #if SNAPPY_NEW_VERSION
+
+#include "snappy.h"
+#include "snappy-internal.h"
+#include "snappy-sinksource.h"
+
+#if !defined(SNAPPY_HAVE_SSSE3)
+// __SSSE3__ is defined by GCC and Clang. Visual Studio doesn't target SIMD
+// support between SSE2 and AVX (so SSSE3 instructions require AVX support), and
+// defines __AVX__ when AVX support is available.
+#if defined(__SSSE3__) || defined(__AVX__)
+#define SNAPPY_HAVE_SSSE3 1
+#else
+#define SNAPPY_HAVE_SSSE3 0
+#endif
+#endif  // !defined(SNAPPY_HAVE_SSSE3)
+
+#if !defined(SNAPPY_HAVE_BMI2)
+// __BMI2__ is defined by GCC and Clang. Visual Studio doesn't target BMI2
+// specifically, but it does define __AVX2__ when AVX2 support is available.
+// Fortunately, AVX2 was introduced in Haswell, just like BMI2.
+//
+// BMI2 is not defined as a subset of AVX2 (unlike SSSE3 and AVX above). So,
+// GCC and Clang can build code with AVX2 enabled but BMI2 disabled, in which
+// case issuing BMI2 instructions results in a compiler error.
+#if defined(__BMI2__) || (defined(_MSC_VER) && defined(__AVX2__))
+#define SNAPPY_HAVE_BMI2 1
+#else
+#define SNAPPY_HAVE_BMI2 0
+#endif
+#endif  // !defined(SNAPPY_HAVE_BMI2)
+
+#if SNAPPY_HAVE_SSSE3
+// Please do not replace with <x86intrin.h>. or with headers that assume more
+// advanced SSE versions without checking with all the OWNERS.
+#include <tmmintrin.h>
+#endif
+
+#if SNAPPY_HAVE_BMI2
+// Please do not replace with <x86intrin.h>. or with headers that assume more
+// advanced SSE versions without checking with all the OWNERS.
+#include <immintrin.h>
+#endif
+
+#include <stdio.h>
+
+#include <algorithm>
+#include <string>
+#include <vector>
+
+namespace lbug_snappy {
+
+using internal::COPY_1_BYTE_OFFSET;
+using internal::COPY_2_BYTE_OFFSET;
+using internal::LITERAL;
+using internal::char_table;
+using internal::kMaximumTagLength;
+
+// Any hash function will produce a valid compressed bitstream, but a good
+// hash function reduces the number of collisions and thus yields better
+// compression for compressible input, and more speed for incompressible
+// input. Of course, it doesn't hurt if the hash function is reasonably fast
+// either, as it gets called a lot.
+static inline uint32 HashBytes(uint32 bytes, int shift) {
+  uint32 kMul = 0x1e35a7bd;
+  return (bytes * kMul) >> shift;
+}
+static inline uint32 Hash(const char* p, int shift) {
+  return HashBytes(UNALIGNED_LOAD32(p), shift);
+}
+
+size_t MaxCompressedLength(size_t source_len) {
+  // Compressed data can be defined as:
+  //    compressed := item* literal*
+  //    item       := literal* copy
+  //
+  // The trailing literal sequence has a space blowup of at most 62/60
+  // since a literal of length 60 needs one tag byte + one extra byte
+  // for length information.
+  //
+  // Item blowup is trickier to measure.  Suppose the "copy" op copies
+  // 4 bytes of data.  Because of a special check in the encoding code,
+  // we produce a 4-byte copy only if the offset is < 65536.  Therefore
+  // the copy op takes 3 bytes to encode, and this type of item leads
+  // to at most the 62/60 blowup for representing literals.
+  //
+  // Suppose the "copy" op copies 5 bytes of data.  If the offset is big
+  // enough, it will take 5 bytes to encode the copy op.  Therefore the
+  // worst case here is a one-byte literal followed by a five-byte copy.
+  // I.e., 6 bytes of input turn into 7 bytes of "compressed" data.
+  //
+  // This last factor dominates the blowup, so the final estimate is:
+  return 32 + source_len + source_len/6;
+}
+
+namespace {
+
+void UnalignedCopy64(const void* src, void* dst) {
+  char tmp[8];
+  memcpy(tmp, src, 8);
+  memcpy(dst, tmp, 8);
+}
+
+void UnalignedCopy128(const void* src, void* dst) {
+  // memcpy gets vectorized when the appropriate compiler options are used.
+  // For example, x86 compilers targeting SSE2+ will optimize to an SSE2 load
+  // and store.
+  char tmp[16];
+  memcpy(tmp, src, 16);
+  memcpy(dst, tmp, 16);
+}
+
+// Copy [src, src+(op_limit-op)) to [op, (op_limit-op)) a byte at a time. Used
+// for handling COPY operations where the input and output regions may overlap.
+// For example, suppose:
+//    src       == "ab"
+//    op        == src + 2
+//    op_limit  == op + 20
+// After IncrementalCopySlow(src, op, op_limit), the result will have eleven
+// copies of "ab"
+//    ababababababababababab
+// Note that this does not match the semantics of either memcpy() or memmove().
+inline char* IncrementalCopySlow(const char* src, char* op,
+                                 char* const op_limit) {
+  // TODO: Remove pragma when LLVM is aware this
+  // function is only called in cold regions and when cold regions don't get
+  // vectorized or unrolled.
+#ifdef __clang__
+#pragma clang loop unroll(disable)
+#endif
+  while (op < op_limit) {
+    *op++ = *src++;
+  }
+  return op_limit;
+}
+
+#if SNAPPY_HAVE_SSSE3
+
+// This is a table of shuffle control masks that can be used as the source
+// operand for PSHUFB to permute the contents of the destination XMM register
+// into a repeating byte pattern.
+alignas(16) const char pshufb_fill_patterns[7][16] = {
+  {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+  {0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1},
+  {0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0},
+  {0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3},
+  {0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0},
+  {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3},
+  {0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 4, 5, 6, 0, 1},
+};
+
+#endif  // SNAPPY_HAVE_SSSE3
+
+// Copy [src, src+(op_limit-op)) to [op, (op_limit-op)) but faster than
+// IncrementalCopySlow. buf_limit is the address past the end of the writable
+// region of the buffer.
+inline char* IncrementalCopy(const char* src, char* op, char* const op_limit,
+                             char* const buf_limit) {
+  // Terminology:
+  //
+  // slop = buf_limit - op
+  // pat  = op - src
+  // len  = limit - op
+  assert(src < op);
+  assert(op <= op_limit);
+  assert(op_limit <= buf_limit);
+  // NOTE: The compressor always emits 4 <= len <= 64. It is ok to assume that
+  // to optimize this function but we have to also handle other cases in case
+  // the input does not satisfy these conditions.
+
+  size_t pattern_size = op - src;
+  // The cases are split into different branches to allow the branch predictor,
+  // FDO, and static prediction hints to work better. For each input we list the
+  // ratio of invocations that match each condition.
+  //
+  // input        slop < 16   pat < 8  len > 16
+  // ------------------------------------------
+  // html|html4|cp   0%         1.01%    27.73%
+  // urls            0%         0.88%    14.79%
+  // jpg             0%        64.29%     7.14%
+  // pdf             0%         2.56%    58.06%
+  // txt[1-4]        0%         0.23%     0.97%
+  // pb              0%         0.96%    13.88%
+  // bin             0.01%     22.27%    41.17%
+  //
+  // It is very rare that we don't have enough slop for doing block copies. It
+  // is also rare that we need to expand a pattern. Small patterns are common
+  // for incompressible formats and for those we are plenty fast already.
+  // Lengths are normally not greater than 16 but they vary depending on the
+  // input. In general if we always predict len <= 16 it would be an ok
+  // prediction.
+  //
+  // In order to be fast we want a pattern >= 8 bytes and an unrolled loop
+  // copying 2x 8 bytes at a time.
+
+  // Handle the uncommon case where pattern is less than 8 bytes.
+  if (SNAPPY_PREDICT_FALSE(pattern_size < 8)) {
+#if SNAPPY_HAVE_SSSE3
+    // Load the first eight bytes into an 128-bit XMM register, then use PSHUFB
+    // to permute the register's contents in-place into a repeating sequence of
+    // the first "pattern_size" bytes.
+    // For example, suppose:
+    //    src       == "abc"
+    //    op        == op + 3
+    // After _mm_shuffle_epi8(), "pattern" will have five copies of "abc"
+    // followed by one byte of slop: abcabcabcabcabca.
+    //
+    // The non-SSE fallback implementation suffers from store-forwarding stalls
+    // because its loads and stores partly overlap. By expanding the pattern
+    // in-place, we avoid the penalty.
+    if (SNAPPY_PREDICT_TRUE(op <= buf_limit - 16)) {
+      const __m128i shuffle_mask = _mm_load_si128(
+          reinterpret_cast<const __m128i*>(pshufb_fill_patterns)
+          + pattern_size - 1);
+      const __m128i pattern = _mm_shuffle_epi8(
+          _mm_loadl_epi64(reinterpret_cast<const __m128i*>(src)), shuffle_mask);
+      // Uninitialized bytes are masked out by the shuffle mask.
+      // TODO: remove annotation and macro defs once MSan is fixed.
+      SNAPPY_ANNOTATE_MEMORY_IS_INITIALIZED(&pattern, sizeof(pattern));
+      pattern_size *= 16 / pattern_size;
+      char* op_end = std::min(op_limit, buf_limit - 15);
+      while (op < op_end) {
+        _mm_storeu_si128(reinterpret_cast<__m128i*>(op), pattern);
+        op += pattern_size;
+      }
+      if (SNAPPY_PREDICT_TRUE(op >= op_limit)) return op_limit;
+    }
+    return IncrementalCopySlow(src, op, op_limit);
+#else  // !SNAPPY_HAVE_SSSE3
+    // If plenty of buffer space remains, expand the pattern to at least 8
+    // bytes. The way the following loop is written, we need 8 bytes of buffer
+    // space if pattern_size >= 4, 11 bytes if pattern_size is 1 or 3, and 10
+    // bytes if pattern_size is 2.  Precisely encoding that is probably not
+    // worthwhile; instead, invoke the slow path if we cannot write 11 bytes
+    // (because 11 are required in the worst case).
+    if (SNAPPY_PREDICT_TRUE(op <= buf_limit - 11)) {
+      while (pattern_size < 8) {
+        UnalignedCopy64(src, op);
+        op += pattern_size;
+        pattern_size *= 2;
+      }
+      if (SNAPPY_PREDICT_TRUE(op >= op_limit)) return op_limit;
+    } else {
+      return IncrementalCopySlow(src, op, op_limit);
+    }
+#endif  // SNAPPY_HAVE_SSSE3
+  }
+  assert(pattern_size >= 8);
+
+  // Copy 2x 8 bytes at a time. Because op - src can be < 16, a single
+  // UnalignedCopy128 might overwrite data in op. UnalignedCopy64 is safe
+  // because expanding the pattern to at least 8 bytes guarantees that
+  // op - src >= 8.
+  //
+  // Typically, the op_limit is the gating factor so try to simplify the loop
+  // based on that.
+  if (SNAPPY_PREDICT_TRUE(op_limit <= buf_limit - 16)) {
+    // Factor the displacement from op to the source into a variable. This helps
+    // simplify the loop below by only varying the op pointer which we need to
+    // test for the end. Note that this was done after carefully examining the
+    // generated code to allow the addressing modes in the loop below to
+    // maximize micro-op fusion where possible on modern Intel processors. The
+    // generated code should be checked carefully for new processors or with
+    // major changes to the compiler.
+    // TODO: Simplify this code when the compiler reliably produces
+    // the correct x86 instruction sequence.
+    ptrdiff_t op_to_src = src - op;
+
+    // The trip count of this loop is not large and so unrolling will only hurt
+    // code size without helping performance.
+    //
+    // TODO: Replace with loop trip count hint.
+#ifdef __clang__
+#pragma clang loop unroll(disable)
+#endif
+    do {
+      UnalignedCopy64(op + op_to_src, op);
+      UnalignedCopy64(op + op_to_src + 8, op + 8);
+      op += 16;
+    } while (op < op_limit);
+    return op_limit;
+  }
+
+  // Fall back to doing as much as we can with the available slop in the
+  // buffer. This code path is relatively cold however so we save code size by
+  // avoiding unrolling and vectorizing.
+  //
+  // TODO: Remove pragma when when cold regions don't get vectorized
+  // or unrolled.
+#ifdef __clang__
+#pragma clang loop unroll(disable)
+#endif
+  for (char *op_end = buf_limit - 16; op < op_end; op += 16, src += 16) {
+    UnalignedCopy64(src, op);
+    UnalignedCopy64(src + 8, op + 8);
+  }
+  if (op >= op_limit)
+    return op_limit;
+
+  // We only take this branch if we didn't have enough slop and we can do a
+  // single 8 byte copy.
+  if (SNAPPY_PREDICT_FALSE(op <= buf_limit - 8)) {
+    UnalignedCopy64(src, op);
+    src += 8;
+    op += 8;
+  }
+  return IncrementalCopySlow(src, op, op_limit);
+}
+
+}  // namespace
+
+template <bool allow_fast_path>
+static inline char* EmitLiteral(char* op,
+                                const char* literal,
+                                int len) {
+  // The vast majority of copies are below 16 bytes, for which a
+  // call to memcpy is overkill. This fast path can sometimes
+  // copy up to 15 bytes too much, but that is okay in the
+  // main loop, since we have a bit to go on for both sides:
+  //
+  //   - The input will always have kInputMarginBytes = 15 extra
+  //     available bytes, as long as we're in the main loop, and
+  //     if not, allow_fast_path = false.
+  //   - The output will always have 32 spare bytes (see
+  //     MaxCompressedLength).
+  assert(len > 0);      // Zero-length literals are disallowed
+  int n = len - 1;
+  if (allow_fast_path && len <= 16) {
+    // Fits in tag byte
+    *op++ = LITERAL | (n << 2);
+
+    UnalignedCopy128(literal, op);
+    return op + len;
+  }
+
+  if (n < 60) {
+    // Fits in tag byte
+    *op++ = LITERAL | (n << 2);
+  } else {
+    int count = (Bits::Log2Floor(n) >> 3) + 1;
+    assert(count >= 1);
+    assert(count <= 4);
+    *op++ = LITERAL | ((59 + count) << 2);
+    // Encode in upcoming bytes.
+    // Write 4 bytes, though we may care about only 1 of them. The output buffer
+    // is guaranteed to have at least 3 more spaces left as 'len >= 61' holds
+    // here and there is a memcpy of size 'len' below.
+    LittleEndian::Store32(op, n);
+    op += count;
+  }
+  memcpy(op, literal, len);
+  return op + len;
+}
+
+template <bool len_less_than_12>
+static inline char* EmitCopyAtMost64(char* op, size_t offset, size_t len) {
+  assert(len <= 64);
+  assert(len >= 4);
+  assert(offset < 65536);
+  assert(len_less_than_12 == (len < 12));
+
+  if (len_less_than_12 && SNAPPY_PREDICT_TRUE(offset < 2048)) {
+    // offset fits in 11 bits.  The 3 highest go in the top of the first byte,
+    // and the rest go in the second byte.
+    *op++ = COPY_1_BYTE_OFFSET + ((len - 4) << 2) + ((offset >> 3) & 0xe0);
+    *op++ = offset & 0xff;
+  } else {
+    // Write 4 bytes, though we only care about 3 of them.  The output buffer
+    // is required to have some slack, so the extra byte won't overrun it.
+    uint32 u = COPY_2_BYTE_OFFSET + ((len - 1) << 2) + (offset << 8);
+    LittleEndian::Store32(op, u);
+    op += 3;
+  }
+  return op;
+}
+
+template <bool len_less_than_12>
+static inline char* EmitCopy(char* op, size_t offset, size_t len) {
+  assert(len_less_than_12 == (len < 12));
+  if (len_less_than_12) {
+    return EmitCopyAtMost64</*len_less_than_12=*/true>(op, offset, len);
+  } else {
+    // A special case for len <= 64 might help, but so far measurements suggest
+    // it's in the noise.
+
+    // Emit 64 byte copies but make sure to keep at least four bytes reserved.
+    while (SNAPPY_PREDICT_FALSE(len >= 68)) {
+      op = EmitCopyAtMost64</*len_less_than_12=*/false>(op, offset, 64);
+      len -= 64;
+    }
+
+    // One or two copies will now finish the job.
+    if (len > 64) {
+      op = EmitCopyAtMost64</*len_less_than_12=*/false>(op, offset, 60);
+      len -= 60;
+    }
+
+    // Emit remainder.
+    if (len < 12) {
+      op = EmitCopyAtMost64</*len_less_than_12=*/true>(op, offset, len);
+    } else {
+      op = EmitCopyAtMost64</*len_less_than_12=*/false>(op, offset, len);
+    }
+    return op;
+  }
+}
+
+bool GetUncompressedLength(const char* start, size_t n, size_t* result) {
+  uint32 v = 0;
+  const char* limit = start + n;
+  if (Varint::Parse32WithLimit(start, limit, &v) != NULL) {
+    *result = v;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+namespace {
+uint32 CalculateTableSize(uint32 input_size) {
+  assert(kMaxHashTableSize >= 256);
+  if (input_size > kMaxHashTableSize) {
+    return kMaxHashTableSize;
+  }
+  if (input_size < 256) {
+    return 256;
+  }
+  // This is equivalent to Log2Ceiling(input_size), assuming input_size > 1.
+  // 2 << Log2Floor(x - 1) is equivalent to 1 << (1 + Log2Floor(x - 1)).
+  return 2u << Bits::Log2Floor(input_size - 1);
+}
+}  // namespace
+
+namespace internal {
+WorkingMemory::WorkingMemory(size_t input_size) {
+  const size_t max_fragment_size = std::min(input_size, kBlockSize);
+  const size_t table_size = CalculateTableSize(max_fragment_size);
+  size_ = table_size * sizeof(*table_) + max_fragment_size +
+          MaxCompressedLength(max_fragment_size);
+  mem_ = std::allocator<char>().allocate(size_);
+  table_ = reinterpret_cast<uint16*>(mem_);
+  input_ = mem_ + table_size * sizeof(*table_);
+  output_ = input_ + max_fragment_size;
+}
+
+WorkingMemory::~WorkingMemory() {
+  std::allocator<char>().deallocate(mem_, size_);
+}
+
+uint16* WorkingMemory::GetHashTable(size_t fragment_size,
+                                    int* table_size) const {
+  const size_t htsize = CalculateTableSize(fragment_size);
+  memset(table_, 0, htsize * sizeof(*table_));
+  *table_size = htsize;
+  return table_;
+}
+}  // end namespace internal
+
+// For 0 <= offset <= 4, GetUint32AtOffset(GetEightBytesAt(p), offset) will
+// equal UNALIGNED_LOAD32(p + offset).  Motivation: On x86-64 hardware we have
+// empirically found that overlapping loads such as
+//  UNALIGNED_LOAD32(p) ... UNALIGNED_LOAD32(p+1) ... UNALIGNED_LOAD32(p+2)
+// are slower than UNALIGNED_LOAD64(p) followed by shifts and casts to uint32.
+//
+// We have different versions for 64- and 32-bit; ideally we would avoid the
+// two functions and just inline the UNALIGNED_LOAD64 call into
+// GetUint32AtOffset, but GCC (at least not as of 4.6) is seemingly not clever
+// enough to avoid loading the value multiple times then. For 64-bit, the load
+// is done when GetEightBytesAt() is called, whereas for 32-bit, the load is
+// done at GetUint32AtOffset() time.
+
+#ifdef ARCH_K8
+
+typedef uint64 EightBytesReference;
+
+static inline EightBytesReference GetEightBytesAt(const char* ptr) {
+  return UNALIGNED_LOAD64(ptr);
+}
+
+static inline uint32 GetUint32AtOffset(uint64 v, int offset) {
+  assert(offset >= 0);
+  assert(offset <= 4);
+  return v >> (LittleEndian::IsLittleEndian() ? 8 * offset : 32 - 8 * offset);
+}
+
+#else
+
+typedef const char* EightBytesReference;
+
+static inline EightBytesReference GetEightBytesAt(const char* ptr) {
+  return ptr;
+}
+
+static inline uint32 GetUint32AtOffset(const char* v, int offset) {
+  assert(offset >= 0);
+  assert(offset <= 4);
+  return UNALIGNED_LOAD32(v + offset);
+}
+
+#endif
+
+// Flat array compression that does not emit the "uncompressed length"
+// prefix. Compresses "input" string to the "*op" buffer.
+//
+// REQUIRES: "input" is at most "kBlockSize" bytes long.
+// REQUIRES: "op" points to an array of memory that is at least
+// "MaxCompressedLength(input.size())" in size.
+// REQUIRES: All elements in "table[0..table_size-1]" are initialized to zero.
+// REQUIRES: "table_size" is a power of two
+//
+// Returns an "end" pointer into "op" buffer.
+// "end - op" is the compressed size of "input".
+namespace internal {
+char* CompressFragment(const char* input,
+                       size_t input_size,
+                       char* op,
+                       uint16* table,
+                       const int table_size) {
+  // "ip" is the input pointer, and "op" is the output pointer.
+  const char* ip = input;
+  assert(input_size <= kBlockSize);
+  assert((table_size & (table_size - 1)) == 0);  // table must be power of two
+  const int shift = 32 - Bits::Log2Floor(table_size);
+  // assert(static_cast<int>(kuint32max >> shift) == table_size - 1);
+  const char* ip_end = input + input_size;
+  const char* base_ip = ip;
+  // Bytes in [next_emit, ip) will be emitted as literal bytes.  Or
+  // [next_emit, ip_end) after the main loop.
+  const char* next_emit = ip;
+
+  const size_t kInputMarginBytes = 15;
+  if (SNAPPY_PREDICT_TRUE(input_size >= kInputMarginBytes)) {
+    const char* ip_limit = input + input_size - kInputMarginBytes;
+
+    for (uint32 next_hash = Hash(++ip, shift); ; ) {
+      assert(next_emit < ip);
+      // The body of this loop calls EmitLiteral once and then EmitCopy one or
+      // more times.  (The exception is that when we're close to exhausting
+      // the input we goto emit_remainder.)
+      //
+      // In the first iteration of this loop we're just starting, so
+      // there's nothing to copy, so calling EmitLiteral once is
+      // necessary.  And we only start a new iteration when the
+      // current iteration has determined that a call to EmitLiteral will
+      // precede the next call to EmitCopy (if any).
+      //
+      // Step 1: Scan forward in the input looking for a 4-byte-long match.
+      // If we get close to exhausting the input then goto emit_remainder.
+      //
+      // Heuristic match skipping: If 32 bytes are scanned with no matches
+      // found, start looking only at every other byte. If 32 more bytes are
+      // scanned (or skipped), look at every third byte, etc.. When a match is
+      // found, immediately go back to looking at every byte. This is a small
+      // loss (~5% performance, ~0.1% density) for compressible data due to more
+      // bookkeeping, but for non-compressible data (such as JPEG) it's a huge
+      // win since the compressor quickly "realizes" the data is incompressible
+      // and doesn't bother looking for matches everywhere.
+      //
+      // The "skip" variable keeps track of how many bytes there are since the
+      // last match; dividing it by 32 (ie. right-shifting by five) gives the
+      // number of bytes to move ahead for each iteration.
+      uint32 skip = 32;
+
+      const char* next_ip = ip;
+      const char* candidate;
+      do {
+        ip = next_ip;
+        uint32 hash = next_hash;
+        assert(hash == Hash(ip, shift));
+        uint32 bytes_between_hash_lookups = skip >> 5;
+        skip += bytes_between_hash_lookups;
+        next_ip = ip + bytes_between_hash_lookups;
+        if (SNAPPY_PREDICT_FALSE(next_ip > ip_limit)) {
+          goto emit_remainder;
+        }
+        next_hash = Hash(next_ip, shift);
+        candidate = base_ip + table[hash];
+        assert(candidate >= base_ip);
+        assert(candidate < ip);
+
+        table[hash] = ip - base_ip;
+      } while (SNAPPY_PREDICT_TRUE(UNALIGNED_LOAD32(ip) !=
+                                 UNALIGNED_LOAD32(candidate)));
+
+      // Step 2: A 4-byte match has been found.  We'll later see if more
+      // than 4 bytes match.  But, prior to the match, input
+      // bytes [next_emit, ip) are unmatched.  Emit them as "literal bytes."
+      assert(next_emit + 16 <= ip_end);
+      op = EmitLiteral</*allow_fast_path=*/true>(op, next_emit, ip - next_emit);
+
+      // Step 3: Call EmitCopy, and then see if another EmitCopy could
+      // be our next move.  Repeat until we find no match for the
+      // input immediately after what was consumed by the last EmitCopy call.
+      //
+      // If we exit this loop normally then we need to call EmitLiteral next,
+      // though we don't yet know how big the literal will be.  We handle that
+      // by proceeding to the next iteration of the main loop.  We also can exit
+      // this loop via goto if we get close to exhausting the input.
+      EightBytesReference input_bytes;
+      uint32 candidate_bytes = 0;
+
+      do {
+        // We have a 4-byte match at ip, and no need to emit any
+        // "literal bytes" prior to ip.
+        const char* base = ip;
+        std::pair<size_t, bool> p =
+            FindMatchLength(candidate + 4, ip + 4, ip_end);
+        size_t matched = 4 + p.first;
+        ip += matched;
+        size_t offset = base - candidate;
+        assert(0 == memcmp(base, candidate, matched));
+        if (p.second) {
+          op = EmitCopy</*len_less_than_12=*/true>(op, offset, matched);
+        } else {
+          op = EmitCopy</*len_less_than_12=*/false>(op, offset, matched);
+        }
+        next_emit = ip;
+        if (SNAPPY_PREDICT_FALSE(ip >= ip_limit)) {
+          goto emit_remainder;
+        }
+        // We are now looking for a 4-byte match again.  We read
+        // table[Hash(ip, shift)] for that.  To improve compression,
+        // we also update table[Hash(ip - 1, shift)] and table[Hash(ip, shift)].
+        input_bytes = GetEightBytesAt(ip - 1);
+        uint32 prev_hash = HashBytes(GetUint32AtOffset(input_bytes, 0), shift);
+        table[prev_hash] = ip - base_ip - 1;
+        uint32 cur_hash = HashBytes(GetUint32AtOffset(input_bytes, 1), shift);
+        candidate = base_ip + table[cur_hash];
+        candidate_bytes = UNALIGNED_LOAD32(candidate);
+        table[cur_hash] = ip - base_ip;
+      } while (GetUint32AtOffset(input_bytes, 1) == candidate_bytes);
+
+      next_hash = HashBytes(GetUint32AtOffset(input_bytes, 2), shift);
+      ++ip;
+    }
+  }
+
+ emit_remainder:
+  // Emit the remaining bytes as a literal
+  if (next_emit < ip_end) {
+    op = EmitLiteral</*allow_fast_path=*/false>(op, next_emit,
+                                                ip_end - next_emit);
+  }
+
+  return op;
+}
+}  // end namespace internal
+
+// Called back at avery compression call to trace parameters and sizes.
+static inline void Report(const char *algorithm, size_t compressed_size,
+                          size_t uncompressed_size) {}
+
+// Signature of output types needed by decompression code.
+// The decompression code is templatized on a type that obeys this
+// signature so that we do not pay virtual function call overhead in
+// the middle of a tight decompression loop.
+//
+// class DecompressionWriter {
+//  public:
+//   // Called before decompression
+//   void SetExpectedLength(size_t length);
+//
+//   // Called after decompression
+//   bool CheckLength() const;
+//
+//   // Called repeatedly during decompression
+//   bool Append(const char* ip, size_t length);
+//   bool AppendFromSelf(uint32 offset, size_t length);
+//
+//   // The rules for how TryFastAppend differs from Append are somewhat
+//   // convoluted:
+//   //
+//   //  - TryFastAppend is allowed to decline (return false) at any
+//   //    time, for any reason -- just "return false" would be
+//   //    a perfectly legal implementation of TryFastAppend.
+//   //    The intention is for TryFastAppend to allow a fast path
+//   //    in the common case of a small append.
+//   //  - TryFastAppend is allowed to read up to <available> bytes
+//   //    from the input buffer, whereas Append is allowed to read
+//   //    <length>. However, if it returns true, it must leave
+//   //    at least five (kMaximumTagLength) bytes in the input buffer
+//   //    afterwards, so that there is always enough space to read the
+//   //    next tag without checking for a refill.
+//   //  - TryFastAppend must always return decline (return false)
+//   //    if <length> is 61 or more, as in this case the literal length is not
+//   //    decoded fully. In practice, this should not be a big problem,
+//   //    as it is unlikely that one would implement a fast path accepting
+//   //    this much data.
+//   //
+//   bool TryFastAppend(const char* ip, size_t available, size_t length);
+// };
+
+static inline uint32 ExtractLowBytes(uint32 v, int n) {
+  assert(n >= 0);
+  assert(n <= 4);
+#if SNAPPY_HAVE_BMI2
+  return _bzhi_u32(v, 8 * n);
+#else
+  // This needs to be wider than uint32 otherwise `mask << 32` will be
+  // undefined.
+  uint64 mask = 0xffffffff;
+  return v & ~(mask << (8 * n));
+#endif
+}
+
+static inline bool LeftShiftOverflows(uint8 value, uint32 shift) {
+  assert(shift < 32);
+  static const uint8 masks[] = {
+      0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,  //
+      0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,  //
+      0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,  //
+      0x00, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe};
+  return (value & masks[shift]) != 0;
+}
+
+// Helper class for decompression
+class SnappyDecompressor {
+ private:
+  Source*       reader_;         // Underlying source of bytes to decompress
+  const char*   ip_;             // Points to next buffered byte
+  const char*   ip_limit_;       // Points just past buffered bytes
+  uint32        peeked_;         // Bytes peeked from reader (need to skip)
+  bool          eof_;            // Hit end of input without an error?
+  char          scratch_[kMaximumTagLength];  // See RefillTag().
+
+  // Ensure that all of the tag metadata for the next tag is available
+  // in [ip_..ip_limit_-1].  Also ensures that [ip,ip+4] is readable even
+  // if (ip_limit_ - ip_ < 5).
+  //
+  // Returns true on success, false on error or end of input.
+  bool RefillTag();
+
+ public:
+  explicit SnappyDecompressor(Source* reader)
+      : reader_(reader),
+        ip_(NULL),
+        ip_limit_(NULL),
+        peeked_(0),
+        eof_(false) {
+  }
+
+  ~SnappyDecompressor() {
+    // Advance past any bytes we peeked at from the reader
+    reader_->Skip(peeked_);
+  }
+
+  // Returns true iff we have hit the end of the input without an error.
+  bool eof() const {
+    return eof_;
+  }
+
+  // Read the uncompressed length stored at the start of the compressed data.
+  // On success, stores the length in *result and returns true.
+  // On failure, returns false.
+  bool ReadUncompressedLength(uint32* result) {
+    assert(ip_ == NULL);       // Must not have read anything yet
+    // Length is encoded in 1..5 bytes
+    *result = 0;
+    uint32 shift = 0;
+    while (true) {
+      if (shift >= 32) return false;
+      size_t n;
+      const char* ip = reader_->Peek(&n);
+      if (n == 0) return false;
+      const unsigned char c = *(reinterpret_cast<const unsigned char*>(ip));
+      reader_->Skip(1);
+      uint32 val = c & 0x7f;
+      if (LeftShiftOverflows(static_cast<uint8>(val), shift)) return false;
+      *result |= val << shift;
+      if (c < 128) {
+        break;
+      }
+      shift += 7;
+    }
+    return true;
+  }
+
+  // Process the next item found in the input.
+  // Returns true if successful, false on error or end of input.
+  template <class Writer>
+#if defined(__GNUC__) && defined(__x86_64__)
+  __attribute__((aligned(32)))
+#endif
+  void DecompressAllTags(Writer* writer) {
+    // In x86, pad the function body to start 16 bytes later. This function has
+    // a couple of hotspots that are highly sensitive to alignment: we have
+    // observed regressions by more than 20% in some metrics just by moving the
+    // exact same code to a different position in the benchmark binary.
+    //
+    // Putting this code on a 32-byte-aligned boundary + 16 bytes makes us hit
+    // the "lucky" case consistently. Unfortunately, this is a very brittle
+    // workaround, and future differences in code generation may reintroduce
+    // this regression. If you experience a big, difficult to explain, benchmark
+    // performance regression here, first try removing this hack.
+#if defined(__GNUC__) && defined(__x86_64__)
+    // Two 8-byte "NOP DWORD ptr [EAX + EAX*1 + 00000000H]" instructions.
+    asm(".byte 0x0f, 0x1f, 0x84, 0x00, 0x00, 0x00, 0x00, 0x00");
+    asm(".byte 0x0f, 0x1f, 0x84, 0x00, 0x00, 0x00, 0x00, 0x00");
+#endif
+
+    const char* ip = ip_;
+    // We could have put this refill fragment only at the beginning of the loop.
+    // However, duplicating it at the end of each branch gives the compiler more
+    // scope to optimize the <ip_limit_ - ip> expression based on the local
+    // context, which overall increases speed.
+    #define MAYBE_REFILL() \
+        if (ip_limit_ - ip < kMaximumTagLength) { \
+          ip_ = ip; \
+          if (!RefillTag()) return; \
+          ip = ip_; \
+        }
+
+    MAYBE_REFILL();
+    for ( ;; ) {
+      const unsigned char c = *(reinterpret_cast<const unsigned char*>(ip++));
+
+      // Ratio of iterations that have LITERAL vs non-LITERAL for different
+      // inputs.
+      //
+      // input          LITERAL  NON_LITERAL
+      // -----------------------------------
+      // html|html4|cp   23%        77%
+      // urls            36%        64%
+      // jpg             47%        53%
+      // pdf             19%        81%
+      // txt[1-4]        25%        75%
+      // pb              24%        76%
+      // bin             24%        76%
+      if (SNAPPY_PREDICT_FALSE((c & 0x3) == LITERAL)) {
+        size_t literal_length = (c >> 2) + 1u;
+        if (writer->TryFastAppend(ip, ip_limit_ - ip, literal_length)) {
+          assert(literal_length < 61);
+          ip += literal_length;
+          // NOTE: There is no MAYBE_REFILL() here, as TryFastAppend()
+          // will not return true unless there's already at least five spare
+          // bytes in addition to the literal.
+          continue;
+        }
+        if (SNAPPY_PREDICT_FALSE(literal_length >= 61)) {
+          // Long literal.
+          const size_t literal_length_length = literal_length - 60;
+          literal_length =
+              ExtractLowBytes(LittleEndian::Load32(ip), literal_length_length) +
+              1;
+          ip += literal_length_length;
+        }
+
+        size_t avail = ip_limit_ - ip;
+        while (avail < literal_length) {
+          if (!writer->Append(ip, avail)) return;
+          literal_length -= avail;
+          reader_->Skip(peeked_);
+          size_t n;
+          ip = reader_->Peek(&n);
+          avail = n;
+          peeked_ = avail;
+          if (avail == 0) return;  // Premature end of input
+          ip_limit_ = ip + avail;
+        }
+        if (!writer->Append(ip, literal_length)) {
+          return;
+        }
+        ip += literal_length;
+        MAYBE_REFILL();
+      } else {
+        const size_t entry = char_table[c];
+        const size_t trailer =
+            ExtractLowBytes(LittleEndian::Load32(ip), entry >> 11);
+        const size_t length = entry & 0xff;
+        ip += entry >> 11;
+
+        // copy_offset/256 is encoded in bits 8..10.  By just fetching
+        // those bits, we get copy_offset (since the bit-field starts at
+        // bit 8).
+        const size_t copy_offset = entry & 0x700;
+        if (!writer->AppendFromSelf(copy_offset + trailer, length)) {
+          return;
+        }
+        MAYBE_REFILL();
+      }
+    }
+
+#undef MAYBE_REFILL
+  }
+};
+
+bool SnappyDecompressor::RefillTag() {
+  const char* ip = ip_;
+  if (ip == ip_limit_) {
+    // Fetch a new fragment from the reader
+    reader_->Skip(peeked_);   // All peeked bytes are used up
+    size_t n;
+    ip = reader_->Peek(&n);
+    peeked_ = n;
+    eof_ = (n == 0);
+    if (eof_) return false;
+    ip_limit_ = ip + n;
+  }
+
+  // Read the tag character
+  assert(ip < ip_limit_);
+  const unsigned char c = *(reinterpret_cast<const unsigned char*>(ip));
+  const uint32 entry = char_table[c];
+  const uint32 needed = (entry >> 11) + 1;  // +1 byte for 'c'
+  assert(needed <= sizeof(scratch_));
+
+  // Read more bytes from reader if needed
+  uint32 nbuf = ip_limit_ - ip;
+  if (nbuf < needed) {
+    // Stitch together bytes from ip and reader to form the word
+    // contents.  We store the needed bytes in "scratch_".  They
+    // will be consumed immediately by the caller since we do not
+    // read more than we need.
+    memmove(scratch_, ip, nbuf);
+    reader_->Skip(peeked_);  // All peeked bytes are used up
+    peeked_ = 0;
+    while (nbuf < needed) {
+      size_t length;
+      const char* src = reader_->Peek(&length);
+      if (length == 0) return false;
+      uint32 to_add = std::min<uint32>(needed - nbuf, length);
+      memcpy(scratch_ + nbuf, src, to_add);
+      nbuf += to_add;
+      reader_->Skip(to_add);
+    }
+    assert(nbuf == needed);
+    ip_ = scratch_;
+    ip_limit_ = scratch_ + needed;
+  } else if (nbuf < kMaximumTagLength) {
+    // Have enough bytes, but move into scratch_ so that we do not
+    // read past end of input
+    memmove(scratch_, ip, nbuf);
+    reader_->Skip(peeked_);  // All peeked bytes are used up
+    peeked_ = 0;
+    ip_ = scratch_;
+    ip_limit_ = scratch_ + nbuf;
+  } else {
+    // Pass pointer to buffer returned by reader_.
+    ip_ = ip;
+  }
+  return true;
+}
+
+template <typename Writer>
+static bool InternalUncompress(Source* r, Writer* writer) {
+  // Read the uncompressed length from the front of the compressed input
+  SnappyDecompressor decompressor(r);
+  uint32 uncompressed_len = 0;
+  if (!decompressor.ReadUncompressedLength(&uncompressed_len)) return false;
+
+  return InternalUncompressAllTags(&decompressor, writer, r->Available(),
+                                   uncompressed_len);
+}
+
+template <typename Writer>
+static bool InternalUncompressAllTags(SnappyDecompressor* decompressor,
+                                      Writer* writer,
+                                      uint32 compressed_len,
+                                      uint32 uncompressed_len) {
+  Report("snappy_uncompress", compressed_len, uncompressed_len);
+
+  writer->SetExpectedLength(uncompressed_len);
+
+  // Process the entire input
+  decompressor->DecompressAllTags(writer);
+  writer->Flush();
+  return (decompressor->eof() && writer->CheckLength());
+}
+
+bool GetUncompressedLength(Source* source, uint32* result) {
+  SnappyDecompressor decompressor(source);
+  return decompressor.ReadUncompressedLength(result);
+}
+
+size_t Compress(Source* reader, Sink* writer) {
+  size_t written = 0;
+  size_t N = reader->Available();
+  const size_t uncompressed_size = N;
+  char ulength[Varint::kMax32];
+  char* p = Varint::Encode32(ulength, N);
+  writer->Append(ulength, p-ulength);
+  written += (p - ulength);
+
+  internal::WorkingMemory wmem(N);
+
+  while (N > 0) {
+    // Get next block to compress (without copying if possible)
+    size_t fragment_size;
+    const char* fragment = reader->Peek(&fragment_size);
+    assert(fragment_size != 0);  // premature end of input
+    const size_t num_to_read = std::min(N, kBlockSize);
+    size_t bytes_read = fragment_size;
+
+    size_t pending_advance = 0;
+    if (bytes_read >= num_to_read) {
+      // Buffer returned by reader is large enough
+      pending_advance = num_to_read;
+      fragment_size = num_to_read;
+    } else {
+      char* scratch = wmem.GetScratchInput();
+      memcpy(scratch, fragment, bytes_read);
+      reader->Skip(bytes_read);
+
+      while (bytes_read < num_to_read) {
+        fragment = reader->Peek(&fragment_size);
+        size_t n = std::min<size_t>(fragment_size, num_to_read - bytes_read);
+        memcpy(scratch + bytes_read, fragment, n);
+        bytes_read += n;
+        reader->Skip(n);
+      }
+      assert(bytes_read == num_to_read);
+      fragment = scratch;
+      fragment_size = num_to_read;
+    }
+    assert(fragment_size == num_to_read);
+
+    // Get encoding table for compression
+    int table_size;
+    uint16* table = wmem.GetHashTable(num_to_read, &table_size);
+
+    // Compress input_fragment and append to dest
+    const int max_output = MaxCompressedLength(num_to_read);
+
+    // Need a scratch buffer for the output, in case the byte sink doesn't
+    // have room for us directly.
+
+    // Since we encode kBlockSize regions followed by a region
+    // which is <= kBlockSize in length, a previously allocated
+    // scratch_output[] region is big enough for this iteration.
+    char* dest = writer->GetAppendBuffer(max_output, wmem.GetScratchOutput());
+    char* end = internal::CompressFragment(fragment, fragment_size, dest, table,
+                                           table_size);
+    writer->Append(dest, end - dest);
+    written += (end - dest);
+
+    N -= num_to_read;
+    reader->Skip(pending_advance);
+  }
+
+  Report("snappy_compress", written, uncompressed_size);
+
+  return written;
+}
+
+// -----------------------------------------------------------------------
+// IOVec interfaces
+// -----------------------------------------------------------------------
+
+// A type that writes to an iovec.
+// Note that this is not a "ByteSink", but a type that matches the
+// Writer template argument to SnappyDecompressor::DecompressAllTags().
+class SnappyIOVecWriter {
+ private:
+  // output_iov_end_ is set to iov + count and used to determine when
+  // the end of the iovs is reached.
+  const struct iovec* output_iov_end_;
+
+#if !defined(NDEBUG)
+  const struct iovec* output_iov_;
+#endif  // !defined(NDEBUG)
+
+  // Current iov that is being written into.
+  const struct iovec* curr_iov_;
+
+  // Pointer to current iov's write location.
+  char* curr_iov_output_;
+
+  // Remaining bytes to write into curr_iov_output.
+  size_t curr_iov_remaining_;
+
+  // Total bytes decompressed into output_iov_ so far.
+  size_t total_written_;
+
+  // Maximum number of bytes that will be decompressed into output_iov_.
+  size_t output_limit_;
+
+  static inline char* GetIOVecPointer(const struct iovec* iov, size_t offset) {
+    return reinterpret_cast<char*>(iov->iov_base) + offset;
+  }
+
+ public:
+  // Does not take ownership of iov. iov must be valid during the
+  // entire lifetime of the SnappyIOVecWriter.
+  inline SnappyIOVecWriter(const struct iovec* iov, size_t iov_count)
+      : output_iov_end_(iov + iov_count),
+#if !defined(NDEBUG)
+        output_iov_(iov),
+#endif  // !defined(NDEBUG)
+        curr_iov_(iov),
+        curr_iov_output_(iov_count ? reinterpret_cast<char*>(iov->iov_base)
+                                   : nullptr),
+        curr_iov_remaining_(iov_count ? iov->iov_len : 0),
+        total_written_(0),
+        output_limit_(-1) {}
+
+  inline void SetExpectedLength(size_t len) {
+    output_limit_ = len;
+  }
+
+  inline bool CheckLength() const {
+    return total_written_ == output_limit_;
+  }
+
+  inline bool Append(const char* ip, size_t len) {
+    if (total_written_ + len > output_limit_) {
+      return false;
+    }
+
+    return AppendNoCheck(ip, len);
+  }
+
+  inline bool AppendNoCheck(const char* ip, size_t len) {
+    while (len > 0) {
+      if (curr_iov_remaining_ == 0) {
+        // This iovec is full. Go to the next one.
+        if (curr_iov_ + 1 >= output_iov_end_) {
+          return false;
+        }
+        ++curr_iov_;
+        curr_iov_output_ = reinterpret_cast<char*>(curr_iov_->iov_base);
+        curr_iov_remaining_ = curr_iov_->iov_len;
+      }
+
+      const size_t to_write = std::min(len, curr_iov_remaining_);
+      memcpy(curr_iov_output_, ip, to_write);
+      curr_iov_output_ += to_write;
+      curr_iov_remaining_ -= to_write;
+      total_written_ += to_write;
+      ip += to_write;
+      len -= to_write;
+    }
+
+    return true;
+  }
+
+  inline bool TryFastAppend(const char* ip, size_t available, size_t len) {
+    const size_t space_left = output_limit_ - total_written_;
+    if (len <= 16 && available >= 16 + kMaximumTagLength && space_left >= 16 &&
+        curr_iov_remaining_ >= 16) {
+      // Fast path, used for the majority (about 95%) of invocations.
+      UnalignedCopy128(ip, curr_iov_output_);
+      curr_iov_output_ += len;
+      curr_iov_remaining_ -= len;
+      total_written_ += len;
+      return true;
+    }
+
+    return false;
+  }
+
+  inline bool AppendFromSelf(size_t offset, size_t len) {
+    // See SnappyArrayWriter::AppendFromSelf for an explanation of
+    // the "offset - 1u" trick.
+    if (offset - 1u >= total_written_) {
+      return false;
+    }
+    const size_t space_left = output_limit_ - total_written_;
+    if (len > space_left) {
+      return false;
+    }
+
+    // Locate the iovec from which we need to start the copy.
+    const iovec* from_iov = curr_iov_;
+    size_t from_iov_offset = curr_iov_->iov_len - curr_iov_remaining_;
+    while (offset > 0) {
+      if (from_iov_offset >= offset) {
+        from_iov_offset -= offset;
+        break;
+      }
+
+      offset -= from_iov_offset;
+      --from_iov;
+#if !defined(NDEBUG)
+      assert(from_iov >= output_iov_);
+#endif  // !defined(NDEBUG)
+      from_iov_offset = from_iov->iov_len;
+    }
+
+    // Copy <len> bytes starting from the iovec pointed to by from_iov_index to
+    // the current iovec.
+    while (len > 0) {
+      assert(from_iov <= curr_iov_);
+      if (from_iov != curr_iov_) {
+        const size_t to_copy =
+            std::min((unsigned long)(from_iov->iov_len - from_iov_offset), (unsigned long)len);
+        AppendNoCheck(GetIOVecPointer(from_iov, from_iov_offset), to_copy);
+        len -= to_copy;
+        if (len > 0) {
+          ++from_iov;
+          from_iov_offset = 0;
+        }
+      } else {
+        size_t to_copy = curr_iov_remaining_;
+        if (to_copy == 0) {
+          // This iovec is full. Go to the next one.
+          if (curr_iov_ + 1 >= output_iov_end_) {
+            return false;
+          }
+          ++curr_iov_;
+          curr_iov_output_ = reinterpret_cast<char*>(curr_iov_->iov_base);
+          curr_iov_remaining_ = curr_iov_->iov_len;
+          continue;
+        }
+        if (to_copy > len) {
+          to_copy = len;
+        }
+
+        IncrementalCopy(GetIOVecPointer(from_iov, from_iov_offset),
+                        curr_iov_output_, curr_iov_output_ + to_copy,
+                        curr_iov_output_ + curr_iov_remaining_);
+        curr_iov_output_ += to_copy;
+        curr_iov_remaining_ -= to_copy;
+        from_iov_offset += to_copy;
+        total_written_ += to_copy;
+        len -= to_copy;
+      }
+    }
+
+    return true;
+  }
+
+  inline void Flush() {}
+};
+
+bool RawUncompressToIOVec(const char* compressed, size_t compressed_length,
+                          const struct iovec* iov, size_t iov_cnt) {
+  ByteArraySource reader(compressed, compressed_length);
+  return RawUncompressToIOVec(&reader, iov, iov_cnt);
+}
+
+bool RawUncompressToIOVec(Source* compressed, const struct iovec* iov,
+                          size_t iov_cnt) {
+  SnappyIOVecWriter output(iov, iov_cnt);
+  return InternalUncompress(compressed, &output);
+}
+
+// -----------------------------------------------------------------------
+// Flat array interfaces
+// -----------------------------------------------------------------------
+
+// A type that writes to a flat array.
+// Note that this is not a "ByteSink", but a type that matches the
+// Writer template argument to SnappyDecompressor::DecompressAllTags().
+class SnappyArrayWriter {
+ private:
+  char* base_;
+  char* op_;
+  char* op_limit_;
+
+ public:
+  inline explicit SnappyArrayWriter(char* dst)
+      : base_(dst),
+        op_(dst),
+        op_limit_(dst) {
+  }
+
+  inline void SetExpectedLength(size_t len) {
+    op_limit_ = op_ + len;
+  }
+
+  inline bool CheckLength() const {
+    return op_ == op_limit_;
+  }
+
+  inline bool Append(const char* ip, size_t len) {
+    char* op = op_;
+    const size_t space_left = op_limit_ - op;
+    if (space_left < len) {
+      return false;
+    }
+    memcpy(op, ip, len);
+    op_ = op + len;
+    return true;
+  }
+
+  inline bool TryFastAppend(const char* ip, size_t available, size_t len) {
+    char* op = op_;
+    const size_t space_left = op_limit_ - op;
+    if (len <= 16 && available >= 16 + kMaximumTagLength && space_left >= 16) {
+      // Fast path, used for the majority (about 95%) of invocations.
+      UnalignedCopy128(ip, op);
+      op_ = op + len;
+      return true;
+    } else {
+      return false;
+    }
+  }
+
+  inline bool AppendFromSelf(size_t offset, size_t len) {
+    char* const op_end = op_ + len;
+
+    // Check if we try to append from before the start of the buffer.
+    // Normally this would just be a check for "produced < offset",
+    // but "produced <= offset - 1u" is equivalent for every case
+    // except the one where offset==0, where the right side will wrap around
+    // to a very big number. This is convenient, as offset==0 is another
+    // invalid case that we also want to catch, so that we do not go
+    // into an infinite loop.
+    if (Produced() <= offset - 1u || op_end > op_limit_) return false;
+    op_ = IncrementalCopy(op_ - offset, op_, op_end, op_limit_);
+
+    return true;
+  }
+  inline size_t Produced() const {
+    assert(op_ >= base_);
+    return op_ - base_;
+  }
+  inline void Flush() {}
+};
+
+bool RawUncompress(const char* compressed, size_t n, char* uncompressed) {
+  ByteArraySource reader(compressed, n);
+  return RawUncompress(&reader, uncompressed);
+}
+
+bool RawUncompress(Source* compressed, char* uncompressed) {
+  SnappyArrayWriter output(uncompressed);
+  return InternalUncompress(compressed, &output);
+}
+
+bool Uncompress(const char* compressed, size_t n, string* uncompressed) {
+  size_t ulength;
+  if (!GetUncompressedLength(compressed, n, &ulength)) {
+    return false;
+  }
+  // On 32-bit builds: max_size() < kuint32max.  Check for that instead
+  // of crashing (e.g., consider externally specified compressed data).
+  if (ulength > uncompressed->max_size()) {
+    return false;
+  }
+  STLStringResizeUninitialized(uncompressed, ulength);
+  return RawUncompress(compressed, n, string_as_array(uncompressed));
+}
+
+// A Writer that drops everything on the floor and just does validation
+class SnappyDecompressionValidator {
+ private:
+  size_t expected_;
+  size_t produced_;
+
+ public:
+  inline SnappyDecompressionValidator() : expected_(0), produced_(0) { }
+  inline void SetExpectedLength(size_t len) {
+    expected_ = len;
+  }
+  inline bool CheckLength() const {
+    return expected_ == produced_;
+  }
+  inline bool Append(const char* ip, size_t len) {
+    produced_ += len;
+    return produced_ <= expected_;
+  }
+  inline bool TryFastAppend(const char* ip, size_t available, size_t length) {
+    return false;
+  }
+  inline bool AppendFromSelf(size_t offset, size_t len) {
+    // See SnappyArrayWriter::AppendFromSelf for an explanation of
+    // the "offset - 1u" trick.
+    if (produced_ <= offset - 1u) return false;
+    produced_ += len;
+    return produced_ <= expected_;
+  }
+  inline void Flush() {}
+};
+
+bool IsValidCompressedBuffer(const char* compressed, size_t n) {
+  ByteArraySource reader(compressed, n);
+  SnappyDecompressionValidator writer;
+  return InternalUncompress(&reader, &writer);
+}
+
+bool IsValidCompressed(Source* compressed) {
+  SnappyDecompressionValidator writer;
+  return InternalUncompress(compressed, &writer);
+}
+
+void RawCompress(const char* input,
+                 size_t input_length,
+                 char* compressed,
+                 size_t* compressed_length) {
+  ByteArraySource reader(input, input_length);
+  UncheckedByteArraySink writer(compressed);
+  Compress(&reader, &writer);
+
+  // Compute how many bytes were added
+  *compressed_length = (writer.CurrentDestination() - compressed);
+}
+
+size_t Compress(const char* input, size_t input_length, string* compressed) {
+  // Pre-grow the buffer to the max length of the compressed output
+  STLStringResizeUninitialized(compressed, MaxCompressedLength(input_length));
+
+  size_t compressed_length;
+  RawCompress(input, input_length, string_as_array(compressed),
+              &compressed_length);
+  compressed->resize(compressed_length);
+  return compressed_length;
+}
+
+// -----------------------------------------------------------------------
+// Sink interface
+// -----------------------------------------------------------------------
+
+// A type that decompresses into a Sink. The template parameter
+// Allocator must export one method "char* Allocate(int size);", which
+// allocates a buffer of "size" and appends that to the destination.
+template <typename Allocator>
+class SnappyScatteredWriter {
+  Allocator allocator_;
+
+  // We need random access into the data generated so far.  Therefore
+  // we keep track of all of the generated data as an array of blocks.
+  // All of the blocks except the last have length kBlockSize.
+  std::vector<char*> blocks_;
+  size_t expected_;
+
+  // Total size of all fully generated blocks so far
+  size_t full_size_;
+
+  // Pointer into current output block
+  char* op_base_;       // Base of output block
+  char* op_ptr_;        // Pointer to next unfilled byte in block
+  char* op_limit_;      // Pointer just past block
+
+  inline size_t Size() const {
+    return full_size_ + (op_ptr_ - op_base_);
+  }
+
+  bool SlowAppend(const char* ip, size_t len);
+  bool SlowAppendFromSelf(size_t offset, size_t len);
+
+ public:
+  inline explicit SnappyScatteredWriter(const Allocator& allocator)
+      : allocator_(allocator),
+        full_size_(0),
+        op_base_(NULL),
+        op_ptr_(NULL),
+        op_limit_(NULL) {
+  }
+
+  inline void SetExpectedLength(size_t len) {
+    assert(blocks_.empty());
+    expected_ = len;
+  }
+
+  inline bool CheckLength() const {
+    return Size() == expected_;
+  }
+
+  // Return the number of bytes actually uncompressed so far
+  inline size_t Produced() const {
+    return Size();
+  }
+
+  inline bool Append(const char* ip, size_t len) {
+    size_t avail = op_limit_ - op_ptr_;
+    if (len <= avail) {
+      // Fast path
+      memcpy(op_ptr_, ip, len);
+      op_ptr_ += len;
+      return true;
+    } else {
+      return SlowAppend(ip, len);
+    }
+  }
+
+  inline bool TryFastAppend(const char* ip, size_t available, size_t length) {
+    char* op = op_ptr_;
+    const int space_left = op_limit_ - op;
+    if (length <= 16 && available >= 16 + kMaximumTagLength &&
+        space_left >= 16) {
+      // Fast path, used for the majority (about 95%) of invocations.
+      UnalignedCopy128(ip, op);
+      op_ptr_ = op + length;
+      return true;
+    } else {
+      return false;
+    }
+  }
+
+  inline bool AppendFromSelf(size_t offset, size_t len) {
+    char* const op_end = op_ptr_ + len;
+    // See SnappyArrayWriter::AppendFromSelf for an explanation of
+    // the "offset - 1u" trick.
+    if (SNAPPY_PREDICT_TRUE(offset - 1u < (size_t)(op_ptr_ - op_base_) &&
+                          op_end <= op_limit_)) {
+      // Fast path: src and dst in current block.
+      op_ptr_ = IncrementalCopy(op_ptr_ - offset, op_ptr_, op_end, op_limit_);
+      return true;
+    }
+    return SlowAppendFromSelf(offset, len);
+  }
+
+  // Called at the end of the decompress. We ask the allocator
+  // write all blocks to the sink.
+  inline void Flush() { allocator_.Flush(Produced()); }
+};
+
+template<typename Allocator>
+bool SnappyScatteredWriter<Allocator>::SlowAppend(const char* ip, size_t len) {
+  size_t avail = op_limit_ - op_ptr_;
+  while (len > avail) {
+    // Completely fill this block
+    memcpy(op_ptr_, ip, avail);
+    op_ptr_ += avail;
+    assert(op_limit_ - op_ptr_ == 0);
+    full_size_ += (op_ptr_ - op_base_);
+    len -= avail;
+    ip += avail;
+
+    // Bounds check
+    if (full_size_ + len > expected_) {
+      return false;
+    }
+
+    // Make new block
+    size_t bsize = std::min<size_t>(kBlockSize, expected_ - full_size_);
+    op_base_ = allocator_.Allocate(bsize);
+    op_ptr_ = op_base_;
+    op_limit_ = op_base_ + bsize;
+    blocks_.push_back(op_base_);
+    avail = bsize;
+  }
+
+  memcpy(op_ptr_, ip, len);
+  op_ptr_ += len;
+  return true;
+}
+
+template<typename Allocator>
+bool SnappyScatteredWriter<Allocator>::SlowAppendFromSelf(size_t offset,
+                                                         size_t len) {
+  // Overflow check
+  // See SnappyArrayWriter::AppendFromSelf for an explanation of
+  // the "offset - 1u" trick.
+  const size_t cur = Size();
+  if (offset - 1u >= cur) return false;
+  if (expected_ - cur < len) return false;
+
+  // Currently we shouldn't ever hit this path because Compress() chops the
+  // input into blocks and does not create cross-block copies. However, it is
+  // nice if we do not rely on that, since we can get better compression if we
+  // allow cross-block copies and thus might want to change the compressor in
+  // the future.
+  size_t src = cur - offset;
+  while (len-- > 0) {
+    char c = blocks_[src >> kBlockLog][src & (kBlockSize-1)];
+    Append(&c, 1);
+    src++;
+  }
+  return true;
+}
+
+class SnappySinkAllocator {
+ public:
+  explicit SnappySinkAllocator(Sink* dest): dest_(dest) {}
+  ~SnappySinkAllocator() {}
+
+  char* Allocate(int size) {
+    Datablock block(new char[size], size);
+    blocks_.push_back(block);
+    return block.data;
+  }
+
+  // We flush only at the end, because the writer wants
+  // random access to the blocks and once we hand the
+  // block over to the sink, we can't access it anymore.
+  // Also we don't write more than has been actually written
+  // to the blocks.
+  void Flush(size_t size) {
+    size_t size_written = 0;
+    size_t block_size;
+    for (size_t i = 0; i < blocks_.size(); ++i) {
+      block_size = std::min<size_t>(blocks_[i].size, size - size_written);
+      dest_->AppendAndTakeOwnership(blocks_[i].data, block_size,
+                                    &SnappySinkAllocator::Deleter, NULL);
+      size_written += block_size;
+    }
+    blocks_.clear();
+  }
+
+ private:
+  struct Datablock {
+    char* data;
+    size_t size;
+    Datablock(char* p, size_t s) : data(p), size(s) {}
+  };
+
+  static void Deleter(void* arg, const char* bytes, size_t size) {
+    delete[] bytes;
+  }
+
+  Sink* dest_;
+  std::vector<Datablock> blocks_;
+
+  // Note: copying this object is allowed
+};
+
+size_t UncompressAsMuchAsPossible(Source* compressed, Sink* uncompressed) {
+  SnappySinkAllocator allocator(uncompressed);
+  SnappyScatteredWriter<SnappySinkAllocator> writer(allocator);
+  InternalUncompress(compressed, &writer);
+  return writer.Produced();
+}
+
+bool Uncompress(Source* compressed, Sink* uncompressed) {
+  // Read the uncompressed length from the front of the compressed input
+  SnappyDecompressor decompressor(compressed);
+  uint32 uncompressed_len = 0;
+  if (!decompressor.ReadUncompressedLength(&uncompressed_len)) {
+    return false;
+  }
+
+  char c;
+  size_t allocated_size;
+  char* buf = uncompressed->GetAppendBufferVariable(
+      1, uncompressed_len, &c, 1, &allocated_size);
+
+  const size_t compressed_len = compressed->Available();
+  // If we can get a flat buffer, then use it, otherwise do block by block
+  // uncompression
+  if (allocated_size >= uncompressed_len) {
+    SnappyArrayWriter writer(buf);
+    bool result = InternalUncompressAllTags(&decompressor, &writer,
+                                            compressed_len, uncompressed_len);
+    uncompressed->Append(buf, writer.Produced());
+    return result;
+  } else {
+    SnappySinkAllocator allocator(uncompressed);
+    SnappyScatteredWriter<SnappySinkAllocator> writer(allocator);
+    return InternalUncompressAllTags(&decompressor, &writer, compressed_len,
+                                     uncompressed_len);
+  }
+}
+
+}  // namespace lbug_snappy
+
+#endif  // #if SNAPPY_NEW_VERSION # else
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy.h
new file mode 100755
index 0000000000..f764e909df
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy.h
@@ -0,0 +1,412 @@
+// Copyright 2005 and onwards Google Inc.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//     * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+// A light-weight compression algorithm.  It is designed for speed of
+// compression and decompression, rather than for the utmost in space
+// savings.
+//
+// For getting better compression ratios when you are compressing data
+// with long repeated sequences or compressing data that is similar to
+// other data, while still compressing fast, you might look at first
+// using BMDiff and then compressing the output of BMDiff with
+// Snappy.
+
+#ifndef THIRD_PARTY_SNAPPY_SNAPPY_H__
+#define THIRD_PARTY_SNAPPY_SNAPPY_H__
+
+#include "snappy_version.hpp"
+
+#if SNAPPY_NEW_VERSION
+
+#include <stddef.h>
+#include <stdint.h>
+
+#include <string>
+
+#include "snappy-stubs-public.h"
+
+namespace lbug_snappy {
+  class Source;
+  class Sink;
+
+  struct CompressionOptions {
+    // Compression level.
+    // Level 1 is the fastest
+    // Level 2 is a little slower but provides better compression. Level 2 is
+    // **EXPERIMENTAL** for the time being. It might happen that we decide to
+    // fall back to level 1 in the future.
+    // Levels 3+ are currently not supported. We plan to support levels up to
+    // 9 in the future.
+    // If you played with other compression algorithms, level 1 is equivalent to
+    // fast mode (level 1) of LZ4, level 2 is equivalent to LZ4's level 2 mode
+    // and compresses somewhere around zstd:-3 and zstd:-2 but generally with
+    // faster decompression speeds than snappy:1 and zstd:-3.
+    int level = DefaultCompressionLevel();
+
+    constexpr CompressionOptions() = default;
+    constexpr CompressionOptions(int compression_level)
+        : level(compression_level) {}
+    static constexpr int MinCompressionLevel() { return 1; }
+    static constexpr int MaxCompressionLevel() { return 2; }
+    static constexpr int DefaultCompressionLevel() { return 1; }
+  };
+
+  // ------------------------------------------------------------------------
+  // Generic compression/decompression routines.
+  // ------------------------------------------------------------------------
+
+  // Compress the bytes read from "*reader" and append to "*writer". Return the
+  // number of bytes written.
+  // First version is to preserve ABI.
+  size_t Compress(Source* reader, Sink* writer);
+  size_t Compress(Source* reader, Sink* writer,
+                  CompressionOptions options);
+
+  // Find the uncompressed length of the given stream, as given by the header.
+  // Note that the true length could deviate from this; the stream could e.g.
+  // be truncated.
+  //
+  // Also note that this leaves "*source" in a state that is unsuitable for
+  // further operations, such as RawUncompress(). You will need to rewind
+  // or recreate the source yourself before attempting any further calls.
+  bool GetUncompressedLength(Source* source, uint32_t* result);
+
+  // ------------------------------------------------------------------------
+  // Higher-level string based routines (should be sufficient for most users)
+  // ------------------------------------------------------------------------
+
+  // Sets "*compressed" to the compressed version of "input[0..input_length-1]".
+  // Original contents of *compressed are lost.
+  //
+  // REQUIRES: "input[]" is not an alias of "*compressed".
+  // First version is to preserve ABI.
+  size_t Compress(const char* input, size_t input_length,
+                  std::string* compressed);
+  size_t Compress(const char* input, size_t input_length,
+                  std::string* compressed, CompressionOptions options);
+
+  // Same as `Compress` above but taking an `iovec` array as input. Note that
+  // this function preprocesses the inputs to compute the sum of
+  // `iov[0..iov_cnt-1].iov_len` before reading. To avoid this, use
+  // `RawCompressFromIOVec` below.
+  // First version is to preserve ABI.
+  size_t CompressFromIOVec(const struct iovec* iov, size_t iov_cnt,
+                           std::string* compressed);
+  size_t CompressFromIOVec(const struct iovec* iov, size_t iov_cnt,
+                           std::string* compressed,
+                           CompressionOptions options);
+
+  // Decompresses "compressed[0..compressed_length-1]" to "*uncompressed".
+  // Original contents of "*uncompressed" are lost.
+  //
+  // REQUIRES: "compressed[]" is not an alias of "*uncompressed".
+  //
+  // returns false if the message is corrupted and could not be decompressed
+  bool Uncompress(const char* compressed, size_t compressed_length,
+                  std::string* uncompressed);
+
+  // Decompresses "compressed" to "*uncompressed".
+  //
+  // returns false if the message is corrupted and could not be decompressed
+  bool Uncompress(Source* compressed, Sink* uncompressed);
+
+  // This routine uncompresses as much of the "compressed" as possible
+  // into sink.  It returns the number of valid bytes added to sink
+  // (extra invalid bytes may have been added due to errors; the caller
+  // should ignore those). The emitted data typically has length
+  // GetUncompressedLength(), but may be shorter if an error is
+  // encountered.
+  size_t UncompressAsMuchAsPossible(Source* compressed, Sink* uncompressed);
+
+  // ------------------------------------------------------------------------
+  // Lower-level character array based routines.  May be useful for
+  // efficiency reasons in certain circumstances.
+  // ------------------------------------------------------------------------
+
+  // REQUIRES: "compressed" must point to an area of memory that is at
+  // least "MaxCompressedLength(input_length)" bytes in length.
+  //
+  // Takes the data stored in "input[0..input_length]" and stores
+  // it in the array pointed to by "compressed".
+  //
+  // "*compressed_length" is set to the length of the compressed output.
+  //
+  // Example:
+  //    char* output = new char[snappy::MaxCompressedLength(input_length)];
+  //    size_t output_length;
+  //    RawCompress(input, input_length, output, &output_length);
+  //    ... Process(output, output_length) ...
+  //    delete [] output;
+  void RawCompress(const char* input, size_t input_length, char* compressed,
+                   size_t* compressed_length);
+  void RawCompress(const char* input, size_t input_length, char* compressed,
+                   size_t* compressed_length, CompressionOptions options);
+
+  // Same as `RawCompress` above but taking an `iovec` array as input. Note that
+  // `uncompressed_length` is the total number of bytes to be read from the
+  // elements of `iov` (_not_ the number of elements in `iov`).
+  void RawCompressFromIOVec(const struct iovec* iov, size_t uncompressed_length,
+                            char* compressed, size_t* compressed_length);
+  void RawCompressFromIOVec(const struct iovec* iov, size_t uncompressed_length,
+                            char* compressed, size_t* compressed_length,
+                            CompressionOptions options);
+
+  // Given data in "compressed[0..compressed_length-1]" generated by
+  // calling the Snappy::Compress routine, this routine
+  // stores the uncompressed data to
+  //    uncompressed[0..GetUncompressedLength(compressed)-1]
+  // returns false if the message is corrupted and could not be decrypted
+  bool RawUncompress(const char* compressed, size_t compressed_length,
+                     char* uncompressed);
+
+  // Given data from the byte source 'compressed' generated by calling
+  // the Snappy::Compress routine, this routine stores the uncompressed
+  // data to
+  //    uncompressed[0..GetUncompressedLength(compressed,compressed_length)-1]
+  // returns false if the message is corrupted and could not be decrypted
+  bool RawUncompress(Source* compressed, char* uncompressed);
+
+  // Given data in "compressed[0..compressed_length-1]" generated by
+  // calling the Snappy::Compress routine, this routine
+  // stores the uncompressed data to the iovec "iov". The number of physical
+  // buffers in "iov" is given by iov_cnt and their cumulative size
+  // must be at least GetUncompressedLength(compressed). The individual buffers
+  // in "iov" must not overlap with each other.
+  //
+  // returns false if the message is corrupted and could not be decrypted
+  bool RawUncompressToIOVec(const char* compressed, size_t compressed_length,
+                            const struct iovec* iov, size_t iov_cnt);
+
+  // Given data from the byte source 'compressed' generated by calling
+  // the Snappy::Compress routine, this routine stores the uncompressed
+  // data to the iovec "iov". The number of physical
+  // buffers in "iov" is given by iov_cnt and their cumulative size
+  // must be at least GetUncompressedLength(compressed). The individual buffers
+  // in "iov" must not overlap with each other.
+  //
+  // returns false if the message is corrupted and could not be decrypted
+  bool RawUncompressToIOVec(Source* compressed, const struct iovec* iov,
+                            size_t iov_cnt);
+
+  // Returns the maximal size of the compressed representation of
+  // input data that is "source_bytes" bytes in length;
+  size_t MaxCompressedLength(size_t source_bytes);
+
+  // REQUIRES: "compressed[]" was produced by RawCompress() or Compress()
+  // Returns true and stores the length of the uncompressed data in
+  // *result normally.  Returns false on parsing error.
+  // This operation takes O(1) time.
+  bool GetUncompressedLength(const char* compressed, size_t compressed_length,
+                             size_t* result);
+
+  // Returns true iff the contents of "compressed[]" can be uncompressed
+  // successfully.  Does not return the uncompressed data.  Takes
+  // time proportional to compressed_length, but is usually at least
+  // a factor of four faster than actual decompression.
+  bool IsValidCompressedBuffer(const char* compressed,
+                               size_t compressed_length);
+
+  // Returns true iff the contents of "compressed" can be uncompressed
+  // successfully.  Does not return the uncompressed data.  Takes
+  // time proportional to *compressed length, but is usually at least
+  // a factor of four faster than actual decompression.
+  // On success, consumes all of *compressed.  On failure, consumes an
+  // unspecified prefix of *compressed.
+  bool IsValidCompressed(Source* compressed);
+
+  // The size of a compression block. Note that many parts of the compression
+  // code assumes that kBlockSize <= 65536; in particular, the hash table
+  // can only store 16-bit offsets, and EmitCopy() also assumes the offset
+  // is 65535 bytes or less. Note also that if you change this, it will
+  // affect the framing format (see framing_format.txt).
+  //
+  // Note that there might be older data around that is compressed with larger
+  // block sizes, so the decompression code should not rely on the
+  // non-existence of long backreferences.
+  static constexpr int kBlockLog = 16;
+  static constexpr size_t kBlockSize = 1 << kBlockLog;
+
+  static constexpr int kMinHashTableBits = 8;
+  static constexpr size_t kMinHashTableSize = 1 << kMinHashTableBits;
+
+  static constexpr int kMaxHashTableBits = 15;
+  static constexpr size_t kMaxHashTableSize = 1 << kMaxHashTableBits;
+}  // end namespace lbug_snappy
+
+#else // #if SNAPPY_NEW_VERSION
+
+#include <cstddef>
+#include <string>
+
+#include "snappy-stubs-public.h"
+
+namespace lbug_snappy {
+  class Source;
+  class Sink;
+
+  // ------------------------------------------------------------------------
+  // Generic compression/decompression routines.
+  // ------------------------------------------------------------------------
+
+  // Compress the bytes read from "*source" and append to "*sink". Return the
+  // number of bytes written.
+  size_t Compress(Source* source, Sink* sink);
+
+  // Find the uncompressed length of the given stream, as given by the header.
+  // Note that the true length could deviate from this; the stream could e.g.
+  // be truncated.
+  //
+  // Also note that this leaves "*source" in a state that is unsuitable for
+  // further operations, such as RawUncompress(). You will need to rewind
+  // or recreate the source yourself before attempting any further calls.
+  bool GetUncompressedLength(Source* source, uint32* result);
+
+  // ------------------------------------------------------------------------
+  // Higher-level string based routines (should be sufficient for most users)
+  // ------------------------------------------------------------------------
+
+  // Sets "*output" to the compressed version of "input[0,input_length-1]".
+  // Original contents of *output are lost.
+  //
+  // REQUIRES: "input[]" is not an alias of "*output".
+  size_t Compress(const char* input, size_t input_length, string* output);
+
+  // Decompresses "compressed[0,compressed_length-1]" to "*uncompressed".
+  // Original contents of "*uncompressed" are lost.
+  //
+  // REQUIRES: "compressed[]" is not an alias of "*uncompressed".
+  //
+  // returns false if the message is corrupted and could not be decompressed
+  bool Uncompress(const char* compressed, size_t compressed_length,
+                  string* uncompressed);
+
+  // Decompresses "compressed" to "*uncompressed".
+  //
+  // returns false if the message is corrupted and could not be decompressed
+  bool Uncompress(Source* compressed, Sink* uncompressed);
+
+  // This routine uncompresses as much of the "compressed" as possible
+  // into sink.  It returns the number of valid bytes added to sink
+  // (extra invalid bytes may have been added due to errors; the caller
+  // should ignore those). The emitted data typically has length
+  // GetUncompressedLength(), but may be shorter if an error is
+  // encountered.
+  size_t UncompressAsMuchAsPossible(Source* compressed, Sink* uncompressed);
+
+  // ------------------------------------------------------------------------
+  // Lower-level character array based routines.  May be useful for
+  // efficiency reasons in certain circumstances.
+  // ------------------------------------------------------------------------
+
+  // REQUIRES: "compressed" must point to an area of memory that is at
+  // least "MaxCompressedLength(input_length)" bytes in length.
+  //
+  // Takes the data stored in "input[0..input_length]" and stores
+  // it in the array pointed to by "compressed".
+  //
+  // "*compressed_length" is set to the length of the compressed output.
+  //
+  // Example:
+  //    char* output = new char[snappy::MaxCompressedLength(input_length)];
+  //    size_t output_length;
+  //    RawCompress(input, input_length, output, &output_length);
+  //    ... Process(output, output_length) ...
+  //    delete [] output;
+  void RawCompress(const char* input,
+                   size_t input_length,
+                   char* compressed,
+                   size_t* compressed_length);
+
+  // Given data in "compressed[0..compressed_length-1]" generated by
+  // calling the Snappy::Compress routine, this routine
+  // stores the uncompressed data to
+  //    uncompressed[0..GetUncompressedLength(compressed)-1]
+  // returns false if the message is corrupted and could not be decrypted
+  bool RawUncompress(const char* compressed, size_t compressed_length,
+                     char* uncompressed);
+
+  // Given data from the byte source 'compressed' generated by calling
+  // the Snappy::Compress routine, this routine stores the uncompressed
+  // data to
+  //    uncompressed[0..GetUncompressedLength(compressed,compressed_length)-1]
+  // returns false if the message is corrupted and could not be decrypted
+  bool RawUncompress(Source* compressed, char* uncompressed);
+
+  // Given data in "compressed[0..compressed_length-1]" generated by
+  // calling the Snappy::Compress routine, this routine
+  // stores the uncompressed data to the iovec "iov". The number of physical
+  // buffers in "iov" is given by iov_cnt and their cumulative size
+  // must be at least GetUncompressedLength(compressed). The individual buffers
+  // in "iov" must not overlap with each other.
+  //
+  // returns false if the message is corrupted and could not be decrypted
+  bool RawUncompressToIOVec(const char* compressed, size_t compressed_length,
+                            const struct iovec* iov, size_t iov_cnt);
+
+  // Given data from the byte source 'compressed' generated by calling
+  // the Snappy::Compress routine, this routine stores the uncompressed
+  // data to the iovec "iov". The number of physical
+  // buffers in "iov" is given by iov_cnt and their cumulative size
+  // must be at least GetUncompressedLength(compressed). The individual buffers
+  // in "iov" must not overlap with each other.
+  //
+  // returns false if the message is corrupted and could not be decrypted
+  bool RawUncompressToIOVec(Source* compressed, const struct iovec* iov,
+                            size_t iov_cnt);
+
+  // Returns the maximal size of the compressed representation of
+  // input data that is "source_bytes" bytes in length;
+  size_t MaxCompressedLength(size_t source_bytes);
+
+  // REQUIRES: "compressed[]" was produced by RawCompress() or Compress()
+  // Returns true and stores the length of the uncompressed data in
+  // *result normally.  Returns false on parsing error.
+  // This operation takes O(1) time.
+  bool GetUncompressedLength(const char* compressed, size_t compressed_length,
+                             size_t* result);
+
+  // Returns true iff the contents of "compressed[]" can be uncompressed
+  // successfully.  Does not return the uncompressed data.  Takes
+  // time proportional to compressed_length, but is usually at least
+  // a factor of four faster than actual decompression.
+  bool IsValidCompressedBuffer(const char* compressed,
+                               size_t compressed_length);
+
+  // Returns true iff the contents of "compressed" can be uncompressed
+  // successfully.  Does not return the uncompressed data.  Takes
+  // time proportional to *compressed length, but is usually at least
+  // a factor of four faster than actual decompression.
+  // On success, consumes all of *compressed.  On failure, consumes an
+  // unspecified prefix of *compressed.
+  bool IsValidCompressed(Source* compressed);
+
+}  // end namespace lbug_snappy
+
+#endif  // #if SNAPPY_NEW_VERSION # else
+
+#endif  // THIRD_PARTY_SNAPPY_SNAPPY_H__
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy_version.hpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy_version.hpp
new file mode 100644
index 0000000000..39083014f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/snappy/snappy_version.hpp
@@ -0,0 +1,11 @@
+#pragma once
+
+//! The new version of snappy is much faster when compiled with clang, but slower when compiled with GCC
+//! For Lbug, we default to the old version if the compiler is not clang
+#ifndef SNAPPY_NEW_VERSION
+#ifdef __clang__
+#define SNAPPY_NEW_VERSION true
+#else
+#define SNAPPY_NEW_VERSION false
+#endif
+#endif
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/LICENSE
new file mode 100644
index 0000000000..12beadb27e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/LICENSE
@@ -0,0 +1,26 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Gabi Melman.                                       
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+-- NOTE: Third party dependency used by this software --
+This software depends on the fmt lib (MIT License),
+and users must comply to its license: https://github.com/fmtlib/fmt/blob/master/LICENSE.rst
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/async.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/async.h
new file mode 100644
index 0000000000..e96abd199b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/async.h
@@ -0,0 +1,100 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+//
+// Async logging using global thread pool
+// All loggers created here share same global thread pool.
+// Each log message is pushed to a queue along with a shared pointer to the
+// logger.
+// If a logger deleted while having pending messages in the queue, it's actual
+// destruction will defer
+// until all its messages are processed by the thread pool.
+// This is because each message in the queue holds a shared_ptr to the
+// originating logger.
+
+#include <spdlog/async_logger.h>
+#include <spdlog/details/registry.h>
+#include <spdlog/details/thread_pool.h>
+
+#include <functional>
+#include <memory>
+#include <mutex>
+
+namespace spdlog {
+
+namespace details {
+static const size_t default_async_q_size = 8192;
+}
+
+// async logger factory - creates async loggers backed with thread pool.
+// if a global thread pool doesn't already exist, create it with default queue
+// size of 8192 items and single thread.
+template <async_overflow_policy OverflowPolicy = async_overflow_policy::block>
+struct async_factory_impl {
+    template <typename Sink, typename... SinkArgs>
+    static std::shared_ptr<async_logger> create(std::string logger_name, SinkArgs &&...args) {
+        auto &registry_inst = details::registry::instance();
+
+        // create global thread pool if not already exists..
+
+        auto &mutex = registry_inst.tp_mutex();
+        std::lock_guard<std::recursive_mutex> tp_lock(mutex);
+        auto tp = registry_inst.get_tp();
+        if (tp == nullptr) {
+            tp = std::make_shared<details::thread_pool>(details::default_async_q_size, 1U);
+            registry_inst.set_tp(tp);
+        }
+
+        auto sink = std::make_shared<Sink>(std::forward<SinkArgs>(args)...);
+        auto new_logger = std::make_shared<async_logger>(std::move(logger_name), std::move(sink),
+                                                         std::move(tp), OverflowPolicy);
+        registry_inst.initialize_logger(new_logger);
+        return new_logger;
+    }
+};
+
+using async_factory = async_factory_impl<async_overflow_policy::block>;
+using async_factory_nonblock = async_factory_impl<async_overflow_policy::overrun_oldest>;
+
+template <typename Sink, typename... SinkArgs>
+inline std::shared_ptr<spdlog::logger> create_async(std::string logger_name,
+                                                    SinkArgs &&...sink_args) {
+    return async_factory::create<Sink>(std::move(logger_name),
+                                       std::forward<SinkArgs>(sink_args)...);
+}
+
+template <typename Sink, typename... SinkArgs>
+inline std::shared_ptr<spdlog::logger> create_async_nb(std::string logger_name,
+                                                       SinkArgs &&...sink_args) {
+    return async_factory_nonblock::create<Sink>(std::move(logger_name),
+                                                std::forward<SinkArgs>(sink_args)...);
+}
+
+// set global thread pool.
+inline void init_thread_pool(size_t q_size,
+                             size_t thread_count,
+                             std::function<void()> on_thread_start,
+                             std::function<void()> on_thread_stop) {
+    auto tp = std::make_shared<details::thread_pool>(q_size, thread_count, on_thread_start,
+                                                     on_thread_stop);
+    details::registry::instance().set_tp(std::move(tp));
+}
+
+inline void init_thread_pool(size_t q_size,
+                             size_t thread_count,
+                             std::function<void()> on_thread_start) {
+    init_thread_pool(q_size, thread_count, on_thread_start, [] {});
+}
+
+inline void init_thread_pool(size_t q_size, size_t thread_count) {
+    init_thread_pool(
+        q_size, thread_count, [] {}, [] {});
+}
+
+// get the global thread pool.
+inline std::shared_ptr<spdlog::details::thread_pool> thread_pool() {
+    return details::registry::instance().get_tp();
+}
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/async_logger-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/async_logger-inl.h
new file mode 100644
index 0000000000..1e79479850
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/async_logger-inl.h
@@ -0,0 +1,84 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/async_logger.h>
+#endif
+
+#include <spdlog/details/thread_pool.h>
+#include <spdlog/sinks/sink.h>
+
+#include <memory>
+#include <string>
+
+SPDLOG_INLINE spdlog::async_logger::async_logger(std::string logger_name,
+                                                 sinks_init_list sinks_list,
+                                                 std::weak_ptr<details::thread_pool> tp,
+                                                 async_overflow_policy overflow_policy)
+    : async_logger(std::move(logger_name),
+                   sinks_list.begin(),
+                   sinks_list.end(),
+                   std::move(tp),
+                   overflow_policy) {}
+
+SPDLOG_INLINE spdlog::async_logger::async_logger(std::string logger_name,
+                                                 sink_ptr single_sink,
+                                                 std::weak_ptr<details::thread_pool> tp,
+                                                 async_overflow_policy overflow_policy)
+    : async_logger(
+          std::move(logger_name), {std::move(single_sink)}, std::move(tp), overflow_policy) {}
+
+// send the log message to the thread pool
+SPDLOG_INLINE void spdlog::async_logger::sink_it_(const details::log_msg &msg){
+    SPDLOG_TRY{if (auto pool_ptr = thread_pool_.lock()){
+        pool_ptr->post_log(shared_from_this(), msg, overflow_policy_);
+}
+else {
+    throw_spdlog_ex("async log: thread pool doesn't exist anymore");
+}
+}
+SPDLOG_LOGGER_CATCH(msg.source)
+}
+
+// send flush request to the thread pool
+SPDLOG_INLINE void spdlog::async_logger::flush_(){
+    SPDLOG_TRY{if (auto pool_ptr = thread_pool_.lock()){
+        pool_ptr->post_flush(shared_from_this(), overflow_policy_);
+}
+else {
+    throw_spdlog_ex("async flush: thread pool doesn't exist anymore");
+}
+}
+SPDLOG_LOGGER_CATCH(source_loc())
+}
+
+//
+// backend functions - called from the thread pool to do the actual job
+//
+SPDLOG_INLINE void spdlog::async_logger::backend_sink_it_(const details::log_msg &msg) {
+    for (auto &sink : sinks_) {
+        if (sink->should_log(msg.level)) {
+            SPDLOG_TRY { sink->log(msg); }
+            SPDLOG_LOGGER_CATCH(msg.source)
+        }
+    }
+
+    if (should_flush_(msg)) {
+        backend_flush_();
+    }
+}
+
+SPDLOG_INLINE void spdlog::async_logger::backend_flush_() {
+    for (auto &sink : sinks_) {
+        SPDLOG_TRY { sink->flush(); }
+        SPDLOG_LOGGER_CATCH(source_loc())
+    }
+}
+
+SPDLOG_INLINE std::shared_ptr<spdlog::logger> spdlog::async_logger::clone(std::string new_name) {
+    auto cloned = std::make_shared<spdlog::async_logger>(*this);
+    cloned->name_ = std::move(new_name);
+    return cloned;
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/async_logger.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/async_logger.h
new file mode 100644
index 0000000000..846c4c6f08
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/async_logger.h
@@ -0,0 +1,74 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+// Fast asynchronous logger.
+// Uses pre allocated queue.
+// Creates a single back thread to pop messages from the queue and log them.
+//
+// Upon each log write the logger:
+//    1. Checks if its log level is enough to log the message
+//    2. Push a new copy of the message to a queue (or block the caller until
+//    space is available in the queue)
+// Upon destruction, logs all remaining messages in the queue before
+// destructing..
+
+#include <spdlog/logger.h>
+
+namespace spdlog {
+
+// Async overflow policy - block by default.
+enum class async_overflow_policy {
+    block,           // Block until message can be enqueued
+    overrun_oldest,  // Discard oldest message in the queue if full when trying to
+                     // add new item.
+    discard_new      // Discard new message if the queue is full when trying to add new item.
+};
+
+namespace details {
+class thread_pool;
+}
+
+class SPDLOG_API async_logger final : public std::enable_shared_from_this<async_logger>,
+                                      public logger {
+    friend class details::thread_pool;
+
+public:
+    template <typename It>
+    async_logger(std::string logger_name,
+                 It begin,
+                 It end,
+                 std::weak_ptr<details::thread_pool> tp,
+                 async_overflow_policy overflow_policy = async_overflow_policy::block)
+        : logger(std::move(logger_name), begin, end),
+          thread_pool_(std::move(tp)),
+          overflow_policy_(overflow_policy) {}
+
+    async_logger(std::string logger_name,
+                 sinks_init_list sinks_list,
+                 std::weak_ptr<details::thread_pool> tp,
+                 async_overflow_policy overflow_policy = async_overflow_policy::block);
+
+    async_logger(std::string logger_name,
+                 sink_ptr single_sink,
+                 std::weak_ptr<details::thread_pool> tp,
+                 async_overflow_policy overflow_policy = async_overflow_policy::block);
+
+    std::shared_ptr<logger> clone(std::string new_name) override;
+
+protected:
+    void sink_it_(const details::log_msg &msg) override;
+    void flush_() override;
+    void backend_sink_it_(const details::log_msg &incoming_log_msg);
+    void backend_flush_();
+
+private:
+    std::weak_ptr<details::thread_pool> thread_pool_;
+    async_overflow_policy overflow_policy_;
+};
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "async_logger-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/argv.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/argv.h
new file mode 100644
index 0000000000..7de2f83e7d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/argv.h
@@ -0,0 +1,40 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+#include <spdlog/cfg/helpers.h>
+#include <spdlog/details/registry.h>
+
+//
+// Init log levels using each argv entry that starts with "SPDLOG_LEVEL="
+//
+// set all loggers to debug level:
+// example.exe "SPDLOG_LEVEL=debug"
+
+// set logger1 to trace level
+// example.exe "SPDLOG_LEVEL=logger1=trace"
+
+// turn off all logging except for logger1 and logger2:
+// example.exe "SPDLOG_LEVEL=off,logger1=debug,logger2=info"
+
+namespace spdlog {
+namespace cfg {
+
+// search for SPDLOG_LEVEL= in the args and use it to init the levels
+inline void load_argv_levels(int argc, const char **argv) {
+    const std::string spdlog_level_prefix = "SPDLOG_LEVEL=";
+    for (int i = 1; i < argc; i++) {
+        std::string arg = argv[i];
+        if (arg.find(spdlog_level_prefix) == 0) {
+            auto levels_string = arg.substr(spdlog_level_prefix.size());
+            helpers::load_levels(levels_string);
+        }
+    }
+}
+
+inline void load_argv_levels(int argc, char **argv) {
+    load_argv_levels(argc, const_cast<const char **>(argv));
+}
+
+}  // namespace cfg
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/env.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/env.h
new file mode 100644
index 0000000000..6e55414544
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/env.h
@@ -0,0 +1,36 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+#include <spdlog/cfg/helpers.h>
+#include <spdlog/details/os.h>
+#include <spdlog/details/registry.h>
+
+//
+// Init levels and patterns from env variables SPDLOG_LEVEL
+// Inspired from Rust's "env_logger" crate (https://crates.io/crates/env_logger).
+// Note - fallback to "info" level on unrecognized levels
+//
+// Examples:
+//
+// set global level to debug:
+// export SPDLOG_LEVEL=debug
+//
+// turn off all logging except for logger1:
+// export SPDLOG_LEVEL="*=off,logger1=debug"
+//
+
+// turn off all logging except for logger1 and logger2:
+// export SPDLOG_LEVEL="off,logger1=debug,logger2=info"
+
+namespace spdlog {
+namespace cfg {
+inline void load_env_levels() {
+    auto env_val = details::os::getenv("SPDLOG_LEVEL");
+    if (!env_val.empty()) {
+        helpers::load_levels(env_val);
+    }
+}
+
+}  // namespace cfg
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/helpers-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/helpers-inl.h
new file mode 100644
index 0000000000..93650a2e84
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/helpers-inl.h
@@ -0,0 +1,107 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/cfg/helpers.h>
+#endif
+
+#include <spdlog/details/os.h>
+#include <spdlog/details/registry.h>
+#include <spdlog/spdlog.h>
+
+#include <algorithm>
+#include <sstream>
+#include <string>
+#include <utility>
+
+namespace spdlog {
+namespace cfg {
+namespace helpers {
+
+// inplace convert to lowercase
+inline std::string &to_lower_(std::string &str) {
+    std::transform(str.begin(), str.end(), str.begin(), [](char ch) {
+        return static_cast<char>((ch >= 'A' && ch <= 'Z') ? ch + ('a' - 'A') : ch);
+    });
+    return str;
+}
+
+// inplace trim spaces
+inline std::string &trim_(std::string &str) {
+    const char *spaces = " \n\r\t";
+    str.erase(str.find_last_not_of(spaces) + 1);
+    str.erase(0, str.find_first_not_of(spaces));
+    return str;
+}
+
+// return (name,value) trimmed pair from given "name=value" string.
+// return empty string on missing parts
+// "key=val" => ("key", "val")
+// " key  =  val " => ("key", "val")
+// "key=" => ("key", "")
+// "val" => ("", "val")
+
+inline std::pair<std::string, std::string> extract_kv_(char sep, const std::string &str) {
+    auto n = str.find(sep);
+    std::string k, v;
+    if (n == std::string::npos) {
+        v = str;
+    } else {
+        k = str.substr(0, n);
+        v = str.substr(n + 1);
+    }
+    return std::make_pair(trim_(k), trim_(v));
+}
+
+// return vector of key/value pairs from sequence of "K1=V1,K2=V2,.."
+// "a=AAA,b=BBB,c=CCC,.." => {("a","AAA"),("b","BBB"),("c", "CCC"),...}
+inline std::unordered_map<std::string, std::string> extract_key_vals_(const std::string &str) {
+    std::string token;
+    std::istringstream token_stream(str);
+    std::unordered_map<std::string, std::string> rv{};
+    while (std::getline(token_stream, token, ',')) {
+        if (token.empty()) {
+            continue;
+        }
+        auto kv = extract_kv_('=', token);
+        rv[kv.first] = kv.second;
+    }
+    return rv;
+}
+
+SPDLOG_INLINE void load_levels(const std::string &input) {
+    if (input.empty() || input.size() > 512) {
+        return;
+    }
+
+    auto key_vals = extract_key_vals_(input);
+    std::unordered_map<std::string, level::level_enum> levels;
+    level::level_enum global_level = level::info;
+    bool global_level_found = false;
+
+    for (auto &name_level : key_vals) {
+        auto &logger_name = name_level.first;
+        auto level_name = to_lower_(name_level.second);
+        auto level = level::from_str(level_name);
+        // ignore unrecognized level names
+        if (level == level::off && level_name != "off") {
+            continue;
+        }
+        if (logger_name.empty())  // no logger name indicate global level
+        {
+            global_level_found = true;
+            global_level = level;
+        } else {
+            levels[logger_name] = level;
+        }
+    }
+
+    details::registry::instance().set_levels(std::move(levels),
+                                             global_level_found ? &global_level : nullptr);
+}
+
+}  // namespace helpers
+}  // namespace cfg
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/helpers.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/helpers.h
new file mode 100644
index 0000000000..c02381891c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/cfg/helpers.h
@@ -0,0 +1,29 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <unordered_map>
+
+namespace spdlog {
+namespace cfg {
+namespace helpers {
+//
+// Init levels from given string
+//
+// Examples:
+//
+// set global level to debug: "debug"
+// turn off all logging except for logger1: "off,logger1=debug"
+// turn off all logging except for logger1 and logger2: "off,logger1=debug,logger2=info"
+//
+SPDLOG_API void load_levels(const std::string &txt);
+}  // namespace helpers
+
+}  // namespace cfg
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "helpers-inl.h"
+#endif  // SPDLOG_HEADER_ONLY
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/common-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/common-inl.h
new file mode 100644
index 0000000000..a8a0453c14
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/common-inl.h
@@ -0,0 +1,68 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/common.h>
+#endif
+
+#include <algorithm>
+#include <iterator>
+
+namespace spdlog {
+namespace level {
+
+#if __cplusplus >= 201703L
+constexpr
+#endif
+    static string_view_t level_string_views[] SPDLOG_LEVEL_NAMES;
+
+static const char *short_level_names[] SPDLOG_SHORT_LEVEL_NAMES;
+
+SPDLOG_INLINE const string_view_t &to_string_view(spdlog::level::level_enum l) SPDLOG_NOEXCEPT {
+    return level_string_views[l];
+}
+
+SPDLOG_INLINE const char *to_short_c_str(spdlog::level::level_enum l) SPDLOG_NOEXCEPT {
+    return short_level_names[l];
+}
+
+SPDLOG_INLINE spdlog::level::level_enum from_str(const std::string &name) SPDLOG_NOEXCEPT {
+    auto it = std::find(std::begin(level_string_views), std::end(level_string_views), name);
+    if (it != std::end(level_string_views))
+        return static_cast<level::level_enum>(std::distance(std::begin(level_string_views), it));
+
+    // check also for "warn" and "err" before giving up..
+    if (name == "warn") {
+        return level::warn;
+    }
+    if (name == "err") {
+        return level::err;
+    }
+    return level::off;
+}
+}  // namespace level
+
+SPDLOG_INLINE spdlog_ex::spdlog_ex(std::string msg)
+    : msg_(std::move(msg)) {}
+
+SPDLOG_INLINE spdlog_ex::spdlog_ex(const std::string &msg, int last_errno) {
+#ifdef SPDLOG_USE_STD_FORMAT
+    msg_ = std::system_error(std::error_code(last_errno, std::generic_category()), msg).what();
+#else
+    memory_buf_t outbuf;
+    fmt::format_system_error(outbuf, last_errno, msg.c_str());
+    msg_ = fmt::to_string(outbuf);
+#endif
+}
+
+SPDLOG_INLINE const char *spdlog_ex::what() const SPDLOG_NOEXCEPT { return msg_.c_str(); }
+
+SPDLOG_INLINE void throw_spdlog_ex(const std::string &msg, int last_errno) {
+    SPDLOG_THROW(spdlog_ex(msg, last_errno));
+}
+
+SPDLOG_INLINE void throw_spdlog_ex(std::string msg) { SPDLOG_THROW(spdlog_ex(std::move(msg))); }
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/common.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/common.h
new file mode 100644
index 0000000000..1269c14af4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/common.h
@@ -0,0 +1,411 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/tweakme.h>
+
+#include <atomic>
+#include <chrono>
+#include <cstdio>
+#include <exception>
+#include <functional>
+#include <initializer_list>
+#include <memory>
+#include <string>
+#include <type_traits>
+
+#ifdef SPDLOG_USE_STD_FORMAT
+    #include <version>
+    #if __cpp_lib_format >= 202207L
+        #include <format>
+    #else
+        #include <string_view>
+    #endif
+#endif
+
+#ifdef SPDLOG_COMPILED_LIB
+    #undef SPDLOG_HEADER_ONLY
+    #if defined(SPDLOG_SHARED_LIB)
+        #if defined(_WIN32)
+            #ifdef spdlog_EXPORTS
+                #define SPDLOG_API __declspec(dllexport)
+            #else  // !spdlog_EXPORTS
+                #define SPDLOG_API __declspec(dllimport)
+            #endif
+        #else  // !defined(_WIN32)
+            #define SPDLOG_API __attribute__((visibility("default")))
+        #endif
+    #else  // !defined(SPDLOG_SHARED_LIB)
+        #define SPDLOG_API
+    #endif
+    #define SPDLOG_INLINE
+#else  // !defined(SPDLOG_COMPILED_LIB)
+    #define SPDLOG_API
+    #define SPDLOG_HEADER_ONLY
+    #define SPDLOG_INLINE inline
+#endif  // #ifdef SPDLOG_COMPILED_LIB
+
+#include <spdlog/fmt/fmt.h>
+
+#if !defined(SPDLOG_USE_STD_FORMAT) && \
+    FMT_VERSION >= 80000  // backward compatibility with fmt versions older than 8
+    #define SPDLOG_FMT_RUNTIME(format_string) fmt::runtime(format_string)
+    #define SPDLOG_FMT_STRING(format_string) FMT_STRING(format_string)
+    #if defined(SPDLOG_WCHAR_FILENAMES) || defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT)
+        #include <spdlog/fmt/xchar.h>
+    #endif
+#else
+    #define SPDLOG_FMT_RUNTIME(format_string) format_string
+    #define SPDLOG_FMT_STRING(format_string) format_string
+#endif
+
+// visual studio up to 2013 does not support noexcept nor constexpr
+#if defined(_MSC_VER) && (_MSC_VER < 1900)
+    #define SPDLOG_NOEXCEPT _NOEXCEPT
+    #define SPDLOG_CONSTEXPR
+#else
+    #define SPDLOG_NOEXCEPT noexcept
+    #define SPDLOG_CONSTEXPR constexpr
+#endif
+
+// If building with std::format, can just use constexpr, otherwise if building with fmt
+// SPDLOG_CONSTEXPR_FUNC needs to be set the same as FMT_CONSTEXPR to avoid situations where
+// a constexpr function in spdlog could end up calling a non-constexpr function in fmt
+// depending on the compiler
+// If fmt determines it can't use constexpr, we should inline the function instead
+#ifdef SPDLOG_USE_STD_FORMAT
+    #define SPDLOG_CONSTEXPR_FUNC constexpr
+#else  // Being built with fmt
+    #if FMT_USE_CONSTEXPR
+        #define SPDLOG_CONSTEXPR_FUNC FMT_CONSTEXPR
+    #else
+	#define SPDLOG_CONSTEXPR_FUNC inline
+    #endif
+#endif
+
+#if defined(__GNUC__) || defined(__clang__)
+    #define SPDLOG_DEPRECATED __attribute__((deprecated))
+#elif defined(_MSC_VER)
+    #define SPDLOG_DEPRECATED __declspec(deprecated)
+#else
+    #define SPDLOG_DEPRECATED
+#endif
+
+// disable thread local on msvc 2013
+#ifndef SPDLOG_NO_TLS
+    #if (defined(_MSC_VER) && (_MSC_VER < 1900)) || defined(__cplusplus_winrt)
+        #define SPDLOG_NO_TLS 1
+    #endif
+#endif
+
+#ifndef SPDLOG_FUNCTION
+    #define SPDLOG_FUNCTION static_cast<const char *>(__FUNCTION__)
+#endif
+
+#ifdef SPDLOG_NO_EXCEPTIONS
+    #define SPDLOG_TRY
+    #define SPDLOG_THROW(ex)                               \
+        do {                                               \
+            printf("spdlog fatal error: %s\n", ex.what()); \
+            std::abort();                                  \
+        } while (0)
+    #define SPDLOG_CATCH_STD
+#else
+    #define SPDLOG_TRY try
+    #define SPDLOG_THROW(ex) throw(ex)
+    #define SPDLOG_CATCH_STD             \
+        catch (const std::exception &) { \
+        }
+#endif
+
+namespace spdlog {
+
+class formatter;
+
+namespace sinks {
+class sink;
+}
+
+#if defined(_WIN32) && defined(SPDLOG_WCHAR_FILENAMES)
+using filename_t = std::wstring;
+    // allow macro expansion to occur in SPDLOG_FILENAME_T
+    #define SPDLOG_FILENAME_T_INNER(s) L##s
+    #define SPDLOG_FILENAME_T(s) SPDLOG_FILENAME_T_INNER(s)
+#else
+using filename_t = std::string;
+    #define SPDLOG_FILENAME_T(s) s
+#endif
+
+using log_clock = std::chrono::system_clock;
+using sink_ptr = std::shared_ptr<sinks::sink>;
+using sinks_init_list = std::initializer_list<sink_ptr>;
+using err_handler = std::function<void(const std::string &err_msg)>;
+#ifdef SPDLOG_USE_STD_FORMAT
+namespace fmt_lib = std;
+
+using string_view_t = std::string_view;
+using memory_buf_t = std::string;
+
+template <typename... Args>
+    #if __cpp_lib_format >= 202207L
+using format_string_t = std::format_string<Args...>;
+    #else
+using format_string_t = std::string_view;
+    #endif
+
+template <class T, class Char = char>
+struct is_convertible_to_basic_format_string
+    : std::integral_constant<bool, std::is_convertible<T, std::basic_string_view<Char>>::value> {};
+
+    #if defined(SPDLOG_WCHAR_FILENAMES) || defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT)
+using wstring_view_t = std::wstring_view;
+using wmemory_buf_t = std::wstring;
+
+template <typename... Args>
+        #if __cpp_lib_format >= 202207L
+using wformat_string_t = std::wformat_string<Args...>;
+        #else
+using wformat_string_t = std::wstring_view;
+        #endif
+    #endif
+    #define SPDLOG_BUF_TO_STRING(x) x
+#else  // use fmt lib instead of std::format
+namespace fmt_lib = fmt;
+
+using string_view_t = fmt::basic_string_view<char>;
+using memory_buf_t = fmt::basic_memory_buffer<char, 250>;
+
+template <typename... Args>
+using format_string_t = fmt::format_string<Args...>;
+
+template <class T>
+using remove_cvref_t = typename std::remove_cv<typename std::remove_reference<T>::type>::type;
+
+template <typename Char>
+    #if FMT_VERSION >= 90101
+using fmt_runtime_string = fmt::runtime_format_string<Char>;
+    #else
+using fmt_runtime_string = fmt::basic_runtime<Char>;
+    #endif
+
+// clang doesn't like SFINAE disabled constructor in std::is_convertible<> so have to repeat the
+// condition from basic_format_string here, in addition, fmt::basic_runtime<Char> is only
+// convertible to basic_format_string<Char> but not basic_string_view<Char>
+template <class T, class Char = char>
+struct is_convertible_to_basic_format_string
+    : std::integral_constant<bool,
+                             std::is_convertible<T, fmt::basic_string_view<Char>>::value ||
+                                 std::is_same<remove_cvref_t<T>, fmt_runtime_string<Char>>::value> {
+};
+
+    #if defined(SPDLOG_WCHAR_FILENAMES) || defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT)
+using wstring_view_t = fmt::basic_string_view<wchar_t>;
+using wmemory_buf_t = fmt::basic_memory_buffer<wchar_t, 250>;
+
+template <typename... Args>
+using wformat_string_t = fmt::wformat_string<Args...>;
+    #endif
+    #define SPDLOG_BUF_TO_STRING(x) fmt::to_string(x)
+#endif
+
+#ifdef SPDLOG_WCHAR_TO_UTF8_SUPPORT
+    #ifndef _WIN32
+        #error SPDLOG_WCHAR_TO_UTF8_SUPPORT only supported on windows
+    #endif  // _WIN32
+#endif      // SPDLOG_WCHAR_TO_UTF8_SUPPORT
+
+template <class T>
+struct is_convertible_to_any_format_string
+    : std::integral_constant<bool,
+                             is_convertible_to_basic_format_string<T, char>::value ||
+                                 is_convertible_to_basic_format_string<T, wchar_t>::value> {};
+
+#if defined(SPDLOG_NO_ATOMIC_LEVELS)
+using level_t = details::null_atomic_int;
+#else
+using level_t = std::atomic<int>;
+#endif
+
+#define SPDLOG_LEVEL_TRACE 0
+#define SPDLOG_LEVEL_DEBUG 1
+#define SPDLOG_LEVEL_INFO 2
+#define SPDLOG_LEVEL_WARN 3
+#define SPDLOG_LEVEL_ERROR 4
+#define SPDLOG_LEVEL_CRITICAL 5
+#define SPDLOG_LEVEL_OFF 6
+
+#if !defined(SPDLOG_ACTIVE_LEVEL)
+    #define SPDLOG_ACTIVE_LEVEL SPDLOG_LEVEL_INFO
+#endif
+
+// Log level enum
+namespace level {
+enum level_enum : int {
+    trace = SPDLOG_LEVEL_TRACE,
+    debug = SPDLOG_LEVEL_DEBUG,
+    info = SPDLOG_LEVEL_INFO,
+    warn = SPDLOG_LEVEL_WARN,
+    err = SPDLOG_LEVEL_ERROR,
+    critical = SPDLOG_LEVEL_CRITICAL,
+    off = SPDLOG_LEVEL_OFF,
+    n_levels
+};
+
+#define SPDLOG_LEVEL_NAME_TRACE spdlog::string_view_t("trace", 5)
+#define SPDLOG_LEVEL_NAME_DEBUG spdlog::string_view_t("debug", 5)
+#define SPDLOG_LEVEL_NAME_INFO spdlog::string_view_t("info", 4)
+#define SPDLOG_LEVEL_NAME_WARNING spdlog::string_view_t("warning", 7)
+#define SPDLOG_LEVEL_NAME_ERROR spdlog::string_view_t("error", 5)
+#define SPDLOG_LEVEL_NAME_CRITICAL spdlog::string_view_t("critical", 8)
+#define SPDLOG_LEVEL_NAME_OFF spdlog::string_view_t("off", 3)
+
+#if !defined(SPDLOG_LEVEL_NAMES)
+    #define SPDLOG_LEVEL_NAMES                                                                  \
+        {                                                                                       \
+            SPDLOG_LEVEL_NAME_TRACE, SPDLOG_LEVEL_NAME_DEBUG, SPDLOG_LEVEL_NAME_INFO,           \
+                SPDLOG_LEVEL_NAME_WARNING, SPDLOG_LEVEL_NAME_ERROR, SPDLOG_LEVEL_NAME_CRITICAL, \
+                SPDLOG_LEVEL_NAME_OFF                                                           \
+        }
+#endif
+
+#if !defined(SPDLOG_SHORT_LEVEL_NAMES)
+
+    #define SPDLOG_SHORT_LEVEL_NAMES \
+        { "T", "D", "I", "W", "E", "C", "O" }
+#endif
+
+SPDLOG_API const string_view_t &to_string_view(spdlog::level::level_enum l) SPDLOG_NOEXCEPT;
+SPDLOG_API const char *to_short_c_str(spdlog::level::level_enum l) SPDLOG_NOEXCEPT;
+SPDLOG_API spdlog::level::level_enum from_str(const std::string &name) SPDLOG_NOEXCEPT;
+
+}  // namespace level
+
+//
+// Color mode used by sinks with color support.
+//
+enum class color_mode { always, automatic, never };
+
+//
+// Pattern time - specific time getting to use for pattern_formatter.
+// local time by default
+//
+enum class pattern_time_type {
+    local,  // log localtime
+    utc     // log utc
+};
+
+//
+// Log exception
+//
+class SPDLOG_API spdlog_ex : public std::exception {
+public:
+    explicit spdlog_ex(std::string msg);
+    spdlog_ex(const std::string &msg, int last_errno);
+    const char *what() const SPDLOG_NOEXCEPT override;
+
+private:
+    std::string msg_;
+};
+
+[[noreturn]] SPDLOG_API void throw_spdlog_ex(const std::string &msg, int last_errno);
+[[noreturn]] SPDLOG_API void throw_spdlog_ex(std::string msg);
+
+struct source_loc {
+    SPDLOG_CONSTEXPR source_loc() = default;
+    SPDLOG_CONSTEXPR source_loc(const char *filename_in, int line_in, const char *funcname_in)
+        : filename{filename_in},
+          line{line_in},
+          funcname{funcname_in} {}
+
+    SPDLOG_CONSTEXPR bool empty() const SPDLOG_NOEXCEPT { return line == 0; }
+    const char *filename{nullptr};
+    int line{0};
+    const char *funcname{nullptr};
+};
+
+struct file_event_handlers {
+    file_event_handlers()
+        : before_open(nullptr),
+          after_open(nullptr),
+          before_close(nullptr),
+          after_close(nullptr) {}
+
+    std::function<void(const filename_t &filename)> before_open;
+    std::function<void(const filename_t &filename, std::FILE *file_stream)> after_open;
+    std::function<void(const filename_t &filename, std::FILE *file_stream)> before_close;
+    std::function<void(const filename_t &filename)> after_close;
+};
+
+namespace details {
+
+// to_string_view
+
+SPDLOG_CONSTEXPR_FUNC spdlog::string_view_t to_string_view(const memory_buf_t &buf)
+    SPDLOG_NOEXCEPT {
+    return spdlog::string_view_t{buf.data(), buf.size()};
+}
+
+SPDLOG_CONSTEXPR_FUNC spdlog::string_view_t to_string_view(spdlog::string_view_t str)
+    SPDLOG_NOEXCEPT {
+    return str;
+}
+
+#if defined(SPDLOG_WCHAR_FILENAMES) || defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT)
+SPDLOG_CONSTEXPR_FUNC spdlog::wstring_view_t to_string_view(const wmemory_buf_t &buf)
+    SPDLOG_NOEXCEPT {
+    return spdlog::wstring_view_t{buf.data(), buf.size()};
+}
+
+SPDLOG_CONSTEXPR_FUNC spdlog::wstring_view_t to_string_view(spdlog::wstring_view_t str)
+    SPDLOG_NOEXCEPT {
+    return str;
+}
+#endif
+
+#ifndef SPDLOG_USE_STD_FORMAT
+template <typename T, typename... Args>
+inline fmt::basic_string_view<T> to_string_view(fmt::basic_format_string<T, Args...> fmt) {
+    return fmt;
+}
+#elif __cpp_lib_format >= 202207L
+template <typename T, typename... Args>
+SPDLOG_CONSTEXPR_FUNC std::basic_string_view<T> to_string_view(
+    std::basic_format_string<T, Args...> fmt) SPDLOG_NOEXCEPT {
+    return fmt.get();
+}
+#endif
+
+// make_unique support for pre c++14
+#if __cplusplus >= 201402L  // C++14 and beyond
+using std::enable_if_t;
+using std::make_unique;
+#else
+template <bool B, class T = void>
+using enable_if_t = typename std::enable_if<B, T>::type;
+
+template <typename T, typename... Args>
+std::unique_ptr<T> make_unique(Args &&...args) {
+    static_assert(!std::is_array<T>::value, "arrays not supported");
+    return std::unique_ptr<T>(new T(std::forward<Args>(args)...));
+}
+#endif
+
+// to avoid useless casts (see https://github.com/nlohmann/json/issues/2893#issuecomment-889152324)
+template <typename T, typename U, enable_if_t<!std::is_same<T, U>::value, int> = 0>
+constexpr T conditional_static_cast(U value) {
+    return static_cast<T>(value);
+}
+
+template <typename T, typename U, enable_if_t<std::is_same<T, U>::value, int> = 0>
+constexpr T conditional_static_cast(U value) {
+    return value;
+}
+
+}  // namespace details
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "common-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/backtracer-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/backtracer-inl.h
new file mode 100644
index 0000000000..43d1002478
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/backtracer-inl.h
@@ -0,0 +1,63 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/details/backtracer.h>
+#endif
+namespace spdlog {
+namespace details {
+SPDLOG_INLINE backtracer::backtracer(const backtracer &other) {
+    std::lock_guard<std::mutex> lock(other.mutex_);
+    enabled_ = other.enabled();
+    messages_ = other.messages_;
+}
+
+SPDLOG_INLINE backtracer::backtracer(backtracer &&other) SPDLOG_NOEXCEPT {
+    std::lock_guard<std::mutex> lock(other.mutex_);
+    enabled_ = other.enabled();
+    messages_ = std::move(other.messages_);
+}
+
+SPDLOG_INLINE backtracer &backtracer::operator=(backtracer other) {
+    std::lock_guard<std::mutex> lock(mutex_);
+    enabled_ = other.enabled();
+    messages_ = std::move(other.messages_);
+    return *this;
+}
+
+SPDLOG_INLINE void backtracer::enable(size_t size) {
+    std::lock_guard<std::mutex> lock{mutex_};
+    enabled_.store(true, std::memory_order_relaxed);
+    messages_ = circular_q<log_msg_buffer>{size};
+}
+
+SPDLOG_INLINE void backtracer::disable() {
+    std::lock_guard<std::mutex> lock{mutex_};
+    enabled_.store(false, std::memory_order_relaxed);
+}
+
+SPDLOG_INLINE bool backtracer::enabled() const { return enabled_.load(std::memory_order_relaxed); }
+
+SPDLOG_INLINE void backtracer::push_back(const log_msg &msg) {
+    std::lock_guard<std::mutex> lock{mutex_};
+    messages_.push_back(log_msg_buffer{msg});
+}
+
+SPDLOG_INLINE bool backtracer::empty() const {
+    std::lock_guard<std::mutex> lock{mutex_};
+    return messages_.empty();
+}
+
+// pop all items in the q and apply the given fun on each of them.
+SPDLOG_INLINE void backtracer::foreach_pop(std::function<void(const details::log_msg &)> fun) {
+    std::lock_guard<std::mutex> lock{mutex_};
+    while (!messages_.empty()) {
+        auto &front_msg = messages_.front();
+        fun(front_msg);
+        messages_.pop_front();
+    }
+}
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/backtracer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/backtracer.h
new file mode 100644
index 0000000000..541339cdc3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/backtracer.h
@@ -0,0 +1,45 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/circular_q.h>
+#include <spdlog/details/log_msg_buffer.h>
+
+#include <atomic>
+#include <functional>
+#include <mutex>
+
+// Store log messages in circular buffer.
+// Useful for storing debug data in case of error/warning happens.
+
+namespace spdlog {
+namespace details {
+class SPDLOG_API backtracer {
+    mutable std::mutex mutex_;
+    std::atomic<bool> enabled_{false};
+    circular_q<log_msg_buffer> messages_;
+
+public:
+    backtracer() = default;
+    backtracer(const backtracer &other);
+
+    backtracer(backtracer &&other) SPDLOG_NOEXCEPT;
+    backtracer &operator=(backtracer other);
+
+    void enable(size_t size);
+    void disable();
+    bool enabled() const;
+    void push_back(const log_msg &msg);
+    bool empty() const;
+
+    // pop all items in the q and apply the given fun on each of them.
+    void foreach_pop(std::function<void(const details::log_msg &)> fun);
+};
+
+}  // namespace details
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "backtracer-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/circular_q.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/circular_q.h
new file mode 100644
index 0000000000..ab068dff9e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/circular_q.h
@@ -0,0 +1,113 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+// circular q view of std::vector.
+#pragma once
+
+#include <cassert>
+#include <vector>
+
+namespace spdlog {
+namespace details {
+template <typename T>
+class circular_q {
+    size_t max_items_ = 0;
+    typename std::vector<T>::size_type head_ = 0;
+    typename std::vector<T>::size_type tail_ = 0;
+    size_t overrun_counter_ = 0;
+    std::vector<T> v_;
+
+public:
+    using value_type = T;
+
+    // empty ctor - create a disabled queue with no elements allocated at all
+    circular_q() = default;
+
+    explicit circular_q(size_t max_items)
+        : max_items_(max_items + 1)  // one item is reserved as marker for full q
+          ,
+          v_(max_items_) {}
+
+    circular_q(const circular_q &) = default;
+    circular_q &operator=(const circular_q &) = default;
+
+    // move cannot be default,
+    // since we need to reset head_, tail_, etc to zero in the moved object
+    circular_q(circular_q &&other) SPDLOG_NOEXCEPT { copy_moveable(std::move(other)); }
+
+    circular_q &operator=(circular_q &&other) SPDLOG_NOEXCEPT {
+        copy_moveable(std::move(other));
+        return *this;
+    }
+
+    // push back, overrun (oldest) item if no room left
+    void push_back(T &&item) {
+        if (max_items_ > 0) {
+            v_[tail_] = std::move(item);
+            tail_ = (tail_ + 1) % max_items_;
+
+            if (tail_ == head_)  // overrun last item if full
+            {
+                head_ = (head_ + 1) % max_items_;
+                ++overrun_counter_;
+            }
+        }
+    }
+
+    // Return reference to the front item.
+    // If there are no elements in the container, the behavior is undefined.
+    const T &front() const { return v_[head_]; }
+
+    T &front() { return v_[head_]; }
+
+    // Return number of elements actually stored
+    size_t size() const {
+        if (tail_ >= head_) {
+            return tail_ - head_;
+        } else {
+            return max_items_ - (head_ - tail_);
+        }
+    }
+
+    // Return const reference to item by index.
+    // If index is out of range 0…size()-1, the behavior is undefined.
+    const T &at(size_t i) const {
+        assert(i < size());
+        return v_[(head_ + i) % max_items_];
+    }
+
+    // Pop item from front.
+    // If there are no elements in the container, the behavior is undefined.
+    void pop_front() { head_ = (head_ + 1) % max_items_; }
+
+    bool empty() const { return tail_ == head_; }
+
+    bool full() const {
+        // head is ahead of the tail by 1
+        if (max_items_ > 0) {
+            return ((tail_ + 1) % max_items_) == head_;
+        }
+        return false;
+    }
+
+    size_t overrun_counter() const { return overrun_counter_; }
+
+    void reset_overrun_counter() { overrun_counter_ = 0; }
+
+private:
+    // copy from other&& and reset it to disabled state
+    void copy_moveable(circular_q &&other) SPDLOG_NOEXCEPT {
+        max_items_ = other.max_items_;
+        head_ = other.head_;
+        tail_ = other.tail_;
+        overrun_counter_ = other.overrun_counter_;
+        v_ = std::move(other.v_);
+
+        // put &&other in disabled, but valid state
+        other.max_items_ = 0;
+        other.head_ = other.tail_ = 0;
+        other.overrun_counter_ = 0;
+    }
+};
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/console_globals.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/console_globals.h
new file mode 100644
index 0000000000..9c552106a4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/console_globals.h
@@ -0,0 +1,28 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <mutex>
+#include <spdlog/details/null_mutex.h>
+
+namespace spdlog {
+namespace details {
+
+struct console_mutex {
+    using mutex_t = std::mutex;
+    static mutex_t &mutex() {
+        static mutex_t s_mutex;
+        return s_mutex;
+    }
+};
+
+struct console_nullmutex {
+    using mutex_t = null_mutex;
+    static mutex_t &mutex() {
+        static mutex_t s_mutex;
+        return s_mutex;
+    }
+};
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/file_helper-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/file_helper-inl.h
new file mode 100644
index 0000000000..69af9b6a3c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/file_helper-inl.h
@@ -0,0 +1,152 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/details/file_helper.h>
+#endif
+
+#include <spdlog/common.h>
+#include <spdlog/details/os.h>
+
+#include <cerrno>
+#include <chrono>
+#include <cstdio>
+#include <string>
+#include <thread>
+#include <tuple>
+
+namespace spdlog {
+namespace details {
+
+SPDLOG_INLINE file_helper::file_helper(const file_event_handlers &event_handlers)
+    : event_handlers_(event_handlers) {}
+
+SPDLOG_INLINE file_helper::~file_helper() { close(); }
+
+SPDLOG_INLINE void file_helper::open(const filename_t &fname, bool truncate) {
+    close();
+    filename_ = fname;
+
+    auto *mode = SPDLOG_FILENAME_T("ab");
+    auto *trunc_mode = SPDLOG_FILENAME_T("wb");
+
+    if (event_handlers_.before_open) {
+        event_handlers_.before_open(filename_);
+    }
+    for (int tries = 0; tries < open_tries_; ++tries) {
+        // create containing folder if not exists already.
+        os::create_dir(os::dir_name(fname));
+        if (truncate) {
+            // Truncate by opening-and-closing a tmp file in "wb" mode, always
+            // opening the actual log-we-write-to in "ab" mode, since that
+            // interacts more politely with eternal processes that might
+            // rotate/truncate the file underneath us.
+            std::FILE *tmp;
+            if (os::fopen_s(&tmp, fname, trunc_mode)) {
+                continue;
+            }
+            std::fclose(tmp);
+        }
+        if (!os::fopen_s(&fd_, fname, mode)) {
+            if (event_handlers_.after_open) {
+                event_handlers_.after_open(filename_, fd_);
+            }
+            return;
+        }
+
+        details::os::sleep_for_millis(open_interval_);
+    }
+
+    throw_spdlog_ex("Failed opening file " + os::filename_to_str(filename_) + " for writing",
+                    errno);
+}
+
+SPDLOG_INLINE void file_helper::reopen(bool truncate) {
+    if (filename_.empty()) {
+        throw_spdlog_ex("Failed re opening file - was not opened before");
+    }
+    this->open(filename_, truncate);
+}
+
+SPDLOG_INLINE void file_helper::flush() {
+    if (std::fflush(fd_) != 0) {
+        throw_spdlog_ex("Failed flush to file " + os::filename_to_str(filename_), errno);
+    }
+}
+
+SPDLOG_INLINE void file_helper::sync() {
+    if (!os::fsync(fd_)) {
+        throw_spdlog_ex("Failed to fsync file " + os::filename_to_str(filename_), errno);
+    }
+}
+
+SPDLOG_INLINE void file_helper::close() {
+    if (fd_ != nullptr) {
+        if (event_handlers_.before_close) {
+            event_handlers_.before_close(filename_, fd_);
+        }
+
+        std::fclose(fd_);
+        fd_ = nullptr;
+
+        if (event_handlers_.after_close) {
+            event_handlers_.after_close(filename_);
+        }
+    }
+}
+
+SPDLOG_INLINE void file_helper::write(const memory_buf_t &buf) {
+    if(fd_ == nullptr) return;
+    size_t msg_size = buf.size();
+    auto data = buf.data();
+    if (std::fwrite(data, 1, msg_size, fd_) != msg_size) {
+        throw_spdlog_ex("Failed writing to file " + os::filename_to_str(filename_), errno);
+    }
+}
+
+SPDLOG_INLINE size_t file_helper::size() const {
+    if (fd_ == nullptr) {
+        throw_spdlog_ex("Cannot use size() on closed file " + os::filename_to_str(filename_));
+    }
+    return os::filesize(fd_);
+}
+
+SPDLOG_INLINE const filename_t &file_helper::filename() const { return filename_; }
+
+//
+// return file path and its extension:
+//
+// "mylog.txt" => ("mylog", ".txt")
+// "mylog" => ("mylog", "")
+// "mylog." => ("mylog.", "")
+// "/dir1/dir2/mylog.txt" => ("/dir1/dir2/mylog", ".txt")
+//
+// the starting dot in filenames is ignored (hidden files):
+//
+// ".mylog" => (".mylog". "")
+// "my_folder/.mylog" => ("my_folder/.mylog", "")
+// "my_folder/.mylog.txt" => ("my_folder/.mylog", ".txt")
+SPDLOG_INLINE std::tuple<filename_t, filename_t> file_helper::split_by_extension(
+    const filename_t &fname) {
+    auto ext_index = fname.rfind('.');
+
+    // no valid extension found - return whole path and empty string as
+    // extension
+    if (ext_index == filename_t::npos || ext_index == 0 || ext_index == fname.size() - 1) {
+        return std::make_tuple(fname, filename_t());
+    }
+
+    // treat cases like "/etc/rc.d/somelogfile or "/abc/.hiddenfile"
+    auto folder_index = fname.find_last_of(details::os::folder_seps_filename);
+    if (folder_index != filename_t::npos && folder_index >= ext_index - 1) {
+        return std::make_tuple(fname, filename_t());
+    }
+
+    // finally - return a valid base and extension tuple
+    return std::make_tuple(fname.substr(0, ext_index), fname.substr(ext_index));
+}
+
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/file_helper.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/file_helper.h
new file mode 100644
index 0000000000..f0e5d180e3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/file_helper.h
@@ -0,0 +1,61 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <tuple>
+
+namespace spdlog {
+namespace details {
+
+// Helper class for file sinks.
+// When failing to open a file, retry several times(5) with a delay interval(10 ms).
+// Throw spdlog_ex exception on errors.
+
+class SPDLOG_API file_helper {
+public:
+    file_helper() = default;
+    explicit file_helper(const file_event_handlers &event_handlers);
+
+    file_helper(const file_helper &) = delete;
+    file_helper &operator=(const file_helper &) = delete;
+    ~file_helper();
+
+    void open(const filename_t &fname, bool truncate = false);
+    void reopen(bool truncate);
+    void flush();
+    void sync();
+    void close();
+    void write(const memory_buf_t &buf);
+    size_t size() const;
+    const filename_t &filename() const;
+
+    //
+    // return file path and its extension:
+    //
+    // "mylog.txt" => ("mylog", ".txt")
+    // "mylog" => ("mylog", "")
+    // "mylog." => ("mylog.", "")
+    // "/dir1/dir2/mylog.txt" => ("/dir1/dir2/mylog", ".txt")
+    //
+    // the starting dot in filenames is ignored (hidden files):
+    //
+    // ".mylog" => (".mylog". "")
+    // "my_folder/.mylog" => ("my_folder/.mylog", "")
+    // "my_folder/.mylog.txt" => ("my_folder/.mylog", ".txt")
+    static std::tuple<filename_t, filename_t> split_by_extension(const filename_t &fname);
+
+private:
+    const int open_tries_ = 5;
+    const unsigned int open_interval_ = 10;
+    std::FILE *fd_{nullptr};
+    filename_t filename_;
+    file_event_handlers event_handlers_;
+};
+}  // namespace details
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "file_helper-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/fmt_helper.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/fmt_helper.h
new file mode 100644
index 0000000000..a84f895bc2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/fmt_helper.h
@@ -0,0 +1,141 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+#pragma once
+
+#include <chrono>
+#include <iterator>
+#include <spdlog/common.h>
+#include <spdlog/fmt/fmt.h>
+#include <type_traits>
+
+#ifdef SPDLOG_USE_STD_FORMAT
+    #include <charconv>
+    #include <limits>
+#endif
+
+// Some fmt helpers to efficiently format and pad ints and strings
+namespace spdlog {
+namespace details {
+namespace fmt_helper {
+
+inline void append_string_view(spdlog::string_view_t view, memory_buf_t &dest) {
+    auto *buf_ptr = view.data();
+    dest.append(buf_ptr, buf_ptr + view.size());
+}
+
+#ifdef SPDLOG_USE_STD_FORMAT
+template <typename T>
+inline void append_int(T n, memory_buf_t &dest) {
+    // Buffer should be large enough to hold all digits (digits10 + 1) and a sign
+    SPDLOG_CONSTEXPR const auto BUF_SIZE = std::numeric_limits<T>::digits10 + 2;
+    char buf[BUF_SIZE];
+
+    auto [ptr, ec] = std::to_chars(buf, buf + BUF_SIZE, n, 10);
+    if (ec == std::errc()) {
+        dest.append(buf, ptr);
+    } else {
+        throw_spdlog_ex("Failed to format int", static_cast<int>(ec));
+    }
+}
+#else
+template <typename T>
+inline void append_int(T n, memory_buf_t &dest) {
+    fmt::format_int i(n);
+    dest.append(i.data(), i.data() + i.size());
+}
+#endif
+
+template <typename T>
+SPDLOG_CONSTEXPR_FUNC unsigned int count_digits_fallback(T n) {
+    // taken from fmt: https://github.com/fmtlib/fmt/blob/8.0.1/include/fmt/format.h#L899-L912
+    unsigned int count = 1;
+    for (;;) {
+        // Integer division is slow so do it for a group of four digits instead
+        // of for every digit. The idea comes from the talk by Alexandrescu
+        // "Three Optimization Tips for C++". See speed-test for a comparison.
+        if (n < 10) return count;
+        if (n < 100) return count + 1;
+        if (n < 1000) return count + 2;
+        if (n < 10000) return count + 3;
+        n /= 10000u;
+        count += 4;
+    }
+}
+
+template <typename T>
+inline unsigned int count_digits(T n) {
+    using count_type =
+        typename std::conditional<(sizeof(T) > sizeof(uint32_t)), uint64_t, uint32_t>::type;
+#ifdef SPDLOG_USE_STD_FORMAT
+    return count_digits_fallback(static_cast<count_type>(n));
+#else
+    return static_cast<unsigned int>(fmt::
+    // fmt 7.0.0 renamed the internal namespace to detail.
+    // See: https://github.com/fmtlib/fmt/issues/1538
+    #if FMT_VERSION < 70000
+                                         internal
+    #else
+                                         detail
+    #endif
+                                     ::count_digits(static_cast<count_type>(n)));
+#endif
+}
+
+inline void pad2(int n, memory_buf_t &dest) {
+    if (n >= 0 && n < 100)  // 0-99
+    {
+        dest.push_back(static_cast<char>('0' + n / 10));
+        dest.push_back(static_cast<char>('0' + n % 10));
+    } else  // unlikely, but just in case, let fmt deal with it
+    {
+        fmt_lib::format_to(std::back_inserter(dest), "{:02}", n);
+    }
+}
+
+template <typename T>
+inline void pad_uint(T n, unsigned int width, memory_buf_t &dest) {
+    static_assert(std::is_unsigned<T>::value, "pad_uint must get unsigned T");
+    for (auto digits = count_digits(n); digits < width; digits++) {
+        dest.push_back('0');
+    }
+    append_int(n, dest);
+}
+
+template <typename T>
+inline void pad3(T n, memory_buf_t &dest) {
+    static_assert(std::is_unsigned<T>::value, "pad3 must get unsigned T");
+    if (n < 1000) {
+        dest.push_back(static_cast<char>(n / 100 + '0'));
+        n = n % 100;
+        dest.push_back(static_cast<char>((n / 10) + '0'));
+        dest.push_back(static_cast<char>((n % 10) + '0'));
+    } else {
+        append_int(n, dest);
+    }
+}
+
+template <typename T>
+inline void pad6(T n, memory_buf_t &dest) {
+    pad_uint(n, 6, dest);
+}
+
+template <typename T>
+inline void pad9(T n, memory_buf_t &dest) {
+    pad_uint(n, 9, dest);
+}
+
+// return fraction of a second of the given time_point.
+// e.g.
+// fraction<std::milliseconds>(tp) -> will return the millis part of the second
+template <typename ToDuration>
+inline ToDuration time_fraction(log_clock::time_point tp) {
+    using std::chrono::duration_cast;
+    using std::chrono::seconds;
+    auto duration = tp.time_since_epoch();
+    auto secs = duration_cast<seconds>(duration);
+    return duration_cast<ToDuration>(duration) - duration_cast<ToDuration>(secs);
+}
+
+}  // namespace fmt_helper
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg-inl.h
new file mode 100644
index 0000000000..aa3a957682
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg-inl.h
@@ -0,0 +1,44 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/details/log_msg.h>
+#endif
+
+#include <spdlog/details/os.h>
+
+namespace spdlog {
+namespace details {
+
+SPDLOG_INLINE log_msg::log_msg(spdlog::log_clock::time_point log_time,
+                               spdlog::source_loc loc,
+                               string_view_t a_logger_name,
+                               spdlog::level::level_enum lvl,
+                               spdlog::string_view_t msg)
+    : logger_name(a_logger_name),
+      level(lvl),
+      time(log_time)
+#ifndef SPDLOG_NO_THREAD_ID
+      ,
+      thread_id(os::thread_id())
+#endif
+      ,
+      source(loc),
+      payload(msg) {
+}
+
+SPDLOG_INLINE log_msg::log_msg(spdlog::source_loc loc,
+                               string_view_t a_logger_name,
+                               spdlog::level::level_enum lvl,
+                               spdlog::string_view_t msg)
+    : log_msg(os::now(), loc, a_logger_name, lvl, msg) {}
+
+SPDLOG_INLINE log_msg::log_msg(string_view_t a_logger_name,
+                               spdlog::level::level_enum lvl,
+                               spdlog::string_view_t msg)
+    : log_msg(os::now(), source_loc{}, a_logger_name, lvl, msg) {}
+
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg.h
new file mode 100644
index 0000000000..87df1e8332
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg.h
@@ -0,0 +1,40 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <string>
+
+namespace spdlog {
+namespace details {
+struct SPDLOG_API log_msg {
+    log_msg() = default;
+    log_msg(log_clock::time_point log_time,
+            source_loc loc,
+            string_view_t logger_name,
+            level::level_enum lvl,
+            string_view_t msg);
+    log_msg(source_loc loc, string_view_t logger_name, level::level_enum lvl, string_view_t msg);
+    log_msg(string_view_t logger_name, level::level_enum lvl, string_view_t msg);
+    log_msg(const log_msg &other) = default;
+    log_msg &operator=(const log_msg &other) = default;
+
+    string_view_t logger_name;
+    level::level_enum level{level::off};
+    log_clock::time_point time;
+    size_t thread_id{0};
+
+    // wrapping the formatted text with color (updated by pattern_formatter).
+    mutable size_t color_range_start{0};
+    mutable size_t color_range_end{0};
+
+    source_loc source;
+    string_view_t payload;
+};
+}  // namespace details
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "log_msg-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg_buffer-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg_buffer-inl.h
new file mode 100644
index 0000000000..2eb242859e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg_buffer-inl.h
@@ -0,0 +1,54 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/details/log_msg_buffer.h>
+#endif
+
+namespace spdlog {
+namespace details {
+
+SPDLOG_INLINE log_msg_buffer::log_msg_buffer(const log_msg &orig_msg)
+    : log_msg{orig_msg} {
+    buffer.append(logger_name.begin(), logger_name.end());
+    buffer.append(payload.begin(), payload.end());
+    update_string_views();
+}
+
+SPDLOG_INLINE log_msg_buffer::log_msg_buffer(const log_msg_buffer &other)
+    : log_msg{other} {
+    buffer.append(logger_name.begin(), logger_name.end());
+    buffer.append(payload.begin(), payload.end());
+    update_string_views();
+}
+
+SPDLOG_INLINE log_msg_buffer::log_msg_buffer(log_msg_buffer &&other) SPDLOG_NOEXCEPT
+    : log_msg{other},
+      buffer{std::move(other.buffer)} {
+    update_string_views();
+}
+
+SPDLOG_INLINE log_msg_buffer &log_msg_buffer::operator=(const log_msg_buffer &other) {
+    log_msg::operator=(other);
+    buffer.clear();
+    buffer.append(other.buffer.data(), other.buffer.data() + other.buffer.size());
+    update_string_views();
+    return *this;
+}
+
+SPDLOG_INLINE log_msg_buffer &log_msg_buffer::operator=(log_msg_buffer &&other) SPDLOG_NOEXCEPT {
+    log_msg::operator=(other);
+    buffer = std::move(other.buffer);
+    update_string_views();
+    return *this;
+}
+
+SPDLOG_INLINE void log_msg_buffer::update_string_views() {
+    logger_name = string_view_t{buffer.data(), logger_name.size()};
+    payload = string_view_t{buffer.data() + logger_name.size(), payload.size()};
+}
+
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg_buffer.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg_buffer.h
new file mode 100644
index 0000000000..1143b3ba45
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/log_msg_buffer.h
@@ -0,0 +1,32 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/log_msg.h>
+
+namespace spdlog {
+namespace details {
+
+// Extend log_msg with internal buffer to store its payload.
+// This is needed since log_msg holds string_views that points to stack data.
+
+class SPDLOG_API log_msg_buffer : public log_msg {
+    memory_buf_t buffer;
+    void update_string_views();
+
+public:
+    log_msg_buffer() = default;
+    explicit log_msg_buffer(const log_msg &orig_msg);
+    log_msg_buffer(const log_msg_buffer &other);
+    log_msg_buffer(log_msg_buffer &&other) SPDLOG_NOEXCEPT;
+    log_msg_buffer &operator=(const log_msg_buffer &other);
+    log_msg_buffer &operator=(log_msg_buffer &&other) SPDLOG_NOEXCEPT;
+};
+
+}  // namespace details
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "log_msg_buffer-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/mpmc_blocking_q.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/mpmc_blocking_q.h
new file mode 100644
index 0000000000..5a474bf33a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/mpmc_blocking_q.h
@@ -0,0 +1,177 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+// multi producer-multi consumer blocking queue.
+// enqueue(..) - will block until room found to put the new message.
+// enqueue_nowait(..) - will return immediately with false if no room left in
+// the queue.
+// dequeue_for(..) - will block until the queue is not empty or timeout have
+// passed.
+
+#include <spdlog/details/circular_q.h>
+
+#include <atomic>
+#include <condition_variable>
+#include <mutex>
+
+namespace spdlog {
+namespace details {
+
+template <typename T>
+class mpmc_blocking_queue {
+public:
+    using item_type = T;
+    explicit mpmc_blocking_queue(size_t max_items)
+        : q_(max_items) {}
+
+#ifndef __MINGW32__
+    // try to enqueue and block if no room left
+    void enqueue(T &&item) {
+        {
+            std::unique_lock<std::mutex> lock(queue_mutex_);
+            pop_cv_.wait(lock, [this] { return !this->q_.full(); });
+            q_.push_back(std::move(item));
+        }
+        push_cv_.notify_one();
+    }
+
+    // enqueue immediately. overrun oldest message in the queue if no room left.
+    void enqueue_nowait(T &&item) {
+        {
+            std::unique_lock<std::mutex> lock(queue_mutex_);
+            q_.push_back(std::move(item));
+        }
+        push_cv_.notify_one();
+    }
+
+    void enqueue_if_have_room(T &&item) {
+        bool pushed = false;
+        {
+            std::unique_lock<std::mutex> lock(queue_mutex_);
+            if (!q_.full()) {
+                q_.push_back(std::move(item));
+                pushed = true;
+            }
+        }
+
+        if (pushed) {
+            push_cv_.notify_one();
+        } else {
+            ++discard_counter_;
+        }
+    }
+
+    // dequeue with a timeout.
+    // Return true, if succeeded dequeue item, false otherwise
+    bool dequeue_for(T &popped_item, std::chrono::milliseconds wait_duration) {
+        {
+            std::unique_lock<std::mutex> lock(queue_mutex_);
+            if (!push_cv_.wait_for(lock, wait_duration, [this] { return !this->q_.empty(); })) {
+                return false;
+            }
+            popped_item = std::move(q_.front());
+            q_.pop_front();
+        }
+        pop_cv_.notify_one();
+        return true;
+    }
+
+    // blocking dequeue without a timeout.
+    void dequeue(T &popped_item) {
+        {
+            std::unique_lock<std::mutex> lock(queue_mutex_);
+            push_cv_.wait(lock, [this] { return !this->q_.empty(); });
+            popped_item = std::move(q_.front());
+            q_.pop_front();
+        }
+        pop_cv_.notify_one();
+    }
+
+#else
+    // apparently mingw deadlocks if the mutex is released before cv.notify_one(),
+    // so release the mutex at the very end each function.
+
+    // try to enqueue and block if no room left
+    void enqueue(T &&item) {
+        std::unique_lock<std::mutex> lock(queue_mutex_);
+        pop_cv_.wait(lock, [this] { return !this->q_.full(); });
+        q_.push_back(std::move(item));
+        push_cv_.notify_one();
+    }
+
+    // enqueue immediately. overrun oldest message in the queue if no room left.
+    void enqueue_nowait(T &&item) {
+        std::unique_lock<std::mutex> lock(queue_mutex_);
+        q_.push_back(std::move(item));
+        push_cv_.notify_one();
+    }
+
+    void enqueue_if_have_room(T &&item) {
+        bool pushed = false;
+        std::unique_lock<std::mutex> lock(queue_mutex_);
+        if (!q_.full()) {
+            q_.push_back(std::move(item));
+            pushed = true;
+        }
+
+        if (pushed) {
+            push_cv_.notify_one();
+        } else {
+            ++discard_counter_;
+        }
+    }
+
+    // dequeue with a timeout.
+    // Return true, if succeeded dequeue item, false otherwise
+    bool dequeue_for(T &popped_item, std::chrono::milliseconds wait_duration) {
+        std::unique_lock<std::mutex> lock(queue_mutex_);
+        if (!push_cv_.wait_for(lock, wait_duration, [this] { return !this->q_.empty(); })) {
+            return false;
+        }
+        popped_item = std::move(q_.front());
+        q_.pop_front();
+        pop_cv_.notify_one();
+        return true;
+    }
+
+    // blocking dequeue without a timeout.
+    void dequeue(T &popped_item) {
+        std::unique_lock<std::mutex> lock(queue_mutex_);
+        push_cv_.wait(lock, [this] { return !this->q_.empty(); });
+        popped_item = std::move(q_.front());
+        q_.pop_front();
+        pop_cv_.notify_one();
+    }
+
+#endif
+
+    size_t overrun_counter() {
+        std::unique_lock<std::mutex> lock(queue_mutex_);
+        return q_.overrun_counter();
+    }
+
+    size_t discard_counter() { return discard_counter_.load(std::memory_order_relaxed); }
+
+    size_t size() {
+        std::unique_lock<std::mutex> lock(queue_mutex_);
+        return q_.size();
+    }
+
+    void reset_overrun_counter() {
+        std::unique_lock<std::mutex> lock(queue_mutex_);
+        q_.reset_overrun_counter();
+    }
+
+    void reset_discard_counter() { discard_counter_.store(0, std::memory_order_relaxed); }
+
+private:
+    std::mutex queue_mutex_;
+    std::condition_variable push_cv_;
+    std::condition_variable pop_cv_;
+    spdlog::details::circular_q<T> q_;
+    std::atomic<size_t> discard_counter_{0};
+};
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/null_mutex.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/null_mutex.h
new file mode 100644
index 0000000000..e3b3220415
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/null_mutex.h
@@ -0,0 +1,35 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <atomic>
+#include <utility>
+// null, no cost dummy "mutex" and dummy "atomic" int
+
+namespace spdlog {
+namespace details {
+struct null_mutex {
+    void lock() const {}
+    void unlock() const {}
+};
+
+struct null_atomic_int {
+    int value;
+    null_atomic_int() = default;
+
+    explicit null_atomic_int(int new_value)
+        : value(new_value) {}
+
+    int load(std::memory_order = std::memory_order_relaxed) const { return value; }
+
+    void store(int new_value, std::memory_order = std::memory_order_relaxed) { value = new_value; }
+
+    int exchange(int new_value, std::memory_order = std::memory_order_relaxed) {
+        std::swap(new_value, value);
+        return new_value;  // return value before the call
+    }
+};
+
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/os-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/os-inl.h
new file mode 100644
index 0000000000..8fb2c7bca8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/os-inl.h
@@ -0,0 +1,585 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/details/os.h>
+#endif
+
+#include <spdlog/common.h>
+
+#include <algorithm>
+#include <array>
+#include <chrono>
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+#include <ctime>
+#include <string>
+#include <sys/stat.h>
+#include <sys/types.h>
+#include <thread>
+
+#ifdef _WIN32
+    #include <spdlog/details/windows_include.h>
+    #include <fileapi.h>  // for FlushFileBuffers
+    #include <io.h>       // for _get_osfhandle, _isatty, _fileno
+    #include <process.h>  // for _get_pid
+
+    #ifdef __MINGW32__
+        #include <share.h>
+    #endif
+
+    #if defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT) || defined(SPDLOG_WCHAR_FILENAMES)
+        #include <cassert>
+        #include <limits>
+    #endif
+
+    #include <direct.h>  // for _mkdir/_wmkdir
+
+#else  // unix
+
+    #include <fcntl.h>
+    #include <unistd.h>
+
+    #ifdef __linux__
+        #include <sys/syscall.h>  //Use gettid() syscall under linux to get thread id
+
+    #elif defined(_AIX)
+        #include <pthread.h>  // for pthread_getthrds_np
+
+    #elif defined(__DragonFly__) || defined(__FreeBSD__)
+        #include <pthread_np.h>  // for pthread_getthreadid_np
+
+    #elif defined(__NetBSD__)
+        #include <lwp.h>  // for _lwp_self
+
+    #elif defined(__sun)
+        #include <thread.h>  // for thr_self
+    #endif
+
+#endif  // unix
+
+#if defined __APPLE__
+    #include <AvailabilityMacros.h>
+#endif
+
+#ifndef __has_feature           // Clang - feature checking macros.
+    #define __has_feature(x) 0  // Compatibility with non-clang compilers.
+#endif
+
+namespace spdlog {
+namespace details {
+namespace os {
+
+SPDLOG_INLINE spdlog::log_clock::time_point now() SPDLOG_NOEXCEPT {
+#if defined __linux__ && defined SPDLOG_CLOCK_COARSE
+    timespec ts;
+    ::clock_gettime(CLOCK_REALTIME_COARSE, &ts);
+    return std::chrono::time_point<log_clock, typename log_clock::duration>(
+        std::chrono::duration_cast<typename log_clock::duration>(
+            std::chrono::seconds(ts.tv_sec) + std::chrono::nanoseconds(ts.tv_nsec)));
+
+#else
+    return log_clock::now();
+#endif
+}
+SPDLOG_INLINE std::tm localtime(const std::time_t &time_tt) SPDLOG_NOEXCEPT {
+#ifdef _WIN32
+    std::tm tm;
+    ::localtime_s(&tm, &time_tt);
+#else
+    std::tm tm;
+    ::localtime_r(&time_tt, &tm);
+#endif
+    return tm;
+}
+
+SPDLOG_INLINE std::tm localtime() SPDLOG_NOEXCEPT {
+    std::time_t now_t = ::time(nullptr);
+    return localtime(now_t);
+}
+
+SPDLOG_INLINE std::tm gmtime(const std::time_t &time_tt) SPDLOG_NOEXCEPT {
+#ifdef _WIN32
+    std::tm tm;
+    ::gmtime_s(&tm, &time_tt);
+#else
+    std::tm tm;
+    ::gmtime_r(&time_tt, &tm);
+#endif
+    return tm;
+}
+
+SPDLOG_INLINE std::tm gmtime() SPDLOG_NOEXCEPT {
+    std::time_t now_t = ::time(nullptr);
+    return gmtime(now_t);
+}
+
+// fopen_s on non windows for writing
+SPDLOG_INLINE bool fopen_s(FILE **fp, const filename_t &filename, const filename_t &mode) {
+#ifdef _WIN32
+    #ifdef SPDLOG_WCHAR_FILENAMES
+    *fp = ::_wfsopen((filename.c_str()), mode.c_str(), _SH_DENYNO);
+    #else
+    *fp = ::_fsopen((filename.c_str()), mode.c_str(), _SH_DENYNO);
+    #endif
+    #if defined(SPDLOG_PREVENT_CHILD_FD)
+    if (*fp != nullptr) {
+        auto file_handle = reinterpret_cast<HANDLE>(_get_osfhandle(::_fileno(*fp)));
+        if (!::SetHandleInformation(file_handle, HANDLE_FLAG_INHERIT, 0)) {
+            ::fclose(*fp);
+            *fp = nullptr;
+        }
+    }
+    #endif
+#else  // unix
+    #if defined(SPDLOG_PREVENT_CHILD_FD)
+    const int mode_flag = mode == SPDLOG_FILENAME_T("ab") ? O_APPEND : O_TRUNC;
+    const int fd =
+        ::open((filename.c_str()), O_CREAT | O_WRONLY | O_CLOEXEC | mode_flag, mode_t(0644));
+    if (fd == -1) {
+        return true;
+    }
+    *fp = ::fdopen(fd, mode.c_str());
+    if (*fp == nullptr) {
+        ::close(fd);
+    }
+    #else
+    *fp = ::fopen((filename.c_str()), mode.c_str());
+    #endif
+#endif
+
+    return *fp == nullptr;
+}
+
+SPDLOG_INLINE int remove(const filename_t &filename) SPDLOG_NOEXCEPT {
+#if defined(_WIN32) && defined(SPDLOG_WCHAR_FILENAMES)
+    return ::_wremove(filename.c_str());
+#else
+    return std::remove(filename.c_str());
+#endif
+}
+
+SPDLOG_INLINE int remove_if_exists(const filename_t &filename) SPDLOG_NOEXCEPT {
+    return path_exists(filename) ? remove(filename) : 0;
+}
+
+SPDLOG_INLINE int rename(const filename_t &filename1, const filename_t &filename2) SPDLOG_NOEXCEPT {
+#if defined(_WIN32) && defined(SPDLOG_WCHAR_FILENAMES)
+    return ::_wrename(filename1.c_str(), filename2.c_str());
+#else
+    return std::rename(filename1.c_str(), filename2.c_str());
+#endif
+}
+
+// Return true if path exists (file or directory)
+SPDLOG_INLINE bool path_exists(const filename_t &filename) SPDLOG_NOEXCEPT {
+#ifdef _WIN32
+    struct _stat buffer;
+    #ifdef SPDLOG_WCHAR_FILENAMES
+    return (::_wstat(filename.c_str(), &buffer) == 0);
+    #else
+    return (::_stat(filename.c_str(), &buffer) == 0);
+    #endif
+#else  // common linux/unix all have the stat system call
+    struct stat buffer;
+    return (::stat(filename.c_str(), &buffer) == 0);
+#endif
+}
+
+#ifdef _MSC_VER
+    // avoid warning about unreachable statement at the end of filesize()
+    #pragma warning(push)
+    #pragma warning(disable : 4702)
+#endif
+
+// Return file size according to open FILE* object
+SPDLOG_INLINE size_t filesize(FILE *f) {
+    if (f == nullptr) {
+        throw_spdlog_ex("Failed getting file size. fd is null");
+    }
+#if defined(_WIN32) && !defined(__CYGWIN__)
+    int fd = ::_fileno(f);
+    #if defined(_WIN64)  // 64 bits
+    __int64 ret = ::_filelengthi64(fd);
+    if (ret >= 0) {
+        return static_cast<size_t>(ret);
+    }
+
+    #else  // windows 32 bits
+    long ret = ::_filelength(fd);
+    if (ret >= 0) {
+        return static_cast<size_t>(ret);
+    }
+    #endif
+
+#else  // unix
+    // OpenBSD and AIX doesn't compile with :: before the fileno(..)
+    #if defined(__OpenBSD__) || defined(_AIX)
+    int fd = fileno(f);
+    #else
+    int fd = ::fileno(f);
+    #endif
+    // 64 bits(but not in osx, linux/musl or cygwin, where fstat64 is deprecated)
+    #if ((defined(__linux__) && defined(__GLIBC__)) || defined(__sun) || defined(_AIX)) && \
+        (defined(__LP64__) || defined(_LP64))
+    struct stat64 st;
+    if (::fstat64(fd, &st) == 0) {
+        return static_cast<size_t>(st.st_size);
+    }
+    #else  // other unix or linux 32 bits or cygwin
+    struct stat st;
+    if (::fstat(fd, &st) == 0) {
+        return static_cast<size_t>(st.st_size);
+    }
+    #endif
+#endif
+    throw_spdlog_ex("Failed getting file size from fd", errno);
+    return 0;  // will not be reached.
+}
+
+#ifdef _MSC_VER
+    #pragma warning(pop)
+#endif
+
+// Return utc offset in minutes or throw spdlog_ex on failure
+SPDLOG_INLINE int utc_minutes_offset(const std::tm &tm) {
+#ifdef _WIN32
+    #if _WIN32_WINNT < _WIN32_WINNT_WS08
+    TIME_ZONE_INFORMATION tzinfo;
+    auto rv = ::GetTimeZoneInformation(&tzinfo);
+    #else
+    DYNAMIC_TIME_ZONE_INFORMATION tzinfo;
+    auto rv = ::GetDynamicTimeZoneInformation(&tzinfo);
+    #endif
+    if (rv == TIME_ZONE_ID_INVALID) throw_spdlog_ex("Failed getting timezone info. ", errno);
+
+    int offset = -tzinfo.Bias;
+    if (tm.tm_isdst) {
+        offset -= tzinfo.DaylightBias;
+    } else {
+        offset -= tzinfo.StandardBias;
+    }
+    return offset;
+#else
+
+    #if defined(sun) || defined(__sun) || defined(_AIX) || \
+        (defined(__NEWLIB__) && !defined(__TM_GMTOFF)) ||  \
+        (!defined(_BSD_SOURCE) && !defined(_GNU_SOURCE))
+    // 'tm_gmtoff' field is BSD extension and it's missing on SunOS/Solaris
+    struct helper {
+        static long int calculate_gmt_offset(const std::tm &localtm = details::os::localtime(),
+                                             const std::tm &gmtm = details::os::gmtime()) {
+            int local_year = localtm.tm_year + (1900 - 1);
+            int gmt_year = gmtm.tm_year + (1900 - 1);
+
+            long int days = (
+                // difference in day of year
+                localtm.tm_yday -
+                gmtm.tm_yday
+
+                // + intervening leap days
+                + ((local_year >> 2) - (gmt_year >> 2)) - (local_year / 100 - gmt_year / 100) +
+                ((local_year / 100 >> 2) - (gmt_year / 100 >> 2))
+
+                // + difference in years * 365 */
+                + static_cast<long int>(local_year - gmt_year) * 365);
+
+            long int hours = (24 * days) + (localtm.tm_hour - gmtm.tm_hour);
+            long int mins = (60 * hours) + (localtm.tm_min - gmtm.tm_min);
+            long int secs = (60 * mins) + (localtm.tm_sec - gmtm.tm_sec);
+
+            return secs;
+        }
+    };
+
+    auto offset_seconds = helper::calculate_gmt_offset(tm);
+    #else
+    auto offset_seconds = tm.tm_gmtoff;
+    #endif
+
+    return static_cast<int>(offset_seconds / 60);
+#endif
+}
+
+// Return current thread id as size_t
+// It exists because the std::this_thread::get_id() is much slower(especially
+// under VS 2013)
+SPDLOG_INLINE size_t _thread_id() SPDLOG_NOEXCEPT {
+#ifdef _WIN32
+    return static_cast<size_t>(::GetCurrentThreadId());
+#elif defined(__linux__)
+    #if defined(__ANDROID__) && defined(__ANDROID_API__) && (__ANDROID_API__ < 21)
+        #define SYS_gettid __NR_gettid
+    #endif
+    return static_cast<size_t>(::syscall(SYS_gettid));
+#elif defined(_AIX)
+    struct __pthrdsinfo buf;
+    int reg_size = 0;
+    pthread_t pt = pthread_self();
+    int retval = pthread_getthrds_np(&pt, PTHRDSINFO_QUERY_TID, &buf, sizeof(buf), NULL, &reg_size);
+    int tid = (!retval) ? buf.__pi_tid : 0;
+    return static_cast<size_t>(tid);
+#elif defined(__DragonFly__) || defined(__FreeBSD__)
+    return static_cast<size_t>(::pthread_getthreadid_np());
+#elif defined(__NetBSD__)
+    return static_cast<size_t>(::_lwp_self());
+#elif defined(__OpenBSD__)
+    return static_cast<size_t>(::getthrid());
+#elif defined(__sun)
+    return static_cast<size_t>(::thr_self());
+#elif __APPLE__
+    uint64_t tid;
+    // There is no pthread_threadid_np prior to Mac OS X 10.6, and it is not supported on any PPC,
+    // including 10.6.8 Rosetta. __POWERPC__ is Apple-specific define encompassing ppc and ppc64.
+    #ifdef MAC_OS_X_VERSION_MAX_ALLOWED
+    {
+        #if (MAC_OS_X_VERSION_MAX_ALLOWED < 1060) || defined(__POWERPC__)
+        tid = pthread_mach_thread_np(pthread_self());
+        #elif MAC_OS_X_VERSION_MIN_REQUIRED < 1060
+        if (&pthread_threadid_np) {
+            pthread_threadid_np(nullptr, &tid);
+        } else {
+            tid = pthread_mach_thread_np(pthread_self());
+        }
+        #else
+        pthread_threadid_np(nullptr, &tid);
+        #endif
+    }
+    #else
+    pthread_threadid_np(nullptr, &tid);
+    #endif
+    return static_cast<size_t>(tid);
+#else  // Default to standard C++11 (other Unix)
+    return static_cast<size_t>(std::hash<std::thread::id>()(std::this_thread::get_id()));
+#endif
+}
+
+// Return current thread id as size_t (from thread local storage)
+SPDLOG_INLINE size_t thread_id() SPDLOG_NOEXCEPT {
+#if defined(SPDLOG_NO_TLS)
+    return _thread_id();
+#else  // cache thread id in tls
+    static thread_local const size_t tid = _thread_id();
+    return tid;
+#endif
+}
+
+// This is avoid msvc issue in sleep_for that happens if the clock changes.
+// See https://github.com/gabime/spdlog/issues/609
+SPDLOG_INLINE void sleep_for_millis(unsigned int milliseconds) SPDLOG_NOEXCEPT {
+#if defined(_WIN32)
+    ::Sleep(milliseconds);
+#else
+    std::this_thread::sleep_for(std::chrono::milliseconds(milliseconds));
+#endif
+}
+
+// wchar support for windows file names (SPDLOG_WCHAR_FILENAMES must be defined)
+#if defined(_WIN32) && defined(SPDLOG_WCHAR_FILENAMES)
+SPDLOG_INLINE std::string filename_to_str(const filename_t &filename) {
+    memory_buf_t buf;
+    wstr_to_utf8buf(filename, buf);
+    return SPDLOG_BUF_TO_STRING(buf);
+}
+#else
+SPDLOG_INLINE std::string filename_to_str(const filename_t &filename) { return filename; }
+#endif
+
+SPDLOG_INLINE int pid() SPDLOG_NOEXCEPT {
+#ifdef _WIN32
+    return conditional_static_cast<int>(::GetCurrentProcessId());
+#else
+    return conditional_static_cast<int>(::getpid());
+#endif
+}
+
+// Determine if the terminal supports colors
+// Based on: https://github.com/agauniyal/rang/
+SPDLOG_INLINE bool is_color_terminal() SPDLOG_NOEXCEPT {
+#ifdef _WIN32
+    return true;
+#else
+
+    static const bool result = []() {
+        const char *env_colorterm_p = std::getenv("COLORTERM");
+        if (env_colorterm_p != nullptr) {
+            return true;
+        }
+
+        static constexpr std::array<const char *, 16> terms = {
+            {"ansi", "color", "console", "cygwin", "gnome", "konsole", "kterm", "linux", "msys",
+             "putty", "rxvt", "screen", "vt100", "xterm", "alacritty", "vt102"}};
+
+        const char *env_term_p = std::getenv("TERM");
+        if (env_term_p == nullptr) {
+            return false;
+        }
+
+        return std::any_of(terms.begin(), terms.end(), [&](const char *term) {
+            return std::strstr(env_term_p, term) != nullptr;
+        });
+    }();
+
+    return result;
+#endif
+}
+
+// Determine if the terminal attached
+// Source: https://github.com/agauniyal/rang/
+SPDLOG_INLINE bool in_terminal(FILE *file) SPDLOG_NOEXCEPT {
+#ifdef _WIN32
+    return ::_isatty(_fileno(file)) != 0;
+#else
+    return ::isatty(fileno(file)) != 0;
+#endif
+}
+
+#if (defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT) || defined(SPDLOG_WCHAR_FILENAMES)) && defined(_WIN32)
+SPDLOG_INLINE void wstr_to_utf8buf(wstring_view_t wstr, memory_buf_t &target) {
+    if (wstr.size() > static_cast<size_t>((std::numeric_limits<int>::max)()) / 2 - 1) {
+        throw_spdlog_ex("UTF-16 string is too big to be converted to UTF-8");
+    }
+
+    int wstr_size = static_cast<int>(wstr.size());
+    if (wstr_size == 0) {
+        target.resize(0);
+        return;
+    }
+
+    int result_size = static_cast<int>(target.capacity());
+    if ((wstr_size + 1) * 2 > result_size) {
+        result_size =
+            ::WideCharToMultiByte(CP_UTF8, 0, wstr.data(), wstr_size, NULL, 0, NULL, NULL);
+    }
+
+    if (result_size > 0) {
+        target.resize(result_size);
+        result_size = ::WideCharToMultiByte(CP_UTF8, 0, wstr.data(), wstr_size, target.data(),
+                                            result_size, NULL, NULL);
+
+        if (result_size > 0) {
+            target.resize(result_size);
+            return;
+        }
+    }
+
+    throw_spdlog_ex(
+        fmt_lib::format("WideCharToMultiByte failed. Last error: {}", ::GetLastError()));
+}
+
+SPDLOG_INLINE void utf8_to_wstrbuf(string_view_t str, wmemory_buf_t &target) {
+    if (str.size() > static_cast<size_t>((std::numeric_limits<int>::max)()) - 1) {
+        throw_spdlog_ex("UTF-8 string is too big to be converted to UTF-16");
+    }
+
+    int str_size = static_cast<int>(str.size());
+    if (str_size == 0) {
+        target.resize(0);
+        return;
+    }
+
+    // find the size to allocate for the result buffer
+    int result_size =
+        ::MultiByteToWideChar(CP_UTF8, MB_ERR_INVALID_CHARS, str.data(), str_size, NULL, 0);
+
+    if (result_size > 0) {
+        target.resize(result_size);
+        result_size = ::MultiByteToWideChar(CP_UTF8, MB_ERR_INVALID_CHARS, str.data(), str_size,
+                                            target.data(), result_size);
+        if (result_size > 0) {
+            assert(result_size == target.size());
+            return;
+        }
+    }
+
+    throw_spdlog_ex(
+        fmt_lib::format("MultiByteToWideChar failed. Last error: {}", ::GetLastError()));
+}
+#endif  // (defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT) || defined(SPDLOG_WCHAR_FILENAMES)) &&
+        // defined(_WIN32)
+
+// return true on success
+static SPDLOG_INLINE bool mkdir_(const filename_t &path) {
+#ifdef _WIN32
+    #ifdef SPDLOG_WCHAR_FILENAMES
+    return ::_wmkdir(path.c_str()) == 0;
+    #else
+    return ::_mkdir(path.c_str()) == 0;
+    #endif
+#else
+    return ::mkdir(path.c_str(), mode_t(0755)) == 0;
+#endif
+}
+
+// create the given directory - and all directories leading to it
+// return true on success or if the directory already exists
+SPDLOG_INLINE bool create_dir(const filename_t &path) {
+    if (path_exists(path)) {
+        return true;
+    }
+
+    if (path.empty()) {
+        return false;
+    }
+
+    size_t search_offset = 0;
+    do {
+        auto token_pos = path.find_first_of(folder_seps_filename, search_offset);
+        // treat the entire path as a folder if no folder separator not found
+        if (token_pos == filename_t::npos) {
+            token_pos = path.size();
+        }
+
+        auto subdir = path.substr(0, token_pos);
+
+        if (!subdir.empty() && !path_exists(subdir) && !mkdir_(subdir)) {
+            return false;  // return error if failed creating dir
+        }
+        search_offset = token_pos + 1;
+    } while (search_offset < path.size());
+
+    return true;
+}
+
+// Return directory name from given path or empty string
+// "abc/file" => "abc"
+// "abc/" => "abc"
+// "abc" => ""
+// "abc///" => "abc//"
+SPDLOG_INLINE filename_t dir_name(const filename_t &path) {
+    auto pos = path.find_last_of(folder_seps_filename);
+    return pos != filename_t::npos ? path.substr(0, pos) : filename_t{};
+}
+
+std::string SPDLOG_INLINE getenv(const char *field) {
+#if defined(_MSC_VER)
+    #if defined(__cplusplus_winrt)
+    return std::string{};  // not supported under uwp
+    #else
+    size_t len = 0;
+    char buf[128];
+    bool ok = ::getenv_s(&len, buf, sizeof(buf), field) == 0;
+    return ok ? buf : std::string{};
+    #endif
+#else  // revert to getenv
+    char *buf = ::getenv(field);
+    return buf ? buf : std::string{};
+#endif
+}
+
+// Do fsync by FILE handlerpointer
+// Return true on success
+SPDLOG_INLINE bool fsync(FILE *fp) {
+#ifdef _WIN32
+    return FlushFileBuffers(reinterpret_cast<HANDLE>(_get_osfhandle(_fileno(fp)))) != 0;
+#else
+    return ::fsync(fileno(fp)) == 0;
+#endif
+}
+
+}  // namespace os
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/os.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/os.h
new file mode 100644
index 0000000000..b1069edce0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/os.h
@@ -0,0 +1,123 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <ctime>  // std::time_t
+#include <spdlog/common.h>
+
+namespace spdlog {
+namespace details {
+namespace os {
+
+SPDLOG_API spdlog::log_clock::time_point now() SPDLOG_NOEXCEPT;
+
+SPDLOG_API std::tm localtime(const std::time_t &time_tt) SPDLOG_NOEXCEPT;
+
+SPDLOG_API std::tm localtime() SPDLOG_NOEXCEPT;
+
+SPDLOG_API std::tm gmtime(const std::time_t &time_tt) SPDLOG_NOEXCEPT;
+
+SPDLOG_API std::tm gmtime() SPDLOG_NOEXCEPT;
+
+// eol definition
+#if !defined(SPDLOG_EOL)
+    #ifdef _WIN32
+        #define SPDLOG_EOL "\r\n"
+    #else
+        #define SPDLOG_EOL "\n"
+    #endif
+#endif
+
+SPDLOG_CONSTEXPR static const char *default_eol = SPDLOG_EOL;
+
+// folder separator
+#if !defined(SPDLOG_FOLDER_SEPS)
+    #ifdef _WIN32
+        #define SPDLOG_FOLDER_SEPS "\\/"
+    #else
+        #define SPDLOG_FOLDER_SEPS "/"
+    #endif
+#endif
+
+SPDLOG_CONSTEXPR static const char folder_seps[] = SPDLOG_FOLDER_SEPS;
+SPDLOG_CONSTEXPR static const filename_t::value_type folder_seps_filename[] =
+    SPDLOG_FILENAME_T(SPDLOG_FOLDER_SEPS);
+
+// fopen_s on non windows for writing
+SPDLOG_API bool fopen_s(FILE **fp, const filename_t &filename, const filename_t &mode);
+
+// Remove filename. return 0 on success
+SPDLOG_API int remove(const filename_t &filename) SPDLOG_NOEXCEPT;
+
+// Remove file if exists. return 0 on success
+// Note: Non atomic (might return failure to delete if concurrently deleted by other process/thread)
+SPDLOG_API int remove_if_exists(const filename_t &filename) SPDLOG_NOEXCEPT;
+
+SPDLOG_API int rename(const filename_t &filename1, const filename_t &filename2) SPDLOG_NOEXCEPT;
+
+// Return if file exists.
+SPDLOG_API bool path_exists(const filename_t &filename) SPDLOG_NOEXCEPT;
+
+// Return file size according to open FILE* object
+SPDLOG_API size_t filesize(FILE *f);
+
+// Return utc offset in minutes or throw spdlog_ex on failure
+SPDLOG_API int utc_minutes_offset(const std::tm &tm = details::os::localtime());
+
+// Return current thread id as size_t
+// It exists because the std::this_thread::get_id() is much slower(especially
+// under VS 2013)
+SPDLOG_API size_t _thread_id() SPDLOG_NOEXCEPT;
+
+// Return current thread id as size_t (from thread local storage)
+SPDLOG_API size_t thread_id() SPDLOG_NOEXCEPT;
+
+// This is avoid msvc issue in sleep_for that happens if the clock changes.
+// See https://github.com/gabime/spdlog/issues/609
+SPDLOG_API void sleep_for_millis(unsigned int milliseconds) SPDLOG_NOEXCEPT;
+
+SPDLOG_API std::string filename_to_str(const filename_t &filename);
+
+SPDLOG_API int pid() SPDLOG_NOEXCEPT;
+
+// Determine if the terminal supports colors
+// Source: https://github.com/agauniyal/rang/
+SPDLOG_API bool is_color_terminal() SPDLOG_NOEXCEPT;
+
+// Determine if the terminal attached
+// Source: https://github.com/agauniyal/rang/
+SPDLOG_API bool in_terminal(FILE *file) SPDLOG_NOEXCEPT;
+
+#if (defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT) || defined(SPDLOG_WCHAR_FILENAMES)) && defined(_WIN32)
+SPDLOG_API void wstr_to_utf8buf(wstring_view_t wstr, memory_buf_t &target);
+
+SPDLOG_API void utf8_to_wstrbuf(string_view_t str, wmemory_buf_t &target);
+#endif
+
+// Return directory name from given path or empty string
+// "abc/file" => "abc"
+// "abc/" => "abc"
+// "abc" => ""
+// "abc///" => "abc//"
+SPDLOG_API filename_t dir_name(const filename_t &path);
+
+// Create a dir from the given path.
+// Return true if succeeded or if this dir already exists.
+SPDLOG_API bool create_dir(const filename_t &path);
+
+// non thread safe, cross platform getenv/getenv_s
+// return empty string if field not found
+SPDLOG_API std::string getenv(const char *field);
+
+// Do fsync by FILE objectpointer.
+// Return true on success.
+SPDLOG_API bool fsync(FILE *fp);
+
+}  // namespace os
+}  // namespace details
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "os-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/periodic_worker-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/periodic_worker-inl.h
new file mode 100644
index 0000000000..18f11fbec8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/periodic_worker-inl.h
@@ -0,0 +1,26 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/details/periodic_worker.h>
+#endif
+
+namespace spdlog {
+namespace details {
+
+// stop the worker thread and join it
+SPDLOG_INLINE periodic_worker::~periodic_worker() {
+    if (worker_thread_.joinable()) {
+        {
+            std::lock_guard<std::mutex> lock(mutex_);
+            active_ = false;
+        }
+        cv_.notify_one();
+        worker_thread_.join();
+    }
+}
+
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/periodic_worker.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/periodic_worker.h
new file mode 100644
index 0000000000..d05245cb15
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/periodic_worker.h
@@ -0,0 +1,57 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+// periodic worker thread - periodically executes the given callback function.
+//
+// RAII over the owned thread:
+//    creates the thread on construction.
+//    stops and joins the thread on destruction (if the thread is executing a callback, wait for it
+//    to finish first).
+
+#include <chrono>
+#include <condition_variable>
+#include <functional>
+#include <mutex>
+#include <thread>
+namespace spdlog {
+namespace details {
+
+class SPDLOG_API periodic_worker {
+public:
+    template <typename Rep, typename Period>
+    periodic_worker(const std::function<void()> &callback_fun,
+                    std::chrono::duration<Rep, Period> interval) {
+        active_ = (interval > std::chrono::duration<Rep, Period>::zero());
+        if (!active_) {
+            return;
+        }
+
+        worker_thread_ = std::thread([this, callback_fun, interval]() {
+            for (;;) {
+                std::unique_lock<std::mutex> lock(this->mutex_);
+                if (this->cv_.wait_for(lock, interval, [this] { return !this->active_; })) {
+                    return;  // active_ == false, so exit this thread
+                }
+                callback_fun();
+            }
+        });
+    }
+    periodic_worker(const periodic_worker &) = delete;
+    periodic_worker &operator=(const periodic_worker &) = delete;
+    // stop the worker thread and join it
+    ~periodic_worker();
+
+private:
+    bool active_;
+    std::thread worker_thread_;
+    std::mutex mutex_;
+    std::condition_variable cv_;
+};
+}  // namespace details
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "periodic_worker-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/registry-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/registry-inl.h
new file mode 100644
index 0000000000..da4a7de973
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/registry-inl.h
@@ -0,0 +1,265 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/details/registry.h>
+#endif
+
+#include <spdlog/common.h>
+#include <spdlog/details/periodic_worker.h>
+#include <spdlog/logger.h>
+#include <spdlog/pattern_formatter.h>
+
+#ifndef SPDLOG_DISABLE_DEFAULT_LOGGER
+    // support for the default stdout color logger
+    #ifdef _WIN32
+        #include <spdlog/sinks/wincolor_sink.h>
+    #else
+        #include <spdlog/sinks/ansicolor_sink.h>
+    #endif
+#endif  // SPDLOG_DISABLE_DEFAULT_LOGGER
+
+#include <chrono>
+#include <functional>
+#include <memory>
+#include <string>
+#include <unordered_map>
+
+namespace spdlog {
+namespace details {
+
+SPDLOG_INLINE registry::registry()
+    : formatter_(new pattern_formatter()) {
+#ifndef SPDLOG_DISABLE_DEFAULT_LOGGER
+    // create default logger (ansicolor_stdout_sink_mt or wincolor_stdout_sink_mt in windows).
+    #ifdef _WIN32
+    auto color_sink = std::make_shared<sinks::wincolor_stdout_sink_mt>();
+    #else
+    auto color_sink = std::make_shared<sinks::ansicolor_stdout_sink_mt>();
+    #endif
+
+    const char *default_logger_name = "";
+    default_logger_ = std::make_shared<spdlog::logger>(default_logger_name, std::move(color_sink));
+    loggers_[default_logger_name] = default_logger_;
+
+#endif  // SPDLOG_DISABLE_DEFAULT_LOGGER
+}
+
+SPDLOG_INLINE registry::~registry() = default;
+
+SPDLOG_INLINE void registry::register_logger(std::shared_ptr<logger> new_logger) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    register_logger_(std::move(new_logger));
+}
+
+SPDLOG_INLINE void registry::initialize_logger(std::shared_ptr<logger> new_logger) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    new_logger->set_formatter(formatter_->clone());
+
+    if (err_handler_) {
+        new_logger->set_error_handler(err_handler_);
+    }
+
+    // set new level according to previously configured level or default level
+    auto it = log_levels_.find(new_logger->name());
+    auto new_level = it != log_levels_.end() ? it->second : global_log_level_;
+    new_logger->set_level(new_level);
+
+    new_logger->flush_on(flush_level_);
+
+    if (backtrace_n_messages_ > 0) {
+        new_logger->enable_backtrace(backtrace_n_messages_);
+    }
+
+    if (automatic_registration_) {
+        register_logger_(std::move(new_logger));
+    }
+}
+
+SPDLOG_INLINE std::shared_ptr<logger> registry::get(const std::string &logger_name) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    auto found = loggers_.find(logger_name);
+    return found == loggers_.end() ? nullptr : found->second;
+}
+
+SPDLOG_INLINE std::shared_ptr<logger> registry::default_logger() {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    return default_logger_;
+}
+
+// Return raw ptr to the default logger.
+// To be used directly by the spdlog default api (e.g. spdlog::info)
+// This make the default API faster, but cannot be used concurrently with set_default_logger().
+// e.g do not call set_default_logger() from one thread while calling spdlog::info() from another.
+SPDLOG_INLINE logger *registry::get_default_raw() { return default_logger_.get(); }
+
+// set default logger.
+// default logger is stored in default_logger_ (for faster retrieval) and in the loggers_ map.
+SPDLOG_INLINE void registry::set_default_logger(std::shared_ptr<logger> new_default_logger) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    // remove previous default logger from the map
+    if (default_logger_ != nullptr) {
+        loggers_.erase(default_logger_->name());
+    }
+    if (new_default_logger != nullptr) {
+        loggers_[new_default_logger->name()] = new_default_logger;
+    }
+    default_logger_ = std::move(new_default_logger);
+}
+
+SPDLOG_INLINE void registry::set_tp(std::shared_ptr<thread_pool> tp) {
+    std::lock_guard<std::recursive_mutex> lock(tp_mutex_);
+    tp_ = std::move(tp);
+}
+
+SPDLOG_INLINE std::shared_ptr<thread_pool> registry::get_tp() {
+    std::lock_guard<std::recursive_mutex> lock(tp_mutex_);
+    return tp_;
+}
+
+// Set global formatter. Each sink in each logger will get a clone of this object
+SPDLOG_INLINE void registry::set_formatter(std::unique_ptr<formatter> formatter) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    formatter_ = std::move(formatter);
+    for (auto &l : loggers_) {
+        l.second->set_formatter(formatter_->clone());
+    }
+}
+
+SPDLOG_INLINE void registry::enable_backtrace(size_t n_messages) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    backtrace_n_messages_ = n_messages;
+
+    for (auto &l : loggers_) {
+        l.second->enable_backtrace(n_messages);
+    }
+}
+
+SPDLOG_INLINE void registry::disable_backtrace() {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    backtrace_n_messages_ = 0;
+    for (auto &l : loggers_) {
+        l.second->disable_backtrace();
+    }
+}
+
+SPDLOG_INLINE void registry::set_level(level::level_enum log_level) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    for (auto &l : loggers_) {
+        l.second->set_level(log_level);
+    }
+    global_log_level_ = log_level;
+}
+
+SPDLOG_INLINE void registry::flush_on(level::level_enum log_level) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    for (auto &l : loggers_) {
+        l.second->flush_on(log_level);
+    }
+    flush_level_ = log_level;
+}
+
+SPDLOG_INLINE void registry::set_error_handler(err_handler handler) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    for (auto &l : loggers_) {
+        l.second->set_error_handler(handler);
+    }
+    err_handler_ = std::move(handler);
+}
+
+SPDLOG_INLINE void registry::apply_all(
+    const std::function<void(const std::shared_ptr<logger>)> &fun) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    for (auto &l : loggers_) {
+        fun(l.second);
+    }
+}
+
+SPDLOG_INLINE void registry::flush_all() {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    for (auto &l : loggers_) {
+        l.second->flush();
+    }
+}
+
+SPDLOG_INLINE void registry::drop(const std::string &logger_name) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    auto is_default_logger = default_logger_ && default_logger_->name() == logger_name;
+    loggers_.erase(logger_name);
+    if (is_default_logger) {
+        default_logger_.reset();
+    }
+}
+
+SPDLOG_INLINE void registry::drop_all() {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    loggers_.clear();
+    default_logger_.reset();
+}
+
+// clean all resources and threads started by the registry
+SPDLOG_INLINE void registry::shutdown() {
+    {
+        std::lock_guard<std::mutex> lock(flusher_mutex_);
+        periodic_flusher_.reset();
+    }
+
+    drop_all();
+
+    {
+        std::lock_guard<std::recursive_mutex> lock(tp_mutex_);
+        tp_.reset();
+    }
+}
+
+SPDLOG_INLINE std::recursive_mutex &registry::tp_mutex() { return tp_mutex_; }
+
+SPDLOG_INLINE void registry::set_automatic_registration(bool automatic_registration) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    automatic_registration_ = automatic_registration;
+}
+
+SPDLOG_INLINE void registry::set_levels(log_levels levels, level::level_enum *global_level) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    log_levels_ = std::move(levels);
+    auto global_level_requested = global_level != nullptr;
+    global_log_level_ = global_level_requested ? *global_level : global_log_level_;
+
+    for (auto &logger : loggers_) {
+        auto logger_entry = log_levels_.find(logger.first);
+        if (logger_entry != log_levels_.end()) {
+            logger.second->set_level(logger_entry->second);
+        } else if (global_level_requested) {
+            logger.second->set_level(*global_level);
+        }
+    }
+}
+
+SPDLOG_INLINE registry &registry::instance() {
+    static registry s_instance;
+    return s_instance;
+}
+
+SPDLOG_INLINE void registry::apply_logger_env_levels(std::shared_ptr<logger> new_logger) {
+    std::lock_guard<std::mutex> lock(logger_map_mutex_);
+    auto it = log_levels_.find(new_logger->name());
+    auto new_level = it != log_levels_.end() ? it->second : global_log_level_;
+    new_logger->set_level(new_level);
+}
+
+SPDLOG_INLINE void registry::throw_if_exists_(const std::string &logger_name) {
+    if (loggers_.find(logger_name) != loggers_.end()) {
+        throw_spdlog_ex("logger with name '" + logger_name + "' already exists");
+    }
+}
+
+SPDLOG_INLINE void registry::register_logger_(std::shared_ptr<logger> new_logger) {
+    auto logger_name = new_logger->name();
+    throw_if_exists_(logger_name);
+    loggers_[logger_name] = std::move(new_logger);
+}
+
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/registry.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/registry.h
new file mode 100644
index 0000000000..56a6886ec4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/registry.h
@@ -0,0 +1,122 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+// Loggers registry of unique name->logger pointer
+// An attempt to create a logger with an already existing name will result with spdlog_ex exception.
+// If user requests a non existing logger, nullptr will be returned
+// This class is thread safe
+
+#include <spdlog/common.h>
+#include <spdlog/details/periodic_worker.h>
+
+#include <chrono>
+#include <functional>
+#include <memory>
+#include <mutex>
+#include <string>
+#include <unordered_map>
+
+namespace spdlog {
+class logger;
+
+namespace details {
+class thread_pool;
+
+class SPDLOG_API registry {
+public:
+    using log_levels = std::unordered_map<std::string, level::level_enum>;
+    registry(const registry &) = delete;
+    registry &operator=(const registry &) = delete;
+
+    void register_logger(std::shared_ptr<logger> new_logger);
+    void initialize_logger(std::shared_ptr<logger> new_logger);
+    std::shared_ptr<logger> get(const std::string &logger_name);
+    std::shared_ptr<logger> default_logger();
+
+    // Return raw ptr to the default logger.
+    // To be used directly by the spdlog default api (e.g. spdlog::info)
+    // This make the default API faster, but cannot be used concurrently with set_default_logger().
+    // e.g do not call set_default_logger() from one thread while calling spdlog::info() from
+    // another.
+    logger *get_default_raw();
+
+    // set default logger.
+    // default logger is stored in default_logger_ (for faster retrieval) and in the loggers_ map.
+    void set_default_logger(std::shared_ptr<logger> new_default_logger);
+
+    void set_tp(std::shared_ptr<thread_pool> tp);
+
+    std::shared_ptr<thread_pool> get_tp();
+
+    // Set global formatter. Each sink in each logger will get a clone of this object
+    void set_formatter(std::unique_ptr<formatter> formatter);
+
+    void enable_backtrace(size_t n_messages);
+
+    void disable_backtrace();
+
+    void set_level(level::level_enum log_level);
+
+    void flush_on(level::level_enum log_level);
+
+    template <typename Rep, typename Period>
+    void flush_every(std::chrono::duration<Rep, Period> interval) {
+        std::lock_guard<std::mutex> lock(flusher_mutex_);
+        auto clbk = [this]() { this->flush_all(); };
+        periodic_flusher_ = details::make_unique<periodic_worker>(clbk, interval);
+    }
+
+    void set_error_handler(err_handler handler);
+
+    void apply_all(const std::function<void(const std::shared_ptr<logger>)> &fun);
+
+    void flush_all();
+
+    void drop(const std::string &logger_name);
+
+    void drop_all();
+
+    // clean all resources and threads started by the registry
+    void shutdown();
+
+    std::recursive_mutex &tp_mutex();
+
+    void set_automatic_registration(bool automatic_registration);
+
+    // set levels for all existing/future loggers. global_level can be null if should not set.
+    void set_levels(log_levels levels, level::level_enum *global_level);
+
+    static registry &instance();
+
+    void apply_logger_env_levels(std::shared_ptr<logger> new_logger);
+
+private:
+    registry();
+    ~registry();
+
+    void throw_if_exists_(const std::string &logger_name);
+    void register_logger_(std::shared_ptr<logger> new_logger);
+    bool set_level_from_cfg_(logger *logger);
+    std::mutex logger_map_mutex_, flusher_mutex_;
+    std::recursive_mutex tp_mutex_;
+    std::unordered_map<std::string, std::shared_ptr<logger>> loggers_;
+    log_levels log_levels_;
+    std::unique_ptr<formatter> formatter_;
+    spdlog::level::level_enum global_log_level_ = level::info;
+    level::level_enum flush_level_ = level::off;
+    err_handler err_handler_;
+    std::shared_ptr<thread_pool> tp_;
+    std::unique_ptr<periodic_worker> periodic_flusher_;
+    std::shared_ptr<logger> default_logger_;
+    bool automatic_registration_ = true;
+    size_t backtrace_n_messages_ = 0;
+};
+
+}  // namespace details
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "registry-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/synchronous_factory.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/synchronous_factory.h
new file mode 100644
index 0000000000..4bd5a51c86
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/synchronous_factory.h
@@ -0,0 +1,22 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include "registry.h"
+
+namespace spdlog {
+
+// Default logger factory-  creates synchronous loggers
+class logger;
+
+struct synchronous_factory {
+    template <typename Sink, typename... SinkArgs>
+    static std::shared_ptr<spdlog::logger> create(std::string logger_name, SinkArgs &&...args) {
+        auto sink = std::make_shared<Sink>(std::forward<SinkArgs>(args)...);
+        auto new_logger = std::make_shared<spdlog::logger>(std::move(logger_name), std::move(sink));
+        details::registry::instance().initialize_logger(new_logger);
+        return new_logger;
+    }
+};
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/tcp_client-windows.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/tcp_client-windows.h
new file mode 100644
index 0000000000..bf8f7b8791
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/tcp_client-windows.h
@@ -0,0 +1,135 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#define WIN32_LEAN_AND_MEAN
+// tcp client helper
+#include <spdlog/common.h>
+#include <spdlog/details/os.h>
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string>
+#include <windows.h>
+#include <winsock2.h>
+#include <ws2tcpip.h>
+
+#pragma comment(lib, "Ws2_32.lib")
+#pragma comment(lib, "Mswsock.lib")
+#pragma comment(lib, "AdvApi32.lib")
+
+namespace spdlog {
+namespace details {
+class tcp_client {
+    SOCKET socket_ = INVALID_SOCKET;
+
+    static void init_winsock_() {
+        WSADATA wsaData;
+        auto rv = WSAStartup(MAKEWORD(2, 2), &wsaData);
+        if (rv != 0) {
+            throw_winsock_error_("WSAStartup failed", ::WSAGetLastError());
+        }
+    }
+
+    static void throw_winsock_error_(const std::string &msg, int last_error) {
+        char buf[512];
+        ::FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS, NULL,
+                         last_error, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), buf,
+                         (sizeof(buf) / sizeof(char)), NULL);
+
+        throw_spdlog_ex(fmt_lib::format("tcp_sink - {}: {}", msg, buf));
+    }
+
+public:
+    tcp_client() { init_winsock_(); }
+
+    ~tcp_client() {
+        close();
+        ::WSACleanup();
+    }
+
+    bool is_connected() const { return socket_ != INVALID_SOCKET; }
+
+    void close() {
+        ::closesocket(socket_);
+        socket_ = INVALID_SOCKET;
+    }
+
+    SOCKET fd() const { return socket_; }
+
+    // try to connect or throw on failure
+    void connect(const std::string &host, int port) {
+        if (is_connected()) {
+            close();
+        }
+        struct addrinfo hints {};
+        ZeroMemory(&hints, sizeof(hints));
+
+        hints.ai_family = AF_UNSPEC;      // To work with IPv4, IPv6, and so on
+        hints.ai_socktype = SOCK_STREAM;  // TCP
+        hints.ai_flags = AI_NUMERICSERV;  // port passed as as numeric value
+        hints.ai_protocol = 0;
+
+        auto port_str = std::to_string(port);
+        struct addrinfo *addrinfo_result;
+        auto rv = ::getaddrinfo(host.c_str(), port_str.c_str(), &hints, &addrinfo_result);
+        int last_error = 0;
+        if (rv != 0) {
+            last_error = ::WSAGetLastError();
+            WSACleanup();
+            throw_winsock_error_("getaddrinfo failed", last_error);
+        }
+
+        // Try each address until we successfully connect(2).
+
+        for (auto *rp = addrinfo_result; rp != nullptr; rp = rp->ai_next) {
+            socket_ = socket(rp->ai_family, rp->ai_socktype, rp->ai_protocol);
+            if (socket_ == INVALID_SOCKET) {
+                last_error = ::WSAGetLastError();
+                WSACleanup();
+                continue;
+            }
+            if (::connect(socket_, rp->ai_addr, (int)rp->ai_addrlen) == 0) {
+                break;
+            } else {
+                last_error = ::WSAGetLastError();
+                close();
+            }
+        }
+        ::freeaddrinfo(addrinfo_result);
+        if (socket_ == INVALID_SOCKET) {
+            WSACleanup();
+            throw_winsock_error_("connect failed", last_error);
+        }
+
+        // set TCP_NODELAY
+        int enable_flag = 1;
+        ::setsockopt(socket_, IPPROTO_TCP, TCP_NODELAY, reinterpret_cast<char *>(&enable_flag),
+                     sizeof(enable_flag));
+    }
+
+    // Send exactly n_bytes of the given data.
+    // On error close the connection and throw.
+    void send(const char *data, size_t n_bytes) {
+        size_t bytes_sent = 0;
+        while (bytes_sent < n_bytes) {
+            const int send_flags = 0;
+            auto write_result =
+                ::send(socket_, data + bytes_sent, (int)(n_bytes - bytes_sent), send_flags);
+            if (write_result == SOCKET_ERROR) {
+                int last_error = ::WSAGetLastError();
+                close();
+                throw_winsock_error_("send failed", last_error);
+            }
+
+            if (write_result == 0)  // (probably should not happen but in any case..)
+            {
+                break;
+            }
+            bytes_sent += static_cast<size_t>(write_result);
+        }
+    }
+};
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/tcp_client.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/tcp_client.h
new file mode 100644
index 0000000000..9d3c40d525
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/tcp_client.h
@@ -0,0 +1,127 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifdef _WIN32
+    #error include tcp_client-windows.h instead
+#endif
+
+// tcp client helper
+#include <spdlog/common.h>
+#include <spdlog/details/os.h>
+
+#include <arpa/inet.h>
+#include <netdb.h>
+#include <netinet/in.h>
+#include <netinet/tcp.h>
+#include <sys/socket.h>
+#include <unistd.h>
+
+#include <string>
+
+namespace spdlog {
+namespace details {
+class tcp_client {
+    int socket_ = -1;
+
+public:
+    bool is_connected() const { return socket_ != -1; }
+
+    void close() {
+        if (is_connected()) {
+            ::close(socket_);
+            socket_ = -1;
+        }
+    }
+
+    int fd() const { return socket_; }
+
+    ~tcp_client() { close(); }
+
+    // try to connect or throw on failure
+    void connect(const std::string &host, int port) {
+        close();
+        struct addrinfo hints {};
+        memset(&hints, 0, sizeof(struct addrinfo));
+        hints.ai_family = AF_UNSPEC;      // To work with IPv4, IPv6, and so on
+        hints.ai_socktype = SOCK_STREAM;  // TCP
+        hints.ai_flags = AI_NUMERICSERV;  // port passed as as numeric value
+        hints.ai_protocol = 0;
+
+        auto port_str = std::to_string(port);
+        struct addrinfo *addrinfo_result;
+        auto rv = ::getaddrinfo(host.c_str(), port_str.c_str(), &hints, &addrinfo_result);
+        if (rv != 0) {
+            throw_spdlog_ex(fmt_lib::format("::getaddrinfo failed: {}", gai_strerror(rv)));
+        }
+
+        // Try each address until we successfully connect(2).
+        int last_errno = 0;
+        for (auto *rp = addrinfo_result; rp != nullptr; rp = rp->ai_next) {
+#if defined(SOCK_CLOEXEC)
+            const int flags = SOCK_CLOEXEC;
+#else
+            const int flags = 0;
+#endif
+            socket_ = ::socket(rp->ai_family, rp->ai_socktype | flags, rp->ai_protocol);
+            if (socket_ == -1) {
+                last_errno = errno;
+                continue;
+            }
+            rv = ::connect(socket_, rp->ai_addr, rp->ai_addrlen);
+            if (rv == 0) {
+                break;
+            }
+            last_errno = errno;
+            ::close(socket_);
+            socket_ = -1;
+        }
+        ::freeaddrinfo(addrinfo_result);
+        if (socket_ == -1) {
+            throw_spdlog_ex("::connect failed", last_errno);
+        }
+
+        // set TCP_NODELAY
+        int enable_flag = 1;
+        ::setsockopt(socket_, IPPROTO_TCP, TCP_NODELAY, reinterpret_cast<char *>(&enable_flag),
+                     sizeof(enable_flag));
+
+        // prevent sigpipe on systems where MSG_NOSIGNAL is not available
+#if defined(SO_NOSIGPIPE) && !defined(MSG_NOSIGNAL)
+        ::setsockopt(socket_, SOL_SOCKET, SO_NOSIGPIPE, reinterpret_cast<char *>(&enable_flag),
+                     sizeof(enable_flag));
+#endif
+
+#if !defined(SO_NOSIGPIPE) && !defined(MSG_NOSIGNAL)
+    #error "tcp_sink would raise SIGPIPE since neither SO_NOSIGPIPE nor MSG_NOSIGNAL are available"
+#endif
+    }
+
+    // Send exactly n_bytes of the given data.
+    // On error close the connection and throw.
+    void send(const char *data, size_t n_bytes) {
+        size_t bytes_sent = 0;
+        while (bytes_sent < n_bytes) {
+#if defined(MSG_NOSIGNAL)
+            const int send_flags = MSG_NOSIGNAL;
+#else
+            const int send_flags = 0;
+#endif
+            auto write_result =
+                ::send(socket_, data + bytes_sent, n_bytes - bytes_sent, send_flags);
+            if (write_result < 0) {
+                close();
+                throw_spdlog_ex("write(2) failed", errno);
+            }
+
+            if (write_result == 0)  // (probably should not happen but in any case..)
+            {
+                break;
+            }
+            bytes_sent += static_cast<size_t>(write_result);
+        }
+    }
+};
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/thread_pool-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/thread_pool-inl.h
new file mode 100644
index 0000000000..17e01c092a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/thread_pool-inl.h
@@ -0,0 +1,127 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/details/thread_pool.h>
+#endif
+
+#include <cassert>
+#include <spdlog/common.h>
+
+namespace spdlog {
+namespace details {
+
+SPDLOG_INLINE thread_pool::thread_pool(size_t q_max_items,
+                                       size_t threads_n,
+                                       std::function<void()> on_thread_start,
+                                       std::function<void()> on_thread_stop)
+    : q_(q_max_items) {
+    if (threads_n == 0 || threads_n > 1000) {
+        throw_spdlog_ex(
+            "spdlog::thread_pool(): invalid threads_n param (valid "
+            "range is 1-1000)");
+    }
+    for (size_t i = 0; i < threads_n; i++) {
+        threads_.emplace_back([this, on_thread_start, on_thread_stop] {
+            on_thread_start();
+            this->thread_pool::worker_loop_();
+            on_thread_stop();
+        });
+    }
+}
+
+SPDLOG_INLINE thread_pool::thread_pool(size_t q_max_items,
+                                       size_t threads_n,
+                                       std::function<void()> on_thread_start)
+    : thread_pool(q_max_items, threads_n, on_thread_start, [] {}) {}
+
+SPDLOG_INLINE thread_pool::thread_pool(size_t q_max_items, size_t threads_n)
+    : thread_pool(
+          q_max_items, threads_n, [] {}, [] {}) {}
+
+// message all threads to terminate gracefully join them
+SPDLOG_INLINE thread_pool::~thread_pool() {
+    SPDLOG_TRY {
+        for (size_t i = 0; i < threads_.size(); i++) {
+            post_async_msg_(async_msg(async_msg_type::terminate), async_overflow_policy::block);
+        }
+
+        for (auto &t : threads_) {
+            t.join();
+        }
+    }
+    SPDLOG_CATCH_STD
+}
+
+void SPDLOG_INLINE thread_pool::post_log(async_logger_ptr &&worker_ptr,
+                                         const details::log_msg &msg,
+                                         async_overflow_policy overflow_policy) {
+    async_msg async_m(std::move(worker_ptr), async_msg_type::log, msg);
+    post_async_msg_(std::move(async_m), overflow_policy);
+}
+
+void SPDLOG_INLINE thread_pool::post_flush(async_logger_ptr &&worker_ptr,
+                                           async_overflow_policy overflow_policy) {
+    post_async_msg_(async_msg(std::move(worker_ptr), async_msg_type::flush), overflow_policy);
+}
+
+size_t SPDLOG_INLINE thread_pool::overrun_counter() { return q_.overrun_counter(); }
+
+void SPDLOG_INLINE thread_pool::reset_overrun_counter() { q_.reset_overrun_counter(); }
+
+size_t SPDLOG_INLINE thread_pool::discard_counter() { return q_.discard_counter(); }
+
+void SPDLOG_INLINE thread_pool::reset_discard_counter() { q_.reset_discard_counter(); }
+
+size_t SPDLOG_INLINE thread_pool::queue_size() { return q_.size(); }
+
+void SPDLOG_INLINE thread_pool::post_async_msg_(async_msg &&new_msg,
+                                                async_overflow_policy overflow_policy) {
+    if (overflow_policy == async_overflow_policy::block) {
+        q_.enqueue(std::move(new_msg));
+    } else if (overflow_policy == async_overflow_policy::overrun_oldest) {
+        q_.enqueue_nowait(std::move(new_msg));
+    } else {
+        assert(overflow_policy == async_overflow_policy::discard_new);
+        q_.enqueue_if_have_room(std::move(new_msg));
+    }
+}
+
+void SPDLOG_INLINE thread_pool::worker_loop_() {
+    while (process_next_msg_()) {
+    }
+}
+
+// process next message in the queue
+// return true if this thread should still be active (while no terminate msg
+// was received)
+bool SPDLOG_INLINE thread_pool::process_next_msg_() {
+    async_msg incoming_async_msg;
+    q_.dequeue(incoming_async_msg);
+
+    switch (incoming_async_msg.msg_type) {
+        case async_msg_type::log: {
+            incoming_async_msg.worker_ptr->backend_sink_it_(incoming_async_msg);
+            return true;
+        }
+        case async_msg_type::flush: {
+            incoming_async_msg.worker_ptr->backend_flush_();
+            return true;
+        }
+
+        case async_msg_type::terminate: {
+            return false;
+        }
+
+        default: {
+            assert(false);
+        }
+    }
+
+    return true;
+}
+
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/thread_pool.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/thread_pool.h
new file mode 100644
index 0000000000..f22b078210
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/thread_pool.h
@@ -0,0 +1,117 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/log_msg_buffer.h>
+#include <spdlog/details/mpmc_blocking_q.h>
+#include <spdlog/details/os.h>
+
+#include <chrono>
+#include <functional>
+#include <memory>
+#include <thread>
+#include <vector>
+
+namespace spdlog {
+class async_logger;
+
+namespace details {
+
+using async_logger_ptr = std::shared_ptr<spdlog::async_logger>;
+
+enum class async_msg_type { log, flush, terminate };
+
+// Async msg to move to/from the queue
+// Movable only. should never be copied
+struct async_msg : log_msg_buffer {
+    async_msg_type msg_type{async_msg_type::log};
+    async_logger_ptr worker_ptr;
+
+    async_msg() = default;
+    ~async_msg() = default;
+
+    // should only be moved in or out of the queue..
+    async_msg(const async_msg &) = delete;
+
+// support for vs2013 move
+#if defined(_MSC_VER) && _MSC_VER <= 1800
+    async_msg(async_msg &&other)
+        : log_msg_buffer(std::move(other)),
+          msg_type(other.msg_type),
+          worker_ptr(std::move(other.worker_ptr)) {}
+
+    async_msg &operator=(async_msg &&other) {
+        *static_cast<log_msg_buffer *>(this) = std::move(other);
+        msg_type = other.msg_type;
+        worker_ptr = std::move(other.worker_ptr);
+        return *this;
+    }
+#else  // (_MSC_VER) && _MSC_VER <= 1800
+    async_msg(async_msg &&) = default;
+    async_msg &operator=(async_msg &&) = default;
+#endif
+
+    // construct from log_msg with given type
+    async_msg(async_logger_ptr &&worker, async_msg_type the_type, const details::log_msg &m)
+        : log_msg_buffer{m},
+          msg_type{the_type},
+          worker_ptr{std::move(worker)} {}
+
+    async_msg(async_logger_ptr &&worker, async_msg_type the_type)
+        : log_msg_buffer{},
+          msg_type{the_type},
+          worker_ptr{std::move(worker)} {}
+
+    explicit async_msg(async_msg_type the_type)
+        : async_msg{nullptr, the_type} {}
+};
+
+class SPDLOG_API thread_pool {
+public:
+    using item_type = async_msg;
+    using q_type = details::mpmc_blocking_queue<item_type>;
+
+    thread_pool(size_t q_max_items,
+                size_t threads_n,
+                std::function<void()> on_thread_start,
+                std::function<void()> on_thread_stop);
+    thread_pool(size_t q_max_items, size_t threads_n, std::function<void()> on_thread_start);
+    thread_pool(size_t q_max_items, size_t threads_n);
+
+    // message all threads to terminate gracefully and join them
+    ~thread_pool();
+
+    thread_pool(const thread_pool &) = delete;
+    thread_pool &operator=(thread_pool &&) = delete;
+
+    void post_log(async_logger_ptr &&worker_ptr,
+                  const details::log_msg &msg,
+                  async_overflow_policy overflow_policy);
+    void post_flush(async_logger_ptr &&worker_ptr, async_overflow_policy overflow_policy);
+    size_t overrun_counter();
+    void reset_overrun_counter();
+    size_t discard_counter();
+    void reset_discard_counter();
+    size_t queue_size();
+
+private:
+    q_type q_;
+
+    std::vector<std::thread> threads_;
+
+    void post_async_msg_(async_msg &&new_msg, async_overflow_policy overflow_policy);
+    void worker_loop_();
+
+    // process next message in the queue
+    // return true if this thread should still be active (while no terminate msg
+    // was received)
+    bool process_next_msg_();
+};
+
+}  // namespace details
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "thread_pool-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/udp_client-windows.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/udp_client-windows.h
new file mode 100644
index 0000000000..8b7c22324e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/udp_client-windows.h
@@ -0,0 +1,98 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+// Helper RAII over winsock udp client socket.
+// Will throw on construction if socket creation failed.
+
+#include <spdlog/common.h>
+#include <spdlog/details/os.h>
+#include <spdlog/details/windows_include.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string>
+#include <winsock2.h>
+#include <ws2tcpip.h>
+
+#if defined(_MSC_VER)
+    #pragma comment(lib, "Ws2_32.lib")
+    #pragma comment(lib, "Mswsock.lib")
+    #pragma comment(lib, "AdvApi32.lib")
+#endif
+
+namespace spdlog {
+namespace details {
+class udp_client {
+    static constexpr int TX_BUFFER_SIZE = 1024 * 10;
+    SOCKET socket_ = INVALID_SOCKET;
+    sockaddr_in addr_ = {};
+
+    static void init_winsock_() {
+        WSADATA wsaData;
+        auto rv = ::WSAStartup(MAKEWORD(2, 2), &wsaData);
+        if (rv != 0) {
+            throw_winsock_error_("WSAStartup failed", ::WSAGetLastError());
+        }
+    }
+
+    static void throw_winsock_error_(const std::string &msg, int last_error) {
+        char buf[512];
+        ::FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS, NULL,
+                         last_error, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), buf,
+                         (sizeof(buf) / sizeof(char)), NULL);
+
+        throw_spdlog_ex(fmt_lib::format("udp_sink - {}: {}", msg, buf));
+    }
+
+    void cleanup_() {
+        if (socket_ != INVALID_SOCKET) {
+            ::closesocket(socket_);
+        }
+        socket_ = INVALID_SOCKET;
+        ::WSACleanup();
+    }
+
+public:
+    udp_client(const std::string &host, uint16_t port) {
+        init_winsock_();
+
+        addr_.sin_family = PF_INET;
+        addr_.sin_port = htons(port);
+        addr_.sin_addr.s_addr = INADDR_ANY;
+        if (InetPtonA(PF_INET, host.c_str(), &addr_.sin_addr.s_addr) != 1) {
+            int last_error = ::WSAGetLastError();
+            ::WSACleanup();
+            throw_winsock_error_("error: Invalid address!", last_error);
+        }
+
+        socket_ = ::socket(PF_INET, SOCK_DGRAM, 0);
+        if (socket_ == INVALID_SOCKET) {
+            int last_error = ::WSAGetLastError();
+            ::WSACleanup();
+            throw_winsock_error_("error: Create Socket failed", last_error);
+        }
+
+        int option_value = TX_BUFFER_SIZE;
+        if (::setsockopt(socket_, SOL_SOCKET, SO_SNDBUF,
+                         reinterpret_cast<const char *>(&option_value), sizeof(option_value)) < 0) {
+            int last_error = ::WSAGetLastError();
+            cleanup_();
+            throw_winsock_error_("error: setsockopt(SO_SNDBUF) Failed!", last_error);
+        }
+    }
+
+    ~udp_client() { cleanup_(); }
+
+    SOCKET fd() const { return socket_; }
+
+    void send(const char *data, size_t n_bytes) {
+        socklen_t tolen = sizeof(struct sockaddr);
+        if (::sendto(socket_, data, static_cast<int>(n_bytes), 0, (struct sockaddr *)&addr_,
+                     tolen) == -1) {
+            throw_spdlog_ex("sendto(2) failed", errno);
+        }
+    }
+};
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/udp_client.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/udp_client.h
new file mode 100644
index 0000000000..95826f5d91
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/udp_client.h
@@ -0,0 +1,81 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+// Helper RAII over unix udp client socket.
+// Will throw on construction if the socket creation failed.
+
+#ifdef _WIN32
+    #error "include udp_client-windows.h instead"
+#endif
+
+#include <arpa/inet.h>
+#include <cstring>
+#include <netdb.h>
+#include <netinet/in.h>
+#include <netinet/udp.h>
+#include <spdlog/common.h>
+#include <spdlog/details/os.h>
+#include <sys/socket.h>
+#include <unistd.h>
+
+#include <string>
+
+namespace spdlog {
+namespace details {
+
+class udp_client {
+    static constexpr int TX_BUFFER_SIZE = 1024 * 10;
+    int socket_ = -1;
+    struct sockaddr_in sockAddr_;
+
+    void cleanup_() {
+        if (socket_ != -1) {
+            ::close(socket_);
+            socket_ = -1;
+        }
+    }
+
+public:
+    udp_client(const std::string &host, uint16_t port) {
+        socket_ = ::socket(PF_INET, SOCK_DGRAM, 0);
+        if (socket_ < 0) {
+            throw_spdlog_ex("error: Create Socket Failed!");
+        }
+
+        int option_value = TX_BUFFER_SIZE;
+        if (::setsockopt(socket_, SOL_SOCKET, SO_SNDBUF,
+                         reinterpret_cast<const char *>(&option_value), sizeof(option_value)) < 0) {
+            cleanup_();
+            throw_spdlog_ex("error: setsockopt(SO_SNDBUF) Failed!");
+        }
+
+        sockAddr_.sin_family = AF_INET;
+        sockAddr_.sin_port = htons(port);
+
+        if (::inet_aton(host.c_str(), &sockAddr_.sin_addr) == 0) {
+            cleanup_();
+            throw_spdlog_ex("error: Invalid address!");
+        }
+
+        ::memset(sockAddr_.sin_zero, 0x00, sizeof(sockAddr_.sin_zero));
+    }
+
+    ~udp_client() { cleanup_(); }
+
+    int fd() const { return socket_; }
+
+    // Send exactly n_bytes of the given data.
+    // On error close the connection and throw.
+    void send(const char *data, size_t n_bytes) {
+        ssize_t toslen = 0;
+        socklen_t tolen = sizeof(struct sockaddr);
+        if ((toslen = ::sendto(socket_, data, n_bytes, 0, (struct sockaddr *)&sockAddr_, tolen)) ==
+            -1) {
+            throw_spdlog_ex("sendto(2) failed", errno);
+        }
+    }
+};
+}  // namespace details
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/windows_include.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/windows_include.h
new file mode 100644
index 0000000000..bbab59b1c7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/details/windows_include.h
@@ -0,0 +1,11 @@
+#pragma once
+
+#ifndef NOMINMAX
+    #define NOMINMAX  // prevent windows redefining min/max
+#endif
+
+#ifndef WIN32_LEAN_AND_MEAN
+    #define WIN32_LEAN_AND_MEAN
+#endif
+
+#include <windows.h>
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bin_to_hex.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bin_to_hex.h
new file mode 100644
index 0000000000..c2998d57ae
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bin_to_hex.h
@@ -0,0 +1,224 @@
+//
+// Copyright(c) 2015 Gabi Melman.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+//
+
+#pragma once
+
+#include <cctype>
+#include <spdlog/common.h>
+
+#if defined(__has_include)
+    #if __has_include(<version>)
+        #include <version>
+    #endif
+#endif
+
+#if __cpp_lib_span >= 202002L
+    #include <span>
+#endif
+
+//
+// Support for logging binary data as hex
+// format flags, any combination of the following:
+// {:X} - print in uppercase.
+// {:s} - don't separate each byte with space.
+// {:p} - don't print the position on each line start.
+// {:n} - don't split the output to lines.
+// {:a} - show ASCII if :n is not set
+
+//
+// Examples:
+//
+// std::vector<char> v(200, 0x0b);
+// logger->info("Some buffer {}", spdlog::to_hex(v));
+// char buf[128];
+// logger->info("Some buffer {:X}", spdlog::to_hex(std::begin(buf), std::end(buf)));
+// logger->info("Some buffer {:X}", spdlog::to_hex(std::begin(buf), std::end(buf), 16));
+
+namespace spdlog {
+namespace details {
+
+template <typename It>
+class dump_info {
+public:
+    dump_info(It range_begin, It range_end, size_t size_per_line)
+        : begin_(range_begin),
+          end_(range_end),
+          size_per_line_(size_per_line) {}
+
+    // do not use begin() and end() to avoid collision with fmt/ranges
+    It get_begin() const { return begin_; }
+    It get_end() const { return end_; }
+    size_t size_per_line() const { return size_per_line_; }
+
+private:
+    It begin_, end_;
+    size_t size_per_line_;
+};
+}  // namespace details
+
+// create a dump_info that wraps the given container
+template <typename Container>
+inline details::dump_info<typename Container::const_iterator> to_hex(const Container &container,
+                                                                     size_t size_per_line = 32) {
+    static_assert(sizeof(typename Container::value_type) == 1,
+                  "sizeof(Container::value_type) != 1");
+    using Iter = typename Container::const_iterator;
+    return details::dump_info<Iter>(std::begin(container), std::end(container), size_per_line);
+}
+
+#if __cpp_lib_span >= 202002L
+
+template <typename Value, size_t Extent>
+inline details::dump_info<typename std::span<Value, Extent>::iterator> to_hex(
+    const std::span<Value, Extent> &container, size_t size_per_line = 32) {
+    using Container = std::span<Value, Extent>;
+    static_assert(sizeof(typename Container::value_type) == 1,
+                  "sizeof(Container::value_type) != 1");
+    using Iter = typename Container::iterator;
+    return details::dump_info<Iter>(std::begin(container), std::end(container), size_per_line);
+}
+
+#endif
+
+// create dump_info from ranges
+template <typename It>
+inline details::dump_info<It> to_hex(const It range_begin,
+                                     const It range_end,
+                                     size_t size_per_line = 32) {
+    return details::dump_info<It>(range_begin, range_end, size_per_line);
+}
+
+}  // namespace spdlog
+
+namespace
+#ifdef SPDLOG_USE_STD_FORMAT
+    std
+#else
+    fmt
+#endif
+{
+
+template <typename T>
+struct formatter<spdlog::details::dump_info<T>, char> {
+    const char delimiter = ' ';
+    bool put_newlines = true;
+    bool put_delimiters = true;
+    bool use_uppercase = false;
+    bool put_positions = true;  // position on start of each line
+    bool show_ascii = false;
+
+    // parse the format string flags
+    template <typename ParseContext>
+    SPDLOG_CONSTEXPR_FUNC auto parse(ParseContext &ctx) -> decltype(ctx.begin()) {
+        auto it = ctx.begin();
+        while (it != ctx.end() && *it != '}') {
+            switch (*it) {
+                case 'X':
+                    use_uppercase = true;
+                    break;
+                case 's':
+                    put_delimiters = false;
+                    break;
+                case 'p':
+                    put_positions = false;
+                    break;
+                case 'n':
+                    put_newlines = false;
+                    show_ascii = false;
+                    break;
+                case 'a':
+                    if (put_newlines) {
+                        show_ascii = true;
+                    }
+                    break;
+            }
+
+            ++it;
+        }
+        return it;
+    }
+
+    // format the given bytes range as hex
+    template <typename FormatContext, typename Container>
+    auto format(const spdlog::details::dump_info<Container> &the_range, FormatContext &ctx) const
+        -> decltype(ctx.out()) {
+        SPDLOG_CONSTEXPR const char *hex_upper = "0123456789ABCDEF";
+        SPDLOG_CONSTEXPR const char *hex_lower = "0123456789abcdef";
+        const char *hex_chars = use_uppercase ? hex_upper : hex_lower;
+
+#if !defined(SPDLOG_USE_STD_FORMAT) && FMT_VERSION < 60000
+        auto inserter = ctx.begin();
+#else
+        auto inserter = ctx.out();
+#endif
+
+        int size_per_line = static_cast<int>(the_range.size_per_line());
+        auto start_of_line = the_range.get_begin();
+        for (auto i = the_range.get_begin(); i != the_range.get_end(); i++) {
+            auto ch = static_cast<unsigned char>(*i);
+
+            if (put_newlines &&
+                (i == the_range.get_begin() || i - start_of_line >= size_per_line)) {
+                if (show_ascii && i != the_range.get_begin()) {
+                    *inserter++ = delimiter;
+                    *inserter++ = delimiter;
+                    for (auto j = start_of_line; j < i; j++) {
+                        auto pc = static_cast<unsigned char>(*j);
+                        *inserter++ = std::isprint(pc) ? static_cast<char>(*j) : '.';
+                    }
+                }
+
+                put_newline(inserter, static_cast<size_t>(i - the_range.get_begin()));
+
+                // put first byte without delimiter in front of it
+                *inserter++ = hex_chars[(ch >> 4) & 0x0f];
+                *inserter++ = hex_chars[ch & 0x0f];
+                start_of_line = i;
+                continue;
+            }
+
+            if (put_delimiters && i != the_range.get_begin()) {
+                *inserter++ = delimiter;
+            }
+
+            *inserter++ = hex_chars[(ch >> 4) & 0x0f];
+            *inserter++ = hex_chars[ch & 0x0f];
+        }
+        if (show_ascii)  // add ascii to last line
+        {
+            if (the_range.get_end() - the_range.get_begin() > size_per_line) {
+                auto blank_num = size_per_line - (the_range.get_end() - start_of_line);
+                while (blank_num-- > 0) {
+                    *inserter++ = delimiter;
+                    *inserter++ = delimiter;
+                    if (put_delimiters) {
+                        *inserter++ = delimiter;
+                    }
+                }
+            }
+            *inserter++ = delimiter;
+            *inserter++ = delimiter;
+            for (auto j = start_of_line; j != the_range.get_end(); j++) {
+                auto pc = static_cast<unsigned char>(*j);
+                *inserter++ = std::isprint(pc) ? static_cast<char>(*j) : '.';
+            }
+        }
+        return inserter;
+    }
+
+    // put newline(and position header)
+    template <typename It>
+    void put_newline(It inserter, std::size_t pos) const {
+#ifdef _WIN32
+        *inserter++ = '\r';
+#endif
+        *inserter++ = '\n';
+
+        if (put_positions) {
+            spdlog::fmt_lib::format_to(inserter, SPDLOG_FMT_STRING("{:04X}: "), pos);
+        }
+    }
+};
+}  // namespace std
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/args.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/args.h
new file mode 100644
index 0000000000..a3966d1407
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/args.h
@@ -0,0 +1,234 @@
+// Formatting library for C++ - dynamic format arguments
+//
+// Copyright (c) 2012 - present, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_ARGS_H_
+#define FMT_ARGS_H_
+
+#include <functional>  // std::reference_wrapper
+#include <memory>      // std::unique_ptr
+#include <vector>
+
+#include "core.h"
+
+FMT_BEGIN_NAMESPACE
+
+namespace detail {
+
+template <typename T> struct is_reference_wrapper : std::false_type {};
+template <typename T>
+struct is_reference_wrapper<std::reference_wrapper<T>> : std::true_type {};
+
+template <typename T> const T& unwrap(const T& v) { return v; }
+template <typename T> const T& unwrap(const std::reference_wrapper<T>& v) {
+  return static_cast<const T&>(v);
+}
+
+class dynamic_arg_list {
+  // Workaround for clang's -Wweak-vtables. Unlike for regular classes, for
+  // templates it doesn't complain about inability to deduce single translation
+  // unit for placing vtable. So storage_node_base is made a fake template.
+  template <typename = void> struct node {
+    virtual ~node() = default;
+    std::unique_ptr<node<>> next;
+  };
+
+  template <typename T> struct typed_node : node<> {
+    T value;
+
+    template <typename Arg>
+    FMT_CONSTEXPR typed_node(const Arg& arg) : value(arg) {}
+
+    template <typename Char>
+    FMT_CONSTEXPR typed_node(const basic_string_view<Char>& arg)
+        : value(arg.data(), arg.size()) {}
+  };
+
+  std::unique_ptr<node<>> head_;
+
+ public:
+  template <typename T, typename Arg> const T& push(const Arg& arg) {
+    auto new_node = std::unique_ptr<typed_node<T>>(new typed_node<T>(arg));
+    auto& value = new_node->value;
+    new_node->next = std::move(head_);
+    head_ = std::move(new_node);
+    return value;
+  }
+};
+}  // namespace detail
+
+/**
+  \rst
+  A dynamic version of `fmt::format_arg_store`.
+  It's equipped with a storage to potentially temporary objects which lifetimes
+  could be shorter than the format arguments object.
+
+  It can be implicitly converted into `~fmt::basic_format_args` for passing
+  into type-erased formatting functions such as `~fmt::vformat`.
+  \endrst
+ */
+template <typename Context>
+class dynamic_format_arg_store
+#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409
+    // Workaround a GCC template argument substitution bug.
+    : public basic_format_args<Context>
+#endif
+{
+ private:
+  using char_type = typename Context::char_type;
+
+  template <typename T> struct need_copy {
+    static constexpr detail::type mapped_type =
+        detail::mapped_type_constant<T, Context>::value;
+
+    enum {
+      value = !(detail::is_reference_wrapper<T>::value ||
+                std::is_same<T, basic_string_view<char_type>>::value ||
+                std::is_same<T, detail::std_string_view<char_type>>::value ||
+                (mapped_type != detail::type::cstring_type &&
+                 mapped_type != detail::type::string_type &&
+                 mapped_type != detail::type::custom_type))
+    };
+  };
+
+  template <typename T>
+  using stored_type = conditional_t<
+      std::is_convertible<T, std::basic_string<char_type>>::value &&
+          !detail::is_reference_wrapper<T>::value,
+      std::basic_string<char_type>, T>;
+
+  // Storage of basic_format_arg must be contiguous.
+  std::vector<basic_format_arg<Context>> data_;
+  std::vector<detail::named_arg_info<char_type>> named_info_;
+
+  // Storage of arguments not fitting into basic_format_arg must grow
+  // without relocation because items in data_ refer to it.
+  detail::dynamic_arg_list dynamic_args_;
+
+  friend class basic_format_args<Context>;
+
+  unsigned long long get_types() const {
+    return detail::is_unpacked_bit | data_.size() |
+           (named_info_.empty()
+                ? 0ULL
+                : static_cast<unsigned long long>(detail::has_named_args_bit));
+  }
+
+  const basic_format_arg<Context>* data() const {
+    return named_info_.empty() ? data_.data() : data_.data() + 1;
+  }
+
+  template <typename T> void emplace_arg(const T& arg) {
+    data_.emplace_back(detail::make_arg<Context>(arg));
+  }
+
+  template <typename T>
+  void emplace_arg(const detail::named_arg<char_type, T>& arg) {
+    if (named_info_.empty()) {
+      constexpr const detail::named_arg_info<char_type>* zero_ptr{nullptr};
+      data_.insert(data_.begin(), {zero_ptr, 0});
+    }
+    data_.emplace_back(detail::make_arg<Context>(detail::unwrap(arg.value)));
+    auto pop_one = [](std::vector<basic_format_arg<Context>>* data) {
+      data->pop_back();
+    };
+    std::unique_ptr<std::vector<basic_format_arg<Context>>, decltype(pop_one)>
+        guard{&data_, pop_one};
+    named_info_.push_back({arg.name, static_cast<int>(data_.size() - 2u)});
+    data_[0].value_.named_args = {named_info_.data(), named_info_.size()};
+    guard.release();
+  }
+
+ public:
+  constexpr dynamic_format_arg_store() = default;
+
+  /**
+    \rst
+    Adds an argument into the dynamic store for later passing to a formatting
+    function.
+
+    Note that custom types and string types (but not string views) are copied
+    into the store dynamically allocating memory if necessary.
+
+    **Example**::
+
+      fmt::dynamic_format_arg_store<fmt::format_context> store;
+      store.push_back(42);
+      store.push_back("abc");
+      store.push_back(1.5f);
+      std::string result = fmt::vformat("{} and {} and {}", store);
+    \endrst
+  */
+  template <typename T> void push_back(const T& arg) {
+    if (detail::const_check(need_copy<T>::value))
+      emplace_arg(dynamic_args_.push<stored_type<T>>(arg));
+    else
+      emplace_arg(detail::unwrap(arg));
+  }
+
+  /**
+    \rst
+    Adds a reference to the argument into the dynamic store for later passing to
+    a formatting function.
+
+    **Example**::
+
+      fmt::dynamic_format_arg_store<fmt::format_context> store;
+      char band[] = "Rolling Stones";
+      store.push_back(std::cref(band));
+      band[9] = 'c'; // Changing str affects the output.
+      std::string result = fmt::vformat("{}", store);
+      // result == "Rolling Scones"
+    \endrst
+  */
+  template <typename T> void push_back(std::reference_wrapper<T> arg) {
+    static_assert(
+        need_copy<T>::value,
+        "objects of built-in types and string views are always copied");
+    emplace_arg(arg.get());
+  }
+
+  /**
+    Adds named argument into the dynamic store for later passing to a formatting
+    function. ``std::reference_wrapper`` is supported to avoid copying of the
+    argument. The name is always copied into the store.
+  */
+  template <typename T>
+  void push_back(const detail::named_arg<char_type, T>& arg) {
+    const char_type* arg_name =
+        dynamic_args_.push<std::basic_string<char_type>>(arg.name).c_str();
+    if (detail::const_check(need_copy<T>::value)) {
+      emplace_arg(
+          fmt::arg(arg_name, dynamic_args_.push<stored_type<T>>(arg.value)));
+    } else {
+      emplace_arg(fmt::arg(arg_name, arg.value));
+    }
+  }
+
+  /** Erase all elements from the store */
+  void clear() {
+    data_.clear();
+    named_info_.clear();
+    dynamic_args_ = detail::dynamic_arg_list();
+  }
+
+  /**
+    \rst
+    Reserves space to store at least *new_cap* arguments including
+    *new_cap_named* named arguments.
+    \endrst
+  */
+  void reserve(size_t new_cap, size_t new_cap_named) {
+    FMT_ASSERT(new_cap >= new_cap_named,
+               "Set of arguments includes set of named arguments");
+    data_.reserve(new_cap);
+    named_info_.reserve(new_cap_named);
+  }
+};
+
+FMT_END_NAMESPACE
+
+#endif  // FMT_ARGS_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/chrono.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/chrono.h
new file mode 100644
index 0000000000..b112f76e99
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/chrono.h
@@ -0,0 +1,2069 @@
+// Formatting library for C++ - chrono support
+//
+// Copyright (c) 2012 - present, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_CHRONO_H_
+#define FMT_CHRONO_H_
+
+#include <algorithm>
+#include <chrono>
+#include <cmath>    // std::isfinite
+#include <cstring>  // std::memcpy
+#include <ctime>
+#include <iterator>
+#include <locale>
+#include <ostream>
+#include <type_traits>
+
+#include "format.h"
+
+FMT_BEGIN_NAMESPACE
+
+// Enable tzset.
+#ifndef FMT_USE_TZSET
+// UWP doesn't provide _tzset.
+#  if FMT_HAS_INCLUDE("winapifamily.h")
+#    include <winapifamily.h>
+#  endif
+#  if defined(_WIN32) && (!defined(WINAPI_FAMILY) || \
+                          (WINAPI_FAMILY == WINAPI_FAMILY_DESKTOP_APP))
+#    define FMT_USE_TZSET 1
+#  else
+#    define FMT_USE_TZSET 0
+#  endif
+#endif
+
+// Enable safe chrono durations, unless explicitly disabled.
+#ifndef FMT_SAFE_DURATION_CAST
+#  define FMT_SAFE_DURATION_CAST 1
+#endif
+#if FMT_SAFE_DURATION_CAST
+
+// For conversion between std::chrono::durations without undefined
+// behaviour or erroneous results.
+// This is a stripped down version of duration_cast, for inclusion in fmt.
+// See https://github.com/pauldreik/safe_duration_cast
+//
+// Copyright Paul Dreik 2019
+namespace safe_duration_cast {
+
+template <typename To, typename From,
+          FMT_ENABLE_IF(!std::is_same<From, To>::value &&
+                        std::numeric_limits<From>::is_signed ==
+                            std::numeric_limits<To>::is_signed)>
+FMT_CONSTEXPR To lossless_integral_conversion(const From from, int& ec) {
+  ec = 0;
+  using F = std::numeric_limits<From>;
+  using T = std::numeric_limits<To>;
+  static_assert(F::is_integer, "From must be integral");
+  static_assert(T::is_integer, "To must be integral");
+
+  // A and B are both signed, or both unsigned.
+  if (detail::const_check(F::digits <= T::digits)) {
+    // From fits in To without any problem.
+  } else {
+    // From does not always fit in To, resort to a dynamic check.
+    if (from < (T::min)() || from > (T::max)()) {
+      // outside range.
+      ec = 1;
+      return {};
+    }
+  }
+  return static_cast<To>(from);
+}
+
+/**
+ * converts From to To, without loss. If the dynamic value of from
+ * can't be converted to To without loss, ec is set.
+ */
+template <typename To, typename From,
+          FMT_ENABLE_IF(!std::is_same<From, To>::value &&
+                        std::numeric_limits<From>::is_signed !=
+                            std::numeric_limits<To>::is_signed)>
+FMT_CONSTEXPR To lossless_integral_conversion(const From from, int& ec) {
+  ec = 0;
+  using F = std::numeric_limits<From>;
+  using T = std::numeric_limits<To>;
+  static_assert(F::is_integer, "From must be integral");
+  static_assert(T::is_integer, "To must be integral");
+
+  if (detail::const_check(F::is_signed && !T::is_signed)) {
+    // From may be negative, not allowed!
+    if (fmt::detail::is_negative(from)) {
+      ec = 1;
+      return {};
+    }
+    // From is positive. Can it always fit in To?
+    if (detail::const_check(F::digits > T::digits) &&
+        from > static_cast<From>(detail::max_value<To>())) {
+      ec = 1;
+      return {};
+    }
+  }
+
+  if (detail::const_check(!F::is_signed && T::is_signed &&
+                          F::digits >= T::digits) &&
+      from > static_cast<From>(detail::max_value<To>())) {
+    ec = 1;
+    return {};
+  }
+  return static_cast<To>(from);  // Lossless conversion.
+}
+
+template <typename To, typename From,
+          FMT_ENABLE_IF(std::is_same<From, To>::value)>
+FMT_CONSTEXPR To lossless_integral_conversion(const From from, int& ec) {
+  ec = 0;
+  return from;
+}  // function
+
+// clang-format off
+/**
+ * converts From to To if possible, otherwise ec is set.
+ *
+ * input                            |    output
+ * ---------------------------------|---------------
+ * NaN                              | NaN
+ * Inf                              | Inf
+ * normal, fits in output           | converted (possibly lossy)
+ * normal, does not fit in output   | ec is set
+ * subnormal                        | best effort
+ * -Inf                             | -Inf
+ */
+// clang-format on
+template <typename To, typename From,
+          FMT_ENABLE_IF(!std::is_same<From, To>::value)>
+FMT_CONSTEXPR To safe_float_conversion(const From from, int& ec) {
+  ec = 0;
+  using T = std::numeric_limits<To>;
+  static_assert(std::is_floating_point<From>::value, "From must be floating");
+  static_assert(std::is_floating_point<To>::value, "To must be floating");
+
+  // catch the only happy case
+  if (std::isfinite(from)) {
+    if (from >= T::lowest() && from <= (T::max)()) {
+      return static_cast<To>(from);
+    }
+    // not within range.
+    ec = 1;
+    return {};
+  }
+
+  // nan and inf will be preserved
+  return static_cast<To>(from);
+}  // function
+
+template <typename To, typename From,
+          FMT_ENABLE_IF(std::is_same<From, To>::value)>
+FMT_CONSTEXPR To safe_float_conversion(const From from, int& ec) {
+  ec = 0;
+  static_assert(std::is_floating_point<From>::value, "From must be floating");
+  return from;
+}
+
+/**
+ * safe duration cast between integral durations
+ */
+template <typename To, typename FromRep, typename FromPeriod,
+          FMT_ENABLE_IF(std::is_integral<FromRep>::value),
+          FMT_ENABLE_IF(std::is_integral<typename To::rep>::value)>
+To safe_duration_cast(std::chrono::duration<FromRep, FromPeriod> from,
+                      int& ec) {
+  using From = std::chrono::duration<FromRep, FromPeriod>;
+  ec = 0;
+  // the basic idea is that we need to convert from count() in the from type
+  // to count() in the To type, by multiplying it with this:
+  struct Factor
+      : std::ratio_divide<typename From::period, typename To::period> {};
+
+  static_assert(Factor::num > 0, "num must be positive");
+  static_assert(Factor::den > 0, "den must be positive");
+
+  // the conversion is like this: multiply from.count() with Factor::num
+  // /Factor::den and convert it to To::rep, all this without
+  // overflow/underflow. let's start by finding a suitable type that can hold
+  // both To, From and Factor::num
+  using IntermediateRep =
+      typename std::common_type<typename From::rep, typename To::rep,
+                                decltype(Factor::num)>::type;
+
+  // safe conversion to IntermediateRep
+  IntermediateRep count =
+      lossless_integral_conversion<IntermediateRep>(from.count(), ec);
+  if (ec) return {};
+  // multiply with Factor::num without overflow or underflow
+  if (detail::const_check(Factor::num != 1)) {
+    const auto max1 = detail::max_value<IntermediateRep>() / Factor::num;
+    if (count > max1) {
+      ec = 1;
+      return {};
+    }
+    const auto min1 =
+        (std::numeric_limits<IntermediateRep>::min)() / Factor::num;
+    if (!std::is_unsigned<IntermediateRep>::value && count < min1) {
+      ec = 1;
+      return {};
+    }
+    count *= Factor::num;
+  }
+
+  if (detail::const_check(Factor::den != 1)) count /= Factor::den;
+  auto tocount = lossless_integral_conversion<typename To::rep>(count, ec);
+  return ec ? To() : To(tocount);
+}
+
+/**
+ * safe duration_cast between floating point durations
+ */
+template <typename To, typename FromRep, typename FromPeriod,
+          FMT_ENABLE_IF(std::is_floating_point<FromRep>::value),
+          FMT_ENABLE_IF(std::is_floating_point<typename To::rep>::value)>
+To safe_duration_cast(std::chrono::duration<FromRep, FromPeriod> from,
+                      int& ec) {
+  using From = std::chrono::duration<FromRep, FromPeriod>;
+  ec = 0;
+  if (std::isnan(from.count())) {
+    // nan in, gives nan out. easy.
+    return To{std::numeric_limits<typename To::rep>::quiet_NaN()};
+  }
+  // maybe we should also check if from is denormal, and decide what to do about
+  // it.
+
+  // +-inf should be preserved.
+  if (std::isinf(from.count())) {
+    return To{from.count()};
+  }
+
+  // the basic idea is that we need to convert from count() in the from type
+  // to count() in the To type, by multiplying it with this:
+  struct Factor
+      : std::ratio_divide<typename From::period, typename To::period> {};
+
+  static_assert(Factor::num > 0, "num must be positive");
+  static_assert(Factor::den > 0, "den must be positive");
+
+  // the conversion is like this: multiply from.count() with Factor::num
+  // /Factor::den and convert it to To::rep, all this without
+  // overflow/underflow. let's start by finding a suitable type that can hold
+  // both To, From and Factor::num
+  using IntermediateRep =
+      typename std::common_type<typename From::rep, typename To::rep,
+                                decltype(Factor::num)>::type;
+
+  // force conversion of From::rep -> IntermediateRep to be safe,
+  // even if it will never happen be narrowing in this context.
+  IntermediateRep count =
+      safe_float_conversion<IntermediateRep>(from.count(), ec);
+  if (ec) {
+    return {};
+  }
+
+  // multiply with Factor::num without overflow or underflow
+  if (detail::const_check(Factor::num != 1)) {
+    constexpr auto max1 = detail::max_value<IntermediateRep>() /
+                          static_cast<IntermediateRep>(Factor::num);
+    if (count > max1) {
+      ec = 1;
+      return {};
+    }
+    constexpr auto min1 = std::numeric_limits<IntermediateRep>::lowest() /
+                          static_cast<IntermediateRep>(Factor::num);
+    if (count < min1) {
+      ec = 1;
+      return {};
+    }
+    count *= static_cast<IntermediateRep>(Factor::num);
+  }
+
+  // this can't go wrong, right? den>0 is checked earlier.
+  if (detail::const_check(Factor::den != 1)) {
+    using common_t = typename std::common_type<IntermediateRep, intmax_t>::type;
+    count /= static_cast<common_t>(Factor::den);
+  }
+
+  // convert to the to type, safely
+  using ToRep = typename To::rep;
+
+  const ToRep tocount = safe_float_conversion<ToRep>(count, ec);
+  if (ec) {
+    return {};
+  }
+  return To{tocount};
+}
+}  // namespace safe_duration_cast
+#endif
+
+// Prevents expansion of a preceding token as a function-style macro.
+// Usage: f FMT_NOMACRO()
+#define FMT_NOMACRO
+
+namespace detail {
+template <typename T = void> struct null {};
+inline null<> localtime_r FMT_NOMACRO(...) { return null<>(); }
+inline null<> localtime_s(...) { return null<>(); }
+inline null<> gmtime_r(...) { return null<>(); }
+inline null<> gmtime_s(...) { return null<>(); }
+
+inline const std::locale& get_classic_locale() {
+  static const auto& locale = std::locale::classic();
+  return locale;
+}
+
+template <typename CodeUnit> struct codecvt_result {
+  static constexpr const size_t max_size = 32;
+  CodeUnit buf[max_size];
+  CodeUnit* end;
+};
+template <typename CodeUnit>
+constexpr const size_t codecvt_result<CodeUnit>::max_size;
+
+template <typename CodeUnit>
+void write_codecvt(codecvt_result<CodeUnit>& out, string_view in_buf,
+                   const std::locale& loc) {
+#if FMT_CLANG_VERSION
+#  pragma clang diagnostic push
+#  pragma clang diagnostic ignored "-Wdeprecated"
+  auto& f = std::use_facet<std::codecvt<CodeUnit, char, std::mbstate_t>>(loc);
+#  pragma clang diagnostic pop
+#else
+  auto& f = std::use_facet<std::codecvt<CodeUnit, char, std::mbstate_t>>(loc);
+#endif
+  auto mb = std::mbstate_t();
+  const char* from_next = nullptr;
+  auto result = f.in(mb, in_buf.begin(), in_buf.end(), from_next,
+                     std::begin(out.buf), std::end(out.buf), out.end);
+  if (result != std::codecvt_base::ok)
+    FMT_THROW(format_error("failed to format time"));
+}
+
+template <typename OutputIt>
+auto write_encoded_tm_str(OutputIt out, string_view in, const std::locale& loc)
+    -> OutputIt {
+  if (detail::is_utf8() && loc != get_classic_locale()) {
+    // char16_t and char32_t codecvts are broken in MSVC (linkage errors) and
+    // gcc-4.
+#if FMT_MSC_VERSION != 0 || \
+    (defined(__GLIBCXX__) && !defined(_GLIBCXX_USE_DUAL_ABI))
+    // The _GLIBCXX_USE_DUAL_ABI macro is always defined in libstdc++ from gcc-5
+    // and newer.
+    using code_unit = wchar_t;
+#else
+    using code_unit = char32_t;
+#endif
+
+    using unit_t = codecvt_result<code_unit>;
+    unit_t unit;
+    write_codecvt(unit, in, loc);
+    // In UTF-8 is used one to four one-byte code units.
+    auto&& buf = basic_memory_buffer<char, unit_t::max_size * 4>();
+    for (code_unit* p = unit.buf; p != unit.end; ++p) {
+      uint32_t c = static_cast<uint32_t>(*p);
+      if (sizeof(code_unit) == 2 && c >= 0xd800 && c <= 0xdfff) {
+        // surrogate pair
+        ++p;
+        if (p == unit.end || (c & 0xfc00) != 0xd800 ||
+            (*p & 0xfc00) != 0xdc00) {
+          FMT_THROW(format_error("failed to format time"));
+        }
+        c = (c << 10) + static_cast<uint32_t>(*p) - 0x35fdc00;
+      }
+      if (c < 0x80) {
+        buf.push_back(static_cast<char>(c));
+      } else if (c < 0x800) {
+        buf.push_back(static_cast<char>(0xc0 | (c >> 6)));
+        buf.push_back(static_cast<char>(0x80 | (c & 0x3f)));
+      } else if ((c >= 0x800 && c <= 0xd7ff) || (c >= 0xe000 && c <= 0xffff)) {
+        buf.push_back(static_cast<char>(0xe0 | (c >> 12)));
+        buf.push_back(static_cast<char>(0x80 | ((c & 0xfff) >> 6)));
+        buf.push_back(static_cast<char>(0x80 | (c & 0x3f)));
+      } else if (c >= 0x10000 && c <= 0x10ffff) {
+        buf.push_back(static_cast<char>(0xf0 | (c >> 18)));
+        buf.push_back(static_cast<char>(0x80 | ((c & 0x3ffff) >> 12)));
+        buf.push_back(static_cast<char>(0x80 | ((c & 0xfff) >> 6)));
+        buf.push_back(static_cast<char>(0x80 | (c & 0x3f)));
+      } else {
+        FMT_THROW(format_error("failed to format time"));
+      }
+    }
+    return copy_str<char>(buf.data(), buf.data() + buf.size(), out);
+  }
+  return copy_str<char>(in.data(), in.data() + in.size(), out);
+}
+
+template <typename Char, typename OutputIt,
+          FMT_ENABLE_IF(!std::is_same<Char, char>::value)>
+auto write_tm_str(OutputIt out, string_view sv, const std::locale& loc)
+    -> OutputIt {
+  codecvt_result<Char> unit;
+  write_codecvt(unit, sv, loc);
+  return copy_str<Char>(unit.buf, unit.end, out);
+}
+
+template <typename Char, typename OutputIt,
+          FMT_ENABLE_IF(std::is_same<Char, char>::value)>
+auto write_tm_str(OutputIt out, string_view sv, const std::locale& loc)
+    -> OutputIt {
+  return write_encoded_tm_str(out, sv, loc);
+}
+
+template <typename Char>
+inline void do_write(buffer<Char>& buf, const std::tm& time,
+                     const std::locale& loc, char format, char modifier) {
+  auto&& format_buf = formatbuf<std::basic_streambuf<Char>>(buf);
+  auto&& os = std::basic_ostream<Char>(&format_buf);
+  os.imbue(loc);
+  using iterator = std::ostreambuf_iterator<Char>;
+  const auto& facet = std::use_facet<std::time_put<Char, iterator>>(loc);
+  auto end = facet.put(os, os, Char(' '), &time, format, modifier);
+  if (end.failed()) FMT_THROW(format_error("failed to format time"));
+}
+
+template <typename Char, typename OutputIt,
+          FMT_ENABLE_IF(!std::is_same<Char, char>::value)>
+auto write(OutputIt out, const std::tm& time, const std::locale& loc,
+           char format, char modifier = 0) -> OutputIt {
+  auto&& buf = get_buffer<Char>(out);
+  do_write<Char>(buf, time, loc, format, modifier);
+  return buf.out();
+}
+
+template <typename Char, typename OutputIt,
+          FMT_ENABLE_IF(std::is_same<Char, char>::value)>
+auto write(OutputIt out, const std::tm& time, const std::locale& loc,
+           char format, char modifier = 0) -> OutputIt {
+  auto&& buf = basic_memory_buffer<Char>();
+  do_write<char>(buf, time, loc, format, modifier);
+  return write_encoded_tm_str(out, string_view(buf.data(), buf.size()), loc);
+}
+
+}  // namespace detail
+
+FMT_MODULE_EXPORT_BEGIN
+
+/**
+  Converts given time since epoch as ``std::time_t`` value into calendar time,
+  expressed in local time. Unlike ``std::localtime``, this function is
+  thread-safe on most platforms.
+ */
+inline std::tm localtime(std::time_t time) {
+  struct dispatcher {
+    std::time_t time_;
+    std::tm tm_;
+
+    dispatcher(std::time_t t) : time_(t) {}
+
+    bool run() {
+      using namespace fmt::detail;
+      return handle(localtime_r(&time_, &tm_));
+    }
+
+    bool handle(std::tm* tm) { return tm != nullptr; }
+
+    bool handle(detail::null<>) {
+      using namespace fmt::detail;
+      return fallback(localtime_s(&tm_, &time_));
+    }
+
+    bool fallback(int res) { return res == 0; }
+
+#if !FMT_MSC_VERSION
+    bool fallback(detail::null<>) {
+      using namespace fmt::detail;
+      std::tm* tm = std::localtime(&time_);
+      if (tm) tm_ = *tm;
+      return tm != nullptr;
+    }
+#endif
+  };
+  dispatcher lt(time);
+  // Too big time values may be unsupported.
+  if (!lt.run()) FMT_THROW(format_error("time_t value out of range"));
+  return lt.tm_;
+}
+
+inline std::tm localtime(
+    std::chrono::time_point<std::chrono::system_clock> time_point) {
+  return localtime(std::chrono::system_clock::to_time_t(time_point));
+}
+
+/**
+  Converts given time since epoch as ``std::time_t`` value into calendar time,
+  expressed in Coordinated Universal Time (UTC). Unlike ``std::gmtime``, this
+  function is thread-safe on most platforms.
+ */
+inline std::tm gmtime(std::time_t time) {
+  struct dispatcher {
+    std::time_t time_;
+    std::tm tm_;
+
+    dispatcher(std::time_t t) : time_(t) {}
+
+    bool run() {
+      using namespace fmt::detail;
+      return handle(gmtime_r(&time_, &tm_));
+    }
+
+    bool handle(std::tm* tm) { return tm != nullptr; }
+
+    bool handle(detail::null<>) {
+      using namespace fmt::detail;
+      return fallback(gmtime_s(&tm_, &time_));
+    }
+
+    bool fallback(int res) { return res == 0; }
+
+#if !FMT_MSC_VERSION
+    bool fallback(detail::null<>) {
+      std::tm* tm = std::gmtime(&time_);
+      if (tm) tm_ = *tm;
+      return tm != nullptr;
+    }
+#endif
+  };
+  dispatcher gt(time);
+  // Too big time values may be unsupported.
+  if (!gt.run()) FMT_THROW(format_error("time_t value out of range"));
+  return gt.tm_;
+}
+
+inline std::tm gmtime(
+    std::chrono::time_point<std::chrono::system_clock> time_point) {
+  return gmtime(std::chrono::system_clock::to_time_t(time_point));
+}
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+// Writes two-digit numbers a, b and c separated by sep to buf.
+// The method by Pavel Novikov based on
+// https://johnnylee-sde.github.io/Fast-unsigned-integer-to-time-string/.
+inline void write_digit2_separated(char* buf, unsigned a, unsigned b,
+                                   unsigned c, char sep) {
+  unsigned long long digits =
+      a | (b << 24) | (static_cast<unsigned long long>(c) << 48);
+  // Convert each value to BCD.
+  // We have x = a * 10 + b and we want to convert it to BCD y = a * 16 + b.
+  // The difference is
+  //   y - x = a * 6
+  // a can be found from x:
+  //   a = floor(x / 10)
+  // then
+  //   y = x + a * 6 = x + floor(x / 10) * 6
+  // floor(x / 10) is (x * 205) >> 11 (needs 16 bits).
+  digits += (((digits * 205) >> 11) & 0x000f00000f00000f) * 6;
+  // Put low nibbles to high bytes and high nibbles to low bytes.
+  digits = ((digits & 0x00f00000f00000f0) >> 4) |
+           ((digits & 0x000f00000f00000f) << 8);
+  auto usep = static_cast<unsigned long long>(sep);
+  // Add ASCII '0' to each digit byte and insert separators.
+  digits |= 0x3030003030003030 | (usep << 16) | (usep << 40);
+
+  constexpr const size_t len = 8;
+  if (const_check(is_big_endian())) {
+    char tmp[len];
+    std::memcpy(tmp, &digits, len);
+    std::reverse_copy(tmp, tmp + len, buf);
+  } else {
+    std::memcpy(buf, &digits, len);
+  }
+}
+
+template <typename Period> FMT_CONSTEXPR inline const char* get_units() {
+  if (std::is_same<Period, std::atto>::value) return "as";
+  if (std::is_same<Period, std::femto>::value) return "fs";
+  if (std::is_same<Period, std::pico>::value) return "ps";
+  if (std::is_same<Period, std::nano>::value) return "ns";
+  if (std::is_same<Period, std::micro>::value) return "µs";
+  if (std::is_same<Period, std::milli>::value) return "ms";
+  if (std::is_same<Period, std::centi>::value) return "cs";
+  if (std::is_same<Period, std::deci>::value) return "ds";
+  if (std::is_same<Period, std::ratio<1>>::value) return "s";
+  if (std::is_same<Period, std::deca>::value) return "das";
+  if (std::is_same<Period, std::hecto>::value) return "hs";
+  if (std::is_same<Period, std::kilo>::value) return "ks";
+  if (std::is_same<Period, std::mega>::value) return "Ms";
+  if (std::is_same<Period, std::giga>::value) return "Gs";
+  if (std::is_same<Period, std::tera>::value) return "Ts";
+  if (std::is_same<Period, std::peta>::value) return "Ps";
+  if (std::is_same<Period, std::exa>::value) return "Es";
+  if (std::is_same<Period, std::ratio<60>>::value) return "m";
+  if (std::is_same<Period, std::ratio<3600>>::value) return "h";
+  return nullptr;
+}
+
+enum class numeric_system {
+  standard,
+  // Alternative numeric system, e.g. 十二 instead of 12 in ja_JP locale.
+  alternative
+};
+
+// Parses a put_time-like format string and invokes handler actions.
+template <typename Char, typename Handler>
+FMT_CONSTEXPR const Char* parse_chrono_format(const Char* begin,
+                                              const Char* end,
+                                              Handler&& handler) {
+  auto ptr = begin;
+  while (ptr != end) {
+    auto c = *ptr;
+    if (c == '}') break;
+    if (c != '%') {
+      ++ptr;
+      continue;
+    }
+    if (begin != ptr) handler.on_text(begin, ptr);
+    ++ptr;  // consume '%'
+    if (ptr == end) FMT_THROW(format_error("invalid format"));
+    c = *ptr++;
+    switch (c) {
+    case '%':
+      handler.on_text(ptr - 1, ptr);
+      break;
+    case 'n': {
+      const Char newline[] = {'\n'};
+      handler.on_text(newline, newline + 1);
+      break;
+    }
+    case 't': {
+      const Char tab[] = {'\t'};
+      handler.on_text(tab, tab + 1);
+      break;
+    }
+    // Year:
+    case 'Y':
+      handler.on_year(numeric_system::standard);
+      break;
+    case 'y':
+      handler.on_short_year(numeric_system::standard);
+      break;
+    case 'C':
+      handler.on_century(numeric_system::standard);
+      break;
+    case 'G':
+      handler.on_iso_week_based_year();
+      break;
+    case 'g':
+      handler.on_iso_week_based_short_year();
+      break;
+    // Day of the week:
+    case 'a':
+      handler.on_abbr_weekday();
+      break;
+    case 'A':
+      handler.on_full_weekday();
+      break;
+    case 'w':
+      handler.on_dec0_weekday(numeric_system::standard);
+      break;
+    case 'u':
+      handler.on_dec1_weekday(numeric_system::standard);
+      break;
+    // Month:
+    case 'b':
+    case 'h':
+      handler.on_abbr_month();
+      break;
+    case 'B':
+      handler.on_full_month();
+      break;
+    case 'm':
+      handler.on_dec_month(numeric_system::standard);
+      break;
+    // Day of the year/month:
+    case 'U':
+      handler.on_dec0_week_of_year(numeric_system::standard);
+      break;
+    case 'W':
+      handler.on_dec1_week_of_year(numeric_system::standard);
+      break;
+    case 'V':
+      handler.on_iso_week_of_year(numeric_system::standard);
+      break;
+    case 'j':
+      handler.on_day_of_year();
+      break;
+    case 'd':
+      handler.on_day_of_month(numeric_system::standard);
+      break;
+    case 'e':
+      handler.on_day_of_month_space(numeric_system::standard);
+      break;
+    // Hour, minute, second:
+    case 'H':
+      handler.on_24_hour(numeric_system::standard);
+      break;
+    case 'I':
+      handler.on_12_hour(numeric_system::standard);
+      break;
+    case 'M':
+      handler.on_minute(numeric_system::standard);
+      break;
+    case 'S':
+      handler.on_second(numeric_system::standard);
+      break;
+    // Other:
+    case 'c':
+      handler.on_datetime(numeric_system::standard);
+      break;
+    case 'x':
+      handler.on_loc_date(numeric_system::standard);
+      break;
+    case 'X':
+      handler.on_loc_time(numeric_system::standard);
+      break;
+    case 'D':
+      handler.on_us_date();
+      break;
+    case 'F':
+      handler.on_iso_date();
+      break;
+    case 'r':
+      handler.on_12_hour_time();
+      break;
+    case 'R':
+      handler.on_24_hour_time();
+      break;
+    case 'T':
+      handler.on_iso_time();
+      break;
+    case 'p':
+      handler.on_am_pm();
+      break;
+    case 'Q':
+      handler.on_duration_value();
+      break;
+    case 'q':
+      handler.on_duration_unit();
+      break;
+    case 'z':
+      handler.on_utc_offset();
+      break;
+    case 'Z':
+      handler.on_tz_name();
+      break;
+    // Alternative representation:
+    case 'E': {
+      if (ptr == end) FMT_THROW(format_error("invalid format"));
+      c = *ptr++;
+      switch (c) {
+      case 'Y':
+        handler.on_year(numeric_system::alternative);
+        break;
+      case 'y':
+        handler.on_offset_year();
+        break;
+      case 'C':
+        handler.on_century(numeric_system::alternative);
+        break;
+      case 'c':
+        handler.on_datetime(numeric_system::alternative);
+        break;
+      case 'x':
+        handler.on_loc_date(numeric_system::alternative);
+        break;
+      case 'X':
+        handler.on_loc_time(numeric_system::alternative);
+        break;
+      default:
+        FMT_THROW(format_error("invalid format"));
+      }
+      break;
+    }
+    case 'O':
+      if (ptr == end) FMT_THROW(format_error("invalid format"));
+      c = *ptr++;
+      switch (c) {
+      case 'y':
+        handler.on_short_year(numeric_system::alternative);
+        break;
+      case 'm':
+        handler.on_dec_month(numeric_system::alternative);
+        break;
+      case 'U':
+        handler.on_dec0_week_of_year(numeric_system::alternative);
+        break;
+      case 'W':
+        handler.on_dec1_week_of_year(numeric_system::alternative);
+        break;
+      case 'V':
+        handler.on_iso_week_of_year(numeric_system::alternative);
+        break;
+      case 'd':
+        handler.on_day_of_month(numeric_system::alternative);
+        break;
+      case 'e':
+        handler.on_day_of_month_space(numeric_system::alternative);
+        break;
+      case 'w':
+        handler.on_dec0_weekday(numeric_system::alternative);
+        break;
+      case 'u':
+        handler.on_dec1_weekday(numeric_system::alternative);
+        break;
+      case 'H':
+        handler.on_24_hour(numeric_system::alternative);
+        break;
+      case 'I':
+        handler.on_12_hour(numeric_system::alternative);
+        break;
+      case 'M':
+        handler.on_minute(numeric_system::alternative);
+        break;
+      case 'S':
+        handler.on_second(numeric_system::alternative);
+        break;
+      default:
+        FMT_THROW(format_error("invalid format"));
+      }
+      break;
+    default:
+      FMT_THROW(format_error("invalid format"));
+    }
+    begin = ptr;
+  }
+  if (begin != ptr) handler.on_text(begin, ptr);
+  return ptr;
+}
+
+template <typename Derived> struct null_chrono_spec_handler {
+  FMT_CONSTEXPR void unsupported() {
+    static_cast<Derived*>(this)->unsupported();
+  }
+  FMT_CONSTEXPR void on_year(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_short_year(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_offset_year() { unsupported(); }
+  FMT_CONSTEXPR void on_century(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_iso_week_based_year() { unsupported(); }
+  FMT_CONSTEXPR void on_iso_week_based_short_year() { unsupported(); }
+  FMT_CONSTEXPR void on_abbr_weekday() { unsupported(); }
+  FMT_CONSTEXPR void on_full_weekday() { unsupported(); }
+  FMT_CONSTEXPR void on_dec0_weekday(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_dec1_weekday(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_abbr_month() { unsupported(); }
+  FMT_CONSTEXPR void on_full_month() { unsupported(); }
+  FMT_CONSTEXPR void on_dec_month(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_dec0_week_of_year(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_dec1_week_of_year(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_iso_week_of_year(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_day_of_year() { unsupported(); }
+  FMT_CONSTEXPR void on_day_of_month(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_day_of_month_space(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_24_hour(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_12_hour(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_minute(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_second(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_datetime(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_loc_date(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_loc_time(numeric_system) { unsupported(); }
+  FMT_CONSTEXPR void on_us_date() { unsupported(); }
+  FMT_CONSTEXPR void on_iso_date() { unsupported(); }
+  FMT_CONSTEXPR void on_12_hour_time() { unsupported(); }
+  FMT_CONSTEXPR void on_24_hour_time() { unsupported(); }
+  FMT_CONSTEXPR void on_iso_time() { unsupported(); }
+  FMT_CONSTEXPR void on_am_pm() { unsupported(); }
+  FMT_CONSTEXPR void on_duration_value() { unsupported(); }
+  FMT_CONSTEXPR void on_duration_unit() { unsupported(); }
+  FMT_CONSTEXPR void on_utc_offset() { unsupported(); }
+  FMT_CONSTEXPR void on_tz_name() { unsupported(); }
+};
+
+struct tm_format_checker : null_chrono_spec_handler<tm_format_checker> {
+  FMT_NORETURN void unsupported() { FMT_THROW(format_error("no format")); }
+
+  template <typename Char>
+  FMT_CONSTEXPR void on_text(const Char*, const Char*) {}
+  FMT_CONSTEXPR void on_year(numeric_system) {}
+  FMT_CONSTEXPR void on_short_year(numeric_system) {}
+  FMT_CONSTEXPR void on_offset_year() {}
+  FMT_CONSTEXPR void on_century(numeric_system) {}
+  FMT_CONSTEXPR void on_iso_week_based_year() {}
+  FMT_CONSTEXPR void on_iso_week_based_short_year() {}
+  FMT_CONSTEXPR void on_abbr_weekday() {}
+  FMT_CONSTEXPR void on_full_weekday() {}
+  FMT_CONSTEXPR void on_dec0_weekday(numeric_system) {}
+  FMT_CONSTEXPR void on_dec1_weekday(numeric_system) {}
+  FMT_CONSTEXPR void on_abbr_month() {}
+  FMT_CONSTEXPR void on_full_month() {}
+  FMT_CONSTEXPR void on_dec_month(numeric_system) {}
+  FMT_CONSTEXPR void on_dec0_week_of_year(numeric_system) {}
+  FMT_CONSTEXPR void on_dec1_week_of_year(numeric_system) {}
+  FMT_CONSTEXPR void on_iso_week_of_year(numeric_system) {}
+  FMT_CONSTEXPR void on_day_of_year() {}
+  FMT_CONSTEXPR void on_day_of_month(numeric_system) {}
+  FMT_CONSTEXPR void on_day_of_month_space(numeric_system) {}
+  FMT_CONSTEXPR void on_24_hour(numeric_system) {}
+  FMT_CONSTEXPR void on_12_hour(numeric_system) {}
+  FMT_CONSTEXPR void on_minute(numeric_system) {}
+  FMT_CONSTEXPR void on_second(numeric_system) {}
+  FMT_CONSTEXPR void on_datetime(numeric_system) {}
+  FMT_CONSTEXPR void on_loc_date(numeric_system) {}
+  FMT_CONSTEXPR void on_loc_time(numeric_system) {}
+  FMT_CONSTEXPR void on_us_date() {}
+  FMT_CONSTEXPR void on_iso_date() {}
+  FMT_CONSTEXPR void on_12_hour_time() {}
+  FMT_CONSTEXPR void on_24_hour_time() {}
+  FMT_CONSTEXPR void on_iso_time() {}
+  FMT_CONSTEXPR void on_am_pm() {}
+  FMT_CONSTEXPR void on_utc_offset() {}
+  FMT_CONSTEXPR void on_tz_name() {}
+};
+
+inline const char* tm_wday_full_name(int wday) {
+  static constexpr const char* full_name_list[] = {
+      "Sunday",   "Monday", "Tuesday", "Wednesday",
+      "Thursday", "Friday", "Saturday"};
+  return wday >= 0 && wday <= 6 ? full_name_list[wday] : "?";
+}
+inline const char* tm_wday_short_name(int wday) {
+  static constexpr const char* short_name_list[] = {"Sun", "Mon", "Tue", "Wed",
+                                                    "Thu", "Fri", "Sat"};
+  return wday >= 0 && wday <= 6 ? short_name_list[wday] : "???";
+}
+
+inline const char* tm_mon_full_name(int mon) {
+  static constexpr const char* full_name_list[] = {
+      "January", "February", "March",     "April",   "May",      "June",
+      "July",    "August",   "September", "October", "November", "December"};
+  return mon >= 0 && mon <= 11 ? full_name_list[mon] : "?";
+}
+inline const char* tm_mon_short_name(int mon) {
+  static constexpr const char* short_name_list[] = {
+      "Jan", "Feb", "Mar", "Apr", "May", "Jun",
+      "Jul", "Aug", "Sep", "Oct", "Nov", "Dec",
+  };
+  return mon >= 0 && mon <= 11 ? short_name_list[mon] : "???";
+}
+
+template <typename T, typename = void>
+struct has_member_data_tm_gmtoff : std::false_type {};
+template <typename T>
+struct has_member_data_tm_gmtoff<T, void_t<decltype(T::tm_gmtoff)>>
+    : std::true_type {};
+
+template <typename T, typename = void>
+struct has_member_data_tm_zone : std::false_type {};
+template <typename T>
+struct has_member_data_tm_zone<T, void_t<decltype(T::tm_zone)>>
+    : std::true_type {};
+
+#if FMT_USE_TZSET
+inline void tzset_once() {
+  static bool init = []() -> bool {
+    _tzset();
+    return true;
+  }();
+  ignore_unused(init);
+}
+#endif
+
+template <typename OutputIt, typename Char> class tm_writer {
+ private:
+  static constexpr int days_per_week = 7;
+
+  const std::locale& loc_;
+  const bool is_classic_;
+  OutputIt out_;
+  const std::tm& tm_;
+
+  auto tm_sec() const noexcept -> int {
+    FMT_ASSERT(tm_.tm_sec >= 0 && tm_.tm_sec <= 61, "");
+    return tm_.tm_sec;
+  }
+  auto tm_min() const noexcept -> int {
+    FMT_ASSERT(tm_.tm_min >= 0 && tm_.tm_min <= 59, "");
+    return tm_.tm_min;
+  }
+  auto tm_hour() const noexcept -> int {
+    FMT_ASSERT(tm_.tm_hour >= 0 && tm_.tm_hour <= 23, "");
+    return tm_.tm_hour;
+  }
+  auto tm_mday() const noexcept -> int {
+    FMT_ASSERT(tm_.tm_mday >= 1 && tm_.tm_mday <= 31, "");
+    return tm_.tm_mday;
+  }
+  auto tm_mon() const noexcept -> int {
+    FMT_ASSERT(tm_.tm_mon >= 0 && tm_.tm_mon <= 11, "");
+    return tm_.tm_mon;
+  }
+  auto tm_year() const noexcept -> long long { return 1900ll + tm_.tm_year; }
+  auto tm_wday() const noexcept -> int {
+    FMT_ASSERT(tm_.tm_wday >= 0 && tm_.tm_wday <= 6, "");
+    return tm_.tm_wday;
+  }
+  auto tm_yday() const noexcept -> int {
+    FMT_ASSERT(tm_.tm_yday >= 0 && tm_.tm_yday <= 365, "");
+    return tm_.tm_yday;
+  }
+
+  auto tm_hour12() const noexcept -> int {
+    const auto h = tm_hour();
+    const auto z = h < 12 ? h : h - 12;
+    return z == 0 ? 12 : z;
+  }
+
+  // POSIX and the C Standard are unclear or inconsistent about what %C and %y
+  // do if the year is negative or exceeds 9999. Use the convention that %C
+  // concatenated with %y yields the same output as %Y, and that %Y contains at
+  // least 4 characters, with more only if necessary.
+  auto split_year_lower(long long year) const noexcept -> int {
+    auto l = year % 100;
+    if (l < 0) l = -l;  // l in [0, 99]
+    return static_cast<int>(l);
+  }
+
+  // Algorithm:
+  // https://en.wikipedia.org/wiki/ISO_week_date#Calculating_the_week_number_from_a_month_and_day_of_the_month_or_ordinal_date
+  auto iso_year_weeks(long long curr_year) const noexcept -> int {
+    const auto prev_year = curr_year - 1;
+    const auto curr_p =
+        (curr_year + curr_year / 4 - curr_year / 100 + curr_year / 400) %
+        days_per_week;
+    const auto prev_p =
+        (prev_year + prev_year / 4 - prev_year / 100 + prev_year / 400) %
+        days_per_week;
+    return 52 + ((curr_p == 4 || prev_p == 3) ? 1 : 0);
+  }
+  auto iso_week_num(int tm_yday, int tm_wday) const noexcept -> int {
+    return (tm_yday + 11 - (tm_wday == 0 ? days_per_week : tm_wday)) /
+           days_per_week;
+  }
+  auto tm_iso_week_year() const noexcept -> long long {
+    const auto year = tm_year();
+    const auto w = iso_week_num(tm_yday(), tm_wday());
+    if (w < 1) return year - 1;
+    if (w > iso_year_weeks(year)) return year + 1;
+    return year;
+  }
+  auto tm_iso_week_of_year() const noexcept -> int {
+    const auto year = tm_year();
+    const auto w = iso_week_num(tm_yday(), tm_wday());
+    if (w < 1) return iso_year_weeks(year - 1);
+    if (w > iso_year_weeks(year)) return 1;
+    return w;
+  }
+
+  void write1(int value) {
+    *out_++ = static_cast<char>('0' + to_unsigned(value) % 10);
+  }
+  void write2(int value) {
+    const char* d = digits2(to_unsigned(value) % 100);
+    *out_++ = *d++;
+    *out_++ = *d;
+  }
+
+  void write_year_extended(long long year) {
+    // At least 4 characters.
+    int width = 4;
+    if (year < 0) {
+      *out_++ = '-';
+      year = 0 - year;
+      --width;
+    }
+    uint32_or_64_or_128_t<long long> n = to_unsigned(year);
+    const int num_digits = count_digits(n);
+    if (width > num_digits) out_ = std::fill_n(out_, width - num_digits, '0');
+    out_ = format_decimal<Char>(out_, n, num_digits).end;
+  }
+  void write_year(long long year) {
+    if (year >= 0 && year < 10000) {
+      write2(static_cast<int>(year / 100));
+      write2(static_cast<int>(year % 100));
+    } else {
+      write_year_extended(year);
+    }
+  }
+
+  void write_utc_offset(long offset) {
+    if (offset < 0) {
+      *out_++ = '-';
+      offset = -offset;
+    } else {
+      *out_++ = '+';
+    }
+    offset /= 60;
+    write2(static_cast<int>(offset / 60));
+    write2(static_cast<int>(offset % 60));
+  }
+  template <typename T, FMT_ENABLE_IF(has_member_data_tm_gmtoff<T>::value)>
+  void format_utc_offset_impl(const T& tm) {
+    write_utc_offset(tm.tm_gmtoff);
+  }
+  template <typename T, FMT_ENABLE_IF(!has_member_data_tm_gmtoff<T>::value)>
+  void format_utc_offset_impl(const T& tm) {
+#if defined(_WIN32) && defined(_UCRT)
+#  if FMT_USE_TZSET
+    tzset_once();
+#  endif
+    long offset = 0;
+    _get_timezone(&offset);
+    if (tm.tm_isdst) {
+      long dstbias = 0;
+      _get_dstbias(&dstbias);
+      offset += dstbias;
+    }
+    write_utc_offset(-offset);
+#else
+    ignore_unused(tm);
+    format_localized('z');
+#endif
+  }
+
+  template <typename T, FMT_ENABLE_IF(has_member_data_tm_zone<T>::value)>
+  void format_tz_name_impl(const T& tm) {
+    if (is_classic_)
+      out_ = write_tm_str<Char>(out_, tm.tm_zone, loc_);
+    else
+      format_localized('Z');
+  }
+  template <typename T, FMT_ENABLE_IF(!has_member_data_tm_zone<T>::value)>
+  void format_tz_name_impl(const T&) {
+    format_localized('Z');
+  }
+
+  void format_localized(char format, char modifier = 0) {
+    out_ = write<Char>(out_, tm_, loc_, format, modifier);
+  }
+
+ public:
+  tm_writer(const std::locale& loc, OutputIt out, const std::tm& tm)
+      : loc_(loc),
+        is_classic_(loc_ == get_classic_locale()),
+        out_(out),
+        tm_(tm) {}
+
+  OutputIt out() const { return out_; }
+
+  FMT_CONSTEXPR void on_text(const Char* begin, const Char* end) {
+    out_ = copy_str<Char>(begin, end, out_);
+  }
+
+  void on_abbr_weekday() {
+    if (is_classic_)
+      out_ = write(out_, tm_wday_short_name(tm_wday()));
+    else
+      format_localized('a');
+  }
+  void on_full_weekday() {
+    if (is_classic_)
+      out_ = write(out_, tm_wday_full_name(tm_wday()));
+    else
+      format_localized('A');
+  }
+  void on_dec0_weekday(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard) return write1(tm_wday());
+    format_localized('w', 'O');
+  }
+  void on_dec1_weekday(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard) {
+      auto wday = tm_wday();
+      write1(wday == 0 ? days_per_week : wday);
+    } else {
+      format_localized('u', 'O');
+    }
+  }
+
+  void on_abbr_month() {
+    if (is_classic_)
+      out_ = write(out_, tm_mon_short_name(tm_mon()));
+    else
+      format_localized('b');
+  }
+  void on_full_month() {
+    if (is_classic_)
+      out_ = write(out_, tm_mon_full_name(tm_mon()));
+    else
+      format_localized('B');
+  }
+
+  void on_datetime(numeric_system ns) {
+    if (is_classic_) {
+      on_abbr_weekday();
+      *out_++ = ' ';
+      on_abbr_month();
+      *out_++ = ' ';
+      on_day_of_month_space(numeric_system::standard);
+      *out_++ = ' ';
+      on_iso_time();
+      *out_++ = ' ';
+      on_year(numeric_system::standard);
+    } else {
+      format_localized('c', ns == numeric_system::standard ? '\0' : 'E');
+    }
+  }
+  void on_loc_date(numeric_system ns) {
+    if (is_classic_)
+      on_us_date();
+    else
+      format_localized('x', ns == numeric_system::standard ? '\0' : 'E');
+  }
+  void on_loc_time(numeric_system ns) {
+    if (is_classic_)
+      on_iso_time();
+    else
+      format_localized('X', ns == numeric_system::standard ? '\0' : 'E');
+  }
+  void on_us_date() {
+    char buf[8];
+    write_digit2_separated(buf, to_unsigned(tm_mon() + 1),
+                           to_unsigned(tm_mday()),
+                           to_unsigned(split_year_lower(tm_year())), '/');
+    out_ = copy_str<Char>(std::begin(buf), std::end(buf), out_);
+  }
+  void on_iso_date() {
+    auto year = tm_year();
+    char buf[10];
+    size_t offset = 0;
+    if (year >= 0 && year < 10000) {
+      copy2(buf, digits2(static_cast<size_t>(year / 100)));
+    } else {
+      offset = 4;
+      write_year_extended(year);
+      year = 0;
+    }
+    write_digit2_separated(buf + 2, static_cast<unsigned>(year % 100),
+                           to_unsigned(tm_mon() + 1), to_unsigned(tm_mday()),
+                           '-');
+    out_ = copy_str<Char>(std::begin(buf) + offset, std::end(buf), out_);
+  }
+
+  void on_utc_offset() { format_utc_offset_impl(tm_); }
+  void on_tz_name() { format_tz_name_impl(tm_); }
+
+  void on_year(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard)
+      return write_year(tm_year());
+    format_localized('Y', 'E');
+  }
+  void on_short_year(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard)
+      return write2(split_year_lower(tm_year()));
+    format_localized('y', 'O');
+  }
+  void on_offset_year() {
+    if (is_classic_) return write2(split_year_lower(tm_year()));
+    format_localized('y', 'E');
+  }
+
+  void on_century(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard) {
+      auto year = tm_year();
+      auto upper = year / 100;
+      if (year >= -99 && year < 0) {
+        // Zero upper on negative year.
+        *out_++ = '-';
+        *out_++ = '0';
+      } else if (upper >= 0 && upper < 100) {
+        write2(static_cast<int>(upper));
+      } else {
+        out_ = write<Char>(out_, upper);
+      }
+    } else {
+      format_localized('C', 'E');
+    }
+  }
+
+  void on_dec_month(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard)
+      return write2(tm_mon() + 1);
+    format_localized('m', 'O');
+  }
+
+  void on_dec0_week_of_year(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard)
+      return write2((tm_yday() + days_per_week - tm_wday()) / days_per_week);
+    format_localized('U', 'O');
+  }
+  void on_dec1_week_of_year(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard) {
+      auto wday = tm_wday();
+      write2((tm_yday() + days_per_week -
+              (wday == 0 ? (days_per_week - 1) : (wday - 1))) /
+             days_per_week);
+    } else {
+      format_localized('W', 'O');
+    }
+  }
+  void on_iso_week_of_year(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard)
+      return write2(tm_iso_week_of_year());
+    format_localized('V', 'O');
+  }
+
+  void on_iso_week_based_year() { write_year(tm_iso_week_year()); }
+  void on_iso_week_based_short_year() {
+    write2(split_year_lower(tm_iso_week_year()));
+  }
+
+  void on_day_of_year() {
+    auto yday = tm_yday() + 1;
+    write1(yday / 100);
+    write2(yday % 100);
+  }
+  void on_day_of_month(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard) return write2(tm_mday());
+    format_localized('d', 'O');
+  }
+  void on_day_of_month_space(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard) {
+      auto mday = to_unsigned(tm_mday()) % 100;
+      const char* d2 = digits2(mday);
+      *out_++ = mday < 10 ? ' ' : d2[0];
+      *out_++ = d2[1];
+    } else {
+      format_localized('e', 'O');
+    }
+  }
+
+  void on_24_hour(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard) return write2(tm_hour());
+    format_localized('H', 'O');
+  }
+  void on_12_hour(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard)
+      return write2(tm_hour12());
+    format_localized('I', 'O');
+  }
+  void on_minute(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard) return write2(tm_min());
+    format_localized('M', 'O');
+  }
+  void on_second(numeric_system ns) {
+    if (is_classic_ || ns == numeric_system::standard) return write2(tm_sec());
+    format_localized('S', 'O');
+  }
+
+  void on_12_hour_time() {
+    if (is_classic_) {
+      char buf[8];
+      write_digit2_separated(buf, to_unsigned(tm_hour12()),
+                             to_unsigned(tm_min()), to_unsigned(tm_sec()), ':');
+      out_ = copy_str<Char>(std::begin(buf), std::end(buf), out_);
+      *out_++ = ' ';
+      on_am_pm();
+    } else {
+      format_localized('r');
+    }
+  }
+  void on_24_hour_time() {
+    write2(tm_hour());
+    *out_++ = ':';
+    write2(tm_min());
+  }
+  void on_iso_time() {
+    char buf[8];
+    write_digit2_separated(buf, to_unsigned(tm_hour()), to_unsigned(tm_min()),
+                           to_unsigned(tm_sec()), ':');
+    out_ = copy_str<Char>(std::begin(buf), std::end(buf), out_);
+  }
+
+  void on_am_pm() {
+    if (is_classic_) {
+      *out_++ = tm_hour() < 12 ? 'A' : 'P';
+      *out_++ = 'M';
+    } else {
+      format_localized('p');
+    }
+  }
+
+  // These apply to chrono durations but not tm.
+  void on_duration_value() {}
+  void on_duration_unit() {}
+};
+
+struct chrono_format_checker : null_chrono_spec_handler<chrono_format_checker> {
+  FMT_NORETURN void unsupported() { FMT_THROW(format_error("no date")); }
+
+  template <typename Char>
+  FMT_CONSTEXPR void on_text(const Char*, const Char*) {}
+  FMT_CONSTEXPR void on_24_hour(numeric_system) {}
+  FMT_CONSTEXPR void on_12_hour(numeric_system) {}
+  FMT_CONSTEXPR void on_minute(numeric_system) {}
+  FMT_CONSTEXPR void on_second(numeric_system) {}
+  FMT_CONSTEXPR void on_12_hour_time() {}
+  FMT_CONSTEXPR void on_24_hour_time() {}
+  FMT_CONSTEXPR void on_iso_time() {}
+  FMT_CONSTEXPR void on_am_pm() {}
+  FMT_CONSTEXPR void on_duration_value() {}
+  FMT_CONSTEXPR void on_duration_unit() {}
+};
+
+template <typename T, FMT_ENABLE_IF(std::is_integral<T>::value)>
+inline bool isfinite(T) {
+  return true;
+}
+
+// Converts value to Int and checks that it's in the range [0, upper).
+template <typename T, typename Int, FMT_ENABLE_IF(std::is_integral<T>::value)>
+inline Int to_nonnegative_int(T value, Int upper) {
+  FMT_ASSERT(std::is_unsigned<Int>::value ||
+             (value >= 0 && to_unsigned(value) <= to_unsigned(upper)),
+             "invalid value");
+  (void)upper;
+  return static_cast<Int>(value);
+}
+template <typename T, typename Int, FMT_ENABLE_IF(!std::is_integral<T>::value)>
+inline Int to_nonnegative_int(T value, Int upper) {
+  if (value < 0 || value > static_cast<T>(upper))
+    FMT_THROW(format_error("invalid value"));
+  return static_cast<Int>(value);
+}
+
+template <typename T, FMT_ENABLE_IF(std::is_integral<T>::value)>
+inline T mod(T x, int y) {
+  return x % static_cast<T>(y);
+}
+template <typename T, FMT_ENABLE_IF(std::is_floating_point<T>::value)>
+inline T mod(T x, int y) {
+  return std::fmod(x, static_cast<T>(y));
+}
+
+// If T is an integral type, maps T to its unsigned counterpart, otherwise
+// leaves it unchanged (unlike std::make_unsigned).
+template <typename T, bool INTEGRAL = std::is_integral<T>::value>
+struct make_unsigned_or_unchanged {
+  using type = T;
+};
+
+template <typename T> struct make_unsigned_or_unchanged<T, true> {
+  using type = typename std::make_unsigned<T>::type;
+};
+
+#if FMT_SAFE_DURATION_CAST
+// throwing version of safe_duration_cast
+template <typename To, typename FromRep, typename FromPeriod>
+To fmt_safe_duration_cast(std::chrono::duration<FromRep, FromPeriod> from) {
+  int ec;
+  To to = safe_duration_cast::safe_duration_cast<To>(from, ec);
+  if (ec) FMT_THROW(format_error("cannot format duration"));
+  return to;
+}
+#endif
+
+template <typename Rep, typename Period,
+          FMT_ENABLE_IF(std::is_integral<Rep>::value)>
+inline std::chrono::duration<Rep, std::milli> get_milliseconds(
+    std::chrono::duration<Rep, Period> d) {
+  // this may overflow and/or the result may not fit in the
+  // target type.
+#if FMT_SAFE_DURATION_CAST
+  using CommonSecondsType =
+      typename std::common_type<decltype(d), std::chrono::seconds>::type;
+  const auto d_as_common = fmt_safe_duration_cast<CommonSecondsType>(d);
+  const auto d_as_whole_seconds =
+      fmt_safe_duration_cast<std::chrono::seconds>(d_as_common);
+  // this conversion should be nonproblematic
+  const auto diff = d_as_common - d_as_whole_seconds;
+  const auto ms =
+      fmt_safe_duration_cast<std::chrono::duration<Rep, std::milli>>(diff);
+  return ms;
+#else
+  auto s = std::chrono::duration_cast<std::chrono::seconds>(d);
+  return std::chrono::duration_cast<std::chrono::milliseconds>(d - s);
+#endif
+}
+
+// Counts the number of fractional digits in the range [0, 18] according to the
+// C++20 spec. If more than 18 fractional digits are required then returns 6 for
+// microseconds precision.
+template <long long Num, long long Den, int N = 0,
+          bool Enabled = (N < 19) && (Num <= max_value<long long>() / 10)>
+struct count_fractional_digits {
+  static constexpr int value =
+      Num % Den == 0 ? N : count_fractional_digits<Num * 10, Den, N + 1>::value;
+};
+
+// Base case that doesn't instantiate any more templates
+// in order to avoid overflow.
+template <long long Num, long long Den, int N>
+struct count_fractional_digits<Num, Den, N, false> {
+  static constexpr int value = (Num % Den == 0) ? N : 6;
+};
+
+constexpr long long pow10(std::uint32_t n) {
+  return n == 0 ? 1 : 10 * pow10(n - 1);
+}
+
+template <class Rep, class Period,
+          FMT_ENABLE_IF(std::numeric_limits<Rep>::is_signed)>
+constexpr std::chrono::duration<Rep, Period> abs(
+    std::chrono::duration<Rep, Period> d) {
+  // We need to compare the duration using the count() method directly
+  // due to a compiler bug in clang-11 regarding the spaceship operator,
+  // when -Wzero-as-null-pointer-constant is enabled.
+  // In clang-12 the bug has been fixed. See
+  // https://bugs.llvm.org/show_bug.cgi?id=46235 and the reproducible example:
+  // https://www.godbolt.org/z/Knbb5joYx.
+  return d.count() >= d.zero().count() ? d : -d;
+}
+
+template <class Rep, class Period,
+          FMT_ENABLE_IF(!std::numeric_limits<Rep>::is_signed)>
+constexpr std::chrono::duration<Rep, Period> abs(
+    std::chrono::duration<Rep, Period> d) {
+  return d;
+}
+
+template <typename Char, typename Rep, typename OutputIt,
+          FMT_ENABLE_IF(std::is_integral<Rep>::value)>
+OutputIt format_duration_value(OutputIt out, Rep val, int) {
+  return write<Char>(out, val);
+}
+
+template <typename Char, typename Rep, typename OutputIt,
+          FMT_ENABLE_IF(std::is_floating_point<Rep>::value)>
+OutputIt format_duration_value(OutputIt out, Rep val, int precision) {
+  auto specs = basic_format_specs<Char>();
+  specs.precision = precision;
+  specs.type = precision >= 0 ? presentation_type::fixed_lower
+                              : presentation_type::general_lower;
+  return write<Char>(out, val, specs);
+}
+
+template <typename Char, typename OutputIt>
+OutputIt copy_unit(string_view unit, OutputIt out, Char) {
+  return std::copy(unit.begin(), unit.end(), out);
+}
+
+template <typename OutputIt>
+OutputIt copy_unit(string_view unit, OutputIt out, wchar_t) {
+  // This works when wchar_t is UTF-32 because units only contain characters
+  // that have the same representation in UTF-16 and UTF-32.
+  utf8_to_utf16 u(unit);
+  return std::copy(u.c_str(), u.c_str() + u.size(), out);
+}
+
+template <typename Char, typename Period, typename OutputIt>
+OutputIt format_duration_unit(OutputIt out) {
+  if (const char* unit = get_units<Period>())
+    return copy_unit(string_view(unit), out, Char());
+  *out++ = '[';
+  out = write<Char>(out, Period::num);
+  if (const_check(Period::den != 1)) {
+    *out++ = '/';
+    out = write<Char>(out, Period::den);
+  }
+  *out++ = ']';
+  *out++ = 's';
+  return out;
+}
+
+class get_locale {
+ private:
+  union {
+    std::locale locale_;
+  };
+  bool has_locale_ = false;
+
+ public:
+  get_locale(bool localized, locale_ref loc) : has_locale_(localized) {
+    if (localized)
+      ::new (&locale_) std::locale(loc.template get<std::locale>());
+  }
+  ~get_locale() {
+    if (has_locale_) locale_.~locale();
+  }
+  operator const std::locale&() const {
+    return has_locale_ ? locale_ : get_classic_locale();
+  }
+};
+
+template <typename FormatContext, typename OutputIt, typename Rep,
+          typename Period>
+struct chrono_formatter {
+  FormatContext& context;
+  OutputIt out;
+  int precision;
+  bool localized = false;
+  // rep is unsigned to avoid overflow.
+  using rep =
+      conditional_t<std::is_integral<Rep>::value && sizeof(Rep) < sizeof(int),
+                    unsigned, typename make_unsigned_or_unchanged<Rep>::type>;
+  rep val;
+  using seconds = std::chrono::duration<rep>;
+  seconds s;
+  using milliseconds = std::chrono::duration<rep, std::milli>;
+  bool negative;
+
+  using char_type = typename FormatContext::char_type;
+  using tm_writer_type = tm_writer<OutputIt, char_type>;
+
+  chrono_formatter(FormatContext& ctx, OutputIt o,
+                   std::chrono::duration<Rep, Period> d)
+      : context(ctx),
+        out(o),
+        val(static_cast<rep>(d.count())),
+        negative(false) {
+    if (d.count() < 0) {
+      val = 0 - val;
+      negative = true;
+    }
+
+    // this may overflow and/or the result may not fit in the
+    // target type.
+#if FMT_SAFE_DURATION_CAST
+    // might need checked conversion (rep!=Rep)
+    auto tmpval = std::chrono::duration<rep, Period>(val);
+    s = fmt_safe_duration_cast<seconds>(tmpval);
+#else
+    s = std::chrono::duration_cast<seconds>(
+        std::chrono::duration<rep, Period>(val));
+#endif
+  }
+
+  // returns true if nan or inf, writes to out.
+  bool handle_nan_inf() {
+    if (isfinite(val)) {
+      return false;
+    }
+    if (isnan(val)) {
+      write_nan();
+      return true;
+    }
+    // must be +-inf
+    if (val > 0) {
+      write_pinf();
+    } else {
+      write_ninf();
+    }
+    return true;
+  }
+
+  Rep hour() const { return static_cast<Rep>(mod((s.count() / 3600), 24)); }
+
+  Rep hour12() const {
+    Rep hour = static_cast<Rep>(mod((s.count() / 3600), 12));
+    return hour <= 0 ? 12 : hour;
+  }
+
+  Rep minute() const { return static_cast<Rep>(mod((s.count() / 60), 60)); }
+  Rep second() const { return static_cast<Rep>(mod(s.count(), 60)); }
+
+  std::tm time() const {
+    auto time = std::tm();
+    time.tm_hour = to_nonnegative_int(hour(), 24);
+    time.tm_min = to_nonnegative_int(minute(), 60);
+    time.tm_sec = to_nonnegative_int(second(), 60);
+    return time;
+  }
+
+  void write_sign() {
+    if (negative) {
+      *out++ = '-';
+      negative = false;
+    }
+  }
+
+  void write(Rep value, int width) {
+    write_sign();
+    if (isnan(value)) return write_nan();
+    uint32_or_64_or_128_t<int> n =
+        to_unsigned(to_nonnegative_int(value, max_value<int>()));
+    int num_digits = detail::count_digits(n);
+    if (width > num_digits) out = std::fill_n(out, width - num_digits, '0');
+    out = format_decimal<char_type>(out, n, num_digits).end;
+  }
+
+  template <typename Duration> void write_fractional_seconds(Duration d) {
+    FMT_ASSERT(!std::is_floating_point<typename Duration::rep>::value, "");
+    constexpr auto num_fractional_digits =
+        count_fractional_digits<Duration::period::num,
+                                Duration::period::den>::value;
+
+    using subsecond_precision = std::chrono::duration<
+        typename std::common_type<typename Duration::rep,
+                                  std::chrono::seconds::rep>::type,
+        std::ratio<1, detail::pow10(num_fractional_digits)>>;
+    if (std::ratio_less<typename subsecond_precision::period,
+                        std::chrono::seconds::period>::value) {
+      *out++ = '.';
+      auto fractional =
+          detail::abs(d) - std::chrono::duration_cast<std::chrono::seconds>(d);
+      auto subseconds =
+          std::chrono::treat_as_floating_point<
+              typename subsecond_precision::rep>::value
+              ? fractional.count()
+              : std::chrono::duration_cast<subsecond_precision>(fractional)
+                    .count();
+      uint32_or_64_or_128_t<long long> n =
+          to_unsigned(to_nonnegative_int(subseconds, max_value<long long>()));
+      int num_digits = detail::count_digits(n);
+      if (num_fractional_digits > num_digits)
+        out = std::fill_n(out, num_fractional_digits - num_digits, '0');
+      out = format_decimal<char_type>(out, n, num_digits).end;
+    }
+  }
+
+  void write_nan() { std::copy_n("nan", 3, out); }
+  void write_pinf() { std::copy_n("inf", 3, out); }
+  void write_ninf() { std::copy_n("-inf", 4, out); }
+
+  template <typename Callback, typename... Args>
+  void format_tm(const tm& time, Callback cb, Args... args) {
+    if (isnan(val)) return write_nan();
+    get_locale loc(localized, context.locale());
+    auto w = tm_writer_type(loc, out, time);
+    (w.*cb)(args...);
+    out = w.out();
+  }
+
+  void on_text(const char_type* begin, const char_type* end) {
+    std::copy(begin, end, out);
+  }
+
+  // These are not implemented because durations don't have date information.
+  void on_abbr_weekday() {}
+  void on_full_weekday() {}
+  void on_dec0_weekday(numeric_system) {}
+  void on_dec1_weekday(numeric_system) {}
+  void on_abbr_month() {}
+  void on_full_month() {}
+  void on_datetime(numeric_system) {}
+  void on_loc_date(numeric_system) {}
+  void on_loc_time(numeric_system) {}
+  void on_us_date() {}
+  void on_iso_date() {}
+  void on_utc_offset() {}
+  void on_tz_name() {}
+  void on_year(numeric_system) {}
+  void on_short_year(numeric_system) {}
+  void on_offset_year() {}
+  void on_century(numeric_system) {}
+  void on_iso_week_based_year() {}
+  void on_iso_week_based_short_year() {}
+  void on_dec_month(numeric_system) {}
+  void on_dec0_week_of_year(numeric_system) {}
+  void on_dec1_week_of_year(numeric_system) {}
+  void on_iso_week_of_year(numeric_system) {}
+  void on_day_of_year() {}
+  void on_day_of_month(numeric_system) {}
+  void on_day_of_month_space(numeric_system) {}
+
+  void on_24_hour(numeric_system ns) {
+    if (handle_nan_inf()) return;
+
+    if (ns == numeric_system::standard) return write(hour(), 2);
+    auto time = tm();
+    time.tm_hour = to_nonnegative_int(hour(), 24);
+    format_tm(time, &tm_writer_type::on_24_hour, ns);
+  }
+
+  void on_12_hour(numeric_system ns) {
+    if (handle_nan_inf()) return;
+
+    if (ns == numeric_system::standard) return write(hour12(), 2);
+    auto time = tm();
+    time.tm_hour = to_nonnegative_int(hour12(), 12);
+    format_tm(time, &tm_writer_type::on_12_hour, ns);
+  }
+
+  void on_minute(numeric_system ns) {
+    if (handle_nan_inf()) return;
+
+    if (ns == numeric_system::standard) return write(minute(), 2);
+    auto time = tm();
+    time.tm_min = to_nonnegative_int(minute(), 60);
+    format_tm(time, &tm_writer_type::on_minute, ns);
+  }
+
+  void on_second(numeric_system ns) {
+    if (handle_nan_inf()) return;
+
+    if (ns == numeric_system::standard) {
+      if (std::is_floating_point<rep>::value) {
+        constexpr auto num_fractional_digits =
+            count_fractional_digits<Period::num, Period::den>::value;
+        auto buf = memory_buffer();
+        format_to(std::back_inserter(buf), runtime("{:.{}f}"),
+                  std::fmod(val * static_cast<rep>(Period::num) /
+                                static_cast<rep>(Period::den),
+                            static_cast<rep>(60)),
+                  num_fractional_digits);
+        if (negative) *out++ = '-';
+        if (buf.size() < 2 || buf[1] == '.') *out++ = '0';
+        out = std::copy(buf.begin(), buf.end(), out);
+      } else {
+        write(second(), 2);
+        write_fractional_seconds(std::chrono::duration<rep, Period>(val));
+      }
+      return;
+    }
+    auto time = tm();
+    time.tm_sec = to_nonnegative_int(second(), 60);
+    format_tm(time, &tm_writer_type::on_second, ns);
+  }
+
+  void on_12_hour_time() {
+    if (handle_nan_inf()) return;
+    format_tm(time(), &tm_writer_type::on_12_hour_time);
+  }
+
+  void on_24_hour_time() {
+    if (handle_nan_inf()) {
+      *out++ = ':';
+      handle_nan_inf();
+      return;
+    }
+
+    write(hour(), 2);
+    *out++ = ':';
+    write(minute(), 2);
+  }
+
+  void on_iso_time() {
+    on_24_hour_time();
+    *out++ = ':';
+    if (handle_nan_inf()) return;
+    on_second(numeric_system::standard);
+  }
+
+  void on_am_pm() {
+    if (handle_nan_inf()) return;
+    format_tm(time(), &tm_writer_type::on_am_pm);
+  }
+
+  void on_duration_value() {
+    if (handle_nan_inf()) return;
+    write_sign();
+    out = format_duration_value<char_type>(out, val, precision);
+  }
+
+  void on_duration_unit() {
+    out = format_duration_unit<char_type, Period>(out);
+  }
+};
+
+FMT_END_DETAIL_NAMESPACE
+
+#if defined(__cpp_lib_chrono) && __cpp_lib_chrono >= 201907
+using weekday = std::chrono::weekday;
+#else
+// A fallback version of weekday.
+class weekday {
+ private:
+  unsigned char value;
+
+ public:
+  weekday() = default;
+  explicit constexpr weekday(unsigned wd) noexcept
+      : value(static_cast<unsigned char>(wd != 7 ? wd : 0)) {}
+  constexpr unsigned c_encoding() const noexcept { return value; }
+};
+
+class year_month_day {};
+#endif
+
+// A rudimentary weekday formatter.
+template <typename Char> struct formatter<weekday, Char> {
+ private:
+  bool localized = false;
+
+ public:
+  FMT_CONSTEXPR auto parse(basic_format_parse_context<Char>& ctx)
+      -> decltype(ctx.begin()) {
+    auto begin = ctx.begin(), end = ctx.end();
+    if (begin != end && *begin == 'L') {
+      ++begin;
+      localized = true;
+    }
+    return begin;
+  }
+
+  template <typename FormatContext>
+  auto format(weekday wd, FormatContext& ctx) const -> decltype(ctx.out()) {
+    auto time = std::tm();
+    time.tm_wday = static_cast<int>(wd.c_encoding());
+    detail::get_locale loc(localized, ctx.locale());
+    auto w = detail::tm_writer<decltype(ctx.out()), Char>(loc, ctx.out(), time);
+    w.on_abbr_weekday();
+    return w.out();
+  }
+};
+
+template <typename Rep, typename Period, typename Char>
+struct formatter<std::chrono::duration<Rep, Period>, Char> {
+ private:
+  basic_format_specs<Char> specs;
+  int precision = -1;
+  using arg_ref_type = detail::arg_ref<Char>;
+  arg_ref_type width_ref;
+  arg_ref_type precision_ref;
+  bool localized = false;
+  basic_string_view<Char> format_str;
+  using duration = std::chrono::duration<Rep, Period>;
+
+  struct spec_handler {
+    formatter& f;
+    basic_format_parse_context<Char>& context;
+    basic_string_view<Char> format_str;
+
+    template <typename Id> FMT_CONSTEXPR arg_ref_type make_arg_ref(Id arg_id) {
+      context.check_arg_id(arg_id);
+      return arg_ref_type(arg_id);
+    }
+
+    FMT_CONSTEXPR arg_ref_type make_arg_ref(basic_string_view<Char> arg_id) {
+      context.check_arg_id(arg_id);
+      return arg_ref_type(arg_id);
+    }
+
+    FMT_CONSTEXPR arg_ref_type make_arg_ref(detail::auto_id) {
+      return arg_ref_type(context.next_arg_id());
+    }
+
+    void on_error(const char* msg) { FMT_THROW(format_error(msg)); }
+    FMT_CONSTEXPR void on_fill(basic_string_view<Char> fill) {
+      f.specs.fill = fill;
+    }
+    FMT_CONSTEXPR void on_align(align_t align) { f.specs.align = align; }
+    FMT_CONSTEXPR void on_width(int width) { f.specs.width = width; }
+    FMT_CONSTEXPR void on_precision(int _precision) {
+      f.precision = _precision;
+    }
+    FMT_CONSTEXPR void end_precision() {}
+
+    template <typename Id> FMT_CONSTEXPR void on_dynamic_width(Id arg_id) {
+      f.width_ref = make_arg_ref(arg_id);
+    }
+
+    template <typename Id> FMT_CONSTEXPR void on_dynamic_precision(Id arg_id) {
+      f.precision_ref = make_arg_ref(arg_id);
+    }
+  };
+
+  using iterator = typename basic_format_parse_context<Char>::iterator;
+  struct parse_range {
+    iterator begin;
+    iterator end;
+  };
+
+  FMT_CONSTEXPR parse_range do_parse(basic_format_parse_context<Char>& ctx) {
+    auto begin = ctx.begin(), end = ctx.end();
+    if (begin == end || *begin == '}') return {begin, begin};
+    spec_handler handler{*this, ctx, format_str};
+    begin = detail::parse_align(begin, end, handler);
+    if (begin == end) return {begin, begin};
+    begin = detail::parse_width(begin, end, handler);
+    if (begin == end) return {begin, begin};
+    if (*begin == '.') {
+      if (std::is_floating_point<Rep>::value)
+        begin = detail::parse_precision(begin, end, handler);
+      else
+        handler.on_error("precision not allowed for this argument type");
+    }
+    if (begin != end && *begin == 'L') {
+      ++begin;
+      localized = true;
+    }
+    end = detail::parse_chrono_format(begin, end,
+                                      detail::chrono_format_checker());
+    return {begin, end};
+  }
+
+ public:
+  FMT_CONSTEXPR auto parse(basic_format_parse_context<Char>& ctx)
+      -> decltype(ctx.begin()) {
+    auto range = do_parse(ctx);
+    format_str = basic_string_view<Char>(
+        &*range.begin, detail::to_unsigned(range.end - range.begin));
+    return range.end;
+  }
+
+  template <typename FormatContext>
+  auto format(const duration& d, FormatContext& ctx) const
+      -> decltype(ctx.out()) {
+    auto specs_copy = specs;
+    auto precision_copy = precision;
+    auto begin = format_str.begin(), end = format_str.end();
+    // As a possible future optimization, we could avoid extra copying if width
+    // is not specified.
+    basic_memory_buffer<Char> buf;
+    auto out = std::back_inserter(buf);
+    detail::handle_dynamic_spec<detail::width_checker>(specs_copy.width,
+                                                       width_ref, ctx);
+    detail::handle_dynamic_spec<detail::precision_checker>(precision_copy,
+                                                           precision_ref, ctx);
+    if (begin == end || *begin == '}') {
+      out = detail::format_duration_value<Char>(out, d.count(), precision_copy);
+      detail::format_duration_unit<Char, Period>(out);
+    } else {
+      detail::chrono_formatter<FormatContext, decltype(out), Rep, Period> f(
+          ctx, out, d);
+      f.precision = precision_copy;
+      f.localized = localized;
+      detail::parse_chrono_format(begin, end, f);
+    }
+    return detail::write(
+        ctx.out(), basic_string_view<Char>(buf.data(), buf.size()), specs_copy);
+  }
+};
+
+template <typename Char, typename Duration>
+struct formatter<std::chrono::time_point<std::chrono::system_clock, Duration>,
+                 Char> : formatter<std::tm, Char> {
+  FMT_CONSTEXPR formatter() {
+    basic_string_view<Char> default_specs =
+        detail::string_literal<Char, '%', 'F', ' ', '%', 'T'>{};
+    this->do_parse(default_specs.begin(), default_specs.end());
+  }
+
+  template <typename FormatContext>
+  auto format(std::chrono::time_point<std::chrono::system_clock> val,
+              FormatContext& ctx) const -> decltype(ctx.out()) {
+    return formatter<std::tm, Char>::format(localtime(val), ctx);
+  }
+};
+
+template <typename Char> struct formatter<std::tm, Char> {
+ private:
+  enum class spec {
+    unknown,
+    year_month_day,
+    hh_mm_ss,
+  };
+  spec spec_ = spec::unknown;
+  basic_string_view<Char> specs;
+
+ protected:
+  template <typename It> FMT_CONSTEXPR auto do_parse(It begin, It end) -> It {
+    if (begin != end && *begin == ':') ++begin;
+    end = detail::parse_chrono_format(begin, end, detail::tm_format_checker());
+    // Replace default spec only if the new spec is not empty.
+    if (end != begin) specs = {begin, detail::to_unsigned(end - begin)};
+    return end;
+  }
+
+ public:
+  FMT_CONSTEXPR auto parse(basic_format_parse_context<Char>& ctx)
+      -> decltype(ctx.begin()) {
+    auto end = this->do_parse(ctx.begin(), ctx.end());
+    // basic_string_view<>::compare isn't constexpr before C++17.
+    if (specs.size() == 2 && specs[0] == Char('%')) {
+      if (specs[1] == Char('F'))
+        spec_ = spec::year_month_day;
+      else if (specs[1] == Char('T'))
+        spec_ = spec::hh_mm_ss;
+    }
+    return end;
+  }
+
+  template <typename FormatContext>
+  auto format(const std::tm& tm, FormatContext& ctx) const
+      -> decltype(ctx.out()) {
+    const auto loc_ref = ctx.locale();
+    detail::get_locale loc(static_cast<bool>(loc_ref), loc_ref);
+    auto w = detail::tm_writer<decltype(ctx.out()), Char>(loc, ctx.out(), tm);
+    if (spec_ == spec::year_month_day)
+      w.on_iso_date();
+    else if (spec_ == spec::hh_mm_ss)
+      w.on_iso_time();
+    else
+      detail::parse_chrono_format(specs.begin(), specs.end(), w);
+    return w.out();
+  }
+};
+
+FMT_MODULE_EXPORT_END
+FMT_END_NAMESPACE
+
+#endif  // FMT_CHRONO_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/color.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/color.h
new file mode 100644
index 0000000000..4c163277ef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/color.h
@@ -0,0 +1,651 @@
+// Formatting library for C++ - color support
+//
+// Copyright (c) 2018 - present, Victor Zverovich and fmt contributors
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_COLOR_H_
+#define FMT_COLOR_H_
+
+#include "format.h"
+
+FMT_BEGIN_NAMESPACE
+FMT_MODULE_EXPORT_BEGIN
+
+enum class color : uint32_t {
+  alice_blue = 0xF0F8FF,               // rgb(240,248,255)
+  antique_white = 0xFAEBD7,            // rgb(250,235,215)
+  aqua = 0x00FFFF,                     // rgb(0,255,255)
+  aquamarine = 0x7FFFD4,               // rgb(127,255,212)
+  azure = 0xF0FFFF,                    // rgb(240,255,255)
+  beige = 0xF5F5DC,                    // rgb(245,245,220)
+  bisque = 0xFFE4C4,                   // rgb(255,228,196)
+  black = 0x000000,                    // rgb(0,0,0)
+  blanched_almond = 0xFFEBCD,          // rgb(255,235,205)
+  blue = 0x0000FF,                     // rgb(0,0,255)
+  blue_violet = 0x8A2BE2,              // rgb(138,43,226)
+  brown = 0xA52A2A,                    // rgb(165,42,42)
+  burly_wood = 0xDEB887,               // rgb(222,184,135)
+  cadet_blue = 0x5F9EA0,               // rgb(95,158,160)
+  chartreuse = 0x7FFF00,               // rgb(127,255,0)
+  chocolate = 0xD2691E,                // rgb(210,105,30)
+  coral = 0xFF7F50,                    // rgb(255,127,80)
+  cornflower_blue = 0x6495ED,          // rgb(100,149,237)
+  cornsilk = 0xFFF8DC,                 // rgb(255,248,220)
+  crimson = 0xDC143C,                  // rgb(220,20,60)
+  cyan = 0x00FFFF,                     // rgb(0,255,255)
+  dark_blue = 0x00008B,                // rgb(0,0,139)
+  dark_cyan = 0x008B8B,                // rgb(0,139,139)
+  dark_golden_rod = 0xB8860B,          // rgb(184,134,11)
+  dark_gray = 0xA9A9A9,                // rgb(169,169,169)
+  dark_green = 0x006400,               // rgb(0,100,0)
+  dark_khaki = 0xBDB76B,               // rgb(189,183,107)
+  dark_magenta = 0x8B008B,             // rgb(139,0,139)
+  dark_olive_green = 0x556B2F,         // rgb(85,107,47)
+  dark_orange = 0xFF8C00,              // rgb(255,140,0)
+  dark_orchid = 0x9932CC,              // rgb(153,50,204)
+  dark_red = 0x8B0000,                 // rgb(139,0,0)
+  dark_salmon = 0xE9967A,              // rgb(233,150,122)
+  dark_sea_green = 0x8FBC8F,           // rgb(143,188,143)
+  dark_slate_blue = 0x483D8B,          // rgb(72,61,139)
+  dark_slate_gray = 0x2F4F4F,          // rgb(47,79,79)
+  dark_turquoise = 0x00CED1,           // rgb(0,206,209)
+  dark_violet = 0x9400D3,              // rgb(148,0,211)
+  deep_pink = 0xFF1493,                // rgb(255,20,147)
+  deep_sky_blue = 0x00BFFF,            // rgb(0,191,255)
+  dim_gray = 0x696969,                 // rgb(105,105,105)
+  dodger_blue = 0x1E90FF,              // rgb(30,144,255)
+  fire_brick = 0xB22222,               // rgb(178,34,34)
+  floral_white = 0xFFFAF0,             // rgb(255,250,240)
+  forest_green = 0x228B22,             // rgb(34,139,34)
+  fuchsia = 0xFF00FF,                  // rgb(255,0,255)
+  gainsboro = 0xDCDCDC,                // rgb(220,220,220)
+  ghost_white = 0xF8F8FF,              // rgb(248,248,255)
+  gold = 0xFFD700,                     // rgb(255,215,0)
+  golden_rod = 0xDAA520,               // rgb(218,165,32)
+  gray = 0x808080,                     // rgb(128,128,128)
+  green = 0x008000,                    // rgb(0,128,0)
+  green_yellow = 0xADFF2F,             // rgb(173,255,47)
+  honey_dew = 0xF0FFF0,                // rgb(240,255,240)
+  hot_pink = 0xFF69B4,                 // rgb(255,105,180)
+  indian_red = 0xCD5C5C,               // rgb(205,92,92)
+  indigo = 0x4B0082,                   // rgb(75,0,130)
+  ivory = 0xFFFFF0,                    // rgb(255,255,240)
+  khaki = 0xF0E68C,                    // rgb(240,230,140)
+  lavender = 0xE6E6FA,                 // rgb(230,230,250)
+  lavender_blush = 0xFFF0F5,           // rgb(255,240,245)
+  lawn_green = 0x7CFC00,               // rgb(124,252,0)
+  lemon_chiffon = 0xFFFACD,            // rgb(255,250,205)
+  light_blue = 0xADD8E6,               // rgb(173,216,230)
+  light_coral = 0xF08080,              // rgb(240,128,128)
+  light_cyan = 0xE0FFFF,               // rgb(224,255,255)
+  light_golden_rod_yellow = 0xFAFAD2,  // rgb(250,250,210)
+  light_gray = 0xD3D3D3,               // rgb(211,211,211)
+  light_green = 0x90EE90,              // rgb(144,238,144)
+  light_pink = 0xFFB6C1,               // rgb(255,182,193)
+  light_salmon = 0xFFA07A,             // rgb(255,160,122)
+  light_sea_green = 0x20B2AA,          // rgb(32,178,170)
+  light_sky_blue = 0x87CEFA,           // rgb(135,206,250)
+  light_slate_gray = 0x778899,         // rgb(119,136,153)
+  light_steel_blue = 0xB0C4DE,         // rgb(176,196,222)
+  light_yellow = 0xFFFFE0,             // rgb(255,255,224)
+  lime = 0x00FF00,                     // rgb(0,255,0)
+  lime_green = 0x32CD32,               // rgb(50,205,50)
+  linen = 0xFAF0E6,                    // rgb(250,240,230)
+  magenta = 0xFF00FF,                  // rgb(255,0,255)
+  maroon = 0x800000,                   // rgb(128,0,0)
+  medium_aquamarine = 0x66CDAA,        // rgb(102,205,170)
+  medium_blue = 0x0000CD,              // rgb(0,0,205)
+  medium_orchid = 0xBA55D3,            // rgb(186,85,211)
+  medium_purple = 0x9370DB,            // rgb(147,112,219)
+  medium_sea_green = 0x3CB371,         // rgb(60,179,113)
+  medium_slate_blue = 0x7B68EE,        // rgb(123,104,238)
+  medium_spring_green = 0x00FA9A,      // rgb(0,250,154)
+  medium_turquoise = 0x48D1CC,         // rgb(72,209,204)
+  medium_violet_red = 0xC71585,        // rgb(199,21,133)
+  midnight_blue = 0x191970,            // rgb(25,25,112)
+  mint_cream = 0xF5FFFA,               // rgb(245,255,250)
+  misty_rose = 0xFFE4E1,               // rgb(255,228,225)
+  moccasin = 0xFFE4B5,                 // rgb(255,228,181)
+  navajo_white = 0xFFDEAD,             // rgb(255,222,173)
+  navy = 0x000080,                     // rgb(0,0,128)
+  old_lace = 0xFDF5E6,                 // rgb(253,245,230)
+  olive = 0x808000,                    // rgb(128,128,0)
+  olive_drab = 0x6B8E23,               // rgb(107,142,35)
+  orange = 0xFFA500,                   // rgb(255,165,0)
+  orange_red = 0xFF4500,               // rgb(255,69,0)
+  orchid = 0xDA70D6,                   // rgb(218,112,214)
+  pale_golden_rod = 0xEEE8AA,          // rgb(238,232,170)
+  pale_green = 0x98FB98,               // rgb(152,251,152)
+  pale_turquoise = 0xAFEEEE,           // rgb(175,238,238)
+  pale_violet_red = 0xDB7093,          // rgb(219,112,147)
+  papaya_whip = 0xFFEFD5,              // rgb(255,239,213)
+  peach_puff = 0xFFDAB9,               // rgb(255,218,185)
+  peru = 0xCD853F,                     // rgb(205,133,63)
+  pink = 0xFFC0CB,                     // rgb(255,192,203)
+  plum = 0xDDA0DD,                     // rgb(221,160,221)
+  powder_blue = 0xB0E0E6,              // rgb(176,224,230)
+  purple = 0x800080,                   // rgb(128,0,128)
+  rebecca_purple = 0x663399,           // rgb(102,51,153)
+  red = 0xFF0000,                      // rgb(255,0,0)
+  rosy_brown = 0xBC8F8F,               // rgb(188,143,143)
+  royal_blue = 0x4169E1,               // rgb(65,105,225)
+  saddle_brown = 0x8B4513,             // rgb(139,69,19)
+  salmon = 0xFA8072,                   // rgb(250,128,114)
+  sandy_brown = 0xF4A460,              // rgb(244,164,96)
+  sea_green = 0x2E8B57,                // rgb(46,139,87)
+  sea_shell = 0xFFF5EE,                // rgb(255,245,238)
+  sienna = 0xA0522D,                   // rgb(160,82,45)
+  silver = 0xC0C0C0,                   // rgb(192,192,192)
+  sky_blue = 0x87CEEB,                 // rgb(135,206,235)
+  slate_blue = 0x6A5ACD,               // rgb(106,90,205)
+  slate_gray = 0x708090,               // rgb(112,128,144)
+  snow = 0xFFFAFA,                     // rgb(255,250,250)
+  spring_green = 0x00FF7F,             // rgb(0,255,127)
+  steel_blue = 0x4682B4,               // rgb(70,130,180)
+  tan = 0xD2B48C,                      // rgb(210,180,140)
+  teal = 0x008080,                     // rgb(0,128,128)
+  thistle = 0xD8BFD8,                  // rgb(216,191,216)
+  tomato = 0xFF6347,                   // rgb(255,99,71)
+  turquoise = 0x40E0D0,                // rgb(64,224,208)
+  violet = 0xEE82EE,                   // rgb(238,130,238)
+  wheat = 0xF5DEB3,                    // rgb(245,222,179)
+  white = 0xFFFFFF,                    // rgb(255,255,255)
+  white_smoke = 0xF5F5F5,              // rgb(245,245,245)
+  yellow = 0xFFFF00,                   // rgb(255,255,0)
+  yellow_green = 0x9ACD32              // rgb(154,205,50)
+};                                     // enum class color
+
+enum class terminal_color : uint8_t {
+  black = 30,
+  red,
+  green,
+  yellow,
+  blue,
+  magenta,
+  cyan,
+  white,
+  bright_black = 90,
+  bright_red,
+  bright_green,
+  bright_yellow,
+  bright_blue,
+  bright_magenta,
+  bright_cyan,
+  bright_white
+};
+
+enum class emphasis : uint8_t {
+  bold = 1,
+  faint = 1 << 1,
+  italic = 1 << 2,
+  underline = 1 << 3,
+  blink = 1 << 4,
+  reverse = 1 << 5,
+  conceal = 1 << 6,
+  strikethrough = 1 << 7,
+};
+
+// rgb is a struct for red, green and blue colors.
+// Using the name "rgb" makes some editors show the color in a tooltip.
+struct rgb {
+  FMT_CONSTEXPR rgb() : r(0), g(0), b(0) {}
+  FMT_CONSTEXPR rgb(uint8_t r_, uint8_t g_, uint8_t b_) : r(r_), g(g_), b(b_) {}
+  FMT_CONSTEXPR rgb(uint32_t hex)
+      : r((hex >> 16) & 0xFF), g((hex >> 8) & 0xFF), b(hex & 0xFF) {}
+  FMT_CONSTEXPR rgb(color hex)
+      : r((uint32_t(hex) >> 16) & 0xFF),
+        g((uint32_t(hex) >> 8) & 0xFF),
+        b(uint32_t(hex) & 0xFF) {}
+  uint8_t r;
+  uint8_t g;
+  uint8_t b;
+};
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+// color is a struct of either a rgb color or a terminal color.
+struct color_type {
+  FMT_CONSTEXPR color_type() noexcept : is_rgb(), value{} {}
+  FMT_CONSTEXPR color_type(color rgb_color) noexcept : is_rgb(true), value{} {
+    value.rgb_color = static_cast<uint32_t>(rgb_color);
+  }
+  FMT_CONSTEXPR color_type(rgb rgb_color) noexcept : is_rgb(true), value{} {
+    value.rgb_color = (static_cast<uint32_t>(rgb_color.r) << 16) |
+                      (static_cast<uint32_t>(rgb_color.g) << 8) | rgb_color.b;
+  }
+  FMT_CONSTEXPR color_type(terminal_color term_color) noexcept
+      : is_rgb(), value{} {
+    value.term_color = static_cast<uint8_t>(term_color);
+  }
+  bool is_rgb;
+  union color_union {
+    uint8_t term_color;
+    uint32_t rgb_color;
+  } value;
+};
+
+FMT_END_DETAIL_NAMESPACE
+
+/** A text style consisting of foreground and background colors and emphasis. */
+class text_style {
+ public:
+  FMT_CONSTEXPR text_style(emphasis em = emphasis()) noexcept
+      : set_foreground_color(), set_background_color(), ems(em) {}
+
+  FMT_CONSTEXPR text_style& operator|=(const text_style& rhs) {
+    if (!set_foreground_color) {
+      set_foreground_color = rhs.set_foreground_color;
+      foreground_color = rhs.foreground_color;
+    } else if (rhs.set_foreground_color) {
+      if (!foreground_color.is_rgb || !rhs.foreground_color.is_rgb)
+        FMT_THROW(format_error("can't OR a terminal color"));
+      foreground_color.value.rgb_color |= rhs.foreground_color.value.rgb_color;
+    }
+
+    if (!set_background_color) {
+      set_background_color = rhs.set_background_color;
+      background_color = rhs.background_color;
+    } else if (rhs.set_background_color) {
+      if (!background_color.is_rgb || !rhs.background_color.is_rgb)
+        FMT_THROW(format_error("can't OR a terminal color"));
+      background_color.value.rgb_color |= rhs.background_color.value.rgb_color;
+    }
+
+    ems = static_cast<emphasis>(static_cast<uint8_t>(ems) |
+                                static_cast<uint8_t>(rhs.ems));
+    return *this;
+  }
+
+  friend FMT_CONSTEXPR text_style operator|(text_style lhs,
+                                            const text_style& rhs) {
+    return lhs |= rhs;
+  }
+
+  FMT_CONSTEXPR bool has_foreground() const noexcept {
+    return set_foreground_color;
+  }
+  FMT_CONSTEXPR bool has_background() const noexcept {
+    return set_background_color;
+  }
+  FMT_CONSTEXPR bool has_emphasis() const noexcept {
+    return static_cast<uint8_t>(ems) != 0;
+  }
+  FMT_CONSTEXPR detail::color_type get_foreground() const noexcept {
+    FMT_ASSERT(has_foreground(), "no foreground specified for this style");
+    return foreground_color;
+  }
+  FMT_CONSTEXPR detail::color_type get_background() const noexcept {
+    FMT_ASSERT(has_background(), "no background specified for this style");
+    return background_color;
+  }
+  FMT_CONSTEXPR emphasis get_emphasis() const noexcept {
+    FMT_ASSERT(has_emphasis(), "no emphasis specified for this style");
+    return ems;
+  }
+
+ private:
+  FMT_CONSTEXPR text_style(bool is_foreground,
+                           detail::color_type text_color) noexcept
+      : set_foreground_color(), set_background_color(), ems() {
+    if (is_foreground) {
+      foreground_color = text_color;
+      set_foreground_color = true;
+    } else {
+      background_color = text_color;
+      set_background_color = true;
+    }
+  }
+
+  friend FMT_CONSTEXPR text_style fg(detail::color_type foreground) noexcept;
+
+  friend FMT_CONSTEXPR text_style bg(detail::color_type background) noexcept;
+
+  detail::color_type foreground_color;
+  detail::color_type background_color;
+  bool set_foreground_color;
+  bool set_background_color;
+  emphasis ems;
+};
+
+/** Creates a text style from the foreground (text) color. */
+FMT_CONSTEXPR inline text_style fg(detail::color_type foreground) noexcept {
+  return text_style(true, foreground);
+}
+
+/** Creates a text style from the background color. */
+FMT_CONSTEXPR inline text_style bg(detail::color_type background) noexcept {
+  return text_style(false, background);
+}
+
+FMT_CONSTEXPR inline text_style operator|(emphasis lhs, emphasis rhs) noexcept {
+  return text_style(lhs) | rhs;
+}
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+template <typename Char> struct ansi_color_escape {
+  FMT_CONSTEXPR ansi_color_escape(detail::color_type text_color,
+                                  const char* esc) noexcept {
+    // If we have a terminal color, we need to output another escape code
+    // sequence.
+    if (!text_color.is_rgb) {
+      bool is_background = esc == string_view("\x1b[48;2;");
+      uint32_t value = text_color.value.term_color;
+      // Background ASCII codes are the same as the foreground ones but with
+      // 10 more.
+      if (is_background) value += 10u;
+
+      size_t index = 0;
+      buffer[index++] = static_cast<Char>('\x1b');
+      buffer[index++] = static_cast<Char>('[');
+
+      if (value >= 100u) {
+        buffer[index++] = static_cast<Char>('1');
+        value %= 100u;
+      }
+      buffer[index++] = static_cast<Char>('0' + value / 10u);
+      buffer[index++] = static_cast<Char>('0' + value % 10u);
+
+      buffer[index++] = static_cast<Char>('m');
+      buffer[index++] = static_cast<Char>('\0');
+      return;
+    }
+
+    for (int i = 0; i < 7; i++) {
+      buffer[i] = static_cast<Char>(esc[i]);
+    }
+    rgb color(text_color.value.rgb_color);
+    to_esc(color.r, buffer + 7, ';');
+    to_esc(color.g, buffer + 11, ';');
+    to_esc(color.b, buffer + 15, 'm');
+    buffer[19] = static_cast<Char>(0);
+  }
+  FMT_CONSTEXPR ansi_color_escape(emphasis em) noexcept {
+    uint8_t em_codes[num_emphases] = {};
+    if (has_emphasis(em, emphasis::bold)) em_codes[0] = 1;
+    if (has_emphasis(em, emphasis::faint)) em_codes[1] = 2;
+    if (has_emphasis(em, emphasis::italic)) em_codes[2] = 3;
+    if (has_emphasis(em, emphasis::underline)) em_codes[3] = 4;
+    if (has_emphasis(em, emphasis::blink)) em_codes[4] = 5;
+    if (has_emphasis(em, emphasis::reverse)) em_codes[5] = 7;
+    if (has_emphasis(em, emphasis::conceal)) em_codes[6] = 8;
+    if (has_emphasis(em, emphasis::strikethrough)) em_codes[7] = 9;
+
+    size_t index = 0;
+    for (size_t i = 0; i < num_emphases; ++i) {
+      if (!em_codes[i]) continue;
+      buffer[index++] = static_cast<Char>('\x1b');
+      buffer[index++] = static_cast<Char>('[');
+      buffer[index++] = static_cast<Char>('0' + em_codes[i]);
+      buffer[index++] = static_cast<Char>('m');
+    }
+    buffer[index++] = static_cast<Char>(0);
+  }
+  FMT_CONSTEXPR operator const Char*() const noexcept { return buffer; }
+
+  FMT_CONSTEXPR const Char* begin() const noexcept { return buffer; }
+  FMT_CONSTEXPR_CHAR_TRAITS const Char* end() const noexcept {
+    return buffer + std::char_traits<Char>::length(buffer);
+  }
+
+ private:
+  static constexpr size_t num_emphases = 8;
+  Char buffer[7u + 3u * num_emphases + 1u];
+
+  static FMT_CONSTEXPR void to_esc(uint8_t c, Char* out,
+                                   char delimiter) noexcept {
+    out[0] = static_cast<Char>('0' + c / 100);
+    out[1] = static_cast<Char>('0' + c / 10 % 10);
+    out[2] = static_cast<Char>('0' + c % 10);
+    out[3] = static_cast<Char>(delimiter);
+  }
+  static FMT_CONSTEXPR bool has_emphasis(emphasis em, emphasis mask) noexcept {
+    return static_cast<uint8_t>(em) & static_cast<uint8_t>(mask);
+  }
+};
+
+template <typename Char>
+FMT_CONSTEXPR ansi_color_escape<Char> make_foreground_color(
+    detail::color_type foreground) noexcept {
+  return ansi_color_escape<Char>(foreground, "\x1b[38;2;");
+}
+
+template <typename Char>
+FMT_CONSTEXPR ansi_color_escape<Char> make_background_color(
+    detail::color_type background) noexcept {
+  return ansi_color_escape<Char>(background, "\x1b[48;2;");
+}
+
+template <typename Char>
+FMT_CONSTEXPR ansi_color_escape<Char> make_emphasis(emphasis em) noexcept {
+  return ansi_color_escape<Char>(em);
+}
+
+template <typename Char> inline void fputs(const Char* chars, FILE* stream) {
+  int result = std::fputs(chars, stream);
+  if (result < 0)
+    FMT_THROW(system_error(errno, FMT_STRING("cannot write to file")));
+}
+
+template <> inline void fputs<wchar_t>(const wchar_t* chars, FILE* stream) {
+  int result = std::fputws(chars, stream);
+  if (result < 0)
+    FMT_THROW(system_error(errno, FMT_STRING("cannot write to file")));
+}
+
+template <typename Char> inline void reset_color(FILE* stream) {
+  fputs("\x1b[0m", stream);
+}
+
+template <> inline void reset_color<wchar_t>(FILE* stream) {
+  fputs(L"\x1b[0m", stream);
+}
+
+template <typename Char> inline void reset_color(buffer<Char>& buffer) {
+  auto reset_color = string_view("\x1b[0m");
+  buffer.append(reset_color.begin(), reset_color.end());
+}
+
+template <typename T> struct styled_arg {
+  const T& value;
+  text_style style;
+};
+
+template <typename Char>
+void vformat_to(buffer<Char>& buf, const text_style& ts,
+                basic_string_view<Char> format_str,
+                basic_format_args<buffer_context<type_identity_t<Char>>> args) {
+  bool has_style = false;
+  if (ts.has_emphasis()) {
+    has_style = true;
+    auto emphasis = detail::make_emphasis<Char>(ts.get_emphasis());
+    buf.append(emphasis.begin(), emphasis.end());
+  }
+  if (ts.has_foreground()) {
+    has_style = true;
+    auto foreground = detail::make_foreground_color<Char>(ts.get_foreground());
+    buf.append(foreground.begin(), foreground.end());
+  }
+  if (ts.has_background()) {
+    has_style = true;
+    auto background = detail::make_background_color<Char>(ts.get_background());
+    buf.append(background.begin(), background.end());
+  }
+  detail::vformat_to(buf, format_str, args, {});
+  if (has_style) detail::reset_color<Char>(buf);
+}
+
+FMT_END_DETAIL_NAMESPACE
+
+template <typename S, typename Char = char_t<S>>
+void vprint(std::FILE* f, const text_style& ts, const S& format,
+            basic_format_args<buffer_context<type_identity_t<Char>>> args) {
+  basic_memory_buffer<Char> buf;
+  detail::vformat_to(buf, ts, detail::to_string_view(format), args);
+  if (detail::is_utf8()) {
+    detail::print(f, basic_string_view<Char>(buf.begin(), buf.size()));
+  } else {
+    buf.push_back(Char(0));
+    detail::fputs(buf.data(), f);
+  }
+}
+
+/**
+  \rst
+  Formats a string and prints it to the specified file stream using ANSI
+  escape sequences to specify text formatting.
+
+  **Example**::
+
+    fmt::print(fmt::emphasis::bold | fg(fmt::color::red),
+               "Elapsed time: {0:.2f} seconds", 1.23);
+  \endrst
+ */
+template <typename S, typename... Args,
+          FMT_ENABLE_IF(detail::is_string<S>::value)>
+void print(std::FILE* f, const text_style& ts, const S& format_str,
+           const Args&... args) {
+  vprint(f, ts, format_str,
+         fmt::make_format_args<buffer_context<char_t<S>>>(args...));
+}
+
+/**
+  \rst
+  Formats a string and prints it to stdout using ANSI escape sequences to
+  specify text formatting.
+
+  **Example**::
+
+    fmt::print(fmt::emphasis::bold | fg(fmt::color::red),
+               "Elapsed time: {0:.2f} seconds", 1.23);
+  \endrst
+ */
+template <typename S, typename... Args,
+          FMT_ENABLE_IF(detail::is_string<S>::value)>
+void print(const text_style& ts, const S& format_str, const Args&... args) {
+  return print(stdout, ts, format_str, args...);
+}
+
+template <typename S, typename Char = char_t<S>>
+inline std::basic_string<Char> vformat(
+    const text_style& ts, const S& format_str,
+    basic_format_args<buffer_context<type_identity_t<Char>>> args) {
+  basic_memory_buffer<Char> buf;
+  detail::vformat_to(buf, ts, detail::to_string_view(format_str), args);
+  return fmt::to_string(buf);
+}
+
+/**
+  \rst
+  Formats arguments and returns the result as a string using ANSI
+  escape sequences to specify text formatting.
+
+  **Example**::
+
+    #include <fmt/color.h>
+    std::string message = fmt::format(fmt::emphasis::bold | fg(fmt::color::red),
+                                      "The answer is {}", 42);
+  \endrst
+*/
+template <typename S, typename... Args, typename Char = char_t<S>>
+inline std::basic_string<Char> format(const text_style& ts, const S& format_str,
+                                      const Args&... args) {
+  return fmt::vformat(ts, detail::to_string_view(format_str),
+                      fmt::make_format_args<buffer_context<Char>>(args...));
+}
+
+/**
+  Formats a string with the given text_style and writes the output to ``out``.
+ */
+template <typename OutputIt, typename Char,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, Char>::value)>
+OutputIt vformat_to(
+    OutputIt out, const text_style& ts, basic_string_view<Char> format_str,
+    basic_format_args<buffer_context<type_identity_t<Char>>> args) {
+  auto&& buf = detail::get_buffer<Char>(out);
+  detail::vformat_to(buf, ts, format_str, args);
+  return detail::get_iterator(buf);
+}
+
+/**
+  \rst
+  Formats arguments with the given text_style, writes the result to the output
+  iterator ``out`` and returns the iterator past the end of the output range.
+
+  **Example**::
+
+    std::vector<char> out;
+    fmt::format_to(std::back_inserter(out),
+                   fmt::emphasis::bold | fg(fmt::color::red), "{}", 42);
+  \endrst
+*/
+template <typename OutputIt, typename S, typename... Args,
+          bool enable = detail::is_output_iterator<OutputIt, char_t<S>>::value&&
+              detail::is_string<S>::value>
+inline auto format_to(OutputIt out, const text_style& ts, const S& format_str,
+                      Args&&... args) ->
+    typename std::enable_if<enable, OutputIt>::type {
+  return vformat_to(out, ts, detail::to_string_view(format_str),
+                    fmt::make_format_args<buffer_context<char_t<S>>>(args...));
+}
+
+template <typename T, typename Char>
+struct formatter<detail::styled_arg<T>, Char> : formatter<T, Char> {
+  template <typename FormatContext>
+  auto format(const detail::styled_arg<T>& arg, FormatContext& ctx) const
+      -> decltype(ctx.out()) {
+    const auto& ts = arg.style;
+    const auto& value = arg.value;
+    auto out = ctx.out();
+
+    bool has_style = false;
+    if (ts.has_emphasis()) {
+      has_style = true;
+      auto emphasis = detail::make_emphasis<Char>(ts.get_emphasis());
+      out = std::copy(emphasis.begin(), emphasis.end(), out);
+    }
+    if (ts.has_foreground()) {
+      has_style = true;
+      auto foreground =
+          detail::make_foreground_color<Char>(ts.get_foreground());
+      out = std::copy(foreground.begin(), foreground.end(), out);
+    }
+    if (ts.has_background()) {
+      has_style = true;
+      auto background =
+          detail::make_background_color<Char>(ts.get_background());
+      out = std::copy(background.begin(), background.end(), out);
+    }
+    out = formatter<T, Char>::format(value, ctx);
+    if (has_style) {
+      auto reset_color = string_view("\x1b[0m");
+      out = std::copy(reset_color.begin(), reset_color.end(), out);
+    }
+    return out;
+  }
+};
+
+/**
+  \rst
+  Returns an argument that will be formatted using ANSI escape sequences,
+  to be used in a formatting function.
+
+  **Example**::
+
+    fmt::print("Elapsed time: {0:.2f} seconds",
+               fmt::styled(1.23, fmt::fg(fmt::color::green) |
+                                 fmt::bg(fmt::color::blue)));
+  \endrst
+ */
+template <typename T>
+FMT_CONSTEXPR auto styled(const T& value, text_style ts)
+    -> detail::styled_arg<remove_cvref_t<T>> {
+  return detail::styled_arg<remove_cvref_t<T>>{value, ts};
+}
+
+FMT_MODULE_EXPORT_END
+FMT_END_NAMESPACE
+
+#endif  // FMT_COLOR_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/compile.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/compile.h
new file mode 100644
index 0000000000..933668c41c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/compile.h
@@ -0,0 +1,611 @@
+// Formatting library for C++ - experimental format string compilation
+//
+// Copyright (c) 2012 - present, Victor Zverovich and fmt contributors
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_COMPILE_H_
+#define FMT_COMPILE_H_
+
+#include "format.h"
+
+FMT_BEGIN_NAMESPACE
+namespace detail {
+
+template <typename Char, typename InputIt>
+FMT_CONSTEXPR inline counting_iterator copy_str(InputIt begin, InputIt end,
+                                                counting_iterator it) {
+  return it + (end - begin);
+}
+
+template <typename OutputIt> class truncating_iterator_base {
+ protected:
+  OutputIt out_;
+  size_t limit_;
+  size_t count_ = 0;
+
+  truncating_iterator_base() : out_(), limit_(0) {}
+
+  truncating_iterator_base(OutputIt out, size_t limit)
+      : out_(out), limit_(limit) {}
+
+ public:
+  using iterator_category = std::output_iterator_tag;
+  using value_type = typename std::iterator_traits<OutputIt>::value_type;
+  using difference_type = std::ptrdiff_t;
+  using pointer = void;
+  using reference = void;
+  FMT_UNCHECKED_ITERATOR(truncating_iterator_base);
+
+  OutputIt base() const { return out_; }
+  size_t count() const { return count_; }
+};
+
+// An output iterator that truncates the output and counts the number of objects
+// written to it.
+template <typename OutputIt,
+          typename Enable = typename std::is_void<
+              typename std::iterator_traits<OutputIt>::value_type>::type>
+class truncating_iterator;
+
+template <typename OutputIt>
+class truncating_iterator<OutputIt, std::false_type>
+    : public truncating_iterator_base<OutputIt> {
+  mutable typename truncating_iterator_base<OutputIt>::value_type blackhole_;
+
+ public:
+  using value_type = typename truncating_iterator_base<OutputIt>::value_type;
+
+  truncating_iterator() = default;
+
+  truncating_iterator(OutputIt out, size_t limit)
+      : truncating_iterator_base<OutputIt>(out, limit) {}
+
+  truncating_iterator& operator++() {
+    if (this->count_++ < this->limit_) ++this->out_;
+    return *this;
+  }
+
+  truncating_iterator operator++(int) {
+    auto it = *this;
+    ++*this;
+    return it;
+  }
+
+  value_type& operator*() const {
+    return this->count_ < this->limit_ ? *this->out_ : blackhole_;
+  }
+};
+
+template <typename OutputIt>
+class truncating_iterator<OutputIt, std::true_type>
+    : public truncating_iterator_base<OutputIt> {
+ public:
+  truncating_iterator() = default;
+
+  truncating_iterator(OutputIt out, size_t limit)
+      : truncating_iterator_base<OutputIt>(out, limit) {}
+
+  template <typename T> truncating_iterator& operator=(T val) {
+    if (this->count_++ < this->limit_) *this->out_++ = val;
+    return *this;
+  }
+
+  truncating_iterator& operator++() { return *this; }
+  truncating_iterator& operator++(int) { return *this; }
+  truncating_iterator& operator*() { return *this; }
+};
+
+// A compile-time string which is compiled into fast formatting code.
+class compiled_string {};
+
+template <typename S>
+struct is_compiled_string : std::is_base_of<compiled_string, S> {};
+
+/**
+  \rst
+  Converts a string literal *s* into a format string that will be parsed at
+  compile time and converted into efficient formatting code. Requires C++17
+  ``constexpr if`` compiler support.
+
+  **Example**::
+
+    // Converts 42 into std::string using the most efficient method and no
+    // runtime format string processing.
+    std::string s = fmt::format(FMT_COMPILE("{}"), 42);
+  \endrst
+ */
+#if defined(__cpp_if_constexpr) && defined(__cpp_return_type_deduction)
+#  define FMT_COMPILE(s) \
+    FMT_STRING_IMPL(s, fmt::detail::compiled_string, explicit)
+#else
+#  define FMT_COMPILE(s) FMT_STRING(s)
+#endif
+
+#if FMT_USE_NONTYPE_TEMPLATE_ARGS
+template <typename Char, size_t N,
+          fmt::detail_exported::fixed_string<Char, N> Str>
+struct udl_compiled_string : compiled_string {
+  using char_type = Char;
+  explicit constexpr operator basic_string_view<char_type>() const {
+    return {Str.data, N - 1};
+  }
+};
+#endif
+
+template <typename T, typename... Tail>
+const T& first(const T& value, const Tail&...) {
+  return value;
+}
+
+#if defined(__cpp_if_constexpr) && defined(__cpp_return_type_deduction)
+template <typename... Args> struct type_list {};
+
+// Returns a reference to the argument at index N from [first, rest...].
+template <int N, typename T, typename... Args>
+constexpr const auto& get([[maybe_unused]] const T& first,
+                          [[maybe_unused]] const Args&... rest) {
+  static_assert(N < 1 + sizeof...(Args), "index is out of bounds");
+  if constexpr (N == 0)
+    return first;
+  else
+    return detail::get<N - 1>(rest...);
+}
+
+template <typename Char, typename... Args>
+constexpr int get_arg_index_by_name(basic_string_view<Char> name,
+                                    type_list<Args...>) {
+  return get_arg_index_by_name<Args...>(name);
+}
+
+template <int N, typename> struct get_type_impl;
+
+template <int N, typename... Args> struct get_type_impl<N, type_list<Args...>> {
+  using type =
+      remove_cvref_t<decltype(detail::get<N>(std::declval<Args>()...))>;
+};
+
+template <int N, typename T>
+using get_type = typename get_type_impl<N, T>::type;
+
+template <typename T> struct is_compiled_format : std::false_type {};
+
+template <typename Char> struct text {
+  basic_string_view<Char> data;
+  using char_type = Char;
+
+  template <typename OutputIt, typename... Args>
+  constexpr OutputIt format(OutputIt out, const Args&...) const {
+    return write<Char>(out, data);
+  }
+};
+
+template <typename Char>
+struct is_compiled_format<text<Char>> : std::true_type {};
+
+template <typename Char>
+constexpr text<Char> make_text(basic_string_view<Char> s, size_t pos,
+                               size_t size) {
+  return {{&s[pos], size}};
+}
+
+template <typename Char> struct code_unit {
+  Char value;
+  using char_type = Char;
+
+  template <typename OutputIt, typename... Args>
+  constexpr OutputIt format(OutputIt out, const Args&...) const {
+    return write<Char>(out, value);
+  }
+};
+
+// This ensures that the argument type is convertible to `const T&`.
+template <typename T, int N, typename... Args>
+constexpr const T& get_arg_checked(const Args&... args) {
+  const auto& arg = detail::get<N>(args...);
+  if constexpr (detail::is_named_arg<remove_cvref_t<decltype(arg)>>()) {
+    return arg.value;
+  } else {
+    return arg;
+  }
+}
+
+template <typename Char>
+struct is_compiled_format<code_unit<Char>> : std::true_type {};
+
+// A replacement field that refers to argument N.
+template <typename Char, typename T, int N> struct field {
+  using char_type = Char;
+
+  template <typename OutputIt, typename... Args>
+  constexpr OutputIt format(OutputIt out, const Args&... args) const {
+    return write<Char>(out, get_arg_checked<T, N>(args...));
+  }
+};
+
+template <typename Char, typename T, int N>
+struct is_compiled_format<field<Char, T, N>> : std::true_type {};
+
+// A replacement field that refers to argument with name.
+template <typename Char> struct runtime_named_field {
+  using char_type = Char;
+  basic_string_view<Char> name;
+
+  template <typename OutputIt, typename T>
+  constexpr static bool try_format_argument(
+      OutputIt& out,
+      // [[maybe_unused]] due to unused-but-set-parameter warning in GCC 7,8,9
+      [[maybe_unused]] basic_string_view<Char> arg_name, const T& arg) {
+    if constexpr (is_named_arg<typename std::remove_cv<T>::type>::value) {
+      if (arg_name == arg.name) {
+        out = write<Char>(out, arg.value);
+        return true;
+      }
+    }
+    return false;
+  }
+
+  template <typename OutputIt, typename... Args>
+  constexpr OutputIt format(OutputIt out, const Args&... args) const {
+    bool found = (try_format_argument(out, name, args) || ...);
+    if (!found) {
+      FMT_THROW(format_error("argument with specified name is not found"));
+    }
+    return out;
+  }
+};
+
+template <typename Char>
+struct is_compiled_format<runtime_named_field<Char>> : std::true_type {};
+
+// A replacement field that refers to argument N and has format specifiers.
+template <typename Char, typename T, int N> struct spec_field {
+  using char_type = Char;
+  formatter<T, Char> fmt;
+
+  template <typename OutputIt, typename... Args>
+  constexpr FMT_INLINE OutputIt format(OutputIt out,
+                                       const Args&... args) const {
+    const auto& vargs =
+        fmt::make_format_args<basic_format_context<OutputIt, Char>>(args...);
+    basic_format_context<OutputIt, Char> ctx(out, vargs);
+    return fmt.format(get_arg_checked<T, N>(args...), ctx);
+  }
+};
+
+template <typename Char, typename T, int N>
+struct is_compiled_format<spec_field<Char, T, N>> : std::true_type {};
+
+template <typename L, typename R> struct concat {
+  L lhs;
+  R rhs;
+  using char_type = typename L::char_type;
+
+  template <typename OutputIt, typename... Args>
+  constexpr OutputIt format(OutputIt out, const Args&... args) const {
+    out = lhs.format(out, args...);
+    return rhs.format(out, args...);
+  }
+};
+
+template <typename L, typename R>
+struct is_compiled_format<concat<L, R>> : std::true_type {};
+
+template <typename L, typename R>
+constexpr concat<L, R> make_concat(L lhs, R rhs) {
+  return {lhs, rhs};
+}
+
+struct unknown_format {};
+
+template <typename Char>
+constexpr size_t parse_text(basic_string_view<Char> str, size_t pos) {
+  for (size_t size = str.size(); pos != size; ++pos) {
+    if (str[pos] == '{' || str[pos] == '}') break;
+  }
+  return pos;
+}
+
+template <typename Args, size_t POS, int ID, typename S>
+constexpr auto compile_format_string(S format_str);
+
+template <typename Args, size_t POS, int ID, typename T, typename S>
+constexpr auto parse_tail(T head, S format_str) {
+  if constexpr (POS !=
+                basic_string_view<typename S::char_type>(format_str).size()) {
+    constexpr auto tail = compile_format_string<Args, POS, ID>(format_str);
+    if constexpr (std::is_same<remove_cvref_t<decltype(tail)>,
+                               unknown_format>())
+      return tail;
+    else
+      return make_concat(head, tail);
+  } else {
+    return head;
+  }
+}
+
+template <typename T, typename Char> struct parse_specs_result {
+  formatter<T, Char> fmt;
+  size_t end;
+  int next_arg_id;
+};
+
+constexpr int manual_indexing_id = -1;
+
+template <typename T, typename Char>
+constexpr parse_specs_result<T, Char> parse_specs(basic_string_view<Char> str,
+                                                  size_t pos, int next_arg_id) {
+  str.remove_prefix(pos);
+  auto ctx = compile_parse_context<Char>(str, max_value<int>(), nullptr, {},
+                                         next_arg_id);
+  auto f = formatter<T, Char>();
+  auto end = f.parse(ctx);
+  return {f, pos + fmt::detail::to_unsigned(end - str.data()),
+          next_arg_id == 0 ? manual_indexing_id : ctx.next_arg_id()};
+}
+
+template <typename Char> struct arg_id_handler {
+  arg_ref<Char> arg_id;
+
+  constexpr int operator()() {
+    FMT_ASSERT(false, "handler cannot be used with automatic indexing");
+    return 0;
+  }
+  constexpr int operator()(int id) {
+    arg_id = arg_ref<Char>(id);
+    return 0;
+  }
+  constexpr int operator()(basic_string_view<Char> id) {
+    arg_id = arg_ref<Char>(id);
+    return 0;
+  }
+
+  constexpr void on_error(const char* message) {
+    FMT_THROW(format_error(message));
+  }
+};
+
+template <typename Char> struct parse_arg_id_result {
+  arg_ref<Char> arg_id;
+  const Char* arg_id_end;
+};
+
+template <int ID, typename Char>
+constexpr auto parse_arg_id(const Char* begin, const Char* end) {
+  auto handler = arg_id_handler<Char>{arg_ref<Char>{}};
+  auto arg_id_end = parse_arg_id(begin, end, handler);
+  return parse_arg_id_result<Char>{handler.arg_id, arg_id_end};
+}
+
+template <typename T, typename Enable = void> struct field_type {
+  using type = remove_cvref_t<T>;
+};
+
+template <typename T>
+struct field_type<T, enable_if_t<detail::is_named_arg<T>::value>> {
+  using type = remove_cvref_t<decltype(T::value)>;
+};
+
+template <typename T, typename Args, size_t END_POS, int ARG_INDEX, int NEXT_ID,
+          typename S>
+constexpr auto parse_replacement_field_then_tail(S format_str) {
+  using char_type = typename S::char_type;
+  constexpr auto str = basic_string_view<char_type>(format_str);
+  constexpr char_type c = END_POS != str.size() ? str[END_POS] : char_type();
+  if constexpr (c == '}') {
+    return parse_tail<Args, END_POS + 1, NEXT_ID>(
+        field<char_type, typename field_type<T>::type, ARG_INDEX>(),
+        format_str);
+  } else if constexpr (c != ':') {
+    FMT_THROW(format_error("expected ':'"));
+  } else {
+    constexpr auto result = parse_specs<typename field_type<T>::type>(
+        str, END_POS + 1, NEXT_ID == manual_indexing_id ? 0 : NEXT_ID);
+    if constexpr (result.end >= str.size() || str[result.end] != '}') {
+      FMT_THROW(format_error("expected '}'"));
+      return 0;
+    } else {
+      return parse_tail<Args, result.end + 1, result.next_arg_id>(
+          spec_field<char_type, typename field_type<T>::type, ARG_INDEX>{
+              result.fmt},
+          format_str);
+    }
+  }
+}
+
+// Compiles a non-empty format string and returns the compiled representation
+// or unknown_format() on unrecognized input.
+template <typename Args, size_t POS, int ID, typename S>
+constexpr auto compile_format_string(S format_str) {
+  using char_type = typename S::char_type;
+  constexpr auto str = basic_string_view<char_type>(format_str);
+  if constexpr (str[POS] == '{') {
+    if constexpr (POS + 1 == str.size())
+      FMT_THROW(format_error("unmatched '{' in format string"));
+    if constexpr (str[POS + 1] == '{') {
+      return parse_tail<Args, POS + 2, ID>(make_text(str, POS, 1), format_str);
+    } else if constexpr (str[POS + 1] == '}' || str[POS + 1] == ':') {
+      static_assert(ID != manual_indexing_id,
+                    "cannot switch from manual to automatic argument indexing");
+      constexpr auto next_id =
+          ID != manual_indexing_id ? ID + 1 : manual_indexing_id;
+      return parse_replacement_field_then_tail<get_type<ID, Args>, Args,
+                                               POS + 1, ID, next_id>(
+          format_str);
+    } else {
+      constexpr auto arg_id_result =
+          parse_arg_id<ID>(str.data() + POS + 1, str.data() + str.size());
+      constexpr auto arg_id_end_pos = arg_id_result.arg_id_end - str.data();
+      constexpr char_type c =
+          arg_id_end_pos != str.size() ? str[arg_id_end_pos] : char_type();
+      static_assert(c == '}' || c == ':', "missing '}' in format string");
+      if constexpr (arg_id_result.arg_id.kind == arg_id_kind::index) {
+        static_assert(
+            ID == manual_indexing_id || ID == 0,
+            "cannot switch from automatic to manual argument indexing");
+        constexpr auto arg_index = arg_id_result.arg_id.val.index;
+        return parse_replacement_field_then_tail<get_type<arg_index, Args>,
+                                                 Args, arg_id_end_pos,
+                                                 arg_index, manual_indexing_id>(
+            format_str);
+      } else if constexpr (arg_id_result.arg_id.kind == arg_id_kind::name) {
+        constexpr auto arg_index =
+            get_arg_index_by_name(arg_id_result.arg_id.val.name, Args{});
+        if constexpr (arg_index != invalid_arg_index) {
+          constexpr auto next_id =
+              ID != manual_indexing_id ? ID + 1 : manual_indexing_id;
+          return parse_replacement_field_then_tail<
+              decltype(get_type<arg_index, Args>::value), Args, arg_id_end_pos,
+              arg_index, next_id>(format_str);
+        } else {
+          if constexpr (c == '}') {
+            return parse_tail<Args, arg_id_end_pos + 1, ID>(
+                runtime_named_field<char_type>{arg_id_result.arg_id.val.name},
+                format_str);
+          } else if constexpr (c == ':') {
+            return unknown_format();  // no type info for specs parsing
+          }
+        }
+      }
+    }
+  } else if constexpr (str[POS] == '}') {
+    if constexpr (POS + 1 == str.size())
+      FMT_THROW(format_error("unmatched '}' in format string"));
+    return parse_tail<Args, POS + 2, ID>(make_text(str, POS, 1), format_str);
+  } else {
+    constexpr auto end = parse_text(str, POS + 1);
+    if constexpr (end - POS > 1) {
+      return parse_tail<Args, end, ID>(make_text(str, POS, end - POS),
+                                       format_str);
+    } else {
+      return parse_tail<Args, end, ID>(code_unit<char_type>{str[POS]},
+                                       format_str);
+    }
+  }
+}
+
+template <typename... Args, typename S,
+          FMT_ENABLE_IF(detail::is_compiled_string<S>::value)>
+constexpr auto compile(S format_str) {
+  constexpr auto str = basic_string_view<typename S::char_type>(format_str);
+  if constexpr (str.size() == 0) {
+    return detail::make_text(str, 0, 0);
+  } else {
+    constexpr auto result =
+        detail::compile_format_string<detail::type_list<Args...>, 0, 0>(
+            format_str);
+    return result;
+  }
+}
+#endif  // defined(__cpp_if_constexpr) && defined(__cpp_return_type_deduction)
+}  // namespace detail
+
+FMT_MODULE_EXPORT_BEGIN
+
+#if defined(__cpp_if_constexpr) && defined(__cpp_return_type_deduction)
+
+template <typename CompiledFormat, typename... Args,
+          typename Char = typename CompiledFormat::char_type,
+          FMT_ENABLE_IF(detail::is_compiled_format<CompiledFormat>::value)>
+FMT_INLINE std::basic_string<Char> format(const CompiledFormat& cf,
+                                          const Args&... args) {
+  auto s = std::basic_string<Char>();
+  cf.format(std::back_inserter(s), args...);
+  return s;
+}
+
+template <typename OutputIt, typename CompiledFormat, typename... Args,
+          FMT_ENABLE_IF(detail::is_compiled_format<CompiledFormat>::value)>
+constexpr FMT_INLINE OutputIt format_to(OutputIt out, const CompiledFormat& cf,
+                                        const Args&... args) {
+  return cf.format(out, args...);
+}
+
+template <typename S, typename... Args,
+          FMT_ENABLE_IF(detail::is_compiled_string<S>::value)>
+FMT_INLINE std::basic_string<typename S::char_type> format(const S&,
+                                                           Args&&... args) {
+  if constexpr (std::is_same<typename S::char_type, char>::value) {
+    constexpr auto str = basic_string_view<typename S::char_type>(S());
+    if constexpr (str.size() == 2 && str[0] == '{' && str[1] == '}') {
+      const auto& first = detail::first(args...);
+      if constexpr (detail::is_named_arg<
+                        remove_cvref_t<decltype(first)>>::value) {
+        return fmt::to_string(first.value);
+      } else {
+        return fmt::to_string(first);
+      }
+    }
+  }
+  constexpr auto compiled = detail::compile<Args...>(S());
+  if constexpr (std::is_same<remove_cvref_t<decltype(compiled)>,
+                             detail::unknown_format>()) {
+    return fmt::format(
+        static_cast<basic_string_view<typename S::char_type>>(S()),
+        std::forward<Args>(args)...);
+  } else {
+    return fmt::format(compiled, std::forward<Args>(args)...);
+  }
+}
+
+template <typename OutputIt, typename S, typename... Args,
+          FMT_ENABLE_IF(detail::is_compiled_string<S>::value)>
+FMT_CONSTEXPR OutputIt format_to(OutputIt out, const S&, Args&&... args) {
+  constexpr auto compiled = detail::compile<Args...>(S());
+  if constexpr (std::is_same<remove_cvref_t<decltype(compiled)>,
+                             detail::unknown_format>()) {
+    return fmt::format_to(
+        out, static_cast<basic_string_view<typename S::char_type>>(S()),
+        std::forward<Args>(args)...);
+  } else {
+    return fmt::format_to(out, compiled, std::forward<Args>(args)...);
+  }
+}
+#endif
+
+template <typename OutputIt, typename S, typename... Args,
+          FMT_ENABLE_IF(detail::is_compiled_string<S>::value)>
+format_to_n_result<OutputIt> format_to_n(OutputIt out, size_t n,
+                                         const S& format_str, Args&&... args) {
+  auto it = fmt::format_to(detail::truncating_iterator<OutputIt>(out, n),
+                           format_str, std::forward<Args>(args)...);
+  return {it.base(), it.count()};
+}
+
+template <typename S, typename... Args,
+          FMT_ENABLE_IF(detail::is_compiled_string<S>::value)>
+FMT_CONSTEXPR20 size_t formatted_size(const S& format_str,
+                                      const Args&... args) {
+  return fmt::format_to(detail::counting_iterator(), format_str, args...)
+      .count();
+}
+
+template <typename S, typename... Args,
+          FMT_ENABLE_IF(detail::is_compiled_string<S>::value)>
+void print(std::FILE* f, const S& format_str, const Args&... args) {
+  memory_buffer buffer;
+  fmt::format_to(std::back_inserter(buffer), format_str, args...);
+  detail::print(f, {buffer.data(), buffer.size()});
+}
+
+template <typename S, typename... Args,
+          FMT_ENABLE_IF(detail::is_compiled_string<S>::value)>
+void print(const S& format_str, const Args&... args) {
+  print(stdout, format_str, args...);
+}
+
+#if FMT_USE_NONTYPE_TEMPLATE_ARGS
+inline namespace literals {
+template <detail_exported::fixed_string Str> constexpr auto operator""_cf() {
+  using char_t = remove_cvref_t<decltype(Str.data[0])>;
+  return detail::udl_compiled_string<char_t, sizeof(Str.data) / sizeof(char_t),
+                                     Str>();
+}
+}  // namespace literals
+#endif
+
+FMT_MODULE_EXPORT_END
+FMT_END_NAMESPACE
+
+#endif  // FMT_COMPILE_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/core.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/core.h
new file mode 100644
index 0000000000..286b9c34be
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/core.h
@@ -0,0 +1,3323 @@
+// Formatting library for C++ - the core API for char/UTF-8
+//
+// Copyright (c) 2012 - present, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_CORE_H_
+#define FMT_CORE_H_
+
+#include <cstddef>  // std::byte
+#include <cstdio>   // std::FILE
+#include <cstring>  // std::strlen
+#include <iterator>
+#include <limits>
+#include <string>
+#include <type_traits>
+
+// The fmt library version in the form major * 10000 + minor * 100 + patch.
+#define FMT_VERSION 90100
+
+#if defined(__clang__) && !defined(__ibmxl__)
+#  define FMT_CLANG_VERSION (__clang_major__ * 100 + __clang_minor__)
+#else
+#  define FMT_CLANG_VERSION 0
+#endif
+
+#if defined(__GNUC__) && !defined(__clang__) && !defined(__INTEL_COMPILER) && \
+    !defined(__NVCOMPILER)
+#  define FMT_GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)
+#else
+#  define FMT_GCC_VERSION 0
+#endif
+
+#ifndef FMT_GCC_PRAGMA
+// Workaround _Pragma bug https://gcc.gnu.org/bugzilla/show_bug.cgi?id=59884.
+#  if FMT_GCC_VERSION >= 504
+#    define FMT_GCC_PRAGMA(arg) _Pragma(arg)
+#  else
+#    define FMT_GCC_PRAGMA(arg)
+#  endif
+#endif
+
+#ifdef __ICL
+#  define FMT_ICC_VERSION __ICL
+#elif defined(__INTEL_COMPILER)
+#  define FMT_ICC_VERSION __INTEL_COMPILER
+#else
+#  define FMT_ICC_VERSION 0
+#endif
+
+#ifdef _MSC_VER
+#  define FMT_MSC_VERSION _MSC_VER
+#  define FMT_MSC_WARNING(...) __pragma(warning(__VA_ARGS__))
+#else
+#  define FMT_MSC_VERSION 0
+#  define FMT_MSC_WARNING(...)
+#endif
+
+#ifdef _MSVC_LANG
+#  define FMT_CPLUSPLUS _MSVC_LANG
+#else
+#  define FMT_CPLUSPLUS __cplusplus
+#endif
+
+#ifdef __has_feature
+#  define FMT_HAS_FEATURE(x) __has_feature(x)
+#else
+#  define FMT_HAS_FEATURE(x) 0
+#endif
+
+#if (defined(__has_include) || FMT_ICC_VERSION >= 1600 || \
+     FMT_MSC_VERSION > 1900) &&                           \
+    !defined(__INTELLISENSE__)
+#  define FMT_HAS_INCLUDE(x) __has_include(x)
+#else
+#  define FMT_HAS_INCLUDE(x) 0
+#endif
+
+#ifdef __has_cpp_attribute
+#  define FMT_HAS_CPP_ATTRIBUTE(x) __has_cpp_attribute(x)
+#else
+#  define FMT_HAS_CPP_ATTRIBUTE(x) 0
+#endif
+
+#define FMT_HAS_CPP14_ATTRIBUTE(attribute) \
+  (FMT_CPLUSPLUS >= 201402L && FMT_HAS_CPP_ATTRIBUTE(attribute))
+
+#define FMT_HAS_CPP17_ATTRIBUTE(attribute) \
+  (FMT_CPLUSPLUS >= 201703L && FMT_HAS_CPP_ATTRIBUTE(attribute))
+
+// Check if relaxed C++14 constexpr is supported.
+// GCC doesn't allow throw in constexpr until version 6 (bug 67371).
+#ifndef FMT_USE_CONSTEXPR
+#  if (FMT_HAS_FEATURE(cxx_relaxed_constexpr) || FMT_MSC_VERSION >= 1912 || \
+       (FMT_GCC_VERSION >= 600 && FMT_CPLUSPLUS >= 201402L)) &&             \
+      !FMT_ICC_VERSION && !defined(__NVCC__)
+#    define FMT_USE_CONSTEXPR 1
+#  else
+#    define FMT_USE_CONSTEXPR 0
+#  endif
+#endif
+#if FMT_USE_CONSTEXPR
+#  define FMT_CONSTEXPR constexpr
+#else
+#  define FMT_CONSTEXPR
+#endif
+
+#if ((FMT_CPLUSPLUS >= 202002L) &&                            \
+     (!defined(_GLIBCXX_RELEASE) || _GLIBCXX_RELEASE > 9)) || \
+    (FMT_CPLUSPLUS >= 201709L && FMT_GCC_VERSION >= 1002)
+#  define FMT_CONSTEXPR20 constexpr
+#else
+#  define FMT_CONSTEXPR20
+#endif
+
+// Check if constexpr std::char_traits<>::{compare,length} are supported.
+#if defined(__GLIBCXX__)
+#  if FMT_CPLUSPLUS >= 201703L && defined(_GLIBCXX_RELEASE) && \
+      _GLIBCXX_RELEASE >= 7  // GCC 7+ libstdc++ has _GLIBCXX_RELEASE.
+#    define FMT_CONSTEXPR_CHAR_TRAITS constexpr
+#  endif
+#elif defined(_LIBCPP_VERSION) && FMT_CPLUSPLUS >= 201703L && \
+    _LIBCPP_VERSION >= 4000
+#  define FMT_CONSTEXPR_CHAR_TRAITS constexpr
+#elif FMT_MSC_VERSION >= 1914 && FMT_CPLUSPLUS >= 201703L
+#  define FMT_CONSTEXPR_CHAR_TRAITS constexpr
+#endif
+#ifndef FMT_CONSTEXPR_CHAR_TRAITS
+#  define FMT_CONSTEXPR_CHAR_TRAITS
+#endif
+
+// Check if exceptions are disabled.
+#ifndef FMT_EXCEPTIONS
+#  if (defined(__GNUC__) && !defined(__EXCEPTIONS)) || \
+      (FMT_MSC_VERSION && !_HAS_EXCEPTIONS)
+#    define FMT_EXCEPTIONS 0
+#  else
+#    define FMT_EXCEPTIONS 1
+#  endif
+#endif
+
+#ifndef FMT_DEPRECATED
+#  if FMT_HAS_CPP14_ATTRIBUTE(deprecated) || FMT_MSC_VERSION >= 1900
+#    define FMT_DEPRECATED [[deprecated]]
+#  else
+#    if (defined(__GNUC__) && !defined(__LCC__)) || defined(__clang__)
+#      define FMT_DEPRECATED __attribute__((deprecated))
+#    elif FMT_MSC_VERSION
+#      define FMT_DEPRECATED __declspec(deprecated)
+#    else
+#      define FMT_DEPRECATED /* deprecated */
+#    endif
+#  endif
+#endif
+
+// [[noreturn]] is disabled on MSVC and NVCC because of bogus unreachable code
+// warnings.
+#if FMT_EXCEPTIONS && FMT_HAS_CPP_ATTRIBUTE(noreturn) && !FMT_MSC_VERSION && \
+    !defined(__NVCC__)
+#  define FMT_NORETURN [[noreturn]]
+#else
+#  define FMT_NORETURN
+#endif
+
+#if FMT_HAS_CPP17_ATTRIBUTE(fallthrough)
+#  define FMT_FALLTHROUGH [[fallthrough]]
+#elif defined(__clang__)
+#  define FMT_FALLTHROUGH [[clang::fallthrough]]
+#elif FMT_GCC_VERSION >= 700 && \
+    (!defined(__EDG_VERSION__) || __EDG_VERSION__ >= 520)
+#  define FMT_FALLTHROUGH [[gnu::fallthrough]]
+#else
+#  define FMT_FALLTHROUGH
+#endif
+
+#ifndef FMT_NODISCARD
+#  if FMT_HAS_CPP17_ATTRIBUTE(nodiscard)
+#    define FMT_NODISCARD [[nodiscard]]
+#  else
+#    define FMT_NODISCARD
+#  endif
+#endif
+
+#ifndef FMT_USE_FLOAT
+#  define FMT_USE_FLOAT 1
+#endif
+#ifndef FMT_USE_DOUBLE
+#  define FMT_USE_DOUBLE 1
+#endif
+#ifndef FMT_USE_LONG_DOUBLE
+#  define FMT_USE_LONG_DOUBLE 1
+#endif
+
+#ifndef FMT_INLINE
+#  if FMT_GCC_VERSION || FMT_CLANG_VERSION
+#    define FMT_INLINE inline __attribute__((always_inline))
+#  else
+#    define FMT_INLINE inline
+#  endif
+#endif
+
+// An inline std::forward replacement.
+#define FMT_FORWARD(...) static_cast<decltype(__VA_ARGS__)&&>(__VA_ARGS__)
+
+#ifdef _MSC_VER
+#  define FMT_UNCHECKED_ITERATOR(It) \
+    using _Unchecked_type = It  // Mark iterator as checked.
+#else
+#  define FMT_UNCHECKED_ITERATOR(It) using unchecked_type = It
+#endif
+
+#ifndef FMT_BEGIN_NAMESPACE
+#  define FMT_BEGIN_NAMESPACE \
+    namespace fmt {           \
+    inline namespace v9 {
+#  define FMT_END_NAMESPACE \
+    }                       \
+    }
+#endif
+
+#ifndef FMT_MODULE_EXPORT
+#  define FMT_MODULE_EXPORT
+#  define FMT_MODULE_EXPORT_BEGIN
+#  define FMT_MODULE_EXPORT_END
+#  define FMT_BEGIN_DETAIL_NAMESPACE namespace detail {
+#  define FMT_END_DETAIL_NAMESPACE }
+#endif
+
+#if !defined(FMT_HEADER_ONLY) && defined(_WIN32)
+#  define FMT_CLASS_API FMT_MSC_WARNING(suppress : 4275)
+#  ifdef FMT_EXPORT
+#    define FMT_API __declspec(dllexport)
+#  elif defined(FMT_SHARED)
+#    define FMT_API __declspec(dllimport)
+#  endif
+#else
+#  define FMT_CLASS_API
+#  if defined(FMT_EXPORT) || defined(FMT_SHARED)
+#    if defined(__GNUC__) || defined(__clang__)
+#      define FMT_API __attribute__((visibility("default")))
+#    endif
+#  endif
+#endif
+#ifndef FMT_API
+#  define FMT_API
+#endif
+
+// libc++ supports string_view in pre-c++17.
+#if FMT_HAS_INCLUDE(<string_view>) && \
+    (FMT_CPLUSPLUS >= 201703L || defined(_LIBCPP_VERSION))
+#  include <string_view>
+#  define FMT_USE_STRING_VIEW
+#elif FMT_HAS_INCLUDE("experimental/string_view") && FMT_CPLUSPLUS >= 201402L
+#  include <experimental/string_view>
+#  define FMT_USE_EXPERIMENTAL_STRING_VIEW
+#endif
+
+#ifndef FMT_UNICODE
+#  define FMT_UNICODE !FMT_MSC_VERSION
+#endif
+
+#ifndef FMT_CONSTEVAL
+#  if ((FMT_GCC_VERSION >= 1000 || FMT_CLANG_VERSION >= 1101) &&         \
+       FMT_CPLUSPLUS >= 202002L && !defined(__apple_build_version__)) || \
+      (defined(__cpp_consteval) &&                                       \
+       (!FMT_MSC_VERSION || _MSC_FULL_VER >= 193030704))
+// consteval is broken in MSVC before VS2022 and Apple clang 13.
+#    define FMT_CONSTEVAL consteval
+#    define FMT_HAS_CONSTEVAL
+#  else
+#    define FMT_CONSTEVAL
+#  endif
+#endif
+
+#ifndef FMT_USE_NONTYPE_TEMPLATE_ARGS
+#  if defined(__cpp_nontype_template_args) &&                  \
+      ((FMT_GCC_VERSION >= 903 && FMT_CPLUSPLUS >= 201709L) || \
+       __cpp_nontype_template_args >= 201911L) &&              \
+      !defined(__NVCOMPILER)
+#    define FMT_USE_NONTYPE_TEMPLATE_ARGS 1
+#  else
+#    define FMT_USE_NONTYPE_TEMPLATE_ARGS 0
+#  endif
+#endif
+
+// Enable minimal optimizations for more compact code in debug mode.
+FMT_GCC_PRAGMA("GCC push_options")
+#if !defined(__OPTIMIZE__) && !defined(__NVCOMPILER)
+FMT_GCC_PRAGMA("GCC optimize(\"Og\")")
+#endif
+
+FMT_BEGIN_NAMESPACE
+FMT_MODULE_EXPORT_BEGIN
+
+// Implementations of enable_if_t and other metafunctions for older systems.
+template <bool B, typename T = void>
+using enable_if_t = typename std::enable_if<B, T>::type;
+template <bool B, typename T, typename F>
+using conditional_t = typename std::conditional<B, T, F>::type;
+template <bool B> using bool_constant = std::integral_constant<bool, B>;
+template <typename T>
+using remove_reference_t = typename std::remove_reference<T>::type;
+template <typename T>
+using remove_const_t = typename std::remove_const<T>::type;
+template <typename T>
+using remove_cvref_t = typename std::remove_cv<remove_reference_t<T>>::type;
+template <typename T> struct type_identity { using type = T; };
+template <typename T> using type_identity_t = typename type_identity<T>::type;
+template <typename T>
+using underlying_t = typename std::underlying_type<T>::type;
+
+template <typename...> struct disjunction : std::false_type {};
+template <typename P> struct disjunction<P> : P {};
+template <typename P1, typename... Pn>
+struct disjunction<P1, Pn...>
+    : conditional_t<bool(P1::value), P1, disjunction<Pn...>> {};
+
+template <typename...> struct conjunction : std::true_type {};
+template <typename P> struct conjunction<P> : P {};
+template <typename P1, typename... Pn>
+struct conjunction<P1, Pn...>
+    : conditional_t<bool(P1::value), conjunction<Pn...>, P1> {};
+
+struct monostate {
+  constexpr monostate() {}
+};
+
+// An enable_if helper to be used in template parameters which results in much
+// shorter symbols: https://godbolt.org/z/sWw4vP. Extra parentheses are needed
+// to workaround a bug in MSVC 2019 (see #1140 and #1186).
+#ifdef FMT_DOC
+#  define FMT_ENABLE_IF(...)
+#else
+#  define FMT_ENABLE_IF(...) enable_if_t<(__VA_ARGS__), int> = 0
+#endif
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+// Suppresses "unused variable" warnings with the method described in
+// https://herbsutter.com/2009/10/18/mailbag-shutting-up-compiler-warnings/.
+// (void)var does not work on many Intel compilers.
+template <typename... T> FMT_CONSTEXPR void ignore_unused(const T&...) {}
+
+constexpr FMT_INLINE auto is_constant_evaluated(
+    bool default_value = false) noexcept -> bool {
+#ifdef __cpp_lib_is_constant_evaluated
+  ignore_unused(default_value);
+  return std::is_constant_evaluated();
+#else
+  return default_value;
+#endif
+}
+
+// Suppresses "conditional expression is constant" warnings.
+template <typename T> constexpr FMT_INLINE auto const_check(T value) -> T {
+  return value;
+}
+
+FMT_NORETURN FMT_API void assert_fail(const char* file, int line,
+                                      const char* message);
+
+#ifndef FMT_ASSERT
+#  ifdef NDEBUG
+// FMT_ASSERT is not empty to avoid -Wempty-body.
+#    define FMT_ASSERT(condition, message) \
+      ::fmt::detail::ignore_unused((condition), (message))
+#  else
+#    define FMT_ASSERT(condition, message)                                    \
+      ((condition) /* void() fails with -Winvalid-constexpr on clang 4.0.1 */ \
+           ? (void)0                                                          \
+           : ::fmt::detail::assert_fail(__FILE__, __LINE__, (message)))
+#  endif
+#endif
+
+#if defined(FMT_USE_STRING_VIEW)
+template <typename Char> using std_string_view = std::basic_string_view<Char>;
+#elif defined(FMT_USE_EXPERIMENTAL_STRING_VIEW)
+template <typename Char>
+using std_string_view = std::experimental::basic_string_view<Char>;
+#else
+template <typename T> struct std_string_view {};
+#endif
+
+#ifdef FMT_USE_INT128
+// Do nothing.
+#elif defined(__SIZEOF_INT128__) && !defined(__NVCC__) && \
+    !(FMT_CLANG_VERSION && FMT_MSC_VERSION)
+#  define FMT_USE_INT128 1
+using int128_opt = __int128_t;  // An optional native 128-bit integer.
+using uint128_opt = __uint128_t;
+template <typename T> inline auto convert_for_visit(T value) -> T {
+  return value;
+}
+#else
+#  define FMT_USE_INT128 0
+#endif
+#if !FMT_USE_INT128
+enum class int128_opt {};
+enum class uint128_opt {};
+// Reduce template instantiations.
+template <typename T> auto convert_for_visit(T) -> monostate { return {}; }
+#endif
+
+// Casts a nonnegative integer to unsigned.
+template <typename Int>
+FMT_CONSTEXPR auto to_unsigned(Int value) ->
+    typename std::make_unsigned<Int>::type {
+  FMT_ASSERT(std::is_unsigned<Int>::value || value >= 0, "negative value");
+  return static_cast<typename std::make_unsigned<Int>::type>(value);
+}
+
+FMT_MSC_WARNING(suppress : 4566) constexpr unsigned char micro[] = "\u00B5";
+
+constexpr auto is_utf8() -> bool {
+  // Avoid buggy sign extensions in MSVC's constant evaluation mode (#2297).
+  using uchar = unsigned char;
+  return FMT_UNICODE || (sizeof(micro) == 3 && uchar(micro[0]) == 0xC2 &&
+                         uchar(micro[1]) == 0xB5);
+}
+FMT_END_DETAIL_NAMESPACE
+
+/**
+  An implementation of ``std::basic_string_view`` for pre-C++17. It provides a
+  subset of the API. ``fmt::basic_string_view`` is used for format strings even
+  if ``std::string_view`` is available to prevent issues when a library is
+  compiled with a different ``-std`` option than the client code (which is not
+  recommended).
+ */
+template <typename Char> class basic_string_view {
+ private:
+  const Char* data_;
+  size_t size_;
+
+ public:
+  using value_type = Char;
+  using iterator = const Char*;
+
+  constexpr basic_string_view() noexcept : data_(nullptr), size_(0) {}
+
+  /** Constructs a string reference object from a C string and a size. */
+  constexpr basic_string_view(const Char* s, size_t count) noexcept
+      : data_(s), size_(count) {}
+
+  /**
+    \rst
+    Constructs a string reference object from a C string computing
+    the size with ``std::char_traits<Char>::length``.
+    \endrst
+   */
+  FMT_CONSTEXPR_CHAR_TRAITS
+  FMT_INLINE
+  basic_string_view(const Char* s)
+      : data_(s),
+        size_(detail::const_check(std::is_same<Char, char>::value &&
+                                  !detail::is_constant_evaluated(true))
+                  ? std::strlen(reinterpret_cast<const char*>(s))
+                  : std::char_traits<Char>::length(s)) {}
+
+  /** Constructs a string reference from a ``std::basic_string`` object. */
+  template <typename Traits, typename Alloc>
+  FMT_CONSTEXPR basic_string_view(
+      const std::basic_string<Char, Traits, Alloc>& s) noexcept
+      : data_(s.data()), size_(s.size()) {}
+
+  template <typename S, FMT_ENABLE_IF(std::is_same<
+                                      S, detail::std_string_view<Char>>::value)>
+  FMT_CONSTEXPR basic_string_view(S s) noexcept
+      : data_(s.data()), size_(s.size()) {}
+
+  /** Returns a pointer to the string data. */
+  constexpr auto data() const noexcept -> const Char* { return data_; }
+
+  /** Returns the string size. */
+  constexpr auto size() const noexcept -> size_t { return size_; }
+
+  constexpr auto begin() const noexcept -> iterator { return data_; }
+  constexpr auto end() const noexcept -> iterator { return data_ + size_; }
+
+  constexpr auto operator[](size_t pos) const noexcept -> const Char& {
+    return data_[pos];
+  }
+
+  FMT_CONSTEXPR void remove_prefix(size_t n) noexcept {
+    data_ += n;
+    size_ -= n;
+  }
+
+  // Lexicographically compare this string reference to other.
+  FMT_CONSTEXPR_CHAR_TRAITS auto compare(basic_string_view other) const -> int {
+    size_t str_size = size_ < other.size_ ? size_ : other.size_;
+    int result = std::char_traits<Char>::compare(data_, other.data_, str_size);
+    if (result == 0)
+      result = size_ == other.size_ ? 0 : (size_ < other.size_ ? -1 : 1);
+    return result;
+  }
+
+  FMT_CONSTEXPR_CHAR_TRAITS friend auto operator==(basic_string_view lhs,
+                                                   basic_string_view rhs)
+      -> bool {
+    return lhs.compare(rhs) == 0;
+  }
+  friend auto operator!=(basic_string_view lhs, basic_string_view rhs) -> bool {
+    return lhs.compare(rhs) != 0;
+  }
+  friend auto operator<(basic_string_view lhs, basic_string_view rhs) -> bool {
+    return lhs.compare(rhs) < 0;
+  }
+  friend auto operator<=(basic_string_view lhs, basic_string_view rhs) -> bool {
+    return lhs.compare(rhs) <= 0;
+  }
+  friend auto operator>(basic_string_view lhs, basic_string_view rhs) -> bool {
+    return lhs.compare(rhs) > 0;
+  }
+  friend auto operator>=(basic_string_view lhs, basic_string_view rhs) -> bool {
+    return lhs.compare(rhs) >= 0;
+  }
+};
+
+using string_view = basic_string_view<char>;
+
+/** Specifies if ``T`` is a character type. Can be specialized by users. */
+template <typename T> struct is_char : std::false_type {};
+template <> struct is_char<char> : std::true_type {};
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+// A base class for compile-time strings.
+struct compile_string {};
+
+template <typename S>
+struct is_compile_string : std::is_base_of<compile_string, S> {};
+
+// Returns a string view of `s`.
+template <typename Char, FMT_ENABLE_IF(is_char<Char>::value)>
+FMT_INLINE auto to_string_view(const Char* s) -> basic_string_view<Char> {
+  return s;
+}
+template <typename Char, typename Traits, typename Alloc>
+inline auto to_string_view(const std::basic_string<Char, Traits, Alloc>& s)
+    -> basic_string_view<Char> {
+  return s;
+}
+template <typename Char>
+constexpr auto to_string_view(basic_string_view<Char> s)
+    -> basic_string_view<Char> {
+  return s;
+}
+template <typename Char,
+          FMT_ENABLE_IF(!std::is_empty<std_string_view<Char>>::value)>
+inline auto to_string_view(std_string_view<Char> s) -> basic_string_view<Char> {
+  return s;
+}
+template <typename S, FMT_ENABLE_IF(is_compile_string<S>::value)>
+constexpr auto to_string_view(const S& s)
+    -> basic_string_view<typename S::char_type> {
+  return basic_string_view<typename S::char_type>(s);
+}
+void to_string_view(...);
+
+// Specifies whether S is a string type convertible to fmt::basic_string_view.
+// It should be a constexpr function but MSVC 2017 fails to compile it in
+// enable_if and MSVC 2015 fails to compile it as an alias template.
+// ADL invocation of to_string_view is DEPRECATED!
+template <typename S>
+struct is_string : std::is_class<decltype(to_string_view(std::declval<S>()))> {
+};
+
+template <typename S, typename = void> struct char_t_impl {};
+template <typename S> struct char_t_impl<S, enable_if_t<is_string<S>::value>> {
+  using result = decltype(to_string_view(std::declval<S>()));
+  using type = typename result::value_type;
+};
+
+enum class type {
+  none_type,
+  // Integer types should go first,
+  int_type,
+  uint_type,
+  long_long_type,
+  ulong_long_type,
+  int128_type,
+  uint128_type,
+  bool_type,
+  char_type,
+  last_integer_type = char_type,
+  // followed by floating-point types.
+  float_type,
+  double_type,
+  long_double_type,
+  last_numeric_type = long_double_type,
+  cstring_type,
+  string_type,
+  pointer_type,
+  custom_type
+};
+
+// Maps core type T to the corresponding type enum constant.
+template <typename T, typename Char>
+struct type_constant : std::integral_constant<type, type::custom_type> {};
+
+#define FMT_TYPE_CONSTANT(Type, constant) \
+  template <typename Char>                \
+  struct type_constant<Type, Char>        \
+      : std::integral_constant<type, type::constant> {}
+
+FMT_TYPE_CONSTANT(int, int_type);
+FMT_TYPE_CONSTANT(unsigned, uint_type);
+FMT_TYPE_CONSTANT(long long, long_long_type);
+FMT_TYPE_CONSTANT(unsigned long long, ulong_long_type);
+FMT_TYPE_CONSTANT(int128_opt, int128_type);
+FMT_TYPE_CONSTANT(uint128_opt, uint128_type);
+FMT_TYPE_CONSTANT(bool, bool_type);
+FMT_TYPE_CONSTANT(Char, char_type);
+FMT_TYPE_CONSTANT(float, float_type);
+FMT_TYPE_CONSTANT(double, double_type);
+FMT_TYPE_CONSTANT(long double, long_double_type);
+FMT_TYPE_CONSTANT(const Char*, cstring_type);
+FMT_TYPE_CONSTANT(basic_string_view<Char>, string_type);
+FMT_TYPE_CONSTANT(const void*, pointer_type);
+
+constexpr bool is_integral_type(type t) {
+  return t > type::none_type && t <= type::last_integer_type;
+}
+
+constexpr bool is_arithmetic_type(type t) {
+  return t > type::none_type && t <= type::last_numeric_type;
+}
+
+FMT_NORETURN FMT_API void throw_format_error(const char* message);
+
+struct error_handler {
+  constexpr error_handler() = default;
+  constexpr error_handler(const error_handler&) = default;
+
+  // This function is intentionally not constexpr to give a compile-time error.
+  FMT_NORETURN void on_error(const char* message) {
+    throw_format_error(message);
+  }
+};
+FMT_END_DETAIL_NAMESPACE
+
+/** String's character type. */
+template <typename S> using char_t = typename detail::char_t_impl<S>::type;
+
+/**
+  \rst
+  Parsing context consisting of a format string range being parsed and an
+  argument counter for automatic indexing.
+  You can use the ``format_parse_context`` type alias for ``char`` instead.
+  \endrst
+ */
+template <typename Char, typename ErrorHandler = detail::error_handler>
+class basic_format_parse_context : private ErrorHandler {
+ private:
+  basic_string_view<Char> format_str_;
+  int next_arg_id_;
+
+  FMT_CONSTEXPR void do_check_arg_id(int id);
+
+ public:
+  using char_type = Char;
+  using iterator = typename basic_string_view<Char>::iterator;
+
+  explicit constexpr basic_format_parse_context(
+      basic_string_view<Char> format_str, ErrorHandler eh = {},
+      int next_arg_id = 0)
+      : ErrorHandler(eh), format_str_(format_str), next_arg_id_(next_arg_id) {}
+
+  /**
+    Returns an iterator to the beginning of the format string range being
+    parsed.
+   */
+  constexpr auto begin() const noexcept -> iterator {
+    return format_str_.begin();
+  }
+
+  /**
+    Returns an iterator past the end of the format string range being parsed.
+   */
+  constexpr auto end() const noexcept -> iterator { return format_str_.end(); }
+
+  /** Advances the begin iterator to ``it``. */
+  FMT_CONSTEXPR void advance_to(iterator it) {
+    format_str_.remove_prefix(detail::to_unsigned(it - begin()));
+  }
+
+  /**
+    Reports an error if using the manual argument indexing; otherwise returns
+    the next argument index and switches to the automatic indexing.
+   */
+  FMT_CONSTEXPR auto next_arg_id() -> int {
+    if (next_arg_id_ < 0) {
+      on_error("cannot switch from manual to automatic argument indexing");
+      return 0;
+    }
+    int id = next_arg_id_++;
+    do_check_arg_id(id);
+    return id;
+  }
+
+  /**
+    Reports an error if using the automatic argument indexing; otherwise
+    switches to the manual indexing.
+   */
+  FMT_CONSTEXPR void check_arg_id(int id) {
+    if (next_arg_id_ > 0) {
+      on_error("cannot switch from automatic to manual argument indexing");
+      return;
+    }
+    next_arg_id_ = -1;
+    do_check_arg_id(id);
+  }
+  FMT_CONSTEXPR void check_arg_id(basic_string_view<Char>) {}
+  FMT_CONSTEXPR void check_dynamic_spec(int arg_id);
+
+  FMT_CONSTEXPR void on_error(const char* message) {
+    ErrorHandler::on_error(message);
+  }
+
+  constexpr auto error_handler() const -> ErrorHandler { return *this; }
+};
+
+using format_parse_context = basic_format_parse_context<char>;
+
+FMT_BEGIN_DETAIL_NAMESPACE
+// A parse context with extra data used only in compile-time checks.
+template <typename Char, typename ErrorHandler = detail::error_handler>
+class compile_parse_context
+    : public basic_format_parse_context<Char, ErrorHandler> {
+ private:
+  int num_args_;
+  const type* types_;
+  using base = basic_format_parse_context<Char, ErrorHandler>;
+
+ public:
+  explicit FMT_CONSTEXPR compile_parse_context(
+      basic_string_view<Char> format_str, int num_args, const type* types,
+      ErrorHandler eh = {}, int next_arg_id = 0)
+      : base(format_str, eh, next_arg_id), num_args_(num_args), types_(types) {}
+
+  constexpr auto num_args() const -> int { return num_args_; }
+  constexpr auto arg_type(int id) const -> type { return types_[id]; }
+
+  FMT_CONSTEXPR auto next_arg_id() -> int {
+    int id = base::next_arg_id();
+    if (id >= num_args_) this->on_error("argument not found");
+    return id;
+  }
+
+  FMT_CONSTEXPR void check_arg_id(int id) {
+    base::check_arg_id(id);
+    if (id >= num_args_) this->on_error("argument not found");
+  }
+  using base::check_arg_id;
+
+  FMT_CONSTEXPR void check_dynamic_spec(int arg_id) {
+    if (arg_id < num_args_ && types_ && !is_integral_type(types_[arg_id]))
+      this->on_error("width/precision is not integer");
+  }
+};
+FMT_END_DETAIL_NAMESPACE
+
+template <typename Char, typename ErrorHandler>
+FMT_CONSTEXPR void
+basic_format_parse_context<Char, ErrorHandler>::do_check_arg_id(int id) {
+  // Argument id is only checked at compile-time during parsing because
+  // formatting has its own validation.
+  if (detail::is_constant_evaluated() && FMT_GCC_VERSION >= 1200) {
+    using context = detail::compile_parse_context<Char, ErrorHandler>;
+    if (id >= static_cast<context*>(this)->num_args())
+      on_error("argument not found");
+  }
+}
+
+template <typename Char, typename ErrorHandler>
+FMT_CONSTEXPR void
+basic_format_parse_context<Char, ErrorHandler>::check_dynamic_spec(int arg_id) {
+  if (detail::is_constant_evaluated()) {
+    using context = detail::compile_parse_context<Char, ErrorHandler>;
+    static_cast<context*>(this)->check_dynamic_spec(arg_id);
+  }
+}
+
+template <typename Context> class basic_format_arg;
+template <typename Context> class basic_format_args;
+template <typename Context> class dynamic_format_arg_store;
+
+// A formatter for objects of type T.
+template <typename T, typename Char = char, typename Enable = void>
+struct formatter {
+  // A deleted default constructor indicates a disabled formatter.
+  formatter() = delete;
+};
+
+// Specifies if T has an enabled formatter specialization. A type can be
+// formattable even if it doesn't have a formatter e.g. via a conversion.
+template <typename T, typename Context>
+using has_formatter =
+    std::is_constructible<typename Context::template formatter_type<T>>;
+
+// Checks whether T is a container with contiguous storage.
+template <typename T> struct is_contiguous : std::false_type {};
+template <typename Char>
+struct is_contiguous<std::basic_string<Char>> : std::true_type {};
+
+class appender;
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+template <typename Context, typename T>
+constexpr auto has_const_formatter_impl(T*)
+    -> decltype(typename Context::template formatter_type<T>().format(
+                    std::declval<const T&>(), std::declval<Context&>()),
+                true) {
+  return true;
+}
+template <typename Context>
+constexpr auto has_const_formatter_impl(...) -> bool {
+  return false;
+}
+template <typename T, typename Context>
+constexpr auto has_const_formatter() -> bool {
+  return has_const_formatter_impl<Context>(static_cast<T*>(nullptr));
+}
+
+// Extracts a reference to the container from back_insert_iterator.
+template <typename Container>
+inline auto get_container(std::back_insert_iterator<Container> it)
+    -> Container& {
+  using base = std::back_insert_iterator<Container>;
+  struct accessor : base {
+    accessor(base b) : base(b) {}
+    using base::container;
+  };
+  return *accessor(it).container;
+}
+
+template <typename Char, typename InputIt, typename OutputIt>
+FMT_CONSTEXPR auto copy_str(InputIt begin, InputIt end, OutputIt out)
+    -> OutputIt {
+  while (begin != end) *out++ = static_cast<Char>(*begin++);
+  return out;
+}
+
+template <typename Char, typename T, typename U,
+          FMT_ENABLE_IF(
+              std::is_same<remove_const_t<T>, U>::value&& is_char<U>::value)>
+FMT_CONSTEXPR auto copy_str(T* begin, T* end, U* out) -> U* {
+  if (is_constant_evaluated()) return copy_str<Char, T*, U*>(begin, end, out);
+  auto size = to_unsigned(end - begin);
+  memcpy(out, begin, size * sizeof(U));
+  return out + size;
+}
+
+/**
+  \rst
+  A contiguous memory buffer with an optional growing ability. It is an internal
+  class and shouldn't be used directly, only via `~fmt::basic_memory_buffer`.
+  \endrst
+ */
+template <typename T> class buffer {
+ private:
+  T* ptr_;
+  size_t size_;
+  size_t capacity_;
+
+ protected:
+  // Don't initialize ptr_ since it is not accessed to save a few cycles.
+  FMT_MSC_WARNING(suppress : 26495)
+  buffer(size_t sz) noexcept : size_(sz), capacity_(sz) {}
+
+  FMT_CONSTEXPR20 buffer(T* p = nullptr, size_t sz = 0, size_t cap = 0) noexcept
+      : ptr_(p), size_(sz), capacity_(cap) {}
+
+  FMT_CONSTEXPR20 ~buffer() = default;
+  buffer(buffer&&) = default;
+
+  /** Sets the buffer data and capacity. */
+  FMT_CONSTEXPR void set(T* buf_data, size_t buf_capacity) noexcept {
+    ptr_ = buf_data;
+    capacity_ = buf_capacity;
+  }
+
+  /** Increases the buffer capacity to hold at least *capacity* elements. */
+  virtual FMT_CONSTEXPR20 void grow(size_t capacity) = 0;
+
+ public:
+  using value_type = T;
+  using const_reference = const T&;
+
+  buffer(const buffer&) = delete;
+  void operator=(const buffer&) = delete;
+
+  auto begin() noexcept -> T* { return ptr_; }
+  auto end() noexcept -> T* { return ptr_ + size_; }
+
+  auto begin() const noexcept -> const T* { return ptr_; }
+  auto end() const noexcept -> const T* { return ptr_ + size_; }
+
+  /** Returns the size of this buffer. */
+  constexpr auto size() const noexcept -> size_t { return size_; }
+
+  /** Returns the capacity of this buffer. */
+  constexpr auto capacity() const noexcept -> size_t { return capacity_; }
+
+  /** Returns a pointer to the buffer data. */
+  FMT_CONSTEXPR auto data() noexcept -> T* { return ptr_; }
+
+  /** Returns a pointer to the buffer data. */
+  FMT_CONSTEXPR auto data() const noexcept -> const T* { return ptr_; }
+
+  /** Clears this buffer. */
+  void clear() { size_ = 0; }
+
+  // Tries resizing the buffer to contain *count* elements. If T is a POD type
+  // the new elements may not be initialized.
+  FMT_CONSTEXPR20 void try_resize(size_t count) {
+    try_reserve(count);
+    size_ = count <= capacity_ ? count : capacity_;
+  }
+
+  // Tries increasing the buffer capacity to *new_capacity*. It can increase the
+  // capacity by a smaller amount than requested but guarantees there is space
+  // for at least one additional element either by increasing the capacity or by
+  // flushing the buffer if it is full.
+  FMT_CONSTEXPR20 void try_reserve(size_t new_capacity) {
+    if (new_capacity > capacity_) grow(new_capacity);
+  }
+
+  FMT_CONSTEXPR20 void push_back(const T& value) {
+    try_reserve(size_ + 1);
+    ptr_[size_++] = value;
+  }
+
+  /** Appends data to the end of the buffer. */
+  template <typename U> void append(const U* begin, const U* end);
+
+  template <typename Idx> FMT_CONSTEXPR auto operator[](Idx index) -> T& {
+    return ptr_[index];
+  }
+  template <typename Idx>
+  FMT_CONSTEXPR auto operator[](Idx index) const -> const T& {
+    return ptr_[index];
+  }
+};
+
+struct buffer_traits {
+  explicit buffer_traits(size_t) {}
+  auto count() const -> size_t { return 0; }
+  auto limit(size_t size) -> size_t { return size; }
+};
+
+class fixed_buffer_traits {
+ private:
+  size_t count_ = 0;
+  size_t limit_;
+
+ public:
+  explicit fixed_buffer_traits(size_t limit) : limit_(limit) {}
+  auto count() const -> size_t { return count_; }
+  auto limit(size_t size) -> size_t {
+    size_t n = limit_ > count_ ? limit_ - count_ : 0;
+    count_ += size;
+    return size < n ? size : n;
+  }
+};
+
+// A buffer that writes to an output iterator when flushed.
+template <typename OutputIt, typename T, typename Traits = buffer_traits>
+class iterator_buffer final : public Traits, public buffer<T> {
+ private:
+  OutputIt out_;
+  enum { buffer_size = 256 };
+  T data_[buffer_size];
+
+ protected:
+  FMT_CONSTEXPR20 void grow(size_t) override {
+    if (this->size() == buffer_size) flush();
+  }
+
+  void flush() {
+    auto size = this->size();
+    this->clear();
+    out_ = copy_str<T>(data_, data_ + this->limit(size), out_);
+  }
+
+ public:
+  explicit iterator_buffer(OutputIt out, size_t n = buffer_size)
+      : Traits(n), buffer<T>(data_, 0, buffer_size), out_(out) {}
+  iterator_buffer(iterator_buffer&& other)
+      : Traits(other), buffer<T>(data_, 0, buffer_size), out_(other.out_) {}
+  ~iterator_buffer() { flush(); }
+
+  auto out() -> OutputIt {
+    flush();
+    return out_;
+  }
+  auto count() const -> size_t { return Traits::count() + this->size(); }
+};
+
+template <typename T>
+class iterator_buffer<T*, T, fixed_buffer_traits> final
+    : public fixed_buffer_traits,
+      public buffer<T> {
+ private:
+  T* out_;
+  enum { buffer_size = 256 };
+  T data_[buffer_size];
+
+ protected:
+  FMT_CONSTEXPR20 void grow(size_t) override {
+    if (this->size() == this->capacity()) flush();
+  }
+
+  void flush() {
+    size_t n = this->limit(this->size());
+    if (this->data() == out_) {
+      out_ += n;
+      this->set(data_, buffer_size);
+    }
+    this->clear();
+  }
+
+ public:
+  explicit iterator_buffer(T* out, size_t n = buffer_size)
+      : fixed_buffer_traits(n), buffer<T>(out, 0, n), out_(out) {}
+  iterator_buffer(iterator_buffer&& other)
+      : fixed_buffer_traits(other),
+        buffer<T>(std::move(other)),
+        out_(other.out_) {
+    if (this->data() != out_) {
+      this->set(data_, buffer_size);
+      this->clear();
+    }
+  }
+  ~iterator_buffer() { flush(); }
+
+  auto out() -> T* {
+    flush();
+    return out_;
+  }
+  auto count() const -> size_t {
+    return fixed_buffer_traits::count() + this->size();
+  }
+};
+
+template <typename T> class iterator_buffer<T*, T> final : public buffer<T> {
+ protected:
+  FMT_CONSTEXPR20 void grow(size_t) override {}
+
+ public:
+  explicit iterator_buffer(T* out, size_t = 0) : buffer<T>(out, 0, ~size_t()) {}
+
+  auto out() -> T* { return &*this->end(); }
+};
+
+// A buffer that writes to a container with the contiguous storage.
+template <typename Container>
+class iterator_buffer<std::back_insert_iterator<Container>,
+                      enable_if_t<is_contiguous<Container>::value,
+                                  typename Container::value_type>>
+    final : public buffer<typename Container::value_type> {
+ private:
+  Container& container_;
+
+ protected:
+  FMT_CONSTEXPR20 void grow(size_t capacity) override {
+    container_.resize(capacity);
+    this->set(&container_[0], capacity);
+  }
+
+ public:
+  explicit iterator_buffer(Container& c)
+      : buffer<typename Container::value_type>(c.size()), container_(c) {}
+  explicit iterator_buffer(std::back_insert_iterator<Container> out, size_t = 0)
+      : iterator_buffer(get_container(out)) {}
+
+  auto out() -> std::back_insert_iterator<Container> {
+    return std::back_inserter(container_);
+  }
+};
+
+// A buffer that counts the number of code units written discarding the output.
+template <typename T = char> class counting_buffer final : public buffer<T> {
+ private:
+  enum { buffer_size = 256 };
+  T data_[buffer_size];
+  size_t count_ = 0;
+
+ protected:
+  FMT_CONSTEXPR20 void grow(size_t) override {
+    if (this->size() != buffer_size) return;
+    count_ += this->size();
+    this->clear();
+  }
+
+ public:
+  counting_buffer() : buffer<T>(data_, 0, buffer_size) {}
+
+  auto count() -> size_t { return count_ + this->size(); }
+};
+
+template <typename T>
+using buffer_appender = conditional_t<std::is_same<T, char>::value, appender,
+                                      std::back_insert_iterator<buffer<T>>>;
+
+// Maps an output iterator to a buffer.
+template <typename T, typename OutputIt>
+auto get_buffer(OutputIt out) -> iterator_buffer<OutputIt, T> {
+  return iterator_buffer<OutputIt, T>(out);
+}
+
+template <typename Buffer>
+auto get_iterator(Buffer& buf) -> decltype(buf.out()) {
+  return buf.out();
+}
+template <typename T> auto get_iterator(buffer<T>& buf) -> buffer_appender<T> {
+  return buffer_appender<T>(buf);
+}
+
+template <typename T, typename Char = char, typename Enable = void>
+struct fallback_formatter {
+  fallback_formatter() = delete;
+};
+
+// Specifies if T has an enabled fallback_formatter specialization.
+template <typename T, typename Char>
+using has_fallback_formatter =
+#ifdef FMT_DEPRECATED_OSTREAM
+    std::is_constructible<fallback_formatter<T, Char>>;
+#else
+    std::false_type;
+#endif
+
+struct view {};
+
+template <typename Char, typename T> struct named_arg : view {
+  const Char* name;
+  const T& value;
+  named_arg(const Char* n, const T& v) : name(n), value(v) {}
+};
+
+template <typename Char> struct named_arg_info {
+  const Char* name;
+  int id;
+};
+
+template <typename T, typename Char, size_t NUM_ARGS, size_t NUM_NAMED_ARGS>
+struct arg_data {
+  // args_[0].named_args points to named_args_ to avoid bloating format_args.
+  // +1 to workaround a bug in gcc 7.5 that causes duplicated-branches warning.
+  T args_[1 + (NUM_ARGS != 0 ? NUM_ARGS : +1)];
+  named_arg_info<Char> named_args_[NUM_NAMED_ARGS];
+
+  template <typename... U>
+  arg_data(const U&... init) : args_{T(named_args_, NUM_NAMED_ARGS), init...} {}
+  arg_data(const arg_data& other) = delete;
+  auto args() const -> const T* { return args_ + 1; }
+  auto named_args() -> named_arg_info<Char>* { return named_args_; }
+};
+
+template <typename T, typename Char, size_t NUM_ARGS>
+struct arg_data<T, Char, NUM_ARGS, 0> {
+  // +1 to workaround a bug in gcc 7.5 that causes duplicated-branches warning.
+  T args_[NUM_ARGS != 0 ? NUM_ARGS : +1];
+
+  template <typename... U>
+  FMT_CONSTEXPR FMT_INLINE arg_data(const U&... init) : args_{init...} {}
+  FMT_CONSTEXPR FMT_INLINE auto args() const -> const T* { return args_; }
+  FMT_CONSTEXPR FMT_INLINE auto named_args() -> std::nullptr_t {
+    return nullptr;
+  }
+};
+
+template <typename Char>
+inline void init_named_args(named_arg_info<Char>*, int, int) {}
+
+template <typename T> struct is_named_arg : std::false_type {};
+template <typename T> struct is_statically_named_arg : std::false_type {};
+
+template <typename T, typename Char>
+struct is_named_arg<named_arg<Char, T>> : std::true_type {};
+
+template <typename Char, typename T, typename... Tail,
+          FMT_ENABLE_IF(!is_named_arg<T>::value)>
+void init_named_args(named_arg_info<Char>* named_args, int arg_count,
+                     int named_arg_count, const T&, const Tail&... args) {
+  init_named_args(named_args, arg_count + 1, named_arg_count, args...);
+}
+
+template <typename Char, typename T, typename... Tail,
+          FMT_ENABLE_IF(is_named_arg<T>::value)>
+void init_named_args(named_arg_info<Char>* named_args, int arg_count,
+                     int named_arg_count, const T& arg, const Tail&... args) {
+  named_args[named_arg_count++] = {arg.name, arg_count};
+  init_named_args(named_args, arg_count + 1, named_arg_count, args...);
+}
+
+template <typename... Args>
+FMT_CONSTEXPR FMT_INLINE void init_named_args(std::nullptr_t, int, int,
+                                              const Args&...) {}
+
+template <bool B = false> constexpr auto count() -> size_t { return B ? 1 : 0; }
+template <bool B1, bool B2, bool... Tail> constexpr auto count() -> size_t {
+  return (B1 ? 1 : 0) + count<B2, Tail...>();
+}
+
+template <typename... Args> constexpr auto count_named_args() -> size_t {
+  return count<is_named_arg<Args>::value...>();
+}
+
+template <typename... Args>
+constexpr auto count_statically_named_args() -> size_t {
+  return count<is_statically_named_arg<Args>::value...>();
+}
+
+struct unformattable {};
+struct unformattable_char : unformattable {};
+struct unformattable_const : unformattable {};
+struct unformattable_pointer : unformattable {};
+
+template <typename Char> struct string_value {
+  const Char* data;
+  size_t size;
+};
+
+template <typename Char> struct named_arg_value {
+  const named_arg_info<Char>* data;
+  size_t size;
+};
+
+template <typename Context> struct custom_value {
+  using parse_context = typename Context::parse_context_type;
+  void* value;
+  void (*format)(void* arg, parse_context& parse_ctx, Context& ctx);
+};
+
+// A formatting argument value.
+template <typename Context> class value {
+ public:
+  using char_type = typename Context::char_type;
+
+  union {
+    monostate no_value;
+    int int_value;
+    unsigned uint_value;
+    long long long_long_value;
+    unsigned long long ulong_long_value;
+    int128_opt int128_value;
+    uint128_opt uint128_value;
+    bool bool_value;
+    char_type char_value;
+    float float_value;
+    double double_value;
+    long double long_double_value;
+    const void* pointer;
+    string_value<char_type> string;
+    custom_value<Context> custom;
+    named_arg_value<char_type> named_args;
+  };
+
+  constexpr FMT_INLINE value() : no_value() {}
+  constexpr FMT_INLINE value(int val) : int_value(val) {}
+  constexpr FMT_INLINE value(unsigned val) : uint_value(val) {}
+  constexpr FMT_INLINE value(long long val) : long_long_value(val) {}
+  constexpr FMT_INLINE value(unsigned long long val) : ulong_long_value(val) {}
+  FMT_INLINE value(int128_opt val) : int128_value(val) {}
+  FMT_INLINE value(uint128_opt val) : uint128_value(val) {}
+  constexpr FMT_INLINE value(float val) : float_value(val) {}
+  constexpr FMT_INLINE value(double val) : double_value(val) {}
+  FMT_INLINE value(long double val) : long_double_value(val) {}
+  constexpr FMT_INLINE value(bool val) : bool_value(val) {}
+  constexpr FMT_INLINE value(char_type val) : char_value(val) {}
+  FMT_CONSTEXPR FMT_INLINE value(const char_type* val) {
+    string.data = val;
+    if (is_constant_evaluated()) string.size = {};
+  }
+  FMT_CONSTEXPR FMT_INLINE value(basic_string_view<char_type> val) {
+    string.data = val.data();
+    string.size = val.size();
+  }
+  FMT_INLINE value(const void* val) : pointer(val) {}
+  FMT_INLINE value(const named_arg_info<char_type>* args, size_t size)
+      : named_args{args, size} {}
+
+  template <typename T> FMT_CONSTEXPR FMT_INLINE value(T& val) {
+    using value_type = remove_cvref_t<T>;
+    custom.value = const_cast<value_type*>(&val);
+    // Get the formatter type through the context to allow different contexts
+    // have different extension points, e.g. `formatter<T>` for `format` and
+    // `printf_formatter<T>` for `printf`.
+    custom.format = format_custom_arg<
+        value_type,
+        conditional_t<has_formatter<value_type, Context>::value,
+                      typename Context::template formatter_type<value_type>,
+                      fallback_formatter<value_type, char_type>>>;
+  }
+  value(unformattable);
+  value(unformattable_char);
+  value(unformattable_const);
+  value(unformattable_pointer);
+
+ private:
+  // Formats an argument of a custom type, such as a user-defined class.
+  template <typename T, typename Formatter>
+  static void format_custom_arg(void* arg,
+                                typename Context::parse_context_type& parse_ctx,
+                                Context& ctx) {
+    auto f = Formatter();
+    parse_ctx.advance_to(f.parse(parse_ctx));
+    using qualified_type =
+        conditional_t<has_const_formatter<T, Context>(), const T, T>;
+    ctx.advance_to(f.format(*static_cast<qualified_type*>(arg), ctx));
+  }
+};
+
+template <typename Context, typename T>
+FMT_CONSTEXPR auto make_arg(T&& value) -> basic_format_arg<Context>;
+
+// To minimize the number of types we need to deal with, long is translated
+// either to int or to long long depending on its size.
+enum { long_short = sizeof(long) == sizeof(int) };
+using long_type = conditional_t<long_short, int, long long>;
+using ulong_type = conditional_t<long_short, unsigned, unsigned long long>;
+
+#ifdef __cpp_lib_byte
+inline auto format_as(std::byte b) -> unsigned char {
+  return static_cast<unsigned char>(b);
+}
+#endif
+
+template <typename T> struct has_format_as {
+  template <typename U, typename V = decltype(format_as(U())),
+            FMT_ENABLE_IF(std::is_enum<U>::value&& std::is_integral<V>::value)>
+  static auto check(U*) -> std::true_type;
+  static auto check(...) -> std::false_type;
+
+  enum { value = decltype(check(static_cast<T*>(nullptr)))::value };
+};
+
+// Maps formatting arguments to core types.
+// arg_mapper reports errors by returning unformattable instead of using
+// static_assert because it's used in the is_formattable trait.
+template <typename Context> struct arg_mapper {
+  using char_type = typename Context::char_type;
+
+  FMT_CONSTEXPR FMT_INLINE auto map(signed char val) -> int { return val; }
+  FMT_CONSTEXPR FMT_INLINE auto map(unsigned char val) -> unsigned {
+    return val;
+  }
+  FMT_CONSTEXPR FMT_INLINE auto map(short val) -> int { return val; }
+  FMT_CONSTEXPR FMT_INLINE auto map(unsigned short val) -> unsigned {
+    return val;
+  }
+  FMT_CONSTEXPR FMT_INLINE auto map(int val) -> int { return val; }
+  FMT_CONSTEXPR FMT_INLINE auto map(unsigned val) -> unsigned { return val; }
+  FMT_CONSTEXPR FMT_INLINE auto map(long val) -> long_type { return val; }
+  FMT_CONSTEXPR FMT_INLINE auto map(unsigned long val) -> ulong_type {
+    return val;
+  }
+  FMT_CONSTEXPR FMT_INLINE auto map(long long val) -> long long { return val; }
+  FMT_CONSTEXPR FMT_INLINE auto map(unsigned long long val)
+      -> unsigned long long {
+    return val;
+  }
+  FMT_CONSTEXPR FMT_INLINE auto map(int128_opt val) -> int128_opt {
+    return val;
+  }
+  FMT_CONSTEXPR FMT_INLINE auto map(uint128_opt val) -> uint128_opt {
+    return val;
+  }
+  FMT_CONSTEXPR FMT_INLINE auto map(bool val) -> bool { return val; }
+
+  template <typename T, FMT_ENABLE_IF(std::is_same<T, char>::value ||
+                                      std::is_same<T, char_type>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto map(T val) -> char_type {
+    return val;
+  }
+  template <typename T, enable_if_t<(std::is_same<T, wchar_t>::value ||
+#ifdef __cpp_char8_t
+                                     std::is_same<T, char8_t>::value ||
+#endif
+                                     std::is_same<T, char16_t>::value ||
+                                     std::is_same<T, char32_t>::value) &&
+                                        !std::is_same<T, char_type>::value,
+                                    int> = 0>
+  FMT_CONSTEXPR FMT_INLINE auto map(T) -> unformattable_char {
+    return {};
+  }
+
+  FMT_CONSTEXPR FMT_INLINE auto map(float val) -> float { return val; }
+  FMT_CONSTEXPR FMT_INLINE auto map(double val) -> double { return val; }
+  FMT_CONSTEXPR FMT_INLINE auto map(long double val) -> long double {
+    return val;
+  }
+
+  FMT_CONSTEXPR FMT_INLINE auto map(char_type* val) -> const char_type* {
+    return val;
+  }
+  FMT_CONSTEXPR FMT_INLINE auto map(const char_type* val) -> const char_type* {
+    return val;
+  }
+  template <typename T,
+            FMT_ENABLE_IF(is_string<T>::value && !std::is_pointer<T>::value &&
+                          std::is_same<char_type, char_t<T>>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto map(const T& val)
+      -> basic_string_view<char_type> {
+    return to_string_view(val);
+  }
+  template <typename T,
+            FMT_ENABLE_IF(is_string<T>::value && !std::is_pointer<T>::value &&
+                          !std::is_same<char_type, char_t<T>>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto map(const T&) -> unformattable_char {
+    return {};
+  }
+  template <typename T,
+            FMT_ENABLE_IF(
+                std::is_convertible<T, basic_string_view<char_type>>::value &&
+                !is_string<T>::value && !has_formatter<T, Context>::value &&
+                !has_fallback_formatter<T, char_type>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto map(const T& val)
+      -> basic_string_view<char_type> {
+    return basic_string_view<char_type>(val);
+  }
+  template <typename T,
+            FMT_ENABLE_IF(
+                std::is_convertible<T, std_string_view<char_type>>::value &&
+                !std::is_convertible<T, basic_string_view<char_type>>::value &&
+                !is_string<T>::value && !has_formatter<T, Context>::value &&
+                !has_fallback_formatter<T, char_type>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto map(const T& val)
+      -> basic_string_view<char_type> {
+    return std_string_view<char_type>(val);
+  }
+
+  FMT_CONSTEXPR FMT_INLINE auto map(void* val) -> const void* { return val; }
+  FMT_CONSTEXPR FMT_INLINE auto map(const void* val) -> const void* {
+    return val;
+  }
+  FMT_CONSTEXPR FMT_INLINE auto map(std::nullptr_t val) -> const void* {
+    return val;
+  }
+
+  // We use SFINAE instead of a const T* parameter to avoid conflicting with
+  // the C array overload.
+  template <
+      typename T,
+      FMT_ENABLE_IF(
+          std::is_pointer<T>::value || std::is_member_pointer<T>::value ||
+          std::is_function<typename std::remove_pointer<T>::type>::value ||
+          (std::is_convertible<const T&, const void*>::value &&
+           !std::is_convertible<const T&, const char_type*>::value &&
+           !has_formatter<T, Context>::value))>
+  FMT_CONSTEXPR auto map(const T&) -> unformattable_pointer {
+    return {};
+  }
+
+  template <typename T, std::size_t N,
+            FMT_ENABLE_IF(!std::is_same<T, wchar_t>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto map(const T (&values)[N]) -> const T (&)[N] {
+    return values;
+  }
+
+  template <typename T,
+            FMT_ENABLE_IF(
+                std::is_enum<T>::value&& std::is_convertible<T, int>::value &&
+                !has_format_as<T>::value && !has_formatter<T, Context>::value &&
+                !has_fallback_formatter<T, char_type>::value)>
+  FMT_DEPRECATED FMT_CONSTEXPR FMT_INLINE auto map(const T& val)
+      -> decltype(std::declval<arg_mapper>().map(
+          static_cast<underlying_t<T>>(val))) {
+    return map(static_cast<underlying_t<T>>(val));
+  }
+
+  template <typename T, FMT_ENABLE_IF(has_format_as<T>::value &&
+                                      !has_formatter<T, Context>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto map(const T& val)
+      -> decltype(std::declval<arg_mapper>().map(format_as(T()))) {
+    return map(format_as(val));
+  }
+
+  template <typename T, typename U = remove_cvref_t<T>>
+  struct formattable
+      : bool_constant<has_const_formatter<U, Context>() ||
+                      !std::is_const<remove_reference_t<T>>::value ||
+                      has_fallback_formatter<U, char_type>::value> {};
+
+#if (FMT_MSC_VERSION != 0 && FMT_MSC_VERSION < 1910) || \
+    FMT_ICC_VERSION != 0 || defined(__NVCC__)
+  // Workaround a bug in MSVC and Intel (Issue 2746).
+  template <typename T> FMT_CONSTEXPR FMT_INLINE auto do_map(T&& val) -> T& {
+    return val;
+  }
+#else
+  template <typename T, FMT_ENABLE_IF(formattable<T>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto do_map(T&& val) -> T& {
+    return val;
+  }
+  template <typename T, FMT_ENABLE_IF(!formattable<T>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto do_map(T&&) -> unformattable_const {
+    return {};
+  }
+#endif
+
+  template <typename T, typename U = remove_cvref_t<T>,
+            FMT_ENABLE_IF(!is_string<U>::value && !is_char<U>::value &&
+                          !std::is_array<U>::value &&
+                          !std::is_pointer<U>::value &&
+                          !has_format_as<U>::value &&
+                          (has_formatter<U, Context>::value ||
+                           has_fallback_formatter<U, char_type>::value))>
+  FMT_CONSTEXPR FMT_INLINE auto map(T&& val)
+      -> decltype(this->do_map(std::forward<T>(val))) {
+    return do_map(std::forward<T>(val));
+  }
+
+  template <typename T, FMT_ENABLE_IF(is_named_arg<T>::value)>
+  FMT_CONSTEXPR FMT_INLINE auto map(const T& named_arg)
+      -> decltype(std::declval<arg_mapper>().map(named_arg.value)) {
+    return map(named_arg.value);
+  }
+
+  auto map(...) -> unformattable { return {}; }
+};
+
+// A type constant after applying arg_mapper<Context>.
+template <typename T, typename Context>
+using mapped_type_constant =
+    type_constant<decltype(arg_mapper<Context>().map(std::declval<const T&>())),
+                  typename Context::char_type>;
+
+enum { packed_arg_bits = 4 };
+// Maximum number of arguments with packed types.
+enum { max_packed_args = 62 / packed_arg_bits };
+enum : unsigned long long { is_unpacked_bit = 1ULL << 63 };
+enum : unsigned long long { has_named_args_bit = 1ULL << 62 };
+
+FMT_END_DETAIL_NAMESPACE
+
+// An output iterator that appends to a buffer.
+// It is used to reduce symbol sizes for the common case.
+class appender : public std::back_insert_iterator<detail::buffer<char>> {
+  using base = std::back_insert_iterator<detail::buffer<char>>;
+
+  template <typename T>
+  friend auto get_buffer(appender out) -> detail::buffer<char>& {
+    return detail::get_container(out);
+  }
+
+ public:
+  using std::back_insert_iterator<detail::buffer<char>>::back_insert_iterator;
+  appender(base it) noexcept : base(it) {}
+  FMT_UNCHECKED_ITERATOR(appender);
+
+  auto operator++() noexcept -> appender& { return *this; }
+  auto operator++(int) noexcept -> appender { return *this; }
+};
+
+// A formatting argument. It is a trivially copyable/constructible type to
+// allow storage in basic_memory_buffer.
+template <typename Context> class basic_format_arg {
+ private:
+  detail::value<Context> value_;
+  detail::type type_;
+
+  template <typename ContextType, typename T>
+  friend FMT_CONSTEXPR auto detail::make_arg(T&& value)
+      -> basic_format_arg<ContextType>;
+
+  template <typename Visitor, typename Ctx>
+  friend FMT_CONSTEXPR auto visit_format_arg(Visitor&& vis,
+                                             const basic_format_arg<Ctx>& arg)
+      -> decltype(vis(0));
+
+  friend class basic_format_args<Context>;
+  friend class dynamic_format_arg_store<Context>;
+
+  using char_type = typename Context::char_type;
+
+  template <typename T, typename Char, size_t NUM_ARGS, size_t NUM_NAMED_ARGS>
+  friend struct detail::arg_data;
+
+  basic_format_arg(const detail::named_arg_info<char_type>* args, size_t size)
+      : value_(args, size) {}
+
+ public:
+  class handle {
+   public:
+    explicit handle(detail::custom_value<Context> custom) : custom_(custom) {}
+
+    void format(typename Context::parse_context_type& parse_ctx,
+                Context& ctx) const {
+      custom_.format(custom_.value, parse_ctx, ctx);
+    }
+
+   private:
+    detail::custom_value<Context> custom_;
+  };
+
+  constexpr basic_format_arg() : type_(detail::type::none_type) {}
+
+  constexpr explicit operator bool() const noexcept {
+    return type_ != detail::type::none_type;
+  }
+
+  auto type() const -> detail::type { return type_; }
+
+  auto is_integral() const -> bool { return detail::is_integral_type(type_); }
+  auto is_arithmetic() const -> bool {
+    return detail::is_arithmetic_type(type_);
+  }
+};
+
+/**
+  \rst
+  Visits an argument dispatching to the appropriate visit method based on
+  the argument type. For example, if the argument type is ``double`` then
+  ``vis(value)`` will be called with the value of type ``double``.
+  \endrst
+ */
+template <typename Visitor, typename Context>
+FMT_CONSTEXPR FMT_INLINE auto visit_format_arg(
+    Visitor&& vis, const basic_format_arg<Context>& arg) -> decltype(vis(0)) {
+  switch (arg.type_) {
+  case detail::type::none_type:
+    break;
+  case detail::type::int_type:
+    return vis(arg.value_.int_value);
+  case detail::type::uint_type:
+    return vis(arg.value_.uint_value);
+  case detail::type::long_long_type:
+    return vis(arg.value_.long_long_value);
+  case detail::type::ulong_long_type:
+    return vis(arg.value_.ulong_long_value);
+  case detail::type::int128_type:
+    return vis(detail::convert_for_visit(arg.value_.int128_value));
+  case detail::type::uint128_type:
+    return vis(detail::convert_for_visit(arg.value_.uint128_value));
+  case detail::type::bool_type:
+    return vis(arg.value_.bool_value);
+  case detail::type::char_type:
+    return vis(arg.value_.char_value);
+  case detail::type::float_type:
+    return vis(arg.value_.float_value);
+  case detail::type::double_type:
+    return vis(arg.value_.double_value);
+  case detail::type::long_double_type:
+    return vis(arg.value_.long_double_value);
+  case detail::type::cstring_type:
+    return vis(arg.value_.string.data);
+  case detail::type::string_type:
+    using sv = basic_string_view<typename Context::char_type>;
+    return vis(sv(arg.value_.string.data, arg.value_.string.size));
+  case detail::type::pointer_type:
+    return vis(arg.value_.pointer);
+  case detail::type::custom_type:
+    return vis(typename basic_format_arg<Context>::handle(arg.value_.custom));
+  }
+  return vis(monostate());
+}
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+template <typename Char, typename InputIt>
+auto copy_str(InputIt begin, InputIt end, appender out) -> appender {
+  get_container(out).append(begin, end);
+  return out;
+}
+
+template <typename Char, typename R, typename OutputIt>
+FMT_CONSTEXPR auto copy_str(R&& rng, OutputIt out) -> OutputIt {
+  return detail::copy_str<Char>(rng.begin(), rng.end(), out);
+}
+
+#if FMT_GCC_VERSION && FMT_GCC_VERSION < 500
+// A workaround for gcc 4.8 to make void_t work in a SFINAE context.
+template <typename... Ts> struct void_t_impl { using type = void; };
+template <typename... Ts>
+using void_t = typename detail::void_t_impl<Ts...>::type;
+#else
+template <typename...> using void_t = void;
+#endif
+
+template <typename It, typename T, typename Enable = void>
+struct is_output_iterator : std::false_type {};
+
+template <typename It, typename T>
+struct is_output_iterator<
+    It, T,
+    void_t<typename std::iterator_traits<It>::iterator_category,
+           decltype(*std::declval<It>() = std::declval<T>())>>
+    : std::true_type {};
+
+template <typename OutputIt>
+struct is_back_insert_iterator : std::false_type {};
+template <typename Container>
+struct is_back_insert_iterator<std::back_insert_iterator<Container>>
+    : std::true_type {};
+
+template <typename OutputIt>
+struct is_contiguous_back_insert_iterator : std::false_type {};
+template <typename Container>
+struct is_contiguous_back_insert_iterator<std::back_insert_iterator<Container>>
+    : is_contiguous<Container> {};
+template <>
+struct is_contiguous_back_insert_iterator<appender> : std::true_type {};
+
+// A type-erased reference to an std::locale to avoid a heavy <locale> include.
+class locale_ref {
+ private:
+  const void* locale_;  // A type-erased pointer to std::locale.
+
+ public:
+  constexpr locale_ref() : locale_(nullptr) {}
+  template <typename Locale> explicit locale_ref(const Locale& loc);
+
+  explicit operator bool() const noexcept { return locale_ != nullptr; }
+
+  template <typename Locale> auto get() const -> Locale;
+};
+
+template <typename> constexpr auto encode_types() -> unsigned long long {
+  return 0;
+}
+
+template <typename Context, typename Arg, typename... Args>
+constexpr auto encode_types() -> unsigned long long {
+  return static_cast<unsigned>(mapped_type_constant<Arg, Context>::value) |
+         (encode_types<Context, Args...>() << packed_arg_bits);
+}
+
+template <typename Context, typename T>
+FMT_CONSTEXPR FMT_INLINE auto make_value(T&& val) -> value<Context> {
+  const auto arg = arg_mapper<Context>().map(FMT_FORWARD(val));
+
+  constexpr bool formattable_char =
+      !std::is_same<decltype(arg), const unformattable_char&>::value;
+  static_assert(formattable_char, "Mixing character types is disallowed.");
+
+  constexpr bool formattable_const =
+      !std::is_same<decltype(arg), const unformattable_const&>::value;
+  static_assert(formattable_const, "Cannot format a const argument.");
+
+  // Formatting of arbitrary pointers is disallowed. If you want to output
+  // a pointer cast it to "void *" or "const void *". In particular, this
+  // forbids formatting of "[const] volatile char *" which is printed as bool
+  // by iostreams.
+  constexpr bool formattable_pointer =
+      !std::is_same<decltype(arg), const unformattable_pointer&>::value;
+  static_assert(formattable_pointer,
+                "Formatting of non-void pointers is disallowed.");
+
+  constexpr bool formattable =
+      !std::is_same<decltype(arg), const unformattable&>::value;
+  static_assert(
+      formattable,
+      "Cannot format an argument. To make type T formattable provide a "
+      "formatter<T> specialization: https://fmt.dev/latest/api.html#udt");
+  return {arg};
+}
+
+template <typename Context, typename T>
+FMT_CONSTEXPR auto make_arg(T&& value) -> basic_format_arg<Context> {
+  basic_format_arg<Context> arg;
+  arg.type_ = mapped_type_constant<T, Context>::value;
+  arg.value_ = make_value<Context>(value);
+  return arg;
+}
+
+// The type template parameter is there to avoid an ODR violation when using
+// a fallback formatter in one translation unit and an implicit conversion in
+// another (not recommended).
+template <bool IS_PACKED, typename Context, type, typename T,
+          FMT_ENABLE_IF(IS_PACKED)>
+FMT_CONSTEXPR FMT_INLINE auto make_arg(T&& val) -> value<Context> {
+  return make_value<Context>(val);
+}
+
+template <bool IS_PACKED, typename Context, type, typename T,
+          FMT_ENABLE_IF(!IS_PACKED)>
+FMT_CONSTEXPR inline auto make_arg(T&& value) -> basic_format_arg<Context> {
+  return make_arg<Context>(value);
+}
+FMT_END_DETAIL_NAMESPACE
+
+// Formatting context.
+template <typename OutputIt, typename Char> class basic_format_context {
+ public:
+  /** The character type for the output. */
+  using char_type = Char;
+
+ private:
+  OutputIt out_;
+  basic_format_args<basic_format_context> args_;
+  detail::locale_ref loc_;
+
+ public:
+  using iterator = OutputIt;
+  using format_arg = basic_format_arg<basic_format_context>;
+  using parse_context_type = basic_format_parse_context<Char>;
+  template <typename T> using formatter_type = formatter<T, char_type>;
+
+  basic_format_context(basic_format_context&&) = default;
+  basic_format_context(const basic_format_context&) = delete;
+  void operator=(const basic_format_context&) = delete;
+  /**
+   Constructs a ``basic_format_context`` object. References to the arguments are
+   stored in the object so make sure they have appropriate lifetimes.
+   */
+  constexpr basic_format_context(
+      OutputIt out, basic_format_args<basic_format_context> ctx_args,
+      detail::locale_ref loc = detail::locale_ref())
+      : out_(out), args_(ctx_args), loc_(loc) {}
+
+  constexpr auto arg(int id) const -> format_arg { return args_.get(id); }
+  FMT_CONSTEXPR auto arg(basic_string_view<char_type> name) -> format_arg {
+    return args_.get(name);
+  }
+  FMT_CONSTEXPR auto arg_id(basic_string_view<char_type> name) -> int {
+    return args_.get_id(name);
+  }
+  auto args() const -> const basic_format_args<basic_format_context>& {
+    return args_;
+  }
+
+  FMT_CONSTEXPR auto error_handler() -> detail::error_handler { return {}; }
+  void on_error(const char* message) { error_handler().on_error(message); }
+
+  // Returns an iterator to the beginning of the output range.
+  FMT_CONSTEXPR auto out() -> iterator { return out_; }
+
+  // Advances the begin iterator to ``it``.
+  void advance_to(iterator it) {
+    if (!detail::is_back_insert_iterator<iterator>()) out_ = it;
+  }
+
+  FMT_CONSTEXPR auto locale() -> detail::locale_ref { return loc_; }
+};
+
+template <typename Char>
+using buffer_context =
+    basic_format_context<detail::buffer_appender<Char>, Char>;
+using format_context = buffer_context<char>;
+
+// Workaround an alias issue: https://stackoverflow.com/q/62767544/471164.
+#define FMT_BUFFER_CONTEXT(Char) \
+  basic_format_context<detail::buffer_appender<Char>, Char>
+
+template <typename T, typename Char = char>
+using is_formattable = bool_constant<
+    !std::is_base_of<detail::unformattable,
+                     decltype(detail::arg_mapper<buffer_context<Char>>().map(
+                         std::declval<T>()))>::value &&
+    !detail::has_fallback_formatter<T, Char>::value>;
+
+/**
+  \rst
+  An array of references to arguments. It can be implicitly converted into
+  `~fmt::basic_format_args` for passing into type-erased formatting functions
+  such as `~fmt::vformat`.
+  \endrst
+ */
+template <typename Context, typename... Args>
+class format_arg_store
+#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409
+    // Workaround a GCC template argument substitution bug.
+    : public basic_format_args<Context>
+#endif
+{
+ private:
+  static const size_t num_args = sizeof...(Args);
+  static const size_t num_named_args = detail::count_named_args<Args...>();
+  static const bool is_packed = num_args <= detail::max_packed_args;
+
+  using value_type = conditional_t<is_packed, detail::value<Context>,
+                                   basic_format_arg<Context>>;
+
+  detail::arg_data<value_type, typename Context::char_type, num_args,
+                   num_named_args>
+      data_;
+
+  friend class basic_format_args<Context>;
+
+  static constexpr unsigned long long desc =
+      (is_packed ? detail::encode_types<Context, Args...>()
+                 : detail::is_unpacked_bit | num_args) |
+      (num_named_args != 0
+           ? static_cast<unsigned long long>(detail::has_named_args_bit)
+           : 0);
+
+ public:
+  template <typename... T>
+  FMT_CONSTEXPR FMT_INLINE format_arg_store(T&&... args)
+      :
+#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409
+        basic_format_args<Context>(*this),
+#endif
+        data_{detail::make_arg<
+            is_packed, Context,
+            detail::mapped_type_constant<remove_cvref_t<T>, Context>::value>(
+            FMT_FORWARD(args))...} {
+    detail::init_named_args(data_.named_args(), 0, 0, args...);
+  }
+};
+
+/**
+  \rst
+  Constructs a `~fmt::format_arg_store` object that contains references to
+  arguments and can be implicitly converted to `~fmt::format_args`. `Context`
+  can be omitted in which case it defaults to `~fmt::context`.
+  See `~fmt::arg` for lifetime considerations.
+  \endrst
+ */
+template <typename Context = format_context, typename... Args>
+constexpr auto make_format_args(Args&&... args)
+    -> format_arg_store<Context, remove_cvref_t<Args>...> {
+  return {FMT_FORWARD(args)...};
+}
+
+/**
+  \rst
+  Returns a named argument to be used in a formatting function.
+  It should only be used in a call to a formatting function or
+  `dynamic_format_arg_store::push_back`.
+
+  **Example**::
+
+    fmt::print("Elapsed time: {s:.2f} seconds", fmt::arg("s", 1.23));
+  \endrst
+ */
+template <typename Char, typename T>
+inline auto arg(const Char* name, const T& arg) -> detail::named_arg<Char, T> {
+  static_assert(!detail::is_named_arg<T>(), "nested named arguments");
+  return {name, arg};
+}
+
+/**
+  \rst
+  A view of a collection of formatting arguments. To avoid lifetime issues it
+  should only be used as a parameter type in type-erased functions such as
+  ``vformat``::
+
+    void vlog(string_view format_str, format_args args);  // OK
+    format_args args = make_format_args(42);  // Error: dangling reference
+  \endrst
+ */
+template <typename Context> class basic_format_args {
+ public:
+  using size_type = int;
+  using format_arg = basic_format_arg<Context>;
+
+ private:
+  // A descriptor that contains information about formatting arguments.
+  // If the number of arguments is less or equal to max_packed_args then
+  // argument types are passed in the descriptor. This reduces binary code size
+  // per formatting function call.
+  unsigned long long desc_;
+  union {
+    // If is_packed() returns true then argument values are stored in values_;
+    // otherwise they are stored in args_. This is done to improve cache
+    // locality and reduce compiled code size since storing larger objects
+    // may require more code (at least on x86-64) even if the same amount of
+    // data is actually copied to stack. It saves ~10% on the bloat test.
+    const detail::value<Context>* values_;
+    const format_arg* args_;
+  };
+
+  constexpr auto is_packed() const -> bool {
+    return (desc_ & detail::is_unpacked_bit) == 0;
+  }
+  auto has_named_args() const -> bool {
+    return (desc_ & detail::has_named_args_bit) != 0;
+  }
+
+  FMT_CONSTEXPR auto type(int index) const -> detail::type {
+    int shift = index * detail::packed_arg_bits;
+    unsigned int mask = (1 << detail::packed_arg_bits) - 1;
+    return static_cast<detail::type>((desc_ >> shift) & mask);
+  }
+
+  constexpr FMT_INLINE basic_format_args(unsigned long long desc,
+                                         const detail::value<Context>* values)
+      : desc_(desc), values_(values) {}
+  constexpr basic_format_args(unsigned long long desc, const format_arg* args)
+      : desc_(desc), args_(args) {}
+
+ public:
+  constexpr basic_format_args() : desc_(0), args_(nullptr) {}
+
+  /**
+   \rst
+   Constructs a `basic_format_args` object from `~fmt::format_arg_store`.
+   \endrst
+   */
+  template <typename... Args>
+  constexpr FMT_INLINE basic_format_args(
+      const format_arg_store<Context, Args...>& store)
+      : basic_format_args(format_arg_store<Context, Args...>::desc,
+                          store.data_.args()) {}
+
+  /**
+   \rst
+   Constructs a `basic_format_args` object from
+   `~fmt::dynamic_format_arg_store`.
+   \endrst
+   */
+  constexpr FMT_INLINE basic_format_args(
+      const dynamic_format_arg_store<Context>& store)
+      : basic_format_args(store.get_types(), store.data()) {}
+
+  /**
+   \rst
+   Constructs a `basic_format_args` object from a dynamic set of arguments.
+   \endrst
+   */
+  constexpr basic_format_args(const format_arg* args, int count)
+      : basic_format_args(detail::is_unpacked_bit | detail::to_unsigned(count),
+                          args) {}
+
+  /** Returns the argument with the specified id. */
+  FMT_CONSTEXPR auto get(int id) const -> format_arg {
+    format_arg arg;
+    if (!is_packed()) {
+      if (id < max_size()) arg = args_[id];
+      return arg;
+    }
+    if (id >= detail::max_packed_args) return arg;
+    arg.type_ = type(id);
+    if (arg.type_ == detail::type::none_type) return arg;
+    arg.value_ = values_[id];
+    return arg;
+  }
+
+  template <typename Char>
+  auto get(basic_string_view<Char> name) const -> format_arg {
+    int id = get_id(name);
+    return id >= 0 ? get(id) : format_arg();
+  }
+
+  template <typename Char>
+  auto get_id(basic_string_view<Char> name) const -> int {
+    if (!has_named_args()) return -1;
+    const auto& named_args =
+        (is_packed() ? values_[-1] : args_[-1].value_).named_args;
+    for (size_t i = 0; i < named_args.size; ++i) {
+      if (named_args.data[i].name == name) return named_args.data[i].id;
+    }
+    return -1;
+  }
+
+  auto max_size() const -> int {
+    unsigned long long max_packed = detail::max_packed_args;
+    return static_cast<int>(is_packed() ? max_packed
+                                        : desc_ & ~detail::is_unpacked_bit);
+  }
+};
+
+/** An alias to ``basic_format_args<format_context>``. */
+// A separate type would result in shorter symbols but break ABI compatibility
+// between clang and gcc on ARM (#1919).
+using format_args = basic_format_args<format_context>;
+
+// We cannot use enum classes as bit fields because of a gcc bug, so we put them
+// in namespaces instead (https://gcc.gnu.org/bugzilla/show_bug.cgi?id=61414).
+// Additionally, if an underlying type is specified, older gcc incorrectly warns
+// that the type is too small. Both bugs are fixed in gcc 9.3.
+#if FMT_GCC_VERSION && FMT_GCC_VERSION < 903
+#  define FMT_ENUM_UNDERLYING_TYPE(type)
+#else
+#  define FMT_ENUM_UNDERLYING_TYPE(type) : type
+#endif
+namespace align {
+enum type FMT_ENUM_UNDERLYING_TYPE(unsigned char){none, left, right, center,
+                                                  numeric};
+}
+using align_t = align::type;
+namespace sign {
+enum type FMT_ENUM_UNDERLYING_TYPE(unsigned char){none, minus, plus, space};
+}
+using sign_t = sign::type;
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+// Workaround an array initialization issue in gcc 4.8.
+template <typename Char> struct fill_t {
+ private:
+  enum { max_size = 4 };
+  Char data_[max_size] = {Char(' '), Char(0), Char(0), Char(0)};
+  unsigned char size_ = 1;
+
+ public:
+  FMT_CONSTEXPR void operator=(basic_string_view<Char> s) {
+    auto size = s.size();
+    if (size > max_size) return throw_format_error("invalid fill");
+    for (size_t i = 0; i < size; ++i) data_[i] = s[i];
+    size_ = static_cast<unsigned char>(size);
+  }
+
+  constexpr auto size() const -> size_t { return size_; }
+  constexpr auto data() const -> const Char* { return data_; }
+
+  FMT_CONSTEXPR auto operator[](size_t index) -> Char& { return data_[index]; }
+  FMT_CONSTEXPR auto operator[](size_t index) const -> const Char& {
+    return data_[index];
+  }
+};
+FMT_END_DETAIL_NAMESPACE
+
+enum class presentation_type : unsigned char {
+  none,
+  // Integer types should go first,
+  dec,             // 'd'
+  oct,             // 'o'
+  hex_lower,       // 'x'
+  hex_upper,       // 'X'
+  bin_lower,       // 'b'
+  bin_upper,       // 'B'
+  hexfloat_lower,  // 'a'
+  hexfloat_upper,  // 'A'
+  exp_lower,       // 'e'
+  exp_upper,       // 'E'
+  fixed_lower,     // 'f'
+  fixed_upper,     // 'F'
+  general_lower,   // 'g'
+  general_upper,   // 'G'
+  chr,             // 'c'
+  string,          // 's'
+  pointer,         // 'p'
+  debug            // '?'
+};
+
+// Format specifiers for built-in and string types.
+template <typename Char> struct basic_format_specs {
+  int width;
+  int precision;
+  presentation_type type;
+  align_t align : 4;
+  sign_t sign : 3;
+  bool alt : 1;  // Alternate form ('#').
+  bool localized : 1;
+  detail::fill_t<Char> fill;
+
+  constexpr basic_format_specs()
+      : width(0),
+        precision(-1),
+        type(presentation_type::none),
+        align(align::none),
+        sign(sign::none),
+        alt(false),
+        localized(false) {}
+};
+
+using format_specs = basic_format_specs<char>;
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+enum class arg_id_kind { none, index, name };
+
+// An argument reference.
+template <typename Char> struct arg_ref {
+  FMT_CONSTEXPR arg_ref() : kind(arg_id_kind::none), val() {}
+
+  FMT_CONSTEXPR explicit arg_ref(int index)
+      : kind(arg_id_kind::index), val(index) {}
+  FMT_CONSTEXPR explicit arg_ref(basic_string_view<Char> name)
+      : kind(arg_id_kind::name), val(name) {}
+
+  FMT_CONSTEXPR auto operator=(int idx) -> arg_ref& {
+    kind = arg_id_kind::index;
+    val.index = idx;
+    return *this;
+  }
+
+  arg_id_kind kind;
+  union value {
+    FMT_CONSTEXPR value(int id = 0) : index{id} {}
+    FMT_CONSTEXPR value(basic_string_view<Char> n) : name(n) {}
+
+    int index;
+    basic_string_view<Char> name;
+  } val;
+};
+
+// Format specifiers with width and precision resolved at formatting rather
+// than parsing time to allow re-using the same parsed specifiers with
+// different sets of arguments (precompilation of format strings).
+template <typename Char>
+struct dynamic_format_specs : basic_format_specs<Char> {
+  arg_ref<Char> width_ref;
+  arg_ref<Char> precision_ref;
+};
+
+struct auto_id {};
+
+// A format specifier handler that sets fields in basic_format_specs.
+template <typename Char> class specs_setter {
+ protected:
+  basic_format_specs<Char>& specs_;
+
+ public:
+  explicit FMT_CONSTEXPR specs_setter(basic_format_specs<Char>& specs)
+      : specs_(specs) {}
+
+  FMT_CONSTEXPR specs_setter(const specs_setter& other)
+      : specs_(other.specs_) {}
+
+  FMT_CONSTEXPR void on_align(align_t align) { specs_.align = align; }
+  FMT_CONSTEXPR void on_fill(basic_string_view<Char> fill) {
+    specs_.fill = fill;
+  }
+  FMT_CONSTEXPR void on_sign(sign_t s) { specs_.sign = s; }
+  FMT_CONSTEXPR void on_hash() { specs_.alt = true; }
+  FMT_CONSTEXPR void on_localized() { specs_.localized = true; }
+
+  FMT_CONSTEXPR void on_zero() {
+    if (specs_.align == align::none) specs_.align = align::numeric;
+    specs_.fill[0] = Char('0');
+  }
+
+  FMT_CONSTEXPR void on_width(int width) { specs_.width = width; }
+  FMT_CONSTEXPR void on_precision(int precision) {
+    specs_.precision = precision;
+  }
+  FMT_CONSTEXPR void end_precision() {}
+
+  FMT_CONSTEXPR void on_type(presentation_type type) { specs_.type = type; }
+};
+
+// Format spec handler that saves references to arguments representing dynamic
+// width and precision to be resolved at formatting time.
+template <typename ParseContext>
+class dynamic_specs_handler
+    : public specs_setter<typename ParseContext::char_type> {
+ public:
+  using char_type = typename ParseContext::char_type;
+
+  FMT_CONSTEXPR dynamic_specs_handler(dynamic_format_specs<char_type>& specs,
+                                      ParseContext& ctx)
+      : specs_setter<char_type>(specs), specs_(specs), context_(ctx) {}
+
+  FMT_CONSTEXPR dynamic_specs_handler(const dynamic_specs_handler& other)
+      : specs_setter<char_type>(other),
+        specs_(other.specs_),
+        context_(other.context_) {}
+
+  template <typename Id> FMT_CONSTEXPR void on_dynamic_width(Id arg_id) {
+    specs_.width_ref = make_arg_ref(arg_id);
+  }
+
+  template <typename Id> FMT_CONSTEXPR void on_dynamic_precision(Id arg_id) {
+    specs_.precision_ref = make_arg_ref(arg_id);
+  }
+
+  FMT_CONSTEXPR void on_error(const char* message) {
+    context_.on_error(message);
+  }
+
+ private:
+  dynamic_format_specs<char_type>& specs_;
+  ParseContext& context_;
+
+  using arg_ref_type = arg_ref<char_type>;
+
+  FMT_CONSTEXPR auto make_arg_ref(int arg_id) -> arg_ref_type {
+    context_.check_arg_id(arg_id);
+    context_.check_dynamic_spec(arg_id);
+    return arg_ref_type(arg_id);
+  }
+
+  FMT_CONSTEXPR auto make_arg_ref(auto_id) -> arg_ref_type {
+    int arg_id = context_.next_arg_id();
+    context_.check_dynamic_spec(arg_id);
+    return arg_ref_type(arg_id);
+  }
+
+  FMT_CONSTEXPR auto make_arg_ref(basic_string_view<char_type> arg_id)
+      -> arg_ref_type {
+    context_.check_arg_id(arg_id);
+    basic_string_view<char_type> format_str(
+        context_.begin(), to_unsigned(context_.end() - context_.begin()));
+    return arg_ref_type(arg_id);
+  }
+};
+
+template <typename Char> constexpr bool is_ascii_letter(Char c) {
+  return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
+}
+
+// Converts a character to ASCII. Returns a number > 127 on conversion failure.
+template <typename Char, FMT_ENABLE_IF(std::is_integral<Char>::value)>
+constexpr auto to_ascii(Char c) -> Char {
+  return c;
+}
+template <typename Char, FMT_ENABLE_IF(std::is_enum<Char>::value)>
+constexpr auto to_ascii(Char c) -> underlying_t<Char> {
+  return c;
+}
+
+FMT_CONSTEXPR inline auto code_point_length_impl(char c) -> int {
+  return "\1\1\1\1\1\1\1\1\1\1\1\1\1\1\1\1\0\0\0\0\0\0\0\0\2\2\2\2\3\3\4"
+      [static_cast<unsigned char>(c) >> 3];
+}
+
+template <typename Char>
+FMT_CONSTEXPR auto code_point_length(const Char* begin) -> int {
+  if (const_check(sizeof(Char) != 1)) return 1;
+  int len = code_point_length_impl(static_cast<char>(*begin));
+
+  // Compute the pointer to the next character early so that the next
+  // iteration can start working on the next character. Neither Clang
+  // nor GCC figure out this reordering on their own.
+  return len + !len;
+}
+
+// Return the result via the out param to workaround gcc bug 77539.
+template <bool IS_CONSTEXPR, typename T, typename Ptr = const T*>
+FMT_CONSTEXPR auto find(Ptr first, Ptr last, T value, Ptr& out) -> bool {
+  for (out = first; out != last; ++out) {
+    if (*out == value) return true;
+  }
+  return false;
+}
+
+template <>
+inline auto find<false, char>(const char* first, const char* last, char value,
+                              const char*& out) -> bool {
+  out = static_cast<const char*>(
+      std::memchr(first, value, to_unsigned(last - first)));
+  return out != nullptr;
+}
+
+// Parses the range [begin, end) as an unsigned integer. This function assumes
+// that the range is non-empty and the first character is a digit.
+template <typename Char>
+FMT_CONSTEXPR auto parse_nonnegative_int(const Char*& begin, const Char* end,
+                                         int error_value) noexcept -> int {
+  FMT_ASSERT(begin != end && '0' <= *begin && *begin <= '9', "");
+  unsigned value = 0, prev = 0;
+  auto p = begin;
+  do {
+    prev = value;
+    value = value * 10 + unsigned(*p - '0');
+    ++p;
+  } while (p != end && '0' <= *p && *p <= '9');
+  auto num_digits = p - begin;
+  begin = p;
+  if (num_digits <= std::numeric_limits<int>::digits10)
+    return static_cast<int>(value);
+  // Check for overflow.
+  const unsigned max = to_unsigned((std::numeric_limits<int>::max)());
+  return num_digits == std::numeric_limits<int>::digits10 + 1 &&
+                 prev * 10ull + unsigned(p[-1] - '0') <= max
+             ? static_cast<int>(value)
+             : error_value;
+}
+
+// Parses fill and alignment.
+template <typename Char, typename Handler>
+FMT_CONSTEXPR auto parse_align(const Char* begin, const Char* end,
+                               Handler&& handler) -> const Char* {
+  FMT_ASSERT(begin != end, "");
+  auto align = align::none;
+  auto p = begin + code_point_length(begin);
+  if (end - p <= 0) p = begin;
+  for (;;) {
+    switch (to_ascii(*p)) {
+    case '<':
+      align = align::left;
+      break;
+    case '>':
+      align = align::right;
+      break;
+    case '^':
+      align = align::center;
+      break;
+    default:
+      break;
+    }
+    if (align != align::none) {
+      if (p != begin) {
+        auto c = *begin;
+        if (c == '{')
+          return handler.on_error("invalid fill character '{'"), begin;
+        handler.on_fill(basic_string_view<Char>(begin, to_unsigned(p - begin)));
+        begin = p + 1;
+      } else
+        ++begin;
+      handler.on_align(align);
+      break;
+    } else if (p == begin) {
+      break;
+    }
+    p = begin;
+  }
+  return begin;
+}
+
+template <typename Char> FMT_CONSTEXPR bool is_name_start(Char c) {
+  return ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z') || '_' == c;
+}
+
+template <typename Char, typename IDHandler>
+FMT_CONSTEXPR auto do_parse_arg_id(const Char* begin, const Char* end,
+                                   IDHandler&& handler) -> const Char* {
+  FMT_ASSERT(begin != end, "");
+  Char c = *begin;
+  if (c >= '0' && c <= '9') {
+    int index = 0;
+    if (c != '0')
+      index =
+          parse_nonnegative_int(begin, end, (std::numeric_limits<int>::max)());
+    else
+      ++begin;
+    if (begin == end || (*begin != '}' && *begin != ':'))
+      handler.on_error("invalid format string");
+    else
+      handler(index);
+    return begin;
+  }
+  if (!is_name_start(c)) {
+    handler.on_error("invalid format string");
+    return begin;
+  }
+  auto it = begin;
+  do {
+    ++it;
+  } while (it != end && (is_name_start(c = *it) || ('0' <= c && c <= '9')));
+  handler(basic_string_view<Char>(begin, to_unsigned(it - begin)));
+  return it;
+}
+
+template <typename Char, typename IDHandler>
+FMT_CONSTEXPR FMT_INLINE auto parse_arg_id(const Char* begin, const Char* end,
+                                           IDHandler&& handler) -> const Char* {
+  Char c = *begin;
+  if (c != '}' && c != ':') return do_parse_arg_id(begin, end, handler);
+  handler();
+  return begin;
+}
+
+template <typename Char, typename Handler>
+FMT_CONSTEXPR auto parse_width(const Char* begin, const Char* end,
+                               Handler&& handler) -> const Char* {
+  using detail::auto_id;
+  struct width_adapter {
+    Handler& handler;
+
+    FMT_CONSTEXPR void operator()() { handler.on_dynamic_width(auto_id()); }
+    FMT_CONSTEXPR void operator()(int id) { handler.on_dynamic_width(id); }
+    FMT_CONSTEXPR void operator()(basic_string_view<Char> id) {
+      handler.on_dynamic_width(id);
+    }
+    FMT_CONSTEXPR void on_error(const char* message) {
+      if (message) handler.on_error(message);
+    }
+  };
+
+  FMT_ASSERT(begin != end, "");
+  if ('0' <= *begin && *begin <= '9') {
+    int width = parse_nonnegative_int(begin, end, -1);
+    if (width != -1)
+      handler.on_width(width);
+    else
+      handler.on_error("number is too big");
+  } else if (*begin == '{') {
+    ++begin;
+    if (begin != end) begin = parse_arg_id(begin, end, width_adapter{handler});
+    if (begin == end || *begin != '}')
+      return handler.on_error("invalid format string"), begin;
+    ++begin;
+  }
+  return begin;
+}
+
+template <typename Char, typename Handler>
+FMT_CONSTEXPR auto parse_precision(const Char* begin, const Char* end,
+                                   Handler&& handler) -> const Char* {
+  using detail::auto_id;
+  struct precision_adapter {
+    Handler& handler;
+
+    FMT_CONSTEXPR void operator()() { handler.on_dynamic_precision(auto_id()); }
+    FMT_CONSTEXPR void operator()(int id) { handler.on_dynamic_precision(id); }
+    FMT_CONSTEXPR void operator()(basic_string_view<Char> id) {
+      handler.on_dynamic_precision(id);
+    }
+    FMT_CONSTEXPR void on_error(const char* message) {
+      if (message) handler.on_error(message);
+    }
+  };
+
+  ++begin;
+  auto c = begin != end ? *begin : Char();
+  if ('0' <= c && c <= '9') {
+    auto precision = parse_nonnegative_int(begin, end, -1);
+    if (precision != -1)
+      handler.on_precision(precision);
+    else
+      handler.on_error("number is too big");
+  } else if (c == '{') {
+    ++begin;
+    if (begin != end)
+      begin = parse_arg_id(begin, end, precision_adapter{handler});
+    if (begin == end || *begin++ != '}')
+      return handler.on_error("invalid format string"), begin;
+  } else {
+    return handler.on_error("missing precision specifier"), begin;
+  }
+  handler.end_precision();
+  return begin;
+}
+
+template <typename Char>
+FMT_CONSTEXPR auto parse_presentation_type(Char type) -> presentation_type {
+  switch (to_ascii(type)) {
+  case 'd':
+    return presentation_type::dec;
+  case 'o':
+    return presentation_type::oct;
+  case 'x':
+    return presentation_type::hex_lower;
+  case 'X':
+    return presentation_type::hex_upper;
+  case 'b':
+    return presentation_type::bin_lower;
+  case 'B':
+    return presentation_type::bin_upper;
+  case 'a':
+    return presentation_type::hexfloat_lower;
+  case 'A':
+    return presentation_type::hexfloat_upper;
+  case 'e':
+    return presentation_type::exp_lower;
+  case 'E':
+    return presentation_type::exp_upper;
+  case 'f':
+    return presentation_type::fixed_lower;
+  case 'F':
+    return presentation_type::fixed_upper;
+  case 'g':
+    return presentation_type::general_lower;
+  case 'G':
+    return presentation_type::general_upper;
+  case 'c':
+    return presentation_type::chr;
+  case 's':
+    return presentation_type::string;
+  case 'p':
+    return presentation_type::pointer;
+  case '?':
+    return presentation_type::debug;
+  default:
+    return presentation_type::none;
+  }
+}
+
+// Parses standard format specifiers and sends notifications about parsed
+// components to handler.
+template <typename Char, typename SpecHandler>
+FMT_CONSTEXPR FMT_INLINE auto parse_format_specs(const Char* begin,
+                                                 const Char* end,
+                                                 SpecHandler&& handler)
+    -> const Char* {
+  if (1 < end - begin && begin[1] == '}' && is_ascii_letter(*begin) &&
+      *begin != 'L') {
+    presentation_type type = parse_presentation_type(*begin++);
+    if (type == presentation_type::none)
+      handler.on_error("invalid type specifier");
+    handler.on_type(type);
+    return begin;
+  }
+
+  if (begin == end) return begin;
+
+  begin = parse_align(begin, end, handler);
+  if (begin == end) return begin;
+
+  // Parse sign.
+  switch (to_ascii(*begin)) {
+  case '+':
+    handler.on_sign(sign::plus);
+    ++begin;
+    break;
+  case '-':
+    handler.on_sign(sign::minus);
+    ++begin;
+    break;
+  case ' ':
+    handler.on_sign(sign::space);
+    ++begin;
+    break;
+  default:
+    break;
+  }
+  if (begin == end) return begin;
+
+  if (*begin == '#') {
+    handler.on_hash();
+    if (++begin == end) return begin;
+  }
+
+  // Parse zero flag.
+  if (*begin == '0') {
+    handler.on_zero();
+    if (++begin == end) return begin;
+  }
+
+  begin = parse_width(begin, end, handler);
+  if (begin == end) return begin;
+
+  // Parse precision.
+  if (*begin == '.') {
+    begin = parse_precision(begin, end, handler);
+    if (begin == end) return begin;
+  }
+
+  if (*begin == 'L') {
+    handler.on_localized();
+    ++begin;
+  }
+
+  // Parse type.
+  if (begin != end && *begin != '}') {
+    presentation_type type = parse_presentation_type(*begin++);
+    if (type == presentation_type::none)
+      handler.on_error("invalid type specifier");
+    handler.on_type(type);
+  }
+  return begin;
+}
+
+template <typename Char, typename Handler>
+FMT_CONSTEXPR auto parse_replacement_field(const Char* begin, const Char* end,
+                                           Handler&& handler) -> const Char* {
+  struct id_adapter {
+    Handler& handler;
+    int arg_id;
+
+    FMT_CONSTEXPR void operator()() { arg_id = handler.on_arg_id(); }
+    FMT_CONSTEXPR void operator()(int id) { arg_id = handler.on_arg_id(id); }
+    FMT_CONSTEXPR void operator()(basic_string_view<Char> id) {
+      arg_id = handler.on_arg_id(id);
+    }
+    FMT_CONSTEXPR void on_error(const char* message) {
+      if (message) handler.on_error(message);
+    }
+  };
+
+  ++begin;
+  if (begin == end) return handler.on_error("invalid format string"), end;
+  if (*begin == '}') {
+    handler.on_replacement_field(handler.on_arg_id(), begin);
+  } else if (*begin == '{') {
+    handler.on_text(begin, begin + 1);
+  } else {
+    auto adapter = id_adapter{handler, 0};
+    begin = parse_arg_id(begin, end, adapter);
+    Char c = begin != end ? *begin : Char();
+    if (c == '}') {
+      handler.on_replacement_field(adapter.arg_id, begin);
+    } else if (c == ':') {
+      begin = handler.on_format_specs(adapter.arg_id, begin + 1, end);
+      if (begin == end || *begin != '}')
+        return handler.on_error("unknown format specifier"), end;
+    } else {
+      return handler.on_error("missing '}' in format string"), end;
+    }
+  }
+  return begin + 1;
+}
+
+template <bool IS_CONSTEXPR, typename Char, typename Handler>
+FMT_CONSTEXPR FMT_INLINE void parse_format_string(
+    basic_string_view<Char> format_str, Handler&& handler) {
+  // Workaround a name-lookup bug in MSVC's modules implementation.
+  using detail::find;
+
+  auto begin = format_str.data();
+  auto end = begin + format_str.size();
+  if (end - begin < 32) {
+    // Use a simple loop instead of memchr for small strings.
+    const Char* p = begin;
+    while (p != end) {
+      auto c = *p++;
+      if (c == '{') {
+        handler.on_text(begin, p - 1);
+        begin = p = parse_replacement_field(p - 1, end, handler);
+      } else if (c == '}') {
+        if (p == end || *p != '}')
+          return handler.on_error("unmatched '}' in format string");
+        handler.on_text(begin, p);
+        begin = ++p;
+      }
+    }
+    handler.on_text(begin, end);
+    return;
+  }
+  struct writer {
+    FMT_CONSTEXPR void operator()(const Char* from, const Char* to) {
+      if (from == to) return;
+      for (;;) {
+        const Char* p = nullptr;
+        if (!find<IS_CONSTEXPR>(from, to, Char('}'), p))
+          return handler_.on_text(from, to);
+        ++p;
+        if (p == to || *p != '}')
+          return handler_.on_error("unmatched '}' in format string");
+        handler_.on_text(from, p);
+        from = p + 1;
+      }
+    }
+    Handler& handler_;
+  } write = {handler};
+  while (begin != end) {
+    // Doing two passes with memchr (one for '{' and another for '}') is up to
+    // 2.5x faster than the naive one-pass implementation on big format strings.
+    const Char* p = begin;
+    if (*begin != '{' && !find<IS_CONSTEXPR>(begin + 1, end, Char('{'), p))
+      return write(begin, end);
+    write(begin, p);
+    begin = parse_replacement_field(p, end, handler);
+  }
+}
+
+template <typename T, bool = is_named_arg<T>::value> struct strip_named_arg {
+  using type = T;
+};
+template <typename T> struct strip_named_arg<T, true> {
+  using type = remove_cvref_t<decltype(T::value)>;
+};
+
+template <typename T, typename ParseContext>
+FMT_CONSTEXPR auto parse_format_specs(ParseContext& ctx)
+    -> decltype(ctx.begin()) {
+  using char_type = typename ParseContext::char_type;
+  using context = buffer_context<char_type>;
+  using stripped_type = typename strip_named_arg<T>::type;
+  using mapped_type = conditional_t<
+      mapped_type_constant<T, context>::value != type::custom_type,
+      decltype(arg_mapper<context>().map(std::declval<const T&>())),
+      stripped_type>;
+  auto f = conditional_t<has_formatter<mapped_type, context>::value,
+                         formatter<mapped_type, char_type>,
+                         fallback_formatter<stripped_type, char_type>>();
+  return f.parse(ctx);
+}
+
+template <typename ErrorHandler>
+FMT_CONSTEXPR void check_int_type_spec(presentation_type type,
+                                       ErrorHandler&& eh) {
+  if (type > presentation_type::bin_upper && type != presentation_type::chr)
+    eh.on_error("invalid type specifier");
+}
+
+// Checks char specs and returns true if the type spec is char (and not int).
+template <typename Char, typename ErrorHandler = error_handler>
+FMT_CONSTEXPR auto check_char_specs(const basic_format_specs<Char>& specs,
+                                    ErrorHandler&& eh = {}) -> bool {
+  if (specs.type != presentation_type::none &&
+      specs.type != presentation_type::chr &&
+      specs.type != presentation_type::debug) {
+    check_int_type_spec(specs.type, eh);
+    return false;
+  }
+  if (specs.align == align::numeric || specs.sign != sign::none || specs.alt)
+    eh.on_error("invalid format specifier for char");
+  return true;
+}
+
+// A floating-point presentation format.
+enum class float_format : unsigned char {
+  general,  // General: exponent notation or fixed point based on magnitude.
+  exp,      // Exponent notation with the default precision of 6, e.g. 1.2e-3.
+  fixed,    // Fixed point with the default precision of 6, e.g. 0.0012.
+  hex
+};
+
+struct float_specs {
+  int precision;
+  float_format format : 8;
+  sign_t sign : 8;
+  bool upper : 1;
+  bool locale : 1;
+  bool binary32 : 1;
+  bool showpoint : 1;
+};
+
+template <typename ErrorHandler = error_handler, typename Char>
+FMT_CONSTEXPR auto parse_float_type_spec(const basic_format_specs<Char>& specs,
+                                         ErrorHandler&& eh = {})
+    -> float_specs {
+  auto result = float_specs();
+  result.showpoint = specs.alt;
+  result.locale = specs.localized;
+  switch (specs.type) {
+  case presentation_type::none:
+    result.format = float_format::general;
+    break;
+  case presentation_type::general_upper:
+    result.upper = true;
+    FMT_FALLTHROUGH;
+  case presentation_type::general_lower:
+    result.format = float_format::general;
+    break;
+  case presentation_type::exp_upper:
+    result.upper = true;
+    FMT_FALLTHROUGH;
+  case presentation_type::exp_lower:
+    result.format = float_format::exp;
+    result.showpoint |= specs.precision != 0;
+    break;
+  case presentation_type::fixed_upper:
+    result.upper = true;
+    FMT_FALLTHROUGH;
+  case presentation_type::fixed_lower:
+    result.format = float_format::fixed;
+    result.showpoint |= specs.precision != 0;
+    break;
+  case presentation_type::hexfloat_upper:
+    result.upper = true;
+    FMT_FALLTHROUGH;
+  case presentation_type::hexfloat_lower:
+    result.format = float_format::hex;
+    break;
+  default:
+    eh.on_error("invalid type specifier");
+    break;
+  }
+  return result;
+}
+
+template <typename ErrorHandler = error_handler>
+FMT_CONSTEXPR auto check_cstring_type_spec(presentation_type type,
+                                           ErrorHandler&& eh = {}) -> bool {
+  if (type == presentation_type::none || type == presentation_type::string ||
+      type == presentation_type::debug)
+    return true;
+  if (type != presentation_type::pointer) eh.on_error("invalid type specifier");
+  return false;
+}
+
+template <typename ErrorHandler = error_handler>
+FMT_CONSTEXPR void check_string_type_spec(presentation_type type,
+                                          ErrorHandler&& eh = {}) {
+  if (type != presentation_type::none && type != presentation_type::string &&
+      type != presentation_type::debug)
+    eh.on_error("invalid type specifier");
+}
+
+template <typename ErrorHandler>
+FMT_CONSTEXPR void check_pointer_type_spec(presentation_type type,
+                                           ErrorHandler&& eh) {
+  if (type != presentation_type::none && type != presentation_type::pointer)
+    eh.on_error("invalid type specifier");
+}
+
+// A parse_format_specs handler that checks if specifiers are consistent with
+// the argument type.
+template <typename Handler> class specs_checker : public Handler {
+ private:
+  detail::type arg_type_;
+
+  FMT_CONSTEXPR void require_numeric_argument() {
+    if (!is_arithmetic_type(arg_type_))
+      this->on_error("format specifier requires numeric argument");
+  }
+
+ public:
+  FMT_CONSTEXPR specs_checker(const Handler& handler, detail::type arg_type)
+      : Handler(handler), arg_type_(arg_type) {}
+
+  FMT_CONSTEXPR void on_align(align_t align) {
+    if (align == align::numeric) require_numeric_argument();
+    Handler::on_align(align);
+  }
+
+  FMT_CONSTEXPR void on_sign(sign_t s) {
+    require_numeric_argument();
+    if (is_integral_type(arg_type_) && arg_type_ != type::int_type &&
+        arg_type_ != type::long_long_type && arg_type_ != type::int128_type &&
+        arg_type_ != type::char_type) {
+      this->on_error("format specifier requires signed argument");
+    }
+    Handler::on_sign(s);
+  }
+
+  FMT_CONSTEXPR void on_hash() {
+    require_numeric_argument();
+    Handler::on_hash();
+  }
+
+  FMT_CONSTEXPR void on_localized() {
+    require_numeric_argument();
+    Handler::on_localized();
+  }
+
+  FMT_CONSTEXPR void on_zero() {
+    require_numeric_argument();
+    Handler::on_zero();
+  }
+
+  FMT_CONSTEXPR void end_precision() {
+    if (is_integral_type(arg_type_) || arg_type_ == type::pointer_type)
+      this->on_error("precision not allowed for this argument type");
+  }
+};
+
+constexpr int invalid_arg_index = -1;
+
+#if FMT_USE_NONTYPE_TEMPLATE_ARGS
+template <int N, typename T, typename... Args, typename Char>
+constexpr auto get_arg_index_by_name(basic_string_view<Char> name) -> int {
+  if constexpr (detail::is_statically_named_arg<T>()) {
+    if (name == T::name) return N;
+  }
+  if constexpr (sizeof...(Args) > 0)
+    return get_arg_index_by_name<N + 1, Args...>(name);
+  (void)name;  // Workaround an MSVC bug about "unused" parameter.
+  return invalid_arg_index;
+}
+#endif
+
+template <typename... Args, typename Char>
+FMT_CONSTEXPR auto get_arg_index_by_name(basic_string_view<Char> name) -> int {
+#if FMT_USE_NONTYPE_TEMPLATE_ARGS
+  if constexpr (sizeof...(Args) > 0)
+    return get_arg_index_by_name<0, Args...>(name);
+#endif
+  (void)name;
+  return invalid_arg_index;
+}
+
+template <typename Char, typename ErrorHandler, typename... Args>
+class format_string_checker {
+ private:
+  // In the future basic_format_parse_context will replace compile_parse_context
+  // here and will use is_constant_evaluated and downcasting to access the data
+  // needed for compile-time checks: https://godbolt.org/z/GvWzcTjh1.
+  using parse_context_type = compile_parse_context<Char, ErrorHandler>;
+  static constexpr int num_args = sizeof...(Args);
+
+  // Format specifier parsing function.
+  using parse_func = const Char* (*)(parse_context_type&);
+
+  parse_context_type context_;
+  parse_func parse_funcs_[num_args > 0 ? static_cast<size_t>(num_args) : 1];
+  type types_[num_args > 0 ? static_cast<size_t>(num_args) : 1];
+
+ public:
+  explicit FMT_CONSTEXPR format_string_checker(
+      basic_string_view<Char> format_str, ErrorHandler eh)
+      : context_(format_str, num_args, types_, eh),
+        parse_funcs_{&parse_format_specs<Args, parse_context_type>...},
+        types_{
+            mapped_type_constant<Args,
+                                 basic_format_context<Char*, Char>>::value...} {
+  }
+
+  FMT_CONSTEXPR void on_text(const Char*, const Char*) {}
+
+  FMT_CONSTEXPR auto on_arg_id() -> int { return context_.next_arg_id(); }
+  FMT_CONSTEXPR auto on_arg_id(int id) -> int {
+    return context_.check_arg_id(id), id;
+  }
+  FMT_CONSTEXPR auto on_arg_id(basic_string_view<Char> id) -> int {
+#if FMT_USE_NONTYPE_TEMPLATE_ARGS
+    auto index = get_arg_index_by_name<Args...>(id);
+    if (index == invalid_arg_index) on_error("named argument is not found");
+    return context_.check_arg_id(index), index;
+#else
+    (void)id;
+    on_error("compile-time checks for named arguments require C++20 support");
+    return 0;
+#endif
+  }
+
+  FMT_CONSTEXPR void on_replacement_field(int, const Char*) {}
+
+  FMT_CONSTEXPR auto on_format_specs(int id, const Char* begin, const Char*)
+      -> const Char* {
+    context_.advance_to(context_.begin() + (begin - &*context_.begin()));
+    // id >= 0 check is a workaround for gcc 10 bug (#2065).
+    return id >= 0 && id < num_args ? parse_funcs_[id](context_) : begin;
+  }
+
+  FMT_CONSTEXPR void on_error(const char* message) {
+    context_.on_error(message);
+  }
+};
+
+// Reports a compile-time error if S is not a valid format string.
+template <typename..., typename S, FMT_ENABLE_IF(!is_compile_string<S>::value)>
+FMT_INLINE void check_format_string(const S&) {
+#ifdef FMT_ENFORCE_COMPILE_STRING
+  static_assert(is_compile_string<S>::value,
+                "FMT_ENFORCE_COMPILE_STRING requires all format strings to use "
+                "FMT_STRING.");
+#endif
+}
+template <typename... Args, typename S,
+          FMT_ENABLE_IF(is_compile_string<S>::value)>
+void check_format_string(S format_str) {
+  FMT_CONSTEXPR auto s = basic_string_view<typename S::char_type>(format_str);
+  using checker = format_string_checker<typename S::char_type, error_handler,
+                                        remove_cvref_t<Args>...>;
+  FMT_CONSTEXPR bool invalid_format =
+      (parse_format_string<true>(s, checker(s, {})), true);
+  ignore_unused(invalid_format);
+}
+
+template <typename Char>
+void vformat_to(
+    buffer<Char>& buf, basic_string_view<Char> fmt,
+    basic_format_args<FMT_BUFFER_CONTEXT(type_identity_t<Char>)> args,
+    locale_ref loc = {});
+
+FMT_API void vprint_mojibake(std::FILE*, string_view, format_args);
+#ifndef _WIN32
+inline void vprint_mojibake(std::FILE*, string_view, format_args) {}
+#endif
+FMT_END_DETAIL_NAMESPACE
+
+// A formatter specialization for the core types corresponding to detail::type
+// constants.
+template <typename T, typename Char>
+struct formatter<T, Char,
+                 enable_if_t<detail::type_constant<T, Char>::value !=
+                             detail::type::custom_type>> {
+ private:
+  detail::dynamic_format_specs<Char> specs_;
+
+ public:
+  // Parses format specifiers stopping either at the end of the range or at the
+  // terminating '}'.
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    auto begin = ctx.begin(), end = ctx.end();
+    if (begin == end) return begin;
+    using handler_type = detail::dynamic_specs_handler<ParseContext>;
+    auto type = detail::type_constant<T, Char>::value;
+    auto checker =
+        detail::specs_checker<handler_type>(handler_type(specs_, ctx), type);
+    auto it = detail::parse_format_specs(begin, end, checker);
+    auto eh = ctx.error_handler();
+    switch (type) {
+    case detail::type::none_type:
+      FMT_ASSERT(false, "invalid argument type");
+      break;
+    case detail::type::bool_type:
+      if (specs_.type == presentation_type::none ||
+          specs_.type == presentation_type::string) {
+        break;
+      }
+      FMT_FALLTHROUGH;
+    case detail::type::int_type:
+    case detail::type::uint_type:
+    case detail::type::long_long_type:
+    case detail::type::ulong_long_type:
+    case detail::type::int128_type:
+    case detail::type::uint128_type:
+      detail::check_int_type_spec(specs_.type, eh);
+      break;
+    case detail::type::char_type:
+      detail::check_char_specs(specs_, eh);
+      break;
+    case detail::type::float_type:
+      if (detail::const_check(FMT_USE_FLOAT))
+        detail::parse_float_type_spec(specs_, eh);
+      else
+        FMT_ASSERT(false, "float support disabled");
+      break;
+    case detail::type::double_type:
+      if (detail::const_check(FMT_USE_DOUBLE))
+        detail::parse_float_type_spec(specs_, eh);
+      else
+        FMT_ASSERT(false, "double support disabled");
+      break;
+    case detail::type::long_double_type:
+      if (detail::const_check(FMT_USE_LONG_DOUBLE))
+        detail::parse_float_type_spec(specs_, eh);
+      else
+        FMT_ASSERT(false, "long double support disabled");
+      break;
+    case detail::type::cstring_type:
+      detail::check_cstring_type_spec(specs_.type, eh);
+      break;
+    case detail::type::string_type:
+      detail::check_string_type_spec(specs_.type, eh);
+      break;
+    case detail::type::pointer_type:
+      detail::check_pointer_type_spec(specs_.type, eh);
+      break;
+    case detail::type::custom_type:
+      // Custom format specifiers are checked in parse functions of
+      // formatter specializations.
+      break;
+    }
+    return it;
+  }
+
+  template <detail::type U = detail::type_constant<T, Char>::value,
+            enable_if_t<(U == detail::type::string_type ||
+                         U == detail::type::cstring_type ||
+                         U == detail::type::char_type),
+                        int> = 0>
+  FMT_CONSTEXPR void set_debug_format() {
+    specs_.type = presentation_type::debug;
+  }
+
+  template <typename FormatContext>
+  FMT_CONSTEXPR auto format(const T& val, FormatContext& ctx) const
+      -> decltype(ctx.out());
+};
+
+#define FMT_FORMAT_AS(Type, Base)                                        \
+  template <typename Char>                                               \
+  struct formatter<Type, Char> : formatter<Base, Char> {                 \
+    template <typename FormatContext>                                    \
+    auto format(Type const& val, FormatContext& ctx) const               \
+        -> decltype(ctx.out()) {                                         \
+      return formatter<Base, Char>::format(static_cast<Base>(val), ctx); \
+    }                                                                    \
+  }
+
+FMT_FORMAT_AS(signed char, int);
+FMT_FORMAT_AS(unsigned char, unsigned);
+FMT_FORMAT_AS(short, int);
+FMT_FORMAT_AS(unsigned short, unsigned);
+FMT_FORMAT_AS(long, long long);
+FMT_FORMAT_AS(unsigned long, unsigned long long);
+FMT_FORMAT_AS(Char*, const Char*);
+FMT_FORMAT_AS(std::basic_string<Char>, basic_string_view<Char>);
+FMT_FORMAT_AS(std::nullptr_t, const void*);
+FMT_FORMAT_AS(detail::std_string_view<Char>, basic_string_view<Char>);
+
+template <typename Char> struct basic_runtime { basic_string_view<Char> str; };
+
+/** A compile-time format string. */
+template <typename Char, typename... Args> class basic_format_string {
+ private:
+  basic_string_view<Char> str_;
+
+ public:
+  template <typename S,
+            FMT_ENABLE_IF(
+                std::is_convertible<const S&, basic_string_view<Char>>::value)>
+  FMT_CONSTEVAL FMT_INLINE basic_format_string(const S& s) : str_(s) {
+    static_assert(
+        detail::count<
+            (std::is_base_of<detail::view, remove_reference_t<Args>>::value &&
+             std::is_reference<Args>::value)...>() == 0,
+        "passing views as lvalues is disallowed");
+#ifdef FMT_HAS_CONSTEVAL
+    if constexpr (detail::count_named_args<Args...>() ==
+                  detail::count_statically_named_args<Args...>()) {
+      using checker = detail::format_string_checker<Char, detail::error_handler,
+                                                    remove_cvref_t<Args>...>;
+      detail::parse_format_string<true>(str_, checker(s, {}));
+    }
+#else
+    detail::check_format_string<Args...>(s);
+#endif
+  }
+  basic_format_string(basic_runtime<Char> r) : str_(r.str) {}
+
+  FMT_INLINE operator basic_string_view<Char>() const { return str_; }
+};
+
+#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409
+// Workaround broken conversion on older gcc.
+template <typename...> using format_string = string_view;
+inline auto runtime(string_view s) -> string_view { return s; }
+#else
+template <typename... Args>
+using format_string = basic_format_string<char, type_identity_t<Args>...>;
+/**
+  \rst
+  Creates a runtime format string.
+
+  **Example**::
+
+    // Check format string at runtime instead of compile-time.
+    fmt::print(fmt::runtime("{:d}"), "I am not a number");
+  \endrst
+ */
+inline auto runtime(string_view s) -> basic_runtime<char> { return {{s}}; }
+#endif
+
+FMT_API auto vformat(string_view fmt, format_args args) -> std::string;
+
+/**
+  \rst
+  Formats ``args`` according to specifications in ``fmt`` and returns the result
+  as a string.
+
+  **Example**::
+
+    #include <fmt/core.h>
+    std::string message = fmt::format("The answer is {}.", 42);
+  \endrst
+*/
+template <typename... T>
+FMT_NODISCARD FMT_INLINE auto format(format_string<T...> fmt, T&&... args)
+    -> std::string {
+  return vformat(fmt, fmt::make_format_args(args...));
+}
+
+/** Formats a string and writes the output to ``out``. */
+template <typename OutputIt,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, char>::value)>
+auto vformat_to(OutputIt out, string_view fmt, format_args args) -> OutputIt {
+  using detail::get_buffer;
+  auto&& buf = get_buffer<char>(out);
+  detail::vformat_to(buf, fmt, args, {});
+  return detail::get_iterator(buf);
+}
+
+/**
+ \rst
+ Formats ``args`` according to specifications in ``fmt``, writes the result to
+ the output iterator ``out`` and returns the iterator past the end of the output
+ range. `format_to` does not append a terminating null character.
+
+ **Example**::
+
+   auto out = std::vector<char>();
+   fmt::format_to(std::back_inserter(out), "{}", 42);
+ \endrst
+ */
+template <typename OutputIt, typename... T,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, char>::value)>
+FMT_INLINE auto format_to(OutputIt out, format_string<T...> fmt, T&&... args)
+    -> OutputIt {
+  return vformat_to(out, fmt, fmt::make_format_args(args...));
+}
+
+template <typename OutputIt> struct format_to_n_result {
+  /** Iterator past the end of the output range. */
+  OutputIt out;
+  /** Total (not truncated) output size. */
+  size_t size;
+};
+
+template <typename OutputIt, typename... T,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, char>::value)>
+auto vformat_to_n(OutputIt out, size_t n, string_view fmt, format_args args)
+    -> format_to_n_result<OutputIt> {
+  using traits = detail::fixed_buffer_traits;
+  auto buf = detail::iterator_buffer<OutputIt, char, traits>(out, n);
+  detail::vformat_to(buf, fmt, args, {});
+  return {buf.out(), buf.count()};
+}
+
+/**
+  \rst
+  Formats ``args`` according to specifications in ``fmt``, writes up to ``n``
+  characters of the result to the output iterator ``out`` and returns the total
+  (not truncated) output size and the iterator past the end of the output range.
+  `format_to_n` does not append a terminating null character.
+  \endrst
+ */
+template <typename OutputIt, typename... T,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, char>::value)>
+FMT_INLINE auto format_to_n(OutputIt out, size_t n, format_string<T...> fmt,
+                            T&&... args) -> format_to_n_result<OutputIt> {
+  return vformat_to_n(out, n, fmt, fmt::make_format_args(args...));
+}
+
+/** Returns the number of chars in the output of ``format(fmt, args...)``. */
+template <typename... T>
+FMT_NODISCARD FMT_INLINE auto formatted_size(format_string<T...> fmt,
+                                             T&&... args) -> size_t {
+  auto buf = detail::counting_buffer<>();
+  detail::vformat_to(buf, string_view(fmt), fmt::make_format_args(args...), {});
+  return buf.count();
+}
+
+FMT_API void vprint(string_view fmt, format_args args);
+FMT_API void vprint(std::FILE* f, string_view fmt, format_args args);
+
+/**
+  \rst
+  Formats ``args`` according to specifications in ``fmt`` and writes the output
+  to ``stdout``.
+
+  **Example**::
+
+    fmt::print("Elapsed time: {0:.2f} seconds", 1.23);
+  \endrst
+ */
+template <typename... T>
+FMT_INLINE void print(format_string<T...> fmt, T&&... args) {
+  const auto& vargs = fmt::make_format_args(args...);
+  return detail::is_utf8() ? vprint(fmt, vargs)
+                           : detail::vprint_mojibake(stdout, fmt, vargs);
+}
+
+/**
+  \rst
+  Formats ``args`` according to specifications in ``fmt`` and writes the
+  output to the file ``f``.
+
+  **Example**::
+
+    fmt::print(stderr, "Don't {}!", "panic");
+  \endrst
+ */
+template <typename... T>
+FMT_INLINE void print(std::FILE* f, format_string<T...> fmt, T&&... args) {
+  const auto& vargs = fmt::make_format_args(args...);
+  return detail::is_utf8() ? vprint(f, fmt, vargs)
+                           : detail::vprint_mojibake(f, fmt, vargs);
+}
+
+FMT_MODULE_EXPORT_END
+FMT_GCC_PRAGMA("GCC pop_options")
+FMT_END_NAMESPACE
+
+#ifdef FMT_HEADER_ONLY
+#  include "format.h"
+#endif
+#endif  // FMT_CORE_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/fmt.license.rst b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/fmt.license.rst
new file mode 100644
index 0000000000..f0ec3db4d2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/fmt.license.rst
@@ -0,0 +1,27 @@
+Copyright (c) 2012 - present, Victor Zverovich
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+--- Optional exception to the license ---
+
+As an exception, if, as a result of your compiling your source code, portions
+of this Software are embedded into a machine-executable object form of such
+source code, you may redistribute such embedded portions in such object form
+without including the above copyright and permission notices.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/format-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/format-inl.h
new file mode 100644
index 0000000000..22b1ec8df0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/format-inl.h
@@ -0,0 +1,1723 @@
+// Formatting library for C++ - implementation
+//
+// Copyright (c) 2012 - 2016, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_FORMAT_INL_H_
+#define FMT_FORMAT_INL_H_
+
+#include <algorithm>
+#include <cctype>
+#include <cerrno>  // errno
+#include <climits>
+#include <cmath>
+#include <cstdarg>
+#include <cstring>  // std::memmove
+#include <cwchar>
+#include <exception>
+
+#ifndef FMT_STATIC_THOUSANDS_SEPARATOR
+#  include <locale>
+#endif
+
+#ifdef _WIN32
+#  include <io.h>  // _isatty
+#endif
+
+#include "format.h"
+
+FMT_BEGIN_NAMESPACE
+namespace detail {
+
+FMT_FUNC void assert_fail(const char* file, int line, const char* message) {
+  // Use unchecked std::fprintf to avoid triggering another assertion when
+  // writing to stderr fails
+  std::fprintf(stderr, "%s:%d: assertion failed: %s", file, line, message);
+  // Chosen instead of std::abort to satisfy Clang in CUDA mode during device
+  // code pass.
+  std::terminate();
+}
+
+FMT_FUNC void throw_format_error(const char* message) {
+  FMT_THROW(format_error(message));
+}
+
+FMT_FUNC void format_error_code(detail::buffer<char>& out, int error_code,
+                                string_view message) noexcept {
+  // Report error code making sure that the output fits into
+  // inline_buffer_size to avoid dynamic memory allocation and potential
+  // bad_alloc.
+  out.try_resize(0);
+  static const char SEP[] = ": ";
+  static const char ERROR_STR[] = "error ";
+  // Subtract 2 to account for terminating null characters in SEP and ERROR_STR.
+  size_t error_code_size = sizeof(SEP) + sizeof(ERROR_STR) - 2;
+  auto abs_value = static_cast<uint32_or_64_or_128_t<int>>(error_code);
+  if (detail::is_negative(error_code)) {
+    abs_value = 0 - abs_value;
+    ++error_code_size;
+  }
+  error_code_size += detail::to_unsigned(detail::count_digits(abs_value));
+  auto it = buffer_appender<char>(out);
+  if (message.size() <= inline_buffer_size - error_code_size)
+    format_to(it, FMT_STRING("{}{}"), message, SEP);
+  format_to(it, FMT_STRING("{}{}"), ERROR_STR, error_code);
+  FMT_ASSERT(out.size() <= inline_buffer_size, "");
+}
+
+FMT_FUNC void report_error(format_func func, int error_code,
+                           const char* message) noexcept {
+  memory_buffer full_message;
+  func(full_message, error_code, message);
+  // Don't use fwrite_fully because the latter may throw.
+  if (std::fwrite(full_message.data(), full_message.size(), 1, stderr) > 0)
+    std::fputc('\n', stderr);
+}
+
+// A wrapper around fwrite that throws on error.
+inline void fwrite_fully(const void* ptr, size_t size, size_t count,
+                         FILE* stream) {
+  size_t written = std::fwrite(ptr, size, count, stream);
+  if (written < count)
+    FMT_THROW(system_error(errno, FMT_STRING("cannot write to file")));
+}
+
+#ifndef FMT_STATIC_THOUSANDS_SEPARATOR
+template <typename Locale>
+locale_ref::locale_ref(const Locale& loc) : locale_(&loc) {
+  static_assert(std::is_same<Locale, std::locale>::value, "");
+}
+
+template <typename Locale> Locale locale_ref::get() const {
+  static_assert(std::is_same<Locale, std::locale>::value, "");
+  return locale_ ? *static_cast<const std::locale*>(locale_) : std::locale();
+}
+
+template <typename Char>
+FMT_FUNC auto thousands_sep_impl(locale_ref loc) -> thousands_sep_result<Char> {
+  auto& facet = std::use_facet<std::numpunct<Char>>(loc.get<std::locale>());
+  auto grouping = facet.grouping();
+  auto thousands_sep = grouping.empty() ? Char() : facet.thousands_sep();
+  return {std::move(grouping), thousands_sep};
+}
+template <typename Char> FMT_FUNC Char decimal_point_impl(locale_ref loc) {
+  return std::use_facet<std::numpunct<Char>>(loc.get<std::locale>())
+      .decimal_point();
+}
+#else
+template <typename Char>
+FMT_FUNC auto thousands_sep_impl(locale_ref) -> thousands_sep_result<Char> {
+  return {"\03", FMT_STATIC_THOUSANDS_SEPARATOR};
+}
+template <typename Char> FMT_FUNC Char decimal_point_impl(locale_ref) {
+  return '.';
+}
+#endif
+}  // namespace detail
+
+#if !FMT_MSC_VERSION
+FMT_API FMT_FUNC format_error::~format_error() noexcept = default;
+#endif
+
+FMT_FUNC std::system_error vsystem_error(int error_code, string_view format_str,
+                                         format_args args) {
+  auto ec = std::error_code(error_code, std::generic_category());
+  return std::system_error(ec, vformat(format_str, args));
+}
+
+namespace detail {
+
+template <typename F> inline bool operator==(basic_fp<F> x, basic_fp<F> y) {
+  return x.f == y.f && x.e == y.e;
+}
+
+// Compilers should be able to optimize this into the ror instruction.
+FMT_CONSTEXPR inline uint32_t rotr(uint32_t n, uint32_t r) noexcept {
+  r &= 31;
+  return (n >> r) | (n << (32 - r));
+}
+FMT_CONSTEXPR inline uint64_t rotr(uint64_t n, uint32_t r) noexcept {
+  r &= 63;
+  return (n >> r) | (n << (64 - r));
+}
+
+// Computes 128-bit result of multiplication of two 64-bit unsigned integers.
+inline uint128_fallback umul128(uint64_t x, uint64_t y) noexcept {
+#if FMT_USE_INT128
+  auto p = static_cast<uint128_opt>(x) * static_cast<uint128_opt>(y);
+  return {static_cast<uint64_t>(p >> 64), static_cast<uint64_t>(p)};
+#elif defined(_MSC_VER) && defined(_M_X64)
+  auto result = uint128_fallback();
+  result.lo_ = _umul128(x, y, &result.hi_);
+  return result;
+#else
+  const uint64_t mask = static_cast<uint64_t>(max_value<uint32_t>());
+
+  uint64_t a = x >> 32;
+  uint64_t b = x & mask;
+  uint64_t c = y >> 32;
+  uint64_t d = y & mask;
+
+  uint64_t ac = a * c;
+  uint64_t bc = b * c;
+  uint64_t ad = a * d;
+  uint64_t bd = b * d;
+
+  uint64_t intermediate = (bd >> 32) + (ad & mask) + (bc & mask);
+
+  return {ac + (intermediate >> 32) + (ad >> 32) + (bc >> 32),
+          (intermediate << 32) + (bd & mask)};
+#endif
+}
+
+// Implementation of Dragonbox algorithm: https://github.com/jk-jeon/dragonbox.
+namespace dragonbox {
+// Computes upper 64 bits of multiplication of two 64-bit unsigned integers.
+inline uint64_t umul128_upper64(uint64_t x, uint64_t y) noexcept {
+#if FMT_USE_INT128
+  auto p = static_cast<uint128_opt>(x) * static_cast<uint128_opt>(y);
+  return static_cast<uint64_t>(p >> 64);
+#elif defined(_MSC_VER) && defined(_M_X64)
+  return __umulh(x, y);
+#else
+  return umul128(x, y).high();
+#endif
+}
+
+// Computes upper 128 bits of multiplication of a 64-bit unsigned integer and a
+// 128-bit unsigned integer.
+inline uint128_fallback umul192_upper128(uint64_t x,
+                                         uint128_fallback y) noexcept {
+  uint128_fallback r = umul128(x, y.high());
+  r += umul128_upper64(x, y.low());
+  return r;
+}
+
+// Computes upper 64 bits of multiplication of a 32-bit unsigned integer and a
+// 64-bit unsigned integer.
+inline uint64_t umul96_upper64(uint32_t x, uint64_t y) noexcept {
+  return umul128_upper64(static_cast<uint64_t>(x) << 32, y);
+}
+
+// Computes lower 128 bits of multiplication of a 64-bit unsigned integer and a
+// 128-bit unsigned integer.
+inline uint128_fallback umul192_lower128(uint64_t x,
+                                         uint128_fallback y) noexcept {
+  uint64_t high = x * y.high();
+  uint128_fallback high_low = umul128(x, y.low());
+  return {high + high_low.high(), high_low.low()};
+}
+
+// Computes lower 64 bits of multiplication of a 32-bit unsigned integer and a
+// 64-bit unsigned integer.
+inline uint64_t umul96_lower64(uint32_t x, uint64_t y) noexcept {
+  return x * y;
+}
+
+// Computes floor(log10(pow(2, e))) for e in [-2620, 2620] using the method from
+// https://fmt.dev/papers/Dragonbox.pdf#page=28, section 6.1.
+inline int floor_log10_pow2(int e) noexcept {
+  FMT_ASSERT(e <= 2620 && e >= -2620, "too large exponent");
+  static_assert((-1 >> 1) == -1, "right shift is not arithmetic");
+  return (e * 315653) >> 20;
+}
+
+// Various fast log computations.
+inline int floor_log2_pow10(int e) noexcept {
+  FMT_ASSERT(e <= 1233 && e >= -1233, "too large exponent");
+  return (e * 1741647) >> 19;
+}
+inline int floor_log10_pow2_minus_log10_4_over_3(int e) noexcept {
+  FMT_ASSERT(e <= 2936 && e >= -2985, "too large exponent");
+  return (e * 631305 - 261663) >> 21;
+}
+
+static constexpr struct {
+  uint32_t divisor;
+  int shift_amount;
+} div_small_pow10_infos[] = {{10, 16}, {100, 16}};
+
+// Replaces n by floor(n / pow(10, N)) returning true if and only if n is
+// divisible by pow(10, N).
+// Precondition: n <= pow(10, N + 1).
+template <int N>
+bool check_divisibility_and_divide_by_pow10(uint32_t& n) noexcept {
+  // The numbers below are chosen such that:
+  //   1. floor(n/d) = floor(nm / 2^k) where d=10 or d=100,
+  //   2. nm mod 2^k < m if and only if n is divisible by d,
+  // where m is magic_number, k is shift_amount
+  // and d is divisor.
+  //
+  // Item 1 is a common technique of replacing division by a constant with
+  // multiplication, see e.g. "Division by Invariant Integers Using
+  // Multiplication" by Granlund and Montgomery (1994). magic_number (m) is set
+  // to ceil(2^k/d) for large enough k.
+  // The idea for item 2 originates from Schubfach.
+  constexpr auto info = div_small_pow10_infos[N - 1];
+  FMT_ASSERT(n <= info.divisor * 10, "n is too large");
+  constexpr uint32_t magic_number =
+      (1u << info.shift_amount) / info.divisor + 1;
+  n *= magic_number;
+  const uint32_t comparison_mask = (1u << info.shift_amount) - 1;
+  bool result = (n & comparison_mask) < magic_number;
+  n >>= info.shift_amount;
+  return result;
+}
+
+// Computes floor(n / pow(10, N)) for small n and N.
+// Precondition: n <= pow(10, N + 1).
+template <int N> uint32_t small_division_by_pow10(uint32_t n) noexcept {
+  constexpr auto info = div_small_pow10_infos[N - 1];
+  FMT_ASSERT(n <= info.divisor * 10, "n is too large");
+  constexpr uint32_t magic_number =
+      (1u << info.shift_amount) / info.divisor + 1;
+  return (n * magic_number) >> info.shift_amount;
+}
+
+// Computes floor(n / 10^(kappa + 1)) (float)
+inline uint32_t divide_by_10_to_kappa_plus_1(uint32_t n) noexcept {
+  // 1374389535 = ceil(2^37/100)
+  return static_cast<uint32_t>((static_cast<uint64_t>(n) * 1374389535) >> 37);
+}
+// Computes floor(n / 10^(kappa + 1)) (double)
+inline uint64_t divide_by_10_to_kappa_plus_1(uint64_t n) noexcept {
+  // 2361183241434822607 = ceil(2^(64+7)/1000)
+  return umul128_upper64(n, 2361183241434822607ull) >> 7;
+}
+
+// Various subroutines using pow10 cache
+template <class T> struct cache_accessor;
+
+template <> struct cache_accessor<float> {
+  using carrier_uint = float_info<float>::carrier_uint;
+  using cache_entry_type = uint64_t;
+
+  static uint64_t get_cached_power(int k) noexcept {
+    FMT_ASSERT(k >= float_info<float>::min_k && k <= float_info<float>::max_k,
+               "k is out of range");
+    static constexpr const uint64_t pow10_significands[] = {
+        0x81ceb32c4b43fcf5, 0xa2425ff75e14fc32, 0xcad2f7f5359a3b3f,
+        0xfd87b5f28300ca0e, 0x9e74d1b791e07e49, 0xc612062576589ddb,
+        0xf79687aed3eec552, 0x9abe14cd44753b53, 0xc16d9a0095928a28,
+        0xf1c90080baf72cb2, 0x971da05074da7bef, 0xbce5086492111aeb,
+        0xec1e4a7db69561a6, 0x9392ee8e921d5d08, 0xb877aa3236a4b44a,
+        0xe69594bec44de15c, 0x901d7cf73ab0acda, 0xb424dc35095cd810,
+        0xe12e13424bb40e14, 0x8cbccc096f5088cc, 0xafebff0bcb24aaff,
+        0xdbe6fecebdedd5bf, 0x89705f4136b4a598, 0xabcc77118461cefd,
+        0xd6bf94d5e57a42bd, 0x8637bd05af6c69b6, 0xa7c5ac471b478424,
+        0xd1b71758e219652c, 0x83126e978d4fdf3c, 0xa3d70a3d70a3d70b,
+        0xcccccccccccccccd, 0x8000000000000000, 0xa000000000000000,
+        0xc800000000000000, 0xfa00000000000000, 0x9c40000000000000,
+        0xc350000000000000, 0xf424000000000000, 0x9896800000000000,
+        0xbebc200000000000, 0xee6b280000000000, 0x9502f90000000000,
+        0xba43b74000000000, 0xe8d4a51000000000, 0x9184e72a00000000,
+        0xb5e620f480000000, 0xe35fa931a0000000, 0x8e1bc9bf04000000,
+        0xb1a2bc2ec5000000, 0xde0b6b3a76400000, 0x8ac7230489e80000,
+        0xad78ebc5ac620000, 0xd8d726b7177a8000, 0x878678326eac9000,
+        0xa968163f0a57b400, 0xd3c21bcecceda100, 0x84595161401484a0,
+        0xa56fa5b99019a5c8, 0xcecb8f27f4200f3a, 0x813f3978f8940985,
+        0xa18f07d736b90be6, 0xc9f2c9cd04674edf, 0xfc6f7c4045812297,
+        0x9dc5ada82b70b59e, 0xc5371912364ce306, 0xf684df56c3e01bc7,
+        0x9a130b963a6c115d, 0xc097ce7bc90715b4, 0xf0bdc21abb48db21,
+        0x96769950b50d88f5, 0xbc143fa4e250eb32, 0xeb194f8e1ae525fe,
+        0x92efd1b8d0cf37bf, 0xb7abc627050305ae, 0xe596b7b0c643c71a,
+        0x8f7e32ce7bea5c70, 0xb35dbf821ae4f38c, 0xe0352f62a19e306f};
+    return pow10_significands[k - float_info<float>::min_k];
+  }
+
+  struct compute_mul_result {
+    carrier_uint result;
+    bool is_integer;
+  };
+  struct compute_mul_parity_result {
+    bool parity;
+    bool is_integer;
+  };
+
+  static compute_mul_result compute_mul(
+      carrier_uint u, const cache_entry_type& cache) noexcept {
+    auto r = umul96_upper64(u, cache);
+    return {static_cast<carrier_uint>(r >> 32),
+            static_cast<carrier_uint>(r) == 0};
+  }
+
+  static uint32_t compute_delta(const cache_entry_type& cache,
+                                int beta) noexcept {
+    return static_cast<uint32_t>(cache >> (64 - 1 - beta));
+  }
+
+  static compute_mul_parity_result compute_mul_parity(
+      carrier_uint two_f, const cache_entry_type& cache, int beta) noexcept {
+    FMT_ASSERT(beta >= 1, "");
+    FMT_ASSERT(beta < 64, "");
+
+    auto r = umul96_lower64(two_f, cache);
+    return {((r >> (64 - beta)) & 1) != 0,
+            static_cast<uint32_t>(r >> (32 - beta)) == 0};
+  }
+
+  static carrier_uint compute_left_endpoint_for_shorter_interval_case(
+      const cache_entry_type& cache, int beta) noexcept {
+    return static_cast<carrier_uint>(
+        (cache - (cache >> (num_significand_bits<float>() + 2))) >>
+        (64 - num_significand_bits<float>() - 1 - beta));
+  }
+
+  static carrier_uint compute_right_endpoint_for_shorter_interval_case(
+      const cache_entry_type& cache, int beta) noexcept {
+    return static_cast<carrier_uint>(
+        (cache + (cache >> (num_significand_bits<float>() + 1))) >>
+        (64 - num_significand_bits<float>() - 1 - beta));
+  }
+
+  static carrier_uint compute_round_up_for_shorter_interval_case(
+      const cache_entry_type& cache, int beta) noexcept {
+    return (static_cast<carrier_uint>(
+                cache >> (64 - num_significand_bits<float>() - 2 - beta)) +
+            1) /
+           2;
+  }
+};
+
+template <> struct cache_accessor<double> {
+  using carrier_uint = float_info<double>::carrier_uint;
+  using cache_entry_type = uint128_fallback;
+
+  static uint128_fallback get_cached_power(int k) noexcept {
+    FMT_ASSERT(k >= float_info<double>::min_k && k <= float_info<double>::max_k,
+               "k is out of range");
+
+    static constexpr const uint128_fallback pow10_significands[] = {
+#if FMT_USE_FULL_CACHE_DRAGONBOX
+      {0xff77b1fcbebcdc4f, 0x25e8e89c13bb0f7b},
+      {0x9faacf3df73609b1, 0x77b191618c54e9ad},
+      {0xc795830d75038c1d, 0xd59df5b9ef6a2418},
+      {0xf97ae3d0d2446f25, 0x4b0573286b44ad1e},
+      {0x9becce62836ac577, 0x4ee367f9430aec33},
+      {0xc2e801fb244576d5, 0x229c41f793cda740},
+      {0xf3a20279ed56d48a, 0x6b43527578c11110},
+      {0x9845418c345644d6, 0x830a13896b78aaaa},
+      {0xbe5691ef416bd60c, 0x23cc986bc656d554},
+      {0xedec366b11c6cb8f, 0x2cbfbe86b7ec8aa9},
+      {0x94b3a202eb1c3f39, 0x7bf7d71432f3d6aa},
+      {0xb9e08a83a5e34f07, 0xdaf5ccd93fb0cc54},
+      {0xe858ad248f5c22c9, 0xd1b3400f8f9cff69},
+      {0x91376c36d99995be, 0x23100809b9c21fa2},
+      {0xb58547448ffffb2d, 0xabd40a0c2832a78b},
+      {0xe2e69915b3fff9f9, 0x16c90c8f323f516d},
+      {0x8dd01fad907ffc3b, 0xae3da7d97f6792e4},
+      {0xb1442798f49ffb4a, 0x99cd11cfdf41779d},
+      {0xdd95317f31c7fa1d, 0x40405643d711d584},
+      {0x8a7d3eef7f1cfc52, 0x482835ea666b2573},
+      {0xad1c8eab5ee43b66, 0xda3243650005eed0},
+      {0xd863b256369d4a40, 0x90bed43e40076a83},
+      {0x873e4f75e2224e68, 0x5a7744a6e804a292},
+      {0xa90de3535aaae202, 0x711515d0a205cb37},
+      {0xd3515c2831559a83, 0x0d5a5b44ca873e04},
+      {0x8412d9991ed58091, 0xe858790afe9486c3},
+      {0xa5178fff668ae0b6, 0x626e974dbe39a873},
+      {0xce5d73ff402d98e3, 0xfb0a3d212dc81290},
+      {0x80fa687f881c7f8e, 0x7ce66634bc9d0b9a},
+      {0xa139029f6a239f72, 0x1c1fffc1ebc44e81},
+      {0xc987434744ac874e, 0xa327ffb266b56221},
+      {0xfbe9141915d7a922, 0x4bf1ff9f0062baa9},
+      {0x9d71ac8fada6c9b5, 0x6f773fc3603db4aa},
+      {0xc4ce17b399107c22, 0xcb550fb4384d21d4},
+      {0xf6019da07f549b2b, 0x7e2a53a146606a49},
+      {0x99c102844f94e0fb, 0x2eda7444cbfc426e},
+      {0xc0314325637a1939, 0xfa911155fefb5309},
+      {0xf03d93eebc589f88, 0x793555ab7eba27cb},
+      {0x96267c7535b763b5, 0x4bc1558b2f3458df},
+      {0xbbb01b9283253ca2, 0x9eb1aaedfb016f17},
+      {0xea9c227723ee8bcb, 0x465e15a979c1cadd},
+      {0x92a1958a7675175f, 0x0bfacd89ec191eca},
+      {0xb749faed14125d36, 0xcef980ec671f667c},
+      {0xe51c79a85916f484, 0x82b7e12780e7401b},
+      {0x8f31cc0937ae58d2, 0xd1b2ecb8b0908811},
+      {0xb2fe3f0b8599ef07, 0x861fa7e6dcb4aa16},
+      {0xdfbdcece67006ac9, 0x67a791e093e1d49b},
+      {0x8bd6a141006042bd, 0xe0c8bb2c5c6d24e1},
+      {0xaecc49914078536d, 0x58fae9f773886e19},
+      {0xda7f5bf590966848, 0xaf39a475506a899f},
+      {0x888f99797a5e012d, 0x6d8406c952429604},
+      {0xaab37fd7d8f58178, 0xc8e5087ba6d33b84},
+      {0xd5605fcdcf32e1d6, 0xfb1e4a9a90880a65},
+      {0x855c3be0a17fcd26, 0x5cf2eea09a550680},
+      {0xa6b34ad8c9dfc06f, 0xf42faa48c0ea481f},
+      {0xd0601d8efc57b08b, 0xf13b94daf124da27},
+      {0x823c12795db6ce57, 0x76c53d08d6b70859},
+      {0xa2cb1717b52481ed, 0x54768c4b0c64ca6f},
+      {0xcb7ddcdda26da268, 0xa9942f5dcf7dfd0a},
+      {0xfe5d54150b090b02, 0xd3f93b35435d7c4d},
+      {0x9efa548d26e5a6e1, 0xc47bc5014a1a6db0},
+      {0xc6b8e9b0709f109a, 0x359ab6419ca1091c},
+      {0xf867241c8cc6d4c0, 0xc30163d203c94b63},
+      {0x9b407691d7fc44f8, 0x79e0de63425dcf1e},
+      {0xc21094364dfb5636, 0x985915fc12f542e5},
+      {0xf294b943e17a2bc4, 0x3e6f5b7b17b2939e},
+      {0x979cf3ca6cec5b5a, 0xa705992ceecf9c43},
+      {0xbd8430bd08277231, 0x50c6ff782a838354},
+      {0xece53cec4a314ebd, 0xa4f8bf5635246429},
+      {0x940f4613ae5ed136, 0x871b7795e136be9a},
+      {0xb913179899f68584, 0x28e2557b59846e40},
+      {0xe757dd7ec07426e5, 0x331aeada2fe589d0},
+      {0x9096ea6f3848984f, 0x3ff0d2c85def7622},
+      {0xb4bca50b065abe63, 0x0fed077a756b53aa},
+      {0xe1ebce4dc7f16dfb, 0xd3e8495912c62895},
+      {0x8d3360f09cf6e4bd, 0x64712dd7abbbd95d},
+      {0xb080392cc4349dec, 0xbd8d794d96aacfb4},
+      {0xdca04777f541c567, 0xecf0d7a0fc5583a1},
+      {0x89e42caaf9491b60, 0xf41686c49db57245},
+      {0xac5d37d5b79b6239, 0x311c2875c522ced6},
+      {0xd77485cb25823ac7, 0x7d633293366b828c},
+      {0x86a8d39ef77164bc, 0xae5dff9c02033198},
+      {0xa8530886b54dbdeb, 0xd9f57f830283fdfd},
+      {0xd267caa862a12d66, 0xd072df63c324fd7c},
+      {0x8380dea93da4bc60, 0x4247cb9e59f71e6e},
+      {0xa46116538d0deb78, 0x52d9be85f074e609},
+      {0xcd795be870516656, 0x67902e276c921f8c},
+      {0x806bd9714632dff6, 0x00ba1cd8a3db53b7},
+      {0xa086cfcd97bf97f3, 0x80e8a40eccd228a5},
+      {0xc8a883c0fdaf7df0, 0x6122cd128006b2ce},
+      {0xfad2a4b13d1b5d6c, 0x796b805720085f82},
+      {0x9cc3a6eec6311a63, 0xcbe3303674053bb1},
+      {0xc3f490aa77bd60fc, 0xbedbfc4411068a9d},
+      {0xf4f1b4d515acb93b, 0xee92fb5515482d45},
+      {0x991711052d8bf3c5, 0x751bdd152d4d1c4b},
+      {0xbf5cd54678eef0b6, 0xd262d45a78a0635e},
+      {0xef340a98172aace4, 0x86fb897116c87c35},
+      {0x9580869f0e7aac0e, 0xd45d35e6ae3d4da1},
+      {0xbae0a846d2195712, 0x8974836059cca10a},
+      {0xe998d258869facd7, 0x2bd1a438703fc94c},
+      {0x91ff83775423cc06, 0x7b6306a34627ddd0},
+      {0xb67f6455292cbf08, 0x1a3bc84c17b1d543},
+      {0xe41f3d6a7377eeca, 0x20caba5f1d9e4a94},
+      {0x8e938662882af53e, 0x547eb47b7282ee9d},
+      {0xb23867fb2a35b28d, 0xe99e619a4f23aa44},
+      {0xdec681f9f4c31f31, 0x6405fa00e2ec94d5},
+      {0x8b3c113c38f9f37e, 0xde83bc408dd3dd05},
+      {0xae0b158b4738705e, 0x9624ab50b148d446},
+      {0xd98ddaee19068c76, 0x3badd624dd9b0958},
+      {0x87f8a8d4cfa417c9, 0xe54ca5d70a80e5d7},
+      {0xa9f6d30a038d1dbc, 0x5e9fcf4ccd211f4d},
+      {0xd47487cc8470652b, 0x7647c32000696720},
+      {0x84c8d4dfd2c63f3b, 0x29ecd9f40041e074},
+      {0xa5fb0a17c777cf09, 0xf468107100525891},
+      {0xcf79cc9db955c2cc, 0x7182148d4066eeb5},
+      {0x81ac1fe293d599bf, 0xc6f14cd848405531},
+      {0xa21727db38cb002f, 0xb8ada00e5a506a7d},
+      {0xca9cf1d206fdc03b, 0xa6d90811f0e4851d},
+      {0xfd442e4688bd304a, 0x908f4a166d1da664},
+      {0x9e4a9cec15763e2e, 0x9a598e4e043287ff},
+      {0xc5dd44271ad3cdba, 0x40eff1e1853f29fe},
+      {0xf7549530e188c128, 0xd12bee59e68ef47d},
+      {0x9a94dd3e8cf578b9, 0x82bb74f8301958cf},
+      {0xc13a148e3032d6e7, 0xe36a52363c1faf02},
+      {0xf18899b1bc3f8ca1, 0xdc44e6c3cb279ac2},
+      {0x96f5600f15a7b7e5, 0x29ab103a5ef8c0ba},
+      {0xbcb2b812db11a5de, 0x7415d448f6b6f0e8},
+      {0xebdf661791d60f56, 0x111b495b3464ad22},
+      {0x936b9fcebb25c995, 0xcab10dd900beec35},
+      {0xb84687c269ef3bfb, 0x3d5d514f40eea743},
+      {0xe65829b3046b0afa, 0x0cb4a5a3112a5113},
+      {0x8ff71a0fe2c2e6dc, 0x47f0e785eaba72ac},
+      {0xb3f4e093db73a093, 0x59ed216765690f57},
+      {0xe0f218b8d25088b8, 0x306869c13ec3532d},
+      {0x8c974f7383725573, 0x1e414218c73a13fc},
+      {0xafbd2350644eeacf, 0xe5d1929ef90898fb},
+      {0xdbac6c247d62a583, 0xdf45f746b74abf3a},
+      {0x894bc396ce5da772, 0x6b8bba8c328eb784},
+      {0xab9eb47c81f5114f, 0x066ea92f3f326565},
+      {0xd686619ba27255a2, 0xc80a537b0efefebe},
+      {0x8613fd0145877585, 0xbd06742ce95f5f37},
+      {0xa798fc4196e952e7, 0x2c48113823b73705},
+      {0xd17f3b51fca3a7a0, 0xf75a15862ca504c6},
+      {0x82ef85133de648c4, 0x9a984d73dbe722fc},
+      {0xa3ab66580d5fdaf5, 0xc13e60d0d2e0ebbb},
+      {0xcc963fee10b7d1b3, 0x318df905079926a9},
+      {0xffbbcfe994e5c61f, 0xfdf17746497f7053},
+      {0x9fd561f1fd0f9bd3, 0xfeb6ea8bedefa634},
+      {0xc7caba6e7c5382c8, 0xfe64a52ee96b8fc1},
+      {0xf9bd690a1b68637b, 0x3dfdce7aa3c673b1},
+      {0x9c1661a651213e2d, 0x06bea10ca65c084f},
+      {0xc31bfa0fe5698db8, 0x486e494fcff30a63},
+      {0xf3e2f893dec3f126, 0x5a89dba3c3efccfb},
+      {0x986ddb5c6b3a76b7, 0xf89629465a75e01d},
+      {0xbe89523386091465, 0xf6bbb397f1135824},
+      {0xee2ba6c0678b597f, 0x746aa07ded582e2d},
+      {0x94db483840b717ef, 0xa8c2a44eb4571cdd},
+      {0xba121a4650e4ddeb, 0x92f34d62616ce414},
+      {0xe896a0d7e51e1566, 0x77b020baf9c81d18},
+      {0x915e2486ef32cd60, 0x0ace1474dc1d122f},
+      {0xb5b5ada8aaff80b8, 0x0d819992132456bb},
+      {0xe3231912d5bf60e6, 0x10e1fff697ed6c6a},
+      {0x8df5efabc5979c8f, 0xca8d3ffa1ef463c2},
+      {0xb1736b96b6fd83b3, 0xbd308ff8a6b17cb3},
+      {0xddd0467c64bce4a0, 0xac7cb3f6d05ddbdf},
+      {0x8aa22c0dbef60ee4, 0x6bcdf07a423aa96c},
+      {0xad4ab7112eb3929d, 0x86c16c98d2c953c7},
+      {0xd89d64d57a607744, 0xe871c7bf077ba8b8},
+      {0x87625f056c7c4a8b, 0x11471cd764ad4973},
+      {0xa93af6c6c79b5d2d, 0xd598e40d3dd89bd0},
+      {0xd389b47879823479, 0x4aff1d108d4ec2c4},
+      {0x843610cb4bf160cb, 0xcedf722a585139bb},
+      {0xa54394fe1eedb8fe, 0xc2974eb4ee658829},
+      {0xce947a3da6a9273e, 0x733d226229feea33},
+      {0x811ccc668829b887, 0x0806357d5a3f5260},
+      {0xa163ff802a3426a8, 0xca07c2dcb0cf26f8},
+      {0xc9bcff6034c13052, 0xfc89b393dd02f0b6},
+      {0xfc2c3f3841f17c67, 0xbbac2078d443ace3},
+      {0x9d9ba7832936edc0, 0xd54b944b84aa4c0e},
+      {0xc5029163f384a931, 0x0a9e795e65d4df12},
+      {0xf64335bcf065d37d, 0x4d4617b5ff4a16d6},
+      {0x99ea0196163fa42e, 0x504bced1bf8e4e46},
+      {0xc06481fb9bcf8d39, 0xe45ec2862f71e1d7},
+      {0xf07da27a82c37088, 0x5d767327bb4e5a4d},
+      {0x964e858c91ba2655, 0x3a6a07f8d510f870},
+      {0xbbe226efb628afea, 0x890489f70a55368c},
+      {0xeadab0aba3b2dbe5, 0x2b45ac74ccea842f},
+      {0x92c8ae6b464fc96f, 0x3b0b8bc90012929e},
+      {0xb77ada0617e3bbcb, 0x09ce6ebb40173745},
+      {0xe55990879ddcaabd, 0xcc420a6a101d0516},
+      {0x8f57fa54c2a9eab6, 0x9fa946824a12232e},
+      {0xb32df8e9f3546564, 0x47939822dc96abfa},
+      {0xdff9772470297ebd, 0x59787e2b93bc56f8},
+      {0x8bfbea76c619ef36, 0x57eb4edb3c55b65b},
+      {0xaefae51477a06b03, 0xede622920b6b23f2},
+      {0xdab99e59958885c4, 0xe95fab368e45ecee},
+      {0x88b402f7fd75539b, 0x11dbcb0218ebb415},
+      {0xaae103b5fcd2a881, 0xd652bdc29f26a11a},
+      {0xd59944a37c0752a2, 0x4be76d3346f04960},
+      {0x857fcae62d8493a5, 0x6f70a4400c562ddc},
+      {0xa6dfbd9fb8e5b88e, 0xcb4ccd500f6bb953},
+      {0xd097ad07a71f26b2, 0x7e2000a41346a7a8},
+      {0x825ecc24c873782f, 0x8ed400668c0c28c9},
+      {0xa2f67f2dfa90563b, 0x728900802f0f32fb},
+      {0xcbb41ef979346bca, 0x4f2b40a03ad2ffba},
+      {0xfea126b7d78186bc, 0xe2f610c84987bfa9},
+      {0x9f24b832e6b0f436, 0x0dd9ca7d2df4d7ca},
+      {0xc6ede63fa05d3143, 0x91503d1c79720dbc},
+      {0xf8a95fcf88747d94, 0x75a44c6397ce912b},
+      {0x9b69dbe1b548ce7c, 0xc986afbe3ee11abb},
+      {0xc24452da229b021b, 0xfbe85badce996169},
+      {0xf2d56790ab41c2a2, 0xfae27299423fb9c4},
+      {0x97c560ba6b0919a5, 0xdccd879fc967d41b},
+      {0xbdb6b8e905cb600f, 0x5400e987bbc1c921},
+      {0xed246723473e3813, 0x290123e9aab23b69},
+      {0x9436c0760c86e30b, 0xf9a0b6720aaf6522},
+      {0xb94470938fa89bce, 0xf808e40e8d5b3e6a},
+      {0xe7958cb87392c2c2, 0xb60b1d1230b20e05},
+      {0x90bd77f3483bb9b9, 0xb1c6f22b5e6f48c3},
+      {0xb4ecd5f01a4aa828, 0x1e38aeb6360b1af4},
+      {0xe2280b6c20dd5232, 0x25c6da63c38de1b1},
+      {0x8d590723948a535f, 0x579c487e5a38ad0f},
+      {0xb0af48ec79ace837, 0x2d835a9df0c6d852},
+      {0xdcdb1b2798182244, 0xf8e431456cf88e66},
+      {0x8a08f0f8bf0f156b, 0x1b8e9ecb641b5900},
+      {0xac8b2d36eed2dac5, 0xe272467e3d222f40},
+      {0xd7adf884aa879177, 0x5b0ed81dcc6abb10},
+      {0x86ccbb52ea94baea, 0x98e947129fc2b4ea},
+      {0xa87fea27a539e9a5, 0x3f2398d747b36225},
+      {0xd29fe4b18e88640e, 0x8eec7f0d19a03aae},
+      {0x83a3eeeef9153e89, 0x1953cf68300424ad},
+      {0xa48ceaaab75a8e2b, 0x5fa8c3423c052dd8},
+      {0xcdb02555653131b6, 0x3792f412cb06794e},
+      {0x808e17555f3ebf11, 0xe2bbd88bbee40bd1},
+      {0xa0b19d2ab70e6ed6, 0x5b6aceaeae9d0ec5},
+      {0xc8de047564d20a8b, 0xf245825a5a445276},
+      {0xfb158592be068d2e, 0xeed6e2f0f0d56713},
+      {0x9ced737bb6c4183d, 0x55464dd69685606c},
+      {0xc428d05aa4751e4c, 0xaa97e14c3c26b887},
+      {0xf53304714d9265df, 0xd53dd99f4b3066a9},
+      {0x993fe2c6d07b7fab, 0xe546a8038efe402a},
+      {0xbf8fdb78849a5f96, 0xde98520472bdd034},
+      {0xef73d256a5c0f77c, 0x963e66858f6d4441},
+      {0x95a8637627989aad, 0xdde7001379a44aa9},
+      {0xbb127c53b17ec159, 0x5560c018580d5d53},
+      {0xe9d71b689dde71af, 0xaab8f01e6e10b4a7},
+      {0x9226712162ab070d, 0xcab3961304ca70e9},
+      {0xb6b00d69bb55c8d1, 0x3d607b97c5fd0d23},
+      {0xe45c10c42a2b3b05, 0x8cb89a7db77c506b},
+      {0x8eb98a7a9a5b04e3, 0x77f3608e92adb243},
+      {0xb267ed1940f1c61c, 0x55f038b237591ed4},
+      {0xdf01e85f912e37a3, 0x6b6c46dec52f6689},
+      {0x8b61313bbabce2c6, 0x2323ac4b3b3da016},
+      {0xae397d8aa96c1b77, 0xabec975e0a0d081b},
+      {0xd9c7dced53c72255, 0x96e7bd358c904a22},
+      {0x881cea14545c7575, 0x7e50d64177da2e55},
+      {0xaa242499697392d2, 0xdde50bd1d5d0b9ea},
+      {0xd4ad2dbfc3d07787, 0x955e4ec64b44e865},
+      {0x84ec3c97da624ab4, 0xbd5af13bef0b113f},
+      {0xa6274bbdd0fadd61, 0xecb1ad8aeacdd58f},
+      {0xcfb11ead453994ba, 0x67de18eda5814af3},
+      {0x81ceb32c4b43fcf4, 0x80eacf948770ced8},
+      {0xa2425ff75e14fc31, 0xa1258379a94d028e},
+      {0xcad2f7f5359a3b3e, 0x096ee45813a04331},
+      {0xfd87b5f28300ca0d, 0x8bca9d6e188853fd},
+      {0x9e74d1b791e07e48, 0x775ea264cf55347e},
+      {0xc612062576589dda, 0x95364afe032a819e},
+      {0xf79687aed3eec551, 0x3a83ddbd83f52205},
+      {0x9abe14cd44753b52, 0xc4926a9672793543},
+      {0xc16d9a0095928a27, 0x75b7053c0f178294},
+      {0xf1c90080baf72cb1, 0x5324c68b12dd6339},
+      {0x971da05074da7bee, 0xd3f6fc16ebca5e04},
+      {0xbce5086492111aea, 0x88f4bb1ca6bcf585},
+      {0xec1e4a7db69561a5, 0x2b31e9e3d06c32e6},
+      {0x9392ee8e921d5d07, 0x3aff322e62439fd0},
+      {0xb877aa3236a4b449, 0x09befeb9fad487c3},
+      {0xe69594bec44de15b, 0x4c2ebe687989a9b4},
+      {0x901d7cf73ab0acd9, 0x0f9d37014bf60a11},
+      {0xb424dc35095cd80f, 0x538484c19ef38c95},
+      {0xe12e13424bb40e13, 0x2865a5f206b06fba},
+      {0x8cbccc096f5088cb, 0xf93f87b7442e45d4},
+      {0xafebff0bcb24aafe, 0xf78f69a51539d749},
+      {0xdbe6fecebdedd5be, 0xb573440e5a884d1c},
+      {0x89705f4136b4a597, 0x31680a88f8953031},
+      {0xabcc77118461cefc, 0xfdc20d2b36ba7c3e},
+      {0xd6bf94d5e57a42bc, 0x3d32907604691b4d},
+      {0x8637bd05af6c69b5, 0xa63f9a49c2c1b110},
+      {0xa7c5ac471b478423, 0x0fcf80dc33721d54},
+      {0xd1b71758e219652b, 0xd3c36113404ea4a9},
+      {0x83126e978d4fdf3b, 0x645a1cac083126ea},
+      {0xa3d70a3d70a3d70a, 0x3d70a3d70a3d70a4},
+      {0xcccccccccccccccc, 0xcccccccccccccccd},
+      {0x8000000000000000, 0x0000000000000000},
+      {0xa000000000000000, 0x0000000000000000},
+      {0xc800000000000000, 0x0000000000000000},
+      {0xfa00000000000000, 0x0000000000000000},
+      {0x9c40000000000000, 0x0000000000000000},
+      {0xc350000000000000, 0x0000000000000000},
+      {0xf424000000000000, 0x0000000000000000},
+      {0x9896800000000000, 0x0000000000000000},
+      {0xbebc200000000000, 0x0000000000000000},
+      {0xee6b280000000000, 0x0000000000000000},
+      {0x9502f90000000000, 0x0000000000000000},
+      {0xba43b74000000000, 0x0000000000000000},
+      {0xe8d4a51000000000, 0x0000000000000000},
+      {0x9184e72a00000000, 0x0000000000000000},
+      {0xb5e620f480000000, 0x0000000000000000},
+      {0xe35fa931a0000000, 0x0000000000000000},
+      {0x8e1bc9bf04000000, 0x0000000000000000},
+      {0xb1a2bc2ec5000000, 0x0000000000000000},
+      {0xde0b6b3a76400000, 0x0000000000000000},
+      {0x8ac7230489e80000, 0x0000000000000000},
+      {0xad78ebc5ac620000, 0x0000000000000000},
+      {0xd8d726b7177a8000, 0x0000000000000000},
+      {0x878678326eac9000, 0x0000000000000000},
+      {0xa968163f0a57b400, 0x0000000000000000},
+      {0xd3c21bcecceda100, 0x0000000000000000},
+      {0x84595161401484a0, 0x0000000000000000},
+      {0xa56fa5b99019a5c8, 0x0000000000000000},
+      {0xcecb8f27f4200f3a, 0x0000000000000000},
+      {0x813f3978f8940984, 0x4000000000000000},
+      {0xa18f07d736b90be5, 0x5000000000000000},
+      {0xc9f2c9cd04674ede, 0xa400000000000000},
+      {0xfc6f7c4045812296, 0x4d00000000000000},
+      {0x9dc5ada82b70b59d, 0xf020000000000000},
+      {0xc5371912364ce305, 0x6c28000000000000},
+      {0xf684df56c3e01bc6, 0xc732000000000000},
+      {0x9a130b963a6c115c, 0x3c7f400000000000},
+      {0xc097ce7bc90715b3, 0x4b9f100000000000},
+      {0xf0bdc21abb48db20, 0x1e86d40000000000},
+      {0x96769950b50d88f4, 0x1314448000000000},
+      {0xbc143fa4e250eb31, 0x17d955a000000000},
+      {0xeb194f8e1ae525fd, 0x5dcfab0800000000},
+      {0x92efd1b8d0cf37be, 0x5aa1cae500000000},
+      {0xb7abc627050305ad, 0xf14a3d9e40000000},
+      {0xe596b7b0c643c719, 0x6d9ccd05d0000000},
+      {0x8f7e32ce7bea5c6f, 0xe4820023a2000000},
+      {0xb35dbf821ae4f38b, 0xdda2802c8a800000},
+      {0xe0352f62a19e306e, 0xd50b2037ad200000},
+      {0x8c213d9da502de45, 0x4526f422cc340000},
+      {0xaf298d050e4395d6, 0x9670b12b7f410000},
+      {0xdaf3f04651d47b4c, 0x3c0cdd765f114000},
+      {0x88d8762bf324cd0f, 0xa5880a69fb6ac800},
+      {0xab0e93b6efee0053, 0x8eea0d047a457a00},
+      {0xd5d238a4abe98068, 0x72a4904598d6d880},
+      {0x85a36366eb71f041, 0x47a6da2b7f864750},
+      {0xa70c3c40a64e6c51, 0x999090b65f67d924},
+      {0xd0cf4b50cfe20765, 0xfff4b4e3f741cf6d},
+      {0x82818f1281ed449f, 0xbff8f10e7a8921a5},
+      {0xa321f2d7226895c7, 0xaff72d52192b6a0e},
+      {0xcbea6f8ceb02bb39, 0x9bf4f8a69f764491},
+      {0xfee50b7025c36a08, 0x02f236d04753d5b5},
+      {0x9f4f2726179a2245, 0x01d762422c946591},
+      {0xc722f0ef9d80aad6, 0x424d3ad2b7b97ef6},
+      {0xf8ebad2b84e0d58b, 0xd2e0898765a7deb3},
+      {0x9b934c3b330c8577, 0x63cc55f49f88eb30},
+      {0xc2781f49ffcfa6d5, 0x3cbf6b71c76b25fc},
+      {0xf316271c7fc3908a, 0x8bef464e3945ef7b},
+      {0x97edd871cfda3a56, 0x97758bf0e3cbb5ad},
+      {0xbde94e8e43d0c8ec, 0x3d52eeed1cbea318},
+      {0xed63a231d4c4fb27, 0x4ca7aaa863ee4bde},
+      {0x945e455f24fb1cf8, 0x8fe8caa93e74ef6b},
+      {0xb975d6b6ee39e436, 0xb3e2fd538e122b45},
+      {0xe7d34c64a9c85d44, 0x60dbbca87196b617},
+      {0x90e40fbeea1d3a4a, 0xbc8955e946fe31ce},
+      {0xb51d13aea4a488dd, 0x6babab6398bdbe42},
+      {0xe264589a4dcdab14, 0xc696963c7eed2dd2},
+      {0x8d7eb76070a08aec, 0xfc1e1de5cf543ca3},
+      {0xb0de65388cc8ada8, 0x3b25a55f43294bcc},
+      {0xdd15fe86affad912, 0x49ef0eb713f39ebf},
+      {0x8a2dbf142dfcc7ab, 0x6e3569326c784338},
+      {0xacb92ed9397bf996, 0x49c2c37f07965405},
+      {0xd7e77a8f87daf7fb, 0xdc33745ec97be907},
+      {0x86f0ac99b4e8dafd, 0x69a028bb3ded71a4},
+      {0xa8acd7c0222311bc, 0xc40832ea0d68ce0d},
+      {0xd2d80db02aabd62b, 0xf50a3fa490c30191},
+      {0x83c7088e1aab65db, 0x792667c6da79e0fb},
+      {0xa4b8cab1a1563f52, 0x577001b891185939},
+      {0xcde6fd5e09abcf26, 0xed4c0226b55e6f87},
+      {0x80b05e5ac60b6178, 0x544f8158315b05b5},
+      {0xa0dc75f1778e39d6, 0x696361ae3db1c722},
+      {0xc913936dd571c84c, 0x03bc3a19cd1e38ea},
+      {0xfb5878494ace3a5f, 0x04ab48a04065c724},
+      {0x9d174b2dcec0e47b, 0x62eb0d64283f9c77},
+      {0xc45d1df942711d9a, 0x3ba5d0bd324f8395},
+      {0xf5746577930d6500, 0xca8f44ec7ee3647a},
+      {0x9968bf6abbe85f20, 0x7e998b13cf4e1ecc},
+      {0xbfc2ef456ae276e8, 0x9e3fedd8c321a67f},
+      {0xefb3ab16c59b14a2, 0xc5cfe94ef3ea101f},
+      {0x95d04aee3b80ece5, 0xbba1f1d158724a13},
+      {0xbb445da9ca61281f, 0x2a8a6e45ae8edc98},
+      {0xea1575143cf97226, 0xf52d09d71a3293be},
+      {0x924d692ca61be758, 0x593c2626705f9c57},
+      {0xb6e0c377cfa2e12e, 0x6f8b2fb00c77836d},
+      {0xe498f455c38b997a, 0x0b6dfb9c0f956448},
+      {0x8edf98b59a373fec, 0x4724bd4189bd5ead},
+      {0xb2977ee300c50fe7, 0x58edec91ec2cb658},
+      {0xdf3d5e9bc0f653e1, 0x2f2967b66737e3ee},
+      {0x8b865b215899f46c, 0xbd79e0d20082ee75},
+      {0xae67f1e9aec07187, 0xecd8590680a3aa12},
+      {0xda01ee641a708de9, 0xe80e6f4820cc9496},
+      {0x884134fe908658b2, 0x3109058d147fdcde},
+      {0xaa51823e34a7eede, 0xbd4b46f0599fd416},
+      {0xd4e5e2cdc1d1ea96, 0x6c9e18ac7007c91b},
+      {0x850fadc09923329e, 0x03e2cf6bc604ddb1},
+      {0xa6539930bf6bff45, 0x84db8346b786151d},
+      {0xcfe87f7cef46ff16, 0xe612641865679a64},
+      {0x81f14fae158c5f6e, 0x4fcb7e8f3f60c07f},
+      {0xa26da3999aef7749, 0xe3be5e330f38f09e},
+      {0xcb090c8001ab551c, 0x5cadf5bfd3072cc6},
+      {0xfdcb4fa002162a63, 0x73d9732fc7c8f7f7},
+      {0x9e9f11c4014dda7e, 0x2867e7fddcdd9afb},
+      {0xc646d63501a1511d, 0xb281e1fd541501b9},
+      {0xf7d88bc24209a565, 0x1f225a7ca91a4227},
+      {0x9ae757596946075f, 0x3375788de9b06959},
+      {0xc1a12d2fc3978937, 0x0052d6b1641c83af},
+      {0xf209787bb47d6b84, 0xc0678c5dbd23a49b},
+      {0x9745eb4d50ce6332, 0xf840b7ba963646e1},
+      {0xbd176620a501fbff, 0xb650e5a93bc3d899},
+      {0xec5d3fa8ce427aff, 0xa3e51f138ab4cebf},
+      {0x93ba47c980e98cdf, 0xc66f336c36b10138},
+      {0xb8a8d9bbe123f017, 0xb80b0047445d4185},
+      {0xe6d3102ad96cec1d, 0xa60dc059157491e6},
+      {0x9043ea1ac7e41392, 0x87c89837ad68db30},
+      {0xb454e4a179dd1877, 0x29babe4598c311fc},
+      {0xe16a1dc9d8545e94, 0xf4296dd6fef3d67b},
+      {0x8ce2529e2734bb1d, 0x1899e4a65f58660d},
+      {0xb01ae745b101e9e4, 0x5ec05dcff72e7f90},
+      {0xdc21a1171d42645d, 0x76707543f4fa1f74},
+      {0x899504ae72497eba, 0x6a06494a791c53a9},
+      {0xabfa45da0edbde69, 0x0487db9d17636893},
+      {0xd6f8d7509292d603, 0x45a9d2845d3c42b7},
+      {0x865b86925b9bc5c2, 0x0b8a2392ba45a9b3},
+      {0xa7f26836f282b732, 0x8e6cac7768d7141f},
+      {0xd1ef0244af2364ff, 0x3207d795430cd927},
+      {0x8335616aed761f1f, 0x7f44e6bd49e807b9},
+      {0xa402b9c5a8d3a6e7, 0x5f16206c9c6209a7},
+      {0xcd036837130890a1, 0x36dba887c37a8c10},
+      {0x802221226be55a64, 0xc2494954da2c978a},
+      {0xa02aa96b06deb0fd, 0xf2db9baa10b7bd6d},
+      {0xc83553c5c8965d3d, 0x6f92829494e5acc8},
+      {0xfa42a8b73abbf48c, 0xcb772339ba1f17fa},
+      {0x9c69a97284b578d7, 0xff2a760414536efc},
+      {0xc38413cf25e2d70d, 0xfef5138519684abb},
+      {0xf46518c2ef5b8cd1, 0x7eb258665fc25d6a},
+      {0x98bf2f79d5993802, 0xef2f773ffbd97a62},
+      {0xbeeefb584aff8603, 0xaafb550ffacfd8fb},
+      {0xeeaaba2e5dbf6784, 0x95ba2a53f983cf39},
+      {0x952ab45cfa97a0b2, 0xdd945a747bf26184},
+      {0xba756174393d88df, 0x94f971119aeef9e5},
+      {0xe912b9d1478ceb17, 0x7a37cd5601aab85e},
+      {0x91abb422ccb812ee, 0xac62e055c10ab33b},
+      {0xb616a12b7fe617aa, 0x577b986b314d600a},
+      {0xe39c49765fdf9d94, 0xed5a7e85fda0b80c},
+      {0x8e41ade9fbebc27d, 0x14588f13be847308},
+      {0xb1d219647ae6b31c, 0x596eb2d8ae258fc9},
+      {0xde469fbd99a05fe3, 0x6fca5f8ed9aef3bc},
+      {0x8aec23d680043bee, 0x25de7bb9480d5855},
+      {0xada72ccc20054ae9, 0xaf561aa79a10ae6b},
+      {0xd910f7ff28069da4, 0x1b2ba1518094da05},
+      {0x87aa9aff79042286, 0x90fb44d2f05d0843},
+      {0xa99541bf57452b28, 0x353a1607ac744a54},
+      {0xd3fa922f2d1675f2, 0x42889b8997915ce9},
+      {0x847c9b5d7c2e09b7, 0x69956135febada12},
+      {0xa59bc234db398c25, 0x43fab9837e699096},
+      {0xcf02b2c21207ef2e, 0x94f967e45e03f4bc},
+      {0x8161afb94b44f57d, 0x1d1be0eebac278f6},
+      {0xa1ba1ba79e1632dc, 0x6462d92a69731733},
+      {0xca28a291859bbf93, 0x7d7b8f7503cfdcff},
+      {0xfcb2cb35e702af78, 0x5cda735244c3d43f},
+      {0x9defbf01b061adab, 0x3a0888136afa64a8},
+      {0xc56baec21c7a1916, 0x088aaa1845b8fdd1},
+      {0xf6c69a72a3989f5b, 0x8aad549e57273d46},
+      {0x9a3c2087a63f6399, 0x36ac54e2f678864c},
+      {0xc0cb28a98fcf3c7f, 0x84576a1bb416a7de},
+      {0xf0fdf2d3f3c30b9f, 0x656d44a2a11c51d6},
+      {0x969eb7c47859e743, 0x9f644ae5a4b1b326},
+      {0xbc4665b596706114, 0x873d5d9f0dde1fef},
+      {0xeb57ff22fc0c7959, 0xa90cb506d155a7eb},
+      {0x9316ff75dd87cbd8, 0x09a7f12442d588f3},
+      {0xb7dcbf5354e9bece, 0x0c11ed6d538aeb30},
+      {0xe5d3ef282a242e81, 0x8f1668c8a86da5fb},
+      {0x8fa475791a569d10, 0xf96e017d694487bd},
+      {0xb38d92d760ec4455, 0x37c981dcc395a9ad},
+      {0xe070f78d3927556a, 0x85bbe253f47b1418},
+      {0x8c469ab843b89562, 0x93956d7478ccec8f},
+      {0xaf58416654a6babb, 0x387ac8d1970027b3},
+      {0xdb2e51bfe9d0696a, 0x06997b05fcc0319f},
+      {0x88fcf317f22241e2, 0x441fece3bdf81f04},
+      {0xab3c2fddeeaad25a, 0xd527e81cad7626c4},
+      {0xd60b3bd56a5586f1, 0x8a71e223d8d3b075},
+      {0x85c7056562757456, 0xf6872d5667844e4a},
+      {0xa738c6bebb12d16c, 0xb428f8ac016561dc},
+      {0xd106f86e69d785c7, 0xe13336d701beba53},
+      {0x82a45b450226b39c, 0xecc0024661173474},
+      {0xa34d721642b06084, 0x27f002d7f95d0191},
+      {0xcc20ce9bd35c78a5, 0x31ec038df7b441f5},
+      {0xff290242c83396ce, 0x7e67047175a15272},
+      {0x9f79a169bd203e41, 0x0f0062c6e984d387},
+      {0xc75809c42c684dd1, 0x52c07b78a3e60869},
+      {0xf92e0c3537826145, 0xa7709a56ccdf8a83},
+      {0x9bbcc7a142b17ccb, 0x88a66076400bb692},
+      {0xc2abf989935ddbfe, 0x6acff893d00ea436},
+      {0xf356f7ebf83552fe, 0x0583f6b8c4124d44},
+      {0x98165af37b2153de, 0xc3727a337a8b704b},
+      {0xbe1bf1b059e9a8d6, 0x744f18c0592e4c5d},
+      {0xeda2ee1c7064130c, 0x1162def06f79df74},
+      {0x9485d4d1c63e8be7, 0x8addcb5645ac2ba9},
+      {0xb9a74a0637ce2ee1, 0x6d953e2bd7173693},
+      {0xe8111c87c5c1ba99, 0xc8fa8db6ccdd0438},
+      {0x910ab1d4db9914a0, 0x1d9c9892400a22a3},
+      {0xb54d5e4a127f59c8, 0x2503beb6d00cab4c},
+      {0xe2a0b5dc971f303a, 0x2e44ae64840fd61e},
+      {0x8da471a9de737e24, 0x5ceaecfed289e5d3},
+      {0xb10d8e1456105dad, 0x7425a83e872c5f48},
+      {0xdd50f1996b947518, 0xd12f124e28f7771a},
+      {0x8a5296ffe33cc92f, 0x82bd6b70d99aaa70},
+      {0xace73cbfdc0bfb7b, 0x636cc64d1001550c},
+      {0xd8210befd30efa5a, 0x3c47f7e05401aa4f},
+      {0x8714a775e3e95c78, 0x65acfaec34810a72},
+      {0xa8d9d1535ce3b396, 0x7f1839a741a14d0e},
+      {0xd31045a8341ca07c, 0x1ede48111209a051},
+      {0x83ea2b892091e44d, 0x934aed0aab460433},
+      {0xa4e4b66b68b65d60, 0xf81da84d56178540},
+      {0xce1de40642e3f4b9, 0x36251260ab9d668f},
+      {0x80d2ae83e9ce78f3, 0xc1d72b7c6b42601a},
+      {0xa1075a24e4421730, 0xb24cf65b8612f820},
+      {0xc94930ae1d529cfc, 0xdee033f26797b628},
+      {0xfb9b7cd9a4a7443c, 0x169840ef017da3b2},
+      {0x9d412e0806e88aa5, 0x8e1f289560ee864f},
+      {0xc491798a08a2ad4e, 0xf1a6f2bab92a27e3},
+      {0xf5b5d7ec8acb58a2, 0xae10af696774b1dc},
+      {0x9991a6f3d6bf1765, 0xacca6da1e0a8ef2a},
+      {0xbff610b0cc6edd3f, 0x17fd090a58d32af4},
+      {0xeff394dcff8a948e, 0xddfc4b4cef07f5b1},
+      {0x95f83d0a1fb69cd9, 0x4abdaf101564f98f},
+      {0xbb764c4ca7a4440f, 0x9d6d1ad41abe37f2},
+      {0xea53df5fd18d5513, 0x84c86189216dc5ee},
+      {0x92746b9be2f8552c, 0x32fd3cf5b4e49bb5},
+      {0xb7118682dbb66a77, 0x3fbc8c33221dc2a2},
+      {0xe4d5e82392a40515, 0x0fabaf3feaa5334b},
+      {0x8f05b1163ba6832d, 0x29cb4d87f2a7400f},
+      {0xb2c71d5bca9023f8, 0x743e20e9ef511013},
+      {0xdf78e4b2bd342cf6, 0x914da9246b255417},
+      {0x8bab8eefb6409c1a, 0x1ad089b6c2f7548f},
+      {0xae9672aba3d0c320, 0xa184ac2473b529b2},
+      {0xda3c0f568cc4f3e8, 0xc9e5d72d90a2741f},
+      {0x8865899617fb1871, 0x7e2fa67c7a658893},
+      {0xaa7eebfb9df9de8d, 0xddbb901b98feeab8},
+      {0xd51ea6fa85785631, 0x552a74227f3ea566},
+      {0x8533285c936b35de, 0xd53a88958f872760},
+      {0xa67ff273b8460356, 0x8a892abaf368f138},
+      {0xd01fef10a657842c, 0x2d2b7569b0432d86},
+      {0x8213f56a67f6b29b, 0x9c3b29620e29fc74},
+      {0xa298f2c501f45f42, 0x8349f3ba91b47b90},
+      {0xcb3f2f7642717713, 0x241c70a936219a74},
+      {0xfe0efb53d30dd4d7, 0xed238cd383aa0111},
+      {0x9ec95d1463e8a506, 0xf4363804324a40ab},
+      {0xc67bb4597ce2ce48, 0xb143c6053edcd0d6},
+      {0xf81aa16fdc1b81da, 0xdd94b7868e94050b},
+      {0x9b10a4e5e9913128, 0xca7cf2b4191c8327},
+      {0xc1d4ce1f63f57d72, 0xfd1c2f611f63a3f1},
+      {0xf24a01a73cf2dccf, 0xbc633b39673c8ced},
+      {0x976e41088617ca01, 0xd5be0503e085d814},
+      {0xbd49d14aa79dbc82, 0x4b2d8644d8a74e19},
+      {0xec9c459d51852ba2, 0xddf8e7d60ed1219f},
+      {0x93e1ab8252f33b45, 0xcabb90e5c942b504},
+      {0xb8da1662e7b00a17, 0x3d6a751f3b936244},
+      {0xe7109bfba19c0c9d, 0x0cc512670a783ad5},
+      {0x906a617d450187e2, 0x27fb2b80668b24c6},
+      {0xb484f9dc9641e9da, 0xb1f9f660802dedf7},
+      {0xe1a63853bbd26451, 0x5e7873f8a0396974},
+      {0x8d07e33455637eb2, 0xdb0b487b6423e1e9},
+      {0xb049dc016abc5e5f, 0x91ce1a9a3d2cda63},
+      {0xdc5c5301c56b75f7, 0x7641a140cc7810fc},
+      {0x89b9b3e11b6329ba, 0xa9e904c87fcb0a9e},
+      {0xac2820d9623bf429, 0x546345fa9fbdcd45},
+      {0xd732290fbacaf133, 0xa97c177947ad4096},
+      {0x867f59a9d4bed6c0, 0x49ed8eabcccc485e},
+      {0xa81f301449ee8c70, 0x5c68f256bfff5a75},
+      {0xd226fc195c6a2f8c, 0x73832eec6fff3112},
+      {0x83585d8fd9c25db7, 0xc831fd53c5ff7eac},
+      {0xa42e74f3d032f525, 0xba3e7ca8b77f5e56},
+      {0xcd3a1230c43fb26f, 0x28ce1bd2e55f35ec},
+      {0x80444b5e7aa7cf85, 0x7980d163cf5b81b4},
+      {0xa0555e361951c366, 0xd7e105bcc3326220},
+      {0xc86ab5c39fa63440, 0x8dd9472bf3fefaa8},
+      {0xfa856334878fc150, 0xb14f98f6f0feb952},
+      {0x9c935e00d4b9d8d2, 0x6ed1bf9a569f33d4},
+      {0xc3b8358109e84f07, 0x0a862f80ec4700c9},
+      {0xf4a642e14c6262c8, 0xcd27bb612758c0fb},
+      {0x98e7e9cccfbd7dbd, 0x8038d51cb897789d},
+      {0xbf21e44003acdd2c, 0xe0470a63e6bd56c4},
+      {0xeeea5d5004981478, 0x1858ccfce06cac75},
+      {0x95527a5202df0ccb, 0x0f37801e0c43ebc9},
+      {0xbaa718e68396cffd, 0xd30560258f54e6bb},
+      {0xe950df20247c83fd, 0x47c6b82ef32a206a},
+      {0x91d28b7416cdd27e, 0x4cdc331d57fa5442},
+      {0xb6472e511c81471d, 0xe0133fe4adf8e953},
+      {0xe3d8f9e563a198e5, 0x58180fddd97723a7},
+      {0x8e679c2f5e44ff8f, 0x570f09eaa7ea7649},
+      {0xb201833b35d63f73, 0x2cd2cc6551e513db},
+      {0xde81e40a034bcf4f, 0xf8077f7ea65e58d2},
+      {0x8b112e86420f6191, 0xfb04afaf27faf783},
+      {0xadd57a27d29339f6, 0x79c5db9af1f9b564},
+      {0xd94ad8b1c7380874, 0x18375281ae7822bd},
+      {0x87cec76f1c830548, 0x8f2293910d0b15b6},
+      {0xa9c2794ae3a3c69a, 0xb2eb3875504ddb23},
+      {0xd433179d9c8cb841, 0x5fa60692a46151ec},
+      {0x849feec281d7f328, 0xdbc7c41ba6bcd334},
+      {0xa5c7ea73224deff3, 0x12b9b522906c0801},
+      {0xcf39e50feae16bef, 0xd768226b34870a01},
+      {0x81842f29f2cce375, 0xe6a1158300d46641},
+      {0xa1e53af46f801c53, 0x60495ae3c1097fd1},
+      {0xca5e89b18b602368, 0x385bb19cb14bdfc5},
+      {0xfcf62c1dee382c42, 0x46729e03dd9ed7b6},
+      {0x9e19db92b4e31ba9, 0x6c07a2c26a8346d2},
+      {0xc5a05277621be293, 0xc7098b7305241886},
+      { 0xf70867153aa2db38,
+        0xb8cbee4fc66d1ea8 }
+#else
+      {0xff77b1fcbebcdc4f, 0x25e8e89c13bb0f7b},
+      {0xce5d73ff402d98e3, 0xfb0a3d212dc81290},
+      {0xa6b34ad8c9dfc06f, 0xf42faa48c0ea481f},
+      {0x86a8d39ef77164bc, 0xae5dff9c02033198},
+      {0xd98ddaee19068c76, 0x3badd624dd9b0958},
+      {0xafbd2350644eeacf, 0xe5d1929ef90898fb},
+      {0x8df5efabc5979c8f, 0xca8d3ffa1ef463c2},
+      {0xe55990879ddcaabd, 0xcc420a6a101d0516},
+      {0xb94470938fa89bce, 0xf808e40e8d5b3e6a},
+      {0x95a8637627989aad, 0xdde7001379a44aa9},
+      {0xf1c90080baf72cb1, 0x5324c68b12dd6339},
+      {0xc350000000000000, 0x0000000000000000},
+      {0x9dc5ada82b70b59d, 0xf020000000000000},
+      {0xfee50b7025c36a08, 0x02f236d04753d5b5},
+      {0xcde6fd5e09abcf26, 0xed4c0226b55e6f87},
+      {0xa6539930bf6bff45, 0x84db8346b786151d},
+      {0x865b86925b9bc5c2, 0x0b8a2392ba45a9b3},
+      {0xd910f7ff28069da4, 0x1b2ba1518094da05},
+      {0xaf58416654a6babb, 0x387ac8d1970027b3},
+      {0x8da471a9de737e24, 0x5ceaecfed289e5d3},
+      {0xe4d5e82392a40515, 0x0fabaf3feaa5334b},
+      {0xb8da1662e7b00a17, 0x3d6a751f3b936244},
+      { 0x95527a5202df0ccb,
+        0x0f37801e0c43ebc9 }
+#endif
+    };
+
+#if FMT_USE_FULL_CACHE_DRAGONBOX
+    return pow10_significands[k - float_info<double>::min_k];
+#else
+    static constexpr const uint64_t powers_of_5_64[] = {
+        0x0000000000000001, 0x0000000000000005, 0x0000000000000019,
+        0x000000000000007d, 0x0000000000000271, 0x0000000000000c35,
+        0x0000000000003d09, 0x000000000001312d, 0x000000000005f5e1,
+        0x00000000001dcd65, 0x00000000009502f9, 0x0000000002e90edd,
+        0x000000000e8d4a51, 0x0000000048c27395, 0x000000016bcc41e9,
+        0x000000071afd498d, 0x0000002386f26fc1, 0x000000b1a2bc2ec5,
+        0x000003782dace9d9, 0x00001158e460913d, 0x000056bc75e2d631,
+        0x0001b1ae4d6e2ef5, 0x000878678326eac9, 0x002a5a058fc295ed,
+        0x00d3c21bcecceda1, 0x0422ca8b0a00a425, 0x14adf4b7320334b9};
+
+    static const int compression_ratio = 27;
+
+    // Compute base index.
+    int cache_index = (k - float_info<double>::min_k) / compression_ratio;
+    int kb = cache_index * compression_ratio + float_info<double>::min_k;
+    int offset = k - kb;
+
+    // Get base cache.
+    uint128_fallback base_cache = pow10_significands[cache_index];
+    if (offset == 0) return base_cache;
+
+    // Compute the required amount of bit-shift.
+    int alpha = floor_log2_pow10(kb + offset) - floor_log2_pow10(kb) - offset;
+    FMT_ASSERT(alpha > 0 && alpha < 64, "shifting error detected");
+
+    // Try to recover the real cache.
+    uint64_t pow5 = powers_of_5_64[offset];
+    uint128_fallback recovered_cache = umul128(base_cache.high(), pow5);
+    uint128_fallback middle_low = umul128(base_cache.low(), pow5);
+
+    recovered_cache += middle_low.high();
+
+    uint64_t high_to_middle = recovered_cache.high() << (64 - alpha);
+    uint64_t middle_to_low = recovered_cache.low() << (64 - alpha);
+
+    recovered_cache =
+        uint128_fallback{(recovered_cache.low() >> alpha) | high_to_middle,
+                         ((middle_low.low() >> alpha) | middle_to_low)};
+    FMT_ASSERT(recovered_cache.low() + 1 != 0, "");
+    return {recovered_cache.high(), recovered_cache.low() + 1};
+#endif
+  }
+
+  struct compute_mul_result {
+    carrier_uint result;
+    bool is_integer;
+  };
+  struct compute_mul_parity_result {
+    bool parity;
+    bool is_integer;
+  };
+
+  static compute_mul_result compute_mul(
+      carrier_uint u, const cache_entry_type& cache) noexcept {
+    auto r = umul192_upper128(u, cache);
+    return {r.high(), r.low() == 0};
+  }
+
+  static uint32_t compute_delta(cache_entry_type const& cache,
+                                int beta) noexcept {
+    return static_cast<uint32_t>(cache.high() >> (64 - 1 - beta));
+  }
+
+  static compute_mul_parity_result compute_mul_parity(
+      carrier_uint two_f, const cache_entry_type& cache, int beta) noexcept {
+    FMT_ASSERT(beta >= 1, "");
+    FMT_ASSERT(beta < 64, "");
+
+    auto r = umul192_lower128(two_f, cache);
+    return {((r.high() >> (64 - beta)) & 1) != 0,
+            ((r.high() << beta) | (r.low() >> (64 - beta))) == 0};
+  }
+
+  static carrier_uint compute_left_endpoint_for_shorter_interval_case(
+      const cache_entry_type& cache, int beta) noexcept {
+    return (cache.high() -
+            (cache.high() >> (num_significand_bits<double>() + 2))) >>
+           (64 - num_significand_bits<double>() - 1 - beta);
+  }
+
+  static carrier_uint compute_right_endpoint_for_shorter_interval_case(
+      const cache_entry_type& cache, int beta) noexcept {
+    return (cache.high() +
+            (cache.high() >> (num_significand_bits<double>() + 1))) >>
+           (64 - num_significand_bits<double>() - 1 - beta);
+  }
+
+  static carrier_uint compute_round_up_for_shorter_interval_case(
+      const cache_entry_type& cache, int beta) noexcept {
+    return ((cache.high() >> (64 - num_significand_bits<double>() - 2 - beta)) +
+            1) /
+           2;
+  }
+};
+
+// Various integer checks
+template <class T>
+bool is_left_endpoint_integer_shorter_interval(int exponent) noexcept {
+  const int case_shorter_interval_left_endpoint_lower_threshold = 2;
+  const int case_shorter_interval_left_endpoint_upper_threshold = 3;
+  return exponent >= case_shorter_interval_left_endpoint_lower_threshold &&
+         exponent <= case_shorter_interval_left_endpoint_upper_threshold;
+}
+
+// Remove trailing zeros from n and return the number of zeros removed (float)
+FMT_INLINE int remove_trailing_zeros(uint32_t& n) noexcept {
+  FMT_ASSERT(n != 0, "");
+  const uint32_t mod_inv_5 = 0xcccccccd;
+  const uint32_t mod_inv_25 = mod_inv_5 * mod_inv_5;
+
+  int s = 0;
+  while (true) {
+    auto q = rotr(n * mod_inv_25, 2);
+    if (q > max_value<uint32_t>() / 100) break;
+    n = q;
+    s += 2;
+  }
+  auto q = rotr(n * mod_inv_5, 1);
+  if (q <= max_value<uint32_t>() / 10) {
+    n = q;
+    s |= 1;
+  }
+
+  return s;
+}
+
+// Removes trailing zeros and returns the number of zeros removed (double)
+FMT_INLINE int remove_trailing_zeros(uint64_t& n) noexcept {
+  FMT_ASSERT(n != 0, "");
+
+  // This magic number is ceil(2^90 / 10^8).
+  constexpr uint64_t magic_number = 12379400392853802749ull;
+  auto nm = umul128(n, magic_number);
+
+  // Is n is divisible by 10^8?
+  if ((nm.high() & ((1ull << (90 - 64)) - 1)) == 0 && nm.low() < magic_number) {
+    // If yes, work with the quotient.
+    auto n32 = static_cast<uint32_t>(nm.high() >> (90 - 64));
+
+    const uint32_t mod_inv_5 = 0xcccccccd;
+    const uint32_t mod_inv_25 = mod_inv_5 * mod_inv_5;
+
+    int s = 8;
+    while (true) {
+      auto q = rotr(n32 * mod_inv_25, 2);
+      if (q > max_value<uint32_t>() / 100) break;
+      n32 = q;
+      s += 2;
+    }
+    auto q = rotr(n32 * mod_inv_5, 1);
+    if (q <= max_value<uint32_t>() / 10) {
+      n32 = q;
+      s |= 1;
+    }
+
+    n = n32;
+    return s;
+  }
+
+  // If n is not divisible by 10^8, work with n itself.
+  const uint64_t mod_inv_5 = 0xcccccccccccccccd;
+  const uint64_t mod_inv_25 = mod_inv_5 * mod_inv_5;
+
+  int s = 0;
+  while (true) {
+    auto q = rotr(n * mod_inv_25, 2);
+    if (q > max_value<uint64_t>() / 100) break;
+    n = q;
+    s += 2;
+  }
+  auto q = rotr(n * mod_inv_5, 1);
+  if (q <= max_value<uint64_t>() / 10) {
+    n = q;
+    s |= 1;
+  }
+
+  return s;
+}
+
+// The main algorithm for shorter interval case
+template <class T>
+FMT_INLINE decimal_fp<T> shorter_interval_case(int exponent) noexcept {
+  decimal_fp<T> ret_value;
+  // Compute k and beta
+  const int minus_k = floor_log10_pow2_minus_log10_4_over_3(exponent);
+  const int beta = exponent + floor_log2_pow10(-minus_k);
+
+  // Compute xi and zi
+  using cache_entry_type = typename cache_accessor<T>::cache_entry_type;
+  const cache_entry_type cache = cache_accessor<T>::get_cached_power(-minus_k);
+
+  auto xi = cache_accessor<T>::compute_left_endpoint_for_shorter_interval_case(
+      cache, beta);
+  auto zi = cache_accessor<T>::compute_right_endpoint_for_shorter_interval_case(
+      cache, beta);
+
+  // If the left endpoint is not an integer, increase it
+  if (!is_left_endpoint_integer_shorter_interval<T>(exponent)) ++xi;
+
+  // Try bigger divisor
+  ret_value.significand = zi / 10;
+
+  // If succeed, remove trailing zeros if necessary and return
+  if (ret_value.significand * 10 >= xi) {
+    ret_value.exponent = minus_k + 1;
+    ret_value.exponent += remove_trailing_zeros(ret_value.significand);
+    return ret_value;
+  }
+
+  // Otherwise, compute the round-up of y
+  ret_value.significand =
+      cache_accessor<T>::compute_round_up_for_shorter_interval_case(cache,
+                                                                    beta);
+  ret_value.exponent = minus_k;
+
+  // When tie occurs, choose one of them according to the rule
+  if (exponent >= float_info<T>::shorter_interval_tie_lower_threshold &&
+      exponent <= float_info<T>::shorter_interval_tie_upper_threshold) {
+    ret_value.significand = ret_value.significand % 2 == 0
+                                ? ret_value.significand
+                                : ret_value.significand - 1;
+  } else if (ret_value.significand < xi) {
+    ++ret_value.significand;
+  }
+  return ret_value;
+}
+
+template <typename T> decimal_fp<T> to_decimal(T x) noexcept {
+  // Step 1: integer promotion & Schubfach multiplier calculation.
+
+  using carrier_uint = typename float_info<T>::carrier_uint;
+  using cache_entry_type = typename cache_accessor<T>::cache_entry_type;
+  auto br = bit_cast<carrier_uint>(x);
+
+  // Extract significand bits and exponent bits.
+  const carrier_uint significand_mask =
+      (static_cast<carrier_uint>(1) << num_significand_bits<T>()) - 1;
+  carrier_uint significand = (br & significand_mask);
+  int exponent =
+      static_cast<int>((br & exponent_mask<T>()) >> num_significand_bits<T>());
+
+  if (exponent != 0) {  // Check if normal.
+    exponent -= exponent_bias<T>() + num_significand_bits<T>();
+
+    // Shorter interval case; proceed like Schubfach.
+    // In fact, when exponent == 1 and significand == 0, the interval is
+    // regular. However, it can be shown that the end-results are anyway same.
+    if (significand == 0) return shorter_interval_case<T>(exponent);
+
+    significand |= (static_cast<carrier_uint>(1) << num_significand_bits<T>());
+  } else {
+    // Subnormal case; the interval is always regular.
+    if (significand == 0) return {0, 0};
+    exponent =
+        std::numeric_limits<T>::min_exponent - num_significand_bits<T>() - 1;
+  }
+
+  const bool include_left_endpoint = (significand % 2 == 0);
+  const bool include_right_endpoint = include_left_endpoint;
+
+  // Compute k and beta.
+  const int minus_k = floor_log10_pow2(exponent) - float_info<T>::kappa;
+  const cache_entry_type cache = cache_accessor<T>::get_cached_power(-minus_k);
+  const int beta = exponent + floor_log2_pow10(-minus_k);
+
+  // Compute zi and deltai.
+  // 10^kappa <= deltai < 10^(kappa + 1)
+  const uint32_t deltai = cache_accessor<T>::compute_delta(cache, beta);
+  const carrier_uint two_fc = significand << 1;
+
+  // For the case of binary32, the result of integer check is not correct for
+  // 29711844 * 2^-82
+  // = 6.1442653300000000008655037797566933477355632930994033813476... * 10^-18
+  // and 29711844 * 2^-81
+  // = 1.2288530660000000001731007559513386695471126586198806762695... * 10^-17,
+  // and they are the unique counterexamples. However, since 29711844 is even,
+  // this does not cause any problem for the endpoints calculations; it can only
+  // cause a problem when we need to perform integer check for the center.
+  // Fortunately, with these inputs, that branch is never executed, so we are
+  // fine.
+  const typename cache_accessor<T>::compute_mul_result z_mul =
+      cache_accessor<T>::compute_mul((two_fc | 1) << beta, cache);
+
+  // Step 2: Try larger divisor; remove trailing zeros if necessary.
+
+  // Using an upper bound on zi, we might be able to optimize the division
+  // better than the compiler; we are computing zi / big_divisor here.
+  decimal_fp<T> ret_value;
+  ret_value.significand = divide_by_10_to_kappa_plus_1(z_mul.result);
+  uint32_t r = static_cast<uint32_t>(z_mul.result - float_info<T>::big_divisor *
+                                                        ret_value.significand);
+
+  if (r < deltai) {
+    // Exclude the right endpoint if necessary.
+    if (r == 0 && (z_mul.is_integer & !include_right_endpoint)) {
+      --ret_value.significand;
+      r = float_info<T>::big_divisor;
+      goto small_divisor_case_label;
+    }
+  } else if (r > deltai) {
+    goto small_divisor_case_label;
+  } else {
+    // r == deltai; compare fractional parts.
+    const typename cache_accessor<T>::compute_mul_parity_result x_mul =
+        cache_accessor<T>::compute_mul_parity(two_fc - 1, cache, beta);
+
+    if (!(x_mul.parity | (x_mul.is_integer & include_left_endpoint)))
+      goto small_divisor_case_label;
+  }
+  ret_value.exponent = minus_k + float_info<T>::kappa + 1;
+
+  // We may need to remove trailing zeros.
+  ret_value.exponent += remove_trailing_zeros(ret_value.significand);
+  return ret_value;
+
+  // Step 3: Find the significand with the smaller divisor.
+
+small_divisor_case_label:
+  ret_value.significand *= 10;
+  ret_value.exponent = minus_k + float_info<T>::kappa;
+
+  uint32_t dist = r - (deltai / 2) + (float_info<T>::small_divisor / 2);
+  const bool approx_y_parity =
+      ((dist ^ (float_info<T>::small_divisor / 2)) & 1) != 0;
+
+  // Is dist divisible by 10^kappa?
+  const bool divisible_by_small_divisor =
+      check_divisibility_and_divide_by_pow10<float_info<T>::kappa>(dist);
+
+  // Add dist / 10^kappa to the significand.
+  ret_value.significand += dist;
+
+  if (!divisible_by_small_divisor) return ret_value;
+
+  // Check z^(f) >= epsilon^(f).
+  // We have either yi == zi - epsiloni or yi == (zi - epsiloni) - 1,
+  // where yi == zi - epsiloni if and only if z^(f) >= epsilon^(f).
+  // Since there are only 2 possibilities, we only need to care about the
+  // parity. Also, zi and r should have the same parity since the divisor
+  // is an even number.
+  const auto y_mul = cache_accessor<T>::compute_mul_parity(two_fc, cache, beta);
+
+  // If z^(f) >= epsilon^(f), we might have a tie when z^(f) == epsilon^(f),
+  // or equivalently, when y is an integer.
+  if (y_mul.parity != approx_y_parity)
+    --ret_value.significand;
+  else if (y_mul.is_integer & (ret_value.significand % 2 != 0))
+    --ret_value.significand;
+  return ret_value;
+}
+}  // namespace dragonbox
+
+#ifdef _MSC_VER
+FMT_FUNC auto fmt_snprintf(char* buf, size_t size, const char* fmt, ...)
+    -> int {
+  auto args = va_list();
+  va_start(args, fmt);
+  int result = vsnprintf_s(buf, size, _TRUNCATE, fmt, args);
+  va_end(args);
+  return result;
+}
+#endif
+}  // namespace detail
+
+template <> struct formatter<detail::bigint> {
+  FMT_CONSTEXPR auto parse(format_parse_context& ctx)
+      -> format_parse_context::iterator {
+    return ctx.begin();
+  }
+
+  template <typename FormatContext>
+  auto format(const detail::bigint& n, FormatContext& ctx) const ->
+      typename FormatContext::iterator {
+    auto out = ctx.out();
+    bool first = true;
+    for (auto i = n.bigits_.size(); i > 0; --i) {
+      auto value = n.bigits_[i - 1u];
+      if (first) {
+        out = format_to(out, FMT_STRING("{:x}"), value);
+        first = false;
+        continue;
+      }
+      out = format_to(out, FMT_STRING("{:08x}"), value);
+    }
+    if (n.exp_ > 0)
+      out = format_to(out, FMT_STRING("p{}"),
+                      n.exp_ * detail::bigint::bigit_bits);
+    return out;
+  }
+};
+
+FMT_FUNC detail::utf8_to_utf16::utf8_to_utf16(string_view s) {
+  for_each_codepoint(s, [this](uint32_t cp, string_view) {
+    if (cp == invalid_code_point) FMT_THROW(std::runtime_error("invalid utf8"));
+    if (cp <= 0xFFFF) {
+      buffer_.push_back(static_cast<wchar_t>(cp));
+    } else {
+      cp -= 0x10000;
+      buffer_.push_back(static_cast<wchar_t>(0xD800 + (cp >> 10)));
+      buffer_.push_back(static_cast<wchar_t>(0xDC00 + (cp & 0x3FF)));
+    }
+    return true;
+  });
+  buffer_.push_back(0);
+}
+
+FMT_FUNC void format_system_error(detail::buffer<char>& out, int error_code,
+                                  const char* message) noexcept {
+  FMT_TRY {
+    auto ec = std::error_code(error_code, std::generic_category());
+    write(std::back_inserter(out), std::system_error(ec, message).what());
+    return;
+  }
+  FMT_CATCH(...) {}
+  format_error_code(out, error_code, message);
+}
+
+FMT_FUNC void report_system_error(int error_code,
+                                  const char* message) noexcept {
+  report_error(format_system_error, error_code, message);
+}
+
+FMT_FUNC std::string vformat(string_view fmt, format_args args) {
+  // Don't optimize the "{}" case to keep the binary size small and because it
+  // can be better optimized in fmt::format anyway.
+  auto buffer = memory_buffer();
+  detail::vformat_to(buffer, fmt, args);
+  return to_string(buffer);
+}
+
+namespace detail {
+#ifdef _WIN32
+using dword = conditional_t<sizeof(long) == 4, unsigned long, unsigned>;
+extern "C" __declspec(dllimport) int __stdcall WriteConsoleW(  //
+    void*, const void*, dword, dword*, void*);
+
+FMT_FUNC bool write_console(std::FILE* f, string_view text) {
+  auto fd = _fileno(f);
+  if (_isatty(fd)) {
+    detail::utf8_to_utf16 u16(string_view(text.data(), text.size()));
+    auto written = detail::dword();
+    if (detail::WriteConsoleW(reinterpret_cast<void*>(_get_osfhandle(fd)),
+                              u16.c_str(), static_cast<uint32_t>(u16.size()),
+                              &written, nullptr)) {
+      return true;
+    }
+  }
+  // We return false if the file descriptor was not TTY, or it was but
+  // SetConsoleW failed which can happen if the output has been redirected to
+  // NUL. In both cases when we return false, we should attempt to do regular
+  // write via fwrite or std::ostream::write.
+  return false;
+}
+#endif
+
+FMT_FUNC void print(std::FILE* f, string_view text) {
+#ifdef _WIN32
+  if (write_console(f, text)) return;
+#endif
+  detail::fwrite_fully(text.data(), 1, text.size(), f);
+}
+}  // namespace detail
+
+FMT_FUNC void vprint(std::FILE* f, string_view format_str, format_args args) {
+  memory_buffer buffer;
+  detail::vformat_to(buffer, format_str, args);
+  detail::print(f, {buffer.data(), buffer.size()});
+}
+
+#ifdef _WIN32
+// Print assuming legacy (non-Unicode) encoding.
+FMT_FUNC void detail::vprint_mojibake(std::FILE* f, string_view format_str,
+                                      format_args args) {
+  memory_buffer buffer;
+  detail::vformat_to(buffer, format_str,
+                     basic_format_args<buffer_context<char>>(args));
+  fwrite_fully(buffer.data(), 1, buffer.size(), f);
+}
+#endif
+
+FMT_FUNC void vprint(string_view format_str, format_args args) {
+  vprint(stdout, format_str, args);
+}
+
+namespace detail {
+
+struct singleton {
+  unsigned char upper;
+  unsigned char lower_count;
+};
+
+inline auto is_printable(uint16_t x, const singleton* singletons,
+                         size_t singletons_size,
+                         const unsigned char* singleton_lowers,
+                         const unsigned char* normal, size_t normal_size)
+    -> bool {
+  auto upper = x >> 8;
+  auto lower_start = 0;
+  for (size_t i = 0; i < singletons_size; ++i) {
+    auto s = singletons[i];
+    auto lower_end = lower_start + s.lower_count;
+    if (upper < s.upper) break;
+    if (upper == s.upper) {
+      for (auto j = lower_start; j < lower_end; ++j) {
+        if (singleton_lowers[j] == (x & 0xff)) return false;
+      }
+    }
+    lower_start = lower_end;
+  }
+
+  auto xsigned = static_cast<int>(x);
+  auto current = true;
+  for (size_t i = 0; i < normal_size; ++i) {
+    auto v = static_cast<int>(normal[i]);
+    auto len = (v & 0x80) != 0 ? (v & 0x7f) << 8 | normal[++i] : v;
+    xsigned -= len;
+    if (xsigned < 0) break;
+    current = !current;
+  }
+  return current;
+}
+
+// This code is generated by support/printable.py.
+FMT_FUNC auto is_printable(uint32_t cp) -> bool {
+  static constexpr singleton singletons0[] = {
+      {0x00, 1},  {0x03, 5},  {0x05, 6},  {0x06, 3},  {0x07, 6},  {0x08, 8},
+      {0x09, 17}, {0x0a, 28}, {0x0b, 25}, {0x0c, 20}, {0x0d, 16}, {0x0e, 13},
+      {0x0f, 4},  {0x10, 3},  {0x12, 18}, {0x13, 9},  {0x16, 1},  {0x17, 5},
+      {0x18, 2},  {0x19, 3},  {0x1a, 7},  {0x1c, 2},  {0x1d, 1},  {0x1f, 22},
+      {0x20, 3},  {0x2b, 3},  {0x2c, 2},  {0x2d, 11}, {0x2e, 1},  {0x30, 3},
+      {0x31, 2},  {0x32, 1},  {0xa7, 2},  {0xa9, 2},  {0xaa, 4},  {0xab, 8},
+      {0xfa, 2},  {0xfb, 5},  {0xfd, 4},  {0xfe, 3},  {0xff, 9},
+  };
+  static constexpr unsigned char singletons0_lower[] = {
+      0xad, 0x78, 0x79, 0x8b, 0x8d, 0xa2, 0x30, 0x57, 0x58, 0x8b, 0x8c, 0x90,
+      0x1c, 0x1d, 0xdd, 0x0e, 0x0f, 0x4b, 0x4c, 0xfb, 0xfc, 0x2e, 0x2f, 0x3f,
+      0x5c, 0x5d, 0x5f, 0xb5, 0xe2, 0x84, 0x8d, 0x8e, 0x91, 0x92, 0xa9, 0xb1,
+      0xba, 0xbb, 0xc5, 0xc6, 0xc9, 0xca, 0xde, 0xe4, 0xe5, 0xff, 0x00, 0x04,
+      0x11, 0x12, 0x29, 0x31, 0x34, 0x37, 0x3a, 0x3b, 0x3d, 0x49, 0x4a, 0x5d,
+      0x84, 0x8e, 0x92, 0xa9, 0xb1, 0xb4, 0xba, 0xbb, 0xc6, 0xca, 0xce, 0xcf,
+      0xe4, 0xe5, 0x00, 0x04, 0x0d, 0x0e, 0x11, 0x12, 0x29, 0x31, 0x34, 0x3a,
+      0x3b, 0x45, 0x46, 0x49, 0x4a, 0x5e, 0x64, 0x65, 0x84, 0x91, 0x9b, 0x9d,
+      0xc9, 0xce, 0xcf, 0x0d, 0x11, 0x29, 0x45, 0x49, 0x57, 0x64, 0x65, 0x8d,
+      0x91, 0xa9, 0xb4, 0xba, 0xbb, 0xc5, 0xc9, 0xdf, 0xe4, 0xe5, 0xf0, 0x0d,
+      0x11, 0x45, 0x49, 0x64, 0x65, 0x80, 0x84, 0xb2, 0xbc, 0xbe, 0xbf, 0xd5,
+      0xd7, 0xf0, 0xf1, 0x83, 0x85, 0x8b, 0xa4, 0xa6, 0xbe, 0xbf, 0xc5, 0xc7,
+      0xce, 0xcf, 0xda, 0xdb, 0x48, 0x98, 0xbd, 0xcd, 0xc6, 0xce, 0xcf, 0x49,
+      0x4e, 0x4f, 0x57, 0x59, 0x5e, 0x5f, 0x89, 0x8e, 0x8f, 0xb1, 0xb6, 0xb7,
+      0xbf, 0xc1, 0xc6, 0xc7, 0xd7, 0x11, 0x16, 0x17, 0x5b, 0x5c, 0xf6, 0xf7,
+      0xfe, 0xff, 0x80, 0x0d, 0x6d, 0x71, 0xde, 0xdf, 0x0e, 0x0f, 0x1f, 0x6e,
+      0x6f, 0x1c, 0x1d, 0x5f, 0x7d, 0x7e, 0xae, 0xaf, 0xbb, 0xbc, 0xfa, 0x16,
+      0x17, 0x1e, 0x1f, 0x46, 0x47, 0x4e, 0x4f, 0x58, 0x5a, 0x5c, 0x5e, 0x7e,
+      0x7f, 0xb5, 0xc5, 0xd4, 0xd5, 0xdc, 0xf0, 0xf1, 0xf5, 0x72, 0x73, 0x8f,
+      0x74, 0x75, 0x96, 0x2f, 0x5f, 0x26, 0x2e, 0x2f, 0xa7, 0xaf, 0xb7, 0xbf,
+      0xc7, 0xcf, 0xd7, 0xdf, 0x9a, 0x40, 0x97, 0x98, 0x30, 0x8f, 0x1f, 0xc0,
+      0xc1, 0xce, 0xff, 0x4e, 0x4f, 0x5a, 0x5b, 0x07, 0x08, 0x0f, 0x10, 0x27,
+      0x2f, 0xee, 0xef, 0x6e, 0x6f, 0x37, 0x3d, 0x3f, 0x42, 0x45, 0x90, 0x91,
+      0xfe, 0xff, 0x53, 0x67, 0x75, 0xc8, 0xc9, 0xd0, 0xd1, 0xd8, 0xd9, 0xe7,
+      0xfe, 0xff,
+  };
+  static constexpr singleton singletons1[] = {
+      {0x00, 6},  {0x01, 1}, {0x03, 1},  {0x04, 2}, {0x08, 8},  {0x09, 2},
+      {0x0a, 5},  {0x0b, 2}, {0x0e, 4},  {0x10, 1}, {0x11, 2},  {0x12, 5},
+      {0x13, 17}, {0x14, 1}, {0x15, 2},  {0x17, 2}, {0x19, 13}, {0x1c, 5},
+      {0x1d, 8},  {0x24, 1}, {0x6a, 3},  {0x6b, 2}, {0xbc, 2},  {0xd1, 2},
+      {0xd4, 12}, {0xd5, 9}, {0xd6, 2},  {0xd7, 2}, {0xda, 1},  {0xe0, 5},
+      {0xe1, 2},  {0xe8, 2}, {0xee, 32}, {0xf0, 4}, {0xf8, 2},  {0xf9, 2},
+      {0xfa, 2},  {0xfb, 1},
+  };
+  static constexpr unsigned char singletons1_lower[] = {
+      0x0c, 0x27, 0x3b, 0x3e, 0x4e, 0x4f, 0x8f, 0x9e, 0x9e, 0x9f, 0x06, 0x07,
+      0x09, 0x36, 0x3d, 0x3e, 0x56, 0xf3, 0xd0, 0xd1, 0x04, 0x14, 0x18, 0x36,
+      0x37, 0x56, 0x57, 0x7f, 0xaa, 0xae, 0xaf, 0xbd, 0x35, 0xe0, 0x12, 0x87,
+      0x89, 0x8e, 0x9e, 0x04, 0x0d, 0x0e, 0x11, 0x12, 0x29, 0x31, 0x34, 0x3a,
+      0x45, 0x46, 0x49, 0x4a, 0x4e, 0x4f, 0x64, 0x65, 0x5c, 0xb6, 0xb7, 0x1b,
+      0x1c, 0x07, 0x08, 0x0a, 0x0b, 0x14, 0x17, 0x36, 0x39, 0x3a, 0xa8, 0xa9,
+      0xd8, 0xd9, 0x09, 0x37, 0x90, 0x91, 0xa8, 0x07, 0x0a, 0x3b, 0x3e, 0x66,
+      0x69, 0x8f, 0x92, 0x6f, 0x5f, 0xee, 0xef, 0x5a, 0x62, 0x9a, 0x9b, 0x27,
+      0x28, 0x55, 0x9d, 0xa0, 0xa1, 0xa3, 0xa4, 0xa7, 0xa8, 0xad, 0xba, 0xbc,
+      0xc4, 0x06, 0x0b, 0x0c, 0x15, 0x1d, 0x3a, 0x3f, 0x45, 0x51, 0xa6, 0xa7,
+      0xcc, 0xcd, 0xa0, 0x07, 0x19, 0x1a, 0x22, 0x25, 0x3e, 0x3f, 0xc5, 0xc6,
+      0x04, 0x20, 0x23, 0x25, 0x26, 0x28, 0x33, 0x38, 0x3a, 0x48, 0x4a, 0x4c,
+      0x50, 0x53, 0x55, 0x56, 0x58, 0x5a, 0x5c, 0x5e, 0x60, 0x63, 0x65, 0x66,
+      0x6b, 0x73, 0x78, 0x7d, 0x7f, 0x8a, 0xa4, 0xaa, 0xaf, 0xb0, 0xc0, 0xd0,
+      0xae, 0xaf, 0x79, 0xcc, 0x6e, 0x6f, 0x93,
+  };
+  static constexpr unsigned char normal0[] = {
+      0x00, 0x20, 0x5f, 0x22, 0x82, 0xdf, 0x04, 0x82, 0x44, 0x08, 0x1b, 0x04,
+      0x06, 0x11, 0x81, 0xac, 0x0e, 0x80, 0xab, 0x35, 0x28, 0x0b, 0x80, 0xe0,
+      0x03, 0x19, 0x08, 0x01, 0x04, 0x2f, 0x04, 0x34, 0x04, 0x07, 0x03, 0x01,
+      0x07, 0x06, 0x07, 0x11, 0x0a, 0x50, 0x0f, 0x12, 0x07, 0x55, 0x07, 0x03,
+      0x04, 0x1c, 0x0a, 0x09, 0x03, 0x08, 0x03, 0x07, 0x03, 0x02, 0x03, 0x03,
+      0x03, 0x0c, 0x04, 0x05, 0x03, 0x0b, 0x06, 0x01, 0x0e, 0x15, 0x05, 0x3a,
+      0x03, 0x11, 0x07, 0x06, 0x05, 0x10, 0x07, 0x57, 0x07, 0x02, 0x07, 0x15,
+      0x0d, 0x50, 0x04, 0x43, 0x03, 0x2d, 0x03, 0x01, 0x04, 0x11, 0x06, 0x0f,
+      0x0c, 0x3a, 0x04, 0x1d, 0x25, 0x5f, 0x20, 0x6d, 0x04, 0x6a, 0x25, 0x80,
+      0xc8, 0x05, 0x82, 0xb0, 0x03, 0x1a, 0x06, 0x82, 0xfd, 0x03, 0x59, 0x07,
+      0x15, 0x0b, 0x17, 0x09, 0x14, 0x0c, 0x14, 0x0c, 0x6a, 0x06, 0x0a, 0x06,
+      0x1a, 0x06, 0x59, 0x07, 0x2b, 0x05, 0x46, 0x0a, 0x2c, 0x04, 0x0c, 0x04,
+      0x01, 0x03, 0x31, 0x0b, 0x2c, 0x04, 0x1a, 0x06, 0x0b, 0x03, 0x80, 0xac,
+      0x06, 0x0a, 0x06, 0x21, 0x3f, 0x4c, 0x04, 0x2d, 0x03, 0x74, 0x08, 0x3c,
+      0x03, 0x0f, 0x03, 0x3c, 0x07, 0x38, 0x08, 0x2b, 0x05, 0x82, 0xff, 0x11,
+      0x18, 0x08, 0x2f, 0x11, 0x2d, 0x03, 0x20, 0x10, 0x21, 0x0f, 0x80, 0x8c,
+      0x04, 0x82, 0x97, 0x19, 0x0b, 0x15, 0x88, 0x94, 0x05, 0x2f, 0x05, 0x3b,
+      0x07, 0x02, 0x0e, 0x18, 0x09, 0x80, 0xb3, 0x2d, 0x74, 0x0c, 0x80, 0xd6,
+      0x1a, 0x0c, 0x05, 0x80, 0xff, 0x05, 0x80, 0xdf, 0x0c, 0xee, 0x0d, 0x03,
+      0x84, 0x8d, 0x03, 0x37, 0x09, 0x81, 0x5c, 0x14, 0x80, 0xb8, 0x08, 0x80,
+      0xcb, 0x2a, 0x38, 0x03, 0x0a, 0x06, 0x38, 0x08, 0x46, 0x08, 0x0c, 0x06,
+      0x74, 0x0b, 0x1e, 0x03, 0x5a, 0x04, 0x59, 0x09, 0x80, 0x83, 0x18, 0x1c,
+      0x0a, 0x16, 0x09, 0x4c, 0x04, 0x80, 0x8a, 0x06, 0xab, 0xa4, 0x0c, 0x17,
+      0x04, 0x31, 0xa1, 0x04, 0x81, 0xda, 0x26, 0x07, 0x0c, 0x05, 0x05, 0x80,
+      0xa5, 0x11, 0x81, 0x6d, 0x10, 0x78, 0x28, 0x2a, 0x06, 0x4c, 0x04, 0x80,
+      0x8d, 0x04, 0x80, 0xbe, 0x03, 0x1b, 0x03, 0x0f, 0x0d,
+  };
+  static constexpr unsigned char normal1[] = {
+      0x5e, 0x22, 0x7b, 0x05, 0x03, 0x04, 0x2d, 0x03, 0x66, 0x03, 0x01, 0x2f,
+      0x2e, 0x80, 0x82, 0x1d, 0x03, 0x31, 0x0f, 0x1c, 0x04, 0x24, 0x09, 0x1e,
+      0x05, 0x2b, 0x05, 0x44, 0x04, 0x0e, 0x2a, 0x80, 0xaa, 0x06, 0x24, 0x04,
+      0x24, 0x04, 0x28, 0x08, 0x34, 0x0b, 0x01, 0x80, 0x90, 0x81, 0x37, 0x09,
+      0x16, 0x0a, 0x08, 0x80, 0x98, 0x39, 0x03, 0x63, 0x08, 0x09, 0x30, 0x16,
+      0x05, 0x21, 0x03, 0x1b, 0x05, 0x01, 0x40, 0x38, 0x04, 0x4b, 0x05, 0x2f,
+      0x04, 0x0a, 0x07, 0x09, 0x07, 0x40, 0x20, 0x27, 0x04, 0x0c, 0x09, 0x36,
+      0x03, 0x3a, 0x05, 0x1a, 0x07, 0x04, 0x0c, 0x07, 0x50, 0x49, 0x37, 0x33,
+      0x0d, 0x33, 0x07, 0x2e, 0x08, 0x0a, 0x81, 0x26, 0x52, 0x4e, 0x28, 0x08,
+      0x2a, 0x56, 0x1c, 0x14, 0x17, 0x09, 0x4e, 0x04, 0x1e, 0x0f, 0x43, 0x0e,
+      0x19, 0x07, 0x0a, 0x06, 0x48, 0x08, 0x27, 0x09, 0x75, 0x0b, 0x3f, 0x41,
+      0x2a, 0x06, 0x3b, 0x05, 0x0a, 0x06, 0x51, 0x06, 0x01, 0x05, 0x10, 0x03,
+      0x05, 0x80, 0x8b, 0x62, 0x1e, 0x48, 0x08, 0x0a, 0x80, 0xa6, 0x5e, 0x22,
+      0x45, 0x0b, 0x0a, 0x06, 0x0d, 0x13, 0x39, 0x07, 0x0a, 0x36, 0x2c, 0x04,
+      0x10, 0x80, 0xc0, 0x3c, 0x64, 0x53, 0x0c, 0x48, 0x09, 0x0a, 0x46, 0x45,
+      0x1b, 0x48, 0x08, 0x53, 0x1d, 0x39, 0x81, 0x07, 0x46, 0x0a, 0x1d, 0x03,
+      0x47, 0x49, 0x37, 0x03, 0x0e, 0x08, 0x0a, 0x06, 0x39, 0x07, 0x0a, 0x81,
+      0x36, 0x19, 0x80, 0xb7, 0x01, 0x0f, 0x32, 0x0d, 0x83, 0x9b, 0x66, 0x75,
+      0x0b, 0x80, 0xc4, 0x8a, 0xbc, 0x84, 0x2f, 0x8f, 0xd1, 0x82, 0x47, 0xa1,
+      0xb9, 0x82, 0x39, 0x07, 0x2a, 0x04, 0x02, 0x60, 0x26, 0x0a, 0x46, 0x0a,
+      0x28, 0x05, 0x13, 0x82, 0xb0, 0x5b, 0x65, 0x4b, 0x04, 0x39, 0x07, 0x11,
+      0x40, 0x05, 0x0b, 0x02, 0x0e, 0x97, 0xf8, 0x08, 0x84, 0xd6, 0x2a, 0x09,
+      0xa2, 0xf7, 0x81, 0x1f, 0x31, 0x03, 0x11, 0x04, 0x08, 0x81, 0x8c, 0x89,
+      0x04, 0x6b, 0x05, 0x0d, 0x03, 0x09, 0x07, 0x10, 0x93, 0x60, 0x80, 0xf6,
+      0x0a, 0x73, 0x08, 0x6e, 0x17, 0x46, 0x80, 0x9a, 0x14, 0x0c, 0x57, 0x09,
+      0x19, 0x80, 0x87, 0x81, 0x47, 0x03, 0x85, 0x42, 0x0f, 0x15, 0x85, 0x50,
+      0x2b, 0x80, 0xd5, 0x2d, 0x03, 0x1a, 0x04, 0x02, 0x81, 0x70, 0x3a, 0x05,
+      0x01, 0x85, 0x00, 0x80, 0xd7, 0x29, 0x4c, 0x04, 0x0a, 0x04, 0x02, 0x83,
+      0x11, 0x44, 0x4c, 0x3d, 0x80, 0xc2, 0x3c, 0x06, 0x01, 0x04, 0x55, 0x05,
+      0x1b, 0x34, 0x02, 0x81, 0x0e, 0x2c, 0x04, 0x64, 0x0c, 0x56, 0x0a, 0x80,
+      0xae, 0x38, 0x1d, 0x0d, 0x2c, 0x04, 0x09, 0x07, 0x02, 0x0e, 0x06, 0x80,
+      0x9a, 0x83, 0xd8, 0x08, 0x0d, 0x03, 0x0d, 0x03, 0x74, 0x0c, 0x59, 0x07,
+      0x0c, 0x14, 0x0c, 0x04, 0x38, 0x08, 0x0a, 0x06, 0x28, 0x08, 0x22, 0x4e,
+      0x81, 0x54, 0x0c, 0x15, 0x03, 0x03, 0x05, 0x07, 0x09, 0x19, 0x07, 0x07,
+      0x09, 0x03, 0x0d, 0x07, 0x29, 0x80, 0xcb, 0x25, 0x0a, 0x84, 0x06,
+  };
+  auto lower = static_cast<uint16_t>(cp);
+  if (cp < 0x10000) {
+    return is_printable(lower, singletons0,
+                        sizeof(singletons0) / sizeof(*singletons0),
+                        singletons0_lower, normal0, sizeof(normal0));
+  }
+  if (cp < 0x20000) {
+    return is_printable(lower, singletons1,
+                        sizeof(singletons1) / sizeof(*singletons1),
+                        singletons1_lower, normal1, sizeof(normal1));
+  }
+  if (0x2a6de <= cp && cp < 0x2a700) return false;
+  if (0x2b735 <= cp && cp < 0x2b740) return false;
+  if (0x2b81e <= cp && cp < 0x2b820) return false;
+  if (0x2cea2 <= cp && cp < 0x2ceb0) return false;
+  if (0x2ebe1 <= cp && cp < 0x2f800) return false;
+  if (0x2fa1e <= cp && cp < 0x30000) return false;
+  if (0x3134b <= cp && cp < 0xe0100) return false;
+  if (0xe01f0 <= cp && cp < 0x110000) return false;
+  return cp < 0x110000;
+}
+
+}  // namespace detail
+
+FMT_END_NAMESPACE
+
+#endif  // FMT_FORMAT_INL_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/format.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/format.h
new file mode 100644
index 0000000000..0b8a4bea1b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/format.h
@@ -0,0 +1,4225 @@
+/*
+  Formatting library for C++
+
+  Copyright (c) 2012 - present, Victor Zverovich
+
+  Permission is hereby granted, free of charge, to any person obtaining
+  a copy of this software and associated documentation files (the
+  "Software"), to deal in the Software without restriction, including
+  without limitation the rights to use, copy, modify, merge, publish,
+  distribute, sublicense, and/or sell copies of the Software, and to
+  permit persons to whom the Software is furnished to do so, subject to
+  the following conditions:
+
+  The above copyright notice and this permission notice shall be
+  included in all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+  --- Optional exception to the license ---
+
+  As an exception, if, as a result of your compiling your source code, portions
+  of this Software are embedded into a machine-executable object form of such
+  source code, you may redistribute such embedded portions in such object form
+  without including the above copyright and permission notices.
+ */
+
+#ifndef FMT_FORMAT_H_
+#define FMT_FORMAT_H_
+
+#include <cmath>         // std::signbit
+#include <cstdint>       // uint32_t
+#include <cstring>       // std::memcpy
+#include <limits>        // std::numeric_limits
+#include <memory>        // std::uninitialized_copy
+#include <stdexcept>     // std::runtime_error
+#include <system_error>  // std::system_error
+
+#ifdef __cpp_lib_bit_cast
+#  include <bit>  // std::bitcast
+#endif
+
+#include "core.h"
+
+#if FMT_GCC_VERSION
+#  define FMT_GCC_VISIBILITY_HIDDEN __attribute__((visibility("hidden")))
+#else
+#  define FMT_GCC_VISIBILITY_HIDDEN
+#endif
+
+#ifdef __NVCC__
+#  define FMT_CUDA_VERSION (__CUDACC_VER_MAJOR__ * 100 + __CUDACC_VER_MINOR__)
+#else
+#  define FMT_CUDA_VERSION 0
+#endif
+
+#ifdef __has_builtin
+#  define FMT_HAS_BUILTIN(x) __has_builtin(x)
+#else
+#  define FMT_HAS_BUILTIN(x) 0
+#endif
+
+#if FMT_GCC_VERSION || FMT_CLANG_VERSION
+#  define FMT_NOINLINE __attribute__((noinline))
+#else
+#  define FMT_NOINLINE
+#endif
+
+#if FMT_MSC_VERSION
+#  define FMT_MSC_DEFAULT = default
+#else
+#  define FMT_MSC_DEFAULT
+#endif
+
+#ifndef FMT_THROW
+#  if FMT_EXCEPTIONS
+#    if FMT_MSC_VERSION || defined(__NVCC__)
+FMT_BEGIN_NAMESPACE
+namespace detail {
+template <typename Exception> inline void do_throw(const Exception& x) {
+  // Silence unreachable code warnings in MSVC and NVCC because these
+  // are nearly impossible to fix in a generic code.
+  volatile bool b = true;
+  if (b) throw x;
+}
+}  // namespace detail
+FMT_END_NAMESPACE
+#      define FMT_THROW(x) detail::do_throw(x)
+#    else
+#      define FMT_THROW(x) throw x
+#    endif
+#  else
+#    define FMT_THROW(x)               \
+      do {                             \
+        FMT_ASSERT(false, (x).what()); \
+      } while (false)
+#  endif
+#endif
+
+#if FMT_EXCEPTIONS
+#  define FMT_TRY try
+#  define FMT_CATCH(x) catch (x)
+#else
+#  define FMT_TRY if (true)
+#  define FMT_CATCH(x) if (false)
+#endif
+
+#ifndef FMT_MAYBE_UNUSED
+#  if FMT_HAS_CPP17_ATTRIBUTE(maybe_unused)
+#    define FMT_MAYBE_UNUSED [[maybe_unused]]
+#  else
+#    define FMT_MAYBE_UNUSED
+#  endif
+#endif
+
+#ifndef FMT_USE_USER_DEFINED_LITERALS
+// EDG based compilers (Intel, NVIDIA, Elbrus, etc), GCC and MSVC support UDLs.
+#  if (FMT_HAS_FEATURE(cxx_user_literals) || FMT_GCC_VERSION >= 407 || \
+       FMT_MSC_VERSION >= 1900) &&                                     \
+      (!defined(__EDG_VERSION__) || __EDG_VERSION__ >= /* UDL feature */ 480)
+#    define FMT_USE_USER_DEFINED_LITERALS 1
+#  else
+#    define FMT_USE_USER_DEFINED_LITERALS 0
+#  endif
+#endif
+
+// Defining FMT_REDUCE_INT_INSTANTIATIONS to 1, will reduce the number of
+// integer formatter template instantiations to just one by only using the
+// largest integer type. This results in a reduction in binary size but will
+// cause a decrease in integer formatting performance.
+#if !defined(FMT_REDUCE_INT_INSTANTIATIONS)
+#  define FMT_REDUCE_INT_INSTANTIATIONS 0
+#endif
+
+// __builtin_clz is broken in clang with Microsoft CodeGen:
+// https://github.com/fmtlib/fmt/issues/519.
+#if !FMT_MSC_VERSION
+#  if FMT_HAS_BUILTIN(__builtin_clz) || FMT_GCC_VERSION || FMT_ICC_VERSION
+#    define FMT_BUILTIN_CLZ(n) __builtin_clz(n)
+#  endif
+#  if FMT_HAS_BUILTIN(__builtin_clzll) || FMT_GCC_VERSION || FMT_ICC_VERSION
+#    define FMT_BUILTIN_CLZLL(n) __builtin_clzll(n)
+#  endif
+#endif
+
+// __builtin_ctz is broken in Intel Compiler Classic on Windows:
+// https://github.com/fmtlib/fmt/issues/2510.
+#ifndef __ICL
+#  if FMT_HAS_BUILTIN(__builtin_ctz) || FMT_GCC_VERSION || FMT_ICC_VERSION || \
+      defined(__NVCOMPILER)
+#    define FMT_BUILTIN_CTZ(n) __builtin_ctz(n)
+#  endif
+#  if FMT_HAS_BUILTIN(__builtin_ctzll) || FMT_GCC_VERSION || \
+      FMT_ICC_VERSION || defined(__NVCOMPILER)
+#    define FMT_BUILTIN_CTZLL(n) __builtin_ctzll(n)
+#  endif
+#endif
+
+#if FMT_MSC_VERSION
+#  include <intrin.h>  // _BitScanReverse[64], _BitScanForward[64], _umul128
+#endif
+
+// Some compilers masquerade as both MSVC and GCC-likes or otherwise support
+// __builtin_clz and __builtin_clzll, so only define FMT_BUILTIN_CLZ using the
+// MSVC intrinsics if the clz and clzll builtins are not available.
+#if FMT_MSC_VERSION && !defined(FMT_BUILTIN_CLZLL) && \
+    !defined(FMT_BUILTIN_CTZLL)
+FMT_BEGIN_NAMESPACE
+namespace detail {
+// Avoid Clang with Microsoft CodeGen's -Wunknown-pragmas warning.
+#  if !defined(__clang__)
+#    pragma intrinsic(_BitScanForward)
+#    pragma intrinsic(_BitScanReverse)
+#    if defined(_WIN64)
+#      pragma intrinsic(_BitScanForward64)
+#      pragma intrinsic(_BitScanReverse64)
+#    endif
+#  endif
+
+inline auto clz(uint32_t x) -> int {
+  unsigned long r = 0;
+  _BitScanReverse(&r, x);
+  FMT_ASSERT(x != 0, "");
+  // Static analysis complains about using uninitialized data
+  // "r", but the only way that can happen is if "x" is 0,
+  // which the callers guarantee to not happen.
+  FMT_MSC_WARNING(suppress : 6102)
+  return 31 ^ static_cast<int>(r);
+}
+#  define FMT_BUILTIN_CLZ(n) detail::clz(n)
+
+inline auto clzll(uint64_t x) -> int {
+  unsigned long r = 0;
+#  ifdef _WIN64
+  _BitScanReverse64(&r, x);
+#  else
+  // Scan the high 32 bits.
+  if (_BitScanReverse(&r, static_cast<uint32_t>(x >> 32))) return 63 ^ (r + 32);
+  // Scan the low 32 bits.
+  _BitScanReverse(&r, static_cast<uint32_t>(x));
+#  endif
+  FMT_ASSERT(x != 0, "");
+  FMT_MSC_WARNING(suppress : 6102)  // Suppress a bogus static analysis warning.
+  return 63 ^ static_cast<int>(r);
+}
+#  define FMT_BUILTIN_CLZLL(n) detail::clzll(n)
+
+inline auto ctz(uint32_t x) -> int {
+  unsigned long r = 0;
+  _BitScanForward(&r, x);
+  FMT_ASSERT(x != 0, "");
+  FMT_MSC_WARNING(suppress : 6102)  // Suppress a bogus static analysis warning.
+  return static_cast<int>(r);
+}
+#  define FMT_BUILTIN_CTZ(n) detail::ctz(n)
+
+inline auto ctzll(uint64_t x) -> int {
+  unsigned long r = 0;
+  FMT_ASSERT(x != 0, "");
+  FMT_MSC_WARNING(suppress : 6102)  // Suppress a bogus static analysis warning.
+#  ifdef _WIN64
+  _BitScanForward64(&r, x);
+#  else
+  // Scan the low 32 bits.
+  if (_BitScanForward(&r, static_cast<uint32_t>(x))) return static_cast<int>(r);
+  // Scan the high 32 bits.
+  _BitScanForward(&r, static_cast<uint32_t>(x >> 32));
+  r += 32;
+#  endif
+  return static_cast<int>(r);
+}
+#  define FMT_BUILTIN_CTZLL(n) detail::ctzll(n)
+}  // namespace detail
+FMT_END_NAMESPACE
+#endif
+
+FMT_BEGIN_NAMESPACE
+namespace detail {
+
+FMT_CONSTEXPR inline void abort_fuzzing_if(bool condition) {
+  ignore_unused(condition);
+#ifdef FMT_FUZZ
+  if (condition) throw std::runtime_error("fuzzing limit reached");
+#endif
+}
+
+template <typename CharT, CharT... C> struct string_literal {
+  static constexpr CharT value[sizeof...(C)] = {C...};
+  constexpr operator basic_string_view<CharT>() const {
+    return {value, sizeof...(C)};
+  }
+};
+
+#if FMT_CPLUSPLUS < 201703L
+template <typename CharT, CharT... C>
+constexpr CharT string_literal<CharT, C...>::value[sizeof...(C)];
+#endif
+
+template <typename Streambuf> class formatbuf : public Streambuf {
+ private:
+  using char_type = typename Streambuf::char_type;
+  using streamsize = decltype(std::declval<Streambuf>().sputn(nullptr, 0));
+  using int_type = typename Streambuf::int_type;
+  using traits_type = typename Streambuf::traits_type;
+
+  buffer<char_type>& buffer_;
+
+ public:
+  explicit formatbuf(buffer<char_type>& buf) : buffer_(buf) {}
+
+ protected:
+  // The put area is always empty. This makes the implementation simpler and has
+  // the advantage that the streambuf and the buffer are always in sync and
+  // sputc never writes into uninitialized memory. A disadvantage is that each
+  // call to sputc always results in a (virtual) call to overflow. There is no
+  // disadvantage here for sputn since this always results in a call to xsputn.
+
+  auto overflow(int_type ch) -> int_type override {
+    if (!traits_type::eq_int_type(ch, traits_type::eof()))
+      buffer_.push_back(static_cast<char_type>(ch));
+    return ch;
+  }
+
+  auto xsputn(const char_type* s, streamsize count) -> streamsize override {
+    buffer_.append(s, s + count);
+    return count;
+  }
+};
+
+// Implementation of std::bit_cast for pre-C++20.
+template <typename To, typename From, FMT_ENABLE_IF(sizeof(To) == sizeof(From))>
+FMT_CONSTEXPR20 auto bit_cast(const From& from) -> To {
+#ifdef __cpp_lib_bit_cast
+  if (is_constant_evaluated()) return std::bit_cast<To>(from);
+#endif
+  auto to = To();
+  // The cast suppresses a bogus -Wclass-memaccess on GCC.
+  std::memcpy(static_cast<void*>(&to), &from, sizeof(to));
+  return to;
+}
+
+inline auto is_big_endian() -> bool {
+#ifdef _WIN32
+  return false;
+#elif defined(__BIG_ENDIAN__)
+  return true;
+#elif defined(__BYTE_ORDER__) && defined(__ORDER_BIG_ENDIAN__)
+  return __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__;
+#else
+  struct bytes {
+    char data[sizeof(int)];
+  };
+  return bit_cast<bytes>(1).data[0] == 0;
+#endif
+}
+
+class uint128_fallback {
+ private:
+  uint64_t lo_, hi_;
+
+  friend uint128_fallback umul128(uint64_t x, uint64_t y) noexcept;
+
+ public:
+  constexpr uint128_fallback(uint64_t hi, uint64_t lo) : lo_(lo), hi_(hi) {}
+  constexpr uint128_fallback(uint64_t value = 0) : lo_(value), hi_(0) {}
+
+  constexpr uint64_t high() const noexcept { return hi_; }
+  constexpr uint64_t low() const noexcept { return lo_; }
+
+  template <typename T, FMT_ENABLE_IF(std::is_integral<T>::value)>
+  constexpr explicit operator T() const {
+    return static_cast<T>(lo_);
+  }
+
+  friend constexpr auto operator==(const uint128_fallback& lhs,
+                                   const uint128_fallback& rhs) -> bool {
+    return lhs.hi_ == rhs.hi_ && lhs.lo_ == rhs.lo_;
+  }
+  friend constexpr auto operator!=(const uint128_fallback& lhs,
+                                   const uint128_fallback& rhs) -> bool {
+    return !(lhs == rhs);
+  }
+  friend constexpr auto operator>(const uint128_fallback& lhs,
+                                  const uint128_fallback& rhs) -> bool {
+    return lhs.hi_ != rhs.hi_ ? lhs.hi_ > rhs.hi_ : lhs.lo_ > rhs.lo_;
+  }
+  friend constexpr auto operator|(const uint128_fallback& lhs,
+                                  const uint128_fallback& rhs)
+      -> uint128_fallback {
+    return {lhs.hi_ | rhs.hi_, lhs.lo_ | rhs.lo_};
+  }
+  friend constexpr auto operator&(const uint128_fallback& lhs,
+                                  const uint128_fallback& rhs)
+      -> uint128_fallback {
+    return {lhs.hi_ & rhs.hi_, lhs.lo_ & rhs.lo_};
+  }
+  friend auto operator+(const uint128_fallback& lhs,
+                        const uint128_fallback& rhs) -> uint128_fallback {
+    auto result = uint128_fallback(lhs);
+    result += rhs;
+    return result;
+  }
+  friend auto operator*(const uint128_fallback& lhs, uint32_t rhs)
+      -> uint128_fallback {
+    FMT_ASSERT(lhs.hi_ == 0, "");
+    uint64_t hi = (lhs.lo_ >> 32) * rhs;
+    uint64_t lo = (lhs.lo_ & ~uint32_t()) * rhs;
+    uint64_t new_lo = (hi << 32) + lo;
+    return {(hi >> 32) + (new_lo < lo ? 1 : 0), new_lo};
+  }
+  friend auto operator-(const uint128_fallback& lhs, uint64_t rhs)
+      -> uint128_fallback {
+    return {lhs.hi_ - (lhs.lo_ < rhs ? 1 : 0), lhs.lo_ - rhs};
+  }
+  FMT_CONSTEXPR auto operator>>(int shift) const -> uint128_fallback {
+    if (shift == 64) return {0, hi_};
+    if (shift > 64) return uint128_fallback(0, hi_) >> (shift - 64);
+    return {hi_ >> shift, (hi_ << (64 - shift)) | (lo_ >> shift)};
+  }
+  FMT_CONSTEXPR auto operator<<(int shift) const -> uint128_fallback {
+    if (shift == 64) return {lo_, 0};
+    if (shift > 64) return uint128_fallback(lo_, 0) << (shift - 64);
+    return {hi_ << shift | (lo_ >> (64 - shift)), (lo_ << shift)};
+  }
+  FMT_CONSTEXPR auto operator>>=(int shift) -> uint128_fallback& {
+    return *this = *this >> shift;
+  }
+  FMT_CONSTEXPR void operator+=(uint128_fallback n) {
+    uint64_t new_lo = lo_ + n.lo_;
+    uint64_t new_hi = hi_ + n.hi_ + (new_lo < lo_ ? 1 : 0);
+    FMT_ASSERT(new_hi >= hi_, "");
+    lo_ = new_lo;
+    hi_ = new_hi;
+  }
+
+  FMT_CONSTEXPR20 uint128_fallback& operator+=(uint64_t n) noexcept {
+    if (is_constant_evaluated()) {
+      lo_ += n;
+      hi_ += (lo_ < n ? 1 : 0);
+      return *this;
+    }
+#if FMT_HAS_BUILTIN(__builtin_addcll) && !defined(__ibmxl__)
+    unsigned long long carry;
+    lo_ = __builtin_addcll(lo_, n, 0, &carry);
+    hi_ += carry;
+#elif FMT_HAS_BUILTIN(__builtin_ia32_addcarryx_u64) && !defined(__ibmxl__)
+    unsigned long long result;
+    auto carry = __builtin_ia32_addcarryx_u64(0, lo_, n, &result);
+    lo_ = result;
+    hi_ += carry;
+#elif defined(_MSC_VER) && defined(_M_X64)
+    auto carry = _addcarry_u64(0, lo_, n, &lo_);
+    _addcarry_u64(carry, hi_, 0, &hi_);
+#else
+    lo_ += n;
+    hi_ += (lo_ < n ? 1 : 0);
+#endif
+    return *this;
+  }
+};
+
+using uint128_t = conditional_t<FMT_USE_INT128, uint128_opt, uint128_fallback>;
+
+#ifdef UINTPTR_MAX
+using uintptr_t = ::uintptr_t;
+#else
+using uintptr_t = uint128_t;
+#endif
+
+// Returns the largest possible value for type T. Same as
+// std::numeric_limits<T>::max() but shorter and not affected by the max macro.
+template <typename T> constexpr auto max_value() -> T {
+  return (std::numeric_limits<T>::max)();
+}
+template <typename T> constexpr auto num_bits() -> int {
+  return std::numeric_limits<T>::digits;
+}
+// std::numeric_limits<T>::digits may return 0 for 128-bit ints.
+template <> constexpr auto num_bits<int128_opt>() -> int { return 128; }
+template <> constexpr auto num_bits<uint128_t>() -> int { return 128; }
+
+// A heterogeneous bit_cast used for converting 96-bit long double to uint128_t
+// and 128-bit pointers to uint128_fallback.
+template <typename To, typename From, FMT_ENABLE_IF(sizeof(To) > sizeof(From))>
+inline auto bit_cast(const From& from) -> To {
+  constexpr auto size = static_cast<int>(sizeof(From) / sizeof(unsigned));
+  struct data_t {
+    unsigned value[static_cast<unsigned>(size)];
+  } data = bit_cast<data_t>(from);
+  auto result = To();
+  if (const_check(is_big_endian())) {
+    for (int i = 0; i < size; ++i)
+      result = (result << num_bits<unsigned>()) | data.value[i];
+  } else {
+    for (int i = size - 1; i >= 0; --i)
+      result = (result << num_bits<unsigned>()) | data.value[i];
+  }
+  return result;
+}
+
+FMT_INLINE void assume(bool condition) {
+  (void)condition;
+#if FMT_HAS_BUILTIN(__builtin_assume) && !FMT_ICC_VERSION
+  __builtin_assume(condition);
+#endif
+}
+
+// An approximation of iterator_t for pre-C++20 systems.
+template <typename T>
+using iterator_t = decltype(std::begin(std::declval<T&>()));
+template <typename T> using sentinel_t = decltype(std::end(std::declval<T&>()));
+
+// A workaround for std::string not having mutable data() until C++17.
+template <typename Char>
+inline auto get_data(std::basic_string<Char>& s) -> Char* {
+  return &s[0];
+}
+template <typename Container>
+inline auto get_data(Container& c) -> typename Container::value_type* {
+  return c.data();
+}
+
+#if defined(_SECURE_SCL) && _SECURE_SCL
+// Make a checked iterator to avoid MSVC warnings.
+template <typename T> using checked_ptr = stdext::checked_array_iterator<T*>;
+template <typename T>
+constexpr auto make_checked(T* p, size_t size) -> checked_ptr<T> {
+  return {p, size};
+}
+#else
+template <typename T> using checked_ptr = T*;
+template <typename T> constexpr auto make_checked(T* p, size_t) -> T* {
+  return p;
+}
+#endif
+
+// Attempts to reserve space for n extra characters in the output range.
+// Returns a pointer to the reserved range or a reference to it.
+template <typename Container, FMT_ENABLE_IF(is_contiguous<Container>::value)>
+#if FMT_CLANG_VERSION >= 307 && !FMT_ICC_VERSION
+__attribute__((no_sanitize("undefined")))
+#endif
+inline auto
+reserve(std::back_insert_iterator<Container> it, size_t n)
+    -> checked_ptr<typename Container::value_type> {
+  Container& c = get_container(it);
+  size_t size = c.size();
+  c.resize(size + n);
+  return make_checked(get_data(c) + size, n);
+}
+
+template <typename T>
+inline auto reserve(buffer_appender<T> it, size_t n) -> buffer_appender<T> {
+  buffer<T>& buf = get_container(it);
+  buf.try_reserve(buf.size() + n);
+  return it;
+}
+
+template <typename Iterator>
+constexpr auto reserve(Iterator& it, size_t) -> Iterator& {
+  return it;
+}
+
+template <typename OutputIt>
+using reserve_iterator =
+    remove_reference_t<decltype(reserve(std::declval<OutputIt&>(), 0))>;
+
+template <typename T, typename OutputIt>
+constexpr auto to_pointer(OutputIt, size_t) -> T* {
+  return nullptr;
+}
+template <typename T> auto to_pointer(buffer_appender<T> it, size_t n) -> T* {
+  buffer<T>& buf = get_container(it);
+  auto size = buf.size();
+  if (buf.capacity() < size + n) return nullptr;
+  buf.try_resize(size + n);
+  return buf.data() + size;
+}
+
+template <typename Container, FMT_ENABLE_IF(is_contiguous<Container>::value)>
+inline auto base_iterator(std::back_insert_iterator<Container>& it,
+                          checked_ptr<typename Container::value_type>)
+    -> std::back_insert_iterator<Container> {
+  return it;
+}
+
+template <typename Iterator>
+constexpr auto base_iterator(Iterator, Iterator it) -> Iterator {
+  return it;
+}
+
+// <algorithm> is spectacularly slow to compile in C++20 so use a simple fill_n
+// instead (#1998).
+template <typename OutputIt, typename Size, typename T>
+FMT_CONSTEXPR auto fill_n(OutputIt out, Size count, const T& value)
+    -> OutputIt {
+  for (Size i = 0; i < count; ++i) *out++ = value;
+  return out;
+}
+template <typename T, typename Size>
+FMT_CONSTEXPR20 auto fill_n(T* out, Size count, char value) -> T* {
+  if (is_constant_evaluated()) {
+    return fill_n<T*, Size, T>(out, count, value);
+  }
+  std::memset(out, value, to_unsigned(count));
+  return out + count;
+}
+
+#ifdef __cpp_char8_t
+using char8_type = char8_t;
+#else
+enum char8_type : unsigned char {};
+#endif
+
+template <typename OutChar, typename InputIt, typename OutputIt>
+FMT_CONSTEXPR FMT_NOINLINE auto copy_str_noinline(InputIt begin, InputIt end,
+                                                  OutputIt out) -> OutputIt {
+  return copy_str<OutChar>(begin, end, out);
+}
+
+// A public domain branchless UTF-8 decoder by Christopher Wellons:
+// https://github.com/skeeto/branchless-utf8
+/* Decode the next character, c, from s, reporting errors in e.
+ *
+ * Since this is a branchless decoder, four bytes will be read from the
+ * buffer regardless of the actual length of the next character. This
+ * means the buffer _must_ have at least three bytes of zero padding
+ * following the end of the data stream.
+ *
+ * Errors are reported in e, which will be non-zero if the parsed
+ * character was somehow invalid: invalid byte sequence, non-canonical
+ * encoding, or a surrogate half.
+ *
+ * The function returns a pointer to the next character. When an error
+ * occurs, this pointer will be a guess that depends on the particular
+ * error, but it will always advance at least one byte.
+ */
+FMT_CONSTEXPR inline auto utf8_decode(const char* s, uint32_t* c, int* e)
+    -> const char* {
+  constexpr const int masks[] = {0x00, 0x7f, 0x1f, 0x0f, 0x07};
+  constexpr const uint32_t mins[] = {4194304, 0, 128, 2048, 65536};
+  constexpr const int shiftc[] = {0, 18, 12, 6, 0};
+  constexpr const int shifte[] = {0, 6, 4, 2, 0};
+
+  int len = code_point_length_impl(*s);
+  // Compute the pointer to the next character early so that the next
+  // iteration can start working on the next character. Neither Clang
+  // nor GCC figure out this reordering on their own.
+  const char* next = s + len + !len;
+
+  using uchar = unsigned char;
+
+  // Assume a four-byte character and load four bytes. Unused bits are
+  // shifted out.
+  *c = uint32_t(uchar(s[0]) & masks[len]) << 18;
+  *c |= uint32_t(uchar(s[1]) & 0x3f) << 12;
+  *c |= uint32_t(uchar(s[2]) & 0x3f) << 6;
+  *c |= uint32_t(uchar(s[3]) & 0x3f) << 0;
+  *c >>= shiftc[len];
+
+  // Accumulate the various error conditions.
+  *e = (*c < mins[len]) << 6;       // non-canonical encoding
+  *e |= ((*c >> 11) == 0x1b) << 7;  // surrogate half?
+  *e |= (*c > 0x10FFFF) << 8;       // out of range?
+  *e |= (uchar(s[1]) & 0xc0) >> 2;
+  *e |= (uchar(s[2]) & 0xc0) >> 4;
+  *e |= uchar(s[3]) >> 6;
+  *e ^= 0x2a;  // top two bits of each tail byte correct?
+  *e >>= shifte[len];
+
+  return next;
+}
+
+constexpr uint32_t invalid_code_point = ~uint32_t();
+
+// Invokes f(cp, sv) for every code point cp in s with sv being the string view
+// corresponding to the code point. cp is invalid_code_point on error.
+template <typename F>
+FMT_CONSTEXPR void for_each_codepoint(string_view s, F f) {
+  auto decode = [f](const char* buf_ptr, const char* ptr) {
+    auto cp = uint32_t();
+    auto error = 0;
+    auto end = utf8_decode(buf_ptr, &cp, &error);
+    bool result = f(error ? invalid_code_point : cp,
+                    string_view(ptr, error ? 1 : to_unsigned(end - buf_ptr)));
+    return result ? (error ? buf_ptr + 1 : end) : nullptr;
+  };
+  auto p = s.data();
+  const size_t block_size = 4;  // utf8_decode always reads blocks of 4 chars.
+  if (s.size() >= block_size) {
+    for (auto end = p + s.size() - block_size + 1; p < end;) {
+      p = decode(p, p);
+      if (!p) return;
+    }
+  }
+  if (auto num_chars_left = s.data() + s.size() - p) {
+    char buf[2 * block_size - 1] = {};
+    copy_str<char>(p, p + num_chars_left, buf);
+    const char* buf_ptr = buf;
+    do {
+      auto end = decode(buf_ptr, p);
+      if (!end) return;
+      p += end - buf_ptr;
+      buf_ptr = end;
+    } while (buf_ptr - buf < num_chars_left);
+  }
+}
+
+template <typename Char>
+inline auto compute_width(basic_string_view<Char> s) -> size_t {
+  return s.size();
+}
+
+// Computes approximate display width of a UTF-8 string.
+FMT_CONSTEXPR inline size_t compute_width(string_view s) {
+  size_t num_code_points = 0;
+  // It is not a lambda for compatibility with C++14.
+  struct count_code_points {
+    size_t* count;
+    FMT_CONSTEXPR auto operator()(uint32_t cp, string_view) const -> bool {
+      *count += detail::to_unsigned(
+          1 +
+          (cp >= 0x1100 &&
+           (cp <= 0x115f ||  // Hangul Jamo init. consonants
+            cp == 0x2329 ||  // LEFT-POINTING ANGLE BRACKET
+            cp == 0x232a ||  // RIGHT-POINTING ANGLE BRACKET
+            // CJK ... Yi except IDEOGRAPHIC HALF FILL SPACE:
+            (cp >= 0x2e80 && cp <= 0xa4cf && cp != 0x303f) ||
+            (cp >= 0xac00 && cp <= 0xd7a3) ||    // Hangul Syllables
+            (cp >= 0xf900 && cp <= 0xfaff) ||    // CJK Compatibility Ideographs
+            (cp >= 0xfe10 && cp <= 0xfe19) ||    // Vertical Forms
+            (cp >= 0xfe30 && cp <= 0xfe6f) ||    // CJK Compatibility Forms
+            (cp >= 0xff00 && cp <= 0xff60) ||    // Fullwidth Forms
+            (cp >= 0xffe0 && cp <= 0xffe6) ||    // Fullwidth Forms
+            (cp >= 0x20000 && cp <= 0x2fffd) ||  // CJK
+            (cp >= 0x30000 && cp <= 0x3fffd) ||
+            // Miscellaneous Symbols and Pictographs + Emoticons:
+            (cp >= 0x1f300 && cp <= 0x1f64f) ||
+            // Supplemental Symbols and Pictographs:
+            (cp >= 0x1f900 && cp <= 0x1f9ff))));
+      return true;
+    }
+  };
+  for_each_codepoint(s, count_code_points{&num_code_points});
+  return num_code_points;
+}
+
+inline auto compute_width(basic_string_view<char8_type> s) -> size_t {
+  return compute_width(
+      string_view(reinterpret_cast<const char*>(s.data()), s.size()));
+}
+
+template <typename Char>
+inline auto code_point_index(basic_string_view<Char> s, size_t n) -> size_t {
+  size_t size = s.size();
+  return n < size ? n : size;
+}
+
+// Calculates the index of the nth code point in a UTF-8 string.
+inline auto code_point_index(string_view s, size_t n) -> size_t {
+  const char* data = s.data();
+  size_t num_code_points = 0;
+  for (size_t i = 0, size = s.size(); i != size; ++i) {
+    if ((data[i] & 0xc0) != 0x80 && ++num_code_points > n) return i;
+  }
+  return s.size();
+}
+
+inline auto code_point_index(basic_string_view<char8_type> s, size_t n)
+    -> size_t {
+  return code_point_index(
+      string_view(reinterpret_cast<const char*>(s.data()), s.size()), n);
+}
+
+#ifndef FMT_USE_FLOAT128
+#  ifdef __SIZEOF_FLOAT128__
+#    define FMT_USE_FLOAT128 1
+#  else
+#    define FMT_USE_FLOAT128 0
+#  endif
+#endif
+#if FMT_USE_FLOAT128
+using float128 = __float128;
+#else
+using float128 = void;
+#endif
+template <typename T> using is_float128 = std::is_same<T, float128>;
+
+template <typename T>
+using is_floating_point =
+    bool_constant<std::is_floating_point<T>::value || is_float128<T>::value>;
+
+template <typename T, bool = std::is_floating_point<T>::value>
+struct is_fast_float : bool_constant<std::numeric_limits<T>::is_iec559 &&
+                                     sizeof(T) <= sizeof(double)> {};
+template <typename T> struct is_fast_float<T, false> : std::false_type {};
+
+template <typename T>
+using is_double_double = bool_constant<std::numeric_limits<T>::digits == 106>;
+
+#ifndef FMT_USE_FULL_CACHE_DRAGONBOX
+#  define FMT_USE_FULL_CACHE_DRAGONBOX 0
+#endif
+
+template <typename T>
+template <typename U>
+void buffer<T>::append(const U* begin, const U* end) {
+  while (begin != end) {
+    auto count = to_unsigned(end - begin);
+    try_reserve(size_ + count);
+    auto free_cap = capacity_ - size_;
+    if (free_cap < count) count = free_cap;
+    std::uninitialized_copy_n(begin, count, make_checked(ptr_ + size_, count));
+    size_ += count;
+    begin += count;
+  }
+}
+
+template <typename T, typename Enable = void>
+struct is_locale : std::false_type {};
+template <typename T>
+struct is_locale<T, void_t<decltype(T::classic())>> : std::true_type {};
+}  // namespace detail
+
+FMT_MODULE_EXPORT_BEGIN
+
+// The number of characters to store in the basic_memory_buffer object itself
+// to avoid dynamic memory allocation.
+enum { inline_buffer_size = 500 };
+
+/**
+  \rst
+  A dynamically growing memory buffer for trivially copyable/constructible types
+  with the first ``SIZE`` elements stored in the object itself.
+
+  You can use the ``memory_buffer`` type alias for ``char`` instead.
+
+  **Example**::
+
+     auto out = fmt::memory_buffer();
+     format_to(std::back_inserter(out), "The answer is {}.", 42);
+
+  This will append the following output to the ``out`` object:
+
+  .. code-block:: none
+
+     The answer is 42.
+
+  The output can be converted to an ``std::string`` with ``to_string(out)``.
+  \endrst
+ */
+template <typename T, size_t SIZE = inline_buffer_size,
+          typename Allocator = std::allocator<T>>
+class basic_memory_buffer final : public detail::buffer<T> {
+ private:
+  T store_[SIZE];
+
+  // Don't inherit from Allocator avoid generating type_info for it.
+  Allocator alloc_;
+
+  // Deallocate memory allocated by the buffer.
+  FMT_CONSTEXPR20 void deallocate() {
+    T* data = this->data();
+    if (data != store_) alloc_.deallocate(data, this->capacity());
+  }
+
+ protected:
+  FMT_CONSTEXPR20 void grow(size_t size) override;
+
+ public:
+  using value_type = T;
+  using const_reference = const T&;
+
+  FMT_CONSTEXPR20 explicit basic_memory_buffer(
+      const Allocator& alloc = Allocator())
+      : alloc_(alloc) {
+    this->set(store_, SIZE);
+    if (detail::is_constant_evaluated()) detail::fill_n(store_, SIZE, T());
+  }
+  FMT_CONSTEXPR20 ~basic_memory_buffer() { deallocate(); }
+
+ private:
+  // Move data from other to this buffer.
+  FMT_CONSTEXPR20 void move(basic_memory_buffer& other) {
+    alloc_ = std::move(other.alloc_);
+    T* data = other.data();
+    size_t size = other.size(), capacity = other.capacity();
+    if (data == other.store_) {
+      this->set(store_, capacity);
+      detail::copy_str<T>(other.store_, other.store_ + size,
+                          detail::make_checked(store_, capacity));
+    } else {
+      this->set(data, capacity);
+      // Set pointer to the inline array so that delete is not called
+      // when deallocating.
+      other.set(other.store_, 0);
+      other.clear();
+    }
+    this->resize(size);
+  }
+
+ public:
+  /**
+    \rst
+    Constructs a :class:`fmt::basic_memory_buffer` object moving the content
+    of the other object to it.
+    \endrst
+   */
+  FMT_CONSTEXPR20 basic_memory_buffer(basic_memory_buffer&& other) noexcept {
+    move(other);
+  }
+
+  /**
+    \rst
+    Moves the content of the other ``basic_memory_buffer`` object to this one.
+    \endrst
+   */
+  auto operator=(basic_memory_buffer&& other) noexcept -> basic_memory_buffer& {
+    FMT_ASSERT(this != &other, "");
+    deallocate();
+    move(other);
+    return *this;
+  }
+
+  // Returns a copy of the allocator associated with this buffer.
+  auto get_allocator() const -> Allocator { return alloc_; }
+
+  /**
+    Resizes the buffer to contain *count* elements. If T is a POD type new
+    elements may not be initialized.
+   */
+  FMT_CONSTEXPR20 void resize(size_t count) { this->try_resize(count); }
+
+  /** Increases the buffer capacity to *new_capacity*. */
+  void reserve(size_t new_capacity) { this->try_reserve(new_capacity); }
+
+  // Directly append data into the buffer
+  using detail::buffer<T>::append;
+  template <typename ContiguousRange>
+  void append(const ContiguousRange& range) {
+    append(range.data(), range.data() + range.size());
+  }
+};
+
+template <typename T, size_t SIZE, typename Allocator>
+FMT_CONSTEXPR20 void basic_memory_buffer<T, SIZE, Allocator>::grow(
+    size_t size) {
+  detail::abort_fuzzing_if(size > 5000);
+  const size_t max_size = std::allocator_traits<Allocator>::max_size(alloc_);
+  size_t old_capacity = this->capacity();
+  size_t new_capacity = old_capacity + old_capacity / 2;
+  if (size > new_capacity)
+    new_capacity = size;
+  else if (new_capacity > max_size)
+    new_capacity = size > max_size ? size : max_size;
+  T* old_data = this->data();
+  T* new_data =
+      std::allocator_traits<Allocator>::allocate(alloc_, new_capacity);
+  // The following code doesn't throw, so the raw pointer above doesn't leak.
+
+// False positive warning when built in RelWithDebInfo mode
+// see https://gcc.gnu.org/bugzilla/show_bug.cgi?id=109717
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Warray-bounds"
+#pragma clang diagnostic ignored "-Wunknown-warning-option"
+#pragma GCC diagnostic ignored "-Wstringop-overflow"
+  std::uninitialized_copy(old_data, old_data + this->size(),
+                          detail::make_checked(new_data, new_capacity));
+#pragma GCC diagnostic pop
+  this->set(new_data, new_capacity);
+  // deallocate must not throw according to the standard, but even if it does,
+  // the buffer already uses the new storage and will deallocate it in
+  // destructor.
+  if (old_data != store_) alloc_.deallocate(old_data, old_capacity);
+}
+
+using memory_buffer = basic_memory_buffer<char>;
+
+template <typename T, size_t SIZE, typename Allocator>
+struct is_contiguous<basic_memory_buffer<T, SIZE, Allocator>> : std::true_type {
+};
+
+namespace detail {
+#ifdef _WIN32
+FMT_API bool write_console(std::FILE* f, string_view text);
+#endif
+FMT_API void print(std::FILE*, string_view);
+}  // namespace detail
+
+/** A formatting error such as invalid format string. */
+FMT_CLASS_API
+class FMT_API format_error : public std::runtime_error {
+ public:
+  explicit format_error(const char* message) : std::runtime_error(message) {}
+  explicit format_error(const std::string& message)
+      : std::runtime_error(message) {}
+  format_error(const format_error&) = default;
+  format_error& operator=(const format_error&) = default;
+  format_error(format_error&&) = default;
+  format_error& operator=(format_error&&) = default;
+  ~format_error() noexcept override FMT_MSC_DEFAULT;
+};
+
+namespace detail_exported {
+#if FMT_USE_NONTYPE_TEMPLATE_ARGS
+template <typename Char, size_t N> struct fixed_string {
+  constexpr fixed_string(const Char (&str)[N]) {
+    detail::copy_str<Char, const Char*, Char*>(static_cast<const Char*>(str),
+                                               str + N, data);
+  }
+  Char data[N] = {};
+};
+#endif
+
+// Converts a compile-time string to basic_string_view.
+template <typename Char, size_t N>
+constexpr auto compile_string_to_view(const Char (&s)[N])
+    -> basic_string_view<Char> {
+  // Remove trailing NUL character if needed. Won't be present if this is used
+  // with a raw character array (i.e. not defined as a string).
+  return {s, N - (std::char_traits<Char>::to_int_type(s[N - 1]) == 0 ? 1 : 0)};
+}
+template <typename Char>
+constexpr auto compile_string_to_view(detail::std_string_view<Char> s)
+    -> basic_string_view<Char> {
+  return {s.data(), s.size()};
+}
+}  // namespace detail_exported
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+template <typename T> struct is_integral : std::is_integral<T> {};
+template <> struct is_integral<int128_opt> : std::true_type {};
+template <> struct is_integral<uint128_t> : std::true_type {};
+
+template <typename T>
+using is_signed =
+    std::integral_constant<bool, std::numeric_limits<T>::is_signed ||
+                                     std::is_same<T, int128_opt>::value>;
+
+// Returns true if value is negative, false otherwise.
+// Same as `value < 0` but doesn't produce warnings if T is an unsigned type.
+template <typename T, FMT_ENABLE_IF(is_signed<T>::value)>
+constexpr auto is_negative(T value) -> bool {
+  return value < 0;
+}
+template <typename T, FMT_ENABLE_IF(!is_signed<T>::value)>
+constexpr auto is_negative(T) -> bool {
+  return false;
+}
+
+template <typename T>
+FMT_CONSTEXPR auto is_supported_floating_point(T) -> bool {
+  if (std::is_same<T, float>()) return FMT_USE_FLOAT;
+  if (std::is_same<T, double>()) return FMT_USE_DOUBLE;
+  if (std::is_same<T, long double>()) return FMT_USE_LONG_DOUBLE;
+  return true;
+}
+
+// Smallest of uint32_t, uint64_t, uint128_t that is large enough to
+// represent all values of an integral type T.
+template <typename T>
+using uint32_or_64_or_128_t =
+    conditional_t<num_bits<T>() <= 32 && !FMT_REDUCE_INT_INSTANTIATIONS,
+                  uint32_t,
+                  conditional_t<num_bits<T>() <= 64, uint64_t, uint128_t>>;
+template <typename T>
+using uint64_or_128_t = conditional_t<num_bits<T>() <= 64, uint64_t, uint128_t>;
+
+#define FMT_POWERS_OF_10(factor)                                             \
+  factor * 10, (factor)*100, (factor)*1000, (factor)*10000, (factor)*100000, \
+      (factor)*1000000, (factor)*10000000, (factor)*100000000,               \
+      (factor)*1000000000
+
+// Converts value in the range [0, 100) to a string.
+constexpr const char* digits2(size_t value) {
+  // GCC generates slightly better code when value is pointer-size.
+  return &"0001020304050607080910111213141516171819"
+         "2021222324252627282930313233343536373839"
+         "4041424344454647484950515253545556575859"
+         "6061626364656667686970717273747576777879"
+         "8081828384858687888990919293949596979899"[value * 2];
+}
+
+// Sign is a template parameter to workaround a bug in gcc 4.8.
+template <typename Char, typename Sign> constexpr Char sign(Sign s) {
+#if !FMT_GCC_VERSION || FMT_GCC_VERSION >= 604
+  static_assert(std::is_same<Sign, sign_t>::value, "");
+#endif
+  return static_cast<Char>("\0-+ "[s]);
+}
+
+template <typename T> FMT_CONSTEXPR auto count_digits_fallback(T n) -> int {
+  int count = 1;
+  for (;;) {
+    // Integer division is slow so do it for a group of four digits instead
+    // of for every digit. The idea comes from the talk by Alexandrescu
+    // "Three Optimization Tips for C++". See speed-test for a comparison.
+    if (n < 10) return count;
+    if (n < 100) return count + 1;
+    if (n < 1000) return count + 2;
+    if (n < 10000) return count + 3;
+    n /= 10000u;
+    count += 4;
+  }
+}
+#if FMT_USE_INT128
+FMT_CONSTEXPR inline auto count_digits(uint128_opt n) -> int {
+  return count_digits_fallback(n);
+}
+#endif
+
+#ifdef FMT_BUILTIN_CLZLL
+// It is a separate function rather than a part of count_digits to workaround
+// the lack of static constexpr in constexpr functions.
+inline auto do_count_digits(uint64_t n) -> int {
+  // This has comparable performance to the version by Kendall Willets
+  // (https://github.com/fmtlib/format-benchmark/blob/master/digits10)
+  // but uses smaller tables.
+  // Maps bsr(n) to ceil(log10(pow(2, bsr(n) + 1) - 1)).
+  static constexpr uint8_t bsr2log10[] = {
+      1,  1,  1,  2,  2,  2,  3,  3,  3,  4,  4,  4,  4,  5,  5,  5,
+      6,  6,  6,  7,  7,  7,  7,  8,  8,  8,  9,  9,  9,  10, 10, 10,
+      10, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 15, 15,
+      15, 16, 16, 16, 16, 17, 17, 17, 18, 18, 18, 19, 19, 19, 19, 20};
+  auto t = bsr2log10[FMT_BUILTIN_CLZLL(n | 1) ^ 63];
+  static constexpr const uint64_t zero_or_powers_of_10[] = {
+      0, 0, FMT_POWERS_OF_10(1U), FMT_POWERS_OF_10(1000000000ULL),
+      10000000000000000000ULL};
+  return t - (n < zero_or_powers_of_10[t]);
+}
+#endif
+
+// Returns the number of decimal digits in n. Leading zeros are not counted
+// except for n == 0 in which case count_digits returns 1.
+FMT_CONSTEXPR20 inline auto count_digits(uint64_t n) -> int {
+#ifdef FMT_BUILTIN_CLZLL
+  if (!is_constant_evaluated()) {
+    return do_count_digits(n);
+  }
+#endif
+  return count_digits_fallback(n);
+}
+
+// Counts the number of digits in n. BITS = log2(radix).
+template <int BITS, typename UInt>
+FMT_CONSTEXPR auto count_digits(UInt n) -> int {
+#ifdef FMT_BUILTIN_CLZ
+  if (!is_constant_evaluated() && num_bits<UInt>() == 32)
+    return (FMT_BUILTIN_CLZ(static_cast<uint32_t>(n) | 1) ^ 31) / BITS + 1;
+#endif
+  // Lambda avoids unreachable code warnings from NVHPC.
+  return [](UInt m) {
+    int num_digits = 0;
+    do {
+      ++num_digits;
+    } while ((m >>= BITS) != 0);
+    return num_digits;
+  }(n);
+}
+
+#ifdef FMT_BUILTIN_CLZ
+// It is a separate function rather than a part of count_digits to workaround
+// the lack of static constexpr in constexpr functions.
+FMT_INLINE auto do_count_digits(uint32_t n) -> int {
+// An optimization by Kendall Willets from https://bit.ly/3uOIQrB.
+// This increments the upper 32 bits (log10(T) - 1) when >= T is added.
+#  define FMT_INC(T) (((sizeof(#  T) - 1ull) << 32) - T)
+  static constexpr uint64_t table[] = {
+      FMT_INC(0),          FMT_INC(0),          FMT_INC(0),           // 8
+      FMT_INC(10),         FMT_INC(10),         FMT_INC(10),          // 64
+      FMT_INC(100),        FMT_INC(100),        FMT_INC(100),         // 512
+      FMT_INC(1000),       FMT_INC(1000),       FMT_INC(1000),        // 4096
+      FMT_INC(10000),      FMT_INC(10000),      FMT_INC(10000),       // 32k
+      FMT_INC(100000),     FMT_INC(100000),     FMT_INC(100000),      // 256k
+      FMT_INC(1000000),    FMT_INC(1000000),    FMT_INC(1000000),     // 2048k
+      FMT_INC(10000000),   FMT_INC(10000000),   FMT_INC(10000000),    // 16M
+      FMT_INC(100000000),  FMT_INC(100000000),  FMT_INC(100000000),   // 128M
+      FMT_INC(1000000000), FMT_INC(1000000000), FMT_INC(1000000000),  // 1024M
+      FMT_INC(1000000000), FMT_INC(1000000000)                        // 4B
+  };
+  auto inc = table[FMT_BUILTIN_CLZ(n | 1) ^ 31];
+  return static_cast<int>((n + inc) >> 32);
+}
+#endif
+
+// Optional version of count_digits for better performance on 32-bit platforms.
+FMT_CONSTEXPR20 inline auto count_digits(uint32_t n) -> int {
+#ifdef FMT_BUILTIN_CLZ
+  if (!is_constant_evaluated()) {
+    return do_count_digits(n);
+  }
+#endif
+  return count_digits_fallback(n);
+}
+
+template <typename Int> constexpr auto digits10() noexcept -> int {
+  return std::numeric_limits<Int>::digits10;
+}
+template <> constexpr auto digits10<int128_opt>() noexcept -> int { return 38; }
+template <> constexpr auto digits10<uint128_t>() noexcept -> int { return 38; }
+
+template <typename Char> struct thousands_sep_result {
+  std::string grouping;
+  Char thousands_sep;
+};
+
+template <typename Char>
+FMT_API auto thousands_sep_impl(locale_ref loc) -> thousands_sep_result<Char>;
+template <typename Char>
+inline auto thousands_sep(locale_ref loc) -> thousands_sep_result<Char> {
+  auto result = thousands_sep_impl<char>(loc);
+  return {result.grouping, Char(result.thousands_sep)};
+}
+template <>
+inline auto thousands_sep(locale_ref loc) -> thousands_sep_result<wchar_t> {
+  return thousands_sep_impl<wchar_t>(loc);
+}
+
+template <typename Char>
+FMT_API auto decimal_point_impl(locale_ref loc) -> Char;
+template <typename Char> inline auto decimal_point(locale_ref loc) -> Char {
+  return Char(decimal_point_impl<char>(loc));
+}
+template <> inline auto decimal_point(locale_ref loc) -> wchar_t {
+  return decimal_point_impl<wchar_t>(loc);
+}
+
+// Compares two characters for equality.
+template <typename Char> auto equal2(const Char* lhs, const char* rhs) -> bool {
+  return lhs[0] == Char(rhs[0]) && lhs[1] == Char(rhs[1]);
+}
+inline auto equal2(const char* lhs, const char* rhs) -> bool {
+  return memcmp(lhs, rhs, 2) == 0;
+}
+
+// Copies two characters from src to dst.
+template <typename Char>
+FMT_CONSTEXPR20 FMT_INLINE void copy2(Char* dst, const char* src) {
+  if (!is_constant_evaluated() && sizeof(Char) == sizeof(char)) {
+    memcpy(dst, src, 2);
+    return;
+  }
+  *dst++ = static_cast<Char>(*src++);
+  *dst = static_cast<Char>(*src);
+}
+
+template <typename Iterator> struct format_decimal_result {
+  Iterator begin;
+  Iterator end;
+};
+
+// Formats a decimal unsigned integer value writing into out pointing to a
+// buffer of specified size. The caller must ensure that the buffer is large
+// enough.
+template <typename Char, typename UInt>
+FMT_CONSTEXPR20 auto format_decimal(Char* out, UInt value, int size)
+    -> format_decimal_result<Char*> {
+  FMT_ASSERT(size >= count_digits(value), "invalid digit count");
+  out += size;
+  Char* end = out;
+  while (value >= 100) {
+    // Integer division is slow so do it for a group of two digits instead
+    // of for every digit. The idea comes from the talk by Alexandrescu
+    // "Three Optimization Tips for C++". See speed-test for a comparison.
+    out -= 2;
+    copy2(out, digits2(static_cast<size_t>(value % 100)));
+    value /= 100;
+  }
+  if (value < 10) {
+    *--out = static_cast<Char>('0' + value);
+    return {out, end};
+  }
+  out -= 2;
+  copy2(out, digits2(static_cast<size_t>(value)));
+  return {out, end};
+}
+
+template <typename Char, typename UInt, typename Iterator,
+          FMT_ENABLE_IF(!std::is_pointer<remove_cvref_t<Iterator>>::value)>
+FMT_CONSTEXPR inline auto format_decimal(Iterator out, UInt value, int size)
+    -> format_decimal_result<Iterator> {
+  // Buffer is large enough to hold all digits (digits10 + 1).
+  Char buffer[digits10<UInt>() + 1];
+  auto end = format_decimal(buffer, value, size).end;
+  return {out, detail::copy_str_noinline<Char>(buffer, end, out)};
+}
+
+template <unsigned BASE_BITS, typename Char, typename UInt>
+FMT_CONSTEXPR auto format_uint(Char* buffer, UInt value, int num_digits,
+                               bool upper = false) -> Char* {
+  buffer += num_digits;
+  Char* end = buffer;
+  do {
+    const char* digits = upper ? "0123456789ABCDEF" : "0123456789abcdef";
+    unsigned digit = static_cast<unsigned>(value & ((1 << BASE_BITS) - 1));
+    *--buffer = static_cast<Char>(BASE_BITS < 4 ? static_cast<char>('0' + digit)
+                                                : digits[digit]);
+  } while ((value >>= BASE_BITS) != 0);
+  return end;
+}
+
+template <unsigned BASE_BITS, typename Char, typename It, typename UInt>
+inline auto format_uint(It out, UInt value, int num_digits, bool upper = false)
+    -> It {
+  if (auto ptr = to_pointer<Char>(out, to_unsigned(num_digits))) {
+    format_uint<BASE_BITS>(ptr, value, num_digits, upper);
+    return out;
+  }
+  // Buffer should be large enough to hold all digits (digits / BASE_BITS + 1).
+  char buffer[num_bits<UInt>() / BASE_BITS + 1];
+  format_uint<BASE_BITS>(buffer, value, num_digits, upper);
+  return detail::copy_str_noinline<Char>(buffer, buffer + num_digits, out);
+}
+
+// A converter from UTF-8 to UTF-16.
+class utf8_to_utf16 {
+ private:
+  basic_memory_buffer<wchar_t> buffer_;
+
+ public:
+  FMT_API explicit utf8_to_utf16(string_view s);
+  operator basic_string_view<wchar_t>() const { return {&buffer_[0], size()}; }
+  auto size() const -> size_t { return buffer_.size() - 1; }
+  auto c_str() const -> const wchar_t* { return &buffer_[0]; }
+  auto str() const -> std::wstring { return {&buffer_[0], size()}; }
+};
+
+namespace dragonbox {
+
+// Type-specific information that Dragonbox uses.
+template <typename T, typename Enable = void> struct float_info;
+
+template <> struct float_info<float> {
+  using carrier_uint = uint32_t;
+  static const int exponent_bits = 8;
+  static const int kappa = 1;
+  static const int big_divisor = 100;
+  static const int small_divisor = 10;
+  static const int min_k = -31;
+  static const int max_k = 46;
+  static const int shorter_interval_tie_lower_threshold = -35;
+  static const int shorter_interval_tie_upper_threshold = -35;
+};
+
+template <> struct float_info<double> {
+  using carrier_uint = uint64_t;
+  static const int exponent_bits = 11;
+  static const int kappa = 2;
+  static const int big_divisor = 1000;
+  static const int small_divisor = 100;
+  static const int min_k = -292;
+  static const int max_k = 326;
+  static const int shorter_interval_tie_lower_threshold = -77;
+  static const int shorter_interval_tie_upper_threshold = -77;
+};
+
+// An 80- or 128-bit floating point number.
+template <typename T>
+struct float_info<T, enable_if_t<std::numeric_limits<T>::digits == 64 ||
+                                 std::numeric_limits<T>::digits == 113 ||
+                                 is_float128<T>::value>> {
+  using carrier_uint = detail::uint128_t;
+  static const int exponent_bits = 15;
+};
+
+// A double-double floating point number.
+template <typename T>
+struct float_info<T, enable_if_t<is_double_double<T>::value>> {
+  using carrier_uint = detail::uint128_t;
+};
+
+template <typename T> struct decimal_fp {
+  using significand_type = typename float_info<T>::carrier_uint;
+  significand_type significand;
+  int exponent;
+};
+
+template <typename T> FMT_API auto to_decimal(T x) noexcept -> decimal_fp<T>;
+}  // namespace dragonbox
+
+// Returns true iff Float has the implicit bit which is not stored.
+template <typename Float> constexpr bool has_implicit_bit() {
+  // An 80-bit FP number has a 64-bit significand an no implicit bit.
+  return std::numeric_limits<Float>::digits != 64;
+}
+
+// Returns the number of significand bits stored in Float. The implicit bit is
+// not counted since it is not stored.
+template <typename Float> constexpr int num_significand_bits() {
+  // std::numeric_limits may not support __float128.
+  return is_float128<Float>() ? 112
+                              : (std::numeric_limits<Float>::digits -
+                                 (has_implicit_bit<Float>() ? 1 : 0));
+}
+
+template <typename Float>
+constexpr auto exponent_mask() ->
+    typename dragonbox::float_info<Float>::carrier_uint {
+  using uint = typename dragonbox::float_info<Float>::carrier_uint;
+  return ((uint(1) << dragonbox::float_info<Float>::exponent_bits) - 1)
+         << num_significand_bits<Float>();
+}
+template <typename Float> constexpr auto exponent_bias() -> int {
+  // std::numeric_limits may not support __float128.
+  return is_float128<Float>() ? 16383
+                              : std::numeric_limits<Float>::max_exponent - 1;
+}
+
+// Writes the exponent exp in the form "[+-]d{2,3}" to buffer.
+template <typename Char, typename It>
+FMT_CONSTEXPR auto write_exponent(int exp, It it) -> It {
+  FMT_ASSERT(-10000 < exp && exp < 10000, "exponent out of range");
+  if (exp < 0) {
+    *it++ = static_cast<Char>('-');
+    exp = -exp;
+  } else {
+    *it++ = static_cast<Char>('+');
+  }
+  if (exp >= 100) {
+    const char* top = digits2(to_unsigned(exp / 100));
+    if (exp >= 1000) *it++ = static_cast<Char>(top[0]);
+    *it++ = static_cast<Char>(top[1]);
+    exp %= 100;
+  }
+  const char* d = digits2(to_unsigned(exp));
+  *it++ = static_cast<Char>(d[0]);
+  *it++ = static_cast<Char>(d[1]);
+  return it;
+}
+
+// A floating-point number f * pow(2, e) where F is an unsigned type.
+template <typename F> struct basic_fp {
+  F f;
+  int e;
+
+  static constexpr const int num_significand_bits =
+      static_cast<int>(sizeof(F) * num_bits<unsigned char>());
+
+  constexpr basic_fp() : f(0), e(0) {}
+  constexpr basic_fp(uint64_t f_val, int e_val) : f(f_val), e(e_val) {}
+
+  // Constructs fp from an IEEE754 floating-point number.
+  template <typename Float> FMT_CONSTEXPR basic_fp(Float n) { assign(n); }
+
+  // Assigns n to this and return true iff predecessor is closer than successor.
+  template <typename Float, FMT_ENABLE_IF(!is_double_double<Float>::value)>
+  FMT_CONSTEXPR auto assign(Float n) -> bool {
+    static_assert(std::numeric_limits<Float>::digits <= 113, "unsupported FP");
+    // Assume Float is in the format [sign][exponent][significand].
+    using carrier_uint = typename dragonbox::float_info<Float>::carrier_uint;
+    const auto num_float_significand_bits =
+        detail::num_significand_bits<Float>();
+    const auto implicit_bit = carrier_uint(1) << num_float_significand_bits;
+    const auto significand_mask = implicit_bit - 1;
+    auto u = bit_cast<carrier_uint>(n);
+    f = static_cast<F>(u & significand_mask);
+    auto biased_e = static_cast<int>((u & exponent_mask<Float>()) >>
+                                     num_float_significand_bits);
+    // The predecessor is closer if n is a normalized power of 2 (f == 0)
+    // other than the smallest normalized number (biased_e > 1).
+    auto is_predecessor_closer = f == 0 && biased_e > 1;
+    if (biased_e == 0)
+      biased_e = 1;  // Subnormals use biased exponent 1 (min exponent).
+    else if (has_implicit_bit<Float>())
+      f += static_cast<F>(implicit_bit);
+    e = biased_e - exponent_bias<Float>() - num_float_significand_bits;
+    if (!has_implicit_bit<Float>()) ++e;
+    return is_predecessor_closer;
+  }
+
+  template <typename Float, FMT_ENABLE_IF(is_double_double<Float>::value)>
+  FMT_CONSTEXPR auto assign(Float n) -> bool {
+    static_assert(std::numeric_limits<double>::is_iec559, "unsupported FP");
+    return assign(static_cast<double>(n));
+  }
+};
+
+using fp = basic_fp<unsigned long long>;
+
+// Normalizes the value converted from double and multiplied by (1 << SHIFT).
+template <int SHIFT = 0, typename F>
+FMT_CONSTEXPR basic_fp<F> normalize(basic_fp<F> value) {
+  // Handle subnormals.
+  const auto implicit_bit = F(1) << num_significand_bits<double>();
+  const auto shifted_implicit_bit = implicit_bit << SHIFT;
+  while ((value.f & shifted_implicit_bit) == 0) {
+    value.f <<= 1;
+    --value.e;
+  }
+  // Subtract 1 to account for hidden bit.
+  const auto offset = basic_fp<F>::num_significand_bits -
+                      num_significand_bits<double>() - SHIFT - 1;
+  value.f <<= offset;
+  value.e -= offset;
+  return value;
+}
+
+// Computes lhs * rhs / pow(2, 64) rounded to nearest with half-up tie breaking.
+FMT_CONSTEXPR inline uint64_t multiply(uint64_t lhs, uint64_t rhs) {
+#if FMT_USE_INT128
+  auto product = static_cast<__uint128_t>(lhs) * rhs;
+  auto f = static_cast<uint64_t>(product >> 64);
+  return (static_cast<uint64_t>(product) & (1ULL << 63)) != 0 ? f + 1 : f;
+#else
+  // Multiply 32-bit parts of significands.
+  uint64_t mask = (1ULL << 32) - 1;
+  uint64_t a = lhs >> 32, b = lhs & mask;
+  uint64_t c = rhs >> 32, d = rhs & mask;
+  uint64_t ac = a * c, bc = b * c, ad = a * d, bd = b * d;
+  // Compute mid 64-bit of result and round.
+  uint64_t mid = (bd >> 32) + (ad & mask) + (bc & mask) + (1U << 31);
+  return ac + (ad >> 32) + (bc >> 32) + (mid >> 32);
+#endif
+}
+
+FMT_CONSTEXPR inline fp operator*(fp x, fp y) {
+  return {multiply(x.f, y.f), x.e + y.e + 64};
+}
+
+template <typename T = void> struct basic_data {
+  // Normalized 64-bit significands of pow(10, k), for k = -348, -340, ..., 340.
+  // These are generated by support/compute-powers.py.
+  static constexpr uint64_t pow10_significands[87] = {
+      0xfa8fd5a0081c0288, 0xbaaee17fa23ebf76, 0x8b16fb203055ac76,
+      0xcf42894a5dce35ea, 0x9a6bb0aa55653b2d, 0xe61acf033d1a45df,
+      0xab70fe17c79ac6ca, 0xff77b1fcbebcdc4f, 0xbe5691ef416bd60c,
+      0x8dd01fad907ffc3c, 0xd3515c2831559a83, 0x9d71ac8fada6c9b5,
+      0xea9c227723ee8bcb, 0xaecc49914078536d, 0x823c12795db6ce57,
+      0xc21094364dfb5637, 0x9096ea6f3848984f, 0xd77485cb25823ac7,
+      0xa086cfcd97bf97f4, 0xef340a98172aace5, 0xb23867fb2a35b28e,
+      0x84c8d4dfd2c63f3b, 0xc5dd44271ad3cdba, 0x936b9fcebb25c996,
+      0xdbac6c247d62a584, 0xa3ab66580d5fdaf6, 0xf3e2f893dec3f126,
+      0xb5b5ada8aaff80b8, 0x87625f056c7c4a8b, 0xc9bcff6034c13053,
+      0x964e858c91ba2655, 0xdff9772470297ebd, 0xa6dfbd9fb8e5b88f,
+      0xf8a95fcf88747d94, 0xb94470938fa89bcf, 0x8a08f0f8bf0f156b,
+      0xcdb02555653131b6, 0x993fe2c6d07b7fac, 0xe45c10c42a2b3b06,
+      0xaa242499697392d3, 0xfd87b5f28300ca0e, 0xbce5086492111aeb,
+      0x8cbccc096f5088cc, 0xd1b71758e219652c, 0x9c40000000000000,
+      0xe8d4a51000000000, 0xad78ebc5ac620000, 0x813f3978f8940984,
+      0xc097ce7bc90715b3, 0x8f7e32ce7bea5c70, 0xd5d238a4abe98068,
+      0x9f4f2726179a2245, 0xed63a231d4c4fb27, 0xb0de65388cc8ada8,
+      0x83c7088e1aab65db, 0xc45d1df942711d9a, 0x924d692ca61be758,
+      0xda01ee641a708dea, 0xa26da3999aef774a, 0xf209787bb47d6b85,
+      0xb454e4a179dd1877, 0x865b86925b9bc5c2, 0xc83553c5c8965d3d,
+      0x952ab45cfa97a0b3, 0xde469fbd99a05fe3, 0xa59bc234db398c25,
+      0xf6c69a72a3989f5c, 0xb7dcbf5354e9bece, 0x88fcf317f22241e2,
+      0xcc20ce9bd35c78a5, 0x98165af37b2153df, 0xe2a0b5dc971f303a,
+      0xa8d9d1535ce3b396, 0xfb9b7cd9a4a7443c, 0xbb764c4ca7a44410,
+      0x8bab8eefb6409c1a, 0xd01fef10a657842c, 0x9b10a4e5e9913129,
+      0xe7109bfba19c0c9d, 0xac2820d9623bf429, 0x80444b5e7aa7cf85,
+      0xbf21e44003acdd2d, 0x8e679c2f5e44ff8f, 0xd433179d9c8cb841,
+      0x9e19db92b4e31ba9, 0xeb96bf6ebadf77d9, 0xaf87023b9bf0ee6b,
+  };
+
+#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409
+#  pragma GCC diagnostic push
+#  pragma GCC diagnostic ignored "-Wnarrowing"
+#endif
+  // Binary exponents of pow(10, k), for k = -348, -340, ..., 340, corresponding
+  // to significands above.
+  static constexpr int16_t pow10_exponents[87] = {
+      -1220, -1193, -1166, -1140, -1113, -1087, -1060, -1034, -1007, -980, -954,
+      -927,  -901,  -874,  -847,  -821,  -794,  -768,  -741,  -715,  -688, -661,
+      -635,  -608,  -582,  -555,  -529,  -502,  -475,  -449,  -422,  -396, -369,
+      -343,  -316,  -289,  -263,  -236,  -210,  -183,  -157,  -130,  -103, -77,
+      -50,   -24,   3,     30,    56,    83,    109,   136,   162,   189,  216,
+      242,   269,   295,   322,   348,   375,   402,   428,   455,   481,  508,
+      534,   561,   588,   614,   641,   667,   694,   720,   747,   774,  800,
+      827,   853,   880,   907,   933,   960,   986,   1013,  1039,  1066};
+#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409
+#  pragma GCC diagnostic pop
+#endif
+
+  static constexpr uint64_t power_of_10_64[20] = {
+      1, FMT_POWERS_OF_10(1ULL), FMT_POWERS_OF_10(1000000000ULL),
+      10000000000000000000ULL};
+};
+
+#if FMT_CPLUSPLUS < 201703L
+template <typename T> constexpr uint64_t basic_data<T>::pow10_significands[];
+template <typename T> constexpr int16_t basic_data<T>::pow10_exponents[];
+template <typename T> constexpr uint64_t basic_data<T>::power_of_10_64[];
+#endif
+
+// This is a struct rather than an alias to avoid shadowing warnings in gcc.
+struct data : basic_data<> {};
+
+// Returns a cached power of 10 `c_k = c_k.f * pow(2, c_k.e)` such that its
+// (binary) exponent satisfies `min_exponent <= c_k.e <= min_exponent + 28`.
+FMT_CONSTEXPR inline fp get_cached_power(int min_exponent,
+                                         int& pow10_exponent) {
+  const int shift = 32;
+  // log10(2) = 0x0.4d104d427de7fbcc...
+  const int64_t significand = 0x4d104d427de7fbcc;
+  int index = static_cast<int>(
+      ((min_exponent + fp::num_significand_bits - 1) * (significand >> shift) +
+       ((int64_t(1) << shift) - 1))  // ceil
+      >> 32                          // arithmetic shift
+  );
+  // Decimal exponent of the first (smallest) cached power of 10.
+  const int first_dec_exp = -348;
+  // Difference between 2 consecutive decimal exponents in cached powers of 10.
+  const int dec_exp_step = 8;
+  index = (index - first_dec_exp - 1) / dec_exp_step + 1;
+  pow10_exponent = first_dec_exp + index * dec_exp_step;
+  // Using *(x + index) instead of x[index] avoids an issue with some compilers
+  // using the EDG frontend (e.g. nvhpc/22.3 in C++17 mode).
+  return {*(data::pow10_significands + index),
+          *(data::pow10_exponents + index)};
+}
+
+#ifndef _MSC_VER
+#  define FMT_SNPRINTF snprintf
+#else
+FMT_API auto fmt_snprintf(char* buf, size_t size, const char* fmt, ...) -> int;
+#  define FMT_SNPRINTF fmt_snprintf
+#endif  // _MSC_VER
+
+// Formats a floating-point number with snprintf using the hexfloat format.
+template <typename T>
+auto snprintf_float(T value, int precision, float_specs specs,
+                    buffer<char>& buf) -> int {
+  // Buffer capacity must be non-zero, otherwise MSVC's vsnprintf_s will fail.
+  FMT_ASSERT(buf.capacity() > buf.size(), "empty buffer");
+  FMT_ASSERT(specs.format == float_format::hex, "");
+  static_assert(!std::is_same<T, float>::value, "");
+
+  // Build the format string.
+  char format[7];  // The longest format is "%#.*Le".
+  char* format_ptr = format;
+  *format_ptr++ = '%';
+  if (specs.showpoint) *format_ptr++ = '#';
+  if (precision >= 0) {
+    *format_ptr++ = '.';
+    *format_ptr++ = '*';
+  }
+  if (std::is_same<T, long double>()) *format_ptr++ = 'L';
+  *format_ptr++ = specs.upper ? 'A' : 'a';
+  *format_ptr = '\0';
+
+  // Format using snprintf.
+  auto offset = buf.size();
+  for (;;) {
+    auto begin = buf.data() + offset;
+    auto capacity = buf.capacity() - offset;
+    abort_fuzzing_if(precision > 100000);
+    // Suppress the warning about a nonliteral format string.
+    // Cannot use auto because of a bug in MinGW (#1532).
+    int (*snprintf_ptr)(char*, size_t, const char*, ...) = FMT_SNPRINTF;
+    int result = precision >= 0
+                     ? snprintf_ptr(begin, capacity, format, precision, value)
+                     : snprintf_ptr(begin, capacity, format, value);
+    if (result < 0) {
+      // The buffer will grow exponentially.
+      buf.try_reserve(buf.capacity() + 1);
+      continue;
+    }
+    auto size = to_unsigned(result);
+    // Size equal to capacity means that the last character was truncated.
+    if (size < capacity) {
+      buf.try_resize(size + offset);
+      return 0;
+    }
+    buf.try_reserve(size + offset + 1);  // Add 1 for the terminating '\0'.
+  }
+}
+
+template <typename T>
+using convert_float_result =
+    conditional_t<std::is_same<T, float>::value || sizeof(T) == sizeof(double),
+                  double, T>;
+
+template <typename T>
+constexpr auto convert_float(T value) -> convert_float_result<T> {
+  return static_cast<convert_float_result<T>>(value);
+}
+
+template <typename OutputIt, typename Char>
+FMT_NOINLINE FMT_CONSTEXPR auto fill(OutputIt it, size_t n,
+                                     const fill_t<Char>& fill) -> OutputIt {
+  auto fill_size = fill.size();
+  if (fill_size == 1) return detail::fill_n(it, n, fill[0]);
+  auto data = fill.data();
+  for (size_t i = 0; i < n; ++i)
+    it = copy_str<Char>(data, data + fill_size, it);
+  return it;
+}
+
+// Writes the output of f, padded according to format specifications in specs.
+// size: output size in code units.
+// width: output display width in (terminal) column positions.
+template <align::type align = align::left, typename OutputIt, typename Char,
+          typename F>
+FMT_CONSTEXPR auto write_padded(OutputIt out,
+                                const basic_format_specs<Char>& specs,
+                                size_t size, size_t width, F&& f) -> OutputIt {
+  static_assert(align == align::left || align == align::right, "");
+  unsigned spec_width = to_unsigned(specs.width);
+  size_t padding = spec_width > width ? spec_width - width : 0;
+  // Shifts are encoded as string literals because static constexpr is not
+  // supported in constexpr functions.
+  auto* shifts = align == align::left ? "\x1f\x1f\x00\x01" : "\x00\x1f\x00\x01";
+  size_t left_padding = padding >> shifts[specs.align];
+  size_t right_padding = padding - left_padding;
+  auto it = reserve(out, size + padding * specs.fill.size());
+  if (left_padding != 0) it = fill(it, left_padding, specs.fill);
+  it = f(it);
+  if (right_padding != 0) it = fill(it, right_padding, specs.fill);
+  return base_iterator(out, it);
+}
+
+template <align::type align = align::left, typename OutputIt, typename Char,
+          typename F>
+constexpr auto write_padded(OutputIt out, const basic_format_specs<Char>& specs,
+                            size_t size, F&& f) -> OutputIt {
+  return write_padded<align>(out, specs, size, size, f);
+}
+
+template <align::type align = align::left, typename Char, typename OutputIt>
+FMT_CONSTEXPR auto write_bytes(OutputIt out, string_view bytes,
+                               const basic_format_specs<Char>& specs)
+    -> OutputIt {
+  return write_padded<align>(
+      out, specs, bytes.size(), [bytes](reserve_iterator<OutputIt> it) {
+        const char* data = bytes.data();
+        return copy_str<Char>(data, data + bytes.size(), it);
+      });
+}
+
+template <typename Char, typename OutputIt, typename UIntPtr>
+auto write_ptr(OutputIt out, UIntPtr value,
+               const basic_format_specs<Char>* specs) -> OutputIt {
+  int num_digits = count_digits<4>(value);
+  auto size = to_unsigned(num_digits) + size_t(2);
+  auto write = [=](reserve_iterator<OutputIt> it) {
+    *it++ = static_cast<Char>('0');
+    *it++ = static_cast<Char>('x');
+    return format_uint<4, Char>(it, value, num_digits);
+  };
+  return specs ? write_padded<align::right>(out, *specs, size, write)
+               : base_iterator(out, write(reserve(out, size)));
+}
+
+// Returns true iff the code point cp is printable.
+FMT_API auto is_printable(uint32_t cp) -> bool;
+
+inline auto needs_escape(uint32_t cp) -> bool {
+  return cp < 0x20 || cp == 0x7f || cp == '"' || cp == '\\' ||
+         !is_printable(cp);
+}
+
+template <typename Char> struct find_escape_result {
+  const Char* begin;
+  const Char* end;
+  uint32_t cp;
+};
+
+template <typename Char>
+using make_unsigned_char =
+    typename conditional_t<std::is_integral<Char>::value,
+                           std::make_unsigned<Char>,
+                           type_identity<uint32_t>>::type;
+
+template <typename Char>
+auto find_escape(const Char* begin, const Char* end)
+    -> find_escape_result<Char> {
+  for (; begin != end; ++begin) {
+    uint32_t cp = static_cast<make_unsigned_char<Char>>(*begin);
+    if (const_check(sizeof(Char) == 1) && cp >= 0x80) continue;
+    if (needs_escape(cp)) return {begin, begin + 1, cp};
+  }
+  return {begin, nullptr, 0};
+}
+
+inline auto find_escape(const char* begin, const char* end)
+    -> find_escape_result<char> {
+  if (!is_utf8()) return find_escape<char>(begin, end);
+  auto result = find_escape_result<char>{end, nullptr, 0};
+  for_each_codepoint(string_view(begin, to_unsigned(end - begin)),
+                     [&](uint32_t cp, string_view sv) {
+                       if (needs_escape(cp)) {
+                         result = {sv.begin(), sv.end(), cp};
+                         return false;
+                       }
+                       return true;
+                     });
+  return result;
+}
+
+#define FMT_STRING_IMPL(s, base, explicit)                                    \
+  [] {                                                                        \
+    /* Use the hidden visibility as a workaround for a GCC bug (#1973). */    \
+    /* Use a macro-like name to avoid shadowing warnings. */                  \
+    struct FMT_GCC_VISIBILITY_HIDDEN FMT_COMPILE_STRING : base {              \
+      using char_type FMT_MAYBE_UNUSED = fmt::remove_cvref_t<decltype(s[0])>; \
+      FMT_MAYBE_UNUSED FMT_CONSTEXPR explicit                                 \
+      operator fmt::basic_string_view<char_type>() const {                    \
+        return fmt::detail_exported::compile_string_to_view<char_type>(s);    \
+      }                                                                       \
+    };                                                                        \
+    return FMT_COMPILE_STRING();                                              \
+  }()
+
+/**
+  \rst
+  Constructs a compile-time format string from a string literal *s*.
+
+  **Example**::
+
+    // A compile-time error because 'd' is an invalid specifier for strings.
+    std::string s = fmt::format(FMT_STRING("{:d}"), "foo");
+  \endrst
+ */
+#define FMT_STRING(s) FMT_STRING_IMPL(s, fmt::detail::compile_string, )
+
+template <size_t width, typename Char, typename OutputIt>
+auto write_codepoint(OutputIt out, char prefix, uint32_t cp) -> OutputIt {
+  *out++ = static_cast<Char>('\\');
+  *out++ = static_cast<Char>(prefix);
+  Char buf[width];
+  fill_n(buf, width, static_cast<Char>('0'));
+  format_uint<4>(buf, cp, width);
+  return copy_str<Char>(buf, buf + width, out);
+}
+
+template <typename OutputIt, typename Char>
+auto write_escaped_cp(OutputIt out, const find_escape_result<Char>& escape)
+    -> OutputIt {
+  auto c = static_cast<Char>(escape.cp);
+  switch (escape.cp) {
+  case '\n':
+    *out++ = static_cast<Char>('\\');
+    c = static_cast<Char>('n');
+    break;
+  case '\r':
+    *out++ = static_cast<Char>('\\');
+    c = static_cast<Char>('r');
+    break;
+  case '\t':
+    *out++ = static_cast<Char>('\\');
+    c = static_cast<Char>('t');
+    break;
+  case '"':
+    FMT_FALLTHROUGH;
+  case '\'':
+    FMT_FALLTHROUGH;
+  case '\\':
+    *out++ = static_cast<Char>('\\');
+    break;
+  default:
+    if (is_utf8()) {
+      if (escape.cp < 0x100) {
+        return write_codepoint<2, Char>(out, 'x', escape.cp);
+      }
+      if (escape.cp < 0x10000) {
+        return write_codepoint<4, Char>(out, 'u', escape.cp);
+      }
+      if (escape.cp < 0x110000) {
+        return write_codepoint<8, Char>(out, 'U', escape.cp);
+      }
+    }
+    for (Char escape_char : basic_string_view<Char>(
+             escape.begin, to_unsigned(escape.end - escape.begin))) {
+      out = write_codepoint<2, Char>(out, 'x',
+                                     static_cast<uint32_t>(escape_char) & 0xFF);
+    }
+    return out;
+  }
+  *out++ = c;
+  return out;
+}
+
+template <typename Char, typename OutputIt>
+auto write_escaped_string(OutputIt out, basic_string_view<Char> str)
+    -> OutputIt {
+  *out++ = static_cast<Char>('"');
+  auto begin = str.begin(), end = str.end();
+  do {
+    auto escape = find_escape(begin, end);
+    out = copy_str<Char>(begin, escape.begin, out);
+    begin = escape.end;
+    if (!begin) break;
+    out = write_escaped_cp<OutputIt, Char>(out, escape);
+  } while (begin != end);
+  *out++ = static_cast<Char>('"');
+  return out;
+}
+
+template <typename Char, typename OutputIt>
+auto write_escaped_char(OutputIt out, Char v) -> OutputIt {
+  *out++ = static_cast<Char>('\'');
+  if ((needs_escape(static_cast<uint32_t>(v)) && v != static_cast<Char>('"')) ||
+      v == static_cast<Char>('\'')) {
+    out = write_escaped_cp(
+        out, find_escape_result<Char>{&v, &v + 1, static_cast<uint32_t>(v)});
+  } else {
+    *out++ = v;
+  }
+  *out++ = static_cast<Char>('\'');
+  return out;
+}
+
+template <typename Char, typename OutputIt>
+FMT_CONSTEXPR auto write_char(OutputIt out, Char value,
+                              const basic_format_specs<Char>& specs)
+    -> OutputIt {
+  bool is_debug = specs.type == presentation_type::debug;
+  return write_padded(out, specs, 1, [=](reserve_iterator<OutputIt> it) {
+    if (is_debug) return write_escaped_char(it, value);
+    *it++ = value;
+    return it;
+  });
+}
+template <typename Char, typename OutputIt>
+FMT_CONSTEXPR auto write(OutputIt out, Char value,
+                         const basic_format_specs<Char>& specs,
+                         locale_ref loc = {}) -> OutputIt {
+  return check_char_specs(specs)
+             ? write_char(out, value, specs)
+             : write(out, static_cast<int>(value), specs, loc);
+}
+
+// Data for write_int that doesn't depend on output iterator type. It is used to
+// avoid template code bloat.
+template <typename Char> struct write_int_data {
+  size_t size;
+  size_t padding;
+
+  FMT_CONSTEXPR write_int_data(int num_digits, unsigned prefix,
+                               const basic_format_specs<Char>& specs)
+      : size((prefix >> 24) + to_unsigned(num_digits)), padding(0) {
+    if (specs.align == align::numeric) {
+      auto width = to_unsigned(specs.width);
+      if (width > size) {
+        padding = width - size;
+        size = width;
+      }
+    } else if (specs.precision > num_digits) {
+      size = (prefix >> 24) + to_unsigned(specs.precision);
+      padding = to_unsigned(specs.precision - num_digits);
+    }
+  }
+};
+
+// Writes an integer in the format
+//   <left-padding><prefix><numeric-padding><digits><right-padding>
+// where <digits> are written by write_digits(it).
+// prefix contains chars in three lower bytes and the size in the fourth byte.
+template <typename OutputIt, typename Char, typename W>
+FMT_CONSTEXPR FMT_INLINE auto write_int(OutputIt out, int num_digits,
+                                        unsigned prefix,
+                                        const basic_format_specs<Char>& specs,
+                                        W write_digits) -> OutputIt {
+  // Slightly faster check for specs.width == 0 && specs.precision == -1.
+  if ((specs.width | (specs.precision + 1)) == 0) {
+    auto it = reserve(out, to_unsigned(num_digits) + (prefix >> 24));
+    if (prefix != 0) {
+      for (unsigned p = prefix & 0xffffff; p != 0; p >>= 8)
+        *it++ = static_cast<Char>(p & 0xff);
+    }
+    return base_iterator(out, write_digits(it));
+  }
+  auto data = write_int_data<Char>(num_digits, prefix, specs);
+  return write_padded<align::right>(
+      out, specs, data.size, [=](reserve_iterator<OutputIt> it) {
+        for (unsigned p = prefix & 0xffffff; p != 0; p >>= 8)
+          *it++ = static_cast<Char>(p & 0xff);
+        it = detail::fill_n(it, data.padding, static_cast<Char>('0'));
+        return write_digits(it);
+      });
+}
+
+template <typename Char> class digit_grouping {
+ private:
+  thousands_sep_result<Char> sep_;
+
+  struct next_state {
+    std::string::const_iterator group;
+    int pos;
+  };
+  next_state initial_state() const { return {sep_.grouping.begin(), 0}; }
+
+  // Returns the next digit group separator position.
+  int next(next_state& state) const {
+    if (!sep_.thousands_sep) return max_value<int>();
+    if (state.group == sep_.grouping.end())
+      return state.pos += sep_.grouping.back();
+    if (*state.group <= 0 || *state.group == max_value<char>())
+      return max_value<int>();
+    state.pos += *state.group++;
+    return state.pos;
+  }
+
+ public:
+  explicit digit_grouping(locale_ref loc, bool localized = true) {
+    if (localized)
+      sep_ = thousands_sep<Char>(loc);
+    else
+      sep_.thousands_sep = Char();
+  }
+  explicit digit_grouping(thousands_sep_result<Char> sep) : sep_(sep) {}
+
+  Char separator() const { return sep_.thousands_sep; }
+
+  int count_separators(int num_digits) const {
+    int count = 0;
+    auto state = initial_state();
+    while (num_digits > next(state)) ++count;
+    return count;
+  }
+
+  // Applies grouping to digits and write the output to out.
+  template <typename Out, typename C>
+  Out apply(Out out, basic_string_view<C> digits) const {
+    auto num_digits = static_cast<int>(digits.size());
+    auto separators = basic_memory_buffer<int>();
+    separators.push_back(0);
+    auto state = initial_state();
+    while (int i = next(state)) {
+      if (i >= num_digits) break;
+      separators.push_back(i);
+    }
+    for (int i = 0, sep_index = static_cast<int>(separators.size() - 1);
+         i < num_digits; ++i) {
+      if (num_digits - i == separators[sep_index]) {
+        *out++ = separator();
+        --sep_index;
+      }
+      *out++ = static_cast<Char>(digits[to_unsigned(i)]);
+    }
+    return out;
+  }
+};
+
+template <typename OutputIt, typename UInt, typename Char>
+auto write_int_localized(OutputIt out, UInt value, unsigned prefix,
+                         const basic_format_specs<Char>& specs,
+                         const digit_grouping<Char>& grouping) -> OutputIt {
+  static_assert(std::is_same<uint64_or_128_t<UInt>, UInt>::value, "");
+  int num_digits = count_digits(value);
+  char digits[40];
+  format_decimal(digits, value, num_digits);
+  unsigned size = to_unsigned((prefix != 0 ? 1 : 0) + num_digits +
+                              grouping.count_separators(num_digits));
+  return write_padded<align::right>(
+      out, specs, size, size, [&](reserve_iterator<OutputIt> it) {
+        if (prefix != 0) {
+          char sign = static_cast<char>(prefix);
+          *it++ = static_cast<Char>(sign);
+        }
+        return grouping.apply(it, string_view(digits, to_unsigned(num_digits)));
+      });
+}
+
+template <typename OutputIt, typename UInt, typename Char>
+auto write_int_localized(OutputIt& out, UInt value, unsigned prefix,
+                         const basic_format_specs<Char>& specs, locale_ref loc)
+    -> bool {
+  auto grouping = digit_grouping<Char>(loc);
+  out = write_int_localized(out, value, prefix, specs, grouping);
+  return true;
+}
+
+FMT_CONSTEXPR inline void prefix_append(unsigned& prefix, unsigned value) {
+  prefix |= prefix != 0 ? value << 8 : value;
+  prefix += (1u + (value > 0xff ? 1 : 0)) << 24;
+}
+
+template <typename UInt> struct write_int_arg {
+  UInt abs_value;
+  unsigned prefix;
+};
+
+template <typename T>
+FMT_CONSTEXPR auto make_write_int_arg(T value, sign_t sign)
+    -> write_int_arg<uint32_or_64_or_128_t<T>> {
+  auto prefix = 0u;
+  auto abs_value = static_cast<uint32_or_64_or_128_t<T>>(value);
+  if (is_negative(value)) {
+    prefix = 0x01000000 | '-';
+    abs_value = 0 - abs_value;
+  } else {
+    constexpr const unsigned prefixes[4] = {0, 0, 0x1000000u | '+',
+                                            0x1000000u | ' '};
+    prefix = prefixes[sign];
+  }
+  return {abs_value, prefix};
+}
+
+template <typename Char, typename OutputIt, typename T>
+FMT_CONSTEXPR FMT_INLINE auto write_int(OutputIt out, write_int_arg<T> arg,
+                                        const basic_format_specs<Char>& specs,
+                                        locale_ref loc) -> OutputIt {
+  static_assert(std::is_same<T, uint32_or_64_or_128_t<T>>::value, "");
+  auto abs_value = arg.abs_value;
+  auto prefix = arg.prefix;
+  switch (specs.type) {
+  case presentation_type::none:
+  case presentation_type::dec: {
+    if (specs.localized &&
+        write_int_localized(out, static_cast<uint64_or_128_t<T>>(abs_value),
+                            prefix, specs, loc)) {
+      return out;
+    }
+    auto num_digits = count_digits(abs_value);
+    return write_int(
+        out, num_digits, prefix, specs, [=](reserve_iterator<OutputIt> it) {
+          return format_decimal<Char>(it, abs_value, num_digits).end;
+        });
+  }
+  case presentation_type::hex_lower:
+  case presentation_type::hex_upper: {
+    bool upper = specs.type == presentation_type::hex_upper;
+    if (specs.alt)
+      prefix_append(prefix, unsigned(upper ? 'X' : 'x') << 8 | '0');
+    int num_digits = count_digits<4>(abs_value);
+    return write_int(
+        out, num_digits, prefix, specs, [=](reserve_iterator<OutputIt> it) {
+          return format_uint<4, Char>(it, abs_value, num_digits, upper);
+        });
+  }
+  case presentation_type::bin_lower:
+  case presentation_type::bin_upper: {
+    bool upper = specs.type == presentation_type::bin_upper;
+    if (specs.alt)
+      prefix_append(prefix, unsigned(upper ? 'B' : 'b') << 8 | '0');
+    int num_digits = count_digits<1>(abs_value);
+    return write_int(out, num_digits, prefix, specs,
+                     [=](reserve_iterator<OutputIt> it) {
+                       return format_uint<1, Char>(it, abs_value, num_digits);
+                     });
+  }
+  case presentation_type::oct: {
+    int num_digits = count_digits<3>(abs_value);
+    // Octal prefix '0' is counted as a digit, so only add it if precision
+    // is not greater than the number of digits.
+    if (specs.alt && specs.precision <= num_digits && abs_value != 0)
+      prefix_append(prefix, '0');
+    return write_int(out, num_digits, prefix, specs,
+                     [=](reserve_iterator<OutputIt> it) {
+                       return format_uint<3, Char>(it, abs_value, num_digits);
+                     });
+  }
+  case presentation_type::chr:
+    return write_char(out, static_cast<Char>(abs_value), specs);
+  default:
+    throw_format_error("invalid type specifier");
+  }
+  return out;
+}
+template <typename Char, typename OutputIt, typename T>
+FMT_CONSTEXPR FMT_NOINLINE auto write_int_noinline(
+    OutputIt out, write_int_arg<T> arg, const basic_format_specs<Char>& specs,
+    locale_ref loc) -> OutputIt {
+  return write_int(out, arg, specs, loc);
+}
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(is_integral<T>::value &&
+                        !std::is_same<T, bool>::value &&
+                        std::is_same<OutputIt, buffer_appender<Char>>::value)>
+FMT_CONSTEXPR FMT_INLINE auto write(OutputIt out, T value,
+                                    const basic_format_specs<Char>& specs,
+                                    locale_ref loc) -> OutputIt {
+  return write_int_noinline(out, make_write_int_arg(value, specs.sign), specs,
+                            loc);
+}
+// An inlined version of write used in format string compilation.
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(is_integral<T>::value &&
+                        !std::is_same<T, bool>::value &&
+                        !std::is_same<OutputIt, buffer_appender<Char>>::value)>
+FMT_CONSTEXPR FMT_INLINE auto write(OutputIt out, T value,
+                                    const basic_format_specs<Char>& specs,
+                                    locale_ref loc) -> OutputIt {
+  return write_int(out, make_write_int_arg(value, specs.sign), specs, loc);
+}
+
+// An output iterator that counts the number of objects written to it and
+// discards them.
+class counting_iterator {
+ private:
+  size_t count_;
+
+ public:
+  using iterator_category = std::output_iterator_tag;
+  using difference_type = std::ptrdiff_t;
+  using pointer = void;
+  using reference = void;
+  FMT_UNCHECKED_ITERATOR(counting_iterator);
+
+  struct value_type {
+    template <typename T> FMT_CONSTEXPR void operator=(const T&) {}
+  };
+
+  FMT_CONSTEXPR counting_iterator() : count_(0) {}
+
+  FMT_CONSTEXPR size_t count() const { return count_; }
+
+  FMT_CONSTEXPR counting_iterator& operator++() {
+    ++count_;
+    return *this;
+  }
+  FMT_CONSTEXPR counting_iterator operator++(int) {
+    auto it = *this;
+    ++*this;
+    return it;
+  }
+
+  FMT_CONSTEXPR friend counting_iterator operator+(counting_iterator it,
+                                                   difference_type n) {
+    it.count_ += static_cast<size_t>(n);
+    return it;
+  }
+
+  FMT_CONSTEXPR value_type operator*() const { return {}; }
+};
+
+template <typename Char, typename OutputIt>
+FMT_CONSTEXPR auto write(OutputIt out, basic_string_view<Char> s,
+                         const basic_format_specs<Char>& specs) -> OutputIt {
+  auto data = s.data();
+  auto size = s.size();
+  if (specs.precision >= 0 && to_unsigned(specs.precision) < size)
+    size = code_point_index(s, to_unsigned(specs.precision));
+  bool is_debug = specs.type == presentation_type::debug;
+  size_t width = 0;
+  if (specs.width != 0) {
+    if (is_debug)
+      width = write_escaped_string(counting_iterator{}, s).count();
+    else
+      width = compute_width(basic_string_view<Char>(data, size));
+  }
+  return write_padded(out, specs, size, width,
+                      [=](reserve_iterator<OutputIt> it) {
+                        if (is_debug) return write_escaped_string(it, s);
+                        return copy_str<Char>(data, data + size, it);
+                      });
+}
+template <typename Char, typename OutputIt>
+FMT_CONSTEXPR auto write(OutputIt out,
+                         basic_string_view<type_identity_t<Char>> s,
+                         const basic_format_specs<Char>& specs, locale_ref)
+    -> OutputIt {
+  check_string_type_spec(specs.type);
+  return write(out, s, specs);
+}
+template <typename Char, typename OutputIt>
+FMT_CONSTEXPR auto write(OutputIt out, const Char* s,
+                         const basic_format_specs<Char>& specs, locale_ref)
+    -> OutputIt {
+  return check_cstring_type_spec(specs.type)
+             ? write(out, basic_string_view<Char>(s), specs, {})
+             : write_ptr<Char>(out, bit_cast<uintptr_t>(s), &specs);
+}
+
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(is_integral<T>::value &&
+                        !std::is_same<T, bool>::value &&
+                        !std::is_same<T, Char>::value)>
+FMT_CONSTEXPR auto write(OutputIt out, T value) -> OutputIt {
+  auto abs_value = static_cast<uint32_or_64_or_128_t<T>>(value);
+  bool negative = is_negative(value);
+  // Don't do -abs_value since it trips unsigned-integer-overflow sanitizer.
+  if (negative) abs_value = ~abs_value + 1;
+  int num_digits = count_digits(abs_value);
+  auto size = (negative ? 1 : 0) + static_cast<size_t>(num_digits);
+  auto it = reserve(out, size);
+  if (auto ptr = to_pointer<Char>(it, size)) {
+    if (negative) *ptr++ = static_cast<Char>('-');
+    format_decimal<Char>(ptr, abs_value, num_digits);
+    return out;
+  }
+  if (negative) *it++ = static_cast<Char>('-');
+  it = format_decimal<Char>(it, abs_value, num_digits).end;
+  return base_iterator(out, it);
+}
+
+template <typename Char, typename OutputIt>
+FMT_CONSTEXPR20 auto write_nonfinite(OutputIt out, bool isnan,
+                                     basic_format_specs<Char> specs,
+                                     const float_specs& fspecs) -> OutputIt {
+  auto str =
+      isnan ? (fspecs.upper ? "NAN" : "nan") : (fspecs.upper ? "INF" : "inf");
+  constexpr size_t str_size = 3;
+  auto sign = fspecs.sign;
+  auto size = str_size + (sign ? 1 : 0);
+  // Replace '0'-padding with space for non-finite values.
+  const bool is_zero_fill =
+      specs.fill.size() == 1 && *specs.fill.data() == static_cast<Char>('0');
+  if (is_zero_fill) specs.fill[0] = static_cast<Char>(' ');
+  return write_padded(out, specs, size, [=](reserve_iterator<OutputIt> it) {
+    if (sign) *it++ = detail::sign<Char>(sign);
+    return copy_str<Char>(str, str + str_size, it);
+  });
+}
+
+// A decimal floating-point number significand * pow(10, exp).
+struct big_decimal_fp {
+  const char* significand;
+  int significand_size;
+  int exponent;
+};
+
+constexpr auto get_significand_size(const big_decimal_fp& f) -> int {
+  return f.significand_size;
+}
+template <typename T>
+inline auto get_significand_size(const dragonbox::decimal_fp<T>& f) -> int {
+  return count_digits(f.significand);
+}
+
+template <typename Char, typename OutputIt>
+constexpr auto write_significand(OutputIt out, const char* significand,
+                                 int significand_size) -> OutputIt {
+  return copy_str<Char>(significand, significand + significand_size, out);
+}
+template <typename Char, typename OutputIt, typename UInt>
+inline auto write_significand(OutputIt out, UInt significand,
+                              int significand_size) -> OutputIt {
+  return format_decimal<Char>(out, significand, significand_size).end;
+}
+template <typename Char, typename OutputIt, typename T, typename Grouping>
+FMT_CONSTEXPR20 auto write_significand(OutputIt out, T significand,
+                                       int significand_size, int exponent,
+                                       const Grouping& grouping) -> OutputIt {
+  if (!grouping.separator()) {
+    out = write_significand<Char>(out, significand, significand_size);
+    return detail::fill_n(out, exponent, static_cast<Char>('0'));
+  }
+  auto buffer = memory_buffer();
+  write_significand<char>(appender(buffer), significand, significand_size);
+  detail::fill_n(appender(buffer), exponent, '0');
+  return grouping.apply(out, string_view(buffer.data(), buffer.size()));
+}
+
+template <typename Char, typename UInt,
+          FMT_ENABLE_IF(std::is_integral<UInt>::value)>
+inline auto write_significand(Char* out, UInt significand, int significand_size,
+                              int integral_size, Char decimal_point) -> Char* {
+  if (!decimal_point)
+    return format_decimal(out, significand, significand_size).end;
+  out += significand_size + 1;
+  Char* end = out;
+  int floating_size = significand_size - integral_size;
+  for (int i = floating_size / 2; i > 0; --i) {
+    out -= 2;
+    copy2(out, digits2(static_cast<std::size_t>(significand % 100)));
+    significand /= 100;
+  }
+  if (floating_size % 2 != 0) {
+    *--out = static_cast<Char>('0' + significand % 10);
+    significand /= 10;
+  }
+  *--out = decimal_point;
+  format_decimal(out - integral_size, significand, integral_size);
+  return end;
+}
+
+template <typename OutputIt, typename UInt, typename Char,
+          FMT_ENABLE_IF(!std::is_pointer<remove_cvref_t<OutputIt>>::value)>
+inline auto write_significand(OutputIt out, UInt significand,
+                              int significand_size, int integral_size,
+                              Char decimal_point) -> OutputIt {
+  // Buffer is large enough to hold digits (digits10 + 1) and a decimal point.
+  Char buffer[digits10<UInt>() + 2];
+  auto end = write_significand(buffer, significand, significand_size,
+                               integral_size, decimal_point);
+  return detail::copy_str_noinline<Char>(buffer, end, out);
+}
+
+template <typename OutputIt, typename Char>
+FMT_CONSTEXPR auto write_significand(OutputIt out, const char* significand,
+                                     int significand_size, int integral_size,
+                                     Char decimal_point) -> OutputIt {
+  out = detail::copy_str_noinline<Char>(significand,
+                                        significand + integral_size, out);
+  if (!decimal_point) return out;
+  *out++ = decimal_point;
+  return detail::copy_str_noinline<Char>(significand + integral_size,
+                                         significand + significand_size, out);
+}
+
+template <typename OutputIt, typename Char, typename T, typename Grouping>
+FMT_CONSTEXPR20 auto write_significand(OutputIt out, T significand,
+                                       int significand_size, int integral_size,
+                                       Char decimal_point,
+                                       const Grouping& grouping) -> OutputIt {
+  if (!grouping.separator()) {
+    return write_significand(out, significand, significand_size, integral_size,
+                             decimal_point);
+  }
+  auto buffer = basic_memory_buffer<Char>();
+  write_significand(buffer_appender<Char>(buffer), significand,
+                    significand_size, integral_size, decimal_point);
+  grouping.apply(
+      out, basic_string_view<Char>(buffer.data(), to_unsigned(integral_size)));
+  return detail::copy_str_noinline<Char>(buffer.data() + integral_size,
+                                         buffer.end(), out);
+}
+
+template <typename OutputIt, typename DecimalFP, typename Char,
+          typename Grouping = digit_grouping<Char>>
+FMT_CONSTEXPR20 auto do_write_float(OutputIt out, const DecimalFP& f,
+                                    const basic_format_specs<Char>& specs,
+                                    float_specs fspecs, locale_ref loc)
+    -> OutputIt {
+  auto significand = f.significand;
+  int significand_size = get_significand_size(f);
+  const Char zero = static_cast<Char>('0');
+  auto sign = fspecs.sign;
+  size_t size = to_unsigned(significand_size) + (sign ? 1 : 0);
+  using iterator = reserve_iterator<OutputIt>;
+
+  Char decimal_point =
+      fspecs.locale ? detail::decimal_point<Char>(loc) : static_cast<Char>('.');
+
+  int output_exp = f.exponent + significand_size - 1;
+  auto use_exp_format = [=]() {
+    if (fspecs.format == float_format::exp) return true;
+    if (fspecs.format != float_format::general) return false;
+    // Use the fixed notation if the exponent is in [exp_lower, exp_upper),
+    // e.g. 0.0001 instead of 1e-04. Otherwise use the exponent notation.
+    const int exp_lower = -4, exp_upper = 16;
+    return output_exp < exp_lower ||
+           output_exp >= (fspecs.precision > 0 ? fspecs.precision : exp_upper);
+  };
+  if (use_exp_format()) {
+    int num_zeros = 0;
+    if (fspecs.showpoint) {
+      num_zeros = fspecs.precision - significand_size;
+      if (num_zeros < 0) num_zeros = 0;
+      size += to_unsigned(num_zeros);
+    } else if (significand_size == 1) {
+      decimal_point = Char();
+    }
+    auto abs_output_exp = output_exp >= 0 ? output_exp : -output_exp;
+    int exp_digits = 2;
+    if (abs_output_exp >= 100) exp_digits = abs_output_exp >= 1000 ? 4 : 3;
+
+    size += to_unsigned((decimal_point ? 1 : 0) + 2 + exp_digits);
+    char exp_char = fspecs.upper ? 'E' : 'e';
+    auto write = [=](iterator it) {
+      if (sign) *it++ = detail::sign<Char>(sign);
+      // Insert a decimal point after the first digit and add an exponent.
+      it = write_significand(it, significand, significand_size, 1,
+                             decimal_point);
+      if (num_zeros > 0) it = detail::fill_n(it, num_zeros, zero);
+      *it++ = static_cast<Char>(exp_char);
+      return write_exponent<Char>(output_exp, it);
+    };
+    return specs.width > 0 ? write_padded<align::right>(out, specs, size, write)
+                           : base_iterator(out, write(reserve(out, size)));
+  }
+
+  int exp = f.exponent + significand_size;
+  if (f.exponent >= 0) {
+    // 1234e5 -> 123400000[.0+]
+    size += to_unsigned(f.exponent);
+    int num_zeros = fspecs.precision - exp;
+    abort_fuzzing_if(num_zeros > 5000);
+    if (fspecs.showpoint) {
+      ++size;
+      if (num_zeros <= 0 && fspecs.format != float_format::fixed) num_zeros = 1;
+      if (num_zeros > 0) size += to_unsigned(num_zeros);
+    }
+    auto grouping = Grouping(loc, fspecs.locale);
+    size += to_unsigned(grouping.count_separators(exp));
+    return write_padded<align::right>(out, specs, size, [&](iterator it) {
+      if (sign) *it++ = detail::sign<Char>(sign);
+      it = write_significand<Char>(it, significand, significand_size,
+                                   f.exponent, grouping);
+      if (!fspecs.showpoint) return it;
+      *it++ = decimal_point;
+      return num_zeros > 0 ? detail::fill_n(it, num_zeros, zero) : it;
+    });
+  } else if (exp > 0) {
+    // 1234e-2 -> 12.34[0+]
+    int num_zeros = fspecs.showpoint ? fspecs.precision - significand_size : 0;
+    size += 1 + to_unsigned(num_zeros > 0 ? num_zeros : 0);
+    auto grouping = Grouping(loc, fspecs.locale);
+    size += to_unsigned(grouping.count_separators(significand_size));
+    return write_padded<align::right>(out, specs, size, [&](iterator it) {
+      if (sign) *it++ = detail::sign<Char>(sign);
+      it = write_significand(it, significand, significand_size, exp,
+                             decimal_point, grouping);
+      return num_zeros > 0 ? detail::fill_n(it, num_zeros, zero) : it;
+    });
+  }
+  // 1234e-6 -> 0.001234
+  int num_zeros = -exp;
+  if (significand_size == 0 && fspecs.precision >= 0 &&
+      fspecs.precision < num_zeros) {
+    num_zeros = fspecs.precision;
+  }
+  bool pointy = num_zeros != 0 || significand_size != 0 || fspecs.showpoint;
+  size += 1 + (pointy ? 1 : 0) + to_unsigned(num_zeros);
+  return write_padded<align::right>(out, specs, size, [&](iterator it) {
+    if (sign) *it++ = detail::sign<Char>(sign);
+    *it++ = zero;
+    if (!pointy) return it;
+    *it++ = decimal_point;
+    it = detail::fill_n(it, num_zeros, zero);
+    return write_significand<Char>(it, significand, significand_size);
+  });
+}
+
+template <typename Char> class fallback_digit_grouping {
+ public:
+  constexpr fallback_digit_grouping(locale_ref, bool) {}
+
+  constexpr Char separator() const { return Char(); }
+
+  constexpr int count_separators(int) const { return 0; }
+
+  template <typename Out, typename C>
+  constexpr Out apply(Out out, basic_string_view<C>) const {
+    return out;
+  }
+};
+
+template <typename OutputIt, typename DecimalFP, typename Char>
+FMT_CONSTEXPR20 auto write_float(OutputIt out, const DecimalFP& f,
+                                 const basic_format_specs<Char>& specs,
+                                 float_specs fspecs, locale_ref loc)
+    -> OutputIt {
+  if (is_constant_evaluated()) {
+    return do_write_float<OutputIt, DecimalFP, Char,
+                          fallback_digit_grouping<Char>>(out, f, specs, fspecs,
+                                                         loc);
+  } else {
+    return do_write_float(out, f, specs, fspecs, loc);
+  }
+}
+
+template <typename T> constexpr bool isnan(T value) {
+  return !(value >= value);  // std::isnan doesn't support __float128.
+}
+
+template <typename T, typename Enable = void>
+struct has_isfinite : std::false_type {};
+
+template <typename T>
+struct has_isfinite<T, enable_if_t<sizeof(std::isfinite(T())) != 0>>
+    : std::true_type {};
+
+template <typename T, FMT_ENABLE_IF(std::is_floating_point<T>::value&&
+                                        has_isfinite<T>::value)>
+FMT_CONSTEXPR20 bool isfinite(T value) {
+  constexpr T inf = T(std::numeric_limits<double>::infinity());
+  if (is_constant_evaluated())
+    return !detail::isnan(value) && value != inf && value != -inf;
+  return std::isfinite(value);
+}
+template <typename T, FMT_ENABLE_IF(!has_isfinite<T>::value)>
+FMT_CONSTEXPR bool isfinite(T value) {
+  T inf = T(std::numeric_limits<double>::infinity());
+  // std::isfinite doesn't support __float128.
+  return !detail::isnan(value) && value != inf && value != -inf;
+}
+
+template <typename T, FMT_ENABLE_IF(is_floating_point<T>::value)>
+FMT_INLINE FMT_CONSTEXPR bool signbit(T value) {
+  if (is_constant_evaluated()) {
+#ifdef __cpp_if_constexpr
+    if constexpr (std::numeric_limits<double>::is_iec559) {
+      auto bits = detail::bit_cast<uint64_t>(static_cast<double>(value));
+      return (bits >> (num_bits<uint64_t>() - 1)) != 0;
+    }
+#endif
+  }
+  return std::signbit(static_cast<double>(value));
+}
+
+enum class round_direction { unknown, up, down };
+
+// Given the divisor (normally a power of 10), the remainder = v % divisor for
+// some number v and the error, returns whether v should be rounded up, down, or
+// whether the rounding direction can't be determined due to error.
+// error should be less than divisor / 2.
+FMT_CONSTEXPR inline round_direction get_round_direction(uint64_t divisor,
+                                                         uint64_t remainder,
+                                                         uint64_t error) {
+  FMT_ASSERT(remainder < divisor, "");  // divisor - remainder won't overflow.
+  FMT_ASSERT(error < divisor, "");      // divisor - error won't overflow.
+  FMT_ASSERT(error < divisor - error, "");  // error * 2 won't overflow.
+  // Round down if (remainder + error) * 2 <= divisor.
+  if (remainder <= divisor - remainder && error * 2 <= divisor - remainder * 2)
+    return round_direction::down;
+  // Round up if (remainder - error) * 2 >= divisor.
+  if (remainder >= error &&
+      remainder - error >= divisor - (remainder - error)) {
+    return round_direction::up;
+  }
+  return round_direction::unknown;
+}
+
+namespace digits {
+enum result {
+  more,  // Generate more digits.
+  done,  // Done generating digits.
+  error  // Digit generation cancelled due to an error.
+};
+}
+
+struct gen_digits_handler {
+  char* buf;
+  int size;
+  int precision;
+  int exp10;
+  bool fixed;
+
+  FMT_CONSTEXPR digits::result on_digit(char digit, uint64_t divisor,
+                                        uint64_t remainder, uint64_t error,
+                                        bool integral) {
+    FMT_ASSERT(remainder < divisor, "");
+    buf[size++] = digit;
+    if (!integral && error >= remainder) return digits::error;
+    if (size < precision) return digits::more;
+    if (!integral) {
+      // Check if error * 2 < divisor with overflow prevention.
+      // The check is not needed for the integral part because error = 1
+      // and divisor > (1 << 32) there.
+      if (error >= divisor || error >= divisor - error) return digits::error;
+    } else {
+      FMT_ASSERT(error == 1 && divisor > 2, "");
+    }
+    auto dir = get_round_direction(divisor, remainder, error);
+    if (dir != round_direction::up)
+      return dir == round_direction::down ? digits::done : digits::error;
+    ++buf[size - 1];
+    for (int i = size - 1; i > 0 && buf[i] > '9'; --i) {
+      buf[i] = '0';
+      ++buf[i - 1];
+    }
+    if (buf[0] > '9') {
+      buf[0] = '1';
+      if (fixed)
+        buf[size++] = '0';
+      else
+        ++exp10;
+    }
+    return digits::done;
+  }
+};
+
+inline FMT_CONSTEXPR20 void adjust_precision(int& precision, int exp10) {
+  // Adjust fixed precision by exponent because it is relative to decimal
+  // point.
+  if (exp10 > 0 && precision > max_value<int>() - exp10)
+    FMT_THROW(format_error("number is too big"));
+  precision += exp10;
+}
+
+// Generates output using the Grisu digit-gen algorithm.
+// error: the size of the region (lower, upper) outside of which numbers
+// definitely do not round to value (Delta in Grisu3).
+FMT_INLINE FMT_CONSTEXPR20 auto grisu_gen_digits(fp value, uint64_t error,
+                                                 int& exp,
+                                                 gen_digits_handler& handler)
+    -> digits::result {
+  const fp one(1ULL << -value.e, value.e);
+  // The integral part of scaled value (p1 in Grisu) = value / one. It cannot be
+  // zero because it contains a product of two 64-bit numbers with MSB set (due
+  // to normalization) - 1, shifted right by at most 60 bits.
+  auto integral = static_cast<uint32_t>(value.f >> -one.e);
+  FMT_ASSERT(integral != 0, "");
+  FMT_ASSERT(integral == value.f >> -one.e, "");
+  // The fractional part of scaled value (p2 in Grisu) c = value % one.
+  uint64_t fractional = value.f & (one.f - 1);
+  exp = count_digits(integral);  // kappa in Grisu.
+  // Non-fixed formats require at least one digit and no precision adjustment.
+  if (handler.fixed) {
+    adjust_precision(handler.precision, exp + handler.exp10);
+    // Check if precision is satisfied just by leading zeros, e.g.
+    // format("{:.2f}", 0.001) gives "0.00" without generating any digits.
+    if (handler.precision <= 0) {
+      if (handler.precision < 0) return digits::done;
+      // Divide by 10 to prevent overflow.
+      uint64_t divisor = data::power_of_10_64[exp - 1] << -one.e;
+      auto dir = get_round_direction(divisor, value.f / 10, error * 10);
+      if (dir == round_direction::unknown) return digits::error;
+      handler.buf[handler.size++] = dir == round_direction::up ? '1' : '0';
+      return digits::done;
+    }
+  }
+  // Generate digits for the integral part. This can produce up to 10 digits.
+  do {
+    uint32_t digit = 0;
+    auto divmod_integral = [&](uint32_t divisor) {
+      digit = integral / divisor;
+      integral %= divisor;
+    };
+    // This optimization by Milo Yip reduces the number of integer divisions by
+    // one per iteration.
+    switch (exp) {
+    case 10:
+      divmod_integral(1000000000);
+      break;
+    case 9:
+      divmod_integral(100000000);
+      break;
+    case 8:
+      divmod_integral(10000000);
+      break;
+    case 7:
+      divmod_integral(1000000);
+      break;
+    case 6:
+      divmod_integral(100000);
+      break;
+    case 5:
+      divmod_integral(10000);
+      break;
+    case 4:
+      divmod_integral(1000);
+      break;
+    case 3:
+      divmod_integral(100);
+      break;
+    case 2:
+      divmod_integral(10);
+      break;
+    case 1:
+      digit = integral;
+      integral = 0;
+      break;
+    default:
+      FMT_ASSERT(false, "invalid number of digits");
+    }
+    --exp;
+    auto remainder = (static_cast<uint64_t>(integral) << -one.e) + fractional;
+    auto result = handler.on_digit(static_cast<char>('0' + digit),
+                                   data::power_of_10_64[exp] << -one.e,
+                                   remainder, error, true);
+    if (result != digits::more) return result;
+  } while (exp > 0);
+  // Generate digits for the fractional part.
+  for (;;) {
+    fractional *= 10;
+    error *= 10;
+    char digit = static_cast<char>('0' + (fractional >> -one.e));
+    fractional &= one.f - 1;
+    --exp;
+    auto result = handler.on_digit(digit, one.f, fractional, error, false);
+    if (result != digits::more) return result;
+  }
+}
+
+class bigint {
+ private:
+  // A bigint is stored as an array of bigits (big digits), with bigit at index
+  // 0 being the least significant one.
+  using bigit = uint32_t;
+  using double_bigit = uint64_t;
+  enum { bigits_capacity = 32 };
+  basic_memory_buffer<bigit, bigits_capacity> bigits_;
+  int exp_;
+
+  FMT_CONSTEXPR20 bigit operator[](int index) const {
+    return bigits_[to_unsigned(index)];
+  }
+  FMT_CONSTEXPR20 bigit& operator[](int index) {
+    return bigits_[to_unsigned(index)];
+  }
+
+  static constexpr const int bigit_bits = num_bits<bigit>();
+
+  friend struct formatter<bigint>;
+
+  FMT_CONSTEXPR20 void subtract_bigits(int index, bigit other, bigit& borrow) {
+    auto result = static_cast<double_bigit>((*this)[index]) - other - borrow;
+    (*this)[index] = static_cast<bigit>(result);
+    borrow = static_cast<bigit>(result >> (bigit_bits * 2 - 1));
+  }
+
+  FMT_CONSTEXPR20 void remove_leading_zeros() {
+    int num_bigits = static_cast<int>(bigits_.size()) - 1;
+    while (num_bigits > 0 && (*this)[num_bigits] == 0) --num_bigits;
+    bigits_.resize(to_unsigned(num_bigits + 1));
+  }
+
+  // Computes *this -= other assuming aligned bigints and *this >= other.
+  FMT_CONSTEXPR20 void subtract_aligned(const bigint& other) {
+    FMT_ASSERT(other.exp_ >= exp_, "unaligned bigints");
+    FMT_ASSERT(compare(*this, other) >= 0, "");
+    bigit borrow = 0;
+    int i = other.exp_ - exp_;
+    for (size_t j = 0, n = other.bigits_.size(); j != n; ++i, ++j)
+      subtract_bigits(i, other.bigits_[j], borrow);
+    while (borrow > 0) subtract_bigits(i, 0, borrow);
+    remove_leading_zeros();
+  }
+
+  FMT_CONSTEXPR20 void multiply(uint32_t value) {
+    const double_bigit wide_value = value;
+    bigit carry = 0;
+    for (size_t i = 0, n = bigits_.size(); i < n; ++i) {
+      double_bigit result = bigits_[i] * wide_value + carry;
+      bigits_[i] = static_cast<bigit>(result);
+      carry = static_cast<bigit>(result >> bigit_bits);
+    }
+    if (carry != 0) bigits_.push_back(carry);
+  }
+
+  template <typename UInt, FMT_ENABLE_IF(std::is_same<UInt, uint64_t>::value ||
+                                         std::is_same<UInt, uint128_t>::value)>
+  FMT_CONSTEXPR20 void multiply(UInt value) {
+    using half_uint =
+        conditional_t<std::is_same<UInt, uint128_t>::value, uint64_t, uint32_t>;
+    const int shift = num_bits<half_uint>() - bigit_bits;
+    const UInt lower = static_cast<half_uint>(value);
+    const UInt upper = value >> num_bits<half_uint>();
+    UInt carry = 0;
+    for (size_t i = 0, n = bigits_.size(); i < n; ++i) {
+      UInt result = lower * bigits_[i] + static_cast<bigit>(carry);
+      carry = (upper * bigits_[i] << shift) + (result >> bigit_bits) +
+              (carry >> bigit_bits);
+      bigits_[i] = static_cast<bigit>(result);
+    }
+    while (carry != 0) {
+      bigits_.push_back(static_cast<bigit>(carry));
+      carry >>= bigit_bits;
+    }
+  }
+
+  template <typename UInt, FMT_ENABLE_IF(std::is_same<UInt, uint64_t>::value ||
+                                         std::is_same<UInt, uint128_t>::value)>
+  FMT_CONSTEXPR20 void assign(UInt n) {
+    size_t num_bigits = 0;
+    do {
+      bigits_[num_bigits++] = static_cast<bigit>(n);
+      n >>= bigit_bits;
+    } while (n != 0);
+    bigits_.resize(num_bigits);
+    exp_ = 0;
+  }
+
+ public:
+  FMT_CONSTEXPR20 bigint() : exp_(0) {}
+  explicit bigint(uint64_t n) { assign(n); }
+
+  bigint(const bigint&) = delete;
+  void operator=(const bigint&) = delete;
+
+  FMT_CONSTEXPR20 void assign(const bigint& other) {
+    auto size = other.bigits_.size();
+    bigits_.resize(size);
+    auto data = other.bigits_.data();
+    std::copy(data, data + size, make_checked(bigits_.data(), size));
+    exp_ = other.exp_;
+  }
+
+  template <typename Int> FMT_CONSTEXPR20 void operator=(Int n) {
+    FMT_ASSERT(n > 0, "");
+    assign(uint64_or_128_t<Int>(n));
+  }
+
+  FMT_CONSTEXPR20 int num_bigits() const {
+    return static_cast<int>(bigits_.size()) + exp_;
+  }
+
+  FMT_NOINLINE FMT_CONSTEXPR20 bigint& operator<<=(int shift) {
+    FMT_ASSERT(shift >= 0, "");
+    exp_ += shift / bigit_bits;
+    shift %= bigit_bits;
+    if (shift == 0) return *this;
+    bigit carry = 0;
+    for (size_t i = 0, n = bigits_.size(); i < n; ++i) {
+      bigit c = bigits_[i] >> (bigit_bits - shift);
+      bigits_[i] = (bigits_[i] << shift) + carry;
+      carry = c;
+    }
+    if (carry != 0) bigits_.push_back(carry);
+    return *this;
+  }
+
+  template <typename Int> FMT_CONSTEXPR20 bigint& operator*=(Int value) {
+    FMT_ASSERT(value > 0, "");
+    multiply(uint32_or_64_or_128_t<Int>(value));
+    return *this;
+  }
+
+  friend FMT_CONSTEXPR20 int compare(const bigint& lhs, const bigint& rhs) {
+    int num_lhs_bigits = lhs.num_bigits(), num_rhs_bigits = rhs.num_bigits();
+    if (num_lhs_bigits != num_rhs_bigits)
+      return num_lhs_bigits > num_rhs_bigits ? 1 : -1;
+    int i = static_cast<int>(lhs.bigits_.size()) - 1;
+    int j = static_cast<int>(rhs.bigits_.size()) - 1;
+    int end = i - j;
+    if (end < 0) end = 0;
+    for (; i >= end; --i, --j) {
+      bigit lhs_bigit = lhs[i], rhs_bigit = rhs[j];
+      if (lhs_bigit != rhs_bigit) return lhs_bigit > rhs_bigit ? 1 : -1;
+    }
+    if (i != j) return i > j ? 1 : -1;
+    return 0;
+  }
+
+  // Returns compare(lhs1 + lhs2, rhs).
+  friend FMT_CONSTEXPR20 int add_compare(const bigint& lhs1, const bigint& lhs2,
+                                         const bigint& rhs) {
+    auto minimum = [](int a, int b) { return a < b ? a : b; };
+    auto maximum = [](int a, int b) { return a > b ? a : b; };
+    int max_lhs_bigits = maximum(lhs1.num_bigits(), lhs2.num_bigits());
+    int num_rhs_bigits = rhs.num_bigits();
+    if (max_lhs_bigits + 1 < num_rhs_bigits) return -1;
+    if (max_lhs_bigits > num_rhs_bigits) return 1;
+    auto get_bigit = [](const bigint& n, int i) -> bigit {
+      return i >= n.exp_ && i < n.num_bigits() ? n[i - n.exp_] : 0;
+    };
+    double_bigit borrow = 0;
+    int min_exp = minimum(minimum(lhs1.exp_, lhs2.exp_), rhs.exp_);
+    for (int i = num_rhs_bigits - 1; i >= min_exp; --i) {
+      double_bigit sum =
+          static_cast<double_bigit>(get_bigit(lhs1, i)) + get_bigit(lhs2, i);
+      bigit rhs_bigit = get_bigit(rhs, i);
+      if (sum > rhs_bigit + borrow) return 1;
+      borrow = rhs_bigit + borrow - sum;
+      if (borrow > 1) return -1;
+      borrow <<= bigit_bits;
+    }
+    return borrow != 0 ? -1 : 0;
+  }
+
+  // Assigns pow(10, exp) to this bigint.
+  FMT_CONSTEXPR20 void assign_pow10(int exp) {
+    FMT_ASSERT(exp >= 0, "");
+    if (exp == 0) return *this = 1;
+    // Find the top bit.
+    int bitmask = 1;
+    while (exp >= bitmask) bitmask <<= 1;
+    bitmask >>= 1;
+    // pow(10, exp) = pow(5, exp) * pow(2, exp). First compute pow(5, exp) by
+    // repeated squaring and multiplication.
+    *this = 5;
+    bitmask >>= 1;
+    while (bitmask != 0) {
+      square();
+      if ((exp & bitmask) != 0) *this *= 5;
+      bitmask >>= 1;
+    }
+    *this <<= exp;  // Multiply by pow(2, exp) by shifting.
+  }
+
+  FMT_CONSTEXPR20 void square() {
+    int num_bigits = static_cast<int>(bigits_.size());
+    int num_result_bigits = 2 * num_bigits;
+    basic_memory_buffer<bigit, bigits_capacity> n(std::move(bigits_));
+    bigits_.resize(to_unsigned(num_result_bigits));
+    auto sum = uint128_t();
+    for (int bigit_index = 0; bigit_index < num_bigits; ++bigit_index) {
+      // Compute bigit at position bigit_index of the result by adding
+      // cross-product terms n[i] * n[j] such that i + j == bigit_index.
+      for (int i = 0, j = bigit_index; j >= 0; ++i, --j) {
+        // Most terms are multiplied twice which can be optimized in the future.
+        sum += static_cast<double_bigit>(n[i]) * n[j];
+      }
+      (*this)[bigit_index] = static_cast<bigit>(sum);
+      sum >>= num_bits<bigit>();  // Compute the carry.
+    }
+    // Do the same for the top half.
+    for (int bigit_index = num_bigits; bigit_index < num_result_bigits;
+         ++bigit_index) {
+      for (int j = num_bigits - 1, i = bigit_index - j; i < num_bigits;)
+        sum += static_cast<double_bigit>(n[i++]) * n[j--];
+      (*this)[bigit_index] = static_cast<bigit>(sum);
+      sum >>= num_bits<bigit>();
+    }
+    remove_leading_zeros();
+    exp_ *= 2;
+  }
+
+  // If this bigint has a bigger exponent than other, adds trailing zero to make
+  // exponents equal. This simplifies some operations such as subtraction.
+  FMT_CONSTEXPR20 void align(const bigint& other) {
+    int exp_difference = exp_ - other.exp_;
+    if (exp_difference <= 0) return;
+    int num_bigits = static_cast<int>(bigits_.size());
+    bigits_.resize(to_unsigned(num_bigits + exp_difference));
+    for (int i = num_bigits - 1, j = i + exp_difference; i >= 0; --i, --j)
+      bigits_[j] = bigits_[i];
+    std::uninitialized_fill_n(bigits_.data(), exp_difference, 0);
+    exp_ -= exp_difference;
+  }
+
+  // Divides this bignum by divisor, assigning the remainder to this and
+  // returning the quotient.
+  FMT_CONSTEXPR20 int divmod_assign(const bigint& divisor) {
+    FMT_ASSERT(this != &divisor, "");
+    if (compare(*this, divisor) < 0) return 0;
+    FMT_ASSERT(divisor.bigits_[divisor.bigits_.size() - 1u] != 0, "");
+    align(divisor);
+    int quotient = 0;
+    do {
+      subtract_aligned(divisor);
+      ++quotient;
+    } while (compare(*this, divisor) >= 0);
+    return quotient;
+  }
+};
+
+// format_dragon flags.
+enum dragon {
+  predecessor_closer = 1,
+  fixup = 2,  // Run fixup to correct exp10 which can be off by one.
+  fixed = 4,
+};
+
+// Formats a floating-point number using a variation of the Fixed-Precision
+// Positive Floating-Point Printout ((FPP)^2) algorithm by Steele & White:
+// https://fmt.dev/papers/p372-steele.pdf.
+FMT_CONSTEXPR20 inline void format_dragon(basic_fp<uint128_t> value,
+                                          unsigned flags, int num_digits,
+                                          buffer<char>& buf, int& exp10) {
+  bigint numerator;    // 2 * R in (FPP)^2.
+  bigint denominator;  // 2 * S in (FPP)^2.
+  // lower and upper are differences between value and corresponding boundaries.
+  bigint lower;             // (M^- in (FPP)^2).
+  bigint upper_store;       // upper's value if different from lower.
+  bigint* upper = nullptr;  // (M^+ in (FPP)^2).
+  // Shift numerator and denominator by an extra bit or two (if lower boundary
+  // is closer) to make lower and upper integers. This eliminates multiplication
+  // by 2 during later computations.
+  bool is_predecessor_closer = (flags & dragon::predecessor_closer) != 0;
+  int shift = is_predecessor_closer ? 2 : 1;
+  if (value.e >= 0) {
+    numerator = value.f;
+    numerator <<= value.e + shift;
+    lower = 1;
+    lower <<= value.e;
+    if (is_predecessor_closer) {
+      upper_store = 1;
+      upper_store <<= value.e + 1;
+      upper = &upper_store;
+    }
+    denominator.assign_pow10(exp10);
+    denominator <<= shift;
+  } else if (exp10 < 0) {
+    numerator.assign_pow10(-exp10);
+    lower.assign(numerator);
+    if (is_predecessor_closer) {
+      upper_store.assign(numerator);
+      upper_store <<= 1;
+      upper = &upper_store;
+    }
+    numerator *= value.f;
+    numerator <<= shift;
+    denominator = 1;
+    denominator <<= shift - value.e;
+  } else {
+    numerator = value.f;
+    numerator <<= shift;
+    denominator.assign_pow10(exp10);
+    denominator <<= shift - value.e;
+    lower = 1;
+    if (is_predecessor_closer) {
+      upper_store = 1ULL << 1;
+      upper = &upper_store;
+    }
+  }
+  int even = static_cast<int>((value.f & 1) == 0);
+  if (!upper) upper = &lower;
+  if ((flags & dragon::fixup) != 0) {
+    if (add_compare(numerator, *upper, denominator) + even <= 0) {
+      --exp10;
+      numerator *= 10;
+      if (num_digits < 0) {
+        lower *= 10;
+        if (upper != &lower) *upper *= 10;
+      }
+    }
+    if ((flags & dragon::fixed) != 0) adjust_precision(num_digits, exp10 + 1);
+  }
+  // Invariant: value == (numerator / denominator) * pow(10, exp10).
+  if (num_digits < 0) {
+    // Generate the shortest representation.
+    num_digits = 0;
+    char* data = buf.data();
+    for (;;) {
+      int digit = numerator.divmod_assign(denominator);
+      bool low = compare(numerator, lower) - even < 0;  // numerator <[=] lower.
+      // numerator + upper >[=] pow10:
+      bool high = add_compare(numerator, *upper, denominator) + even > 0;
+      data[num_digits++] = static_cast<char>('0' + digit);
+      if (low || high) {
+        if (!low) {
+          ++data[num_digits - 1];
+        } else if (high) {
+          int result = add_compare(numerator, numerator, denominator);
+          // Round half to even.
+          if (result > 0 || (result == 0 && (digit % 2) != 0))
+            ++data[num_digits - 1];
+        }
+        buf.try_resize(to_unsigned(num_digits));
+        exp10 -= num_digits - 1;
+        return;
+      }
+      numerator *= 10;
+      lower *= 10;
+      if (upper != &lower) *upper *= 10;
+    }
+  }
+  // Generate the given number of digits.
+  exp10 -= num_digits - 1;
+  if (num_digits == 0) {
+    denominator *= 10;
+    auto digit = add_compare(numerator, numerator, denominator) > 0 ? '1' : '0';
+    buf.push_back(digit);
+    return;
+  }
+  buf.try_resize(to_unsigned(num_digits));
+  for (int i = 0; i < num_digits - 1; ++i) {
+    int digit = numerator.divmod_assign(denominator);
+    buf[i] = static_cast<char>('0' + digit);
+    numerator *= 10;
+  }
+  int digit = numerator.divmod_assign(denominator);
+  auto result = add_compare(numerator, numerator, denominator);
+  if (result > 0 || (result == 0 && (digit % 2) != 0)) {
+    if (digit == 9) {
+      const auto overflow = '0' + 10;
+      buf[num_digits - 1] = overflow;
+      // Propagate the carry.
+      for (int i = num_digits - 1; i > 0 && buf[i] == overflow; --i) {
+        buf[i] = '0';
+        ++buf[i - 1];
+      }
+      if (buf[0] == overflow) {
+        buf[0] = '1';
+        ++exp10;
+      }
+      return;
+    }
+    ++digit;
+  }
+  buf[num_digits - 1] = static_cast<char>('0' + digit);
+}
+
+template <typename Float>
+FMT_CONSTEXPR20 auto format_float(Float value, int precision, float_specs specs,
+                                  buffer<char>& buf) -> int {
+  // float is passed as double to reduce the number of instantiations.
+  static_assert(!std::is_same<Float, float>::value, "");
+  FMT_ASSERT(value >= 0, "value is negative");
+  auto converted_value = convert_float(value);
+
+  const bool fixed = specs.format == float_format::fixed;
+  if (value <= 0) {  // <= instead of == to silence a warning.
+    if (precision <= 0 || !fixed) {
+      buf.push_back('0');
+      return 0;
+    }
+    buf.try_resize(to_unsigned(precision));
+    fill_n(buf.data(), precision, '0');
+    return -precision;
+  }
+
+  int exp = 0;
+  bool use_dragon = true;
+  unsigned dragon_flags = 0;
+  if (!is_fast_float<Float>()) {
+    const auto inv_log2_10 = 0.3010299956639812;  // 1 / log2(10)
+    using info = dragonbox::float_info<decltype(converted_value)>;
+    const auto f = basic_fp<typename info::carrier_uint>(converted_value);
+    // Compute exp, an approximate power of 10, such that
+    //   10^(exp - 1) <= value < 10^exp or 10^exp <= value < 10^(exp + 1).
+    // This is based on log10(value) == log2(value) / log2(10) and approximation
+    // of log2(value) by e + num_fraction_bits idea from double-conversion.
+    exp = static_cast<int>(
+        std::ceil((f.e + count_digits<1>(f.f) - 1) * inv_log2_10 - 1e-10));
+    dragon_flags = dragon::fixup;
+  } else if (!is_constant_evaluated() && precision < 0) {
+    // Use Dragonbox for the shortest format.
+    if (specs.binary32) {
+      auto dec = dragonbox::to_decimal(static_cast<float>(value));
+      write<char>(buffer_appender<char>(buf), dec.significand);
+      return dec.exponent;
+    }
+    auto dec = dragonbox::to_decimal(static_cast<double>(value));
+    write<char>(buffer_appender<char>(buf), dec.significand);
+    return dec.exponent;
+  } else {
+    // Use Grisu + Dragon4 for the given precision:
+    // https://www.cs.tufts.edu/~nr/cs257/archive/florian-loitsch/printf.pdf.
+    const int min_exp = -60;  // alpha in Grisu.
+    int cached_exp10 = 0;     // K in Grisu.
+    fp normalized = normalize(fp(converted_value));
+    const auto cached_pow = get_cached_power(
+        min_exp - (normalized.e + fp::num_significand_bits), cached_exp10);
+    normalized = normalized * cached_pow;
+    gen_digits_handler handler{buf.data(), 0, precision, -cached_exp10, fixed};
+    if (grisu_gen_digits(normalized, 1, exp, handler) != digits::error &&
+        !is_constant_evaluated()) {
+      exp += handler.exp10;
+      buf.try_resize(to_unsigned(handler.size));
+      use_dragon = false;
+    } else {
+      exp += handler.size - cached_exp10 - 1;
+      precision = handler.precision;
+    }
+  }
+  if (use_dragon) {
+    auto f = basic_fp<uint128_t>();
+    bool is_predecessor_closer = specs.binary32
+                                     ? f.assign(static_cast<float>(value))
+                                     : f.assign(converted_value);
+    if (is_predecessor_closer) dragon_flags |= dragon::predecessor_closer;
+    if (fixed) dragon_flags |= dragon::fixed;
+    // Limit precision to the maximum possible number of significant digits in
+    // an IEEE754 double because we don't need to generate zeros.
+    const int max_double_digits = 767;
+    if (precision > max_double_digits) precision = max_double_digits;
+    format_dragon(f, dragon_flags, precision, buf, exp);
+  }
+  if (!fixed && !specs.showpoint) {
+    // Remove trailing zeros.
+    auto num_digits = buf.size();
+    while (num_digits > 0 && buf[num_digits - 1] == '0') {
+      --num_digits;
+      ++exp;
+    }
+    buf.try_resize(num_digits);
+  }
+  return exp;
+}
+
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(is_floating_point<T>::value)>
+FMT_CONSTEXPR20 auto write(OutputIt out, T value,
+                           basic_format_specs<Char> specs, locale_ref loc = {})
+    -> OutputIt {
+  if (const_check(!is_supported_floating_point(value))) return out;
+  float_specs fspecs = parse_float_type_spec(specs);
+  fspecs.sign = specs.sign;
+  if (detail::signbit(value)) {  // value < 0 is false for NaN so use signbit.
+    fspecs.sign = sign::minus;
+    value = -value;
+  } else if (fspecs.sign == sign::minus) {
+    fspecs.sign = sign::none;
+  }
+
+  if (!detail::isfinite(value))
+    return write_nonfinite(out, detail::isnan(value), specs, fspecs);
+
+  if (specs.align == align::numeric && fspecs.sign) {
+    auto it = reserve(out, 1);
+    *it++ = detail::sign<Char>(fspecs.sign);
+    out = base_iterator(out, it);
+    fspecs.sign = sign::none;
+    if (specs.width != 0) --specs.width;
+  }
+
+  memory_buffer buffer;
+  if (fspecs.format == float_format::hex) {
+    if (fspecs.sign) buffer.push_back(detail::sign<char>(fspecs.sign));
+    snprintf_float(convert_float(value), specs.precision, fspecs, buffer);
+    return write_bytes<align::right>(out, {buffer.data(), buffer.size()},
+                                     specs);
+  }
+  int precision = specs.precision >= 0 || specs.type == presentation_type::none
+                      ? specs.precision
+                      : 6;
+  if (fspecs.format == float_format::exp) {
+    if (precision == max_value<int>())
+      throw_format_error("number is too big");
+    else
+      ++precision;
+  } else if (fspecs.format != float_format::fixed && precision == 0) {
+    precision = 1;
+  }
+  if (const_check(std::is_same<T, float>())) fspecs.binary32 = true;
+  int exp = format_float(convert_float(value), precision, fspecs, buffer);
+  fspecs.precision = precision;
+  auto f = big_decimal_fp{buffer.data(), static_cast<int>(buffer.size()), exp};
+  return write_float(out, f, specs, fspecs, loc);
+}
+
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(is_fast_float<T>::value)>
+FMT_CONSTEXPR20 auto write(OutputIt out, T value) -> OutputIt {
+  if (is_constant_evaluated())
+    return write(out, value, basic_format_specs<Char>());
+  if (const_check(!is_supported_floating_point(value))) return out;
+
+  auto fspecs = float_specs();
+  if (detail::signbit(value)) {
+    fspecs.sign = sign::minus;
+    value = -value;
+  }
+
+  constexpr auto specs = basic_format_specs<Char>();
+  using floaty = conditional_t<std::is_same<T, long double>::value, double, T>;
+  using uint = typename dragonbox::float_info<floaty>::carrier_uint;
+  uint mask = exponent_mask<floaty>();
+  if ((bit_cast<uint>(value) & mask) == mask)
+    return write_nonfinite(out, std::isnan(value), specs, fspecs);
+
+  auto dec = dragonbox::to_decimal(static_cast<floaty>(value));
+  return write_float(out, dec, specs, fspecs, {});
+}
+
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(is_floating_point<T>::value &&
+                        !is_fast_float<T>::value)>
+inline auto write(OutputIt out, T value) -> OutputIt {
+  return write(out, value, basic_format_specs<Char>());
+}
+
+template <typename Char, typename OutputIt>
+auto write(OutputIt out, monostate, basic_format_specs<Char> = {},
+           locale_ref = {}) -> OutputIt {
+  FMT_ASSERT(false, "");
+  return out;
+}
+
+template <typename Char, typename OutputIt>
+FMT_CONSTEXPR auto write(OutputIt out, basic_string_view<Char> value)
+    -> OutputIt {
+  auto it = reserve(out, value.size());
+  it = copy_str_noinline<Char>(value.begin(), value.end(), it);
+  return base_iterator(out, it);
+}
+
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(is_string<T>::value)>
+constexpr auto write(OutputIt out, const T& value) -> OutputIt {
+  return write<Char>(out, to_string_view(value));
+}
+
+// FMT_ENABLE_IF() condition separated to workaround an MSVC bug.
+template <
+    typename Char, typename OutputIt, typename T,
+    bool check =
+        std::is_enum<T>::value && !std::is_same<T, Char>::value &&
+        mapped_type_constant<T, basic_format_context<OutputIt, Char>>::value !=
+            type::custom_type,
+    FMT_ENABLE_IF(check)>
+FMT_CONSTEXPR auto write(OutputIt out, T value) -> OutputIt {
+  return write<Char>(out, static_cast<underlying_t<T>>(value));
+}
+
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(std::is_same<T, bool>::value)>
+FMT_CONSTEXPR auto write(OutputIt out, T value,
+                         const basic_format_specs<Char>& specs = {},
+                         locale_ref = {}) -> OutputIt {
+  return specs.type != presentation_type::none &&
+                 specs.type != presentation_type::string
+             ? write(out, value ? 1 : 0, specs, {})
+             : write_bytes(out, value ? "true" : "false", specs);
+}
+
+template <typename Char, typename OutputIt>
+FMT_CONSTEXPR auto write(OutputIt out, Char value) -> OutputIt {
+  auto it = reserve(out, 1);
+  *it++ = value;
+  return base_iterator(out, it);
+}
+
+template <typename Char, typename OutputIt>
+FMT_CONSTEXPR_CHAR_TRAITS auto write(OutputIt out, const Char* value)
+    -> OutputIt {
+  if (!value) {
+    throw_format_error("string pointer is null");
+  } else {
+    out = write(out, basic_string_view<Char>(value));
+  }
+  return out;
+}
+
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(std::is_same<T, void>::value)>
+auto write(OutputIt out, const T* value,
+           const basic_format_specs<Char>& specs = {}, locale_ref = {})
+    -> OutputIt {
+  check_pointer_type_spec(specs.type, error_handler());
+  return write_ptr<Char>(out, bit_cast<uintptr_t>(value), &specs);
+}
+
+// A write overload that handles implicit conversions.
+template <typename Char, typename OutputIt, typename T,
+          typename Context = basic_format_context<OutputIt, Char>>
+FMT_CONSTEXPR auto write(OutputIt out, const T& value) -> enable_if_t<
+    std::is_class<T>::value && !is_string<T>::value &&
+        !is_floating_point<T>::value && !std::is_same<T, Char>::value &&
+        !std::is_same<const T&,
+                      decltype(arg_mapper<Context>().map(value))>::value,
+    OutputIt> {
+  return write<Char>(out, arg_mapper<Context>().map(value));
+}
+
+template <typename Char, typename OutputIt, typename T,
+          typename Context = basic_format_context<OutputIt, Char>>
+FMT_CONSTEXPR auto write(OutputIt out, const T& value)
+    -> enable_if_t<mapped_type_constant<T, Context>::value == type::custom_type,
+                   OutputIt> {
+  using formatter_type =
+      conditional_t<has_formatter<T, Context>::value,
+                    typename Context::template formatter_type<T>,
+                    fallback_formatter<T, Char>>;
+  auto ctx = Context(out, {}, {});
+  return formatter_type().format(value, ctx);
+}
+
+// An argument visitor that formats the argument and writes it via the output
+// iterator. It's a class and not a generic lambda for compatibility with C++11.
+template <typename Char> struct default_arg_formatter {
+  using iterator = buffer_appender<Char>;
+  using context = buffer_context<Char>;
+
+  iterator out;
+  basic_format_args<context> args;
+  locale_ref loc;
+
+  template <typename T> auto operator()(T value) -> iterator {
+    return write<Char>(out, value);
+  }
+  auto operator()(typename basic_format_arg<context>::handle h) -> iterator {
+    basic_format_parse_context<Char> parse_ctx({});
+    context format_ctx(out, args, loc);
+    h.format(parse_ctx, format_ctx);
+    return format_ctx.out();
+  }
+};
+
+template <typename Char> struct arg_formatter {
+  using iterator = buffer_appender<Char>;
+  using context = buffer_context<Char>;
+
+  iterator out;
+  const basic_format_specs<Char>& specs;
+  locale_ref locale;
+
+  template <typename T>
+  FMT_CONSTEXPR FMT_INLINE auto operator()(T value) -> iterator {
+    return detail::write(out, value, specs, locale);
+  }
+  auto operator()(typename basic_format_arg<context>::handle) -> iterator {
+    // User-defined types are handled separately because they require access
+    // to the parse context.
+    return out;
+  }
+};
+
+template <typename Char> struct custom_formatter {
+  basic_format_parse_context<Char>& parse_ctx;
+  buffer_context<Char>& ctx;
+
+  void operator()(
+      typename basic_format_arg<buffer_context<Char>>::handle h) const {
+    h.format(parse_ctx, ctx);
+  }
+  template <typename T> void operator()(T) const {}
+};
+
+template <typename T>
+using is_integer =
+    bool_constant<is_integral<T>::value && !std::is_same<T, bool>::value &&
+                  !std::is_same<T, char>::value &&
+                  !std::is_same<T, wchar_t>::value>;
+
+template <typename ErrorHandler> class width_checker {
+ public:
+  explicit FMT_CONSTEXPR width_checker(ErrorHandler& eh) : handler_(eh) {}
+
+  template <typename T, FMT_ENABLE_IF(is_integer<T>::value)>
+  FMT_CONSTEXPR auto operator()(T value) -> unsigned long long {
+    if (is_negative(value)) handler_.on_error("negative width");
+    return static_cast<unsigned long long>(value);
+  }
+
+  template <typename T, FMT_ENABLE_IF(!is_integer<T>::value)>
+  FMT_CONSTEXPR auto operator()(T) -> unsigned long long {
+    handler_.on_error("width is not integer");
+    return 0;
+  }
+
+ private:
+  ErrorHandler& handler_;
+};
+
+template <typename ErrorHandler> class precision_checker {
+ public:
+  explicit FMT_CONSTEXPR precision_checker(ErrorHandler& eh) : handler_(eh) {}
+
+  template <typename T, FMT_ENABLE_IF(is_integer<T>::value)>
+  FMT_CONSTEXPR auto operator()(T value) -> unsigned long long {
+    if (is_negative(value)) handler_.on_error("negative precision");
+    return static_cast<unsigned long long>(value);
+  }
+
+  template <typename T, FMT_ENABLE_IF(!is_integer<T>::value)>
+  FMT_CONSTEXPR auto operator()(T) -> unsigned long long {
+    handler_.on_error("precision is not integer");
+    return 0;
+  }
+
+ private:
+  ErrorHandler& handler_;
+};
+
+template <template <typename> class Handler, typename FormatArg,
+          typename ErrorHandler>
+FMT_CONSTEXPR auto get_dynamic_spec(FormatArg arg, ErrorHandler eh) -> int {
+  unsigned long long value = visit_format_arg(Handler<ErrorHandler>(eh), arg);
+  if (value > to_unsigned(max_value<int>())) eh.on_error("number is too big");
+  return static_cast<int>(value);
+}
+
+template <typename Context, typename ID>
+FMT_CONSTEXPR auto get_arg(Context& ctx, ID id) ->
+    typename Context::format_arg {
+  auto arg = ctx.arg(id);
+  if (!arg) ctx.on_error("argument not found");
+  return arg;
+}
+
+// The standard format specifier handler with checking.
+template <typename Char> class specs_handler : public specs_setter<Char> {
+ private:
+  basic_format_parse_context<Char>& parse_context_;
+  buffer_context<Char>& context_;
+
+  // This is only needed for compatibility with gcc 4.4.
+  using format_arg = basic_format_arg<buffer_context<Char>>;
+
+  FMT_CONSTEXPR auto get_arg(auto_id) -> format_arg {
+    return detail::get_arg(context_, parse_context_.next_arg_id());
+  }
+
+  FMT_CONSTEXPR auto get_arg(int arg_id) -> format_arg {
+    parse_context_.check_arg_id(arg_id);
+    return detail::get_arg(context_, arg_id);
+  }
+
+  FMT_CONSTEXPR auto get_arg(basic_string_view<Char> arg_id) -> format_arg {
+    parse_context_.check_arg_id(arg_id);
+    return detail::get_arg(context_, arg_id);
+  }
+
+ public:
+  FMT_CONSTEXPR specs_handler(basic_format_specs<Char>& specs,
+                              basic_format_parse_context<Char>& parse_ctx,
+                              buffer_context<Char>& ctx)
+      : specs_setter<Char>(specs), parse_context_(parse_ctx), context_(ctx) {}
+
+  template <typename Id> FMT_CONSTEXPR void on_dynamic_width(Id arg_id) {
+    this->specs_.width = get_dynamic_spec<width_checker>(
+        get_arg(arg_id), context_.error_handler());
+  }
+
+  template <typename Id> FMT_CONSTEXPR void on_dynamic_precision(Id arg_id) {
+    this->specs_.precision = get_dynamic_spec<precision_checker>(
+        get_arg(arg_id), context_.error_handler());
+  }
+
+  void on_error(const char* message) { context_.on_error(message); }
+};
+
+template <template <typename> class Handler, typename Context>
+FMT_CONSTEXPR void handle_dynamic_spec(int& value,
+                                       arg_ref<typename Context::char_type> ref,
+                                       Context& ctx) {
+  switch (ref.kind) {
+  case arg_id_kind::none:
+    break;
+  case arg_id_kind::index:
+    value = detail::get_dynamic_spec<Handler>(ctx.arg(ref.val.index),
+                                              ctx.error_handler());
+    break;
+  case arg_id_kind::name:
+    value = detail::get_dynamic_spec<Handler>(ctx.arg(ref.val.name),
+                                              ctx.error_handler());
+    break;
+  }
+}
+
+#if FMT_USE_USER_DEFINED_LITERALS
+template <typename Char> struct udl_formatter {
+  basic_string_view<Char> str;
+
+  template <typename... T>
+  auto operator()(T&&... args) const -> std::basic_string<Char> {
+    return vformat(str, fmt::make_format_args<buffer_context<Char>>(args...));
+  }
+};
+
+#  if FMT_USE_NONTYPE_TEMPLATE_ARGS
+template <typename T, typename Char, size_t N,
+          fmt::detail_exported::fixed_string<Char, N> Str>
+struct statically_named_arg : view {
+  static constexpr auto name = Str.data;
+
+  const T& value;
+  statically_named_arg(const T& v) : value(v) {}
+};
+
+template <typename T, typename Char, size_t N,
+          fmt::detail_exported::fixed_string<Char, N> Str>
+struct is_named_arg<statically_named_arg<T, Char, N, Str>> : std::true_type {};
+
+template <typename T, typename Char, size_t N,
+          fmt::detail_exported::fixed_string<Char, N> Str>
+struct is_statically_named_arg<statically_named_arg<T, Char, N, Str>>
+    : std::true_type {};
+
+template <typename Char, size_t N,
+          fmt::detail_exported::fixed_string<Char, N> Str>
+struct udl_arg {
+  template <typename T> auto operator=(T&& value) const {
+    return statically_named_arg<T, Char, N, Str>(std::forward<T>(value));
+  }
+};
+#  else
+template <typename Char> struct udl_arg {
+  const Char* str;
+
+  template <typename T> auto operator=(T&& value) const -> named_arg<Char, T> {
+    return {str, std::forward<T>(value)};
+  }
+};
+#  endif
+#endif  // FMT_USE_USER_DEFINED_LITERALS
+
+template <typename Locale, typename Char>
+auto vformat(const Locale& loc, basic_string_view<Char> format_str,
+             basic_format_args<buffer_context<type_identity_t<Char>>> args)
+    -> std::basic_string<Char> {
+  basic_memory_buffer<Char> buffer;
+  detail::vformat_to(buffer, format_str, args, detail::locale_ref(loc));
+  return {buffer.data(), buffer.size()};
+}
+
+using format_func = void (*)(detail::buffer<char>&, int, const char*);
+
+FMT_API void format_error_code(buffer<char>& out, int error_code,
+                               string_view message) noexcept;
+
+FMT_API void report_error(format_func func, int error_code,
+                          const char* message) noexcept;
+FMT_END_DETAIL_NAMESPACE
+
+FMT_API auto vsystem_error(int error_code, string_view format_str,
+                           format_args args) -> std::system_error;
+
+/**
+ \rst
+ Constructs :class:`std::system_error` with a message formatted with
+ ``fmt::format(fmt, args...)``.
+  *error_code* is a system error code as given by ``errno``.
+
+ **Example**::
+
+   // This throws std::system_error with the description
+   //   cannot open file 'madeup': No such file or directory
+   // or similar (system message may vary).
+   const char* filename = "madeup";
+   std::FILE* file = std::fopen(filename, "r");
+   if (!file)
+     throw fmt::system_error(errno, "cannot open file '{}'", filename);
+ \endrst
+*/
+template <typename... T>
+auto system_error(int error_code, format_string<T...> fmt, T&&... args)
+    -> std::system_error {
+  return vsystem_error(error_code, fmt, fmt::make_format_args(args...));
+}
+
+/**
+  \rst
+  Formats an error message for an error returned by an operating system or a
+  language runtime, for example a file opening error, and writes it to *out*.
+  The format is the same as the one used by ``std::system_error(ec, message)``
+  where ``ec`` is ``std::error_code(error_code, std::generic_category()})``.
+  It is implementation-defined but normally looks like:
+
+  .. parsed-literal::
+     *<message>*: *<system-message>*
+
+  where *<message>* is the passed message and *<system-message>* is the system
+  message corresponding to the error code.
+  *error_code* is a system error code as given by ``errno``.
+  \endrst
+ */
+FMT_API void format_system_error(detail::buffer<char>& out, int error_code,
+                                 const char* message) noexcept;
+
+// Reports a system error without throwing an exception.
+// Can be used to report errors from destructors.
+FMT_API void report_system_error(int error_code, const char* message) noexcept;
+
+/** Fast integer formatter. */
+class format_int {
+ private:
+  // Buffer should be large enough to hold all digits (digits10 + 1),
+  // a sign and a null character.
+  enum { buffer_size = std::numeric_limits<unsigned long long>::digits10 + 3 };
+  mutable char buffer_[buffer_size];
+  char* str_;
+
+  template <typename UInt> auto format_unsigned(UInt value) -> char* {
+    auto n = static_cast<detail::uint32_or_64_or_128_t<UInt>>(value);
+    return detail::format_decimal(buffer_, n, buffer_size - 1).begin;
+  }
+
+  template <typename Int> auto format_signed(Int value) -> char* {
+    auto abs_value = static_cast<detail::uint32_or_64_or_128_t<Int>>(value);
+    bool negative = value < 0;
+    if (negative) abs_value = 0 - abs_value;
+    auto begin = format_unsigned(abs_value);
+    if (negative) *--begin = '-';
+    return begin;
+  }
+
+ public:
+  explicit format_int(int value) : str_(format_signed(value)) {}
+  explicit format_int(long value) : str_(format_signed(value)) {}
+  explicit format_int(long long value) : str_(format_signed(value)) {}
+  explicit format_int(unsigned value) : str_(format_unsigned(value)) {}
+  explicit format_int(unsigned long value) : str_(format_unsigned(value)) {}
+  explicit format_int(unsigned long long value)
+      : str_(format_unsigned(value)) {}
+
+  /** Returns the number of characters written to the output buffer. */
+  auto size() const -> size_t {
+    return detail::to_unsigned(buffer_ - str_ + buffer_size - 1);
+  }
+
+  /**
+    Returns a pointer to the output buffer content. No terminating null
+    character is appended.
+   */
+  auto data() const -> const char* { return str_; }
+
+  /**
+    Returns a pointer to the output buffer content with terminating null
+    character appended.
+   */
+  auto c_str() const -> const char* {
+    buffer_[buffer_size - 1] = '\0';
+    return str_;
+  }
+
+  /**
+    \rst
+    Returns the content of the output buffer as an ``std::string``.
+    \endrst
+   */
+  auto str() const -> std::string { return std::string(str_, size()); }
+};
+
+template <typename T, typename Char>
+template <typename FormatContext>
+FMT_CONSTEXPR FMT_INLINE auto
+formatter<T, Char,
+          enable_if_t<detail::type_constant<T, Char>::value !=
+                      detail::type::custom_type>>::format(const T& val,
+                                                          FormatContext& ctx)
+    const -> decltype(ctx.out()) {
+  if (specs_.width_ref.kind != detail::arg_id_kind::none ||
+      specs_.precision_ref.kind != detail::arg_id_kind::none) {
+    auto specs = specs_;
+    detail::handle_dynamic_spec<detail::width_checker>(specs.width,
+                                                       specs.width_ref, ctx);
+    detail::handle_dynamic_spec<detail::precision_checker>(
+        specs.precision, specs.precision_ref, ctx);
+    return detail::write<Char>(ctx.out(), val, specs, ctx.locale());
+  }
+  return detail::write<Char>(ctx.out(), val, specs_, ctx.locale());
+}
+
+template <typename Char>
+struct formatter<void*, Char> : formatter<const void*, Char> {
+  template <typename FormatContext>
+  auto format(void* val, FormatContext& ctx) const -> decltype(ctx.out()) {
+    return formatter<const void*, Char>::format(val, ctx);
+  }
+};
+
+template <typename Char, size_t N>
+struct formatter<Char[N], Char> : formatter<basic_string_view<Char>, Char> {
+  template <typename FormatContext>
+  FMT_CONSTEXPR auto format(const Char* val, FormatContext& ctx) const
+      -> decltype(ctx.out()) {
+    return formatter<basic_string_view<Char>, Char>::format(val, ctx);
+  }
+};
+
+// A formatter for types known only at run time such as variant alternatives.
+//
+// Usage:
+//   using variant = std::variant<int, std::string>;
+//   template <>
+//   struct formatter<variant>: dynamic_formatter<> {
+//     auto format(const variant& v, format_context& ctx) {
+//       return visit([&](const auto& val) {
+//           return dynamic_formatter<>::format(val, ctx);
+//       }, v);
+//     }
+//   };
+template <typename Char = char> class dynamic_formatter {
+ private:
+  detail::dynamic_format_specs<Char> specs_;
+  const Char* format_str_;
+
+  struct null_handler : detail::error_handler {
+    void on_align(align_t) {}
+    void on_sign(sign_t) {}
+    void on_hash() {}
+  };
+
+  template <typename Context> void handle_specs(Context& ctx) {
+    detail::handle_dynamic_spec<detail::width_checker>(specs_.width,
+                                                       specs_.width_ref, ctx);
+    detail::handle_dynamic_spec<detail::precision_checker>(
+        specs_.precision, specs_.precision_ref, ctx);
+  }
+
+ public:
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    format_str_ = ctx.begin();
+    // Checks are deferred to formatting time when the argument type is known.
+    detail::dynamic_specs_handler<ParseContext> handler(specs_, ctx);
+    return detail::parse_format_specs(ctx.begin(), ctx.end(), handler);
+  }
+
+  template <typename T, typename FormatContext>
+  auto format(const T& val, FormatContext& ctx) -> decltype(ctx.out()) {
+    handle_specs(ctx);
+    detail::specs_checker<null_handler> checker(
+        null_handler(), detail::mapped_type_constant<T, FormatContext>::value);
+    checker.on_align(specs_.align);
+    if (specs_.sign != sign::none) checker.on_sign(specs_.sign);
+    if (specs_.alt) checker.on_hash();
+    if (specs_.precision >= 0) checker.end_precision();
+    return detail::write<Char>(ctx.out(), val, specs_, ctx.locale());
+  }
+};
+
+/**
+  \rst
+  Converts ``p`` to ``const void*`` for pointer formatting.
+
+  **Example**::
+
+    auto s = fmt::format("{}", fmt::ptr(p));
+  \endrst
+ */
+template <typename T> auto ptr(T p) -> const void* {
+  static_assert(std::is_pointer<T>::value, "");
+  return detail::bit_cast<const void*>(p);
+}
+template <typename T> auto ptr(const std::unique_ptr<T>& p) -> const void* {
+  return p.get();
+}
+template <typename T> auto ptr(const std::shared_ptr<T>& p) -> const void* {
+  return p.get();
+}
+
+/**
+  \rst
+  Converts ``e`` to the underlying type.
+
+  **Example**::
+
+    enum class color { red, green, blue };
+    auto s = fmt::format("{}", fmt::underlying(color::red));
+  \endrst
+ */
+template <typename Enum>
+constexpr auto underlying(Enum e) noexcept -> underlying_t<Enum> {
+  return static_cast<underlying_t<Enum>>(e);
+}
+
+namespace enums {
+template <typename Enum, FMT_ENABLE_IF(std::is_enum<Enum>::value)>
+constexpr auto format_as(Enum e) noexcept -> underlying_t<Enum> {
+  return static_cast<underlying_t<Enum>>(e);
+}
+}  // namespace enums
+
+class bytes {
+ private:
+  string_view data_;
+  friend struct formatter<bytes>;
+
+ public:
+  explicit bytes(string_view data) : data_(data) {}
+};
+
+template <> struct formatter<bytes> {
+ private:
+  detail::dynamic_format_specs<char> specs_;
+
+ public:
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    using handler_type = detail::dynamic_specs_handler<ParseContext>;
+    detail::specs_checker<handler_type> handler(handler_type(specs_, ctx),
+                                                detail::type::string_type);
+    auto it = parse_format_specs(ctx.begin(), ctx.end(), handler);
+    detail::check_string_type_spec(specs_.type, ctx.error_handler());
+    return it;
+  }
+
+  template <typename FormatContext>
+  auto format(bytes b, FormatContext& ctx) -> decltype(ctx.out()) {
+    detail::handle_dynamic_spec<detail::width_checker>(specs_.width,
+                                                       specs_.width_ref, ctx);
+    detail::handle_dynamic_spec<detail::precision_checker>(
+        specs_.precision, specs_.precision_ref, ctx);
+    return detail::write_bytes(ctx.out(), b.data_, specs_);
+  }
+};
+
+// group_digits_view is not derived from view because it copies the argument.
+template <typename T> struct group_digits_view { T value; };
+
+/**
+  \rst
+  Returns a view that formats an integer value using ',' as a locale-independent
+  thousands separator.
+
+  **Example**::
+
+    fmt::print("{}", fmt::group_digits(12345));
+    // Output: "12,345"
+  \endrst
+ */
+template <typename T> auto group_digits(T value) -> group_digits_view<T> {
+  return {value};
+}
+
+template <typename T> struct formatter<group_digits_view<T>> : formatter<T> {
+ private:
+  detail::dynamic_format_specs<char> specs_;
+
+ public:
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    using handler_type = detail::dynamic_specs_handler<ParseContext>;
+    detail::specs_checker<handler_type> handler(handler_type(specs_, ctx),
+                                                detail::type::int_type);
+    auto it = parse_format_specs(ctx.begin(), ctx.end(), handler);
+    detail::check_string_type_spec(specs_.type, ctx.error_handler());
+    return it;
+  }
+
+  template <typename FormatContext>
+  auto format(group_digits_view<T> t, FormatContext& ctx)
+      -> decltype(ctx.out()) {
+    detail::handle_dynamic_spec<detail::width_checker>(specs_.width,
+                                                       specs_.width_ref, ctx);
+    detail::handle_dynamic_spec<detail::precision_checker>(
+        specs_.precision, specs_.precision_ref, ctx);
+    return detail::write_int_localized(
+        ctx.out(), static_cast<detail::uint64_or_128_t<T>>(t.value), 0, specs_,
+        detail::digit_grouping<char>({"\3", ','}));
+  }
+};
+
+template <typename It, typename Sentinel, typename Char = char>
+struct join_view : detail::view {
+  It begin;
+  Sentinel end;
+  basic_string_view<Char> sep;
+
+  join_view(It b, Sentinel e, basic_string_view<Char> s)
+      : begin(b), end(e), sep(s) {}
+};
+
+template <typename It, typename Sentinel, typename Char>
+struct formatter<join_view<It, Sentinel, Char>, Char> {
+ private:
+  using value_type =
+#ifdef __cpp_lib_ranges
+      std::iter_value_t<It>;
+#else
+      typename std::iterator_traits<It>::value_type;
+#endif
+  using context = buffer_context<Char>;
+  using mapper = detail::arg_mapper<context>;
+
+  template <typename T, FMT_ENABLE_IF(has_formatter<T, context>::value)>
+  static auto map(const T& value) -> const T& {
+    return value;
+  }
+  template <typename T, FMT_ENABLE_IF(!has_formatter<T, context>::value)>
+  static auto map(const T& value) -> decltype(mapper().map(value)) {
+    return mapper().map(value);
+  }
+
+  using formatter_type =
+      conditional_t<is_formattable<value_type, Char>::value,
+                    formatter<remove_cvref_t<decltype(map(
+                                  std::declval<const value_type&>()))>,
+                              Char>,
+                    detail::fallback_formatter<value_type, Char>>;
+
+  formatter_type value_formatter_;
+
+ public:
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    return value_formatter_.parse(ctx);
+  }
+
+  template <typename FormatContext>
+  auto format(const join_view<It, Sentinel, Char>& value,
+              FormatContext& ctx) const -> decltype(ctx.out()) {
+    auto it = value.begin;
+    auto out = ctx.out();
+    if (it != value.end) {
+      out = value_formatter_.format(map(*it), ctx);
+      ++it;
+      while (it != value.end) {
+        out = detail::copy_str<Char>(value.sep.begin(), value.sep.end(), out);
+        ctx.advance_to(out);
+        out = value_formatter_.format(map(*it), ctx);
+        ++it;
+      }
+    }
+    return out;
+  }
+};
+
+/**
+  Returns a view that formats the iterator range `[begin, end)` with elements
+  separated by `sep`.
+ */
+template <typename It, typename Sentinel>
+auto join(It begin, Sentinel end, string_view sep) -> join_view<It, Sentinel> {
+  return {begin, end, sep};
+}
+
+/**
+  \rst
+  Returns a view that formats `range` with elements separated by `sep`.
+
+  **Example**::
+
+    std::vector<int> v = {1, 2, 3};
+    fmt::print("{}", fmt::join(v, ", "));
+    // Output: "1, 2, 3"
+
+  ``fmt::join`` applies passed format specifiers to the range elements::
+
+    fmt::print("{:02}", fmt::join(v, ", "));
+    // Output: "01, 02, 03"
+  \endrst
+ */
+template <typename Range>
+auto join(Range&& range, string_view sep)
+    -> join_view<detail::iterator_t<Range>, detail::sentinel_t<Range>> {
+  return join(std::begin(range), std::end(range), sep);
+}
+
+/**
+  \rst
+  Converts *value* to ``std::string`` using the default format for type *T*.
+
+  **Example**::
+
+    #include <fmt/format.h>
+
+    std::string answer = fmt::to_string(42);
+  \endrst
+ */
+template <typename T, FMT_ENABLE_IF(!std::is_integral<T>::value)>
+inline auto to_string(const T& value) -> std::string {
+  auto result = std::string();
+  detail::write<char>(std::back_inserter(result), value);
+  return result;
+}
+
+template <typename T, FMT_ENABLE_IF(std::is_integral<T>::value)>
+FMT_NODISCARD inline auto to_string(T value) -> std::string {
+  // The buffer should be large enough to store the number including the sign
+  // or "false" for bool.
+  constexpr int max_size = detail::digits10<T>() + 2;
+  char buffer[max_size > 5 ? static_cast<unsigned>(max_size) : 5];
+  char* begin = buffer;
+  return std::string(begin, detail::write<char>(begin, value));
+}
+
+template <typename Char, size_t SIZE>
+FMT_NODISCARD auto to_string(const basic_memory_buffer<Char, SIZE>& buf)
+    -> std::basic_string<Char> {
+  auto size = buf.size();
+  detail::assume(size < std::basic_string<Char>().max_size());
+  return std::basic_string<Char>(buf.data(), size);
+}
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+template <typename Char>
+void vformat_to(
+    buffer<Char>& buf, basic_string_view<Char> fmt,
+    basic_format_args<FMT_BUFFER_CONTEXT(type_identity_t<Char>)> args,
+    locale_ref loc) {
+  // workaround for msvc bug regarding name-lookup in module
+  // link names into function scope
+  using detail::arg_formatter;
+  using detail::buffer_appender;
+  using detail::custom_formatter;
+  using detail::default_arg_formatter;
+  using detail::get_arg;
+  using detail::locale_ref;
+  using detail::parse_format_specs;
+  using detail::specs_checker;
+  using detail::specs_handler;
+  using detail::to_unsigned;
+  using detail::type;
+  using detail::write;
+  auto out = buffer_appender<Char>(buf);
+  if (fmt.size() == 2 && equal2(fmt.data(), "{}")) {
+    auto arg = args.get(0);
+    if (!arg) error_handler().on_error("argument not found");
+    visit_format_arg(default_arg_formatter<Char>{out, args, loc}, arg);
+    return;
+  }
+
+  struct format_handler : error_handler {
+    basic_format_parse_context<Char> parse_context;
+    buffer_context<Char> context;
+
+    format_handler(buffer_appender<Char> p_out, basic_string_view<Char> str,
+                   basic_format_args<buffer_context<Char>> p_args,
+                   locale_ref p_loc)
+        : parse_context(str), context(p_out, p_args, p_loc) {}
+
+    void on_text(const Char* begin, const Char* end) {
+      auto text = basic_string_view<Char>(begin, to_unsigned(end - begin));
+      context.advance_to(write<Char>(context.out(), text));
+    }
+
+    FMT_CONSTEXPR auto on_arg_id() -> int {
+      return parse_context.next_arg_id();
+    }
+    FMT_CONSTEXPR auto on_arg_id(int id) -> int {
+      return parse_context.check_arg_id(id), id;
+    }
+    FMT_CONSTEXPR auto on_arg_id(basic_string_view<Char> id) -> int {
+      int arg_id = context.arg_id(id);
+      if (arg_id < 0) on_error("argument not found");
+      return arg_id;
+    }
+
+    FMT_INLINE void on_replacement_field(int id, const Char*) {
+      auto arg = get_arg(context, id);
+      context.advance_to(visit_format_arg(
+          default_arg_formatter<Char>{context.out(), context.args(),
+                                      context.locale()},
+          arg));
+    }
+
+    auto on_format_specs(int id, const Char* begin, const Char* end)
+        -> const Char* {
+      auto arg = get_arg(context, id);
+      if (arg.type() == type::custom_type) {
+        parse_context.advance_to(parse_context.begin() +
+                                 (begin - &*parse_context.begin()));
+        visit_format_arg(custom_formatter<Char>{parse_context, context}, arg);
+        return parse_context.begin();
+      }
+      auto specs = basic_format_specs<Char>();
+      specs_checker<specs_handler<Char>> handler(
+          specs_handler<Char>(specs, parse_context, context), arg.type());
+      begin = parse_format_specs(begin, end, handler);
+      if (begin == end || *begin != '}')
+        on_error("missing '}' in format string");
+      auto f = arg_formatter<Char>{context.out(), specs, context.locale()};
+      context.advance_to(visit_format_arg(f, arg));
+      return begin;
+    }
+  };
+  detail::parse_format_string<false>(fmt, format_handler(out, fmt, args, loc));
+}
+
+#ifndef FMT_HEADER_ONLY
+extern template FMT_API auto thousands_sep_impl<char>(locale_ref)
+    -> thousands_sep_result<char>;
+extern template FMT_API auto thousands_sep_impl<wchar_t>(locale_ref)
+    -> thousands_sep_result<wchar_t>;
+extern template FMT_API auto decimal_point_impl(locale_ref) -> char;
+extern template FMT_API auto decimal_point_impl(locale_ref) -> wchar_t;
+#endif  // FMT_HEADER_ONLY
+
+FMT_END_DETAIL_NAMESPACE
+
+#if FMT_USE_USER_DEFINED_LITERALS
+inline namespace literals {
+/**
+  \rst
+  User-defined literal equivalent of :func:`fmt::arg`.
+
+  **Example**::
+
+    using namespace fmt::literals;
+    fmt::print("Elapsed time: {s:.2f} seconds", "s"_a=1.23);
+  \endrst
+ */
+#  if FMT_USE_NONTYPE_TEMPLATE_ARGS
+template <detail_exported::fixed_string Str> constexpr auto operator""_a() {
+  using char_t = remove_cvref_t<decltype(Str.data[0])>;
+  return detail::udl_arg<char_t, sizeof(Str.data) / sizeof(char_t), Str>();
+}
+#  else
+constexpr auto operator"" _a(const char* s, size_t) -> detail::udl_arg<char> {
+  return {s};
+}
+#  endif
+}  // namespace literals
+#endif  // FMT_USE_USER_DEFINED_LITERALS
+
+template <typename Locale, FMT_ENABLE_IF(detail::is_locale<Locale>::value)>
+inline auto vformat(const Locale& loc, string_view fmt, format_args args)
+    -> std::string {
+  return detail::vformat(loc, fmt, args);
+}
+
+template <typename Locale, typename... T,
+          FMT_ENABLE_IF(detail::is_locale<Locale>::value)>
+inline auto format(const Locale& loc, format_string<T...> fmt, T&&... args)
+    -> std::string {
+  return vformat(loc, string_view(fmt), fmt::make_format_args(args...));
+}
+
+template <typename OutputIt, typename Locale,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, char>::value&&
+                            detail::is_locale<Locale>::value)>
+auto vformat_to(OutputIt out, const Locale& loc, string_view fmt,
+                format_args args) -> OutputIt {
+  using detail::get_buffer;
+  auto&& buf = get_buffer<char>(out);
+  detail::vformat_to(buf, fmt, args, detail::locale_ref(loc));
+  return detail::get_iterator(buf);
+}
+
+template <typename OutputIt, typename Locale, typename... T,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, char>::value&&
+                            detail::is_locale<Locale>::value)>
+FMT_INLINE auto format_to(OutputIt out, const Locale& loc,
+                          format_string<T...> fmt, T&&... args) -> OutputIt {
+  return vformat_to(out, loc, fmt, fmt::make_format_args(args...));
+}
+
+FMT_MODULE_EXPORT_END
+FMT_END_NAMESPACE
+
+#ifdef FMT_HEADER_ONLY
+#  define FMT_FUNC inline
+#  include "format-inl.h"
+#else
+#  define FMT_FUNC
+#endif
+
+#endif  // FMT_FORMAT_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/locale.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/locale.h
new file mode 100644
index 0000000000..7571b5261b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/locale.h
@@ -0,0 +1,2 @@
+#include "xchar.h"
+#warning fmt/locale.h is deprecated, include fmt/format.h or fmt/xchar.h instead
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/os.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/os.h
new file mode 100644
index 0000000000..d82be1125a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/os.h
@@ -0,0 +1,478 @@
+// Formatting library for C++ - optional OS-specific functionality
+//
+// Copyright (c) 2012 - present, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_OS_H_
+#define FMT_OS_H_
+
+#include <cerrno>
+#include <cstddef>
+#include <cstdio>
+#include <system_error>  // std::system_error
+
+#if defined __APPLE__ || defined(__FreeBSD__)
+#  include <xlocale.h>  // for LC_NUMERIC_MASK on OS X
+#endif
+
+#include "format.h"
+
+#ifndef FMT_USE_FCNTL
+// UWP doesn't provide _pipe.
+#  if FMT_HAS_INCLUDE("winapifamily.h")
+#    include <winapifamily.h>
+#  endif
+#  if (FMT_HAS_INCLUDE(<fcntl.h>) || defined(__APPLE__) || \
+       defined(__linux__)) &&                              \
+      (!defined(WINAPI_FAMILY) ||                          \
+       (WINAPI_FAMILY == WINAPI_FAMILY_DESKTOP_APP))
+#    include <fcntl.h>  // for O_RDONLY
+#    define FMT_USE_FCNTL 1
+#  else
+#    define FMT_USE_FCNTL 0
+#  endif
+#endif
+
+#ifndef FMT_POSIX
+#  if defined(_WIN32) && !defined(__MINGW32__)
+// Fix warnings about deprecated symbols.
+#    define FMT_POSIX(call) _##call
+#  else
+#    define FMT_POSIX(call) call
+#  endif
+#endif
+
+// Calls to system functions are wrapped in FMT_SYSTEM for testability.
+#ifdef FMT_SYSTEM
+#  define FMT_POSIX_CALL(call) FMT_SYSTEM(call)
+#else
+#  define FMT_SYSTEM(call) ::call
+#  ifdef _WIN32
+// Fix warnings about deprecated symbols.
+#    define FMT_POSIX_CALL(call) ::_##call
+#  else
+#    define FMT_POSIX_CALL(call) ::call
+#  endif
+#endif
+
+// Retries the expression while it evaluates to error_result and errno
+// equals to EINTR.
+#ifndef _WIN32
+#  define FMT_RETRY_VAL(result, expression, error_result) \
+    do {                                                  \
+      (result) = (expression);                            \
+    } while ((result) == (error_result) && errno == EINTR)
+#else
+#  define FMT_RETRY_VAL(result, expression, error_result) result = (expression)
+#endif
+
+#define FMT_RETRY(result, expression) FMT_RETRY_VAL(result, expression, -1)
+
+FMT_BEGIN_NAMESPACE
+FMT_MODULE_EXPORT_BEGIN
+
+/**
+  \rst
+  A reference to a null-terminated string. It can be constructed from a C
+  string or ``std::string``.
+
+  You can use one of the following type aliases for common character types:
+
+  +---------------+-----------------------------+
+  | Type          | Definition                  |
+  +===============+=============================+
+  | cstring_view  | basic_cstring_view<char>    |
+  +---------------+-----------------------------+
+  | wcstring_view | basic_cstring_view<wchar_t> |
+  +---------------+-----------------------------+
+
+  This class is most useful as a parameter type to allow passing
+  different types of strings to a function, for example::
+
+    template <typename... Args>
+    std::string format(cstring_view format_str, const Args & ... args);
+
+    format("{}", 42);
+    format(std::string("{}"), 42);
+  \endrst
+ */
+template <typename Char> class basic_cstring_view {
+ private:
+  const Char* data_;
+
+ public:
+  /** Constructs a string reference object from a C string. */
+  basic_cstring_view(const Char* s) : data_(s) {}
+
+  /**
+    \rst
+    Constructs a string reference from an ``std::string`` object.
+    \endrst
+   */
+  basic_cstring_view(const std::basic_string<Char>& s) : data_(s.c_str()) {}
+
+  /** Returns the pointer to a C string. */
+  const Char* c_str() const { return data_; }
+};
+
+using cstring_view = basic_cstring_view<char>;
+using wcstring_view = basic_cstring_view<wchar_t>;
+
+template <typename Char> struct formatter<std::error_code, Char> {
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    return ctx.begin();
+  }
+
+  template <typename FormatContext>
+  FMT_CONSTEXPR auto format(const std::error_code& ec, FormatContext& ctx) const
+      -> decltype(ctx.out()) {
+    auto out = ctx.out();
+    out = detail::write_bytes(out, ec.category().name(),
+                              basic_format_specs<Char>());
+    out = detail::write<Char>(out, Char(':'));
+    out = detail::write<Char>(out, ec.value());
+    return out;
+  }
+};
+
+#ifdef _WIN32
+FMT_API const std::error_category& system_category() noexcept;
+
+FMT_BEGIN_DETAIL_NAMESPACE
+// A converter from UTF-16 to UTF-8.
+// It is only provided for Windows since other systems support UTF-8 natively.
+class utf16_to_utf8 {
+ private:
+  memory_buffer buffer_;
+
+ public:
+  utf16_to_utf8() {}
+  FMT_API explicit utf16_to_utf8(basic_string_view<wchar_t> s);
+  operator string_view() const { return string_view(&buffer_[0], size()); }
+  size_t size() const { return buffer_.size() - 1; }
+  const char* c_str() const { return &buffer_[0]; }
+  std::string str() const { return std::string(&buffer_[0], size()); }
+
+  // Performs conversion returning a system error code instead of
+  // throwing exception on conversion error. This method may still throw
+  // in case of memory allocation error.
+  FMT_API int convert(basic_string_view<wchar_t> s);
+};
+
+FMT_API void format_windows_error(buffer<char>& out, int error_code,
+                                  const char* message) noexcept;
+FMT_END_DETAIL_NAMESPACE
+
+FMT_API std::system_error vwindows_error(int error_code, string_view format_str,
+                                         format_args args);
+
+/**
+ \rst
+ Constructs a :class:`std::system_error` object with the description
+ of the form
+
+ .. parsed-literal::
+   *<message>*: *<system-message>*
+
+ where *<message>* is the formatted message and *<system-message>* is the
+ system message corresponding to the error code.
+ *error_code* is a Windows error code as given by ``GetLastError``.
+ If *error_code* is not a valid error code such as -1, the system message
+ will look like "error -1".
+
+ **Example**::
+
+   // This throws a system_error with the description
+   //   cannot open file 'madeup': The system cannot find the file specified.
+   // or similar (system message may vary).
+   const char *filename = "madeup";
+   LPOFSTRUCT of = LPOFSTRUCT();
+   HFILE file = OpenFile(filename, &of, OF_READ);
+   if (file == HFILE_ERROR) {
+     throw fmt::windows_error(GetLastError(),
+                              "cannot open file '{}'", filename);
+   }
+ \endrst
+*/
+template <typename... Args>
+std::system_error windows_error(int error_code, string_view message,
+                                const Args&... args) {
+  return vwindows_error(error_code, message, fmt::make_format_args(args...));
+}
+
+// Reports a Windows error without throwing an exception.
+// Can be used to report errors from destructors.
+FMT_API void report_windows_error(int error_code, const char* message) noexcept;
+#else
+inline const std::error_category& system_category() noexcept {
+  return std::system_category();
+}
+#endif  // _WIN32
+
+// std::system is not available on some platforms such as iOS (#2248).
+#ifdef __OSX__
+template <typename S, typename... Args, typename Char = char_t<S>>
+void say(const S& format_str, Args&&... args) {
+  std::system(format("say \"{}\"", format(format_str, args...)).c_str());
+}
+#endif
+
+// A buffered file.
+class buffered_file {
+ private:
+  FILE* file_;
+
+  friend class file;
+
+  explicit buffered_file(FILE* f) : file_(f) {}
+
+ public:
+  buffered_file(const buffered_file&) = delete;
+  void operator=(const buffered_file&) = delete;
+
+  // Constructs a buffered_file object which doesn't represent any file.
+  buffered_file() noexcept : file_(nullptr) {}
+
+  // Destroys the object closing the file it represents if any.
+  FMT_API ~buffered_file() noexcept;
+
+ public:
+  buffered_file(buffered_file&& other) noexcept : file_(other.file_) {
+    other.file_ = nullptr;
+  }
+
+  buffered_file& operator=(buffered_file&& other) {
+    close();
+    file_ = other.file_;
+    other.file_ = nullptr;
+    return *this;
+  }
+
+  // Opens a file.
+  FMT_API buffered_file(cstring_view filename, cstring_view mode);
+
+  // Closes the file.
+  FMT_API void close();
+
+  // Returns the pointer to a FILE object representing this file.
+  FILE* get() const noexcept { return file_; }
+
+  FMT_API int descriptor() const;
+
+  void vprint(string_view format_str, format_args args) {
+    fmt::vprint(file_, format_str, args);
+  }
+
+  template <typename... Args>
+  inline void print(string_view format_str, const Args&... args) {
+    vprint(format_str, fmt::make_format_args(args...));
+  }
+};
+
+#if FMT_USE_FCNTL
+// A file. Closed file is represented by a file object with descriptor -1.
+// Methods that are not declared with noexcept may throw
+// fmt::system_error in case of failure. Note that some errors such as
+// closing the file multiple times will cause a crash on Windows rather
+// than an exception. You can get standard behavior by overriding the
+// invalid parameter handler with _set_invalid_parameter_handler.
+class FMT_API file {
+ private:
+  int fd_;  // File descriptor.
+
+  // Constructs a file object with a given descriptor.
+  explicit file(int fd) : fd_(fd) {}
+
+ public:
+  // Possible values for the oflag argument to the constructor.
+  enum {
+    RDONLY = FMT_POSIX(O_RDONLY),  // Open for reading only.
+    WRONLY = FMT_POSIX(O_WRONLY),  // Open for writing only.
+    RDWR = FMT_POSIX(O_RDWR),      // Open for reading and writing.
+    CREATE = FMT_POSIX(O_CREAT),   // Create if the file doesn't exist.
+    APPEND = FMT_POSIX(O_APPEND),  // Open in append mode.
+    TRUNC = FMT_POSIX(O_TRUNC)     // Truncate the content of the file.
+  };
+
+  // Constructs a file object which doesn't represent any file.
+  file() noexcept : fd_(-1) {}
+
+  // Opens a file and constructs a file object representing this file.
+  file(cstring_view path, int oflag);
+
+ public:
+  file(const file&) = delete;
+  void operator=(const file&) = delete;
+
+  file(file&& other) noexcept : fd_(other.fd_) { other.fd_ = -1; }
+
+  // Move assignment is not noexcept because close may throw.
+  file& operator=(file&& other) {
+    close();
+    fd_ = other.fd_;
+    other.fd_ = -1;
+    return *this;
+  }
+
+  // Destroys the object closing the file it represents if any.
+  ~file() noexcept;
+
+  // Returns the file descriptor.
+  int descriptor() const noexcept { return fd_; }
+
+  // Closes the file.
+  void close();
+
+  // Returns the file size. The size has signed type for consistency with
+  // stat::st_size.
+  long long size() const;
+
+  // Attempts to read count bytes from the file into the specified buffer.
+  size_t read(void* buffer, size_t count);
+
+  // Attempts to write count bytes from the specified buffer to the file.
+  size_t write(const void* buffer, size_t count);
+
+  // Duplicates a file descriptor with the dup function and returns
+  // the duplicate as a file object.
+  static file dup(int fd);
+
+  // Makes fd be the copy of this file descriptor, closing fd first if
+  // necessary.
+  void dup2(int fd);
+
+  // Makes fd be the copy of this file descriptor, closing fd first if
+  // necessary.
+  void dup2(int fd, std::error_code& ec) noexcept;
+
+  // Creates a pipe setting up read_end and write_end file objects for reading
+  // and writing respectively.
+  static void pipe(file& read_end, file& write_end);
+
+  // Creates a buffered_file object associated with this file and detaches
+  // this file object from the file.
+  buffered_file fdopen(const char* mode);
+};
+
+// Returns the memory page size.
+long getpagesize();
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+struct buffer_size {
+  buffer_size() = default;
+  size_t value = 0;
+  buffer_size operator=(size_t val) const {
+    auto bs = buffer_size();
+    bs.value = val;
+    return bs;
+  }
+};
+
+struct ostream_params {
+  int oflag = file::WRONLY | file::CREATE | file::TRUNC;
+  size_t buffer_size = BUFSIZ > 32768 ? BUFSIZ : 32768;
+
+  ostream_params() {}
+
+  template <typename... T>
+  ostream_params(T... params, int new_oflag) : ostream_params(params...) {
+    oflag = new_oflag;
+  }
+
+  template <typename... T>
+  ostream_params(T... params, detail::buffer_size bs)
+      : ostream_params(params...) {
+    this->buffer_size = bs.value;
+  }
+
+// Intel has a bug that results in failure to deduce a constructor
+// for empty parameter packs.
+#  if defined(__INTEL_COMPILER) && __INTEL_COMPILER < 2000
+  ostream_params(int new_oflag) : oflag(new_oflag) {}
+  ostream_params(detail::buffer_size bs) : buffer_size(bs.value) {}
+#  endif
+};
+
+FMT_END_DETAIL_NAMESPACE
+
+// Added {} below to work around default constructor error known to
+// occur in Xcode versions 7.2.1 and 8.2.1.
+constexpr detail::buffer_size buffer_size{};
+
+/** A fast output stream which is not thread-safe. */
+class FMT_API ostream final : private detail::buffer<char> {
+ private:
+  file file_;
+
+  void grow(size_t) override;
+
+  ostream(cstring_view path, const detail::ostream_params& params)
+      : file_(path, params.oflag) {
+    set(new char[params.buffer_size], params.buffer_size);
+  }
+
+ public:
+  ostream(ostream&& other)
+      : detail::buffer<char>(other.data(), other.size(), other.capacity()),
+        file_(std::move(other.file_)) {
+    other.clear();
+    other.set(nullptr, 0);
+  }
+  ~ostream() {
+    flush();
+    delete[] data();
+  }
+
+  void flush() {
+    if (size() == 0) return;
+    file_.write(data(), size());
+    clear();
+  }
+
+  template <typename... T>
+  friend ostream output_file(cstring_view path, T... params);
+
+  void close() {
+    flush();
+    file_.close();
+  }
+
+  /**
+    Formats ``args`` according to specifications in ``fmt`` and writes the
+    output to the file.
+   */
+  template <typename... T> void print(format_string<T...> fmt, T&&... args) {
+    vformat_to(detail::buffer_appender<char>(*this), fmt,
+               fmt::make_format_args(args...));
+  }
+};
+
+/**
+  \rst
+  Opens a file for writing. Supported parameters passed in *params*:
+
+  * ``<integer>``: Flags passed to `open
+    <https://pubs.opengroup.org/onlinepubs/007904875/functions/open.html>`_
+    (``file::WRONLY | file::CREATE | file::TRUNC`` by default)
+  * ``buffer_size=<integer>``: Output buffer size
+
+  **Example**::
+
+    auto out = fmt::output_file("guide.txt");
+    out.print("Don't {}", "Panic");
+  \endrst
+ */
+template <typename... T>
+inline ostream output_file(cstring_view path, T... params) {
+  return {path, detail::ostream_params(params...)};
+}
+#endif  // FMT_USE_FCNTL
+
+FMT_MODULE_EXPORT_END
+FMT_END_NAMESPACE
+
+#endif  // FMT_OS_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/ostream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/ostream.h
new file mode 100644
index 0000000000..c3cdd4a61b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/ostream.h
@@ -0,0 +1,237 @@
+// Formatting library for C++ - std::ostream support
+//
+// Copyright (c) 2012 - present, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_OSTREAM_H_
+#define FMT_OSTREAM_H_
+
+#include <fstream>
+#include <ostream>
+#if defined(_WIN32) && defined(__GLIBCXX__)
+#  include <ext/stdio_filebuf.h>
+#  include <ext/stdio_sync_filebuf.h>
+#elif defined(_WIN32) && defined(_LIBCPP_VERSION)
+#  include <__std_stream>
+#endif
+
+#include "format.h"
+
+FMT_BEGIN_NAMESPACE
+
+template <typename OutputIt, typename Char> class basic_printf_context;
+
+namespace detail {
+
+// Checks if T has a user-defined operator<<.
+template <typename T, typename Char, typename Enable = void>
+class is_streamable {
+ private:
+  template <typename U>
+  static auto test(int)
+      -> bool_constant<sizeof(std::declval<std::basic_ostream<Char>&>()
+                              << std::declval<U>()) != 0>;
+
+  template <typename> static auto test(...) -> std::false_type;
+
+  using result = decltype(test<T>(0));
+
+ public:
+  is_streamable() = default;
+
+  static const bool value = result::value;
+};
+
+// Formatting of built-in types and arrays is intentionally disabled because
+// it's handled by standard (non-ostream) formatters.
+template <typename T, typename Char>
+struct is_streamable<
+    T, Char,
+    enable_if_t<
+        std::is_arithmetic<T>::value || std::is_array<T>::value ||
+        std::is_pointer<T>::value || std::is_same<T, char8_type>::value ||
+        std::is_convertible<T, fmt::basic_string_view<Char>>::value ||
+        std::is_same<T, std_string_view<Char>>::value ||
+        (std::is_convertible<T, int>::value && !std::is_enum<T>::value)>>
+    : std::false_type {};
+
+// Generate a unique explicit instantion in every translation unit using a tag
+// type in an anonymous namespace.
+namespace {
+struct file_access_tag {};
+}  // namespace
+template <class Tag, class BufType, FILE* BufType::*FileMemberPtr>
+class file_access {
+  friend auto get_file(BufType& obj) -> FILE* { return obj.*FileMemberPtr; }
+};
+
+#if FMT_MSC_VERSION
+template class file_access<file_access_tag, std::filebuf,
+                           &std::filebuf::_Myfile>;
+auto get_file(std::filebuf&) -> FILE*;
+#elif defined(_WIN32) && defined(_LIBCPP_VERSION)
+template class file_access<file_access_tag, std::__stdoutbuf<char>,
+                           &std::__stdoutbuf<char>::__file_>;
+auto get_file(std::__stdoutbuf<char>&) -> FILE*;
+#endif
+
+inline bool write_ostream_unicode(std::ostream& os, fmt::string_view data) {
+#if FMT_MSC_VERSION
+  if (auto* buf = dynamic_cast<std::filebuf*>(os.rdbuf()))
+    if (FILE* f = get_file(*buf)) return write_console(f, data);
+#elif defined(_WIN32) && defined(__GLIBCXX__)
+  auto* rdbuf = os.rdbuf();
+  FILE* c_file;
+  if (auto* fbuf = dynamic_cast<__gnu_cxx::stdio_sync_filebuf<char>*>(rdbuf))
+    c_file = fbuf->file();
+  else if (auto* fbuf = dynamic_cast<__gnu_cxx::stdio_filebuf<char>*>(rdbuf))
+    c_file = fbuf->file();
+  else
+    return false;
+  if (c_file) return write_console(c_file, data);
+#elif defined(_WIN32) && defined(_LIBCPP_VERSION)
+  if (auto* buf = dynamic_cast<std::__stdoutbuf<char>*>(os.rdbuf()))
+    if (FILE* f = get_file(*buf)) return write_console(f, data);
+#else
+  ignore_unused(os, data);
+#endif
+  return false;
+}
+inline bool write_ostream_unicode(std::wostream&,
+                                  fmt::basic_string_view<wchar_t>) {
+  return false;
+}
+
+// Write the content of buf to os.
+// It is a separate function rather than a part of vprint to simplify testing.
+template <typename Char>
+void write_buffer(std::basic_ostream<Char>& os, buffer<Char>& buf) {
+  const Char* buf_data = buf.data();
+  using unsigned_streamsize = std::make_unsigned<std::streamsize>::type;
+  unsigned_streamsize size = buf.size();
+  unsigned_streamsize max_size = to_unsigned(max_value<std::streamsize>());
+  do {
+    unsigned_streamsize n = size <= max_size ? size : max_size;
+    os.write(buf_data, static_cast<std::streamsize>(n));
+    buf_data += n;
+    size -= n;
+  } while (size != 0);
+}
+
+template <typename Char, typename T>
+void format_value(buffer<Char>& buf, const T& value,
+                  locale_ref loc = locale_ref()) {
+  auto&& format_buf = formatbuf<std::basic_streambuf<Char>>(buf);
+  auto&& output = std::basic_ostream<Char>(&format_buf);
+#if !defined(FMT_STATIC_THOUSANDS_SEPARATOR)
+  if (loc) output.imbue(loc.get<std::locale>());
+#endif
+  output << value;
+  output.exceptions(std::ios_base::failbit | std::ios_base::badbit);
+}
+
+template <typename T> struct streamed_view { const T& value; };
+
+}  // namespace detail
+
+// Formats an object of type T that has an overloaded ostream operator<<.
+template <typename Char>
+struct basic_ostream_formatter : formatter<basic_string_view<Char>, Char> {
+  void set_debug_format() = delete;
+
+  template <typename T, typename OutputIt>
+  auto format(const T& value, basic_format_context<OutputIt, Char>& ctx) const
+      -> OutputIt {
+    auto buffer = basic_memory_buffer<Char>();
+    format_value(buffer, value, ctx.locale());
+    return formatter<basic_string_view<Char>, Char>::format(
+        {buffer.data(), buffer.size()}, ctx);
+  }
+};
+
+using ostream_formatter = basic_ostream_formatter<char>;
+
+template <typename T, typename Char>
+struct formatter<detail::streamed_view<T>, Char>
+    : basic_ostream_formatter<Char> {
+  template <typename OutputIt>
+  auto format(detail::streamed_view<T> view,
+              basic_format_context<OutputIt, Char>& ctx) const -> OutputIt {
+    return basic_ostream_formatter<Char>::format(view.value, ctx);
+  }
+};
+
+/**
+  \rst
+  Returns a view that formats `value` via an ostream ``operator<<``.
+
+  **Example**::
+
+    fmt::print("Current thread id: {}\n",
+               fmt::streamed(std::this_thread::get_id()));
+  \endrst
+ */
+template <typename T>
+auto streamed(const T& value) -> detail::streamed_view<T> {
+  return {value};
+}
+
+namespace detail {
+
+// Formats an object of type T that has an overloaded ostream operator<<.
+template <typename T, typename Char>
+struct fallback_formatter<T, Char, enable_if_t<is_streamable<T, Char>::value>>
+    : basic_ostream_formatter<Char> {
+  using basic_ostream_formatter<Char>::format;
+};
+
+inline void vprint_directly(std::ostream& os, string_view format_str,
+                            format_args args) {
+  auto buffer = memory_buffer();
+  detail::vformat_to(buffer, format_str, args);
+  detail::write_buffer(os, buffer);
+}
+
+}  // namespace detail
+
+FMT_MODULE_EXPORT template <typename Char>
+void vprint(std::basic_ostream<Char>& os,
+            basic_string_view<type_identity_t<Char>> format_str,
+            basic_format_args<buffer_context<type_identity_t<Char>>> args) {
+  auto buffer = basic_memory_buffer<Char>();
+  detail::vformat_to(buffer, format_str, args);
+  if (detail::write_ostream_unicode(os, {buffer.data(), buffer.size()})) return;
+  detail::write_buffer(os, buffer);
+}
+
+/**
+  \rst
+  Prints formatted data to the stream *os*.
+
+  **Example**::
+
+    fmt::print(cerr, "Don't {}!", "panic");
+  \endrst
+ */
+FMT_MODULE_EXPORT template <typename... T>
+void print(std::ostream& os, format_string<T...> fmt, T&&... args) {
+  const auto& vargs = fmt::make_format_args(args...);
+  if (detail::is_utf8())
+    vprint(os, fmt, vargs);
+  else
+    detail::vprint_directly(os, fmt, vargs);
+}
+
+FMT_MODULE_EXPORT
+template <typename... Args>
+void print(std::wostream& os,
+           basic_format_string<wchar_t, type_identity_t<Args>...> fmt,
+           Args&&... args) {
+  vprint(os, fmt, fmt::make_format_args<buffer_context<wchar_t>>(args...));
+}
+
+FMT_END_NAMESPACE
+
+#endif  // FMT_OSTREAM_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/printf.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/printf.h
new file mode 100644
index 0000000000..70a592dc26
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/printf.h
@@ -0,0 +1,640 @@
+// Formatting library for C++ - legacy printf implementation
+//
+// Copyright (c) 2012 - 2016, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_PRINTF_H_
+#define FMT_PRINTF_H_
+
+#include <algorithm>  // std::max
+#include <limits>     // std::numeric_limits
+
+#include "format.h"
+
+FMT_BEGIN_NAMESPACE
+FMT_MODULE_EXPORT_BEGIN
+
+template <typename T> struct printf_formatter { printf_formatter() = delete; };
+
+template <typename Char>
+class basic_printf_parse_context : public basic_format_parse_context<Char> {
+  using basic_format_parse_context<Char>::basic_format_parse_context;
+};
+
+template <typename OutputIt, typename Char> class basic_printf_context {
+ private:
+  OutputIt out_;
+  basic_format_args<basic_printf_context> args_;
+
+ public:
+  using char_type = Char;
+  using format_arg = basic_format_arg<basic_printf_context>;
+  using parse_context_type = basic_printf_parse_context<Char>;
+  template <typename T> using formatter_type = printf_formatter<T>;
+
+  /**
+    \rst
+    Constructs a ``printf_context`` object. References to the arguments are
+    stored in the context object so make sure they have appropriate lifetimes.
+    \endrst
+   */
+  basic_printf_context(OutputIt out,
+                       basic_format_args<basic_printf_context> args)
+      : out_(out), args_(args) {}
+
+  OutputIt out() { return out_; }
+  void advance_to(OutputIt it) { out_ = it; }
+
+  detail::locale_ref locale() { return {}; }
+
+  format_arg arg(int id) const { return args_.get(id); }
+
+  FMT_CONSTEXPR void on_error(const char* message) {
+    detail::error_handler().on_error(message);
+  }
+};
+
+FMT_BEGIN_DETAIL_NAMESPACE
+
+// Checks if a value fits in int - used to avoid warnings about comparing
+// signed and unsigned integers.
+template <bool IsSigned> struct int_checker {
+  template <typename T> static bool fits_in_int(T value) {
+    unsigned max = max_value<int>();
+    return value <= max;
+  }
+  static bool fits_in_int(bool) { return true; }
+};
+
+template <> struct int_checker<true> {
+  template <typename T> static bool fits_in_int(T value) {
+    return value >= (std::numeric_limits<int>::min)() &&
+           value <= max_value<int>();
+  }
+  static bool fits_in_int(int) { return true; }
+};
+
+class printf_precision_handler {
+ public:
+  template <typename T, FMT_ENABLE_IF(std::is_integral<T>::value)>
+  int operator()(T value) {
+    if (!int_checker<std::numeric_limits<T>::is_signed>::fits_in_int(value))
+      FMT_THROW(format_error("number is too big"));
+    return (std::max)(static_cast<int>(value), 0);
+  }
+
+  template <typename T, FMT_ENABLE_IF(!std::is_integral<T>::value)>
+  int operator()(T) {
+    FMT_THROW(format_error("precision is not integer"));
+    return 0;
+  }
+};
+
+// An argument visitor that returns true iff arg is a zero integer.
+class is_zero_int {
+ public:
+  template <typename T, FMT_ENABLE_IF(std::is_integral<T>::value)>
+  bool operator()(T value) {
+    return value == 0;
+  }
+
+  template <typename T, FMT_ENABLE_IF(!std::is_integral<T>::value)>
+  bool operator()(T) {
+    return false;
+  }
+};
+
+template <typename T> struct make_unsigned_or_bool : std::make_unsigned<T> {};
+
+template <> struct make_unsigned_or_bool<bool> { using type = bool; };
+
+template <typename T, typename Context> class arg_converter {
+ private:
+  using char_type = typename Context::char_type;
+
+  basic_format_arg<Context>& arg_;
+  char_type type_;
+
+ public:
+  arg_converter(basic_format_arg<Context>& arg, char_type type)
+      : arg_(arg), type_(type) {}
+
+  void operator()(bool value) {
+    if (type_ != 's') operator()<bool>(value);
+  }
+
+  template <typename U, FMT_ENABLE_IF(std::is_integral<U>::value)>
+  void operator()(U value) {
+    bool is_signed = type_ == 'd' || type_ == 'i';
+    using target_type = conditional_t<std::is_same<T, void>::value, U, T>;
+    if (const_check(sizeof(target_type) <= sizeof(int))) {
+      // Extra casts are used to silence warnings.
+      if (is_signed) {
+        arg_ = detail::make_arg<Context>(
+            static_cast<int>(static_cast<target_type>(value)));
+      } else {
+        using unsigned_type = typename make_unsigned_or_bool<target_type>::type;
+        arg_ = detail::make_arg<Context>(
+            static_cast<unsigned>(static_cast<unsigned_type>(value)));
+      }
+    } else {
+      if (is_signed) {
+        // glibc's printf doesn't sign extend arguments of smaller types:
+        //   std::printf("%lld", -42);  // prints "4294967254"
+        // but we don't have to do the same because it's a UB.
+        arg_ = detail::make_arg<Context>(static_cast<long long>(value));
+      } else {
+        arg_ = detail::make_arg<Context>(
+            static_cast<typename make_unsigned_or_bool<U>::type>(value));
+      }
+    }
+  }
+
+  template <typename U, FMT_ENABLE_IF(!std::is_integral<U>::value)>
+  void operator()(U) {}  // No conversion needed for non-integral types.
+};
+
+// Converts an integer argument to T for printf, if T is an integral type.
+// If T is void, the argument is converted to corresponding signed or unsigned
+// type depending on the type specifier: 'd' and 'i' - signed, other -
+// unsigned).
+template <typename T, typename Context, typename Char>
+void convert_arg(basic_format_arg<Context>& arg, Char type) {
+  visit_format_arg(arg_converter<T, Context>(arg, type), arg);
+}
+
+// Converts an integer argument to char for printf.
+template <typename Context> class char_converter {
+ private:
+  basic_format_arg<Context>& arg_;
+
+ public:
+  explicit char_converter(basic_format_arg<Context>& arg) : arg_(arg) {}
+
+  template <typename T, FMT_ENABLE_IF(std::is_integral<T>::value)>
+  void operator()(T value) {
+    arg_ = detail::make_arg<Context>(
+        static_cast<typename Context::char_type>(value));
+  }
+
+  template <typename T, FMT_ENABLE_IF(!std::is_integral<T>::value)>
+  void operator()(T) {}  // No conversion needed for non-integral types.
+};
+
+// An argument visitor that return a pointer to a C string if argument is a
+// string or null otherwise.
+template <typename Char> struct get_cstring {
+  template <typename T> const Char* operator()(T) { return nullptr; }
+  const Char* operator()(const Char* s) { return s; }
+};
+
+// Checks if an argument is a valid printf width specifier and sets
+// left alignment if it is negative.
+template <typename Char> class printf_width_handler {
+ private:
+  using format_specs = basic_format_specs<Char>;
+
+  format_specs& specs_;
+
+ public:
+  explicit printf_width_handler(format_specs& specs) : specs_(specs) {}
+
+  template <typename T, FMT_ENABLE_IF(std::is_integral<T>::value)>
+  unsigned operator()(T value) {
+    auto width = static_cast<uint32_or_64_or_128_t<T>>(value);
+    if (detail::is_negative(value)) {
+      specs_.align = align::left;
+      width = 0 - width;
+    }
+    unsigned int_max = max_value<int>();
+    if (width > int_max) FMT_THROW(format_error("number is too big"));
+    return static_cast<unsigned>(width);
+  }
+
+  template <typename T, FMT_ENABLE_IF(!std::is_integral<T>::value)>
+  unsigned operator()(T) {
+    FMT_THROW(format_error("width is not integer"));
+    return 0;
+  }
+};
+
+// The ``printf`` argument formatter.
+template <typename OutputIt, typename Char>
+class printf_arg_formatter : public arg_formatter<Char> {
+ private:
+  using base = arg_formatter<Char>;
+  using context_type = basic_printf_context<OutputIt, Char>;
+  using format_specs = basic_format_specs<Char>;
+
+  context_type& context_;
+
+  OutputIt write_null_pointer(bool is_string = false) {
+    auto s = this->specs;
+    s.type = presentation_type::none;
+    return write_bytes(this->out, is_string ? "(null)" : "(nil)", s);
+  }
+
+ public:
+  printf_arg_formatter(OutputIt iter, format_specs& s, context_type& ctx)
+      : base{iter, s, locale_ref()}, context_(ctx) {}
+
+  OutputIt operator()(monostate value) { return base::operator()(value); }
+
+  template <typename T, FMT_ENABLE_IF(detail::is_integral<T>::value)>
+  OutputIt operator()(T value) {
+    // MSVC2013 fails to compile separate overloads for bool and Char so use
+    // std::is_same instead.
+    if (std::is_same<T, Char>::value) {
+      format_specs fmt_specs = this->specs;
+      if (fmt_specs.type != presentation_type::none &&
+          fmt_specs.type != presentation_type::chr) {
+        return (*this)(static_cast<int>(value));
+      }
+      fmt_specs.sign = sign::none;
+      fmt_specs.alt = false;
+      fmt_specs.fill[0] = ' ';  // Ignore '0' flag for char types.
+      // align::numeric needs to be overwritten here since the '0' flag is
+      // ignored for non-numeric types
+      if (fmt_specs.align == align::none || fmt_specs.align == align::numeric)
+        fmt_specs.align = align::right;
+      return write<Char>(this->out, static_cast<Char>(value), fmt_specs);
+    }
+    return base::operator()(value);
+  }
+
+  template <typename T, FMT_ENABLE_IF(std::is_floating_point<T>::value)>
+  OutputIt operator()(T value) {
+    return base::operator()(value);
+  }
+
+  /** Formats a null-terminated C string. */
+  OutputIt operator()(const char* value) {
+    if (value) return base::operator()(value);
+    return write_null_pointer(this->specs.type != presentation_type::pointer);
+  }
+
+  /** Formats a null-terminated wide C string. */
+  OutputIt operator()(const wchar_t* value) {
+    if (value) return base::operator()(value);
+    return write_null_pointer(this->specs.type != presentation_type::pointer);
+  }
+
+  OutputIt operator()(basic_string_view<Char> value) {
+    return base::operator()(value);
+  }
+
+  /** Formats a pointer. */
+  OutputIt operator()(const void* value) {
+    return value ? base::operator()(value) : write_null_pointer();
+  }
+
+  /** Formats an argument of a custom (user-defined) type. */
+  OutputIt operator()(typename basic_format_arg<context_type>::handle handle) {
+    auto parse_ctx =
+        basic_printf_parse_context<Char>(basic_string_view<Char>());
+    handle.format(parse_ctx, context_);
+    return this->out;
+  }
+};
+
+template <typename Char>
+void parse_flags(basic_format_specs<Char>& specs, const Char*& it,
+                 const Char* end) {
+  for (; it != end; ++it) {
+    switch (*it) {
+    case '-':
+      specs.align = align::left;
+      break;
+    case '+':
+      specs.sign = sign::plus;
+      break;
+    case '0':
+      specs.fill[0] = '0';
+      break;
+    case ' ':
+      if (specs.sign != sign::plus) {
+        specs.sign = sign::space;
+      }
+      break;
+    case '#':
+      specs.alt = true;
+      break;
+    default:
+      return;
+    }
+  }
+}
+
+template <typename Char, typename GetArg>
+int parse_header(const Char*& it, const Char* end,
+                 basic_format_specs<Char>& specs, GetArg get_arg) {
+  int arg_index = -1;
+  Char c = *it;
+  if (c >= '0' && c <= '9') {
+    // Parse an argument index (if followed by '$') or a width possibly
+    // preceded with '0' flag(s).
+    int value = parse_nonnegative_int(it, end, -1);
+    if (it != end && *it == '$') {  // value is an argument index
+      ++it;
+      arg_index = value != -1 ? value : max_value<int>();
+    } else {
+      if (c == '0') specs.fill[0] = '0';
+      if (value != 0) {
+        // Nonzero value means that we parsed width and don't need to
+        // parse it or flags again, so return now.
+        if (value == -1) FMT_THROW(format_error("number is too big"));
+        specs.width = value;
+        return arg_index;
+      }
+    }
+  }
+  parse_flags(specs, it, end);
+  // Parse width.
+  if (it != end) {
+    if (*it >= '0' && *it <= '9') {
+      specs.width = parse_nonnegative_int(it, end, -1);
+      if (specs.width == -1) FMT_THROW(format_error("number is too big"));
+    } else if (*it == '*') {
+      ++it;
+      specs.width = static_cast<int>(visit_format_arg(
+          detail::printf_width_handler<Char>(specs), get_arg(-1)));
+    }
+  }
+  return arg_index;
+}
+
+template <typename Char, typename Context>
+void vprintf(buffer<Char>& buf, basic_string_view<Char> format,
+             basic_format_args<Context> args) {
+  using OutputIt = buffer_appender<Char>;
+  auto out = OutputIt(buf);
+  auto context = basic_printf_context<OutputIt, Char>(out, args);
+  auto parse_ctx = basic_printf_parse_context<Char>(format);
+
+  // Returns the argument with specified index or, if arg_index is -1, the next
+  // argument.
+  auto get_arg = [&](int arg_index) {
+    if (arg_index < 0)
+      arg_index = parse_ctx.next_arg_id();
+    else
+      parse_ctx.check_arg_id(--arg_index);
+    return detail::get_arg(context, arg_index);
+  };
+
+  const Char* start = parse_ctx.begin();
+  const Char* end = parse_ctx.end();
+  auto it = start;
+  while (it != end) {
+    if (!detail::find<false, Char>(it, end, '%', it)) {
+      it = end;  // detail::find leaves it == nullptr if it doesn't find '%'
+      break;
+    }
+    Char c = *it++;
+    if (it != end && *it == c) {
+      out = detail::write(
+          out, basic_string_view<Char>(start, detail::to_unsigned(it - start)));
+      start = ++it;
+      continue;
+    }
+    out = detail::write(out, basic_string_view<Char>(
+                                 start, detail::to_unsigned(it - 1 - start)));
+
+    basic_format_specs<Char> specs;
+    specs.align = align::right;
+
+    // Parse argument index, flags and width.
+    int arg_index = parse_header(it, end, specs, get_arg);
+    if (arg_index == 0) parse_ctx.on_error("argument not found");
+
+    // Parse precision.
+    if (it != end && *it == '.') {
+      ++it;
+      c = it != end ? *it : 0;
+      if ('0' <= c && c <= '9') {
+        specs.precision = parse_nonnegative_int(it, end, 0);
+      } else if (c == '*') {
+        ++it;
+        specs.precision = static_cast<int>(
+            visit_format_arg(detail::printf_precision_handler(), get_arg(-1)));
+      } else {
+        specs.precision = 0;
+      }
+    }
+
+    auto arg = get_arg(arg_index);
+    // For d, i, o, u, x, and X conversion specifiers, if a precision is
+    // specified, the '0' flag is ignored
+    if (specs.precision >= 0 && arg.is_integral())
+      specs.fill[0] =
+          ' ';  // Ignore '0' flag for non-numeric types or if '-' present.
+    if (specs.precision >= 0 && arg.type() == detail::type::cstring_type) {
+      auto str = visit_format_arg(detail::get_cstring<Char>(), arg);
+      auto str_end = str + specs.precision;
+      auto nul = std::find(str, str_end, Char());
+      arg = detail::make_arg<basic_printf_context<OutputIt, Char>>(
+          basic_string_view<Char>(
+              str, detail::to_unsigned(nul != str_end ? nul - str
+                                                      : specs.precision)));
+    }
+    if (specs.alt && visit_format_arg(detail::is_zero_int(), arg))
+      specs.alt = false;
+    if (specs.fill[0] == '0') {
+      if (arg.is_arithmetic() && specs.align != align::left)
+        specs.align = align::numeric;
+      else
+        specs.fill[0] = ' ';  // Ignore '0' flag for non-numeric types or if '-'
+                              // flag is also present.
+    }
+
+    // Parse length and convert the argument to the required type.
+    c = it != end ? *it++ : 0;
+    Char t = it != end ? *it : 0;
+    using detail::convert_arg;
+    switch (c) {
+    case 'h':
+      if (t == 'h') {
+        ++it;
+        t = it != end ? *it : 0;
+        convert_arg<signed char>(arg, t);
+      } else {
+        convert_arg<short>(arg, t);
+      }
+      break;
+    case 'l':
+      if (t == 'l') {
+        ++it;
+        t = it != end ? *it : 0;
+        convert_arg<long long>(arg, t);
+      } else {
+        convert_arg<long>(arg, t);
+      }
+      break;
+    case 'j':
+      convert_arg<intmax_t>(arg, t);
+      break;
+    case 'z':
+      convert_arg<size_t>(arg, t);
+      break;
+    case 't':
+      convert_arg<std::ptrdiff_t>(arg, t);
+      break;
+    case 'L':
+      // printf produces garbage when 'L' is omitted for long double, no
+      // need to do the same.
+      break;
+    default:
+      --it;
+      convert_arg<void>(arg, c);
+    }
+
+    // Parse type.
+    if (it == end) FMT_THROW(format_error("invalid format string"));
+    char type = static_cast<char>(*it++);
+    if (arg.is_integral()) {
+      // Normalize type.
+      switch (type) {
+      case 'i':
+      case 'u':
+        type = 'd';
+        break;
+      case 'c':
+        visit_format_arg(
+            detail::char_converter<basic_printf_context<OutputIt, Char>>(arg),
+            arg);
+        break;
+      }
+    }
+    specs.type = parse_presentation_type(type);
+    if (specs.type == presentation_type::none)
+      parse_ctx.on_error("invalid type specifier");
+
+    start = it;
+
+    // Format argument.
+    out = visit_format_arg(
+        detail::printf_arg_formatter<OutputIt, Char>(out, specs, context), arg);
+  }
+  detail::write(out, basic_string_view<Char>(start, to_unsigned(it - start)));
+}
+FMT_END_DETAIL_NAMESPACE
+
+template <typename Char>
+using basic_printf_context_t =
+    basic_printf_context<detail::buffer_appender<Char>, Char>;
+
+using printf_context = basic_printf_context_t<char>;
+using wprintf_context = basic_printf_context_t<wchar_t>;
+
+using printf_args = basic_format_args<printf_context>;
+using wprintf_args = basic_format_args<wprintf_context>;
+
+/**
+  \rst
+  Constructs an `~fmt::format_arg_store` object that contains references to
+  arguments and can be implicitly converted to `~fmt::printf_args`.
+  \endrst
+ */
+template <typename... T>
+inline auto make_printf_args(const T&... args)
+    -> format_arg_store<printf_context, T...> {
+  return {args...};
+}
+
+/**
+  \rst
+  Constructs an `~fmt::format_arg_store` object that contains references to
+  arguments and can be implicitly converted to `~fmt::wprintf_args`.
+  \endrst
+ */
+template <typename... T>
+inline auto make_wprintf_args(const T&... args)
+    -> format_arg_store<wprintf_context, T...> {
+  return {args...};
+}
+
+template <typename S, typename Char = char_t<S>>
+inline auto vsprintf(
+    const S& fmt,
+    basic_format_args<basic_printf_context_t<type_identity_t<Char>>> args)
+    -> std::basic_string<Char> {
+  basic_memory_buffer<Char> buffer;
+  vprintf(buffer, detail::to_string_view(fmt), args);
+  return to_string(buffer);
+}
+
+/**
+  \rst
+  Formats arguments and returns the result as a string.
+
+  **Example**::
+
+    std::string message = fmt::sprintf("The answer is %d", 42);
+  \endrst
+*/
+template <typename S, typename... T,
+          typename Char = enable_if_t<detail::is_string<S>::value, char_t<S>>>
+inline auto sprintf(const S& fmt, const T&... args) -> std::basic_string<Char> {
+  using context = basic_printf_context_t<Char>;
+  return vsprintf(detail::to_string_view(fmt),
+                  fmt::make_format_args<context>(args...));
+}
+
+template <typename S, typename Char = char_t<S>>
+inline auto vfprintf(
+    std::FILE* f, const S& fmt,
+    basic_format_args<basic_printf_context_t<type_identity_t<Char>>> args)
+    -> int {
+  basic_memory_buffer<Char> buffer;
+  vprintf(buffer, detail::to_string_view(fmt), args);
+  size_t size = buffer.size();
+  return std::fwrite(buffer.data(), sizeof(Char), size, f) < size
+             ? -1
+             : static_cast<int>(size);
+}
+
+/**
+  \rst
+  Prints formatted data to the file *f*.
+
+  **Example**::
+
+    fmt::fprintf(stderr, "Don't %s!", "panic");
+  \endrst
+ */
+template <typename S, typename... T, typename Char = char_t<S>>
+inline auto fprintf(std::FILE* f, const S& fmt, const T&... args) -> int {
+  using context = basic_printf_context_t<Char>;
+  return vfprintf(f, detail::to_string_view(fmt),
+                  fmt::make_format_args<context>(args...));
+}
+
+template <typename S, typename Char = char_t<S>>
+inline auto vprintf(
+    const S& fmt,
+    basic_format_args<basic_printf_context_t<type_identity_t<Char>>> args)
+    -> int {
+  return vfprintf(stdout, detail::to_string_view(fmt), args);
+}
+
+/**
+  \rst
+  Prints formatted data to ``stdout``.
+
+  **Example**::
+
+    fmt::printf("Elapsed time: %.2f seconds", 1.23);
+  \endrst
+ */
+template <typename S, typename... T, FMT_ENABLE_IF(detail::is_string<S>::value)>
+inline auto printf(const S& fmt, const T&... args) -> int {
+  return vprintf(
+      detail::to_string_view(fmt),
+      fmt::make_format_args<basic_printf_context_t<char_t<S>>>(args...));
+}
+
+FMT_MODULE_EXPORT_END
+FMT_END_NAMESPACE
+
+#endif  // FMT_PRINTF_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/ranges.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/ranges.h
new file mode 100644
index 0000000000..dea7d60dd6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/ranges.h
@@ -0,0 +1,722 @@
+// Formatting library for C++ - experimental range support
+//
+// Copyright (c) 2012 - present, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+//
+// Copyright (c) 2018 - present, Remotion (Igor Schulz)
+// All Rights Reserved
+// {fmt} support for ranges, containers and types tuple interface.
+
+#ifndef FMT_RANGES_H_
+#define FMT_RANGES_H_
+
+#include <initializer_list>
+#include <tuple>
+#include <type_traits>
+
+#include "format.h"
+
+FMT_BEGIN_NAMESPACE
+
+namespace detail {
+
+template <typename RangeT, typename OutputIterator>
+OutputIterator copy(const RangeT& range, OutputIterator out) {
+  for (auto it = range.begin(), end = range.end(); it != end; ++it)
+    *out++ = *it;
+  return out;
+}
+
+template <typename OutputIterator>
+OutputIterator copy(const char* str, OutputIterator out) {
+  while (*str) *out++ = *str++;
+  return out;
+}
+
+template <typename OutputIterator>
+OutputIterator copy(char ch, OutputIterator out) {
+  *out++ = ch;
+  return out;
+}
+
+template <typename OutputIterator>
+OutputIterator copy(wchar_t ch, OutputIterator out) {
+  *out++ = ch;
+  return out;
+}
+
+// Returns true if T has a std::string-like interface, like std::string_view.
+template <typename T> class is_std_string_like {
+  template <typename U>
+  static auto check(U* p)
+      -> decltype((void)p->find('a'), p->length(), (void)p->data(), int());
+  template <typename> static void check(...);
+
+ public:
+  static constexpr const bool value =
+      is_string<T>::value ||
+      std::is_convertible<T, std_string_view<char>>::value ||
+      !std::is_void<decltype(check<T>(nullptr))>::value;
+};
+
+template <typename Char>
+struct is_std_string_like<fmt::basic_string_view<Char>> : std::true_type {};
+
+template <typename T> class is_map {
+  template <typename U> static auto check(U*) -> typename U::mapped_type;
+  template <typename> static void check(...);
+
+ public:
+#ifdef FMT_FORMAT_MAP_AS_LIST
+  static constexpr const bool value = false;
+#else
+  static constexpr const bool value =
+      !std::is_void<decltype(check<T>(nullptr))>::value;
+#endif
+};
+
+template <typename T> class is_set {
+  template <typename U> static auto check(U*) -> typename U::key_type;
+  template <typename> static void check(...);
+
+ public:
+#ifdef FMT_FORMAT_SET_AS_LIST
+  static constexpr const bool value = false;
+#else
+  static constexpr const bool value =
+      !std::is_void<decltype(check<T>(nullptr))>::value && !is_map<T>::value;
+#endif
+};
+
+template <typename... Ts> struct conditional_helper {};
+
+template <typename T, typename _ = void> struct is_range_ : std::false_type {};
+
+#if !FMT_MSC_VERSION || FMT_MSC_VERSION > 1800
+
+#  define FMT_DECLTYPE_RETURN(val)  \
+    ->decltype(val) { return val; } \
+    static_assert(                  \
+        true, "")  // This makes it so that a semicolon is required after the
+                   // macro, which helps clang-format handle the formatting.
+
+// C array overload
+template <typename T, std::size_t N>
+auto range_begin(const T (&arr)[N]) -> const T* {
+  return arr;
+}
+template <typename T, std::size_t N>
+auto range_end(const T (&arr)[N]) -> const T* {
+  return arr + N;
+}
+
+template <typename T, typename Enable = void>
+struct has_member_fn_begin_end_t : std::false_type {};
+
+template <typename T>
+struct has_member_fn_begin_end_t<T, void_t<decltype(std::declval<T>().begin()),
+                                           decltype(std::declval<T>().end())>>
+    : std::true_type {};
+
+// Member function overload
+template <typename T>
+auto range_begin(T&& rng) FMT_DECLTYPE_RETURN(static_cast<T&&>(rng).begin());
+template <typename T>
+auto range_end(T&& rng) FMT_DECLTYPE_RETURN(static_cast<T&&>(rng).end());
+
+// ADL overload. Only participates in overload resolution if member functions
+// are not found.
+template <typename T>
+auto range_begin(T&& rng)
+    -> enable_if_t<!has_member_fn_begin_end_t<T&&>::value,
+                   decltype(begin(static_cast<T&&>(rng)))> {
+  return begin(static_cast<T&&>(rng));
+}
+template <typename T>
+auto range_end(T&& rng) -> enable_if_t<!has_member_fn_begin_end_t<T&&>::value,
+                                       decltype(end(static_cast<T&&>(rng)))> {
+  return end(static_cast<T&&>(rng));
+}
+
+template <typename T, typename Enable = void>
+struct has_const_begin_end : std::false_type {};
+template <typename T, typename Enable = void>
+struct has_mutable_begin_end : std::false_type {};
+
+template <typename T>
+struct has_const_begin_end<
+    T,
+    void_t<
+        decltype(detail::range_begin(std::declval<const remove_cvref_t<T>&>())),
+        decltype(detail::range_end(std::declval<const remove_cvref_t<T>&>()))>>
+    : std::true_type {};
+
+template <typename T>
+struct has_mutable_begin_end<
+    T, void_t<decltype(detail::range_begin(std::declval<T>())),
+              decltype(detail::range_end(std::declval<T>())),
+              enable_if_t<std::is_copy_constructible<T>::value>>>
+    : std::true_type {};
+
+template <typename T>
+struct is_range_<T, void>
+    : std::integral_constant<bool, (has_const_begin_end<T>::value ||
+                                    has_mutable_begin_end<T>::value)> {};
+#  undef FMT_DECLTYPE_RETURN
+#endif
+
+// tuple_size and tuple_element check.
+template <typename T> class is_tuple_like_ {
+  template <typename U>
+  static auto check(U* p) -> decltype(std::tuple_size<U>::value, int());
+  template <typename> static void check(...);
+
+ public:
+  static constexpr const bool value =
+      !std::is_void<decltype(check<T>(nullptr))>::value;
+};
+
+// Check for integer_sequence
+#if defined(__cpp_lib_integer_sequence) || FMT_MSC_VERSION >= 1900
+template <typename T, T... N>
+using integer_sequence = std::integer_sequence<T, N...>;
+template <size_t... N> using index_sequence = std::index_sequence<N...>;
+template <size_t N> using make_index_sequence = std::make_index_sequence<N>;
+#else
+template <typename T, T... N> struct integer_sequence {
+  using value_type = T;
+
+  static FMT_CONSTEXPR size_t size() { return sizeof...(N); }
+};
+
+template <size_t... N> using index_sequence = integer_sequence<size_t, N...>;
+
+template <typename T, size_t N, T... Ns>
+struct make_integer_sequence : make_integer_sequence<T, N - 1, N - 1, Ns...> {};
+template <typename T, T... Ns>
+struct make_integer_sequence<T, 0, Ns...> : integer_sequence<T, Ns...> {};
+
+template <size_t N>
+using make_index_sequence = make_integer_sequence<size_t, N>;
+#endif
+
+template <typename T>
+using tuple_index_sequence = make_index_sequence<std::tuple_size<T>::value>;
+
+template <typename T, typename C, bool = is_tuple_like_<T>::value>
+class is_tuple_formattable_ {
+ public:
+  static constexpr const bool value = false;
+};
+template <typename T, typename C> class is_tuple_formattable_<T, C, true> {
+  template <std::size_t... I>
+  static std::true_type check2(index_sequence<I...>,
+                               integer_sequence<bool, (I == I)...>);
+  static std::false_type check2(...);
+  template <std::size_t... I>
+  static decltype(check2(
+      index_sequence<I...>{},
+      integer_sequence<
+          bool, (is_formattable<typename std::tuple_element<I, T>::type,
+                                C>::value)...>{})) check(index_sequence<I...>);
+
+ public:
+  static constexpr const bool value =
+      decltype(check(tuple_index_sequence<T>{}))::value;
+};
+
+template <class Tuple, class F, size_t... Is>
+void for_each(index_sequence<Is...>, Tuple&& tup, F&& f) noexcept {
+  using std::get;
+  // using free function get<I>(T) now.
+  const int _[] = {0, ((void)f(get<Is>(tup)), 0)...};
+  (void)_;  // blocks warnings
+}
+
+template <class T>
+FMT_CONSTEXPR make_index_sequence<std::tuple_size<T>::value> get_indexes(
+    T const&) {
+  return {};
+}
+
+template <class Tuple, class F> void for_each(Tuple&& tup, F&& f) {
+  const auto indexes = get_indexes(tup);
+  for_each(indexes, std::forward<Tuple>(tup), std::forward<F>(f));
+}
+
+#if FMT_MSC_VERSION && FMT_MSC_VERSION < 1920
+// Older MSVC doesn't get the reference type correctly for arrays.
+template <typename R> struct range_reference_type_impl {
+  using type = decltype(*detail::range_begin(std::declval<R&>()));
+};
+
+template <typename T, std::size_t N> struct range_reference_type_impl<T[N]> {
+  using type = T&;
+};
+
+template <typename T>
+using range_reference_type = typename range_reference_type_impl<T>::type;
+#else
+template <typename Range>
+using range_reference_type =
+    decltype(*detail::range_begin(std::declval<Range&>()));
+#endif
+
+// We don't use the Range's value_type for anything, but we do need the Range's
+// reference type, with cv-ref stripped.
+template <typename Range>
+using uncvref_type = remove_cvref_t<range_reference_type<Range>>;
+
+template <typename Range>
+using uncvref_first_type =
+    remove_cvref_t<decltype(std::declval<range_reference_type<Range>>().first)>;
+
+template <typename Range>
+using uncvref_second_type = remove_cvref_t<
+    decltype(std::declval<range_reference_type<Range>>().second)>;
+
+template <typename OutputIt> OutputIt write_delimiter(OutputIt out) {
+  *out++ = ',';
+  *out++ = ' ';
+  return out;
+}
+
+template <typename Char, typename OutputIt>
+auto write_range_entry(OutputIt out, basic_string_view<Char> str) -> OutputIt {
+  return write_escaped_string(out, str);
+}
+
+template <typename Char, typename OutputIt, typename T,
+          FMT_ENABLE_IF(std::is_convertible<T, std_string_view<char>>::value)>
+inline auto write_range_entry(OutputIt out, const T& str) -> OutputIt {
+  auto sv = std_string_view<Char>(str);
+  return write_range_entry<Char>(out, basic_string_view<Char>(sv));
+}
+
+template <typename Char, typename OutputIt, typename Arg,
+          FMT_ENABLE_IF(std::is_same<Arg, Char>::value)>
+OutputIt write_range_entry(OutputIt out, const Arg v) {
+  return write_escaped_char(out, v);
+}
+
+template <
+    typename Char, typename OutputIt, typename Arg,
+    FMT_ENABLE_IF(!is_std_string_like<typename std::decay<Arg>::type>::value &&
+                  !std::is_same<Arg, Char>::value)>
+OutputIt write_range_entry(OutputIt out, const Arg& v) {
+  return write<Char>(out, v);
+}
+
+}  // namespace detail
+
+template <typename T> struct is_tuple_like {
+  static constexpr const bool value =
+      detail::is_tuple_like_<T>::value && !detail::is_range_<T>::value;
+};
+
+template <typename T, typename C> struct is_tuple_formattable {
+  static constexpr const bool value =
+      detail::is_tuple_formattable_<T, C>::value;
+};
+
+template <typename TupleT, typename Char>
+struct formatter<TupleT, Char,
+                 enable_if_t<fmt::is_tuple_like<TupleT>::value &&
+                             fmt::is_tuple_formattable<TupleT, Char>::value>> {
+ private:
+  basic_string_view<Char> separator_ = detail::string_literal<Char, ',', ' '>{};
+  basic_string_view<Char> opening_bracket_ =
+      detail::string_literal<Char, '('>{};
+  basic_string_view<Char> closing_bracket_ =
+      detail::string_literal<Char, ')'>{};
+
+  // C++11 generic lambda for format().
+  template <typename FormatContext> struct format_each {
+    template <typename T> void operator()(const T& v) {
+      if (i > 0) out = detail::copy_str<Char>(separator, out);
+      out = detail::write_range_entry<Char>(out, v);
+      ++i;
+    }
+    int i;
+    typename FormatContext::iterator& out;
+    basic_string_view<Char> separator;
+  };
+
+ public:
+  FMT_CONSTEXPR formatter() {}
+
+  FMT_CONSTEXPR void set_separator(basic_string_view<Char> sep) {
+    separator_ = sep;
+  }
+
+  FMT_CONSTEXPR void set_brackets(basic_string_view<Char> open,
+                                  basic_string_view<Char> close) {
+    opening_bracket_ = open;
+    closing_bracket_ = close;
+  }
+
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    return ctx.begin();
+  }
+
+  template <typename FormatContext = format_context>
+  auto format(const TupleT& values, FormatContext& ctx) const
+      -> decltype(ctx.out()) {
+    auto out = ctx.out();
+    out = detail::copy_str<Char>(opening_bracket_, out);
+    detail::for_each(values, format_each<FormatContext>{0, out, separator_});
+    out = detail::copy_str<Char>(closing_bracket_, out);
+    return out;
+  }
+};
+
+template <typename T, typename Char> struct is_range {
+  static constexpr const bool value =
+      detail::is_range_<T>::value && !detail::is_std_string_like<T>::value &&
+      !std::is_convertible<T, std::basic_string<Char>>::value &&
+      !std::is_convertible<T, detail::std_string_view<Char>>::value;
+};
+
+namespace detail {
+template <typename Context> struct range_mapper {
+  using mapper = arg_mapper<Context>;
+
+  template <typename T,
+            FMT_ENABLE_IF(has_formatter<remove_cvref_t<T>, Context>::value)>
+  static auto map(T&& value) -> T&& {
+    return static_cast<T&&>(value);
+  }
+  template <typename T,
+            FMT_ENABLE_IF(!has_formatter<remove_cvref_t<T>, Context>::value)>
+  static auto map(T&& value)
+      -> decltype(mapper().map(static_cast<T&&>(value))) {
+    return mapper().map(static_cast<T&&>(value));
+  }
+};
+
+template <typename Char, typename Element>
+using range_formatter_type = conditional_t<
+    is_formattable<Element, Char>::value,
+    formatter<remove_cvref_t<decltype(range_mapper<buffer_context<Char>>{}.map(
+                  std::declval<Element>()))>,
+              Char>,
+    fallback_formatter<Element, Char>>;
+
+template <typename R>
+using maybe_const_range =
+    conditional_t<has_const_begin_end<R>::value, const R, R>;
+
+// Workaround a bug in MSVC 2015 and earlier.
+#if !FMT_MSC_VERSION || FMT_MSC_VERSION >= 1910
+template <typename R, typename Char>
+struct is_formattable_delayed
+    : disjunction<
+          is_formattable<uncvref_type<maybe_const_range<R>>, Char>,
+          has_fallback_formatter<uncvref_type<maybe_const_range<R>>, Char>> {};
+#endif
+
+}  // namespace detail
+
+template <typename T, typename Char, typename Enable = void>
+struct range_formatter;
+
+template <typename T, typename Char>
+struct range_formatter<
+    T, Char,
+    enable_if_t<conjunction<
+        std::is_same<T, remove_cvref_t<T>>,
+        disjunction<is_formattable<T, Char>,
+                    detail::has_fallback_formatter<T, Char>>>::value>> {
+ private:
+  detail::range_formatter_type<Char, T> underlying_;
+  bool custom_specs_ = false;
+  basic_string_view<Char> separator_ = detail::string_literal<Char, ',', ' '>{};
+  basic_string_view<Char> opening_bracket_ =
+      detail::string_literal<Char, '['>{};
+  basic_string_view<Char> closing_bracket_ =
+      detail::string_literal<Char, ']'>{};
+
+  template <class U>
+  FMT_CONSTEXPR static auto maybe_set_debug_format(U& u, int)
+      -> decltype(u.set_debug_format()) {
+    u.set_debug_format();
+  }
+
+  template <class U>
+  FMT_CONSTEXPR static void maybe_set_debug_format(U&, ...) {}
+
+  FMT_CONSTEXPR void maybe_set_debug_format() {
+    maybe_set_debug_format(underlying_, 0);
+  }
+
+ public:
+  FMT_CONSTEXPR range_formatter() {}
+
+  FMT_CONSTEXPR auto underlying() -> detail::range_formatter_type<Char, T>& {
+    return underlying_;
+  }
+
+  FMT_CONSTEXPR void set_separator(basic_string_view<Char> sep) {
+    separator_ = sep;
+  }
+
+  FMT_CONSTEXPR void set_brackets(basic_string_view<Char> open,
+                                  basic_string_view<Char> close) {
+    opening_bracket_ = open;
+    closing_bracket_ = close;
+  }
+
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    auto it = ctx.begin();
+    auto end = ctx.end();
+    if (it == end || *it == '}') {
+      maybe_set_debug_format();
+      return it;
+    }
+
+    if (*it == 'n') {
+      set_brackets({}, {});
+      ++it;
+    }
+
+    if (*it == '}') {
+      maybe_set_debug_format();
+      return it;
+    }
+
+    if (*it != ':')
+      FMT_THROW(format_error("no other top-level range formatters supported"));
+
+    custom_specs_ = true;
+    ++it;
+    ctx.advance_to(it);
+    return underlying_.parse(ctx);
+  }
+
+  template <typename R, class FormatContext>
+  auto format(R&& range, FormatContext& ctx) const -> decltype(ctx.out()) {
+    detail::range_mapper<buffer_context<Char>> mapper;
+    auto out = ctx.out();
+    out = detail::copy_str<Char>(opening_bracket_, out);
+    int i = 0;
+    auto it = detail::range_begin(range);
+    auto end = detail::range_end(range);
+    for (; it != end; ++it) {
+      if (i > 0) out = detail::copy_str<Char>(separator_, out);
+      ;
+      ctx.advance_to(out);
+      out = underlying_.format(mapper.map(*it), ctx);
+      ++i;
+    }
+    out = detail::copy_str<Char>(closing_bracket_, out);
+    return out;
+  }
+};
+
+enum class range_format { disabled, map, set, sequence, string, debug_string };
+
+namespace detail {
+template <typename T> struct range_format_kind_ {
+  static constexpr auto value = std::is_same<range_reference_type<T>, T>::value
+                                    ? range_format::disabled
+                                : is_map<T>::value ? range_format::map
+                                : is_set<T>::value ? range_format::set
+                                                   : range_format::sequence;
+};
+
+template <range_format K, typename R, typename Char, typename Enable = void>
+struct range_default_formatter;
+
+template <range_format K>
+using range_format_constant = std::integral_constant<range_format, K>;
+
+template <range_format K, typename R, typename Char>
+struct range_default_formatter<
+    K, R, Char,
+    enable_if_t<(K == range_format::sequence || K == range_format::map ||
+                 K == range_format::set)>> {
+  using range_type = detail::maybe_const_range<R>;
+  range_formatter<detail::uncvref_type<range_type>, Char> underlying_;
+
+  FMT_CONSTEXPR range_default_formatter() { init(range_format_constant<K>()); }
+
+  FMT_CONSTEXPR void init(range_format_constant<range_format::set>) {
+    underlying_.set_brackets(detail::string_literal<Char, '{'>{},
+                             detail::string_literal<Char, '}'>{});
+  }
+
+  FMT_CONSTEXPR void init(range_format_constant<range_format::map>) {
+    underlying_.set_brackets(detail::string_literal<Char, '{'>{},
+                             detail::string_literal<Char, '}'>{});
+    underlying_.underlying().set_brackets({}, {});
+    underlying_.underlying().set_separator(
+        detail::string_literal<Char, ':', ' '>{});
+  }
+
+  FMT_CONSTEXPR void init(range_format_constant<range_format::sequence>) {}
+
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    return underlying_.parse(ctx);
+  }
+
+  template <typename FormatContext>
+  auto format(range_type& range, FormatContext& ctx) const
+      -> decltype(ctx.out()) {
+    return underlying_.format(range, ctx);
+  }
+};
+}  // namespace detail
+
+template <typename T, typename Char, typename Enable = void>
+struct range_format_kind
+    : conditional_t<
+          is_range<T, Char>::value, detail::range_format_kind_<T>,
+          std::integral_constant<range_format, range_format::disabled>> {};
+
+template <typename R, typename Char>
+struct formatter<
+    R, Char,
+    enable_if_t<conjunction<bool_constant<range_format_kind<R, Char>::value !=
+                                          range_format::disabled>
+// Workaround a bug in MSVC 2015 and earlier.
+#if !FMT_MSC_VERSION || FMT_MSC_VERSION >= 1910
+                            ,
+                            detail::is_formattable_delayed<R, Char>
+#endif
+                            >::value>>
+    : detail::range_default_formatter<range_format_kind<R, Char>::value, R,
+                                      Char> {
+};
+
+template <typename Char, typename... T> struct tuple_join_view : detail::view {
+  const std::tuple<T...>& tuple;
+  basic_string_view<Char> sep;
+
+  tuple_join_view(const std::tuple<T...>& t, basic_string_view<Char> s)
+      : tuple(t), sep{s} {}
+};
+
+template <typename Char, typename... T>
+using tuple_arg_join = tuple_join_view<Char, T...>;
+
+// Define FMT_TUPLE_JOIN_SPECIFIERS to enable experimental format specifiers
+// support in tuple_join. It is disabled by default because of issues with
+// the dynamic width and precision.
+#ifndef FMT_TUPLE_JOIN_SPECIFIERS
+#  define FMT_TUPLE_JOIN_SPECIFIERS 0
+#endif
+
+template <typename Char, typename... T>
+struct formatter<tuple_join_view<Char, T...>, Char> {
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    return do_parse(ctx, std::integral_constant<size_t, sizeof...(T)>());
+  }
+
+  template <typename FormatContext>
+  auto format(const tuple_join_view<Char, T...>& value,
+              FormatContext& ctx) const -> typename FormatContext::iterator {
+    return do_format(value, ctx,
+                     std::integral_constant<size_t, sizeof...(T)>());
+  }
+
+ private:
+  std::tuple<formatter<typename std::decay<T>::type, Char>...> formatters_;
+
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto do_parse(ParseContext& ctx,
+                              std::integral_constant<size_t, 0>)
+      -> decltype(ctx.begin()) {
+    return ctx.begin();
+  }
+
+  template <typename ParseContext, size_t N>
+  FMT_CONSTEXPR auto do_parse(ParseContext& ctx,
+                              std::integral_constant<size_t, N>)
+      -> decltype(ctx.begin()) {
+    auto end = ctx.begin();
+#if FMT_TUPLE_JOIN_SPECIFIERS
+    end = std::get<sizeof...(T) - N>(formatters_).parse(ctx);
+    if (N > 1) {
+      auto end1 = do_parse(ctx, std::integral_constant<size_t, N - 1>());
+      if (end != end1)
+        FMT_THROW(format_error("incompatible format specs for tuple elements"));
+    }
+#endif
+    return end;
+  }
+
+  template <typename FormatContext>
+  auto do_format(const tuple_join_view<Char, T...>&, FormatContext& ctx,
+                 std::integral_constant<size_t, 0>) const ->
+      typename FormatContext::iterator {
+    return ctx.out();
+  }
+
+  template <typename FormatContext, size_t N>
+  auto do_format(const tuple_join_view<Char, T...>& value, FormatContext& ctx,
+                 std::integral_constant<size_t, N>) const ->
+      typename FormatContext::iterator {
+    auto out = std::get<sizeof...(T) - N>(formatters_)
+                   .format(std::get<sizeof...(T) - N>(value.tuple), ctx);
+    if (N > 1) {
+      out = std::copy(value.sep.begin(), value.sep.end(), out);
+      ctx.advance_to(out);
+      return do_format(value, ctx, std::integral_constant<size_t, N - 1>());
+    }
+    return out;
+  }
+};
+
+FMT_MODULE_EXPORT_BEGIN
+
+/**
+  \rst
+  Returns an object that formats `tuple` with elements separated by `sep`.
+
+  **Example**::
+
+    std::tuple<int, char> t = {1, 'a'};
+    fmt::print("{}", fmt::join(t, ", "));
+    // Output: "1, a"
+  \endrst
+ */
+template <typename... T>
+FMT_CONSTEXPR auto join(const std::tuple<T...>& tuple, string_view sep)
+    -> tuple_join_view<char, T...> {
+  return {tuple, sep};
+}
+
+template <typename... T>
+FMT_CONSTEXPR auto join(const std::tuple<T...>& tuple,
+                        basic_string_view<wchar_t> sep)
+    -> tuple_join_view<wchar_t, T...> {
+  return {tuple, sep};
+}
+
+/**
+  \rst
+  Returns an object that formats `initializer_list` with elements separated by
+  `sep`.
+
+  **Example**::
+
+    fmt::print("{}", fmt::join({1, 2, 3}, ", "));
+    // Output: "1, 2, 3"
+  \endrst
+ */
+template <typename T>
+auto join(std::initializer_list<T> list, string_view sep)
+    -> join_view<const T*, const T*> {
+  return join(std::begin(list), std::end(list), sep);
+}
+
+FMT_MODULE_EXPORT_END
+FMT_END_NAMESPACE
+
+#endif  // FMT_RANGES_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/std.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/std.h
new file mode 100644
index 0000000000..41d2b2838b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/std.h
@@ -0,0 +1,171 @@
+// Formatting library for C++ - formatters for standard library types
+//
+// Copyright (c) 2012 - present, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_STD_H_
+#define FMT_STD_H_
+
+#include <thread>
+#include <type_traits>
+#include <utility>
+
+#include "ostream.h"
+
+#if FMT_HAS_INCLUDE(<version>)
+#  include <version>
+#endif
+// Checking FMT_CPLUSPLUS for warning suppression in MSVC.
+#if FMT_CPLUSPLUS >= 201703L
+#  if FMT_HAS_INCLUDE(<filesystem>)
+#    include <filesystem>
+#  endif
+#  if FMT_HAS_INCLUDE(<variant>)
+#    include <variant>
+#  endif
+#endif
+
+#ifdef __cpp_lib_filesystem
+FMT_BEGIN_NAMESPACE
+
+namespace detail {
+
+template <typename Char>
+void write_escaped_path(basic_memory_buffer<Char>& quoted,
+                        const std::filesystem::path& p) {
+  write_escaped_string<Char>(std::back_inserter(quoted), p.string<Char>());
+}
+#  ifdef _WIN32
+template <>
+inline void write_escaped_path<char>(basic_memory_buffer<char>& quoted,
+                                     const std::filesystem::path& p) {
+  auto s = p.u8string();
+  write_escaped_string<char>(
+      std::back_inserter(quoted),
+      string_view(reinterpret_cast<const char*>(s.c_str()), s.size()));
+}
+#  endif
+template <>
+inline void write_escaped_path<std::filesystem::path::value_type>(
+    basic_memory_buffer<std::filesystem::path::value_type>& quoted,
+    const std::filesystem::path& p) {
+  write_escaped_string<std::filesystem::path::value_type>(
+      std::back_inserter(quoted), p.native());
+}
+
+}  // namespace detail
+
+template <typename Char>
+struct formatter<std::filesystem::path, Char>
+    : formatter<basic_string_view<Char>> {
+  template <typename FormatContext>
+  auto format(const std::filesystem::path& p, FormatContext& ctx) const ->
+      typename FormatContext::iterator {
+    basic_memory_buffer<Char> quoted;
+    detail::write_escaped_path(quoted, p);
+    return formatter<basic_string_view<Char>>::format(
+        basic_string_view<Char>(quoted.data(), quoted.size()), ctx);
+  }
+};
+FMT_END_NAMESPACE
+#endif
+
+FMT_BEGIN_NAMESPACE
+template <typename Char>
+struct formatter<std::thread::id, Char> : basic_ostream_formatter<Char> {};
+FMT_END_NAMESPACE
+
+#ifdef __cpp_lib_variant
+FMT_BEGIN_NAMESPACE
+template <typename Char> struct formatter<std::monostate, Char> {
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    return ctx.begin();
+  }
+
+  template <typename FormatContext>
+  auto format(const std::monostate&, FormatContext& ctx) const
+      -> decltype(ctx.out()) {
+    auto out = ctx.out();
+    out = detail::write<Char>(out, "monostate");
+    return out;
+  }
+};
+
+namespace detail {
+
+template <typename T>
+using variant_index_sequence =
+    std::make_index_sequence<std::variant_size<T>::value>;
+
+// variant_size and variant_alternative check.
+template <typename T, typename U = void>
+struct is_variant_like_ : std::false_type {};
+template <typename T>
+struct is_variant_like_<T, std::void_t<decltype(std::variant_size<T>::value)>>
+    : std::true_type {};
+
+// formattable element check
+template <typename T, typename C> class is_variant_formattable_ {
+  template <std::size_t... I>
+  static std::conjunction<
+      is_formattable<std::variant_alternative_t<I, T>, C>...>
+      check(std::index_sequence<I...>);
+
+ public:
+  static constexpr const bool value =
+      decltype(check(variant_index_sequence<T>{}))::value;
+};
+
+template <typename Char, typename OutputIt, typename T>
+auto write_variant_alternative(OutputIt out, const T& v) -> OutputIt {
+  if constexpr (is_string<T>::value)
+    return write_escaped_string<Char>(out, detail::to_string_view(v));
+  else if constexpr (std::is_same_v<T, Char>)
+    return write_escaped_char(out, v);
+  else
+    return write<Char>(out, v);
+}
+
+}  // namespace detail
+
+template <typename T> struct is_variant_like {
+  static constexpr const bool value = detail::is_variant_like_<T>::value;
+};
+
+template <typename T, typename C> struct is_variant_formattable {
+  static constexpr const bool value =
+      detail::is_variant_formattable_<T, C>::value;
+};
+
+template <typename Variant, typename Char>
+struct formatter<
+    Variant, Char,
+    std::enable_if_t<std::conjunction_v<
+        is_variant_like<Variant>, is_variant_formattable<Variant, Char>>>> {
+  template <typename ParseContext>
+  FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {
+    return ctx.begin();
+  }
+
+  template <typename FormatContext>
+  auto format(const Variant& value, FormatContext& ctx) const
+      -> decltype(ctx.out()) {
+    auto out = ctx.out();
+
+    out = detail::write<Char>(out, "variant(");
+    std::visit(
+        [&](const auto& v) {
+          out = detail::write_variant_alternative<Char>(out, v);
+        },
+        value);
+    *out++ = ')';
+    return out;
+  }
+};
+FMT_END_NAMESPACE
+#endif
+
+#endif  // FMT_STD_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/xchar.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/xchar.h
new file mode 100644
index 0000000000..3b5bc15ca0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/bundled/xchar.h
@@ -0,0 +1,229 @@
+// Formatting library for C++ - optional wchar_t and exotic character support
+//
+// Copyright (c) 2012 - present, Victor Zverovich
+// All rights reserved.
+//
+// For the license information refer to format.h.
+
+#ifndef FMT_XCHAR_H_
+#define FMT_XCHAR_H_
+
+#include <cwchar>
+
+#include "format.h"
+
+FMT_BEGIN_NAMESPACE
+namespace detail {
+template <typename T>
+using is_exotic_char = bool_constant<!std::is_same<T, char>::value>;
+}
+
+FMT_MODULE_EXPORT_BEGIN
+
+using wstring_view = basic_string_view<wchar_t>;
+using wformat_parse_context = basic_format_parse_context<wchar_t>;
+using wformat_context = buffer_context<wchar_t>;
+using wformat_args = basic_format_args<wformat_context>;
+using wmemory_buffer = basic_memory_buffer<wchar_t>;
+
+#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409
+// Workaround broken conversion on older gcc.
+template <typename... Args> using wformat_string = wstring_view;
+inline auto runtime(wstring_view s) -> wstring_view { return s; }
+#else
+template <typename... Args>
+using wformat_string = basic_format_string<wchar_t, type_identity_t<Args>...>;
+inline auto runtime(wstring_view s) -> basic_runtime<wchar_t> { return {{s}}; }
+#endif
+
+template <> struct is_char<wchar_t> : std::true_type {};
+template <> struct is_char<detail::char8_type> : std::true_type {};
+template <> struct is_char<char16_t> : std::true_type {};
+template <> struct is_char<char32_t> : std::true_type {};
+
+template <typename... Args>
+constexpr format_arg_store<wformat_context, Args...> make_wformat_args(
+    const Args&... args) {
+  return {args...};
+}
+
+inline namespace literals {
+#if FMT_USE_USER_DEFINED_LITERALS && !FMT_USE_NONTYPE_TEMPLATE_ARGS
+constexpr detail::udl_arg<wchar_t> operator"" _a(const wchar_t* s, size_t) {
+  return {s};
+}
+#endif
+}  // namespace literals
+
+template <typename It, typename Sentinel>
+auto join(It begin, Sentinel end, wstring_view sep)
+    -> join_view<It, Sentinel, wchar_t> {
+  return {begin, end, sep};
+}
+
+template <typename Range>
+auto join(Range&& range, wstring_view sep)
+    -> join_view<detail::iterator_t<Range>, detail::sentinel_t<Range>,
+                 wchar_t> {
+  return join(std::begin(range), std::end(range), sep);
+}
+
+template <typename T>
+auto join(std::initializer_list<T> list, wstring_view sep)
+    -> join_view<const T*, const T*, wchar_t> {
+  return join(std::begin(list), std::end(list), sep);
+}
+
+template <typename Char, FMT_ENABLE_IF(!std::is_same<Char, char>::value)>
+auto vformat(basic_string_view<Char> format_str,
+             basic_format_args<buffer_context<type_identity_t<Char>>> args)
+    -> std::basic_string<Char> {
+  basic_memory_buffer<Char> buffer;
+  detail::vformat_to(buffer, format_str, args);
+  return to_string(buffer);
+}
+
+template <typename... T>
+auto format(wformat_string<T...> fmt, T&&... args) -> std::wstring {
+  return vformat(fmt::wstring_view(fmt), fmt::make_wformat_args(args...));
+}
+
+// Pass char_t as a default template parameter instead of using
+// std::basic_string<char_t<S>> to reduce the symbol size.
+template <typename S, typename... Args, typename Char = char_t<S>,
+          FMT_ENABLE_IF(!std::is_same<Char, char>::value &&
+                        !std::is_same<Char, wchar_t>::value)>
+auto format(const S& format_str, Args&&... args) -> std::basic_string<Char> {
+  return vformat(detail::to_string_view(format_str),
+                 fmt::make_format_args<buffer_context<Char>>(args...));
+}
+
+template <typename Locale, typename S, typename Char = char_t<S>,
+          FMT_ENABLE_IF(detail::is_locale<Locale>::value&&
+                            detail::is_exotic_char<Char>::value)>
+inline auto vformat(
+    const Locale& loc, const S& format_str,
+    basic_format_args<buffer_context<type_identity_t<Char>>> args)
+    -> std::basic_string<Char> {
+  return detail::vformat(loc, detail::to_string_view(format_str), args);
+}
+
+template <typename Locale, typename S, typename... Args,
+          typename Char = char_t<S>,
+          FMT_ENABLE_IF(detail::is_locale<Locale>::value&&
+                            detail::is_exotic_char<Char>::value)>
+inline auto format(const Locale& loc, const S& format_str, Args&&... args)
+    -> std::basic_string<Char> {
+  return detail::vformat(loc, detail::to_string_view(format_str),
+                         fmt::make_format_args<buffer_context<Char>>(args...));
+}
+
+template <typename OutputIt, typename S, typename Char = char_t<S>,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, Char>::value&&
+                            detail::is_exotic_char<Char>::value)>
+auto vformat_to(OutputIt out, const S& format_str,
+                basic_format_args<buffer_context<type_identity_t<Char>>> args)
+    -> OutputIt {
+  auto&& buf = detail::get_buffer<Char>(out);
+  detail::vformat_to(buf, detail::to_string_view(format_str), args);
+  return detail::get_iterator(buf);
+}
+
+template <typename OutputIt, typename S, typename... Args,
+          typename Char = char_t<S>,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, Char>::value&&
+                            detail::is_exotic_char<Char>::value)>
+inline auto format_to(OutputIt out, const S& fmt, Args&&... args) -> OutputIt {
+  return vformat_to(out, detail::to_string_view(fmt),
+                    fmt::make_format_args<buffer_context<Char>>(args...));
+}
+
+template <typename Locale, typename S, typename OutputIt, typename... Args,
+          typename Char = char_t<S>,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, Char>::value&&
+                            detail::is_locale<Locale>::value&&
+                                detail::is_exotic_char<Char>::value)>
+inline auto vformat_to(
+    OutputIt out, const Locale& loc, const S& format_str,
+    basic_format_args<buffer_context<type_identity_t<Char>>> args) -> OutputIt {
+  auto&& buf = detail::get_buffer<Char>(out);
+  vformat_to(buf, detail::to_string_view(format_str), args,
+             detail::locale_ref(loc));
+  return detail::get_iterator(buf);
+}
+
+template <
+    typename OutputIt, typename Locale, typename S, typename... Args,
+    typename Char = char_t<S>,
+    bool enable = detail::is_output_iterator<OutputIt, Char>::value&&
+        detail::is_locale<Locale>::value&& detail::is_exotic_char<Char>::value>
+inline auto format_to(OutputIt out, const Locale& loc, const S& format_str,
+                      Args&&... args) ->
+    typename std::enable_if<enable, OutputIt>::type {
+  return vformat_to(out, loc, to_string_view(format_str),
+                    fmt::make_format_args<buffer_context<Char>>(args...));
+}
+
+template <typename OutputIt, typename Char, typename... Args,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, Char>::value&&
+                            detail::is_exotic_char<Char>::value)>
+inline auto vformat_to_n(
+    OutputIt out, size_t n, basic_string_view<Char> format_str,
+    basic_format_args<buffer_context<type_identity_t<Char>>> args)
+    -> format_to_n_result<OutputIt> {
+  detail::iterator_buffer<OutputIt, Char, detail::fixed_buffer_traits> buf(out,
+                                                                           n);
+  detail::vformat_to(buf, format_str, args);
+  return {buf.out(), buf.count()};
+}
+
+template <typename OutputIt, typename S, typename... Args,
+          typename Char = char_t<S>,
+          FMT_ENABLE_IF(detail::is_output_iterator<OutputIt, Char>::value&&
+                            detail::is_exotic_char<Char>::value)>
+inline auto format_to_n(OutputIt out, size_t n, const S& fmt,
+                        const Args&... args) -> format_to_n_result<OutputIt> {
+  return vformat_to_n(out, n, detail::to_string_view(fmt),
+                      fmt::make_format_args<buffer_context<Char>>(args...));
+}
+
+template <typename S, typename... Args, typename Char = char_t<S>,
+          FMT_ENABLE_IF(detail::is_exotic_char<Char>::value)>
+inline auto formatted_size(const S& fmt, Args&&... args) -> size_t {
+  detail::counting_buffer<Char> buf;
+  detail::vformat_to(buf, detail::to_string_view(fmt),
+                     fmt::make_format_args<buffer_context<Char>>(args...));
+  return buf.count();
+}
+
+inline void vprint(std::FILE* f, wstring_view fmt, wformat_args args) {
+  wmemory_buffer buffer;
+  detail::vformat_to(buffer, fmt, args);
+  buffer.push_back(L'\0');
+  if (std::fputws(buffer.data(), f) == -1)
+    FMT_THROW(system_error(errno, FMT_STRING("cannot write to file")));
+}
+
+inline void vprint(wstring_view fmt, wformat_args args) {
+  vprint(stdout, fmt, args);
+}
+
+template <typename... T>
+void print(std::FILE* f, wformat_string<T...> fmt, T&&... args) {
+  return vprint(f, wstring_view(fmt), fmt::make_wformat_args(args...));
+}
+
+template <typename... T> void print(wformat_string<T...> fmt, T&&... args) {
+  return vprint(wstring_view(fmt), fmt::make_wformat_args(args...));
+}
+
+/**
+  Converts *value* to ``std::wstring`` using the default format for type *T*.
+ */
+template <typename T> inline auto to_wstring(const T& value) -> std::wstring {
+  return format(FMT_STRING(L"{}"), value);
+}
+FMT_MODULE_EXPORT_END
+FMT_END_NAMESPACE
+
+#endif  // FMT_XCHAR_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/chrono.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/chrono.h
new file mode 100644
index 0000000000..a72a5bd641
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/chrono.h
@@ -0,0 +1,23 @@
+//
+// Copyright(c) 2016 Gabi Melman.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+//
+
+#pragma once
+//
+// include bundled or external copy of fmtlib's chrono support
+//
+#include <spdlog/tweakme.h>
+
+#if !defined(SPDLOG_USE_STD_FORMAT)
+    #if !defined(SPDLOG_FMT_EXTERNAL)
+        #ifdef SPDLOG_HEADER_ONLY
+            #ifndef FMT_HEADER_ONLY
+                #define FMT_HEADER_ONLY
+            #endif
+        #endif
+        #include <spdlog/fmt/bundled/chrono.h>
+    #else
+        #include <fmt/chrono.h>
+    #endif
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/compile.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/compile.h
new file mode 100644
index 0000000000..3c9c25d8b1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/compile.h
@@ -0,0 +1,23 @@
+//
+// Copyright(c) 2016 Gabi Melman.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+//
+
+#pragma once
+//
+// include bundled or external copy of fmtlib's compile-time support
+//
+#include <spdlog/tweakme.h>
+
+#if !defined(SPDLOG_USE_STD_FORMAT)
+    #if !defined(SPDLOG_FMT_EXTERNAL)
+        #ifdef SPDLOG_HEADER_ONLY
+            #ifndef FMT_HEADER_ONLY
+                #define FMT_HEADER_ONLY
+            #endif
+        #endif
+        #include <spdlog/fmt/bundled/compile.h>
+    #else
+        #include <fmt/compile.h>
+    #endif
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/fmt.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/fmt.h
new file mode 100644
index 0000000000..a83ff2c9b5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/fmt.h
@@ -0,0 +1,34 @@
+//
+// Copyright(c) 2016-2018 Gabi Melman.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+//
+
+#pragma once
+
+//
+// Include a bundled header-only copy of fmtlib or an external one.
+// By default spdlog include its own copy.
+//
+#include <spdlog/tweakme.h>
+
+#if defined(SPDLOG_USE_STD_FORMAT)  // SPDLOG_USE_STD_FORMAT is defined - use std::format
+    #include <format>
+#elif !defined(SPDLOG_FMT_EXTERNAL)
+    #if !defined(SPDLOG_COMPILED_LIB) && !defined(FMT_HEADER_ONLY)
+        #define FMT_HEADER_ONLY
+    #endif
+    #ifndef FMT_USE_WINDOWS_H
+        #define FMT_USE_WINDOWS_H 0
+    #endif
+    // enable the 'n' flag in for backward compatibility with fmt 6.x
+    #define FMT_DEPRECATED_N_SPECIFIER
+    // enable ostream formatting for backward compatibility with fmt 8.x
+    #define FMT_DEPRECATED_OSTREAM
+
+    #include <spdlog/fmt/bundled/core.h>
+    #include <spdlog/fmt/bundled/format.h>
+
+#else  // SPDLOG_FMT_EXTERNAL is defined - use external fmtlib
+    #include <fmt/core.h>
+    #include <fmt/format.h>
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/ostr.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/ostr.h
new file mode 100644
index 0000000000..2b901055f3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/ostr.h
@@ -0,0 +1,23 @@
+//
+// Copyright(c) 2016 Gabi Melman.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+//
+
+#pragma once
+//
+// include bundled or external copy of fmtlib's ostream support
+//
+#include <spdlog/tweakme.h>
+
+#if !defined(SPDLOG_USE_STD_FORMAT)
+    #if !defined(SPDLOG_FMT_EXTERNAL)
+        #ifdef SPDLOG_HEADER_ONLY
+            #ifndef FMT_HEADER_ONLY
+                #define FMT_HEADER_ONLY
+            #endif
+        #endif
+        #include <spdlog/fmt/bundled/ostream.h>
+    #else
+        #include <fmt/ostream.h>
+    #endif
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/ranges.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/ranges.h
new file mode 100644
index 0000000000..5bb91e9acb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/ranges.h
@@ -0,0 +1,23 @@
+//
+// Copyright(c) 2016 Gabi Melman.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+//
+
+#pragma once
+//
+// include bundled or external copy of fmtlib's ranges support
+//
+#include <spdlog/tweakme.h>
+
+#if !defined(SPDLOG_USE_STD_FORMAT)
+    #if !defined(SPDLOG_FMT_EXTERNAL)
+        #ifdef SPDLOG_HEADER_ONLY
+            #ifndef FMT_HEADER_ONLY
+                #define FMT_HEADER_ONLY
+            #endif
+        #endif
+        #include <spdlog/fmt/bundled/ranges.h>
+    #else
+        #include <fmt/ranges.h>
+    #endif
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/std.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/std.h
new file mode 100644
index 0000000000..dabe6f69d8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/std.h
@@ -0,0 +1,24 @@
+//
+// Copyright(c) 2016 Gabi Melman.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+//
+
+#pragma once
+//
+// include bundled or external copy of fmtlib's std support (for formatting e.g.
+// std::filesystem::path, std::thread::id, std::monostate, std::variant, ...)
+//
+#include <spdlog/tweakme.h>
+
+#if !defined(SPDLOG_USE_STD_FORMAT)
+    #if !defined(SPDLOG_FMT_EXTERNAL)
+        #ifdef SPDLOG_HEADER_ONLY
+            #ifndef FMT_HEADER_ONLY
+                #define FMT_HEADER_ONLY
+            #endif
+        #endif
+        #include <spdlog/fmt/bundled/std.h>
+    #else
+        #include <fmt/std.h>
+    #endif
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/xchar.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/xchar.h
new file mode 100644
index 0000000000..2525f05864
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fmt/xchar.h
@@ -0,0 +1,23 @@
+//
+// Copyright(c) 2016 Gabi Melman.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+//
+
+#pragma once
+//
+// include bundled or external copy of fmtlib's xchar support
+//
+#include <spdlog/tweakme.h>
+
+#if !defined(SPDLOG_USE_STD_FORMAT)
+    #if !defined(SPDLOG_FMT_EXTERNAL)
+        #ifdef SPDLOG_HEADER_ONLY
+            #ifndef FMT_HEADER_ONLY
+                #define FMT_HEADER_ONLY
+            #endif
+        #endif
+        #include <spdlog/fmt/bundled/xchar.h>
+    #else
+        #include <fmt/xchar.h>
+    #endif
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/formatter.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/formatter.h
new file mode 100644
index 0000000000..4d482f827e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/formatter.h
@@ -0,0 +1,17 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/log_msg.h>
+#include <spdlog/fmt/fmt.h>
+
+namespace spdlog {
+
+class formatter {
+public:
+    virtual ~formatter() = default;
+    virtual void format(const details::log_msg &msg, memory_buf_t &dest) = 0;
+    virtual std::unique_ptr<formatter> clone() const = 0;
+};
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fwd.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fwd.h
new file mode 100644
index 0000000000..647b16bf0f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/fwd.h
@@ -0,0 +1,18 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+namespace spdlog {
+class logger;
+class formatter;
+
+namespace sinks {
+class sink;
+}
+
+namespace level {
+enum level_enum : int;
+}
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/logger-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/logger-inl.h
new file mode 100644
index 0000000000..5218fe4c44
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/logger-inl.h
@@ -0,0 +1,198 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/logger.h>
+#endif
+
+#include <spdlog/details/backtracer.h>
+#include <spdlog/pattern_formatter.h>
+#include <spdlog/sinks/sink.h>
+
+#include <cstdio>
+
+namespace spdlog {
+
+// public methods
+SPDLOG_INLINE logger::logger(const logger &other)
+    : name_(other.name_),
+      sinks_(other.sinks_),
+      level_(other.level_.load(std::memory_order_relaxed)),
+      flush_level_(other.flush_level_.load(std::memory_order_relaxed)),
+      custom_err_handler_(other.custom_err_handler_),
+      tracer_(other.tracer_) {}
+
+SPDLOG_INLINE logger::logger(logger &&other) SPDLOG_NOEXCEPT
+    : name_(std::move(other.name_)),
+      sinks_(std::move(other.sinks_)),
+      level_(other.level_.load(std::memory_order_relaxed)),
+      flush_level_(other.flush_level_.load(std::memory_order_relaxed)),
+      custom_err_handler_(std::move(other.custom_err_handler_)),
+      tracer_(std::move(other.tracer_))
+
+{}
+
+SPDLOG_INLINE logger &logger::operator=(logger other) SPDLOG_NOEXCEPT {
+    this->swap(other);
+    return *this;
+}
+
+SPDLOG_INLINE void logger::swap(spdlog::logger &other) SPDLOG_NOEXCEPT {
+    name_.swap(other.name_);
+    sinks_.swap(other.sinks_);
+
+    // swap level_
+    auto other_level = other.level_.load();
+    auto my_level = level_.exchange(other_level);
+    other.level_.store(my_level);
+
+    // swap flush level_
+    other_level = other.flush_level_.load();
+    my_level = flush_level_.exchange(other_level);
+    other.flush_level_.store(my_level);
+
+    custom_err_handler_.swap(other.custom_err_handler_);
+    std::swap(tracer_, other.tracer_);
+}
+
+SPDLOG_INLINE void swap(logger &a, logger &b) { a.swap(b); }
+
+SPDLOG_INLINE void logger::set_level(level::level_enum log_level) { level_.store(log_level); }
+
+SPDLOG_INLINE level::level_enum logger::level() const {
+    return static_cast<level::level_enum>(level_.load(std::memory_order_relaxed));
+}
+
+SPDLOG_INLINE const std::string &logger::name() const { return name_; }
+
+// set formatting for the sinks in this logger.
+// each sink will get a separate instance of the formatter object.
+SPDLOG_INLINE void logger::set_formatter(std::unique_ptr<formatter> f) {
+    for (auto it = sinks_.begin(); it != sinks_.end(); ++it) {
+        if (std::next(it) == sinks_.end()) {
+            // last element - we can be move it.
+            (*it)->set_formatter(std::move(f));
+            break;  // to prevent clang-tidy warning
+        } else {
+            (*it)->set_formatter(f->clone());
+        }
+    }
+}
+
+SPDLOG_INLINE void logger::set_pattern(std::string pattern, pattern_time_type time_type) {
+    auto new_formatter = details::make_unique<pattern_formatter>(std::move(pattern), time_type);
+    set_formatter(std::move(new_formatter));
+}
+
+// create new backtrace sink and move to it all our child sinks
+SPDLOG_INLINE void logger::enable_backtrace(size_t n_messages) { tracer_.enable(n_messages); }
+
+// restore orig sinks and level and delete the backtrace sink
+SPDLOG_INLINE void logger::disable_backtrace() { tracer_.disable(); }
+
+SPDLOG_INLINE void logger::dump_backtrace() { dump_backtrace_(); }
+
+// flush functions
+SPDLOG_INLINE void logger::flush() { flush_(); }
+
+SPDLOG_INLINE void logger::flush_on(level::level_enum log_level) { flush_level_.store(log_level); }
+
+SPDLOG_INLINE level::level_enum logger::flush_level() const {
+    return static_cast<level::level_enum>(flush_level_.load(std::memory_order_relaxed));
+}
+
+// sinks
+SPDLOG_INLINE const std::vector<sink_ptr> &logger::sinks() const { return sinks_; }
+
+SPDLOG_INLINE std::vector<sink_ptr> &logger::sinks() { return sinks_; }
+
+// error handler
+SPDLOG_INLINE void logger::set_error_handler(err_handler handler) {
+    custom_err_handler_ = std::move(handler);
+}
+
+// create new logger with same sinks and configuration.
+SPDLOG_INLINE std::shared_ptr<logger> logger::clone(std::string logger_name) {
+    auto cloned = std::make_shared<logger>(*this);
+    cloned->name_ = std::move(logger_name);
+    return cloned;
+}
+
+// protected methods
+SPDLOG_INLINE void logger::log_it_(const spdlog::details::log_msg &log_msg,
+                                   bool log_enabled,
+                                   bool traceback_enabled) {
+    if (log_enabled) {
+        sink_it_(log_msg);
+    }
+    if (traceback_enabled) {
+        tracer_.push_back(log_msg);
+    }
+}
+
+SPDLOG_INLINE void logger::sink_it_(const details::log_msg &msg) {
+    for (auto &sink : sinks_) {
+        if (sink->should_log(msg.level)) {
+            SPDLOG_TRY { sink->log(msg); }
+            SPDLOG_LOGGER_CATCH(msg.source)
+        }
+    }
+
+    if (should_flush_(msg)) {
+        flush_();
+    }
+}
+
+SPDLOG_INLINE void logger::flush_() {
+    for (auto &sink : sinks_) {
+        SPDLOG_TRY { sink->flush(); }
+        SPDLOG_LOGGER_CATCH(source_loc())
+    }
+}
+
+SPDLOG_INLINE void logger::dump_backtrace_() {
+    using details::log_msg;
+    if (tracer_.enabled() && !tracer_.empty()) {
+        sink_it_(
+            log_msg{name(), level::info, "****************** Backtrace Start ******************"});
+        tracer_.foreach_pop([this](const log_msg &msg) { this->sink_it_(msg); });
+        sink_it_(
+            log_msg{name(), level::info, "****************** Backtrace End ********************"});
+    }
+}
+
+SPDLOG_INLINE bool logger::should_flush_(const details::log_msg &msg) {
+    auto flush_level = flush_level_.load(std::memory_order_relaxed);
+    return (msg.level >= flush_level) && (msg.level != level::off);
+}
+
+SPDLOG_INLINE void logger::err_handler_(const std::string &msg) {
+    if (custom_err_handler_) {
+        custom_err_handler_(msg);
+    } else {
+        using std::chrono::system_clock;
+        static std::mutex mutex;
+        static std::chrono::system_clock::time_point last_report_time;
+        static size_t err_counter = 0;
+        std::lock_guard<std::mutex> lk{mutex};
+        auto now = system_clock::now();
+        err_counter++;
+        if (now - last_report_time < std::chrono::seconds(1)) {
+            return;
+        }
+        last_report_time = now;
+        auto tm_time = details::os::localtime(system_clock::to_time_t(now));
+        char date_buf[64];
+        std::strftime(date_buf, sizeof(date_buf), "%Y-%m-%d %H:%M:%S", &tm_time);
+#if defined(USING_R) && defined(R_R_H)  // if in R environment
+        REprintf("[*** LOG ERROR #%04zu ***] [%s] [%s] %s\n", err_counter, date_buf, name().c_str(),
+                 msg.c_str());
+#else
+        std::fprintf(stderr, "[*** LOG ERROR #%04zu ***] [%s] [%s] %s\n", err_counter, date_buf,
+                     name().c_str(), msg.c_str());
+#endif
+    }
+}
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/logger.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/logger.h
new file mode 100644
index 0000000000..f49bdc009a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/logger.h
@@ -0,0 +1,379 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+// Thread safe logger (except for set_error_handler())
+// Has name, log level, vector of std::shared sink pointers and formatter
+// Upon each log write the logger:
+// 1. Checks if its log level is enough to log the message and if yes:
+// 2. Call the underlying sinks to do the job.
+// 3. Each sink use its own private copy of a formatter to format the message
+// and send to its destination.
+//
+// The use of private formatter per sink provides the opportunity to cache some
+// formatted data, and support for different format per sink.
+
+#include <spdlog/common.h>
+#include <spdlog/details/backtracer.h>
+#include <spdlog/details/log_msg.h>
+
+#ifdef SPDLOG_WCHAR_TO_UTF8_SUPPORT
+    #ifndef _WIN32
+        #error SPDLOG_WCHAR_TO_UTF8_SUPPORT only supported on windows
+    #endif
+    #include <spdlog/details/os.h>
+#endif
+
+#include <vector>
+
+#ifndef SPDLOG_NO_EXCEPTIONS
+    #define SPDLOG_LOGGER_CATCH(location)                                                 \
+        catch (const std::exception &ex) {                                                \
+            if (location.filename) {                                                      \
+                err_handler_(fmt_lib::format(SPDLOG_FMT_STRING("{} [{}({})]"), ex.what(), \
+                                             location.filename, location.line));          \
+            } else {                                                                      \
+                err_handler_(ex.what());                                                  \
+            }                                                                             \
+        }                                                                                 \
+        catch (...) {                                                                     \
+            err_handler_("Rethrowing unknown exception in logger");                       \
+            throw;                                                                        \
+        }
+#else
+    #define SPDLOG_LOGGER_CATCH(location)
+#endif
+
+namespace spdlog {
+
+class SPDLOG_API logger {
+public:
+    // Empty logger
+    explicit logger(std::string name)
+        : name_(std::move(name)),
+          sinks_() {}
+
+    // Logger with range on sinks
+    template <typename It>
+    logger(std::string name, It begin, It end)
+        : name_(std::move(name)),
+          sinks_(begin, end) {}
+
+    // Logger with single sink
+    logger(std::string name, sink_ptr single_sink)
+        : logger(std::move(name), {std::move(single_sink)}) {}
+
+    // Logger with sinks init list
+    logger(std::string name, sinks_init_list sinks)
+        : logger(std::move(name), sinks.begin(), sinks.end()) {}
+
+    virtual ~logger() = default;
+
+    logger(const logger &other);
+    logger(logger &&other) SPDLOG_NOEXCEPT;
+    logger &operator=(logger other) SPDLOG_NOEXCEPT;
+    void swap(spdlog::logger &other) SPDLOG_NOEXCEPT;
+
+    template <typename... Args>
+    void log(source_loc loc, level::level_enum lvl, format_string_t<Args...> fmt, Args &&...args) {
+        log_(loc, lvl, details::to_string_view(fmt), std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void log(level::level_enum lvl, format_string_t<Args...> fmt, Args &&...args) {
+        log(source_loc{}, lvl, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename T>
+    void log(level::level_enum lvl, const T &msg) {
+        log(source_loc{}, lvl, msg);
+    }
+
+    // T cannot be statically converted to format string (including string_view/wstring_view)
+    template <class T,
+              typename std::enable_if<!is_convertible_to_any_format_string<const T &>::value,
+                                      int>::type = 0>
+    void log(source_loc loc, level::level_enum lvl, const T &msg) {
+        log(loc, lvl, "{}", msg);
+    }
+
+    void log(log_clock::time_point log_time,
+             source_loc loc,
+             level::level_enum lvl,
+             string_view_t msg) {
+        bool log_enabled = should_log(lvl);
+        bool traceback_enabled = tracer_.enabled();
+        if (!log_enabled && !traceback_enabled) {
+            return;
+        }
+
+        details::log_msg log_msg(log_time, loc, name_, lvl, msg);
+        log_it_(log_msg, log_enabled, traceback_enabled);
+    }
+
+    void log(source_loc loc, level::level_enum lvl, string_view_t msg) {
+        bool log_enabled = should_log(lvl);
+        bool traceback_enabled = tracer_.enabled();
+        if (!log_enabled && !traceback_enabled) {
+            return;
+        }
+
+        details::log_msg log_msg(loc, name_, lvl, msg);
+        log_it_(log_msg, log_enabled, traceback_enabled);
+    }
+
+    void log(level::level_enum lvl, string_view_t msg) { log(source_loc{}, lvl, msg); }
+
+    template <typename... Args>
+    void trace(format_string_t<Args...> fmt, Args &&...args) {
+        log(level::trace, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void debug(format_string_t<Args...> fmt, Args &&...args) {
+        log(level::debug, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void info(format_string_t<Args...> fmt, Args &&...args) {
+        log(level::info, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void warn(format_string_t<Args...> fmt, Args &&...args) {
+        log(level::warn, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void error(format_string_t<Args...> fmt, Args &&...args) {
+        log(level::err, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void critical(format_string_t<Args...> fmt, Args &&...args) {
+        log(level::critical, fmt, std::forward<Args>(args)...);
+    }
+
+#ifdef SPDLOG_WCHAR_TO_UTF8_SUPPORT
+    template <typename... Args>
+    void log(source_loc loc, level::level_enum lvl, wformat_string_t<Args...> fmt, Args &&...args) {
+        log_(loc, lvl, details::to_string_view(fmt), std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void log(level::level_enum lvl, wformat_string_t<Args...> fmt, Args &&...args) {
+        log(source_loc{}, lvl, fmt, std::forward<Args>(args)...);
+    }
+
+    void log(log_clock::time_point log_time,
+             source_loc loc,
+             level::level_enum lvl,
+             wstring_view_t msg) {
+        bool log_enabled = should_log(lvl);
+        bool traceback_enabled = tracer_.enabled();
+        if (!log_enabled && !traceback_enabled) {
+            return;
+        }
+
+        memory_buf_t buf;
+        details::os::wstr_to_utf8buf(wstring_view_t(msg.data(), msg.size()), buf);
+        details::log_msg log_msg(log_time, loc, name_, lvl, string_view_t(buf.data(), buf.size()));
+        log_it_(log_msg, log_enabled, traceback_enabled);
+    }
+
+    void log(source_loc loc, level::level_enum lvl, wstring_view_t msg) {
+        bool log_enabled = should_log(lvl);
+        bool traceback_enabled = tracer_.enabled();
+        if (!log_enabled && !traceback_enabled) {
+            return;
+        }
+
+        memory_buf_t buf;
+        details::os::wstr_to_utf8buf(wstring_view_t(msg.data(), msg.size()), buf);
+        details::log_msg log_msg(loc, name_, lvl, string_view_t(buf.data(), buf.size()));
+        log_it_(log_msg, log_enabled, traceback_enabled);
+    }
+
+    void log(level::level_enum lvl, wstring_view_t msg) { log(source_loc{}, lvl, msg); }
+
+    template <typename... Args>
+    void trace(wformat_string_t<Args...> fmt, Args &&...args) {
+        log(level::trace, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void debug(wformat_string_t<Args...> fmt, Args &&...args) {
+        log(level::debug, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void info(wformat_string_t<Args...> fmt, Args &&...args) {
+        log(level::info, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void warn(wformat_string_t<Args...> fmt, Args &&...args) {
+        log(level::warn, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void error(wformat_string_t<Args...> fmt, Args &&...args) {
+        log(level::err, fmt, std::forward<Args>(args)...);
+    }
+
+    template <typename... Args>
+    void critical(wformat_string_t<Args...> fmt, Args &&...args) {
+        log(level::critical, fmt, std::forward<Args>(args)...);
+    }
+#endif
+
+    template <typename T>
+    void trace(const T &msg) {
+        log(level::trace, msg);
+    }
+
+    template <typename T>
+    void debug(const T &msg) {
+        log(level::debug, msg);
+    }
+
+    template <typename T>
+    void info(const T &msg) {
+        log(level::info, msg);
+    }
+
+    template <typename T>
+    void warn(const T &msg) {
+        log(level::warn, msg);
+    }
+
+    template <typename T>
+    void error(const T &msg) {
+        log(level::err, msg);
+    }
+
+    template <typename T>
+    void critical(const T &msg) {
+        log(level::critical, msg);
+    }
+
+    // return true logging is enabled for the given level.
+    bool should_log(level::level_enum msg_level) const {
+        return msg_level >= level_.load(std::memory_order_relaxed);
+    }
+
+    // return true if backtrace logging is enabled.
+    bool should_backtrace() const { return tracer_.enabled(); }
+
+    void set_level(level::level_enum log_level);
+
+    level::level_enum level() const;
+
+    const std::string &name() const;
+
+    // set formatting for the sinks in this logger.
+    // each sink will get a separate instance of the formatter object.
+    void set_formatter(std::unique_ptr<formatter> f);
+
+    // set formatting for the sinks in this logger.
+    // equivalent to
+    //     set_formatter(make_unique<pattern_formatter>(pattern, time_type))
+    // Note: each sink will get a new instance of a formatter object, replacing the old one.
+    void set_pattern(std::string pattern, pattern_time_type time_type = pattern_time_type::local);
+
+    // backtrace support.
+    // efficiently store all debug/trace messages in a circular buffer until needed for debugging.
+    void enable_backtrace(size_t n_messages);
+    void disable_backtrace();
+    void dump_backtrace();
+
+    // flush functions
+    void flush();
+    void flush_on(level::level_enum log_level);
+    level::level_enum flush_level() const;
+
+    // sinks
+    const std::vector<sink_ptr> &sinks() const;
+
+    std::vector<sink_ptr> &sinks();
+
+    // error handler
+    void set_error_handler(err_handler);
+
+    // create new logger with same sinks and configuration.
+    virtual std::shared_ptr<logger> clone(std::string logger_name);
+
+protected:
+    std::string name_;
+    std::vector<sink_ptr> sinks_;
+    spdlog::level_t level_{level::info};
+    spdlog::level_t flush_level_{level::off};
+    err_handler custom_err_handler_{nullptr};
+    details::backtracer tracer_;
+
+    // common implementation for after templated public api has been resolved
+    template <typename... Args>
+    void log_(source_loc loc, level::level_enum lvl, string_view_t fmt, Args &&...args) {
+        bool log_enabled = should_log(lvl);
+        bool traceback_enabled = tracer_.enabled();
+        if (!log_enabled && !traceback_enabled) {
+            return;
+        }
+        SPDLOG_TRY {
+            memory_buf_t buf;
+#ifdef SPDLOG_USE_STD_FORMAT
+            fmt_lib::vformat_to(std::back_inserter(buf), fmt, fmt_lib::make_format_args(args...));
+#else
+            fmt::vformat_to(fmt::appender(buf), fmt, fmt::make_format_args(args...));
+#endif
+
+            details::log_msg log_msg(loc, name_, lvl, string_view_t(buf.data(), buf.size()));
+            log_it_(log_msg, log_enabled, traceback_enabled);
+        }
+        SPDLOG_LOGGER_CATCH(loc)
+    }
+
+#ifdef SPDLOG_WCHAR_TO_UTF8_SUPPORT
+    template <typename... Args>
+    void log_(source_loc loc, level::level_enum lvl, wstring_view_t fmt, Args &&...args) {
+        bool log_enabled = should_log(lvl);
+        bool traceback_enabled = tracer_.enabled();
+        if (!log_enabled && !traceback_enabled) {
+            return;
+        }
+        SPDLOG_TRY {
+            // format to wmemory_buffer and convert to utf8
+            wmemory_buf_t wbuf;
+            fmt_lib::vformat_to(std::back_inserter(wbuf), fmt,
+                                fmt_lib::make_format_args<fmt_lib::wformat_context>(args...));
+
+            memory_buf_t buf;
+            details::os::wstr_to_utf8buf(wstring_view_t(wbuf.data(), wbuf.size()), buf);
+            details::log_msg log_msg(loc, name_, lvl, string_view_t(buf.data(), buf.size()));
+            log_it_(log_msg, log_enabled, traceback_enabled);
+        }
+        SPDLOG_LOGGER_CATCH(loc)
+    }
+#endif  // SPDLOG_WCHAR_TO_UTF8_SUPPORT
+
+    // log the given message (if the given log level is high enough),
+    // and save backtrace (if backtrace is enabled).
+    void log_it_(const details::log_msg &log_msg, bool log_enabled, bool traceback_enabled);
+    virtual void sink_it_(const details::log_msg &msg);
+    virtual void flush_();
+    void dump_backtrace_();
+    bool should_flush_(const details::log_msg &msg);
+
+    // handle errors during logging.
+    // default handler prints the error to stderr at max rate of 1 message/sec.
+    void err_handler_(const std::string &msg);
+};
+
+void swap(logger &a, logger &b);
+
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "logger-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/pattern_formatter-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/pattern_formatter-inl.h
new file mode 100644
index 0000000000..a5875a11cc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/pattern_formatter-inl.h
@@ -0,0 +1,1268 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/pattern_formatter.h>
+#endif
+
+#include <spdlog/details/fmt_helper.h>
+#include <spdlog/details/log_msg.h>
+#include <spdlog/details/os.h>
+#include <spdlog/fmt/fmt.h>
+#include <spdlog/formatter.h>
+
+#include <algorithm>
+#include <array>
+#include <cctype>
+#include <chrono>
+#include <cstring>
+#include <ctime>
+#include <iterator>
+#include <memory>
+#include <mutex>
+#include <string>
+#include <thread>
+#include <utility>
+#include <vector>
+
+namespace spdlog {
+namespace details {
+
+///////////////////////////////////////////////////////////////////////
+// name & level pattern appender
+///////////////////////////////////////////////////////////////////////
+
+class scoped_padder {
+public:
+    scoped_padder(size_t wrapped_size, const padding_info &padinfo, memory_buf_t &dest)
+        : padinfo_(padinfo),
+          dest_(dest) {
+        remaining_pad_ = static_cast<long>(padinfo.width_) - static_cast<long>(wrapped_size);
+        if (remaining_pad_ <= 0) {
+            return;
+        }
+
+        if (padinfo_.side_ == padding_info::pad_side::left) {
+            pad_it(remaining_pad_);
+            remaining_pad_ = 0;
+        } else if (padinfo_.side_ == padding_info::pad_side::center) {
+            auto half_pad = remaining_pad_ / 2;
+            auto reminder = remaining_pad_ & 1;
+            pad_it(half_pad);
+            remaining_pad_ = half_pad + reminder;  // for the right side
+        }
+    }
+
+    template <typename T>
+    static unsigned int count_digits(T n) {
+        return fmt_helper::count_digits(n);
+    }
+
+    ~scoped_padder() {
+        if (remaining_pad_ >= 0) {
+            pad_it(remaining_pad_);
+        } else if (padinfo_.truncate_) {
+            long new_size = static_cast<long>(dest_.size()) + remaining_pad_;
+            dest_.resize(static_cast<size_t>(new_size));
+        }
+    }
+
+private:
+    void pad_it(long count) {
+        fmt_helper::append_string_view(string_view_t(spaces_.data(), static_cast<size_t>(count)),
+                                       dest_);
+    }
+
+    const padding_info &padinfo_;
+    memory_buf_t &dest_;
+    long remaining_pad_;
+    string_view_t spaces_{"                                                                ", 64};
+};
+
+struct null_scoped_padder {
+    null_scoped_padder(size_t /*wrapped_size*/,
+                       const padding_info & /*padinfo*/,
+                       memory_buf_t & /*dest*/) {}
+
+    template <typename T>
+    static unsigned int count_digits(T /* number */) {
+        return 0;
+    }
+};
+
+template <typename ScopedPadder>
+class name_formatter final : public flag_formatter {
+public:
+    explicit name_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        ScopedPadder p(msg.logger_name.size(), padinfo_, dest);
+        fmt_helper::append_string_view(msg.logger_name, dest);
+    }
+};
+
+// log level appender
+template <typename ScopedPadder>
+class level_formatter final : public flag_formatter {
+public:
+    explicit level_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        const string_view_t &level_name = level::to_string_view(msg.level);
+        ScopedPadder p(level_name.size(), padinfo_, dest);
+        fmt_helper::append_string_view(level_name, dest);
+    }
+};
+
+// short log level appender
+template <typename ScopedPadder>
+class short_level_formatter final : public flag_formatter {
+public:
+    explicit short_level_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        string_view_t level_name{level::to_short_c_str(msg.level)};
+        ScopedPadder p(level_name.size(), padinfo_, dest);
+        fmt_helper::append_string_view(level_name, dest);
+    }
+};
+
+///////////////////////////////////////////////////////////////////////
+// Date time pattern appenders
+///////////////////////////////////////////////////////////////////////
+
+static const char *ampm(const tm &t) { return t.tm_hour >= 12 ? "PM" : "AM"; }
+
+static int to12h(const tm &t) { return t.tm_hour > 12 ? t.tm_hour - 12 : t.tm_hour; }
+
+// Abbreviated weekday name
+static std::array<const char *, 7> days{{"Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"}};
+
+template <typename ScopedPadder>
+class a_formatter final : public flag_formatter {
+public:
+    explicit a_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        string_view_t field_value{days[static_cast<size_t>(tm_time.tm_wday)]};
+        ScopedPadder p(field_value.size(), padinfo_, dest);
+        fmt_helper::append_string_view(field_value, dest);
+    }
+};
+
+// Full weekday name
+static std::array<const char *, 7> full_days{
+    {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"}};
+
+template <typename ScopedPadder>
+class A_formatter : public flag_formatter {
+public:
+    explicit A_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        string_view_t field_value{full_days[static_cast<size_t>(tm_time.tm_wday)]};
+        ScopedPadder p(field_value.size(), padinfo_, dest);
+        fmt_helper::append_string_view(field_value, dest);
+    }
+};
+
+// Abbreviated month
+static const std::array<const char *, 12> months{
+    {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sept", "Oct", "Nov", "Dec"}};
+
+template <typename ScopedPadder>
+class b_formatter final : public flag_formatter {
+public:
+    explicit b_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        string_view_t field_value{months[static_cast<size_t>(tm_time.tm_mon)]};
+        ScopedPadder p(field_value.size(), padinfo_, dest);
+        fmt_helper::append_string_view(field_value, dest);
+    }
+};
+
+// Full month name
+static const std::array<const char *, 12> full_months{{"January", "February", "March", "April",
+                                                       "May", "June", "July", "August", "September",
+                                                       "October", "November", "December"}};
+
+template <typename ScopedPadder>
+class B_formatter final : public flag_formatter {
+public:
+    explicit B_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        string_view_t field_value{full_months[static_cast<size_t>(tm_time.tm_mon)]};
+        ScopedPadder p(field_value.size(), padinfo_, dest);
+        fmt_helper::append_string_view(field_value, dest);
+    }
+};
+
+// Date and time representation (Thu Aug 23 15:35:46 2014)
+template <typename ScopedPadder>
+class c_formatter final : public flag_formatter {
+public:
+    explicit c_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 24;
+        ScopedPadder p(field_size, padinfo_, dest);
+
+        fmt_helper::append_string_view(days[static_cast<size_t>(tm_time.tm_wday)], dest);
+        dest.push_back(' ');
+        fmt_helper::append_string_view(months[static_cast<size_t>(tm_time.tm_mon)], dest);
+        dest.push_back(' ');
+        fmt_helper::append_int(tm_time.tm_mday, dest);
+        dest.push_back(' ');
+        // time
+
+        fmt_helper::pad2(tm_time.tm_hour, dest);
+        dest.push_back(':');
+        fmt_helper::pad2(tm_time.tm_min, dest);
+        dest.push_back(':');
+        fmt_helper::pad2(tm_time.tm_sec, dest);
+        dest.push_back(' ');
+        fmt_helper::append_int(tm_time.tm_year + 1900, dest);
+    }
+};
+
+// year - 2 digit
+template <typename ScopedPadder>
+class C_formatter final : public flag_formatter {
+public:
+    explicit C_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 2;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad2(tm_time.tm_year % 100, dest);
+    }
+};
+
+// Short MM/DD/YY date, equivalent to %m/%d/%y 08/23/01
+template <typename ScopedPadder>
+class D_formatter final : public flag_formatter {
+public:
+    explicit D_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 10;
+        ScopedPadder p(field_size, padinfo_, dest);
+
+        fmt_helper::pad2(tm_time.tm_mon + 1, dest);
+        dest.push_back('/');
+        fmt_helper::pad2(tm_time.tm_mday, dest);
+        dest.push_back('/');
+        fmt_helper::pad2(tm_time.tm_year % 100, dest);
+    }
+};
+
+// year - 4 digit
+template <typename ScopedPadder>
+class Y_formatter final : public flag_formatter {
+public:
+    explicit Y_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 4;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::append_int(tm_time.tm_year + 1900, dest);
+    }
+};
+
+// month 1-12
+template <typename ScopedPadder>
+class m_formatter final : public flag_formatter {
+public:
+    explicit m_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 2;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad2(tm_time.tm_mon + 1, dest);
+    }
+};
+
+// day of month 1-31
+template <typename ScopedPadder>
+class d_formatter final : public flag_formatter {
+public:
+    explicit d_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 2;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad2(tm_time.tm_mday, dest);
+    }
+};
+
+// hours in 24 format 0-23
+template <typename ScopedPadder>
+class H_formatter final : public flag_formatter {
+public:
+    explicit H_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 2;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad2(tm_time.tm_hour, dest);
+    }
+};
+
+// hours in 12 format 1-12
+template <typename ScopedPadder>
+class I_formatter final : public flag_formatter {
+public:
+    explicit I_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 2;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad2(to12h(tm_time), dest);
+    }
+};
+
+// minutes 0-59
+template <typename ScopedPadder>
+class M_formatter final : public flag_formatter {
+public:
+    explicit M_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 2;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad2(tm_time.tm_min, dest);
+    }
+};
+
+// seconds 0-59
+template <typename ScopedPadder>
+class S_formatter final : public flag_formatter {
+public:
+    explicit S_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 2;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad2(tm_time.tm_sec, dest);
+    }
+};
+
+// milliseconds
+template <typename ScopedPadder>
+class e_formatter final : public flag_formatter {
+public:
+    explicit e_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        auto millis = fmt_helper::time_fraction<std::chrono::milliseconds>(msg.time);
+        const size_t field_size = 3;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad3(static_cast<uint32_t>(millis.count()), dest);
+    }
+};
+
+// microseconds
+template <typename ScopedPadder>
+class f_formatter final : public flag_formatter {
+public:
+    explicit f_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        auto micros = fmt_helper::time_fraction<std::chrono::microseconds>(msg.time);
+
+        const size_t field_size = 6;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad6(static_cast<size_t>(micros.count()), dest);
+    }
+};
+
+// nanoseconds
+template <typename ScopedPadder>
+class F_formatter final : public flag_formatter {
+public:
+    explicit F_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        auto ns = fmt_helper::time_fraction<std::chrono::nanoseconds>(msg.time);
+        const size_t field_size = 9;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::pad9(static_cast<size_t>(ns.count()), dest);
+    }
+};
+
+// seconds since epoch
+template <typename ScopedPadder>
+class E_formatter final : public flag_formatter {
+public:
+    explicit E_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        const size_t field_size = 10;
+        ScopedPadder p(field_size, padinfo_, dest);
+        auto duration = msg.time.time_since_epoch();
+        auto seconds = std::chrono::duration_cast<std::chrono::seconds>(duration).count();
+        fmt_helper::append_int(seconds, dest);
+    }
+};
+
+// AM/PM
+template <typename ScopedPadder>
+class p_formatter final : public flag_formatter {
+public:
+    explicit p_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 2;
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::append_string_view(ampm(tm_time), dest);
+    }
+};
+
+// 12 hour clock 02:55:02 pm
+template <typename ScopedPadder>
+class r_formatter final : public flag_formatter {
+public:
+    explicit r_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 11;
+        ScopedPadder p(field_size, padinfo_, dest);
+
+        fmt_helper::pad2(to12h(tm_time), dest);
+        dest.push_back(':');
+        fmt_helper::pad2(tm_time.tm_min, dest);
+        dest.push_back(':');
+        fmt_helper::pad2(tm_time.tm_sec, dest);
+        dest.push_back(' ');
+        fmt_helper::append_string_view(ampm(tm_time), dest);
+    }
+};
+
+// 24-hour HH:MM time, equivalent to %H:%M
+template <typename ScopedPadder>
+class R_formatter final : public flag_formatter {
+public:
+    explicit R_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 5;
+        ScopedPadder p(field_size, padinfo_, dest);
+
+        fmt_helper::pad2(tm_time.tm_hour, dest);
+        dest.push_back(':');
+        fmt_helper::pad2(tm_time.tm_min, dest);
+    }
+};
+
+// ISO 8601 time format (HH:MM:SS), equivalent to %H:%M:%S
+template <typename ScopedPadder>
+class T_formatter final : public flag_formatter {
+public:
+    explicit T_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 8;
+        ScopedPadder p(field_size, padinfo_, dest);
+
+        fmt_helper::pad2(tm_time.tm_hour, dest);
+        dest.push_back(':');
+        fmt_helper::pad2(tm_time.tm_min, dest);
+        dest.push_back(':');
+        fmt_helper::pad2(tm_time.tm_sec, dest);
+    }
+};
+
+// ISO 8601 offset from UTC in timezone (+-HH:MM)
+template <typename ScopedPadder>
+class z_formatter final : public flag_formatter {
+public:
+    explicit z_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    z_formatter() = default;
+    z_formatter(const z_formatter &) = delete;
+    z_formatter &operator=(const z_formatter &) = delete;
+
+    void format(const details::log_msg &msg, const std::tm &tm_time, memory_buf_t &dest) override {
+        const size_t field_size = 6;
+        ScopedPadder p(field_size, padinfo_, dest);
+
+        auto total_minutes = get_cached_offset(msg, tm_time);
+        bool is_negative = total_minutes < 0;
+        if (is_negative) {
+            total_minutes = -total_minutes;
+            dest.push_back('-');
+        } else {
+            dest.push_back('+');
+        }
+
+        fmt_helper::pad2(total_minutes / 60, dest);  // hours
+        dest.push_back(':');
+        fmt_helper::pad2(total_minutes % 60, dest);  // minutes
+    }
+
+private:
+    log_clock::time_point last_update_{std::chrono::seconds(0)};
+    int offset_minutes_{0};
+
+    int get_cached_offset(const log_msg &msg, const std::tm &tm_time) {
+        // refresh every 10 seconds
+        if (msg.time - last_update_ >= std::chrono::seconds(10)) {
+            offset_minutes_ = os::utc_minutes_offset(tm_time);
+            last_update_ = msg.time;
+        }
+        return offset_minutes_;
+    }
+};
+
+// Thread id
+template <typename ScopedPadder>
+class t_formatter final : public flag_formatter {
+public:
+    explicit t_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        const auto field_size = ScopedPadder::count_digits(msg.thread_id);
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::append_int(msg.thread_id, dest);
+    }
+};
+
+// Current pid
+template <typename ScopedPadder>
+class pid_formatter final : public flag_formatter {
+public:
+    explicit pid_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &, const std::tm &, memory_buf_t &dest) override {
+        const auto pid = static_cast<uint32_t>(details::os::pid());
+        auto field_size = ScopedPadder::count_digits(pid);
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::append_int(pid, dest);
+    }
+};
+
+template <typename ScopedPadder>
+class v_formatter final : public flag_formatter {
+public:
+    explicit v_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        ScopedPadder p(msg.payload.size(), padinfo_, dest);
+        fmt_helper::append_string_view(msg.payload, dest);
+    }
+};
+
+class ch_formatter final : public flag_formatter {
+public:
+    explicit ch_formatter(char ch)
+        : ch_(ch) {}
+
+    void format(const details::log_msg &, const std::tm &, memory_buf_t &dest) override {
+        dest.push_back(ch_);
+    }
+
+private:
+    char ch_;
+};
+
+// aggregate user chars to display as is
+class aggregate_formatter final : public flag_formatter {
+public:
+    aggregate_formatter() = default;
+
+    void add_ch(char ch) { str_ += ch; }
+    void format(const details::log_msg &, const std::tm &, memory_buf_t &dest) override {
+        fmt_helper::append_string_view(str_, dest);
+    }
+
+private:
+    std::string str_;
+};
+
+// mark the color range. expect it to be in the form of "%^colored text%$"
+class color_start_formatter final : public flag_formatter {
+public:
+    explicit color_start_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        msg.color_range_start = dest.size();
+    }
+};
+
+class color_stop_formatter final : public flag_formatter {
+public:
+    explicit color_stop_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        msg.color_range_end = dest.size();
+    }
+};
+
+// print source location
+template <typename ScopedPadder>
+class source_location_formatter final : public flag_formatter {
+public:
+    explicit source_location_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        if (msg.source.empty()) {
+            ScopedPadder p(0, padinfo_, dest);
+            return;
+        }
+
+        size_t text_size;
+        if (padinfo_.enabled()) {
+            // calc text size for padding based on "filename:line"
+            text_size = std::char_traits<char>::length(msg.source.filename) +
+                        ScopedPadder::count_digits(msg.source.line) + 1;
+        } else {
+            text_size = 0;
+        }
+
+        ScopedPadder p(text_size, padinfo_, dest);
+        fmt_helper::append_string_view(msg.source.filename, dest);
+        dest.push_back(':');
+        fmt_helper::append_int(msg.source.line, dest);
+    }
+};
+
+// print source filename
+template <typename ScopedPadder>
+class source_filename_formatter final : public flag_formatter {
+public:
+    explicit source_filename_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        if (msg.source.empty()) {
+            ScopedPadder p(0, padinfo_, dest);
+            return;
+        }
+        size_t text_size =
+            padinfo_.enabled() ? std::char_traits<char>::length(msg.source.filename) : 0;
+        ScopedPadder p(text_size, padinfo_, dest);
+        fmt_helper::append_string_view(msg.source.filename, dest);
+    }
+};
+
+template <typename ScopedPadder>
+class short_filename_formatter final : public flag_formatter {
+public:
+    explicit short_filename_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+#ifdef _MSC_VER
+    #pragma warning(push)
+    #pragma warning(disable : 4127)  // consider using 'if constexpr' instead
+#endif                               // _MSC_VER
+    static const char *basename(const char *filename) {
+        // if the size is 2 (1 character + null terminator) we can use the more efficient strrchr
+        // the branch will be elided by optimizations
+        if (sizeof(os::folder_seps) == 2) {
+            const char *rv = std::strrchr(filename, os::folder_seps[0]);
+            return rv != nullptr ? rv + 1 : filename;
+        } else {
+            const std::reverse_iterator<const char *> begin(filename + std::strlen(filename));
+            const std::reverse_iterator<const char *> end(filename);
+
+            const auto it = std::find_first_of(begin, end, std::begin(os::folder_seps),
+                                               std::end(os::folder_seps) - 1);
+            return it != end ? it.base() : filename;
+        }
+    }
+#ifdef _MSC_VER
+    #pragma warning(pop)
+#endif  // _MSC_VER
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        if (msg.source.empty()) {
+            ScopedPadder p(0, padinfo_, dest);
+            return;
+        }
+        auto filename = basename(msg.source.filename);
+        size_t text_size = padinfo_.enabled() ? std::char_traits<char>::length(filename) : 0;
+        ScopedPadder p(text_size, padinfo_, dest);
+        fmt_helper::append_string_view(filename, dest);
+    }
+};
+
+template <typename ScopedPadder>
+class source_linenum_formatter final : public flag_formatter {
+public:
+    explicit source_linenum_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        if (msg.source.empty()) {
+            ScopedPadder p(0, padinfo_, dest);
+            return;
+        }
+
+        auto field_size = ScopedPadder::count_digits(msg.source.line);
+        ScopedPadder p(field_size, padinfo_, dest);
+        fmt_helper::append_int(msg.source.line, dest);
+    }
+};
+
+// print source funcname
+template <typename ScopedPadder>
+class source_funcname_formatter final : public flag_formatter {
+public:
+    explicit source_funcname_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        if (msg.source.empty()) {
+            ScopedPadder p(0, padinfo_, dest);
+            return;
+        }
+        size_t text_size =
+            padinfo_.enabled() ? std::char_traits<char>::length(msg.source.funcname) : 0;
+        ScopedPadder p(text_size, padinfo_, dest);
+        fmt_helper::append_string_view(msg.source.funcname, dest);
+    }
+};
+
+// print elapsed time since last message
+template <typename ScopedPadder, typename Units>
+class elapsed_formatter final : public flag_formatter {
+public:
+    using DurationUnits = Units;
+
+    explicit elapsed_formatter(padding_info padinfo)
+        : flag_formatter(padinfo),
+          last_message_time_(log_clock::now()) {}
+
+    void format(const details::log_msg &msg, const std::tm &, memory_buf_t &dest) override {
+        auto delta = (std::max)(msg.time - last_message_time_, log_clock::duration::zero());
+        auto delta_units = std::chrono::duration_cast<DurationUnits>(delta);
+        last_message_time_ = msg.time;
+        auto delta_count = static_cast<size_t>(delta_units.count());
+        auto n_digits = static_cast<size_t>(ScopedPadder::count_digits(delta_count));
+        ScopedPadder p(n_digits, padinfo_, dest);
+        fmt_helper::append_int(delta_count, dest);
+    }
+
+private:
+    log_clock::time_point last_message_time_;
+};
+
+// Full info formatter
+// pattern: [%Y-%m-%d %H:%M:%S.%e] [%n] [%l] [%s:%#] %v
+class full_formatter final : public flag_formatter {
+public:
+    explicit full_formatter(padding_info padinfo)
+        : flag_formatter(padinfo) {}
+
+    void format(const details::log_msg &msg, const std::tm &tm_time, memory_buf_t &dest) override {
+        using std::chrono::duration_cast;
+        using std::chrono::milliseconds;
+        using std::chrono::seconds;
+
+        // cache the date/time part for the next second.
+        auto duration = msg.time.time_since_epoch();
+        auto secs = duration_cast<seconds>(duration);
+
+        if (cache_timestamp_ != secs || cached_datetime_.size() == 0) {
+            cached_datetime_.clear();
+            cached_datetime_.push_back('[');
+            fmt_helper::append_int(tm_time.tm_year + 1900, cached_datetime_);
+            cached_datetime_.push_back('-');
+
+            fmt_helper::pad2(tm_time.tm_mon + 1, cached_datetime_);
+            cached_datetime_.push_back('-');
+
+            fmt_helper::pad2(tm_time.tm_mday, cached_datetime_);
+            cached_datetime_.push_back(' ');
+
+            fmt_helper::pad2(tm_time.tm_hour, cached_datetime_);
+            cached_datetime_.push_back(':');
+
+            fmt_helper::pad2(tm_time.tm_min, cached_datetime_);
+            cached_datetime_.push_back(':');
+
+            fmt_helper::pad2(tm_time.tm_sec, cached_datetime_);
+            cached_datetime_.push_back('.');
+
+            cache_timestamp_ = secs;
+        }
+        dest.append(cached_datetime_.begin(), cached_datetime_.end());
+
+        auto millis = fmt_helper::time_fraction<milliseconds>(msg.time);
+        fmt_helper::pad3(static_cast<uint32_t>(millis.count()), dest);
+        dest.push_back(']');
+        dest.push_back(' ');
+
+        // append logger name if exists
+        if (msg.logger_name.size() > 0) {
+            dest.push_back('[');
+            fmt_helper::append_string_view(msg.logger_name, dest);
+            dest.push_back(']');
+            dest.push_back(' ');
+        }
+
+        dest.push_back('[');
+        // wrap the level name with color
+        msg.color_range_start = dest.size();
+        // fmt_helper::append_string_view(level::to_c_str(msg.level), dest);
+        fmt_helper::append_string_view(level::to_string_view(msg.level), dest);
+        msg.color_range_end = dest.size();
+        dest.push_back(']');
+        dest.push_back(' ');
+
+        // add source location if present
+        if (!msg.source.empty()) {
+            dest.push_back('[');
+            const char *filename =
+                details::short_filename_formatter<details::null_scoped_padder>::basename(
+                    msg.source.filename);
+            fmt_helper::append_string_view(filename, dest);
+            dest.push_back(':');
+            fmt_helper::append_int(msg.source.line, dest);
+            dest.push_back(']');
+            dest.push_back(' ');
+        }
+        // fmt_helper::append_string_view(msg.msg(), dest);
+        fmt_helper::append_string_view(msg.payload, dest);
+    }
+
+private:
+    std::chrono::seconds cache_timestamp_{0};
+    memory_buf_t cached_datetime_;
+};
+
+}  // namespace details
+
+SPDLOG_INLINE pattern_formatter::pattern_formatter(std::string pattern,
+                                                   pattern_time_type time_type,
+                                                   std::string eol,
+                                                   custom_flags custom_user_flags)
+    : pattern_(std::move(pattern)),
+      eol_(std::move(eol)),
+      pattern_time_type_(time_type),
+      need_localtime_(false),
+      last_log_secs_(0),
+      custom_handlers_(std::move(custom_user_flags)) {
+    std::memset(&cached_tm_, 0, sizeof(cached_tm_));
+    compile_pattern_(pattern_);
+}
+
+// use by default full formatter for if pattern is not given
+SPDLOG_INLINE pattern_formatter::pattern_formatter(pattern_time_type time_type, std::string eol)
+    : pattern_("%+"),
+      eol_(std::move(eol)),
+      pattern_time_type_(time_type),
+      need_localtime_(true),
+      last_log_secs_(0) {
+    std::memset(&cached_tm_, 0, sizeof(cached_tm_));
+    formatters_.push_back(details::make_unique<details::full_formatter>(details::padding_info{}));
+}
+
+SPDLOG_INLINE std::unique_ptr<formatter> pattern_formatter::clone() const {
+    custom_flags cloned_custom_formatters;
+    for (auto &it : custom_handlers_) {
+        cloned_custom_formatters[it.first] = it.second->clone();
+    }
+    auto cloned = details::make_unique<pattern_formatter>(pattern_, pattern_time_type_, eol_,
+                                                          std::move(cloned_custom_formatters));
+    cloned->need_localtime(need_localtime_);
+#if defined(__GNUC__) && __GNUC__ < 5
+    return std::move(cloned);
+#else
+    return cloned;
+#endif
+}
+
+SPDLOG_INLINE void pattern_formatter::format(const details::log_msg &msg, memory_buf_t &dest) {
+    if (need_localtime_) {
+        const auto secs =
+            std::chrono::duration_cast<std::chrono::seconds>(msg.time.time_since_epoch());
+        if (secs != last_log_secs_) {
+            cached_tm_ = get_time_(msg);
+            last_log_secs_ = secs;
+        }
+    }
+
+    for (auto &f : formatters_) {
+        f->format(msg, cached_tm_, dest);
+    }
+    // write eol
+    details::fmt_helper::append_string_view(eol_, dest);
+}
+
+SPDLOG_INLINE void pattern_formatter::set_pattern(std::string pattern) {
+    pattern_ = std::move(pattern);
+    need_localtime_ = false;
+    compile_pattern_(pattern_);
+}
+
+SPDLOG_INLINE void pattern_formatter::need_localtime(bool need) { need_localtime_ = need; }
+
+SPDLOG_INLINE std::tm pattern_formatter::get_time_(const details::log_msg &msg) {
+    if (pattern_time_type_ == pattern_time_type::local) {
+        return details::os::localtime(log_clock::to_time_t(msg.time));
+    }
+    return details::os::gmtime(log_clock::to_time_t(msg.time));
+}
+
+template <typename Padder>
+SPDLOG_INLINE void pattern_formatter::handle_flag_(char flag, details::padding_info padding) {
+    // process custom flags
+    auto it = custom_handlers_.find(flag);
+    if (it != custom_handlers_.end()) {
+        auto custom_handler = it->second->clone();
+        custom_handler->set_padding_info(padding);
+        formatters_.push_back(std::move(custom_handler));
+        return;
+    }
+
+    // process built-in flags
+    switch (flag) {
+        case ('+'):  // default formatter
+            formatters_.push_back(details::make_unique<details::full_formatter>(padding));
+            need_localtime_ = true;
+            break;
+
+        case 'n':  // logger name
+            formatters_.push_back(details::make_unique<details::name_formatter<Padder>>(padding));
+            break;
+
+        case 'l':  // level
+            formatters_.push_back(details::make_unique<details::level_formatter<Padder>>(padding));
+            break;
+
+        case 'L':  // short level
+            formatters_.push_back(
+                details::make_unique<details::short_level_formatter<Padder>>(padding));
+            break;
+
+        case ('t'):  // thread id
+            formatters_.push_back(details::make_unique<details::t_formatter<Padder>>(padding));
+            break;
+
+        case ('v'):  // the message text
+            formatters_.push_back(details::make_unique<details::v_formatter<Padder>>(padding));
+            break;
+
+        case ('a'):  // weekday
+            formatters_.push_back(details::make_unique<details::a_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('A'):  // short weekday
+            formatters_.push_back(details::make_unique<details::A_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('b'):
+        case ('h'):  // month
+            formatters_.push_back(details::make_unique<details::b_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('B'):  // short month
+            formatters_.push_back(details::make_unique<details::B_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('c'):  // datetime
+            formatters_.push_back(details::make_unique<details::c_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('C'):  // year 2 digits
+            formatters_.push_back(details::make_unique<details::C_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('Y'):  // year 4 digits
+            formatters_.push_back(details::make_unique<details::Y_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('D'):
+        case ('x'):  // datetime MM/DD/YY
+            formatters_.push_back(details::make_unique<details::D_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('m'):  // month 1-12
+            formatters_.push_back(details::make_unique<details::m_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('d'):  // day of month 1-31
+            formatters_.push_back(details::make_unique<details::d_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('H'):  // hours 24
+            formatters_.push_back(details::make_unique<details::H_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('I'):  // hours 12
+            formatters_.push_back(details::make_unique<details::I_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('M'):  // minutes
+            formatters_.push_back(details::make_unique<details::M_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('S'):  // seconds
+            formatters_.push_back(details::make_unique<details::S_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('e'):  // milliseconds
+            formatters_.push_back(details::make_unique<details::e_formatter<Padder>>(padding));
+            break;
+
+        case ('f'):  // microseconds
+            formatters_.push_back(details::make_unique<details::f_formatter<Padder>>(padding));
+            break;
+
+        case ('F'):  // nanoseconds
+            formatters_.push_back(details::make_unique<details::F_formatter<Padder>>(padding));
+            break;
+
+        case ('E'):  // seconds since epoch
+            formatters_.push_back(details::make_unique<details::E_formatter<Padder>>(padding));
+            break;
+
+        case ('p'):  // am/pm
+            formatters_.push_back(details::make_unique<details::p_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('r'):  // 12 hour clock 02:55:02 pm
+            formatters_.push_back(details::make_unique<details::r_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('R'):  // 24-hour HH:MM time
+            formatters_.push_back(details::make_unique<details::R_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('T'):
+        case ('X'):  // ISO 8601 time format (HH:MM:SS)
+            formatters_.push_back(details::make_unique<details::T_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('z'):  // timezone
+            formatters_.push_back(details::make_unique<details::z_formatter<Padder>>(padding));
+            need_localtime_ = true;
+            break;
+
+        case ('P'):  // pid
+            formatters_.push_back(details::make_unique<details::pid_formatter<Padder>>(padding));
+            break;
+
+        case ('^'):  // color range start
+            formatters_.push_back(details::make_unique<details::color_start_formatter>(padding));
+            break;
+
+        case ('$'):  // color range end
+            formatters_.push_back(details::make_unique<details::color_stop_formatter>(padding));
+            break;
+
+        case ('@'):  // source location (filename:filenumber)
+            formatters_.push_back(
+                details::make_unique<details::source_location_formatter<Padder>>(padding));
+            break;
+
+        case ('s'):  // short source filename - without directory name
+            formatters_.push_back(
+                details::make_unique<details::short_filename_formatter<Padder>>(padding));
+            break;
+
+        case ('g'):  // full source filename
+            formatters_.push_back(
+                details::make_unique<details::source_filename_formatter<Padder>>(padding));
+            break;
+
+        case ('#'):  // source line number
+            formatters_.push_back(
+                details::make_unique<details::source_linenum_formatter<Padder>>(padding));
+            break;
+
+        case ('!'):  // source funcname
+            formatters_.push_back(
+                details::make_unique<details::source_funcname_formatter<Padder>>(padding));
+            break;
+
+        case ('%'):  // % char
+            formatters_.push_back(details::make_unique<details::ch_formatter>('%'));
+            break;
+
+        case ('u'):  // elapsed time since last log message in nanos
+            formatters_.push_back(
+                details::make_unique<details::elapsed_formatter<Padder, std::chrono::nanoseconds>>(
+                    padding));
+            break;
+
+        case ('i'):  // elapsed time since last log message in micros
+            formatters_.push_back(
+                details::make_unique<details::elapsed_formatter<Padder, std::chrono::microseconds>>(
+                    padding));
+            break;
+
+        case ('o'):  // elapsed time since last log message in millis
+            formatters_.push_back(
+                details::make_unique<details::elapsed_formatter<Padder, std::chrono::milliseconds>>(
+                    padding));
+            break;
+
+        case ('O'):  // elapsed time since last log message in seconds
+            formatters_.push_back(
+                details::make_unique<details::elapsed_formatter<Padder, std::chrono::seconds>>(
+                    padding));
+            break;
+
+        default:  // Unknown flag appears as is
+            auto unknown_flag = details::make_unique<details::aggregate_formatter>();
+
+            if (!padding.truncate_) {
+                unknown_flag->add_ch('%');
+                unknown_flag->add_ch(flag);
+                formatters_.push_back((std::move(unknown_flag)));
+            }
+            // fix issue #1617 (prev char was '!' and should have been treated as funcname flag
+            // instead of truncating flag) spdlog::set_pattern("[%10!] %v") => "[      main] some
+            // message" spdlog::set_pattern("[%3!!] %v") => "[mai] some message"
+            else {
+                padding.truncate_ = false;
+                formatters_.push_back(
+                    details::make_unique<details::source_funcname_formatter<Padder>>(padding));
+                unknown_flag->add_ch(flag);
+                formatters_.push_back((std::move(unknown_flag)));
+            }
+
+            break;
+    }
+}
+
+// Extract given pad spec (e.g. %8X, %=8X, %-8!X, %8!X, %=8!X, %-8!X, %+8!X)
+// Advance the given it pass the end of the padding spec found (if any)
+// Return padding.
+SPDLOG_INLINE details::padding_info pattern_formatter::handle_padspec_(
+    std::string::const_iterator &it, std::string::const_iterator end) {
+    using details::padding_info;
+    using details::scoped_padder;
+    const size_t max_width = 64;
+    if (it == end) {
+        return padding_info{};
+    }
+
+    padding_info::pad_side side;
+    switch (*it) {
+        case '-':
+            side = padding_info::pad_side::right;
+            ++it;
+            break;
+        case '=':
+            side = padding_info::pad_side::center;
+            ++it;
+            break;
+        default:
+            side = details::padding_info::pad_side::left;
+            break;
+    }
+
+    if (it == end || !std::isdigit(static_cast<unsigned char>(*it))) {
+        return padding_info{};  // no padding if no digit found here
+    }
+
+    auto width = static_cast<size_t>(*it) - '0';
+    for (++it; it != end && std::isdigit(static_cast<unsigned char>(*it)); ++it) {
+        auto digit = static_cast<size_t>(*it) - '0';
+        width = width * 10 + digit;
+    }
+
+    // search for the optional truncate marker '!'
+    bool truncate;
+    if (it != end && *it == '!') {
+        truncate = true;
+        ++it;
+    } else {
+        truncate = false;
+    }
+    return details::padding_info{std::min<size_t>(width, max_width), side, truncate};
+}
+
+SPDLOG_INLINE void pattern_formatter::compile_pattern_(const std::string &pattern) {
+    auto end = pattern.end();
+    std::unique_ptr<details::aggregate_formatter> user_chars;
+    formatters_.clear();
+    for (auto it = pattern.begin(); it != end; ++it) {
+        if (*it == '%') {
+            if (user_chars)  // append user chars found so far
+            {
+                formatters_.push_back(std::move(user_chars));
+            }
+
+            auto padding = handle_padspec_(++it, end);
+
+            if (it != end) {
+                if (padding.enabled()) {
+                    handle_flag_<details::scoped_padder>(*it, padding);
+                } else {
+                    handle_flag_<details::null_scoped_padder>(*it, padding);
+                }
+            } else {
+                break;
+            }
+        } else  // chars not following the % sign should be displayed as is
+        {
+            if (!user_chars) {
+                user_chars = details::make_unique<details::aggregate_formatter>();
+            }
+            user_chars->add_ch(*it);
+        }
+    }
+    if (user_chars)  // append raw chars found so far
+    {
+        formatters_.push_back(std::move(user_chars));
+    }
+}
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/pattern_formatter.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/pattern_formatter.h
new file mode 100644
index 0000000000..ececd67322
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/pattern_formatter.h
@@ -0,0 +1,118 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <spdlog/details/log_msg.h>
+#include <spdlog/details/os.h>
+#include <spdlog/formatter.h>
+
+#include <chrono>
+#include <ctime>
+#include <memory>
+
+#include <string>
+#include <unordered_map>
+#include <vector>
+
+namespace spdlog {
+namespace details {
+
+// padding information.
+struct padding_info {
+    enum class pad_side { left, right, center };
+
+    padding_info() = default;
+    padding_info(size_t width, padding_info::pad_side side, bool truncate)
+        : width_(width),
+          side_(side),
+          truncate_(truncate),
+          enabled_(true) {}
+
+    bool enabled() const { return enabled_; }
+    size_t width_ = 0;
+    pad_side side_ = pad_side::left;
+    bool truncate_ = false;
+    bool enabled_ = false;
+};
+
+class SPDLOG_API flag_formatter {
+public:
+    explicit flag_formatter(padding_info padinfo)
+        : padinfo_(padinfo) {}
+    flag_formatter() = default;
+    virtual ~flag_formatter() = default;
+    virtual void format(const details::log_msg &msg,
+                        const std::tm &tm_time,
+                        memory_buf_t &dest) = 0;
+
+protected:
+    padding_info padinfo_;
+};
+
+}  // namespace details
+
+class SPDLOG_API custom_flag_formatter : public details::flag_formatter {
+public:
+    virtual std::unique_ptr<custom_flag_formatter> clone() const = 0;
+
+    void set_padding_info(const details::padding_info &padding) {
+        flag_formatter::padinfo_ = padding;
+    }
+};
+
+class SPDLOG_API pattern_formatter final : public formatter {
+public:
+    using custom_flags = std::unordered_map<char, std::unique_ptr<custom_flag_formatter>>;
+
+    explicit pattern_formatter(std::string pattern,
+                               pattern_time_type time_type = pattern_time_type::local,
+                               std::string eol = spdlog::details::os::default_eol,
+                               custom_flags custom_user_flags = custom_flags());
+
+    // use default pattern is not given
+    explicit pattern_formatter(pattern_time_type time_type = pattern_time_type::local,
+                               std::string eol = spdlog::details::os::default_eol);
+
+    pattern_formatter(const pattern_formatter &other) = delete;
+    pattern_formatter &operator=(const pattern_formatter &other) = delete;
+
+    std::unique_ptr<formatter> clone() const override;
+    void format(const details::log_msg &msg, memory_buf_t &dest) override;
+
+    template <typename T, typename... Args>
+    pattern_formatter &add_flag(char flag, Args &&...args) {
+        custom_handlers_[flag] = details::make_unique<T>(std::forward<Args>(args)...);
+        return *this;
+    }
+    void set_pattern(std::string pattern);
+    void need_localtime(bool need = true);
+
+private:
+    std::string pattern_;
+    std::string eol_;
+    pattern_time_type pattern_time_type_;
+    bool need_localtime_;
+    std::tm cached_tm_;
+    std::chrono::seconds last_log_secs_;
+    std::vector<std::unique_ptr<details::flag_formatter>> formatters_;
+    custom_flags custom_handlers_;
+
+    std::tm get_time_(const details::log_msg &msg);
+    template <typename Padder>
+    void handle_flag_(char flag, details::padding_info padding);
+
+    // Extract given pad spec (e.g. %8X)
+    // Advance the given it pass the end of the padding spec found (if any)
+    // Return padding.
+    static details::padding_info handle_padspec_(std::string::const_iterator &it,
+                                                 std::string::const_iterator end);
+
+    void compile_pattern_(const std::string &pattern);
+};
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "pattern_formatter-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/android_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/android_sink.h
new file mode 100644
index 0000000000..4435a560a0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/android_sink.h
@@ -0,0 +1,137 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifdef __ANDROID__
+
+    #include <spdlog/details/fmt_helper.h>
+    #include <spdlog/details/null_mutex.h>
+    #include <spdlog/details/os.h>
+    #include <spdlog/details/synchronous_factory.h>
+    #include <spdlog/sinks/base_sink.h>
+
+    #include <android/log.h>
+    #include <chrono>
+    #include <mutex>
+    #include <string>
+    #include <thread>
+    #include <type_traits>
+
+    #if !defined(SPDLOG_ANDROID_RETRIES)
+        #define SPDLOG_ANDROID_RETRIES 2
+    #endif
+
+namespace spdlog {
+namespace sinks {
+
+/*
+ * Android sink
+ * (logging using __android_log_write or __android_log_buf_write depending on the specified
+ * BufferID)
+ */
+template <typename Mutex, int BufferID = log_id::LOG_ID_MAIN>
+class android_sink final : public base_sink<Mutex> {
+public:
+    explicit android_sink(std::string tag = "spdlog", bool use_raw_msg = false)
+        : tag_(std::move(tag)),
+          use_raw_msg_(use_raw_msg) {}
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        const android_LogPriority priority = convert_to_android_(msg.level);
+        memory_buf_t formatted;
+        if (use_raw_msg_) {
+            details::fmt_helper::append_string_view(msg.payload, formatted);
+        } else {
+            base_sink<Mutex>::formatter_->format(msg, formatted);
+        }
+        formatted.push_back('\0');
+        const char *msg_output = formatted.data();
+
+        // See system/core/liblog/logger_write.c for explanation of return value
+        int ret = android_log(priority, tag_.c_str(), msg_output);
+        if (ret == -EPERM) {
+            return;  // !__android_log_is_loggable
+        }
+        int retry_count = 0;
+        while ((ret == -11 /*EAGAIN*/) && (retry_count < SPDLOG_ANDROID_RETRIES)) {
+            details::os::sleep_for_millis(5);
+            ret = android_log(priority, tag_.c_str(), msg_output);
+            retry_count++;
+        }
+
+        if (ret < 0) {
+            throw_spdlog_ex("logging to Android failed", ret);
+        }
+    }
+
+    void flush_() override {}
+
+private:
+    // There might be liblog versions used, that do not support __android_log_buf_write. So we only
+    // compile and link against
+    // __android_log_buf_write, if user explicitly provides a non-default log buffer. Otherwise,
+    // when using the default log buffer, always log via __android_log_write.
+    template <int ID = BufferID>
+    typename std::enable_if<ID == static_cast<int>(log_id::LOG_ID_MAIN), int>::type android_log(
+        int prio, const char *tag, const char *text) {
+        return __android_log_write(prio, tag, text);
+    }
+
+    template <int ID = BufferID>
+    typename std::enable_if<ID != static_cast<int>(log_id::LOG_ID_MAIN), int>::type android_log(
+        int prio, const char *tag, const char *text) {
+        return __android_log_buf_write(ID, prio, tag, text);
+    }
+
+    static android_LogPriority convert_to_android_(spdlog::level::level_enum level) {
+        switch (level) {
+            case spdlog::level::trace:
+                return ANDROID_LOG_VERBOSE;
+            case spdlog::level::debug:
+                return ANDROID_LOG_DEBUG;
+            case spdlog::level::info:
+                return ANDROID_LOG_INFO;
+            case spdlog::level::warn:
+                return ANDROID_LOG_WARN;
+            case spdlog::level::err:
+                return ANDROID_LOG_ERROR;
+            case spdlog::level::critical:
+                return ANDROID_LOG_FATAL;
+            default:
+                return ANDROID_LOG_DEFAULT;
+        }
+    }
+
+    std::string tag_;
+    bool use_raw_msg_;
+};
+
+using android_sink_mt = android_sink<std::mutex>;
+using android_sink_st = android_sink<details::null_mutex>;
+
+template <int BufferId = log_id::LOG_ID_MAIN>
+using android_sink_buf_mt = android_sink<std::mutex, BufferId>;
+template <int BufferId = log_id::LOG_ID_MAIN>
+using android_sink_buf_st = android_sink<details::null_mutex, BufferId>;
+
+}  // namespace sinks
+
+// Create and register android syslog logger
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> android_logger_mt(const std::string &logger_name,
+                                                 const std::string &tag = "spdlog") {
+    return Factory::template create<sinks::android_sink_mt>(logger_name, tag);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> android_logger_st(const std::string &logger_name,
+                                                 const std::string &tag = "spdlog") {
+    return Factory::template create<sinks::android_sink_st>(logger_name, tag);
+}
+
+}  // namespace spdlog
+
+#endif  // __ANDROID__
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ansicolor_sink-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ansicolor_sink-inl.h
new file mode 100644
index 0000000000..2194f67b94
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ansicolor_sink-inl.h
@@ -0,0 +1,135 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/sinks/ansicolor_sink.h>
+#endif
+
+#include <spdlog/details/os.h>
+#include <spdlog/pattern_formatter.h>
+
+namespace spdlog {
+namespace sinks {
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE ansicolor_sink<ConsoleMutex>::ansicolor_sink(FILE *target_file, color_mode mode)
+    : target_file_(target_file),
+      mutex_(ConsoleMutex::mutex()),
+      formatter_(details::make_unique<spdlog::pattern_formatter>())
+
+{
+    set_color_mode(mode);
+    colors_.at(level::trace) = to_string_(white);
+    colors_.at(level::debug) = to_string_(cyan);
+    colors_.at(level::info) = to_string_(green);
+    colors_.at(level::warn) = to_string_(yellow_bold);
+    colors_.at(level::err) = to_string_(red_bold);
+    colors_.at(level::critical) = to_string_(bold_on_red);
+    colors_.at(level::off) = to_string_(reset);
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void ansicolor_sink<ConsoleMutex>::set_color(level::level_enum color_level,
+                                                           string_view_t color) {
+    std::lock_guard<mutex_t> lock(mutex_);
+    colors_.at(static_cast<size_t>(color_level)) = to_string_(color);
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void ansicolor_sink<ConsoleMutex>::log(const details::log_msg &msg) {
+    // Wrap the originally formatted message in color codes.
+    // If color is not supported in the terminal, log as is instead.
+    std::lock_guard<mutex_t> lock(mutex_);
+    msg.color_range_start = 0;
+    msg.color_range_end = 0;
+    memory_buf_t formatted;
+    formatter_->format(msg, formatted);
+    if (should_do_colors_ && msg.color_range_end > msg.color_range_start) {
+        // before color range
+        print_range_(formatted, 0, msg.color_range_start);
+        // in color range
+        print_ccode_(colors_.at(static_cast<size_t>(msg.level)));
+        print_range_(formatted, msg.color_range_start, msg.color_range_end);
+        print_ccode_(reset);
+        // after color range
+        print_range_(formatted, msg.color_range_end, formatted.size());
+    } else  // no color
+    {
+        print_range_(formatted, 0, formatted.size());
+    }
+    fflush(target_file_);
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void ansicolor_sink<ConsoleMutex>::flush() {
+    std::lock_guard<mutex_t> lock(mutex_);
+    fflush(target_file_);
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void ansicolor_sink<ConsoleMutex>::set_pattern(const std::string &pattern) {
+    std::lock_guard<mutex_t> lock(mutex_);
+    formatter_ = std::unique_ptr<spdlog::formatter>(new pattern_formatter(pattern));
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void ansicolor_sink<ConsoleMutex>::set_formatter(
+    std::unique_ptr<spdlog::formatter> sink_formatter) {
+    std::lock_guard<mutex_t> lock(mutex_);
+    formatter_ = std::move(sink_formatter);
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE bool ansicolor_sink<ConsoleMutex>::should_color() {
+    return should_do_colors_;
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void ansicolor_sink<ConsoleMutex>::set_color_mode(color_mode mode) {
+    switch (mode) {
+        case color_mode::always:
+            should_do_colors_ = true;
+            return;
+        case color_mode::automatic:
+            should_do_colors_ =
+                details::os::in_terminal(target_file_) && details::os::is_color_terminal();
+            return;
+        case color_mode::never:
+            should_do_colors_ = false;
+            return;
+        default:
+            should_do_colors_ = false;
+    }
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void ansicolor_sink<ConsoleMutex>::print_ccode_(const string_view_t &color_code) {
+    fwrite(color_code.data(), sizeof(char), color_code.size(), target_file_);
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void ansicolor_sink<ConsoleMutex>::print_range_(const memory_buf_t &formatted,
+                                                              size_t start,
+                                                              size_t end) {
+    fwrite(formatted.data() + start, sizeof(char), end - start, target_file_);
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE std::string ansicolor_sink<ConsoleMutex>::to_string_(const string_view_t &sv) {
+    return std::string(sv.data(), sv.size());
+}
+
+// ansicolor_stdout_sink
+template <typename ConsoleMutex>
+SPDLOG_INLINE ansicolor_stdout_sink<ConsoleMutex>::ansicolor_stdout_sink(color_mode mode)
+    : ansicolor_sink<ConsoleMutex>(stdout, mode) {}
+
+// ansicolor_stderr_sink
+template <typename ConsoleMutex>
+SPDLOG_INLINE ansicolor_stderr_sink<ConsoleMutex>::ansicolor_stderr_sink(color_mode mode)
+    : ansicolor_sink<ConsoleMutex>(stderr, mode) {}
+
+}  // namespace sinks
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ansicolor_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ansicolor_sink.h
new file mode 100644
index 0000000000..ff53730c0d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ansicolor_sink.h
@@ -0,0 +1,115 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <array>
+#include <memory>
+#include <mutex>
+#include <spdlog/details/console_globals.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/sinks/sink.h>
+#include <string>
+
+namespace spdlog {
+namespace sinks {
+
+/**
+ * This sink prefixes the output with an ANSI escape sequence color code
+ * depending on the severity
+ * of the message.
+ * If no color terminal detected, omit the escape codes.
+ */
+
+template <typename ConsoleMutex>
+class ansicolor_sink : public sink {
+public:
+    using mutex_t = typename ConsoleMutex::mutex_t;
+    ansicolor_sink(FILE *target_file, color_mode mode);
+    ~ansicolor_sink() override = default;
+
+    ansicolor_sink(const ansicolor_sink &other) = delete;
+    ansicolor_sink(ansicolor_sink &&other) = delete;
+
+    ansicolor_sink &operator=(const ansicolor_sink &other) = delete;
+    ansicolor_sink &operator=(ansicolor_sink &&other) = delete;
+
+    void set_color(level::level_enum color_level, string_view_t color);
+    void set_color_mode(color_mode mode);
+    bool should_color();
+
+    void log(const details::log_msg &msg) override;
+    void flush() override;
+    void set_pattern(const std::string &pattern) final;
+    void set_formatter(std::unique_ptr<spdlog::formatter> sink_formatter) override;
+
+    // Formatting codes
+    const string_view_t reset = "\033[m";
+    const string_view_t bold = "\033[1m";
+    const string_view_t dark = "\033[2m";
+    const string_view_t underline = "\033[4m";
+    const string_view_t blink = "\033[5m";
+    const string_view_t reverse = "\033[7m";
+    const string_view_t concealed = "\033[8m";
+    const string_view_t clear_line = "\033[K";
+
+    // Foreground colors
+    const string_view_t black = "\033[30m";
+    const string_view_t red = "\033[31m";
+    const string_view_t green = "\033[32m";
+    const string_view_t yellow = "\033[33m";
+    const string_view_t blue = "\033[34m";
+    const string_view_t magenta = "\033[35m";
+    const string_view_t cyan = "\033[36m";
+    const string_view_t white = "\033[37m";
+
+    /// Background colors
+    const string_view_t on_black = "\033[40m";
+    const string_view_t on_red = "\033[41m";
+    const string_view_t on_green = "\033[42m";
+    const string_view_t on_yellow = "\033[43m";
+    const string_view_t on_blue = "\033[44m";
+    const string_view_t on_magenta = "\033[45m";
+    const string_view_t on_cyan = "\033[46m";
+    const string_view_t on_white = "\033[47m";
+
+    /// Bold colors
+    const string_view_t yellow_bold = "\033[33m\033[1m";
+    const string_view_t red_bold = "\033[31m\033[1m";
+    const string_view_t bold_on_red = "\033[1m\033[41m";
+
+private:
+    FILE *target_file_;
+    mutex_t &mutex_;
+    bool should_do_colors_;
+    std::unique_ptr<spdlog::formatter> formatter_;
+    std::array<std::string, level::n_levels> colors_;
+    void print_ccode_(const string_view_t &color_code);
+    void print_range_(const memory_buf_t &formatted, size_t start, size_t end);
+    static std::string to_string_(const string_view_t &sv);
+};
+
+template <typename ConsoleMutex>
+class ansicolor_stdout_sink : public ansicolor_sink<ConsoleMutex> {
+public:
+    explicit ansicolor_stdout_sink(color_mode mode = color_mode::automatic);
+};
+
+template <typename ConsoleMutex>
+class ansicolor_stderr_sink : public ansicolor_sink<ConsoleMutex> {
+public:
+    explicit ansicolor_stderr_sink(color_mode mode = color_mode::automatic);
+};
+
+using ansicolor_stdout_sink_mt = ansicolor_stdout_sink<details::console_mutex>;
+using ansicolor_stdout_sink_st = ansicolor_stdout_sink<details::console_nullmutex>;
+
+using ansicolor_stderr_sink_mt = ansicolor_stderr_sink<details::console_mutex>;
+using ansicolor_stderr_sink_st = ansicolor_stderr_sink<details::console_nullmutex>;
+
+}  // namespace sinks
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "ansicolor_sink-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/base_sink-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/base_sink-inl.h
new file mode 100644
index 0000000000..ada161bcc1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/base_sink-inl.h
@@ -0,0 +1,59 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/sinks/base_sink.h>
+#endif
+
+#include <spdlog/common.h>
+#include <spdlog/pattern_formatter.h>
+
+#include <memory>
+#include <mutex>
+
+template <typename Mutex>
+SPDLOG_INLINE spdlog::sinks::base_sink<Mutex>::base_sink()
+    : formatter_{details::make_unique<spdlog::pattern_formatter>()} {}
+
+template <typename Mutex>
+SPDLOG_INLINE spdlog::sinks::base_sink<Mutex>::base_sink(
+    std::unique_ptr<spdlog::formatter> formatter)
+    : formatter_{std::move(formatter)} {}
+
+template <typename Mutex>
+void SPDLOG_INLINE spdlog::sinks::base_sink<Mutex>::log(const details::log_msg &msg) {
+    std::lock_guard<Mutex> lock(mutex_);
+    sink_it_(msg);
+}
+
+template <typename Mutex>
+void SPDLOG_INLINE spdlog::sinks::base_sink<Mutex>::flush() {
+    std::lock_guard<Mutex> lock(mutex_);
+    flush_();
+}
+
+template <typename Mutex>
+void SPDLOG_INLINE spdlog::sinks::base_sink<Mutex>::set_pattern(const std::string &pattern) {
+    std::lock_guard<Mutex> lock(mutex_);
+    set_pattern_(pattern);
+}
+
+template <typename Mutex>
+void SPDLOG_INLINE
+spdlog::sinks::base_sink<Mutex>::set_formatter(std::unique_ptr<spdlog::formatter> sink_formatter) {
+    std::lock_guard<Mutex> lock(mutex_);
+    set_formatter_(std::move(sink_formatter));
+}
+
+template <typename Mutex>
+void SPDLOG_INLINE spdlog::sinks::base_sink<Mutex>::set_pattern_(const std::string &pattern) {
+    set_formatter_(details::make_unique<spdlog::pattern_formatter>(pattern));
+}
+
+template <typename Mutex>
+void SPDLOG_INLINE
+spdlog::sinks::base_sink<Mutex>::set_formatter_(std::unique_ptr<spdlog::formatter> sink_formatter) {
+    formatter_ = std::move(sink_formatter);
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/base_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/base_sink.h
new file mode 100644
index 0000000000..1ca772a652
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/base_sink.h
@@ -0,0 +1,51 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+//
+// base sink templated over a mutex (either dummy or real)
+// concrete implementation should override the sink_it_() and flush_()  methods.
+// locking is taken care of in this class - no locking needed by the
+// implementers..
+//
+
+#include <spdlog/common.h>
+#include <spdlog/details/log_msg.h>
+#include <spdlog/sinks/sink.h>
+
+namespace spdlog {
+namespace sinks {
+template <typename Mutex>
+class SPDLOG_API base_sink : public sink {
+public:
+    base_sink();
+    explicit base_sink(std::unique_ptr<spdlog::formatter> formatter);
+    ~base_sink() override = default;
+
+    base_sink(const base_sink &) = delete;
+    base_sink(base_sink &&) = delete;
+
+    base_sink &operator=(const base_sink &) = delete;
+    base_sink &operator=(base_sink &&) = delete;
+
+    void log(const details::log_msg &msg) final;
+    void flush() final;
+    void set_pattern(const std::string &pattern) final;
+    void set_formatter(std::unique_ptr<spdlog::formatter> sink_formatter) final;
+
+protected:
+    // sink formatter
+    std::unique_ptr<spdlog::formatter> formatter_;
+    Mutex mutex_;
+
+    virtual void sink_it_(const details::log_msg &msg) = 0;
+    virtual void flush_() = 0;
+    virtual void set_pattern_(const std::string &pattern);
+    virtual void set_formatter_(std::unique_ptr<spdlog::formatter> sink_formatter);
+};
+}  // namespace sinks
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "base_sink-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/basic_file_sink-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/basic_file_sink-inl.h
new file mode 100644
index 0000000000..f7c1abf7c9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/basic_file_sink-inl.h
@@ -0,0 +1,42 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/sinks/basic_file_sink.h>
+#endif
+
+#include <spdlog/common.h>
+#include <spdlog/details/os.h>
+
+namespace spdlog {
+namespace sinks {
+
+template <typename Mutex>
+SPDLOG_INLINE basic_file_sink<Mutex>::basic_file_sink(const filename_t &filename,
+                                                      bool truncate,
+                                                      const file_event_handlers &event_handlers)
+    : file_helper_{event_handlers} {
+    file_helper_.open(filename, truncate);
+}
+
+template <typename Mutex>
+SPDLOG_INLINE const filename_t &basic_file_sink<Mutex>::filename() const {
+    return file_helper_.filename();
+}
+
+template <typename Mutex>
+SPDLOG_INLINE void basic_file_sink<Mutex>::sink_it_(const details::log_msg &msg) {
+    memory_buf_t formatted;
+    base_sink<Mutex>::formatter_->format(msg, formatted);
+    file_helper_.write(formatted);
+}
+
+template <typename Mutex>
+SPDLOG_INLINE void basic_file_sink<Mutex>::flush_() {
+    file_helper_.flush();
+}
+
+}  // namespace sinks
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/basic_file_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/basic_file_sink.h
new file mode 100644
index 0000000000..699caa147d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/basic_file_sink.h
@@ -0,0 +1,65 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/file_helper.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <mutex>
+#include <string>
+
+namespace spdlog {
+namespace sinks {
+/*
+ * Trivial file sink with single file as target
+ */
+template <typename Mutex>
+class basic_file_sink final : public base_sink<Mutex> {
+public:
+    explicit basic_file_sink(const filename_t &filename,
+                             bool truncate = false,
+                             const file_event_handlers &event_handlers = {});
+    const filename_t &filename() const;
+
+protected:
+    void sink_it_(const details::log_msg &msg) override;
+    void flush_() override;
+
+private:
+    details::file_helper file_helper_;
+};
+
+using basic_file_sink_mt = basic_file_sink<std::mutex>;
+using basic_file_sink_st = basic_file_sink<details::null_mutex>;
+
+}  // namespace sinks
+
+//
+// factory functions
+//
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> basic_logger_mt(const std::string &logger_name,
+                                               const filename_t &filename,
+                                               bool truncate = false,
+                                               const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::basic_file_sink_mt>(logger_name, filename, truncate,
+                                                               event_handlers);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> basic_logger_st(const std::string &logger_name,
+                                               const filename_t &filename,
+                                               bool truncate = false,
+                                               const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::basic_file_sink_st>(logger_name, filename, truncate,
+                                                               event_handlers);
+}
+
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "basic_file_sink-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/callback_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/callback_sink.h
new file mode 100644
index 0000000000..71668ef28e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/callback_sink.h
@@ -0,0 +1,56 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <mutex>
+#include <string>
+
+namespace spdlog {
+
+// callbacks type
+typedef std::function<void(const details::log_msg &msg)> custom_log_callback;
+
+namespace sinks {
+/*
+ * Trivial callback sink, gets a callback function and calls it on each log
+ */
+template <typename Mutex>
+class callback_sink final : public base_sink<Mutex> {
+public:
+    explicit callback_sink(const custom_log_callback &callback)
+        : callback_{callback} {}
+
+protected:
+    void sink_it_(const details::log_msg &msg) override { callback_(msg); }
+    void flush_() override{};
+
+private:
+    custom_log_callback callback_;
+};
+
+using callback_sink_mt = callback_sink<std::mutex>;
+using callback_sink_st = callback_sink<details::null_mutex>;
+
+}  // namespace sinks
+
+//
+// factory functions
+//
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> callback_logger_mt(const std::string &logger_name,
+                                                  const custom_log_callback &callback) {
+    return Factory::template create<sinks::callback_sink_mt>(logger_name, callback);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> callback_logger_st(const std::string &logger_name,
+                                                  const custom_log_callback &callback) {
+    return Factory::template create<sinks::callback_sink_st>(logger_name, callback);
+}
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/daily_file_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/daily_file_sink.h
new file mode 100644
index 0000000000..1b1dc44a87
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/daily_file_sink.h
@@ -0,0 +1,252 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <spdlog/details/circular_q.h>
+#include <spdlog/details/file_helper.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/details/os.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/fmt/chrono.h>
+#include <spdlog/fmt/fmt.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <chrono>
+#include <cstdio>
+#include <iomanip>
+#include <mutex>
+#include <sstream>
+#include <string>
+
+namespace spdlog {
+namespace sinks {
+
+/*
+ * Generator of daily log file names in format basename.YYYY-MM-DD.ext
+ */
+struct daily_filename_calculator {
+    // Create filename for the form basename.YYYY-MM-DD
+    static filename_t calc_filename(const filename_t &filename, const tm &now_tm) {
+        filename_t basename, ext;
+        std::tie(basename, ext) = details::file_helper::split_by_extension(filename);
+        return fmt_lib::format(SPDLOG_FMT_STRING(SPDLOG_FILENAME_T("{}_{:04d}-{:02d}-{:02d}{}")),
+                               basename, now_tm.tm_year + 1900, now_tm.tm_mon + 1, now_tm.tm_mday,
+                               ext);
+    }
+};
+
+/*
+ * Generator of daily log file names with strftime format.
+ * Usages:
+ *    auto sink =
+ * std::make_shared<spdlog::sinks::daily_file_format_sink_mt>("myapp-%Y-%m-%d:%H:%M:%S.log", hour,
+ * minute);" auto logger = spdlog::daily_logger_format_mt("loggername, "myapp-%Y-%m-%d:%X.log",
+ * hour,  minute)"
+ *
+ */
+struct daily_filename_format_calculator {
+    static filename_t calc_filename(const filename_t &file_path, const tm &now_tm) {
+#if defined(_WIN32) && defined(SPDLOG_WCHAR_FILENAMES)
+        std::wstringstream stream;
+#else
+        std::stringstream stream;
+#endif
+        stream << std::put_time(&now_tm, file_path.c_str());
+        return stream.str();
+    }
+};
+
+/*
+ * Rotating file sink based on date.
+ * If truncate != false , the created file will be truncated.
+ * If max_files > 0, retain only the last max_files and delete previous.
+ */
+template <typename Mutex, typename FileNameCalc = daily_filename_calculator>
+class daily_file_sink final : public base_sink<Mutex> {
+public:
+    // create daily file sink which rotates on given time
+    daily_file_sink(filename_t base_filename,
+                    int rotation_hour,
+                    int rotation_minute,
+                    bool truncate = false,
+                    uint16_t max_files = 0,
+                    const file_event_handlers &event_handlers = {})
+        : base_filename_(std::move(base_filename)),
+          rotation_h_(rotation_hour),
+          rotation_m_(rotation_minute),
+          file_helper_{event_handlers},
+          truncate_(truncate),
+          max_files_(max_files),
+          filenames_q_() {
+        if (rotation_hour < 0 || rotation_hour > 23 || rotation_minute < 0 ||
+            rotation_minute > 59) {
+            throw_spdlog_ex("daily_file_sink: Invalid rotation time in ctor");
+        }
+
+        auto now = log_clock::now();
+        auto filename = FileNameCalc::calc_filename(base_filename_, now_tm(now));
+        file_helper_.open(filename, truncate_);
+        rotation_tp_ = next_rotation_tp_();
+
+        if (max_files_ > 0) {
+            init_filenames_q_();
+        }
+    }
+
+    filename_t filename() {
+        std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        return file_helper_.filename();
+    }
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        auto time = msg.time;
+        bool should_rotate = time >= rotation_tp_;
+        if (should_rotate) {
+            auto filename = FileNameCalc::calc_filename(base_filename_, now_tm(time));
+            file_helper_.open(filename, truncate_);
+            rotation_tp_ = next_rotation_tp_();
+        }
+        memory_buf_t formatted;
+        base_sink<Mutex>::formatter_->format(msg, formatted);
+        file_helper_.write(formatted);
+
+        // Do the cleaning only at the end because it might throw on failure.
+        if (should_rotate && max_files_ > 0) {
+            delete_old_();
+        }
+    }
+
+    void flush_() override { file_helper_.flush(); }
+
+private:
+    void init_filenames_q_() {
+        using details::os::path_exists;
+
+        filenames_q_ = details::circular_q<filename_t>(static_cast<size_t>(max_files_));
+        std::vector<filename_t> filenames;
+        auto now = log_clock::now();
+        while (filenames.size() < max_files_) {
+            auto filename = FileNameCalc::calc_filename(base_filename_, now_tm(now));
+            if (!path_exists(filename)) {
+                break;
+            }
+            filenames.emplace_back(filename);
+            now -= std::chrono::hours(24);
+        }
+        for (auto iter = filenames.rbegin(); iter != filenames.rend(); ++iter) {
+            filenames_q_.push_back(std::move(*iter));
+        }
+    }
+
+    tm now_tm(log_clock::time_point tp) {
+        time_t tnow = log_clock::to_time_t(tp);
+        return spdlog::details::os::localtime(tnow);
+    }
+
+    log_clock::time_point next_rotation_tp_() {
+        auto now = log_clock::now();
+        tm date = now_tm(now);
+        date.tm_hour = rotation_h_;
+        date.tm_min = rotation_m_;
+        date.tm_sec = 0;
+        auto rotation_time = log_clock::from_time_t(std::mktime(&date));
+        if (rotation_time > now) {
+            return rotation_time;
+        }
+        return {rotation_time + std::chrono::hours(24)};
+    }
+
+    // Delete the file N rotations ago.
+    // Throw spdlog_ex on failure to delete the old file.
+    void delete_old_() {
+        using details::os::filename_to_str;
+        using details::os::remove_if_exists;
+
+        filename_t current_file = file_helper_.filename();
+        if (filenames_q_.full()) {
+            auto old_filename = std::move(filenames_q_.front());
+            filenames_q_.pop_front();
+            bool ok = remove_if_exists(old_filename) == 0;
+            if (!ok) {
+                filenames_q_.push_back(std::move(current_file));
+                throw_spdlog_ex("Failed removing daily file " + filename_to_str(old_filename),
+                                errno);
+            }
+        }
+        filenames_q_.push_back(std::move(current_file));
+    }
+
+    filename_t base_filename_;
+    int rotation_h_;
+    int rotation_m_;
+    log_clock::time_point rotation_tp_;
+    details::file_helper file_helper_;
+    bool truncate_;
+    uint16_t max_files_;
+    details::circular_q<filename_t> filenames_q_;
+};
+
+using daily_file_sink_mt = daily_file_sink<std::mutex>;
+using daily_file_sink_st = daily_file_sink<details::null_mutex>;
+using daily_file_format_sink_mt = daily_file_sink<std::mutex, daily_filename_format_calculator>;
+using daily_file_format_sink_st =
+    daily_file_sink<details::null_mutex, daily_filename_format_calculator>;
+
+}  // namespace sinks
+
+//
+// factory functions
+//
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> daily_logger_mt(const std::string &logger_name,
+                                               const filename_t &filename,
+                                               int hour = 0,
+                                               int minute = 0,
+                                               bool truncate = false,
+                                               uint16_t max_files = 0,
+                                               const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::daily_file_sink_mt>(logger_name, filename, hour, minute,
+                                                               truncate, max_files, event_handlers);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> daily_logger_format_mt(
+    const std::string &logger_name,
+    const filename_t &filename,
+    int hour = 0,
+    int minute = 0,
+    bool truncate = false,
+    uint16_t max_files = 0,
+    const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::daily_file_format_sink_mt>(
+        logger_name, filename, hour, minute, truncate, max_files, event_handlers);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> daily_logger_st(const std::string &logger_name,
+                                               const filename_t &filename,
+                                               int hour = 0,
+                                               int minute = 0,
+                                               bool truncate = false,
+                                               uint16_t max_files = 0,
+                                               const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::daily_file_sink_st>(logger_name, filename, hour, minute,
+                                                               truncate, max_files, event_handlers);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> daily_logger_format_st(
+    const std::string &logger_name,
+    const filename_t &filename,
+    int hour = 0,
+    int minute = 0,
+    bool truncate = false,
+    uint16_t max_files = 0,
+    const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::daily_file_format_sink_st>(
+        logger_name, filename, hour, minute, truncate, max_files, event_handlers);
+}
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/dist_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/dist_sink.h
new file mode 100644
index 0000000000..69c4971c95
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/dist_sink.h
@@ -0,0 +1,81 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include "base_sink.h"
+#include <spdlog/details/log_msg.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/pattern_formatter.h>
+
+#include <algorithm>
+#include <memory>
+#include <mutex>
+#include <vector>
+
+// Distribution sink (mux). Stores a vector of sinks which get called when log
+// is called
+
+namespace spdlog {
+namespace sinks {
+
+template <typename Mutex>
+class dist_sink : public base_sink<Mutex> {
+public:
+    dist_sink() = default;
+    explicit dist_sink(std::vector<std::shared_ptr<sink>> sinks)
+        : sinks_(sinks) {}
+
+    dist_sink(const dist_sink &) = delete;
+    dist_sink &operator=(const dist_sink &) = delete;
+
+    void add_sink(std::shared_ptr<sink> sub_sink) {
+        std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        sinks_.push_back(sub_sink);
+    }
+
+    void remove_sink(std::shared_ptr<sink> sub_sink) {
+        std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        sinks_.erase(std::remove(sinks_.begin(), sinks_.end(), sub_sink), sinks_.end());
+    }
+
+    void set_sinks(std::vector<std::shared_ptr<sink>> sinks) {
+        std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        sinks_ = std::move(sinks);
+    }
+
+    std::vector<std::shared_ptr<sink>> &sinks() { return sinks_; }
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        for (auto &sub_sink : sinks_) {
+            if (sub_sink->should_log(msg.level)) {
+                sub_sink->log(msg);
+            }
+        }
+    }
+
+    void flush_() override {
+        for (auto &sub_sink : sinks_) {
+            sub_sink->flush();
+        }
+    }
+
+    void set_pattern_(const std::string &pattern) override {
+        set_formatter_(details::make_unique<spdlog::pattern_formatter>(pattern));
+    }
+
+    void set_formatter_(std::unique_ptr<spdlog::formatter> sink_formatter) override {
+        base_sink<Mutex>::formatter_ = std::move(sink_formatter);
+        for (auto &sub_sink : sinks_) {
+            sub_sink->set_formatter(base_sink<Mutex>::formatter_->clone());
+        }
+    }
+    std::vector<std::shared_ptr<sink>> sinks_;
+};
+
+using dist_sink_mt = dist_sink<std::mutex>;
+using dist_sink_st = dist_sink<details::null_mutex>;
+
+}  // namespace sinks
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/dup_filter_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/dup_filter_sink.h
new file mode 100644
index 0000000000..1498142c47
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/dup_filter_sink.h
@@ -0,0 +1,92 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include "dist_sink.h"
+#include <spdlog/details/log_msg.h>
+#include <spdlog/details/null_mutex.h>
+
+#include <chrono>
+#include <cstdio>
+#include <mutex>
+#include <string>
+
+// Duplicate message removal sink.
+// Skip the message if previous one is identical and less than "max_skip_duration" have passed
+//
+// Example:
+//
+//     #include <spdlog/sinks/dup_filter_sink.h>
+//
+//     int main() {
+//         auto dup_filter = std::make_shared<dup_filter_sink_st>(std::chrono::seconds(5),
+//         level::info); dup_filter->add_sink(std::make_shared<stdout_color_sink_mt>());
+//         spdlog::logger l("logger", dup_filter);
+//         l.info("Hello");
+//         l.info("Hello");
+//         l.info("Hello");
+//         l.info("Different Hello");
+//     }
+//
+// Will produce:
+//       [2019-06-25 17:50:56.511] [logger] [info] Hello
+//       [2019-06-25 17:50:56.512] [logger] [info] Skipped 3 duplicate messages..
+//       [2019-06-25 17:50:56.512] [logger] [info] Different Hello
+
+namespace spdlog {
+namespace sinks {
+template <typename Mutex>
+class dup_filter_sink : public dist_sink<Mutex> {
+public:
+    template <class Rep, class Period>
+    explicit dup_filter_sink(std::chrono::duration<Rep, Period> max_skip_duration,
+                             level::level_enum notification_level = level::info)
+        : max_skip_duration_{max_skip_duration},
+          log_level_{notification_level} {}
+
+protected:
+    std::chrono::microseconds max_skip_duration_;
+    log_clock::time_point last_msg_time_;
+    std::string last_msg_payload_;
+    size_t skip_counter_ = 0;
+    level::level_enum log_level_;
+
+    void sink_it_(const details::log_msg &msg) override {
+        bool filtered = filter_(msg);
+        if (!filtered) {
+            skip_counter_ += 1;
+            return;
+        }
+
+        // log the "skipped.." message
+        if (skip_counter_ > 0) {
+            char buf[64];
+            auto msg_size = ::snprintf(buf, sizeof(buf), "Skipped %u duplicate messages..",
+                                       static_cast<unsigned>(skip_counter_));
+            if (msg_size > 0 && static_cast<size_t>(msg_size) < sizeof(buf)) {
+                details::log_msg skipped_msg{msg.source, msg.logger_name, log_level_,
+                                             string_view_t{buf, static_cast<size_t>(msg_size)}};
+                dist_sink<Mutex>::sink_it_(skipped_msg);
+            }
+        }
+
+        // log current message
+        dist_sink<Mutex>::sink_it_(msg);
+        last_msg_time_ = msg.time;
+        skip_counter_ = 0;
+        last_msg_payload_.assign(msg.payload.data(), msg.payload.data() + msg.payload.size());
+    }
+
+    // return whether the log msg should be displayed (true) or skipped (false)
+    bool filter_(const details::log_msg &msg) {
+        auto filter_duration = msg.time - last_msg_time_;
+        return (filter_duration > max_skip_duration_) || (msg.payload != last_msg_payload_);
+    }
+};
+
+using dup_filter_sink_mt = dup_filter_sink<std::mutex>;
+using dup_filter_sink_st = dup_filter_sink<details::null_mutex>;
+
+}  // namespace sinks
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/hourly_file_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/hourly_file_sink.h
new file mode 100644
index 0000000000..1f138925fc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/hourly_file_sink.h
@@ -0,0 +1,191 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <spdlog/details/circular_q.h>
+#include <spdlog/details/file_helper.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/details/os.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/fmt/fmt.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <chrono>
+#include <cstdio>
+#include <ctime>
+#include <mutex>
+#include <string>
+
+namespace spdlog {
+namespace sinks {
+
+/*
+ * Generator of Hourly log file names in format basename.YYYY-MM-DD-HH.ext
+ */
+struct hourly_filename_calculator {
+    // Create filename for the form basename.YYYY-MM-DD-H
+    static filename_t calc_filename(const filename_t &filename, const tm &now_tm) {
+        filename_t basename, ext;
+        std::tie(basename, ext) = details::file_helper::split_by_extension(filename);
+        return fmt_lib::format(SPDLOG_FILENAME_T("{}_{:04d}-{:02d}-{:02d}_{:02d}{}"), basename,
+                               now_tm.tm_year + 1900, now_tm.tm_mon + 1, now_tm.tm_mday,
+                               now_tm.tm_hour, ext);
+    }
+};
+
+/*
+ * Rotating file sink based on time.
+ * If truncate != false , the created file will be truncated.
+ * If max_files > 0, retain only the last max_files and delete previous.
+ */
+template <typename Mutex, typename FileNameCalc = hourly_filename_calculator>
+class hourly_file_sink final : public base_sink<Mutex> {
+public:
+    // create hourly file sink which rotates on given time
+    hourly_file_sink(filename_t base_filename,
+                     bool truncate = false,
+                     uint16_t max_files = 0,
+                     const file_event_handlers &event_handlers = {})
+        : base_filename_(std::move(base_filename)),
+          file_helper_{event_handlers},
+          truncate_(truncate),
+          max_files_(max_files),
+          filenames_q_() {
+        auto now = log_clock::now();
+        auto filename = FileNameCalc::calc_filename(base_filename_, now_tm(now));
+        file_helper_.open(filename, truncate_);
+        remove_init_file_ = file_helper_.size() == 0;
+        rotation_tp_ = next_rotation_tp_();
+
+        if (max_files_ > 0) {
+            init_filenames_q_();
+        }
+    }
+
+    filename_t filename() {
+        std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        return file_helper_.filename();
+    }
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        auto time = msg.time;
+        bool should_rotate = time >= rotation_tp_;
+        if (should_rotate) {
+            if (remove_init_file_) {
+                file_helper_.close();
+                details::os::remove(file_helper_.filename());
+            }
+            auto filename = FileNameCalc::calc_filename(base_filename_, now_tm(time));
+            file_helper_.open(filename, truncate_);
+            rotation_tp_ = next_rotation_tp_();
+        }
+        remove_init_file_ = false;
+        memory_buf_t formatted;
+        base_sink<Mutex>::formatter_->format(msg, formatted);
+        file_helper_.write(formatted);
+
+        // Do the cleaning only at the end because it might throw on failure.
+        if (should_rotate && max_files_ > 0) {
+            delete_old_();
+        }
+    }
+
+    void flush_() override { file_helper_.flush(); }
+
+private:
+    void init_filenames_q_() {
+        using details::os::path_exists;
+
+        filenames_q_ = details::circular_q<filename_t>(static_cast<size_t>(max_files_));
+        std::vector<filename_t> filenames;
+        auto now = log_clock::now();
+        while (filenames.size() < max_files_) {
+            auto filename = FileNameCalc::calc_filename(base_filename_, now_tm(now));
+            if (!path_exists(filename)) {
+                break;
+            }
+            filenames.emplace_back(filename);
+            now -= std::chrono::hours(1);
+        }
+        for (auto iter = filenames.rbegin(); iter != filenames.rend(); ++iter) {
+            filenames_q_.push_back(std::move(*iter));
+        }
+    }
+
+    tm now_tm(log_clock::time_point tp) {
+        time_t tnow = log_clock::to_time_t(tp);
+        return spdlog::details::os::localtime(tnow);
+    }
+
+    log_clock::time_point next_rotation_tp_() {
+        auto now = log_clock::now();
+        tm date = now_tm(now);
+        date.tm_min = 0;
+        date.tm_sec = 0;
+        auto rotation_time = log_clock::from_time_t(std::mktime(&date));
+        if (rotation_time > now) {
+            return rotation_time;
+        }
+        return {rotation_time + std::chrono::hours(1)};
+    }
+
+    // Delete the file N rotations ago.
+    // Throw spdlog_ex on failure to delete the old file.
+    void delete_old_() {
+        using details::os::filename_to_str;
+        using details::os::remove_if_exists;
+
+        filename_t current_file = file_helper_.filename();
+        if (filenames_q_.full()) {
+            auto old_filename = std::move(filenames_q_.front());
+            filenames_q_.pop_front();
+            bool ok = remove_if_exists(old_filename) == 0;
+            if (!ok) {
+                filenames_q_.push_back(std::move(current_file));
+                SPDLOG_THROW(spdlog_ex(
+                    "Failed removing hourly file " + filename_to_str(old_filename), errno));
+            }
+        }
+        filenames_q_.push_back(std::move(current_file));
+    }
+
+    filename_t base_filename_;
+    log_clock::time_point rotation_tp_;
+    details::file_helper file_helper_;
+    bool truncate_;
+    uint16_t max_files_;
+    details::circular_q<filename_t> filenames_q_;
+    bool remove_init_file_;
+};
+
+using hourly_file_sink_mt = hourly_file_sink<std::mutex>;
+using hourly_file_sink_st = hourly_file_sink<details::null_mutex>;
+
+}  // namespace sinks
+
+//
+// factory functions
+//
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> hourly_logger_mt(const std::string &logger_name,
+                                                const filename_t &filename,
+                                                bool truncate = false,
+                                                uint16_t max_files = 0,
+                                                const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::hourly_file_sink_mt>(logger_name, filename, truncate,
+                                                                max_files, event_handlers);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> hourly_logger_st(const std::string &logger_name,
+                                                const filename_t &filename,
+                                                bool truncate = false,
+                                                uint16_t max_files = 0,
+                                                const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::hourly_file_sink_st>(logger_name, filename, truncate,
+                                                                max_files, event_handlers);
+}
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/kafka_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/kafka_sink.h
new file mode 100644
index 0000000000..91e987865a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/kafka_sink.h
@@ -0,0 +1,119 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+//
+// Custom sink for kafka
+// Building and using requires librdkafka library.
+// For building librdkafka library check the url below
+// https://github.com/confluentinc/librdkafka
+//
+
+#include "spdlog/async.h"
+#include "spdlog/details/log_msg.h"
+#include "spdlog/details/null_mutex.h"
+#include "spdlog/details/synchronous_factory.h"
+#include "spdlog/sinks/base_sink.h"
+#include <mutex>
+#include <spdlog/common.h>
+
+// kafka header
+#include <librdkafka/rdkafkacpp.h>
+
+namespace spdlog {
+namespace sinks {
+
+struct kafka_sink_config {
+    std::string server_addr;
+    std::string produce_topic;
+    int32_t flush_timeout_ms = 1000;
+
+    kafka_sink_config(std::string addr, std::string topic, int flush_timeout_ms = 1000)
+        : server_addr{std::move(addr)},
+          produce_topic{std::move(topic)},
+          flush_timeout_ms(flush_timeout_ms) {}
+};
+
+template <typename Mutex>
+class kafka_sink : public base_sink<Mutex> {
+public:
+    kafka_sink(kafka_sink_config config)
+        : config_{std::move(config)} {
+        try {
+            std::string errstr;
+            conf_.reset(RdKafka::Conf::create(RdKafka::Conf::CONF_GLOBAL));
+            RdKafka::Conf::ConfResult confRes =
+                conf_->set("bootstrap.servers", config_.server_addr, errstr);
+            if (confRes != RdKafka::Conf::CONF_OK) {
+                throw_spdlog_ex(
+                    fmt_lib::format("conf set bootstrap.servers failed err:{}", errstr));
+            }
+
+            tconf_.reset(RdKafka::Conf::create(RdKafka::Conf::CONF_TOPIC));
+            if (tconf_ == nullptr) {
+                throw_spdlog_ex(fmt_lib::format("create topic config failed"));
+            }
+
+            producer_.reset(RdKafka::Producer::create(conf_.get(), errstr));
+            if (producer_ == nullptr) {
+                throw_spdlog_ex(fmt_lib::format("create producer failed err:{}", errstr));
+            }
+            topic_.reset(RdKafka::Topic::create(producer_.get(), config_.produce_topic,
+                                                tconf_.get(), errstr));
+            if (topic_ == nullptr) {
+                throw_spdlog_ex(fmt_lib::format("create topic failed err:{}", errstr));
+            }
+        } catch (const std::exception &e) {
+            throw_spdlog_ex(fmt_lib::format("error create kafka instance: {}", e.what()));
+        }
+    }
+
+    ~kafka_sink() { producer_->flush(config_.flush_timeout_ms); }
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        producer_->produce(topic_.get(), 0, RdKafka::Producer::RK_MSG_COPY,
+                           (void *)msg.payload.data(), msg.payload.size(), NULL, NULL);
+    }
+
+    void flush_() override { producer_->flush(config_.flush_timeout_ms); }
+
+private:
+    kafka_sink_config config_;
+    std::unique_ptr<RdKafka::Producer> producer_ = nullptr;
+    std::unique_ptr<RdKafka::Conf> conf_ = nullptr;
+    std::unique_ptr<RdKafka::Conf> tconf_ = nullptr;
+    std::unique_ptr<RdKafka::Topic> topic_ = nullptr;
+};
+
+using kafka_sink_mt = kafka_sink<std::mutex>;
+using kafka_sink_st = kafka_sink<spdlog::details::null_mutex>;
+
+}  // namespace sinks
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> kafka_logger_mt(const std::string &logger_name,
+                                               spdlog::sinks::kafka_sink_config config) {
+    return Factory::template create<sinks::kafka_sink_mt>(logger_name, config);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> kafka_logger_st(const std::string &logger_name,
+                                               spdlog::sinks::kafka_sink_config config) {
+    return Factory::template create<sinks::kafka_sink_st>(logger_name, config);
+}
+
+template <typename Factory = spdlog::async_factory>
+inline std::shared_ptr<spdlog::logger> kafka_logger_async_mt(
+    std::string logger_name, spdlog::sinks::kafka_sink_config config) {
+    return Factory::template create<sinks::kafka_sink_mt>(logger_name, config);
+}
+
+template <typename Factory = spdlog::async_factory>
+inline std::shared_ptr<spdlog::logger> kafka_logger_async_st(
+    std::string logger_name, spdlog::sinks::kafka_sink_config config) {
+    return Factory::template create<sinks::kafka_sink_st>(logger_name, config);
+}
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/mongo_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/mongo_sink.h
new file mode 100644
index 0000000000..c5b38ab958
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/mongo_sink.h
@@ -0,0 +1,108 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+//
+// Custom sink for mongodb
+// Building and using requires mongocxx library.
+// For building mongocxx library check the url below
+// http://mongocxx.org/mongocxx-v3/installation/
+//
+
+#include "spdlog/common.h"
+#include "spdlog/details/log_msg.h"
+#include "spdlog/sinks/base_sink.h"
+#include <spdlog/details/synchronous_factory.h>
+
+#include <bsoncxx/builder/stream/document.hpp>
+#include <bsoncxx/types.hpp>
+#include <bsoncxx/view_or_value.hpp>
+
+#include <mongocxx/client.hpp>
+#include <mongocxx/instance.hpp>
+#include <mongocxx/uri.hpp>
+
+namespace spdlog {
+namespace sinks {
+template <typename Mutex>
+class mongo_sink : public base_sink<Mutex> {
+public:
+    mongo_sink(const std::string &db_name,
+               const std::string &collection_name,
+               const std::string &uri = "mongodb://localhost:27017") try
+        : mongo_sink(std::make_shared<mongocxx::instance>(), db_name, collection_name, uri) {
+    } catch (const std::exception &e) {
+        throw_spdlog_ex(fmt_lib::format("Error opening database: {}", e.what()));
+    }
+
+    mongo_sink(std::shared_ptr<mongocxx::instance> instance,
+               const std::string &db_name,
+               const std::string &collection_name,
+               const std::string &uri = "mongodb://localhost:27017")
+        : instance_(std::move(instance)),
+          db_name_(db_name),
+          coll_name_(collection_name) {
+        try {
+            client_ = spdlog::details::make_unique<mongocxx::client>(mongocxx::uri{uri});
+        } catch (const std::exception &e) {
+            throw_spdlog_ex(fmt_lib::format("Error opening database: {}", e.what()));
+        }
+    }
+
+    ~mongo_sink() { flush_(); }
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        using bsoncxx::builder::stream::document;
+        using bsoncxx::builder::stream::finalize;
+
+        if (client_ != nullptr) {
+            auto doc = document{} << "timestamp" << bsoncxx::types::b_date(msg.time) << "level"
+                                  << level::to_string_view(msg.level).data() << "level_num"
+                                  << msg.level << "message"
+                                  << std::string(msg.payload.begin(), msg.payload.end())
+                                  << "logger_name"
+                                  << std::string(msg.logger_name.begin(), msg.logger_name.end())
+                                  << "thread_id" << static_cast<int>(msg.thread_id) << finalize;
+            client_->database(db_name_).collection(coll_name_).insert_one(doc.view());
+        }
+    }
+
+    void flush_() override {}
+
+private:
+    std::shared_ptr<mongocxx::instance> instance_;
+    std::string db_name_;
+    std::string coll_name_;
+    std::unique_ptr<mongocxx::client> client_ = nullptr;
+};
+
+#include "spdlog/details/null_mutex.h"
+#include <mutex>
+using mongo_sink_mt = mongo_sink<std::mutex>;
+using mongo_sink_st = mongo_sink<spdlog::details::null_mutex>;
+
+}  // namespace sinks
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> mongo_logger_mt(
+    const std::string &logger_name,
+    const std::string &db_name,
+    const std::string &collection_name,
+    const std::string &uri = "mongodb://localhost:27017") {
+    return Factory::template create<sinks::mongo_sink_mt>(logger_name, db_name, collection_name,
+                                                          uri);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> mongo_logger_st(
+    const std::string &logger_name,
+    const std::string &db_name,
+    const std::string &collection_name,
+    const std::string &uri = "mongodb://localhost:27017") {
+    return Factory::template create<sinks::mongo_sink_st>(logger_name, db_name, collection_name,
+                                                          uri);
+}
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/msvc_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/msvc_sink.h
new file mode 100644
index 0000000000..2e5f6875ea
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/msvc_sink.h
@@ -0,0 +1,68 @@
+// Copyright(c) 2016 Alexander Dalshov & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#if defined(_WIN32)
+
+    #include <spdlog/details/null_mutex.h>
+    #if defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT)
+        #include <spdlog/details/os.h>
+    #endif
+    #include <spdlog/sinks/base_sink.h>
+
+    #include <mutex>
+    #include <string>
+
+    // Avoid including windows.h (https://stackoverflow.com/a/30741042)
+    #if defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT)
+extern "C" __declspec(dllimport) void __stdcall OutputDebugStringW(const wchar_t *lpOutputString);
+    #else
+extern "C" __declspec(dllimport) void __stdcall OutputDebugStringA(const char *lpOutputString);
+    #endif
+extern "C" __declspec(dllimport) int __stdcall IsDebuggerPresent();
+
+namespace spdlog {
+namespace sinks {
+/*
+ * MSVC sink (logging using OutputDebugStringA)
+ */
+template <typename Mutex>
+class msvc_sink : public base_sink<Mutex> {
+public:
+    msvc_sink() = default;
+    msvc_sink(bool check_debugger_present)
+        : check_debugger_present_{check_debugger_present} {};
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        if (check_debugger_present_ && !IsDebuggerPresent()) {
+            return;
+        }
+        memory_buf_t formatted;
+        base_sink<Mutex>::formatter_->format(msg, formatted);
+        formatted.push_back('\0');  // add a null terminator for OutputDebugString
+    #if defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT)
+        wmemory_buf_t wformatted;
+        details::os::utf8_to_wstrbuf(string_view_t(formatted.data(), formatted.size()), wformatted);
+        OutputDebugStringW(wformatted.data());
+    #else
+        OutputDebugStringA(formatted.data());
+    #endif
+    }
+
+    void flush_() override {}
+
+    bool check_debugger_present_ = true;
+};
+
+using msvc_sink_mt = msvc_sink<std::mutex>;
+using msvc_sink_st = msvc_sink<details::null_mutex>;
+
+using windebug_sink_mt = msvc_sink_mt;
+using windebug_sink_st = msvc_sink_st;
+
+}  // namespace sinks
+}  // namespace spdlog
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/null_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/null_sink.h
new file mode 100644
index 0000000000..c51247fe66
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/null_sink.h
@@ -0,0 +1,41 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <mutex>
+
+namespace spdlog {
+namespace sinks {
+
+template <typename Mutex>
+class null_sink : public base_sink<Mutex> {
+protected:
+    void sink_it_(const details::log_msg &) override {}
+    void flush_() override {}
+};
+
+using null_sink_mt = null_sink<details::null_mutex>;
+using null_sink_st = null_sink<details::null_mutex>;
+
+}  // namespace sinks
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> null_logger_mt(const std::string &logger_name) {
+    auto null_logger = Factory::template create<sinks::null_sink_mt>(logger_name);
+    null_logger->set_level(level::off);
+    return null_logger;
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> null_logger_st(const std::string &logger_name) {
+    auto null_logger = Factory::template create<sinks::null_sink_st>(logger_name);
+    null_logger->set_level(level::off);
+    return null_logger;
+}
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ostream_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ostream_sink.h
new file mode 100644
index 0000000000..6af9dd091e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ostream_sink.h
@@ -0,0 +1,43 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <mutex>
+#include <ostream>
+
+namespace spdlog {
+namespace sinks {
+template <typename Mutex>
+class ostream_sink final : public base_sink<Mutex> {
+public:
+    explicit ostream_sink(std::ostream &os, bool force_flush = false)
+        : ostream_(os),
+          force_flush_(force_flush) {}
+    ostream_sink(const ostream_sink &) = delete;
+    ostream_sink &operator=(const ostream_sink &) = delete;
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        memory_buf_t formatted;
+        base_sink<Mutex>::formatter_->format(msg, formatted);
+        ostream_.write(formatted.data(), static_cast<std::streamsize>(formatted.size()));
+        if (force_flush_) {
+            ostream_.flush();
+        }
+    }
+
+    void flush_() override { ostream_.flush(); }
+
+    std::ostream &ostream_;
+    bool force_flush_;
+};
+
+using ostream_sink_mt = ostream_sink<std::mutex>;
+using ostream_sink_st = ostream_sink<details::null_mutex>;
+
+}  // namespace sinks
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/qt_sinks.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/qt_sinks.h
new file mode 100644
index 0000000000..87a962d3e4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/qt_sinks.h
@@ -0,0 +1,304 @@
+// Copyright(c) 2015-present, Gabi Melman, mguludag and spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+//
+// Custom sink for QPlainTextEdit or QTextEdit and its childs(QTextBrowser...
+// etc) Building and using requires Qt library.
+//
+// Warning: the qt_sink won't be notified if the target widget is destroyed.
+// If the widget's lifetime can be shorter than the logger's one, you should provide some permanent
+// QObject, and then use a standard signal/slot.
+//
+
+#include "spdlog/common.h"
+#include "spdlog/details/log_msg.h"
+#include "spdlog/details/synchronous_factory.h"
+#include "spdlog/sinks/base_sink.h"
+#include <array>
+
+#include <QPlainTextEdit>
+#include <QTextEdit>
+
+//
+// qt_sink class
+//
+namespace spdlog {
+namespace sinks {
+template <typename Mutex>
+class qt_sink : public base_sink<Mutex> {
+public:
+    qt_sink(QObject *qt_object, std::string meta_method)
+        : qt_object_(qt_object),
+          meta_method_(std::move(meta_method)) {
+        if (!qt_object_) {
+            throw_spdlog_ex("qt_sink: qt_object is null");
+        }
+    }
+
+    ~qt_sink() { flush_(); }
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        memory_buf_t formatted;
+        base_sink<Mutex>::formatter_->format(msg, formatted);
+        const string_view_t str = string_view_t(formatted.data(), formatted.size());
+        QMetaObject::invokeMethod(
+            qt_object_, meta_method_.c_str(), Qt::AutoConnection,
+            Q_ARG(QString, QString::fromUtf8(str.data(), static_cast<int>(str.size())).trimmed()));
+    }
+
+    void flush_() override {}
+
+private:
+    QObject *qt_object_ = nullptr;
+    std::string meta_method_;
+};
+
+// QT color sink to QTextEdit.
+// Color location is determined by the sink log pattern like in the rest of spdlog sinks.
+// Colors can be modified if needed using sink->set_color(level, qtTextCharFormat).
+// max_lines is the maximum number of lines that the sink will hold before removing the oldest
+// lines. By default, only ascii (latin1) is supported by this sink. Set is_utf8 to true if utf8
+// support is needed.
+template <typename Mutex>
+class qt_color_sink : public base_sink<Mutex> {
+public:
+    qt_color_sink(QTextEdit *qt_text_edit,
+                  int max_lines,
+                  bool dark_colors = false,
+                  bool is_utf8 = false)
+        : qt_text_edit_(qt_text_edit),
+          max_lines_(max_lines),
+          is_utf8_(is_utf8) {
+        if (!qt_text_edit_) {
+            throw_spdlog_ex("qt_color_text_sink: text_edit is null");
+        }
+
+        default_color_ = qt_text_edit_->currentCharFormat();
+        // set colors
+        QTextCharFormat format;
+        // trace
+        format.setForeground(dark_colors ? Qt::darkGray : Qt::gray);
+        colors_.at(level::trace) = format;
+        // debug
+        format.setForeground(dark_colors ? Qt::darkCyan : Qt::cyan);
+        colors_.at(level::debug) = format;
+        // info
+        format.setForeground(dark_colors ? Qt::darkGreen : Qt::green);
+        colors_.at(level::info) = format;
+        // warn
+        format.setForeground(dark_colors ? Qt::darkYellow : Qt::yellow);
+        colors_.at(level::warn) = format;
+        // err
+        format.setForeground(Qt::red);
+        colors_.at(level::err) = format;
+        // critical
+        format.setForeground(Qt::white);
+        format.setBackground(Qt::red);
+        colors_.at(level::critical) = format;
+    }
+
+    ~qt_color_sink() { flush_(); }
+
+    void set_default_color(QTextCharFormat format) {
+        // std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        default_color_ = format;
+    }
+
+    void set_level_color(level::level_enum color_level, QTextCharFormat format) {
+        // std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        colors_.at(static_cast<size_t>(color_level)) = format;
+    }
+
+    QTextCharFormat &get_level_color(level::level_enum color_level) {
+        std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        return colors_.at(static_cast<size_t>(color_level));
+    }
+
+    QTextCharFormat &get_default_color() {
+        std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        return default_color_;
+    }
+
+protected:
+    struct invoke_params {
+        invoke_params(int max_lines,
+                      QTextEdit *q_text_edit,
+                      QString payload,
+                      QTextCharFormat default_color,
+                      QTextCharFormat level_color,
+                      int color_range_start,
+                      int color_range_end)
+            : max_lines(max_lines),
+              q_text_edit(q_text_edit),
+              payload(std::move(payload)),
+              default_color(default_color),
+              level_color(level_color),
+              color_range_start(color_range_start),
+              color_range_end(color_range_end) {}
+        int max_lines;
+        QTextEdit *q_text_edit;
+        QString payload;
+        QTextCharFormat default_color;
+        QTextCharFormat level_color;
+        int color_range_start;
+        int color_range_end;
+    };
+
+    void sink_it_(const details::log_msg &msg) override {
+        memory_buf_t formatted;
+        base_sink<Mutex>::formatter_->format(msg, formatted);
+
+        const string_view_t str = string_view_t(formatted.data(), formatted.size());
+        // apply the color to the color range in the formatted message.
+        QString payload;
+        int color_range_start = static_cast<int>(msg.color_range_start);
+        int color_range_end = static_cast<int>(msg.color_range_end);
+        if (is_utf8_) {
+            payload = QString::fromUtf8(str.data(), static_cast<int>(str.size()));
+            // convert color ranges from byte index to character index.
+            if (msg.color_range_start < msg.color_range_end) {
+                color_range_start = QString::fromUtf8(str.data(), msg.color_range_start).size();
+                color_range_end = QString::fromUtf8(str.data(), msg.color_range_end).size();
+            }
+        } else {
+            payload = QString::fromLatin1(str.data(), static_cast<int>(str.size()));
+        }
+
+        invoke_params params{max_lines_,             // max lines
+                             qt_text_edit_,          // text edit to append to
+                             std::move(payload),     // text to append
+                             default_color_,         // default color
+                             colors_.at(msg.level),  // color to apply
+                             color_range_start,      // color range start
+                             color_range_end};       // color range end
+
+        QMetaObject::invokeMethod(
+            qt_text_edit_, [params]() { invoke_method_(params); }, Qt::AutoConnection);
+    }
+
+    void flush_() override {}
+
+    // Add colored text to the text edit widget. This method is invoked in the GUI thread.
+    // It is a static method to ensure that it is handled correctly even if the sink is destroyed
+    // prematurely before it is invoked.
+
+    static void invoke_method_(invoke_params params) {
+        auto *document = params.q_text_edit->document();
+        QTextCursor cursor(document);
+
+        // remove first blocks if number of blocks exceeds max_lines
+        while (document->blockCount() > params.max_lines) {
+            cursor.select(QTextCursor::BlockUnderCursor);
+            cursor.removeSelectedText();
+            cursor.deleteChar();  // delete the newline after the block
+        }
+
+        cursor.movePosition(QTextCursor::End);
+        cursor.setCharFormat(params.default_color);
+
+        // if color range not specified or not not valid, just append the text with default color
+        if (params.color_range_end <= params.color_range_start) {
+            cursor.insertText(params.payload);
+            return;
+        }
+
+        // insert the text before the color range
+        cursor.insertText(params.payload.left(params.color_range_start));
+
+        // insert the colorized text
+        cursor.setCharFormat(params.level_color);
+        cursor.insertText(params.payload.mid(params.color_range_start,
+                                             params.color_range_end - params.color_range_start));
+
+        // insert the text after the color range with default format
+        cursor.setCharFormat(params.default_color);
+        cursor.insertText(params.payload.mid(params.color_range_end));
+    }
+
+    QTextEdit *qt_text_edit_;
+    int max_lines_;
+    bool is_utf8_;
+    QTextCharFormat default_color_;
+    std::array<QTextCharFormat, level::n_levels> colors_;
+};
+
+#include "spdlog/details/null_mutex.h"
+#include <mutex>
+
+using qt_sink_mt = qt_sink<std::mutex>;
+using qt_sink_st = qt_sink<details::null_mutex>;
+using qt_color_sink_mt = qt_color_sink<std::mutex>;
+using qt_color_sink_st = qt_color_sink<details::null_mutex>;
+}  // namespace sinks
+
+//
+// Factory functions
+//
+
+// log to QTextEdit
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> qt_logger_mt(const std::string &logger_name,
+                                            QTextEdit *qt_object,
+                                            const std::string &meta_method = "append") {
+    return Factory::template create<sinks::qt_sink_mt>(logger_name, qt_object, meta_method);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> qt_logger_st(const std::string &logger_name,
+                                            QTextEdit *qt_object,
+                                            const std::string &meta_method = "append") {
+    return Factory::template create<sinks::qt_sink_st>(logger_name, qt_object, meta_method);
+}
+
+// log to QPlainTextEdit
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> qt_logger_mt(const std::string &logger_name,
+                                            QPlainTextEdit *qt_object,
+                                            const std::string &meta_method = "appendPlainText") {
+    return Factory::template create<sinks::qt_sink_mt>(logger_name, qt_object, meta_method);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> qt_logger_st(const std::string &logger_name,
+                                            QPlainTextEdit *qt_object,
+                                            const std::string &meta_method = "appendPlainText") {
+    return Factory::template create<sinks::qt_sink_st>(logger_name, qt_object, meta_method);
+}
+// log to QObject
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> qt_logger_mt(const std::string &logger_name,
+                                            QObject *qt_object,
+                                            const std::string &meta_method) {
+    return Factory::template create<sinks::qt_sink_mt>(logger_name, qt_object, meta_method);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> qt_logger_st(const std::string &logger_name,
+                                            QObject *qt_object,
+                                            const std::string &meta_method) {
+    return Factory::template create<sinks::qt_sink_st>(logger_name, qt_object, meta_method);
+}
+
+// log to QTextEdit with colorize output
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> qt_color_logger_mt(const std::string &logger_name,
+                                                  QTextEdit *qt_text_edit,
+                                                  int max_lines,
+                                                  bool is_utf8 = false) {
+    return Factory::template create<sinks::qt_color_sink_mt>(logger_name, qt_text_edit, max_lines,
+                                                             false, is_utf8);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> qt_color_logger_st(const std::string &logger_name,
+                                                  QTextEdit *qt_text_edit,
+                                                  int max_lines,
+                                                  bool is_utf8 = false) {
+    return Factory::template create<sinks::qt_color_sink_st>(logger_name, qt_text_edit, max_lines,
+                                                             false, is_utf8);
+}
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ringbuffer_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ringbuffer_sink.h
new file mode 100644
index 0000000000..6156c6a516
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/ringbuffer_sink.h
@@ -0,0 +1,67 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include "spdlog/details/circular_q.h"
+#include "spdlog/details/log_msg_buffer.h"
+#include "spdlog/details/null_mutex.h"
+#include "spdlog/sinks/base_sink.h"
+
+#include <mutex>
+#include <string>
+#include <vector>
+
+namespace spdlog {
+namespace sinks {
+/*
+ * Ring buffer sink
+ */
+template <typename Mutex>
+class ringbuffer_sink final : public base_sink<Mutex> {
+public:
+    explicit ringbuffer_sink(size_t n_items)
+        : q_{n_items} {}
+
+    std::vector<details::log_msg_buffer> last_raw(size_t lim = 0) {
+        std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        auto items_available = q_.size();
+        auto n_items = lim > 0 ? (std::min)(lim, items_available) : items_available;
+        std::vector<details::log_msg_buffer> ret;
+        ret.reserve(n_items);
+        for (size_t i = (items_available - n_items); i < items_available; i++) {
+            ret.push_back(q_.at(i));
+        }
+        return ret;
+    }
+
+    std::vector<std::string> last_formatted(size_t lim = 0) {
+        std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+        auto items_available = q_.size();
+        auto n_items = lim > 0 ? (std::min)(lim, items_available) : items_available;
+        std::vector<std::string> ret;
+        ret.reserve(n_items);
+        for (size_t i = (items_available - n_items); i < items_available; i++) {
+            memory_buf_t formatted;
+            base_sink<Mutex>::formatter_->format(q_.at(i), formatted);
+            ret.push_back(SPDLOG_BUF_TO_STRING(formatted));
+        }
+        return ret;
+    }
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        q_.push_back(details::log_msg_buffer{msg});
+    }
+    void flush_() override {}
+
+private:
+    details::circular_q<details::log_msg_buffer> q_;
+};
+
+using ringbuffer_sink_mt = ringbuffer_sink<std::mutex>;
+using ringbuffer_sink_st = ringbuffer_sink<details::null_mutex>;
+
+}  // namespace sinks
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/rotating_file_sink-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/rotating_file_sink-inl.h
new file mode 100644
index 0000000000..6f10256fc6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/rotating_file_sink-inl.h
@@ -0,0 +1,144 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/sinks/rotating_file_sink.h>
+#endif
+
+#include <spdlog/common.h>
+
+#include <spdlog/details/file_helper.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/fmt/fmt.h>
+
+#include <cerrno>
+#include <chrono>
+#include <ctime>
+#include <mutex>
+#include <string>
+#include <tuple>
+
+namespace spdlog {
+namespace sinks {
+
+template <typename Mutex>
+SPDLOG_INLINE rotating_file_sink<Mutex>::rotating_file_sink(
+    filename_t base_filename,
+    std::size_t max_size,
+    std::size_t max_files,
+    bool rotate_on_open,
+    const file_event_handlers &event_handlers)
+    : base_filename_(std::move(base_filename)),
+      max_size_(max_size),
+      max_files_(max_files),
+      file_helper_{event_handlers} {
+    if (max_size == 0) {
+        throw_spdlog_ex("rotating sink constructor: max_size arg cannot be zero");
+    }
+
+    if (max_files > 200000) {
+        throw_spdlog_ex("rotating sink constructor: max_files arg cannot exceed 200000");
+    }
+    file_helper_.open(calc_filename(base_filename_, 0));
+    current_size_ = file_helper_.size();  // expensive. called only once
+    if (rotate_on_open && current_size_ > 0) {
+        rotate_();
+        current_size_ = 0;
+    }
+}
+
+// calc filename according to index and file extension if exists.
+// e.g. calc_filename("logs/mylog.txt, 3) => "logs/mylog.3.txt".
+template <typename Mutex>
+SPDLOG_INLINE filename_t rotating_file_sink<Mutex>::calc_filename(const filename_t &filename,
+                                                                  std::size_t index) {
+    if (index == 0u) {
+        return filename;
+    }
+
+    filename_t basename, ext;
+    std::tie(basename, ext) = details::file_helper::split_by_extension(filename);
+    return fmt_lib::format(SPDLOG_FILENAME_T("{}.{}{}"), basename, index, ext);
+}
+
+template <typename Mutex>
+SPDLOG_INLINE filename_t rotating_file_sink<Mutex>::filename() {
+    std::lock_guard<Mutex> lock(base_sink<Mutex>::mutex_);
+    return file_helper_.filename();
+}
+
+template <typename Mutex>
+SPDLOG_INLINE void rotating_file_sink<Mutex>::sink_it_(const details::log_msg &msg) {
+    memory_buf_t formatted;
+    base_sink<Mutex>::formatter_->format(msg, formatted);
+    auto new_size = current_size_ + formatted.size();
+
+    // rotate if the new estimated file size exceeds max size.
+    // rotate only if the real size > 0 to better deal with full disk (see issue #2261).
+    // we only check the real size when new_size > max_size_ because it is relatively expensive.
+    if (new_size > max_size_) {
+        file_helper_.flush();
+        if (file_helper_.size() > 0) {
+            rotate_();
+            new_size = formatted.size();
+        }
+    }
+    file_helper_.write(formatted);
+    current_size_ = new_size;
+}
+
+template <typename Mutex>
+SPDLOG_INLINE void rotating_file_sink<Mutex>::flush_() {
+    file_helper_.flush();
+}
+
+// Rotate files:
+// log.txt -> log.1.txt
+// log.1.txt -> log.2.txt
+// log.2.txt -> log.3.txt
+// log.3.txt -> delete
+template <typename Mutex>
+SPDLOG_INLINE void rotating_file_sink<Mutex>::rotate_() {
+    using details::os::filename_to_str;
+    using details::os::path_exists;
+
+    file_helper_.close();
+    for (auto i = max_files_; i > 0; --i) {
+        filename_t src = calc_filename(base_filename_, i - 1);
+        if (!path_exists(src)) {
+            continue;
+        }
+        filename_t target = calc_filename(base_filename_, i);
+
+        if (!rename_file_(src, target)) {
+            // if failed try again after a small delay.
+            // this is a workaround to a windows issue, where very high rotation
+            // rates can cause the rename to fail with permission denied (because of antivirus?).
+            details::os::sleep_for_millis(100);
+            if (!rename_file_(src, target)) {
+                file_helper_.reopen(
+                    true);  // truncate the log file anyway to prevent it to grow beyond its limit!
+                current_size_ = 0;
+                throw_spdlog_ex("rotating_file_sink: failed renaming " + filename_to_str(src) +
+                                    " to " + filename_to_str(target),
+                                errno);
+            }
+        }
+    }
+    file_helper_.reopen(true);
+}
+
+// delete the target if exists, and rename the src file  to target
+// return true on success, false otherwise.
+template <typename Mutex>
+SPDLOG_INLINE bool rotating_file_sink<Mutex>::rename_file_(const filename_t &src_filename,
+                                                           const filename_t &target_filename) {
+    // try to delete the target file in case it already exists.
+    (void)details::os::remove(target_filename);
+    return details::os::rename(src_filename, target_filename) == 0;
+}
+
+}  // namespace sinks
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/rotating_file_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/rotating_file_sink.h
new file mode 100644
index 0000000000..cd43d349d0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/rotating_file_sink.h
@@ -0,0 +1,89 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/file_helper.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <chrono>
+#include <mutex>
+#include <string>
+
+namespace spdlog {
+namespace sinks {
+
+//
+// Rotating file sink based on size
+//
+template <typename Mutex>
+class rotating_file_sink final : public base_sink<Mutex> {
+public:
+    rotating_file_sink(filename_t base_filename,
+                       std::size_t max_size,
+                       std::size_t max_files,
+                       bool rotate_on_open = false,
+                       const file_event_handlers &event_handlers = {});
+    static filename_t calc_filename(const filename_t &filename, std::size_t index);
+    filename_t filename();
+
+protected:
+    void sink_it_(const details::log_msg &msg) override;
+    void flush_() override;
+
+private:
+    // Rotate files:
+    // log.txt -> log.1.txt
+    // log.1.txt -> log.2.txt
+    // log.2.txt -> log.3.txt
+    // log.3.txt -> delete
+    void rotate_();
+
+    // delete the target if exists, and rename the src file  to target
+    // return true on success, false otherwise.
+    bool rename_file_(const filename_t &src_filename, const filename_t &target_filename);
+
+    filename_t base_filename_;
+    std::size_t max_size_;
+    std::size_t max_files_;
+    std::size_t current_size_;
+    details::file_helper file_helper_;
+};
+
+using rotating_file_sink_mt = rotating_file_sink<std::mutex>;
+using rotating_file_sink_st = rotating_file_sink<details::null_mutex>;
+
+}  // namespace sinks
+
+//
+// factory functions
+//
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> rotating_logger_mt(const std::string &logger_name,
+                                                  const filename_t &filename,
+                                                  size_t max_file_size,
+                                                  size_t max_files,
+                                                  bool rotate_on_open = false,
+                                                  const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::rotating_file_sink_mt>(
+        logger_name, filename, max_file_size, max_files, rotate_on_open, event_handlers);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> rotating_logger_st(const std::string &logger_name,
+                                                  const filename_t &filename,
+                                                  size_t max_file_size,
+                                                  size_t max_files,
+                                                  bool rotate_on_open = false,
+                                                  const file_event_handlers &event_handlers = {}) {
+    return Factory::template create<sinks::rotating_file_sink_st>(
+        logger_name, filename, max_file_size, max_files, rotate_on_open, event_handlers);
+}
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "rotating_file_sink-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/sink-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/sink-inl.h
new file mode 100644
index 0000000000..e4b271404f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/sink-inl.h
@@ -0,0 +1,22 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/sinks/sink.h>
+#endif
+
+#include <spdlog/common.h>
+
+SPDLOG_INLINE bool spdlog::sinks::sink::should_log(spdlog::level::level_enum msg_level) const {
+    return msg_level >= level_.load(std::memory_order_relaxed);
+}
+
+SPDLOG_INLINE void spdlog::sinks::sink::set_level(level::level_enum log_level) {
+    level_.store(log_level, std::memory_order_relaxed);
+}
+
+SPDLOG_INLINE spdlog::level::level_enum spdlog::sinks::sink::level() const {
+    return static_cast<spdlog::level::level_enum>(level_.load(std::memory_order_relaxed));
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/sink.h
new file mode 100644
index 0000000000..5850685364
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/sink.h
@@ -0,0 +1,34 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/log_msg.h>
+#include <spdlog/formatter.h>
+
+namespace spdlog {
+
+namespace sinks {
+class SPDLOG_API sink {
+public:
+    virtual ~sink() = default;
+    virtual void log(const details::log_msg &msg) = 0;
+    virtual void flush() = 0;
+    virtual void set_pattern(const std::string &pattern) = 0;
+    virtual void set_formatter(std::unique_ptr<spdlog::formatter> sink_formatter) = 0;
+
+    void set_level(level::level_enum log_level);
+    level::level_enum level() const;
+    bool should_log(level::level_enum msg_level) const;
+
+protected:
+    // sink log level - default is all
+    level_t level_{level::trace};
+};
+
+}  // namespace sinks
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "sink-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_color_sinks-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_color_sinks-inl.h
new file mode 100644
index 0000000000..166e386145
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_color_sinks-inl.h
@@ -0,0 +1,38 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/sinks/stdout_color_sinks.h>
+#endif
+
+#include <spdlog/common.h>
+#include <spdlog/logger.h>
+
+namespace spdlog {
+
+template <typename Factory>
+SPDLOG_INLINE std::shared_ptr<logger> stdout_color_mt(const std::string &logger_name,
+                                                      color_mode mode) {
+    return Factory::template create<sinks::stdout_color_sink_mt>(logger_name, mode);
+}
+
+template <typename Factory>
+SPDLOG_INLINE std::shared_ptr<logger> stdout_color_st(const std::string &logger_name,
+                                                      color_mode mode) {
+    return Factory::template create<sinks::stdout_color_sink_st>(logger_name, mode);
+}
+
+template <typename Factory>
+SPDLOG_INLINE std::shared_ptr<logger> stderr_color_mt(const std::string &logger_name,
+                                                      color_mode mode) {
+    return Factory::template create<sinks::stderr_color_sink_mt>(logger_name, mode);
+}
+
+template <typename Factory>
+SPDLOG_INLINE std::shared_ptr<logger> stderr_color_st(const std::string &logger_name,
+                                                      color_mode mode) {
+    return Factory::template create<sinks::stderr_color_sink_st>(logger_name, mode);
+}
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_color_sinks.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_color_sinks.h
new file mode 100644
index 0000000000..72991fe0ed
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_color_sinks.h
@@ -0,0 +1,49 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifdef _WIN32
+    #include <spdlog/sinks/wincolor_sink.h>
+#else
+    #include <spdlog/sinks/ansicolor_sink.h>
+#endif
+
+#include <spdlog/details/synchronous_factory.h>
+
+namespace spdlog {
+namespace sinks {
+#ifdef _WIN32
+using stdout_color_sink_mt = wincolor_stdout_sink_mt;
+using stdout_color_sink_st = wincolor_stdout_sink_st;
+using stderr_color_sink_mt = wincolor_stderr_sink_mt;
+using stderr_color_sink_st = wincolor_stderr_sink_st;
+#else
+using stdout_color_sink_mt = ansicolor_stdout_sink_mt;
+using stdout_color_sink_st = ansicolor_stdout_sink_st;
+using stderr_color_sink_mt = ansicolor_stderr_sink_mt;
+using stderr_color_sink_st = ansicolor_stderr_sink_st;
+#endif
+}  // namespace sinks
+
+template <typename Factory = spdlog::synchronous_factory>
+std::shared_ptr<logger> stdout_color_mt(const std::string &logger_name,
+                                        color_mode mode = color_mode::automatic);
+
+template <typename Factory = spdlog::synchronous_factory>
+std::shared_ptr<logger> stdout_color_st(const std::string &logger_name,
+                                        color_mode mode = color_mode::automatic);
+
+template <typename Factory = spdlog::synchronous_factory>
+std::shared_ptr<logger> stderr_color_mt(const std::string &logger_name,
+                                        color_mode mode = color_mode::automatic);
+
+template <typename Factory = spdlog::synchronous_factory>
+std::shared_ptr<logger> stderr_color_st(const std::string &logger_name,
+                                        color_mode mode = color_mode::automatic);
+
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "stdout_color_sinks-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_sinks-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_sinks-inl.h
new file mode 100644
index 0000000000..f98244db29
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_sinks-inl.h
@@ -0,0 +1,126 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/sinks/stdout_sinks.h>
+#endif
+
+#include <memory>
+#include <spdlog/details/console_globals.h>
+#include <spdlog/pattern_formatter.h>
+
+#ifdef _WIN32
+    // under windows using fwrite to non-binary stream results in \r\r\n (see issue #1675)
+    // so instead we use ::FileWrite
+    #include <spdlog/details/windows_include.h>
+
+    #ifndef _USING_V110_SDK71_  // fileapi.h doesn't exist in winxp
+        #include <fileapi.h>    // WriteFile (..)
+    #endif
+
+    #include <io.h>     // _get_osfhandle(..)
+    #include <stdio.h>  // _fileno(..)
+#endif                  // WIN32
+
+namespace spdlog {
+
+namespace sinks {
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE stdout_sink_base<ConsoleMutex>::stdout_sink_base(FILE *file)
+    : mutex_(ConsoleMutex::mutex()),
+      file_(file),
+      formatter_(details::make_unique<spdlog::pattern_formatter>()) {
+#ifdef _WIN32
+    // get windows handle from the FILE* object
+
+    handle_ = reinterpret_cast<HANDLE>(::_get_osfhandle(::_fileno(file_)));
+
+    // don't throw to support cases where no console is attached,
+    // and let the log method to do nothing if (handle_ == INVALID_HANDLE_VALUE).
+    // throw only if non stdout/stderr target is requested (probably regular file and not console).
+    if (handle_ == INVALID_HANDLE_VALUE && file != stdout && file != stderr) {
+        throw_spdlog_ex("spdlog::stdout_sink_base: _get_osfhandle() failed", errno);
+    }
+#endif  // WIN32
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void stdout_sink_base<ConsoleMutex>::log(const details::log_msg &msg) {
+#ifdef _WIN32
+    if (handle_ == INVALID_HANDLE_VALUE) {
+        return;
+    }
+    std::lock_guard<mutex_t> lock(mutex_);
+    memory_buf_t formatted;
+    formatter_->format(msg, formatted);
+    auto size = static_cast<DWORD>(formatted.size());
+    DWORD bytes_written = 0;
+    bool ok = ::WriteFile(handle_, formatted.data(), size, &bytes_written, nullptr) != 0;
+    if (!ok) {
+        throw_spdlog_ex("stdout_sink_base: WriteFile() failed. GetLastError(): " +
+                        std::to_string(::GetLastError()));
+    }
+#else
+    std::lock_guard<mutex_t> lock(mutex_);
+    memory_buf_t formatted;
+    formatter_->format(msg, formatted);
+    ::fwrite(formatted.data(), sizeof(char), formatted.size(), file_);
+#endif                // WIN32
+    ::fflush(file_);  // flush every line to terminal
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void stdout_sink_base<ConsoleMutex>::flush() {
+    std::lock_guard<mutex_t> lock(mutex_);
+    fflush(file_);
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void stdout_sink_base<ConsoleMutex>::set_pattern(const std::string &pattern) {
+    std::lock_guard<mutex_t> lock(mutex_);
+    formatter_ = std::unique_ptr<spdlog::formatter>(new pattern_formatter(pattern));
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE void stdout_sink_base<ConsoleMutex>::set_formatter(
+    std::unique_ptr<spdlog::formatter> sink_formatter) {
+    std::lock_guard<mutex_t> lock(mutex_);
+    formatter_ = std::move(sink_formatter);
+}
+
+// stdout sink
+template <typename ConsoleMutex>
+SPDLOG_INLINE stdout_sink<ConsoleMutex>::stdout_sink()
+    : stdout_sink_base<ConsoleMutex>(stdout) {}
+
+// stderr sink
+template <typename ConsoleMutex>
+SPDLOG_INLINE stderr_sink<ConsoleMutex>::stderr_sink()
+    : stdout_sink_base<ConsoleMutex>(stderr) {}
+
+}  // namespace sinks
+
+// factory methods
+template <typename Factory>
+SPDLOG_INLINE std::shared_ptr<logger> stdout_logger_mt(const std::string &logger_name) {
+    return Factory::template create<sinks::stdout_sink_mt>(logger_name);
+}
+
+template <typename Factory>
+SPDLOG_INLINE std::shared_ptr<logger> stdout_logger_st(const std::string &logger_name) {
+    return Factory::template create<sinks::stdout_sink_st>(logger_name);
+}
+
+template <typename Factory>
+SPDLOG_INLINE std::shared_ptr<logger> stderr_logger_mt(const std::string &logger_name) {
+    return Factory::template create<sinks::stderr_sink_mt>(logger_name);
+}
+
+template <typename Factory>
+SPDLOG_INLINE std::shared_ptr<logger> stderr_logger_st(const std::string &logger_name) {
+    return Factory::template create<sinks::stderr_sink_st>(logger_name);
+}
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_sinks.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_sinks.h
new file mode 100644
index 0000000000..6ef09968a4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/stdout_sinks.h
@@ -0,0 +1,84 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <cstdio>
+#include <spdlog/details/console_globals.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/sinks/sink.h>
+
+#ifdef _WIN32
+    #include <spdlog/details/windows_include.h>
+#endif
+
+namespace spdlog {
+
+namespace sinks {
+
+template <typename ConsoleMutex>
+class stdout_sink_base : public sink {
+public:
+    using mutex_t = typename ConsoleMutex::mutex_t;
+    explicit stdout_sink_base(FILE *file);
+    ~stdout_sink_base() override = default;
+
+    stdout_sink_base(const stdout_sink_base &other) = delete;
+    stdout_sink_base(stdout_sink_base &&other) = delete;
+
+    stdout_sink_base &operator=(const stdout_sink_base &other) = delete;
+    stdout_sink_base &operator=(stdout_sink_base &&other) = delete;
+
+    void log(const details::log_msg &msg) override;
+    void flush() override;
+    void set_pattern(const std::string &pattern) override;
+
+    void set_formatter(std::unique_ptr<spdlog::formatter> sink_formatter) override;
+
+protected:
+    mutex_t &mutex_;
+    FILE *file_;
+    std::unique_ptr<spdlog::formatter> formatter_;
+#ifdef _WIN32
+    HANDLE handle_;
+#endif  // WIN32
+};
+
+template <typename ConsoleMutex>
+class stdout_sink : public stdout_sink_base<ConsoleMutex> {
+public:
+    stdout_sink();
+};
+
+template <typename ConsoleMutex>
+class stderr_sink : public stdout_sink_base<ConsoleMutex> {
+public:
+    stderr_sink();
+};
+
+using stdout_sink_mt = stdout_sink<details::console_mutex>;
+using stdout_sink_st = stdout_sink<details::console_nullmutex>;
+
+using stderr_sink_mt = stderr_sink<details::console_mutex>;
+using stderr_sink_st = stderr_sink<details::console_nullmutex>;
+
+}  // namespace sinks
+
+// factory methods
+template <typename Factory = spdlog::synchronous_factory>
+std::shared_ptr<logger> stdout_logger_mt(const std::string &logger_name);
+
+template <typename Factory = spdlog::synchronous_factory>
+std::shared_ptr<logger> stdout_logger_st(const std::string &logger_name);
+
+template <typename Factory = spdlog::synchronous_factory>
+std::shared_ptr<logger> stderr_logger_mt(const std::string &logger_name);
+
+template <typename Factory = spdlog::synchronous_factory>
+std::shared_ptr<logger> stderr_logger_st(const std::string &logger_name);
+
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "stdout_sinks-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/syslog_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/syslog_sink.h
new file mode 100644
index 0000000000..a2df3b44de
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/syslog_sink.h
@@ -0,0 +1,103 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <array>
+#include <string>
+#include <syslog.h>
+
+namespace spdlog {
+namespace sinks {
+/**
+ * Sink that write to syslog using the `syscall()` library call.
+ */
+template <typename Mutex>
+class syslog_sink : public base_sink<Mutex> {
+public:
+    syslog_sink(std::string ident, int syslog_option, int syslog_facility, bool enable_formatting)
+        : enable_formatting_{enable_formatting},
+          syslog_levels_{{/* spdlog::level::trace      */ LOG_DEBUG,
+                          /* spdlog::level::debug      */ LOG_DEBUG,
+                          /* spdlog::level::info       */ LOG_INFO,
+                          /* spdlog::level::warn       */ LOG_WARNING,
+                          /* spdlog::level::err        */ LOG_ERR,
+                          /* spdlog::level::critical   */ LOG_CRIT,
+                          /* spdlog::level::off        */ LOG_INFO}},
+          ident_{std::move(ident)} {
+        // set ident to be program name if empty
+        ::openlog(ident_.empty() ? nullptr : ident_.c_str(), syslog_option, syslog_facility);
+    }
+
+    ~syslog_sink() override { ::closelog(); }
+
+    syslog_sink(const syslog_sink &) = delete;
+    syslog_sink &operator=(const syslog_sink &) = delete;
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        string_view_t payload;
+        memory_buf_t formatted;
+        if (enable_formatting_) {
+            base_sink<Mutex>::formatter_->format(msg, formatted);
+            payload = string_view_t(formatted.data(), formatted.size());
+        } else {
+            payload = msg.payload;
+        }
+
+        size_t length = payload.size();
+        // limit to max int
+        if (length > static_cast<size_t>(std::numeric_limits<int>::max())) {
+            length = static_cast<size_t>(std::numeric_limits<int>::max());
+        }
+
+        ::syslog(syslog_prio_from_level(msg), "%.*s", static_cast<int>(length), payload.data());
+    }
+
+    void flush_() override {}
+    bool enable_formatting_ = false;
+
+    //
+    // Simply maps spdlog's log level to syslog priority level.
+    //
+    int syslog_prio_from_level(const details::log_msg &msg) const {
+        return syslog_levels_.at(static_cast<levels_array::size_type>(msg.level));
+    }
+
+private:
+    using levels_array = std::array<int, 7>;
+    levels_array syslog_levels_;
+    // must store the ident because the man says openlog might use the pointer as
+    // is and not a string copy
+    const std::string ident_;
+};
+
+using syslog_sink_mt = syslog_sink<std::mutex>;
+using syslog_sink_st = syslog_sink<details::null_mutex>;
+}  // namespace sinks
+
+// Create and register a syslog logger
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> syslog_logger_mt(const std::string &logger_name,
+                                                const std::string &syslog_ident = "",
+                                                int syslog_option = 0,
+                                                int syslog_facility = LOG_USER,
+                                                bool enable_formatting = false) {
+    return Factory::template create<sinks::syslog_sink_mt>(logger_name, syslog_ident, syslog_option,
+                                                           syslog_facility, enable_formatting);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> syslog_logger_st(const std::string &logger_name,
+                                                const std::string &syslog_ident = "",
+                                                int syslog_option = 0,
+                                                int syslog_facility = LOG_USER,
+                                                bool enable_formatting = false) {
+    return Factory::template create<sinks::syslog_sink_st>(logger_name, syslog_ident, syslog_option,
+                                                           syslog_facility, enable_formatting);
+}
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/systemd_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/systemd_sink.h
new file mode 100644
index 0000000000..d2cd55f2e9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/systemd_sink.h
@@ -0,0 +1,121 @@
+// Copyright(c) 2019 ZVYAGIN.Alexander@gmail.com
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/details/os.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <array>
+#ifndef SD_JOURNAL_SUPPRESS_LOCATION
+    #define SD_JOURNAL_SUPPRESS_LOCATION
+#endif
+#include <systemd/sd-journal.h>
+
+namespace spdlog {
+namespace sinks {
+
+/**
+ * Sink that write to systemd journal using the `sd_journal_send()` library call.
+ */
+template <typename Mutex>
+class systemd_sink : public base_sink<Mutex> {
+public:
+    systemd_sink(std::string ident = "", bool enable_formatting = false)
+        : ident_{std::move(ident)},
+          enable_formatting_{enable_formatting},
+          syslog_levels_{{/* spdlog::level::trace      */ LOG_DEBUG,
+                          /* spdlog::level::debug      */ LOG_DEBUG,
+                          /* spdlog::level::info       */ LOG_INFO,
+                          /* spdlog::level::warn       */ LOG_WARNING,
+                          /* spdlog::level::err        */ LOG_ERR,
+                          /* spdlog::level::critical   */ LOG_CRIT,
+                          /* spdlog::level::off        */ LOG_INFO}} {}
+
+    ~systemd_sink() override {}
+
+    systemd_sink(const systemd_sink &) = delete;
+    systemd_sink &operator=(const systemd_sink &) = delete;
+
+protected:
+    const std::string ident_;
+    bool enable_formatting_ = false;
+    using levels_array = std::array<int, 7>;
+    levels_array syslog_levels_;
+
+    void sink_it_(const details::log_msg &msg) override {
+        int err;
+        string_view_t payload;
+        memory_buf_t formatted;
+        if (enable_formatting_) {
+            base_sink<Mutex>::formatter_->format(msg, formatted);
+            payload = string_view_t(formatted.data(), formatted.size());
+        } else {
+            payload = msg.payload;
+        }
+
+        size_t length = payload.size();
+        // limit to max int
+        if (length > static_cast<size_t>(std::numeric_limits<int>::max())) {
+            length = static_cast<size_t>(std::numeric_limits<int>::max());
+        }
+
+        const string_view_t syslog_identifier = ident_.empty() ? msg.logger_name : ident_;
+
+        // Do not send source location if not available
+        if (msg.source.empty()) {
+            // Note: function call inside '()' to avoid macro expansion
+            err = (sd_journal_send)("MESSAGE=%.*s", static_cast<int>(length), payload.data(),
+                                    "PRIORITY=%d", syslog_level(msg.level),
+#ifndef SPDLOG_NO_THREAD_ID
+                                    "TID=%zu", msg.thread_id,
+#endif
+                                    "SYSLOG_IDENTIFIER=%.*s",
+                                    static_cast<int>(syslog_identifier.size()),
+                                    syslog_identifier.data(), nullptr);
+        } else {
+            err = (sd_journal_send)("MESSAGE=%.*s", static_cast<int>(length), payload.data(),
+                                    "PRIORITY=%d", syslog_level(msg.level),
+#ifndef SPDLOG_NO_THREAD_ID
+                                    "TID=%zu", msg.thread_id,
+#endif
+                                    "SYSLOG_IDENTIFIER=%.*s",
+                                    static_cast<int>(syslog_identifier.size()),
+                                    syslog_identifier.data(), "CODE_FILE=%s", msg.source.filename,
+                                    "CODE_LINE=%d", msg.source.line, "CODE_FUNC=%s",
+                                    msg.source.funcname, nullptr);
+        }
+
+        if (err) {
+            throw_spdlog_ex("Failed writing to systemd", errno);
+        }
+    }
+
+    int syslog_level(level::level_enum l) {
+        return syslog_levels_.at(static_cast<levels_array::size_type>(l));
+    }
+
+    void flush_() override {}
+};
+
+using systemd_sink_mt = systemd_sink<std::mutex>;
+using systemd_sink_st = systemd_sink<details::null_mutex>;
+}  // namespace sinks
+
+// Create and register a syslog logger
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> systemd_logger_mt(const std::string &logger_name,
+                                                 const std::string &ident = "",
+                                                 bool enable_formatting = false) {
+    return Factory::template create<sinks::systemd_sink_mt>(logger_name, ident, enable_formatting);
+}
+
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> systemd_logger_st(const std::string &logger_name,
+                                                 const std::string &ident = "",
+                                                 bool enable_formatting = false) {
+    return Factory::template create<sinks::systemd_sink_st>(logger_name, ident, enable_formatting);
+}
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/tcp_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/tcp_sink.h
new file mode 100644
index 0000000000..2534964549
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/tcp_sink.h
@@ -0,0 +1,75 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/sinks/base_sink.h>
+#ifdef _WIN32
+    #include <spdlog/details/tcp_client-windows.h>
+#else
+    #include <spdlog/details/tcp_client.h>
+#endif
+
+#include <chrono>
+#include <functional>
+#include <mutex>
+#include <string>
+
+#pragma once
+
+// Simple tcp client sink
+// Connects to remote address and send the formatted log.
+// Will attempt to reconnect if connection drops.
+// If more complicated behaviour is needed (i.e get responses), you can inherit it and override the
+// sink_it_ method.
+
+namespace spdlog {
+namespace sinks {
+
+struct tcp_sink_config {
+    std::string server_host;
+    int server_port;
+    bool lazy_connect = false;  // if true connect on first log call instead of on construction
+
+    tcp_sink_config(std::string host, int port)
+        : server_host{std::move(host)},
+          server_port{port} {}
+};
+
+template <typename Mutex>
+class tcp_sink : public spdlog::sinks::base_sink<Mutex> {
+public:
+    // connect to tcp host/port or throw if failed
+    // host can be hostname or ip address
+
+    explicit tcp_sink(tcp_sink_config sink_config)
+        : config_{std::move(sink_config)} {
+        if (!config_.lazy_connect) {
+            this->client_.connect(config_.server_host, config_.server_port);
+        }
+    }
+
+    ~tcp_sink() override = default;
+
+protected:
+    void sink_it_(const spdlog::details::log_msg &msg) override {
+        spdlog::memory_buf_t formatted;
+        spdlog::sinks::base_sink<Mutex>::formatter_->format(msg, formatted);
+        if (!client_.is_connected()) {
+            client_.connect(config_.server_host, config_.server_port);
+        }
+        client_.send(formatted.data(), formatted.size());
+    }
+
+    void flush_() override {}
+    tcp_sink_config config_;
+    details::tcp_client client_;
+};
+
+using tcp_sink_mt = tcp_sink<std::mutex>;
+using tcp_sink_st = tcp_sink<spdlog::details::null_mutex>;
+
+}  // namespace sinks
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/udp_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/udp_sink.h
new file mode 100644
index 0000000000..4bff0fd2c0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/udp_sink.h
@@ -0,0 +1,69 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/sinks/base_sink.h>
+#ifdef _WIN32
+    #include <spdlog/details/udp_client-windows.h>
+#else
+    #include <spdlog/details/udp_client.h>
+#endif
+
+#include <chrono>
+#include <functional>
+#include <mutex>
+#include <string>
+
+// Simple udp client sink
+// Sends formatted log via udp
+
+namespace spdlog {
+namespace sinks {
+
+struct udp_sink_config {
+    std::string server_host;
+    uint16_t server_port;
+
+    udp_sink_config(std::string host, uint16_t port)
+        : server_host{std::move(host)},
+          server_port{port} {}
+};
+
+template <typename Mutex>
+class udp_sink : public spdlog::sinks::base_sink<Mutex> {
+public:
+    // host can be hostname or ip address
+    explicit udp_sink(udp_sink_config sink_config)
+        : client_{sink_config.server_host, sink_config.server_port} {}
+
+    ~udp_sink() override = default;
+
+protected:
+    void sink_it_(const spdlog::details::log_msg &msg) override {
+        spdlog::memory_buf_t formatted;
+        spdlog::sinks::base_sink<Mutex>::formatter_->format(msg, formatted);
+        client_.send(formatted.data(), formatted.size());
+    }
+
+    void flush_() override {}
+    details::udp_client client_;
+};
+
+using udp_sink_mt = udp_sink<std::mutex>;
+using udp_sink_st = udp_sink<spdlog::details::null_mutex>;
+
+}  // namespace sinks
+
+//
+// factory functions
+//
+template <typename Factory = spdlog::synchronous_factory>
+inline std::shared_ptr<logger> udp_logger_mt(const std::string &logger_name,
+                                             sinks::udp_sink_config skin_config) {
+    return Factory::template create<sinks::udp_sink_mt>(logger_name, skin_config);
+}
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/win_eventlog_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/win_eventlog_sink.h
new file mode 100644
index 0000000000..2c9b582d30
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/win_eventlog_sink.h
@@ -0,0 +1,260 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+// Writing to Windows Event Log requires the registry entries below to be present, with the
+// following modifications:
+// 1. <log_name>    should be replaced with your log name (e.g. your application name)
+// 2. <source_name> should be replaced with the specific source name and the key should be
+// duplicated for
+//                  each source used in the application
+//
+// Since typically modifications of this kind require elevation, it's better to do it as a part of
+// setup procedure. The snippet below uses mscoree.dll as the message file as it exists on most of
+// the Windows systems anyway and happens to contain the needed resource.
+//
+// You can also specify a custom message file if needed.
+// Please refer to Event Log functions descriptions in MSDN for more details on custom message
+// files.
+
+/*---------------------------------------------------------------------------------------
+
+Windows Registry Editor Version 5.00
+
+[HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\EventLog\<log_name>]
+
+[HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\EventLog\<log_name>\<source_name>]
+"TypesSupported"=dword:00000007
+"EventMessageFile"=hex(2):25,00,73,00,79,00,73,00,74,00,65,00,6d,00,72,00,6f,\
+  00,6f,00,74,00,25,00,5c,00,53,00,79,00,73,00,74,00,65,00,6d,00,33,00,32,00,\
+  5c,00,6d,00,73,00,63,00,6f,00,72,00,65,00,65,00,2e,00,64,00,6c,00,6c,00,00,\
+  00
+
+-----------------------------------------------------------------------------------------*/
+
+#pragma once
+
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/sinks/base_sink.h>
+
+#include <spdlog/details/windows_include.h>
+#include <winbase.h>
+
+#include <mutex>
+#include <string>
+#include <vector>
+
+namespace spdlog {
+namespace sinks {
+
+namespace win_eventlog {
+
+namespace internal {
+
+struct local_alloc_t {
+    HLOCAL hlocal_;
+
+    SPDLOG_CONSTEXPR local_alloc_t() SPDLOG_NOEXCEPT : hlocal_(nullptr) {}
+
+    local_alloc_t(local_alloc_t const &) = delete;
+    local_alloc_t &operator=(local_alloc_t const &) = delete;
+
+    ~local_alloc_t() SPDLOG_NOEXCEPT {
+        if (hlocal_) {
+            LocalFree(hlocal_);
+        }
+    }
+};
+
+/** Windows error */
+struct win32_error : public spdlog_ex {
+    /** Formats an error report line: "user-message: error-code (system message)" */
+    static std::string format(std::string const &user_message, DWORD error_code = GetLastError()) {
+        std::string system_message;
+
+        local_alloc_t format_message_result{};
+        auto format_message_succeeded =
+            ::FormatMessageA(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM |
+                                 FORMAT_MESSAGE_IGNORE_INSERTS,
+                             nullptr, error_code, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT),
+                             (LPSTR)&format_message_result.hlocal_, 0, nullptr);
+
+        if (format_message_succeeded && format_message_result.hlocal_) {
+            system_message = fmt_lib::format(" ({})", (LPSTR)format_message_result.hlocal_);
+        }
+
+        return fmt_lib::format("{}: {}{}", user_message, error_code, system_message);
+    }
+
+    explicit win32_error(std::string const &func_name, DWORD error = GetLastError())
+        : spdlog_ex(format(func_name, error)) {}
+};
+
+/** Wrapper for security identifiers (SID) on Windows */
+struct sid_t {
+    std::vector<char> buffer_;
+
+public:
+    sid_t() {}
+
+    /** creates a wrapped SID copy */
+    static sid_t duplicate_sid(PSID psid) {
+        if (!::IsValidSid(psid)) {
+            throw_spdlog_ex("sid_t::sid_t(): invalid SID received");
+        }
+
+        auto const sid_length{::GetLengthSid(psid)};
+
+        sid_t result;
+        result.buffer_.resize(sid_length);
+        if (!::CopySid(sid_length, (PSID)result.as_sid(), psid)) {
+            SPDLOG_THROW(win32_error("CopySid"));
+        }
+
+        return result;
+    }
+
+    /** Retrieves pointer to the internal buffer contents as SID* */
+    SID *as_sid() const { return buffer_.empty() ? nullptr : (SID *)buffer_.data(); }
+
+    /** Get SID for the current user */
+    static sid_t get_current_user_sid() {
+        /* create and init RAII holder for process token */
+        struct process_token_t {
+            HANDLE token_handle_ = INVALID_HANDLE_VALUE;
+            explicit process_token_t(HANDLE process) {
+                if (!::OpenProcessToken(process, TOKEN_QUERY, &token_handle_)) {
+                    SPDLOG_THROW(win32_error("OpenProcessToken"));
+                }
+            }
+
+            ~process_token_t() { ::CloseHandle(token_handle_); }
+
+        } current_process_token(
+            ::GetCurrentProcess());  // GetCurrentProcess returns pseudohandle, no leak here!
+
+        // Get the required size, this is expected to fail with ERROR_INSUFFICIENT_BUFFER and return
+        // the token size
+        DWORD tusize = 0;
+        if (::GetTokenInformation(current_process_token.token_handle_, TokenUser, NULL, 0,
+                                  &tusize)) {
+            SPDLOG_THROW(win32_error("GetTokenInformation should fail"));
+        }
+
+        // get user token
+        std::vector<unsigned char> buffer(static_cast<size_t>(tusize));
+        if (!::GetTokenInformation(current_process_token.token_handle_, TokenUser,
+                                   (LPVOID)buffer.data(), tusize, &tusize)) {
+            SPDLOG_THROW(win32_error("GetTokenInformation"));
+        }
+
+        // create a wrapper of the SID data as stored in the user token
+        return sid_t::duplicate_sid(((TOKEN_USER *)buffer.data())->User.Sid);
+    }
+};
+
+struct eventlog {
+    static WORD get_event_type(details::log_msg const &msg) {
+        switch (msg.level) {
+            case level::trace:
+            case level::debug:
+                return EVENTLOG_SUCCESS;
+
+            case level::info:
+                return EVENTLOG_INFORMATION_TYPE;
+
+            case level::warn:
+                return EVENTLOG_WARNING_TYPE;
+
+            case level::err:
+            case level::critical:
+            case level::off:
+                return EVENTLOG_ERROR_TYPE;
+
+            default:
+                return EVENTLOG_INFORMATION_TYPE;
+        }
+    }
+
+    static WORD get_event_category(details::log_msg const &msg) { return (WORD)msg.level; }
+};
+
+}  // namespace internal
+
+/*
+ * Windows Event Log sink
+ */
+template <typename Mutex>
+class win_eventlog_sink : public base_sink<Mutex> {
+private:
+    HANDLE hEventLog_{NULL};
+    internal::sid_t current_user_sid_;
+    std::string source_;
+    DWORD event_id_;
+
+    HANDLE event_log_handle() {
+        if (!hEventLog_) {
+            hEventLog_ = ::RegisterEventSourceA(nullptr, source_.c_str());
+            if (!hEventLog_ || hEventLog_ == (HANDLE)ERROR_ACCESS_DENIED) {
+                SPDLOG_THROW(internal::win32_error("RegisterEventSource"));
+            }
+        }
+
+        return hEventLog_;
+    }
+
+protected:
+    void sink_it_(const details::log_msg &msg) override {
+        using namespace internal;
+
+        bool succeeded;
+        memory_buf_t formatted;
+        base_sink<Mutex>::formatter_->format(msg, formatted);
+        formatted.push_back('\0');
+
+#ifdef SPDLOG_WCHAR_TO_UTF8_SUPPORT
+        wmemory_buf_t buf;
+        details::os::utf8_to_wstrbuf(string_view_t(formatted.data(), formatted.size()), buf);
+
+        LPCWSTR lp_wstr = buf.data();
+        succeeded = static_cast<bool>(::ReportEventW(
+            event_log_handle(), eventlog::get_event_type(msg), eventlog::get_event_category(msg),
+            event_id_, current_user_sid_.as_sid(), 1, 0, &lp_wstr, nullptr));
+#else
+        LPCSTR lp_str = formatted.data();
+        succeeded = static_cast<bool>(::ReportEventA(
+            event_log_handle(), eventlog::get_event_type(msg), eventlog::get_event_category(msg),
+            event_id_, current_user_sid_.as_sid(), 1, 0, &lp_str, nullptr));
+#endif
+
+        if (!succeeded) {
+            SPDLOG_THROW(win32_error("ReportEvent"));
+        }
+    }
+
+    void flush_() override {}
+
+public:
+    win_eventlog_sink(std::string const &source,
+                      DWORD event_id = 1000 /* according to mscoree.dll */)
+        : source_(source),
+          event_id_(event_id) {
+        try {
+            current_user_sid_ = internal::sid_t::get_current_user_sid();
+        } catch (...) {
+            // get_current_user_sid() is unlikely to fail and if it does, we can still proceed
+            // without current_user_sid but in the event log the record will have no user name
+        }
+    }
+
+    ~win_eventlog_sink() {
+        if (hEventLog_) DeregisterEventSource(hEventLog_);
+    }
+};
+
+}  // namespace win_eventlog
+
+using win_eventlog_sink_mt = win_eventlog::win_eventlog_sink<std::mutex>;
+using win_eventlog_sink_st = win_eventlog::win_eventlog_sink<details::null_mutex>;
+
+}  // namespace sinks
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/wincolor_sink-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/wincolor_sink-inl.h
new file mode 100644
index 0000000000..10b8a74a25
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/wincolor_sink-inl.h
@@ -0,0 +1,163 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/sinks/wincolor_sink.h>
+#endif
+
+#include <spdlog/details/windows_include.h>
+#include <wincon.h>
+
+#include <spdlog/common.h>
+#include <spdlog/pattern_formatter.h>
+
+namespace spdlog {
+namespace sinks {
+template <typename ConsoleMutex>
+SPDLOG_INLINE wincolor_sink<ConsoleMutex>::wincolor_sink(void *out_handle, color_mode mode)
+    : out_handle_(out_handle),
+      mutex_(ConsoleMutex::mutex()),
+      formatter_(details::make_unique<spdlog::pattern_formatter>()) {
+    set_color_mode_impl(mode);
+    // set level colors
+    colors_[level::trace] = FOREGROUND_RED | FOREGROUND_GREEN | FOREGROUND_BLUE;  // white
+    colors_[level::debug] = FOREGROUND_GREEN | FOREGROUND_BLUE;                   // cyan
+    colors_[level::info] = FOREGROUND_GREEN;                                      // green
+    colors_[level::warn] =
+        FOREGROUND_RED | FOREGROUND_GREEN | FOREGROUND_INTENSITY;  // intense yellow
+    colors_[level::err] = FOREGROUND_RED | FOREGROUND_INTENSITY;   // intense red
+    colors_[level::critical] = BACKGROUND_RED | FOREGROUND_RED | FOREGROUND_GREEN |
+                               FOREGROUND_BLUE |
+                               FOREGROUND_INTENSITY;  // intense white on red background
+    colors_[level::off] = 0;
+}
+
+template <typename ConsoleMutex>
+SPDLOG_INLINE wincolor_sink<ConsoleMutex>::~wincolor_sink() {
+    this->flush();
+}
+
+// change the color for the given level
+template <typename ConsoleMutex>
+void SPDLOG_INLINE wincolor_sink<ConsoleMutex>::set_color(level::level_enum level,
+                                                          std::uint16_t color) {
+    std::lock_guard<mutex_t> lock(mutex_);
+    colors_[static_cast<size_t>(level)] = color;
+}
+
+template <typename ConsoleMutex>
+void SPDLOG_INLINE wincolor_sink<ConsoleMutex>::log(const details::log_msg &msg) {
+    if (out_handle_ == nullptr || out_handle_ == INVALID_HANDLE_VALUE) {
+        return;
+    }
+
+    std::lock_guard<mutex_t> lock(mutex_);
+    msg.color_range_start = 0;
+    msg.color_range_end = 0;
+    memory_buf_t formatted;
+    formatter_->format(msg, formatted);
+    if (should_do_colors_ && msg.color_range_end > msg.color_range_start) {
+        // before color range
+        print_range_(formatted, 0, msg.color_range_start);
+        // in color range
+        auto orig_attribs =
+            static_cast<WORD>(set_foreground_color_(colors_[static_cast<size_t>(msg.level)]));
+        print_range_(formatted, msg.color_range_start, msg.color_range_end);
+        // reset to orig colors
+        ::SetConsoleTextAttribute(static_cast<HANDLE>(out_handle_), orig_attribs);
+        print_range_(formatted, msg.color_range_end, formatted.size());
+    } else  // print without colors if color range is invalid (or color is disabled)
+    {
+        write_to_file_(formatted);
+    }
+}
+
+template <typename ConsoleMutex>
+void SPDLOG_INLINE wincolor_sink<ConsoleMutex>::flush() {
+    // windows console always flushed?
+}
+
+template <typename ConsoleMutex>
+void SPDLOG_INLINE wincolor_sink<ConsoleMutex>::set_pattern(const std::string &pattern) {
+    std::lock_guard<mutex_t> lock(mutex_);
+    formatter_ = std::unique_ptr<spdlog::formatter>(new pattern_formatter(pattern));
+}
+
+template <typename ConsoleMutex>
+void SPDLOG_INLINE
+wincolor_sink<ConsoleMutex>::set_formatter(std::unique_ptr<spdlog::formatter> sink_formatter) {
+    std::lock_guard<mutex_t> lock(mutex_);
+    formatter_ = std::move(sink_formatter);
+}
+
+template <typename ConsoleMutex>
+void SPDLOG_INLINE wincolor_sink<ConsoleMutex>::set_color_mode(color_mode mode) {
+    std::lock_guard<mutex_t> lock(mutex_);
+    set_color_mode_impl(mode);
+}
+
+template <typename ConsoleMutex>
+void SPDLOG_INLINE wincolor_sink<ConsoleMutex>::set_color_mode_impl(color_mode mode) {
+    if (mode == color_mode::automatic) {
+        // should do colors only if out_handle_  points to actual console.
+        DWORD console_mode;
+        bool in_console = ::GetConsoleMode(static_cast<HANDLE>(out_handle_), &console_mode) != 0;
+        should_do_colors_ = in_console;
+    } else {
+        should_do_colors_ = mode == color_mode::always ? true : false;
+    }
+}
+
+// set foreground color and return the orig console attributes (for resetting later)
+template <typename ConsoleMutex>
+std::uint16_t SPDLOG_INLINE
+wincolor_sink<ConsoleMutex>::set_foreground_color_(std::uint16_t attribs) {
+    CONSOLE_SCREEN_BUFFER_INFO orig_buffer_info;
+    if (!::GetConsoleScreenBufferInfo(static_cast<HANDLE>(out_handle_), &orig_buffer_info)) {
+        // just return white if failed getting console info
+        return FOREGROUND_RED | FOREGROUND_GREEN | FOREGROUND_BLUE;
+    }
+
+    // change only the foreground bits (lowest 4 bits)
+    auto new_attribs = static_cast<WORD>(attribs) | (orig_buffer_info.wAttributes & 0xfff0);
+    auto ignored =
+        ::SetConsoleTextAttribute(static_cast<HANDLE>(out_handle_), static_cast<WORD>(new_attribs));
+    (void)(ignored);
+    return static_cast<std::uint16_t>(orig_buffer_info.wAttributes);  // return orig attribs
+}
+
+// print a range of formatted message to console
+template <typename ConsoleMutex>
+void SPDLOG_INLINE wincolor_sink<ConsoleMutex>::print_range_(const memory_buf_t &formatted,
+                                                             size_t start,
+                                                             size_t end) {
+    if (end > start) {
+        auto size = static_cast<DWORD>(end - start);
+        auto ignored = ::WriteConsoleA(static_cast<HANDLE>(out_handle_), formatted.data() + start,
+                                       size, nullptr, nullptr);
+        (void)(ignored);
+    }
+}
+
+template <typename ConsoleMutex>
+void SPDLOG_INLINE wincolor_sink<ConsoleMutex>::write_to_file_(const memory_buf_t &formatted) {
+    auto size = static_cast<DWORD>(formatted.size());
+    DWORD bytes_written = 0;
+    auto ignored = ::WriteFile(static_cast<HANDLE>(out_handle_), formatted.data(), size,
+                               &bytes_written, nullptr);
+    (void)(ignored);
+}
+
+// wincolor_stdout_sink
+template <typename ConsoleMutex>
+SPDLOG_INLINE wincolor_stdout_sink<ConsoleMutex>::wincolor_stdout_sink(color_mode mode)
+    : wincolor_sink<ConsoleMutex>(::GetStdHandle(STD_OUTPUT_HANDLE), mode) {}
+
+// wincolor_stderr_sink
+template <typename ConsoleMutex>
+SPDLOG_INLINE wincolor_stderr_sink<ConsoleMutex>::wincolor_stderr_sink(color_mode mode)
+    : wincolor_sink<ConsoleMutex>(::GetStdHandle(STD_ERROR_HANDLE), mode) {}
+}  // namespace sinks
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/wincolor_sink.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/wincolor_sink.h
new file mode 100644
index 0000000000..8ba594cc2b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/sinks/wincolor_sink.h
@@ -0,0 +1,82 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <spdlog/details/console_globals.h>
+#include <spdlog/details/null_mutex.h>
+#include <spdlog/sinks/sink.h>
+
+#include <array>
+#include <cstdint>
+#include <memory>
+#include <mutex>
+#include <string>
+
+namespace spdlog {
+namespace sinks {
+/*
+ * Windows color console sink. Uses WriteConsoleA to write to the console with
+ * colors
+ */
+template <typename ConsoleMutex>
+class wincolor_sink : public sink {
+public:
+    wincolor_sink(void *out_handle, color_mode mode);
+    ~wincolor_sink() override;
+
+    wincolor_sink(const wincolor_sink &other) = delete;
+    wincolor_sink &operator=(const wincolor_sink &other) = delete;
+
+    // change the color for the given level
+    void set_color(level::level_enum level, std::uint16_t color);
+    void log(const details::log_msg &msg) final override;
+    void flush() final override;
+    void set_pattern(const std::string &pattern) override final;
+    void set_formatter(std::unique_ptr<spdlog::formatter> sink_formatter) override final;
+    void set_color_mode(color_mode mode);
+
+protected:
+    using mutex_t = typename ConsoleMutex::mutex_t;
+    void *out_handle_;
+    mutex_t &mutex_;
+    bool should_do_colors_;
+    std::unique_ptr<spdlog::formatter> formatter_;
+    std::array<std::uint16_t, level::n_levels> colors_;
+
+    // set foreground color and return the orig console attributes (for resetting later)
+    std::uint16_t set_foreground_color_(std::uint16_t attribs);
+
+    // print a range of formatted message to console
+    void print_range_(const memory_buf_t &formatted, size_t start, size_t end);
+
+    // in case we are redirected to file (not in console mode)
+    void write_to_file_(const memory_buf_t &formatted);
+
+    void set_color_mode_impl(color_mode mode);
+};
+
+template <typename ConsoleMutex>
+class wincolor_stdout_sink : public wincolor_sink<ConsoleMutex> {
+public:
+    explicit wincolor_stdout_sink(color_mode mode = color_mode::automatic);
+};
+
+template <typename ConsoleMutex>
+class wincolor_stderr_sink : public wincolor_sink<ConsoleMutex> {
+public:
+    explicit wincolor_stderr_sink(color_mode mode = color_mode::automatic);
+};
+
+using wincolor_stdout_sink_mt = wincolor_stdout_sink<details::console_mutex>;
+using wincolor_stdout_sink_st = wincolor_stdout_sink<details::console_nullmutex>;
+
+using wincolor_stderr_sink_mt = wincolor_stderr_sink<details::console_mutex>;
+using wincolor_stderr_sink_st = wincolor_stderr_sink<details::console_nullmutex>;
+}  // namespace sinks
+}  // namespace spdlog
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "wincolor_sink-inl.h"
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/spdlog-inl.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/spdlog-inl.h
new file mode 100644
index 0000000000..97c362222e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/spdlog-inl.h
@@ -0,0 +1,92 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#ifndef SPDLOG_HEADER_ONLY
+    #include <spdlog/spdlog.h>
+#endif
+
+#include <spdlog/common.h>
+#include <spdlog/pattern_formatter.h>
+
+namespace spdlog {
+
+SPDLOG_INLINE void initialize_logger(std::shared_ptr<logger> logger) {
+    details::registry::instance().initialize_logger(std::move(logger));
+}
+
+SPDLOG_INLINE std::shared_ptr<logger> get(const std::string &name) {
+    return details::registry::instance().get(name);
+}
+
+SPDLOG_INLINE void set_formatter(std::unique_ptr<spdlog::formatter> formatter) {
+    details::registry::instance().set_formatter(std::move(formatter));
+}
+
+SPDLOG_INLINE void set_pattern(std::string pattern, pattern_time_type time_type) {
+    set_formatter(
+        std::unique_ptr<spdlog::formatter>(new pattern_formatter(std::move(pattern), time_type)));
+}
+
+SPDLOG_INLINE void enable_backtrace(size_t n_messages) {
+    details::registry::instance().enable_backtrace(n_messages);
+}
+
+SPDLOG_INLINE void disable_backtrace() { details::registry::instance().disable_backtrace(); }
+
+SPDLOG_INLINE void dump_backtrace() { default_logger_raw()->dump_backtrace(); }
+
+SPDLOG_INLINE level::level_enum get_level() { return default_logger_raw()->level(); }
+
+SPDLOG_INLINE bool should_log(level::level_enum log_level) {
+    return default_logger_raw()->should_log(log_level);
+}
+
+SPDLOG_INLINE void set_level(level::level_enum log_level) {
+    details::registry::instance().set_level(log_level);
+}
+
+SPDLOG_INLINE void flush_on(level::level_enum log_level) {
+    details::registry::instance().flush_on(log_level);
+}
+
+SPDLOG_INLINE void set_error_handler(void (*handler)(const std::string &msg)) {
+    details::registry::instance().set_error_handler(handler);
+}
+
+SPDLOG_INLINE void register_logger(std::shared_ptr<logger> logger) {
+    details::registry::instance().register_logger(std::move(logger));
+}
+
+SPDLOG_INLINE void apply_all(const std::function<void(std::shared_ptr<logger>)> &fun) {
+    details::registry::instance().apply_all(fun);
+}
+
+SPDLOG_INLINE void drop(const std::string &name) { details::registry::instance().drop(name); }
+
+SPDLOG_INLINE void drop_all() { details::registry::instance().drop_all(); }
+
+SPDLOG_INLINE void shutdown() { details::registry::instance().shutdown(); }
+
+SPDLOG_INLINE void set_automatic_registration(bool automatic_registration) {
+    details::registry::instance().set_automatic_registration(automatic_registration);
+}
+
+SPDLOG_INLINE std::shared_ptr<spdlog::logger> default_logger() {
+    return details::registry::instance().default_logger();
+}
+
+SPDLOG_INLINE spdlog::logger *default_logger_raw() {
+    return details::registry::instance().get_default_raw();
+}
+
+SPDLOG_INLINE void set_default_logger(std::shared_ptr<spdlog::logger> default_logger) {
+    details::registry::instance().set_default_logger(std::move(default_logger));
+}
+
+SPDLOG_INLINE void apply_logger_env_levels(std::shared_ptr<logger> logger) {
+    details::registry::instance().apply_logger_env_levels(std::move(logger));
+}
+
+}  // namespace spdlog
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/spdlog.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/spdlog.h
new file mode 100644
index 0000000000..a8afbcec4a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/spdlog.h
@@ -0,0 +1,352 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+// spdlog main header file.
+// see example.cpp for usage example
+
+#ifndef SPDLOG_H
+#define SPDLOG_H
+
+#pragma once
+
+#include <spdlog/common.h>
+#include <spdlog/details/registry.h>
+#include <spdlog/details/synchronous_factory.h>
+#include <spdlog/logger.h>
+#include <spdlog/version.h>
+
+#include <chrono>
+#include <functional>
+#include <memory>
+#include <string>
+
+namespace spdlog {
+
+using default_factory = synchronous_factory;
+
+// Create and register a logger with a templated sink type
+// The logger's level, formatter and flush level will be set according the
+// global settings.
+//
+// Example:
+//   spdlog::create<daily_file_sink_st>("logger_name", "dailylog_filename", 11, 59);
+template <typename Sink, typename... SinkArgs>
+inline std::shared_ptr<spdlog::logger> create(std::string logger_name, SinkArgs &&...sink_args) {
+    return default_factory::create<Sink>(std::move(logger_name),
+                                         std::forward<SinkArgs>(sink_args)...);
+}
+
+// Initialize and register a logger,
+// formatter and flush level will be set according the global settings.
+//
+// Useful for initializing manually created loggers with the global settings.
+//
+// Example:
+//   auto mylogger = std::make_shared<spdlog::logger>("mylogger", ...);
+//   spdlog::initialize_logger(mylogger);
+SPDLOG_API void initialize_logger(std::shared_ptr<logger> logger);
+
+// Return an existing logger or nullptr if a logger with such name doesn't
+// exist.
+// example: spdlog::get("my_logger")->info("hello {}", "world");
+SPDLOG_API std::shared_ptr<logger> get(const std::string &name);
+
+// Set global formatter. Each sink in each logger will get a clone of this object
+SPDLOG_API void set_formatter(std::unique_ptr<spdlog::formatter> formatter);
+
+// Set global format string.
+// example: spdlog::set_pattern("%Y-%m-%d %H:%M:%S.%e %l : %v");
+SPDLOG_API void set_pattern(std::string pattern,
+                            pattern_time_type time_type = pattern_time_type::local);
+
+// enable global backtrace support
+SPDLOG_API void enable_backtrace(size_t n_messages);
+
+// disable global backtrace support
+SPDLOG_API void disable_backtrace();
+
+// call dump backtrace on default logger
+SPDLOG_API void dump_backtrace();
+
+// Get global logging level
+SPDLOG_API level::level_enum get_level();
+
+// Set global logging level
+SPDLOG_API void set_level(level::level_enum log_level);
+
+// Determine whether the default logger should log messages with a certain level
+SPDLOG_API bool should_log(level::level_enum lvl);
+
+// Set global flush level
+SPDLOG_API void flush_on(level::level_enum log_level);
+
+// Start/Restart a periodic flusher thread
+// Warning: Use only if all your loggers are thread safe!
+template <typename Rep, typename Period>
+inline void flush_every(std::chrono::duration<Rep, Period> interval) {
+    details::registry::instance().flush_every(interval);
+}
+
+// Set global error handler
+SPDLOG_API void set_error_handler(void (*handler)(const std::string &msg));
+
+// Register the given logger with the given name
+SPDLOG_API void register_logger(std::shared_ptr<logger> logger);
+
+// Apply a user defined function on all registered loggers
+// Example:
+// spdlog::apply_all([&](std::shared_ptr<spdlog::logger> l) {l->flush();});
+SPDLOG_API void apply_all(const std::function<void(std::shared_ptr<logger>)> &fun);
+
+// Drop the reference to the given logger
+SPDLOG_API void drop(const std::string &name);
+
+// Drop all references from the registry
+SPDLOG_API void drop_all();
+
+// stop any running threads started by spdlog and clean registry loggers
+SPDLOG_API void shutdown();
+
+// Automatic registration of loggers when using spdlog::create() or spdlog::create_async
+SPDLOG_API void set_automatic_registration(bool automatic_registration);
+
+// API for using default logger (stdout_color_mt),
+// e.g: spdlog::info("Message {}", 1);
+//
+// The default logger object can be accessed using the spdlog::default_logger():
+// For example, to add another sink to it:
+// spdlog::default_logger()->sinks().push_back(some_sink);
+//
+// The default logger can replaced using spdlog::set_default_logger(new_logger).
+// For example, to replace it with a file logger.
+//
+// IMPORTANT:
+// The default API is thread safe (for _mt loggers), but:
+// set_default_logger() *should not* be used concurrently with the default API.
+// e.g do not call set_default_logger() from one thread while calling spdlog::info() from another.
+
+SPDLOG_API std::shared_ptr<spdlog::logger> default_logger();
+
+SPDLOG_API spdlog::logger *default_logger_raw();
+
+SPDLOG_API void set_default_logger(std::shared_ptr<spdlog::logger> default_logger);
+
+// Initialize logger level based on environment configs.
+//
+// Useful for applying SPDLOG_LEVEL to manually created loggers.
+//
+// Example:
+//   auto mylogger = std::make_shared<spdlog::logger>("mylogger", ...);
+//   spdlog::apply_logger_env_levels(mylogger);
+SPDLOG_API void apply_logger_env_levels(std::shared_ptr<logger> logger);
+
+template <typename... Args>
+inline void log(source_loc source,
+                level::level_enum lvl,
+                format_string_t<Args...> fmt,
+                Args &&...args) {
+    default_logger_raw()->log(source, lvl, fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void log(level::level_enum lvl, format_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->log(source_loc{}, lvl, fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void trace(format_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->trace(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void debug(format_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->debug(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void info(format_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->info(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void warn(format_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->warn(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void error(format_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->error(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void critical(format_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->critical(fmt, std::forward<Args>(args)...);
+}
+
+template <typename T>
+inline void log(source_loc source, level::level_enum lvl, const T &msg) {
+    default_logger_raw()->log(source, lvl, msg);
+}
+
+template <typename T>
+inline void log(level::level_enum lvl, const T &msg) {
+    default_logger_raw()->log(lvl, msg);
+}
+
+#ifdef SPDLOG_WCHAR_TO_UTF8_SUPPORT
+template <typename... Args>
+inline void log(source_loc source,
+                level::level_enum lvl,
+                wformat_string_t<Args...> fmt,
+                Args &&...args) {
+    default_logger_raw()->log(source, lvl, fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void log(level::level_enum lvl, wformat_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->log(source_loc{}, lvl, fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void trace(wformat_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->trace(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void debug(wformat_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->debug(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void info(wformat_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->info(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void warn(wformat_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->warn(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void error(wformat_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->error(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+inline void critical(wformat_string_t<Args...> fmt, Args &&...args) {
+    default_logger_raw()->critical(fmt, std::forward<Args>(args)...);
+}
+#endif
+
+template <typename T>
+inline void trace(const T &msg) {
+    default_logger_raw()->trace(msg);
+}
+
+template <typename T>
+inline void debug(const T &msg) {
+    default_logger_raw()->debug(msg);
+}
+
+template <typename T>
+inline void info(const T &msg) {
+    default_logger_raw()->info(msg);
+}
+
+template <typename T>
+inline void warn(const T &msg) {
+    default_logger_raw()->warn(msg);
+}
+
+template <typename T>
+inline void error(const T &msg) {
+    default_logger_raw()->error(msg);
+}
+
+template <typename T>
+inline void critical(const T &msg) {
+    default_logger_raw()->critical(msg);
+}
+
+}  // namespace spdlog
+
+//
+// enable/disable log calls at compile time according to global level.
+//
+// define SPDLOG_ACTIVE_LEVEL to one of those (before including spdlog.h):
+// SPDLOG_LEVEL_TRACE,
+// SPDLOG_LEVEL_DEBUG,
+// SPDLOG_LEVEL_INFO,
+// SPDLOG_LEVEL_WARN,
+// SPDLOG_LEVEL_ERROR,
+// SPDLOG_LEVEL_CRITICAL,
+// SPDLOG_LEVEL_OFF
+//
+
+#ifndef SPDLOG_NO_SOURCE_LOC
+    #define SPDLOG_LOGGER_CALL(logger, level, ...) \
+        (logger)->log(spdlog::source_loc{__FILE__, __LINE__, SPDLOG_FUNCTION}, level, __VA_ARGS__)
+#else
+    #define SPDLOG_LOGGER_CALL(logger, level, ...) \
+        (logger)->log(spdlog::source_loc{}, level, __VA_ARGS__)
+#endif
+
+#if SPDLOG_ACTIVE_LEVEL <= SPDLOG_LEVEL_TRACE
+    #define SPDLOG_LOGGER_TRACE(logger, ...) \
+        SPDLOG_LOGGER_CALL(logger, spdlog::level::trace, __VA_ARGS__)
+    #define SPDLOG_TRACE(...) SPDLOG_LOGGER_TRACE(spdlog::default_logger_raw(), __VA_ARGS__)
+#else
+    #define SPDLOG_LOGGER_TRACE(logger, ...) (void)0
+    #define SPDLOG_TRACE(...) (void)0
+#endif
+
+#if SPDLOG_ACTIVE_LEVEL <= SPDLOG_LEVEL_DEBUG
+    #define SPDLOG_LOGGER_DEBUG(logger, ...) \
+        SPDLOG_LOGGER_CALL(logger, spdlog::level::debug, __VA_ARGS__)
+    #define SPDLOG_DEBUG(...) SPDLOG_LOGGER_DEBUG(spdlog::default_logger_raw(), __VA_ARGS__)
+#else
+    #define SPDLOG_LOGGER_DEBUG(logger, ...) (void)0
+    #define SPDLOG_DEBUG(...) (void)0
+#endif
+
+#if SPDLOG_ACTIVE_LEVEL <= SPDLOG_LEVEL_INFO
+    #define SPDLOG_LOGGER_INFO(logger, ...) \
+        SPDLOG_LOGGER_CALL(logger, spdlog::level::info, __VA_ARGS__)
+    #define SPDLOG_INFO(...) SPDLOG_LOGGER_INFO(spdlog::default_logger_raw(), __VA_ARGS__)
+#else
+    #define SPDLOG_LOGGER_INFO(logger, ...) (void)0
+    #define SPDLOG_INFO(...) (void)0
+#endif
+
+#if SPDLOG_ACTIVE_LEVEL <= SPDLOG_LEVEL_WARN
+    #define SPDLOG_LOGGER_WARN(logger, ...) \
+        SPDLOG_LOGGER_CALL(logger, spdlog::level::warn, __VA_ARGS__)
+    #define SPDLOG_WARN(...) SPDLOG_LOGGER_WARN(spdlog::default_logger_raw(), __VA_ARGS__)
+#else
+    #define SPDLOG_LOGGER_WARN(logger, ...) (void)0
+    #define SPDLOG_WARN(...) (void)0
+#endif
+
+#if SPDLOG_ACTIVE_LEVEL <= SPDLOG_LEVEL_ERROR
+    #define SPDLOG_LOGGER_ERROR(logger, ...) \
+        SPDLOG_LOGGER_CALL(logger, spdlog::level::err, __VA_ARGS__)
+    #define SPDLOG_ERROR(...) SPDLOG_LOGGER_ERROR(spdlog::default_logger_raw(), __VA_ARGS__)
+#else
+    #define SPDLOG_LOGGER_ERROR(logger, ...) (void)0
+    #define SPDLOG_ERROR(...) (void)0
+#endif
+
+#if SPDLOG_ACTIVE_LEVEL <= SPDLOG_LEVEL_CRITICAL
+    #define SPDLOG_LOGGER_CRITICAL(logger, ...) \
+        SPDLOG_LOGGER_CALL(logger, spdlog::level::critical, __VA_ARGS__)
+    #define SPDLOG_CRITICAL(...) SPDLOG_LOGGER_CRITICAL(spdlog::default_logger_raw(), __VA_ARGS__)
+#else
+    #define SPDLOG_LOGGER_CRITICAL(logger, ...) (void)0
+    #define SPDLOG_CRITICAL(...) (void)0
+#endif
+
+#ifdef SPDLOG_HEADER_ONLY
+    #include "spdlog-inl.h"
+#endif
+
+#endif  // SPDLOG_H
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/stopwatch.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/stopwatch.h
new file mode 100644
index 0000000000..d19e591f79
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/stopwatch.h
@@ -0,0 +1,62 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#include <chrono>
+#include <spdlog/fmt/fmt.h>
+
+// Stopwatch support for spdlog  (using std::chrono::steady_clock).
+// Displays elapsed seconds since construction as double.
+//
+// Usage:
+//
+// spdlog::stopwatch sw;
+// ...
+// spdlog::debug("Elapsed: {} seconds", sw);    =>  "Elapsed 0.005116733 seconds"
+// spdlog::info("Elapsed: {:.6} seconds", sw);  =>  "Elapsed 0.005163 seconds"
+//
+//
+// If other units are needed (e.g. millis instead of double), include "fmt/chrono.h" and use
+// "duration_cast<..>(sw.elapsed())":
+//
+// #include <spdlog/fmt/chrono.h>
+//..
+// using std::chrono::duration_cast;
+// using std::chrono::milliseconds;
+// spdlog::info("Elapsed {}", duration_cast<milliseconds>(sw.elapsed())); => "Elapsed 5ms"
+
+namespace spdlog {
+class stopwatch {
+    using clock = std::chrono::steady_clock;
+    std::chrono::time_point<clock> start_tp_;
+
+public:
+    stopwatch()
+        : start_tp_{clock::now()} {}
+
+    std::chrono::duration<double> elapsed() const {
+        return std::chrono::duration<double>(clock::now() - start_tp_);
+    }
+
+    void reset() { start_tp_ = clock::now(); }
+};
+}  // namespace spdlog
+
+// Support for fmt formatting  (e.g. "{:012.9}" or just "{}")
+namespace
+#ifdef SPDLOG_USE_STD_FORMAT
+    std
+#else
+    fmt
+#endif
+{
+
+template <>
+struct formatter<spdlog::stopwatch> : formatter<double> {
+    template <typename FormatContext>
+    auto format(const spdlog::stopwatch &sw, FormatContext &ctx) const -> decltype(ctx.out()) {
+        return formatter<double>::format(sw.elapsed().count(), ctx);
+    }
+};
+}  // namespace std
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/tweakme.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/tweakme.h
new file mode 100644
index 0000000000..a47a90764a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/tweakme.h
@@ -0,0 +1,141 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+///////////////////////////////////////////////////////////////////////////////
+//
+// Edit this file to squeeze more performance, and to customize supported
+// features
+//
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Under Linux, the much faster CLOCK_REALTIME_COARSE clock can be used.
+// This clock is less accurate - can be off by dozens of millis - depending on
+// the kernel HZ.
+// Uncomment to use it instead of the regular clock.
+//
+// #define SPDLOG_CLOCK_COARSE
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment if source location logging is not needed.
+// This will prevent spdlog from using __FILE__, __LINE__ and SPDLOG_FUNCTION
+//
+// #define SPDLOG_NO_SOURCE_LOC
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment if thread id logging is not needed (i.e. no %t in the log pattern).
+// This will prevent spdlog from querying the thread id on each log call.
+//
+// WARNING: If the log pattern contains thread id (i.e, %t) while this flag is
+// on, zero will be logged as thread id.
+//
+// #define SPDLOG_NO_THREAD_ID
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to prevent spdlog from using thread local storage.
+//
+// WARNING: if your program forks, UNCOMMENT this flag to prevent undefined
+// thread ids in the children logs.
+//
+// #define SPDLOG_NO_TLS
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to avoid spdlog's usage of atomic log levels
+// Use only if your code never modifies a logger's log levels concurrently by
+// different threads.
+//
+// #define SPDLOG_NO_ATOMIC_LEVELS
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to enable usage of wchar_t for file names on Windows.
+//
+// #define SPDLOG_WCHAR_FILENAMES
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to override default eol ("\n" or "\r\n" under Linux/Windows)
+//
+// #define SPDLOG_EOL ";-)\n"
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to override default folder separators ("/" or "\\/" under
+// Linux/Windows). Each character in the string is treated as a different
+// separator.
+//
+// #define SPDLOG_FOLDER_SEPS "\\"
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to use your own copy of the fmt library instead of spdlog's copy.
+// In this case spdlog will try to include <fmt/format.h> so set your -I flag
+// accordingly.
+//
+// #define SPDLOG_FMT_EXTERNAL
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to use C++20 std::format instead of fmt.
+//
+// #define SPDLOG_USE_STD_FORMAT
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to enable wchar_t support (convert to utf8)
+//
+// #define SPDLOG_WCHAR_TO_UTF8_SUPPORT
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to prevent child processes from inheriting log file descriptors
+//
+// #define SPDLOG_PREVENT_CHILD_FD
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to customize level names (e.g. "MY TRACE")
+//
+// #define SPDLOG_LEVEL_NAMES { "MY TRACE", "MY DEBUG", "MY INFO", "MY WARNING", "MY ERROR", "MY
+// CRITICAL", "OFF" }
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to customize short level names (e.g. "MT")
+// These can be longer than one character.
+//
+// #define SPDLOG_SHORT_LEVEL_NAMES { "T", "D", "I", "W", "E", "C", "O" }
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment to disable default logger creation.
+// This might save some (very) small initialization time if no default logger is needed.
+//
+// #define SPDLOG_DISABLE_DEFAULT_LOGGER
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment and set to compile time level with zero cost (default is INFO).
+// Macros like SPDLOG_DEBUG(..), SPDLOG_INFO(..)  will expand to empty statements if not enabled
+//
+// #define SPDLOG_ACTIVE_LEVEL SPDLOG_LEVEL_INFO
+///////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////
+// Uncomment (and change if desired) macro to use for function names.
+// This is compiler dependent.
+// __PRETTY_FUNCTION__ might be nicer in clang/gcc, and __FUNCTION__ in msvc.
+// Defaults to __FUNCTION__ (should work on all compilers) if not defined.
+//
+// #ifdef __PRETTY_FUNCTION__
+// # define SPDLOG_FUNCTION __PRETTY_FUNCTION__
+// #else
+// # define SPDLOG_FUNCTION __FUNCTION__
+// #endif
+///////////////////////////////////////////////////////////////////////////////
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/version.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/version.h
new file mode 100644
index 0000000000..1ee5a9ffa2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/spdlog/spdlog/version.h
@@ -0,0 +1,11 @@
+// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.
+// Distributed under the MIT License (http://opensource.org/licenses/MIT)
+
+#pragma once
+
+#define SPDLOG_VER_MAJOR 1
+#define SPDLOG_VER_MINOR 13
+#define SPDLOG_VER_PATCH 0
+
+#define SPDLOG_TO_VERSION(major, minor, patch) (major * 10000 + minor * 100 + patch)
+#define SPDLOG_VERSION SPDLOG_TO_VERSION(SPDLOG_VER_MAJOR, SPDLOG_VER_MINOR, SPDLOG_VER_PATCH)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/taywee_args/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/taywee_args/LICENSE
new file mode 100644
index 0000000000..56f0690723
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/taywee_args/LICENSE
@@ -0,0 +1,8 @@
+Copyright (c) 2016-2017 Taylor C. Richberger <taywee@gmx.com> and Pavel Belikov
+
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/taywee_args/include/args.hxx b/graph-wasm/lbug-0.12.2/lbug-src/third_party/taywee_args/include/args.hxx
new file mode 100644
index 0000000000..ebcb0d4d7c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/taywee_args/include/args.hxx
@@ -0,0 +1,4590 @@
+/* A simple header-only C++ argument parser library.
+ *
+ * https://github.com/Taywee/args
+ *
+ * Copyright (c) 2016-2021 Taylor C. Richberger <taywee@gmx.com> and Pavel
+ * Belikov
+ * 
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to
+ * deal in the Software without restriction, including without limitation the
+ * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+ * sell copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ * 
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ * 
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+ * IN THE SOFTWARE.
+ */
+
+/** \file args.hxx
+ * \brief this single-header lets you use all of the args functionality
+ *
+ * The important stuff is done inside the args namespace
+ */
+
+#ifndef ARGS_HXX
+#define ARGS_HXX
+
+#define ARGS_VERSION "6.4.2"
+#define ARGS_VERSION_MAJOR 6
+#define ARGS_VERSION_MINOR 4
+#define ARGS_VERSION_PATCH 2
+
+#include <algorithm>
+#include <iterator>
+#include <exception>
+#include <functional>
+#include <sstream>
+#include <string>
+#include <tuple>
+#include <vector>
+#include <unordered_map>
+#include <unordered_set>
+#include <type_traits>
+#include <cstddef>
+#include <cctype>
+#include <iostream>
+
+#if defined(_MSC_VER) && _MSC_VER <= 1800
+#define noexcept
+#endif
+
+#ifdef ARGS_TESTNAMESPACE
+namespace argstest
+{
+#else
+
+/** \namespace args
+ * \brief contains all the functionality of the args library
+ */
+namespace args
+{
+#endif
+    /** Getter to grab the value from the argument type.
+     *
+     * If the Get() function of the type returns a reference, so does this, and
+     * the value will be modifiable.
+     */
+    template <typename Option>
+    auto get(Option &option_) -> decltype(option_.Get())
+    {
+        return option_.Get();
+    }
+
+    /** (INTERNAL) Count UTF-8 glyphs
+     *
+     * This is not reliable, and will fail for combinatory glyphs, but it's
+     * good enough here for now.
+     *
+     * \param string The string to count glyphs from
+     * \return The UTF-8 glyphs in the string
+     */
+    inline std::string::size_type Glyphs(const std::string &string_)
+    {
+        std::string::size_type length = 0;
+        for (const char c: string_)
+        {
+            if ((c & 0xc0) != 0x80)
+            {
+                ++length;
+            }
+        }
+        return length;
+    }
+
+    /** (INTERNAL) Wrap a vector of words into a vector of lines
+     *
+     * Empty words are skipped. Word "\n" forces wrapping.
+     *
+     * \param begin The begin iterator
+     * \param end The end iterator
+     * \param width The width of the body
+     * \param firstlinewidth the width of the first line, defaults to the width of the body
+     * \param firstlineindent the indent of the first line, defaults to 0
+     * \return the vector of lines
+     */
+    template <typename It>
+    inline std::vector<std::string> Wrap(It begin,
+                                         It end,
+                                         const std::string::size_type width,
+                                         std::string::size_type firstlinewidth = 0,
+                                         std::string::size_type firstlineindent = 0)
+    {
+        std::vector<std::string> output;
+        std::string line(firstlineindent, ' ');
+        bool empty = true;
+
+        if (firstlinewidth == 0)
+        {
+            firstlinewidth = width;
+        }
+
+        auto currentwidth = firstlinewidth;
+
+        for (auto it = begin; it != end; ++it)
+        {
+            if (it->empty())
+            {
+                continue;
+            }
+
+            if (*it == "\n")
+            {
+                if (!empty)
+                {
+                    output.push_back(line);
+                    line.clear();
+                    empty = true;
+                    currentwidth = width;
+                }
+
+                continue;
+            }
+
+            auto itemsize = Glyphs(*it);
+            if ((line.length() + 1 + itemsize) > currentwidth)
+            {
+                if (!empty)
+                {
+                    output.push_back(line);
+                    line.clear();
+                    empty = true;
+                    currentwidth = width;
+                }
+            }
+
+            if (itemsize > 0)
+            {
+                if (!empty)
+                {
+                    line += ' ';
+                }
+
+                line += *it;
+                empty = false;
+            }
+        }
+
+        if (!empty)
+        {
+            output.push_back(line);
+        }
+
+        return output;
+    }
+
+    namespace detail
+    {
+        template <typename T>
+        std::string Join(const T& array, const std::string &delimiter)
+        {
+            std::string res;
+            for (auto &element : array)
+            {
+                if (!res.empty())
+                {
+                    res += delimiter;
+                }
+
+                res += element;
+            }
+
+            return res;
+        }
+    }
+
+    /** (INTERNAL) Wrap a string into a vector of lines
+     *
+     * This is quick and hacky, but works well enough.  You can specify a
+     * different width for the first line
+     *
+     * \param width The width of the body
+     * \param firstlinewid the width of the first line, defaults to the width of the body
+     * \return the vector of lines
+     */
+    inline std::vector<std::string> Wrap(const std::string &in, const std::string::size_type width, std::string::size_type firstlinewidth = 0)
+    {
+        // Preserve existing line breaks
+        const auto newlineloc = in.find('\n');
+        if (newlineloc != in.npos)
+        {
+            auto first = Wrap(std::string(in, 0, newlineloc), width);
+            auto second = Wrap(std::string(in, newlineloc + 1), width);
+            first.insert(
+                std::end(first),
+                std::make_move_iterator(std::begin(second)),
+                std::make_move_iterator(std::end(second)));
+            return first;
+        }
+
+        std::istringstream stream(in);
+        std::string::size_type indent = 0;
+
+        for (auto c : in)
+        {
+            if (!std::isspace(static_cast<unsigned char>(c)))
+            {
+                break;
+            }
+            ++indent;
+        }
+
+        return Wrap(std::istream_iterator<std::string>(stream), std::istream_iterator<std::string>(),
+                    width, firstlinewidth, indent);
+    }
+
+#ifdef ARGS_NOEXCEPT
+    /// Error class, for when ARGS_NOEXCEPT is defined
+    enum class Error
+    {
+        None,
+        Usage,
+        Parse,
+        Validation,
+        Required,
+        Map,
+        Extra,
+        Help,
+        Subparser,
+        Completion,
+    };
+#else
+    /** Base error class
+     */
+    class Error : public std::runtime_error
+    {
+        public:
+            Error(const std::string &problem) : std::runtime_error(problem) {}
+            virtual ~Error() {}
+    };
+
+    /** Errors that occur during usage
+     */
+    class UsageError : public Error
+    {
+        public:
+            UsageError(const std::string &problem) : Error(problem) {}
+            virtual ~UsageError() {}
+    };
+
+    /** Errors that occur during regular parsing
+     */
+    class ParseError : public Error
+    {
+        public:
+            ParseError(const std::string &problem) : Error(problem) {}
+            virtual ~ParseError() {}
+    };
+
+    /** Errors that are detected from group validation after parsing finishes
+     */
+    class ValidationError : public Error
+    {
+        public:
+            ValidationError(const std::string &problem) : Error(problem) {}
+            virtual ~ValidationError() {}
+    };
+
+    /** Errors that when a required flag is omitted
+     */
+    class RequiredError : public ValidationError
+    {
+        public:
+            RequiredError(const std::string &problem) : ValidationError(problem) {}
+            virtual ~RequiredError() {}
+    };
+
+    /** Errors in map lookups
+     */
+    class MapError : public ParseError
+    {
+        public:
+            MapError(const std::string &problem) : ParseError(problem) {}
+            virtual ~MapError() {}
+    };
+
+    /** Error that occurs when a singular flag is specified multiple times
+     */
+    class ExtraError : public ParseError
+    {
+        public:
+            ExtraError(const std::string &problem) : ParseError(problem) {}
+            virtual ~ExtraError() {}
+    };
+
+    /** An exception that indicates that the user has requested help
+     */
+    class Help : public Error
+    {
+        public:
+            Help(const std::string &flag) : Error(flag) {}
+            virtual ~Help() {}
+    };
+
+    /** (INTERNAL) An exception that emulates coroutine-like control flow for subparsers.
+     */
+    class SubparserError : public Error
+    {
+        public:
+            SubparserError() : Error("") {}
+            virtual ~SubparserError() {}
+    };
+
+    /** An exception that contains autocompletion reply
+     */
+    class Completion : public Error
+    {
+        public:
+            Completion(const std::string &flag) : Error(flag) {}
+            virtual ~Completion() {}
+    };
+#endif
+
+    /** A simple unified option type for unified initializer lists for the Matcher class.
+     */
+    struct EitherFlag
+    {
+        const bool isShort;
+        const char shortFlag;
+        const std::string longFlag;
+        EitherFlag(const std::string &flag) : isShort(false), shortFlag(), longFlag(flag) {}
+        EitherFlag(const char *flag) : isShort(false), shortFlag(), longFlag(flag) {}
+        EitherFlag(const char flag) : isShort(true), shortFlag(flag), longFlag() {}
+
+        /** Get just the long flags from an initializer list of EitherFlags
+         */
+        static std::unordered_set<std::string> GetLong(std::initializer_list<EitherFlag> flags)
+        {
+            std::unordered_set<std::string>  longFlags;
+            for (const EitherFlag &flag: flags)
+            {
+                if (!flag.isShort)
+                {
+                    longFlags.insert(flag.longFlag);
+                }
+            }
+            return longFlags;
+        }
+
+        /** Get just the short flags from an initializer list of EitherFlags
+         */
+        static std::unordered_set<char> GetShort(std::initializer_list<EitherFlag> flags)
+        {
+            std::unordered_set<char>  shortFlags;
+            for (const EitherFlag &flag: flags)
+            {
+                if (flag.isShort)
+                {
+                    shortFlags.insert(flag.shortFlag);
+                }
+            }
+            return shortFlags;
+        }
+
+        std::string str() const
+        {
+            return isShort ? std::string(1, shortFlag) : longFlag;
+        }
+
+        std::string str(const std::string &shortPrefix, const std::string &longPrefix) const
+        {
+            return isShort ? shortPrefix + std::string(1, shortFlag) : longPrefix + longFlag;
+        }
+    };
+
+
+
+    /** A class of "matchers", specifying short and flags that can possibly be
+     * matched.
+     *
+     * This is supposed to be constructed and then passed in, not used directly
+     * from user code.
+     */
+    class Matcher
+    {
+        private:
+            const std::unordered_set<char> shortFlags;
+            const std::unordered_set<std::string> longFlags;
+
+        public:
+            /** Specify short and long flags separately as iterators
+             *
+             * ex: `args::Matcher(shortFlags.begin(), shortFlags.end(), longFlags.begin(), longFlags.end())`
+             */
+            template <typename ShortIt, typename LongIt>
+            Matcher(ShortIt shortFlagsStart, ShortIt shortFlagsEnd, LongIt longFlagsStart, LongIt longFlagsEnd) :
+                shortFlags(shortFlagsStart, shortFlagsEnd),
+                longFlags(longFlagsStart, longFlagsEnd)
+            {
+                if (shortFlags.empty() && longFlags.empty())
+                {
+#ifndef ARGS_NOEXCEPT
+                    throw UsageError("empty Matcher");
+#endif
+                }
+            }
+
+#ifdef ARGS_NOEXCEPT
+            /// Only for ARGS_NOEXCEPT
+            Error GetError() const noexcept
+            {
+                return shortFlags.empty() && longFlags.empty() ? Error::Usage : Error::None;
+            }
+#endif
+
+            /** Specify short and long flags separately as iterables
+             *
+             * ex: `args::Matcher(shortFlags, longFlags)`
+             */
+            template <typename Short, typename Long>
+            Matcher(Short &&shortIn, Long &&longIn) :
+                Matcher(std::begin(shortIn), std::end(shortIn), std::begin(longIn), std::end(longIn))
+            {}
+
+            /** Specify a mixed single initializer-list of both short and long flags
+             *
+             * This is the fancy one.  It takes a single initializer list of
+             * any number of any mixed kinds of flags.  Chars are
+             * automatically interpreted as short flags, and strings are
+             * automatically interpreted as long flags:
+             *
+             *     args::Matcher{'a'}
+             *     args::Matcher{"foo"}
+             *     args::Matcher{'h', "help"}
+             *     args::Matcher{"foo", 'f', 'F', "FoO"}
+             */
+            Matcher(std::initializer_list<EitherFlag> in) :
+                Matcher(EitherFlag::GetShort(in), EitherFlag::GetLong(in)) {}
+
+            Matcher(Matcher &&other) noexcept : shortFlags(std::move(other.shortFlags)), longFlags(std::move(other.longFlags))
+            {}
+
+            ~Matcher() {}
+
+            /** (INTERNAL) Check if there is a match of a short flag
+             */
+            bool Match(const char flag) const
+            {
+                return shortFlags.find(flag) != shortFlags.end();
+            }
+
+            /** (INTERNAL) Check if there is a match of a long flag
+             */
+            bool Match(const std::string &flag) const
+            {
+                return longFlags.find(flag) != longFlags.end();
+            }
+
+            /** (INTERNAL) Check if there is a match of a flag
+             */
+            bool Match(const EitherFlag &flag) const
+            {
+                return flag.isShort ? Match(flag.shortFlag) : Match(flag.longFlag);
+            }
+
+            /** (INTERNAL) Get all flag strings as a vector, with the prefixes embedded
+             */
+            std::vector<EitherFlag> GetFlagStrings() const
+            {
+                std::vector<EitherFlag> flagStrings;
+                flagStrings.reserve(shortFlags.size() + longFlags.size());
+                for (const char flag: shortFlags)
+                {
+                    flagStrings.emplace_back(flag);
+                }
+                for (const std::string &flag: longFlags)
+                {
+                    flagStrings.emplace_back(flag);
+                }
+                return flagStrings;
+            }
+
+            /** (INTERNAL) Get long flag if it exists or any short flag
+             */
+            EitherFlag GetLongOrAny() const
+            {
+                if (!longFlags.empty())
+                {
+                    return *longFlags.begin();
+                }
+
+                if (!shortFlags.empty())
+                {
+                    return *shortFlags.begin();
+                }
+
+                // should be unreachable
+                return ' ';
+            }
+
+            /** (INTERNAL) Get short flag if it exists or any long flag
+             */
+            EitherFlag GetShortOrAny() const
+            {
+                if (!shortFlags.empty())
+                {
+                    return *shortFlags.begin();
+                }
+
+                if (!longFlags.empty())
+                {
+                    return *longFlags.begin();
+                }
+
+                // should be unreachable
+                return ' ';
+            }
+    };
+
+    /** Attributes for flags.
+     */
+    enum class Options
+    {
+        /** Default options.
+         */
+        None = 0x0,
+
+        /** Flag can't be passed multiple times.
+         */
+        Single = 0x01,
+
+        /** Flag can't be omitted.
+         */
+        Required = 0x02,
+
+        /** Flag is excluded from usage line.
+         */
+        HiddenFromUsage = 0x04,
+
+        /** Flag is excluded from options help.
+         */
+        HiddenFromDescription = 0x08,
+
+        /** Flag is global and can be used in any subcommand.
+         */
+        Global = 0x10,
+
+        /** Flag stops a parser.
+         */
+        KickOut = 0x20,
+
+        /** Flag is excluded from auto completion.
+         */
+        HiddenFromCompletion = 0x40,
+
+        /** Flag is excluded from options help and usage line
+         */
+        Hidden = HiddenFromUsage | HiddenFromDescription | HiddenFromCompletion,
+    };
+
+    inline Options operator | (Options lhs, Options rhs)
+    {
+        return static_cast<Options>(static_cast<int>(lhs) | static_cast<int>(rhs));
+    }
+
+    inline Options operator & (Options lhs, Options rhs)
+    {
+        return static_cast<Options>(static_cast<int>(lhs) & static_cast<int>(rhs));
+    }
+
+    class FlagBase;
+    class PositionalBase;
+    class Command;
+    class ArgumentParser;
+
+    /** A simple structure of parameters for easy user-modifyable help menus
+     */
+    struct HelpParams
+    {
+        /** The width of the help menu
+         */
+        unsigned int width = 80;
+        /** The indent of the program line
+         */
+        unsigned int progindent = 2;
+        /** The indent of the program trailing lines for long parameters
+         */
+        unsigned int progtailindent = 4;
+        /** The indent of the description and epilogs
+         */
+        unsigned int descriptionindent = 4;
+        /** The indent of the flags
+         */
+        unsigned int flagindent = 6;
+        /** The indent of the flag descriptions
+         */
+        unsigned int helpindent = 40;
+        /** The additional indent each group adds
+         */
+        unsigned int eachgroupindent = 2;
+
+        /** The minimum gutter between each flag and its help
+         */
+        unsigned int gutter = 1;
+
+        /** Show the terminator when both options and positional parameters are present
+         */
+        bool showTerminator = true;
+
+        /** Show the {OPTIONS} on the prog line when this is true
+         */
+        bool showProglineOptions = true;
+
+        /** Show the positionals on the prog line when this is true
+         */
+        bool showProglinePositionals = true;
+
+        /** The prefix for short flags
+         */
+        std::string shortPrefix;
+
+        /** The prefix for long flags
+         */
+        std::string longPrefix;
+
+        /** The separator for short flags
+         */
+        std::string shortSeparator;
+
+        /** The separator for long flags
+         */
+        std::string longSeparator;
+
+        /** The program name for help generation
+         */
+        std::string programName;
+
+        /** Show command's flags
+         */
+        bool showCommandChildren = false;
+
+        /** Show command's descriptions and epilog
+         */
+        bool showCommandFullHelp = false;
+
+        /** The postfix for progline when showProglineOptions is true and command has any flags
+         */
+        std::string proglineOptions = "{OPTIONS}";
+
+        /** The prefix for progline when command has any subcommands
+         */
+        std::string proglineCommand = "COMMAND";
+
+        /** The prefix for progline value
+         */
+        std::string proglineValueOpen = " <";
+
+        /** The postfix for progline value
+         */
+        std::string proglineValueClose = ">";
+
+        /** The prefix for progline required argument
+         */
+        std::string proglineRequiredOpen = "";
+
+        /** The postfix for progline required argument
+         */
+        std::string proglineRequiredClose = "";
+
+        /** The prefix for progline non-required argument
+         */
+        std::string proglineNonrequiredOpen = "[";
+
+        /** The postfix for progline non-required argument
+         */
+        std::string proglineNonrequiredClose = "]";
+
+        /** Show flags in program line
+         */
+        bool proglineShowFlags = false;
+
+        /** Use short flags in program lines when possible
+         */
+        bool proglinePreferShortFlags = false;
+
+        /** Program line prefix
+         */
+        std::string usageString;
+
+        /** String shown in help before flags descriptions
+         */
+        std::string optionsString = "OPTIONS:";
+
+        /** Display value name after all the long and short flags
+         */
+        bool useValueNameOnce = false;
+
+        /** Show value name
+         */
+        bool showValueName = true;
+
+        /** Add newline before flag description
+         */
+        bool addNewlineBeforeDescription = false;
+
+        /** The prefix for option value
+         */
+        std::string valueOpen = "[";
+
+        /** The postfix for option value
+         */
+        std::string valueClose = "]";
+
+        /** Add choices to argument description
+         */
+        bool addChoices = false;
+
+        /** The prefix for choices
+         */
+        std::string choiceString = "\nOne of: ";
+
+        /** Add default values to argument description
+         */
+        bool addDefault = false;
+
+        /** The prefix for default values
+         */
+        std::string defaultString = "\nDefault: ";
+    };
+
+    /** A number of arguments which can be consumed by an option.
+     *
+     * Represents a closed interval [min, max].
+     */
+    struct Nargs
+    {
+        const size_t min;
+        const size_t max;
+
+        Nargs(size_t min_, size_t max_) : min{min_}, max{max_}
+        {
+#ifndef ARGS_NOEXCEPT
+            if (max < min)
+            {
+                throw UsageError("Nargs: max > min");
+            }
+#endif
+        }
+
+        Nargs(size_t num_) : min{num_}, max{num_}
+        {
+        }
+
+        friend bool operator == (const Nargs &lhs, const Nargs &rhs)
+        {
+            return lhs.min == rhs.min && lhs.max == rhs.max;
+        }
+
+        friend bool operator != (const Nargs &lhs, const Nargs &rhs)
+        {
+            return !(lhs == rhs);
+        }
+    };
+
+    /** Base class for all match types
+     */
+    class Base
+    {
+        private:
+            Options options = {};
+
+        protected:
+            bool matched = false;
+            const std::string help;
+#ifdef ARGS_NOEXCEPT
+            /// Only for ARGS_NOEXCEPT
+            mutable Error error = Error::None;
+            mutable std::string errorMsg;
+#endif
+
+        public:
+            Base(const std::string &help_, Options options_ = {}) : options(options_), help(help_) {}
+            virtual ~Base() {}
+
+            Options GetOptions() const noexcept
+            {
+                return options;
+            }
+
+            bool IsRequired() const noexcept
+            {
+                return (GetOptions() & Options::Required) != Options::None;
+            }
+
+            virtual bool Matched() const noexcept
+            {
+                return matched;
+            }
+
+            virtual void Validate(const std::string &, const std::string &) const
+            {
+            }
+
+            operator bool() const noexcept
+            {
+                return Matched();
+            }
+
+            virtual std::vector<std::tuple<std::string, std::string, unsigned>> GetDescription(const HelpParams &, const unsigned indentLevel) const
+            {
+                std::tuple<std::string, std::string, unsigned> description;
+                std::get<1>(description) = help;
+                std::get<2>(description) = indentLevel;
+                return { std::move(description) };
+            }
+
+            virtual std::vector<Command*> GetCommands()
+            {
+                return {};
+            }
+
+            virtual bool IsGroup() const
+            {
+                return false;
+            }
+
+            virtual FlagBase *Match(const EitherFlag &)
+            {
+                return nullptr;
+            }
+
+            virtual PositionalBase *GetNextPositional()
+            {
+                return nullptr;
+            }
+
+            virtual std::vector<FlagBase*> GetAllFlags()
+            {
+                return {};
+            }
+
+            virtual bool HasFlag() const
+            {
+                return false;
+            }
+
+            virtual bool HasPositional() const
+            {
+                return false;
+            }
+
+            virtual bool HasCommand() const
+            {
+                return false;
+            }
+
+            virtual std::vector<std::string> GetProgramLine(const HelpParams &) const
+            {
+                return {};
+            }
+
+            /// Sets a kick-out value for building subparsers
+            void KickOut(bool kickout_) noexcept
+            {
+                if (kickout_)
+                {
+                    options = options | Options::KickOut;
+                }
+                else
+                {
+                    options = static_cast<Options>(static_cast<int>(options) & ~static_cast<int>(Options::KickOut));
+                }
+            }
+
+            /// Gets the kick-out value for building subparsers
+            bool KickOut() const noexcept
+            {
+                return (options & Options::KickOut) != Options::None;
+            }
+
+            virtual void Reset() noexcept
+            {
+                matched = false;
+#ifdef ARGS_NOEXCEPT
+                error = Error::None;
+                errorMsg.clear();
+#endif
+            }
+
+#ifdef ARGS_NOEXCEPT
+            /// Only for ARGS_NOEXCEPT
+            virtual Error GetError() const
+            {
+                return error;
+            }
+
+            /// Only for ARGS_NOEXCEPT
+            virtual std::string GetErrorMsg() const
+            {
+                return errorMsg;
+            }
+#endif
+    };
+
+    /** Base class for all match types that have a name
+     */
+    class NamedBase : public Base
+    {
+        protected:
+            const std::string name;
+            bool kickout = false;
+            std::string defaultString;
+            bool defaultStringManual = false;
+            std::vector<std::string> choicesStrings;
+            bool choicesStringManual = false;
+
+            virtual std::string GetDefaultString(const HelpParams&) const { return {}; }
+
+            virtual std::vector<std::string> GetChoicesStrings(const HelpParams&) const { return {}; }
+
+            virtual std::string GetNameString(const HelpParams&) const { return Name(); }
+
+            void AddDescriptionPostfix(std::string &dest, const bool isManual, const std::string &manual, bool isGenerated, const std::string &generated, const std::string &str) const
+            {
+                if (isManual && !manual.empty())
+                {
+                    dest += str;
+                    dest += manual;
+                }
+                else if (!isManual && isGenerated && !generated.empty())
+                {
+                    dest += str;
+                    dest += generated;
+                }
+            }
+
+        public:
+            NamedBase(const std::string &name_, const std::string &help_, Options options_ = {}) : Base(help_, options_), name(name_) {}
+            virtual ~NamedBase() {}
+
+            /** Sets default value string that will be added to argument description.
+             *  Use empty string to disable it for this argument.
+             */
+            void HelpDefault(const std::string &str)
+            {
+                defaultStringManual = true;
+                defaultString = str;
+            }
+
+            /** Gets default value string that will be added to argument description.
+             */
+            std::string HelpDefault(const HelpParams &params) const
+            {
+                return defaultStringManual ? defaultString : GetDefaultString(params);
+            }
+
+            /** Sets choices strings that will be added to argument description.
+             *  Use empty vector to disable it for this argument.
+             */
+            void HelpChoices(const std::vector<std::string> &array)
+            {
+                choicesStringManual = true;
+                choicesStrings = array;
+            }
+
+            /** Gets choices strings that will be added to argument description.
+             */
+            std::vector<std::string> HelpChoices(const HelpParams &params) const
+            {
+                return choicesStringManual ? choicesStrings : GetChoicesStrings(params);
+            }
+
+            virtual std::vector<std::tuple<std::string, std::string, unsigned>> GetDescription(const HelpParams &params, const unsigned indentLevel) const override
+            {
+                std::tuple<std::string, std::string, unsigned> description;
+                std::get<0>(description) = GetNameString(params);
+                std::get<1>(description) = help;
+                std::get<2>(description) = indentLevel;
+
+                AddDescriptionPostfix(std::get<1>(description), choicesStringManual, detail::Join(choicesStrings, ", "), params.addChoices, detail::Join(GetChoicesStrings(params), ", "), params.choiceString);
+                AddDescriptionPostfix(std::get<1>(description), defaultStringManual, defaultString, params.addDefault, GetDefaultString(params), params.defaultString);
+
+                return { std::move(description) };
+            }
+
+            virtual std::string Name() const
+            {
+                return name;
+            }
+    };
+
+    namespace detail
+    {
+        template<typename T>
+        using vector = std::vector<T, std::allocator<T>>;
+        
+        template<typename K, typename T>
+        using unordered_map = std::unordered_map<K, T, std::hash<K>, 
+            std::equal_to<K>, std::allocator<std::pair<const K, T> > >;
+
+        template<typename S, typename T>
+        class is_streamable
+        {
+            template<typename SS, typename TT>
+            static auto test(int)
+            -> decltype( std::declval<SS&>() << std::declval<TT>(), std::true_type() );
+
+            template<typename, typename>
+            static auto test(...) -> std::false_type;
+
+        public:
+            using type = decltype(test<S,T>(0));
+        };
+
+        template <typename T>
+        using IsConvertableToString = typename is_streamable<std::ostringstream, T>::type;
+
+        template <typename T>
+        typename std::enable_if<IsConvertableToString<T>::value, std::string>::type
+        ToString(const T &value)
+        {
+            std::ostringstream s;
+            s << value;
+            return s.str();
+        }
+
+        template <typename T>
+        typename std::enable_if<!IsConvertableToString<T>::value, std::string>::type
+        ToString(const T &)
+        {
+            return {};
+        }
+
+        template <typename T>
+        std::vector<std::string> MapKeysToStrings(const T &map)
+        {
+            std::vector<std::string> res;
+            using K = typename std::decay<decltype(std::begin(map)->first)>::type;
+            if (IsConvertableToString<K>::value)
+            {
+                for (const auto &p : map)
+                {
+                    res.push_back(detail::ToString(p.first));
+                }
+
+                std::sort(res.begin(), res.end());
+            }
+            return res;
+        }
+    }
+
+    /** Base class for all flag options
+     */
+    class FlagBase : public NamedBase
+    {
+        protected:
+            const Matcher matcher;
+
+            virtual std::string GetNameString(const HelpParams &params) const override
+            {
+                const std::string postfix = !params.showValueName || NumberOfArguments() == 0 ? std::string() : Name();
+                std::string flags;
+                const auto flagStrings = matcher.GetFlagStrings();
+                const bool useValueNameOnce = flagStrings.size() == 1 ? false : params.useValueNameOnce;
+                for (auto it = flagStrings.begin(); it != flagStrings.end(); ++it)
+                {
+                    auto &flag = *it;
+                    if (it != flagStrings.begin())
+                    {
+                        flags += ", ";
+                    }
+
+                    flags += flag.isShort ? params.shortPrefix : params.longPrefix;
+                    flags += flag.str();
+
+                    if (!postfix.empty() && (!useValueNameOnce || it + 1 == flagStrings.end()))
+                    {
+                        flags += flag.isShort ? params.shortSeparator : params.longSeparator;
+                        flags += params.valueOpen + postfix + params.valueClose;
+                    }
+                }
+
+                return flags;
+            }
+
+        public:
+            FlagBase(const std::string &name_, const std::string &help_, Matcher &&matcher_, const bool extraError_ = false) : NamedBase(name_, help_, extraError_ ? Options::Single : Options()), matcher(std::move(matcher_)) {}
+
+            FlagBase(const std::string &name_, const std::string &help_, Matcher &&matcher_, Options options_) : NamedBase(name_, help_, options_), matcher(std::move(matcher_)) {}
+
+            virtual ~FlagBase() {}
+
+            virtual FlagBase *Match(const EitherFlag &flag) override
+            {
+                if (matcher.Match(flag))
+                {
+                    if ((GetOptions() & Options::Single) != Options::None && matched)
+                    {
+                        std::ostringstream problem;
+                        problem << "Flag '" << flag.str() << "' was passed multiple times, but is only allowed to be passed once";
+#ifdef ARGS_NOEXCEPT
+                        error = Error::Extra;
+                        errorMsg = problem.str();
+#else
+                        throw ExtraError(problem.str());
+#endif
+                    }
+                    matched = true;
+                    return this;
+                }
+                return nullptr;
+            }
+
+            virtual std::vector<FlagBase*> GetAllFlags() override
+            {
+                return { this };
+            }
+
+            const Matcher &GetMatcher() const
+            {
+                return matcher;
+            }
+
+            virtual void Validate(const std::string &shortPrefix, const std::string &longPrefix) const override
+            {
+                if (!Matched() && IsRequired())
+                {
+                        std::ostringstream problem;
+                        problem << "Flag '" << matcher.GetLongOrAny().str(shortPrefix, longPrefix) << "' is required";
+#ifdef ARGS_NOEXCEPT
+                        error = Error::Required;
+                        errorMsg = problem.str();
+#else
+                        throw RequiredError(problem.str());
+#endif
+                }
+            }
+
+            virtual std::vector<std::string> GetProgramLine(const HelpParams &params) const override
+            {
+                if (!params.proglineShowFlags)
+                {
+                    return {};
+                }
+
+                const std::string postfix = NumberOfArguments() == 0 ? std::string() : Name();
+                const EitherFlag flag = params.proglinePreferShortFlags ? matcher.GetShortOrAny() : matcher.GetLongOrAny();
+                std::string res = flag.str(params.shortPrefix, params.longPrefix);
+                if (!postfix.empty())
+                {
+                    res += params.proglineValueOpen + postfix + params.proglineValueClose;
+                }
+
+                return { IsRequired() ? params.proglineRequiredOpen + res + params.proglineRequiredClose
+                                      : params.proglineNonrequiredOpen + res + params.proglineNonrequiredClose };
+            }
+
+            virtual bool HasFlag() const override
+            {
+                return true;
+            }
+
+#ifdef ARGS_NOEXCEPT
+            /// Only for ARGS_NOEXCEPT
+            virtual Error GetError() const override
+            {
+                const auto nargs = NumberOfArguments();
+                if (nargs.min > nargs.max)
+                {
+                    return Error::Usage;
+                }
+
+                const auto matcherError = matcher.GetError();
+                if (matcherError != Error::None)
+                {
+                    return matcherError;
+                }
+
+                return error;
+            }
+#endif
+
+            /** Defines how many values can be consumed by this option.
+             *
+             * \return closed interval [min, max]
+             */
+            virtual Nargs NumberOfArguments() const noexcept = 0;
+
+            /** Parse values of this option.
+             *
+             * \param value Vector of values. It's size must be in NumberOfArguments() interval.
+             */
+            virtual void ParseValue(const std::vector<std::string> &value) = 0;
+    };
+
+    /** Base class for value-accepting flag options
+     */
+    class ValueFlagBase : public FlagBase
+    {
+        public:
+            ValueFlagBase(const std::string &name_, const std::string &help_, Matcher &&matcher_, const bool extraError_ = false) : FlagBase(name_, help_, std::move(matcher_), extraError_) {}
+            ValueFlagBase(const std::string &name_, const std::string &help_, Matcher &&matcher_, Options options_) : FlagBase(name_, help_, std::move(matcher_), options_) {}
+            virtual ~ValueFlagBase() {}
+
+            virtual Nargs NumberOfArguments() const noexcept override
+            {
+                return 1;
+            }
+    };
+
+    class CompletionFlag : public ValueFlagBase
+    {
+        public:
+            std::vector<std::string> reply;
+            size_t cword = 0;
+            std::string syntax;
+
+            template <typename GroupClass>
+            CompletionFlag(GroupClass &group_, Matcher &&matcher_): ValueFlagBase("completion", "completion flag", std::move(matcher_), Options::Hidden)
+            {
+                group_.AddCompletion(*this);
+            }
+
+            virtual ~CompletionFlag() {}
+
+            virtual Nargs NumberOfArguments() const noexcept override
+            {
+                return 2;
+            }
+
+            virtual void ParseValue(const std::vector<std::string> &value_) override
+            {
+                syntax = value_.at(0);
+                std::istringstream(value_.at(1)) >> cword;
+            }
+
+            /** Get the completion reply
+             */
+            std::string Get() noexcept
+            {
+                return detail::Join(reply, "\n");
+            }
+
+            virtual void Reset() noexcept override
+            {
+                ValueFlagBase::Reset();
+                cword = 0;
+                syntax.clear();
+                reply.clear();
+            }
+    };
+
+
+    /** Base class for positional options
+     */
+    class PositionalBase : public NamedBase
+    {
+        protected:
+            bool ready;
+
+        public:
+            PositionalBase(const std::string &name_, const std::string &help_, Options options_ = {}) : NamedBase(name_, help_, options_), ready(true) {}
+            virtual ~PositionalBase() {}
+
+            bool Ready()
+            {
+                return ready;
+            }
+
+            virtual void ParseValue(const std::string &value_) = 0;
+
+            virtual void Reset() noexcept override
+            {
+                matched = false;
+                ready = true;
+#ifdef ARGS_NOEXCEPT
+                error = Error::None;
+                errorMsg.clear();
+#endif
+            }
+
+            virtual PositionalBase *GetNextPositional() override
+            {
+                return Ready() ? this : nullptr;
+            }
+
+            virtual bool HasPositional() const override
+            {
+                return true;
+            }
+
+            virtual std::vector<std::string> GetProgramLine(const HelpParams &params) const override
+            {
+                return { IsRequired() ? params.proglineRequiredOpen + Name() + params.proglineRequiredClose
+                                      : params.proglineNonrequiredOpen + Name() + params.proglineNonrequiredClose };
+            }
+
+            virtual void Validate(const std::string &, const std::string &) const override
+            {
+                if (IsRequired() && !Matched())
+                {
+                    std::ostringstream problem;
+                    problem << "Option '" << Name() << "' is required";
+#ifdef ARGS_NOEXCEPT
+                    error = Error::Required;
+                    errorMsg = problem.str();
+#else
+                    throw RequiredError(problem.str());
+#endif
+                }
+            }
+    };
+
+    /** Class for all kinds of validating groups, including ArgumentParser
+     */
+    class Group : public Base
+    {
+        private:
+            std::vector<Base*> children;
+            std::function<bool(const Group &)> validator;
+
+        public:
+            /** Default validators
+             */
+            struct Validators
+            {
+                static bool Xor(const Group &group)
+                {
+                    return group.MatchedChildren() == 1;
+                }
+
+                static bool AtLeastOne(const Group &group)
+                {
+                    return group.MatchedChildren() >= 1;
+                }
+
+                static bool AtMostOne(const Group &group)
+                {
+                    return group.MatchedChildren() <= 1;
+                }
+
+                static bool All(const Group &group)
+                {
+                    return group.Children().size() == group.MatchedChildren();
+                }
+
+                static bool AllOrNone(const Group &group)
+                {
+                    return (All(group) || None(group));
+                }
+
+                static bool AllChildGroups(const Group &group)
+                {
+                    return std::none_of(std::begin(group.Children()), std::end(group.Children()), [](const Base* child) -> bool {
+                            return child->IsGroup() && !child->Matched();
+                            });
+                }
+
+                static bool DontCare(const Group &)
+                {
+                    return true;
+                }
+
+                static bool CareTooMuch(const Group &)
+                {
+                    return false;
+                }
+
+                static bool None(const Group &group)
+                {
+                    return group.MatchedChildren() == 0;
+                }
+            };
+            /// If help is empty, this group will not be printed in help output
+            Group(const std::string &help_ = std::string(), const std::function<bool(const Group &)> &validator_ = Validators::DontCare, Options options_ = {}) : Base(help_, options_), validator(validator_) {}
+            /// If help is empty, this group will not be printed in help output
+            Group(Group &group_, const std::string &help_ = std::string(), const std::function<bool(const Group &)> &validator_ = Validators::DontCare, Options options_ = {}) : Base(help_, options_), validator(validator_)
+            {
+                group_.Add(*this);
+            }
+            virtual ~Group() {}
+
+            /** Append a child to this Group.
+             */
+            void Add(Base &child)
+            {
+                children.emplace_back(&child);
+            }
+
+            /** Get all this group's children
+             */
+            const std::vector<Base *> &Children() const
+            {
+                return children;
+            }
+
+            /** Return the first FlagBase that matches flag, or nullptr
+             *
+             * \param flag The flag with prefixes stripped
+             * \return the first matching FlagBase pointer, or nullptr if there is no match
+             */
+            virtual FlagBase *Match(const EitherFlag &flag) override
+            {
+                for (Base *child: Children())
+                {
+                    if (FlagBase *match = child->Match(flag))
+                    {
+                        return match;
+                    }
+                }
+                return nullptr;
+            }
+
+            virtual std::vector<FlagBase*> GetAllFlags() override
+            {
+                std::vector<FlagBase*> res;
+                for (Base *child: Children())
+                {
+                    auto childRes = child->GetAllFlags();
+                    res.insert(res.end(), childRes.begin(), childRes.end());
+                }
+                return res;
+            }
+
+            virtual void Validate(const std::string &shortPrefix, const std::string &longPrefix) const override
+            {
+                for (Base *child: Children())
+                {
+                    child->Validate(shortPrefix, longPrefix);
+                }
+            }
+
+            /** Get the next ready positional, or nullptr if there is none
+             *
+             * \return the first ready PositionalBase pointer, or nullptr if there is no match
+             */
+            virtual PositionalBase *GetNextPositional() override
+            {
+                for (Base *child: Children())
+                {
+                    if (auto next = child->GetNextPositional())
+                    {
+                        return next;
+                    }
+                }
+                return nullptr;
+            }
+
+            /** Get whether this has any FlagBase children
+             *
+             * \return Whether or not there are any FlagBase children
+             */
+            virtual bool HasFlag() const override
+            {
+                return std::any_of(Children().begin(), Children().end(), [](Base *child) { return child->HasFlag(); });
+            }
+
+            /** Get whether this has any PositionalBase children
+             *
+             * \return Whether or not there are any PositionalBase children
+             */
+            virtual bool HasPositional() const override
+            {
+                return std::any_of(Children().begin(), Children().end(), [](Base *child) { return child->HasPositional(); });
+            }
+
+            /** Get whether this has any Command children
+             *
+             * \return Whether or not there are any Command children
+             */
+            virtual bool HasCommand() const override
+            {
+                return std::any_of(Children().begin(), Children().end(), [](Base *child) { return child->HasCommand(); });
+            }
+
+            /** Count the number of matched children this group has
+             */
+            std::vector<Base *>::size_type MatchedChildren() const
+            {
+                // Cast to avoid warnings from -Wsign-conversion
+                return static_cast<std::vector<Base *>::size_type>(
+                        std::count_if(std::begin(Children()), std::end(Children()), [](const Base *child){return child->Matched();}));
+            }
+
+            /** Whether or not this group matches validation
+             */
+            virtual bool Matched() const noexcept override
+            {
+                return validator(*this);
+            }
+
+            /** Get validation
+             */
+            bool Get() const
+            {
+                return Matched();
+            }
+
+            /** Get all the child descriptions for help generation
+             */
+            virtual std::vector<std::tuple<std::string, std::string, unsigned>> GetDescription(const HelpParams &params, const unsigned int indent) const override
+            {
+                std::vector<std::tuple<std::string, std::string, unsigned int>> descriptions;
+
+                // Push that group description on the back if not empty
+                unsigned addindent = 0;
+                if (!help.empty())
+                {
+                    descriptions.emplace_back(help, "", indent);
+                    addindent = 1;
+                }
+
+                for (Base *child: Children())
+                {
+                    if ((child->GetOptions() & Options::HiddenFromDescription) != Options::None)
+                    {
+                        continue;
+                    }
+
+                    auto groupDescriptions = child->GetDescription(params, indent + addindent);
+                    descriptions.insert(
+                        std::end(descriptions),
+                        std::make_move_iterator(std::begin(groupDescriptions)),
+                        std::make_move_iterator(std::end(groupDescriptions)));
+                }
+                return descriptions;
+            }
+
+            /** Get the names of positional parameters
+             */
+            virtual std::vector<std::string> GetProgramLine(const HelpParams &params) const override
+            {
+                std::vector <std::string> names;
+                for (Base *child: Children())
+                {
+                    if ((child->GetOptions() & Options::HiddenFromUsage) != Options::None)
+                    {
+                        continue;
+                    }
+
+                    auto groupNames = child->GetProgramLine(params);
+                    names.insert(
+                        std::end(names),
+                        std::make_move_iterator(std::begin(groupNames)),
+                        std::make_move_iterator(std::end(groupNames)));
+                }
+                return names;
+            }
+
+            virtual std::vector<Command*> GetCommands() override
+            {
+                std::vector<Command*> res;
+                for (const auto &child : Children())
+                {
+                    auto subparsers = child->GetCommands();
+                    res.insert(std::end(res), std::begin(subparsers), std::end(subparsers));
+                }
+                return res;
+            }
+
+            virtual bool IsGroup() const override
+            {
+                return true;
+            }
+
+            virtual void Reset() noexcept override
+            {
+                Base::Reset();
+
+                for (auto &child: Children())
+                {
+                    child->Reset();
+                }
+#ifdef ARGS_NOEXCEPT
+                error = Error::None;
+                errorMsg.clear();
+#endif
+            }
+
+#ifdef ARGS_NOEXCEPT
+            /// Only for ARGS_NOEXCEPT
+            virtual Error GetError() const override
+            {
+                if (error != Error::None)
+                {
+                    return error;
+                }
+
+                auto it = std::find_if(Children().begin(), Children().end(), [](const Base *child){return child->GetError() != Error::None;});
+                if (it == Children().end())
+                {
+                    return Error::None;
+                } else
+                {
+                    return (*it)->GetError();
+                }
+            }
+
+            /// Only for ARGS_NOEXCEPT
+            virtual std::string GetErrorMsg() const override
+            {
+                if (error != Error::None)
+                {
+                    return errorMsg;
+                }
+
+                auto it = std::find_if(Children().begin(), Children().end(), [](const Base *child){return child->GetError() != Error::None;});
+                if (it == Children().end())
+                {
+                    return "";
+                } else
+                {
+                    return (*it)->GetErrorMsg();
+                }
+            }
+#endif
+
+    };
+
+    /** Class for using global options in ArgumentParser.
+     */
+    class GlobalOptions : public Group
+    {
+        public:
+            GlobalOptions(Group &base, Base &options_) : Group(base, {}, Group::Validators::DontCare, Options::Global)
+            {
+                Add(options_);
+            }
+    };
+
+    /** Utility class for building subparsers with coroutines/callbacks.
+     *
+     * Brief example:
+     * \code
+     * Command command(argumentParser, "command", "my command", [](args::Subparser &s)
+     * {
+     *      // your command flags/positionals
+     *      s.Parse(); //required
+     *      //your command code
+     * });
+     * \endcode
+     *
+     * For ARGS_NOEXCEPT mode don't forget to check `s.GetError()` after `s.Parse()`
+     * and return if it isn't equals to args::Error::None.
+     *
+     * \sa Command
+     */
+    class Subparser : public Group
+    {
+        private:
+            std::vector<std::string> args;
+            std::vector<std::string> kicked;
+            ArgumentParser *parser = nullptr;
+            const HelpParams &helpParams;
+            const Command &command;
+            bool isParsed = false;
+
+        public:
+            Subparser(std::vector<std::string> args_, ArgumentParser &parser_, const Command &command_, const HelpParams &helpParams_)
+                : Group({}, Validators::AllChildGroups), args(std::move(args_)), parser(&parser_), helpParams(helpParams_), command(command_)
+            {
+            }
+
+            Subparser(const Command &command_, const HelpParams &helpParams_) : Group({}, Validators::AllChildGroups), helpParams(helpParams_), command(command_)
+            {
+            }
+
+            Subparser(const Subparser&) = delete;
+            Subparser(Subparser&&) = delete;
+            Subparser &operator = (const Subparser&) = delete;
+            Subparser &operator = (Subparser&&) = delete;
+
+            const Command &GetCommand()
+            {
+                return command;
+            }
+
+            /** (INTERNAL) Determines whether Parse was called or not.
+             */
+            bool IsParsed() const
+            {
+                return isParsed;
+            }
+
+            /** Continue parsing arguments for new command.
+             */
+            void Parse();
+
+            /** Returns a vector of kicked out arguments.
+             *
+             * \sa Base::KickOut
+             */
+            const std::vector<std::string> &KickedOut() const noexcept
+            {
+                return kicked;
+            }
+    };
+
+    /** Main class for building subparsers.
+     *
+     * /sa Subparser
+     */
+    class Command : public Group
+    {
+        private:
+            friend class Subparser;
+
+            std::string name;
+            std::string help;
+            std::string description;
+            std::string epilog;
+            std::string proglinePostfix;
+
+            std::function<void(Subparser&)> parserCoroutine;
+            bool commandIsRequired = true;
+            Command *selectedCommand = nullptr;
+
+            mutable std::vector<std::tuple<std::string, std::string, unsigned>> subparserDescription;
+            mutable std::vector<std::string> subparserProgramLine;
+            mutable bool subparserHasFlag = false;
+            mutable bool subparserHasPositional = false;
+            mutable bool subparserHasCommand = false;
+#ifdef ARGS_NOEXCEPT
+            mutable Error subparserError = Error::None;
+#endif
+            mutable Subparser *subparser = nullptr;
+
+        protected:
+
+            class RaiiSubparser
+            {
+                public:
+                    RaiiSubparser(ArgumentParser &parser_, std::vector<std::string> args_);
+                    RaiiSubparser(const Command &command_, const HelpParams &params_);
+
+                    ~RaiiSubparser()
+                    {
+                        command.subparser = oldSubparser;
+                    }
+
+                    Subparser &Parser()
+                    {
+                        return parser;
+                    }
+
+                private:
+                    const Command &command;
+                    Subparser parser;
+                    Subparser *oldSubparser;
+            };
+
+            Command() = default;
+
+            std::function<void(Subparser&)> &GetCoroutine()
+            {
+                return selectedCommand != nullptr ? selectedCommand->GetCoroutine() : parserCoroutine;
+            }
+
+            Command &SelectedCommand()
+            {
+                Command *res = this;
+                while (res->selectedCommand != nullptr)
+                {
+                    res = res->selectedCommand;
+                }
+
+                return *res;
+            }
+
+            const Command &SelectedCommand() const
+            {
+                const Command *res = this;
+                while (res->selectedCommand != nullptr)
+                {
+                    res = res->selectedCommand;
+                }
+
+                return *res;
+            }
+
+            void UpdateSubparserHelp(const HelpParams &params) const
+            {
+                if (parserCoroutine)
+                {
+                    RaiiSubparser coro(*this, params);
+#ifndef ARGS_NOEXCEPT
+                    try
+                    {
+                        parserCoroutine(coro.Parser());
+                    }
+                    catch (args::SubparserError&)
+                    {
+                    }
+#else
+                    parserCoroutine(coro.Parser());
+#endif
+                }
+            }
+
+        public:
+            Command(Group &base_, std::string name_, std::string help_, std::function<void(Subparser&)> coroutine_ = {})
+                : name(std::move(name_)), help(std::move(help_)), parserCoroutine(std::move(coroutine_))
+            {
+                base_.Add(*this);
+            }
+
+            /** The description that appears on the prog line after options
+             */
+            const std::string &ProglinePostfix() const
+            { return proglinePostfix; }
+
+            /** The description that appears on the prog line after options
+             */
+            void ProglinePostfix(const std::string &proglinePostfix_)
+            { this->proglinePostfix = proglinePostfix_; }
+
+            /** The description that appears above options
+             */
+            const std::string &Description() const
+            { return description; }
+            /** The description that appears above options
+             */
+
+            void Description(const std::string &description_)
+            { this->description = description_; }
+
+            /** The description that appears below options
+             */
+            const std::string &Epilog() const
+            { return epilog; }
+
+            /** The description that appears below options
+             */
+            void Epilog(const std::string &epilog_)
+            { this->epilog = epilog_; }
+
+            /** The name of command
+             */
+            const std::string &Name() const
+            { return name; }
+
+            /** The description of command
+             */
+            const std::string &Help() const
+            { return help; }
+
+            /** If value is true, parser will fail if no command was parsed.
+             *
+             * Default: true.
+             */
+            void RequireCommand(bool value)
+            { commandIsRequired = value; }
+
+            virtual bool IsGroup() const override
+            { return false; }
+
+            virtual bool Matched() const noexcept override
+            { return Base::Matched(); }
+
+            operator bool() const noexcept
+            { return Matched(); }
+
+            void Match() noexcept
+            { matched = true; }
+
+            void SelectCommand(Command *c) noexcept
+            {
+                selectedCommand = c;
+
+                if (c != nullptr)
+                {
+                    c->Match();
+                }
+            }
+
+            virtual FlagBase *Match(const EitherFlag &flag) override
+            {
+                if (selectedCommand != nullptr)
+                {
+                    if (auto *res = selectedCommand->Match(flag))
+                    {
+                        return res;
+                    }
+
+                    for (auto *child: Children())
+                    {
+                        if ((child->GetOptions() & Options::Global) != Options::None)
+                        {
+                            if (auto *res = child->Match(flag))
+                            {
+                                return res;
+                            }
+                        }
+                    }
+
+                    return nullptr;
+                }
+
+                if (subparser != nullptr)
+                {
+                    return subparser->Match(flag);
+                }
+
+                return Matched() ? Group::Match(flag) : nullptr;
+            }
+
+            virtual std::vector<FlagBase*> GetAllFlags() override
+            {
+                std::vector<FlagBase*> res;
+
+                if (!Matched())
+                {
+                    return res;
+                }
+
+                for (auto *child: Children())
+                {
+                    if (selectedCommand == nullptr || (child->GetOptions() & Options::Global) != Options::None)
+                    {
+                        auto childFlags = child->GetAllFlags();
+                        res.insert(res.end(), childFlags.begin(), childFlags.end());
+                    }
+                }
+
+                if (selectedCommand != nullptr)
+                {
+                    auto childFlags = selectedCommand->GetAllFlags();
+                    res.insert(res.end(), childFlags.begin(), childFlags.end());
+                }
+
+                if (subparser != nullptr)
+                {
+                    auto childFlags = subparser->GetAllFlags();
+                    res.insert(res.end(), childFlags.begin(), childFlags.end());
+                }
+
+                return res;
+            }
+
+            virtual PositionalBase *GetNextPositional() override
+            {
+                if (selectedCommand != nullptr)
+                {
+                    if (auto *res = selectedCommand->GetNextPositional())
+                    {
+                        return res;
+                    }
+
+                    for (auto *child: Children())
+                    {
+                        if ((child->GetOptions() & Options::Global) != Options::None)
+                        {
+                            if (auto *res = child->GetNextPositional())
+                            {
+                                return res;
+                            }
+                        }
+                    }
+
+                    return nullptr;
+                }
+
+                if (subparser != nullptr)
+                {
+                    return subparser->GetNextPositional();
+                }
+
+                return Matched() ? Group::GetNextPositional() : nullptr;
+            }
+
+            virtual bool HasFlag() const override
+            {
+                return subparserHasFlag || Group::HasFlag();
+            }
+
+            virtual bool HasPositional() const override
+            {
+                return subparserHasPositional || Group::HasPositional();
+            }
+
+            virtual bool HasCommand() const override
+            {
+                return true;
+            }
+
+            std::vector<std::string> GetCommandProgramLine(const HelpParams &params) const
+            {
+                UpdateSubparserHelp(params);
+
+                auto res = Group::GetProgramLine(params);
+                res.insert(res.end(), subparserProgramLine.begin(), subparserProgramLine.end());
+
+                if (!params.proglineCommand.empty() && (Group::HasCommand() || subparserHasCommand))
+                {
+                    res.insert(res.begin(), commandIsRequired ? params.proglineCommand : "[" + params.proglineCommand + "]");
+                }
+
+                if (!Name().empty())
+                {
+                    res.insert(res.begin(), Name());
+                }
+
+                if ((subparserHasFlag || Group::HasFlag()) && params.showProglineOptions && !params.proglineShowFlags)
+                {
+                    res.push_back(params.proglineOptions);
+                }
+
+                if (!ProglinePostfix().empty())
+                {
+                    std::string line;
+                    for (auto c : ProglinePostfix())
+                    {
+                        if (std::isspace(static_cast<unsigned char>(c)))
+                        {
+                            if (!line.empty())
+                            {
+                                res.push_back(line);
+                                line.clear();
+                            }
+
+                            if (c == '\n')
+                            {
+                                res.push_back("\n");
+                            }
+                        }
+                        else
+                        {
+                            line += c;
+                        }
+                    }
+
+                    if (!line.empty())
+                    {
+                        res.push_back(line);
+                    }
+                }
+
+                return res;
+            }
+
+            virtual std::vector<std::string> GetProgramLine(const HelpParams &params) const override
+            {
+                if (!Matched())
+                {
+                    return {};
+                }
+
+                return GetCommandProgramLine(params);
+            }
+
+            virtual std::vector<Command*> GetCommands() override
+            {
+                if (selectedCommand != nullptr)
+                {
+                    return selectedCommand->GetCommands();
+                }
+
+                if (Matched())
+                {
+                    return Group::GetCommands();
+                }
+
+                return { this };
+            }
+
+            virtual std::vector<std::tuple<std::string, std::string, unsigned>> GetDescription(const HelpParams &params, const unsigned int indent) const override
+            {
+                std::vector<std::tuple<std::string, std::string, unsigned>> descriptions;
+                unsigned addindent = 0;
+
+                UpdateSubparserHelp(params);
+
+                if (!Matched())
+                {
+                    if (params.showCommandFullHelp)
+                    {
+                        std::ostringstream s;
+                        bool empty = true;
+                        for (const auto &progline: GetCommandProgramLine(params))
+                        {
+                            if (!empty)
+                            {
+                                s << ' ';
+                            }
+                            else
+                            {
+                                empty = false;
+                            }
+
+                            s << progline;
+                        }
+
+                        descriptions.emplace_back(s.str(), "", indent);
+                    }
+                    else
+                    {
+                        descriptions.emplace_back(Name(), help, indent);
+                    }
+
+                    if (!params.showCommandChildren && !params.showCommandFullHelp)
+                    {
+                        return descriptions;
+                    }
+
+                    addindent = 1;
+                }
+
+                if (params.showCommandFullHelp && !Matched())
+                {
+                    descriptions.emplace_back("", "", indent + addindent);
+                    descriptions.emplace_back(Description().empty() ? Help() : Description(), "", indent + addindent);
+                    descriptions.emplace_back("", "", indent + addindent);
+                }
+
+                for (Base *child: Children())
+                {
+                    if ((child->GetOptions() & Options::HiddenFromDescription) != Options::None)
+                    {
+                        continue;
+                    }
+
+                    auto groupDescriptions = child->GetDescription(params, indent + addindent);
+                    descriptions.insert(
+                                        std::end(descriptions),
+                                        std::make_move_iterator(std::begin(groupDescriptions)),
+                                        std::make_move_iterator(std::end(groupDescriptions)));
+                }
+
+                for (auto childDescription: subparserDescription)
+                {
+                    std::get<2>(childDescription) += indent + addindent;
+                    descriptions.push_back(std::move(childDescription));
+                }
+
+                if (params.showCommandFullHelp && !Matched())
+                {
+                    descriptions.emplace_back("", "", indent + addindent);
+                    if (!Epilog().empty())
+                    {
+                        descriptions.emplace_back(Epilog(), "", indent + addindent);
+                        descriptions.emplace_back("", "", indent + addindent);
+                    }
+                }
+
+                return descriptions;
+            }
+
+            virtual void Validate(const std::string &shortprefix, const std::string &longprefix) const override
+            {
+                if (!Matched())
+                {
+                    return;
+                }
+
+                auto onValidationError = [&]
+                {
+                    std::ostringstream problem;
+                    problem << "Group validation failed somewhere!";
+#ifdef ARGS_NOEXCEPT
+                    error = Error::Validation;
+                    errorMsg = problem.str();
+#else
+                    throw ValidationError(problem.str());
+#endif
+                };
+
+                for (Base *child: Children())
+                {
+                    if (child->IsGroup() && !child->Matched())
+                    {
+                        onValidationError();
+                    }
+
+                    child->Validate(shortprefix, longprefix);
+                }
+
+                if (subparser != nullptr)
+                {
+                    subparser->Validate(shortprefix, longprefix);
+                    if (!subparser->Matched())
+                    {
+                        onValidationError();
+                    }
+                }
+
+                if (selectedCommand == nullptr && commandIsRequired && (Group::HasCommand() || subparserHasCommand))
+                {
+                    std::ostringstream problem;
+                    problem << "Command is required";
+#ifdef ARGS_NOEXCEPT
+                    error = Error::Validation;
+                    errorMsg = problem.str();
+#else
+                    throw ValidationError(problem.str());
+#endif
+                }
+            }
+
+            virtual void Reset() noexcept override
+            {
+                Group::Reset();
+                selectedCommand = nullptr;
+                subparserProgramLine.clear();
+                subparserDescription.clear();
+                subparserHasFlag = false;
+                subparserHasPositional = false;
+                subparserHasCommand = false;
+#ifdef ARGS_NOEXCEPT
+                subparserError = Error::None;
+#endif
+            }
+
+#ifdef ARGS_NOEXCEPT
+            /// Only for ARGS_NOEXCEPT
+            virtual Error GetError() const override
+            {
+                if (!Matched())
+                {
+                    return Error::None;
+                }
+
+                if (error != Error::None)
+                {
+                    return error;
+                }
+
+                if (subparserError != Error::None)
+                {
+                    return subparserError;
+                }
+
+                return Group::GetError();
+            }
+#endif
+    };
+
+    /** The main user facing command line argument parser class
+     */
+    class ArgumentParser : public Command
+    {
+        friend class Subparser;
+
+        private:
+            std::string longprefix;
+            std::string shortprefix;
+
+            std::string longseparator;
+
+            std::string terminator;
+
+            bool allowJoinedShortValue = true;
+            bool allowJoinedLongValue = true;
+            bool allowSeparateShortValue = true;
+            bool allowSeparateLongValue = true;
+
+            CompletionFlag *completion = nullptr;
+            bool readCompletion = false;
+
+        protected:
+            enum class OptionType
+            {
+                LongFlag,
+                ShortFlag,
+                Positional
+            };
+
+            OptionType ParseOption(const std::string &s, bool allowEmpty = false)
+            {
+                if (s.find(longprefix) == 0 && (allowEmpty || s.length() > longprefix.length()))
+                {
+                    return OptionType::LongFlag;
+                }
+
+                if (s.find(shortprefix) == 0 && (allowEmpty || s.length() > shortprefix.length()))
+                {
+                    return OptionType::ShortFlag;
+                }
+
+                return OptionType::Positional;
+            }
+
+            template <typename It>
+            bool Complete(FlagBase &flag, It it, It end)
+            {
+                auto nextIt = it;
+                if (!readCompletion || (++nextIt != end))
+                {
+                    return false;
+                }
+
+                const auto &chunk = *it;
+                for (auto &choice : flag.HelpChoices(helpParams))
+                {
+                    AddCompletionReply(chunk, choice);
+                }
+
+#ifndef ARGS_NOEXCEPT
+                throw Completion(completion->Get());
+#else
+                return true;
+#endif
+            }
+
+            /** (INTERNAL) Parse flag's values
+             *
+             * \param arg The string to display in error message as a flag name
+             * \param[in, out] it The iterator to first value. It will point to the last value
+             * \param end The end iterator
+             * \param joinedArg Joined value (e.g. bar in --foo=bar)
+             * \param canDiscardJoined If true joined value can be parsed as flag not as a value (as in -abcd)
+             * \param[out] values The vector to store parsed arg's values
+             */
+            template <typename It>
+            std::string ParseArgsValues(FlagBase &flag, const std::string &arg, It &it, It end,
+                                        const bool allowSeparate, const bool allowJoined,
+                                        const bool hasJoined, const std::string &joinedArg,
+                                        const bool canDiscardJoined, std::vector<std::string> &values)
+            {
+                values.clear();
+
+                Nargs nargs = flag.NumberOfArguments();
+
+                if (hasJoined && !allowJoined && nargs.min != 0)
+                {
+                    return "Flag '" + arg + "' was passed a joined argument, but these are disallowed";
+                }
+
+                if (hasJoined)
+                {
+                    if (!canDiscardJoined || nargs.max != 0)
+                    {
+                        values.push_back(joinedArg);
+                    }
+                } else if (!allowSeparate)
+                {
+                    if (nargs.min != 0)
+                    {
+                        return "Flag '" + arg + "' was passed a separate argument, but these are disallowed";
+                    }
+                } else
+                {
+                    auto valueIt = it;
+                    ++valueIt;
+
+                    while (valueIt != end &&
+                           values.size() < nargs.max &&
+                           (values.size() < nargs.min || ParseOption(*valueIt) == OptionType::Positional))
+                    {
+                        if (Complete(flag, valueIt, end))
+                        {
+                            it = end;
+                            return "";
+                        }
+
+                        values.push_back(*valueIt);
+                        ++it;
+                        ++valueIt;
+                    }
+                }
+
+                if (values.size() > nargs.max)
+                {
+                    return "Passed an argument into a non-argument flag: " + arg;
+                } else if (values.size() < nargs.min)
+                {
+                    if (nargs.min == 1 && nargs.max == 1)
+                    {
+                        return "Flag '" + arg + "' requires an argument but received none";
+                    } else if (nargs.min == 1)
+                    {
+                        return "Flag '" + arg + "' requires at least one argument but received none";
+                    } else if (nargs.min != nargs.max)
+                    {
+                        return "Flag '" + arg + "' requires at least " + std::to_string(nargs.min) +
+                               " arguments but received " + std::to_string(values.size());
+                    } else
+                    {
+                        return "Flag '" + arg + "' requires " + std::to_string(nargs.min) +
+                               " arguments but received " + std::to_string(values.size());
+                    }
+                }
+
+                return {};
+            }
+
+            template <typename It>
+            bool ParseLong(It &it, It end)
+            {
+                const auto &chunk = *it;
+                const auto argchunk = chunk.substr(longprefix.size());
+                // Try to separate it, in case of a separator:
+                const auto separator = longseparator.empty() ? argchunk.npos : argchunk.find(longseparator);
+                // If the separator is in the argument, separate it.
+                const auto arg = (separator != argchunk.npos ?
+                    std::string(argchunk, 0, separator)
+                    : argchunk);
+                const auto joined = (separator != argchunk.npos ?
+                    argchunk.substr(separator + longseparator.size())
+                    : std::string());
+
+                if (auto flag = Match(arg))
+                {
+                    std::vector<std::string> values;
+                    const std::string errorMessage = ParseArgsValues(*flag, arg, it, end, allowSeparateLongValue, allowJoinedLongValue,
+                                                                     separator != argchunk.npos, joined, false, values);
+                    if (!errorMessage.empty())
+                    {
+#ifndef ARGS_NOEXCEPT
+                        throw ParseError(errorMessage);
+#else
+                        error = Error::Parse;
+                        errorMsg = errorMessage;
+                        return false;
+#endif
+                    }
+
+                    if (!readCompletion)
+                    {
+                        flag->ParseValue(values);
+                    }
+
+                    if (flag->KickOut())
+                    {
+                        ++it;
+                        return false;
+                    }
+                } else
+                {
+                    const std::string errorMessage("Flag could not be matched: " + arg);
+#ifndef ARGS_NOEXCEPT
+                    throw ParseError(errorMessage);
+#else
+                    error = Error::Parse;
+                    errorMsg = errorMessage;
+                    return false;
+#endif
+                }
+
+                return true;
+            }
+
+            template <typename It>
+            bool ParseShort(It &it, It end)
+            {
+                const auto &chunk = *it;
+                const auto argchunk = chunk.substr(shortprefix.size());
+                for (auto argit = std::begin(argchunk); argit != std::end(argchunk); ++argit)
+                {
+                    const auto arg = *argit;
+
+                    if (auto flag = Match(arg))
+                    {
+                        const std::string value(argit + 1, std::end(argchunk));
+                        std::vector<std::string> values;
+                        const std::string errorMessage = ParseArgsValues(*flag, std::string(1, arg), it, end,
+                                                                         allowSeparateShortValue, allowJoinedShortValue,
+                                                                         !value.empty(), value, !value.empty(), values);
+
+                        if (!errorMessage.empty())
+                        {
+#ifndef ARGS_NOEXCEPT
+                            throw ParseError(errorMessage);
+#else
+                            error = Error::Parse;
+                            errorMsg = errorMessage;
+                            return false;
+#endif
+                        }
+
+                        if (!readCompletion)
+                        {
+                            flag->ParseValue(values);
+                        }
+
+                        if (flag->KickOut())
+                        {
+                            ++it;
+                            return false;
+                        }
+
+                        if (!values.empty())
+                        {
+                            break;
+                        }
+                    } else
+                    {
+                        const std::string errorMessage("Flag could not be matched: '" + std::string(1, arg) + "'");
+#ifndef ARGS_NOEXCEPT
+                        throw ParseError(errorMessage);
+#else
+                        error = Error::Parse;
+                        errorMsg = errorMessage;
+                        return false;
+#endif
+                    }
+                }
+
+                return true;
+            }
+
+            bool AddCompletionReply(const std::string &cur, const std::string &choice)
+            {
+                if (cur.empty() || choice.find(cur) == 0)
+                {
+                    if (completion->syntax == "bash" && ParseOption(choice) == OptionType::LongFlag && choice.find(longseparator) != std::string::npos)
+                    {
+                        completion->reply.push_back(choice.substr(choice.find(longseparator) + 1));
+                    } else
+                    {
+                        completion->reply.push_back(choice);
+                    }
+                    return true;
+                }
+
+                return false;
+            }
+
+            template <typename It>
+            bool Complete(It it, It end)
+            {
+                auto nextIt = it;
+                if (!readCompletion || (++nextIt != end))
+                {
+                    return false;
+                }
+
+                const auto &chunk = *it;
+                auto pos = GetNextPositional();
+                std::vector<Command *> commands = GetCommands();
+                const auto optionType = ParseOption(chunk, true);
+
+                if (!commands.empty() && (chunk.empty() || optionType == OptionType::Positional))
+                {
+                    for (auto &cmd : commands)
+                    {
+                        if ((cmd->GetOptions() & Options::HiddenFromCompletion) == Options::None)
+                        {
+                            AddCompletionReply(chunk, cmd->Name());
+                        }
+                    }
+                } else
+                {
+                    bool hasPositionalCompletion = true;
+
+                    if (!commands.empty())
+                    {
+                        for (auto &cmd : commands)
+                        {
+                            if ((cmd->GetOptions() & Options::HiddenFromCompletion) == Options::None)
+                            {
+                                AddCompletionReply(chunk, cmd->Name());
+                            }
+                        }
+                    } else if (pos)
+                    {
+                        if ((pos->GetOptions() & Options::HiddenFromCompletion) == Options::None)
+                        {
+                            auto choices = pos->HelpChoices(helpParams);
+                            hasPositionalCompletion = !choices.empty() || optionType != OptionType::Positional;
+                            for (auto &choice : choices)
+                            {
+                                AddCompletionReply(chunk, choice);
+                            }
+                        }
+                    }
+
+                    if (hasPositionalCompletion)
+                    {
+                        auto flags = GetAllFlags();
+                        for (auto flag : flags)
+                        {
+                            if ((flag->GetOptions() & Options::HiddenFromCompletion) != Options::None)
+                            {
+                                continue;
+                            }
+
+                            auto &matcher = flag->GetMatcher();
+                            if (!AddCompletionReply(chunk, matcher.GetShortOrAny().str(shortprefix, longprefix)))
+                            {
+                                for (auto &flagName : matcher.GetFlagStrings())
+                                {
+                                    if (AddCompletionReply(chunk, flagName.str(shortprefix, longprefix)))
+                                    {
+                                        break;
+                                    }
+                                }
+                            }
+                        }
+
+                        if (optionType == OptionType::LongFlag && allowJoinedLongValue)
+                        {
+                            const auto separator = longseparator.empty() ? chunk.npos : chunk.find(longseparator);
+                            if (separator != chunk.npos)
+                            {
+                                std::string arg(chunk, 0, separator);
+                                if (auto flag = this->Match(arg.substr(longprefix.size())))
+                                {
+                                    for (auto &choice : flag->HelpChoices(helpParams))
+                                    {
+                                        AddCompletionReply(chunk, arg + longseparator + choice);
+                                    }
+                                }
+                            }
+                        } else if (optionType == OptionType::ShortFlag && allowJoinedShortValue)
+                        {
+                            if (chunk.size() > shortprefix.size() + 1)
+                            {
+                                auto arg = chunk.at(shortprefix.size());
+                                //TODO: support -abcVALUE where a and b take no value
+                                if (auto flag = this->Match(arg))
+                                {
+                                    for (auto &choice : flag->HelpChoices(helpParams))
+                                    {
+                                        AddCompletionReply(chunk, shortprefix + arg + choice);
+                                    }
+                                }
+                            }
+                        }
+                    }
+                }
+
+#ifndef ARGS_NOEXCEPT
+                throw Completion(completion->Get());
+#else
+                return true;
+#endif
+            }
+
+            template <typename It>
+            It Parse(It begin, It end)
+            {
+                bool terminated = false;
+                std::vector<Command *> commands = GetCommands();
+
+                // Check all arg chunks
+                for (auto it = begin; it != end; ++it)
+                {
+                    if (Complete(it, end))
+                    {
+                        return end;
+                    }
+
+                    const auto &chunk = *it;
+
+                    if (!terminated && chunk == terminator)
+                    {
+                        terminated = true;
+                    } else if (!terminated && ParseOption(chunk) == OptionType::LongFlag)
+                    {
+                        if (!ParseLong(it, end))
+                        {
+                            return it;
+                        }
+                    } else if (!terminated && ParseOption(chunk) == OptionType::ShortFlag)
+                    {
+                        if (!ParseShort(it, end))
+                        {
+                            return it;
+                        }
+                    } else if (!terminated && !commands.empty())
+                    {
+                        auto itCommand = std::find_if(commands.begin(), commands.end(), [&chunk](Command *c) { return c->Name() == chunk; });
+                        if (itCommand == commands.end())
+                        {
+                            const std::string errorMessage("Unknown command: " + chunk);
+#ifndef ARGS_NOEXCEPT
+                            throw ParseError(errorMessage);
+#else
+                            error = Error::Parse;
+                            errorMsg = errorMessage;
+                            return it;
+#endif
+                        }
+
+                        SelectCommand(*itCommand);
+
+                        if (const auto &coroutine = GetCoroutine())
+                        {
+                            ++it;
+                            RaiiSubparser coro(*this, std::vector<std::string>(it, end));
+                            coroutine(coro.Parser());
+#ifdef ARGS_NOEXCEPT
+                            error = GetError();
+                            if (error != Error::None)
+                            {
+                                return end;
+                            }
+
+                            if (!coro.Parser().IsParsed())
+                            {
+                                error = Error::Usage;
+                                return end;
+                            }
+#else
+                            if (!coro.Parser().IsParsed())
+                            {
+                                throw UsageError("Subparser::Parse was not called");
+                            }
+#endif
+
+                            break;
+                        }
+
+                        commands = GetCommands();
+                    } else
+                    {
+                        auto pos = GetNextPositional();
+                        if (pos)
+                        {
+                            pos->ParseValue(chunk);
+
+                            if (pos->KickOut())
+                            {
+                                return ++it;
+                            }
+                        } else
+                        {
+                            const std::string errorMessage("Passed in argument, but no positional arguments were ready to receive it: " + chunk);
+#ifndef ARGS_NOEXCEPT
+                            throw ParseError(errorMessage);
+#else
+                            error = Error::Parse;
+                            errorMsg = errorMessage;
+                            return it;
+#endif
+                        }
+                    }
+
+                    if (!readCompletion && completion != nullptr && completion->Matched())
+                    {
+#ifdef ARGS_NOEXCEPT
+                        error = Error::Completion;
+#endif
+                        readCompletion = true;
+                        ++it;
+                        const auto argsLeft = static_cast<size_t>(std::distance(it, end));
+                        if (completion->cword == 0 || argsLeft <= 1 || completion->cword >= argsLeft)
+                        {
+#ifndef ARGS_NOEXCEPT
+                            throw Completion("");
+#endif
+                        }
+
+                        std::vector<std::string> curArgs(++it, end);
+                        curArgs.resize(completion->cword);
+
+                        if (completion->syntax == "bash")
+                        {
+                            // bash tokenizes --flag=value as --flag=value
+                            for (size_t idx = 0; idx < curArgs.size(); )
+                            {
+                                if (idx > 0 && curArgs[idx] == "=")
+                                {
+                                    curArgs[idx - 1] += "=";
+                                    // Avoid warnings from -Wsign-conversion
+                                    const auto signedIdx = static_cast<std::ptrdiff_t>(idx);
+                                    if (idx + 1 < curArgs.size())
+                                    {
+                                        curArgs[idx - 1] += curArgs[idx + 1];
+                                        curArgs.erase(curArgs.begin() + signedIdx, curArgs.begin() + signedIdx + 2);
+                                    } else
+                                    {
+                                        curArgs.erase(curArgs.begin() + signedIdx);
+                                    }
+                                } else
+                                {
+                                    ++idx;
+                                }
+                            }
+
+                        }
+#ifndef ARGS_NOEXCEPT
+                        try
+                        {
+                            Parse(curArgs.begin(), curArgs.end());
+                            throw Completion("");
+                        }
+                        catch (Completion &)
+                        {
+                            throw;
+                        }
+                        catch (args::Error&)
+                        {
+                            throw Completion("");
+                        }
+#else
+                        return Parse(curArgs.begin(), curArgs.end());
+#endif
+                    }
+                }
+
+                Validate(shortprefix, longprefix);
+                return end;
+            }
+
+        public:
+            HelpParams helpParams;
+
+            ArgumentParser(const std::string &description_, const std::string &epilog_ = std::string())
+            {
+                Description(description_);
+                Epilog(epilog_);
+                LongPrefix("--");
+                ShortPrefix("-");
+                LongSeparator("=");
+                Terminator("--");
+                SetArgumentSeparations(true, true, true, true);
+                matched = true;
+            }
+
+            void AddCompletion(CompletionFlag &completionFlag)
+            {
+                completion = &completionFlag;
+                Add(completionFlag);
+            }
+
+            /** The program name for help generation
+             */
+            const std::string &Prog() const
+            { return helpParams.programName; }
+            /** The program name for help generation
+             */
+            void Prog(const std::string &prog_)
+            { this->helpParams.programName = prog_; }
+
+            /** The prefix for long flags
+             */
+            const std::string &LongPrefix() const
+            { return longprefix; }
+            /** The prefix for long flags
+             */
+            void LongPrefix(const std::string &longprefix_)
+            {
+                this->longprefix = longprefix_;
+                this->helpParams.longPrefix = longprefix_;
+            }
+
+            /** The prefix for short flags
+             */
+            const std::string &ShortPrefix() const
+            { return shortprefix; }
+            /** The prefix for short flags
+             */
+            void ShortPrefix(const std::string &shortprefix_)
+            {
+                this->shortprefix = shortprefix_;
+                this->helpParams.shortPrefix = shortprefix_;
+            }
+
+            /** The separator for long flags
+             */
+            const std::string &LongSeparator() const
+            { return longseparator; }
+            /** The separator for long flags
+             */
+            void LongSeparator(const std::string &longseparator_)
+            {
+                if (longseparator_.empty())
+                {
+                    const std::string errorMessage("longseparator can not be set to empty");
+#ifdef ARGS_NOEXCEPT
+                    error = Error::Usage;
+                    errorMsg = errorMessage;
+#else
+                    throw UsageError(errorMessage);
+#endif
+                } else
+                {
+                    this->longseparator = longseparator_;
+                    this->helpParams.longSeparator = allowJoinedLongValue ? longseparator_ : " ";
+                }
+            }
+
+            /** The terminator that forcibly separates flags from positionals
+             */
+            const std::string &Terminator() const
+            { return terminator; }
+            /** The terminator that forcibly separates flags from positionals
+             */
+            void Terminator(const std::string &terminator_)
+            { this->terminator = terminator_; }
+
+            /** Get the current argument separation parameters.
+             *
+             * See SetArgumentSeparations for details on what each one means.
+             */
+            void GetArgumentSeparations(
+                bool &allowJoinedShortValue_,
+                bool &allowJoinedLongValue_,
+                bool &allowSeparateShortValue_,
+                bool &allowSeparateLongValue_) const
+            {
+                allowJoinedShortValue_ = this->allowJoinedShortValue;
+                allowJoinedLongValue_ = this->allowJoinedLongValue;
+                allowSeparateShortValue_ = this->allowSeparateShortValue;
+                allowSeparateLongValue_ = this->allowSeparateLongValue;
+            }
+
+            /** Change allowed option separation.
+             *
+             * \param allowJoinedShortValue_ Allow a short flag that accepts an argument to be passed its argument immediately next to it (ie. in the same argv field)
+             * \param allowJoinedLongValue_ Allow a long flag that accepts an argument to be passed its argument separated by the longseparator (ie. in the same argv field)
+             * \param allowSeparateShortValue_ Allow a short flag that accepts an argument to be passed its argument separated by whitespace (ie. in the next argv field)
+             * \param allowSeparateLongValue_ Allow a long flag that accepts an argument to be passed its argument separated by whitespace (ie. in the next argv field)
+             */
+            void SetArgumentSeparations(
+                const bool allowJoinedShortValue_,
+                const bool allowJoinedLongValue_,
+                const bool allowSeparateShortValue_,
+                const bool allowSeparateLongValue_)
+            {
+                this->allowJoinedShortValue = allowJoinedShortValue_;
+                this->allowJoinedLongValue = allowJoinedLongValue_;
+                this->allowSeparateShortValue = allowSeparateShortValue_;
+                this->allowSeparateLongValue = allowSeparateLongValue_;
+
+                this->helpParams.longSeparator = allowJoinedLongValue ? longseparator : " ";
+                this->helpParams.shortSeparator = allowJoinedShortValue ? "" : " ";
+            }
+
+            /** Pass the help menu into an ostream
+             */
+            void Help(std::ostream &help_) const
+            {
+                auto &command = SelectedCommand();
+                const auto &commandDescription = command.Description().empty() ? command.Help() : command.Description();
+                const auto description_text = Wrap(commandDescription, helpParams.width - helpParams.descriptionindent);
+                const auto epilog_text = Wrap(command.Epilog(), helpParams.width - helpParams.descriptionindent);
+
+                const bool hasoptions = command.HasFlag();
+                const bool hasarguments = command.HasPositional();
+
+                std::vector<std::string> prognameline;
+                prognameline.push_back(helpParams.usageString);
+                prognameline.push_back(Prog());
+                auto commandProgLine = command.GetProgramLine(helpParams);
+                prognameline.insert(prognameline.end(), commandProgLine.begin(), commandProgLine.end());
+
+                const auto proglines = Wrap(prognameline.begin(), prognameline.end(),
+                                            helpParams.width - (helpParams.progindent + helpParams.progtailindent),
+                                            helpParams.width - helpParams.progindent);
+                auto progit = std::begin(proglines);
+                if (progit != std::end(proglines))
+                {
+                    help_ << std::string(helpParams.progindent, ' ') << *progit << '\n';
+                    ++progit;
+                }
+                for (; progit != std::end(proglines); ++progit)
+                {
+                    help_ << std::string(helpParams.progtailindent, ' ') << *progit << '\n';
+                }
+
+                help_ << '\n';
+
+                if (!description_text.empty())
+                {
+                    for (const auto &line: description_text)
+                    {
+                        help_ << std::string(helpParams.descriptionindent, ' ') << line << "\n";
+                    }
+                    help_ << "\n";
+                }
+
+                bool lastDescriptionIsNewline = false;
+
+                if (!helpParams.optionsString.empty())
+                {
+                    help_ << std::string(helpParams.progindent, ' ') << helpParams.optionsString << "\n\n";
+                }
+
+                for (const auto &desc: command.GetDescription(helpParams, 0))
+                {
+                    lastDescriptionIsNewline = std::get<0>(desc).empty() && std::get<1>(desc).empty();
+                    const auto groupindent = std::get<2>(desc) * helpParams.eachgroupindent;
+                    const auto flags = Wrap(std::get<0>(desc), helpParams.width - (helpParams.flagindent + helpParams.helpindent + helpParams.gutter));
+                    const auto info = Wrap(std::get<1>(desc), helpParams.width - (helpParams.helpindent + groupindent));
+
+                    std::string::size_type flagssize = 0;
+                    for (auto flagsit = std::begin(flags); flagsit != std::end(flags); ++flagsit)
+                    {
+                        if (flagsit != std::begin(flags))
+                        {
+                            help_ << '\n';
+                        }
+                        help_ << std::string(groupindent + helpParams.flagindent, ' ') << *flagsit;
+                        flagssize = Glyphs(*flagsit);
+                    }
+
+                    auto infoit = std::begin(info);
+                    // groupindent is on both sides of this inequality, and therefore can be removed
+                    if ((helpParams.flagindent + flagssize + helpParams.gutter) > helpParams.helpindent || infoit == std::end(info) || helpParams.addNewlineBeforeDescription)
+                    {
+                        help_ << '\n';
+                    } else
+                    {
+                        // groupindent is on both sides of the minus sign, and therefore doesn't actually need to be in here
+                        help_ << std::string(helpParams.helpindent - (helpParams.flagindent + flagssize), ' ') << *infoit << '\n';
+                        ++infoit;
+                    }
+                    for (; infoit != std::end(info); ++infoit)
+                    {
+                        help_ << std::string(groupindent + helpParams.helpindent, ' ') << *infoit << '\n';
+                    }
+                }
+                if (hasoptions && hasarguments && helpParams.showTerminator)
+                {
+                    lastDescriptionIsNewline = false;
+                    for (const auto &item: Wrap(std::string("\"") + terminator + "\" can be used to terminate flag options and force all following arguments to be treated as positional options", helpParams.width - helpParams.flagindent))
+                    {
+                        help_ << std::string(helpParams.flagindent, ' ') << item << '\n';
+                    }
+                }
+
+                if (!lastDescriptionIsNewline)
+                {
+                    help_ << "\n";
+                }
+
+                for (const auto &line: epilog_text)
+                {
+                    help_ << std::string(helpParams.descriptionindent, ' ') << line << "\n";
+                }
+            }
+
+            /** Generate a help menu as a string.
+             *
+             * \return the help text as a single string
+             */
+            std::string Help() const
+            {
+                std::ostringstream help_;
+                Help(help_);
+                return help_.str();
+            }
+
+            virtual void Reset() noexcept override
+            {
+                Command::Reset();
+                matched = true;
+                readCompletion = false;
+            }
+
+            /** Parse all arguments.
+             *
+             * \param begin an iterator to the beginning of the argument list
+             * \param end an iterator to the past-the-end element of the argument list
+             * \return the iterator after the last parsed value.  Only useful for kick-out
+             */
+            template <typename It>
+            It ParseArgs(It begin, It end)
+            {
+                // Reset all Matched statuses and errors
+                Reset();
+#ifdef ARGS_NOEXCEPT
+                error = GetError();
+                if (error != Error::None)
+                {
+                    return end;
+                }
+#endif
+                return Parse(begin, end);
+            }
+
+            /** Parse all arguments.
+             *
+             * \param args an iterable of the arguments
+             * \return the iterator after the last parsed value.  Only useful for kick-out
+             */
+            template <typename T>
+            auto ParseArgs(const T &args) -> decltype(std::begin(args))
+            {
+                return ParseArgs(std::begin(args), std::end(args));
+            }
+
+            /** Convenience function to parse the CLI from argc and argv
+             *
+             * Just assigns the program name and vectorizes arguments for passing into ParseArgs()
+             *
+             * \return whether or not all arguments were parsed.  This works for detecting kick-out, but is generally useless as it can't do anything with it.
+             */
+            bool ParseCLI(const int argc, const char * const * argv)
+            {
+                if (Prog().empty())
+                {
+                    Prog(argv[0]);
+                }
+                const std::vector<std::string> args(argv + 1, argv + argc);
+                return ParseArgs(args) == std::end(args);
+            }
+            
+            template <typename T>
+            bool ParseCLI(const T &args)
+            {
+                return ParseArgs(args) == std::end(args);
+            }
+    };
+
+    inline Command::RaiiSubparser::RaiiSubparser(ArgumentParser &parser_, std::vector<std::string> args_)
+        : command(parser_.SelectedCommand()), parser(std::move(args_), parser_, command, parser_.helpParams), oldSubparser(command.subparser)
+    {
+        command.subparser = &parser;
+    }
+
+    inline Command::RaiiSubparser::RaiiSubparser(const Command &command_, const HelpParams &params_): command(command_), parser(command, params_), oldSubparser(command.subparser)
+    {
+        command.subparser = &parser;
+    }
+
+    inline void Subparser::Parse()
+    {
+        isParsed = true;
+        Reset();
+        command.subparserDescription = GetDescription(helpParams, 0);
+        command.subparserHasFlag = HasFlag();
+        command.subparserHasPositional = HasPositional();
+        command.subparserHasCommand = HasCommand();
+        command.subparserProgramLine = GetProgramLine(helpParams);
+        if (parser == nullptr)
+        {
+#ifndef ARGS_NOEXCEPT
+            throw args::SubparserError();
+#else
+            error = Error::Subparser;
+            return;
+#endif
+        }
+
+        auto it = parser->Parse(args.begin(), args.end());
+        command.Validate(parser->ShortPrefix(), parser->LongPrefix());
+        kicked.assign(it, args.end());
+
+#ifdef ARGS_NOEXCEPT
+        command.subparserError = GetError();
+#endif
+    }
+
+    inline std::ostream &operator<<(std::ostream &os, const ArgumentParser &parser)
+    {
+        parser.Help(os);
+        return os;
+    }
+
+    /** Boolean argument matcher
+     */
+    class Flag : public FlagBase
+    {
+        public:
+            Flag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, Options options_): FlagBase(name_, help_, std::move(matcher_), options_)
+            {
+                group_.Add(*this);
+            }
+
+            Flag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const bool extraError_ = false): Flag(group_, name_, help_, std::move(matcher_), extraError_ ? Options::Single : Options::None)
+            {
+            }
+
+            virtual ~Flag() {}
+
+            /** Get whether this was matched
+             */
+            bool Get() const
+            {
+                return Matched();
+            }
+
+            virtual Nargs NumberOfArguments() const noexcept override
+            {
+                return 0;
+            }
+
+            virtual void ParseValue(const std::vector<std::string>&) override
+            {
+            }
+    };
+
+    /** Help flag class
+     *
+     * Works like a regular flag, but throws an instance of Help when it is matched
+     */
+    class HelpFlag : public Flag
+    {
+        public:
+            HelpFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, Options options_ = {}): Flag(group_, name_, help_, std::move(matcher_), options_) {}
+
+            virtual ~HelpFlag() {}
+
+            virtual void ParseValue(const std::vector<std::string> &)
+            {
+#ifdef ARGS_NOEXCEPT
+                    error = Error::Help;
+                    errorMsg = Name();
+#else
+                    throw Help(Name());
+#endif
+            }
+
+            /** Get whether this was matched
+             */
+            bool Get() const noexcept
+            {
+                return Matched();
+            }
+    };
+
+    /** A flag class that simply counts the number of times it's matched
+     */
+    class CounterFlag : public Flag
+    {
+        private:
+            const int startcount;
+            int count;
+
+        public:
+            CounterFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const int startcount_ = 0, Options options_ = {}):
+                Flag(group_, name_, help_, std::move(matcher_), options_), startcount(startcount_), count(startcount_) {}
+
+            virtual ~CounterFlag() {}
+
+            virtual FlagBase *Match(const EitherFlag &arg) override
+            {
+                auto me = FlagBase::Match(arg);
+                if (me)
+                {
+                    ++count;
+                }
+                return me;
+            }
+
+            /** Get the count
+             */
+            int &Get() noexcept
+            {
+                return count;
+            }
+
+            int &operator *() noexcept {
+                return count;
+            }
+            
+            const int &operator *() const noexcept {
+                return count;
+            }
+
+            virtual void Reset() noexcept override
+            {
+                FlagBase::Reset();
+                count = startcount;
+            }
+    };
+
+    /** A flag class that calls a function when it's matched
+     */
+    class ActionFlag : public FlagBase
+    {
+        private:
+            std::function<void(const std::vector<std::string> &)> action;
+            Nargs nargs;
+
+        public:
+            ActionFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, Nargs nargs_, std::function<void(const std::vector<std::string> &)> action_, Options options_ = {}):
+                FlagBase(name_, help_, std::move(matcher_), options_), action(std::move(action_)), nargs(nargs_)
+            {
+                group_.Add(*this);
+            }
+
+            ActionFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, std::function<void(const std::string &)> action_, Options options_ = {}):
+                FlagBase(name_, help_, std::move(matcher_), options_), nargs(1)
+            {
+                group_.Add(*this);
+                action = [action_](const std::vector<std::string> &a) { return action_(a.at(0)); };
+            }
+
+            ActionFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, std::function<void()> action_, Options options_ = {}):
+                FlagBase(name_, help_, std::move(matcher_), options_), nargs(0)
+            {
+                group_.Add(*this);
+                action = [action_](const std::vector<std::string> &) { return action_(); };
+            }
+
+            virtual Nargs NumberOfArguments() const noexcept override
+            { return nargs; }
+
+            virtual void ParseValue(const std::vector<std::string> &value) override
+            { action(value); }
+    };
+
+    /** A default Reader class for argument classes
+     *
+     * If destination type is assignable to std::string it uses an assignment to std::string.
+     * Otherwise ValueReader simply uses a std::istringstream to read into the destination type, and
+     * raises a ParseError if there are any characters left.
+     */
+    struct ValueReader
+    {
+        template <typename T>
+        typename std::enable_if<!std::is_assignable<T, std::string>::value, bool>::type
+        operator ()(const std::string &name, const std::string &value, T &destination)
+        {
+            std::istringstream ss(value);
+            bool failed = !(ss >> destination);
+
+            if (!failed)
+            {
+                ss >> std::ws;
+            }
+
+            if (ss.rdbuf()->in_avail() > 0 || failed)
+            {
+#ifdef ARGS_NOEXCEPT
+                (void)name;
+                return false;
+#else
+                std::ostringstream problem;
+                problem << "Argument '" << name << "' received invalid value type '" << value << "'";
+                throw ParseError(problem.str());
+#endif
+            }
+            return true;
+        }
+
+        template <typename T>
+        typename std::enable_if<std::is_assignable<T, std::string>::value, bool>::type
+        operator()(const std::string &, const std::string &value, T &destination)
+        {
+            destination = value;
+            return true;
+        }
+    };
+
+    /** An argument-accepting flag class
+     * 
+     * \tparam T the type to extract the argument as
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     */
+    template <
+        typename T,
+        typename Reader = ValueReader>
+    class ValueFlag : public ValueFlagBase
+    {
+        protected:
+            T value;
+            T defaultValue;
+
+            virtual std::string GetDefaultString(const HelpParams&) const override
+            {
+                return detail::ToString(defaultValue);
+            }
+
+        private:
+            Reader reader;
+
+        public:
+
+            ValueFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const T &defaultValue_, Options options_): ValueFlagBase(name_, help_, std::move(matcher_), options_), value(defaultValue_), defaultValue(defaultValue_)
+            {
+                group_.Add(*this);
+            }
+
+            ValueFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const T &defaultValue_ = T(), const bool extraError_ = false): ValueFlag(group_, name_, help_, std::move(matcher_), defaultValue_, extraError_ ? Options::Single : Options::None)
+            {
+            }
+
+            ValueFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, Options options_): ValueFlag(group_, name_, help_, std::move(matcher_), T(), options_)
+            {
+            }
+
+            virtual ~ValueFlag() {}
+
+            virtual void ParseValue(const std::vector<std::string> &values_) override
+            {
+                const std::string &value_ = values_.at(0);
+
+#ifdef ARGS_NOEXCEPT
+                if (!reader(name, value_, this->value))
+                {
+                    error = Error::Parse;
+                }
+#else
+                reader(name, value_, this->value);
+#endif
+            }
+
+            virtual void Reset() noexcept override
+            {
+                ValueFlagBase::Reset();
+                value = defaultValue;
+            }
+
+            /** Get the value
+             */
+            T &Get() noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            T &operator *() noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            const T &operator *() const noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            T *operator ->() noexcept
+            {
+                return &value;
+            }
+
+            /** Get the value
+             */
+            const T *operator ->() const noexcept
+            {
+                return &value;
+            }
+
+            /** Get the default value
+             */
+            const T &GetDefault() noexcept
+            {
+                return defaultValue;
+            }
+    };
+
+    /** An optional argument-accepting flag class
+     *
+     * \tparam T the type to extract the argument as
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     */
+    template <
+        typename T,
+        typename Reader = ValueReader>
+    class ImplicitValueFlag : public ValueFlag<T, Reader>
+    {
+        protected:
+            T implicitValue;
+
+        public:
+
+            ImplicitValueFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const T &implicitValue_, const T &defaultValue_ = T(), Options options_ = {})
+                : ValueFlag<T, Reader>(group_, name_, help_, std::move(matcher_), defaultValue_, options_), implicitValue(implicitValue_)
+            {
+            }
+
+            ImplicitValueFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const T &defaultValue_ = T(), Options options_ = {})
+                : ValueFlag<T, Reader>(group_, name_, help_, std::move(matcher_), defaultValue_, options_), implicitValue(defaultValue_)
+            {
+            }
+
+            ImplicitValueFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, Options options_)
+                : ValueFlag<T, Reader>(group_, name_, help_, std::move(matcher_), {}, options_), implicitValue()
+            {
+            }
+
+            virtual ~ImplicitValueFlag() {}
+
+            virtual Nargs NumberOfArguments() const noexcept override
+            {
+                return {0, 1};
+            }
+
+            virtual void ParseValue(const std::vector<std::string> &value_) override
+            {
+                if (value_.empty())
+                {
+                    this->value = implicitValue;
+                } else
+                {
+                    ValueFlag<T, Reader>::ParseValue(value_);
+                }
+            }
+    };
+
+    /** A variadic arguments accepting flag class
+     *
+     * \tparam T the type to extract the argument as
+     * \tparam List the list type that houses the values
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     */
+    template <
+        typename T,
+        template <typename...> class List = detail::vector,
+        typename Reader = ValueReader>
+    class NargsValueFlag : public FlagBase
+    {
+        protected:
+
+            List<T> values;
+            const List<T> defaultValues;
+            Nargs nargs;
+            Reader reader;
+
+        public:
+
+            typedef List<T> Container;
+            typedef T value_type;
+            typedef typename Container::allocator_type allocator_type;
+            typedef typename Container::pointer pointer;
+            typedef typename Container::const_pointer const_pointer;
+            typedef T& reference;
+            typedef const T& const_reference;
+            typedef typename Container::size_type size_type;
+            typedef typename Container::difference_type difference_type;
+            typedef typename Container::iterator iterator;
+            typedef typename Container::const_iterator const_iterator;
+            typedef std::reverse_iterator<iterator> reverse_iterator;
+            typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+            NargsValueFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, Nargs nargs_, const List<T> &defaultValues_ = {}, Options options_ = {})
+                : FlagBase(name_, help_, std::move(matcher_), options_), values(defaultValues_), defaultValues(defaultValues_),nargs(nargs_)
+            {
+                group_.Add(*this);
+            }
+
+            virtual ~NargsValueFlag() {}
+
+            virtual Nargs NumberOfArguments() const noexcept override
+            {
+                return nargs;
+            }
+
+            virtual void ParseValue(const std::vector<std::string> &values_) override
+            {
+                values.clear();
+
+                for (const std::string &value : values_)
+                {
+                    T v;
+#ifdef ARGS_NOEXCEPT
+                    if (!reader(name, value, v))
+                    {
+                        error = Error::Parse;
+                    }
+#else
+                    reader(name, value, v);
+#endif
+                    values.insert(std::end(values), v);
+                }
+            }
+
+            List<T> &Get() noexcept
+            {
+                return values;
+            }
+
+            /** Get the value
+             */
+            List<T> &operator *() noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            const List<T> &operator *() const noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            List<T> *operator ->() noexcept
+            {
+                return &values;
+            }
+
+            /** Get the values
+             */
+            const List<T> *operator ->() const noexcept
+            {
+                return &values;
+            }
+
+            iterator begin() noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator begin() const noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator cbegin() const noexcept
+            {
+                return values.cbegin();
+            }
+
+            iterator end() noexcept
+            {
+                return values.end();
+            }
+
+            const_iterator end() const noexcept 
+            {
+                return values.end();
+            }
+
+            const_iterator cend() const noexcept
+            {
+                return values.cend();
+            }
+
+            virtual void Reset() noexcept override
+            {
+                FlagBase::Reset();
+                values = defaultValues;
+            }
+
+            virtual FlagBase *Match(const EitherFlag &arg) override
+            {
+                const bool wasMatched = Matched();
+                auto me = FlagBase::Match(arg);
+                if (me && !wasMatched)
+                {
+                    values.clear();
+                }
+                return me;
+            }
+    };
+
+    /** An argument-accepting flag class that pushes the found values into a list
+     * 
+     * \tparam T the type to extract the argument as
+     * \tparam List the list type that houses the values
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     */
+    template <
+        typename T,
+        template <typename...> class List = detail::vector,
+        typename Reader = ValueReader>
+    class ValueFlagList : public ValueFlagBase
+    {
+        private:
+            using Container = List<T>;
+            Container values;
+            const Container defaultValues;
+            Reader reader;
+
+        public:
+
+            typedef T value_type;
+            typedef typename Container::allocator_type allocator_type;
+            typedef typename Container::pointer pointer;
+            typedef typename Container::const_pointer const_pointer;
+            typedef T& reference;
+            typedef const T& const_reference;
+            typedef typename Container::size_type size_type;
+            typedef typename Container::difference_type difference_type;
+            typedef typename Container::iterator iterator;
+            typedef typename Container::const_iterator const_iterator;
+            typedef std::reverse_iterator<iterator> reverse_iterator;
+            typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+            ValueFlagList(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const Container &defaultValues_ = Container(), Options options_ = {}):
+                ValueFlagBase(name_, help_, std::move(matcher_), options_), values(defaultValues_), defaultValues(defaultValues_)
+            {
+                group_.Add(*this);
+            }
+
+            virtual ~ValueFlagList() {}
+
+            virtual void ParseValue(const std::vector<std::string> &values_) override
+            {
+                const std::string &value_ = values_.at(0);
+
+                T v;
+#ifdef ARGS_NOEXCEPT
+                if (!reader(name, value_, v))
+                {
+                    error = Error::Parse;
+                }
+#else
+                reader(name, value_, v);
+#endif
+                values.insert(std::end(values), v);
+            }
+
+            /** Get the values
+             */
+            Container &Get() noexcept
+            {
+                return values;
+            }
+
+            /** Get the value
+             */
+            Container &operator *() noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            const Container &operator *() const noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            Container *operator ->() noexcept
+            {
+                return &values;
+            }
+
+            /** Get the values
+             */
+            const Container *operator ->() const noexcept
+            {
+                return &values;
+            }
+
+            virtual std::string Name() const override
+            {
+                return name + std::string("...");
+            }
+
+            virtual void Reset() noexcept override
+            {
+                ValueFlagBase::Reset();
+                values = defaultValues;
+            }
+
+            virtual FlagBase *Match(const EitherFlag &arg) override
+            {
+                const bool wasMatched = Matched();
+                auto me = FlagBase::Match(arg);
+                if (me && !wasMatched)
+                {
+                    values.clear();
+                }
+                return me;
+            }
+
+            iterator begin() noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator begin() const noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator cbegin() const noexcept
+            {
+                return values.cbegin();
+            }
+
+            iterator end() noexcept
+            {
+                return values.end();
+            }
+
+            const_iterator end() const noexcept 
+            {
+                return values.end();
+            }
+
+            const_iterator cend() const noexcept
+            {
+                return values.cend();
+            }
+    };
+
+    /** A mapping value flag class
+     * 
+     * \tparam K the type to extract the argument as
+     * \tparam T the type to store the result as
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     * \tparam Map The Map type.  Should operate like std::map or std::unordered_map
+     */
+    template <
+        typename K,
+        typename T,
+        typename Reader = ValueReader,
+        template <typename...> class Map = detail::unordered_map>
+    class MapFlag : public ValueFlagBase
+    {
+        private:
+            const Map<K, T> map;
+            T value;
+            const T defaultValue;
+            Reader reader;
+
+        protected:
+            virtual std::vector<std::string> GetChoicesStrings(const HelpParams &) const override
+            {
+                return detail::MapKeysToStrings(map);
+            }
+
+        public:
+
+            MapFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const Map<K, T> &map_, const T &defaultValue_, Options options_): ValueFlagBase(name_, help_, std::move(matcher_), options_), map(map_), value(defaultValue_), defaultValue(defaultValue_)
+            {
+                group_.Add(*this);
+            }
+
+            MapFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const Map<K, T> &map_, const T &defaultValue_ = T(), const bool extraError_ = false): MapFlag(group_, name_, help_, std::move(matcher_), map_, defaultValue_, extraError_ ? Options::Single : Options::None)
+            {
+            }
+
+            MapFlag(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const Map<K, T> &map_, Options options_): MapFlag(group_, name_, help_, std::move(matcher_), map_, T(), options_)
+            {
+            }
+
+            virtual ~MapFlag() {}
+
+            virtual void ParseValue(const std::vector<std::string> &values_) override
+            {
+                const std::string &value_ = values_.at(0);
+
+                K key;
+#ifdef ARGS_NOEXCEPT
+                if (!reader(name, value_, key))
+                {
+                    error = Error::Parse;
+                }
+#else
+                reader(name, value_, key);
+#endif
+                auto it = map.find(key);
+                if (it == std::end(map))
+                {
+                    std::ostringstream problem;
+                    problem << "Could not find key '" << key << "' in map for arg '" << name << "'";
+#ifdef ARGS_NOEXCEPT
+                    error = Error::Map;
+                    errorMsg = problem.str();
+#else
+                    throw MapError(problem.str());
+#endif
+                } else
+                {
+                    this->value = it->second;
+                }
+            }
+
+            /** Get the value
+             */
+            T &Get() noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            T &operator *() noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            const T &operator *() const noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            T *operator ->() noexcept
+            {
+                return &value;
+            }
+
+            /** Get the value
+             */
+            const T *operator ->() const noexcept
+            {
+                return &value;
+            }
+
+            virtual void Reset() noexcept override
+            {
+                ValueFlagBase::Reset();
+                value = defaultValue;
+            }
+    };
+
+    /** A mapping value flag list class
+     * 
+     * \tparam K the type to extract the argument as
+     * \tparam T the type to store the result as
+     * \tparam List the list type that houses the values
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     * \tparam Map The Map type.  Should operate like std::map or std::unordered_map
+     */
+    template <
+        typename K,
+        typename T,
+        template <typename...> class List = detail::vector,
+        typename Reader = ValueReader,
+        template <typename...> class Map = detail::unordered_map>
+    class MapFlagList : public ValueFlagBase
+    {
+        private:
+            using Container = List<T>;
+            const Map<K, T> map;
+            Container values;
+            const Container defaultValues;
+            Reader reader;
+
+        protected:
+            virtual std::vector<std::string> GetChoicesStrings(const HelpParams &) const override
+            {
+                return detail::MapKeysToStrings(map);
+            }
+
+        public:
+            typedef T value_type;
+            typedef typename Container::allocator_type allocator_type;
+            typedef typename Container::pointer pointer;
+            typedef typename Container::const_pointer const_pointer;
+            typedef T& reference;
+            typedef const T& const_reference;
+            typedef typename Container::size_type size_type;
+            typedef typename Container::difference_type difference_type;
+            typedef typename Container::iterator iterator;
+            typedef typename Container::const_iterator const_iterator;
+            typedef std::reverse_iterator<iterator> reverse_iterator;
+            typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+            MapFlagList(Group &group_, const std::string &name_, const std::string &help_, Matcher &&matcher_, const Map<K, T> &map_, const Container &defaultValues_ = Container()): ValueFlagBase(name_, help_, std::move(matcher_)), map(map_), values(defaultValues_), defaultValues(defaultValues_)
+            {
+                group_.Add(*this);
+            }
+
+            virtual ~MapFlagList() {}
+
+            virtual void ParseValue(const std::vector<std::string> &values_) override
+            {
+                const std::string &value = values_.at(0);
+
+                K key;
+#ifdef ARGS_NOEXCEPT
+                if (!reader(name, value, key))
+                {
+                    error = Error::Parse;
+                }
+#else
+                reader(name, value, key);
+#endif
+                auto it = map.find(key);
+                if (it == std::end(map))
+                {
+                    std::ostringstream problem;
+                    problem << "Could not find key '" << key << "' in map for arg '" << name << "'";
+#ifdef ARGS_NOEXCEPT
+                    error = Error::Map;
+                    errorMsg = problem.str();
+#else
+                    throw MapError(problem.str());
+#endif
+                } else
+                {
+                    this->values.emplace_back(it->second);
+                }
+            }
+
+            /** Get the value
+             */
+            Container &Get() noexcept
+            {
+                return values;
+            }
+
+            /** Get the value
+             */
+            Container &operator *() noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            const Container &operator *() const noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            Container *operator ->() noexcept
+            {
+                return &values;
+            }
+
+            /** Get the values
+             */
+            const Container *operator ->() const noexcept
+            {
+                return &values;
+            }
+
+            virtual std::string Name() const override
+            {
+                return name + std::string("...");
+            }
+
+            virtual void Reset() noexcept override
+            {
+                ValueFlagBase::Reset();
+                values = defaultValues;
+            }
+
+            virtual FlagBase *Match(const EitherFlag &arg) override
+            {
+                const bool wasMatched = Matched();
+                auto me = FlagBase::Match(arg);
+                if (me && !wasMatched)
+                {
+                    values.clear();
+                }
+                return me;
+            }
+
+            iterator begin() noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator begin() const noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator cbegin() const noexcept
+            {
+                return values.cbegin();
+            }
+
+            iterator end() noexcept
+            {
+                return values.end();
+            }
+
+            const_iterator end() const noexcept 
+            {
+                return values.end();
+            }
+
+            const_iterator cend() const noexcept
+            {
+                return values.cend();
+            }
+    };
+
+    /** A positional argument class
+     *
+     * \tparam T the type to extract the argument as
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     */
+    template <
+        typename T,
+        typename Reader = ValueReader>
+    class Positional : public PositionalBase
+    {
+        private:
+            T value;
+            const T defaultValue;
+            Reader reader;
+        public:
+            Positional(Group &group_, const std::string &name_, const std::string &help_, const T &defaultValue_ = T(), Options options_ = {}): PositionalBase(name_, help_, options_), value(defaultValue_), defaultValue(defaultValue_)
+            {
+                group_.Add(*this);
+            }
+
+            Positional(Group &group_, const std::string &name_, const std::string &help_, Options options_): Positional(group_, name_, help_, T(), options_)
+            {
+            }
+
+            virtual ~Positional() {}
+
+            virtual void ParseValue(const std::string &value_) override
+            {
+#ifdef ARGS_NOEXCEPT
+                if (!reader(name, value_, this->value))
+                {
+                    error = Error::Parse;
+                }
+#else
+                reader(name, value_, this->value);
+#endif
+                ready = false;
+                matched = true;
+            }
+
+            /** Get the value
+             */
+            T &Get() noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            T &operator *() noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            const T &operator *() const noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            T *operator ->() noexcept
+            {
+                return &value;
+            }
+
+            /** Get the value
+             */
+            const T *operator ->() const noexcept
+            {
+                return &value;
+            }
+
+            virtual void Reset() noexcept override
+            {
+                PositionalBase::Reset();
+                value = defaultValue;
+            }
+    };
+
+    /** A positional argument class that pushes the found values into a list
+     * 
+     * \tparam T the type to extract the argument as
+     * \tparam List the list type that houses the values
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     */
+    template <
+        typename T,
+        template <typename...> class List = detail::vector,
+        typename Reader = ValueReader>
+    class PositionalList : public PositionalBase
+    {
+        private:
+            using Container = List<T>;
+            Container values;
+            const Container defaultValues;
+            Reader reader;
+
+        public:
+            typedef T value_type;
+            typedef typename Container::allocator_type allocator_type;
+            typedef typename Container::pointer pointer;
+            typedef typename Container::const_pointer const_pointer;
+            typedef T& reference;
+            typedef const T& const_reference;
+            typedef typename Container::size_type size_type;
+            typedef typename Container::difference_type difference_type;
+            typedef typename Container::iterator iterator;
+            typedef typename Container::const_iterator const_iterator;
+            typedef std::reverse_iterator<iterator> reverse_iterator;
+            typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+            PositionalList(Group &group_, const std::string &name_, const std::string &help_, const Container &defaultValues_ = Container(), Options options_ = {}): PositionalBase(name_, help_, options_), values(defaultValues_), defaultValues(defaultValues_)
+            {
+                group_.Add(*this);
+            }
+
+            PositionalList(Group &group_, const std::string &name_, const std::string &help_, Options options_): PositionalList(group_, name_, help_, {}, options_)
+            {
+            }
+
+            virtual ~PositionalList() {}
+
+            virtual void ParseValue(const std::string &value_) override
+            {
+                T v;
+#ifdef ARGS_NOEXCEPT
+                if (!reader(name, value_, v))
+                {
+                    error = Error::Parse;
+                }
+#else
+                reader(name, value_, v);
+#endif
+                values.insert(std::end(values), v);
+                matched = true;
+            }
+
+            virtual std::string Name() const override
+            {
+                return name + std::string("...");
+            }
+
+            /** Get the values
+             */
+            Container &Get() noexcept
+            {
+                return values;
+            }
+
+            /** Get the value
+             */
+            Container &operator *() noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            const Container &operator *() const noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            Container *operator ->() noexcept
+            {
+                return &values;
+            }
+
+            /** Get the values
+             */
+            const Container *operator ->() const noexcept
+            {
+                return &values;
+            }
+
+            virtual void Reset() noexcept override
+            {
+                PositionalBase::Reset();
+                values = defaultValues;
+            }
+
+            virtual PositionalBase *GetNextPositional() override
+            {
+                const bool wasMatched = Matched();
+                auto me = PositionalBase::GetNextPositional();
+                if (me && !wasMatched)
+                {
+                    values.clear();
+                }
+                return me;
+            }
+
+            iterator begin() noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator begin() const noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator cbegin() const noexcept
+            {
+                return values.cbegin();
+            }
+
+            iterator end() noexcept
+            {
+                return values.end();
+            }
+
+            const_iterator end() const noexcept 
+            {
+                return values.end();
+            }
+
+            const_iterator cend() const noexcept
+            {
+                return values.cend();
+            }
+    };
+
+    /** A positional argument mapping class
+     * 
+     * \tparam K the type to extract the argument as
+     * \tparam T the type to store the result as
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     * \tparam Map The Map type.  Should operate like std::map or std::unordered_map
+     */
+    template <
+        typename K,
+        typename T,
+        typename Reader = ValueReader,
+        template <typename...> class Map = detail::unordered_map>
+    class MapPositional : public PositionalBase
+    {
+        private:
+            const Map<K, T> map;
+            T value;
+            const T defaultValue;
+            Reader reader;
+
+        protected:
+            virtual std::vector<std::string> GetChoicesStrings(const HelpParams &) const override
+            {
+                return detail::MapKeysToStrings(map);
+            }
+
+        public:
+
+            MapPositional(Group &group_, const std::string &name_, const std::string &help_, const Map<K, T> &map_, const T &defaultValue_ = T(), Options options_ = {}):
+                PositionalBase(name_, help_, options_), map(map_), value(defaultValue_), defaultValue(defaultValue_)
+            {
+                group_.Add(*this);
+            }
+
+            virtual ~MapPositional() {}
+
+            virtual void ParseValue(const std::string &value_) override
+            {
+                K key;
+#ifdef ARGS_NOEXCEPT
+                if (!reader(name, value_, key))
+                {
+                    error = Error::Parse;
+                }
+#else
+                reader(name, value_, key);
+#endif
+                auto it = map.find(key);
+                if (it == std::end(map))
+                {
+                    std::ostringstream problem;
+                    problem << "Could not find key '" << key << "' in map for arg '" << name << "'";
+#ifdef ARGS_NOEXCEPT
+                    error = Error::Map;
+                    errorMsg = problem.str();
+#else
+                    throw MapError(problem.str());
+#endif
+                } else
+                {
+                    this->value = it->second;
+                    ready = false;
+                    matched = true;
+                }
+            }
+
+            /** Get the value
+             */
+            T &Get() noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            T &operator *() noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            const T &operator *() const noexcept
+            {
+                return value;
+            }
+
+            /** Get the value
+             */
+            T *operator ->() noexcept
+            {
+                return &value;
+            }
+
+            /** Get the value
+             */
+            const T *operator ->() const noexcept
+            {
+                return &value;
+            }
+
+            virtual void Reset() noexcept override
+            {
+                PositionalBase::Reset();
+                value = defaultValue;
+            }
+    };
+
+    /** A positional argument mapping list class
+     * 
+     * \tparam K the type to extract the argument as
+     * \tparam T the type to store the result as
+     * \tparam List the list type that houses the values
+     * \tparam Reader The functor type used to read the argument, taking the name, value, and destination reference with operator(), and returning a bool (if ARGS_NOEXCEPT is defined)
+     * \tparam Map The Map type.  Should operate like std::map or std::unordered_map
+     */
+    template <
+        typename K,
+        typename T,
+        template <typename...> class List = detail::vector,
+        typename Reader = ValueReader,
+        template <typename...> class Map = detail::unordered_map>
+    class MapPositionalList : public PositionalBase
+    {
+        private:
+            using Container = List<T>;
+
+            const Map<K, T> map;
+            Container values;
+            const Container defaultValues;
+            Reader reader;
+
+        protected:
+            virtual std::vector<std::string> GetChoicesStrings(const HelpParams &) const override
+            {
+                return detail::MapKeysToStrings(map);
+            }
+
+        public:
+            typedef T value_type;
+            typedef typename Container::allocator_type allocator_type;
+            typedef typename Container::pointer pointer;
+            typedef typename Container::const_pointer const_pointer;
+            typedef T& reference;
+            typedef const T& const_reference;
+            typedef typename Container::size_type size_type;
+            typedef typename Container::difference_type difference_type;
+            typedef typename Container::iterator iterator;
+            typedef typename Container::const_iterator const_iterator;
+            typedef std::reverse_iterator<iterator> reverse_iterator;
+            typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+            MapPositionalList(Group &group_, const std::string &name_, const std::string &help_, const Map<K, T> &map_, const Container &defaultValues_ = Container(), Options options_ = {}):
+                PositionalBase(name_, help_, options_), map(map_), values(defaultValues_), defaultValues(defaultValues_)
+            {
+                group_.Add(*this);
+            }
+
+            virtual ~MapPositionalList() {}
+
+            virtual void ParseValue(const std::string &value_) override
+            {
+                K key;
+#ifdef ARGS_NOEXCEPT
+                if (!reader(name, value_, key))
+                {
+                    error = Error::Parse;
+                }
+#else
+                reader(name, value_, key);
+#endif
+                auto it = map.find(key);
+                if (it == std::end(map))
+                {
+                    std::ostringstream problem;
+                    problem << "Could not find key '" << key << "' in map for arg '" << name << "'";
+#ifdef ARGS_NOEXCEPT
+                    error = Error::Map;
+                    errorMsg = problem.str();
+#else
+                    throw MapError(problem.str());
+#endif
+                } else
+                {
+                    this->values.emplace_back(it->second);
+                    matched = true;
+                }
+            }
+
+            /** Get the value
+             */
+            Container &Get() noexcept
+            {
+                return values;
+            }
+
+            /** Get the value
+             */
+            Container &operator *() noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            const Container &operator *() const noexcept
+            {
+                return values;
+            }
+
+            /** Get the values
+             */
+            Container *operator ->() noexcept
+            {
+                return &values;
+            }
+
+            /** Get the values
+             */
+            const Container *operator ->() const noexcept
+            {
+                return &values;
+            }
+
+            virtual std::string Name() const override
+            {
+                return name + std::string("...");
+            }
+
+            virtual void Reset() noexcept override
+            {
+                PositionalBase::Reset();
+                values = defaultValues;
+            }
+
+            virtual PositionalBase *GetNextPositional() override
+            {
+                const bool wasMatched = Matched();
+                auto me = PositionalBase::GetNextPositional();
+                if (me && !wasMatched)
+                {
+                    values.clear();
+                }
+                return me;
+            }
+
+            iterator begin() noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator begin() const noexcept
+            {
+                return values.begin();
+            }
+
+            const_iterator cbegin() const noexcept
+            {
+                return values.cbegin();
+            }
+
+            iterator end() noexcept
+            {
+                return values.end();
+            }
+
+            const_iterator end() const noexcept 
+            {
+                return values.end();
+            }
+
+            const_iterator cend() const noexcept
+            {
+                return values.cend();
+            }
+    };
+}
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/CMakeLists.txt
new file mode 100644
index 0000000000..18867e8dc3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/CMakeLists.txt
@@ -0,0 +1,7 @@
+add_library(thrift
+        STATIC
+        protocol/TProtocol.cpp
+        transport/TTransportException.cpp
+        transport/TBufferTransports.cpp)
+
+target_include_directories(thrift PUBLIC ./include)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/LICENSE
new file mode 100644
index 0000000000..3b6d7d74cc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/LICENSE
@@ -0,0 +1,239 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+
+--------------------------------------------------
+SOFTWARE DISTRIBUTED WITH THRIFT:
+
+The Apache Thrift software includes a number of subcomponents with
+separate copyright notices and license terms. Your use of the source
+code for the these subcomponents is subject to the terms and
+conditions of the following licenses.
+
+--------------------------------------------------
+Portions of the following files are licensed under the MIT License:
+
+  lib/erl/src/Makefile.am
+
+Please see doc/otp-base-license.txt for the full terms of this license.
+
+--------------------------------------------------
+For the aclocal/ax_boost_base.m4 and contrib/fb303/aclocal/ax_boost_base.m4 components:
+
+#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
+#
+#   Copying and distribution of this file, with or without
+#   modification, are permitted in any medium without royalty provided
+#   the copyright notice and this notice are preserved.
+
+--------------------------------------------------
+For the lib/nodejs/lib/thrift/json_parse.js:
+
+/*
+    json_parse.js
+    2015-05-02
+    Public Domain.
+    NO WARRANTY EXPRESSED OR IMPLIED. USE AT YOUR OWN RISK.
+
+*/
+(By Douglas Crockford <douglas@crockford.com>)
+--------------------------------------------------
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TApplicationException.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TApplicationException.h
new file mode 100644
index 0000000000..eb74a4bb5b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TApplicationException.h
@@ -0,0 +1,112 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_TAPPLICATIONEXCEPTION_H_
+#define _LBUG_THRIFT_TAPPLICATIONEXCEPTION_H_ 1
+
+#include "Thrift.h"
+
+namespace lbug_apache {
+namespace thrift {
+
+namespace protocol {
+class TProtocol;
+}
+
+class TApplicationException : public TException {
+public:
+  /**
+   * Error codes for the various types of exceptions.
+   */
+  enum TApplicationExceptionType {
+    UNKNOWN = 0,
+    UNKNOWN_METHOD = 1,
+    INVALID_MESSAGE_TYPE = 2,
+    WRONG_METHOD_NAME = 3,
+    BAD_SEQUENCE_ID = 4,
+    MISSING_RESULT = 5,
+    INTERNAL_ERROR = 6,
+    PROTOCOL_ERROR = 7,
+    INVALID_TRANSFORM = 8,
+    INVALID_PROTOCOL = 9,
+    UNSUPPORTED_CLIENT_TYPE = 10
+  };
+
+  TApplicationException() : TException(), type_(UNKNOWN) {}
+
+  TApplicationException(TApplicationExceptionType type) : TException(), type_(type) {}
+
+  TApplicationException(const std::string& message) : TException(message), type_(UNKNOWN) {}
+
+  TApplicationException(TApplicationExceptionType type, const std::string& message)
+    : TException(message), type_(type) {}
+
+  ~TApplicationException() noexcept override = default;
+
+  /**
+   * Returns an error code that provides information about the type of error
+   * that has occurred.
+   *
+   * @return Error code
+   */
+  TApplicationExceptionType getType() const { return type_; }
+
+  const char* what() const noexcept override {
+    if (message_.empty()) {
+      switch (type_) {
+      case UNKNOWN:
+        return "TApplicationException: Unknown application exception";
+      case UNKNOWN_METHOD:
+        return "TApplicationException: Unknown method";
+      case INVALID_MESSAGE_TYPE:
+        return "TApplicationException: Invalid message type";
+      case WRONG_METHOD_NAME:
+        return "TApplicationException: Wrong method name";
+      case BAD_SEQUENCE_ID:
+        return "TApplicationException: Bad sequence identifier";
+      case MISSING_RESULT:
+        return "TApplicationException: Missing result";
+      case INTERNAL_ERROR:
+        return "TApplicationException: Internal error";
+      case PROTOCOL_ERROR:
+        return "TApplicationException: Protocol error";
+      case INVALID_TRANSFORM:
+        return "TApplicationException: Invalid transform";
+      case INVALID_PROTOCOL:
+        return "TApplicationException: Invalid protocol";
+      case UNSUPPORTED_CLIENT_TYPE:
+        return "TApplicationException: Unsupported client type";
+      default:
+        return "TApplicationException: (Invalid exception type)";
+      };
+    } else {
+      return message_.c_str();
+    }
+  }
+
+protected:
+  /**
+   * Error code
+   */
+  TApplicationExceptionType type_;
+};
+}
+} // lbug_apache::thrift
+
+#endif // #ifndef _LBUG_THRIFT_TAPPLICATIONEXCEPTION_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TBase.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TBase.h
new file mode 100755
index 0000000000..40dfc77b51
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TBase.h
@@ -0,0 +1,38 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_TBASE_H_
+#define _LBUG_THRIFT_TBASE_H_ 1
+
+#include "Thrift.h"
+#include "protocol/TProtocol.h"
+
+namespace lbug_apache {
+namespace thrift {
+
+class TBase {
+public:
+  virtual ~TBase() = default;
+  virtual uint32_t read(protocol::TProtocol* iprot) = 0;
+  virtual uint32_t write(protocol::TProtocol* oprot) const = 0;
+};
+}
+} // lbug_apache::thrift
+
+#endif // #ifndef _LBUG_THRIFT_TBASE_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TLogging.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TLogging.h
new file mode 100755
index 0000000000..dc4a0806c5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TLogging.h
@@ -0,0 +1,145 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_TLOGGING_H_
+#define _LBUG_THRIFT_TLOGGING_H_ 1
+
+#include "thrift-config.h"
+
+/**
+ * Contains utility macros for debugging and logging.
+ *
+ */
+
+#include <time.h>
+
+#ifdef HAVE_STDINT_H
+#include <stdint.h>
+#endif
+
+/**
+ * T_GLOBAL_DEBUGGING_LEVEL = 0: all debugging turned off, debug macros undefined
+ * T_GLOBAL_DEBUGGING_LEVEL = 1: all debugging turned on
+ */
+#define T_GLOBAL_DEBUGGING_LEVEL 0
+
+/**
+ * T_GLOBAL_LOGGING_LEVEL = 0: all logging turned off, logging macros undefined
+ * T_GLOBAL_LOGGING_LEVEL = 1: all logging turned on
+ */
+#define T_GLOBAL_LOGGING_LEVEL 0
+
+/**
+ * Standard wrapper around fprintf what will prefix the file name and line
+ * number to the line. Uses T_GLOBAL_DEBUGGING_LEVEL to control whether it is
+ * turned on or off.
+ *
+ * @param format_string
+ */
+#if T_GLOBAL_DEBUGGING_LEVEL > 0
+#define T_DEBUG(format_string, ...)                                                                \
+  if (T_GLOBAL_DEBUGGING_LEVEL > 0) {                                                              \
+    fprintf(stderr, "[%s,%d] " format_string " \n", __FILE__, __LINE__, ##__VA_ARGS__);            \
+  }
+#else
+#define T_DEBUG(format_string, ...)
+#endif
+
+/**
+ * analogous to T_DEBUG but also prints the time
+ *
+ * @param string  format_string input: printf style format string
+ */
+#if T_GLOBAL_DEBUGGING_LEVEL > 0
+#define T_DEBUG_T(format_string, ...)                                                              \
+  {                                                                                                \
+    if (T_GLOBAL_DEBUGGING_LEVEL > 0) {                                                            \
+      time_t now;                                                                                  \
+      char dbgtime[26];                                                                            \
+      time(&now);                                                                                  \
+      THRIFT_CTIME_R(&now, dbgtime);                                                               \
+      dbgtime[24] = '\0';                                                                          \
+      fprintf(stderr,                                                                              \
+              "[%s,%d] [%s] " format_string " \n",                                                 \
+              __FILE__,                                                                            \
+              __LINE__,                                                                            \
+              dbgtime,                                                                             \
+              ##__VA_ARGS__);                                                                      \
+    }                                                                                              \
+  }
+#else
+#define T_DEBUG_T(format_string, ...)
+#endif
+
+
+
+
+
+/**
+ * Log input message
+ *
+ * @param string  format_string input: printf style format string
+ */
+#if T_GLOBAL_LOGGING_LEVEL > 0
+#define T_LOG_OPER(format_string, ...)                                                             \
+  {                                                                                                \
+    if (T_GLOBAL_LOGGING_LEVEL > 0) {                                                              \
+      time_t now;                                                                                  \
+      char dbgtime[26];                                                                            \
+      time(&now);                                                                                  \
+      THRIFT_CTIME_R(&now, dbgtime);                                                               \
+      dbgtime[24] = '\0';                                                                          \
+      fprintf(stderr, "[%s] " format_string " \n", dbgtime, ##__VA_ARGS__);                        \
+    }                                                                                              \
+  }
+#else
+#define T_LOG_OPER(format_string, ...)
+#endif
+
+/**
+ * T_GLOBAL_DEBUG_VIRTUAL = 0 or unset: normal operation,
+ *                                      virtual call debug messages disabled
+ * T_GLOBAL_DEBUG_VIRTUAL = 1:          log a debug messages whenever an
+ *                                      avoidable virtual call is made
+ * T_GLOBAL_DEBUG_VIRTUAL = 2:          record detailed info that can be
+ *                                      printed by calling
+ *                                      lbug_apache::thrift::profile_print_info()
+ */
+#if T_GLOBAL_DEBUG_VIRTUAL > 1
+#define T_VIRTUAL_CALL() ::lbug_apache::thrift::profile_virtual_call(typeid(*this))
+#define T_GENERIC_PROTOCOL(template_class, generic_prot, specific_prot)                            \
+  do {                                                                                             \
+    if (!(specific_prot)) {                                                                        \
+      ::lbug_apache::thrift::profile_generic_protocol(typeid(*template_class), typeid(*generic_prot));  \
+    }                                                                                              \
+  } while (0)
+#elif T_GLOBAL_DEBUG_VIRTUAL == 1
+#define T_VIRTUAL_CALL() fprintf(stderr, "[%s,%d] virtual call\n", __FILE__, __LINE__)
+#define T_GENERIC_PROTOCOL(template_class, generic_prot, specific_prot)                            \
+  do {                                                                                             \
+    if (!(specific_prot)) {                                                                        \
+      fprintf(stderr, "[%s,%d] failed to cast to specific protocol type\n", __FILE__, __LINE__);   \
+    }                                                                                              \
+  } while (0)
+#else
+#define T_VIRTUAL_CALL()
+#define T_GENERIC_PROTOCOL(template_class, generic_prot, specific_prot)
+#endif
+
+#endif // #ifndef _LBUG_THRIFT_TLOGGING_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TToString.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TToString.h
new file mode 100755
index 0000000000..58325f8283
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/TToString.h
@@ -0,0 +1,113 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_TOSTRING_H_
+#define _LBUG_THRIFT_TOSTRING_H_ 1
+
+#include <cmath>
+#include <limits>
+#include <map>
+#include <set>
+#include <sstream>
+#include <string>
+
+namespace lbug_apache {
+namespace thrift {
+
+template <typename T>
+std::string to_string(const T& t) {
+  std::ostringstream o;
+  o << t;
+  return o.str();
+}
+
+// TODO: replace the computations below with std::numeric_limits::max_digits10 once C++11
+// is enabled.
+inline std::string to_string(const float& t) {
+  std::ostringstream o;
+  o.precision(static_cast<std::streamsize>(std::ceil(static_cast<double>(std::numeric_limits<float>::digits * std::log10(2.0f) + 1))));
+  o << t;
+  return o.str();
+}
+
+inline std::string to_string(const double& t) {
+  std::ostringstream o;
+  o.precision(static_cast<std::streamsize>(std::ceil(static_cast<double>(std::numeric_limits<double>::digits * std::log10(2.0f) + 1))));
+  o << t;
+  return o.str();
+}
+
+inline std::string to_string(const long double& t) {
+  std::ostringstream o;
+  o.precision(static_cast<std::streamsize>(std::ceil(static_cast<double>(std::numeric_limits<long double>::digits * std::log10(2.0f) + 1))));
+  o << t;
+  return o.str();
+}
+
+template <typename K, typename V>
+std::string to_string(const std::map<K, V>& m);
+
+template <typename T>
+std::string to_string(const std::set<T>& s);
+
+template <typename T>
+std::string to_string(const std::vector<T>& t);
+
+template <typename K, typename V>
+std::string to_string(const typename std::pair<K, V>& v) {
+  std::ostringstream o;
+  o << to_string(v.first) << ": " << to_string(v.second);
+  return o.str();
+}
+
+template <typename T>
+std::string to_string(const T& beg, const T& end) {
+  std::ostringstream o;
+  for (T it = beg; it != end; ++it) {
+    if (it != beg)
+      o << ", ";
+    o << to_string(*it);
+  }
+  return o.str();
+}
+
+template <typename T>
+std::string to_string(const std::vector<T>& t) {
+  std::ostringstream o;
+  o << "[" << to_string(t.begin(), t.end()) << "]";
+  return o.str();
+}
+
+template <typename K, typename V>
+std::string to_string(const std::map<K, V>& m) {
+  std::ostringstream o;
+  o << "{" << to_string(m.begin(), m.end()) << "}";
+  return o.str();
+}
+
+template <typename T>
+std::string to_string(const std::set<T>& s) {
+  std::ostringstream o;
+  o << "{" << to_string(s.begin(), s.end()) << "}";
+  return o.str();
+}
+}
+} // lbug_apache::thrift
+
+#endif // _LBUG_THRIFT_TOSTRING_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/Thrift.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/Thrift.h
new file mode 100755
index 0000000000..5c5abd5ea8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/Thrift.h
@@ -0,0 +1,139 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_THRIFT_H_
+#define _LBUG_THRIFT_THRIFT_H_ 1
+
+#include "transport/PlatformSocket.h"
+
+#include "thrift-config.h"
+
+#include <stdio.h>
+#include <assert.h>
+
+#include <sys/types.h>
+#ifdef HAVE_NETINET_IN_H
+#include <netinet/in.h>
+#endif
+#ifdef HAVE_INTTYPES_H
+#include <inttypes.h>
+#endif
+#include <string>
+#include <map>
+#include <list>
+#include <set>
+#include <vector>
+#include <exception>
+#include <typeinfo>
+#include <cstddef>
+
+#include "TLogging.h"
+//#include <thrift/TOutput.h>
+
+#define THRIFT_UNUSED_VARIABLE(x) ((void)(x))
+
+namespace lbug_apache {
+namespace thrift {
+
+class TEnumIterator {
+public:
+  using value_type = std::pair<int, const char*>;
+  using difference_type = std::ptrdiff_t;
+  using pointer = value_type*;
+  using reference = value_type&;
+  using iterator_category = std::forward_iterator_tag;
+
+  TEnumIterator(int n, int* enums, const char** names)
+    : ii_(0), n_(n), enums_(enums), names_(names) {}
+
+  int operator++() { return ++ii_; }
+
+  bool operator!=(const TEnumIterator& end) {
+    THRIFT_UNUSED_VARIABLE(end);
+    assert(end.n_ == -1);
+    return (ii_ != n_);
+  }
+
+  std::pair<int, const char*> operator*() const { return std::make_pair(enums_[ii_], names_[ii_]); }
+
+private:
+  int ii_;
+  const int n_;
+  int* enums_;
+  const char** names_;
+};
+
+class TException : public std::exception {
+public:
+  TException() : message_() {}
+
+  TException(const std::string& message) : message_(message) {}
+
+  ~TException() noexcept override = default;
+
+  const char* what() const noexcept override {
+    if (message_.empty()) {
+      return "Default TException.";
+    } else {
+      return message_.c_str();
+    }
+  }
+
+protected:
+  std::string message_;
+};
+
+class TDelayedException {
+public:
+  template <class E>
+  static TDelayedException* delayException(const E& e);
+  virtual void throw_it() = 0;
+  virtual ~TDelayedException() = default;
+};
+
+template <class E>
+class TExceptionWrapper : public TDelayedException {
+public:
+  TExceptionWrapper(const E& e) : e_(e) {}
+  void throw_it() override {
+    E temp(e_);
+    delete this;
+    throw temp;
+  }
+
+private:
+  E e_;
+};
+
+template <class E>
+TDelayedException* TDelayedException::delayException(const E& e) {
+  return new TExceptionWrapper<E>(e);
+}
+
+#if T_GLOBAL_DEBUG_VIRTUAL > 1
+void profile_virtual_call(const std::type_info& info);
+void profile_generic_protocol(const std::type_info& template_type, const std::type_info& prot_type);
+void profile_print_info(FILE* f);
+void profile_print_info();
+void profile_write_pprof(FILE* gen_calls_f, FILE* virtual_calls_f);
+#endif
+}
+} // lbug_apache::thrift
+
+#endif // #ifndef _LBUG_THRIFT_THRIFT_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TCompactProtocol.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TCompactProtocol.h
new file mode 100755
index 0000000000..f8e48986ed
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TCompactProtocol.h
@@ -0,0 +1,266 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_PROTOCOL_TCOMPACTPROTOCOL_H_
+#define _LBUG_THRIFT_PROTOCOL_TCOMPACTPROTOCOL_H_ 1
+
+#include "protocol/TVirtualProtocol.h"
+
+#include <stack>
+#include <memory>
+
+namespace lbug_apache {
+namespace thrift {
+namespace protocol {
+
+/**
+ * C++ Implementation of the Compact Protocol as described in THRIFT-110
+ */
+template <class Transport_>
+class TCompactProtocolT : public TVirtualProtocol<TCompactProtocolT<Transport_> > {
+public:
+  static const int8_t PROTOCOL_ID = (int8_t)0x82u;
+  static const int8_t VERSION_N = 1;
+  static const int8_t VERSION_MASK = 0x1f;       // 0001 1111
+
+protected:
+  static const int8_t TYPE_MASK = (int8_t)0xE0u; // 1110 0000
+  static const int8_t TYPE_BITS = 0x07;          // 0000 0111
+  static const int32_t TYPE_SHIFT_AMOUNT = 5;
+
+  Transport_* trans_;
+
+  /**
+   * (Writing) If we encounter a boolean field begin, save the TField here
+   * so it can have the value incorporated.
+   */
+  struct {
+    const char* name;
+    TType fieldType;
+    int16_t fieldId;
+  } booleanField_;
+
+  /**
+   * (Reading) If we read a field header, and it's a boolean field, save
+   * the boolean value here so that readBool can use it.
+   */
+  struct {
+    bool hasBoolValue;
+    bool boolValue;
+  } boolValue_;
+
+  /**
+   * Used to keep track of the last field for the current and previous structs,
+   * so we can do the delta stuff.
+   */
+
+  std::stack<int16_t> lastField_;
+  int16_t lastFieldId_;
+
+public:
+  TCompactProtocolT(std::shared_ptr<Transport_> trans)
+    : TVirtualProtocol<TCompactProtocolT<Transport_> >(trans),
+      trans_(trans.get()),
+      lastFieldId_(0),
+      string_limit_(0),
+      string_buf_(nullptr),
+      string_buf_size_(0),
+      container_limit_(0) {
+    booleanField_.name = nullptr;
+    boolValue_.hasBoolValue = false;
+  }
+
+  TCompactProtocolT(std::shared_ptr<Transport_> trans,
+                    int32_t string_limit,
+                    int32_t container_limit)
+    : TVirtualProtocol<TCompactProtocolT<Transport_> >(trans),
+      trans_(trans.get()),
+      lastFieldId_(0),
+      string_limit_(string_limit),
+      string_buf_(nullptr),
+      string_buf_size_(0),
+      container_limit_(container_limit) {
+    booleanField_.name = nullptr;
+    boolValue_.hasBoolValue = false;
+  }
+
+  ~TCompactProtocolT() override { free(string_buf_); }
+
+  /**
+   * Writing functions
+   */
+
+  virtual uint32_t writeMessageBegin(const std::string& name,
+                                     const TMessageType messageType,
+                                     const int32_t seqid);
+
+  uint32_t writeStructBegin(const char* name);
+
+  uint32_t writeStructEnd();
+
+  uint32_t writeFieldBegin(const char* name, const TType fieldType, const int16_t fieldId);
+
+  uint32_t writeFieldStop();
+
+  uint32_t writeListBegin(const TType elemType, const uint32_t size);
+
+  uint32_t writeSetBegin(const TType elemType, const uint32_t size);
+
+  virtual uint32_t writeMapBegin(const TType keyType, const TType valType, const uint32_t size);
+
+  uint32_t writeBool(const bool value);
+
+  uint32_t writeByte(const int8_t byte);
+
+  uint32_t writeI16(const int16_t i16);
+
+  uint32_t writeI32(const int32_t i32);
+
+  uint32_t writeI64(const int64_t i64);
+
+  uint32_t writeDouble(const double dub);
+
+  uint32_t writeString(const std::string& str);
+
+  uint32_t writeBinary(const std::string& str);
+
+  /**
+  * These methods are called by structs, but don't actually have any wired
+  * output or purpose
+  */
+  virtual uint32_t writeMessageEnd() { return 0; }
+  uint32_t writeMapEnd() { return 0; }
+  uint32_t writeListEnd() { return 0; }
+  uint32_t writeSetEnd() { return 0; }
+  uint32_t writeFieldEnd() { return 0; }
+
+protected:
+  int32_t writeFieldBeginInternal(const char* name,
+                                  const TType fieldType,
+                                  const int16_t fieldId,
+                                  int8_t typeOverride);
+  uint32_t writeCollectionBegin(const TType elemType, int32_t size);
+  uint32_t writeVarint32(uint32_t n);
+  uint32_t writeVarint64(uint64_t n);
+  uint64_t i64ToZigzag(const int64_t l);
+  uint32_t i32ToZigzag(const int32_t n);
+  inline int8_t getCompactType(const TType ttype);
+
+public:
+  uint32_t readMessageBegin(std::string& name, TMessageType& messageType, int32_t& seqid);
+
+  uint32_t readStructBegin(std::string& name);
+
+  uint32_t readStructEnd();
+
+  uint32_t readFieldBegin(std::string& name, TType& fieldType, int16_t& fieldId);
+
+  uint32_t readMapBegin(TType& keyType, TType& valType, uint32_t& size);
+
+  uint32_t readListBegin(TType& elemType, uint32_t& size);
+
+  uint32_t readSetBegin(TType& elemType, uint32_t& size);
+
+  uint32_t readBool(bool& value);
+  // Provide the default readBool() implementation for std::vector<bool>
+  using TVirtualProtocol<TCompactProtocolT<Transport_> >::readBool;
+
+  uint32_t readByte(int8_t& byte);
+
+  uint32_t readI16(int16_t& i16);
+
+  uint32_t readI32(int32_t& i32);
+
+  uint32_t readI64(int64_t& i64);
+
+  uint32_t readDouble(double& dub);
+
+  uint32_t readString(std::string& str);
+
+  uint32_t readBinary(std::string& str);
+
+  /*
+   *These methods are here for the struct to call, but don't have any wire
+   * encoding.
+   */
+  uint32_t readMessageEnd() { return 0; }
+  uint32_t readFieldEnd() { return 0; }
+  uint32_t readMapEnd() { return 0; }
+  uint32_t readListEnd() { return 0; }
+  uint32_t readSetEnd() { return 0; }
+
+protected:
+  uint32_t readVarint32(int32_t& i32);
+  uint32_t readVarint64(int64_t& i64);
+  int32_t zigzagToI32(uint32_t n);
+  int64_t zigzagToI64(uint64_t n);
+  TType getTType(int8_t type);
+
+  // Buffer for reading strings, save for the lifetime of the protocol to
+  // avoid memory churn allocating memory on every string read
+  int32_t string_limit_;
+  uint8_t* string_buf_;
+  int32_t string_buf_size_;
+  int32_t container_limit_;
+};
+
+typedef TCompactProtocolT<TTransport> TCompactProtocol;
+
+/**
+ * Constructs compact protocol handlers
+ */
+template <class Transport_>
+class TCompactProtocolFactoryT : public TProtocolFactory {
+public:
+  TCompactProtocolFactoryT() : string_limit_(0), container_limit_(0) {}
+
+  TCompactProtocolFactoryT(int32_t string_limit, int32_t container_limit)
+    : string_limit_(string_limit), container_limit_(container_limit) {}
+
+  ~TCompactProtocolFactoryT() override = default;
+
+  void setStringSizeLimit(int32_t string_limit) { string_limit_ = string_limit; }
+
+  void setContainerSizeLimit(int32_t container_limit) { container_limit_ = container_limit; }
+
+  std::shared_ptr<TProtocol> getProtocol(std::shared_ptr<TTransport> trans) override {
+    std::shared_ptr<Transport_> specific_trans = std::static_pointer_cast<Transport_>(trans);
+    TProtocol* prot;
+    if (specific_trans) {
+      prot = new TCompactProtocolT<Transport_>(specific_trans, string_limit_, container_limit_);
+    } else {
+      prot = new TCompactProtocol(trans, string_limit_, container_limit_);
+    }
+
+    return std::shared_ptr<TProtocol>(prot);
+  }
+
+private:
+  int32_t string_limit_;
+  int32_t container_limit_;
+};
+
+typedef TCompactProtocolFactoryT<TTransport> TCompactProtocolFactory;
+}
+}
+} // lbug_apache::thrift::protocol
+
+#include "protocol/TCompactProtocol.tcc"
+
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TCompactProtocol.tcc b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TCompactProtocol.tcc
new file mode 100644
index 0000000000..8dc635a2a9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TCompactProtocol.tcc
@@ -0,0 +1,826 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+#ifndef _LBUG_THRIFT_PROTOCOL_TCOMPACTPROTOCOL_TCC_
+#define _LBUG_THRIFT_PROTOCOL_TCOMPACTPROTOCOL_TCC_ 1
+
+#include <limits>
+
+/*
+ * TCompactProtocol::i*ToZigzag depend on the fact that the right shift
+ * operator on a signed integer is an arithmetic (sign-extending) shift.
+ * If this is not the case, the current implementation will not work.
+ * If anyone encounters this error, we can try to figure out the best
+ * way to implement an arithmetic right shift on their platform.
+ */
+#if !defined(SIGNED_RIGHT_SHIFT_IS) || !defined(ARITHMETIC_RIGHT_SHIFT)
+# error "Unable to determine the behavior of a signed right shift"
+#endif
+#if SIGNED_RIGHT_SHIFT_IS != ARITHMETIC_RIGHT_SHIFT
+# error "TCompactProtocol currently only works if a signed right shift is arithmetic"
+#endif
+
+#ifndef UNLIKELY
+#ifdef __GNUC__
+#define UNLIKELY(val) (__builtin_expect((val), 0))
+#else
+#define UNLIKELY(val) (val)
+#endif
+#endif
+
+namespace lbug_apache { namespace thrift { namespace protocol {
+
+namespace detail { namespace compact {
+
+enum Types {
+  CT_STOP           = 0x00,
+  CT_BOOLEAN_TRUE   = 0x01,
+  CT_BOOLEAN_FALSE  = 0x02,
+  CT_BYTE           = 0x03,
+  CT_I16            = 0x04,
+  CT_I32            = 0x05,
+  CT_I64            = 0x06,
+  CT_DOUBLE         = 0x07,
+  CT_BINARY         = 0x08,
+  CT_LIST           = 0x09,
+  CT_SET            = 0x0A,
+  CT_MAP            = 0x0B,
+  CT_STRUCT         = 0x0C
+};
+
+const int8_t TTypeToCType[16] = {
+  CT_STOP, // T_STOP
+  0, // unused
+  CT_BOOLEAN_TRUE, // T_BOOL
+  CT_BYTE, // T_BYTE
+  CT_DOUBLE, // T_DOUBLE
+  0, // unused
+  CT_I16, // T_I16
+  0, // unused
+  CT_I32, // T_I32
+  0, // unused
+  CT_I64, // T_I64
+  CT_BINARY, // T_STRING
+  CT_STRUCT, // T_STRUCT
+  CT_MAP, // T_MAP
+  CT_SET, // T_SET
+  CT_LIST, // T_LIST
+};
+
+}} // end detail::compact namespace
+
+
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeMessageBegin(
+    const std::string& name,
+    const TMessageType messageType,
+    const int32_t seqid) {
+  uint32_t wsize = 0;
+  wsize += writeByte(PROTOCOL_ID);
+  wsize += writeByte((VERSION_N & VERSION_MASK) | (((int32_t)messageType << TYPE_SHIFT_AMOUNT) & TYPE_MASK));
+  wsize += writeVarint32(seqid);
+  wsize += writeString(name);
+  return wsize;
+}
+
+/**
+ * Write a field header containing the field id and field type. If the
+ * difference between the current field id and the last one is small (< 15),
+ * then the field id will be encoded in the 4 MSB as a delta. Otherwise, the
+ * field id will follow the type header as a zigzag varint.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeFieldBegin(const char* name,
+                                                        const TType fieldType,
+                                                        const int16_t fieldId) {
+  if (fieldType == T_BOOL) {
+    booleanField_.name = name;
+    booleanField_.fieldType = fieldType;
+    booleanField_.fieldId = fieldId;
+  } else {
+    return writeFieldBeginInternal(name, fieldType, fieldId, -1);
+  }
+  return 0;
+}
+
+/**
+ * Write the STOP symbol so we know there are no more fields in this struct.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeFieldStop() {
+  return writeByte(T_STOP);
+}
+
+/**
+ * Write a struct begin. This doesn't actually put anything on the wire. We
+ * use it as an opportunity to put special placeholder markers on the field
+ * stack so we can get the field id deltas correct.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeStructBegin(const char* name) {
+  (void) name;
+  lastField_.push(lastFieldId_);
+  lastFieldId_ = 0;
+  return 0;
+}
+
+/**
+ * Write a struct end. This doesn't actually put anything on the wire. We use
+ * this as an opportunity to pop the last field from the current struct off
+ * of the field stack.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeStructEnd() {
+  lastFieldId_ = lastField_.top();
+  lastField_.pop();
+  return 0;
+}
+
+/**
+ * Write a List header.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeListBegin(const TType elemType,
+                                                       const uint32_t size) {
+  return writeCollectionBegin(elemType, size);
+}
+
+/**
+ * Write a set header.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeSetBegin(const TType elemType,
+                                                      const uint32_t size) {
+  return writeCollectionBegin(elemType, size);
+}
+
+/**
+ * Write a map header. If the map is empty, omit the key and value type
+ * headers, as we don't need any additional information to skip it.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeMapBegin(const TType keyType,
+                                                      const TType valType,
+                                                      const uint32_t size) {
+  uint32_t wsize = 0;
+
+  if (size == 0) {
+    wsize += writeByte(0);
+  } else {
+    wsize += writeVarint32(size);
+    wsize += writeByte(getCompactType(keyType) << 4 | getCompactType(valType));
+  }
+  return wsize;
+}
+
+/**
+ * Write a boolean value. Potentially, this could be a boolean field, in
+ * which case the field header info isn't written yet. If so, decide what the
+ * right type header is for the value and then write the field header.
+ * Otherwise, write a single byte.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeBool(const bool value) {
+  uint32_t wsize = 0;
+
+  if (booleanField_.name != NULL) {
+    // we haven't written the field header yet
+    wsize
+      += writeFieldBeginInternal(booleanField_.name,
+                                 booleanField_.fieldType,
+                                 booleanField_.fieldId,
+                                 static_cast<int8_t>(value
+                                                     ? detail::compact::CT_BOOLEAN_TRUE
+                                                     : detail::compact::CT_BOOLEAN_FALSE));
+    booleanField_.name = NULL;
+  } else {
+    // we're not part of a field, so just write the value
+    wsize
+      += writeByte(static_cast<int8_t>(value
+                                       ? detail::compact::CT_BOOLEAN_TRUE
+                                       : detail::compact::CT_BOOLEAN_FALSE));
+  }
+  return wsize;
+}
+
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeByte(const int8_t byte) {
+  trans_->write((uint8_t*)&byte, 1);
+  return 1;
+}
+
+/**
+ * Write an i16 as a zigzag varint.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeI16(const int16_t i16) {
+  return writeVarint32(i32ToZigzag(i16));
+}
+
+/**
+ * Write an i32 as a zigzag varint.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeI32(const int32_t i32) {
+  return writeVarint32(i32ToZigzag(i32));
+}
+
+/**
+ * Write an i64 as a zigzag varint.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeI64(const int64_t i64) {
+  return writeVarint64(i64ToZigzag(i64));
+}
+
+/**
+ * Write a double to the wire as 8 bytes.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeDouble(const double dub) {
+  //BOOST_STATIC_ASSERT(sizeof(double) == sizeof(uint64_t));
+  //BOOST_STATIC_ASSERT(std::numeric_limits<double>::is_iec559);
+
+  uint64_t bits = bitwise_cast<uint64_t>(dub);
+  bits = THRIFT_htolell(bits);
+  trans_->write((uint8_t*)&bits, 8);
+  return 8;
+}
+
+/**
+ * Write a string to the wire with a varint size preceding.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeString(const std::string& str) {
+  return writeBinary(str);
+}
+
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeBinary(const std::string& str) {
+  if(str.size() > (std::numeric_limits<uint32_t>::max)())
+    throw TProtocolException(TProtocolException::SIZE_LIMIT);
+  uint32_t ssize = static_cast<uint32_t>(str.size());
+  uint32_t wsize = writeVarint32(ssize) ;
+  // checking ssize + wsize > uint_max, but we don't want to overflow while checking for overflows.
+  // transforming the check to ssize > uint_max - wsize
+  if(ssize > (std::numeric_limits<uint32_t>::max)() - wsize)
+    throw TProtocolException(TProtocolException::SIZE_LIMIT);
+  wsize += ssize;
+  trans_->write((uint8_t*)str.data(), ssize);
+  return wsize;
+}
+
+//
+// Internal Writing methods
+//
+
+/**
+ * The workhorse of writeFieldBegin. It has the option of doing a
+ * 'type override' of the type header. This is used specifically in the
+ * boolean field case.
+ */
+template <class Transport_>
+int32_t TCompactProtocolT<Transport_>::writeFieldBeginInternal(
+    const char* name,
+    const TType fieldType,
+    const int16_t fieldId,
+    int8_t typeOverride) {
+  (void) name;
+  uint32_t wsize = 0;
+
+  // if there's a type override, use that.
+  int8_t typeToWrite = (typeOverride == -1 ? getCompactType(fieldType) : typeOverride);
+
+  // check if we can use delta encoding for the field id
+  if (fieldId > lastFieldId_ && fieldId - lastFieldId_ <= 15) {
+    // write them together
+    wsize += writeByte(static_cast<int8_t>((fieldId - lastFieldId_)
+                                           << 4 | typeToWrite));
+  } else {
+    // write them separate
+    wsize += writeByte(typeToWrite);
+    wsize += writeI16(fieldId);
+  }
+
+  lastFieldId_ = fieldId;
+  return wsize;
+}
+
+/**
+ * Abstract method for writing the start of lists and sets. List and sets on
+ * the wire differ only by the type indicator.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeCollectionBegin(const TType elemType,
+                                                             int32_t size) {
+  uint32_t wsize = 0;
+  if (size <= 14) {
+    wsize += writeByte(static_cast<int8_t>(size
+                                           << 4 | getCompactType(elemType)));
+  } else {
+    wsize += writeByte(0xf0 | getCompactType(elemType));
+    wsize += writeVarint32(size);
+  }
+  return wsize;
+}
+
+/**
+ * Write an i32 as a varint. Results in 1-5 bytes on the wire.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeVarint32(uint32_t n) {
+  uint8_t buf[5];
+  uint32_t wsize = 0;
+
+  while (true) {
+    if ((n & ~0x7F) == 0) {
+      buf[wsize++] = (int8_t)n;
+      break;
+    } else {
+      buf[wsize++] = (int8_t)((n & 0x7F) | 0x80);
+      n >>= 7;
+    }
+  }
+  trans_->write(buf, wsize);
+  return wsize;
+}
+
+/**
+ * Write an i64 as a varint. Results in 1-10 bytes on the wire.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::writeVarint64(uint64_t n) {
+  uint8_t buf[10];
+  uint32_t wsize = 0;
+
+  while (true) {
+    if ((n & ~0x7FL) == 0) {
+      buf[wsize++] = (int8_t)n;
+      break;
+    } else {
+      buf[wsize++] = (int8_t)((n & 0x7F) | 0x80);
+      n >>= 7;
+    }
+  }
+  trans_->write(buf, wsize);
+  return wsize;
+}
+
+/**
+ * Convert l into a zigzag long. This allows negative numbers to be
+ * represented compactly as a varint.
+ */
+template <class Transport_>
+uint64_t TCompactProtocolT<Transport_>::i64ToZigzag(const int64_t l) {
+  return (static_cast<uint64_t>(l) << 1) ^ (l >> 63);
+}
+
+/**
+ * Convert n into a zigzag int. This allows negative numbers to be
+ * represented compactly as a varint.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::i32ToZigzag(const int32_t n) {
+  return (static_cast<uint32_t>(n) << 1) ^ (n >> 31);
+}
+
+/**
+ * Given a TType value, find the appropriate detail::compact::Types value
+ */
+template <class Transport_>
+int8_t TCompactProtocolT<Transport_>::getCompactType(const TType ttype) {
+  return detail::compact::TTypeToCType[ttype];
+}
+
+//
+// Reading Methods
+//
+
+/**
+ * Read a message header.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readMessageBegin(
+    std::string& name,
+    TMessageType& messageType,
+    int32_t& seqid) {
+  uint32_t rsize = 0;
+  int8_t protocolId;
+  int8_t versionAndType;
+  int8_t version;
+
+  rsize += readByte(protocolId);
+  if (protocolId != PROTOCOL_ID) {
+    throw TProtocolException(TProtocolException::BAD_VERSION, "Bad protocol identifier");
+  }
+
+  rsize += readByte(versionAndType);
+  version = (int8_t)(versionAndType & VERSION_MASK);
+  if (version != VERSION_N) {
+    throw TProtocolException(TProtocolException::BAD_VERSION, "Bad protocol version");
+  }
+
+  messageType = (TMessageType)((versionAndType >> TYPE_SHIFT_AMOUNT) & TYPE_BITS);
+  rsize += readVarint32(seqid);
+  rsize += readString(name);
+
+  return rsize;
+}
+
+/**
+ * Read a struct begin. There's nothing on the wire for this, but it is our
+ * opportunity to push a new struct begin marker on the field stack.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readStructBegin(std::string& name) {
+  name = "";
+  lastField_.push(lastFieldId_);
+  lastFieldId_ = 0;
+  return 0;
+}
+
+/**
+ * Doesn't actually consume any wire data, just removes the last field for
+ * this struct from the field stack.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readStructEnd() {
+  lastFieldId_ = lastField_.top();
+  lastField_.pop();
+  return 0;
+}
+
+/**
+ * Read a field header off the wire.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readFieldBegin(std::string& name,
+                                                       TType& fieldType,
+                                                       int16_t& fieldId) {
+  (void) name;
+  uint32_t rsize = 0;
+  int8_t byte;
+  int8_t type;
+
+  rsize += readByte(byte);
+  type = (byte & 0x0f);
+
+  // if it's a stop, then we can return immediately, as the struct is over.
+  if (type == T_STOP) {
+    fieldType = T_STOP;
+    fieldId = 0;
+    return rsize;
+  }
+
+  // mask off the 4 MSB of the type header. it could contain a field id delta.
+  int16_t modifier = (int16_t)(((uint8_t)byte & 0xf0) >> 4);
+  if (modifier == 0) {
+    // not a delta, look ahead for the zigzag varint field id.
+    rsize += readI16(fieldId);
+  } else {
+    fieldId = (int16_t)(lastFieldId_ + modifier);
+  }
+  fieldType = getTType(type);
+
+  // if this happens to be a boolean field, the value is encoded in the type
+  if (type == detail::compact::CT_BOOLEAN_TRUE ||
+      type == detail::compact::CT_BOOLEAN_FALSE) {
+    // save the boolean value in a special instance variable.
+    boolValue_.hasBoolValue = true;
+    boolValue_.boolValue =
+      (type == detail::compact::CT_BOOLEAN_TRUE ? true : false);
+  }
+
+  // push the new field onto the field stack so we can keep the deltas going.
+  lastFieldId_ = fieldId;
+  return rsize;
+}
+
+/**
+ * Read a map header off the wire. If the size is zero, skip reading the key
+ * and value type. This means that 0-length maps will yield TMaps without the
+ * "correct" types.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readMapBegin(TType& keyType,
+                                                     TType& valType,
+                                                     uint32_t& size) {
+  uint32_t rsize = 0;
+  int8_t kvType = 0;
+  int32_t msize = 0;
+
+  rsize += readVarint32(msize);
+  if (msize != 0)
+    rsize += readByte(kvType);
+
+  if (msize < 0) {
+    throw TProtocolException(TProtocolException::NEGATIVE_SIZE);
+  } else if (container_limit_ && msize > container_limit_) {
+    throw TProtocolException(TProtocolException::SIZE_LIMIT);
+  }
+
+  keyType = getTType((int8_t)((uint8_t)kvType >> 4));
+  valType = getTType((int8_t)((uint8_t)kvType & 0xf));
+  size = (uint32_t)msize;
+
+  return rsize;
+}
+
+/**
+ * Read a list header off the wire. If the list size is 0-14, the size will
+ * be packed into the element type header. If it's a longer list, the 4 MSB
+ * of the element type header will be 0xF, and a varint will follow with the
+ * true size.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readListBegin(TType& elemType,
+                                                      uint32_t& size) {
+  int8_t size_and_type;
+  uint32_t rsize = 0;
+  int32_t lsize;
+
+  rsize += readByte(size_and_type);
+
+  lsize = ((uint8_t)size_and_type >> 4) & 0x0f;
+  if (lsize == 15) {
+    rsize += readVarint32(lsize);
+  }
+
+  if (lsize < 0) {
+    throw TProtocolException(TProtocolException::NEGATIVE_SIZE);
+  } else if (container_limit_ && lsize > container_limit_) {
+    throw TProtocolException(TProtocolException::SIZE_LIMIT);
+  }
+
+  elemType = getTType((int8_t)(size_and_type & 0x0f));
+  size = (uint32_t)lsize;
+
+  return rsize;
+}
+
+/**
+ * Read a set header off the wire. If the set size is 0-14, the size will
+ * be packed into the element type header. If it's a longer set, the 4 MSB
+ * of the element type header will be 0xF, and a varint will follow with the
+ * true size.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readSetBegin(TType& elemType,
+                                                     uint32_t& size) {
+  return readListBegin(elemType, size);
+}
+
+/**
+ * Read a boolean off the wire. If this is a boolean field, the value should
+ * already have been read during readFieldBegin, so we'll just consume the
+ * pre-stored value. Otherwise, read a byte.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readBool(bool& value) {
+  if (boolValue_.hasBoolValue == true) {
+    value = boolValue_.boolValue;
+    boolValue_.hasBoolValue = false;
+    return 0;
+  } else {
+    int8_t val;
+    readByte(val);
+    value = (val == detail::compact::CT_BOOLEAN_TRUE);
+    return 1;
+  }
+}
+
+/**
+ * Read a single byte off the wire. Nothing interesting here.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readByte(int8_t& byte) {
+  uint8_t b[1];
+  trans_->readAll(b, 1);
+  byte = *(int8_t*)b;
+  return 1;
+}
+
+/**
+ * Read an i16 from the wire as a zigzag varint.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readI16(int16_t& i16) {
+  int32_t value;
+  uint32_t rsize = readVarint32(value);
+  i16 = (int16_t)zigzagToI32(value);
+  return rsize;
+}
+
+/**
+ * Read an i32 from the wire as a zigzag varint.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readI32(int32_t& i32) {
+  int32_t value;
+  uint32_t rsize = readVarint32(value);
+  i32 = zigzagToI32(value);
+  return rsize;
+}
+
+/**
+ * Read an i64 from the wire as a zigzag varint.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readI64(int64_t& i64) {
+  int64_t value;
+  uint32_t rsize = readVarint64(value);
+  i64 = zigzagToI64(value);
+  return rsize;
+}
+
+/**
+ * No magic here - just read a double off the wire.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readDouble(double& dub) {
+  //BOOST_STATIC_ASSERT(sizeof(double) == sizeof(uint64_t));
+  //BOOST_STATIC_ASSERT(std::numeric_limits<double>::is_iec559);
+
+  union {
+    uint64_t bits;
+    uint8_t b[8];
+  } u;
+  trans_->readAll(u.b, 8);
+  u.bits = THRIFT_letohll(u.bits);
+  dub = bitwise_cast<double>(u.bits);
+  return 8;
+}
+
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readString(std::string& str) {
+  return readBinary(str);
+}
+
+/**
+ * Read a byte[] from the wire.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readBinary(std::string& str) {
+  int32_t rsize = 0;
+  int32_t size;
+
+  rsize += readVarint32(size);
+  // Catch empty string case
+  if (size == 0) {
+    str = "";
+    return rsize;
+  }
+
+  // Catch error cases
+  if (size < 0) {
+    throw TProtocolException(TProtocolException::NEGATIVE_SIZE);
+  }
+  if (string_limit_ > 0 && size > string_limit_) {
+    throw TProtocolException(TProtocolException::SIZE_LIMIT);
+  }
+
+  // Use the heap here to prevent stack overflow for v. large strings
+  if (size > string_buf_size_ || string_buf_ == NULL) {
+    void* new_string_buf = std::realloc(string_buf_, (uint32_t)size);
+    if (new_string_buf == NULL) {
+      throw std::bad_alloc();
+    }
+    string_buf_ = (uint8_t*)new_string_buf;
+    string_buf_size_ = size;
+  }
+  trans_->readAll(string_buf_, size);
+  str.assign((char*)string_buf_, size);
+
+  return rsize + (uint32_t)size;
+}
+
+/**
+ * Read an i32 from the wire as a varint. The MSB of each byte is set
+ * if there is another byte to follow. This can read up to 5 bytes.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readVarint32(int32_t& i32) {
+  int64_t val;
+  uint32_t rsize = readVarint64(val);
+  i32 = (int32_t)val;
+  return rsize;
+}
+
+/**
+ * Read an i64 from the wire as a proper varint. The MSB of each byte is set
+ * if there is another byte to follow. This can read up to 10 bytes.
+ */
+template <class Transport_>
+uint32_t TCompactProtocolT<Transport_>::readVarint64(int64_t& i64) {
+  uint32_t rsize = 0;
+  uint64_t val = 0;
+  int shift = 0;
+  uint8_t buf[10];  // 64 bits / (7 bits/byte) = 10 bytes.
+  uint32_t buf_size = sizeof(buf);
+  const uint8_t* borrowed = trans_->borrow(buf, &buf_size);
+
+  // Fast path.
+  if (borrowed != NULL) {
+    while (true) {
+      uint8_t byte = borrowed[rsize];
+      rsize++;
+      val |= (uint64_t)(byte & 0x7f) << shift;
+      shift += 7;
+      if (!(byte & 0x80)) {
+        i64 = val;
+        trans_->consume(rsize);
+        return rsize;
+      }
+      // Have to check for invalid data so we don't crash.
+      if (UNLIKELY(rsize == sizeof(buf))) {
+        throw TProtocolException(TProtocolException::INVALID_DATA, "Variable-length int over 10 bytes.");
+      }
+    }
+  }
+
+  // Slow path.
+  else {
+    while (true) {
+      uint8_t byte;
+      rsize += trans_->readAll(&byte, 1);
+      val |= (uint64_t)(byte & 0x7f) << shift;
+      shift += 7;
+      if (!(byte & 0x80)) {
+        i64 = val;
+        return rsize;
+      }
+      // Might as well check for invalid data on the slow path too.
+      if (UNLIKELY(rsize >= sizeof(buf))) {
+        throw TProtocolException(TProtocolException::INVALID_DATA, "Variable-length int over 10 bytes.");
+      }
+    }
+  }
+}
+
+/**
+ * Convert from zigzag int to int.
+ */
+template <class Transport_>
+int32_t TCompactProtocolT<Transport_>::zigzagToI32(uint32_t n) {
+  return (n >> 1) ^ static_cast<uint32_t>(-static_cast<int32_t>(n & 1));
+}
+
+/**
+ * Convert from zigzag long to long.
+ */
+template <class Transport_>
+int64_t TCompactProtocolT<Transport_>::zigzagToI64(uint64_t n) {
+  return (n >> 1) ^ static_cast<uint64_t>(-static_cast<int64_t>(n & 1));
+}
+
+template <class Transport_>
+TType TCompactProtocolT<Transport_>::getTType(int8_t type) {
+  switch (type) {
+    case T_STOP:
+      return T_STOP;
+    case detail::compact::CT_BOOLEAN_FALSE:
+    case detail::compact::CT_BOOLEAN_TRUE:
+      return T_BOOL;
+    case detail::compact::CT_BYTE:
+      return T_BYTE;
+    case detail::compact::CT_I16:
+      return T_I16;
+    case detail::compact::CT_I32:
+      return T_I32;
+    case detail::compact::CT_I64:
+      return T_I64;
+    case detail::compact::CT_DOUBLE:
+      return T_DOUBLE;
+    case detail::compact::CT_BINARY:
+      return T_STRING;
+    case detail::compact::CT_LIST:
+      return T_LIST;
+    case detail::compact::CT_SET:
+      return T_SET;
+    case detail::compact::CT_MAP:
+      return T_MAP;
+    case detail::compact::CT_STRUCT:
+      return T_STRUCT;
+    default:
+      throw TException(std::string("don't know what type: ") + (char)type);
+  }
+}
+
+}}} // lbug_apache::thrift::protocol
+
+#endif // _LBUG_THRIFT_PROTOCOL_TCOMPACTPROTOCOL_TCC_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocol.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocol.cpp
new file mode 100755
index 0000000000..05132bf601
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocol.cpp
@@ -0,0 +1,33 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#include "protocol/TProtocol.h"
+
+namespace lbug_apache {
+namespace thrift {
+namespace protocol {
+
+TProtocol::~TProtocol() = default;
+uint32_t TProtocol::skip_virt(TType type) {
+  return ::lbug_apache::thrift::protocol::skip(*this, type);
+}
+
+TProtocolFactory::~TProtocolFactory() = default;
+
+}}} // lbug_apache::thrift::protocol
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocol.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocol.h
new file mode 100755
index 0000000000..adb1673c46
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocol.h
@@ -0,0 +1,765 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_PROTOCOL_TPROTOCOL_H_
+#define _LBUG_THRIFT_PROTOCOL_TPROTOCOL_H_ 1
+
+#ifdef _WIN32
+// Need to come before any Windows.h includes
+#include <winsock2.h>
+#endif
+
+#include "transport/TTransport.h"
+#include "protocol/TProtocolException.h"
+
+#include <memory>
+
+#ifdef HAVE_NETINET_IN_H
+#include <netinet/in.h>
+#endif
+#include <sys/types.h>
+#include <string>
+#include <map>
+#include <climits>
+
+// Use this to get around strict aliasing rules.
+// For example, uint64_t i = bitwise_cast<uint64_t>(returns_double());
+// The most obvious implementation is to just cast a pointer,
+// but that doesn't work.
+// For a pretty in-depth explanation of the problem, see
+// http://cellperformance.beyond3d.com/articles/2006/06/understanding-strict-aliasing.html
+namespace lbug_apache { namespace thrift {
+template <typename To, typename From>
+static inline To bitwise_cast(From from) {
+	static_assert(sizeof(From) == sizeof(To), "sizeof(From) == sizeof(To)");
+
+	// BAD!!!  These are all broken with -O2.
+	// return *reinterpret_cast<To*>(&from);  // BAD!!!
+	// return *static_cast<To*>(static_cast<void*>(&from));  // BAD!!!
+	// return *(To*)(void*)&from;  // BAD!!!
+
+	// Super clean and paritally blessed by section 3.9 of the standard.
+	// unsigned char c[sizeof(from)];
+	// memcpy(c, &from, sizeof(from));
+	// To to;
+	// memcpy(&to, c, sizeof(c));
+	// return to;
+
+	// Slightly more questionable.
+	// Same code emitted by GCC.
+	// To to;
+	// memcpy(&to, &from, sizeof(from));
+	// return to;
+
+	// Technically undefined, but almost universally supported,
+	// and the most efficient implementation.
+	union {
+		From f;
+		To t;
+	} u;
+	u.f = from;
+	return u.t;
+}
+}} // namespace lbug_apache::thrift
+
+
+#ifdef HAVE_SYS_PARAM_H
+#include <sys/param.h>
+#endif
+
+#ifndef __THRIFT_BYTE_ORDER
+# if defined(BYTE_ORDER) && defined(LITTLE_ENDIAN) && defined(BIG_ENDIAN)
+#  define __THRIFT_BYTE_ORDER BYTE_ORDER
+#  define __THRIFT_LITTLE_ENDIAN LITTLE_ENDIAN
+#  define __THRIFT_BIG_ENDIAN BIG_ENDIAN
+# else
+//#  include <boost/predef/other/endian.h>
+#  if BOOST_ENDIAN_BIG_BYTE
+#    define __THRIFT_BYTE_ORDER 4321
+#    define __THRIFT_LITTLE_ENDIAN 0
+#    define __THRIFT_BIG_ENDIAN __THRIFT_BYTE_ORDER
+#  elif BOOST_ENDIAN_LITTLE_BYTE
+#    define __THRIFT_BYTE_ORDER 1234
+#    define __THRIFT_LITTLE_ENDIAN __THRIFT_BYTE_ORDER
+#    define __THRIFT_BIG_ENDIAN 0
+#  endif
+#  ifdef BOOST_LITTLE_ENDIAN
+#  else
+#  endif
+# endif
+#endif
+
+#if __THRIFT_BYTE_ORDER == __THRIFT_BIG_ENDIAN
+# if !defined(THRIFT_ntohll)
+#  define THRIFT_ntohll(n) (n)
+#  define THRIFT_htonll(n) (n)
+# endif
+# if defined(__GNUC__) && defined(__GLIBC__)
+#  include <byteswap.h>
+#  define THRIFT_htolell(n) bswap_64(n)
+#  define THRIFT_letohll(n) bswap_64(n)
+#  define THRIFT_htolel(n) bswap_32(n)
+#  define THRIFT_letohl(n) bswap_32(n)
+#  define THRIFT_htoles(n) bswap_16(n)
+#  define THRIFT_letohs(n) bswap_16(n)
+# else /* GNUC & GLIBC */
+#  define bswap_64(n) \
+      ( (((n) & 0xff00000000000000ull) >> 56) \
+      | (((n) & 0x00ff000000000000ull) >> 40) \
+      | (((n) & 0x0000ff0000000000ull) >> 24) \
+      | (((n) & 0x000000ff00000000ull) >> 8)  \
+      | (((n) & 0x00000000ff000000ull) << 8)  \
+      | (((n) & 0x0000000000ff0000ull) << 24) \
+      | (((n) & 0x000000000000ff00ull) << 40) \
+      | (((n) & 0x00000000000000ffull) << 56) )
+#  define bswap_32(n) \
+      ( (((n) & 0xff000000ul) >> 24) \
+      | (((n) & 0x00ff0000ul) >> 8)  \
+      | (((n) & 0x0000ff00ul) << 8)  \
+      | (((n) & 0x000000fful) << 24) )
+#  define bswap_16(n) \
+      ( (((n) & ((unsigned short)0xff00ul)) >> 8)  \
+      | (((n) & ((unsigned short)0x00fful)) << 8)  )
+#  define THRIFT_htolell(n) bswap_64(n)
+#  define THRIFT_letohll(n) bswap_64(n)
+#  define THRIFT_htolel(n) bswap_32(n)
+#  define THRIFT_letohl(n) bswap_32(n)
+#  define THRIFT_htoles(n) bswap_16(n)
+#  define THRIFT_letohs(n) bswap_16(n)
+# endif /* GNUC & GLIBC */
+#elif __THRIFT_BYTE_ORDER == __THRIFT_LITTLE_ENDIAN
+#  define THRIFT_htolell(n) (n)
+#  define THRIFT_letohll(n) (n)
+#  define THRIFT_htolel(n) (n)
+#  define THRIFT_letohl(n) (n)
+#  define THRIFT_htoles(n) (n)
+#  define THRIFT_letohs(n) (n)
+# if defined(__GNUC__) && defined(__GLIBC__)
+#  include <byteswap.h>
+#  define THRIFT_ntohll(n) bswap_64(n)
+#  define THRIFT_htonll(n) bswap_64(n)
+# elif defined(_MSC_VER) /* Microsoft Visual C++ */
+#  define THRIFT_ntohll(n) ( _byteswap_uint64((uint64_t)n) )
+#  define THRIFT_htonll(n) ( _byteswap_uint64((uint64_t)n) )
+# elif !defined(THRIFT_ntohll) /* Not GNUC/GLIBC or MSVC */
+#  define THRIFT_ntohll(n) ( (((uint64_t)ntohl((uint32_t)n)) << 32) + ntohl((uint32_t)(n >> 32)) )
+#  define THRIFT_htonll(n) ( (((uint64_t)htonl((uint32_t)n)) << 32) + htonl((uint32_t)(n >> 32)) )
+# endif /* GNUC/GLIBC or MSVC or something else */
+#else /* __THRIFT_BYTE_ORDER */
+# error "Can't define THRIFT_htonll or THRIFT_ntohll!"
+#endif
+
+namespace lbug_apache {
+namespace thrift {
+namespace protocol {
+
+using lbug_apache::thrift::transport::TTransport;
+
+/**
+ * Enumerated definition of the types that the Thrift protocol supports.
+ * Take special note of the T_END type which is used specifically to mark
+ * the end of a sequence of fields.
+ */
+enum TType {
+  T_STOP       = 0,
+  T_VOID       = 1,
+  T_BOOL       = 2,
+  T_BYTE       = 3,
+  T_I08        = 3,
+  T_I16        = 6,
+  T_I32        = 8,
+  T_U64        = 9,
+  T_I64        = 10,
+  T_DOUBLE     = 4,
+  T_STRING     = 11,
+  T_UTF7       = 11,
+  T_STRUCT     = 12,
+  T_MAP        = 13,
+  T_SET        = 14,
+  T_LIST       = 15,
+  T_UTF8       = 16,
+  T_UTF16      = 17
+};
+
+/**
+ * Enumerated definition of the message types that the Thrift protocol
+ * supports.
+ */
+enum TMessageType {
+  T_CALL       = 1,
+  T_REPLY      = 2,
+  T_EXCEPTION  = 3,
+  T_ONEWAY     = 4
+};
+
+static const uint32_t DEFAULT_RECURSION_LIMIT = 64;
+
+/**
+ * Abstract class for a thrift protocol driver. These are all the methods that
+ * a protocol must implement. Essentially, there must be some way of reading
+ * and writing all the base types, plus a mechanism for writing out structs
+ * with indexed fields.
+ *
+ * TProtocol objects should not be shared across multiple encoding contexts,
+ * as they may need to maintain internal state in some protocols (i.e. XML).
+ * Note that is is acceptable for the TProtocol module to do its own internal
+ * buffered reads/writes to the underlying TTransport where appropriate (i.e.
+ * when parsing an input XML stream, reading should be batched rather than
+ * looking ahead character by character for a close tag).
+ *
+ */
+class TProtocol {
+public:
+  virtual ~TProtocol();
+
+  /**
+   * Writing functions.
+   */
+
+  virtual uint32_t writeMessageBegin_virt(const std::string& name,
+                                          const TMessageType messageType,
+                                          const int32_t seqid) = 0;
+
+  virtual uint32_t writeMessageEnd_virt() = 0;
+
+  virtual uint32_t writeStructBegin_virt(const char* name) = 0;
+
+  virtual uint32_t writeStructEnd_virt() = 0;
+
+  virtual uint32_t writeFieldBegin_virt(const char* name,
+                                        const TType fieldType,
+                                        const int16_t fieldId) = 0;
+
+  virtual uint32_t writeFieldEnd_virt() = 0;
+
+  virtual uint32_t writeFieldStop_virt() = 0;
+
+  virtual uint32_t writeMapBegin_virt(const TType keyType, const TType valType, const uint32_t size)
+      = 0;
+
+  virtual uint32_t writeMapEnd_virt() = 0;
+
+  virtual uint32_t writeListBegin_virt(const TType elemType, const uint32_t size) = 0;
+
+  virtual uint32_t writeListEnd_virt() = 0;
+
+  virtual uint32_t writeSetBegin_virt(const TType elemType, const uint32_t size) = 0;
+
+  virtual uint32_t writeSetEnd_virt() = 0;
+
+  virtual uint32_t writeBool_virt(const bool value) = 0;
+
+  virtual uint32_t writeByte_virt(const int8_t byte) = 0;
+
+  virtual uint32_t writeI16_virt(const int16_t i16) = 0;
+
+  virtual uint32_t writeI32_virt(const int32_t i32) = 0;
+
+  virtual uint32_t writeI64_virt(const int64_t i64) = 0;
+
+  virtual uint32_t writeDouble_virt(const double dub) = 0;
+
+  virtual uint32_t writeString_virt(const std::string& str) = 0;
+
+  virtual uint32_t writeBinary_virt(const std::string& str) = 0;
+
+  uint32_t writeMessageBegin(const std::string& name,
+                             const TMessageType messageType,
+                             const int32_t seqid) {
+    T_VIRTUAL_CALL();
+    return writeMessageBegin_virt(name, messageType, seqid);
+  }
+
+  uint32_t writeMessageEnd() {
+    T_VIRTUAL_CALL();
+    return writeMessageEnd_virt();
+  }
+
+  uint32_t writeStructBegin(const char* name) {
+    T_VIRTUAL_CALL();
+    return writeStructBegin_virt(name);
+  }
+
+  uint32_t writeStructEnd() {
+    T_VIRTUAL_CALL();
+    return writeStructEnd_virt();
+  }
+
+  uint32_t writeFieldBegin(const char* name, const TType fieldType, const int16_t fieldId) {
+    T_VIRTUAL_CALL();
+    return writeFieldBegin_virt(name, fieldType, fieldId);
+  }
+
+  uint32_t writeFieldEnd() {
+    T_VIRTUAL_CALL();
+    return writeFieldEnd_virt();
+  }
+
+  uint32_t writeFieldStop() {
+    T_VIRTUAL_CALL();
+    return writeFieldStop_virt();
+  }
+
+  uint32_t writeMapBegin(const TType keyType, const TType valType, const uint32_t size) {
+    T_VIRTUAL_CALL();
+    return writeMapBegin_virt(keyType, valType, size);
+  }
+
+  uint32_t writeMapEnd() {
+    T_VIRTUAL_CALL();
+    return writeMapEnd_virt();
+  }
+
+  uint32_t writeListBegin(const TType elemType, const uint32_t size) {
+    T_VIRTUAL_CALL();
+    return writeListBegin_virt(elemType, size);
+  }
+
+  uint32_t writeListEnd() {
+    T_VIRTUAL_CALL();
+    return writeListEnd_virt();
+  }
+
+  uint32_t writeSetBegin(const TType elemType, const uint32_t size) {
+    T_VIRTUAL_CALL();
+    return writeSetBegin_virt(elemType, size);
+  }
+
+  uint32_t writeSetEnd() {
+    T_VIRTUAL_CALL();
+    return writeSetEnd_virt();
+  }
+
+  uint32_t writeBool(const bool value) {
+    T_VIRTUAL_CALL();
+    return writeBool_virt(value);
+  }
+
+  uint32_t writeByte(const int8_t byte) {
+    T_VIRTUAL_CALL();
+    return writeByte_virt(byte);
+  }
+
+  uint32_t writeI16(const int16_t i16) {
+    T_VIRTUAL_CALL();
+    return writeI16_virt(i16);
+  }
+
+  uint32_t writeI32(const int32_t i32) {
+    T_VIRTUAL_CALL();
+    return writeI32_virt(i32);
+  }
+
+  uint32_t writeI64(const int64_t i64) {
+    T_VIRTUAL_CALL();
+    return writeI64_virt(i64);
+  }
+
+  uint32_t writeDouble(const double dub) {
+    T_VIRTUAL_CALL();
+    return writeDouble_virt(dub);
+  }
+
+  uint32_t writeString(const std::string& str) {
+    T_VIRTUAL_CALL();
+    return writeString_virt(str);
+  }
+
+  uint32_t writeBinary(const std::string& str) {
+    T_VIRTUAL_CALL();
+    return writeBinary_virt(str);
+  }
+
+  /**
+   * Reading functions
+   */
+
+  virtual uint32_t readMessageBegin_virt(std::string& name,
+                                         TMessageType& messageType,
+                                         int32_t& seqid) = 0;
+
+  virtual uint32_t readMessageEnd_virt() = 0;
+
+  virtual uint32_t readStructBegin_virt(std::string& name) = 0;
+
+  virtual uint32_t readStructEnd_virt() = 0;
+
+  virtual uint32_t readFieldBegin_virt(std::string& name, TType& fieldType, int16_t& fieldId) = 0;
+
+  virtual uint32_t readFieldEnd_virt() = 0;
+
+  virtual uint32_t readMapBegin_virt(TType& keyType, TType& valType, uint32_t& size) = 0;
+
+  virtual uint32_t readMapEnd_virt() = 0;
+
+  virtual uint32_t readListBegin_virt(TType& elemType, uint32_t& size) = 0;
+
+  virtual uint32_t readListEnd_virt() = 0;
+
+  virtual uint32_t readSetBegin_virt(TType& elemType, uint32_t& size) = 0;
+
+  virtual uint32_t readSetEnd_virt() = 0;
+
+  virtual uint32_t readBool_virt(bool& value) = 0;
+
+  virtual uint32_t readBool_virt(std::vector<bool>::reference value) = 0;
+
+  virtual uint32_t readByte_virt(int8_t& byte) = 0;
+
+  virtual uint32_t readI16_virt(int16_t& i16) = 0;
+
+  virtual uint32_t readI32_virt(int32_t& i32) = 0;
+
+  virtual uint32_t readI64_virt(int64_t& i64) = 0;
+
+  virtual uint32_t readDouble_virt(double& dub) = 0;
+
+  virtual uint32_t readString_virt(std::string& str) = 0;
+
+  virtual uint32_t readBinary_virt(std::string& str) = 0;
+
+  uint32_t readMessageBegin(std::string& name, TMessageType& messageType, int32_t& seqid) {
+    T_VIRTUAL_CALL();
+    return readMessageBegin_virt(name, messageType, seqid);
+  }
+
+  uint32_t readMessageEnd() {
+    T_VIRTUAL_CALL();
+    return readMessageEnd_virt();
+  }
+
+  uint32_t readStructBegin(std::string& name) {
+    T_VIRTUAL_CALL();
+    return readStructBegin_virt(name);
+  }
+
+  uint32_t readStructEnd() {
+    T_VIRTUAL_CALL();
+    return readStructEnd_virt();
+  }
+
+  uint32_t readFieldBegin(std::string& name, TType& fieldType, int16_t& fieldId) {
+    T_VIRTUAL_CALL();
+    return readFieldBegin_virt(name, fieldType, fieldId);
+  }
+
+  uint32_t readFieldEnd() {
+    T_VIRTUAL_CALL();
+    return readFieldEnd_virt();
+  }
+
+  uint32_t readMapBegin(TType& keyType, TType& valType, uint32_t& size) {
+    T_VIRTUAL_CALL();
+    return readMapBegin_virt(keyType, valType, size);
+  }
+
+  uint32_t readMapEnd() {
+    T_VIRTUAL_CALL();
+    return readMapEnd_virt();
+  }
+
+  uint32_t readListBegin(TType& elemType, uint32_t& size) {
+    T_VIRTUAL_CALL();
+    return readListBegin_virt(elemType, size);
+  }
+
+  uint32_t readListEnd() {
+    T_VIRTUAL_CALL();
+    return readListEnd_virt();
+  }
+
+  uint32_t readSetBegin(TType& elemType, uint32_t& size) {
+    T_VIRTUAL_CALL();
+    return readSetBegin_virt(elemType, size);
+  }
+
+  uint32_t readSetEnd() {
+    T_VIRTUAL_CALL();
+    return readSetEnd_virt();
+  }
+
+  uint32_t readBool(bool& value) {
+    T_VIRTUAL_CALL();
+    return readBool_virt(value);
+  }
+
+  uint32_t readByte(int8_t& byte) {
+    T_VIRTUAL_CALL();
+    return readByte_virt(byte);
+  }
+
+  uint32_t readI16(int16_t& i16) {
+    T_VIRTUAL_CALL();
+    return readI16_virt(i16);
+  }
+
+  uint32_t readI32(int32_t& i32) {
+    T_VIRTUAL_CALL();
+    return readI32_virt(i32);
+  }
+
+  uint32_t readI64(int64_t& i64) {
+    T_VIRTUAL_CALL();
+    return readI64_virt(i64);
+  }
+
+  uint32_t readDouble(double& dub) {
+    T_VIRTUAL_CALL();
+    return readDouble_virt(dub);
+  }
+
+  uint32_t readString(std::string& str) {
+    T_VIRTUAL_CALL();
+    return readString_virt(str);
+  }
+
+  uint32_t readBinary(std::string& str) {
+    T_VIRTUAL_CALL();
+    return readBinary_virt(str);
+  }
+
+  /*
+   * std::vector is specialized for bool, and its elements are individual bits
+   * rather than bools.   We need to define a different version of readBool()
+   * to work with std::vector<bool>.
+   */
+  uint32_t readBool(std::vector<bool>::reference value) {
+    T_VIRTUAL_CALL();
+    return readBool_virt(value);
+  }
+
+  /**
+   * Method to arbitrarily skip over data.
+   */
+  uint32_t skip(TType type) {
+    T_VIRTUAL_CALL();
+    return skip_virt(type);
+  }
+  virtual uint32_t skip_virt(TType type);
+
+  inline std::shared_ptr<TTransport> getTransport() { return ptrans_; }
+
+  // TODO: remove these two calls, they are for backwards
+  // compatibility
+  inline std::shared_ptr<TTransport> getInputTransport() { return ptrans_; }
+  inline std::shared_ptr<TTransport> getOutputTransport() { return ptrans_; }
+
+  // input and output recursion depth are kept separate so that one protocol
+  // can be used concurrently for both input and output.
+  void incrementInputRecursionDepth() {
+    if (recursion_limit_ < ++input_recursion_depth_) {
+      throw TProtocolException(TProtocolException::DEPTH_LIMIT);
+    }
+  }
+  void decrementInputRecursionDepth() { --input_recursion_depth_; }
+
+  void incrementOutputRecursionDepth() {
+    if (recursion_limit_ < ++output_recursion_depth_) {
+      throw TProtocolException(TProtocolException::DEPTH_LIMIT);
+    }
+  }
+  void decrementOutputRecursionDepth() { --output_recursion_depth_; }
+
+  uint32_t getRecursionLimit() const {return recursion_limit_;}
+  void setRecurisionLimit(uint32_t depth) {recursion_limit_ = depth;}
+
+protected:
+  TProtocol(std::shared_ptr<TTransport> ptrans)
+    : ptrans_(ptrans), input_recursion_depth_(0), output_recursion_depth_(0), recursion_limit_(DEFAULT_RECURSION_LIMIT)
+  {}
+
+  std::shared_ptr<TTransport> ptrans_;
+
+private:
+  TProtocol() = default;
+  uint32_t input_recursion_depth_;
+  uint32_t output_recursion_depth_;
+  uint32_t recursion_limit_;
+};
+
+/**
+ * Constructs input and output protocol objects given transports.
+ */
+class TProtocolFactory {
+public:
+  TProtocolFactory() = default;
+
+  virtual ~TProtocolFactory();
+
+  virtual std::shared_ptr<TProtocol> getProtocol(std::shared_ptr<TTransport> trans) = 0;
+  virtual std::shared_ptr<TProtocol> getProtocol(std::shared_ptr<TTransport> inTrans,
+               std::shared_ptr<TTransport> outTrans) {
+    (void)outTrans;
+    return getProtocol(inTrans);
+  }
+};
+
+/**
+ * Dummy protocol class.
+ *
+ * This class does nothing, and should never be instantiated.
+ * It is used only by the generator code.
+ */
+class TDummyProtocol : public TProtocol {};
+
+
+// HM: this is sub-optimal since it creates a depencency even for memory-only struct
+//// This is the default / legacy choice
+//struct TNetworkBigEndian
+//{
+//  static uint16_t toWire16(uint16_t x)   {return htons(x);}
+//  static uint32_t toWire32(uint32_t x)   {return htonl(x);}
+//  static uint64_t toWire64(uint64_t x)   {return THRIFT_htonll(x);}
+//  static uint16_t fromWire16(uint16_t x) {return ntohs(x);}
+//  static uint32_t fromWire32(uint32_t x) {return ntohl(x);}
+//  static uint64_t fromWire64(uint64_t x) {return THRIFT_ntohll(x);}
+//};
+//
+//// On most systems, this will be a bit faster than TNetworkBigEndian
+//struct TNetworkLittleEndian
+//{
+//  static uint16_t toWire16(uint16_t x)   {return THRIFT_htoles(x);}
+//  static uint32_t toWire32(uint32_t x)   {return THRIFT_htolel(x);}
+//  static uint64_t toWire64(uint64_t x)   {return THRIFT_htolell(x);}
+//  static uint16_t fromWire16(uint16_t x) {return THRIFT_letohs(x);}
+//  static uint32_t fromWire32(uint32_t x) {return THRIFT_letohl(x);}
+//  static uint64_t fromWire64(uint64_t x) {return THRIFT_letohll(x);}
+//};
+
+struct TOutputRecursionTracker {
+  TProtocol &prot_;
+  TOutputRecursionTracker(TProtocol &prot) : prot_(prot) {
+    prot_.incrementOutputRecursionDepth();
+  }
+  ~TOutputRecursionTracker() {
+    prot_.decrementOutputRecursionDepth();
+  }
+};
+
+struct TInputRecursionTracker {
+  TProtocol &prot_;
+  TInputRecursionTracker(TProtocol &prot) : prot_(prot) {
+    prot_.incrementInputRecursionDepth();
+  }
+  ~TInputRecursionTracker() {
+    prot_.decrementInputRecursionDepth();
+  }
+};
+
+/**
+ * Helper template for implementing TProtocol::skip().
+ *
+ * Templatized to avoid having to make virtual function calls.
+ */
+template <class Protocol_>
+uint32_t skip(Protocol_& prot, TType type) {
+  TInputRecursionTracker tracker(prot);
+
+  switch (type) {
+  case T_BOOL: {
+    bool boolv;
+    return prot.readBool(boolv);
+  }
+  case T_BYTE: {
+    int8_t bytev = 0;
+    return prot.readByte(bytev);
+  }
+  case T_I16: {
+    int16_t i16;
+    return prot.readI16(i16);
+  }
+  case T_I32: {
+    int32_t i32;
+    return prot.readI32(i32);
+  }
+  case T_I64: {
+    int64_t i64;
+    return prot.readI64(i64);
+  }
+  case T_DOUBLE: {
+    double dub;
+    return prot.readDouble(dub);
+  }
+  case T_STRING: {
+    std::string str;
+    return prot.readBinary(str);
+  }
+  case T_STRUCT: {
+    uint32_t result = 0;
+    std::string name;
+    int16_t fid;
+    TType ftype;
+    result += prot.readStructBegin(name);
+    while (true) {
+      result += prot.readFieldBegin(name, ftype, fid);
+      if (ftype == T_STOP) {
+        break;
+      }
+      result += skip(prot, ftype);
+      result += prot.readFieldEnd();
+    }
+    result += prot.readStructEnd();
+    return result;
+  }
+  case T_MAP: {
+    uint32_t result = 0;
+    TType keyType;
+    TType valType;
+    uint32_t i, size;
+    result += prot.readMapBegin(keyType, valType, size);
+    for (i = 0; i < size; i++) {
+      result += skip(prot, keyType);
+      result += skip(prot, valType);
+    }
+    result += prot.readMapEnd();
+    return result;
+  }
+  case T_SET: {
+    uint32_t result = 0;
+    TType elemType;
+    uint32_t i, size;
+    result += prot.readSetBegin(elemType, size);
+    for (i = 0; i < size; i++) {
+      result += skip(prot, elemType);
+    }
+    result += prot.readSetEnd();
+    return result;
+  }
+  case T_LIST: {
+    uint32_t result = 0;
+    TType elemType;
+    uint32_t i, size;
+    result += prot.readListBegin(elemType, size);
+    for (i = 0; i < size; i++) {
+      result += skip(prot, elemType);
+    }
+    result += prot.readListEnd();
+    return result;
+  }
+  default:
+    break;
+  }
+
+  throw TProtocolException(TProtocolException::INVALID_DATA,
+                           "invalid TType");
+}
+
+}}} // lbug_apache::thrift::protocol
+
+#endif // #define _LBUG_THRIFT_PROTOCOL_TPROTOCOL_H_ 1
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocolDecorator.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocolDecorator.h
new file mode 100755
index 0000000000..4a0257a99d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocolDecorator.h
@@ -0,0 +1,152 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef THRIFT_TPROTOCOLDECORATOR_H_
+#define THRIFT_TPROTOCOLDECORATOR_H_ 1
+
+#include "thrift/protocol/TProtocol.h"
+#include <memory>
+#include "duckdb/common/vector.hpp"
+
+namespace lbug_apache {
+namespace thrift {
+namespace protocol {
+using std::shared_ptr;
+
+/**
+ * <code>TProtocolDecorator</code> forwards all requests to an enclosed
+ * <code>TProtocol</code> instance, providing a way to author concise
+ * concrete decorator subclasses.
+ *
+ * <p>See p.175 of Design Patterns (by Gamma et al.)</p>
+ *
+ * @see lbug_apache::thrift::protocol::TMultiplexedProtocol
+ */
+class TProtocolDecorator : public TProtocol {
+public:
+  ~TProtocolDecorator() override = default;
+
+  // Desc: Initializes the protocol decorator object.
+  TProtocolDecorator(shared_ptr<TProtocol> proto)
+    : TProtocol(proto->getTransport()), protocol(proto) {}
+
+  uint32_t writeMessageBegin_virt(const std::string& name,
+                                          const TMessageType messageType,
+                                          const int32_t seqid) override {
+    return protocol->writeMessageBegin(name, messageType, seqid);
+  }
+  uint32_t writeMessageEnd_virt() override { return protocol->writeMessageEnd(); }
+  uint32_t writeStructBegin_virt(const char* name) override {
+    return protocol->writeStructBegin(name);
+  }
+  uint32_t writeStructEnd_virt() override { return protocol->writeStructEnd(); }
+
+  uint32_t writeFieldBegin_virt(const char* name,
+                                        const TType fieldType,
+                                        const int16_t fieldId) override {
+    return protocol->writeFieldBegin(name, fieldType, fieldId);
+  }
+
+  uint32_t writeFieldEnd_virt() override { return protocol->writeFieldEnd(); }
+  uint32_t writeFieldStop_virt() override { return protocol->writeFieldStop(); }
+
+  uint32_t writeMapBegin_virt(const TType keyType,
+                                      const TType valType,
+                                      const uint32_t size) override {
+    return protocol->writeMapBegin(keyType, valType, size);
+  }
+
+  uint32_t writeMapEnd_virt() override { return protocol->writeMapEnd(); }
+
+  uint32_t writeListBegin_virt(const TType elemType, const uint32_t size) override {
+    return protocol->writeListBegin(elemType, size);
+  }
+  uint32_t writeListEnd_virt() override { return protocol->writeListEnd(); }
+
+  uint32_t writeSetBegin_virt(const TType elemType, const uint32_t size) override {
+    return protocol->writeSetBegin(elemType, size);
+  }
+  uint32_t writeSetEnd_virt() override { return protocol->writeSetEnd(); }
+
+  uint32_t writeBool_virt(const bool value) override { return protocol->writeBool(value); }
+  uint32_t writeByte_virt(const int8_t byte) override { return protocol->writeByte(byte); }
+  uint32_t writeI16_virt(const int16_t i16) override { return protocol->writeI16(i16); }
+  uint32_t writeI32_virt(const int32_t i32) override { return protocol->writeI32(i32); }
+  uint32_t writeI64_virt(const int64_t i64) override { return protocol->writeI64(i64); }
+
+  uint32_t writeDouble_virt(const double dub) override { return protocol->writeDouble(dub); }
+  uint32_t writeString_virt(const std::string& str) override { return protocol->writeString(str); }
+  uint32_t writeBinary_virt(const std::string& str) override { return protocol->writeBinary(str); }
+
+  uint32_t readMessageBegin_virt(std::string& name,
+                                         TMessageType& messageType,
+                                         int32_t& seqid) override {
+    return protocol->readMessageBegin(name, messageType, seqid);
+  }
+  uint32_t readMessageEnd_virt() override { return protocol->readMessageEnd(); }
+
+  uint32_t readStructBegin_virt(std::string& name) override {
+    return protocol->readStructBegin(name);
+  }
+  uint32_t readStructEnd_virt() override { return protocol->readStructEnd(); }
+
+  uint32_t readFieldBegin_virt(std::string& name, TType& fieldType, int16_t& fieldId) override {
+    return protocol->readFieldBegin(name, fieldType, fieldId);
+  }
+  uint32_t readFieldEnd_virt() override { return protocol->readFieldEnd(); }
+
+  uint32_t readMapBegin_virt(TType& keyType, TType& valType, uint32_t& size) override {
+    return protocol->readMapBegin(keyType, valType, size);
+  }
+  uint32_t readMapEnd_virt() override { return protocol->readMapEnd(); }
+
+  uint32_t readListBegin_virt(TType& elemType, uint32_t& size) override {
+    return protocol->readListBegin(elemType, size);
+  }
+  uint32_t readListEnd_virt() override { return protocol->readListEnd(); }
+
+  uint32_t readSetBegin_virt(TType& elemType, uint32_t& size) override {
+    return protocol->readSetBegin(elemType, size);
+  }
+  uint32_t readSetEnd_virt() override { return protocol->readSetEnd(); }
+
+  uint32_t readBool_virt(bool& value) override { return protocol->readBool(value); }
+  uint32_t readBool_virt(lbug::vector<bool>::reference value) override {
+    return protocol->readBool(value);
+  }
+
+  uint32_t readByte_virt(int8_t& byte) override { return protocol->readByte(byte); }
+
+  uint32_t readI16_virt(int16_t& i16) override { return protocol->readI16(i16); }
+  uint32_t readI32_virt(int32_t& i32) override { return protocol->readI32(i32); }
+  uint32_t readI64_virt(int64_t& i64) override { return protocol->readI64(i64); }
+
+  uint32_t readDouble_virt(double& dub) override { return protocol->readDouble(dub); }
+
+  uint32_t readString_virt(std::string& str) override { return protocol->readString(str); }
+  uint32_t readBinary_virt(std::string& str) override { return protocol->readBinary(str); }
+
+private:
+  shared_ptr<TProtocol> protocol;
+};
+}
+}
+}
+
+#endif // THRIFT_TPROTOCOLDECORATOR_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocolException.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocolException.h
new file mode 100755
index 0000000000..a098596557
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocolException.h
@@ -0,0 +1,105 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_PROTOCOL_TPROTOCOLEXCEPTION_H_
+#define _LBUG_THRIFT_PROTOCOL_TPROTOCOLEXCEPTION_H_ 1
+
+#include <string>
+
+namespace lbug_apache {
+namespace thrift {
+namespace protocol {
+
+/**
+ * Class to encapsulate all the possible types of protocol errors that may
+ * occur in various protocol systems. This provides a sort of generic
+ * wrapper around the vague UNIX E_ error codes that lets a common code
+ * base of error handling to be used for various types of protocols, i.e.
+ * pipes etc.
+ *
+ */
+class TProtocolException : public lbug_apache::thrift::TException {
+public:
+  /**
+   * Error codes for the various types of exceptions.
+   */
+  enum TProtocolExceptionType {
+    UNKNOWN = 0,
+    INVALID_DATA = 1,
+    NEGATIVE_SIZE = 2,
+    SIZE_LIMIT = 3,
+    BAD_VERSION = 4,
+    NOT_IMPLEMENTED = 5,
+    DEPTH_LIMIT = 6
+  };
+
+  TProtocolException() : lbug_apache::thrift::TException(), type_(UNKNOWN) {}
+
+  TProtocolException(TProtocolExceptionType type) : lbug_apache::thrift::TException(), type_(type) {}
+
+  TProtocolException(const std::string& message)
+    : lbug_apache::thrift::TException(message), type_(UNKNOWN) {}
+
+  TProtocolException(TProtocolExceptionType type, const std::string& message)
+    : lbug_apache::thrift::TException(message), type_(type) {}
+
+  ~TProtocolException() noexcept override = default;
+
+  /**
+   * Returns an error code that provides information about the type of error
+   * that has occurred.
+   *
+   * @return Error code
+   */
+  TProtocolExceptionType getType() const { return type_; }
+
+  const char* what() const noexcept override {
+    if (message_.empty()) {
+      switch (type_) {
+      case UNKNOWN:
+        return "TProtocolException: Unknown protocol exception";
+      case INVALID_DATA:
+        return "TProtocolException: Invalid data";
+      case NEGATIVE_SIZE:
+        return "TProtocolException: Negative size";
+      case SIZE_LIMIT:
+        return "TProtocolException: Exceeded size limit";
+      case BAD_VERSION:
+        return "TProtocolException: Invalid version";
+      case NOT_IMPLEMENTED:
+        return "TProtocolException: Not implemented";
+      default:
+        return "TProtocolException: (Invalid exception type)";
+      }
+    } else {
+      return message_.c_str();
+    }
+  }
+
+protected:
+  /**
+   * Error code
+   */
+  TProtocolExceptionType type_;
+};
+}
+}
+} // lbug_apache::thrift::protocol
+
+#endif // #ifndef _LBUG_THRIFT_PROTOCOL_TPROTOCOLEXCEPTION_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocolTypes.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocolTypes.h
new file mode 100755
index 0000000000..9ac04c4d95
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TProtocolTypes.h
@@ -0,0 +1,36 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef THRIFT_PROTOCOL_TPROTOCOLTYPES_H_
+#define THRIFT_PROTOCOL_TPROTOCOLTYPES_H_ 1
+
+namespace lbug_apache {
+namespace thrift {
+namespace protocol {
+
+enum PROTOCOL_TYPES {
+  T_BINARY_PROTOCOL = 0,
+  T_JSON_PROTOCOL = 1,
+  T_COMPACT_PROTOCOL = 2,
+};
+}
+}
+} // lbug_apache::thrift::protocol
+
+#endif // #define _THRIFT_PROTOCOL_TPROTOCOLTYPES_H_ 1
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TVirtualProtocol.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TVirtualProtocol.h
new file mode 100755
index 0000000000..1d443ae001
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/protocol/TVirtualProtocol.h
@@ -0,0 +1,513 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_PROTOCOL_TVIRTUALPROTOCOL_H_
+#define _LBUG_THRIFT_PROTOCOL_TVIRTUALPROTOCOL_H_ 1
+
+#include "protocol/TProtocol.h"
+
+namespace lbug_apache {
+namespace thrift {
+namespace protocol {
+
+using lbug_apache::thrift::transport::TTransport;
+
+/**
+ * Helper class that provides default implementations of TProtocol methods.
+ *
+ * This class provides default implementations of the non-virtual TProtocol
+ * methods.  It exists primarily so TVirtualProtocol can derive from it.  It
+ * prevents TVirtualProtocol methods from causing infinite recursion if the
+ * non-virtual methods are not overridden by the TVirtualProtocol subclass.
+ *
+ * You probably don't want to use this class directly.  Use TVirtualProtocol
+ * instead.
+ */
+class TProtocolDefaults : public TProtocol {
+public:
+  uint32_t readMessageBegin(std::string& name, TMessageType& messageType, int32_t& seqid) {
+    (void)name;
+    (void)messageType;
+    (void)seqid;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readMessageEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readStructBegin(std::string& name) {
+    (void)name;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readStructEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readFieldBegin(std::string& name, TType& fieldType, int16_t& fieldId) {
+    (void)name;
+    (void)fieldType;
+    (void)fieldId;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readFieldEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readMapBegin(TType& keyType, TType& valType, uint32_t& size) {
+    (void)keyType;
+    (void)valType;
+    (void)size;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readMapEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readListBegin(TType& elemType, uint32_t& size) {
+    (void)elemType;
+    (void)size;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readListEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readSetBegin(TType& elemType, uint32_t& size) {
+    (void)elemType;
+    (void)size;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readSetEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readBool(bool& value) {
+    (void)value;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readBool(std::vector<bool>::reference value) {
+    (void)value;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readByte(int8_t& byte) {
+    (void)byte;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readI16(int16_t& i16) {
+    (void)i16;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readI32(int32_t& i32) {
+    (void)i32;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readI64(int64_t& i64) {
+    (void)i64;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readDouble(double& dub) {
+    (void)dub;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readString(std::string& str) {
+    (void)str;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t readBinary(std::string& str) {
+    (void)str;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support reading (yet).");
+  }
+
+  uint32_t writeMessageBegin(const std::string& name,
+                             const TMessageType messageType,
+                             const int32_t seqid) {
+    (void)name;
+    (void)messageType;
+    (void)seqid;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeMessageEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeStructBegin(const char* name) {
+    (void)name;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeStructEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeFieldBegin(const char* name, const TType fieldType, const int16_t fieldId) {
+    (void)name;
+    (void)fieldType;
+    (void)fieldId;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeFieldEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeFieldStop() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeMapBegin(const TType keyType, const TType valType, const uint32_t size) {
+    (void)keyType;
+    (void)valType;
+    (void)size;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeMapEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeListBegin(const TType elemType, const uint32_t size) {
+    (void)elemType;
+    (void)size;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeListEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeSetBegin(const TType elemType, const uint32_t size) {
+    (void)elemType;
+    (void)size;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeSetEnd() {
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeBool(const bool value) {
+    (void)value;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeByte(const int8_t byte) {
+    (void)byte;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeI16(const int16_t i16) {
+    (void)i16;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeI32(const int32_t i32) {
+    (void)i32;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeI64(const int64_t i64) {
+    (void)i64;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeDouble(const double dub) {
+    (void)dub;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeString(const std::string& str) {
+    (void)str;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t writeBinary(const std::string& str) {
+    (void)str;
+    throw TProtocolException(TProtocolException::NOT_IMPLEMENTED,
+                             "this protocol does not support writing (yet).");
+  }
+
+  uint32_t skip(TType type) { return ::lbug_apache::thrift::protocol::skip(*this, type); }
+
+protected:
+  TProtocolDefaults(std::shared_ptr<TTransport> ptrans) : TProtocol(ptrans) {}
+};
+
+/**
+ * Concrete TProtocol classes should inherit from TVirtualProtocol
+ * so they don't have to manually override virtual methods.
+ */
+template <class Protocol_, class Super_ = TProtocolDefaults>
+class TVirtualProtocol : public Super_ {
+public:
+  /**
+   * Writing functions.
+   */
+
+  uint32_t writeMessageBegin_virt(const std::string& name,
+                                          const TMessageType messageType,
+                                          const int32_t seqid) override {
+    return static_cast<Protocol_*>(this)->writeMessageBegin(name, messageType, seqid);
+  }
+
+  uint32_t writeMessageEnd_virt() override {
+    return static_cast<Protocol_*>(this)->writeMessageEnd();
+  }
+
+  uint32_t writeStructBegin_virt(const char* name) override {
+    return static_cast<Protocol_*>(this)->writeStructBegin(name);
+  }
+
+  uint32_t writeStructEnd_virt() override { return static_cast<Protocol_*>(this)->writeStructEnd(); }
+
+  uint32_t writeFieldBegin_virt(const char* name,
+                                        const TType fieldType,
+                                        const int16_t fieldId) override {
+    return static_cast<Protocol_*>(this)->writeFieldBegin(name, fieldType, fieldId);
+  }
+
+  uint32_t writeFieldEnd_virt() override { return static_cast<Protocol_*>(this)->writeFieldEnd(); }
+
+  uint32_t writeFieldStop_virt() override { return static_cast<Protocol_*>(this)->writeFieldStop(); }
+
+  uint32_t writeMapBegin_virt(const TType keyType,
+                                      const TType valType,
+                                      const uint32_t size) override {
+    return static_cast<Protocol_*>(this)->writeMapBegin(keyType, valType, size);
+  }
+
+  uint32_t writeMapEnd_virt() override { return static_cast<Protocol_*>(this)->writeMapEnd(); }
+
+  uint32_t writeListBegin_virt(const TType elemType, const uint32_t size) override {
+    return static_cast<Protocol_*>(this)->writeListBegin(elemType, size);
+  }
+
+  uint32_t writeListEnd_virt() override { return static_cast<Protocol_*>(this)->writeListEnd(); }
+
+  uint32_t writeSetBegin_virt(const TType elemType, const uint32_t size) override {
+    return static_cast<Protocol_*>(this)->writeSetBegin(elemType, size);
+  }
+
+  uint32_t writeSetEnd_virt() override { return static_cast<Protocol_*>(this)->writeSetEnd(); }
+
+  uint32_t writeBool_virt(const bool value) override {
+    return static_cast<Protocol_*>(this)->writeBool(value);
+  }
+
+  uint32_t writeByte_virt(const int8_t byte) override {
+    return static_cast<Protocol_*>(this)->writeByte(byte);
+  }
+
+  uint32_t writeI16_virt(const int16_t i16) override {
+    return static_cast<Protocol_*>(this)->writeI16(i16);
+  }
+
+  uint32_t writeI32_virt(const int32_t i32) override {
+    return static_cast<Protocol_*>(this)->writeI32(i32);
+  }
+
+  uint32_t writeI64_virt(const int64_t i64) override {
+    return static_cast<Protocol_*>(this)->writeI64(i64);
+  }
+
+  uint32_t writeDouble_virt(const double dub) override {
+    return static_cast<Protocol_*>(this)->writeDouble(dub);
+  }
+
+  uint32_t writeString_virt(const std::string& str) override {
+    return static_cast<Protocol_*>(this)->writeString(str);
+  }
+
+  uint32_t writeBinary_virt(const std::string& str) override {
+    return static_cast<Protocol_*>(this)->writeBinary(str);
+  }
+
+  /**
+   * Reading functions
+   */
+
+  uint32_t readMessageBegin_virt(std::string& name,
+                                         TMessageType& messageType,
+                                         int32_t& seqid) override {
+    return static_cast<Protocol_*>(this)->readMessageBegin(name, messageType, seqid);
+  }
+
+  uint32_t readMessageEnd_virt() override { return static_cast<Protocol_*>(this)->readMessageEnd(); }
+
+  uint32_t readStructBegin_virt(std::string& name) override {
+    return static_cast<Protocol_*>(this)->readStructBegin(name);
+  }
+
+  uint32_t readStructEnd_virt() override { return static_cast<Protocol_*>(this)->readStructEnd(); }
+
+  uint32_t readFieldBegin_virt(std::string& name, TType& fieldType, int16_t& fieldId) override {
+    return static_cast<Protocol_*>(this)->readFieldBegin(name, fieldType, fieldId);
+  }
+
+  uint32_t readFieldEnd_virt() override { return static_cast<Protocol_*>(this)->readFieldEnd(); }
+
+  uint32_t readMapBegin_virt(TType& keyType, TType& valType, uint32_t& size) override {
+    return static_cast<Protocol_*>(this)->readMapBegin(keyType, valType, size);
+  }
+
+  uint32_t readMapEnd_virt() override { return static_cast<Protocol_*>(this)->readMapEnd(); }
+
+  uint32_t readListBegin_virt(TType& elemType, uint32_t& size) override {
+    return static_cast<Protocol_*>(this)->readListBegin(elemType, size);
+  }
+
+  uint32_t readListEnd_virt() override { return static_cast<Protocol_*>(this)->readListEnd(); }
+
+  uint32_t readSetBegin_virt(TType& elemType, uint32_t& size) override {
+    return static_cast<Protocol_*>(this)->readSetBegin(elemType, size);
+  }
+
+  uint32_t readSetEnd_virt() override { return static_cast<Protocol_*>(this)->readSetEnd(); }
+
+  uint32_t readBool_virt(bool& value) override {
+    return static_cast<Protocol_*>(this)->readBool(value);
+  }
+
+  uint32_t readBool_virt(std::vector<bool>::reference value) override {
+    return static_cast<Protocol_*>(this)->readBool(value);
+  }
+
+  uint32_t readByte_virt(int8_t& byte) override {
+    return static_cast<Protocol_*>(this)->readByte(byte);
+  }
+
+  uint32_t readI16_virt(int16_t& i16) override {
+    return static_cast<Protocol_*>(this)->readI16(i16);
+  }
+
+  uint32_t readI32_virt(int32_t& i32) override {
+    return static_cast<Protocol_*>(this)->readI32(i32);
+  }
+
+  uint32_t readI64_virt(int64_t& i64) override {
+    return static_cast<Protocol_*>(this)->readI64(i64);
+  }
+
+  uint32_t readDouble_virt(double& dub) override {
+    return static_cast<Protocol_*>(this)->readDouble(dub);
+  }
+
+  uint32_t readString_virt(std::string& str) override {
+    return static_cast<Protocol_*>(this)->readString(str);
+  }
+
+  uint32_t readBinary_virt(std::string& str) override {
+    return static_cast<Protocol_*>(this)->readBinary(str);
+  }
+
+  uint32_t skip_virt(TType type) override { return static_cast<Protocol_*>(this)->skip(type); }
+
+  /*
+   * Provide a default skip() implementation that uses non-virtual read
+   * methods.
+   *
+   * Note: subclasses that use TVirtualProtocol to derive from another protocol
+   * implementation (i.e., not TProtocolDefaults) should beware that this may
+   * override any non-default skip() implementation provided by the parent
+   * transport class.  They may need to explicitly redefine skip() to call the
+   * correct parent implementation, if desired.
+   */
+  uint32_t skip(TType type) {
+    auto* const prot = static_cast<Protocol_*>(this);
+    return ::lbug_apache::thrift::protocol::skip(*prot, type);
+  }
+
+  /*
+   * Provide a default readBool() implementation for use with
+   * std::vector<bool>, that behaves the same as reading into a normal bool.
+   *
+   * Subclasses can override this if desired, but there normally shouldn't
+   * be a need to.
+   */
+  uint32_t readBool(std::vector<bool>::reference value) {
+    bool b = false;
+    uint32_t ret = static_cast<Protocol_*>(this)->readBool(b);
+    value = b;
+    return ret;
+  }
+  using Super_::readBool; // so we don't hide readBool(bool&)
+
+protected:
+  TVirtualProtocol(std::shared_ptr<TTransport> ptrans) : Super_(ptrans) {}
+};
+}
+}
+} // lbug_apache::thrift::protocol
+
+#endif // #define _LBUG_THRIFT_PROTOCOL_TVIRTUALPROTOCOL_H_ 1
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/stdcxx.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/stdcxx.h
new file mode 100644
index 0000000000..e69de29bb2
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/thrift-config.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/thrift-config.h
new file mode 100755
index 0000000000..e4761f8d12
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/thrift-config.h
@@ -0,0 +1,34 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef THRIFT_CONFIG_H
+#define THRIFT_CONFIG_H
+
+
+#ifdef _WIN32
+#if defined(_M_IX86) || defined(_M_X64) || defined(_M_ARM) || defined(_M_ARM64)
+#define ARITHMETIC_RIGHT_SHIFT 1
+#define SIGNED_RIGHT_SHIFT_IS 1
+#endif
+#else
+#define SIGNED_RIGHT_SHIFT_IS  1
+#define ARITHMETIC_RIGHT_SHIFT 1
+#endif
+
+#endif
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/thrift_export.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/thrift_export.h
new file mode 100755
index 0000000000..f5c059fb7c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/thrift_export.h
@@ -0,0 +1,20 @@
+#ifndef THRIFT_EXPORT_H
+#define THRIFT_EXPORT_H
+
+#ifdef THRIFT_STATIC_DEFINE
+#  define THRIFT_EXPORT
+#elif defined(_MSC_VER )
+#  ifndef THRIFT_EXPORT
+#    ifdef thrift_EXPORTS
+          /* We are building this library */
+#      define THRIFT_EXPORT __declspec(dllexport)
+#    else
+          /* We are using this library */
+#      define THRIFT_EXPORT __declspec(dllimport)
+#    endif
+#  endif
+#else
+#  define THRIFT_EXPORT
+#endif
+
+#endif /* THRIFT_EXPORT_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/PlatformSocket.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/PlatformSocket.h
new file mode 100644
index 0000000000..828c5d7aef
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/PlatformSocket.h
@@ -0,0 +1,137 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+// clang-format off
+
+#ifndef _LBUG_THRIFT_TRANSPORT_PLATFORM_SOCKET_H_
+#  define _LBUG_THRIFT_TRANSPORT_PLATFORM_SOCKET_H_
+
+#ifdef _WIN32
+#ifdef _WINSOCKAPI_
+#undef _WINSOCKAPI_
+#endif
+#  include <winsock2.h>
+#  define THRIFT_GET_SOCKET_ERROR ::WSAGetLastError()
+#  define THRIFT_ERRNO (*_errno())
+#  define THRIFT_EINPROGRESS WSAEINPROGRESS
+#  define THRIFT_EAGAIN WSAEWOULDBLOCK
+#  define THRIFT_EINTR WSAEINTR
+#  define THRIFT_ECONNRESET WSAECONNRESET
+#  define THRIFT_ENOTCONN WSAENOTCONN
+#  define THRIFT_ETIMEDOUT WSAETIMEDOUT
+#  define THRIFT_EWOULDBLOCK WSAEWOULDBLOCK
+#  define THRIFT_EPIPE WSAECONNRESET
+#  define THRIFT_NO_SOCKET_CACHING SO_EXCLUSIVEADDRUSE
+#  define THRIFT_SOCKET SOCKET
+#  define THRIFT_INVALID_SOCKET INVALID_SOCKET
+#  define THRIFT_SOCKETPAIR thrift_socketpair
+#  define THRIFT_FCNTL thrift_fcntl
+#  define THRIFT_O_NONBLOCK 1
+#  define THRIFT_F_GETFL 0
+#  define THRIFT_F_SETFL 1
+#  define THRIFT_GETTIMEOFDAY thrift_gettimeofday
+#  define THRIFT_CLOSESOCKET closesocket
+#  define THRIFT_CLOSE _close
+#  define THRIFT_OPEN _open
+#  define THRIFT_FTRUNCATE _chsize_s
+#  define THRIFT_FSYNC _commit
+#  define THRIFT_LSEEK _lseek
+#  define THRIFT_WRITE _write
+#  define THRIFT_READ _read
+#  define THRIFT_IOCTL_SOCKET ioctlsocket
+#  define THRIFT_IOCTL_SOCKET_NUM_BYTES_TYPE u_long
+#  define THRIFT_FSTAT _fstat
+#  define THRIFT_STAT _stat
+#  ifdef _WIN32_WCE
+#    define THRIFT_GAI_STRERROR(...) thrift_wstr2str(gai_strerrorW(__VA_ARGS__))
+#  else
+#    define THRIFT_GAI_STRERROR gai_strerrorA
+#  endif
+#  define THRIFT_SSIZET ptrdiff_t
+#  if (_MSC_VER < 1900)
+#    define THRIFT_SNPRINTF _snprintf
+#  else
+#    define THRIFT_SNPRINTF snprintf
+#  endif
+#  define THRIFT_SLEEP_SEC thrift_sleep
+#  define THRIFT_SLEEP_USEC thrift_usleep
+#  define THRIFT_TIMESPEC thrift_timespec
+#  define THRIFT_CTIME_R thrift_ctime_r
+#  define THRIFT_POLL thrift_poll
+#  if WINVER <= 0x0502 //XP, Server2003
+#    define THRIFT_POLLFD  thrift_pollfd
+#    define THRIFT_POLLIN  0x0300
+#    define THRIFT_POLLOUT 0x0010
+#  else //Vista, Win7...
+#    define THRIFT_POLLFD  pollfd
+#    define THRIFT_POLLIN  POLLIN
+#    define THRIFT_POLLOUT POLLOUT
+#  endif //WINVER
+#  define THRIFT_SHUT_RDWR SD_BOTH
+#  if !defined(AI_ADDRCONFIG)
+#    define AI_ADDRCONFIG 0x00000400
+#  endif
+#else //not _WIN32
+#  include <errno.h>
+#  define THRIFT_GET_SOCKET_ERROR errno
+#  define THRIFT_ERRNO errno
+#  define THRIFT_EINTR       EINTR
+#  define THRIFT_EINPROGRESS EINPROGRESS
+#  define THRIFT_ECONNRESET  ECONNRESET
+#  define THRIFT_ENOTCONN    ENOTCONN
+#  define THRIFT_ETIMEDOUT   ETIMEDOUT
+#  define THRIFT_EWOULDBLOCK EWOULDBLOCK
+#  define THRIFT_EAGAIN      EAGAIN
+#  define THRIFT_EPIPE       EPIPE
+#  define THRIFT_NO_SOCKET_CACHING SO_REUSEADDR
+#  define THRIFT_SOCKET int
+#  define THRIFT_INVALID_SOCKET (-1)
+#  define THRIFT_SOCKETPAIR socketpair
+#  define THRIFT_FCNTL fcntl
+#  define THRIFT_O_NONBLOCK O_NONBLOCK
+#  define THRIFT_F_GETFL F_GETFL
+#  define THRIFT_F_SETFL F_SETFL
+#  define THRIFT_GETTIMEOFDAY gettimeofday
+#  define THRIFT_CLOSESOCKET close
+#  define THRIFT_CLOSE close
+#  define THRIFT_OPEN open
+#  define THRIFT_FTRUNCATE ftruncate
+#  define THRIFT_FSYNC fsync
+#  define THRIFT_LSEEK lseek
+#  define THRIFT_WRITE write
+#  define THRIFT_READ read
+#  define THRIFT_IOCTL_SOCKET ioctl
+#  define THRIFT_IOCTL_SOCKET_NUM_BYTES_TYPE int
+#  define THRIFT_STAT stat
+#  define THRIFT_FSTAT fstat
+#  define THRIFT_GAI_STRERROR gai_strerror
+#  define THRIFT_SSIZET ssize_t
+#  define THRIFT_SNPRINTF snprintf
+#  define THRIFT_SLEEP_SEC sleep
+#  define THRIFT_SLEEP_USEC usleep
+#  define THRIFT_TIMESPEC timespec
+#  define THRIFT_CTIME_R ctime_r
+#  define THRIFT_POLL poll
+#  define THRIFT_POLLFD  pollfd
+#  define THRIFT_POLLIN  POLLIN
+#  define THRIFT_POLLOUT POLLOUT
+#  define THRIFT_SHUT_RDWR SHUT_RDWR
+#endif
+
+#endif // _LBUG_THRIFT_TRANSPORT_PLATFORM_SOCKET_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TBufferTransports.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TBufferTransports.cpp
new file mode 100755
index 0000000000..d12cc038b2
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TBufferTransports.cpp
@@ -0,0 +1,139 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#include <cassert>
+#include <algorithm>
+#include "thrift_export.h"
+
+#include "transport/TBufferTransports.h"
+
+using std::string;
+
+namespace lbug_apache {
+namespace thrift {
+namespace transport {
+
+
+
+
+void TMemoryBuffer::computeRead(uint32_t len, uint8_t** out_start, uint32_t* out_give) {
+  // Correct rBound_ so we can use the fast path in the future.
+  rBound_ = wBase_;
+
+  // Decide how much to give.
+  uint32_t give = (std::min)(len, available_read());
+
+  *out_start = rBase_;
+  *out_give = give;
+
+  // Preincrement rBase_ so the caller doesn't have to.
+  rBase_ += give;
+}
+
+uint32_t TMemoryBuffer::readSlow(uint8_t* buf, uint32_t len) {
+  uint8_t* start;
+  uint32_t give;
+  computeRead(len, &start, &give);
+
+  // Copy into the provided buffer.
+  memcpy(buf, start, give);
+
+  return give;
+}
+
+uint32_t TMemoryBuffer::readAppendToString(std::string& str, uint32_t len) {
+  // Don't get some stupid assertion failure.
+  if (buffer_ == nullptr) {
+    return 0;
+  }
+
+  uint8_t* start;
+  uint32_t give;
+  computeRead(len, &start, &give);
+
+  // Append to the provided string.
+  str.append((char*)start, give);
+
+  return give;
+}
+
+void TMemoryBuffer::ensureCanWrite(uint32_t len) {
+  // Check available space
+  uint32_t avail = available_write();
+  if (len <= avail) {
+    return;
+  }
+
+  if (!owner_) {
+    throw TTransportException("Insufficient space in external MemoryBuffer");
+  }
+
+  // Grow the buffer as necessary.
+  uint64_t new_size = bufferSize_;
+  while (len > avail) {
+    new_size = new_size > 0 ? new_size * 2 : 1;
+    if (new_size > maxBufferSize_) {
+      throw TTransportException(TTransportException::BAD_ARGS,
+                                "Internal buffer size overflow");
+    }
+    avail = available_write() + (static_cast<uint32_t>(new_size) - bufferSize_);
+  }
+
+  // Allocate into a new pointer so we don't bork ours if it fails.
+  auto* new_buffer = static_cast<uint8_t*>(std::realloc(buffer_, new_size));
+  if (new_buffer == nullptr) {
+    throw std::bad_alloc();
+  }
+
+  rBase_ = new_buffer + (rBase_ - buffer_);
+  rBound_ = new_buffer + (rBound_ - buffer_);
+  wBase_ = new_buffer + (wBase_ - buffer_);
+  wBound_ = new_buffer + new_size;
+  buffer_ = new_buffer;
+  bufferSize_ = static_cast<uint32_t>(new_size);
+}
+
+void TMemoryBuffer::writeSlow(const uint8_t* buf, uint32_t len) {
+  ensureCanWrite(len);
+
+  // Copy into the buffer and increment wBase_.
+  memcpy(wBase_, buf, len);
+  wBase_ += len;
+}
+
+void TMemoryBuffer::wroteBytes(uint32_t len) {
+  uint32_t avail = available_write();
+  if (len > avail) {
+    throw TTransportException("Client wrote more bytes than size of buffer.");
+  }
+  wBase_ += len;
+}
+
+const uint8_t* TMemoryBuffer::borrowSlow(uint8_t* buf, uint32_t* len) {
+  (void)buf;
+  rBound_ = wBase_;
+  if (available_read() >= *len) {
+    *len = available_read();
+    return rBase_;
+  }
+  return nullptr;
+}
+}
+}
+} // lbug_apache::thrift::transport
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TBufferTransports.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TBufferTransports.h
new file mode 100755
index 0000000000..3b4f61bf05
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TBufferTransports.h
@@ -0,0 +1,488 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_TRANSPORT_TBUFFERTRANSPORTS_H_
+#define _LBUG_THRIFT_TRANSPORT_TBUFFERTRANSPORTS_H_ 1
+
+#include <cstdlib>
+#include <cstddef>
+#include <cstring>
+#include <limits>
+
+#include "transport/TTransport.h"
+#include "transport/TVirtualTransport.h"
+
+#ifdef __GNUC__
+#define TDB_LIKELY(val) (__builtin_expect((val), 1))
+#define TDB_UNLIKELY(val) (__builtin_expect((val), 0))
+#else
+#define TDB_LIKELY(val) (val)
+#define TDB_UNLIKELY(val) (val)
+#endif
+
+namespace lbug_apache {
+namespace thrift {
+namespace transport {
+
+/**
+ * Base class for all transports that use read/write buffers for performance.
+ *
+ * TBufferBase is designed to implement the fast-path "memcpy" style
+ * operations that work in the common case.  It does so with small and
+ * (eventually) nonvirtual, inlinable methods.  TBufferBase is an abstract
+ * class.  Subclasses are expected to define the "slow path" operations
+ * that have to be done when the buffers are full or empty.
+ *
+ */
+class TBufferBase : public TVirtualTransport<TBufferBase> {
+
+public:
+  /**
+   * Fast-path read.
+   *
+   * When we have enough data buffered to fulfill the read, we can satisfy it
+   * with a single memcpy, then adjust our internal pointers.  If the buffer
+   * is empty, we call out to our slow path, implemented by a subclass.
+   * This method is meant to eventually be nonvirtual and inlinable.
+   */
+  uint32_t read(uint8_t* buf, uint32_t len) {
+    uint8_t* new_rBase = rBase_ + len;
+    if (TDB_LIKELY(new_rBase <= rBound_)) {
+      std::memcpy(buf, rBase_, len);
+      rBase_ = new_rBase;
+      return len;
+    }
+    return readSlow(buf, len);
+  }
+
+  /**
+   * Shortcutted version of readAll.
+   */
+  uint32_t readAll(uint8_t* buf, uint32_t len) {
+    uint8_t* new_rBase = rBase_ + len;
+    if (TDB_LIKELY(new_rBase <= rBound_)) {
+      std::memcpy(buf, rBase_, len);
+      rBase_ = new_rBase;
+      return len;
+    }
+    return lbug_apache::thrift::transport::readAll(*this, buf, len);
+  }
+
+  /**
+   * Fast-path write.
+   *
+   * When we have enough empty space in our buffer to accommodate the write, we
+   * can satisfy it with a single memcpy, then adjust our internal pointers.
+   * If the buffer is full, we call out to our slow path, implemented by a
+   * subclass.  This method is meant to eventually be nonvirtual and
+   * inlinable.
+   */
+  void write(const uint8_t* buf, uint32_t len) {
+    uint8_t* new_wBase = wBase_ + len;
+    if (TDB_LIKELY(new_wBase <= wBound_)) {
+      std::memcpy(wBase_, buf, len);
+      wBase_ = new_wBase;
+      return;
+    }
+    writeSlow(buf, len);
+  }
+
+  /**
+   * Fast-path borrow.  A lot like the fast-path read.
+   */
+  const uint8_t* borrow(uint8_t* buf, uint32_t* len) {
+    if (TDB_LIKELY(static_cast<ptrdiff_t>(*len) <= rBound_ - rBase_)) {
+      // With strict aliasing, writing to len shouldn't force us to
+      // refetch rBase_ from memory.  TODO(dreiss): Verify this.
+      *len = static_cast<uint32_t>(rBound_ - rBase_);
+      return rBase_;
+    }
+    return borrowSlow(buf, len);
+  }
+
+  /**
+   * Consume doesn't require a slow path.
+   */
+  void consume(uint32_t len) {
+    if (TDB_LIKELY(static_cast<ptrdiff_t>(len) <= rBound_ - rBase_)) {
+      rBase_ += len;
+    } else {
+      throw TTransportException(TTransportException::BAD_ARGS, "consume did not follow a borrow.");
+    }
+  }
+
+protected:
+  /// Slow path read.
+  virtual uint32_t readSlow(uint8_t* buf, uint32_t len) = 0;
+
+  /// Slow path write.
+  virtual void writeSlow(const uint8_t* buf, uint32_t len) = 0;
+
+  /**
+   * Slow path borrow.
+   *
+   * POSTCONDITION: return == NULL || rBound_ - rBase_ >= *len
+   */
+  virtual const uint8_t* borrowSlow(uint8_t* buf, uint32_t* len) = 0;
+
+  /**
+   * Trivial constructor.
+   *
+   * Initialize pointers safely.  Constructing is not a very
+   * performance-sensitive operation, so it is okay to just leave it to
+   * the concrete class to set up pointers correctly.
+   */
+  TBufferBase() : rBase_(nullptr), rBound_(nullptr), wBase_(nullptr), wBound_(nullptr) {}
+
+  /// Convenience mutator for setting the read buffer.
+  void setReadBuffer(uint8_t* buf, uint32_t len) {
+    rBase_ = buf;
+    rBound_ = buf + len;
+  }
+
+  /// Convenience mutator for setting the write buffer.
+  void setWriteBuffer(uint8_t* buf, uint32_t len) {
+    wBase_ = buf;
+    wBound_ = buf + len;
+  }
+
+  ~TBufferBase() override = default;
+
+  /// Reads begin here.
+  uint8_t* rBase_;
+  /// Reads may extend to just before here.
+  uint8_t* rBound_;
+
+  /// Writes begin here.
+  uint8_t* wBase_;
+  /// Writes may extend to just before here.
+  uint8_t* wBound_;
+};
+
+
+/**
+ * A memory buffer is a transport that simply reads from and writes to an
+ * in memory buffer. Anytime you call write on it, the data is simply placed
+ * into a buffer, and anytime you call read, data is read from that buffer.
+ *
+ * The buffers are allocated using C constructs malloc,realloc, and the size
+ * doubles as necessary.  We've considered using scoped
+ *
+ */
+class TMemoryBuffer : public TVirtualTransport<TMemoryBuffer, TBufferBase> {
+private:
+  // Common initialization done by all constructors.
+  void initCommon(uint8_t* buf, uint32_t size, bool owner, uint32_t wPos) {
+
+    maxBufferSize_ = (std::numeric_limits<uint32_t>::max)();
+
+    if (buf == nullptr && size != 0) {
+      assert(owner);
+      buf = (uint8_t*)std::malloc(size);
+      if (buf == nullptr) {
+	throw std::bad_alloc();
+      }
+    }
+
+    buffer_ = buf;
+    bufferSize_ = size;
+
+    rBase_ = buffer_;
+    rBound_ = buffer_ + wPos;
+    // TODO(dreiss): Investigate NULL-ing this if !owner.
+    wBase_ = buffer_ + wPos;
+    wBound_ = buffer_ + bufferSize_;
+
+    owner_ = owner;
+
+    // rBound_ is really an artifact.  In principle, it should always be
+    // equal to wBase_.  We update it in a few places (computeRead, etc.).
+  }
+
+public:
+  static const uint32_t defaultSize = 1024;
+
+  /**
+   * This enum specifies how a TMemoryBuffer should treat
+   * memory passed to it via constructors or resetBuffer.
+   *
+   * OBSERVE:
+   *   TMemoryBuffer will simply store a pointer to the memory.
+   *   It is the callers responsibility to ensure that the pointer
+   *   remains valid for the lifetime of the TMemoryBuffer,
+   *   and that it is properly cleaned up.
+   *   Note that no data can be written to observed buffers.
+   *
+   * COPY:
+   *   TMemoryBuffer will make an internal copy of the buffer.
+   *   The caller has no responsibilities.
+   *
+   * TAKE_OWNERSHIP:
+   *   TMemoryBuffer will become the "owner" of the buffer,
+   *   and will be responsible for freeing it.
+   *   The membory must have been allocated with malloc.
+   */
+  enum MemoryPolicy { OBSERVE = 1, COPY = 2, TAKE_OWNERSHIP = 3 };
+
+  /**
+   * Construct a TMemoryBuffer with a default-sized buffer,
+   * owned by the TMemoryBuffer object.
+   */
+  TMemoryBuffer() { initCommon(nullptr, defaultSize, true, 0); }
+
+  /**
+   * Construct a TMemoryBuffer with a buffer of a specified size,
+   * owned by the TMemoryBuffer object.
+   *
+   * @param sz  The initial size of the buffer.
+   */
+  TMemoryBuffer(uint32_t sz) { initCommon(nullptr, sz, true, 0); }
+
+  /**
+   * Construct a TMemoryBuffer with buf as its initial contents.
+   *
+   * @param buf    The initial contents of the buffer.
+   *               Note that, while buf is a non-const pointer,
+   *               TMemoryBuffer will not write to it if policy == OBSERVE,
+   *               so it is safe to const_cast<uint8_t*>(whatever).
+   * @param sz     The size of @c buf.
+   * @param policy See @link MemoryPolicy @endlink .
+   */
+  TMemoryBuffer(uint8_t* buf, uint32_t sz, MemoryPolicy policy = OBSERVE) {
+    if (buf == nullptr && sz != 0) {
+      throw TTransportException(TTransportException::BAD_ARGS,
+                                "TMemoryBuffer given null buffer with non-zero size.");
+    }
+
+    switch (policy) {
+    case OBSERVE:
+    case TAKE_OWNERSHIP:
+      initCommon(buf, sz, policy == TAKE_OWNERSHIP, sz);
+      break;
+    case COPY:
+      initCommon(nullptr, sz, true, 0);
+      this->write(buf, sz);
+      break;
+    default:
+      throw TTransportException(TTransportException::BAD_ARGS,
+                                "Invalid MemoryPolicy for TMemoryBuffer");
+    }
+  }
+
+  ~TMemoryBuffer() override {
+    if (owner_) {
+      std::free(buffer_);
+    }
+  }
+
+  bool isOpen() const override { return true; }
+
+  bool peek() override { return (rBase_ < wBase_); }
+
+  void open() override {}
+
+  void close() override {}
+
+  // TODO(dreiss): Make bufPtr const.
+  void getBuffer(uint8_t** bufPtr, uint32_t* sz) {
+    *bufPtr = rBase_;
+    *sz = static_cast<uint32_t>(wBase_ - rBase_);
+  }
+
+  std::string getBufferAsString() {
+    if (buffer_ == nullptr) {
+      return "";
+    }
+    uint8_t* buf;
+    uint32_t sz;
+    getBuffer(&buf, &sz);
+    return std::string((char*)buf, (std::string::size_type)sz);
+  }
+
+  void appendBufferToString(std::string& str) {
+    if (buffer_ == nullptr) {
+      return;
+    }
+    uint8_t* buf;
+    uint32_t sz;
+    getBuffer(&buf, &sz);
+    str.append((char*)buf, sz);
+  }
+
+  void resetBuffer() {
+    rBase_ = buffer_;
+    rBound_ = buffer_;
+    wBase_ = buffer_;
+    // It isn't safe to write into a buffer we don't own.
+    if (!owner_) {
+      wBound_ = wBase_;
+      bufferSize_ = 0;
+    }
+  }
+
+  /// See constructor documentation.
+  void resetBuffer(uint8_t* buf, uint32_t sz, MemoryPolicy policy = OBSERVE) {
+    // Use a variant of the copy-and-swap trick for assignment operators.
+    // This is sub-optimal in terms of performance for two reasons:
+    //   1/ The constructing and swapping of the (small) values
+    //      in the temporary object takes some time, and is not necessary.
+    //   2/ If policy == COPY, we allocate the new buffer before
+    //      freeing the old one, precluding the possibility of
+    //      reusing that memory.
+    // I doubt that either of these problems could be optimized away,
+    // but the second is probably no a common case, and the first is minor.
+    // I don't expect resetBuffer to be a common operation, so I'm willing to
+    // bite the performance bullet to make the method this simple.
+
+    // Construct the new buffer.
+    TMemoryBuffer new_buffer(buf, sz, policy);
+    // Move it into ourself.
+    this->swap(new_buffer);
+    // Our old self gets destroyed.
+  }
+
+  /// See constructor documentation.
+  void resetBuffer(uint32_t sz) {
+    // Construct the new buffer.
+    TMemoryBuffer new_buffer(sz);
+    // Move it into ourself.
+    this->swap(new_buffer);
+    // Our old self gets destroyed.
+  }
+
+  std::string readAsString(uint32_t len) {
+    std::string str;
+    (void)readAppendToString(str, len);
+    return str;
+  }
+
+  uint32_t readAppendToString(std::string& str, uint32_t len);
+
+  // return number of bytes read
+  uint32_t readEnd() override {
+    // This cast should be safe, because buffer_'s size is a uint32_t
+    auto bytes = static_cast<uint32_t>(rBase_ - buffer_);
+    if (rBase_ == wBase_) {
+      resetBuffer();
+    }
+    return bytes;
+  }
+
+  // Return number of bytes written
+  uint32_t writeEnd() override {
+    // This cast should be safe, because buffer_'s size is a uint32_t
+    return static_cast<uint32_t>(wBase_ - buffer_);
+  }
+
+  uint32_t available_read() const {
+    // Remember, wBase_ is the real rBound_.
+    return static_cast<uint32_t>(wBase_ - rBase_);
+  }
+
+  uint32_t available_write() const { return static_cast<uint32_t>(wBound_ - wBase_); }
+
+  // Returns a pointer to where the client can write data to append to
+  // the TMemoryBuffer, and ensures the buffer is big enough to accommodate a
+  // write of the provided length.  The returned pointer is very convenient for
+  // passing to read(), recv(), or similar. You must call wroteBytes() as soon
+  // as data is written or the buffer will not be aware that data has changed.
+  uint8_t* getWritePtr(uint32_t len) {
+    ensureCanWrite(len);
+    return wBase_;
+  }
+
+  // Informs the buffer that the client has written 'len' bytes into storage
+  // that had been provided by getWritePtr().
+  void wroteBytes(uint32_t len);
+
+  /*
+   * TVirtualTransport provides a default implementation of readAll().
+   * We want to use the TBufferBase version instead.
+   */
+  uint32_t readAll(uint8_t* buf, uint32_t len) { return TBufferBase::readAll(buf, len); }
+
+  //! \brief Get the current buffer size
+  //! \returns the current buffer size
+  uint32_t getBufferSize() const {
+    return bufferSize_;
+  }
+
+  //! \brief Get the current maximum buffer size
+  //! \returns the current maximum buffer size
+  uint32_t getMaxBufferSize() const {
+    return maxBufferSize_;
+  }
+
+  //! \brief Change the maximum buffer size
+  //! \param[in]  maxSize  the new maximum buffer size allowed to grow to
+  //! \throws  TTransportException(BAD_ARGS) if maxSize is less than the current buffer size
+  void setMaxBufferSize(uint32_t maxSize) {
+    if (maxSize < bufferSize_) {
+      throw TTransportException(TTransportException::BAD_ARGS,
+                                "Maximum buffer size would be less than current buffer size");
+    }
+    maxBufferSize_ = maxSize;
+  }
+
+protected:
+  void swap(TMemoryBuffer& that) {
+    using std::swap;
+    swap(buffer_, that.buffer_);
+    swap(bufferSize_, that.bufferSize_);
+
+    swap(rBase_, that.rBase_);
+    swap(rBound_, that.rBound_);
+    swap(wBase_, that.wBase_);
+    swap(wBound_, that.wBound_);
+
+    swap(owner_, that.owner_);
+  }
+
+  // Make sure there's at least 'len' bytes available for writing.
+  void ensureCanWrite(uint32_t len);
+
+  // Compute the position and available data for reading.
+  void computeRead(uint32_t len, uint8_t** out_start, uint32_t* out_give);
+
+  uint32_t readSlow(uint8_t* buf, uint32_t len) override;
+
+  void writeSlow(const uint8_t* buf, uint32_t len) override;
+
+  const uint8_t* borrowSlow(uint8_t* buf, uint32_t* len) override;
+
+  // Data buffer
+  uint8_t* buffer_;
+
+  // Allocated buffer size
+  uint32_t bufferSize_;
+
+  // Maximum allowed size
+  uint32_t maxBufferSize_;
+
+  // Is this object the owner of the buffer?
+  bool owner_;
+
+  // Don't forget to update constrctors, initCommon, and swap if
+  // you add new members.
+};
+}
+}
+} // lbug_apache::thrift::transport
+
+#endif // #ifndef _LBUG_THRIFT_TRANSPORT_TBUFFERTRANSPORTS_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TTransport.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TTransport.h
new file mode 100755
index 0000000000..47757d882f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TTransport.h
@@ -0,0 +1,271 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_TRANSPORT_TTRANSPORT_H_
+#define _LBUG_THRIFT_TRANSPORT_TTRANSPORT_H_ 1
+
+#include "Thrift.h"
+#include "transport/TTransportException.h"
+#include <memory>
+#include <string>
+
+namespace lbug_apache {
+namespace thrift {
+namespace transport {
+
+/**
+ * Helper template to hoist readAll implementation out of TTransport
+ */
+template <class Transport_>
+uint32_t readAll(Transport_& trans, uint8_t* buf, uint32_t len) {
+  uint32_t have = 0;
+  uint32_t get = 0;
+
+  while (have < len) {
+    get = trans.read(buf + have, len - have);
+    if (get <= 0) {
+      throw TTransportException(TTransportException::END_OF_FILE, "No more data to read.");
+    }
+    have += get;
+  }
+
+  return have;
+}
+
+/**
+ * Generic interface for a method of transporting data. A TTransport may be
+ * capable of either reading or writing, but not necessarily both.
+ *
+ */
+class TTransport {
+public:
+  /**
+   * Virtual deconstructor.
+   */
+  virtual ~TTransport() = default;
+
+  /**
+   * Whether this transport is open.
+   */
+  virtual bool isOpen() const { return false; }
+
+  /**
+   * Tests whether there is more data to read or if the remote side is
+   * still open. By default this is true whenever the transport is open,
+   * but implementations should add logic to test for this condition where
+   * possible (i.e. on a socket).
+   * This is used by a server to check if it should listen for another
+   * request.
+   */
+  virtual bool peek() { return isOpen(); }
+
+  /**
+   * Opens the transport for communications.
+   *
+   * @return bool Whether the transport was successfully opened
+   * @throws TTransportException if opening failed
+   */
+  virtual void open() {
+    throw TTransportException(TTransportException::NOT_OPEN, "Cannot open base TTransport.");
+  }
+
+  /**
+   * Closes the transport.
+   */
+  virtual void close() {
+    throw TTransportException(TTransportException::NOT_OPEN, "Cannot close base TTransport.");
+  }
+
+  /**
+   * Attempt to read up to the specified number of bytes into the string.
+   *
+   * @param buf  Reference to the location to write the data
+   * @param len  How many bytes to read
+   * @return How many bytes were actually read
+   * @throws TTransportException If an error occurs
+   */
+  uint32_t read(uint8_t* buf, uint32_t len) {
+    T_VIRTUAL_CALL();
+    return read_virt(buf, len);
+  }
+  virtual uint32_t read_virt(uint8_t* /* buf */, uint32_t /* len */) {
+    throw TTransportException(TTransportException::NOT_OPEN, "Base TTransport cannot read.");
+  }
+
+  /**
+   * Reads the given amount of data in its entirety no matter what.
+   *
+   * @param s     Reference to location for read data
+   * @param len   How many bytes to read
+   * @return How many bytes read, which must be equal to size
+   * @throws TTransportException If insufficient data was read
+   */
+  uint32_t readAll(uint8_t* buf, uint32_t len) {
+    T_VIRTUAL_CALL();
+    return readAll_virt(buf, len);
+  }
+  virtual uint32_t readAll_virt(uint8_t* buf, uint32_t len) {
+    return lbug_apache::thrift::transport::readAll(*this, buf, len);
+  }
+
+  /**
+   * Called when read is completed.
+   * This can be over-ridden to perform a transport-specific action
+   * e.g. logging the request to a file
+   *
+   * @return number of bytes read if available, 0 otherwise.
+   */
+  virtual uint32_t readEnd() {
+    // default behaviour is to do nothing
+    return 0;
+  }
+
+  /**
+   * Writes the string in its entirety to the buffer.
+   *
+   * Note: You must call flush() to ensure the data is actually written,
+   * and available to be read back in the future.  Destroying a TTransport
+   * object does not automatically flush pending data--if you destroy a
+   * TTransport object with written but unflushed data, that data may be
+   * discarded.
+   *
+   * @param buf  The data to write out
+   * @throws TTransportException if an error occurs
+   */
+  void write(const uint8_t* buf, uint32_t len) {
+    T_VIRTUAL_CALL();
+    write_virt(buf, len);
+  }
+  virtual void write_virt(const uint8_t* /* buf */, uint32_t /* len */) {
+    throw TTransportException(TTransportException::NOT_OPEN, "Base TTransport cannot write.");
+  }
+
+  /**
+   * Called when write is completed.
+   * This can be over-ridden to perform a transport-specific action
+   * at the end of a request.
+   *
+   * @return number of bytes written if available, 0 otherwise
+   */
+  virtual uint32_t writeEnd() {
+    // default behaviour is to do nothing
+    return 0;
+  }
+
+  /**
+   * Flushes any pending data to be written. Typically used with buffered
+   * transport mechanisms.
+   *
+   * @throws TTransportException if an error occurs
+   */
+  virtual void flush() {
+    // default behaviour is to do nothing
+  }
+
+  /**
+   * Attempts to return a pointer to \c len bytes, possibly copied into \c buf.
+   * Does not consume the bytes read (i.e.: a later read will return the same
+   * data).  This method is meant to support protocols that need to read
+   * variable-length fields.  They can attempt to borrow the maximum amount of
+   * data that they will need, then consume (see next method) what they
+   * actually use.  Some transports will not support this method and others
+   * will fail occasionally, so protocols must be prepared to use read if
+   * borrow fails.
+   *
+   * @oaram buf  A buffer where the data can be stored if needed.
+   *             If borrow doesn't return buf, then the contents of
+   *             buf after the call are undefined.  This parameter may be
+   *             NULL to indicate that the caller is not supplying storage,
+   *             but would like a pointer into an internal buffer, if
+   *             available.
+   * @param len  *len should initially contain the number of bytes to borrow.
+   *             If borrow succeeds, *len will contain the number of bytes
+   *             available in the returned pointer.  This will be at least
+   *             what was requested, but may be more if borrow returns
+   *             a pointer to an internal buffer, rather than buf.
+   *             If borrow fails, the contents of *len are undefined.
+   * @return If the borrow succeeds, return a pointer to the borrowed data.
+   *         This might be equal to \c buf, or it might be a pointer into
+   *         the transport's internal buffers.
+   * @throws TTransportException if an error occurs
+   */
+  const uint8_t* borrow(uint8_t* buf, uint32_t* len) {
+    T_VIRTUAL_CALL();
+    return borrow_virt(buf, len);
+  }
+  virtual const uint8_t* borrow_virt(uint8_t* /* buf */, uint32_t* /* len */) { return nullptr; }
+
+  /**
+   * Remove len bytes from the transport.  This should always follow a borrow
+   * of at least len bytes, and should always succeed.
+   * TODO(dreiss): Is there any transport that could borrow but fail to
+   * consume, or that would require a buffer to dump the consumed data?
+   *
+   * @param len  How many bytes to consume
+   * @throws TTransportException If an error occurs
+   */
+  void consume(uint32_t len) {
+    T_VIRTUAL_CALL();
+    consume_virt(len);
+  }
+  virtual void consume_virt(uint32_t /* len */) {
+    throw TTransportException(TTransportException::NOT_OPEN, "Base TTransport cannot consume.");
+  }
+
+  /**
+   * Returns the origin of the transports call. The value depends on the
+   * transport used. An IP based transport for example will return the
+   * IP address of the client making the request.
+   * If the transport doesn't know the origin Unknown is returned.
+   *
+   * The returned value can be used in a log message for example
+   */
+  virtual const std::string getOrigin() const { return "Unknown"; }
+
+protected:
+  /**
+   * Simple constructor.
+   */
+  TTransport() = default;
+};
+
+/**
+ * Generic factory class to make an input and output transport out of a
+ * source transport. Commonly used inside servers to make input and output
+ * streams out of raw clients.
+ *
+ */
+class TTransportFactory {
+public:
+  TTransportFactory() = default;
+
+  virtual ~TTransportFactory() = default;
+
+  /**
+   * Default implementation does nothing, just returns the transport given.
+   */
+  virtual std::shared_ptr<TTransport> getTransport(std::shared_ptr<TTransport> trans) {
+    return trans;
+  }
+};
+}
+}
+} // lbug_apache::thrift::transport
+
+#endif // #ifndef _LBUG_THRIFT_TRANSPORT_TTRANSPORT_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TTransportException.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TTransportException.cpp
new file mode 100755
index 0000000000..183fbb3d0c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TTransportException.cpp
@@ -0,0 +1,59 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#include "transport/TTransportException.h"
+#include <cstring>
+
+#include "thrift-config.h"
+
+using std::string;
+
+namespace lbug_apache {
+namespace thrift {
+namespace transport {
+
+const char* TTransportException::what() const noexcept {
+  if (message_.empty()) {
+    switch (type_) {
+    case UNKNOWN:
+      return "TTransportException: Unknown transport exception";
+    case NOT_OPEN:
+      return "TTransportException: Transport not open";
+    case TIMED_OUT:
+      return "TTransportException: Timed out";
+    case END_OF_FILE:
+      return "TTransportException: End of file";
+    case INTERRUPTED:
+      return "TTransportException: Interrupted";
+    case BAD_ARGS:
+      return "TTransportException: Invalid arguments";
+    case CORRUPTED_DATA:
+      return "TTransportException: Corrupted Data";
+    case INTERNAL_ERROR:
+      return "TTransportException: Internal error";
+    default:
+      return "TTransportException: (Invalid exception type)";
+    }
+  } else {
+    return message_.c_str();
+  }
+}
+}
+}
+} // lbug_apache::thrift::transport
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TTransportException.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TTransportException.h
new file mode 100755
index 0000000000..aab2d56d98
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TTransportException.h
@@ -0,0 +1,102 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_TRANSPORT_TTRANSPORTEXCEPTION_H_
+#define _LBUG_THRIFT_TRANSPORT_TTRANSPORTEXCEPTION_H_ 1
+
+#include <string>
+#include "Thrift.h"
+
+namespace lbug_apache {
+namespace thrift {
+namespace transport {
+
+/**
+ * Class to encapsulate all the possible types of transport errors that may
+ * occur in various transport systems. This provides a sort of generic
+ * wrapper around the vague UNIX E_ error codes that lets a common code
+ * base of error handling to be used for various types of transports, i.e.
+ * pipes etc.
+ *
+ */
+class TTransportException : public lbug_apache::thrift::TException {
+public:
+  /**
+   * Error codes for the various types of exceptions.
+   */
+  enum TTransportExceptionType {
+    UNKNOWN = 0,
+    NOT_OPEN = 1,
+    TIMED_OUT = 2,
+    END_OF_FILE = 3,
+    INTERRUPTED = 4,
+    BAD_ARGS = 5,
+    CORRUPTED_DATA = 6,
+    INTERNAL_ERROR = 7
+  };
+
+  TTransportException() : lbug_apache::thrift::TException(), type_(UNKNOWN) {}
+
+  TTransportException(TTransportExceptionType type) : lbug_apache::thrift::TException(), type_(type) {}
+
+  TTransportException(const std::string& message)
+    : lbug_apache::thrift::TException(message), type_(UNKNOWN) {}
+
+  TTransportException(TTransportExceptionType type, const std::string& message)
+    : lbug_apache::thrift::TException(message), type_(type) {}
+
+  ~TTransportException() noexcept override = default;
+
+  /**
+   * Returns an error code that provides information about the type of error
+   * that has occurred.
+   *
+   * @return Error code
+   */
+  TTransportExceptionType getType() const noexcept { return type_; }
+
+  const char* what() const noexcept override;
+
+protected:
+  /** Just like strerror_r but returns a C++ string object. */
+  std::string strerror_s(int errno_copy);
+
+  /** Error code */
+  TTransportExceptionType type_;
+};
+
+///**
+// * Legacy code in transport implementations have overflow issues
+// * that need to be enforced.
+// */
+//template <typename To, typename From> To safe_numeric_cast(From i) {
+//  try {
+//    return boost::numeric_cast<To>(i);
+//  }
+//  catch (const std::bad_cast& bc) {
+//    throw TTransportException(TTransportException::CORRUPTED_DATA,
+//                              bc.what());
+//  }
+//}
+
+}
+}
+} // lbug_apache::thrift::transport
+
+#endif // #ifndef _LBUG_THRIFT_TRANSPORT_TTRANSPORTEXCEPTION_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TVirtualTransport.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TVirtualTransport.h
new file mode 100755
index 0000000000..541c45a911
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/thrift/transport/TVirtualTransport.h
@@ -0,0 +1,140 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#ifndef _LBUG_THRIFT_TRANSPORT_TVIRTUALTRANSPORT_H_
+#define _LBUG_THRIFT_TRANSPORT_TVIRTUALTRANSPORT_H_ 1
+
+#include "transport/TTransport.h"
+
+namespace lbug_apache {
+namespace thrift {
+namespace transport {
+
+/**
+ * Helper class that provides default implementations of TTransport methods.
+ *
+ * This class provides default implementations of read(), readAll(), write(),
+ * borrow() and consume().
+ *
+ * In the TTransport base class, each of these methods simply invokes its
+ * virtual counterpart.  This class overrides them to always perform the
+ * default behavior, without a virtual function call.
+ *
+ * The primary purpose of this class is to serve as a base class for
+ * TVirtualTransport, and prevent infinite recursion if one of its subclasses
+ * does not override the TTransport implementation of these methods.  (Since
+ * TVirtualTransport::read_virt() calls read(), and TTransport::read() calls
+ * read_virt().)
+ */
+class TTransportDefaults : public TTransport {
+public:
+  /*
+   * TTransport *_virt() methods provide reasonable default implementations.
+   * Invoke them non-virtually.
+   */
+  uint32_t read(uint8_t* buf, uint32_t len) { return this->TTransport::read_virt(buf, len); }
+  uint32_t readAll(uint8_t* buf, uint32_t len) { return this->TTransport::readAll_virt(buf, len); }
+  void write(const uint8_t* buf, uint32_t len) { this->TTransport::write_virt(buf, len); }
+  const uint8_t* borrow(uint8_t* buf, uint32_t* len) {
+    return this->TTransport::borrow_virt(buf, len);
+  }
+  void consume(uint32_t len) { this->TTransport::consume_virt(len); }
+
+protected:
+  TTransportDefaults() = default;
+};
+
+/**
+ * Helper class to provide polymorphism for subclasses of TTransport.
+ *
+ * This class implements *_virt() methods of TTransport, to call the
+ * non-virtual versions of these functions in the proper subclass.
+ *
+ * To define your own transport class using TVirtualTransport:
+ * 1) Derive your subclass from TVirtualTransport<your class>
+ *    e.g:  class MyTransport : public TVirtualTransport<MyTransport> {
+ * 2) Provide your own implementations of read(), readAll(), etc.
+ *    These methods should be non-virtual.
+ *
+ * Transport implementations that need to use virtual inheritance when
+ * inheriting from TTransport cannot use TVirtualTransport.
+ *
+ * @author Chad Walters <chad@powerset.com>
+ */
+template <class Transport_, class Super_ = TTransportDefaults>
+class TVirtualTransport : public Super_ {
+public:
+  /*
+   * Implementations of the *_virt() functions, to call the subclass's
+   * non-virtual implementation function.
+   */
+  uint32_t read_virt(uint8_t* buf, uint32_t len) override {
+    return static_cast<Transport_*>(this)->read(buf, len);
+  }
+
+  uint32_t readAll_virt(uint8_t* buf, uint32_t len) override {
+    return static_cast<Transport_*>(this)->readAll(buf, len);
+  }
+
+  void write_virt(const uint8_t* buf, uint32_t len) override {
+    static_cast<Transport_*>(this)->write(buf, len);
+  }
+
+  const uint8_t* borrow_virt(uint8_t* buf, uint32_t* len) override {
+    return static_cast<Transport_*>(this)->borrow(buf, len);
+  }
+
+  void consume_virt(uint32_t len) override { static_cast<Transport_*>(this)->consume(len); }
+
+  /*
+   * Provide a default readAll() implementation that invokes
+   * read() non-virtually.
+   *
+   * Note: subclasses that use TVirtualTransport to derive from another
+   * transport implementation (i.e., not TTransportDefaults) should beware that
+   * this may override any non-default readAll() implementation provided by
+   * the parent transport class.  They may need to redefine readAll() to call
+   * the correct parent implementation, if desired.
+   */
+  uint32_t readAll(uint8_t* buf, uint32_t len) {
+    auto* trans = static_cast<Transport_*>(this);
+    return ::lbug_apache::thrift::transport::readAll(*trans, buf, len);
+  }
+
+protected:
+  TVirtualTransport() = default;
+
+  /*
+   * Templatized constructors, to allow arguments to be passed to the Super_
+   * constructor.  Currently we only support 0, 1, or 2 arguments, but
+   * additional versions can be added as needed.
+   */
+  template <typename Arg_>
+  TVirtualTransport(Arg_ const& arg)
+    : Super_(arg) {}
+
+  template <typename Arg1_, typename Arg2_>
+  TVirtualTransport(Arg1_ const& a1, Arg2_ const& a2)
+    : Super_(a1, a2) {}
+};
+}
+}
+} // lbug_apache::thrift::transport
+
+#endif // #ifndef _LBUG_THRIFT_TRANSPORT_TVIRTUALTRANSPORT_H_
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/CMakeLists.txt
new file mode 100644
index 0000000000..aa0dcd76bc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/CMakeLists.txt
@@ -0,0 +1,6 @@
+add_library(utf8proc
+        STATIC
+        utf8proc.cpp
+        utf8proc_wrapper.cpp)
+
+target_include_directories(utf8proc PUBLIC ./include)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/LICENSE.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/LICENSE.md
new file mode 100644
index 0000000000..f18b1f3abd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/LICENSE.md
@@ -0,0 +1,93 @@
+## utf8proc license ##
+
+**utf8proc** is a software package originally developed
+by Jan Behrens and the rest of the Public Software Group, who
+deserve nearly all of the credit for this library, that is now maintained by the Julia-language developers.  Like the original utf8proc,
+whose copyright and license statements are reproduced below, all new
+work on the utf8proc library is licensed under the [MIT "expat"
+license](http://opensource.org/licenses/MIT):
+
+*Copyright &copy; 2014-2021 by Steven G. Johnson, Jiahao Chen, Tony Kelman, Jonas Fonseca, and other contributors listed in the git history.*
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the "Software"),
+to deal in the Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute, sublicense,
+and/or sell copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+## Original utf8proc license ##
+
+*Copyright (c) 2009, 2013 Public Software Group e. V., Berlin, Germany*
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the "Software"),
+to deal in the Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute, sublicense,
+and/or sell copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+
+## Unicode data license ##
+
+This software contains data (`utf8proc_data.c`) derived from processing
+the Unicode data files. The following license applies to that data:
+
+**COPYRIGHT AND PERMISSION NOTICE**
+
+*Copyright (c) 1991-2007 Unicode, Inc. All rights reserved. Distributed
+under the Terms of Use in http://www.unicode.org/copyright.html.*
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of the Unicode data files and any associated documentation (the "Data
+Files") or Unicode software and any associated documentation (the
+"Software") to deal in the Data Files or Software without restriction,
+including without limitation the rights to use, copy, modify, merge,
+publish, distribute, and/or sell copies of the Data Files or Software, and
+to permit persons to whom the Data Files or Software are furnished to do
+so, provided that (a) the above copyright notice(s) and this permission
+notice appear with all copies of the Data Files or Software, (b) both the
+above copyright notice(s) and this permission notice appear in associated
+documentation, and (c) there is clear notice in each modified Data File or
+in the Software as well as in the documentation associated with the Data
+File(s) or Software that the data or software has been modified.
+
+THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
+KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
+THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS
+INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR
+CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
+USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THE DATA FILES OR SOFTWARE.
+
+Except as contained in this notice, the name of a copyright holder shall
+not be used in advertising or otherwise to promote the sale, use or other
+dealings in these Data Files or Software without prior written
+authorization of the copyright holder.
+
+Unicode and the Unicode logo are trademarks of Unicode, Inc., and may be
+registered in some jurisdictions. All other trademarks and registered
+trademarks mentioned herein are the property of their respective owners.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/include/utf8proc.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/include/utf8proc.h
new file mode 100644
index 0000000000..2229f0a289
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/include/utf8proc.h
@@ -0,0 +1,768 @@
+/*
+ * Copyright (c) 2014-2019 Steven G. Johnson, Jiahao Chen, Peter Colberg, Tony Kelman, Scott P.
+ * Jones, and other contributors. Copyright (c) 2009 Public Software Group e. V., Berlin, Germany
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+ * DEALINGS IN THE SOFTWARE.
+ */
+
+/**
+ * @mainpage
+ *
+ * utf8proc is a free/open-source (MIT/expat licensed) C library
+ * providing Unicode normalization, case-folding, and other operations
+ * for strings in the UTF-8 encoding, supporting up-to-date Unicode versions.
+ * See the utf8proc home page (http://julialang.org/utf8proc/)
+ * for downloads and other information, or the source code on github
+ * (https://github.com/JuliaLang/utf8proc).
+ *
+ * For the utf8proc API documentation, see: @ref utf8proc.h
+ *
+ * The features of utf8proc include:
+ *
+ * - Transformation of strings (@ref utf8proc_map) to:
+ *    - decompose (@ref UTF8PROC_DECOMPOSE) or compose (@ref UTF8PROC_COMPOSE) Unicode combining
+ * characters (http://en.wikipedia.org/wiki/Combining_character)
+ *    - canonicalize Unicode compatibility characters (@ref UTF8PROC_COMPAT)
+ *    - strip "ignorable" (@ref UTF8PROC_IGNORE) characters, control characters (@ref
+ * UTF8PROC_STRIPCC), or combining characters such as accents (@ref UTF8PROC_STRIPMARK)
+ *    - case-folding (@ref UTF8PROC_CASEFOLD)
+ * - Unicode normalization: @ref utf8proc_NFD, @ref utf8proc_NFC, @ref utf8proc_NFKD, @ref
+ * utf8proc_NFKC
+ * - Detecting grapheme boundaries (@ref utf8proc_grapheme_break and @ref UTF8PROC_CHARBOUND)
+ * - Character-width computation: @ref utf8proc_charwidth
+ * - Classification of characters by Unicode category: @ref utf8proc_category and @ref
+ * utf8proc_category_string
+ * - Encode (@ref utf8proc_encode_char) and decode (@ref utf8proc_iterate) Unicode codepoints
+ * to/from UTF-8.
+ */
+
+/** @file */
+
+#ifndef UTF8PROC_H
+#define UTF8PROC_H
+
+/** @name API version
+ *
+ * The utf8proc API version MAJOR.MINOR.PATCH, following
+ * semantic-versioning rules (http://semver.org) based on API
+ * compatibility.
+ *
+ * This is also returned at runtime by @ref utf8proc_version; however, the
+ * runtime version may append a string like "-dev" to the version number
+ * for prerelease versions.
+ *
+ * @note The shared-library version number in the Makefile
+ *       (and CMakeLists.txt, and MANIFEST) may be different,
+ *       being based on ABI compatibility rather than API compatibility.
+ */
+/** @{ */
+/** The MAJOR version number (increased when backwards API compatibility is broken). */
+#define UTF8PROC_VERSION_MAJOR 2
+/** The MINOR version number (increased when new functionality is added in a backwards-compatible
+ * manner). */
+#define UTF8PROC_VERSION_MINOR 4
+/** The PATCH version (increased for fixes that do not change the API). */
+#define UTF8PROC_VERSION_PATCH 0
+/** @} */
+
+#include <stdlib.h>
+
+#if defined(_MSC_VER) && _MSC_VER < 1800
+// MSVC prior to 2013 lacked stdbool.h and inttypes.h
+typedef signed char utf8proc_int8_t;
+typedef unsigned char utf8proc_uint8_t;
+typedef short utf8proc_int16_t;
+typedef unsigned short utf8proc_uint16_t;
+typedef int utf8proc_int32_t;
+typedef unsigned int utf8proc_uint32_t;
+#ifdef _WIN64
+typedef __int64 utf8proc_ssize_t;
+typedef unsigned __int64 utf8proc_size_t;
+#else
+typedef int utf8proc_ssize_t;
+typedef unsigned int utf8proc_size_t;
+#endif
+#ifndef __cplusplus
+// emulate C99 bool
+typedef unsigned char utf8proc_bool;
+#ifndef __bool_true_false_are_defined
+#define false 0
+#define true 1
+#define __bool_true_false_are_defined 1
+#endif
+#else
+typedef bool utf8proc_bool;
+#endif
+#else
+#include <inttypes.h>
+#include <stdbool.h>
+#include <stddef.h>
+#endif
+#include <limits.h>
+
+#define UTF8PROC_DLLEXPORT
+// #ifdef UTF8PROC_STATIC
+// #  define UTF8PROC_DLLEXPORT
+// #else
+// #  ifdef _WIN32
+// #    ifdef UTF8PROC_EXPORTS
+// #      define UTF8PROC_DLLEXPORT __declspec(dllexport)
+// #    else
+// #      define UTF8PROC_DLLEXPORT __declspec(dllimport)
+// #    endif
+// #  elif __GNUC__ >= 4
+// #    define UTF8PROC_DLLEXPORT __attribute__ ((visibility("default")))
+// #  else
+// #    define UTF8PROC_DLLEXPORT
+// #  endif
+// #endif
+
+namespace lbug {
+namespace utf8proc {
+
+typedef int8_t utf8proc_int8_t;
+typedef uint8_t utf8proc_uint8_t;
+typedef int16_t utf8proc_int16_t;
+typedef uint16_t utf8proc_uint16_t;
+typedef int32_t utf8proc_int32_t;
+typedef uint32_t utf8proc_uint32_t;
+typedef size_t utf8proc_size_t;
+typedef ptrdiff_t utf8proc_ssize_t;
+typedef bool utf8proc_bool;
+
+// #ifdef __cplusplus
+//  extern "C" {
+// #endif
+
+/**
+ * Option flags used by several functions in the library.
+ */
+typedef enum {
+    /** The given UTF-8 input is NULL terminated. */
+    UTF8PROC_NULLTERM = (1 << 0),
+    /** Unicode Versioning Stability has to be respected. */
+    UTF8PROC_STABLE = (1 << 1),
+    /** Compatibility decomposition (i.e. formatting information is lost). */
+    UTF8PROC_COMPAT = (1 << 2),
+    /** Return a result with decomposed characters. */
+    UTF8PROC_COMPOSE = (1 << 3),
+    /** Return a result with decomposed characters. */
+    UTF8PROC_DECOMPOSE = (1 << 4),
+    /** Strip "default ignorable characters" such as SOFT-HYPHEN or ZERO-WIDTH-SPACE. */
+    UTF8PROC_IGNORE = (1 << 5),
+    /** Return an error, if the input contains unassigned codepoints. */
+    UTF8PROC_REJECTNA = (1 << 6),
+    /**
+     * Indicating that NLF-sequences (LF, CRLF, CR, NEL) are representing a
+     * line break, and should be converted to the codepoint for line
+     * separation (LS).
+     */
+    UTF8PROC_NLF2LS = (1 << 7),
+    /**
+     * Indicating that NLF-sequences are representing a paragraph break, and
+     * should be converted to the codepoint for paragraph separation
+     * (PS).
+     */
+    UTF8PROC_NLF2PS = (1 << 8),
+    /** Indicating that the meaning of NLF-sequences is unknown. */
+    UTF8PROC_NLF2LF = (UTF8PROC_NLF2LS | UTF8PROC_NLF2PS),
+    /** Strips and/or convers control characters.
+     *
+     * NLF-sequences are transformed into space, except if one of the
+     * NLF2LS/PS/LF options is given. HorizontalTab (HT) and FormFeed (FF)
+     * are treated as a NLF-sequence in this case.  All other control
+     * characters are simply removed.
+     */
+    UTF8PROC_STRIPCC = (1 << 9),
+    /**
+     * Performs unicode case folding, to be able to do a case-insensitive
+     * string comparison.
+     */
+    UTF8PROC_CASEFOLD = (1 << 10),
+    /**
+     * Inserts 0xFF bytes at the beginning of each sequence which is
+     * representing a single grapheme cluster (see UAX#29).
+     */
+    UTF8PROC_CHARBOUND = (1 << 11),
+    /** Lumps certain characters together.
+     *
+     * E.g. HYPHEN U+2010 and MINUS U+2212 to ASCII "-". See lump.md for details.
+     *
+     * If NLF2LF is set, this includes a transformation of paragraph and
+     * line separators to ASCII line-feed (LF).
+     */
+    UTF8PROC_LUMP = (1 << 12),
+    /** Strips all character markings.
+     *
+     * This includes non-spacing, spacing and enclosing (i.e. accents).
+     * @note This option works only with @ref UTF8PROC_COMPOSE or
+     *       @ref UTF8PROC_DECOMPOSE
+     */
+    UTF8PROC_STRIPMARK = (1 << 13),
+    /**
+     * Strip unassigned codepoints.
+     */
+    UTF8PROC_STRIPNA = (1 << 14),
+} utf8proc_option_t;
+
+/** @name Error codes
+ * Error codes being returned by almost all functions.
+ */
+/** @{ */
+/** Memory could not be allocated. */
+#define UTF8PROC_ERROR_NOMEM -1
+/** The given string is too long to be processed. */
+#define UTF8PROC_ERROR_OVERFLOW -2
+/** The given string is not a legal UTF-8 string. */
+#define UTF8PROC_ERROR_INVALIDUTF8 -3
+/** The @ref UTF8PROC_REJECTNA flag was set and an unassigned codepoint was found. */
+#define UTF8PROC_ERROR_NOTASSIGNED -4
+/** Invalid options have been used. */
+#define UTF8PROC_ERROR_INVALIDOPTS -5
+/** @} */
+
+/* @name Types */
+
+/** Holds the value of a property. */
+typedef utf8proc_int16_t utf8proc_propval_t;
+
+/** Struct containing information about a codepoint. */
+typedef struct utf8proc_property_struct {
+    /**
+     * Unicode category.
+     * @see utf8proc_category_t.
+     */
+    utf8proc_propval_t category;
+    utf8proc_propval_t combining_class;
+    /**
+     * Bidirectional class.
+     * @see utf8proc_bidi_class_t.
+     */
+    utf8proc_propval_t bidi_class;
+    /**
+     * @anchor Decomposition type.
+     * @see utf8proc_decomp_type_t.
+     */
+    utf8proc_propval_t decomp_type;
+    utf8proc_uint16_t decomp_seqindex;
+    utf8proc_uint16_t casefold_seqindex;
+    utf8proc_uint16_t uppercase_seqindex;
+    utf8proc_uint16_t lowercase_seqindex;
+    utf8proc_uint16_t titlecase_seqindex;
+    utf8proc_uint16_t comb_index;
+    unsigned bidi_mirrored : 1;
+    unsigned comp_exclusion : 1;
+    /**
+     * Can this codepoint be ignored?
+     *
+     * Used by @ref utf8proc_decompose_char when @ref UTF8PROC_IGNORE is
+     * passed as an option.
+     */
+    unsigned ignorable : 1;
+    unsigned control_boundary : 1;
+    /** The width of the codepoint. */
+    unsigned charwidth : 2;
+    unsigned pad : 2;
+    /**
+     * Boundclass.
+     * @see utf8proc_boundclass_t.
+     */
+    unsigned boundclass : 8;
+} utf8proc_property_t;
+
+/** Unicode categories. */
+typedef enum {
+    UTF8PROC_CATEGORY_CN = 0,  /**< Other, not assigned */
+    UTF8PROC_CATEGORY_LU = 1,  /**< Letter, uppercase */
+    UTF8PROC_CATEGORY_LL = 2,  /**< Letter, lowercase */
+    UTF8PROC_CATEGORY_LT = 3,  /**< Letter, titlecase */
+    UTF8PROC_CATEGORY_LM = 4,  /**< Letter, modifier */
+    UTF8PROC_CATEGORY_LO = 5,  /**< Letter, other */
+    UTF8PROC_CATEGORY_MN = 6,  /**< Mark, nonspacing */
+    UTF8PROC_CATEGORY_MC = 7,  /**< Mark, spacing combining */
+    UTF8PROC_CATEGORY_ME = 8,  /**< Mark, enclosing */
+    UTF8PROC_CATEGORY_ND = 9,  /**< Number, decimal digit */
+    UTF8PROC_CATEGORY_NL = 10, /**< Number, letter */
+    UTF8PROC_CATEGORY_NO = 11, /**< Number, other */
+    UTF8PROC_CATEGORY_PC = 12, /**< Punctuation, connector */
+    UTF8PROC_CATEGORY_PD = 13, /**< Punctuation, dash */
+    UTF8PROC_CATEGORY_PS = 14, /**< Punctuation, open */
+    UTF8PROC_CATEGORY_PE = 15, /**< Punctuation, close */
+    UTF8PROC_CATEGORY_PI = 16, /**< Punctuation, initial quote */
+    UTF8PROC_CATEGORY_PF = 17, /**< Punctuation, final quote */
+    UTF8PROC_CATEGORY_PO = 18, /**< Punctuation, other */
+    UTF8PROC_CATEGORY_SM = 19, /**< Symbol, math */
+    UTF8PROC_CATEGORY_SC = 20, /**< Symbol, currency */
+    UTF8PROC_CATEGORY_SK = 21, /**< Symbol, modifier */
+    UTF8PROC_CATEGORY_SO = 22, /**< Symbol, other */
+    UTF8PROC_CATEGORY_ZS = 23, /**< Separator, space */
+    UTF8PROC_CATEGORY_ZL = 24, /**< Separator, line */
+    UTF8PROC_CATEGORY_ZP = 25, /**< Separator, paragraph */
+    UTF8PROC_CATEGORY_CC = 26, /**< Other, control */
+    UTF8PROC_CATEGORY_CF = 27, /**< Other, format */
+    UTF8PROC_CATEGORY_CS = 28, /**< Other, surrogate */
+    UTF8PROC_CATEGORY_CO = 29, /**< Other, private use */
+} utf8proc_category_t;
+
+/** Bidirectional character classes. */
+typedef enum {
+    UTF8PROC_BIDI_CLASS_L = 1,    /**< Left-to-Right */
+    UTF8PROC_BIDI_CLASS_LRE = 2,  /**< Left-to-Right Embedding */
+    UTF8PROC_BIDI_CLASS_LRO = 3,  /**< Left-to-Right Override */
+    UTF8PROC_BIDI_CLASS_R = 4,    /**< Right-to-Left */
+    UTF8PROC_BIDI_CLASS_AL = 5,   /**< Right-to-Left Arabic */
+    UTF8PROC_BIDI_CLASS_RLE = 6,  /**< Right-to-Left Embedding */
+    UTF8PROC_BIDI_CLASS_RLO = 7,  /**< Right-to-Left Override */
+    UTF8PROC_BIDI_CLASS_PDF = 8,  /**< Pop Directional Format */
+    UTF8PROC_BIDI_CLASS_EN = 9,   /**< European Number */
+    UTF8PROC_BIDI_CLASS_ES = 10,  /**< European Separator */
+    UTF8PROC_BIDI_CLASS_ET = 11,  /**< European Number Terminator */
+    UTF8PROC_BIDI_CLASS_AN = 12,  /**< Arabic Number */
+    UTF8PROC_BIDI_CLASS_CS = 13,  /**< Common Number Separator */
+    UTF8PROC_BIDI_CLASS_NSM = 14, /**< Nonspacing Mark */
+    UTF8PROC_BIDI_CLASS_BN = 15,  /**< Boundary Neutral */
+    UTF8PROC_BIDI_CLASS_B = 16,   /**< Paragraph Separator */
+    UTF8PROC_BIDI_CLASS_S = 17,   /**< Segment Separator */
+    UTF8PROC_BIDI_CLASS_WS = 18,  /**< Whitespace */
+    UTF8PROC_BIDI_CLASS_ON = 19,  /**< Other Neutrals */
+    UTF8PROC_BIDI_CLASS_LRI = 20, /**< Left-to-Right Isolate */
+    UTF8PROC_BIDI_CLASS_RLI = 21, /**< Right-to-Left Isolate */
+    UTF8PROC_BIDI_CLASS_FSI = 22, /**< First Strong Isolate */
+    UTF8PROC_BIDI_CLASS_PDI = 23, /**< Pop Directional Isolate */
+} utf8proc_bidi_class_t;
+
+/** Decomposition type. */
+typedef enum {
+    UTF8PROC_DECOMP_TYPE_FONT = 1,      /**< Font */
+    UTF8PROC_DECOMP_TYPE_NOBREAK = 2,   /**< Nobreak */
+    UTF8PROC_DECOMP_TYPE_INITIAL = 3,   /**< Initial */
+    UTF8PROC_DECOMP_TYPE_MEDIAL = 4,    /**< Medial */
+    UTF8PROC_DECOMP_TYPE_FINAL = 5,     /**< Final */
+    UTF8PROC_DECOMP_TYPE_ISOLATED = 6,  /**< Isolated */
+    UTF8PROC_DECOMP_TYPE_CIRCLE = 7,    /**< Circle */
+    UTF8PROC_DECOMP_TYPE_SUPER = 8,     /**< Super */
+    UTF8PROC_DECOMP_TYPE_SUB = 9,       /**< Sub */
+    UTF8PROC_DECOMP_TYPE_VERTICAL = 10, /**< Vertical */
+    UTF8PROC_DECOMP_TYPE_WIDE = 11,     /**< Wide */
+    UTF8PROC_DECOMP_TYPE_NARROW = 12,   /**< Narrow */
+    UTF8PROC_DECOMP_TYPE_SMALL = 13,    /**< Small */
+    UTF8PROC_DECOMP_TYPE_SQUARE = 14,   /**< Square */
+    UTF8PROC_DECOMP_TYPE_FRACTION = 15, /**< Fraction */
+    UTF8PROC_DECOMP_TYPE_COMPAT = 16,   /**< Compat */
+} utf8proc_decomp_type_t;
+
+/** Boundclass property. (TR29) */
+typedef enum {
+    UTF8PROC_BOUNDCLASS_START = 0,               /**< Start */
+    UTF8PROC_BOUNDCLASS_OTHER = 1,               /**< Other */
+    UTF8PROC_BOUNDCLASS_CR = 2,                  /**< Cr */
+    UTF8PROC_BOUNDCLASS_LF = 3,                  /**< Lf */
+    UTF8PROC_BOUNDCLASS_CONTROL = 4,             /**< Control */
+    UTF8PROC_BOUNDCLASS_EXTEND = 5,              /**< Extend */
+    UTF8PROC_BOUNDCLASS_L = 6,                   /**< L */
+    UTF8PROC_BOUNDCLASS_V = 7,                   /**< V */
+    UTF8PROC_BOUNDCLASS_T = 8,                   /**< T */
+    UTF8PROC_BOUNDCLASS_LV = 9,                  /**< Lv */
+    UTF8PROC_BOUNDCLASS_LVT = 10,                /**< Lvt */
+    UTF8PROC_BOUNDCLASS_REGIONAL_INDICATOR = 11, /**< Regional indicator */
+    UTF8PROC_BOUNDCLASS_SPACINGMARK = 12,        /**< Spacingmark */
+    UTF8PROC_BOUNDCLASS_PREPEND = 13,            /**< Prepend */
+    UTF8PROC_BOUNDCLASS_ZWJ = 14,                /**< Zero Width Joiner */
+
+    /* the following are no longer used in Unicode 11, but we keep
+       the constants here for backward compatibility */
+    UTF8PROC_BOUNDCLASS_E_BASE = 15,         /**< Emoji Base */
+    UTF8PROC_BOUNDCLASS_E_MODIFIER = 16,     /**< Emoji Modifier */
+    UTF8PROC_BOUNDCLASS_GLUE_AFTER_ZWJ = 17, /**< Glue_After_ZWJ */
+    UTF8PROC_BOUNDCLASS_E_BASE_GAZ = 18,     /**< E_BASE + GLUE_AFTER_ZJW */
+
+    /* the Extended_Pictographic property is used in the Unicode 11
+       grapheme-boundary rules, so we store it in the boundclass field */
+    UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC = 19,
+    UTF8PROC_BOUNDCLASS_E_ZWG = 20, /* UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC + ZWJ */
+} utf8proc_boundclass_t;
+
+/**
+ * Function pointer type passed to @ref utf8proc_map_custom and
+ * @ref utf8proc_decompose_custom, which is used to specify a user-defined
+ * mapping of codepoints to be applied in conjunction with other mappings.
+ */
+typedef utf8proc_int32_t (*utf8proc_custom_func)(utf8proc_int32_t codepoint, void* data);
+
+/**
+ * Array containing the byte lengths of a UTF-8 encoded codepoint based
+ * on the first byte.
+ */
+// UTF8PROC_DLLEXPORT extern const utf8proc_int8_t utf8proc_utf8class[256];
+
+/**
+ * Returns the utf8proc API version as a string MAJOR.MINOR.PATCH
+ * (http://semver.org format), possibly with a "-dev" suffix for
+ * development versions.
+ */
+UTF8PROC_DLLEXPORT const char* utf8proc_version(void);
+
+/**
+ * Returns the utf8proc supported Unicode version as a string MAJOR.MINOR.PATCH.
+ */
+UTF8PROC_DLLEXPORT const char* utf8proc_unicode_version(void);
+
+/**
+ * Returns an informative error string for the given utf8proc error code
+ * (e.g. the error codes returned by @ref utf8proc_map).
+ */
+UTF8PROC_DLLEXPORT const char* utf8proc_errmsg(utf8proc_ssize_t errcode);
+
+/**
+ * Reads a single codepoint from the UTF-8 sequence being pointed to by `str`.
+ * The maximum number of bytes read is `strlen`, unless `strlen` is
+ * negative (in which case up to 4 bytes are read).
+ *
+ * If a valid codepoint could be read, it is stored in the variable
+ * pointed to by `codepoint_ref`, otherwise that variable will be set to -1.
+ * In case of success, the number of bytes read is returned; otherwise, a
+ * negative error code is returned.
+ */
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_iterate(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t strlen, utf8proc_int32_t* codepoint_ref);
+
+/**
+ * Check if a codepoint is valid (regardless of whether it has been
+ * assigned a value by the current Unicode standard).
+ *
+ * @return 1 if the given `codepoint` is valid and otherwise return 0.
+ */
+UTF8PROC_DLLEXPORT utf8proc_bool utf8proc_codepoint_valid(utf8proc_int32_t codepoint);
+
+/**
+ * Encodes the codepoint as an UTF-8 string in the byte array pointed
+ * to by `dst`. This array must be at least 4 bytes long.
+ *
+ * In case of success the number of bytes written is returned, and
+ * otherwise 0 is returned.
+ *
+ * This function does not check whether `codepoint` is valid Unicode.
+ */
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_encode_char(
+    utf8proc_int32_t codepoint, utf8proc_uint8_t* dst);
+
+/**
+ * Look up the properties for a given codepoint.
+ *
+ * @param codepoint The Unicode codepoint.
+ *
+ * @returns
+ * A pointer to a (constant) struct containing information about
+ * the codepoint.
+ * @par
+ * If the codepoint is unassigned or invalid, a pointer to a special struct is
+ * returned in which `category` is 0 (@ref UTF8PROC_CATEGORY_CN).
+ */
+UTF8PROC_DLLEXPORT const utf8proc_property_t* utf8proc_get_property(utf8proc_int32_t codepoint);
+
+/** Decompose a codepoint into an array of codepoints.
+ *
+ * @param codepoint the codepoint.
+ * @param dst the destination buffer.
+ * @param bufsize the size of the destination buffer.
+ * @param options one or more of the following flags:
+ * - @ref UTF8PROC_REJECTNA  - return an error `codepoint` is unassigned
+ * - @ref UTF8PROC_IGNORE    - strip "default ignorable" codepoints
+ * - @ref UTF8PROC_CASEFOLD  - apply Unicode casefolding
+ * - @ref UTF8PROC_COMPAT    - replace certain codepoints with their
+ *                             compatibility decomposition
+ * - @ref UTF8PROC_CHARBOUND - insert 0xFF bytes before each grapheme cluster
+ * - @ref UTF8PROC_LUMP      - lump certain different codepoints together
+ * - @ref UTF8PROC_STRIPMARK - remove all character marks
+ * - @ref UTF8PROC_STRIPNA   - remove unassigned codepoints
+ * @param last_boundclass
+ * Pointer to an integer variable containing
+ * the previous codepoint's boundary class if the @ref UTF8PROC_CHARBOUND
+ * option is used.  Otherwise, this parameter is ignored.
+ *
+ * @return
+ * In case of success, the number of codepoints written is returned; in case
+ * of an error, a negative error code is returned (@ref utf8proc_errmsg).
+ * @par
+ * If the number of written codepoints would be bigger than `bufsize`, the
+ * required buffer size is returned, while the buffer will be overwritten with
+ * undefined data.
+ */
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_decompose_char(utf8proc_int32_t codepoint,
+    utf8proc_int32_t* dst, utf8proc_ssize_t bufsize, utf8proc_option_t options,
+    int* last_boundclass);
+
+/**
+ * The same as @ref utf8proc_decompose_char, but acts on a whole UTF-8
+ * string and orders the decomposed sequences correctly.
+ *
+ * If the @ref UTF8PROC_NULLTERM flag in `options` is set, processing
+ * will be stopped, when a NULL byte is encounted, otherwise `strlen`
+ * bytes are processed.  The result (in the form of 32-bit unicode
+ * codepoints) is written into the buffer being pointed to by
+ * `buffer` (which must contain at least `bufsize` entries).  In case of
+ * success, the number of codepoints written is returned; in case of an
+ * error, a negative error code is returned (@ref utf8proc_errmsg).
+ * See @ref utf8proc_decompose_custom to supply additional transformations.
+ *
+ * If the number of written codepoints would be bigger than `bufsize`, the
+ * required buffer size is returned, while the buffer will be overwritten with
+ * undefined data.
+ */
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_decompose(const utf8proc_uint8_t* str,
+    utf8proc_ssize_t strlen, utf8proc_int32_t* buffer, utf8proc_ssize_t bufsize,
+    utf8proc_option_t options);
+
+/**
+ * The same as @ref utf8proc_decompose, but also takes a `custom_func` mapping function
+ * that is called on each codepoint in `str` before any other transformations
+ * (along with a `custom_data` pointer that is passed through to `custom_func`).
+ * The `custom_func` argument is ignored if it is `NULL`.  See also @ref utf8proc_map_custom.
+ */
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_decompose_custom(const utf8proc_uint8_t* str,
+    utf8proc_ssize_t strlen, utf8proc_int32_t* buffer, utf8proc_ssize_t bufsize,
+    utf8proc_option_t options, utf8proc_custom_func custom_func, void* custom_data);
+
+/**
+ * Normalizes the sequence of `length` codepoints pointed to by `buffer`
+ * in-place (i.e., the result is also stored in `buffer`).
+ *
+ * @param buffer the (native-endian UTF-32) unicode codepoints to re-encode.
+ * @param length the length (in codepoints) of the buffer.
+ * @param options a bitwise or (`|`) of one or more of the following flags:
+ * - @ref UTF8PROC_NLF2LS  - convert LF, CRLF, CR and NEL into LS
+ * - @ref UTF8PROC_NLF2PS  - convert LF, CRLF, CR and NEL into PS
+ * - @ref UTF8PROC_NLF2LF  - convert LF, CRLF, CR and NEL into LF
+ * - @ref UTF8PROC_STRIPCC - strip or convert all non-affected control characters
+ * - @ref UTF8PROC_COMPOSE - try to combine decomposed codepoints into composite
+ *                           codepoints
+ * - @ref UTF8PROC_STABLE  - prohibit combining characters that would violate
+ *                           the unicode versioning stability
+ *
+ * @return
+ * In case of success, the length (in codepoints) of the normalized UTF-32 string is
+ * returned; otherwise, a negative error code is returned (@ref utf8proc_errmsg).
+ *
+ * @warning The entries of the array pointed to by `str` have to be in the
+ *          range `0x0000` to `0x10FFFF`. Otherwise, the program might crash!
+ */
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_normalize_utf32(
+    utf8proc_int32_t* buffer, utf8proc_ssize_t length, utf8proc_option_t options);
+
+/**
+ * Reencodes the sequence of `length` codepoints pointed to by `buffer`
+ * UTF-8 data in-place (i.e., the result is also stored in `buffer`).
+ * Can optionally normalize the UTF-32 sequence prior to UTF-8 conversion.
+ *
+ * @param buffer the (native-endian UTF-32) unicode codepoints to re-encode.
+ * @param length the length (in codepoints) of the buffer.
+ * @param options a bitwise or (`|`) of one or more of the following flags:
+ * - @ref UTF8PROC_NLF2LS  - convert LF, CRLF, CR and NEL into LS
+ * - @ref UTF8PROC_NLF2PS  - convert LF, CRLF, CR and NEL into PS
+ * - @ref UTF8PROC_NLF2LF  - convert LF, CRLF, CR and NEL into LF
+ * - @ref UTF8PROC_STRIPCC - strip or convert all non-affected control characters
+ * - @ref UTF8PROC_COMPOSE - try to combine decomposed codepoints into composite
+ *                           codepoints
+ * - @ref UTF8PROC_STABLE  - prohibit combining characters that would violate
+ *                           the unicode versioning stability
+ * - @ref UTF8PROC_CHARBOUND - insert 0xFF bytes before each grapheme cluster
+ *
+ * @return
+ * In case of success, the length (in bytes) of the resulting nul-terminated
+ * UTF-8 string is returned; otherwise, a negative error code is returned
+ * (@ref utf8proc_errmsg).
+ *
+ * @warning The amount of free space pointed to by `buffer` must
+ *          exceed the amount of the input data by one byte, and the
+ *          entries of the array pointed to by `str` have to be in the
+ *          range `0x0000` to `0x10FFFF`. Otherwise, the program might crash!
+ */
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_reencode(
+    utf8proc_int32_t* buffer, utf8proc_ssize_t length, utf8proc_option_t options);
+
+/**
+ * Given a pair of consecutive codepoints, return whether a grapheme break is
+ * permitted between them (as defined by the extended grapheme clusters in UAX#29).
+ *
+ * @param codepoint1 The first codepoint.
+ * @param codepoint2 The second codepoint, occurring consecutively after `codepoint1`.
+ * @param state Beginning with Version 29 (Unicode 9.0.0), this algorithm requires
+ *              state to break graphemes. This state can be passed in as a pointer
+ *              in the `state` argument and should initially be set to 0. If the
+ *              state is not passed in (i.e. a null pointer is passed), UAX#29 rules
+ *              GB10/12/13 which require this state will not be applied, essentially
+ *              matching the rules in Unicode 8.0.0.
+ *
+ * @warning If the state parameter is used, `utf8proc_grapheme_break_stateful` must
+ *          be called IN ORDER on ALL potential breaks in a string.  However, it
+ *          is safe to reset the state to zero after a grapheme break.
+ */
+UTF8PROC_DLLEXPORT utf8proc_bool utf8proc_grapheme_break_stateful(
+    utf8proc_int32_t codepoint1, utf8proc_int32_t codepoint2, utf8proc_int32_t* state);
+
+/**
+ * Same as @ref utf8proc_grapheme_break_stateful, except without support for the
+ * Unicode 9 additions to the algorithm. Supported for legacy reasons.
+ */
+UTF8PROC_DLLEXPORT utf8proc_bool utf8proc_grapheme_break(
+    utf8proc_int32_t codepoint1, utf8proc_int32_t codepoint2);
+
+//! Returns the current UTF8 codepoint in a UTF8 string. Assumes the string is valid UTF8.
+UTF8PROC_DLLEXPORT utf8proc_int32_t utf8proc_codepoint(const char* u_input, int& sz);
+UTF8PROC_DLLEXPORT utf8proc_bool grapheme_break_extended(int lbc, int tbc, utf8proc_int32_t* state);
+UTF8PROC_DLLEXPORT utf8proc_int32_t utf8proc_codepoint(const char* u_input, int& sz);
+UTF8PROC_DLLEXPORT bool utf8proc_codepoint_to_utf8(int cp, int& sz, char* c);
+UTF8PROC_DLLEXPORT int utf8proc_codepoint_length(int cp);
+UTF8PROC_DLLEXPORT size_t utf8proc_next_grapheme(const char* s, size_t len, size_t cpos);
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_remove_accents(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len);
+template<class T>
+void utf8proc_grapheme_callback(const char* s, size_t len, T&& fun) {
+    int sz;
+    int boundclass = UTF8PROC_BOUNDCLASS_START;
+    int initial = utf8proc_get_property(utf8proc_codepoint(s, sz))->boundclass;
+    grapheme_break_extended(boundclass, initial, &boundclass);
+    size_t start = 0;
+    size_t cpos = 0;
+    while (true) {
+        cpos += sz;
+        if (cpos >= len) {
+            fun(start, cpos);
+            return;
+        }
+        int next = utf8proc_get_property(utf8proc_codepoint(s + cpos, sz))->boundclass;
+        if (grapheme_break_extended(boundclass, next, &boundclass)) {
+            if (!fun(start, cpos)) {
+                return;
+            }
+            start = cpos;
+        }
+    }
+}
+
+/**
+ * Given a codepoint `c`, return the codepoint of the corresponding
+ * lower-case character, if any; otherwise (if there is no lower-case
+ * variant, or if `c` is not a valid codepoint) return `c`.
+ */
+UTF8PROC_DLLEXPORT utf8proc_int32_t utf8proc_tolower(utf8proc_int32_t c);
+
+/**
+ * Given a codepoint `c`, return the codepoint of the corresponding
+ * upper-case character, if any; otherwise (if there is no upper-case
+ * variant, or if `c` is not a valid codepoint) return `c`.
+ */
+UTF8PROC_DLLEXPORT utf8proc_int32_t utf8proc_toupper(utf8proc_int32_t c);
+
+/**
+ * Given a codepoint `c`, return the codepoint of the corresponding
+ * title-case character, if any; otherwise (if there is no title-case
+ * variant, or if `c` is not a valid codepoint) return `c`.
+ */
+UTF8PROC_DLLEXPORT utf8proc_int32_t utf8proc_totitle(utf8proc_int32_t c);
+
+/**
+ * Given a codepoint, return a character width analogous to `wcwidth(codepoint)`,
+ * except that a width of 0 is returned for non-printable codepoints
+ * instead of -1 as in `wcwidth`.
+ *
+ * @note
+ * If you want to check for particular types of non-printable characters,
+ * (analogous to `isprint` or `iscntrl`), use @ref utf8proc_category. */
+UTF8PROC_DLLEXPORT int utf8proc_charwidth(utf8proc_int32_t codepoint);
+
+/**
+ * Return the Unicode category for the codepoint (one of the
+ * @ref utf8proc_category_t constants.)
+ */
+UTF8PROC_DLLEXPORT utf8proc_category_t utf8proc_category(utf8proc_int32_t codepoint);
+
+/**
+ * Return the two-letter (nul-terminated) Unicode category string for
+ * the codepoint (e.g. `"Lu"` or `"Co"`).
+ */
+UTF8PROC_DLLEXPORT const char* utf8proc_category_string(utf8proc_int32_t codepoint);
+
+/**
+ * Maps the given UTF-8 string pointed to by `str` to a new UTF-8
+ * string, allocated dynamically by `malloc` and returned via `dstptr`.
+ *
+ * If the @ref UTF8PROC_NULLTERM flag in the `options` field is set,
+ * the length is determined by a NULL terminator, otherwise the
+ * parameter `strlen` is evaluated to determine the string length, but
+ * in any case the result will be NULL terminated (though it might
+ * contain NULL characters with the string if `str` contained NULL
+ * characters). Other flags in the `options` field are passed to the
+ * functions defined above, and regarded as described.  See also
+ * @ref utf8proc_map_custom to supply a custom codepoint transformation.
+ *
+ * In case of success the length of the new string is returned,
+ * otherwise a negative error code is returned.
+ *
+ * @note The memory of the new UTF-8 string will have been allocated
+ * with `malloc`, and should therefore be deallocated with `free`.
+ */
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_map(const utf8proc_uint8_t* str,
+    utf8proc_ssize_t strlen, utf8proc_uint8_t** dstptr, utf8proc_option_t options);
+
+/**
+ * Like @ref utf8proc_map, but also takes a `custom_func` mapping function
+ * that is called on each codepoint in `str` before any other transformations
+ * (along with a `custom_data` pointer that is passed through to `custom_func`).
+ * The `custom_func` argument is ignored if it is `NULL`.
+ */
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_map_custom(const utf8proc_uint8_t* str,
+    utf8proc_ssize_t strlen, utf8proc_uint8_t** dstptr, utf8proc_option_t options,
+    utf8proc_custom_func custom_func, void* custom_data);
+
+/** @name Unicode normalization
+ *
+ * Returns a pointer to newly allocated memory of a NFD, NFC, NFKD, NFKC or
+ * NFKC_Casefold normalized version of the null-terminated string `str`.  These
+ * are shortcuts to calling @ref utf8proc_map with @ref UTF8PROC_NULLTERM
+ * combined with @ref UTF8PROC_STABLE and flags indicating the normalization.
+ */
+/** @{ */
+/** NFD normalization (@ref UTF8PROC_DECOMPOSE). */
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFD(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len);
+/** NFC normalization (@ref UTF8PROC_COMPOSE). */
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFC(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len);
+/** NFKD normalization (@ref UTF8PROC_DECOMPOSE and @ref UTF8PROC_COMPAT). */
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFKD(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len);
+/** NFKC normalization (@ref UTF8PROC_COMPOSE and @ref UTF8PROC_COMPAT). */
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFKC(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len);
+/**
+ * NFKC_Casefold normalization (@ref UTF8PROC_COMPOSE and @ref UTF8PROC_COMPAT
+ * and @ref UTF8PROC_CASEFOLD and @ref UTF8PROC_IGNORE).
+ **/
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFKC_Casefold(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len);
+/** @} */
+
+// #ifdef __cplusplus
+// }
+// #endif
+
+} // namespace utf8proc
+} // namespace lbug
+#endif
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/include/utf8proc_data.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/include/utf8proc_data.h
new file mode 100644
index 0000000000..fc776a5b61
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/include/utf8proc_data.h
@@ -0,0 +1,77968 @@
+#include "utf8proc.h"
+
+using namespace lbug::utf8proc;
+
+static const utf8proc_uint16_t utf8proc_sequences[] = {
+    97,
+    98,
+    99,
+    100,
+    101,
+    102,
+    103,
+    104,
+    105,
+    106,
+    107,
+    108,
+    109,
+    110,
+    111,
+    112,
+    113,
+    114,
+    115,
+    116,
+    117,
+    118,
+    119,
+    120,
+    121,
+    122,
+    32,
+    32,
+    776,
+    32,
+    772,
+    50,
+    51,
+    32,
+    769,
+    956,
+    32,
+    807,
+    49,
+    49,
+    8260,
+    52,
+    49,
+    8260,
+    50,
+    51,
+    8260,
+    52,
+    65,
+    768,
+    224,
+    65,
+    769,
+    225,
+    65,
+    770,
+    226,
+    65,
+    771,
+    227,
+    65,
+    776,
+    228,
+    65,
+    778,
+    229,
+    230,
+    67,
+    807,
+    231,
+    69,
+    768,
+    232,
+    69,
+    769,
+    233,
+    69,
+    770,
+    234,
+    69,
+    776,
+    235,
+    73,
+    768,
+    236,
+    73,
+    769,
+    237,
+    73,
+    770,
+    238,
+    73,
+    776,
+    239,
+    240,
+    78,
+    771,
+    241,
+    79,
+    768,
+    242,
+    79,
+    769,
+    243,
+    79,
+    770,
+    244,
+    79,
+    771,
+    245,
+    79,
+    776,
+    246,
+    248,
+    85,
+    768,
+    249,
+    85,
+    769,
+    250,
+    85,
+    770,
+    251,
+    85,
+    776,
+    252,
+    89,
+    769,
+    253,
+    254,
+    115,
+    115,
+    97,
+    768,
+    97,
+    769,
+    97,
+    770,
+    97,
+    771,
+    97,
+    776,
+    97,
+    778,
+    99,
+    807,
+    101,
+    768,
+    101,
+    769,
+    101,
+    770,
+    101,
+    776,
+    105,
+    768,
+    105,
+    769,
+    105,
+    770,
+    105,
+    776,
+    110,
+    771,
+    111,
+    768,
+    111,
+    769,
+    111,
+    770,
+    111,
+    771,
+    111,
+    776,
+    117,
+    768,
+    117,
+    769,
+    117,
+    770,
+    117,
+    776,
+    121,
+    769,
+    121,
+    776,
+    65,
+    772,
+    257,
+    97,
+    772,
+    65,
+    774,
+    259,
+    97,
+    774,
+    65,
+    808,
+    261,
+    97,
+    808,
+    67,
+    769,
+    263,
+    99,
+    769,
+    67,
+    770,
+    265,
+    99,
+    770,
+    67,
+    775,
+    267,
+    99,
+    775,
+    67,
+    780,
+    269,
+    99,
+    780,
+    68,
+    780,
+    271,
+    100,
+    780,
+    273,
+    69,
+    772,
+    275,
+    101,
+    772,
+    69,
+    774,
+    277,
+    101,
+    774,
+    69,
+    775,
+    279,
+    101,
+    775,
+    69,
+    808,
+    281,
+    101,
+    808,
+    69,
+    780,
+    283,
+    101,
+    780,
+    71,
+    770,
+    285,
+    103,
+    770,
+    71,
+    774,
+    287,
+    103,
+    774,
+    71,
+    775,
+    289,
+    103,
+    775,
+    71,
+    807,
+    291,
+    103,
+    807,
+    72,
+    770,
+    293,
+    104,
+    770,
+    295,
+    73,
+    771,
+    297,
+    105,
+    771,
+    73,
+    772,
+    299,
+    105,
+    772,
+    73,
+    774,
+    301,
+    105,
+    774,
+    73,
+    808,
+    303,
+    105,
+    808,
+    73,
+    775,
+    105,
+    775,
+    73,
+    74,
+    307,
+    105,
+    106,
+    74,
+    770,
+    309,
+    106,
+    770,
+    75,
+    807,
+    311,
+    107,
+    807,
+    76,
+    769,
+    314,
+    108,
+    769,
+    76,
+    807,
+    316,
+    108,
+    807,
+    76,
+    780,
+    318,
+    108,
+    780,
+    76,
+    183,
+    320,
+    108,
+    183,
+    322,
+    78,
+    769,
+    324,
+    110,
+    769,
+    78,
+    807,
+    326,
+    110,
+    807,
+    78,
+    780,
+    328,
+    110,
+    780,
+    700,
+    110,
+    331,
+    79,
+    772,
+    333,
+    111,
+    772,
+    79,
+    774,
+    335,
+    111,
+    774,
+    79,
+    779,
+    337,
+    111,
+    779,
+    339,
+    82,
+    769,
+    341,
+    114,
+    769,
+    82,
+    807,
+    343,
+    114,
+    807,
+    82,
+    780,
+    345,
+    114,
+    780,
+    83,
+    769,
+    347,
+    115,
+    769,
+    83,
+    770,
+    349,
+    115,
+    770,
+    83,
+    807,
+    351,
+    115,
+    807,
+    83,
+    780,
+    353,
+    115,
+    780,
+    84,
+    807,
+    355,
+    116,
+    807,
+    84,
+    780,
+    357,
+    116,
+    780,
+    359,
+    85,
+    771,
+    361,
+    117,
+    771,
+    85,
+    772,
+    363,
+    117,
+    772,
+    85,
+    774,
+    365,
+    117,
+    774,
+    85,
+    778,
+    367,
+    117,
+    778,
+    85,
+    779,
+    369,
+    117,
+    779,
+    85,
+    808,
+    371,
+    117,
+    808,
+    87,
+    770,
+    373,
+    119,
+    770,
+    89,
+    770,
+    375,
+    121,
+    770,
+    89,
+    776,
+    255,
+    90,
+    769,
+    378,
+    122,
+    769,
+    90,
+    775,
+    380,
+    122,
+    775,
+    90,
+    780,
+    382,
+    122,
+    780,
+    595,
+    387,
+    389,
+    596,
+    392,
+    598,
+    599,
+    396,
+    477,
+    601,
+    603,
+    402,
+    608,
+    611,
+    617,
+    616,
+    409,
+    623,
+    626,
+    629,
+    79,
+    795,
+    417,
+    111,
+    795,
+    419,
+    421,
+    640,
+    424,
+    643,
+    429,
+    648,
+    85,
+    795,
+    432,
+    117,
+    795,
+    650,
+    651,
+    436,
+    438,
+    658,
+    441,
+    445,
+    68,
+    381,
+    454,
+    68,
+    382,
+    100,
+    382,
+    76,
+    74,
+    457,
+    76,
+    106,
+    108,
+    106,
+    78,
+    74,
+    460,
+    78,
+    106,
+    110,
+    106,
+    65,
+    780,
+    462,
+    97,
+    780,
+    73,
+    780,
+    464,
+    105,
+    780,
+    79,
+    780,
+    466,
+    111,
+    780,
+    85,
+    780,
+    468,
+    117,
+    780,
+    220,
+    772,
+    470,
+    252,
+    772,
+    220,
+    769,
+    472,
+    252,
+    769,
+    220,
+    780,
+    474,
+    252,
+    780,
+    220,
+    768,
+    476,
+    252,
+    768,
+    196,
+    772,
+    479,
+    228,
+    772,
+    550,
+    772,
+    481,
+    551,
+    772,
+    198,
+    772,
+    483,
+    230,
+    772,
+    485,
+    71,
+    780,
+    487,
+    103,
+    780,
+    75,
+    780,
+    489,
+    107,
+    780,
+    79,
+    808,
+    491,
+    111,
+    808,
+    490,
+    772,
+    493,
+    491,
+    772,
+    439,
+    780,
+    495,
+    658,
+    780,
+    106,
+    780,
+    68,
+    90,
+    499,
+    68,
+    122,
+    100,
+    122,
+    71,
+    769,
+    501,
+    103,
+    769,
+    405,
+    447,
+    78,
+    768,
+    505,
+    110,
+    768,
+    197,
+    769,
+    507,
+    229,
+    769,
+    198,
+    769,
+    509,
+    230,
+    769,
+    216,
+    769,
+    511,
+    248,
+    769,
+    65,
+    783,
+    513,
+    97,
+    783,
+    65,
+    785,
+    515,
+    97,
+    785,
+    69,
+    783,
+    517,
+    101,
+    783,
+    69,
+    785,
+    519,
+    101,
+    785,
+    73,
+    783,
+    521,
+    105,
+    783,
+    73,
+    785,
+    523,
+    105,
+    785,
+    79,
+    783,
+    525,
+    111,
+    783,
+    79,
+    785,
+    527,
+    111,
+    785,
+    82,
+    783,
+    529,
+    114,
+    783,
+    82,
+    785,
+    531,
+    114,
+    785,
+    85,
+    783,
+    533,
+    117,
+    783,
+    85,
+    785,
+    535,
+    117,
+    785,
+    83,
+    806,
+    537,
+    115,
+    806,
+    84,
+    806,
+    539,
+    116,
+    806,
+    541,
+    72,
+    780,
+    543,
+    104,
+    780,
+    414,
+    547,
+    549,
+    65,
+    775,
+    551,
+    97,
+    775,
+    69,
+    807,
+    553,
+    101,
+    807,
+    214,
+    772,
+    555,
+    246,
+    772,
+    213,
+    772,
+    557,
+    245,
+    772,
+    79,
+    775,
+    559,
+    111,
+    775,
+    558,
+    772,
+    561,
+    559,
+    772,
+    89,
+    772,
+    563,
+    121,
+    772,
+    11365,
+    572,
+    410,
+    11366,
+    578,
+    384,
+    649,
+    652,
+    583,
+    585,
+    587,
+    589,
+    591,
+    614,
+    633,
+    635,
+    641,
+    32,
+    774,
+    32,
+    775,
+    32,
+    778,
+    32,
+    808,
+    32,
+    771,
+    32,
+    779,
+    661,
+    768,
+    769,
+    787,
+    776,
+    769,
+    953,
+    881,
+    883,
+    697,
+    887,
+    32,
+    837,
+    59,
+    1011,
+    168,
+    769,
+    913,
+    769,
+    940,
+    183,
+    917,
+    769,
+    941,
+    919,
+    769,
+    942,
+    921,
+    769,
+    943,
+    927,
+    769,
+    972,
+    933,
+    769,
+    973,
+    937,
+    769,
+    974,
+    970,
+    769,
+    953,
+    776,
+    769,
+    945,
+    946,
+    947,
+    948,
+    949,
+    950,
+    951,
+    952,
+    954,
+    955,
+    957,
+    958,
+    959,
+    960,
+    961,
+    963,
+    964,
+    965,
+    966,
+    967,
+    968,
+    969,
+    921,
+    776,
+    970,
+    933,
+    776,
+    971,
+    945,
+    769,
+    949,
+    769,
+    951,
+    769,
+    953,
+    769,
+    971,
+    769,
+    965,
+    776,
+    769,
+    953,
+    776,
+    965,
+    776,
+    959,
+    769,
+    965,
+    769,
+    969,
+    769,
+    983,
+    933,
+    978,
+    769,
+    978,
+    776,
+    985,
+    987,
+    989,
+    991,
+    993,
+    995,
+    997,
+    999,
+    1001,
+    1003,
+    1005,
+    1007,
+    962,
+    920,
+    1016,
+    931,
+    1010,
+    1019,
+    891,
+    892,
+    893,
+    1045,
+    768,
+    1104,
+    1045,
+    776,
+    1105,
+    1106,
+    1043,
+    769,
+    1107,
+    1108,
+    1109,
+    1110,
+    1030,
+    776,
+    1111,
+    1112,
+    1113,
+    1114,
+    1115,
+    1050,
+    769,
+    1116,
+    1048,
+    768,
+    1117,
+    1059,
+    774,
+    1118,
+    1119,
+    1072,
+    1073,
+    1074,
+    1075,
+    1076,
+    1077,
+    1078,
+    1079,
+    1080,
+    1048,
+    774,
+    1081,
+    1082,
+    1083,
+    1084,
+    1085,
+    1086,
+    1087,
+    1088,
+    1089,
+    1090,
+    1091,
+    1092,
+    1093,
+    1094,
+    1095,
+    1096,
+    1097,
+    1098,
+    1099,
+    1100,
+    1101,
+    1102,
+    1103,
+    1080,
+    774,
+    1077,
+    768,
+    1077,
+    776,
+    1075,
+    769,
+    1110,
+    776,
+    1082,
+    769,
+    1080,
+    768,
+    1091,
+    774,
+    1121,
+    1123,
+    1125,
+    1127,
+    1129,
+    1131,
+    1133,
+    1135,
+    1137,
+    1139,
+    1141,
+    1140,
+    783,
+    1143,
+    1141,
+    783,
+    1145,
+    1147,
+    1149,
+    1151,
+    1153,
+    1163,
+    1165,
+    1167,
+    1169,
+    1171,
+    1173,
+    1175,
+    1177,
+    1179,
+    1181,
+    1183,
+    1185,
+    1187,
+    1189,
+    1191,
+    1193,
+    1195,
+    1197,
+    1199,
+    1201,
+    1203,
+    1205,
+    1207,
+    1209,
+    1211,
+    1213,
+    1215,
+    1231,
+    1046,
+    774,
+    1218,
+    1078,
+    774,
+    1220,
+    1222,
+    1224,
+    1226,
+    1228,
+    1230,
+    1040,
+    774,
+    1233,
+    1072,
+    774,
+    1040,
+    776,
+    1235,
+    1072,
+    776,
+    1237,
+    1045,
+    774,
+    1239,
+    1077,
+    774,
+    1241,
+    1240,
+    776,
+    1243,
+    1241,
+    776,
+    1046,
+    776,
+    1245,
+    1078,
+    776,
+    1047,
+    776,
+    1247,
+    1079,
+    776,
+    1249,
+    1048,
+    772,
+    1251,
+    1080,
+    772,
+    1048,
+    776,
+    1253,
+    1080,
+    776,
+    1054,
+    776,
+    1255,
+    1086,
+    776,
+    1257,
+    1256,
+    776,
+    1259,
+    1257,
+    776,
+    1069,
+    776,
+    1261,
+    1101,
+    776,
+    1059,
+    772,
+    1263,
+    1091,
+    772,
+    1059,
+    776,
+    1265,
+    1091,
+    776,
+    1059,
+    779,
+    1267,
+    1091,
+    779,
+    1063,
+    776,
+    1269,
+    1095,
+    776,
+    1271,
+    1067,
+    776,
+    1273,
+    1099,
+    776,
+    1275,
+    1277,
+    1279,
+    1281,
+    1283,
+    1285,
+    1287,
+    1289,
+    1291,
+    1293,
+    1295,
+    1297,
+    1299,
+    1301,
+    1303,
+    1305,
+    1307,
+    1309,
+    1311,
+    1313,
+    1315,
+    1317,
+    1319,
+    1321,
+    1323,
+    1325,
+    1327,
+    1377,
+    1378,
+    1379,
+    1380,
+    1381,
+    1382,
+    1383,
+    1384,
+    1385,
+    1386,
+    1387,
+    1388,
+    1389,
+    1390,
+    1391,
+    1392,
+    1393,
+    1394,
+    1395,
+    1396,
+    1397,
+    1398,
+    1399,
+    1400,
+    1401,
+    1402,
+    1403,
+    1404,
+    1405,
+    1406,
+    1407,
+    1408,
+    1409,
+    1410,
+    1411,
+    1412,
+    1413,
+    1414,
+    1381,
+    1410,
+    1575,
+    1619,
+    1575,
+    1620,
+    1608,
+    1620,
+    1575,
+    1621,
+    1610,
+    1620,
+    1575,
+    1652,
+    1608,
+    1652,
+    1735,
+    1652,
+    1610,
+    1652,
+    1749,
+    1620,
+    1729,
+    1620,
+    1746,
+    1620,
+    2344,
+    2364,
+    2352,
+    2364,
+    2355,
+    2364,
+    2325,
+    2364,
+    2326,
+    2364,
+    2327,
+    2364,
+    2332,
+    2364,
+    2337,
+    2364,
+    2338,
+    2364,
+    2347,
+    2364,
+    2351,
+    2364,
+    2503,
+    2494,
+    2503,
+    2519,
+    2465,
+    2492,
+    2466,
+    2492,
+    2479,
+    2492,
+    2610,
+    2620,
+    2616,
+    2620,
+    2582,
+    2620,
+    2583,
+    2620,
+    2588,
+    2620,
+    2603,
+    2620,
+    2887,
+    2902,
+    2887,
+    2878,
+    2887,
+    2903,
+    2849,
+    2876,
+    2850,
+    2876,
+    2962,
+    3031,
+    3014,
+    3006,
+    3015,
+    3006,
+    3014,
+    3031,
+    3142,
+    3158,
+    3263,
+    3285,
+    3270,
+    3285,
+    3270,
+    3286,
+    3270,
+    3266,
+    3274,
+    3285,
+    3398,
+    3390,
+    3399,
+    3390,
+    3398,
+    3415,
+    3545,
+    3530,
+    3545,
+    3535,
+    3548,
+    3530,
+    3545,
+    3551,
+    3661,
+    3634,
+    3789,
+    3762,
+    3755,
+    3737,
+    3755,
+    3745,
+    3851,
+    3906,
+    4023,
+    3916,
+    4023,
+    3921,
+    4023,
+    3926,
+    4023,
+    3931,
+    4023,
+    3904,
+    4021,
+    3953,
+    3954,
+    3953,
+    3956,
+    4018,
+    3968,
+    4018,
+    3969,
+    4019,
+    3968,
+    4019,
+    3969,
+    3953,
+    3968,
+    3986,
+    4023,
+    3996,
+    4023,
+    4001,
+    4023,
+    4006,
+    4023,
+    4011,
+    4023,
+    3984,
+    4021,
+    4133,
+    4142,
+    11520,
+    11521,
+    11522,
+    11523,
+    11524,
+    11525,
+    11526,
+    11527,
+    11528,
+    11529,
+    11530,
+    11531,
+    11532,
+    11533,
+    11534,
+    11535,
+    11536,
+    11537,
+    11538,
+    11539,
+    11540,
+    11541,
+    11542,
+    11543,
+    11544,
+    11545,
+    11546,
+    11547,
+    11548,
+    11549,
+    11550,
+    11551,
+    11552,
+    11553,
+    11554,
+    11555,
+    11556,
+    11557,
+    11559,
+    11565,
+    4316,
+    5104,
+    5105,
+    5106,
+    5107,
+    5108,
+    5109,
+    6917,
+    6965,
+    6919,
+    6965,
+    6921,
+    6965,
+    6923,
+    6965,
+    6925,
+    6965,
+    6929,
+    6965,
+    6970,
+    6965,
+    6972,
+    6965,
+    6974,
+    6965,
+    6975,
+    6965,
+    6978,
+    6965,
+    42571,
+    4304,
+    4305,
+    4306,
+    4307,
+    4308,
+    4309,
+    4310,
+    4311,
+    4312,
+    4313,
+    4314,
+    4315,
+    4317,
+    4318,
+    4319,
+    4320,
+    4321,
+    4322,
+    4323,
+    4324,
+    4325,
+    4326,
+    4327,
+    4328,
+    4329,
+    4330,
+    4331,
+    4332,
+    4333,
+    4334,
+    4335,
+    4336,
+    4337,
+    4338,
+    4339,
+    4340,
+    4341,
+    4342,
+    4343,
+    4344,
+    4345,
+    4346,
+    4349,
+    4350,
+    4351,
+    65,
+    198,
+    66,
+    68,
+    69,
+    398,
+    71,
+    72,
+    73,
+    74,
+    75,
+    76,
+    77,
+    78,
+    79,
+    546,
+    80,
+    82,
+    84,
+    85,
+    87,
+    592,
+    593,
+    7426,
+    604,
+    7446,
+    7447,
+    7453,
+    7461,
+    594,
+    597,
+    607,
+    609,
+    613,
+    618,
+    7547,
+    669,
+    621,
+    7557,
+    671,
+    625,
+    624,
+    627,
+    628,
+    632,
+    642,
+    427,
+    7452,
+    656,
+    657,
+    65,
+    805,
+    7681,
+    97,
+    805,
+    66,
+    775,
+    7683,
+    98,
+    775,
+    66,
+    803,
+    7685,
+    98,
+    803,
+    66,
+    817,
+    7687,
+    98,
+    817,
+    199,
+    769,
+    7689,
+    231,
+    769,
+    68,
+    775,
+    7691,
+    100,
+    775,
+    68,
+    803,
+    7693,
+    100,
+    803,
+    68,
+    817,
+    7695,
+    100,
+    817,
+    68,
+    807,
+    7697,
+    100,
+    807,
+    68,
+    813,
+    7699,
+    100,
+    813,
+    274,
+    768,
+    7701,
+    275,
+    768,
+    274,
+    769,
+    7703,
+    275,
+    769,
+    69,
+    813,
+    7705,
+    101,
+    813,
+    69,
+    816,
+    7707,
+    101,
+    816,
+    552,
+    774,
+    7709,
+    553,
+    774,
+    70,
+    775,
+    7711,
+    102,
+    775,
+    71,
+    772,
+    7713,
+    103,
+    772,
+    72,
+    775,
+    7715,
+    104,
+    775,
+    72,
+    803,
+    7717,
+    104,
+    803,
+    72,
+    776,
+    7719,
+    104,
+    776,
+    72,
+    807,
+    7721,
+    104,
+    807,
+    72,
+    814,
+    7723,
+    104,
+    814,
+    73,
+    816,
+    7725,
+    105,
+    816,
+    207,
+    769,
+    7727,
+    239,
+    769,
+    75,
+    769,
+    7729,
+    107,
+    769,
+    75,
+    803,
+    7731,
+    107,
+    803,
+    75,
+    817,
+    7733,
+    107,
+    817,
+    76,
+    803,
+    7735,
+    108,
+    803,
+    7734,
+    772,
+    7737,
+    7735,
+    772,
+    76,
+    817,
+    7739,
+    108,
+    817,
+    76,
+    813,
+    7741,
+    108,
+    813,
+    77,
+    769,
+    7743,
+    109,
+    769,
+    77,
+    775,
+    7745,
+    109,
+    775,
+    77,
+    803,
+    7747,
+    109,
+    803,
+    78,
+    775,
+    7749,
+    110,
+    775,
+    78,
+    803,
+    7751,
+    110,
+    803,
+    78,
+    817,
+    7753,
+    110,
+    817,
+    78,
+    813,
+    7755,
+    110,
+    813,
+    213,
+    769,
+    7757,
+    245,
+    769,
+    213,
+    776,
+    7759,
+    245,
+    776,
+    332,
+    768,
+    7761,
+    333,
+    768,
+    332,
+    769,
+    7763,
+    333,
+    769,
+    80,
+    769,
+    7765,
+    112,
+    769,
+    80,
+    775,
+    7767,
+    112,
+    775,
+    82,
+    775,
+    7769,
+    114,
+    775,
+    82,
+    803,
+    7771,
+    114,
+    803,
+    7770,
+    772,
+    7773,
+    7771,
+    772,
+    82,
+    817,
+    7775,
+    114,
+    817,
+    83,
+    775,
+    7777,
+    115,
+    775,
+    83,
+    803,
+    7779,
+    115,
+    803,
+    346,
+    775,
+    7781,
+    347,
+    775,
+    352,
+    775,
+    7783,
+    353,
+    775,
+    7778,
+    775,
+    7785,
+    7779,
+    775,
+    84,
+    775,
+    7787,
+    116,
+    775,
+    84,
+    803,
+    7789,
+    116,
+    803,
+    84,
+    817,
+    7791,
+    116,
+    817,
+    84,
+    813,
+    7793,
+    116,
+    813,
+    85,
+    804,
+    7795,
+    117,
+    804,
+    85,
+    816,
+    7797,
+    117,
+    816,
+    85,
+    813,
+    7799,
+    117,
+    813,
+    360,
+    769,
+    7801,
+    361,
+    769,
+    362,
+    776,
+    7803,
+    363,
+    776,
+    86,
+    771,
+    7805,
+    118,
+    771,
+    86,
+    803,
+    7807,
+    118,
+    803,
+    87,
+    768,
+    7809,
+    119,
+    768,
+    87,
+    769,
+    7811,
+    119,
+    769,
+    87,
+    776,
+    7813,
+    119,
+    776,
+    87,
+    775,
+    7815,
+    119,
+    775,
+    87,
+    803,
+    7817,
+    119,
+    803,
+    88,
+    775,
+    7819,
+    120,
+    775,
+    88,
+    776,
+    7821,
+    120,
+    776,
+    89,
+    775,
+    7823,
+    121,
+    775,
+    90,
+    770,
+    7825,
+    122,
+    770,
+    90,
+    803,
+    7827,
+    122,
+    803,
+    90,
+    817,
+    7829,
+    122,
+    817,
+    104,
+    817,
+    116,
+    776,
+    119,
+    778,
+    121,
+    778,
+    97,
+    702,
+    383,
+    775,
+    65,
+    803,
+    7841,
+    97,
+    803,
+    65,
+    777,
+    7843,
+    97,
+    777,
+    194,
+    769,
+    7845,
+    226,
+    769,
+    194,
+    768,
+    7847,
+    226,
+    768,
+    194,
+    777,
+    7849,
+    226,
+    777,
+    194,
+    771,
+    7851,
+    226,
+    771,
+    7840,
+    770,
+    7853,
+    7841,
+    770,
+    258,
+    769,
+    7855,
+    259,
+    769,
+    258,
+    768,
+    7857,
+    259,
+    768,
+    258,
+    777,
+    7859,
+    259,
+    777,
+    258,
+    771,
+    7861,
+    259,
+    771,
+    7840,
+    774,
+    7863,
+    7841,
+    774,
+    69,
+    803,
+    7865,
+    101,
+    803,
+    69,
+    777,
+    7867,
+    101,
+    777,
+    69,
+    771,
+    7869,
+    101,
+    771,
+    202,
+    769,
+    7871,
+    234,
+    769,
+    202,
+    768,
+    7873,
+    234,
+    768,
+    202,
+    777,
+    7875,
+    234,
+    777,
+    202,
+    771,
+    7877,
+    234,
+    771,
+    7864,
+    770,
+    7879,
+    7865,
+    770,
+    73,
+    777,
+    7881,
+    105,
+    777,
+    73,
+    803,
+    7883,
+    105,
+    803,
+    79,
+    803,
+    7885,
+    111,
+    803,
+    79,
+    777,
+    7887,
+    111,
+    777,
+    212,
+    769,
+    7889,
+    244,
+    769,
+    212,
+    768,
+    7891,
+    244,
+    768,
+    212,
+    777,
+    7893,
+    244,
+    777,
+    212,
+    771,
+    7895,
+    244,
+    771,
+    7884,
+    770,
+    7897,
+    7885,
+    770,
+    416,
+    769,
+    7899,
+    417,
+    769,
+    416,
+    768,
+    7901,
+    417,
+    768,
+    416,
+    777,
+    7903,
+    417,
+    777,
+    416,
+    771,
+    7905,
+    417,
+    771,
+    416,
+    803,
+    7907,
+    417,
+    803,
+    85,
+    803,
+    7909,
+    117,
+    803,
+    85,
+    777,
+    7911,
+    117,
+    777,
+    431,
+    769,
+    7913,
+    432,
+    769,
+    431,
+    768,
+    7915,
+    432,
+    768,
+    431,
+    777,
+    7917,
+    432,
+    777,
+    431,
+    771,
+    7919,
+    432,
+    771,
+    431,
+    803,
+    7921,
+    432,
+    803,
+    89,
+    768,
+    7923,
+    121,
+    768,
+    89,
+    803,
+    7925,
+    121,
+    803,
+    89,
+    777,
+    7927,
+    121,
+    777,
+    89,
+    771,
+    7929,
+    121,
+    771,
+    7931,
+    7933,
+    7935,
+    945,
+    787,
+    945,
+    788,
+    7936,
+    768,
+    7937,
+    768,
+    7936,
+    769,
+    7937,
+    769,
+    7936,
+    834,
+    7937,
+    834,
+    913,
+    787,
+    7936,
+    913,
+    788,
+    7937,
+    7944,
+    768,
+    7938,
+    7945,
+    768,
+    7939,
+    7944,
+    769,
+    7940,
+    7945,
+    769,
+    7941,
+    7944,
+    834,
+    7942,
+    7945,
+    834,
+    7943,
+    949,
+    787,
+    949,
+    788,
+    7952,
+    768,
+    7953,
+    768,
+    7952,
+    769,
+    7953,
+    769,
+    917,
+    787,
+    7952,
+    917,
+    788,
+    7953,
+    7960,
+    768,
+    7954,
+    7961,
+    768,
+    7955,
+    7960,
+    769,
+    7956,
+    7961,
+    769,
+    7957,
+    951,
+    787,
+    951,
+    788,
+    7968,
+    768,
+    7969,
+    768,
+    7968,
+    769,
+    7969,
+    769,
+    7968,
+    834,
+    7969,
+    834,
+    919,
+    787,
+    7968,
+    919,
+    788,
+    7969,
+    7976,
+    768,
+    7970,
+    7977,
+    768,
+    7971,
+    7976,
+    769,
+    7972,
+    7977,
+    769,
+    7973,
+    7976,
+    834,
+    7974,
+    7977,
+    834,
+    7975,
+    953,
+    787,
+    953,
+    788,
+    7984,
+    768,
+    7985,
+    768,
+    7984,
+    769,
+    7985,
+    769,
+    7984,
+    834,
+    7985,
+    834,
+    921,
+    787,
+    7984,
+    921,
+    788,
+    7985,
+    7992,
+    768,
+    7986,
+    7993,
+    768,
+    7987,
+    7992,
+    769,
+    7988,
+    7993,
+    769,
+    7989,
+    7992,
+    834,
+    7990,
+    7993,
+    834,
+    7991,
+    959,
+    787,
+    959,
+    788,
+    8000,
+    768,
+    8001,
+    768,
+    8000,
+    769,
+    8001,
+    769,
+    927,
+    787,
+    8000,
+    927,
+    788,
+    8001,
+    8008,
+    768,
+    8002,
+    8009,
+    768,
+    8003,
+    8008,
+    769,
+    8004,
+    8009,
+    769,
+    8005,
+    965,
+    787,
+    965,
+    788,
+    8016,
+    768,
+    965,
+    787,
+    768,
+    8017,
+    768,
+    8016,
+    769,
+    965,
+    787,
+    769,
+    8017,
+    769,
+    8016,
+    834,
+    965,
+    787,
+    834,
+    8017,
+    834,
+    933,
+    788,
+    8017,
+    8025,
+    768,
+    8019,
+    8025,
+    769,
+    8021,
+    8025,
+    834,
+    8023,
+    969,
+    787,
+    969,
+    788,
+    8032,
+    768,
+    8033,
+    768,
+    8032,
+    769,
+    8033,
+    769,
+    8032,
+    834,
+    8033,
+    834,
+    937,
+    787,
+    8032,
+    937,
+    788,
+    8033,
+    8040,
+    768,
+    8034,
+    8041,
+    768,
+    8035,
+    8040,
+    769,
+    8036,
+    8041,
+    769,
+    8037,
+    8040,
+    834,
+    8038,
+    8041,
+    834,
+    8039,
+    945,
+    768,
+    949,
+    768,
+    951,
+    768,
+    953,
+    768,
+    959,
+    768,
+    965,
+    768,
+    969,
+    768,
+    7936,
+    837,
+    7936,
+    953,
+    7937,
+    837,
+    7937,
+    953,
+    7938,
+    837,
+    7938,
+    953,
+    7939,
+    837,
+    7939,
+    953,
+    7940,
+    837,
+    7940,
+    953,
+    7941,
+    837,
+    7941,
+    953,
+    7942,
+    837,
+    7942,
+    953,
+    7943,
+    837,
+    7943,
+    953,
+    7944,
+    837,
+    7945,
+    837,
+    7946,
+    837,
+    7947,
+    837,
+    7948,
+    837,
+    7949,
+    837,
+    7950,
+    837,
+    7951,
+    837,
+    7968,
+    837,
+    7968,
+    953,
+    7969,
+    837,
+    7969,
+    953,
+    7970,
+    837,
+    7970,
+    953,
+    7971,
+    837,
+    7971,
+    953,
+    7972,
+    837,
+    7972,
+    953,
+    7973,
+    837,
+    7973,
+    953,
+    7974,
+    837,
+    7974,
+    953,
+    7975,
+    837,
+    7975,
+    953,
+    7976,
+    837,
+    7977,
+    837,
+    7978,
+    837,
+    7979,
+    837,
+    7980,
+    837,
+    7981,
+    837,
+    7982,
+    837,
+    7983,
+    837,
+    8032,
+    837,
+    8032,
+    953,
+    8033,
+    837,
+    8033,
+    953,
+    8034,
+    837,
+    8034,
+    953,
+    8035,
+    837,
+    8035,
+    953,
+    8036,
+    837,
+    8036,
+    953,
+    8037,
+    837,
+    8037,
+    953,
+    8038,
+    837,
+    8038,
+    953,
+    8039,
+    837,
+    8039,
+    953,
+    8040,
+    837,
+    8041,
+    837,
+    8042,
+    837,
+    8043,
+    837,
+    8044,
+    837,
+    8045,
+    837,
+    8046,
+    837,
+    8047,
+    837,
+    945,
+    774,
+    945,
+    772,
+    8048,
+    837,
+    8048,
+    953,
+    945,
+    837,
+    945,
+    953,
+    940,
+    837,
+    940,
+    953,
+    945,
+    834,
+    8118,
+    837,
+    945,
+    834,
+    953,
+    913,
+    774,
+    8112,
+    913,
+    772,
+    8113,
+    913,
+    768,
+    8048,
+    902,
+    8049,
+    913,
+    837,
+    32,
+    787,
+    32,
+    834,
+    168,
+    834,
+    8052,
+    837,
+    8052,
+    953,
+    951,
+    837,
+    951,
+    953,
+    942,
+    837,
+    942,
+    953,
+    951,
+    834,
+    8134,
+    837,
+    951,
+    834,
+    953,
+    917,
+    768,
+    8050,
+    904,
+    8051,
+    919,
+    768,
+    8052,
+    905,
+    8053,
+    919,
+    837,
+    8127,
+    768,
+    8127,
+    769,
+    8127,
+    834,
+    953,
+    774,
+    953,
+    772,
+    970,
+    768,
+    953,
+    776,
+    768,
+    912,
+    953,
+    834,
+    970,
+    834,
+    953,
+    776,
+    834,
+    921,
+    774,
+    8144,
+    921,
+    772,
+    8145,
+    921,
+    768,
+    8054,
+    906,
+    8055,
+    8190,
+    768,
+    8190,
+    769,
+    8190,
+    834,
+    965,
+    774,
+    965,
+    772,
+    971,
+    768,
+    965,
+    776,
+    768,
+    944,
+    961,
+    787,
+    961,
+    788,
+    965,
+    834,
+    971,
+    834,
+    965,
+    776,
+    834,
+    933,
+    774,
+    8160,
+    933,
+    772,
+    8161,
+    933,
+    768,
+    8058,
+    910,
+    8059,
+    929,
+    788,
+    8165,
+    168,
+    768,
+    901,
+    96,
+    8060,
+    837,
+    8060,
+    953,
+    969,
+    837,
+    969,
+    953,
+    974,
+    837,
+    974,
+    953,
+    969,
+    834,
+    8182,
+    837,
+    969,
+    834,
+    953,
+    927,
+    768,
+    8056,
+    908,
+    8057,
+    937,
+    768,
+    8060,
+    911,
+    8061,
+    937,
+    837,
+    180,
+    32,
+    788,
+    8194,
+    8195,
+    8208,
+    32,
+    819,
+    46,
+    46,
+    46,
+    46,
+    46,
+    46,
+    8242,
+    8242,
+    8242,
+    8242,
+    8242,
+    8245,
+    8245,
+    8245,
+    8245,
+    8245,
+    33,
+    33,
+    32,
+    773,
+    63,
+    63,
+    63,
+    33,
+    33,
+    63,
+    8242,
+    8242,
+    8242,
+    8242,
+    48,
+    52,
+    53,
+    54,
+    55,
+    56,
+    57,
+    43,
+    8722,
+    61,
+    40,
+    41,
+    82,
+    115,
+    97,
+    47,
+    99,
+    97,
+    47,
+    115,
+    67,
+    176,
+    67,
+    99,
+    47,
+    111,
+    99,
+    47,
+    117,
+    400,
+    176,
+    70,
+    78,
+    111,
+    81,
+    83,
+    77,
+    84,
+    69,
+    76,
+    84,
+    77,
+    90,
+    937,
+    197,
+    70,
+    8526,
+    1488,
+    1489,
+    1490,
+    1491,
+    70,
+    65,
+    88,
+    915,
+    928,
+    8721,
+    49,
+    8260,
+    55,
+    49,
+    8260,
+    57,
+    49,
+    8260,
+    49,
+    48,
+    49,
+    8260,
+    51,
+    50,
+    8260,
+    51,
+    49,
+    8260,
+    53,
+    50,
+    8260,
+    53,
+    51,
+    8260,
+    53,
+    52,
+    8260,
+    53,
+    49,
+    8260,
+    54,
+    53,
+    8260,
+    54,
+    49,
+    8260,
+    56,
+    51,
+    8260,
+    56,
+    53,
+    8260,
+    56,
+    55,
+    8260,
+    56,
+    49,
+    8260,
+    8560,
+    73,
+    73,
+    8561,
+    73,
+    73,
+    73,
+    8562,
+    73,
+    86,
+    8563,
+    86,
+    8564,
+    86,
+    73,
+    8565,
+    86,
+    73,
+    73,
+    8566,
+    86,
+    73,
+    73,
+    73,
+    8567,
+    73,
+    88,
+    8568,
+    88,
+    8569,
+    88,
+    73,
+    8570,
+    88,
+    73,
+    73,
+    8571,
+    8572,
+    8573,
+    8574,
+    8575,
+    105,
+    105,
+    105,
+    105,
+    105,
+    105,
+    118,
+    118,
+    105,
+    118,
+    105,
+    105,
+    118,
+    105,
+    105,
+    105,
+    105,
+    120,
+    120,
+    105,
+    120,
+    105,
+    105,
+    8580,
+    48,
+    8260,
+    51,
+    8592,
+    824,
+    8594,
+    824,
+    8596,
+    824,
+    8656,
+    824,
+    8660,
+    824,
+    8658,
+    824,
+    8707,
+    824,
+    8712,
+    824,
+    8715,
+    824,
+    8739,
+    824,
+    8741,
+    824,
+    8747,
+    8747,
+    8747,
+    8747,
+    8747,
+    8750,
+    8750,
+    8750,
+    8750,
+    8750,
+    8764,
+    824,
+    8771,
+    824,
+    8773,
+    824,
+    8776,
+    824,
+    61,
+    824,
+    8801,
+    824,
+    8781,
+    824,
+    60,
+    824,
+    62,
+    824,
+    8804,
+    824,
+    8805,
+    824,
+    8818,
+    824,
+    8819,
+    824,
+    8822,
+    824,
+    8823,
+    824,
+    8826,
+    824,
+    8827,
+    824,
+    8834,
+    824,
+    8835,
+    824,
+    8838,
+    824,
+    8839,
+    824,
+    8866,
+    824,
+    8872,
+    824,
+    8873,
+    824,
+    8875,
+    824,
+    8828,
+    824,
+    8829,
+    824,
+    8849,
+    824,
+    8850,
+    824,
+    8882,
+    824,
+    8883,
+    824,
+    8884,
+    824,
+    8885,
+    824,
+    12296,
+    12297,
+    49,
+    48,
+    49,
+    49,
+    49,
+    50,
+    49,
+    51,
+    49,
+    52,
+    49,
+    53,
+    49,
+    54,
+    49,
+    55,
+    49,
+    56,
+    49,
+    57,
+    50,
+    48,
+    40,
+    49,
+    41,
+    40,
+    50,
+    41,
+    40,
+    51,
+    41,
+    40,
+    52,
+    41,
+    40,
+    53,
+    41,
+    40,
+    54,
+    41,
+    40,
+    55,
+    41,
+    40,
+    56,
+    41,
+    40,
+    57,
+    41,
+    40,
+    49,
+    48,
+    41,
+    40,
+    49,
+    49,
+    41,
+    40,
+    49,
+    50,
+    41,
+    40,
+    49,
+    51,
+    41,
+    40,
+    49,
+    52,
+    41,
+    40,
+    49,
+    53,
+    41,
+    40,
+    49,
+    54,
+    41,
+    40,
+    49,
+    55,
+    41,
+    40,
+    49,
+    56,
+    41,
+    40,
+    49,
+    57,
+    41,
+    40,
+    50,
+    48,
+    41,
+    49,
+    46,
+    50,
+    46,
+    51,
+    46,
+    52,
+    46,
+    53,
+    46,
+    54,
+    46,
+    55,
+    46,
+    56,
+    46,
+    57,
+    46,
+    49,
+    48,
+    46,
+    49,
+    49,
+    46,
+    49,
+    50,
+    46,
+    49,
+    51,
+    46,
+    49,
+    52,
+    46,
+    49,
+    53,
+    46,
+    49,
+    54,
+    46,
+    49,
+    55,
+    46,
+    49,
+    56,
+    46,
+    49,
+    57,
+    46,
+    50,
+    48,
+    46,
+    40,
+    97,
+    41,
+    40,
+    98,
+    41,
+    40,
+    99,
+    41,
+    40,
+    100,
+    41,
+    40,
+    101,
+    41,
+    40,
+    102,
+    41,
+    40,
+    103,
+    41,
+    40,
+    104,
+    41,
+    40,
+    105,
+    41,
+    40,
+    106,
+    41,
+    40,
+    107,
+    41,
+    40,
+    108,
+    41,
+    40,
+    109,
+    41,
+    40,
+    110,
+    41,
+    40,
+    111,
+    41,
+    40,
+    112,
+    41,
+    40,
+    113,
+    41,
+    40,
+    114,
+    41,
+    40,
+    115,
+    41,
+    40,
+    116,
+    41,
+    40,
+    117,
+    41,
+    40,
+    118,
+    41,
+    40,
+    119,
+    41,
+    40,
+    120,
+    41,
+    40,
+    121,
+    41,
+    40,
+    122,
+    41,
+    9424,
+    9425,
+    9426,
+    9427,
+    9428,
+    9429,
+    9430,
+    9431,
+    9432,
+    9433,
+    9434,
+    9435,
+    9436,
+    9437,
+    9438,
+    9439,
+    9440,
+    9441,
+    83,
+    9442,
+    9443,
+    9444,
+    9445,
+    9446,
+    9447,
+    89,
+    9448,
+    9449,
+    8747,
+    8747,
+    8747,
+    8747,
+    58,
+    58,
+    61,
+    61,
+    61,
+    61,
+    61,
+    61,
+    10973,
+    824,
+    11312,
+    11313,
+    11314,
+    11315,
+    11316,
+    11317,
+    11318,
+    11319,
+    11320,
+    11321,
+    11322,
+    11323,
+    11324,
+    11325,
+    11326,
+    11327,
+    11328,
+    11329,
+    11330,
+    11331,
+    11332,
+    11333,
+    11334,
+    11335,
+    11336,
+    11337,
+    11338,
+    11339,
+    11340,
+    11341,
+    11342,
+    11343,
+    11344,
+    11345,
+    11346,
+    11347,
+    11348,
+    11349,
+    11350,
+    11351,
+    11352,
+    11353,
+    11354,
+    11355,
+    11356,
+    11357,
+    11358,
+    11361,
+    619,
+    7549,
+    637,
+    11368,
+    11370,
+    11372,
+    11379,
+    11382,
+    575,
+    576,
+    11393,
+    11395,
+    11397,
+    11399,
+    11401,
+    11403,
+    11405,
+    11407,
+    11409,
+    11411,
+    11413,
+    11415,
+    11417,
+    11419,
+    11421,
+    11423,
+    11425,
+    11427,
+    11429,
+    11431,
+    11433,
+    11435,
+    11437,
+    11439,
+    11441,
+    11443,
+    11445,
+    11447,
+    11449,
+    11451,
+    11453,
+    11455,
+    11457,
+    11459,
+    11461,
+    11463,
+    11465,
+    11467,
+    11469,
+    11471,
+    11473,
+    11475,
+    11477,
+    11479,
+    11481,
+    11483,
+    11485,
+    11487,
+    11489,
+    11491,
+    11500,
+    11502,
+    11507,
+    11617,
+    27597,
+    40863,
+    19968,
+    20008,
+    20022,
+    20031,
+    20057,
+    20101,
+    20108,
+    20128,
+    20154,
+    20799,
+    20837,
+    20843,
+    20866,
+    20886,
+    20907,
+    20960,
+    20981,
+    20992,
+    21147,
+    21241,
+    21269,
+    21274,
+    21304,
+    21313,
+    21340,
+    21353,
+    21378,
+    21430,
+    21448,
+    21475,
+    22231,
+    22303,
+    22763,
+    22786,
+    22794,
+    22805,
+    22823,
+    22899,
+    23376,
+    23424,
+    23544,
+    23567,
+    23586,
+    23608,
+    23662,
+    23665,
+    24027,
+    24037,
+    24049,
+    24062,
+    24178,
+    24186,
+    24191,
+    24308,
+    24318,
+    24331,
+    24339,
+    24400,
+    24417,
+    24435,
+    24515,
+    25096,
+    25142,
+    25163,
+    25903,
+    25908,
+    25991,
+    26007,
+    26020,
+    26041,
+    26080,
+    26085,
+    26352,
+    26376,
+    26408,
+    27424,
+    27490,
+    27513,
+    27571,
+    27595,
+    27604,
+    27611,
+    27663,
+    27668,
+    27700,
+    28779,
+    29226,
+    29238,
+    29243,
+    29247,
+    29255,
+    29273,
+    29275,
+    29356,
+    29572,
+    29577,
+    29916,
+    29926,
+    29976,
+    29983,
+    29992,
+    30000,
+    30091,
+    30098,
+    30326,
+    30333,
+    30382,
+    30399,
+    30446,
+    30683,
+    30690,
+    30707,
+    31034,
+    31160,
+    31166,
+    31348,
+    31435,
+    31481,
+    31859,
+    31992,
+    32566,
+    32593,
+    32650,
+    32701,
+    32769,
+    32780,
+    32786,
+    32819,
+    32895,
+    32905,
+    33251,
+    33258,
+    33267,
+    33276,
+    33292,
+    33307,
+    33311,
+    33390,
+    33394,
+    33400,
+    34381,
+    34411,
+    34880,
+    34892,
+    34915,
+    35198,
+    35211,
+    35282,
+    35328,
+    35895,
+    35910,
+    35925,
+    35960,
+    35997,
+    36196,
+    36208,
+    36275,
+    36523,
+    36554,
+    36763,
+    36784,
+    36789,
+    37009,
+    37193,
+    37318,
+    37324,
+    37329,
+    38263,
+    38272,
+    38428,
+    38582,
+    38585,
+    38632,
+    38737,
+    38750,
+    38754,
+    38761,
+    38859,
+    38893,
+    38899,
+    38913,
+    39080,
+    39131,
+    39135,
+    39318,
+    39321,
+    39340,
+    39592,
+    39640,
+    39647,
+    39717,
+    39727,
+    39730,
+    39740,
+    39770,
+    40165,
+    40565,
+    40575,
+    40613,
+    40635,
+    40643,
+    40653,
+    40657,
+    40697,
+    40701,
+    40718,
+    40723,
+    40736,
+    40763,
+    40778,
+    40786,
+    40845,
+    40860,
+    40864,
+    12306,
+    21316,
+    21317,
+    12363,
+    12441,
+    12365,
+    12441,
+    12367,
+    12441,
+    12369,
+    12441,
+    12371,
+    12441,
+    12373,
+    12441,
+    12375,
+    12441,
+    12377,
+    12441,
+    12379,
+    12441,
+    12381,
+    12441,
+    12383,
+    12441,
+    12385,
+    12441,
+    12388,
+    12441,
+    12390,
+    12441,
+    12392,
+    12441,
+    12399,
+    12441,
+    12399,
+    12442,
+    12402,
+    12441,
+    12402,
+    12442,
+    12405,
+    12441,
+    12405,
+    12442,
+    12408,
+    12441,
+    12408,
+    12442,
+    12411,
+    12441,
+    12411,
+    12442,
+    12358,
+    12441,
+    32,
+    12441,
+    32,
+    12442,
+    12445,
+    12441,
+    12424,
+    12426,
+    12459,
+    12441,
+    12461,
+    12441,
+    12463,
+    12441,
+    12465,
+    12441,
+    12467,
+    12441,
+    12469,
+    12441,
+    12471,
+    12441,
+    12473,
+    12441,
+    12475,
+    12441,
+    12477,
+    12441,
+    12479,
+    12441,
+    12481,
+    12441,
+    12484,
+    12441,
+    12486,
+    12441,
+    12488,
+    12441,
+    12495,
+    12441,
+    12495,
+    12442,
+    12498,
+    12441,
+    12498,
+    12442,
+    12501,
+    12441,
+    12501,
+    12442,
+    12504,
+    12441,
+    12504,
+    12442,
+    12507,
+    12441,
+    12507,
+    12442,
+    12454,
+    12441,
+    12527,
+    12441,
+    12528,
+    12441,
+    12529,
+    12441,
+    12530,
+    12441,
+    12541,
+    12441,
+    12467,
+    12488,
+    4352,
+    4353,
+    4522,
+    4354,
+    4524,
+    4525,
+    4355,
+    4356,
+    4357,
+    4528,
+    4529,
+    4530,
+    4531,
+    4532,
+    4533,
+    4378,
+    4358,
+    4359,
+    4360,
+    4385,
+    4361,
+    4362,
+    4363,
+    4364,
+    4365,
+    4366,
+    4367,
+    4368,
+    4369,
+    4370,
+    4449,
+    4450,
+    4451,
+    4452,
+    4453,
+    4454,
+    4455,
+    4456,
+    4457,
+    4458,
+    4459,
+    4460,
+    4461,
+    4462,
+    4463,
+    4464,
+    4465,
+    4466,
+    4467,
+    4468,
+    4469,
+    4448,
+    4372,
+    4373,
+    4551,
+    4552,
+    4556,
+    4558,
+    4563,
+    4567,
+    4569,
+    4380,
+    4573,
+    4575,
+    4381,
+    4382,
+    4384,
+    4386,
+    4387,
+    4391,
+    4393,
+    4395,
+    4396,
+    4397,
+    4398,
+    4399,
+    4402,
+    4406,
+    4416,
+    4423,
+    4428,
+    4593,
+    4594,
+    4439,
+    4440,
+    4441,
+    4484,
+    4485,
+    4488,
+    4497,
+    4498,
+    4500,
+    4510,
+    4513,
+    19977,
+    22235,
+    19978,
+    20013,
+    19979,
+    30002,
+    19993,
+    19969,
+    22825,
+    22320,
+    40,
+    4352,
+    41,
+    40,
+    4354,
+    41,
+    40,
+    4355,
+    41,
+    40,
+    4357,
+    41,
+    40,
+    4358,
+    41,
+    40,
+    4359,
+    41,
+    40,
+    4361,
+    41,
+    40,
+    4363,
+    41,
+    40,
+    4364,
+    41,
+    40,
+    4366,
+    41,
+    40,
+    4367,
+    41,
+    40,
+    4368,
+    41,
+    40,
+    4369,
+    41,
+    40,
+    4370,
+    41,
+    40,
+    4352,
+    4449,
+    41,
+    40,
+    4354,
+    4449,
+    41,
+    40,
+    4355,
+    4449,
+    41,
+    40,
+    4357,
+    4449,
+    41,
+    40,
+    4358,
+    4449,
+    41,
+    40,
+    4359,
+    4449,
+    41,
+    40,
+    4361,
+    4449,
+    41,
+    40,
+    4363,
+    4449,
+    41,
+    40,
+    4364,
+    4449,
+    41,
+    40,
+    4366,
+    4449,
+    41,
+    40,
+    4367,
+    4449,
+    41,
+    40,
+    4368,
+    4449,
+    41,
+    40,
+    4369,
+    4449,
+    41,
+    40,
+    4370,
+    4449,
+    41,
+    40,
+    4364,
+    4462,
+    41,
+    40,
+    4363,
+    4457,
+    4364,
+    4453,
+    4523,
+    41,
+    40,
+    4363,
+    4457,
+    4370,
+    4462,
+    41,
+    40,
+    19968,
+    41,
+    40,
+    20108,
+    41,
+    40,
+    19977,
+    41,
+    40,
+    22235,
+    41,
+    40,
+    20116,
+    41,
+    40,
+    20845,
+    41,
+    40,
+    19971,
+    41,
+    40,
+    20843,
+    41,
+    40,
+    20061,
+    41,
+    40,
+    21313,
+    41,
+    40,
+    26376,
+    41,
+    40,
+    28779,
+    41,
+    40,
+    27700,
+    41,
+    40,
+    26408,
+    41,
+    40,
+    37329,
+    41,
+    40,
+    22303,
+    41,
+    40,
+    26085,
+    41,
+    40,
+    26666,
+    41,
+    40,
+    26377,
+    41,
+    40,
+    31038,
+    41,
+    40,
+    21517,
+    41,
+    40,
+    29305,
+    41,
+    40,
+    36001,
+    41,
+    40,
+    31069,
+    41,
+    40,
+    21172,
+    41,
+    40,
+    20195,
+    41,
+    40,
+    21628,
+    41,
+    40,
+    23398,
+    41,
+    40,
+    30435,
+    41,
+    40,
+    20225,
+    41,
+    40,
+    36039,
+    41,
+    40,
+    21332,
+    41,
+    40,
+    31085,
+    41,
+    40,
+    20241,
+    41,
+    40,
+    33258,
+    41,
+    40,
+    33267,
+    41,
+    21839,
+    24188,
+    31631,
+    80,
+    84,
+    69,
+    50,
+    49,
+    50,
+    50,
+    50,
+    51,
+    50,
+    52,
+    50,
+    53,
+    50,
+    54,
+    50,
+    55,
+    50,
+    56,
+    50,
+    57,
+    51,
+    48,
+    51,
+    49,
+    51,
+    50,
+    51,
+    51,
+    51,
+    52,
+    51,
+    53,
+    4352,
+    4449,
+    4354,
+    4449,
+    4355,
+    4449,
+    4357,
+    4449,
+    4358,
+    4449,
+    4359,
+    4449,
+    4361,
+    4449,
+    4363,
+    4449,
+    4364,
+    4449,
+    4366,
+    4449,
+    4367,
+    4449,
+    4368,
+    4449,
+    4369,
+    4449,
+    4370,
+    4449,
+    4366,
+    4449,
+    4535,
+    4352,
+    4457,
+    4364,
+    4462,
+    4363,
+    4468,
+    4363,
+    4462,
+    20116,
+    20845,
+    19971,
+    20061,
+    26666,
+    26377,
+    31038,
+    21517,
+    29305,
+    36001,
+    31069,
+    21172,
+    31192,
+    30007,
+    36969,
+    20778,
+    21360,
+    27880,
+    38917,
+    20241,
+    20889,
+    27491,
+    24038,
+    21491,
+    21307,
+    23447,
+    23398,
+    30435,
+    20225,
+    36039,
+    21332,
+    22812,
+    51,
+    54,
+    51,
+    55,
+    51,
+    56,
+    51,
+    57,
+    52,
+    48,
+    52,
+    49,
+    52,
+    50,
+    52,
+    51,
+    52,
+    52,
+    52,
+    53,
+    52,
+    54,
+    52,
+    55,
+    52,
+    56,
+    52,
+    57,
+    53,
+    48,
+    49,
+    26376,
+    50,
+    26376,
+    51,
+    26376,
+    52,
+    26376,
+    53,
+    26376,
+    54,
+    26376,
+    55,
+    26376,
+    56,
+    26376,
+    57,
+    26376,
+    49,
+    48,
+    26376,
+    49,
+    49,
+    26376,
+    49,
+    50,
+    26376,
+    72,
+    103,
+    101,
+    114,
+    103,
+    101,
+    86,
+    76,
+    84,
+    68,
+    12450,
+    12452,
+    12454,
+    12456,
+    12458,
+    12459,
+    12461,
+    12463,
+    12465,
+    12467,
+    12469,
+    12471,
+    12473,
+    12475,
+    12477,
+    12479,
+    12481,
+    12484,
+    12486,
+    12488,
+    12490,
+    12491,
+    12492,
+    12493,
+    12494,
+    12495,
+    12498,
+    12501,
+    12504,
+    12507,
+    12510,
+    12511,
+    12512,
+    12513,
+    12514,
+    12516,
+    12518,
+    12520,
+    12521,
+    12522,
+    12523,
+    12524,
+    12525,
+    12527,
+    12528,
+    12529,
+    12530,
+    20196,
+    21644,
+    12450,
+    12497,
+    12540,
+    12488,
+    12450,
+    12523,
+    12501,
+    12449,
+    12450,
+    12531,
+    12506,
+    12450,
+    12450,
+    12540,
+    12523,
+    12452,
+    12491,
+    12531,
+    12464,
+    12452,
+    12531,
+    12481,
+    12454,
+    12457,
+    12531,
+    12456,
+    12473,
+    12463,
+    12540,
+    12489,
+    12456,
+    12540,
+    12459,
+    12540,
+    12458,
+    12531,
+    12473,
+    12458,
+    12540,
+    12512,
+    12459,
+    12452,
+    12522,
+    12459,
+    12521,
+    12483,
+    12488,
+    12459,
+    12525,
+    12522,
+    12540,
+    12460,
+    12525,
+    12531,
+    12460,
+    12531,
+    12510,
+    12462,
+    12460,
+    12462,
+    12491,
+    12540,
+    12461,
+    12517,
+    12522,
+    12540,
+    12462,
+    12523,
+    12480,
+    12540,
+    12461,
+    12525,
+    12461,
+    12525,
+    12464,
+    12521,
+    12512,
+    12461,
+    12525,
+    12513,
+    12540,
+    12488,
+    12523,
+    12461,
+    12525,
+    12527,
+    12483,
+    12488,
+    12464,
+    12521,
+    12512,
+    12464,
+    12521,
+    12512,
+    12488,
+    12531,
+    12463,
+    12523,
+    12476,
+    12452,
+    12525,
+    12463,
+    12525,
+    12540,
+    12493,
+    12465,
+    12540,
+    12473,
+    12467,
+    12523,
+    12490,
+    12467,
+    12540,
+    12509,
+    12469,
+    12452,
+    12463,
+    12523,
+    12469,
+    12531,
+    12481,
+    12540,
+    12512,
+    12471,
+    12522,
+    12531,
+    12464,
+    12475,
+    12531,
+    12481,
+    12475,
+    12531,
+    12488,
+    12480,
+    12540,
+    12473,
+    12487,
+    12471,
+    12489,
+    12523,
+    12488,
+    12531,
+    12490,
+    12494,
+    12494,
+    12483,
+    12488,
+    12495,
+    12452,
+    12484,
+    12497,
+    12540,
+    12475,
+    12531,
+    12488,
+    12497,
+    12540,
+    12484,
+    12496,
+    12540,
+    12524,
+    12523,
+    12500,
+    12450,
+    12473,
+    12488,
+    12523,
+    12500,
+    12463,
+    12523,
+    12500,
+    12467,
+    12499,
+    12523,
+    12501,
+    12449,
+    12521,
+    12483,
+    12489,
+    12501,
+    12451,
+    12540,
+    12488,
+    12502,
+    12483,
+    12471,
+    12455,
+    12523,
+    12501,
+    12521,
+    12531,
+    12504,
+    12463,
+    12479,
+    12540,
+    12523,
+    12506,
+    12477,
+    12506,
+    12491,
+    12498,
+    12504,
+    12523,
+    12484,
+    12506,
+    12531,
+    12473,
+    12506,
+    12540,
+    12472,
+    12505,
+    12540,
+    12479,
+    12509,
+    12452,
+    12531,
+    12488,
+    12508,
+    12523,
+    12488,
+    12507,
+    12531,
+    12509,
+    12531,
+    12489,
+    12507,
+    12540,
+    12523,
+    12507,
+    12540,
+    12531,
+    12510,
+    12452,
+    12463,
+    12525,
+    12510,
+    12452,
+    12523,
+    12510,
+    12483,
+    12495,
+    12510,
+    12523,
+    12463,
+    12510,
+    12531,
+    12471,
+    12519,
+    12531,
+    12511,
+    12463,
+    12525,
+    12531,
+    12511,
+    12522,
+    12511,
+    12522,
+    12496,
+    12540,
+    12523,
+    12513,
+    12460,
+    12513,
+    12460,
+    12488,
+    12531,
+    12513,
+    12540,
+    12488,
+    12523,
+    12516,
+    12540,
+    12489,
+    12516,
+    12540,
+    12523,
+    12518,
+    12450,
+    12531,
+    12522,
+    12483,
+    12488,
+    12523,
+    12522,
+    12521,
+    12523,
+    12500,
+    12540,
+    12523,
+    12540,
+    12502,
+    12523,
+    12524,
+    12512,
+    12524,
+    12531,
+    12488,
+    12466,
+    12531,
+    12527,
+    12483,
+    12488,
+    48,
+    28857,
+    49,
+    28857,
+    50,
+    28857,
+    51,
+    28857,
+    52,
+    28857,
+    53,
+    28857,
+    54,
+    28857,
+    55,
+    28857,
+    56,
+    28857,
+    57,
+    28857,
+    49,
+    48,
+    28857,
+    49,
+    49,
+    28857,
+    49,
+    50,
+    28857,
+    49,
+    51,
+    28857,
+    49,
+    52,
+    28857,
+    49,
+    53,
+    28857,
+    49,
+    54,
+    28857,
+    49,
+    55,
+    28857,
+    49,
+    56,
+    28857,
+    49,
+    57,
+    28857,
+    50,
+    48,
+    28857,
+    50,
+    49,
+    28857,
+    50,
+    50,
+    28857,
+    50,
+    51,
+    28857,
+    50,
+    52,
+    28857,
+    104,
+    80,
+    97,
+    100,
+    97,
+    65,
+    85,
+    98,
+    97,
+    114,
+    111,
+    86,
+    112,
+    99,
+    100,
+    109,
+    100,
+    109,
+    178,
+    100,
+    109,
+    179,
+    73,
+    85,
+    24179,
+    25104,
+    26157,
+    21644,
+    22823,
+    27491,
+    26126,
+    27835,
+    26666,
+    24335,
+    20250,
+    31038,
+    112,
+    65,
+    110,
+    65,
+    956,
+    65,
+    109,
+    65,
+    107,
+    65,
+    75,
+    66,
+    77,
+    66,
+    71,
+    66,
+    99,
+    97,
+    108,
+    107,
+    99,
+    97,
+    108,
+    112,
+    70,
+    110,
+    70,
+    956,
+    70,
+    956,
+    103,
+    109,
+    103,
+    107,
+    103,
+    72,
+    122,
+    107,
+    72,
+    122,
+    77,
+    72,
+    122,
+    71,
+    72,
+    122,
+    84,
+    72,
+    122,
+    956,
+    8467,
+    109,
+    8467,
+    100,
+    8467,
+    107,
+    8467,
+    102,
+    109,
+    110,
+    109,
+    956,
+    109,
+    109,
+    109,
+    99,
+    109,
+    107,
+    109,
+    109,
+    109,
+    178,
+    99,
+    109,
+    178,
+    109,
+    178,
+    107,
+    109,
+    178,
+    109,
+    109,
+    179,
+    99,
+    109,
+    179,
+    109,
+    179,
+    107,
+    109,
+    179,
+    109,
+    8725,
+    115,
+    109,
+    8725,
+    115,
+    178,
+    80,
+    97,
+    107,
+    80,
+    97,
+    77,
+    80,
+    97,
+    71,
+    80,
+    97,
+    114,
+    97,
+    100,
+    114,
+    97,
+    100,
+    8725,
+    115,
+    114,
+    97,
+    100,
+    8725,
+    115,
+    178,
+    112,
+    115,
+    110,
+    115,
+    956,
+    115,
+    109,
+    115,
+    112,
+    86,
+    110,
+    86,
+    956,
+    86,
+    109,
+    86,
+    107,
+    86,
+    77,
+    86,
+    112,
+    87,
+    110,
+    87,
+    956,
+    87,
+    109,
+    87,
+    107,
+    87,
+    77,
+    87,
+    107,
+    937,
+    77,
+    937,
+    97,
+    46,
+    109,
+    46,
+    66,
+    113,
+    99,
+    99,
+    99,
+    100,
+    67,
+    8725,
+    107,
+    103,
+    67,
+    111,
+    46,
+    100,
+    66,
+    71,
+    121,
+    104,
+    97,
+    72,
+    80,
+    105,
+    110,
+    75,
+    75,
+    75,
+    77,
+    107,
+    116,
+    108,
+    109,
+    108,
+    110,
+    108,
+    111,
+    103,
+    108,
+    120,
+    109,
+    98,
+    109,
+    105,
+    108,
+    109,
+    111,
+    108,
+    80,
+    72,
+    112,
+    46,
+    109,
+    46,
+    80,
+    80,
+    77,
+    80,
+    82,
+    115,
+    114,
+    83,
+    118,
+    87,
+    98,
+    86,
+    8725,
+    109,
+    65,
+    8725,
+    109,
+    49,
+    26085,
+    50,
+    26085,
+    51,
+    26085,
+    52,
+    26085,
+    53,
+    26085,
+    54,
+    26085,
+    55,
+    26085,
+    56,
+    26085,
+    57,
+    26085,
+    49,
+    48,
+    26085,
+    49,
+    49,
+    26085,
+    49,
+    50,
+    26085,
+    49,
+    51,
+    26085,
+    49,
+    52,
+    26085,
+    49,
+    53,
+    26085,
+    49,
+    54,
+    26085,
+    49,
+    55,
+    26085,
+    49,
+    56,
+    26085,
+    49,
+    57,
+    26085,
+    50,
+    48,
+    26085,
+    50,
+    49,
+    26085,
+    50,
+    50,
+    26085,
+    50,
+    51,
+    26085,
+    50,
+    52,
+    26085,
+    50,
+    53,
+    26085,
+    50,
+    54,
+    26085,
+    50,
+    55,
+    26085,
+    50,
+    56,
+    26085,
+    50,
+    57,
+    26085,
+    51,
+    48,
+    26085,
+    51,
+    49,
+    26085,
+    103,
+    97,
+    108,
+    42561,
+    42563,
+    42565,
+    42567,
+    42569,
+    42573,
+    42575,
+    42577,
+    42579,
+    42581,
+    42583,
+    42585,
+    42587,
+    42589,
+    42591,
+    42593,
+    42595,
+    42597,
+    42599,
+    42601,
+    42603,
+    42605,
+    42625,
+    42627,
+    42629,
+    42631,
+    42633,
+    42635,
+    42637,
+    42639,
+    42641,
+    42643,
+    42645,
+    42647,
+    42649,
+    42651,
+    42787,
+    42789,
+    42791,
+    42793,
+    42795,
+    42797,
+    42799,
+    42803,
+    42805,
+    42807,
+    42809,
+    42811,
+    42813,
+    42815,
+    42817,
+    42819,
+    42821,
+    42823,
+    42825,
+    42827,
+    42829,
+    42831,
+    42833,
+    42835,
+    42837,
+    42839,
+    42841,
+    42843,
+    42845,
+    42847,
+    42849,
+    42851,
+    42853,
+    42855,
+    42857,
+    42859,
+    42861,
+    42863,
+    42874,
+    42876,
+    7545,
+    42879,
+    42881,
+    42883,
+    42885,
+    42887,
+    42892,
+    42897,
+    42899,
+    42903,
+    42905,
+    42907,
+    42909,
+    42911,
+    42913,
+    42915,
+    42917,
+    42919,
+    42921,
+    620,
+    670,
+    647,
+    43859,
+    42933,
+    42935,
+    42937,
+    42939,
+    42941,
+    42943,
+    42947,
+    42900,
+    7566,
+    294,
+    43831,
+    43858,
+    5024,
+    5025,
+    5026,
+    5027,
+    5028,
+    5029,
+    5030,
+    5031,
+    5032,
+    5033,
+    5034,
+    5035,
+    5036,
+    5037,
+    5038,
+    5039,
+    5040,
+    5041,
+    5042,
+    5043,
+    5044,
+    5045,
+    5046,
+    5047,
+    5048,
+    5049,
+    5050,
+    5051,
+    5052,
+    5053,
+    5054,
+    5055,
+    5056,
+    5057,
+    5058,
+    5059,
+    5060,
+    5061,
+    5062,
+    5063,
+    5064,
+    5065,
+    5066,
+    5067,
+    5068,
+    5069,
+    5070,
+    5071,
+    5072,
+    5073,
+    5074,
+    5075,
+    5076,
+    5077,
+    5078,
+    5079,
+    5080,
+    5081,
+    5082,
+    5083,
+    5084,
+    5085,
+    5086,
+    5087,
+    5088,
+    5089,
+    5090,
+    5091,
+    5092,
+    5093,
+    5094,
+    5095,
+    5096,
+    5097,
+    5098,
+    5099,
+    5100,
+    5101,
+    5102,
+    5103,
+    35912,
+    26356,
+    36040,
+    28369,
+    20018,
+    21477,
+    22865,
+    21895,
+    22856,
+    25078,
+    30313,
+    32645,
+    34367,
+    34746,
+    35064,
+    37007,
+    27138,
+    27931,
+    28889,
+    29662,
+    33853,
+    37226,
+    39409,
+    20098,
+    21365,
+    27396,
+    29211,
+    34349,
+    40478,
+    23888,
+    28651,
+    34253,
+    35172,
+    25289,
+    33240,
+    34847,
+    24266,
+    26391,
+    28010,
+    29436,
+    37070,
+    20358,
+    20919,
+    21214,
+    25796,
+    27347,
+    29200,
+    30439,
+    34310,
+    34396,
+    36335,
+    38706,
+    39791,
+    40442,
+    30860,
+    31103,
+    32160,
+    33737,
+    37636,
+    35542,
+    22751,
+    24324,
+    31840,
+    32894,
+    29282,
+    30922,
+    36034,
+    38647,
+    22744,
+    23650,
+    27155,
+    28122,
+    28431,
+    32047,
+    32311,
+    38475,
+    21202,
+    32907,
+    20956,
+    20940,
+    31260,
+    32190,
+    33777,
+    38517,
+    35712,
+    25295,
+    35582,
+    20025,
+    23527,
+    24594,
+    29575,
+    30064,
+    21271,
+    30971,
+    20415,
+    24489,
+    19981,
+    27852,
+    25976,
+    32034,
+    21443,
+    22622,
+    30465,
+    33865,
+    35498,
+    27578,
+    27784,
+    25342,
+    33509,
+    25504,
+    30053,
+    20142,
+    20841,
+    20937,
+    26753,
+    31975,
+    33391,
+    35538,
+    37327,
+    21237,
+    21570,
+    24300,
+    26053,
+    28670,
+    31018,
+    38317,
+    39530,
+    40599,
+    40654,
+    26310,
+    27511,
+    36706,
+    24180,
+    24976,
+    25088,
+    25754,
+    28451,
+    29001,
+    29833,
+    31178,
+    32244,
+    32879,
+    36646,
+    34030,
+    36899,
+    37706,
+    21015,
+    21155,
+    21693,
+    28872,
+    35010,
+    24265,
+    24565,
+    25467,
+    27566,
+    31806,
+    29557,
+    20196,
+    22265,
+    23994,
+    24604,
+    29618,
+    29801,
+    32666,
+    32838,
+    37428,
+    38646,
+    38728,
+    38936,
+    20363,
+    31150,
+    37300,
+    38584,
+    24801,
+    20102,
+    20698,
+    23534,
+    23615,
+    26009,
+    29134,
+    30274,
+    34044,
+    36988,
+    26248,
+    38446,
+    21129,
+    26491,
+    26611,
+    27969,
+    28316,
+    29705,
+    30041,
+    30827,
+    32016,
+    39006,
+    25134,
+    38520,
+    20523,
+    23833,
+    28138,
+    36650,
+    24459,
+    24900,
+    26647,
+    38534,
+    21033,
+    21519,
+    23653,
+    26131,
+    26446,
+    26792,
+    27877,
+    29702,
+    30178,
+    32633,
+    35023,
+    35041,
+    38626,
+    21311,
+    28346,
+    21533,
+    29136,
+    29848,
+    34298,
+    38563,
+    40023,
+    40607,
+    26519,
+    28107,
+    33256,
+    31520,
+    31890,
+    29376,
+    28825,
+    35672,
+    20160,
+    33590,
+    21050,
+    20999,
+    24230,
+    25299,
+    31958,
+    23429,
+    27934,
+    26292,
+    36667,
+    38477,
+    24275,
+    20800,
+    21952,
+    22618,
+    26228,
+    20958,
+    29482,
+    30410,
+    31036,
+    31070,
+    31077,
+    31119,
+    38742,
+    31934,
+    34322,
+    35576,
+    36920,
+    37117,
+    39151,
+    39164,
+    39208,
+    40372,
+    37086,
+    38583,
+    20398,
+    20711,
+    20813,
+    21193,
+    21220,
+    21329,
+    21917,
+    22022,
+    22120,
+    22592,
+    22696,
+    23652,
+    24724,
+    24936,
+    24974,
+    25074,
+    25935,
+    26082,
+    26257,
+    26757,
+    28023,
+    28186,
+    28450,
+    29038,
+    29227,
+    29730,
+    30865,
+    31049,
+    31048,
+    31056,
+    31062,
+    31117,
+    31118,
+    31296,
+    31361,
+    31680,
+    32265,
+    32321,
+    32626,
+    32773,
+    33261,
+    33401,
+    33879,
+    35088,
+    35222,
+    35585,
+    35641,
+    36051,
+    36104,
+    36790,
+    38627,
+    38911,
+    38971,
+    24693,
+    55376,
+    57070,
+    33304,
+    20006,
+    20917,
+    20840,
+    20352,
+    20805,
+    20864,
+    21191,
+    21242,
+    21845,
+    21913,
+    21986,
+    22707,
+    22852,
+    22868,
+    23138,
+    23336,
+    24274,
+    24281,
+    24425,
+    24493,
+    24792,
+    24910,
+    24840,
+    24928,
+    25140,
+    25540,
+    25628,
+    25682,
+    25942,
+    26395,
+    26454,
+    28379,
+    28363,
+    28702,
+    30631,
+    29237,
+    29359,
+    29809,
+    29958,
+    30011,
+    30237,
+    30239,
+    30427,
+    30452,
+    30538,
+    30528,
+    30924,
+    31409,
+    31867,
+    32091,
+    32574,
+    33618,
+    33775,
+    34681,
+    35137,
+    35206,
+    35519,
+    35531,
+    35565,
+    35722,
+    36664,
+    36978,
+    37273,
+    37494,
+    38524,
+    38875,
+    38923,
+    39698,
+    55370,
+    56394,
+    55370,
+    56388,
+    55372,
+    57301,
+    15261,
+    16408,
+    16441,
+    55380,
+    56905,
+    55383,
+    56528,
+    55391,
+    57043,
+    40771,
+    40846,
+    102,
+    102,
+    102,
+    105,
+    102,
+    108,
+    102,
+    102,
+    105,
+    102,
+    102,
+    108,
+    383,
+    116,
+    115,
+    116,
+    1396,
+    1398,
+    1396,
+    1381,
+    1396,
+    1387,
+    1406,
+    1398,
+    1396,
+    1389,
+    1497,
+    1460,
+    1522,
+    1463,
+    1506,
+    1492,
+    1499,
+    1500,
+    1501,
+    1512,
+    1514,
+    1513,
+    1473,
+    1513,
+    1474,
+    64329,
+    1473,
+    64329,
+    1474,
+    1488,
+    1463,
+    1488,
+    1464,
+    1488,
+    1468,
+    1489,
+    1468,
+    1490,
+    1468,
+    1491,
+    1468,
+    1492,
+    1468,
+    1493,
+    1468,
+    1494,
+    1468,
+    1496,
+    1468,
+    1497,
+    1468,
+    1498,
+    1468,
+    1499,
+    1468,
+    1500,
+    1468,
+    1502,
+    1468,
+    1504,
+    1468,
+    1505,
+    1468,
+    1507,
+    1468,
+    1508,
+    1468,
+    1510,
+    1468,
+    1511,
+    1468,
+    1512,
+    1468,
+    1513,
+    1468,
+    1514,
+    1468,
+    1493,
+    1465,
+    1489,
+    1471,
+    1499,
+    1471,
+    1508,
+    1471,
+    1488,
+    1500,
+    1649,
+    1659,
+    1662,
+    1664,
+    1658,
+    1663,
+    1657,
+    1700,
+    1702,
+    1668,
+    1667,
+    1670,
+    1671,
+    1677,
+    1676,
+    1678,
+    1672,
+    1688,
+    1681,
+    1705,
+    1711,
+    1715,
+    1713,
+    1722,
+    1723,
+    1728,
+    1729,
+    1726,
+    1746,
+    1747,
+    1709,
+    1735,
+    1734,
+    1736,
+    1655,
+    1739,
+    1733,
+    1737,
+    1744,
+    1609,
+    1574,
+    1575,
+    1574,
+    1749,
+    1574,
+    1608,
+    1574,
+    1735,
+    1574,
+    1734,
+    1574,
+    1736,
+    1574,
+    1744,
+    1574,
+    1609,
+    1740,
+    1574,
+    1580,
+    1574,
+    1581,
+    1574,
+    1605,
+    1574,
+    1610,
+    1576,
+    1580,
+    1576,
+    1581,
+    1576,
+    1582,
+    1576,
+    1605,
+    1576,
+    1609,
+    1576,
+    1610,
+    1578,
+    1580,
+    1578,
+    1581,
+    1578,
+    1582,
+    1578,
+    1605,
+    1578,
+    1609,
+    1578,
+    1610,
+    1579,
+    1580,
+    1579,
+    1605,
+    1579,
+    1609,
+    1579,
+    1610,
+    1580,
+    1581,
+    1580,
+    1605,
+    1581,
+    1580,
+    1581,
+    1605,
+    1582,
+    1580,
+    1582,
+    1581,
+    1582,
+    1605,
+    1587,
+    1580,
+    1587,
+    1581,
+    1587,
+    1582,
+    1587,
+    1605,
+    1589,
+    1581,
+    1589,
+    1605,
+    1590,
+    1580,
+    1590,
+    1581,
+    1590,
+    1582,
+    1590,
+    1605,
+    1591,
+    1581,
+    1591,
+    1605,
+    1592,
+    1605,
+    1593,
+    1580,
+    1593,
+    1605,
+    1594,
+    1580,
+    1594,
+    1605,
+    1601,
+    1580,
+    1601,
+    1581,
+    1601,
+    1582,
+    1601,
+    1605,
+    1601,
+    1609,
+    1601,
+    1610,
+    1602,
+    1581,
+    1602,
+    1605,
+    1602,
+    1609,
+    1602,
+    1610,
+    1603,
+    1575,
+    1603,
+    1580,
+    1603,
+    1581,
+    1603,
+    1582,
+    1603,
+    1604,
+    1603,
+    1605,
+    1603,
+    1609,
+    1603,
+    1610,
+    1604,
+    1580,
+    1604,
+    1581,
+    1604,
+    1582,
+    1604,
+    1605,
+    1604,
+    1609,
+    1604,
+    1610,
+    1605,
+    1580,
+    1605,
+    1581,
+    1605,
+    1582,
+    1605,
+    1605,
+    1605,
+    1609,
+    1605,
+    1610,
+    1606,
+    1580,
+    1606,
+    1581,
+    1606,
+    1582,
+    1606,
+    1605,
+    1606,
+    1609,
+    1606,
+    1610,
+    1607,
+    1580,
+    1607,
+    1605,
+    1607,
+    1609,
+    1607,
+    1610,
+    1610,
+    1580,
+    1610,
+    1581,
+    1610,
+    1582,
+    1610,
+    1605,
+    1610,
+    1609,
+    1610,
+    1610,
+    1584,
+    1648,
+    1585,
+    1648,
+    1609,
+    1648,
+    32,
+    1612,
+    1617,
+    32,
+    1613,
+    1617,
+    32,
+    1614,
+    1617,
+    32,
+    1615,
+    1617,
+    32,
+    1616,
+    1617,
+    32,
+    1617,
+    1648,
+    1574,
+    1585,
+    1574,
+    1586,
+    1574,
+    1606,
+    1576,
+    1585,
+    1576,
+    1586,
+    1576,
+    1606,
+    1578,
+    1585,
+    1578,
+    1586,
+    1578,
+    1606,
+    1579,
+    1585,
+    1579,
+    1586,
+    1579,
+    1606,
+    1605,
+    1575,
+    1606,
+    1585,
+    1606,
+    1586,
+    1606,
+    1606,
+    1610,
+    1585,
+    1610,
+    1586,
+    1610,
+    1606,
+    1574,
+    1582,
+    1574,
+    1607,
+    1576,
+    1607,
+    1578,
+    1607,
+    1589,
+    1582,
+    1604,
+    1607,
+    1606,
+    1607,
+    1607,
+    1648,
+    1610,
+    1607,
+    1579,
+    1607,
+    1587,
+    1607,
+    1588,
+    1605,
+    1588,
+    1607,
+    1600,
+    1614,
+    1617,
+    1600,
+    1615,
+    1617,
+    1600,
+    1616,
+    1617,
+    1591,
+    1609,
+    1591,
+    1610,
+    1593,
+    1609,
+    1593,
+    1610,
+    1594,
+    1609,
+    1594,
+    1610,
+    1587,
+    1609,
+    1587,
+    1610,
+    1588,
+    1609,
+    1588,
+    1610,
+    1581,
+    1609,
+    1581,
+    1610,
+    1580,
+    1609,
+    1580,
+    1610,
+    1582,
+    1609,
+    1582,
+    1610,
+    1589,
+    1609,
+    1589,
+    1610,
+    1590,
+    1609,
+    1590,
+    1610,
+    1588,
+    1580,
+    1588,
+    1581,
+    1588,
+    1582,
+    1588,
+    1585,
+    1587,
+    1585,
+    1589,
+    1585,
+    1590,
+    1585,
+    1575,
+    1611,
+    1578,
+    1580,
+    1605,
+    1578,
+    1581,
+    1580,
+    1578,
+    1581,
+    1605,
+    1578,
+    1582,
+    1605,
+    1578,
+    1605,
+    1580,
+    1578,
+    1605,
+    1581,
+    1578,
+    1605,
+    1582,
+    1580,
+    1605,
+    1581,
+    1581,
+    1605,
+    1610,
+    1581,
+    1605,
+    1609,
+    1587,
+    1581,
+    1580,
+    1587,
+    1580,
+    1581,
+    1587,
+    1580,
+    1609,
+    1587,
+    1605,
+    1581,
+    1587,
+    1605,
+    1580,
+    1587,
+    1605,
+    1605,
+    1589,
+    1581,
+    1581,
+    1589,
+    1605,
+    1605,
+    1588,
+    1581,
+    1605,
+    1588,
+    1580,
+    1610,
+    1588,
+    1605,
+    1582,
+    1588,
+    1605,
+    1605,
+    1590,
+    1581,
+    1609,
+    1590,
+    1582,
+    1605,
+    1591,
+    1605,
+    1581,
+    1591,
+    1605,
+    1605,
+    1591,
+    1605,
+    1610,
+    1593,
+    1580,
+    1605,
+    1593,
+    1605,
+    1605,
+    1593,
+    1605,
+    1609,
+    1594,
+    1605,
+    1605,
+    1594,
+    1605,
+    1610,
+    1594,
+    1605,
+    1609,
+    1601,
+    1582,
+    1605,
+    1602,
+    1605,
+    1581,
+    1602,
+    1605,
+    1605,
+    1604,
+    1581,
+    1605,
+    1604,
+    1581,
+    1610,
+    1604,
+    1581,
+    1609,
+    1604,
+    1580,
+    1580,
+    1604,
+    1582,
+    1605,
+    1604,
+    1605,
+    1581,
+    1605,
+    1581,
+    1580,
+    1605,
+    1581,
+    1605,
+    1605,
+    1581,
+    1610,
+    1605,
+    1580,
+    1581,
+    1605,
+    1580,
+    1605,
+    1605,
+    1582,
+    1580,
+    1605,
+    1582,
+    1605,
+    1605,
+    1580,
+    1582,
+    1607,
+    1605,
+    1580,
+    1607,
+    1605,
+    1605,
+    1606,
+    1581,
+    1605,
+    1606,
+    1581,
+    1609,
+    1606,
+    1580,
+    1605,
+    1606,
+    1580,
+    1609,
+    1606,
+    1605,
+    1610,
+    1606,
+    1605,
+    1609,
+    1610,
+    1605,
+    1605,
+    1576,
+    1582,
+    1610,
+    1578,
+    1580,
+    1610,
+    1578,
+    1580,
+    1609,
+    1578,
+    1582,
+    1610,
+    1578,
+    1582,
+    1609,
+    1578,
+    1605,
+    1610,
+    1578,
+    1605,
+    1609,
+    1580,
+    1605,
+    1610,
+    1580,
+    1581,
+    1609,
+    1580,
+    1605,
+    1609,
+    1587,
+    1582,
+    1609,
+    1589,
+    1581,
+    1610,
+    1588,
+    1581,
+    1610,
+    1590,
+    1581,
+    1610,
+    1604,
+    1580,
+    1610,
+    1604,
+    1605,
+    1610,
+    1610,
+    1581,
+    1610,
+    1610,
+    1580,
+    1610,
+    1610,
+    1605,
+    1610,
+    1605,
+    1605,
+    1610,
+    1602,
+    1605,
+    1610,
+    1606,
+    1581,
+    1610,
+    1593,
+    1605,
+    1610,
+    1603,
+    1605,
+    1610,
+    1606,
+    1580,
+    1581,
+    1605,
+    1582,
+    1610,
+    1604,
+    1580,
+    1605,
+    1603,
+    1605,
+    1605,
+    1580,
+    1581,
+    1610,
+    1581,
+    1580,
+    1610,
+    1605,
+    1580,
+    1610,
+    1601,
+    1605,
+    1610,
+    1576,
+    1581,
+    1610,
+    1587,
+    1582,
+    1610,
+    1606,
+    1580,
+    1610,
+    1589,
+    1604,
+    1746,
+    1602,
+    1604,
+    1746,
+    1575,
+    1604,
+    1604,
+    1607,
+    1575,
+    1603,
+    1576,
+    1585,
+    1605,
+    1581,
+    1605,
+    1583,
+    1589,
+    1604,
+    1593,
+    1605,
+    1585,
+    1587,
+    1608,
+    1604,
+    1593,
+    1604,
+    1610,
+    1607,
+    1608,
+    1587,
+    1604,
+    1605,
+    1589,
+    1604,
+    1609,
+    17,
+    1589,
+    1604,
+    1609,
+    32,
+    1575,
+    1604,
+    1604,
+    1607,
+    32,
+    1593,
+    1604,
+    1610,
+    1607,
+    32,
+    1608,
+    1587,
+    1604,
+    1605,
+    7,
+    1580,
+    1604,
+    32,
+    1580,
+    1604,
+    1575,
+    1604,
+    1607,
+    1585,
+    1740,
+    1575,
+    1604,
+    44,
+    12289,
+    12290,
+    58,
+    33,
+    63,
+    12310,
+    12311,
+    8230,
+    8229,
+    8212,
+    8211,
+    95,
+    123,
+    125,
+    12308,
+    12309,
+    12304,
+    12305,
+    12298,
+    12299,
+    12300,
+    12301,
+    12302,
+    12303,
+    91,
+    93,
+    8254,
+    35,
+    38,
+    42,
+    45,
+    60,
+    62,
+    92,
+    36,
+    37,
+    64,
+    32,
+    1611,
+    1600,
+    1611,
+    32,
+    1612,
+    32,
+    1613,
+    32,
+    1614,
+    1600,
+    1614,
+    32,
+    1615,
+    1600,
+    1615,
+    32,
+    1616,
+    1600,
+    1616,
+    32,
+    1617,
+    1600,
+    1617,
+    32,
+    1618,
+    1600,
+    1618,
+    1569,
+    1570,
+    1571,
+    1572,
+    1573,
+    1574,
+    1575,
+    1576,
+    1577,
+    1578,
+    1579,
+    1580,
+    1581,
+    1582,
+    1583,
+    1584,
+    1585,
+    1586,
+    1587,
+    1588,
+    1589,
+    1590,
+    1591,
+    1592,
+    1593,
+    1594,
+    1601,
+    1602,
+    1603,
+    1604,
+    1605,
+    1606,
+    1607,
+    1608,
+    1610,
+    1604,
+    1570,
+    1604,
+    1571,
+    1604,
+    1573,
+    1604,
+    1575,
+    34,
+    39,
+    47,
+    65345,
+    65346,
+    65347,
+    65348,
+    65349,
+    65350,
+    65351,
+    65352,
+    65353,
+    65354,
+    65355,
+    65356,
+    65357,
+    65358,
+    65359,
+    65360,
+    65361,
+    65362,
+    65363,
+    65364,
+    65365,
+    65366,
+    65367,
+    65368,
+    65369,
+    65370,
+    94,
+    124,
+    126,
+    10629,
+    10630,
+    12539,
+    12449,
+    12451,
+    12453,
+    12455,
+    12457,
+    12515,
+    12517,
+    12519,
+    12483,
+    12540,
+    12531,
+    12441,
+    12442,
+    12644,
+    12593,
+    12594,
+    12595,
+    12596,
+    12597,
+    12598,
+    12599,
+    12600,
+    12601,
+    12602,
+    12603,
+    12604,
+    12605,
+    12606,
+    12607,
+    12608,
+    12609,
+    12610,
+    12611,
+    12612,
+    12613,
+    12614,
+    12615,
+    12616,
+    12617,
+    12618,
+    12619,
+    12620,
+    12621,
+    12622,
+    12623,
+    12624,
+    12625,
+    12626,
+    12627,
+    12628,
+    12629,
+    12630,
+    12631,
+    12632,
+    12633,
+    12634,
+    12635,
+    12636,
+    12637,
+    12638,
+    12639,
+    12640,
+    12641,
+    12642,
+    12643,
+    162,
+    163,
+    172,
+    175,
+    166,
+    165,
+    8361,
+    9474,
+    8592,
+    8593,
+    8594,
+    8595,
+    9632,
+    9675,
+    55297,
+    56360,
+    55297,
+    56361,
+    55297,
+    56362,
+    55297,
+    56363,
+    55297,
+    56364,
+    55297,
+    56365,
+    55297,
+    56366,
+    55297,
+    56367,
+    55297,
+    56368,
+    55297,
+    56369,
+    55297,
+    56370,
+    55297,
+    56371,
+    55297,
+    56372,
+    55297,
+    56373,
+    55297,
+    56374,
+    55297,
+    56375,
+    55297,
+    56376,
+    55297,
+    56377,
+    55297,
+    56378,
+    55297,
+    56379,
+    55297,
+    56380,
+    55297,
+    56381,
+    55297,
+    56382,
+    55297,
+    56383,
+    55297,
+    56384,
+    55297,
+    56385,
+    55297,
+    56386,
+    55297,
+    56387,
+    55297,
+    56388,
+    55297,
+    56389,
+    55297,
+    56390,
+    55297,
+    56391,
+    55297,
+    56392,
+    55297,
+    56393,
+    55297,
+    56394,
+    55297,
+    56395,
+    55297,
+    56396,
+    55297,
+    56397,
+    55297,
+    56398,
+    55297,
+    56399,
+    55297,
+    56536,
+    55297,
+    56537,
+    55297,
+    56538,
+    55297,
+    56539,
+    55297,
+    56540,
+    55297,
+    56541,
+    55297,
+    56542,
+    55297,
+    56543,
+    55297,
+    56544,
+    55297,
+    56545,
+    55297,
+    56546,
+    55297,
+    56547,
+    55297,
+    56548,
+    55297,
+    56549,
+    55297,
+    56550,
+    55297,
+    56551,
+    55297,
+    56552,
+    55297,
+    56553,
+    55297,
+    56554,
+    55297,
+    56555,
+    55297,
+    56556,
+    55297,
+    56557,
+    55297,
+    56558,
+    55297,
+    56559,
+    55297,
+    56560,
+    55297,
+    56561,
+    55297,
+    56562,
+    55297,
+    56563,
+    55297,
+    56564,
+    55297,
+    56565,
+    55297,
+    56566,
+    55297,
+    56567,
+    55297,
+    56568,
+    55297,
+    56569,
+    55297,
+    56570,
+    55297,
+    56571,
+    55299,
+    56512,
+    55299,
+    56513,
+    55299,
+    56514,
+    55299,
+    56515,
+    55299,
+    56516,
+    55299,
+    56517,
+    55299,
+    56518,
+    55299,
+    56519,
+    55299,
+    56520,
+    55299,
+    56521,
+    55299,
+    56522,
+    55299,
+    56523,
+    55299,
+    56524,
+    55299,
+    56525,
+    55299,
+    56526,
+    55299,
+    56527,
+    55299,
+    56528,
+    55299,
+    56529,
+    55299,
+    56530,
+    55299,
+    56531,
+    55299,
+    56532,
+    55299,
+    56533,
+    55299,
+    56534,
+    55299,
+    56535,
+    55299,
+    56536,
+    55299,
+    56537,
+    55299,
+    56538,
+    55299,
+    56539,
+    55299,
+    56540,
+    55299,
+    56541,
+    55299,
+    56542,
+    55299,
+    56543,
+    55299,
+    56544,
+    55299,
+    56545,
+    55299,
+    56546,
+    55299,
+    56547,
+    55299,
+    56548,
+    55299,
+    56549,
+    55299,
+    56550,
+    55299,
+    56551,
+    55299,
+    56552,
+    55299,
+    56553,
+    55299,
+    56554,
+    55299,
+    56555,
+    55299,
+    56556,
+    55299,
+    56557,
+    55299,
+    56558,
+    55299,
+    56559,
+    55299,
+    56560,
+    55299,
+    56561,
+    55299,
+    56562,
+    55300,
+    56473,
+    55300,
+    56506,
+    55300,
+    56475,
+    55300,
+    56506,
+    55300,
+    56485,
+    55300,
+    56506,
+    55300,
+    56625,
+    55300,
+    56615,
+    55300,
+    56626,
+    55300,
+    56615,
+    55300,
+    57159,
+    55300,
+    57150,
+    55300,
+    57159,
+    55300,
+    57175,
+    55301,
+    56505,
+    55301,
+    56506,
+    55301,
+    56505,
+    55301,
+    56496,
+    55301,
+    56505,
+    55301,
+    56509,
+    55301,
+    56760,
+    55301,
+    56751,
+    55301,
+    56761,
+    55301,
+    56751,
+    55302,
+    56512,
+    55302,
+    56513,
+    55302,
+    56514,
+    55302,
+    56515,
+    55302,
+    56516,
+    55302,
+    56517,
+    55302,
+    56518,
+    55302,
+    56519,
+    55302,
+    56520,
+    55302,
+    56521,
+    55302,
+    56522,
+    55302,
+    56523,
+    55302,
+    56524,
+    55302,
+    56525,
+    55302,
+    56526,
+    55302,
+    56527,
+    55302,
+    56528,
+    55302,
+    56529,
+    55302,
+    56530,
+    55302,
+    56531,
+    55302,
+    56532,
+    55302,
+    56533,
+    55302,
+    56534,
+    55302,
+    56535,
+    55302,
+    56536,
+    55302,
+    56537,
+    55302,
+    56538,
+    55302,
+    56539,
+    55302,
+    56540,
+    55302,
+    56541,
+    55302,
+    56542,
+    55302,
+    56543,
+    55323,
+    56928,
+    55323,
+    56929,
+    55323,
+    56930,
+    55323,
+    56931,
+    55323,
+    56932,
+    55323,
+    56933,
+    55323,
+    56934,
+    55323,
+    56935,
+    55323,
+    56936,
+    55323,
+    56937,
+    55323,
+    56938,
+    55323,
+    56939,
+    55323,
+    56940,
+    55323,
+    56941,
+    55323,
+    56942,
+    55323,
+    56943,
+    55323,
+    56944,
+    55323,
+    56945,
+    55323,
+    56946,
+    55323,
+    56947,
+    55323,
+    56948,
+    55323,
+    56949,
+    55323,
+    56950,
+    55323,
+    56951,
+    55323,
+    56952,
+    55323,
+    56953,
+    55323,
+    56954,
+    55323,
+    56955,
+    55323,
+    56956,
+    55323,
+    56957,
+    55323,
+    56958,
+    55323,
+    56959,
+    55348,
+    56663,
+    55348,
+    56677,
+    55348,
+    56664,
+    55348,
+    56677,
+    55348,
+    56671,
+    55348,
+    56686,
+    55348,
+    56671,
+    55348,
+    56687,
+    55348,
+    56671,
+    55348,
+    56688,
+    55348,
+    56671,
+    55348,
+    56689,
+    55348,
+    56671,
+    55348,
+    56690,
+    55348,
+    56761,
+    55348,
+    56677,
+    55348,
+    56762,
+    55348,
+    56677,
+    55348,
+    56763,
+    55348,
+    56686,
+    55348,
+    56764,
+    55348,
+    56686,
+    55348,
+    56763,
+    55348,
+    56687,
+    55348,
+    56764,
+    55348,
+    56687,
+    305,
+    567,
+    913,
+    914,
+    916,
+    917,
+    918,
+    919,
+    921,
+    922,
+    923,
+    924,
+    925,
+    926,
+    927,
+    929,
+    1012,
+    932,
+    934,
+    935,
+    936,
+    8711,
+    8706,
+    1013,
+    977,
+    1008,
+    981,
+    1009,
+    982,
+    988,
+    55354,
+    56610,
+    55354,
+    56611,
+    55354,
+    56612,
+    55354,
+    56613,
+    55354,
+    56614,
+    55354,
+    56615,
+    55354,
+    56616,
+    55354,
+    56617,
+    55354,
+    56618,
+    55354,
+    56619,
+    55354,
+    56620,
+    55354,
+    56621,
+    55354,
+    56622,
+    55354,
+    56623,
+    55354,
+    56624,
+    55354,
+    56625,
+    55354,
+    56626,
+    55354,
+    56627,
+    55354,
+    56628,
+    55354,
+    56629,
+    55354,
+    56630,
+    55354,
+    56631,
+    55354,
+    56632,
+    55354,
+    56633,
+    55354,
+    56634,
+    55354,
+    56635,
+    55354,
+    56636,
+    55354,
+    56637,
+    55354,
+    56638,
+    55354,
+    56639,
+    55354,
+    56640,
+    55354,
+    56641,
+    55354,
+    56642,
+    55354,
+    56643,
+    1646,
+    1697,
+    1647,
+    48,
+    46,
+    48,
+    44,
+    49,
+    44,
+    50,
+    44,
+    51,
+    44,
+    52,
+    44,
+    53,
+    44,
+    54,
+    44,
+    55,
+    44,
+    56,
+    44,
+    57,
+    44,
+    40,
+    65,
+    41,
+    40,
+    66,
+    41,
+    40,
+    67,
+    41,
+    40,
+    68,
+    41,
+    40,
+    69,
+    41,
+    40,
+    70,
+    41,
+    40,
+    71,
+    41,
+    40,
+    72,
+    41,
+    40,
+    73,
+    41,
+    40,
+    74,
+    41,
+    40,
+    75,
+    41,
+    40,
+    76,
+    41,
+    40,
+    77,
+    41,
+    40,
+    78,
+    41,
+    40,
+    79,
+    41,
+    40,
+    80,
+    41,
+    40,
+    81,
+    41,
+    40,
+    82,
+    41,
+    40,
+    83,
+    41,
+    40,
+    84,
+    41,
+    40,
+    85,
+    41,
+    40,
+    86,
+    41,
+    40,
+    87,
+    41,
+    40,
+    88,
+    41,
+    40,
+    89,
+    41,
+    40,
+    90,
+    41,
+    12308,
+    83,
+    12309,
+    67,
+    68,
+    87,
+    90,
+    72,
+    86,
+    83,
+    68,
+    83,
+    83,
+    80,
+    80,
+    86,
+    87,
+    67,
+    77,
+    67,
+    77,
+    68,
+    77,
+    82,
+    68,
+    74,
+    12411,
+    12363,
+    12467,
+    12467,
+    23383,
+    21452,
+    12487,
+    22810,
+    35299,
+    20132,
+    26144,
+    28961,
+    21069,
+    24460,
+    20877,
+    26032,
+    21021,
+    32066,
+    36009,
+    22768,
+    21561,
+    28436,
+    25237,
+    25429,
+    36938,
+    25351,
+    25171,
+    31105,
+    31354,
+    21512,
+    28288,
+    30003,
+    21106,
+    21942,
+    37197,
+    12308,
+    26412,
+    12309,
+    12308,
+    19977,
+    12309,
+    12308,
+    20108,
+    12309,
+    12308,
+    23433,
+    12309,
+    12308,
+    28857,
+    12309,
+    12308,
+    25171,
+    12309,
+    12308,
+    30423,
+    12309,
+    12308,
+    21213,
+    12309,
+    12308,
+    25943,
+    12309,
+    24471,
+    21487,
+    20029,
+    20024,
+    20033,
+    55360,
+    56610,
+    20320,
+    20411,
+    20482,
+    20602,
+    20633,
+    20687,
+    13470,
+    55361,
+    56890,
+    20820,
+    20836,
+    20855,
+    55361,
+    56604,
+    13497,
+    20839,
+    55361,
+    56651,
+    20887,
+    20900,
+    20172,
+    20908,
+    55396,
+    56799,
+    20995,
+    13535,
+    21051,
+    21062,
+    21111,
+    13589,
+    21253,
+    21254,
+    21321,
+    21338,
+    21363,
+    21373,
+    21375,
+    55362,
+    56876,
+    28784,
+    21450,
+    21471,
+    55362,
+    57187,
+    21483,
+    21489,
+    21510,
+    21662,
+    21560,
+    21576,
+    21608,
+    21666,
+    21750,
+    21776,
+    21843,
+    21859,
+    21892,
+    21931,
+    21939,
+    21954,
+    22294,
+    22295,
+    22097,
+    22132,
+    22766,
+    22478,
+    22516,
+    22541,
+    22411,
+    22578,
+    22577,
+    22700,
+    55365,
+    56548,
+    22770,
+    22775,
+    22790,
+    22818,
+    22882,
+    55365,
+    57000,
+    55365,
+    57066,
+    23020,
+    23067,
+    23079,
+    23000,
+    23142,
+    14062,
+    14076,
+    23304,
+    23358,
+    55366,
+    56776,
+    23491,
+    23512,
+    23539,
+    55366,
+    57112,
+    23551,
+    23558,
+    24403,
+    14209,
+    23648,
+    23744,
+    23693,
+    55367,
+    56804,
+    23875,
+    55367,
+    56806,
+    23918,
+    23915,
+    23932,
+    24033,
+    24034,
+    14383,
+    24061,
+    24104,
+    24125,
+    24169,
+    14434,
+    55368,
+    56707,
+    14460,
+    24240,
+    24243,
+    24246,
+    55400,
+    57234,
+    55368,
+    57137,
+    33281,
+    24354,
+    14535,
+    55372,
+    57016,
+    55384,
+    56794,
+    24418,
+    24427,
+    14563,
+    24474,
+    24525,
+    24535,
+    24569,
+    24705,
+    14650,
+    14620,
+    55369,
+    57044,
+    24775,
+    24904,
+    24908,
+    24954,
+    25010,
+    24996,
+    25007,
+    25054,
+    25104,
+    25115,
+    25181,
+    25265,
+    25300,
+    25424,
+    55370,
+    57100,
+    25405,
+    25340,
+    25448,
+    25475,
+    25572,
+    55370,
+    57329,
+    25634,
+    25541,
+    25513,
+    14894,
+    25705,
+    25726,
+    25757,
+    25719,
+    14956,
+    25964,
+    55372,
+    56330,
+    26083,
+    26360,
+    26185,
+    15129,
+    15112,
+    15076,
+    20882,
+    20885,
+    26368,
+    26268,
+    32941,
+    17369,
+    26401,
+    26462,
+    26451,
+    55372,
+    57283,
+    15177,
+    26618,
+    26501,
+    26706,
+    55373,
+    56429,
+    26766,
+    26655,
+    26900,
+    26946,
+    27043,
+    27114,
+    27304,
+    55373,
+    56995,
+    27355,
+    15384,
+    27425,
+    55374,
+    56487,
+    27476,
+    15438,
+    27506,
+    27551,
+    27579,
+    55374,
+    56973,
+    55367,
+    56587,
+    55374,
+    57082,
+    27726,
+    55375,
+    56508,
+    27839,
+    27853,
+    27751,
+    27926,
+    27966,
+    28009,
+    28024,
+    28037,
+    55375,
+    56606,
+    27956,
+    28207,
+    28270,
+    15667,
+    28359,
+    55375,
+    57041,
+    28153,
+    28526,
+    55375,
+    57182,
+    55375,
+    57230,
+    28614,
+    28729,
+    28699,
+    15766,
+    28746,
+    28797,
+    28791,
+    28845,
+    55361,
+    56613,
+    28997,
+    55376,
+    56931,
+    29084,
+    55376,
+    57259,
+    29224,
+    29264,
+    55377,
+    56840,
+    29312,
+    29333,
+    55377,
+    57141,
+    55378,
+    56340,
+    29562,
+    29579,
+    16044,
+    29605,
+    16056,
+    29767,
+    29788,
+    29829,
+    29898,
+    16155,
+    29988,
+    55379,
+    56374,
+    30014,
+    55379,
+    56466,
+    55368,
+    56735,
+    30224,
+    55379,
+    57249,
+    55379,
+    57272,
+    55380,
+    56388,
+    16380,
+    16392,
+    55380,
+    56563,
+    55380,
+    56562,
+    55380,
+    56601,
+    55380,
+    56627,
+    30494,
+    30495,
+    30603,
+    16454,
+    16534,
+    55381,
+    56349,
+    30798,
+    16611,
+    55381,
+    56870,
+    55381,
+    56986,
+    55381,
+    57029,
+    31211,
+    16687,
+    31306,
+    31311,
+    55382,
+    56700,
+    55382,
+    56999,
+    31470,
+    16898,
+    55382,
+    57259,
+    31686,
+    31689,
+    16935,
+    55383,
+    56448,
+    31954,
+    17056,
+    31976,
+    31971,
+    32000,
+    55383,
+    57222,
+    32099,
+    17153,
+    32199,
+    32258,
+    32325,
+    17204,
+    55384,
+    56872,
+    55384,
+    56903,
+    17241,
+    55384,
+    57049,
+    32634,
+    55384,
+    57150,
+    32661,
+    32762,
+    55385,
+    56538,
+    55385,
+    56611,
+    32864,
+    55385,
+    56744,
+    32880,
+    55372,
+    57183,
+    17365,
+    32946,
+    33027,
+    17419,
+    33086,
+    23221,
+    55385,
+    57255,
+    55385,
+    57269,
+    55372,
+    57235,
+    55372,
+    57244,
+    33284,
+    36766,
+    17515,
+    33425,
+    33419,
+    33437,
+    21171,
+    33457,
+    33459,
+    33469,
+    33510,
+    55386,
+    57148,
+    33565,
+    33635,
+    33709,
+    33571,
+    33725,
+    33767,
+    33619,
+    33738,
+    33740,
+    33756,
+    55387,
+    56374,
+    55387,
+    56683,
+    55387,
+    56533,
+    17707,
+    34033,
+    34035,
+    34070,
+    55388,
+    57290,
+    34148,
+    55387,
+    57132,
+    17757,
+    17761,
+    55387,
+    57265,
+    55388,
+    56530,
+    17771,
+    34384,
+    34407,
+    34409,
+    34473,
+    34440,
+    34574,
+    34530,
+    34600,
+    34667,
+    34694,
+    17879,
+    34785,
+    34817,
+    17913,
+    34912,
+    55389,
+    56935,
+    35031,
+    35038,
+    17973,
+    35066,
+    13499,
+    55390,
+    56494,
+    55390,
+    56678,
+    18110,
+    18119,
+    35488,
+    55391,
+    56488,
+    36011,
+    36033,
+    36123,
+    36215,
+    55391,
+    57135,
+    55362,
+    56324,
+    36299,
+    36284,
+    36336,
+    55362,
+    56542,
+    36564,
+    55393,
+    56786,
+    55393,
+    56813,
+    37012,
+    37105,
+    37137,
+    55393,
+    57134,
+    37147,
+    37432,
+    37591,
+    37592,
+    37500,
+    37881,
+    37909,
+    55394,
+    57338,
+    38283,
+    18837,
+    38327,
+    55395,
+    56695,
+    18918,
+    38595,
+    23986,
+    38691,
+    55396,
+    56645,
+    55396,
+    56858,
+    19054,
+    19062,
+    38880,
+    55397,
+    56330,
+    19122,
+    55397,
+    56470,
+    38953,
+    55397,
+    56758,
+    39138,
+    19251,
+    39209,
+    39335,
+    39362,
+    39422,
+    19406,
+    55398,
+    57136,
+    40000,
+    40189,
+    19662,
+    19693,
+    40295,
+    55400,
+    56526,
+    19704,
+    55400,
+    56581,
+    55400,
+    56846,
+    55400,
+    56977,
+    19798,
+    40702,
+    40709,
+    40719,
+    40726,
+    55401,
+    56832,
+    7838,
+    192,
+    193,
+    194,
+    195,
+    196,
+    199,
+    200,
+    201,
+    202,
+    203,
+    204,
+    205,
+    206,
+    207,
+    208,
+    209,
+    210,
+    211,
+    212,
+    213,
+    214,
+    216,
+    217,
+    218,
+    219,
+    220,
+    221,
+    222,
+    376,
+    256,
+    258,
+    260,
+    262,
+    264,
+    266,
+    268,
+    270,
+    272,
+    274,
+    276,
+    278,
+    280,
+    282,
+    284,
+    286,
+    288,
+    290,
+    292,
+    296,
+    298,
+    300,
+    302,
+    306,
+    308,
+    310,
+    313,
+    315,
+    317,
+    319,
+    321,
+    323,
+    325,
+    327,
+    330,
+    332,
+    334,
+    336,
+    338,
+    340,
+    342,
+    344,
+    346,
+    348,
+    350,
+    352,
+    354,
+    356,
+    358,
+    360,
+    362,
+    364,
+    366,
+    368,
+    370,
+    372,
+    374,
+    377,
+    379,
+    381,
+    579,
+    386,
+    388,
+    391,
+    395,
+    401,
+    502,
+    408,
+    573,
+    544,
+    416,
+    418,
+    420,
+    423,
+    428,
+    431,
+    435,
+    437,
+    440,
+    444,
+    503,
+    453,
+    452,
+    456,
+    455,
+    459,
+    458,
+    461,
+    463,
+    465,
+    467,
+    469,
+    471,
+    473,
+    475,
+    478,
+    480,
+    482,
+    484,
+    486,
+    488,
+    490,
+    492,
+    494,
+    498,
+    497,
+    500,
+    504,
+    506,
+    508,
+    510,
+    512,
+    514,
+    516,
+    518,
+    520,
+    522,
+    524,
+    526,
+    528,
+    530,
+    532,
+    534,
+    536,
+    538,
+    540,
+    542,
+    548,
+    550,
+    552,
+    554,
+    556,
+    558,
+    560,
+    562,
+    571,
+    11390,
+    11391,
+    577,
+    582,
+    584,
+    586,
+    588,
+    590,
+    11375,
+    11373,
+    11376,
+    385,
+    390,
+    393,
+    394,
+    399,
+    42923,
+    403,
+    42924,
+    404,
+    42893,
+    42922,
+    407,
+    406,
+    42926,
+    11362,
+    42925,
+    412,
+    11374,
+    413,
+    415,
+    11364,
+    422,
+    42949,
+    425,
+    42929,
+    430,
+    580,
+    433,
+    434,
+    581,
+    439,
+    42930,
+    42928,
+    880,
+    882,
+    886,
+    1021,
+    1022,
+    1023,
+    938,
+    939,
+    975,
+    984,
+    986,
+    990,
+    992,
+    994,
+    996,
+    998,
+    1000,
+    1002,
+    1004,
+    1006,
+    1017,
+    895,
+    1015,
+    1018,
+    1040,
+    1041,
+    1042,
+    1043,
+    1044,
+    1045,
+    1046,
+    1047,
+    1048,
+    1049,
+    1050,
+    1051,
+    1052,
+    1053,
+    1054,
+    1055,
+    1056,
+    1057,
+    1058,
+    1059,
+    1060,
+    1061,
+    1062,
+    1063,
+    1064,
+    1065,
+    1066,
+    1067,
+    1068,
+    1069,
+    1070,
+    1071,
+    1024,
+    1025,
+    1026,
+    1027,
+    1028,
+    1029,
+    1030,
+    1031,
+    1032,
+    1033,
+    1034,
+    1035,
+    1036,
+    1037,
+    1038,
+    1039,
+    1120,
+    1122,
+    1124,
+    1126,
+    1128,
+    1130,
+    1132,
+    1134,
+    1136,
+    1138,
+    1140,
+    1142,
+    1144,
+    1146,
+    1148,
+    1150,
+    1152,
+    1162,
+    1164,
+    1166,
+    1168,
+    1170,
+    1172,
+    1174,
+    1176,
+    1178,
+    1180,
+    1182,
+    1184,
+    1186,
+    1188,
+    1190,
+    1192,
+    1194,
+    1196,
+    1198,
+    1200,
+    1202,
+    1204,
+    1206,
+    1208,
+    1210,
+    1212,
+    1214,
+    1217,
+    1219,
+    1221,
+    1223,
+    1225,
+    1227,
+    1229,
+    1216,
+    1232,
+    1234,
+    1236,
+    1238,
+    1240,
+    1242,
+    1244,
+    1246,
+    1248,
+    1250,
+    1252,
+    1254,
+    1256,
+    1258,
+    1260,
+    1262,
+    1264,
+    1266,
+    1268,
+    1270,
+    1272,
+    1274,
+    1276,
+    1278,
+    1280,
+    1282,
+    1284,
+    1286,
+    1288,
+    1290,
+    1292,
+    1294,
+    1296,
+    1298,
+    1300,
+    1302,
+    1304,
+    1306,
+    1308,
+    1310,
+    1312,
+    1314,
+    1316,
+    1318,
+    1320,
+    1322,
+    1324,
+    1326,
+    1329,
+    1330,
+    1331,
+    1332,
+    1333,
+    1334,
+    1335,
+    1336,
+    1337,
+    1338,
+    1339,
+    1340,
+    1341,
+    1342,
+    1343,
+    1344,
+    1345,
+    1346,
+    1347,
+    1348,
+    1349,
+    1350,
+    1351,
+    1352,
+    1353,
+    1354,
+    1355,
+    1356,
+    1357,
+    1358,
+    1359,
+    1360,
+    1361,
+    1362,
+    1363,
+    1364,
+    1365,
+    1366,
+    7312,
+    7313,
+    7314,
+    7315,
+    7316,
+    7317,
+    7318,
+    7319,
+    7320,
+    7321,
+    7322,
+    7323,
+    7324,
+    7325,
+    7326,
+    7327,
+    7328,
+    7329,
+    7330,
+    7331,
+    7332,
+    7333,
+    7334,
+    7335,
+    7336,
+    7337,
+    7338,
+    7339,
+    7340,
+    7341,
+    7342,
+    7343,
+    7344,
+    7345,
+    7346,
+    7347,
+    7348,
+    7349,
+    7350,
+    7351,
+    7352,
+    7353,
+    7354,
+    7357,
+    7358,
+    7359,
+    43888,
+    43889,
+    43890,
+    43891,
+    43892,
+    43893,
+    43894,
+    43895,
+    43896,
+    43897,
+    43898,
+    43899,
+    43900,
+    43901,
+    43902,
+    43903,
+    43904,
+    43905,
+    43906,
+    43907,
+    43908,
+    43909,
+    43910,
+    43911,
+    43912,
+    43913,
+    43914,
+    43915,
+    43916,
+    43917,
+    43918,
+    43919,
+    43920,
+    43921,
+    43922,
+    43923,
+    43924,
+    43925,
+    43926,
+    43927,
+    43928,
+    43929,
+    43930,
+    43931,
+    43932,
+    43933,
+    43934,
+    43935,
+    43936,
+    43937,
+    43938,
+    43939,
+    43940,
+    43941,
+    43942,
+    43943,
+    43944,
+    43945,
+    43946,
+    43947,
+    43948,
+    43949,
+    43950,
+    43951,
+    43952,
+    43953,
+    43954,
+    43955,
+    43956,
+    43957,
+    43958,
+    43959,
+    43960,
+    43961,
+    43962,
+    43963,
+    43964,
+    43965,
+    43966,
+    43967,
+    5112,
+    5113,
+    5114,
+    5115,
+    5116,
+    5117,
+    42570,
+    42877,
+    11363,
+    42950,
+    7680,
+    7682,
+    7684,
+    7686,
+    7688,
+    7690,
+    7692,
+    7694,
+    7696,
+    7698,
+    7700,
+    7702,
+    7704,
+    7706,
+    7708,
+    7710,
+    7712,
+    7714,
+    7716,
+    7718,
+    7720,
+    7722,
+    7724,
+    7726,
+    7728,
+    7730,
+    7732,
+    7734,
+    7736,
+    7738,
+    7740,
+    7742,
+    7744,
+    7746,
+    7748,
+    7750,
+    7752,
+    7754,
+    7756,
+    7758,
+    7760,
+    7762,
+    7764,
+    7766,
+    7768,
+    7770,
+    7772,
+    7774,
+    7776,
+    7778,
+    7780,
+    7782,
+    7784,
+    7786,
+    7788,
+    7790,
+    7792,
+    7794,
+    7796,
+    7798,
+    7800,
+    7802,
+    7804,
+    7806,
+    7808,
+    7810,
+    7812,
+    7814,
+    7816,
+    7818,
+    7820,
+    7822,
+    7824,
+    7826,
+    7828,
+    223,
+    7840,
+    7842,
+    7844,
+    7846,
+    7848,
+    7850,
+    7852,
+    7854,
+    7856,
+    7858,
+    7860,
+    7862,
+    7864,
+    7866,
+    7868,
+    7870,
+    7872,
+    7874,
+    7876,
+    7878,
+    7880,
+    7882,
+    7884,
+    7886,
+    7888,
+    7890,
+    7892,
+    7894,
+    7896,
+    7898,
+    7900,
+    7902,
+    7904,
+    7906,
+    7908,
+    7910,
+    7912,
+    7914,
+    7916,
+    7918,
+    7920,
+    7922,
+    7924,
+    7926,
+    7928,
+    7930,
+    7932,
+    7934,
+    7944,
+    7945,
+    7946,
+    7947,
+    7948,
+    7949,
+    7950,
+    7951,
+    7960,
+    7961,
+    7962,
+    7963,
+    7964,
+    7965,
+    7976,
+    7977,
+    7978,
+    7979,
+    7980,
+    7981,
+    7982,
+    7983,
+    7992,
+    7993,
+    7994,
+    7995,
+    7996,
+    7997,
+    7998,
+    7999,
+    8008,
+    8009,
+    8010,
+    8011,
+    8012,
+    8013,
+    8025,
+    8027,
+    8029,
+    8031,
+    8040,
+    8041,
+    8042,
+    8043,
+    8044,
+    8045,
+    8046,
+    8047,
+    8122,
+    8123,
+    8136,
+    8137,
+    8138,
+    8139,
+    8154,
+    8155,
+    8184,
+    8185,
+    8170,
+    8171,
+    8186,
+    8187,
+    8072,
+    8073,
+    8074,
+    8075,
+    8076,
+    8077,
+    8078,
+    8079,
+    8064,
+    8065,
+    8066,
+    8067,
+    8068,
+    8069,
+    8070,
+    8071,
+    8088,
+    8089,
+    8090,
+    8091,
+    8092,
+    8093,
+    8094,
+    8095,
+    8080,
+    8081,
+    8082,
+    8083,
+    8084,
+    8085,
+    8086,
+    8087,
+    8104,
+    8105,
+    8106,
+    8107,
+    8108,
+    8109,
+    8110,
+    8111,
+    8096,
+    8097,
+    8098,
+    8099,
+    8100,
+    8101,
+    8102,
+    8103,
+    8120,
+    8121,
+    8124,
+    8115,
+    8140,
+    8131,
+    8152,
+    8153,
+    8168,
+    8169,
+    8172,
+    8188,
+    8179,
+    8498,
+    8544,
+    8545,
+    8546,
+    8547,
+    8548,
+    8549,
+    8550,
+    8551,
+    8552,
+    8553,
+    8554,
+    8555,
+    8556,
+    8557,
+    8558,
+    8559,
+    8579,
+    9398,
+    9399,
+    9400,
+    9401,
+    9402,
+    9403,
+    9404,
+    9405,
+    9406,
+    9407,
+    9408,
+    9409,
+    9410,
+    9411,
+    9412,
+    9413,
+    9414,
+    9415,
+    9416,
+    9417,
+    9418,
+    9419,
+    9420,
+    9421,
+    9422,
+    9423,
+    11264,
+    11265,
+    11266,
+    11267,
+    11268,
+    11269,
+    11270,
+    11271,
+    11272,
+    11273,
+    11274,
+    11275,
+    11276,
+    11277,
+    11278,
+    11279,
+    11280,
+    11281,
+    11282,
+    11283,
+    11284,
+    11285,
+    11286,
+    11287,
+    11288,
+    11289,
+    11290,
+    11291,
+    11292,
+    11293,
+    11294,
+    11295,
+    11296,
+    11297,
+    11298,
+    11299,
+    11300,
+    11301,
+    11302,
+    11303,
+    11304,
+    11305,
+    11306,
+    11307,
+    11308,
+    11309,
+    11310,
+    11360,
+    570,
+    574,
+    11367,
+    11369,
+    11371,
+    11378,
+    11381,
+    11392,
+    11394,
+    11396,
+    11398,
+    11400,
+    11402,
+    11404,
+    11406,
+    11408,
+    11410,
+    11412,
+    11414,
+    11416,
+    11418,
+    11420,
+    11422,
+    11424,
+    11426,
+    11428,
+    11430,
+    11432,
+    11434,
+    11436,
+    11438,
+    11440,
+    11442,
+    11444,
+    11446,
+    11448,
+    11450,
+    11452,
+    11454,
+    11456,
+    11458,
+    11460,
+    11462,
+    11464,
+    11466,
+    11468,
+    11470,
+    11472,
+    11474,
+    11476,
+    11478,
+    11480,
+    11482,
+    11484,
+    11486,
+    11488,
+    11490,
+    11499,
+    11501,
+    11506,
+    4256,
+    4257,
+    4258,
+    4259,
+    4260,
+    4261,
+    4262,
+    4263,
+    4264,
+    4265,
+    4266,
+    4267,
+    4268,
+    4269,
+    4270,
+    4271,
+    4272,
+    4273,
+    4274,
+    4275,
+    4276,
+    4277,
+    4278,
+    4279,
+    4280,
+    4281,
+    4282,
+    4283,
+    4284,
+    4285,
+    4286,
+    4287,
+    4288,
+    4289,
+    4290,
+    4291,
+    4292,
+    4293,
+    4295,
+    4301,
+    42560,
+    42562,
+    42564,
+    42566,
+    42568,
+    42572,
+    42574,
+    42576,
+    42578,
+    42580,
+    42582,
+    42584,
+    42586,
+    42588,
+    42590,
+    42592,
+    42594,
+    42596,
+    42598,
+    42600,
+    42602,
+    42604,
+    42624,
+    42626,
+    42628,
+    42630,
+    42632,
+    42634,
+    42636,
+    42638,
+    42640,
+    42642,
+    42644,
+    42646,
+    42648,
+    42650,
+    42786,
+    42788,
+    42790,
+    42792,
+    42794,
+    42796,
+    42798,
+    42802,
+    42804,
+    42806,
+    42808,
+    42810,
+    42812,
+    42814,
+    42816,
+    42818,
+    42820,
+    42822,
+    42824,
+    42826,
+    42828,
+    42830,
+    42832,
+    42834,
+    42836,
+    42838,
+    42840,
+    42842,
+    42844,
+    42846,
+    42848,
+    42850,
+    42852,
+    42854,
+    42856,
+    42858,
+    42860,
+    42862,
+    42873,
+    42875,
+    42878,
+    42880,
+    42882,
+    42884,
+    42886,
+    42891,
+    42896,
+    42898,
+    42948,
+    42902,
+    42904,
+    42906,
+    42908,
+    42910,
+    42912,
+    42914,
+    42916,
+    42918,
+    42920,
+    42932,
+    42934,
+    42936,
+    42938,
+    42940,
+    42942,
+    42946,
+    42931,
+    65313,
+    65314,
+    65315,
+    65316,
+    65317,
+    65318,
+    65319,
+    65320,
+    65321,
+    65322,
+    65323,
+    65324,
+    65325,
+    65326,
+    65327,
+    65328,
+    65329,
+    65330,
+    65331,
+    65332,
+    65333,
+    65334,
+    65335,
+    65336,
+    65337,
+    65338,
+    55297,
+    56320,
+    55297,
+    56321,
+    55297,
+    56322,
+    55297,
+    56323,
+    55297,
+    56324,
+    55297,
+    56325,
+    55297,
+    56326,
+    55297,
+    56327,
+    55297,
+    56328,
+    55297,
+    56329,
+    55297,
+    56330,
+    55297,
+    56331,
+    55297,
+    56332,
+    55297,
+    56333,
+    55297,
+    56334,
+    55297,
+    56335,
+    55297,
+    56336,
+    55297,
+    56337,
+    55297,
+    56338,
+    55297,
+    56339,
+    55297,
+    56340,
+    55297,
+    56341,
+    55297,
+    56342,
+    55297,
+    56343,
+    55297,
+    56344,
+    55297,
+    56345,
+    55297,
+    56346,
+    55297,
+    56347,
+    55297,
+    56348,
+    55297,
+    56349,
+    55297,
+    56350,
+    55297,
+    56351,
+    55297,
+    56352,
+    55297,
+    56353,
+    55297,
+    56354,
+    55297,
+    56355,
+    55297,
+    56356,
+    55297,
+    56357,
+    55297,
+    56358,
+    55297,
+    56359,
+    55297,
+    56496,
+    55297,
+    56497,
+    55297,
+    56498,
+    55297,
+    56499,
+    55297,
+    56500,
+    55297,
+    56501,
+    55297,
+    56502,
+    55297,
+    56503,
+    55297,
+    56504,
+    55297,
+    56505,
+    55297,
+    56506,
+    55297,
+    56507,
+    55297,
+    56508,
+    55297,
+    56509,
+    55297,
+    56510,
+    55297,
+    56511,
+    55297,
+    56512,
+    55297,
+    56513,
+    55297,
+    56514,
+    55297,
+    56515,
+    55297,
+    56516,
+    55297,
+    56517,
+    55297,
+    56518,
+    55297,
+    56519,
+    55297,
+    56520,
+    55297,
+    56521,
+    55297,
+    56522,
+    55297,
+    56523,
+    55297,
+    56524,
+    55297,
+    56525,
+    55297,
+    56526,
+    55297,
+    56527,
+    55297,
+    56528,
+    55297,
+    56529,
+    55297,
+    56530,
+    55297,
+    56531,
+    55299,
+    56448,
+    55299,
+    56449,
+    55299,
+    56450,
+    55299,
+    56451,
+    55299,
+    56452,
+    55299,
+    56453,
+    55299,
+    56454,
+    55299,
+    56455,
+    55299,
+    56456,
+    55299,
+    56457,
+    55299,
+    56458,
+    55299,
+    56459,
+    55299,
+    56460,
+    55299,
+    56461,
+    55299,
+    56462,
+    55299,
+    56463,
+    55299,
+    56464,
+    55299,
+    56465,
+    55299,
+    56466,
+    55299,
+    56467,
+    55299,
+    56468,
+    55299,
+    56469,
+    55299,
+    56470,
+    55299,
+    56471,
+    55299,
+    56472,
+    55299,
+    56473,
+    55299,
+    56474,
+    55299,
+    56475,
+    55299,
+    56476,
+    55299,
+    56477,
+    55299,
+    56478,
+    55299,
+    56479,
+    55299,
+    56480,
+    55299,
+    56481,
+    55299,
+    56482,
+    55299,
+    56483,
+    55299,
+    56484,
+    55299,
+    56485,
+    55299,
+    56486,
+    55299,
+    56487,
+    55299,
+    56488,
+    55299,
+    56489,
+    55299,
+    56490,
+    55299,
+    56491,
+    55299,
+    56492,
+    55299,
+    56493,
+    55299,
+    56494,
+    55299,
+    56495,
+    55299,
+    56496,
+    55299,
+    56497,
+    55299,
+    56498,
+    55302,
+    56480,
+    55302,
+    56481,
+    55302,
+    56482,
+    55302,
+    56483,
+    55302,
+    56484,
+    55302,
+    56485,
+    55302,
+    56486,
+    55302,
+    56487,
+    55302,
+    56488,
+    55302,
+    56489,
+    55302,
+    56490,
+    55302,
+    56491,
+    55302,
+    56492,
+    55302,
+    56493,
+    55302,
+    56494,
+    55302,
+    56495,
+    55302,
+    56496,
+    55302,
+    56497,
+    55302,
+    56498,
+    55302,
+    56499,
+    55302,
+    56500,
+    55302,
+    56501,
+    55302,
+    56502,
+    55302,
+    56503,
+    55302,
+    56504,
+    55302,
+    56505,
+    55302,
+    56506,
+    55302,
+    56507,
+    55302,
+    56508,
+    55302,
+    56509,
+    55302,
+    56510,
+    55302,
+    56511,
+    55323,
+    56896,
+    55323,
+    56897,
+    55323,
+    56898,
+    55323,
+    56899,
+    55323,
+    56900,
+    55323,
+    56901,
+    55323,
+    56902,
+    55323,
+    56903,
+    55323,
+    56904,
+    55323,
+    56905,
+    55323,
+    56906,
+    55323,
+    56907,
+    55323,
+    56908,
+    55323,
+    56909,
+    55323,
+    56910,
+    55323,
+    56911,
+    55323,
+    56912,
+    55323,
+    56913,
+    55323,
+    56914,
+    55323,
+    56915,
+    55323,
+    56916,
+    55323,
+    56917,
+    55323,
+    56918,
+    55323,
+    56919,
+    55323,
+    56920,
+    55323,
+    56921,
+    55323,
+    56922,
+    55323,
+    56923,
+    55323,
+    56924,
+    55323,
+    56925,
+    55323,
+    56926,
+    55323,
+    56927,
+    55354,
+    56576,
+    55354,
+    56577,
+    55354,
+    56578,
+    55354,
+    56579,
+    55354,
+    56580,
+    55354,
+    56581,
+    55354,
+    56582,
+    55354,
+    56583,
+    55354,
+    56584,
+    55354,
+    56585,
+    55354,
+    56586,
+    55354,
+    56587,
+    55354,
+    56588,
+    55354,
+    56589,
+    55354,
+    56590,
+    55354,
+    56591,
+    55354,
+    56592,
+    55354,
+    56593,
+    55354,
+    56594,
+    55354,
+    56595,
+    55354,
+    56596,
+    55354,
+    56597,
+    55354,
+    56598,
+    55354,
+    56599,
+    55354,
+    56600,
+    55354,
+    56601,
+    55354,
+    56602,
+    55354,
+    56603,
+    55354,
+    56604,
+    55354,
+    56605,
+    55354,
+    56606,
+    55354,
+    56607,
+    55354,
+    56608,
+    55354,
+    56609,
+};
+
+static const utf8proc_uint16_t utf8proc_stage1table[] = {
+    0,
+    256,
+    512,
+    768,
+    1024,
+    1280,
+    1536,
+    1792,
+    2048,
+    2304,
+    2560,
+    2816,
+    3072,
+    3328,
+    3584,
+    3840,
+    4096,
+    4352,
+    4608,
+    4864,
+    5120,
+    5376,
+    5632,
+    5888,
+    6144,
+    6400,
+    6656,
+    6912,
+    7168,
+    7424,
+    7680,
+    7936,
+    8192,
+    8448,
+    8704,
+    8960,
+    9216,
+    9472,
+    9728,
+    9984,
+    10240,
+    10496,
+    10752,
+    11008,
+    11264,
+    11520,
+    11776,
+    12032,
+    12288,
+    12544,
+    12800,
+    13056,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13568,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13824,
+    14080,
+    13312,
+    13312,
+    13312,
+    14336,
+    5376,
+    14592,
+    14848,
+    15104,
+    15360,
+    15616,
+    15872,
+    16128,
+    16384,
+    16640,
+    16896,
+    17152,
+    17408,
+    17664,
+    16128,
+    16384,
+    16640,
+    16896,
+    17152,
+    17408,
+    17664,
+    16128,
+    16384,
+    16640,
+    16896,
+    17152,
+    17408,
+    17664,
+    16128,
+    16384,
+    16640,
+    16896,
+    17152,
+    17408,
+    17664,
+    16128,
+    16384,
+    16640,
+    16896,
+    17152,
+    17408,
+    17664,
+    16128,
+    16384,
+    16640,
+    16896,
+    17152,
+    17408,
+    17664,
+    16128,
+    17920,
+    18176,
+    18176,
+    18176,
+    18176,
+    18176,
+    18176,
+    18176,
+    18176,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18688,
+    18944,
+    19200,
+    19456,
+    19712,
+    19968,
+    20224,
+    20480,
+    20736,
+    20992,
+    21248,
+    21504,
+    21760,
+    5376,
+    22016,
+    22272,
+    22528,
+    22784,
+    23040,
+    23296,
+    23552,
+    23808,
+    24064,
+    24320,
+    24576,
+    24832,
+    25088,
+    25344,
+    25600,
+    25856,
+    26112,
+    26368,
+    26624,
+    26880,
+    27136,
+    27392,
+    27648,
+    27904,
+    28160,
+    5376,
+    5376,
+    5376,
+    28416,
+    28672,
+    28928,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    5376,
+    5376,
+    5376,
+    5376,
+    29184,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    5376,
+    5376,
+    29440,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    5376,
+    5376,
+    29696,
+    29952,
+    27136,
+    27136,
+    30208,
+    30464,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    30720,
+    13312,
+    13312,
+    30976,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    13312,
+    31232,
+    31488,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    31744,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    32000,
+    32256,
+    32512,
+    32768,
+    33024,
+    33280,
+    33536,
+    33792,
+    10240,
+    10240,
+    34048,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    34304,
+    34560,
+    34816,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    35072,
+    35328,
+    27136,
+    27136,
+    35584,
+    35840,
+    36096,
+    27136,
+    36352,
+    36608,
+    36864,
+    37120,
+    37376,
+    37632,
+    37888,
+    38144,
+    38400,
+    38656,
+    38912,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    39168,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    39424,
+    39680,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    39936,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    13312,
+    40192,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    40448,
+    40704,
+    40960,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    41216,
+    41472,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    27136,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    41728,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    18432,
+    41728,
+};
+
+static const utf8proc_uint16_t utf8proc_stage2table[] = {
+    1,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    3,
+    4,
+    3,
+    5,
+    6,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    7,
+    7,
+    7,
+    3,
+    8,
+    9,
+    9,
+    10,
+    11,
+    10,
+    9,
+    9,
+    12,
+    13,
+    9,
+    14,
+    15,
+    16,
+    15,
+    15,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    15,
+    9,
+    18,
+    19,
+    20,
+    9,
+    9,
+    21,
+    22,
+    23,
+    24,
+    25,
+    26,
+    27,
+    28,
+    29,
+    30,
+    31,
+    32,
+    33,
+    34,
+    35,
+    36,
+    37,
+    38,
+    39,
+    40,
+    41,
+    42,
+    43,
+    44,
+    45,
+    46,
+    12,
+    9,
+    13,
+    47,
+    48,
+    47,
+    49,
+    50,
+    51,
+    52,
+    53,
+    54,
+    55,
+    56,
+    57,
+    58,
+    59,
+    60,
+    61,
+    62,
+    63,
+    64,
+    65,
+    66,
+    67,
+    68,
+    69,
+    70,
+    71,
+    72,
+    73,
+    74,
+    12,
+    75,
+    13,
+    75,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    7,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    2,
+    76,
+    9,
+    11,
+    11,
+    11,
+    11,
+    77,
+    9,
+    78,
+    79,
+    80,
+    81,
+    75,
+    82,
+    79,
+    83,
+    84,
+    85,
+    86,
+    87,
+    88,
+    89,
+    9,
+    9,
+    90,
+    91,
+    92,
+    93,
+    94,
+    95,
+    96,
+    9,
+    97,
+    98,
+    99,
+    100,
+    101,
+    102,
+    103,
+    104,
+    105,
+    106,
+    107,
+    108,
+    109,
+    110,
+    111,
+    112,
+    113,
+    114,
+    115,
+    116,
+    117,
+    118,
+    119,
+    75,
+    120,
+    121,
+    122,
+    123,
+    124,
+    125,
+    126,
+    127,
+    128,
+    129,
+    130,
+    131,
+    132,
+    133,
+    134,
+    135,
+    136,
+    137,
+    138,
+    139,
+    140,
+    141,
+    142,
+    143,
+    144,
+    145,
+    146,
+    147,
+    148,
+    149,
+    150,
+    75,
+    151,
+    152,
+    153,
+    154,
+    155,
+    156,
+    157,
+    158,
+    159,
+    160,
+    161,
+    162,
+    163,
+    164,
+    165,
+    166,
+    167,
+    168,
+    169,
+    170,
+    171,
+    172,
+    173,
+    174,
+    175,
+    176,
+    177,
+    178,
+    179,
+    180,
+    181,
+    182,
+    183,
+    184,
+    185,
+    186,
+    187,
+    188,
+    189,
+    190,
+    191,
+    192,
+    193,
+    194,
+    195,
+    196,
+    197,
+    198,
+    199,
+    200,
+    201,
+    202,
+    203,
+    204,
+    205,
+    206,
+    207,
+    208,
+    209,
+    210,
+    211,
+    212,
+    213,
+    214,
+    215,
+    216,
+    217,
+    218,
+    219,
+    220,
+    221,
+    222,
+    223,
+    224,
+    225,
+    226,
+    227,
+    228,
+    229,
+    230,
+    231,
+    232,
+    233,
+    234,
+    235,
+    236,
+    237,
+    238,
+    239,
+    240,
+    241,
+    242,
+    243,
+    244,
+    245,
+    246,
+    247,
+    248,
+    249,
+    250,
+    251,
+    252,
+    253,
+    254,
+    255,
+    256,
+    257,
+    258,
+    259,
+    260,
+    261,
+    262,
+    263,
+    264,
+    265,
+    266,
+    267,
+    268,
+    269,
+    270,
+    271,
+    272,
+    273,
+    274,
+    275,
+    276,
+    277,
+    278,
+    279,
+    280,
+    281,
+    282,
+    283,
+    284,
+    285,
+    286,
+    287,
+    288,
+    289,
+    290,
+    291,
+    292,
+    293,
+    294,
+    295,
+    296,
+    297,
+    298,
+    299,
+    215,
+    300,
+    301,
+    302,
+    303,
+    304,
+    305,
+    306,
+    307,
+    308,
+    309,
+    310,
+    311,
+    312,
+    215,
+    313,
+    314,
+    315,
+    316,
+    317,
+    318,
+    319,
+    320,
+    321,
+    322,
+    323,
+    324,
+    325,
+    326,
+    215,
+    215,
+    327,
+    328,
+    329,
+    330,
+    331,
+    332,
+    333,
+    334,
+    335,
+    336,
+    337,
+    338,
+    339,
+    340,
+    215,
+    341,
+    342,
+    343,
+    215,
+    344,
+    341,
+    341,
+    341,
+    341,
+    345,
+    346,
+    347,
+    348,
+    349,
+    350,
+    351,
+    352,
+    353,
+    354,
+    355,
+    356,
+    357,
+    358,
+    359,
+    360,
+    361,
+    362,
+    363,
+    364,
+    365,
+    366,
+    367,
+    368,
+    369,
+    370,
+    371,
+    372,
+    373,
+    374,
+    375,
+    376,
+    377,
+    378,
+    379,
+    380,
+    381,
+    382,
+    383,
+    384,
+    385,
+    386,
+    387,
+    388,
+    389,
+    390,
+    391,
+    392,
+    393,
+    394,
+    395,
+    396,
+    397,
+    398,
+    399,
+    400,
+    401,
+    402,
+    403,
+    404,
+    405,
+    406,
+    407,
+    408,
+    409,
+    410,
+    411,
+    412,
+    413,
+    414,
+    415,
+    416,
+    417,
+    418,
+    419,
+    420,
+    421,
+    422,
+    423,
+    424,
+    425,
+    426,
+    427,
+    428,
+    429,
+    430,
+    431,
+    432,
+    433,
+    434,
+    435,
+    436,
+    437,
+    215,
+    438,
+    439,
+    440,
+    441,
+    442,
+    443,
+    444,
+    445,
+    446,
+    447,
+    448,
+    449,
+    450,
+    451,
+    452,
+    453,
+    454,
+    455,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    456,
+    457,
+    458,
+    459,
+    460,
+    461,
+    462,
+    463,
+    464,
+    465,
+    466,
+    467,
+    468,
+    469,
+    470,
+    471,
+    472,
+    473,
+    474,
+    475,
+    476,
+    477,
+    478,
+    479,
+    480,
+    481,
+    482,
+    215,
+    483,
+    484,
+    215,
+    485,
+    215,
+    486,
+    487,
+    215,
+    215,
+    215,
+    488,
+    489,
+    215,
+    490,
+    215,
+    491,
+    492,
+    215,
+    493,
+    494,
+    495,
+    496,
+    497,
+    215,
+    215,
+    498,
+    215,
+    499,
+    500,
+    215,
+    215,
+    501,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    502,
+    215,
+    215,
+    503,
+    215,
+    504,
+    505,
+    215,
+    215,
+    215,
+    506,
+    507,
+    508,
+    509,
+    510,
+    511,
+    215,
+    215,
+    215,
+    215,
+    215,
+    512,
+    215,
+    341,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    513,
+    514,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    515,
+    516,
+    517,
+    518,
+    519,
+    520,
+    521,
+    522,
+    523,
+    524,
+    524,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    526,
+    526,
+    526,
+    526,
+    524,
+    524,
+    524,
+    524,
+    524,
+    524,
+    524,
+    524,
+    524,
+    524,
+    525,
+    525,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    527,
+    528,
+    529,
+    530,
+    531,
+    532,
+    526,
+    526,
+    533,
+    534,
+    535,
+    536,
+    537,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    524,
+    526,
+    525,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    538,
+    539,
+    540,
+    541,
+    542,
+    543,
+    544,
+    545,
+    546,
+    547,
+    548,
+    549,
+    550,
+    543,
+    543,
+    551,
+    543,
+    552,
+    543,
+    553,
+    554,
+    555,
+    556,
+    556,
+    556,
+    556,
+    555,
+    557,
+    556,
+    556,
+    556,
+    556,
+    556,
+    558,
+    558,
+    559,
+    560,
+    561,
+    562,
+    563,
+    564,
+    556,
+    556,
+    556,
+    556,
+    565,
+    566,
+    556,
+    567,
+    568,
+    556,
+    556,
+    569,
+    569,
+    569,
+    569,
+    570,
+    556,
+    556,
+    556,
+    556,
+    543,
+    543,
+    543,
+    571,
+    572,
+    573,
+    574,
+    575,
+    576,
+    543,
+    556,
+    556,
+    556,
+    543,
+    543,
+    543,
+    556,
+    556,
+    577,
+    543,
+    543,
+    543,
+    556,
+    556,
+    556,
+    556,
+    543,
+    555,
+    556,
+    556,
+    543,
+    578,
+    579,
+    579,
+    578,
+    579,
+    579,
+    578,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    580,
+    581,
+    582,
+    583,
+    584,
+    526,
+    585,
+    586,
+    0,
+    0,
+    587,
+    588,
+    589,
+    590,
+    591,
+    592,
+    0,
+    0,
+    0,
+    0,
+    88,
+    593,
+    594,
+    595,
+    596,
+    597,
+    598,
+    0,
+    599,
+    0,
+    600,
+    601,
+    602,
+    603,
+    604,
+    605,
+    606,
+    607,
+    608,
+    609,
+    610,
+    611,
+    612,
+    613,
+    614,
+    615,
+    616,
+    617,
+    618,
+    619,
+    0,
+    620,
+    621,
+    622,
+    623,
+    624,
+    625,
+    626,
+    627,
+    628,
+    629,
+    630,
+    631,
+    632,
+    633,
+    634,
+    635,
+    636,
+    637,
+    638,
+    639,
+    640,
+    641,
+    642,
+    643,
+    644,
+    645,
+    646,
+    647,
+    648,
+    649,
+    650,
+    651,
+    652,
+    653,
+    654,
+    655,
+    656,
+    657,
+    658,
+    659,
+    660,
+    661,
+    662,
+    663,
+    664,
+    665,
+    666,
+    667,
+    668,
+    669,
+    670,
+    671,
+    672,
+    673,
+    674,
+    675,
+    676,
+    677,
+    678,
+    679,
+    680,
+    681,
+    682,
+    683,
+    684,
+    685,
+    686,
+    687,
+    688,
+    689,
+    690,
+    691,
+    692,
+    693,
+    694,
+    695,
+    696,
+    697,
+    698,
+    699,
+    700,
+    701,
+    702,
+    75,
+    703,
+    704,
+    705,
+    706,
+    707,
+    215,
+    708,
+    709,
+    710,
+    711,
+    712,
+    713,
+    714,
+    715,
+    716,
+    717,
+    718,
+    719,
+    720,
+    721,
+    722,
+    723,
+    724,
+    725,
+    726,
+    727,
+    728,
+    729,
+    730,
+    731,
+    732,
+    733,
+    734,
+    735,
+    736,
+    737,
+    738,
+    739,
+    740,
+    741,
+    742,
+    743,
+    744,
+    745,
+    746,
+    747,
+    748,
+    749,
+    750,
+    751,
+    752,
+    753,
+    754,
+    755,
+    756,
+    757,
+    758,
+    759,
+    760,
+    761,
+    762,
+    763,
+    764,
+    765,
+    766,
+    767,
+    768,
+    769,
+    770,
+    771,
+    772,
+    773,
+    774,
+    775,
+    776,
+    777,
+    778,
+    779,
+    780,
+    781,
+    782,
+    783,
+    784,
+    785,
+    786,
+    787,
+    788,
+    789,
+    790,
+    791,
+    792,
+    793,
+    794,
+    795,
+    796,
+    797,
+    798,
+    799,
+    800,
+    801,
+    802,
+    803,
+    804,
+    805,
+    806,
+    807,
+    808,
+    809,
+    810,
+    811,
+    812,
+    813,
+    814,
+    815,
+    816,
+    817,
+    818,
+    819,
+    820,
+    821,
+    822,
+    823,
+    824,
+    825,
+    826,
+    827,
+    828,
+    829,
+    830,
+    831,
+    832,
+    833,
+    834,
+    835,
+    836,
+    837,
+    838,
+    839,
+    840,
+    841,
+    543,
+    543,
+    543,
+    543,
+    543,
+    842,
+    842,
+    843,
+    844,
+    845,
+    846,
+    847,
+    848,
+    849,
+    850,
+    851,
+    852,
+    853,
+    854,
+    855,
+    856,
+    857,
+    858,
+    859,
+    860,
+    861,
+    862,
+    863,
+    864,
+    865,
+    866,
+    867,
+    868,
+    869,
+    870,
+    871,
+    872,
+    873,
+    874,
+    875,
+    876,
+    877,
+    878,
+    879,
+    880,
+    881,
+    882,
+    883,
+    884,
+    885,
+    886,
+    887,
+    888,
+    889,
+    890,
+    891,
+    892,
+    893,
+    894,
+    895,
+    896,
+    897,
+    898,
+    899,
+    900,
+    901,
+    902,
+    903,
+    904,
+    905,
+    906,
+    907,
+    908,
+    909,
+    910,
+    911,
+    912,
+    913,
+    914,
+    915,
+    916,
+    917,
+    918,
+    919,
+    920,
+    921,
+    922,
+    923,
+    924,
+    925,
+    926,
+    927,
+    928,
+    929,
+    930,
+    931,
+    932,
+    933,
+    934,
+    935,
+    936,
+    937,
+    938,
+    939,
+    940,
+    941,
+    942,
+    943,
+    944,
+    945,
+    946,
+    947,
+    948,
+    949,
+    950,
+    951,
+    952,
+    953,
+    954,
+    955,
+    956,
+    957,
+    958,
+    959,
+    960,
+    961,
+    962,
+    963,
+    964,
+    965,
+    966,
+    967,
+    968,
+    969,
+    970,
+    971,
+    972,
+    973,
+    974,
+    975,
+    976,
+    977,
+    978,
+    979,
+    980,
+    981,
+    982,
+    983,
+    984,
+    985,
+    986,
+    987,
+    988,
+    989,
+    990,
+    991,
+    992,
+    993,
+    994,
+    995,
+    996,
+    997,
+    998,
+    999,
+    1000,
+    1001,
+    1002,
+    1003,
+    1004,
+    1005,
+    1006,
+    1007,
+    1008,
+    0,
+    1009,
+    1010,
+    1011,
+    1012,
+    1013,
+    1014,
+    1015,
+    1016,
+    1017,
+    1018,
+    1019,
+    1020,
+    1021,
+    1022,
+    1023,
+    1024,
+    1025,
+    1026,
+    1027,
+    1028,
+    1029,
+    1030,
+    1031,
+    1032,
+    1033,
+    1034,
+    1035,
+    1036,
+    1037,
+    1038,
+    1039,
+    1040,
+    1041,
+    1042,
+    1043,
+    1044,
+    1045,
+    1046,
+    0,
+    0,
+    525,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    215,
+    1048,
+    1049,
+    1050,
+    1051,
+    1052,
+    1053,
+    1054,
+    1055,
+    1056,
+    1057,
+    1058,
+    1059,
+    1060,
+    1061,
+    1062,
+    1063,
+    1064,
+    1065,
+    1066,
+    1067,
+    1068,
+    1069,
+    1070,
+    1071,
+    1072,
+    1073,
+    1074,
+    1075,
+    1076,
+    1077,
+    1078,
+    1079,
+    1080,
+    1081,
+    1082,
+    1083,
+    1084,
+    1085,
+    1086,
+    215,
+    1047,
+    1087,
+    0,
+    0,
+    77,
+    77,
+    11,
+    0,
+    556,
+    543,
+    543,
+    543,
+    543,
+    556,
+    543,
+    543,
+    543,
+    1088,
+    556,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    556,
+    556,
+    556,
+    556,
+    556,
+    556,
+    543,
+    543,
+    556,
+    543,
+    543,
+    1088,
+    1089,
+    543,
+    1090,
+    1091,
+    1092,
+    1093,
+    1094,
+    1095,
+    1096,
+    1097,
+    1098,
+    1099,
+    1099,
+    1100,
+    1101,
+    1102,
+    1103,
+    1104,
+    1105,
+    1106,
+    1107,
+    1105,
+    543,
+    556,
+    1105,
+    1098,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1105,
+    1105,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1109,
+    1109,
+    1109,
+    1109,
+    1109,
+    1109,
+    75,
+    75,
+    1110,
+    10,
+    10,
+    1111,
+    15,
+    1112,
+    77,
+    77,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    1113,
+    1114,
+    1115,
+    1112,
+    1116,
+    0,
+    1112,
+    1112,
+    1117,
+    1117,
+    1118,
+    1119,
+    1120,
+    1121,
+    1122,
+    1123,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1124,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1125,
+    1117,
+    1126,
+    1127,
+    1128,
+    1129,
+    1113,
+    1114,
+    1115,
+    1130,
+    1131,
+    1132,
+    1133,
+    1134,
+    556,
+    543,
+    543,
+    543,
+    543,
+    543,
+    556,
+    543,
+    543,
+    556,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    10,
+    1136,
+    1136,
+    1112,
+    1117,
+    1117,
+    1137,
+    1117,
+    1117,
+    1117,
+    1117,
+    1138,
+    1139,
+    1140,
+    1141,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1142,
+    1143,
+    1144,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1145,
+    1146,
+    1112,
+    1147,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    1109,
+    77,
+    543,
+    543,
+    543,
+    543,
+    556,
+    543,
+    1124,
+    1124,
+    543,
+    543,
+    77,
+    556,
+    543,
+    543,
+    556,
+    1117,
+    1117,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    17,
+    1117,
+    1117,
+    1117,
+    1148,
+    1148,
+    1117,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    0,
+    1149,
+    1117,
+    1150,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    543,
+    556,
+    543,
+    543,
+    556,
+    543,
+    543,
+    556,
+    556,
+    556,
+    543,
+    556,
+    556,
+    543,
+    556,
+    543,
+    543,
+    543,
+    556,
+    543,
+    556,
+    543,
+    556,
+    543,
+    556,
+    543,
+    543,
+    0,
+    0,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1117,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    556,
+    543,
+    1153,
+    1153,
+    77,
+    9,
+    9,
+    9,
+    1153,
+    0,
+    0,
+    556,
+    1154,
+    1154,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    543,
+    543,
+    543,
+    543,
+    1153,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    1153,
+    543,
+    543,
+    543,
+    1153,
+    543,
+    543,
+    543,
+    543,
+    543,
+    0,
+    0,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    556,
+    556,
+    556,
+    0,
+    0,
+    1105,
+    0,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    0,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    556,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    1109,
+    556,
+    543,
+    543,
+    556,
+    543,
+    543,
+    556,
+    543,
+    543,
+    543,
+    556,
+    556,
+    556,
+    1127,
+    1128,
+    1129,
+    543,
+    543,
+    543,
+    556,
+    543,
+    543,
+    556,
+    556,
+    543,
+    543,
+    543,
+    543,
+    543,
+    1151,
+    1151,
+    1151,
+    1155,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1156,
+    1157,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1158,
+    1159,
+    341,
+    1160,
+    1161,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1155,
+    1162,
+    341,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1155,
+    1155,
+    1163,
+    1155,
+    1155,
+    341,
+    543,
+    556,
+    543,
+    543,
+    1151,
+    1151,
+    1151,
+    1164,
+    1165,
+    1166,
+    1167,
+    1168,
+    1169,
+    1170,
+    1171,
+    341,
+    341,
+    1151,
+    1151,
+    1047,
+    1047,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1047,
+    525,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1155,
+    1155,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    1173,
+    341,
+    1174,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    0,
+    1175,
+    1155,
+    0,
+    0,
+    1176,
+    1177,
+    1163,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1178,
+    0,
+    0,
+    0,
+    0,
+    1179,
+    1180,
+    0,
+    1181,
+    341,
+    341,
+    1151,
+    1151,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    341,
+    341,
+    11,
+    11,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    841,
+    11,
+    341,
+    1047,
+    543,
+    0,
+    0,
+    1151,
+    1151,
+    1155,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    1183,
+    0,
+    341,
+    1184,
+    0,
+    341,
+    341,
+    0,
+    0,
+    1173,
+    0,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    0,
+    0,
+    1151,
+    1151,
+    1163,
+    0,
+    0,
+    0,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1185,
+    1186,
+    1187,
+    341,
+    0,
+    1188,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1151,
+    1151,
+    341,
+    341,
+    341,
+    1151,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    1155,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    1173,
+    341,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    1151,
+    1151,
+    1155,
+    0,
+    1155,
+    1155,
+    1163,
+    0,
+    0,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    1151,
+    1151,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1047,
+    11,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    1151,
+    1155,
+    1155,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    1173,
+    341,
+    1189,
+    1151,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    0,
+    1190,
+    1191,
+    0,
+    0,
+    1192,
+    1193,
+    1163,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1194,
+    1195,
+    0,
+    0,
+    0,
+    0,
+    1196,
+    1197,
+    0,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    841,
+    341,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    0,
+    1198,
+    341,
+    1199,
+    341,
+    0,
+    0,
+    0,
+    341,
+    341,
+    0,
+    341,
+    0,
+    341,
+    341,
+    0,
+    0,
+    0,
+    341,
+    341,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    1200,
+    1155,
+    1151,
+    1155,
+    1155,
+    0,
+    0,
+    0,
+    1201,
+    1202,
+    1155,
+    0,
+    1203,
+    1204,
+    1205,
+    1163,
+    0,
+    0,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1206,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1182,
+    1182,
+    1182,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    11,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    1155,
+    1155,
+    1155,
+    1151,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    341,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1155,
+    1155,
+    0,
+    1207,
+    1151,
+    1208,
+    0,
+    1151,
+    1151,
+    1151,
+    1163,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1209,
+    1210,
+    0,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    1151,
+    1151,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    841,
+    341,
+    1151,
+    1155,
+    1155,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    1173,
+    341,
+    1155,
+    1212,
+    1213,
+    1155,
+    1214,
+    1155,
+    1155,
+    0,
+    1215,
+    1216,
+    1217,
+    0,
+    1218,
+    1219,
+    1151,
+    1163,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1220,
+    1221,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    0,
+    341,
+    341,
+    1151,
+    1151,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    1155,
+    1155,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1163,
+    1163,
+    341,
+    1222,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    1223,
+    1224,
+    1155,
+    0,
+    1225,
+    1226,
+    1227,
+    1163,
+    1228,
+    841,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    1229,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    841,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    1155,
+    1155,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    1230,
+    0,
+    0,
+    0,
+    0,
+    1231,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    0,
+    1151,
+    0,
+    1155,
+    1232,
+    1233,
+    1155,
+    1234,
+    1235,
+    1236,
+    1237,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    1155,
+    1155,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    341,
+    1238,
+    1151,
+    1151,
+    1151,
+    1151,
+    1239,
+    1239,
+    1163,
+    0,
+    0,
+    0,
+    0,
+    11,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    525,
+    1151,
+    1240,
+    1240,
+    1240,
+    1240,
+    1151,
+    1151,
+    1151,
+    1047,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    0,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    341,
+    1241,
+    1151,
+    1151,
+    1151,
+    1151,
+    1242,
+    1242,
+    1163,
+    1151,
+    1151,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    525,
+    0,
+    1243,
+    1243,
+    1243,
+    1243,
+    1151,
+    1151,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    1244,
+    1245,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    841,
+    841,
+    841,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1246,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    841,
+    1047,
+    841,
+    841,
+    841,
+    556,
+    556,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    841,
+    556,
+    841,
+    556,
+    841,
+    1247,
+    12,
+    13,
+    12,
+    13,
+    1155,
+    1155,
+    341,
+    341,
+    341,
+    1248,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    1249,
+    341,
+    341,
+    341,
+    341,
+    1250,
+    341,
+    341,
+    341,
+    341,
+    1251,
+    341,
+    341,
+    341,
+    341,
+    1252,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1253,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    1254,
+    1255,
+    1256,
+    1257,
+    1258,
+    1259,
+    1260,
+    1261,
+    1262,
+    1255,
+    1255,
+    1255,
+    1255,
+    1151,
+    1155,
+    1255,
+    1263,
+    543,
+    543,
+    1163,
+    1047,
+    543,
+    543,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1264,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    1151,
+    1151,
+    1151,
+    1151,
+    1265,
+    1151,
+    1151,
+    1151,
+    1151,
+    1266,
+    1151,
+    1151,
+    1151,
+    1151,
+    1267,
+    1151,
+    1151,
+    1151,
+    1151,
+    1268,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1269,
+    1151,
+    1151,
+    1151,
+    0,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    556,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    0,
+    841,
+    841,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    841,
+    841,
+    841,
+    841,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1270,
+    1271,
+    341,
+    341,
+    341,
+    341,
+    1272,
+    1272,
+    1151,
+    1273,
+    1151,
+    1151,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1173,
+    1272,
+    1163,
+    1163,
+    1155,
+    1155,
+    1151,
+    1151,
+    341,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1151,
+    1151,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1151,
+    341,
+    1272,
+    1272,
+    1272,
+    341,
+    341,
+    1272,
+    1272,
+    1272,
+    1272,
+    1272,
+    1272,
+    1272,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1272,
+    1155,
+    1151,
+    1151,
+    1272,
+    1272,
+    1272,
+    1272,
+    1272,
+    1272,
+    556,
+    341,
+    1272,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1272,
+    1272,
+    1272,
+    1151,
+    841,
+    841,
+    1274,
+    1275,
+    1276,
+    1277,
+    1278,
+    1279,
+    1280,
+    1281,
+    1282,
+    1283,
+    1284,
+    1285,
+    1286,
+    1287,
+    1288,
+    1289,
+    1290,
+    1291,
+    1292,
+    1293,
+    1294,
+    1295,
+    1296,
+    1297,
+    1298,
+    1299,
+    1300,
+    1301,
+    1302,
+    1303,
+    1304,
+    1305,
+    1306,
+    1307,
+    1308,
+    1309,
+    1310,
+    1311,
+    0,
+    1312,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1313,
+    0,
+    0,
+    1314,
+    1315,
+    1316,
+    1317,
+    1318,
+    1319,
+    1320,
+    1321,
+    1322,
+    1323,
+    1324,
+    1325,
+    1326,
+    1327,
+    1328,
+    1329,
+    1330,
+    1331,
+    1332,
+    1333,
+    1334,
+    1335,
+    1336,
+    1337,
+    1338,
+    1339,
+    1340,
+    1341,
+    1342,
+    1343,
+    1344,
+    1345,
+    1346,
+    1347,
+    1348,
+    1349,
+    1350,
+    1351,
+    1352,
+    1353,
+    1354,
+    1355,
+    1356,
+    1047,
+    1357,
+    1358,
+    1359,
+    1360,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1362,
+    1363,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    543,
+    543,
+    543,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1366,
+    1367,
+    1368,
+    1369,
+    1370,
+    1371,
+    1372,
+    1373,
+    1374,
+    1375,
+    1376,
+    1377,
+    1378,
+    1379,
+    1380,
+    1381,
+    1382,
+    1383,
+    1384,
+    1385,
+    1386,
+    1387,
+    1388,
+    1389,
+    1390,
+    1391,
+    1392,
+    1393,
+    1394,
+    1395,
+    1396,
+    1397,
+    1398,
+    1399,
+    1400,
+    1401,
+    1402,
+    1403,
+    1404,
+    1405,
+    1406,
+    1407,
+    1408,
+    1409,
+    1410,
+    1411,
+    1412,
+    1413,
+    1414,
+    1415,
+    1416,
+    1417,
+    1418,
+    1419,
+    1420,
+    1421,
+    1422,
+    1423,
+    1424,
+    1425,
+    1426,
+    1427,
+    1428,
+    1429,
+    1430,
+    1431,
+    1432,
+    1433,
+    1434,
+    1435,
+    1436,
+    1437,
+    1438,
+    1439,
+    1440,
+    1441,
+    1442,
+    1443,
+    1444,
+    1445,
+    1446,
+    1447,
+    1448,
+    1449,
+    1450,
+    1451,
+    0,
+    0,
+    1452,
+    1453,
+    1454,
+    1455,
+    1456,
+    1457,
+    0,
+    0,
+    1087,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    841,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    8,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    12,
+    13,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1047,
+    1047,
+    1047,
+    1458,
+    1458,
+    1458,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1163,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1163,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    0,
+    1151,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    577,
+    577,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1151,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1163,
+    1151,
+    1047,
+    1047,
+    1047,
+    525,
+    1047,
+    1047,
+    1047,
+    11,
+    341,
+    543,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    1087,
+    9,
+    9,
+    9,
+    9,
+    577,
+    577,
+    577,
+    1459,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    525,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1089,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1155,
+    1155,
+    1155,
+    0,
+    0,
+    0,
+    0,
+    1155,
+    1155,
+    1151,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1088,
+    543,
+    556,
+    0,
+    0,
+    0,
+    0,
+    77,
+    0,
+    0,
+    0,
+    9,
+    9,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1182,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    543,
+    556,
+    1155,
+    1155,
+    1151,
+    0,
+    0,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1151,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    1163,
+    1272,
+    1151,
+    1272,
+    1272,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    0,
+    0,
+    556,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    525,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    556,
+    556,
+    556,
+    556,
+    556,
+    556,
+    543,
+    543,
+    556,
+    842,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1460,
+    1461,
+    1462,
+    1463,
+    1464,
+    1465,
+    1466,
+    1467,
+    1468,
+    1469,
+    341,
+    341,
+    1470,
+    1471,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1173,
+    1472,
+    1151,
+    1151,
+    1151,
+    1151,
+    1473,
+    1474,
+    1475,
+    1476,
+    1477,
+    1478,
+    1479,
+    1480,
+    1481,
+    1482,
+    1483,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    543,
+    556,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    1155,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1151,
+    1151,
+    1483,
+    1163,
+    1151,
+    1151,
+    341,
+    341,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1173,
+    1155,
+    1151,
+    1151,
+    1155,
+    1155,
+    1155,
+    1151,
+    1155,
+    1151,
+    1151,
+    1151,
+    1483,
+    1483,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    1047,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1151,
+    1173,
+    0,
+    0,
+    0,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    1047,
+    1047,
+    1484,
+    1485,
+    1486,
+    1487,
+    1488,
+    1488,
+    1489,
+    1490,
+    1491,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1492,
+    1493,
+    1494,
+    1495,
+    1496,
+    1497,
+    1498,
+    1499,
+    1500,
+    1501,
+    1502,
+    1503,
+    1504,
+    1505,
+    1506,
+    1507,
+    1508,
+    1509,
+    1510,
+    1511,
+    1512,
+    1513,
+    1514,
+    1515,
+    1516,
+    1517,
+    1518,
+    1519,
+    1520,
+    1521,
+    1522,
+    1523,
+    1524,
+    1525,
+    1526,
+    1527,
+    1528,
+    1529,
+    1530,
+    1531,
+    1532,
+    1533,
+    1534,
+    0,
+    0,
+    1535,
+    1536,
+    1537,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    543,
+    543,
+    543,
+    1047,
+    569,
+    556,
+    556,
+    556,
+    556,
+    556,
+    543,
+    543,
+    556,
+    556,
+    556,
+    556,
+    543,
+    1155,
+    569,
+    569,
+    569,
+    569,
+    569,
+    569,
+    569,
+    341,
+    341,
+    341,
+    341,
+    556,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    543,
+    341,
+    341,
+    1155,
+    543,
+    543,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    1538,
+    1539,
+    1540,
+    525,
+    1541,
+    1542,
+    1543,
+    1544,
+    1545,
+    1546,
+    1547,
+    1548,
+    1549,
+    1550,
+    1551,
+    525,
+    1552,
+    1553,
+    1554,
+    1555,
+    1556,
+    1557,
+    1558,
+    1559,
+    1560,
+    1561,
+    1562,
+    1563,
+    1564,
+    1565,
+    1566,
+    1567,
+    1568,
+    1569,
+    525,
+    1570,
+    1571,
+    1572,
+    1573,
+    1574,
+    1575,
+    1576,
+    1577,
+    1578,
+    1579,
+    1580,
+    1581,
+    1582,
+    1583,
+    1584,
+    1585,
+    1586,
+    1587,
+    1588,
+    1589,
+    1590,
+    1591,
+    1592,
+    1593,
+    1594,
+    1595,
+    1596,
+    1597,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    1598,
+    1599,
+    215,
+    215,
+    215,
+    1600,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    1601,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    1602,
+    1603,
+    1604,
+    1605,
+    1568,
+    1606,
+    1607,
+    1608,
+    1609,
+    1610,
+    1611,
+    1612,
+    1613,
+    1614,
+    1615,
+    1616,
+    1617,
+    1618,
+    1619,
+    1620,
+    1621,
+    1622,
+    1623,
+    1624,
+    1625,
+    1626,
+    1627,
+    1628,
+    1629,
+    1630,
+    1631,
+    1632,
+    1633,
+    1634,
+    1635,
+    1636,
+    1637,
+    543,
+    543,
+    556,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    556,
+    543,
+    543,
+    579,
+    1638,
+    556,
+    558,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    555,
+    1089,
+    1089,
+    556,
+    0,
+    543,
+    578,
+    556,
+    543,
+    556,
+    1639,
+    1640,
+    1641,
+    1642,
+    1643,
+    1644,
+    1645,
+    1646,
+    1647,
+    1648,
+    1649,
+    1650,
+    1651,
+    1652,
+    1653,
+    1654,
+    1655,
+    1656,
+    1657,
+    1658,
+    1659,
+    1660,
+    1661,
+    1662,
+    1663,
+    1664,
+    1665,
+    1666,
+    1667,
+    1668,
+    1669,
+    1670,
+    1671,
+    1672,
+    1673,
+    1674,
+    1675,
+    1676,
+    1677,
+    1678,
+    1679,
+    1680,
+    1681,
+    1682,
+    1683,
+    1684,
+    1685,
+    1686,
+    1687,
+    1688,
+    1689,
+    1690,
+    1691,
+    1692,
+    1693,
+    1694,
+    1695,
+    1696,
+    1697,
+    1698,
+    1699,
+    1700,
+    1701,
+    1702,
+    1703,
+    1704,
+    1705,
+    1706,
+    1707,
+    1708,
+    1709,
+    1710,
+    1711,
+    1712,
+    1713,
+    1714,
+    1715,
+    1716,
+    1717,
+    1718,
+    1719,
+    1720,
+    1721,
+    1722,
+    1723,
+    1724,
+    1725,
+    1726,
+    1727,
+    1728,
+    1729,
+    1730,
+    1731,
+    1732,
+    1733,
+    1734,
+    1735,
+    1736,
+    1737,
+    1738,
+    1739,
+    1740,
+    1741,
+    1742,
+    1743,
+    1744,
+    1745,
+    1746,
+    1747,
+    1748,
+    1749,
+    1750,
+    1751,
+    1752,
+    1753,
+    1754,
+    1755,
+    1756,
+    1757,
+    1758,
+    1759,
+    1760,
+    1761,
+    1762,
+    1763,
+    1764,
+    1765,
+    1766,
+    1767,
+    1768,
+    1769,
+    1770,
+    1771,
+    1772,
+    1773,
+    1774,
+    1775,
+    1776,
+    1777,
+    1778,
+    1779,
+    1780,
+    1781,
+    1782,
+    1783,
+    1784,
+    1785,
+    1786,
+    1787,
+    1788,
+    1789,
+    1790,
+    1791,
+    1792,
+    1793,
+    1794,
+    215,
+    215,
+    1795,
+    215,
+    1796,
+    1797,
+    1798,
+    1799,
+    1800,
+    1801,
+    1802,
+    1803,
+    1804,
+    1805,
+    1806,
+    1807,
+    1808,
+    1809,
+    1810,
+    1811,
+    1812,
+    1813,
+    1814,
+    1815,
+    1816,
+    1817,
+    1818,
+    1819,
+    1820,
+    1821,
+    1822,
+    1823,
+    1824,
+    1825,
+    1826,
+    1827,
+    1828,
+    1829,
+    1830,
+    1831,
+    1832,
+    1833,
+    1834,
+    1835,
+    1836,
+    1837,
+    1838,
+    1839,
+    1840,
+    1841,
+    1842,
+    1843,
+    1844,
+    1845,
+    1846,
+    1847,
+    1848,
+    1849,
+    1850,
+    1851,
+    1852,
+    1853,
+    1854,
+    1855,
+    1856,
+    1857,
+    1858,
+    1859,
+    1860,
+    1861,
+    1862,
+    1863,
+    1864,
+    1865,
+    1866,
+    1867,
+    1868,
+    1869,
+    1870,
+    1871,
+    1872,
+    1873,
+    1874,
+    1875,
+    1876,
+    1877,
+    1878,
+    1879,
+    1880,
+    1881,
+    1882,
+    1883,
+    1884,
+    1885,
+    1886,
+    1887,
+    1888,
+    1889,
+    1890,
+    1891,
+    1892,
+    1893,
+    1894,
+    1895,
+    1896,
+    1897,
+    1898,
+    1899,
+    1900,
+    1901,
+    1902,
+    1903,
+    1904,
+    1905,
+    1906,
+    1907,
+    1908,
+    1909,
+    1910,
+    1911,
+    1912,
+    1913,
+    0,
+    0,
+    1914,
+    1915,
+    1916,
+    1917,
+    1918,
+    1919,
+    0,
+    0,
+    1920,
+    1921,
+    1922,
+    1923,
+    1924,
+    1925,
+    1926,
+    1927,
+    1928,
+    1929,
+    1930,
+    1931,
+    1932,
+    1933,
+    1934,
+    1935,
+    1936,
+    1937,
+    1938,
+    1939,
+    1940,
+    1941,
+    1942,
+    1943,
+    1944,
+    1945,
+    1946,
+    1947,
+    1948,
+    1949,
+    1950,
+    1951,
+    1952,
+    1953,
+    1954,
+    1955,
+    1956,
+    1957,
+    0,
+    0,
+    1958,
+    1959,
+    1960,
+    1961,
+    1962,
+    1963,
+    0,
+    0,
+    1964,
+    1965,
+    1966,
+    1967,
+    1968,
+    1969,
+    1970,
+    1971,
+    0,
+    1972,
+    0,
+    1973,
+    0,
+    1974,
+    0,
+    1975,
+    1976,
+    1977,
+    1978,
+    1979,
+    1980,
+    1981,
+    1982,
+    1983,
+    1984,
+    1985,
+    1986,
+    1987,
+    1988,
+    1989,
+    1990,
+    1991,
+    1992,
+    1993,
+    1994,
+    1995,
+    1996,
+    1997,
+    1998,
+    1999,
+    2000,
+    2001,
+    2002,
+    2003,
+    2004,
+    2005,
+    0,
+    0,
+    2006,
+    2007,
+    2008,
+    2009,
+    2010,
+    2011,
+    2012,
+    2013,
+    2014,
+    2015,
+    2016,
+    2017,
+    2018,
+    2019,
+    2020,
+    2021,
+    2022,
+    2023,
+    2024,
+    2025,
+    2026,
+    2027,
+    2028,
+    2029,
+    2030,
+    2031,
+    2032,
+    2033,
+    2034,
+    2035,
+    2036,
+    2037,
+    2038,
+    2039,
+    2040,
+    2041,
+    2042,
+    2043,
+    2044,
+    2045,
+    2046,
+    2047,
+    2048,
+    2049,
+    2050,
+    2051,
+    2052,
+    2053,
+    2054,
+    2055,
+    2056,
+    2057,
+    2058,
+    0,
+    2059,
+    2060,
+    2061,
+    2062,
+    2063,
+    2064,
+    2065,
+    2066,
+    2067,
+    2068,
+    2069,
+    2070,
+    2071,
+    2072,
+    2073,
+    0,
+    2074,
+    2075,
+    2076,
+    2077,
+    2078,
+    2079,
+    2080,
+    2081,
+    2082,
+    2083,
+    2084,
+    2085,
+    2086,
+    2087,
+    0,
+    0,
+    2088,
+    2089,
+    2090,
+    2091,
+    2092,
+    2093,
+    0,
+    2094,
+    2095,
+    2096,
+    2097,
+    2098,
+    2099,
+    2100,
+    2101,
+    2102,
+    2103,
+    2104,
+    2105,
+    2106,
+    2107,
+    2108,
+    2109,
+    2110,
+    2111,
+    2112,
+    0,
+    0,
+    2113,
+    2114,
+    2115,
+    0,
+    2116,
+    2117,
+    2118,
+    2119,
+    2120,
+    2121,
+    2122,
+    2123,
+    2124,
+    0,
+    2125,
+    2126,
+    2127,
+    2127,
+    2127,
+    2127,
+    2127,
+    2128,
+    2127,
+    2127,
+    2127,
+    1459,
+    2129,
+    2130,
+    2131,
+    2132,
+    1087,
+    2133,
+    1087,
+    1087,
+    1087,
+    1087,
+    9,
+    2134,
+    2135,
+    2136,
+    2137,
+    2135,
+    2135,
+    2136,
+    2137,
+    2135,
+    9,
+    9,
+    9,
+    9,
+    2138,
+    2139,
+    2140,
+    9,
+    2141,
+    2142,
+    2143,
+    2144,
+    2145,
+    2146,
+    2147,
+    76,
+    10,
+    10,
+    10,
+    2148,
+    2149,
+    9,
+    2150,
+    2151,
+    9,
+    81,
+    93,
+    9,
+    2152,
+    9,
+    2153,
+    48,
+    48,
+    9,
+    9,
+    9,
+    2154,
+    12,
+    13,
+    2155,
+    2156,
+    2157,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    75,
+    9,
+    48,
+    9,
+    9,
+    2158,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    2127,
+    1459,
+    1459,
+    1459,
+    1459,
+    1459,
+    0,
+    2159,
+    2160,
+    2161,
+    2162,
+    1459,
+    1459,
+    1459,
+    1459,
+    1459,
+    1459,
+    2163,
+    2164,
+    0,
+    0,
+    2165,
+    2166,
+    2167,
+    2168,
+    2169,
+    2170,
+    2171,
+    2172,
+    2173,
+    2174,
+    2175,
+    2176,
+    2177,
+    2178,
+    2179,
+    2180,
+    2181,
+    2182,
+    2183,
+    2184,
+    2185,
+    2186,
+    2187,
+    2188,
+    2189,
+    2190,
+    2191,
+    0,
+    2192,
+    2193,
+    2194,
+    2195,
+    2196,
+    2197,
+    2198,
+    2199,
+    2200,
+    2201,
+    2202,
+    2203,
+    2204,
+    0,
+    0,
+    0,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    2205,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    11,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    543,
+    543,
+    569,
+    569,
+    543,
+    543,
+    543,
+    543,
+    569,
+    569,
+    569,
+    543,
+    543,
+    842,
+    842,
+    842,
+    842,
+    543,
+    842,
+    842,
+    842,
+    569,
+    569,
+    543,
+    556,
+    543,
+    569,
+    569,
+    556,
+    556,
+    556,
+    556,
+    543,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2206,
+    2207,
+    2208,
+    2209,
+    77,
+    2210,
+    2211,
+    2212,
+    77,
+    2213,
+    2214,
+    2215,
+    2215,
+    2215,
+    2216,
+    2217,
+    2218,
+    2218,
+    2219,
+    2220,
+    77,
+    2221,
+    2222,
+    77,
+    75,
+    2223,
+    2224,
+    2225,
+    2225,
+    2225,
+    77,
+    77,
+    2226,
+    2227,
+    2228,
+    77,
+    2229,
+    77,
+    2230,
+    77,
+    2229,
+    77,
+    2231,
+    2232,
+    2233,
+    2208,
+    84,
+    2234,
+    2235,
+    2236,
+    2237,
+    2238,
+    2239,
+    2240,
+    2241,
+    2242,
+    2243,
+    2244,
+    77,
+    2245,
+    2246,
+    2247,
+    2248,
+    2249,
+    2250,
+    75,
+    75,
+    75,
+    75,
+    2251,
+    2252,
+    2234,
+    2253,
+    2254,
+    77,
+    75,
+    77,
+    77,
+    2255,
+    841,
+    2256,
+    2257,
+    2258,
+    2259,
+    2260,
+    2261,
+    2262,
+    2263,
+    2264,
+    2265,
+    2266,
+    2267,
+    2268,
+    2269,
+    2270,
+    2271,
+    2272,
+    2273,
+    2274,
+    2275,
+    2276,
+    2277,
+    2278,
+    2279,
+    2280,
+    2281,
+    2282,
+    2283,
+    2284,
+    2285,
+    2286,
+    2287,
+    2288,
+    2289,
+    2290,
+    2291,
+    2292,
+    2293,
+    2294,
+    2295,
+    2296,
+    2297,
+    2298,
+    2299,
+    2300,
+    2301,
+    2302,
+    2303,
+    1458,
+    1458,
+    1458,
+    2304,
+    2305,
+    1458,
+    1458,
+    1458,
+    1458,
+    2306,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    2307,
+    75,
+    2308,
+    75,
+    2309,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2310,
+    2311,
+    77,
+    77,
+    77,
+    77,
+    75,
+    77,
+    77,
+    75,
+    77,
+    77,
+    75,
+    77,
+    77,
+    79,
+    79,
+    77,
+    77,
+    77,
+    2312,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2313,
+    2314,
+    2315,
+    2316,
+    77,
+    2317,
+    77,
+    2318,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2320,
+    2321,
+    75,
+    75,
+    75,
+    2322,
+    2323,
+    2319,
+    2324,
+    2325,
+    2319,
+    75,
+    75,
+    75,
+    2319,
+    14,
+    85,
+    75,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2326,
+    2327,
+    2328,
+    2329,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2330,
+    2331,
+    2319,
+    2332,
+    2333,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    75,
+    2319,
+    2334,
+    2319,
+    2319,
+    2319,
+    2319,
+    2335,
+    2319,
+    2336,
+    2337,
+    2338,
+    2319,
+    2339,
+    2340,
+    2341,
+    2319,
+    2319,
+    2319,
+    2342,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2343,
+    2344,
+    2345,
+    75,
+    2346,
+    2347,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    2348,
+    2349,
+    2350,
+    2351,
+    2352,
+    2353,
+    2354,
+    2355,
+    2356,
+    2357,
+    2358,
+    2359,
+    2360,
+    2361,
+    2362,
+    2363,
+    2364,
+    2319,
+    2319,
+    2365,
+    2366,
+    2367,
+    2368,
+    2369,
+    2370,
+    2371,
+    2372,
+    2373,
+    2374,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    2319,
+    2319,
+    2375,
+    2376,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2377,
+    2319,
+    75,
+    75,
+    2319,
+    2319,
+    2378,
+    2379,
+    2319,
+    2380,
+    2381,
+    2382,
+    2383,
+    2384,
+    2319,
+    2319,
+    2385,
+    2386,
+    2387,
+    2388,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2389,
+    2390,
+    2391,
+    2392,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2393,
+    2394,
+    2395,
+    2396,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    12,
+    13,
+    12,
+    13,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    2319,
+    2319,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    2398,
+    2399,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    77,
+    75,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    841,
+    77,
+    77,
+    77,
+    77,
+    77,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    79,
+    79,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2400,
+    2401,
+    2402,
+    2403,
+    2404,
+    2405,
+    2406,
+    2407,
+    2408,
+    2409,
+    2410,
+    2411,
+    2412,
+    2413,
+    2414,
+    2415,
+    2416,
+    2417,
+    2418,
+    2419,
+    2420,
+    2421,
+    2422,
+    2423,
+    2424,
+    2425,
+    2426,
+    2427,
+    2428,
+    2429,
+    2430,
+    2431,
+    2432,
+    2433,
+    2434,
+    2435,
+    2436,
+    2437,
+    2438,
+    2439,
+    2440,
+    2441,
+    2442,
+    2443,
+    2444,
+    2445,
+    2446,
+    2447,
+    2448,
+    2449,
+    2450,
+    2451,
+    2452,
+    2453,
+    2454,
+    2455,
+    2456,
+    2457,
+    2458,
+    2459,
+    2460,
+    2461,
+    2462,
+    2463,
+    2464,
+    2465,
+    2466,
+    2467,
+    2468,
+    2469,
+    2470,
+    2471,
+    2472,
+    2473,
+    2474,
+    2475,
+    2476,
+    2477,
+    2478,
+    2479,
+    2480,
+    2481,
+    2482,
+    2483,
+    2484,
+    2485,
+    2486,
+    2487,
+    2488,
+    2489,
+    2490,
+    2491,
+    2492,
+    2493,
+    2494,
+    2495,
+    2496,
+    2497,
+    2498,
+    2499,
+    2500,
+    2501,
+    2502,
+    2503,
+    2504,
+    2505,
+    2506,
+    2507,
+    2508,
+    2509,
+    2510,
+    2511,
+    2512,
+    2513,
+    2514,
+    2515,
+    2516,
+    2517,
+    2518,
+    2519,
+    2520,
+    2521,
+    2522,
+    2523,
+    2524,
+    2525,
+    2526,
+    2527,
+    2528,
+    2529,
+    2530,
+    2531,
+    2532,
+    2533,
+    2534,
+    2535,
+    2536,
+    2537,
+    2538,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    75,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    75,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    75,
+    75,
+    75,
+    2539,
+    2539,
+    2540,
+    2540,
+    75,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    77,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    77,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2539,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2541,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    77,
+    77,
+    79,
+    79,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    77,
+    79,
+    77,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    77,
+    77,
+    77,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    77,
+    77,
+    79,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    77,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    2397,
+    2397,
+    77,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    79,
+    79,
+    79,
+    79,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    77,
+    2397,
+    2397,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    2319,
+    75,
+    75,
+    2319,
+    2319,
+    12,
+    13,
+    75,
+    2319,
+    2319,
+    75,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2539,
+    2539,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    2319,
+    2319,
+    75,
+    75,
+    12,
+    13,
+    12,
+    13,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    75,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    12,
+    13,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2542,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    2319,
+    75,
+    2319,
+    75,
+    75,
+    2319,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    2319,
+    2319,
+    75,
+    75,
+    2319,
+    2543,
+    2544,
+    2545,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2546,
+    2547,
+    2319,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    75,
+    75,
+    75,
+    75,
+    2319,
+    75,
+    75,
+    75,
+    2319,
+    2319,
+    2319,
+    2319,
+    2319,
+    75,
+    2319,
+    75,
+    75,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    79,
+    79,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    77,
+    77,
+    75,
+    75,
+    75,
+    75,
+    75,
+    75,
+    77,
+    77,
+    77,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2548,
+    77,
+    2549,
+    2550,
+    2551,
+    2552,
+    2553,
+    2554,
+    2555,
+    2556,
+    2557,
+    2558,
+    2559,
+    2560,
+    2561,
+    2562,
+    2563,
+    2564,
+    2565,
+    2566,
+    2567,
+    2568,
+    2569,
+    2570,
+    2571,
+    2572,
+    2573,
+    2574,
+    2575,
+    2576,
+    2577,
+    2578,
+    2579,
+    2580,
+    2581,
+    2582,
+    2583,
+    2584,
+    2585,
+    2586,
+    2587,
+    2588,
+    2589,
+    2590,
+    2591,
+    2592,
+    2593,
+    2594,
+    2595,
+    0,
+    2596,
+    2597,
+    2598,
+    2599,
+    2600,
+    2601,
+    2602,
+    2603,
+    2604,
+    2605,
+    2606,
+    2607,
+    2608,
+    2609,
+    2610,
+    2611,
+    2612,
+    2613,
+    2614,
+    2615,
+    2616,
+    2617,
+    2618,
+    2619,
+    2620,
+    2621,
+    2622,
+    2623,
+    2624,
+    2625,
+    2626,
+    2627,
+    2628,
+    2629,
+    2630,
+    2631,
+    2632,
+    2633,
+    2634,
+    2635,
+    2636,
+    2637,
+    2638,
+    2639,
+    2640,
+    2641,
+    2642,
+    0,
+    2643,
+    2644,
+    2645,
+    2646,
+    2647,
+    2648,
+    2649,
+    2650,
+    2651,
+    2652,
+    2653,
+    2654,
+    2655,
+    2656,
+    2657,
+    2658,
+    2659,
+    215,
+    2660,
+    2661,
+    215,
+    2662,
+    2663,
+    215,
+    215,
+    215,
+    215,
+    215,
+    2664,
+    2665,
+    2666,
+    2667,
+    2668,
+    2669,
+    2670,
+    2671,
+    2672,
+    2673,
+    2674,
+    2675,
+    2676,
+    2677,
+    2678,
+    2679,
+    2680,
+    2681,
+    2682,
+    2683,
+    2684,
+    2685,
+    2686,
+    2687,
+    2688,
+    2689,
+    2690,
+    2691,
+    2692,
+    2693,
+    2694,
+    2695,
+    2696,
+    2697,
+    2698,
+    2699,
+    2700,
+    2701,
+    2702,
+    2703,
+    2704,
+    2705,
+    2706,
+    2707,
+    2708,
+    2709,
+    2710,
+    2711,
+    2712,
+    2713,
+    2714,
+    2715,
+    2716,
+    2717,
+    2718,
+    2719,
+    2720,
+    2721,
+    2722,
+    2723,
+    2724,
+    2725,
+    2726,
+    2727,
+    2728,
+    2729,
+    2730,
+    2731,
+    2732,
+    2733,
+    2734,
+    2735,
+    2736,
+    2737,
+    2738,
+    2739,
+    2740,
+    2741,
+    2742,
+    2743,
+    2744,
+    2745,
+    2746,
+    2747,
+    2748,
+    2749,
+    2750,
+    2751,
+    2752,
+    2753,
+    2754,
+    2755,
+    2756,
+    2757,
+    2758,
+    2759,
+    2760,
+    2761,
+    2762,
+    2763,
+    2764,
+    2765,
+    2766,
+    2767,
+    215,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2768,
+    2769,
+    2770,
+    2771,
+    543,
+    543,
+    543,
+    2772,
+    2773,
+    0,
+    0,
+    0,
+    0,
+    0,
+    9,
+    9,
+    9,
+    9,
+    1211,
+    9,
+    9,
+    2774,
+    2775,
+    2776,
+    2777,
+    2778,
+    2779,
+    2780,
+    2781,
+    2782,
+    2783,
+    2784,
+    2785,
+    2786,
+    2787,
+    2788,
+    2789,
+    2790,
+    2791,
+    2792,
+    2793,
+    2794,
+    2795,
+    2796,
+    2797,
+    2798,
+    2799,
+    2800,
+    2801,
+    2802,
+    2803,
+    2804,
+    2805,
+    2806,
+    2807,
+    2808,
+    2809,
+    2810,
+    2811,
+    0,
+    2812,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2813,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2814,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1163,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    9,
+    9,
+    81,
+    93,
+    81,
+    93,
+    9,
+    9,
+    9,
+    81,
+    93,
+    9,
+    81,
+    93,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    1087,
+    9,
+    9,
+    1087,
+    9,
+    81,
+    93,
+    9,
+    9,
+    81,
+    93,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    12,
+    13,
+    9,
+    9,
+    9,
+    9,
+    9,
+    524,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    1087,
+    1087,
+    9,
+    9,
+    9,
+    9,
+    1087,
+    9,
+    2137,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    0,
+    2815,
+    2815,
+    2815,
+    2815,
+    2816,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2817,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2818,
+    2819,
+    2820,
+    2821,
+    2822,
+    2823,
+    2824,
+    2825,
+    2826,
+    2827,
+    2828,
+    2829,
+    2830,
+    2831,
+    2832,
+    2833,
+    2834,
+    2835,
+    2836,
+    2837,
+    2838,
+    2839,
+    2840,
+    2841,
+    2842,
+    2843,
+    2844,
+    2845,
+    2846,
+    2847,
+    2848,
+    2849,
+    2850,
+    2851,
+    2852,
+    2853,
+    2854,
+    2855,
+    2856,
+    2857,
+    2858,
+    2859,
+    2860,
+    2861,
+    2862,
+    2863,
+    2864,
+    2865,
+    2866,
+    2867,
+    2868,
+    2869,
+    2870,
+    2871,
+    2872,
+    2873,
+    2874,
+    2875,
+    2876,
+    2877,
+    2878,
+    2879,
+    2880,
+    2881,
+    2882,
+    2883,
+    2884,
+    2885,
+    2886,
+    2887,
+    2888,
+    2889,
+    2890,
+    2891,
+    2892,
+    2893,
+    2894,
+    2895,
+    2896,
+    2897,
+    2898,
+    2899,
+    2900,
+    2901,
+    2902,
+    2903,
+    2904,
+    2905,
+    2906,
+    2907,
+    2908,
+    2909,
+    2910,
+    2911,
+    2912,
+    2913,
+    2914,
+    2915,
+    2916,
+    2917,
+    2918,
+    2919,
+    2920,
+    2921,
+    2922,
+    2923,
+    2924,
+    2925,
+    2926,
+    2927,
+    2928,
+    2929,
+    2930,
+    2931,
+    2932,
+    2933,
+    2934,
+    2935,
+    2936,
+    2937,
+    2938,
+    2939,
+    2940,
+    2941,
+    2942,
+    2943,
+    2944,
+    2945,
+    2946,
+    2947,
+    2948,
+    2949,
+    2950,
+    2951,
+    2952,
+    2953,
+    2954,
+    2955,
+    2956,
+    2957,
+    2958,
+    2959,
+    2960,
+    2961,
+    2962,
+    2963,
+    2964,
+    2965,
+    2966,
+    2967,
+    2968,
+    2969,
+    2970,
+    2971,
+    2972,
+    2973,
+    2974,
+    2975,
+    2976,
+    2977,
+    2978,
+    2979,
+    2980,
+    2981,
+    2982,
+    2983,
+    2984,
+    2985,
+    2986,
+    2987,
+    2988,
+    2989,
+    2990,
+    2991,
+    2992,
+    2993,
+    2994,
+    2995,
+    2996,
+    2997,
+    2998,
+    2999,
+    3000,
+    3001,
+    3002,
+    3003,
+    3004,
+    3005,
+    3006,
+    3007,
+    3008,
+    3009,
+    3010,
+    3011,
+    3012,
+    3013,
+    3014,
+    3015,
+    3016,
+    3017,
+    3018,
+    3019,
+    3020,
+    3021,
+    3022,
+    3023,
+    3024,
+    3025,
+    3026,
+    3027,
+    3028,
+    3029,
+    3030,
+    3031,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    0,
+    0,
+    0,
+    0,
+    3032,
+    3033,
+    3033,
+    3033,
+    2815,
+    3034,
+    3035,
+    3036,
+    3037,
+    3038,
+    3037,
+    3038,
+    3037,
+    3038,
+    3037,
+    3038,
+    3037,
+    3038,
+    2815,
+    2815,
+    3037,
+    3038,
+    3037,
+    3038,
+    3037,
+    3038,
+    3037,
+    3038,
+    3039,
+    3040,
+    3041,
+    3041,
+    2815,
+    3036,
+    3036,
+    3036,
+    3036,
+    3036,
+    3036,
+    3036,
+    3036,
+    3036,
+    3042,
+    1089,
+    555,
+    1088,
+    3043,
+    3043,
+    3044,
+    3034,
+    3034,
+    3034,
+    3034,
+    3034,
+    3045,
+    2815,
+    3046,
+    3047,
+    3048,
+    3034,
+    3035,
+    3049,
+    2815,
+    77,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3050,
+    3035,
+    3035,
+    3035,
+    3035,
+    3051,
+    3052,
+    3053,
+    3054,
+    3055,
+    3056,
+    3057,
+    3058,
+    3059,
+    3060,
+    3061,
+    3062,
+    3063,
+    3064,
+    3065,
+    3066,
+    3067,
+    3068,
+    3069,
+    3070,
+    3071,
+    3072,
+    3073,
+    3074,
+    3035,
+    3075,
+    3076,
+    3077,
+    3078,
+    3079,
+    3080,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3081,
+    3082,
+    3083,
+    3084,
+    3085,
+    3086,
+    3087,
+    3088,
+    3089,
+    3090,
+    3091,
+    3092,
+    3093,
+    3094,
+    3095,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3096,
+    3035,
+    3035,
+    0,
+    0,
+    3097,
+    3098,
+    3099,
+    3100,
+    3101,
+    3102,
+    3103,
+    3039,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3104,
+    3035,
+    3035,
+    3035,
+    3035,
+    3105,
+    3106,
+    3107,
+    3108,
+    3109,
+    3110,
+    3111,
+    3112,
+    3113,
+    3114,
+    3115,
+    3116,
+    3117,
+    3118,
+    3119,
+    3120,
+    3121,
+    3122,
+    3123,
+    3124,
+    3125,
+    3126,
+    3127,
+    3128,
+    3035,
+    3129,
+    3130,
+    3131,
+    3132,
+    3133,
+    3134,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3135,
+    3136,
+    3137,
+    3138,
+    3139,
+    3140,
+    3141,
+    3142,
+    3143,
+    3144,
+    3145,
+    3146,
+    3147,
+    3148,
+    3149,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3150,
+    3151,
+    3152,
+    3153,
+    3035,
+    3154,
+    3035,
+    3035,
+    3155,
+    3156,
+    3157,
+    3158,
+    3033,
+    3034,
+    3159,
+    3160,
+    3161,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    3162,
+    3163,
+    3164,
+    3165,
+    3166,
+    3167,
+    3168,
+    3169,
+    3170,
+    3171,
+    3172,
+    3173,
+    3174,
+    3175,
+    3176,
+    3177,
+    3178,
+    3179,
+    3180,
+    3181,
+    3182,
+    3183,
+    3184,
+    3185,
+    3186,
+    3187,
+    3188,
+    3189,
+    3190,
+    3191,
+    3192,
+    3193,
+    3194,
+    3195,
+    3196,
+    3197,
+    3198,
+    3199,
+    3200,
+    3201,
+    3202,
+    3203,
+    3204,
+    3205,
+    3206,
+    3207,
+    3208,
+    3209,
+    3210,
+    3211,
+    3212,
+    3213,
+    3214,
+    3215,
+    3216,
+    3217,
+    3218,
+    3219,
+    3220,
+    3221,
+    3222,
+    3223,
+    3224,
+    3225,
+    3226,
+    3227,
+    3228,
+    3229,
+    3230,
+    3231,
+    3232,
+    3233,
+    3234,
+    3235,
+    3236,
+    3237,
+    3238,
+    3239,
+    3240,
+    3241,
+    3242,
+    3243,
+    3244,
+    3245,
+    3246,
+    3247,
+    3248,
+    3249,
+    3250,
+    3251,
+    3252,
+    3253,
+    3254,
+    3255,
+    0,
+    3256,
+    3256,
+    3257,
+    3258,
+    3259,
+    3260,
+    3261,
+    3262,
+    3263,
+    3264,
+    3265,
+    3266,
+    3267,
+    3268,
+    3269,
+    3270,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3271,
+    3272,
+    3273,
+    3274,
+    3275,
+    3276,
+    3277,
+    3278,
+    3279,
+    3280,
+    3281,
+    3282,
+    3283,
+    3284,
+    3285,
+    3286,
+    3287,
+    3288,
+    3289,
+    3290,
+    3291,
+    3292,
+    3293,
+    3294,
+    3295,
+    3296,
+    3297,
+    3298,
+    3299,
+    3300,
+    3301,
+    0,
+    3302,
+    3303,
+    3304,
+    3305,
+    3306,
+    3307,
+    3308,
+    3309,
+    3310,
+    3311,
+    3312,
+    3313,
+    3314,
+    3315,
+    3316,
+    3317,
+    3318,
+    3319,
+    3320,
+    3321,
+    3322,
+    3323,
+    3324,
+    3325,
+    3326,
+    3327,
+    3328,
+    3329,
+    3330,
+    3331,
+    3332,
+    3333,
+    3334,
+    3335,
+    3336,
+    3337,
+    3338,
+    3339,
+    3340,
+    3341,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    3342,
+    3343,
+    3344,
+    3345,
+    3346,
+    3347,
+    3348,
+    3349,
+    3350,
+    3351,
+    3352,
+    3353,
+    3354,
+    3355,
+    3356,
+    3357,
+    3358,
+    3359,
+    3360,
+    3361,
+    3362,
+    3363,
+    3364,
+    3365,
+    3366,
+    3367,
+    3368,
+    3369,
+    3370,
+    3371,
+    3372,
+    3373,
+    3374,
+    3375,
+    3376,
+    3377,
+    3378,
+    3379,
+    3380,
+    3381,
+    3382,
+    3383,
+    3384,
+    3385,
+    3386,
+    3387,
+    3388,
+    3256,
+    3389,
+    3390,
+    3391,
+    3392,
+    3393,
+    3394,
+    3395,
+    3396,
+    3397,
+    3398,
+    3399,
+    3400,
+    3401,
+    3402,
+    3403,
+    3404,
+    3405,
+    3406,
+    3407,
+    3408,
+    3409,
+    3410,
+    3411,
+    3412,
+    3413,
+    3414,
+    3415,
+    3416,
+    3417,
+    3418,
+    3419,
+    3420,
+    3421,
+    3422,
+    3423,
+    3424,
+    3425,
+    3426,
+    3427,
+    3428,
+    3429,
+    3430,
+    3431,
+    3432,
+    3433,
+    3434,
+    3435,
+    3436,
+    3437,
+    3438,
+    3439,
+    3440,
+    3441,
+    3442,
+    3443,
+    3444,
+    3445,
+    3446,
+    3447,
+    3448,
+    3449,
+    3450,
+    3451,
+    3452,
+    3453,
+    3454,
+    3455,
+    3456,
+    3457,
+    3458,
+    3459,
+    3460,
+    3461,
+    3462,
+    3463,
+    3464,
+    3465,
+    3466,
+    3467,
+    3468,
+    3469,
+    3470,
+    3471,
+    3472,
+    3473,
+    3474,
+    3475,
+    3476,
+    3477,
+    3478,
+    3479,
+    3480,
+    3481,
+    3482,
+    3483,
+    3484,
+    3485,
+    3486,
+    3487,
+    3488,
+    3489,
+    3490,
+    3491,
+    3492,
+    3493,
+    3494,
+    3495,
+    3496,
+    3497,
+    3498,
+    3499,
+    3500,
+    3501,
+    3502,
+    3503,
+    3504,
+    3505,
+    3506,
+    3507,
+    3508,
+    3509,
+    3510,
+    3511,
+    3512,
+    3513,
+    3514,
+    3515,
+    3516,
+    3517,
+    3518,
+    3519,
+    3520,
+    3521,
+    3522,
+    3523,
+    3524,
+    3525,
+    3526,
+    3527,
+    3528,
+    3529,
+    3530,
+    3531,
+    3532,
+    3533,
+    3534,
+    3535,
+    3536,
+    3537,
+    3538,
+    3539,
+    3540,
+    3541,
+    3542,
+    3543,
+    3544,
+    3545,
+    3546,
+    3547,
+    3548,
+    3549,
+    3550,
+    3551,
+    3552,
+    3553,
+    3554,
+    3555,
+    3556,
+    3557,
+    3558,
+    3559,
+    3560,
+    3561,
+    3562,
+    3563,
+    3564,
+    3565,
+    3566,
+    3567,
+    3568,
+    3569,
+    3570,
+    3571,
+    3572,
+    3573,
+    3574,
+    3575,
+    3576,
+    3577,
+    3578,
+    3579,
+    3580,
+    3581,
+    3582,
+    3583,
+    3584,
+    3585,
+    3586,
+    3587,
+    3588,
+    3589,
+    3590,
+    3591,
+    3592,
+    3593,
+    3594,
+    3595,
+    3596,
+    3597,
+    3598,
+    3599,
+    3600,
+    3601,
+    3602,
+    3603,
+    3604,
+    3605,
+    3606,
+    3607,
+    3608,
+    3609,
+    3610,
+    3611,
+    3612,
+    3613,
+    3614,
+    3615,
+    3616,
+    3617,
+    3618,
+    3619,
+    3620,
+    3621,
+    3622,
+    3623,
+    3624,
+    3625,
+    3626,
+    3627,
+    3628,
+    3629,
+    3630,
+    3631,
+    3632,
+    3633,
+    3634,
+    3635,
+    3636,
+    3637,
+    3638,
+    3639,
+    3640,
+    3641,
+    3642,
+    3643,
+    3644,
+    3645,
+    3646,
+    3647,
+    3648,
+    3649,
+    3650,
+    3651,
+    3652,
+    3653,
+    3654,
+    3655,
+    3656,
+    3657,
+    3658,
+    3659,
+    3660,
+    3661,
+    3662,
+    3663,
+    3664,
+    3665,
+    3666,
+    3667,
+    3668,
+    3669,
+    3670,
+    3671,
+    3672,
+    3673,
+    3674,
+    3675,
+    3676,
+    3677,
+    3678,
+    3679,
+    3680,
+    3681,
+    3682,
+    3683,
+    3684,
+    3685,
+    3686,
+    3687,
+    3688,
+    3689,
+    3690,
+    3691,
+    3692,
+    3693,
+    3694,
+    3695,
+    3696,
+    3697,
+    3698,
+    3699,
+    3700,
+    3701,
+    3702,
+    3703,
+    3704,
+    3705,
+    3706,
+    3707,
+    3708,
+    3709,
+    3710,
+    3711,
+    3712,
+    3713,
+    3714,
+    3715,
+    3716,
+    3717,
+    3718,
+    3719,
+    3720,
+    3721,
+    3722,
+    3723,
+    3724,
+    3725,
+    3726,
+    3727,
+    3728,
+    3729,
+    3730,
+    3731,
+    3732,
+    3733,
+    3734,
+    3735,
+    3736,
+    3737,
+    3738,
+    3739,
+    3740,
+    3741,
+    3742,
+    3743,
+    3744,
+    3745,
+    3746,
+    3747,
+    3748,
+    3749,
+    3750,
+    3751,
+    3752,
+    3753,
+    3754,
+    3755,
+    3756,
+    3757,
+    3758,
+    3759,
+    3760,
+    3761,
+    3762,
+    3763,
+    3764,
+    3765,
+    3766,
+    3767,
+    3768,
+    3769,
+    3770,
+    3771,
+    3772,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3034,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    2815,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    525,
+    9,
+    9,
+    9,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3773,
+    3774,
+    3775,
+    3776,
+    3777,
+    3778,
+    3779,
+    3780,
+    3781,
+    3782,
+    3783,
+    3784,
+    3785,
+    3786,
+    3787,
+    3788,
+    3789,
+    3790,
+    3791,
+    3792,
+    3793,
+    3794,
+    3795,
+    3796,
+    3797,
+    3798,
+    3799,
+    3800,
+    3801,
+    3802,
+    3803,
+    3804,
+    3805,
+    3806,
+    3807,
+    3808,
+    3809,
+    3810,
+    3811,
+    3812,
+    3813,
+    3814,
+    3815,
+    3816,
+    3817,
+    3818,
+    341,
+    543,
+    842,
+    842,
+    842,
+    9,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    9,
+    524,
+    3819,
+    3820,
+    3821,
+    3822,
+    3823,
+    3824,
+    3825,
+    3826,
+    3827,
+    3828,
+    3829,
+    3830,
+    3831,
+    3832,
+    3833,
+    3834,
+    3835,
+    3836,
+    3837,
+    3838,
+    3839,
+    3840,
+    3841,
+    3842,
+    3843,
+    3844,
+    3845,
+    3846,
+    3847,
+    3848,
+    543,
+    543,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    543,
+    543,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    526,
+    524,
+    524,
+    524,
+    524,
+    524,
+    524,
+    524,
+    524,
+    524,
+    526,
+    526,
+    3849,
+    3850,
+    3851,
+    3852,
+    3853,
+    3854,
+    3855,
+    3856,
+    3857,
+    3858,
+    3859,
+    3860,
+    3861,
+    3862,
+    215,
+    215,
+    3863,
+    3864,
+    3865,
+    3866,
+    3867,
+    3868,
+    3869,
+    3870,
+    3871,
+    3872,
+    3873,
+    3874,
+    3875,
+    3876,
+    3877,
+    3878,
+    3879,
+    3880,
+    3881,
+    3882,
+    3883,
+    3884,
+    3885,
+    3886,
+    3887,
+    3888,
+    3889,
+    3890,
+    3891,
+    3892,
+    3893,
+    3894,
+    3895,
+    3896,
+    3897,
+    3898,
+    3899,
+    3900,
+    3901,
+    3902,
+    3903,
+    3904,
+    3905,
+    3906,
+    3907,
+    3908,
+    3909,
+    3910,
+    3911,
+    3912,
+    3913,
+    3914,
+    3915,
+    3916,
+    3917,
+    3918,
+    3919,
+    3920,
+    3921,
+    3922,
+    3923,
+    3924,
+    3925,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    3926,
+    3927,
+    3928,
+    3929,
+    3930,
+    3931,
+    3932,
+    3933,
+    3934,
+    3935,
+    3936,
+    3937,
+    3938,
+    3939,
+    3940,
+    524,
+    3941,
+    3941,
+    3942,
+    3943,
+    3944,
+    215,
+    341,
+    3945,
+    3946,
+    3947,
+    3948,
+    3949,
+    215,
+    3950,
+    3951,
+    3952,
+    3953,
+    3954,
+    3955,
+    3956,
+    3957,
+    3958,
+    3959,
+    3960,
+    3961,
+    3962,
+    3963,
+    3964,
+    3965,
+    3966,
+    3967,
+    3968,
+    3969,
+    3970,
+    3971,
+    3972,
+    3973,
+    3974,
+    215,
+    3975,
+    3976,
+    3977,
+    3978,
+    3979,
+    3980,
+    3981,
+    3982,
+    3983,
+    3984,
+    3985,
+    3986,
+    3987,
+    3988,
+    3989,
+    3990,
+    0,
+    0,
+    3991,
+    3992,
+    3993,
+    3994,
+    3995,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    3996,
+    3997,
+    215,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    341,
+    341,
+    341,
+    1163,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1151,
+    1151,
+    1155,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    841,
+    841,
+    11,
+    84,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    9,
+    9,
+    9,
+    9,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1155,
+    1155,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1163,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    1047,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1047,
+    1047,
+    1047,
+    341,
+    1047,
+    341,
+    341,
+    1151,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    556,
+    556,
+    556,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1483,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    1361,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    1151,
+    1155,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1173,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1151,
+    1151,
+    1155,
+    1155,
+    1483,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    525,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    525,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1151,
+    1151,
+    1155,
+    1155,
+    1151,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    1151,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1155,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    1047,
+    1047,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    525,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    841,
+    841,
+    841,
+    341,
+    1272,
+    1151,
+    1272,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    543,
+    341,
+    543,
+    543,
+    556,
+    341,
+    341,
+    543,
+    543,
+    341,
+    341,
+    341,
+    341,
+    341,
+    543,
+    543,
+    341,
+    543,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    525,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1151,
+    1151,
+    1155,
+    1155,
+    1047,
+    1047,
+    341,
+    525,
+    525,
+    1155,
+    1163,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    3998,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    3941,
+    3999,
+    4000,
+    4001,
+    4002,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    215,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    4003,
+    4004,
+    4005,
+    4006,
+    4007,
+    4008,
+    4009,
+    4010,
+    4011,
+    4012,
+    4013,
+    4014,
+    4015,
+    4016,
+    4017,
+    4018,
+    4019,
+    4020,
+    4021,
+    4022,
+    4023,
+    4024,
+    4025,
+    4026,
+    4027,
+    4028,
+    4029,
+    4030,
+    4031,
+    4032,
+    4033,
+    4034,
+    4035,
+    4036,
+    4037,
+    4038,
+    4039,
+    4040,
+    4041,
+    4042,
+    4043,
+    4044,
+    4045,
+    4046,
+    4047,
+    4048,
+    4049,
+    4050,
+    4051,
+    4052,
+    4053,
+    4054,
+    4055,
+    4056,
+    4057,
+    4058,
+    4059,
+    4060,
+    4061,
+    4062,
+    4063,
+    4064,
+    4065,
+    4066,
+    4067,
+    4068,
+    4069,
+    4070,
+    4071,
+    4072,
+    4073,
+    4074,
+    4075,
+    4076,
+    4077,
+    4078,
+    4079,
+    4080,
+    4081,
+    4082,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1151,
+    1155,
+    1155,
+    1151,
+    1155,
+    1155,
+    1047,
+    1155,
+    1163,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4083,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    4084,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    1364,
+    0,
+    0,
+    0,
+    0,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    1365,
+    0,
+    0,
+    0,
+    0,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4085,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4087,
+    4088,
+    4089,
+    4090,
+    4091,
+    4092,
+    4093,
+    4094,
+    4094,
+    4095,
+    4096,
+    4097,
+    4098,
+    4099,
+    4100,
+    4101,
+    4102,
+    4103,
+    4104,
+    4105,
+    4106,
+    4107,
+    4108,
+    4109,
+    4110,
+    4111,
+    4112,
+    4113,
+    4114,
+    4115,
+    4116,
+    4117,
+    4118,
+    4119,
+    4120,
+    4121,
+    4122,
+    4123,
+    4124,
+    4125,
+    4126,
+    4127,
+    4128,
+    4129,
+    4130,
+    4131,
+    4132,
+    4133,
+    4134,
+    4135,
+    4136,
+    4137,
+    4138,
+    4139,
+    4140,
+    4141,
+    4142,
+    4143,
+    4144,
+    4145,
+    4146,
+    4147,
+    4148,
+    4149,
+    4150,
+    4151,
+    4152,
+    4153,
+    4154,
+    4155,
+    4156,
+    4157,
+    4158,
+    4159,
+    4160,
+    4161,
+    4162,
+    4163,
+    4164,
+    4165,
+    4166,
+    4167,
+    4168,
+    4169,
+    4170,
+    4171,
+    4172,
+    4173,
+    4174,
+    4175,
+    4176,
+    4177,
+    4106,
+    4178,
+    4179,
+    4180,
+    4181,
+    4182,
+    4183,
+    4184,
+    4185,
+    4186,
+    4187,
+    4188,
+    4189,
+    4190,
+    4191,
+    4192,
+    4193,
+    4194,
+    4195,
+    4196,
+    4197,
+    4198,
+    4199,
+    4200,
+    4201,
+    4202,
+    4203,
+    4204,
+    4205,
+    4206,
+    4207,
+    4208,
+    4209,
+    4210,
+    4211,
+    4212,
+    4213,
+    4214,
+    4215,
+    4216,
+    4217,
+    4218,
+    4219,
+    4220,
+    4221,
+    4222,
+    4223,
+    4224,
+    4225,
+    4226,
+    4227,
+    4228,
+    4229,
+    4230,
+    4231,
+    4232,
+    4233,
+    4234,
+    4235,
+    4236,
+    4237,
+    4238,
+    4239,
+    4240,
+    4241,
+    4242,
+    4243,
+    4244,
+    4245,
+    4196,
+    4246,
+    4247,
+    4248,
+    4249,
+    4250,
+    4251,
+    4252,
+    4253,
+    4180,
+    4254,
+    4255,
+    4256,
+    4257,
+    4258,
+    4259,
+    4260,
+    4261,
+    4262,
+    4263,
+    4264,
+    4265,
+    4266,
+    4267,
+    4268,
+    4269,
+    4270,
+    4271,
+    4272,
+    4273,
+    4106,
+    4274,
+    4275,
+    4276,
+    4277,
+    4278,
+    4279,
+    4280,
+    4281,
+    4282,
+    4283,
+    4284,
+    4285,
+    4286,
+    4287,
+    4288,
+    4289,
+    4290,
+    4291,
+    4292,
+    4293,
+    4294,
+    4295,
+    4296,
+    4297,
+    4298,
+    4299,
+    4300,
+    4182,
+    4301,
+    4302,
+    4303,
+    4304,
+    4305,
+    4306,
+    4307,
+    4308,
+    4309,
+    4310,
+    4311,
+    4312,
+    4313,
+    4314,
+    4315,
+    4316,
+    4317,
+    4318,
+    4319,
+    4320,
+    4321,
+    4322,
+    4323,
+    4324,
+    4325,
+    4326,
+    4327,
+    4328,
+    4329,
+    4330,
+    4331,
+    4332,
+    4333,
+    4334,
+    4335,
+    4336,
+    4337,
+    4338,
+    4339,
+    4340,
+    4341,
+    4342,
+    4343,
+    4344,
+    4345,
+    4346,
+    4347,
+    4348,
+    4349,
+    4350,
+    3035,
+    3035,
+    4351,
+    3035,
+    4352,
+    3035,
+    3035,
+    4353,
+    4354,
+    4355,
+    4356,
+    4357,
+    4358,
+    4359,
+    4360,
+    4361,
+    4362,
+    3035,
+    4363,
+    3035,
+    4364,
+    3035,
+    3035,
+    4365,
+    4366,
+    3035,
+    3035,
+    3035,
+    4367,
+    4368,
+    4369,
+    4370,
+    4371,
+    4372,
+    4373,
+    4374,
+    4375,
+    4376,
+    4377,
+    4378,
+    4379,
+    4380,
+    4381,
+    4382,
+    4383,
+    4384,
+    4385,
+    4386,
+    4387,
+    4388,
+    4389,
+    4390,
+    4391,
+    4392,
+    4393,
+    4394,
+    4395,
+    4396,
+    4397,
+    4398,
+    4399,
+    4400,
+    4401,
+    4402,
+    4403,
+    4404,
+    4405,
+    4406,
+    4407,
+    4408,
+    4409,
+    4410,
+    4411,
+    4235,
+    4412,
+    4413,
+    4414,
+    4415,
+    4416,
+    4417,
+    4417,
+    4418,
+    4419,
+    4420,
+    4421,
+    4422,
+    4423,
+    4424,
+    4425,
+    4365,
+    4426,
+    4427,
+    4428,
+    4429,
+    4430,
+    4431,
+    0,
+    0,
+    4432,
+    4433,
+    4434,
+    4435,
+    4436,
+    4437,
+    4438,
+    4439,
+    4379,
+    4440,
+    4441,
+    4442,
+    4351,
+    4443,
+    4444,
+    4445,
+    4446,
+    4447,
+    4448,
+    4449,
+    4450,
+    4451,
+    4452,
+    4453,
+    4454,
+    4388,
+    4455,
+    4389,
+    4456,
+    4457,
+    4458,
+    4459,
+    4460,
+    4352,
+    4127,
+    4461,
+    4462,
+    4463,
+    4197,
+    4284,
+    4464,
+    4465,
+    4396,
+    4466,
+    4397,
+    4467,
+    4468,
+    4469,
+    4354,
+    4470,
+    4471,
+    4472,
+    4473,
+    4474,
+    4355,
+    4475,
+    4476,
+    4477,
+    4478,
+    4479,
+    4480,
+    4411,
+    4481,
+    4482,
+    4235,
+    4483,
+    4415,
+    4484,
+    4485,
+    4486,
+    4487,
+    4488,
+    4420,
+    4489,
+    4364,
+    4490,
+    4421,
+    4178,
+    4491,
+    4422,
+    4492,
+    4424,
+    4493,
+    4494,
+    4495,
+    4496,
+    4497,
+    4426,
+    4360,
+    4498,
+    4427,
+    4499,
+    4428,
+    4500,
+    4094,
+    4501,
+    4502,
+    4503,
+    4504,
+    4505,
+    4506,
+    4507,
+    4508,
+    4509,
+    4510,
+    4511,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    4512,
+    4513,
+    4514,
+    4515,
+    4516,
+    4517,
+    4518,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    4519,
+    4520,
+    4521,
+    4522,
+    4523,
+    0,
+    0,
+    0,
+    0,
+    0,
+    4524,
+    4525,
+    4526,
+    4527,
+    4528,
+    4529,
+    4530,
+    4531,
+    4532,
+    4533,
+    4534,
+    4535,
+    4536,
+    4537,
+    4538,
+    4539,
+    4540,
+    4541,
+    4542,
+    4543,
+    4544,
+    4545,
+    4546,
+    4547,
+    4548,
+    4549,
+    0,
+    4550,
+    4551,
+    4552,
+    4553,
+    4554,
+    0,
+    4555,
+    0,
+    4556,
+    4557,
+    0,
+    4558,
+    4559,
+    0,
+    4560,
+    4561,
+    4562,
+    4563,
+    4564,
+    4565,
+    4566,
+    4567,
+    4568,
+    4569,
+    4570,
+    4571,
+    4572,
+    4573,
+    4574,
+    4575,
+    4576,
+    4577,
+    4578,
+    4579,
+    4580,
+    4581,
+    4582,
+    4583,
+    4584,
+    4585,
+    4586,
+    4587,
+    4588,
+    4589,
+    4590,
+    4591,
+    4592,
+    4593,
+    4594,
+    4595,
+    4596,
+    4597,
+    4598,
+    4599,
+    4600,
+    4601,
+    4602,
+    4603,
+    4604,
+    4605,
+    4606,
+    4607,
+    4608,
+    4609,
+    4610,
+    4611,
+    4612,
+    4613,
+    4614,
+    4615,
+    4616,
+    4617,
+    4618,
+    4619,
+    4620,
+    4621,
+    4622,
+    4623,
+    4624,
+    4625,
+    4626,
+    4627,
+    4628,
+    4629,
+    4630,
+    4631,
+    4632,
+    4633,
+    4634,
+    4635,
+    4636,
+    4637,
+    4638,
+    4639,
+    4640,
+    4641,
+    4642,
+    4643,
+    4644,
+    4645,
+    4646,
+    4647,
+    4648,
+    4649,
+    4650,
+    4651,
+    4652,
+    4653,
+    4654,
+    4655,
+    4656,
+    4657,
+    4658,
+    4659,
+    4660,
+    4661,
+    4662,
+    4663,
+    4664,
+    4665,
+    4666,
+    4667,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    4668,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    4669,
+    4670,
+    4671,
+    4672,
+    4673,
+    4674,
+    4675,
+    4676,
+    4677,
+    4678,
+    4679,
+    4680,
+    4681,
+    4682,
+    4683,
+    4684,
+    4685,
+    4686,
+    4687,
+    4688,
+    4689,
+    4690,
+    4691,
+    4692,
+    4693,
+    4694,
+    4695,
+    4696,
+    4697,
+    4698,
+    4699,
+    4700,
+    4701,
+    4702,
+    4703,
+    4704,
+    4705,
+    4706,
+    4707,
+    4708,
+    4709,
+    4710,
+    4711,
+    4712,
+    4713,
+    4714,
+    4715,
+    4716,
+    4707,
+    4717,
+    4718,
+    4719,
+    4720,
+    4721,
+    4722,
+    4723,
+    4724,
+    4725,
+    4726,
+    4727,
+    4728,
+    4729,
+    4730,
+    4731,
+    4732,
+    4733,
+    4734,
+    4735,
+    4736,
+    4737,
+    4738,
+    4739,
+    4740,
+    4741,
+    4742,
+    4743,
+    4744,
+    4745,
+    4746,
+    4747,
+    4748,
+    4749,
+    4750,
+    4751,
+    4752,
+    4753,
+    4754,
+    4755,
+    4756,
+    4757,
+    4758,
+    4759,
+    4760,
+    4761,
+    4762,
+    4763,
+    4764,
+    4765,
+    4766,
+    4767,
+    4768,
+    4769,
+    4770,
+    4771,
+    4772,
+    4773,
+    4774,
+    4775,
+    4776,
+    4777,
+    4778,
+    4779,
+    4780,
+    4781,
+    4782,
+    4783,
+    4784,
+    4785,
+    4786,
+    4787,
+    4788,
+    4789,
+    4790,
+    4791,
+    4792,
+    4793,
+    4794,
+    4795,
+    4796,
+    4797,
+    4798,
+    4799,
+    4800,
+    4801,
+    4802,
+    4803,
+    4804,
+    4805,
+    4806,
+    4807,
+    4808,
+    4809,
+    4810,
+    4811,
+    4812,
+    4813,
+    4814,
+    4815,
+    4816,
+    4708,
+    4817,
+    4818,
+    4819,
+    4820,
+    4821,
+    4822,
+    4823,
+    4824,
+    4825,
+    4826,
+    4827,
+    4828,
+    4829,
+    4830,
+    4831,
+    4832,
+    4833,
+    4834,
+    4835,
+    4836,
+    4837,
+    4838,
+    4839,
+    4840,
+    4841,
+    4842,
+    4843,
+    4844,
+    4845,
+    4846,
+    4847,
+    4848,
+    4849,
+    4850,
+    4851,
+    4852,
+    4853,
+    4854,
+    4855,
+    4856,
+    4857,
+    4858,
+    4859,
+    4860,
+    4861,
+    4862,
+    4863,
+    4864,
+    4865,
+    4866,
+    4867,
+    4868,
+    4869,
+    4870,
+    4871,
+    4872,
+    4873,
+    4874,
+    4875,
+    4876,
+    4877,
+    4878,
+    4879,
+    4880,
+    4881,
+    4882,
+    4883,
+    4884,
+    4885,
+    4886,
+    4887,
+    4888,
+    4889,
+    4890,
+    4891,
+    4892,
+    4893,
+    4894,
+    4895,
+    4896,
+    4897,
+    4898,
+    4899,
+    4900,
+    4901,
+    4902,
+    4903,
+    4904,
+    4905,
+    4906,
+    4907,
+    4908,
+    4909,
+    4910,
+    4911,
+    4912,
+    4913,
+    4914,
+    4915,
+    4916,
+    4917,
+    4918,
+    4919,
+    4920,
+    4921,
+    4922,
+    4923,
+    4924,
+    4925,
+    4926,
+    4927,
+    4928,
+    4929,
+    4930,
+    4931,
+    4932,
+    4933,
+    4934,
+    4935,
+    4936,
+    4937,
+    4938,
+    4939,
+    4940,
+    4941,
+    4942,
+    4943,
+    4944,
+    4945,
+    4946,
+    4947,
+    4948,
+    4949,
+    4950,
+    4951,
+    4952,
+    4953,
+    4954,
+    4955,
+    4956,
+    4957,
+    4958,
+    4959,
+    4960,
+    4961,
+    4962,
+    4963,
+    4964,
+    4965,
+    4966,
+    4967,
+    4968,
+    4969,
+    4970,
+    4971,
+    4972,
+    4973,
+    4974,
+    4975,
+    4976,
+    4977,
+    4978,
+    4979,
+    4980,
+    4981,
+    4982,
+    4983,
+    4984,
+    4985,
+    4986,
+    4987,
+    4988,
+    4989,
+    4990,
+    4991,
+    4992,
+    4993,
+    4994,
+    4995,
+    4996,
+    4997,
+    4998,
+    4999,
+    5000,
+    5001,
+    5002,
+    5003,
+    5004,
+    5005,
+    5006,
+    5007,
+    5008,
+    5009,
+    5010,
+    5011,
+    5012,
+    5013,
+    5014,
+    5015,
+    5016,
+    5017,
+    5018,
+    5019,
+    5020,
+    5021,
+    5022,
+    5023,
+    5024,
+    5025,
+    5026,
+    5027,
+    5028,
+    5029,
+    5030,
+    2137,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5031,
+    5032,
+    5033,
+    5034,
+    5035,
+    5036,
+    5037,
+    5038,
+    5039,
+    5040,
+    5041,
+    5042,
+    5043,
+    5044,
+    5045,
+    5046,
+    5047,
+    5048,
+    5049,
+    5050,
+    5051,
+    5052,
+    5053,
+    5054,
+    5055,
+    5056,
+    5057,
+    5058,
+    5059,
+    5060,
+    5061,
+    5062,
+    5063,
+    5064,
+    5065,
+    5066,
+    5067,
+    5068,
+    5069,
+    5070,
+    5071,
+    5072,
+    5073,
+    5074,
+    5075,
+    5076,
+    5077,
+    5078,
+    5079,
+    5080,
+    5081,
+    5082,
+    5083,
+    5084,
+    5085,
+    5086,
+    5087,
+    5088,
+    5089,
+    5090,
+    5091,
+    5092,
+    5093,
+    5094,
+    0,
+    0,
+    5095,
+    5096,
+    5097,
+    5098,
+    5099,
+    5100,
+    5101,
+    5102,
+    5103,
+    5104,
+    5105,
+    5106,
+    5107,
+    5108,
+    5109,
+    5110,
+    5111,
+    5112,
+    5113,
+    5114,
+    5115,
+    5116,
+    5117,
+    5118,
+    5119,
+    5120,
+    5121,
+    5122,
+    5123,
+    5124,
+    5125,
+    5126,
+    5127,
+    5128,
+    5129,
+    5130,
+    5131,
+    5132,
+    5133,
+    5134,
+    5135,
+    5136,
+    5137,
+    5138,
+    5139,
+    5140,
+    5141,
+    5142,
+    5143,
+    5144,
+    5145,
+    5146,
+    5147,
+    5148,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5149,
+    5150,
+    5151,
+    5152,
+    5153,
+    5154,
+    5155,
+    5156,
+    5157,
+    5158,
+    5159,
+    5160,
+    5161,
+    77,
+    0,
+    0,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    5162,
+    5163,
+    5164,
+    5165,
+    5166,
+    5167,
+    5168,
+    5169,
+    5170,
+    5171,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    556,
+    556,
+    556,
+    556,
+    556,
+    556,
+    556,
+    543,
+    543,
+    5172,
+    5173,
+    5174,
+    5175,
+    5175,
+    5176,
+    5177,
+    5178,
+    5179,
+    5180,
+    5181,
+    5182,
+    5183,
+    5184,
+    5185,
+    5186,
+    5187,
+    5188,
+    5189,
+    5190,
+    5191,
+    3033,
+    3033,
+    5192,
+    5193,
+    5194,
+    5194,
+    5194,
+    5194,
+    5195,
+    5195,
+    5195,
+    5196,
+    5197,
+    5198,
+    0,
+    5199,
+    5200,
+    5201,
+    5202,
+    5203,
+    5204,
+    5205,
+    5206,
+    5207,
+    5208,
+    5209,
+    5210,
+    5211,
+    5212,
+    5213,
+    5214,
+    5215,
+    5216,
+    5217,
+    0,
+    5218,
+    5219,
+    5220,
+    5221,
+    0,
+    0,
+    0,
+    0,
+    5222,
+    5223,
+    5224,
+    1117,
+    5225,
+    0,
+    5226,
+    5227,
+    5228,
+    5229,
+    5230,
+    5231,
+    5232,
+    5233,
+    5234,
+    5235,
+    5236,
+    5237,
+    5238,
+    5239,
+    5240,
+    5241,
+    5242,
+    5243,
+    5244,
+    5245,
+    5246,
+    5247,
+    5248,
+    5249,
+    5250,
+    5251,
+    5252,
+    5253,
+    5254,
+    5255,
+    5256,
+    5257,
+    5258,
+    5259,
+    5260,
+    5261,
+    5262,
+    5263,
+    5264,
+    5265,
+    5266,
+    5267,
+    5268,
+    5269,
+    5270,
+    5271,
+    5272,
+    5273,
+    5274,
+    5275,
+    5276,
+    5277,
+    5278,
+    5279,
+    5280,
+    5281,
+    5282,
+    5283,
+    5284,
+    5285,
+    5286,
+    5287,
+    5288,
+    5289,
+    5290,
+    5291,
+    5292,
+    5293,
+    5294,
+    5295,
+    5296,
+    5297,
+    5298,
+    5299,
+    5300,
+    5301,
+    5302,
+    5303,
+    5304,
+    5305,
+    5306,
+    5307,
+    5308,
+    5309,
+    5310,
+    5311,
+    5312,
+    5313,
+    5314,
+    5315,
+    5316,
+    5317,
+    5318,
+    5319,
+    5320,
+    5321,
+    5322,
+    5323,
+    5324,
+    5325,
+    5326,
+    5327,
+    5328,
+    5329,
+    5330,
+    5331,
+    5332,
+    5333,
+    5334,
+    5335,
+    5336,
+    5337,
+    5338,
+    5339,
+    5340,
+    5341,
+    5342,
+    5343,
+    5344,
+    5345,
+    5346,
+    5347,
+    5348,
+    5349,
+    5350,
+    5351,
+    5352,
+    5353,
+    5354,
+    5355,
+    5356,
+    5357,
+    5358,
+    5359,
+    5360,
+    0,
+    0,
+    1459,
+    0,
+    5361,
+    5362,
+    5363,
+    5364,
+    5365,
+    5366,
+    5367,
+    5368,
+    5369,
+    5370,
+    5371,
+    5372,
+    5373,
+    5374,
+    5375,
+    5376,
+    5377,
+    5378,
+    5379,
+    5380,
+    5381,
+    5382,
+    5383,
+    5384,
+    5385,
+    5386,
+    5387,
+    5388,
+    5389,
+    5390,
+    5391,
+    5392,
+    5393,
+    5394,
+    5395,
+    5396,
+    5397,
+    5398,
+    5399,
+    5400,
+    5401,
+    5402,
+    5403,
+    5404,
+    5405,
+    5406,
+    5407,
+    5408,
+    5409,
+    5410,
+    5411,
+    5412,
+    5413,
+    5414,
+    5415,
+    5416,
+    5417,
+    5418,
+    5419,
+    5420,
+    5421,
+    5422,
+    5423,
+    5424,
+    5425,
+    5426,
+    5427,
+    5428,
+    5429,
+    5430,
+    5431,
+    5432,
+    5433,
+    5434,
+    5435,
+    5436,
+    5437,
+    5438,
+    5439,
+    5440,
+    5441,
+    5442,
+    5443,
+    5444,
+    5445,
+    5446,
+    5447,
+    5448,
+    5449,
+    5450,
+    5451,
+    5452,
+    5453,
+    5454,
+    5455,
+    5456,
+    5457,
+    5458,
+    5459,
+    5460,
+    5461,
+    5462,
+    5463,
+    5464,
+    5465,
+    5466,
+    5467,
+    5468,
+    5469,
+    5470,
+    5471,
+    5472,
+    5473,
+    5474,
+    5475,
+    5476,
+    5477,
+    5478,
+    5479,
+    5480,
+    5481,
+    5482,
+    5483,
+    5484,
+    5485,
+    5486,
+    5487,
+    5488,
+    5489,
+    5490,
+    5491,
+    5492,
+    5493,
+    5494,
+    5495,
+    5496,
+    5497,
+    5498,
+    5499,
+    5500,
+    5501,
+    5502,
+    5503,
+    5504,
+    5505,
+    5506,
+    5507,
+    5508,
+    5509,
+    5510,
+    5511,
+    5512,
+    5513,
+    5514,
+    5515,
+    5516,
+    5517,
+    5518,
+    5519,
+    5520,
+    5521,
+    5522,
+    5523,
+    5524,
+    5525,
+    5526,
+    5527,
+    5528,
+    5529,
+    5530,
+    5531,
+    5532,
+    5533,
+    5534,
+    5535,
+    5536,
+    5537,
+    5538,
+    5539,
+    5540,
+    5541,
+    5542,
+    5543,
+    5544,
+    5545,
+    5546,
+    5547,
+    5548,
+    5549,
+    5550,
+    0,
+    0,
+    0,
+    5551,
+    5552,
+    5553,
+    5554,
+    5555,
+    5556,
+    0,
+    0,
+    5557,
+    5558,
+    5559,
+    5560,
+    5561,
+    5562,
+    0,
+    0,
+    5563,
+    5564,
+    5565,
+    5566,
+    5567,
+    5568,
+    0,
+    0,
+    5569,
+    5570,
+    5571,
+    0,
+    0,
+    0,
+    5572,
+    5573,
+    5574,
+    5575,
+    5576,
+    5577,
+    5578,
+    0,
+    5579,
+    5580,
+    5581,
+    5582,
+    5583,
+    5584,
+    5585,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5586,
+    5586,
+    5586,
+    77,
+    77,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    9,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    0,
+    0,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    5587,
+    1211,
+    1211,
+    1211,
+    1211,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    1211,
+    1211,
+    77,
+    841,
+    841,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    556,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    556,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    5588,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1458,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1458,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    543,
+    543,
+    543,
+    543,
+    543,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1047,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5589,
+    5590,
+    5591,
+    5592,
+    5593,
+    5594,
+    5595,
+    5596,
+    5597,
+    5598,
+    5599,
+    5600,
+    5601,
+    5602,
+    5603,
+    5604,
+    5605,
+    5606,
+    5607,
+    5608,
+    5609,
+    5610,
+    5611,
+    5612,
+    5613,
+    5614,
+    5615,
+    5616,
+    5617,
+    5618,
+    5619,
+    5620,
+    5621,
+    5622,
+    5623,
+    5624,
+    5625,
+    5626,
+    5627,
+    5628,
+    5629,
+    5630,
+    5631,
+    5632,
+    5633,
+    5634,
+    5635,
+    5636,
+    5637,
+    5638,
+    5639,
+    5640,
+    5641,
+    5642,
+    5643,
+    5644,
+    5645,
+    5646,
+    5647,
+    5648,
+    5649,
+    5650,
+    5651,
+    5652,
+    5653,
+    5654,
+    5655,
+    5656,
+    5657,
+    5658,
+    5659,
+    5660,
+    5661,
+    5662,
+    5663,
+    5664,
+    5665,
+    5666,
+    5667,
+    5668,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5669,
+    5670,
+    5671,
+    5672,
+    5673,
+    5674,
+    5675,
+    5676,
+    5677,
+    5678,
+    5679,
+    5680,
+    5681,
+    5682,
+    5683,
+    5684,
+    5685,
+    5686,
+    5687,
+    5688,
+    5689,
+    5690,
+    5691,
+    5692,
+    5693,
+    5694,
+    5695,
+    5696,
+    5697,
+    5698,
+    5699,
+    5700,
+    5701,
+    5702,
+    5703,
+    5704,
+    0,
+    0,
+    0,
+    0,
+    5705,
+    5706,
+    5707,
+    5708,
+    5709,
+    5710,
+    5711,
+    5712,
+    5713,
+    5714,
+    5715,
+    5716,
+    5717,
+    5718,
+    5719,
+    5720,
+    5721,
+    5722,
+    5723,
+    5724,
+    5725,
+    5726,
+    5727,
+    5728,
+    5729,
+    5730,
+    5731,
+    5732,
+    5733,
+    5734,
+    5735,
+    5736,
+    5737,
+    5738,
+    5739,
+    5740,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    1108,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    1108,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    1105,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    5742,
+    5742,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    0,
+    0,
+    0,
+    9,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1105,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    5741,
+    5741,
+    1108,
+    1108,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    0,
+    0,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    1108,
+    1151,
+    1151,
+    1151,
+    0,
+    1151,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    556,
+    1151,
+    543,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    1108,
+    1108,
+    1108,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    543,
+    569,
+    556,
+    0,
+    0,
+    0,
+    0,
+    1163,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    5741,
+    5741,
+    1105,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    5741,
+    5741,
+    5741,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    5742,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    543,
+    556,
+    0,
+    0,
+    0,
+    0,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    1105,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1105,
+    1105,
+    1105,
+    1105,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5743,
+    5744,
+    5745,
+    5746,
+    5747,
+    5748,
+    5749,
+    5750,
+    5751,
+    5752,
+    5753,
+    5754,
+    5755,
+    5756,
+    5757,
+    5758,
+    5759,
+    5760,
+    5761,
+    5762,
+    5763,
+    5764,
+    5765,
+    5766,
+    5767,
+    5768,
+    5769,
+    5770,
+    5771,
+    5772,
+    5773,
+    5774,
+    5775,
+    5776,
+    5777,
+    5778,
+    5779,
+    5780,
+    5781,
+    5782,
+    5783,
+    5784,
+    5785,
+    5786,
+    5787,
+    5788,
+    5789,
+    5790,
+    5791,
+    5792,
+    5793,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5794,
+    5795,
+    5796,
+    5797,
+    5798,
+    5799,
+    5800,
+    5801,
+    5802,
+    5803,
+    5804,
+    5805,
+    5806,
+    5807,
+    5808,
+    5809,
+    5810,
+    5811,
+    5812,
+    5813,
+    5814,
+    5815,
+    5816,
+    5817,
+    5818,
+    5819,
+    5820,
+    5821,
+    5822,
+    5823,
+    5824,
+    5825,
+    5826,
+    5827,
+    5828,
+    5829,
+    5830,
+    5831,
+    5832,
+    5833,
+    5834,
+    5835,
+    5836,
+    5837,
+    5838,
+    5839,
+    5840,
+    5841,
+    5842,
+    5843,
+    5844,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    543,
+    543,
+    543,
+    543,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    1135,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    5845,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    1117,
+    556,
+    556,
+    543,
+    543,
+    543,
+    556,
+    543,
+    556,
+    556,
+    556,
+    556,
+    5846,
+    5846,
+    5846,
+    5846,
+    1112,
+    1112,
+    1112,
+    1112,
+    1112,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1155,
+    1151,
+    1155,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1163,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1211,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1163,
+    1151,
+    1151,
+    1155,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    5847,
+    5848,
+    5849,
+    5850,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    5851,
+    341,
+    341,
+    341,
+    341,
+    341,
+    5852,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1163,
+    5853,
+    1047,
+    1047,
+    5854,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5854,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    543,
+    543,
+    543,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    5855,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1151,
+    5856,
+    5857,
+    1151,
+    5858,
+    5859,
+    1163,
+    1163,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1047,
+    1047,
+    1047,
+    1047,
+    341,
+    1155,
+    1155,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1173,
+    1047,
+    1047,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    1155,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1483,
+    341,
+    1228,
+    1228,
+    341,
+    1047,
+    1047,
+    1047,
+    1047,
+    1151,
+    1173,
+    1151,
+    1151,
+    1047,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    341,
+    1047,
+    341,
+    1047,
+    1047,
+    1047,
+    0,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1151,
+    1483,
+    1173,
+    1151,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1173,
+    1163,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    1155,
+    1155,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    1173,
+    1173,
+    341,
+    5860,
+    1155,
+    1151,
+    1155,
+    1155,
+    1155,
+    1155,
+    0,
+    0,
+    5861,
+    1155,
+    0,
+    0,
+    5862,
+    5863,
+    1483,
+    0,
+    0,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5864,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    0,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    0,
+    0,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1163,
+    1151,
+    1151,
+    1155,
+    1173,
+    341,
+    341,
+    341,
+    341,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    1047,
+    0,
+    1047,
+    543,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    5865,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    5866,
+    5867,
+    5868,
+    5869,
+    5870,
+    5871,
+    1151,
+    1151,
+    1155,
+    1163,
+    1173,
+    341,
+    341,
+    1047,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    5872,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    0,
+    5873,
+    5874,
+    5875,
+    5876,
+    1151,
+    1151,
+    1155,
+    1163,
+    1173,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1151,
+    1155,
+    1163,
+    1151,
+    1047,
+    1047,
+    1047,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    9,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1155,
+    1151,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1483,
+    1173,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1163,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1182,
+    1182,
+    1047,
+    1047,
+    1047,
+    841,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1163,
+    1173,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5877,
+    5878,
+    5879,
+    5880,
+    5881,
+    5882,
+    5883,
+    5884,
+    5885,
+    5886,
+    5887,
+    5888,
+    5889,
+    5890,
+    5891,
+    5892,
+    5893,
+    5894,
+    5895,
+    5896,
+    5897,
+    5898,
+    5899,
+    5900,
+    5901,
+    5902,
+    5903,
+    5904,
+    5905,
+    5906,
+    5907,
+    5908,
+    5909,
+    5910,
+    5911,
+    5912,
+    5913,
+    5914,
+    5915,
+    5916,
+    5917,
+    5918,
+    5919,
+    5920,
+    5921,
+    5922,
+    5923,
+    5924,
+    5925,
+    5926,
+    5927,
+    5928,
+    5929,
+    5930,
+    5931,
+    5932,
+    5933,
+    5934,
+    5935,
+    5936,
+    5937,
+    5938,
+    5939,
+    5940,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    0,
+    1151,
+    1151,
+    1155,
+    1155,
+    1155,
+    1155,
+    1163,
+    341,
+    1047,
+    341,
+    1155,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    5941,
+    5941,
+    1151,
+    1151,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1163,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1228,
+    1151,
+    1151,
+    1151,
+    1151,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    1163,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1155,
+    1151,
+    1151,
+    1151,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1228,
+    1228,
+    1228,
+    1228,
+    1228,
+    1228,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1151,
+    1163,
+    1047,
+    1047,
+    1047,
+    341,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    5942,
+    341,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    0,
+    0,
+    1047,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    1155,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1155,
+    1151,
+    1151,
+    1155,
+    1151,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    0,
+    0,
+    1151,
+    0,
+    1151,
+    1151,
+    0,
+    1151,
+    1151,
+    1151,
+    1173,
+    1151,
+    1163,
+    1163,
+    1228,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    341,
+    341,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    0,
+    1151,
+    1151,
+    0,
+    1155,
+    1155,
+    1151,
+    1155,
+    1163,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    1151,
+    1151,
+    1155,
+    1155,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    11,
+    11,
+    11,
+    11,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    1458,
+    0,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    5943,
+    5943,
+    5943,
+    5943,
+    5943,
+    5943,
+    5943,
+    5943,
+    5943,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    569,
+    569,
+    569,
+    569,
+    569,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    841,
+    841,
+    841,
+    841,
+    525,
+    525,
+    525,
+    525,
+    1047,
+    841,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5944,
+    5945,
+    5946,
+    5947,
+    5948,
+    5949,
+    5950,
+    5951,
+    5952,
+    5953,
+    5954,
+    5955,
+    5956,
+    5957,
+    5958,
+    5959,
+    5960,
+    5961,
+    5962,
+    5963,
+    5964,
+    5965,
+    5966,
+    5967,
+    5968,
+    5969,
+    5970,
+    5971,
+    5972,
+    5973,
+    5974,
+    5975,
+    5976,
+    5977,
+    5978,
+    5979,
+    5980,
+    5981,
+    5982,
+    5983,
+    5984,
+    5985,
+    5986,
+    5987,
+    5988,
+    5989,
+    5990,
+    5991,
+    5992,
+    5993,
+    5994,
+    5995,
+    5996,
+    5997,
+    5998,
+    5999,
+    6000,
+    6001,
+    6002,
+    6003,
+    6004,
+    6005,
+    6006,
+    6007,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    341,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    1155,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    1151,
+    1151,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3034,
+    3034,
+    3033,
+    3034,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    841,
+    1151,
+    569,
+    1047,
+    1459,
+    1459,
+    1459,
+    1459,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    0,
+    0,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    6008,
+    6009,
+    841,
+    841,
+    841,
+    841,
+    841,
+    6010,
+    6011,
+    6012,
+    6013,
+    6014,
+    6015,
+    6016,
+    6017,
+    6018,
+    569,
+    569,
+    569,
+    841,
+    841,
+    841,
+    6019,
+    6020,
+    6021,
+    6022,
+    6023,
+    6024,
+    1459,
+    1459,
+    1459,
+    1459,
+    1459,
+    1459,
+    1459,
+    1459,
+    556,
+    556,
+    556,
+    556,
+    556,
+    556,
+    556,
+    556,
+    841,
+    841,
+    543,
+    543,
+    543,
+    543,
+    543,
+    556,
+    556,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    543,
+    543,
+    543,
+    543,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    6025,
+    6026,
+    6027,
+    6028,
+    6029,
+    6030,
+    6031,
+    6032,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    543,
+    543,
+    543,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    1182,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    0,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    0,
+    2208,
+    2251,
+    0,
+    0,
+    6034,
+    0,
+    0,
+    6035,
+    6036,
+    0,
+    0,
+    2221,
+    6037,
+    2223,
+    2224,
+    0,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    0,
+    6048,
+    0,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    0,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    0,
+    2251,
+    2235,
+    2236,
+    6034,
+    0,
+    0,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    0,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    0,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    0,
+    2251,
+    2235,
+    2236,
+    6034,
+    0,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    0,
+    6037,
+    0,
+    0,
+    0,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    0,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6033,
+    2233,
+    2208,
+    2251,
+    2235,
+    2236,
+    6034,
+    2215,
+    2218,
+    6035,
+    6036,
+    2219,
+    2238,
+    2221,
+    6037,
+    2223,
+    2224,
+    2225,
+    6038,
+    6039,
+    6040,
+    6041,
+    6042,
+    6043,
+    6044,
+    2229,
+    6045,
+    6046,
+    6047,
+    2252,
+    2234,
+    6048,
+    2214,
+    2216,
+    2253,
+    2254,
+    6049,
+    2220,
+    6050,
+    6051,
+    2239,
+    6052,
+    6053,
+    6054,
+    6055,
+    6056,
+    6057,
+    6058,
+    6059,
+    6060,
+    6061,
+    6062,
+    6063,
+    6064,
+    0,
+    0,
+    6065,
+    6066,
+    2248,
+    6067,
+    6068,
+    6069,
+    6070,
+    6071,
+    6072,
+    6073,
+    6074,
+    6075,
+    6076,
+    6077,
+    6078,
+    2249,
+    6079,
+    6080,
+    6081,
+    6082,
+    6083,
+    6084,
+    6085,
+    6086,
+    6087,
+    6088,
+    6089,
+    6090,
+    2247,
+    6091,
+    6092,
+    6093,
+    6094,
+    6095,
+    6096,
+    6097,
+    6098,
+    6099,
+    6100,
+    6101,
+    6102,
+    2246,
+    6103,
+    6104,
+    6105,
+    6106,
+    6107,
+    6108,
+    6109,
+    6110,
+    6111,
+    6112,
+    6113,
+    6114,
+    6115,
+    6116,
+    6117,
+    6118,
+    6065,
+    6066,
+    2248,
+    6067,
+    6068,
+    6069,
+    6070,
+    6071,
+    6072,
+    6073,
+    6074,
+    6075,
+    6076,
+    6077,
+    6078,
+    2249,
+    6079,
+    6080,
+    6081,
+    6082,
+    6083,
+    6084,
+    6085,
+    6086,
+    6087,
+    6088,
+    6089,
+    6090,
+    2247,
+    6091,
+    6092,
+    6093,
+    6094,
+    6095,
+    6096,
+    6097,
+    6098,
+    6099,
+    6100,
+    6101,
+    6102,
+    2246,
+    6103,
+    6104,
+    6105,
+    6106,
+    6107,
+    6108,
+    6109,
+    6110,
+    6111,
+    6112,
+    6113,
+    6114,
+    6115,
+    6116,
+    6117,
+    6118,
+    6065,
+    6066,
+    2248,
+    6067,
+    6068,
+    6069,
+    6070,
+    6071,
+    6072,
+    6073,
+    6074,
+    6075,
+    6076,
+    6077,
+    6078,
+    2249,
+    6079,
+    6080,
+    6081,
+    6082,
+    6083,
+    6084,
+    6085,
+    6086,
+    6087,
+    6088,
+    6089,
+    6090,
+    2247,
+    6091,
+    6092,
+    6093,
+    6094,
+    6095,
+    6096,
+    6097,
+    6098,
+    6099,
+    6100,
+    6101,
+    6102,
+    2246,
+    6103,
+    6104,
+    6105,
+    6106,
+    6107,
+    6108,
+    6109,
+    6110,
+    6111,
+    6112,
+    6113,
+    6114,
+    6115,
+    6116,
+    6117,
+    6118,
+    6065,
+    6066,
+    2248,
+    6067,
+    6068,
+    6069,
+    6070,
+    6071,
+    6072,
+    6073,
+    6074,
+    6075,
+    6076,
+    6077,
+    6078,
+    2249,
+    6079,
+    6080,
+    6081,
+    6082,
+    6083,
+    6084,
+    6085,
+    6086,
+    6087,
+    6088,
+    6089,
+    6090,
+    2247,
+    6091,
+    6092,
+    6093,
+    6094,
+    6095,
+    6096,
+    6097,
+    6098,
+    6099,
+    6100,
+    6101,
+    6102,
+    2246,
+    6103,
+    6104,
+    6105,
+    6106,
+    6107,
+    6108,
+    6109,
+    6110,
+    6111,
+    6112,
+    6113,
+    6114,
+    6115,
+    6116,
+    6117,
+    6118,
+    6065,
+    6066,
+    2248,
+    6067,
+    6068,
+    6069,
+    6070,
+    6071,
+    6072,
+    6073,
+    6074,
+    6075,
+    6076,
+    6077,
+    6078,
+    2249,
+    6079,
+    6080,
+    6081,
+    6082,
+    6083,
+    6084,
+    6085,
+    6086,
+    6087,
+    6088,
+    6089,
+    6090,
+    2247,
+    6091,
+    6092,
+    6093,
+    6094,
+    6095,
+    6096,
+    6097,
+    6098,
+    6099,
+    6100,
+    6101,
+    6102,
+    2246,
+    6103,
+    6104,
+    6105,
+    6106,
+    6107,
+    6108,
+    6109,
+    6110,
+    6111,
+    6112,
+    6113,
+    6114,
+    6115,
+    6116,
+    6117,
+    6118,
+    6119,
+    6120,
+    0,
+    0,
+    6121,
+    6122,
+    6123,
+    6124,
+    6125,
+    6126,
+    6127,
+    6128,
+    6129,
+    6130,
+    6121,
+    6122,
+    6123,
+    6124,
+    6125,
+    6126,
+    6127,
+    6128,
+    6129,
+    6130,
+    6121,
+    6122,
+    6123,
+    6124,
+    6125,
+    6126,
+    6127,
+    6128,
+    6129,
+    6130,
+    6121,
+    6122,
+    6123,
+    6124,
+    6125,
+    6126,
+    6127,
+    6128,
+    6129,
+    6130,
+    6121,
+    6122,
+    6123,
+    6124,
+    6125,
+    6126,
+    6127,
+    6128,
+    6129,
+    6130,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    841,
+    841,
+    841,
+    841,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    1151,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    1151,
+    841,
+    841,
+    1047,
+    1047,
+    1047,
+    1047,
+    1047,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    1151,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    0,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    0,
+    543,
+    543,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    0,
+    0,
+    0,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    525,
+    0,
+    0,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    341,
+    841,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    341,
+    543,
+    543,
+    543,
+    543,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    1172,
+    0,
+    0,
+    0,
+    0,
+    0,
+    11,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    1108,
+    0,
+    0,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    5741,
+    556,
+    556,
+    556,
+    556,
+    556,
+    556,
+    556,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6131,
+    6132,
+    6133,
+    6134,
+    6135,
+    6136,
+    6137,
+    6138,
+    6139,
+    6140,
+    6141,
+    6142,
+    6143,
+    6144,
+    6145,
+    6146,
+    6147,
+    6148,
+    6149,
+    6150,
+    6151,
+    6152,
+    6153,
+    6154,
+    6155,
+    6156,
+    6157,
+    6158,
+    6159,
+    6160,
+    6161,
+    6162,
+    6163,
+    6164,
+    6165,
+    6166,
+    6167,
+    6168,
+    6169,
+    6170,
+    6171,
+    6172,
+    6173,
+    6174,
+    6175,
+    6176,
+    6177,
+    6178,
+    6179,
+    6180,
+    6181,
+    6182,
+    6183,
+    6184,
+    6185,
+    6186,
+    6187,
+    6188,
+    6189,
+    6190,
+    6191,
+    6192,
+    6193,
+    6194,
+    6195,
+    6196,
+    6197,
+    6198,
+    543,
+    543,
+    543,
+    543,
+    543,
+    543,
+    1173,
+    1153,
+    0,
+    0,
+    0,
+    0,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    1152,
+    0,
+    0,
+    0,
+    0,
+    1105,
+    1105,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    1148,
+    5846,
+    5846,
+    5846,
+    1111,
+    5846,
+    5846,
+    5846,
+    5846,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    1148,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    5846,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6199,
+    6200,
+    6201,
+    6202,
+    0,
+    6203,
+    6204,
+    6205,
+    6206,
+    6207,
+    6208,
+    6209,
+    6210,
+    6211,
+    6212,
+    6213,
+    6214,
+    6215,
+    6216,
+    6217,
+    6218,
+    6219,
+    6220,
+    6221,
+    6222,
+    6223,
+    6224,
+    6225,
+    6226,
+    6227,
+    6228,
+    6229,
+    0,
+    6200,
+    6201,
+    0,
+    6230,
+    0,
+    0,
+    6205,
+    0,
+    6207,
+    6208,
+    6209,
+    6210,
+    6211,
+    6212,
+    6213,
+    6214,
+    6215,
+    6216,
+    0,
+    6218,
+    6219,
+    6220,
+    6221,
+    0,
+    6223,
+    0,
+    6225,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6201,
+    0,
+    0,
+    0,
+    0,
+    6205,
+    0,
+    6207,
+    0,
+    6209,
+    0,
+    6211,
+    6212,
+    6213,
+    0,
+    6215,
+    6216,
+    0,
+    6218,
+    0,
+    0,
+    6221,
+    0,
+    6223,
+    0,
+    6225,
+    0,
+    6227,
+    0,
+    6229,
+    0,
+    6200,
+    6201,
+    0,
+    6230,
+    0,
+    0,
+    6205,
+    6206,
+    6207,
+    6208,
+    0,
+    6210,
+    6211,
+    6212,
+    6213,
+    6214,
+    6215,
+    6216,
+    0,
+    6218,
+    6219,
+    6220,
+    6221,
+    0,
+    6223,
+    6224,
+    6225,
+    6226,
+    0,
+    6228,
+    0,
+    6199,
+    6200,
+    6201,
+    6202,
+    6230,
+    6203,
+    6204,
+    6205,
+    6206,
+    6207,
+    0,
+    6209,
+    6210,
+    6211,
+    6212,
+    6213,
+    6214,
+    6215,
+    6216,
+    6217,
+    6218,
+    6219,
+    6220,
+    6221,
+    6222,
+    6223,
+    6224,
+    6225,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6200,
+    6201,
+    6202,
+    0,
+    6203,
+    6204,
+    6205,
+    6206,
+    6207,
+    0,
+    6209,
+    6210,
+    6211,
+    6212,
+    6213,
+    6214,
+    6215,
+    6216,
+    6217,
+    6218,
+    6219,
+    6220,
+    6221,
+    6222,
+    6223,
+    6224,
+    6225,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    75,
+    75,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    0,
+    0,
+    0,
+    0,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    0,
+    0,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    0,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    0,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6231,
+    6232,
+    6233,
+    6234,
+    6235,
+    6236,
+    6237,
+    6238,
+    6239,
+    6240,
+    6241,
+    1211,
+    1211,
+    0,
+    0,
+    0,
+    6242,
+    6243,
+    6244,
+    6245,
+    6246,
+    6247,
+    6248,
+    6249,
+    6250,
+    6251,
+    6252,
+    6253,
+    6254,
+    6255,
+    6256,
+    6257,
+    6258,
+    6259,
+    6260,
+    6261,
+    6262,
+    6263,
+    6264,
+    6265,
+    6266,
+    6267,
+    6268,
+    6269,
+    6270,
+    6271,
+    6272,
+    79,
+    6273,
+    6274,
+    6275,
+    6276,
+    6277,
+    6278,
+    6279,
+    6280,
+    6281,
+    6282,
+    6283,
+    6284,
+    6285,
+    6286,
+    6287,
+    6288,
+    6289,
+    6290,
+    6291,
+    6292,
+    6293,
+    6294,
+    6295,
+    6296,
+    6297,
+    6298,
+    6299,
+    6300,
+    6301,
+    6302,
+    6303,
+    6304,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    6305,
+    6306,
+    6307,
+    0,
+    0,
+    0,
+    2541,
+    2541,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    2541,
+    2541,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    6308,
+    841,
+    6309,
+    6308,
+    6308,
+    6308,
+    6308,
+    6308,
+    6308,
+    6308,
+    6308,
+    6308,
+    6308,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    841,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6310,
+    6311,
+    6312,
+    6313,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6314,
+    6315,
+    6316,
+    6317,
+    6318,
+    6319,
+    6320,
+    6321,
+    6322,
+    6323,
+    6324,
+    6325,
+    6326,
+    6327,
+    6328,
+    6329,
+    6330,
+    6331,
+    6332,
+    6333,
+    6334,
+    6335,
+    6336,
+    6337,
+    6338,
+    6339,
+    6340,
+    6341,
+    6342,
+    6343,
+    6344,
+    6345,
+    6346,
+    6347,
+    6348,
+    6349,
+    6350,
+    6351,
+    6352,
+    6353,
+    6354,
+    6355,
+    6356,
+    6357,
+    0,
+    0,
+    0,
+    0,
+    6358,
+    6359,
+    6360,
+    6361,
+    6362,
+    6363,
+    6364,
+    6365,
+    6366,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6367,
+    6368,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    6369,
+    6369,
+    6369,
+    6369,
+    6369,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    2397,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    2397,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    79,
+    79,
+    79,
+    79,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    79,
+    79,
+    79,
+    79,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    77,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2815,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2815,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    79,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    2397,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    3035,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    6370,
+    6371,
+    6372,
+    6373,
+    6374,
+    4373,
+    6375,
+    6376,
+    6377,
+    6378,
+    4374,
+    6379,
+    6380,
+    6381,
+    4375,
+    6382,
+    6383,
+    6384,
+    6385,
+    6386,
+    6387,
+    6388,
+    6389,
+    6390,
+    6391,
+    6392,
+    6393,
+    4433,
+    6394,
+    6395,
+    6396,
+    6397,
+    6398,
+    6399,
+    6400,
+    6401,
+    6402,
+    4438,
+    4376,
+    4377,
+    4439,
+    6403,
+    6404,
+    4184,
+    6405,
+    4378,
+    6406,
+    6407,
+    6408,
+    6409,
+    6409,
+    6409,
+    6410,
+    6411,
+    6412,
+    6413,
+    6414,
+    6415,
+    6416,
+    6417,
+    6418,
+    6419,
+    6420,
+    6421,
+    6422,
+    6423,
+    6424,
+    6425,
+    6426,
+    6427,
+    6427,
+    4441,
+    6428,
+    6429,
+    6430,
+    6431,
+    4380,
+    6432,
+    6433,
+    6434,
+    4337,
+    6435,
+    6436,
+    6437,
+    6438,
+    6439,
+    6440,
+    6441,
+    6442,
+    6443,
+    6444,
+    6445,
+    6446,
+    6447,
+    6448,
+    6449,
+    6450,
+    6451,
+    6452,
+    6453,
+    6454,
+    6455,
+    6456,
+    6457,
+    6458,
+    6459,
+    6460,
+    6460,
+    6461,
+    6462,
+    6463,
+    4180,
+    6464,
+    6465,
+    6466,
+    6467,
+    6468,
+    6469,
+    6470,
+    6471,
+    4385,
+    6472,
+    6473,
+    6474,
+    6475,
+    6476,
+    6477,
+    6478,
+    6479,
+    6480,
+    6481,
+    6482,
+    6483,
+    6484,
+    6485,
+    6486,
+    6487,
+    6488,
+    6489,
+    6490,
+    6491,
+    6492,
+    4126,
+    6493,
+    6494,
+    6495,
+    6495,
+    6496,
+    6497,
+    6497,
+    6498,
+    6499,
+    6500,
+    6501,
+    6502,
+    6503,
+    6504,
+    6505,
+    6506,
+    6507,
+    6508,
+    6509,
+    6510,
+    4386,
+    6511,
+    6512,
+    6513,
+    6514,
+    4453,
+    6514,
+    6515,
+    4388,
+    6516,
+    6517,
+    6518,
+    6519,
+    4389,
+    4099,
+    6520,
+    6521,
+    6522,
+    6523,
+    6524,
+    6525,
+    6526,
+    6527,
+    6528,
+    6529,
+    6530,
+    6531,
+    6532,
+    6533,
+    6534,
+    6535,
+    6536,
+    6537,
+    6538,
+    6539,
+    6540,
+    6541,
+    4390,
+    6542,
+    6543,
+    6544,
+    6545,
+    6546,
+    6547,
+    4392,
+    6548,
+    6549,
+    6550,
+    6551,
+    6552,
+    6553,
+    6554,
+    6555,
+    4127,
+    4461,
+    6556,
+    6557,
+    6558,
+    6559,
+    6560,
+    6561,
+    6562,
+    6563,
+    4393,
+    6564,
+    6565,
+    6566,
+    6567,
+    4504,
+    6568,
+    6569,
+    6570,
+    6571,
+    6572,
+    6573,
+    6574,
+    6575,
+    6576,
+    6577,
+    6578,
+    6579,
+    6580,
+    4197,
+    6581,
+    6582,
+    6583,
+    6584,
+    6585,
+    6586,
+    6587,
+    6588,
+    6589,
+    6590,
+    6591,
+    4394,
+    4284,
+    6592,
+    6593,
+    6594,
+    6595,
+    6596,
+    6597,
+    6598,
+    6599,
+    4465,
+    6600,
+    6601,
+    6602,
+    6603,
+    6604,
+    6605,
+    6606,
+    6607,
+    4466,
+    6608,
+    6609,
+    6610,
+    6611,
+    6612,
+    6613,
+    6614,
+    6615,
+    6616,
+    6617,
+    6618,
+    6619,
+    4468,
+    6620,
+    6621,
+    6622,
+    6623,
+    6624,
+    6625,
+    6626,
+    6627,
+    6628,
+    6629,
+    6630,
+    6630,
+    6631,
+    6632,
+    4470,
+    6633,
+    6634,
+    6635,
+    6636,
+    6637,
+    6638,
+    6639,
+    4183,
+    6640,
+    6641,
+    6642,
+    6643,
+    6644,
+    6645,
+    6646,
+    4476,
+    6647,
+    6648,
+    6649,
+    6650,
+    6651,
+    6652,
+    6652,
+    4477,
+    4506,
+    6653,
+    6654,
+    6655,
+    6656,
+    6657,
+    4145,
+    4479,
+    6658,
+    6659,
+    4405,
+    6660,
+    6661,
+    4359,
+    6662,
+    6663,
+    4409,
+    6664,
+    6665,
+    6666,
+    6667,
+    6667,
+    6668,
+    6669,
+    6670,
+    6671,
+    6672,
+    6673,
+    6674,
+    6675,
+    6676,
+    6677,
+    6678,
+    6679,
+    6680,
+    6681,
+    6682,
+    6683,
+    6684,
+    6685,
+    6686,
+    6687,
+    6688,
+    6689,
+    6690,
+    6691,
+    6692,
+    6693,
+    6694,
+    4415,
+    6695,
+    6696,
+    6697,
+    6698,
+    6699,
+    6700,
+    6701,
+    6702,
+    6703,
+    6704,
+    6705,
+    6706,
+    6707,
+    6708,
+    6709,
+    6710,
+    6496,
+    6711,
+    6712,
+    6713,
+    6714,
+    6715,
+    6716,
+    6717,
+    6718,
+    6719,
+    6720,
+    6721,
+    6722,
+    4201,
+    6723,
+    6724,
+    6725,
+    6726,
+    6727,
+    6728,
+    4418,
+    6729,
+    6730,
+    6731,
+    6732,
+    6733,
+    6734,
+    6735,
+    6736,
+    6737,
+    6738,
+    6739,
+    6740,
+    6741,
+    6742,
+    6743,
+    6744,
+    6745,
+    6746,
+    6747,
+    6748,
+    4140,
+    6749,
+    6750,
+    6751,
+    6752,
+    6753,
+    6754,
+    4486,
+    6755,
+    6756,
+    6757,
+    6758,
+    6759,
+    6760,
+    6761,
+    6762,
+    6763,
+    6764,
+    6765,
+    6766,
+    6767,
+    6768,
+    6769,
+    6770,
+    6771,
+    6772,
+    6773,
+    6774,
+    4491,
+    4492,
+    6775,
+    6776,
+    6777,
+    6778,
+    6779,
+    6780,
+    6781,
+    6782,
+    6783,
+    6784,
+    6785,
+    6786,
+    6787,
+    4493,
+    6788,
+    6789,
+    6790,
+    6791,
+    6792,
+    6793,
+    6794,
+    6795,
+    6796,
+    6797,
+    6798,
+    6799,
+    6800,
+    6801,
+    6802,
+    6803,
+    6804,
+    6805,
+    6806,
+    6807,
+    6808,
+    6809,
+    6810,
+    6811,
+    6812,
+    6813,
+    6814,
+    6815,
+    6816,
+    6817,
+    4499,
+    4499,
+    6818,
+    6819,
+    6820,
+    6821,
+    6822,
+    6823,
+    6824,
+    6825,
+    6826,
+    6827,
+    4500,
+    6828,
+    6829,
+    6830,
+    6831,
+    6832,
+    6833,
+    6834,
+    6835,
+    6836,
+    6837,
+    6838,
+    6839,
+    6840,
+    6841,
+    6842,
+    6843,
+    6844,
+    6845,
+    6846,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1459,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    2129,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    577,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    4086,
+    0,
+    0,
+};
+
+static const utf8proc_property_t utf8proc_properties[] = {
+    {0, 0, 0, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false,
+        false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_CC, 0, UTF8PROC_BIDI_CLASS_BN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, true, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CC, 0, UTF8PROC_BIDI_CLASS_BN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CC, 0, UTF8PROC_BIDI_CLASS_S, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CC, 0, UTF8PROC_BIDI_CLASS_B, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_LF},
+    {UTF8PROC_CATEGORY_CC, 0, UTF8PROC_BIDI_CLASS_WS, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CC, 0, UTF8PROC_BIDI_CLASS_B, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CR},
+    {UTF8PROC_CATEGORY_CC, 0, UTF8PROC_BIDI_CLASS_B, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_ZS, 0, UTF8PROC_BIDI_CLASS_WS, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ET, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_ET, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ES, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_CS, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ES, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5093, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5084, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5096, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 0, UINT16_MAX, 0, UINT16_MAX, 0,
+        false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1, UINT16_MAX, 1, UINT16_MAX,
+        2784, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 2, UINT16_MAX, 2, UINT16_MAX,
+        49, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3, UINT16_MAX, 3, UINT16_MAX,
+        704, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 4, UINT16_MAX, 4, UINT16_MAX,
+        62, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5, UINT16_MAX, 5, UINT16_MAX,
+        2872, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6, UINT16_MAX, 6, UINT16_MAX,
+        782, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7, UINT16_MAX, 7, UINT16_MAX,
+        808, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 8, UINT16_MAX, 8, UINT16_MAX,
+        111, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 9, UINT16_MAX, 9, UINT16_MAX,
+        898, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 10, UINT16_MAX, 10, UINT16_MAX,
+        913, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 11, UINT16_MAX, 11, UINT16_MAX,
+        999, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 12, UINT16_MAX, 12, UINT16_MAX,
+        2890, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 13, UINT16_MAX, 13, UINT16_MAX,
+        160, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 14, UINT16_MAX, 14, UINT16_MAX,
+        205, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 15, UINT16_MAX, 15, UINT16_MAX,
+        2982, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 16, UINT16_MAX, 16, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 17, UINT16_MAX, 17, UINT16_MAX,
+        1087, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 18, UINT16_MAX, 18, UINT16_MAX,
+        1173, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 19, UINT16_MAX, 19, UINT16_MAX,
+        1257, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 20, UINT16_MAX, 20, UINT16_MAX,
+        254, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 21, UINT16_MAX, 21, UINT16_MAX,
+        3042, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 22, UINT16_MAX, 22, UINT16_MAX,
+        1337, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 23, UINT16_MAX, 23, UINT16_MAX,
+        3122, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 24, UINT16_MAX, 24, UINT16_MAX,
+        303, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 25, UINT16_MAX, 25, UINT16_MAX,
+        1423, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PC, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1491, UINT16_MAX,
+        1491, 352, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1493, UINT16_MAX,
+        1493, 2818, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2812, UINT16_MAX,
+        2812, 401, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1494, UINT16_MAX,
+        1494, 743, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1495, UINT16_MAX,
+        1495, 414, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2837, UINT16_MAX,
+        2837, 2875, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1497, UINT16_MAX,
+        1497, 795, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1498, UINT16_MAX,
+        1498, 853, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1499, UINT16_MAX,
+        1499, 463, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1500, UINT16_MAX,
+        1500, 901, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1501, UINT16_MAX,
+        1501, 956, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1502, UINT16_MAX,
+        1502, 1043, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1503, UINT16_MAX,
+        1503, 2932, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1504, UINT16_MAX,
+        1504, 512, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1505, UINT16_MAX,
+        1505, 557, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1507, UINT16_MAX,
+        1507, 2994, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2826, UINT16_MAX,
+        2826, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1508, UINT16_MAX,
+        1508, 1130, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 3305, UINT16_MAX,
+        3305, 1215, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1509, UINT16_MAX,
+        1509, 1296, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1510, UINT16_MAX,
+        1510, 606, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2908, UINT16_MAX,
+        2908, 3082, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1511, UINT16_MAX,
+        1511, 1380, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2925, UINT16_MAX,
+        2925, 3131, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 3312, UINT16_MAX,
+        3312, 655, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2834, UINT16_MAX,
+        2834, 1466, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ZS, 0, UTF8PROC_BIDI_CLASS_CS, UTF8PROC_DECOMP_TYPE_NOBREAK, 26, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8219, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, 1621, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 0, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PI, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_BN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 1, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8221, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ET, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ET, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 31, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 32, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8225, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 35, 35, 7220,
+        UINT16_MAX, 7220, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8228, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 38, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 14, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PF, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 16423,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 16426,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 16429,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8240, 50, UINT16_MAX, 50, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8243, 53, UINT16_MAX, 53, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8246, 56, UINT16_MAX, 56, UINT16_MAX, 3143,
+        false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8249, 59, UINT16_MAX, 59, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8252, 62, UINT16_MAX, 62, UINT16_MAX, 1537,
+        false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8255, 65, UINT16_MAX, 65, UINT16_MAX, 1579,
+        false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 66, UINT16_MAX, 66, UINT16_MAX,
+        1549, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8259, 69, UINT16_MAX, 69, UINT16_MAX, 2852,
+        false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8262, 72, UINT16_MAX, 72, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8265, 75, UINT16_MAX, 75, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8268, 78, UINT16_MAX, 78, UINT16_MAX, 3357,
+        false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8271, 81, UINT16_MAX, 81, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8274, 84, UINT16_MAX, 84, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8277, 87, UINT16_MAX, 87, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8280, 90, UINT16_MAX, 90, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8283, 93, UINT16_MAX, 93, UINT16_MAX, 2878,
+        false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 94, UINT16_MAX, 94, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8287, 97, UINT16_MAX, 97, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8290, 100, UINT16_MAX, 100, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8293, 103, UINT16_MAX, 103, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8296, 106, UINT16_MAX, 106, UINT16_MAX,
+        3461, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8299, 109, UINT16_MAX, 109, UINT16_MAX,
+        1597, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8302, 112, UINT16_MAX, 112, UINT16_MAX,
+        1591, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 113, UINT16_MAX, 113,
+        UINT16_MAX, 1585, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8306, 116, UINT16_MAX, 116, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8309, 119, UINT16_MAX, 119, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8312, 122, UINT16_MAX, 122, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8315, 125, UINT16_MAX, 125, UINT16_MAX,
+        1509, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8318, 128, UINT16_MAX, 128, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 129, UINT16_MAX, 129,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 8322, 8069, UINT16_MAX, 8069,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8324, UINT16_MAX, 8070, UINT16_MAX, 8070,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8326, UINT16_MAX, 8071, UINT16_MAX, 8071,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8328, UINT16_MAX, 8072, UINT16_MAX, 8072,
+        3192, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8330, UINT16_MAX, 8073, UINT16_MAX, 8073,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8332, UINT16_MAX, 8074, UINT16_MAX, 8074,
+        1540, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8334, UINT16_MAX, 2836, UINT16_MAX, 2836,
+        1582, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1492, UINT16_MAX,
+        1492, 1558, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8336, UINT16_MAX, 8075, UINT16_MAX, 8075,
+        2855, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8338, UINT16_MAX, 8076, UINT16_MAX, 8076,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8340, UINT16_MAX, 8077, UINT16_MAX, 8077,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8342, UINT16_MAX, 8078, UINT16_MAX, 8078,
+        3406, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8344, UINT16_MAX, 8079, UINT16_MAX, 8079,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8346, UINT16_MAX, 8080, UINT16_MAX, 8080,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8348, UINT16_MAX, 8081, UINT16_MAX, 8081,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8350, UINT16_MAX, 8082, UINT16_MAX, 8082,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8352, UINT16_MAX, 8083, UINT16_MAX, 8083,
+        2881, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8084, UINT16_MAX,
+        8084, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8354, UINT16_MAX, 8085, UINT16_MAX, 8085,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8356, UINT16_MAX, 8086, UINT16_MAX, 8086,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8358, UINT16_MAX, 8087, UINT16_MAX, 8087,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8360, UINT16_MAX, 8088, UINT16_MAX, 8088,
+        3510, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8362, UINT16_MAX, 8089, UINT16_MAX, 8089,
+        1606, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8364, UINT16_MAX, 8090, UINT16_MAX, 8090,
+        1594, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8091, UINT16_MAX,
+        8091, 1588, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8366, UINT16_MAX, 8092, UINT16_MAX, 8092,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8368, UINT16_MAX, 8093, UINT16_MAX, 8093,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8370, UINT16_MAX, 8094, UINT16_MAX, 8094,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8372, UINT16_MAX, 8095, UINT16_MAX, 8095,
+        1523, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8374, UINT16_MAX, 8096, UINT16_MAX, 8096,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8097, UINT16_MAX,
+        8097, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8376, UINT16_MAX, 8098, UINT16_MAX, 8098,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8378, 188, UINT16_MAX, 188, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8381, UINT16_MAX, 8099, UINT16_MAX, 8099,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8383, 193, UINT16_MAX, 193, UINT16_MAX,
+        3259, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8386, UINT16_MAX, 8100, UINT16_MAX, 8100,
+        3308, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8388, 198, UINT16_MAX, 198, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8391, UINT16_MAX, 8101, UINT16_MAX, 8101,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8393, 203, UINT16_MAX, 203, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8396, UINT16_MAX, 8102, UINT16_MAX, 8102,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8398, 208, UINT16_MAX, 208, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8401, UINT16_MAX, 8103, UINT16_MAX, 8103,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8403, 213, UINT16_MAX, 213, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8406, UINT16_MAX, 8104, UINT16_MAX, 8104,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8408, 218, UINT16_MAX, 218, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8411, UINT16_MAX, 8105, UINT16_MAX, 8105,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8413, 223, UINT16_MAX, 223, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8416, UINT16_MAX, 8106, UINT16_MAX, 8106,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 226, UINT16_MAX, 226,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8107, UINT16_MAX,
+        8107, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8419, 229, UINT16_MAX, 229, UINT16_MAX,
+        2858, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8422, UINT16_MAX, 8108, UINT16_MAX, 8108,
+        2862, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8424, 234, UINT16_MAX, 234, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8427, UINT16_MAX, 8109, UINT16_MAX, 8109,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8429, 239, UINT16_MAX, 239, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8432, UINT16_MAX, 8110, UINT16_MAX, 8110,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8434, 244, UINT16_MAX, 244, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8437, UINT16_MAX, 8111, UINT16_MAX, 8111,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8439, 249, UINT16_MAX, 249, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8442, UINT16_MAX, 8112, UINT16_MAX, 8112,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8444, 254, UINT16_MAX, 254, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8447, UINT16_MAX, 8113, UINT16_MAX, 8113,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8449, 259, UINT16_MAX, 259, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8452, UINT16_MAX, 8114, UINT16_MAX, 8114,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8454, 264, UINT16_MAX, 264, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8457, UINT16_MAX, 8115, UINT16_MAX, 8115,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8459, 269, UINT16_MAX, 269, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8462, UINT16_MAX, 8116, UINT16_MAX, 8116,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8464, 274, UINT16_MAX, 274, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8467, UINT16_MAX, 8117, UINT16_MAX, 8117,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 277, UINT16_MAX, 277,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 5164, UINT16_MAX,
+        5164, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8470, 280, UINT16_MAX, 280, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8473, UINT16_MAX, 8118, UINT16_MAX, 8118,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8475, 285, UINT16_MAX, 285, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8478, UINT16_MAX, 8119, UINT16_MAX, 8119,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8480, 290, UINT16_MAX, 290, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8483, UINT16_MAX, 8120, UINT16_MAX, 8120,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8485, 295, UINT16_MAX, 295, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8488, UINT16_MAX, 8121, UINT16_MAX, 8121,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8490, 8492, UINT16_MAX, 8, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1499, UINT16_MAX,
+        1499, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8494, 304,
+        UINT16_MAX, 304, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8497, UINT16_MAX,
+        8122, UINT16_MAX, 8122, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8499, 309, UINT16_MAX, 309, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8502, UINT16_MAX, 8123, UINT16_MAX, 8123,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8504, 314, UINT16_MAX, 314, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8507, UINT16_MAX, 8124, UINT16_MAX, 8124,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8509, 319, UINT16_MAX, 319, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8512, UINT16_MAX, 8125, UINT16_MAX, 8125,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8514, 324, UINT16_MAX, 324, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8517, UINT16_MAX, 8126, UINT16_MAX, 8126,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8519, 329, UINT16_MAX, 329, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8522, UINT16_MAX, 8127, UINT16_MAX, 8127,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8524, 334,
+        UINT16_MAX, 334, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8527, UINT16_MAX,
+        8128, UINT16_MAX, 8128, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 337, UINT16_MAX, 337,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8129, UINT16_MAX,
+        8129, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8530, 340, UINT16_MAX, 340, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8533, UINT16_MAX, 8130, UINT16_MAX, 8130,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8535, 345, UINT16_MAX, 345, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8538, UINT16_MAX, 8131, UINT16_MAX, 8131,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8540, 350, UINT16_MAX, 350, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8543, UINT16_MAX, 8132, UINT16_MAX, 8132,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8545, 8545,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 355, UINT16_MAX, 355,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8133, UINT16_MAX,
+        8133, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8548, 358, UINT16_MAX, 358, UINT16_MAX,
+        2974, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8551, UINT16_MAX, 8134, UINT16_MAX, 8134,
+        2978, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8553, 363, UINT16_MAX, 363, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8556, UINT16_MAX, 8135, UINT16_MAX, 8135,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8558, 368, UINT16_MAX, 368, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8561, UINT16_MAX, 8136, UINT16_MAX, 8136,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 371, UINT16_MAX, 371,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8137, UINT16_MAX,
+        8137, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8564, 374, UINT16_MAX, 374, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8567, UINT16_MAX, 8138, UINT16_MAX, 8138,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8569, 379, UINT16_MAX, 379, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8572, UINT16_MAX, 8139, UINT16_MAX, 8139,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8574, 384, UINT16_MAX, 384, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8577, UINT16_MAX, 8140, UINT16_MAX, 8140,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8579, 389, UINT16_MAX, 389, UINT16_MAX,
+        3012, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8582, UINT16_MAX, 8141, UINT16_MAX, 8141,
+        3015, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8584, 394, UINT16_MAX, 394, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8587, UINT16_MAX, 8142, UINT16_MAX, 8142,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8589, 399, UINT16_MAX, 399, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8592, UINT16_MAX, 8143, UINT16_MAX, 8143,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8594, 404, UINT16_MAX, 404, UINT16_MAX,
+        3018, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8597, UINT16_MAX, 8144, UINT16_MAX, 8144,
+        3021, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8599, 409, UINT16_MAX, 409, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8602, UINT16_MAX, 8145, UINT16_MAX, 8145,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8604, 414, UINT16_MAX, 414, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8607, UINT16_MAX, 8146, UINT16_MAX, 8146,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 417, UINT16_MAX, 417,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8147, UINT16_MAX,
+        8147, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8610, 420, UINT16_MAX, 420, UINT16_MAX,
+        3030, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8613, UINT16_MAX, 8148, UINT16_MAX, 8148,
+        3033, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8615, 425, UINT16_MAX, 425, UINT16_MAX,
+        3036, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8618, UINT16_MAX, 8149, UINT16_MAX, 8149,
+        3039, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8620, 430, UINT16_MAX, 430, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8623, UINT16_MAX, 8150, UINT16_MAX, 8150,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8625, 435, UINT16_MAX, 435, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8628, UINT16_MAX, 8151, UINT16_MAX, 8151,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8630, 440, UINT16_MAX, 440, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8633, UINT16_MAX, 8152, UINT16_MAX, 8152,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8635, 445, UINT16_MAX, 445, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8638, UINT16_MAX, 8153, UINT16_MAX, 8153,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8640, 450, UINT16_MAX, 450, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8643, UINT16_MAX, 8154, UINT16_MAX, 8154,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8645, 455, UINT16_MAX, 455, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8648, UINT16_MAX, 8155, UINT16_MAX, 8155,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8650, 460, UINT16_MAX, 460, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8653, 463, UINT16_MAX, 463, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8656, UINT16_MAX, 8156, UINT16_MAX, 8156,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8658, 468, UINT16_MAX, 468, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8661, UINT16_MAX, 8157, UINT16_MAX, 8157,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8663, 473, UINT16_MAX, 473, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8666, UINT16_MAX, 8158, UINT16_MAX, 8158,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 18, 18, 3305,
+        UINT16_MAX, 3305, 3140, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8159, UINT16_MAX,
+        8159, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 476, UINT16_MAX, 476,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 477, UINT16_MAX, 477,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8160, UINT16_MAX,
+        8160, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 478, UINT16_MAX, 478,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8161, UINT16_MAX,
+        8161, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 479, UINT16_MAX, 479,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 480, UINT16_MAX, 480,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8162, UINT16_MAX,
+        8162, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 481, UINT16_MAX, 481,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 482, UINT16_MAX, 482,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 483, UINT16_MAX, 483,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8163, UINT16_MAX,
+        8163, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 484, UINT16_MAX, 484,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 485, UINT16_MAX, 485,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 486, UINT16_MAX, 486,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 487, UINT16_MAX, 487,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8164, UINT16_MAX,
+        8164, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 488, UINT16_MAX, 488,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 489, UINT16_MAX, 489,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8165, UINT16_MAX,
+        8165, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 490, UINT16_MAX, 490,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 491, UINT16_MAX, 491,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 492, UINT16_MAX, 492,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8166, UINT16_MAX,
+        8166, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8167, UINT16_MAX,
+        8167, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 493, UINT16_MAX, 493,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 494, UINT16_MAX, 494,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8168, UINT16_MAX,
+        8168, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 495, UINT16_MAX, 495,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8688, 498, UINT16_MAX, 498, UINT16_MAX,
+        3565, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8691, UINT16_MAX, 8169, UINT16_MAX, 8169,
+        3614, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 501, UINT16_MAX, 501,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8170, UINT16_MAX,
+        8170, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 502, UINT16_MAX, 502,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8171, UINT16_MAX,
+        8171, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 503, UINT16_MAX, 503,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 504, UINT16_MAX, 504,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8172, UINT16_MAX,
+        8172, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 505, UINT16_MAX, 505,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 506, UINT16_MAX, 506,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8173, UINT16_MAX,
+        8173, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 507, UINT16_MAX, 507,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8700, 510, UINT16_MAX, 510, UINT16_MAX,
+        3663, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8703, UINT16_MAX, 8174, UINT16_MAX, 8174,
+        3712, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 513, UINT16_MAX, 513,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 514, UINT16_MAX, 514,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 515, UINT16_MAX, 515,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8175, UINT16_MAX,
+        8175, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 516, UINT16_MAX, 516,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8176, UINT16_MAX,
+        8176, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 517, UINT16_MAX, 517,
+        UINT16_MAX, 1573, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 518, UINT16_MAX, 518,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8177, UINT16_MAX,
+        8177, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 519, UINT16_MAX, 519,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8178, UINT16_MAX,
+        8178, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8179, UINT16_MAX,
+        8179, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8712, 522,
+        UINT16_MAX, 522, 8180, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8715, 522, 8181,
+        522, 8180, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8717, UINT16_MAX,
+        8181, UINT16_MAX, 8180, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8719, 529,
+        UINT16_MAX, 529, 8182, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8722, 529, 8183,
+        529, 8182, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8724, UINT16_MAX,
+        8183, UINT16_MAX, 8182, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8726, 536,
+        UINT16_MAX, 536, 8184, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8729, 536, 8185,
+        536, 8184, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8731, UINT16_MAX,
+        8185, UINT16_MAX, 8184, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8733, 543, UINT16_MAX, 543, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8736, UINT16_MAX, 8186, UINT16_MAX, 8186,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8738, 548, UINT16_MAX, 548, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8741, UINT16_MAX, 8187, UINT16_MAX, 8187,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8743, 553, UINT16_MAX, 553, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8746, UINT16_MAX, 8188, UINT16_MAX, 8188,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8748, 558, UINT16_MAX, 558, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8751, UINT16_MAX, 8189, UINT16_MAX, 8189,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8753, 563, UINT16_MAX, 563, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8756, UINT16_MAX, 8190, UINT16_MAX, 8190,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8758, 568, UINT16_MAX, 568, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8761, UINT16_MAX, 8191, UINT16_MAX, 8191,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8763, 573, UINT16_MAX, 573, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8766, UINT16_MAX, 8192, UINT16_MAX, 8192,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8768, 578, UINT16_MAX, 578, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8771, UINT16_MAX, 8193, UINT16_MAX, 8193,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1496, UINT16_MAX,
+        1496, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8773, 583, UINT16_MAX, 583, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8776, UINT16_MAX, 8194, UINT16_MAX, 8194,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8778, 588, UINT16_MAX, 588, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8781, UINT16_MAX, 8195, UINT16_MAX, 8195,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8783, 593, UINT16_MAX, 593, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8786, UINT16_MAX, 8196, UINT16_MAX, 8196,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 596, UINT16_MAX, 596,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8197, UINT16_MAX,
+        8197, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8789, 599, UINT16_MAX, 599, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8792, UINT16_MAX, 8198, UINT16_MAX, 8198,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8794, 604, UINT16_MAX, 604, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8797, UINT16_MAX, 8199, UINT16_MAX, 8199,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8799, 609, UINT16_MAX, 609, UINT16_MAX,
+        1567, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8802, UINT16_MAX, 8200, UINT16_MAX, 8200,
+        1570, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8804, 614, UINT16_MAX, 614, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8807, UINT16_MAX, 8201, UINT16_MAX, 8201,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8809, 619, UINT16_MAX, 619, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8812, UINT16_MAX, 8202, UINT16_MAX, 8202,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8814, 8814, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8816, 626,
+        UINT16_MAX, 626, 8203, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8819, 626, 8204,
+        626, 8203, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8821, UINT16_MAX,
+        8204, UINT16_MAX, 8203, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8823, 633, UINT16_MAX, 633, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8826, UINT16_MAX, 8205, UINT16_MAX, 8205,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 636, UINT16_MAX, 636,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 637, UINT16_MAX, 637,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8830, 640, UINT16_MAX, 640, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8833, UINT16_MAX, 8206, UINT16_MAX, 8206,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8835, 645, UINT16_MAX, 645, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8838, UINT16_MAX, 8207, UINT16_MAX, 8207,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8840, 650, UINT16_MAX, 650, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8843, UINT16_MAX, 8208, UINT16_MAX, 8208,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8845, 655, UINT16_MAX, 655, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8848, UINT16_MAX, 8209, UINT16_MAX, 8209,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8850, 660, UINT16_MAX, 660, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8853, UINT16_MAX, 8210, UINT16_MAX, 8210,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8855, 665, UINT16_MAX, 665, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8858, UINT16_MAX, 8211, UINT16_MAX, 8211,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8860, 670, UINT16_MAX, 670, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8863, UINT16_MAX, 8212, UINT16_MAX, 8212,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8865, 675, UINT16_MAX, 675, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8868, UINT16_MAX, 8213, UINT16_MAX, 8213,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8870, 680, UINT16_MAX, 680, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8873, UINT16_MAX, 8214, UINT16_MAX, 8214,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8875, 685, UINT16_MAX, 685, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8878, UINT16_MAX, 8215, UINT16_MAX, 8215,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8880, 690, UINT16_MAX, 690, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8883, UINT16_MAX, 8216, UINT16_MAX, 8216,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8885, 695, UINT16_MAX, 695, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8888, UINT16_MAX, 8217, UINT16_MAX, 8217,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8890, 700, UINT16_MAX, 700, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8893, UINT16_MAX, 8218, UINT16_MAX, 8218,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8895, 705, UINT16_MAX, 705, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8898, UINT16_MAX, 8219, UINT16_MAX, 8219,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8900, 710, UINT16_MAX, 710, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8903, UINT16_MAX, 8220, UINT16_MAX, 8220,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8905, 715, UINT16_MAX, 715, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8908, UINT16_MAX, 8221, UINT16_MAX, 8221,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8910, 720, UINT16_MAX, 720, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8913, UINT16_MAX, 8222, UINT16_MAX, 8222,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8915, 725, UINT16_MAX, 725, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8918, UINT16_MAX, 8223, UINT16_MAX, 8223,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 728, UINT16_MAX, 728,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8224, UINT16_MAX,
+        8224, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8921, 731, UINT16_MAX, 731, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8924, UINT16_MAX, 8225, UINT16_MAX, 8225,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 734, UINT16_MAX, 734,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 735, UINT16_MAX, 735,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 1506, UINT16_MAX,
+        1506, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 736, UINT16_MAX, 736,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8226, UINT16_MAX,
+        8226, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8929, 739, UINT16_MAX, 739, UINT16_MAX,
+        1543, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8932, UINT16_MAX, 8227, UINT16_MAX, 8227,
+        1546, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8934, 744, UINT16_MAX, 744, UINT16_MAX,
+        2866, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8937, UINT16_MAX, 8228, UINT16_MAX, 8228,
+        2869, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8939, 749, UINT16_MAX, 749, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8942, UINT16_MAX, 8229, UINT16_MAX, 8229,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8944, 754, UINT16_MAX, 754, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8947, UINT16_MAX, 8230, UINT16_MAX, 8230,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8949, 759, UINT16_MAX, 759, UINT16_MAX,
+        1615, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8952, UINT16_MAX, 8231, UINT16_MAX, 8231,
+        1618, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8954, 764, UINT16_MAX, 764, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8957, UINT16_MAX, 8232, UINT16_MAX, 8232,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 8959, 769, UINT16_MAX, 769, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 8962, UINT16_MAX, 8233, UINT16_MAX, 8233,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 772, UINT16_MAX, 772,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 773, UINT16_MAX, 773,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8234, UINT16_MAX,
+        8234, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 774, UINT16_MAX, 774,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 775, UINT16_MAX, 775,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8235, UINT16_MAX,
+        8235, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8236, UINT16_MAX,
+        8236, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 776, UINT16_MAX, 776,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8237, UINT16_MAX,
+        8237, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 777, UINT16_MAX, 777,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 778, UINT16_MAX, 778,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 779, UINT16_MAX, 779,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 780, UINT16_MAX, 780,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8238, UINT16_MAX,
+        8238, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 781, UINT16_MAX, 781,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8239, UINT16_MAX,
+        8239, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 782, UINT16_MAX, 782,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8240, UINT16_MAX,
+        8240, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 783, UINT16_MAX, 783,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8241, UINT16_MAX,
+        8241, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 784, UINT16_MAX, 784,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8242, UINT16_MAX,
+        8242, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8243, UINT16_MAX,
+        8243, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8244, UINT16_MAX,
+        8244, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8245, UINT16_MAX,
+        8245, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8246, UINT16_MAX,
+        8246, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8247, UINT16_MAX,
+        8247, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8248, UINT16_MAX,
+        8248, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8249, UINT16_MAX,
+        8249, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8250, UINT16_MAX,
+        8250, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2821, UINT16_MAX,
+        2821, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8251, UINT16_MAX,
+        8251, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8252, UINT16_MAX,
+        8252, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8253, UINT16_MAX,
+        8253, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8254, UINT16_MAX,
+        8254, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8255, UINT16_MAX,
+        8255, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8256, UINT16_MAX,
+        8256, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8257, UINT16_MAX,
+        8257, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8258, UINT16_MAX,
+        8258, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8259, UINT16_MAX,
+        8259, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8260, UINT16_MAX,
+        8260, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8261, UINT16_MAX,
+        8261, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8262, UINT16_MAX,
+        8262, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8263, UINT16_MAX,
+        8263, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8264, UINT16_MAX,
+        8264, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8265, UINT16_MAX,
+        8265, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8266, UINT16_MAX,
+        8266, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8267, UINT16_MAX,
+        8267, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8268, UINT16_MAX,
+        8268, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8269, UINT16_MAX,
+        8269, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8270, UINT16_MAX,
+        8270, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8271, UINT16_MAX,
+        8271, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8272, UINT16_MAX,
+        8272, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8273, UINT16_MAX,
+        8273, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8274, UINT16_MAX,
+        8274, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8275, UINT16_MAX,
+        8275, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8276, UINT16_MAX,
+        8276, 1576, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8277, UINT16_MAX,
+        8277, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8278, UINT16_MAX,
+        8278, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 7, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 785, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 9, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 17, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 786, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 787, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 788, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 22, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 24, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8981, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8983, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8985, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8987, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8989, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 8991, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 489, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 11, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 18, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 23, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32768, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32769, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32770, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32771, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32775, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32776, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32778, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32772, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32814, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32773, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32780, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32779, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32782, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32783, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32815, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32816, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 232, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 216, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32781, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 202, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32808, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32813, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32807, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32784, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 202, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32774, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 202, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32777, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32810, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32812, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32811, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32809, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 1, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 1, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32819, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, 802, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, 803, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32817, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, 804, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, 8997, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 240, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, 807, 7217, UINT16_MAX, 7217,
+        32818, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 233, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 234, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 808, UINT16_MAX, 808,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8279, UINT16_MAX,
+        8279, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 809, UINT16_MAX, 809,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8280, UINT16_MAX,
+        8280, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 810, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 811, UINT16_MAX, 811,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8281, UINT16_MAX,
+        8281, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 9004, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8282, UINT16_MAX,
+        8282, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8283, UINT16_MAX,
+        8283, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8284, UINT16_MAX,
+        8284, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, 0, 814, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 815, UINT16_MAX, 815,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 9008, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9010, 820, UINT16_MAX, 820, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, 0, 821, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9014, 824, UINT16_MAX, 824, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9017, 827, UINT16_MAX, 827, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9020, 830, UINT16_MAX, 830, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9023, 833, UINT16_MAX, 833, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9026, 836, UINT16_MAX, 836, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9029, 839, UINT16_MAX, 839, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9032, 17226, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 845, UINT16_MAX, 845,
+        UINT16_MAX, 1673, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 846, UINT16_MAX, 846,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 847, UINT16_MAX, 847,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 848, UINT16_MAX, 848,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 849, UINT16_MAX, 849,
+        UINT16_MAX, 1726, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 850, UINT16_MAX, 850,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 851, UINT16_MAX, 851,
+        UINT16_MAX, 1777, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 852, UINT16_MAX, 852,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 807, UINT16_MAX, 807,
+        UINT16_MAX, 1830, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 853, UINT16_MAX, 853,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 854, UINT16_MAX, 854,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 35, UINT16_MAX, 35, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 855, UINT16_MAX, 855,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 856, UINT16_MAX, 856,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 857, UINT16_MAX, 857,
+        UINT16_MAX, 1881, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 858, UINT16_MAX, 858,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 859, UINT16_MAX, 859,
+        UINT16_MAX, 5027, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 860, UINT16_MAX, 860,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 861, UINT16_MAX, 861,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 862, UINT16_MAX, 862,
+        UINT16_MAX, 1932, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 863, UINT16_MAX, 863,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 864, UINT16_MAX, 864,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 865, UINT16_MAX, 865,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 866, UINT16_MAX, 866,
+        UINT16_MAX, 1983, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9059, 869, UINT16_MAX, 869, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9062, 872, UINT16_MAX, 872, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9065, UINT16_MAX, 2603, UINT16_MAX, 2603,
+        4904, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9067, UINT16_MAX, 2635, UINT16_MAX, 2635,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9069, UINT16_MAX, 2640, UINT16_MAX, 2640,
+        4913, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9071, UINT16_MAX, 2676, UINT16_MAX, 2676,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9073, 17267, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7211, UINT16_MAX,
+        7211, 2088, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7212, UINT16_MAX,
+        7212, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2846, UINT16_MAX,
+        2846, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7213, UINT16_MAX,
+        7213, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7214, UINT16_MAX,
+        7214, 2141, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7215, UINT16_MAX,
+        7215, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7216, UINT16_MAX,
+        7216, 2192, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 915, UINT16_MAX,
+        915, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7217, UINT16_MAX,
+        7217, 2245, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7218, UINT16_MAX,
+        7218, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7219, UINT16_MAX,
+        7219, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7220, UINT16_MAX,
+        7220, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7221, UINT16_MAX,
+        7221, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7222, UINT16_MAX,
+        7222, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7223, UINT16_MAX,
+        7223, 2401, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2847, UINT16_MAX,
+        2847, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7224, UINT16_MAX,
+        7224, 5023, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 860, 917, UINT16_MAX, 917,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 917, UINT16_MAX,
+        917, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7226, UINT16_MAX,
+        7226, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 897, UINT16_MAX,
+        897, 2349, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7227, UINT16_MAX,
+        7227, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7228, UINT16_MAX,
+        7228, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7229, UINT16_MAX,
+        7229, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 2835, UINT16_MAX,
+        2835, 2452, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9078, UINT16_MAX, 8285, UINT16_MAX, 8285,
+        2036, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9080, UINT16_MAX, 8286, UINT16_MAX, 8286,
+        2297, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9082, UINT16_MAX, 2745, UINT16_MAX, 2745,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9084, UINT16_MAX, 2714, UINT16_MAX, 2714,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9086, UINT16_MAX, 2750, UINT16_MAX, 2750,
+        5033, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 896, UINT16_MAX, 896,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 846, 846, 7212,
+        UINT16_MAX, 7212, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 852, 852, 915,
+        UINT16_MAX, 915, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 897, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, 2505, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9090, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9092, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 863, 863, 7227,
+        UINT16_MAX, 7227, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 858, 858, 2847,
+        UINT16_MAX, 2847, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8287, UINT16_MAX,
+        8287, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 902, UINT16_MAX, 902,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8288, UINT16_MAX,
+        8288, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 903, UINT16_MAX, 903,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8289, UINT16_MAX,
+        8289, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 904, UINT16_MAX, 904,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 7238, UINT16_MAX,
+        7238, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 905, UINT16_MAX, 905,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8290, UINT16_MAX,
+        8290, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 906, UINT16_MAX, 906,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8291, UINT16_MAX,
+        8291, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 907, UINT16_MAX, 907,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8292, UINT16_MAX,
+        8292, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 908, UINT16_MAX, 908,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8293, UINT16_MAX,
+        8293, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 909, UINT16_MAX, 909,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8294, UINT16_MAX,
+        8294, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 910, UINT16_MAX, 910,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8295, UINT16_MAX,
+        8295, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 911, UINT16_MAX, 911,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8296, UINT16_MAX,
+        8296, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 912, UINT16_MAX, 912,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8297, UINT16_MAX,
+        8297, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 913, UINT16_MAX, 913,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8298, UINT16_MAX,
+        8298, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 853, 853, 7218,
+        UINT16_MAX, 7218, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 859, 859, 7224,
+        UINT16_MAX, 7224, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 914, UINT16_MAX,
+        8299, UINT16_MAX, 8299, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8300, UINT16_MAX,
+        8300, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 915, 852,
+        UINT16_MAX, 852, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 849, 849, 7214,
+        UINT16_MAX, 7214, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 916, UINT16_MAX, 916,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8301, UINT16_MAX,
+        8301, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 917, 918,
+        UINT16_MAX, 918, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 919, UINT16_MAX, 919,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8302, UINT16_MAX,
+        8302, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 920, UINT16_MAX, 920,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 921, UINT16_MAX, 921,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 922, UINT16_MAX, 922,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9115, 925, UINT16_MAX, 925, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9118, 928, UINT16_MAX, 928, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 929, UINT16_MAX, 929,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9122, 932, UINT16_MAX, 932, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 933, UINT16_MAX, 933,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 934, UINT16_MAX, 934,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 935, UINT16_MAX, 935,
+        UINT16_MAX, 2525, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9128, 938, UINT16_MAX, 938, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 939, UINT16_MAX, 939,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 940, UINT16_MAX, 940,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 941, UINT16_MAX, 941,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 942, UINT16_MAX, 942,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9135, 945, UINT16_MAX, 945, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9138, 948, UINT16_MAX, 948, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9141, 951, UINT16_MAX, 951, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 952, UINT16_MAX, 952,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 953, UINT16_MAX, 953,
+        UINT16_MAX, 2615, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 954, UINT16_MAX, 954,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 955, UINT16_MAX, 955,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 956, UINT16_MAX, 956,
+        UINT16_MAX, 2522, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 957, UINT16_MAX, 957,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 958, UINT16_MAX, 958,
+        UINT16_MAX, 2511, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 959, UINT16_MAX, 959,
+        UINT16_MAX, 2601, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 960, UINT16_MAX, 960,
+        UINT16_MAX, 2635, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 961, UINT16_MAX, 961,
+        UINT16_MAX, 2531, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9154, 964, UINT16_MAX, 964, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 965, UINT16_MAX, 965,
+        UINT16_MAX, 2528, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 966, UINT16_MAX, 966,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 967, UINT16_MAX, 967,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 968, UINT16_MAX, 968,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 969, UINT16_MAX, 969,
+        UINT16_MAX, 2641, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 970, UINT16_MAX, 970,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 971, UINT16_MAX, 971,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 972, UINT16_MAX, 972,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 973, UINT16_MAX, 973,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 974, UINT16_MAX, 974,
+        UINT16_MAX, 2542, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 975, UINT16_MAX, 975,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 976, UINT16_MAX, 976,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 977, UINT16_MAX, 977,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 978, UINT16_MAX, 978,
+        UINT16_MAX, 2659, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 979, UINT16_MAX, 979,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 980, UINT16_MAX, 980,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 981, UINT16_MAX, 981,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 982, UINT16_MAX, 982,
+        UINT16_MAX, 2665, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 983, UINT16_MAX, 983,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 984, UINT16_MAX, 984,
+        UINT16_MAX, 2653, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 985, UINT16_MAX, 985,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 986, UINT16_MAX, 986,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8303, UINT16_MAX,
+        8303, 2622, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8304, UINT16_MAX,
+        8304, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8305, UINT16_MAX,
+        8305, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8306, UINT16_MAX,
+        8306, 2575, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8307, UINT16_MAX,
+        8307, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8308, UINT16_MAX,
+        8308, 2564, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8309, UINT16_MAX,
+        8309, 2608, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8310, UINT16_MAX,
+        8310, 2638, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8311, UINT16_MAX,
+        8311, 2553, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9179, UINT16_MAX, 8312, UINT16_MAX, 8312,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8313, UINT16_MAX,
+        8313, 2581, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8314, UINT16_MAX,
+        8314, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8315, UINT16_MAX,
+        8315, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8316, UINT16_MAX,
+        8316, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8317, UINT16_MAX,
+        8317, 2644, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8318, UINT16_MAX,
+        8318, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8319, UINT16_MAX,
+        8319, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8320, UINT16_MAX,
+        8320, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8321, UINT16_MAX,
+        8321, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8322, UINT16_MAX,
+        8322, 2584, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8323, UINT16_MAX,
+        8323, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8324, UINT16_MAX,
+        8324, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8325, UINT16_MAX,
+        8325, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8326, UINT16_MAX,
+        8326, 2662, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8327, UINT16_MAX,
+        8327, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8328, UINT16_MAX,
+        8328, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8329, UINT16_MAX,
+        8329, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8330, UINT16_MAX,
+        8330, 2668, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8331, UINT16_MAX,
+        8331, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8332, UINT16_MAX,
+        8332, 2656, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8333, UINT16_MAX,
+        8333, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8334, UINT16_MAX,
+        8334, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9181, UINT16_MAX, 8335, UINT16_MAX, 8335,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9183, UINT16_MAX, 8336, UINT16_MAX, 8336,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8337, UINT16_MAX,
+        8337, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9185, UINT16_MAX, 8338, UINT16_MAX, 8338,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8339, UINT16_MAX,
+        8339, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8340, UINT16_MAX,
+        8340, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8341, UINT16_MAX,
+        8341, 2578, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9187, UINT16_MAX, 8342, UINT16_MAX, 8342,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8343, UINT16_MAX,
+        8343, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8344, UINT16_MAX,
+        8344, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8345, UINT16_MAX,
+        8345, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8346, UINT16_MAX,
+        8346, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9189, UINT16_MAX, 8347, UINT16_MAX, 8347,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9191, UINT16_MAX, 8348, UINT16_MAX, 8348,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9193, UINT16_MAX, 8349, UINT16_MAX, 8349,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8350, UINT16_MAX,
+        8350, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1003, UINT16_MAX, 1003,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8351, UINT16_MAX,
+        8351, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1004, UINT16_MAX, 1004,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8352, UINT16_MAX,
+        8352, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1005, UINT16_MAX, 1005,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8353, UINT16_MAX,
+        8353, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1006, UINT16_MAX, 1006,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8354, UINT16_MAX,
+        8354, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1007, UINT16_MAX, 1007,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8355, UINT16_MAX,
+        8355, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1008, UINT16_MAX, 1008,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8356, UINT16_MAX,
+        8356, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1009, UINT16_MAX, 1009,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8357, UINT16_MAX,
+        8357, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1010, UINT16_MAX, 1010,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8358, UINT16_MAX,
+        8358, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1011, UINT16_MAX, 1011,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8359, UINT16_MAX,
+        8359, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1012, UINT16_MAX, 1012,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8360, UINT16_MAX,
+        8360, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1013, UINT16_MAX, 1013,
+        UINT16_MAX, 2595, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8361, UINT16_MAX,
+        8361, 2598, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9206, 1016, UINT16_MAX, 1016, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9209, UINT16_MAX, 8362, UINT16_MAX, 8362,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1019, UINT16_MAX, 1019,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8363, UINT16_MAX,
+        8363, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1020, UINT16_MAX, 1020,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8364, UINT16_MAX,
+        8364, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1021, UINT16_MAX, 1021,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8365, UINT16_MAX,
+        8365, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1022, UINT16_MAX, 1022,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8366, UINT16_MAX,
+        8366, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1023, UINT16_MAX, 1023,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8367, UINT16_MAX,
+        8367, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ME, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1024, UINT16_MAX, 1024,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8368, UINT16_MAX,
+        8368, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1025, UINT16_MAX, 1025,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8369, UINT16_MAX,
+        8369, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1026, UINT16_MAX, 1026,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8370, UINT16_MAX,
+        8370, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1027, UINT16_MAX, 1027,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8371, UINT16_MAX,
+        8371, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1028, UINT16_MAX, 1028,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8372, UINT16_MAX,
+        8372, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1029, UINT16_MAX, 1029,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8373, UINT16_MAX,
+        8373, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1030, UINT16_MAX, 1030,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8374, UINT16_MAX,
+        8374, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1031, UINT16_MAX, 1031,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8375, UINT16_MAX,
+        8375, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1032, UINT16_MAX, 1032,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8376, UINT16_MAX,
+        8376, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1033, UINT16_MAX, 1033,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8377, UINT16_MAX,
+        8377, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1034, UINT16_MAX, 1034,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8378, UINT16_MAX,
+        8378, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1035, UINT16_MAX, 1035,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8379, UINT16_MAX,
+        8379, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1036, UINT16_MAX, 1036,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8380, UINT16_MAX,
+        8380, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1037, UINT16_MAX, 1037,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8381, UINT16_MAX,
+        8381, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1038, UINT16_MAX, 1038,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8382, UINT16_MAX,
+        8382, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1039, UINT16_MAX, 1039,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8383, UINT16_MAX,
+        8383, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1040, UINT16_MAX, 1040,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8384, UINT16_MAX,
+        8384, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1041, UINT16_MAX, 1041,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8385, UINT16_MAX,
+        8385, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1042, UINT16_MAX, 1042,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8386, UINT16_MAX,
+        8386, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1043, UINT16_MAX, 1043,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8387, UINT16_MAX,
+        8387, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1044, UINT16_MAX, 1044,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8388, UINT16_MAX,
+        8388, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1045, UINT16_MAX, 1045,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8389, UINT16_MAX,
+        8389, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1046, UINT16_MAX, 1046,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8390, UINT16_MAX,
+        8390, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1047, UINT16_MAX, 1047,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8391, UINT16_MAX,
+        8391, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1048, UINT16_MAX, 1048,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8392, UINT16_MAX,
+        8392, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1049, UINT16_MAX, 1049,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8393, UINT16_MAX,
+        8393, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1050, UINT16_MAX, 1050,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8394, UINT16_MAX,
+        8394, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1051, UINT16_MAX, 1051,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9244, 1054, UINT16_MAX, 1054, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9247, UINT16_MAX, 8395, UINT16_MAX, 8395,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1057, UINT16_MAX, 1057,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8396, UINT16_MAX,
+        8396, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1058, UINT16_MAX, 1058,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8397, UINT16_MAX,
+        8397, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1059, UINT16_MAX, 1059,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8398, UINT16_MAX,
+        8398, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1060, UINT16_MAX, 1060,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8399, UINT16_MAX,
+        8399, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1061, UINT16_MAX, 1061,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8400, UINT16_MAX,
+        8400, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1062, UINT16_MAX, 1062,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8401, UINT16_MAX,
+        8401, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8402, UINT16_MAX,
+        8402, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9255, 1065, UINT16_MAX, 1065, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9258, UINT16_MAX, 8403, UINT16_MAX, 8403,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9260, 1070, UINT16_MAX, 1070, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9263, UINT16_MAX, 8404, UINT16_MAX, 8404,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1073, UINT16_MAX, 1073,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8405, UINT16_MAX,
+        8405, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9266, 1076, UINT16_MAX, 1076, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9269, UINT16_MAX, 8406, UINT16_MAX, 8406,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1079, UINT16_MAX, 1079,
+        UINT16_MAX, 2629, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8407, UINT16_MAX,
+        8407, 2632, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9272, 1082, UINT16_MAX, 1082, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9275, UINT16_MAX, 8408, UINT16_MAX, 8408,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9277, 1087, UINT16_MAX, 1087, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9280, UINT16_MAX, 8409, UINT16_MAX, 8409,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9282, 1092, UINT16_MAX, 1092, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9285, UINT16_MAX, 8410, UINT16_MAX, 8410,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1095, UINT16_MAX, 1095,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8411, UINT16_MAX,
+        8411, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9288, 1098, UINT16_MAX, 1098, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9291, UINT16_MAX, 8412, UINT16_MAX, 8412,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9293, 1103, UINT16_MAX, 1103, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9296, UINT16_MAX, 8413, UINT16_MAX, 8413,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9298, 1108, UINT16_MAX, 1108, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9301, UINT16_MAX, 8414, UINT16_MAX, 8414,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1111, UINT16_MAX, 1111,
+        UINT16_MAX, 2647, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8415, UINT16_MAX,
+        8415, 2650, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9304, 1114, UINT16_MAX, 1114, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9307, UINT16_MAX, 8416, UINT16_MAX, 8416,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9309, 1119, UINT16_MAX, 1119, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9312, UINT16_MAX, 8417, UINT16_MAX, 8417,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9314, 1124, UINT16_MAX, 1124, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9317, UINT16_MAX, 8418, UINT16_MAX, 8418,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9319, 1129, UINT16_MAX, 1129, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9322, UINT16_MAX, 8419, UINT16_MAX, 8419,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9324, 1134, UINT16_MAX, 1134, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9327, UINT16_MAX, 8420, UINT16_MAX, 8420,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9329, 1139, UINT16_MAX, 1139, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9332, UINT16_MAX, 8421, UINT16_MAX, 8421,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1142, UINT16_MAX, 1142,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8422, UINT16_MAX,
+        8422, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9335, 1145, UINT16_MAX, 1145, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9338, UINT16_MAX, 8423, UINT16_MAX, 8423,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1148, UINT16_MAX, 1148,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8424, UINT16_MAX,
+        8424, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1149, UINT16_MAX, 1149,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8425, UINT16_MAX,
+        8425, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1150, UINT16_MAX, 1150,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8426, UINT16_MAX,
+        8426, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1151, UINT16_MAX, 1151,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8427, UINT16_MAX,
+        8427, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1152, UINT16_MAX, 1152,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8428, UINT16_MAX,
+        8428, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1153, UINT16_MAX, 1153,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8429, UINT16_MAX,
+        8429, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1154, UINT16_MAX, 1154,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8430, UINT16_MAX,
+        8430, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1155, UINT16_MAX, 1155,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8431, UINT16_MAX,
+        8431, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1156, UINT16_MAX, 1156,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8432, UINT16_MAX,
+        8432, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1157, UINT16_MAX, 1157,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8433, UINT16_MAX,
+        8433, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1158, UINT16_MAX, 1158,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8434, UINT16_MAX,
+        8434, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1159, UINT16_MAX, 1159,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8435, UINT16_MAX,
+        8435, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1160, UINT16_MAX, 1160,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8436, UINT16_MAX,
+        8436, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1161, UINT16_MAX, 1161,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8437, UINT16_MAX,
+        8437, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1162, UINT16_MAX, 1162,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8438, UINT16_MAX,
+        8438, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1163, UINT16_MAX, 1163,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8439, UINT16_MAX,
+        8439, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1164, UINT16_MAX, 1164,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8440, UINT16_MAX,
+        8440, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1165, UINT16_MAX, 1165,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8441, UINT16_MAX,
+        8441, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1166, UINT16_MAX, 1166,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8442, UINT16_MAX,
+        8442, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1167, UINT16_MAX, 1167,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8443, UINT16_MAX,
+        8443, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1168, UINT16_MAX, 1168,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8444, UINT16_MAX,
+        8444, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1169, UINT16_MAX, 1169,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8445, UINT16_MAX,
+        8445, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1170, UINT16_MAX, 1170,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8446, UINT16_MAX,
+        8446, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1171, UINT16_MAX, 1171,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8447, UINT16_MAX,
+        8447, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1172, UINT16_MAX, 1172,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8448, UINT16_MAX,
+        8448, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1173, UINT16_MAX, 1173,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8449, UINT16_MAX,
+        8449, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1174, UINT16_MAX, 1174,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8450, UINT16_MAX,
+        8450, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1175, UINT16_MAX, 1175,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1176, UINT16_MAX, 1176,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1177, UINT16_MAX, 1177,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1178, UINT16_MAX, 1178,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1179, UINT16_MAX, 1179,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1180, UINT16_MAX, 1180,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1181, UINT16_MAX, 1181,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1182, UINT16_MAX, 1182,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1183, UINT16_MAX, 1183,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1184, UINT16_MAX, 1184,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1185, UINT16_MAX, 1185,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1186, UINT16_MAX, 1186,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1187, UINT16_MAX, 1187,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1188, UINT16_MAX, 1188,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1189, UINT16_MAX, 1189,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1190, UINT16_MAX, 1190,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1191, UINT16_MAX, 1191,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1192, UINT16_MAX, 1192,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1193, UINT16_MAX, 1193,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1194, UINT16_MAX, 1194,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1195, UINT16_MAX, 1195,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1196, UINT16_MAX, 1196,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1197, UINT16_MAX, 1197,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1198, UINT16_MAX, 1198,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1199, UINT16_MAX, 1199,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1200, UINT16_MAX, 1200,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1201, UINT16_MAX, 1201,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1202, UINT16_MAX, 1202,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1203, UINT16_MAX, 1203,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1204, UINT16_MAX, 1204,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1205, UINT16_MAX, 1205,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1206, UINT16_MAX, 1206,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1207, UINT16_MAX, 1207,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1208, UINT16_MAX, 1208,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1209, UINT16_MAX, 1209,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1210, UINT16_MAX, 1210,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1211, UINT16_MAX, 1211,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1212, UINT16_MAX, 1212,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8451, UINT16_MAX,
+        8451, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8452, UINT16_MAX,
+        8452, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8453, UINT16_MAX,
+        8453, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8454, UINT16_MAX,
+        8454, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8455, UINT16_MAX,
+        8455, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8456, UINT16_MAX,
+        8456, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8457, UINT16_MAX,
+        8457, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8458, UINT16_MAX,
+        8458, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8459, UINT16_MAX,
+        8459, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8460, UINT16_MAX,
+        8460, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8461, UINT16_MAX,
+        8461, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8462, UINT16_MAX,
+        8462, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8463, UINT16_MAX,
+        8463, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8464, UINT16_MAX,
+        8464, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8465, UINT16_MAX,
+        8465, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8466, UINT16_MAX,
+        8466, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8467, UINT16_MAX,
+        8467, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8468, UINT16_MAX,
+        8468, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8469, UINT16_MAX,
+        8469, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8470, UINT16_MAX,
+        8470, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8471, UINT16_MAX,
+        8471, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8472, UINT16_MAX,
+        8472, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8473, UINT16_MAX,
+        8473, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8474, UINT16_MAX,
+        8474, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8475, UINT16_MAX,
+        8475, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8476, UINT16_MAX,
+        8476, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8477, UINT16_MAX,
+        8477, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8478, UINT16_MAX,
+        8478, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8479, UINT16_MAX,
+        8479, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8480, UINT16_MAX,
+        8480, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8481, UINT16_MAX,
+        8481, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8482, UINT16_MAX,
+        8482, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8483, UINT16_MAX,
+        8483, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8484, UINT16_MAX,
+        8484, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8485, UINT16_MAX,
+        8485, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8486, UINT16_MAX,
+        8486, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8487, UINT16_MAX,
+        8487, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8488, UINT16_MAX,
+        8488, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 9405, 9405,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 222, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 228, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 10, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 11, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 12, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 13, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 14, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 15, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 16, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 17, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 18, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 19, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 20, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 21, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 22, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 23, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 24, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 25, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_AN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_PREPEND},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 30, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 31, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 32, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, 9407, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, 9409, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, 9411, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, 9413, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, 9415, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2671, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2676, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2679, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 27, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 28, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 29, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 33, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 34, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32785, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 230, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32786, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 220, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32787, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_AN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_AN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 35, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_COMPAT, 9417, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_COMPAT, 9419, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_COMPAT, 9421, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_COMPAT, 9423, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, 9425, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2685, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, 9427, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2688, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, 9429, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2682, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_PREPEND},
+    {UTF8PROC_CATEGORY_MN, 36, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2691, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9431, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2694, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9433, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2697, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9435, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 7, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32788, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 9, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9437, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9439, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9441, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9443, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9445, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9447, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9449, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9451, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 7, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32789, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2700, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9453, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9455, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32790, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9457, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9459, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9461, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9463, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9465, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9467, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9469, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9471, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9473, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32792, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2704, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9475, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9477, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9479, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32791, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32793, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9481, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9483, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2709, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9485, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32795, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2712, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2716, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9487, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9489, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9491, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32794, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2719, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9493, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 84, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 91, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32796, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2722, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9495, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32799, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2725, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9497, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9499, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9501, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, 2730, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9503, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32797, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32798, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32800, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2733, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2737, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9505, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9507, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9509, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_PREPEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32801, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 9, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32802, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32803, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2740, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9511, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9513, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, 2745, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9515, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9517, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32804, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 9519, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MN, 103, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 107, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 9521, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MN, 118, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 122, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 9523, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 9525, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NOBREAK, 1335, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 216, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9528, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9530, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9532, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9534, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9536, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9538, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 129, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 130, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9540, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 132, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9542, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9544, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, UTF8PROC_DECOMP_TYPE_COMPAT, 9546,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0,
+        0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9548, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, UTF8PROC_DECOMP_TYPE_COMPAT, 9550,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0,
+        0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9552, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9554, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9556, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9558, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9560, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9562, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 9564, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2748, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9566, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32805, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1376, UINT16_MAX, 1376,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1377, UINT16_MAX, 1377,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1378, UINT16_MAX, 1378,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1379, UINT16_MAX, 1379,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1380, UINT16_MAX, 1380,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1381, UINT16_MAX, 1381,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1382, UINT16_MAX, 1382,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1383, UINT16_MAX, 1383,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1384, UINT16_MAX, 1384,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1385, UINT16_MAX, 1385,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1386, UINT16_MAX, 1386,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1387, UINT16_MAX, 1387,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1388, UINT16_MAX, 1388,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1389, UINT16_MAX, 1389,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1390, UINT16_MAX, 1390,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1391, UINT16_MAX, 1391,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1392, UINT16_MAX, 1392,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1393, UINT16_MAX, 1393,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1394, UINT16_MAX, 1394,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1395, UINT16_MAX, 1395,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1396, UINT16_MAX, 1396,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1397, UINT16_MAX, 1397,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1398, UINT16_MAX, 1398,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1399, UINT16_MAX, 1399,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1400, UINT16_MAX, 1400,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1401, UINT16_MAX, 1401,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1402, UINT16_MAX, 1402,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1403, UINT16_MAX, 1403,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1404, UINT16_MAX, 1404,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1405, UINT16_MAX, 1405,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1406, UINT16_MAX, 1406,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1407, UINT16_MAX, 1407,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1408, UINT16_MAX, 1408,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1409, UINT16_MAX, 1409,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1410, UINT16_MAX, 1410,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1411, UINT16_MAX, 1411,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1412, UINT16_MAX, 1412,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1413, UINT16_MAX, 1413,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1414, UINT16_MAX, 1414,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1415, UINT16_MAX, 1415,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8489, UINT16_MAX,
+        1446, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8490, UINT16_MAX,
+        1447, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8491, UINT16_MAX,
+        1448, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8492, UINT16_MAX,
+        1449, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8493, UINT16_MAX,
+        1450, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8494, UINT16_MAX,
+        1451, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8495, UINT16_MAX,
+        1452, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8496, UINT16_MAX,
+        1453, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8497, UINT16_MAX,
+        1454, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8498, UINT16_MAX,
+        1455, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8499, UINT16_MAX,
+        1456, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8500, UINT16_MAX,
+        1457, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8501, UINT16_MAX,
+        1416, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8502, UINT16_MAX,
+        1458, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8503, UINT16_MAX,
+        1459, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8504, UINT16_MAX,
+        1460, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8505, UINT16_MAX,
+        1461, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8506, UINT16_MAX,
+        1462, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8507, UINT16_MAX,
+        1463, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8508, UINT16_MAX,
+        1464, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8509, UINT16_MAX,
+        1465, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8510, UINT16_MAX,
+        1466, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8511, UINT16_MAX,
+        1467, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8512, UINT16_MAX,
+        1468, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8513, UINT16_MAX,
+        1469, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8514, UINT16_MAX,
+        1470, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8515, UINT16_MAX,
+        1471, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8516, UINT16_MAX,
+        1472, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8517, UINT16_MAX,
+        1473, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8518, UINT16_MAX,
+        1474, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8519, UINT16_MAX,
+        1475, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8520, UINT16_MAX,
+        1476, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8521, UINT16_MAX,
+        1477, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8522, UINT16_MAX,
+        1478, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8523, UINT16_MAX,
+        1479, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8524, UINT16_MAX,
+        1480, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8525, UINT16_MAX,
+        1481, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8526, UINT16_MAX,
+        1482, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8527, UINT16_MAX,
+        1483, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8528, UINT16_MAX,
+        1484, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8529, UINT16_MAX,
+        1485, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8530, UINT16_MAX,
+        1486, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8531, UINT16_MAX,
+        1487, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1416, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8532, UINT16_MAX,
+        1488, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8533, UINT16_MAX,
+        1489, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8534, UINT16_MAX,
+        1490, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_L},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, false, 2, 0, UTF8PROC_BOUNDCLASS_L},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, false, 1, 0, UTF8PROC_BOUNDCLASS_V},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_V},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_T},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8535,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8536,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8537,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8538,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8539,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8540,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8541,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8542,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8543,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8544,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8545,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8546,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8547,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8548,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8549,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8550,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8551,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8552,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8553,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8554,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8555,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8556,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8557,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8558,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8559,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8560,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8561,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8562,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8563,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8564,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8565,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8566,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8567,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8568,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8569,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8570,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8571,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8572,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8573,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8574,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8575,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8576,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8577,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8578,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8579,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8580,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8581,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8582,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8583,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8584,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8585,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8586,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8587,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8588,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8589,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8590,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8591,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8592,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8593,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8594,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8595,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8596,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8597,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8598,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8599,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8600,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8601,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8602,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8603,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8604,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8605,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8606,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8607,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8608,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8609,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8610,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8611,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8612,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8613,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8614,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8615,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8616,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8617,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8618,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8619,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX, 8620,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1417, 1417, UINT16_MAX, 1417,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1418, 1418, UINT16_MAX, 1418,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1419, 1419, UINT16_MAX, 1419,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1420, 1420, UINT16_MAX, 1420,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1421, 1421, UINT16_MAX, 1421,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1422, 1422, UINT16_MAX, 1422,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_BN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2751, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9615, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2754, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9617, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2757, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9619, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2760, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9621, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2763, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9623, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2766, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 9625, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32806, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2769, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9627, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2772, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9629, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2775, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2778, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9631, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9633, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 2781, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 9635, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 9, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 955, 8305, UINT16_MAX, 8305,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 957, 8307, UINT16_MAX, 8307,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 969, 8317, UINT16_MAX, 8317,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 972, 8320, UINT16_MAX, 8320,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 973, 8321, UINT16_MAX, 8321,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 981, 8329, UINT16_MAX, 8329,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1004, 8352, UINT16_MAX, 8352,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1445, 8621, UINT16_MAX, 8621,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1446, UINT16_MAX, 1446,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1447, UINT16_MAX, 1447,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1448, UINT16_MAX, 1448,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1449, UINT16_MAX, 1449,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1450, UINT16_MAX, 1450,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1451, UINT16_MAX, 1451,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1452, UINT16_MAX, 1452,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1453, UINT16_MAX, 1453,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1454, UINT16_MAX, 1454,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1455, UINT16_MAX, 1455,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1456, UINT16_MAX, 1456,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1457, UINT16_MAX, 1457,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1416, UINT16_MAX, 1416,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1458, UINT16_MAX, 1458,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1459, UINT16_MAX, 1459,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1460, UINT16_MAX, 1460,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1461, UINT16_MAX, 1461,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1462, UINT16_MAX, 1462,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1463, UINT16_MAX, 1463,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1464, UINT16_MAX, 1464,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1465, UINT16_MAX, 1465,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1466, UINT16_MAX, 1466,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1467, UINT16_MAX, 1467,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1468, UINT16_MAX, 1468,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1469, UINT16_MAX, 1469,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1470, UINT16_MAX, 1470,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1471, UINT16_MAX, 1471,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1472, UINT16_MAX, 1472,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1473, UINT16_MAX, 1473,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1474, UINT16_MAX, 1474,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1475, UINT16_MAX, 1475,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1476, UINT16_MAX, 1476,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1477, UINT16_MAX, 1477,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1478, UINT16_MAX, 1478,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1479, UINT16_MAX, 1479,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1480, UINT16_MAX, 1480,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1481, UINT16_MAX, 1481,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1482, UINT16_MAX, 1482,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1483, UINT16_MAX, 1483,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1484, UINT16_MAX, 1484,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1485, UINT16_MAX, 1485,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1486, UINT16_MAX, 1486,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1487, UINT16_MAX, 1487,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1488, UINT16_MAX, 1488,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1489, UINT16_MAX, 1489,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1490, UINT16_MAX, 1490,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1491, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1492, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1493, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1494, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1495, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1496, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1497, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1498, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1499, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1500, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1501, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1502, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1503, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1504, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1505, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1506, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1507, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1508, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1509, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1510, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1511, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 0, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1512, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1513, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1514, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 4, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 485, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 486, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1515, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 6, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 10, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 12, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 355, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 14, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 479, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1516, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1517, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 15, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 19, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 20, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1518, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 493, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 21, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1519, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 846, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 847, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 848, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 863, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 864, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 8, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 17, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 20, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 21, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 846, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 847, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 859, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 863, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 864, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 968, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8622, UINT16_MAX,
+        8622, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8623, UINT16_MAX,
+        8623, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8624, UINT16_MAX,
+        8624, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1520, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 2, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1521, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 94, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 5, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1522, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1523, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1524, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 491, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 490, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1525, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1526, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1527, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1528, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1529, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1530, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1531, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1532, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 494, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1533, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1534, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 495, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1535, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1536, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 505, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1537, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 778, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 513, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1538, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 514, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 779, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 25, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1539, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 1540, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 517, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 852, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 214, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9733, 1543, UINT16_MAX, 1543, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9736, UINT16_MAX, 8625, UINT16_MAX, 8625,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9738, 1548, UINT16_MAX, 1548, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9741, UINT16_MAX, 8626, UINT16_MAX, 8626,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9743, 1553, UINT16_MAX, 1553, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9746, UINT16_MAX, 8627, UINT16_MAX, 8627,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9748, 1558, UINT16_MAX, 1558, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9751, UINT16_MAX, 8628, UINT16_MAX, 8628,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9753, 1563, UINT16_MAX, 1563, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9756, UINT16_MAX, 8629, UINT16_MAX, 8629,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9758, 1568, UINT16_MAX, 1568, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9761, UINT16_MAX, 8630, UINT16_MAX, 8630,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9763, 1573, UINT16_MAX, 1573, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9766, UINT16_MAX, 8631, UINT16_MAX, 8631,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9768, 1578, UINT16_MAX, 1578, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9771, UINT16_MAX, 8632, UINT16_MAX, 8632,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9773, 1583, UINT16_MAX, 1583, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9776, UINT16_MAX, 8633, UINT16_MAX, 8633,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9778, 1588, UINT16_MAX, 1588, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9781, UINT16_MAX, 8634, UINT16_MAX, 8634,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9783, 1593, UINT16_MAX, 1593, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9786, UINT16_MAX, 8635, UINT16_MAX, 8635,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9788, 1598, UINT16_MAX, 1598, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9791, UINT16_MAX, 8636, UINT16_MAX, 8636,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9793, 1603, UINT16_MAX, 1603, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9796, UINT16_MAX, 8637, UINT16_MAX, 8637,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9798, 1608, UINT16_MAX, 1608, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9801, UINT16_MAX, 8638, UINT16_MAX, 8638,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9803, 1613, UINT16_MAX, 1613, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9806, UINT16_MAX, 8639, UINT16_MAX, 8639,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9808, 1618, UINT16_MAX, 1618, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9811, UINT16_MAX, 8640, UINT16_MAX, 8640,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9813, 1623, UINT16_MAX, 1623, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9816, UINT16_MAX, 8641, UINT16_MAX, 8641,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9818, 1628, UINT16_MAX, 1628, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9821, UINT16_MAX, 8642, UINT16_MAX, 8642,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9823, 1633, UINT16_MAX, 1633, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9826, UINT16_MAX, 8643, UINT16_MAX, 8643,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9828, 1638, UINT16_MAX, 1638, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9831, UINT16_MAX, 8644, UINT16_MAX, 8644,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9833, 1643, UINT16_MAX, 1643, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9836, UINT16_MAX, 8645, UINT16_MAX, 8645,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9838, 1648, UINT16_MAX, 1648, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9841, UINT16_MAX, 8646, UINT16_MAX, 8646,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9843, 1653, UINT16_MAX, 1653, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9846, UINT16_MAX, 8647, UINT16_MAX, 8647,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9848, 1658, UINT16_MAX, 1658, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9851, UINT16_MAX, 8648, UINT16_MAX, 8648,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9853, 1663, UINT16_MAX, 1663, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9856, UINT16_MAX, 8649, UINT16_MAX, 8649,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9858, 1668, UINT16_MAX, 1668, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9861, UINT16_MAX, 8650, UINT16_MAX, 8650,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9863, 1673, UINT16_MAX, 1673, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9866, UINT16_MAX, 8651, UINT16_MAX, 8651,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9868, 1678, UINT16_MAX, 1678, UINT16_MAX,
+        2884, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9871, UINT16_MAX, 8652, UINT16_MAX, 8652,
+        2887, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9873, 1683, UINT16_MAX, 1683, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9876, UINT16_MAX, 8653, UINT16_MAX, 8653,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9878, 1688, UINT16_MAX, 1688, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9881, UINT16_MAX, 8654, UINT16_MAX, 8654,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9883, 1693, UINT16_MAX, 1693, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9886, UINT16_MAX, 8655, UINT16_MAX, 8655,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9888, 1698, UINT16_MAX, 1698, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9891, UINT16_MAX, 8656, UINT16_MAX, 8656,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9893, 1703, UINT16_MAX, 1703, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9896, UINT16_MAX, 8657, UINT16_MAX, 8657,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9898, 1708, UINT16_MAX, 1708, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9901, UINT16_MAX, 8658, UINT16_MAX, 8658,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9903, 1713, UINT16_MAX, 1713, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9906, UINT16_MAX, 8659, UINT16_MAX, 8659,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9908, 1718, UINT16_MAX, 1718, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9911, UINT16_MAX, 8660, UINT16_MAX, 8660,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9913, 1723, UINT16_MAX, 1723, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9916, UINT16_MAX, 8661, UINT16_MAX, 8661,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9918, 1728, UINT16_MAX, 1728, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9921, UINT16_MAX, 8662, UINT16_MAX, 8662,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9923, 1733, UINT16_MAX, 1733, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9926, UINT16_MAX, 8663, UINT16_MAX, 8663,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9928, 1738, UINT16_MAX, 1738, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9931, UINT16_MAX, 8664, UINT16_MAX, 8664,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9933, 1743, UINT16_MAX, 1743, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9936, UINT16_MAX, 8665, UINT16_MAX, 8665,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9938, 1748, UINT16_MAX, 1748, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9941, UINT16_MAX, 8666, UINT16_MAX, 8666,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9943, 1753, UINT16_MAX, 1753, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9946, UINT16_MAX, 8667, UINT16_MAX, 8667,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9948, 1758, UINT16_MAX, 1758, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9951, UINT16_MAX, 8668, UINT16_MAX, 8668,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9953, 1763, UINT16_MAX, 1763, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9956, UINT16_MAX, 8669, UINT16_MAX, 8669,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9958, 1768, UINT16_MAX, 1768, UINT16_MAX,
+        3006, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9961, UINT16_MAX, 8670, UINT16_MAX, 8670,
+        3009, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9963, 1773, UINT16_MAX, 1773, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9966, UINT16_MAX, 8671, UINT16_MAX, 8671,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9968, 1778, UINT16_MAX, 1778, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9971, UINT16_MAX, 8672, UINT16_MAX, 8672,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9973, 1783, UINT16_MAX, 1783, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9976, UINT16_MAX, 8673, UINT16_MAX, 8673,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9978, 1788, UINT16_MAX, 1788, UINT16_MAX,
+        3024, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9981, UINT16_MAX, 8674, UINT16_MAX, 8674,
+        3027, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9983, 1793, UINT16_MAX, 1793, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9986, UINT16_MAX, 8675, UINT16_MAX, 8675,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9988, 1798, UINT16_MAX, 1798, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9991, UINT16_MAX, 8676, UINT16_MAX, 8676,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9993, 1803, UINT16_MAX, 1803, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 9996, UINT16_MAX, 8677, UINT16_MAX, 8677,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 9998, 1808, UINT16_MAX, 1808, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10001, UINT16_MAX, 8678, UINT16_MAX, 8678,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10003, 1813, UINT16_MAX, 1813, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10006, UINT16_MAX, 8679, UINT16_MAX, 8679,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10008, 1818, UINT16_MAX, 1818, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10011, UINT16_MAX, 8680, UINT16_MAX, 8680,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10013, 1823, UINT16_MAX, 1823, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10016, UINT16_MAX, 8681, UINT16_MAX, 8681,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10018, 1828, UINT16_MAX, 1828, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10021, UINT16_MAX, 8682, UINT16_MAX, 8682,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10023, 1833, UINT16_MAX, 1833, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10026, UINT16_MAX, 8683, UINT16_MAX, 8683,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10028, 1838, UINT16_MAX, 1838, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10031, UINT16_MAX, 8684, UINT16_MAX, 8684,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10033, 1843, UINT16_MAX, 1843, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10036, UINT16_MAX, 8685, UINT16_MAX, 8685,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10038, 1848, UINT16_MAX, 1848, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10041, UINT16_MAX, 8686, UINT16_MAX, 8686,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10043, 1853, UINT16_MAX, 1853, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10046, UINT16_MAX, 8687, UINT16_MAX, 8687,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10048, 1858, UINT16_MAX, 1858, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10051, UINT16_MAX, 8688, UINT16_MAX, 8688,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10053, 1863, UINT16_MAX, 1863, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10056, UINT16_MAX, 8689, UINT16_MAX, 8689,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10058, 1868, UINT16_MAX, 1868, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10061, UINT16_MAX, 8690, UINT16_MAX, 8690,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10063, 1873, UINT16_MAX, 1873, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10066, UINT16_MAX, 8691, UINT16_MAX, 8691,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10068, 1878, UINT16_MAX, 1878, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10071, UINT16_MAX, 8692, UINT16_MAX, 8692,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10073, 1883, UINT16_MAX, 1883, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10076, UINT16_MAX, 8693, UINT16_MAX, 8693,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10078, 1888, UINT16_MAX, 1888, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10081, UINT16_MAX, 8694, UINT16_MAX, 8694,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10083, 1893, UINT16_MAX, 1893, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10086, UINT16_MAX, 8695, UINT16_MAX, 8695,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10088, 1898, UINT16_MAX, 1898, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10091, UINT16_MAX, 8696, UINT16_MAX, 8696,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10093, 1903, UINT16_MAX, 1903, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10096, UINT16_MAX, 8697, UINT16_MAX, 8697,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10098, 1908, UINT16_MAX, 1908, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10101, UINT16_MAX, 8698, UINT16_MAX, 8698,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10103, 1913, UINT16_MAX, 1913, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10106, UINT16_MAX, 8699, UINT16_MAX, 8699,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10108, 10108, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10110, 10110, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10112, 10112, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10114, 10114, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 10116, 10116,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10118, 1783, 8673, UINT16_MAX, 8673,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 8322, UINT16_MAX, 8700,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10120, 1930, UINT16_MAX, 1930, UINT16_MAX,
+        3241, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10123, UINT16_MAX, 8701, UINT16_MAX, 8701,
+        3250, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10125, 1935, UINT16_MAX, 1935, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10128, UINT16_MAX, 8702, UINT16_MAX, 8702,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10130, 1940, UINT16_MAX, 1940, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10133, UINT16_MAX, 8703, UINT16_MAX, 8703,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10135, 1945, UINT16_MAX, 1945, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10138, UINT16_MAX, 8704, UINT16_MAX, 8704,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10140, 1950, UINT16_MAX, 1950, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10143, UINT16_MAX, 8705, UINT16_MAX, 8705,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10145, 1955, UINT16_MAX, 1955, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10148, UINT16_MAX, 8706, UINT16_MAX, 8706,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10150, 1960, UINT16_MAX, 1960, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10153, UINT16_MAX, 8707, UINT16_MAX, 8707,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10155, 1965, UINT16_MAX, 1965, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10158, UINT16_MAX, 8708, UINT16_MAX, 8708,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10160, 1970, UINT16_MAX, 1970, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10163, UINT16_MAX, 8709, UINT16_MAX, 8709,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10165, 1975, UINT16_MAX, 1975, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10168, UINT16_MAX, 8710, UINT16_MAX, 8710,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10170, 1980, UINT16_MAX, 1980, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10173, UINT16_MAX, 8711, UINT16_MAX, 8711,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10175, 1985, UINT16_MAX, 1985, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10178, UINT16_MAX, 8712, UINT16_MAX, 8712,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10180, 1990, UINT16_MAX, 1990, UINT16_MAX,
+        3455, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10183, UINT16_MAX, 8713, UINT16_MAX, 8713,
+        3458, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10185, 1995, UINT16_MAX, 1995, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10188, UINT16_MAX, 8714, UINT16_MAX, 8714,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10190, 2000, UINT16_MAX, 2000, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10193, UINT16_MAX, 8715, UINT16_MAX, 8715,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10195, 2005, UINT16_MAX, 2005, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10198, UINT16_MAX, 8716, UINT16_MAX, 8716,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10200, 2010, UINT16_MAX, 2010, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10203, UINT16_MAX, 8717, UINT16_MAX, 8717,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10205, 2015, UINT16_MAX, 2015, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10208, UINT16_MAX, 8718, UINT16_MAX, 8718,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10210, 2020, UINT16_MAX, 2020, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10213, UINT16_MAX, 8719, UINT16_MAX, 8719,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10215, 2025, UINT16_MAX, 2025, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10218, UINT16_MAX, 8720, UINT16_MAX, 8720,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10220, 2030, UINT16_MAX, 2030, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10223, UINT16_MAX, 8721, UINT16_MAX, 8721,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10225, 2035, UINT16_MAX, 2035, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10228, UINT16_MAX, 8722, UINT16_MAX, 8722,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10230, 2040, UINT16_MAX, 2040, UINT16_MAX,
+        3559, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10233, UINT16_MAX, 8723, UINT16_MAX, 8723,
+        3562, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10235, 2045, UINT16_MAX, 2045, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10238, UINT16_MAX, 8724, UINT16_MAX, 8724,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10240, 2050, UINT16_MAX, 2050, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10243, UINT16_MAX, 8725, UINT16_MAX, 8725,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10245, 2055, UINT16_MAX, 2055, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10248, UINT16_MAX, 8726, UINT16_MAX, 8726,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10250, 2060, UINT16_MAX, 2060, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10253, UINT16_MAX, 8727, UINT16_MAX, 8727,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10255, 2065, UINT16_MAX, 2065, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10258, UINT16_MAX, 8728, UINT16_MAX, 8728,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10260, 2070, UINT16_MAX, 2070, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10263, UINT16_MAX, 8729, UINT16_MAX, 8729,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10265, 2075, UINT16_MAX, 2075, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10268, UINT16_MAX, 8730, UINT16_MAX, 8730,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10270, 2080, UINT16_MAX, 2080, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10273, UINT16_MAX, 8731, UINT16_MAX, 8731,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10275, 2085, UINT16_MAX, 2085, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10278, UINT16_MAX, 8732, UINT16_MAX, 8732,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10280, 2090, UINT16_MAX, 2090, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10283, UINT16_MAX, 8733, UINT16_MAX, 8733,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10285, 2095, UINT16_MAX, 2095, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10288, UINT16_MAX, 8734, UINT16_MAX, 8734,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10290, 2100, UINT16_MAX, 2100, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10293, UINT16_MAX, 8735, UINT16_MAX, 8735,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10295, 2105, UINT16_MAX, 2105, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10298, UINT16_MAX, 8736, UINT16_MAX, 8736,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10300, 2110, UINT16_MAX, 2110, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10303, UINT16_MAX, 8737, UINT16_MAX, 8737,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10305, 2115, UINT16_MAX, 2115, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10308, UINT16_MAX, 8738, UINT16_MAX, 8738,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10310, 2120, UINT16_MAX, 2120, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10313, UINT16_MAX, 8739, UINT16_MAX, 8739,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10315, 2125, UINT16_MAX, 2125, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10318, UINT16_MAX, 8740, UINT16_MAX, 8740,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10320, 2130, UINT16_MAX, 2130, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10323, UINT16_MAX, 8741, UINT16_MAX, 8741,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10325, 2135, UINT16_MAX, 2135, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10328, UINT16_MAX, 8742, UINT16_MAX, 8742,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10330, 2140, UINT16_MAX, 2140, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10333, UINT16_MAX, 8743, UINT16_MAX, 8743,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10335, 2145, UINT16_MAX, 2145, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10338, UINT16_MAX, 8744, UINT16_MAX, 8744,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10340, 2150, UINT16_MAX, 2150, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10343, UINT16_MAX, 8745, UINT16_MAX, 8745,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 2153, UINT16_MAX, 2153,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8746, UINT16_MAX,
+        8746, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 2154, UINT16_MAX, 2154,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8747, UINT16_MAX,
+        8747, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 2155, UINT16_MAX, 2155,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8748, UINT16_MAX,
+        8748, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10348, UINT16_MAX, 8749, UINT16_MAX, 8749,
+        3761, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10350, UINT16_MAX, 8750, UINT16_MAX, 8750,
+        3814, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10352, UINT16_MAX, 8751, UINT16_MAX, 8751,
+        4793, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10354, UINT16_MAX, 8752, UINT16_MAX, 8752,
+        4796, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10356, UINT16_MAX, 8753, UINT16_MAX, 8753,
+        4799, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10358, UINT16_MAX, 8754, UINT16_MAX, 8754,
+        4802, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10360, UINT16_MAX, 8755, UINT16_MAX, 8755,
+        4805, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10362, UINT16_MAX, 8756, UINT16_MAX, 8756,
+        4808, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10364, 2174, UINT16_MAX, 2174, UINT16_MAX,
+        3867, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10367, 2177, UINT16_MAX, 2177, UINT16_MAX,
+        3920, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10370, 2180, UINT16_MAX, 2180, UINT16_MAX,
+        4811, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10373, 2183, UINT16_MAX, 2183, UINT16_MAX,
+        4814, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10376, 2186, UINT16_MAX, 2186, UINT16_MAX,
+        4817, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10379, 2189, UINT16_MAX, 2189, UINT16_MAX,
+        4820, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10382, 2192, UINT16_MAX, 2192, UINT16_MAX,
+        4823, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10385, 2195, UINT16_MAX, 2195, UINT16_MAX,
+        4826, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10388, UINT16_MAX, 8757, UINT16_MAX, 8757,
+        3973, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10390, UINT16_MAX, 8758, UINT16_MAX, 8758,
+        3977, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10392, UINT16_MAX, 8759, UINT16_MAX, 8759,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10394, UINT16_MAX, 8760, UINT16_MAX, 8760,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10396, UINT16_MAX, 8761, UINT16_MAX, 8761,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10398, UINT16_MAX, 8762, UINT16_MAX, 8762,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10400, 2210, UINT16_MAX, 2210, UINT16_MAX,
+        3981, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10403, 2213, UINT16_MAX, 2213, UINT16_MAX,
+        3985, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10406, 2216, UINT16_MAX, 2216, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10409, 2219, UINT16_MAX, 2219, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10412, 2222, UINT16_MAX, 2222, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10415, 2225, UINT16_MAX, 2225, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10418, UINT16_MAX, 8763, UINT16_MAX, 8763,
+        3989, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10420, UINT16_MAX, 8764, UINT16_MAX, 8764,
+        4042, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10422, UINT16_MAX, 8765, UINT16_MAX, 8765,
+        4829, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10424, UINT16_MAX, 8766, UINT16_MAX, 8766,
+        4832, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10426, UINT16_MAX, 8767, UINT16_MAX, 8767,
+        4835, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10428, UINT16_MAX, 8768, UINT16_MAX, 8768,
+        4838, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10430, UINT16_MAX, 8769, UINT16_MAX, 8769,
+        4841, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10432, UINT16_MAX, 8770, UINT16_MAX, 8770,
+        4844, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10434, 2244, UINT16_MAX, 2244, UINT16_MAX,
+        4095, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10437, 2247, UINT16_MAX, 2247, UINT16_MAX,
+        4148, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10440, 2250, UINT16_MAX, 2250, UINT16_MAX,
+        4847, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10443, 2253, UINT16_MAX, 2253, UINT16_MAX,
+        4850, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10446, 2256, UINT16_MAX, 2256, UINT16_MAX,
+        4853, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10449, 2259, UINT16_MAX, 2259, UINT16_MAX,
+        4856, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10452, 2262, UINT16_MAX, 2262, UINT16_MAX,
+        4859, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10455, 2265, UINT16_MAX, 2265, UINT16_MAX,
+        4862, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10458, UINT16_MAX, 8771, UINT16_MAX, 8771,
+        4201, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10460, UINT16_MAX, 8772, UINT16_MAX, 8772,
+        4253, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10462, UINT16_MAX, 8773, UINT16_MAX, 8773,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10464, UINT16_MAX, 8774, UINT16_MAX, 8774,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10466, UINT16_MAX, 8775, UINT16_MAX, 8775,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10468, UINT16_MAX, 8776, UINT16_MAX, 8776,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10470, UINT16_MAX, 8777, UINT16_MAX, 8777,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10472, UINT16_MAX, 8778, UINT16_MAX, 8778,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10474, 2284, UINT16_MAX, 2284, UINT16_MAX,
+        4305, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10477, 2287, UINT16_MAX, 2287, UINT16_MAX,
+        4357, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10480, 2290, UINT16_MAX, 2290, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10483, 2293, UINT16_MAX, 2293, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10486, 2296, UINT16_MAX, 2296, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10489, 2299, UINT16_MAX, 2299, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10492, 2302, UINT16_MAX, 2302, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10495, 2305, UINT16_MAX, 2305, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10498, UINT16_MAX, 8779, UINT16_MAX, 8779,
+        4409, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10500, UINT16_MAX, 8780, UINT16_MAX, 8780,
+        4413, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10502, UINT16_MAX, 8781, UINT16_MAX, 8781,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10504, UINT16_MAX, 8782, UINT16_MAX, 8782,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10506, UINT16_MAX, 8783, UINT16_MAX, 8783,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10508, UINT16_MAX, 8784, UINT16_MAX, 8784,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10510, 2320, UINT16_MAX, 2320, UINT16_MAX,
+        4417, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10513, 2323, UINT16_MAX, 2323, UINT16_MAX,
+        4421, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10516, 2326, UINT16_MAX, 2326, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10519, 2329, UINT16_MAX, 2329, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10522, 2332, UINT16_MAX, 2332, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10525, 2335, UINT16_MAX, 2335, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10528, 10528, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, 4425, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10530, UINT16_MAX, 8785, UINT16_MAX, 8785,
+        4477, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10532, 18726, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10537, UINT16_MAX, 8786, UINT16_MAX, 8786,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10539, 18733, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10544, UINT16_MAX, 8787, UINT16_MAX, 8787,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10546, 18740, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10551, UINT16_MAX, 8788, UINT16_MAX, 8788,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10553, 2363, UINT16_MAX, 2363, UINT16_MAX,
+        4529, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10556, 2366, UINT16_MAX, 2366, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10559, 2369, UINT16_MAX, 2369, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10562, 2372, UINT16_MAX, 2372, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10565, UINT16_MAX, 8789, UINT16_MAX, 8789,
+        4581, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10567, UINT16_MAX, 8790, UINT16_MAX, 8790,
+        4634, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10569, UINT16_MAX, 8791, UINT16_MAX, 8791,
+        4865, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10571, UINT16_MAX, 8792, UINT16_MAX, 8792,
+        4868, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10573, UINT16_MAX, 8793, UINT16_MAX, 8793,
+        4871, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10575, UINT16_MAX, 8794, UINT16_MAX, 8794,
+        4874, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10577, UINT16_MAX, 8795, UINT16_MAX, 8795,
+        4877, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10579, UINT16_MAX, 8796, UINT16_MAX, 8796,
+        4880, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10581, 2391, UINT16_MAX, 2391, UINT16_MAX,
+        4687, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10584, 2394, UINT16_MAX, 2394, UINT16_MAX,
+        4740, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10587, 2397, UINT16_MAX, 2397, UINT16_MAX,
+        4883, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10590, 2400, UINT16_MAX, 2400, UINT16_MAX,
+        4886, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10593, 2403, UINT16_MAX, 2403, UINT16_MAX,
+        4889, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10596, 2406, UINT16_MAX, 2406, UINT16_MAX,
+        4892, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10599, 2409, UINT16_MAX, 2409, UINT16_MAX,
+        4895, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10602, 2412, UINT16_MAX, 2412, UINT16_MAX,
+        4898, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10605, UINT16_MAX, 8797, UINT16_MAX, 8797,
+        4901, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 820, UINT16_MAX, 8798, UINT16_MAX, 8798,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10607, UINT16_MAX, 8799, UINT16_MAX, 8799,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 824, UINT16_MAX, 8800, UINT16_MAX, 8800,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10609, UINT16_MAX, 8801, UINT16_MAX, 8801,
+        4910, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 827, UINT16_MAX, 8802, UINT16_MAX, 8802,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10611, UINT16_MAX, 8803, UINT16_MAX, 8803,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 830, UINT16_MAX, 8804, UINT16_MAX, 8804,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10613, UINT16_MAX, 8805, UINT16_MAX, 8805,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 833, UINT16_MAX, 8806, UINT16_MAX, 8806,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10615, UINT16_MAX, 8807, UINT16_MAX, 8807,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 836, UINT16_MAX, 8808, UINT16_MAX, 8808,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10617, UINT16_MAX, 8809, UINT16_MAX, 8809,
+        5030, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 839, UINT16_MAX, 8810, UINT16_MAX, 8810,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10619, 10621, 8811, UINT16_MAX, 8811,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10623, 10625, 8812, UINT16_MAX, 8812,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10627, 10629, 8813, UINT16_MAX, 8813,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10631, 10633, 8814, UINT16_MAX, 8814,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10635, 10637, 8815, UINT16_MAX, 8815,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10639, 10641, 8816, UINT16_MAX, 8816,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10643, 10645, 8817, UINT16_MAX, 8817,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10647, 10649, 8818, UINT16_MAX, 8818,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10651, 10621, UINT16_MAX, 8819, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10653, 10625, UINT16_MAX, 8820, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10655, 10629, UINT16_MAX, 8821, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10657, 10633, UINT16_MAX, 8822, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10659, 10637, UINT16_MAX, 8823, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10661, 10641, UINT16_MAX, 8824, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10663, 10645, UINT16_MAX, 8825, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10665, 10649, UINT16_MAX, 8826, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10667, 10669, 8827, UINT16_MAX, 8827,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10671, 10673, 8828, UINT16_MAX, 8828,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10675, 10677, 8829, UINT16_MAX, 8829,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10679, 10681, 8830, UINT16_MAX, 8830,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10683, 10685, 8831, UINT16_MAX, 8831,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10687, 10689, 8832, UINT16_MAX, 8832,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10691, 10693, 8833, UINT16_MAX, 8833,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10695, 10697, 8834, UINT16_MAX, 8834,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10699, 10669, UINT16_MAX, 8835, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10701, 10673, UINT16_MAX, 8836, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10703, 10677, UINT16_MAX, 8837, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10705, 10681, UINT16_MAX, 8838, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10707, 10685, UINT16_MAX, 8839, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10709, 10689, UINT16_MAX, 8840, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10711, 10693, UINT16_MAX, 8841, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10713, 10697, UINT16_MAX, 8842, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10715, 10717, 8843, UINT16_MAX, 8843,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10719, 10721, 8844, UINT16_MAX, 8844,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10723, 10725, 8845, UINT16_MAX, 8845,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10727, 10729, 8846, UINT16_MAX, 8846,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10731, 10733, 8847, UINT16_MAX, 8847,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10735, 10737, 8848, UINT16_MAX, 8848,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10739, 10741, 8849, UINT16_MAX, 8849,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10743, 10745, 8850, UINT16_MAX, 8850,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10747, 10717, UINT16_MAX, 8851, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10749, 10721, UINT16_MAX, 8852, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10751, 10725, UINT16_MAX, 8853, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10753, 10729, UINT16_MAX, 8854, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10755, 10733, UINT16_MAX, 8855, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10757, 10737, UINT16_MAX, 8856, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10759, 10741, UINT16_MAX, 8857, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10761, 10745, UINT16_MAX, 8858, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10763, UINT16_MAX, 8859, UINT16_MAX, 8859,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10765, UINT16_MAX, 8860, UINT16_MAX, 8860,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10767, 10769, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10771, 10773, 8861, UINT16_MAX, 8861,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10775, 10777, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10779, 10779, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, 4907, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10781, 18975, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10786, 2596, UINT16_MAX, 2596, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10789, 2599, UINT16_MAX, 2599, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10792, 2602, UINT16_MAX, 2602, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 2603, 2604, UINT16_MAX, 2604, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10797, 10773, UINT16_MAX, 8862, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10799,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 807, 807, 7217, UINT16_MAX, 7217,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10799,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, 4919, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10801,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 10803, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10805, 10807, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10809, 10811, 8863, UINT16_MAX, 8863,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10813, 10815, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10817, 10817, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, 4916, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10819, 19013, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10824, 2634, UINT16_MAX, 2634, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 2635, 2636, UINT16_MAX, 2636, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10829, 2639, UINT16_MAX, 2639, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 2640, 2641, UINT16_MAX, 2641, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10834, 10811, UINT16_MAX, 8864, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 10836, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 10838, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 10840, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10842, UINT16_MAX, 8865, UINT16_MAX, 8865,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10844, UINT16_MAX, 8866, UINT16_MAX, 8866,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10846, 19040, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 2659, 17226, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10852, 10852, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10854, 19048, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10859, 2669, UINT16_MAX, 2669, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10862, 2672, UINT16_MAX, 2672, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10865, 2675, UINT16_MAX, 2675, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 2676, 2677, UINT16_MAX, 2677, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 10870, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 10872, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 10874, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10876, UINT16_MAX, 8867, UINT16_MAX, 8867,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10878, UINT16_MAX, 8868, UINT16_MAX, 8868,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10880, 19074, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 2693, 17267, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10886, 10886, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10888, UINT16_MAX, 8869, UINT16_MAX, 8869,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10890, 10890, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10892, 19086, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10897, 2707, UINT16_MAX, 2707, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10900, 2710, UINT16_MAX, 2710, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10903, 2713, UINT16_MAX, 2713, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 2714, 2715, UINT16_MAX, 2715, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10908, 2718, UINT16_MAX, 2718, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 10911, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 2721, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 2722, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10915, 10917, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10919, 10921, 8870, UINT16_MAX, 8870,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10923, 10925, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10927, 10927, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, 5036, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, 10929, 19123, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10934, 2744, UINT16_MAX, 2744, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 2745, 2746, UINT16_MAX, 2746, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 10939, 2749, UINT16_MAX, 2749, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 2750, 2751, UINT16_MAX, 2751, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LT, 0, UTF8PROC_BIDI_CLASS_L, 0, 10944, 10921, UINT16_MAX, 8871, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, 2754, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10947,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, 4971, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ZS, 0, UTF8PROC_BIDI_CLASS_WS, 0, 2757, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ZS, 0, UTF8PROC_BIDI_CLASS_WS, 0, 2758, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ZS, 0, UTF8PROC_BIDI_CLASS_WS, UTF8PROC_DECOMP_TYPE_COMPAT, 26, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ZS, 0, UTF8PROC_BIDI_CLASS_WS, UTF8PROC_DECOMP_TYPE_NOBREAK, 26, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_BN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_BN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_ZWJ},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NOBREAK, 2759,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10952,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PI, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PF, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 2762, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10955,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19149,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ZL, 0, UTF8PROC_BIDI_CLASS_WS, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_ZP, 0, UTF8PROC_BIDI_CLASS_B, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_LRE, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_RLE, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_PDF, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_LRO, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_RLO, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_COMPAT, 10960,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_COMPAT, 19154,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10965,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19159,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10970,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10972,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_CS, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10974,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10976,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 10978,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27364,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_LRI, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_RLI, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_FSI, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_PDI, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 2792, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 8, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 2793, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 2794, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 2795, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 2796, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 2797, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUPER, 2798, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ES, UTF8PROC_DECOMP_TYPE_SUPER, 2799, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ES, UTF8PROC_DECOMP_TYPE_SUPER, 2800, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUPER, 2801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUPER, 2802, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUPER, 2803, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 13, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 2792, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 38, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 31, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 32, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 2793, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 2794, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 2795, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 2796, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 2797, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_SUB, 2798, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ES, UTF8PROC_DECOMP_TYPE_SUB, 2799, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ES, UTF8PROC_DECOMP_TYPE_SUB, 2800, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUB, 2801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUB, 2802, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUB, 2803, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 0, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 4, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 14, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 23, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 485, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 7, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 10, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 11, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 12, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 13, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 15, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 18, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 19, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_COMPAT, 10996,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19190,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19193,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2812, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 11005,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19199,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19202,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 2821, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 11014,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 6, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1498, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 277, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1499, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1502, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 11, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1504, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 11016,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1507, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2826, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1508, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUPER, 11019, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19213,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUPER, 11024, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2834, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 2835, 866, UINT16_MAX, 866, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 1501, 10, UINT16_MAX, 10, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, 2836, 65, UINT16_MAX, 65, UINT16_MAX,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1493, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 4, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1495, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2837, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 2838, UINT16_MAX, 2838,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1503, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 14, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 2839, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 2840, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 2841, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 2842, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 8, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19227,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 858, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 847, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2846, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2847, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FONT, 2848, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1494, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 3, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 8, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 9, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8872, UINT16_MAX,
+        8872, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19233,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19236,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 27431,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19243,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19246,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19249,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19252,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19255,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19258,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19261,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19264,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19267,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19270,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19273,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19276,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 11087,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 1499, 2897,
+        UINT16_MAX, 2897, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11090, 2900,
+        UINT16_MAX, 2900, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19285, 2904,
+        UINT16_MAX, 2904, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11097, 2907,
+        UINT16_MAX, 2907, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 2908, 2909,
+        UINT16_MAX, 2909, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11102, 2912,
+        UINT16_MAX, 2912, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19297, 2916,
+        UINT16_MAX, 2916, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 27493, 2921,
+        UINT16_MAX, 2921, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11114, 2924,
+        UINT16_MAX, 2924, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 2925, 2926,
+        UINT16_MAX, 2926, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11119, 2929,
+        UINT16_MAX, 2929, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19314, 2933,
+        UINT16_MAX, 2933, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 1502, 2934,
+        UINT16_MAX, 2934, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 2812, 2935,
+        UINT16_MAX, 2935, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 1494, 2936,
+        UINT16_MAX, 2936, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 1503, 2937,
+        UINT16_MAX, 2937, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 8, UINT16_MAX,
+        8873, UINT16_MAX, 8873, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11130, UINT16_MAX,
+        8874, UINT16_MAX, 8874, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19324, UINT16_MAX,
+        8875, UINT16_MAX, 8875, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11135, UINT16_MAX,
+        8876, UINT16_MAX, 8876, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21, UINT16_MAX,
+        8877, UINT16_MAX, 8877, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11137, UINT16_MAX,
+        8878, UINT16_MAX, 8878, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19331, UINT16_MAX,
+        8879, UINT16_MAX, 8879, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 27526, UINT16_MAX,
+        8880, UINT16_MAX, 8880, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11146, UINT16_MAX,
+        8881, UINT16_MAX, 8881, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23, UINT16_MAX,
+        8882, UINT16_MAX, 8882, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11148, UINT16_MAX,
+        8883, UINT16_MAX, 8883, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19342, UINT16_MAX,
+        8884, UINT16_MAX, 8884, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 11, UINT16_MAX,
+        8885, UINT16_MAX, 8885, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 2, UINT16_MAX,
+        8886, UINT16_MAX, 8886, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3, UINT16_MAX,
+        8887, UINT16_MAX, 8887, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12, UINT16_MAX,
+        8888, UINT16_MAX, 8888, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 2961, UINT16_MAX, 2961,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8889, UINT16_MAX,
+        8889, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FRACTION, 19346,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5039, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5042, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5045, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11157, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11159, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11161, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11163, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11165, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11167, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5048, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5054, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5051, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5057, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11169, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5060, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11171, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5063, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11173, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5066, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11175, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5069, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11177, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 11179,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19373,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 11184,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19378,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5072, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11189, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5075, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11191, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5078, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11193, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5081, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11195, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5090, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11197, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5087, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11199, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5099, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5102, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11201, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11203, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11205, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11207, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11209, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5105, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5108, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11211, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11213, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5111, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5114, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11215, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11217, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5117, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5120, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5147, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5150, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11219, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11221, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5123, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5126, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11223, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11225, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5129, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5132, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11227, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11229, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5153, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5156, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5135, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5138, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5141, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5144, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11231, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11233, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11235, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11237, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5159, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5162, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5165, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5168, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11239, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11241, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11243, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11245, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11247, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11249, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11251, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11253, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, 0, 3063, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, 0, 3064, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 38, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 31, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 32, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 2793, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 2794, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 2795, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 2796, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 2797, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 2798, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11257,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11259,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11261,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11263,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11265,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11267,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11269,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11271,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11273,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11275,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 11277,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19471,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19474,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19477,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19480,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19483,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19486,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19489,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19492,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19495,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27690,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27694,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27698,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27702,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27706,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27710,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27714,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27718,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27722,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27726,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27730,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 11350,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 11352,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 11354,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 11356,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 11358,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 11360,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 11362,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 11364,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 11366,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19560,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19563,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19566,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19569,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19572,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19575,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19578,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19581,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19584,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19587,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 19590,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19593, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19596, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19599, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19602, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19605, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19608, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19611, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19614, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19617, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19620, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19623, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19626, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19629, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19632, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19635, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19638, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19641, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19644, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19647, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19650, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19653, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19656, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19659, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19662, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19665, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 19668, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1491, 3287,
+        UINT16_MAX, 3287, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1493, 3288,
+        UINT16_MAX, 3288, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 2812, 3289,
+        UINT16_MAX, 3289, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1494, 3290,
+        UINT16_MAX, 3290, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1495, 3291,
+        UINT16_MAX, 3291, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 2837, 3292,
+        UINT16_MAX, 3292, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1497, 3293,
+        UINT16_MAX, 3293, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1498, 3294,
+        UINT16_MAX, 3294, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1499, 3295,
+        UINT16_MAX, 3295, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1500, 3296,
+        UINT16_MAX, 3296, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1501, 3297,
+        UINT16_MAX, 3297, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1502, 3298,
+        UINT16_MAX, 3298, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1503, 3299,
+        UINT16_MAX, 3299, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1504, 3300,
+        UINT16_MAX, 3300, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1505, 3301,
+        UINT16_MAX, 3301, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1507, 3302,
+        UINT16_MAX, 3302, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 2826, 3303,
+        UINT16_MAX, 3303, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1508, 3304,
+        UINT16_MAX, 3304, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3305, 3306,
+        UINT16_MAX, 3306, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1509, 3307,
+        UINT16_MAX, 3307, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1510, 3308,
+        UINT16_MAX, 3308, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 2908, 3309,
+        UINT16_MAX, 3309, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1511, 3310,
+        UINT16_MAX, 3310, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 2925, 3311,
+        UINT16_MAX, 3311, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3312, 3313,
+        UINT16_MAX, 3313, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 2834, 3314,
+        UINT16_MAX, 3314, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 0, UINT16_MAX,
+        8890, UINT16_MAX, 8890, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1, UINT16_MAX,
+        8891, UINT16_MAX, 8891, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 2, UINT16_MAX,
+        8892, UINT16_MAX, 8892, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3, UINT16_MAX,
+        8893, UINT16_MAX, 8893, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4, UINT16_MAX,
+        8894, UINT16_MAX, 8894, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 5, UINT16_MAX,
+        8895, UINT16_MAX, 8895, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 6, UINT16_MAX,
+        8896, UINT16_MAX, 8896, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 7, UINT16_MAX,
+        8897, UINT16_MAX, 8897, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 8, UINT16_MAX,
+        8898, UINT16_MAX, 8898, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 9, UINT16_MAX,
+        8899, UINT16_MAX, 8899, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 10, UINT16_MAX,
+        8900, UINT16_MAX, 8900, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 11, UINT16_MAX,
+        8901, UINT16_MAX, 8901, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12, UINT16_MAX,
+        8902, UINT16_MAX, 8902, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 13, UINT16_MAX,
+        8903, UINT16_MAX, 8903, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 14, UINT16_MAX,
+        8904, UINT16_MAX, 8904, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 15, UINT16_MAX,
+        8905, UINT16_MAX, 8905, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 16, UINT16_MAX,
+        8906, UINT16_MAX, 8906, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 17, UINT16_MAX,
+        8907, UINT16_MAX, 8907, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 18, UINT16_MAX,
+        8908, UINT16_MAX, 8908, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 19, UINT16_MAX,
+        8909, UINT16_MAX, 8909, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 20, UINT16_MAX,
+        8910, UINT16_MAX, 8910, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 21, UINT16_MAX,
+        8911, UINT16_MAX, 8911, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 22, UINT16_MAX,
+        8912, UINT16_MAX, 8912, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 23, UINT16_MAX,
+        8913, UINT16_MAX, 8913, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 24, UINT16_MAX,
+        8914, UINT16_MAX, 8914, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 25, UINT16_MAX,
+        8915, UINT16_MAX, 8915, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 2792, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 27891,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19703,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 11514,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 19708,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, 11519, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, true, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5171, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3329, UINT16_MAX, 3329,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3330, UINT16_MAX, 3330,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3331, UINT16_MAX, 3331,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3332, UINT16_MAX, 3332,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3333, UINT16_MAX, 3333,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3334, UINT16_MAX, 3334,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3335, UINT16_MAX, 3335,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3336, UINT16_MAX, 3336,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3337, UINT16_MAX, 3337,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3338, UINT16_MAX, 3338,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3339, UINT16_MAX, 3339,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3340, UINT16_MAX, 3340,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3341, UINT16_MAX, 3341,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3342, UINT16_MAX, 3342,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3343, UINT16_MAX, 3343,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3344, UINT16_MAX, 3344,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3345, UINT16_MAX, 3345,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3346, UINT16_MAX, 3346,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3347, UINT16_MAX, 3347,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3348, UINT16_MAX, 3348,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3349, UINT16_MAX, 3349,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3350, UINT16_MAX, 3350,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3351, UINT16_MAX, 3351,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3352, UINT16_MAX, 3352,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3353, UINT16_MAX, 3353,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3354, UINT16_MAX, 3354,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3355, UINT16_MAX, 3355,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3356, UINT16_MAX, 3356,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3357, UINT16_MAX, 3357,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3358, UINT16_MAX, 3358,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3359, UINT16_MAX, 3359,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3360, UINT16_MAX, 3360,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3361, UINT16_MAX, 3361,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3362, UINT16_MAX, 3362,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3363, UINT16_MAX, 3363,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3364, UINT16_MAX, 3364,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3365, UINT16_MAX, 3365,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3366, UINT16_MAX, 3366,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3367, UINT16_MAX, 3367,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3368, UINT16_MAX, 3368,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3369, UINT16_MAX, 3369,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3370, UINT16_MAX, 3370,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3371, UINT16_MAX, 3371,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3372, UINT16_MAX, 3372,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3373, UINT16_MAX, 3373,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3374, UINT16_MAX, 3374,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3375, UINT16_MAX, 3375,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8916, UINT16_MAX,
+        8916, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8917, UINT16_MAX,
+        8917, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8918, UINT16_MAX,
+        8918, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8919, UINT16_MAX,
+        8919, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8920, UINT16_MAX,
+        8920, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8921, UINT16_MAX,
+        8921, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8922, UINT16_MAX,
+        8922, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8923, UINT16_MAX,
+        8923, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8924, UINT16_MAX,
+        8924, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8925, UINT16_MAX,
+        8925, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8926, UINT16_MAX,
+        8926, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8927, UINT16_MAX,
+        8927, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8928, UINT16_MAX,
+        8928, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8929, UINT16_MAX,
+        8929, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8930, UINT16_MAX,
+        8930, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8931, UINT16_MAX,
+        8931, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8932, UINT16_MAX,
+        8932, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8933, UINT16_MAX,
+        8933, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8934, UINT16_MAX,
+        8934, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8935, UINT16_MAX,
+        8935, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8936, UINT16_MAX,
+        8936, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8937, UINT16_MAX,
+        8937, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8938, UINT16_MAX,
+        8938, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8939, UINT16_MAX,
+        8939, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8940, UINT16_MAX,
+        8940, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8941, UINT16_MAX,
+        8941, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8942, UINT16_MAX,
+        8942, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8943, UINT16_MAX,
+        8943, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8944, UINT16_MAX,
+        8944, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8945, UINT16_MAX,
+        8945, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8946, UINT16_MAX,
+        8946, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8947, UINT16_MAX,
+        8947, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8948, UINT16_MAX,
+        8948, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8949, UINT16_MAX,
+        8949, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8950, UINT16_MAX,
+        8950, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8951, UINT16_MAX,
+        8951, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8952, UINT16_MAX,
+        8952, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8953, UINT16_MAX,
+        8953, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8954, UINT16_MAX,
+        8954, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8955, UINT16_MAX,
+        8955, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8956, UINT16_MAX,
+        8956, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8957, UINT16_MAX,
+        8957, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8958, UINT16_MAX,
+        8958, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8959, UINT16_MAX,
+        8959, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8960, UINT16_MAX,
+        8960, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8961, UINT16_MAX,
+        8961, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8962, UINT16_MAX,
+        8962, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3376, UINT16_MAX, 3376,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8963, UINT16_MAX,
+        8963, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3377, UINT16_MAX, 3377,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3378, UINT16_MAX, 3378,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3379, UINT16_MAX, 3379,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8964, UINT16_MAX,
+        8964, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8965, UINT16_MAX,
+        8965, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3380, UINT16_MAX, 3380,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8966, UINT16_MAX,
+        8966, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3381, UINT16_MAX, 3381,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8967, UINT16_MAX,
+        8967, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3382, UINT16_MAX, 3382,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8968, UINT16_MAX,
+        8968, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1513, UINT16_MAX, 1513,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1531, UINT16_MAX, 1531,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1512, UINT16_MAX, 1512,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1520, UINT16_MAX, 1520,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3383, UINT16_MAX, 3383,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8969, UINT16_MAX,
+        8969, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3384, UINT16_MAX, 3384,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8970, UINT16_MAX,
+        8970, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUB, 9, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 2908, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3385, UINT16_MAX, 3385,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3386, UINT16_MAX, 3386,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3387, UINT16_MAX, 3387,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8971, UINT16_MAX,
+        8971, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3388, UINT16_MAX, 3388,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8972, UINT16_MAX,
+        8972, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3389, UINT16_MAX, 3389,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8973, UINT16_MAX,
+        8973, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3390, UINT16_MAX, 3390,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8974, UINT16_MAX,
+        8974, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3391, UINT16_MAX, 3391,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8975, UINT16_MAX,
+        8975, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3392, UINT16_MAX, 3392,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8976, UINT16_MAX,
+        8976, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3393, UINT16_MAX, 3393,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8977, UINT16_MAX,
+        8977, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3394, UINT16_MAX, 3394,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8978, UINT16_MAX,
+        8978, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3395, UINT16_MAX, 3395,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8979, UINT16_MAX,
+        8979, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3396, UINT16_MAX, 3396,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8980, UINT16_MAX,
+        8980, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3397, UINT16_MAX, 3397,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8981, UINT16_MAX,
+        8981, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3398, UINT16_MAX, 3398,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8982, UINT16_MAX,
+        8982, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3399, UINT16_MAX, 3399,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8983, UINT16_MAX,
+        8983, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3400, UINT16_MAX, 3400,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8984, UINT16_MAX,
+        8984, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3401, UINT16_MAX, 3401,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8985, UINT16_MAX,
+        8985, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3402, UINT16_MAX, 3402,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8986, UINT16_MAX,
+        8986, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3403, UINT16_MAX, 3403,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8987, UINT16_MAX,
+        8987, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3404, UINT16_MAX, 3404,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8988, UINT16_MAX,
+        8988, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3405, UINT16_MAX, 3405,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8989, UINT16_MAX,
+        8989, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3406, UINT16_MAX, 3406,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8990, UINT16_MAX,
+        8990, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3407, UINT16_MAX, 3407,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8991, UINT16_MAX,
+        8991, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3408, UINT16_MAX, 3408,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8992, UINT16_MAX,
+        8992, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3409, UINT16_MAX, 3409,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8993, UINT16_MAX,
+        8993, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3410, UINT16_MAX, 3410,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8994, UINT16_MAX,
+        8994, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3411, UINT16_MAX, 3411,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8995, UINT16_MAX,
+        8995, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3412, UINT16_MAX, 3412,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8996, UINT16_MAX,
+        8996, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3413, UINT16_MAX, 3413,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8997, UINT16_MAX,
+        8997, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3414, UINT16_MAX, 3414,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8998, UINT16_MAX,
+        8998, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3415, UINT16_MAX, 3415,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8999, UINT16_MAX,
+        8999, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3416, UINT16_MAX, 3416,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9000, UINT16_MAX,
+        9000, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3417, UINT16_MAX, 3417,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9001, UINT16_MAX,
+        9001, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3418, UINT16_MAX, 3418,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9002, UINT16_MAX,
+        9002, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3419, UINT16_MAX, 3419,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9003, UINT16_MAX,
+        9003, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3420, UINT16_MAX, 3420,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9004, UINT16_MAX,
+        9004, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3421, UINT16_MAX, 3421,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9005, UINT16_MAX,
+        9005, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3422, UINT16_MAX, 3422,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9006, UINT16_MAX,
+        9006, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3423, UINT16_MAX, 3423,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9007, UINT16_MAX,
+        9007, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3424, UINT16_MAX, 3424,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9008, UINT16_MAX,
+        9008, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3425, UINT16_MAX, 3425,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9009, UINT16_MAX,
+        9009, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3426, UINT16_MAX, 3426,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9010, UINT16_MAX,
+        9010, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3427, UINT16_MAX, 3427,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9011, UINT16_MAX,
+        9011, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3428, UINT16_MAX, 3428,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9012, UINT16_MAX,
+        9012, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3429, UINT16_MAX, 3429,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9013, UINT16_MAX,
+        9013, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3430, UINT16_MAX, 3430,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9014, UINT16_MAX,
+        9014, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3431, UINT16_MAX, 3431,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9015, UINT16_MAX,
+        9015, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3432, UINT16_MAX, 3432,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9016, UINT16_MAX,
+        9016, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3433, UINT16_MAX, 3433,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9017, UINT16_MAX,
+        9017, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3434, UINT16_MAX, 3434,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9018, UINT16_MAX,
+        9018, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3435, UINT16_MAX, 3435,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9019, UINT16_MAX,
+        9019, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3436, UINT16_MAX, 3436,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9020, UINT16_MAX,
+        9020, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3437, UINT16_MAX, 3437,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9021, UINT16_MAX,
+        9021, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3438, UINT16_MAX, 3438,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9022, UINT16_MAX,
+        9022, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 3439, UINT16_MAX, 3439,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9023, UINT16_MAX,
+        9023, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9024, UINT16_MAX,
+        9024, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9025, UINT16_MAX,
+        9025, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9026, UINT16_MAX,
+        9026, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9027, UINT16_MAX,
+        9027, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9028, UINT16_MAX,
+        9028, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9029, UINT16_MAX,
+        9029, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9030, UINT16_MAX,
+        9030, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9031, UINT16_MAX,
+        9031, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9032, UINT16_MAX,
+        9032, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9033, UINT16_MAX,
+        9033, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9034, UINT16_MAX,
+        9034, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9035, UINT16_MAX,
+        9035, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9036, UINT16_MAX,
+        9036, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9037, UINT16_MAX,
+        9037, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9038, UINT16_MAX,
+        9038, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9039, UINT16_MAX,
+        9039, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9040, UINT16_MAX,
+        9040, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9041, UINT16_MAX,
+        9041, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9042, UINT16_MAX,
+        9042, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9043, UINT16_MAX,
+        9043, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9044, UINT16_MAX,
+        9044, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9045, UINT16_MAX,
+        9045, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9046, UINT16_MAX,
+        9046, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9047, UINT16_MAX,
+        9047, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9048, UINT16_MAX,
+        9048, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9049, UINT16_MAX,
+        9049, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9050, UINT16_MAX,
+        9050, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9051, UINT16_MAX,
+        9051, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9052, UINT16_MAX,
+        9052, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9053, UINT16_MAX,
+        9053, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9054, UINT16_MAX,
+        9054, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9055, UINT16_MAX,
+        9055, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9056, UINT16_MAX,
+        9056, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9057, UINT16_MAX,
+        9057, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9058, UINT16_MAX,
+        9058, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9059, UINT16_MAX,
+        9059, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9060, UINT16_MAX,
+        9060, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9061, UINT16_MAX,
+        9061, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9062, UINT16_MAX,
+        9062, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9063, UINT16_MAX,
+        9063, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3440, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3441, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3442, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3443, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3444, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3445, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3446, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3447, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3448, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3449, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3450, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3451, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3452, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3453, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3454, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3455, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3456, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3457, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3458, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3459, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3460, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3461, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3462, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3463, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3464, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3465, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3466, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3467, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3468, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3469, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3470, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3471, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3472, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3473, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3474, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3475, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3476, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3477, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3478, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3479, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3480, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3481, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3482, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3483, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3484, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3485, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3486, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3487, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3488, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3489, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3490, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3491, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3492, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3493, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3494, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3495, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3496, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3497, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3498, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3499, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3500, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3501, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3502, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3503, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3504, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3505, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3506, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3507, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3508, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3509, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3510, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3511, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3512, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3513, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3514, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3515, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3516, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3517, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3518, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3519, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3520, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3521, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3522, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3523, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3524, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3525, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3526, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3527, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3528, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3529, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3530, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3531, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3532, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3533, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3534, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3535, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3536, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3537, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3538, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3539, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3540, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3541, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3542, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3543, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3544, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3545, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3546, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3547, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3548, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3549, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3550, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3551, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3552, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3553, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3554, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3555, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3556, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3557, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3558, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3559, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3560, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3561, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3562, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3563, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3564, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3565, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3566, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3567, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3568, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3569, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3570, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3571, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3572, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3573, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3574, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3575, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3576, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3577, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3578, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3579, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3580, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3581, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3582, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3583, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3584, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3585, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3586, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3587, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3588, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3589, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3590, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3591, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3592, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3593, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3594, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3595, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3596, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3597, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3598, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3599, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3600, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3601, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3602, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3603, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3604, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3605, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3606, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3607, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3608, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3609, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3610, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3611, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3612, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3613, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3614, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3615, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3616, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3617, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3618, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3619, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3620, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3621, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3622, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3623, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3624, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3625, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3626, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3627, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3628, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3629, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3630, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3631, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3632, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3633, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3634, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3635, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3636, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3637, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3638, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3639, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3640, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3641, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3642, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3643, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3644, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3645, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3646, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3647, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3648, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3649, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3650, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3651, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3652, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3653, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3654, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3655, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3656, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ZS, 0, UTF8PROC_BIDI_CLASS_WS, UTF8PROC_DECOMP_TYPE_WIDE, 26, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 218, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 224, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 3657, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3466, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3658, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3659, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5239, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5174, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11852, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5177, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11854, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5180, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11856, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5183, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11858, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5186, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11860, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5189, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11862, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5192, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11864, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5195, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11866, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5198, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11868, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5201, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11870, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5204, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11872, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5207, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11874, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5210, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11876, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5213, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11878, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5216, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11880, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5219, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11882, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11884, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5223, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11886, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11888, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5227, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11890, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11892, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5231, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11894, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11896, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5235, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11898, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11900, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11902, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 8, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32820, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 8, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 32821, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 11904,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 11906,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5242, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, 0, 11908, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_VERTICAL, 11910,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5310, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5245, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11912, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5248, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11914, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5251, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11916, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5254, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11918, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5257, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11920, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5260, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11922, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5263, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11924, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5266, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11926, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5269, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11928, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5272, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11930, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5275, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11932, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5278, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11934, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5281, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11936, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5284, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11938, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5287, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11940, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5290, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11942, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11944, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5294, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11946, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11948, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5298, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11950, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11952, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5302, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11954, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11956, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5306, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11958, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11960, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5313, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5316, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5319, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5322, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11962, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11964, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11966, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11968, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 11970, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5325, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, 0, 11972, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_VERTICAL, 11974,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3784, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3785, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3786, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3787, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3788, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3789, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3790, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3791, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3792, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3793, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3794, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3795, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3796, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3797, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3798, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3799, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3800, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3802, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3803, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3804, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3805, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3806, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3807, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3808, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3809, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3810, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3811, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3812, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3813, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3814, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3815, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3816, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3817, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3818, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3819, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3820, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3821, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3822, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3823, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3824, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3825, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3826, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3827, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3828, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3829, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3830, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3831, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3832, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3833, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3834, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3835, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3836, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3837, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3838, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3839, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3840, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3841, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3842, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3843, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3844, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3845, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3846, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3847, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3848, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3849, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3850, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3851, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3852, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3853, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3854, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3855, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3856, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3857, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3858, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3859, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3860, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3861, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3862, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3863, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3864, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3865, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3866, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3867, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3868, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3869, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3870, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3871, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3872, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3873, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3874, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3875, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3876, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 3877, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3443, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3449, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3878, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3879, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3880, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3881, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3882, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3883, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3447, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3884, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3885, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3886, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3887, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3451, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20272, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20275, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20278, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20281, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20284, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20287, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20290, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20293, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20296, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20299, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20302, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20305, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20308, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20311, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28506, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28510, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28514, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28518, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28522, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28526, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28530, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28534, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28538, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28542, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28546, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28550, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28554, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28558, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 28562, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 53142,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 44957,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20387, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20390, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20393, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20396, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20399, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20402, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20405, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20408, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20411, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20414, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20417, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20420, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20423, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20426, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20429, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20432, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20435, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20438, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20441, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20444, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20447, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20450, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20453, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20456, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20459, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20462, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20465, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20468, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20471, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20474, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20477, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20480, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20483, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20486, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20489, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20492, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4111, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4112, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3509, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4113, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 20498,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12309,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12311,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12313,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12315,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12317,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12319,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12321,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12323,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12325,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12327,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12329,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12331,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12333,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12335,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12337,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3784, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3787, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3790, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3792, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3800, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3804, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3806, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3807, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3809, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3810, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3811, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3812, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3813, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12339, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12341, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12343, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12345, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12347, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12349, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12351, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12353, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12355, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12357, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12359, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12361, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12363, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 12365, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 36943,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 28756,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12376,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3443, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3449, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3878, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3879, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4186, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4187, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4188, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3454, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4189, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3466, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3516, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3528, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3527, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3517, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3609, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3474, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3514, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4190, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4191, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4192, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4193, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4194, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4195, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4196, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4197, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4198, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4199, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3480, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4200, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4201, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4202, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4203, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4204, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4205, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4206, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4207, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3880, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3881, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 3882, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4208, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4209, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4210, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4211, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4212, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4213, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4214, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4215, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4216, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4217, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12410,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12412,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12414,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12416,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12418,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12420,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12422,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12424,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12426,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12428,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12430,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12432,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12434,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12436,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_CIRCLE, 12438,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12440, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12442, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12444, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12446, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12448, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12450, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12452, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12454, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12456, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20650, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20653, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 20656, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 12467,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 20661,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 12472,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 20666,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4285, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4286, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4287, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4288, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4289, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4290, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4291, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4292, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4293, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4294, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4295, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4296, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4297, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4298, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4299, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4300, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4301, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4302, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4303, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4304, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4305, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4306, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4307, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4308, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4309, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4310, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4311, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4312, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4313, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4314, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4315, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4316, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4317, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4318, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4319, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4320, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4321, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4322, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4323, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4324, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4325, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4326, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4327, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4328, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4329, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4330, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 4331, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12524, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 28910, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 28914, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 28918, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20730, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 28925, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20737, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20740, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37127, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 28940, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20752, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20755, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20758, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 28953, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 28957, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20769, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20772, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12583, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20777, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 28972, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 28976, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12596, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37174, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 45371, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37185, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20806, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37193, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37198, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29011, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20823, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20826, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20829, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29024, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37220, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29033, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20845, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20848, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20851, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12662, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12664, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12666, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12668, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20862, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20865, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37252, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20873, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29068, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37264, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20885, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12696, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12698, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37276, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29089, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37285, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20906, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37293, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12722, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20916, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20919, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20922, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20925, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20928, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29123, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20935, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12746, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20940, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20943, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20946, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29141, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20953, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20956, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20959, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37346, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29159, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12779, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37357, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12786, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29172, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29176, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20988, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20991, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 20994, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29189, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12809, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21003, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29198, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12818, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37396, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21017, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12828, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12830, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12832, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12834, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12836, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12838, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12840, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12842, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12844, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 12846, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21040, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21043, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21046, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21049, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21052, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21055, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21058, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21061, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21064, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21067, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21070, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21073, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21076, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21079, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21082, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21085, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12896, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12898, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21092, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12903, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12905, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 12907,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 21101,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 21104,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 12915,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12917, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12919, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12921, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12923, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29309, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12929, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12931, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12933, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12935, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12937, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12939, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12941, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12943, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21137, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29332, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12952, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12954, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12956, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12958, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12960, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12962, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12964, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21158, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21161, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21164, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21167, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12978, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12980, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12982, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12984, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12986, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12988, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12990, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12992, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12994, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 12996, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21190, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21193, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13004, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21198, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21201, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21204, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13015, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21209, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21212, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29407, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13027, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21221, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21224, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21227, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21230, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 37617, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 45814, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13052, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13054, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13056, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13058, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13060, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13062, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13064, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13066, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13068, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13070, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13072, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13074, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13076, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13078, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13080, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13082, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13084, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13086, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29472, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13092, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13094, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13096, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29482, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21294, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13105, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13107, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13109, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13111, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13113, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13115, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13117, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13119, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13121, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13123, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21317, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13128, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13130, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21324, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21327, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13138, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 29524, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 21336, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13147, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13149, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13151, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13153, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 21347,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 21350,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13161, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13163, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13165, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13167, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13169, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13171, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13173, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13175, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13177, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21371, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21374, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21377, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21380, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21383, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21386, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21389, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21392, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21395, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21398, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21401, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21404, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21407, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21410, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21413, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21416, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21419, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21422, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21425, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21428, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21431, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 21434, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SQUARE, 21437,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5056, UINT16_MAX, 5056,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9064, UINT16_MAX,
+        9064, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5057, UINT16_MAX, 5057,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9065, UINT16_MAX,
+        9065, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5058, UINT16_MAX, 5058,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9066, UINT16_MAX,
+        9066, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5059, UINT16_MAX, 5059,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9067, UINT16_MAX,
+        9067, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5060, UINT16_MAX, 5060,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9068, UINT16_MAX,
+        9068, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1445, UINT16_MAX, 1445,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 8621, UINT16_MAX,
+        8621, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5061, UINT16_MAX, 5061,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9069, UINT16_MAX,
+        9069, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5062, UINT16_MAX, 5062,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9070, UINT16_MAX,
+        9070, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5063, UINT16_MAX, 5063,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9071, UINT16_MAX,
+        9071, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5064, UINT16_MAX, 5064,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9072, UINT16_MAX,
+        9072, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5065, UINT16_MAX, 5065,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9073, UINT16_MAX,
+        9073, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5066, UINT16_MAX, 5066,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9074, UINT16_MAX,
+        9074, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5067, UINT16_MAX, 5067,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9075, UINT16_MAX,
+        9075, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5068, UINT16_MAX, 5068,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9076, UINT16_MAX,
+        9076, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5069, UINT16_MAX, 5069,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9077, UINT16_MAX,
+        9077, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5070, UINT16_MAX, 5070,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9078, UINT16_MAX,
+        9078, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5071, UINT16_MAX, 5071,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9079, UINT16_MAX,
+        9079, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5072, UINT16_MAX, 5072,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9080, UINT16_MAX,
+        9080, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5073, UINT16_MAX, 5073,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9081, UINT16_MAX,
+        9081, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5074, UINT16_MAX, 5074,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9082, UINT16_MAX,
+        9082, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5075, UINT16_MAX, 5075,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9083, UINT16_MAX,
+        9083, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5076, UINT16_MAX, 5076,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9084, UINT16_MAX,
+        9084, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5077, UINT16_MAX, 5077,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9085, UINT16_MAX,
+        9085, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5078, UINT16_MAX, 5078,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9086, UINT16_MAX,
+        9086, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5079, UINT16_MAX, 5079,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9087, UINT16_MAX,
+        9087, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5080, UINT16_MAX, 5080,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9088, UINT16_MAX,
+        9088, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5081, UINT16_MAX, 5081,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9089, UINT16_MAX,
+        9089, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5082, UINT16_MAX, 5082,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9090, UINT16_MAX,
+        9090, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5083, UINT16_MAX, 5083,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9091, UINT16_MAX,
+        9091, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5084, UINT16_MAX, 5084,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9092, UINT16_MAX,
+        9092, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5085, UINT16_MAX, 5085,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9093, UINT16_MAX,
+        9093, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5086, UINT16_MAX, 5086,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9094, UINT16_MAX,
+        9094, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5087, UINT16_MAX, 5087,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9095, UINT16_MAX,
+        9095, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5088, UINT16_MAX, 5088,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9096, UINT16_MAX,
+        9096, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5089, UINT16_MAX, 5089,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9097, UINT16_MAX,
+        9097, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5090, UINT16_MAX, 5090,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9098, UINT16_MAX,
+        9098, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5091, UINT16_MAX, 5091,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9099, UINT16_MAX,
+        9099, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 981, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 983, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5092, UINT16_MAX, 5092,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9100, UINT16_MAX,
+        9100, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5093, UINT16_MAX, 5093,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9101, UINT16_MAX,
+        9101, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5094, UINT16_MAX, 5094,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9102, UINT16_MAX,
+        9102, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5095, UINT16_MAX, 5095,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9103, UINT16_MAX,
+        9103, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5096, UINT16_MAX, 5096,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9104, UINT16_MAX,
+        9104, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5097, UINT16_MAX, 5097,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9105, UINT16_MAX,
+        9105, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5098, UINT16_MAX, 5098,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9106, UINT16_MAX,
+        9106, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5099, UINT16_MAX, 5099,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9107, UINT16_MAX,
+        9107, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5100, UINT16_MAX, 5100,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9108, UINT16_MAX,
+        9108, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5101, UINT16_MAX, 5101,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9109, UINT16_MAX,
+        9109, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5102, UINT16_MAX, 5102,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9110, UINT16_MAX,
+        9110, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5103, UINT16_MAX, 5103,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9111, UINT16_MAX,
+        9111, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5104, UINT16_MAX, 5104,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9112, UINT16_MAX,
+        9112, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5105, UINT16_MAX, 5105,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9113, UINT16_MAX,
+        9113, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5106, UINT16_MAX, 5106,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9114, UINT16_MAX,
+        9114, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5107, UINT16_MAX, 5107,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9115, UINT16_MAX,
+        9115, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5108, UINT16_MAX, 5108,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9116, UINT16_MAX,
+        9116, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5109, UINT16_MAX, 5109,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9117, UINT16_MAX,
+        9117, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5110, UINT16_MAX, 5110,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9118, UINT16_MAX,
+        9118, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5111, UINT16_MAX, 5111,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9119, UINT16_MAX,
+        9119, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5112, UINT16_MAX, 5112,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9120, UINT16_MAX,
+        9120, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5113, UINT16_MAX, 5113,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9121, UINT16_MAX,
+        9121, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5114, UINT16_MAX, 5114,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9122, UINT16_MAX,
+        9122, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5115, UINT16_MAX, 5115,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9123, UINT16_MAX,
+        9123, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5116, UINT16_MAX, 5116,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9124, UINT16_MAX,
+        9124, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5117, UINT16_MAX, 5117,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9125, UINT16_MAX,
+        9125, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5118, UINT16_MAX, 5118,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9126, UINT16_MAX,
+        9126, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5119, UINT16_MAX, 5119,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9127, UINT16_MAX,
+        9127, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5120, UINT16_MAX, 5120,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9128, UINT16_MAX,
+        9128, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5121, UINT16_MAX, 5121,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9129, UINT16_MAX,
+        9129, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5122, UINT16_MAX, 5122,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9130, UINT16_MAX,
+        9130, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5123, UINT16_MAX, 5123,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9131, UINT16_MAX,
+        9131, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5124, UINT16_MAX, 5124,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9132, UINT16_MAX,
+        9132, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5125, UINT16_MAX, 5125,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9133, UINT16_MAX,
+        9133, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5126, UINT16_MAX, 5126,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9134, UINT16_MAX,
+        9134, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5127, UINT16_MAX, 5127,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9135, UINT16_MAX,
+        9135, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5128, UINT16_MAX, 5128,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9136, UINT16_MAX,
+        9136, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5129, UINT16_MAX, 5129,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9137, UINT16_MAX,
+        9137, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 5129, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5130, UINT16_MAX, 5130,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9138, UINT16_MAX,
+        9138, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5131, UINT16_MAX, 5131,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9139, UINT16_MAX,
+        9139, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5132, UINT16_MAX, 5132,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5133, UINT16_MAX, 5133,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9140, UINT16_MAX,
+        9140, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5134, UINT16_MAX, 5134,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9141, UINT16_MAX,
+        9141, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5135, UINT16_MAX, 5135,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9142, UINT16_MAX,
+        9142, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5136, UINT16_MAX, 5136,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9143, UINT16_MAX,
+        9143, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5137, UINT16_MAX, 5137,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9144, UINT16_MAX,
+        9144, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5138, UINT16_MAX, 5138,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9145, UINT16_MAX,
+        9145, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1524, UINT16_MAX, 1524,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5139, UINT16_MAX, 5139,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9146, UINT16_MAX,
+        9146, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5140, UINT16_MAX, 5140,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9147, UINT16_MAX,
+        9147, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9148, UINT16_MAX,
+        9148, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5141, UINT16_MAX, 5141,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9149, UINT16_MAX,
+        9149, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5142, UINT16_MAX, 5142,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9150, UINT16_MAX,
+        9150, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5143, UINT16_MAX, 5143,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9151, UINT16_MAX,
+        9151, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5144, UINT16_MAX, 5144,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9152, UINT16_MAX,
+        9152, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5145, UINT16_MAX, 5145,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9153, UINT16_MAX,
+        9153, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5146, UINT16_MAX, 5146,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9154, UINT16_MAX,
+        9154, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5147, UINT16_MAX, 5147,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9155, UINT16_MAX,
+        9155, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5148, UINT16_MAX, 5148,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9156, UINT16_MAX,
+        9156, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5149, UINT16_MAX, 5149,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9157, UINT16_MAX,
+        9157, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5150, UINT16_MAX, 5150,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9158, UINT16_MAX,
+        9158, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 785, UINT16_MAX, 785,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1515, UINT16_MAX, 1515,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1523, UINT16_MAX, 1523,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5151, UINT16_MAX, 5151,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1525, UINT16_MAX, 1525,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5152, UINT16_MAX, 5152,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5153, UINT16_MAX, 5153,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1527, UINT16_MAX, 1527,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5154, UINT16_MAX, 5154,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5155, UINT16_MAX, 5155,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9159, UINT16_MAX,
+        9159, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5156, UINT16_MAX, 5156,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9160, UINT16_MAX,
+        9160, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5157, UINT16_MAX, 5157,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9161, UINT16_MAX,
+        9161, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5158, UINT16_MAX, 5158,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9162, UINT16_MAX,
+        9162, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5159, UINT16_MAX, 5159,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9163, UINT16_MAX,
+        9163, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5160, UINT16_MAX, 5160,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9164, UINT16_MAX,
+        9164, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5161, UINT16_MAX, 5161,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9165, UINT16_MAX,
+        9165, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5162, UINT16_MAX, 5162,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 1536, UINT16_MAX, 1536,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5163, UINT16_MAX, 5163,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 5164, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 371, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9166, UINT16_MAX,
+        9166, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 5094, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 5165, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 3377, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SUPER, 5166, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5167, 5167, UINT16_MAX, 5167,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5168, 5168, UINT16_MAX, 5168,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5169, 5169, UINT16_MAX, 5169,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5170, 5170, UINT16_MAX, 5170,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5171, 5171, UINT16_MAX, 5171,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5172, 5172, UINT16_MAX, 5172,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5173, 5173, UINT16_MAX, 5173,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5174, 5174, UINT16_MAX, 5174,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5175, 5175, UINT16_MAX, 5175,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5176, 5176, UINT16_MAX, 5176,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5177, 5177, UINT16_MAX, 5177,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5178, 5178, UINT16_MAX, 5178,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5179, 5179, UINT16_MAX, 5179,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5180, 5180, UINT16_MAX, 5180,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5181, 5181, UINT16_MAX, 5181,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5182, 5182, UINT16_MAX, 5182,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5183, 5183, UINT16_MAX, 5183,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5184, 5184, UINT16_MAX, 5184,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5185, 5185, UINT16_MAX, 5185,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5186, 5186, UINT16_MAX, 5186,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5187, 5187, UINT16_MAX, 5187,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5188, 5188, UINT16_MAX, 5188,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5189, 5189, UINT16_MAX, 5189,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5190, 5190, UINT16_MAX, 5190,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5191, 5191, UINT16_MAX, 5191,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5192, 5192, UINT16_MAX, 5192,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5193, 5193, UINT16_MAX, 5193,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5194, 5194, UINT16_MAX, 5194,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5195, 5195, UINT16_MAX, 5195,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5196, 5196, UINT16_MAX, 5196,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5197, 5197, UINT16_MAX, 5197,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5198, 5198, UINT16_MAX, 5198,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5199, 5199, UINT16_MAX, 5199,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5200, 5200, UINT16_MAX, 5200,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5201, 5201, UINT16_MAX, 5201,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5202, 5202, UINT16_MAX, 5202,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5203, 5203, UINT16_MAX, 5203,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5204, 5204, UINT16_MAX, 5204,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5205, 5205, UINT16_MAX, 5205,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5206, 5206, UINT16_MAX, 5206,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5207, 5207, UINT16_MAX, 5207,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5208, 5208, UINT16_MAX, 5208,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5209, 5209, UINT16_MAX, 5209,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5210, 5210, UINT16_MAX, 5210,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5211, 5211, UINT16_MAX, 5211,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5212, 5212, UINT16_MAX, 5212,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5213, 5213, UINT16_MAX, 5213,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5214, 5214, UINT16_MAX, 5214,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5215, 5215, UINT16_MAX, 5215,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5216, 5216, UINT16_MAX, 5216,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5217, 5217, UINT16_MAX, 5217,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5218, 5218, UINT16_MAX, 5218,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5219, 5219, UINT16_MAX, 5219,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5220, 5220, UINT16_MAX, 5220,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5221, 5221, UINT16_MAX, 5221,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5222, 5222, UINT16_MAX, 5222,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5223, 5223, UINT16_MAX, 5223,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5224, 5224, UINT16_MAX, 5224,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5225, 5225, UINT16_MAX, 5225,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5226, 5226, UINT16_MAX, 5226,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5227, 5227, UINT16_MAX, 5227,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5228, 5228, UINT16_MAX, 5228,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5229, 5229, UINT16_MAX, 5229,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5230, 5230, UINT16_MAX, 5230,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5231, 5231, UINT16_MAX, 5231,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5232, 5232, UINT16_MAX, 5232,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5233, 5233, UINT16_MAX, 5233,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5234, 5234, UINT16_MAX, 5234,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5235, 5235, UINT16_MAX, 5235,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5236, 5236, UINT16_MAX, 5236,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5237, 5237, UINT16_MAX, 5237,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5238, 5238, UINT16_MAX, 5238,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5239, 5239, UINT16_MAX, 5239,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5240, 5240, UINT16_MAX, 5240,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5241, 5241, UINT16_MAX, 5241,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5242, 5242, UINT16_MAX, 5242,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5243, 5243, UINT16_MAX, 5243,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5244, 5244, UINT16_MAX, 5244,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5245, 5245, UINT16_MAX, 5245,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 5246, 5246, UINT16_MAX, 5246,
+        UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_LV},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_LVT},
+    {UTF8PROC_CATEGORY_CS, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_CO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5247, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5248, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3601, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5249, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5250, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5251, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5252, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3655, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5253, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3609, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5254, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5255, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5256, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5257, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5258, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5259, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5260, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5261, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5262, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5263, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5264, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5265, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5266, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5267, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5268, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5269, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5270, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5271, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5272, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5273, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5274, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5275, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5276, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5277, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5278, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5279, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5280, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5281, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5282, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5283, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5284, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5285, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5286, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5287, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5288, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5289, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5290, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5291, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5292, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5293, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5294, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3567, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5295, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5296, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5297, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5298, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5299, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5300, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5301, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5302, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5303, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5304, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5305, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3640, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5306, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5307, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5308, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5309, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5310, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5311, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5312, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5313, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5314, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5315, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5316, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5317, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5318, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5319, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5320, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5321, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5322, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5323, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5324, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5325, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5326, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5327, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5328, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5329, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5330, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5331, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5332, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5333, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5334, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5335, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5336, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5337, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5338, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5339, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5340, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5341, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5342, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5343, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5344, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5345, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5346, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5347, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5348, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5349, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5350, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5351, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5352, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3603, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5353, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5354, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5355, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5356, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5357, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5358, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5359, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5360, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5361, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5362, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5363, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5364, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5365, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5366, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5367, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3480, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5368, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5369, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5370, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5371, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5372, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5373, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5374, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5375, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3461, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5376, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5377, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5378, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5379, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5380, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5381, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5382, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5383, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5384, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5385, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5386, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5387, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5388, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5389, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5390, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5391, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5392, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5393, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5394, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5395, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5396, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5397, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5398, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5399, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5400, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5401, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5402, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5403, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5404, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5405, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5406, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5407, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5408, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5409, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5410, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5411, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5412, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5413, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5414, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5415, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5416, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5417, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5418, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5419, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5420, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5421, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5422, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5423, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5424, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5425, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5426, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5427, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5428, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5429, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3654, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5430, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5431, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5432, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5433, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5434, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5435, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5436, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5437, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5438, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5439, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5440, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5441, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 4187, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5442, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5443, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5444, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5445, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5446, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5447, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5448, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5449, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5450, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5451, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5452, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5453, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5454, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5455, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5456, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5457, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5458, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5459, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5460, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5461, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5462, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5463, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3608, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5464, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5465, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5466, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5467, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5468, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5469, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5470, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5471, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5472, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5473, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5474, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5475, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5476, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3559, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5477, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5478, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5479, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5480, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5481, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5482, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5483, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5484, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5485, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5486, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5487, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5488, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5489, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5490, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5491, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5492, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3586, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5493, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3589, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5494, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5495, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5496, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5497, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5498, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5499, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5500, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5501, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5502, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5503, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5504, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5505, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5506, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5507, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3566, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5508, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5509, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5510, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5511, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5512, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5513, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5514, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5515, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5516, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5517, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5518, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5519, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5520, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5521, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5522, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5523, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5524, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5525, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5526, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5527, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5528, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5529, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3487, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5530, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5531, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5532, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5533, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5534, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5535, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5536, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5537, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5538, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5539, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5540, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5541, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5542, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5543, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5544, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 4192, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5545, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5546, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5547, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5548, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 4196, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5549, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5550, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5551, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5552, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5553, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5554, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5555, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5556, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5557, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5558, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5559, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5560, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5561, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5562, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5563, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5564, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5565, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5566, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5567, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5568, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5569, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5570, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5571, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5572, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5574, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5575, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5576, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5577, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5578, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5579, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5580, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5581, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5582, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5583, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5584, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5585, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5586, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5587, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5588, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5589, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5590, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5591, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5592, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5593, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5594, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5595, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5596, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5597, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5598, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5599, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5600, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5601, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5602, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5603, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5604, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5605, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3520, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5606, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5607, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5608, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5609, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5610, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5611, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5612, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5613, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5614, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5615, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5616, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5617, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5618, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5619, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5620, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5621, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5622, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5623, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5624, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5625, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5626, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5627, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5628, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5629, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5630, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5631, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5632, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5633, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5634, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5635, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5636, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5637, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5638, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5639, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5640, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5641, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5642, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5643, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5645, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5647, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5649, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5650, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5651, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5652, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5654, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5656, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5658, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 5659, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13852, 13852,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13854, 13854,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13856, 13856,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 22050, 22050,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 22053, 22053,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13864, 13866,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13866, 13866,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13868, 13868,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13870, 13870,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13872, 13872,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13874, 13874,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 13876, 13876,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13878, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 26, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13880, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_FONT, 5690, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_FONT, 2839, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_FONT, 2842, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_FONT, 5691, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_FONT, 5692, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_FONT, 5693, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_FONT, 5694, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_FONT, 5695, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_FONT, 5696, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ES, UTF8PROC_DECOMP_TYPE_FONT, 2799, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13889, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13891, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13893, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13895, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13897, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13899, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13901, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13903, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13905, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13907, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13909, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13911, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13913, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13915, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13917, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13919, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13921, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13923, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13925, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13927, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13929, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13931, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13933, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13935, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13937, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13939, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13941, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13943, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13945, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13947, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13949, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, 0, 13951, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_R, UTF8PROC_DECOMP_TYPE_COMPAT, 13953, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5763,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5763, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5764,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5764, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5764,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5764, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5765,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5765, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5765,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5765, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5766,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5766, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5766,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5766, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5767,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5767, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5767,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5767, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5768,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5768, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5768,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5768, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5769,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5769, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5769,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5769, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5770,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5770, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5770,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5770, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5771,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5771, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5771,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5771, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5772,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5772, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5772,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5772, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5773,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5773, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5773,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5773, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5774,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5774, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5774,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5774, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5775,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5775, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5775,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5775, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5776,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5776, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5777,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5777, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5778,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5778, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5779,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5779, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5780,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5780, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5781,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5781, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5782,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5782, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5782,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5782, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5783,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5783, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5783,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5783, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5784,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5784, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5784,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5784, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5785,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5785, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5785,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5785, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5786,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5786, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5787,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5787, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5787,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5787, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5788,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5788, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5789,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5789, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5789,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5789, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5790,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5790, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5790,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5790, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5791,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5791, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5792,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5792, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5793,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5793, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5793,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5793, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5794,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5794, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5795,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5795, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5796,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5796, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5797,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5798,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5798, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5799,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5799, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5800,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5800, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5801,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5801,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5802,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5802, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 13995,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 13995, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 13997,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 13997, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 13999,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 13999, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14001,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14001, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14003,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14003, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14005,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14005, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14007,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14007, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14007,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14009,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14009, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14009,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5819,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5819, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 5819,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 5819, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14012,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14014,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14016,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14018,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14020,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14022,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14024,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14026,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14028,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14030,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14032,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14034,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14036,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14038,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14040,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14042,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14044,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14046,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14048,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14050,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14052,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14054,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14056,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14058,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14060,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14062,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14064,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14066,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14068,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14070,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14072,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14074,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14076,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14078,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14080,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14082,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14084,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14086,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14088,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14090,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14092,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14094,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14096,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14098,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14100,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14102,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14104,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14106,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14108,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14110,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14112,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14114,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14116,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14118,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14120,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14122,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14124,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14126,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14128,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14130,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14132,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14134,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14136,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14138,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14140,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14142,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14144,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14146,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14148,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14150,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14152,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14154,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14156,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14158,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14160,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14162,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14164,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14166,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14168,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14170,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14172,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14174,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14176,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14178,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14180,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14182,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14184,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14186,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14188,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14190,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14192,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14194,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14196,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 22390,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 22393,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 22396,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 22399,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 22402,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 22405,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14216, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14218, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14016, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14220, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14018, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14222, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14224, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14026, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14226, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14028, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14030, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14228, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14230, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14038, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14232, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14040, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14042, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14234, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14236, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14046, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14238, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14048, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14050, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14108, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14110, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14116, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14118, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14120, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14128, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14130, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14132, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14134, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14142, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14144, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14146, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14240, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14154, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14242, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14244, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14166, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14246, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14168, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14170, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14196, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14248, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14250, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14186, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14252, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14188, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14190, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14012,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14014,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14254,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14016,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14256,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14020,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14022,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14024,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14026,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14258,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14032,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14034,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14036,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14038,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14260,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14046,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14052,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14054,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14056,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14058,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14060,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14064,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14066,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14068,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14070,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14072,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14074,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14262,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14076,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14078,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14080,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14082,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14084,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14086,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14090,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14092,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14094,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14096,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14098,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14100,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14102,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14104,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14106,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14112,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14114,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14122,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14124,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14126,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14128,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14130,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14136,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14138,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14140,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14142,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14264,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14148,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14150,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14152,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14154,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14160,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14162,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14164,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14166,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14266,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14172,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14174,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14268,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14180,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14182,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14184,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14186,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14270,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14016,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14256,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14026,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14258,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14038,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14260,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14046,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14272,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14072,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14274,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14276,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14278,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14128,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14130,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14142,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14166,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14266,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14186,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14270,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 22472,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 22475,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 22478,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14289,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14291,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14293,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14295,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14297,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14299,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14301,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14303,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14305,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14307,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14309,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14311,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14313,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14315,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14317,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14319,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14321,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14323,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14325,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14327,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14329,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14331,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14333,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14276,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14335,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14337,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14339,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14341,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14289, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14291, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14293, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14295, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14297, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14299, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14301, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14303, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14305, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14307, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14309, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14311, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14313, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14315, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14317, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14319, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14321, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14323, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14325, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14327, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14329, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14331, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14333, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14276, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14335, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14337, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14339, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14341, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14329,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14331,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14333,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14276,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14274,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14278,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 14088,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14066,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14068,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14070,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14329,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14331,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14333,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14088,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14090,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14343, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14343,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22537,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22540, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22540,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22543,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22546,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22549,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22552,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22555,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22558, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22558,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22561, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22564, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22567,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22570,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22573, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22576, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22576,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22579,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22582, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22582,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22585, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22585,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22588, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22591, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22591,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22594, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22597, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22597,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22600, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22600,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22603, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22606, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22606,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22609, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22609,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22612,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22615, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22618, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22621, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22621,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22624, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22627, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22630, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22633, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22636, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22636,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22639, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22642, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22645, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22648, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22651, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22654,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22654, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22657, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22657,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22660, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22660,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22663,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22666,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22669, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22672,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22675,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22678,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22681,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22684,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22687,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22690,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22693,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22696, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22699, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22699,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22702, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22705, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22708, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22711, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22711,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22714, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22717, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22720, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22723, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22726, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22729, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22732, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22735, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22738, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22741, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22744, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22747, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22750, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22753, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22756, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22759, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22762, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22765, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22768, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22771, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22774, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22777, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22639,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22645,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22780, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22783, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22786,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22789, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22792,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22795, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22792, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22786, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22798, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22804, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22807, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22810, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22795,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22618,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 22588,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22813, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 22816, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 22819,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 22822,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 31017,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 31021,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 31025,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 31029,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 31033,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 31037,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 31041,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 22853,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 63816,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 63835,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 31076,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6504,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6505,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6506,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6507,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 814,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6508,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6509,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6510,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6511,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6512,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6513,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6514,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6515,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PC, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6516,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 2802,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 2803,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6517,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6518,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6519,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6520,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6521,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6522,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6523,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6524,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 3063,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 3064,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6525,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6526,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6527,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6528,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6529,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_VERTICAL, 6530,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 6531, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PC, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_COMPAT, 6516, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_CS, UTF8PROC_DECOMP_TYPE_SMALL, 6504, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6505, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_CS, UTF8PROC_DECOMP_TYPE_SMALL, 2762, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 814, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_CS, UTF8PROC_DECOMP_TYPE_SMALL, 6507, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6509, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6508, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6514, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 2802, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 2803, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6517, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6518, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6519, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6520, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_SMALL, 6532, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6533, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6534, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ES, UTF8PROC_DECOMP_TYPE_SMALL, 2799, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ES, UTF8PROC_DECOMP_TYPE_SMALL, 6535, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6536, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6537, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 2801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6538, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_SMALL, 6539, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_SMALL, 6540, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SMALL, 6541, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14734,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14736,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14738,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14740,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14742,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14744,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14746,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14748,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14750,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14752,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14754,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14756,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14758,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 14760,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6570,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6571,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6571, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6572,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6572, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6573,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6573, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6574,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6574, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6575,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6575, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6575,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6575, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6576,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6576, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6577,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6577, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6577,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6577, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6578,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6578, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6579,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6579, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6579,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6579, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6580,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6580, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6580,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6580, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6581,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6581, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6581,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6581, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6582,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6582, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6582,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6582, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6583,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6583, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6583,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6583, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6584,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6584, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6585,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6585, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6586,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6586, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6587,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6587, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6588,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6588, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6588,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6588, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6589,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6589, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6589,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6589, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6590,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6590, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6590,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6590, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6591,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6591, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6591,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6591, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6592,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6592, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6592,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6592, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6593,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6593, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6593,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6593, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6594,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6594, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6594,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6594, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6595,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6595, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6595,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6595, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6596,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6596, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6596,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6596, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6597,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6597, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6597,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6597, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6598,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6598, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6598,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6598, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6599,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6599, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6599,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6599, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6600,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6600, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6600,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6600, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6601,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6601, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6601,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6601, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6602,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6602, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6602,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6602, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6603,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6603, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 5802,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 5802, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 6604,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 6604, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_INITIAL, 6604,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_MEDIAL, 6604, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14797,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14797, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14799,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14799, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14801,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_ISOLATED, 14803,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FINAL, 14803, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6508, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6613, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_WIDE, 6532, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_WIDE, 6539, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_WIDE, 6540, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6533, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6614, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 2802, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 2803, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6534, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ES, UTF8PROC_DECOMP_TYPE_WIDE, 2799, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_CS, UTF8PROC_DECOMP_TYPE_WIDE, 6504, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PD, 0, UTF8PROC_BIDI_CLASS_ES, UTF8PROC_DECOMP_TYPE_WIDE, 6535, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_CS, UTF8PROC_DECOMP_TYPE_WIDE, 2762, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_CS, UTF8PROC_DECOMP_TYPE_WIDE, 6615, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 2792, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 38, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 31, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 32, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 2793, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 2794, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 2795, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 2796, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 2797, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_WIDE, 2798, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_CS, UTF8PROC_DECOMP_TYPE_WIDE, 6507, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 814, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6536, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 2801, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6537, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6509, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6541, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1491, 6616,
+        UINT16_MAX, 6616, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1493, 6617,
+        UINT16_MAX, 6617, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 2812, 6618,
+        UINT16_MAX, 6618, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1494, 6619,
+        UINT16_MAX, 6619, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1495, 6620,
+        UINT16_MAX, 6620, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 2837, 6621,
+        UINT16_MAX, 6621, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1497, 6622,
+        UINT16_MAX, 6622, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1498, 6623,
+        UINT16_MAX, 6623, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1499, 6624,
+        UINT16_MAX, 6624, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1500, 6625,
+        UINT16_MAX, 6625, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1501, 6626,
+        UINT16_MAX, 6626, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1502, 6627,
+        UINT16_MAX, 6627, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1503, 6628,
+        UINT16_MAX, 6628, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1504, 6629,
+        UINT16_MAX, 6629, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1505, 6630,
+        UINT16_MAX, 6630, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1507, 6631,
+        UINT16_MAX, 6631, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 2826, 6632,
+        UINT16_MAX, 6632, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1508, 6633,
+        UINT16_MAX, 6633, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 3305, 6634,
+        UINT16_MAX, 6634, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1509, 6635,
+        UINT16_MAX, 6635, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1510, 6636,
+        UINT16_MAX, 6636, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 2908, 6637,
+        UINT16_MAX, 6637, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1511, 6638,
+        UINT16_MAX, 6638, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 2925, 6639,
+        UINT16_MAX, 6639, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 3312, 6640,
+        UINT16_MAX, 6640, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 2834, 6641,
+        UINT16_MAX, 6641, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6529, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6538, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6530, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6642, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PC, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6516, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 2722, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 0, UINT16_MAX, 9167,
+        UINT16_MAX, 9167, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 1, UINT16_MAX, 9168,
+        UINT16_MAX, 9168, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 2, UINT16_MAX, 9169,
+        UINT16_MAX, 9169, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 3, UINT16_MAX, 9170,
+        UINT16_MAX, 9170, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 4, UINT16_MAX, 9171,
+        UINT16_MAX, 9171, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 5, UINT16_MAX, 9172,
+        UINT16_MAX, 9172, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 6, UINT16_MAX, 9173,
+        UINT16_MAX, 9173, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 7, UINT16_MAX, 9174,
+        UINT16_MAX, 9174, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 8, UINT16_MAX, 9175,
+        UINT16_MAX, 9175, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 9, UINT16_MAX, 9176,
+        UINT16_MAX, 9176, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 10, UINT16_MAX,
+        9177, UINT16_MAX, 9177, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 11, UINT16_MAX,
+        9178, UINT16_MAX, 9178, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 12, UINT16_MAX,
+        9179, UINT16_MAX, 9179, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 13, UINT16_MAX,
+        9180, UINT16_MAX, 9180, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 14, UINT16_MAX,
+        9181, UINT16_MAX, 9181, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 15, UINT16_MAX,
+        9182, UINT16_MAX, 9182, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 16, UINT16_MAX,
+        9183, UINT16_MAX, 9183, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 17, UINT16_MAX,
+        9184, UINT16_MAX, 9184, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 18, UINT16_MAX,
+        9185, UINT16_MAX, 9185, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 19, UINT16_MAX,
+        9186, UINT16_MAX, 9186, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 20, UINT16_MAX,
+        9187, UINT16_MAX, 9187, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 21, UINT16_MAX,
+        9188, UINT16_MAX, 9188, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 22, UINT16_MAX,
+        9189, UINT16_MAX, 9189, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 23, UINT16_MAX,
+        9190, UINT16_MAX, 9190, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 24, UINT16_MAX,
+        9191, UINT16_MAX, 9191, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_WIDE, 25, UINT16_MAX,
+        9192, UINT16_MAX, 9192, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6517, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6643, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6518, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6644, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6645, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6646, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6506, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PS, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6525, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PE, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6526, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6505, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_PO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6647, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4331, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6648, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6649, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6650, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6651, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6652, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6653, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6654, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6655, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6656, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6657, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4285, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4286, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4287, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4288, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4289, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4290, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4291, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4292, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4293, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4294, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4295, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4296, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4297, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4298, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4299, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4300, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4301, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4302, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4303, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4304, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4305, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4306, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4307, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4308, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4309, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4310, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4311, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4312, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4313, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4314, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4315, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4316, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4317, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4318, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4319, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4320, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4321, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4322, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4323, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4324, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4325, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4326, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4327, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 4328, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6658, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6659, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6660, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6661, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, true, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6662, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6663, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6664, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6665, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6666, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6667, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6668, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6669, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6670, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6671, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6672, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6673, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6674, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6675, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6676, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6677, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6678, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6679, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6680, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6681, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6682, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6683, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6684, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6685, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6686, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6687, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6688, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6689, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6690, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6691, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6692, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6693, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6694, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6695, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6696, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6697, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6698, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6699, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6700, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6701, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6702, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6703, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6704, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6705, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6706, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6707, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6708, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6709, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6710, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6711, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_NARROW, 6712, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_WIDE, 6713, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_WIDE, 6714, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6715, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6716, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_WIDE, 6717, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_WIDE, 6718, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SC, 0, UTF8PROC_BIDI_CLASS_ET, UTF8PROC_DECOMP_TYPE_WIDE, 6719, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6720, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6721, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6722, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6723, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6724, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6725, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_NARROW, 6726, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_NL, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6727, UINT16_MAX, 6727,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6729, UINT16_MAX, 6729,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6731, UINT16_MAX, 6731,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6733, UINT16_MAX, 6733,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6735, UINT16_MAX, 6735,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6737, UINT16_MAX, 6737,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6739, UINT16_MAX, 6739,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6741, UINT16_MAX, 6741,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6743, UINT16_MAX, 6743,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6745, UINT16_MAX, 6745,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6747, UINT16_MAX, 6747,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6749, UINT16_MAX, 6749,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6751, UINT16_MAX, 6751,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6753, UINT16_MAX, 6753,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6755, UINT16_MAX, 6755,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6757, UINT16_MAX, 6757,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6759, UINT16_MAX, 6759,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6761, UINT16_MAX, 6761,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6763, UINT16_MAX, 6763,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6765, UINT16_MAX, 6765,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6767, UINT16_MAX, 6767,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6769, UINT16_MAX, 6769,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6771, UINT16_MAX, 6771,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6773, UINT16_MAX, 6773,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6775, UINT16_MAX, 6775,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6777, UINT16_MAX, 6777,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6779, UINT16_MAX, 6779,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6781, UINT16_MAX, 6781,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6783, UINT16_MAX, 6783,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6785, UINT16_MAX, 6785,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6787, UINT16_MAX, 6787,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6789, UINT16_MAX, 6789,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6791, UINT16_MAX, 6791,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6793, UINT16_MAX, 6793,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6795, UINT16_MAX, 6795,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6797, UINT16_MAX, 6797,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6799, UINT16_MAX, 6799,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6801, UINT16_MAX, 6801,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6803, UINT16_MAX, 6803,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6805, UINT16_MAX, 6805,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9193, UINT16_MAX,
+        9193, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9195, UINT16_MAX,
+        9195, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9197, UINT16_MAX,
+        9197, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9199, UINT16_MAX,
+        9199, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9201, UINT16_MAX,
+        9201, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9203, UINT16_MAX,
+        9203, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9205, UINT16_MAX,
+        9205, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9207, UINT16_MAX,
+        9207, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9209, UINT16_MAX,
+        9209, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9211, UINT16_MAX,
+        9211, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9213, UINT16_MAX,
+        9213, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9215, UINT16_MAX,
+        9215, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9217, UINT16_MAX,
+        9217, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9219, UINT16_MAX,
+        9219, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9221, UINT16_MAX,
+        9221, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9223, UINT16_MAX,
+        9223, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9225, UINT16_MAX,
+        9225, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9227, UINT16_MAX,
+        9227, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9229, UINT16_MAX,
+        9229, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9231, UINT16_MAX,
+        9231, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9233, UINT16_MAX,
+        9233, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9235, UINT16_MAX,
+        9235, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9237, UINT16_MAX,
+        9237, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9239, UINT16_MAX,
+        9239, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9241, UINT16_MAX,
+        9241, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9243, UINT16_MAX,
+        9243, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9245, UINT16_MAX,
+        9245, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9247, UINT16_MAX,
+        9247, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9249, UINT16_MAX,
+        9249, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9251, UINT16_MAX,
+        9251, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9253, UINT16_MAX,
+        9253, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9255, UINT16_MAX,
+        9255, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9257, UINT16_MAX,
+        9257, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9259, UINT16_MAX,
+        9259, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9261, UINT16_MAX,
+        9261, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9263, UINT16_MAX,
+        9263, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9265, UINT16_MAX,
+        9265, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9267, UINT16_MAX,
+        9267, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9269, UINT16_MAX,
+        9269, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9271, UINT16_MAX,
+        9271, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6807, UINT16_MAX, 6807,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6809, UINT16_MAX, 6809,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6811, UINT16_MAX, 6811,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6813, UINT16_MAX, 6813,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6815, UINT16_MAX, 6815,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6817, UINT16_MAX, 6817,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6819, UINT16_MAX, 6819,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6821, UINT16_MAX, 6821,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6823, UINT16_MAX, 6823,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6825, UINT16_MAX, 6825,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6827, UINT16_MAX, 6827,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6829, UINT16_MAX, 6829,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6831, UINT16_MAX, 6831,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6833, UINT16_MAX, 6833,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6835, UINT16_MAX, 6835,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6837, UINT16_MAX, 6837,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6839, UINT16_MAX, 6839,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6841, UINT16_MAX, 6841,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6843, UINT16_MAX, 6843,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6845, UINT16_MAX, 6845,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6847, UINT16_MAX, 6847,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6849, UINT16_MAX, 6849,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6851, UINT16_MAX, 6851,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6853, UINT16_MAX, 6853,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6855, UINT16_MAX, 6855,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6857, UINT16_MAX, 6857,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6859, UINT16_MAX, 6859,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6861, UINT16_MAX, 6861,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6863, UINT16_MAX, 6863,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6865, UINT16_MAX, 6865,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6867, UINT16_MAX, 6867,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6869, UINT16_MAX, 6869,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6871, UINT16_MAX, 6871,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6873, UINT16_MAX, 6873,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6875, UINT16_MAX, 6875,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 6877, UINT16_MAX, 6877,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9273, UINT16_MAX,
+        9273, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9275, UINT16_MAX,
+        9275, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9277, UINT16_MAX,
+        9277, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9279, UINT16_MAX,
+        9279, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9281, UINT16_MAX,
+        9281, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9283, UINT16_MAX,
+        9283, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9285, UINT16_MAX,
+        9285, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9287, UINT16_MAX,
+        9287, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9289, UINT16_MAX,
+        9289, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9291, UINT16_MAX,
+        9291, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9293, UINT16_MAX,
+        9293, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9295, UINT16_MAX,
+        9295, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9297, UINT16_MAX,
+        9297, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9299, UINT16_MAX,
+        9299, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9301, UINT16_MAX,
+        9301, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9303, UINT16_MAX,
+        9303, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9305, UINT16_MAX,
+        9305, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9307, UINT16_MAX,
+        9307, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9309, UINT16_MAX,
+        9309, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9311, UINT16_MAX,
+        9311, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9313, UINT16_MAX,
+        9313, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9315, UINT16_MAX,
+        9315, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9317, UINT16_MAX,
+        9317, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9319, UINT16_MAX,
+        9319, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9321, UINT16_MAX,
+        9321, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9323, UINT16_MAX,
+        9323, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9325, UINT16_MAX,
+        9325, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9327, UINT16_MAX,
+        9327, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9329, UINT16_MAX,
+        9329, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9331, UINT16_MAX,
+        9331, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9333, UINT16_MAX,
+        9333, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9335, UINT16_MAX,
+        9335, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9337, UINT16_MAX,
+        9337, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9339, UINT16_MAX,
+        9339, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9341, UINT16_MAX,
+        9341, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9343, UINT16_MAX,
+        9343, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6879, UINT16_MAX, 6879,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6881, UINT16_MAX, 6881,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6883, UINT16_MAX, 6883,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6885, UINT16_MAX, 6885,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6887, UINT16_MAX, 6887,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6889, UINT16_MAX, 6889,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6891, UINT16_MAX, 6891,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6893, UINT16_MAX, 6893,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6895, UINT16_MAX, 6895,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6897, UINT16_MAX, 6897,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6899, UINT16_MAX, 6899,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6901, UINT16_MAX, 6901,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6903, UINT16_MAX, 6903,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6905, UINT16_MAX, 6905,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6907, UINT16_MAX, 6907,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6909, UINT16_MAX, 6909,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6911, UINT16_MAX, 6911,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6913, UINT16_MAX, 6913,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6915, UINT16_MAX, 6915,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6917, UINT16_MAX, 6917,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6919, UINT16_MAX, 6919,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6921, UINT16_MAX, 6921,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6923, UINT16_MAX, 6923,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6925, UINT16_MAX, 6925,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6927, UINT16_MAX, 6927,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6929, UINT16_MAX, 6929,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6931, UINT16_MAX, 6931,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6933, UINT16_MAX, 6933,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6935, UINT16_MAX, 6935,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6937, UINT16_MAX, 6937,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6939, UINT16_MAX, 6939,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6941, UINT16_MAX, 6941,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6943, UINT16_MAX, 6943,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6945, UINT16_MAX, 6945,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6947, UINT16_MAX, 6947,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6949, UINT16_MAX, 6949,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6951, UINT16_MAX, 6951,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6953, UINT16_MAX, 6953,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6955, UINT16_MAX, 6955,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6957, UINT16_MAX, 6957,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6959, UINT16_MAX, 6959,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6961, UINT16_MAX, 6961,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6963, UINT16_MAX, 6963,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6965, UINT16_MAX, 6965,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6967, UINT16_MAX, 6967,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6969, UINT16_MAX, 6969,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6971, UINT16_MAX, 6971,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6973, UINT16_MAX, 6973,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6975, UINT16_MAX, 6975,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6977, UINT16_MAX, 6977,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 6979, UINT16_MAX, 6979,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9345, UINT16_MAX,
+        9345, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9347, UINT16_MAX,
+        9347, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9349, UINT16_MAX,
+        9349, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9351, UINT16_MAX,
+        9351, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9353, UINT16_MAX,
+        9353, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9355, UINT16_MAX,
+        9355, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9357, UINT16_MAX,
+        9357, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9359, UINT16_MAX,
+        9359, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9361, UINT16_MAX,
+        9361, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9363, UINT16_MAX,
+        9363, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9365, UINT16_MAX,
+        9365, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9367, UINT16_MAX,
+        9367, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9369, UINT16_MAX,
+        9369, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9371, UINT16_MAX,
+        9371, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9373, UINT16_MAX,
+        9373, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9375, UINT16_MAX,
+        9375, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9377, UINT16_MAX,
+        9377, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9379, UINT16_MAX,
+        9379, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9381, UINT16_MAX,
+        9381, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9383, UINT16_MAX,
+        9383, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9385, UINT16_MAX,
+        9385, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9387, UINT16_MAX,
+        9387, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9389, UINT16_MAX,
+        9389, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9391, UINT16_MAX,
+        9391, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9393, UINT16_MAX,
+        9393, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9395, UINT16_MAX,
+        9395, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9397, UINT16_MAX,
+        9397, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9399, UINT16_MAX,
+        9399, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9401, UINT16_MAX,
+        9401, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9403, UINT16_MAX,
+        9403, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9405, UINT16_MAX,
+        9405, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9407, UINT16_MAX,
+        9407, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9409, UINT16_MAX,
+        9409, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9411, UINT16_MAX,
+        9411, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9413, UINT16_MAX,
+        9413, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9415, UINT16_MAX,
+        9415, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9417, UINT16_MAX,
+        9417, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9419, UINT16_MAX,
+        9419, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9421, UINT16_MAX,
+        9421, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9423, UINT16_MAX,
+        9423, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9425, UINT16_MAX,
+        9425, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9427, UINT16_MAX,
+        9427, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9429, UINT16_MAX,
+        9429, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9431, UINT16_MAX,
+        9431, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9433, UINT16_MAX,
+        9433, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9435, UINT16_MAX,
+        9435, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9437, UINT16_MAX,
+        9437, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9439, UINT16_MAX,
+        9439, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9441, UINT16_MAX,
+        9441, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9443, UINT16_MAX,
+        9443, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9445, UINT16_MAX,
+        9445, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_AN, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_AL, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5328, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15173, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5332, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15177, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5336, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15181, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 7, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49206, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_PREPEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49208, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 15185, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, 15189, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5340, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5344, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49210, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5348, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 15193, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 15197, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49212, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49216, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5354, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_NSM, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49214, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 15201, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 15205, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49218, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 15209, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49220, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5362, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5366, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 15213, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 0, UTF8PROC_BIDI_CLASS_L, 0, 15217, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0, UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7029, UINT16_MAX, 7029,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7031, UINT16_MAX, 7031,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7033, UINT16_MAX, 7033,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7035, UINT16_MAX, 7035,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7037, UINT16_MAX, 7037,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7039, UINT16_MAX, 7039,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7041, UINT16_MAX, 7041,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7043, UINT16_MAX, 7043,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7045, UINT16_MAX, 7045,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7047, UINT16_MAX, 7047,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7049, UINT16_MAX, 7049,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7051, UINT16_MAX, 7051,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7053, UINT16_MAX, 7053,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7055, UINT16_MAX, 7055,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7057, UINT16_MAX, 7057,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7059, UINT16_MAX, 7059,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7061, UINT16_MAX, 7061,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7063, UINT16_MAX, 7063,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7065, UINT16_MAX, 7065,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7067, UINT16_MAX, 7067,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7069, UINT16_MAX, 7069,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7071, UINT16_MAX, 7071,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7073, UINT16_MAX, 7073,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7075, UINT16_MAX, 7075,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7077, UINT16_MAX, 7077,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7079, UINT16_MAX, 7079,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7081, UINT16_MAX, 7081,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7083, UINT16_MAX, 7083,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7085, UINT16_MAX, 7085,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7087, UINT16_MAX, 7087,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7089, UINT16_MAX, 7089,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7091, UINT16_MAX, 7091,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9447, UINT16_MAX,
+        9447, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9449, UINT16_MAX,
+        9449, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9451, UINT16_MAX,
+        9451, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9453, UINT16_MAX,
+        9453, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9455, UINT16_MAX,
+        9455, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9457, UINT16_MAX,
+        9457, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9459, UINT16_MAX,
+        9459, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9461, UINT16_MAX,
+        9461, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9463, UINT16_MAX,
+        9463, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9465, UINT16_MAX,
+        9465, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9467, UINT16_MAX,
+        9467, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9469, UINT16_MAX,
+        9469, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9471, UINT16_MAX,
+        9471, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9473, UINT16_MAX,
+        9473, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9475, UINT16_MAX,
+        9475, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9477, UINT16_MAX,
+        9477, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9479, UINT16_MAX,
+        9479, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9481, UINT16_MAX,
+        9481, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9483, UINT16_MAX,
+        9483, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9485, UINT16_MAX,
+        9485, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9487, UINT16_MAX,
+        9487, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9489, UINT16_MAX,
+        9489, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9491, UINT16_MAX,
+        9491, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9493, UINT16_MAX,
+        9493, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9495, UINT16_MAX,
+        9495, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9497, UINT16_MAX,
+        9497, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9499, UINT16_MAX,
+        9499, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9501, UINT16_MAX,
+        9501, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9503, UINT16_MAX,
+        9503, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9505, UINT16_MAX,
+        9505, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9507, UINT16_MAX,
+        9507, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9509, UINT16_MAX,
+        9509, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MN, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MN, 9, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_CF, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, true, 0, 0,
+        UTF8PROC_BOUNDCLASS_CONTROL},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7093, UINT16_MAX, 7093,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7095, UINT16_MAX, 7095,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7097, UINT16_MAX, 7097,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7099, UINT16_MAX, 7099,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7101, UINT16_MAX, 7101,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7103, UINT16_MAX, 7103,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7105, UINT16_MAX, 7105,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7107, UINT16_MAX, 7107,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7109, UINT16_MAX, 7109,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7111, UINT16_MAX, 7111,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7113, UINT16_MAX, 7113,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7115, UINT16_MAX, 7115,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7117, UINT16_MAX, 7117,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7119, UINT16_MAX, 7119,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7121, UINT16_MAX, 7121,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7123, UINT16_MAX, 7123,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7125, UINT16_MAX, 7125,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7127, UINT16_MAX, 7127,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7129, UINT16_MAX, 7129,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7131, UINT16_MAX, 7131,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7133, UINT16_MAX, 7133,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7135, UINT16_MAX, 7135,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7137, UINT16_MAX, 7137,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7139, UINT16_MAX, 7139,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7141, UINT16_MAX, 7141,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7143, UINT16_MAX, 7143,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7145, UINT16_MAX, 7145,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7147, UINT16_MAX, 7147,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7149, UINT16_MAX, 7149,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7151, UINT16_MAX, 7151,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7153, UINT16_MAX, 7153,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, 7155, UINT16_MAX, 7155,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9511, UINT16_MAX,
+        9511, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9513, UINT16_MAX,
+        9513, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9515, UINT16_MAX,
+        9515, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9517, UINT16_MAX,
+        9517, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9519, UINT16_MAX,
+        9519, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9521, UINT16_MAX,
+        9521, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9523, UINT16_MAX,
+        9523, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9525, UINT16_MAX,
+        9525, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9527, UINT16_MAX,
+        9527, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9529, UINT16_MAX,
+        9529, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9531, UINT16_MAX,
+        9531, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9533, UINT16_MAX,
+        9533, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9535, UINT16_MAX,
+        9535, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9537, UINT16_MAX,
+        9537, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9539, UINT16_MAX,
+        9539, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9541, UINT16_MAX,
+        9541, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9543, UINT16_MAX,
+        9543, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9545, UINT16_MAX,
+        9545, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9547, UINT16_MAX,
+        9547, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9549, UINT16_MAX,
+        9549, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9551, UINT16_MAX,
+        9551, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9553, UINT16_MAX,
+        9553, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9555, UINT16_MAX,
+        9555, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9557, UINT16_MAX,
+        9557, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9559, UINT16_MAX,
+        9559, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9561, UINT16_MAX,
+        9561, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9563, UINT16_MAX,
+        9563, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9565, UINT16_MAX,
+        9565, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9567, UINT16_MAX,
+        9567, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9569, UINT16_MAX,
+        9569, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9571, UINT16_MAX,
+        9571, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, 9573, UINT16_MAX,
+        9573, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5370, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5374, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15349, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15353, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, 5378, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15357, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15361, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15365, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15369, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15373, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_MC, 216, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49222, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 216, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 226, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_SPACINGMARK},
+    {UTF8PROC_CATEGORY_MC, 216, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49224, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 216, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49226, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 216, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49228, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 216, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49230, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_MC, 216, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 49232, false, false, false, false, 0, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5390, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, 5394, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15377, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, 5398, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15381, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, 5404, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15385, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15389, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15393, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, 15397, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, true, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1491, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1497, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1500, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1501, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1505, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 3305, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1509, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1510, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2908, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1511, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2925, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 3312, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 0, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 1, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 5, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 10, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 12, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 13, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 15, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 16, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 17, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 18, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 19, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 20, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 21, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 22, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 23, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 24, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 25, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7209, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7210, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7211, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7212, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7213, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7214, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7215, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7216, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 915, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7217, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7218, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7219, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7220, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7221, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7222, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7223, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7224, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7225, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 917, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7226, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 897, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7227, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7228, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7229, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 2835, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7230, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 845, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 846, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 848, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 849, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 850, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 851, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 852, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 807, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 853, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 854, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 35, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 855, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 856, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 857, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 859, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 914, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 860, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 861, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 862, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 863, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 864, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 865, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 866, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SM, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_FONT, 7231, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, true, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7232, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7233, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7234, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7235, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7236, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7237, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 7238, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_FONT, 904, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 2792, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 38, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 31, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 32, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 2793, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 2794, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 2795, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 2796, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 2797, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_ND, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_FONT, 2798, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7239, UINT16_MAX, 7239,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7241, UINT16_MAX, 7241,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7243, UINT16_MAX, 7243,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7245, UINT16_MAX, 7245,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7247, UINT16_MAX, 7247,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7249, UINT16_MAX, 7249,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7251, UINT16_MAX, 7251,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7253, UINT16_MAX, 7253,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7255, UINT16_MAX, 7255,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7257, UINT16_MAX, 7257,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7259, UINT16_MAX, 7259,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7261, UINT16_MAX, 7261,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7263, UINT16_MAX, 7263,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7265, UINT16_MAX, 7265,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7267, UINT16_MAX, 7267,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7269, UINT16_MAX, 7269,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7271, UINT16_MAX, 7271,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7273, UINT16_MAX, 7273,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7275, UINT16_MAX, 7275,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7277, UINT16_MAX, 7277,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7279, UINT16_MAX, 7279,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7281, UINT16_MAX, 7281,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7283, UINT16_MAX, 7283,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7285, UINT16_MAX, 7285,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7287, UINT16_MAX, 7287,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7289, UINT16_MAX, 7289,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7291, UINT16_MAX, 7291,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7293, UINT16_MAX, 7293,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7295, UINT16_MAX, 7295,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7297, UINT16_MAX, 7297,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7299, UINT16_MAX, 7299,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7301, UINT16_MAX, 7301,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7303, UINT16_MAX, 7303,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LU, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, 7305, UINT16_MAX, 7305,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9575, UINT16_MAX,
+        9575, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9577, UINT16_MAX,
+        9577, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9579, UINT16_MAX,
+        9579, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9581, UINT16_MAX,
+        9581, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9583, UINT16_MAX,
+        9583, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9585, UINT16_MAX,
+        9585, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9587, UINT16_MAX,
+        9587, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9589, UINT16_MAX,
+        9589, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9591, UINT16_MAX,
+        9591, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9593, UINT16_MAX,
+        9593, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9595, UINT16_MAX,
+        9595, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9597, UINT16_MAX,
+        9597, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9599, UINT16_MAX,
+        9599, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9601, UINT16_MAX,
+        9601, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9603, UINT16_MAX,
+        9603, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9605, UINT16_MAX,
+        9605, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9607, UINT16_MAX,
+        9607, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9609, UINT16_MAX,
+        9609, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9611, UINT16_MAX,
+        9611, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9613, UINT16_MAX,
+        9613, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9615, UINT16_MAX,
+        9615, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9617, UINT16_MAX,
+        9617, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9619, UINT16_MAX,
+        9619, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9621, UINT16_MAX,
+        9621, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9623, UINT16_MAX,
+        9623, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9625, UINT16_MAX,
+        9625, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9627, UINT16_MAX,
+        9627, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9629, UINT16_MAX,
+        9629, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9631, UINT16_MAX,
+        9631, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9633, UINT16_MAX,
+        9633, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9635, UINT16_MAX,
+        9635, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9637, UINT16_MAX,
+        9637, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9639, UINT16_MAX,
+        9639, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LL, 0, UTF8PROC_BIDI_CLASS_R, 0, UINT16_MAX, UINT16_MAX, 9641, UINT16_MAX,
+        9641, UINT16_MAX, false, false, false, false, 1, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6576, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6577, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6581, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6584, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6603, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6587, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6582, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6592, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6604, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6598, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6599, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6600, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6601, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6588, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6594, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6596, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6590, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6597, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6586, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6589, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6579, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6580, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6583, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6585, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6591, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6593, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6595, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 7307, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 5786, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 7308, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 7309, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_AL, UTF8PROC_DECOMP_TYPE_FONT, 6602, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15502,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15504,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15506,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15508,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15510,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15512,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15514,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15516,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15518,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15520,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_NO, 0, UTF8PROC_BIDI_CLASS_EN, UTF8PROC_DECOMP_TYPE_COMPAT, 15522,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1,
+        0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23716, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23719, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23722, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23725, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23728, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23731, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23734, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23737, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23740, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23743, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23746, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23749, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23752, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23755, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23758, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23761, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23764, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23767, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23770, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23773, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23776, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23779, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23782, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23785, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23788, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23791, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23794, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 2812, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 1508, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 15605, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 15607, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1491, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1493, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 2812, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1494, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1495, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 2837, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1497, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1498, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1499, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1500, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1501, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1502, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1503, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1504, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1505, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1507, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 2826, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1508, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3305, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1509, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1510, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 2908, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 1511, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 2925, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3312, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 2834, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 15609, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 13070, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 15611, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 15613, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 23807, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 15618, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUPER, 15620, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUPER, 15622, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_ON, UTF8PROC_DECOMP_TYPE_SUPER, 15624, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 15626, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 1, 0,
+        UTF8PROC_BOUNDCLASS_REGIONAL_INDICATOR},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 15628, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 15630, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 4295, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3506, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7440, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7441, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7442, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3449, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7443, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7444, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3886, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7445, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7446, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7447, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 5425, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7448, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7449, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7450, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7451, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7452, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7453, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3542, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7454, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7455, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7456, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7457, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7458, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7459, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3443, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3878, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7460, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 4208, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3881, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 4209, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7461, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3598, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7462, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7463, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7464, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7465, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7466, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 4191, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 3516, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7467, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7468, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7469, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_SQUARE, 7470, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23855, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23858, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23861, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23864, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23867, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23870, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23873, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23876, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_COMPAT, 23879, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 7498, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SO, 0, UTF8PROC_BIDI_CLASS_L, UTF8PROC_DECOMP_TYPE_CIRCLE, 7499, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC},
+    {UTF8PROC_CATEGORY_SK, 0, UTF8PROC_BIDI_CLASS_ON, 0, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0,
+        UTF8PROC_BOUNDCLASS_EXTEND},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7500, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7501, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7502, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7503, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7505, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7506, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7507, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7508, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7509, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7510, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7511, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7512, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7514, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7515, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7516, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7517, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7519, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7520, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7450, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7521, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7523, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7524, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7525, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7526, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7527, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3459, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7529, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7530, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7531, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7532, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7468, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7533, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7534, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7535, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7536, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7537, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7538, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7539, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7540, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7541, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7542, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7544, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7545, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7546, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7547, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7549, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7550, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7551, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7552, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7553, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7554, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7555, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7556, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7557, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7558, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7559, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7560, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7561, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7562, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7563, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7564, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7565, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7566, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7567, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7568, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7569, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7570, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7571, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7572, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7573, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7574, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7575, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7576, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7577, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7579, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7580, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7581, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7443, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7582, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7583, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7584, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7586, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7588, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7589, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7590, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7591, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7592, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7593, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7594, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7595, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7596, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7597, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7599, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7600, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7601, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7602, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7604, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7605, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7606, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3485, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7607, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7608, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7609, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7610, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7611, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7613, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7614, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7616, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7617, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7618, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7619, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7620, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7621, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7622, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7623, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7624, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7625, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7626, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7627, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7629, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7630, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7631, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7632, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7633, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3497, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7635, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7637, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7638, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7639, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7640, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7642, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7644, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7645, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7646, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7647, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7648, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7649, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7650, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7651, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7652, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7653, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7654, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7656, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7657, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7658, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7659, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7660, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7661, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7662, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7663, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7664, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7665, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7666, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7667, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7668, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7669, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7670, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7672, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7673, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7674, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7675, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7676, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7677, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7679, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7680, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7681, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7682, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7683, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7684, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7685, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7686, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7687, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7688, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7689, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7691, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7692, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7693, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7694, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7695, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7696, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7697, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7698, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7699, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7700, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7701, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7702, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7703, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7704, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7705, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7706, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7708, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7709, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7710, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7711, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7712, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7714, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7715, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7716, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7717, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7718, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7719, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7720, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7721, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7723, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7724, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7725, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7726, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7728, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7729, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7730, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7731, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7732, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7733, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7735, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7737, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7739, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7740, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7742, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7743, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7744, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7745, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7746, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7747, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7748, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7749, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7750, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7752, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7753, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7754, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7755, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7756, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7757, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7759, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7760, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7761, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7763, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7765, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7766, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7767, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7768, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7769, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7770, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7771, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7772, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7773, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7775, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7776, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7778, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7779, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7781, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7782, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7783, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7785, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7786, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7787, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7789, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7791, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7792, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7793, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7794, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7795, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7796, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7797, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7798, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7799, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7800, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7801, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7802, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7804, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7805, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7807, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7809, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7810, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7812, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7814, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7816, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7817, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7818, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7820, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7822, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7824, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7826, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7827, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7828, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7829, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7830, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7831, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7833, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7834, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7835, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7837, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7839, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7841, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7842, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7843, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7844, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7845, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7847, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7849, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7850, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7851, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7853, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7854, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7855, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7856, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7858, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7859, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7860, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7861, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7862, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7863, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7865, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7866, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7867, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7868, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7869, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7870, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7871, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7873, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7875, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7876, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7878, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7879, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7881, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7882, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7883, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7885, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7887, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7888, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7890, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7891, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7893, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7894, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7895, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7896, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7897, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7898, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7899, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7901, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7903, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7905, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7907, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7908, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7909, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7910, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7911, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7912, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7913, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7914, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7915, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7916, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7917, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7918, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7920, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7921, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7922, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7923, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7924, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7925, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7926, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7927, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7928, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7929, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7930, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7932, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7934, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7936, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7937, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7938, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7939, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7940, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7942, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7943, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7945, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7946, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7947, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7949, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7951, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7952, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7953, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7954, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7955, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7956, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7957, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7958, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7959, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7960, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7961, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7962, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7963, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7964, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7965, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7966, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3587, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7967, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7969, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7970, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7971, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7972, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7973, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7974, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7976, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7978, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7979, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7980, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3594, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7981, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7983, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7984, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7985, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7986, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7987, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7989, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7991, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7992, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7993, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7994, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7996, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7997, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 7999, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8001, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8002, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8003, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8004, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8006, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8007, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8008, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8009, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8010, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8011, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8012, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8013, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8015, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8016, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8017, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8018, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8020, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8021, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8022, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8023, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8024, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8026, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8028, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8029, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8030, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8031, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8033, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8034, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8036, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8037, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8039, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8040, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8041, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8042, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8043, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8044, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8045, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8046, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8048, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8049, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8050, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8051, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8052, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8053, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8055, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8056, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8058, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8060, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3642, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8062, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3646, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8063, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8064, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8065, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8066, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 3651, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+    {UTF8PROC_CATEGORY_LO, 0, UTF8PROC_BIDI_CLASS_L, 0, 8067, UINT16_MAX, UINT16_MAX, UINT16_MAX,
+        UINT16_MAX, UINT16_MAX, false, false, false, false, 2, 0, UTF8PROC_BOUNDCLASS_OTHER},
+};
+
+static const utf8proc_uint16_t utf8proc_combinations[] = {
+    0,
+    46,
+    192,
+    193,
+    194,
+    195,
+    196,
+    197,
+    0,
+    256,
+    258,
+    260,
+    550,
+    461,
+    0,
+    0,
+    512,
+    514,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7680,
+    7840,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7842,
+    1,
+    11,
+    262,
+    264,
+    0,
+    0,
+    0,
+    199,
+    0,
+    0,
+    0,
+    266,
+    268,
+    0,
+    46,
+    200,
+    201,
+    202,
+    7868,
+    203,
+    0,
+    552,
+    274,
+    276,
+    280,
+    278,
+    282,
+    0,
+    0,
+    516,
+    518,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7864,
+    0,
+    7704,
+    7706,
+    0,
+    0,
+    7866,
+    0,
+    46,
+    204,
+    205,
+    206,
+    296,
+    207,
+    0,
+    0,
+    298,
+    300,
+    302,
+    304,
+    463,
+    0,
+    0,
+    520,
+    522,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7882,
+    0,
+    0,
+    7724,
+    0,
+    0,
+    7880,
+    0,
+    42,
+    504,
+    323,
+    0,
+    209,
+    0,
+    0,
+    325,
+    0,
+    0,
+    0,
+    7748,
+    327,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7750,
+    7752,
+    7754,
+    0,
+    46,
+    210,
+    211,
+    212,
+    213,
+    214,
+    0,
+    0,
+    332,
+    334,
+    490,
+    558,
+    465,
+    336,
+    416,
+    524,
+    526,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7884,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7886,
+    0,
+    46,
+    217,
+    218,
+    219,
+    360,
+    220,
+    366,
+    0,
+    362,
+    364,
+    370,
+    0,
+    467,
+    368,
+    431,
+    532,
+    534,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7908,
+    0,
+    7798,
+    7796,
+    0,
+    7794,
+    7910,
+    0,
+    46,
+    7922,
+    221,
+    374,
+    7928,
+    376,
+    0,
+    0,
+    562,
+    0,
+    0,
+    7822,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7924,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7926,
+    0,
+    46,
+    224,
+    225,
+    226,
+    227,
+    228,
+    229,
+    0,
+    257,
+    259,
+    261,
+    551,
+    462,
+    0,
+    0,
+    513,
+    515,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7681,
+    7841,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7843,
+    1,
+    11,
+    263,
+    265,
+    0,
+    0,
+    0,
+    231,
+    0,
+    0,
+    0,
+    267,
+    269,
+    0,
+    46,
+    232,
+    233,
+    234,
+    7869,
+    235,
+    0,
+    553,
+    275,
+    277,
+    281,
+    279,
+    283,
+    0,
+    0,
+    517,
+    519,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7865,
+    0,
+    7705,
+    7707,
+    0,
+    0,
+    7867,
+    0,
+    46,
+    236,
+    237,
+    238,
+    297,
+    239,
+    0,
+    0,
+    299,
+    301,
+    303,
+    0,
+    464,
+    0,
+    0,
+    521,
+    523,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7883,
+    0,
+    0,
+    7725,
+    0,
+    0,
+    7881,
+    0,
+    42,
+    505,
+    324,
+    0,
+    241,
+    0,
+    0,
+    326,
+    0,
+    0,
+    0,
+    7749,
+    328,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7751,
+    7753,
+    7755,
+    0,
+    46,
+    242,
+    243,
+    244,
+    245,
+    246,
+    0,
+    0,
+    333,
+    335,
+    491,
+    559,
+    466,
+    337,
+    417,
+    525,
+    527,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7885,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7887,
+    0,
+    46,
+    249,
+    250,
+    251,
+    361,
+    252,
+    367,
+    0,
+    363,
+    365,
+    371,
+    0,
+    468,
+    369,
+    432,
+    533,
+    535,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7909,
+    0,
+    7799,
+    7797,
+    0,
+    7795,
+    7911,
+    0,
+    46,
+    7923,
+    253,
+    375,
+    7929,
+    255,
+    7833,
+    0,
+    563,
+    0,
+    0,
+    7823,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7925,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7927,
+    6,
+    42,
+    7696,
+    0,
+    0,
+    0,
+    7690,
+    270,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7692,
+    7694,
+    7698,
+    6,
+    42,
+    7697,
+    0,
+    0,
+    0,
+    7691,
+    271,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7693,
+    7695,
+    7699,
+    1,
+    11,
+    500,
+    284,
+    0,
+    0,
+    0,
+    290,
+    7712,
+    286,
+    0,
+    288,
+    486,
+    1,
+    11,
+    501,
+    285,
+    0,
+    0,
+    0,
+    291,
+    7713,
+    287,
+    0,
+    289,
+    487,
+    2,
+    44,
+    292,
+    0,
+    7718,
+    0,
+    7720,
+    0,
+    0,
+    0,
+    7714,
+    542,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7716,
+    0,
+    0,
+    0,
+    7722,
+    2,
+    44,
+    293,
+    0,
+    7719,
+    0,
+    7721,
+    0,
+    0,
+    0,
+    7715,
+    543,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7717,
+    7830,
+    0,
+    0,
+    7723,
+    2,
+    2,
+    308,
+    2,
+    11,
+    309,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    496,
+    1,
+    41,
+    7728,
+    0,
+    0,
+    0,
+    0,
+    310,
+    0,
+    0,
+    0,
+    0,
+    488,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7730,
+    7732,
+    1,
+    41,
+    7729,
+    0,
+    0,
+    0,
+    0,
+    311,
+    0,
+    0,
+    0,
+    0,
+    489,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7731,
+    7733,
+    1,
+    42,
+    313,
+    0,
+    0,
+    0,
+    0,
+    315,
+    0,
+    0,
+    0,
+    0,
+    317,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7734,
+    7738,
+    7740,
+    1,
+    42,
+    314,
+    0,
+    0,
+    0,
+    0,
+    316,
+    0,
+    0,
+    0,
+    0,
+    318,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7735,
+    7739,
+    7741,
+    1,
+    41,
+    340,
+    0,
+    0,
+    0,
+    0,
+    342,
+    0,
+    0,
+    0,
+    7768,
+    344,
+    0,
+    0,
+    528,
+    530,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7770,
+    7774,
+    1,
+    41,
+    341,
+    0,
+    0,
+    0,
+    0,
+    343,
+    0,
+    0,
+    0,
+    7769,
+    345,
+    0,
+    0,
+    529,
+    531,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7771,
+    7775,
+    1,
+    40,
+    346,
+    348,
+    0,
+    0,
+    0,
+    350,
+    0,
+    0,
+    0,
+    7776,
+    352,
+    0,
+    0,
+    0,
+    0,
+    536,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7778,
+    1,
+    40,
+    347,
+    349,
+    0,
+    0,
+    0,
+    351,
+    0,
+    0,
+    0,
+    7777,
+    353,
+    0,
+    0,
+    0,
+    0,
+    537,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7779,
+    6,
+    42,
+    354,
+    0,
+    0,
+    0,
+    7786,
+    356,
+    0,
+    0,
+    0,
+    0,
+    538,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7788,
+    7790,
+    7792,
+    4,
+    42,
+    7831,
+    0,
+    355,
+    0,
+    0,
+    0,
+    7787,
+    357,
+    0,
+    0,
+    0,
+    0,
+    539,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7789,
+    7791,
+    7793,
+    0,
+    40,
+    7808,
+    7810,
+    372,
+    0,
+    7812,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7814,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7816,
+    0,
+    40,
+    7809,
+    7811,
+    373,
+    0,
+    7813,
+    7832,
+    0,
+    0,
+    0,
+    0,
+    7815,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7817,
+    1,
+    41,
+    377,
+    7824,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    379,
+    381,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7826,
+    7828,
+    1,
+    41,
+    378,
+    7825,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    380,
+    382,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7827,
+    7829,
+    0,
+    11,
+    475,
+    471,
+    0,
+    0,
+    0,
+    0,
+    0,
+    469,
+    0,
+    0,
+    0,
+    473,
+    0,
+    11,
+    476,
+    472,
+    0,
+    0,
+    0,
+    0,
+    0,
+    470,
+    0,
+    0,
+    0,
+    474,
+    7,
+    7,
+    478,
+    7,
+    7,
+    479,
+    7,
+    7,
+    480,
+    7,
+    7,
+    481,
+    1,
+    7,
+    508,
+    0,
+    0,
+    0,
+    0,
+    0,
+    482,
+    1,
+    7,
+    509,
+    0,
+    0,
+    0,
+    0,
+    0,
+    483,
+    7,
+    7,
+    492,
+    7,
+    7,
+    493,
+    11,
+    11,
+    494,
+    11,
+    11,
+    495,
+    1,
+    1,
+    506,
+    1,
+    1,
+    507,
+    1,
+    1,
+    510,
+    1,
+    1,
+    511,
+    7,
+    7,
+    554,
+    7,
+    7,
+    555,
+    1,
+    7,
+    7756,
+    0,
+    0,
+    7758,
+    0,
+    0,
+    556,
+    1,
+    7,
+    7757,
+    0,
+    0,
+    7759,
+    0,
+    0,
+    557,
+    7,
+    7,
+    560,
+    7,
+    7,
+    561,
+    0,
+    49,
+    8173,
+    901,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8129,
+    0,
+    50,
+    8122,
+    902,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8121,
+    8120,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7944,
+    7945,
+    0,
+    8124,
+    0,
+    48,
+    8136,
+    904,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7960,
+    7961,
+    0,
+    50,
+    8138,
+    905,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7976,
+    7977,
+    0,
+    8140,
+    0,
+    48,
+    8154,
+    906,
+    0,
+    0,
+    938,
+    0,
+    0,
+    8153,
+    8152,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7992,
+    7993,
+    0,
+    48,
+    8184,
+    908,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8008,
+    8009,
+    0,
+    48,
+    8170,
+    910,
+    0,
+    0,
+    939,
+    0,
+    0,
+    8169,
+    8168,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8025,
+    0,
+    50,
+    8186,
+    911,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8040,
+    8041,
+    0,
+    8188,
+    0,
+    49,
+    8146,
+    912,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8151,
+    0,
+    50,
+    8048,
+    940,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8113,
+    8112,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7936,
+    7937,
+    8118,
+    8115,
+    0,
+    48,
+    8050,
+    941,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7952,
+    7953,
+    0,
+    50,
+    8052,
+    942,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7968,
+    7969,
+    8134,
+    8131,
+    0,
+    49,
+    8054,
+    943,
+    0,
+    0,
+    970,
+    0,
+    0,
+    8145,
+    8144,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7984,
+    7985,
+    8150,
+    0,
+    49,
+    8162,
+    944,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8167,
+    0,
+    49,
+    8058,
+    973,
+    0,
+    0,
+    971,
+    0,
+    0,
+    8161,
+    8160,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8016,
+    8017,
+    8166,
+    0,
+    48,
+    8056,
+    972,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8000,
+    8001,
+    0,
+    50,
+    8060,
+    974,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8032,
+    8033,
+    8182,
+    8179,
+    1,
+    4,
+    979,
+    0,
+    0,
+    980,
+    0,
+    8,
+    1024,
+    0,
+    0,
+    0,
+    1025,
+    0,
+    0,
+    0,
+    1238,
+    1,
+    1,
+    1027,
+    4,
+    4,
+    1031,
+    1,
+    1,
+    1036,
+    0,
+    8,
+    1037,
+    0,
+    0,
+    0,
+    1252,
+    0,
+    0,
+    1250,
+    1049,
+    4,
+    12,
+    1264,
+    0,
+    0,
+    1262,
+    1038,
+    0,
+    0,
+    0,
+    1266,
+    0,
+    8,
+    1117,
+    0,
+    0,
+    0,
+    1253,
+    0,
+    0,
+    1251,
+    1081,
+    0,
+    8,
+    1104,
+    0,
+    0,
+    0,
+    1105,
+    0,
+    0,
+    0,
+    1239,
+    1,
+    1,
+    1107,
+    4,
+    4,
+    1111,
+    1,
+    1,
+    1116,
+    4,
+    12,
+    1265,
+    0,
+    0,
+    1263,
+    1118,
+    0,
+    0,
+    0,
+    1267,
+    14,
+    14,
+    1142,
+    14,
+    14,
+    1143,
+    4,
+    8,
+    1244,
+    0,
+    0,
+    0,
+    1217,
+    4,
+    8,
+    1245,
+    0,
+    0,
+    0,
+    1218,
+    4,
+    8,
+    1234,
+    0,
+    0,
+    0,
+    1232,
+    4,
+    8,
+    1235,
+    0,
+    0,
+    0,
+    1233,
+    4,
+    4,
+    1242,
+    4,
+    4,
+    1243,
+    4,
+    4,
+    1246,
+    4,
+    4,
+    1247,
+    4,
+    4,
+    1254,
+    4,
+    4,
+    1255,
+    4,
+    4,
+    1258,
+    4,
+    4,
+    1259,
+    4,
+    4,
+    1260,
+    4,
+    4,
+    1261,
+    4,
+    4,
+    1268,
+    4,
+    4,
+    1269,
+    4,
+    4,
+    1272,
+    4,
+    4,
+    1273,
+    17,
+    19,
+    1570,
+    1571,
+    1573,
+    18,
+    18,
+    1572,
+    18,
+    18,
+    1574,
+    18,
+    18,
+    1728,
+    18,
+    18,
+    1730,
+    18,
+    18,
+    1747,
+    20,
+    20,
+    2345,
+    20,
+    20,
+    2353,
+    20,
+    20,
+    2356,
+    21,
+    22,
+    2507,
+    2508,
+    23,
+    25,
+    2888,
+    2891,
+    2892,
+    26,
+    26,
+    2964,
+    26,
+    27,
+    3020,
+    3018,
+    27,
+    27,
+    3019,
+    28,
+    28,
+    3144,
+    29,
+    29,
+    3264,
+    29,
+    31,
+    3271,
+    3272,
+    3274,
+    29,
+    29,
+    3275,
+    32,
+    33,
+    3402,
+    3404,
+    32,
+    32,
+    3403,
+    34,
+    36,
+    3546,
+    3548,
+    3550,
+    34,
+    34,
+    3549,
+    37,
+    37,
+    4134,
+    38,
+    38,
+    6918,
+    38,
+    38,
+    6920,
+    38,
+    38,
+    6922,
+    38,
+    38,
+    6924,
+    38,
+    38,
+    6926,
+    38,
+    38,
+    6930,
+    38,
+    38,
+    6971,
+    38,
+    38,
+    6973,
+    38,
+    38,
+    6976,
+    38,
+    38,
+    6977,
+    38,
+    38,
+    6979,
+    10,
+    41,
+    7682,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7684,
+    7686,
+    10,
+    41,
+    7683,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7685,
+    7687,
+    1,
+    1,
+    7688,
+    1,
+    1,
+    7689,
+    0,
+    1,
+    7700,
+    7702,
+    0,
+    1,
+    7701,
+    7703,
+    8,
+    8,
+    7708,
+    8,
+    8,
+    7709,
+    10,
+    10,
+    7710,
+    10,
+    10,
+    7711,
+    1,
+    1,
+    7726,
+    1,
+    1,
+    7727,
+    7,
+    7,
+    7736,
+    7,
+    7,
+    7737,
+    1,
+    40,
+    7742,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7744,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7746,
+    1,
+    40,
+    7743,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7745,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7747,
+    0,
+    1,
+    7760,
+    7762,
+    0,
+    1,
+    7761,
+    7763,
+    1,
+    10,
+    7764,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7766,
+    1,
+    10,
+    7765,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7767,
+    7,
+    7,
+    7772,
+    7,
+    7,
+    7773,
+    10,
+    10,
+    7780,
+    10,
+    10,
+    7781,
+    10,
+    10,
+    7782,
+    10,
+    10,
+    7783,
+    10,
+    10,
+    7784,
+    10,
+    10,
+    7785,
+    1,
+    1,
+    7800,
+    1,
+    1,
+    7801,
+    4,
+    4,
+    7802,
+    4,
+    4,
+    7803,
+    3,
+    40,
+    7804,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7806,
+    3,
+    40,
+    7805,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7807,
+    4,
+    10,
+    7820,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7818,
+    4,
+    10,
+    7821,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7819,
+    10,
+    10,
+    7835,
+    0,
+    46,
+    7846,
+    7844,
+    0,
+    7850,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7848,
+    0,
+    46,
+    7847,
+    7845,
+    0,
+    7851,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7849,
+    2,
+    8,
+    7852,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7862,
+    2,
+    8,
+    7853,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7863,
+    0,
+    46,
+    7856,
+    7854,
+    0,
+    7860,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7858,
+    0,
+    46,
+    7857,
+    7855,
+    0,
+    7861,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7859,
+    0,
+    46,
+    7872,
+    7870,
+    0,
+    7876,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7874,
+    0,
+    46,
+    7873,
+    7871,
+    0,
+    7877,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7875,
+    2,
+    2,
+    7878,
+    2,
+    2,
+    7879,
+    0,
+    46,
+    7890,
+    7888,
+    0,
+    7894,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7892,
+    0,
+    46,
+    7891,
+    7889,
+    0,
+    7895,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7893,
+    2,
+    2,
+    7896,
+    2,
+    2,
+    7897,
+    0,
+    46,
+    7900,
+    7898,
+    0,
+    7904,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7906,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7902,
+    0,
+    46,
+    7901,
+    7899,
+    0,
+    7905,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7907,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7903,
+    0,
+    46,
+    7914,
+    7912,
+    0,
+    7918,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7920,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7916,
+    0,
+    46,
+    7915,
+    7913,
+    0,
+    7919,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7921,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7917,
+    0,
+    50,
+    7938,
+    7940,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7942,
+    8064,
+    0,
+    50,
+    7939,
+    7941,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7943,
+    8065,
+    0,
+    50,
+    7946,
+    7948,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7950,
+    8072,
+    0,
+    50,
+    7947,
+    7949,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7951,
+    8073,
+    0,
+    1,
+    7954,
+    7956,
+    0,
+    1,
+    7955,
+    7957,
+    0,
+    1,
+    7962,
+    7964,
+    0,
+    1,
+    7963,
+    7965,
+    0,
+    50,
+    7970,
+    7972,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7974,
+    8080,
+    0,
+    50,
+    7971,
+    7973,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7975,
+    8081,
+    0,
+    50,
+    7978,
+    7980,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7982,
+    8088,
+    0,
+    50,
+    7979,
+    7981,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7983,
+    8089,
+    0,
+    49,
+    7986,
+    7988,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7990,
+    0,
+    49,
+    7987,
+    7989,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7991,
+    0,
+    49,
+    7994,
+    7996,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7998,
+    0,
+    49,
+    7995,
+    7997,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    7999,
+    0,
+    1,
+    8002,
+    8004,
+    0,
+    1,
+    8003,
+    8005,
+    0,
+    1,
+    8010,
+    8012,
+    0,
+    1,
+    8011,
+    8013,
+    0,
+    49,
+    8018,
+    8020,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8022,
+    0,
+    49,
+    8019,
+    8021,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8023,
+    0,
+    49,
+    8027,
+    8029,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8031,
+    0,
+    50,
+    8034,
+    8036,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8038,
+    8096,
+    0,
+    50,
+    8035,
+    8037,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8039,
+    8097,
+    0,
+    50,
+    8042,
+    8044,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8046,
+    8104,
+    0,
+    50,
+    8043,
+    8045,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8047,
+    8105,
+    50,
+    50,
+    8066,
+    50,
+    50,
+    8067,
+    50,
+    50,
+    8068,
+    50,
+    50,
+    8069,
+    50,
+    50,
+    8070,
+    50,
+    50,
+    8071,
+    50,
+    50,
+    8074,
+    50,
+    50,
+    8075,
+    50,
+    50,
+    8076,
+    50,
+    50,
+    8077,
+    50,
+    50,
+    8078,
+    50,
+    50,
+    8079,
+    50,
+    50,
+    8082,
+    50,
+    50,
+    8083,
+    50,
+    50,
+    8084,
+    50,
+    50,
+    8085,
+    50,
+    50,
+    8086,
+    50,
+    50,
+    8087,
+    50,
+    50,
+    8090,
+    50,
+    50,
+    8091,
+    50,
+    50,
+    8092,
+    50,
+    50,
+    8093,
+    50,
+    50,
+    8094,
+    50,
+    50,
+    8095,
+    50,
+    50,
+    8098,
+    50,
+    50,
+    8099,
+    50,
+    50,
+    8100,
+    50,
+    50,
+    8101,
+    50,
+    50,
+    8102,
+    50,
+    50,
+    8103,
+    50,
+    50,
+    8106,
+    50,
+    50,
+    8107,
+    50,
+    50,
+    8108,
+    50,
+    50,
+    8109,
+    50,
+    50,
+    8110,
+    50,
+    50,
+    8111,
+    50,
+    50,
+    8114,
+    50,
+    50,
+    8116,
+    50,
+    50,
+    8119,
+    50,
+    50,
+    8130,
+    50,
+    50,
+    8132,
+    50,
+    50,
+    8135,
+    0,
+    49,
+    8141,
+    8142,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8143,
+    0,
+    49,
+    8157,
+    8158,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    8159,
+    47,
+    48,
+    8164,
+    8165,
+    48,
+    48,
+    8172,
+    50,
+    50,
+    8178,
+    50,
+    50,
+    8180,
+    50,
+    50,
+    8183,
+    51,
+    51,
+    8602,
+    51,
+    51,
+    8603,
+    51,
+    51,
+    8622,
+    51,
+    51,
+    8653,
+    51,
+    51,
+    8654,
+    51,
+    51,
+    8655,
+    51,
+    51,
+    8708,
+    51,
+    51,
+    8713,
+    51,
+    51,
+    8716,
+    51,
+    51,
+    8740,
+    51,
+    51,
+    8742,
+    51,
+    51,
+    8769,
+    51,
+    51,
+    8772,
+    51,
+    51,
+    8775,
+    51,
+    51,
+    8777,
+    51,
+    51,
+    8800,
+    51,
+    51,
+    8802,
+    51,
+    51,
+    8813,
+    51,
+    51,
+    8814,
+    51,
+    51,
+    8815,
+    51,
+    51,
+    8816,
+    51,
+    51,
+    8817,
+    51,
+    51,
+    8820,
+    51,
+    51,
+    8821,
+    51,
+    51,
+    8824,
+    51,
+    51,
+    8825,
+    51,
+    51,
+    8832,
+    51,
+    51,
+    8833,
+    51,
+    51,
+    8836,
+    51,
+    51,
+    8837,
+    51,
+    51,
+    8840,
+    51,
+    51,
+    8841,
+    51,
+    51,
+    8876,
+    51,
+    51,
+    8877,
+    51,
+    51,
+    8878,
+    51,
+    51,
+    8879,
+    51,
+    51,
+    8928,
+    51,
+    51,
+    8929,
+    51,
+    51,
+    8930,
+    51,
+    51,
+    8931,
+    51,
+    51,
+    8938,
+    51,
+    51,
+    8939,
+    51,
+    51,
+    8940,
+    51,
+    51,
+    8941,
+    51,
+    51,
+    10972,
+    52,
+    52,
+    12364,
+    52,
+    52,
+    12366,
+    52,
+    52,
+    12368,
+    52,
+    52,
+    12370,
+    52,
+    52,
+    12372,
+    52,
+    52,
+    12374,
+    52,
+    52,
+    12376,
+    52,
+    52,
+    12378,
+    52,
+    52,
+    12380,
+    52,
+    52,
+    12382,
+    52,
+    52,
+    12384,
+    52,
+    52,
+    12386,
+    52,
+    52,
+    12389,
+    52,
+    52,
+    12391,
+    52,
+    52,
+    12393,
+    52,
+    53,
+    12400,
+    12401,
+    52,
+    53,
+    12403,
+    12404,
+    52,
+    53,
+    12406,
+    12407,
+    52,
+    53,
+    12409,
+    12410,
+    52,
+    53,
+    12412,
+    12413,
+    52,
+    52,
+    12436,
+    52,
+    52,
+    12446,
+    52,
+    52,
+    12460,
+    52,
+    52,
+    12462,
+    52,
+    52,
+    12464,
+    52,
+    52,
+    12466,
+    52,
+    52,
+    12468,
+    52,
+    52,
+    12470,
+    52,
+    52,
+    12472,
+    52,
+    52,
+    12474,
+    52,
+    52,
+    12476,
+    52,
+    52,
+    12478,
+    52,
+    52,
+    12480,
+    52,
+    52,
+    12482,
+    52,
+    52,
+    12485,
+    52,
+    52,
+    12487,
+    52,
+    52,
+    12489,
+    52,
+    53,
+    12496,
+    12497,
+    52,
+    53,
+    12499,
+    12500,
+    52,
+    53,
+    12502,
+    12503,
+    52,
+    53,
+    12505,
+    12506,
+    52,
+    53,
+    12508,
+    12509,
+    52,
+    52,
+    12532,
+    52,
+    52,
+    12535,
+    52,
+    52,
+    12536,
+    52,
+    52,
+    12537,
+    52,
+    52,
+    12538,
+    52,
+    52,
+    12542,
+    54,
+    55,
+    1,
+    4250,
+    54,
+    55,
+    1,
+    4252,
+    54,
+    55,
+    1,
+    4267,
+    56,
+    57,
+    1,
+    4398,
+    56,
+    57,
+    1,
+    4399,
+    58,
+    61,
+    1,
+    4939,
+    1,
+    4940,
+    62,
+    67,
+    1,
+    5307,
+    1,
+    5308,
+    1,
+    5310,
+    68,
+    69,
+    1,
+    5562,
+    68,
+    69,
+    1,
+    5563,
+    70,
+    71,
+    1,
+    53598,
+    70,
+    71,
+    1,
+    53599,
+    72,
+    81,
+    1,
+    53600,
+    1,
+    53601,
+    1,
+    53602,
+    1,
+    53603,
+    1,
+    53604,
+    70,
+    71,
+    1,
+    53691,
+    70,
+    71,
+    1,
+    53692,
+    72,
+    75,
+    1,
+    53693,
+    1,
+    53695,
+    72,
+    75,
+    1,
+    53694,
+    1,
+    53696,
+};
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/include/utf8proc_wrapper.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/include/utf8proc_wrapper.h
new file mode 100644
index 0000000000..8c2cf712ee
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/include/utf8proc_wrapper.h
@@ -0,0 +1,35 @@
+#pragma once
+
+#include <cassert>
+#include <cstdint>
+#include <cstring>
+#include <string>
+
+namespace lbug {
+namespace utf8proc {
+
+enum class UnicodeType { INVALID, ASCII, UNICODE };
+enum class UnicodeInvalidReason { BYTE_MISMATCH, INVALID_UNICODE };
+
+class Utf8Proc {
+public:
+    static UnicodeType analyze(const char* s, size_t len,
+        UnicodeInvalidReason* invalidReason = nullptr, size_t* invalidPos = nullptr);
+
+    static char* normalize(const char* s, size_t len);
+
+    static bool isValid(const char* s, size_t len);
+
+    static size_t previousGraphemeCluster(const char* s, size_t len, size_t charPos);
+
+    static int32_t utf8ToCodepoint(const char* c, int& size);
+
+    static uint32_t renderWidth(const char* s, size_t pos);
+
+    static int codepointLength(int cp);
+
+    static bool codepointToUtf8(int cp, int &sz, char *c);
+};
+
+} // namespace utf8proc
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/utf8proc.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/utf8proc.cpp
new file mode 100644
index 0000000000..2c2170c4a4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/utf8proc.cpp
@@ -0,0 +1,920 @@
+/* -*- mode: c; c-basic-offset: 2; tab-width: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Copyright (c) 2014-2019 Steven G. Johnson, Jiahao Chen, Peter Colberg, Tony Kelman, Scott P.
+ * Jones, and other contributors. Copyright (c) 2009 Public Software Group e. V., Berlin, Germany
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining a
+ *  copy of this software and associated documentation files (the "Software"),
+ *  to deal in the Software without restriction, including without limitation
+ *  the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ *  and/or sell copies of the Software, and to permit persons to whom the
+ *  Software is furnished to do so, subject to the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be included in
+ *  all copies or substantial portions of the Software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ *  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ *  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ *  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ *  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ *  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+ *  DEALINGS IN THE SOFTWARE.
+ */
+
+/*
+ *  This library contains derived data from a modified version of the
+ *  Unicode data files.
+ *
+ *  The original data files are available at
+ *  http://www.unicode.org/Public/UNIDATA/
+ *
+ *  Please notice the copyright statement in the file "utf8proc_data.c".
+ */
+
+/*
+ *  File name:    utf8proc.c
+ *
+ *  Description:
+ *  Implementation of libutf8proc.
+ */
+
+#include "include/utf8proc.h"
+
+#include "include/utf8proc_data.h"
+
+namespace lbug {
+namespace utf8proc {
+
+#ifndef SSIZE_MAX
+#define SSIZE_MAX ((size_t)SIZE_MAX / 2)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX 65535U
+#endif
+
+// UTF8PROC_DLLEXPORT const utf8proc_int8_t utf8proc_utf8class[256] = {
+// 	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+// 	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+// 	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+// 	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+// 	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+// 	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+// 	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+// 	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+// 	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+// 	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+// 	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+// 	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+// 	2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+// 	2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+// 	3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+// 	4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0 };
+
+#define UTF8PROC_HANGUL_SBASE 0xAC00
+#define UTF8PROC_HANGUL_LBASE 0x1100
+#define UTF8PROC_HANGUL_VBASE 0x1161
+#define UTF8PROC_HANGUL_TBASE 0x11A7
+#define UTF8PROC_HANGUL_LCOUNT 19
+#define UTF8PROC_HANGUL_VCOUNT 21
+#define UTF8PROC_HANGUL_TCOUNT 28
+#define UTF8PROC_HANGUL_NCOUNT 588
+#define UTF8PROC_HANGUL_SCOUNT 11172
+/* END is exclusive */
+#define UTF8PROC_HANGUL_L_START 0x1100
+#define UTF8PROC_HANGUL_L_END 0x115A
+#define UTF8PROC_HANGUL_L_FILLER 0x115F
+#define UTF8PROC_HANGUL_V_START 0x1160
+#define UTF8PROC_HANGUL_V_END 0x11A3
+#define UTF8PROC_HANGUL_T_START 0x11A8
+#define UTF8PROC_HANGUL_T_END 0x11FA
+#define UTF8PROC_HANGUL_S_START 0xAC00
+#define UTF8PROC_HANGUL_S_END 0xD7A4
+
+/* Should follow semantic-versioning rules (semver.org) based on API
+     compatibility.  (Note that the shared-library version number will
+     be different, being based on ABI compatibility.): */
+#define STRINGIZEx(x) #x
+#define STRINGIZE(x) STRINGIZEx(x)
+UTF8PROC_DLLEXPORT const char* utf8proc_version(void) {
+    return STRINGIZE(UTF8PROC_VERSION_MAJOR) "." STRINGIZE(UTF8PROC_VERSION_MINOR) "." STRINGIZE(
+        UTF8PROC_VERSION_PATCH) "";
+}
+
+UTF8PROC_DLLEXPORT const char* utf8proc_unicode_version(void) {
+    return "12.1.0";
+}
+
+UTF8PROC_DLLEXPORT const char* utf8proc_errmsg(utf8proc_ssize_t errcode) {
+    switch (errcode) {
+    case UTF8PROC_ERROR_NOMEM:
+        return "Memory for processing UTF-8 data could not be allocated.";
+    case UTF8PROC_ERROR_OVERFLOW:
+        return "UTF-8 string is too long to be processed.";
+    case UTF8PROC_ERROR_INVALIDUTF8:
+        return "Invalid UTF-8 string";
+    case UTF8PROC_ERROR_NOTASSIGNED:
+        return "Unassigned Unicode code point found in UTF-8 string.";
+    case UTF8PROC_ERROR_INVALIDOPTS:
+        return "Invalid options for UTF-8 processing chosen.";
+    default:
+        return "An unknown error occurred while processing UTF-8 data.";
+    }
+}
+
+#define utf_cont(ch) (((ch)&0xc0) == 0x80)
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_iterate(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t strlen, utf8proc_int32_t* dst) {
+    utf8proc_uint32_t uc;
+    const utf8proc_uint8_t* end;
+
+    *dst = -1;
+    if (!strlen)
+        return 0;
+    end = str + ((strlen < 0) ? 4 : strlen);
+    uc = *str++;
+    if (uc < 0x80) {
+        *dst = uc;
+        return 1;
+    }
+    // Must be between 0xc2 and 0xf4 inclusive to be valid
+    if ((uc - 0xc2) > (0xf4 - 0xc2))
+        return UTF8PROC_ERROR_INVALIDUTF8;
+    if (uc < 0xe0) { // 2-byte sequence
+        // Must have valid continuation character
+        if (str >= end || !utf_cont(*str))
+            return UTF8PROC_ERROR_INVALIDUTF8;
+        *dst = ((uc & 0x1f) << 6) | (*str & 0x3f);
+        return 2;
+    }
+    if (uc < 0xf0) { // 3-byte sequence
+        if ((str + 1 >= end) || !utf_cont(*str) || !utf_cont(str[1]))
+            return UTF8PROC_ERROR_INVALIDUTF8;
+        // Check for surrogate chars
+        if (uc == 0xed && *str > 0x9f)
+            return UTF8PROC_ERROR_INVALIDUTF8;
+        uc = ((uc & 0xf) << 12) | ((*str & 0x3f) << 6) | (str[1] & 0x3f);
+        if (uc < 0x800)
+            return UTF8PROC_ERROR_INVALIDUTF8;
+        *dst = uc;
+        return 3;
+    }
+    // 4-byte sequence
+    // Must have 3 valid continuation characters
+    if ((str + 2 >= end) || !utf_cont(*str) || !utf_cont(str[1]) || !utf_cont(str[2]))
+        return UTF8PROC_ERROR_INVALIDUTF8;
+    // Make sure in correct range (0x10000 - 0x10ffff)
+    if (uc == 0xf0) {
+        if (*str < 0x90)
+            return UTF8PROC_ERROR_INVALIDUTF8;
+    } else if (uc == 0xf4) {
+        if (*str > 0x8f)
+            return UTF8PROC_ERROR_INVALIDUTF8;
+    }
+    *dst = ((uc & 7) << 18) | ((*str & 0x3f) << 12) | ((str[1] & 0x3f) << 6) | (str[2] & 0x3f);
+    return 4;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_bool utf8proc_codepoint_valid(utf8proc_int32_t uc) {
+    return (((utf8proc_uint32_t)uc) - 0xd800 > 0x07ff) && ((utf8proc_uint32_t)uc < 0x110000);
+}
+
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_encode_char(
+    utf8proc_int32_t uc, utf8proc_uint8_t* dst) {
+    if (uc < 0x00) {
+        return 0;
+    } else if (uc < 0x80) {
+        dst[0] = (utf8proc_uint8_t)uc;
+        return 1;
+    } else if (uc < 0x800) {
+        dst[0] = (utf8proc_uint8_t)(0xC0 + (uc >> 6));
+        dst[1] = (utf8proc_uint8_t)(0x80 + (uc & 0x3F));
+        return 2;
+        // Note: we allow encoding 0xd800-0xdfff here, so as not to change
+        // the API, however, these are actually invalid in UTF-8
+    } else if (uc < 0x10000) {
+        dst[0] = (utf8proc_uint8_t)(0xE0 + (uc >> 12));
+        dst[1] = (utf8proc_uint8_t)(0x80 + ((uc >> 6) & 0x3F));
+        dst[2] = (utf8proc_uint8_t)(0x80 + (uc & 0x3F));
+        return 3;
+    } else if (uc < 0x110000) {
+        dst[0] = (utf8proc_uint8_t)(0xF0 + (uc >> 18));
+        dst[1] = (utf8proc_uint8_t)(0x80 + ((uc >> 12) & 0x3F));
+        dst[2] = (utf8proc_uint8_t)(0x80 + ((uc >> 6) & 0x3F));
+        dst[3] = (utf8proc_uint8_t)(0x80 + (uc & 0x3F));
+        return 4;
+    } else
+        return 0;
+}
+
+/* internal version used for inserting 0xff bytes between graphemes */
+static utf8proc_ssize_t charbound_encode_char(utf8proc_int32_t uc, utf8proc_uint8_t* dst) {
+    if (uc < 0x00) {
+        if (uc == -1) { /* internal value used for grapheme breaks */
+            dst[0] = (utf8proc_uint8_t)0xFF;
+            return 1;
+        }
+        return 0;
+    } else if (uc < 0x80) {
+        dst[0] = (utf8proc_uint8_t)uc;
+        return 1;
+    } else if (uc < 0x800) {
+        dst[0] = (utf8proc_uint8_t)(0xC0 + (uc >> 6));
+        dst[1] = (utf8proc_uint8_t)(0x80 + (uc & 0x3F));
+        return 2;
+    } else if (uc < 0x10000) {
+        dst[0] = (utf8proc_uint8_t)(0xE0 + (uc >> 12));
+        dst[1] = (utf8proc_uint8_t)(0x80 + ((uc >> 6) & 0x3F));
+        dst[2] = (utf8proc_uint8_t)(0x80 + (uc & 0x3F));
+        return 3;
+    } else if (uc < 0x110000) {
+        dst[0] = (utf8proc_uint8_t)(0xF0 + (uc >> 18));
+        dst[1] = (utf8proc_uint8_t)(0x80 + ((uc >> 12) & 0x3F));
+        dst[2] = (utf8proc_uint8_t)(0x80 + ((uc >> 6) & 0x3F));
+        dst[3] = (utf8proc_uint8_t)(0x80 + (uc & 0x3F));
+        return 4;
+    } else
+        return 0;
+}
+
+/* internal "unsafe" version that does not check whether uc is in range */
+static const utf8proc_property_t* unsafe_get_property(utf8proc_int32_t uc) {
+    /* ASSERT: uc >= 0 && uc < 0x110000 */
+    return utf8proc_properties +
+           (utf8proc_stage2table[utf8proc_stage1table[uc >> 8] + (uc & 0xFF)]);
+}
+
+UTF8PROC_DLLEXPORT const utf8proc_property_t* utf8proc_get_property(utf8proc_int32_t uc) {
+    return uc < 0 || uc >= 0x110000 ? utf8proc_properties : unsafe_get_property(uc);
+}
+
+/* return whether there is a grapheme break between boundclasses lbc and tbc
+     (according to the definition of extended grapheme clusters)
+
+    Rule numbering refers to TR29 Version 29 (Unicode 9.0.0):
+    http://www.unicode.org/reports/tr29/tr29-29.html
+
+    CAVEATS:
+     Please note that evaluation of GB10 (grapheme breaks between emoji zwj sequences)
+     and GB 12/13 (regional indicator code points) require knowledge of previous characters
+     and are thus not handled by this function. This may result in an incorrect break before
+     an E_Modifier class codepoint and an incorrectly missing break between two
+     REGIONAL_INDICATOR class code points if such support does not exist in the caller.
+
+     See the special support in grapheme_break_extended, for required bookkeeping by the caller.
+*/
+static utf8proc_bool grapheme_break_simple(int lbc, int tbc) {
+    return (lbc == UTF8PROC_BOUNDCLASS_START) ? true : // GB1
+               (lbc == UTF8PROC_BOUNDCLASS_CR &&       // GB3
+                   tbc == UTF8PROC_BOUNDCLASS_LF) ?
+                                                false : // ---
+                   (lbc >= UTF8PROC_BOUNDCLASS_CR && lbc <= UTF8PROC_BOUNDCLASS_CONTROL) ?
+                                                true : // GB4
+                       (tbc >= UTF8PROC_BOUNDCLASS_CR && tbc <= UTF8PROC_BOUNDCLASS_CONTROL) ?
+                                                true :              // GB5
+                           (lbc == UTF8PROC_BOUNDCLASS_L &&         // GB6
+                               (tbc == UTF8PROC_BOUNDCLASS_L ||     // ---
+                                   tbc == UTF8PROC_BOUNDCLASS_V ||  // ---
+                                   tbc == UTF8PROC_BOUNDCLASS_LV || // ---
+                                   tbc == UTF8PROC_BOUNDCLASS_LVT)) ?
+                                                false :              // ---
+                               ((lbc == UTF8PROC_BOUNDCLASS_LV ||    // GB7
+                                    lbc == UTF8PROC_BOUNDCLASS_V) && // ---
+                                   (tbc == UTF8PROC_BOUNDCLASS_V ||  // ---
+                                       tbc == UTF8PROC_BOUNDCLASS_T)) ?
+                                                false :                  // ---
+                                   ((lbc == UTF8PROC_BOUNDCLASS_LVT ||   // GB8
+                                        lbc == UTF8PROC_BOUNDCLASS_T) && // ---
+                                       tbc == UTF8PROC_BOUNDCLASS_T) ?
+                                                false :                              // ---
+                                       (tbc == UTF8PROC_BOUNDCLASS_EXTEND ||         // GB9
+                                           tbc == UTF8PROC_BOUNDCLASS_ZWJ ||         // ---
+                                           tbc == UTF8PROC_BOUNDCLASS_SPACINGMARK || // GB9a
+                                           lbc == UTF8PROC_BOUNDCLASS_PREPEND) ?
+                                                false :                         // GB9b
+                                           (lbc == UTF8PROC_BOUNDCLASS_E_ZWG && // GB11 (requires
+                                                                                // additional
+                                                                                // handling below)
+                                               tbc == UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC) ?
+                                                false : // ----
+                                               (lbc == UTF8PROC_BOUNDCLASS_REGIONAL_INDICATOR && // GB12/13 (requires additional handling below)
+                                                   tbc == UTF8PROC_BOUNDCLASS_REGIONAL_INDICATOR) ?
+                                                false :  // ----
+                                                   true; // GB999
+}
+
+utf8proc_bool grapheme_break_extended(int lbc, int tbc, utf8proc_int32_t* state) {
+    int lbc_override = ((state && *state != UTF8PROC_BOUNDCLASS_START) ? *state : lbc);
+    utf8proc_bool break_permitted = grapheme_break_simple(lbc_override, tbc);
+    if (state) {
+        // Special support for GB 12/13 made possible by GB999. After two RI
+        // class codepoints we want to force a break. Do this by resetting the
+        // second RI's bound class to UTF8PROC_BOUNDCLASS_OTHER, to force a break
+        // after that character according to GB999 (unless of course such a break is
+        // forbidden by a different rule such as GB9).
+        if (*state == tbc && tbc == UTF8PROC_BOUNDCLASS_REGIONAL_INDICATOR)
+            *state = UTF8PROC_BOUNDCLASS_OTHER;
+        // Special support for GB11 (emoji extend* zwj / emoji)
+        else if (*state == UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC) {
+            if (tbc == UTF8PROC_BOUNDCLASS_EXTEND) // fold EXTEND codepoints into emoji
+                *state = UTF8PROC_BOUNDCLASS_EXTENDED_PICTOGRAPHIC;
+            else if (tbc == UTF8PROC_BOUNDCLASS_ZWJ)
+                *state = UTF8PROC_BOUNDCLASS_E_ZWG; // state to record emoji+zwg combo
+            else
+                *state = tbc;
+        } else
+            *state = tbc;
+    }
+    return break_permitted;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_bool utf8proc_grapheme_break_stateful(
+    utf8proc_int32_t c1, utf8proc_int32_t c2, utf8proc_int32_t* state) {
+
+    return grapheme_break_extended(
+        utf8proc_get_property(c1)->boundclass, utf8proc_get_property(c2)->boundclass, state);
+}
+
+UTF8PROC_DLLEXPORT utf8proc_bool utf8proc_grapheme_break(utf8proc_int32_t c1, utf8proc_int32_t c2) {
+    return utf8proc_grapheme_break_stateful(c1, c2, NULL);
+}
+
+// from http://www.zedwood.com/article/cpp-utf8-char-to-codepoint
+UTF8PROC_DLLEXPORT utf8proc_int32_t utf8proc_codepoint(const char* u_input, int& sz) {
+    auto u = (const unsigned char*)u_input;
+    unsigned char u0 = u[0];
+    if (u0 <= 127) {
+        sz = 1;
+        return u0;
+    }
+    unsigned char u1 = u[1];
+    if (u0 >= 192 && u0 <= 223) {
+        sz = 2;
+        return (u0 - 192) * 64 + (u1 - 128);
+    }
+    if (u[0] == 0xed && (u[1] & 0xa0) == 0xa0) {
+        return -1; // code points, 0xd800 to 0xdfff
+    }
+    unsigned char u2 = u[2];
+    if (u0 >= 224 && u0 <= 239) {
+        sz = 3;
+        return (u0 - 224) * 4096 + (u1 - 128) * 64 + (u2 - 128);
+    }
+    unsigned char u3 = u[3];
+    if (u0 >= 240 && u0 <= 247) {
+        sz = 4;
+        return (u0 - 240) * 262144 + (u1 - 128) * 4096 + (u2 - 128) * 64 + (u3 - 128);
+    }
+    return -1;
+}
+
+bool utf8proc_codepoint_to_utf8(int cp, int& sz, char* c) {
+    if (cp <= 0x7F) {
+        sz = 1;
+        c[0] = cp;
+    } else if (cp <= 0x7FF) {
+        sz = 2;
+        c[0] = (cp >> 6) + 192;
+        c[1] = (cp & 63) + 128;
+    } else if (0xd800 <= cp && cp <= 0xdfff) {
+        sz = -1;
+        // invalid block of utf
+        return false;
+    } else if (cp <= 0xFFFF) {
+        sz = 3;
+        c[0] = (cp >> 12) + 224;
+        c[1] = ((cp >> 6) & 63) + 128;
+        c[2] = (cp & 63) + 128;
+    } else if (cp <= 0x10FFFF) {
+        sz = 4;
+        c[0] = (cp >> 18) + 240;
+        c[1] = ((cp >> 12) & 63) + 128;
+        c[2] = ((cp >> 6) & 63) + 128;
+        c[3] = (cp & 63) + 128;
+    } else {
+        sz = -1;
+        return false;
+    }
+    return true;
+}
+
+int utf8proc_codepoint_length(int cp) {
+    if (cp <= 0x7F) {
+        return 1;
+    } else if (cp <= 0x7FF) {
+        return 2;
+    } else if (0xd800 <= cp && cp <= 0xdfff) {
+        return -1;
+    } else if (cp <= 0xFFFF) {
+        return 3;
+    } else if (cp <= 0x10FFFF) {
+        return 4;
+    }
+    return -1;
+}
+
+size_t utf8proc_next_grapheme(const char* s, size_t len, size_t cpos) {
+    int sz;
+    int boundclass = UTF8PROC_BOUNDCLASS_START;
+    int initial = utf8proc_get_property(utf8proc_codepoint(s + cpos, sz))->boundclass;
+    grapheme_break_extended(boundclass, initial, &boundclass);
+    while (true) {
+        cpos += sz;
+        if (cpos >= len) {
+            return cpos;
+        }
+        int next = utf8proc_get_property(utf8proc_codepoint(s + cpos, sz))->boundclass;
+        if (grapheme_break_extended(boundclass, next, &boundclass)) {
+            return cpos;
+        }
+    }
+}
+
+static utf8proc_int32_t seqindex_decode_entry(const utf8proc_uint16_t** entry) {
+    utf8proc_int32_t entry_cp = **entry;
+    if ((entry_cp & 0xF800) == 0xD800) {
+        *entry = *entry + 1;
+        entry_cp = ((entry_cp & 0x03FF) << 10) | (**entry & 0x03FF);
+        entry_cp += 0x10000;
+    }
+    return entry_cp;
+}
+
+static utf8proc_int32_t seqindex_decode_index(const utf8proc_uint32_t seqindex) {
+    const utf8proc_uint16_t* entry = &utf8proc_sequences[seqindex];
+    return seqindex_decode_entry(&entry);
+}
+
+static utf8proc_ssize_t seqindex_write_char_decomposed(utf8proc_uint16_t seqindex,
+    utf8proc_int32_t* dst, utf8proc_ssize_t bufsize, utf8proc_option_t options,
+    int* last_boundclass) {
+    utf8proc_ssize_t written = 0;
+    const utf8proc_uint16_t* entry = &utf8proc_sequences[seqindex & 0x1FFF];
+    int len = seqindex >> 13;
+    if (len >= 7) {
+        len = *entry;
+        entry++;
+    }
+    for (; len >= 0; entry++, len--) {
+        utf8proc_int32_t entry_cp = seqindex_decode_entry(&entry);
+        utf8proc_int32_t* dst_ptr = dst ? dst + written : nullptr;
+        written += utf8proc_decompose_char(entry_cp, dst_ptr,
+            (bufsize > written) ? (bufsize - written) : 0, options, last_boundclass);
+        if (written < 0)
+            return UTF8PROC_ERROR_OVERFLOW;
+    }
+    return written;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_int32_t utf8proc_tolower(utf8proc_int32_t c) {
+    utf8proc_int32_t cl = utf8proc_get_property(c)->lowercase_seqindex;
+    return cl != UINT16_MAX ? seqindex_decode_index(cl) : c;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_int32_t utf8proc_toupper(utf8proc_int32_t c) {
+    utf8proc_int32_t cu = utf8proc_get_property(c)->uppercase_seqindex;
+    return cu != UINT16_MAX ? seqindex_decode_index(cu) : c;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_int32_t utf8proc_totitle(utf8proc_int32_t c) {
+    utf8proc_int32_t cu = utf8proc_get_property(c)->titlecase_seqindex;
+    return cu != UINT16_MAX ? seqindex_decode_index(cu) : c;
+}
+
+/* return a character width analogous to wcwidth (except portable and
+     hopefully less buggy than most system wcwidth functions). */
+UTF8PROC_DLLEXPORT int utf8proc_charwidth(utf8proc_int32_t c) {
+    return utf8proc_get_property(c)->charwidth;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_category_t utf8proc_category(utf8proc_int32_t c) {
+    return (utf8proc_category_t)utf8proc_get_property(c)->category;
+}
+
+UTF8PROC_DLLEXPORT const char* utf8proc_category_string(utf8proc_int32_t c) {
+    static const char s[][3] = {"Cn", "Lu", "Ll", "Lt", "Lm", "Lo", "Mn", "Mc", "Me", "Nd", "Nl",
+        "No", "Pc", "Pd", "Ps", "Pe", "Pi", "Pf", "Po", "Sm", "Sc", "Sk", "So", "Zs", "Zl", "Zp",
+        "Cc", "Cf", "Cs", "Co"};
+    return s[utf8proc_category(c)];
+}
+
+#define utf8proc_decompose_lump(replacement_uc)                                                    \
+    return utf8proc_decompose_char((replacement_uc), dst, bufsize,                                 \
+        (utf8proc_option_t)(options & ~UTF8PROC_LUMP), last_boundclass)
+
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_decompose_char(utf8proc_int32_t uc,
+    utf8proc_int32_t* dst, utf8proc_ssize_t bufsize, utf8proc_option_t options,
+    int* last_boundclass) {
+    const utf8proc_property_t* property;
+    utf8proc_propval_t category;
+    utf8proc_int32_t hangul_sindex;
+    if (uc < 0 || uc >= 0x110000)
+        return UTF8PROC_ERROR_NOTASSIGNED;
+    property = unsafe_get_property(uc);
+    category = property->category;
+    hangul_sindex = uc - UTF8PROC_HANGUL_SBASE;
+    if (options & (UTF8PROC_COMPOSE | UTF8PROC_DECOMPOSE)) {
+        if (hangul_sindex >= 0 && hangul_sindex < UTF8PROC_HANGUL_SCOUNT) {
+            utf8proc_int32_t hangul_tindex;
+            if (bufsize >= 1) {
+                dst[0] = UTF8PROC_HANGUL_LBASE + hangul_sindex / UTF8PROC_HANGUL_NCOUNT;
+                if (bufsize >= 2)
+                    dst[1] = UTF8PROC_HANGUL_VBASE +
+                             (hangul_sindex % UTF8PROC_HANGUL_NCOUNT) / UTF8PROC_HANGUL_TCOUNT;
+            }
+            hangul_tindex = hangul_sindex % UTF8PROC_HANGUL_TCOUNT;
+            if (!hangul_tindex)
+                return 2;
+            if (bufsize >= 3)
+                dst[2] = UTF8PROC_HANGUL_TBASE + hangul_tindex;
+            return 3;
+        }
+    }
+    if (options & UTF8PROC_REJECTNA) {
+        if (!category)
+            return UTF8PROC_ERROR_NOTASSIGNED;
+    }
+    if (options & UTF8PROC_IGNORE) {
+        if (property->ignorable)
+            return 0;
+    }
+    if (options & UTF8PROC_STRIPNA) {
+        if (!category)
+            return 0;
+    }
+    if (options & UTF8PROC_LUMP) {
+        if (category == UTF8PROC_CATEGORY_ZS)
+            utf8proc_decompose_lump(0x0020);
+        if (uc == 0x2018 || uc == 0x2019 || uc == 0x02BC || uc == 0x02C8)
+            utf8proc_decompose_lump(0x0027);
+        if (category == UTF8PROC_CATEGORY_PD || uc == 0x2212)
+            utf8proc_decompose_lump(0x002D);
+        if (uc == 0x2044 || uc == 0x2215)
+            utf8proc_decompose_lump(0x002F);
+        if (uc == 0x2236)
+            utf8proc_decompose_lump(0x003A);
+        if (uc == 0x2039 || uc == 0x2329 || uc == 0x3008)
+            utf8proc_decompose_lump(0x003C);
+        if (uc == 0x203A || uc == 0x232A || uc == 0x3009)
+            utf8proc_decompose_lump(0x003E);
+        if (uc == 0x2216)
+            utf8proc_decompose_lump(0x005C);
+        if (uc == 0x02C4 || uc == 0x02C6 || uc == 0x2038 || uc == 0x2303)
+            utf8proc_decompose_lump(0x005E);
+        if (category == UTF8PROC_CATEGORY_PC || uc == 0x02CD)
+            utf8proc_decompose_lump(0x005F);
+        if (uc == 0x02CB)
+            utf8proc_decompose_lump(0x0060);
+        if (uc == 0x2223)
+            utf8proc_decompose_lump(0x007C);
+        if (uc == 0x223C)
+            utf8proc_decompose_lump(0x007E);
+        if ((options & UTF8PROC_NLF2LS) && (options & UTF8PROC_NLF2PS)) {
+            if (category == UTF8PROC_CATEGORY_ZL || category == UTF8PROC_CATEGORY_ZP)
+                utf8proc_decompose_lump(0x000A);
+        }
+    }
+    if (options & UTF8PROC_STRIPMARK) {
+        if (category == UTF8PROC_CATEGORY_MN || category == UTF8PROC_CATEGORY_MC ||
+            category == UTF8PROC_CATEGORY_ME)
+            return 0;
+    }
+    if (options & UTF8PROC_CASEFOLD) {
+        if (property->casefold_seqindex != UINT16_MAX) {
+            return seqindex_write_char_decomposed(
+                property->casefold_seqindex, dst, bufsize, options, last_boundclass);
+        }
+    }
+    if (options & (UTF8PROC_COMPOSE | UTF8PROC_DECOMPOSE)) {
+        if (property->decomp_seqindex != UINT16_MAX &&
+            (!property->decomp_type || (options & UTF8PROC_COMPAT))) {
+            return seqindex_write_char_decomposed(
+                property->decomp_seqindex, dst, bufsize, options, last_boundclass);
+        }
+    }
+    if (options & UTF8PROC_CHARBOUND) {
+        utf8proc_bool boundary;
+        int tbc = property->boundclass;
+        boundary = grapheme_break_extended(*last_boundclass, tbc, last_boundclass);
+        if (boundary) {
+            if (bufsize >= 1)
+                dst[0] = -1; /* sentinel value for grapheme break */
+            if (bufsize >= 2)
+                dst[1] = uc;
+            return 2;
+        }
+    }
+    if (bufsize >= 1)
+        *dst = uc;
+    return 1;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_decompose(const utf8proc_uint8_t* str,
+    utf8proc_ssize_t strlen, utf8proc_int32_t* buffer, utf8proc_ssize_t bufsize,
+    utf8proc_option_t options) {
+    return utf8proc_decompose_custom(str, strlen, buffer, bufsize, options, NULL, NULL);
+}
+
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_decompose_custom(const utf8proc_uint8_t* str,
+    utf8proc_ssize_t strlen, utf8proc_int32_t* buffer, utf8proc_ssize_t bufsize,
+    utf8proc_option_t options, utf8proc_custom_func custom_func, void* custom_data) {
+    /* strlen will be ignored, if UTF8PROC_NULLTERM is set in options */
+    utf8proc_ssize_t wpos = 0;
+    if ((options & UTF8PROC_COMPOSE) && (options & UTF8PROC_DECOMPOSE))
+        return UTF8PROC_ERROR_INVALIDOPTS;
+    if ((options & UTF8PROC_STRIPMARK) && !(options & UTF8PROC_COMPOSE) &&
+        !(options & UTF8PROC_DECOMPOSE))
+        return UTF8PROC_ERROR_INVALIDOPTS;
+    {
+        utf8proc_int32_t uc;
+        utf8proc_ssize_t rpos = 0;
+        utf8proc_ssize_t decomp_result;
+        int boundclass = UTF8PROC_BOUNDCLASS_START;
+        while (1) {
+            if (options & UTF8PROC_NULLTERM) {
+                rpos += utf8proc_iterate(str + rpos, -1, &uc);
+                /* checking of return value is not necessary,
+                     as 'uc' is < 0 in case of error */
+                if (uc < 0)
+                    return UTF8PROC_ERROR_INVALIDUTF8;
+                if (rpos < 0)
+                    return UTF8PROC_ERROR_OVERFLOW;
+                if (uc == 0)
+                    break;
+            } else {
+                if (rpos >= strlen)
+                    break;
+                rpos += utf8proc_iterate(str + rpos, strlen - rpos, &uc);
+                if (uc < 0)
+                    return UTF8PROC_ERROR_INVALIDUTF8;
+            }
+            if (custom_func != NULL) {
+                uc = custom_func(uc, custom_data); /* user-specified custom mapping */
+            }
+            utf8proc_int32_t* target_buffer = buffer ? buffer + wpos : nullptr;
+            decomp_result = utf8proc_decompose_char(
+                uc, target_buffer, (bufsize > wpos) ? (bufsize - wpos) : 0, options, &boundclass);
+            if (decomp_result < 0)
+                return decomp_result;
+            wpos += decomp_result;
+            /* prohibiting integer overflows due to too long strings: */
+            if (wpos < 0 || wpos > (utf8proc_ssize_t)(SSIZE_MAX / sizeof(utf8proc_int32_t) / 2))
+                return UTF8PROC_ERROR_OVERFLOW;
+        }
+    }
+    if ((options & (UTF8PROC_COMPOSE | UTF8PROC_DECOMPOSE)) && bufsize >= wpos) {
+        utf8proc_ssize_t pos = 0;
+        while (pos < wpos - 1) {
+            utf8proc_int32_t uc1, uc2;
+            const utf8proc_property_t *property1, *property2;
+            uc1 = buffer[pos];
+            uc2 = buffer[pos + 1];
+            property1 = unsafe_get_property(uc1);
+            property2 = unsafe_get_property(uc2);
+            if (property1->combining_class > property2->combining_class &&
+                property2->combining_class > 0) {
+                buffer[pos] = uc2;
+                buffer[pos + 1] = uc1;
+                if (pos > 0)
+                    pos--;
+                else
+                    pos++;
+            } else {
+                pos++;
+            }
+        }
+    }
+    return wpos;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_normalize_utf32(
+    utf8proc_int32_t* buffer, utf8proc_ssize_t length, utf8proc_option_t options) {
+    /* UTF8PROC_NULLTERM option will be ignored, 'length' is never ignored */
+    if (options & (UTF8PROC_NLF2LS | UTF8PROC_NLF2PS | UTF8PROC_STRIPCC)) {
+        utf8proc_ssize_t rpos;
+        utf8proc_ssize_t wpos = 0;
+        utf8proc_int32_t uc;
+        for (rpos = 0; rpos < length; rpos++) {
+            uc = buffer[rpos];
+            if (uc == 0x000D && rpos < length - 1 && buffer[rpos + 1] == 0x000A)
+                rpos++;
+            if (uc == 0x000A || uc == 0x000D || uc == 0x0085 ||
+                ((options & UTF8PROC_STRIPCC) && (uc == 0x000B || uc == 0x000C))) {
+                if (options & UTF8PROC_NLF2LS) {
+                    if (options & UTF8PROC_NLF2PS) {
+                        buffer[wpos++] = 0x000A;
+                    } else {
+                        buffer[wpos++] = 0x2028;
+                    }
+                } else {
+                    if (options & UTF8PROC_NLF2PS) {
+                        buffer[wpos++] = 0x2029;
+                    } else {
+                        buffer[wpos++] = 0x0020;
+                    }
+                }
+            } else if ((options & UTF8PROC_STRIPCC) &&
+                       (uc < 0x0020 || (uc >= 0x007F && uc < 0x00A0))) {
+                if (uc == 0x0009)
+                    buffer[wpos++] = 0x0020;
+            } else {
+                buffer[wpos++] = uc;
+            }
+        }
+        length = wpos;
+    }
+    if (options & UTF8PROC_COMPOSE) {
+        utf8proc_int32_t* starter = NULL;
+        utf8proc_int32_t current_char;
+        const utf8proc_property_t *starter_property = NULL, *current_property;
+        utf8proc_propval_t max_combining_class = -1;
+        utf8proc_ssize_t rpos;
+        utf8proc_ssize_t wpos = 0;
+        utf8proc_int32_t composition;
+        for (rpos = 0; rpos < length; rpos++) {
+            current_char = buffer[rpos];
+            current_property = unsafe_get_property(current_char);
+            if (starter && current_property->combining_class > max_combining_class) {
+                /* combination perhaps possible */
+                utf8proc_int32_t hangul_lindex;
+                utf8proc_int32_t hangul_sindex;
+                hangul_lindex = *starter - UTF8PROC_HANGUL_LBASE;
+                if (hangul_lindex >= 0 && hangul_lindex < UTF8PROC_HANGUL_LCOUNT) {
+                    utf8proc_int32_t hangul_vindex;
+                    hangul_vindex = current_char - UTF8PROC_HANGUL_VBASE;
+                    if (hangul_vindex >= 0 && hangul_vindex < UTF8PROC_HANGUL_VCOUNT) {
+                        *starter = UTF8PROC_HANGUL_SBASE +
+                                   (hangul_lindex * UTF8PROC_HANGUL_VCOUNT + hangul_vindex) *
+                                       UTF8PROC_HANGUL_TCOUNT;
+                        starter_property = NULL;
+                        continue;
+                    }
+                }
+                hangul_sindex = *starter - UTF8PROC_HANGUL_SBASE;
+                if (hangul_sindex >= 0 && hangul_sindex < UTF8PROC_HANGUL_SCOUNT &&
+                    (hangul_sindex % UTF8PROC_HANGUL_TCOUNT) == 0) {
+                    utf8proc_int32_t hangul_tindex;
+                    hangul_tindex = current_char - UTF8PROC_HANGUL_TBASE;
+                    if (hangul_tindex >= 0 && hangul_tindex < UTF8PROC_HANGUL_TCOUNT) {
+                        *starter += hangul_tindex;
+                        starter_property = NULL;
+                        continue;
+                    }
+                }
+                if (!starter_property) {
+                    starter_property = unsafe_get_property(*starter);
+                }
+                if (starter_property->comb_index < 0x8000 &&
+                    current_property->comb_index != UINT16_MAX &&
+                    current_property->comb_index >= 0x8000) {
+                    int sidx = starter_property->comb_index;
+                    int idx = current_property->comb_index & 0x3FFF;
+                    if (idx >= utf8proc_combinations[sidx] &&
+                        idx <= utf8proc_combinations[sidx + 1]) {
+                        idx += sidx + 2 - utf8proc_combinations[sidx];
+                        if (current_property->comb_index & 0x4000) {
+                            composition =
+                                (utf8proc_combinations[idx] << 16) | utf8proc_combinations[idx + 1];
+                        } else
+                            composition = utf8proc_combinations[idx];
+
+                        if (composition > 0 &&
+                            (!(options & UTF8PROC_STABLE) ||
+                                !(unsafe_get_property(composition)->comp_exclusion))) {
+                            *starter = composition;
+                            starter_property = NULL;
+                            continue;
+                        }
+                    }
+                }
+            }
+            buffer[wpos] = current_char;
+            if (current_property->combining_class) {
+                if (current_property->combining_class > max_combining_class) {
+                    max_combining_class = current_property->combining_class;
+                }
+            } else {
+                starter = buffer + wpos;
+                starter_property = NULL;
+                max_combining_class = -1;
+            }
+            wpos++;
+        }
+        length = wpos;
+    }
+    return length;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_reencode(
+    utf8proc_int32_t* buffer, utf8proc_ssize_t length, utf8proc_option_t options) {
+    /* UTF8PROC_NULLTERM option will be ignored, 'length' is never ignored
+         ASSERT: 'buffer' has one spare byte of free space at the end! */
+    length = utf8proc_normalize_utf32(buffer, length, options);
+    if (length < 0)
+        return length;
+    {
+        utf8proc_ssize_t rpos, wpos = 0;
+        utf8proc_int32_t uc;
+        if (options & UTF8PROC_CHARBOUND) {
+            for (rpos = 0; rpos < length; rpos++) {
+                uc = buffer[rpos];
+                wpos += charbound_encode_char(uc, ((utf8proc_uint8_t*)buffer) + wpos);
+            }
+        } else {
+            for (rpos = 0; rpos < length; rpos++) {
+                uc = buffer[rpos];
+                wpos += utf8proc_encode_char(uc, ((utf8proc_uint8_t*)buffer) + wpos);
+            }
+        }
+        ((utf8proc_uint8_t*)buffer)[wpos] = 0;
+        return wpos;
+    }
+}
+
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_map(const utf8proc_uint8_t* str,
+    utf8proc_ssize_t strlen, utf8proc_uint8_t** dstptr, utf8proc_option_t options) {
+    return utf8proc_map_custom(str, strlen, dstptr, options, NULL, NULL);
+}
+
+UTF8PROC_DLLEXPORT utf8proc_ssize_t utf8proc_map_custom(const utf8proc_uint8_t* str,
+    utf8proc_ssize_t strlen, utf8proc_uint8_t** dstptr, utf8proc_option_t options,
+    utf8proc_custom_func custom_func, void* custom_data) {
+    utf8proc_int32_t* buffer;
+    utf8proc_ssize_t result;
+    *dstptr = NULL;
+    result = utf8proc_decompose_custom(str, strlen, NULL, 0, options, custom_func, custom_data);
+    if (result < 0)
+        return result;
+    buffer = (utf8proc_int32_t*)malloc(result * sizeof(utf8proc_int32_t) + 1);
+    if (!buffer)
+        return UTF8PROC_ERROR_NOMEM;
+    result =
+        utf8proc_decompose_custom(str, strlen, buffer, result, options, custom_func, custom_data);
+    if (result < 0) {
+        free(buffer);
+        return result;
+    }
+    result = utf8proc_reencode(buffer, result, options);
+    if (result < 0) {
+        free(buffer);
+        return result;
+    }
+    {
+        utf8proc_int32_t* newptr;
+        newptr = (utf8proc_int32_t*)realloc(buffer, (size_t)result + 1);
+        if (newptr)
+            buffer = newptr;
+    }
+    *dstptr = (utf8proc_uint8_t*)buffer;
+    return result;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFD(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len) {
+    utf8proc_uint8_t* retval;
+    utf8proc_map(str, len, &retval, (utf8proc_option_t)(UTF8PROC_STABLE | UTF8PROC_DECOMPOSE));
+    return retval;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFC(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len) {
+    utf8proc_uint8_t* retval;
+    utf8proc_map(str, len, &retval, (utf8proc_option_t)(UTF8PROC_STABLE | UTF8PROC_COMPOSE));
+    return retval;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_remove_accents(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len) {
+    utf8proc_uint8_t* retval;
+    utf8proc_map(str, len, &retval,
+        (utf8proc_option_t)(UTF8PROC_STABLE | UTF8PROC_COMPOSE | UTF8PROC_STRIPMARK));
+    return retval;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFKD(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len) {
+    utf8proc_uint8_t* retval;
+    utf8proc_map(str, len, &retval,
+        (utf8proc_option_t)(UTF8PROC_STABLE | UTF8PROC_DECOMPOSE | UTF8PROC_COMPAT));
+    return retval;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFKC(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len) {
+    utf8proc_uint8_t* retval;
+    utf8proc_map(str, len, &retval,
+        (utf8proc_option_t)(UTF8PROC_STABLE | UTF8PROC_COMPOSE | UTF8PROC_COMPAT));
+    return retval;
+}
+
+UTF8PROC_DLLEXPORT utf8proc_uint8_t* utf8proc_NFKC_Casefold(
+    const utf8proc_uint8_t* str, utf8proc_ssize_t len) {
+    utf8proc_uint8_t* retval;
+    utf8proc_map(str, len, &retval,
+        (utf8proc_option_t)(UTF8PROC_STABLE | UTF8PROC_COMPOSE | UTF8PROC_COMPAT |
+                            UTF8PROC_CASEFOLD | UTF8PROC_IGNORE));
+    return retval;
+}
+
+} // namespace utf8proc
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/utf8proc_wrapper.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/utf8proc_wrapper.cpp
new file mode 100644
index 0000000000..5de0ff93d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/utf8proc/utf8proc_wrapper.cpp
@@ -0,0 +1,136 @@
+#include "include/utf8proc_wrapper.h"
+
+#include "include/utf8proc.h"
+
+using namespace std;
+
+namespace lbug {
+namespace utf8proc {
+
+static void assignInvalidUtf8Reason(UnicodeInvalidReason* invalidReason, size_t* invalidPos,
+    size_t pos, UnicodeInvalidReason reason) {
+    if (invalidReason) {
+        *invalidReason = reason;
+    }
+    if (invalidPos) {
+        *invalidPos = pos;
+    }
+}
+
+template<const int nextraBytes, const int mask>
+static inline UnicodeType UTF8ExtraByteLoop(const int firstPosSeq, int utf8char, size_t& i,
+    const char* s, const size_t len, UnicodeInvalidReason* invalidReason, size_t* invalidPos) {
+    if ((len - i) < (nextraBytes + 1)) {
+        assignInvalidUtf8Reason(
+            invalidReason, invalidPos, firstPosSeq, UnicodeInvalidReason::BYTE_MISMATCH);
+        return UnicodeType::INVALID;
+    }
+    for (size_t j = 0; j < nextraBytes; j++) {
+        int c = (int)s[++i];
+        if ((c & 0xC0) != 0x80) {
+            assignInvalidUtf8Reason(
+                invalidReason, invalidPos, i, UnicodeInvalidReason::BYTE_MISMATCH);
+            return UnicodeType::INVALID;
+        }
+        utf8char = (utf8char << 6) | (c & 0x3F);
+    }
+    if ((utf8char & mask) == 0) {
+        assignInvalidUtf8Reason(
+            invalidReason, invalidPos, firstPosSeq, UnicodeInvalidReason::INVALID_UNICODE);
+        return UnicodeType::INVALID;
+    }
+    if (utf8char > 0x10FFFF) {
+        assignInvalidUtf8Reason(
+            invalidReason, invalidPos, firstPosSeq, UnicodeInvalidReason::INVALID_UNICODE);
+        return UnicodeType::INVALID;
+    }
+    if ((utf8char & 0x1FFF800) == 0xD800) {
+        assignInvalidUtf8Reason(
+            invalidReason, invalidPos, firstPosSeq, UnicodeInvalidReason::INVALID_UNICODE);
+        return UnicodeType::INVALID;
+    }
+    return UnicodeType::UNICODE;
+}
+
+UnicodeType Utf8Proc::analyze(
+    const char* s, size_t len, UnicodeInvalidReason* invalidReason, size_t* invalidPos) {
+    UnicodeType type = UnicodeType::ASCII;
+
+    for (size_t i = 0; i < len; i++) {
+        int c = (int)s[i];
+
+        if ((c & 0x80) == 0) {
+            continue;
+        } else {
+            int firstPosSeq = i;
+
+            if ((c & 0xE0) == 0xC0) {
+                int utf8char = c & 0x1F;
+                type = UTF8ExtraByteLoop<1, 0x000780>(
+                    firstPosSeq, utf8char, i, s, len, invalidReason, invalidPos);
+            } else if ((c & 0xF0) == 0xE0) {
+                int utf8char = c & 0x0F;
+                type = UTF8ExtraByteLoop<2, 0x00F800>(
+                    firstPosSeq, utf8char, i, s, len, invalidReason, invalidPos);
+            } else if ((c & 0xF8) == 0xF0) {
+                int utf8char = c & 0x07;
+                type = UTF8ExtraByteLoop<3, 0x1F0000>(
+                    firstPosSeq, utf8char, i, s, len, invalidReason, invalidPos);
+            } else {
+                assignInvalidUtf8Reason(
+                    invalidReason, invalidPos, i, UnicodeInvalidReason::BYTE_MISMATCH);
+                return UnicodeType::INVALID;
+            }
+            if (type == UnicodeType::INVALID) {
+                return type;
+            }
+        }
+    }
+    return type;
+}
+
+char* Utf8Proc::normalize(const char* s, size_t len) {
+    assert(s);
+    assert(Utf8Proc::analyze(s, len) != UnicodeType::INVALID);
+    return (char*)utf8proc_NFC((const utf8proc_uint8_t*)s, len);
+}
+
+bool Utf8Proc::isValid(const char* s, size_t len) {
+    return Utf8Proc::analyze(s, len) != UnicodeType::INVALID;
+}
+
+size_t Utf8Proc::previousGraphemeCluster(const char* s, size_t len, size_t charPos) {
+    if (!Utf8Proc::isValid(s, len)) {
+        return charPos - 1;
+    }
+    size_t currentPos = 0;
+    while (true) {
+        size_t newPos = utf8proc_next_grapheme(s, len, currentPos);
+        if (newPos <= currentPos || newPos >= charPos) {
+            return currentPos;
+        }
+        currentPos = newPos;
+    }
+}
+
+int32_t Utf8Proc::utf8ToCodepoint(const char* c, int& size) {
+    return utf8proc_codepoint(c, size);
+}
+
+uint32_t Utf8Proc::renderWidth(const char* s, size_t pos) {
+    int size;
+    auto codepoint = lbug::utf8proc::utf8proc_codepoint(s + pos, size);
+    auto properties = lbug::utf8proc::utf8proc_get_property(codepoint);
+    return properties->charwidth;
+}
+
+int Utf8Proc::codepointLength(int cp) {
+    return utf8proc_codepoint_length(cp);
+}
+
+bool Utf8Proc::codepointToUtf8(int cp, int &sz, char *c) {
+    return utf8proc_codepoint_to_utf8(cp, sz, c);
+}
+
+} // namespace utf8proc
+} // namespace lbug
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/CMakeLists.txt
new file mode 100644
index 0000000000..d4758c0f49
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/CMakeLists.txt
@@ -0,0 +1,10 @@
+if(NOT MSVC)
+    add_compile_options(-Wno-extra)
+endif()
+
+add_library(yyjson
+    STATIC
+    src/yyjson.c)
+
+target_include_directories(yyjson PUBLIC
+    ${CMAKE_CURRENT_SOURCE_DIR})
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/LICENSE
new file mode 100644
index 0000000000..a09bff3553
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2020 YaoYuan <ibireme@gmail.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/README.md b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/README.md
new file mode 100644
index 0000000000..6ca247d38b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/README.md
@@ -0,0 +1,255 @@
+
+# Introduction
+
+[![Build](https://img.shields.io/github/actions/workflow/status/ibireme/yyjson/cmake.yml?branch=master&style=flat-square)](https://github.com/ibireme/yyjson/actions/workflows/cmake.yml)
+[![Codecov](https://img.shields.io/codecov/c/github/ibireme/yyjson/master?style=flat-square)](https://codecov.io/gh/ibireme/yyjson)
+[![License](https://img.shields.io/github/license/ibireme/yyjson?color=blue&style=flat-square)](https://github.com/ibireme/yyjson/blob/master/LICENSE)
+[![Version](https://img.shields.io/github/v/release/ibireme/yyjson?color=orange&style=flat-square)](https://github.com/ibireme/yyjson/releases)
+[![Packaging status](https://img.shields.io/repology/repositories/yyjson.svg?style=flat-square)](https://repology.org/project/yyjson/versions)
+
+A high performance JSON library written in ANSI C.
+
+# Features
+- **Fast**: can read or write gigabytes per second JSON data on modern CPUs.
+- **Portable**: complies with ANSI C (C89) for cross-platform compatibility.
+- **Strict**: complies with [RFC 8259](https://datatracker.ietf.org/doc/html/rfc8259) JSON standard, ensuring strict number format and UTF-8 validation.
+- **Extendable**: offers options to allow comments, trailing commas, NaN/Inf, and custom memory allocator.
+- **Accuracy**: can accurately read and write `int64`, `uint64`, and `double` numbers.
+- **Flexible**: supports unlimited JSON nesting levels, `\u0000` characters, and non null-terminated strings.
+- **Manipulation**: supports querying and modifying using [JSON Pointer](https://datatracker.ietf.org/doc/html/rfc6901), [JSON Patch](https://datatracker.ietf.org/doc/html/rfc6902) and [JSON Merge Patch](https://datatracker.ietf.org/doc/html/rfc7386).
+- **Developer-Friendly**: easy integration with only one `h` and one `c` file.
+
+# Limitations
+- An array or object is stored as a [data structure](https://ibireme.github.io/yyjson/doc/doxygen/html/md_doc__data_structure.html) such as linked list, which makes accessing elements by index or key slower than using an iterator.
+- Duplicate keys are allowed in an object, and the order of the keys is preserved.
+- JSON parsing result is immutable, requiring a `mutable copy` for modification.
+
+# Performance
+Benchmark project and dataset: [yyjson_benchmark](https://github.com/ibireme/yyjson_benchmark)
+
+The simdjson's new `On Demand` API is faster if most JSON fields are known at compile-time.
+This benchmark project only checks the DOM API, a new benchmark will be added later.
+
+#### AWS EC2 (AMD EPYC 7R32, gcc 9.3)
+![ec2_chart](doc/images/perf_reader_ec2.svg)
+
+|twitter.json|parse (GB/s)|stringify (GB/s)|
+|---|---|---|
+|yyjson(insitu)|1.80|1.51|
+|yyjson|1.72|1.42|
+|simdjson|1.52|0.61|
+|sajson|1.16|   |
+|rapidjson(insitu)|0.77|   |
+|rapidjson(utf8)|0.26|0.39|
+|cjson|0.32|0.17|
+|jansson|0.05|0.11|
+
+
+#### iPhone (Apple A14, clang 12)
+![a14_chart](doc/images/perf_reader_a14.svg)
+
+|twitter.json|parse (GB/s)|stringify (GB/s)|
+|---|---|---|
+|yyjson(insitu)|3.51|2.41|
+|yyjson|2.39|2.01|
+|simdjson|2.19|0.80|
+|sajson|1.74||
+|rapidjson(insitu)|0.75| |
+|rapidjson(utf8)|0.30|0.58|
+|cjson|0.48|0.33|
+|jansson|0.09|0.24|
+
+More benchmark reports with interactive charts (update 2020-12-12)
+
+|Platform|CPU|Compiler|OS|Report|
+|---|---|---|---|---|
+|Intel NUC 8i5|Core i5-8259U|msvc 2019|Windows 10 2004|[Charts](https://ibireme.github.io/yyjson_benchmark/reports/Intel_NUC_8i5_msvc_2019.html)|
+|Intel NUC 8i5|Core i5-8259U|clang 10.0|Ubuntu 20.04|[Charts](https://ibireme.github.io/yyjson_benchmark/reports/Intel_NUC_8i5_clang_10.html)|
+|Intel NUC 8i5|Core i5-8259U|gcc 9.3|Ubuntu 20.04|[Charts](https://ibireme.github.io/yyjson_benchmark/reports/Intel_NUC_8i5_gcc_9.html)|
+|AWS EC2 c5a.large|AMD EPYC 7R32|gcc 9.3|Ubuntu 20.04|[Charts](https://ibireme.github.io/yyjson_benchmark/reports/EC2_c5a.large_gcc_9.html)|
+|AWS EC2 t4g.medium|Graviton2 (ARM64)|gcc 9.3|Ubuntu 20.04|[Charts](https://ibireme.github.io/yyjson_benchmark/reports/EC2_t4g.medium_gcc_9.html)|
+|Apple iPhone 12 Pro|A14 (ARM64)|clang 12.0|iOS 14|[Charts](https://ibireme.github.io/yyjson_benchmark/reports/Apple_A14_clang_12.html)|
+
+### For better performance, yyjson prefers:
+* A modern processor with:
+    * high instruction level parallelism
+    * excellent branch predictor
+    * low penalty for misaligned memory access
+* A modern compiler with good optimizer (e.g. clang)
+
+
+# Sample Code
+
+### Read JSON string
+```c
+const char *json = "{\"name\":\"Mash\",\"star\":4,\"hits\":[2,2,1,3]}";
+
+// Read JSON and get root
+yyjson_doc *doc = yyjson_read(json, strlen(json), 0);
+yyjson_val *root = yyjson_doc_get_root(doc);
+
+// Get root["name"]
+yyjson_val *name = yyjson_obj_get(root, "name");
+printf("name: %s\n", yyjson_get_str(name));
+printf("name length:%d\n", (int)yyjson_get_len(name));
+
+// Get root["star"]
+yyjson_val *star = yyjson_obj_get(root, "star");
+printf("star: %d\n", (int)yyjson_get_int(star));
+
+// Get root["hits"], iterate over the array
+yyjson_val *hits = yyjson_obj_get(root, "hits");
+size_t idx, max;
+yyjson_val *hit;
+yyjson_arr_foreach(hits, idx, max, hit) {
+    printf("hit%d: %d\n", (int)idx, (int)yyjson_get_int(hit));
+}
+
+// Free the doc
+yyjson_doc_free(doc);
+
+// All functions accept NULL input, and return NULL on error.
+```
+
+### Write JSON string
+```c
+// Create a mutable doc
+yyjson_mut_doc *doc = yyjson_mut_doc_new(NULL);
+yyjson_mut_val *root = yyjson_mut_obj(doc);
+yyjson_mut_doc_set_root(doc, root);
+
+// Set root["name"] and root["star"]
+yyjson_mut_obj_add_str(doc, root, "name", "Mash");
+yyjson_mut_obj_add_int(doc, root, "star", 4);
+
+// Set root["hits"] with an array
+int hits_arr[] = {2, 2, 1, 3};
+yyjson_mut_val *hits = yyjson_mut_arr_with_sint32(doc, hits_arr, 4);
+yyjson_mut_obj_add_val(doc, root, "hits", hits);
+
+// To string, minified
+const char *json = yyjson_mut_write(doc, 0, NULL);
+if (json) {
+    printf("json: %s\n", json); // {"name":"Mash","star":4,"hits":[2,2,1,3]}
+    free((void *)json);
+}
+
+// Free the doc
+yyjson_mut_doc_free(doc);
+```
+
+### Read JSON file with options
+```c
+// Read JSON file, allowing comments and trailing commas
+yyjson_read_flag flg = YYJSON_READ_ALLOW_COMMENTS | YYJSON_READ_ALLOW_TRAILING_COMMAS;
+yyjson_read_err err;
+yyjson_doc *doc = yyjson_read_file("/tmp/config.json", flg, NULL, &err);
+
+// Iterate over the root object
+if (doc) {
+    yyjson_val *obj = yyjson_doc_get_root(doc);
+    yyjson_obj_iter iter;
+    yyjson_obj_iter_init(obj, &iter);
+    yyjson_val *key, *val;
+    while ((key = yyjson_obj_iter_next(&iter))) {
+        val = yyjson_obj_iter_get_val(key);
+        printf("%s: %s\n", yyjson_get_str(key), yyjson_get_type_desc(val));
+    }
+} else {
+    printf("read error (%u): %s at position: %ld\n", err.code, err.msg, err.pos);
+}
+
+// Free the doc
+yyjson_doc_free(doc);
+```
+
+### Write JSON file with options
+```c
+// Read the JSON file as a mutable doc
+yyjson_doc *idoc = yyjson_read_file("/tmp/config.json", 0, NULL, NULL);
+yyjson_mut_doc *doc = yyjson_doc_mut_copy(idoc, NULL);
+yyjson_mut_val *obj = yyjson_mut_doc_get_root(doc);
+
+// Remove null values in root object
+yyjson_mut_obj_iter iter;
+yyjson_mut_obj_iter_init(obj, &iter);
+yyjson_mut_val *key, *val;
+while ((key = yyjson_mut_obj_iter_next(&iter))) {
+    val = yyjson_mut_obj_iter_get_val(key);
+    if (yyjson_mut_is_null(val)) {
+        yyjson_mut_obj_iter_remove(&iter);
+    }
+}
+
+// Write the json pretty, escape unicode
+yyjson_write_flag flg = YYJSON_WRITE_PRETTY | YYJSON_WRITE_ESCAPE_UNICODE;
+yyjson_write_err err;
+yyjson_mut_write_file("/tmp/config.json", doc, flg, NULL, &err);
+if (err.code) {
+    printf("write error (%u): %s\n", err.code, err.msg);
+}
+
+// Free the doc
+yyjson_doc_free(idoc);
+yyjson_mut_doc_free(doc);
+```
+
+# Documentation
+The latest (unreleased) documentation can be accessed in the [doc](https://github.com/ibireme/yyjson/tree/master/doc) directory.
+The pre-generated Doxygen HTML for the release version can be viewed here:
+* [Home Page](https://ibireme.github.io/yyjson/doc/doxygen/html/)
+    * [Build and test](https://ibireme.github.io/yyjson/doc/doxygen/html/md_doc__build_and_test.html)
+    * [API and sample code](https://ibireme.github.io/yyjson/doc/doxygen/html/md_doc__a_p_i.html)
+    * [Data structure](https://ibireme.github.io/yyjson/doc/doxygen/html/md_doc__data_structure.html)
+    * [Changelog](https://ibireme.github.io/yyjson/doc/doxygen/html/md__c_h_a_n_g_e_l_o_g.html)
+
+# Packaging status
+
+[![Packaging status](https://repology.org/badge/vertical-allrepos/yyjson.svg)](https://repology.org/project/yyjson/versions)
+
+# Built With yyjson
+
+A non-exhaustive list of projects that expose yyjson to other languages or
+use yyjson internally for a major feature. If you have a project that uses
+yyjson, feel free to open a PR to add it to this list.
+
+| Project         | Language | Description                                                                              |
+|-----------------|----------|------------------------------------------------------------------------------------------|
+| [py_yyjson][]   | Python   | Python bindings for yyjson                                                               |
+| [orjson][]      | Python   | JSON library for Python with an optional yyjson backend                                  |
+| [cpp-yyjson][]  | C++      | C++ JSON library with a yyjson backend                                                   |
+| [reflect-cpp][] | C++      | C++ library for serialization through automated field name retrieval from structs        |
+| [yyjsonr][]     | R        | R binding for yyjson                                                                     |
+| [Ananda][]      | Swift    | JSON model decoding based on yyjson                                                      |
+| [duckdb][]      | C++      | DuckDB is an in-process SQL OLAP Database Management System                              |
+| [fastfetch][]   | C        | A neofetch-like tool for fetching system information and displaying them in a pretty way |
+| [Zrythm][]      | C        | Digital Audio Workstation that uses yyjson to serialize JSON project files               |
+| [bemorehuman][] | C        | Recommendation engine with a focus on uniqueness of the person receiving the rec         |
+
+
+# TODO for v1.0
+* [x] Add documentation page.
+* [x] Add GitHub workflow for CI and codecov.
+* [x] Add more tests: valgrind, sanitizer, fuzzing.
+* [x] Support JSON Pointer to query and modify JSON.
+* [x] Add `RAW` type for JSON reader and writer.
+* [ ] Add option to limit real number output precision.
+* [ ] Add option to support JSON5 (if feasible).
+* [ ] Add functions to diff two JSON documents.
+* [ ] Add documentation on performance optimizations.
+* [ ] Ensure ABI stability.
+
+# License
+This project is released under the MIT license.
+
+
+[py_yyjson]: https://github.com/tktech/py_yyjson
+[orjson]: https://github.com/ijl/orjson
+[cpp-yyjson]: https://github.com/yosh-matsuda/cpp-yyjson
+[reflect-cpp]: https://github.com/getml/reflect-cpp
+[yyjsonr]: https://github.com/coolbutuseless/yyjsonr
+[Ananda]: https://github.com/nixzhu/Ananda
+[duckdb]: https://github.com/duckdb/duckdb
+[fastfetch]: https://github.com/fastfetch-cli/fastfetch
+[Zrythm]: https://github.com/zrythm/zrythm
+[bemorehuman]: https://github.com/BeMoreHumanOrg/bemorehuman
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/src/yyjson.c b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/src/yyjson.c
new file mode 100644
index 0000000000..03defde8bc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/src/yyjson.c
@@ -0,0 +1,9604 @@
+/*==============================================================================
+ Copyright (c) 2020 YaoYuan <ibireme@gmail.com>
+
+ Permission is hereby granted, free of charge, to any person obtaining a copy
+ of this software and associated documentation files (the "Software"), to deal
+ in the Software without restriction, including without limitation the rights
+ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ copies of the Software, and to permit persons to whom the Software is
+ furnished to do so, subject to the following conditions:
+
+ The above copyright notice and this permission notice shall be included in all
+ copies or substantial portions of the Software.
+
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ SOFTWARE.
+ *============================================================================*/
+
+// clang-tidy should ignore this file
+// NOLINTBEGIN
+
+#include "yyjson.h"
+
+#include <math.h>
+
+/*==============================================================================
+ * Warning Suppress
+ *============================================================================*/
+
+#if defined(__clang__)
+#pragma clang diagnostic ignored "-Wunused-function"
+#pragma clang diagnostic ignored "-Wunused-parameter"
+#pragma clang diagnostic ignored "-Wunused-label"
+#pragma clang diagnostic ignored "-Wunused-macros"
+#pragma clang diagnostic ignored "-Wunused-variable"
+#elif defined(__GNUC__)
+#pragma GCC diagnostic ignored "-Wunused-function"
+#pragma GCC diagnostic ignored "-Wunused-parameter"
+#pragma GCC diagnostic ignored "-Wunused-label"
+#pragma GCC diagnostic ignored "-Wunused-macros"
+#pragma GCC diagnostic ignored "-Wunused-variable"
+#elif defined(_MSC_VER)
+#pragma warning(disable : 4100) /* unreferenced formal parameter */
+#pragma warning(disable : 4101) /* unreferenced variable */
+#pragma warning(disable : 4102) /* unreferenced label */
+#pragma warning(disable : 4127) /* conditional expression is constant */
+#pragma warning(disable : 4706) /* assignment within conditional expression */
+#endif
+
+/*==============================================================================
+ * Version
+ *============================================================================*/
+
+uint32_t yyjson_version(void) {
+    return YYJSON_VERSION_HEX;
+}
+
+/*==============================================================================
+ * Flags
+ *============================================================================*/
+
+/* msvc intrinsic */
+#if YYJSON_MSC_VER >= 1400
+#include <intrin.h>
+#if defined(_M_AMD64) || defined(_M_ARM64)
+#define MSC_HAS_BIT_SCAN_64 1
+#pragma intrinsic(_BitScanForward64)
+#pragma intrinsic(_BitScanReverse64)
+#else
+#define MSC_HAS_BIT_SCAN_64 0
+#endif
+#if defined(_M_AMD64) || defined(_M_ARM64) || defined(_M_IX86) || defined(_M_ARM)
+#define MSC_HAS_BIT_SCAN 1
+#pragma intrinsic(_BitScanForward)
+#pragma intrinsic(_BitScanReverse)
+#else
+#define MSC_HAS_BIT_SCAN 0
+#endif
+#if defined(_M_AMD64)
+#define MSC_HAS_UMUL128 1
+#pragma intrinsic(_umul128)
+#else
+#define MSC_HAS_UMUL128 0
+#endif
+#else
+#define MSC_HAS_BIT_SCAN_64 0
+#define MSC_HAS_BIT_SCAN 0
+#define MSC_HAS_UMUL128 0
+#endif
+
+/* gcc builtin */
+#if yyjson_has_builtin(__builtin_clzll) || yyjson_gcc_available(3, 4, 0)
+#define GCC_HAS_CLZLL 1
+#else
+#define GCC_HAS_CLZLL 0
+#endif
+
+#if yyjson_has_builtin(__builtin_ctzll) || yyjson_gcc_available(3, 4, 0)
+#define GCC_HAS_CTZLL 1
+#else
+#define GCC_HAS_CTZLL 0
+#endif
+
+/* int128 type */
+#if defined(__SIZEOF_INT128__) && (__SIZEOF_INT128__ == 16) &&                                     \
+    (defined(__GNUC__) || defined(__clang__) || defined(__INTEL_COMPILER))
+#define YYJSON_HAS_INT128 1
+#else
+#define YYJSON_HAS_INT128 0
+#endif
+
+/* IEEE 754 floating-point binary representation */
+#if defined(__STDC_IEC_559__) || defined(__STDC_IEC_60559_BFP__)
+#define YYJSON_HAS_IEEE_754 1
+#elif (FLT_RADIX == 2) && (DBL_MANT_DIG == 53) && (DBL_DIG == 15) && (DBL_MIN_EXP == -1021) &&     \
+    (DBL_MAX_EXP == 1024) && (DBL_MIN_10_EXP == -307) && (DBL_MAX_10_EXP == 308)
+#define YYJSON_HAS_IEEE_754 1
+#else
+#define YYJSON_HAS_IEEE_754 0
+#endif
+
+/*
+ Correct rounding in double number computations.
+
+ On the x86 architecture, some compilers may use x87 FPU instructions for
+ floating-point arithmetic. The x87 FPU loads all floating point number as
+ 80-bit double-extended precision internally, then rounds the result to original
+ precision, which may produce inaccurate results. For a more detailed
+ explanation, see the paper: https://arxiv.org/abs/cs/0701192
+
+ Here are some examples of double precision calculation error:
+
+     2877.0 / 1e6   == 0.002877,  but x87 returns 0.0028770000000000002
+     43683.0 * 1e21 == 4.3683e25, but x87 returns 4.3683000000000004e25
+
+ Here are some examples of compiler flags to generate x87 instructions on x86:
+
+     clang -m32 -mno-sse
+     gcc/icc -m32 -mfpmath=387
+     msvc /arch:SSE or /arch:IA32
+
+ If we are sure that there's no similar error described above, we can define the
+ YYJSON_DOUBLE_MATH_CORRECT as 1 to enable the fast path calculation. This is
+ not an accurate detection, it's just try to avoid the error at compile-time.
+ An accurate detection can be done at run-time:
+
+     bool is_double_math_correct(void) {
+         volatile double r = 43683.0;
+         r *= 1e21;
+         return r == 4.3683e25;
+     }
+
+ See also: utils.h in https://github.com/google/double-conversion/
+ */
+#if !defined(FLT_EVAL_METHOD) && defined(__FLT_EVAL_METHOD__)
+#define FLT_EVAL_METHOD __FLT_EVAL_METHOD__
+#endif
+
+#if defined(FLT_EVAL_METHOD) && FLT_EVAL_METHOD != 0 && FLT_EVAL_METHOD != 1
+#define YYJSON_DOUBLE_MATH_CORRECT 0
+#elif defined(i386) || defined(__i386) || defined(__i386__) || defined(_X86_) ||                   \
+    defined(__X86__) || defined(_M_IX86) || defined(__I86__) || defined(__IA32__) ||               \
+    defined(__THW_INTEL)
+#if (defined(_MSC_VER) && defined(_M_IX86_FP) && _M_IX86_FP == 2) ||                               \
+    (defined(__SSE2_MATH__) && __SSE2_MATH__)
+#define YYJSON_DOUBLE_MATH_CORRECT 1
+#else
+#define YYJSON_DOUBLE_MATH_CORRECT 0
+#endif
+#elif defined(__mc68000__) || defined(__pnacl__) || defined(__native_client__)
+#define YYJSON_DOUBLE_MATH_CORRECT 0
+#else
+#define YYJSON_DOUBLE_MATH_CORRECT 1
+#endif
+
+/* endian */
+#if yyjson_has_include(<sys / types.h>)
+#include <sys/types.h> /* POSIX */
+#endif
+#if yyjson_has_include(<endian.h>)
+#include <endian.h> /* Linux */
+#elif yyjson_has_include(<sys / endian.h>)
+#include <sys/endian.h> /* BSD, Android */
+#elif yyjson_has_include(<machine / endian.h>)
+#include <machine/endian.h> /* BSD, Darwin */
+#endif
+
+#define YYJSON_BIG_ENDIAN 4321
+#define YYJSON_LITTLE_ENDIAN 1234
+
+#if defined(BYTE_ORDER) && BYTE_ORDER
+#if defined(BIG_ENDIAN) && (BYTE_ORDER == BIG_ENDIAN)
+#define YYJSON_ENDIAN YYJSON_BIG_ENDIAN
+#elif defined(LITTLE_ENDIAN) && (BYTE_ORDER == LITTLE_ENDIAN)
+#define YYJSON_ENDIAN YYJSON_LITTLE_ENDIAN
+#endif
+
+#elif defined(__BYTE_ORDER) && __BYTE_ORDER
+#if defined(__BIG_ENDIAN) && (__BYTE_ORDER == __BIG_ENDIAN)
+#define YYJSON_ENDIAN YYJSON_BIG_ENDIAN
+#elif defined(__LITTLE_ENDIAN) && (__BYTE_ORDER == __LITTLE_ENDIAN)
+#define YYJSON_ENDIAN YYJSON_LITTLE_ENDIAN
+#endif
+
+#elif defined(__BYTE_ORDER__) && __BYTE_ORDER__
+#if defined(__ORDER_BIG_ENDIAN__) && (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)
+#define YYJSON_ENDIAN YYJSON_BIG_ENDIAN
+#elif defined(__ORDER_LITTLE_ENDIAN__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)
+#define YYJSON_ENDIAN YYJSON_LITTLE_ENDIAN
+#endif
+
+#elif (defined(__LITTLE_ENDIAN__) && __LITTLE_ENDIAN__ == 1) || defined(__i386) ||                 \
+    defined(__i386__) || defined(_X86_) || defined(__X86__) || defined(_M_IX86) ||                 \
+    defined(__THW_INTEL__) || defined(__x86_64) || defined(__x86_64__) || defined(__amd64) ||      \
+    defined(__amd64__) || defined(_M_AMD64) || defined(_M_X64) || defined(_M_ARM) ||               \
+    defined(_M_ARM64) || defined(__ARMEL__) || defined(__THUMBEL__) || defined(__AARCH64EL__) ||   \
+    defined(_MIPSEL) || defined(__MIPSEL) || defined(__MIPSEL__) || defined(__EMSCRIPTEN__) ||     \
+    defined(__wasm__) || defined(__loongarch__)
+#define YYJSON_ENDIAN YYJSON_LITTLE_ENDIAN
+
+#elif (defined(__BIG_ENDIAN__) && __BIG_ENDIAN__ == 1) || defined(__ARMEB__) ||                    \
+    defined(__THUMBEB__) || defined(__AARCH64EB__) || defined(_MIPSEB) || defined(__MIPSEB) ||     \
+    defined(__MIPSEB__) || defined(__or1k__) || defined(__OR1K__)
+#define YYJSON_ENDIAN YYJSON_BIG_ENDIAN
+
+#else
+#define YYJSON_ENDIAN 0 /* unknown endian, detect at run-time */
+#endif
+
+/*
+ This macro controls how yyjson handles unaligned memory accesses.
+
+ By default, yyjson uses `memcpy()` for memory copying. This takes advantage of
+ the compiler's automatic optimizations to generate unaligned memory access
+ instructions when the target architecture supports it.
+
+ However, for some older compilers or architectures where `memcpy()` isn't
+ optimized well and may generate unnecessary function calls, consider defining
+ this macro as 1. In such cases, yyjson switches to manual byte-by-byte access,
+ potentially improving performance. An example of the generated assembly code on
+ the ARM platform can be found here: https://godbolt.org/z/334jjhxPT
+
+ As this flag has already been enabled for some common architectures in the
+ following code, users typically don't need to manually specify it. If users are
+ unsure about it, please review the generated assembly code or perform actual
+ benchmark to make an informed decision.
+ */
+#ifndef YYJSON_DISABLE_UNALIGNED_MEMORY_ACCESS
+#if defined(__ia64) || defined(_IA64) || defined(__IA64__) || defined(__ia64__) ||                 \
+    defined(_M_IA64) || defined(__itanium__)
+#define YYJSON_DISABLE_UNALIGNED_MEMORY_ACCESS 1 /* Itanium */
+#elif (defined(__arm__) || defined(__arm64__) || defined(__aarch64__)) &&                          \
+    (defined(__GNUC__) || defined(__clang__)) &&                                                   \
+    (!defined(__ARM_FEATURE_UNALIGNED) || !__ARM_FEATURE_UNALIGNED)
+#define YYJSON_DISABLE_UNALIGNED_MEMORY_ACCESS 1 /* ARM */
+#elif defined(__sparc) || defined(__sparc__)
+#define YYJSON_DISABLE_UNALIGNED_MEMORY_ACCESS 1 /* SPARC */
+#elif defined(__mips) || defined(__mips__) || defined(__MIPS__)
+#define YYJSON_DISABLE_UNALIGNED_MEMORY_ACCESS 1 /* MIPS */
+#elif defined(__m68k__) || defined(M68000)
+#define YYJSON_DISABLE_UNALIGNED_MEMORY_ACCESS 1 /* M68K */
+#else
+#define YYJSON_DISABLE_UNALIGNED_MEMORY_ACCESS 0
+#endif
+#endif
+
+/*
+ Estimated initial ratio of the JSON data (data_size / value_count).
+ For example:
+
+    data:        {"id":12345678,"name":"Harry"}
+    data_size:   30
+    value_count: 5
+    ratio:       6
+
+ yyjson uses dynamic memory with a growth factor of 1.5 when reading and writing
+ JSON, the ratios below are used to determine the initial memory size.
+
+ A too large ratio will waste memory, and a too small ratio will cause multiple
+ memory growths and degrade performance. Currently, these ratios are generated
+ with some commonly used JSON datasets.
+ */
+#define YYJSON_READER_ESTIMATED_PRETTY_RATIO 16
+#define YYJSON_READER_ESTIMATED_MINIFY_RATIO 6
+#define YYJSON_WRITER_ESTIMATED_PRETTY_RATIO 32
+#define YYJSON_WRITER_ESTIMATED_MINIFY_RATIO 18
+
+/* The initial and maximum size of the memory pool's chunk in yyjson_mut_doc. */
+#define YYJSON_MUT_DOC_STR_POOL_INIT_SIZE 0x100
+#define YYJSON_MUT_DOC_STR_POOL_MAX_SIZE 0x10000000
+#define YYJSON_MUT_DOC_VAL_POOL_INIT_SIZE (0x10 * sizeof(yyjson_mut_val))
+#define YYJSON_MUT_DOC_VAL_POOL_MAX_SIZE (0x1000000 * sizeof(yyjson_mut_val))
+
+/* The minimum size of the dynamic allocator's chunk. */
+#define YYJSON_ALC_DYN_MIN_SIZE 0x1000
+
+/* Default value for compile-time options. */
+#ifndef YYJSON_DISABLE_READER
+#define YYJSON_DISABLE_READER 0
+#endif
+#ifndef YYJSON_DISABLE_WRITER
+#define YYJSON_DISABLE_WRITER 0
+#endif
+#ifndef YYJSON_DISABLE_UTILS
+#define YYJSON_DISABLE_UTILS 0
+#endif
+#ifndef YYJSON_DISABLE_FAST_FP_CONV
+#define YYJSON_DISABLE_FAST_FP_CONV 0
+#endif
+#ifndef YYJSON_DISABLE_NON_STANDARD
+#define YYJSON_DISABLE_NON_STANDARD 0
+#endif
+#ifndef YYJSON_DISABLE_UTF8_VALIDATION
+#define YYJSON_DISABLE_UTF8_VALIDATION 0
+#endif
+
+/*==============================================================================
+ * Macros
+ *============================================================================*/
+
+/* Macros used for loop unrolling and other purpose. */
+#define repeat2(x)                                                                                 \
+    { x x }
+#define repeat3(x)                                                                                 \
+    { x x x }
+#define repeat4(x)                                                                                 \
+    { x x x x }
+#define repeat8(x)                                                                                 \
+    { x x x x x x x x }
+#define repeat16(x)                                                                                \
+    { x x x x x x x x x x x x x x x x }
+
+#define repeat2_incr(x)                                                                            \
+    { x(0) x(1) }
+#define repeat4_incr(x)                                                                            \
+    { x(0) x(1) x(2) x(3) }
+#define repeat8_incr(x)                                                                            \
+    { x(0) x(1) x(2) x(3) x(4) x(5) x(6) x(7) }
+#define repeat16_incr(x)                                                                           \
+    { x(0) x(1) x(2) x(3) x(4) x(5) x(6) x(7) x(8) x(9) x(10) x(11) x(12) x(13) x(14) x(15) }
+
+#define repeat_in_1_18(x)                                                                          \
+    {                                                                                              \
+        x(1) x(2) x(3) x(4) x(5) x(6) x(7) x(8) x(9) x(10) x(11) x(12) x(13) x(14) x(15) x(16)     \
+            x(17) x(18)                                                                            \
+    }
+
+/* Macros used to provide branch prediction information for compiler. */
+#undef likely
+#define likely(x) yyjson_likely(x)
+#undef unlikely
+#define unlikely(x) yyjson_unlikely(x)
+
+/* Macros used to provide inline information for compiler. */
+#undef static_inline
+#define static_inline static yyjson_inline
+#undef static_noinline
+#define static_noinline static yyjson_noinline
+
+/* Macros for min and max. */
+#undef yyjson_min
+#define yyjson_min(x, y) ((x) < (y) ? (x) : (y))
+#undef yyjson_max
+#define yyjson_max(x, y) ((x) > (y) ? (x) : (y))
+
+/* Used to write u64 literal for C89 which doesn't support "ULL" suffix. */
+#undef U64
+#define U64(hi, lo) ((((u64)hi##UL) << 32U) + lo##UL)
+
+/* Used to cast away (remove) const qualifier. */
+#define constcast(type) (type)(void*)(size_t)(const void*)
+
+/* flag test */
+#define has_read_flag(_flag) unlikely(read_flag_eq(flg, YYJSON_READ_##_flag))
+#define has_write_flag(_flag) unlikely(write_flag_eq(flg, YYJSON_WRITE_##_flag))
+
+static_inline bool read_flag_eq(yyjson_read_flag flg, yyjson_read_flag chk) {
+#if YYJSON_DISABLE_NON_STANDARD
+    if (chk == YYJSON_READ_ALLOW_INF_AND_NAN || chk == YYJSON_READ_ALLOW_COMMENTS ||
+        chk == YYJSON_READ_ALLOW_TRAILING_COMMAS || chk == YYJSON_READ_ALLOW_INVALID_UNICODE)
+        return false; /* this should be evaluated at compile-time */
+#endif
+    return (flg & chk) != 0;
+}
+
+static_inline bool write_flag_eq(yyjson_write_flag flg, yyjson_write_flag chk) {
+#if YYJSON_DISABLE_NON_STANDARD
+    if (chk == YYJSON_WRITE_ALLOW_INF_AND_NAN || chk == YYJSON_WRITE_ALLOW_INVALID_UNICODE)
+        return false; /* this should be evaluated at compile-time */
+#endif
+    return (flg & chk) != 0;
+}
+
+/*==============================================================================
+ * Integer Constants
+ *============================================================================*/
+
+/* U64 constant values */
+#undef U64_MAX
+#define U64_MAX U64(0xFFFFFFFF, 0xFFFFFFFF)
+#undef I64_MAX
+#define I64_MAX U64(0x7FFFFFFF, 0xFFFFFFFF)
+#undef USIZE_MAX
+#define USIZE_MAX ((usize)(~(usize)0))
+
+/* Maximum number of digits for reading u32/u64/usize safety (not overflow). */
+#undef U32_SAFE_DIG
+#define U32_SAFE_DIG 9 /* u32 max is 4294967295, 10 digits */
+#undef U64_SAFE_DIG
+#define U64_SAFE_DIG 19 /* u64 max is 18446744073709551615, 20 digits */
+#undef USIZE_SAFE_DIG
+#define USIZE_SAFE_DIG (sizeof(usize) == 8 ? U64_SAFE_DIG : U32_SAFE_DIG)
+
+/*==============================================================================
+ * IEEE-754 Double Number Constants
+ *============================================================================*/
+
+/* Inf raw value (positive) */
+#define F64_RAW_INF U64(0x7FF00000, 0x00000000)
+
+/* NaN raw value (quiet NaN, no payload, no sign) */
+#if defined(__hppa__) || (defined(__mips__) && !defined(__mips_nan2008))
+#define F64_RAW_NAN U64(0x7FF7FFFF, 0xFFFFFFFF)
+#else
+#define F64_RAW_NAN U64(0x7FF80000, 0x00000000)
+#endif
+
+/* double number bits */
+#define F64_BITS 64
+
+/* double number exponent part bits */
+#define F64_EXP_BITS 11
+
+/* double number significand part bits */
+#define F64_SIG_BITS 52
+
+/* double number significand part bits (with 1 hidden bit) */
+#define F64_SIG_FULL_BITS 53
+
+/* double number significand bit mask */
+#define F64_SIG_MASK U64(0x000FFFFF, 0xFFFFFFFF)
+
+/* double number exponent bit mask */
+#define F64_EXP_MASK U64(0x7FF00000, 0x00000000)
+
+/* double number exponent bias */
+#define F64_EXP_BIAS 1023
+
+/* double number significant digits count in decimal */
+#define F64_DEC_DIG 17
+
+/* max significant digits count in decimal when reading double number */
+#define F64_MAX_DEC_DIG 768
+
+/* maximum decimal power of double number (1.7976931348623157e308) */
+#define F64_MAX_DEC_EXP 308
+
+/* minimum decimal power of double number (4.9406564584124654e-324) */
+#define F64_MIN_DEC_EXP (-324)
+
+/* maximum binary power of double number */
+#define F64_MAX_BIN_EXP 1024
+
+/* minimum binary power of double number */
+#define F64_MIN_BIN_EXP (-1021)
+
+/*==============================================================================
+ * Types
+ *============================================================================*/
+
+/** Type define for primitive types. */
+typedef float f32;
+typedef double f64;
+typedef int8_t i8;
+typedef uint8_t u8;
+typedef int16_t i16;
+typedef uint16_t u16;
+typedef int32_t i32;
+typedef uint32_t u32;
+typedef int64_t i64;
+typedef uint64_t u64;
+typedef size_t usize;
+
+/** 128-bit integer, used by floating-point number reader and writer. */
+#if YYJSON_HAS_INT128
+__extension__ typedef __int128 i128;
+__extension__ typedef unsigned __int128 u128;
+#endif
+
+/** 16/32/64-bit vector */
+typedef struct v16 {
+    char c[2];
+} v16;
+typedef struct v32 {
+    char c[4];
+} v32;
+typedef struct v64 {
+    char c[8];
+} v64;
+
+/** 16/32/64-bit vector union */
+typedef union v16_uni {
+    v16 v;
+    u16 u;
+} v16_uni;
+typedef union v32_uni {
+    v32 v;
+    u32 u;
+} v32_uni;
+typedef union v64_uni {
+    v64 v;
+    u64 u;
+} v64_uni;
+
+/*==============================================================================
+ * Load/Store Utils
+ *============================================================================*/
+
+#if YYJSON_DISABLE_UNALIGNED_MEMORY_ACCESS
+
+#define byte_move_idx(x) ((char*)dst)[x] = ((const char*)src)[x];
+
+static_inline void byte_copy_2(void* dst, const void* src){repeat2_incr(byte_move_idx)}
+
+static_inline void byte_copy_4(void* dst, const void* src){repeat4_incr(byte_move_idx)}
+
+static_inline void byte_copy_8(void* dst, const void* src){repeat8_incr(byte_move_idx)}
+
+static_inline void byte_copy_16(void* dst, const void* src){repeat16_incr(byte_move_idx)}
+
+static_inline void byte_move_2(void* dst, const void* src){repeat2_incr(byte_move_idx)}
+
+static_inline void byte_move_4(void* dst, const void* src){repeat4_incr(byte_move_idx)}
+
+static_inline void byte_move_8(void* dst, const void* src){repeat8_incr(byte_move_idx)}
+
+static_inline void byte_move_16(void* dst, const void* src){repeat16_incr(byte_move_idx)}
+
+static_inline bool byte_match_2(void* buf, const char* pat) {
+    return ((char*)buf)[0] == ((const char*)pat)[0] && ((char*)buf)[1] == ((const char*)pat)[1];
+}
+
+static_inline bool byte_match_4(void* buf, const char* pat) {
+    return ((char*)buf)[0] == ((const char*)pat)[0] && ((char*)buf)[1] == ((const char*)pat)[1] &&
+           ((char*)buf)[2] == ((const char*)pat)[2] && ((char*)buf)[3] == ((const char*)pat)[3];
+}
+
+static_inline u16 byte_load_2(const void* src) {
+    v16_uni uni;
+    uni.v.c[0] = ((const char*)src)[0];
+    uni.v.c[1] = ((const char*)src)[1];
+    return uni.u;
+}
+
+static_inline u32 byte_load_3(const void* src) {
+    v32_uni uni;
+    uni.v.c[0] = ((const char*)src)[0];
+    uni.v.c[1] = ((const char*)src)[1];
+    uni.v.c[2] = ((const char*)src)[2];
+    uni.v.c[3] = 0;
+    return uni.u;
+}
+
+static_inline u32 byte_load_4(const void* src) {
+    v32_uni uni;
+    uni.v.c[0] = ((const char*)src)[0];
+    uni.v.c[1] = ((const char*)src)[1];
+    uni.v.c[2] = ((const char*)src)[2];
+    uni.v.c[3] = ((const char*)src)[3];
+    return uni.u;
+}
+
+#undef byte_move_expr
+
+#else
+
+static_inline void byte_copy_2(void* dst, const void* src) {
+    memcpy(dst, src, 2);
+}
+
+static_inline void byte_copy_4(void* dst, const void* src) {
+    memcpy(dst, src, 4);
+}
+
+static_inline void byte_copy_8(void* dst, const void* src) {
+    memcpy(dst, src, 8);
+}
+
+static_inline void byte_copy_16(void* dst, const void* src) {
+    memcpy(dst, src, 16);
+}
+
+static_inline void byte_move_2(void* dst, const void* src) {
+    u16 tmp;
+    memcpy(&tmp, src, 2);
+    memcpy(dst, &tmp, 2);
+}
+
+static_inline void byte_move_4(void* dst, const void* src) {
+    u32 tmp;
+    memcpy(&tmp, src, 4);
+    memcpy(dst, &tmp, 4);
+}
+
+static_inline void byte_move_8(void* dst, const void* src) {
+    u64 tmp;
+    memcpy(&tmp, src, 8);
+    memcpy(dst, &tmp, 8);
+}
+
+static_inline void byte_move_16(void* dst, const void* src) {
+    char* pdst = (char*)dst;
+    const char* psrc = (const char*)src;
+    u64 tmp1, tmp2;
+    memcpy(&tmp1, psrc, 8);
+    memcpy(&tmp2, psrc + 8, 8);
+    memcpy(pdst, &tmp1, 8);
+    memcpy(pdst + 8, &tmp2, 8);
+}
+
+static_inline bool byte_match_2(void* buf, const char* pat) {
+    v16_uni u1, u2;
+    memcpy(&u1, buf, 2);
+    memcpy(&u2, pat, 2);
+    return u1.u == u2.u;
+}
+
+static_inline bool byte_match_4(void* buf, const char* pat) {
+    v32_uni u1, u2;
+    memcpy(&u1, buf, 4);
+    memcpy(&u2, pat, 4);
+    return u1.u == u2.u;
+}
+
+static_inline u16 byte_load_2(const void* src) {
+    v16_uni uni;
+    memcpy(&uni, src, 2);
+    return uni.u;
+}
+
+static_inline u32 byte_load_3(const void* src) {
+    v32_uni uni;
+    memcpy(&uni, src, 2);
+    uni.v.c[2] = ((const char*)src)[2];
+    uni.v.c[3] = 0;
+    return uni.u;
+}
+
+static_inline u32 byte_load_4(const void* src) {
+    v32_uni uni;
+    memcpy(&uni, src, 4);
+    return uni.u;
+}
+
+#endif
+
+/*==============================================================================
+ * Number Utils
+ * These functions are used to detect and convert NaN and Inf numbers.
+ *============================================================================*/
+
+/** Convert raw binary to double. */
+static_inline f64 f64_from_raw(u64 u) {
+    /* use memcpy to avoid violating the strict aliasing rule */
+    f64 f;
+    memcpy(&f, &u, 8);
+    return f;
+}
+
+/** Convert double to raw binary. */
+static_inline u64 f64_to_raw(f64 f) {
+    /* use memcpy to avoid violating the strict aliasing rule */
+    u64 u;
+    memcpy(&u, &f, 8);
+    return u;
+}
+
+/** Get raw 'infinity' with sign. */
+static_inline u64 f64_raw_get_inf(bool sign) {
+#if YYJSON_HAS_IEEE_754
+    return F64_RAW_INF | ((u64)sign << 63);
+#elif defined(INFINITY)
+    return f64_to_raw(sign ? -INFINITY : INFINITY);
+#else
+    return f64_to_raw(sign ? -HUGE_VAL : HUGE_VAL);
+#endif
+}
+
+/** Get raw 'nan' with sign. */
+static_inline u64 f64_raw_get_nan(bool sign) {
+#if YYJSON_HAS_IEEE_754
+    return F64_RAW_NAN | ((u64)sign << 63);
+#elif defined(NAN)
+    return f64_to_raw(sign ? (f64)-NAN : (f64)NAN);
+#else
+    return f64_to_raw((sign ? -0.0 : 0.0) / 0.0);
+#endif
+}
+
+/**
+ Convert normalized u64 (highest bit is 1) to f64.
+
+ Some compiler (such as Microsoft Visual C++ 6.0) do not support converting
+ number from u64 to f64. This function will first convert u64 to i64 and then
+ to f64, with `to nearest` rounding mode.
+ */
+static_inline f64 normalized_u64_to_f64(u64 val) {
+#if YYJSON_U64_TO_F64_NO_IMPL
+    i64 sig = (i64)((val >> 1) | (val & 1));
+    return ((f64)sig) * (f64)2.0;
+#else
+    return (f64)val;
+#endif
+}
+
+/*==============================================================================
+ * Size Utils
+ * These functions are used for memory allocation.
+ *============================================================================*/
+
+/** Returns whether the size is overflow after increment. */
+static_inline bool size_add_is_overflow(usize size, usize add) {
+    return size > (size + add);
+}
+
+/** Returns whether the size is power of 2 (size should not be 0). */
+static_inline bool size_is_pow2(usize size) {
+    return (size & (size - 1)) == 0;
+}
+
+/** Align size upwards (may overflow). */
+static_inline usize size_align_up(usize size, usize align) {
+    if (size_is_pow2(align)) {
+        return (size + (align - 1)) & ~(align - 1);
+    } else {
+        return size + align - (size + align - 1) % align - 1;
+    }
+}
+
+/** Align size downwards. */
+static_inline usize size_align_down(usize size, usize align) {
+    if (size_is_pow2(align)) {
+        return size & ~(align - 1);
+    } else {
+        return size - (size % align);
+    }
+}
+
+/** Align address upwards (may overflow). */
+static_inline void* mem_align_up(void* mem, usize align) {
+    usize size;
+    memcpy(&size, &mem, sizeof(usize));
+    size = size_align_up(size, align);
+    memcpy(&mem, &size, sizeof(usize));
+    return mem;
+}
+
+/*==============================================================================
+ * Bits Utils
+ * These functions are used by the floating-point number reader and writer.
+ *============================================================================*/
+
+/** Returns the number of leading 0-bits in value (input should not be 0). */
+static_inline u32 u64_lz_bits(u64 v) {
+#if GCC_HAS_CLZLL
+    return (u32)__builtin_clzll(v);
+#elif MSC_HAS_BIT_SCAN_64
+    unsigned long r;
+    _BitScanReverse64(&r, v);
+    return (u32)63 - (u32)r;
+#elif MSC_HAS_BIT_SCAN
+    unsigned long hi, lo;
+    bool hi_set = _BitScanReverse(&hi, (u32)(v >> 32)) != 0;
+    _BitScanReverse(&lo, (u32)v);
+    hi |= 32;
+    return (u32)63 - (u32)(hi_set ? hi : lo);
+#else
+    /*
+     branchless, use de Bruijn sequences
+     see: https://www.chessprogramming.org/BitScan
+     */
+    const u8 table[64] = {63, 16, 62, 7, 15, 36, 61, 3, 6, 14, 22, 26, 35, 47, 60, 2, 9, 5, 28, 11,
+        13, 21, 42, 19, 25, 31, 34, 40, 46, 52, 59, 1, 17, 8, 37, 4, 23, 27, 48, 10, 29, 12, 43, 20,
+        32, 41, 53, 18, 38, 24, 49, 30, 44, 33, 54, 39, 50, 45, 55, 51, 56, 57, 58, 0};
+    v |= v >> 1;
+    v |= v >> 2;
+    v |= v >> 4;
+    v |= v >> 8;
+    v |= v >> 16;
+    v |= v >> 32;
+    return table[(v * U64(0x03F79D71, 0xB4CB0A89)) >> 58];
+#endif
+}
+
+/** Returns the number of trailing 0-bits in value (input should not be 0). */
+static_inline u32 u64_tz_bits(u64 v) {
+#if GCC_HAS_CTZLL
+    return (u32)__builtin_ctzll(v);
+#elif MSC_HAS_BIT_SCAN_64
+    unsigned long r;
+    _BitScanForward64(&r, v);
+    return (u32)r;
+#elif MSC_HAS_BIT_SCAN
+    unsigned long lo, hi;
+    bool lo_set = _BitScanForward(&lo, (u32)(v)) != 0;
+    _BitScanForward(&hi, (u32)(v >> 32));
+    hi += 32;
+    return lo_set ? lo : hi;
+#else
+    /*
+     branchless, use de Bruijn sequences
+     see: https://www.chessprogramming.org/BitScan
+     */
+    const u8 table[64] = {0, 1, 2, 53, 3, 7, 54, 27, 4, 38, 41, 8, 34, 55, 48, 28, 62, 5, 39, 46,
+        44, 42, 22, 9, 24, 35, 59, 56, 49, 18, 29, 11, 63, 52, 6, 26, 37, 40, 33, 47, 61, 45, 43,
+        21, 23, 58, 17, 10, 51, 25, 36, 32, 60, 20, 57, 16, 50, 31, 19, 15, 30, 14, 13, 12};
+    return table[((v & (~v + 1)) * U64(0x022FDD63, 0xCC95386D)) >> 58];
+#endif
+}
+
+/*==============================================================================
+ * 128-bit Integer Utils
+ * These functions are used by the floating-point number reader and writer.
+ *============================================================================*/
+
+/** Multiplies two 64-bit unsigned integers (a * b),
+    returns the 128-bit result as 'hi' and 'lo'. */
+static_inline void u128_mul(u64 a, u64 b, u64* hi, u64* lo) {
+#if YYJSON_HAS_INT128
+    u128 m = (u128)a * b;
+    *hi = (u64)(m >> 64);
+    *lo = (u64)(m);
+#elif MSC_HAS_UMUL128
+    *lo = _umul128(a, b, hi);
+#else
+    u32 a0 = (u32)(a), a1 = (u32)(a >> 32);
+    u32 b0 = (u32)(b), b1 = (u32)(b >> 32);
+    u64 p00 = (u64)a0 * b0, p01 = (u64)a0 * b1;
+    u64 p10 = (u64)a1 * b0, p11 = (u64)a1 * b1;
+    u64 m0 = p01 + (p00 >> 32);
+    u32 m00 = (u32)(m0), m01 = (u32)(m0 >> 32);
+    u64 m1 = p10 + m00;
+    u32 m10 = (u32)(m1), m11 = (u32)(m1 >> 32);
+    *hi = p11 + m01 + m11;
+    *lo = ((u64)m10 << 32) | (u32)p00;
+#endif
+}
+
+/** Multiplies two 64-bit unsigned integers and add a value (a * b + c),
+    returns the 128-bit result as 'hi' and 'lo'. */
+static_inline void u128_mul_add(u64 a, u64 b, u64 c, u64* hi, u64* lo) {
+#if YYJSON_HAS_INT128
+    u128 m = (u128)a * b + c;
+    *hi = (u64)(m >> 64);
+    *lo = (u64)(m);
+#else
+    u64 h, l, t;
+    u128_mul(a, b, &h, &l);
+    t = l + c;
+    h += (u64)(((t < l) | (t < c)));
+    *hi = h;
+    *lo = t;
+#endif
+}
+
+/*==============================================================================
+ * File Utils
+ * These functions are used to read and write JSON files.
+ *============================================================================*/
+
+#define YYJSON_FOPEN_EXT
+#if !defined(_MSC_VER) && defined(__GLIBC__) && defined(__GLIBC_PREREQ)
+#if __GLIBC_PREREQ(2, 7)
+#undef YYJSON_FOPEN_EXT
+#define YYJSON_FOPEN_EXT "e" /* glibc extension to enable O_CLOEXEC */
+#endif
+#endif
+
+static_inline FILE* fopen_safe(const char* path, const char* mode) {
+#if YYJSON_MSC_VER >= 1400
+    FILE* file = NULL;
+    if (fopen_s(&file, path, mode) != 0)
+        return NULL;
+    return file;
+#else
+    return fopen(path, mode);
+#endif
+}
+
+static_inline FILE* fopen_readonly(const char* path) {
+    return fopen_safe(path, "rb" YYJSON_FOPEN_EXT);
+}
+
+static_inline FILE* fopen_writeonly(const char* path) {
+    return fopen_safe(path, "wb" YYJSON_FOPEN_EXT);
+}
+
+static_inline usize fread_safe(void* buf, usize size, FILE* file) {
+#if YYJSON_MSC_VER >= 1400
+    return fread_s(buf, size, 1, size, file);
+#else
+    return fread(buf, 1, size, file);
+#endif
+}
+
+/*==============================================================================
+ * Default Memory Allocator
+ * This is a simple libc memory allocator wrapper.
+ *============================================================================*/
+
+static void* default_malloc(void* ctx, usize size) {
+    return malloc(size);
+}
+
+static void* default_realloc(void* ctx, void* ptr, usize old_size, usize size) {
+    return realloc(ptr, size);
+}
+
+static void default_free(void* ctx, void* ptr) {
+    free(ptr);
+}
+
+static const yyjson_alc YYJSON_DEFAULT_ALC = {default_malloc, default_realloc, default_free, NULL};
+
+/*==============================================================================
+ * Null Memory Allocator
+ *
+ * This allocator is just a placeholder to ensure that the internal
+ * malloc/realloc/free function pointers are not null.
+ *============================================================================*/
+
+static void* null_malloc(void* ctx, usize size) {
+    return NULL;
+}
+
+static void* null_realloc(void* ctx, void* ptr, usize old_size, usize size) {
+    return NULL;
+}
+
+static void null_free(void* ctx, void* ptr) {
+    return;
+}
+
+static const yyjson_alc YYJSON_NULL_ALC = {null_malloc, null_realloc, null_free, NULL};
+
+/*==============================================================================
+ * Pool Memory Allocator
+ *
+ * This allocator is initialized with a fixed-size buffer.
+ * The buffer is split into multiple memory chunks for memory allocation.
+ *============================================================================*/
+
+/** memory chunk header */
+typedef struct pool_chunk {
+    usize size;              /* chunk memory size, include chunk header */
+    struct pool_chunk* next; /* linked list, nullable */
+    /* char mem[]; flexible array member */
+} pool_chunk;
+
+/** allocator ctx header */
+typedef struct pool_ctx {
+    usize size;            /* total memory size, include ctx header */
+    pool_chunk* free_list; /* linked list, nullable */
+    /* pool_chunk chunks[]; flexible array member */
+} pool_ctx;
+
+/** align up the input size to chunk size */
+static_inline void pool_size_align(usize* size) {
+    *size = size_align_up(*size, sizeof(pool_chunk)) + sizeof(pool_chunk);
+}
+
+static void* pool_malloc(void* ctx_ptr, usize size) {
+    /* assert(size != 0) */
+    pool_ctx* ctx = (pool_ctx*)ctx_ptr;
+    pool_chunk *next, *prev = NULL, *cur = ctx->free_list;
+
+    if (unlikely(size >= ctx->size))
+        return NULL;
+    pool_size_align(&size);
+
+    while (cur) {
+        if (cur->size < size) {
+            /* not enough space, try next chunk */
+            prev = cur;
+            cur = cur->next;
+            continue;
+        }
+        if (cur->size >= size + sizeof(pool_chunk) * 2) {
+            /* too much space, split this chunk */
+            next = (pool_chunk*)(void*)((u8*)cur + size);
+            next->size = cur->size - size;
+            next->next = cur->next;
+            cur->size = size;
+        } else {
+            /* just enough space, use whole chunk */
+            next = cur->next;
+        }
+        if (prev)
+            prev->next = next;
+        else
+            ctx->free_list = next;
+        return (void*)(cur + 1);
+    }
+    return NULL;
+}
+
+static void pool_free(void* ctx_ptr, void* ptr) {
+    /* assert(ptr != NULL) */
+    pool_ctx* ctx = (pool_ctx*)ctx_ptr;
+    pool_chunk* cur = ((pool_chunk*)ptr) - 1;
+    pool_chunk *prev = NULL, *next = ctx->free_list;
+
+    while (next && next < cur) {
+        prev = next;
+        next = next->next;
+    }
+    if (prev)
+        prev->next = cur;
+    else
+        ctx->free_list = cur;
+    cur->next = next;
+
+    if (next && ((u8*)cur + cur->size) == (u8*)next) {
+        /* merge cur to higher chunk */
+        cur->size += next->size;
+        cur->next = next->next;
+    }
+    if (prev && ((u8*)prev + prev->size) == (u8*)cur) {
+        /* merge cur to lower chunk */
+        prev->size += cur->size;
+        prev->next = cur->next;
+    }
+}
+
+static void* pool_realloc(void* ctx_ptr, void* ptr, usize old_size, usize size) {
+    /* assert(ptr != NULL && size != 0 && old_size < size) */
+    pool_ctx* ctx = (pool_ctx*)ctx_ptr;
+    pool_chunk *cur = ((pool_chunk*)ptr) - 1, *prev, *next, *tmp;
+
+    /* check size */
+    if (unlikely(size >= ctx->size))
+        return NULL;
+    pool_size_align(&old_size);
+    pool_size_align(&size);
+    if (unlikely(old_size == size))
+        return ptr;
+
+    /* find next and prev chunk */
+    prev = NULL;
+    next = ctx->free_list;
+    while (next && next < cur) {
+        prev = next;
+        next = next->next;
+    }
+
+    if ((u8*)cur + cur->size == (u8*)next && cur->size + next->size >= size) {
+        /* merge to higher chunk if they are contiguous */
+        usize free_size = cur->size + next->size - size;
+        if (free_size > sizeof(pool_chunk) * 2) {
+            tmp = (pool_chunk*)(void*)((u8*)cur + size);
+            if (prev)
+                prev->next = tmp;
+            else
+                ctx->free_list = tmp;
+            tmp->next = next->next;
+            tmp->size = free_size;
+            cur->size = size;
+        } else {
+            if (prev)
+                prev->next = next->next;
+            else
+                ctx->free_list = next->next;
+            cur->size += next->size;
+        }
+        return ptr;
+    } else {
+        /* fallback to malloc and memcpy */
+        void* new_ptr = pool_malloc(ctx_ptr, size - sizeof(pool_chunk));
+        if (new_ptr) {
+            memcpy(new_ptr, ptr, cur->size - sizeof(pool_chunk));
+            pool_free(ctx_ptr, ptr);
+        }
+        return new_ptr;
+    }
+}
+
+bool yyjson_alc_pool_init(yyjson_alc* alc, void* buf, usize size) {
+    pool_chunk* chunk;
+    pool_ctx* ctx;
+
+    if (unlikely(!alc))
+        return false;
+    *alc = YYJSON_NULL_ALC;
+    if (size < sizeof(pool_ctx) * 4)
+        return false;
+    ctx = (pool_ctx*)mem_align_up(buf, sizeof(pool_ctx));
+    if (unlikely(!ctx))
+        return false;
+    size -= (usize)((u8*)ctx - (u8*)buf);
+    size = size_align_down(size, sizeof(pool_ctx));
+
+    chunk = (pool_chunk*)(ctx + 1);
+    chunk->size = size - sizeof(pool_ctx);
+    chunk->next = NULL;
+    ctx->size = size;
+    ctx->free_list = chunk;
+
+    alc->malloc = pool_malloc;
+    alc->realloc = pool_realloc;
+    alc->free = pool_free;
+    alc->ctx = (void*)ctx;
+    return true;
+}
+
+/*==============================================================================
+ * Dynamic Memory Allocator
+ *
+ * This allocator allocates memory on demand and does not immediately release
+ * unused memory. Instead, it places the unused memory into a freelist for
+ * potential reuse in the future. It is only when the entire allocator is
+ * destroyed that all previously allocated memory is released at once.
+ *============================================================================*/
+
+/** memory chunk header */
+typedef struct dyn_chunk {
+    usize size; /* chunk size, include header */
+    struct dyn_chunk* next;
+    /* char mem[]; flexible array member */
+} dyn_chunk;
+
+/** allocator ctx header */
+typedef struct {
+    dyn_chunk free_list; /* dummy header, sorted from small to large */
+    dyn_chunk used_list; /* dummy header */
+} dyn_ctx;
+
+/** align up the input size to chunk size */
+static_inline bool dyn_size_align(usize* size) {
+    usize alc_size = *size + sizeof(dyn_chunk);
+    alc_size = size_align_up(alc_size, YYJSON_ALC_DYN_MIN_SIZE);
+    if (unlikely(alc_size < *size))
+        return false; /* overflow */
+    *size = alc_size;
+    return true;
+}
+
+/** remove a chunk from list (the chunk must already be in the list) */
+static_inline void dyn_chunk_list_remove(dyn_chunk* list, dyn_chunk* chunk) {
+    dyn_chunk *prev = list, *cur;
+    for (cur = prev->next; cur; cur = cur->next) {
+        if (cur == chunk) {
+            prev->next = cur->next;
+            cur->next = NULL;
+            return;
+        }
+        prev = cur;
+    }
+}
+
+/** add a chunk to list header (the chunk must not be in the list) */
+static_inline void dyn_chunk_list_add(dyn_chunk* list, dyn_chunk* chunk) {
+    chunk->next = list->next;
+    list->next = chunk;
+}
+
+static void* dyn_malloc(void* ctx_ptr, usize size) {
+    /* assert(size != 0) */
+    const yyjson_alc def = YYJSON_DEFAULT_ALC;
+    dyn_ctx* ctx = (dyn_ctx*)ctx_ptr;
+    dyn_chunk *chunk, *prev, *next;
+    if (unlikely(!dyn_size_align(&size)))
+        return NULL;
+
+    /* freelist is empty, create new chunk */
+    if (!ctx->free_list.next) {
+        chunk = (dyn_chunk*)def.malloc(def.ctx, size);
+        if (unlikely(!chunk))
+            return NULL;
+        chunk->size = size;
+        chunk->next = NULL;
+        dyn_chunk_list_add(&ctx->used_list, chunk);
+        return (void*)(chunk + 1);
+    }
+
+    /* find a large enough chunk, or resize the largest chunk */
+    prev = &ctx->free_list;
+    while (true) {
+        chunk = prev->next;
+        if (chunk->size >= size) { /* enough size, reuse this chunk */
+            prev->next = chunk->next;
+            dyn_chunk_list_add(&ctx->used_list, chunk);
+            return (void*)(chunk + 1);
+        }
+        if (!chunk->next) { /* resize the largest chunk */
+            chunk = (dyn_chunk*)def.realloc(def.ctx, chunk, chunk->size, size);
+            if (unlikely(!chunk))
+                return NULL;
+            prev->next = NULL;
+            chunk->size = size;
+            dyn_chunk_list_add(&ctx->used_list, chunk);
+            return (void*)(chunk + 1);
+        }
+        prev = chunk;
+    }
+}
+
+static void* dyn_realloc(void* ctx_ptr, void* ptr, usize old_size, usize size) {
+    /* assert(ptr != NULL && size != 0 && old_size < size) */
+    const yyjson_alc def = YYJSON_DEFAULT_ALC;
+    dyn_ctx* ctx = (dyn_ctx*)ctx_ptr;
+    dyn_chunk *prev, *next, *new_chunk;
+    dyn_chunk* chunk = (dyn_chunk*)ptr - 1;
+    if (unlikely(!dyn_size_align(&size)))
+        return NULL;
+    if (chunk->size >= size)
+        return ptr;
+
+    dyn_chunk_list_remove(&ctx->used_list, chunk);
+    new_chunk = (dyn_chunk*)def.realloc(def.ctx, chunk, chunk->size, size);
+    if (likely(new_chunk)) {
+        new_chunk->size = size;
+        chunk = new_chunk;
+    }
+    dyn_chunk_list_add(&ctx->used_list, chunk);
+    return new_chunk ? (void*)(new_chunk + 1) : NULL;
+}
+
+static void dyn_free(void* ctx_ptr, void* ptr) {
+    /* assert(ptr != NULL) */
+    dyn_ctx* ctx = (dyn_ctx*)ctx_ptr;
+    dyn_chunk *chunk = (dyn_chunk*)ptr - 1, *prev;
+
+    dyn_chunk_list_remove(&ctx->used_list, chunk);
+    for (prev = &ctx->free_list; prev; prev = prev->next) {
+        if (!prev->next || prev->next->size >= chunk->size) {
+            chunk->next = prev->next;
+            prev->next = chunk;
+            break;
+        }
+    }
+}
+
+yyjson_alc* yyjson_alc_dyn_new(void) {
+    const yyjson_alc def = YYJSON_DEFAULT_ALC;
+    usize hdr_len = sizeof(yyjson_alc) + sizeof(dyn_ctx);
+    yyjson_alc* alc = (yyjson_alc*)def.malloc(def.ctx, hdr_len);
+    dyn_ctx* ctx = (dyn_ctx*)(void*)(alc + 1);
+    if (unlikely(!alc))
+        return NULL;
+    alc->malloc = dyn_malloc;
+    alc->realloc = dyn_realloc;
+    alc->free = dyn_free;
+    alc->ctx = alc + 1;
+    memset(ctx, 0, sizeof(*ctx));
+    return alc;
+}
+
+void yyjson_alc_dyn_free(yyjson_alc* alc) {
+    const yyjson_alc def = YYJSON_DEFAULT_ALC;
+    dyn_ctx* ctx = (dyn_ctx*)(void*)(alc + 1);
+    dyn_chunk *chunk, *next;
+    if (unlikely(!alc))
+        return;
+    for (chunk = ctx->free_list.next; chunk; chunk = next) {
+        next = chunk->next;
+        def.free(def.ctx, chunk);
+    }
+    for (chunk = ctx->used_list.next; chunk; chunk = next) {
+        next = chunk->next;
+        def.free(def.ctx, chunk);
+    }
+    def.free(def.ctx, alc);
+}
+
+/*==============================================================================
+ * JSON document and value
+ *============================================================================*/
+
+static_inline void unsafe_yyjson_str_pool_release(yyjson_str_pool* pool, yyjson_alc* alc) {
+    yyjson_str_chunk *chunk = pool->chunks, *next;
+    while (chunk) {
+        next = chunk->next;
+        alc->free(alc->ctx, chunk);
+        chunk = next;
+    }
+}
+
+static_inline void unsafe_yyjson_val_pool_release(yyjson_val_pool* pool, yyjson_alc* alc) {
+    yyjson_val_chunk *chunk = pool->chunks, *next;
+    while (chunk) {
+        next = chunk->next;
+        alc->free(alc->ctx, chunk);
+        chunk = next;
+    }
+}
+
+bool unsafe_yyjson_str_pool_grow(yyjson_str_pool* pool, const yyjson_alc* alc, usize len) {
+    yyjson_str_chunk* chunk;
+    usize size, max_len;
+
+    /* create a new chunk */
+    max_len = USIZE_MAX - sizeof(yyjson_str_chunk);
+    if (unlikely(len > max_len))
+        return false;
+    size = len + sizeof(yyjson_str_chunk);
+    size = yyjson_max(pool->chunk_size, size);
+    chunk = (yyjson_str_chunk*)alc->malloc(alc->ctx, size);
+    if (unlikely(!chunk))
+        return false;
+
+    /* insert the new chunk as the head of the linked list */
+    chunk->next = pool->chunks;
+    chunk->chunk_size = size;
+    pool->chunks = chunk;
+    pool->cur = (char*)chunk + sizeof(yyjson_str_chunk);
+    pool->end = (char*)chunk + size;
+
+    /* the next chunk is twice the size of the current one */
+    size = yyjson_min(pool->chunk_size * 2, pool->chunk_size_max);
+    if (size < pool->chunk_size)
+        size = pool->chunk_size_max; /* overflow */
+    pool->chunk_size = size;
+    return true;
+}
+
+bool unsafe_yyjson_val_pool_grow(yyjson_val_pool* pool, const yyjson_alc* alc, usize count) {
+    yyjson_val_chunk* chunk;
+    usize size, max_count;
+
+    /* create a new chunk */
+    max_count = USIZE_MAX / sizeof(yyjson_mut_val) - 1;
+    if (unlikely(count > max_count))
+        return false;
+    size = (count + 1) * sizeof(yyjson_mut_val);
+    size = yyjson_max(pool->chunk_size, size);
+    chunk = (yyjson_val_chunk*)alc->malloc(alc->ctx, size);
+    if (unlikely(!chunk))
+        return false;
+
+    /* insert the new chunk as the head of the linked list */
+    chunk->next = pool->chunks;
+    chunk->chunk_size = size;
+    pool->chunks = chunk;
+    pool->cur = (yyjson_mut_val*)(void*)((u8*)chunk) + 1;
+    pool->end = (yyjson_mut_val*)(void*)((u8*)chunk + size);
+
+    /* the next chunk is twice the size of the current one */
+    size = yyjson_min(pool->chunk_size * 2, pool->chunk_size_max);
+    if (size < pool->chunk_size)
+        size = pool->chunk_size_max; /* overflow */
+    pool->chunk_size = size;
+    return true;
+}
+
+bool yyjson_mut_doc_set_str_pool_size(yyjson_mut_doc* doc, size_t len) {
+    usize max_size = USIZE_MAX - sizeof(yyjson_str_chunk);
+    if (!doc || !len || len > max_size)
+        return false;
+    doc->str_pool.chunk_size = len + sizeof(yyjson_str_chunk);
+    return true;
+}
+
+bool yyjson_mut_doc_set_val_pool_size(yyjson_mut_doc* doc, size_t count) {
+    usize max_count = USIZE_MAX / sizeof(yyjson_mut_val) - 1;
+    if (!doc || !count || count > max_count)
+        return false;
+    doc->val_pool.chunk_size = (count + 1) * sizeof(yyjson_mut_val);
+    return true;
+}
+
+void yyjson_mut_doc_free(yyjson_mut_doc* doc) {
+    if (doc) {
+        yyjson_alc alc = doc->alc;
+        memset(&doc->alc, 0, sizeof(alc));
+        unsafe_yyjson_str_pool_release(&doc->str_pool, &alc);
+        unsafe_yyjson_val_pool_release(&doc->val_pool, &alc);
+        alc.free(alc.ctx, doc);
+    }
+}
+
+yyjson_mut_doc* yyjson_mut_doc_new(const yyjson_alc* alc) {
+    yyjson_mut_doc* doc;
+    if (!alc)
+        alc = &YYJSON_DEFAULT_ALC;
+    doc = (yyjson_mut_doc*)alc->malloc(alc->ctx, sizeof(yyjson_mut_doc));
+    if (!doc)
+        return NULL;
+    memset(doc, 0, sizeof(yyjson_mut_doc));
+
+    doc->alc = *alc;
+    doc->str_pool.chunk_size = YYJSON_MUT_DOC_STR_POOL_INIT_SIZE;
+    doc->str_pool.chunk_size_max = YYJSON_MUT_DOC_STR_POOL_MAX_SIZE;
+    doc->val_pool.chunk_size = YYJSON_MUT_DOC_VAL_POOL_INIT_SIZE;
+    doc->val_pool.chunk_size_max = YYJSON_MUT_DOC_VAL_POOL_MAX_SIZE;
+    return doc;
+}
+
+yyjson_mut_doc* yyjson_doc_mut_copy(yyjson_doc* doc, const yyjson_alc* alc) {
+    yyjson_mut_doc* m_doc;
+    yyjson_mut_val* m_val;
+
+    if (!doc || !doc->root)
+        return NULL;
+    m_doc = yyjson_mut_doc_new(alc);
+    if (!m_doc)
+        return NULL;
+    m_val = yyjson_val_mut_copy(m_doc, doc->root);
+    if (!m_val) {
+        yyjson_mut_doc_free(m_doc);
+        return NULL;
+    }
+    yyjson_mut_doc_set_root(m_doc, m_val);
+    return m_doc;
+}
+
+yyjson_mut_doc* yyjson_mut_doc_mut_copy(yyjson_mut_doc* doc, const yyjson_alc* alc) {
+    yyjson_mut_doc* m_doc;
+    yyjson_mut_val* m_val;
+
+    if (!doc)
+        return NULL;
+    if (!doc->root)
+        return yyjson_mut_doc_new(alc);
+
+    m_doc = yyjson_mut_doc_new(alc);
+    if (!m_doc)
+        return NULL;
+    m_val = yyjson_mut_val_mut_copy(m_doc, doc->root);
+    if (!m_val) {
+        yyjson_mut_doc_free(m_doc);
+        return NULL;
+    }
+    yyjson_mut_doc_set_root(m_doc, m_val);
+    return m_doc;
+}
+
+yyjson_mut_val* yyjson_val_mut_copy(yyjson_mut_doc* m_doc, yyjson_val* i_vals) {
+    /*
+     The immutable object or array stores all sub-values in a contiguous memory,
+     We copy them to another contiguous memory as mutable values,
+     then reconnect the mutable values with the original relationship.
+     */
+    usize i_vals_len;
+    yyjson_mut_val *m_vals, *m_val;
+    yyjson_val *i_val, *i_end;
+
+    if (!m_doc || !i_vals)
+        return NULL;
+    i_end = unsafe_yyjson_get_next(i_vals);
+    i_vals_len = (usize)(unsafe_yyjson_get_next(i_vals) - i_vals);
+    m_vals = unsafe_yyjson_mut_val(m_doc, i_vals_len);
+    if (!m_vals)
+        return NULL;
+    i_val = i_vals;
+    m_val = m_vals;
+
+    for (; i_val < i_end; i_val++, m_val++) {
+        yyjson_type type = unsafe_yyjson_get_type(i_val);
+        m_val->tag = i_val->tag;
+        m_val->uni.u64 = i_val->uni.u64;
+        if (type == YYJSON_TYPE_STR || type == YYJSON_TYPE_RAW) {
+            const char* str = i_val->uni.str;
+            usize str_len = unsafe_yyjson_get_len(i_val);
+            m_val->uni.str = unsafe_yyjson_mut_strncpy(m_doc, str, str_len);
+            if (!m_val->uni.str)
+                return NULL;
+        } else if (type == YYJSON_TYPE_ARR) {
+            usize len = unsafe_yyjson_get_len(i_val);
+            if (len > 0) {
+                yyjson_val *ii_val = i_val + 1, *ii_next;
+                yyjson_mut_val *mm_val = m_val + 1, *mm_ctn = m_val, *mm_next;
+                while (len-- > 1) {
+                    ii_next = unsafe_yyjson_get_next(ii_val);
+                    mm_next = mm_val + (ii_next - ii_val);
+                    mm_val->next = mm_next;
+                    ii_val = ii_next;
+                    mm_val = mm_next;
+                }
+                mm_val->next = mm_ctn + 1;
+                mm_ctn->uni.ptr = mm_val;
+            }
+        } else if (type == YYJSON_TYPE_OBJ) {
+            usize len = unsafe_yyjson_get_len(i_val);
+            if (len > 0) {
+                yyjson_val *ii_key = i_val + 1, *ii_nextkey;
+                yyjson_mut_val *mm_key = m_val + 1, *mm_ctn = m_val;
+                yyjson_mut_val* mm_nextkey;
+                while (len-- > 1) {
+                    ii_nextkey = unsafe_yyjson_get_next(ii_key + 1);
+                    mm_nextkey = mm_key + (ii_nextkey - ii_key);
+                    mm_key->next = mm_key + 1;
+                    mm_key->next->next = mm_nextkey;
+                    ii_key = ii_nextkey;
+                    mm_key = mm_nextkey;
+                }
+                mm_key->next = mm_key + 1;
+                mm_key->next->next = mm_ctn + 1;
+                mm_ctn->uni.ptr = mm_key;
+            }
+        }
+    }
+
+    return m_vals;
+}
+
+static yyjson_mut_val* unsafe_yyjson_mut_val_mut_copy(yyjson_mut_doc* m_doc,
+    yyjson_mut_val* m_vals) {
+    /*
+     The mutable object or array stores all sub-values in a circular linked
+     list, so we can traverse them in the same loop. The traversal starts from
+     the last item, continues with the first item in a list, and ends with the
+     second to last item, which needs to be linked to the last item to close the
+     circle.
+     */
+    yyjson_mut_val* m_val = unsafe_yyjson_mut_val(m_doc, 1);
+    if (unlikely(!m_val))
+        return NULL;
+    m_val->tag = m_vals->tag;
+
+    switch (unsafe_yyjson_get_type(m_vals)) {
+    case YYJSON_TYPE_OBJ:
+    case YYJSON_TYPE_ARR:
+        if (unsafe_yyjson_get_len(m_vals) > 0) {
+            yyjson_mut_val* last = (yyjson_mut_val*)m_vals->uni.ptr;
+            yyjson_mut_val *next = last->next, *prev;
+            prev = unsafe_yyjson_mut_val_mut_copy(m_doc, last);
+            if (!prev)
+                return NULL;
+            m_val->uni.ptr = (void*)prev;
+            while (next != last) {
+                prev->next = unsafe_yyjson_mut_val_mut_copy(m_doc, next);
+                if (!prev->next)
+                    return NULL;
+                prev = prev->next;
+                next = next->next;
+            }
+            prev->next = (yyjson_mut_val*)m_val->uni.ptr;
+        }
+        break;
+
+    case YYJSON_TYPE_RAW:
+    case YYJSON_TYPE_STR: {
+        const char* str = m_vals->uni.str;
+        usize str_len = unsafe_yyjson_get_len(m_vals);
+        m_val->uni.str = unsafe_yyjson_mut_strncpy(m_doc, str, str_len);
+        if (!m_val->uni.str)
+            return NULL;
+        break;
+    }
+
+    default:
+        m_val->uni = m_vals->uni;
+        break;
+    }
+
+    return m_val;
+}
+
+yyjson_mut_val* yyjson_mut_val_mut_copy(yyjson_mut_doc* doc, yyjson_mut_val* val) {
+    if (doc && val)
+        return unsafe_yyjson_mut_val_mut_copy(doc, val);
+    return NULL;
+}
+
+/* Count the number of values and the total length of the strings. */
+static void yyjson_mut_stat(yyjson_mut_val* val, usize* val_sum, usize* str_sum) {
+    yyjson_type type = unsafe_yyjson_get_type(val);
+    *val_sum += 1;
+    if (type == YYJSON_TYPE_ARR || type == YYJSON_TYPE_OBJ) {
+        yyjson_mut_val* child = (yyjson_mut_val*)val->uni.ptr;
+        usize len = unsafe_yyjson_get_len(val), i;
+        len <<= (u8)(type == YYJSON_TYPE_OBJ);
+        *val_sum += len;
+        for (i = 0; i < len; i++) {
+            yyjson_type stype = unsafe_yyjson_get_type(child);
+            if (stype == YYJSON_TYPE_STR || stype == YYJSON_TYPE_RAW) {
+                *str_sum += unsafe_yyjson_get_len(child) + 1;
+            } else if (stype == YYJSON_TYPE_ARR || stype == YYJSON_TYPE_OBJ) {
+                yyjson_mut_stat(child, val_sum, str_sum);
+                *val_sum -= 1;
+            }
+            child = child->next;
+        }
+    } else if (type == YYJSON_TYPE_STR || type == YYJSON_TYPE_RAW) {
+        *str_sum += unsafe_yyjson_get_len(val) + 1;
+    }
+}
+
+/* Copy mutable values to immutable value pool. */
+static usize yyjson_imut_copy(yyjson_val** val_ptr, char** buf_ptr, yyjson_mut_val* mval) {
+    yyjson_val* val = *val_ptr;
+    yyjson_type type = unsafe_yyjson_get_type(mval);
+    if (type == YYJSON_TYPE_ARR || type == YYJSON_TYPE_OBJ) {
+        yyjson_mut_val* child = (yyjson_mut_val*)mval->uni.ptr;
+        usize len = unsafe_yyjson_get_len(mval), i;
+        usize val_sum = 1;
+        if (type == YYJSON_TYPE_OBJ) {
+            if (len)
+                child = child->next->next;
+            len <<= 1;
+        } else {
+            if (len)
+                child = child->next;
+        }
+        *val_ptr = val + 1;
+        for (i = 0; i < len; i++) {
+            val_sum += yyjson_imut_copy(val_ptr, buf_ptr, child);
+            child = child->next;
+        }
+        val->tag = mval->tag;
+        val->uni.ofs = val_sum * sizeof(yyjson_val);
+        return val_sum;
+    } else if (type == YYJSON_TYPE_STR || type == YYJSON_TYPE_RAW) {
+        char* buf = *buf_ptr;
+        usize len = unsafe_yyjson_get_len(mval);
+        memcpy((void*)buf, (const void*)mval->uni.str, len);
+        buf[len] = '\0';
+        val->tag = mval->tag;
+        val->uni.str = buf;
+        *val_ptr = val + 1;
+        *buf_ptr = buf + len + 1;
+        return 1;
+    } else {
+        val->tag = mval->tag;
+        val->uni = mval->uni;
+        *val_ptr = val + 1;
+        return 1;
+    }
+}
+
+yyjson_doc* yyjson_mut_doc_imut_copy(yyjson_mut_doc* mdoc, const yyjson_alc* alc) {
+    if (!mdoc)
+        return NULL;
+    return yyjson_mut_val_imut_copy(mdoc->root, alc);
+}
+
+yyjson_doc* yyjson_mut_val_imut_copy(yyjson_mut_val* mval, const yyjson_alc* alc) {
+    usize val_num = 0, str_sum = 0, hdr_size, buf_size;
+    yyjson_doc* doc = NULL;
+    yyjson_val* val_hdr = NULL;
+
+    /* This value should be NULL here. Setting a non-null value suppresses
+       warning from the clang analyzer. */
+    char* str_hdr = (char*)(void*)&str_sum;
+    if (!mval)
+        return NULL;
+    if (!alc)
+        alc = &YYJSON_DEFAULT_ALC;
+
+    /* traverse the input value to get pool size */
+    yyjson_mut_stat(mval, &val_num, &str_sum);
+
+    /* create doc and val pool */
+    hdr_size = size_align_up(sizeof(yyjson_doc), sizeof(yyjson_val));
+    buf_size = hdr_size + val_num * sizeof(yyjson_val);
+    doc = (yyjson_doc*)alc->malloc(alc->ctx, buf_size);
+    if (!doc)
+        return NULL;
+    memset(doc, 0, sizeof(yyjson_doc));
+    val_hdr = (yyjson_val*)(void*)((char*)(void*)doc + hdr_size);
+    doc->root = val_hdr;
+    doc->alc = *alc;
+
+    /* create str pool */
+    if (str_sum > 0) {
+        str_hdr = (char*)alc->malloc(alc->ctx, str_sum);
+        doc->str_pool = str_hdr;
+        if (!str_hdr) {
+            alc->free(alc->ctx, (void*)doc);
+            return NULL;
+        }
+    }
+
+    /* copy vals and strs */
+    doc->val_read = yyjson_imut_copy(&val_hdr, &str_hdr, mval);
+    doc->dat_read = str_sum + 1;
+    return doc;
+}
+
+static_inline bool unsafe_yyjson_num_equals(void* lhs, void* rhs) {
+    yyjson_val_uni* luni = &((yyjson_val*)lhs)->uni;
+    yyjson_val_uni* runi = &((yyjson_val*)rhs)->uni;
+    yyjson_subtype lt = unsafe_yyjson_get_subtype(lhs);
+    yyjson_subtype rt = unsafe_yyjson_get_subtype(rhs);
+    if (lt == rt)
+        return luni->u64 == runi->u64;
+    if (lt == YYJSON_SUBTYPE_SINT && rt == YYJSON_SUBTYPE_UINT) {
+        return luni->i64 >= 0 && luni->u64 == runi->u64;
+    }
+    if (lt == YYJSON_SUBTYPE_UINT && rt == YYJSON_SUBTYPE_SINT) {
+        return runi->i64 >= 0 && luni->u64 == runi->u64;
+    }
+    return false;
+}
+
+static_inline bool unsafe_yyjson_str_equals(void* lhs, void* rhs) {
+    usize len = unsafe_yyjson_get_len(lhs);
+    if (len != unsafe_yyjson_get_len(rhs))
+        return false;
+    return !memcmp(unsafe_yyjson_get_str(lhs), unsafe_yyjson_get_str(rhs), len);
+}
+
+bool unsafe_yyjson_equals(yyjson_val* lhs, yyjson_val* rhs) {
+    yyjson_type type = unsafe_yyjson_get_type(lhs);
+    if (type != unsafe_yyjson_get_type(rhs))
+        return false;
+
+    switch (type) {
+    case YYJSON_TYPE_OBJ: {
+        usize len = unsafe_yyjson_get_len(lhs);
+        if (len != unsafe_yyjson_get_len(rhs))
+            return false;
+        if (len > 0) {
+            yyjson_obj_iter iter;
+            yyjson_obj_iter_init(rhs, &iter);
+            lhs = unsafe_yyjson_get_first(lhs);
+            while (len-- > 0) {
+                rhs = yyjson_obj_iter_getn(&iter, lhs->uni.str, unsafe_yyjson_get_len(lhs));
+                if (!rhs)
+                    return false;
+                if (!unsafe_yyjson_equals(lhs + 1, rhs))
+                    return false;
+                lhs = unsafe_yyjson_get_next(lhs + 1);
+            }
+        }
+        /* yyjson allows duplicate keys, so the check may be inaccurate */
+        return true;
+    }
+
+    case YYJSON_TYPE_ARR: {
+        usize len = unsafe_yyjson_get_len(lhs);
+        if (len != unsafe_yyjson_get_len(rhs))
+            return false;
+        if (len > 0) {
+            lhs = unsafe_yyjson_get_first(lhs);
+            rhs = unsafe_yyjson_get_first(rhs);
+            while (len-- > 0) {
+                if (!unsafe_yyjson_equals(lhs, rhs))
+                    return false;
+                lhs = unsafe_yyjson_get_next(lhs);
+                rhs = unsafe_yyjson_get_next(rhs);
+            }
+        }
+        return true;
+    }
+
+    case YYJSON_TYPE_NUM:
+        return unsafe_yyjson_num_equals(lhs, rhs);
+
+    case YYJSON_TYPE_RAW:
+    case YYJSON_TYPE_STR:
+        return unsafe_yyjson_str_equals(lhs, rhs);
+
+    case YYJSON_TYPE_NULL:
+    case YYJSON_TYPE_BOOL:
+        return lhs->tag == rhs->tag;
+
+    default:
+        return false;
+    }
+}
+
+bool unsafe_yyjson_mut_equals(yyjson_mut_val* lhs, yyjson_mut_val* rhs) {
+    yyjson_type type = unsafe_yyjson_get_type(lhs);
+    if (type != unsafe_yyjson_get_type(rhs))
+        return false;
+
+    switch (type) {
+    case YYJSON_TYPE_OBJ: {
+        usize len = unsafe_yyjson_get_len(lhs);
+        if (len != unsafe_yyjson_get_len(rhs))
+            return false;
+        if (len > 0) {
+            yyjson_mut_obj_iter iter;
+            yyjson_mut_obj_iter_init(rhs, &iter);
+            lhs = (yyjson_mut_val*)lhs->uni.ptr;
+            while (len-- > 0) {
+                rhs = yyjson_mut_obj_iter_getn(&iter, lhs->uni.str, unsafe_yyjson_get_len(lhs));
+                if (!rhs)
+                    return false;
+                if (!unsafe_yyjson_mut_equals(lhs->next, rhs))
+                    return false;
+                lhs = lhs->next->next;
+            }
+        }
+        /* yyjson allows duplicate keys, so the check may be inaccurate */
+        return true;
+    }
+
+    case YYJSON_TYPE_ARR: {
+        usize len = unsafe_yyjson_get_len(lhs);
+        if (len != unsafe_yyjson_get_len(rhs))
+            return false;
+        if (len > 0) {
+            lhs = (yyjson_mut_val*)lhs->uni.ptr;
+            rhs = (yyjson_mut_val*)rhs->uni.ptr;
+            while (len-- > 0) {
+                if (!unsafe_yyjson_mut_equals(lhs, rhs))
+                    return false;
+                lhs = lhs->next;
+                rhs = rhs->next;
+            }
+        }
+        return true;
+    }
+
+    case YYJSON_TYPE_NUM:
+        return unsafe_yyjson_num_equals(lhs, rhs);
+
+    case YYJSON_TYPE_RAW:
+    case YYJSON_TYPE_STR:
+        return unsafe_yyjson_str_equals(lhs, rhs);
+
+    case YYJSON_TYPE_NULL:
+    case YYJSON_TYPE_BOOL:
+        return lhs->tag == rhs->tag;
+
+    default:
+        return false;
+    }
+}
+
+bool yyjson_locate_pos(const char* str, size_t len, size_t pos, size_t* line, size_t* col,
+    size_t* chr) {
+    usize line_sum = 0, line_pos = 0, chr_sum = 0;
+    const u8* cur = (const u8*)str;
+    const u8* end = cur + pos;
+
+    if (!str || pos > len) {
+        if (line)
+            *line = 0;
+        if (col)
+            *col = 0;
+        if (chr)
+            *chr = 0;
+        return false;
+    }
+
+    while (cur < end) {
+        u8 c = *cur;
+        chr_sum += 1;
+        if (likely(c < 0x80)) { /* 0xxxxxxx (0x00-0x7F) ASCII */
+            if (c == '\n') {
+                line_sum += 1;
+                line_pos = chr_sum;
+            }
+            cur += 1;
+        } else if (c < 0xC0)
+            cur += 1; /* 10xxxxxx (0x80-0xBF) Invalid */
+        else if (c < 0xE0)
+            cur += 2; /* 110xxxxx (0xC0-0xDF) 2-byte UTF-8 */
+        else if (c < 0xF0)
+            cur += 3; /* 1110xxxx (0xE0-0xEF) 3-byte UTF-8 */
+        else if (c < 0xF8)
+            cur += 4; /* 11110xxx (0xF0-0xF7) 4-byte UTF-8 */
+        else
+            cur += 1; /* 11111xxx (0xF8-0xFF) Invalid */
+    }
+
+    if (line)
+        *line = line_sum + 1;
+    if (col)
+        *col = chr_sum - line_pos + 1;
+    if (chr)
+        *chr = chr_sum;
+    return true;
+}
+
+#if !YYJSON_DISABLE_UTILS
+
+/*==============================================================================
+ * JSON Pointer API (RFC 6901)
+ *============================================================================*/
+
+/**
+ Get a token from JSON pointer string.
+ @param ptr [in,out]
+                in:  string that points to current token prefix `/`
+                out: string that points to next token prefix `/`, or string end
+ @param end [in] end of the entire JSON Pointer string
+ @param len [out] unescaped token length
+ @param esc [out] number of escaped characters in this token
+ @return head of the token, or NULL if syntax error
+ */
+static_inline const char* ptr_next_token(const char** ptr, const char* end, usize* len,
+    usize* esc) {
+    const char* hdr = *ptr + 1;
+    const char* cur = hdr;
+    /* skip unescaped characters */
+    while (cur < end && *cur != '/' && *cur != '~')
+        cur++;
+    if (likely(cur == end || *cur != '~')) {
+        /* no escaped characters, return */
+        *ptr = cur;
+        *len = (usize)(cur - hdr);
+        *esc = 0;
+        return hdr;
+    } else {
+        /* handle escaped characters */
+        usize esc_num = 0;
+        while (cur < end && *cur != '/') {
+            if (*cur++ == '~') {
+                if (cur == end || (*cur != '0' && *cur != '1')) {
+                    *ptr = cur - 1;
+                    return NULL;
+                }
+                esc_num++;
+            }
+        }
+        *ptr = cur;
+        *len = (usize)(cur - hdr) - esc_num;
+        *esc = esc_num;
+        return hdr;
+    }
+}
+
+/**
+ Convert token string to index.
+ @param cur [in]  token head
+ @param len [in]  token length
+ @param idx [out] the index number, or USIZE_MAX if token is '-'
+ @return true if token is a valid array index
+ */
+static_inline bool ptr_token_to_idx(const char* cur, usize len, usize* idx) {
+    const char* end = cur + len;
+    usize num = 0, add;
+    if (unlikely(len == 0 || len > USIZE_SAFE_DIG))
+        return false;
+    if (*cur == '0') {
+        if (unlikely(len > 1))
+            return false;
+        *idx = 0;
+        return true;
+    }
+    if (*cur == '-') {
+        if (unlikely(len > 1))
+            return false;
+        *idx = USIZE_MAX;
+        return true;
+    }
+    for (; cur < end && (add = (usize)((u8)*cur - (u8)'0')) <= 9; cur++) {
+        num = num * 10 + add;
+    }
+    if (unlikely(num == 0 || cur < end))
+        return false;
+    *idx = num;
+    return true;
+}
+
+/**
+ Compare JSON key with token.
+ @param key a string key (yyjson_val or yyjson_mut_val)
+ @param token a JSON pointer token
+ @param len unescaped token length
+ @param esc number of escaped characters in this token
+ @return true if `str` is equals to `token`
+ */
+static_inline bool ptr_token_eq(void* key, const char* token, usize len, usize esc) {
+    yyjson_val* val = (yyjson_val*)key;
+    if (unsafe_yyjson_get_len(val) != len)
+        return false;
+    if (likely(!esc)) {
+        return memcmp(val->uni.str, token, len) == 0;
+    } else {
+        const char* str = val->uni.str;
+        for (; len-- > 0; token++, str++) {
+            if (*token == '~') {
+                if (*str != (*++token == '0' ? '~' : '/'))
+                    return false;
+            } else {
+                if (*str != *token)
+                    return false;
+            }
+        }
+        return true;
+    }
+}
+
+/**
+ Get a value from array by token.
+ @param arr   an array, should not be NULL or non-array type
+ @param token a JSON pointer token
+ @param len   unescaped token length
+ @param esc   number of escaped characters in this token
+ @return value at index, or NULL if token is not index or index is out of range
+ */
+static_inline yyjson_val* ptr_arr_get(yyjson_val* arr, const char* token, usize len, usize esc) {
+    yyjson_val* val = unsafe_yyjson_get_first(arr);
+    usize num = unsafe_yyjson_get_len(arr), idx = 0;
+    if (unlikely(num == 0))
+        return NULL;
+    if (unlikely(!ptr_token_to_idx(token, len, &idx)))
+        return NULL;
+    if (unlikely(idx >= num))
+        return NULL;
+    if (unsafe_yyjson_arr_is_flat(arr)) {
+        return val + idx;
+    } else {
+        while (idx-- > 0)
+            val = unsafe_yyjson_get_next(val);
+        return val;
+    }
+}
+
+/**
+ Get a value from object by token.
+ @param obj   [in] an object, should not be NULL or non-object type
+ @param token [in] a JSON pointer token
+ @param len   [in] unescaped token length
+ @param esc   [in] number of escaped characters in this token
+ @return value associated with the token, or NULL if no value
+ */
+static_inline yyjson_val* ptr_obj_get(yyjson_val* obj, const char* token, usize len, usize esc) {
+    yyjson_val* key = unsafe_yyjson_get_first(obj);
+    usize num = unsafe_yyjson_get_len(obj);
+    if (unlikely(num == 0))
+        return NULL;
+    for (; num > 0; num--, key = unsafe_yyjson_get_next(key + 1)) {
+        if (ptr_token_eq(key, token, len, esc))
+            return key + 1;
+    }
+    return NULL;
+}
+
+/**
+ Get a value from array by token.
+ @param arr   [in] an array, should not be NULL or non-array type
+ @param token [in] a JSON pointer token
+ @param len   [in] unescaped token length
+ @param esc   [in] number of escaped characters in this token
+ @param pre   [out] previous (sibling) value of the returned value
+ @param last  [out] whether index is last
+ @return value at index, or NULL if token is not index or index is out of range
+ */
+static_inline yyjson_mut_val* ptr_mut_arr_get(yyjson_mut_val* arr, const char* token, usize len,
+    usize esc, yyjson_mut_val** pre, bool* last) {
+    yyjson_mut_val* val = (yyjson_mut_val*)arr->uni.ptr; /* last (tail) */
+    usize num = unsafe_yyjson_get_len(arr), idx;
+    if (last)
+        *last = false;
+    if (pre)
+        *pre = NULL;
+    if (unlikely(num == 0)) {
+        if (last && len == 1 && (*token == '0' || *token == '-'))
+            *last = true;
+        return NULL;
+    }
+    if (unlikely(!ptr_token_to_idx(token, len, &idx)))
+        return NULL;
+    if (last)
+        *last = (idx == num || idx == USIZE_MAX);
+    if (unlikely(idx >= num))
+        return NULL;
+    while (idx-- > 0)
+        val = val->next;
+    *pre = val;
+    return val->next;
+}
+
+/**
+ Get a value from object by token.
+ @param obj   [in] an object, should not be NULL or non-object type
+ @param token [in] a JSON pointer token
+ @param len   [in] unescaped token length
+ @param esc   [in] number of escaped characters in this token
+ @param pre   [out] previous (sibling) key of the returned value's key
+ @return value associated with the token, or NULL if no value
+ */
+static_inline yyjson_mut_val* ptr_mut_obj_get(yyjson_mut_val* obj, const char* token, usize len,
+    usize esc, yyjson_mut_val** pre) {
+    yyjson_mut_val *pre_key = (yyjson_mut_val*)obj->uni.ptr, *key;
+    usize num = unsafe_yyjson_get_len(obj);
+    if (pre)
+        *pre = NULL;
+    if (unlikely(num == 0))
+        return NULL;
+    for (; num > 0; num--, pre_key = key) {
+        key = pre_key->next->next;
+        if (ptr_token_eq(key, token, len, esc)) {
+            *pre = pre_key;
+            return key->next;
+        }
+    }
+    return NULL;
+}
+
+/**
+ Create a string value with JSON pointer token.
+ @param token [in] a JSON pointer token
+ @param len   [in] unescaped token length
+ @param esc   [in] number of escaped characters in this token
+ @param doc   [in] used for memory allocation when creating value
+ @return new string value, or NULL if memory allocation failed
+ */
+static_inline yyjson_mut_val* ptr_new_key(const char* token, usize len, usize esc,
+    yyjson_mut_doc* doc) {
+    const char* src = token;
+    if (likely(!esc)) {
+        return yyjson_mut_strncpy(doc, src, len);
+    } else {
+        const char* end = src + len + esc;
+        char* dst = unsafe_yyjson_mut_str_alc(doc, len + esc);
+        char* str = dst;
+        if (unlikely(!dst))
+            return NULL;
+        for (; src < end; src++, dst++) {
+            if (*src != '~')
+                *dst = *src;
+            else
+                *dst = (*++src == '0' ? '~' : '/');
+        }
+        *dst = '\0';
+        return yyjson_mut_strn(doc, str, len);
+    }
+}
+
+/* macros for yyjson_ptr */
+#define return_err(_ret, _code, _pos, _msg)                                                        \
+    do {                                                                                           \
+        if (err) {                                                                                 \
+            err->code = YYJSON_PTR_ERR_##_code;                                                    \
+            err->msg = _msg;                                                                       \
+            err->pos = (usize)(_pos);                                                              \
+        }                                                                                          \
+        return _ret;                                                                               \
+    } while (false)
+
+#define return_err_resolve(_ret, _pos)                                                             \
+    return_err(_ret, RESOLVE, _pos, "JSON pointer cannot be resolved")
+#define return_err_syntax(_ret, _pos) return_err(_ret, SYNTAX, _pos, "invalid escaped character")
+#define return_err_alloc(_ret) return_err(_ret, MEMORY_ALLOCATION, 0, "failed to create value")
+
+yyjson_val* unsafe_yyjson_ptr_getx(yyjson_val* val, const char* ptr, size_t ptr_len,
+    yyjson_ptr_err* err) {
+
+    const char *hdr = ptr, *end = ptr + ptr_len, *token;
+    usize len, esc;
+    yyjson_type type;
+
+    while (true) {
+        token = ptr_next_token(&ptr, end, &len, &esc);
+        if (unlikely(!token))
+            return_err_syntax(NULL, ptr - hdr);
+        type = unsafe_yyjson_get_type(val);
+        if (type == YYJSON_TYPE_OBJ) {
+            val = ptr_obj_get(val, token, len, esc);
+        } else if (type == YYJSON_TYPE_ARR) {
+            val = ptr_arr_get(val, token, len, esc);
+        } else {
+            val = NULL;
+        }
+        if (!val)
+            return_err_resolve(NULL, token - hdr);
+        if (ptr == end)
+            return val;
+    }
+}
+
+yyjson_mut_val* unsafe_yyjson_mut_ptr_getx(yyjson_mut_val* val, const char* ptr, size_t ptr_len,
+    yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+
+    const char *hdr = ptr, *end = ptr + ptr_len, *token;
+    usize len, esc;
+    yyjson_mut_val *ctn, *pre = NULL;
+    yyjson_type type;
+    bool idx_is_last = false;
+
+    while (true) {
+        token = ptr_next_token(&ptr, end, &len, &esc);
+        if (unlikely(!token))
+            return_err_syntax(NULL, ptr - hdr);
+        ctn = val;
+        type = unsafe_yyjson_get_type(val);
+        if (type == YYJSON_TYPE_OBJ) {
+            val = ptr_mut_obj_get(val, token, len, esc, &pre);
+        } else if (type == YYJSON_TYPE_ARR) {
+            val = ptr_mut_arr_get(val, token, len, esc, &pre, &idx_is_last);
+        } else {
+            val = NULL;
+        }
+        if (ctx && (ptr == end)) {
+            if (type == YYJSON_TYPE_OBJ || (type == YYJSON_TYPE_ARR && (val || idx_is_last))) {
+                ctx->ctn = ctn;
+                ctx->pre = pre;
+            }
+        }
+        if (!val)
+            return_err_resolve(NULL, token - hdr);
+        if (ptr == end)
+            return val;
+    }
+}
+
+bool unsafe_yyjson_mut_ptr_putx(yyjson_mut_val* val, const char* ptr, size_t ptr_len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc, bool create_parent, bool insert_new,
+    yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+
+    const char *hdr = ptr, *end = ptr + ptr_len, *token;
+    usize token_len, esc, ctn_len;
+    yyjson_mut_val *ctn, *key, *pre = NULL;
+    yyjson_mut_val *sep_ctn = NULL, *sep_key = NULL, *sep_val = NULL;
+    yyjson_type ctn_type;
+    bool idx_is_last = false;
+
+    /* skip exist parent nodes */
+    while (true) {
+        token = ptr_next_token(&ptr, end, &token_len, &esc);
+        if (unlikely(!token))
+            return_err_syntax(false, ptr - hdr);
+        ctn = val;
+        ctn_type = unsafe_yyjson_get_type(ctn);
+        if (ctn_type == YYJSON_TYPE_OBJ) {
+            val = ptr_mut_obj_get(ctn, token, token_len, esc, &pre);
+        } else if (ctn_type == YYJSON_TYPE_ARR) {
+            val = ptr_mut_arr_get(ctn, token, token_len, esc, &pre, &idx_is_last);
+        } else
+            return_err_resolve(false, token - hdr);
+        if (!val)
+            break;
+        if (ptr == end)
+            break; /* is last token */
+    }
+
+    /* create parent nodes if not exist */
+    if (unlikely(ptr != end)) { /* not last token */
+        if (!create_parent)
+            return_err_resolve(false, token - hdr);
+
+        /* add value at last index if container is array */
+        if (ctn_type == YYJSON_TYPE_ARR) {
+            if (!idx_is_last || !insert_new) {
+                return_err_resolve(false, token - hdr);
+            }
+            val = yyjson_mut_obj(doc);
+            if (!val)
+                return_err_alloc(false);
+
+            /* delay attaching until all operations are completed */
+            sep_ctn = ctn;
+            sep_key = NULL;
+            sep_val = val;
+
+            /* move to next token */
+            ctn = val;
+            val = NULL;
+            ctn_type = YYJSON_TYPE_OBJ;
+            token = ptr_next_token(&ptr, end, &token_len, &esc);
+            if (unlikely(!token))
+                return_err_resolve(false, token - hdr);
+        }
+
+        /* container is object, create parent nodes */
+        while (ptr != end) { /* not last token */
+            key = ptr_new_key(token, token_len, esc, doc);
+            if (!key)
+                return_err_alloc(false);
+            val = yyjson_mut_obj(doc);
+            if (!val)
+                return_err_alloc(false);
+
+            /* delay attaching until all operations are completed */
+            if (!sep_ctn) {
+                sep_ctn = ctn;
+                sep_key = key;
+                sep_val = val;
+            } else {
+                yyjson_mut_obj_add(ctn, key, val);
+            }
+
+            /* move to next token */
+            ctn = val;
+            val = NULL;
+            token = ptr_next_token(&ptr, end, &token_len, &esc);
+            if (unlikely(!token))
+                return_err_syntax(false, ptr - hdr);
+        }
+    }
+
+    /* JSON pointer is resolved, insert or replace target value */
+    ctn_len = unsafe_yyjson_get_len(ctn);
+    if (ctn_type == YYJSON_TYPE_OBJ) {
+        if (ctx)
+            ctx->ctn = ctn;
+        if (!val || insert_new) {
+            /* insert new key-value pair */
+            key = ptr_new_key(token, token_len, esc, doc);
+            if (unlikely(!key))
+                return_err_alloc(false);
+            if (ctx)
+                ctx->pre = ctn_len ? (yyjson_mut_val*)ctn->uni.ptr : key;
+            unsafe_yyjson_mut_obj_add(ctn, key, new_val, ctn_len);
+        } else {
+            /* replace exist value */
+            key = pre->next->next;
+            if (ctx)
+                ctx->pre = pre;
+            if (ctx)
+                ctx->old = val;
+            yyjson_mut_obj_put(ctn, key, new_val);
+        }
+    } else {
+        /* array */
+        if (ctx && (val || idx_is_last))
+            ctx->ctn = ctn;
+        if (insert_new) {
+            /* append new value */
+            if (val) {
+                pre->next = new_val;
+                new_val->next = val;
+                if (ctx)
+                    ctx->pre = pre;
+                unsafe_yyjson_set_len(ctn, ctn_len + 1);
+            } else if (idx_is_last) {
+                if (ctx)
+                    ctx->pre = ctn_len ? (yyjson_mut_val*)ctn->uni.ptr : new_val;
+                yyjson_mut_arr_append(ctn, new_val);
+            } else {
+                return_err_resolve(false, token - hdr);
+            }
+        } else {
+            /* replace exist value */
+            if (!val)
+                return_err_resolve(false, token - hdr);
+            if (ctn_len > 1) {
+                new_val->next = val->next;
+                pre->next = new_val;
+                if (ctn->uni.ptr == val)
+                    ctn->uni.ptr = new_val;
+            } else {
+                new_val->next = new_val;
+                ctn->uni.ptr = new_val;
+                pre = new_val;
+            }
+            if (ctx)
+                ctx->pre = pre;
+            if (ctx)
+                ctx->old = val;
+        }
+    }
+
+    /* all operations are completed, attach the new components to the target */
+    if (unlikely(sep_ctn)) {
+        if (sep_key)
+            yyjson_mut_obj_add(sep_ctn, sep_key, sep_val);
+        else
+            yyjson_mut_arr_append(sep_ctn, sep_val);
+    }
+    return true;
+}
+
+yyjson_mut_val* unsafe_yyjson_mut_ptr_replacex(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+
+    yyjson_mut_val* cur_val;
+    yyjson_ptr_ctx cur_ctx;
+    memset(&cur_ctx, 0, sizeof(cur_ctx));
+    if (!ctx)
+        ctx = &cur_ctx;
+    cur_val = unsafe_yyjson_mut_ptr_getx(val, ptr, len, ctx, err);
+    if (!cur_val)
+        return NULL;
+
+    if (yyjson_mut_is_obj(ctx->ctn)) {
+        yyjson_mut_val* key = ctx->pre->next->next;
+        yyjson_mut_obj_put(ctx->ctn, key, new_val);
+    } else {
+        yyjson_ptr_ctx_replace(ctx, new_val);
+    }
+    ctx->old = cur_val;
+    return cur_val;
+}
+
+yyjson_mut_val* unsafe_yyjson_mut_ptr_removex(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+    yyjson_mut_val* cur_val;
+    yyjson_ptr_ctx cur_ctx;
+    memset(&cur_ctx, 0, sizeof(cur_ctx));
+    if (!ctx)
+        ctx = &cur_ctx;
+    cur_val = unsafe_yyjson_mut_ptr_getx(val, ptr, len, ctx, err);
+    if (cur_val) {
+        if (yyjson_mut_is_obj(ctx->ctn)) {
+            yyjson_mut_val* key = ctx->pre->next->next;
+            yyjson_mut_obj_put(ctx->ctn, key, NULL);
+        } else {
+            yyjson_ptr_ctx_remove(ctx);
+        }
+        ctx->pre = NULL;
+        ctx->old = cur_val;
+    }
+    return cur_val;
+}
+
+/* macros for yyjson_ptr */
+#undef return_err
+#undef return_err_resolve
+#undef return_err_syntax
+#undef return_err_alloc
+
+/*==============================================================================
+ * JSON Patch API (RFC 6902)
+ *============================================================================*/
+
+/* JSON Patch operation */
+typedef enum patch_op {
+    PATCH_OP_ADD,     /* path, value */
+    PATCH_OP_REMOVE,  /* path */
+    PATCH_OP_REPLACE, /* path, value */
+    PATCH_OP_MOVE,    /* from, path */
+    PATCH_OP_COPY,    /* from, path */
+    PATCH_OP_TEST,    /* path, value */
+    PATCH_OP_NONE     /* invalid */
+} patch_op;
+
+static patch_op patch_op_get(yyjson_val* op) {
+    const char* str = op->uni.str;
+    switch (unsafe_yyjson_get_len(op)) {
+    case 3:
+        if (!memcmp(str, "add", 3))
+            return PATCH_OP_ADD;
+        return PATCH_OP_NONE;
+    case 4:
+        if (!memcmp(str, "move", 4))
+            return PATCH_OP_MOVE;
+        if (!memcmp(str, "copy", 4))
+            return PATCH_OP_COPY;
+        if (!memcmp(str, "test", 4))
+            return PATCH_OP_TEST;
+        return PATCH_OP_NONE;
+    case 6:
+        if (!memcmp(str, "remove", 6))
+            return PATCH_OP_REMOVE;
+        return PATCH_OP_NONE;
+    case 7:
+        if (!memcmp(str, "replace", 7))
+            return PATCH_OP_REPLACE;
+        return PATCH_OP_NONE;
+    default:
+        return PATCH_OP_NONE;
+    }
+}
+
+/* macros for yyjson_patch */
+#define return_err(_code, _msg)                                                                    \
+    do {                                                                                           \
+        if (err->ptr.code == YYJSON_PTR_ERR_MEMORY_ALLOCATION) {                                   \
+            err->code = YYJSON_PATCH_ERROR_MEMORY_ALLOCATION;                                      \
+            err->msg = _msg;                                                                       \
+            memset(&err->ptr, 0, sizeof(yyjson_ptr_err));                                          \
+        } else {                                                                                   \
+            err->code = YYJSON_PATCH_ERROR_##_code;                                                \
+            err->msg = _msg;                                                                       \
+            err->idx = iter.idx ? iter.idx - 1 : 0;                                                \
+        }                                                                                          \
+        return NULL;                                                                               \
+    } while (false)
+
+#define return_err_copy() return_err(MEMORY_ALLOCATION, "failed to copy value")
+#define return_err_key(_key) return_err(MISSING_KEY, "missing key " _key)
+#define return_err_val(_key) return_err(INVALID_MEMBER, "invalid member " _key)
+
+#define ptr_get(_ptr) yyjson_mut_ptr_getx(root, _ptr->uni.str, _ptr##_len, NULL, &err->ptr)
+#define ptr_add(_ptr, _val)                                                                        \
+    yyjson_mut_ptr_addx(root, _ptr->uni.str, _ptr##_len, _val, doc, false, NULL, &err->ptr)
+#define ptr_remove(_ptr) yyjson_mut_ptr_removex(root, _ptr->uni.str, _ptr##_len, NULL, &err->ptr)
+#define ptr_replace(_ptr, _val)                                                                    \
+    yyjson_mut_ptr_replacex(root, _ptr->uni.str, _ptr##_len, _val, NULL, &err->ptr)
+
+yyjson_mut_val* yyjson_patch(yyjson_mut_doc* doc, yyjson_val* orig, yyjson_val* patch,
+    yyjson_patch_err* err) {
+
+    yyjson_mut_val* root;
+    yyjson_val* obj;
+    yyjson_arr_iter iter;
+    yyjson_patch_err err_tmp;
+    if (!err)
+        err = &err_tmp;
+    memset(err, 0, sizeof(*err));
+    memset(&iter, 0, sizeof(iter));
+
+    if (unlikely(!doc || !orig || !patch)) {
+        return_err(INVALID_PARAMETER, "input parameter is NULL");
+    }
+    if (unlikely(!yyjson_is_arr(patch))) {
+        return_err(INVALID_PARAMETER, "input patch is not array");
+    }
+    root = yyjson_val_mut_copy(doc, orig);
+    if (unlikely(!root))
+        return_err_copy();
+
+    /* iterate through the patch array */
+    yyjson_arr_iter_init(patch, &iter);
+    while ((obj = yyjson_arr_iter_next(&iter))) {
+        patch_op op_enum;
+        yyjson_val *op, *path, *from = NULL, *value;
+        yyjson_mut_val *val = NULL, *test;
+        usize path_len, from_len = 0;
+        if (unlikely(!unsafe_yyjson_is_obj(obj))) {
+            return_err(INVALID_OPERATION, "JSON patch operation is not object");
+        }
+
+        /* get required member: op */
+        op = yyjson_obj_get(obj, "op");
+        if (unlikely(!op))
+            return_err_key("`op`");
+        if (unlikely(!yyjson_is_str(op)))
+            return_err_val("`op`");
+        op_enum = patch_op_get(op);
+
+        /* get required member: path */
+        path = yyjson_obj_get(obj, "path");
+        if (unlikely(!path))
+            return_err_key("`path`");
+        if (unlikely(!yyjson_is_str(path)))
+            return_err_val("`path`");
+        path_len = unsafe_yyjson_get_len(path);
+
+        /* get required member: value, from */
+        switch ((int)op_enum) {
+        case PATCH_OP_ADD:
+        case PATCH_OP_REPLACE:
+        case PATCH_OP_TEST:
+            value = yyjson_obj_get(obj, "value");
+            if (unlikely(!value))
+                return_err_key("`value`");
+            val = yyjson_val_mut_copy(doc, value);
+            if (unlikely(!val))
+                return_err_copy();
+            break;
+        case PATCH_OP_MOVE:
+        case PATCH_OP_COPY:
+            from = yyjson_obj_get(obj, "from");
+            if (unlikely(!from))
+                return_err_key("`from`");
+            if (unlikely(!yyjson_is_str(from)))
+                return_err_val("`from`");
+            from_len = unsafe_yyjson_get_len(from);
+            break;
+        default:
+            break;
+        }
+
+        /* perform an operation */
+        switch ((int)op_enum) {
+        case PATCH_OP_ADD: /* add(path, val) */
+            if (unlikely(path_len == 0)) {
+                root = val;
+                break;
+            }
+            if (unlikely(!ptr_add(path, val))) {
+                return_err(POINTER, "failed to add `path`");
+            }
+            break;
+        case PATCH_OP_REMOVE: /* remove(path) */
+            if (unlikely(!ptr_remove(path))) {
+                return_err(POINTER, "failed to remove `path`");
+            }
+            break;
+        case PATCH_OP_REPLACE: /* replace(path, val) */
+            if (unlikely(path_len == 0)) {
+                root = val;
+                break;
+            }
+            if (unlikely(!ptr_replace(path, val))) {
+                return_err(POINTER, "failed to replace `path`");
+            }
+            break;
+        case PATCH_OP_MOVE: /* val = remove(from), add(path, val) */
+            if (unlikely(from_len == 0 && path_len == 0))
+                break;
+            val = ptr_remove(from);
+            if (unlikely(!val)) {
+                return_err(POINTER, "failed to remove `from`");
+            }
+            if (unlikely(path_len == 0)) {
+                root = val;
+                break;
+            }
+            if (unlikely(!ptr_add(path, val))) {
+                return_err(POINTER, "failed to add `path`");
+            }
+            break;
+        case PATCH_OP_COPY: /* val = get(from).copy, add(path, val) */
+            val = ptr_get(from);
+            if (unlikely(!val)) {
+                return_err(POINTER, "failed to get `from`");
+            }
+            if (unlikely(path_len == 0)) {
+                root = val;
+                break;
+            }
+            val = yyjson_mut_val_mut_copy(doc, val);
+            if (unlikely(!val))
+                return_err_copy();
+            if (unlikely(!ptr_add(path, val))) {
+                return_err(POINTER, "failed to add `path`");
+            }
+            break;
+        case PATCH_OP_TEST: /* test = get(path), test.eq(val) */
+            test = ptr_get(path);
+            if (unlikely(!test)) {
+                return_err(POINTER, "failed to get `path`");
+            }
+            if (unlikely(!yyjson_mut_equals(val, test))) {
+                return_err(EQUAL, "failed to test equal");
+            }
+            break;
+        default:
+            return_err(INVALID_MEMBER, "unsupported `op`");
+        }
+    }
+    return root;
+}
+
+yyjson_mut_val* yyjson_mut_patch(yyjson_mut_doc* doc, yyjson_mut_val* orig, yyjson_mut_val* patch,
+    yyjson_patch_err* err) {
+    yyjson_mut_val *root, *obj;
+    yyjson_mut_arr_iter iter;
+    yyjson_patch_err err_tmp;
+    if (!err)
+        err = &err_tmp;
+    memset(err, 0, sizeof(*err));
+    memset(&iter, 0, sizeof(iter));
+
+    if (unlikely(!doc || !orig || !patch)) {
+        return_err(INVALID_PARAMETER, "input parameter is NULL");
+    }
+    if (unlikely(!yyjson_mut_is_arr(patch))) {
+        return_err(INVALID_PARAMETER, "input patch is not array");
+    }
+    root = yyjson_mut_val_mut_copy(doc, orig);
+    if (unlikely(!root))
+        return_err_copy();
+
+    /* iterate through the patch array */
+    yyjson_mut_arr_iter_init(patch, &iter);
+    while ((obj = yyjson_mut_arr_iter_next(&iter))) {
+        patch_op op_enum;
+        yyjson_mut_val *op, *path, *from = NULL, *value;
+        yyjson_mut_val *val = NULL, *test;
+        usize path_len, from_len = 0;
+        if (!unsafe_yyjson_is_obj(obj)) {
+            return_err(INVALID_OPERATION, "JSON patch operation is not object");
+        }
+
+        /* get required member: op */
+        op = yyjson_mut_obj_get(obj, "op");
+        if (unlikely(!op))
+            return_err_key("`op`");
+        if (unlikely(!yyjson_mut_is_str(op)))
+            return_err_val("`op`");
+        op_enum = patch_op_get((yyjson_val*)(void*)op);
+
+        /* get required member: path */
+        path = yyjson_mut_obj_get(obj, "path");
+        if (unlikely(!path))
+            return_err_key("`path`");
+        if (unlikely(!yyjson_mut_is_str(path)))
+            return_err_val("`path`");
+        path_len = unsafe_yyjson_get_len(path);
+
+        /* get required member: value, from */
+        switch ((int)op_enum) {
+        case PATCH_OP_ADD:
+        case PATCH_OP_REPLACE:
+        case PATCH_OP_TEST:
+            value = yyjson_mut_obj_get(obj, "value");
+            if (unlikely(!value))
+                return_err_key("`value`");
+            val = yyjson_mut_val_mut_copy(doc, value);
+            if (unlikely(!val))
+                return_err_copy();
+            break;
+        case PATCH_OP_MOVE:
+        case PATCH_OP_COPY:
+            from = yyjson_mut_obj_get(obj, "from");
+            if (unlikely(!from))
+                return_err_key("`from`");
+            if (unlikely(!yyjson_mut_is_str(from))) {
+                return_err_val("`from`");
+            }
+            from_len = unsafe_yyjson_get_len(from);
+            break;
+        default:
+            break;
+        }
+
+        /* perform an operation */
+        switch ((int)op_enum) {
+        case PATCH_OP_ADD: /* add(path, val) */
+            if (unlikely(path_len == 0)) {
+                root = val;
+                break;
+            }
+            if (unlikely(!ptr_add(path, val))) {
+                return_err(POINTER, "failed to add `path`");
+            }
+            break;
+        case PATCH_OP_REMOVE: /* remove(path) */
+            if (unlikely(!ptr_remove(path))) {
+                return_err(POINTER, "failed to remove `path`");
+            }
+            break;
+        case PATCH_OP_REPLACE: /* replace(path, val) */
+            if (unlikely(path_len == 0)) {
+                root = val;
+                break;
+            }
+            if (unlikely(!ptr_replace(path, val))) {
+                return_err(POINTER, "failed to replace `path`");
+            }
+            break;
+        case PATCH_OP_MOVE: /* val = remove(from), add(path, val) */
+            if (unlikely(from_len == 0 && path_len == 0))
+                break;
+            val = ptr_remove(from);
+            if (unlikely(!val)) {
+                return_err(POINTER, "failed to remove `from`");
+            }
+            if (unlikely(path_len == 0)) {
+                root = val;
+                break;
+            }
+            if (unlikely(!ptr_add(path, val))) {
+                return_err(POINTER, "failed to add `path`");
+            }
+            break;
+        case PATCH_OP_COPY: /* val = get(from).copy, add(path, val) */
+            val = ptr_get(from);
+            if (unlikely(!val)) {
+                return_err(POINTER, "failed to get `from`");
+            }
+            if (unlikely(path_len == 0)) {
+                root = val;
+                break;
+            }
+            val = yyjson_mut_val_mut_copy(doc, val);
+            if (unlikely(!val))
+                return_err_copy();
+            if (unlikely(!ptr_add(path, val))) {
+                return_err(POINTER, "failed to add `path`");
+            }
+            break;
+        case PATCH_OP_TEST: /* test = get(path), test.eq(val) */
+            test = ptr_get(path);
+            if (unlikely(!test)) {
+                return_err(POINTER, "failed to get `path`");
+            }
+            if (unlikely(!yyjson_mut_equals(val, test))) {
+                return_err(EQUAL, "failed to test equal");
+            }
+            break;
+        default:
+            return_err(INVALID_MEMBER, "unsupported `op`");
+        }
+    }
+    return root;
+}
+
+/* macros for yyjson_patch */
+#undef return_err
+#undef return_err_copy
+#undef return_err_key
+#undef return_err_val
+#undef ptr_get
+#undef ptr_add
+#undef ptr_remove
+#undef ptr_replace
+
+/*==============================================================================
+ * JSON Merge-Patch API (RFC 7386)
+ *============================================================================*/
+
+yyjson_mut_val* yyjson_merge_patch(yyjson_mut_doc* doc, yyjson_val* orig, yyjson_val* patch) {
+    usize idx, max;
+    yyjson_val *key, *orig_val, *patch_val, local_orig;
+    yyjson_mut_val *builder, *mut_key, *mut_val, *merged_val;
+
+    if (unlikely(!yyjson_is_obj(patch))) {
+        return yyjson_val_mut_copy(doc, patch);
+    }
+
+    builder = yyjson_mut_obj(doc);
+    if (unlikely(!builder))
+        return NULL;
+
+    memset(&local_orig, 0, sizeof(local_orig));
+    if (!yyjson_is_obj(orig)) {
+        orig = &local_orig;
+        orig->tag = builder->tag;
+        orig->uni = builder->uni;
+    }
+
+    /* If orig is contributing, copy any items not modified by the patch */
+    if (orig != &local_orig) {
+        yyjson_obj_foreach(orig, idx, max, key, orig_val) {
+            patch_val =
+                yyjson_obj_getn(patch, unsafe_yyjson_get_str(key), unsafe_yyjson_get_len(key));
+            if (!patch_val) {
+                mut_key = yyjson_val_mut_copy(doc, key);
+                mut_val = yyjson_val_mut_copy(doc, orig_val);
+                if (!yyjson_mut_obj_add(builder, mut_key, mut_val))
+                    return NULL;
+            }
+        }
+    }
+
+    /* Merge items modified by the patch. */
+    yyjson_obj_foreach(patch, idx, max, key, patch_val) {
+        /* null indicates the field is removed. */
+        if (unsafe_yyjson_is_null(patch_val)) {
+            continue;
+        }
+        mut_key = yyjson_val_mut_copy(doc, key);
+        orig_val = yyjson_obj_getn(orig, unsafe_yyjson_get_str(key), unsafe_yyjson_get_len(key));
+        merged_val = yyjson_merge_patch(doc, orig_val, patch_val);
+        if (!yyjson_mut_obj_add(builder, mut_key, merged_val))
+            return NULL;
+    }
+
+    return builder;
+}
+
+yyjson_mut_val* yyjson_mut_merge_patch(yyjson_mut_doc* doc, yyjson_mut_val* orig,
+    yyjson_mut_val* patch) {
+    usize idx, max;
+    yyjson_mut_val *key, *orig_val, *patch_val, local_orig;
+    yyjson_mut_val *builder, *mut_key, *mut_val, *merged_val;
+
+    if (unlikely(!yyjson_mut_is_obj(patch))) {
+        return yyjson_mut_val_mut_copy(doc, patch);
+    }
+
+    builder = yyjson_mut_obj(doc);
+    if (unlikely(!builder))
+        return NULL;
+
+    memset(&local_orig, 0, sizeof(local_orig));
+    if (!yyjson_mut_is_obj(orig)) {
+        orig = &local_orig;
+        orig->tag = builder->tag;
+        orig->uni = builder->uni;
+    }
+
+    /* If orig is contributing, copy any items not modified by the patch */
+    if (orig != &local_orig) {
+        yyjson_mut_obj_foreach(orig, idx, max, key, orig_val) {
+            patch_val =
+                yyjson_mut_obj_getn(patch, unsafe_yyjson_get_str(key), unsafe_yyjson_get_len(key));
+            if (!patch_val) {
+                mut_key = yyjson_mut_val_mut_copy(doc, key);
+                mut_val = yyjson_mut_val_mut_copy(doc, orig_val);
+                if (!yyjson_mut_obj_add(builder, mut_key, mut_val))
+                    return NULL;
+            }
+        }
+    }
+
+    /* Merge items modified by the patch. */
+    yyjson_mut_obj_foreach(patch, idx, max, key, patch_val) {
+        /* null indicates the field is removed. */
+        if (unsafe_yyjson_is_null(patch_val)) {
+            continue;
+        }
+        mut_key = yyjson_mut_val_mut_copy(doc, key);
+        orig_val =
+            yyjson_mut_obj_getn(orig, unsafe_yyjson_get_str(key), unsafe_yyjson_get_len(key));
+        merged_val = yyjson_mut_merge_patch(doc, orig_val, patch_val);
+        if (!yyjson_mut_obj_add(builder, mut_key, merged_val))
+            return NULL;
+    }
+
+    return builder;
+}
+
+#endif /* YYJSON_DISABLE_UTILS */
+
+/*==============================================================================
+ * Power10 Lookup Table
+ * These data are used by the floating-point number reader and writer.
+ *============================================================================*/
+
+#if (!YYJSON_DISABLE_READER || !YYJSON_DISABLE_WRITER) && (!YYJSON_DISABLE_FAST_FP_CONV)
+
+/** Minimum decimal exponent in pow10_sig_table. */
+#define POW10_SIG_TABLE_MIN_EXP -343
+
+/** Maximum decimal exponent in pow10_sig_table. */
+#define POW10_SIG_TABLE_MAX_EXP 324
+
+/** Minimum exact decimal exponent in pow10_sig_table */
+#define POW10_SIG_TABLE_MIN_EXACT_EXP 0
+
+/** Maximum exact decimal exponent in pow10_sig_table */
+#define POW10_SIG_TABLE_MAX_EXACT_EXP 55
+
+/** Normalized significant 128 bits of pow10, no rounded up (size: 10.4KB).
+    This lookup table is used by both the double number reader and writer.
+    (generate with misc/make_tables.c) */
+static const u64 pow10_sig_table[] = {
+    U64(0xBF29DCAB, 0xA82FDEAE), U64(0x7432EE87, 0x3880FC33), /* ~= 10^-343 */
+    U64(0xEEF453D6, 0x923BD65A), U64(0x113FAA29, 0x06A13B3F), /* ~= 10^-342 */
+    U64(0x9558B466, 0x1B6565F8), U64(0x4AC7CA59, 0xA424C507), /* ~= 10^-341 */
+    U64(0xBAAEE17F, 0xA23EBF76), U64(0x5D79BCF0, 0x0D2DF649), /* ~= 10^-340 */
+    U64(0xE95A99DF, 0x8ACE6F53), U64(0xF4D82C2C, 0x107973DC), /* ~= 10^-339 */
+    U64(0x91D8A02B, 0xB6C10594), U64(0x79071B9B, 0x8A4BE869), /* ~= 10^-338 */
+    U64(0xB64EC836, 0xA47146F9), U64(0x9748E282, 0x6CDEE284), /* ~= 10^-337 */
+    U64(0xE3E27A44, 0x4D8D98B7), U64(0xFD1B1B23, 0x08169B25), /* ~= 10^-336 */
+    U64(0x8E6D8C6A, 0xB0787F72), U64(0xFE30F0F5, 0xE50E20F7), /* ~= 10^-335 */
+    U64(0xB208EF85, 0x5C969F4F), U64(0xBDBD2D33, 0x5E51A935), /* ~= 10^-334 */
+    U64(0xDE8B2B66, 0xB3BC4723), U64(0xAD2C7880, 0x35E61382), /* ~= 10^-333 */
+    U64(0x8B16FB20, 0x3055AC76), U64(0x4C3BCB50, 0x21AFCC31), /* ~= 10^-332 */
+    U64(0xADDCB9E8, 0x3C6B1793), U64(0xDF4ABE24, 0x2A1BBF3D), /* ~= 10^-331 */
+    U64(0xD953E862, 0x4B85DD78), U64(0xD71D6DAD, 0x34A2AF0D), /* ~= 10^-330 */
+    U64(0x87D4713D, 0x6F33AA6B), U64(0x8672648C, 0x40E5AD68), /* ~= 10^-329 */
+    U64(0xA9C98D8C, 0xCB009506), U64(0x680EFDAF, 0x511F18C2), /* ~= 10^-328 */
+    U64(0xD43BF0EF, 0xFDC0BA48), U64(0x0212BD1B, 0x2566DEF2), /* ~= 10^-327 */
+    U64(0x84A57695, 0xFE98746D), U64(0x014BB630, 0xF7604B57), /* ~= 10^-326 */
+    U64(0xA5CED43B, 0x7E3E9188), U64(0x419EA3BD, 0x35385E2D), /* ~= 10^-325 */
+    U64(0xCF42894A, 0x5DCE35EA), U64(0x52064CAC, 0x828675B9), /* ~= 10^-324 */
+    U64(0x818995CE, 0x7AA0E1B2), U64(0x7343EFEB, 0xD1940993), /* ~= 10^-323 */
+    U64(0xA1EBFB42, 0x19491A1F), U64(0x1014EBE6, 0xC5F90BF8), /* ~= 10^-322 */
+    U64(0xCA66FA12, 0x9F9B60A6), U64(0xD41A26E0, 0x77774EF6), /* ~= 10^-321 */
+    U64(0xFD00B897, 0x478238D0), U64(0x8920B098, 0x955522B4), /* ~= 10^-320 */
+    U64(0x9E20735E, 0x8CB16382), U64(0x55B46E5F, 0x5D5535B0), /* ~= 10^-319 */
+    U64(0xC5A89036, 0x2FDDBC62), U64(0xEB2189F7, 0x34AA831D), /* ~= 10^-318 */
+    U64(0xF712B443, 0xBBD52B7B), U64(0xA5E9EC75, 0x01D523E4), /* ~= 10^-317 */
+    U64(0x9A6BB0AA, 0x55653B2D), U64(0x47B233C9, 0x2125366E), /* ~= 10^-316 */
+    U64(0xC1069CD4, 0xEABE89F8), U64(0x999EC0BB, 0x696E840A), /* ~= 10^-315 */
+    U64(0xF148440A, 0x256E2C76), U64(0xC00670EA, 0x43CA250D), /* ~= 10^-314 */
+    U64(0x96CD2A86, 0x5764DBCA), U64(0x38040692, 0x6A5E5728), /* ~= 10^-313 */
+    U64(0xBC807527, 0xED3E12BC), U64(0xC6050837, 0x04F5ECF2), /* ~= 10^-312 */
+    U64(0xEBA09271, 0xE88D976B), U64(0xF7864A44, 0xC633682E), /* ~= 10^-311 */
+    U64(0x93445B87, 0x31587EA3), U64(0x7AB3EE6A, 0xFBE0211D), /* ~= 10^-310 */
+    U64(0xB8157268, 0xFDAE9E4C), U64(0x5960EA05, 0xBAD82964), /* ~= 10^-309 */
+    U64(0xE61ACF03, 0x3D1A45DF), U64(0x6FB92487, 0x298E33BD), /* ~= 10^-308 */
+    U64(0x8FD0C162, 0x06306BAB), U64(0xA5D3B6D4, 0x79F8E056), /* ~= 10^-307 */
+    U64(0xB3C4F1BA, 0x87BC8696), U64(0x8F48A489, 0x9877186C), /* ~= 10^-306 */
+    U64(0xE0B62E29, 0x29ABA83C), U64(0x331ACDAB, 0xFE94DE87), /* ~= 10^-305 */
+    U64(0x8C71DCD9, 0xBA0B4925), U64(0x9FF0C08B, 0x7F1D0B14), /* ~= 10^-304 */
+    U64(0xAF8E5410, 0x288E1B6F), U64(0x07ECF0AE, 0x5EE44DD9), /* ~= 10^-303 */
+    U64(0xDB71E914, 0x32B1A24A), U64(0xC9E82CD9, 0xF69D6150), /* ~= 10^-302 */
+    U64(0x892731AC, 0x9FAF056E), U64(0xBE311C08, 0x3A225CD2), /* ~= 10^-301 */
+    U64(0xAB70FE17, 0xC79AC6CA), U64(0x6DBD630A, 0x48AAF406), /* ~= 10^-300 */
+    U64(0xD64D3D9D, 0xB981787D), U64(0x092CBBCC, 0xDAD5B108), /* ~= 10^-299 */
+    U64(0x85F04682, 0x93F0EB4E), U64(0x25BBF560, 0x08C58EA5), /* ~= 10^-298 */
+    U64(0xA76C5823, 0x38ED2621), U64(0xAF2AF2B8, 0x0AF6F24E), /* ~= 10^-297 */
+    U64(0xD1476E2C, 0x07286FAA), U64(0x1AF5AF66, 0x0DB4AEE1), /* ~= 10^-296 */
+    U64(0x82CCA4DB, 0x847945CA), U64(0x50D98D9F, 0xC890ED4D), /* ~= 10^-295 */
+    U64(0xA37FCE12, 0x6597973C), U64(0xE50FF107, 0xBAB528A0), /* ~= 10^-294 */
+    U64(0xCC5FC196, 0xFEFD7D0C), U64(0x1E53ED49, 0xA96272C8), /* ~= 10^-293 */
+    U64(0xFF77B1FC, 0xBEBCDC4F), U64(0x25E8E89C, 0x13BB0F7A), /* ~= 10^-292 */
+    U64(0x9FAACF3D, 0xF73609B1), U64(0x77B19161, 0x8C54E9AC), /* ~= 10^-291 */
+    U64(0xC795830D, 0x75038C1D), U64(0xD59DF5B9, 0xEF6A2417), /* ~= 10^-290 */
+    U64(0xF97AE3D0, 0xD2446F25), U64(0x4B057328, 0x6B44AD1D), /* ~= 10^-289 */
+    U64(0x9BECCE62, 0x836AC577), U64(0x4EE367F9, 0x430AEC32), /* ~= 10^-288 */
+    U64(0xC2E801FB, 0x244576D5), U64(0x229C41F7, 0x93CDA73F), /* ~= 10^-287 */
+    U64(0xF3A20279, 0xED56D48A), U64(0x6B435275, 0x78C1110F), /* ~= 10^-286 */
+    U64(0x9845418C, 0x345644D6), U64(0x830A1389, 0x6B78AAA9), /* ~= 10^-285 */
+    U64(0xBE5691EF, 0x416BD60C), U64(0x23CC986B, 0xC656D553), /* ~= 10^-284 */
+    U64(0xEDEC366B, 0x11C6CB8F), U64(0x2CBFBE86, 0xB7EC8AA8), /* ~= 10^-283 */
+    U64(0x94B3A202, 0xEB1C3F39), U64(0x7BF7D714, 0x32F3D6A9), /* ~= 10^-282 */
+    U64(0xB9E08A83, 0xA5E34F07), U64(0xDAF5CCD9, 0x3FB0CC53), /* ~= 10^-281 */
+    U64(0xE858AD24, 0x8F5C22C9), U64(0xD1B3400F, 0x8F9CFF68), /* ~= 10^-280 */
+    U64(0x91376C36, 0xD99995BE), U64(0x23100809, 0xB9C21FA1), /* ~= 10^-279 */
+    U64(0xB5854744, 0x8FFFFB2D), U64(0xABD40A0C, 0x2832A78A), /* ~= 10^-278 */
+    U64(0xE2E69915, 0xB3FFF9F9), U64(0x16C90C8F, 0x323F516C), /* ~= 10^-277 */
+    U64(0x8DD01FAD, 0x907FFC3B), U64(0xAE3DA7D9, 0x7F6792E3), /* ~= 10^-276 */
+    U64(0xB1442798, 0xF49FFB4A), U64(0x99CD11CF, 0xDF41779C), /* ~= 10^-275 */
+    U64(0xDD95317F, 0x31C7FA1D), U64(0x40405643, 0xD711D583), /* ~= 10^-274 */
+    U64(0x8A7D3EEF, 0x7F1CFC52), U64(0x482835EA, 0x666B2572), /* ~= 10^-273 */
+    U64(0xAD1C8EAB, 0x5EE43B66), U64(0xDA324365, 0x0005EECF), /* ~= 10^-272 */
+    U64(0xD863B256, 0x369D4A40), U64(0x90BED43E, 0x40076A82), /* ~= 10^-271 */
+    U64(0x873E4F75, 0xE2224E68), U64(0x5A7744A6, 0xE804A291), /* ~= 10^-270 */
+    U64(0xA90DE353, 0x5AAAE202), U64(0x711515D0, 0xA205CB36), /* ~= 10^-269 */
+    U64(0xD3515C28, 0x31559A83), U64(0x0D5A5B44, 0xCA873E03), /* ~= 10^-268 */
+    U64(0x8412D999, 0x1ED58091), U64(0xE858790A, 0xFE9486C2), /* ~= 10^-267 */
+    U64(0xA5178FFF, 0x668AE0B6), U64(0x626E974D, 0xBE39A872), /* ~= 10^-266 */
+    U64(0xCE5D73FF, 0x402D98E3), U64(0xFB0A3D21, 0x2DC8128F), /* ~= 10^-265 */
+    U64(0x80FA687F, 0x881C7F8E), U64(0x7CE66634, 0xBC9D0B99), /* ~= 10^-264 */
+    U64(0xA139029F, 0x6A239F72), U64(0x1C1FFFC1, 0xEBC44E80), /* ~= 10^-263 */
+    U64(0xC9874347, 0x44AC874E), U64(0xA327FFB2, 0x66B56220), /* ~= 10^-262 */
+    U64(0xFBE91419, 0x15D7A922), U64(0x4BF1FF9F, 0x0062BAA8), /* ~= 10^-261 */
+    U64(0x9D71AC8F, 0xADA6C9B5), U64(0x6F773FC3, 0x603DB4A9), /* ~= 10^-260 */
+    U64(0xC4CE17B3, 0x99107C22), U64(0xCB550FB4, 0x384D21D3), /* ~= 10^-259 */
+    U64(0xF6019DA0, 0x7F549B2B), U64(0x7E2A53A1, 0x46606A48), /* ~= 10^-258 */
+    U64(0x99C10284, 0x4F94E0FB), U64(0x2EDA7444, 0xCBFC426D), /* ~= 10^-257 */
+    U64(0xC0314325, 0x637A1939), U64(0xFA911155, 0xFEFB5308), /* ~= 10^-256 */
+    U64(0xF03D93EE, 0xBC589F88), U64(0x793555AB, 0x7EBA27CA), /* ~= 10^-255 */
+    U64(0x96267C75, 0x35B763B5), U64(0x4BC1558B, 0x2F3458DE), /* ~= 10^-254 */
+    U64(0xBBB01B92, 0x83253CA2), U64(0x9EB1AAED, 0xFB016F16), /* ~= 10^-253 */
+    U64(0xEA9C2277, 0x23EE8BCB), U64(0x465E15A9, 0x79C1CADC), /* ~= 10^-252 */
+    U64(0x92A1958A, 0x7675175F), U64(0x0BFACD89, 0xEC191EC9), /* ~= 10^-251 */
+    U64(0xB749FAED, 0x14125D36), U64(0xCEF980EC, 0x671F667B), /* ~= 10^-250 */
+    U64(0xE51C79A8, 0x5916F484), U64(0x82B7E127, 0x80E7401A), /* ~= 10^-249 */
+    U64(0x8F31CC09, 0x37AE58D2), U64(0xD1B2ECB8, 0xB0908810), /* ~= 10^-248 */
+    U64(0xB2FE3F0B, 0x8599EF07), U64(0x861FA7E6, 0xDCB4AA15), /* ~= 10^-247 */
+    U64(0xDFBDCECE, 0x67006AC9), U64(0x67A791E0, 0x93E1D49A), /* ~= 10^-246 */
+    U64(0x8BD6A141, 0x006042BD), U64(0xE0C8BB2C, 0x5C6D24E0), /* ~= 10^-245 */
+    U64(0xAECC4991, 0x4078536D), U64(0x58FAE9F7, 0x73886E18), /* ~= 10^-244 */
+    U64(0xDA7F5BF5, 0x90966848), U64(0xAF39A475, 0x506A899E), /* ~= 10^-243 */
+    U64(0x888F9979, 0x7A5E012D), U64(0x6D8406C9, 0x52429603), /* ~= 10^-242 */
+    U64(0xAAB37FD7, 0xD8F58178), U64(0xC8E5087B, 0xA6D33B83), /* ~= 10^-241 */
+    U64(0xD5605FCD, 0xCF32E1D6), U64(0xFB1E4A9A, 0x90880A64), /* ~= 10^-240 */
+    U64(0x855C3BE0, 0xA17FCD26), U64(0x5CF2EEA0, 0x9A55067F), /* ~= 10^-239 */
+    U64(0xA6B34AD8, 0xC9DFC06F), U64(0xF42FAA48, 0xC0EA481E), /* ~= 10^-238 */
+    U64(0xD0601D8E, 0xFC57B08B), U64(0xF13B94DA, 0xF124DA26), /* ~= 10^-237 */
+    U64(0x823C1279, 0x5DB6CE57), U64(0x76C53D08, 0xD6B70858), /* ~= 10^-236 */
+    U64(0xA2CB1717, 0xB52481ED), U64(0x54768C4B, 0x0C64CA6E), /* ~= 10^-235 */
+    U64(0xCB7DDCDD, 0xA26DA268), U64(0xA9942F5D, 0xCF7DFD09), /* ~= 10^-234 */
+    U64(0xFE5D5415, 0x0B090B02), U64(0xD3F93B35, 0x435D7C4C), /* ~= 10^-233 */
+    U64(0x9EFA548D, 0x26E5A6E1), U64(0xC47BC501, 0x4A1A6DAF), /* ~= 10^-232 */
+    U64(0xC6B8E9B0, 0x709F109A), U64(0x359AB641, 0x9CA1091B), /* ~= 10^-231 */
+    U64(0xF867241C, 0x8CC6D4C0), U64(0xC30163D2, 0x03C94B62), /* ~= 10^-230 */
+    U64(0x9B407691, 0xD7FC44F8), U64(0x79E0DE63, 0x425DCF1D), /* ~= 10^-229 */
+    U64(0xC2109436, 0x4DFB5636), U64(0x985915FC, 0x12F542E4), /* ~= 10^-228 */
+    U64(0xF294B943, 0xE17A2BC4), U64(0x3E6F5B7B, 0x17B2939D), /* ~= 10^-227 */
+    U64(0x979CF3CA, 0x6CEC5B5A), U64(0xA705992C, 0xEECF9C42), /* ~= 10^-226 */
+    U64(0xBD8430BD, 0x08277231), U64(0x50C6FF78, 0x2A838353), /* ~= 10^-225 */
+    U64(0xECE53CEC, 0x4A314EBD), U64(0xA4F8BF56, 0x35246428), /* ~= 10^-224 */
+    U64(0x940F4613, 0xAE5ED136), U64(0x871B7795, 0xE136BE99), /* ~= 10^-223 */
+    U64(0xB9131798, 0x99F68584), U64(0x28E2557B, 0x59846E3F), /* ~= 10^-222 */
+    U64(0xE757DD7E, 0xC07426E5), U64(0x331AEADA, 0x2FE589CF), /* ~= 10^-221 */
+    U64(0x9096EA6F, 0x3848984F), U64(0x3FF0D2C8, 0x5DEF7621), /* ~= 10^-220 */
+    U64(0xB4BCA50B, 0x065ABE63), U64(0x0FED077A, 0x756B53A9), /* ~= 10^-219 */
+    U64(0xE1EBCE4D, 0xC7F16DFB), U64(0xD3E84959, 0x12C62894), /* ~= 10^-218 */
+    U64(0x8D3360F0, 0x9CF6E4BD), U64(0x64712DD7, 0xABBBD95C), /* ~= 10^-217 */
+    U64(0xB080392C, 0xC4349DEC), U64(0xBD8D794D, 0x96AACFB3), /* ~= 10^-216 */
+    U64(0xDCA04777, 0xF541C567), U64(0xECF0D7A0, 0xFC5583A0), /* ~= 10^-215 */
+    U64(0x89E42CAA, 0xF9491B60), U64(0xF41686C4, 0x9DB57244), /* ~= 10^-214 */
+    U64(0xAC5D37D5, 0xB79B6239), U64(0x311C2875, 0xC522CED5), /* ~= 10^-213 */
+    U64(0xD77485CB, 0x25823AC7), U64(0x7D633293, 0x366B828B), /* ~= 10^-212 */
+    U64(0x86A8D39E, 0xF77164BC), U64(0xAE5DFF9C, 0x02033197), /* ~= 10^-211 */
+    U64(0xA8530886, 0xB54DBDEB), U64(0xD9F57F83, 0x0283FDFC), /* ~= 10^-210 */
+    U64(0xD267CAA8, 0x62A12D66), U64(0xD072DF63, 0xC324FD7B), /* ~= 10^-209 */
+    U64(0x8380DEA9, 0x3DA4BC60), U64(0x4247CB9E, 0x59F71E6D), /* ~= 10^-208 */
+    U64(0xA4611653, 0x8D0DEB78), U64(0x52D9BE85, 0xF074E608), /* ~= 10^-207 */
+    U64(0xCD795BE8, 0x70516656), U64(0x67902E27, 0x6C921F8B), /* ~= 10^-206 */
+    U64(0x806BD971, 0x4632DFF6), U64(0x00BA1CD8, 0xA3DB53B6), /* ~= 10^-205 */
+    U64(0xA086CFCD, 0x97BF97F3), U64(0x80E8A40E, 0xCCD228A4), /* ~= 10^-204 */
+    U64(0xC8A883C0, 0xFDAF7DF0), U64(0x6122CD12, 0x8006B2CD), /* ~= 10^-203 */
+    U64(0xFAD2A4B1, 0x3D1B5D6C), U64(0x796B8057, 0x20085F81), /* ~= 10^-202 */
+    U64(0x9CC3A6EE, 0xC6311A63), U64(0xCBE33036, 0x74053BB0), /* ~= 10^-201 */
+    U64(0xC3F490AA, 0x77BD60FC), U64(0xBEDBFC44, 0x11068A9C), /* ~= 10^-200 */
+    U64(0xF4F1B4D5, 0x15ACB93B), U64(0xEE92FB55, 0x15482D44), /* ~= 10^-199 */
+    U64(0x99171105, 0x2D8BF3C5), U64(0x751BDD15, 0x2D4D1C4A), /* ~= 10^-198 */
+    U64(0xBF5CD546, 0x78EEF0B6), U64(0xD262D45A, 0x78A0635D), /* ~= 10^-197 */
+    U64(0xEF340A98, 0x172AACE4), U64(0x86FB8971, 0x16C87C34), /* ~= 10^-196 */
+    U64(0x9580869F, 0x0E7AAC0E), U64(0xD45D35E6, 0xAE3D4DA0), /* ~= 10^-195 */
+    U64(0xBAE0A846, 0xD2195712), U64(0x89748360, 0x59CCA109), /* ~= 10^-194 */
+    U64(0xE998D258, 0x869FACD7), U64(0x2BD1A438, 0x703FC94B), /* ~= 10^-193 */
+    U64(0x91FF8377, 0x5423CC06), U64(0x7B6306A3, 0x4627DDCF), /* ~= 10^-192 */
+    U64(0xB67F6455, 0x292CBF08), U64(0x1A3BC84C, 0x17B1D542), /* ~= 10^-191 */
+    U64(0xE41F3D6A, 0x7377EECA), U64(0x20CABA5F, 0x1D9E4A93), /* ~= 10^-190 */
+    U64(0x8E938662, 0x882AF53E), U64(0x547EB47B, 0x7282EE9C), /* ~= 10^-189 */
+    U64(0xB23867FB, 0x2A35B28D), U64(0xE99E619A, 0x4F23AA43), /* ~= 10^-188 */
+    U64(0xDEC681F9, 0xF4C31F31), U64(0x6405FA00, 0xE2EC94D4), /* ~= 10^-187 */
+    U64(0x8B3C113C, 0x38F9F37E), U64(0xDE83BC40, 0x8DD3DD04), /* ~= 10^-186 */
+    U64(0xAE0B158B, 0x4738705E), U64(0x9624AB50, 0xB148D445), /* ~= 10^-185 */
+    U64(0xD98DDAEE, 0x19068C76), U64(0x3BADD624, 0xDD9B0957), /* ~= 10^-184 */
+    U64(0x87F8A8D4, 0xCFA417C9), U64(0xE54CA5D7, 0x0A80E5D6), /* ~= 10^-183 */
+    U64(0xA9F6D30A, 0x038D1DBC), U64(0x5E9FCF4C, 0xCD211F4C), /* ~= 10^-182 */
+    U64(0xD47487CC, 0x8470652B), U64(0x7647C320, 0x0069671F), /* ~= 10^-181 */
+    U64(0x84C8D4DF, 0xD2C63F3B), U64(0x29ECD9F4, 0x0041E073), /* ~= 10^-180 */
+    U64(0xA5FB0A17, 0xC777CF09), U64(0xF4681071, 0x00525890), /* ~= 10^-179 */
+    U64(0xCF79CC9D, 0xB955C2CC), U64(0x7182148D, 0x4066EEB4), /* ~= 10^-178 */
+    U64(0x81AC1FE2, 0x93D599BF), U64(0xC6F14CD8, 0x48405530), /* ~= 10^-177 */
+    U64(0xA21727DB, 0x38CB002F), U64(0xB8ADA00E, 0x5A506A7C), /* ~= 10^-176 */
+    U64(0xCA9CF1D2, 0x06FDC03B), U64(0xA6D90811, 0xF0E4851C), /* ~= 10^-175 */
+    U64(0xFD442E46, 0x88BD304A), U64(0x908F4A16, 0x6D1DA663), /* ~= 10^-174 */
+    U64(0x9E4A9CEC, 0x15763E2E), U64(0x9A598E4E, 0x043287FE), /* ~= 10^-173 */
+    U64(0xC5DD4427, 0x1AD3CDBA), U64(0x40EFF1E1, 0x853F29FD), /* ~= 10^-172 */
+    U64(0xF7549530, 0xE188C128), U64(0xD12BEE59, 0xE68EF47C), /* ~= 10^-171 */
+    U64(0x9A94DD3E, 0x8CF578B9), U64(0x82BB74F8, 0x301958CE), /* ~= 10^-170 */
+    U64(0xC13A148E, 0x3032D6E7), U64(0xE36A5236, 0x3C1FAF01), /* ~= 10^-169 */
+    U64(0xF18899B1, 0xBC3F8CA1), U64(0xDC44E6C3, 0xCB279AC1), /* ~= 10^-168 */
+    U64(0x96F5600F, 0x15A7B7E5), U64(0x29AB103A, 0x5EF8C0B9), /* ~= 10^-167 */
+    U64(0xBCB2B812, 0xDB11A5DE), U64(0x7415D448, 0xF6B6F0E7), /* ~= 10^-166 */
+    U64(0xEBDF6617, 0x91D60F56), U64(0x111B495B, 0x3464AD21), /* ~= 10^-165 */
+    U64(0x936B9FCE, 0xBB25C995), U64(0xCAB10DD9, 0x00BEEC34), /* ~= 10^-164 */
+    U64(0xB84687C2, 0x69EF3BFB), U64(0x3D5D514F, 0x40EEA742), /* ~= 10^-163 */
+    U64(0xE65829B3, 0x046B0AFA), U64(0x0CB4A5A3, 0x112A5112), /* ~= 10^-162 */
+    U64(0x8FF71A0F, 0xE2C2E6DC), U64(0x47F0E785, 0xEABA72AB), /* ~= 10^-161 */
+    U64(0xB3F4E093, 0xDB73A093), U64(0x59ED2167, 0x65690F56), /* ~= 10^-160 */
+    U64(0xE0F218B8, 0xD25088B8), U64(0x306869C1, 0x3EC3532C), /* ~= 10^-159 */
+    U64(0x8C974F73, 0x83725573), U64(0x1E414218, 0xC73A13FB), /* ~= 10^-158 */
+    U64(0xAFBD2350, 0x644EEACF), U64(0xE5D1929E, 0xF90898FA), /* ~= 10^-157 */
+    U64(0xDBAC6C24, 0x7D62A583), U64(0xDF45F746, 0xB74ABF39), /* ~= 10^-156 */
+    U64(0x894BC396, 0xCE5DA772), U64(0x6B8BBA8C, 0x328EB783), /* ~= 10^-155 */
+    U64(0xAB9EB47C, 0x81F5114F), U64(0x066EA92F, 0x3F326564), /* ~= 10^-154 */
+    U64(0xD686619B, 0xA27255A2), U64(0xC80A537B, 0x0EFEFEBD), /* ~= 10^-153 */
+    U64(0x8613FD01, 0x45877585), U64(0xBD06742C, 0xE95F5F36), /* ~= 10^-152 */
+    U64(0xA798FC41, 0x96E952E7), U64(0x2C481138, 0x23B73704), /* ~= 10^-151 */
+    U64(0xD17F3B51, 0xFCA3A7A0), U64(0xF75A1586, 0x2CA504C5), /* ~= 10^-150 */
+    U64(0x82EF8513, 0x3DE648C4), U64(0x9A984D73, 0xDBE722FB), /* ~= 10^-149 */
+    U64(0xA3AB6658, 0x0D5FDAF5), U64(0xC13E60D0, 0xD2E0EBBA), /* ~= 10^-148 */
+    U64(0xCC963FEE, 0x10B7D1B3), U64(0x318DF905, 0x079926A8), /* ~= 10^-147 */
+    U64(0xFFBBCFE9, 0x94E5C61F), U64(0xFDF17746, 0x497F7052), /* ~= 10^-146 */
+    U64(0x9FD561F1, 0xFD0F9BD3), U64(0xFEB6EA8B, 0xEDEFA633), /* ~= 10^-145 */
+    U64(0xC7CABA6E, 0x7C5382C8), U64(0xFE64A52E, 0xE96B8FC0), /* ~= 10^-144 */
+    U64(0xF9BD690A, 0x1B68637B), U64(0x3DFDCE7A, 0xA3C673B0), /* ~= 10^-143 */
+    U64(0x9C1661A6, 0x51213E2D), U64(0x06BEA10C, 0xA65C084E), /* ~= 10^-142 */
+    U64(0xC31BFA0F, 0xE5698DB8), U64(0x486E494F, 0xCFF30A62), /* ~= 10^-141 */
+    U64(0xF3E2F893, 0xDEC3F126), U64(0x5A89DBA3, 0xC3EFCCFA), /* ~= 10^-140 */
+    U64(0x986DDB5C, 0x6B3A76B7), U64(0xF8962946, 0x5A75E01C), /* ~= 10^-139 */
+    U64(0xBE895233, 0x86091465), U64(0xF6BBB397, 0xF1135823), /* ~= 10^-138 */
+    U64(0xEE2BA6C0, 0x678B597F), U64(0x746AA07D, 0xED582E2C), /* ~= 10^-137 */
+    U64(0x94DB4838, 0x40B717EF), U64(0xA8C2A44E, 0xB4571CDC), /* ~= 10^-136 */
+    U64(0xBA121A46, 0x50E4DDEB), U64(0x92F34D62, 0x616CE413), /* ~= 10^-135 */
+    U64(0xE896A0D7, 0xE51E1566), U64(0x77B020BA, 0xF9C81D17), /* ~= 10^-134 */
+    U64(0x915E2486, 0xEF32CD60), U64(0x0ACE1474, 0xDC1D122E), /* ~= 10^-133 */
+    U64(0xB5B5ADA8, 0xAAFF80B8), U64(0x0D819992, 0x132456BA), /* ~= 10^-132 */
+    U64(0xE3231912, 0xD5BF60E6), U64(0x10E1FFF6, 0x97ED6C69), /* ~= 10^-131 */
+    U64(0x8DF5EFAB, 0xC5979C8F), U64(0xCA8D3FFA, 0x1EF463C1), /* ~= 10^-130 */
+    U64(0xB1736B96, 0xB6FD83B3), U64(0xBD308FF8, 0xA6B17CB2), /* ~= 10^-129 */
+    U64(0xDDD0467C, 0x64BCE4A0), U64(0xAC7CB3F6, 0xD05DDBDE), /* ~= 10^-128 */
+    U64(0x8AA22C0D, 0xBEF60EE4), U64(0x6BCDF07A, 0x423AA96B), /* ~= 10^-127 */
+    U64(0xAD4AB711, 0x2EB3929D), U64(0x86C16C98, 0xD2C953C6), /* ~= 10^-126 */
+    U64(0xD89D64D5, 0x7A607744), U64(0xE871C7BF, 0x077BA8B7), /* ~= 10^-125 */
+    U64(0x87625F05, 0x6C7C4A8B), U64(0x11471CD7, 0x64AD4972), /* ~= 10^-124 */
+    U64(0xA93AF6C6, 0xC79B5D2D), U64(0xD598E40D, 0x3DD89BCF), /* ~= 10^-123 */
+    U64(0xD389B478, 0x79823479), U64(0x4AFF1D10, 0x8D4EC2C3), /* ~= 10^-122 */
+    U64(0x843610CB, 0x4BF160CB), U64(0xCEDF722A, 0x585139BA), /* ~= 10^-121 */
+    U64(0xA54394FE, 0x1EEDB8FE), U64(0xC2974EB4, 0xEE658828), /* ~= 10^-120 */
+    U64(0xCE947A3D, 0xA6A9273E), U64(0x733D2262, 0x29FEEA32), /* ~= 10^-119 */
+    U64(0x811CCC66, 0x8829B887), U64(0x0806357D, 0x5A3F525F), /* ~= 10^-118 */
+    U64(0xA163FF80, 0x2A3426A8), U64(0xCA07C2DC, 0xB0CF26F7), /* ~= 10^-117 */
+    U64(0xC9BCFF60, 0x34C13052), U64(0xFC89B393, 0xDD02F0B5), /* ~= 10^-116 */
+    U64(0xFC2C3F38, 0x41F17C67), U64(0xBBAC2078, 0xD443ACE2), /* ~= 10^-115 */
+    U64(0x9D9BA783, 0x2936EDC0), U64(0xD54B944B, 0x84AA4C0D), /* ~= 10^-114 */
+    U64(0xC5029163, 0xF384A931), U64(0x0A9E795E, 0x65D4DF11), /* ~= 10^-113 */
+    U64(0xF64335BC, 0xF065D37D), U64(0x4D4617B5, 0xFF4A16D5), /* ~= 10^-112 */
+    U64(0x99EA0196, 0x163FA42E), U64(0x504BCED1, 0xBF8E4E45), /* ~= 10^-111 */
+    U64(0xC06481FB, 0x9BCF8D39), U64(0xE45EC286, 0x2F71E1D6), /* ~= 10^-110 */
+    U64(0xF07DA27A, 0x82C37088), U64(0x5D767327, 0xBB4E5A4C), /* ~= 10^-109 */
+    U64(0x964E858C, 0x91BA2655), U64(0x3A6A07F8, 0xD510F86F), /* ~= 10^-108 */
+    U64(0xBBE226EF, 0xB628AFEA), U64(0x890489F7, 0x0A55368B), /* ~= 10^-107 */
+    U64(0xEADAB0AB, 0xA3B2DBE5), U64(0x2B45AC74, 0xCCEA842E), /* ~= 10^-106 */
+    U64(0x92C8AE6B, 0x464FC96F), U64(0x3B0B8BC9, 0x0012929D), /* ~= 10^-105 */
+    U64(0xB77ADA06, 0x17E3BBCB), U64(0x09CE6EBB, 0x40173744), /* ~= 10^-104 */
+    U64(0xE5599087, 0x9DDCAABD), U64(0xCC420A6A, 0x101D0515), /* ~= 10^-103 */
+    U64(0x8F57FA54, 0xC2A9EAB6), U64(0x9FA94682, 0x4A12232D), /* ~= 10^-102 */
+    U64(0xB32DF8E9, 0xF3546564), U64(0x47939822, 0xDC96ABF9), /* ~= 10^-101 */
+    U64(0xDFF97724, 0x70297EBD), U64(0x59787E2B, 0x93BC56F7), /* ~= 10^-100 */
+    U64(0x8BFBEA76, 0xC619EF36), U64(0x57EB4EDB, 0x3C55B65A), /* ~= 10^-99 */
+    U64(0xAEFAE514, 0x77A06B03), U64(0xEDE62292, 0x0B6B23F1), /* ~= 10^-98 */
+    U64(0xDAB99E59, 0x958885C4), U64(0xE95FAB36, 0x8E45ECED), /* ~= 10^-97 */
+    U64(0x88B402F7, 0xFD75539B), U64(0x11DBCB02, 0x18EBB414), /* ~= 10^-96 */
+    U64(0xAAE103B5, 0xFCD2A881), U64(0xD652BDC2, 0x9F26A119), /* ~= 10^-95 */
+    U64(0xD59944A3, 0x7C0752A2), U64(0x4BE76D33, 0x46F0495F), /* ~= 10^-94 */
+    U64(0x857FCAE6, 0x2D8493A5), U64(0x6F70A440, 0x0C562DDB), /* ~= 10^-93 */
+    U64(0xA6DFBD9F, 0xB8E5B88E), U64(0xCB4CCD50, 0x0F6BB952), /* ~= 10^-92 */
+    U64(0xD097AD07, 0xA71F26B2), U64(0x7E2000A4, 0x1346A7A7), /* ~= 10^-91 */
+    U64(0x825ECC24, 0xC873782F), U64(0x8ED40066, 0x8C0C28C8), /* ~= 10^-90 */
+    U64(0xA2F67F2D, 0xFA90563B), U64(0x72890080, 0x2F0F32FA), /* ~= 10^-89 */
+    U64(0xCBB41EF9, 0x79346BCA), U64(0x4F2B40A0, 0x3AD2FFB9), /* ~= 10^-88 */
+    U64(0xFEA126B7, 0xD78186BC), U64(0xE2F610C8, 0x4987BFA8), /* ~= 10^-87 */
+    U64(0x9F24B832, 0xE6B0F436), U64(0x0DD9CA7D, 0x2DF4D7C9), /* ~= 10^-86 */
+    U64(0xC6EDE63F, 0xA05D3143), U64(0x91503D1C, 0x79720DBB), /* ~= 10^-85 */
+    U64(0xF8A95FCF, 0x88747D94), U64(0x75A44C63, 0x97CE912A), /* ~= 10^-84 */
+    U64(0x9B69DBE1, 0xB548CE7C), U64(0xC986AFBE, 0x3EE11ABA), /* ~= 10^-83 */
+    U64(0xC24452DA, 0x229B021B), U64(0xFBE85BAD, 0xCE996168), /* ~= 10^-82 */
+    U64(0xF2D56790, 0xAB41C2A2), U64(0xFAE27299, 0x423FB9C3), /* ~= 10^-81 */
+    U64(0x97C560BA, 0x6B0919A5), U64(0xDCCD879F, 0xC967D41A), /* ~= 10^-80 */
+    U64(0xBDB6B8E9, 0x05CB600F), U64(0x5400E987, 0xBBC1C920), /* ~= 10^-79 */
+    U64(0xED246723, 0x473E3813), U64(0x290123E9, 0xAAB23B68), /* ~= 10^-78 */
+    U64(0x9436C076, 0x0C86E30B), U64(0xF9A0B672, 0x0AAF6521), /* ~= 10^-77 */
+    U64(0xB9447093, 0x8FA89BCE), U64(0xF808E40E, 0x8D5B3E69), /* ~= 10^-76 */
+    U64(0xE7958CB8, 0x7392C2C2), U64(0xB60B1D12, 0x30B20E04), /* ~= 10^-75 */
+    U64(0x90BD77F3, 0x483BB9B9), U64(0xB1C6F22B, 0x5E6F48C2), /* ~= 10^-74 */
+    U64(0xB4ECD5F0, 0x1A4AA828), U64(0x1E38AEB6, 0x360B1AF3), /* ~= 10^-73 */
+    U64(0xE2280B6C, 0x20DD5232), U64(0x25C6DA63, 0xC38DE1B0), /* ~= 10^-72 */
+    U64(0x8D590723, 0x948A535F), U64(0x579C487E, 0x5A38AD0E), /* ~= 10^-71 */
+    U64(0xB0AF48EC, 0x79ACE837), U64(0x2D835A9D, 0xF0C6D851), /* ~= 10^-70 */
+    U64(0xDCDB1B27, 0x98182244), U64(0xF8E43145, 0x6CF88E65), /* ~= 10^-69 */
+    U64(0x8A08F0F8, 0xBF0F156B), U64(0x1B8E9ECB, 0x641B58FF), /* ~= 10^-68 */
+    U64(0xAC8B2D36, 0xEED2DAC5), U64(0xE272467E, 0x3D222F3F), /* ~= 10^-67 */
+    U64(0xD7ADF884, 0xAA879177), U64(0x5B0ED81D, 0xCC6ABB0F), /* ~= 10^-66 */
+    U64(0x86CCBB52, 0xEA94BAEA), U64(0x98E94712, 0x9FC2B4E9), /* ~= 10^-65 */
+    U64(0xA87FEA27, 0xA539E9A5), U64(0x3F2398D7, 0x47B36224), /* ~= 10^-64 */
+    U64(0xD29FE4B1, 0x8E88640E), U64(0x8EEC7F0D, 0x19A03AAD), /* ~= 10^-63 */
+    U64(0x83A3EEEE, 0xF9153E89), U64(0x1953CF68, 0x300424AC), /* ~= 10^-62 */
+    U64(0xA48CEAAA, 0xB75A8E2B), U64(0x5FA8C342, 0x3C052DD7), /* ~= 10^-61 */
+    U64(0xCDB02555, 0x653131B6), U64(0x3792F412, 0xCB06794D), /* ~= 10^-60 */
+    U64(0x808E1755, 0x5F3EBF11), U64(0xE2BBD88B, 0xBEE40BD0), /* ~= 10^-59 */
+    U64(0xA0B19D2A, 0xB70E6ED6), U64(0x5B6ACEAE, 0xAE9D0EC4), /* ~= 10^-58 */
+    U64(0xC8DE0475, 0x64D20A8B), U64(0xF245825A, 0x5A445275), /* ~= 10^-57 */
+    U64(0xFB158592, 0xBE068D2E), U64(0xEED6E2F0, 0xF0D56712), /* ~= 10^-56 */
+    U64(0x9CED737B, 0xB6C4183D), U64(0x55464DD6, 0x9685606B), /* ~= 10^-55 */
+    U64(0xC428D05A, 0xA4751E4C), U64(0xAA97E14C, 0x3C26B886), /* ~= 10^-54 */
+    U64(0xF5330471, 0x4D9265DF), U64(0xD53DD99F, 0x4B3066A8), /* ~= 10^-53 */
+    U64(0x993FE2C6, 0xD07B7FAB), U64(0xE546A803, 0x8EFE4029), /* ~= 10^-52 */
+    U64(0xBF8FDB78, 0x849A5F96), U64(0xDE985204, 0x72BDD033), /* ~= 10^-51 */
+    U64(0xEF73D256, 0xA5C0F77C), U64(0x963E6685, 0x8F6D4440), /* ~= 10^-50 */
+    U64(0x95A86376, 0x27989AAD), U64(0xDDE70013, 0x79A44AA8), /* ~= 10^-49 */
+    U64(0xBB127C53, 0xB17EC159), U64(0x5560C018, 0x580D5D52), /* ~= 10^-48 */
+    U64(0xE9D71B68, 0x9DDE71AF), U64(0xAAB8F01E, 0x6E10B4A6), /* ~= 10^-47 */
+    U64(0x92267121, 0x62AB070D), U64(0xCAB39613, 0x04CA70E8), /* ~= 10^-46 */
+    U64(0xB6B00D69, 0xBB55C8D1), U64(0x3D607B97, 0xC5FD0D22), /* ~= 10^-45 */
+    U64(0xE45C10C4, 0x2A2B3B05), U64(0x8CB89A7D, 0xB77C506A), /* ~= 10^-44 */
+    U64(0x8EB98A7A, 0x9A5B04E3), U64(0x77F3608E, 0x92ADB242), /* ~= 10^-43 */
+    U64(0xB267ED19, 0x40F1C61C), U64(0x55F038B2, 0x37591ED3), /* ~= 10^-42 */
+    U64(0xDF01E85F, 0x912E37A3), U64(0x6B6C46DE, 0xC52F6688), /* ~= 10^-41 */
+    U64(0x8B61313B, 0xBABCE2C6), U64(0x2323AC4B, 0x3B3DA015), /* ~= 10^-40 */
+    U64(0xAE397D8A, 0xA96C1B77), U64(0xABEC975E, 0x0A0D081A), /* ~= 10^-39 */
+    U64(0xD9C7DCED, 0x53C72255), U64(0x96E7BD35, 0x8C904A21), /* ~= 10^-38 */
+    U64(0x881CEA14, 0x545C7575), U64(0x7E50D641, 0x77DA2E54), /* ~= 10^-37 */
+    U64(0xAA242499, 0x697392D2), U64(0xDDE50BD1, 0xD5D0B9E9), /* ~= 10^-36 */
+    U64(0xD4AD2DBF, 0xC3D07787), U64(0x955E4EC6, 0x4B44E864), /* ~= 10^-35 */
+    U64(0x84EC3C97, 0xDA624AB4), U64(0xBD5AF13B, 0xEF0B113E), /* ~= 10^-34 */
+    U64(0xA6274BBD, 0xD0FADD61), U64(0xECB1AD8A, 0xEACDD58E), /* ~= 10^-33 */
+    U64(0xCFB11EAD, 0x453994BA), U64(0x67DE18ED, 0xA5814AF2), /* ~= 10^-32 */
+    U64(0x81CEB32C, 0x4B43FCF4), U64(0x80EACF94, 0x8770CED7), /* ~= 10^-31 */
+    U64(0xA2425FF7, 0x5E14FC31), U64(0xA1258379, 0xA94D028D), /* ~= 10^-30 */
+    U64(0xCAD2F7F5, 0x359A3B3E), U64(0x096EE458, 0x13A04330), /* ~= 10^-29 */
+    U64(0xFD87B5F2, 0x8300CA0D), U64(0x8BCA9D6E, 0x188853FC), /* ~= 10^-28 */
+    U64(0x9E74D1B7, 0x91E07E48), U64(0x775EA264, 0xCF55347D), /* ~= 10^-27 */
+    U64(0xC6120625, 0x76589DDA), U64(0x95364AFE, 0x032A819D), /* ~= 10^-26 */
+    U64(0xF79687AE, 0xD3EEC551), U64(0x3A83DDBD, 0x83F52204), /* ~= 10^-25 */
+    U64(0x9ABE14CD, 0x44753B52), U64(0xC4926A96, 0x72793542), /* ~= 10^-24 */
+    U64(0xC16D9A00, 0x95928A27), U64(0x75B7053C, 0x0F178293), /* ~= 10^-23 */
+    U64(0xF1C90080, 0xBAF72CB1), U64(0x5324C68B, 0x12DD6338), /* ~= 10^-22 */
+    U64(0x971DA050, 0x74DA7BEE), U64(0xD3F6FC16, 0xEBCA5E03), /* ~= 10^-21 */
+    U64(0xBCE50864, 0x92111AEA), U64(0x88F4BB1C, 0xA6BCF584), /* ~= 10^-20 */
+    U64(0xEC1E4A7D, 0xB69561A5), U64(0x2B31E9E3, 0xD06C32E5), /* ~= 10^-19 */
+    U64(0x9392EE8E, 0x921D5D07), U64(0x3AFF322E, 0x62439FCF), /* ~= 10^-18 */
+    U64(0xB877AA32, 0x36A4B449), U64(0x09BEFEB9, 0xFAD487C2), /* ~= 10^-17 */
+    U64(0xE69594BE, 0xC44DE15B), U64(0x4C2EBE68, 0x7989A9B3), /* ~= 10^-16 */
+    U64(0x901D7CF7, 0x3AB0ACD9), U64(0x0F9D3701, 0x4BF60A10), /* ~= 10^-15 */
+    U64(0xB424DC35, 0x095CD80F), U64(0x538484C1, 0x9EF38C94), /* ~= 10^-14 */
+    U64(0xE12E1342, 0x4BB40E13), U64(0x2865A5F2, 0x06B06FB9), /* ~= 10^-13 */
+    U64(0x8CBCCC09, 0x6F5088CB), U64(0xF93F87B7, 0x442E45D3), /* ~= 10^-12 */
+    U64(0xAFEBFF0B, 0xCB24AAFE), U64(0xF78F69A5, 0x1539D748), /* ~= 10^-11 */
+    U64(0xDBE6FECE, 0xBDEDD5BE), U64(0xB573440E, 0x5A884D1B), /* ~= 10^-10 */
+    U64(0x89705F41, 0x36B4A597), U64(0x31680A88, 0xF8953030), /* ~= 10^-9 */
+    U64(0xABCC7711, 0x8461CEFC), U64(0xFDC20D2B, 0x36BA7C3D), /* ~= 10^-8 */
+    U64(0xD6BF94D5, 0xE57A42BC), U64(0x3D329076, 0x04691B4C), /* ~= 10^-7 */
+    U64(0x8637BD05, 0xAF6C69B5), U64(0xA63F9A49, 0xC2C1B10F), /* ~= 10^-6 */
+    U64(0xA7C5AC47, 0x1B478423), U64(0x0FCF80DC, 0x33721D53), /* ~= 10^-5 */
+    U64(0xD1B71758, 0xE219652B), U64(0xD3C36113, 0x404EA4A8), /* ~= 10^-4 */
+    U64(0x83126E97, 0x8D4FDF3B), U64(0x645A1CAC, 0x083126E9), /* ~= 10^-3 */
+    U64(0xA3D70A3D, 0x70A3D70A), U64(0x3D70A3D7, 0x0A3D70A3), /* ~= 10^-2 */
+    U64(0xCCCCCCCC, 0xCCCCCCCC), U64(0xCCCCCCCC, 0xCCCCCCCC), /* ~= 10^-1 */
+    U64(0x80000000, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^0 */
+    U64(0xA0000000, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^1 */
+    U64(0xC8000000, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^2 */
+    U64(0xFA000000, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^3 */
+    U64(0x9C400000, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^4 */
+    U64(0xC3500000, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^5 */
+    U64(0xF4240000, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^6 */
+    U64(0x98968000, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^7 */
+    U64(0xBEBC2000, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^8 */
+    U64(0xEE6B2800, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^9 */
+    U64(0x9502F900, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^10 */
+    U64(0xBA43B740, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^11 */
+    U64(0xE8D4A510, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^12 */
+    U64(0x9184E72A, 0x00000000), U64(0x00000000, 0x00000000), /* == 10^13 */
+    U64(0xB5E620F4, 0x80000000), U64(0x00000000, 0x00000000), /* == 10^14 */
+    U64(0xE35FA931, 0xA0000000), U64(0x00000000, 0x00000000), /* == 10^15 */
+    U64(0x8E1BC9BF, 0x04000000), U64(0x00000000, 0x00000000), /* == 10^16 */
+    U64(0xB1A2BC2E, 0xC5000000), U64(0x00000000, 0x00000000), /* == 10^17 */
+    U64(0xDE0B6B3A, 0x76400000), U64(0x00000000, 0x00000000), /* == 10^18 */
+    U64(0x8AC72304, 0x89E80000), U64(0x00000000, 0x00000000), /* == 10^19 */
+    U64(0xAD78EBC5, 0xAC620000), U64(0x00000000, 0x00000000), /* == 10^20 */
+    U64(0xD8D726B7, 0x177A8000), U64(0x00000000, 0x00000000), /* == 10^21 */
+    U64(0x87867832, 0x6EAC9000), U64(0x00000000, 0x00000000), /* == 10^22 */
+    U64(0xA968163F, 0x0A57B400), U64(0x00000000, 0x00000000), /* == 10^23 */
+    U64(0xD3C21BCE, 0xCCEDA100), U64(0x00000000, 0x00000000), /* == 10^24 */
+    U64(0x84595161, 0x401484A0), U64(0x00000000, 0x00000000), /* == 10^25 */
+    U64(0xA56FA5B9, 0x9019A5C8), U64(0x00000000, 0x00000000), /* == 10^26 */
+    U64(0xCECB8F27, 0xF4200F3A), U64(0x00000000, 0x00000000), /* == 10^27 */
+    U64(0x813F3978, 0xF8940984), U64(0x40000000, 0x00000000), /* == 10^28 */
+    U64(0xA18F07D7, 0x36B90BE5), U64(0x50000000, 0x00000000), /* == 10^29 */
+    U64(0xC9F2C9CD, 0x04674EDE), U64(0xA4000000, 0x00000000), /* == 10^30 */
+    U64(0xFC6F7C40, 0x45812296), U64(0x4D000000, 0x00000000), /* == 10^31 */
+    U64(0x9DC5ADA8, 0x2B70B59D), U64(0xF0200000, 0x00000000), /* == 10^32 */
+    U64(0xC5371912, 0x364CE305), U64(0x6C280000, 0x00000000), /* == 10^33 */
+    U64(0xF684DF56, 0xC3E01BC6), U64(0xC7320000, 0x00000000), /* == 10^34 */
+    U64(0x9A130B96, 0x3A6C115C), U64(0x3C7F4000, 0x00000000), /* == 10^35 */
+    U64(0xC097CE7B, 0xC90715B3), U64(0x4B9F1000, 0x00000000), /* == 10^36 */
+    U64(0xF0BDC21A, 0xBB48DB20), U64(0x1E86D400, 0x00000000), /* == 10^37 */
+    U64(0x96769950, 0xB50D88F4), U64(0x13144480, 0x00000000), /* == 10^38 */
+    U64(0xBC143FA4, 0xE250EB31), U64(0x17D955A0, 0x00000000), /* == 10^39 */
+    U64(0xEB194F8E, 0x1AE525FD), U64(0x5DCFAB08, 0x00000000), /* == 10^40 */
+    U64(0x92EFD1B8, 0xD0CF37BE), U64(0x5AA1CAE5, 0x00000000), /* == 10^41 */
+    U64(0xB7ABC627, 0x050305AD), U64(0xF14A3D9E, 0x40000000), /* == 10^42 */
+    U64(0xE596B7B0, 0xC643C719), U64(0x6D9CCD05, 0xD0000000), /* == 10^43 */
+    U64(0x8F7E32CE, 0x7BEA5C6F), U64(0xE4820023, 0xA2000000), /* == 10^44 */
+    U64(0xB35DBF82, 0x1AE4F38B), U64(0xDDA2802C, 0x8A800000), /* == 10^45 */
+    U64(0xE0352F62, 0xA19E306E), U64(0xD50B2037, 0xAD200000), /* == 10^46 */
+    U64(0x8C213D9D, 0xA502DE45), U64(0x4526F422, 0xCC340000), /* == 10^47 */
+    U64(0xAF298D05, 0x0E4395D6), U64(0x9670B12B, 0x7F410000), /* == 10^48 */
+    U64(0xDAF3F046, 0x51D47B4C), U64(0x3C0CDD76, 0x5F114000), /* == 10^49 */
+    U64(0x88D8762B, 0xF324CD0F), U64(0xA5880A69, 0xFB6AC800), /* == 10^50 */
+    U64(0xAB0E93B6, 0xEFEE0053), U64(0x8EEA0D04, 0x7A457A00), /* == 10^51 */
+    U64(0xD5D238A4, 0xABE98068), U64(0x72A49045, 0x98D6D880), /* == 10^52 */
+    U64(0x85A36366, 0xEB71F041), U64(0x47A6DA2B, 0x7F864750), /* == 10^53 */
+    U64(0xA70C3C40, 0xA64E6C51), U64(0x999090B6, 0x5F67D924), /* == 10^54 */
+    U64(0xD0CF4B50, 0xCFE20765), U64(0xFFF4B4E3, 0xF741CF6D), /* == 10^55 */
+    U64(0x82818F12, 0x81ED449F), U64(0xBFF8F10E, 0x7A8921A4), /* ~= 10^56 */
+    U64(0xA321F2D7, 0x226895C7), U64(0xAFF72D52, 0x192B6A0D), /* ~= 10^57 */
+    U64(0xCBEA6F8C, 0xEB02BB39), U64(0x9BF4F8A6, 0x9F764490), /* ~= 10^58 */
+    U64(0xFEE50B70, 0x25C36A08), U64(0x02F236D0, 0x4753D5B4), /* ~= 10^59 */
+    U64(0x9F4F2726, 0x179A2245), U64(0x01D76242, 0x2C946590), /* ~= 10^60 */
+    U64(0xC722F0EF, 0x9D80AAD6), U64(0x424D3AD2, 0xB7B97EF5), /* ~= 10^61 */
+    U64(0xF8EBAD2B, 0x84E0D58B), U64(0xD2E08987, 0x65A7DEB2), /* ~= 10^62 */
+    U64(0x9B934C3B, 0x330C8577), U64(0x63CC55F4, 0x9F88EB2F), /* ~= 10^63 */
+    U64(0xC2781F49, 0xFFCFA6D5), U64(0x3CBF6B71, 0xC76B25FB), /* ~= 10^64 */
+    U64(0xF316271C, 0x7FC3908A), U64(0x8BEF464E, 0x3945EF7A), /* ~= 10^65 */
+    U64(0x97EDD871, 0xCFDA3A56), U64(0x97758BF0, 0xE3CBB5AC), /* ~= 10^66 */
+    U64(0xBDE94E8E, 0x43D0C8EC), U64(0x3D52EEED, 0x1CBEA317), /* ~= 10^67 */
+    U64(0xED63A231, 0xD4C4FB27), U64(0x4CA7AAA8, 0x63EE4BDD), /* ~= 10^68 */
+    U64(0x945E455F, 0x24FB1CF8), U64(0x8FE8CAA9, 0x3E74EF6A), /* ~= 10^69 */
+    U64(0xB975D6B6, 0xEE39E436), U64(0xB3E2FD53, 0x8E122B44), /* ~= 10^70 */
+    U64(0xE7D34C64, 0xA9C85D44), U64(0x60DBBCA8, 0x7196B616), /* ~= 10^71 */
+    U64(0x90E40FBE, 0xEA1D3A4A), U64(0xBC8955E9, 0x46FE31CD), /* ~= 10^72 */
+    U64(0xB51D13AE, 0xA4A488DD), U64(0x6BABAB63, 0x98BDBE41), /* ~= 10^73 */
+    U64(0xE264589A, 0x4DCDAB14), U64(0xC696963C, 0x7EED2DD1), /* ~= 10^74 */
+    U64(0x8D7EB760, 0x70A08AEC), U64(0xFC1E1DE5, 0xCF543CA2), /* ~= 10^75 */
+    U64(0xB0DE6538, 0x8CC8ADA8), U64(0x3B25A55F, 0x43294BCB), /* ~= 10^76 */
+    U64(0xDD15FE86, 0xAFFAD912), U64(0x49EF0EB7, 0x13F39EBE), /* ~= 10^77 */
+    U64(0x8A2DBF14, 0x2DFCC7AB), U64(0x6E356932, 0x6C784337), /* ~= 10^78 */
+    U64(0xACB92ED9, 0x397BF996), U64(0x49C2C37F, 0x07965404), /* ~= 10^79 */
+    U64(0xD7E77A8F, 0x87DAF7FB), U64(0xDC33745E, 0xC97BE906), /* ~= 10^80 */
+    U64(0x86F0AC99, 0xB4E8DAFD), U64(0x69A028BB, 0x3DED71A3), /* ~= 10^81 */
+    U64(0xA8ACD7C0, 0x222311BC), U64(0xC40832EA, 0x0D68CE0C), /* ~= 10^82 */
+    U64(0xD2D80DB0, 0x2AABD62B), U64(0xF50A3FA4, 0x90C30190), /* ~= 10^83 */
+    U64(0x83C7088E, 0x1AAB65DB), U64(0x792667C6, 0xDA79E0FA), /* ~= 10^84 */
+    U64(0xA4B8CAB1, 0xA1563F52), U64(0x577001B8, 0x91185938), /* ~= 10^85 */
+    U64(0xCDE6FD5E, 0x09ABCF26), U64(0xED4C0226, 0xB55E6F86), /* ~= 10^86 */
+    U64(0x80B05E5A, 0xC60B6178), U64(0x544F8158, 0x315B05B4), /* ~= 10^87 */
+    U64(0xA0DC75F1, 0x778E39D6), U64(0x696361AE, 0x3DB1C721), /* ~= 10^88 */
+    U64(0xC913936D, 0xD571C84C), U64(0x03BC3A19, 0xCD1E38E9), /* ~= 10^89 */
+    U64(0xFB587849, 0x4ACE3A5F), U64(0x04AB48A0, 0x4065C723), /* ~= 10^90 */
+    U64(0x9D174B2D, 0xCEC0E47B), U64(0x62EB0D64, 0x283F9C76), /* ~= 10^91 */
+    U64(0xC45D1DF9, 0x42711D9A), U64(0x3BA5D0BD, 0x324F8394), /* ~= 10^92 */
+    U64(0xF5746577, 0x930D6500), U64(0xCA8F44EC, 0x7EE36479), /* ~= 10^93 */
+    U64(0x9968BF6A, 0xBBE85F20), U64(0x7E998B13, 0xCF4E1ECB), /* ~= 10^94 */
+    U64(0xBFC2EF45, 0x6AE276E8), U64(0x9E3FEDD8, 0xC321A67E), /* ~= 10^95 */
+    U64(0xEFB3AB16, 0xC59B14A2), U64(0xC5CFE94E, 0xF3EA101E), /* ~= 10^96 */
+    U64(0x95D04AEE, 0x3B80ECE5), U64(0xBBA1F1D1, 0x58724A12), /* ~= 10^97 */
+    U64(0xBB445DA9, 0xCA61281F), U64(0x2A8A6E45, 0xAE8EDC97), /* ~= 10^98 */
+    U64(0xEA157514, 0x3CF97226), U64(0xF52D09D7, 0x1A3293BD), /* ~= 10^99 */
+    U64(0x924D692C, 0xA61BE758), U64(0x593C2626, 0x705F9C56), /* ~= 10^100 */
+    U64(0xB6E0C377, 0xCFA2E12E), U64(0x6F8B2FB0, 0x0C77836C), /* ~= 10^101 */
+    U64(0xE498F455, 0xC38B997A), U64(0x0B6DFB9C, 0x0F956447), /* ~= 10^102 */
+    U64(0x8EDF98B5, 0x9A373FEC), U64(0x4724BD41, 0x89BD5EAC), /* ~= 10^103 */
+    U64(0xB2977EE3, 0x00C50FE7), U64(0x58EDEC91, 0xEC2CB657), /* ~= 10^104 */
+    U64(0xDF3D5E9B, 0xC0F653E1), U64(0x2F2967B6, 0x6737E3ED), /* ~= 10^105 */
+    U64(0x8B865B21, 0x5899F46C), U64(0xBD79E0D2, 0x0082EE74), /* ~= 10^106 */
+    U64(0xAE67F1E9, 0xAEC07187), U64(0xECD85906, 0x80A3AA11), /* ~= 10^107 */
+    U64(0xDA01EE64, 0x1A708DE9), U64(0xE80E6F48, 0x20CC9495), /* ~= 10^108 */
+    U64(0x884134FE, 0x908658B2), U64(0x3109058D, 0x147FDCDD), /* ~= 10^109 */
+    U64(0xAA51823E, 0x34A7EEDE), U64(0xBD4B46F0, 0x599FD415), /* ~= 10^110 */
+    U64(0xD4E5E2CD, 0xC1D1EA96), U64(0x6C9E18AC, 0x7007C91A), /* ~= 10^111 */
+    U64(0x850FADC0, 0x9923329E), U64(0x03E2CF6B, 0xC604DDB0), /* ~= 10^112 */
+    U64(0xA6539930, 0xBF6BFF45), U64(0x84DB8346, 0xB786151C), /* ~= 10^113 */
+    U64(0xCFE87F7C, 0xEF46FF16), U64(0xE6126418, 0x65679A63), /* ~= 10^114 */
+    U64(0x81F14FAE, 0x158C5F6E), U64(0x4FCB7E8F, 0x3F60C07E), /* ~= 10^115 */
+    U64(0xA26DA399, 0x9AEF7749), U64(0xE3BE5E33, 0x0F38F09D), /* ~= 10^116 */
+    U64(0xCB090C80, 0x01AB551C), U64(0x5CADF5BF, 0xD3072CC5), /* ~= 10^117 */
+    U64(0xFDCB4FA0, 0x02162A63), U64(0x73D9732F, 0xC7C8F7F6), /* ~= 10^118 */
+    U64(0x9E9F11C4, 0x014DDA7E), U64(0x2867E7FD, 0xDCDD9AFA), /* ~= 10^119 */
+    U64(0xC646D635, 0x01A1511D), U64(0xB281E1FD, 0x541501B8), /* ~= 10^120 */
+    U64(0xF7D88BC2, 0x4209A565), U64(0x1F225A7C, 0xA91A4226), /* ~= 10^121 */
+    U64(0x9AE75759, 0x6946075F), U64(0x3375788D, 0xE9B06958), /* ~= 10^122 */
+    U64(0xC1A12D2F, 0xC3978937), U64(0x0052D6B1, 0x641C83AE), /* ~= 10^123 */
+    U64(0xF209787B, 0xB47D6B84), U64(0xC0678C5D, 0xBD23A49A), /* ~= 10^124 */
+    U64(0x9745EB4D, 0x50CE6332), U64(0xF840B7BA, 0x963646E0), /* ~= 10^125 */
+    U64(0xBD176620, 0xA501FBFF), U64(0xB650E5A9, 0x3BC3D898), /* ~= 10^126 */
+    U64(0xEC5D3FA8, 0xCE427AFF), U64(0xA3E51F13, 0x8AB4CEBE), /* ~= 10^127 */
+    U64(0x93BA47C9, 0x80E98CDF), U64(0xC66F336C, 0x36B10137), /* ~= 10^128 */
+    U64(0xB8A8D9BB, 0xE123F017), U64(0xB80B0047, 0x445D4184), /* ~= 10^129 */
+    U64(0xE6D3102A, 0xD96CEC1D), U64(0xA60DC059, 0x157491E5), /* ~= 10^130 */
+    U64(0x9043EA1A, 0xC7E41392), U64(0x87C89837, 0xAD68DB2F), /* ~= 10^131 */
+    U64(0xB454E4A1, 0x79DD1877), U64(0x29BABE45, 0x98C311FB), /* ~= 10^132 */
+    U64(0xE16A1DC9, 0xD8545E94), U64(0xF4296DD6, 0xFEF3D67A), /* ~= 10^133 */
+    U64(0x8CE2529E, 0x2734BB1D), U64(0x1899E4A6, 0x5F58660C), /* ~= 10^134 */
+    U64(0xB01AE745, 0xB101E9E4), U64(0x5EC05DCF, 0xF72E7F8F), /* ~= 10^135 */
+    U64(0xDC21A117, 0x1D42645D), U64(0x76707543, 0xF4FA1F73), /* ~= 10^136 */
+    U64(0x899504AE, 0x72497EBA), U64(0x6A06494A, 0x791C53A8), /* ~= 10^137 */
+    U64(0xABFA45DA, 0x0EDBDE69), U64(0x0487DB9D, 0x17636892), /* ~= 10^138 */
+    U64(0xD6F8D750, 0x9292D603), U64(0x45A9D284, 0x5D3C42B6), /* ~= 10^139 */
+    U64(0x865B8692, 0x5B9BC5C2), U64(0x0B8A2392, 0xBA45A9B2), /* ~= 10^140 */
+    U64(0xA7F26836, 0xF282B732), U64(0x8E6CAC77, 0x68D7141E), /* ~= 10^141 */
+    U64(0xD1EF0244, 0xAF2364FF), U64(0x3207D795, 0x430CD926), /* ~= 10^142 */
+    U64(0x8335616A, 0xED761F1F), U64(0x7F44E6BD, 0x49E807B8), /* ~= 10^143 */
+    U64(0xA402B9C5, 0xA8D3A6E7), U64(0x5F16206C, 0x9C6209A6), /* ~= 10^144 */
+    U64(0xCD036837, 0x130890A1), U64(0x36DBA887, 0xC37A8C0F), /* ~= 10^145 */
+    U64(0x80222122, 0x6BE55A64), U64(0xC2494954, 0xDA2C9789), /* ~= 10^146 */
+    U64(0xA02AA96B, 0x06DEB0FD), U64(0xF2DB9BAA, 0x10B7BD6C), /* ~= 10^147 */
+    U64(0xC83553C5, 0xC8965D3D), U64(0x6F928294, 0x94E5ACC7), /* ~= 10^148 */
+    U64(0xFA42A8B7, 0x3ABBF48C), U64(0xCB772339, 0xBA1F17F9), /* ~= 10^149 */
+    U64(0x9C69A972, 0x84B578D7), U64(0xFF2A7604, 0x14536EFB), /* ~= 10^150 */
+    U64(0xC38413CF, 0x25E2D70D), U64(0xFEF51385, 0x19684ABA), /* ~= 10^151 */
+    U64(0xF46518C2, 0xEF5B8CD1), U64(0x7EB25866, 0x5FC25D69), /* ~= 10^152 */
+    U64(0x98BF2F79, 0xD5993802), U64(0xEF2F773F, 0xFBD97A61), /* ~= 10^153 */
+    U64(0xBEEEFB58, 0x4AFF8603), U64(0xAAFB550F, 0xFACFD8FA), /* ~= 10^154 */
+    U64(0xEEAABA2E, 0x5DBF6784), U64(0x95BA2A53, 0xF983CF38), /* ~= 10^155 */
+    U64(0x952AB45C, 0xFA97A0B2), U64(0xDD945A74, 0x7BF26183), /* ~= 10^156 */
+    U64(0xBA756174, 0x393D88DF), U64(0x94F97111, 0x9AEEF9E4), /* ~= 10^157 */
+    U64(0xE912B9D1, 0x478CEB17), U64(0x7A37CD56, 0x01AAB85D), /* ~= 10^158 */
+    U64(0x91ABB422, 0xCCB812EE), U64(0xAC62E055, 0xC10AB33A), /* ~= 10^159 */
+    U64(0xB616A12B, 0x7FE617AA), U64(0x577B986B, 0x314D6009), /* ~= 10^160 */
+    U64(0xE39C4976, 0x5FDF9D94), U64(0xED5A7E85, 0xFDA0B80B), /* ~= 10^161 */
+    U64(0x8E41ADE9, 0xFBEBC27D), U64(0x14588F13, 0xBE847307), /* ~= 10^162 */
+    U64(0xB1D21964, 0x7AE6B31C), U64(0x596EB2D8, 0xAE258FC8), /* ~= 10^163 */
+    U64(0xDE469FBD, 0x99A05FE3), U64(0x6FCA5F8E, 0xD9AEF3BB), /* ~= 10^164 */
+    U64(0x8AEC23D6, 0x80043BEE), U64(0x25DE7BB9, 0x480D5854), /* ~= 10^165 */
+    U64(0xADA72CCC, 0x20054AE9), U64(0xAF561AA7, 0x9A10AE6A), /* ~= 10^166 */
+    U64(0xD910F7FF, 0x28069DA4), U64(0x1B2BA151, 0x8094DA04), /* ~= 10^167 */
+    U64(0x87AA9AFF, 0x79042286), U64(0x90FB44D2, 0xF05D0842), /* ~= 10^168 */
+    U64(0xA99541BF, 0x57452B28), U64(0x353A1607, 0xAC744A53), /* ~= 10^169 */
+    U64(0xD3FA922F, 0x2D1675F2), U64(0x42889B89, 0x97915CE8), /* ~= 10^170 */
+    U64(0x847C9B5D, 0x7C2E09B7), U64(0x69956135, 0xFEBADA11), /* ~= 10^171 */
+    U64(0xA59BC234, 0xDB398C25), U64(0x43FAB983, 0x7E699095), /* ~= 10^172 */
+    U64(0xCF02B2C2, 0x1207EF2E), U64(0x94F967E4, 0x5E03F4BB), /* ~= 10^173 */
+    U64(0x8161AFB9, 0x4B44F57D), U64(0x1D1BE0EE, 0xBAC278F5), /* ~= 10^174 */
+    U64(0xA1BA1BA7, 0x9E1632DC), U64(0x6462D92A, 0x69731732), /* ~= 10^175 */
+    U64(0xCA28A291, 0x859BBF93), U64(0x7D7B8F75, 0x03CFDCFE), /* ~= 10^176 */
+    U64(0xFCB2CB35, 0xE702AF78), U64(0x5CDA7352, 0x44C3D43E), /* ~= 10^177 */
+    U64(0x9DEFBF01, 0xB061ADAB), U64(0x3A088813, 0x6AFA64A7), /* ~= 10^178 */
+    U64(0xC56BAEC2, 0x1C7A1916), U64(0x088AAA18, 0x45B8FDD0), /* ~= 10^179 */
+    U64(0xF6C69A72, 0xA3989F5B), U64(0x8AAD549E, 0x57273D45), /* ~= 10^180 */
+    U64(0x9A3C2087, 0xA63F6399), U64(0x36AC54E2, 0xF678864B), /* ~= 10^181 */
+    U64(0xC0CB28A9, 0x8FCF3C7F), U64(0x84576A1B, 0xB416A7DD), /* ~= 10^182 */
+    U64(0xF0FDF2D3, 0xF3C30B9F), U64(0x656D44A2, 0xA11C51D5), /* ~= 10^183 */
+    U64(0x969EB7C4, 0x7859E743), U64(0x9F644AE5, 0xA4B1B325), /* ~= 10^184 */
+    U64(0xBC4665B5, 0x96706114), U64(0x873D5D9F, 0x0DDE1FEE), /* ~= 10^185 */
+    U64(0xEB57FF22, 0xFC0C7959), U64(0xA90CB506, 0xD155A7EA), /* ~= 10^186 */
+    U64(0x9316FF75, 0xDD87CBD8), U64(0x09A7F124, 0x42D588F2), /* ~= 10^187 */
+    U64(0xB7DCBF53, 0x54E9BECE), U64(0x0C11ED6D, 0x538AEB2F), /* ~= 10^188 */
+    U64(0xE5D3EF28, 0x2A242E81), U64(0x8F1668C8, 0xA86DA5FA), /* ~= 10^189 */
+    U64(0x8FA47579, 0x1A569D10), U64(0xF96E017D, 0x694487BC), /* ~= 10^190 */
+    U64(0xB38D92D7, 0x60EC4455), U64(0x37C981DC, 0xC395A9AC), /* ~= 10^191 */
+    U64(0xE070F78D, 0x3927556A), U64(0x85BBE253, 0xF47B1417), /* ~= 10^192 */
+    U64(0x8C469AB8, 0x43B89562), U64(0x93956D74, 0x78CCEC8E), /* ~= 10^193 */
+    U64(0xAF584166, 0x54A6BABB), U64(0x387AC8D1, 0x970027B2), /* ~= 10^194 */
+    U64(0xDB2E51BF, 0xE9D0696A), U64(0x06997B05, 0xFCC0319E), /* ~= 10^195 */
+    U64(0x88FCF317, 0xF22241E2), U64(0x441FECE3, 0xBDF81F03), /* ~= 10^196 */
+    U64(0xAB3C2FDD, 0xEEAAD25A), U64(0xD527E81C, 0xAD7626C3), /* ~= 10^197 */
+    U64(0xD60B3BD5, 0x6A5586F1), U64(0x8A71E223, 0xD8D3B074), /* ~= 10^198 */
+    U64(0x85C70565, 0x62757456), U64(0xF6872D56, 0x67844E49), /* ~= 10^199 */
+    U64(0xA738C6BE, 0xBB12D16C), U64(0xB428F8AC, 0x016561DB), /* ~= 10^200 */
+    U64(0xD106F86E, 0x69D785C7), U64(0xE13336D7, 0x01BEBA52), /* ~= 10^201 */
+    U64(0x82A45B45, 0x0226B39C), U64(0xECC00246, 0x61173473), /* ~= 10^202 */
+    U64(0xA34D7216, 0x42B06084), U64(0x27F002D7, 0xF95D0190), /* ~= 10^203 */
+    U64(0xCC20CE9B, 0xD35C78A5), U64(0x31EC038D, 0xF7B441F4), /* ~= 10^204 */
+    U64(0xFF290242, 0xC83396CE), U64(0x7E670471, 0x75A15271), /* ~= 10^205 */
+    U64(0x9F79A169, 0xBD203E41), U64(0x0F0062C6, 0xE984D386), /* ~= 10^206 */
+    U64(0xC75809C4, 0x2C684DD1), U64(0x52C07B78, 0xA3E60868), /* ~= 10^207 */
+    U64(0xF92E0C35, 0x37826145), U64(0xA7709A56, 0xCCDF8A82), /* ~= 10^208 */
+    U64(0x9BBCC7A1, 0x42B17CCB), U64(0x88A66076, 0x400BB691), /* ~= 10^209 */
+    U64(0xC2ABF989, 0x935DDBFE), U64(0x6ACFF893, 0xD00EA435), /* ~= 10^210 */
+    U64(0xF356F7EB, 0xF83552FE), U64(0x0583F6B8, 0xC4124D43), /* ~= 10^211 */
+    U64(0x98165AF3, 0x7B2153DE), U64(0xC3727A33, 0x7A8B704A), /* ~= 10^212 */
+    U64(0xBE1BF1B0, 0x59E9A8D6), U64(0x744F18C0, 0x592E4C5C), /* ~= 10^213 */
+    U64(0xEDA2EE1C, 0x7064130C), U64(0x1162DEF0, 0x6F79DF73), /* ~= 10^214 */
+    U64(0x9485D4D1, 0xC63E8BE7), U64(0x8ADDCB56, 0x45AC2BA8), /* ~= 10^215 */
+    U64(0xB9A74A06, 0x37CE2EE1), U64(0x6D953E2B, 0xD7173692), /* ~= 10^216 */
+    U64(0xE8111C87, 0xC5C1BA99), U64(0xC8FA8DB6, 0xCCDD0437), /* ~= 10^217 */
+    U64(0x910AB1D4, 0xDB9914A0), U64(0x1D9C9892, 0x400A22A2), /* ~= 10^218 */
+    U64(0xB54D5E4A, 0x127F59C8), U64(0x2503BEB6, 0xD00CAB4B), /* ~= 10^219 */
+    U64(0xE2A0B5DC, 0x971F303A), U64(0x2E44AE64, 0x840FD61D), /* ~= 10^220 */
+    U64(0x8DA471A9, 0xDE737E24), U64(0x5CEAECFE, 0xD289E5D2), /* ~= 10^221 */
+    U64(0xB10D8E14, 0x56105DAD), U64(0x7425A83E, 0x872C5F47), /* ~= 10^222 */
+    U64(0xDD50F199, 0x6B947518), U64(0xD12F124E, 0x28F77719), /* ~= 10^223 */
+    U64(0x8A5296FF, 0xE33CC92F), U64(0x82BD6B70, 0xD99AAA6F), /* ~= 10^224 */
+    U64(0xACE73CBF, 0xDC0BFB7B), U64(0x636CC64D, 0x1001550B), /* ~= 10^225 */
+    U64(0xD8210BEF, 0xD30EFA5A), U64(0x3C47F7E0, 0x5401AA4E), /* ~= 10^226 */
+    U64(0x8714A775, 0xE3E95C78), U64(0x65ACFAEC, 0x34810A71), /* ~= 10^227 */
+    U64(0xA8D9D153, 0x5CE3B396), U64(0x7F1839A7, 0x41A14D0D), /* ~= 10^228 */
+    U64(0xD31045A8, 0x341CA07C), U64(0x1EDE4811, 0x1209A050), /* ~= 10^229 */
+    U64(0x83EA2B89, 0x2091E44D), U64(0x934AED0A, 0xAB460432), /* ~= 10^230 */
+    U64(0xA4E4B66B, 0x68B65D60), U64(0xF81DA84D, 0x5617853F), /* ~= 10^231 */
+    U64(0xCE1DE406, 0x42E3F4B9), U64(0x36251260, 0xAB9D668E), /* ~= 10^232 */
+    U64(0x80D2AE83, 0xE9CE78F3), U64(0xC1D72B7C, 0x6B426019), /* ~= 10^233 */
+    U64(0xA1075A24, 0xE4421730), U64(0xB24CF65B, 0x8612F81F), /* ~= 10^234 */
+    U64(0xC94930AE, 0x1D529CFC), U64(0xDEE033F2, 0x6797B627), /* ~= 10^235 */
+    U64(0xFB9B7CD9, 0xA4A7443C), U64(0x169840EF, 0x017DA3B1), /* ~= 10^236 */
+    U64(0x9D412E08, 0x06E88AA5), U64(0x8E1F2895, 0x60EE864E), /* ~= 10^237 */
+    U64(0xC491798A, 0x08A2AD4E), U64(0xF1A6F2BA, 0xB92A27E2), /* ~= 10^238 */
+    U64(0xF5B5D7EC, 0x8ACB58A2), U64(0xAE10AF69, 0x6774B1DB), /* ~= 10^239 */
+    U64(0x9991A6F3, 0xD6BF1765), U64(0xACCA6DA1, 0xE0A8EF29), /* ~= 10^240 */
+    U64(0xBFF610B0, 0xCC6EDD3F), U64(0x17FD090A, 0x58D32AF3), /* ~= 10^241 */
+    U64(0xEFF394DC, 0xFF8A948E), U64(0xDDFC4B4C, 0xEF07F5B0), /* ~= 10^242 */
+    U64(0x95F83D0A, 0x1FB69CD9), U64(0x4ABDAF10, 0x1564F98E), /* ~= 10^243 */
+    U64(0xBB764C4C, 0xA7A4440F), U64(0x9D6D1AD4, 0x1ABE37F1), /* ~= 10^244 */
+    U64(0xEA53DF5F, 0xD18D5513), U64(0x84C86189, 0x216DC5ED), /* ~= 10^245 */
+    U64(0x92746B9B, 0xE2F8552C), U64(0x32FD3CF5, 0xB4E49BB4), /* ~= 10^246 */
+    U64(0xB7118682, 0xDBB66A77), U64(0x3FBC8C33, 0x221DC2A1), /* ~= 10^247 */
+    U64(0xE4D5E823, 0x92A40515), U64(0x0FABAF3F, 0xEAA5334A), /* ~= 10^248 */
+    U64(0x8F05B116, 0x3BA6832D), U64(0x29CB4D87, 0xF2A7400E), /* ~= 10^249 */
+    U64(0xB2C71D5B, 0xCA9023F8), U64(0x743E20E9, 0xEF511012), /* ~= 10^250 */
+    U64(0xDF78E4B2, 0xBD342CF6), U64(0x914DA924, 0x6B255416), /* ~= 10^251 */
+    U64(0x8BAB8EEF, 0xB6409C1A), U64(0x1AD089B6, 0xC2F7548E), /* ~= 10^252 */
+    U64(0xAE9672AB, 0xA3D0C320), U64(0xA184AC24, 0x73B529B1), /* ~= 10^253 */
+    U64(0xDA3C0F56, 0x8CC4F3E8), U64(0xC9E5D72D, 0x90A2741E), /* ~= 10^254 */
+    U64(0x88658996, 0x17FB1871), U64(0x7E2FA67C, 0x7A658892), /* ~= 10^255 */
+    U64(0xAA7EEBFB, 0x9DF9DE8D), U64(0xDDBB901B, 0x98FEEAB7), /* ~= 10^256 */
+    U64(0xD51EA6FA, 0x85785631), U64(0x552A7422, 0x7F3EA565), /* ~= 10^257 */
+    U64(0x8533285C, 0x936B35DE), U64(0xD53A8895, 0x8F87275F), /* ~= 10^258 */
+    U64(0xA67FF273, 0xB8460356), U64(0x8A892ABA, 0xF368F137), /* ~= 10^259 */
+    U64(0xD01FEF10, 0xA657842C), U64(0x2D2B7569, 0xB0432D85), /* ~= 10^260 */
+    U64(0x8213F56A, 0x67F6B29B), U64(0x9C3B2962, 0x0E29FC73), /* ~= 10^261 */
+    U64(0xA298F2C5, 0x01F45F42), U64(0x8349F3BA, 0x91B47B8F), /* ~= 10^262 */
+    U64(0xCB3F2F76, 0x42717713), U64(0x241C70A9, 0x36219A73), /* ~= 10^263 */
+    U64(0xFE0EFB53, 0xD30DD4D7), U64(0xED238CD3, 0x83AA0110), /* ~= 10^264 */
+    U64(0x9EC95D14, 0x63E8A506), U64(0xF4363804, 0x324A40AA), /* ~= 10^265 */
+    U64(0xC67BB459, 0x7CE2CE48), U64(0xB143C605, 0x3EDCD0D5), /* ~= 10^266 */
+    U64(0xF81AA16F, 0xDC1B81DA), U64(0xDD94B786, 0x8E94050A), /* ~= 10^267 */
+    U64(0x9B10A4E5, 0xE9913128), U64(0xCA7CF2B4, 0x191C8326), /* ~= 10^268 */
+    U64(0xC1D4CE1F, 0x63F57D72), U64(0xFD1C2F61, 0x1F63A3F0), /* ~= 10^269 */
+    U64(0xF24A01A7, 0x3CF2DCCF), U64(0xBC633B39, 0x673C8CEC), /* ~= 10^270 */
+    U64(0x976E4108, 0x8617CA01), U64(0xD5BE0503, 0xE085D813), /* ~= 10^271 */
+    U64(0xBD49D14A, 0xA79DBC82), U64(0x4B2D8644, 0xD8A74E18), /* ~= 10^272 */
+    U64(0xEC9C459D, 0x51852BA2), U64(0xDDF8E7D6, 0x0ED1219E), /* ~= 10^273 */
+    U64(0x93E1AB82, 0x52F33B45), U64(0xCABB90E5, 0xC942B503), /* ~= 10^274 */
+    U64(0xB8DA1662, 0xE7B00A17), U64(0x3D6A751F, 0x3B936243), /* ~= 10^275 */
+    U64(0xE7109BFB, 0xA19C0C9D), U64(0x0CC51267, 0x0A783AD4), /* ~= 10^276 */
+    U64(0x906A617D, 0x450187E2), U64(0x27FB2B80, 0x668B24C5), /* ~= 10^277 */
+    U64(0xB484F9DC, 0x9641E9DA), U64(0xB1F9F660, 0x802DEDF6), /* ~= 10^278 */
+    U64(0xE1A63853, 0xBBD26451), U64(0x5E7873F8, 0xA0396973), /* ~= 10^279 */
+    U64(0x8D07E334, 0x55637EB2), U64(0xDB0B487B, 0x6423E1E8), /* ~= 10^280 */
+    U64(0xB049DC01, 0x6ABC5E5F), U64(0x91CE1A9A, 0x3D2CDA62), /* ~= 10^281 */
+    U64(0xDC5C5301, 0xC56B75F7), U64(0x7641A140, 0xCC7810FB), /* ~= 10^282 */
+    U64(0x89B9B3E1, 0x1B6329BA), U64(0xA9E904C8, 0x7FCB0A9D), /* ~= 10^283 */
+    U64(0xAC2820D9, 0x623BF429), U64(0x546345FA, 0x9FBDCD44), /* ~= 10^284 */
+    U64(0xD732290F, 0xBACAF133), U64(0xA97C1779, 0x47AD4095), /* ~= 10^285 */
+    U64(0x867F59A9, 0xD4BED6C0), U64(0x49ED8EAB, 0xCCCC485D), /* ~= 10^286 */
+    U64(0xA81F3014, 0x49EE8C70), U64(0x5C68F256, 0xBFFF5A74), /* ~= 10^287 */
+    U64(0xD226FC19, 0x5C6A2F8C), U64(0x73832EEC, 0x6FFF3111), /* ~= 10^288 */
+    U64(0x83585D8F, 0xD9C25DB7), U64(0xC831FD53, 0xC5FF7EAB), /* ~= 10^289 */
+    U64(0xA42E74F3, 0xD032F525), U64(0xBA3E7CA8, 0xB77F5E55), /* ~= 10^290 */
+    U64(0xCD3A1230, 0xC43FB26F), U64(0x28CE1BD2, 0xE55F35EB), /* ~= 10^291 */
+    U64(0x80444B5E, 0x7AA7CF85), U64(0x7980D163, 0xCF5B81B3), /* ~= 10^292 */
+    U64(0xA0555E36, 0x1951C366), U64(0xD7E105BC, 0xC332621F), /* ~= 10^293 */
+    U64(0xC86AB5C3, 0x9FA63440), U64(0x8DD9472B, 0xF3FEFAA7), /* ~= 10^294 */
+    U64(0xFA856334, 0x878FC150), U64(0xB14F98F6, 0xF0FEB951), /* ~= 10^295 */
+    U64(0x9C935E00, 0xD4B9D8D2), U64(0x6ED1BF9A, 0x569F33D3), /* ~= 10^296 */
+    U64(0xC3B83581, 0x09E84F07), U64(0x0A862F80, 0xEC4700C8), /* ~= 10^297 */
+    U64(0xF4A642E1, 0x4C6262C8), U64(0xCD27BB61, 0x2758C0FA), /* ~= 10^298 */
+    U64(0x98E7E9CC, 0xCFBD7DBD), U64(0x8038D51C, 0xB897789C), /* ~= 10^299 */
+    U64(0xBF21E440, 0x03ACDD2C), U64(0xE0470A63, 0xE6BD56C3), /* ~= 10^300 */
+    U64(0xEEEA5D50, 0x04981478), U64(0x1858CCFC, 0xE06CAC74), /* ~= 10^301 */
+    U64(0x95527A52, 0x02DF0CCB), U64(0x0F37801E, 0x0C43EBC8), /* ~= 10^302 */
+    U64(0xBAA718E6, 0x8396CFFD), U64(0xD3056025, 0x8F54E6BA), /* ~= 10^303 */
+    U64(0xE950DF20, 0x247C83FD), U64(0x47C6B82E, 0xF32A2069), /* ~= 10^304 */
+    U64(0x91D28B74, 0x16CDD27E), U64(0x4CDC331D, 0x57FA5441), /* ~= 10^305 */
+    U64(0xB6472E51, 0x1C81471D), U64(0xE0133FE4, 0xADF8E952), /* ~= 10^306 */
+    U64(0xE3D8F9E5, 0x63A198E5), U64(0x58180FDD, 0xD97723A6), /* ~= 10^307 */
+    U64(0x8E679C2F, 0x5E44FF8F), U64(0x570F09EA, 0xA7EA7648), /* ~= 10^308 */
+    U64(0xB201833B, 0x35D63F73), U64(0x2CD2CC65, 0x51E513DA), /* ~= 10^309 */
+    U64(0xDE81E40A, 0x034BCF4F), U64(0xF8077F7E, 0xA65E58D1), /* ~= 10^310 */
+    U64(0x8B112E86, 0x420F6191), U64(0xFB04AFAF, 0x27FAF782), /* ~= 10^311 */
+    U64(0xADD57A27, 0xD29339F6), U64(0x79C5DB9A, 0xF1F9B563), /* ~= 10^312 */
+    U64(0xD94AD8B1, 0xC7380874), U64(0x18375281, 0xAE7822BC), /* ~= 10^313 */
+    U64(0x87CEC76F, 0x1C830548), U64(0x8F229391, 0x0D0B15B5), /* ~= 10^314 */
+    U64(0xA9C2794A, 0xE3A3C69A), U64(0xB2EB3875, 0x504DDB22), /* ~= 10^315 */
+    U64(0xD433179D, 0x9C8CB841), U64(0x5FA60692, 0xA46151EB), /* ~= 10^316 */
+    U64(0x849FEEC2, 0x81D7F328), U64(0xDBC7C41B, 0xA6BCD333), /* ~= 10^317 */
+    U64(0xA5C7EA73, 0x224DEFF3), U64(0x12B9B522, 0x906C0800), /* ~= 10^318 */
+    U64(0xCF39E50F, 0xEAE16BEF), U64(0xD768226B, 0x34870A00), /* ~= 10^319 */
+    U64(0x81842F29, 0xF2CCE375), U64(0xE6A11583, 0x00D46640), /* ~= 10^320 */
+    U64(0xA1E53AF4, 0x6F801C53), U64(0x60495AE3, 0xC1097FD0), /* ~= 10^321 */
+    U64(0xCA5E89B1, 0x8B602368), U64(0x385BB19C, 0xB14BDFC4), /* ~= 10^322 */
+    U64(0xFCF62C1D, 0xEE382C42), U64(0x46729E03, 0xDD9ED7B5), /* ~= 10^323 */
+    U64(0x9E19DB92, 0xB4E31BA9), U64(0x6C07A2C2, 0x6A8346D1)  /* ~= 10^324 */
+};
+
+/**
+ Get the cached pow10 value from pow10_sig_table.
+ @param exp10 The exponent of pow(10, e). This value must in range
+              POW10_SIG_TABLE_MIN_EXP to POW10_SIG_TABLE_MAX_EXP.
+ @param hi    The highest 64 bits of pow(10, e).
+ @param lo    The lower 64 bits after `hi`.
+ */
+static_inline void pow10_table_get_sig(i32 exp10, u64* hi, u64* lo) {
+    i32 idx = exp10 - (POW10_SIG_TABLE_MIN_EXP);
+    *hi = pow10_sig_table[idx * 2];
+    *lo = pow10_sig_table[idx * 2 + 1];
+}
+
+/**
+ Get the exponent (base 2) for highest 64 bits significand in pow10_sig_table.
+ */
+static_inline void pow10_table_get_exp(i32 exp10, i32* exp2) {
+    /* e2 = floor(log2(pow(10, e))) - 64 + 1 */
+    /*    = floor(e * log2(10) - 63)         */
+    *exp2 = (exp10 * 217706 - 4128768) >> 16;
+}
+
+#endif
+
+/*==============================================================================
+ * JSON Character Matcher
+ *============================================================================*/
+
+/** Character type */
+typedef u8 char_type;
+
+/** Whitespace character: ' ', '\\t', '\\n', '\\r'. */
+static const char_type CHAR_TYPE_SPACE = 1 << 0;
+
+/** Number character: '-', [0-9]. */
+static const char_type CHAR_TYPE_NUMBER = 1 << 1;
+
+/** JSON Escaped character: '"', '\', [0x00-0x1F]. */
+static const char_type CHAR_TYPE_ESC_ASCII = 1 << 2;
+
+/** Non-ASCII character: [0x80-0xFF]. */
+static const char_type CHAR_TYPE_NON_ASCII = 1 << 3;
+
+/** JSON container character: '{', '['. */
+static const char_type CHAR_TYPE_CONTAINER = 1 << 4;
+
+/** Comment character: '/'. */
+static const char_type CHAR_TYPE_COMMENT = 1 << 5;
+
+/** Line end character: '\\n', '\\r', '\0'. */
+static const char_type CHAR_TYPE_LINE_END = 1 << 6;
+
+/** Hexadecimal numeric character: [0-9a-fA-F]. */
+static const char_type CHAR_TYPE_HEX = 1 << 7;
+
+/** Character type table (generate with misc/make_tables.c) */
+static const char_type char_table[256] = {0x44, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
+    0x05, 0x45, 0x04, 0x04, 0x45, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
+    0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x01, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x20, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82,
+    0x82, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x10, 0x04, 0x00, 0x00, 0x00, 0x00, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x00, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08};
+
+/** Match a character with specified type. */
+static_inline bool char_is_type(u8 c, char_type type) {
+    return (char_table[c] & type) != 0;
+}
+
+/** Match a whitespace: ' ', '\\t', '\\n', '\\r'. */
+static_inline bool char_is_space(u8 c) {
+    return char_is_type(c, (char_type)CHAR_TYPE_SPACE);
+}
+
+/** Match a whitespace or comment: ' ', '\\t', '\\n', '\\r', '/'. */
+static_inline bool char_is_space_or_comment(u8 c) {
+    return char_is_type(c, (char_type)(CHAR_TYPE_SPACE | CHAR_TYPE_COMMENT));
+}
+
+/** Match a JSON number: '-', [0-9]. */
+static_inline bool char_is_number(u8 c) {
+    return char_is_type(c, (char_type)CHAR_TYPE_NUMBER);
+}
+
+/** Match a JSON container: '{', '['. */
+static_inline bool char_is_container(u8 c) {
+    return char_is_type(c, (char_type)CHAR_TYPE_CONTAINER);
+}
+
+/** Match a stop character in ASCII string: '"', '\', [0x00-0x1F,0x80-0xFF]. */
+static_inline bool char_is_ascii_stop(u8 c) {
+    return char_is_type(c, (char_type)(CHAR_TYPE_ESC_ASCII | CHAR_TYPE_NON_ASCII));
+}
+
+/** Match a line end character: '\\n', '\\r', '\0'. */
+static_inline bool char_is_line_end(u8 c) {
+    return char_is_type(c, (char_type)CHAR_TYPE_LINE_END);
+}
+
+/** Match a hexadecimal numeric character: [0-9a-fA-F]. */
+static_inline bool char_is_hex(u8 c) {
+    return char_is_type(c, (char_type)CHAR_TYPE_HEX);
+}
+
+/*==============================================================================
+ * Digit Character Matcher
+ *============================================================================*/
+
+/** Digit type */
+typedef u8 digi_type;
+
+/** Digit: '0'. */
+static const digi_type DIGI_TYPE_ZERO = 1 << 0;
+
+/** Digit: [1-9]. */
+static const digi_type DIGI_TYPE_NONZERO = 1 << 1;
+
+/** Plus sign (positive): '+'. */
+static const digi_type DIGI_TYPE_POS = 1 << 2;
+
+/** Minus sign (negative): '-'. */
+static const digi_type DIGI_TYPE_NEG = 1 << 3;
+
+/** Decimal point: '.' */
+static const digi_type DIGI_TYPE_DOT = 1 << 4;
+
+/** Exponent sign: 'e, 'E'. */
+static const digi_type DIGI_TYPE_EXP = 1 << 5;
+
+/** Digit type table (generate with misc/make_tables.c) */
+static const digi_type digi_table[256] = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x04, 0x00, 0x08, 0x10, 0x00, 0x01, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02,
+    0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
+
+/** Match a character with specified type. */
+static_inline bool digi_is_type(u8 d, digi_type type) {
+    return (digi_table[d] & type) != 0;
+}
+
+/** Match a sign: '+', '-' */
+static_inline bool digi_is_sign(u8 d) {
+    return digi_is_type(d, (digi_type)(DIGI_TYPE_POS | DIGI_TYPE_NEG));
+}
+
+/** Match a none zero digit: [1-9] */
+static_inline bool digi_is_nonzero(u8 d) {
+    return digi_is_type(d, (digi_type)DIGI_TYPE_NONZERO);
+}
+
+/** Match a digit: [0-9] */
+static_inline bool digi_is_digit(u8 d) {
+    return digi_is_type(d, (digi_type)(DIGI_TYPE_ZERO | DIGI_TYPE_NONZERO));
+}
+
+/** Match an exponent sign: 'e', 'E'. */
+static_inline bool digi_is_exp(u8 d) {
+    return digi_is_type(d, (digi_type)DIGI_TYPE_EXP);
+}
+
+/** Match a floating point indicator: '.', 'e', 'E'. */
+static_inline bool digi_is_fp(u8 d) {
+    return digi_is_type(d, (digi_type)(DIGI_TYPE_DOT | DIGI_TYPE_EXP));
+}
+
+/** Match a digit or floating point indicator: [0-9], '.', 'e', 'E'. */
+static_inline bool digi_is_digit_or_fp(u8 d) {
+    return digi_is_type(d,
+        (digi_type)(DIGI_TYPE_ZERO | DIGI_TYPE_NONZERO | DIGI_TYPE_DOT | DIGI_TYPE_EXP));
+}
+
+#if !YYJSON_DISABLE_READER
+
+/*==============================================================================
+ * Hex Character Reader
+ * This function is used by JSON reader to read escaped characters.
+ *============================================================================*/
+
+/**
+ This table is used to convert 4 hex character sequence to a number.
+ A valid hex character [0-9A-Fa-f] will mapped to it's raw number [0x00, 0x0F],
+ an invalid hex character will mapped to [0xF0].
+ (generate with misc/make_tables.c)
+ */
+static const u8 hex_conv_table[256] = {0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0,
+    0xF0, 0xF0, 0xF0, 0xF0, 0xF0, 0xF0};
+
+/**
+ Scans an escaped character sequence as a UTF-16 code unit (branchless).
+ e.g. "\\u005C" should pass "005C" as `cur`.
+
+ This requires the string has 4-byte zero padding.
+ */
+static_inline bool read_hex_u16(const u8* cur, u16* val) {
+    u16 c0, c1, c2, c3, t0, t1;
+    c0 = hex_conv_table[cur[0]];
+    c1 = hex_conv_table[cur[1]];
+    c2 = hex_conv_table[cur[2]];
+    c3 = hex_conv_table[cur[3]];
+    t0 = (u16)((c0 << 8) | c2);
+    t1 = (u16)((c1 << 8) | c3);
+    *val = (u16)((t0 << 4) | t1);
+    return ((t0 | t1) & (u16)0xF0F0) == 0;
+}
+
+/*==============================================================================
+ * JSON Reader Utils
+ * These functions are used by JSON reader to read literals and comments.
+ *============================================================================*/
+
+/** Read 'true' literal, '*cur' should be 't'. */
+static_inline bool read_true(u8** ptr, yyjson_val* val) {
+    u8* cur = *ptr;
+    u8** end = ptr;
+    if (likely(byte_match_4(cur, "true"))) {
+        val->tag = YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_TRUE;
+        *end = cur + 4;
+        return true;
+    }
+    return false;
+}
+
+/** Read 'false' literal, '*cur' should be 'f'. */
+static_inline bool read_false(u8** ptr, yyjson_val* val) {
+    u8* cur = *ptr;
+    u8** end = ptr;
+    if (likely(byte_match_4(cur + 1, "alse"))) {
+        val->tag = YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_FALSE;
+        *end = cur + 5;
+        return true;
+    }
+    return false;
+}
+
+/** Read 'null' literal, '*cur' should be 'n'. */
+static_inline bool read_null(u8** ptr, yyjson_val* val) {
+    u8* cur = *ptr;
+    u8** end = ptr;
+    if (likely(byte_match_4(cur, "null"))) {
+        val->tag = YYJSON_TYPE_NULL;
+        *end = cur + 4;
+        return true;
+    }
+    return false;
+}
+
+/** Read 'Inf' or 'Infinity' literal (ignoring case). */
+static_inline bool read_inf(bool sign, u8** ptr, u8** pre, yyjson_val* val) {
+    u8* hdr = *ptr - sign;
+    u8* cur = *ptr;
+    u8** end = ptr;
+    if ((cur[0] == 'I' || cur[0] == 'i') && (cur[1] == 'N' || cur[1] == 'n') &&
+        (cur[2] == 'F' || cur[2] == 'f')) {
+        if ((cur[3] == 'I' || cur[3] == 'i') && (cur[4] == 'N' || cur[4] == 'n') &&
+            (cur[5] == 'I' || cur[5] == 'i') && (cur[6] == 'T' || cur[6] == 't') &&
+            (cur[7] == 'Y' || cur[7] == 'y')) {
+            cur += 8;
+        } else {
+            cur += 3;
+        }
+        *end = cur;
+        if (pre) {
+            /* add null-terminator for previous raw string */
+            if (*pre)
+                **pre = '\0';
+            *pre = cur;
+            val->tag = ((u64)(cur - hdr) << YYJSON_TAG_BIT) | YYJSON_TYPE_RAW;
+            val->uni.str = (const char*)hdr;
+        } else {
+            val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;
+            val->uni.u64 = f64_raw_get_inf(sign);
+        }
+        return true;
+    }
+    return false;
+}
+
+/** Read 'NaN' literal (ignoring case). */
+static_inline bool read_nan(bool sign, u8** ptr, u8** pre, yyjson_val* val) {
+    u8* hdr = *ptr - sign;
+    u8* cur = *ptr;
+    u8** end = ptr;
+    if ((cur[0] == 'N' || cur[0] == 'n') && (cur[1] == 'A' || cur[1] == 'a') &&
+        (cur[2] == 'N' || cur[2] == 'n')) {
+        cur += 3;
+        *end = cur;
+        if (pre) {
+            /* add null-terminator for previous raw string */
+            if (*pre)
+                **pre = '\0';
+            *pre = cur;
+            val->tag = ((u64)(cur - hdr) << YYJSON_TAG_BIT) | YYJSON_TYPE_RAW;
+            val->uni.str = (const char*)hdr;
+        } else {
+            val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;
+            val->uni.u64 = f64_raw_get_nan(sign);
+        }
+        return true;
+    }
+    return false;
+}
+
+/** Read 'Inf', 'Infinity' or 'NaN' literal (ignoring case). */
+static_inline bool read_inf_or_nan(bool sign, u8** ptr, u8** pre, yyjson_val* val) {
+    if (read_inf(sign, ptr, pre, val))
+        return true;
+    if (read_nan(sign, ptr, pre, val))
+        return true;
+    return false;
+}
+
+/** Read a JSON number as raw string. */
+static_noinline bool read_number_raw(u8** ptr, u8** pre, yyjson_read_flag flg, yyjson_val* val,
+    const char** msg) {
+
+#define return_err(_pos, _msg)                                                                     \
+    do {                                                                                           \
+        *msg = _msg;                                                                               \
+        *end = _pos;                                                                               \
+        return false;                                                                              \
+    } while (false)
+
+#define return_raw()                                                                               \
+    do {                                                                                           \
+        val->tag = ((u64)(cur - hdr) << YYJSON_TAG_BIT) | YYJSON_TYPE_RAW;                         \
+        val->uni.str = (const char*)hdr;                                                           \
+        *pre = cur;                                                                                \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+    u8* hdr = *ptr;
+    u8* cur = *ptr;
+    u8** end = ptr;
+
+    /* add null-terminator for previous raw string */
+    if (*pre)
+        **pre = '\0';
+
+    /* skip sign */
+    cur += (*cur == '-');
+
+    /* read first digit, check leading zero */
+    if (unlikely(!digi_is_digit(*cur))) {
+        if (has_read_flag(ALLOW_INF_AND_NAN)) {
+            if (read_inf_or_nan(*hdr == '-', &cur, pre, val))
+                return_raw();
+        }
+        return_err(cur, "no digit after minus sign");
+    }
+
+    /* read integral part */
+    if (*cur == '0') {
+        cur++;
+        if (unlikely(digi_is_digit(*cur))) {
+            return_err(cur - 1, "number with leading zero is not allowed");
+        }
+        if (!digi_is_fp(*cur))
+            return_raw();
+    } else {
+        while (digi_is_digit(*cur))
+            cur++;
+        if (!digi_is_fp(*cur))
+            return_raw();
+    }
+
+    /* read fraction part */
+    if (*cur == '.') {
+        cur++;
+        if (!digi_is_digit(*cur++)) {
+            return_err(cur, "no digit after decimal point");
+        }
+        while (digi_is_digit(*cur))
+            cur++;
+    }
+
+    /* read exponent part */
+    if (digi_is_exp(*cur)) {
+        cur += 1 + digi_is_sign(cur[1]);
+        if (!digi_is_digit(*cur++)) {
+            return_err(cur, "no digit after exponent sign");
+        }
+        while (digi_is_digit(*cur))
+            cur++;
+    }
+
+    return_raw();
+
+#undef return_err
+#undef return_raw
+}
+
+/**
+ Skips spaces and comments as many as possible.
+
+ It will return false in these cases:
+    1. No character is skipped. The 'end' pointer is set as input cursor.
+    2. A multiline comment is not closed. The 'end' pointer is set as the head
+       of this comment block.
+ */
+static_noinline bool skip_spaces_and_comments(u8** ptr) {
+    u8* hdr = *ptr;
+    u8* cur = *ptr;
+    u8** end = ptr;
+    while (true) {
+        if (byte_match_2(cur, "/*")) {
+            hdr = cur;
+            cur += 2;
+            while (true) {
+                if (byte_match_2(cur, "*/")) {
+                    cur += 2;
+                    break;
+                }
+                if (*cur == 0) {
+                    *end = hdr;
+                    return false;
+                }
+                cur++;
+            }
+            continue;
+        }
+        if (byte_match_2(cur, "//")) {
+            cur += 2;
+            while (!char_is_line_end(*cur))
+                cur++;
+            continue;
+        }
+        if (char_is_space(*cur)) {
+            cur += 1;
+            while (char_is_space(*cur))
+                cur++;
+            continue;
+        }
+        break;
+    }
+    *end = cur;
+    return hdr != cur;
+}
+
+/**
+ Check truncated string.
+ Returns true if `cur` match `str` but is truncated.
+ */
+static_inline bool is_truncated_str(u8* cur, u8* end, const char* str, bool case_sensitive) {
+    usize len = strlen(str);
+    if (cur + len <= end || end <= cur)
+        return false;
+    if (case_sensitive) {
+        return memcmp(cur, str, (usize)(end - cur)) == 0;
+    }
+    for (; cur < end; cur++, str++) {
+        if ((*cur != (u8)*str) && (*cur != (u8)*str - 'a' + 'A')) {
+            return false;
+        }
+    }
+    return true;
+}
+
+/**
+ Check truncated JSON on parsing errors.
+ Returns true if the input is valid but truncated.
+ */
+static_noinline bool is_truncated_end(u8* hdr, u8* cur, u8* end, yyjson_read_code code,
+    yyjson_read_flag flg) {
+    if (cur >= end)
+        return true;
+    if (code == YYJSON_READ_ERROR_LITERAL) {
+        if (is_truncated_str(cur, end, "true", true) || is_truncated_str(cur, end, "false", true) ||
+            is_truncated_str(cur, end, "null", true)) {
+            return true;
+        }
+    }
+    if (code == YYJSON_READ_ERROR_UNEXPECTED_CHARACTER ||
+        code == YYJSON_READ_ERROR_INVALID_NUMBER || code == YYJSON_READ_ERROR_LITERAL) {
+        if (has_read_flag(ALLOW_INF_AND_NAN)) {
+            if (*cur == '-')
+                cur++;
+            if (is_truncated_str(cur, end, "infinity", false) ||
+                is_truncated_str(cur, end, "nan", false)) {
+                return true;
+            }
+        }
+    }
+    if (code == YYJSON_READ_ERROR_UNEXPECTED_CONTENT) {
+        if (has_read_flag(ALLOW_INF_AND_NAN)) {
+            if (hdr + 3 <= cur && is_truncated_str(cur - 3, end, "infinity", false)) {
+                return true; /* e.g. infin would be read as inf + in */
+            }
+        }
+    }
+    if (code == YYJSON_READ_ERROR_INVALID_STRING) {
+        usize len = (usize)(end - cur);
+
+        /* unicode escape sequence */
+        if (*cur == '\\') {
+            if (len == 1)
+                return true;
+            if (len <= 5) {
+                if (*++cur != 'u')
+                    return false;
+                for (++cur; cur < end; cur++) {
+                    if (!char_is_hex(*cur))
+                        return false;
+                }
+                return true;
+            }
+            return false;
+        }
+
+        /* 2 to 4 bytes UTF-8, see `read_string()` for details. */
+        if (*cur & 0x80) {
+            u8 c0 = cur[0], c1 = cur[1], c2 = cur[2];
+            if (len == 1) {
+                /* 2 bytes UTF-8, truncated */
+                if ((c0 & 0xE0) == 0xC0 && (c0 & 0x1E) != 0x00)
+                    return true;
+                /* 3 bytes UTF-8, truncated */
+                if ((c0 & 0xF0) == 0xE0)
+                    return true;
+                /* 4 bytes UTF-8, truncated */
+                if ((c0 & 0xF8) == 0xF0 && (c0 & 0x07) <= 0x04)
+                    return true;
+            }
+            if (len == 2) {
+                /* 3 bytes UTF-8, truncated */
+                if ((c0 & 0xF0) == 0xE0 && (c1 & 0xC0) == 0x80) {
+                    u8 pat = (u8)(((c0 & 0x0F) << 1) | ((c1 & 0x20) >> 5));
+                    return 0x01 <= pat && pat != 0x1B;
+                }
+                /* 4 bytes UTF-8, truncated */
+                if ((c0 & 0xF8) == 0xF0 && (c1 & 0xC0) == 0x80) {
+                    u8 pat = (u8)(((c0 & 0x07) << 2) | ((c1 & 0x30) >> 4));
+                    return 0x01 <= pat && pat <= 0x10;
+                }
+            }
+            if (len == 3) {
+                /* 4 bytes UTF-8, truncated */
+                if ((c0 & 0xF8) == 0xF0 && (c1 & 0xC0) == 0x80 && (c2 & 0xC0) == 0x80) {
+                    u8 pat = (u8)(((c0 & 0x07) << 2) | ((c1 & 0x30) >> 4));
+                    return 0x01 <= pat && pat <= 0x10;
+                }
+            }
+        }
+    }
+    return false;
+}
+
+#if YYJSON_HAS_IEEE_754 && !YYJSON_DISABLE_FAST_FP_CONV /* FP_READER */
+
+/*==============================================================================
+ * BigInt For Floating Point Number Reader
+ *
+ * The bigint algorithm is used by floating-point number reader to get correctly
+ * rounded result for numbers with lots of digits. This part of code is rarely
+ * used for common numbers.
+ *============================================================================*/
+
+/** Maximum exponent of exact pow10 */
+#define U64_POW10_MAX_EXP 19
+
+/** Table: [ 10^0, ..., 10^19 ] (generate with misc/make_tables.c) */
+static const u64 u64_pow10_table[U64_POW10_MAX_EXP + 1] = {U64(0x00000000, 0x00000001),
+    U64(0x00000000, 0x0000000A), U64(0x00000000, 0x00000064), U64(0x00000000, 0x000003E8),
+    U64(0x00000000, 0x00002710), U64(0x00000000, 0x000186A0), U64(0x00000000, 0x000F4240),
+    U64(0x00000000, 0x00989680), U64(0x00000000, 0x05F5E100), U64(0x00000000, 0x3B9ACA00),
+    U64(0x00000002, 0x540BE400), U64(0x00000017, 0x4876E800), U64(0x000000E8, 0xD4A51000),
+    U64(0x00000918, 0x4E72A000), U64(0x00005AF3, 0x107A4000), U64(0x00038D7E, 0xA4C68000),
+    U64(0x002386F2, 0x6FC10000), U64(0x01634578, 0x5D8A0000), U64(0x0DE0B6B3, 0xA7640000),
+    U64(0x8AC72304, 0x89E80000)};
+
+/** Maximum numbers of chunks used by a bigint (58 is enough here). */
+#define BIGINT_MAX_CHUNKS 64
+
+/** Unsigned arbitrarily large integer */
+typedef struct bigint {
+    u32 used;                    /* used chunks count, should not be 0 */
+    u64 bits[BIGINT_MAX_CHUNKS]; /* chunks */
+} bigint;
+
+/**
+ Evaluate 'big += val'.
+ @param big A big number (can be 0).
+ @param val An unsigned integer (can be 0).
+ */
+static_inline void bigint_add_u64(bigint* big, u64 val) {
+    u32 idx, max;
+    u64 num = big->bits[0];
+    u64 add = num + val;
+    big->bits[0] = add;
+    if (likely((add >= num) || (add >= val)))
+        return;
+    for ((void)(idx = 1), max = big->used; idx < max; idx++) {
+        if (likely(big->bits[idx] != U64_MAX)) {
+            big->bits[idx] += 1;
+            return;
+        }
+        big->bits[idx] = 0;
+    }
+    big->bits[big->used++] = 1;
+}
+
+/**
+ Evaluate 'big *= val'.
+ @param big A big number (can be 0).
+ @param val An unsigned integer (cannot be 0).
+ */
+static_inline void bigint_mul_u64(bigint* big, u64 val) {
+    u32 idx = 0, max = big->used;
+    u64 hi, lo, carry = 0;
+    for (; idx < max; idx++) {
+        if (big->bits[idx])
+            break;
+    }
+    for (; idx < max; idx++) {
+        u128_mul_add(big->bits[idx], val, carry, &hi, &lo);
+        big->bits[idx] = lo;
+        carry = hi;
+    }
+    if (carry)
+        big->bits[big->used++] = carry;
+}
+
+/**
+ Evaluate 'big *= 2^exp'.
+ @param big A big number (can be 0).
+ @param exp An exponent integer (can be 0).
+ */
+static_inline void bigint_mul_pow2(bigint* big, u32 exp) {
+    u32 shft = exp % 64;
+    u32 move = exp / 64;
+    u32 idx = big->used;
+    if (unlikely(shft == 0)) {
+        for (; idx > 0; idx--) {
+            big->bits[idx + move - 1] = big->bits[idx - 1];
+        }
+        big->used += move;
+        while (move)
+            big->bits[--move] = 0;
+    } else {
+        big->bits[idx] = 0;
+        for (; idx > 0; idx--) {
+            u64 num = big->bits[idx] << shft;
+            num |= big->bits[idx - 1] >> (64 - shft);
+            big->bits[idx + move] = num;
+        }
+        big->bits[move] = big->bits[0] << shft;
+        big->used += move + (big->bits[big->used + move] > 0);
+        while (move)
+            big->bits[--move] = 0;
+    }
+}
+
+/**
+ Evaluate 'big *= 10^exp'.
+ @param big A big number (can be 0).
+ @param exp An exponent integer (cannot be 0).
+ */
+static_inline void bigint_mul_pow10(bigint* big, i32 exp) {
+    for (; exp >= U64_POW10_MAX_EXP; exp -= U64_POW10_MAX_EXP) {
+        bigint_mul_u64(big, u64_pow10_table[U64_POW10_MAX_EXP]);
+    }
+    if (exp) {
+        bigint_mul_u64(big, u64_pow10_table[exp]);
+    }
+}
+
+/**
+ Compare two bigint.
+ @return -1 if 'a < b', +1 if 'a > b', 0 if 'a == b'.
+ */
+static_inline i32 bigint_cmp(bigint* a, bigint* b) {
+    u32 idx = a->used;
+    if (a->used < b->used)
+        return -1;
+    if (a->used > b->used)
+        return +1;
+    while (idx-- > 0) {
+        u64 av = a->bits[idx];
+        u64 bv = b->bits[idx];
+        if (av < bv)
+            return -1;
+        if (av > bv)
+            return +1;
+    }
+    return 0;
+}
+
+/**
+ Evaluate 'big = val'.
+ @param big A big number (can be 0).
+ @param val An unsigned integer (can be 0).
+ */
+static_inline void bigint_set_u64(bigint* big, u64 val) {
+    big->used = 1;
+    big->bits[0] = val;
+}
+
+/** Set a bigint with floating point number string. */
+static_noinline void bigint_set_buf(bigint* big, u64 sig, i32* exp, u8* sig_cut, u8* sig_end,
+    u8* dot_pos) {
+
+    if (unlikely(!sig_cut)) {
+        /* no digit cut, set significant part only */
+        bigint_set_u64(big, sig);
+        return;
+
+    } else {
+        /* some digits were cut, read them from 'sig_cut' to 'sig_end' */
+        u8* hdr = sig_cut;
+        u8* cur = hdr;
+        u32 len = 0;
+        u64 val = 0;
+        bool dig_big_cut = false;
+        bool has_dot = (hdr < dot_pos) & (dot_pos < sig_end);
+        u32 dig_len_total = U64_SAFE_DIG + (u32)(sig_end - hdr) - has_dot;
+
+        sig -= (*sig_cut >= '5'); /* sig was rounded before */
+        if (dig_len_total > F64_MAX_DEC_DIG) {
+            dig_big_cut = true;
+            sig_end -= dig_len_total - (F64_MAX_DEC_DIG + 1);
+            sig_end -= (dot_pos + 1 == sig_end);
+            dig_len_total = (F64_MAX_DEC_DIG + 1);
+        }
+        *exp -= (i32)dig_len_total - U64_SAFE_DIG;
+
+        big->used = 1;
+        big->bits[0] = sig;
+        while (cur < sig_end) {
+            if (likely(cur != dot_pos)) {
+                val = val * 10 + (u8)(*cur++ - '0');
+                len++;
+                if (unlikely(cur == sig_end && dig_big_cut)) {
+                    /* The last digit must be non-zero,    */
+                    /* set it to '1' for correct rounding. */
+                    val = val - (val % 10) + 1;
+                }
+                if (len == U64_SAFE_DIG || cur == sig_end) {
+                    bigint_mul_pow10(big, (i32)len);
+                    bigint_add_u64(big, val);
+                    val = 0;
+                    len = 0;
+                }
+            } else {
+                cur++;
+            }
+        }
+    }
+}
+
+/*==============================================================================
+ * Diy Floating Point
+ *============================================================================*/
+
+/** "Do It Yourself Floating Point" struct. */
+typedef struct diy_fp {
+    u64 sig; /* significand */
+    i32 exp; /* exponent, base 2 */
+    i32 pad; /* padding, useless */
+} diy_fp;
+
+/** Get cached rounded diy_fp with pow(10, e) The input value must in range
+    [POW10_SIG_TABLE_MIN_EXP, POW10_SIG_TABLE_MAX_EXP]. */
+static_inline diy_fp diy_fp_get_cached_pow10(i32 exp10) {
+    diy_fp fp;
+    u64 sig_ext;
+    pow10_table_get_sig(exp10, &fp.sig, &sig_ext);
+    pow10_table_get_exp(exp10, &fp.exp);
+    fp.sig += (sig_ext >> 63);
+    return fp;
+}
+
+/** Returns fp * fp2. */
+static_inline diy_fp diy_fp_mul(diy_fp fp, diy_fp fp2) {
+    u64 hi, lo;
+    u128_mul(fp.sig, fp2.sig, &hi, &lo);
+    fp.sig = hi + (lo >> 63);
+    fp.exp += fp2.exp + 64;
+    return fp;
+}
+
+/** Convert diy_fp to IEEE-754 raw value. */
+static_inline u64 diy_fp_to_ieee_raw(diy_fp fp) {
+    u64 sig = fp.sig;
+    i32 exp = fp.exp;
+    u32 lz_bits;
+    if (unlikely(fp.sig == 0))
+        return 0;
+
+    lz_bits = u64_lz_bits(sig);
+    sig <<= lz_bits;
+    sig >>= F64_BITS - F64_SIG_FULL_BITS;
+    exp -= (i32)lz_bits;
+    exp += F64_BITS - F64_SIG_FULL_BITS;
+    exp += F64_SIG_BITS;
+
+    if (unlikely(exp >= F64_MAX_BIN_EXP)) {
+        /* overflow */
+        return F64_RAW_INF;
+    } else if (likely(exp >= F64_MIN_BIN_EXP - 1)) {
+        /* normal */
+        exp += F64_EXP_BIAS;
+        return ((u64)exp << F64_SIG_BITS) | (sig & F64_SIG_MASK);
+    } else if (likely(exp >= F64_MIN_BIN_EXP - F64_SIG_FULL_BITS)) {
+        /* subnormal */
+        return sig >> (F64_MIN_BIN_EXP - exp - 1);
+    } else {
+        /* underflow */
+        return 0;
+    }
+}
+
+/*==============================================================================
+ * JSON Number Reader (IEEE-754)
+ *============================================================================*/
+
+/** Maximum exact pow10 exponent for double value. */
+#define F64_POW10_EXP_MAX_EXACT 22
+
+/** Cached pow10 table. */
+static const f64 f64_pow10_table[] = {1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11,
+    1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19, 1e20, 1e21, 1e22};
+
+/**
+ Read a JSON number.
+
+ 1. This function assume that the floating-point number is in IEEE-754 format.
+ 2. This function support uint64/int64/double number. If an integer number
+    cannot fit in uint64/int64, it will returns as a double number. If a double
+    number is infinite, the return value is based on flag.
+ 3. This function (with inline attribute) may generate a lot of instructions.
+ */
+static_inline bool read_number(u8** ptr, u8** pre, yyjson_read_flag flg, yyjson_val* val,
+    const char** msg) {
+
+#define return_err(_pos, _msg)                                                                     \
+    do {                                                                                           \
+        *msg = _msg;                                                                               \
+        *end = _pos;                                                                               \
+        return false;                                                                              \
+    } while (false)
+
+#define return_0()                                                                                 \
+    do {                                                                                           \
+        val->tag = YYJSON_TYPE_NUM | (u8)((u8)sign << 3);                                          \
+        val->uni.u64 = 0;                                                                          \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+#define return_i64(_v)                                                                             \
+    do {                                                                                           \
+        val->tag = YYJSON_TYPE_NUM | (u8)((u8)sign << 3);                                          \
+        val->uni.u64 = (u64)(sign ? (u64)(~(_v) + 1) : (u64)(_v));                                 \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+#define return_f64(_v)                                                                             \
+    do {                                                                                           \
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;                                          \
+        val->uni.f64 = sign ? -(f64)(_v) : (f64)(_v);                                              \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+#define return_f64_bin(_v)                                                                         \
+    do {                                                                                           \
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;                                          \
+        val->uni.u64 = ((u64)sign << 63) | (u64)(_v);                                              \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+#define return_inf()                                                                               \
+    do {                                                                                           \
+        if (has_read_flag(BIGNUM_AS_RAW))                                                          \
+            return_raw();                                                                          \
+        if (has_read_flag(ALLOW_INF_AND_NAN))                                                      \
+            return_f64_bin(F64_RAW_INF);                                                           \
+        else                                                                                       \
+            return_err(hdr, "number is infinity when parsed as double");                           \
+    } while (false)
+
+#define return_raw()                                                                               \
+    do {                                                                                           \
+        if (*pre)                                                                                  \
+            **pre = '\0'; /* add null-terminator for previous raw string */                        \
+        val->tag = ((u64)(cur - hdr) << YYJSON_TAG_BIT) | YYJSON_TYPE_RAW;                         \
+        val->uni.str = (const char*)hdr;                                                           \
+        *pre = cur;                                                                                \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+    u8* sig_cut = NULL; /* significant part cutting position for long number */
+    u8* sig_end = NULL; /* significant part ending position */
+    u8* dot_pos = NULL; /* decimal point position */
+
+    u64 sig = 0; /* significant part of the number */
+    i32 exp = 0; /* exponent part of the number */
+
+    bool exp_sign;   /* temporary exponent sign from literal part */
+    i64 exp_sig = 0; /* temporary exponent number from significant part */
+    i64 exp_lit = 0; /* temporary exponent number from exponent literal part */
+    u64 num;         /* temporary number for reading */
+    u8* tmp;         /* temporary cursor for reading */
+
+    u8* hdr = *ptr;
+    u8* cur = *ptr;
+    u8** end = ptr;
+    bool sign;
+
+    /* read number as raw string if has `YYJSON_READ_NUMBER_AS_RAW` flag */
+    if (has_read_flag(NUMBER_AS_RAW)) {
+        return read_number_raw(ptr, pre, flg, val, msg);
+    }
+
+    sign = (*hdr == '-');
+    cur += sign;
+
+    /* begin with a leading zero or non-digit */
+    if (unlikely(!digi_is_nonzero(*cur))) { /* 0 or non-digit char */
+        if (unlikely(*cur != '0')) {        /* non-digit char */
+            if (has_read_flag(ALLOW_INF_AND_NAN)) {
+                if (read_inf_or_nan(sign, &cur, pre, val)) {
+                    *end = cur;
+                    return true;
+                }
+            }
+            return_err(cur, "no digit after minus sign");
+        }
+        /* begin with 0 */
+        if (likely(!digi_is_digit_or_fp(*++cur)))
+            return_0();
+        if (likely(*cur == '.')) {
+            dot_pos = cur++;
+            if (unlikely(!digi_is_digit(*cur))) {
+                return_err(cur, "no digit after decimal point");
+            }
+            while (unlikely(*cur == '0'))
+                cur++;
+            if (likely(digi_is_digit(*cur))) {
+                /* first non-zero digit after decimal point */
+                sig = (u64)(*cur - '0'); /* read first digit */
+                cur--;
+                goto digi_frac_1; /* continue read fraction part */
+            }
+        }
+        if (unlikely(digi_is_digit(*cur))) {
+            return_err(cur - 1, "number with leading zero is not allowed");
+        }
+        if (unlikely(digi_is_exp(*cur))) { /* 0 with any exponent is still 0 */
+            cur += (usize)1 + digi_is_sign(cur[1]);
+            if (unlikely(!digi_is_digit(*cur))) {
+                return_err(cur, "no digit after exponent sign");
+            }
+            while (digi_is_digit(*++cur))
+                ;
+        }
+        return_f64_bin(0);
+    }
+
+    /* begin with non-zero digit */
+    sig = (u64)(*cur - '0');
+
+    /*
+     Read integral part, same as the following code.
+
+         for (int i = 1; i <= 18; i++) {
+            num = cur[i] - '0';
+            if (num <= 9) sig = num + sig * 10;
+            else goto digi_sepr_i;
+         }
+     */
+#define expr_intg(i)                                                                               \
+    if (likely((num = (u64)(cur[i] - (u8)'0')) <= 9))                                              \
+        sig = num + sig * 10;                                                                      \
+    else {                                                                                         \
+        goto digi_sepr_##i;                                                                        \
+    }
+    repeat_in_1_18(expr_intg)
+#undef expr_intg
+
+        cur += 19; /* skip continuous 19 digits */
+    if (!digi_is_digit_or_fp(*cur)) {
+        /* this number is an integer consisting of 19 digits */
+        if (sign && (sig > ((u64)1 << 63))) { /* overflow */
+            if (has_read_flag(BIGNUM_AS_RAW))
+                return_raw();
+            return_f64(normalized_u64_to_f64(sig));
+        }
+        return_i64(sig);
+    }
+    goto digi_intg_more; /* read more digits in integral part */
+
+    /* process first non-digit character */
+#define expr_sepr(i)                                                                               \
+    digi_sepr_##i : if (likely(!digi_is_fp(cur[i]))) {                                             \
+        cur += i;                                                                                  \
+        return_i64(sig);                                                                           \
+    }                                                                                              \
+    dot_pos = cur + i;                                                                             \
+    if (likely(cur[i] == '.'))                                                                     \
+        goto digi_frac_##i;                                                                        \
+    cur += i;                                                                                      \
+    sig_end = cur;                                                                                 \
+    goto digi_exp_more;
+    repeat_in_1_18(expr_sepr)
+#undef expr_sepr
+
+    /* read fraction part */
+#define expr_frac(i)                                                                               \
+    digi_frac_##i : if (likely((num = (u64)(cur[i + 1] - (u8)'0')) <= 9)) sig = num + sig * 10;    \
+    else {                                                                                         \
+        goto digi_stop_##i;                                                                        \
+    }
+        repeat_in_1_18(expr_frac)
+#undef expr_frac
+
+            cur += 20; /* skip 19 digits and 1 decimal point */
+    if (!digi_is_digit(*cur))
+        goto digi_frac_end; /* fraction part end */
+    goto digi_frac_more;    /* read more digits in fraction part */
+
+    /* significant part end */
+#define expr_stop(i)                                                                               \
+    digi_stop_##i : cur += i + 1;                                                                  \
+    goto digi_frac_end;
+    repeat_in_1_18(expr_stop)
+#undef expr_stop
+
+        /* read more digits in integral part */
+        digi_intg_more : if (digi_is_digit(*cur)) {
+        if (!digi_is_digit_or_fp(cur[1])) {
+            /* this number is an integer consisting of 20 digits */
+            num = (u64)(*cur - '0');
+            if ((sig < (U64_MAX / 10)) || (sig == (U64_MAX / 10) && num <= (U64_MAX % 10))) {
+                sig = num + sig * 10;
+                cur++;
+                /* convert to double if overflow */
+                if (sign) {
+                    if (has_read_flag(BIGNUM_AS_RAW))
+                        return_raw();
+                    return_f64(normalized_u64_to_f64(sig));
+                }
+                return_i64(sig);
+            }
+        }
+    }
+
+    if (digi_is_exp(*cur)) {
+        dot_pos = cur;
+        goto digi_exp_more;
+    }
+
+    if (*cur == '.') {
+        dot_pos = cur++;
+        if (!digi_is_digit(*cur)) {
+            return_err(cur, "no digit after decimal point");
+        }
+    }
+
+    /* read more digits in fraction part */
+digi_frac_more:
+    sig_cut = cur;        /* too large to fit in u64, excess digits need to be cut */
+    sig += (*cur >= '5'); /* round */
+    while (digi_is_digit(*++cur))
+        ;
+    if (!dot_pos) {
+        if (!digi_is_fp(*cur) && has_read_flag(BIGNUM_AS_RAW)) {
+            return_raw(); /* it's a large integer */
+        }
+        dot_pos = cur;
+        if (*cur == '.') {
+            if (!digi_is_digit(*++cur)) {
+                return_err(cur, "no digit after decimal point");
+            }
+            while (digi_is_digit(*cur))
+                cur++;
+        }
+    }
+    exp_sig = (i64)(dot_pos - sig_cut);
+    exp_sig += (dot_pos < sig_cut);
+
+    /* ignore trailing zeros */
+    tmp = cur - 1;
+    while (*tmp == '0' || *tmp == '.')
+        tmp--;
+    if (tmp < sig_cut) {
+        sig_cut = NULL;
+    } else {
+        sig_end = cur;
+    }
+
+    if (digi_is_exp(*cur))
+        goto digi_exp_more;
+    goto digi_exp_finish;
+
+    /* fraction part end */
+digi_frac_end:
+    if (unlikely(dot_pos + 1 == cur)) {
+        return_err(cur, "no digit after decimal point");
+    }
+    sig_end = cur;
+    exp_sig = -(i64)((u64)(cur - dot_pos) - 1);
+    if (likely(!digi_is_exp(*cur))) {
+        if (unlikely(exp_sig < F64_MIN_DEC_EXP - 19)) {
+            return_f64_bin(0); /* underflow */
+        }
+        exp = (i32)exp_sig;
+        goto digi_finish;
+    } else {
+        goto digi_exp_more;
+    }
+
+    /* read exponent part */
+digi_exp_more:
+    exp_sign = (*++cur == '-');
+    cur += digi_is_sign(*cur);
+    if (unlikely(!digi_is_digit(*cur))) {
+        return_err(cur, "no digit after exponent sign");
+    }
+    while (*cur == '0')
+        cur++;
+
+    /* read exponent literal */
+    tmp = cur;
+    while (digi_is_digit(*cur)) {
+        exp_lit = (i64)((u8)(*cur++ - '0') + (u64)exp_lit * 10);
+    }
+    if (unlikely(cur - tmp >= U64_SAFE_DIG)) {
+        if (exp_sign) {
+            return_f64_bin(0); /* underflow */
+        } else {
+            return_inf(); /* overflow */
+        }
+    }
+    exp_sig += exp_sign ? -exp_lit : exp_lit;
+
+    /* validate exponent value */
+digi_exp_finish:
+    if (unlikely(exp_sig < F64_MIN_DEC_EXP - 19)) {
+        return_f64_bin(0); /* underflow */
+    }
+    if (unlikely(exp_sig > F64_MAX_DEC_EXP)) {
+        return_inf(); /* overflow */
+    }
+    exp = (i32)exp_sig;
+
+    /* all digit read finished */
+digi_finish:
+
+    /*
+     Fast path 1:
+
+     1. The floating-point number calculation should be accurate, see the
+        comments of macro `YYJSON_DOUBLE_MATH_CORRECT`.
+     2. Correct rounding should be performed (fegetround() == FE_TONEAREST).
+     3. The input of floating point number calculation does not lose precision,
+        which means: 64 - leading_zero(input) - trailing_zero(input) < 53.
+
+     We don't check all available inputs here, because that would make the code
+     more complicated, and not friendly to branch predictor.
+     */
+#if YYJSON_DOUBLE_MATH_CORRECT
+    if (sig < ((u64)1 << 53) && exp >= -F64_POW10_EXP_MAX_EXACT &&
+        exp <= +F64_POW10_EXP_MAX_EXACT) {
+        f64 dbl = (f64)sig;
+        if (exp < 0) {
+            dbl /= f64_pow10_table[-exp];
+        } else {
+            dbl *= f64_pow10_table[+exp];
+        }
+        return_f64(dbl);
+    }
+#endif
+
+    /*
+     Fast path 2:
+
+     To keep it simple, we only accept normal number here,
+     let the slow path to handle subnormal and infinity number.
+     */
+    if (likely(!sig_cut && exp > -F64_MAX_DEC_EXP + 1 && exp < +F64_MAX_DEC_EXP - 20)) {
+        /*
+         The result value is exactly equal to (sig * 10^exp),
+         the exponent part (10^exp) can be converted to (sig2 * 2^exp2).
+
+         The sig2 can be an infinite length number, only the highest 128 bits
+         is cached in the pow10_sig_table.
+
+         Now we have these bits:
+         sig1 (normalized 64bit)        : aaaaaaaa
+         sig2 (higher 64bit)            : bbbbbbbb
+         sig2_ext (lower 64bit)         : cccccccc
+         sig2_cut (extra unknown bits)  : dddddddddddd....
+
+         And the calculation process is:
+         ----------------------------------------
+                 aaaaaaaa *
+                 bbbbbbbbccccccccdddddddddddd....
+         ----------------------------------------
+         abababababababab +
+                 acacacacacacacac +
+                         adadadadadadadadadad....
+         ----------------------------------------
+         [hi____][lo____] +
+                 [hi2___][lo2___] +
+                         [unknown___________....]
+         ----------------------------------------
+
+         The addition with carry may affect higher bits, but if there is a 0
+         in higher bits, the bits higher than 0 will not be affected.
+
+         `lo2` + `unknown` may get a carry bit and may affect `hi2`, the max
+         value of `hi2` is 0xFFFFFFFFFFFFFFFE, so `hi2` will not overflow.
+
+         `lo` + `hi2` may also get a carry bit and may affect `hi`, but only
+         the highest significant 53 bits of `hi` is needed. If there is a 0
+         in the lower bits of `hi`, then all the following bits can be dropped.
+
+         To convert the result to IEEE-754 double number, we need to perform
+         correct rounding:
+         1. if bit 54 is 0, round down,
+         2. if bit 54 is 1 and any bit beyond bit 54 is 1, round up,
+         3. if bit 54 is 1 and all bits beyond bit 54 are 0, round to even,
+            as the extra bits is unknown, this case will not be handled here.
+         */
+
+        u64 raw;
+        u64 sig1, sig2, sig2_ext, hi, lo, hi2, lo2, add, bits;
+        i32 exp2;
+        u32 lz;
+        bool exact = false, carry, round_up;
+
+        /* convert (10^exp) to (sig2 * 2^exp2) */
+        pow10_table_get_sig(exp, &sig2, &sig2_ext);
+        pow10_table_get_exp(exp, &exp2);
+
+        /* normalize and multiply */
+        lz = u64_lz_bits(sig);
+        sig1 = sig << lz;
+        exp2 -= (i32)lz;
+        u128_mul(sig1, sig2, &hi, &lo);
+
+        /*
+         The `hi` is in range [0x4000000000000000, 0xFFFFFFFFFFFFFFFE],
+         To get normalized value, `hi` should be shifted to the left by 0 or 1.
+
+         The highest significant 53 bits is used by IEEE-754 double number,
+         and the bit 54 is used to detect rounding direction.
+
+         The lowest (64 - 54 - 1) bits is used to check whether it contains 0.
+         */
+        bits = hi & (((u64)1 << (64 - 54 - 1)) - 1);
+        if (bits - 1 < (((u64)1 << (64 - 54 - 1)) - 2)) {
+            /*
+             (bits != 0 && bits != 0x1FF) => (bits - 1 < 0x1FF - 1)
+             The `bits` is not zero, so we don't need to check `round to even`
+             case. The `bits` contains bit `0`, so we can drop the extra bits
+             after `0`.
+             */
+            exact = true;
+
+        } else {
+            /*
+             (bits == 0 || bits == 0x1FF)
+             The `bits` is filled with all `0` or all `1`, so we need to check
+             lower bits with another 64-bit multiplication.
+             */
+            u128_mul(sig1, sig2_ext, &hi2, &lo2);
+
+            add = lo + hi2;
+            if (add + 1 > (u64)1) {
+                /*
+                 (add != 0 && add != U64_MAX) => (add + 1 > 1)
+                 The `add` is not zero, so we don't need to check `round to
+                 even` case. The `add` contains bit `0`, so we can drop the
+                 extra bits after `0`. The `hi` cannot be U64_MAX, so it will
+                 not overflow.
+                 */
+                carry = add < lo || add < hi2;
+                hi += carry;
+                exact = true;
+            }
+        }
+
+        if (exact) {
+            /* normalize */
+            lz = hi < ((u64)1 << 63);
+            hi <<= lz;
+            exp2 -= (i32)lz;
+            exp2 += 64;
+
+            /* test the bit 54 and get rounding direction */
+            round_up = (hi & ((u64)1 << (64 - 54))) > (u64)0;
+            hi += (round_up ? ((u64)1 << (64 - 54)) : (u64)0);
+
+            /* test overflow */
+            if (hi < ((u64)1 << (64 - 54))) {
+                hi = ((u64)1 << 63);
+                exp2 += 1;
+            }
+
+            /* This is a normal number, convert it to IEEE-754 format. */
+            hi >>= F64_BITS - F64_SIG_FULL_BITS;
+            exp2 += F64_BITS - F64_SIG_FULL_BITS + F64_SIG_BITS;
+            exp2 += F64_EXP_BIAS;
+            raw = ((u64)exp2 << F64_SIG_BITS) | (hi & F64_SIG_MASK);
+            return_f64_bin(raw);
+        }
+    }
+
+    /*
+     Slow path: read double number exactly with diyfp.
+     1. Use cached diyfp to get an approximation value.
+     2. Use bigcomp to check the approximation value if needed.
+
+     This algorithm refers to google's double-conversion project:
+     https://github.com/google/double-conversion
+     */
+    {
+        const i32 ERR_ULP_LOG = 3;
+        const i32 ERR_ULP = 1 << ERR_ULP_LOG;
+        const i32 ERR_CACHED_POW = ERR_ULP / 2;
+        const i32 ERR_MUL_FIXED = ERR_ULP / 2;
+        const i32 DIY_SIG_BITS = 64;
+        const i32 EXP_BIAS = F64_EXP_BIAS + F64_SIG_BITS;
+        const i32 EXP_SUBNORMAL = -EXP_BIAS + 1;
+
+        u64 fp_err;
+        u32 bits;
+        i32 order_of_magnitude;
+        i32 effective_significand_size;
+        i32 precision_digits_count;
+        u64 precision_bits;
+        u64 half_way;
+
+        u64 raw;
+        diy_fp fp, fp_upper;
+        bigint big_full, big_comp;
+        i32 cmp;
+
+        fp.sig = sig;
+        fp.exp = 0;
+        fp_err = sig_cut ? (u64)(ERR_ULP / 2) : (u64)0;
+
+        /* normalize */
+        bits = u64_lz_bits(fp.sig);
+        fp.sig <<= bits;
+        fp.exp -= (i32)bits;
+        fp_err <<= bits;
+
+        /* multiply and add error */
+        fp = diy_fp_mul(fp, diy_fp_get_cached_pow10(exp));
+        fp_err += (u64)ERR_CACHED_POW + (fp_err != 0) + (u64)ERR_MUL_FIXED;
+
+        /* normalize */
+        bits = u64_lz_bits(fp.sig);
+        fp.sig <<= bits;
+        fp.exp -= (i32)bits;
+        fp_err <<= bits;
+
+        /* effective significand */
+        order_of_magnitude = DIY_SIG_BITS + fp.exp;
+        if (likely(order_of_magnitude >= EXP_SUBNORMAL + F64_SIG_FULL_BITS)) {
+            effective_significand_size = F64_SIG_FULL_BITS;
+        } else if (order_of_magnitude <= EXP_SUBNORMAL) {
+            effective_significand_size = 0;
+        } else {
+            effective_significand_size = order_of_magnitude - EXP_SUBNORMAL;
+        }
+
+        /* precision digits count */
+        precision_digits_count = DIY_SIG_BITS - effective_significand_size;
+        if (unlikely(precision_digits_count + ERR_ULP_LOG >= DIY_SIG_BITS)) {
+            i32 shr = (precision_digits_count + ERR_ULP_LOG) - DIY_SIG_BITS + 1;
+            fp.sig >>= shr;
+            fp.exp += shr;
+            fp_err = (fp_err >> shr) + 1 + (u32)ERR_ULP;
+            precision_digits_count -= shr;
+        }
+
+        /* half way */
+        precision_bits = fp.sig & (((u64)1 << precision_digits_count) - 1);
+        precision_bits *= (u32)ERR_ULP;
+        half_way = (u64)1 << (precision_digits_count - 1);
+        half_way *= (u32)ERR_ULP;
+
+        /* rounding */
+        fp.sig >>= precision_digits_count;
+        fp.sig += (precision_bits >= half_way + fp_err);
+        fp.exp += precision_digits_count;
+
+        /* get IEEE double raw value */
+        raw = diy_fp_to_ieee_raw(fp);
+        if (unlikely(raw == F64_RAW_INF))
+            return_inf();
+        if (likely(precision_bits <= half_way - fp_err || precision_bits >= half_way + fp_err)) {
+            return_f64_bin(raw); /* number is accurate */
+        }
+        /* now the number is the correct value, or the next lower value */
+
+        /* upper boundary */
+        if (raw & F64_EXP_MASK) {
+            fp_upper.sig = (raw & F64_SIG_MASK) + ((u64)1 << F64_SIG_BITS);
+            fp_upper.exp = (i32)((raw & F64_EXP_MASK) >> F64_SIG_BITS);
+        } else {
+            fp_upper.sig = (raw & F64_SIG_MASK);
+            fp_upper.exp = 1;
+        }
+        fp_upper.exp -= F64_EXP_BIAS + F64_SIG_BITS;
+        fp_upper.sig <<= 1;
+        fp_upper.exp -= 1;
+        fp_upper.sig += 1; /* add half ulp */
+
+        /* compare with bigint */
+        bigint_set_buf(&big_full, sig, &exp, sig_cut, sig_end, dot_pos);
+        bigint_set_u64(&big_comp, fp_upper.sig);
+        if (exp >= 0) {
+            bigint_mul_pow10(&big_full, +exp);
+        } else {
+            bigint_mul_pow10(&big_comp, -exp);
+        }
+        if (fp_upper.exp > 0) {
+            bigint_mul_pow2(&big_comp, (u32) + fp_upper.exp);
+        } else {
+            bigint_mul_pow2(&big_full, (u32)-fp_upper.exp);
+        }
+        cmp = bigint_cmp(&big_full, &big_comp);
+        if (likely(cmp != 0)) {
+            /* round down or round up */
+            raw += (cmp > 0);
+        } else {
+            /* falls midway, round to even */
+            raw += (raw & 1);
+        }
+
+        if (unlikely(raw == F64_RAW_INF))
+            return_inf();
+        return_f64_bin(raw);
+    }
+
+#undef return_err
+#undef return_inf
+#undef return_0
+#undef return_i64
+#undef return_f64
+#undef return_f64_bin
+#undef return_raw
+}
+
+#else /* FP_READER */
+
+/**
+ Read a JSON number.
+ This is a fallback function if the custom number reader is disabled.
+ This function use libc's strtod() to read floating-point number.
+ */
+static_inline bool read_number(u8** ptr, u8** pre, yyjson_read_flag flg, yyjson_val* val,
+    const char** msg) {
+
+#define return_err(_pos, _msg)                                                                     \
+    do {                                                                                           \
+        *msg = _msg;                                                                               \
+        *end = _pos;                                                                               \
+        return false;                                                                              \
+    } while (false)
+
+#define return_0()                                                                                 \
+    do {                                                                                           \
+        val->tag = YYJSON_TYPE_NUM | (u64)((u8)sign << 3);                                         \
+        val->uni.u64 = 0;                                                                          \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+#define return_i64(_v)                                                                             \
+    do {                                                                                           \
+        val->tag = YYJSON_TYPE_NUM | (u64)((u8)sign << 3);                                         \
+        val->uni.u64 = (u64)(sign ? (u64)(~(_v) + 1) : (u64)(_v));                                 \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+#define return_f64(_v)                                                                             \
+    do {                                                                                           \
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;                                          \
+        val->uni.f64 = sign ? -(f64)(_v) : (f64)(_v);                                              \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+#define return_f64_bin(_v)                                                                         \
+    do {                                                                                           \
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;                                          \
+        val->uni.u64 = ((u64)sign << 63) | (u64)(_v);                                              \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+#define return_inf()                                                                               \
+    do {                                                                                           \
+        if (has_read_flag(BIGNUM_AS_RAW))                                                          \
+            return_raw();                                                                          \
+        if (has_read_flag(ALLOW_INF_AND_NAN))                                                      \
+            return_f64_bin(F64_RAW_INF);                                                           \
+        else                                                                                       \
+            return_err(hdr, "number is infinity when parsed as double");                           \
+    } while (false)
+
+#define return_raw()                                                                               \
+    do {                                                                                           \
+        if (*pre)                                                                                  \
+            **pre = '\0'; /* add null-terminator for previous raw string */                        \
+        val->tag = ((u64)(cur - hdr) << YYJSON_TAG_BIT) | YYJSON_TYPE_RAW;                         \
+        val->uni.str = (const char*)hdr;                                                           \
+        *pre = cur;                                                                                \
+        *end = cur;                                                                                \
+        return true;                                                                               \
+    } while (false)
+
+    u64 sig, num;
+    u8* hdr = *ptr;
+    u8* cur = *ptr;
+    u8** end = ptr;
+    u8* dot = NULL;
+    u8* f64_end = NULL;
+    bool sign;
+
+    /* read number as raw string if has `YYJSON_READ_NUMBER_AS_RAW` flag */
+    if (has_read_flag(NUMBER_AS_RAW)) {
+        return read_number_raw(ptr, pre, flg, val, msg);
+    }
+
+    sign = (*hdr == '-');
+    cur += sign;
+    sig = (u8)(*cur - '0');
+
+    /* read first digit, check leading zero */
+    if (unlikely(!digi_is_digit(*cur))) {
+        if (has_read_flag(ALLOW_INF_AND_NAN)) {
+            if (read_inf_or_nan(sign, &cur, pre, val)) {
+                *end = cur;
+                return true;
+            }
+        }
+        return_err(cur, "no digit after minus sign");
+    }
+    if (*cur == '0') {
+        cur++;
+        if (unlikely(digi_is_digit(*cur))) {
+            return_err(cur - 1, "number with leading zero is not allowed");
+        }
+        if (!digi_is_fp(*cur))
+            return_0();
+        goto read_double;
+    }
+
+    /* read continuous digits, up to 19 characters */
+#define expr_intg(i)                                                                               \
+    if (likely((num = (u64)(cur[i] - (u8)'0')) <= 9))                                              \
+        sig = num + sig * 10;                                                                      \
+    else {                                                                                         \
+        cur += i;                                                                                  \
+        goto intg_end;                                                                             \
+    }
+    repeat_in_1_18(expr_intg)
+#undef expr_intg
+
+        /* here are 19 continuous digits, skip them */
+        cur += 19;
+    if (digi_is_digit(cur[0]) && !digi_is_digit_or_fp(cur[1])) {
+        /* this number is an integer consisting of 20 digits */
+        num = (u8)(*cur - '0');
+        if ((sig < (U64_MAX / 10)) || (sig == (U64_MAX / 10) && num <= (U64_MAX % 10))) {
+            sig = num + sig * 10;
+            cur++;
+            if (sign) {
+                if (has_read_flag(BIGNUM_AS_RAW))
+                    return_raw();
+                return_f64(normalized_u64_to_f64(sig));
+            }
+            return_i64(sig);
+        }
+    }
+
+intg_end:
+    /* continuous digits ended */
+    if (!digi_is_digit_or_fp(*cur)) {
+        /* this number is an integer consisting of 1 to 19 digits */
+        if (sign && (sig > ((u64)1 << 63))) {
+            if (has_read_flag(BIGNUM_AS_RAW))
+                return_raw();
+            return_f64(normalized_u64_to_f64(sig));
+        }
+        return_i64(sig);
+    }
+
+read_double:
+    /* this number should be read as double */
+    while (digi_is_digit(*cur))
+        cur++;
+    if (!digi_is_fp(*cur) && has_read_flag(BIGNUM_AS_RAW)) {
+        return_raw(); /* it's a large integer */
+    }
+    if (*cur == '.') {
+        /* skip fraction part */
+        dot = cur;
+        cur++;
+        if (!digi_is_digit(*cur)) {
+            return_err(cur, "no digit after decimal point");
+        }
+        cur++;
+        while (digi_is_digit(*cur))
+            cur++;
+    }
+    if (digi_is_exp(*cur)) {
+        /* skip exponent part */
+        cur += 1 + digi_is_sign(cur[1]);
+        if (!digi_is_digit(*cur)) {
+            return_err(cur, "no digit after exponent sign");
+        }
+        cur++;
+        while (digi_is_digit(*cur))
+            cur++;
+    }
+
+    /*
+     libc's strtod() is used to parse the floating-point number.
+
+     Note that the decimal point character used by strtod() is locale-dependent,
+     and the rounding direction may affected by fesetround().
+
+     For currently known locales, (en, zh, ja, ko, am, he, hi) use '.' as the
+     decimal point, while other locales use ',' as the decimal point.
+
+     Here strtod() is called twice for different locales, but if another thread
+     happens calls setlocale() between two strtod(), parsing may still fail.
+     */
+    val->uni.f64 = strtod((const char*)hdr, (char**)&f64_end);
+    if (unlikely(f64_end != cur)) {
+        /* replace '.' with ',' for locale */
+        bool cut = (*cur == ',');
+        if (cut)
+            *cur = ' ';
+        if (dot)
+            *dot = ',';
+        val->uni.f64 = strtod((const char*)hdr, (char**)&f64_end);
+        /* restore ',' to '.' */
+        if (cut)
+            *cur = ',';
+        if (dot)
+            *dot = '.';
+        if (unlikely(f64_end != cur)) {
+            return_err(hdr, "strtod() failed to parse the number");
+        }
+    }
+    if (unlikely(val->uni.f64 >= HUGE_VAL || val->uni.f64 <= -HUGE_VAL)) {
+        return_inf();
+    }
+    val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;
+    *end = cur;
+    return true;
+
+#undef return_err
+#undef return_0
+#undef return_i64
+#undef return_f64
+#undef return_f64_bin
+#undef return_inf
+#undef return_raw
+}
+
+#endif /* FP_READER */
+
+/*==============================================================================
+ * JSON String Reader
+ *============================================================================*/
+
+/**
+ Read a JSON string.
+ @param ptr The head pointer of string before '"' prefix (inout).
+ @param lst JSON last position.
+ @param inv Allow invalid unicode.
+ @param val The string value to be written.
+ @param msg The error message pointer.
+ @return Whether success.
+ */
+static_inline bool read_string(u8** ptr, u8* lst, bool inv, yyjson_val* val, const char** msg) {
+    /*
+     Each unicode code point is encoded as 1 to 4 bytes in UTF-8 encoding,
+     we use 4-byte mask and pattern value to validate UTF-8 byte sequence,
+     this requires the input data to have 4-byte zero padding.
+     ---------------------------------------------------
+     1 byte
+     unicode range [U+0000, U+007F]
+     unicode min   [.......0]
+     unicode max   [.1111111]
+     bit pattern   [0.......]
+     ---------------------------------------------------
+     2 byte
+     unicode range [U+0080, U+07FF]
+     unicode min   [......10 ..000000]
+     unicode max   [...11111 ..111111]
+     bit require   [...xxxx. ........] (1E 00)
+     bit mask      [xxx..... xx......] (E0 C0)
+     bit pattern   [110..... 10......] (C0 80)
+     ---------------------------------------------------
+     3 byte
+     unicode range [U+0800, U+FFFF]
+     unicode min   [........ ..100000 ..000000]
+     unicode max   [....1111 ..111111 ..111111]
+     bit require   [....xxxx ..x..... ........] (0F 20 00)
+     bit mask      [xxxx.... xx...... xx......] (F0 C0 C0)
+     bit pattern   [1110.... 10...... 10......] (E0 80 80)
+     ---------------------------------------------------
+     3 byte invalid (reserved for surrogate halves)
+     unicode range [U+D800, U+DFFF]
+     unicode min   [....1101 ..100000 ..000000]
+     unicode max   [....1101 ..111111 ..111111]
+     bit mask      [....xxxx ..x..... ........] (0F 20 00)
+     bit pattern   [....1101 ..1..... ........] (0D 20 00)
+     ---------------------------------------------------
+     4 byte
+     unicode range [U+10000, U+10FFFF]
+     unicode min   [........ ...10000 ..000000 ..000000]
+     unicode max   [.....100 ..001111 ..111111 ..111111]
+     bit require   [.....xxx ..xx.... ........ ........] (07 30 00 00)
+     bit mask      [xxxxx... xx...... xx...... xx......] (F8 C0 C0 C0)
+     bit pattern   [11110... 10...... 10...... 10......] (F0 80 80 80)
+     ---------------------------------------------------
+     */
+#if YYJSON_ENDIAN == YYJSON_BIG_ENDIAN
+    const u32 b1_mask = 0x80000000UL;
+    const u32 b1_patt = 0x00000000UL;
+    const u32 b2_mask = 0xE0C00000UL;
+    const u32 b2_patt = 0xC0800000UL;
+    const u32 b2_requ = 0x1E000000UL;
+    const u32 b3_mask = 0xF0C0C000UL;
+    const u32 b3_patt = 0xE0808000UL;
+    const u32 b3_requ = 0x0F200000UL;
+    const u32 b3_erro = 0x0D200000UL;
+    const u32 b4_mask = 0xF8C0C0C0UL;
+    const u32 b4_patt = 0xF0808080UL;
+    const u32 b4_requ = 0x07300000UL;
+    const u32 b4_err0 = 0x04000000UL;
+    const u32 b4_err1 = 0x03300000UL;
+#elif YYJSON_ENDIAN == YYJSON_LITTLE_ENDIAN
+    const u32 b1_mask = 0x00000080UL;
+    const u32 b1_patt = 0x00000000UL;
+    const u32 b2_mask = 0x0000C0E0UL;
+    const u32 b2_patt = 0x000080C0UL;
+    const u32 b2_requ = 0x0000001EUL;
+    const u32 b3_mask = 0x00C0C0F0UL;
+    const u32 b3_patt = 0x008080E0UL;
+    const u32 b3_requ = 0x0000200FUL;
+    const u32 b3_erro = 0x0000200DUL;
+    const u32 b4_mask = 0xC0C0C0F8UL;
+    const u32 b4_patt = 0x808080F0UL;
+    const u32 b4_requ = 0x00003007UL;
+    const u32 b4_err0 = 0x00000004UL;
+    const u32 b4_err1 = 0x00003003UL;
+#else
+    /* this should be evaluated at compile-time */
+    v32_uni b1_mask_uni = {{0x80, 0x00, 0x00, 0x00}};
+    v32_uni b1_patt_uni = {{0x00, 0x00, 0x00, 0x00}};
+    v32_uni b2_mask_uni = {{0xE0, 0xC0, 0x00, 0x00}};
+    v32_uni b2_patt_uni = {{0xC0, 0x80, 0x00, 0x00}};
+    v32_uni b2_requ_uni = {{0x1E, 0x00, 0x00, 0x00}};
+    v32_uni b3_mask_uni = {{0xF0, 0xC0, 0xC0, 0x00}};
+    v32_uni b3_patt_uni = {{0xE0, 0x80, 0x80, 0x00}};
+    v32_uni b3_requ_uni = {{0x0F, 0x20, 0x00, 0x00}};
+    v32_uni b3_erro_uni = {{0x0D, 0x20, 0x00, 0x00}};
+    v32_uni b4_mask_uni = {{0xF8, 0xC0, 0xC0, 0xC0}};
+    v32_uni b4_patt_uni = {{0xF0, 0x80, 0x80, 0x80}};
+    v32_uni b4_requ_uni = {{0x07, 0x30, 0x00, 0x00}};
+    v32_uni b4_err0_uni = {{0x04, 0x00, 0x00, 0x00}};
+    v32_uni b4_err1_uni = {{0x03, 0x30, 0x00, 0x00}};
+    u32 b1_mask = b1_mask_uni.u;
+    u32 b1_patt = b1_patt_uni.u;
+    u32 b2_mask = b2_mask_uni.u;
+    u32 b2_patt = b2_patt_uni.u;
+    u32 b2_requ = b2_requ_uni.u;
+    u32 b3_mask = b3_mask_uni.u;
+    u32 b3_patt = b3_patt_uni.u;
+    u32 b3_requ = b3_requ_uni.u;
+    u32 b3_erro = b3_erro_uni.u;
+    u32 b4_mask = b4_mask_uni.u;
+    u32 b4_patt = b4_patt_uni.u;
+    u32 b4_requ = b4_requ_uni.u;
+    u32 b4_err0 = b4_err0_uni.u;
+    u32 b4_err1 = b4_err1_uni.u;
+#endif
+
+#define is_valid_seq_1(uni) (((uni & b1_mask) == b1_patt))
+
+#define is_valid_seq_2(uni) (((uni & b2_mask) == b2_patt) && ((uni & b2_requ)))
+
+#define is_valid_seq_3(uni)                                                                        \
+    (((uni & b3_mask) == b3_patt) && ((tmp = (uni & b3_requ))) && ((tmp != b3_erro)))
+
+#define is_valid_seq_4(uni)                                                                        \
+    (((uni & b4_mask) == b4_patt) && ((tmp = (uni & b4_requ))) &&                                  \
+        ((tmp & b4_err0) == 0 || (tmp & b4_err1) == 0))
+
+#define return_err(_end, _msg)                                                                     \
+    do {                                                                                           \
+        *msg = _msg;                                                                               \
+        *end = _end;                                                                               \
+        return false;                                                                              \
+    } while (false)
+
+    u8* cur = *ptr;
+    u8** end = ptr;
+    u8 *src = ++cur, *dst, *pos;
+    u16 hi, lo;
+    u32 uni, tmp;
+
+skip_ascii:
+    /* Most strings have no escaped characters, so we can jump them quickly. */
+
+skip_ascii_begin:
+    /*
+     We want to make loop unrolling, as shown in the following code. Some
+     compiler may not generate instructions as expected, so we rewrite it with
+     explicit goto statements. We hope the compiler can generate instructions
+     like this: https://godbolt.org/z/8vjsYq
+
+         while (true) repeat16({
+            if (likely(!(char_is_ascii_stop(*src)))) src++;
+            else break;
+         })
+     */
+#define expr_jump(i)                                                                               \
+    if (likely(!char_is_ascii_stop(src[i]))) {                                                     \
+    } else                                                                                         \
+        goto skip_ascii_stop##i;
+
+#define expr_stop(i)                                                                               \
+    skip_ascii_stop##i : src += i;                                                                 \
+    goto skip_ascii_end;
+
+    repeat16_incr(expr_jump) src += 16;
+    goto skip_ascii_begin;
+    repeat16_incr(expr_stop)
+
+#undef expr_jump
+#undef expr_stop
+
+        skip_ascii_end :
+
+    /*
+     GCC may store src[i] in a register at each line of expr_jump(i) above.
+     These instructions are useless and will degrade performance.
+     This inline asm is a hint for gcc: "the memory has been modified,
+     do not cache it".
+
+     MSVC, Clang, ICC can generate expected instructions without this hint.
+     */
+#if YYJSON_IS_REAL_GCC
+        __asm__ volatile(""
+                         : "=m"(*src));
+#endif
+    if (likely(*src == '"')) {
+        val->tag =
+            ((u64)(src - cur) << YYJSON_TAG_BIT) | (u64)(YYJSON_TYPE_STR | YYJSON_SUBTYPE_NOESC);
+        val->uni.str = (const char*)cur;
+        *src = '\0';
+        *end = src + 1;
+        return true;
+    }
+
+skip_utf8:
+    if (*src & 0x80) { /* non-ASCII character */
+        /*
+         Non-ASCII character appears here, which means that the text is likely
+         to be written in non-English or emoticons. According to some common
+         data set statistics, byte sequences of the same length may appear
+         consecutively. We process the byte sequences of the same length in each
+         loop, which is more friendly to branch prediction.
+         */
+        pos = src;
+#if YYJSON_DISABLE_UTF8_VALIDATION
+        while (true)
+            repeat8({
+                if (likely((*src & 0xF0) == 0xE0))
+                    src += 3;
+                else
+                    break;
+            }) if (*src < 0x80) goto skip_ascii;
+        while (true)
+            repeat8({
+                if (likely((*src & 0xE0) == 0xC0))
+                    src += 2;
+                else
+                    break;
+            }) while (true) repeat8({
+                if (likely((*src & 0xF8) == 0xF0))
+                    src += 4;
+                else
+                    break;
+            })
+#else
+        uni = byte_load_4(src);
+        while (is_valid_seq_3(uni)) {
+            src += 3;
+            uni = byte_load_4(src);
+        }
+        if (is_valid_seq_1(uni))
+            goto skip_ascii;
+        while (is_valid_seq_2(uni)) {
+            src += 2;
+            uni = byte_load_4(src);
+        }
+        while (is_valid_seq_4(uni)) {
+            src += 4;
+            uni = byte_load_4(src);
+        }
+#endif
+                if (unlikely(pos == src)) {
+                if (!inv)
+                    return_err(src, "invalid UTF-8 encoding in string");
+                ++src;
+            }
+        goto skip_ascii;
+    }
+
+    /* The escape character appears, we need to copy it. */
+    dst = src;
+copy_escape:
+    if (likely(*src == '\\')) {
+        switch (*++src) {
+        case '"':
+            *dst++ = '"';
+            src++;
+            break;
+        case '\\':
+            *dst++ = '\\';
+            src++;
+            break;
+        case '/':
+            *dst++ = '/';
+            src++;
+            break;
+        case 'b':
+            *dst++ = '\b';
+            src++;
+            break;
+        case 'f':
+            *dst++ = '\f';
+            src++;
+            break;
+        case 'n':
+            *dst++ = '\n';
+            src++;
+            break;
+        case 'r':
+            *dst++ = '\r';
+            src++;
+            break;
+        case 't':
+            *dst++ = '\t';
+            src++;
+            break;
+        case 'u':
+            if (unlikely(!read_hex_u16(++src, &hi))) {
+                return_err(src - 2, "invalid escaped sequence in string");
+            }
+            src += 4;
+            if (likely((hi & 0xF800) != 0xD800)) {
+                /* a BMP character */
+                if (hi >= 0x800) {
+                    *dst++ = (u8)(0xE0 | (hi >> 12));
+                    *dst++ = (u8)(0x80 | ((hi >> 6) & 0x3F));
+                    *dst++ = (u8)(0x80 | (hi & 0x3F));
+                } else if (hi >= 0x80) {
+                    *dst++ = (u8)(0xC0 | (hi >> 6));
+                    *dst++ = (u8)(0x80 | (hi & 0x3F));
+                } else {
+                    *dst++ = (u8)hi;
+                }
+            } else {
+                /* a non-BMP character, represented as a surrogate pair */
+                if (unlikely((hi & 0xFC00) != 0xD800)) {
+                    return_err(src - 6, "invalid high surrogate in string");
+                }
+                if (unlikely(!byte_match_2(src, "\\u"))) {
+                    return_err(src, "no low surrogate in string");
+                }
+                if (unlikely(!read_hex_u16(src + 2, &lo))) {
+                    return_err(src, "invalid escaped sequence in string");
+                }
+                if (unlikely((lo & 0xFC00) != 0xDC00)) {
+                    return_err(src, "invalid low surrogate in string");
+                }
+                uni = ((((u32)hi - 0xD800) << 10) | ((u32)lo - 0xDC00)) + 0x10000;
+                *dst++ = (u8)(0xF0 | (uni >> 18));
+                *dst++ = (u8)(0x80 | ((uni >> 12) & 0x3F));
+                *dst++ = (u8)(0x80 | ((uni >> 6) & 0x3F));
+                *dst++ = (u8)(0x80 | (uni & 0x3F));
+                src += 6;
+            }
+            break;
+        default:
+            return_err(src, "invalid escaped character in string");
+        }
+    } else if (likely(*src == '"')) {
+        val->tag = ((u64)(dst - cur) << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+        val->uni.str = (const char*)cur;
+        *dst = '\0';
+        *end = src + 1;
+        return true;
+    } else {
+        if (!inv)
+            return_err(src, "unexpected control character in string");
+        if (src >= lst)
+            return_err(src, "unclosed string");
+        *dst++ = *src++;
+    }
+
+copy_ascii:
+    /*
+     Copy continuous ASCII, loop unrolling, same as the following code:
+
+         while (true) repeat16({
+            if (unlikely(char_is_ascii_stop(*src))) break;
+            *dst++ = *src++;
+         })
+     */
+#if YYJSON_IS_REAL_GCC
+#define expr_jump(i)                                                                               \
+    if (likely(!(char_is_ascii_stop(src[i])))) {                                                   \
+    } else {                                                                                       \
+        __asm__ volatile("" : "=m"(src[i]));                                                       \
+        goto copy_ascii_stop_##i;                                                                  \
+    }
+#else
+#define expr_jump(i)                                                                               \
+    if (likely(!(char_is_ascii_stop(src[i])))) {                                                   \
+    } else {                                                                                       \
+        goto copy_ascii_stop_##i;                                                                  \
+    }
+#endif
+    repeat16_incr(expr_jump)
+#undef expr_jump
+
+        byte_move_16(dst, src);
+    src += 16;
+    dst += 16;
+    goto copy_ascii;
+
+    /*
+     The memory will be moved forward by at least 1 byte. So the `byte_move`
+     can be one byte more than needed to reduce the number of instructions.
+     */
+copy_ascii_stop_0:
+    goto copy_utf8;
+copy_ascii_stop_1:
+    byte_move_2(dst, src);
+    src += 1;
+    dst += 1;
+    goto copy_utf8;
+copy_ascii_stop_2:
+    byte_move_2(dst, src);
+    src += 2;
+    dst += 2;
+    goto copy_utf8;
+copy_ascii_stop_3:
+    byte_move_4(dst, src);
+    src += 3;
+    dst += 3;
+    goto copy_utf8;
+copy_ascii_stop_4:
+    byte_move_4(dst, src);
+    src += 4;
+    dst += 4;
+    goto copy_utf8;
+copy_ascii_stop_5:
+    byte_move_4(dst, src);
+    byte_move_2(dst + 4, src + 4);
+    src += 5;
+    dst += 5;
+    goto copy_utf8;
+copy_ascii_stop_6:
+    byte_move_4(dst, src);
+    byte_move_2(dst + 4, src + 4);
+    src += 6;
+    dst += 6;
+    goto copy_utf8;
+copy_ascii_stop_7:
+    byte_move_8(dst, src);
+    src += 7;
+    dst += 7;
+    goto copy_utf8;
+copy_ascii_stop_8:
+    byte_move_8(dst, src);
+    src += 8;
+    dst += 8;
+    goto copy_utf8;
+copy_ascii_stop_9:
+    byte_move_8(dst, src);
+    byte_move_2(dst + 8, src + 8);
+    src += 9;
+    dst += 9;
+    goto copy_utf8;
+copy_ascii_stop_10:
+    byte_move_8(dst, src);
+    byte_move_2(dst + 8, src + 8);
+    src += 10;
+    dst += 10;
+    goto copy_utf8;
+copy_ascii_stop_11:
+    byte_move_8(dst, src);
+    byte_move_4(dst + 8, src + 8);
+    src += 11;
+    dst += 11;
+    goto copy_utf8;
+copy_ascii_stop_12:
+    byte_move_8(dst, src);
+    byte_move_4(dst + 8, src + 8);
+    src += 12;
+    dst += 12;
+    goto copy_utf8;
+copy_ascii_stop_13:
+    byte_move_8(dst, src);
+    byte_move_4(dst + 8, src + 8);
+    byte_move_2(dst + 12, src + 12);
+    src += 13;
+    dst += 13;
+    goto copy_utf8;
+copy_ascii_stop_14:
+    byte_move_8(dst, src);
+    byte_move_4(dst + 8, src + 8);
+    byte_move_2(dst + 12, src + 12);
+    src += 14;
+    dst += 14;
+    goto copy_utf8;
+copy_ascii_stop_15:
+    byte_move_16(dst, src);
+    src += 15;
+    dst += 15;
+    goto copy_utf8;
+
+copy_utf8:
+    if (*src & 0x80) { /* non-ASCII character */
+        pos = src;
+        uni = byte_load_4(src);
+#if YYJSON_DISABLE_UTF8_VALIDATION
+        while (true)
+            repeat4({
+                if ((uni & b3_mask) == b3_patt) {
+                    byte_copy_4(dst, &uni);
+                    dst += 3;
+                    src += 3;
+                    uni = byte_load_4(src);
+                } else
+                    break;
+            }) if ((uni & b1_mask) == b1_patt) goto copy_ascii;
+        while (true)
+            repeat4({
+                if ((uni & b2_mask) == b2_patt) {
+                    byte_copy_2(dst, &uni);
+                    dst += 2;
+                    src += 2;
+                    uni = byte_load_4(src);
+                } else
+                    break;
+            }) while (true) repeat4({
+                if ((uni & b4_mask) == b4_patt) {
+                    byte_copy_4(dst, &uni);
+                    dst += 4;
+                    src += 4;
+                    uni = byte_load_4(src);
+                } else
+                    break;
+            })
+#else
+        while (is_valid_seq_3(uni)) {
+            byte_copy_4(dst, &uni);
+            dst += 3;
+            src += 3;
+            uni = byte_load_4(src);
+        }
+        if (is_valid_seq_1(uni))
+            goto copy_ascii;
+        while (is_valid_seq_2(uni)) {
+            byte_copy_2(dst, &uni);
+            dst += 2;
+            src += 2;
+            uni = byte_load_4(src);
+        }
+        while (is_valid_seq_4(uni)) {
+            byte_copy_4(dst, &uni);
+            dst += 4;
+            src += 4;
+            uni = byte_load_4(src);
+        }
+#endif
+                if (unlikely(pos == src)) {
+                if (!inv)
+                    return_err(src, "invalid UTF-8 encoding in string");
+                goto copy_ascii_stop_1;
+            }
+        goto copy_ascii;
+    }
+    goto copy_escape;
+
+#undef return_err
+#undef is_valid_seq_1
+#undef is_valid_seq_2
+#undef is_valid_seq_3
+#undef is_valid_seq_4
+}
+
+/*==============================================================================
+ * JSON Reader Implementation
+ *
+ * We use goto statements to build the finite state machine (FSM).
+ * The FSM's state was held by program counter (PC) and the 'goto' make the
+ * state transitions.
+ *============================================================================*/
+
+/** Read single value JSON document. */
+static_noinline yyjson_doc* read_root_single(u8* hdr, u8* cur, u8* end, yyjson_alc alc,
+    yyjson_read_flag flg, yyjson_read_err* err) {
+
+#define return_err(_pos, _code, _msg)                                                              \
+    do {                                                                                           \
+        if (is_truncated_end(hdr, _pos, end, YYJSON_READ_ERROR_##_code, flg)) {                    \
+            err->pos = (usize)(end - hdr);                                                         \
+            err->code = YYJSON_READ_ERROR_UNEXPECTED_END;                                          \
+            err->msg = "unexpected end of data";                                                   \
+        } else {                                                                                   \
+            err->pos = (usize)(_pos - hdr);                                                        \
+            err->code = YYJSON_READ_ERROR_##_code;                                                 \
+            err->msg = _msg;                                                                       \
+        }                                                                                          \
+        if (val_hdr)                                                                               \
+            alc.free(alc.ctx, (void*)val_hdr);                                                     \
+        return NULL;                                                                               \
+    } while (false)
+
+    usize hdr_len;       /* value count used by doc */
+    usize alc_num;       /* value count capacity */
+    yyjson_val* val_hdr; /* the head of allocated values */
+    yyjson_val* val;     /* current value */
+    yyjson_doc* doc;     /* the JSON document, equals to val_hdr */
+    const char* msg;     /* error message */
+
+    bool raw;    /* read number as raw */
+    bool inv;    /* allow invalid unicode */
+    u8* raw_end; /* raw end for null-terminator */
+    u8** pre;    /* previous raw end pointer */
+
+    hdr_len = sizeof(yyjson_doc) / sizeof(yyjson_val);
+    hdr_len += (sizeof(yyjson_doc) % sizeof(yyjson_val)) > 0;
+    alc_num = hdr_len + 1; /* single value */
+
+    val_hdr = (yyjson_val*)alc.malloc(alc.ctx, alc_num * sizeof(yyjson_val));
+    if (unlikely(!val_hdr))
+        goto fail_alloc;
+    val = val_hdr + hdr_len;
+    raw = has_read_flag(NUMBER_AS_RAW) || has_read_flag(BIGNUM_AS_RAW);
+    inv = has_read_flag(ALLOW_INVALID_UNICODE) != 0;
+    raw_end = NULL;
+    pre = raw ? &raw_end : NULL;
+
+    if (char_is_number(*cur)) {
+        if (likely(read_number(&cur, pre, flg, val, &msg)))
+            goto doc_end;
+        goto fail_number;
+    }
+    if (*cur == '"') {
+        if (likely(read_string(&cur, end, inv, val, &msg)))
+            goto doc_end;
+        goto fail_string;
+    }
+    if (*cur == 't') {
+        if (likely(read_true(&cur, val)))
+            goto doc_end;
+        goto fail_literal_true;
+    }
+    if (*cur == 'f') {
+        if (likely(read_false(&cur, val)))
+            goto doc_end;
+        goto fail_literal_false;
+    }
+    if (*cur == 'n') {
+        if (likely(read_null(&cur, val)))
+            goto doc_end;
+        if (has_read_flag(ALLOW_INF_AND_NAN)) {
+            if (read_nan(false, &cur, pre, val))
+                goto doc_end;
+        }
+        goto fail_literal_null;
+    }
+    if (has_read_flag(ALLOW_INF_AND_NAN)) {
+        if (read_inf_or_nan(false, &cur, pre, val))
+            goto doc_end;
+    }
+    goto fail_character;
+
+doc_end:
+    /* check invalid contents after json document */
+    if (unlikely(cur < end) && !has_read_flag(STOP_WHEN_DONE)) {
+        if (has_read_flag(ALLOW_COMMENTS)) {
+            if (!skip_spaces_and_comments(&cur)) {
+                if (byte_match_2(cur, "/*"))
+                    goto fail_comment;
+            }
+        } else {
+            while (char_is_space(*cur))
+                cur++;
+        }
+        if (unlikely(cur < end))
+            goto fail_garbage;
+    }
+
+    if (pre && *pre)
+        **pre = '\0';
+    doc = (yyjson_doc*)val_hdr;
+    doc->root = val_hdr + hdr_len;
+    doc->alc = alc;
+    doc->dat_read = (usize)(cur - hdr);
+    doc->val_read = 1;
+    doc->str_pool = has_read_flag(INSITU) ? NULL : (char*)hdr;
+    return doc;
+
+fail_string:
+    return_err(cur, INVALID_STRING, msg);
+fail_number:
+    return_err(cur, INVALID_NUMBER, msg);
+fail_alloc:
+    return_err(cur, MEMORY_ALLOCATION, "memory allocation failed");
+fail_literal_true:
+    return_err(cur, LITERAL, "invalid literal, expected a valid literal such as 'true'");
+fail_literal_false:
+    return_err(cur, LITERAL, "invalid literal, expected a valid literal such as 'false'");
+fail_literal_null:
+    return_err(cur, LITERAL, "invalid literal, expected a valid literal such as 'null'");
+fail_character:
+    return_err(cur, UNEXPECTED_CHARACTER, "unexpected character, expected a valid root value");
+fail_comment:
+    return_err(cur, INVALID_COMMENT, "unclosed multiline comment");
+fail_garbage:
+    return_err(cur, UNEXPECTED_CONTENT, "unexpected content after document");
+
+#undef return_err
+}
+
+/** Read JSON document (accept all style, but optimized for minify). */
+static_inline yyjson_doc* read_root_minify(u8* hdr, u8* cur, u8* end, yyjson_alc alc,
+    yyjson_read_flag flg, yyjson_read_err* err) {
+
+#define return_err(_pos, _code, _msg)                                                              \
+    do {                                                                                           \
+        if (is_truncated_end(hdr, _pos, end, YYJSON_READ_ERROR_##_code, flg)) {                    \
+            err->pos = (usize)(end - hdr);                                                         \
+            err->code = YYJSON_READ_ERROR_UNEXPECTED_END;                                          \
+            err->msg = "unexpected end of data";                                                   \
+        } else {                                                                                   \
+            err->pos = (usize)(_pos - hdr);                                                        \
+            err->code = YYJSON_READ_ERROR_##_code;                                                 \
+            err->msg = _msg;                                                                       \
+        }                                                                                          \
+        if (val_hdr)                                                                               \
+            alc.free(alc.ctx, (void*)val_hdr);                                                     \
+        return NULL;                                                                               \
+    } while (false)
+
+#define val_incr()                                                                                 \
+    do {                                                                                           \
+        val++;                                                                                     \
+        if (unlikely(val >= val_end)) {                                                            \
+            usize alc_old = alc_len;                                                               \
+            alc_len += alc_len / 2;                                                                \
+            if ((sizeof(usize) < 8) && (alc_len >= alc_max))                                       \
+                goto fail_alloc;                                                                   \
+            val_tmp = (yyjson_val*)alc.realloc(alc.ctx, (void*)val_hdr,                            \
+                alc_old * sizeof(yyjson_val), alc_len * sizeof(yyjson_val));                       \
+            if ((!val_tmp))                                                                        \
+                goto fail_alloc;                                                                   \
+            val = val_tmp + (usize)(val - val_hdr);                                                \
+            ctn = val_tmp + (usize)(ctn - val_hdr);                                                \
+            val_hdr = val_tmp;                                                                     \
+            val_end = val_tmp + (alc_len - 2);                                                     \
+        }                                                                                          \
+    } while (false)
+
+    usize dat_len;          /* data length in bytes, hint for allocator */
+    usize hdr_len;          /* value count used by yyjson_doc */
+    usize alc_len;          /* value count allocated */
+    usize alc_max;          /* maximum value count for allocator */
+    usize ctn_len;          /* the number of elements in current container */
+    yyjson_val* val_hdr;    /* the head of allocated values */
+    yyjson_val* val_end;    /* the end of allocated values */
+    yyjson_val* val_tmp;    /* temporary pointer for realloc */
+    yyjson_val* val;        /* current JSON value */
+    yyjson_val* ctn;        /* current container */
+    yyjson_val* ctn_parent; /* parent of current container */
+    yyjson_doc* doc;        /* the JSON document, equals to val_hdr */
+    const char* msg;        /* error message */
+
+    bool raw;    /* read number as raw */
+    bool inv;    /* allow invalid unicode */
+    u8* raw_end; /* raw end for null-terminator */
+    u8** pre;    /* previous raw end pointer */
+
+    dat_len = has_read_flag(STOP_WHEN_DONE) ? 256 : (usize)(end - cur);
+    hdr_len = sizeof(yyjson_doc) / sizeof(yyjson_val);
+    hdr_len += (sizeof(yyjson_doc) % sizeof(yyjson_val)) > 0;
+    alc_max = USIZE_MAX / sizeof(yyjson_val);
+    alc_len = hdr_len + (dat_len / YYJSON_READER_ESTIMATED_MINIFY_RATIO) + 4;
+    alc_len = yyjson_min(alc_len, alc_max);
+
+    val_hdr = (yyjson_val*)alc.malloc(alc.ctx, alc_len * sizeof(yyjson_val));
+    if (unlikely(!val_hdr))
+        goto fail_alloc;
+    val_end = val_hdr + (alc_len - 2); /* padding for key-value pair reading */
+    val = val_hdr + hdr_len;
+    ctn = val;
+    ctn_len = 0;
+    raw = has_read_flag(NUMBER_AS_RAW) || has_read_flag(BIGNUM_AS_RAW);
+    inv = has_read_flag(ALLOW_INVALID_UNICODE) != 0;
+    raw_end = NULL;
+    pre = raw ? &raw_end : NULL;
+
+    if (*cur++ == '{') {
+        ctn->tag = YYJSON_TYPE_OBJ;
+        ctn->uni.ofs = 0;
+        goto obj_key_begin;
+    } else {
+        ctn->tag = YYJSON_TYPE_ARR;
+        ctn->uni.ofs = 0;
+        goto arr_val_begin;
+    }
+
+arr_begin:
+    /* save current container */
+    ctn->tag = (((u64)ctn_len + 1) << YYJSON_TAG_BIT) | (ctn->tag & YYJSON_TAG_MASK);
+
+    /* create a new array value, save parent container offset */
+    val_incr();
+    val->tag = YYJSON_TYPE_ARR;
+    val->uni.ofs = (usize)((u8*)val - (u8*)ctn);
+
+    /* push the new array value as current container */
+    ctn = val;
+    ctn_len = 0;
+
+arr_val_begin:
+    if (*cur == '{') {
+        cur++;
+        goto obj_begin;
+    }
+    if (*cur == '[') {
+        cur++;
+        goto arr_begin;
+    }
+    if (char_is_number(*cur)) {
+        val_incr();
+        ctn_len++;
+        if (likely(read_number(&cur, pre, flg, val, &msg)))
+            goto arr_val_end;
+        goto fail_number;
+    }
+    if (*cur == '"') {
+        val_incr();
+        ctn_len++;
+        if (likely(read_string(&cur, end, inv, val, &msg)))
+            goto arr_val_end;
+        goto fail_string;
+    }
+    if (*cur == 't') {
+        val_incr();
+        ctn_len++;
+        if (likely(read_true(&cur, val)))
+            goto arr_val_end;
+        goto fail_literal_true;
+    }
+    if (*cur == 'f') {
+        val_incr();
+        ctn_len++;
+        if (likely(read_false(&cur, val)))
+            goto arr_val_end;
+        goto fail_literal_false;
+    }
+    if (*cur == 'n') {
+        val_incr();
+        ctn_len++;
+        if (likely(read_null(&cur, val)))
+            goto arr_val_end;
+        if (has_read_flag(ALLOW_INF_AND_NAN)) {
+            if (read_nan(false, &cur, pre, val))
+                goto arr_val_end;
+        }
+        goto fail_literal_null;
+    }
+    if (*cur == ']') {
+        cur++;
+        if (likely(ctn_len == 0))
+            goto arr_end;
+        if (has_read_flag(ALLOW_TRAILING_COMMAS))
+            goto arr_end;
+        while (*cur != ',')
+            cur--;
+        goto fail_trailing_comma;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto arr_val_begin;
+    }
+    if (has_read_flag(ALLOW_INF_AND_NAN) && (*cur == 'i' || *cur == 'I' || *cur == 'N')) {
+        val_incr();
+        ctn_len++;
+        if (read_inf_or_nan(false, &cur, pre, val))
+            goto arr_val_end;
+        goto fail_character_val;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto arr_val_begin;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_val;
+
+arr_val_end:
+    if (*cur == ',') {
+        cur++;
+        goto arr_val_begin;
+    }
+    if (*cur == ']') {
+        cur++;
+        goto arr_end;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto arr_val_end;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto arr_val_end;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_arr_end;
+
+arr_end:
+    /* get parent container */
+    ctn_parent = (yyjson_val*)(void*)((u8*)ctn - ctn->uni.ofs);
+
+    /* save the next sibling value offset */
+    ctn->uni.ofs = (usize)((u8*)val - (u8*)ctn) + sizeof(yyjson_val);
+    ctn->tag = ((ctn_len) << YYJSON_TAG_BIT) | YYJSON_TYPE_ARR;
+    if (unlikely(ctn == ctn_parent))
+        goto doc_end;
+
+    /* pop parent as current container */
+    ctn = ctn_parent;
+    ctn_len = (usize)(ctn->tag >> YYJSON_TAG_BIT);
+    if ((ctn->tag & YYJSON_TYPE_MASK) == YYJSON_TYPE_OBJ) {
+        goto obj_val_end;
+    } else {
+        goto arr_val_end;
+    }
+
+obj_begin:
+    /* push container */
+    ctn->tag = (((u64)ctn_len + 1) << YYJSON_TAG_BIT) | (ctn->tag & YYJSON_TAG_MASK);
+    val_incr();
+    val->tag = YYJSON_TYPE_OBJ;
+    /* offset to the parent */
+    val->uni.ofs = (usize)((u8*)val - (u8*)ctn);
+    ctn = val;
+    ctn_len = 0;
+
+obj_key_begin:
+    if (likely(*cur == '"')) {
+        val_incr();
+        ctn_len++;
+        if (likely(read_string(&cur, end, inv, val, &msg)))
+            goto obj_key_end;
+        goto fail_string;
+    }
+    if (likely(*cur == '}')) {
+        cur++;
+        if (likely(ctn_len == 0))
+            goto obj_end;
+        if (has_read_flag(ALLOW_TRAILING_COMMAS))
+            goto obj_end;
+        while (*cur != ',')
+            cur--;
+        goto fail_trailing_comma;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto obj_key_begin;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto obj_key_begin;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_obj_key;
+
+obj_key_end:
+    if (*cur == ':') {
+        cur++;
+        goto obj_val_begin;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto obj_key_end;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto obj_key_end;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_obj_sep;
+
+obj_val_begin:
+    if (*cur == '"') {
+        val++;
+        ctn_len++;
+        if (likely(read_string(&cur, end, inv, val, &msg)))
+            goto obj_val_end;
+        goto fail_string;
+    }
+    if (char_is_number(*cur)) {
+        val++;
+        ctn_len++;
+        if (likely(read_number(&cur, pre, flg, val, &msg)))
+            goto obj_val_end;
+        goto fail_number;
+    }
+    if (*cur == '{') {
+        cur++;
+        goto obj_begin;
+    }
+    if (*cur == '[') {
+        cur++;
+        goto arr_begin;
+    }
+    if (*cur == 't') {
+        val++;
+        ctn_len++;
+        if (likely(read_true(&cur, val)))
+            goto obj_val_end;
+        goto fail_literal_true;
+    }
+    if (*cur == 'f') {
+        val++;
+        ctn_len++;
+        if (likely(read_false(&cur, val)))
+            goto obj_val_end;
+        goto fail_literal_false;
+    }
+    if (*cur == 'n') {
+        val++;
+        ctn_len++;
+        if (likely(read_null(&cur, val)))
+            goto obj_val_end;
+        if (has_read_flag(ALLOW_INF_AND_NAN)) {
+            if (read_nan(false, &cur, pre, val))
+                goto obj_val_end;
+        }
+        goto fail_literal_null;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto obj_val_begin;
+    }
+    if (has_read_flag(ALLOW_INF_AND_NAN) && (*cur == 'i' || *cur == 'I' || *cur == 'N')) {
+        val++;
+        ctn_len++;
+        if (read_inf_or_nan(false, &cur, pre, val))
+            goto obj_val_end;
+        goto fail_character_val;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto obj_val_begin;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_val;
+
+obj_val_end:
+    if (likely(*cur == ',')) {
+        cur++;
+        goto obj_key_begin;
+    }
+    if (likely(*cur == '}')) {
+        cur++;
+        goto obj_end;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto obj_val_end;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto obj_val_end;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_obj_end;
+
+obj_end:
+    /* pop container */
+    ctn_parent = (yyjson_val*)(void*)((u8*)ctn - ctn->uni.ofs);
+    /* point to the next value */
+    ctn->uni.ofs = (usize)((u8*)val - (u8*)ctn) + sizeof(yyjson_val);
+    ctn->tag = (ctn_len << (YYJSON_TAG_BIT - 1)) | YYJSON_TYPE_OBJ;
+    if (unlikely(ctn == ctn_parent))
+        goto doc_end;
+    ctn = ctn_parent;
+    ctn_len = (usize)(ctn->tag >> YYJSON_TAG_BIT);
+    if ((ctn->tag & YYJSON_TYPE_MASK) == YYJSON_TYPE_OBJ) {
+        goto obj_val_end;
+    } else {
+        goto arr_val_end;
+    }
+
+doc_end:
+    /* check invalid contents after json document */
+    if (unlikely(cur < end) && !has_read_flag(STOP_WHEN_DONE)) {
+        if (has_read_flag(ALLOW_COMMENTS)) {
+            skip_spaces_and_comments(&cur);
+            if (byte_match_2(cur, "/*"))
+                goto fail_comment;
+        } else {
+            while (char_is_space(*cur))
+                cur++;
+        }
+        if (unlikely(cur < end))
+            goto fail_garbage;
+    }
+
+    if (pre && *pre)
+        **pre = '\0';
+    doc = (yyjson_doc*)val_hdr;
+    doc->root = val_hdr + hdr_len;
+    doc->alc = alc;
+    doc->dat_read = (usize)(cur - hdr);
+    doc->val_read = (usize)((val - doc->root) + 1);
+    doc->str_pool = has_read_flag(INSITU) ? NULL : (char*)hdr;
+    return doc;
+
+fail_string:
+    return_err(cur, INVALID_STRING, msg);
+fail_number:
+    return_err(cur, INVALID_NUMBER, msg);
+fail_alloc:
+    return_err(cur, MEMORY_ALLOCATION, "memory allocation failed");
+fail_trailing_comma:
+    return_err(cur, JSON_STRUCTURE, "trailing comma is not allowed");
+fail_literal_true:
+    return_err(cur, LITERAL, "invalid literal, expected a valid literal such as 'true'");
+fail_literal_false:
+    return_err(cur, LITERAL, "invalid literal, expected a valid literal such as 'false'");
+fail_literal_null:
+    return_err(cur, LITERAL, "invalid literal, expected a valid literal such as 'null'");
+fail_character_val:
+    return_err(cur, UNEXPECTED_CHARACTER, "unexpected character, expected a valid JSON value");
+fail_character_arr_end:
+    return_err(cur, UNEXPECTED_CHARACTER,
+        "unexpected character, expected a comma or a closing bracket");
+fail_character_obj_key:
+    return_err(cur, UNEXPECTED_CHARACTER, "unexpected character, expected a string for object key");
+fail_character_obj_sep:
+    return_err(cur, UNEXPECTED_CHARACTER,
+        "unexpected character, expected a colon after object key");
+fail_character_obj_end:
+    return_err(cur, UNEXPECTED_CHARACTER,
+        "unexpected character, expected a comma or a closing brace");
+fail_comment:
+    return_err(cur, INVALID_COMMENT, "unclosed multiline comment");
+fail_garbage:
+    return_err(cur, UNEXPECTED_CONTENT, "unexpected content after document");
+
+#undef val_incr
+#undef return_err
+}
+
+/** Read JSON document (accept all style, but optimized for pretty). */
+static_inline yyjson_doc* read_root_pretty(u8* hdr, u8* cur, u8* end, yyjson_alc alc,
+    yyjson_read_flag flg, yyjson_read_err* err) {
+
+#define return_err(_pos, _code, _msg)                                                              \
+    do {                                                                                           \
+        if (is_truncated_end(hdr, _pos, end, YYJSON_READ_ERROR_##_code, flg)) {                    \
+            err->pos = (usize)(end - hdr);                                                         \
+            err->code = YYJSON_READ_ERROR_UNEXPECTED_END;                                          \
+            err->msg = "unexpected end of data";                                                   \
+        } else {                                                                                   \
+            err->pos = (usize)(_pos - hdr);                                                        \
+            err->code = YYJSON_READ_ERROR_##_code;                                                 \
+            err->msg = _msg;                                                                       \
+        }                                                                                          \
+        if (val_hdr)                                                                               \
+            alc.free(alc.ctx, (void*)val_hdr);                                                     \
+        return NULL;                                                                               \
+    } while (false)
+
+#define val_incr()                                                                                 \
+    do {                                                                                           \
+        val++;                                                                                     \
+        if (unlikely(val >= val_end)) {                                                            \
+            usize alc_old = alc_len;                                                               \
+            alc_len += alc_len / 2;                                                                \
+            if ((sizeof(usize) < 8) && (alc_len >= alc_max))                                       \
+                goto fail_alloc;                                                                   \
+            val_tmp = (yyjson_val*)alc.realloc(alc.ctx, (void*)val_hdr,                            \
+                alc_old * sizeof(yyjson_val), alc_len * sizeof(yyjson_val));                       \
+            if ((!val_tmp))                                                                        \
+                goto fail_alloc;                                                                   \
+            val = val_tmp + (usize)(val - val_hdr);                                                \
+            ctn = val_tmp + (usize)(ctn - val_hdr);                                                \
+            val_hdr = val_tmp;                                                                     \
+            val_end = val_tmp + (alc_len - 2);                                                     \
+        }                                                                                          \
+    } while (false)
+
+    usize dat_len;          /* data length in bytes, hint for allocator */
+    usize hdr_len;          /* value count used by yyjson_doc */
+    usize alc_len;          /* value count allocated */
+    usize alc_max;          /* maximum value count for allocator */
+    usize ctn_len;          /* the number of elements in current container */
+    yyjson_val* val_hdr;    /* the head of allocated values */
+    yyjson_val* val_end;    /* the end of allocated values */
+    yyjson_val* val_tmp;    /* temporary pointer for realloc */
+    yyjson_val* val;        /* current JSON value */
+    yyjson_val* ctn;        /* current container */
+    yyjson_val* ctn_parent; /* parent of current container */
+    yyjson_doc* doc;        /* the JSON document, equals to val_hdr */
+    const char* msg;        /* error message */
+
+    bool raw;    /* read number as raw */
+    bool inv;    /* allow invalid unicode */
+    u8* raw_end; /* raw end for null-terminator */
+    u8** pre;    /* previous raw end pointer */
+
+    dat_len = has_read_flag(STOP_WHEN_DONE) ? 256 : (usize)(end - cur);
+    hdr_len = sizeof(yyjson_doc) / sizeof(yyjson_val);
+    hdr_len += (sizeof(yyjson_doc) % sizeof(yyjson_val)) > 0;
+    alc_max = USIZE_MAX / sizeof(yyjson_val);
+    alc_len = hdr_len + (dat_len / YYJSON_READER_ESTIMATED_PRETTY_RATIO) + 4;
+    alc_len = yyjson_min(alc_len, alc_max);
+
+    val_hdr = (yyjson_val*)alc.malloc(alc.ctx, alc_len * sizeof(yyjson_val));
+    if (unlikely(!val_hdr))
+        goto fail_alloc;
+    val_end = val_hdr + (alc_len - 2); /* padding for key-value pair reading */
+    val = val_hdr + hdr_len;
+    ctn = val;
+    ctn_len = 0;
+    raw = has_read_flag(NUMBER_AS_RAW) || has_read_flag(BIGNUM_AS_RAW);
+    inv = has_read_flag(ALLOW_INVALID_UNICODE) != 0;
+    raw_end = NULL;
+    pre = raw ? &raw_end : NULL;
+
+    if (*cur++ == '{') {
+        ctn->tag = YYJSON_TYPE_OBJ;
+        ctn->uni.ofs = 0;
+        if (*cur == '\n')
+            cur++;
+        goto obj_key_begin;
+    } else {
+        ctn->tag = YYJSON_TYPE_ARR;
+        ctn->uni.ofs = 0;
+        if (*cur == '\n')
+            cur++;
+        goto arr_val_begin;
+    }
+
+arr_begin:
+    /* save current container */
+    ctn->tag = (((u64)ctn_len + 1) << YYJSON_TAG_BIT) | (ctn->tag & YYJSON_TAG_MASK);
+
+    /* create a new array value, save parent container offset */
+    val_incr();
+    val->tag = YYJSON_TYPE_ARR;
+    val->uni.ofs = (usize)((u8*)val - (u8*)ctn);
+
+    /* push the new array value as current container */
+    ctn = val;
+    ctn_len = 0;
+    if (*cur == '\n')
+        cur++;
+
+arr_val_begin:
+#if YYJSON_IS_REAL_GCC
+    while (true)
+        repeat16({
+            if (byte_match_2(cur, "  "))
+                cur += 2;
+            else
+                break;
+        })
+#else
+    while (true)
+        repeat16({
+            if (likely(byte_match_2(cur, "  ")))
+                cur += 2;
+            else
+                break;
+        })
+#endif
+
+            if (*cur == '{') {
+            cur++;
+            goto obj_begin;
+        }
+    if (*cur == '[') {
+        cur++;
+        goto arr_begin;
+    }
+    if (char_is_number(*cur)) {
+        val_incr();
+        ctn_len++;
+        if (likely(read_number(&cur, pre, flg, val, &msg)))
+            goto arr_val_end;
+        goto fail_number;
+    }
+    if (*cur == '"') {
+        val_incr();
+        ctn_len++;
+        if (likely(read_string(&cur, end, inv, val, &msg)))
+            goto arr_val_end;
+        goto fail_string;
+    }
+    if (*cur == 't') {
+        val_incr();
+        ctn_len++;
+        if (likely(read_true(&cur, val)))
+            goto arr_val_end;
+        goto fail_literal_true;
+    }
+    if (*cur == 'f') {
+        val_incr();
+        ctn_len++;
+        if (likely(read_false(&cur, val)))
+            goto arr_val_end;
+        goto fail_literal_false;
+    }
+    if (*cur == 'n') {
+        val_incr();
+        ctn_len++;
+        if (likely(read_null(&cur, val)))
+            goto arr_val_end;
+        if (has_read_flag(ALLOW_INF_AND_NAN)) {
+            if (read_nan(false, &cur, pre, val))
+                goto arr_val_end;
+        }
+        goto fail_literal_null;
+    }
+    if (*cur == ']') {
+        cur++;
+        if (likely(ctn_len == 0))
+            goto arr_end;
+        if (has_read_flag(ALLOW_TRAILING_COMMAS))
+            goto arr_end;
+        while (*cur != ',')
+            cur--;
+        goto fail_trailing_comma;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto arr_val_begin;
+    }
+    if (has_read_flag(ALLOW_INF_AND_NAN) && (*cur == 'i' || *cur == 'I' || *cur == 'N')) {
+        val_incr();
+        ctn_len++;
+        if (read_inf_or_nan(false, &cur, pre, val))
+            goto arr_val_end;
+        goto fail_character_val;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto arr_val_begin;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_val;
+
+arr_val_end:
+    if (byte_match_2(cur, ",\n")) {
+        cur += 2;
+        goto arr_val_begin;
+    }
+    if (*cur == ',') {
+        cur++;
+        goto arr_val_begin;
+    }
+    if (*cur == ']') {
+        cur++;
+        goto arr_end;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto arr_val_end;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto arr_val_end;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_arr_end;
+
+arr_end:
+    /* get parent container */
+    ctn_parent = (yyjson_val*)(void*)((u8*)ctn - ctn->uni.ofs);
+
+    /* save the next sibling value offset */
+    ctn->uni.ofs = (usize)((u8*)val - (u8*)ctn) + sizeof(yyjson_val);
+    ctn->tag = ((ctn_len) << YYJSON_TAG_BIT) | YYJSON_TYPE_ARR;
+    if (unlikely(ctn == ctn_parent))
+        goto doc_end;
+
+    /* pop parent as current container */
+    ctn = ctn_parent;
+    ctn_len = (usize)(ctn->tag >> YYJSON_TAG_BIT);
+    if (*cur == '\n')
+        cur++;
+    if ((ctn->tag & YYJSON_TYPE_MASK) == YYJSON_TYPE_OBJ) {
+        goto obj_val_end;
+    } else {
+        goto arr_val_end;
+    }
+
+obj_begin:
+    /* push container */
+    ctn->tag = (((u64)ctn_len + 1) << YYJSON_TAG_BIT) | (ctn->tag & YYJSON_TAG_MASK);
+    val_incr();
+    val->tag = YYJSON_TYPE_OBJ;
+    /* offset to the parent */
+    val->uni.ofs = (usize)((u8*)val - (u8*)ctn);
+    ctn = val;
+    ctn_len = 0;
+    if (*cur == '\n')
+        cur++;
+
+obj_key_begin:
+#if YYJSON_IS_REAL_GCC
+    while (true)
+        repeat16({
+            if (byte_match_2(cur, "  "))
+                cur += 2;
+            else
+                break;
+        })
+#else
+    while (true)
+        repeat16({
+            if (likely(byte_match_2(cur, "  ")))
+                cur += 2;
+            else
+                break;
+        })
+#endif
+            if (likely(*cur == '"')) {
+            val_incr();
+            ctn_len++;
+            if (likely(read_string(&cur, end, inv, val, &msg)))
+                goto obj_key_end;
+            goto fail_string;
+        }
+    if (likely(*cur == '}')) {
+        cur++;
+        if (likely(ctn_len == 0))
+            goto obj_end;
+        if (has_read_flag(ALLOW_TRAILING_COMMAS))
+            goto obj_end;
+        while (*cur != ',')
+            cur--;
+        goto fail_trailing_comma;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto obj_key_begin;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto obj_key_begin;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_obj_key;
+
+obj_key_end:
+    if (byte_match_2(cur, ": ")) {
+        cur += 2;
+        goto obj_val_begin;
+    }
+    if (*cur == ':') {
+        cur++;
+        goto obj_val_begin;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto obj_key_end;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto obj_key_end;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_obj_sep;
+
+obj_val_begin:
+    if (*cur == '"') {
+        val++;
+        ctn_len++;
+        if (likely(read_string(&cur, end, inv, val, &msg)))
+            goto obj_val_end;
+        goto fail_string;
+    }
+    if (char_is_number(*cur)) {
+        val++;
+        ctn_len++;
+        if (likely(read_number(&cur, pre, flg, val, &msg)))
+            goto obj_val_end;
+        goto fail_number;
+    }
+    if (*cur == '{') {
+        cur++;
+        goto obj_begin;
+    }
+    if (*cur == '[') {
+        cur++;
+        goto arr_begin;
+    }
+    if (*cur == 't') {
+        val++;
+        ctn_len++;
+        if (likely(read_true(&cur, val)))
+            goto obj_val_end;
+        goto fail_literal_true;
+    }
+    if (*cur == 'f') {
+        val++;
+        ctn_len++;
+        if (likely(read_false(&cur, val)))
+            goto obj_val_end;
+        goto fail_literal_false;
+    }
+    if (*cur == 'n') {
+        val++;
+        ctn_len++;
+        if (likely(read_null(&cur, val)))
+            goto obj_val_end;
+        if (has_read_flag(ALLOW_INF_AND_NAN)) {
+            if (read_nan(false, &cur, pre, val))
+                goto obj_val_end;
+        }
+        goto fail_literal_null;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto obj_val_begin;
+    }
+    if (has_read_flag(ALLOW_INF_AND_NAN) && (*cur == 'i' || *cur == 'I' || *cur == 'N')) {
+        val++;
+        ctn_len++;
+        if (read_inf_or_nan(false, &cur, pre, val))
+            goto obj_val_end;
+        goto fail_character_val;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto obj_val_begin;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_val;
+
+obj_val_end:
+    if (byte_match_2(cur, ",\n")) {
+        cur += 2;
+        goto obj_key_begin;
+    }
+    if (likely(*cur == ',')) {
+        cur++;
+        goto obj_key_begin;
+    }
+    if (likely(*cur == '}')) {
+        cur++;
+        goto obj_end;
+    }
+    if (char_is_space(*cur)) {
+        while (char_is_space(*++cur))
+            ;
+        goto obj_val_end;
+    }
+    if (has_read_flag(ALLOW_COMMENTS)) {
+        if (skip_spaces_and_comments(&cur))
+            goto obj_val_end;
+        if (byte_match_2(cur, "/*"))
+            goto fail_comment;
+    }
+    goto fail_character_obj_end;
+
+obj_end:
+    /* pop container */
+    ctn_parent = (yyjson_val*)(void*)((u8*)ctn - ctn->uni.ofs);
+    /* point to the next value */
+    ctn->uni.ofs = (usize)((u8*)val - (u8*)ctn) + sizeof(yyjson_val);
+    ctn->tag = (ctn_len << (YYJSON_TAG_BIT - 1)) | YYJSON_TYPE_OBJ;
+    if (unlikely(ctn == ctn_parent))
+        goto doc_end;
+    ctn = ctn_parent;
+    ctn_len = (usize)(ctn->tag >> YYJSON_TAG_BIT);
+    if (*cur == '\n')
+        cur++;
+    if ((ctn->tag & YYJSON_TYPE_MASK) == YYJSON_TYPE_OBJ) {
+        goto obj_val_end;
+    } else {
+        goto arr_val_end;
+    }
+
+doc_end:
+    /* check invalid contents after json document */
+    if (unlikely(cur < end) && !has_read_flag(STOP_WHEN_DONE)) {
+        if (has_read_flag(ALLOW_COMMENTS)) {
+            skip_spaces_and_comments(&cur);
+            if (byte_match_2(cur, "/*"))
+                goto fail_comment;
+        } else {
+            while (char_is_space(*cur))
+                cur++;
+        }
+        if (unlikely(cur < end))
+            goto fail_garbage;
+    }
+
+    if (pre && *pre)
+        **pre = '\0';
+    doc = (yyjson_doc*)val_hdr;
+    doc->root = val_hdr + hdr_len;
+    doc->alc = alc;
+    doc->dat_read = (usize)(cur - hdr);
+    doc->val_read = (usize)((val - val_hdr)) - hdr_len + 1;
+    doc->str_pool = has_read_flag(INSITU) ? NULL : (char*)hdr;
+    return doc;
+
+fail_string:
+    return_err(cur, INVALID_STRING, msg);
+fail_number:
+    return_err(cur, INVALID_NUMBER, msg);
+fail_alloc:
+    return_err(cur, MEMORY_ALLOCATION, "memory allocation failed");
+fail_trailing_comma:
+    return_err(cur, JSON_STRUCTURE, "trailing comma is not allowed");
+fail_literal_true:
+    return_err(cur, LITERAL, "invalid literal, expected a valid literal such as 'true'");
+fail_literal_false:
+    return_err(cur, LITERAL, "invalid literal, expected a valid literal such as 'false'");
+fail_literal_null:
+    return_err(cur, LITERAL, "invalid literal, expected a valid literal such as 'null'");
+fail_character_val:
+    return_err(cur, UNEXPECTED_CHARACTER, "unexpected character, expected a valid JSON value");
+fail_character_arr_end:
+    return_err(cur, UNEXPECTED_CHARACTER,
+        "unexpected character, expected a comma or a closing bracket");
+fail_character_obj_key:
+    return_err(cur, UNEXPECTED_CHARACTER, "unexpected character, expected a string for object key");
+fail_character_obj_sep:
+    return_err(cur, UNEXPECTED_CHARACTER,
+        "unexpected character, expected a colon after object key");
+fail_character_obj_end:
+    return_err(cur, UNEXPECTED_CHARACTER,
+        "unexpected character, expected a comma or a closing brace");
+fail_comment:
+    return_err(cur, INVALID_COMMENT, "unclosed multiline comment");
+fail_garbage:
+    return_err(cur, UNEXPECTED_CONTENT, "unexpected content after document");
+
+#undef val_incr
+#undef return_err
+}
+
+/*==============================================================================
+ * JSON Reader Entrance
+ *============================================================================*/
+
+yyjson_doc* yyjson_read_opts(char* dat, usize len, yyjson_read_flag flg, const yyjson_alc* alc_ptr,
+    yyjson_read_err* err) {
+
+#define return_err(_pos, _code, _msg)                                                              \
+    do {                                                                                           \
+        err->pos = (usize)(_pos);                                                                  \
+        err->msg = _msg;                                                                           \
+        err->code = YYJSON_READ_ERROR_##_code;                                                     \
+        if (!has_read_flag(INSITU) && hdr)                                                         \
+            alc.free(alc.ctx, (void*)hdr);                                                         \
+        return NULL;                                                                               \
+    } while (false)
+
+    yyjson_read_err dummy_err;
+    yyjson_alc alc;
+    yyjson_doc* doc;
+    u8 *hdr = NULL, *end, *cur;
+
+    /* validate input parameters */
+    if (!err)
+        err = &dummy_err;
+    if (likely(!alc_ptr)) {
+        alc = YYJSON_DEFAULT_ALC;
+    } else {
+        alc = *alc_ptr;
+    }
+    if (unlikely(!dat)) {
+        return_err(0, INVALID_PARAMETER, "input data is NULL");
+    }
+    if (unlikely(!len)) {
+        return_err(0, INVALID_PARAMETER, "input length is 0");
+    }
+
+    /* add 4-byte zero padding for input data if necessary */
+    if (has_read_flag(INSITU)) {
+        hdr = (u8*)dat;
+        end = (u8*)dat + len;
+        cur = (u8*)dat;
+    } else {
+        if (unlikely(len >= USIZE_MAX - YYJSON_PADDING_SIZE)) {
+            return_err(0, MEMORY_ALLOCATION, "memory allocation failed");
+        }
+        hdr = (u8*)alc.malloc(alc.ctx, len + YYJSON_PADDING_SIZE);
+        if (unlikely(!hdr)) {
+            return_err(0, MEMORY_ALLOCATION, "memory allocation failed");
+        }
+        end = hdr + len;
+        cur = hdr;
+        memcpy(hdr, dat, len);
+        memset(end, 0, YYJSON_PADDING_SIZE);
+    }
+
+    /* skip empty contents before json document */
+    if (unlikely(char_is_space_or_comment(*cur))) {
+        if (has_read_flag(ALLOW_COMMENTS)) {
+            if (!skip_spaces_and_comments(&cur)) {
+                return_err(cur - hdr, INVALID_COMMENT, "unclosed multiline comment");
+            }
+        } else {
+            if (likely(char_is_space(*cur))) {
+                while (char_is_space(*++cur))
+                    ;
+            }
+        }
+        if (unlikely(cur >= end)) {
+            return_err(0, EMPTY_CONTENT, "input data is empty");
+        }
+    }
+
+    /* read json document */
+    if (likely(char_is_container(*cur))) {
+        if (char_is_space(cur[1]) && char_is_space(cur[2])) {
+            doc = read_root_pretty(hdr, cur, end, alc, flg, err);
+        } else {
+            doc = read_root_minify(hdr, cur, end, alc, flg, err);
+        }
+    } else {
+        doc = read_root_single(hdr, cur, end, alc, flg, err);
+    }
+
+    /* check result */
+    if (likely(doc)) {
+        memset(err, 0, sizeof(yyjson_read_err));
+    } else {
+        /* RFC 8259: JSON text MUST be encoded using UTF-8 */
+        if (err->pos == 0 && err->code != YYJSON_READ_ERROR_MEMORY_ALLOCATION) {
+            if ((hdr[0] == 0xEF && hdr[1] == 0xBB && hdr[2] == 0xBF)) {
+                err->msg = "byte order mark (BOM) is not supported";
+            } else if (len >= 4 &&
+                       ((hdr[0] == 0x00 && hdr[1] == 0x00 && hdr[2] == 0xFE && hdr[3] == 0xFF) ||
+                           (hdr[0] == 0xFF && hdr[1] == 0xFE && hdr[2] == 0x00 &&
+                               hdr[3] == 0x00))) {
+                err->msg = "UTF-32 encoding is not supported";
+            } else if (len >= 2 &&
+                       ((hdr[0] == 0xFE && hdr[1] == 0xFF) || (hdr[0] == 0xFF && hdr[1] == 0xFE))) {
+                err->msg = "UTF-16 encoding is not supported";
+            }
+        }
+        if (!has_read_flag(INSITU))
+            alc.free(alc.ctx, (void*)hdr);
+    }
+    return doc;
+
+#undef return_err
+}
+
+yyjson_doc* yyjson_read_file(const char* path, yyjson_read_flag flg, const yyjson_alc* alc_ptr,
+    yyjson_read_err* err) {
+#define return_err(_code, _msg)                                                                    \
+    do {                                                                                           \
+        err->pos = 0;                                                                              \
+        err->msg = _msg;                                                                           \
+        err->code = YYJSON_READ_ERROR_##_code;                                                     \
+        return NULL;                                                                               \
+    } while (false)
+
+    yyjson_read_err dummy_err;
+    yyjson_doc* doc;
+    FILE* file;
+
+    if (!err)
+        err = &dummy_err;
+    if (unlikely(!path))
+        return_err(INVALID_PARAMETER, "input path is NULL");
+
+    file = fopen_readonly(path);
+    if (unlikely(!file))
+        return_err(FILE_OPEN, "file opening failed");
+
+    doc = yyjson_read_fp(file, flg, alc_ptr, err);
+    fclose(file);
+    return doc;
+
+#undef return_err
+}
+
+yyjson_doc* yyjson_read_fp(FILE* file, yyjson_read_flag flg, const yyjson_alc* alc_ptr,
+    yyjson_read_err* err) {
+#define return_err(_code, _msg)                                                                    \
+    do {                                                                                           \
+        err->pos = 0;                                                                              \
+        err->msg = _msg;                                                                           \
+        err->code = YYJSON_READ_ERROR_##_code;                                                     \
+        if (buf)                                                                                   \
+            alc.free(alc.ctx, buf);                                                                \
+        return NULL;                                                                               \
+    } while (false)
+
+    yyjson_read_err dummy_err;
+    yyjson_alc alc = alc_ptr ? *alc_ptr : YYJSON_DEFAULT_ALC;
+    yyjson_doc* doc;
+
+    long file_size = 0, file_pos;
+    void* buf = NULL;
+    usize buf_size = 0;
+
+    /* validate input parameters */
+    if (!err)
+        err = &dummy_err;
+    if (unlikely(!file))
+        return_err(INVALID_PARAMETER, "input file is NULL");
+
+    /* get current position */
+    file_pos = ftell(file);
+    if (file_pos != -1) {
+        /* get total file size, may fail */
+        if (fseek(file, 0, SEEK_END) == 0)
+            file_size = ftell(file);
+        /* reset to original position, may fail */
+        if (fseek(file, file_pos, SEEK_SET) != 0)
+            file_size = 0;
+        /* get file size from current postion to end */
+        if (file_size > 0)
+            file_size -= file_pos;
+    }
+
+    /* read file */
+    if (file_size > 0) {
+        /* read the entire file in one call */
+        buf_size = (usize)file_size + YYJSON_PADDING_SIZE;
+        buf = alc.malloc(alc.ctx, buf_size);
+        if (buf == NULL) {
+            return_err(MEMORY_ALLOCATION, "fail to alloc memory");
+        }
+        if (fread_safe(buf, (usize)file_size, file) != (usize)file_size) {
+            return_err(FILE_READ, "file reading failed");
+        }
+    } else {
+        /* failed to get file size, read it as a stream */
+        usize chunk_min = (usize)64;
+        usize chunk_max = (usize)512 * 1024 * 1024;
+        usize chunk_now = chunk_min;
+        usize read_size;
+        void* tmp;
+
+        buf_size = YYJSON_PADDING_SIZE;
+        while (true) {
+            if (buf_size + chunk_now < buf_size) { /* overflow */
+                return_err(MEMORY_ALLOCATION, "fail to alloc memory");
+            }
+            buf_size += chunk_now;
+            if (!buf) {
+                buf = alc.malloc(alc.ctx, buf_size);
+                if (!buf)
+                    return_err(MEMORY_ALLOCATION, "fail to alloc memory");
+            } else {
+                tmp = alc.realloc(alc.ctx, buf, buf_size - chunk_now, buf_size);
+                if (!tmp)
+                    return_err(MEMORY_ALLOCATION, "fail to alloc memory");
+                buf = tmp;
+            }
+            tmp = ((u8*)buf) + buf_size - YYJSON_PADDING_SIZE - chunk_now;
+            read_size = fread_safe(tmp, chunk_now, file);
+            file_size += (long)read_size;
+            if (read_size != chunk_now)
+                break;
+
+            chunk_now *= 2;
+            if (chunk_now > chunk_max)
+                chunk_now = chunk_max;
+        }
+    }
+
+    /* read JSON */
+    memset((u8*)buf + file_size, 0, YYJSON_PADDING_SIZE);
+    flg |= YYJSON_READ_INSITU;
+    doc = yyjson_read_opts((char*)buf, (usize)file_size, flg, &alc, err);
+    if (doc) {
+        doc->str_pool = (char*)buf;
+        return doc;
+    } else {
+        alc.free(alc.ctx, buf);
+        return NULL;
+    }
+
+#undef return_err
+}
+
+const char* yyjson_read_number(const char* dat, yyjson_val* val, yyjson_read_flag flg,
+    const yyjson_alc* alc, yyjson_read_err* err) {
+#define return_err(_pos, _code, _msg)                                                              \
+    do {                                                                                           \
+        err->pos = _pos > hdr ? (usize)(_pos - hdr) : 0;                                           \
+        err->msg = _msg;                                                                           \
+        err->code = YYJSON_READ_ERROR_##_code;                                                     \
+        return NULL;                                                                               \
+    } while (false)
+
+    u8 *hdr = constcast(u8*) dat, *cur = hdr;
+    bool raw;    /* read number as raw */
+    u8* raw_end; /* raw end for null-terminator */
+    u8** pre;    /* previous raw end pointer */
+    const char* msg;
+    yyjson_read_err dummy_err;
+
+#if !YYJSON_HAS_IEEE_754 || YYJSON_DISABLE_FAST_FP_CONV
+    u8 buf[128];
+    usize dat_len;
+#endif
+
+    if (!err)
+        err = &dummy_err;
+    if (unlikely(!dat)) {
+        return_err(cur, INVALID_PARAMETER, "input data is NULL");
+    }
+    if (unlikely(!val)) {
+        return_err(cur, INVALID_PARAMETER, "output value is NULL");
+    }
+
+#if !YYJSON_HAS_IEEE_754 || YYJSON_DISABLE_FAST_FP_CONV
+    if (!alc)
+        alc = &YYJSON_DEFAULT_ALC;
+    dat_len = strlen(dat);
+    if (dat_len < sizeof(buf)) {
+        memcpy(buf, dat, dat_len + 1);
+        hdr = buf;
+        cur = hdr;
+    } else {
+        hdr = (u8*)alc->malloc(alc->ctx, dat_len + 1);
+        cur = hdr;
+        if (unlikely(!hdr)) {
+            return_err(cur, MEMORY_ALLOCATION, "memory allocation failed");
+        }
+        memcpy(hdr, dat, dat_len + 1);
+    }
+    hdr[dat_len] = 0;
+#endif
+
+    raw = (flg & (YYJSON_READ_NUMBER_AS_RAW | YYJSON_READ_BIGNUM_AS_RAW)) != 0;
+    raw_end = NULL;
+    pre = raw ? &raw_end : NULL;
+
+#if !YYJSON_HAS_IEEE_754 || YYJSON_DISABLE_FAST_FP_CONV
+    if (!read_number(&cur, pre, flg, val, &msg)) {
+        if (dat_len >= sizeof(buf))
+            alc->free(alc->ctx, hdr);
+        return_err(cur, INVALID_NUMBER, msg);
+    }
+    if (dat_len >= sizeof(buf))
+        alc->free(alc->ctx, hdr);
+    if (yyjson_is_raw(val))
+        val->uni.str = dat;
+    return dat + (cur - hdr);
+#else
+    if (!read_number(&cur, pre, flg, val, &msg)) {
+        return_err(cur, INVALID_NUMBER, msg);
+    }
+    return (const char*)cur;
+#endif
+
+#undef return_err
+}
+
+#endif /* YYJSON_DISABLE_READER */
+
+#if !YYJSON_DISABLE_WRITER
+
+/*==============================================================================
+ * Integer Writer
+ *
+ * The maximum value of uint32_t is 4294967295 (10 digits),
+ * these digits are named as 'aabbccddee' here.
+ *
+ * Although most compilers may convert the "division by constant value" into
+ * "multiply and shift", manual conversion can still help some compilers
+ * generate fewer and better instructions.
+ *
+ * Reference:
+ * Division by Invariant Integers using Multiplication, 1994.
+ * https://gmplib.org/~tege/divcnst-pldi94.pdf
+ * Improved division by invariant integers, 2011.
+ * https://gmplib.org/~tege/division-paper.pdf
+ *============================================================================*/
+
+/** Digit table from 00 to 99. */
+yyjson_align(2) static const char digit_table[200] = {'0', '0', '0', '1', '0', '2', '0', '3', '0',
+    '4', '0', '5', '0', '6', '0', '7', '0', '8', '0', '9', '1', '0', '1', '1', '1', '2', '1', '3',
+    '1', '4', '1', '5', '1', '6', '1', '7', '1', '8', '1', '9', '2', '0', '2', '1', '2', '2', '2',
+    '3', '2', '4', '2', '5', '2', '6', '2', '7', '2', '8', '2', '9', '3', '0', '3', '1', '3', '2',
+    '3', '3', '3', '4', '3', '5', '3', '6', '3', '7', '3', '8', '3', '9', '4', '0', '4', '1', '4',
+    '2', '4', '3', '4', '4', '4', '5', '4', '6', '4', '7', '4', '8', '4', '9', '5', '0', '5', '1',
+    '5', '2', '5', '3', '5', '4', '5', '5', '5', '6', '5', '7', '5', '8', '5', '9', '6', '0', '6',
+    '1', '6', '2', '6', '3', '6', '4', '6', '5', '6', '6', '6', '7', '6', '8', '6', '9', '7', '0',
+    '7', '1', '7', '2', '7', '3', '7', '4', '7', '5', '7', '6', '7', '7', '7', '8', '7', '9', '8',
+    '0', '8', '1', '8', '2', '8', '3', '8', '4', '8', '5', '8', '6', '8', '7', '8', '8', '8', '9',
+    '9', '0', '9', '1', '9', '2', '9', '3', '9', '4', '9', '5', '9', '6', '9', '7', '9', '8', '9',
+    '9'};
+
+static_inline u8* write_u32_len_8(u32 val, u8* buf) {
+    u32 aa, bb, cc, dd, aabb, ccdd;             /* 8 digits: aabbccdd */
+    aabb = (u32)(((u64)val * 109951163) >> 40); /* (val / 10000) */
+    ccdd = val - aabb * 10000;                  /* (val % 10000) */
+    aa = (aabb * 5243) >> 19;                   /* (aabb / 100) */
+    cc = (ccdd * 5243) >> 19;                   /* (ccdd / 100) */
+    bb = aabb - aa * 100;                       /* (aabb % 100) */
+    dd = ccdd - cc * 100;                       /* (ccdd % 100) */
+    byte_copy_2(buf + 0, digit_table + aa * 2);
+    byte_copy_2(buf + 2, digit_table + bb * 2);
+    byte_copy_2(buf + 4, digit_table + cc * 2);
+    byte_copy_2(buf + 6, digit_table + dd * 2);
+    return buf + 8;
+}
+
+static_inline u8* write_u32_len_4(u32 val, u8* buf) {
+    u32 aa, bb;              /* 4 digits: aabb */
+    aa = (val * 5243) >> 19; /* (val / 100) */
+    bb = val - aa * 100;     /* (val % 100) */
+    byte_copy_2(buf + 0, digit_table + aa * 2);
+    byte_copy_2(buf + 2, digit_table + bb * 2);
+    return buf + 4;
+}
+
+static_inline u8* write_u32_len_1_8(u32 val, u8* buf) {
+    u32 aa, bb, cc, dd, aabb, bbcc, ccdd, lz;
+
+    if (val < 100) {   /* 1-2 digits: aa */
+        lz = val < 10; /* leading zero: 0 or 1 */
+        byte_copy_2(buf + 0, digit_table + val * 2 + lz);
+        buf -= lz;
+        return buf + 2;
+
+    } else if (val < 10000) {    /* 3-4 digits: aabb */
+        aa = (val * 5243) >> 19; /* (val / 100) */
+        bb = val - aa * 100;     /* (val % 100) */
+        lz = aa < 10;            /* leading zero: 0 or 1 */
+        byte_copy_2(buf + 0, digit_table + aa * 2 + lz);
+        buf -= lz;
+        byte_copy_2(buf + 2, digit_table + bb * 2);
+        return buf + 4;
+
+    } else if (val < 1000000) {                /* 5-6 digits: aabbcc */
+        aa = (u32)(((u64)val * 429497) >> 32); /* (val / 10000) */
+        bbcc = val - aa * 10000;               /* (val % 10000) */
+        bb = (bbcc * 5243) >> 19;              /* (bbcc / 100) */
+        cc = bbcc - bb * 100;                  /* (bbcc % 100) */
+        lz = aa < 10;                          /* leading zero: 0 or 1 */
+        byte_copy_2(buf + 0, digit_table + aa * 2 + lz);
+        buf -= lz;
+        byte_copy_2(buf + 2, digit_table + bb * 2);
+        byte_copy_2(buf + 4, digit_table + cc * 2);
+        return buf + 6;
+
+    } else {                                        /* 7-8 digits: aabbccdd */
+        aabb = (u32)(((u64)val * 109951163) >> 40); /* (val / 10000) */
+        ccdd = val - aabb * 10000;                  /* (val % 10000) */
+        aa = (aabb * 5243) >> 19;                   /* (aabb / 100) */
+        cc = (ccdd * 5243) >> 19;                   /* (ccdd / 100) */
+        bb = aabb - aa * 100;                       /* (aabb % 100) */
+        dd = ccdd - cc * 100;                       /* (ccdd % 100) */
+        lz = aa < 10;                               /* leading zero: 0 or 1 */
+        byte_copy_2(buf + 0, digit_table + aa * 2 + lz);
+        buf -= lz;
+        byte_copy_2(buf + 2, digit_table + bb * 2);
+        byte_copy_2(buf + 4, digit_table + cc * 2);
+        byte_copy_2(buf + 6, digit_table + dd * 2);
+        return buf + 8;
+    }
+}
+
+static_inline u8* write_u64_len_5_8(u32 val, u8* buf) {
+    u32 aa, bb, cc, dd, aabb, bbcc, ccdd, lz;
+
+    if (val < 1000000) {                       /* 5-6 digits: aabbcc */
+        aa = (u32)(((u64)val * 429497) >> 32); /* (val / 10000) */
+        bbcc = val - aa * 10000;               /* (val % 10000) */
+        bb = (bbcc * 5243) >> 19;              /* (bbcc / 100) */
+        cc = bbcc - bb * 100;                  /* (bbcc % 100) */
+        lz = aa < 10;                          /* leading zero: 0 or 1 */
+        byte_copy_2(buf + 0, digit_table + aa * 2 + lz);
+        buf -= lz;
+        byte_copy_2(buf + 2, digit_table + bb * 2);
+        byte_copy_2(buf + 4, digit_table + cc * 2);
+        return buf + 6;
+
+    } else {                                        /* 7-8 digits: aabbccdd */
+        aabb = (u32)(((u64)val * 109951163) >> 40); /* (val / 10000) */
+        ccdd = val - aabb * 10000;                  /* (val % 10000) */
+        aa = (aabb * 5243) >> 19;                   /* (aabb / 100) */
+        cc = (ccdd * 5243) >> 19;                   /* (ccdd / 100) */
+        bb = aabb - aa * 100;                       /* (aabb % 100) */
+        dd = ccdd - cc * 100;                       /* (ccdd % 100) */
+        lz = aa < 10;                               /* leading zero: 0 or 1 */
+        byte_copy_2(buf + 0, digit_table + aa * 2 + lz);
+        buf -= lz;
+        byte_copy_2(buf + 2, digit_table + bb * 2);
+        byte_copy_2(buf + 4, digit_table + cc * 2);
+        byte_copy_2(buf + 6, digit_table + dd * 2);
+        return buf + 8;
+    }
+}
+
+static_inline u8* write_u64(u64 val, u8* buf) {
+    u64 tmp, hgh;
+    u32 mid, low;
+
+    if (val < 100000000) { /* 1-8 digits */
+        buf = write_u32_len_1_8((u32)val, buf);
+        return buf;
+
+    } else if (val < (u64)100000000 * 100000000) { /* 9-16 digits */
+        hgh = val / 100000000;                     /* (val / 100000000) */
+        low = (u32)(val - hgh * 100000000);        /* (val % 100000000) */
+        buf = write_u32_len_1_8((u32)hgh, buf);
+        buf = write_u32_len_8(low, buf);
+        return buf;
+
+    } else {                                /* 17-20 digits */
+        tmp = val / 100000000;              /* (val / 100000000) */
+        low = (u32)(val - tmp * 100000000); /* (val % 100000000) */
+        hgh = (u32)(tmp / 10000);           /* (tmp / 10000) */
+        mid = (u32)(tmp - hgh * 10000);     /* (tmp % 10000) */
+        buf = write_u64_len_5_8((u32)hgh, buf);
+        buf = write_u32_len_4(mid, buf);
+        buf = write_u32_len_8(low, buf);
+        return buf;
+    }
+}
+
+/*==============================================================================
+ * Number Writer
+ *============================================================================*/
+
+#if YYJSON_HAS_IEEE_754 && !YYJSON_DISABLE_FAST_FP_CONV /* FP_WRITER */
+
+/** Trailing zero count table for number 0 to 99.
+    (generate with misc/make_tables.c) */
+static const u8 dec_trailing_zero_table[] = {2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0};
+
+/** Write an unsigned integer with a length of 1 to 16. */
+static_inline u8* write_u64_len_1_to_16(u64 val, u8* buf) {
+    u64 hgh;
+    u32 low;
+    if (val < 100000000) { /* 1-8 digits */
+        buf = write_u32_len_1_8((u32)val, buf);
+        return buf;
+    } else {                                /* 9-16 digits */
+        hgh = val / 100000000;              /* (val / 100000000) */
+        low = (u32)(val - hgh * 100000000); /* (val % 100000000) */
+        buf = write_u32_len_1_8((u32)hgh, buf);
+        buf = write_u32_len_8(low, buf);
+        return buf;
+    }
+}
+
+/** Write an unsigned integer with a length of 1 to 17. */
+static_inline u8* write_u64_len_1_to_17(u64 val, u8* buf) {
+    u64 hgh;
+    u32 mid, low, one;
+    if (val >= (u64)100000000 * 10000000) {      /* len: 16 to 17 */
+        hgh = val / 100000000;                   /* (val / 100000000) */
+        low = (u32)(val - hgh * 100000000);      /* (val % 100000000) */
+        one = (u32)(hgh / 100000000);            /* (hgh / 100000000) */
+        mid = (u32)(hgh - (u64)one * 100000000); /* (hgh % 100000000) */
+        *buf = (u8)((u8)one + (u8)'0');
+        buf += one > 0;
+        buf = write_u32_len_8(mid, buf);
+        buf = write_u32_len_8(low, buf);
+        return buf;
+    } else if (val >= (u64)100000000) {     /* len: 9 to 15 */
+        hgh = val / 100000000;              /* (val / 100000000) */
+        low = (u32)(val - hgh * 100000000); /* (val % 100000000) */
+        buf = write_u32_len_1_8((u32)hgh, buf);
+        buf = write_u32_len_8(low, buf);
+        return buf;
+    } else { /* len: 1 to 8 */
+        buf = write_u32_len_1_8((u32)val, buf);
+        return buf;
+    }
+}
+
+/**
+ Write an unsigned integer with a length of 15 to 17 with trailing zero trimmed.
+ These digits are named as "aabbccddeeffgghhii" here.
+ For example, input 1234567890123000, output "1234567890123".
+ */
+static_inline u8* write_u64_len_15_to_17_trim(u8* buf, u64 sig) {
+    bool lz;          /* leading zero */
+    u32 tz1, tz2, tz; /* trailing zero */
+
+    u32 abbccddee = (u32)(sig / 100000000);
+    u32 ffgghhii = (u32)(sig - (u64)abbccddee * 100000000);
+    u32 abbcc = abbccddee / 10000;                /* (abbccddee / 10000) */
+    u32 ddee = abbccddee - abbcc * 10000;         /* (abbccddee % 10000) */
+    u32 abb = (u32)(((u64)abbcc * 167773) >> 24); /* (abbcc / 100) */
+    u32 a = (abb * 41) >> 12;                     /* (abb / 100) */
+    u32 bb = abb - a * 100;                       /* (abb % 100) */
+    u32 cc = abbcc - abb * 100;                   /* (abbcc % 100) */
+
+    /* write abbcc */
+    buf[0] = (u8)(a + '0');
+    buf += a > 0;
+    lz = bb < 10 && a == 0;
+    byte_copy_2(buf + 0, digit_table + bb * 2 + lz);
+    buf -= lz;
+    byte_copy_2(buf + 2, digit_table + cc * 2);
+
+    if (ffgghhii) {
+        u32 dd = (ddee * 5243) >> 19;                        /* (ddee / 100) */
+        u32 ee = ddee - dd * 100;                            /* (ddee % 100) */
+        u32 ffgg = (u32)(((u64)ffgghhii * 109951163) >> 40); /* (val / 10000) */
+        u32 hhii = ffgghhii - ffgg * 10000;                  /* (val % 10000) */
+        u32 ff = (ffgg * 5243) >> 19;                        /* (aabb / 100) */
+        u32 gg = ffgg - ff * 100;                            /* (aabb % 100) */
+        byte_copy_2(buf + 4, digit_table + dd * 2);
+        byte_copy_2(buf + 6, digit_table + ee * 2);
+        byte_copy_2(buf + 8, digit_table + ff * 2);
+        byte_copy_2(buf + 10, digit_table + gg * 2);
+        if (hhii) {
+            u32 hh = (hhii * 5243) >> 19; /* (ccdd / 100) */
+            u32 ii = hhii - hh * 100;     /* (ccdd % 100) */
+            byte_copy_2(buf + 12, digit_table + hh * 2);
+            byte_copy_2(buf + 14, digit_table + ii * 2);
+            tz1 = dec_trailing_zero_table[hh];
+            tz2 = dec_trailing_zero_table[ii];
+            tz = ii ? tz2 : (tz1 + 2);
+            buf += 16 - tz;
+            return buf;
+        } else {
+            tz1 = dec_trailing_zero_table[ff];
+            tz2 = dec_trailing_zero_table[gg];
+            tz = gg ? tz2 : (tz1 + 2);
+            buf += 12 - tz;
+            return buf;
+        }
+    } else {
+        if (ddee) {
+            u32 dd = (ddee * 5243) >> 19; /* (ddee / 100) */
+            u32 ee = ddee - dd * 100;     /* (ddee % 100) */
+            byte_copy_2(buf + 4, digit_table + dd * 2);
+            byte_copy_2(buf + 6, digit_table + ee * 2);
+            tz1 = dec_trailing_zero_table[dd];
+            tz2 = dec_trailing_zero_table[ee];
+            tz = ee ? tz2 : (tz1 + 2);
+            buf += 8 - tz;
+            return buf;
+        } else {
+            tz1 = dec_trailing_zero_table[bb];
+            tz2 = dec_trailing_zero_table[cc];
+            tz = cc ? tz2 : (tz1 + tz2);
+            buf += 4 - tz;
+            return buf;
+        }
+    }
+}
+
+/** Write a signed integer in the range -324 to 308. */
+static_inline u8* write_f64_exp(i32 exp, u8* buf) {
+    buf[0] = '-';
+    buf += exp < 0;
+    exp = exp < 0 ? -exp : exp;
+    if (exp < 100) {
+        u32 lz = exp < 10;
+        byte_copy_2(buf + 0, digit_table + (u32)exp * 2 + lz);
+        return buf + 2 - lz;
+    } else {
+        u32 hi = ((u32)exp * 656) >> 16; /* exp / 100 */
+        u32 lo = (u32)exp - hi * 100;    /* exp % 100 */
+        buf[0] = (u8)((u8)hi + (u8)'0');
+        byte_copy_2(buf + 1, digit_table + lo * 2);
+        return buf + 3;
+    }
+}
+
+/** Multiplies 128-bit integer and returns highest 64-bit rounded value. */
+static_inline u64 round_to_odd(u64 hi, u64 lo, u64 cp) {
+    u64 x_hi, x_lo, y_hi, y_lo;
+    u128_mul(cp, lo, &x_hi, &x_lo);
+    u128_mul_add(cp, hi, x_hi, &y_hi, &y_lo);
+    return y_hi | (y_lo > 1);
+}
+
+/**
+ Convert double number from binary to decimal.
+ The output significand is shortest decimal but may have trailing zeros.
+
+ This function use the Schubfach algorithm:
+ Raffaello Giulietti, The Schubfach way to render doubles (5th version), 2022.
+ https://drive.google.com/file/d/1gp5xv4CAa78SVgCeWfGqqI4FfYYYuNFb
+ https://mail.openjdk.java.net/pipermail/core-libs-dev/2021-November/083536.html
+ https://github.com/openjdk/jdk/pull/3402 (Java implementation)
+ https://github.com/abolz/Drachennest (C++ implementation)
+
+ See also:
+ Dragonbox: A New Floating-Point Binary-to-Decimal Conversion Algorithm, 2022.
+ https://github.com/jk-jeon/dragonbox/blob/master/other_files/Dragonbox.pdf
+ https://github.com/jk-jeon/dragonbox
+
+ @param sig_raw The raw value of significand in IEEE 754 format.
+ @param exp_raw The raw value of exponent in IEEE 754 format.
+ @param sig_bin The decoded value of significand in binary.
+ @param exp_bin The decoded value of exponent in binary.
+ @param sig_dec The output value of significand in decimal.
+ @param exp_dec The output value of exponent in decimal.
+ @warning The input double number should not be 0, inf, nan.
+ */
+static_inline void f64_bin_to_dec(u64 sig_raw, u32 exp_raw, u64 sig_bin, i32 exp_bin, u64* sig_dec,
+    i32* exp_dec) {
+
+    bool is_even, regular_spacing, u_inside, w_inside, round_up;
+    u64 s, sp, cb, cbl, cbr, vb, vbl, vbr, pow10hi, pow10lo, upper, lower, mid;
+    i32 k, h, exp10;
+
+    is_even = !(sig_bin & 1);
+    regular_spacing = (sig_raw == 0 && exp_raw > 1);
+
+    cbl = 4 * sig_bin - 2 + regular_spacing;
+    cb = 4 * sig_bin;
+    cbr = 4 * sig_bin + 2;
+
+    /* exp_bin: [-1074, 971]                                                  */
+    /* k = regular_spacing ? floor(log10(pow(2, exp_bin)))                    */
+    /*                     : floor(log10(pow(2, exp_bin) * 3.0 / 4.0))        */
+    /*   = regular_spacing ? floor(exp_bin * log10(2))                        */
+    /*                     : floor(exp_bin * log10(2) + log10(3.0 / 4.0))     */
+    k = (i32)(exp_bin * 315653 - (regular_spacing ? 131237 : 0)) >> 20;
+
+    /* k: [-324, 292]                                                         */
+    /* h = exp_bin + floor(log2(pow(10, e)))                                  */
+    /*   = exp_bin + floor(log2(10) * e)                                      */
+    exp10 = -k;
+    h = exp_bin + ((exp10 * 217707) >> 16) + 1;
+
+    pow10_table_get_sig(exp10, &pow10hi, &pow10lo);
+    pow10lo += (exp10 < POW10_SIG_TABLE_MIN_EXACT_EXP || exp10 > POW10_SIG_TABLE_MAX_EXACT_EXP);
+    vbl = round_to_odd(pow10hi, pow10lo, cbl << h);
+    vb = round_to_odd(pow10hi, pow10lo, cb << h);
+    vbr = round_to_odd(pow10hi, pow10lo, cbr << h);
+
+    lower = vbl + !is_even;
+    upper = vbr - !is_even;
+
+    s = vb / 4;
+    if (s >= 10) {
+        sp = s / 10;
+        u_inside = (lower <= 40 * sp);
+        w_inside = (upper >= 40 * sp + 40);
+        if (u_inside != w_inside) {
+            *sig_dec = sp + w_inside;
+            *exp_dec = k + 1;
+            return;
+        }
+    }
+
+    u_inside = (lower <= 4 * s);
+    w_inside = (upper >= 4 * s + 4);
+
+    mid = 4 * s + 2;
+    round_up = (vb > mid) || (vb == mid && (s & 1) != 0);
+
+    *sig_dec = s + ((u_inside != w_inside) ? w_inside : round_up);
+    *exp_dec = k;
+}
+
+/**
+ Write a double number (requires 32 bytes buffer).
+
+ We follows the ECMAScript specification to print floating point numbers,
+ but with the following changes:
+ 1. Keep the negative sign of 0.0 to preserve input information.
+ 2. Keep decimal point to indicate the number is floating point.
+ 3. Remove positive sign of exponent part.
+ */
+static_inline u8* write_f64_raw(u8* buf, u64 raw, yyjson_write_flag flg) {
+    u64 sig_bin, sig_dec, sig_raw;
+    i32 exp_bin, exp_dec, sig_len, dot_pos, i, max;
+    u32 exp_raw, hi, lo;
+    u8 *hdr, *num_hdr, *num_end, *dot_end;
+    bool sign;
+
+    /* decode raw bytes from IEEE-754 double format. */
+    sign = (bool)(raw >> (F64_BITS - 1));
+    sig_raw = raw & F64_SIG_MASK;
+    exp_raw = (u32)((raw & F64_EXP_MASK) >> F64_SIG_BITS);
+
+    /* return inf and nan */
+    if (unlikely(exp_raw == ((u32)1 << F64_EXP_BITS) - 1)) {
+        if (has_write_flag(INF_AND_NAN_AS_NULL)) {
+            byte_copy_4(buf, "null");
+            return buf + 4;
+        } else if (has_write_flag(ALLOW_INF_AND_NAN)) {
+            if (sig_raw == 0) {
+                buf[0] = '-';
+                buf += sign;
+                byte_copy_8(buf, "Infinity");
+                buf += 8;
+                return buf;
+            } else {
+                byte_copy_4(buf, "NaN");
+                return buf + 3;
+            }
+        }
+        return NULL;
+    }
+
+    /* add sign for all finite double value, including 0.0 and inf */
+    buf[0] = '-';
+    buf += sign;
+    hdr = buf;
+
+    /* return zero */
+    if ((raw << 1) == 0) {
+        byte_copy_4(buf, "0.0");
+        buf += 3;
+        return buf;
+    }
+
+    if (likely(exp_raw != 0)) {
+        /* normal number */
+        sig_bin = sig_raw | ((u64)1 << F64_SIG_BITS);
+        exp_bin = (i32)exp_raw - F64_EXP_BIAS - F64_SIG_BITS;
+
+        /* fast path for small integer number without fraction */
+        if (-F64_SIG_BITS <= exp_bin && exp_bin <= 0) {
+            if (u64_tz_bits(sig_bin) >= (u32)-exp_bin) {
+                /* number is integer in range 1 to 0x1FFFFFFFFFFFFF */
+                sig_dec = sig_bin >> -exp_bin;
+                buf = write_u64_len_1_to_16(sig_dec, buf);
+                byte_copy_2(buf, ".0");
+                buf += 2;
+                return buf;
+            }
+        }
+
+        /* binary to decimal */
+        f64_bin_to_dec(sig_raw, exp_raw, sig_bin, exp_bin, &sig_dec, &exp_dec);
+
+        /* the sig length is 15 to 17 */
+        sig_len = 17;
+        sig_len -= (sig_dec < (u64)100000000 * 100000000);
+        sig_len -= (sig_dec < (u64)100000000 * 10000000);
+
+        /* the decimal point position relative to the first digit */
+        dot_pos = sig_len + exp_dec;
+
+        if (-6 < dot_pos && dot_pos <= 21) {
+            /* no need to write exponent part */
+            if (dot_pos <= 0) {
+                /* dot before first digit */
+                /* such as 0.1234, 0.000001234 */
+                num_hdr = hdr + (2 - dot_pos);
+                num_end = write_u64_len_15_to_17_trim(num_hdr, sig_dec);
+                hdr[0] = '0';
+                hdr[1] = '.';
+                hdr += 2;
+                max = -dot_pos;
+                for (i = 0; i < max; i++)
+                    hdr[i] = '0';
+                return num_end;
+            } else {
+                /* dot after first digit */
+                /* such as 1.234, 1234.0, 123400000000000000000.0 */
+                memset(hdr + 0, '0', 8);
+                memset(hdr + 8, '0', 8);
+                memset(hdr + 16, '0', 8);
+                num_hdr = hdr + 1;
+                num_end = write_u64_len_15_to_17_trim(num_hdr, sig_dec);
+                for (i = 0; i < dot_pos; i++)
+                    hdr[i] = hdr[i + 1];
+                hdr[dot_pos] = '.';
+                dot_end = hdr + dot_pos + 2;
+                return dot_end < num_end ? num_end : dot_end;
+            }
+        } else {
+            /* write with scientific notation */
+            /* such as 1.234e56 */
+            u8* end = write_u64_len_15_to_17_trim(buf + 1, sig_dec);
+            end -= (end == buf + 2); /* remove '.0', e.g. 2.0e34 -> 2e34 */
+            exp_dec += sig_len - 1;
+            hdr[0] = hdr[1];
+            hdr[1] = '.';
+            end[0] = 'e';
+            buf = write_f64_exp(exp_dec, end + 1);
+            return buf;
+        }
+
+    } else {
+        /* subnormal number */
+        sig_bin = sig_raw;
+        exp_bin = 1 - F64_EXP_BIAS - F64_SIG_BITS;
+
+        /* binary to decimal */
+        f64_bin_to_dec(sig_raw, exp_raw, sig_bin, exp_bin, &sig_dec, &exp_dec);
+
+        /* write significand part */
+        buf = write_u64_len_1_to_17(sig_dec, buf + 1);
+        hdr[0] = hdr[1];
+        hdr[1] = '.';
+        do {
+            buf--;
+            exp_dec++;
+        } while (*buf == '0');
+        exp_dec += (i32)(buf - hdr - 2);
+        buf += (*buf != '.');
+        buf[0] = 'e';
+        buf++;
+
+        /* write exponent part */
+        buf[0] = '-';
+        buf++;
+        exp_dec = -exp_dec;
+        hi = ((u32)exp_dec * 656) >> 16; /* exp / 100 */
+        lo = (u32)exp_dec - hi * 100;    /* exp % 100 */
+        buf[0] = (u8)((u8)hi + (u8)'0');
+        byte_copy_2(buf + 1, digit_table + lo * 2);
+        buf += 3;
+        return buf;
+    }
+}
+
+#else /* FP_WRITER */
+
+/** Write a double number (requires 32 bytes buffer). */
+static_inline u8* write_f64_raw(u8* buf, u64 raw, yyjson_write_flag flg) {
+    /*
+     For IEEE 754, `DBL_DECIMAL_DIG` is 17 for round-trip.
+     For non-IEEE formats, 17 is used to avoid buffer overflow,
+     round-trip is not guaranteed.
+     */
+#if defined(DBL_DECIMAL_DIG) && DBL_DECIMAL_DIG != 17
+    int dig = DBL_DECIMAL_DIG > 17 ? 17 : DBL_DECIMAL_DIG;
+#else
+    int dig = 17;
+#endif
+
+    /*
+     The snprintf() function is locale-dependent. For currently known locales,
+     (en, zh, ja, ko, am, he, hi) use '.' as the decimal point, while other
+     locales use ',' as the decimal point. we need to replace ',' with '.'
+     to avoid the locale setting.
+     */
+    f64 val = f64_from_raw(raw);
+#if YYJSON_MSC_VER >= 1400
+    int len = sprintf_s((char*)buf, 32, "%.*g", dig, val);
+#elif defined(snprintf) || (YYJSON_STDC_VER >= 199901L)
+    int len = snprintf((char*)buf, 32, "%.*g", dig, val);
+#else
+    int len = sprintf((char*)buf, "%.*g", dig, val);
+#endif
+
+    u8* cur = buf;
+    if (unlikely(len < 1))
+        return NULL;
+    cur += (*cur == '-');
+    if (unlikely(!digi_is_digit(*cur))) {
+        /* nan, inf, or bad output */
+        if (has_write_flag(INF_AND_NAN_AS_NULL)) {
+            byte_copy_4(buf, "null");
+            return buf + 4;
+        } else if (has_write_flag(ALLOW_INF_AND_NAN)) {
+            if (*cur == 'i') {
+                byte_copy_8(cur, "Infinity");
+                cur += 8;
+                return cur;
+            } else if (*cur == 'n') {
+                byte_copy_4(buf, "NaN");
+                return buf + 3;
+            }
+        }
+        return NULL;
+    } else {
+        /* finite number */
+        int i = 0;
+        bool fp = false;
+        for (; i < len; i++) {
+            if (buf[i] == ',')
+                buf[i] = '.';
+            if (digi_is_fp((u8)buf[i]))
+                fp = true;
+        }
+        if (!fp) {
+            buf[len++] = '.';
+            buf[len++] = '0';
+        }
+    }
+    return buf + len;
+}
+
+#endif /* FP_WRITER */
+
+/** Write a JSON number (requires 32 bytes buffer). */
+static_inline u8* write_number(u8* cur, yyjson_val* val, yyjson_write_flag flg) {
+    if (val->tag & YYJSON_SUBTYPE_REAL) {
+        u64 raw = val->uni.u64;
+        return write_f64_raw(cur, raw, flg);
+    } else {
+        u64 pos = val->uni.u64;
+        u64 neg = ~pos + 1;
+        usize sgn = ((val->tag & YYJSON_SUBTYPE_SINT) > 0) & ((i64)pos < 0);
+        *cur = '-';
+        return write_u64(sgn ? neg : pos, cur + sgn);
+    }
+}
+
+/*==============================================================================
+ * String Writer
+ *============================================================================*/
+
+/** Character encode type, if (type > CHAR_ENC_ERR_1) bytes = type / 2; */
+typedef u8 char_enc_type;
+#define CHAR_ENC_CPY_1 0 /* 1-byte UTF-8, copy. */
+#define CHAR_ENC_ERR_1 1 /* 1-byte UTF-8, error. */
+#define CHAR_ENC_ESC_A 2 /* 1-byte ASCII, escaped as '\x'. */
+#define CHAR_ENC_ESC_1 3 /* 1-byte UTF-8, escaped as '\uXXXX'. */
+#define CHAR_ENC_CPY_2 4 /* 2-byte UTF-8, copy. */
+#define CHAR_ENC_ESC_2 5 /* 2-byte UTF-8, escaped as '\uXXXX'. */
+#define CHAR_ENC_CPY_3 6 /* 3-byte UTF-8, copy. */
+#define CHAR_ENC_ESC_3 7 /* 3-byte UTF-8, escaped as '\uXXXX'. */
+#define CHAR_ENC_CPY_4 8 /* 4-byte UTF-8, copy. */
+#define CHAR_ENC_ESC_4 9 /* 4-byte UTF-8, escaped as '\uXXXX\uXXXX'. */
+
+/** Character encode type table: don't escape unicode, don't escape '/'.
+    (generate with misc/make_tables.c) */
+static const char_enc_type enc_table_cpy[256] = {3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 3, 2, 2, 3, 3, 3,
+    3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+    4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 8,
+    8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1};
+
+/** Character encode type table: don't escape unicode, escape '/'.
+    (generate with misc/make_tables.c) */
+static const char_enc_type enc_table_cpy_slash[256] = {3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 3, 2, 2, 3,
+    3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+    4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+    6, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1};
+
+/** Character encode type table: escape unicode, don't escape '/'.
+    (generate with misc/make_tables.c) */
+static const char_enc_type enc_table_esc[256] = {3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 3, 2, 2, 3, 3, 3,
+    3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 9,
+    9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1};
+
+/** Character encode type table: escape unicode, escape '/'.
+    (generate with misc/make_tables.c) */
+static const char_enc_type enc_table_esc_slash[256] = {3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 3, 2, 2, 3,
+    3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+    7, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1};
+
+/** Escaped hex character table: ["00" "01" "02" ... "FD" "FE" "FF"].
+    (generate with misc/make_tables.c) */
+yyjson_align(2) static const u8 esc_hex_char_table[512] = {'0', '0', '0', '1', '0', '2', '0', '3',
+    '0', '4', '0', '5', '0', '6', '0', '7', '0', '8', '0', '9', '0', 'A', '0', 'B', '0', 'C', '0',
+    'D', '0', 'E', '0', 'F', '1', '0', '1', '1', '1', '2', '1', '3', '1', '4', '1', '5', '1', '6',
+    '1', '7', '1', '8', '1', '9', '1', 'A', '1', 'B', '1', 'C', '1', 'D', '1', 'E', '1', 'F', '2',
+    '0', '2', '1', '2', '2', '2', '3', '2', '4', '2', '5', '2', '6', '2', '7', '2', '8', '2', '9',
+    '2', 'A', '2', 'B', '2', 'C', '2', 'D', '2', 'E', '2', 'F', '3', '0', '3', '1', '3', '2', '3',
+    '3', '3', '4', '3', '5', '3', '6', '3', '7', '3', '8', '3', '9', '3', 'A', '3', 'B', '3', 'C',
+    '3', 'D', '3', 'E', '3', 'F', '4', '0', '4', '1', '4', '2', '4', '3', '4', '4', '4', '5', '4',
+    '6', '4', '7', '4', '8', '4', '9', '4', 'A', '4', 'B', '4', 'C', '4', 'D', '4', 'E', '4', 'F',
+    '5', '0', '5', '1', '5', '2', '5', '3', '5', '4', '5', '5', '5', '6', '5', '7', '5', '8', '5',
+    '9', '5', 'A', '5', 'B', '5', 'C', '5', 'D', '5', 'E', '5', 'F', '6', '0', '6', '1', '6', '2',
+    '6', '3', '6', '4', '6', '5', '6', '6', '6', '7', '6', '8', '6', '9', '6', 'A', '6', 'B', '6',
+    'C', '6', 'D', '6', 'E', '6', 'F', '7', '0', '7', '1', '7', '2', '7', '3', '7', '4', '7', '5',
+    '7', '6', '7', '7', '7', '8', '7', '9', '7', 'A', '7', 'B', '7', 'C', '7', 'D', '7', 'E', '7',
+    'F', '8', '0', '8', '1', '8', '2', '8', '3', '8', '4', '8', '5', '8', '6', '8', '7', '8', '8',
+    '8', '9', '8', 'A', '8', 'B', '8', 'C', '8', 'D', '8', 'E', '8', 'F', '9', '0', '9', '1', '9',
+    '2', '9', '3', '9', '4', '9', '5', '9', '6', '9', '7', '9', '8', '9', '9', '9', 'A', '9', 'B',
+    '9', 'C', '9', 'D', '9', 'E', '9', 'F', 'A', '0', 'A', '1', 'A', '2', 'A', '3', 'A', '4', 'A',
+    '5', 'A', '6', 'A', '7', 'A', '8', 'A', '9', 'A', 'A', 'A', 'B', 'A', 'C', 'A', 'D', 'A', 'E',
+    'A', 'F', 'B', '0', 'B', '1', 'B', '2', 'B', '3', 'B', '4', 'B', '5', 'B', '6', 'B', '7', 'B',
+    '8', 'B', '9', 'B', 'A', 'B', 'B', 'B', 'C', 'B', 'D', 'B', 'E', 'B', 'F', 'C', '0', 'C', '1',
+    'C', '2', 'C', '3', 'C', '4', 'C', '5', 'C', '6', 'C', '7', 'C', '8', 'C', '9', 'C', 'A', 'C',
+    'B', 'C', 'C', 'C', 'D', 'C', 'E', 'C', 'F', 'D', '0', 'D', '1', 'D', '2', 'D', '3', 'D', '4',
+    'D', '5', 'D', '6', 'D', '7', 'D', '8', 'D', '9', 'D', 'A', 'D', 'B', 'D', 'C', 'D', 'D', 'D',
+    'E', 'D', 'F', 'E', '0', 'E', '1', 'E', '2', 'E', '3', 'E', '4', 'E', '5', 'E', '6', 'E', '7',
+    'E', '8', 'E', '9', 'E', 'A', 'E', 'B', 'E', 'C', 'E', 'D', 'E', 'E', 'E', 'F', 'F', '0', 'F',
+    '1', 'F', '2', 'F', '3', 'F', '4', 'F', '5', 'F', '6', 'F', '7', 'F', '8', 'F', '9', 'F', 'A',
+    'F', 'B', 'F', 'C', 'F', 'D', 'F', 'E', 'F', 'F'};
+
+/** Escaped single character table. (generate with misc/make_tables.c) */
+yyjson_align(2) static const u8 esc_single_char_table[512] = {' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '\\', 'b', '\\', 't', '\\', 'n', ' ', ' ', '\\',
+    'f', '\\', 'r', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', '\\', '"', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '\\', '/', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', '\\', '\\', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
+    ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' '};
+
+/** Returns the encode table with options. */
+static_inline const char_enc_type* get_enc_table_with_flag(yyjson_write_flag flg) {
+    if (has_write_flag(ESCAPE_UNICODE)) {
+        if (has_write_flag(ESCAPE_SLASHES)) {
+            return enc_table_esc_slash;
+        } else {
+            return enc_table_esc;
+        }
+    } else {
+        if (has_write_flag(ESCAPE_SLASHES)) {
+            return enc_table_cpy_slash;
+        } else {
+            return enc_table_cpy;
+        }
+    }
+}
+
+/** Write raw string. */
+static_inline u8* write_raw(u8* cur, const u8* raw, usize raw_len) {
+    memcpy(cur, raw, raw_len);
+    return cur + raw_len;
+}
+
+/**
+ Write string no-escape.
+ @param cur Buffer cursor.
+ @param str A UTF-8 string, null-terminator is not required.
+ @param str_len Length of string in bytes.
+ @return The buffer cursor after string.
+ */
+static_inline u8* write_string_noesc(u8* cur, const u8* str, usize str_len) {
+    *cur++ = '"';
+    while (str_len >= 16) {
+        byte_copy_16(cur, str);
+        cur += 16;
+        str += 16;
+        str_len -= 16;
+    }
+    while (str_len >= 4) {
+        byte_copy_4(cur, str);
+        cur += 4;
+        str += 4;
+        str_len -= 4;
+    }
+    while (str_len) {
+        *cur++ = *str++;
+        str_len -= 1;
+    }
+    *cur++ = '"';
+    return cur;
+}
+
+/**
+ Write UTF-8 string (requires len * 6 + 2 bytes buffer).
+ @param cur Buffer cursor.
+ @param esc Escape unicode.
+ @param inv Allow invalid unicode.
+ @param str A UTF-8 string, null-terminator is not required.
+ @param str_len Length of string in bytes.
+ @param enc_table Encode type table for character.
+ @return The buffer cursor after string, or NULL on invalid unicode.
+ */
+static_inline u8* write_string(u8* cur, bool esc, bool inv, const u8* str, usize str_len,
+    const char_enc_type* enc_table) {
+
+    /* UTF-8 character mask and pattern, see `read_string()` for details. */
+#if YYJSON_ENDIAN == YYJSON_BIG_ENDIAN
+    const u16 b2_mask = 0xE0C0UL;
+    const u16 b2_patt = 0xC080UL;
+    const u16 b2_requ = 0x1E00UL;
+    const u32 b3_mask = 0xF0C0C000UL;
+    const u32 b3_patt = 0xE0808000UL;
+    const u32 b3_requ = 0x0F200000UL;
+    const u32 b3_erro = 0x0D200000UL;
+    const u32 b4_mask = 0xF8C0C0C0UL;
+    const u32 b4_patt = 0xF0808080UL;
+    const u32 b4_requ = 0x07300000UL;
+    const u32 b4_err0 = 0x04000000UL;
+    const u32 b4_err1 = 0x03300000UL;
+#elif YYJSON_ENDIAN == YYJSON_LITTLE_ENDIAN
+    const u16 b2_mask = 0xC0E0UL;
+    const u16 b2_patt = 0x80C0UL;
+    const u16 b2_requ = 0x001EUL;
+    const u32 b3_mask = 0x00C0C0F0UL;
+    const u32 b3_patt = 0x008080E0UL;
+    const u32 b3_requ = 0x0000200FUL;
+    const u32 b3_erro = 0x0000200DUL;
+    const u32 b4_mask = 0xC0C0C0F8UL;
+    const u32 b4_patt = 0x808080F0UL;
+    const u32 b4_requ = 0x00003007UL;
+    const u32 b4_err0 = 0x00000004UL;
+    const u32 b4_err1 = 0x00003003UL;
+#else
+    /* this should be evaluated at compile-time */
+    v16_uni b2_mask_uni = {{0xE0, 0xC0}};
+    v16_uni b2_patt_uni = {{0xC0, 0x80}};
+    v16_uni b2_requ_uni = {{0x1E, 0x00}};
+    v32_uni b3_mask_uni = {{0xF0, 0xC0, 0xC0, 0x00}};
+    v32_uni b3_patt_uni = {{0xE0, 0x80, 0x80, 0x00}};
+    v32_uni b3_requ_uni = {{0x0F, 0x20, 0x00, 0x00}};
+    v32_uni b3_erro_uni = {{0x0D, 0x20, 0x00, 0x00}};
+    v32_uni b4_mask_uni = {{0xF8, 0xC0, 0xC0, 0xC0}};
+    v32_uni b4_patt_uni = {{0xF0, 0x80, 0x80, 0x80}};
+    v32_uni b4_requ_uni = {{0x07, 0x30, 0x00, 0x00}};
+    v32_uni b4_err0_uni = {{0x04, 0x00, 0x00, 0x00}};
+    v32_uni b4_err1_uni = {{0x03, 0x30, 0x00, 0x00}};
+    u16 b2_mask = b2_mask_uni.u;
+    u16 b2_patt = b2_patt_uni.u;
+    u16 b2_requ = b2_requ_uni.u;
+    u32 b3_mask = b3_mask_uni.u;
+    u32 b3_patt = b3_patt_uni.u;
+    u32 b3_requ = b3_requ_uni.u;
+    u32 b3_erro = b3_erro_uni.u;
+    u32 b4_mask = b4_mask_uni.u;
+    u32 b4_patt = b4_patt_uni.u;
+    u32 b4_requ = b4_requ_uni.u;
+    u32 b4_err0 = b4_err0_uni.u;
+    u32 b4_err1 = b4_err1_uni.u;
+#endif
+
+#define is_valid_seq_2(uni) (((uni & b2_mask) == b2_patt) && ((uni & b2_requ)))
+
+#define is_valid_seq_3(uni)                                                                        \
+    (((uni & b3_mask) == b3_patt) && ((tmp = (uni & b3_requ))) && ((tmp != b3_erro)))
+
+#define is_valid_seq_4(uni)                                                                        \
+    (((uni & b4_mask) == b4_patt) && ((tmp = (uni & b4_requ))) &&                                  \
+        ((tmp & b4_err0) == 0 || (tmp & b4_err1) == 0))
+
+    /* The replacement character U+FFFD, used to indicate invalid character. */
+    const v32 rep = {{'F', 'F', 'F', 'D'}};
+    const v32 pre = {{'\\', 'u', '0', '0'}};
+
+    const u8* src = str;
+    const u8* end = str + str_len;
+    *cur++ = '"';
+
+copy_ascii:
+    /*
+     Copy continuous ASCII, loop unrolling, same as the following code:
+
+         while (end > src) (
+            if (unlikely(enc_table[*src])) break;
+            *cur++ = *src++;
+         );
+     */
+#define expr_jump(i)                                                                               \
+    if (unlikely(enc_table[src[i]]))                                                               \
+        goto stop_char_##i;
+
+#define expr_stop(i)                                                                               \
+    stop_char_##i : memcpy(cur, src, i);                                                           \
+    cur += i;                                                                                      \
+    src += i;                                                                                      \
+    goto copy_utf8;
+
+    while (end - src >= 16) {
+        repeat16_incr(expr_jump) byte_copy_16(cur, src);
+        cur += 16;
+        src += 16;
+    }
+
+    while (end - src >= 4) {
+        repeat4_incr(expr_jump) byte_copy_4(cur, src);
+        cur += 4;
+        src += 4;
+    }
+
+    while (end > src) {
+        expr_jump(0)* cur++ = *src++;
+    }
+
+    *cur++ = '"';
+    return cur;
+
+    repeat16_incr(expr_stop)
+
+#undef expr_jump
+#undef expr_stop
+
+        copy_utf8 : if (unlikely(src + 4 > end)) {
+        if (end == src)
+            goto copy_end;
+        if (end - src < enc_table[*src] / 2)
+            goto err_one;
+    }
+    switch (enc_table[*src]) {
+    case CHAR_ENC_CPY_1: {
+        *cur++ = *src++;
+        goto copy_ascii;
+    }
+    case CHAR_ENC_CPY_2: {
+        u16 v;
+#if YYJSON_DISABLE_UTF8_VALIDATION
+        byte_copy_2(cur, src);
+#else
+        v = byte_load_2(src);
+        if (unlikely(!is_valid_seq_2(v)))
+            goto err_cpy;
+        byte_copy_2(cur, src);
+#endif
+        cur += 2;
+        src += 2;
+        goto copy_utf8;
+    }
+    case CHAR_ENC_CPY_3: {
+        u32 v, tmp;
+#if YYJSON_DISABLE_UTF8_VALIDATION
+        if (likely(src + 4 <= end)) {
+            byte_copy_4(cur, src);
+        } else {
+            byte_copy_2(cur, src);
+            cur[2] = src[2];
+        }
+#else
+        if (likely(src + 4 <= end)) {
+            v = byte_load_4(src);
+            if (unlikely(!is_valid_seq_3(v)))
+                goto err_cpy;
+            byte_copy_4(cur, src);
+        } else {
+            v = byte_load_3(src);
+            if (unlikely(!is_valid_seq_3(v)))
+                goto err_cpy;
+            byte_copy_4(cur, &v);
+        }
+#endif
+        cur += 3;
+        src += 3;
+        goto copy_utf8;
+    }
+    case CHAR_ENC_CPY_4: {
+        u32 v, tmp;
+#if YYJSON_DISABLE_UTF8_VALIDATION
+        byte_copy_4(cur, src);
+#else
+        v = byte_load_4(src);
+        if (unlikely(!is_valid_seq_4(v)))
+            goto err_cpy;
+        byte_copy_4(cur, src);
+#endif
+        cur += 4;
+        src += 4;
+        goto copy_utf8;
+    }
+    case CHAR_ENC_ESC_A: {
+        byte_copy_2(cur, &esc_single_char_table[*src * 2]);
+        cur += 2;
+        src += 1;
+        goto copy_utf8;
+    }
+    case CHAR_ENC_ESC_1: {
+        byte_copy_4(cur + 0, &pre);
+        byte_copy_2(cur + 4, &esc_hex_char_table[*src * 2]);
+        cur += 6;
+        src += 1;
+        goto copy_utf8;
+    }
+    case CHAR_ENC_ESC_2: {
+        u16 u, v;
+#if !YYJSON_DISABLE_UTF8_VALIDATION
+        v = byte_load_2(src);
+        if (unlikely(!is_valid_seq_2(v)))
+            goto err_esc;
+#endif
+        u = (u16)(((u16)(src[0] & 0x1F) << 6) | ((u16)(src[1] & 0x3F) << 0));
+        byte_copy_2(cur + 0, &pre);
+        byte_copy_2(cur + 2, &esc_hex_char_table[(u >> 8) * 2]);
+        byte_copy_2(cur + 4, &esc_hex_char_table[(u & 0xFF) * 2]);
+        cur += 6;
+        src += 2;
+        goto copy_utf8;
+    }
+    case CHAR_ENC_ESC_3: {
+        u16 u;
+        u32 v, tmp;
+#if !YYJSON_DISABLE_UTF8_VALIDATION
+        v = byte_load_3(src);
+        if (unlikely(!is_valid_seq_3(v)))
+            goto err_esc;
+#endif
+        u = (u16)(((u16)(src[0] & 0x0F) << 12) | ((u16)(src[1] & 0x3F) << 6) |
+                  ((u16)(src[2] & 0x3F) << 0));
+        byte_copy_2(cur + 0, &pre);
+        byte_copy_2(cur + 2, &esc_hex_char_table[(u >> 8) * 2]);
+        byte_copy_2(cur + 4, &esc_hex_char_table[(u & 0xFF) * 2]);
+        cur += 6;
+        src += 3;
+        goto copy_utf8;
+    }
+    case CHAR_ENC_ESC_4: {
+        u32 hi, lo, u, v, tmp;
+#if !YYJSON_DISABLE_UTF8_VALIDATION
+        v = byte_load_4(src);
+        if (unlikely(!is_valid_seq_4(v)))
+            goto err_esc;
+#endif
+        u = ((u32)(src[0] & 0x07) << 18) | ((u32)(src[1] & 0x3F) << 12) |
+            ((u32)(src[2] & 0x3F) << 6) | ((u32)(src[3] & 0x3F) << 0);
+        u -= 0x10000;
+        hi = (u >> 10) + 0xD800;
+        lo = (u & 0x3FF) + 0xDC00;
+        byte_copy_2(cur + 0, &pre);
+        byte_copy_2(cur + 2, &esc_hex_char_table[(hi >> 8) * 2]);
+        byte_copy_2(cur + 4, &esc_hex_char_table[(hi & 0xFF) * 2]);
+        byte_copy_2(cur + 6, &pre);
+        byte_copy_2(cur + 8, &esc_hex_char_table[(lo >> 8) * 2]);
+        byte_copy_2(cur + 10, &esc_hex_char_table[(lo & 0xFF) * 2]);
+        cur += 12;
+        src += 4;
+        goto copy_utf8;
+    }
+    case CHAR_ENC_ERR_1: {
+        goto err_one;
+    }
+    default:
+        break;
+    }
+
+copy_end:
+    *cur++ = '"';
+    return cur;
+
+err_one:
+    if (esc)
+        goto err_esc;
+    else
+        goto err_cpy;
+
+err_cpy:
+    if (!inv)
+        return NULL;
+    *cur++ = *src++;
+    goto copy_utf8;
+
+err_esc:
+    if (!inv)
+        return NULL;
+    byte_copy_2(cur + 0, &pre);
+    byte_copy_4(cur + 2, &rep);
+    cur += 6;
+    src += 1;
+    goto copy_utf8;
+
+#undef is_valid_seq_2
+#undef is_valid_seq_3
+#undef is_valid_seq_4
+}
+
+/*==============================================================================
+ * Writer Utilities
+ *============================================================================*/
+
+/** Write null (requires 8 bytes buffer). */
+static_inline u8* write_null(u8* cur) {
+    v64 v = {{'n', 'u', 'l', 'l', ',', '\n', 0, 0}};
+    byte_copy_8(cur, &v);
+    return cur + 4;
+}
+
+/** Write bool (requires 8 bytes buffer). */
+static_inline u8* write_bool(u8* cur, bool val) {
+    v64 v0 = {{'f', 'a', 'l', 's', 'e', ',', '\n', 0}};
+    v64 v1 = {{'t', 'r', 'u', 'e', ',', '\n', 0, 0}};
+    if (val) {
+        byte_copy_8(cur, &v1);
+    } else {
+        byte_copy_8(cur, &v0);
+    }
+    return cur + 5 - val;
+}
+
+/** Write indent (requires level x 4 bytes buffer).
+    Param spaces should not larger than 4. */
+static_inline u8* write_indent(u8* cur, usize level, usize spaces) {
+    while (level-- > 0) {
+        byte_copy_4(cur, "    ");
+        cur += spaces;
+    }
+    return cur;
+}
+
+/** Write data to file pointer. */
+static bool write_dat_to_fp(FILE* fp, u8* dat, usize len, yyjson_write_err* err) {
+    if (fwrite(dat, len, 1, fp) != 1) {
+        err->msg = "file writing failed";
+        err->code = YYJSON_WRITE_ERROR_FILE_WRITE;
+        return false;
+    }
+    return true;
+}
+
+/** Write data to file. */
+static bool write_dat_to_file(const char* path, u8* dat, usize len, yyjson_write_err* err) {
+
+#define return_err(_code, _msg)                                                                    \
+    do {                                                                                           \
+        err->msg = _msg;                                                                           \
+        err->code = YYJSON_WRITE_ERROR_##_code;                                                    \
+        if (file)                                                                                  \
+            fclose(file);                                                                          \
+        return false;                                                                              \
+    } while (false)
+
+    FILE* file = fopen_writeonly(path);
+    if (file == NULL) {
+        return_err(FILE_OPEN, "file opening failed");
+    }
+    if (fwrite(dat, len, 1, file) != 1) {
+        return_err(FILE_WRITE, "file writing failed");
+    }
+    if (fclose(file) != 0) {
+        file = NULL;
+        return_err(FILE_WRITE, "file closing failed");
+    }
+    return true;
+
+#undef return_err
+}
+
+/*==============================================================================
+ * JSON Writer Implementation
+ *============================================================================*/
+
+typedef struct yyjson_write_ctx {
+    usize tag;
+} yyjson_write_ctx;
+
+static_inline void yyjson_write_ctx_set(yyjson_write_ctx* ctx, usize size, bool is_obj) {
+    ctx->tag = (size << 1) | (usize)is_obj;
+}
+
+static_inline void yyjson_write_ctx_get(yyjson_write_ctx* ctx, usize* size, bool* is_obj) {
+    usize tag = ctx->tag;
+    *size = tag >> 1;
+    *is_obj = (bool)(tag & 1);
+}
+
+/** Write single JSON value. */
+static_inline u8* yyjson_write_single(yyjson_val* val, yyjson_write_flag flg, yyjson_alc alc,
+    usize* dat_len, yyjson_write_err* err) {
+
+#define return_err(_code, _msg)                                                                    \
+    do {                                                                                           \
+        if (hdr)                                                                                   \
+            alc.free(alc.ctx, (void*)hdr);                                                         \
+        *dat_len = 0;                                                                              \
+        err->code = YYJSON_WRITE_ERROR_##_code;                                                    \
+        err->msg = _msg;                                                                           \
+        return NULL;                                                                               \
+    } while (false)
+
+#define incr_len(_len)                                                                             \
+    do {                                                                                           \
+        hdr = (u8*)alc.malloc(alc.ctx, _len);                                                      \
+        if (!hdr)                                                                                  \
+            goto fail_alloc;                                                                       \
+        cur = hdr;                                                                                 \
+    } while (false)
+
+#define check_str_len(_len)                                                                        \
+    do {                                                                                           \
+        if ((sizeof(usize) < 8) && (_len >= (USIZE_MAX - 16) / 6))                                 \
+            goto fail_alloc;                                                                       \
+    } while (false)
+
+    u8 *hdr = NULL, *cur;
+    usize str_len;
+    const u8* str_ptr;
+    const char_enc_type* enc_table = get_enc_table_with_flag(flg);
+    bool cpy = (enc_table == enc_table_cpy);
+    bool esc = has_write_flag(ESCAPE_UNICODE) != 0;
+    bool inv = has_write_flag(ALLOW_INVALID_UNICODE) != 0;
+    bool newline = has_write_flag(NEWLINE_AT_END) != 0;
+    const usize end_len = 2; /* '\n' and '\0' */
+
+    switch (unsafe_yyjson_get_type(val)) {
+    case YYJSON_TYPE_RAW:
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len + end_len);
+        cur = write_raw(cur, str_ptr, str_len);
+        break;
+
+    case YYJSON_TYPE_STR:
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len * 6 + 2 + end_len);
+        if (likely(cpy) && unsafe_yyjson_get_subtype(val)) {
+            cur = write_string_noesc(cur, str_ptr, str_len);
+        } else {
+            cur = write_string(cur, esc, inv, str_ptr, str_len, enc_table);
+            if (unlikely(!cur))
+                goto fail_str;
+        }
+        break;
+
+    case YYJSON_TYPE_NUM:
+        incr_len(32 + end_len);
+        cur = write_number(cur, val, flg);
+        if (unlikely(!cur))
+            goto fail_num;
+        break;
+
+    case YYJSON_TYPE_BOOL:
+        incr_len(8);
+        cur = write_bool(cur, unsafe_yyjson_get_bool(val));
+        break;
+
+    case YYJSON_TYPE_NULL:
+        incr_len(8);
+        cur = write_null(cur);
+        break;
+
+    case YYJSON_TYPE_ARR:
+        incr_len(2 + end_len);
+        byte_copy_2(cur, "[]");
+        cur += 2;
+        break;
+
+    case YYJSON_TYPE_OBJ:
+        incr_len(2 + end_len);
+        byte_copy_2(cur, "{}");
+        cur += 2;
+        break;
+
+    default:
+        goto fail_type;
+    }
+
+    if (newline)
+        *cur++ = '\n';
+    *cur = '\0';
+    *dat_len = (usize)(cur - hdr);
+    memset(err, 0, sizeof(yyjson_write_err));
+    return hdr;
+
+fail_alloc:
+    return_err(MEMORY_ALLOCATION, "memory allocation failed");
+fail_type:
+    return_err(INVALID_VALUE_TYPE, "invalid JSON value type");
+fail_num:
+    return_err(NAN_OR_INF, "nan or inf number is not allowed");
+fail_str:
+    return_err(INVALID_STRING, "invalid utf-8 encoding in string");
+
+#undef return_err
+#undef check_str_len
+#undef incr_len
+}
+
+/** Write JSON document minify.
+    The root of this document should be a non-empty container. */
+static_inline u8* yyjson_write_minify(const yyjson_val* root, const yyjson_write_flag flg,
+    const yyjson_alc alc, usize* dat_len, yyjson_write_err* err) {
+
+#define return_err(_code, _msg)                                                                    \
+    do {                                                                                           \
+        *dat_len = 0;                                                                              \
+        err->code = YYJSON_WRITE_ERROR_##_code;                                                    \
+        err->msg = _msg;                                                                           \
+        if (hdr)                                                                                   \
+            alc.free(alc.ctx, hdr);                                                                \
+        return NULL;                                                                               \
+    } while (false)
+
+#define incr_len(_len)                                                                             \
+    do {                                                                                           \
+        ext_len = (usize)(_len);                                                                   \
+        if (unlikely((u8*)(cur + ext_len) >= (u8*)ctx)) {                                          \
+            alc_inc = yyjson_max(alc_len / 2, ext_len);                                            \
+            alc_inc = size_align_up(alc_inc, sizeof(yyjson_write_ctx));                            \
+            if ((sizeof(usize) < 8) && size_add_is_overflow(alc_len, alc_inc))                     \
+                goto fail_alloc;                                                                   \
+            alc_len += alc_inc;                                                                    \
+            tmp = (u8*)alc.realloc(alc.ctx, hdr, alc_len - alc_inc, alc_len);                      \
+            if (unlikely(!tmp))                                                                    \
+                goto fail_alloc;                                                                   \
+            ctx_len = (usize)(end - (u8*)ctx);                                                     \
+            ctx_tmp = (yyjson_write_ctx*)(void*)(tmp + (alc_len - ctx_len));                       \
+            memmove((void*)ctx_tmp, (void*)(tmp + ((u8*)ctx - hdr)), ctx_len);                     \
+            ctx = ctx_tmp;                                                                         \
+            cur = tmp + (cur - hdr);                                                               \
+            end = tmp + alc_len;                                                                   \
+            hdr = tmp;                                                                             \
+        }                                                                                          \
+    } while (false)
+
+#define check_str_len(_len)                                                                        \
+    do {                                                                                           \
+        if ((sizeof(usize) < 8) && (_len >= (USIZE_MAX - 16) / 6))                                 \
+            goto fail_alloc;                                                                       \
+    } while (false)
+
+    yyjson_val* val;
+    yyjson_type val_type;
+    usize ctn_len, ctn_len_tmp;
+    bool ctn_obj, ctn_obj_tmp, is_key;
+    u8 *hdr, *cur, *end, *tmp;
+    yyjson_write_ctx *ctx, *ctx_tmp;
+    usize alc_len, alc_inc, ctx_len, ext_len, str_len;
+    const u8* str_ptr;
+    const char_enc_type* enc_table = get_enc_table_with_flag(flg);
+    bool cpy = (enc_table == enc_table_cpy);
+    bool esc = has_write_flag(ESCAPE_UNICODE) != 0;
+    bool inv = has_write_flag(ALLOW_INVALID_UNICODE) != 0;
+    bool newline = has_write_flag(NEWLINE_AT_END) != 0;
+
+    alc_len = root->uni.ofs / sizeof(yyjson_val);
+    alc_len = alc_len * YYJSON_WRITER_ESTIMATED_MINIFY_RATIO + 64;
+    alc_len = size_align_up(alc_len, sizeof(yyjson_write_ctx));
+    hdr = (u8*)alc.malloc(alc.ctx, alc_len);
+    if (!hdr)
+        goto fail_alloc;
+    cur = hdr;
+    end = hdr + alc_len;
+    ctx = (yyjson_write_ctx*)(void*)end;
+
+doc_begin:
+    val = constcast(yyjson_val*) root;
+    val_type = unsafe_yyjson_get_type(val);
+    ctn_obj = (val_type == YYJSON_TYPE_OBJ);
+    ctn_len = unsafe_yyjson_get_len(val) << (u8)ctn_obj;
+    *cur++ = (u8)('[' | ((u8)ctn_obj << 5));
+    val++;
+
+val_begin:
+    val_type = unsafe_yyjson_get_type(val);
+    if (val_type == YYJSON_TYPE_STR) {
+        is_key = ((u8)ctn_obj & (u8)~ctn_len);
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len * 6 + 16);
+        if (likely(cpy) && unsafe_yyjson_get_subtype(val)) {
+            cur = write_string_noesc(cur, str_ptr, str_len);
+        } else {
+            cur = write_string(cur, esc, inv, str_ptr, str_len, enc_table);
+            if (unlikely(!cur))
+                goto fail_str;
+        }
+        *cur++ = is_key ? ':' : ',';
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_NUM) {
+        incr_len(32);
+        cur = write_number(cur, val, flg);
+        if (unlikely(!cur))
+            goto fail_num;
+        *cur++ = ',';
+        goto val_end;
+    }
+    if ((val_type & (YYJSON_TYPE_ARR & YYJSON_TYPE_OBJ)) == (YYJSON_TYPE_ARR & YYJSON_TYPE_OBJ)) {
+        ctn_len_tmp = unsafe_yyjson_get_len(val);
+        ctn_obj_tmp = (val_type == YYJSON_TYPE_OBJ);
+        incr_len(16);
+        if (unlikely(ctn_len_tmp == 0)) {
+            /* write empty container */
+            *cur++ = (u8)('[' | ((u8)ctn_obj_tmp << 5));
+            *cur++ = (u8)(']' | ((u8)ctn_obj_tmp << 5));
+            *cur++ = ',';
+            goto val_end;
+        } else {
+            /* push context, setup new container */
+            yyjson_write_ctx_set(--ctx, ctn_len, ctn_obj);
+            ctn_len = ctn_len_tmp << (u8)ctn_obj_tmp;
+            ctn_obj = ctn_obj_tmp;
+            *cur++ = (u8)('[' | ((u8)ctn_obj << 5));
+            val++;
+            goto val_begin;
+        }
+    }
+    if (val_type == YYJSON_TYPE_BOOL) {
+        incr_len(16);
+        cur = write_bool(cur, unsafe_yyjson_get_bool(val));
+        cur++;
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_NULL) {
+        incr_len(16);
+        cur = write_null(cur);
+        cur++;
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_RAW) {
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len + 2);
+        cur = write_raw(cur, str_ptr, str_len);
+        *cur++ = ',';
+        goto val_end;
+    }
+    goto fail_type;
+
+val_end:
+    val++;
+    ctn_len--;
+    if (unlikely(ctn_len == 0))
+        goto ctn_end;
+    goto val_begin;
+
+ctn_end:
+    cur--;
+    *cur++ = (u8)(']' | ((u8)ctn_obj << 5));
+    *cur++ = ',';
+    if (unlikely((u8*)ctx >= end))
+        goto doc_end;
+    yyjson_write_ctx_get(ctx++, &ctn_len, &ctn_obj);
+    ctn_len--;
+    if (likely(ctn_len > 0)) {
+        goto val_begin;
+    } else {
+        goto ctn_end;
+    }
+
+doc_end:
+    if (newline) {
+        incr_len(2);
+        *(cur - 1) = '\n';
+        cur++;
+    }
+    *--cur = '\0';
+    *dat_len = (usize)(cur - hdr);
+    memset(err, 0, sizeof(yyjson_write_err));
+    return hdr;
+
+fail_alloc:
+    return_err(MEMORY_ALLOCATION, "memory allocation failed");
+fail_type:
+    return_err(INVALID_VALUE_TYPE, "invalid JSON value type");
+fail_num:
+    return_err(NAN_OR_INF, "nan or inf number is not allowed");
+fail_str:
+    return_err(INVALID_STRING, "invalid utf-8 encoding in string");
+
+#undef return_err
+#undef incr_len
+#undef check_str_len
+}
+
+/** Write JSON document pretty.
+    The root of this document should be a non-empty container. */
+static_inline u8* yyjson_write_pretty(const yyjson_val* root, const yyjson_write_flag flg,
+    const yyjson_alc alc, usize* dat_len, yyjson_write_err* err) {
+
+#define return_err(_code, _msg)                                                                    \
+    do {                                                                                           \
+        *dat_len = 0;                                                                              \
+        err->code = YYJSON_WRITE_ERROR_##_code;                                                    \
+        err->msg = _msg;                                                                           \
+        if (hdr)                                                                                   \
+            alc.free(alc.ctx, hdr);                                                                \
+        return NULL;                                                                               \
+    } while (false)
+
+#define incr_len(_len)                                                                             \
+    do {                                                                                           \
+        ext_len = (usize)(_len);                                                                   \
+        if (unlikely((u8*)(cur + ext_len) >= (u8*)ctx)) {                                          \
+            alc_inc = yyjson_max(alc_len / 2, ext_len);                                            \
+            alc_inc = size_align_up(alc_inc, sizeof(yyjson_write_ctx));                            \
+            if ((sizeof(usize) < 8) && size_add_is_overflow(alc_len, alc_inc))                     \
+                goto fail_alloc;                                                                   \
+            alc_len += alc_inc;                                                                    \
+            tmp = (u8*)alc.realloc(alc.ctx, hdr, alc_len - alc_inc, alc_len);                      \
+            if (unlikely(!tmp))                                                                    \
+                goto fail_alloc;                                                                   \
+            ctx_len = (usize)(end - (u8*)ctx);                                                     \
+            ctx_tmp = (yyjson_write_ctx*)(void*)(tmp + (alc_len - ctx_len));                       \
+            memmove((void*)ctx_tmp, (void*)(tmp + ((u8*)ctx - hdr)), ctx_len);                     \
+            ctx = ctx_tmp;                                                                         \
+            cur = tmp + (cur - hdr);                                                               \
+            end = tmp + alc_len;                                                                   \
+            hdr = tmp;                                                                             \
+        }                                                                                          \
+    } while (false)
+
+#define check_str_len(_len)                                                                        \
+    do {                                                                                           \
+        if ((sizeof(usize) < 8) && (_len >= (USIZE_MAX - 16) / 6))                                 \
+            goto fail_alloc;                                                                       \
+    } while (false)
+
+    yyjson_val* val;
+    yyjson_type val_type;
+    usize ctn_len, ctn_len_tmp;
+    bool ctn_obj, ctn_obj_tmp, is_key, no_indent;
+    u8 *hdr, *cur, *end, *tmp;
+    yyjson_write_ctx *ctx, *ctx_tmp;
+    usize alc_len, alc_inc, ctx_len, ext_len, str_len, level;
+    const u8* str_ptr;
+    const char_enc_type* enc_table = get_enc_table_with_flag(flg);
+    bool cpy = (enc_table == enc_table_cpy);
+    bool esc = has_write_flag(ESCAPE_UNICODE) != 0;
+    bool inv = has_write_flag(ALLOW_INVALID_UNICODE) != 0;
+    usize spaces = has_write_flag(PRETTY_TWO_SPACES) ? 2 : 4;
+    bool newline = has_write_flag(NEWLINE_AT_END) != 0;
+
+    alc_len = root->uni.ofs / sizeof(yyjson_val);
+    alc_len = alc_len * YYJSON_WRITER_ESTIMATED_PRETTY_RATIO + 64;
+    alc_len = size_align_up(alc_len, sizeof(yyjson_write_ctx));
+    hdr = (u8*)alc.malloc(alc.ctx, alc_len);
+    if (!hdr)
+        goto fail_alloc;
+    cur = hdr;
+    end = hdr + alc_len;
+    ctx = (yyjson_write_ctx*)(void*)end;
+
+doc_begin:
+    val = constcast(yyjson_val*) root;
+    val_type = unsafe_yyjson_get_type(val);
+    ctn_obj = (val_type == YYJSON_TYPE_OBJ);
+    ctn_len = unsafe_yyjson_get_len(val) << (u8)ctn_obj;
+    *cur++ = (u8)('[' | ((u8)ctn_obj << 5));
+    *cur++ = '\n';
+    val++;
+    level = 1;
+
+val_begin:
+    val_type = unsafe_yyjson_get_type(val);
+    if (val_type == YYJSON_TYPE_STR) {
+        is_key = (bool)((u8)ctn_obj & (u8)~ctn_len);
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len * 6 + 16 + (no_indent ? 0 : level * 4));
+        cur = write_indent(cur, no_indent ? 0 : level, spaces);
+        if (likely(cpy) && unsafe_yyjson_get_subtype(val)) {
+            cur = write_string_noesc(cur, str_ptr, str_len);
+        } else {
+            cur = write_string(cur, esc, inv, str_ptr, str_len, enc_table);
+            if (unlikely(!cur))
+                goto fail_str;
+        }
+        *cur++ = is_key ? ':' : ',';
+        *cur++ = is_key ? ' ' : '\n';
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_NUM) {
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        incr_len(32 + (no_indent ? 0 : level * 4));
+        cur = write_indent(cur, no_indent ? 0 : level, spaces);
+        cur = write_number(cur, val, flg);
+        if (unlikely(!cur))
+            goto fail_num;
+        *cur++ = ',';
+        *cur++ = '\n';
+        goto val_end;
+    }
+    if ((val_type & (YYJSON_TYPE_ARR & YYJSON_TYPE_OBJ)) == (YYJSON_TYPE_ARR & YYJSON_TYPE_OBJ)) {
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        ctn_len_tmp = unsafe_yyjson_get_len(val);
+        ctn_obj_tmp = (val_type == YYJSON_TYPE_OBJ);
+        if (unlikely(ctn_len_tmp == 0)) {
+            /* write empty container */
+            incr_len(16 + (no_indent ? 0 : level * 4));
+            cur = write_indent(cur, no_indent ? 0 : level, spaces);
+            *cur++ = (u8)('[' | ((u8)ctn_obj_tmp << 5));
+            *cur++ = (u8)(']' | ((u8)ctn_obj_tmp << 5));
+            *cur++ = ',';
+            *cur++ = '\n';
+            goto val_end;
+        } else {
+            /* push context, setup new container */
+            incr_len(32 + (no_indent ? 0 : level * 4));
+            yyjson_write_ctx_set(--ctx, ctn_len, ctn_obj);
+            ctn_len = ctn_len_tmp << (u8)ctn_obj_tmp;
+            ctn_obj = ctn_obj_tmp;
+            cur = write_indent(cur, no_indent ? 0 : level, spaces);
+            level++;
+            *cur++ = (u8)('[' | ((u8)ctn_obj << 5));
+            *cur++ = '\n';
+            val++;
+            goto val_begin;
+        }
+    }
+    if (val_type == YYJSON_TYPE_BOOL) {
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        incr_len(16 + (no_indent ? 0 : level * 4));
+        cur = write_indent(cur, no_indent ? 0 : level, spaces);
+        cur = write_bool(cur, unsafe_yyjson_get_bool(val));
+        cur += 2;
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_NULL) {
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        incr_len(16 + (no_indent ? 0 : level * 4));
+        cur = write_indent(cur, no_indent ? 0 : level, spaces);
+        cur = write_null(cur);
+        cur += 2;
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_RAW) {
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len + 3);
+        cur = write_raw(cur, str_ptr, str_len);
+        *cur++ = ',';
+        *cur++ = '\n';
+        goto val_end;
+    }
+    goto fail_type;
+
+val_end:
+    val++;
+    ctn_len--;
+    if (unlikely(ctn_len == 0))
+        goto ctn_end;
+    goto val_begin;
+
+ctn_end:
+    cur -= 2;
+    *cur++ = '\n';
+    incr_len(level * 4);
+    cur = write_indent(cur, --level, spaces);
+    *cur++ = (u8)(']' | ((u8)ctn_obj << 5));
+    if (unlikely((u8*)ctx >= end))
+        goto doc_end;
+    yyjson_write_ctx_get(ctx++, &ctn_len, &ctn_obj);
+    ctn_len--;
+    *cur++ = ',';
+    *cur++ = '\n';
+    if (likely(ctn_len > 0)) {
+        goto val_begin;
+    } else {
+        goto ctn_end;
+    }
+
+doc_end:
+    if (newline) {
+        incr_len(2);
+        *cur++ = '\n';
+    }
+    *cur = '\0';
+    *dat_len = (usize)(cur - hdr);
+    memset(err, 0, sizeof(yyjson_write_err));
+    return hdr;
+
+fail_alloc:
+    return_err(MEMORY_ALLOCATION, "memory allocation failed");
+fail_type:
+    return_err(INVALID_VALUE_TYPE, "invalid JSON value type");
+fail_num:
+    return_err(NAN_OR_INF, "nan or inf number is not allowed");
+fail_str:
+    return_err(INVALID_STRING, "invalid utf-8 encoding in string");
+
+#undef return_err
+#undef incr_len
+#undef check_str_len
+}
+
+char* yyjson_val_write_opts(const yyjson_val* val, yyjson_write_flag flg, const yyjson_alc* alc_ptr,
+    usize* dat_len, yyjson_write_err* err) {
+    yyjson_write_err dummy_err;
+    usize dummy_dat_len;
+    yyjson_alc alc = alc_ptr ? *alc_ptr : YYJSON_DEFAULT_ALC;
+    yyjson_val* root = constcast(yyjson_val*) val;
+
+    err = err ? err : &dummy_err;
+    dat_len = dat_len ? dat_len : &dummy_dat_len;
+
+    if (unlikely(!root)) {
+        *dat_len = 0;
+        err->msg = "input JSON is NULL";
+        err->code = YYJSON_READ_ERROR_INVALID_PARAMETER;
+        return NULL;
+    }
+
+    if (!unsafe_yyjson_is_ctn(root) || unsafe_yyjson_get_len(root) == 0) {
+        return (char*)yyjson_write_single(root, flg, alc, dat_len, err);
+    } else if (flg & (YYJSON_WRITE_PRETTY | YYJSON_WRITE_PRETTY_TWO_SPACES)) {
+        return (char*)yyjson_write_pretty(root, flg, alc, dat_len, err);
+    } else {
+        return (char*)yyjson_write_minify(root, flg, alc, dat_len, err);
+    }
+}
+
+char* yyjson_write_opts(const yyjson_doc* doc, yyjson_write_flag flg, const yyjson_alc* alc_ptr,
+    usize* dat_len, yyjson_write_err* err) {
+    yyjson_val* root = doc ? doc->root : NULL;
+    return yyjson_val_write_opts(root, flg, alc_ptr, dat_len, err);
+}
+
+bool yyjson_val_write_file(const char* path, const yyjson_val* val, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, yyjson_write_err* err) {
+    yyjson_write_err dummy_err;
+    u8* dat;
+    usize dat_len = 0;
+    yyjson_val* root = constcast(yyjson_val*) val;
+    bool suc;
+
+    alc_ptr = alc_ptr ? alc_ptr : &YYJSON_DEFAULT_ALC;
+    err = err ? err : &dummy_err;
+    if (unlikely(!path || !*path)) {
+        err->msg = "input path is invalid";
+        err->code = YYJSON_READ_ERROR_INVALID_PARAMETER;
+        return false;
+    }
+
+    dat = (u8*)yyjson_val_write_opts(root, flg, alc_ptr, &dat_len, err);
+    if (unlikely(!dat))
+        return false;
+    suc = write_dat_to_file(path, dat, dat_len, err);
+    alc_ptr->free(alc_ptr->ctx, dat);
+    return suc;
+}
+
+bool yyjson_val_write_fp(FILE* fp, const yyjson_val* val, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, yyjson_write_err* err) {
+    yyjson_write_err dummy_err;
+    u8* dat;
+    usize dat_len = 0;
+    yyjson_val* root = constcast(yyjson_val*) val;
+    bool suc;
+
+    alc_ptr = alc_ptr ? alc_ptr : &YYJSON_DEFAULT_ALC;
+    err = err ? err : &dummy_err;
+    if (unlikely(!fp)) {
+        err->msg = "input fp is invalid";
+        err->code = YYJSON_READ_ERROR_INVALID_PARAMETER;
+        return false;
+    }
+
+    dat = (u8*)yyjson_val_write_opts(root, flg, alc_ptr, &dat_len, err);
+    if (unlikely(!dat))
+        return false;
+    suc = write_dat_to_fp(fp, dat, dat_len, err);
+    alc_ptr->free(alc_ptr->ctx, dat);
+    return suc;
+}
+
+bool yyjson_write_file(const char* path, const yyjson_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, yyjson_write_err* err) {
+    yyjson_val* root = doc ? doc->root : NULL;
+    return yyjson_val_write_file(path, root, flg, alc_ptr, err);
+}
+
+bool yyjson_write_fp(FILE* fp, const yyjson_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, yyjson_write_err* err) {
+    yyjson_val* root = doc ? doc->root : NULL;
+    return yyjson_val_write_fp(fp, root, flg, alc_ptr, err);
+}
+
+/*==============================================================================
+ * Mutable JSON Writer Implementation
+ *============================================================================*/
+
+typedef struct yyjson_mut_write_ctx {
+    usize tag;
+    yyjson_mut_val* ctn;
+} yyjson_mut_write_ctx;
+
+static_inline void yyjson_mut_write_ctx_set(yyjson_mut_write_ctx* ctx, yyjson_mut_val* ctn,
+    usize size, bool is_obj) {
+    ctx->tag = (size << 1) | (usize)is_obj;
+    ctx->ctn = ctn;
+}
+
+static_inline void yyjson_mut_write_ctx_get(yyjson_mut_write_ctx* ctx, yyjson_mut_val** ctn,
+    usize* size, bool* is_obj) {
+    usize tag = ctx->tag;
+    *size = tag >> 1;
+    *is_obj = (bool)(tag & 1);
+    *ctn = ctx->ctn;
+}
+
+/** Get the estimated number of values for the mutable JSON document. */
+static_inline usize yyjson_mut_doc_estimated_val_num(const yyjson_mut_doc* doc) {
+    usize sum = 0;
+    yyjson_val_chunk* chunk = doc->val_pool.chunks;
+    while (chunk) {
+        sum += chunk->chunk_size / sizeof(yyjson_mut_val) - 1;
+        if (chunk == doc->val_pool.chunks) {
+            sum -= (usize)(doc->val_pool.end - doc->val_pool.cur);
+        }
+        chunk = chunk->next;
+    }
+    return sum;
+}
+
+/** Write single JSON value. */
+static_inline u8* yyjson_mut_write_single(yyjson_mut_val* val, yyjson_write_flag flg,
+    yyjson_alc alc, usize* dat_len, yyjson_write_err* err) {
+    return yyjson_write_single((yyjson_val*)val, flg, alc, dat_len, err);
+}
+
+/** Write JSON document minify.
+    The root of this document should be a non-empty container. */
+static_inline u8* yyjson_mut_write_minify(const yyjson_mut_val* root, usize estimated_val_num,
+    yyjson_write_flag flg, yyjson_alc alc, usize* dat_len, yyjson_write_err* err) {
+
+#define return_err(_code, _msg)                                                                    \
+    do {                                                                                           \
+        *dat_len = 0;                                                                              \
+        err->code = YYJSON_WRITE_ERROR_##_code;                                                    \
+        err->msg = _msg;                                                                           \
+        if (hdr)                                                                                   \
+            alc.free(alc.ctx, hdr);                                                                \
+        return NULL;                                                                               \
+    } while (false)
+
+#define incr_len(_len)                                                                             \
+    do {                                                                                           \
+        ext_len = (usize)(_len);                                                                   \
+        if (unlikely((u8*)(cur + ext_len) >= (u8*)ctx)) {                                          \
+            alc_inc = yyjson_max(alc_len / 2, ext_len);                                            \
+            alc_inc = size_align_up(alc_inc, sizeof(yyjson_mut_write_ctx));                        \
+            if ((sizeof(usize) < 8) && size_add_is_overflow(alc_len, alc_inc))                     \
+                goto fail_alloc;                                                                   \
+            alc_len += alc_inc;                                                                    \
+            tmp = (u8*)alc.realloc(alc.ctx, hdr, alc_len - alc_inc, alc_len);                      \
+            if (unlikely(!tmp))                                                                    \
+                goto fail_alloc;                                                                   \
+            ctx_len = (usize)(end - (u8*)ctx);                                                     \
+            ctx_tmp = (yyjson_mut_write_ctx*)(void*)(tmp + (alc_len - ctx_len));                   \
+            memmove((void*)ctx_tmp, (void*)(tmp + ((u8*)ctx - hdr)), ctx_len);                     \
+            ctx = ctx_tmp;                                                                         \
+            cur = tmp + (cur - hdr);                                                               \
+            end = tmp + alc_len;                                                                   \
+            hdr = tmp;                                                                             \
+        }                                                                                          \
+    } while (false)
+
+#define check_str_len(_len)                                                                        \
+    do {                                                                                           \
+        if ((sizeof(usize) < 8) && (_len >= (USIZE_MAX - 16) / 6))                                 \
+            goto fail_alloc;                                                                       \
+    } while (false)
+
+    yyjson_mut_val *val, *ctn;
+    yyjson_type val_type;
+    usize ctn_len, ctn_len_tmp;
+    bool ctn_obj, ctn_obj_tmp, is_key;
+    u8 *hdr, *cur, *end, *tmp;
+    yyjson_mut_write_ctx *ctx, *ctx_tmp;
+    usize alc_len, alc_inc, ctx_len, ext_len, str_len;
+    const u8* str_ptr;
+    const char_enc_type* enc_table = get_enc_table_with_flag(flg);
+    bool cpy = (enc_table == enc_table_cpy);
+    bool esc = has_write_flag(ESCAPE_UNICODE) != 0;
+    bool inv = has_write_flag(ALLOW_INVALID_UNICODE) != 0;
+    bool newline = has_write_flag(NEWLINE_AT_END) != 0;
+
+    alc_len = estimated_val_num * YYJSON_WRITER_ESTIMATED_MINIFY_RATIO + 64;
+    alc_len = size_align_up(alc_len, sizeof(yyjson_mut_write_ctx));
+    hdr = (u8*)alc.malloc(alc.ctx, alc_len);
+    if (!hdr)
+        goto fail_alloc;
+    cur = hdr;
+    end = hdr + alc_len;
+    ctx = (yyjson_mut_write_ctx*)(void*)end;
+
+doc_begin:
+    val = constcast(yyjson_mut_val*) root;
+    val_type = unsafe_yyjson_get_type(val);
+    ctn_obj = (val_type == YYJSON_TYPE_OBJ);
+    ctn_len = unsafe_yyjson_get_len(val) << (u8)ctn_obj;
+    *cur++ = (u8)('[' | ((u8)ctn_obj << 5));
+    ctn = val;
+    val = (yyjson_mut_val*)val->uni.ptr; /* tail */
+    val = ctn_obj ? val->next->next : val->next;
+
+val_begin:
+    val_type = unsafe_yyjson_get_type(val);
+    if (val_type == YYJSON_TYPE_STR) {
+        is_key = ((u8)ctn_obj & (u8)~ctn_len);
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len * 6 + 16);
+        if (likely(cpy) && unsafe_yyjson_get_subtype(val)) {
+            cur = write_string_noesc(cur, str_ptr, str_len);
+        } else {
+            cur = write_string(cur, esc, inv, str_ptr, str_len, enc_table);
+            if (unlikely(!cur))
+                goto fail_str;
+        }
+        *cur++ = is_key ? ':' : ',';
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_NUM) {
+        incr_len(32);
+        cur = write_number(cur, (yyjson_val*)val, flg);
+        if (unlikely(!cur))
+            goto fail_num;
+        *cur++ = ',';
+        goto val_end;
+    }
+    if ((val_type & (YYJSON_TYPE_ARR & YYJSON_TYPE_OBJ)) == (YYJSON_TYPE_ARR & YYJSON_TYPE_OBJ)) {
+        ctn_len_tmp = unsafe_yyjson_get_len(val);
+        ctn_obj_tmp = (val_type == YYJSON_TYPE_OBJ);
+        incr_len(16);
+        if (unlikely(ctn_len_tmp == 0)) {
+            /* write empty container */
+            *cur++ = (u8)('[' | ((u8)ctn_obj_tmp << 5));
+            *cur++ = (u8)(']' | ((u8)ctn_obj_tmp << 5));
+            *cur++ = ',';
+            goto val_end;
+        } else {
+            /* push context, setup new container */
+            yyjson_mut_write_ctx_set(--ctx, ctn, ctn_len, ctn_obj);
+            ctn_len = ctn_len_tmp << (u8)ctn_obj_tmp;
+            ctn_obj = ctn_obj_tmp;
+            *cur++ = (u8)('[' | ((u8)ctn_obj << 5));
+            ctn = val;
+            val = (yyjson_mut_val*)ctn->uni.ptr; /* tail */
+            val = ctn_obj ? val->next->next : val->next;
+            goto val_begin;
+        }
+    }
+    if (val_type == YYJSON_TYPE_BOOL) {
+        incr_len(16);
+        cur = write_bool(cur, unsafe_yyjson_get_bool(val));
+        cur++;
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_NULL) {
+        incr_len(16);
+        cur = write_null(cur);
+        cur++;
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_RAW) {
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len + 2);
+        cur = write_raw(cur, str_ptr, str_len);
+        *cur++ = ',';
+        goto val_end;
+    }
+    goto fail_type;
+
+val_end:
+    ctn_len--;
+    if (unlikely(ctn_len == 0))
+        goto ctn_end;
+    val = val->next;
+    goto val_begin;
+
+ctn_end:
+    cur--;
+    *cur++ = (u8)(']' | ((u8)ctn_obj << 5));
+    *cur++ = ',';
+    if (unlikely((u8*)ctx >= end))
+        goto doc_end;
+    val = ctn->next;
+    yyjson_mut_write_ctx_get(ctx++, &ctn, &ctn_len, &ctn_obj);
+    ctn_len--;
+    if (likely(ctn_len > 0)) {
+        goto val_begin;
+    } else {
+        goto ctn_end;
+    }
+
+doc_end:
+    if (newline) {
+        incr_len(2);
+        *(cur - 1) = '\n';
+        cur++;
+    }
+    *--cur = '\0';
+    *dat_len = (usize)(cur - hdr);
+    err->code = YYJSON_WRITE_SUCCESS;
+    err->msg = "success";
+    return hdr;
+
+fail_alloc:
+    return_err(MEMORY_ALLOCATION, "memory allocation failed");
+fail_type:
+    return_err(INVALID_VALUE_TYPE, "invalid JSON value type");
+fail_num:
+    return_err(NAN_OR_INF, "nan or inf number is not allowed");
+fail_str:
+    return_err(INVALID_STRING, "invalid utf-8 encoding in string");
+
+#undef return_err
+#undef incr_len
+#undef check_str_len
+}
+
+/** Write JSON document pretty.
+    The root of this document should be a non-empty container. */
+static_inline u8* yyjson_mut_write_pretty(const yyjson_mut_val* root, usize estimated_val_num,
+    yyjson_write_flag flg, yyjson_alc alc, usize* dat_len, yyjson_write_err* err) {
+
+#define return_err(_code, _msg)                                                                    \
+    do {                                                                                           \
+        *dat_len = 0;                                                                              \
+        err->code = YYJSON_WRITE_ERROR_##_code;                                                    \
+        err->msg = _msg;                                                                           \
+        if (hdr)                                                                                   \
+            alc.free(alc.ctx, hdr);                                                                \
+        return NULL;                                                                               \
+    } while (false)
+
+#define incr_len(_len)                                                                             \
+    do {                                                                                           \
+        ext_len = (usize)(_len);                                                                   \
+        if (unlikely((u8*)(cur + ext_len) >= (u8*)ctx)) {                                          \
+            alc_inc = yyjson_max(alc_len / 2, ext_len);                                            \
+            alc_inc = size_align_up(alc_inc, sizeof(yyjson_mut_write_ctx));                        \
+            if ((sizeof(usize) < 8) && size_add_is_overflow(alc_len, alc_inc))                     \
+                goto fail_alloc;                                                                   \
+            alc_len += alc_inc;                                                                    \
+            tmp = (u8*)alc.realloc(alc.ctx, hdr, alc_len - alc_inc, alc_len);                      \
+            if (unlikely(!tmp))                                                                    \
+                goto fail_alloc;                                                                   \
+            ctx_len = (usize)(end - (u8*)ctx);                                                     \
+            ctx_tmp = (yyjson_mut_write_ctx*)(void*)(tmp + (alc_len - ctx_len));                   \
+            memmove((void*)ctx_tmp, (void*)(tmp + ((u8*)ctx - hdr)), ctx_len);                     \
+            ctx = ctx_tmp;                                                                         \
+            cur = tmp + (cur - hdr);                                                               \
+            end = tmp + alc_len;                                                                   \
+            hdr = tmp;                                                                             \
+        }                                                                                          \
+    } while (false)
+
+#define check_str_len(_len)                                                                        \
+    do {                                                                                           \
+        if ((sizeof(usize) < 8) && (_len >= (USIZE_MAX - 16) / 6))                                 \
+            goto fail_alloc;                                                                       \
+    } while (false)
+
+    yyjson_mut_val *val, *ctn;
+    yyjson_type val_type;
+    usize ctn_len, ctn_len_tmp;
+    bool ctn_obj, ctn_obj_tmp, is_key, no_indent;
+    u8 *hdr, *cur, *end, *tmp;
+    yyjson_mut_write_ctx *ctx, *ctx_tmp;
+    usize alc_len, alc_inc, ctx_len, ext_len, str_len, level;
+    const u8* str_ptr;
+    const char_enc_type* enc_table = get_enc_table_with_flag(flg);
+    bool cpy = (enc_table == enc_table_cpy);
+    bool esc = has_write_flag(ESCAPE_UNICODE) != 0;
+    bool inv = has_write_flag(ALLOW_INVALID_UNICODE) != 0;
+    usize spaces = has_write_flag(PRETTY_TWO_SPACES) ? 2 : 4;
+    bool newline = has_write_flag(NEWLINE_AT_END) != 0;
+
+    alc_len = estimated_val_num * YYJSON_WRITER_ESTIMATED_PRETTY_RATIO + 64;
+    alc_len = size_align_up(alc_len, sizeof(yyjson_mut_write_ctx));
+    hdr = (u8*)alc.malloc(alc.ctx, alc_len);
+    if (!hdr)
+        goto fail_alloc;
+    cur = hdr;
+    end = hdr + alc_len;
+    ctx = (yyjson_mut_write_ctx*)(void*)end;
+
+doc_begin:
+    val = constcast(yyjson_mut_val*) root;
+    val_type = unsafe_yyjson_get_type(val);
+    ctn_obj = (val_type == YYJSON_TYPE_OBJ);
+    ctn_len = unsafe_yyjson_get_len(val) << (u8)ctn_obj;
+    *cur++ = (u8)('[' | ((u8)ctn_obj << 5));
+    *cur++ = '\n';
+    ctn = val;
+    val = (yyjson_mut_val*)val->uni.ptr; /* tail */
+    val = ctn_obj ? val->next->next : val->next;
+    level = 1;
+
+val_begin:
+    val_type = unsafe_yyjson_get_type(val);
+    if (val_type == YYJSON_TYPE_STR) {
+        is_key = (bool)((u8)ctn_obj & (u8)~ctn_len);
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len * 6 + 16 + (no_indent ? 0 : level * 4));
+        cur = write_indent(cur, no_indent ? 0 : level, spaces);
+        if (likely(cpy) && unsafe_yyjson_get_subtype(val)) {
+            cur = write_string_noesc(cur, str_ptr, str_len);
+        } else {
+            cur = write_string(cur, esc, inv, str_ptr, str_len, enc_table);
+            if (unlikely(!cur))
+                goto fail_str;
+        }
+        *cur++ = is_key ? ':' : ',';
+        *cur++ = is_key ? ' ' : '\n';
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_NUM) {
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        incr_len(32 + (no_indent ? 0 : level * 4));
+        cur = write_indent(cur, no_indent ? 0 : level, spaces);
+        cur = write_number(cur, (yyjson_val*)val, flg);
+        if (unlikely(!cur))
+            goto fail_num;
+        *cur++ = ',';
+        *cur++ = '\n';
+        goto val_end;
+    }
+    if ((val_type & (YYJSON_TYPE_ARR & YYJSON_TYPE_OBJ)) == (YYJSON_TYPE_ARR & YYJSON_TYPE_OBJ)) {
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        ctn_len_tmp = unsafe_yyjson_get_len(val);
+        ctn_obj_tmp = (val_type == YYJSON_TYPE_OBJ);
+        if (unlikely(ctn_len_tmp == 0)) {
+            /* write empty container */
+            incr_len(16 + (no_indent ? 0 : level * 4));
+            cur = write_indent(cur, no_indent ? 0 : level, spaces);
+            *cur++ = (u8)('[' | ((u8)ctn_obj_tmp << 5));
+            *cur++ = (u8)(']' | ((u8)ctn_obj_tmp << 5));
+            *cur++ = ',';
+            *cur++ = '\n';
+            goto val_end;
+        } else {
+            /* push context, setup new container */
+            incr_len(32 + (no_indent ? 0 : level * 4));
+            yyjson_mut_write_ctx_set(--ctx, ctn, ctn_len, ctn_obj);
+            ctn_len = ctn_len_tmp << (u8)ctn_obj_tmp;
+            ctn_obj = ctn_obj_tmp;
+            cur = write_indent(cur, no_indent ? 0 : level, spaces);
+            level++;
+            *cur++ = (u8)('[' | ((u8)ctn_obj << 5));
+            *cur++ = '\n';
+            ctn = val;
+            val = (yyjson_mut_val*)ctn->uni.ptr; /* tail */
+            val = ctn_obj ? val->next->next : val->next;
+            goto val_begin;
+        }
+    }
+    if (val_type == YYJSON_TYPE_BOOL) {
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        incr_len(16 + (no_indent ? 0 : level * 4));
+        cur = write_indent(cur, no_indent ? 0 : level, spaces);
+        cur = write_bool(cur, unsafe_yyjson_get_bool(val));
+        cur += 2;
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_NULL) {
+        no_indent = (bool)((u8)ctn_obj & (u8)ctn_len);
+        incr_len(16 + (no_indent ? 0 : level * 4));
+        cur = write_indent(cur, no_indent ? 0 : level, spaces);
+        cur = write_null(cur);
+        cur += 2;
+        goto val_end;
+    }
+    if (val_type == YYJSON_TYPE_RAW) {
+        str_len = unsafe_yyjson_get_len(val);
+        str_ptr = (const u8*)unsafe_yyjson_get_str(val);
+        check_str_len(str_len);
+        incr_len(str_len + 3);
+        cur = write_raw(cur, str_ptr, str_len);
+        *cur++ = ',';
+        *cur++ = '\n';
+        goto val_end;
+    }
+    goto fail_type;
+
+val_end:
+    ctn_len--;
+    if (unlikely(ctn_len == 0))
+        goto ctn_end;
+    val = val->next;
+    goto val_begin;
+
+ctn_end:
+    cur -= 2;
+    *cur++ = '\n';
+    incr_len(level * 4);
+    cur = write_indent(cur, --level, spaces);
+    *cur++ = (u8)(']' | ((u8)ctn_obj << 5));
+    if (unlikely((u8*)ctx >= end))
+        goto doc_end;
+    val = ctn->next;
+    yyjson_mut_write_ctx_get(ctx++, &ctn, &ctn_len, &ctn_obj);
+    ctn_len--;
+    *cur++ = ',';
+    *cur++ = '\n';
+    if (likely(ctn_len > 0)) {
+        goto val_begin;
+    } else {
+        goto ctn_end;
+    }
+
+doc_end:
+    if (newline) {
+        incr_len(2);
+        *cur++ = '\n';
+    }
+    *cur = '\0';
+    *dat_len = (usize)(cur - hdr);
+    err->code = YYJSON_WRITE_SUCCESS;
+    err->msg = "success";
+    return hdr;
+
+fail_alloc:
+    return_err(MEMORY_ALLOCATION, "memory allocation failed");
+fail_type:
+    return_err(INVALID_VALUE_TYPE, "invalid JSON value type");
+fail_num:
+    return_err(NAN_OR_INF, "nan or inf number is not allowed");
+fail_str:
+    return_err(INVALID_STRING, "invalid utf-8 encoding in string");
+
+#undef return_err
+#undef incr_len
+#undef check_str_len
+}
+
+static char* yyjson_mut_write_opts_impl(const yyjson_mut_val* val, usize estimated_val_num,
+    yyjson_write_flag flg, const yyjson_alc* alc_ptr, usize* dat_len, yyjson_write_err* err) {
+    yyjson_write_err dummy_err;
+    usize dummy_dat_len;
+    yyjson_alc alc = alc_ptr ? *alc_ptr : YYJSON_DEFAULT_ALC;
+    yyjson_mut_val* root = constcast(yyjson_mut_val*) val;
+
+    err = err ? err : &dummy_err;
+    dat_len = dat_len ? dat_len : &dummy_dat_len;
+
+    if (unlikely(!root)) {
+        *dat_len = 0;
+        err->msg = "input JSON is NULL";
+        err->code = YYJSON_WRITE_ERROR_INVALID_PARAMETER;
+        return NULL;
+    }
+
+    if (!unsafe_yyjson_is_ctn(root) || unsafe_yyjson_get_len(root) == 0) {
+        return (char*)yyjson_mut_write_single(root, flg, alc, dat_len, err);
+    } else if (flg & (YYJSON_WRITE_PRETTY | YYJSON_WRITE_PRETTY_TWO_SPACES)) {
+        return (char*)yyjson_mut_write_pretty(root, estimated_val_num, flg, alc, dat_len, err);
+    } else {
+        return (char*)yyjson_mut_write_minify(root, estimated_val_num, flg, alc, dat_len, err);
+    }
+}
+
+char* yyjson_mut_val_write_opts(const yyjson_mut_val* val, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, usize* dat_len, yyjson_write_err* err) {
+    return yyjson_mut_write_opts_impl(val, 0, flg, alc_ptr, dat_len, err);
+}
+
+char* yyjson_mut_write_opts(const yyjson_mut_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, usize* dat_len, yyjson_write_err* err) {
+    yyjson_mut_val* root;
+    usize estimated_val_num;
+    if (likely(doc)) {
+        root = doc->root;
+        estimated_val_num = yyjson_mut_doc_estimated_val_num(doc);
+    } else {
+        root = NULL;
+        estimated_val_num = 0;
+    }
+    return yyjson_mut_write_opts_impl(root, estimated_val_num, flg, alc_ptr, dat_len, err);
+}
+
+bool yyjson_mut_val_write_file(const char* path, const yyjson_mut_val* val, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, yyjson_write_err* err) {
+    yyjson_write_err dummy_err;
+    u8* dat;
+    usize dat_len = 0;
+    yyjson_mut_val* root = constcast(yyjson_mut_val*) val;
+    bool suc;
+
+    alc_ptr = alc_ptr ? alc_ptr : &YYJSON_DEFAULT_ALC;
+    err = err ? err : &dummy_err;
+    if (unlikely(!path || !*path)) {
+        err->msg = "input path is invalid";
+        err->code = YYJSON_WRITE_ERROR_INVALID_PARAMETER;
+        return false;
+    }
+
+    dat = (u8*)yyjson_mut_val_write_opts(root, flg, alc_ptr, &dat_len, err);
+    if (unlikely(!dat))
+        return false;
+    suc = write_dat_to_file(path, dat, dat_len, err);
+    alc_ptr->free(alc_ptr->ctx, dat);
+    return suc;
+}
+
+bool yyjson_mut_val_write_fp(FILE* fp, const yyjson_mut_val* val, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, yyjson_write_err* err) {
+    yyjson_write_err dummy_err;
+    u8* dat;
+    usize dat_len = 0;
+    yyjson_mut_val* root = constcast(yyjson_mut_val*) val;
+    bool suc;
+
+    alc_ptr = alc_ptr ? alc_ptr : &YYJSON_DEFAULT_ALC;
+    err = err ? err : &dummy_err;
+    if (unlikely(!fp)) {
+        err->msg = "input fp is invalid";
+        err->code = YYJSON_WRITE_ERROR_INVALID_PARAMETER;
+        return false;
+    }
+
+    dat = (u8*)yyjson_mut_val_write_opts(root, flg, alc_ptr, &dat_len, err);
+    if (unlikely(!dat))
+        return false;
+    suc = write_dat_to_fp(fp, dat, dat_len, err);
+    alc_ptr->free(alc_ptr->ctx, dat);
+    return suc;
+}
+
+bool yyjson_mut_write_file(const char* path, const yyjson_mut_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, yyjson_write_err* err) {
+    yyjson_mut_val* root = doc ? doc->root : NULL;
+    return yyjson_mut_val_write_file(path, root, flg, alc_ptr, err);
+}
+
+bool yyjson_mut_write_fp(FILE* fp, const yyjson_mut_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc_ptr, yyjson_write_err* err) {
+    yyjson_mut_val* root = doc ? doc->root : NULL;
+    return yyjson_mut_val_write_fp(fp, root, flg, alc_ptr, err);
+}
+
+#endif /* YYJSON_DISABLE_WRITER */
+
+// NOLINTEND
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/src/yyjson.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/src/yyjson.h
new file mode 100644
index 0000000000..648042a02b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/yyjson/src/yyjson.h
@@ -0,0 +1,7438 @@
+/*==============================================================================
+ Copyright (c) 2020 YaoYuan <ibireme@gmail.com>
+
+ Permission is hereby granted, free of charge, to any person obtaining a copy
+ of this software and associated documentation files (the "Software"), to deal
+ in the Software without restriction, including without limitation the rights
+ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ copies of the Software, and to permit persons to whom the Software is
+ furnished to do so, subject to the following conditions:
+
+ The above copyright notice and this permission notice shall be included in all
+ copies or substantial portions of the Software.
+
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ SOFTWARE.
+ *============================================================================*/
+
+/**
+ @file yyjson.h
+ @date 2019-03-09
+ @author YaoYuan
+ */
+
+// clang-tidy should ignore this file
+// NOLINTBEGIN
+
+#ifndef YYJSON_H
+#define YYJSON_H
+
+/*==============================================================================
+ * Header Files
+ *============================================================================*/
+
+#include <float.h>
+#include <limits.h>
+#include <stddef.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+/*==============================================================================
+ * Compile-time Options
+ *============================================================================*/
+
+/*
+ Define as 1 to disable JSON reader if JSON parsing is not required.
+
+ This will disable these functions at compile-time:
+    - yyjson_read()
+    - yyjson_read_opts()
+    - yyjson_read_file()
+    - yyjson_read_number()
+    - yyjson_mut_read_number()
+
+ This will reduce the binary size by about 60%.
+ */
+#ifndef YYJSON_DISABLE_READER
+#endif
+
+/*
+ Define as 1 to disable JSON writer if JSON serialization is not required.
+
+ This will disable these functions at compile-time:
+    - yyjson_write()
+    - yyjson_write_file()
+    - yyjson_write_opts()
+    - yyjson_val_write()
+    - yyjson_val_write_file()
+    - yyjson_val_write_opts()
+    - yyjson_mut_write()
+    - yyjson_mut_write_file()
+    - yyjson_mut_write_opts()
+    - yyjson_mut_val_write()
+    - yyjson_mut_val_write_file()
+    - yyjson_mut_val_write_opts()
+
+ This will reduce the binary size by about 30%.
+ */
+#ifndef YYJSON_DISABLE_WRITER
+#endif
+
+/*
+ Define as 1 to disable JSON Pointer, JSON Patch and JSON Merge Patch supports.
+
+ This will disable these functions at compile-time:
+    - yyjson_ptr_xxx()
+    - yyjson_mut_ptr_xxx()
+    - yyjson_doc_ptr_xxx()
+    - yyjson_mut_doc_ptr_xxx()
+    - yyjson_patch()
+    - yyjson_mut_patch()
+    - yyjson_merge_patch()
+    - yyjson_mut_merge_patch()
+ */
+#ifndef YYJSON_DISABLE_UTILS
+#endif
+
+/*
+ Define as 1 to disable the fast floating-point number conversion in yyjson,
+ and use libc's `strtod/snprintf` instead.
+
+ This will reduce the binary size by about 30%, but significantly slow down the
+ floating-point read/write speed.
+ */
+#ifndef YYJSON_DISABLE_FAST_FP_CONV
+#endif
+
+/*
+ Define as 1 to disable non-standard JSON support at compile-time:
+    - Reading and writing inf/nan literal, such as `NaN`, `-Infinity`.
+    - Single line and multiple line comments.
+    - Single trailing comma at the end of an object or array.
+    - Invalid unicode in string value.
+
+ This will also invalidate these run-time options:
+    - YYJSON_READ_ALLOW_INF_AND_NAN
+    - YYJSON_READ_ALLOW_COMMENTS
+    - YYJSON_READ_ALLOW_TRAILING_COMMAS
+    - YYJSON_READ_ALLOW_INVALID_UNICODE
+    - YYJSON_WRITE_ALLOW_INF_AND_NAN
+    - YYJSON_WRITE_ALLOW_INVALID_UNICODE
+
+ This will reduce the binary size by about 10%, and speed up the reading and
+ writing speed by about 2% to 6%.
+ */
+#ifndef YYJSON_DISABLE_NON_STANDARD
+#endif
+
+/*
+ Define as 1 to disable UTF-8 validation at compile time.
+
+ If all input strings are guaranteed to be valid UTF-8 encoding (for example,
+ some language's String object has already validated the encoding), using this
+ flag can avoid redundant UTF-8 validation in yyjson.
+
+ This flag can speed up the reading and writing speed of non-ASCII encoded
+ strings by about 3% to 7%.
+
+ Note: If this flag is used while passing in illegal UTF-8 strings, the
+ following errors may occur:
+ - Escaped characters may be ignored when parsing JSON strings.
+ - Ending quotes may be ignored when parsing JSON strings, causing the string
+   to be concatenated to the next value.
+ - When accessing `yyjson_mut_val` for serialization, the string ending may be
+   accessed out of bounds, causing a segmentation fault.
+ */
+#ifndef YYJSON_DISABLE_UTF8_VALIDATION
+#endif
+
+/*
+ Define as 1 to indicate that the target architecture does not support unaligned
+ memory access. Please refer to the comments in the C file for details.
+ */
+#ifndef YYJSON_DISABLE_UNALIGNED_MEMORY_ACCESS
+#endif
+
+/* Define as 1 to export symbols when building this library as Windows DLL. */
+#ifndef YYJSON_EXPORTS
+#endif
+
+/* Define as 1 to import symbols when using this library as Windows DLL. */
+#ifndef YYJSON_IMPORTS
+#endif
+
+/* Define as 1 to include <stdint.h> for compiler which doesn't support C99. */
+#ifndef YYJSON_HAS_STDINT_H
+#endif
+
+/* Define as 1 to include <stdbool.h> for compiler which doesn't support C99. */
+#ifndef YYJSON_HAS_STDBOOL_H
+#endif
+
+/*==============================================================================
+ * Compiler Macros
+ *============================================================================*/
+
+/** compiler version (MSVC) */
+#ifdef _MSC_VER
+#define YYJSON_MSC_VER _MSC_VER
+#else
+#define YYJSON_MSC_VER 0
+#endif
+
+/** compiler version (GCC) */
+#ifdef __GNUC__
+#define YYJSON_GCC_VER __GNUC__
+#if defined(__GNUC_PATCHLEVEL__)
+#define yyjson_gcc_available(major, minor, patch)                                                  \
+    ((__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) >=                            \
+        (major * 10000 + minor * 100 + patch))
+#else
+#define yyjson_gcc_available(major, minor, patch)                                                  \
+    ((__GNUC__ * 10000 + __GNUC_MINOR__ * 100) >= (major * 10000 + minor * 100 + patch))
+#endif
+#else
+#define YYJSON_GCC_VER 0
+#define yyjson_gcc_available(major, minor, patch) 0
+#endif
+
+/** real gcc check */
+#if !defined(__clang__) && !defined(__INTEL_COMPILER) && !defined(__ICC) && defined(__GNUC__)
+#define YYJSON_IS_REAL_GCC 1
+#else
+#define YYJSON_IS_REAL_GCC 0
+#endif
+
+/** C version (STDC) */
+#if defined(__STDC__) && (__STDC__ >= 1) && defined(__STDC_VERSION__)
+#define YYJSON_STDC_VER __STDC_VERSION__
+#else
+#define YYJSON_STDC_VER 0
+#endif
+
+/** C++ version */
+#if defined(__cplusplus)
+#define YYJSON_CPP_VER __cplusplus
+#else
+#define YYJSON_CPP_VER 0
+#endif
+
+/** compiler builtin check (since gcc 10.0, clang 2.6, icc 2021) */
+#ifndef yyjson_has_builtin
+#ifdef __has_builtin
+#define yyjson_has_builtin(x) __has_builtin(x)
+#else
+#define yyjson_has_builtin(x) 0
+#endif
+#endif
+
+/** compiler attribute check (since gcc 5.0, clang 2.9, icc 17) */
+#ifndef yyjson_has_attribute
+#ifdef __has_attribute
+#define yyjson_has_attribute(x) __has_attribute(x)
+#else
+#define yyjson_has_attribute(x) 0
+#endif
+#endif
+
+/** compiler feature check (since clang 2.6, icc 17) */
+#ifndef yyjson_has_feature
+#ifdef __has_feature
+#define yyjson_has_feature(x) __has_feature(x)
+#else
+#define yyjson_has_feature(x) 0
+#endif
+#endif
+
+/** include check (since gcc 5.0, clang 2.7, icc 16, msvc 2017 15.3) */
+#ifndef yyjson_has_include
+#ifdef __has_include
+#define yyjson_has_include(x) __has_include(x)
+#else
+#define yyjson_has_include(x) 0
+#endif
+#endif
+
+/** inline for compiler */
+#ifndef yyjson_inline
+#if YYJSON_MSC_VER >= 1200
+#define yyjson_inline __forceinline
+#elif defined(_MSC_VER)
+#define yyjson_inline __inline
+#elif yyjson_has_attribute(always_inline) || YYJSON_GCC_VER >= 4
+#define yyjson_inline __inline__ __attribute__((always_inline))
+#elif defined(__clang__) || defined(__GNUC__)
+#define yyjson_inline __inline__
+#elif defined(__cplusplus) || YYJSON_STDC_VER >= 199901L
+#define yyjson_inline inline
+#else
+#define yyjson_inline
+#endif
+#endif
+
+/** noinline for compiler */
+#ifndef yyjson_noinline
+#if YYJSON_MSC_VER >= 1400
+#define yyjson_noinline __declspec(noinline)
+#elif yyjson_has_attribute(noinline) || YYJSON_GCC_VER >= 4
+#define yyjson_noinline __attribute__((noinline))
+#else
+#define yyjson_noinline
+#endif
+#endif
+
+/** align for compiler */
+#ifndef yyjson_align
+#if YYJSON_MSC_VER >= 1300
+#define yyjson_align(x) __declspec(align(x))
+#elif yyjson_has_attribute(aligned) || defined(__GNUC__)
+#define yyjson_align(x) __attribute__((aligned(x)))
+#elif YYJSON_CPP_VER >= 201103L
+#define yyjson_align(x) alignas(x)
+#else
+#define yyjson_align(x)
+#endif
+#endif
+
+/** likely for compiler */
+#ifndef yyjson_likely
+#if yyjson_has_builtin(__builtin_expect) || (YYJSON_GCC_VER >= 4 && YYJSON_GCC_VER != 5)
+#define yyjson_likely(expr) __builtin_expect(!!(expr), 1)
+#else
+#define yyjson_likely(expr) (expr)
+#endif
+#endif
+
+/** unlikely for compiler */
+#ifndef yyjson_unlikely
+#if yyjson_has_builtin(__builtin_expect) || (YYJSON_GCC_VER >= 4 && YYJSON_GCC_VER != 5)
+#define yyjson_unlikely(expr) __builtin_expect(!!(expr), 0)
+#else
+#define yyjson_unlikely(expr) (expr)
+#endif
+#endif
+
+/** compile-time constant check for compiler */
+#ifndef yyjson_constant_p
+#if yyjson_has_builtin(__builtin_constant_p) || (YYJSON_GCC_VER >= 3)
+#define YYJSON_HAS_CONSTANT_P 1
+#define yyjson_constant_p(value) __builtin_constant_p(value)
+#else
+#define YYJSON_HAS_CONSTANT_P 0
+#define yyjson_constant_p(value) 0
+#endif
+#endif
+
+/** deprecate warning */
+#ifndef yyjson_deprecated
+#if YYJSON_MSC_VER >= 1400
+#define yyjson_deprecated(msg) __declspec(deprecated(msg))
+#elif yyjson_has_feature(attribute_deprecated_with_message) ||                                     \
+    (YYJSON_GCC_VER > 4 || (YYJSON_GCC_VER == 4 && __GNUC_MINOR__ >= 5))
+#define yyjson_deprecated(msg) __attribute__((deprecated(msg)))
+#elif YYJSON_GCC_VER >= 3
+#define yyjson_deprecated(msg) __attribute__((deprecated))
+#else
+#define yyjson_deprecated(msg)
+#endif
+#endif
+
+/** function export */
+#ifndef yyjson_api
+#if defined(_WIN32)
+#if defined(YYJSON_EXPORTS) && YYJSON_EXPORTS
+#define yyjson_api __declspec(dllexport)
+#elif defined(YYJSON_IMPORTS) && YYJSON_IMPORTS
+#define yyjson_api __declspec(dllimport)
+#else
+#define yyjson_api
+#endif
+#elif yyjson_has_attribute(visibility) || YYJSON_GCC_VER >= 4
+#define yyjson_api __attribute__((visibility("default")))
+#else
+#define yyjson_api
+#endif
+#endif
+
+/** inline function export */
+#ifndef yyjson_api_inline
+#define yyjson_api_inline static yyjson_inline
+#endif
+
+/** stdint (C89 compatible) */
+#if (defined(YYJSON_HAS_STDINT_H) && YYJSON_HAS_STDINT_H) || YYJSON_MSC_VER >= 1600 ||             \
+    YYJSON_STDC_VER >= 199901L || defined(_STDINT_H) || defined(_STDINT_H_) ||                     \
+    defined(__CLANG_STDINT_H) || defined(_STDINT_H_INCLUDED) || yyjson_has_include(<stdint.h>)
+#include <stdint.h>
+#elif defined(_MSC_VER)
+#if _MSC_VER < 1300
+typedef signed char int8_t;
+typedef signed short int16_t;
+typedef signed int int32_t;
+typedef unsigned char uint8_t;
+typedef unsigned short uint16_t;
+typedef unsigned int uint32_t;
+typedef signed __int64 int64_t;
+typedef unsigned __int64 uint64_t;
+#else
+typedef signed __int8 int8_t;
+typedef signed __int16 int16_t;
+typedef signed __int32 int32_t;
+typedef unsigned __int8 uint8_t;
+typedef unsigned __int16 uint16_t;
+typedef unsigned __int32 uint32_t;
+typedef signed __int64 int64_t;
+typedef unsigned __int64 uint64_t;
+#endif
+#else
+#if UCHAR_MAX == 0xFFU
+typedef signed char int8_t;
+typedef unsigned char uint8_t;
+#else
+#error cannot find 8-bit integer type
+#endif
+#if USHRT_MAX == 0xFFFFU
+typedef unsigned short uint16_t;
+typedef signed short int16_t;
+#elif UINT_MAX == 0xFFFFU
+typedef unsigned int uint16_t;
+typedef signed int int16_t;
+#else
+#error cannot find 16-bit integer type
+#endif
+#if UINT_MAX == 0xFFFFFFFFUL
+typedef unsigned int uint32_t;
+typedef signed int int32_t;
+#elif ULONG_MAX == 0xFFFFFFFFUL
+typedef unsigned long uint32_t;
+typedef signed long int32_t;
+#elif USHRT_MAX == 0xFFFFFFFFUL
+typedef unsigned short uint32_t;
+typedef signed short int32_t;
+#else
+#error cannot find 32-bit integer type
+#endif
+#if defined(__INT64_TYPE__) && defined(__UINT64_TYPE__)
+typedef __INT64_TYPE__ int64_t;
+typedef __UINT64_TYPE__ uint64_t;
+#elif defined(__GNUC__) || defined(__clang__)
+#if !defined(_SYS_TYPES_H) && !defined(__int8_t_defined)
+__extension__ typedef long long int64_t;
+#endif
+__extension__ typedef unsigned long long uint64_t;
+#elif defined(_LONG_LONG) || defined(__MWERKS__) || defined(_CRAYC) || defined(__SUNPRO_C) ||      \
+    defined(__SUNPRO_CC)
+typedef long long int64_t;
+typedef unsigned long long uint64_t;
+#elif (defined(__BORLANDC__) && __BORLANDC__ > 0x460) || defined(__WATCOM_INT64__) ||              \
+    defined(__alpha) || defined(__DECC)
+typedef __int64 int64_t;
+typedef unsigned __int64 uint64_t;
+#else
+#error cannot find 64-bit integer type
+#endif
+#endif
+
+/** stdbool (C89 compatible) */
+#if (defined(YYJSON_HAS_STDBOOL_H) && YYJSON_HAS_STDBOOL_H) ||                                     \
+    (yyjson_has_include(<stdbool.h>) && !defined(__STRICT_ANSI__)) || YYJSON_MSC_VER >= 1800 ||    \
+    YYJSON_STDC_VER >= 199901L
+#include <stdbool.h>
+#elif !defined(__bool_true_false_are_defined)
+#define __bool_true_false_are_defined 1
+#if defined(__cplusplus)
+#if defined(__GNUC__) && !defined(__STRICT_ANSI__)
+#define _Bool bool
+#if __cplusplus < 201103L
+#define bool bool
+#define false false
+#define true true
+#endif
+#endif
+#else
+#define bool unsigned char
+#define true 1
+#define false 0
+#endif
+#endif
+
+/** char bit check */
+#if defined(CHAR_BIT)
+#if CHAR_BIT != 8
+#error non 8-bit char is not supported
+#endif
+#endif
+
+/**
+ Microsoft Visual C++ 6.0 doesn't support converting number from u64 to f64:
+ error C2520: conversion from unsigned __int64 to double not implemented.
+ */
+#ifndef YYJSON_U64_TO_F64_NO_IMPL
+#if (0 < YYJSON_MSC_VER) && (YYJSON_MSC_VER <= 1200)
+#define YYJSON_U64_TO_F64_NO_IMPL 1
+#else
+#define YYJSON_U64_TO_F64_NO_IMPL 0
+#endif
+#endif
+
+/*==============================================================================
+ * Compile Hint Begin
+ *============================================================================*/
+
+/* extern "C" begin */
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* warning suppress begin */
+#if defined(__clang__)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wunused-function"
+#pragma clang diagnostic ignored "-Wunused-parameter"
+#elif defined(__GNUC__)
+#if (__GNUC__ > 4) || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6)
+#pragma GCC diagnostic push
+#endif
+#pragma GCC diagnostic ignored "-Wunused-function"
+#pragma GCC diagnostic ignored "-Wunused-parameter"
+#elif defined(_MSC_VER)
+#pragma warning(push)
+#pragma warning(disable : 4800) /* 'int': forcing value to 'true' or 'false' */
+#endif
+
+/*==============================================================================
+ * Version
+ *============================================================================*/
+
+/** The major version of yyjson. */
+#define YYJSON_VERSION_MAJOR 0
+
+/** The minor version of yyjson. */
+#define YYJSON_VERSION_MINOR 10
+
+/** The patch version of yyjson. */
+#define YYJSON_VERSION_PATCH 0
+
+/** The version of yyjson in hex: `(major << 16) | (minor << 8) | (patch)`. */
+#define YYJSON_VERSION_HEX 0x000A00
+
+/** The version string of yyjson. */
+#define YYJSON_VERSION_STRING "0.10.0"
+
+/** The version of yyjson in hex, same as `YYJSON_VERSION_HEX`. */
+yyjson_api uint32_t yyjson_version(void);
+
+/*==============================================================================
+ * JSON Types
+ *============================================================================*/
+
+/** Type of a JSON value (3 bit). */
+typedef uint8_t yyjson_type;
+/** No type, invalid. */
+#define YYJSON_TYPE_NONE ((uint8_t)0) /* _____000 */
+/** Raw string type, no subtype. */
+#define YYJSON_TYPE_RAW ((uint8_t)1) /* _____001 */
+/** Null type: `null` literal, no subtype. */
+#define YYJSON_TYPE_NULL ((uint8_t)2) /* _____010 */
+/** Boolean type, subtype: TRUE, FALSE. */
+#define YYJSON_TYPE_BOOL ((uint8_t)3) /* _____011 */
+/** Number type, subtype: UINT, SINT, REAL. */
+#define YYJSON_TYPE_NUM ((uint8_t)4) /* _____100 */
+/** String type, subtype: NONE, NOESC. */
+#define YYJSON_TYPE_STR ((uint8_t)5) /* _____101 */
+/** Array type, no subtype. */
+#define YYJSON_TYPE_ARR ((uint8_t)6) /* _____110 */
+/** Object type, no subtype. */
+#define YYJSON_TYPE_OBJ ((uint8_t)7) /* _____111 */
+
+/** Subtype of a JSON value (2 bit). */
+typedef uint8_t yyjson_subtype;
+/** No subtype. */
+#define YYJSON_SUBTYPE_NONE ((uint8_t)(0 << 3)) /* ___00___ */
+/** False subtype: `false` literal. */
+#define YYJSON_SUBTYPE_FALSE ((uint8_t)(0 << 3)) /* ___00___ */
+/** True subtype: `true` literal. */
+#define YYJSON_SUBTYPE_TRUE ((uint8_t)(1 << 3)) /* ___01___ */
+/** Unsigned integer subtype: `uint64_t`. */
+#define YYJSON_SUBTYPE_UINT ((uint8_t)(0 << 3)) /* ___00___ */
+/** Signed integer subtype: `int64_t`. */
+#define YYJSON_SUBTYPE_SINT ((uint8_t)(1 << 3)) /* ___01___ */
+/** Real number subtype: `double`. */
+#define YYJSON_SUBTYPE_REAL ((uint8_t)(2 << 3)) /* ___10___ */
+/** String that do not need to be escaped for writing (internal use). */
+#define YYJSON_SUBTYPE_NOESC ((uint8_t)(1 << 3)) /* ___01___ */
+
+/** The mask used to extract the type of a JSON value. */
+#define YYJSON_TYPE_MASK ((uint8_t)0x07) /* _____111 */
+/** The number of bits used by the type. */
+#define YYJSON_TYPE_BIT ((uint8_t)3)
+/** The mask used to extract the subtype of a JSON value. */
+#define YYJSON_SUBTYPE_MASK ((uint8_t)0x18) /* ___11___ */
+/** The number of bits used by the subtype. */
+#define YYJSON_SUBTYPE_BIT ((uint8_t)2)
+/** The mask used to extract the reserved bits of a JSON value. */
+#define YYJSON_RESERVED_MASK ((uint8_t)0xE0) /* 111_____ */
+/** The number of reserved bits. */
+#define YYJSON_RESERVED_BIT ((uint8_t)3)
+/** The mask used to extract the tag of a JSON value. */
+#define YYJSON_TAG_MASK ((uint8_t)0xFF) /* 11111111 */
+/** The number of bits used by the tag. */
+#define YYJSON_TAG_BIT ((uint8_t)8)
+
+/** Padding size for JSON reader. */
+#define YYJSON_PADDING_SIZE 4
+
+/*==============================================================================
+ * Allocator
+ *============================================================================*/
+
+/**
+ A memory allocator.
+
+ Typically you don't need to use it, unless you want to customize your own
+ memory allocator.
+ */
+typedef struct yyjson_alc {
+    /** Same as libc's malloc(size), should not be NULL. */
+    void* (*malloc)(void* ctx, size_t size);
+    /** Same as libc's realloc(ptr, size), should not be NULL. */
+    void* (*realloc)(void* ctx, void* ptr, size_t old_size, size_t size);
+    /** Same as libc's free(ptr), should not be NULL. */
+    void (*free)(void* ctx, void* ptr);
+    /** A context for malloc/realloc/free, can be NULL. */
+    void* ctx;
+} yyjson_alc;
+
+/**
+ A pool allocator uses fixed length pre-allocated memory.
+
+ This allocator may be used to avoid malloc/realloc calls. The pre-allocated
+ memory should be held by the caller. The maximum amount of memory required to
+ read a JSON can be calculated using the `yyjson_read_max_memory_usage()`
+ function, but the amount of memory required to write a JSON cannot be directly
+ calculated.
+
+ This is not a general-purpose allocator. It is designed to handle a single JSON
+ data at a time. If it is used for overly complex memory tasks, such as parsing
+ multiple JSON documents using the same allocator but releasing only a few of
+ them, it may cause memory fragmentation, resulting in performance degradation
+ and memory waste.
+
+ @param alc The allocator to be initialized.
+    If this parameter is NULL, the function will fail and return false.
+    If `buf` or `size` is invalid, this will be set to an empty allocator.
+ @param buf The buffer memory for this allocator.
+    If this parameter is NULL, the function will fail and return false.
+ @param size The size of `buf`, in bytes.
+    If this parameter is less than 8 words (32/64 bytes on 32/64-bit OS), the
+    function will fail and return false.
+ @return true if the `alc` has been successfully initialized.
+
+ @par Example
+ @code
+    // parse JSON with stack memory
+    char buf[1024];
+    yyjson_alc alc;
+    yyjson_alc_pool_init(&alc, buf, 1024);
+
+    const char *json = "{\"name\":\"Helvetica\",\"size\":16}"
+    yyjson_doc *doc = yyjson_read_opts(json, strlen(json), 0, &alc, NULL);
+    // the memory of `doc` is on the stack
+ @endcode
+
+ @warning This Allocator is not thread-safe.
+ */
+yyjson_api bool yyjson_alc_pool_init(yyjson_alc* alc, void* buf, size_t size);
+
+/**
+ A dynamic allocator.
+
+ This allocator has a similar usage to the pool allocator above. However, when
+ there is not enough memory, this allocator will dynamically request more memory
+ using libc's `malloc` function, and frees it all at once when it is destroyed.
+
+ @return A new dynamic allocator, or NULL if memory allocation failed.
+ @note The returned value should be freed with `yyjson_alc_dyn_free()`.
+
+ @warning This Allocator is not thread-safe.
+ */
+yyjson_api yyjson_alc* yyjson_alc_dyn_new(void);
+
+/**
+ Free a dynamic allocator which is created by `yyjson_alc_dyn_new()`.
+ @param alc The dynamic allocator to be destroyed.
+ */
+yyjson_api void yyjson_alc_dyn_free(yyjson_alc* alc);
+
+/*==============================================================================
+ * JSON Structure
+ *============================================================================*/
+
+/**
+ An immutable document for reading JSON.
+ This document holds memory for all its JSON values and strings. When it is no
+ longer used, the user should call `yyjson_doc_free()` to free its memory.
+ */
+typedef struct yyjson_doc yyjson_doc;
+
+/**
+ An immutable value for reading JSON.
+ A JSON Value has the same lifetime as its document. The memory is held by its
+ document and and cannot be freed alone.
+ */
+typedef struct yyjson_val yyjson_val;
+
+/**
+ A mutable document for building JSON.
+ This document holds memory for all its JSON values and strings. When it is no
+ longer used, the user should call `yyjson_mut_doc_free()` to free its memory.
+ */
+typedef struct yyjson_mut_doc yyjson_mut_doc;
+
+/**
+ A mutable value for building JSON.
+ A JSON Value has the same lifetime as its document. The memory is held by its
+ document and and cannot be freed alone.
+ */
+typedef struct yyjson_mut_val yyjson_mut_val;
+
+/*==============================================================================
+ * JSON Reader API
+ *============================================================================*/
+
+/** Run-time options for JSON reader. */
+typedef uint32_t yyjson_read_flag;
+
+/** Default option (RFC 8259 compliant):
+    - Read positive integer as uint64_t.
+    - Read negative integer as int64_t.
+    - Read floating-point number as double with round-to-nearest mode.
+    - Read integer which cannot fit in uint64_t or int64_t as double.
+    - Report error if double number is infinity.
+    - Report error if string contains invalid UTF-8 character or BOM.
+    - Report error on trailing commas, comments, inf and nan literals. */
+static const yyjson_read_flag YYJSON_READ_NOFLAG = 0;
+
+/** Read the input data in-situ.
+    This option allows the reader to modify and use input data to store string
+    values, which can increase reading speed slightly.
+    The caller should hold the input data before free the document.
+    The input data must be padded by at least `YYJSON_PADDING_SIZE` bytes.
+    For example: `[1,2]` should be `[1,2]\0\0\0\0`, input length should be 5. */
+static const yyjson_read_flag YYJSON_READ_INSITU = 1 << 0;
+
+/** Stop when done instead of issuing an error if there's additional content
+    after a JSON document. This option may be used to parse small pieces of JSON
+    in larger data, such as `NDJSON`. */
+static const yyjson_read_flag YYJSON_READ_STOP_WHEN_DONE = 1 << 1;
+
+/** Allow single trailing comma at the end of an object or array,
+    such as `[1,2,3,]`, `{"a":1,"b":2,}` (non-standard). */
+static const yyjson_read_flag YYJSON_READ_ALLOW_TRAILING_COMMAS = 1 << 2;
+
+/** Allow C-style single line and multiple line comments (non-standard). */
+static const yyjson_read_flag YYJSON_READ_ALLOW_COMMENTS = 1 << 3;
+
+/** Allow inf/nan number and literal, case-insensitive,
+    such as 1e999, NaN, inf, -Infinity (non-standard). */
+static const yyjson_read_flag YYJSON_READ_ALLOW_INF_AND_NAN = 1 << 4;
+
+/** Read all numbers as raw strings (value with `YYJSON_TYPE_RAW` type),
+    inf/nan literal is also read as raw with `ALLOW_INF_AND_NAN` flag. */
+static const yyjson_read_flag YYJSON_READ_NUMBER_AS_RAW = 1 << 5;
+
+/** Allow reading invalid unicode when parsing string values (non-standard).
+    Invalid characters will be allowed to appear in the string values, but
+    invalid escape sequences will still be reported as errors.
+    This flag does not affect the performance of correctly encoded strings.
+
+    @warning Strings in JSON values may contain incorrect encoding when this
+    option is used, you need to handle these strings carefully to avoid security
+    risks. */
+static const yyjson_read_flag YYJSON_READ_ALLOW_INVALID_UNICODE = 1 << 6;
+
+/** Read big numbers as raw strings. These big numbers include integers that
+    cannot be represented by `int64_t` and `uint64_t`, and floating-point
+    numbers that cannot be represented by finite `double`.
+    The flag will be overridden by `YYJSON_READ_NUMBER_AS_RAW` flag. */
+static const yyjson_read_flag YYJSON_READ_BIGNUM_AS_RAW = 1 << 7;
+
+/** Result code for JSON reader. */
+typedef uint32_t yyjson_read_code;
+
+/** Success, no error. */
+static const yyjson_read_code YYJSON_READ_SUCCESS = 0;
+
+/** Invalid parameter, such as NULL input string or 0 input length. */
+static const yyjson_read_code YYJSON_READ_ERROR_INVALID_PARAMETER = 1;
+
+/** Memory allocation failure occurs. */
+static const yyjson_read_code YYJSON_READ_ERROR_MEMORY_ALLOCATION = 2;
+
+/** Input JSON string is empty. */
+static const yyjson_read_code YYJSON_READ_ERROR_EMPTY_CONTENT = 3;
+
+/** Unexpected content after document, such as `[123]abc`. */
+static const yyjson_read_code YYJSON_READ_ERROR_UNEXPECTED_CONTENT = 4;
+
+/** Unexpected ending, such as `[123`. */
+static const yyjson_read_code YYJSON_READ_ERROR_UNEXPECTED_END = 5;
+
+/** Unexpected character inside the document, such as `[abc]`. */
+static const yyjson_read_code YYJSON_READ_ERROR_UNEXPECTED_CHARACTER = 6;
+
+/** Invalid JSON structure, such as `[1,]`. */
+static const yyjson_read_code YYJSON_READ_ERROR_JSON_STRUCTURE = 7;
+
+/** Invalid comment, such as unclosed multi-line comment. */
+static const yyjson_read_code YYJSON_READ_ERROR_INVALID_COMMENT = 8;
+
+/** Invalid number, such as `123.e12`, `000`. */
+static const yyjson_read_code YYJSON_READ_ERROR_INVALID_NUMBER = 9;
+
+/** Invalid string, such as invalid escaped character inside a string. */
+static const yyjson_read_code YYJSON_READ_ERROR_INVALID_STRING = 10;
+
+/** Invalid JSON literal, such as `truu`. */
+static const yyjson_read_code YYJSON_READ_ERROR_LITERAL = 11;
+
+/** Failed to open a file. */
+static const yyjson_read_code YYJSON_READ_ERROR_FILE_OPEN = 12;
+
+/** Failed to read a file. */
+static const yyjson_read_code YYJSON_READ_ERROR_FILE_READ = 13;
+
+/** Error information for JSON reader. */
+typedef struct yyjson_read_err {
+    /** Error code, see `yyjson_read_code` for all possible values. */
+    yyjson_read_code code;
+    /** Error message, constant, no need to free (NULL if success). */
+    const char* msg;
+    /** Error byte position for input data (0 if success). */
+    size_t pos;
+} yyjson_read_err;
+
+/**
+ Locate the line and column number for a byte position in a string.
+ This can be used to get better description for error position.
+
+ @param str The input string.
+ @param len The byte length of the input string.
+ @param pos The byte position within the input string.
+ @param line A pointer to receive the line number, starting from 1.
+ @param col  A pointer to receive the column number, starting from 1.
+ @param chr  A pointer to receive the character index, starting from 0.
+ @return true on success, false if `str` is NULL or `pos` is out of bounds.
+ @note Line/column/character are calculated based on Unicode characters for
+    compatibility with text editors. For multi-byte UTF-8 characters,
+    the returned value may not directly correspond to the byte position.
+ */
+yyjson_api bool yyjson_locate_pos(const char* str, size_t len, size_t pos, size_t* line,
+    size_t* col, size_t* chr);
+
+/**
+ Read JSON with options.
+
+ This function is thread-safe when:
+ 1. The `dat` is not modified by other threads.
+ 2. The `alc` is thread-safe or NULL.
+
+ @param dat The JSON data (UTF-8 without BOM), null-terminator is not required.
+    If this parameter is NULL, the function will fail and return NULL.
+    The `dat` will not be modified without the flag `YYJSON_READ_INSITU`, so you
+    can pass a `const char *` string and case it to `char *` if you don't use
+    the `YYJSON_READ_INSITU` flag.
+ @param len The length of JSON data in bytes.
+    If this parameter is 0, the function will fail and return NULL.
+ @param flg The JSON read options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON reader.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return A new JSON document, or NULL if an error occurs.
+    When it's no longer needed, it should be freed with `yyjson_doc_free()`.
+ */
+yyjson_api yyjson_doc* yyjson_read_opts(char* dat, size_t len, yyjson_read_flag flg,
+    const yyjson_alc* alc, yyjson_read_err* err);
+
+/**
+ Read a JSON file.
+
+ This function is thread-safe when:
+ 1. The file is not modified by other threads.
+ 2. The `alc` is thread-safe or NULL.
+
+ @param path The JSON file's path.
+    If this path is NULL or invalid, the function will fail and return NULL.
+ @param flg The JSON read options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON reader.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return A new JSON document, or NULL if an error occurs.
+    When it's no longer needed, it should be freed with `yyjson_doc_free()`.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to read.
+ */
+yyjson_api yyjson_doc* yyjson_read_file(const char* path, yyjson_read_flag flg,
+    const yyjson_alc* alc, yyjson_read_err* err);
+
+/**
+ Read JSON from a file pointer.
+
+ @param fp The file pointer.
+    The data will be read from the current position of the FILE to the end.
+    If this fp is NULL or invalid, the function will fail and return NULL.
+ @param flg The JSON read options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON reader.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return A new JSON document, or NULL if an error occurs.
+    When it's no longer needed, it should be freed with `yyjson_doc_free()`.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to read.
+ */
+yyjson_api yyjson_doc* yyjson_read_fp(FILE* fp, yyjson_read_flag flg, const yyjson_alc* alc,
+    yyjson_read_err* err);
+
+/**
+ Read a JSON string.
+
+ This function is thread-safe.
+
+ @param dat The JSON data (UTF-8 without BOM), null-terminator is not required.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param len The length of JSON data in bytes.
+    If this parameter is 0, the function will fail and return NULL.
+ @param flg The JSON read options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @return A new JSON document, or NULL if an error occurs.
+    When it's no longer needed, it should be freed with `yyjson_doc_free()`.
+ */
+yyjson_api_inline yyjson_doc* yyjson_read(const char* dat, size_t len, yyjson_read_flag flg) {
+    flg &= ~YYJSON_READ_INSITU; /* const string cannot be modified */
+    return yyjson_read_opts((char*)(void*)(size_t)(const void*)dat, len, flg, NULL, NULL);
+}
+
+/**
+ Returns the size of maximum memory usage to read a JSON data.
+
+ You may use this value to avoid malloc() or calloc() call inside the reader
+ to get better performance, or read multiple JSON with one piece of memory.
+
+ @param len The length of JSON data in bytes.
+ @param flg The JSON read options.
+ @return The maximum memory size to read this JSON, or 0 if overflow.
+
+ @par Example
+ @code
+    // read multiple JSON with same pre-allocated memory
+
+    char *dat1, *dat2, *dat3; // JSON data
+    size_t len1, len2, len3; // JSON length
+    size_t max_len = MAX(len1, MAX(len2, len3));
+    yyjson_doc *doc;
+
+    // use one allocator for multiple JSON
+    size_t size = yyjson_read_max_memory_usage(max_len, 0);
+    void *buf = malloc(size);
+    yyjson_alc alc;
+    yyjson_alc_pool_init(&alc, buf, size);
+
+    // no more alloc() or realloc() call during reading
+    doc = yyjson_read_opts(dat1, len1, 0, &alc, NULL);
+    yyjson_doc_free(doc);
+    doc = yyjson_read_opts(dat2, len2, 0, &alc, NULL);
+    yyjson_doc_free(doc);
+    doc = yyjson_read_opts(dat3, len3, 0, &alc, NULL);
+    yyjson_doc_free(doc);
+
+    free(buf);
+ @endcode
+ @see yyjson_alc_pool_init()
+ */
+yyjson_api_inline size_t yyjson_read_max_memory_usage(size_t len, yyjson_read_flag flg) {
+    /*
+     1. The max value count is (json_size / 2 + 1),
+        for example: "[1,2,3,4]" size is 9, value count is 5.
+     2. Some broken JSON may cost more memory during reading, but fail at end,
+        for example: "[[[[[[[[".
+     3. yyjson use 16 bytes per value, see struct yyjson_val.
+     4. yyjson use dynamic memory with a growth factor of 1.5.
+
+     The max memory size is (json_size / 2 * 16 * 1.5 + padding).
+     */
+    size_t mul = (size_t)12 + !(flg & YYJSON_READ_INSITU);
+    size_t pad = 256;
+    size_t max = (size_t)(~(size_t)0);
+    if (flg & YYJSON_READ_STOP_WHEN_DONE)
+        len = len < 256 ? 256 : len;
+    if (len >= (max - pad - mul) / mul)
+        return 0;
+    return len * mul + pad;
+}
+
+/**
+ Read a JSON number.
+
+ This function is thread-safe when data is not modified by other threads.
+
+ @param dat The JSON data (UTF-8 without BOM), null-terminator is required.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param val The output value where result is stored.
+    If this parameter is NULL, the function will fail and return NULL.
+    The value will hold either UINT or SINT or REAL number;
+ @param flg The JSON read options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+    Supports `YYJSON_READ_NUMBER_AS_RAW` and `YYJSON_READ_ALLOW_INF_AND_NAN`.
+ @param alc The memory allocator used for long number.
+    It is only used when the built-in floating point reader is disabled.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return If successful, a pointer to the character after the last character
+    used in the conversion, NULL if an error occurs.
+ */
+yyjson_api const char* yyjson_read_number(const char* dat, yyjson_val* val, yyjson_read_flag flg,
+    const yyjson_alc* alc, yyjson_read_err* err);
+
+/**
+ Read a JSON number.
+
+ This function is thread-safe when data is not modified by other threads.
+
+ @param dat The JSON data (UTF-8 without BOM), null-terminator is required.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param val The output value where result is stored.
+    If this parameter is NULL, the function will fail and return NULL.
+    The value will hold either UINT or SINT or REAL number;
+ @param flg The JSON read options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+    Supports `YYJSON_READ_NUMBER_AS_RAW` and `YYJSON_READ_ALLOW_INF_AND_NAN`.
+ @param alc The memory allocator used for long number.
+    It is only used when the built-in floating point reader is disabled.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return If successful, a pointer to the character after the last character
+    used in the conversion, NULL if an error occurs.
+ */
+yyjson_api_inline const char* yyjson_mut_read_number(const char* dat, yyjson_mut_val* val,
+    yyjson_read_flag flg, const yyjson_alc* alc, yyjson_read_err* err) {
+    return yyjson_read_number(dat, (yyjson_val*)val, flg, alc, err);
+}
+
+/*==============================================================================
+ * JSON Writer API
+ *============================================================================*/
+
+/** Run-time options for JSON writer. */
+typedef uint32_t yyjson_write_flag;
+
+/** Default option:
+    - Write JSON minify.
+    - Report error on inf or nan number.
+    - Report error on invalid UTF-8 string.
+    - Do not escape unicode or slash. */
+static const yyjson_write_flag YYJSON_WRITE_NOFLAG = 0;
+
+/** Write JSON pretty with 4 space indent. */
+static const yyjson_write_flag YYJSON_WRITE_PRETTY = 1 << 0;
+
+/** Escape unicode as `uXXXX`, make the output ASCII only. */
+static const yyjson_write_flag YYJSON_WRITE_ESCAPE_UNICODE = 1 << 1;
+
+/** Escape '/' as '\/'. */
+static const yyjson_write_flag YYJSON_WRITE_ESCAPE_SLASHES = 1 << 2;
+
+/** Write inf and nan number as 'Infinity' and 'NaN' literal (non-standard). */
+static const yyjson_write_flag YYJSON_WRITE_ALLOW_INF_AND_NAN = 1 << 3;
+
+/** Write inf and nan number as null literal.
+    This flag will override `YYJSON_WRITE_ALLOW_INF_AND_NAN` flag. */
+static const yyjson_write_flag YYJSON_WRITE_INF_AND_NAN_AS_NULL = 1 << 4;
+
+/** Allow invalid unicode when encoding string values (non-standard).
+    Invalid characters in string value will be copied byte by byte.
+    If `YYJSON_WRITE_ESCAPE_UNICODE` flag is also set, invalid character will be
+    escaped as `U+FFFD` (replacement character).
+    This flag does not affect the performance of correctly encoded strings. */
+static const yyjson_write_flag YYJSON_WRITE_ALLOW_INVALID_UNICODE = 1 << 5;
+
+/** Write JSON pretty with 2 space indent.
+    This flag will override `YYJSON_WRITE_PRETTY` flag. */
+static const yyjson_write_flag YYJSON_WRITE_PRETTY_TWO_SPACES = 1 << 6;
+
+/** Adds a newline character `\n` at the end of the JSON.
+    This can be helpful for text editors or NDJSON. */
+static const yyjson_write_flag YYJSON_WRITE_NEWLINE_AT_END = 1 << 7;
+
+/** Result code for JSON writer */
+typedef uint32_t yyjson_write_code;
+
+/** Success, no error. */
+static const yyjson_write_code YYJSON_WRITE_SUCCESS = 0;
+
+/** Invalid parameter, such as NULL document. */
+static const yyjson_write_code YYJSON_WRITE_ERROR_INVALID_PARAMETER = 1;
+
+/** Memory allocation failure occurs. */
+static const yyjson_write_code YYJSON_WRITE_ERROR_MEMORY_ALLOCATION = 2;
+
+/** Invalid value type in JSON document. */
+static const yyjson_write_code YYJSON_WRITE_ERROR_INVALID_VALUE_TYPE = 3;
+
+/** NaN or Infinity number occurs. */
+static const yyjson_write_code YYJSON_WRITE_ERROR_NAN_OR_INF = 4;
+
+/** Failed to open a file. */
+static const yyjson_write_code YYJSON_WRITE_ERROR_FILE_OPEN = 5;
+
+/** Failed to write a file. */
+static const yyjson_write_code YYJSON_WRITE_ERROR_FILE_WRITE = 6;
+
+/** Invalid unicode in string. */
+static const yyjson_write_code YYJSON_WRITE_ERROR_INVALID_STRING = 7;
+
+/** Error information for JSON writer. */
+typedef struct yyjson_write_err {
+    /** Error code, see `yyjson_write_code` for all possible values. */
+    yyjson_write_code code;
+    /** Error message, constant, no need to free (NULL if success). */
+    const char* msg;
+} yyjson_write_err;
+
+/*==============================================================================
+ * JSON Document Writer API
+ *============================================================================*/
+
+/**
+ Write a document to JSON string with options.
+
+ This function is thread-safe when:
+ The `alc` is thread-safe or NULL.
+
+ @param doc The JSON document.
+    If this doc is NULL or has no root, the function will fail and return false.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param len A pointer to receive output length in bytes (not including the
+    null-terminator). Pass NULL if you don't need length information.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return A new JSON string, or NULL if an error occurs.
+    This string is encoded as UTF-8 with a null-terminator.
+    When it's no longer needed, it should be freed with free() or alc->free().
+ */
+yyjson_api char* yyjson_write_opts(const yyjson_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc, size_t* len, yyjson_write_err* err);
+
+/**
+ Write a document to JSON file with options.
+
+ This function is thread-safe when:
+ 1. The file is not accessed by other threads.
+ 2. The `alc` is thread-safe or NULL.
+
+ @param path The JSON file's path.
+    If this path is NULL or invalid, the function will fail and return false.
+    If this file is not empty, the content will be discarded.
+ @param doc The JSON document.
+    If this doc is NULL or has no root, the function will fail and return false.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return true if successful, false if an error occurs.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to write.
+ */
+yyjson_api bool yyjson_write_file(const char* path, const yyjson_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc, yyjson_write_err* err);
+
+/**
+ Write a document to file pointer with options.
+
+ @param fp The file pointer.
+    The data will be written to the current position of the file.
+    If this fp is NULL or invalid, the function will fail and return false.
+ @param doc The JSON document.
+    If this doc is NULL or has no root, the function will fail and return false.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return true if successful, false if an error occurs.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to write.
+ */
+yyjson_api bool yyjson_write_fp(FILE* fp, const yyjson_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc, yyjson_write_err* err);
+
+/**
+ Write a document to JSON string.
+
+ This function is thread-safe.
+
+ @param doc The JSON document.
+    If this doc is NULL or has no root, the function will fail and return false.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param len A pointer to receive output length in bytes (not including the
+    null-terminator). Pass NULL if you don't need length information.
+ @return A new JSON string, or NULL if an error occurs.
+    This string is encoded as UTF-8 with a null-terminator.
+    When it's no longer needed, it should be freed with free().
+ */
+yyjson_api_inline char* yyjson_write(const yyjson_doc* doc, yyjson_write_flag flg, size_t* len) {
+    return yyjson_write_opts(doc, flg, NULL, len, NULL);
+}
+
+/**
+ Write a document to JSON string with options.
+
+ This function is thread-safe when:
+ 1. The `doc` is not modified by other threads.
+ 2. The `alc` is thread-safe or NULL.
+
+ @param doc The mutable JSON document.
+    If this doc is NULL or has no root, the function will fail and return false.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param len A pointer to receive output length in bytes (not including the
+    null-terminator). Pass NULL if you don't need length information.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return A new JSON string, or NULL if an error occurs.
+    This string is encoded as UTF-8 with a null-terminator.
+    When it's no longer needed, it should be freed with free() or alc->free().
+ */
+yyjson_api char* yyjson_mut_write_opts(const yyjson_mut_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc, size_t* len, yyjson_write_err* err);
+
+/**
+ Write a document to JSON file with options.
+
+ This function is thread-safe when:
+ 1. The file is not accessed by other threads.
+ 2. The `doc` is not modified by other threads.
+ 3. The `alc` is thread-safe or NULL.
+
+ @param path The JSON file's path.
+    If this path is NULL or invalid, the function will fail and return false.
+    If this file is not empty, the content will be discarded.
+ @param doc The mutable JSON document.
+    If this doc is NULL or has no root, the function will fail and return false.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return true if successful, false if an error occurs.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to write.
+ */
+yyjson_api bool yyjson_mut_write_file(const char* path, const yyjson_mut_doc* doc,
+    yyjson_write_flag flg, const yyjson_alc* alc, yyjson_write_err* err);
+
+/**
+ Write a document to file pointer with options.
+
+ @param fp The file pointer.
+    The data will be written to the current position of the file.
+    If this fp is NULL or invalid, the function will fail and return false.
+ @param doc The mutable JSON document.
+    If this doc is NULL or has no root, the function will fail and return false.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return true if successful, false if an error occurs.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to write.
+ */
+yyjson_api bool yyjson_mut_write_fp(FILE* fp, const yyjson_mut_doc* doc, yyjson_write_flag flg,
+    const yyjson_alc* alc, yyjson_write_err* err);
+
+/**
+ Write a document to JSON string.
+
+ This function is thread-safe when:
+ The `doc` is not modified by other threads.
+
+ @param doc The JSON document.
+    If this doc is NULL or has no root, the function will fail and return false.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param len A pointer to receive output length in bytes (not including the
+    null-terminator). Pass NULL if you don't need length information.
+ @return A new JSON string, or NULL if an error occurs.
+    This string is encoded as UTF-8 with a null-terminator.
+    When it's no longer needed, it should be freed with free().
+ */
+yyjson_api_inline char* yyjson_mut_write(const yyjson_mut_doc* doc, yyjson_write_flag flg,
+    size_t* len) {
+    return yyjson_mut_write_opts(doc, flg, NULL, len, NULL);
+}
+
+/*==============================================================================
+ * JSON Value Writer API
+ *============================================================================*/
+
+/**
+ Write a value to JSON string with options.
+
+ This function is thread-safe when:
+ The `alc` is thread-safe or NULL.
+
+ @param val The JSON root value.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param len A pointer to receive output length in bytes (not including the
+    null-terminator). Pass NULL if you don't need length information.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return A new JSON string, or NULL if an error occurs.
+    This string is encoded as UTF-8 with a null-terminator.
+    When it's no longer needed, it should be freed with free() or alc->free().
+ */
+yyjson_api char* yyjson_val_write_opts(const yyjson_val* val, yyjson_write_flag flg,
+    const yyjson_alc* alc, size_t* len, yyjson_write_err* err);
+
+/**
+ Write a value to JSON file with options.
+
+ This function is thread-safe when:
+ 1. The file is not accessed by other threads.
+ 2. The `alc` is thread-safe or NULL.
+
+ @param path The JSON file's path.
+    If this path is NULL or invalid, the function will fail and return false.
+    If this file is not empty, the content will be discarded.
+ @param val The JSON root value.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return true if successful, false if an error occurs.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to write.
+ */
+yyjson_api bool yyjson_val_write_file(const char* path, const yyjson_val* val,
+    yyjson_write_flag flg, const yyjson_alc* alc, yyjson_write_err* err);
+
+/**
+ Write a value to file pointer with options.
+
+ @param fp The file pointer.
+    The data will be written to the current position of the file.
+    If this path is NULL or invalid, the function will fail and return false.
+ @param val The JSON root value.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return true if successful, false if an error occurs.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to write.
+ */
+yyjson_api bool yyjson_val_write_fp(FILE* fp, const yyjson_val* val, yyjson_write_flag flg,
+    const yyjson_alc* alc, yyjson_write_err* err);
+
+/**
+ Write a value to JSON string.
+
+ This function is thread-safe.
+
+ @param val The JSON root value.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param len A pointer to receive output length in bytes (not including the
+    null-terminator). Pass NULL if you don't need length information.
+ @return A new JSON string, or NULL if an error occurs.
+    This string is encoded as UTF-8 with a null-terminator.
+    When it's no longer needed, it should be freed with free().
+ */
+yyjson_api_inline char* yyjson_val_write(const yyjson_val* val, yyjson_write_flag flg,
+    size_t* len) {
+    return yyjson_val_write_opts(val, flg, NULL, len, NULL);
+}
+
+/**
+ Write a value to JSON string with options.
+
+ This function is thread-safe when:
+ 1. The `val` is not modified by other threads.
+ 2. The `alc` is thread-safe or NULL.
+
+ @param val The mutable JSON root value.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param len A pointer to receive output length in bytes (not including the
+    null-terminator). Pass NULL if you don't need length information.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return  A new JSON string, or NULL if an error occurs.
+    This string is encoded as UTF-8 with a null-terminator.
+    When it's no longer needed, it should be freed with free() or alc->free().
+ */
+yyjson_api char* yyjson_mut_val_write_opts(const yyjson_mut_val* val, yyjson_write_flag flg,
+    const yyjson_alc* alc, size_t* len, yyjson_write_err* err);
+
+/**
+ Write a value to JSON file with options.
+
+ This function is thread-safe when:
+ 1. The file is not accessed by other threads.
+ 2. The `val` is not modified by other threads.
+ 3. The `alc` is thread-safe or NULL.
+
+ @param path The JSON file's path.
+    If this path is NULL or invalid, the function will fail and return false.
+    If this file is not empty, the content will be discarded.
+ @param val The mutable JSON root value.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return true if successful, false if an error occurs.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to write.
+ */
+yyjson_api bool yyjson_mut_val_write_file(const char* path, const yyjson_mut_val* val,
+    yyjson_write_flag flg, const yyjson_alc* alc, yyjson_write_err* err);
+
+/**
+ Write a value to JSON file with options.
+
+ @param fp The file pointer.
+    The data will be written to the current position of the file.
+    If this path is NULL or invalid, the function will fail and return false.
+ @param val The mutable JSON root value.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param alc The memory allocator used by JSON writer.
+    Pass NULL to use the libc's default allocator.
+ @param err A pointer to receive error information.
+    Pass NULL if you don't need error information.
+ @return true if successful, false if an error occurs.
+
+ @warning On 32-bit operating system, files larger than 2GB may fail to write.
+ */
+yyjson_api bool yyjson_mut_val_write_fp(FILE* fp, const yyjson_mut_val* val, yyjson_write_flag flg,
+    const yyjson_alc* alc, yyjson_write_err* err);
+
+/**
+ Write a value to JSON string.
+
+ This function is thread-safe when:
+ The `val` is not modified by other threads.
+
+ @param val The JSON root value.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param flg The JSON write options.
+    Multiple options can be combined with `|` operator. 0 means no options.
+ @param len A pointer to receive output length in bytes (not including the
+    null-terminator). Pass NULL if you don't need length information.
+ @return A new JSON string, or NULL if an error occurs.
+    This string is encoded as UTF-8 with a null-terminator.
+    When it's no longer needed, it should be freed with free().
+ */
+yyjson_api_inline char* yyjson_mut_val_write(const yyjson_mut_val* val, yyjson_write_flag flg,
+    size_t* len) {
+    return yyjson_mut_val_write_opts(val, flg, NULL, len, NULL);
+}
+
+/*==============================================================================
+ * JSON Document API
+ *============================================================================*/
+
+/** Returns the root value of this JSON document.
+    Returns NULL if `doc` is NULL. */
+yyjson_api_inline yyjson_val* yyjson_doc_get_root(yyjson_doc* doc);
+
+/** Returns read size of input JSON data.
+    Returns 0 if `doc` is NULL.
+    For example: the read size of `[1,2,3]` is 7 bytes.  */
+yyjson_api_inline size_t yyjson_doc_get_read_size(yyjson_doc* doc);
+
+/** Returns total value count in this JSON document.
+    Returns 0 if `doc` is NULL.
+    For example: the value count of `[1,2,3]` is 4. */
+yyjson_api_inline size_t yyjson_doc_get_val_count(yyjson_doc* doc);
+
+/** Release the JSON document and free the memory.
+    After calling this function, the `doc` and all values from the `doc` are no
+    longer available. This function will do nothing if the `doc` is NULL. */
+yyjson_api_inline void yyjson_doc_free(yyjson_doc* doc);
+
+/*==============================================================================
+ * JSON Value Type API
+ *============================================================================*/
+
+/** Returns whether the JSON value is raw.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_raw(yyjson_val* val);
+
+/** Returns whether the JSON value is `null`.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_null(yyjson_val* val);
+
+/** Returns whether the JSON value is `true`.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_true(yyjson_val* val);
+
+/** Returns whether the JSON value is `false`.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_false(yyjson_val* val);
+
+/** Returns whether the JSON value is bool (true/false).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_bool(yyjson_val* val);
+
+/** Returns whether the JSON value is unsigned integer (uint64_t).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_uint(yyjson_val* val);
+
+/** Returns whether the JSON value is signed integer (int64_t).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_sint(yyjson_val* val);
+
+/** Returns whether the JSON value is integer (uint64_t/int64_t).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_int(yyjson_val* val);
+
+/** Returns whether the JSON value is real number (double).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_real(yyjson_val* val);
+
+/** Returns whether the JSON value is number (uint64_t/int64_t/double).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_num(yyjson_val* val);
+
+/** Returns whether the JSON value is string.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_str(yyjson_val* val);
+
+/** Returns whether the JSON value is array.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_arr(yyjson_val* val);
+
+/** Returns whether the JSON value is object.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_obj(yyjson_val* val);
+
+/** Returns whether the JSON value is container (array/object).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_is_ctn(yyjson_val* val);
+
+/*==============================================================================
+ * JSON Value Content API
+ *============================================================================*/
+
+/** Returns the JSON value's type.
+    Returns YYJSON_TYPE_NONE if `val` is NULL. */
+yyjson_api_inline yyjson_type yyjson_get_type(yyjson_val* val);
+
+/** Returns the JSON value's subtype.
+    Returns YYJSON_SUBTYPE_NONE if `val` is NULL. */
+yyjson_api_inline yyjson_subtype yyjson_get_subtype(yyjson_val* val);
+
+/** Returns the JSON value's tag.
+    Returns 0 if `val` is NULL. */
+yyjson_api_inline uint8_t yyjson_get_tag(yyjson_val* val);
+
+/** Returns the JSON value's type description.
+    The return value should be one of these strings: "raw", "null", "string",
+    "array", "object", "true", "false", "uint", "sint", "real", "unknown". */
+yyjson_api_inline const char* yyjson_get_type_desc(yyjson_val* val);
+
+/** Returns the content if the value is raw.
+    Returns NULL if `val` is NULL or type is not raw. */
+yyjson_api_inline const char* yyjson_get_raw(yyjson_val* val);
+
+/** Returns the content if the value is bool.
+    Returns NULL if `val` is NULL or type is not bool. */
+yyjson_api_inline bool yyjson_get_bool(yyjson_val* val);
+
+/** Returns the content and cast to uint64_t.
+    Returns 0 if `val` is NULL or type is not integer(sint/uint). */
+yyjson_api_inline uint64_t yyjson_get_uint(yyjson_val* val);
+
+/** Returns the content and cast to int64_t.
+    Returns 0 if `val` is NULL or type is not integer(sint/uint). */
+yyjson_api_inline int64_t yyjson_get_sint(yyjson_val* val);
+
+/** Returns the content and cast to int.
+    Returns 0 if `val` is NULL or type is not integer(sint/uint). */
+yyjson_api_inline int yyjson_get_int(yyjson_val* val);
+
+/** Returns the content if the value is real number, or 0.0 on error.
+    Returns 0.0 if `val` is NULL or type is not real(double). */
+yyjson_api_inline double yyjson_get_real(yyjson_val* val);
+
+/** Returns the content and typecast to `double` if the value is number.
+    Returns 0.0 if `val` is NULL or type is not number(uint/sint/real). */
+yyjson_api_inline double yyjson_get_num(yyjson_val* val);
+
+/** Returns the content if the value is string.
+    Returns NULL if `val` is NULL or type is not string. */
+yyjson_api_inline const char* yyjson_get_str(yyjson_val* val);
+
+/** Returns the content length (string length, array size, object size.
+    Returns 0 if `val` is NULL or type is not string/array/object. */
+yyjson_api_inline size_t yyjson_get_len(yyjson_val* val);
+
+/** Returns whether the JSON value is equals to a string.
+    Returns false if input is NULL or type is not string. */
+yyjson_api_inline bool yyjson_equals_str(yyjson_val* val, const char* str);
+
+/** Returns whether the JSON value is equals to a string.
+    The `str` should be a UTF-8 string, null-terminator is not required.
+    Returns false if input is NULL or type is not string. */
+yyjson_api_inline bool yyjson_equals_strn(yyjson_val* val, const char* str, size_t len);
+
+/** Returns whether two JSON values are equal (deep compare).
+    Returns false if input is NULL.
+    @note the result may be inaccurate if object has duplicate keys.
+    @warning This function is recursive and may cause a stack overflow
+        if the object level is too deep. */
+yyjson_api_inline bool yyjson_equals(yyjson_val* lhs, yyjson_val* rhs);
+
+/** Set the value to raw.
+    Returns false if input is NULL or `val` is object or array.
+    @warning This will modify the `immutable` value, use with caution. */
+yyjson_api_inline bool yyjson_set_raw(yyjson_val* val, const char* raw, size_t len);
+
+/** Set the value to null.
+    Returns false if input is NULL or `val` is object or array.
+    @warning This will modify the `immutable` value, use with caution. */
+yyjson_api_inline bool yyjson_set_null(yyjson_val* val);
+
+/** Set the value to bool.
+    Returns false if input is NULL or `val` is object or array.
+    @warning This will modify the `immutable` value, use with caution. */
+yyjson_api_inline bool yyjson_set_bool(yyjson_val* val, bool num);
+
+/** Set the value to uint.
+    Returns false if input is NULL or `val` is object or array.
+    @warning This will modify the `immutable` value, use with caution. */
+yyjson_api_inline bool yyjson_set_uint(yyjson_val* val, uint64_t num);
+
+/** Set the value to sint.
+    Returns false if input is NULL or `val` is object or array.
+    @warning This will modify the `immutable` value, use with caution. */
+yyjson_api_inline bool yyjson_set_sint(yyjson_val* val, int64_t num);
+
+/** Set the value to int.
+    Returns false if input is NULL or `val` is object or array.
+    @warning This will modify the `immutable` value, use with caution. */
+yyjson_api_inline bool yyjson_set_int(yyjson_val* val, int num);
+
+/** Set the value to real.
+    Returns false if input is NULL or `val` is object or array.
+    @warning This will modify the `immutable` value, use with caution. */
+yyjson_api_inline bool yyjson_set_real(yyjson_val* val, double num);
+
+/** Set the value to string (null-terminated).
+    Returns false if input is NULL or `val` is object or array.
+    @warning This will modify the `immutable` value, use with caution. */
+yyjson_api_inline bool yyjson_set_str(yyjson_val* val, const char* str);
+
+/** Set the value to string (with length).
+    Returns false if input is NULL or `val` is object or array.
+    @warning This will modify the `immutable` value, use with caution. */
+yyjson_api_inline bool yyjson_set_strn(yyjson_val* val, const char* str, size_t len);
+
+/*==============================================================================
+ * JSON Array API
+ *============================================================================*/
+
+/** Returns the number of elements in this array.
+    Returns 0 if `arr` is NULL or type is not array. */
+yyjson_api_inline size_t yyjson_arr_size(yyjson_val* arr);
+
+/** Returns the element at the specified position in this array.
+    Returns NULL if array is NULL/empty or the index is out of bounds.
+    @warning This function takes a linear search time if array is not flat.
+        For example: `[1,{},3]` is flat, `[1,[2],3]` is not flat. */
+yyjson_api_inline yyjson_val* yyjson_arr_get(yyjson_val* arr, size_t idx);
+
+/** Returns the first element of this array.
+    Returns NULL if `arr` is NULL/empty or type is not array. */
+yyjson_api_inline yyjson_val* yyjson_arr_get_first(yyjson_val* arr);
+
+/** Returns the last element of this array.
+    Returns NULL if `arr` is NULL/empty or type is not array.
+    @warning This function takes a linear search time if array is not flat.
+        For example: `[1,{},3]` is flat, `[1,[2],3]` is not flat.*/
+yyjson_api_inline yyjson_val* yyjson_arr_get_last(yyjson_val* arr);
+
+/*==============================================================================
+ * JSON Array Iterator API
+ *============================================================================*/
+
+/**
+ A JSON array iterator.
+
+ @par Example
+ @code
+    yyjson_val *val;
+    yyjson_arr_iter iter = yyjson_arr_iter_with(arr);
+    while ((val = yyjson_arr_iter_next(&iter))) {
+        your_func(val);
+    }
+ @endcode
+ */
+typedef struct yyjson_arr_iter {
+    size_t idx;      /**< next value's index */
+    size_t max;      /**< maximum index (arr.size) */
+    yyjson_val* cur; /**< next value */
+} yyjson_arr_iter;
+
+/**
+ Initialize an iterator for this array.
+
+ @param arr The array to be iterated over.
+    If this parameter is NULL or not an array, `iter` will be set to empty.
+ @param iter The iterator to be initialized.
+    If this parameter is NULL, the function will fail and return false.
+ @return true if the `iter` has been successfully initialized.
+
+ @note The iterator does not need to be destroyed.
+ */
+yyjson_api_inline bool yyjson_arr_iter_init(yyjson_val* arr, yyjson_arr_iter* iter);
+
+/**
+ Create an iterator with an array , same as `yyjson_arr_iter_init()`.
+
+ @param arr The array to be iterated over.
+    If this parameter is NULL or not an array, an empty iterator will returned.
+ @return A new iterator for the array.
+
+ @note The iterator does not need to be destroyed.
+ */
+yyjson_api_inline yyjson_arr_iter yyjson_arr_iter_with(yyjson_val* arr);
+
+/**
+ Returns whether the iteration has more elements.
+ If `iter` is NULL, this function will return false.
+ */
+yyjson_api_inline bool yyjson_arr_iter_has_next(yyjson_arr_iter* iter);
+
+/**
+ Returns the next element in the iteration, or NULL on end.
+ If `iter` is NULL, this function will return NULL.
+ */
+yyjson_api_inline yyjson_val* yyjson_arr_iter_next(yyjson_arr_iter* iter);
+
+/**
+ Macro for iterating over an array.
+ It works like iterator, but with a more intuitive API.
+
+ @par Example
+ @code
+    size_t idx, max;
+    yyjson_val *val;
+    yyjson_arr_foreach(arr, idx, max, val) {
+        your_func(idx, val);
+    }
+ @endcode
+ */
+#define yyjson_arr_foreach(arr, idx, max, val)                                                     \
+    for ((idx) = 0, (max) = yyjson_arr_size(arr), (val) = yyjson_arr_get_first(arr);               \
+         (idx) < (max); (idx)++, (val) = unsafe_yyjson_get_next(val))
+
+/*==============================================================================
+ * JSON Object API
+ *============================================================================*/
+
+/** Returns the number of key-value pairs in this object.
+    Returns 0 if `obj` is NULL or type is not object. */
+yyjson_api_inline size_t yyjson_obj_size(yyjson_val* obj);
+
+/** Returns the value to which the specified key is mapped.
+    Returns NULL if this object contains no mapping for the key.
+    Returns NULL if `obj/key` is NULL, or type is not object.
+
+    The `key` should be a null-terminated UTF-8 string.
+
+    @warning This function takes a linear search time. */
+yyjson_api_inline yyjson_val* yyjson_obj_get(yyjson_val* obj, const char* key);
+
+/** Returns the value to which the specified key is mapped.
+    Returns NULL if this object contains no mapping for the key.
+    Returns NULL if `obj/key` is NULL, or type is not object.
+
+    The `key` should be a UTF-8 string, null-terminator is not required.
+    The `key_len` should be the length of the key, in bytes.
+
+    @warning This function takes a linear search time. */
+yyjson_api_inline yyjson_val* yyjson_obj_getn(yyjson_val* obj, const char* key, size_t key_len);
+
+/*==============================================================================
+ * JSON Object Iterator API
+ *============================================================================*/
+
+/**
+ A JSON object iterator.
+
+ @par Example
+ @code
+    yyjson_val *key, *val;
+    yyjson_obj_iter iter = yyjson_obj_iter_with(obj);
+    while ((key = yyjson_obj_iter_next(&iter))) {
+        val = yyjson_obj_iter_get_val(key);
+        your_func(key, val);
+    }
+ @endcode
+
+ If the ordering of the keys is known at compile-time, you can use this method
+ to speed up value lookups:
+ @code
+    // {"k1":1, "k2": 3, "k3": 3}
+    yyjson_val *key, *val;
+    yyjson_obj_iter iter = yyjson_obj_iter_with(obj);
+    yyjson_val *v1 = yyjson_obj_iter_get(&iter, "k1");
+    yyjson_val *v3 = yyjson_obj_iter_get(&iter, "k3");
+ @endcode
+ @see yyjson_obj_iter_get() and yyjson_obj_iter_getn()
+ */
+typedef struct yyjson_obj_iter {
+    size_t idx;      /**< next key's index */
+    size_t max;      /**< maximum key index (obj.size) */
+    yyjson_val* cur; /**< next key */
+    yyjson_val* obj; /**< the object being iterated */
+} yyjson_obj_iter;
+
+/**
+ Initialize an iterator for this object.
+
+ @param obj The object to be iterated over.
+    If this parameter is NULL or not an object, `iter` will be set to empty.
+ @param iter The iterator to be initialized.
+    If this parameter is NULL, the function will fail and return false.
+ @return true if the `iter` has been successfully initialized.
+
+ @note The iterator does not need to be destroyed.
+ */
+yyjson_api_inline bool yyjson_obj_iter_init(yyjson_val* obj, yyjson_obj_iter* iter);
+
+/**
+ Create an iterator with an object, same as `yyjson_obj_iter_init()`.
+
+ @param obj The object to be iterated over.
+    If this parameter is NULL or not an object, an empty iterator will returned.
+ @return A new iterator for the object.
+
+ @note The iterator does not need to be destroyed.
+ */
+yyjson_api_inline yyjson_obj_iter yyjson_obj_iter_with(yyjson_val* obj);
+
+/**
+ Returns whether the iteration has more elements.
+ If `iter` is NULL, this function will return false.
+ */
+yyjson_api_inline bool yyjson_obj_iter_has_next(yyjson_obj_iter* iter);
+
+/**
+ Returns the next key in the iteration, or NULL on end.
+ If `iter` is NULL, this function will return NULL.
+ */
+yyjson_api_inline yyjson_val* yyjson_obj_iter_next(yyjson_obj_iter* iter);
+
+/**
+ Returns the value for key inside the iteration.
+ If `iter` is NULL, this function will return NULL.
+ */
+yyjson_api_inline yyjson_val* yyjson_obj_iter_get_val(yyjson_val* key);
+
+/**
+ Iterates to a specified key and returns the value.
+
+ This function does the same thing as `yyjson_obj_get()`, but is much faster
+ if the ordering of the keys is known at compile-time and you are using the same
+ order to look up the values. If the key exists in this object, then the
+ iterator will stop at the next key, otherwise the iterator will not change and
+ NULL is returned.
+
+ @param iter The object iterator, should not be NULL.
+ @param key The key, should be a UTF-8 string with null-terminator.
+ @return The value to which the specified key is mapped.
+    NULL if this object contains no mapping for the key or input is invalid.
+
+ @warning This function takes a linear search time if the key is not nearby.
+ */
+yyjson_api_inline yyjson_val* yyjson_obj_iter_get(yyjson_obj_iter* iter, const char* key);
+
+/**
+ Iterates to a specified key and returns the value.
+
+ This function does the same thing as `yyjson_obj_getn()`, but is much faster
+ if the ordering of the keys is known at compile-time and you are using the same
+ order to look up the values. If the key exists in this object, then the
+ iterator will stop at the next key, otherwise the iterator will not change and
+ NULL is returned.
+
+ @param iter The object iterator, should not be NULL.
+ @param key The key, should be a UTF-8 string, null-terminator is not required.
+ @param key_len The the length of `key`, in bytes.
+ @return The value to which the specified key is mapped.
+    NULL if this object contains no mapping for the key or input is invalid.
+
+ @warning This function takes a linear search time if the key is not nearby.
+ */
+yyjson_api_inline yyjson_val* yyjson_obj_iter_getn(yyjson_obj_iter* iter, const char* key,
+    size_t key_len);
+
+/**
+ Macro for iterating over an object.
+ It works like iterator, but with a more intuitive API.
+
+ @par Example
+ @code
+    size_t idx, max;
+    yyjson_val *key, *val;
+    yyjson_obj_foreach(obj, idx, max, key, val) {
+        your_func(key, val);
+    }
+ @endcode
+ */
+#define yyjson_obj_foreach(obj, idx, max, key, val)                                                \
+    for ((idx) = 0, (max) = yyjson_obj_size(obj),                                                  \
+        (key) = (obj) ? unsafe_yyjson_get_first(obj) : NULL, (val) = (key) + 1;                    \
+         (idx) < (max); (idx)++, (key) = unsafe_yyjson_get_next(val), (val) = (key) + 1)
+
+/*==============================================================================
+ * Mutable JSON Document API
+ *============================================================================*/
+
+/** Returns the root value of this JSON document.
+    Returns NULL if `doc` is NULL. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_get_root(yyjson_mut_doc* doc);
+
+/** Sets the root value of this JSON document.
+    Pass NULL to clear root value of the document. */
+yyjson_api_inline void yyjson_mut_doc_set_root(yyjson_mut_doc* doc, yyjson_mut_val* root);
+
+/**
+ Set the string pool size for a mutable document.
+ This function does not allocate memory immediately, but uses the size when
+ the next memory allocation is needed.
+
+ If the caller knows the approximate bytes of strings that the document needs to
+ store (e.g. copy string with `yyjson_mut_strcpy` function), setting a larger
+ size can avoid multiple memory allocations and improve performance.
+
+ @param doc The mutable document.
+ @param len The desired string pool size in bytes (total string length).
+ @return true if successful, false if size is 0 or overflow.
+ */
+yyjson_api bool yyjson_mut_doc_set_str_pool_size(yyjson_mut_doc* doc, size_t len);
+
+/**
+ Set the value pool size for a mutable document.
+ This function does not allocate memory immediately, but uses the size when
+ the next memory allocation is needed.
+
+ If the caller knows the approximate number of values that the document needs to
+ store (e.g. create new value with `yyjson_mut_xxx` functions), setting a larger
+ size can avoid multiple memory allocations and improve performance.
+
+ @param doc The mutable document.
+ @param count The desired value pool size (number of `yyjson_mut_val`).
+ @return true if successful, false if size is 0 or overflow.
+ */
+yyjson_api bool yyjson_mut_doc_set_val_pool_size(yyjson_mut_doc* doc, size_t count);
+
+/** Release the JSON document and free the memory.
+    After calling this function, the `doc` and all values from the `doc` are no
+    longer available. This function will do nothing if the `doc` is NULL.  */
+yyjson_api void yyjson_mut_doc_free(yyjson_mut_doc* doc);
+
+/** Creates and returns a new mutable JSON document, returns NULL on error.
+    If allocator is NULL, the default allocator will be used. */
+yyjson_api yyjson_mut_doc* yyjson_mut_doc_new(const yyjson_alc* alc);
+
+/** Copies and returns a new mutable document from input, returns NULL on error.
+    This makes a `deep-copy` on the immutable document.
+    If allocator is NULL, the default allocator will be used.
+    @note `imut_doc` -> `mut_doc`. */
+yyjson_api yyjson_mut_doc* yyjson_doc_mut_copy(yyjson_doc* doc, const yyjson_alc* alc);
+
+/** Copies and returns a new mutable document from input, returns NULL on error.
+    This makes a `deep-copy` on the mutable document.
+    If allocator is NULL, the default allocator will be used.
+    @note `mut_doc` -> `mut_doc`. */
+yyjson_api yyjson_mut_doc* yyjson_mut_doc_mut_copy(yyjson_mut_doc* doc, const yyjson_alc* alc);
+
+/** Copies and returns a new mutable value from input, returns NULL on error.
+    This makes a `deep-copy` on the immutable value.
+    The memory was managed by mutable document.
+    @note `imut_val` -> `mut_val`. */
+yyjson_api yyjson_mut_val* yyjson_val_mut_copy(yyjson_mut_doc* doc, yyjson_val* val);
+
+/** Copies and returns a new mutable value from input, returns NULL on error.
+    This makes a `deep-copy` on the mutable value.
+    The memory was managed by mutable document.
+    @note `mut_val` -> `mut_val`.
+    @warning This function is recursive and may cause a stack overflow
+        if the object level is too deep. */
+yyjson_api yyjson_mut_val* yyjson_mut_val_mut_copy(yyjson_mut_doc* doc, yyjson_mut_val* val);
+
+/** Copies and returns a new immutable document from input,
+    returns NULL on error. This makes a `deep-copy` on the mutable document.
+    The returned document should be freed with `yyjson_doc_free()`.
+    @note `mut_doc` -> `imut_doc`.
+    @warning This function is recursive and may cause a stack overflow
+        if the object level is too deep. */
+yyjson_api yyjson_doc* yyjson_mut_doc_imut_copy(yyjson_mut_doc* doc, const yyjson_alc* alc);
+
+/** Copies and returns a new immutable document from input,
+    returns NULL on error. This makes a `deep-copy` on the mutable value.
+    The returned document should be freed with `yyjson_doc_free()`.
+    @note `mut_val` -> `imut_doc`.
+    @warning This function is recursive and may cause a stack overflow
+        if the object level is too deep. */
+yyjson_api yyjson_doc* yyjson_mut_val_imut_copy(yyjson_mut_val* val, const yyjson_alc* alc);
+
+/*==============================================================================
+ * Mutable JSON Value Type API
+ *============================================================================*/
+
+/** Returns whether the JSON value is raw.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_raw(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is `null`.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_null(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is `true`.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_true(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is `false`.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_false(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is bool (true/false).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_bool(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is unsigned integer (uint64_t).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_uint(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is signed integer (int64_t).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_sint(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is integer (uint64_t/int64_t).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_int(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is real number (double).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_real(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is number (uint/sint/real).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_num(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is string.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_str(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is array.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_arr(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is object.
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_obj(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is container (array/object).
+    Returns false if `val` is NULL. */
+yyjson_api_inline bool yyjson_mut_is_ctn(yyjson_mut_val* val);
+
+/*==============================================================================
+ * Mutable JSON Value Content API
+ *============================================================================*/
+
+/** Returns the JSON value's type.
+    Returns `YYJSON_TYPE_NONE` if `val` is NULL. */
+yyjson_api_inline yyjson_type yyjson_mut_get_type(yyjson_mut_val* val);
+
+/** Returns the JSON value's subtype.
+    Returns `YYJSON_SUBTYPE_NONE` if `val` is NULL. */
+yyjson_api_inline yyjson_subtype yyjson_mut_get_subtype(yyjson_mut_val* val);
+
+/** Returns the JSON value's tag.
+    Returns 0 if `val` is NULL. */
+yyjson_api_inline uint8_t yyjson_mut_get_tag(yyjson_mut_val* val);
+
+/** Returns the JSON value's type description.
+    The return value should be one of these strings: "raw", "null", "string",
+    "array", "object", "true", "false", "uint", "sint", "real", "unknown". */
+yyjson_api_inline const char* yyjson_mut_get_type_desc(yyjson_mut_val* val);
+
+/** Returns the content if the value is raw.
+    Returns NULL if `val` is NULL or type is not raw. */
+yyjson_api_inline const char* yyjson_mut_get_raw(yyjson_mut_val* val);
+
+/** Returns the content if the value is bool.
+    Returns NULL if `val` is NULL or type is not bool. */
+yyjson_api_inline bool yyjson_mut_get_bool(yyjson_mut_val* val);
+
+/** Returns the content and cast to uint64_t.
+    Returns 0 if `val` is NULL or type is not integer(sint/uint). */
+yyjson_api_inline uint64_t yyjson_mut_get_uint(yyjson_mut_val* val);
+
+/** Returns the content and cast to int64_t.
+    Returns 0 if `val` is NULL or type is not integer(sint/uint). */
+yyjson_api_inline int64_t yyjson_mut_get_sint(yyjson_mut_val* val);
+
+/** Returns the content and cast to int.
+    Returns 0 if `val` is NULL or type is not integer(sint/uint). */
+yyjson_api_inline int yyjson_mut_get_int(yyjson_mut_val* val);
+
+/** Returns the content if the value is real number.
+    Returns 0.0 if `val` is NULL or type is not real(double). */
+yyjson_api_inline double yyjson_mut_get_real(yyjson_mut_val* val);
+
+/** Returns the content and typecast to `double` if the value is number.
+    Returns 0.0 if `val` is NULL or type is not number(uint/sint/real). */
+yyjson_api_inline double yyjson_mut_get_num(yyjson_mut_val* val);
+
+/** Returns the content if the value is string.
+    Returns NULL if `val` is NULL or type is not string. */
+yyjson_api_inline const char* yyjson_mut_get_str(yyjson_mut_val* val);
+
+/** Returns the content length (string length, array size, object size.
+    Returns 0 if `val` is NULL or type is not string/array/object. */
+yyjson_api_inline size_t yyjson_mut_get_len(yyjson_mut_val* val);
+
+/** Returns whether the JSON value is equals to a string.
+    The `str` should be a null-terminated UTF-8 string.
+    Returns false if input is NULL or type is not string. */
+yyjson_api_inline bool yyjson_mut_equals_str(yyjson_mut_val* val, const char* str);
+
+/** Returns whether the JSON value is equals to a string.
+    The `str` should be a UTF-8 string, null-terminator is not required.
+    Returns false if input is NULL or type is not string. */
+yyjson_api_inline bool yyjson_mut_equals_strn(yyjson_mut_val* val, const char* str, size_t len);
+
+/** Returns whether two JSON values are equal (deep compare).
+    Returns false if input is NULL.
+    @note the result may be inaccurate if object has duplicate keys.
+    @warning This function is recursive and may cause a stack overflow
+        if the object level is too deep. */
+yyjson_api_inline bool yyjson_mut_equals(yyjson_mut_val* lhs, yyjson_mut_val* rhs);
+
+/** Set the value to raw.
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_raw(yyjson_mut_val* val, const char* raw, size_t len);
+
+/** Set the value to null.
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_null(yyjson_mut_val* val);
+
+/** Set the value to bool.
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_bool(yyjson_mut_val* val, bool num);
+
+/** Set the value to uint.
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_uint(yyjson_mut_val* val, uint64_t num);
+
+/** Set the value to sint.
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_sint(yyjson_mut_val* val, int64_t num);
+
+/** Set the value to int.
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_int(yyjson_mut_val* val, int num);
+
+/** Set the value to real.
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_real(yyjson_mut_val* val, double num);
+
+/** Set the value to string (null-terminated).
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_str(yyjson_mut_val* val, const char* str);
+
+/** Set the value to string (with length).
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_strn(yyjson_mut_val* val, const char* str, size_t len);
+
+/** Set the value to array.
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_arr(yyjson_mut_val* val);
+
+/** Set the value to array.
+    Returns false if input is NULL.
+    @warning This function should not be used on an existing object or array. */
+yyjson_api_inline bool yyjson_mut_set_obj(yyjson_mut_val* val);
+
+/*==============================================================================
+ * Mutable JSON Value Creation API
+ *============================================================================*/
+
+/** Creates and returns a raw value, returns NULL on error.
+    The `str` should be a null-terminated UTF-8 string.
+
+    @warning The input string is not copied, you should keep this string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_raw(yyjson_mut_doc* doc, const char* str);
+
+/** Creates and returns a raw value, returns NULL on error.
+    The `str` should be a UTF-8 string, null-terminator is not required.
+
+    @warning The input string is not copied, you should keep this string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_rawn(yyjson_mut_doc* doc, const char* str, size_t len);
+
+/** Creates and returns a raw value, returns NULL on error.
+    The `str` should be a null-terminated UTF-8 string.
+    The input string is copied and held by the document. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_rawcpy(yyjson_mut_doc* doc, const char* str);
+
+/** Creates and returns a raw value, returns NULL on error.
+    The `str` should be a UTF-8 string, null-terminator is not required.
+    The input string is copied and held by the document. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_rawncpy(yyjson_mut_doc* doc, const char* str,
+    size_t len);
+
+/** Creates and returns a null value, returns NULL on error. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_null(yyjson_mut_doc* doc);
+
+/** Creates and returns a true value, returns NULL on error. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_true(yyjson_mut_doc* doc);
+
+/** Creates and returns a false value, returns NULL on error. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_false(yyjson_mut_doc* doc);
+
+/** Creates and returns a bool value, returns NULL on error. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_bool(yyjson_mut_doc* doc, bool val);
+
+/** Creates and returns an unsigned integer value, returns NULL on error. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_uint(yyjson_mut_doc* doc, uint64_t num);
+
+/** Creates and returns a signed integer value, returns NULL on error. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_sint(yyjson_mut_doc* doc, int64_t num);
+
+/** Creates and returns a signed integer value, returns NULL on error. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_int(yyjson_mut_doc* doc, int64_t num);
+
+/** Creates and returns an real number value, returns NULL on error. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_real(yyjson_mut_doc* doc, double num);
+
+/** Creates and returns a string value, returns NULL on error.
+    The `str` should be a null-terminated UTF-8 string.
+    @warning The input string is not copied, you should keep this string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_str(yyjson_mut_doc* doc, const char* str);
+
+/** Creates and returns a string value, returns NULL on error.
+    The `str` should be a UTF-8 string, null-terminator is not required.
+    @warning The input string is not copied, you should keep this string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_strn(yyjson_mut_doc* doc, const char* str, size_t len);
+
+/** Creates and returns a string value, returns NULL on error.
+    The `str` should be a null-terminated UTF-8 string.
+    The input string is copied and held by the document. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_strcpy(yyjson_mut_doc* doc, const char* str);
+
+/** Creates and returns a string value, returns NULL on error.
+    The `str` should be a UTF-8 string, null-terminator is not required.
+    The input string is copied and held by the document. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_strncpy(yyjson_mut_doc* doc, const char* str,
+    size_t len);
+
+/*==============================================================================
+ * Mutable JSON Array API
+ *============================================================================*/
+
+/** Returns the number of elements in this array.
+    Returns 0 if `arr` is NULL or type is not array. */
+yyjson_api_inline size_t yyjson_mut_arr_size(yyjson_mut_val* arr);
+
+/** Returns the element at the specified position in this array.
+    Returns NULL if array is NULL/empty or the index is out of bounds.
+    @warning This function takes a linear search time. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_get(yyjson_mut_val* arr, size_t idx);
+
+/** Returns the first element of this array.
+    Returns NULL if `arr` is NULL/empty or type is not array. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_get_first(yyjson_mut_val* arr);
+
+/** Returns the last element of this array.
+    Returns NULL if `arr` is NULL/empty or type is not array. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_get_last(yyjson_mut_val* arr);
+
+/*==============================================================================
+ * Mutable JSON Array Iterator API
+ *============================================================================*/
+
+/**
+ A mutable JSON array iterator.
+
+ @warning You should not modify the array while iterating over it, but you can
+    use `yyjson_mut_arr_iter_remove()` to remove current value.
+
+ @par Example
+ @code
+    yyjson_mut_val *val;
+    yyjson_mut_arr_iter iter = yyjson_mut_arr_iter_with(arr);
+    while ((val = yyjson_mut_arr_iter_next(&iter))) {
+        your_func(val);
+        if (your_val_is_unused(val)) {
+            yyjson_mut_arr_iter_remove(&iter);
+        }
+    }
+ @endcode
+ */
+typedef struct yyjson_mut_arr_iter {
+    size_t idx;          /**< next value's index */
+    size_t max;          /**< maximum index (arr.size) */
+    yyjson_mut_val* cur; /**< current value */
+    yyjson_mut_val* pre; /**< previous value */
+    yyjson_mut_val* arr; /**< the array being iterated */
+} yyjson_mut_arr_iter;
+
+/**
+ Initialize an iterator for this array.
+
+ @param arr The array to be iterated over.
+    If this parameter is NULL or not an array, `iter` will be set to empty.
+ @param iter The iterator to be initialized.
+    If this parameter is NULL, the function will fail and return false.
+ @return true if the `iter` has been successfully initialized.
+
+ @note The iterator does not need to be destroyed.
+ */
+yyjson_api_inline bool yyjson_mut_arr_iter_init(yyjson_mut_val* arr, yyjson_mut_arr_iter* iter);
+
+/**
+ Create an iterator with an array , same as `yyjson_mut_arr_iter_init()`.
+
+ @param arr The array to be iterated over.
+    If this parameter is NULL or not an array, an empty iterator will returned.
+ @return A new iterator for the array.
+
+ @note The iterator does not need to be destroyed.
+ */
+yyjson_api_inline yyjson_mut_arr_iter yyjson_mut_arr_iter_with(yyjson_mut_val* arr);
+
+/**
+ Returns whether the iteration has more elements.
+ If `iter` is NULL, this function will return false.
+ */
+yyjson_api_inline bool yyjson_mut_arr_iter_has_next(yyjson_mut_arr_iter* iter);
+
+/**
+ Returns the next element in the iteration, or NULL on end.
+ If `iter` is NULL, this function will return NULL.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_iter_next(yyjson_mut_arr_iter* iter);
+
+/**
+ Removes and returns current element in the iteration.
+ If `iter` is NULL, this function will return NULL.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_iter_remove(yyjson_mut_arr_iter* iter);
+
+/**
+ Macro for iterating over an array.
+ It works like iterator, but with a more intuitive API.
+
+ @warning You should not modify the array while iterating over it.
+
+ @par Example
+ @code
+    size_t idx, max;
+    yyjson_mut_val *val;
+    yyjson_mut_arr_foreach(arr, idx, max, val) {
+        your_func(idx, val);
+    }
+ @endcode
+ */
+#define yyjson_mut_arr_foreach(arr, idx, max, val)                                                 \
+    for ((idx) = 0, (max) = yyjson_mut_arr_size(arr), (val) = yyjson_mut_arr_get_first(arr);       \
+         (idx) < (max); (idx)++, (val) = (val)->next)
+
+/*==============================================================================
+ * Mutable JSON Array Creation API
+ *============================================================================*/
+
+/**
+ Creates and returns an empty mutable array.
+ @param doc A mutable document, used for memory allocation only.
+ @return The new array. NULL if input is NULL or memory allocation failed.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr(yyjson_mut_doc* doc);
+
+/**
+ Creates and returns a new mutable array with the given boolean values.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of boolean values.
+ @param count The value count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const bool vals[3] = { true, false, true };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_bool(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_bool(yyjson_mut_doc* doc, const bool* vals,
+    size_t count);
+
+/**
+ Creates and returns a new mutable array with the given sint numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of sint numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const int64_t vals[3] = { -1, 0, 1 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_sint64(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint(yyjson_mut_doc* doc, const int64_t* vals,
+    size_t count);
+
+/**
+ Creates and returns a new mutable array with the given uint numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of uint numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const uint64_t vals[3] = { 0, 1, 0 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_uint(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint(yyjson_mut_doc* doc,
+    const uint64_t* vals, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given real numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of real numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const double vals[3] = { 0.1, 0.2, 0.3 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_real(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_real(yyjson_mut_doc* doc, const double* vals,
+    size_t count);
+
+/**
+ Creates and returns a new mutable array with the given int8 numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of int8 numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const int8_t vals[3] = { -1, 0, 1 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_sint8(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint8(yyjson_mut_doc* doc, const int8_t* vals,
+    size_t count);
+
+/**
+ Creates and returns a new mutable array with the given int16 numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of int16 numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const int16_t vals[3] = { -1, 0, 1 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_sint16(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint16(yyjson_mut_doc* doc,
+    const int16_t* vals, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given int32 numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of int32 numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const int32_t vals[3] = { -1, 0, 1 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_sint32(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint32(yyjson_mut_doc* doc,
+    const int32_t* vals, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given int64 numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of int64 numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const int64_t vals[3] = { -1, 0, 1 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_sint64(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint64(yyjson_mut_doc* doc,
+    const int64_t* vals, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given uint8 numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of uint8 numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const uint8_t vals[3] = { 0, 1, 0 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_uint8(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint8(yyjson_mut_doc* doc,
+    const uint8_t* vals, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given uint16 numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of uint16 numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const uint16_t vals[3] = { 0, 1, 0 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_uint16(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint16(yyjson_mut_doc* doc,
+    const uint16_t* vals, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given uint32 numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of uint32 numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const uint32_t vals[3] = { 0, 1, 0 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_uint32(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint32(yyjson_mut_doc* doc,
+    const uint32_t* vals, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given uint64 numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of uint64 numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+     const uint64_t vals[3] = { 0, 1, 0 };
+     yyjson_mut_val *arr = yyjson_mut_arr_with_uint64(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint64(yyjson_mut_doc* doc,
+    const uint64_t* vals, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given float numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of float numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const float vals[3] = { -1.0f, 0.0f, 1.0f };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_float(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_float(yyjson_mut_doc* doc, const float* vals,
+    size_t count);
+
+/**
+ Creates and returns a new mutable array with the given double numbers.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of double numbers.
+ @param count The number count. If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const double vals[3] = { -1.0, 0.0, 1.0 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_double(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_double(yyjson_mut_doc* doc,
+    const double* vals, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given strings, these strings
+ will not be copied.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of UTF-8 null-terminator strings.
+    If this array contains NULL, the function will fail and return NULL.
+ @param count The number of values in `vals`.
+    If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @warning The input strings are not copied, you should keep these strings
+    unmodified for the lifetime of this JSON document. If these strings will be
+    modified, you should use `yyjson_mut_arr_with_strcpy()` instead.
+
+ @par Example
+ @code
+    const char *vals[3] = { "a", "b", "c" };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_str(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_str(yyjson_mut_doc* doc, const char** vals,
+    size_t count);
+
+/**
+ Creates and returns a new mutable array with the given strings and string
+ lengths, these strings will not be copied.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of UTF-8 strings, null-terminator is not required.
+    If this array contains NULL, the function will fail and return NULL.
+ @param lens A C array of string lengths, in bytes.
+ @param count The number of strings in `vals`.
+    If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @warning The input strings are not copied, you should keep these strings
+    unmodified for the lifetime of this JSON document. If these strings will be
+    modified, you should use `yyjson_mut_arr_with_strncpy()` instead.
+
+ @par Example
+ @code
+    const char *vals[3] = { "a", "bb", "c" };
+    const size_t lens[3] = { 1, 2, 1 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_strn(doc, vals, lens, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_strn(yyjson_mut_doc* doc, const char** vals,
+    const size_t* lens, size_t count);
+
+/**
+ Creates and returns a new mutable array with the given strings, these strings
+ will be copied.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of UTF-8 null-terminator strings.
+    If this array contains NULL, the function will fail and return NULL.
+ @param count The number of values in `vals`.
+    If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const char *vals[3] = { "a", "b", "c" };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_strcpy(doc, vals, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_strcpy(yyjson_mut_doc* doc, const char** vals,
+    size_t count);
+
+/**
+ Creates and returns a new mutable array with the given strings and string
+ lengths, these strings will be copied.
+
+ @param doc A mutable document, used for memory allocation only.
+    If this parameter is NULL, the function will fail and return NULL.
+ @param vals A C array of UTF-8 strings, null-terminator is not required.
+    If this array contains NULL, the function will fail and return NULL.
+ @param lens A C array of string lengths, in bytes.
+ @param count The number of strings in `vals`.
+    If this value is 0, an empty array will return.
+ @return The new array. NULL if input is invalid or memory allocation failed.
+
+ @par Example
+ @code
+    const char *vals[3] = { "a", "bb", "c" };
+    const size_t lens[3] = { 1, 2, 1 };
+    yyjson_mut_val *arr = yyjson_mut_arr_with_strn(doc, vals, lens, 3);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_strncpy(yyjson_mut_doc* doc,
+    const char** vals, const size_t* lens, size_t count);
+
+/*==============================================================================
+ * Mutable JSON Array Modification API
+ *============================================================================*/
+
+/**
+ Inserts a value into an array at a given index.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param val The value to be inserted. Returns false if it is NULL.
+ @param idx The index to which to insert the new value.
+    Returns false if the index is out of range.
+ @return Whether successful.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline bool yyjson_mut_arr_insert(yyjson_mut_val* arr, yyjson_mut_val* val, size_t idx);
+
+/**
+ Inserts a value at the end of the array.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param val The value to be inserted. Returns false if it is NULL.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_append(yyjson_mut_val* arr, yyjson_mut_val* val);
+
+/**
+ Inserts a value at the head of the array.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param val The value to be inserted. Returns false if it is NULL.
+ @return    Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_prepend(yyjson_mut_val* arr, yyjson_mut_val* val);
+
+/**
+ Replaces a value at index and returns old value.
+ @param arr The array to which the value is to be replaced.
+    Returns false if it is NULL or not an array.
+ @param idx The index to which to replace the value.
+    Returns false if the index is out of range.
+ @param val The new value to replace. Returns false if it is NULL.
+ @return Old value, or NULL on error.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_replace(yyjson_mut_val* arr, size_t idx,
+    yyjson_mut_val* val);
+
+/**
+ Removes and returns a value at index.
+ @param arr The array from which the value is to be removed.
+    Returns false if it is NULL or not an array.
+ @param idx The index from which to remove the value.
+    Returns false if the index is out of range.
+ @return Old value, or NULL on error.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_remove(yyjson_mut_val* arr, size_t idx);
+
+/**
+ Removes and returns the first value in this array.
+ @param arr The array from which the value is to be removed.
+    Returns false if it is NULL or not an array.
+ @return The first value, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_remove_first(yyjson_mut_val* arr);
+
+/**
+ Removes and returns the last value in this array.
+ @param arr The array from which the value is to be removed.
+    Returns false if it is NULL or not an array.
+ @return The last value, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_remove_last(yyjson_mut_val* arr);
+
+/**
+ Removes all values within a specified range in the array.
+ @param arr The array from which the value is to be removed.
+    Returns false if it is NULL or not an array.
+ @param idx The start index of the range (0 is the first).
+ @param len The number of items in the range (can be 0).
+ @return Whether successful.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline bool yyjson_mut_arr_remove_range(yyjson_mut_val* arr, size_t idx, size_t len);
+
+/**
+ Removes all values in this array.
+ @param arr The array from which all of the values are to be removed.
+    Returns false if it is NULL or not an array.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_clear(yyjson_mut_val* arr);
+
+/**
+ Rotates values in this array for the given number of times.
+ For example: `[1,2,3,4,5]` rotate 2 is `[3,4,5,1,2]`.
+ @param arr The array to be rotated.
+ @param idx Index (or times) to rotate.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline bool yyjson_mut_arr_rotate(yyjson_mut_val* arr, size_t idx);
+
+/*==============================================================================
+ * Mutable JSON Array Modification Convenience API
+ *============================================================================*/
+
+/**
+ Adds a value at the end of the array.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param val The value to be inserted. Returns false if it is NULL.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_val(yyjson_mut_val* arr, yyjson_mut_val* val);
+
+/**
+ Adds a `null` value at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_null(yyjson_mut_doc* doc, yyjson_mut_val* arr);
+
+/**
+ Adds a `true` value at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_true(yyjson_mut_doc* doc, yyjson_mut_val* arr);
+
+/**
+ Adds a `false` value at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_false(yyjson_mut_doc* doc, yyjson_mut_val* arr);
+
+/**
+ Adds a bool value at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param val The bool value to be added.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_bool(yyjson_mut_doc* doc, yyjson_mut_val* arr, bool val);
+
+/**
+ Adds an unsigned integer value at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param num The number to be added.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_uint(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    uint64_t num);
+
+/**
+ Adds a signed integer value at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param num The number to be added.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_sint(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    int64_t num);
+
+/**
+ Adds a integer value at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param num The number to be added.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_int(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    int64_t num);
+
+/**
+ Adds a double value at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param num The number to be added.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_real(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    double num);
+
+/**
+ Adds a string value at the end of the array (no copy).
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param str A null-terminated UTF-8 string.
+ @return Whether successful.
+ @warning The input string is not copied, you should keep this string unmodified
+    for the lifetime of this JSON document.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_str(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    const char* str);
+
+/**
+ Adds a string value at the end of the array (no copy).
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param str A UTF-8 string, null-terminator is not required.
+ @param len The length of the string, in bytes.
+ @return Whether successful.
+ @warning The input string is not copied, you should keep this string unmodified
+    for the lifetime of this JSON document.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_strn(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    const char* str, size_t len);
+
+/**
+ Adds a string value at the end of the array (copied).
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param str A null-terminated UTF-8 string.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_strcpy(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    const char* str);
+
+/**
+ Adds a string value at the end of the array (copied).
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @param str A UTF-8 string, null-terminator is not required.
+ @param len The length of the string, in bytes.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_arr_add_strncpy(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    const char* str, size_t len);
+
+/**
+ Creates and adds a new array at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @return The new array, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_add_arr(yyjson_mut_doc* doc, yyjson_mut_val* arr);
+
+/**
+ Creates and adds a new object at the end of the array.
+ @param doc The `doc` is only used for memory allocation.
+ @param arr The array to which the value is to be inserted.
+    Returns false if it is NULL or not an array.
+ @return The new object, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_add_obj(yyjson_mut_doc* doc, yyjson_mut_val* arr);
+
+/*==============================================================================
+ * Mutable JSON Object API
+ *============================================================================*/
+
+/** Returns the number of key-value pairs in this object.
+    Returns 0 if `obj` is NULL or type is not object. */
+yyjson_api_inline size_t yyjson_mut_obj_size(yyjson_mut_val* obj);
+
+/** Returns the value to which the specified key is mapped.
+    Returns NULL if this object contains no mapping for the key.
+    Returns NULL if `obj/key` is NULL, or type is not object.
+
+    The `key` should be a null-terminated UTF-8 string.
+
+    @warning This function takes a linear search time. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_get(yyjson_mut_val* obj, const char* key);
+
+/** Returns the value to which the specified key is mapped.
+    Returns NULL if this object contains no mapping for the key.
+    Returns NULL if `obj/key` is NULL, or type is not object.
+
+    The `key` should be a UTF-8 string, null-terminator is not required.
+    The `key_len` should be the length of the key, in bytes.
+
+    @warning This function takes a linear search time. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_getn(yyjson_mut_val* obj, const char* key,
+    size_t key_len);
+
+/*==============================================================================
+ * Mutable JSON Object Iterator API
+ *============================================================================*/
+
+/**
+ A mutable JSON object iterator.
+
+ @warning You should not modify the object while iterating over it, but you can
+    use `yyjson_mut_obj_iter_remove()` to remove current value.
+
+ @par Example
+ @code
+    yyjson_mut_val *key, *val;
+    yyjson_mut_obj_iter iter = yyjson_mut_obj_iter_with(obj);
+    while ((key = yyjson_mut_obj_iter_next(&iter))) {
+        val = yyjson_mut_obj_iter_get_val(key);
+        your_func(key, val);
+        if (your_val_is_unused(key, val)) {
+            yyjson_mut_obj_iter_remove(&iter);
+        }
+    }
+ @endcode
+
+ If the ordering of the keys is known at compile-time, you can use this method
+ to speed up value lookups:
+ @code
+    // {"k1":1, "k2": 3, "k3": 3}
+    yyjson_mut_val *key, *val;
+    yyjson_mut_obj_iter iter = yyjson_mut_obj_iter_with(obj);
+    yyjson_mut_val *v1 = yyjson_mut_obj_iter_get(&iter, "k1");
+    yyjson_mut_val *v3 = yyjson_mut_obj_iter_get(&iter, "k3");
+ @endcode
+ @see `yyjson_mut_obj_iter_get()` and `yyjson_mut_obj_iter_getn()`
+ */
+typedef struct yyjson_mut_obj_iter {
+    size_t idx;          /**< next key's index */
+    size_t max;          /**< maximum key index (obj.size) */
+    yyjson_mut_val* cur; /**< current key */
+    yyjson_mut_val* pre; /**< previous key */
+    yyjson_mut_val* obj; /**< the object being iterated */
+} yyjson_mut_obj_iter;
+
+/**
+ Initialize an iterator for this object.
+
+ @param obj The object to be iterated over.
+    If this parameter is NULL or not an array, `iter` will be set to empty.
+ @param iter The iterator to be initialized.
+    If this parameter is NULL, the function will fail and return false.
+ @return true if the `iter` has been successfully initialized.
+
+ @note The iterator does not need to be destroyed.
+ */
+yyjson_api_inline bool yyjson_mut_obj_iter_init(yyjson_mut_val* obj, yyjson_mut_obj_iter* iter);
+
+/**
+ Create an iterator with an object, same as `yyjson_obj_iter_init()`.
+
+ @param obj The object to be iterated over.
+    If this parameter is NULL or not an object, an empty iterator will returned.
+ @return A new iterator for the object.
+
+ @note The iterator does not need to be destroyed.
+ */
+yyjson_api_inline yyjson_mut_obj_iter yyjson_mut_obj_iter_with(yyjson_mut_val* obj);
+
+/**
+ Returns whether the iteration has more elements.
+ If `iter` is NULL, this function will return false.
+ */
+yyjson_api_inline bool yyjson_mut_obj_iter_has_next(yyjson_mut_obj_iter* iter);
+
+/**
+ Returns the next key in the iteration, or NULL on end.
+ If `iter` is NULL, this function will return NULL.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_next(yyjson_mut_obj_iter* iter);
+
+/**
+ Returns the value for key inside the iteration.
+ If `iter` is NULL, this function will return NULL.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_get_val(yyjson_mut_val* key);
+
+/**
+ Removes current key-value pair in the iteration, returns the removed value.
+ If `iter` is NULL, this function will return NULL.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_remove(yyjson_mut_obj_iter* iter);
+
+/**
+ Iterates to a specified key and returns the value.
+
+ This function does the same thing as `yyjson_mut_obj_get()`, but is much faster
+ if the ordering of the keys is known at compile-time and you are using the same
+ order to look up the values. If the key exists in this object, then the
+ iterator will stop at the next key, otherwise the iterator will not change and
+ NULL is returned.
+
+ @param iter The object iterator, should not be NULL.
+ @param key The key, should be a UTF-8 string with null-terminator.
+ @return The value to which the specified key is mapped.
+    NULL if this object contains no mapping for the key or input is invalid.
+
+ @warning This function takes a linear search time if the key is not nearby.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_get(yyjson_mut_obj_iter* iter,
+    const char* key);
+
+/**
+ Iterates to a specified key and returns the value.
+
+ This function does the same thing as `yyjson_mut_obj_getn()` but is much faster
+ if the ordering of the keys is known at compile-time and you are using the same
+ order to look up the values. If the key exists in this object, then the
+ iterator will stop at the next key, otherwise the iterator will not change and
+ NULL is returned.
+
+ @param iter The object iterator, should not be NULL.
+ @param key The key, should be a UTF-8 string, null-terminator is not required.
+ @param key_len The the length of `key`, in bytes.
+ @return The value to which the specified key is mapped.
+    NULL if this object contains no mapping for the key or input is invalid.
+
+ @warning This function takes a linear search time if the key is not nearby.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_getn(yyjson_mut_obj_iter* iter,
+    const char* key, size_t key_len);
+
+/**
+ Macro for iterating over an object.
+ It works like iterator, but with a more intuitive API.
+
+ @warning You should not modify the object while iterating over it.
+
+ @par Example
+ @code
+    size_t idx, max;
+    yyjson_val *key, *val;
+    yyjson_obj_foreach(obj, idx, max, key, val) {
+        your_func(key, val);
+    }
+ @endcode
+ */
+#define yyjson_mut_obj_foreach(obj, idx, max, key, val)                                            \
+    for ((idx) = 0, (max) = yyjson_mut_obj_size(obj),                                              \
+        (key) = (max) ? ((yyjson_mut_val*)(obj)->uni.ptr)->next->next : NULL,                      \
+        (val) = (key) ? (key)->next : NULL;                                                        \
+         (idx) < (max); (idx)++, (key) = (val)->next, (val) = (key)->next)
+
+/*==============================================================================
+ * Mutable JSON Object Creation API
+ *============================================================================*/
+
+/** Creates and returns a mutable object, returns NULL on error. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj(yyjson_mut_doc* doc);
+
+/**
+ Creates and returns a mutable object with keys and values, returns NULL on
+ error. The keys and values are not copied. The strings should be a
+ null-terminated UTF-8 string.
+
+ @warning The input string is not copied, you should keep this string
+    unmodified for the lifetime of this JSON document.
+
+ @par Example
+ @code
+    const char *keys[2] = { "id", "name" };
+    const char *vals[2] = { "01", "Harry" };
+    yyjson_mut_val *obj = yyjson_mut_obj_with_str(doc, keys, vals, 2);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_with_str(yyjson_mut_doc* doc, const char** keys,
+    const char** vals, size_t count);
+
+/**
+ Creates and returns a mutable object with key-value pairs and pair count,
+ returns NULL on error. The keys and values are not copied. The strings should
+ be a null-terminated UTF-8 string.
+
+ @warning The input string is not copied, you should keep this string
+    unmodified for the lifetime of this JSON document.
+
+ @par Example
+ @code
+    const char *kv_pairs[4] = { "id", "01", "name", "Harry" };
+    yyjson_mut_val *obj = yyjson_mut_obj_with_kv(doc, kv_pairs, 2);
+ @endcode
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_with_kv(yyjson_mut_doc* doc, const char** kv_pairs,
+    size_t pair_count);
+
+/*==============================================================================
+ * Mutable JSON Object Modification API
+ *============================================================================*/
+
+/**
+ Adds a key-value pair at the end of the object.
+ This function allows duplicated key in one object.
+ @param obj The object to which the new key-value pair is to be added.
+ @param key The key, should be a string which is created by `yyjson_mut_str()`,
+    `yyjson_mut_strn()`, `yyjson_mut_strcpy()` or `yyjson_mut_strncpy()`.
+ @param val The value to add to the object.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_obj_add(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val);
+/**
+ Sets a key-value pair at the end of the object.
+ This function may remove all key-value pairs for the given key before add.
+ @param obj The object to which the new key-value pair is to be added.
+ @param key The key, should be a string which is created by `yyjson_mut_str()`,
+    `yyjson_mut_strn()`, `yyjson_mut_strcpy()` or `yyjson_mut_strncpy()`.
+ @param val The value to add to the object. If this value is null, the behavior
+    is same as `yyjson_mut_obj_remove()`.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_obj_put(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val);
+
+/**
+ Inserts a key-value pair to the object at the given position.
+ This function allows duplicated key in one object.
+ @param obj The object to which the new key-value pair is to be added.
+ @param key The key, should be a string which is created by `yyjson_mut_str()`,
+    `yyjson_mut_strn()`, `yyjson_mut_strcpy()` or `yyjson_mut_strncpy()`.
+ @param val The value to add to the object.
+ @param idx The index to which to insert the new pair.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_obj_insert(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val, size_t idx);
+
+/**
+ Removes all key-value pair from the object with given key.
+ @param obj The object from which the key-value pair is to be removed.
+ @param key The key, should be a string value.
+ @return The first matched value, or NULL if no matched value.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove(yyjson_mut_val* obj, yyjson_mut_val* key);
+
+/**
+ Removes all key-value pair from the object with given key.
+ @param obj The object from which the key-value pair is to be removed.
+ @param key The key, should be a UTF-8 string with null-terminator.
+ @return The first matched value, or NULL if no matched value.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove_key(yyjson_mut_val* obj, const char* key);
+
+/**
+ Removes all key-value pair from the object with given key.
+ @param obj The object from which the key-value pair is to be removed.
+ @param key The key, should be a UTF-8 string, null-terminator is not required.
+ @param key_len The length of the key.
+ @return The first matched value, or NULL if no matched value.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove_keyn(yyjson_mut_val* obj, const char* key,
+    size_t key_len);
+
+/**
+ Removes all key-value pairs in this object.
+ @param obj The object from which all of the values are to be removed.
+ @return Whether successful.
+ */
+yyjson_api_inline bool yyjson_mut_obj_clear(yyjson_mut_val* obj);
+
+/**
+ Replaces value from the object with given key.
+ If the key is not exist, or the value is NULL, it will fail.
+ @param obj The object to which the value is to be replaced.
+ @param key The key, should be a string value.
+ @param val The value to replace into the object.
+ @return Whether successful.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline bool yyjson_mut_obj_replace(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val);
+
+/**
+ Rotates key-value pairs in the object for the given number of times.
+ For example: `{"a":1,"b":2,"c":3,"d":4}` rotate 1 is
+ `{"b":2,"c":3,"d":4,"a":1}`.
+ @param obj The object to be rotated.
+ @param idx Index (or times) to rotate.
+ @return Whether successful.
+ @warning This function takes a linear search time.
+ */
+yyjson_api_inline bool yyjson_mut_obj_rotate(yyjson_mut_val* obj, size_t idx);
+
+/*==============================================================================
+ * Mutable JSON Object Modification Convenience API
+ *============================================================================*/
+
+/** Adds a `null` value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_null(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key);
+
+/** Adds a `true` value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_true(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key);
+
+/** Adds a `false` value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_false(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key);
+
+/** Adds a bool value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_bool(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, bool val);
+
+/** Adds an unsigned integer value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_uint(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, uint64_t val);
+
+/** Adds a signed integer value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_sint(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, int64_t val);
+
+/** Adds an int value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_int(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, int64_t val);
+
+/** Adds a double value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_real(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, double val);
+
+/** Adds a string value at the end of the object.
+    The `key` and `val` should be null-terminated UTF-8 strings.
+    This function allows duplicated key in one object.
+
+    @warning The key/value strings are not copied, you should keep these strings
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_str(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, const char* val);
+
+/** Adds a string value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    The `val` should be a UTF-8 string, null-terminator is not required.
+    The `len` should be the length of the `val`, in bytes.
+    This function allows duplicated key in one object.
+
+    @warning The key/value strings are not copied, you should keep these strings
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_strn(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, const char* val, size_t len);
+
+/** Adds a string value at the end of the object.
+    The `key` and `val` should be null-terminated UTF-8 strings.
+    The value string is copied.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_strcpy(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, const char* val);
+
+/** Adds a string value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    The `val` should be a UTF-8 string, null-terminator is not required.
+    The `len` should be the length of the `val`, in bytes.
+    This function allows duplicated key in one object.
+
+    @warning The key strings are not copied, you should keep these strings
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_strncpy(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, const char* val, size_t len);
+
+/**
+ Creates and adds a new array to the target object.
+ The `key` should be a null-terminated UTF-8 string.
+ This function allows duplicated key in one object.
+
+ @warning The key string is not copied, you should keep these strings
+          unmodified for the lifetime of this JSON document.
+ @return The new array, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_add_arr(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key);
+
+/**
+ Creates and adds a new object to the target object.
+ The `key` should be a null-terminated UTF-8 string.
+ This function allows duplicated key in one object.
+
+ @warning The key string is not copied, you should keep these strings
+          unmodified for the lifetime of this JSON document.
+ @return The new object, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_add_obj(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key);
+
+/** Adds a JSON value at the end of the object.
+    The `key` should be a null-terminated UTF-8 string.
+    This function allows duplicated key in one object.
+
+    @warning The key string is not copied, you should keep the string
+        unmodified for the lifetime of this JSON document. */
+yyjson_api_inline bool yyjson_mut_obj_add_val(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, yyjson_mut_val* val);
+
+/** Removes all key-value pairs for the given key.
+    Returns the first value to which the specified key is mapped or NULL if this
+    object contains no mapping for the key.
+    The `key` should be a null-terminated UTF-8 string.
+
+    @warning This function takes a linear search time. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove_str(yyjson_mut_val* obj, const char* key);
+
+/** Removes all key-value pairs for the given key.
+    Returns the first value to which the specified key is mapped or NULL if this
+    object contains no mapping for the key.
+    The `key` should be a UTF-8 string, null-terminator is not required.
+    The `len` should be the length of the key, in bytes.
+
+    @warning This function takes a linear search time. */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove_strn(yyjson_mut_val* obj, const char* key,
+    size_t len);
+
+/** Replaces all matching keys with the new key.
+    Returns true if at least one key was renamed.
+    The `key` and `new_key` should be a null-terminated UTF-8 string.
+    The `new_key` is copied and held by doc.
+
+    @warning This function takes a linear search time.
+    If `new_key` already exists, it will cause duplicate keys.
+ */
+yyjson_api_inline bool yyjson_mut_obj_rename_key(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, const char* new_key);
+
+/** Replaces all matching keys with the new key.
+    Returns true if at least one key was renamed.
+    The `key` and `new_key` should be a UTF-8 string,
+    null-terminator is not required. The `new_key` is copied and held by doc.
+
+    @warning This function takes a linear search time.
+    If `new_key` already exists, it will cause duplicate keys.
+ */
+yyjson_api_inline bool yyjson_mut_obj_rename_keyn(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, size_t len, const char* new_key, size_t new_len);
+
+/*==============================================================================
+ * JSON Pointer API (RFC 6901)
+ * https://tools.ietf.org/html/rfc6901
+ *============================================================================*/
+
+/** JSON Pointer error code. */
+typedef uint32_t yyjson_ptr_code;
+
+/** No JSON pointer error. */
+static const yyjson_ptr_code YYJSON_PTR_ERR_NONE = 0;
+
+/** Invalid input parameter, such as NULL input. */
+static const yyjson_ptr_code YYJSON_PTR_ERR_PARAMETER = 1;
+
+/** JSON pointer syntax error, such as invalid escape, token no prefix. */
+static const yyjson_ptr_code YYJSON_PTR_ERR_SYNTAX = 2;
+
+/** JSON pointer resolve failed, such as index out of range, key not found. */
+static const yyjson_ptr_code YYJSON_PTR_ERR_RESOLVE = 3;
+
+/** Document's root is NULL, but it is required for the function call. */
+static const yyjson_ptr_code YYJSON_PTR_ERR_NULL_ROOT = 4;
+
+/** Cannot set root as the target is not a document. */
+static const yyjson_ptr_code YYJSON_PTR_ERR_SET_ROOT = 5;
+
+/** The memory allocation failed and a new value could not be created. */
+static const yyjson_ptr_code YYJSON_PTR_ERR_MEMORY_ALLOCATION = 6;
+
+/** Error information for JSON pointer. */
+typedef struct yyjson_ptr_err {
+    /** Error code, see `yyjson_ptr_code` for all possible values. */
+    yyjson_ptr_code code;
+    /** Error message, constant, no need to free (NULL if no error). */
+    const char* msg;
+    /** Error byte position for input JSON pointer (0 if no error). */
+    size_t pos;
+} yyjson_ptr_err;
+
+/**
+ A context for JSON pointer operation.
+
+ This struct stores the context of JSON Pointer operation result. The struct
+ can be used with three helper functions: `ctx_append()`, `ctx_replace()`, and
+ `ctx_remove()`, which perform the corresponding operations on the container
+ without re-parsing the JSON Pointer.
+
+ For example:
+ @code
+    // doc before: {"a":[0,1,null]}
+    // ptr: "/a/2"
+    val = yyjson_mut_doc_ptr_getx(doc, ptr, strlen(ptr), &ctx, &err);
+    if (yyjson_is_null(val)) {
+        yyjson_ptr_ctx_remove(&ctx);
+    }
+    // doc after: {"a":[0,1]}
+ @endcode
+ */
+typedef struct yyjson_ptr_ctx {
+    /**
+     The container (parent) of the target value. It can be either an array or
+     an object. If the target location has no value, but all its parent
+     containers exist, and the target location can be used to insert a new
+     value, then `ctn` is the parent container of the target location.
+     Otherwise, `ctn` is NULL.
+     */
+    yyjson_mut_val* ctn;
+    /**
+     The previous sibling of the target value. It can be either a value in an
+     array or a key in an object. As the container is a `circular linked list`
+     of elements, `pre` is the previous node of the target value. If the
+     operation is `add` or `set`, then `pre` is the previous node of the new
+     value, not the original target value. If the target value does not exist,
+     `pre` is NULL.
+     */
+    yyjson_mut_val* pre;
+    /**
+     The removed value if the operation is `set`, `replace` or `remove`. It can
+     be used to restore the original state of the document if needed.
+     */
+    yyjson_mut_val* old;
+} yyjson_ptr_ctx;
+
+/**
+ Get value by a JSON Pointer.
+ @param doc The JSON document to be queried.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @return The value referenced by the JSON pointer.
+    NULL if `doc` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_val* yyjson_doc_ptr_get(yyjson_doc* doc, const char* ptr);
+
+/**
+ Get value by a JSON Pointer.
+ @param doc The JSON document to be queried.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @return The value referenced by the JSON pointer.
+    NULL if `doc` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_val* yyjson_doc_ptr_getn(yyjson_doc* doc, const char* ptr, size_t len);
+
+/**
+ Get value by a JSON Pointer.
+ @param doc The JSON document to be queried.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return The value referenced by the JSON pointer.
+    NULL if `doc` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_val* yyjson_doc_ptr_getx(yyjson_doc* doc, const char* ptr, size_t len,
+    yyjson_ptr_err* err);
+
+/**
+ Get value by a JSON Pointer.
+ @param val The JSON value to be queried.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @return The value referenced by the JSON pointer.
+    NULL if `val` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_val* yyjson_ptr_get(yyjson_val* val, const char* ptr);
+
+/**
+ Get value by a JSON Pointer.
+ @param val The JSON value to be queried.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @return The value referenced by the JSON pointer.
+    NULL if `val` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_val* yyjson_ptr_getn(yyjson_val* val, const char* ptr, size_t len);
+
+/**
+ Get value by a JSON Pointer.
+ @param val The JSON value to be queried.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return The value referenced by the JSON pointer.
+    NULL if `val` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_val* yyjson_ptr_getx(yyjson_val* val, const char* ptr, size_t len,
+    yyjson_ptr_err* err);
+
+/**
+ Get value by a JSON Pointer.
+ @param doc The JSON document to be queried.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @return The value referenced by the JSON pointer.
+    NULL if `doc` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_get(yyjson_mut_doc* doc, const char* ptr);
+
+/**
+ Get value by a JSON Pointer.
+ @param doc The JSON document to be queried.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @return The value referenced by the JSON pointer.
+    NULL if `doc` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_getn(yyjson_mut_doc* doc, const char* ptr,
+    size_t len);
+
+/**
+ Get value by a JSON Pointer.
+ @param doc The JSON document to be queried.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return The value referenced by the JSON pointer.
+    NULL if `doc` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_getx(yyjson_mut_doc* doc, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/**
+ Get value by a JSON Pointer.
+ @param val The JSON value to be queried.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @return The value referenced by the JSON pointer.
+    NULL if `val` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_get(yyjson_mut_val* val, const char* ptr);
+
+/**
+ Get value by a JSON Pointer.
+ @param val The JSON value to be queried.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @return The value referenced by the JSON pointer.
+    NULL if `val` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_getn(yyjson_mut_val* val, const char* ptr,
+    size_t len);
+
+/**
+ Get value by a JSON Pointer.
+ @param val The JSON value to be queried.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return The value referenced by the JSON pointer.
+    NULL if `val` or `ptr` is NULL, or the JSON pointer cannot be resolved.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_getx(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/**
+ Add (insert) value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @param new_val The value to be added.
+ @return true if JSON pointer is valid and new value is added, false otherwise.
+ @note The parent nodes will be created if they do not exist.
+ */
+yyjson_api_inline bool yyjson_mut_doc_ptr_add(yyjson_mut_doc* doc, const char* ptr,
+    yyjson_mut_val* new_val);
+
+/**
+ Add (insert) value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The value to be added.
+ @return true if JSON pointer is valid and new value is added, false otherwise.
+ @note The parent nodes will be created if they do not exist.
+ */
+yyjson_api_inline bool yyjson_mut_doc_ptr_addn(yyjson_mut_doc* doc, const char* ptr, size_t len,
+    yyjson_mut_val* new_val);
+
+/**
+ Add (insert) value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The value to be added.
+ @param create_parent Whether to create parent nodes if not exist.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return true if JSON pointer is valid and new value is added, false otherwise.
+ */
+yyjson_api_inline bool yyjson_mut_doc_ptr_addx(yyjson_mut_doc* doc, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, bool create_parent, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/**
+ Add (insert) value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @param doc Only used to create new values when needed.
+ @param new_val The value to be added.
+ @return true if JSON pointer is valid and new value is added, false otherwise.
+ @note The parent nodes will be created if they do not exist.
+ */
+yyjson_api_inline bool yyjson_mut_ptr_add(yyjson_mut_val* val, const char* ptr,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc);
+
+/**
+ Add (insert) value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param doc Only used to create new values when needed.
+ @param new_val The value to be added.
+ @return true if JSON pointer is valid and new value is added, false otherwise.
+ @note The parent nodes will be created if they do not exist.
+ */
+yyjson_api_inline bool yyjson_mut_ptr_addn(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc);
+
+/**
+ Add (insert) value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param doc Only used to create new values when needed.
+ @param new_val The value to be added.
+ @param create_parent Whether to create parent nodes if not exist.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return true if JSON pointer is valid and new value is added, false otherwise.
+ */
+yyjson_api_inline bool yyjson_mut_ptr_addx(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc, bool create_parent, yyjson_ptr_ctx* ctx,
+    yyjson_ptr_err* err);
+
+/**
+ Set value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @param new_val The value to be set, pass NULL to remove.
+ @return true if JSON pointer is valid and new value is set, false otherwise.
+ @note The parent nodes will be created if they do not exist.
+    If the target value already exists, it will be replaced by the new value.
+ */
+yyjson_api_inline bool yyjson_mut_doc_ptr_set(yyjson_mut_doc* doc, const char* ptr,
+    yyjson_mut_val* new_val);
+
+/**
+ Set value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The value to be set, pass NULL to remove.
+ @return true if JSON pointer is valid and new value is set, false otherwise.
+ @note The parent nodes will be created if they do not exist.
+    If the target value already exists, it will be replaced by the new value.
+ */
+yyjson_api_inline bool yyjson_mut_doc_ptr_setn(yyjson_mut_doc* doc, const char* ptr, size_t len,
+    yyjson_mut_val* new_val);
+
+/**
+ Set value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The value to be set, pass NULL to remove.
+ @param create_parent Whether to create parent nodes if not exist.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return true if JSON pointer is valid and new value is set, false otherwise.
+ @note If the target value already exists, it will be replaced by the new value.
+ */
+yyjson_api_inline bool yyjson_mut_doc_ptr_setx(yyjson_mut_doc* doc, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, bool create_parent, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/**
+ Set value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @param new_val The value to be set, pass NULL to remove.
+ @param doc Only used to create new values when needed.
+ @return true if JSON pointer is valid and new value is set, false otherwise.
+ @note The parent nodes will be created if they do not exist.
+    If the target value already exists, it will be replaced by the new value.
+ */
+yyjson_api_inline bool yyjson_mut_ptr_set(yyjson_mut_val* val, const char* ptr,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc);
+
+/**
+ Set value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The value to be set, pass NULL to remove.
+ @param doc Only used to create new values when needed.
+ @return true if JSON pointer is valid and new value is set, false otherwise.
+ @note The parent nodes will be created if they do not exist.
+    If the target value already exists, it will be replaced by the new value.
+ */
+yyjson_api_inline bool yyjson_mut_ptr_setn(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc);
+
+/**
+ Set value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The value to be set, pass NULL to remove.
+ @param doc Only used to create new values when needed.
+ @param create_parent Whether to create parent nodes if not exist.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return true if JSON pointer is valid and new value is set, false otherwise.
+ @note If the target value already exists, it will be replaced by the new value.
+ */
+yyjson_api_inline bool yyjson_mut_ptr_setx(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc, bool create_parent, yyjson_ptr_ctx* ctx,
+    yyjson_ptr_err* err);
+
+/**
+ Replace value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @param new_val The new value to replace the old one.
+ @return The old value that was replaced, or NULL if not found.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_replace(yyjson_mut_doc* doc, const char* ptr,
+    yyjson_mut_val* new_val);
+
+/**
+ Replace value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The new value to replace the old one.
+ @return The old value that was replaced, or NULL if not found.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_replacen(yyjson_mut_doc* doc, const char* ptr,
+    size_t len, yyjson_mut_val* new_val);
+
+/**
+ Replace value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The new value to replace the old one.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return The old value that was replaced, or NULL if not found.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_replacex(yyjson_mut_doc* doc, const char* ptr,
+    size_t len, yyjson_mut_val* new_val, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/**
+ Replace value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @param new_val The new value to replace the old one.
+ @return The old value that was replaced, or NULL if not found.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_replace(yyjson_mut_val* val, const char* ptr,
+    yyjson_mut_val* new_val);
+
+/**
+ Replace value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The new value to replace the old one.
+ @return The old value that was replaced, or NULL if not found.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_replacen(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_mut_val* new_val);
+
+/**
+ Replace value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param new_val The new value to replace the old one.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return The old value that was replaced, or NULL if not found.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_replacex(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_mut_val* new_val, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/**
+ Remove value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @return The removed value, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_remove(yyjson_mut_doc* doc, const char* ptr);
+
+/**
+ Remove value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @return The removed value, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_removen(yyjson_mut_doc* doc, const char* ptr,
+    size_t len);
+
+/**
+ Remove value by a JSON pointer.
+ @param doc The target JSON document.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return The removed value, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_removex(yyjson_mut_doc* doc, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/**
+ Remove value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8 with null-terminator).
+ @return The removed value, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_remove(yyjson_mut_val* val, const char* ptr);
+
+/**
+ Remove value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @return The removed value, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_removen(yyjson_mut_val* val, const char* ptr,
+    size_t len);
+
+/**
+ Remove value by a JSON pointer.
+ @param val The target JSON value.
+ @param ptr The JSON pointer string (UTF-8, null-terminator is not required).
+ @param len The length of `ptr` in bytes.
+ @param ctx A pointer to store the result context, or NULL if not needed.
+ @param err A pointer to store the error information, or NULL if not needed.
+ @return The removed value, or NULL on error.
+ */
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_removex(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/**
+ Append value by JSON pointer context.
+ @param ctx The context from the `yyjson_mut_ptr_xxx()` calls.
+ @param key New key if `ctx->ctn` is object, or NULL if `ctx->ctn` is array.
+ @param val New value to be added.
+ @return true on success or false on fail.
+ */
+yyjson_api_inline bool yyjson_ptr_ctx_append(yyjson_ptr_ctx* ctx, yyjson_mut_val* key,
+    yyjson_mut_val* val);
+
+/**
+ Replace value by JSON pointer context.
+ @param ctx The context from the `yyjson_mut_ptr_xxx()` calls.
+ @param val New value to be replaced.
+ @return true on success or false on fail.
+ @note If success, the old value will be returned via `ctx->old`.
+ */
+yyjson_api_inline bool yyjson_ptr_ctx_replace(yyjson_ptr_ctx* ctx, yyjson_mut_val* val);
+
+/**
+ Remove value by JSON pointer context.
+ @param ctx The context from the `yyjson_mut_ptr_xxx()` calls.
+ @return true on success or false on fail.
+ @note If success, the old value will be returned via `ctx->old`.
+ */
+yyjson_api_inline bool yyjson_ptr_ctx_remove(yyjson_ptr_ctx* ctx);
+
+/*==============================================================================
+ * JSON Patch API (RFC 6902)
+ * https://tools.ietf.org/html/rfc6902
+ *============================================================================*/
+
+/** Result code for JSON patch. */
+typedef uint32_t yyjson_patch_code;
+
+/** Success, no error. */
+static const yyjson_patch_code YYJSON_PATCH_SUCCESS = 0;
+
+/** Invalid parameter, such as NULL input or non-array patch. */
+static const yyjson_patch_code YYJSON_PATCH_ERROR_INVALID_PARAMETER = 1;
+
+/** Memory allocation failure occurs. */
+static const yyjson_patch_code YYJSON_PATCH_ERROR_MEMORY_ALLOCATION = 2;
+
+/** JSON patch operation is not object type. */
+static const yyjson_patch_code YYJSON_PATCH_ERROR_INVALID_OPERATION = 3;
+
+/** JSON patch operation is missing a required key. */
+static const yyjson_patch_code YYJSON_PATCH_ERROR_MISSING_KEY = 4;
+
+/** JSON patch operation member is invalid. */
+static const yyjson_patch_code YYJSON_PATCH_ERROR_INVALID_MEMBER = 5;
+
+/** JSON patch operation `test` not equal. */
+static const yyjson_patch_code YYJSON_PATCH_ERROR_EQUAL = 6;
+
+/** JSON patch operation failed on JSON pointer. */
+static const yyjson_patch_code YYJSON_PATCH_ERROR_POINTER = 7;
+
+/** Error information for JSON patch. */
+typedef struct yyjson_patch_err {
+    /** Error code, see `yyjson_patch_code` for all possible values. */
+    yyjson_patch_code code;
+    /** Index of the error operation (0 if no error). */
+    size_t idx;
+    /** Error message, constant, no need to free (NULL if no error). */
+    const char* msg;
+    /** JSON pointer error if `code == YYJSON_PATCH_ERROR_POINTER`. */
+    yyjson_ptr_err ptr;
+} yyjson_patch_err;
+
+/**
+ Creates and returns a patched JSON value (RFC 6902).
+ The memory of the returned value is allocated by the `doc`.
+ The `err` is used to receive error information, pass NULL if not needed.
+ Returns NULL if the patch could not be applied.
+ */
+yyjson_api yyjson_mut_val* yyjson_patch(yyjson_mut_doc* doc, yyjson_val* orig, yyjson_val* patch,
+    yyjson_patch_err* err);
+
+/**
+ Creates and returns a patched JSON value (RFC 6902).
+ The memory of the returned value is allocated by the `doc`.
+ The `err` is used to receive error information, pass NULL if not needed.
+ Returns NULL if the patch could not be applied.
+ */
+yyjson_api yyjson_mut_val* yyjson_mut_patch(yyjson_mut_doc* doc, yyjson_mut_val* orig,
+    yyjson_mut_val* patch, yyjson_patch_err* err);
+
+/*==============================================================================
+ * JSON Merge-Patch API (RFC 7386)
+ * https://tools.ietf.org/html/rfc7386
+ *============================================================================*/
+
+/**
+ Creates and returns a merge-patched JSON value (RFC 7386).
+ The memory of the returned value is allocated by the `doc`.
+ Returns NULL if the patch could not be applied.
+
+ @warning This function is recursive and may cause a stack overflow if the
+    object level is too deep.
+ */
+yyjson_api yyjson_mut_val* yyjson_merge_patch(yyjson_mut_doc* doc, yyjson_val* orig,
+    yyjson_val* patch);
+
+/**
+ Creates and returns a merge-patched JSON value (RFC 7386).
+ The memory of the returned value is allocated by the `doc`.
+ Returns NULL if the patch could not be applied.
+
+ @warning This function is recursive and may cause a stack overflow if the
+    object level is too deep.
+ */
+yyjson_api yyjson_mut_val* yyjson_mut_merge_patch(yyjson_mut_doc* doc, yyjson_mut_val* orig,
+    yyjson_mut_val* patch);
+
+/*==============================================================================
+ * JSON Structure (Implementation)
+ *============================================================================*/
+
+/** Payload of a JSON value (8 bytes). */
+typedef union yyjson_val_uni {
+    uint64_t u64;
+    int64_t i64;
+    double f64;
+    const char* str;
+    void* ptr;
+    size_t ofs;
+} yyjson_val_uni;
+
+/**
+ Immutable JSON value, 16 bytes.
+ */
+struct yyjson_val {
+    uint64_t tag;       /**< type, subtype and length */
+    yyjson_val_uni uni; /**< payload */
+};
+
+struct yyjson_doc {
+    /** Root value of the document (nonnull). */
+    yyjson_val* root;
+    /** Allocator used by document (nonnull). */
+    yyjson_alc alc;
+    /** The total number of bytes read when parsing JSON (nonzero). */
+    size_t dat_read;
+    /** The total number of value read when parsing JSON (nonzero). */
+    size_t val_read;
+    /** The string pool used by JSON values (nullable). */
+    char* str_pool;
+};
+
+/*==============================================================================
+ * Unsafe JSON Value API (Implementation)
+ *============================================================================*/
+
+/*
+ Whether the string does not need to be escaped for serialization.
+ This function is used to optimize the writing speed of small constant strings.
+ This function works only if the compiler can evaluate it at compile time.
+
+ Clang supports it since v8.0,
+    earlier versions do not support constant_p(strlen) and return false.
+ GCC supports it since at least v4.4,
+    earlier versions may compile it as run-time instructions.
+ ICC supports it since at least v16,
+    earlier versions are uncertain.
+
+ @param str The C string.
+ @param len The returnd value from strlen(str).
+ */
+yyjson_api_inline bool unsafe_yyjson_is_str_noesc(const char* str, size_t len) {
+#if YYJSON_HAS_CONSTANT_P && (!YYJSON_IS_REAL_GCC || yyjson_gcc_available(4, 4, 0))
+    if (yyjson_constant_p(len) && len <= 32) {
+        /*
+         Same as the following loop:
+
+         for (size_t i = 0; i < len; i++) {
+             char c = str[i];
+             if (c < ' ' || c > '~' || c == '"' || c == '\\') return false;
+         }
+
+         GCC evaluates it at compile time only if the string length is within 17
+         and -O3 (which turns on the -fpeel-loops flag) is used.
+         So the loop is unrolled for GCC.
+         */
+#define yyjson_repeat32_incr(x)                                                                    \
+    x(0) x(1) x(2) x(3) x(4) x(5) x(6) x(7) x(8) x(9) x(10) x(11) x(12) x(13) x(14) x(15) x(16)    \
+        x(17) x(18) x(19) x(20) x(21) x(22) x(23) x(24) x(25) x(26) x(27) x(28) x(29) x(30) x(31)
+#define yyjson_check_char_noesc(i)                                                                 \
+    if (i < len) {                                                                                 \
+        char c = str[i];                                                                           \
+        if (c < ' ' || c > '~' || c == '"' || c == '\\')                                           \
+            return false;                                                                          \
+    }
+        yyjson_repeat32_incr(yyjson_check_char_noesc)
+#undef yyjson_repeat32_incr
+#undef yyjson_check_char_noesc
+            return true;
+    }
+#else
+    (void)str;
+    (void)len;
+#endif
+    return false;
+}
+
+yyjson_api_inline yyjson_type unsafe_yyjson_get_type(void* val) {
+    uint8_t tag = (uint8_t)((yyjson_val*)val)->tag;
+    return (yyjson_type)(tag & YYJSON_TYPE_MASK);
+}
+
+yyjson_api_inline yyjson_subtype unsafe_yyjson_get_subtype(void* val) {
+    uint8_t tag = (uint8_t)((yyjson_val*)val)->tag;
+    return (yyjson_subtype)(tag & YYJSON_SUBTYPE_MASK);
+}
+
+yyjson_api_inline uint8_t unsafe_yyjson_get_tag(void* val) {
+    uint8_t tag = (uint8_t)((yyjson_val*)val)->tag;
+    return (uint8_t)(tag & YYJSON_TAG_MASK);
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_raw(void* val) {
+    return unsafe_yyjson_get_type(val) == YYJSON_TYPE_RAW;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_null(void* val) {
+    return unsafe_yyjson_get_type(val) == YYJSON_TYPE_NULL;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_bool(void* val) {
+    return unsafe_yyjson_get_type(val) == YYJSON_TYPE_BOOL;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_num(void* val) {
+    return unsafe_yyjson_get_type(val) == YYJSON_TYPE_NUM;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_str(void* val) {
+    return unsafe_yyjson_get_type(val) == YYJSON_TYPE_STR;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_arr(void* val) {
+    return unsafe_yyjson_get_type(val) == YYJSON_TYPE_ARR;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_obj(void* val) {
+    return unsafe_yyjson_get_type(val) == YYJSON_TYPE_OBJ;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_ctn(void* val) {
+    uint8_t mask = YYJSON_TYPE_ARR & YYJSON_TYPE_OBJ;
+    return (unsafe_yyjson_get_tag(val) & mask) == mask;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_uint(void* val) {
+    const uint8_t patt = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT;
+    return unsafe_yyjson_get_tag(val) == patt;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_sint(void* val) {
+    const uint8_t patt = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT;
+    return unsafe_yyjson_get_tag(val) == patt;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_int(void* val) {
+    const uint8_t mask = YYJSON_TAG_MASK & (~YYJSON_SUBTYPE_SINT);
+    const uint8_t patt = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT;
+    return (unsafe_yyjson_get_tag(val) & mask) == patt;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_real(void* val) {
+    const uint8_t patt = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;
+    return unsafe_yyjson_get_tag(val) == patt;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_true(void* val) {
+    const uint8_t patt = YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_TRUE;
+    return unsafe_yyjson_get_tag(val) == patt;
+}
+
+yyjson_api_inline bool unsafe_yyjson_is_false(void* val) {
+    const uint8_t patt = YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_FALSE;
+    return unsafe_yyjson_get_tag(val) == patt;
+}
+
+yyjson_api_inline bool unsafe_yyjson_arr_is_flat(yyjson_val* val) {
+    size_t ofs = val->uni.ofs;
+    size_t len = (size_t)(val->tag >> YYJSON_TAG_BIT);
+    return len * sizeof(yyjson_val) + sizeof(yyjson_val) == ofs;
+}
+
+yyjson_api_inline const char* unsafe_yyjson_get_raw(void* val) {
+    return ((yyjson_val*)val)->uni.str;
+}
+
+yyjson_api_inline bool unsafe_yyjson_get_bool(void* val) {
+    uint8_t tag = unsafe_yyjson_get_tag(val);
+    return (bool)((tag & YYJSON_SUBTYPE_MASK) >> YYJSON_TYPE_BIT);
+}
+
+yyjson_api_inline uint64_t unsafe_yyjson_get_uint(void* val) {
+    return ((yyjson_val*)val)->uni.u64;
+}
+
+yyjson_api_inline int64_t unsafe_yyjson_get_sint(void* val) {
+    return ((yyjson_val*)val)->uni.i64;
+}
+
+yyjson_api_inline int unsafe_yyjson_get_int(void* val) {
+    return (int)((yyjson_val*)val)->uni.i64;
+}
+
+yyjson_api_inline double unsafe_yyjson_get_real(void* val) {
+    return ((yyjson_val*)val)->uni.f64;
+}
+
+yyjson_api_inline double unsafe_yyjson_get_num(void* val) {
+    uint8_t tag = unsafe_yyjson_get_tag(val);
+    if (tag == (YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL)) {
+        return ((yyjson_val*)val)->uni.f64;
+    } else if (tag == (YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT)) {
+        return (double)((yyjson_val*)val)->uni.i64;
+    } else if (tag == (YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT)) {
+#if YYJSON_U64_TO_F64_NO_IMPL
+        uint64_t msb = ((uint64_t)1) << 63;
+        uint64_t num = ((yyjson_val*)val)->uni.u64;
+        if ((num & msb) == 0) {
+            return (double)(int64_t)num;
+        } else {
+            return ((double)(int64_t)((num >> 1) | (num & 1))) * (double)2.0;
+        }
+#else
+        return (double)((yyjson_val*)val)->uni.u64;
+#endif
+    }
+    return 0.0;
+}
+
+yyjson_api_inline const char* unsafe_yyjson_get_str(void* val) {
+    return ((yyjson_val*)val)->uni.str;
+}
+
+yyjson_api_inline size_t unsafe_yyjson_get_len(void* val) {
+    return (size_t)(((yyjson_val*)val)->tag >> YYJSON_TAG_BIT);
+}
+
+yyjson_api_inline yyjson_val* unsafe_yyjson_get_first(yyjson_val* ctn) {
+    return ctn + 1;
+}
+
+yyjson_api_inline yyjson_val* unsafe_yyjson_get_next(yyjson_val* val) {
+    bool is_ctn = unsafe_yyjson_is_ctn(val);
+    size_t ctn_ofs = val->uni.ofs;
+    size_t ofs = (is_ctn ? ctn_ofs : sizeof(yyjson_val));
+    return (yyjson_val*)(void*)((uint8_t*)val + ofs);
+}
+
+yyjson_api_inline bool unsafe_yyjson_equals_strn(void* val, const char* str, size_t len) {
+    return unsafe_yyjson_get_len(val) == len && memcmp(((yyjson_val*)val)->uni.str, str, len) == 0;
+}
+
+yyjson_api_inline bool unsafe_yyjson_equals_str(void* val, const char* str) {
+    return unsafe_yyjson_equals_strn(val, str, strlen(str));
+}
+
+yyjson_api_inline void unsafe_yyjson_set_type(void* val, yyjson_type type, yyjson_subtype subtype) {
+    uint8_t tag = (type | subtype);
+    uint64_t new_tag = ((yyjson_val*)val)->tag;
+    new_tag = (new_tag & (~(uint64_t)YYJSON_TAG_MASK)) | (uint64_t)tag;
+    ((yyjson_val*)val)->tag = new_tag;
+}
+
+yyjson_api_inline void unsafe_yyjson_set_len(void* val, size_t len) {
+    uint64_t tag = ((yyjson_val*)val)->tag & YYJSON_TAG_MASK;
+    tag |= (uint64_t)len << YYJSON_TAG_BIT;
+    ((yyjson_val*)val)->tag = tag;
+}
+
+yyjson_api_inline void unsafe_yyjson_inc_len(void* val) {
+    uint64_t tag = ((yyjson_val*)val)->tag;
+    tag += (uint64_t)(1 << YYJSON_TAG_BIT);
+    ((yyjson_val*)val)->tag = tag;
+}
+
+yyjson_api_inline void unsafe_yyjson_set_raw(void* val, const char* raw, size_t len) {
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_RAW, YYJSON_SUBTYPE_NONE);
+    unsafe_yyjson_set_len(val, len);
+    ((yyjson_val*)val)->uni.str = raw;
+}
+
+yyjson_api_inline void unsafe_yyjson_set_null(void* val) {
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_NULL, YYJSON_SUBTYPE_NONE);
+    unsafe_yyjson_set_len(val, 0);
+}
+
+yyjson_api_inline void unsafe_yyjson_set_bool(void* val, bool num) {
+    yyjson_subtype subtype = num ? YYJSON_SUBTYPE_TRUE : YYJSON_SUBTYPE_FALSE;
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_BOOL, subtype);
+    unsafe_yyjson_set_len(val, 0);
+}
+
+yyjson_api_inline void unsafe_yyjson_set_uint(void* val, uint64_t num) {
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_NUM, YYJSON_SUBTYPE_UINT);
+    unsafe_yyjson_set_len(val, 0);
+    ((yyjson_val*)val)->uni.u64 = num;
+}
+
+yyjson_api_inline void unsafe_yyjson_set_sint(void* val, int64_t num) {
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_NUM, YYJSON_SUBTYPE_SINT);
+    unsafe_yyjson_set_len(val, 0);
+    ((yyjson_val*)val)->uni.i64 = num;
+}
+
+yyjson_api_inline void unsafe_yyjson_set_real(void* val, double num) {
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_NUM, YYJSON_SUBTYPE_REAL);
+    unsafe_yyjson_set_len(val, 0);
+    ((yyjson_val*)val)->uni.f64 = num;
+}
+
+yyjson_api_inline void unsafe_yyjson_set_str(void* val, const char* str) {
+    size_t len = strlen(str);
+    bool noesc = unsafe_yyjson_is_str_noesc(str, len);
+    yyjson_subtype sub = noesc ? YYJSON_SUBTYPE_NOESC : YYJSON_SUBTYPE_NONE;
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_STR, sub);
+    unsafe_yyjson_set_len(val, len);
+    ((yyjson_val*)val)->uni.str = str;
+}
+
+yyjson_api_inline void unsafe_yyjson_set_strn(void* val, const char* str, size_t len) {
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_STR, YYJSON_SUBTYPE_NONE);
+    unsafe_yyjson_set_len(val, len);
+    ((yyjson_val*)val)->uni.str = str;
+}
+
+yyjson_api_inline void unsafe_yyjson_set_arr(void* val, size_t size) {
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_ARR, YYJSON_SUBTYPE_NONE);
+    unsafe_yyjson_set_len(val, size);
+}
+
+yyjson_api_inline void unsafe_yyjson_set_obj(void* val, size_t size) {
+    unsafe_yyjson_set_type(val, YYJSON_TYPE_OBJ, YYJSON_SUBTYPE_NONE);
+    unsafe_yyjson_set_len(val, size);
+}
+
+/*==============================================================================
+ * JSON Document API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline yyjson_val* yyjson_doc_get_root(yyjson_doc* doc) {
+    return doc ? doc->root : NULL;
+}
+
+yyjson_api_inline size_t yyjson_doc_get_read_size(yyjson_doc* doc) {
+    return doc ? doc->dat_read : 0;
+}
+
+yyjson_api_inline size_t yyjson_doc_get_val_count(yyjson_doc* doc) {
+    return doc ? doc->val_read : 0;
+}
+
+yyjson_api_inline void yyjson_doc_free(yyjson_doc* doc) {
+    if (doc) {
+        yyjson_alc alc = doc->alc;
+        memset(&doc->alc, 0, sizeof(alc));
+        if (doc->str_pool)
+            alc.free(alc.ctx, doc->str_pool);
+        alc.free(alc.ctx, doc);
+    }
+}
+
+/*==============================================================================
+ * JSON Value Type API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline bool yyjson_is_raw(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_raw(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_null(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_null(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_true(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_true(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_false(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_false(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_bool(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_bool(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_uint(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_uint(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_sint(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_sint(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_int(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_int(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_real(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_real(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_num(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_num(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_str(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_str(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_arr(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_arr(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_obj(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_obj(val) : false;
+}
+
+yyjson_api_inline bool yyjson_is_ctn(yyjson_val* val) {
+    return val ? unsafe_yyjson_is_ctn(val) : false;
+}
+
+/*==============================================================================
+ * JSON Value Content API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline yyjson_type yyjson_get_type(yyjson_val* val) {
+    return val ? unsafe_yyjson_get_type(val) : YYJSON_TYPE_NONE;
+}
+
+yyjson_api_inline yyjson_subtype yyjson_get_subtype(yyjson_val* val) {
+    return val ? unsafe_yyjson_get_subtype(val) : YYJSON_SUBTYPE_NONE;
+}
+
+yyjson_api_inline uint8_t yyjson_get_tag(yyjson_val* val) {
+    return val ? unsafe_yyjson_get_tag(val) : 0;
+}
+
+yyjson_api_inline const char* yyjson_get_type_desc(yyjson_val* val) {
+    switch (yyjson_get_tag(val)) {
+    case YYJSON_TYPE_RAW | YYJSON_SUBTYPE_NONE:
+        return "raw";
+    case YYJSON_TYPE_NULL | YYJSON_SUBTYPE_NONE:
+        return "null";
+    case YYJSON_TYPE_STR | YYJSON_SUBTYPE_NONE:
+        return "string";
+    case YYJSON_TYPE_STR | YYJSON_SUBTYPE_NOESC:
+        return "string";
+    case YYJSON_TYPE_ARR | YYJSON_SUBTYPE_NONE:
+        return "array";
+    case YYJSON_TYPE_OBJ | YYJSON_SUBTYPE_NONE:
+        return "object";
+    case YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_TRUE:
+        return "true";
+    case YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_FALSE:
+        return "false";
+    case YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT:
+        return "uint";
+    case YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT:
+        return "sint";
+    case YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL:
+        return "real";
+    default:
+        return "unknown";
+    }
+}
+
+yyjson_api_inline const char* yyjson_get_raw(yyjson_val* val) {
+    return yyjson_is_raw(val) ? unsafe_yyjson_get_raw(val) : NULL;
+}
+
+yyjson_api_inline bool yyjson_get_bool(yyjson_val* val) {
+    return yyjson_is_bool(val) ? unsafe_yyjson_get_bool(val) : false;
+}
+
+yyjson_api_inline uint64_t yyjson_get_uint(yyjson_val* val) {
+    return yyjson_is_int(val) ? unsafe_yyjson_get_uint(val) : 0;
+}
+
+yyjson_api_inline int64_t yyjson_get_sint(yyjson_val* val) {
+    return yyjson_is_int(val) ? unsafe_yyjson_get_sint(val) : 0;
+}
+
+yyjson_api_inline int yyjson_get_int(yyjson_val* val) {
+    return yyjson_is_int(val) ? unsafe_yyjson_get_int(val) : 0;
+}
+
+yyjson_api_inline double yyjson_get_real(yyjson_val* val) {
+    return yyjson_is_real(val) ? unsafe_yyjson_get_real(val) : 0.0;
+}
+
+yyjson_api_inline double yyjson_get_num(yyjson_val* val) {
+    return val ? unsafe_yyjson_get_num(val) : 0.0;
+}
+
+yyjson_api_inline const char* yyjson_get_str(yyjson_val* val) {
+    return yyjson_is_str(val) ? unsafe_yyjson_get_str(val) : NULL;
+}
+
+yyjson_api_inline size_t yyjson_get_len(yyjson_val* val) {
+    return val ? unsafe_yyjson_get_len(val) : 0;
+}
+
+yyjson_api_inline bool yyjson_equals_str(yyjson_val* val, const char* str) {
+    if (yyjson_likely(val && str)) {
+        return unsafe_yyjson_is_str(val) && unsafe_yyjson_equals_str(val, str);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_equals_strn(yyjson_val* val, const char* str, size_t len) {
+    if (yyjson_likely(val && str)) {
+        return unsafe_yyjson_is_str(val) && unsafe_yyjson_equals_strn(val, str, len);
+    }
+    return false;
+}
+
+yyjson_api bool unsafe_yyjson_equals(yyjson_val* lhs, yyjson_val* rhs);
+
+yyjson_api_inline bool yyjson_equals(yyjson_val* lhs, yyjson_val* rhs) {
+    if (yyjson_unlikely(!lhs || !rhs))
+        return false;
+    return unsafe_yyjson_equals(lhs, rhs);
+}
+
+yyjson_api_inline bool yyjson_set_raw(yyjson_val* val, const char* raw, size_t len) {
+    if (yyjson_unlikely(!val || unsafe_yyjson_is_ctn(val)))
+        return false;
+    unsafe_yyjson_set_raw(val, raw, len);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_set_null(yyjson_val* val) {
+    if (yyjson_unlikely(!val || unsafe_yyjson_is_ctn(val)))
+        return false;
+    unsafe_yyjson_set_null(val);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_set_bool(yyjson_val* val, bool num) {
+    if (yyjson_unlikely(!val || unsafe_yyjson_is_ctn(val)))
+        return false;
+    unsafe_yyjson_set_bool(val, num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_set_uint(yyjson_val* val, uint64_t num) {
+    if (yyjson_unlikely(!val || unsafe_yyjson_is_ctn(val)))
+        return false;
+    unsafe_yyjson_set_uint(val, num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_set_sint(yyjson_val* val, int64_t num) {
+    if (yyjson_unlikely(!val || unsafe_yyjson_is_ctn(val)))
+        return false;
+    unsafe_yyjson_set_sint(val, num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_set_int(yyjson_val* val, int num) {
+    if (yyjson_unlikely(!val || unsafe_yyjson_is_ctn(val)))
+        return false;
+    unsafe_yyjson_set_sint(val, (int64_t)num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_set_real(yyjson_val* val, double num) {
+    if (yyjson_unlikely(!val || unsafe_yyjson_is_ctn(val)))
+        return false;
+    unsafe_yyjson_set_real(val, num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_set_str(yyjson_val* val, const char* str) {
+    if (yyjson_unlikely(!val || unsafe_yyjson_is_ctn(val)))
+        return false;
+    if (yyjson_unlikely(!str))
+        return false;
+    unsafe_yyjson_set_str(val, str);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_set_strn(yyjson_val* val, const char* str, size_t len) {
+    if (yyjson_unlikely(!val || unsafe_yyjson_is_ctn(val)))
+        return false;
+    if (yyjson_unlikely(!str))
+        return false;
+    unsafe_yyjson_set_strn(val, str, len);
+    return true;
+}
+
+/*==============================================================================
+ * JSON Array API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline size_t yyjson_arr_size(yyjson_val* arr) {
+    return yyjson_is_arr(arr) ? unsafe_yyjson_get_len(arr) : 0;
+}
+
+yyjson_api_inline yyjson_val* yyjson_arr_get(yyjson_val* arr, size_t idx) {
+    if (yyjson_likely(yyjson_is_arr(arr))) {
+        if (yyjson_likely(unsafe_yyjson_get_len(arr) > idx)) {
+            yyjson_val* val = unsafe_yyjson_get_first(arr);
+            if (unsafe_yyjson_arr_is_flat(arr)) {
+                return val + idx;
+            } else {
+                while (idx-- > 0)
+                    val = unsafe_yyjson_get_next(val);
+                return val;
+            }
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_val* yyjson_arr_get_first(yyjson_val* arr) {
+    if (yyjson_likely(yyjson_is_arr(arr))) {
+        if (yyjson_likely(unsafe_yyjson_get_len(arr) > 0)) {
+            return unsafe_yyjson_get_first(arr);
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_val* yyjson_arr_get_last(yyjson_val* arr) {
+    if (yyjson_likely(yyjson_is_arr(arr))) {
+        size_t len = unsafe_yyjson_get_len(arr);
+        if (yyjson_likely(len > 0)) {
+            yyjson_val* val = unsafe_yyjson_get_first(arr);
+            if (unsafe_yyjson_arr_is_flat(arr)) {
+                return val + (len - 1);
+            } else {
+                while (len-- > 1)
+                    val = unsafe_yyjson_get_next(val);
+                return val;
+            }
+        }
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * JSON Array Iterator API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline bool yyjson_arr_iter_init(yyjson_val* arr, yyjson_arr_iter* iter) {
+    if (yyjson_likely(yyjson_is_arr(arr) && iter)) {
+        iter->idx = 0;
+        iter->max = unsafe_yyjson_get_len(arr);
+        iter->cur = unsafe_yyjson_get_first(arr);
+        return true;
+    }
+    if (iter)
+        memset(iter, 0, sizeof(yyjson_arr_iter));
+    return false;
+}
+
+yyjson_api_inline yyjson_arr_iter yyjson_arr_iter_with(yyjson_val* arr) {
+    yyjson_arr_iter iter;
+    yyjson_arr_iter_init(arr, &iter);
+    return iter;
+}
+
+yyjson_api_inline bool yyjson_arr_iter_has_next(yyjson_arr_iter* iter) {
+    return iter ? iter->idx < iter->max : false;
+}
+
+yyjson_api_inline yyjson_val* yyjson_arr_iter_next(yyjson_arr_iter* iter) {
+    yyjson_val* val;
+    if (iter && iter->idx < iter->max) {
+        val = iter->cur;
+        iter->cur = unsafe_yyjson_get_next(val);
+        iter->idx++;
+        return val;
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * JSON Object API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline size_t yyjson_obj_size(yyjson_val* obj) {
+    return yyjson_is_obj(obj) ? unsafe_yyjson_get_len(obj) : 0;
+}
+
+yyjson_api_inline yyjson_val* yyjson_obj_get(yyjson_val* obj, const char* key) {
+    return yyjson_obj_getn(obj, key, key ? strlen(key) : 0);
+}
+
+yyjson_api_inline yyjson_val* yyjson_obj_getn(yyjson_val* obj, const char* _key, size_t key_len) {
+    if (yyjson_likely(yyjson_is_obj(obj) && _key)) {
+        size_t len = unsafe_yyjson_get_len(obj);
+        yyjson_val* key = unsafe_yyjson_get_first(obj);
+        while (len-- > 0) {
+            if (unsafe_yyjson_equals_strn(key, _key, key_len))
+                return key + 1;
+            key = unsafe_yyjson_get_next(key + 1);
+        }
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * JSON Object Iterator API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline bool yyjson_obj_iter_init(yyjson_val* obj, yyjson_obj_iter* iter) {
+    if (yyjson_likely(yyjson_is_obj(obj) && iter)) {
+        iter->idx = 0;
+        iter->max = unsafe_yyjson_get_len(obj);
+        iter->cur = unsafe_yyjson_get_first(obj);
+        iter->obj = obj;
+        return true;
+    }
+    if (iter)
+        memset(iter, 0, sizeof(yyjson_obj_iter));
+    return false;
+}
+
+yyjson_api_inline yyjson_obj_iter yyjson_obj_iter_with(yyjson_val* obj) {
+    yyjson_obj_iter iter;
+    yyjson_obj_iter_init(obj, &iter);
+    return iter;
+}
+
+yyjson_api_inline bool yyjson_obj_iter_has_next(yyjson_obj_iter* iter) {
+    return iter ? iter->idx < iter->max : false;
+}
+
+yyjson_api_inline yyjson_val* yyjson_obj_iter_next(yyjson_obj_iter* iter) {
+    if (iter && iter->idx < iter->max) {
+        yyjson_val* key = iter->cur;
+        iter->idx++;
+        iter->cur = unsafe_yyjson_get_next(key + 1);
+        return key;
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_val* yyjson_obj_iter_get_val(yyjson_val* key) {
+    return key ? key + 1 : NULL;
+}
+
+yyjson_api_inline yyjson_val* yyjson_obj_iter_get(yyjson_obj_iter* iter, const char* key) {
+    return yyjson_obj_iter_getn(iter, key, key ? strlen(key) : 0);
+}
+
+yyjson_api_inline yyjson_val* yyjson_obj_iter_getn(yyjson_obj_iter* iter, const char* key,
+    size_t key_len) {
+    if (iter && key) {
+        size_t idx = iter->idx;
+        size_t max = iter->max;
+        yyjson_val* cur = iter->cur;
+        if (yyjson_unlikely(idx == max)) {
+            idx = 0;
+            cur = unsafe_yyjson_get_first(iter->obj);
+        }
+        while (idx++ < max) {
+            yyjson_val* next = unsafe_yyjson_get_next(cur + 1);
+            if (unsafe_yyjson_equals_strn(cur, key, key_len)) {
+                iter->idx = idx;
+                iter->cur = next;
+                return cur + 1;
+            }
+            cur = next;
+            if (idx == iter->max && iter->idx < iter->max) {
+                idx = 0;
+                max = iter->idx;
+                cur = unsafe_yyjson_get_first(iter->obj);
+            }
+        }
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * Mutable JSON Structure (Implementation)
+ *============================================================================*/
+
+/**
+ Mutable JSON value, 24 bytes.
+ The 'tag' and 'uni' field is same as immutable value.
+ The 'next' field links all elements inside the container to be a cycle.
+ */
+struct yyjson_mut_val {
+    uint64_t tag;         /**< type, subtype and length */
+    yyjson_val_uni uni;   /**< payload */
+    yyjson_mut_val* next; /**< the next value in circular linked list */
+};
+
+/**
+ A memory chunk in string memory pool.
+ */
+typedef struct yyjson_str_chunk {
+    struct yyjson_str_chunk* next; /* next chunk linked list */
+    size_t chunk_size;             /* chunk size in bytes */
+    /* char str[]; flexible array member */
+} yyjson_str_chunk;
+
+/**
+ A memory pool to hold all strings in a mutable document.
+ */
+typedef struct yyjson_str_pool {
+    char* cur;                /* cursor inside current chunk */
+    char* end;                /* the end of current chunk */
+    size_t chunk_size;        /* chunk size in bytes while creating new chunk */
+    size_t chunk_size_max;    /* maximum chunk size in bytes */
+    yyjson_str_chunk* chunks; /* a linked list of chunks, nullable */
+} yyjson_str_pool;
+
+/**
+ A memory chunk in value memory pool.
+ `sizeof(yyjson_val_chunk)` should not larger than `sizeof(yyjson_mut_val)`.
+ */
+typedef struct yyjson_val_chunk {
+    struct yyjson_val_chunk* next; /* next chunk linked list */
+    size_t chunk_size;             /* chunk size in bytes */
+    /* char pad[sizeof(yyjson_mut_val) - sizeof(yyjson_val_chunk)]; padding */
+    /* yyjson_mut_val vals[]; flexible array member */
+} yyjson_val_chunk;
+
+/**
+ A memory pool to hold all values in a mutable document.
+ */
+typedef struct yyjson_val_pool {
+    yyjson_mut_val* cur;      /* cursor inside current chunk */
+    yyjson_mut_val* end;      /* the end of current chunk */
+    size_t chunk_size;        /* chunk size in bytes while creating new chunk */
+    size_t chunk_size_max;    /* maximum chunk size in bytes */
+    yyjson_val_chunk* chunks; /* a linked list of chunks, nullable */
+} yyjson_val_pool;
+
+struct yyjson_mut_doc {
+    yyjson_mut_val* root;     /**< root value of the JSON document, nullable */
+    yyjson_alc alc;           /**< a valid allocator, nonnull */
+    yyjson_str_pool str_pool; /**< string memory pool */
+    yyjson_val_pool val_pool; /**< value memory pool */
+};
+
+/* Ensures the capacity to at least equal to the specified byte length. */
+yyjson_api bool unsafe_yyjson_str_pool_grow(yyjson_str_pool* pool, const yyjson_alc* alc,
+    size_t len);
+
+/* Ensures the capacity to at least equal to the specified value count. */
+yyjson_api bool unsafe_yyjson_val_pool_grow(yyjson_val_pool* pool, const yyjson_alc* alc,
+    size_t count);
+
+/* Allocate memory for string. */
+yyjson_api_inline char* unsafe_yyjson_mut_str_alc(yyjson_mut_doc* doc, size_t len) {
+    char* mem;
+    const yyjson_alc* alc = &doc->alc;
+    yyjson_str_pool* pool = &doc->str_pool;
+    if (yyjson_unlikely((size_t)(pool->end - pool->cur) <= len)) {
+        if (yyjson_unlikely(!unsafe_yyjson_str_pool_grow(pool, alc, len + 1))) {
+            return NULL;
+        }
+    }
+    mem = pool->cur;
+    pool->cur = mem + len + 1;
+    return mem;
+}
+
+yyjson_api_inline char* unsafe_yyjson_mut_strncpy(yyjson_mut_doc* doc, const char* str,
+    size_t len) {
+    char* mem = unsafe_yyjson_mut_str_alc(doc, len);
+    if (yyjson_unlikely(!mem))
+        return NULL;
+    memcpy((void*)mem, (const void*)str, len);
+    mem[len] = '\0';
+    return mem;
+}
+
+yyjson_api_inline yyjson_mut_val* unsafe_yyjson_mut_val(yyjson_mut_doc* doc, size_t count) {
+    yyjson_mut_val* val;
+    yyjson_alc* alc = &doc->alc;
+    yyjson_val_pool* pool = &doc->val_pool;
+    if (yyjson_unlikely((size_t)(pool->end - pool->cur) < count)) {
+        if (yyjson_unlikely(!unsafe_yyjson_val_pool_grow(pool, alc, count))) {
+            return NULL;
+        }
+    }
+    val = pool->cur;
+    pool->cur += count;
+    return val;
+}
+
+/*==============================================================================
+ * Mutable JSON Document API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_get_root(yyjson_mut_doc* doc) {
+    return doc ? doc->root : NULL;
+}
+
+yyjson_api_inline void yyjson_mut_doc_set_root(yyjson_mut_doc* doc, yyjson_mut_val* root) {
+    if (doc)
+        doc->root = root;
+}
+
+/*==============================================================================
+ * Mutable JSON Value Type API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline bool yyjson_mut_is_raw(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_raw(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_null(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_null(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_true(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_true(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_false(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_false(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_bool(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_bool(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_uint(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_uint(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_sint(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_sint(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_int(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_int(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_real(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_real(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_num(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_num(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_str(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_str(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_arr(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_arr(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_obj(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_obj(val) : false;
+}
+
+yyjson_api_inline bool yyjson_mut_is_ctn(yyjson_mut_val* val) {
+    return val ? unsafe_yyjson_is_ctn(val) : false;
+}
+
+/*==============================================================================
+ * Mutable JSON Value Content API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline yyjson_type yyjson_mut_get_type(yyjson_mut_val* val) {
+    return yyjson_get_type((yyjson_val*)val);
+}
+
+yyjson_api_inline yyjson_subtype yyjson_mut_get_subtype(yyjson_mut_val* val) {
+    return yyjson_get_subtype((yyjson_val*)val);
+}
+
+yyjson_api_inline uint8_t yyjson_mut_get_tag(yyjson_mut_val* val) {
+    return yyjson_get_tag((yyjson_val*)val);
+}
+
+yyjson_api_inline const char* yyjson_mut_get_type_desc(yyjson_mut_val* val) {
+    return yyjson_get_type_desc((yyjson_val*)val);
+}
+
+yyjson_api_inline const char* yyjson_mut_get_raw(yyjson_mut_val* val) {
+    return yyjson_get_raw((yyjson_val*)val);
+}
+
+yyjson_api_inline bool yyjson_mut_get_bool(yyjson_mut_val* val) {
+    return yyjson_get_bool((yyjson_val*)val);
+}
+
+yyjson_api_inline uint64_t yyjson_mut_get_uint(yyjson_mut_val* val) {
+    return yyjson_get_uint((yyjson_val*)val);
+}
+
+yyjson_api_inline int64_t yyjson_mut_get_sint(yyjson_mut_val* val) {
+    return yyjson_get_sint((yyjson_val*)val);
+}
+
+yyjson_api_inline int yyjson_mut_get_int(yyjson_mut_val* val) {
+    return yyjson_get_int((yyjson_val*)val);
+}
+
+yyjson_api_inline double yyjson_mut_get_real(yyjson_mut_val* val) {
+    return yyjson_get_real((yyjson_val*)val);
+}
+
+yyjson_api_inline double yyjson_mut_get_num(yyjson_mut_val* val) {
+    return yyjson_get_num((yyjson_val*)val);
+}
+
+yyjson_api_inline const char* yyjson_mut_get_str(yyjson_mut_val* val) {
+    return yyjson_get_str((yyjson_val*)val);
+}
+
+yyjson_api_inline size_t yyjson_mut_get_len(yyjson_mut_val* val) {
+    return yyjson_get_len((yyjson_val*)val);
+}
+
+yyjson_api_inline bool yyjson_mut_equals_str(yyjson_mut_val* val, const char* str) {
+    return yyjson_equals_str((yyjson_val*)val, str);
+}
+
+yyjson_api_inline bool yyjson_mut_equals_strn(yyjson_mut_val* val, const char* str, size_t len) {
+    return yyjson_equals_strn((yyjson_val*)val, str, len);
+}
+
+yyjson_api bool unsafe_yyjson_mut_equals(yyjson_mut_val* lhs, yyjson_mut_val* rhs);
+
+yyjson_api_inline bool yyjson_mut_equals(yyjson_mut_val* lhs, yyjson_mut_val* rhs) {
+    if (yyjson_unlikely(!lhs || !rhs))
+        return false;
+    return unsafe_yyjson_mut_equals(lhs, rhs);
+}
+
+yyjson_api_inline bool yyjson_mut_set_raw(yyjson_mut_val* val, const char* raw, size_t len) {
+    if (yyjson_unlikely(!val || !raw))
+        return false;
+    unsafe_yyjson_set_raw(val, raw, len);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_null(yyjson_mut_val* val) {
+    if (yyjson_unlikely(!val))
+        return false;
+    unsafe_yyjson_set_null(val);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_bool(yyjson_mut_val* val, bool num) {
+    if (yyjson_unlikely(!val))
+        return false;
+    unsafe_yyjson_set_bool(val, num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_uint(yyjson_mut_val* val, uint64_t num) {
+    if (yyjson_unlikely(!val))
+        return false;
+    unsafe_yyjson_set_uint(val, num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_sint(yyjson_mut_val* val, int64_t num) {
+    if (yyjson_unlikely(!val))
+        return false;
+    unsafe_yyjson_set_sint(val, num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_int(yyjson_mut_val* val, int num) {
+    if (yyjson_unlikely(!val))
+        return false;
+    unsafe_yyjson_set_sint(val, (int64_t)num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_real(yyjson_mut_val* val, double num) {
+    if (yyjson_unlikely(!val))
+        return false;
+    unsafe_yyjson_set_real(val, num);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_str(yyjson_mut_val* val, const char* str) {
+    if (yyjson_unlikely(!val || !str))
+        return false;
+    unsafe_yyjson_set_str(val, str);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_strn(yyjson_mut_val* val, const char* str, size_t len) {
+    if (yyjson_unlikely(!val || !str))
+        return false;
+    unsafe_yyjson_set_strn(val, str, len);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_arr(yyjson_mut_val* val) {
+    if (yyjson_unlikely(!val))
+        return false;
+    unsafe_yyjson_set_arr(val, 0);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_set_obj(yyjson_mut_val* val) {
+    if (yyjson_unlikely(!val))
+        return false;
+    unsafe_yyjson_set_obj(val, 0);
+    return true;
+}
+
+/*==============================================================================
+ * Mutable JSON Value Creation API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_raw(yyjson_mut_doc* doc, const char* str) {
+    if (yyjson_likely(str))
+        return yyjson_mut_rawn(doc, str, strlen(str));
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_rawn(yyjson_mut_doc* doc, const char* str,
+    size_t len) {
+    if (yyjson_likely(doc && str)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = ((uint64_t)len << YYJSON_TAG_BIT) | YYJSON_TYPE_RAW;
+            val->uni.str = str;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_rawcpy(yyjson_mut_doc* doc, const char* str) {
+    if (yyjson_likely(str))
+        return yyjson_mut_rawncpy(doc, str, strlen(str));
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_rawncpy(yyjson_mut_doc* doc, const char* str,
+    size_t len) {
+    if (yyjson_likely(doc && str)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        char* new_str = unsafe_yyjson_mut_strncpy(doc, str, len);
+        if (yyjson_likely(val && new_str)) {
+            val->tag = ((uint64_t)len << YYJSON_TAG_BIT) | YYJSON_TYPE_RAW;
+            val->uni.str = new_str;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_null(yyjson_mut_doc* doc) {
+    if (yyjson_likely(doc)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = YYJSON_TYPE_NULL | YYJSON_SUBTYPE_NONE;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_true(yyjson_mut_doc* doc) {
+    if (yyjson_likely(doc)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_TRUE;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_false(yyjson_mut_doc* doc) {
+    if (yyjson_likely(doc)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_FALSE;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_bool(yyjson_mut_doc* doc, bool _val) {
+    if (yyjson_likely(doc)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            _val = !!_val;
+            val->tag = YYJSON_TYPE_BOOL | (uint8_t)((uint8_t)_val << 3);
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_uint(yyjson_mut_doc* doc, uint64_t num) {
+    if (yyjson_likely(doc)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT;
+            val->uni.u64 = num;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_sint(yyjson_mut_doc* doc, int64_t num) {
+    if (yyjson_likely(doc)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT;
+            val->uni.i64 = num;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_int(yyjson_mut_doc* doc, int64_t num) {
+    return yyjson_mut_sint(doc, num);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_real(yyjson_mut_doc* doc, double num) {
+    if (yyjson_likely(doc)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;
+            val->uni.f64 = num;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_str(yyjson_mut_doc* doc, const char* str) {
+    if (yyjson_likely(doc && str)) {
+        size_t len = strlen(str);
+        bool noesc = unsafe_yyjson_is_str_noesc(str, len);
+        yyjson_subtype sub = noesc ? YYJSON_SUBTYPE_NOESC : YYJSON_SUBTYPE_NONE;
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = ((uint64_t)len << YYJSON_TAG_BIT) | (uint64_t)(YYJSON_TYPE_STR | sub);
+            val->uni.str = str;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_strn(yyjson_mut_doc* doc, const char* str,
+    size_t len) {
+    if (yyjson_likely(doc && str)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = ((uint64_t)len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+            val->uni.str = str;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_strcpy(yyjson_mut_doc* doc, const char* str) {
+    if (yyjson_likely(doc && str)) {
+        size_t len = strlen(str);
+        bool noesc = unsafe_yyjson_is_str_noesc(str, len);
+        yyjson_subtype sub = noesc ? YYJSON_SUBTYPE_NOESC : YYJSON_SUBTYPE_NONE;
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        char* new_str = unsafe_yyjson_mut_strncpy(doc, str, len);
+        if (yyjson_likely(val && new_str)) {
+            val->tag = ((uint64_t)len << YYJSON_TAG_BIT) | (uint64_t)(YYJSON_TYPE_STR | sub);
+            val->uni.str = new_str;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_strncpy(yyjson_mut_doc* doc, const char* str,
+    size_t len) {
+    if (yyjson_likely(doc && str)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        char* new_str = unsafe_yyjson_mut_strncpy(doc, str, len);
+        if (yyjson_likely(val && new_str)) {
+            val->tag = ((uint64_t)len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+            val->uni.str = new_str;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * Mutable JSON Array API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline size_t yyjson_mut_arr_size(yyjson_mut_val* arr) {
+    return yyjson_mut_is_arr(arr) ? unsafe_yyjson_get_len(arr) : 0;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_get(yyjson_mut_val* arr, size_t idx) {
+    if (yyjson_likely(idx < yyjson_mut_arr_size(arr))) {
+        yyjson_mut_val* val = (yyjson_mut_val*)arr->uni.ptr;
+        while (idx-- > 0)
+            val = val->next;
+        return val->next;
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_get_first(yyjson_mut_val* arr) {
+    if (yyjson_likely(yyjson_mut_arr_size(arr) > 0)) {
+        return ((yyjson_mut_val*)arr->uni.ptr)->next;
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_get_last(yyjson_mut_val* arr) {
+    if (yyjson_likely(yyjson_mut_arr_size(arr) > 0)) {
+        return ((yyjson_mut_val*)arr->uni.ptr);
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * Mutable JSON Array Iterator API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline bool yyjson_mut_arr_iter_init(yyjson_mut_val* arr, yyjson_mut_arr_iter* iter) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr) && iter)) {
+        iter->idx = 0;
+        iter->max = unsafe_yyjson_get_len(arr);
+        iter->cur = iter->max ? (yyjson_mut_val*)arr->uni.ptr : NULL;
+        iter->pre = NULL;
+        iter->arr = arr;
+        return true;
+    }
+    if (iter)
+        memset(iter, 0, sizeof(yyjson_mut_arr_iter));
+    return false;
+}
+
+yyjson_api_inline yyjson_mut_arr_iter yyjson_mut_arr_iter_with(yyjson_mut_val* arr) {
+    yyjson_mut_arr_iter iter;
+    yyjson_mut_arr_iter_init(arr, &iter);
+    return iter;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_iter_has_next(yyjson_mut_arr_iter* iter) {
+    return iter ? iter->idx < iter->max : false;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_iter_next(yyjson_mut_arr_iter* iter) {
+    if (iter && iter->idx < iter->max) {
+        yyjson_mut_val* val = iter->cur;
+        iter->pre = val;
+        iter->cur = val->next;
+        iter->idx++;
+        return iter->cur;
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_iter_remove(yyjson_mut_arr_iter* iter) {
+    if (yyjson_likely(iter && 0 < iter->idx && iter->idx <= iter->max)) {
+        yyjson_mut_val* prev = iter->pre;
+        yyjson_mut_val* cur = iter->cur;
+        yyjson_mut_val* next = cur->next;
+        if (yyjson_unlikely(iter->idx == iter->max))
+            iter->arr->uni.ptr = prev;
+        iter->idx--;
+        iter->max--;
+        unsafe_yyjson_set_len(iter->arr, iter->max);
+        prev->next = next;
+        iter->cur = next;
+        return cur;
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * Mutable JSON Array Creation API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr(yyjson_mut_doc* doc) {
+    if (yyjson_likely(doc)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = YYJSON_TYPE_ARR | YYJSON_SUBTYPE_NONE;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+#define yyjson_mut_arr_with_func(func)                                                             \
+    if (yyjson_likely(                                                                             \
+            doc && ((0 < count && count < (~(size_t)0) / sizeof(yyjson_mut_val) && vals) ||        \
+                       count == 0))) {                                                             \
+        yyjson_mut_val* arr = unsafe_yyjson_mut_val(doc, 1 + count);                               \
+        if (yyjson_likely(arr)) {                                                                  \
+            arr->tag = ((uint64_t)count << YYJSON_TAG_BIT) | YYJSON_TYPE_ARR;                      \
+            if (count > 0) {                                                                       \
+                size_t i;                                                                          \
+                for (i = 0; i < count; i++) {                                                      \
+                    yyjson_mut_val* val = arr + i + 1;                                             \
+                    func val->next = val + 1;                                                      \
+                }                                                                                  \
+                arr[count].next = arr + 1;                                                         \
+                arr->uni.ptr = arr + count;                                                        \
+            }                                                                                      \
+            return arr;                                                                            \
+        }                                                                                          \
+    }                                                                                              \
+    return NULL
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_bool(yyjson_mut_doc* doc, const bool* vals,
+    size_t count) {
+    yyjson_mut_arr_with_func({
+        bool _val = !!vals[i];
+        val->tag = YYJSON_TYPE_BOOL | (uint8_t)((uint8_t)_val << 3);
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint(yyjson_mut_doc* doc, const int64_t* vals,
+    size_t count) {
+    return yyjson_mut_arr_with_sint64(doc, vals, count);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint(yyjson_mut_doc* doc,
+    const uint64_t* vals, size_t count) {
+    return yyjson_mut_arr_with_uint64(doc, vals, count);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_real(yyjson_mut_doc* doc, const double* vals,
+    size_t count) {
+    return yyjson_mut_arr_with_double(doc, vals, count);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint8(yyjson_mut_doc* doc, const int8_t* vals,
+    size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT;
+        val->uni.i64 = (int64_t)vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint16(yyjson_mut_doc* doc,
+    const int16_t* vals, size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT;
+        val->uni.i64 = vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint32(yyjson_mut_doc* doc,
+    const int32_t* vals, size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT;
+        val->uni.i64 = vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_sint64(yyjson_mut_doc* doc,
+    const int64_t* vals, size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT;
+        val->uni.i64 = vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint8(yyjson_mut_doc* doc,
+    const uint8_t* vals, size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT;
+        val->uni.u64 = vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint16(yyjson_mut_doc* doc,
+    const uint16_t* vals, size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT;
+        val->uni.u64 = vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint32(yyjson_mut_doc* doc,
+    const uint32_t* vals, size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT;
+        val->uni.u64 = vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_uint64(yyjson_mut_doc* doc,
+    const uint64_t* vals, size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT;
+        val->uni.u64 = vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_float(yyjson_mut_doc* doc, const float* vals,
+    size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;
+        val->uni.f64 = (double)vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_double(yyjson_mut_doc* doc,
+    const double* vals, size_t count) {
+    yyjson_mut_arr_with_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;
+        val->uni.f64 = vals[i];
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_str(yyjson_mut_doc* doc, const char** vals,
+    size_t count) {
+    yyjson_mut_arr_with_func({
+        uint64_t len = (uint64_t)strlen(vals[i]);
+        val->tag = (len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+        val->uni.str = vals[i];
+        if (yyjson_unlikely(!val->uni.str))
+            return NULL;
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_strn(yyjson_mut_doc* doc, const char** vals,
+    const size_t* lens, size_t count) {
+    if (yyjson_unlikely(count > 0 && !lens))
+        return NULL;
+    yyjson_mut_arr_with_func({
+        val->tag = ((uint64_t)lens[i] << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+        val->uni.str = vals[i];
+        if (yyjson_unlikely(!val->uni.str))
+            return NULL;
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_strcpy(yyjson_mut_doc* doc, const char** vals,
+    size_t count) {
+    size_t len;
+    const char* str;
+    yyjson_mut_arr_with_func({
+        str = vals[i];
+        if (!str)
+            return NULL;
+        len = strlen(str);
+        val->tag = ((uint64_t)len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+        val->uni.str = unsafe_yyjson_mut_strncpy(doc, str, len);
+        if (yyjson_unlikely(!val->uni.str))
+            return NULL;
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_with_strncpy(yyjson_mut_doc* doc,
+    const char** vals, const size_t* lens, size_t count) {
+    size_t len;
+    const char* str;
+    if (yyjson_unlikely(count > 0 && !lens))
+        return NULL;
+    yyjson_mut_arr_with_func({
+        str = vals[i];
+        len = lens[i];
+        val->tag = ((uint64_t)len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+        val->uni.str = unsafe_yyjson_mut_strncpy(doc, str, len);
+        if (yyjson_unlikely(!val->uni.str))
+            return NULL;
+    });
+}
+
+#undef yyjson_mut_arr_with_func
+
+/*==============================================================================
+ * Mutable JSON Array Modification API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline bool yyjson_mut_arr_insert(yyjson_mut_val* arr, yyjson_mut_val* val, size_t idx) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr) && val)) {
+        size_t len = unsafe_yyjson_get_len(arr);
+        if (yyjson_likely(idx <= len)) {
+            unsafe_yyjson_set_len(arr, len + 1);
+            if (len == 0) {
+                val->next = val;
+                arr->uni.ptr = val;
+            } else {
+                yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+                yyjson_mut_val* next = prev->next;
+                if (idx == len) {
+                    prev->next = val;
+                    val->next = next;
+                    arr->uni.ptr = val;
+                } else {
+                    while (idx-- > 0) {
+                        prev = next;
+                        next = next->next;
+                    }
+                    prev->next = val;
+                    val->next = next;
+                }
+            }
+            return true;
+        }
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_append(yyjson_mut_val* arr, yyjson_mut_val* val) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr) && val)) {
+        size_t len = unsafe_yyjson_get_len(arr);
+        unsafe_yyjson_set_len(arr, len + 1);
+        if (len == 0) {
+            val->next = val;
+        } else {
+            yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+            yyjson_mut_val* next = prev->next;
+            prev->next = val;
+            val->next = next;
+        }
+        arr->uni.ptr = val;
+        return true;
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_prepend(yyjson_mut_val* arr, yyjson_mut_val* val) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr) && val)) {
+        size_t len = unsafe_yyjson_get_len(arr);
+        unsafe_yyjson_set_len(arr, len + 1);
+        if (len == 0) {
+            val->next = val;
+            arr->uni.ptr = val;
+        } else {
+            yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+            yyjson_mut_val* next = prev->next;
+            prev->next = val;
+            val->next = next;
+        }
+        return true;
+    }
+    return false;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_replace(yyjson_mut_val* arr, size_t idx,
+    yyjson_mut_val* val) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr) && val)) {
+        size_t len = unsafe_yyjson_get_len(arr);
+        if (yyjson_likely(idx < len)) {
+            if (yyjson_likely(len > 1)) {
+                yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+                yyjson_mut_val* next = prev->next;
+                while (idx-- > 0) {
+                    prev = next;
+                    next = next->next;
+                }
+                prev->next = val;
+                val->next = next->next;
+                if ((void*)next == arr->uni.ptr)
+                    arr->uni.ptr = val;
+                return next;
+            } else {
+                yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+                val->next = val;
+                arr->uni.ptr = val;
+                return prev;
+            }
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_remove(yyjson_mut_val* arr, size_t idx) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr))) {
+        size_t len = unsafe_yyjson_get_len(arr);
+        if (yyjson_likely(idx < len)) {
+            unsafe_yyjson_set_len(arr, len - 1);
+            if (yyjson_likely(len > 1)) {
+                yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+                yyjson_mut_val* next = prev->next;
+                while (idx-- > 0) {
+                    prev = next;
+                    next = next->next;
+                }
+                prev->next = next->next;
+                if ((void*)next == arr->uni.ptr)
+                    arr->uni.ptr = prev;
+                return next;
+            } else {
+                return ((yyjson_mut_val*)arr->uni.ptr);
+            }
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_remove_first(yyjson_mut_val* arr) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr))) {
+        size_t len = unsafe_yyjson_get_len(arr);
+        if (len > 1) {
+            yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+            yyjson_mut_val* next = prev->next;
+            prev->next = next->next;
+            unsafe_yyjson_set_len(arr, len - 1);
+            return next;
+        } else if (len == 1) {
+            yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+            unsafe_yyjson_set_len(arr, 0);
+            return prev;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_remove_last(yyjson_mut_val* arr) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr))) {
+        size_t len = unsafe_yyjson_get_len(arr);
+        if (yyjson_likely(len > 1)) {
+            yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+            yyjson_mut_val* next = prev->next;
+            unsafe_yyjson_set_len(arr, len - 1);
+            while (--len > 0)
+                prev = prev->next;
+            prev->next = next;
+            next = (yyjson_mut_val*)arr->uni.ptr;
+            arr->uni.ptr = prev;
+            return next;
+        } else if (len == 1) {
+            yyjson_mut_val* prev = ((yyjson_mut_val*)arr->uni.ptr);
+            unsafe_yyjson_set_len(arr, 0);
+            return prev;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_remove_range(yyjson_mut_val* arr, size_t _idx, size_t _len) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val *prev, *next;
+        bool tail_removed;
+        size_t len = unsafe_yyjson_get_len(arr);
+        if (yyjson_unlikely(_idx + _len > len))
+            return false;
+        if (yyjson_unlikely(_len == 0))
+            return true;
+        unsafe_yyjson_set_len(arr, len - _len);
+        if (yyjson_unlikely(len == _len))
+            return true;
+        tail_removed = (_idx + _len == len);
+        prev = ((yyjson_mut_val*)arr->uni.ptr);
+        while (_idx-- > 0)
+            prev = prev->next;
+        next = prev->next;
+        while (_len-- > 0)
+            next = next->next;
+        prev->next = next;
+        if (yyjson_unlikely(tail_removed))
+            arr->uni.ptr = prev;
+        return true;
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_clear(yyjson_mut_val* arr) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr))) {
+        unsafe_yyjson_set_len(arr, 0);
+        return true;
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_rotate(yyjson_mut_val* arr, size_t idx) {
+    if (yyjson_likely(yyjson_mut_is_arr(arr) && unsafe_yyjson_get_len(arr) > idx)) {
+        yyjson_mut_val* val = (yyjson_mut_val*)arr->uni.ptr;
+        while (idx-- > 0)
+            val = val->next;
+        arr->uni.ptr = (void*)val;
+        return true;
+    }
+    return false;
+}
+
+/*==============================================================================
+ * Mutable JSON Array Modification Convenience API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline bool yyjson_mut_arr_add_val(yyjson_mut_val* arr, yyjson_mut_val* val) {
+    return yyjson_mut_arr_append(arr, val);
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_null(yyjson_mut_doc* doc, yyjson_mut_val* arr) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_null(doc);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_true(yyjson_mut_doc* doc, yyjson_mut_val* arr) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_true(doc);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_false(yyjson_mut_doc* doc, yyjson_mut_val* arr) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_false(doc);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_bool(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    bool _val) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_bool(doc, _val);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_uint(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    uint64_t num) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_uint(doc, num);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_sint(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    int64_t num) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_sint(doc, num);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_int(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    int64_t num) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_sint(doc, num);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_real(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    double num) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_real(doc, num);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_str(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    const char* str) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_str(doc, str);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_strn(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    const char* str, size_t len) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_strn(doc, str, len);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_strcpy(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    const char* str) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_strcpy(doc, str);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_arr_add_strncpy(yyjson_mut_doc* doc, yyjson_mut_val* arr,
+    const char* str, size_t len) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_strncpy(doc, str, len);
+        return yyjson_mut_arr_append(arr, val);
+    }
+    return false;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_add_arr(yyjson_mut_doc* doc, yyjson_mut_val* arr) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_arr(doc);
+        return yyjson_mut_arr_append(arr, val) ? val : NULL;
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_arr_add_obj(yyjson_mut_doc* doc, yyjson_mut_val* arr) {
+    if (yyjson_likely(doc && yyjson_mut_is_arr(arr))) {
+        yyjson_mut_val* val = yyjson_mut_obj(doc);
+        return yyjson_mut_arr_append(arr, val) ? val : NULL;
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * Mutable JSON Object API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline size_t yyjson_mut_obj_size(yyjson_mut_val* obj) {
+    return yyjson_mut_is_obj(obj) ? unsafe_yyjson_get_len(obj) : 0;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_get(yyjson_mut_val* obj, const char* key) {
+    return yyjson_mut_obj_getn(obj, key, key ? strlen(key) : 0);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_getn(yyjson_mut_val* obj, const char* _key,
+    size_t key_len) {
+    size_t len = yyjson_mut_obj_size(obj);
+    if (yyjson_likely(len && _key)) {
+        yyjson_mut_val* key = ((yyjson_mut_val*)obj->uni.ptr)->next->next;
+        while (len-- > 0) {
+            if (unsafe_yyjson_equals_strn(key, _key, key_len))
+                return key->next;
+            key = key->next->next;
+        }
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * Mutable JSON Object Iterator API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline bool yyjson_mut_obj_iter_init(yyjson_mut_val* obj, yyjson_mut_obj_iter* iter) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj) && iter)) {
+        iter->idx = 0;
+        iter->max = unsafe_yyjson_get_len(obj);
+        iter->cur = iter->max ? (yyjson_mut_val*)obj->uni.ptr : NULL;
+        iter->pre = NULL;
+        iter->obj = obj;
+        return true;
+    }
+    if (iter)
+        memset(iter, 0, sizeof(yyjson_mut_obj_iter));
+    return false;
+}
+
+yyjson_api_inline yyjson_mut_obj_iter yyjson_mut_obj_iter_with(yyjson_mut_val* obj) {
+    yyjson_mut_obj_iter iter;
+    yyjson_mut_obj_iter_init(obj, &iter);
+    return iter;
+}
+
+yyjson_api_inline bool yyjson_mut_obj_iter_has_next(yyjson_mut_obj_iter* iter) {
+    return iter ? iter->idx < iter->max : false;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_next(yyjson_mut_obj_iter* iter) {
+    if (iter && iter->idx < iter->max) {
+        yyjson_mut_val* key = iter->cur;
+        iter->pre = key;
+        iter->cur = key->next->next;
+        iter->idx++;
+        return iter->cur;
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_get_val(yyjson_mut_val* key) {
+    return key ? key->next : NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_remove(yyjson_mut_obj_iter* iter) {
+    if (yyjson_likely(iter && 0 < iter->idx && iter->idx <= iter->max)) {
+        yyjson_mut_val* prev = iter->pre;
+        yyjson_mut_val* cur = iter->cur;
+        yyjson_mut_val* next = cur->next->next;
+        if (yyjson_unlikely(iter->idx == iter->max))
+            iter->obj->uni.ptr = prev;
+        iter->idx--;
+        iter->max--;
+        unsafe_yyjson_set_len(iter->obj, iter->max);
+        prev->next->next = next;
+        iter->cur = prev;
+        return cur->next;
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_get(yyjson_mut_obj_iter* iter,
+    const char* key) {
+    return yyjson_mut_obj_iter_getn(iter, key, key ? strlen(key) : 0);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_iter_getn(yyjson_mut_obj_iter* iter,
+    const char* key, size_t key_len) {
+    if (iter && key) {
+        size_t idx = 0;
+        size_t max = iter->max;
+        yyjson_mut_val *pre, *cur = iter->cur;
+        while (idx++ < max) {
+            pre = cur;
+            cur = cur->next->next;
+            if (unsafe_yyjson_equals_strn(cur, key, key_len)) {
+                iter->idx += idx;
+                if (iter->idx > max)
+                    iter->idx -= max + 1;
+                iter->pre = pre;
+                iter->cur = cur;
+                return cur->next;
+            }
+        }
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * Mutable JSON Object Creation API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj(yyjson_mut_doc* doc) {
+    if (yyjson_likely(doc)) {
+        yyjson_mut_val* val = unsafe_yyjson_mut_val(doc, 1);
+        if (yyjson_likely(val)) {
+            val->tag = YYJSON_TYPE_OBJ | YYJSON_SUBTYPE_NONE;
+            return val;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_with_str(yyjson_mut_doc* doc, const char** keys,
+    const char** vals, size_t count) {
+    if (yyjson_likely(doc && ((count > 0 && keys && vals) || (count == 0)))) {
+        yyjson_mut_val* obj = unsafe_yyjson_mut_val(doc, 1 + count * 2);
+        if (yyjson_likely(obj)) {
+            obj->tag = ((uint64_t)count << YYJSON_TAG_BIT) | YYJSON_TYPE_OBJ;
+            if (count > 0) {
+                size_t i;
+                for (i = 0; i < count; i++) {
+                    yyjson_mut_val* key = obj + (i * 2 + 1);
+                    yyjson_mut_val* val = obj + (i * 2 + 2);
+                    uint64_t key_len = (uint64_t)strlen(keys[i]);
+                    uint64_t val_len = (uint64_t)strlen(vals[i]);
+                    key->tag = (key_len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+                    val->tag = (val_len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+                    key->uni.str = keys[i];
+                    val->uni.str = vals[i];
+                    key->next = val;
+                    val->next = val + 1;
+                }
+                obj[count * 2].next = obj + 1;
+                obj->uni.ptr = obj + (count * 2 - 1);
+            }
+            return obj;
+        }
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_with_kv(yyjson_mut_doc* doc, const char** pairs,
+    size_t count) {
+    if (yyjson_likely(doc && ((count > 0 && pairs) || (count == 0)))) {
+        yyjson_mut_val* obj = unsafe_yyjson_mut_val(doc, 1 + count * 2);
+        if (yyjson_likely(obj)) {
+            obj->tag = ((uint64_t)count << YYJSON_TAG_BIT) | YYJSON_TYPE_OBJ;
+            if (count > 0) {
+                size_t i;
+                for (i = 0; i < count; i++) {
+                    yyjson_mut_val* key = obj + (i * 2 + 1);
+                    yyjson_mut_val* val = obj + (i * 2 + 2);
+                    const char* key_str = pairs[i * 2 + 0];
+                    const char* val_str = pairs[i * 2 + 1];
+                    uint64_t key_len = (uint64_t)strlen(key_str);
+                    uint64_t val_len = (uint64_t)strlen(val_str);
+                    key->tag = (key_len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+                    val->tag = (val_len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+                    key->uni.str = key_str;
+                    val->uni.str = val_str;
+                    key->next = val;
+                    val->next = val + 1;
+                }
+                obj[count * 2].next = obj + 1;
+                obj->uni.ptr = obj + (count * 2 - 1);
+            }
+            return obj;
+        }
+    }
+    return NULL;
+}
+
+/*==============================================================================
+ * Mutable JSON Object Modification API (Implementation)
+ *============================================================================*/
+
+yyjson_api_inline void unsafe_yyjson_mut_obj_add(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val, size_t len) {
+    if (yyjson_likely(len)) {
+        yyjson_mut_val* prev_val = ((yyjson_mut_val*)obj->uni.ptr)->next;
+        yyjson_mut_val* next_key = prev_val->next;
+        prev_val->next = key;
+        val->next = next_key;
+    } else {
+        val->next = key;
+    }
+    key->next = val;
+    obj->uni.ptr = (void*)key;
+    unsafe_yyjson_set_len(obj, len + 1);
+}
+
+yyjson_api_inline yyjson_mut_val* unsafe_yyjson_mut_obj_remove(yyjson_mut_val* obj, const char* key,
+    size_t key_len) {
+    size_t obj_len = unsafe_yyjson_get_len(obj);
+    if (obj_len) {
+        yyjson_mut_val* pre_key = (yyjson_mut_val*)obj->uni.ptr;
+        yyjson_mut_val* cur_key = pre_key->next->next;
+        yyjson_mut_val* removed_item = NULL;
+        size_t i;
+        for (i = 0; i < obj_len; i++) {
+            if (unsafe_yyjson_equals_strn(cur_key, key, key_len)) {
+                if (!removed_item)
+                    removed_item = cur_key->next;
+                cur_key = cur_key->next->next;
+                pre_key->next->next = cur_key;
+                if (i + 1 == obj_len)
+                    obj->uni.ptr = pre_key;
+                i--;
+                obj_len--;
+            } else {
+                pre_key = cur_key;
+                cur_key = cur_key->next->next;
+            }
+        }
+        unsafe_yyjson_set_len(obj, obj_len);
+        return removed_item;
+    } else {
+        return NULL;
+    }
+}
+
+yyjson_api_inline bool unsafe_yyjson_mut_obj_replace(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val) {
+    size_t key_len = unsafe_yyjson_get_len(key);
+    size_t obj_len = unsafe_yyjson_get_len(obj);
+    if (obj_len) {
+        yyjson_mut_val* pre_key = (yyjson_mut_val*)obj->uni.ptr;
+        yyjson_mut_val* cur_key = pre_key->next->next;
+        size_t i;
+        for (i = 0; i < obj_len; i++) {
+            if (unsafe_yyjson_equals_strn(cur_key, key->uni.str, key_len)) {
+                cur_key->next->tag = val->tag;
+                cur_key->next->uni.u64 = val->uni.u64;
+                return true;
+            } else {
+                cur_key = cur_key->next->next;
+            }
+        }
+    }
+    return false;
+}
+
+yyjson_api_inline void unsafe_yyjson_mut_obj_rotate(yyjson_mut_val* obj, size_t idx) {
+    yyjson_mut_val* key = (yyjson_mut_val*)obj->uni.ptr;
+    while (idx-- > 0)
+        key = key->next->next;
+    obj->uni.ptr = (void*)key;
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj) && yyjson_mut_is_str(key) && val)) {
+        unsafe_yyjson_mut_obj_add(obj, key, val, unsafe_yyjson_get_len(obj));
+        return true;
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_obj_put(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val) {
+    bool replaced = false;
+    size_t key_len;
+    yyjson_mut_obj_iter iter;
+    yyjson_mut_val* cur_key;
+    if (yyjson_unlikely(!yyjson_mut_is_obj(obj) || !yyjson_mut_is_str(key)))
+        return false;
+    key_len = unsafe_yyjson_get_len(key);
+    yyjson_mut_obj_iter_init(obj, &iter);
+    while ((cur_key = yyjson_mut_obj_iter_next(&iter)) != 0) {
+        if (unsafe_yyjson_equals_strn(cur_key, key->uni.str, key_len)) {
+            if (!replaced && val) {
+                replaced = true;
+                val->next = cur_key->next->next;
+                cur_key->next = val;
+            } else {
+                yyjson_mut_obj_iter_remove(&iter);
+            }
+        }
+    }
+    if (!replaced && val)
+        unsafe_yyjson_mut_obj_add(obj, key, val, iter.max);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_mut_obj_insert(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val, size_t idx) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj) && yyjson_mut_is_str(key) && val)) {
+        size_t len = unsafe_yyjson_get_len(obj);
+        if (yyjson_likely(len >= idx)) {
+            if (len > idx) {
+                void* ptr = obj->uni.ptr;
+                unsafe_yyjson_mut_obj_rotate(obj, idx);
+                unsafe_yyjson_mut_obj_add(obj, key, val, len);
+                obj->uni.ptr = ptr;
+            } else {
+                unsafe_yyjson_mut_obj_add(obj, key, val, len);
+            }
+            return true;
+        }
+    }
+    return false;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove(yyjson_mut_val* obj, yyjson_mut_val* key) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj) && yyjson_mut_is_str(key))) {
+        return unsafe_yyjson_mut_obj_remove(obj, key->uni.str, unsafe_yyjson_get_len(key));
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove_key(yyjson_mut_val* obj, const char* key) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj) && key)) {
+        size_t key_len = strlen(key);
+        return unsafe_yyjson_mut_obj_remove(obj, key, key_len);
+    }
+    return NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove_keyn(yyjson_mut_val* obj, const char* key,
+    size_t key_len) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj) && key)) {
+        return unsafe_yyjson_mut_obj_remove(obj, key, key_len);
+    }
+    return NULL;
+}
+
+yyjson_api_inline bool yyjson_mut_obj_clear(yyjson_mut_val* obj) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj))) {
+        unsafe_yyjson_set_len(obj, 0);
+        return true;
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_obj_replace(yyjson_mut_val* obj, yyjson_mut_val* key,
+    yyjson_mut_val* val) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj) && yyjson_mut_is_str(key) && val)) {
+        return unsafe_yyjson_mut_obj_replace(obj, key, val);
+    }
+    return false;
+}
+
+yyjson_api_inline bool yyjson_mut_obj_rotate(yyjson_mut_val* obj, size_t idx) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj) && unsafe_yyjson_get_len(obj) > idx)) {
+        unsafe_yyjson_mut_obj_rotate(obj, idx);
+        return true;
+    }
+    return false;
+}
+
+/*==============================================================================
+ * Mutable JSON Object Modification Convenience API (Implementation)
+ *============================================================================*/
+
+#define yyjson_mut_obj_add_func(func)                                                              \
+    if (yyjson_likely(doc && yyjson_mut_is_obj(obj) && _key)) {                                    \
+        yyjson_mut_val* key = unsafe_yyjson_mut_val(doc, 2);                                       \
+        if (yyjson_likely(key)) {                                                                  \
+            size_t len = unsafe_yyjson_get_len(obj);                                               \
+            yyjson_mut_val* val = key + 1;                                                         \
+            size_t key_len = strlen(_key);                                                         \
+            bool noesc = unsafe_yyjson_is_str_noesc(_key, key_len);                                \
+            key->tag = YYJSON_TYPE_STR;                                                            \
+            key->tag |= noesc ? YYJSON_SUBTYPE_NOESC : YYJSON_SUBTYPE_NONE;                        \
+            key->tag |= (uint64_t)strlen(_key) << YYJSON_TAG_BIT;                                  \
+            key->uni.str = _key;                                                                   \
+            func unsafe_yyjson_mut_obj_add(obj, key, val, len);                                    \
+            return true;                                                                           \
+        }                                                                                          \
+    }                                                                                              \
+    return false
+
+yyjson_api_inline bool yyjson_mut_obj_add_null(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key) {
+    yyjson_mut_obj_add_func({ val->tag = YYJSON_TYPE_NULL | YYJSON_SUBTYPE_NONE; });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_true(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key) {
+    yyjson_mut_obj_add_func({ val->tag = YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_TRUE; });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_false(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key) {
+    yyjson_mut_obj_add_func({ val->tag = YYJSON_TYPE_BOOL | YYJSON_SUBTYPE_FALSE; });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_bool(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, bool _val) {
+    yyjson_mut_obj_add_func({
+        _val = !!_val;
+        val->tag = YYJSON_TYPE_BOOL | (uint8_t)((uint8_t)(_val) << 3);
+    });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_uint(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, uint64_t _val) {
+    yyjson_mut_obj_add_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_UINT;
+        val->uni.u64 = _val;
+    });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_sint(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, int64_t _val) {
+    yyjson_mut_obj_add_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT;
+        val->uni.i64 = _val;
+    });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_int(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, int64_t _val) {
+    yyjson_mut_obj_add_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_SINT;
+        val->uni.i64 = _val;
+    });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_real(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, double _val) {
+    yyjson_mut_obj_add_func({
+        val->tag = YYJSON_TYPE_NUM | YYJSON_SUBTYPE_REAL;
+        val->uni.f64 = _val;
+    });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_str(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, const char* _val) {
+    if (yyjson_unlikely(!_val))
+        return false;
+    yyjson_mut_obj_add_func({
+        size_t val_len = strlen(_val);
+        bool val_noesc = unsafe_yyjson_is_str_noesc(_val, val_len);
+        val->tag = ((uint64_t)strlen(_val) << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+        val->tag |= val_noesc ? YYJSON_SUBTYPE_NOESC : YYJSON_SUBTYPE_NONE;
+        val->uni.str = _val;
+    });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_strn(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, const char* _val, size_t _len) {
+    if (yyjson_unlikely(!_val))
+        return false;
+    yyjson_mut_obj_add_func({
+        val->tag = ((uint64_t)_len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+        val->uni.str = _val;
+    });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_strcpy(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, const char* _val) {
+    if (yyjson_unlikely(!_val))
+        return false;
+    yyjson_mut_obj_add_func({
+        size_t _len = strlen(_val);
+        val->uni.str = unsafe_yyjson_mut_strncpy(doc, _val, _len);
+        if (yyjson_unlikely(!val->uni.str))
+            return false;
+        val->tag = ((uint64_t)_len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+    });
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_strncpy(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, const char* _val, size_t _len) {
+    if (yyjson_unlikely(!_val))
+        return false;
+    yyjson_mut_obj_add_func({
+        val->uni.str = unsafe_yyjson_mut_strncpy(doc, _val, _len);
+        if (yyjson_unlikely(!val->uni.str))
+            return false;
+        val->tag = ((uint64_t)_len << YYJSON_TAG_BIT) | YYJSON_TYPE_STR;
+    });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_add_arr(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key) {
+    yyjson_mut_val* key = yyjson_mut_str(doc, _key);
+    yyjson_mut_val* val = yyjson_mut_arr(doc);
+    return yyjson_mut_obj_add(obj, key, val) ? val : NULL;
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_add_obj(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key) {
+    yyjson_mut_val* key = yyjson_mut_str(doc, _key);
+    yyjson_mut_val* val = yyjson_mut_obj(doc);
+    return yyjson_mut_obj_add(obj, key, val) ? val : NULL;
+}
+
+yyjson_api_inline bool yyjson_mut_obj_add_val(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* _key, yyjson_mut_val* _val) {
+    if (yyjson_unlikely(!_val))
+        return false;
+    yyjson_mut_obj_add_func({ val = _val; });
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove_str(yyjson_mut_val* obj, const char* key) {
+    return yyjson_mut_obj_remove_strn(obj, key, key ? strlen(key) : 0);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_obj_remove_strn(yyjson_mut_val* obj, const char* _key,
+    size_t _len) {
+    if (yyjson_likely(yyjson_mut_is_obj(obj) && _key)) {
+        yyjson_mut_val* key;
+        yyjson_mut_obj_iter iter;
+        yyjson_mut_val* val_removed = NULL;
+        yyjson_mut_obj_iter_init(obj, &iter);
+        while ((key = yyjson_mut_obj_iter_next(&iter)) != NULL) {
+            if (unsafe_yyjson_equals_strn(key, _key, _len)) {
+                if (!val_removed)
+                    val_removed = key->next;
+                yyjson_mut_obj_iter_remove(&iter);
+            }
+        }
+        return val_removed;
+    }
+    return NULL;
+}
+
+yyjson_api_inline bool yyjson_mut_obj_rename_key(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, const char* new_key) {
+    if (!key || !new_key)
+        return false;
+    return yyjson_mut_obj_rename_keyn(doc, obj, key, strlen(key), new_key, strlen(new_key));
+}
+
+yyjson_api_inline bool yyjson_mut_obj_rename_keyn(yyjson_mut_doc* doc, yyjson_mut_val* obj,
+    const char* key, size_t len, const char* new_key, size_t new_len) {
+    char* cpy_key = NULL;
+    yyjson_mut_val* old_key;
+    yyjson_mut_obj_iter iter;
+    if (!doc || !obj || !key || !new_key)
+        return false;
+    yyjson_mut_obj_iter_init(obj, &iter);
+    while ((old_key = yyjson_mut_obj_iter_next(&iter))) {
+        if (unsafe_yyjson_equals_strn((void*)old_key, key, len)) {
+            if (!cpy_key) {
+                cpy_key = unsafe_yyjson_mut_strncpy(doc, new_key, new_len);
+                if (!cpy_key)
+                    return false;
+            }
+            yyjson_mut_set_strn(old_key, cpy_key, new_len);
+        }
+    }
+    return cpy_key != NULL;
+}
+
+/*==============================================================================
+ * JSON Pointer API (Implementation)
+ *============================================================================*/
+
+#define yyjson_ptr_set_err(_code, _msg)                                                            \
+    do {                                                                                           \
+        if (err) {                                                                                 \
+            err->code = YYJSON_PTR_ERR_##_code;                                                    \
+            err->msg = _msg;                                                                       \
+            err->pos = 0;                                                                          \
+        }                                                                                          \
+    } while (false)
+
+/* require: val != NULL, *ptr == '/', len > 0 */
+yyjson_api yyjson_val* unsafe_yyjson_ptr_getx(yyjson_val* val, const char* ptr, size_t len,
+    yyjson_ptr_err* err);
+
+/* require: val != NULL, *ptr == '/', len > 0 */
+yyjson_api yyjson_mut_val* unsafe_yyjson_mut_ptr_getx(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/* require: val/new_val/doc != NULL, *ptr == '/', len > 0 */
+yyjson_api bool unsafe_yyjson_mut_ptr_putx(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc, bool create_parent, bool insert_new,
+    yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/* require: val/err != NULL, *ptr == '/', len > 0 */
+yyjson_api yyjson_mut_val* unsafe_yyjson_mut_ptr_replacex(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_mut_val* new_val, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+/* require: val/err != NULL, *ptr == '/', len > 0 */
+yyjson_api yyjson_mut_val* unsafe_yyjson_mut_ptr_removex(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err);
+
+yyjson_api_inline yyjson_val* yyjson_doc_ptr_get(yyjson_doc* doc, const char* ptr) {
+    if (yyjson_unlikely(!ptr))
+        return NULL;
+    return yyjson_doc_ptr_getn(doc, ptr, strlen(ptr));
+}
+
+yyjson_api_inline yyjson_val* yyjson_doc_ptr_getn(yyjson_doc* doc, const char* ptr, size_t len) {
+    return yyjson_doc_ptr_getx(doc, ptr, len, NULL);
+}
+
+yyjson_api_inline yyjson_val* yyjson_doc_ptr_getx(yyjson_doc* doc, const char* ptr, size_t len,
+    yyjson_ptr_err* err) {
+    yyjson_ptr_set_err(NONE, NULL);
+    if (yyjson_unlikely(!doc || !ptr)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(!doc->root)) {
+        yyjson_ptr_set_err(NULL_ROOT, "document's root is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        return doc->root;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return NULL;
+    }
+    return unsafe_yyjson_ptr_getx(doc->root, ptr, len, err);
+}
+
+yyjson_api_inline yyjson_val* yyjson_ptr_get(yyjson_val* val, const char* ptr) {
+    if (yyjson_unlikely(!ptr))
+        return NULL;
+    return yyjson_ptr_getn(val, ptr, strlen(ptr));
+}
+
+yyjson_api_inline yyjson_val* yyjson_ptr_getn(yyjson_val* val, const char* ptr, size_t len) {
+    return yyjson_ptr_getx(val, ptr, len, NULL);
+}
+
+yyjson_api_inline yyjson_val* yyjson_ptr_getx(yyjson_val* val, const char* ptr, size_t len,
+    yyjson_ptr_err* err) {
+    yyjson_ptr_set_err(NONE, NULL);
+    if (yyjson_unlikely(!val || !ptr)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        return val;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return NULL;
+    }
+    return unsafe_yyjson_ptr_getx(val, ptr, len, err);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_get(yyjson_mut_doc* doc, const char* ptr) {
+    if (!ptr)
+        return NULL;
+    return yyjson_mut_doc_ptr_getn(doc, ptr, strlen(ptr));
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_getn(yyjson_mut_doc* doc, const char* ptr,
+    size_t len) {
+    return yyjson_mut_doc_ptr_getx(doc, ptr, len, NULL, NULL);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_getx(yyjson_mut_doc* doc, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!doc || !ptr)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(!doc->root)) {
+        yyjson_ptr_set_err(NULL_ROOT, "document's root is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        return doc->root;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return NULL;
+    }
+    return unsafe_yyjson_mut_ptr_getx(doc->root, ptr, len, ctx, err);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_get(yyjson_mut_val* val, const char* ptr) {
+    if (!ptr)
+        return NULL;
+    return yyjson_mut_ptr_getn(val, ptr, strlen(ptr));
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_getn(yyjson_mut_val* val, const char* ptr,
+    size_t len) {
+    return yyjson_mut_ptr_getx(val, ptr, len, NULL, NULL);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_getx(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!val || !ptr)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        return val;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return NULL;
+    }
+    return unsafe_yyjson_mut_ptr_getx(val, ptr, len, ctx, err);
+}
+
+yyjson_api_inline bool yyjson_mut_doc_ptr_add(yyjson_mut_doc* doc, const char* ptr,
+    yyjson_mut_val* new_val) {
+    if (yyjson_unlikely(!ptr))
+        return false;
+    return yyjson_mut_doc_ptr_addn(doc, ptr, strlen(ptr), new_val);
+}
+
+yyjson_api_inline bool yyjson_mut_doc_ptr_addn(yyjson_mut_doc* doc, const char* ptr, size_t len,
+    yyjson_mut_val* new_val) {
+    return yyjson_mut_doc_ptr_addx(doc, ptr, len, new_val, true, NULL, NULL);
+}
+
+yyjson_api_inline bool yyjson_mut_doc_ptr_addx(yyjson_mut_doc* doc, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, bool create_parent, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!doc || !ptr || !new_val)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return false;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        if (doc->root) {
+            yyjson_ptr_set_err(SET_ROOT, "cannot set document's root");
+            return false;
+        } else {
+            doc->root = new_val;
+            return true;
+        }
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return false;
+    }
+    if (yyjson_unlikely(!doc->root && !create_parent)) {
+        yyjson_ptr_set_err(NULL_ROOT, "document's root is NULL");
+        return false;
+    }
+    if (yyjson_unlikely(!doc->root)) {
+        yyjson_mut_val* root = yyjson_mut_obj(doc);
+        if (yyjson_unlikely(!root)) {
+            yyjson_ptr_set_err(MEMORY_ALLOCATION, "failed to create value");
+            return false;
+        }
+        if (unsafe_yyjson_mut_ptr_putx(root, ptr, len, new_val, doc, create_parent, true, ctx,
+                err)) {
+            doc->root = root;
+            return true;
+        }
+        return false;
+    }
+    return unsafe_yyjson_mut_ptr_putx(doc->root, ptr, len, new_val, doc, create_parent, true, ctx,
+        err);
+}
+
+yyjson_api_inline bool yyjson_mut_ptr_add(yyjson_mut_val* val, const char* ptr,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc) {
+    if (yyjson_unlikely(!ptr))
+        return false;
+    return yyjson_mut_ptr_addn(val, ptr, strlen(ptr), new_val, doc);
+}
+
+yyjson_api_inline bool yyjson_mut_ptr_addn(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc) {
+    return yyjson_mut_ptr_addx(val, ptr, len, new_val, doc, true, NULL, NULL);
+}
+
+yyjson_api_inline bool yyjson_mut_ptr_addx(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc, bool create_parent, yyjson_ptr_ctx* ctx,
+    yyjson_ptr_err* err) {
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!val || !ptr || !new_val || !doc)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return false;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        yyjson_ptr_set_err(SET_ROOT, "cannot set root");
+        return false;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return false;
+    }
+    return unsafe_yyjson_mut_ptr_putx(val, ptr, len, new_val, doc, create_parent, true, ctx, err);
+}
+
+yyjson_api_inline bool yyjson_mut_doc_ptr_set(yyjson_mut_doc* doc, const char* ptr,
+    yyjson_mut_val* new_val) {
+    if (yyjson_unlikely(!ptr))
+        return false;
+    return yyjson_mut_doc_ptr_setn(doc, ptr, strlen(ptr), new_val);
+}
+
+yyjson_api_inline bool yyjson_mut_doc_ptr_setn(yyjson_mut_doc* doc, const char* ptr, size_t len,
+    yyjson_mut_val* new_val) {
+    return yyjson_mut_doc_ptr_setx(doc, ptr, len, new_val, true, NULL, NULL);
+}
+
+yyjson_api_inline bool yyjson_mut_doc_ptr_setx(yyjson_mut_doc* doc, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, bool create_parent, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!doc || !ptr)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return false;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        if (ctx)
+            ctx->old = doc->root;
+        doc->root = new_val;
+        return true;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return false;
+    }
+    if (!new_val) {
+        if (!doc->root) {
+            yyjson_ptr_set_err(RESOLVE, "JSON pointer cannot be resolved");
+            return false;
+        }
+        return !!unsafe_yyjson_mut_ptr_removex(doc->root, ptr, len, ctx, err);
+    }
+    if (yyjson_unlikely(!doc->root && !create_parent)) {
+        yyjson_ptr_set_err(NULL_ROOT, "document's root is NULL");
+        return false;
+    }
+    if (yyjson_unlikely(!doc->root)) {
+        yyjson_mut_val* root = yyjson_mut_obj(doc);
+        if (yyjson_unlikely(!root)) {
+            yyjson_ptr_set_err(MEMORY_ALLOCATION, "failed to create value");
+            return false;
+        }
+        if (unsafe_yyjson_mut_ptr_putx(root, ptr, len, new_val, doc, create_parent, false, ctx,
+                err)) {
+            doc->root = root;
+            return true;
+        }
+        return false;
+    }
+    return unsafe_yyjson_mut_ptr_putx(doc->root, ptr, len, new_val, doc, create_parent, false, ctx,
+        err);
+}
+
+yyjson_api_inline bool yyjson_mut_ptr_set(yyjson_mut_val* val, const char* ptr,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc) {
+    if (yyjson_unlikely(!ptr))
+        return false;
+    return yyjson_mut_ptr_setn(val, ptr, strlen(ptr), new_val, doc);
+}
+
+yyjson_api_inline bool yyjson_mut_ptr_setn(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc) {
+    return yyjson_mut_ptr_setx(val, ptr, len, new_val, doc, true, NULL, NULL);
+}
+
+yyjson_api_inline bool yyjson_mut_ptr_setx(yyjson_mut_val* val, const char* ptr, size_t len,
+    yyjson_mut_val* new_val, yyjson_mut_doc* doc, bool create_parent, yyjson_ptr_ctx* ctx,
+    yyjson_ptr_err* err) {
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!val || !ptr || !doc)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return false;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        yyjson_ptr_set_err(SET_ROOT, "cannot set root");
+        return false;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return false;
+    }
+    if (!new_val) {
+        return !!unsafe_yyjson_mut_ptr_removex(val, ptr, len, ctx, err);
+    }
+    return unsafe_yyjson_mut_ptr_putx(val, ptr, len, new_val, doc, create_parent, false, ctx, err);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_replace(yyjson_mut_doc* doc, const char* ptr,
+    yyjson_mut_val* new_val) {
+    if (!ptr)
+        return NULL;
+    return yyjson_mut_doc_ptr_replacen(doc, ptr, strlen(ptr), new_val);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_replacen(yyjson_mut_doc* doc, const char* ptr,
+    size_t len, yyjson_mut_val* new_val) {
+    return yyjson_mut_doc_ptr_replacex(doc, ptr, len, new_val, NULL, NULL);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_replacex(yyjson_mut_doc* doc, const char* ptr,
+    size_t len, yyjson_mut_val* new_val, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!doc || !ptr || !new_val)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        yyjson_mut_val* root = doc->root;
+        if (yyjson_unlikely(!root)) {
+            yyjson_ptr_set_err(RESOLVE, "JSON pointer cannot be resolved");
+            return NULL;
+        }
+        if (ctx)
+            ctx->old = root;
+        doc->root = new_val;
+        return root;
+    }
+    if (yyjson_unlikely(!doc->root)) {
+        yyjson_ptr_set_err(NULL_ROOT, "document's root is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return NULL;
+    }
+    return unsafe_yyjson_mut_ptr_replacex(doc->root, ptr, len, new_val, ctx, err);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_replace(yyjson_mut_val* val, const char* ptr,
+    yyjson_mut_val* new_val) {
+    if (!ptr)
+        return NULL;
+    return yyjson_mut_ptr_replacen(val, ptr, strlen(ptr), new_val);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_replacen(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_mut_val* new_val) {
+    return yyjson_mut_ptr_replacex(val, ptr, len, new_val, NULL, NULL);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_replacex(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_mut_val* new_val, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!val || !ptr || !new_val)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        yyjson_ptr_set_err(SET_ROOT, "cannot set root");
+        return NULL;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return NULL;
+    }
+    return unsafe_yyjson_mut_ptr_replacex(val, ptr, len, new_val, ctx, err);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_remove(yyjson_mut_doc* doc, const char* ptr) {
+    if (!ptr)
+        return NULL;
+    return yyjson_mut_doc_ptr_removen(doc, ptr, strlen(ptr));
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_removen(yyjson_mut_doc* doc, const char* ptr,
+    size_t len) {
+    return yyjson_mut_doc_ptr_removex(doc, ptr, len, NULL, NULL);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_doc_ptr_removex(yyjson_mut_doc* doc, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!doc || !ptr)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(!doc->root)) {
+        yyjson_ptr_set_err(NULL_ROOT, "document's root is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        yyjson_mut_val* root = doc->root;
+        if (ctx)
+            ctx->old = root;
+        doc->root = NULL;
+        return root;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return NULL;
+    }
+    return unsafe_yyjson_mut_ptr_removex(doc->root, ptr, len, ctx, err);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_remove(yyjson_mut_val* val, const char* ptr) {
+    if (!ptr)
+        return NULL;
+    return yyjson_mut_ptr_removen(val, ptr, strlen(ptr));
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_removen(yyjson_mut_val* val, const char* ptr,
+    size_t len) {
+    return yyjson_mut_ptr_removex(val, ptr, len, NULL, NULL);
+}
+
+yyjson_api_inline yyjson_mut_val* yyjson_mut_ptr_removex(yyjson_mut_val* val, const char* ptr,
+    size_t len, yyjson_ptr_ctx* ctx, yyjson_ptr_err* err) {
+    yyjson_ptr_set_err(NONE, NULL);
+    if (ctx)
+        memset(ctx, 0, sizeof(*ctx));
+
+    if (yyjson_unlikely(!val || !ptr)) {
+        yyjson_ptr_set_err(PARAMETER, "input parameter is NULL");
+        return NULL;
+    }
+    if (yyjson_unlikely(len == 0)) {
+        yyjson_ptr_set_err(SET_ROOT, "cannot set root");
+        return NULL;
+    }
+    if (yyjson_unlikely(*ptr != '/')) {
+        yyjson_ptr_set_err(SYNTAX, "no prefix '/'");
+        return NULL;
+    }
+    return unsafe_yyjson_mut_ptr_removex(val, ptr, len, ctx, err);
+}
+
+yyjson_api_inline bool yyjson_ptr_ctx_append(yyjson_ptr_ctx* ctx, yyjson_mut_val* key,
+    yyjson_mut_val* val) {
+    yyjson_mut_val *ctn, *pre_key, *pre_val, *cur_key, *cur_val;
+    if (!ctx || !ctx->ctn || !val)
+        return false;
+    ctn = ctx->ctn;
+
+    if (yyjson_mut_is_obj(ctn)) {
+        if (!key)
+            return false;
+        key->next = val;
+        pre_key = ctx->pre;
+        if (unsafe_yyjson_get_len(ctn) == 0) {
+            val->next = key;
+            ctn->uni.ptr = key;
+            ctx->pre = key;
+        } else if (!pre_key) {
+            pre_key = (yyjson_mut_val*)ctn->uni.ptr;
+            pre_val = pre_key->next;
+            val->next = pre_val->next;
+            pre_val->next = key;
+            ctn->uni.ptr = key;
+            ctx->pre = pre_key;
+        } else {
+            cur_key = pre_key->next->next;
+            cur_val = cur_key->next;
+            val->next = cur_val->next;
+            cur_val->next = key;
+            if (ctn->uni.ptr == cur_key)
+                ctn->uni.ptr = key;
+            ctx->pre = cur_key;
+        }
+    } else {
+        pre_val = ctx->pre;
+        if (unsafe_yyjson_get_len(ctn) == 0) {
+            val->next = val;
+            ctn->uni.ptr = val;
+            ctx->pre = val;
+        } else if (!pre_val) {
+            pre_val = (yyjson_mut_val*)ctn->uni.ptr;
+            val->next = pre_val->next;
+            pre_val->next = val;
+            ctn->uni.ptr = val;
+            ctx->pre = pre_val;
+        } else {
+            cur_val = pre_val->next;
+            val->next = cur_val->next;
+            cur_val->next = val;
+            if (ctn->uni.ptr == cur_val)
+                ctn->uni.ptr = val;
+            ctx->pre = cur_val;
+        }
+    }
+    unsafe_yyjson_inc_len(ctn);
+    return true;
+}
+
+yyjson_api_inline bool yyjson_ptr_ctx_replace(yyjson_ptr_ctx* ctx, yyjson_mut_val* val) {
+    yyjson_mut_val *ctn, *pre_key, *cur_key, *pre_val, *cur_val;
+    if (!ctx || !ctx->ctn || !ctx->pre || !val)
+        return false;
+    ctn = ctx->ctn;
+    if (yyjson_mut_is_obj(ctn)) {
+        pre_key = ctx->pre;
+        pre_val = pre_key->next;
+        cur_key = pre_val->next;
+        cur_val = cur_key->next;
+        /* replace current value */
+        cur_key->next = val;
+        val->next = cur_val->next;
+        ctx->old = cur_val;
+    } else {
+        pre_val = ctx->pre;
+        cur_val = pre_val->next;
+        /* replace current value */
+        if (pre_val != cur_val) {
+            val->next = cur_val->next;
+            pre_val->next = val;
+            if (ctn->uni.ptr == cur_val)
+                ctn->uni.ptr = val;
+        } else {
+            val->next = val;
+            ctn->uni.ptr = val;
+            ctx->pre = val;
+        }
+        ctx->old = cur_val;
+    }
+    return true;
+}
+
+yyjson_api_inline bool yyjson_ptr_ctx_remove(yyjson_ptr_ctx* ctx) {
+    yyjson_mut_val *ctn, *pre_key, *pre_val, *cur_key, *cur_val;
+    size_t len;
+    if (!ctx || !ctx->ctn || !ctx->pre)
+        return false;
+    ctn = ctx->ctn;
+    if (yyjson_mut_is_obj(ctn)) {
+        pre_key = ctx->pre;
+        pre_val = pre_key->next;
+        cur_key = pre_val->next;
+        cur_val = cur_key->next;
+        /* remove current key-value */
+        pre_val->next = cur_val->next;
+        if (ctn->uni.ptr == cur_key)
+            ctn->uni.ptr = pre_key;
+        ctx->pre = NULL;
+        ctx->old = cur_val;
+    } else {
+        pre_val = ctx->pre;
+        cur_val = pre_val->next;
+        /* remove current key-value */
+        pre_val->next = cur_val->next;
+        if (ctn->uni.ptr == cur_val)
+            ctn->uni.ptr = pre_val;
+        ctx->pre = NULL;
+        ctx->old = cur_val;
+    }
+    len = unsafe_yyjson_get_len(ctn) - 1;
+    if (len == 0)
+        ctn->uni.ptr = NULL;
+    unsafe_yyjson_set_len(ctn, len);
+    return true;
+}
+
+#undef yyjson_ptr_set_err
+
+/*==============================================================================
+ * JSON Value at Pointer API (Implementation)
+ *============================================================================*/
+
+/**
+ Set provided `value` if the JSON Pointer (RFC 6901) exists and is type bool.
+ Returns true if value at `ptr` exists and is the correct type, otherwise false.
+ */
+yyjson_api_inline bool yyjson_ptr_get_bool(yyjson_val* root, const char* ptr, bool* value) {
+    yyjson_val* val = yyjson_ptr_get(root, ptr);
+    if (value && yyjson_is_bool(val)) {
+        *value = unsafe_yyjson_get_bool(val);
+        return true;
+    } else {
+        return false;
+    }
+}
+
+/**
+ Set provided `value` if the JSON Pointer (RFC 6901) exists and is an integer
+ that fits in `uint64_t`. Returns true if successful, otherwise false.
+ */
+yyjson_api_inline bool yyjson_ptr_get_uint(yyjson_val* root, const char* ptr, uint64_t* value) {
+    yyjson_val* val = yyjson_ptr_get(root, ptr);
+    if (value && val) {
+        uint64_t ret = val->uni.u64;
+        if (unsafe_yyjson_is_uint(val) || (unsafe_yyjson_is_sint(val) && !(ret >> 63))) {
+            *value = ret;
+            return true;
+        }
+    }
+    return false;
+}
+
+/**
+ Set provided `value` if the JSON Pointer (RFC 6901) exists and is an integer
+ that fits in `int64_t`. Returns true if successful, otherwise false.
+ */
+yyjson_api_inline bool yyjson_ptr_get_sint(yyjson_val* root, const char* ptr, int64_t* value) {
+    yyjson_val* val = yyjson_ptr_get(root, ptr);
+    if (value && val) {
+        int64_t ret = val->uni.i64;
+        if (unsafe_yyjson_is_sint(val) || (unsafe_yyjson_is_uint(val) && ret >= 0)) {
+            *value = ret;
+            return true;
+        }
+    }
+    return false;
+}
+
+/**
+ Set provided `value` if the JSON Pointer (RFC 6901) exists and is type real.
+ Returns true if value at `ptr` exists and is the correct type, otherwise false.
+ */
+yyjson_api_inline bool yyjson_ptr_get_real(yyjson_val* root, const char* ptr, double* value) {
+    yyjson_val* val = yyjson_ptr_get(root, ptr);
+    if (value && yyjson_is_real(val)) {
+        *value = unsafe_yyjson_get_real(val);
+        return true;
+    } else {
+        return false;
+    }
+}
+
+/**
+ Set provided `value` if the JSON Pointer (RFC 6901) exists and is type sint,
+ uint or real.
+ Returns true if value at `ptr` exists and is the correct type, otherwise false.
+ */
+yyjson_api_inline bool yyjson_ptr_get_num(yyjson_val* root, const char* ptr, double* value) {
+    yyjson_val* val = yyjson_ptr_get(root, ptr);
+    if (value && yyjson_is_num(val)) {
+        *value = unsafe_yyjson_get_num(val);
+        return true;
+    } else {
+        return false;
+    }
+}
+
+/**
+ Set provided `value` if the JSON Pointer (RFC 6901) exists and is type string.
+ Returns true if value at `ptr` exists and is the correct type, otherwise false.
+ */
+yyjson_api_inline bool yyjson_ptr_get_str(yyjson_val* root, const char* ptr, const char** value) {
+    yyjson_val* val = yyjson_ptr_get(root, ptr);
+    if (value && yyjson_is_str(val)) {
+        *value = unsafe_yyjson_get_str(val);
+        return true;
+    } else {
+        return false;
+    }
+}
+
+/*==============================================================================
+ * Deprecated
+ *============================================================================*/
+
+/** @deprecated renamed to `yyjson_doc_ptr_get` */
+yyjson_deprecated("renamed to yyjson_doc_ptr_get")
+    yyjson_api_inline yyjson_val* yyjson_doc_get_pointer(yyjson_doc* doc, const char* ptr) {
+    return yyjson_doc_ptr_get(doc, ptr);
+}
+
+/** @deprecated renamed to `yyjson_doc_ptr_getn` */
+yyjson_deprecated("renamed to yyjson_doc_ptr_getn") yyjson_api_inline
+    yyjson_val* yyjson_doc_get_pointern(yyjson_doc* doc, const char* ptr, size_t len) {
+    return yyjson_doc_ptr_getn(doc, ptr, len);
+}
+
+/** @deprecated renamed to `yyjson_mut_doc_ptr_get` */
+yyjson_deprecated("renamed to yyjson_mut_doc_ptr_get") yyjson_api_inline
+    yyjson_mut_val* yyjson_mut_doc_get_pointer(yyjson_mut_doc* doc, const char* ptr) {
+    return yyjson_mut_doc_ptr_get(doc, ptr);
+}
+
+/** @deprecated renamed to `yyjson_mut_doc_ptr_getn` */
+yyjson_deprecated("renamed to yyjson_mut_doc_ptr_getn") yyjson_api_inline
+    yyjson_mut_val* yyjson_mut_doc_get_pointern(yyjson_mut_doc* doc, const char* ptr, size_t len) {
+    return yyjson_mut_doc_ptr_getn(doc, ptr, len);
+}
+
+/** @deprecated renamed to `yyjson_ptr_get` */
+yyjson_deprecated("renamed to yyjson_ptr_get") yyjson_api_inline yyjson_val* yyjson_get_pointer(
+    yyjson_val* val, const char* ptr) {
+    return yyjson_ptr_get(val, ptr);
+}
+
+/** @deprecated renamed to `yyjson_ptr_getn` */
+yyjson_deprecated("renamed to yyjson_ptr_getn") yyjson_api_inline yyjson_val* yyjson_get_pointern(
+    yyjson_val* val, const char* ptr, size_t len) {
+    return yyjson_ptr_getn(val, ptr, len);
+}
+
+/** @deprecated renamed to `yyjson_mut_ptr_get` */
+yyjson_deprecated("renamed to yyjson_mut_ptr_get")
+    yyjson_api_inline yyjson_mut_val* yyjson_mut_get_pointer(yyjson_mut_val* val, const char* ptr) {
+    return yyjson_mut_ptr_get(val, ptr);
+}
+
+/** @deprecated renamed to `yyjson_mut_ptr_getn` */
+yyjson_deprecated("renamed to yyjson_mut_ptr_getn") yyjson_api_inline
+    yyjson_mut_val* yyjson_mut_get_pointern(yyjson_mut_val* val, const char* ptr, size_t len) {
+    return yyjson_mut_ptr_getn(val, ptr, len);
+}
+
+/** @deprecated renamed to `yyjson_mut_ptr_getn` */
+yyjson_deprecated("renamed to unsafe_yyjson_ptr_getn") yyjson_api_inline
+    yyjson_val* unsafe_yyjson_get_pointer(yyjson_val* val, const char* ptr, size_t len) {
+    yyjson_ptr_err err;
+    return unsafe_yyjson_ptr_getx(val, ptr, len, &err);
+}
+
+/** @deprecated renamed to `unsafe_yyjson_mut_ptr_getx` */
+yyjson_deprecated("renamed to unsafe_yyjson_mut_ptr_getx")
+    yyjson_api_inline yyjson_mut_val* unsafe_yyjson_mut_get_pointer(yyjson_mut_val* val,
+        const char* ptr, size_t len) {
+    yyjson_ptr_err err;
+    return unsafe_yyjson_mut_ptr_getx(val, ptr, len, NULL, &err);
+}
+
+/*==============================================================================
+ * Compiler Hint End
+ *============================================================================*/
+
+#if defined(__clang__)
+#pragma clang diagnostic pop
+#elif defined(__GNUC__)
+#if (__GNUC__ > 4) || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6)
+#pragma GCC diagnostic pop
+#endif
+#elif defined(_MSC_VER)
+#pragma warning(pop)
+#endif /* warning suppress end */
+
+#ifdef __cplusplus
+}
+#endif /* extern "C" end */
+
+#endif /* YYJSON_H */
+
+// NOLINTEND
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/CMakeLists.txt
new file mode 100644
index 0000000000..271b590cf3
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/CMakeLists.txt
@@ -0,0 +1,41 @@
+cmake_minimum_required(VERSION 3.11)
+
+if(POLICY CMP0048)
+    cmake_policy(SET CMP0048 NEW)
+endif()
+
+if(POLICY CMP0063)
+    cmake_policy(SET CMP0063 NEW)
+endif()
+
+project(zstd CXX)
+
+add_library(zstd STATIC
+        common/entropy_common.cpp
+        common/error_private.cpp
+        common/fse_decompress.cpp
+        common/xxhash.cpp
+        common/zstd_common.cpp
+        compress/fse_compress.cpp
+        compress/hist.cpp
+        compress/huf_compress.cpp
+        compress/zstd_compress.cpp
+        compress/zstd_compress_literals.cpp
+        compress/zstd_compress_sequences.cpp
+        compress/zstd_compress_superblock.cpp
+        compress/zstd_double_fast.cpp
+        compress/zstd_fast.cpp
+        compress/zstd_lazy.cpp
+        compress/zstd_ldm.cpp
+        compress/zstd_opt.cpp
+        decompress/huf_decompress.cpp
+        decompress/zstd_ddict.cpp
+        decompress/zstd_decompress.cpp
+        decompress/zstd_decompress_block.cpp)
+
+# Hide all zstd symbols, since we are importing the library.
+add_compile_definitions(zstd ZSTDLIB_VISIBILITY= ZSTDERRORLIB_VISIBILITY=)
+
+target_include_directories(
+        zstd
+        PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/include>)
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/LICENSE b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/LICENSE
new file mode 100644
index 0000000000..dbdb05eda1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/LICENSE
@@ -0,0 +1,30 @@
+BSD License
+
+For Zstandard software
+
+Copyright (c) 2016-present, Facebook, Inc. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+ * Neither the name Facebook nor the names of its contributors may be used to
+   endorse or promote products derived from this software without specific
+   prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/entropy_common.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/entropy_common.cpp
new file mode 100644
index 0000000000..3d60c4bc9c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/entropy_common.cpp
@@ -0,0 +1,219 @@
+/* ******************************************************************
+ * Common functions of New Generation Entropy library
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ *
+ *  You can contact the author at :
+ *  - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *  - Public forum : https://groups.google.com/forum/#!forum/lz4c
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+/* *************************************
+*  Dependencies
+***************************************/
+#include "zstd/common/mem.h"
+#include "zstd/common/error_private.h"       /* ERR_*, ERROR */
+#include "zstd/common/fse.h"
+#include "zstd/common/fse_static.h"
+#include "zstd/common/huf.h"
+#include "zstd/common/huf_static.h"
+
+namespace lbug_zstd {
+
+/*===   Version   ===*/
+unsigned FSE_versionNumber(void) { return FSE_VERSION_NUMBER; }
+
+
+/*===   Error Management   ===*/
+unsigned FSE_isError(size_t code) { return ERR_isError(code); }
+const char* FSE_getErrorName(size_t code) { return ERR_getErrorName(code); }
+
+unsigned HUF_isError(size_t code) { return ERR_isError(code); }
+const char* HUF_getErrorName(size_t code) { return ERR_getErrorName(code); }
+
+
+/*-**************************************************************
+*  FSE NCount encoding-decoding
+****************************************************************/
+size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsigned* tableLogPtr,
+                 const void* headerBuffer, size_t hbSize)
+{
+    const BYTE* const istart = (const BYTE*) headerBuffer;
+    const BYTE* const iend = istart + hbSize;
+    const BYTE* ip = istart;
+    int nbBits;
+    int remaining;
+    int threshold;
+    U32 bitStream;
+    int bitCount;
+    unsigned charnum = 0;
+    int previous0 = 0;
+
+    if (hbSize < 4) {
+        /* This function only works when hbSize >= 4 */
+        char buffer[4];
+        memset(buffer, 0, sizeof(buffer));
+        memcpy(buffer, headerBuffer, hbSize);
+        {   size_t const countSize = FSE_readNCount(normalizedCounter, maxSVPtr, tableLogPtr,
+                                                    buffer, sizeof(buffer));
+            if (FSE_isError(countSize)) return countSize;
+            if (countSize > hbSize) return ERROR(corruption_detected);
+            return countSize;
+    }   }
+    assert(hbSize >= 4);
+
+    /* init */
+    memset(normalizedCounter, 0, (*maxSVPtr+1) * sizeof(normalizedCounter[0]));   /* all symbols not present in NCount have a frequency of 0 */
+    bitStream = MEM_readLE32(ip);
+    nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG;   /* extract tableLog */
+    if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX) return ERROR(tableLog_tooLarge);
+    bitStream >>= 4;
+    bitCount = 4;
+    *tableLogPtr = nbBits;
+    remaining = (1<<nbBits)+1;
+    threshold = 1<<nbBits;
+    nbBits++;
+
+    while ((remaining>1) & (charnum<=*maxSVPtr)) {
+        if (previous0) {
+            unsigned n0 = charnum;
+            while ((bitStream & 0xFFFF) == 0xFFFF) {
+                n0 += 24;
+                if (ip < iend-5) {
+                    ip += 2;
+                    bitStream = MEM_readLE32(ip) >> bitCount;
+                } else {
+                    bitStream >>= 16;
+                    bitCount   += 16;
+            }   }
+            while ((bitStream & 3) == 3) {
+                n0 += 3;
+                bitStream >>= 2;
+                bitCount += 2;
+            }
+            n0 += bitStream & 3;
+            bitCount += 2;
+            if (n0 > *maxSVPtr) return ERROR(maxSymbolValue_tooSmall);
+            while (charnum < n0) normalizedCounter[charnum++] = 0;
+            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
+                assert((bitCount >> 3) <= 3); /* For first condition to work */
+                ip += bitCount>>3;
+                bitCount &= 7;
+                bitStream = MEM_readLE32(ip) >> bitCount;
+            } else {
+                bitStream >>= 2;
+        }   }
+        {   int const max = (2*threshold-1) - remaining;
+            int count;
+
+            if ((bitStream & (threshold-1)) < (U32)max) {
+                count = bitStream & (threshold-1);
+                bitCount += nbBits-1;
+            } else {
+                count = bitStream & (2*threshold-1);
+                if (count >= threshold) count -= max;
+                bitCount += nbBits;
+            }
+
+            count--;   /* extra accuracy */
+            remaining -= count < 0 ? -count : count;   /* -1 means +1 */
+            normalizedCounter[charnum++] = (short)count;
+            previous0 = !count;
+            while (remaining < threshold) {
+                nbBits--;
+                threshold >>= 1;
+            }
+
+            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
+                ip += bitCount>>3;
+                bitCount &= 7;
+            } else {
+                bitCount -= (int)(8 * (iend - 4 - ip));
+                ip = iend - 4;
+            }
+            bitStream = MEM_readLE32(ip) >> (bitCount & 31);
+    }   }   /* while ((remaining>1) & (charnum<=*maxSVPtr)) */
+    if (remaining != 1) return ERROR(corruption_detected);
+    if (bitCount > 32) return ERROR(corruption_detected);
+    *maxSVPtr = charnum-1;
+
+    ip += (bitCount+7)>>3;
+    return ip-istart;
+}
+
+
+/*! HUF_readStats() :
+    Read compact Huffman tree, saved by HUF_writeCTable().
+    `huffWeight` is destination buffer.
+    `rankStats` is assumed to be a table of at least HUF_TABLELOG_MAX U32.
+    @return : size read from `src` , or an error Code .
+    Note : Needed by HUF_readCTable() and HUF_readDTableX?() .
+*/
+size_t HUF_readStats(BYTE* huffWeight, size_t hwSize, U32* rankStats,
+                     U32* nbSymbolsPtr, U32* tableLogPtr,
+                     const void* src, size_t srcSize)
+{
+    U32 weightTotal;
+    const BYTE* ip = (const BYTE*) src;
+    size_t iSize;
+    size_t oSize;
+
+    if (!srcSize) return ERROR(srcSize_wrong);
+    iSize = ip[0];
+    /* memset(huffWeight, 0, hwSize);   *//* is not necessary, even though some analyzer complain ... */
+
+    if (iSize >= 128) {  /* special header */
+        oSize = iSize - 127;
+        iSize = ((oSize+1)/2);
+        if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
+        if (oSize >= hwSize) return ERROR(corruption_detected);
+        ip += 1;
+        {   U32 n;
+            for (n=0; n<oSize; n+=2) {
+                huffWeight[n]   = ip[n/2] >> 4;
+                huffWeight[n+1] = ip[n/2] & 15;
+    }   }   }
+    else  {   /* header compressed with FSE (normal case) */
+        FSE_DTable fseWorkspace[FSE_DTABLE_SIZE_U32(6)];  /* 6 is max possible tableLog for HUF header (maybe even 5, to be tested) */
+        if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
+        oSize = FSE_decompress_wksp(huffWeight, hwSize-1, ip+1, iSize, fseWorkspace, 6);   /* max (hwSize-1) values decoded, as last one is implied */
+        if (FSE_isError(oSize)) return oSize;
+    }
+
+    /* collect weight stats */
+    memset(rankStats, 0, (HUF_TABLELOG_MAX + 1) * sizeof(U32));
+    weightTotal = 0;
+    {   U32 n; for (n=0; n<oSize; n++) {
+            if (huffWeight[n] >= HUF_TABLELOG_MAX) return ERROR(corruption_detected);
+            rankStats[huffWeight[n]]++;
+            weightTotal += (1 << huffWeight[n]) >> 1;
+    }   }
+    if (weightTotal == 0) return ERROR(corruption_detected);
+
+    /* get last non-null symbol weight (implied, total must be 2^n) */
+    {   U32 const tableLog = BIT_highbit32(weightTotal) + 1;
+        if (tableLog > HUF_TABLELOG_MAX) return ERROR(corruption_detected);
+        *tableLogPtr = tableLog;
+        /* determine last weight */
+        {   U32 const total = 1 << tableLog;
+            U32 const rest = total - weightTotal;
+            U32 const verif = 1 << BIT_highbit32(rest);
+            U32 const lastWeight = BIT_highbit32(rest) + 1;
+            if (verif != rest) return ERROR(corruption_detected);    /* last value must be a clean power of 2 */
+            huffWeight[oSize] = (BYTE)lastWeight;
+            rankStats[lastWeight]++;
+    }   }
+
+    /* check tree construction validity */
+    if ((rankStats[1] < 2) || (rankStats[1] & 1)) return ERROR(corruption_detected);   /* by construction : at least 2 elts of rank 1, must be even */
+
+    /* results */
+    *nbSymbolsPtr = (U32)(oSize+1);
+    return iSize+1;
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/error_private.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/error_private.cpp
new file mode 100644
index 0000000000..5bf2f41f6e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/error_private.cpp
@@ -0,0 +1,59 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+/* The purpose of this file is to have a single list of error strings embedded in binary */
+
+#include "zstd/common/error_private.h"
+
+namespace lbug_zstd {
+
+const char* ERR_getErrorString(ERR_enum code)
+{
+#ifdef ZSTD_STRIP_ERROR_STRINGS
+    (void)code;
+    return "Error strings stripped";
+#else
+    static const char* const notErrorCode = "Unspecified error code";
+    switch( code )
+    {
+    case PREFIX(no_error): return "No error detected";
+    case PREFIX(GENERIC):  return "Error (generic)";
+    case PREFIX(prefix_unknown): return "Unknown frame descriptor";
+    case PREFIX(version_unsupported): return "Version not supported";
+    case PREFIX(frameParameter_unsupported): return "Unsupported frame parameter";
+    case PREFIX(frameParameter_windowTooLarge): return "Frame requires too much memory for decoding";
+    case PREFIX(corruption_detected): return "Corrupted block detected";
+    case PREFIX(checksum_wrong): return "Restored data doesn't match checksum";
+    case PREFIX(parameter_unsupported): return "Unsupported parameter";
+    case PREFIX(parameter_outOfBound): return "Parameter is out of bound";
+    case PREFIX(init_missing): return "Context should be init first";
+    case PREFIX(memory_allocation): return "Allocation error : not enough memory";
+    case PREFIX(workSpace_tooSmall): return "workSpace buffer is not large enough";
+    case PREFIX(stage_wrong): return "Operation not authorized at current processing stage";
+    case PREFIX(tableLog_tooLarge): return "tableLog requires too much memory : unsupported";
+    case PREFIX(maxSymbolValue_tooLarge): return "Unsupported max Symbol Value : too large";
+    case PREFIX(maxSymbolValue_tooSmall): return "Specified maxSymbolValue is too small";
+    case PREFIX(dictionary_corrupted): return "Dictionary is corrupted";
+    case PREFIX(dictionary_wrong): return "Dictionary mismatch";
+    case PREFIX(dictionaryCreation_failed): return "Cannot create Dictionary from provided samples";
+    case PREFIX(dstSize_tooSmall): return "Destination buffer is too small";
+    case PREFIX(srcSize_wrong): return "Src size is incorrect";
+    case PREFIX(dstBuffer_null): return "Operation on NULL destination buffer";
+        /* following error codes are not stable and may be removed or changed in a future version */
+    case PREFIX(frameIndex_tooLarge): return "Frame index is too large";
+    case PREFIX(seekableIO): return "An I/O error occurred when reading/seeking";
+    case PREFIX(dstBuffer_wrong): return "Destination buffer is wrong";
+    case PREFIX(maxCode):
+    default: return notErrorCode;
+    }
+#endif
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/fse_decompress.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/fse_decompress.cpp
new file mode 100644
index 0000000000..5de912dc14
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/fse_decompress.cpp
@@ -0,0 +1,287 @@
+/* ******************************************************************
+ * FSE : Finite State Entropy decoder
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ *  You can contact the author at :
+ *  - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *  - Public forum : https://groups.google.com/forum/#!forum/lz4c
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+
+/* **************************************************************
+*  Includes
+****************************************************************/
+#include <stdlib.h>     /* malloc, free, qsort */
+#include <string.h>     /* memcpy, memset */
+#include "zstd/common/bitstream.h"
+#include "zstd/common/compiler.h"
+#include "zstd/common/fse.h"
+#include "zstd/common/fse_static.h"
+#include "zstd/common/error_private.h"
+
+
+/* **************************************************************
+*  Error Management
+****************************************************************/
+// #define FSE_isError ERR_isError
+#define FSE_STATIC_ASSERT(c) DEBUG_STATIC_ASSERT(c)   /* use only *after* variable declarations */
+
+
+/* **************************************************************
+*  Templates
+****************************************************************/
+/*
+  designed to be included
+  for type-specific functions (template emulation in C)
+  Objective is to write these functions only once, for improved maintenance
+*/
+
+/* safety checks */
+#ifndef FSE_FUNCTION_EXTENSION
+#  error "FSE_FUNCTION_EXTENSION must be defined"
+#endif
+#ifndef FSE_FUNCTION_TYPE
+#  error "FSE_FUNCTION_TYPE must be defined"
+#endif
+
+/* Function names */
+#define FSE_CAT(X,Y) X##Y
+#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)
+#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)
+
+namespace lbug_zstd {
+
+/* Function templates */
+FSE_DTable* FSE_createDTable (unsigned tableLog)
+{
+    if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
+    return (FSE_DTable*)malloc( FSE_DTABLE_SIZE_U32(tableLog) * sizeof (U32) );
+}
+
+void FSE_freeDTable (FSE_DTable* dt)
+{
+    free(dt);
+}
+
+size_t FSE_buildDTable(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
+{
+    void* const tdPtr = dt+1;   /* because *dt is unsigned, 32-bits aligned on 32-bits */
+    FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*) (tdPtr);
+    U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];
+
+    U32 const maxSV1 = maxSymbolValue + 1;
+    U32 const tableSize = 1 << tableLog;
+    U32 highThreshold = tableSize-1;
+
+    /* Sanity Checks */
+    if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return ERROR(maxSymbolValue_tooLarge);
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
+
+    /* Init, lay down lowprob symbols */
+    {   FSE_DTableHeader DTableH;
+        DTableH.tableLog = (U16)tableLog;
+        DTableH.fastMode = 1;
+        {   S16 const largeLimit= (S16)(1 << (tableLog-1));
+            U32 s;
+            for (s=0; s<maxSV1; s++) {
+                if (normalizedCounter[s]==-1) {
+                    tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;
+                    symbolNext[s] = 1;
+                } else {
+                    if (normalizedCounter[s] >= largeLimit) DTableH.fastMode=0;
+                    symbolNext[s] = normalizedCounter[s];
+        }   }   }
+        memcpy(dt, &DTableH, sizeof(DTableH));
+    }
+
+    /* Spread symbols */
+    {   U32 const tableMask = tableSize-1;
+        U32 const step = FSE_TABLESTEP(tableSize);
+        U32 s, position = 0;
+        for (s=0; s<maxSV1; s++) {
+            int i;
+            for (i=0; i<normalizedCounter[s]; i++) {
+                tableDecode[position].symbol = (FSE_FUNCTION_TYPE)s;
+                position = (position + step) & tableMask;
+                while (position > highThreshold) position = (position + step) & tableMask;   /* lowprob area */
+        }   }
+        if (position!=0) return ERROR(GENERIC);   /* position must reach all cells once, otherwise normalizedCounter is incorrect */
+    }
+
+    /* Build Decoding table */
+    {   U32 u;
+        for (u=0; u<tableSize; u++) {
+            FSE_FUNCTION_TYPE const symbol = (FSE_FUNCTION_TYPE)(tableDecode[u].symbol);
+            U32 const nextState = symbolNext[symbol]++;
+            tableDecode[u].nbBits = (BYTE) (tableLog - BIT_highbit32(nextState) );
+            tableDecode[u].newState = (U16) ( (nextState << tableDecode[u].nbBits) - tableSize);
+    }   }
+
+    return 0;
+}
+
+
+#ifndef FSE_COMMONDEFS_ONLY
+
+/*-*******************************************************
+*  Decompression (Byte symbols)
+*********************************************************/
+size_t FSE_buildDTable_rle (FSE_DTable* dt, BYTE symbolValue)
+{
+    void* ptr = dt;
+    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
+    void* dPtr = dt + 1;
+    FSE_decode_t* const cell = (FSE_decode_t*)dPtr;
+
+    DTableH->tableLog = 0;
+    DTableH->fastMode = 0;
+
+    cell->newState = 0;
+    cell->symbol = symbolValue;
+    cell->nbBits = 0;
+
+    return 0;
+}
+
+
+size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits)
+{
+    void* ptr = dt;
+    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
+    void* dPtr = dt + 1;
+    FSE_decode_t* const dinfo = (FSE_decode_t*)dPtr;
+    const unsigned tableSize = 1 << nbBits;
+    const unsigned tableMask = tableSize - 1;
+    const unsigned maxSV1 = tableMask+1;
+    unsigned s;
+
+    /* Sanity checks */
+    if (nbBits < 1) return ERROR(GENERIC);         /* min size */
+
+    /* Build Decoding Table */
+    DTableH->tableLog = (U16)nbBits;
+    DTableH->fastMode = 1;
+    for (s=0; s<maxSV1; s++) {
+        dinfo[s].newState = 0;
+        dinfo[s].symbol = (BYTE)s;
+        dinfo[s].nbBits = (BYTE)nbBits;
+    }
+
+    return 0;
+}
+
+FORCE_INLINE_TEMPLATE size_t FSE_decompress_usingDTable_generic(
+          void* dst, size_t maxDstSize,
+    const void* cSrc, size_t cSrcSize,
+    const FSE_DTable* dt, const unsigned fast)
+{
+    BYTE* const ostart = (BYTE*) dst;
+    BYTE* op = ostart;
+    BYTE* const omax = op + maxDstSize;
+    BYTE* const olimit = omax-3;
+
+    BIT_DStream_t bitD;
+    FSE_DState_t state1;
+    FSE_DState_t state2;
+
+    /* Init */
+    CHECK_F(BIT_initDStream(&bitD, cSrc, cSrcSize));
+
+    FSE_initDState(&state1, &bitD, dt);
+    FSE_initDState(&state2, &bitD, dt);
+
+#define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)
+
+    /* 4 symbols per loop */
+    for ( ; (BIT_reloadDStream(&bitD)==BIT_DStream_unfinished) & (op<olimit) ; op+=4) {
+        op[0] = FSE_GETSYMBOL(&state1);
+
+        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
+            BIT_reloadDStream(&bitD);
+
+        op[1] = FSE_GETSYMBOL(&state2);
+
+        if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
+            { if (BIT_reloadDStream(&bitD) > BIT_DStream_unfinished) { op+=2; break; } }
+
+        op[2] = FSE_GETSYMBOL(&state1);
+
+        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
+            BIT_reloadDStream(&bitD);
+
+        op[3] = FSE_GETSYMBOL(&state2);
+    }
+
+    /* tail */
+    /* note : BIT_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly BIT_DStream_completed */
+    while (1) {
+        if (op>(omax-2)) return ERROR(dstSize_tooSmall);
+        *op++ = FSE_GETSYMBOL(&state1);
+        if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
+            *op++ = FSE_GETSYMBOL(&state2);
+            break;
+        }
+
+        if (op>(omax-2)) return ERROR(dstSize_tooSmall);
+        *op++ = FSE_GETSYMBOL(&state2);
+        if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
+            *op++ = FSE_GETSYMBOL(&state1);
+            break;
+    }   }
+
+    return op-ostart;
+}
+
+
+size_t FSE_decompress_usingDTable(void* dst, size_t originalSize,
+                            const void* cSrc, size_t cSrcSize,
+                            const FSE_DTable* dt)
+{
+    const void* ptr = dt;
+    const FSE_DTableHeader* DTableH = (const FSE_DTableHeader*)ptr;
+    const U32 fastMode = DTableH->fastMode;
+
+    /* select fast mode (static) */
+    if (fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
+    return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
+}
+
+
+size_t FSE_decompress_wksp(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, FSE_DTable* workSpace, unsigned maxLog)
+{
+    const BYTE* const istart = (const BYTE*)cSrc;
+    const BYTE* ip = istart;
+    short counting[FSE_MAX_SYMBOL_VALUE+1];
+    unsigned tableLog;
+    unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
+
+    /* normal FSE decoding mode */
+    size_t const NCountLength = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
+    if (FSE_isError(NCountLength)) return NCountLength;
+    /* if (NCountLength >= cSrcSize) return ERROR(srcSize_wrong); */  /* too small input size; supposed to be already checked in NCountLength, only remaining case : NCountLength==cSrcSize */
+    if (tableLog > maxLog) return ERROR(tableLog_tooLarge);
+    ip += NCountLength;
+    cSrcSize -= NCountLength;
+
+    CHECK_F( FSE_buildDTable (workSpace, counting, maxSymbolValue, tableLog) );
+
+    return FSE_decompress_usingDTable (dst, dstCapacity, ip, cSrcSize, workSpace);   /* always return, even if it is an error code */
+}
+
+
+typedef FSE_DTable DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];
+
+size_t FSE_decompress(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize)
+{
+    DTable_max_t dt;   /* Static analyzer seems unable to understand this table will be properly initialized later */
+    return FSE_decompress_wksp(dst, dstCapacity, cSrc, cSrcSize, dt, FSE_MAX_TABLELOG);
+}
+
+}
+
+#endif   /* FSE_COMMONDEFS_ONLY */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/xxhash.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/xxhash.cpp
new file mode 100644
index 0000000000..ad9481cbcd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/xxhash.cpp
@@ -0,0 +1,859 @@
+/*
+ *  xxHash - Fast Hash algorithm
+ *  Copyright (c) 2012-2020, Yann Collet, Facebook, Inc.
+ *
+ *  You can contact the author at :
+ *  - xxHash homepage: http://www.xxhash.com
+ *  - xxHash source repository : https://github.com/Cyan4973/xxHash
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+*/
+
+
+/* *************************************
+*  Tuning parameters
+***************************************/
+/*!XXH_FORCE_MEMORY_ACCESS :
+ * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
+ * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
+ * The below switch allow to select different access method for improved performance.
+ * Method 0 (default) : use `memcpy()`. Safe and portable.
+ * Method 1 : `__packed` statement. It depends on compiler extension (ie, not portable).
+ *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
+ * Method 2 : direct access. This method doesn't depend on compiler but violate C standard.
+ *            It can generate buggy code on targets which do not support unaligned memory accesses.
+ *            But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)
+ * See http://stackoverflow.com/a/32095106/646947 for details.
+ * Prefer these methods in priority order (0 > 1 > 2)
+ */
+#ifndef XXH_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
+#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
+#    define XXH_FORCE_MEMORY_ACCESS 2
+#  elif (defined(__INTEL_COMPILER) && !defined(WIN32)) || \
+  (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) )) || \
+  defined(__ICCARM__)
+#    define XXH_FORCE_MEMORY_ACCESS 1
+#  endif
+#endif
+
+/*!XXH_ACCEPT_NULL_INPUT_POINTER :
+ * If the input pointer is a null pointer, xxHash default behavior is to trigger a memory access error, since it is a bad pointer.
+ * When this option is enabled, xxHash output for null input pointers will be the same as a null-length input.
+ * By default, this option is disabled. To enable it, uncomment below define :
+ */
+/* #define XXH_ACCEPT_NULL_INPUT_POINTER 1 */
+
+/*!XXH_FORCE_NATIVE_FORMAT :
+ * By default, xxHash library provides endian-independent Hash values, based on little-endian convention.
+ * Results are therefore identical for little-endian and big-endian CPU.
+ * This comes at a performance cost for big-endian CPU, since some swapping is required to emulate little-endian format.
+ * Should endian-independence be of no importance for your application, you may set the #define below to 1,
+ * to improve speed for Big-endian CPU.
+ * This option has no impact on Little_Endian CPU.
+ */
+#ifndef XXH_FORCE_NATIVE_FORMAT   /* can be defined externally */
+#  define XXH_FORCE_NATIVE_FORMAT 0
+#endif
+
+/*!XXH_FORCE_ALIGN_CHECK :
+ * This is a minor performance trick, only useful with lots of very small keys.
+ * It means : check for aligned/unaligned input.
+ * The check costs one initial branch per hash; set to 0 when the input data
+ * is guaranteed to be aligned.
+ */
+#ifndef XXH_FORCE_ALIGN_CHECK /* can be defined externally */
+#  if defined(__i386) || defined(_M_IX86) || defined(__x86_64__) || defined(_M_X64)
+#    define XXH_FORCE_ALIGN_CHECK 0
+#  else
+#    define XXH_FORCE_ALIGN_CHECK 1
+#  endif
+#endif
+
+
+/* *************************************
+*  Includes & Memory related functions
+***************************************/
+/* Modify the local functions below should you wish to use some other memory routines */
+/* for malloc(), free() */
+#include <stdlib.h>
+#include <stddef.h>     /* size_t */
+/* for memcpy() */
+#include <string.h>
+
+#include "zstd/common/xxhash.h"
+#include "zstd/common/xxhash_static.h"
+
+/* *************************************
+*  Compiler Specific Options
+***************************************/
+#if (defined(__GNUC__) && !defined(__STRICT_ANSI__)) || defined(__cplusplus) || defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
+#  define INLINE_KEYWORD inline
+#else
+#  define INLINE_KEYWORD
+#endif
+
+#if defined(__GNUC__) || defined(__ICCARM__)
+#  define FORCE_INLINE_ATTR __attribute__((always_inline))
+#elif defined(_MSC_VER)
+#  define FORCE_INLINE_ATTR __forceinline
+#else
+#  define FORCE_INLINE_ATTR
+#endif
+
+#define FORCE_INLINE_TEMPLATE static INLINE_KEYWORD FORCE_INLINE_ATTR
+
+
+/* *************************************
+*  Basic Types
+***************************************/
+#ifndef MEM_MODULE
+# define MEM_MODULE
+# if !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
+#   include <stdint.h>
+    typedef uint8_t  BYTE;
+    typedef uint16_t U16;
+    typedef uint32_t U32;
+    typedef  int32_t S32;
+    typedef uint64_t U64;
+#  else
+    typedef unsigned char      BYTE;
+    typedef unsigned short     U16;
+    typedef unsigned int       U32;
+    typedef   signed int       S32;
+    typedef unsigned long long U64;   /* if your compiler doesn't support unsigned long long, replace by another 64-bit type here. Note that xxhash.h will also need to be updated. */
+#  endif
+#endif
+
+namespace lbug_zstd {
+static void* XXH_malloc(size_t s) { return malloc(s); }
+static void  XXH_free  (void* p)  { free(p); }
+static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcpy(dest,src,size); }
+
+#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==2))
+
+/* Force direct memory access. Only works on CPU which support unaligned memory access in hardware */
+static U32 XXH_read32(const void* memPtr) { return *(const U32*) memPtr; }
+static U64 XXH_read64(const void* memPtr) { return *(const U64*) memPtr; }
+
+#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==1))
+
+/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
+/* currently only defined for gcc and icc */
+typedef union { U32 u32; U64 u64; } __attribute__((packed)) unalign;
+
+static U32 XXH_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }
+static U64 XXH_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }
+
+#else
+
+/* portable and safe solution. Generally efficient.
+ * see : http://stackoverflow.com/a/32095106/646947
+ */
+
+static U32 XXH_read32(const void* memPtr)
+{
+    U32 val;
+    memcpy(&val, memPtr, sizeof(val));
+    return val;
+}
+
+static U64 XXH_read64(const void* memPtr)
+{
+    U64 val;
+    memcpy(&val, memPtr, sizeof(val));
+    return val;
+}
+
+#endif   /* XXH_FORCE_DIRECT_MEMORY_ACCESS */
+
+
+/* ****************************************
+*  Compiler-specific Functions and Macros
+******************************************/
+#define GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)
+
+/* Note : although _rotl exists for minGW (GCC under windows), performance seems poor */
+#if defined(_MSC_VER)
+#  define XXH_rotl32(x,r) _rotl(x,r)
+#  define XXH_rotl64(x,r) _rotl64(x,r)
+#else
+#if defined(__ICCARM__)
+#  include <intrinsics.h>
+#  define XXH_rotl32(x,r) __ROR(x,(32 - r))
+#else
+#  define XXH_rotl32(x,r) ((x << r) | (x >> (32 - r)))
+#endif
+#  define XXH_rotl64(x,r) ((x << r) | (x >> (64 - r)))
+#endif
+
+#if defined(_MSC_VER)     /* Visual Studio */
+#  define XXH_swap32 _byteswap_ulong
+#  define XXH_swap64 _byteswap_uint64
+#elif GCC_VERSION >= 403
+#  define XXH_swap32 __builtin_bswap32
+#  define XXH_swap64 __builtin_bswap64
+#else
+static U32 XXH_swap32 (U32 x)
+{
+    return  ((x << 24) & 0xff000000 ) |
+            ((x <<  8) & 0x00ff0000 ) |
+            ((x >>  8) & 0x0000ff00 ) |
+            ((x >> 24) & 0x000000ff );
+}
+static U64 XXH_swap64 (U64 x)
+{
+    return  ((x << 56) & 0xff00000000000000ULL) |
+            ((x << 40) & 0x00ff000000000000ULL) |
+            ((x << 24) & 0x0000ff0000000000ULL) |
+            ((x << 8)  & 0x000000ff00000000ULL) |
+            ((x >> 8)  & 0x00000000ff000000ULL) |
+            ((x >> 24) & 0x0000000000ff0000ULL) |
+            ((x >> 40) & 0x000000000000ff00ULL) |
+            ((x >> 56) & 0x00000000000000ffULL);
+}
+#endif
+
+
+/* *************************************
+*  Architecture Macros
+***************************************/
+typedef enum { XXH_bigEndian=0, XXH_littleEndian=1 } XXH_endianess;
+
+/* XXH_CPU_LITTLE_ENDIAN can be defined externally, for example on the compiler command line */
+#ifndef XXH_CPU_LITTLE_ENDIAN
+    static const int g_one = 1;
+#   define XXH_CPU_LITTLE_ENDIAN   (*(const char*)(&g_one))
+#endif
+
+
+/* ***************************
+*  Memory reads
+*****************************/
+typedef enum { XXH_aligned, XXH_unaligned } XXH_alignment;
+
+FORCE_INLINE_TEMPLATE U32 XXH_readLE32_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
+{
+    if (align==XXH_unaligned)
+        return endian==XXH_littleEndian ? XXH_read32(ptr) : XXH_swap32(XXH_read32(ptr));
+    else
+        return endian==XXH_littleEndian ? *(const U32*)ptr : XXH_swap32(*(const U32*)ptr);
+}
+
+FORCE_INLINE_TEMPLATE U32 XXH_readLE32(const void* ptr, XXH_endianess endian)
+{
+    return XXH_readLE32_align(ptr, endian, XXH_unaligned);
+}
+
+static U32 XXH_readBE32(const void* ptr)
+{
+    return XXH_CPU_LITTLE_ENDIAN ? XXH_swap32(XXH_read32(ptr)) : XXH_read32(ptr);
+}
+
+FORCE_INLINE_TEMPLATE U64 XXH_readLE64_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
+{
+    if (align==XXH_unaligned)
+        return endian==XXH_littleEndian ? XXH_read64(ptr) : XXH_swap64(XXH_read64(ptr));
+    else
+        return endian==XXH_littleEndian ? *(const U64*)ptr : XXH_swap64(*(const U64*)ptr);
+}
+
+FORCE_INLINE_TEMPLATE U64 XXH_readLE64(const void* ptr, XXH_endianess endian)
+{
+    return XXH_readLE64_align(ptr, endian, XXH_unaligned);
+}
+
+static U64 XXH_readBE64(const void* ptr)
+{
+    return XXH_CPU_LITTLE_ENDIAN ? XXH_swap64(XXH_read64(ptr)) : XXH_read64(ptr);
+}
+
+
+/* *************************************
+*  Macros
+***************************************/
+#define XXH_STATIC_ASSERT(c)   { enum { XXH_static_assert = 1/(int)(!!(c)) }; }    /* use only *after* variable declarations */
+
+
+/* *************************************
+*  Constants
+***************************************/
+static const U32 PRIME32_1 = 2654435761U;
+static const U32 PRIME32_2 = 2246822519U;
+static const U32 PRIME32_3 = 3266489917U;
+static const U32 PRIME32_4 =  668265263U;
+static const U32 PRIME32_5 =  374761393U;
+
+static const U64 PRIME64_1 = 11400714785074694791ULL;
+static const U64 PRIME64_2 = 14029467366897019727ULL;
+static const U64 PRIME64_3 =  1609587929392839161ULL;
+static const U64 PRIME64_4 =  9650029242287828579ULL;
+static const U64 PRIME64_5 =  2870177450012600261ULL;
+
+XXH_PUBLIC_API unsigned XXH_versionNumber (void) { return XXH_VERSION_NUMBER; }
+
+
+/* **************************
+*  Utils
+****************************/
+XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* __restrict dstState, const XXH32_state_t* __restrict srcState)
+{
+    memcpy(dstState, srcState, sizeof(*dstState));
+}
+
+XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* __restrict dstState, const XXH64_state_t* __restrict srcState)
+{
+    memcpy(dstState, srcState, sizeof(*dstState));
+}
+
+
+/* ***************************
+*  Simple Hash Functions
+*****************************/
+
+static U32 XXH32_round(U32 seed, U32 input)
+{
+    seed += input * PRIME32_2;
+    seed  = XXH_rotl32(seed, 13);
+    seed *= PRIME32_1;
+    return seed;
+}
+
+FORCE_INLINE_TEMPLATE U32 XXH32_endian_align(const void* input, size_t len, U32 seed, XXH_endianess endian, XXH_alignment align)
+{
+    const BYTE* p = (const BYTE*)input;
+    const BYTE* bEnd = p + len;
+    U32 h32;
+#define XXH_get32bits(p) XXH_readLE32_align(p, endian, align)
+
+#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
+    if (p==NULL) {
+        len=0;
+        bEnd=p=(const BYTE*)(size_t)16;
+    }
+#endif
+
+    if (len>=16) {
+        const BYTE* const limit = bEnd - 16;
+        U32 v1 = seed + PRIME32_1 + PRIME32_2;
+        U32 v2 = seed + PRIME32_2;
+        U32 v3 = seed + 0;
+        U32 v4 = seed - PRIME32_1;
+
+        do {
+            v1 = XXH32_round(v1, XXH_get32bits(p)); p+=4;
+            v2 = XXH32_round(v2, XXH_get32bits(p)); p+=4;
+            v3 = XXH32_round(v3, XXH_get32bits(p)); p+=4;
+            v4 = XXH32_round(v4, XXH_get32bits(p)); p+=4;
+        } while (p<=limit);
+
+        h32 = XXH_rotl32(v1, 1) + XXH_rotl32(v2, 7) + XXH_rotl32(v3, 12) + XXH_rotl32(v4, 18);
+    } else {
+        h32  = seed + PRIME32_5;
+    }
+
+    h32 += (U32) len;
+
+    while (p+4<=bEnd) {
+        h32 += XXH_get32bits(p) * PRIME32_3;
+        h32  = XXH_rotl32(h32, 17) * PRIME32_4 ;
+        p+=4;
+    }
+
+    while (p<bEnd) {
+        h32 += (*p) * PRIME32_5;
+        h32 = XXH_rotl32(h32, 11) * PRIME32_1 ;
+        p++;
+    }
+
+    h32 ^= h32 >> 15;
+    h32 *= PRIME32_2;
+    h32 ^= h32 >> 13;
+    h32 *= PRIME32_3;
+    h32 ^= h32 >> 16;
+
+    return h32;
+}
+
+
+XXH_PUBLIC_API unsigned int XXH32 (const void* input, size_t len, unsigned int seed)
+{
+#if 0
+    /* Simple version, good for code maintenance, but unfortunately slow for small inputs */
+    XXH32_CREATESTATE_STATIC(state);
+    XXH32_reset(state, seed);
+    XXH32_update(state, input, len);
+    return XXH32_digest(state);
+#else
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if (XXH_FORCE_ALIGN_CHECK) {
+        if ((((size_t)input) & 3) == 0) {   /* Input is 4-bytes aligned, leverage the speed benefit */
+            if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+                return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
+            else
+                return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
+    }   }
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
+    else
+        return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
+#endif
+}
+
+
+static U64 XXH64_round(U64 acc, U64 input)
+{
+    acc += input * PRIME64_2;
+    acc  = XXH_rotl64(acc, 31);
+    acc *= PRIME64_1;
+    return acc;
+}
+
+static U64 XXH64_mergeRound(U64 acc, U64 val)
+{
+    val  = XXH64_round(0, val);
+    acc ^= val;
+    acc  = acc * PRIME64_1 + PRIME64_4;
+    return acc;
+}
+
+FORCE_INLINE_TEMPLATE U64 XXH64_endian_align(const void* input, size_t len, U64 seed, XXH_endianess endian, XXH_alignment align)
+{
+    const BYTE* p = (const BYTE*)input;
+    const BYTE* const bEnd = p + len;
+    U64 h64;
+#define XXH_get64bits(p) XXH_readLE64_align(p, endian, align)
+
+#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
+    if (p==NULL) {
+        len=0;
+        bEnd=p=(const BYTE*)(size_t)32;
+    }
+#endif
+
+    if (len>=32) {
+        const BYTE* const limit = bEnd - 32;
+        U64 v1 = seed + PRIME64_1 + PRIME64_2;
+        U64 v2 = seed + PRIME64_2;
+        U64 v3 = seed + 0;
+        U64 v4 = seed - PRIME64_1;
+
+        do {
+            v1 = XXH64_round(v1, XXH_get64bits(p)); p+=8;
+            v2 = XXH64_round(v2, XXH_get64bits(p)); p+=8;
+            v3 = XXH64_round(v3, XXH_get64bits(p)); p+=8;
+            v4 = XXH64_round(v4, XXH_get64bits(p)); p+=8;
+        } while (p<=limit);
+
+        h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
+        h64 = XXH64_mergeRound(h64, v1);
+        h64 = XXH64_mergeRound(h64, v2);
+        h64 = XXH64_mergeRound(h64, v3);
+        h64 = XXH64_mergeRound(h64, v4);
+
+    } else {
+        h64  = seed + PRIME64_5;
+    }
+
+    h64 += (U64) len;
+
+    while (p+8<=bEnd) {
+        U64 const k1 = XXH64_round(0, XXH_get64bits(p));
+        h64 ^= k1;
+        h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
+        p+=8;
+    }
+
+    if (p+4<=bEnd) {
+        h64 ^= (U64)(XXH_get32bits(p)) * PRIME64_1;
+        h64 = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
+        p+=4;
+    }
+
+    while (p<bEnd) {
+        h64 ^= (*p) * PRIME64_5;
+        h64 = XXH_rotl64(h64, 11) * PRIME64_1;
+        p++;
+    }
+
+    h64 ^= h64 >> 33;
+    h64 *= PRIME64_2;
+    h64 ^= h64 >> 29;
+    h64 *= PRIME64_3;
+    h64 ^= h64 >> 32;
+
+    return h64;
+}
+
+
+XXH_PUBLIC_API unsigned long long XXH64 (const void* input, size_t len, unsigned long long seed)
+{
+#if 0
+    /* Simple version, good for code maintenance, but unfortunately slow for small inputs */
+    XXH64_CREATESTATE_STATIC(state);
+    XXH64_reset(state, seed);
+    XXH64_update(state, input, len);
+    return XXH64_digest(state);
+#else
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if (XXH_FORCE_ALIGN_CHECK) {
+        if ((((size_t)input) & 7)==0) {  /* Input is aligned, let's leverage the speed advantage */
+            if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+                return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
+            else
+                return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
+    }   }
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
+    else
+        return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
+#endif
+}
+
+
+/* **************************************************
+*  Advanced Hash Functions
+****************************************************/
+
+XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void)
+{
+    return (XXH32_state_t*)XXH_malloc(sizeof(XXH32_state_t));
+}
+XXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr)
+{
+    XXH_free(statePtr);
+    return XXH_OK;
+}
+
+XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void)
+{
+    return (XXH64_state_t*)XXH_malloc(sizeof(XXH64_state_t));
+}
+XXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr)
+{
+    XXH_free(statePtr);
+    return XXH_OK;
+}
+
+
+/*** Hash feed ***/
+
+XXH_PUBLIC_API XXH_errorcode XXH32_reset(XXH32_state_t* statePtr, unsigned int seed)
+{
+    XXH32_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
+    memset(&state, 0, sizeof(state)-4);   /* do not write into reserved, for future removal */
+    state.v1 = seed + PRIME32_1 + PRIME32_2;
+    state.v2 = seed + PRIME32_2;
+    state.v3 = seed + 0;
+    state.v4 = seed - PRIME32_1;
+    memcpy(statePtr, &state, sizeof(state));
+    return XXH_OK;
+}
+
+
+XXH_PUBLIC_API XXH_errorcode XXH64_reset(XXH64_state_t* statePtr, unsigned long long seed)
+{
+    XXH64_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
+    memset(&state, 0, sizeof(state)-8);   /* do not write into reserved, for future removal */
+    state.v1 = seed + PRIME64_1 + PRIME64_2;
+    state.v2 = seed + PRIME64_2;
+    state.v3 = seed + 0;
+    state.v4 = seed - PRIME64_1;
+    memcpy(statePtr, &state, sizeof(state));
+    return XXH_OK;
+}
+
+
+FORCE_INLINE_TEMPLATE XXH_errorcode XXH32_update_endian (XXH32_state_t* state, const void* input, size_t len, XXH_endianess endian)
+{
+    const BYTE* p = (const BYTE*)input;
+    const BYTE* const bEnd = p + len;
+
+#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
+    if (input==NULL) return XXH_ERROR;
+#endif
+
+    state->total_len_32 += (unsigned)len;
+    state->large_len |= (len>=16) | (state->total_len_32>=16);
+
+    if (state->memsize + len < 16)  {   /* fill in tmp buffer */
+        XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, len);
+        state->memsize += (unsigned)len;
+        return XXH_OK;
+    }
+
+    if (state->memsize) {   /* some data left from previous update */
+        XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, 16-state->memsize);
+        {   const U32* p32 = state->mem32;
+            state->v1 = XXH32_round(state->v1, XXH_readLE32(p32, endian)); p32++;
+            state->v2 = XXH32_round(state->v2, XXH_readLE32(p32, endian)); p32++;
+            state->v3 = XXH32_round(state->v3, XXH_readLE32(p32, endian)); p32++;
+            state->v4 = XXH32_round(state->v4, XXH_readLE32(p32, endian)); p32++;
+        }
+        p += 16-state->memsize;
+        state->memsize = 0;
+    }
+
+    if (p <= bEnd-16) {
+        const BYTE* const limit = bEnd - 16;
+        U32 v1 = state->v1;
+        U32 v2 = state->v2;
+        U32 v3 = state->v3;
+        U32 v4 = state->v4;
+
+        do {
+            v1 = XXH32_round(v1, XXH_readLE32(p, endian)); p+=4;
+            v2 = XXH32_round(v2, XXH_readLE32(p, endian)); p+=4;
+            v3 = XXH32_round(v3, XXH_readLE32(p, endian)); p+=4;
+            v4 = XXH32_round(v4, XXH_readLE32(p, endian)); p+=4;
+        } while (p<=limit);
+
+        state->v1 = v1;
+        state->v2 = v2;
+        state->v3 = v3;
+        state->v4 = v4;
+    }
+
+    if (p < bEnd) {
+        XXH_memcpy(state->mem32, p, (size_t)(bEnd-p));
+        state->memsize = (unsigned)(bEnd-p);
+    }
+
+    return XXH_OK;
+}
+
+XXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* state_in, const void* input, size_t len)
+{
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH32_update_endian(state_in, input, len, XXH_littleEndian);
+    else
+        return XXH32_update_endian(state_in, input, len, XXH_bigEndian);
+}
+
+
+
+FORCE_INLINE_TEMPLATE U32 XXH32_digest_endian (const XXH32_state_t* state, XXH_endianess endian)
+{
+    const BYTE * p = (const BYTE*)state->mem32;
+    const BYTE* const bEnd = (const BYTE*)(state->mem32) + state->memsize;
+    U32 h32;
+
+    if (state->large_len) {
+        h32 = XXH_rotl32(state->v1, 1) + XXH_rotl32(state->v2, 7) + XXH_rotl32(state->v3, 12) + XXH_rotl32(state->v4, 18);
+    } else {
+        h32 = state->v3 /* == seed */ + PRIME32_5;
+    }
+
+    h32 += state->total_len_32;
+
+    while (p+4<=bEnd) {
+        h32 += XXH_readLE32(p, endian) * PRIME32_3;
+        h32  = XXH_rotl32(h32, 17) * PRIME32_4;
+        p+=4;
+    }
+
+    while (p<bEnd) {
+        h32 += (*p) * PRIME32_5;
+        h32  = XXH_rotl32(h32, 11) * PRIME32_1;
+        p++;
+    }
+
+    h32 ^= h32 >> 15;
+    h32 *= PRIME32_2;
+    h32 ^= h32 >> 13;
+    h32 *= PRIME32_3;
+    h32 ^= h32 >> 16;
+
+    return h32;
+}
+
+
+XXH_PUBLIC_API unsigned int XXH32_digest (const XXH32_state_t* state_in)
+{
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH32_digest_endian(state_in, XXH_littleEndian);
+    else
+        return XXH32_digest_endian(state_in, XXH_bigEndian);
+}
+
+
+
+/* **** XXH64 **** */
+
+FORCE_INLINE_TEMPLATE XXH_errorcode XXH64_update_endian (XXH64_state_t* state, const void* input, size_t len, XXH_endianess endian)
+{
+    const BYTE* p = (const BYTE*)input;
+    const BYTE* const bEnd = p + len;
+
+#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
+    if (input==NULL) return XXH_ERROR;
+#endif
+
+    state->total_len += len;
+
+    if (state->memsize + len < 32) {  /* fill in tmp buffer */
+        if (input != NULL) {
+            XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, len);
+        }
+        state->memsize += (U32)len;
+        return XXH_OK;
+    }
+
+    if (state->memsize) {   /* tmp buffer is full */
+        XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, 32-state->memsize);
+        state->v1 = XXH64_round(state->v1, XXH_readLE64(state->mem64+0, endian));
+        state->v2 = XXH64_round(state->v2, XXH_readLE64(state->mem64+1, endian));
+        state->v3 = XXH64_round(state->v3, XXH_readLE64(state->mem64+2, endian));
+        state->v4 = XXH64_round(state->v4, XXH_readLE64(state->mem64+3, endian));
+        p += 32-state->memsize;
+        state->memsize = 0;
+    }
+
+    if (p+32 <= bEnd) {
+        const BYTE* const limit = bEnd - 32;
+        U64 v1 = state->v1;
+        U64 v2 = state->v2;
+        U64 v3 = state->v3;
+        U64 v4 = state->v4;
+
+        do {
+            v1 = XXH64_round(v1, XXH_readLE64(p, endian)); p+=8;
+            v2 = XXH64_round(v2, XXH_readLE64(p, endian)); p+=8;
+            v3 = XXH64_round(v3, XXH_readLE64(p, endian)); p+=8;
+            v4 = XXH64_round(v4, XXH_readLE64(p, endian)); p+=8;
+        } while (p<=limit);
+
+        state->v1 = v1;
+        state->v2 = v2;
+        state->v3 = v3;
+        state->v4 = v4;
+    }
+
+    if (p < bEnd) {
+        XXH_memcpy(state->mem64, p, (size_t)(bEnd-p));
+        state->memsize = (unsigned)(bEnd-p);
+    }
+
+    return XXH_OK;
+}
+
+XXH_PUBLIC_API XXH_errorcode XXH64_update (XXH64_state_t* state_in, const void* input, size_t len)
+{
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH64_update_endian(state_in, input, len, XXH_littleEndian);
+    else
+        return XXH64_update_endian(state_in, input, len, XXH_bigEndian);
+}
+
+
+
+FORCE_INLINE_TEMPLATE U64 XXH64_digest_endian (const XXH64_state_t* state, XXH_endianess endian)
+{
+    const BYTE * p = (const BYTE*)state->mem64;
+    const BYTE* const bEnd = (const BYTE*)state->mem64 + state->memsize;
+    U64 h64;
+
+    if (state->total_len >= 32) {
+        U64 const v1 = state->v1;
+        U64 const v2 = state->v2;
+        U64 const v3 = state->v3;
+        U64 const v4 = state->v4;
+
+        h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
+        h64 = XXH64_mergeRound(h64, v1);
+        h64 = XXH64_mergeRound(h64, v2);
+        h64 = XXH64_mergeRound(h64, v3);
+        h64 = XXH64_mergeRound(h64, v4);
+    } else {
+        h64  = state->v3 + PRIME64_5;
+    }
+
+    h64 += (U64) state->total_len;
+
+    while (p+8<=bEnd) {
+        U64 const k1 = XXH64_round(0, XXH_readLE64(p, endian));
+        h64 ^= k1;
+        h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
+        p+=8;
+    }
+
+    if (p+4<=bEnd) {
+        h64 ^= (U64)(XXH_readLE32(p, endian)) * PRIME64_1;
+        h64  = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
+        p+=4;
+    }
+
+    while (p<bEnd) {
+        h64 ^= (*p) * PRIME64_5;
+        h64  = XXH_rotl64(h64, 11) * PRIME64_1;
+        p++;
+    }
+
+    h64 ^= h64 >> 33;
+    h64 *= PRIME64_2;
+    h64 ^= h64 >> 29;
+    h64 *= PRIME64_3;
+    h64 ^= h64 >> 32;
+
+    return h64;
+}
+
+
+XXH_PUBLIC_API unsigned long long XXH64_digest (const XXH64_state_t* state_in)
+{
+    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
+
+    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
+        return XXH64_digest_endian(state_in, XXH_littleEndian);
+    else
+        return XXH64_digest_endian(state_in, XXH_bigEndian);
+}
+
+
+/* **************************
+*  Canonical representation
+****************************/
+
+/*! Default XXH result types are basic unsigned 32 and 64 bits.
+*   The canonical representation follows human-readable write convention, aka big-endian (large digits first).
+*   These functions allow transformation of hash result into and from its canonical format.
+*   This way, hash values can be written into a file or buffer, and remain comparable across different systems and programs.
+*/
+
+XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash)
+{
+    XXH_STATIC_ASSERT(sizeof(XXH32_canonical_t) == sizeof(XXH32_hash_t));
+    if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash);
+    memcpy(dst, &hash, sizeof(*dst));
+}
+
+XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash)
+{
+    XXH_STATIC_ASSERT(sizeof(XXH64_canonical_t) == sizeof(XXH64_hash_t));
+    if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash);
+    memcpy(dst, &hash, sizeof(*dst));
+}
+
+XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src)
+{
+    return XXH_readBE32(src);
+}
+
+XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src)
+{
+    return XXH_readBE64(src);
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/zstd_common.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/zstd_common.cpp
new file mode 100644
index 0000000000..5188e3713c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/common/zstd_common.cpp
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+
+
+/*-*************************************
+*  Dependencies
+***************************************/
+#include <stdlib.h>      /* malloc, calloc, free */
+#include <string.h>      /* memset */
+#include "zstd/common/error_private.h"
+#include "zstd/common/zstd_internal.h"
+
+namespace lbug_zstd {
+
+/*-****************************************
+*  Version
+******************************************/
+unsigned ZSTD_versionNumber(void) { return ZSTD_VERSION_NUMBER; }
+
+const char* ZSTD_versionString(void) { return ZSTD_VERSION_STRING; }
+
+
+/*-****************************************
+*  ZSTD Error Management
+******************************************/
+#undef ZSTD_isError   /* defined within zstd_internal.h */
+/*! ZSTD_isError() :
+ *  tells if a return value is an error code
+ *  symbol is required for external callers */
+unsigned ZSTD_isError(size_t code) { return ERR_isError(code); }
+
+/*! ZSTD_getErrorName() :
+ *  provides error code string from function result (useful for debugging) */
+const char* ZSTD_getErrorName(size_t code) { return ERR_getErrorName(code); }
+
+/*! ZSTD_getError() :
+ *  convert a `size_t` function result into a proper ZSTD_errorCode enum */
+ZSTD_ErrorCode ZSTD_getErrorCode(size_t code) { return ERR_getErrorCode(code); }
+
+/*! ZSTD_getErrorString() :
+ *  provides error code string from enum */
+const char* ZSTD_getErrorString(ZSTD_ErrorCode code) { return ERR_getErrorString(code); }
+
+
+
+/*=**************************************************************
+*  Custom allocator
+****************************************************************/
+void* ZSTD_malloc(size_t size, ZSTD_customMem customMem)
+{
+    if (customMem.customAlloc)
+        return customMem.customAlloc(customMem.opaque, size);
+    return malloc(size);
+}
+
+void* ZSTD_calloc(size_t size, ZSTD_customMem customMem)
+{
+    if (customMem.customAlloc) {
+        /* calloc implemented as malloc+memset;
+         * not as efficient as calloc, but next best guess for custom malloc */
+        void* const ptr = customMem.customAlloc(customMem.opaque, size);
+        memset(ptr, 0, size);
+        return ptr;
+    }
+    return calloc(1, size);
+}
+
+void ZSTD_free(void* ptr, ZSTD_customMem customMem)
+{
+    if (ptr!=NULL) {
+        if (customMem.customFree)
+            customMem.customFree(customMem.opaque, ptr);
+        else
+            free(ptr);
+    }
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/fse_compress.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/fse_compress.cpp
new file mode 100644
index 0000000000..87886086e5
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/fse_compress.cpp
@@ -0,0 +1,700 @@
+/* ******************************************************************
+ * FSE : Finite State Entropy encoder
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ *  You can contact the author at :
+ *  - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *  - Public forum : https://groups.google.com/forum/#!forum/lz4c
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+/* **************************************************************
+*  Includes
+****************************************************************/
+#include <stdlib.h>     /* malloc, free, qsort */
+#include <string.h>     /* memcpy, memset */
+#include "zstd/common/compiler.h"
+#include "zstd/common/mem.h"        /* U32, U16, etc. */
+#include "zstd/common/debug.h"      /* assert, DEBUGLOG */
+#include "zstd/compress/hist.h"       /* HIST_count_wksp */
+#include "zstd/common/bitstream.h"
+#include "zstd/common/fse.h"
+#include "zstd/common/fse_static.h"
+#include "zstd/common/error_private.h"
+
+
+/* **************************************************************
+*  Error Management
+****************************************************************/
+// #define FSE_isError ERR_isError
+
+
+/* **************************************************************
+*  Templates
+****************************************************************/
+/*
+  designed to be included
+  for type-specific functions (template emulation in C)
+  Objective is to write these functions only once, for improved maintenance
+*/
+
+/* safety checks */
+#ifndef FSE_FUNCTION_EXTENSION
+#  error "FSE_FUNCTION_EXTENSION must be defined"
+#endif
+#ifndef FSE_FUNCTION_TYPE
+#  error "FSE_FUNCTION_TYPE must be defined"
+#endif
+
+/* Function names */
+#define FSE_CAT(X,Y) X##Y
+#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)
+#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)
+
+namespace lbug_zstd {
+
+/* Function templates */
+
+/* FSE_buildCTable_wksp() :
+ * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
+ * wkspSize should be sized to handle worst case situation, which is `1<<max_tableLog * sizeof(FSE_FUNCTION_TYPE)`
+ * workSpace must also be properly aligned with FSE_FUNCTION_TYPE requirements
+ */
+size_t FSE_buildCTable_wksp(FSE_CTable* ct,
+                      const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
+                            void* workSpace, size_t wkspSize)
+{
+    U32 const tableSize = 1 << tableLog;
+    U32 const tableMask = tableSize - 1;
+    void* const ptr = ct;
+    U16* const tableU16 = ( (U16*) ptr) + 2;
+    void* const FSCT = ((U32*)ptr) + 1 /* header */ + (tableLog ? tableSize>>1 : 1) ;
+    FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
+    U32 const step = FSE_TABLESTEP(tableSize);
+    U32 cumul[FSE_MAX_SYMBOL_VALUE+2];
+
+    FSE_FUNCTION_TYPE* const tableSymbol = (FSE_FUNCTION_TYPE*)workSpace;
+    U32 highThreshold = tableSize-1;
+
+    /* CTable header */
+    if (((size_t)1 << tableLog) * sizeof(FSE_FUNCTION_TYPE) > wkspSize) return ERROR(tableLog_tooLarge);
+    tableU16[-2] = (U16) tableLog;
+    tableU16[-1] = (U16) maxSymbolValue;
+    assert(tableLog < 16);   /* required for threshold strategy to work */
+
+    /* For explanations on how to distribute symbol values over the table :
+     * http://fastcompression.blogspot.fr/2014/02/fse-distributing-symbol-values.html */
+
+     #ifdef __clang_analyzer__
+     memset(tableSymbol, 0, sizeof(*tableSymbol) * tableSize);   /* useless initialization, just to keep scan-build happy */
+     #endif
+
+    /* symbol start positions */
+    {   U32 u;
+        cumul[0] = 0;
+        for (u=1; u <= maxSymbolValue+1; u++) {
+            if (normalizedCounter[u-1]==-1) {  /* Low proba symbol */
+                cumul[u] = cumul[u-1] + 1;
+                tableSymbol[highThreshold--] = (FSE_FUNCTION_TYPE)(u-1);
+            } else {
+                cumul[u] = cumul[u-1] + normalizedCounter[u-1];
+        }   }
+        cumul[maxSymbolValue+1] = tableSize+1;
+    }
+
+    /* Spread symbols */
+    {   U32 position = 0;
+        U32 symbol;
+        for (symbol=0; symbol<=maxSymbolValue; symbol++) {
+            int nbOccurrences;
+            int const freq = normalizedCounter[symbol];
+            for (nbOccurrences=0; nbOccurrences<freq; nbOccurrences++) {
+                tableSymbol[position] = (FSE_FUNCTION_TYPE)symbol;
+                position = (position + step) & tableMask;
+                while (position > highThreshold)
+                    position = (position + step) & tableMask;   /* Low proba area */
+        }   }
+
+        assert(position==0);  /* Must have initialized all positions */
+    }
+
+    /* Build table */
+    {   U32 u; for (u=0; u<tableSize; u++) {
+        FSE_FUNCTION_TYPE s = tableSymbol[u];   /* note : static analyzer may not understand tableSymbol is properly initialized */
+        tableU16[cumul[s]++] = (U16) (tableSize+u);   /* TableU16 : sorted by symbol order; gives next state value */
+    }   }
+
+    /* Build Symbol Transformation Table */
+    {   unsigned total = 0;
+        unsigned s;
+        for (s=0; s<=maxSymbolValue; s++) {
+            switch (normalizedCounter[s])
+            {
+            case  0:
+                /* filling nonetheless, for compatibility with FSE_getMaxNbBits() */
+                symbolTT[s].deltaNbBits = ((tableLog+1) << 16) - (1<<tableLog);
+                break;
+
+            case -1:
+            case  1:
+                symbolTT[s].deltaNbBits = (tableLog << 16) - (1<<tableLog);
+                symbolTT[s].deltaFindState = total - 1;
+                total ++;
+                break;
+            default :
+                {
+                    U32 const maxBitsOut = tableLog - BIT_highbit32 (normalizedCounter[s]-1);
+                    U32 const minStatePlus = normalizedCounter[s] << maxBitsOut;
+                    symbolTT[s].deltaNbBits = (maxBitsOut << 16) - minStatePlus;
+                    symbolTT[s].deltaFindState = total - normalizedCounter[s];
+                    total +=  normalizedCounter[s];
+    }   }   }   }
+
+#if 0  /* debug : symbol costs */
+    DEBUGLOG(5, "\n --- table statistics : ");
+    {   U32 symbol;
+        for (symbol=0; symbol<=maxSymbolValue; symbol++) {
+            DEBUGLOG(5, "%3u: w=%3i,   maxBits=%u, fracBits=%.2f",
+                symbol, normalizedCounter[symbol],
+                FSE_getMaxNbBits(symbolTT, symbol),
+                (double)FSE_bitCost(symbolTT, tableLog, symbol, 8) / 256);
+        }
+    }
+#endif
+
+    return 0;
+}
+
+
+size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
+{
+    FSE_FUNCTION_TYPE tableSymbol[FSE_MAX_TABLESIZE];   /* memset() is not necessary, even if static analyzer complain about it */
+    return FSE_buildCTable_wksp(ct, normalizedCounter, maxSymbolValue, tableLog, tableSymbol, sizeof(tableSymbol));
+}
+
+
+
+#ifndef FSE_COMMONDEFS_ONLY
+
+
+/*-**************************************************************
+*  FSE NCount encoding
+****************************************************************/
+size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog)
+{
+    size_t const maxHeaderSize = (((maxSymbolValue+1) * tableLog) >> 3) + 3;
+    return maxSymbolValue ? maxHeaderSize : FSE_NCOUNTBOUND;  /* maxSymbolValue==0 ? use default */
+}
+
+static size_t
+FSE_writeNCount_generic (void* header, size_t headerBufferSize,
+                   const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
+                         unsigned writeIsSafe)
+{
+    BYTE* const ostart = (BYTE*) header;
+    BYTE* out = ostart;
+    BYTE* const oend = ostart + headerBufferSize;
+    int nbBits;
+    const int tableSize = 1 << tableLog;
+    int remaining;
+    int threshold;
+    U32 bitStream = 0;
+    int bitCount = 0;
+    unsigned symbol = 0;
+    unsigned const alphabetSize = maxSymbolValue + 1;
+    int previousIs0 = 0;
+
+    /* Table Size */
+    bitStream += (tableLog-FSE_MIN_TABLELOG) << bitCount;
+    bitCount  += 4;
+
+    /* Init */
+    remaining = tableSize+1;   /* +1 for extra accuracy */
+    threshold = tableSize;
+    nbBits = tableLog+1;
+
+    while ((symbol < alphabetSize) && (remaining>1)) {  /* stops at 1 */
+        if (previousIs0) {
+            unsigned start = symbol;
+            while ((symbol < alphabetSize) && !normalizedCounter[symbol]) symbol++;
+            if (symbol == alphabetSize) break;   /* incorrect distribution */
+            while (symbol >= start+24) {
+                start+=24;
+                bitStream += 0xFFFFU << bitCount;
+                if ((!writeIsSafe) && (out > oend-2))
+                    return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+                out[0] = (BYTE) bitStream;
+                out[1] = (BYTE)(bitStream>>8);
+                out+=2;
+                bitStream>>=16;
+            }
+            while (symbol >= start+3) {
+                start+=3;
+                bitStream += 3 << bitCount;
+                bitCount += 2;
+            }
+            bitStream += (symbol-start) << bitCount;
+            bitCount += 2;
+            if (bitCount>16) {
+                if ((!writeIsSafe) && (out > oend - 2))
+                    return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+                out[0] = (BYTE)bitStream;
+                out[1] = (BYTE)(bitStream>>8);
+                out += 2;
+                bitStream >>= 16;
+                bitCount -= 16;
+        }   }
+        {   int count = normalizedCounter[symbol++];
+            int const max = (2*threshold-1) - remaining;
+            remaining -= count < 0 ? -count : count;
+            count++;   /* +1 for extra accuracy */
+            if (count>=threshold)
+                count += max;   /* [0..max[ [max..threshold[ (...) [threshold+max 2*threshold[ */
+            bitStream += count << bitCount;
+            bitCount  += nbBits;
+            bitCount  -= (count<max);
+            previousIs0  = (count==1);
+            if (remaining<1) return ERROR(GENERIC);
+            while (remaining<threshold) { nbBits--; threshold>>=1; }
+        }
+        if (bitCount>16) {
+            if ((!writeIsSafe) && (out > oend - 2))
+                return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+            out[0] = (BYTE)bitStream;
+            out[1] = (BYTE)(bitStream>>8);
+            out += 2;
+            bitStream >>= 16;
+            bitCount -= 16;
+    }   }
+
+    if (remaining != 1)
+        return ERROR(GENERIC);  /* incorrect normalized distribution */
+    assert(symbol <= alphabetSize);
+
+    /* flush remaining bitStream */
+    if ((!writeIsSafe) && (out > oend - 2))
+        return ERROR(dstSize_tooSmall);   /* Buffer overflow */
+    out[0] = (BYTE)bitStream;
+    out[1] = (BYTE)(bitStream>>8);
+    out+= (bitCount+7) /8;
+
+    return (out-ostart);
+}
+
+
+size_t FSE_writeNCount (void* buffer, size_t bufferSize,
+                  const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
+{
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported */
+    if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported */
+
+    if (bufferSize < FSE_NCountWriteBound(maxSymbolValue, tableLog))
+        return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 0);
+
+    return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 1 /* write in buffer is safe */);
+}
+
+
+/*-**************************************************************
+*  FSE Compression Code
+****************************************************************/
+
+FSE_CTable* FSE_createCTable (unsigned maxSymbolValue, unsigned tableLog)
+{
+    size_t size;
+    if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
+    size = FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
+    return (FSE_CTable*)malloc(size);
+}
+
+void FSE_freeCTable (FSE_CTable* ct) { free(ct); }
+
+/* provides the minimum logSize to safely represent a distribution */
+static unsigned FSE_minTableLog(size_t srcSize, unsigned maxSymbolValue)
+{
+    U32 minBitsSrc = BIT_highbit32((U32)(srcSize)) + 1;
+    U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;
+    U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;
+    assert(srcSize > 1); /* Not supported, RLE should be used instead */
+    return minBits;
+}
+
+unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus)
+{
+    U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;
+    U32 tableLog = maxTableLog;
+    U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);
+    assert(srcSize > 1); /* Not supported, RLE should be used instead */
+    if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
+    if (maxBitsSrc < tableLog) tableLog = maxBitsSrc;   /* Accuracy can be reduced */
+    if (minBits > tableLog) tableLog = minBits;   /* Need a minimum to safely represent all symbol values */
+    if (tableLog < FSE_MIN_TABLELOG) tableLog = FSE_MIN_TABLELOG;
+    if (tableLog > FSE_MAX_TABLELOG) tableLog = FSE_MAX_TABLELOG;
+    return tableLog;
+}
+
+unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
+{
+    return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 2);
+}
+
+
+/* Secondary normalization method.
+   To be used when primary method fails. */
+
+static size_t FSE_normalizeM2(short* norm, U32 tableLog, const unsigned* count, size_t total, U32 maxSymbolValue)
+{
+    short const NOT_YET_ASSIGNED = -2;
+    U32 s;
+    U32 distributed = 0;
+    U32 ToDistribute;
+
+    /* Init */
+    U32 const lowThreshold = (U32)(total >> tableLog);
+    U32 lowOne = (U32)((total * 3) >> (tableLog + 1));
+
+    for (s=0; s<=maxSymbolValue; s++) {
+        if (count[s] == 0) {
+            norm[s]=0;
+            continue;
+        }
+        if (count[s] <= lowThreshold) {
+            norm[s] = -1;
+            distributed++;
+            total -= count[s];
+            continue;
+        }
+        if (count[s] <= lowOne) {
+            norm[s] = 1;
+            distributed++;
+            total -= count[s];
+            continue;
+        }
+
+        norm[s]=NOT_YET_ASSIGNED;
+    }
+    ToDistribute = (1 << tableLog) - distributed;
+
+    if (ToDistribute == 0)
+        return 0;
+
+    if ((total / ToDistribute) > lowOne) {
+        /* risk of rounding to zero */
+        lowOne = (U32)((total * 3) / (ToDistribute * 2));
+        for (s=0; s<=maxSymbolValue; s++) {
+            if ((norm[s] == NOT_YET_ASSIGNED) && (count[s] <= lowOne)) {
+                norm[s] = 1;
+                distributed++;
+                total -= count[s];
+                continue;
+        }   }
+        ToDistribute = (1 << tableLog) - distributed;
+    }
+
+    if (distributed == maxSymbolValue+1) {
+        /* all values are pretty poor;
+           probably incompressible data (should have already been detected);
+           find max, then give all remaining points to max */
+        U32 maxV = 0, maxC = 0;
+        for (s=0; s<=maxSymbolValue; s++)
+            if (count[s] > maxC) { maxV=s; maxC=count[s]; }
+        norm[maxV] += (short)ToDistribute;
+        return 0;
+    }
+
+    if (total == 0) {
+        /* all of the symbols were low enough for the lowOne or lowThreshold */
+        for (s=0; ToDistribute > 0; s = (s+1)%(maxSymbolValue+1))
+            if (norm[s] > 0) { ToDistribute--; norm[s]++; }
+        return 0;
+    }
+
+    {   U64 const vStepLog = 62 - tableLog;
+        U64 const mid = (1ULL << (vStepLog-1)) - 1;
+        U64 const rStep = ((((U64)1<<vStepLog) * ToDistribute) + mid) / total;   /* scale on remaining */
+        U64 tmpTotal = mid;
+        for (s=0; s<=maxSymbolValue; s++) {
+            if (norm[s]==NOT_YET_ASSIGNED) {
+                U64 const end = tmpTotal + (count[s] * rStep);
+                U32 const sStart = (U32)(tmpTotal >> vStepLog);
+                U32 const sEnd = (U32)(end >> vStepLog);
+                U32 const weight = sEnd - sStart;
+                if (weight < 1)
+                    return ERROR(GENERIC);
+                norm[s] = (short)weight;
+                tmpTotal = end;
+    }   }   }
+
+    return 0;
+}
+
+
+size_t FSE_normalizeCount (short* normalizedCounter, unsigned tableLog,
+                           const unsigned* count, size_t total,
+                           unsigned maxSymbolValue)
+{
+    /* Sanity checks */
+    if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
+    if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported size */
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported size */
+    if (tableLog < FSE_minTableLog(total, maxSymbolValue)) return ERROR(GENERIC);   /* Too small tableLog, compression potentially impossible */
+
+    {   static U32 const rtbTable[] = {     0, 473195, 504333, 520860, 550000, 700000, 750000, 830000 };
+        U64 const scale = 62 - tableLog;
+        U64 const step = ((U64)1<<62) / total;   /* <== here, one division ! */
+        U64 const vStep = 1ULL<<(scale-20);
+        int stillToDistribute = 1<<tableLog;
+        unsigned s;
+        unsigned largest=0;
+        short largestP=0;
+        U32 lowThreshold = (U32)(total >> tableLog);
+
+        for (s=0; s<=maxSymbolValue; s++) {
+            if (count[s] == total) return 0;   /* rle special case */
+            if (count[s] == 0) { normalizedCounter[s]=0; continue; }
+            if (count[s] <= lowThreshold) {
+                normalizedCounter[s] = -1;
+                stillToDistribute--;
+            } else {
+                short proba = (short)((count[s]*step) >> scale);
+                if (proba<8) {
+                    U64 restToBeat = vStep * rtbTable[proba];
+                    proba += (count[s]*step) - ((U64)proba<<scale) > restToBeat;
+                }
+                if (proba > largestP) { largestP=proba; largest=s; }
+                normalizedCounter[s] = proba;
+                stillToDistribute -= proba;
+        }   }
+        if (-stillToDistribute >= (normalizedCounter[largest] >> 1)) {
+            /* corner case, need another normalization method */
+            size_t const errorCode = FSE_normalizeM2(normalizedCounter, tableLog, count, total, maxSymbolValue);
+            if (FSE_isError(errorCode)) return errorCode;
+        }
+        else normalizedCounter[largest] += (short)stillToDistribute;
+    }
+
+#if 0
+    {   /* Print Table (debug) */
+        U32 s;
+        U32 nTotal = 0;
+        for (s=0; s<=maxSymbolValue; s++)
+            RAWLOG(2, "%3i: %4i \n", s, normalizedCounter[s]);
+        for (s=0; s<=maxSymbolValue; s++)
+            nTotal += abs(normalizedCounter[s]);
+        if (nTotal != (1U<<tableLog))
+            RAWLOG(2, "Warning !!! Total == %u != %u !!!", nTotal, 1U<<tableLog);
+        getchar();
+    }
+#endif
+
+    return tableLog;
+}
+
+
+/* fake FSE_CTable, for raw (uncompressed) input */
+size_t FSE_buildCTable_raw (FSE_CTable* ct, unsigned nbBits)
+{
+    const unsigned tableSize = 1 << nbBits;
+    const unsigned tableMask = tableSize - 1;
+    const unsigned maxSymbolValue = tableMask;
+    void* const ptr = ct;
+    U16* const tableU16 = ( (U16*) ptr) + 2;
+    void* const FSCT = ((U32*)ptr) + 1 /* header */ + (tableSize>>1);   /* assumption : tableLog >= 1 */
+    FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
+    unsigned s;
+
+    /* Sanity checks */
+    if (nbBits < 1) return ERROR(GENERIC);             /* min size */
+
+    /* header */
+    tableU16[-2] = (U16) nbBits;
+    tableU16[-1] = (U16) maxSymbolValue;
+
+    /* Build table */
+    for (s=0; s<tableSize; s++)
+        tableU16[s] = (U16)(tableSize + s);
+
+    /* Build Symbol Transformation Table */
+    {   const U32 deltaNbBits = (nbBits << 16) - (1 << nbBits);
+        for (s=0; s<=maxSymbolValue; s++) {
+            symbolTT[s].deltaNbBits = deltaNbBits;
+            symbolTT[s].deltaFindState = s-1;
+    }   }
+
+    return 0;
+}
+
+/* fake FSE_CTable, for rle input (always same symbol) */
+size_t FSE_buildCTable_rle (FSE_CTable* ct, BYTE symbolValue)
+{
+    void* ptr = ct;
+    U16* tableU16 = ( (U16*) ptr) + 2;
+    void* FSCTptr = (U32*)ptr + 2;
+    FSE_symbolCompressionTransform* symbolTT = (FSE_symbolCompressionTransform*) FSCTptr;
+
+    /* header */
+    tableU16[-2] = (U16) 0;
+    tableU16[-1] = (U16) symbolValue;
+
+    /* Build table */
+    tableU16[0] = 0;
+    tableU16[1] = 0;   /* just in case */
+
+    /* Build Symbol Transformation Table */
+    symbolTT[symbolValue].deltaNbBits = 0;
+    symbolTT[symbolValue].deltaFindState = 0;
+
+    return 0;
+}
+
+
+static size_t FSE_compress_usingCTable_generic (void* dst, size_t dstSize,
+                           const void* src, size_t srcSize,
+                           const FSE_CTable* ct, const unsigned fast)
+{
+    const BYTE* const istart = (const BYTE*) src;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* ip=iend;
+
+    BIT_CStream_t bitC;
+    FSE_CState_t CState1, CState2;
+
+    /* init */
+    if (srcSize <= 2) return 0;
+    { size_t const initError = BIT_initCStream(&bitC, dst, dstSize);
+      if (FSE_isError(initError)) return 0; /* not enough space available to write a bitstream */ }
+
+#define FSE_FLUSHBITS(s)  (fast ? BIT_flushBitsFast(s) : BIT_flushBits(s))
+
+    if (srcSize & 1) {
+        FSE_initCState2(&CState1, ct, *--ip);
+        FSE_initCState2(&CState2, ct, *--ip);
+        FSE_encodeSymbol(&bitC, &CState1, *--ip);
+        FSE_FLUSHBITS(&bitC);
+    } else {
+        FSE_initCState2(&CState2, ct, *--ip);
+        FSE_initCState2(&CState1, ct, *--ip);
+    }
+
+    /* join to mod 4 */
+    srcSize -= 2;
+    if ((sizeof(bitC.bitContainer)*8 > FSE_MAX_TABLELOG*4+7 ) && (srcSize & 2)) {  /* test bit 2 */
+        FSE_encodeSymbol(&bitC, &CState2, *--ip);
+        FSE_encodeSymbol(&bitC, &CState1, *--ip);
+        FSE_FLUSHBITS(&bitC);
+    }
+
+    /* 2 or 4 encoding per loop */
+    while ( ip>istart ) {
+
+        FSE_encodeSymbol(&bitC, &CState2, *--ip);
+
+        if (sizeof(bitC.bitContainer)*8 < FSE_MAX_TABLELOG*2+7 )   /* this test must be static */
+            FSE_FLUSHBITS(&bitC);
+
+        FSE_encodeSymbol(&bitC, &CState1, *--ip);
+
+        if (sizeof(bitC.bitContainer)*8 > FSE_MAX_TABLELOG*4+7 ) {  /* this test must be static */
+            FSE_encodeSymbol(&bitC, &CState2, *--ip);
+            FSE_encodeSymbol(&bitC, &CState1, *--ip);
+        }
+
+        FSE_FLUSHBITS(&bitC);
+    }
+
+    FSE_flushCState(&bitC, &CState2);
+    FSE_flushCState(&bitC, &CState1);
+    return BIT_closeCStream(&bitC);
+}
+
+size_t FSE_compress_usingCTable (void* dst, size_t dstSize,
+                           const void* src, size_t srcSize,
+                           const FSE_CTable* ct)
+{
+    unsigned const fast = (dstSize >= FSE_BLOCKBOUND(srcSize));
+
+    if (fast)
+        return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 1);
+    else
+        return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 0);
+}
+
+
+size_t FSE_compressBound(size_t size) { return FSE_COMPRESSBOUND(size); }
+
+/* FSE_compress_wksp() :
+ * Same as FSE_compress2(), but using an externally allocated scratch buffer (`workSpace`).
+ * `wkspSize` size must be `(1<<tableLog)`.
+ */
+size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize)
+{
+    BYTE* const ostart = (BYTE*) dst;
+    BYTE* op = ostart;
+    BYTE* const oend = ostart + dstSize;
+
+    unsigned count[FSE_MAX_SYMBOL_VALUE+1];
+    S16   norm[FSE_MAX_SYMBOL_VALUE+1];
+    FSE_CTable* CTable = (FSE_CTable*)workSpace;
+    size_t const CTableSize = FSE_CTABLE_SIZE_U32(tableLog, maxSymbolValue);
+    void* scratchBuffer = (void*)(CTable + CTableSize);
+    size_t const scratchBufferSize = wkspSize - (CTableSize * sizeof(FSE_CTable));
+
+    /* init conditions */
+    if (wkspSize < FSE_WKSP_SIZE_U32(tableLog, maxSymbolValue)) return ERROR(tableLog_tooLarge);
+    if (srcSize <= 1) return 0;  /* Not compressible */
+    if (!maxSymbolValue) maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
+    if (!tableLog) tableLog = FSE_DEFAULT_TABLELOG;
+
+    /* Scan input and build symbol stats */
+    {   CHECK_V_F(maxCount, HIST_count_wksp(count, &maxSymbolValue, src, srcSize, scratchBuffer, scratchBufferSize) );
+        if (maxCount == srcSize) return 1;   /* only a single symbol in src : rle */
+        if (maxCount == 1) return 0;         /* each symbol present maximum once => not compressible */
+        if (maxCount < (srcSize >> 7)) return 0;   /* Heuristic : not compressible enough */
+    }
+
+    tableLog = FSE_optimalTableLog(tableLog, srcSize, maxSymbolValue);
+    CHECK_F( FSE_normalizeCount(norm, tableLog, count, srcSize, maxSymbolValue) );
+
+    /* Write table description header */
+    {   CHECK_V_F(nc_err, FSE_writeNCount(op, oend-op, norm, maxSymbolValue, tableLog) );
+        op += nc_err;
+    }
+
+    /* Compress */
+    CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, scratchBufferSize) );
+    {   CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, src, srcSize, CTable) );
+        if (cSize == 0) return 0;   /* not enough space for compressed data */
+        op += cSize;
+    }
+
+    /* check compressibility */
+    if ( (size_t)(op-ostart) >= srcSize-1 ) return 0;
+
+    return op-ostart;
+}
+
+typedef struct {
+    FSE_CTable CTable_max[FSE_CTABLE_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE)];
+    BYTE scratchBuffer[1 << FSE_MAX_TABLELOG];
+} fseWkspMax_t;
+
+size_t FSE_compress2 (void* dst, size_t dstCapacity, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog)
+{
+    fseWkspMax_t scratchBuffer;
+    DEBUG_STATIC_ASSERT(sizeof(scratchBuffer) >= FSE_WKSP_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE));   /* compilation failures here means scratchBuffer is not large enough */
+    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
+    return FSE_compress_wksp(dst, dstCapacity, src, srcSize, maxSymbolValue, tableLog, &scratchBuffer, sizeof(scratchBuffer));
+}
+
+size_t FSE_compress (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    return FSE_compress2(dst, dstCapacity, src, srcSize, FSE_MAX_SYMBOL_VALUE, FSE_DEFAULT_TABLELOG);
+}
+
+}
+
+#endif   /* FSE_COMMONDEFS_ONLY */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/hist.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/hist.cpp
new file mode 100644
index 0000000000..84a3ba66c4
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/hist.cpp
@@ -0,0 +1,187 @@
+/* ******************************************************************
+ * hist : Histogram functions
+ * part of Finite State Entropy project
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ *  You can contact the author at :
+ *  - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *  - Public forum : https://groups.google.com/forum/#!forum/lz4c
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+/* --- dependencies --- */
+#include "zstd/common/mem.h"             /* U32, BYTE, etc. */
+#include "zstd/common/debug.h"           /* assert, DEBUGLOG */
+#include "zstd/common/error_private.h"   /* ERROR */
+#include "zstd/compress/hist.h"
+
+
+namespace lbug_zstd {
+
+/* --- Error management --- */
+unsigned HIST_isError(size_t code) { return ERR_isError(code); }
+
+/*-**************************************************************
+ *  Histogram functions
+ ****************************************************************/
+unsigned HIST_count_simple(unsigned* count, unsigned* maxSymbolValuePtr,
+                           const void* src, size_t srcSize)
+{
+    const BYTE* ip = (const BYTE*)src;
+    const BYTE* const end = ip + srcSize;
+    unsigned maxSymbolValue = *maxSymbolValuePtr;
+    unsigned largestCount=0;
+
+    memset(count, 0, (maxSymbolValue+1) * sizeof(*count));
+    if (srcSize==0) { *maxSymbolValuePtr = 0; return 0; }
+
+    while (ip<end) {
+        assert(*ip <= maxSymbolValue);
+        count[*ip++]++;
+    }
+
+    while (!count[maxSymbolValue]) maxSymbolValue--;
+    *maxSymbolValuePtr = maxSymbolValue;
+
+    {   U32 s;
+        for (s=0; s<=maxSymbolValue; s++)
+            if (count[s] > largestCount) largestCount = count[s];
+    }
+
+    return largestCount;
+}
+
+typedef enum { trustInput, checkMaxSymbolValue } HIST_checkInput_e;
+
+/* HIST_count_parallel_wksp() :
+ * store histogram into 4 intermediate tables, recombined at the end.
+ * this design makes better use of OoO cpus,
+ * and is noticeably faster when some values are heavily repeated.
+ * But it needs some additional workspace for intermediate tables.
+ * `workSpace` size must be a table of size >= HIST_WKSP_SIZE_U32.
+ * @return : largest histogram frequency,
+ *           or an error code (notably when histogram would be larger than *maxSymbolValuePtr). */
+static size_t HIST_count_parallel_wksp(
+                                unsigned* count, unsigned* maxSymbolValuePtr,
+                                const void* source, size_t sourceSize,
+                                HIST_checkInput_e check,
+                                U32* const workSpace)
+{
+    const BYTE* ip = (const BYTE*)source;
+    const BYTE* const iend = ip+sourceSize;
+    unsigned maxSymbolValue = *maxSymbolValuePtr;
+    unsigned max=0;
+    U32* const Counting1 = workSpace;
+    U32* const Counting2 = Counting1 + 256;
+    U32* const Counting3 = Counting2 + 256;
+    U32* const Counting4 = Counting3 + 256;
+
+    memset(workSpace, 0, 4*256*sizeof(unsigned));
+
+    /* safety checks */
+    if (!sourceSize) {
+        memset(count, 0, maxSymbolValue + 1);
+        *maxSymbolValuePtr = 0;
+        return 0;
+    }
+    if (!maxSymbolValue) maxSymbolValue = 255;            /* 0 == default */
+
+    /* by stripes of 16 bytes */
+    {   U32 cached = MEM_read32(ip); ip += 4;
+        while (ip < iend-15) {
+            U32 c = cached; cached = MEM_read32(ip); ip += 4;
+            Counting1[(BYTE) c     ]++;
+            Counting2[(BYTE)(c>>8) ]++;
+            Counting3[(BYTE)(c>>16)]++;
+            Counting4[       c>>24 ]++;
+            c = cached; cached = MEM_read32(ip); ip += 4;
+            Counting1[(BYTE) c     ]++;
+            Counting2[(BYTE)(c>>8) ]++;
+            Counting3[(BYTE)(c>>16)]++;
+            Counting4[       c>>24 ]++;
+            c = cached; cached = MEM_read32(ip); ip += 4;
+            Counting1[(BYTE) c     ]++;
+            Counting2[(BYTE)(c>>8) ]++;
+            Counting3[(BYTE)(c>>16)]++;
+            Counting4[       c>>24 ]++;
+            c = cached; cached = MEM_read32(ip); ip += 4;
+            Counting1[(BYTE) c     ]++;
+            Counting2[(BYTE)(c>>8) ]++;
+            Counting3[(BYTE)(c>>16)]++;
+            Counting4[       c>>24 ]++;
+        }
+        ip-=4;
+    }
+
+    /* finish last symbols */
+    while (ip<iend) Counting1[*ip++]++;
+
+    if (check) {   /* verify stats will fit into destination table */
+        U32 s; for (s=255; s>maxSymbolValue; s--) {
+            Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s];
+            if (Counting1[s]) return ERROR(maxSymbolValue_tooSmall);
+    }   }
+
+    {   U32 s;
+        if (maxSymbolValue > 255) maxSymbolValue = 255;
+        for (s=0; s<=maxSymbolValue; s++) {
+            count[s] = Counting1[s] + Counting2[s] + Counting3[s] + Counting4[s];
+            if (count[s] > max) max = count[s];
+    }   }
+
+    while (!count[maxSymbolValue]) maxSymbolValue--;
+    *maxSymbolValuePtr = maxSymbolValue;
+    return (size_t)max;
+}
+
+/* HIST_countFast_wksp() :
+ * Same as HIST_countFast(), but using an externally provided scratch buffer.
+ * `workSpace` is a writable buffer which must be 4-bytes aligned,
+ * `workSpaceSize` must be >= HIST_WKSP_SIZE
+ */
+size_t HIST_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
+                          const void* source, size_t sourceSize,
+                          void* workSpace, size_t workSpaceSize)
+{
+    if (sourceSize < 1500) /* heuristic threshold */
+        return HIST_count_simple(count, maxSymbolValuePtr, source, sourceSize);
+    if ((size_t)workSpace & 3) return ERROR(GENERIC);  /* must be aligned on 4-bytes boundaries */
+    if (workSpaceSize < HIST_WKSP_SIZE) return ERROR(workSpace_tooSmall);
+    return HIST_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, trustInput, (U32*)workSpace);
+}
+
+/* fast variant (unsafe : won't check if src contains values beyond count[] limit) */
+size_t HIST_countFast(unsigned* count, unsigned* maxSymbolValuePtr,
+                     const void* source, size_t sourceSize)
+{
+    unsigned tmpCounters[HIST_WKSP_SIZE_U32];
+    return HIST_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, tmpCounters, sizeof(tmpCounters));
+}
+
+/* HIST_count_wksp() :
+ * Same as HIST_count(), but using an externally provided scratch buffer.
+ * `workSpace` size must be table of >= HIST_WKSP_SIZE_U32 unsigned */
+size_t HIST_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
+                       const void* source, size_t sourceSize,
+                       void* workSpace, size_t workSpaceSize)
+{
+    if ((size_t)workSpace & 3) return ERROR(GENERIC);  /* must be aligned on 4-bytes boundaries */
+    if (workSpaceSize < HIST_WKSP_SIZE) return ERROR(workSpace_tooSmall);
+    if (*maxSymbolValuePtr < 255)
+        return HIST_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, checkMaxSymbolValue, (U32*)workSpace);
+    *maxSymbolValuePtr = 255;
+    return HIST_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, workSpace, workSpaceSize);
+}
+
+size_t HIST_count(unsigned* count, unsigned* maxSymbolValuePtr,
+                 const void* src, size_t srcSize)
+{
+    unsigned tmpCounters[HIST_WKSP_SIZE_U32];
+    return HIST_count_wksp(count, maxSymbolValuePtr, src, srcSize, tmpCounters, sizeof(tmpCounters));
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/huf_compress.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/huf_compress.cpp
new file mode 100644
index 0000000000..8e7e1ae6b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/huf_compress.cpp
@@ -0,0 +1,801 @@
+/* ******************************************************************
+ * Huffman encoder, part of New Generation Entropy library
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ *  You can contact the author at :
+ *  - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *  - Public forum : https://groups.google.com/forum/#!forum/lz4c
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+/* **************************************************************
+*  Compiler specifics
+****************************************************************/
+#ifdef _MSC_VER    /* Visual Studio */
+#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
+#endif
+
+
+/* **************************************************************
+*  Includes
+****************************************************************/
+#include <string.h>     /* memcpy, memset */
+#include <stdio.h>      /* printf (debug) */
+#include "zstd/common/compiler.h"
+#include "zstd/common/bitstream.h"
+#include "zstd/compress/hist.h"
+#include "zstd/common/fse.h"        /* header compression */
+#include "zstd/common/fse_static.h"
+#include "zstd/common/huf.h"
+#include "zstd/common/huf_static.h"
+#include "zstd/common/error_private.h"
+
+
+/* **************************************************************
+*  Error Management
+****************************************************************/
+// #define HUF_isError ERR_isError
+#define HUF_STATIC_ASSERT(c) DEBUG_STATIC_ASSERT(c)   /* use only *after* variable declarations */
+
+
+namespace lbug_zstd {
+/* **************************************************************
+*  Utils
+****************************************************************/
+unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
+{
+    return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 1);
+}
+
+
+/* *******************************************************
+*  HUF : Huffman block compression
+*********************************************************/
+/* HUF_compressWeights() :
+ * Same as FSE_compress(), but dedicated to huff0's weights compression.
+ * The use case needs much less stack memory.
+ * Note : all elements within weightTable are supposed to be <= HUF_TABLELOG_MAX.
+ */
+#define MAX_FSE_TABLELOG_FOR_HUFF_HEADER 6
+static size_t HUF_compressWeights (void* dst, size_t dstSize, const void* weightTable, size_t wtSize)
+{
+    BYTE* const ostart = (BYTE*) dst;
+    BYTE* op = ostart;
+    BYTE* const oend = ostart + dstSize;
+
+    unsigned maxSymbolValue = HUF_TABLELOG_MAX;
+    U32 tableLog = MAX_FSE_TABLELOG_FOR_HUFF_HEADER;
+
+    FSE_CTable CTable[FSE_CTABLE_SIZE_U32(MAX_FSE_TABLELOG_FOR_HUFF_HEADER, HUF_TABLELOG_MAX)];
+    BYTE scratchBuffer[1<<MAX_FSE_TABLELOG_FOR_HUFF_HEADER];
+
+    unsigned count[HUF_TABLELOG_MAX+1];
+    S16 norm[HUF_TABLELOG_MAX+1];
+
+    /* init conditions */
+    if (wtSize <= 1) return 0;  /* Not compressible */
+
+    /* Scan input and build symbol stats */
+    {   unsigned const maxCount = HIST_count_simple(count, &maxSymbolValue, weightTable, wtSize);   /* never fails */
+        if (maxCount == wtSize) return 1;   /* only a single symbol in src : rle */
+        if (maxCount == 1) return 0;        /* each symbol present maximum once => not compressible */
+    }
+
+    tableLog = FSE_optimalTableLog(tableLog, wtSize, maxSymbolValue);
+    CHECK_F( FSE_normalizeCount(norm, tableLog, count, wtSize, maxSymbolValue) );
+
+    /* Write table description header */
+    {   CHECK_V_F(hSize, FSE_writeNCount(op, (size_t)(oend-op), norm, maxSymbolValue, tableLog) );
+        op += hSize;
+    }
+
+    /* Compress */
+    CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, sizeof(scratchBuffer)) );
+    {   CHECK_V_F(cSize, FSE_compress_usingCTable(op, (size_t)(oend - op), weightTable, wtSize, CTable) );
+        if (cSize == 0) return 0;   /* not enough space for compressed data */
+        op += cSize;
+    }
+
+    return (size_t)(op-ostart);
+}
+
+
+struct HUF_CElt_s {
+  U16  val;
+  BYTE nbBits;
+};   /* typedef'd to HUF_CElt within "zstd/common/huf.h" */
+
+/*! HUF_writeCTable() :
+    `CTable` : Huffman tree to save, using huf representation.
+    @return : size of saved CTable */
+size_t HUF_writeCTable (void* dst, size_t maxDstSize,
+                        const HUF_CElt* CTable, unsigned maxSymbolValue, unsigned huffLog)
+{
+    BYTE bitsToWeight[HUF_TABLELOG_MAX + 1];   /* precomputed conversion table */
+    BYTE huffWeight[HUF_SYMBOLVALUE_MAX];
+    BYTE* op = (BYTE*)dst;
+    U32 n;
+
+     /* check conditions */
+    if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(maxSymbolValue_tooLarge);
+
+    /* convert to weight */
+    bitsToWeight[0] = 0;
+    for (n=1; n<huffLog+1; n++)
+        bitsToWeight[n] = (BYTE)(huffLog + 1 - n);
+    for (n=0; n<maxSymbolValue; n++)
+        huffWeight[n] = bitsToWeight[CTable[n].nbBits];
+
+    /* attempt weights compression by FSE */
+    {   CHECK_V_F(hSize, HUF_compressWeights(op+1, maxDstSize-1, huffWeight, maxSymbolValue) );
+        if ((hSize>1) & (hSize < maxSymbolValue/2)) {   /* FSE compressed */
+            op[0] = (BYTE)hSize;
+            return hSize+1;
+    }   }
+
+    /* write raw values as 4-bits (max : 15) */
+    if (maxSymbolValue > (256-128)) return ERROR(GENERIC);   /* should not happen : likely means source cannot be compressed */
+    if (((maxSymbolValue+1)/2) + 1 > maxDstSize) return ERROR(dstSize_tooSmall);   /* not enough space within dst buffer */
+    op[0] = (BYTE)(128 /*special case*/ + (maxSymbolValue-1));
+    huffWeight[maxSymbolValue] = 0;   /* to be sure it doesn't cause msan issue in final combination */
+    for (n=0; n<maxSymbolValue; n+=2)
+        op[(n/2)+1] = (BYTE)((huffWeight[n] << 4) + huffWeight[n+1]);
+    return ((maxSymbolValue+1)/2) + 1;
+}
+
+
+size_t HUF_readCTable (HUF_CElt* CTable, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize, unsigned* hasZeroWeights)
+{
+    BYTE huffWeight[HUF_SYMBOLVALUE_MAX + 1];   /* init not required, even though some static analyzer may complain */
+    U32 rankVal[HUF_TABLELOG_ABSOLUTEMAX + 1];   /* large enough for values from 0 to 16 */
+    U32 tableLog = 0;
+    U32 nbSymbols = 0;
+
+    /* get symbol weights */
+    CHECK_V_F(readSize, HUF_readStats(huffWeight, HUF_SYMBOLVALUE_MAX+1, rankVal, &nbSymbols, &tableLog, src, srcSize));
+
+    /* check result */
+    if (tableLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
+    if (nbSymbols > *maxSymbolValuePtr+1) return ERROR(maxSymbolValue_tooSmall);
+
+    /* Prepare base value per rank */
+    {   U32 n, nextRankStart = 0;
+        for (n=1; n<=tableLog; n++) {
+            U32 current = nextRankStart;
+            nextRankStart += (rankVal[n] << (n-1));
+            rankVal[n] = current;
+    }   }
+
+    /* fill nbBits */
+    *hasZeroWeights = 0;
+    {   U32 n; for (n=0; n<nbSymbols; n++) {
+            const U32 w = huffWeight[n];
+            *hasZeroWeights |= (w == 0);
+            CTable[n].nbBits = (BYTE)(tableLog + 1 - w) & -(w != 0);
+    }   }
+
+    /* fill val */
+    {   U16 nbPerRank[HUF_TABLELOG_MAX+2]  = {0};  /* support w=0=>n=tableLog+1 */
+        U16 valPerRank[HUF_TABLELOG_MAX+2] = {0};
+        { U32 n; for (n=0; n<nbSymbols; n++) nbPerRank[CTable[n].nbBits]++; }
+        /* determine stating value per rank */
+        valPerRank[tableLog+1] = 0;   /* for w==0 */
+        {   U16 min = 0;
+            U32 n; for (n=tableLog; n>0; n--) {  /* start at n=tablelog <-> w=1 */
+                valPerRank[n] = min;     /* get starting value within each rank */
+                min += nbPerRank[n];
+                min >>= 1;
+        }   }
+        /* assign value within rank, symbol order */
+        { U32 n; for (n=0; n<nbSymbols; n++) CTable[n].val = valPerRank[CTable[n].nbBits]++; }
+    }
+
+    *maxSymbolValuePtr = nbSymbols - 1;
+    return readSize;
+}
+
+U32 HUF_getNbBits(const void* symbolTable, U32 symbolValue)
+{
+    const HUF_CElt* table = (const HUF_CElt*)symbolTable;
+    assert(symbolValue <= HUF_SYMBOLVALUE_MAX);
+    return table[symbolValue].nbBits;
+}
+
+
+typedef struct nodeElt_s {
+    U32 count;
+    U16 parent;
+    BYTE byte;
+    BYTE nbBits;
+} nodeElt;
+
+static U32 HUF_setMaxHeight(nodeElt* huffNode, U32 lastNonNull, U32 maxNbBits)
+{
+    const U32 largestBits = huffNode[lastNonNull].nbBits;
+    if (largestBits <= maxNbBits) return largestBits;   /* early exit : no elt > maxNbBits */
+
+    /* there are several too large elements (at least >= 2) */
+    {   int totalCost = 0;
+        const U32 baseCost = 1 << (largestBits - maxNbBits);
+        int n = (int)lastNonNull;
+
+        while (huffNode[n].nbBits > maxNbBits) {
+            totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
+            huffNode[n].nbBits = (BYTE)maxNbBits;
+            n --;
+        }  /* n stops at huffNode[n].nbBits <= maxNbBits */
+        while (huffNode[n].nbBits == maxNbBits) n--;   /* n end at index of smallest symbol using < maxNbBits */
+
+        /* renorm totalCost */
+        totalCost >>= (largestBits - maxNbBits);  /* note : totalCost is necessarily a multiple of baseCost */
+
+        /* repay normalized cost */
+        {   U32 const noSymbol = 0xF0F0F0F0;
+            U32 rankLast[HUF_TABLELOG_MAX+2];
+
+            /* Get pos of last (smallest) symbol per rank */
+            memset(rankLast, 0xF0, sizeof(rankLast));
+            {   U32 currentNbBits = maxNbBits;
+                int pos;
+                for (pos=n ; pos >= 0; pos--) {
+                    if (huffNode[pos].nbBits >= currentNbBits) continue;
+                    currentNbBits = huffNode[pos].nbBits;   /* < maxNbBits */
+                    rankLast[maxNbBits-currentNbBits] = (U32)pos;
+            }   }
+
+            while (totalCost > 0) {
+                U32 nBitsToDecrease = BIT_highbit32((U32)totalCost) + 1;
+                for ( ; nBitsToDecrease > 1; nBitsToDecrease--) {
+                    U32 const highPos = rankLast[nBitsToDecrease];
+                    U32 const lowPos = rankLast[nBitsToDecrease-1];
+                    if (highPos == noSymbol) continue;
+                    if (lowPos == noSymbol) break;
+                    {   U32 const highTotal = huffNode[highPos].count;
+                        U32 const lowTotal = 2 * huffNode[lowPos].count;
+                        if (highTotal <= lowTotal) break;
+                }   }
+                /* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily at least one !) */
+                /* HUF_MAX_TABLELOG test just to please gcc 5+; but it should not be necessary */
+                while ((nBitsToDecrease<=HUF_TABLELOG_MAX) && (rankLast[nBitsToDecrease] == noSymbol))
+                    nBitsToDecrease ++;
+                totalCost -= 1 << (nBitsToDecrease-1);
+                if (rankLast[nBitsToDecrease-1] == noSymbol)
+                    rankLast[nBitsToDecrease-1] = rankLast[nBitsToDecrease];   /* this rank is no longer empty */
+                huffNode[rankLast[nBitsToDecrease]].nbBits ++;
+                if (rankLast[nBitsToDecrease] == 0)    /* special case, reached largest symbol */
+                    rankLast[nBitsToDecrease] = noSymbol;
+                else {
+                    rankLast[nBitsToDecrease]--;
+                    if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits-nBitsToDecrease)
+                        rankLast[nBitsToDecrease] = noSymbol;   /* this rank is now empty */
+            }   }   /* while (totalCost > 0) */
+
+            while (totalCost < 0) {  /* Sometimes, cost correction overshoot */
+                if (rankLast[1] == noSymbol) {  /* special case : no rank 1 symbol (using maxNbBits-1); let's create one from largest rank 0 (using maxNbBits) */
+                    while (huffNode[n].nbBits == maxNbBits) n--;
+                    huffNode[n+1].nbBits--;
+                    assert(n >= 0);
+                    rankLast[1] = (U32)(n+1);
+                    totalCost++;
+                    continue;
+                }
+                huffNode[ rankLast[1] + 1 ].nbBits--;
+                rankLast[1]++;
+                totalCost ++;
+    }   }   }   /* there are several too large elements (at least >= 2) */
+
+    return maxNbBits;
+}
+
+typedef struct {
+    U32 base;
+    U32 current;
+} rankPos;
+
+typedef nodeElt huffNodeTable[HUF_CTABLE_WORKSPACE_SIZE_U32];
+
+#define RANK_POSITION_TABLE_SIZE 32
+
+typedef struct {
+  huffNodeTable huffNodeTbl;
+  rankPos rankPosition[RANK_POSITION_TABLE_SIZE];
+} HUF_buildCTable_wksp_tables;
+
+static void HUF_sort(nodeElt* huffNode, const unsigned* count, U32 maxSymbolValue, rankPos* rankPosition)
+{
+    U32 n;
+
+    memset(rankPosition, 0, sizeof(*rankPosition) * RANK_POSITION_TABLE_SIZE);
+    for (n=0; n<=maxSymbolValue; n++) {
+        U32 r = BIT_highbit32(count[n] + 1);
+        rankPosition[r].base ++;
+    }
+    for (n=30; n>0; n--) rankPosition[n-1].base += rankPosition[n].base;
+    for (n=0; n<32; n++) rankPosition[n].current = rankPosition[n].base;
+    for (n=0; n<=maxSymbolValue; n++) {
+        U32 const c = count[n];
+        U32 const r = BIT_highbit32(c+1) + 1;
+        U32 pos = rankPosition[r].current++;
+        while ((pos > rankPosition[r].base) && (c > huffNode[pos-1].count)) {
+            huffNode[pos] = huffNode[pos-1];
+            pos--;
+        }
+        huffNode[pos].count = c;
+        huffNode[pos].byte  = (BYTE)n;
+    }
+}
+
+
+/** HUF_buildCTable_wksp() :
+ *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
+ *  `workSpace` must be aligned on 4-bytes boundaries, and be at least as large as sizeof(HUF_buildCTable_wksp_tables).
+ */
+#define STARTNODE (HUF_SYMBOLVALUE_MAX+1)
+
+size_t HUF_buildCTable_wksp (HUF_CElt* tree, const unsigned* count, U32 maxSymbolValue, U32 maxNbBits, void* workSpace, size_t wkspSize)
+{
+    HUF_buildCTable_wksp_tables* const wksp_tables = (HUF_buildCTable_wksp_tables*)workSpace;
+    nodeElt* const huffNode0 = wksp_tables->huffNodeTbl;
+    nodeElt* const huffNode = huffNode0+1;
+    int nonNullRank;
+    int lowS, lowN;
+    int nodeNb = STARTNODE;
+    int n, nodeRoot;
+
+    /* safety checks */
+    if (((size_t)workSpace & 3) != 0) return ERROR(GENERIC);  /* must be aligned on 4-bytes boundaries */
+    if (wkspSize < sizeof(HUF_buildCTable_wksp_tables))
+      return ERROR(workSpace_tooSmall);
+    if (maxNbBits == 0) maxNbBits = HUF_TABLELOG_DEFAULT;
+    if (maxSymbolValue > HUF_SYMBOLVALUE_MAX)
+      return ERROR(maxSymbolValue_tooLarge);
+    memset(huffNode0, 0, sizeof(huffNodeTable));
+
+    /* sort, decreasing order */
+    HUF_sort(huffNode, count, maxSymbolValue, wksp_tables->rankPosition);
+
+    /* init for parents */
+    nonNullRank = (int)maxSymbolValue;
+    while(huffNode[nonNullRank].count == 0) nonNullRank--;
+    lowS = nonNullRank; nodeRoot = nodeNb + lowS - 1; lowN = nodeNb;
+    huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS-1].count;
+    huffNode[lowS].parent = huffNode[lowS-1].parent = (U16)nodeNb;
+    nodeNb++; lowS-=2;
+    for (n=nodeNb; n<=nodeRoot; n++) huffNode[n].count = (U32)(1U<<30);
+    huffNode0[0].count = (U32)(1U<<31);  /* fake entry, strong barrier */
+
+    /* create parents */
+    while (nodeNb <= nodeRoot) {
+        int const n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
+        int const n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
+        huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count;
+        huffNode[n1].parent = huffNode[n2].parent = (U16)nodeNb;
+        nodeNb++;
+    }
+
+    /* distribute weights (unlimited tree height) */
+    huffNode[nodeRoot].nbBits = 0;
+    for (n=nodeRoot-1; n>=STARTNODE; n--)
+        huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
+    for (n=0; n<=nonNullRank; n++)
+        huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
+
+    /* enforce maxTableLog */
+    maxNbBits = HUF_setMaxHeight(huffNode, (U32)nonNullRank, maxNbBits);
+
+    /* fill result into tree (val, nbBits) */
+    {   U16 nbPerRank[HUF_TABLELOG_MAX+1] = {0};
+        U16 valPerRank[HUF_TABLELOG_MAX+1] = {0};
+        int const alphabetSize = (int)(maxSymbolValue + 1);
+        if (maxNbBits > HUF_TABLELOG_MAX) return ERROR(GENERIC);   /* check fit into table */
+        for (n=0; n<=nonNullRank; n++)
+            nbPerRank[huffNode[n].nbBits]++;
+        /* determine stating value per rank */
+        {   U16 min = 0;
+            for (n=(int)maxNbBits; n>0; n--) {
+                valPerRank[n] = min;      /* get starting value within each rank */
+                min += nbPerRank[n];
+                min >>= 1;
+        }   }
+        for (n=0; n<alphabetSize; n++)
+            tree[huffNode[n].byte].nbBits = huffNode[n].nbBits;   /* push nbBits per symbol, symbol order */
+        for (n=0; n<alphabetSize; n++)
+            tree[n].val = valPerRank[tree[n].nbBits]++;   /* assign value within rank, symbol order */
+    }
+
+    return maxNbBits;
+}
+
+/** HUF_buildCTable() :
+ * @return : maxNbBits
+ *  Note : count is used before tree is written, so they can safely overlap
+ */
+size_t HUF_buildCTable (HUF_CElt* tree, const unsigned* count, unsigned maxSymbolValue, unsigned maxNbBits)
+{
+    HUF_buildCTable_wksp_tables workspace;
+    return HUF_buildCTable_wksp(tree, count, maxSymbolValue, maxNbBits, &workspace, sizeof(workspace));
+}
+
+size_t HUF_estimateCompressedSize(const HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue)
+{
+    size_t nbBits = 0;
+    int s;
+    for (s = 0; s <= (int)maxSymbolValue; ++s) {
+        nbBits += CTable[s].nbBits * count[s];
+    }
+    return nbBits >> 3;
+}
+
+int HUF_validateCTable(const HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue) {
+  int bad = 0;
+  int s;
+  for (s = 0; s <= (int)maxSymbolValue; ++s) {
+    bad |= (count[s] != 0) & (CTable[s].nbBits == 0);
+  }
+  return !bad;
+}
+
+size_t HUF_compressBound(size_t size) { return HUF_COMPRESSBOUND(size); }
+
+FORCE_INLINE_TEMPLATE void
+HUF_encodeSymbol(BIT_CStream_t* bitCPtr, U32 symbol, const HUF_CElt* CTable)
+{
+    BIT_addBitsFast(bitCPtr, CTable[symbol].val, CTable[symbol].nbBits);
+}
+
+#define HUF_FLUSHBITS(s)  BIT_flushBits(s)
+
+#define HUF_FLUSHBITS_1(stream) \
+    if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*2+7) HUF_FLUSHBITS(stream)
+
+#define HUF_FLUSHBITS_2(stream) \
+    if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*4+7) HUF_FLUSHBITS(stream)
+
+FORCE_INLINE_TEMPLATE size_t
+HUF_compress1X_usingCTable_internal_body(void* dst, size_t dstSize,
+                                   const void* src, size_t srcSize,
+                                   const HUF_CElt* CTable)
+{
+    const BYTE* ip = (const BYTE*) src;
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstSize;
+    BYTE* op = ostart;
+    size_t n;
+    BIT_CStream_t bitC;
+
+    /* init */
+    if (dstSize < 8) return 0;   /* not enough space to compress */
+    { size_t const initErr = BIT_initCStream(&bitC, op, (size_t)(oend-op));
+      if (HUF_isError(initErr)) return 0; }
+
+    n = srcSize & ~3;  /* join to mod 4 */
+    switch (srcSize & 3)
+    {
+        case 3 : HUF_encodeSymbol(&bitC, ip[n+ 2], CTable);
+                 HUF_FLUSHBITS_2(&bitC);
+		 /* fall-through */
+        case 2 : HUF_encodeSymbol(&bitC, ip[n+ 1], CTable);
+                 HUF_FLUSHBITS_1(&bitC);
+		 /* fall-through */
+        case 1 : HUF_encodeSymbol(&bitC, ip[n+ 0], CTable);
+                 HUF_FLUSHBITS(&bitC);
+		 /* fall-through */
+        case 0 : /* fall-through */
+        default: break;
+    }
+
+    for (; n>0; n-=4) {  /* note : n&3==0 at this stage */
+        HUF_encodeSymbol(&bitC, ip[n- 1], CTable);
+        HUF_FLUSHBITS_1(&bitC);
+        HUF_encodeSymbol(&bitC, ip[n- 2], CTable);
+        HUF_FLUSHBITS_2(&bitC);
+        HUF_encodeSymbol(&bitC, ip[n- 3], CTable);
+        HUF_FLUSHBITS_1(&bitC);
+        HUF_encodeSymbol(&bitC, ip[n- 4], CTable);
+        HUF_FLUSHBITS(&bitC);
+    }
+
+    return BIT_closeCStream(&bitC);
+}
+
+#if DYNAMIC_BMI2
+
+static TARGET_ATTRIBUTE("bmi2") size_t
+HUF_compress1X_usingCTable_internal_bmi2(void* dst, size_t dstSize,
+                                   const void* src, size_t srcSize,
+                                   const HUF_CElt* CTable)
+{
+    return HUF_compress1X_usingCTable_internal_body(dst, dstSize, src, srcSize, CTable);
+}
+
+static size_t
+HUF_compress1X_usingCTable_internal_default(void* dst, size_t dstSize,
+                                      const void* src, size_t srcSize,
+                                      const HUF_CElt* CTable)
+{
+    return HUF_compress1X_usingCTable_internal_body(dst, dstSize, src, srcSize, CTable);
+}
+
+static size_t
+HUF_compress1X_usingCTable_internal(void* dst, size_t dstSize,
+                              const void* src, size_t srcSize,
+                              const HUF_CElt* CTable, const int bmi2)
+{
+    if (bmi2) {
+        return HUF_compress1X_usingCTable_internal_bmi2(dst, dstSize, src, srcSize, CTable);
+    }
+    return HUF_compress1X_usingCTable_internal_default(dst, dstSize, src, srcSize, CTable);
+}
+
+#else
+
+static size_t
+HUF_compress1X_usingCTable_internal(void* dst, size_t dstSize,
+                              const void* src, size_t srcSize,
+                              const HUF_CElt* CTable, const int bmi2)
+{
+    (void)bmi2;
+    return HUF_compress1X_usingCTable_internal_body(dst, dstSize, src, srcSize, CTable);
+}
+
+#endif
+
+size_t HUF_compress1X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable)
+{
+    return HUF_compress1X_usingCTable_internal(dst, dstSize, src, srcSize, CTable, /* bmi2 */ 0);
+}
+
+
+static size_t
+HUF_compress4X_usingCTable_internal(void* dst, size_t dstSize,
+                              const void* src, size_t srcSize,
+                              const HUF_CElt* CTable, int bmi2)
+{
+    size_t const segmentSize = (srcSize+3)/4;   /* first 3 segments */
+    const BYTE* ip = (const BYTE*) src;
+    const BYTE* const iend = ip + srcSize;
+    BYTE* const ostart = (BYTE*) dst;
+    BYTE* const oend = ostart + dstSize;
+    BYTE* op = ostart;
+
+    if (dstSize < 6 + 1 + 1 + 1 + 8) return 0;   /* minimum space to compress successfully */
+    if (srcSize < 12) return 0;   /* no saving possible : too small input */
+    op += 6;   /* jumpTable */
+
+    assert(op <= oend);
+    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable_internal(op, (size_t)(oend-op), ip, segmentSize, CTable, bmi2) );
+        if (cSize==0) return 0;
+        assert(cSize <= 65535);
+        MEM_writeLE16(ostart, (U16)cSize);
+        op += cSize;
+    }
+
+    ip += segmentSize;
+    assert(op <= oend);
+    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable_internal(op, (size_t)(oend-op), ip, segmentSize, CTable, bmi2) );
+        if (cSize==0) return 0;
+        assert(cSize <= 65535);
+        MEM_writeLE16(ostart+2, (U16)cSize);
+        op += cSize;
+    }
+
+    ip += segmentSize;
+    assert(op <= oend);
+    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable_internal(op, (size_t)(oend-op), ip, segmentSize, CTable, bmi2) );
+        if (cSize==0) return 0;
+        assert(cSize <= 65535);
+        MEM_writeLE16(ostart+4, (U16)cSize);
+        op += cSize;
+    }
+
+    ip += segmentSize;
+    assert(op <= oend);
+    assert(ip <= iend);
+    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable_internal(op, (size_t)(oend-op), ip, (size_t)(iend-ip), CTable, bmi2) );
+        if (cSize==0) return 0;
+        op += cSize;
+    }
+
+    return (size_t)(op-ostart);
+}
+
+size_t HUF_compress4X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable)
+{
+    return HUF_compress4X_usingCTable_internal(dst, dstSize, src, srcSize, CTable, /* bmi2 */ 0);
+}
+
+typedef enum { HUF_singleStream, HUF_fourStreams } HUF_nbStreams_e;
+
+static size_t HUF_compressCTable_internal(
+                BYTE* const ostart, BYTE* op, BYTE* const oend,
+                const void* src, size_t srcSize,
+                HUF_nbStreams_e nbStreams, const HUF_CElt* CTable, const int bmi2)
+{
+    size_t const cSize = (nbStreams==HUF_singleStream) ?
+                         HUF_compress1X_usingCTable_internal(op, (size_t)(oend - op), src, srcSize, CTable, bmi2) :
+                         HUF_compress4X_usingCTable_internal(op, (size_t)(oend - op), src, srcSize, CTable, bmi2);
+    if (HUF_isError(cSize)) { return cSize; }
+    if (cSize==0) { return 0; }   /* uncompressible */
+    op += cSize;
+    /* check compressibility */
+    assert(op >= ostart);
+    if ((size_t)(op-ostart) >= srcSize-1) { return 0; }
+    return (size_t)(op-ostart);
+}
+
+typedef struct {
+    unsigned count[HUF_SYMBOLVALUE_MAX + 1];
+    HUF_CElt CTable[HUF_SYMBOLVALUE_MAX + 1];
+    HUF_buildCTable_wksp_tables buildCTable_wksp;
+} HUF_compress_tables_t;
+
+/* HUF_compress_internal() :
+ * `workSpace` must a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
+static size_t
+HUF_compress_internal (void* dst, size_t dstSize,
+                 const void* src, size_t srcSize,
+                       unsigned maxSymbolValue, unsigned huffLog,
+                       HUF_nbStreams_e nbStreams,
+                       void* workSpace, size_t wkspSize,
+                       HUF_CElt* oldHufTable, HUF_repeat* repeat, int preferRepeat,
+                 const int bmi2)
+{
+    HUF_compress_tables_t* const table = (HUF_compress_tables_t*)workSpace;
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstSize;
+    BYTE* op = ostart;
+
+    HUF_STATIC_ASSERT(sizeof(*table) <= HUF_WORKSPACE_SIZE);
+
+    /* checks & inits */
+    if (((size_t)workSpace & 3) != 0) return ERROR(GENERIC);  /* must be aligned on 4-bytes boundaries */
+    if (wkspSize < HUF_WORKSPACE_SIZE) return ERROR(workSpace_tooSmall);
+    if (!srcSize) return 0;  /* Uncompressed */
+    if (!dstSize) return 0;  /* cannot fit anything within dst budget */
+    if (srcSize > HUF_BLOCKSIZE_MAX) return ERROR(srcSize_wrong);   /* current block size limit */
+    if (huffLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
+    if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(maxSymbolValue_tooLarge);
+    if (!maxSymbolValue) maxSymbolValue = HUF_SYMBOLVALUE_MAX;
+    if (!huffLog) huffLog = HUF_TABLELOG_DEFAULT;
+
+    /* Heuristic : If old table is valid, use it for small inputs */
+    if (preferRepeat && repeat && *repeat == HUF_repeat_valid) {
+        return HUF_compressCTable_internal(ostart, op, oend,
+                                           src, srcSize,
+                                           nbStreams, oldHufTable, bmi2);
+    }
+
+    /* Scan input and build symbol stats */
+    {   CHECK_V_F(largest, HIST_count_wksp (table->count, &maxSymbolValue, (const BYTE*)src, srcSize, workSpace, wkspSize) );
+        if (largest == srcSize) { *ostart = ((const BYTE*)src)[0]; return 1; }   /* single symbol, rle */
+        if (largest <= (srcSize >> 7)+4) return 0;   /* heuristic : probably not compressible enough */
+    }
+
+    /* Check validity of previous table */
+    if ( repeat
+      && *repeat == HUF_repeat_check
+      && !HUF_validateCTable(oldHufTable, table->count, maxSymbolValue)) {
+        *repeat = HUF_repeat_none;
+    }
+    /* Heuristic : use existing table for small inputs */
+    if (preferRepeat && repeat && *repeat != HUF_repeat_none) {
+        return HUF_compressCTable_internal(ostart, op, oend,
+                                           src, srcSize,
+                                           nbStreams, oldHufTable, bmi2);
+    }
+
+    /* Build Huffman Tree */
+    huffLog = HUF_optimalTableLog(huffLog, srcSize, maxSymbolValue);
+    {   size_t const maxBits = HUF_buildCTable_wksp(table->CTable, table->count,
+                                            maxSymbolValue, huffLog,
+                                            &table->buildCTable_wksp, sizeof(table->buildCTable_wksp));
+        CHECK_F(maxBits);
+        huffLog = (U32)maxBits;
+        /* Zero unused symbols in CTable, so we can check it for validity */
+        memset(table->CTable + (maxSymbolValue + 1), 0,
+               sizeof(table->CTable) - ((maxSymbolValue + 1) * sizeof(HUF_CElt)));
+    }
+
+    /* Write table description header */
+    {   CHECK_V_F(hSize, HUF_writeCTable (op, dstSize, table->CTable, maxSymbolValue, huffLog) );
+        /* Check if using previous huffman table is beneficial */
+        if (repeat && *repeat != HUF_repeat_none) {
+            size_t const oldSize = HUF_estimateCompressedSize(oldHufTable, table->count, maxSymbolValue);
+            size_t const newSize = HUF_estimateCompressedSize(table->CTable, table->count, maxSymbolValue);
+            if (oldSize <= hSize + newSize || hSize + 12 >= srcSize) {
+                return HUF_compressCTable_internal(ostart, op, oend,
+                                                   src, srcSize,
+                                                   nbStreams, oldHufTable, bmi2);
+        }   }
+
+        /* Use the new huffman table */
+        if (hSize + 12ul >= srcSize) { return 0; }
+        op += hSize;
+        if (repeat) { *repeat = HUF_repeat_none; }
+        if (oldHufTable)
+            memcpy(oldHufTable, table->CTable, sizeof(table->CTable));  /* Save new table */
+    }
+    return HUF_compressCTable_internal(ostart, op, oend,
+                                       src, srcSize,
+                                       nbStreams, table->CTable, bmi2);
+}
+
+
+size_t HUF_compress1X_wksp (void* dst, size_t dstSize,
+                      const void* src, size_t srcSize,
+                      unsigned maxSymbolValue, unsigned huffLog,
+                      void* workSpace, size_t wkspSize)
+{
+    return HUF_compress_internal(dst, dstSize, src, srcSize,
+                                 maxSymbolValue, huffLog, HUF_singleStream,
+                                 workSpace, wkspSize,
+                                 NULL, NULL, 0, 0 /*bmi2*/);
+}
+
+size_t HUF_compress1X_repeat (void* dst, size_t dstSize,
+                      const void* src, size_t srcSize,
+                      unsigned maxSymbolValue, unsigned huffLog,
+                      void* workSpace, size_t wkspSize,
+                      HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat, int bmi2)
+{
+    return HUF_compress_internal(dst, dstSize, src, srcSize,
+                                 maxSymbolValue, huffLog, HUF_singleStream,
+                                 workSpace, wkspSize, hufTable,
+                                 repeat, preferRepeat, bmi2);
+}
+
+size_t HUF_compress1X (void* dst, size_t dstSize,
+                 const void* src, size_t srcSize,
+                 unsigned maxSymbolValue, unsigned huffLog)
+{
+    unsigned workSpace[HUF_WORKSPACE_SIZE_U32];
+    return HUF_compress1X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
+}
+
+/* HUF_compress4X_repeat():
+ * compress input using 4 streams.
+ * provide workspace to generate compression tables */
+size_t HUF_compress4X_wksp (void* dst, size_t dstSize,
+                      const void* src, size_t srcSize,
+                      unsigned maxSymbolValue, unsigned huffLog,
+                      void* workSpace, size_t wkspSize)
+{
+    return HUF_compress_internal(dst, dstSize, src, srcSize,
+                                 maxSymbolValue, huffLog, HUF_fourStreams,
+                                 workSpace, wkspSize,
+                                 NULL, NULL, 0, 0 /*bmi2*/);
+}
+
+/* HUF_compress4X_repeat():
+ * compress input using 4 streams.
+ * re-use an existing huffman compression table */
+size_t HUF_compress4X_repeat (void* dst, size_t dstSize,
+                      const void* src, size_t srcSize,
+                      unsigned maxSymbolValue, unsigned huffLog,
+                      void* workSpace, size_t wkspSize,
+                      HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat, int bmi2)
+{
+    return HUF_compress_internal(dst, dstSize, src, srcSize,
+                                 maxSymbolValue, huffLog, HUF_fourStreams,
+                                 workSpace, wkspSize,
+                                 hufTable, repeat, preferRepeat, bmi2);
+}
+
+size_t HUF_compress2 (void* dst, size_t dstSize,
+                const void* src, size_t srcSize,
+                unsigned maxSymbolValue, unsigned huffLog)
+{
+    unsigned workSpace[HUF_WORKSPACE_SIZE_U32];
+    return HUF_compress4X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
+}
+
+size_t HUF_compress (void* dst, size_t maxDstSize, const void* src, size_t srcSize)
+{
+    return HUF_compress2(dst, maxDstSize, src, srcSize, 255, HUF_TABLELOG_DEFAULT);
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress.cpp
new file mode 100644
index 0000000000..24c7a0f6a9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress.cpp
@@ -0,0 +1,4283 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+/*-*************************************
+*  Dependencies
+***************************************/
+#include <limits.h>         /* INT_MAX */
+#include <string.h>         /* memset */
+#include "zstd/common/mem.h"
+#include "zstd/compress/hist.h"           /* HIST_countFast_wksp */
+#include "zstd/common/fse.h"
+#include "zstd/common/fse_static.h"
+#include "zstd/common/huf.h"
+#include "zstd/common/huf_static.h"
+#include "zstd/compress/zstd_compress_internal.h"
+#include "zstd/compress/zstd_compress_sequences.h"
+#include "zstd/compress/zstd_compress_literals.h"
+#include "zstd/compress/zstd_fast.h"
+#include "zstd/compress/zstd_double_fast.h"
+#include "zstd/compress/zstd_lazy.h"
+#include "zstd/compress/zstd_opt.h"
+#include "zstd/compress/zstd_ldm.h"
+#include "zstd/compress/zstd_compress_superblock.h"
+
+#if defined (MEMORY_SANITIZER)
+#include <sanitizer/msan_interface.h>
+#endif
+
+namespace lbug_zstd {
+/*-*************************************
+*  Helper functions
+***************************************/
+/* ZSTD_compressBound()
+ * Note that the result from this function is only compatible with the "normal"
+ * full-block strategy.
+ * When there are a lot of small blocks due to frequent flush in streaming mode
+ * the overhead of headers can make the compressed data to be larger than the
+ * return value of ZSTD_compressBound().
+ */
+size_t ZSTD_compressBound(size_t srcSize) {
+    return ZSTD_COMPRESSBOUND(srcSize);
+}
+
+
+/*-*************************************
+*  Context memory management
+***************************************/
+struct ZSTD_CDict_s {
+    const void* dictContent;
+    size_t dictContentSize;
+    U32* entropyWorkspace; /* entropy workspace of HUF_WORKSPACE_SIZE bytes */
+    ZSTD_cwksp workspace;
+    ZSTD_matchState_t matchState;
+    ZSTD_compressedBlockState_t cBlockState;
+    ZSTD_customMem customMem;
+    U32 dictID;
+    int compressionLevel; /* 0 indicates that advanced API was used to select CDict params */
+};  /* typedef'd to ZSTD_CDict within "zstd.h" */
+
+ZSTD_CCtx* ZSTD_createCCtx(void)
+{
+    return ZSTD_createCCtx_advanced({NULL, NULL, NULL});
+}
+
+static void ZSTD_initCCtx(ZSTD_CCtx* cctx, ZSTD_customMem memManager)
+{
+    assert(cctx != NULL);
+    memset(cctx, 0, sizeof(*cctx));
+    cctx->customMem = memManager;
+    cctx->bmi2 = 0;
+    {   size_t const err = ZSTD_CCtx_reset(cctx, ZSTD_reset_parameters);
+        assert(!ZSTD_isError(err));
+        (void)err;
+    }
+}
+
+ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
+{
+    ZSTD_STATIC_ASSERT(zcss_init==0);
+    ZSTD_STATIC_ASSERT(ZSTD_CONTENTSIZE_UNKNOWN==(0ULL - 1));
+    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
+    {   ZSTD_CCtx* const cctx = (ZSTD_CCtx*)ZSTD_malloc(sizeof(ZSTD_CCtx), customMem);
+        if (!cctx) return NULL;
+        ZSTD_initCCtx(cctx, customMem);
+        return cctx;
+    }
+}
+
+ZSTD_CCtx* ZSTD_initStaticCCtx(void* workspace, size_t workspaceSize)
+{
+    ZSTD_cwksp ws;
+    ZSTD_CCtx* cctx;
+    if (workspaceSize <= sizeof(ZSTD_CCtx)) return NULL;  /* minimum size */
+    if ((size_t)workspace & 7) return NULL;  /* must be 8-aligned */
+    ZSTD_cwksp_init(&ws, workspace, workspaceSize);
+
+    cctx = (ZSTD_CCtx*)ZSTD_cwksp_reserve_object(&ws, sizeof(ZSTD_CCtx));
+    if (cctx == NULL) return NULL;
+
+    memset(cctx, 0, sizeof(ZSTD_CCtx));
+    ZSTD_cwksp_move(&cctx->workspace, &ws);
+    cctx->staticSize = workspaceSize;
+
+    /* statically sized space. entropyWorkspace never moves (but prev/next block swap places) */
+    if (!ZSTD_cwksp_check_available(&cctx->workspace, HUF_WORKSPACE_SIZE + 2 * sizeof(ZSTD_compressedBlockState_t))) return NULL;
+    cctx->blockState.prevCBlock = (ZSTD_compressedBlockState_t*)ZSTD_cwksp_reserve_object(&cctx->workspace, sizeof(ZSTD_compressedBlockState_t));
+    cctx->blockState.nextCBlock = (ZSTD_compressedBlockState_t*)ZSTD_cwksp_reserve_object(&cctx->workspace, sizeof(ZSTD_compressedBlockState_t));
+    cctx->entropyWorkspace = (U32*)ZSTD_cwksp_reserve_object(&cctx->workspace, HUF_WORKSPACE_SIZE);
+    cctx->bmi2 = 0;
+    return cctx;
+}
+
+/**
+ * Clears and frees all of the dictionaries in the CCtx.
+ */
+static void ZSTD_clearAllDicts(ZSTD_CCtx* cctx)
+{
+    ZSTD_free(cctx->localDict.dictBuffer, cctx->customMem);
+    ZSTD_freeCDict(cctx->localDict.cdict);
+    memset(&cctx->localDict, 0, sizeof(cctx->localDict));
+    memset(&cctx->prefixDict, 0, sizeof(cctx->prefixDict));
+    cctx->cdict = NULL;
+}
+
+static size_t ZSTD_sizeof_localDict(ZSTD_localDict dict)
+{
+    size_t const bufferSize = dict.dictBuffer != NULL ? dict.dictSize : 0;
+    size_t const cdictSize = ZSTD_sizeof_CDict(dict.cdict);
+    return bufferSize + cdictSize;
+}
+
+static void ZSTD_freeCCtxContent(ZSTD_CCtx* cctx)
+{
+    assert(cctx != NULL);
+    assert(cctx->staticSize == 0);
+    ZSTD_clearAllDicts(cctx);
+#ifdef ZSTD_MULTITHREAD
+    ZSTDMT_freeCCtx(cctx->mtctx); cctx->mtctx = NULL;
+#endif
+    ZSTD_cwksp_free(&cctx->workspace, cctx->customMem);
+}
+
+size_t ZSTD_freeCCtx(ZSTD_CCtx* cctx)
+{
+    if (cctx==NULL) return 0;   /* support free on NULL */
+    RETURN_ERROR_IF(cctx->staticSize, memory_allocation,
+                    "not compatible with static CCtx");
+    {
+        int cctxInWorkspace = ZSTD_cwksp_owns_buffer(&cctx->workspace, cctx);
+        ZSTD_freeCCtxContent(cctx);
+        if (!cctxInWorkspace) {
+            ZSTD_free(cctx, cctx->customMem);
+        }
+    }
+    return 0;
+}
+
+
+static size_t ZSTD_sizeof_mtctx(const ZSTD_CCtx* cctx)
+{
+#ifdef ZSTD_MULTITHREAD
+    return ZSTDMT_sizeof_CCtx(cctx->mtctx);
+#else
+    (void)cctx;
+    return 0;
+#endif
+}
+
+
+size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx)
+{
+    if (cctx==NULL) return 0;   /* support sizeof on NULL */
+    /* cctx may be in the workspace */
+    return (cctx->workspace.workspace == cctx ? 0 : sizeof(*cctx))
+           + ZSTD_cwksp_sizeof(&cctx->workspace)
+           + ZSTD_sizeof_localDict(cctx->localDict)
+           + ZSTD_sizeof_mtctx(cctx);
+}
+
+size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs)
+{
+    return ZSTD_sizeof_CCtx(zcs);  /* same object */
+}
+
+/* private API call, for dictBuilder only */
+const seqStore_t* ZSTD_getSeqStore(const ZSTD_CCtx* ctx) { return &(ctx->seqStore); }
+
+static ZSTD_CCtx_params ZSTD_makeCCtxParamsFromCParams(
+        ZSTD_compressionParameters cParams)
+{
+    ZSTD_CCtx_params cctxParams;
+    memset(&cctxParams, 0, sizeof(cctxParams));
+    cctxParams.cParams = cParams;
+    cctxParams.compressionLevel = ZSTD_CLEVEL_DEFAULT;  /* should not matter, as all cParams are presumed properly defined */
+    assert(!ZSTD_checkCParams(cParams));
+    cctxParams.fParams.contentSizeFlag = 1;
+    return cctxParams;
+}
+
+static ZSTD_CCtx_params* ZSTD_createCCtxParams_advanced(
+        ZSTD_customMem customMem)
+{
+    ZSTD_CCtx_params* params;
+    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
+    params = (ZSTD_CCtx_params*)ZSTD_calloc(
+            sizeof(ZSTD_CCtx_params), customMem);
+    if (!params) { return NULL; }
+    params->customMem = customMem;
+    params->compressionLevel = ZSTD_CLEVEL_DEFAULT;
+    params->fParams.contentSizeFlag = 1;
+    return params;
+}
+
+ZSTD_CCtx_params* ZSTD_createCCtxParams(void)
+{
+    return ZSTD_createCCtxParams_advanced(ZSTDInternalConstants::ZSTD_defaultCMem);
+}
+
+size_t ZSTD_freeCCtxParams(ZSTD_CCtx_params* params)
+{
+    if (params == NULL) { return 0; }
+    ZSTD_free(params, params->customMem);
+    return 0;
+}
+
+size_t ZSTD_CCtxParams_reset(ZSTD_CCtx_params* params)
+{
+    return ZSTD_CCtxParams_init(params, ZSTD_CLEVEL_DEFAULT);
+}
+
+size_t ZSTD_CCtxParams_init(ZSTD_CCtx_params* cctxParams, int compressionLevel) {
+    RETURN_ERROR_IF(!cctxParams, GENERIC, "NULL pointer!");
+    memset(cctxParams, 0, sizeof(*cctxParams));
+    cctxParams->compressionLevel = compressionLevel;
+    cctxParams->fParams.contentSizeFlag = 1;
+    return 0;
+}
+
+size_t ZSTD_CCtxParams_init_advanced(ZSTD_CCtx_params* cctxParams, ZSTD_parameters params)
+{
+    RETURN_ERROR_IF(!cctxParams, GENERIC, "NULL pointer!");
+    FORWARD_IF_ERROR( ZSTD_checkCParams(params.cParams) , "");
+    memset(cctxParams, 0, sizeof(*cctxParams));
+    assert(!ZSTD_checkCParams(params.cParams));
+    cctxParams->cParams = params.cParams;
+    cctxParams->fParams = params.fParams;
+    cctxParams->compressionLevel = ZSTD_CLEVEL_DEFAULT;   /* should not matter, as all cParams are presumed properly defined */
+    return 0;
+}
+
+/* ZSTD_assignParamsToCCtxParams() :
+ * params is presumed valid at this stage */
+static ZSTD_CCtx_params ZSTD_assignParamsToCCtxParams(
+        const ZSTD_CCtx_params* cctxParams, const ZSTD_parameters* params)
+{
+    ZSTD_CCtx_params ret = *cctxParams;
+    assert(!ZSTD_checkCParams(params->cParams));
+    ret.cParams = params->cParams;
+    ret.fParams = params->fParams;
+    ret.compressionLevel = ZSTD_CLEVEL_DEFAULT;   /* should not matter, as all cParams are presumed properly defined */
+    return ret;
+}
+
+ZSTD_bounds ZSTD_cParam_getBounds(ZSTD_cParameter param)
+{
+    ZSTD_bounds bounds = { 0, 0, 0 };
+
+    switch(param)
+    {
+    case ZSTD_c_compressionLevel:
+        bounds.lowerBound = ZSTD_minCLevel();
+        bounds.upperBound = ZSTD_maxCLevel();
+        return bounds;
+
+    case ZSTD_c_windowLog:
+        bounds.lowerBound = ZSTD_WINDOWLOG_MIN;
+        bounds.upperBound = ZSTD_WINDOWLOG_MAX;
+        return bounds;
+
+    case ZSTD_c_hashLog:
+        bounds.lowerBound = ZSTD_HASHLOG_MIN;
+        bounds.upperBound = ZSTD_HASHLOG_MAX;
+        return bounds;
+
+    case ZSTD_c_chainLog:
+        bounds.lowerBound = ZSTD_CHAINLOG_MIN;
+        bounds.upperBound = ZSTD_CHAINLOG_MAX;
+        return bounds;
+
+    case ZSTD_c_searchLog:
+        bounds.lowerBound = ZSTD_SEARCHLOG_MIN;
+        bounds.upperBound = ZSTD_SEARCHLOG_MAX;
+        return bounds;
+
+    case ZSTD_c_minMatch:
+        bounds.lowerBound = ZSTD_MINMATCH_MIN;
+        bounds.upperBound = ZSTD_MINMATCH_MAX;
+        return bounds;
+
+    case ZSTD_c_targetLength:
+        bounds.lowerBound = ZSTD_TARGETLENGTH_MIN;
+        bounds.upperBound = ZSTD_TARGETLENGTH_MAX;
+        return bounds;
+
+    case ZSTD_c_strategy:
+        bounds.lowerBound = ZSTD_STRATEGY_MIN;
+        bounds.upperBound = ZSTD_STRATEGY_MAX;
+        return bounds;
+
+    case ZSTD_c_contentSizeFlag:
+        bounds.lowerBound = 0;
+        bounds.upperBound = 1;
+        return bounds;
+
+    case ZSTD_c_checksumFlag:
+        bounds.lowerBound = 0;
+        bounds.upperBound = 1;
+        return bounds;
+
+    case ZSTD_c_dictIDFlag:
+        bounds.lowerBound = 0;
+        bounds.upperBound = 1;
+        return bounds;
+
+    case ZSTD_c_nbWorkers:
+        bounds.lowerBound = 0;
+#ifdef ZSTD_MULTITHREAD
+        bounds.upperBound = ZSTDMT_NBWORKERS_MAX;
+#else
+        bounds.upperBound = 0;
+#endif
+        return bounds;
+
+    case ZSTD_c_jobSize:
+        bounds.lowerBound = 0;
+#ifdef ZSTD_MULTITHREAD
+        bounds.upperBound = ZSTDMT_JOBSIZE_MAX;
+#else
+        bounds.upperBound = 0;
+#endif
+        return bounds;
+
+    case ZSTD_c_overlapLog:
+#ifdef ZSTD_MULTITHREAD
+        bounds.lowerBound = ZSTD_OVERLAPLOG_MIN;
+        bounds.upperBound = ZSTD_OVERLAPLOG_MAX;
+#else
+        bounds.lowerBound = 0;
+        bounds.upperBound = 0;
+#endif
+        return bounds;
+
+    case ZSTD_c_enableLongDistanceMatching:
+        bounds.lowerBound = 0;
+        bounds.upperBound = 1;
+        return bounds;
+
+    case ZSTD_c_ldmHashLog:
+        bounds.lowerBound = ZSTD_LDM_HASHLOG_MIN;
+        bounds.upperBound = ZSTD_LDM_HASHLOG_MAX;
+        return bounds;
+
+    case ZSTD_c_ldmMinMatch:
+        bounds.lowerBound = ZSTD_LDM_MINMATCH_MIN;
+        bounds.upperBound = ZSTD_LDM_MINMATCH_MAX;
+        return bounds;
+
+    case ZSTD_c_ldmBucketSizeLog:
+        bounds.lowerBound = ZSTD_LDM_BUCKETSIZELOG_MIN;
+        bounds.upperBound = ZSTD_LDM_BUCKETSIZELOG_MAX;
+        return bounds;
+
+    case ZSTD_c_ldmHashRateLog:
+        bounds.lowerBound = ZSTD_LDM_HASHRATELOG_MIN;
+        bounds.upperBound = ZSTD_LDM_HASHRATELOG_MAX;
+        return bounds;
+
+    /* experimental parameters */
+    case ZSTD_c_rsyncable:
+        bounds.lowerBound = 0;
+        bounds.upperBound = 1;
+        return bounds;
+
+    case ZSTD_c_forceMaxWindow :
+        bounds.lowerBound = 0;
+        bounds.upperBound = 1;
+        return bounds;
+
+    case ZSTD_c_format:
+        ZSTD_STATIC_ASSERT(ZSTD_f_zstd1 < ZSTD_f_zstd1_magicless);
+        bounds.lowerBound = ZSTD_f_zstd1;
+        bounds.upperBound = ZSTD_f_zstd1_magicless;   /* note : how to ensure at compile time that this is the highest value enum ? */
+        return bounds;
+
+    case ZSTD_c_forceAttachDict:
+        ZSTD_STATIC_ASSERT(ZSTD_dictDefaultAttach < ZSTD_dictForceCopy);
+        bounds.lowerBound = ZSTD_dictDefaultAttach;
+        bounds.upperBound = ZSTD_dictForceLoad;       /* note : how to ensure at compile time that this is the highest value enum ? */
+        return bounds;
+
+    case ZSTD_c_literalCompressionMode:
+        ZSTD_STATIC_ASSERT(ZSTD_lcm_auto < ZSTD_lcm_huffman && ZSTD_lcm_huffman < ZSTD_lcm_uncompressed);
+        bounds.lowerBound = ZSTD_lcm_auto;
+        bounds.upperBound = ZSTD_lcm_uncompressed;
+        return bounds;
+
+    case ZSTD_c_targetCBlockSize:
+        bounds.lowerBound = ZSTD_TARGETCBLOCKSIZE_MIN;
+        bounds.upperBound = ZSTD_TARGETCBLOCKSIZE_MAX;
+        return bounds;
+
+    case ZSTD_c_srcSizeHint:
+        bounds.lowerBound = ZSTD_SRCSIZEHINT_MIN;
+        bounds.upperBound = ZSTD_SRCSIZEHINT_MAX;
+        return bounds;
+
+    default:
+        bounds.error = ERROR(parameter_unsupported);
+        return bounds;
+    }
+}
+
+/* ZSTD_cParam_clampBounds:
+ * Clamps the value into the bounded range.
+ */
+static size_t ZSTD_cParam_clampBounds(ZSTD_cParameter cParam, int* value)
+{
+    ZSTD_bounds const bounds = ZSTD_cParam_getBounds(cParam);
+    if (ZSTD_isError(bounds.error)) return bounds.error;
+    if (*value < bounds.lowerBound) *value = bounds.lowerBound;
+    if (*value > bounds.upperBound) *value = bounds.upperBound;
+    return 0;
+}
+
+#define BOUNDCHECK(cParam, val) { \
+    RETURN_ERROR_IF(!ZSTD_cParam_withinBounds(cParam,val), \
+                    parameter_outOfBound, "Param out of bounds"); \
+}
+
+
+static int ZSTD_isUpdateAuthorized(ZSTD_cParameter param)
+{
+    switch(param)
+    {
+    case ZSTD_c_compressionLevel:
+    case ZSTD_c_hashLog:
+    case ZSTD_c_chainLog:
+    case ZSTD_c_searchLog:
+    case ZSTD_c_minMatch:
+    case ZSTD_c_targetLength:
+    case ZSTD_c_strategy:
+        return 1;
+
+    case ZSTD_c_format:
+    case ZSTD_c_windowLog:
+    case ZSTD_c_contentSizeFlag:
+    case ZSTD_c_checksumFlag:
+    case ZSTD_c_dictIDFlag:
+    case ZSTD_c_forceMaxWindow :
+    case ZSTD_c_nbWorkers:
+    case ZSTD_c_jobSize:
+    case ZSTD_c_overlapLog:
+    case ZSTD_c_rsyncable:
+    case ZSTD_c_enableLongDistanceMatching:
+    case ZSTD_c_ldmHashLog:
+    case ZSTD_c_ldmMinMatch:
+    case ZSTD_c_ldmBucketSizeLog:
+    case ZSTD_c_ldmHashRateLog:
+    case ZSTD_c_forceAttachDict:
+    case ZSTD_c_literalCompressionMode:
+    case ZSTD_c_targetCBlockSize:
+    case ZSTD_c_srcSizeHint:
+    default:
+        return 0;
+    }
+}
+
+size_t ZSTD_CCtx_setParameter(ZSTD_CCtx* cctx, ZSTD_cParameter param, int value)
+{
+    DEBUGLOG(4, "ZSTD_CCtx_setParameter (%i, %i)", (int)param, value);
+    if (cctx->streamStage != zcss_init) {
+        if (ZSTD_isUpdateAuthorized(param)) {
+            cctx->cParamsChanged = 1;
+        } else {
+            RETURN_ERROR(stage_wrong, "can only set params in ctx init stage");
+    }   }
+
+    switch(param)
+    {
+    case ZSTD_c_nbWorkers:
+        RETURN_ERROR_IF((value!=0) && cctx->staticSize, parameter_unsupported,
+                        "MT not compatible with static alloc");
+        break;
+
+    case ZSTD_c_compressionLevel:
+    case ZSTD_c_windowLog:
+    case ZSTD_c_hashLog:
+    case ZSTD_c_chainLog:
+    case ZSTD_c_searchLog:
+    case ZSTD_c_minMatch:
+    case ZSTD_c_targetLength:
+    case ZSTD_c_strategy:
+    case ZSTD_c_ldmHashRateLog:
+    case ZSTD_c_format:
+    case ZSTD_c_contentSizeFlag:
+    case ZSTD_c_checksumFlag:
+    case ZSTD_c_dictIDFlag:
+    case ZSTD_c_forceMaxWindow:
+    case ZSTD_c_forceAttachDict:
+    case ZSTD_c_literalCompressionMode:
+    case ZSTD_c_jobSize:
+    case ZSTD_c_overlapLog:
+    case ZSTD_c_rsyncable:
+    case ZSTD_c_enableLongDistanceMatching:
+    case ZSTD_c_ldmHashLog:
+    case ZSTD_c_ldmMinMatch:
+    case ZSTD_c_ldmBucketSizeLog:
+    case ZSTD_c_targetCBlockSize:
+    case ZSTD_c_srcSizeHint:
+        break;
+
+    default: RETURN_ERROR(parameter_unsupported, "unknown parameter");
+    }
+    return ZSTD_CCtxParams_setParameter(&cctx->requestedParams, param, value);
+}
+
+size_t ZSTD_CCtxParams_setParameter(ZSTD_CCtx_params* CCtxParams,
+                                    ZSTD_cParameter param, int value)
+{
+    DEBUGLOG(4, "ZSTD_CCtxParams_setParameter (%i, %i)", (int)param, value);
+    switch(param)
+    {
+    case ZSTD_c_format :
+        BOUNDCHECK(ZSTD_c_format, value);
+        CCtxParams->format = (ZSTD_format_e)value;
+        return (size_t)CCtxParams->format;
+
+    case ZSTD_c_compressionLevel : {
+        FORWARD_IF_ERROR(ZSTD_cParam_clampBounds(param, &value), "");
+        if (value) {  /* 0 : does not change current level */
+            CCtxParams->compressionLevel = value;
+        }
+        if (CCtxParams->compressionLevel >= 0) return (size_t)CCtxParams->compressionLevel;
+        return 0;  /* return type (size_t) cannot represent negative values */
+    }
+
+    case ZSTD_c_windowLog :
+        if (value!=0)   /* 0 => use default */
+            BOUNDCHECK(ZSTD_c_windowLog, value);
+        CCtxParams->cParams.windowLog = (U32)value;
+        return CCtxParams->cParams.windowLog;
+
+    case ZSTD_c_hashLog :
+        if (value!=0)   /* 0 => use default */
+            BOUNDCHECK(ZSTD_c_hashLog, value);
+        CCtxParams->cParams.hashLog = (U32)value;
+        return CCtxParams->cParams.hashLog;
+
+    case ZSTD_c_chainLog :
+        if (value!=0)   /* 0 => use default */
+            BOUNDCHECK(ZSTD_c_chainLog, value);
+        CCtxParams->cParams.chainLog = (U32)value;
+        return CCtxParams->cParams.chainLog;
+
+    case ZSTD_c_searchLog :
+        if (value!=0)   /* 0 => use default */
+            BOUNDCHECK(ZSTD_c_searchLog, value);
+        CCtxParams->cParams.searchLog = (U32)value;
+        return (size_t)value;
+
+    case ZSTD_c_minMatch :
+        if (value!=0)   /* 0 => use default */
+            BOUNDCHECK(ZSTD_c_minMatch, value);
+        CCtxParams->cParams.minMatch = value;
+        return CCtxParams->cParams.minMatch;
+
+    case ZSTD_c_targetLength :
+        BOUNDCHECK(ZSTD_c_targetLength, value);
+        CCtxParams->cParams.targetLength = value;
+        return CCtxParams->cParams.targetLength;
+
+    case ZSTD_c_strategy :
+        if (value!=0)   /* 0 => use default */
+            BOUNDCHECK(ZSTD_c_strategy, value);
+        CCtxParams->cParams.strategy = (ZSTD_strategy)value;
+        return (size_t)CCtxParams->cParams.strategy;
+
+    case ZSTD_c_contentSizeFlag :
+        /* Content size written in frame header _when known_ (default:1) */
+        DEBUGLOG(4, "set content size flag = %u", (value!=0));
+        CCtxParams->fParams.contentSizeFlag = value != 0;
+        return CCtxParams->fParams.contentSizeFlag;
+
+    case ZSTD_c_checksumFlag :
+        /* A 32-bits content checksum will be calculated and written at end of frame (default:0) */
+        CCtxParams->fParams.checksumFlag = value != 0;
+        return CCtxParams->fParams.checksumFlag;
+
+    case ZSTD_c_dictIDFlag : /* When applicable, dictionary's dictID is provided in frame header (default:1) */
+        DEBUGLOG(4, "set dictIDFlag = %u", (value!=0));
+        CCtxParams->fParams.noDictIDFlag = !value;
+        return !CCtxParams->fParams.noDictIDFlag;
+
+    case ZSTD_c_forceMaxWindow :
+        CCtxParams->forceWindow = (value != 0);
+        return CCtxParams->forceWindow;
+
+    case ZSTD_c_forceAttachDict : {
+        const ZSTD_dictAttachPref_e pref = (ZSTD_dictAttachPref_e)value;
+        BOUNDCHECK(ZSTD_c_forceAttachDict, pref);
+        CCtxParams->attachDictPref = pref;
+        return CCtxParams->attachDictPref;
+    }
+
+    case ZSTD_c_literalCompressionMode : {
+        const ZSTD_literalCompressionMode_e lcm = (ZSTD_literalCompressionMode_e)value;
+        BOUNDCHECK(ZSTD_c_literalCompressionMode, lcm);
+        CCtxParams->literalCompressionMode = lcm;
+        return CCtxParams->literalCompressionMode;
+    }
+
+    case ZSTD_c_nbWorkers :
+#ifndef ZSTD_MULTITHREAD
+        RETURN_ERROR_IF(value!=0, parameter_unsupported, "not compiled with multithreading");
+        return 0;
+#else
+        FORWARD_IF_ERROR(ZSTD_cParam_clampBounds(param, &value), "");
+        CCtxParams->nbWorkers = value;
+        return CCtxParams->nbWorkers;
+#endif
+
+    case ZSTD_c_jobSize :
+#ifndef ZSTD_MULTITHREAD
+        RETURN_ERROR_IF(value!=0, parameter_unsupported, "not compiled with multithreading");
+        return 0;
+#else
+        /* Adjust to the minimum non-default value. */
+        if (value != 0 && value < ZSTDMT_JOBSIZE_MIN)
+            value = ZSTDMT_JOBSIZE_MIN;
+        FORWARD_IF_ERROR(ZSTD_cParam_clampBounds(param, &value), "");
+        assert(value >= 0);
+        CCtxParams->jobSize = value;
+        return CCtxParams->jobSize;
+#endif
+
+    case ZSTD_c_overlapLog :
+#ifndef ZSTD_MULTITHREAD
+        RETURN_ERROR_IF(value!=0, parameter_unsupported, "not compiled with multithreading");
+        return 0;
+#else
+        FORWARD_IF_ERROR(ZSTD_cParam_clampBounds(ZSTD_c_overlapLog, &value), "");
+        CCtxParams->overlapLog = value;
+        return CCtxParams->overlapLog;
+#endif
+
+    case ZSTD_c_rsyncable :
+#ifndef ZSTD_MULTITHREAD
+        RETURN_ERROR_IF(value!=0, parameter_unsupported, "not compiled with multithreading");
+        return 0;
+#else
+        FORWARD_IF_ERROR(ZSTD_cParam_clampBounds(ZSTD_c_overlapLog, &value), "");
+        CCtxParams->rsyncable = value;
+        return CCtxParams->rsyncable;
+#endif
+
+    case ZSTD_c_enableLongDistanceMatching :
+        CCtxParams->ldmParams.enableLdm = (value!=0);
+        return CCtxParams->ldmParams.enableLdm;
+
+    case ZSTD_c_ldmHashLog :
+        if (value!=0)   /* 0 ==> auto */
+            BOUNDCHECK(ZSTD_c_ldmHashLog, value);
+        CCtxParams->ldmParams.hashLog = value;
+        return CCtxParams->ldmParams.hashLog;
+
+    case ZSTD_c_ldmMinMatch :
+        if (value!=0)   /* 0 ==> default */
+            BOUNDCHECK(ZSTD_c_ldmMinMatch, value);
+        CCtxParams->ldmParams.minMatchLength = value;
+        return CCtxParams->ldmParams.minMatchLength;
+
+    case ZSTD_c_ldmBucketSizeLog :
+        if (value!=0)   /* 0 ==> default */
+            BOUNDCHECK(ZSTD_c_ldmBucketSizeLog, value);
+        CCtxParams->ldmParams.bucketSizeLog = value;
+        return CCtxParams->ldmParams.bucketSizeLog;
+
+    case ZSTD_c_ldmHashRateLog :
+        RETURN_ERROR_IF(value > ZSTD_WINDOWLOG_MAX - ZSTD_HASHLOG_MIN,
+                        parameter_outOfBound, "Param out of bounds!");
+        CCtxParams->ldmParams.hashRateLog = value;
+        return CCtxParams->ldmParams.hashRateLog;
+
+    case ZSTD_c_targetCBlockSize :
+        if (value!=0)   /* 0 ==> default */
+            BOUNDCHECK(ZSTD_c_targetCBlockSize, value);
+        CCtxParams->targetCBlockSize = value;
+        return CCtxParams->targetCBlockSize;
+
+    case ZSTD_c_srcSizeHint :
+        if (value!=0)    /* 0 ==> default */
+            BOUNDCHECK(ZSTD_c_srcSizeHint, value);
+        CCtxParams->srcSizeHint = value;
+        return CCtxParams->srcSizeHint;
+
+    default: RETURN_ERROR(parameter_unsupported, "unknown parameter");
+    }
+}
+
+size_t ZSTD_CCtx_getParameter(ZSTD_CCtx* cctx, ZSTD_cParameter param, int* value)
+{
+    return ZSTD_CCtxParams_getParameter(&cctx->requestedParams, param, value);
+}
+
+size_t ZSTD_CCtxParams_getParameter(
+        ZSTD_CCtx_params* CCtxParams, ZSTD_cParameter param, int* value)
+{
+    switch(param)
+    {
+    case ZSTD_c_format :
+        *value = CCtxParams->format;
+        break;
+    case ZSTD_c_compressionLevel :
+        *value = CCtxParams->compressionLevel;
+        break;
+    case ZSTD_c_windowLog :
+        *value = (int)CCtxParams->cParams.windowLog;
+        break;
+    case ZSTD_c_hashLog :
+        *value = (int)CCtxParams->cParams.hashLog;
+        break;
+    case ZSTD_c_chainLog :
+        *value = (int)CCtxParams->cParams.chainLog;
+        break;
+    case ZSTD_c_searchLog :
+        *value = CCtxParams->cParams.searchLog;
+        break;
+    case ZSTD_c_minMatch :
+        *value = CCtxParams->cParams.minMatch;
+        break;
+    case ZSTD_c_targetLength :
+        *value = CCtxParams->cParams.targetLength;
+        break;
+    case ZSTD_c_strategy :
+        *value = (unsigned)CCtxParams->cParams.strategy;
+        break;
+    case ZSTD_c_contentSizeFlag :
+        *value = CCtxParams->fParams.contentSizeFlag;
+        break;
+    case ZSTD_c_checksumFlag :
+        *value = CCtxParams->fParams.checksumFlag;
+        break;
+    case ZSTD_c_dictIDFlag :
+        *value = !CCtxParams->fParams.noDictIDFlag;
+        break;
+    case ZSTD_c_forceMaxWindow :
+        *value = CCtxParams->forceWindow;
+        break;
+    case ZSTD_c_forceAttachDict :
+        *value = CCtxParams->attachDictPref;
+        break;
+    case ZSTD_c_literalCompressionMode :
+        *value = CCtxParams->literalCompressionMode;
+        break;
+    case ZSTD_c_nbWorkers :
+#ifndef ZSTD_MULTITHREAD
+        assert(CCtxParams->nbWorkers == 0);
+#endif
+        *value = CCtxParams->nbWorkers;
+        break;
+    case ZSTD_c_jobSize :
+#ifndef ZSTD_MULTITHREAD
+        RETURN_ERROR(parameter_unsupported, "not compiled with multithreading");
+#else
+        assert(CCtxParams->jobSize <= INT_MAX);
+        *value = (int)CCtxParams->jobSize;
+        break;
+#endif
+    case ZSTD_c_overlapLog :
+#ifndef ZSTD_MULTITHREAD
+        RETURN_ERROR(parameter_unsupported, "not compiled with multithreading");
+#else
+        *value = CCtxParams->overlapLog;
+        break;
+#endif
+    case ZSTD_c_rsyncable :
+#ifndef ZSTD_MULTITHREAD
+        RETURN_ERROR(parameter_unsupported, "not compiled with multithreading");
+#else
+        *value = CCtxParams->rsyncable;
+        break;
+#endif
+    case ZSTD_c_enableLongDistanceMatching :
+        *value = CCtxParams->ldmParams.enableLdm;
+        break;
+    case ZSTD_c_ldmHashLog :
+        *value = CCtxParams->ldmParams.hashLog;
+        break;
+    case ZSTD_c_ldmMinMatch :
+        *value = CCtxParams->ldmParams.minMatchLength;
+        break;
+    case ZSTD_c_ldmBucketSizeLog :
+        *value = CCtxParams->ldmParams.bucketSizeLog;
+        break;
+    case ZSTD_c_ldmHashRateLog :
+        *value = CCtxParams->ldmParams.hashRateLog;
+        break;
+    case ZSTD_c_targetCBlockSize :
+        *value = (int)CCtxParams->targetCBlockSize;
+        break;
+    case ZSTD_c_srcSizeHint :
+        *value = (int)CCtxParams->srcSizeHint;
+        break;
+    default: RETURN_ERROR(parameter_unsupported, "unknown parameter");
+    }
+    return 0;
+}
+
+/** ZSTD_CCtx_setParametersUsingCCtxParams() :
+ *  just applies `params` into `cctx`
+ *  no action is performed, parameters are merely stored.
+ *  If ZSTDMT is enabled, parameters are pushed to cctx->mtctx.
+ *    This is possible even if a compression is ongoing.
+ *    In which case, new parameters will be applied on the fly, starting with next compression job.
+ */
+size_t ZSTD_CCtx_setParametersUsingCCtxParams(
+        ZSTD_CCtx* cctx, const ZSTD_CCtx_params* params)
+{
+    DEBUGLOG(4, "ZSTD_CCtx_setParametersUsingCCtxParams");
+    RETURN_ERROR_IF(cctx->streamStage != zcss_init, stage_wrong,
+                    "The context is in the wrong stage!");
+    RETURN_ERROR_IF(cctx->cdict, stage_wrong,
+                    "Can't override parameters with cdict attached (some must "
+                    "be inherited from the cdict).");
+
+    cctx->requestedParams = *params;
+    return 0;
+}
+
+ZSTDLIB_API size_t ZSTD_CCtx_setPledgedSrcSize(ZSTD_CCtx* cctx, unsigned long long pledgedSrcSize)
+{
+    DEBUGLOG(4, "ZSTD_CCtx_setPledgedSrcSize to %u bytes", (U32)pledgedSrcSize);
+    RETURN_ERROR_IF(cctx->streamStage != zcss_init, stage_wrong,
+                    "Can't set pledgedSrcSize when not in init stage.");
+    cctx->pledgedSrcSizePlusOne = pledgedSrcSize+1;
+    return 0;
+}
+
+/**
+ * Initializes the local dict using the requested parameters.
+ * NOTE: This does not use the pledged src size, because it may be used for more
+ * than one compression.
+ */
+static size_t ZSTD_initLocalDict(ZSTD_CCtx* cctx)
+{
+    ZSTD_localDict* const dl = &cctx->localDict;
+    ZSTD_compressionParameters const cParams = ZSTD_getCParamsFromCCtxParams(
+            &cctx->requestedParams, ZSTD_CONTENTSIZE_UNKNOWN, dl->dictSize);
+    if (dl->dict == NULL) {
+        /* No local dictionary. */
+        assert(dl->dictBuffer == NULL);
+        assert(dl->cdict == NULL);
+        assert(dl->dictSize == 0);
+        return 0;
+    }
+    if (dl->cdict != NULL) {
+        assert(cctx->cdict == dl->cdict);
+        /* Local dictionary already initialized. */
+        return 0;
+    }
+    assert(dl->dictSize > 0);
+    assert(cctx->cdict == NULL);
+    assert(cctx->prefixDict.dict == NULL);
+
+    dl->cdict = ZSTD_createCDict_advanced(
+            dl->dict,
+            dl->dictSize,
+            ZSTD_dlm_byRef,
+            dl->dictContentType,
+            cParams,
+            cctx->customMem);
+    RETURN_ERROR_IF(!dl->cdict, memory_allocation, "ZSTD_createCDict_advanced failed");
+    cctx->cdict = dl->cdict;
+    return 0;
+}
+
+size_t ZSTD_CCtx_loadDictionary_advanced(
+        ZSTD_CCtx* cctx, const void* dict, size_t dictSize,
+        ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_dictContentType_e dictContentType)
+{
+    RETURN_ERROR_IF(cctx->streamStage != zcss_init, stage_wrong,
+                    "Can't load a dictionary when ctx is not in init stage.");
+    RETURN_ERROR_IF(cctx->staticSize, memory_allocation,
+                    "no malloc for static CCtx");
+    DEBUGLOG(4, "ZSTD_CCtx_loadDictionary_advanced (size: %u)", (U32)dictSize);
+    ZSTD_clearAllDicts(cctx);  /* in case one already exists */
+    if (dict == NULL || dictSize == 0)  /* no dictionary mode */
+        return 0;
+    if (dictLoadMethod == ZSTD_dlm_byRef) {
+        cctx->localDict.dict = dict;
+    } else {
+        void* dictBuffer = ZSTD_malloc(dictSize, cctx->customMem);
+        RETURN_ERROR_IF(!dictBuffer, memory_allocation, "NULL pointer!");
+        memcpy(dictBuffer, dict, dictSize);
+        cctx->localDict.dictBuffer = dictBuffer;
+        cctx->localDict.dict = dictBuffer;
+    }
+    cctx->localDict.dictSize = dictSize;
+    cctx->localDict.dictContentType = dictContentType;
+    return 0;
+}
+
+ZSTDLIB_API size_t ZSTD_CCtx_loadDictionary_byReference(
+      ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
+{
+    return ZSTD_CCtx_loadDictionary_advanced(
+            cctx, dict, dictSize, ZSTD_dlm_byRef, ZSTD_dct_auto);
+}
+
+ZSTDLIB_API size_t ZSTD_CCtx_loadDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
+{
+    return ZSTD_CCtx_loadDictionary_advanced(
+            cctx, dict, dictSize, ZSTD_dlm_byCopy, ZSTD_dct_auto);
+}
+
+
+size_t ZSTD_CCtx_refCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict)
+{
+    RETURN_ERROR_IF(cctx->streamStage != zcss_init, stage_wrong,
+                    "Can't ref a dict when ctx not in init stage.");
+    /* Free the existing local cdict (if any) to save memory. */
+    ZSTD_clearAllDicts(cctx);
+    cctx->cdict = cdict;
+    return 0;
+}
+
+size_t ZSTD_CCtx_refPrefix(ZSTD_CCtx* cctx, const void* prefix, size_t prefixSize)
+{
+    return ZSTD_CCtx_refPrefix_advanced(cctx, prefix, prefixSize, ZSTD_dct_rawContent);
+}
+
+size_t ZSTD_CCtx_refPrefix_advanced(
+        ZSTD_CCtx* cctx, const void* prefix, size_t prefixSize, ZSTD_dictContentType_e dictContentType)
+{
+    RETURN_ERROR_IF(cctx->streamStage != zcss_init, stage_wrong,
+                    "Can't ref a prefix when ctx not in init stage.");
+    ZSTD_clearAllDicts(cctx);
+    if (prefix != NULL && prefixSize > 0) {
+        cctx->prefixDict.dict = prefix;
+        cctx->prefixDict.dictSize = prefixSize;
+        cctx->prefixDict.dictContentType = dictContentType;
+    }
+    return 0;
+}
+
+/*! ZSTD_CCtx_reset() :
+ *  Also dumps dictionary */
+size_t ZSTD_CCtx_reset(ZSTD_CCtx* cctx, ZSTD_ResetDirective reset)
+{
+    if ( (reset == ZSTD_reset_session_only)
+      || (reset == ZSTD_reset_session_and_parameters) ) {
+        cctx->streamStage = zcss_init;
+        cctx->pledgedSrcSizePlusOne = 0;
+    }
+    if ( (reset == ZSTD_reset_parameters)
+      || (reset == ZSTD_reset_session_and_parameters) ) {
+        RETURN_ERROR_IF(cctx->streamStage != zcss_init, stage_wrong,
+                        "Can't reset parameters only when not in init stage.");
+        ZSTD_clearAllDicts(cctx);
+        return ZSTD_CCtxParams_reset(&cctx->requestedParams);
+    }
+    return 0;
+}
+
+
+/** ZSTD_checkCParams() :
+    control CParam values remain within authorized range.
+    @return : 0, or an error code if one value is beyond authorized range */
+size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams)
+{
+    BOUNDCHECK(ZSTD_c_windowLog, (int)cParams.windowLog);
+    BOUNDCHECK(ZSTD_c_chainLog,  (int)cParams.chainLog);
+    BOUNDCHECK(ZSTD_c_hashLog,   (int)cParams.hashLog);
+    BOUNDCHECK(ZSTD_c_searchLog, (int)cParams.searchLog);
+    BOUNDCHECK(ZSTD_c_minMatch,  (int)cParams.minMatch);
+    BOUNDCHECK(ZSTD_c_targetLength,(int)cParams.targetLength);
+    BOUNDCHECK(ZSTD_c_strategy,  cParams.strategy);
+    return 0;
+}
+
+/** ZSTD_clampCParams() :
+ *  make CParam values within valid range.
+ *  @return : valid CParams */
+static ZSTD_compressionParameters
+ZSTD_clampCParams(ZSTD_compressionParameters cParams)
+{
+#   define CLAMP_TYPE(cParam, val, type) {                                \
+        ZSTD_bounds const bounds = ZSTD_cParam_getBounds(cParam);         \
+        if ((int)val<bounds.lowerBound) val=(type)bounds.lowerBound;      \
+        else if ((int)val>bounds.upperBound) val=(type)bounds.upperBound; \
+    }
+#   define CLAMP(cParam, val) CLAMP_TYPE(cParam, val, unsigned)
+    CLAMP(ZSTD_c_windowLog, cParams.windowLog);
+    CLAMP(ZSTD_c_chainLog,  cParams.chainLog);
+    CLAMP(ZSTD_c_hashLog,   cParams.hashLog);
+    CLAMP(ZSTD_c_searchLog, cParams.searchLog);
+    CLAMP(ZSTD_c_minMatch,  cParams.minMatch);
+    CLAMP(ZSTD_c_targetLength,cParams.targetLength);
+    CLAMP_TYPE(ZSTD_c_strategy,cParams.strategy, ZSTD_strategy);
+    return cParams;
+}
+
+/** ZSTD_cycleLog() :
+ *  condition for correct operation : hashLog > 1 */
+U32 ZSTD_cycleLog(U32 hashLog, ZSTD_strategy strat)
+{
+    U32 const btScale = ((U32)strat >= (U32)ZSTD_btlazy2);
+    return hashLog - btScale;
+}
+
+/** ZSTD_adjustCParams_internal() :
+ *  optimize `cPar` for a specified input (`srcSize` and `dictSize`).
+ *  mostly downsize to reduce memory consumption and initialization latency.
+ * `srcSize` can be ZSTD_CONTENTSIZE_UNKNOWN when not known.
+ *  note : `srcSize==0` means 0!
+ *  condition : cPar is presumed validated (can be checked using ZSTD_checkCParams()). */
+static ZSTD_compressionParameters
+ZSTD_adjustCParams_internal(ZSTD_compressionParameters cPar,
+                            unsigned long long srcSize,
+                            size_t dictSize)
+{
+    static const U64 minSrcSize = 513; /* (1<<9) + 1 */
+    static const U64 maxWindowResize = 1ULL << (ZSTD_WINDOWLOG_MAX-1);
+    assert(ZSTD_checkCParams(cPar)==0);
+
+    if (dictSize && srcSize == ZSTD_CONTENTSIZE_UNKNOWN)
+        srcSize = minSrcSize;
+
+    /* resize windowLog if input is small enough, to use less memory */
+    if ( (srcSize < maxWindowResize)
+      && (dictSize < maxWindowResize) )  {
+        U32 const tSize = (U32)(srcSize + dictSize);
+        static U32 const hashSizeMin = 1 << ZSTD_HASHLOG_MIN;
+        U32 const srcLog = (tSize < hashSizeMin) ? ZSTD_HASHLOG_MIN :
+                            ZSTD_highbit32(tSize-1) + 1;
+        if (cPar.windowLog > srcLog) cPar.windowLog = srcLog;
+    }
+    if (cPar.hashLog > cPar.windowLog+1) cPar.hashLog = cPar.windowLog+1;
+    {   U32 const cycleLog = ZSTD_cycleLog(cPar.chainLog, cPar.strategy);
+        if (cycleLog > cPar.windowLog)
+            cPar.chainLog -= (cycleLog - cPar.windowLog);
+    }
+
+    if (cPar.windowLog < ZSTD_WINDOWLOG_ABSOLUTEMIN)
+        cPar.windowLog = ZSTD_WINDOWLOG_ABSOLUTEMIN;  /* minimum wlog required for valid frame header */
+
+    return cPar;
+}
+
+ZSTD_compressionParameters
+ZSTD_adjustCParams(ZSTD_compressionParameters cPar,
+                   unsigned long long srcSize,
+                   size_t dictSize)
+{
+    cPar = ZSTD_clampCParams(cPar);   /* resulting cPar is necessarily valid (all parameters within range) */
+    if (srcSize == 0) srcSize = ZSTD_CONTENTSIZE_UNKNOWN;
+    return ZSTD_adjustCParams_internal(cPar, srcSize, dictSize);
+}
+
+static ZSTD_compressionParameters ZSTD_getCParams_internal(int compressionLevel, unsigned long long srcSizeHint, size_t dictSize);
+static ZSTD_parameters ZSTD_getParams_internal(int compressionLevel, unsigned long long srcSizeHint, size_t dictSize);
+
+ZSTD_compressionParameters ZSTD_getCParamsFromCCtxParams(
+        const ZSTD_CCtx_params* CCtxParams, U64 srcSizeHint, size_t dictSize)
+{
+    ZSTD_compressionParameters cParams;
+    if (srcSizeHint == ZSTD_CONTENTSIZE_UNKNOWN && CCtxParams->srcSizeHint > 0) {
+      srcSizeHint = CCtxParams->srcSizeHint;
+    }
+    cParams = ZSTD_getCParams_internal(CCtxParams->compressionLevel, srcSizeHint, dictSize);
+    if (CCtxParams->ldmParams.enableLdm) cParams.windowLog = ZSTD_LDM_DEFAULT_WINDOW_LOG;
+    if (CCtxParams->cParams.windowLog) cParams.windowLog = CCtxParams->cParams.windowLog;
+    if (CCtxParams->cParams.hashLog) cParams.hashLog = CCtxParams->cParams.hashLog;
+    if (CCtxParams->cParams.chainLog) cParams.chainLog = CCtxParams->cParams.chainLog;
+    if (CCtxParams->cParams.searchLog) cParams.searchLog = CCtxParams->cParams.searchLog;
+    if (CCtxParams->cParams.minMatch) cParams.minMatch = CCtxParams->cParams.minMatch;
+    if (CCtxParams->cParams.targetLength) cParams.targetLength = CCtxParams->cParams.targetLength;
+    if (CCtxParams->cParams.strategy) cParams.strategy = CCtxParams->cParams.strategy;
+    assert(!ZSTD_checkCParams(cParams));
+    /* srcSizeHint == 0 means 0 */
+    return ZSTD_adjustCParams_internal(cParams, srcSizeHint, dictSize);
+}
+
+static size_t
+ZSTD_sizeof_matchState(const ZSTD_compressionParameters* const cParams,
+                       const U32 forCCtx)
+{
+    size_t const chainSize = (cParams->strategy == ZSTD_fast) ? 0 : ((size_t)1 << cParams->chainLog);
+    size_t const hSize = ((size_t)1) << cParams->hashLog;
+    U32    const hashLog3 = (forCCtx && cParams->minMatch==3) ? MIN(ZSTD_HASHLOG3_MAX, cParams->windowLog) : 0;
+    size_t const h3Size = hashLog3 ? ((size_t)1) << hashLog3 : 0;
+    /* We don't use ZSTD_cwksp_alloc_size() here because the tables aren't
+     * surrounded by redzones in ASAN. */
+    size_t const tableSpace = chainSize * sizeof(U32)
+                            + hSize * sizeof(U32)
+                            + h3Size * sizeof(U32);
+    size_t const optPotentialSpace =
+        ZSTD_cwksp_alloc_size((MaxML+1) * sizeof(U32))
+      + ZSTD_cwksp_alloc_size((MaxLL+1) * sizeof(U32))
+      + ZSTD_cwksp_alloc_size((MaxOff+1) * sizeof(U32))
+      + ZSTD_cwksp_alloc_size((1<<Litbits) * sizeof(U32))
+      + ZSTD_cwksp_alloc_size((ZSTD_OPT_NUM+1) * sizeof(ZSTD_match_t))
+      + ZSTD_cwksp_alloc_size((ZSTD_OPT_NUM+1) * sizeof(ZSTD_optimal_t));
+    size_t const optSpace = (forCCtx && (cParams->strategy >= ZSTD_btopt))
+                                ? optPotentialSpace
+                                : 0;
+    DEBUGLOG(4, "chainSize: %u - hSize: %u - h3Size: %u",
+                (U32)chainSize, (U32)hSize, (U32)h3Size);
+    return tableSpace + optSpace;
+}
+
+size_t ZSTD_estimateCCtxSize_usingCCtxParams(const ZSTD_CCtx_params* params)
+{
+    RETURN_ERROR_IF(params->nbWorkers > 0, GENERIC, "Estimate CCtx size is supported for single-threaded compression only.");
+    {   ZSTD_compressionParameters const cParams =
+                ZSTD_getCParamsFromCCtxParams(params, ZSTD_CONTENTSIZE_UNKNOWN, 0);
+        size_t const blockSize = MIN(ZSTD_BLOCKSIZE_MAX, (size_t)1 << cParams.windowLog);
+        U32    const divider = (cParams.minMatch==3) ? 3 : 4;
+        size_t const maxNbSeq = blockSize / divider;
+        size_t const tokenSpace = ZSTD_cwksp_alloc_size(WILDCOPY_OVERLENGTH + blockSize)
+                                + ZSTD_cwksp_alloc_size(maxNbSeq * sizeof(seqDef))
+                                + 3 * ZSTD_cwksp_alloc_size(maxNbSeq * sizeof(BYTE));
+        size_t const entropySpace = ZSTD_cwksp_alloc_size(HUF_WORKSPACE_SIZE);
+        size_t const blockStateSpace = 2 * ZSTD_cwksp_alloc_size(sizeof(ZSTD_compressedBlockState_t));
+        size_t const matchStateSize = ZSTD_sizeof_matchState(&cParams, /* forCCtx */ 1);
+
+        size_t const ldmSpace = ZSTD_ldm_getTableSize(params->ldmParams);
+        size_t const ldmSeqSpace = ZSTD_cwksp_alloc_size(ZSTD_ldm_getMaxNbSeq(params->ldmParams, blockSize) * sizeof(rawSeq));
+
+        /* estimateCCtxSize is for one-shot compression. So no buffers should
+         * be needed. However, we still allocate two 0-sized buffers, which can
+         * take space under ASAN. */
+        size_t const bufferSpace = ZSTD_cwksp_alloc_size(0)
+                                 + ZSTD_cwksp_alloc_size(0);
+
+        size_t const cctxSpace = ZSTD_cwksp_alloc_size(sizeof(ZSTD_CCtx));
+
+        size_t const neededSpace =
+            cctxSpace +
+            entropySpace +
+            blockStateSpace +
+            ldmSpace +
+            ldmSeqSpace +
+            matchStateSize +
+            tokenSpace +
+            bufferSpace;
+
+        DEBUGLOG(5, "estimate workspace : %u", (U32)neededSpace);
+        return neededSpace;
+    }
+}
+
+size_t ZSTD_estimateCCtxSize_usingCParams(ZSTD_compressionParameters cParams)
+{
+    ZSTD_CCtx_params const params = ZSTD_makeCCtxParamsFromCParams(cParams);
+    return ZSTD_estimateCCtxSize_usingCCtxParams(&params);
+}
+
+static size_t ZSTD_estimateCCtxSize_internal(int compressionLevel)
+{
+    ZSTD_compressionParameters const cParams = ZSTD_getCParams_internal(compressionLevel, ZSTD_CONTENTSIZE_UNKNOWN, 0);
+    return ZSTD_estimateCCtxSize_usingCParams(cParams);
+}
+
+size_t ZSTD_estimateCCtxSize(int compressionLevel)
+{
+    int level;
+    size_t memBudget = 0;
+    for (level=MIN(compressionLevel, 1); level<=compressionLevel; level++) {
+        size_t const newMB = ZSTD_estimateCCtxSize_internal(level);
+        if (newMB > memBudget) memBudget = newMB;
+    }
+    return memBudget;
+}
+
+size_t ZSTD_estimateCStreamSize_usingCCtxParams(const ZSTD_CCtx_params* params)
+{
+    RETURN_ERROR_IF(params->nbWorkers > 0, GENERIC, "Estimate CCtx size is supported for single-threaded compression only.");
+    {   ZSTD_compressionParameters const cParams =
+                ZSTD_getCParamsFromCCtxParams(params, ZSTD_CONTENTSIZE_UNKNOWN, 0);
+        size_t const CCtxSize = ZSTD_estimateCCtxSize_usingCCtxParams(params);
+        size_t const blockSize = MIN(ZSTD_BLOCKSIZE_MAX, (size_t)1 << cParams.windowLog);
+        size_t const inBuffSize = ((size_t)1 << cParams.windowLog) + blockSize;
+        size_t const outBuffSize = ZSTD_compressBound(blockSize) + 1;
+        size_t const streamingSize = ZSTD_cwksp_alloc_size(inBuffSize)
+                                   + ZSTD_cwksp_alloc_size(outBuffSize);
+
+        return CCtxSize + streamingSize;
+    }
+}
+
+size_t ZSTD_estimateCStreamSize_usingCParams(ZSTD_compressionParameters cParams)
+{
+    ZSTD_CCtx_params const params = ZSTD_makeCCtxParamsFromCParams(cParams);
+    return ZSTD_estimateCStreamSize_usingCCtxParams(&params);
+}
+
+static size_t ZSTD_estimateCStreamSize_internal(int compressionLevel)
+{
+    ZSTD_compressionParameters const cParams = ZSTD_getCParams_internal(compressionLevel, ZSTD_CONTENTSIZE_UNKNOWN, 0);
+    return ZSTD_estimateCStreamSize_usingCParams(cParams);
+}
+
+size_t ZSTD_estimateCStreamSize(int compressionLevel)
+{
+    int level;
+    size_t memBudget = 0;
+    for (level=MIN(compressionLevel, 1); level<=compressionLevel; level++) {
+        size_t const newMB = ZSTD_estimateCStreamSize_internal(level);
+        if (newMB > memBudget) memBudget = newMB;
+    }
+    return memBudget;
+}
+
+/* ZSTD_getFrameProgression():
+ * tells how much data has been consumed (input) and produced (output) for current frame.
+ * able to count progression inside worker threads (non-blocking mode).
+ */
+ZSTD_frameProgression ZSTD_getFrameProgression(const ZSTD_CCtx* cctx)
+{
+#ifdef ZSTD_MULTITHREAD
+    if (cctx->appliedParams.nbWorkers > 0) {
+        return ZSTDMT_getFrameProgression(cctx->mtctx);
+    }
+#endif
+    {   ZSTD_frameProgression fp;
+        size_t const buffered = (cctx->inBuff == NULL) ? 0 :
+                                cctx->inBuffPos - cctx->inToCompress;
+        if (buffered) assert(cctx->inBuffPos >= cctx->inToCompress);
+        assert(buffered <= ZSTD_BLOCKSIZE_MAX);
+        fp.ingested = cctx->consumedSrcSize + buffered;
+        fp.consumed = cctx->consumedSrcSize;
+        fp.produced = cctx->producedCSize;
+        fp.flushed  = cctx->producedCSize;   /* simplified; some data might still be left within streaming output buffer */
+        fp.currentJobID = 0;
+        fp.nbActiveWorkers = 0;
+        return fp;
+}   }
+
+/*! ZSTD_toFlushNow()
+ *  Only useful for multithreading scenarios currently (nbWorkers >= 1).
+ */
+size_t ZSTD_toFlushNow(ZSTD_CCtx* cctx)
+{
+#ifdef ZSTD_MULTITHREAD
+    if (cctx->appliedParams.nbWorkers > 0) {
+        return ZSTDMT_toFlushNow(cctx->mtctx);
+    }
+#endif
+    (void)cctx;
+    return 0;   /* over-simplification; could also check if context is currently running in streaming mode, and in which case, report how many bytes are left to be flushed within output buffer */
+}
+
+static void ZSTD_assertEqualCParams(ZSTD_compressionParameters cParams1,
+                                    ZSTD_compressionParameters cParams2)
+{
+    (void)cParams1;
+    (void)cParams2;
+    assert(cParams1.windowLog    == cParams2.windowLog);
+    assert(cParams1.chainLog     == cParams2.chainLog);
+    assert(cParams1.hashLog      == cParams2.hashLog);
+    assert(cParams1.searchLog    == cParams2.searchLog);
+    assert(cParams1.minMatch     == cParams2.minMatch);
+    assert(cParams1.targetLength == cParams2.targetLength);
+    assert(cParams1.strategy     == cParams2.strategy);
+}
+
+void ZSTD_reset_compressedBlockState(ZSTD_compressedBlockState_t* bs)
+{
+    int i;
+    for (i = 0; i < ZSTD_REP_NUM; ++i)
+        bs->rep[i] = ZSTDInternalConstants::repStartValue[i];
+    bs->entropy.huf.repeatMode = HUF_repeat_none;
+    bs->entropy.fse.offcode_repeatMode = FSE_repeat_none;
+    bs->entropy.fse.matchlength_repeatMode = FSE_repeat_none;
+    bs->entropy.fse.litlength_repeatMode = FSE_repeat_none;
+}
+
+/*! ZSTD_invalidateMatchState()
+ *  Invalidate all the matches in the match finder tables.
+ *  Requires nextSrc and base to be set (can be NULL).
+ */
+static void ZSTD_invalidateMatchState(ZSTD_matchState_t* ms)
+{
+    ZSTD_window_clear(&ms->window);
+
+    ms->nextToUpdate = ms->window.dictLimit;
+    ms->loadedDictEnd = 0;
+    ms->opt.litLengthSum = 0;  /* force reset of btopt stats */
+    ms->dictMatchState = NULL;
+}
+
+/**
+ * Indicates whether this compression proceeds directly from user-provided
+ * source buffer to user-provided destination buffer (ZSTDb_not_buffered), or
+ * whether the context needs to buffer the input/output (ZSTDb_buffered).
+ */
+typedef enum {
+    ZSTDb_not_buffered,
+    ZSTDb_buffered
+} ZSTD_buffered_policy_e;
+
+/**
+ * Controls, for this matchState reset, whether the tables need to be cleared /
+ * prepared for the coming compression (ZSTDcrp_makeClean), or whether the
+ * tables can be left unclean (ZSTDcrp_leaveDirty), because we know that a
+ * subsequent operation will overwrite the table space anyways (e.g., copying
+ * the matchState contents in from a CDict).
+ */
+typedef enum {
+    ZSTDcrp_makeClean,
+    ZSTDcrp_leaveDirty
+} ZSTD_compResetPolicy_e;
+
+/**
+ * Controls, for this matchState reset, whether indexing can continue where it
+ * left off (ZSTDirp_continue), or whether it needs to be restarted from zero
+ * (ZSTDirp_reset).
+ */
+typedef enum {
+    ZSTDirp_continue,
+    ZSTDirp_reset
+} ZSTD_indexResetPolicy_e;
+
+typedef enum {
+    ZSTD_resetTarget_CDict,
+    ZSTD_resetTarget_CCtx
+} ZSTD_resetTarget_e;
+
+static size_t
+ZSTD_reset_matchState(ZSTD_matchState_t* ms,
+                      ZSTD_cwksp* ws,
+                const ZSTD_compressionParameters* cParams,
+                const ZSTD_compResetPolicy_e crp,
+                const ZSTD_indexResetPolicy_e forceResetIndex,
+                const ZSTD_resetTarget_e forWho)
+{
+    size_t const chainSize = (cParams->strategy == ZSTD_fast) ? 0 : ((size_t)1 << cParams->chainLog);
+    size_t const hSize = ((size_t)1) << cParams->hashLog;
+    U32    const hashLog3 = ((forWho == ZSTD_resetTarget_CCtx) && cParams->minMatch==3) ? MIN(ZSTD_HASHLOG3_MAX, cParams->windowLog) : 0;
+    size_t const h3Size = hashLog3 ? ((size_t)1) << hashLog3 : 0;
+
+    DEBUGLOG(4, "reset indices : %u", forceResetIndex == ZSTDirp_reset);
+    if (forceResetIndex == ZSTDirp_reset) {
+        ZSTD_window_init(&ms->window);
+        ZSTD_cwksp_mark_tables_dirty(ws);
+    }
+
+    ms->hashLog3 = hashLog3;
+
+    ZSTD_invalidateMatchState(ms);
+
+    assert(!ZSTD_cwksp_reserve_failed(ws)); /* check that allocation hasn't already failed */
+
+    ZSTD_cwksp_clear_tables(ws);
+
+    DEBUGLOG(5, "reserving table space");
+    /* table Space */
+    ms->hashTable = (U32*)ZSTD_cwksp_reserve_table(ws, hSize * sizeof(U32));
+    ms->chainTable = (U32*)ZSTD_cwksp_reserve_table(ws, chainSize * sizeof(U32));
+    ms->hashTable3 = (U32*)ZSTD_cwksp_reserve_table(ws, h3Size * sizeof(U32));
+    RETURN_ERROR_IF(ZSTD_cwksp_reserve_failed(ws), memory_allocation,
+                    "failed a workspace allocation in ZSTD_reset_matchState");
+
+    DEBUGLOG(4, "reset table : %u", crp!=ZSTDcrp_leaveDirty);
+    if (crp!=ZSTDcrp_leaveDirty) {
+        /* reset tables only */
+        ZSTD_cwksp_clean_tables(ws);
+    }
+
+    /* opt parser space */
+    if ((forWho == ZSTD_resetTarget_CCtx) && (cParams->strategy >= ZSTD_btopt)) {
+        DEBUGLOG(4, "reserving optimal parser space");
+        ms->opt.litFreq = (unsigned*)ZSTD_cwksp_reserve_aligned(ws, (1<<Litbits) * sizeof(unsigned));
+        ms->opt.litLengthFreq = (unsigned*)ZSTD_cwksp_reserve_aligned(ws, (MaxLL+1) * sizeof(unsigned));
+        ms->opt.matchLengthFreq = (unsigned*)ZSTD_cwksp_reserve_aligned(ws, (MaxML+1) * sizeof(unsigned));
+        ms->opt.offCodeFreq = (unsigned*)ZSTD_cwksp_reserve_aligned(ws, (MaxOff+1) * sizeof(unsigned));
+        ms->opt.matchTable = (ZSTD_match_t*)ZSTD_cwksp_reserve_aligned(ws, (ZSTD_OPT_NUM+1) * sizeof(ZSTD_match_t));
+        ms->opt.priceTable = (ZSTD_optimal_t*)ZSTD_cwksp_reserve_aligned(ws, (ZSTD_OPT_NUM+1) * sizeof(ZSTD_optimal_t));
+    }
+
+    ms->cParams = *cParams;
+
+    RETURN_ERROR_IF(ZSTD_cwksp_reserve_failed(ws), memory_allocation,
+                    "failed a workspace allocation in ZSTD_reset_matchState");
+
+    return 0;
+}
+
+/* ZSTD_indexTooCloseToMax() :
+ * minor optimization : prefer memset() rather than reduceIndex()
+ * which is measurably slow in some circumstances (reported for Visual Studio).
+ * Works when re-using a context for a lot of smallish inputs :
+ * if all inputs are smaller than ZSTD_INDEXOVERFLOW_MARGIN,
+ * memset() will be triggered before reduceIndex().
+ */
+#define ZSTD_INDEXOVERFLOW_MARGIN (16 MB)
+static int ZSTD_indexTooCloseToMax(ZSTD_window_t w)
+{
+    return (size_t)(w.nextSrc - w.base) > (ZSTD_CURRENT_MAX - ZSTD_INDEXOVERFLOW_MARGIN);
+}
+
+/*! ZSTD_resetCCtx_internal() :
+    note : `params` are assumed fully validated at this stage */
+static size_t ZSTD_resetCCtx_internal(ZSTD_CCtx* zc,
+                                      ZSTD_CCtx_params params,
+                                      U64 const pledgedSrcSize,
+                                      ZSTD_compResetPolicy_e const crp,
+                                      ZSTD_buffered_policy_e const zbuff)
+{
+    ZSTD_cwksp* const ws = &zc->workspace;
+    DEBUGLOG(4, "ZSTD_resetCCtx_internal: pledgedSrcSize=%u, wlog=%u",
+                (U32)pledgedSrcSize, params.cParams.windowLog);
+    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
+
+    zc->isFirstBlock = 1;
+
+    if (params.ldmParams.enableLdm) {
+        /* Adjust long distance matching parameters */
+        ZSTD_ldm_adjustParameters(&params.ldmParams, &params.cParams);
+        assert(params.ldmParams.hashLog >= params.ldmParams.bucketSizeLog);
+        assert(params.ldmParams.hashRateLog < 32);
+        zc->ldmState.hashPower = ZSTD_rollingHash_primePower(params.ldmParams.minMatchLength);
+    }
+
+    {   size_t const windowSize = MAX(1, (size_t)MIN(((U64)1 << params.cParams.windowLog), pledgedSrcSize));
+        size_t const blockSize = MIN(ZSTD_BLOCKSIZE_MAX, windowSize);
+        U32    const divider = (params.cParams.minMatch==3) ? 3 : 4;
+        size_t const maxNbSeq = blockSize / divider;
+        size_t const tokenSpace = ZSTD_cwksp_alloc_size(WILDCOPY_OVERLENGTH + blockSize)
+                                + ZSTD_cwksp_alloc_size(maxNbSeq * sizeof(seqDef))
+                                + 3 * ZSTD_cwksp_alloc_size(maxNbSeq * sizeof(BYTE));
+        size_t const buffOutSize = (zbuff==ZSTDb_buffered) ? ZSTD_compressBound(blockSize)+1 : 0;
+        size_t const buffInSize = (zbuff==ZSTDb_buffered) ? windowSize + blockSize : 0;
+        size_t const matchStateSize = ZSTD_sizeof_matchState(&params.cParams, /* forCCtx */ 1);
+        size_t const maxNbLdmSeq = ZSTD_ldm_getMaxNbSeq(params.ldmParams, blockSize);
+
+        ZSTD_indexResetPolicy_e needsIndexReset = zc->initialized ? ZSTDirp_continue : ZSTDirp_reset;
+
+        if (ZSTD_indexTooCloseToMax(zc->blockState.matchState.window)) {
+            needsIndexReset = ZSTDirp_reset;
+        }
+
+        if (!zc->staticSize) ZSTD_cwksp_bump_oversized_duration(ws, 0);
+
+        /* Check if workspace is large enough, alloc a new one if needed */
+        {   size_t const cctxSpace = zc->staticSize ? ZSTD_cwksp_alloc_size(sizeof(ZSTD_CCtx)) : 0;
+            size_t const entropySpace = ZSTD_cwksp_alloc_size(HUF_WORKSPACE_SIZE);
+            size_t const blockStateSpace = 2 * ZSTD_cwksp_alloc_size(sizeof(ZSTD_compressedBlockState_t));
+            size_t const bufferSpace = ZSTD_cwksp_alloc_size(buffInSize) + ZSTD_cwksp_alloc_size(buffOutSize);
+            size_t const ldmSpace = ZSTD_ldm_getTableSize(params.ldmParams);
+            size_t const ldmSeqSpace = ZSTD_cwksp_alloc_size(maxNbLdmSeq * sizeof(rawSeq));
+
+            size_t const neededSpace =
+                cctxSpace +
+                entropySpace +
+                blockStateSpace +
+                ldmSpace +
+                ldmSeqSpace +
+                matchStateSize +
+                tokenSpace +
+                bufferSpace;
+
+            int const workspaceTooSmall = ZSTD_cwksp_sizeof(ws) < neededSpace;
+            int const workspaceWasteful = ZSTD_cwksp_check_wasteful(ws, neededSpace);
+
+            DEBUGLOG(4, "Need %zuKB workspace, including %zuKB for match state, and %zuKB for buffers",
+                        neededSpace>>10, matchStateSize>>10, bufferSpace>>10);
+            DEBUGLOG(4, "windowSize: %zu - blockSize: %zu", windowSize, blockSize);
+
+            if (workspaceTooSmall || workspaceWasteful) {
+                DEBUGLOG(4, "Resize workspaceSize from %zuKB to %zuKB",
+                            ZSTD_cwksp_sizeof(ws) >> 10,
+                            neededSpace >> 10);
+
+                RETURN_ERROR_IF(zc->staticSize, memory_allocation, "static cctx : no resize");
+
+                needsIndexReset = ZSTDirp_reset;
+
+                ZSTD_cwksp_free(ws, zc->customMem);
+                FORWARD_IF_ERROR(ZSTD_cwksp_create(ws, neededSpace, zc->customMem), "");
+
+                DEBUGLOG(5, "reserving object space");
+                /* Statically sized space.
+                 * entropyWorkspace never moves,
+                 * though prev/next block swap places */
+                assert(ZSTD_cwksp_check_available(ws, 2 * sizeof(ZSTD_compressedBlockState_t)));
+                zc->blockState.prevCBlock = (ZSTD_compressedBlockState_t*) ZSTD_cwksp_reserve_object(ws, sizeof(ZSTD_compressedBlockState_t));
+                RETURN_ERROR_IF(zc->blockState.prevCBlock == NULL, memory_allocation, "couldn't allocate prevCBlock");
+                zc->blockState.nextCBlock = (ZSTD_compressedBlockState_t*) ZSTD_cwksp_reserve_object(ws, sizeof(ZSTD_compressedBlockState_t));
+                RETURN_ERROR_IF(zc->blockState.nextCBlock == NULL, memory_allocation, "couldn't allocate nextCBlock");
+                zc->entropyWorkspace = (U32*) ZSTD_cwksp_reserve_object(ws, HUF_WORKSPACE_SIZE);
+                RETURN_ERROR_IF(zc->blockState.nextCBlock == NULL, memory_allocation, "couldn't allocate entropyWorkspace");
+        }   }
+
+        ZSTD_cwksp_clear(ws);
+
+        /* init params */
+        zc->appliedParams = params;
+        zc->blockState.matchState.cParams = params.cParams;
+        zc->pledgedSrcSizePlusOne = pledgedSrcSize+1;
+        zc->consumedSrcSize = 0;
+        zc->producedCSize = 0;
+        if (pledgedSrcSize == ZSTD_CONTENTSIZE_UNKNOWN)
+            zc->appliedParams.fParams.contentSizeFlag = 0;
+        DEBUGLOG(4, "pledged content size : %u ; flag : %u",
+            (unsigned)pledgedSrcSize, zc->appliedParams.fParams.contentSizeFlag);
+        zc->blockSize = blockSize;
+
+        XXH64_reset(&zc->xxhState, 0);
+        zc->stage = ZSTDcs_init;
+        zc->dictID = 0;
+
+        ZSTD_reset_compressedBlockState(zc->blockState.prevCBlock);
+
+        /* ZSTD_wildcopy() is used to copy into the literals buffer,
+         * so we have to oversize the buffer by WILDCOPY_OVERLENGTH bytes.
+         */
+        zc->seqStore.litStart = ZSTD_cwksp_reserve_buffer(ws, blockSize + WILDCOPY_OVERLENGTH);
+        zc->seqStore.maxNbLit = blockSize;
+
+        /* buffers */
+        zc->inBuffSize = buffInSize;
+        zc->inBuff = (char*)ZSTD_cwksp_reserve_buffer(ws, buffInSize);
+        zc->outBuffSize = buffOutSize;
+        zc->outBuff = (char*)ZSTD_cwksp_reserve_buffer(ws, buffOutSize);
+
+        /* ldm bucketOffsets table */
+        if (params.ldmParams.enableLdm) {
+            /* TODO: avoid memset? */
+            size_t const ldmBucketSize =
+                  ((size_t)1) << (params.ldmParams.hashLog -
+                                  params.ldmParams.bucketSizeLog);
+            zc->ldmState.bucketOffsets = ZSTD_cwksp_reserve_buffer(ws, ldmBucketSize);
+            memset(zc->ldmState.bucketOffsets, 0, ldmBucketSize);
+        }
+
+        /* sequences storage */
+        ZSTD_referenceExternalSequences(zc, NULL, 0);
+        zc->seqStore.maxNbSeq = maxNbSeq;
+        zc->seqStore.llCode = ZSTD_cwksp_reserve_buffer(ws, maxNbSeq * sizeof(BYTE));
+        zc->seqStore.mlCode = ZSTD_cwksp_reserve_buffer(ws, maxNbSeq * sizeof(BYTE));
+        zc->seqStore.ofCode = ZSTD_cwksp_reserve_buffer(ws, maxNbSeq * sizeof(BYTE));
+        zc->seqStore.sequencesStart = (seqDef*)ZSTD_cwksp_reserve_aligned(ws, maxNbSeq * sizeof(seqDef));
+
+        FORWARD_IF_ERROR(ZSTD_reset_matchState(
+            &zc->blockState.matchState,
+            ws,
+            &params.cParams,
+            crp,
+            needsIndexReset,
+            ZSTD_resetTarget_CCtx), "");
+
+        /* ldm hash table */
+        if (params.ldmParams.enableLdm) {
+            /* TODO: avoid memset? */
+            size_t const ldmHSize = ((size_t)1) << params.ldmParams.hashLog;
+            zc->ldmState.hashTable = (ldmEntry_t*)ZSTD_cwksp_reserve_aligned(ws, ldmHSize * sizeof(ldmEntry_t));
+            memset(zc->ldmState.hashTable, 0, ldmHSize * sizeof(ldmEntry_t));
+            zc->ldmSequences = (rawSeq*)ZSTD_cwksp_reserve_aligned(ws, maxNbLdmSeq * sizeof(rawSeq));
+            zc->maxNbLdmSequences = maxNbLdmSeq;
+
+            ZSTD_window_init(&zc->ldmState.window);
+            ZSTD_window_clear(&zc->ldmState.window);
+            zc->ldmState.loadedDictEnd = 0;
+        }
+
+        DEBUGLOG(3, "wksp: finished allocating, %zd bytes remain available", ZSTD_cwksp_available_space(ws));
+        zc->initialized = 1;
+
+        return 0;
+    }
+}
+
+/* ZSTD_invalidateRepCodes() :
+ * ensures next compression will not use repcodes from previous block.
+ * Note : only works with regular variant;
+ *        do not use with extDict variant ! */
+void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx) {
+    int i;
+    for (i=0; i<ZSTD_REP_NUM; i++) cctx->blockState.prevCBlock->rep[i] = 0;
+    assert(!ZSTD_window_hasExtDict(cctx->blockState.matchState.window));
+}
+
+/* These are the approximate sizes for each strategy past which copying the
+ * dictionary tables into the working context is faster than using them
+ * in-place.
+ */
+static const size_t attachDictSizeCutoffs[ZSTD_STRATEGY_MAX+1] = {
+    8 KB,  /* unused */
+    8 KB,  /* ZSTD_fast */
+    16 KB, /* ZSTD_dfast */
+    32 KB, /* ZSTD_greedy */
+    32 KB, /* ZSTD_lazy */
+    32 KB, /* ZSTD_lazy2 */
+    32 KB, /* ZSTD_btlazy2 */
+    32 KB, /* ZSTD_btopt */
+    8 KB,  /* ZSTD_btultra */
+    8 KB   /* ZSTD_btultra2 */
+};
+
+static int ZSTD_shouldAttachDict(const ZSTD_CDict* cdict,
+                                 const ZSTD_CCtx_params* params,
+                                 U64 pledgedSrcSize)
+{
+    size_t cutoff = attachDictSizeCutoffs[cdict->matchState.cParams.strategy];
+    return ( pledgedSrcSize <= cutoff
+          || pledgedSrcSize == ZSTD_CONTENTSIZE_UNKNOWN
+          || params->attachDictPref == ZSTD_dictForceAttach )
+        && params->attachDictPref != ZSTD_dictForceCopy
+        && !params->forceWindow; /* dictMatchState isn't correctly
+                                 * handled in _enforceMaxDist */
+}
+
+static size_t
+ZSTD_resetCCtx_byAttachingCDict(ZSTD_CCtx* cctx,
+                        const ZSTD_CDict* cdict,
+                        ZSTD_CCtx_params params,
+                        U64 pledgedSrcSize,
+                        ZSTD_buffered_policy_e zbuff)
+{
+    {   const ZSTD_compressionParameters* const cdict_cParams = &cdict->matchState.cParams;
+        unsigned const windowLog = params.cParams.windowLog;
+        assert(windowLog != 0);
+        /* Resize working context table params for input only, since the dict
+         * has its own tables. */
+        /* pledgeSrcSize == 0 means 0! */
+        params.cParams = ZSTD_adjustCParams_internal(*cdict_cParams, pledgedSrcSize, 0);
+        params.cParams.windowLog = windowLog;
+        FORWARD_IF_ERROR(ZSTD_resetCCtx_internal(cctx, params, pledgedSrcSize,
+                                                 ZSTDcrp_makeClean, zbuff), "");
+        assert(cctx->appliedParams.cParams.strategy == cdict_cParams->strategy);
+    }
+
+    {   const U32 cdictEnd = (U32)( cdict->matchState.window.nextSrc
+                                  - cdict->matchState.window.base);
+        const U32 cdictLen = cdictEnd - cdict->matchState.window.dictLimit;
+        if (cdictLen == 0) {
+            /* don't even attach dictionaries with no contents */
+            DEBUGLOG(4, "skipping attaching empty dictionary");
+        } else {
+            DEBUGLOG(4, "attaching dictionary into context");
+            cctx->blockState.matchState.dictMatchState = &cdict->matchState;
+
+            /* prep working match state so dict matches never have negative indices
+             * when they are translated to the working context's index space. */
+            if (cctx->blockState.matchState.window.dictLimit < cdictEnd) {
+                cctx->blockState.matchState.window.nextSrc =
+                    cctx->blockState.matchState.window.base + cdictEnd;
+                ZSTD_window_clear(&cctx->blockState.matchState.window);
+            }
+            /* loadedDictEnd is expressed within the referential of the active context */
+            cctx->blockState.matchState.loadedDictEnd = cctx->blockState.matchState.window.dictLimit;
+    }   }
+
+    cctx->dictID = cdict->dictID;
+
+    /* copy block state */
+    memcpy(cctx->blockState.prevCBlock, &cdict->cBlockState, sizeof(cdict->cBlockState));
+
+    return 0;
+}
+
+static size_t ZSTD_resetCCtx_byCopyingCDict(ZSTD_CCtx* cctx,
+                            const ZSTD_CDict* cdict,
+                            ZSTD_CCtx_params params,
+                            U64 pledgedSrcSize,
+                            ZSTD_buffered_policy_e zbuff)
+{
+    const ZSTD_compressionParameters *cdict_cParams = &cdict->matchState.cParams;
+
+    DEBUGLOG(4, "copying dictionary into context");
+
+    {   unsigned const windowLog = params.cParams.windowLog;
+        assert(windowLog != 0);
+        /* Copy only compression parameters related to tables. */
+        params.cParams = *cdict_cParams;
+        params.cParams.windowLog = windowLog;
+        FORWARD_IF_ERROR(ZSTD_resetCCtx_internal(cctx, params, pledgedSrcSize,
+                                                 ZSTDcrp_leaveDirty, zbuff), "");
+        assert(cctx->appliedParams.cParams.strategy == cdict_cParams->strategy);
+        assert(cctx->appliedParams.cParams.hashLog == cdict_cParams->hashLog);
+        assert(cctx->appliedParams.cParams.chainLog == cdict_cParams->chainLog);
+    }
+
+    ZSTD_cwksp_mark_tables_dirty(&cctx->workspace);
+
+    /* copy tables */
+    {   size_t const chainSize = (cdict_cParams->strategy == ZSTD_fast) ? 0 : ((size_t)1 << cdict_cParams->chainLog);
+        size_t const hSize =  (size_t)1 << cdict_cParams->hashLog;
+
+        memcpy(cctx->blockState.matchState.hashTable,
+               cdict->matchState.hashTable,
+               hSize * sizeof(U32));
+        memcpy(cctx->blockState.matchState.chainTable,
+               cdict->matchState.chainTable,
+               chainSize * sizeof(U32));
+    }
+
+    /* Zero the hashTable3, since the cdict never fills it */
+    {   int const h3log = cctx->blockState.matchState.hashLog3;
+        size_t const h3Size = h3log ? ((size_t)1 << h3log) : 0;
+        assert(cdict->matchState.hashLog3 == 0);
+        memset(cctx->blockState.matchState.hashTable3, 0, h3Size * sizeof(U32));
+    }
+
+    ZSTD_cwksp_mark_tables_clean(&cctx->workspace);
+
+    /* copy dictionary offsets */
+    {   ZSTD_matchState_t const* srcMatchState = &cdict->matchState;
+        ZSTD_matchState_t* dstMatchState = &cctx->blockState.matchState;
+        dstMatchState->window       = srcMatchState->window;
+        dstMatchState->nextToUpdate = srcMatchState->nextToUpdate;
+        dstMatchState->loadedDictEnd= srcMatchState->loadedDictEnd;
+    }
+
+    cctx->dictID = cdict->dictID;
+
+    /* copy block state */
+    memcpy(cctx->blockState.prevCBlock, &cdict->cBlockState, sizeof(cdict->cBlockState));
+
+    return 0;
+}
+
+/* We have a choice between copying the dictionary context into the working
+ * context, or referencing the dictionary context from the working context
+ * in-place. We decide here which strategy to use. */
+static size_t ZSTD_resetCCtx_usingCDict(ZSTD_CCtx* cctx,
+                            const ZSTD_CDict* cdict,
+                            const ZSTD_CCtx_params* params,
+                            U64 pledgedSrcSize,
+                            ZSTD_buffered_policy_e zbuff)
+{
+
+    DEBUGLOG(4, "ZSTD_resetCCtx_usingCDict (pledgedSrcSize=%u)",
+                (unsigned)pledgedSrcSize);
+
+    if (ZSTD_shouldAttachDict(cdict, params, pledgedSrcSize)) {
+        return ZSTD_resetCCtx_byAttachingCDict(
+            cctx, cdict, *params, pledgedSrcSize, zbuff);
+    } else {
+        return ZSTD_resetCCtx_byCopyingCDict(
+            cctx, cdict, *params, pledgedSrcSize, zbuff);
+    }
+}
+
+/*! ZSTD_copyCCtx_internal() :
+ *  Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
+ *  Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
+ *  The "context", in this case, refers to the hash and chain tables,
+ *  entropy tables, and dictionary references.
+ * `windowLog` value is enforced if != 0, otherwise value is copied from srcCCtx.
+ * @return : 0, or an error code */
+static size_t ZSTD_copyCCtx_internal(ZSTD_CCtx* dstCCtx,
+                            const ZSTD_CCtx* srcCCtx,
+                            ZSTD_frameParameters fParams,
+                            U64 pledgedSrcSize,
+                            ZSTD_buffered_policy_e zbuff)
+{
+    DEBUGLOG(5, "ZSTD_copyCCtx_internal");
+    RETURN_ERROR_IF(srcCCtx->stage!=ZSTDcs_init, stage_wrong,
+                    "Can't copy a ctx that's not in init stage.");
+
+    memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
+    {   ZSTD_CCtx_params params = dstCCtx->requestedParams;
+        /* Copy only compression parameters related to tables. */
+        params.cParams = srcCCtx->appliedParams.cParams;
+        params.fParams = fParams;
+        ZSTD_resetCCtx_internal(dstCCtx, params, pledgedSrcSize,
+                                ZSTDcrp_leaveDirty, zbuff);
+        assert(dstCCtx->appliedParams.cParams.windowLog == srcCCtx->appliedParams.cParams.windowLog);
+        assert(dstCCtx->appliedParams.cParams.strategy == srcCCtx->appliedParams.cParams.strategy);
+        assert(dstCCtx->appliedParams.cParams.hashLog == srcCCtx->appliedParams.cParams.hashLog);
+        assert(dstCCtx->appliedParams.cParams.chainLog == srcCCtx->appliedParams.cParams.chainLog);
+        assert(dstCCtx->blockState.matchState.hashLog3 == srcCCtx->blockState.matchState.hashLog3);
+    }
+
+    ZSTD_cwksp_mark_tables_dirty(&dstCCtx->workspace);
+
+    /* copy tables */
+    {   size_t const chainSize = (srcCCtx->appliedParams.cParams.strategy == ZSTD_fast) ? 0 : ((size_t)1 << srcCCtx->appliedParams.cParams.chainLog);
+        size_t const hSize =  (size_t)1 << srcCCtx->appliedParams.cParams.hashLog;
+        int const h3log = srcCCtx->blockState.matchState.hashLog3;
+        size_t const h3Size = h3log ? ((size_t)1 << h3log) : 0;
+
+        memcpy(dstCCtx->blockState.matchState.hashTable,
+               srcCCtx->blockState.matchState.hashTable,
+               hSize * sizeof(U32));
+        memcpy(dstCCtx->blockState.matchState.chainTable,
+               srcCCtx->blockState.matchState.chainTable,
+               chainSize * sizeof(U32));
+        memcpy(dstCCtx->blockState.matchState.hashTable3,
+               srcCCtx->blockState.matchState.hashTable3,
+               h3Size * sizeof(U32));
+    }
+
+    ZSTD_cwksp_mark_tables_clean(&dstCCtx->workspace);
+
+    /* copy dictionary offsets */
+    {
+        const ZSTD_matchState_t* srcMatchState = &srcCCtx->blockState.matchState;
+        ZSTD_matchState_t* dstMatchState = &dstCCtx->blockState.matchState;
+        dstMatchState->window       = srcMatchState->window;
+        dstMatchState->nextToUpdate = srcMatchState->nextToUpdate;
+        dstMatchState->loadedDictEnd= srcMatchState->loadedDictEnd;
+    }
+    dstCCtx->dictID = srcCCtx->dictID;
+
+    /* copy block state */
+    memcpy(dstCCtx->blockState.prevCBlock, srcCCtx->blockState.prevCBlock, sizeof(*srcCCtx->blockState.prevCBlock));
+
+    return 0;
+}
+
+/*! ZSTD_copyCCtx() :
+ *  Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
+ *  Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
+ *  pledgedSrcSize==0 means "unknown".
+*   @return : 0, or an error code */
+size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long long pledgedSrcSize)
+{
+    ZSTD_frameParameters fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
+    ZSTD_buffered_policy_e const zbuff = (ZSTD_buffered_policy_e)(srcCCtx->inBuffSize>0);
+    ZSTD_STATIC_ASSERT((U32)ZSTDb_buffered==1);
+    if (pledgedSrcSize==0) pledgedSrcSize = ZSTD_CONTENTSIZE_UNKNOWN;
+    fParams.contentSizeFlag = (pledgedSrcSize != ZSTD_CONTENTSIZE_UNKNOWN);
+
+    return ZSTD_copyCCtx_internal(dstCCtx, srcCCtx,
+                                fParams, pledgedSrcSize,
+                                zbuff);
+}
+
+
+#define ZSTD_ROWSIZE 16
+/*! ZSTD_reduceTable() :
+ *  reduce table indexes by `reducerValue`, or squash to zero.
+ *  PreserveMark preserves "unsorted mark" for btlazy2 strategy.
+ *  It must be set to a clear 0/1 value, to remove branch during inlining.
+ *  Presume table size is a multiple of ZSTD_ROWSIZE
+ *  to help auto-vectorization */
+FORCE_INLINE_TEMPLATE void
+ZSTD_reduceTable_internal (U32* const table, U32 const size, U32 const reducerValue, int const preserveMark)
+{
+    int const nbRows = (int)size / ZSTD_ROWSIZE;
+    int cellNb = 0;
+    int rowNb;
+    assert((size & (ZSTD_ROWSIZE-1)) == 0);  /* multiple of ZSTD_ROWSIZE */
+    assert(size < (1U<<31));   /* can be casted to int */
+
+#if defined (MEMORY_SANITIZER) && !defined (ZSTD_MSAN_DONT_POISON_WORKSPACE)
+    /* To validate that the table re-use logic is sound, and that we don't
+     * access table space that we haven't cleaned, we re-"poison" the table
+     * space every time we mark it dirty.
+     *
+     * This function however is intended to operate on those dirty tables and
+     * re-clean them. So when this function is used correctly, we can unpoison
+     * the memory it operated on. This introduces a blind spot though, since
+     * if we now try to operate on __actually__ poisoned memory, we will not
+     * detect that. */
+    __msan_unpoison(table, size * sizeof(U32));
+#endif
+
+    for (rowNb=0 ; rowNb < nbRows ; rowNb++) {
+        int column;
+        for (column=0; column<ZSTD_ROWSIZE; column++) {
+            if (preserveMark) {
+                U32 const adder = (table[cellNb] == ZSTD_DUBT_UNSORTED_MARK) ? reducerValue : 0;
+                table[cellNb] += adder;
+            }
+            if (table[cellNb] < reducerValue) table[cellNb] = 0;
+            else table[cellNb] -= reducerValue;
+            cellNb++;
+    }   }
+}
+
+static void ZSTD_reduceTable(U32* const table, U32 const size, U32 const reducerValue)
+{
+    ZSTD_reduceTable_internal(table, size, reducerValue, 0);
+}
+
+static void ZSTD_reduceTable_btlazy2(U32* const table, U32 const size, U32 const reducerValue)
+{
+    ZSTD_reduceTable_internal(table, size, reducerValue, 1);
+}
+
+/*! ZSTD_reduceIndex() :
+*   rescale all indexes to avoid future overflow (indexes are U32) */
+static void ZSTD_reduceIndex (ZSTD_matchState_t* ms, ZSTD_CCtx_params const* params, const U32 reducerValue)
+{
+    {   U32 const hSize = (U32)1 << params->cParams.hashLog;
+        ZSTD_reduceTable(ms->hashTable, hSize, reducerValue);
+    }
+
+    if (params->cParams.strategy != ZSTD_fast) {
+        U32 const chainSize = (U32)1 << params->cParams.chainLog;
+        if (params->cParams.strategy == ZSTD_btlazy2)
+            ZSTD_reduceTable_btlazy2(ms->chainTable, chainSize, reducerValue);
+        else
+            ZSTD_reduceTable(ms->chainTable, chainSize, reducerValue);
+    }
+
+    if (ms->hashLog3) {
+        U32 const h3Size = (U32)1 << ms->hashLog3;
+        ZSTD_reduceTable(ms->hashTable3, h3Size, reducerValue);
+    }
+}
+
+
+/*-*******************************************************
+*  Block entropic compression
+*********************************************************/
+
+/* See doc/zstd_compression_format.md for detailed format description */
+
+void ZSTD_seqToCodes(const seqStore_t* seqStorePtr)
+{
+    const seqDef* const sequences = seqStorePtr->sequencesStart;
+    BYTE* const llCodeTable = seqStorePtr->llCode;
+    BYTE* const ofCodeTable = seqStorePtr->ofCode;
+    BYTE* const mlCodeTable = seqStorePtr->mlCode;
+    U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
+    U32 u;
+    assert(nbSeq <= seqStorePtr->maxNbSeq);
+    for (u=0; u<nbSeq; u++) {
+        U32 const llv = sequences[u].litLength;
+        U32 const mlv = sequences[u].matchLength;
+        llCodeTable[u] = (BYTE)ZSTD_LLcode(llv);
+        ofCodeTable[u] = (BYTE)ZSTD_highbit32(sequences[u].offset);
+        mlCodeTable[u] = (BYTE)ZSTD_MLcode(mlv);
+    }
+    if (seqStorePtr->longLengthID==1)
+        llCodeTable[seqStorePtr->longLengthPos] = MaxLL;
+    if (seqStorePtr->longLengthID==2)
+        mlCodeTable[seqStorePtr->longLengthPos] = MaxML;
+}
+
+/* ZSTD_useTargetCBlockSize():
+ * Returns if target compressed block size param is being used.
+ * If used, compression will do best effort to make a compressed block size to be around targetCBlockSize.
+ * Returns 1 if true, 0 otherwise. */
+static int ZSTD_useTargetCBlockSize(const ZSTD_CCtx_params* cctxParams)
+{
+    DEBUGLOG(5, "ZSTD_useTargetCBlockSize (targetCBlockSize=%zu)", cctxParams->targetCBlockSize);
+    return (cctxParams->targetCBlockSize != 0);
+}
+
+/* ZSTD_compressSequences_internal():
+ * actually compresses both literals and sequences */
+MEM_STATIC size_t
+ZSTD_compressSequences_internal(seqStore_t* seqStorePtr,
+                          const ZSTD_entropyCTables_t* prevEntropy,
+                                ZSTD_entropyCTables_t* nextEntropy,
+                          const ZSTD_CCtx_params* cctxParams,
+                                void* dst, size_t dstCapacity,
+                                void* entropyWorkspace, size_t entropyWkspSize,
+                          const int bmi2)
+{
+    const int longOffsets = cctxParams->cParams.windowLog > STREAM_ACCUMULATOR_MIN;
+    ZSTD_strategy const strategy = cctxParams->cParams.strategy;
+    unsigned count[MaxSeq+1];
+    FSE_CTable* CTable_LitLength = nextEntropy->fse.litlengthCTable;
+    FSE_CTable* CTable_OffsetBits = nextEntropy->fse.offcodeCTable;
+    FSE_CTable* CTable_MatchLength = nextEntropy->fse.matchlengthCTable;
+    U32 LLtype, Offtype, MLtype;   /* compressed, raw or rle */
+    const seqDef* const sequences = seqStorePtr->sequencesStart;
+    const BYTE* const ofCodeTable = seqStorePtr->ofCode;
+    const BYTE* const llCodeTable = seqStorePtr->llCode;
+    const BYTE* const mlCodeTable = seqStorePtr->mlCode;
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstCapacity;
+    BYTE* op = ostart;
+    size_t const nbSeq = (size_t)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
+    BYTE* seqHead;
+    BYTE* lastNCount = NULL;
+
+    DEBUGLOG(5, "ZSTD_compressSequences_internal (nbSeq=%zu)", nbSeq);
+    ZSTD_STATIC_ASSERT(HUF_WORKSPACE_SIZE >= (1<<MAX(MLFSELog,LLFSELog)));
+
+    /* Compress literals */
+    {   const BYTE* const literals = seqStorePtr->litStart;
+        size_t const litSize = (size_t)(seqStorePtr->lit - literals);
+        size_t const cSize = ZSTD_compressLiterals(
+                                    &prevEntropy->huf, &nextEntropy->huf,
+                                    cctxParams->cParams.strategy,
+                                    ZSTD_disableLiteralsCompression(cctxParams),
+                                    op, dstCapacity,
+                                    literals, litSize,
+                                    entropyWorkspace, entropyWkspSize,
+                                    bmi2);
+        FORWARD_IF_ERROR(cSize, "ZSTD_compressLiterals failed");
+        assert(cSize <= dstCapacity);
+        op += cSize;
+    }
+
+    /* Sequences Header */
+    RETURN_ERROR_IF((oend-op) < 3 /*max nbSeq Size*/ + 1 /*seqHead*/,
+                    dstSize_tooSmall, "Can't fit seq hdr in output buf!");
+    if (nbSeq < 128) {
+        *op++ = (BYTE)nbSeq;
+    } else if (nbSeq < LONGNBSEQ) {
+        op[0] = (BYTE)((nbSeq>>8) + 0x80);
+        op[1] = (BYTE)nbSeq;
+        op+=2;
+    } else {
+        op[0]=0xFF;
+        MEM_writeLE16(op+1, (U16)(nbSeq - LONGNBSEQ));
+        op+=3;
+    }
+    assert(op <= oend);
+    if (nbSeq==0) {
+        /* Copy the old tables over as if we repeated them */
+        memcpy(&nextEntropy->fse, &prevEntropy->fse, sizeof(prevEntropy->fse));
+        return (size_t)(op - ostart);
+    }
+
+    /* seqHead : flags for FSE encoding type */
+    seqHead = op++;
+    assert(op <= oend);
+
+    /* convert length/distances into codes */
+    ZSTD_seqToCodes(seqStorePtr);
+    /* build CTable for Literal Lengths */
+    {   unsigned max = MaxLL;
+        size_t const mostFrequent = HIST_countFast_wksp(count, &max, llCodeTable, nbSeq, entropyWorkspace, entropyWkspSize);   /* can't fail */
+        DEBUGLOG(5, "Building LL table");
+        nextEntropy->fse.litlength_repeatMode = prevEntropy->fse.litlength_repeatMode;
+        LLtype = ZSTD_selectEncodingType(&nextEntropy->fse.litlength_repeatMode,
+                                        count, max, mostFrequent, nbSeq,
+                                        LLFSELog, prevEntropy->fse.litlengthCTable,
+                                        ZSTDInternalConstants::LL_defaultNorm, ZSTDInternalConstants::LL_defaultNormLog,
+                                        ZSTD_defaultAllowed, strategy);
+        assert(set_basic < set_compressed && set_rle < set_compressed);
+        assert(!(LLtype < set_compressed && nextEntropy->fse.litlength_repeatMode != FSE_repeat_none)); /* We don't copy tables */
+        {   size_t const countSize = ZSTD_buildCTable(
+                op, (size_t)(oend - op),
+                CTable_LitLength, LLFSELog, (symbolEncodingType_e)LLtype,
+                count, max, llCodeTable, nbSeq,
+                ZSTDInternalConstants::LL_defaultNorm, ZSTDInternalConstants::LL_defaultNormLog, MaxLL,
+                prevEntropy->fse.litlengthCTable,
+                sizeof(prevEntropy->fse.litlengthCTable),
+                entropyWorkspace, entropyWkspSize);
+            FORWARD_IF_ERROR(countSize, "ZSTD_buildCTable for LitLens failed");
+            if (LLtype == set_compressed)
+                lastNCount = op;
+            op += countSize;
+            assert(op <= oend);
+    }   }
+    /* build CTable for Offsets */
+    {   unsigned max = MaxOff;
+        size_t const mostFrequent = HIST_countFast_wksp(
+            count, &max, ofCodeTable, nbSeq, entropyWorkspace, entropyWkspSize);  /* can't fail */
+        /* We can only use the basic table if max <= DefaultMaxOff, otherwise the offsets are too large */
+        ZSTD_defaultPolicy_e const defaultPolicy = (max <= DefaultMaxOff) ? ZSTD_defaultAllowed : ZSTD_defaultDisallowed;
+        DEBUGLOG(5, "Building OF table");
+        nextEntropy->fse.offcode_repeatMode = prevEntropy->fse.offcode_repeatMode;
+        Offtype = ZSTD_selectEncodingType(&nextEntropy->fse.offcode_repeatMode,
+                                        count, max, mostFrequent, nbSeq,
+                                        OffFSELog, prevEntropy->fse.offcodeCTable,
+                                        ZSTDInternalConstants::OF_defaultNorm, ZSTDInternalConstants::OF_defaultNormLog,
+                                        defaultPolicy, strategy);
+        assert(!(Offtype < set_compressed && nextEntropy->fse.offcode_repeatMode != FSE_repeat_none)); /* We don't copy tables */
+        {   size_t const countSize = ZSTD_buildCTable(
+                op, (size_t)(oend - op),
+                CTable_OffsetBits, OffFSELog, (symbolEncodingType_e)Offtype,
+                count, max, ofCodeTable, nbSeq,
+                ZSTDInternalConstants::OF_defaultNorm, ZSTDInternalConstants::OF_defaultNormLog, DefaultMaxOff,
+                prevEntropy->fse.offcodeCTable,
+                sizeof(prevEntropy->fse.offcodeCTable),
+                entropyWorkspace, entropyWkspSize);
+            FORWARD_IF_ERROR(countSize, "ZSTD_buildCTable for Offsets failed");
+            if (Offtype == set_compressed)
+                lastNCount = op;
+            op += countSize;
+            assert(op <= oend);
+    }   }
+    /* build CTable for MatchLengths */
+    {   unsigned max = MaxML;
+        size_t const mostFrequent = HIST_countFast_wksp(
+            count, &max, mlCodeTable, nbSeq, entropyWorkspace, entropyWkspSize);   /* can't fail */
+        DEBUGLOG(5, "Building ML table (remaining space : %i)", (int)(oend-op));
+        nextEntropy->fse.matchlength_repeatMode = prevEntropy->fse.matchlength_repeatMode;
+        MLtype = ZSTD_selectEncodingType(&nextEntropy->fse.matchlength_repeatMode,
+                                        count, max, mostFrequent, nbSeq,
+                                        MLFSELog, prevEntropy->fse.matchlengthCTable,
+                                        ZSTDInternalConstants::ML_defaultNorm, ZSTDInternalConstants::ML_defaultNormLog,
+                                        ZSTD_defaultAllowed, strategy);
+        assert(!(MLtype < set_compressed && nextEntropy->fse.matchlength_repeatMode != FSE_repeat_none)); /* We don't copy tables */
+        {   size_t const countSize = ZSTD_buildCTable(
+                op, (size_t)(oend - op),
+                CTable_MatchLength, MLFSELog, (symbolEncodingType_e)MLtype,
+                count, max, mlCodeTable, nbSeq,
+                ZSTDInternalConstants::ML_defaultNorm, ZSTDInternalConstants::ML_defaultNormLog, MaxML,
+                prevEntropy->fse.matchlengthCTable,
+                sizeof(prevEntropy->fse.matchlengthCTable),
+                entropyWorkspace, entropyWkspSize);
+            FORWARD_IF_ERROR(countSize, "ZSTD_buildCTable for MatchLengths failed");
+            if (MLtype == set_compressed)
+                lastNCount = op;
+            op += countSize;
+            assert(op <= oend);
+    }   }
+
+    *seqHead = (BYTE)((LLtype<<6) + (Offtype<<4) + (MLtype<<2));
+
+    {   size_t const bitstreamSize = ZSTD_encodeSequences(
+                                        op, (size_t)(oend - op),
+                                        CTable_MatchLength, mlCodeTable,
+                                        CTable_OffsetBits, ofCodeTable,
+                                        CTable_LitLength, llCodeTable,
+                                        sequences, nbSeq,
+                                        longOffsets, bmi2);
+        FORWARD_IF_ERROR(bitstreamSize, "ZSTD_encodeSequences failed");
+        op += bitstreamSize;
+        assert(op <= oend);
+        /* zstd versions <= 1.3.4 mistakenly report corruption when
+         * FSE_readNCount() receives a buffer < 4 bytes.
+         * Fixed by https://github.com/facebook/zstd/pull/1146.
+         * This can happen when the last set_compressed table present is 2
+         * bytes and the bitstream is only one byte.
+         * In this exceedingly rare case, we will simply emit an uncompressed
+         * block, since it isn't worth optimizing.
+         */
+        if (lastNCount && (op - lastNCount) < 4) {
+            /* NCountSize >= 2 && bitstreamSize > 0 ==> lastCountSize == 3 */
+            assert(op - lastNCount == 3);
+            DEBUGLOG(5, "Avoiding bug in zstd decoder in versions <= 1.3.4 by "
+                        "emitting an uncompressed block.");
+            return 0;
+        }
+    }
+
+    DEBUGLOG(5, "compressed block size : %u", (unsigned)(op - ostart));
+    return (size_t)(op - ostart);
+}
+
+MEM_STATIC size_t
+ZSTD_compressSequences(seqStore_t* seqStorePtr,
+                       const ZSTD_entropyCTables_t* prevEntropy,
+                             ZSTD_entropyCTables_t* nextEntropy,
+                       const ZSTD_CCtx_params* cctxParams,
+                             void* dst, size_t dstCapacity,
+                             size_t srcSize,
+                             void* entropyWorkspace, size_t entropyWkspSize,
+                             int bmi2)
+{
+    size_t const cSize = ZSTD_compressSequences_internal(
+                            seqStorePtr, prevEntropy, nextEntropy, cctxParams,
+                            dst, dstCapacity,
+                            entropyWorkspace, entropyWkspSize, bmi2);
+    if (cSize == 0) return 0;
+    /* When srcSize <= dstCapacity, there is enough space to write a raw uncompressed block.
+     * Since we ran out of space, block must be not compressible, so fall back to raw uncompressed block.
+     */
+    if ((cSize == ERROR(dstSize_tooSmall)) & (srcSize <= dstCapacity))
+        return 0;  /* block not compressed */
+    FORWARD_IF_ERROR(cSize, "ZSTD_compressSequences_internal failed");
+
+    /* Check compressibility */
+    {   size_t const maxCSize = srcSize - ZSTD_minGain(srcSize, cctxParams->cParams.strategy);
+        if (cSize >= maxCSize) return 0;  /* block not compressed */
+    }
+
+    return cSize;
+}
+
+/* ZSTD_selectBlockCompressor() :
+ * Not static, but internal use only (used by long distance matcher)
+ * assumption : strat is a valid strategy */
+ZSTD_blockCompressor ZSTD_selectBlockCompressor(ZSTD_strategy strat, ZSTD_dictMode_e dictMode)
+{
+    static const ZSTD_blockCompressor blockCompressor[3][ZSTD_STRATEGY_MAX+1] = {
+        { ZSTD_compressBlock_fast  /* default for 0 */,
+          ZSTD_compressBlock_fast,
+          ZSTD_compressBlock_doubleFast,
+          ZSTD_compressBlock_greedy,
+          ZSTD_compressBlock_lazy,
+          ZSTD_compressBlock_lazy2,
+          ZSTD_compressBlock_btlazy2,
+          ZSTD_compressBlock_btopt,
+          ZSTD_compressBlock_btultra,
+          ZSTD_compressBlock_btultra2 },
+        { ZSTD_compressBlock_fast_extDict  /* default for 0 */,
+          ZSTD_compressBlock_fast_extDict,
+          ZSTD_compressBlock_doubleFast_extDict,
+          ZSTD_compressBlock_greedy_extDict,
+          ZSTD_compressBlock_lazy_extDict,
+          ZSTD_compressBlock_lazy2_extDict,
+          ZSTD_compressBlock_btlazy2_extDict,
+          ZSTD_compressBlock_btopt_extDict,
+          ZSTD_compressBlock_btultra_extDict,
+          ZSTD_compressBlock_btultra_extDict },
+        { ZSTD_compressBlock_fast_dictMatchState  /* default for 0 */,
+          ZSTD_compressBlock_fast_dictMatchState,
+          ZSTD_compressBlock_doubleFast_dictMatchState,
+          ZSTD_compressBlock_greedy_dictMatchState,
+          ZSTD_compressBlock_lazy_dictMatchState,
+          ZSTD_compressBlock_lazy2_dictMatchState,
+          ZSTD_compressBlock_btlazy2_dictMatchState,
+          ZSTD_compressBlock_btopt_dictMatchState,
+          ZSTD_compressBlock_btultra_dictMatchState,
+          ZSTD_compressBlock_btultra_dictMatchState }
+    };
+    ZSTD_blockCompressor selectedCompressor;
+    ZSTD_STATIC_ASSERT((unsigned)ZSTD_fast == 1);
+
+    assert(ZSTD_cParam_withinBounds(ZSTD_c_strategy, strat));
+    selectedCompressor = blockCompressor[(int)dictMode][(int)strat];
+    assert(selectedCompressor != NULL);
+    return selectedCompressor;
+}
+
+static void ZSTD_storeLastLiterals(seqStore_t* seqStorePtr,
+                                   const BYTE* anchor, size_t lastLLSize)
+{
+    memcpy(seqStorePtr->lit, anchor, lastLLSize);
+    seqStorePtr->lit += lastLLSize;
+}
+
+void ZSTD_resetSeqStore(seqStore_t* ssPtr)
+{
+    ssPtr->lit = ssPtr->litStart;
+    ssPtr->sequences = ssPtr->sequencesStart;
+    ssPtr->longLengthID = 0;
+}
+
+typedef enum { ZSTDbss_compress, ZSTDbss_noCompress } ZSTD_buildSeqStore_e;
+
+static size_t ZSTD_buildSeqStore(ZSTD_CCtx* zc, const void* src, size_t srcSize)
+{
+    ZSTD_matchState_t* const ms = &zc->blockState.matchState;
+    DEBUGLOG(5, "ZSTD_buildSeqStore (srcSize=%zu)", srcSize);
+    assert(srcSize <= ZSTD_BLOCKSIZE_MAX);
+    /* Assert that we have correctly flushed the ctx params into the ms's copy */
+    ZSTD_assertEqualCParams(zc->appliedParams.cParams, ms->cParams);
+    if (srcSize < MIN_CBLOCK_SIZE+ZSTDInternalConstants::ZSTD_blockHeaderSize+1) {
+        ZSTD_ldm_skipSequences(&zc->externSeqStore, srcSize, zc->appliedParams.cParams.minMatch);
+        return ZSTDbss_noCompress; /* don't even attempt compression below a certain srcSize */
+    }
+    ZSTD_resetSeqStore(&(zc->seqStore));
+    /* required for optimal parser to read stats from dictionary */
+    ms->opt.symbolCosts = &zc->blockState.prevCBlock->entropy;
+    /* tell the optimal parser how we expect to compress literals */
+    ms->opt.literalCompressionMode = zc->appliedParams.literalCompressionMode;
+    /* a gap between an attached dict and the current window is not safe,
+     * they must remain adjacent,
+     * and when that stops being the case, the dict must be unset */
+    assert(ms->dictMatchState == NULL || ms->loadedDictEnd == ms->window.dictLimit);
+
+    /* limited update after a very long match */
+    {   const BYTE* const base = ms->window.base;
+        const BYTE* const istart = (const BYTE*)src;
+        const U32 current = (U32)(istart-base);
+        if (sizeof(ptrdiff_t)==8) assert(istart - base < (ptrdiff_t)(U32)(-1));   /* ensure no overflow */
+        if (current > ms->nextToUpdate + 384)
+            ms->nextToUpdate = current - MIN(192, (U32)(current - ms->nextToUpdate - 384));
+    }
+
+    /* select and store sequences */
+    {   ZSTD_dictMode_e const dictMode = ZSTD_matchState_dictMode(ms);
+        size_t lastLLSize;
+        {   int i;
+            for (i = 0; i < ZSTD_REP_NUM; ++i)
+                zc->blockState.nextCBlock->rep[i] = zc->blockState.prevCBlock->rep[i];
+        }
+        if (zc->externSeqStore.pos < zc->externSeqStore.size) {
+            assert(!zc->appliedParams.ldmParams.enableLdm);
+            /* Updates ldmSeqStore.pos */
+            lastLLSize =
+                ZSTD_ldm_blockCompress(&zc->externSeqStore,
+                                       ms, &zc->seqStore,
+                                       zc->blockState.nextCBlock->rep,
+                                       src, srcSize);
+            assert(zc->externSeqStore.pos <= zc->externSeqStore.size);
+        } else if (zc->appliedParams.ldmParams.enableLdm) {
+            rawSeqStore_t ldmSeqStore = {NULL, 0, 0, 0};
+
+            ldmSeqStore.seq = zc->ldmSequences;
+            ldmSeqStore.capacity = zc->maxNbLdmSequences;
+            /* Updates ldmSeqStore.size */
+            FORWARD_IF_ERROR(ZSTD_ldm_generateSequences(&zc->ldmState, &ldmSeqStore,
+                                               &zc->appliedParams.ldmParams,
+                                               src, srcSize), "");
+            /* Updates ldmSeqStore.pos */
+            lastLLSize =
+                ZSTD_ldm_blockCompress(&ldmSeqStore,
+                                       ms, &zc->seqStore,
+                                       zc->blockState.nextCBlock->rep,
+                                       src, srcSize);
+            assert(ldmSeqStore.pos == ldmSeqStore.size);
+        } else {   /* not long range mode */
+            ZSTD_blockCompressor const blockCompressor = ZSTD_selectBlockCompressor(zc->appliedParams.cParams.strategy, dictMode);
+            lastLLSize = blockCompressor(ms, &zc->seqStore, zc->blockState.nextCBlock->rep, src, srcSize);
+        }
+        {   const BYTE* const lastLiterals = (const BYTE*)src + srcSize - lastLLSize;
+            ZSTD_storeLastLiterals(&zc->seqStore, lastLiterals, lastLLSize);
+    }   }
+    return ZSTDbss_compress;
+}
+
+static void ZSTD_copyBlockSequences(ZSTD_CCtx* zc)
+{
+    const seqStore_t* seqStore = ZSTD_getSeqStore(zc);
+    const seqDef* seqs = seqStore->sequencesStart;
+    size_t seqsSize = seqStore->sequences - seqs;
+
+    ZSTD_Sequence* outSeqs = &zc->seqCollector.seqStart[zc->seqCollector.seqIndex];
+    size_t i; size_t position; int repIdx;
+
+    assert(zc->seqCollector.seqIndex + 1 < zc->seqCollector.maxSequences);
+    for (i = 0, position = 0; i < seqsSize; ++i) {
+        outSeqs[i].offset = seqs[i].offset;
+        outSeqs[i].litLength = seqs[i].litLength;
+        outSeqs[i].matchLength = seqs[i].matchLength + MINMATCH;
+
+        if (i == seqStore->longLengthPos) {
+            if (seqStore->longLengthID == 1) {
+                outSeqs[i].litLength += 0x10000;
+            } else if (seqStore->longLengthID == 2) {
+                outSeqs[i].matchLength += 0x10000;
+            }
+        }
+
+        if (outSeqs[i].offset <= ZSTD_REP_NUM) {
+            outSeqs[i].rep = outSeqs[i].offset;
+            repIdx = (unsigned int)i - outSeqs[i].offset;
+
+            if (outSeqs[i].litLength == 0) {
+                if (outSeqs[i].offset < 3) {
+                    --repIdx;
+                } else {
+                    repIdx = (unsigned int)i - 1;
+                }
+                ++outSeqs[i].rep;
+            }
+            assert(repIdx >= -3);
+            outSeqs[i].offset = repIdx >= 0 ? outSeqs[repIdx].offset : ZSTDInternalConstants::repStartValue[-repIdx - 1];
+            if (outSeqs[i].rep == 4) {
+                --outSeqs[i].offset;
+            }
+        } else {
+            outSeqs[i].offset -= ZSTD_REP_NUM;
+        }
+
+        position += outSeqs[i].litLength;
+        outSeqs[i].matchPos = (unsigned int)position;
+        position += outSeqs[i].matchLength;
+    }
+    zc->seqCollector.seqIndex += seqsSize;
+}
+
+size_t ZSTD_getSequences(ZSTD_CCtx* zc, ZSTD_Sequence* outSeqs,
+    size_t outSeqsSize, const void* src, size_t srcSize)
+{
+    const size_t dstCapacity = ZSTD_compressBound(srcSize);
+    void* dst = ZSTD_malloc(dstCapacity, ZSTDInternalConstants::ZSTD_defaultCMem);
+    SeqCollector seqCollector;
+
+    RETURN_ERROR_IF(dst == NULL, memory_allocation, "NULL pointer!");
+
+    seqCollector.collectSequences = 1;
+    seqCollector.seqStart = outSeqs;
+    seqCollector.seqIndex = 0;
+    seqCollector.maxSequences = outSeqsSize;
+    zc->seqCollector = seqCollector;
+
+    ZSTD_compress2(zc, dst, dstCapacity, src, srcSize);
+    ZSTD_free(dst, ZSTDInternalConstants::ZSTD_defaultCMem);
+    return zc->seqCollector.seqIndex;
+}
+
+/* Returns true if the given block is a RLE block */
+static int ZSTD_isRLE(const BYTE *ip, size_t length) {
+    size_t i;
+    if (length < 2) return 1;
+    for (i = 1; i < length; ++i) {
+        if (ip[0] != ip[i]) return 0;
+    }
+    return 1;
+}
+
+/* Returns true if the given block may be RLE.
+ * This is just a heuristic based on the compressibility.
+ * It may return both false positives and false negatives.
+ */
+static int ZSTD_maybeRLE(seqStore_t const* seqStore)
+{
+    size_t const nbSeqs = (size_t)(seqStore->sequences - seqStore->sequencesStart);
+    size_t const nbLits = (size_t)(seqStore->lit - seqStore->litStart);
+
+    return nbSeqs < 4 && nbLits < 10;
+}
+
+static void ZSTD_confirmRepcodesAndEntropyTables(ZSTD_CCtx* zc)
+{
+    ZSTD_compressedBlockState_t* const tmp = zc->blockState.prevCBlock;
+    zc->blockState.prevCBlock = zc->blockState.nextCBlock;
+    zc->blockState.nextCBlock = tmp;
+}
+
+static size_t ZSTD_compressBlock_internal(ZSTD_CCtx* zc,
+                                        void* dst, size_t dstCapacity,
+                                        const void* src, size_t srcSize, U32 frame)
+{
+    /* This the upper bound for the length of an rle block.
+     * This isn't the actual upper bound. Finding the real threshold
+     * needs further investigation.
+     */
+    const U32 rleMaxLength = 25;
+    size_t cSize;
+    const BYTE* ip = (const BYTE*)src;
+    BYTE* op = (BYTE*)dst;
+    DEBUGLOG(5, "ZSTD_compressBlock_internal (dstCapacity=%u, dictLimit=%u, nextToUpdate=%u)",
+                (unsigned)dstCapacity, (unsigned)zc->blockState.matchState.window.dictLimit,
+                (unsigned)zc->blockState.matchState.nextToUpdate);
+
+    {   const size_t bss = ZSTD_buildSeqStore(zc, src, srcSize);
+        FORWARD_IF_ERROR(bss, "ZSTD_buildSeqStore failed");
+        if (bss == ZSTDbss_noCompress) { cSize = 0; goto out; }
+    }
+
+    if (zc->seqCollector.collectSequences) {
+        ZSTD_copyBlockSequences(zc);
+        return 0;
+    }
+
+    /* encode sequences and literals */
+    cSize = ZSTD_compressSequences(&zc->seqStore,
+            &zc->blockState.prevCBlock->entropy, &zc->blockState.nextCBlock->entropy,
+            &zc->appliedParams,
+            dst, dstCapacity,
+            srcSize,
+            zc->entropyWorkspace, HUF_WORKSPACE_SIZE /* statically allocated in resetCCtx */,
+            zc->bmi2);
+
+    if (frame &&
+        /* We don't want to emit our first block as a RLE even if it qualifies because
+         * doing so will cause the decoder (cli only) to throw a "should consume all input error."
+         * This is only an issue for zstd <= v1.4.3
+         */
+        !zc->isFirstBlock &&
+        cSize < rleMaxLength &&
+        ZSTD_isRLE(ip, srcSize))
+    {
+        cSize = 1;
+        op[0] = ip[0];
+    }
+
+out:
+    if (!ZSTD_isError(cSize) && cSize > 1) {
+        ZSTD_confirmRepcodesAndEntropyTables(zc);
+    }
+    /* We check that dictionaries have offset codes available for the first
+     * block. After the first block, the offcode table might not have large
+     * enough codes to represent the offsets in the data.
+     */
+    if (zc->blockState.prevCBlock->entropy.fse.offcode_repeatMode == FSE_repeat_valid)
+        zc->blockState.prevCBlock->entropy.fse.offcode_repeatMode = FSE_repeat_check;
+
+    return cSize;
+}
+
+static size_t ZSTD_compressBlock_targetCBlockSize_body(ZSTD_CCtx* zc,
+                               void* dst, size_t dstCapacity,
+                               const void* src, size_t srcSize,
+                               const size_t bss, U32 lastBlock)
+{
+    DEBUGLOG(6, "Attempting ZSTD_compressSuperBlock()");
+    if (bss == ZSTDbss_compress) {
+        if (/* We don't want to emit our first block as a RLE even if it qualifies because
+            * doing so will cause the decoder (cli only) to throw a "should consume all input error."
+            * This is only an issue for zstd <= v1.4.3
+            */
+            !zc->isFirstBlock &&
+            ZSTD_maybeRLE(&zc->seqStore) &&
+            ZSTD_isRLE((BYTE const*)src, srcSize))
+        {
+            return ZSTD_rleCompressBlock(dst, dstCapacity, *(BYTE const*)src, srcSize, lastBlock);
+        }
+        /* Attempt superblock compression.
+         *
+         * Note that compressed size of ZSTD_compressSuperBlock() is not bound by the
+         * standard ZSTD_compressBound(). This is a problem, because even if we have
+         * space now, taking an extra byte now could cause us to run out of space later
+         * and violate ZSTD_compressBound().
+         *
+         * Define blockBound(blockSize) = blockSize + ZSTD_blockHeaderSize.
+         *
+         * In order to respect ZSTD_compressBound() we must attempt to emit a raw
+         * uncompressed block in these cases:
+         *   * cSize == 0: Return code for an uncompressed block.
+         *   * cSize == dstSize_tooSmall: We may have expanded beyond blockBound(srcSize).
+         *     ZSTD_noCompressBlock() will return dstSize_tooSmall if we are really out of
+         *     output space.
+         *   * cSize >= blockBound(srcSize): We have expanded the block too much so
+         *     emit an uncompressed block.
+         */
+        {
+            size_t const cSize = ZSTD_compressSuperBlock(zc, dst, dstCapacity, src, srcSize, lastBlock);
+            if (cSize != ERROR(dstSize_tooSmall)) {
+                size_t const maxCSize = srcSize - ZSTD_minGain(srcSize, zc->appliedParams.cParams.strategy);
+                FORWARD_IF_ERROR(cSize, "ZSTD_compressSuperBlock failed");
+                if (cSize != 0 && cSize < maxCSize + ZSTDInternalConstants::ZSTD_blockHeaderSize) {
+                    ZSTD_confirmRepcodesAndEntropyTables(zc);
+                    return cSize;
+                }
+            }
+        }
+    }
+
+    DEBUGLOG(6, "Resorting to ZSTD_noCompressBlock()");
+    /* Superblock compression failed, attempt to emit a single no compress block.
+     * The decoder will be able to stream this block since it is uncompressed.
+     */
+    return ZSTD_noCompressBlock(dst, dstCapacity, src, srcSize, lastBlock);
+}
+
+static size_t ZSTD_compressBlock_targetCBlockSize(ZSTD_CCtx* zc,
+                               void* dst, size_t dstCapacity,
+                               const void* src, size_t srcSize,
+                               U32 lastBlock)
+{
+    size_t cSize = 0;
+    const size_t bss = ZSTD_buildSeqStore(zc, src, srcSize);
+    DEBUGLOG(5, "ZSTD_compressBlock_targetCBlockSize (dstCapacity=%u, dictLimit=%u, nextToUpdate=%u, srcSize=%zu)",
+                (unsigned)dstCapacity, (unsigned)zc->blockState.matchState.window.dictLimit, (unsigned)zc->blockState.matchState.nextToUpdate, srcSize);
+    FORWARD_IF_ERROR(bss, "ZSTD_buildSeqStore failed");
+
+    cSize = ZSTD_compressBlock_targetCBlockSize_body(zc, dst, dstCapacity, src, srcSize, bss, lastBlock);
+    FORWARD_IF_ERROR(cSize, "ZSTD_compressBlock_targetCBlockSize_body failed");
+
+    if (zc->blockState.prevCBlock->entropy.fse.offcode_repeatMode == FSE_repeat_valid)
+        zc->blockState.prevCBlock->entropy.fse.offcode_repeatMode = FSE_repeat_check;
+
+    return cSize;
+}
+
+static void ZSTD_overflowCorrectIfNeeded(ZSTD_matchState_t* ms,
+                                         ZSTD_cwksp* ws,
+                                         ZSTD_CCtx_params const* params,
+                                         void const* ip,
+                                         void const* iend)
+{
+    if (ZSTD_window_needOverflowCorrection(ms->window, iend)) {
+        U32 const maxDist = (U32)1 << params->cParams.windowLog;
+        U32 const cycleLog = ZSTD_cycleLog(params->cParams.chainLog, params->cParams.strategy);
+        U32 const correction = ZSTD_window_correctOverflow(&ms->window, cycleLog, maxDist, ip);
+        ZSTD_STATIC_ASSERT(ZSTD_CHAINLOG_MAX <= 30);
+        ZSTD_STATIC_ASSERT(ZSTD_WINDOWLOG_MAX_32 <= 30);
+        ZSTD_STATIC_ASSERT(ZSTD_WINDOWLOG_MAX <= 31);
+        ZSTD_cwksp_mark_tables_dirty(ws);
+        ZSTD_reduceIndex(ms, params, correction);
+        ZSTD_cwksp_mark_tables_clean(ws);
+        if (ms->nextToUpdate < correction) ms->nextToUpdate = 0;
+        else ms->nextToUpdate -= correction;
+        /* invalidate dictionaries on overflow correction */
+        ms->loadedDictEnd = 0;
+        ms->dictMatchState = NULL;
+    }
+}
+
+/*! ZSTD_compress_frameChunk() :
+*   Compress a chunk of data into one or multiple blocks.
+*   All blocks will be terminated, all input will be consumed.
+*   Function will issue an error if there is not enough `dstCapacity` to hold the compressed content.
+*   Frame is supposed already started (header already produced)
+*   @return : compressed size, or an error code
+*/
+static size_t ZSTD_compress_frameChunk (ZSTD_CCtx* cctx,
+                                     void* dst, size_t dstCapacity,
+                               const void* src, size_t srcSize,
+                                     U32 lastFrameChunk)
+{
+    size_t blockSize = cctx->blockSize;
+    size_t remaining = srcSize;
+    const BYTE* ip = (const BYTE*)src;
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* op = ostart;
+    U32 const maxDist = (U32)1 << cctx->appliedParams.cParams.windowLog;
+
+    assert(cctx->appliedParams.cParams.windowLog <= ZSTD_WINDOWLOG_MAX);
+
+    DEBUGLOG(5, "ZSTD_compress_frameChunk (blockSize=%u)", (unsigned)blockSize);
+    if (cctx->appliedParams.fParams.checksumFlag && srcSize)
+        XXH64_update(&cctx->xxhState, src, srcSize);
+
+    while (remaining) {
+        ZSTD_matchState_t* const ms = &cctx->blockState.matchState;
+        U32 const lastBlock = lastFrameChunk & (blockSize >= remaining);
+
+        RETURN_ERROR_IF(dstCapacity < ZSTDInternalConstants::ZSTD_blockHeaderSize + MIN_CBLOCK_SIZE,
+                        dstSize_tooSmall,
+                        "not enough space to store compressed block");
+        if (remaining < blockSize) blockSize = remaining;
+
+        ZSTD_overflowCorrectIfNeeded(
+            ms, &cctx->workspace, &cctx->appliedParams, ip, ip + blockSize);
+        ZSTD_checkDictValidity(&ms->window, ip + blockSize, maxDist, &ms->loadedDictEnd, &ms->dictMatchState);
+
+        /* Ensure hash/chain table insertion resumes no sooner than lowlimit */
+        if (ms->nextToUpdate < ms->window.lowLimit) ms->nextToUpdate = ms->window.lowLimit;
+
+        {   size_t cSize;
+            if (ZSTD_useTargetCBlockSize(&cctx->appliedParams)) {
+                cSize = ZSTD_compressBlock_targetCBlockSize(cctx, op, dstCapacity, ip, blockSize, lastBlock);
+                FORWARD_IF_ERROR(cSize, "ZSTD_compressBlock_targetCBlockSize failed");
+                assert(cSize > 0);
+                assert(cSize <= blockSize + ZSTDInternalConstants::ZSTD_blockHeaderSize);
+            } else {
+                cSize = ZSTD_compressBlock_internal(cctx,
+                                        op+ZSTDInternalConstants::ZSTD_blockHeaderSize, dstCapacity-ZSTDInternalConstants::ZSTD_blockHeaderSize,
+                                        ip, blockSize, 1 /* frame */);
+                FORWARD_IF_ERROR(cSize, "ZSTD_compressBlock_internal failed");
+
+                if (cSize == 0) {  /* block is not compressible */
+                    cSize = ZSTD_noCompressBlock(op, dstCapacity, ip, blockSize, lastBlock);
+                    FORWARD_IF_ERROR(cSize, "ZSTD_noCompressBlock failed");
+                } else {
+                    U32 const cBlockHeader = cSize == 1 ?
+                        lastBlock + (((U32)bt_rle)<<1) + (U32)(blockSize << 3) :
+                        lastBlock + (((U32)bt_compressed)<<1) + (U32)(cSize << 3);
+                    MEM_writeLE24(op, cBlockHeader);
+                    cSize += ZSTDInternalConstants::ZSTD_blockHeaderSize;
+                }
+            }
+
+
+            ip += blockSize;
+            assert(remaining >= blockSize);
+            remaining -= blockSize;
+            op += cSize;
+            assert(dstCapacity >= cSize);
+            dstCapacity -= cSize;
+            cctx->isFirstBlock = 0;
+            DEBUGLOG(5, "ZSTD_compress_frameChunk: adding a block of size %u",
+                        (unsigned)cSize);
+    }   }
+
+    if (lastFrameChunk && (op>ostart)) cctx->stage = ZSTDcs_ending;
+    return (size_t)(op-ostart);
+}
+
+
+static size_t ZSTD_writeFrameHeader(void* dst, size_t dstCapacity,
+                                    const ZSTD_CCtx_params* params, U64 pledgedSrcSize, U32 dictID)
+{   BYTE* const op = (BYTE*)dst;
+    U32   const dictIDSizeCodeLength = (dictID>0) + (dictID>=256) + (dictID>=65536);   /* 0-3 */
+    U32   const dictIDSizeCode = params->fParams.noDictIDFlag ? 0 : dictIDSizeCodeLength;   /* 0-3 */
+    U32   const checksumFlag = params->fParams.checksumFlag>0;
+    U32   const windowSize = (U32)1 << params->cParams.windowLog;
+    U32   const singleSegment = params->fParams.contentSizeFlag && (windowSize >= pledgedSrcSize);
+    BYTE  const windowLogByte = (BYTE)((params->cParams.windowLog - ZSTD_WINDOWLOG_ABSOLUTEMIN) << 3);
+    U32   const fcsCode = params->fParams.contentSizeFlag ?
+                     (pledgedSrcSize>=256) + (pledgedSrcSize>=65536+256) + (pledgedSrcSize>=0xFFFFFFFFU) : 0;  /* 0-3 */
+    BYTE  const frameHeaderDescriptionByte = (BYTE)(dictIDSizeCode + (checksumFlag<<2) + (singleSegment<<5) + (fcsCode<<6) );
+    size_t pos=0;
+
+    assert(!(params->fParams.contentSizeFlag && pledgedSrcSize == ZSTD_CONTENTSIZE_UNKNOWN));
+    RETURN_ERROR_IF(dstCapacity < ZSTD_FRAMEHEADERSIZE_MAX, dstSize_tooSmall,
+                    "dst buf is too small to fit worst-case frame header size.");
+    DEBUGLOG(4, "ZSTD_writeFrameHeader : dictIDFlag : %u ; dictID : %u ; dictIDSizeCode : %u",
+                !params->fParams.noDictIDFlag, (unsigned)dictID, (unsigned)dictIDSizeCode);
+
+    if (params->format == ZSTD_f_zstd1) {
+        MEM_writeLE32(dst, ZSTD_MAGICNUMBER);
+        pos = 4;
+    }
+    op[pos++] = frameHeaderDescriptionByte;
+    if (!singleSegment) op[pos++] = windowLogByte;
+    switch(dictIDSizeCode)
+    {
+        default:  assert(0); /* impossible */
+        case 0 : break;
+        case 1 : op[pos] = (BYTE)(dictID); pos++; break;
+        case 2 : MEM_writeLE16(op+pos, (U16)dictID); pos+=2; break;
+        case 3 : MEM_writeLE32(op+pos, dictID); pos+=4; break;
+    }
+    switch(fcsCode)
+    {
+        default:  assert(0); /* impossible */
+        case 0 : if (singleSegment) op[pos++] = (BYTE)(pledgedSrcSize); break;
+        case 1 : MEM_writeLE16(op+pos, (U16)(pledgedSrcSize-256)); pos+=2; break;
+        case 2 : MEM_writeLE32(op+pos, (U32)(pledgedSrcSize)); pos+=4; break;
+        case 3 : MEM_writeLE64(op+pos, (U64)(pledgedSrcSize)); pos+=8; break;
+    }
+    return pos;
+}
+
+/* ZSTD_writeLastEmptyBlock() :
+ * output an empty Block with end-of-frame mark to complete a frame
+ * @return : size of data written into `dst` (== ZSTD_blockHeaderSize (defined in zstd_internal.h))
+ *           or an error code if `dstCapacity` is too small (<ZSTD_blockHeaderSize)
+ */
+size_t ZSTD_writeLastEmptyBlock(void* dst, size_t dstCapacity)
+{
+    RETURN_ERROR_IF(dstCapacity < ZSTDInternalConstants::ZSTD_blockHeaderSize, dstSize_tooSmall,
+                    "dst buf is too small to write frame trailer empty block.");
+    {   U32 const cBlockHeader24 = 1 /*lastBlock*/ + (((U32)bt_raw)<<1);  /* 0 size */
+        MEM_writeLE24(dst, cBlockHeader24);
+        return ZSTDInternalConstants::ZSTD_blockHeaderSize;
+    }
+}
+
+size_t ZSTD_referenceExternalSequences(ZSTD_CCtx* cctx, rawSeq* seq, size_t nbSeq)
+{
+    RETURN_ERROR_IF(cctx->stage != ZSTDcs_init, stage_wrong,
+                    "wrong cctx stage");
+    RETURN_ERROR_IF(cctx->appliedParams.ldmParams.enableLdm,
+                    parameter_unsupported,
+                    "incompatible with ldm");
+    cctx->externSeqStore.seq = seq;
+    cctx->externSeqStore.size = nbSeq;
+    cctx->externSeqStore.capacity = nbSeq;
+    cctx->externSeqStore.pos = 0;
+    return 0;
+}
+
+
+static size_t ZSTD_compressContinue_internal (ZSTD_CCtx* cctx,
+                              void* dst, size_t dstCapacity,
+                        const void* src, size_t srcSize,
+                               U32 frame, U32 lastFrameChunk)
+{
+    ZSTD_matchState_t* const ms = &cctx->blockState.matchState;
+    size_t fhSize = 0;
+
+    DEBUGLOG(5, "ZSTD_compressContinue_internal, stage: %u, srcSize: %u",
+                cctx->stage, (unsigned)srcSize);
+    RETURN_ERROR_IF(cctx->stage==ZSTDcs_created, stage_wrong,
+                    "missing init (ZSTD_compressBegin)");
+
+    if (frame && (cctx->stage==ZSTDcs_init)) {
+        fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, &cctx->appliedParams,
+                                       cctx->pledgedSrcSizePlusOne-1, cctx->dictID);
+        FORWARD_IF_ERROR(fhSize, "ZSTD_writeFrameHeader failed");
+        assert(fhSize <= dstCapacity);
+        dstCapacity -= fhSize;
+        dst = (char*)dst + fhSize;
+        cctx->stage = ZSTDcs_ongoing;
+    }
+
+    if (!srcSize) return fhSize;  /* do not generate an empty block if no input */
+
+    if (!ZSTD_window_update(&ms->window, src, srcSize)) {
+        ms->nextToUpdate = ms->window.dictLimit;
+    }
+    if (cctx->appliedParams.ldmParams.enableLdm) {
+        ZSTD_window_update(&cctx->ldmState.window, src, srcSize);
+    }
+
+    if (!frame) {
+        /* overflow check and correction for block mode */
+        ZSTD_overflowCorrectIfNeeded(
+            ms, &cctx->workspace, &cctx->appliedParams,
+            src, (BYTE const*)src + srcSize);
+    }
+
+    DEBUGLOG(5, "ZSTD_compressContinue_internal (blockSize=%u)", (unsigned)cctx->blockSize);
+    {   size_t const cSize = frame ?
+                             ZSTD_compress_frameChunk (cctx, dst, dstCapacity, src, srcSize, lastFrameChunk) :
+                             ZSTD_compressBlock_internal (cctx, dst, dstCapacity, src, srcSize, 0 /* frame */);
+        FORWARD_IF_ERROR(cSize, "%s", frame ? "ZSTD_compress_frameChunk failed" : "ZSTD_compressBlock_internal failed");
+        cctx->consumedSrcSize += srcSize;
+        cctx->producedCSize += (cSize + fhSize);
+        assert(!(cctx->appliedParams.fParams.contentSizeFlag && cctx->pledgedSrcSizePlusOne == 0));
+        if (cctx->pledgedSrcSizePlusOne != 0) {  /* control src size */
+            ZSTD_STATIC_ASSERT(ZSTD_CONTENTSIZE_UNKNOWN == (unsigned long long)-1);
+            RETURN_ERROR_IF(
+                cctx->consumedSrcSize+1 > cctx->pledgedSrcSizePlusOne,
+                srcSize_wrong,
+                "error : pledgedSrcSize = %u, while realSrcSize >= %u",
+                (unsigned)cctx->pledgedSrcSizePlusOne-1,
+                (unsigned)cctx->consumedSrcSize);
+        }
+        return cSize + fhSize;
+    }
+}
+
+size_t ZSTD_compressContinue (ZSTD_CCtx* cctx,
+                              void* dst, size_t dstCapacity,
+                        const void* src, size_t srcSize)
+{
+    DEBUGLOG(5, "ZSTD_compressContinue (srcSize=%u)", (unsigned)srcSize);
+    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1 /* frame mode */, 0 /* last chunk */);
+}
+
+
+size_t ZSTD_getBlockSize(const ZSTD_CCtx* cctx)
+{
+    ZSTD_compressionParameters const cParams = cctx->appliedParams.cParams;
+    assert(!ZSTD_checkCParams(cParams));
+    return MIN (ZSTD_BLOCKSIZE_MAX, (U32)1 << cParams.windowLog);
+}
+
+size_t ZSTD_compressBlock(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    DEBUGLOG(5, "ZSTD_compressBlock: srcSize = %u", (unsigned)srcSize);
+    { size_t const blockSizeMax = ZSTD_getBlockSize(cctx);
+      RETURN_ERROR_IF(srcSize > blockSizeMax, srcSize_wrong, "input is larger than a block"); }
+
+    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0 /* frame mode */, 0 /* last chunk */);
+}
+
+/*! ZSTD_loadDictionaryContent() :
+ *  @return : 0, or an error code
+ */
+static size_t ZSTD_loadDictionaryContent(ZSTD_matchState_t* ms,
+                                         ldmState_t* ls,
+                                         ZSTD_cwksp* ws,
+                                         ZSTD_CCtx_params const* params,
+                                         const void* src, size_t srcSize,
+                                         ZSTD_dictTableLoadMethod_e dtlm)
+{
+    const BYTE* ip = (const BYTE*) src;
+    const BYTE* const iend = ip + srcSize;
+
+    ZSTD_window_update(&ms->window, src, srcSize);
+    ms->loadedDictEnd = params->forceWindow ? 0 : (U32)(iend - ms->window.base);
+
+    if (params->ldmParams.enableLdm && ls != NULL) {
+        ZSTD_window_update(&ls->window, src, srcSize);
+        ls->loadedDictEnd = params->forceWindow ? 0 : (U32)(iend - ls->window.base);
+    }
+
+    /* Assert that we the ms params match the params we're being given */
+    ZSTD_assertEqualCParams(params->cParams, ms->cParams);
+
+    if (srcSize <= HASH_READ_SIZE) return 0;
+
+    while (iend - ip > HASH_READ_SIZE) {
+        size_t const remaining = (size_t)(iend - ip);
+        size_t const chunk = MIN(remaining, ZSTD_CHUNKSIZE_MAX);
+        const BYTE* const ichunk = ip + chunk;
+
+        ZSTD_overflowCorrectIfNeeded(ms, ws, params, ip, ichunk);
+
+        if (params->ldmParams.enableLdm && ls != NULL)
+            ZSTD_ldm_fillHashTable(ls, (const BYTE*)src, (const BYTE*)src + srcSize, &params->ldmParams);
+
+        switch(params->cParams.strategy)
+        {
+        case ZSTD_fast:
+            ZSTD_fillHashTable(ms, ichunk, dtlm);
+            break;
+        case ZSTD_dfast:
+            ZSTD_fillDoubleHashTable(ms, ichunk, dtlm);
+            break;
+
+        case ZSTD_greedy:
+        case ZSTD_lazy:
+        case ZSTD_lazy2:
+            if (chunk >= HASH_READ_SIZE)
+                ZSTD_insertAndFindFirstIndex(ms, ichunk-HASH_READ_SIZE);
+            break;
+
+        case ZSTD_btlazy2:   /* we want the dictionary table fully sorted */
+        case ZSTD_btopt:
+        case ZSTD_btultra:
+        case ZSTD_btultra2:
+            if (chunk >= HASH_READ_SIZE)
+                ZSTD_updateTree(ms, ichunk-HASH_READ_SIZE, ichunk);
+            break;
+
+        default:
+            assert(0);  /* not possible : not a valid strategy id */
+        }
+
+        ip = ichunk;
+    }
+
+    ms->nextToUpdate = (U32)(iend - ms->window.base);
+    return 0;
+}
+
+
+/* Dictionaries that assign zero probability to symbols that show up causes problems
+   when FSE encoding.  Refuse dictionaries that assign zero probability to symbols
+   that we may encounter during compression.
+   NOTE: This behavior is not standard and could be improved in the future. */
+static size_t ZSTD_checkDictNCount(short* normalizedCounter, unsigned dictMaxSymbolValue, unsigned maxSymbolValue) {
+    U32 s;
+    RETURN_ERROR_IF(dictMaxSymbolValue < maxSymbolValue, dictionary_corrupted, "dict fse tables don't have all symbols");
+    for (s = 0; s <= maxSymbolValue; ++s) {
+        RETURN_ERROR_IF(normalizedCounter[s] == 0, dictionary_corrupted, "dict fse tables don't have all symbols");
+    }
+    return 0;
+}
+
+size_t ZSTD_loadCEntropy(ZSTD_compressedBlockState_t* bs, void* workspace,
+                         short* offcodeNCount, unsigned* offcodeMaxValue,
+                         const void* const dict, size_t dictSize)
+{
+    const BYTE* dictPtr = (const BYTE*)dict;    /* skip magic num and dict ID */
+    const BYTE* const dictEnd = dictPtr + dictSize;
+    dictPtr += 8;
+    bs->entropy.huf.repeatMode = HUF_repeat_check;
+
+    {   unsigned maxSymbolValue = 255;
+        unsigned hasZeroWeights = 1;
+        size_t const hufHeaderSize = HUF_readCTable((HUF_CElt*)bs->entropy.huf.CTable, &maxSymbolValue, dictPtr,
+            dictEnd-dictPtr, &hasZeroWeights);
+
+        /* We only set the loaded table as valid if it contains all non-zero
+         * weights. Otherwise, we set it to check */
+        if (!hasZeroWeights)
+            bs->entropy.huf.repeatMode = HUF_repeat_valid;
+
+        RETURN_ERROR_IF(HUF_isError(hufHeaderSize), dictionary_corrupted, "");
+        RETURN_ERROR_IF(maxSymbolValue < 255, dictionary_corrupted, "");
+        dictPtr += hufHeaderSize;
+    }
+
+    {   unsigned offcodeLog;
+        size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
+        RETURN_ERROR_IF(FSE_isError(offcodeHeaderSize), dictionary_corrupted, "");
+        RETURN_ERROR_IF(offcodeLog > OffFSELog, dictionary_corrupted, "");
+        /* Defer checking offcodeMaxValue because we need to know the size of the dictionary content */
+        /* fill all offset symbols to avoid garbage at end of table */
+        RETURN_ERROR_IF(FSE_isError(FSE_buildCTable_wksp(
+                bs->entropy.fse.offcodeCTable,
+                offcodeNCount, MaxOff, offcodeLog,
+                workspace, HUF_WORKSPACE_SIZE)),
+            dictionary_corrupted, "");
+        dictPtr += offcodeHeaderSize;
+    }
+
+    {   short matchlengthNCount[MaxML+1];
+        unsigned matchlengthMaxValue = MaxML, matchlengthLog;
+        size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
+        RETURN_ERROR_IF(FSE_isError(matchlengthHeaderSize), dictionary_corrupted, "");
+        RETURN_ERROR_IF(matchlengthLog > MLFSELog, dictionary_corrupted, "");
+        /* Every match length code must have non-zero probability */
+        FORWARD_IF_ERROR( ZSTD_checkDictNCount(matchlengthNCount, matchlengthMaxValue, MaxML), "");
+        RETURN_ERROR_IF(FSE_isError(FSE_buildCTable_wksp(
+                bs->entropy.fse.matchlengthCTable,
+                matchlengthNCount, matchlengthMaxValue, matchlengthLog,
+                workspace, HUF_WORKSPACE_SIZE)),
+            dictionary_corrupted, "");
+        dictPtr += matchlengthHeaderSize;
+    }
+
+    {   short litlengthNCount[MaxLL+1];
+        unsigned litlengthMaxValue = MaxLL, litlengthLog;
+        size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
+        RETURN_ERROR_IF(FSE_isError(litlengthHeaderSize), dictionary_corrupted, "");
+        RETURN_ERROR_IF(litlengthLog > LLFSELog, dictionary_corrupted, "");
+        /* Every literal length code must have non-zero probability */
+        FORWARD_IF_ERROR( ZSTD_checkDictNCount(litlengthNCount, litlengthMaxValue, MaxLL), "");
+        RETURN_ERROR_IF(FSE_isError(FSE_buildCTable_wksp(
+                bs->entropy.fse.litlengthCTable,
+                litlengthNCount, litlengthMaxValue, litlengthLog,
+                workspace, HUF_WORKSPACE_SIZE)),
+            dictionary_corrupted, "");
+        dictPtr += litlengthHeaderSize;
+    }
+
+    RETURN_ERROR_IF(dictPtr+12 > dictEnd, dictionary_corrupted, "");
+    bs->rep[0] = MEM_readLE32(dictPtr+0);
+    bs->rep[1] = MEM_readLE32(dictPtr+4);
+    bs->rep[2] = MEM_readLE32(dictPtr+8);
+    dictPtr += 12;
+
+    return dictPtr - (const BYTE*)dict;
+}
+
+/* Dictionary format :
+ * See :
+ * https://github.com/facebook/zstd/blob/master/doc/zstd_compression_format.md#dictionary-format
+ */
+/*! ZSTD_loadZstdDictionary() :
+ * @return : dictID, or an error code
+ *  assumptions : magic number supposed already checked
+ *                dictSize supposed >= 8
+ */
+static size_t ZSTD_loadZstdDictionary(ZSTD_compressedBlockState_t* bs,
+                                      ZSTD_matchState_t* ms,
+                                      ZSTD_cwksp* ws,
+                                      ZSTD_CCtx_params const* params,
+                                      const void* dict, size_t dictSize,
+                                      ZSTD_dictTableLoadMethod_e dtlm,
+                                      void* workspace)
+{
+    const BYTE* dictPtr = (const BYTE*)dict;
+    const BYTE* const dictEnd = dictPtr + dictSize;
+    short offcodeNCount[MaxOff+1];
+    unsigned offcodeMaxValue = MaxOff;
+    size_t dictID;
+    size_t eSize;
+
+    ZSTD_STATIC_ASSERT(HUF_WORKSPACE_SIZE >= (1<<MAX(MLFSELog,LLFSELog)));
+    assert(dictSize >= 8);
+    assert(MEM_readLE32(dictPtr) == ZSTD_MAGIC_DICTIONARY);
+
+    dictID = params->fParams.noDictIDFlag ? 0 :  MEM_readLE32(dictPtr + 4 /* skip magic number */ );
+    eSize = ZSTD_loadCEntropy(bs, workspace, offcodeNCount, &offcodeMaxValue, dict, dictSize);
+    FORWARD_IF_ERROR(eSize, "ZSTD_loadCEntropy failed");
+    dictPtr += eSize;
+
+    {   size_t const dictContentSize = (size_t)(dictEnd - dictPtr);
+        U32 offcodeMax = MaxOff;
+        if (dictContentSize <= ((U32)-1) - 128 KB) {
+            U32 const maxOffset = (U32)dictContentSize + 128 KB; /* The maximum offset that must be supported */
+            offcodeMax = ZSTD_highbit32(maxOffset); /* Calculate minimum offset code required to represent maxOffset */
+        }
+        /* All offset values <= dictContentSize + 128 KB must be representable */
+        FORWARD_IF_ERROR(ZSTD_checkDictNCount(offcodeNCount, offcodeMaxValue, MIN(offcodeMax, MaxOff)), "");
+        /* All repCodes must be <= dictContentSize and != 0*/
+        {   U32 u;
+            for (u=0; u<3; u++) {
+                RETURN_ERROR_IF(bs->rep[u] == 0, dictionary_corrupted, "");
+                RETURN_ERROR_IF(bs->rep[u] > dictContentSize, dictionary_corrupted, "");
+        }   }
+
+        bs->entropy.fse.offcode_repeatMode = FSE_repeat_valid;
+        bs->entropy.fse.matchlength_repeatMode = FSE_repeat_valid;
+        bs->entropy.fse.litlength_repeatMode = FSE_repeat_valid;
+        FORWARD_IF_ERROR(ZSTD_loadDictionaryContent(
+            ms, NULL, ws, params, dictPtr, dictContentSize, dtlm), "");
+        return dictID;
+    }
+}
+
+/** ZSTD_compress_insertDictionary() :
+*   @return : dictID, or an error code */
+static size_t
+ZSTD_compress_insertDictionary(ZSTD_compressedBlockState_t* bs,
+                               ZSTD_matchState_t* ms,
+                               ldmState_t* ls,
+                               ZSTD_cwksp* ws,
+                         const ZSTD_CCtx_params* params,
+                         const void* dict, size_t dictSize,
+                               ZSTD_dictContentType_e dictContentType,
+                               ZSTD_dictTableLoadMethod_e dtlm,
+                               void* workspace)
+{
+    DEBUGLOG(4, "ZSTD_compress_insertDictionary (dictSize=%u)", (U32)dictSize);
+    if ((dict==NULL) || (dictSize<8)) {
+        RETURN_ERROR_IF(dictContentType == ZSTD_dct_fullDict, dictionary_wrong, "");
+        return 0;
+    }
+
+    ZSTD_reset_compressedBlockState(bs);
+
+    /* dict restricted modes */
+    if (dictContentType == ZSTD_dct_rawContent)
+        return ZSTD_loadDictionaryContent(ms, ls, ws, params, dict, dictSize, dtlm);
+
+    if (MEM_readLE32(dict) != ZSTD_MAGIC_DICTIONARY) {
+        if (dictContentType == ZSTD_dct_auto) {
+            DEBUGLOG(4, "raw content dictionary detected");
+            return ZSTD_loadDictionaryContent(
+                ms, ls, ws, params, dict, dictSize, dtlm);
+        }
+        RETURN_ERROR_IF(dictContentType == ZSTD_dct_fullDict, dictionary_wrong, "");
+        assert(0);   /* impossible */
+    }
+
+    /* dict as full zstd dictionary */
+    return ZSTD_loadZstdDictionary(
+        bs, ms, ws, params, dict, dictSize, dtlm, workspace);
+}
+
+#define ZSTD_USE_CDICT_PARAMS_SRCSIZE_CUTOFF (128 KB)
+#define ZSTD_USE_CDICT_PARAMS_DICTSIZE_MULTIPLIER (6)
+
+/*! ZSTD_compressBegin_internal() :
+ * @return : 0, or an error code */
+static size_t ZSTD_compressBegin_internal(ZSTD_CCtx* cctx,
+                                    const void* dict, size_t dictSize,
+                                    ZSTD_dictContentType_e dictContentType,
+                                    ZSTD_dictTableLoadMethod_e dtlm,
+                                    const ZSTD_CDict* cdict,
+                                    const ZSTD_CCtx_params* params, U64 pledgedSrcSize,
+                                    ZSTD_buffered_policy_e zbuff)
+{
+    DEBUGLOG(4, "ZSTD_compressBegin_internal: wlog=%u", params->cParams.windowLog);
+    /* params are supposed to be fully validated at this point */
+    assert(!ZSTD_isError(ZSTD_checkCParams(params->cParams)));
+    assert(!((dict) && (cdict)));  /* either dict or cdict, not both */
+    if ( (cdict)
+      && (cdict->dictContentSize > 0)
+      && ( pledgedSrcSize < ZSTD_USE_CDICT_PARAMS_SRCSIZE_CUTOFF
+        || pledgedSrcSize < cdict->dictContentSize * ZSTD_USE_CDICT_PARAMS_DICTSIZE_MULTIPLIER
+        || pledgedSrcSize == ZSTD_CONTENTSIZE_UNKNOWN
+        || cdict->compressionLevel == 0)
+      && (params->attachDictPref != ZSTD_dictForceLoad) ) {
+        return ZSTD_resetCCtx_usingCDict(cctx, cdict, params, pledgedSrcSize, zbuff);
+    }
+
+    FORWARD_IF_ERROR( ZSTD_resetCCtx_internal(cctx, *params, pledgedSrcSize,
+                                     ZSTDcrp_makeClean, zbuff) , "");
+    {   size_t const dictID = cdict ?
+                ZSTD_compress_insertDictionary(
+                        cctx->blockState.prevCBlock, &cctx->blockState.matchState,
+                        &cctx->ldmState, &cctx->workspace, &cctx->appliedParams, cdict->dictContent,
+                        cdict->dictContentSize, dictContentType, dtlm,
+                        cctx->entropyWorkspace)
+              : ZSTD_compress_insertDictionary(
+                        cctx->blockState.prevCBlock, &cctx->blockState.matchState,
+                        &cctx->ldmState, &cctx->workspace, &cctx->appliedParams, dict, dictSize,
+                        dictContentType, dtlm, cctx->entropyWorkspace);
+        FORWARD_IF_ERROR(dictID, "ZSTD_compress_insertDictionary failed");
+        assert(dictID <= UINT_MAX);
+        cctx->dictID = (U32)dictID;
+    }
+    return 0;
+}
+
+size_t ZSTD_compressBegin_advanced_internal(ZSTD_CCtx* cctx,
+                                    const void* dict, size_t dictSize,
+                                    ZSTD_dictContentType_e dictContentType,
+                                    ZSTD_dictTableLoadMethod_e dtlm,
+                                    const ZSTD_CDict* cdict,
+                                    const ZSTD_CCtx_params* params,
+                                    unsigned long long pledgedSrcSize)
+{
+    DEBUGLOG(4, "ZSTD_compressBegin_advanced_internal: wlog=%u", params->cParams.windowLog);
+    /* compression parameters verification and optimization */
+    FORWARD_IF_ERROR( ZSTD_checkCParams(params->cParams) , "");
+    return ZSTD_compressBegin_internal(cctx,
+                                       dict, dictSize, dictContentType, dtlm,
+                                       cdict,
+                                       params, pledgedSrcSize,
+                                       ZSTDb_not_buffered);
+}
+
+/*! ZSTD_compressBegin_advanced() :
+*   @return : 0, or an error code */
+size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx,
+                             const void* dict, size_t dictSize,
+                                   ZSTD_parameters params, unsigned long long pledgedSrcSize)
+{
+    ZSTD_CCtx_params const cctxParams =
+            ZSTD_assignParamsToCCtxParams(&cctx->requestedParams, &params);
+    return ZSTD_compressBegin_advanced_internal(cctx,
+                                            dict, dictSize, ZSTD_dct_auto, ZSTD_dtlm_fast,
+                                            NULL /*cdict*/,
+                                            &cctxParams, pledgedSrcSize);
+}
+
+size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel)
+{
+    ZSTD_parameters const params = ZSTD_getParams_internal(compressionLevel, ZSTD_CONTENTSIZE_UNKNOWN, dictSize);
+    ZSTD_CCtx_params const cctxParams =
+            ZSTD_assignParamsToCCtxParams(&cctx->requestedParams, &params);
+    DEBUGLOG(4, "ZSTD_compressBegin_usingDict (dictSize=%u)", (unsigned)dictSize);
+    return ZSTD_compressBegin_internal(cctx, dict, dictSize, ZSTD_dct_auto, ZSTD_dtlm_fast, NULL,
+                                       &cctxParams, ZSTD_CONTENTSIZE_UNKNOWN, ZSTDb_not_buffered);
+}
+
+size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel)
+{
+    return ZSTD_compressBegin_usingDict(cctx, NULL, 0, compressionLevel);
+}
+
+
+/*! ZSTD_writeEpilogue() :
+*   Ends a frame.
+*   @return : nb of bytes written into dst (or an error code) */
+static size_t ZSTD_writeEpilogue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity)
+{
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* op = ostart;
+    size_t fhSize = 0;
+
+    DEBUGLOG(4, "ZSTD_writeEpilogue");
+    RETURN_ERROR_IF(cctx->stage == ZSTDcs_created, stage_wrong, "init missing");
+
+    /* special case : empty frame */
+    if (cctx->stage == ZSTDcs_init) {
+        fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, &cctx->appliedParams, 0, 0);
+        FORWARD_IF_ERROR(fhSize, "ZSTD_writeFrameHeader failed");
+        dstCapacity -= fhSize;
+        op += fhSize;
+        cctx->stage = ZSTDcs_ongoing;
+    }
+
+    if (cctx->stage != ZSTDcs_ending) {
+        /* write one last empty block, make it the "last" block */
+        U32 const cBlockHeader24 = 1 /* last block */ + (((U32)bt_raw)<<1) + 0;
+        RETURN_ERROR_IF(dstCapacity<4, dstSize_tooSmall, "no room for epilogue");
+        MEM_writeLE32(op, cBlockHeader24);
+        op += ZSTDInternalConstants::ZSTD_blockHeaderSize;
+        dstCapacity -= ZSTDInternalConstants::ZSTD_blockHeaderSize;
+    }
+
+    if (cctx->appliedParams.fParams.checksumFlag) {
+        U32 const checksum = (U32) XXH64_digest(&cctx->xxhState);
+        RETURN_ERROR_IF(dstCapacity<4, dstSize_tooSmall, "no room for checksum");
+        DEBUGLOG(4, "ZSTD_writeEpilogue: write checksum : %08X", (unsigned)checksum);
+        MEM_writeLE32(op, checksum);
+        op += 4;
+    }
+
+    cctx->stage = ZSTDcs_created;  /* return to "created but no init" status */
+    return op-ostart;
+}
+
+size_t ZSTD_compressEnd (ZSTD_CCtx* cctx,
+                         void* dst, size_t dstCapacity,
+                   const void* src, size_t srcSize)
+{
+    size_t endResult;
+    size_t const cSize = ZSTD_compressContinue_internal(cctx,
+                                dst, dstCapacity, src, srcSize,
+                                1 /* frame mode */, 1 /* last chunk */);
+    FORWARD_IF_ERROR(cSize, "ZSTD_compressContinue_internal failed");
+    endResult = ZSTD_writeEpilogue(cctx, (char*)dst + cSize, dstCapacity-cSize);
+    FORWARD_IF_ERROR(endResult, "ZSTD_writeEpilogue failed");
+    assert(!(cctx->appliedParams.fParams.contentSizeFlag && cctx->pledgedSrcSizePlusOne == 0));
+    if (cctx->pledgedSrcSizePlusOne != 0) {  /* control src size */
+        ZSTD_STATIC_ASSERT(ZSTD_CONTENTSIZE_UNKNOWN == (unsigned long long)-1);
+        DEBUGLOG(4, "end of frame : controlling src size");
+        RETURN_ERROR_IF(
+            cctx->pledgedSrcSizePlusOne != cctx->consumedSrcSize+1,
+            srcSize_wrong,
+             "error : pledgedSrcSize = %u, while realSrcSize = %u",
+            (unsigned)cctx->pledgedSrcSizePlusOne-1,
+            (unsigned)cctx->consumedSrcSize);
+    }
+    return cSize + endResult;
+}
+
+
+static size_t ZSTD_compress_internal (ZSTD_CCtx* cctx,
+                                      void* dst, size_t dstCapacity,
+                                const void* src, size_t srcSize,
+                                const void* dict,size_t dictSize,
+                                const ZSTD_parameters* params)
+{
+    ZSTD_CCtx_params const cctxParams =
+            ZSTD_assignParamsToCCtxParams(&cctx->requestedParams, params);
+    DEBUGLOG(4, "ZSTD_compress_internal");
+    return ZSTD_compress_advanced_internal(cctx,
+                                           dst, dstCapacity,
+                                           src, srcSize,
+                                           dict, dictSize,
+                                           &cctxParams);
+}
+
+size_t ZSTD_compress_advanced (ZSTD_CCtx* cctx,
+                               void* dst, size_t dstCapacity,
+                         const void* src, size_t srcSize,
+                         const void* dict,size_t dictSize,
+                               ZSTD_parameters params)
+{
+    DEBUGLOG(4, "ZSTD_compress_advanced");
+    FORWARD_IF_ERROR(ZSTD_checkCParams(params.cParams), "");
+    return ZSTD_compress_internal(cctx,
+                                  dst, dstCapacity,
+                                  src, srcSize,
+                                  dict, dictSize,
+                                  &params);
+}
+
+/* Internal */
+size_t ZSTD_compress_advanced_internal(
+        ZSTD_CCtx* cctx,
+        void* dst, size_t dstCapacity,
+        const void* src, size_t srcSize,
+        const void* dict,size_t dictSize,
+        const ZSTD_CCtx_params* params)
+{
+    DEBUGLOG(4, "ZSTD_compress_advanced_internal (srcSize:%u)", (unsigned)srcSize);
+    FORWARD_IF_ERROR( ZSTD_compressBegin_internal(cctx,
+                         dict, dictSize, ZSTD_dct_auto, ZSTD_dtlm_fast, NULL,
+                         params, srcSize, ZSTDb_not_buffered) , "");
+    return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
+}
+
+size_t ZSTD_compress_usingDict(ZSTD_CCtx* cctx,
+                               void* dst, size_t dstCapacity,
+                         const void* src, size_t srcSize,
+                         const void* dict, size_t dictSize,
+                               int compressionLevel)
+{
+    ZSTD_parameters const params = ZSTD_getParams_internal(compressionLevel, srcSize, dict ? dictSize : 0);
+    ZSTD_CCtx_params cctxParams = ZSTD_assignParamsToCCtxParams(&cctx->requestedParams, &params);
+    DEBUGLOG(4, "ZSTD_compress_usingDict (srcSize=%u)", (unsigned)srcSize);
+    assert(params.fParams.contentSizeFlag == 1);
+    return ZSTD_compress_advanced_internal(cctx, dst, dstCapacity, src, srcSize, dict, dictSize, &cctxParams);
+}
+
+size_t ZSTD_compressCCtx(ZSTD_CCtx* cctx,
+                         void* dst, size_t dstCapacity,
+                   const void* src, size_t srcSize,
+                         int compressionLevel)
+{
+    DEBUGLOG(4, "ZSTD_compressCCtx (srcSize=%u)", (unsigned)srcSize);
+    assert(cctx != NULL);
+    return ZSTD_compress_usingDict(cctx, dst, dstCapacity, src, srcSize, NULL, 0, compressionLevel);
+}
+
+size_t ZSTD_compress(void* dst, size_t dstCapacity,
+               const void* src, size_t srcSize,
+                     int compressionLevel)
+{
+    size_t result;
+    ZSTD_CCtx ctxBody;
+    ZSTD_initCCtx(&ctxBody, ZSTDInternalConstants::ZSTD_defaultCMem);
+    result = ZSTD_compressCCtx(&ctxBody, dst, dstCapacity, src, srcSize, compressionLevel);
+    ZSTD_freeCCtxContent(&ctxBody);   /* can't free ctxBody itself, as it's on stack; free only heap content */
+    return result;
+}
+
+
+/* =====  Dictionary API  ===== */
+
+/*! ZSTD_estimateCDictSize_advanced() :
+ *  Estimate amount of memory that will be needed to create a dictionary with following arguments */
+size_t ZSTD_estimateCDictSize_advanced(
+        size_t dictSize, ZSTD_compressionParameters cParams,
+        ZSTD_dictLoadMethod_e dictLoadMethod)
+{
+    DEBUGLOG(5, "sizeof(ZSTD_CDict) : %u", (unsigned)sizeof(ZSTD_CDict));
+    return ZSTD_cwksp_alloc_size(sizeof(ZSTD_CDict))
+         + ZSTD_cwksp_alloc_size(HUF_WORKSPACE_SIZE)
+         + ZSTD_sizeof_matchState(&cParams, /* forCCtx */ 0)
+         + (dictLoadMethod == ZSTD_dlm_byRef ? 0
+            : ZSTD_cwksp_alloc_size(ZSTD_cwksp_align(dictSize, sizeof(void *))));
+}
+
+size_t ZSTD_estimateCDictSize(size_t dictSize, int compressionLevel)
+{
+    ZSTD_compressionParameters const cParams = ZSTD_getCParams_internal(compressionLevel, ZSTD_CONTENTSIZE_UNKNOWN, dictSize);
+    return ZSTD_estimateCDictSize_advanced(dictSize, cParams, ZSTD_dlm_byCopy);
+}
+
+size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict)
+{
+    if (cdict==NULL) return 0;   /* support sizeof on NULL */
+    DEBUGLOG(5, "sizeof(*cdict) : %u", (unsigned)sizeof(*cdict));
+    /* cdict may be in the workspace */
+    return (cdict->workspace.workspace == cdict ? 0 : sizeof(*cdict))
+        + ZSTD_cwksp_sizeof(&cdict->workspace);
+}
+
+static size_t ZSTD_initCDict_internal(
+                    ZSTD_CDict* cdict,
+              const void* dictBuffer, size_t dictSize,
+                    ZSTD_dictLoadMethod_e dictLoadMethod,
+                    ZSTD_dictContentType_e dictContentType,
+                    ZSTD_compressionParameters cParams)
+{
+    DEBUGLOG(3, "ZSTD_initCDict_internal (dictContentType:%u)", (unsigned)dictContentType);
+    assert(!ZSTD_checkCParams(cParams));
+    cdict->matchState.cParams = cParams;
+    if ((dictLoadMethod == ZSTD_dlm_byRef) || (!dictBuffer) || (!dictSize)) {
+        cdict->dictContent = dictBuffer;
+    } else {
+         void *internalBuffer = ZSTD_cwksp_reserve_object(&cdict->workspace, ZSTD_cwksp_align(dictSize, sizeof(void*)));
+        RETURN_ERROR_IF(!internalBuffer, memory_allocation, "NULL pointer!");
+        cdict->dictContent = internalBuffer;
+        memcpy(internalBuffer, dictBuffer, dictSize);
+    }
+    cdict->dictContentSize = dictSize;
+
+    cdict->entropyWorkspace = (U32*)ZSTD_cwksp_reserve_object(&cdict->workspace, HUF_WORKSPACE_SIZE);
+
+
+    /* Reset the state to no dictionary */
+    ZSTD_reset_compressedBlockState(&cdict->cBlockState);
+    FORWARD_IF_ERROR(ZSTD_reset_matchState(
+        &cdict->matchState,
+        &cdict->workspace,
+        &cParams,
+        ZSTDcrp_makeClean,
+        ZSTDirp_reset,
+        ZSTD_resetTarget_CDict), "");
+    /* (Maybe) load the dictionary
+     * Skips loading the dictionary if it is < 8 bytes.
+     */
+    {   ZSTD_CCtx_params params;
+        memset(&params, 0, sizeof(params));
+        params.compressionLevel = ZSTD_CLEVEL_DEFAULT;
+        params.fParams.contentSizeFlag = 1;
+        params.cParams = cParams;
+        {   size_t const dictID = ZSTD_compress_insertDictionary(
+                    &cdict->cBlockState, &cdict->matchState, NULL, &cdict->workspace,
+                    &params, cdict->dictContent, cdict->dictContentSize,
+                    dictContentType, ZSTD_dtlm_full, cdict->entropyWorkspace);
+            FORWARD_IF_ERROR(dictID, "ZSTD_compress_insertDictionary failed");
+            assert(dictID <= (size_t)(U32)-1);
+            cdict->dictID = (U32)dictID;
+        }
+    }
+
+    return 0;
+}
+
+ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize,
+                                      ZSTD_dictLoadMethod_e dictLoadMethod,
+                                      ZSTD_dictContentType_e dictContentType,
+                                      ZSTD_compressionParameters cParams, ZSTD_customMem customMem)
+{
+    DEBUGLOG(3, "ZSTD_createCDict_advanced, mode %u", (unsigned)dictContentType);
+    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
+
+    {   size_t const workspaceSize =
+            ZSTD_cwksp_alloc_size(sizeof(ZSTD_CDict)) +
+            ZSTD_cwksp_alloc_size(HUF_WORKSPACE_SIZE) +
+            ZSTD_sizeof_matchState(&cParams, /* forCCtx */ 0) +
+            (dictLoadMethod == ZSTD_dlm_byRef ? 0
+             : ZSTD_cwksp_alloc_size(ZSTD_cwksp_align(dictSize, sizeof(void*))));
+        void* const workspace = ZSTD_malloc(workspaceSize, customMem);
+        ZSTD_cwksp ws;
+        ZSTD_CDict* cdict;
+
+        if (!workspace) {
+            ZSTD_free(workspace, customMem);
+            return NULL;
+        }
+
+        ZSTD_cwksp_init(&ws, workspace, workspaceSize);
+
+        cdict = (ZSTD_CDict*)ZSTD_cwksp_reserve_object(&ws, sizeof(ZSTD_CDict));
+        assert(cdict != NULL);
+        ZSTD_cwksp_move(&cdict->workspace, &ws);
+        cdict->customMem = customMem;
+        cdict->compressionLevel = 0; /* signals advanced API usage */
+
+        if (ZSTD_isError( ZSTD_initCDict_internal(cdict,
+                                        dictBuffer, dictSize,
+                                        dictLoadMethod, dictContentType,
+                                        cParams) )) {
+            ZSTD_freeCDict(cdict);
+            return NULL;
+        }
+
+        return cdict;
+    }
+}
+
+ZSTD_CDict* ZSTD_createCDict(const void* dict, size_t dictSize, int compressionLevel)
+{
+    ZSTD_compressionParameters cParams = ZSTD_getCParams_internal(compressionLevel, ZSTD_CONTENTSIZE_UNKNOWN, dictSize);
+    ZSTD_CDict* cdict = ZSTD_createCDict_advanced(dict, dictSize,
+                                                  ZSTD_dlm_byCopy, ZSTD_dct_auto,
+                                                  cParams, ZSTDInternalConstants::ZSTD_defaultCMem);
+    if (cdict)
+        cdict->compressionLevel = compressionLevel == 0 ? ZSTD_CLEVEL_DEFAULT : compressionLevel;
+    return cdict;
+}
+
+ZSTD_CDict* ZSTD_createCDict_byReference(const void* dict, size_t dictSize, int compressionLevel)
+{
+    ZSTD_compressionParameters cParams = ZSTD_getCParams_internal(compressionLevel, ZSTD_CONTENTSIZE_UNKNOWN, dictSize);
+    return ZSTD_createCDict_advanced(dict, dictSize,
+                                     ZSTD_dlm_byRef, ZSTD_dct_auto,
+                                     cParams, ZSTDInternalConstants::ZSTD_defaultCMem);
+}
+
+size_t ZSTD_freeCDict(ZSTD_CDict* cdict)
+{
+    if (cdict==NULL) return 0;   /* support free on NULL */
+    {   ZSTD_customMem const cMem = cdict->customMem;
+        int cdictInWorkspace = ZSTD_cwksp_owns_buffer(&cdict->workspace, cdict);
+        ZSTD_cwksp_free(&cdict->workspace, cMem);
+        if (!cdictInWorkspace) {
+            ZSTD_free(cdict, cMem);
+        }
+        return 0;
+    }
+}
+
+/*! ZSTD_initStaticCDict_advanced() :
+ *  Generate a digested dictionary in provided memory area.
+ *  workspace: The memory area to emplace the dictionary into.
+ *             Provided pointer must 8-bytes aligned.
+ *             It must outlive dictionary usage.
+ *  workspaceSize: Use ZSTD_estimateCDictSize()
+ *                 to determine how large workspace must be.
+ *  cParams : use ZSTD_getCParams() to transform a compression level
+ *            into its relevants cParams.
+ * @return : pointer to ZSTD_CDict*, or NULL if error (size too small)
+ *  Note : there is no corresponding "free" function.
+ *         Since workspace was allocated externally, it must be freed externally.
+ */
+const ZSTD_CDict* ZSTD_initStaticCDict(
+                                 void* workspace, size_t workspaceSize,
+                           const void* dict, size_t dictSize,
+                                 ZSTD_dictLoadMethod_e dictLoadMethod,
+                                 ZSTD_dictContentType_e dictContentType,
+                                 ZSTD_compressionParameters cParams)
+{
+    size_t const matchStateSize = ZSTD_sizeof_matchState(&cParams, /* forCCtx */ 0);
+    size_t const neededSize = ZSTD_cwksp_alloc_size(sizeof(ZSTD_CDict))
+                            + (dictLoadMethod == ZSTD_dlm_byRef ? 0
+                               : ZSTD_cwksp_alloc_size(ZSTD_cwksp_align(dictSize, sizeof(void*))))
+                            + ZSTD_cwksp_alloc_size(HUF_WORKSPACE_SIZE)
+                            + matchStateSize;
+    ZSTD_CDict* cdict;
+
+    if ((size_t)workspace & 7) return NULL;  /* 8-aligned */
+
+    {
+        ZSTD_cwksp ws;
+        ZSTD_cwksp_init(&ws, workspace, workspaceSize);
+        cdict = (ZSTD_CDict*)ZSTD_cwksp_reserve_object(&ws, sizeof(ZSTD_CDict));
+        if (cdict == NULL) return NULL;
+        ZSTD_cwksp_move(&cdict->workspace, &ws);
+    }
+
+    DEBUGLOG(4, "(workspaceSize < neededSize) : (%u < %u) => %u",
+        (unsigned)workspaceSize, (unsigned)neededSize, (unsigned)(workspaceSize < neededSize));
+    if (workspaceSize < neededSize) return NULL;
+
+    if (ZSTD_isError( ZSTD_initCDict_internal(cdict,
+                                              dict, dictSize,
+                                              dictLoadMethod, dictContentType,
+                                              cParams) ))
+        return NULL;
+
+    return cdict;
+}
+
+ZSTD_compressionParameters ZSTD_getCParamsFromCDict(const ZSTD_CDict* cdict)
+{
+    assert(cdict != NULL);
+    return cdict->matchState.cParams;
+}
+
+/* ZSTD_compressBegin_usingCDict_advanced() :
+ * cdict must be != NULL */
+size_t ZSTD_compressBegin_usingCDict_advanced(
+    ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict,
+    ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize)
+{
+    DEBUGLOG(4, "ZSTD_compressBegin_usingCDict_advanced");
+    RETURN_ERROR_IF(cdict==NULL, dictionary_wrong, "NULL pointer!");
+    {   ZSTD_CCtx_params params = cctx->requestedParams;
+        params.cParams = ( pledgedSrcSize < ZSTD_USE_CDICT_PARAMS_SRCSIZE_CUTOFF
+                        || pledgedSrcSize < cdict->dictContentSize * ZSTD_USE_CDICT_PARAMS_DICTSIZE_MULTIPLIER
+                        || pledgedSrcSize == ZSTD_CONTENTSIZE_UNKNOWN
+                        || cdict->compressionLevel == 0 )
+                      && (params.attachDictPref != ZSTD_dictForceLoad) ?
+                ZSTD_getCParamsFromCDict(cdict)
+              : ZSTD_getCParams(cdict->compressionLevel,
+                                pledgedSrcSize,
+                                cdict->dictContentSize);
+        /* Increase window log to fit the entire dictionary and source if the
+         * source size is known. Limit the increase to 19, which is the
+         * window log for compression level 1 with the largest source size.
+         */
+        if (pledgedSrcSize != ZSTD_CONTENTSIZE_UNKNOWN) {
+            U32 const limitedSrcSize = (U32)MIN(pledgedSrcSize, 1U << 19);
+            U32 const limitedSrcLog = limitedSrcSize > 1 ? ZSTD_highbit32(limitedSrcSize - 1) + 1 : 1;
+            params.cParams.windowLog = MAX(params.cParams.windowLog, limitedSrcLog);
+        }
+        params.fParams = fParams;
+        return ZSTD_compressBegin_internal(cctx,
+                                           NULL, 0, ZSTD_dct_auto, ZSTD_dtlm_fast,
+                                           cdict,
+                                           &params, pledgedSrcSize,
+                                           ZSTDb_not_buffered);
+    }
+}
+
+/* ZSTD_compressBegin_usingCDict() :
+ * pledgedSrcSize=0 means "unknown"
+ * if pledgedSrcSize>0, it will enable contentSizeFlag */
+size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict)
+{
+    ZSTD_frameParameters const fParams = { 0 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
+    DEBUGLOG(4, "ZSTD_compressBegin_usingCDict : dictIDFlag == %u", !fParams.noDictIDFlag);
+    return ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, ZSTD_CONTENTSIZE_UNKNOWN);
+}
+
+size_t ZSTD_compress_usingCDict_advanced(ZSTD_CCtx* cctx,
+                                void* dst, size_t dstCapacity,
+                                const void* src, size_t srcSize,
+                                const ZSTD_CDict* cdict, ZSTD_frameParameters fParams)
+{
+    FORWARD_IF_ERROR(ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, srcSize), "");   /* will check if cdict != NULL */
+    return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
+}
+
+/*! ZSTD_compress_usingCDict() :
+ *  Compression using a digested Dictionary.
+ *  Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
+ *  Note that compression parameters are decided at CDict creation time
+ *  while frame parameters are hardcoded */
+size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
+                                void* dst, size_t dstCapacity,
+                                const void* src, size_t srcSize,
+                                const ZSTD_CDict* cdict)
+{
+    ZSTD_frameParameters const fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
+    return ZSTD_compress_usingCDict_advanced(cctx, dst, dstCapacity, src, srcSize, cdict, fParams);
+}
+
+
+
+/* ******************************************************************
+*  Streaming
+********************************************************************/
+
+ZSTD_CStream* ZSTD_createCStream(void)
+{
+    DEBUGLOG(3, "ZSTD_createCStream");
+    return ZSTD_createCStream_advanced(ZSTDInternalConstants::ZSTD_defaultCMem);
+}
+
+ZSTD_CStream* ZSTD_initStaticCStream(void *workspace, size_t workspaceSize)
+{
+    return ZSTD_initStaticCCtx(workspace, workspaceSize);
+}
+
+ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem)
+{   /* CStream and CCtx are now same object */
+    return ZSTD_createCCtx_advanced(customMem);
+}
+
+size_t ZSTD_freeCStream(ZSTD_CStream* zcs)
+{
+    return ZSTD_freeCCtx(zcs);   /* same object */
+}
+
+
+
+/*======   Initialization   ======*/
+
+size_t ZSTD_CStreamInSize(void)  { return ZSTD_BLOCKSIZE_MAX; }
+
+size_t ZSTD_CStreamOutSize(void)
+{
+    return ZSTD_compressBound(ZSTD_BLOCKSIZE_MAX) + ZSTDInternalConstants::ZSTD_blockHeaderSize + 4 /* 32-bits hash */ ;
+}
+
+static size_t ZSTD_resetCStream_internal(ZSTD_CStream* cctx,
+                    const void* const dict, size_t const dictSize, ZSTD_dictContentType_e const dictContentType,
+                    const ZSTD_CDict* const cdict,
+                    ZSTD_CCtx_params params, unsigned long long const pledgedSrcSize)
+{
+    DEBUGLOG(4, "ZSTD_resetCStream_internal");
+    /* Finalize the compression parameters */
+    params.cParams = ZSTD_getCParamsFromCCtxParams(&params, pledgedSrcSize, dictSize);
+    /* params are supposed to be fully validated at this point */
+    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
+    assert(!((dict) && (cdict)));  /* either dict or cdict, not both */
+
+    FORWARD_IF_ERROR( ZSTD_compressBegin_internal(cctx,
+                                         dict, dictSize, dictContentType, ZSTD_dtlm_fast,
+                                         cdict,
+                                         &params, pledgedSrcSize,
+                                         ZSTDb_buffered) , "");
+
+    cctx->inToCompress = 0;
+    cctx->inBuffPos = 0;
+    cctx->inBuffTarget = cctx->blockSize
+                      + (cctx->blockSize == pledgedSrcSize);   /* for small input: avoid automatic flush on reaching end of block, since it would require to add a 3-bytes null block to end frame */
+    cctx->outBuffContentSize = cctx->outBuffFlushedSize = 0;
+    cctx->streamStage = zcss_load;
+    cctx->frameEnded = 0;
+    return 0;   /* ready to go */
+}
+
+/* ZSTD_resetCStream():
+ * pledgedSrcSize == 0 means "unknown" */
+size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pss)
+{
+    /* temporary : 0 interpreted as "unknown" during transition period.
+     * Users willing to specify "unknown" **must** use ZSTD_CONTENTSIZE_UNKNOWN.
+     * 0 will be interpreted as "empty" in the future.
+     */
+    U64 const pledgedSrcSize = (pss==0) ? ZSTD_CONTENTSIZE_UNKNOWN : pss;
+    DEBUGLOG(4, "ZSTD_resetCStream: pledgedSrcSize = %u", (unsigned)pledgedSrcSize);
+    FORWARD_IF_ERROR( ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize) , "");
+    return 0;
+}
+
+/*! ZSTD_initCStream_internal() :
+ *  Note : for lib/compress only. Used by zstdmt_compress.c.
+ *  Assumption 1 : params are valid
+ *  Assumption 2 : either dict, or cdict, is defined, not both */
+size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
+                    const void* dict, size_t dictSize, const ZSTD_CDict* cdict,
+                    const ZSTD_CCtx_params* params,
+                    unsigned long long pledgedSrcSize)
+{
+    DEBUGLOG(4, "ZSTD_initCStream_internal");
+    FORWARD_IF_ERROR( ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize) , "");
+    assert(!ZSTD_isError(ZSTD_checkCParams(params->cParams)));
+    zcs->requestedParams = *params;
+    assert(!((dict) && (cdict)));  /* either dict or cdict, not both */
+    if (dict) {
+        FORWARD_IF_ERROR( ZSTD_CCtx_loadDictionary(zcs, dict, dictSize) , "");
+    } else {
+        /* Dictionary is cleared if !cdict */
+        FORWARD_IF_ERROR( ZSTD_CCtx_refCDict(zcs, cdict) , "");
+    }
+    return 0;
+}
+
+/* ZSTD_initCStream_usingCDict_advanced() :
+ * same as ZSTD_initCStream_usingCDict(), with control over frame parameters */
+size_t ZSTD_initCStream_usingCDict_advanced(ZSTD_CStream* zcs,
+                                            const ZSTD_CDict* cdict,
+                                            ZSTD_frameParameters fParams,
+                                            unsigned long long pledgedSrcSize)
+{
+    DEBUGLOG(4, "ZSTD_initCStream_usingCDict_advanced");
+    FORWARD_IF_ERROR( ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize) , "");
+    zcs->requestedParams.fParams = fParams;
+    FORWARD_IF_ERROR( ZSTD_CCtx_refCDict(zcs, cdict) , "");
+    return 0;
+}
+
+/* note : cdict must outlive compression session */
+size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
+{
+    DEBUGLOG(4, "ZSTD_initCStream_usingCDict");
+    FORWARD_IF_ERROR( ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_refCDict(zcs, cdict) , "");
+    return 0;
+}
+
+
+/* ZSTD_initCStream_advanced() :
+ * pledgedSrcSize must be exact.
+ * if srcSize is not known at init time, use value ZSTD_CONTENTSIZE_UNKNOWN.
+ * dict is loaded with default parameters ZSTD_dct_auto and ZSTD_dlm_byCopy. */
+size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
+                                 const void* dict, size_t dictSize,
+                                 ZSTD_parameters params, unsigned long long pss)
+{
+    /* for compatibility with older programs relying on this behavior.
+     * Users should now specify ZSTD_CONTENTSIZE_UNKNOWN.
+     * This line will be removed in the future.
+     */
+    U64 const pledgedSrcSize = (pss==0 && params.fParams.contentSizeFlag==0) ? ZSTD_CONTENTSIZE_UNKNOWN : pss;
+    DEBUGLOG(4, "ZSTD_initCStream_advanced");
+    FORWARD_IF_ERROR( ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize) , "");
+    FORWARD_IF_ERROR( ZSTD_checkCParams(params.cParams) , "");
+    zcs->requestedParams = ZSTD_assignParamsToCCtxParams(&zcs->requestedParams, &params);
+    FORWARD_IF_ERROR( ZSTD_CCtx_loadDictionary(zcs, dict, dictSize) , "");
+    return 0;
+}
+
+size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel)
+{
+    DEBUGLOG(4, "ZSTD_initCStream_usingDict");
+    FORWARD_IF_ERROR( ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_setParameter(zcs, ZSTD_c_compressionLevel, compressionLevel) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_loadDictionary(zcs, dict, dictSize) , "");
+    return 0;
+}
+
+size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pss)
+{
+    /* temporary : 0 interpreted as "unknown" during transition period.
+     * Users willing to specify "unknown" **must** use ZSTD_CONTENTSIZE_UNKNOWN.
+     * 0 will be interpreted as "empty" in the future.
+     */
+    U64 const pledgedSrcSize = (pss==0) ? ZSTD_CONTENTSIZE_UNKNOWN : pss;
+    DEBUGLOG(4, "ZSTD_initCStream_srcSize");
+    FORWARD_IF_ERROR( ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_refCDict(zcs, NULL) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_setParameter(zcs, ZSTD_c_compressionLevel, compressionLevel) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize) , "");
+    return 0;
+}
+
+size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel)
+{
+    DEBUGLOG(4, "ZSTD_initCStream");
+    FORWARD_IF_ERROR( ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_refCDict(zcs, NULL) , "");
+    FORWARD_IF_ERROR( ZSTD_CCtx_setParameter(zcs, ZSTD_c_compressionLevel, compressionLevel) , "");
+    return 0;
+}
+
+/*======   Compression   ======*/
+
+static size_t ZSTD_nextInputSizeHint(const ZSTD_CCtx* cctx)
+{
+    size_t hintInSize = cctx->inBuffTarget - cctx->inBuffPos;
+    if (hintInSize==0) hintInSize = cctx->blockSize;
+    return hintInSize;
+}
+
+/** ZSTD_compressStream_generic():
+ *  internal function for all *compressStream*() variants
+ *  non-static, because can be called from zstdmt_compress.c
+ * @return : hint size for next input */
+static size_t ZSTD_compressStream_generic(ZSTD_CStream* zcs,
+                                          ZSTD_outBuffer* output,
+                                          ZSTD_inBuffer* input,
+                                          ZSTD_EndDirective const flushMode)
+{
+    const char* const istart = (const char*)input->src;
+    const char* const iend = input->size != 0 ? istart + input->size : istart;
+    const char* ip = input->pos != 0 ? istart + input->pos : istart;
+    char* const ostart = (char*)output->dst;
+    char* const oend = output->size != 0 ? ostart + output->size : ostart;
+    char* op = output->pos != 0 ? ostart + output->pos : ostart;
+    U32 someMoreWork = 1;
+
+    /* check expectations */
+    DEBUGLOG(5, "ZSTD_compressStream_generic, flush=%u", (unsigned)flushMode);
+    assert(zcs->inBuff != NULL);
+    assert(zcs->inBuffSize > 0);
+    assert(zcs->outBuff !=  NULL);
+    assert(zcs->outBuffSize > 0);
+    assert(output->pos <= output->size);
+    assert(input->pos <= input->size);
+
+    while (someMoreWork) {
+        switch(zcs->streamStage)
+        {
+        case zcss_init:
+            RETURN_ERROR(init_missing, "call ZSTD_initCStream() first!");
+
+        case zcss_load:
+            if ( (flushMode == ZSTD_e_end)
+              && ((size_t)(oend-op) >= ZSTD_compressBound(iend-ip))  /* enough dstCapacity */
+              && (zcs->inBuffPos == 0) ) {
+                /* shortcut to compression pass directly into output buffer */
+                size_t const cSize = ZSTD_compressEnd(zcs,
+                                                op, oend-op, ip, iend-ip);
+                DEBUGLOG(4, "ZSTD_compressEnd : cSize=%u", (unsigned)cSize);
+                FORWARD_IF_ERROR(cSize, "ZSTD_compressEnd failed");
+                ip = iend;
+                op += cSize;
+                zcs->frameEnded = 1;
+                ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+                someMoreWork = 0; break;
+            }
+            /* complete loading into inBuffer */
+            {   size_t const toLoad = zcs->inBuffTarget - zcs->inBuffPos;
+                size_t const loaded = ZSTD_limitCopy(
+                                        zcs->inBuff + zcs->inBuffPos, toLoad,
+                                        ip, iend-ip);
+                zcs->inBuffPos += loaded;
+                if (loaded != 0)
+                    ip += loaded;
+                if ( (flushMode == ZSTD_e_continue)
+                  && (zcs->inBuffPos < zcs->inBuffTarget) ) {
+                    /* not enough input to fill full block : stop here */
+                    someMoreWork = 0; break;
+                }
+                if ( (flushMode == ZSTD_e_flush)
+                  && (zcs->inBuffPos == zcs->inToCompress) ) {
+                    /* empty */
+                    someMoreWork = 0; break;
+                }
+            }
+            /* compress current block (note : this stage cannot be stopped in the middle) */
+            DEBUGLOG(5, "stream compression stage (flushMode==%u)", flushMode);
+            {   void* cDst;
+                size_t cSize;
+                size_t const iSize = zcs->inBuffPos - zcs->inToCompress;
+                size_t oSize = oend-op;
+                unsigned const lastBlock = (flushMode == ZSTD_e_end) && (ip==iend);
+                if (oSize >= ZSTD_compressBound(iSize))
+                    cDst = op;   /* compress into output buffer, to skip flush stage */
+                else
+                    cDst = zcs->outBuff, oSize = zcs->outBuffSize;
+                cSize = lastBlock ?
+                        ZSTD_compressEnd(zcs, cDst, oSize,
+                                    zcs->inBuff + zcs->inToCompress, iSize) :
+                        ZSTD_compressContinue(zcs, cDst, oSize,
+                                    zcs->inBuff + zcs->inToCompress, iSize);
+                FORWARD_IF_ERROR(cSize, "%s", lastBlock ? "ZSTD_compressEnd failed" : "ZSTD_compressContinue failed");
+                zcs->frameEnded = lastBlock;
+                /* prepare next block */
+                zcs->inBuffTarget = zcs->inBuffPos + zcs->blockSize;
+                if (zcs->inBuffTarget > zcs->inBuffSize)
+                    zcs->inBuffPos = 0, zcs->inBuffTarget = zcs->blockSize;
+                DEBUGLOG(5, "inBuffTarget:%u / inBuffSize:%u",
+                         (unsigned)zcs->inBuffTarget, (unsigned)zcs->inBuffSize);
+                if (!lastBlock)
+                    assert(zcs->inBuffTarget <= zcs->inBuffSize);
+                zcs->inToCompress = zcs->inBuffPos;
+                if (cDst == op) {  /* no need to flush */
+                    op += cSize;
+                    if (zcs->frameEnded) {
+                        DEBUGLOG(5, "Frame completed directly in outBuffer");
+                        someMoreWork = 0;
+                        ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+                    }
+                    break;
+                }
+                zcs->outBuffContentSize = cSize;
+                zcs->outBuffFlushedSize = 0;
+                zcs->streamStage = zcss_flush; /* pass-through to flush stage */
+            }
+	    /* fall-through */
+        case zcss_flush:
+            DEBUGLOG(5, "flush stage");
+            {   size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
+                size_t const flushed = ZSTD_limitCopy(op, (size_t)(oend-op),
+                            zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
+                DEBUGLOG(5, "toFlush: %u into %u ==> flushed: %u",
+                            (unsigned)toFlush, (unsigned)(oend-op), (unsigned)flushed);
+                if (flushed)
+                    op += flushed;
+                zcs->outBuffFlushedSize += flushed;
+                if (toFlush!=flushed) {
+                    /* flush not fully completed, presumably because dst is too small */
+                    assert(op==oend);
+                    someMoreWork = 0;
+                    break;
+                }
+                zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
+                if (zcs->frameEnded) {
+                    DEBUGLOG(5, "Frame completed on flush");
+                    someMoreWork = 0;
+                    ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+                    break;
+                }
+                zcs->streamStage = zcss_load;
+                break;
+            }
+
+        default: /* impossible */
+            assert(0);
+        }
+    }
+
+    input->pos = ip - istart;
+    output->pos = op - ostart;
+    if (zcs->frameEnded) return 0;
+    return ZSTD_nextInputSizeHint(zcs);
+}
+
+static size_t ZSTD_nextInputSizeHint_MTorST(const ZSTD_CCtx* cctx)
+{
+#ifdef ZSTD_MULTITHREAD
+    if (cctx->appliedParams.nbWorkers >= 1) {
+        assert(cctx->mtctx != NULL);
+        return ZSTDMT_nextInputSizeHint(cctx->mtctx);
+    }
+#endif
+    return ZSTD_nextInputSizeHint(cctx);
+
+}
+
+size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
+{
+    FORWARD_IF_ERROR( ZSTD_compressStream2(zcs, output, input, ZSTD_e_continue) , "");
+    return ZSTD_nextInputSizeHint_MTorST(zcs);
+}
+
+
+size_t ZSTD_compressStream2( ZSTD_CCtx* cctx,
+                             ZSTD_outBuffer* output,
+                             ZSTD_inBuffer* input,
+                             ZSTD_EndDirective endOp)
+{
+    DEBUGLOG(5, "ZSTD_compressStream2, endOp=%u ", (unsigned)endOp);
+    /* check conditions */
+    RETURN_ERROR_IF(output->pos > output->size, GENERIC, "invalid buffer");
+    RETURN_ERROR_IF(input->pos  > input->size, GENERIC, "invalid buffer");
+    assert(cctx!=NULL);
+
+    /* transparent initialization stage */
+    if (cctx->streamStage == zcss_init) {
+        ZSTD_CCtx_params params = cctx->requestedParams;
+        ZSTD_prefixDict const prefixDict = cctx->prefixDict;
+        FORWARD_IF_ERROR( ZSTD_initLocalDict(cctx) , ""); /* Init the local dict if present. */
+        memset(&cctx->prefixDict, 0, sizeof(cctx->prefixDict));   /* single usage */
+        assert(prefixDict.dict==NULL || cctx->cdict==NULL);    /* only one can be set */
+        DEBUGLOG(4, "ZSTD_compressStream2 : transparent init stage");
+        if (endOp == ZSTD_e_end) cctx->pledgedSrcSizePlusOne = input->size + 1;  /* auto-fix pledgedSrcSize */
+        params.cParams = ZSTD_getCParamsFromCCtxParams(
+                &cctx->requestedParams, cctx->pledgedSrcSizePlusOne-1, 0 /*dictSize*/);
+
+
+#ifdef ZSTD_MULTITHREAD
+        if ((cctx->pledgedSrcSizePlusOne-1) <= ZSTDMT_JOBSIZE_MIN) {
+            params.nbWorkers = 0; /* do not invoke multi-threading when src size is too small */
+        }
+        if (params.nbWorkers > 0) {
+            /* mt context creation */
+            if (cctx->mtctx == NULL) {
+                DEBUGLOG(4, "ZSTD_compressStream2: creating new mtctx for nbWorkers=%u",
+                            params.nbWorkers);
+                cctx->mtctx = ZSTDMT_createCCtx_advanced((U32)params.nbWorkers, cctx->customMem);
+                RETURN_ERROR_IF(cctx->mtctx == NULL, memory_allocation, "NULL pointer!");
+            }
+            /* mt compression */
+            DEBUGLOG(4, "call ZSTDMT_initCStream_internal as nbWorkers=%u", params.nbWorkers);
+            FORWARD_IF_ERROR( ZSTDMT_initCStream_internal(
+                        cctx->mtctx,
+                        prefixDict.dict, prefixDict.dictSize, prefixDict.dictContentType,
+                        cctx->cdict, params, cctx->pledgedSrcSizePlusOne-1) , "");
+            cctx->streamStage = zcss_load;
+            cctx->appliedParams.nbWorkers = params.nbWorkers;
+        } else
+#endif
+        {   FORWARD_IF_ERROR( ZSTD_resetCStream_internal(cctx,
+                            prefixDict.dict, prefixDict.dictSize, prefixDict.dictContentType,
+                            cctx->cdict,
+                            params, cctx->pledgedSrcSizePlusOne-1) , "");
+            assert(cctx->streamStage == zcss_load);
+            assert(cctx->appliedParams.nbWorkers == 0);
+    }   }
+    /* end of transparent initialization stage */
+
+    /* compression stage */
+#ifdef ZSTD_MULTITHREAD
+    if (cctx->appliedParams.nbWorkers > 0) {
+        int const forceMaxProgress = (endOp == ZSTD_e_flush || endOp == ZSTD_e_end);
+        size_t flushMin;
+        assert(forceMaxProgress || endOp == ZSTD_e_continue /* Protection for a new flush type */);
+        if (cctx->cParamsChanged) {
+            ZSTDMT_updateCParams_whileCompressing(cctx->mtctx, &cctx->requestedParams);
+            cctx->cParamsChanged = 0;
+        }
+        do {
+            flushMin = ZSTDMT_compressStream_generic(cctx->mtctx, output, input, endOp);
+            if ( ZSTD_isError(flushMin)
+              || (endOp == ZSTD_e_end && flushMin == 0) ) { /* compression completed */
+                ZSTD_CCtx_reset(cctx, ZSTD_reset_session_only);
+            }
+            FORWARD_IF_ERROR(flushMin, "ZSTDMT_compressStream_generic failed");
+        } while (forceMaxProgress && flushMin != 0 && output->pos < output->size);
+        DEBUGLOG(5, "completed ZSTD_compressStream2 delegating to ZSTDMT_compressStream_generic");
+        /* Either we don't require maximum forward progress, we've finished the
+         * flush, or we are out of output space.
+         */
+        assert(!forceMaxProgress || flushMin == 0 || output->pos == output->size);
+        return flushMin;
+    }
+#endif
+    FORWARD_IF_ERROR( ZSTD_compressStream_generic(cctx, output, input, endOp) , "");
+    DEBUGLOG(5, "completed ZSTD_compressStream2");
+    return cctx->outBuffContentSize - cctx->outBuffFlushedSize; /* remaining to flush */
+}
+
+size_t ZSTD_compressStream2_simpleArgs (
+                            ZSTD_CCtx* cctx,
+                            void* dst, size_t dstCapacity, size_t* dstPos,
+                      const void* src, size_t srcSize, size_t* srcPos,
+                            ZSTD_EndDirective endOp)
+{
+    ZSTD_outBuffer output = { dst, dstCapacity, *dstPos };
+    ZSTD_inBuffer  input  = { src, srcSize, *srcPos };
+    /* ZSTD_compressStream2() will check validity of dstPos and srcPos */
+    size_t const cErr = ZSTD_compressStream2(cctx, &output, &input, endOp);
+    *dstPos = output.pos;
+    *srcPos = input.pos;
+    return cErr;
+}
+
+size_t ZSTD_compress2(ZSTD_CCtx* cctx,
+                      void* dst, size_t dstCapacity,
+                      const void* src, size_t srcSize)
+{
+    DEBUGLOG(4, "ZSTD_compress2 (srcSize=%u)", (unsigned)srcSize);
+    ZSTD_CCtx_reset(cctx, ZSTD_reset_session_only);
+    {   size_t oPos = 0;
+        size_t iPos = 0;
+        size_t const result = ZSTD_compressStream2_simpleArgs(cctx,
+                                        dst, dstCapacity, &oPos,
+                                        src, srcSize, &iPos,
+                                        ZSTD_e_end);
+        FORWARD_IF_ERROR(result, "ZSTD_compressStream2_simpleArgs failed");
+        if (result != 0) {  /* compression not completed, due to lack of output space */
+            assert(oPos == dstCapacity);
+            RETURN_ERROR(dstSize_tooSmall, "");
+        }
+        assert(iPos == srcSize);   /* all input is expected consumed */
+        return oPos;
+    }
+}
+
+/*======   Finalize   ======*/
+
+/*! ZSTD_flushStream() :
+ * @return : amount of data remaining to flush */
+size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
+{
+    ZSTD_inBuffer input = { NULL, 0, 0 };
+    return ZSTD_compressStream2(zcs, output, &input, ZSTD_e_flush);
+}
+
+
+size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
+{
+    ZSTD_inBuffer input = { NULL, 0, 0 };
+    size_t const remainingToFlush = ZSTD_compressStream2(zcs, output, &input, ZSTD_e_end);
+    FORWARD_IF_ERROR( remainingToFlush , "ZSTD_compressStream2 failed");
+    if (zcs->appliedParams.nbWorkers > 0) return remainingToFlush;   /* minimal estimation */
+    /* single thread mode : attempt to calculate remaining to flush more precisely */
+    {   size_t const lastBlockSize = zcs->frameEnded ? 0 : ZSTD_BLOCKHEADERSIZE;
+        size_t const checksumSize = (size_t)(zcs->frameEnded ? 0 : zcs->appliedParams.fParams.checksumFlag * 4);
+        size_t const toFlush = remainingToFlush + lastBlockSize + checksumSize;
+        DEBUGLOG(4, "ZSTD_endStream : remaining to flush : %u", (unsigned)toFlush);
+        return toFlush;
+    }
+}
+
+
+/*-=====  Pre-defined compression levels  =====-*/
+
+#define ZSTD_MAX_CLEVEL     22
+int ZSTD_maxCLevel(void) { return ZSTD_MAX_CLEVEL; }
+int ZSTD_minCLevel(void) { return (int)-ZSTD_TARGETLENGTH_MAX; }
+
+static const ZSTD_compressionParameters ZSTD_defaultCParameters[4][ZSTD_MAX_CLEVEL+1] = {
+{   /* "default" - for any srcSize > 256 KB */
+    /* W,  C,  H,  S,  L, TL, strat */
+    { 19, 12, 13,  1,  6,  1, ZSTD_fast    },  /* base for negative levels */
+    { 19, 13, 14,  1,  7,  0, ZSTD_fast    },  /* level  1 */
+    { 20, 15, 16,  1,  6,  0, ZSTD_fast    },  /* level  2 */
+    { 21, 16, 17,  1,  5,  0, ZSTD_dfast   },  /* level  3 */
+    { 21, 18, 18,  1,  5,  0, ZSTD_dfast   },  /* level  4 */
+    { 21, 18, 19,  2,  5,  2, ZSTD_greedy  },  /* level  5 */
+    { 21, 19, 19,  3,  5,  4, ZSTD_greedy  },  /* level  6 */
+    { 21, 19, 19,  3,  5,  8, ZSTD_lazy    },  /* level  7 */
+    { 21, 19, 19,  3,  5, 16, ZSTD_lazy2   },  /* level  8 */
+    { 21, 19, 20,  4,  5, 16, ZSTD_lazy2   },  /* level  9 */
+    { 22, 20, 21,  4,  5, 16, ZSTD_lazy2   },  /* level 10 */
+    { 22, 21, 22,  4,  5, 16, ZSTD_lazy2   },  /* level 11 */
+    { 22, 21, 22,  5,  5, 16, ZSTD_lazy2   },  /* level 12 */
+    { 22, 21, 22,  5,  5, 32, ZSTD_btlazy2 },  /* level 13 */
+    { 22, 22, 23,  5,  5, 32, ZSTD_btlazy2 },  /* level 14 */
+    { 22, 23, 23,  6,  5, 32, ZSTD_btlazy2 },  /* level 15 */
+    { 22, 22, 22,  5,  5, 48, ZSTD_btopt   },  /* level 16 */
+    { 23, 23, 22,  5,  4, 64, ZSTD_btopt   },  /* level 17 */
+    { 23, 23, 22,  6,  3, 64, ZSTD_btultra },  /* level 18 */
+    { 23, 24, 22,  7,  3,256, ZSTD_btultra2},  /* level 19 */
+    { 25, 25, 23,  7,  3,256, ZSTD_btultra2},  /* level 20 */
+    { 26, 26, 24,  7,  3,512, ZSTD_btultra2},  /* level 21 */
+    { 27, 27, 25,  9,  3,999, ZSTD_btultra2},  /* level 22 */
+},
+{   /* for srcSize <= 256 KB */
+    /* W,  C,  H,  S,  L,  T, strat */
+    { 18, 12, 13,  1,  5,  1, ZSTD_fast    },  /* base for negative levels */
+    { 18, 13, 14,  1,  6,  0, ZSTD_fast    },  /* level  1 */
+    { 18, 14, 14,  1,  5,  0, ZSTD_dfast   },  /* level  2 */
+    { 18, 16, 16,  1,  4,  0, ZSTD_dfast   },  /* level  3 */
+    { 18, 16, 17,  2,  5,  2, ZSTD_greedy  },  /* level  4.*/
+    { 18, 18, 18,  3,  5,  2, ZSTD_greedy  },  /* level  5.*/
+    { 18, 18, 19,  3,  5,  4, ZSTD_lazy    },  /* level  6.*/
+    { 18, 18, 19,  4,  4,  4, ZSTD_lazy    },  /* level  7 */
+    { 18, 18, 19,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
+    { 18, 18, 19,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
+    { 18, 18, 19,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
+    { 18, 18, 19,  5,  4, 12, ZSTD_btlazy2 },  /* level 11.*/
+    { 18, 19, 19,  7,  4, 12, ZSTD_btlazy2 },  /* level 12.*/
+    { 18, 18, 19,  4,  4, 16, ZSTD_btopt   },  /* level 13 */
+    { 18, 18, 19,  4,  3, 32, ZSTD_btopt   },  /* level 14.*/
+    { 18, 18, 19,  6,  3,128, ZSTD_btopt   },  /* level 15.*/
+    { 18, 19, 19,  6,  3,128, ZSTD_btultra },  /* level 16.*/
+    { 18, 19, 19,  8,  3,256, ZSTD_btultra },  /* level 17.*/
+    { 18, 19, 19,  6,  3,128, ZSTD_btultra2},  /* level 18.*/
+    { 18, 19, 19,  8,  3,256, ZSTD_btultra2},  /* level 19.*/
+    { 18, 19, 19, 10,  3,512, ZSTD_btultra2},  /* level 20.*/
+    { 18, 19, 19, 12,  3,512, ZSTD_btultra2},  /* level 21.*/
+    { 18, 19, 19, 13,  3,999, ZSTD_btultra2},  /* level 22.*/
+},
+{   /* for srcSize <= 128 KB */
+    /* W,  C,  H,  S,  L,  T, strat */
+    { 17, 12, 12,  1,  5,  1, ZSTD_fast    },  /* base for negative levels */
+    { 17, 12, 13,  1,  6,  0, ZSTD_fast    },  /* level  1 */
+    { 17, 13, 15,  1,  5,  0, ZSTD_fast    },  /* level  2 */
+    { 17, 15, 16,  2,  5,  0, ZSTD_dfast   },  /* level  3 */
+    { 17, 17, 17,  2,  4,  0, ZSTD_dfast   },  /* level  4 */
+    { 17, 16, 17,  3,  4,  2, ZSTD_greedy  },  /* level  5 */
+    { 17, 17, 17,  3,  4,  4, ZSTD_lazy    },  /* level  6 */
+    { 17, 17, 17,  3,  4,  8, ZSTD_lazy2   },  /* level  7 */
+    { 17, 17, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
+    { 17, 17, 17,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
+    { 17, 17, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
+    { 17, 17, 17,  5,  4,  8, ZSTD_btlazy2 },  /* level 11 */
+    { 17, 18, 17,  7,  4, 12, ZSTD_btlazy2 },  /* level 12 */
+    { 17, 18, 17,  3,  4, 12, ZSTD_btopt   },  /* level 13.*/
+    { 17, 18, 17,  4,  3, 32, ZSTD_btopt   },  /* level 14.*/
+    { 17, 18, 17,  6,  3,256, ZSTD_btopt   },  /* level 15.*/
+    { 17, 18, 17,  6,  3,128, ZSTD_btultra },  /* level 16.*/
+    { 17, 18, 17,  8,  3,256, ZSTD_btultra },  /* level 17.*/
+    { 17, 18, 17, 10,  3,512, ZSTD_btultra },  /* level 18.*/
+    { 17, 18, 17,  5,  3,256, ZSTD_btultra2},  /* level 19.*/
+    { 17, 18, 17,  7,  3,512, ZSTD_btultra2},  /* level 20.*/
+    { 17, 18, 17,  9,  3,512, ZSTD_btultra2},  /* level 21.*/
+    { 17, 18, 17, 11,  3,999, ZSTD_btultra2},  /* level 22.*/
+},
+{   /* for srcSize <= 16 KB */
+    /* W,  C,  H,  S,  L,  T, strat */
+    { 14, 12, 13,  1,  5,  1, ZSTD_fast    },  /* base for negative levels */
+    { 14, 14, 15,  1,  5,  0, ZSTD_fast    },  /* level  1 */
+    { 14, 14, 15,  1,  4,  0, ZSTD_fast    },  /* level  2 */
+    { 14, 14, 15,  2,  4,  0, ZSTD_dfast   },  /* level  3 */
+    { 14, 14, 14,  4,  4,  2, ZSTD_greedy  },  /* level  4 */
+    { 14, 14, 14,  3,  4,  4, ZSTD_lazy    },  /* level  5.*/
+    { 14, 14, 14,  4,  4,  8, ZSTD_lazy2   },  /* level  6 */
+    { 14, 14, 14,  6,  4,  8, ZSTD_lazy2   },  /* level  7 */
+    { 14, 14, 14,  8,  4,  8, ZSTD_lazy2   },  /* level  8.*/
+    { 14, 15, 14,  5,  4,  8, ZSTD_btlazy2 },  /* level  9.*/
+    { 14, 15, 14,  9,  4,  8, ZSTD_btlazy2 },  /* level 10.*/
+    { 14, 15, 14,  3,  4, 12, ZSTD_btopt   },  /* level 11.*/
+    { 14, 15, 14,  4,  3, 24, ZSTD_btopt   },  /* level 12.*/
+    { 14, 15, 14,  5,  3, 32, ZSTD_btultra },  /* level 13.*/
+    { 14, 15, 15,  6,  3, 64, ZSTD_btultra },  /* level 14.*/
+    { 14, 15, 15,  7,  3,256, ZSTD_btultra },  /* level 15.*/
+    { 14, 15, 15,  5,  3, 48, ZSTD_btultra2},  /* level 16.*/
+    { 14, 15, 15,  6,  3,128, ZSTD_btultra2},  /* level 17.*/
+    { 14, 15, 15,  7,  3,256, ZSTD_btultra2},  /* level 18.*/
+    { 14, 15, 15,  8,  3,256, ZSTD_btultra2},  /* level 19.*/
+    { 14, 15, 15,  8,  3,512, ZSTD_btultra2},  /* level 20.*/
+    { 14, 15, 15,  9,  3,512, ZSTD_btultra2},  /* level 21.*/
+    { 14, 15, 15, 10,  3,999, ZSTD_btultra2},  /* level 22.*/
+},
+};
+
+/*! ZSTD_getCParams_internal() :
+ * @return ZSTD_compressionParameters structure for a selected compression level, srcSize and dictSize.
+ *  Note: srcSizeHint 0 means 0, use ZSTD_CONTENTSIZE_UNKNOWN for unknown.
+ *        Use dictSize == 0 for unknown or unused. */
+static ZSTD_compressionParameters ZSTD_getCParams_internal(int compressionLevel, unsigned long long srcSizeHint, size_t dictSize)
+{
+    int const unknown = srcSizeHint == ZSTD_CONTENTSIZE_UNKNOWN;
+    size_t const addedSize = unknown && dictSize > 0 ? 500 : 0;
+    U64 const rSize = unknown && dictSize == 0 ? ZSTD_CONTENTSIZE_UNKNOWN : srcSizeHint+dictSize+addedSize;
+    U32 const tableID = (rSize <= 256 KB) + (rSize <= 128 KB) + (rSize <= 16 KB);
+    int row = compressionLevel;
+    DEBUGLOG(5, "ZSTD_getCParams_internal (cLevel=%i)", compressionLevel);
+    if (compressionLevel == 0) row = ZSTD_CLEVEL_DEFAULT;   /* 0 == default */
+    if (compressionLevel < 0) row = 0;   /* entry 0 is baseline for fast mode */
+    if (compressionLevel > ZSTD_MAX_CLEVEL) row = ZSTD_MAX_CLEVEL;
+    {   ZSTD_compressionParameters cp = ZSTD_defaultCParameters[tableID][row];
+        if (compressionLevel < 0) cp.targetLength = (unsigned)(-compressionLevel);   /* acceleration factor */
+        /* refine parameters based on srcSize & dictSize */
+        return ZSTD_adjustCParams_internal(cp, srcSizeHint, dictSize);
+    }
+}
+
+/*! ZSTD_getCParams() :
+ * @return ZSTD_compressionParameters structure for a selected compression level, srcSize and dictSize.
+ *  Size values are optional, provide 0 if not known or unused */
+ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long srcSizeHint, size_t dictSize)
+{
+    if (srcSizeHint == 0) srcSizeHint = ZSTD_CONTENTSIZE_UNKNOWN;
+    return ZSTD_getCParams_internal(compressionLevel, srcSizeHint, dictSize);
+}
+
+/*! ZSTD_getParams() :
+ *  same idea as ZSTD_getCParams()
+ * @return a `ZSTD_parameters` structure (instead of `ZSTD_compressionParameters`).
+ *  Fields of `ZSTD_frameParameters` are set to default values */
+static ZSTD_parameters ZSTD_getParams_internal(int compressionLevel, unsigned long long srcSizeHint, size_t dictSize) {
+    ZSTD_parameters params;
+    ZSTD_compressionParameters const cParams = ZSTD_getCParams_internal(compressionLevel, srcSizeHint, dictSize);
+    DEBUGLOG(5, "ZSTD_getParams (cLevel=%i)", compressionLevel);
+    memset(&params, 0, sizeof(params));
+    params.cParams = cParams;
+    params.fParams.contentSizeFlag = 1;
+    return params;
+}
+
+/*! ZSTD_getParams() :
+ *  same idea as ZSTD_getCParams()
+ * @return a `ZSTD_parameters` structure (instead of `ZSTD_compressionParameters`).
+ *  Fields of `ZSTD_frameParameters` are set to default values */
+ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long srcSizeHint, size_t dictSize) {
+    if (srcSizeHint == 0) srcSizeHint = ZSTD_CONTENTSIZE_UNKNOWN;
+    return ZSTD_getParams_internal(compressionLevel, srcSizeHint, dictSize);
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress_literals.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress_literals.cpp
new file mode 100644
index 0000000000..de4134f15d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress_literals.cpp
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+ /*-*************************************
+ *  Dependencies
+ ***************************************/
+#include "zstd/compress/zstd_compress_literals.h"
+
+namespace lbug_zstd {
+size_t ZSTD_noCompressLiterals (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    BYTE* const ostart = (BYTE* const)dst;
+    U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
+
+    RETURN_ERROR_IF(srcSize + flSize > dstCapacity, dstSize_tooSmall, "");
+
+    switch(flSize)
+    {
+        case 1: /* 2 - 1 - 5 */
+            ostart[0] = (BYTE)((U32)set_basic + (srcSize<<3));
+            break;
+        case 2: /* 2 - 2 - 12 */
+            MEM_writeLE16(ostart, (U16)((U32)set_basic + (1<<2) + (srcSize<<4)));
+            break;
+        case 3: /* 2 - 2 - 20 */
+            MEM_writeLE32(ostart, (U32)((U32)set_basic + (3<<2) + (srcSize<<4)));
+            break;
+        default:   /* not necessary : flSize is {1,2,3} */
+            assert(0);
+    }
+
+    memcpy(ostart + flSize, src, srcSize);
+    DEBUGLOG(5, "Raw literals: %u -> %u", (U32)srcSize, (U32)(srcSize + flSize));
+    return srcSize + flSize;
+}
+
+size_t ZSTD_compressRleLiteralsBlock (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    BYTE* const ostart = (BYTE* const)dst;
+    U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
+
+    (void)dstCapacity;  /* dstCapacity already guaranteed to be >=4, hence large enough */
+
+    switch(flSize)
+    {
+        case 1: /* 2 - 1 - 5 */
+            ostart[0] = (BYTE)((U32)set_rle + (srcSize<<3));
+            break;
+        case 2: /* 2 - 2 - 12 */
+            MEM_writeLE16(ostart, (U16)((U32)set_rle + (1<<2) + (srcSize<<4)));
+            break;
+        case 3: /* 2 - 2 - 20 */
+            MEM_writeLE32(ostart, (U32)((U32)set_rle + (3<<2) + (srcSize<<4)));
+            break;
+        default:   /* not necessary : flSize is {1,2,3} */
+            assert(0);
+    }
+
+    ostart[flSize] = *(const BYTE*)src;
+    DEBUGLOG(5, "RLE literals: %u -> %u", (U32)srcSize, (U32)flSize + 1);
+    return flSize+1;
+}
+
+size_t ZSTD_compressLiterals (ZSTD_hufCTables_t const* prevHuf,
+                              ZSTD_hufCTables_t* nextHuf,
+                              ZSTD_strategy strategy, int disableLiteralCompression,
+                              void* dst, size_t dstCapacity,
+                        const void* src, size_t srcSize,
+                              void* entropyWorkspace, size_t entropyWorkspaceSize,
+                        const int bmi2)
+{
+    size_t const minGain = ZSTD_minGain(srcSize, strategy);
+    size_t const lhSize = 3 + (srcSize >= 1 KB) + (srcSize >= 16 KB);
+    BYTE*  const ostart = (BYTE*)dst;
+    U32 singleStream = srcSize < 256;
+    symbolEncodingType_e hType = set_compressed;
+    size_t cLitSize;
+
+    DEBUGLOG(5,"ZSTD_compressLiterals (disableLiteralCompression=%i srcSize=%u)",
+                disableLiteralCompression, (U32)srcSize);
+
+    /* Prepare nextEntropy assuming reusing the existing table */
+    memcpy(nextHuf, prevHuf, sizeof(*prevHuf));
+
+    if (disableLiteralCompression)
+        return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
+
+    /* small ? don't even attempt compression (speed opt) */
+#   define COMPRESS_LITERALS_SIZE_MIN 63
+    {   size_t const minLitSize = (prevHuf->repeatMode == HUF_repeat_valid) ? 6 : COMPRESS_LITERALS_SIZE_MIN;
+        if (srcSize <= minLitSize) return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
+    }
+
+    RETURN_ERROR_IF(dstCapacity < lhSize+1, dstSize_tooSmall, "not enough space for compression");
+    {   HUF_repeat repeat = prevHuf->repeatMode;
+        int const preferRepeat = strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
+        if (repeat == HUF_repeat_valid && lhSize == 3) singleStream = 1;
+        cLitSize = singleStream ?
+            HUF_compress1X_repeat(
+                ostart+lhSize, dstCapacity-lhSize, src, srcSize,
+                HUF_SYMBOLVALUE_MAX, HUF_TABLELOG_DEFAULT, entropyWorkspace, entropyWorkspaceSize,
+                (HUF_CElt*)nextHuf->CTable, &repeat, preferRepeat, bmi2) :
+            HUF_compress4X_repeat(
+                ostart+lhSize, dstCapacity-lhSize, src, srcSize,
+                HUF_SYMBOLVALUE_MAX, HUF_TABLELOG_DEFAULT, entropyWorkspace, entropyWorkspaceSize,
+                (HUF_CElt*)nextHuf->CTable, &repeat, preferRepeat, bmi2);
+        if (repeat != HUF_repeat_none) {
+            /* reused the existing table */
+            DEBUGLOG(5, "Reusing previous huffman table");
+            hType = set_repeat;
+        }
+    }
+
+    if ((cLitSize==0) | (cLitSize >= srcSize - minGain) | ERR_isError(cLitSize)) {
+        memcpy(nextHuf, prevHuf, sizeof(*prevHuf));
+        return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
+    }
+    if (cLitSize==1) {
+        memcpy(nextHuf, prevHuf, sizeof(*prevHuf));
+        return ZSTD_compressRleLiteralsBlock(dst, dstCapacity, src, srcSize);
+    }
+
+    if (hType == set_compressed) {
+        /* using a newly constructed table */
+        nextHuf->repeatMode = HUF_repeat_check;
+    }
+
+    /* Build header */
+    switch(lhSize)
+    {
+    case 3: /* 2 - 2 - 10 - 10 */
+        {   U32 const lhc = hType + ((!singleStream) << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<14);
+            MEM_writeLE24(ostart, lhc);
+            break;
+        }
+    case 4: /* 2 - 2 - 14 - 14 */
+        {   U32 const lhc = hType + (2 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<18);
+            MEM_writeLE32(ostart, lhc);
+            break;
+        }
+    case 5: /* 2 - 2 - 18 - 18 */
+        {   U32 const lhc = hType + (3 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<22);
+            MEM_writeLE32(ostart, lhc);
+            ostart[4] = (BYTE)(cLitSize >> 10);
+            break;
+        }
+    default:  /* not possible : lhSize is {3,4,5} */
+        assert(0);
+    }
+    DEBUGLOG(5, "Compressed literals: %u -> %u", (U32)srcSize, (U32)(lhSize+cLitSize));
+    return lhSize+cLitSize;
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress_sequences.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress_sequences.cpp
new file mode 100644
index 0000000000..5c0dda5773
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress_sequences.cpp
@@ -0,0 +1,422 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+ /*-*************************************
+ *  Dependencies
+ ***************************************/
+#include "zstd/compress/zstd_compress_sequences.h"
+
+namespace lbug_zstd {
+/**
+ * -log2(x / 256) lookup table for x in [0, 256).
+ * If x == 0: Return 0
+ * Else: Return floor(-log2(x / 256) * 256)
+ */
+static unsigned const kInverseProbabilityLog256[256] = {
+    0,    2048, 1792, 1642, 1536, 1453, 1386, 1329, 1280, 1236, 1197, 1162,
+    1130, 1100, 1073, 1047, 1024, 1001, 980,  960,  941,  923,  906,  889,
+    874,  859,  844,  830,  817,  804,  791,  779,  768,  756,  745,  734,
+    724,  714,  704,  694,  685,  676,  667,  658,  650,  642,  633,  626,
+    618,  610,  603,  595,  588,  581,  574,  567,  561,  554,  548,  542,
+    535,  529,  523,  517,  512,  506,  500,  495,  489,  484,  478,  473,
+    468,  463,  458,  453,  448,  443,  438,  434,  429,  424,  420,  415,
+    411,  407,  402,  398,  394,  390,  386,  382,  377,  373,  370,  366,
+    362,  358,  354,  350,  347,  343,  339,  336,  332,  329,  325,  322,
+    318,  315,  311,  308,  305,  302,  298,  295,  292,  289,  286,  282,
+    279,  276,  273,  270,  267,  264,  261,  258,  256,  253,  250,  247,
+    244,  241,  239,  236,  233,  230,  228,  225,  222,  220,  217,  215,
+    212,  209,  207,  204,  202,  199,  197,  194,  192,  190,  187,  185,
+    182,  180,  178,  175,  173,  171,  168,  166,  164,  162,  159,  157,
+    155,  153,  151,  149,  146,  144,  142,  140,  138,  136,  134,  132,
+    130,  128,  126,  123,  121,  119,  117,  115,  114,  112,  110,  108,
+    106,  104,  102,  100,  98,   96,   94,   93,   91,   89,   87,   85,
+    83,   82,   80,   78,   76,   74,   73,   71,   69,   67,   66,   64,
+    62,   61,   59,   57,   55,   54,   52,   50,   49,   47,   46,   44,
+    42,   41,   39,   37,   36,   34,   33,   31,   30,   28,   26,   25,
+    23,   22,   20,   19,   17,   16,   14,   13,   11,   10,   8,    7,
+    5,    4,    2,    1,
+};
+
+static unsigned ZSTD_getFSEMaxSymbolValue(FSE_CTable const* ctable) {
+  void const* ptr = ctable;
+  U16 const* u16ptr = (U16 const*)ptr;
+  U32 const maxSymbolValue = MEM_read16(u16ptr + 1);
+  return maxSymbolValue;
+}
+
+/**
+ * Returns the cost in bytes of encoding the normalized count header.
+ * Returns an error if any of the helper functions return an error.
+ */
+static size_t ZSTD_NCountCost(unsigned const* count, unsigned const max,
+                              size_t const nbSeq, unsigned const FSELog)
+{
+    BYTE wksp[FSE_NCOUNTBOUND];
+    S16 norm[MaxSeq + 1];
+    const U32 tableLog = FSE_optimalTableLog(FSELog, nbSeq, max);
+    FORWARD_IF_ERROR(FSE_normalizeCount(norm, tableLog, count, nbSeq, max), "");
+    return FSE_writeNCount(wksp, sizeof(wksp), norm, max, tableLog);
+}
+
+/**
+ * Returns the cost in bits of encoding the distribution described by count
+ * using the entropy bound.
+ */
+static size_t ZSTD_entropyCost(unsigned const* count, unsigned const max, size_t const total)
+{
+    unsigned cost = 0;
+    unsigned s;
+    for (s = 0; s <= max; ++s) {
+        unsigned norm = (unsigned)((256 * count[s]) / total);
+        if (count[s] != 0 && norm == 0)
+            norm = 1;
+        assert(count[s] < total);
+        cost += count[s] * kInverseProbabilityLog256[norm];
+    }
+    return cost >> 8;
+}
+
+/**
+ * Returns the cost in bits of encoding the distribution in count using ctable.
+ * Returns an error if ctable cannot represent all the symbols in count.
+ */
+size_t ZSTD_fseBitCost(
+    FSE_CTable const* ctable,
+    unsigned const* count,
+    unsigned const max)
+{
+    unsigned const kAccuracyLog = 8;
+    size_t cost = 0;
+    unsigned s;
+    FSE_CState_t cstate;
+    FSE_initCState(&cstate, ctable);
+    if (ZSTD_getFSEMaxSymbolValue(ctable) < max) {
+        DEBUGLOG(5, "Repeat FSE_CTable has maxSymbolValue %u < %u",
+                    ZSTD_getFSEMaxSymbolValue(ctable), max);
+        return ERROR(GENERIC);
+    }
+    for (s = 0; s <= max; ++s) {
+        unsigned const tableLog = cstate.stateLog;
+        unsigned const badCost = (tableLog + 1) << kAccuracyLog;
+        unsigned const bitCost = FSE_bitCost(cstate.symbolTT, tableLog, s, kAccuracyLog);
+        if (count[s] == 0)
+            continue;
+        if (bitCost >= badCost) {
+            DEBUGLOG(5, "Repeat FSE_CTable has Prob[%u] == 0", s);
+            return ERROR(GENERIC);
+        }
+        cost += (size_t)count[s] * bitCost;
+    }
+    return cost >> kAccuracyLog;
+}
+
+/**
+ * Returns the cost in bits of encoding the distribution in count using the
+ * table described by norm. The max symbol support by norm is assumed >= max.
+ * norm must be valid for every symbol with non-zero probability in count.
+ */
+size_t ZSTD_crossEntropyCost(short const* norm, unsigned accuracyLog,
+                             unsigned const* count, unsigned const max)
+{
+    unsigned const shift = 8 - accuracyLog;
+    size_t cost = 0;
+    unsigned s;
+    assert(accuracyLog <= 8);
+    for (s = 0; s <= max; ++s) {
+        unsigned const normAcc = (norm[s] != -1) ? (unsigned)norm[s] : 1;
+        unsigned const norm256 = normAcc << shift;
+        assert(norm256 > 0);
+        assert(norm256 < 256);
+        cost += count[s] * kInverseProbabilityLog256[norm256];
+    }
+    return cost >> 8;
+}
+
+symbolEncodingType_e
+ZSTD_selectEncodingType(
+        FSE_repeat* repeatMode, unsigned const* count, unsigned const max,
+        size_t const mostFrequent, size_t nbSeq, unsigned const FSELog,
+        FSE_CTable const* prevCTable,
+        short const* defaultNorm, U32 defaultNormLog,
+        ZSTD_defaultPolicy_e const isDefaultAllowed,
+        ZSTD_strategy const strategy)
+{
+    ZSTD_STATIC_ASSERT(ZSTD_defaultDisallowed == 0 && ZSTD_defaultAllowed != 0);
+    if (mostFrequent == nbSeq) {
+        *repeatMode = FSE_repeat_none;
+        if (isDefaultAllowed && nbSeq <= 2) {
+            /* Prefer set_basic over set_rle when there are 2 or less symbols,
+             * since RLE uses 1 byte, but set_basic uses 5-6 bits per symbol.
+             * If basic encoding isn't possible, always choose RLE.
+             */
+            DEBUGLOG(5, "Selected set_basic");
+            return set_basic;
+        }
+        DEBUGLOG(5, "Selected set_rle");
+        return set_rle;
+    }
+    if (strategy < ZSTD_lazy) {
+        if (isDefaultAllowed) {
+            size_t const staticFse_nbSeq_max = 1000;
+            size_t const mult = 10 - strategy;
+            size_t const baseLog = 3;
+            size_t const dynamicFse_nbSeq_min = (((size_t)1 << defaultNormLog) * mult) >> baseLog;  /* 28-36 for offset, 56-72 for lengths */
+            assert(defaultNormLog >= 5 && defaultNormLog <= 6);  /* xx_DEFAULTNORMLOG */
+            assert(mult <= 9 && mult >= 7);
+            if ( (*repeatMode == FSE_repeat_valid)
+              && (nbSeq < staticFse_nbSeq_max) ) {
+                DEBUGLOG(5, "Selected set_repeat");
+                return set_repeat;
+            }
+            if ( (nbSeq < dynamicFse_nbSeq_min)
+              || (mostFrequent < (nbSeq >> (defaultNormLog-1))) ) {
+                DEBUGLOG(5, "Selected set_basic");
+                /* The format allows default tables to be repeated, but it isn't useful.
+                 * When using simple heuristics to select encoding type, we don't want
+                 * to confuse these tables with dictionaries. When running more careful
+                 * analysis, we don't need to waste time checking both repeating tables
+                 * and default tables.
+                 */
+                *repeatMode = FSE_repeat_none;
+                return set_basic;
+            }
+        }
+    } else {
+        size_t const basicCost = isDefaultAllowed ? ZSTD_crossEntropyCost(defaultNorm, defaultNormLog, count, max) : ERROR(GENERIC);
+        size_t const repeatCost = *repeatMode != FSE_repeat_none ? ZSTD_fseBitCost(prevCTable, count, max) : ERROR(GENERIC);
+        size_t const NCountCost = ZSTD_NCountCost(count, max, nbSeq, FSELog);
+        size_t const compressedCost = (NCountCost << 3) + ZSTD_entropyCost(count, max, nbSeq);
+
+        if (isDefaultAllowed) {
+            assert(!ZSTD_isError(basicCost));
+            assert(!(*repeatMode == FSE_repeat_valid && ZSTD_isError(repeatCost)));
+        }
+        assert(!ZSTD_isError(NCountCost));
+        assert(compressedCost < ERROR(maxCode));
+        DEBUGLOG(5, "Estimated bit costs: basic=%u\trepeat=%u\tcompressed=%u",
+                    (unsigned)basicCost, (unsigned)repeatCost, (unsigned)compressedCost);
+        if (basicCost <= repeatCost && basicCost <= compressedCost) {
+            DEBUGLOG(5, "Selected set_basic");
+            assert(isDefaultAllowed);
+            *repeatMode = FSE_repeat_none;
+            return set_basic;
+        }
+        if (repeatCost <= compressedCost) {
+            DEBUGLOG(5, "Selected set_repeat");
+            assert(!ZSTD_isError(repeatCost));
+            return set_repeat;
+        }
+        assert(compressedCost < basicCost && compressedCost < repeatCost);
+    }
+    DEBUGLOG(5, "Selected set_compressed");
+    *repeatMode = FSE_repeat_check;
+    return set_compressed;
+}
+
+size_t
+ZSTD_buildCTable(void* dst, size_t dstCapacity,
+                FSE_CTable* nextCTable, U32 FSELog, symbolEncodingType_e type,
+                unsigned* count, U32 max,
+                const BYTE* codeTable, size_t nbSeq,
+                const S16* defaultNorm, U32 defaultNormLog, U32 defaultMax,
+                const FSE_CTable* prevCTable, size_t prevCTableSize,
+                void* entropyWorkspace, size_t entropyWorkspaceSize)
+{
+    BYTE* op = (BYTE*)dst;
+    const BYTE* const oend = op + dstCapacity;
+    DEBUGLOG(6, "ZSTD_buildCTable (dstCapacity=%u)", (unsigned)dstCapacity);
+
+    switch (type) {
+    case set_rle:
+        FORWARD_IF_ERROR(FSE_buildCTable_rle(nextCTable, (BYTE)max), "");
+        RETURN_ERROR_IF(dstCapacity==0, dstSize_tooSmall, "not enough space");
+        *op = codeTable[0];
+        return 1;
+    case set_repeat:
+        memcpy(nextCTable, prevCTable, prevCTableSize);
+        return 0;
+    case set_basic:
+        FORWARD_IF_ERROR(FSE_buildCTable_wksp(nextCTable, defaultNorm, defaultMax, defaultNormLog, entropyWorkspace, entropyWorkspaceSize), "");  /* note : could be pre-calculated */
+        return 0;
+    case set_compressed: {
+        S16 norm[MaxSeq + 1];
+        size_t nbSeq_1 = nbSeq;
+        const U32 tableLog = FSE_optimalTableLog(FSELog, nbSeq, max);
+        if (count[codeTable[nbSeq-1]] > 1) {
+            count[codeTable[nbSeq-1]]--;
+            nbSeq_1--;
+        }
+        assert(nbSeq_1 > 1);
+        FORWARD_IF_ERROR(FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max), "");
+        {   size_t const NCountSize = FSE_writeNCount(op, oend - op, norm, max, tableLog);   /* overflow protected */
+            FORWARD_IF_ERROR(NCountSize, "FSE_writeNCount failed");
+            FORWARD_IF_ERROR(FSE_buildCTable_wksp(nextCTable, norm, max, tableLog, entropyWorkspace, entropyWorkspaceSize), "");
+            return NCountSize;
+        }
+    }
+    default: assert(0); RETURN_ERROR(GENERIC, "impossible to reach");
+    }
+}
+
+FORCE_INLINE_TEMPLATE size_t
+ZSTD_encodeSequences_body(
+            void* dst, size_t dstCapacity,
+            FSE_CTable const* CTable_MatchLength, BYTE const* mlCodeTable,
+            FSE_CTable const* CTable_OffsetBits, BYTE const* ofCodeTable,
+            FSE_CTable const* CTable_LitLength, BYTE const* llCodeTable,
+            seqDef const* sequences, size_t nbSeq, int longOffsets)
+{
+    BIT_CStream_t blockStream;
+    FSE_CState_t  stateMatchLength;
+    FSE_CState_t  stateOffsetBits;
+    FSE_CState_t  stateLitLength;
+
+    RETURN_ERROR_IF(
+        ERR_isError(BIT_initCStream(&blockStream, dst, dstCapacity)),
+        dstSize_tooSmall, "not enough space remaining");
+    DEBUGLOG(6, "available space for bitstream : %i  (dstCapacity=%u)",
+                (int)(blockStream.endPtr - blockStream.startPtr),
+                (unsigned)dstCapacity);
+
+    /* first symbols */
+    FSE_initCState2(&stateMatchLength, CTable_MatchLength, mlCodeTable[nbSeq-1]);
+    FSE_initCState2(&stateOffsetBits,  CTable_OffsetBits,  ofCodeTable[nbSeq-1]);
+    FSE_initCState2(&stateLitLength,   CTable_LitLength,   llCodeTable[nbSeq-1]);
+    BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, ZSTDInternalConstants::LL_bits[llCodeTable[nbSeq-1]]);
+    if (MEM_32bits()) BIT_flushBits(&blockStream);
+    BIT_addBits(&blockStream, sequences[nbSeq-1].matchLength, ZSTDInternalConstants::ML_bits[mlCodeTable[nbSeq-1]]);
+    if (MEM_32bits()) BIT_flushBits(&blockStream);
+    if (longOffsets) {
+        U32 const ofBits = ofCodeTable[nbSeq-1];
+        unsigned const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
+        if (extraBits) {
+            BIT_addBits(&blockStream, sequences[nbSeq-1].offset, extraBits);
+            BIT_flushBits(&blockStream);
+        }
+        BIT_addBits(&blockStream, sequences[nbSeq-1].offset >> extraBits,
+                    ofBits - extraBits);
+    } else {
+        BIT_addBits(&blockStream, sequences[nbSeq-1].offset, ofCodeTable[nbSeq-1]);
+    }
+    BIT_flushBits(&blockStream);
+
+    {   size_t n;
+        for (n=nbSeq-2 ; n<nbSeq ; n--) {      /* intentional underflow */
+            BYTE const llCode = llCodeTable[n];
+            BYTE const ofCode = ofCodeTable[n];
+            BYTE const mlCode = mlCodeTable[n];
+            U32  const llBits = ZSTDInternalConstants::LL_bits[llCode];
+            U32  const ofBits = ofCode;
+            U32  const mlBits = ZSTDInternalConstants::ML_bits[mlCode];
+            DEBUGLOG(6, "encoding: litlen:%2u - matchlen:%2u - offCode:%7u",
+                        (unsigned)sequences[n].litLength,
+                        (unsigned)sequences[n].matchLength + MINMATCH,
+                        (unsigned)sequences[n].offset);
+                                                                            /* 32b*/  /* 64b*/
+                                                                            /* (7)*/  /* (7)*/
+            FSE_encodeSymbol(&blockStream, &stateOffsetBits, ofCode);       /* 15 */  /* 15 */
+            FSE_encodeSymbol(&blockStream, &stateMatchLength, mlCode);      /* 24 */  /* 24 */
+            if (MEM_32bits()) BIT_flushBits(&blockStream);                  /* (7)*/
+            FSE_encodeSymbol(&blockStream, &stateLitLength, llCode);        /* 16 */  /* 33 */
+            if (MEM_32bits() || (ofBits+mlBits+llBits >= 64-7-(LLFSELog+MLFSELog+OffFSELog)))
+                BIT_flushBits(&blockStream);                                /* (7)*/
+            BIT_addBits(&blockStream, sequences[n].litLength, llBits);
+            if (MEM_32bits() && ((llBits+mlBits)>24)) BIT_flushBits(&blockStream);
+            BIT_addBits(&blockStream, sequences[n].matchLength, mlBits);
+            if (MEM_32bits() || (ofBits+mlBits+llBits > 56)) BIT_flushBits(&blockStream);
+            if (longOffsets) {
+                unsigned const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
+                if (extraBits) {
+                    BIT_addBits(&blockStream, sequences[n].offset, extraBits);
+                    BIT_flushBits(&blockStream);                            /* (7)*/
+                }
+                BIT_addBits(&blockStream, sequences[n].offset >> extraBits,
+                            ofBits - extraBits);                            /* 31 */
+            } else {
+                BIT_addBits(&blockStream, sequences[n].offset, ofBits);     /* 31 */
+            }
+            BIT_flushBits(&blockStream);                                    /* (7)*/
+            DEBUGLOG(7, "remaining space : %i", (int)(blockStream.endPtr - blockStream.ptr));
+    }   }
+
+    DEBUGLOG(6, "ZSTD_encodeSequences: flushing ML state with %u bits", stateMatchLength.stateLog);
+    FSE_flushCState(&blockStream, &stateMatchLength);
+    DEBUGLOG(6, "ZSTD_encodeSequences: flushing Off state with %u bits", stateOffsetBits.stateLog);
+    FSE_flushCState(&blockStream, &stateOffsetBits);
+    DEBUGLOG(6, "ZSTD_encodeSequences: flushing LL state with %u bits", stateLitLength.stateLog);
+    FSE_flushCState(&blockStream, &stateLitLength);
+
+    {   size_t const streamSize = BIT_closeCStream(&blockStream);
+        RETURN_ERROR_IF(streamSize==0, dstSize_tooSmall, "not enough space");
+        return streamSize;
+    }
+}
+
+static size_t
+ZSTD_encodeSequences_default(
+            void* dst, size_t dstCapacity,
+            FSE_CTable const* CTable_MatchLength, BYTE const* mlCodeTable,
+            FSE_CTable const* CTable_OffsetBits, BYTE const* ofCodeTable,
+            FSE_CTable const* CTable_LitLength, BYTE const* llCodeTable,
+            seqDef const* sequences, size_t nbSeq, int longOffsets)
+{
+    return ZSTD_encodeSequences_body(dst, dstCapacity,
+                                    CTable_MatchLength, mlCodeTable,
+                                    CTable_OffsetBits, ofCodeTable,
+                                    CTable_LitLength, llCodeTable,
+                                    sequences, nbSeq, longOffsets);
+}
+
+
+#if DYNAMIC_BMI2
+
+static TARGET_ATTRIBUTE("bmi2") size_t
+ZSTD_encodeSequences_bmi2(
+            void* dst, size_t dstCapacity,
+            FSE_CTable const* CTable_MatchLength, BYTE const* mlCodeTable,
+            FSE_CTable const* CTable_OffsetBits, BYTE const* ofCodeTable,
+            FSE_CTable const* CTable_LitLength, BYTE const* llCodeTable,
+            seqDef const* sequences, size_t nbSeq, int longOffsets)
+{
+    return ZSTD_encodeSequences_body(dst, dstCapacity,
+                                    CTable_MatchLength, mlCodeTable,
+                                    CTable_OffsetBits, ofCodeTable,
+                                    CTable_LitLength, llCodeTable,
+                                    sequences, nbSeq, longOffsets);
+}
+
+#endif
+
+size_t ZSTD_encodeSequences(
+            void* dst, size_t dstCapacity,
+            FSE_CTable const* CTable_MatchLength, BYTE const* mlCodeTable,
+            FSE_CTable const* CTable_OffsetBits, BYTE const* ofCodeTable,
+            FSE_CTable const* CTable_LitLength, BYTE const* llCodeTable,
+            seqDef const* sequences, size_t nbSeq, int longOffsets, int bmi2)
+{
+    DEBUGLOG(5, "ZSTD_encodeSequences: dstCapacity = %u", (unsigned)dstCapacity);
+#if DYNAMIC_BMI2
+    if (bmi2) {
+        return ZSTD_encodeSequences_bmi2(dst, dstCapacity,
+                                         CTable_MatchLength, mlCodeTable,
+                                         CTable_OffsetBits, ofCodeTable,
+                                         CTable_LitLength, llCodeTable,
+                                         sequences, nbSeq, longOffsets);
+    }
+#endif
+    (void)bmi2;
+    return ZSTD_encodeSequences_default(dst, dstCapacity,
+                                        CTable_MatchLength, mlCodeTable,
+                                        CTable_OffsetBits, ofCodeTable,
+                                        CTable_LitLength, llCodeTable,
+                                        sequences, nbSeq, longOffsets);
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress_superblock.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress_superblock.cpp
new file mode 100644
index 0000000000..3682d47072
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_compress_superblock.cpp
@@ -0,0 +1,842 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+ /*-*************************************
+ *  Dependencies
+ ***************************************/
+#include "zstd/compress/zstd_compress_superblock.h"
+
+#include "zstd/common/zstd_internal.h"  /* ZSTD_getSequenceLength */
+#include "zstd/compress/hist.h"                     /* HIST_countFast_wksp */
+#include "zstd/compress/zstd_compress_internal.h"
+#include "zstd/compress/zstd_compress_sequences.h"
+#include "zstd/compress/zstd_compress_literals.h"
+
+namespace lbug_zstd {
+/*-*************************************
+*  Superblock entropy buffer structs
+***************************************/
+/** ZSTD_hufCTablesMetadata_t :
+ *  Stores Literals Block Type for a super-block in hType, and
+ *  huffman tree description in hufDesBuffer.
+ *  hufDesSize refers to the size of huffman tree description in bytes.
+ *  This metadata is populated in ZSTD_buildSuperBlockEntropy_literal() */
+typedef struct {
+    symbolEncodingType_e hType;
+    BYTE hufDesBuffer[500]; /* TODO give name to this value */
+    size_t hufDesSize;
+} ZSTD_hufCTablesMetadata_t;
+
+/** ZSTD_fseCTablesMetadata_t :
+ *  Stores symbol compression modes for a super-block in {ll, ol, ml}Type, and
+ *  fse tables in fseTablesBuffer.
+ *  fseTablesSize refers to the size of fse tables in bytes.
+ *  This metadata is populated in ZSTD_buildSuperBlockEntropy_sequences() */
+typedef struct {
+    symbolEncodingType_e llType;
+    symbolEncodingType_e ofType;
+    symbolEncodingType_e mlType;
+    BYTE fseTablesBuffer[500]; /* TODO give name to this value */
+    size_t fseTablesSize;
+    size_t lastCountSize; /* This is to account for bug in 1.3.4. More detail in ZSTD_compressSubBlock_sequences() */
+} ZSTD_fseCTablesMetadata_t;
+
+typedef struct {
+    ZSTD_hufCTablesMetadata_t hufMetadata;
+    ZSTD_fseCTablesMetadata_t fseMetadata;
+} ZSTD_entropyCTablesMetadata_t;
+
+
+/** ZSTD_buildSuperBlockEntropy_literal() :
+ *  Builds entropy for the super-block literals.
+ *  Stores literals block type (raw, rle, compressed, repeat) and
+ *  huffman description table to hufMetadata.
+ *  @return : size of huffman description table or error code */
+static size_t ZSTD_buildSuperBlockEntropy_literal(void* const src, size_t srcSize,
+                                            const ZSTD_hufCTables_t* prevHuf,
+                                                  ZSTD_hufCTables_t* nextHuf,
+                                                  ZSTD_hufCTablesMetadata_t* hufMetadata,
+                                                  const int disableLiteralsCompression,
+                                                  void* workspace, size_t wkspSize)
+{
+    BYTE* const wkspStart = (BYTE*)workspace;
+    BYTE* const wkspEnd = wkspStart + wkspSize;
+    BYTE* const countWkspStart = wkspStart;
+    unsigned* const countWksp = (unsigned*)workspace;
+    const size_t countWkspSize = (HUF_SYMBOLVALUE_MAX + 1) * sizeof(unsigned);
+    BYTE* const nodeWksp = countWkspStart + countWkspSize;
+    const size_t nodeWkspSize = wkspEnd-nodeWksp;
+    unsigned maxSymbolValue = 255;
+    unsigned huffLog = HUF_TABLELOG_DEFAULT;
+    HUF_repeat repeat = prevHuf->repeatMode;
+
+    DEBUGLOG(5, "ZSTD_buildSuperBlockEntropy_literal (srcSize=%zu)", srcSize);
+
+    /* Prepare nextEntropy assuming reusing the existing table */
+    memcpy(nextHuf, prevHuf, sizeof(*prevHuf));
+
+    if (disableLiteralsCompression) {
+        DEBUGLOG(5, "set_basic - disabled");
+        hufMetadata->hType = set_basic;
+        return 0;
+    }
+
+    /* small ? don't even attempt compression (speed opt) */
+#   define COMPRESS_LITERALS_SIZE_MIN 63
+    {   size_t const minLitSize = (prevHuf->repeatMode == HUF_repeat_valid) ? 6 : COMPRESS_LITERALS_SIZE_MIN;
+        if (srcSize <= minLitSize) {
+            DEBUGLOG(5, "set_basic - too small");
+            hufMetadata->hType = set_basic;
+            return 0;
+        }
+    }
+
+    /* Scan input and build symbol stats */
+    {   size_t const largest = HIST_count_wksp (countWksp, &maxSymbolValue, (const BYTE*)src, srcSize, workspace, wkspSize);
+        FORWARD_IF_ERROR(largest, "HIST_count_wksp failed");
+        if (largest == srcSize) {
+            DEBUGLOG(5, "set_rle");
+            hufMetadata->hType = set_rle;
+            return 0;
+        }
+        if (largest <= (srcSize >> 7)+4) {
+            DEBUGLOG(5, "set_basic - no gain");
+            hufMetadata->hType = set_basic;
+            return 0;
+        }
+    }
+
+    /* Validate the previous Huffman table */
+    if (repeat == HUF_repeat_check && !HUF_validateCTable((HUF_CElt const*)prevHuf->CTable, countWksp, maxSymbolValue)) {
+        repeat = HUF_repeat_none;
+    }
+
+    /* Build Huffman Tree */
+    memset(nextHuf->CTable, 0, sizeof(nextHuf->CTable));
+    huffLog = HUF_optimalTableLog(huffLog, srcSize, maxSymbolValue);
+    {   size_t const maxBits = HUF_buildCTable_wksp((HUF_CElt*)nextHuf->CTable, countWksp,
+                                                    maxSymbolValue, huffLog,
+                                                    nodeWksp, nodeWkspSize);
+        FORWARD_IF_ERROR(maxBits, "HUF_buildCTable_wksp");
+        huffLog = (U32)maxBits;
+        {   /* Build and write the CTable */
+            size_t const newCSize = HUF_estimateCompressedSize(
+                    (HUF_CElt*)nextHuf->CTable, countWksp, maxSymbolValue);
+            size_t const hSize = HUF_writeCTable(
+                    hufMetadata->hufDesBuffer, sizeof(hufMetadata->hufDesBuffer),
+                    (HUF_CElt*)nextHuf->CTable, maxSymbolValue, huffLog);
+            /* Check against repeating the previous CTable */
+            if (repeat != HUF_repeat_none) {
+                size_t const oldCSize = HUF_estimateCompressedSize(
+                        (HUF_CElt const*)prevHuf->CTable, countWksp, maxSymbolValue);
+                if (oldCSize < srcSize && (oldCSize <= hSize + newCSize || hSize + 12 >= srcSize)) {
+                    DEBUGLOG(5, "set_repeat - smaller");
+                    memcpy(nextHuf, prevHuf, sizeof(*prevHuf));
+                    hufMetadata->hType = set_repeat;
+                    return 0;
+                }
+            }
+            if (newCSize + hSize >= srcSize) {
+                DEBUGLOG(5, "set_basic - no gains");
+                memcpy(nextHuf, prevHuf, sizeof(*prevHuf));
+                hufMetadata->hType = set_basic;
+                return 0;
+            }
+            DEBUGLOG(5, "set_compressed (hSize=%u)", (U32)hSize);
+            hufMetadata->hType = set_compressed;
+            nextHuf->repeatMode = HUF_repeat_check;
+            return hSize;
+        }
+    }
+}
+
+/** ZSTD_buildSuperBlockEntropy_sequences() :
+ *  Builds entropy for the super-block sequences.
+ *  Stores symbol compression modes and fse table to fseMetadata.
+ *  @return : size of fse tables or error code */
+static size_t ZSTD_buildSuperBlockEntropy_sequences(seqStore_t* seqStorePtr,
+                                              const ZSTD_fseCTables_t* prevEntropy,
+                                                    ZSTD_fseCTables_t* nextEntropy,
+                                              const ZSTD_CCtx_params* cctxParams,
+                                                    ZSTD_fseCTablesMetadata_t* fseMetadata,
+                                                    void* workspace, size_t wkspSize)
+{
+    BYTE* const wkspStart = (BYTE*)workspace;
+    BYTE* const wkspEnd = wkspStart + wkspSize;
+    BYTE* const countWkspStart = wkspStart;
+    unsigned* const countWksp = (unsigned*)workspace;
+    const size_t countWkspSize = (MaxSeq + 1) * sizeof(unsigned);
+    BYTE* const cTableWksp = countWkspStart + countWkspSize;
+    const size_t cTableWkspSize = wkspEnd-cTableWksp;
+    ZSTD_strategy const strategy = cctxParams->cParams.strategy;
+    FSE_CTable* CTable_LitLength = nextEntropy->litlengthCTable;
+    FSE_CTable* CTable_OffsetBits = nextEntropy->offcodeCTable;
+    FSE_CTable* CTable_MatchLength = nextEntropy->matchlengthCTable;
+    const BYTE* const ofCodeTable = seqStorePtr->ofCode;
+    const BYTE* const llCodeTable = seqStorePtr->llCode;
+    const BYTE* const mlCodeTable = seqStorePtr->mlCode;
+    size_t const nbSeq = seqStorePtr->sequences - seqStorePtr->sequencesStart;
+    BYTE* const ostart = fseMetadata->fseTablesBuffer;
+    BYTE* const oend = ostart + sizeof(fseMetadata->fseTablesBuffer);
+    BYTE* op = ostart;
+
+    assert(cTableWkspSize >= (1 << MaxFSELog) * sizeof(FSE_FUNCTION_TYPE));
+    DEBUGLOG(5, "ZSTD_buildSuperBlockEntropy_sequences (nbSeq=%zu)", nbSeq);
+    memset(workspace, 0, wkspSize);
+
+    fseMetadata->lastCountSize = 0;
+    /* convert length/distances into codes */
+    ZSTD_seqToCodes(seqStorePtr);
+    /* build CTable for Literal Lengths */
+    {   U32 LLtype;
+        unsigned max = MaxLL;
+        size_t const mostFrequent = HIST_countFast_wksp(countWksp, &max, llCodeTable, nbSeq, workspace, wkspSize);  /* can't fail */
+        DEBUGLOG(5, "Building LL table");
+        nextEntropy->litlength_repeatMode = prevEntropy->litlength_repeatMode;
+        LLtype = ZSTD_selectEncodingType(&nextEntropy->litlength_repeatMode,
+                                        countWksp, max, mostFrequent, nbSeq,
+                                        LLFSELog, prevEntropy->litlengthCTable,
+                                        ZSTDInternalConstants::LL_defaultNorm, ZSTDInternalConstants::LL_defaultNormLog,
+                                        ZSTD_defaultAllowed, strategy);
+        assert(set_basic < set_compressed && set_rle < set_compressed);
+        assert(!(LLtype < set_compressed && nextEntropy->litlength_repeatMode != FSE_repeat_none)); /* We don't copy tables */
+        {   size_t const countSize = ZSTD_buildCTable(op, oend - op, CTable_LitLength, LLFSELog, (symbolEncodingType_e)LLtype,
+                                                    countWksp, max, llCodeTable, nbSeq, ZSTDInternalConstants::LL_defaultNorm, ZSTDInternalConstants::LL_defaultNormLog, MaxLL,
+                                                    prevEntropy->litlengthCTable, sizeof(prevEntropy->litlengthCTable),
+                                                    cTableWksp, cTableWkspSize);
+            FORWARD_IF_ERROR(countSize, "ZSTD_buildCTable for LitLens failed");
+            if (LLtype == set_compressed)
+                fseMetadata->lastCountSize = countSize;
+            op += countSize;
+            fseMetadata->llType = (symbolEncodingType_e) LLtype;
+    }   }
+    /* build CTable for Offsets */
+    {   U32 Offtype;
+        unsigned max = MaxOff;
+        size_t const mostFrequent = HIST_countFast_wksp(countWksp, &max, ofCodeTable, nbSeq, workspace, wkspSize);  /* can't fail */
+        /* We can only use the basic table if max <= DefaultMaxOff, otherwise the offsets are too large */
+        ZSTD_defaultPolicy_e const defaultPolicy = (max <= DefaultMaxOff) ? ZSTD_defaultAllowed : ZSTD_defaultDisallowed;
+        DEBUGLOG(5, "Building OF table");
+        nextEntropy->offcode_repeatMode = prevEntropy->offcode_repeatMode;
+        Offtype = ZSTD_selectEncodingType(&nextEntropy->offcode_repeatMode,
+                                        countWksp, max, mostFrequent, nbSeq,
+                                        OffFSELog, prevEntropy->offcodeCTable,
+                                        ZSTDInternalConstants::OF_defaultNorm, ZSTDInternalConstants::OF_defaultNormLog,
+                                        defaultPolicy, strategy);
+        assert(!(Offtype < set_compressed && nextEntropy->offcode_repeatMode != FSE_repeat_none)); /* We don't copy tables */
+        {   size_t const countSize = ZSTD_buildCTable(op, oend - op, CTable_OffsetBits, OffFSELog, (symbolEncodingType_e)Offtype,
+                                                    countWksp, max, ofCodeTable, nbSeq, ZSTDInternalConstants::OF_defaultNorm, ZSTDInternalConstants::OF_defaultNormLog, DefaultMaxOff,
+                                                    prevEntropy->offcodeCTable, sizeof(prevEntropy->offcodeCTable),
+                                                    cTableWksp, cTableWkspSize);
+            FORWARD_IF_ERROR(countSize, "ZSTD_buildCTable for Offsets failed");
+            if (Offtype == set_compressed)
+                fseMetadata->lastCountSize = countSize;
+            op += countSize;
+            fseMetadata->ofType = (symbolEncodingType_e) Offtype;
+    }   }
+    /* build CTable for MatchLengths */
+    {   U32 MLtype;
+        unsigned max = MaxML;
+        size_t const mostFrequent = HIST_countFast_wksp(countWksp, &max, mlCodeTable, nbSeq, workspace, wkspSize);   /* can't fail */
+        DEBUGLOG(5, "Building ML table (remaining space : %i)", (int)(oend-op));
+        nextEntropy->matchlength_repeatMode = prevEntropy->matchlength_repeatMode;
+        MLtype = ZSTD_selectEncodingType(&nextEntropy->matchlength_repeatMode,
+                                        countWksp, max, mostFrequent, nbSeq,
+                                        MLFSELog, prevEntropy->matchlengthCTable,
+                                        ZSTDInternalConstants::ML_defaultNorm, ZSTDInternalConstants::ML_defaultNormLog,
+                                        ZSTD_defaultAllowed, strategy);
+        assert(!(MLtype < set_compressed && nextEntropy->matchlength_repeatMode != FSE_repeat_none)); /* We don't copy tables */
+        {   size_t const countSize = ZSTD_buildCTable(op, oend - op, CTable_MatchLength, MLFSELog, (symbolEncodingType_e)MLtype,
+                                                    countWksp, max, mlCodeTable, nbSeq, ZSTDInternalConstants::ML_defaultNorm, ZSTDInternalConstants::ML_defaultNormLog, MaxML,
+                                                    prevEntropy->matchlengthCTable, sizeof(prevEntropy->matchlengthCTable),
+                                                    cTableWksp, cTableWkspSize);
+            FORWARD_IF_ERROR(countSize, "ZSTD_buildCTable for MatchLengths failed");
+            if (MLtype == set_compressed)
+                fseMetadata->lastCountSize = countSize;
+            op += countSize;
+            fseMetadata->mlType = (symbolEncodingType_e) MLtype;
+    }   }
+    assert((size_t) (op-ostart) <= sizeof(fseMetadata->fseTablesBuffer));
+    return op-ostart;
+}
+
+
+/** ZSTD_buildSuperBlockEntropy() :
+ *  Builds entropy for the super-block.
+ *  @return : 0 on success or error code */
+static size_t
+ZSTD_buildSuperBlockEntropy(seqStore_t* seqStorePtr,
+                      const ZSTD_entropyCTables_t* prevEntropy,
+                            ZSTD_entropyCTables_t* nextEntropy,
+                      const ZSTD_CCtx_params* cctxParams,
+                            ZSTD_entropyCTablesMetadata_t* entropyMetadata,
+                            void* workspace, size_t wkspSize)
+{
+    size_t const litSize = seqStorePtr->lit - seqStorePtr->litStart;
+    DEBUGLOG(5, "ZSTD_buildSuperBlockEntropy");
+    entropyMetadata->hufMetadata.hufDesSize =
+        ZSTD_buildSuperBlockEntropy_literal(seqStorePtr->litStart, litSize,
+                                            &prevEntropy->huf, &nextEntropy->huf,
+                                            &entropyMetadata->hufMetadata,
+                                            ZSTD_disableLiteralsCompression(cctxParams),
+                                            workspace, wkspSize);
+    FORWARD_IF_ERROR(entropyMetadata->hufMetadata.hufDesSize, "ZSTD_buildSuperBlockEntropy_literal failed");
+    entropyMetadata->fseMetadata.fseTablesSize =
+        ZSTD_buildSuperBlockEntropy_sequences(seqStorePtr,
+                                              &prevEntropy->fse, &nextEntropy->fse,
+                                              cctxParams,
+                                              &entropyMetadata->fseMetadata,
+                                              workspace, wkspSize);
+    FORWARD_IF_ERROR(entropyMetadata->fseMetadata.fseTablesSize, "ZSTD_buildSuperBlockEntropy_sequences failed");
+    return 0;
+}
+
+/** ZSTD_compressSubBlock_literal() :
+ *  Compresses literals section for a sub-block.
+ *  When we have to write the Huffman table we will sometimes choose a header
+ *  size larger than necessary. This is because we have to pick the header size
+ *  before we know the table size + compressed size, so we have a bound on the
+ *  table size. If we guessed incorrectly, we fall back to uncompressed literals.
+ *
+ *  We write the header when writeEntropy=1 and set entropyWrriten=1 when we succeeded
+ *  in writing the header, otherwise it is set to 0.
+ *
+ *  hufMetadata->hType has literals block type info.
+ *      If it is set_basic, all sub-blocks literals section will be Raw_Literals_Block.
+ *      If it is set_rle, all sub-blocks literals section will be RLE_Literals_Block.
+ *      If it is set_compressed, first sub-block's literals section will be Compressed_Literals_Block
+ *      If it is set_compressed, first sub-block's literals section will be Treeless_Literals_Block
+ *      and the following sub-blocks' literals sections will be Treeless_Literals_Block.
+ *  @return : compressed size of literals section of a sub-block
+ *            Or 0 if it unable to compress.
+ *            Or error code */
+static size_t ZSTD_compressSubBlock_literal(const HUF_CElt* hufTable,
+                                    const ZSTD_hufCTablesMetadata_t* hufMetadata,
+                                    const BYTE* literals, size_t litSize,
+                                    void* dst, size_t dstSize,
+                                    const int bmi2, int writeEntropy, int* entropyWritten)
+{
+    size_t const header = writeEntropy ? 200 : 0;
+    size_t const lhSize = 3 + (litSize >= (1 KB - header)) + (litSize >= (16 KB - header));
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstSize;
+    BYTE* op = ostart + lhSize;
+    U32 const singleStream = lhSize == 3;
+    symbolEncodingType_e hType = writeEntropy ? hufMetadata->hType : set_repeat;
+    size_t cLitSize = 0;
+
+    (void)bmi2; /* TODO bmi2... */
+
+    DEBUGLOG(5, "ZSTD_compressSubBlock_literal (litSize=%zu, lhSize=%zu, writeEntropy=%d)", litSize, lhSize, writeEntropy);
+
+    *entropyWritten = 0;
+    if (litSize == 0 || hufMetadata->hType == set_basic) {
+      DEBUGLOG(5, "ZSTD_compressSubBlock_literal using raw literal");
+      return ZSTD_noCompressLiterals(dst, dstSize, literals, litSize);
+    } else if (hufMetadata->hType == set_rle) {
+      DEBUGLOG(5, "ZSTD_compressSubBlock_literal using rle literal");
+      return ZSTD_compressRleLiteralsBlock(dst, dstSize, literals, litSize);
+    }
+
+    assert(litSize > 0);
+    assert(hufMetadata->hType == set_compressed || hufMetadata->hType == set_repeat);
+
+    if (writeEntropy && hufMetadata->hType == set_compressed) {
+        memcpy(op, hufMetadata->hufDesBuffer, hufMetadata->hufDesSize);
+        op += hufMetadata->hufDesSize;
+        cLitSize += hufMetadata->hufDesSize;
+        DEBUGLOG(5, "ZSTD_compressSubBlock_literal (hSize=%zu)", hufMetadata->hufDesSize);
+    }
+
+    /* TODO bmi2 */
+    {   const size_t cSize = singleStream ? HUF_compress1X_usingCTable(op, oend-op, literals, litSize, hufTable)
+                                          : HUF_compress4X_usingCTable(op, oend-op, literals, litSize, hufTable);
+        op += cSize;
+        cLitSize += cSize;
+        if (cSize == 0 || ERR_isError(cSize)) {
+            DEBUGLOG(5, "Failed to write entropy tables %s", ZSTD_getErrorName(cSize));
+            return 0;
+        }
+        /* If we expand and we aren't writing a header then emit uncompressed */
+        if (!writeEntropy && cLitSize >= litSize) {
+            DEBUGLOG(5, "ZSTD_compressSubBlock_literal using raw literal because uncompressible");
+            return ZSTD_noCompressLiterals(dst, dstSize, literals, litSize);
+        }
+        /* If we are writing headers then allow expansion that doesn't change our header size. */
+        if (lhSize < (size_t)(3 + (cLitSize >= 1 KB) + (cLitSize >= 16 KB))) {
+            assert(cLitSize > litSize);
+            DEBUGLOG(5, "Literals expanded beyond allowed header size");
+            return ZSTD_noCompressLiterals(dst, dstSize, literals, litSize);
+        }
+        DEBUGLOG(5, "ZSTD_compressSubBlock_literal (cSize=%zu)", cSize);
+    }
+
+    /* Build header */
+    switch(lhSize)
+    {
+    case 3: /* 2 - 2 - 10 - 10 */
+        {   U32 const lhc = hType + ((!singleStream) << 2) + ((U32)litSize<<4) + ((U32)cLitSize<<14);
+            MEM_writeLE24(ostart, lhc);
+            break;
+        }
+    case 4: /* 2 - 2 - 14 - 14 */
+        {   U32 const lhc = hType + (2 << 2) + ((U32)litSize<<4) + ((U32)cLitSize<<18);
+            MEM_writeLE32(ostart, lhc);
+            break;
+        }
+    case 5: /* 2 - 2 - 18 - 18 */
+        {   U32 const lhc = hType + (3 << 2) + ((U32)litSize<<4) + ((U32)cLitSize<<22);
+            MEM_writeLE32(ostart, lhc);
+            ostart[4] = (BYTE)(cLitSize >> 10);
+            break;
+        }
+    default:  /* not possible : lhSize is {3,4,5} */
+        assert(0);
+    }
+    *entropyWritten = 1;
+    DEBUGLOG(5, "Compressed literals: %u -> %u", (U32)litSize, (U32)(op-ostart));
+    return op-ostart;
+}
+
+static size_t ZSTD_seqDecompressedSize(seqStore_t const* seqStore, const seqDef* sequences, size_t nbSeq, size_t litSize, int lastSequence) {
+    const seqDef* const sstart = sequences;
+    const seqDef* const send = sequences + nbSeq;
+    const seqDef* sp = sstart;
+    size_t matchLengthSum = 0;
+    while (send-sp > 0) {
+        ZSTD_sequenceLength const seqLen = ZSTD_getSequenceLength(seqStore, sp);
+        matchLengthSum += seqLen.matchLength;
+        sp++;
+    }
+    return matchLengthSum + litSize;
+}
+
+/** ZSTD_compressSubBlock_sequences() :
+ *  Compresses sequences section for a sub-block.
+ *  fseMetadata->llType, fseMetadata->ofType, and fseMetadata->mlType have
+ *  symbol compression modes for the super-block.
+ *  The first successfully compressed block will have these in its header.
+ *  We set entropyWritten=1 when we succeed in compressing the sequences.
+ *  The following sub-blocks will always have repeat mode.
+ *  @return : compressed size of sequences section of a sub-block
+ *            Or 0 if it is unable to compress
+ *            Or error code. */
+static size_t ZSTD_compressSubBlock_sequences(const ZSTD_fseCTables_t* fseTables,
+                                              const ZSTD_fseCTablesMetadata_t* fseMetadata,
+                                              const seqDef* sequences, size_t nbSeq,
+                                              const BYTE* llCode, const BYTE* mlCode, const BYTE* ofCode,
+                                              const ZSTD_CCtx_params* cctxParams,
+                                              void* dst, size_t dstCapacity,
+                                              const int bmi2, int writeEntropy, int* entropyWritten)
+{
+    const int longOffsets = cctxParams->cParams.windowLog > STREAM_ACCUMULATOR_MIN;
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstCapacity;
+    BYTE* op = ostart;
+    BYTE* seqHead;
+
+    DEBUGLOG(5, "ZSTD_compressSubBlock_sequences (nbSeq=%zu, writeEntropy=%d, longOffsets=%d)", nbSeq, writeEntropy, longOffsets);
+
+    *entropyWritten = 0;
+    /* Sequences Header */
+    RETURN_ERROR_IF((oend-op) < 3 /*max nbSeq Size*/ + 1 /*seqHead*/,
+                    dstSize_tooSmall, "");
+    if (nbSeq < 0x7F)
+        *op++ = (BYTE)nbSeq;
+    else if (nbSeq < LONGNBSEQ)
+        op[0] = (BYTE)((nbSeq>>8) + 0x80), op[1] = (BYTE)nbSeq, op+=2;
+    else
+        op[0]=0xFF, MEM_writeLE16(op+1, (U16)(nbSeq - LONGNBSEQ)), op+=3;
+    if (nbSeq==0) {
+        return op - ostart;
+    }
+
+    /* seqHead : flags for FSE encoding type */
+    seqHead = op++;
+
+    DEBUGLOG(5, "ZSTD_compressSubBlock_sequences (seqHeadSize=%u)", (unsigned)(op-ostart));
+
+    if (writeEntropy) {
+        const U32 LLtype = fseMetadata->llType;
+        const U32 Offtype = fseMetadata->ofType;
+        const U32 MLtype = fseMetadata->mlType;
+        DEBUGLOG(5, "ZSTD_compressSubBlock_sequences (fseTablesSize=%zu)", fseMetadata->fseTablesSize);
+        *seqHead = (BYTE)((LLtype<<6) + (Offtype<<4) + (MLtype<<2));
+        memcpy(op, fseMetadata->fseTablesBuffer, fseMetadata->fseTablesSize);
+        op += fseMetadata->fseTablesSize;
+    } else {
+        const U32 repeat = set_repeat;
+        *seqHead = (BYTE)((repeat<<6) + (repeat<<4) + (repeat<<2));
+    }
+
+    {   size_t const bitstreamSize = ZSTD_encodeSequences(
+                                        op, oend - op,
+                                        fseTables->matchlengthCTable, mlCode,
+                                        fseTables->offcodeCTable, ofCode,
+                                        fseTables->litlengthCTable, llCode,
+                                        sequences, nbSeq,
+                                        longOffsets, bmi2);
+        FORWARD_IF_ERROR(bitstreamSize, "ZSTD_encodeSequences failed");
+        op += bitstreamSize;
+        /* zstd versions <= 1.3.4 mistakenly report corruption when
+         * FSE_readNCount() receives a buffer < 4 bytes.
+         * Fixed by https://github.com/facebook/zstd/pull/1146.
+         * This can happen when the last set_compressed table present is 2
+         * bytes and the bitstream is only one byte.
+         * In this exceedingly rare case, we will simply emit an uncompressed
+         * block, since it isn't worth optimizing.
+         */
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+        if (writeEntropy && fseMetadata->lastCountSize && fseMetadata->lastCountSize + bitstreamSize < 4) {
+            /* NCountSize >= 2 && bitstreamSize > 0 ==> lastCountSize == 3 */
+            assert(fseMetadata->lastCountSize + bitstreamSize == 3);
+            DEBUGLOG(5, "Avoiding bug in zstd decoder in versions <= 1.3.4 by "
+                        "emitting an uncompressed block.");
+            return 0;
+        }
+#endif
+        DEBUGLOG(5, "ZSTD_compressSubBlock_sequences (bitstreamSize=%zu)", bitstreamSize);
+    }
+
+    /* zstd versions <= 1.4.0 mistakenly report error when
+     * sequences section body size is less than 3 bytes.
+     * Fixed by https://github.com/facebook/zstd/pull/1664.
+     * This can happen when the previous sequences section block is compressed
+     * with rle mode and the current block's sequences section is compressed
+     * with repeat mode where sequences section body size can be 1 byte.
+     */
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+    if (op-seqHead < 4) {
+        DEBUGLOG(5, "Avoiding bug in zstd decoder in versions <= 1.4.0 by emitting "
+                    "an uncompressed block when sequences are < 4 bytes");
+        return 0;
+    }
+#endif
+
+    *entropyWritten = 1;
+    return op - ostart;
+}
+
+/** ZSTD_compressSubBlock() :
+ *  Compresses a single sub-block.
+ *  @return : compressed size of the sub-block
+ *            Or 0 if it failed to compress. */
+static size_t ZSTD_compressSubBlock(const ZSTD_entropyCTables_t* entropy,
+                                    const ZSTD_entropyCTablesMetadata_t* entropyMetadata,
+                                    const seqDef* sequences, size_t nbSeq,
+                                    const BYTE* literals, size_t litSize,
+                                    const BYTE* llCode, const BYTE* mlCode, const BYTE* ofCode,
+                                    const ZSTD_CCtx_params* cctxParams,
+                                    void* dst, size_t dstCapacity,
+                                    const int bmi2,
+                                    int writeLitEntropy, int writeSeqEntropy,
+                                    int* litEntropyWritten, int* seqEntropyWritten,
+                                    U32 lastBlock)
+{
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstCapacity;
+    BYTE* op = ostart + ZSTDInternalConstants::ZSTD_blockHeaderSize;
+    DEBUGLOG(5, "ZSTD_compressSubBlock (litSize=%zu, nbSeq=%zu, writeLitEntropy=%d, writeSeqEntropy=%d, lastBlock=%d)",
+                litSize, nbSeq, writeLitEntropy, writeSeqEntropy, lastBlock);
+    {   size_t cLitSize = ZSTD_compressSubBlock_literal((const HUF_CElt*)entropy->huf.CTable,
+                                                        &entropyMetadata->hufMetadata, literals, litSize,
+                                                        op, oend-op, bmi2, writeLitEntropy, litEntropyWritten);
+        FORWARD_IF_ERROR(cLitSize, "ZSTD_compressSubBlock_literal failed");
+        if (cLitSize == 0) return 0;
+        op += cLitSize;
+    }
+    {   size_t cSeqSize = ZSTD_compressSubBlock_sequences(&entropy->fse,
+                                                  &entropyMetadata->fseMetadata,
+                                                  sequences, nbSeq,
+                                                  llCode, mlCode, ofCode,
+                                                  cctxParams,
+                                                  op, oend-op,
+                                                  bmi2, writeSeqEntropy, seqEntropyWritten);
+        FORWARD_IF_ERROR(cSeqSize, "ZSTD_compressSubBlock_sequences failed");
+        if (cSeqSize == 0) return 0;
+        op += cSeqSize;
+    }
+    /* Write block header */
+    {   size_t cSize = (op-ostart)-ZSTDInternalConstants::ZSTD_blockHeaderSize;
+        U32 const cBlockHeader24 = lastBlock + (((U32)bt_compressed)<<1) + (U32)(cSize << 3);
+        MEM_writeLE24(ostart, cBlockHeader24);
+    }
+    return op-ostart;
+}
+
+static size_t ZSTD_estimateSubBlockSize_literal(const BYTE* literals, size_t litSize,
+                                                const ZSTD_hufCTables_t* huf,
+                                                const ZSTD_hufCTablesMetadata_t* hufMetadata,
+                                                void* workspace, size_t wkspSize,
+                                                int writeEntropy)
+{
+    unsigned* const countWksp = (unsigned*)workspace;
+    unsigned maxSymbolValue = 255;
+    size_t literalSectionHeaderSize = 3; /* Use hard coded size of 3 bytes */
+
+    if (hufMetadata->hType == set_basic) return litSize;
+    else if (hufMetadata->hType == set_rle) return 1;
+    else if (hufMetadata->hType == set_compressed || hufMetadata->hType == set_repeat) {
+        size_t const largest = HIST_count_wksp (countWksp, &maxSymbolValue, (const BYTE*)literals, litSize, workspace, wkspSize);
+        if (ZSTD_isError(largest)) return litSize;
+        {   size_t cLitSizeEstimate = HUF_estimateCompressedSize((const HUF_CElt*)huf->CTable, countWksp, maxSymbolValue);
+            if (writeEntropy) cLitSizeEstimate += hufMetadata->hufDesSize;
+            return cLitSizeEstimate + literalSectionHeaderSize;
+    }   }
+    assert(0); /* impossible */
+    return 0;
+}
+
+static size_t ZSTD_estimateSubBlockSize_symbolType(symbolEncodingType_e type,
+                        const BYTE* codeTable, unsigned maxCode,
+                        size_t nbSeq, const FSE_CTable* fseCTable,
+                        const U32* additionalBits,
+                        short const* defaultNorm, U32 defaultNormLog,
+                        void* workspace, size_t wkspSize)
+{
+    unsigned* const countWksp = (unsigned*)workspace;
+    const BYTE* ctp = codeTable;
+    const BYTE* const ctStart = ctp;
+    const BYTE* const ctEnd = ctStart + nbSeq;
+    size_t cSymbolTypeSizeEstimateInBits = 0;
+    unsigned max = maxCode;
+
+    HIST_countFast_wksp(countWksp, &max, codeTable, nbSeq, workspace, wkspSize);  /* can't fail */
+    if (type == set_basic) {
+        cSymbolTypeSizeEstimateInBits = ZSTD_crossEntropyCost(defaultNorm, defaultNormLog, countWksp, max);
+    } else if (type == set_rle) {
+        cSymbolTypeSizeEstimateInBits = 0;
+    } else if (type == set_compressed || type == set_repeat) {
+        cSymbolTypeSizeEstimateInBits = ZSTD_fseBitCost(fseCTable, countWksp, max);
+    }
+    if (ZSTD_isError(cSymbolTypeSizeEstimateInBits)) return nbSeq * 10;
+    while (ctp < ctEnd) {
+        if (additionalBits) cSymbolTypeSizeEstimateInBits += additionalBits[*ctp];
+        else cSymbolTypeSizeEstimateInBits += *ctp; /* for offset, offset code is also the number of additional bits */
+        ctp++;
+    }
+    return cSymbolTypeSizeEstimateInBits / 8;
+}
+
+static size_t ZSTD_estimateSubBlockSize_sequences(const BYTE* ofCodeTable,
+                                                  const BYTE* llCodeTable,
+                                                  const BYTE* mlCodeTable,
+                                                  size_t nbSeq,
+                                                  const ZSTD_fseCTables_t* fseTables,
+                                                  const ZSTD_fseCTablesMetadata_t* fseMetadata,
+                                                  void* workspace, size_t wkspSize,
+                                                  int writeEntropy)
+{
+    size_t sequencesSectionHeaderSize = 3; /* Use hard coded size of 3 bytes */
+    size_t cSeqSizeEstimate = 0;
+    cSeqSizeEstimate += ZSTD_estimateSubBlockSize_symbolType(fseMetadata->ofType, ofCodeTable, MaxOff,
+                                         nbSeq, fseTables->offcodeCTable, NULL,
+                                         ZSTDInternalConstants::OF_defaultNorm, ZSTDInternalConstants::OF_defaultNormLog,
+                                         workspace, wkspSize);
+    cSeqSizeEstimate += ZSTD_estimateSubBlockSize_symbolType(fseMetadata->llType, llCodeTable, MaxLL,
+                                         nbSeq, fseTables->litlengthCTable, ZSTDInternalConstants::LL_bits,
+                                         ZSTDInternalConstants::LL_defaultNorm, ZSTDInternalConstants::LL_defaultNormLog,
+                                         workspace, wkspSize);
+    cSeqSizeEstimate += ZSTD_estimateSubBlockSize_symbolType(fseMetadata->mlType, mlCodeTable, MaxML,
+                                         nbSeq, fseTables->matchlengthCTable, ZSTDInternalConstants::ML_bits,
+                                         ZSTDInternalConstants::ML_defaultNorm, ZSTDInternalConstants::ML_defaultNormLog,
+                                         workspace, wkspSize);
+    if (writeEntropy) cSeqSizeEstimate += fseMetadata->fseTablesSize;
+    return cSeqSizeEstimate + sequencesSectionHeaderSize;
+}
+
+static size_t ZSTD_estimateSubBlockSize(const BYTE* literals, size_t litSize,
+                                        const BYTE* ofCodeTable,
+                                        const BYTE* llCodeTable,
+                                        const BYTE* mlCodeTable,
+                                        size_t nbSeq,
+                                        const ZSTD_entropyCTables_t* entropy,
+                                        const ZSTD_entropyCTablesMetadata_t* entropyMetadata,
+                                        void* workspace, size_t wkspSize,
+                                        int writeLitEntropy, int writeSeqEntropy) {
+    size_t cSizeEstimate = 0;
+    cSizeEstimate += ZSTD_estimateSubBlockSize_literal(literals, litSize,
+                                                         &entropy->huf, &entropyMetadata->hufMetadata,
+                                                         workspace, wkspSize, writeLitEntropy);
+    cSizeEstimate += ZSTD_estimateSubBlockSize_sequences(ofCodeTable, llCodeTable, mlCodeTable,
+                                                         nbSeq, &entropy->fse, &entropyMetadata->fseMetadata,
+                                                         workspace, wkspSize, writeSeqEntropy);
+    return cSizeEstimate + ZSTDInternalConstants::ZSTD_blockHeaderSize;
+}
+
+static int ZSTD_needSequenceEntropyTables(ZSTD_fseCTablesMetadata_t const* fseMetadata)
+{
+    if (fseMetadata->llType == set_compressed || fseMetadata->llType == set_rle)
+        return 1;
+    if (fseMetadata->mlType == set_compressed || fseMetadata->mlType == set_rle)
+        return 1;
+    if (fseMetadata->ofType == set_compressed || fseMetadata->ofType == set_rle)
+        return 1;
+    return 0;
+}
+
+/** ZSTD_compressSubBlock_multi() :
+ *  Breaks super-block into multiple sub-blocks and compresses them.
+ *  Entropy will be written to the first block.
+ *  The following blocks will use repeat mode to compress.
+ *  All sub-blocks are compressed blocks (no raw or rle blocks).
+ *  @return : compressed size of the super block (which is multiple ZSTD blocks)
+ *            Or 0 if it failed to compress. */
+static size_t ZSTD_compressSubBlock_multi(const seqStore_t* seqStorePtr,
+                            const ZSTD_compressedBlockState_t* prevCBlock,
+                            ZSTD_compressedBlockState_t* nextCBlock,
+                            const ZSTD_entropyCTablesMetadata_t* entropyMetadata,
+                            const ZSTD_CCtx_params* cctxParams,
+                                  void* dst, size_t dstCapacity,
+                            const void* src, size_t srcSize,
+                            const int bmi2, U32 lastBlock,
+                            void* workspace, size_t wkspSize)
+{
+    const seqDef* const sstart = seqStorePtr->sequencesStart;
+    const seqDef* const send = seqStorePtr->sequences;
+    const seqDef* sp = sstart;
+    const BYTE* const lstart = seqStorePtr->litStart;
+    const BYTE* const lend = seqStorePtr->lit;
+    const BYTE* lp = lstart;
+    BYTE const* ip = (BYTE const*)src;
+    BYTE const* const iend = ip + srcSize;
+    BYTE* const ostart = (BYTE*)dst;
+    BYTE* const oend = ostart + dstCapacity;
+    BYTE* op = ostart;
+    const BYTE* llCodePtr = seqStorePtr->llCode;
+    const BYTE* mlCodePtr = seqStorePtr->mlCode;
+    const BYTE* ofCodePtr = seqStorePtr->ofCode;
+    size_t targetCBlockSize = cctxParams->targetCBlockSize;
+    size_t litSize, seqCount;
+    int writeLitEntropy = entropyMetadata->hufMetadata.hType == set_compressed;
+    int writeSeqEntropy = 1;
+    int lastSequence = 0;
+
+    DEBUGLOG(5, "ZSTD_compressSubBlock_multi (litSize=%u, nbSeq=%u)",
+                (unsigned)(lend-lp), (unsigned)(send-sstart));
+
+    litSize = 0;
+    seqCount = 0;
+    do {
+        size_t cBlockSizeEstimate = 0;
+        if (sstart == send) {
+            lastSequence = 1;
+        } else {
+            const seqDef* const sequence = sp + seqCount;
+            lastSequence = sequence == send - 1;
+            litSize += ZSTD_getSequenceLength(seqStorePtr, sequence).litLength;
+            seqCount++;
+        }
+        if (lastSequence) {
+            assert(lp <= lend);
+            assert(litSize <= (size_t)(lend - lp));
+            litSize = (size_t)(lend - lp);
+        }
+        /* I think there is an optimization opportunity here.
+         * Calling ZSTD_estimateSubBlockSize for every sequence can be wasteful
+         * since it recalculates estimate from scratch.
+         * For example, it would recount literal distribution and symbol codes everytime.
+         */
+        cBlockSizeEstimate = ZSTD_estimateSubBlockSize(lp, litSize, ofCodePtr, llCodePtr, mlCodePtr, seqCount,
+                                                       &nextCBlock->entropy, entropyMetadata,
+                                                       workspace, wkspSize, writeLitEntropy, writeSeqEntropy);
+        if (cBlockSizeEstimate > targetCBlockSize || lastSequence) {
+            int litEntropyWritten = 0;
+            int seqEntropyWritten = 0;
+            const size_t decompressedSize = ZSTD_seqDecompressedSize(seqStorePtr, sp, seqCount, litSize, lastSequence);
+            const size_t cSize = ZSTD_compressSubBlock(&nextCBlock->entropy, entropyMetadata,
+                                                       sp, seqCount,
+                                                       lp, litSize,
+                                                       llCodePtr, mlCodePtr, ofCodePtr,
+                                                       cctxParams,
+                                                       op, oend-op,
+                                                       bmi2, writeLitEntropy, writeSeqEntropy,
+                                                       &litEntropyWritten, &seqEntropyWritten,
+                                                       lastBlock && lastSequence);
+            FORWARD_IF_ERROR(cSize, "ZSTD_compressSubBlock failed");
+            if (cSize > 0 && cSize < decompressedSize) {
+                DEBUGLOG(5, "Committed the sub-block");
+                assert(ip + decompressedSize <= iend);
+                ip += decompressedSize;
+                sp += seqCount;
+                lp += litSize;
+                op += cSize;
+                llCodePtr += seqCount;
+                mlCodePtr += seqCount;
+                ofCodePtr += seqCount;
+                litSize = 0;
+                seqCount = 0;
+                /* Entropy only needs to be written once */
+                if (litEntropyWritten) {
+                    writeLitEntropy = 0;
+                }
+                if (seqEntropyWritten) {
+                    writeSeqEntropy = 0;
+                }
+            }
+        }
+    } while (!lastSequence);
+    if (writeLitEntropy) {
+        DEBUGLOG(5, "ZSTD_compressSubBlock_multi has literal entropy tables unwritten");
+        memcpy(&nextCBlock->entropy.huf, &prevCBlock->entropy.huf, sizeof(prevCBlock->entropy.huf));
+    }
+    if (writeSeqEntropy && ZSTD_needSequenceEntropyTables(&entropyMetadata->fseMetadata)) {
+        /* If we haven't written our entropy tables, then we've violated our contract and
+         * must emit an uncompressed block.
+         */
+        DEBUGLOG(5, "ZSTD_compressSubBlock_multi has sequence entropy tables unwritten");
+        return 0;
+    }
+    if (ip < iend) {
+        size_t const cSize = ZSTD_noCompressBlock(op, oend - op, ip, iend - ip, lastBlock);
+        DEBUGLOG(5, "ZSTD_compressSubBlock_multi last sub-block uncompressed, %zu bytes", (size_t)(iend - ip));
+        FORWARD_IF_ERROR(cSize, "ZSTD_noCompressBlock failed");
+        assert(cSize != 0);
+        op += cSize;
+        /* We have to regenerate the repcodes because we've skipped some sequences */
+        if (sp < send) {
+            seqDef const* seq;
+            repcodes_t rep;
+            memcpy(&rep, prevCBlock->rep, sizeof(rep));
+            for (seq = sstart; seq < sp; ++seq) {
+                rep = ZSTD_updateRep(rep.rep, seq->offset - 1, ZSTD_getSequenceLength(seqStorePtr, seq).litLength == 0);
+            }
+            memcpy(nextCBlock->rep, &rep, sizeof(rep));
+        }
+    }
+    DEBUGLOG(5, "ZSTD_compressSubBlock_multi compressed");
+    return op-ostart;
+}
+
+size_t ZSTD_compressSuperBlock(ZSTD_CCtx* zc,
+                               void* dst, size_t dstCapacity,
+                               void const* src, size_t srcSize,
+                               unsigned lastBlock) {
+    ZSTD_entropyCTablesMetadata_t entropyMetadata;
+
+    FORWARD_IF_ERROR(ZSTD_buildSuperBlockEntropy(&zc->seqStore,
+          &zc->blockState.prevCBlock->entropy,
+          &zc->blockState.nextCBlock->entropy,
+          &zc->appliedParams,
+          &entropyMetadata,
+          zc->entropyWorkspace, HUF_WORKSPACE_SIZE /* statically allocated in resetCCtx */), "");
+
+    return ZSTD_compressSubBlock_multi(&zc->seqStore,
+            zc->blockState.prevCBlock,
+            zc->blockState.nextCBlock,
+            &entropyMetadata,
+            &zc->appliedParams,
+            dst, dstCapacity,
+            src, srcSize,
+            zc->bmi2, lastBlock,
+            zc->entropyWorkspace, HUF_WORKSPACE_SIZE /* statically allocated in resetCCtx */);
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_double_fast.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_double_fast.cpp
new file mode 100644
index 0000000000..4eccf74e8c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_double_fast.cpp
@@ -0,0 +1,524 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#include "zstd/compress/zstd_compress_internal.h"
+#include "zstd/compress/zstd_double_fast.h"
+
+namespace lbug_zstd {
+
+void ZSTD_fillDoubleHashTable(ZSTD_matchState_t* ms,
+                              void const* end, ZSTD_dictTableLoadMethod_e dtlm)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32* const hashLarge = ms->hashTable;
+    U32  const hBitsL = cParams->hashLog;
+    U32  const mls = cParams->minMatch;
+    U32* const hashSmall = ms->chainTable;
+    U32  const hBitsS = cParams->chainLog;
+    const BYTE* const base = ms->window.base;
+    const BYTE* ip = base + ms->nextToUpdate;
+    const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
+    const U32 fastHashFillStep = 3;
+
+    /* Always insert every fastHashFillStep position into the hash tables.
+     * Insert the other positions into the large hash table if their entry
+     * is empty.
+     */
+    for (; ip + fastHashFillStep - 1 <= iend; ip += fastHashFillStep) {
+        U32 const current = (U32)(ip - base);
+        U32 i;
+        for (i = 0; i < fastHashFillStep; ++i) {
+            size_t const smHash = ZSTD_hashPtr(ip + i, hBitsS, mls);
+            size_t const lgHash = ZSTD_hashPtr(ip + i, hBitsL, 8);
+            if (i == 0)
+                hashSmall[smHash] = current + i;
+            if (i == 0 || hashLarge[lgHash] == 0)
+                hashLarge[lgHash] = current + i;
+            /* Only load extra positions for ZSTD_dtlm_full */
+            if (dtlm == ZSTD_dtlm_fast)
+                break;
+    }   }
+}
+
+
+FORCE_INLINE_TEMPLATE
+size_t ZSTD_compressBlock_doubleFast_generic(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize,
+        U32 const mls /* template */, ZSTD_dictMode_e const dictMode)
+{
+    ZSTD_compressionParameters const* cParams = &ms->cParams;
+    U32* const hashLong = ms->hashTable;
+    const U32 hBitsL = cParams->hashLog;
+    U32* const hashSmall = ms->chainTable;
+    const U32 hBitsS = cParams->chainLog;
+    const BYTE* const base = ms->window.base;
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const U32 endIndex = (U32)((size_t)(istart - base) + srcSize);
+    /* presumes that, if there is a dictionary, it must be using Attach mode */
+    const U32 prefixLowestIndex = ZSTD_getLowestPrefixIndex(ms, endIndex, cParams->windowLog);
+    const BYTE* const prefixLowest = base + prefixLowestIndex;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - HASH_READ_SIZE;
+    U32 offset_1=rep[0], offset_2=rep[1];
+    U32 offsetSaved = 0;
+
+    const ZSTD_matchState_t* const dms = ms->dictMatchState;
+    const ZSTD_compressionParameters* const dictCParams =
+                                     dictMode == ZSTD_dictMatchState ?
+                                     &dms->cParams : NULL;
+    const U32* const dictHashLong  = dictMode == ZSTD_dictMatchState ?
+                                     dms->hashTable : NULL;
+    const U32* const dictHashSmall = dictMode == ZSTD_dictMatchState ?
+                                     dms->chainTable : NULL;
+    const U32 dictStartIndex       = dictMode == ZSTD_dictMatchState ?
+                                     dms->window.dictLimit : 0;
+    const BYTE* const dictBase     = dictMode == ZSTD_dictMatchState ?
+                                     dms->window.base : NULL;
+    const BYTE* const dictStart    = dictMode == ZSTD_dictMatchState ?
+                                     dictBase + dictStartIndex : NULL;
+    const BYTE* const dictEnd      = dictMode == ZSTD_dictMatchState ?
+                                     dms->window.nextSrc : NULL;
+    const U32 dictIndexDelta       = dictMode == ZSTD_dictMatchState ?
+                                     prefixLowestIndex - (U32)(dictEnd - dictBase) :
+                                     0;
+    const U32 dictHBitsL           = dictMode == ZSTD_dictMatchState ?
+                                     dictCParams->hashLog : hBitsL;
+    const U32 dictHBitsS           = dictMode == ZSTD_dictMatchState ?
+                                     dictCParams->chainLog : hBitsS;
+    const U32 dictAndPrefixLength  = (U32)((ip - prefixLowest) + (dictEnd - dictStart));
+
+    DEBUGLOG(5, "ZSTD_compressBlock_doubleFast_generic");
+
+    assert(dictMode == ZSTD_noDict || dictMode == ZSTD_dictMatchState);
+
+    /* if a dictionary is attached, it must be within window range */
+    if (dictMode == ZSTD_dictMatchState) {
+        assert(ms->window.dictLimit + (1U << cParams->windowLog) >= endIndex);
+    }
+
+    /* init */
+    ip += (dictAndPrefixLength == 0);
+    if (dictMode == ZSTD_noDict) {
+        U32 const current = (U32)(ip - base);
+        U32 const windowLow = ZSTD_getLowestPrefixIndex(ms, current, cParams->windowLog);
+        U32 const maxRep = current - windowLow;
+        if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
+        if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
+    }
+    if (dictMode == ZSTD_dictMatchState) {
+        /* dictMatchState repCode checks don't currently handle repCode == 0
+         * disabling. */
+        assert(offset_1 <= dictAndPrefixLength);
+        assert(offset_2 <= dictAndPrefixLength);
+    }
+
+    /* Main Search Loop */
+    while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
+        size_t mLength;
+        U32 offset;
+        size_t const h2 = ZSTD_hashPtr(ip, hBitsL, 8);
+        size_t const h = ZSTD_hashPtr(ip, hBitsS, mls);
+        size_t const dictHL = ZSTD_hashPtr(ip, dictHBitsL, 8);
+        size_t const dictHS = ZSTD_hashPtr(ip, dictHBitsS, mls);
+        U32 const current = (U32)(ip-base);
+        U32 const matchIndexL = hashLong[h2];
+        U32 matchIndexS = hashSmall[h];
+        const BYTE* matchLong = base + matchIndexL;
+        const BYTE* match = base + matchIndexS;
+        const U32 repIndex = current + 1 - offset_1;
+        const BYTE* repMatch = (dictMode == ZSTD_dictMatchState
+                            && repIndex < prefixLowestIndex) ?
+                               dictBase + (repIndex - dictIndexDelta) :
+                               base + repIndex;
+        hashLong[h2] = hashSmall[h] = current;   /* update hash tables */
+
+        /* check dictMatchState repcode */
+        if (dictMode == ZSTD_dictMatchState
+            && ((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
+            && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
+            const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
+            mLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, prefixLowest) + 4;
+            ip++;
+            ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, 0, mLength-MINMATCH);
+            goto _match_stored;
+        }
+
+        /* check noDict repcode */
+        if ( dictMode == ZSTD_noDict
+          && ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1)))) {
+            mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
+            ip++;
+            ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, 0, mLength-MINMATCH);
+            goto _match_stored;
+        }
+
+        if (matchIndexL > prefixLowestIndex) {
+            /* check prefix long match */
+            if (MEM_read64(matchLong) == MEM_read64(ip)) {
+                mLength = ZSTD_count(ip+8, matchLong+8, iend) + 8;
+                offset = (U32)(ip-matchLong);
+                while (((ip>anchor) & (matchLong>prefixLowest)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; } /* catch up */
+                goto _match_found;
+            }
+        } else if (dictMode == ZSTD_dictMatchState) {
+            /* check dictMatchState long match */
+            U32 const dictMatchIndexL = dictHashLong[dictHL];
+            const BYTE* dictMatchL = dictBase + dictMatchIndexL;
+            assert(dictMatchL < dictEnd);
+
+            if (dictMatchL > dictStart && MEM_read64(dictMatchL) == MEM_read64(ip)) {
+                mLength = ZSTD_count_2segments(ip+8, dictMatchL+8, iend, dictEnd, prefixLowest) + 8;
+                offset = (U32)(current - dictMatchIndexL - dictIndexDelta);
+                while (((ip>anchor) & (dictMatchL>dictStart)) && (ip[-1] == dictMatchL[-1])) { ip--; dictMatchL--; mLength++; } /* catch up */
+                goto _match_found;
+        }   }
+
+        if (matchIndexS > prefixLowestIndex) {
+            /* check prefix short match */
+            if (MEM_read32(match) == MEM_read32(ip)) {
+                goto _search_next_long;
+            }
+        } else if (dictMode == ZSTD_dictMatchState) {
+            /* check dictMatchState short match */
+            U32 const dictMatchIndexS = dictHashSmall[dictHS];
+            match = dictBase + dictMatchIndexS;
+            matchIndexS = dictMatchIndexS + dictIndexDelta;
+
+            if (match > dictStart && MEM_read32(match) == MEM_read32(ip)) {
+                goto _search_next_long;
+        }   }
+
+        ip += ((ip-anchor) >> kSearchStrength) + 1;
+#if defined(__aarch64__)
+        PREFETCH_L1(ip+256);
+#endif
+        continue;
+
+_search_next_long:
+
+        {   size_t const hl3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
+            size_t const dictHLNext = ZSTD_hashPtr(ip+1, dictHBitsL, 8);
+            U32 const matchIndexL3 = hashLong[hl3];
+            const BYTE* matchL3 = base + matchIndexL3;
+            hashLong[hl3] = current + 1;
+
+            /* check prefix long +1 match */
+            if (matchIndexL3 > prefixLowestIndex) {
+                if (MEM_read64(matchL3) == MEM_read64(ip+1)) {
+                    mLength = ZSTD_count(ip+9, matchL3+8, iend) + 8;
+                    ip++;
+                    offset = (U32)(ip-matchL3);
+                    while (((ip>anchor) & (matchL3>prefixLowest)) && (ip[-1] == matchL3[-1])) { ip--; matchL3--; mLength++; } /* catch up */
+                    goto _match_found;
+                }
+            } else if (dictMode == ZSTD_dictMatchState) {
+                /* check dict long +1 match */
+                U32 const dictMatchIndexL3 = dictHashLong[dictHLNext];
+                const BYTE* dictMatchL3 = dictBase + dictMatchIndexL3;
+                assert(dictMatchL3 < dictEnd);
+                if (dictMatchL3 > dictStart && MEM_read64(dictMatchL3) == MEM_read64(ip+1)) {
+                    mLength = ZSTD_count_2segments(ip+1+8, dictMatchL3+8, iend, dictEnd, prefixLowest) + 8;
+                    ip++;
+                    offset = (U32)(current + 1 - dictMatchIndexL3 - dictIndexDelta);
+                    while (((ip>anchor) & (dictMatchL3>dictStart)) && (ip[-1] == dictMatchL3[-1])) { ip--; dictMatchL3--; mLength++; } /* catch up */
+                    goto _match_found;
+        }   }   }
+
+        /* if no long +1 match, explore the short match we found */
+        if (dictMode == ZSTD_dictMatchState && matchIndexS < prefixLowestIndex) {
+            mLength = ZSTD_count_2segments(ip+4, match+4, iend, dictEnd, prefixLowest) + 4;
+            offset = (U32)(current - matchIndexS);
+            while (((ip>anchor) & (match>dictStart)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
+        } else {
+            mLength = ZSTD_count(ip+4, match+4, iend) + 4;
+            offset = (U32)(ip - match);
+            while (((ip>anchor) & (match>prefixLowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
+        }
+
+        /* fall-through */
+
+_match_found:
+        offset_2 = offset_1;
+        offset_1 = offset;
+
+        ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+
+_match_stored:
+        /* match found */
+        ip += mLength;
+        anchor = ip;
+
+        if (ip <= ilimit) {
+            /* Complementary insertion */
+            /* done after iLimit test, as candidates could be > iend-8 */
+            {   U32 const indexToInsert = current+2;
+                hashLong[ZSTD_hashPtr(base+indexToInsert, hBitsL, 8)] = indexToInsert;
+                hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] = (U32)(ip-2-base);
+                hashSmall[ZSTD_hashPtr(base+indexToInsert, hBitsS, mls)] = indexToInsert;
+                hashSmall[ZSTD_hashPtr(ip-1, hBitsS, mls)] = (U32)(ip-1-base);
+            }
+
+            /* check immediate repcode */
+            if (dictMode == ZSTD_dictMatchState) {
+                while (ip <= ilimit) {
+                    U32 const current2 = (U32)(ip-base);
+                    U32 const repIndex2 = current2 - offset_2;
+                    const BYTE* repMatch2 = dictMode == ZSTD_dictMatchState
+                        && repIndex2 < prefixLowestIndex ?
+                            dictBase + repIndex2 - dictIndexDelta :
+                            base + repIndex2;
+                    if ( ((U32)((prefixLowestIndex-1) - (U32)repIndex2) >= 3 /* intentional overflow */)
+                       && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
+                        const BYTE* const repEnd2 = repIndex2 < prefixLowestIndex ? dictEnd : iend;
+                        size_t const repLength2 = ZSTD_count_2segments(ip+4, repMatch2+4, iend, repEnd2, prefixLowest) + 4;
+                        U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
+                        ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, repLength2-MINMATCH);
+                        hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = current2;
+                        hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = current2;
+                        ip += repLength2;
+                        anchor = ip;
+                        continue;
+                    }
+                    break;
+            }   }
+
+            if (dictMode == ZSTD_noDict) {
+                while ( (ip <= ilimit)
+                     && ( (offset_2>0)
+                        & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
+                    /* store sequence */
+                    size_t const rLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
+                    U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff;  /* swap offset_2 <=> offset_1 */
+                    hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip-base);
+                    hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip-base);
+                    ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, rLength-MINMATCH);
+                    ip += rLength;
+                    anchor = ip;
+                    continue;   /* faster when present ... (?) */
+        }   }   }
+    }   /* while (ip < ilimit) */
+
+    /* save reps for next block */
+    rep[0] = offset_1 ? offset_1 : offsetSaved;
+    rep[1] = offset_2 ? offset_2 : offsetSaved;
+
+    /* Return the last literals size */
+    return (size_t)(iend - anchor);
+}
+
+
+size_t ZSTD_compressBlock_doubleFast(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    const U32 mls = ms->cParams.minMatch;
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        return ZSTD_compressBlock_doubleFast_generic(ms, seqStore, rep, src, srcSize, 4, ZSTD_noDict);
+    case 5 :
+        return ZSTD_compressBlock_doubleFast_generic(ms, seqStore, rep, src, srcSize, 5, ZSTD_noDict);
+    case 6 :
+        return ZSTD_compressBlock_doubleFast_generic(ms, seqStore, rep, src, srcSize, 6, ZSTD_noDict);
+    case 7 :
+        return ZSTD_compressBlock_doubleFast_generic(ms, seqStore, rep, src, srcSize, 7, ZSTD_noDict);
+    }
+}
+
+
+size_t ZSTD_compressBlock_doubleFast_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    const U32 mls = ms->cParams.minMatch;
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        return ZSTD_compressBlock_doubleFast_generic(ms, seqStore, rep, src, srcSize, 4, ZSTD_dictMatchState);
+    case 5 :
+        return ZSTD_compressBlock_doubleFast_generic(ms, seqStore, rep, src, srcSize, 5, ZSTD_dictMatchState);
+    case 6 :
+        return ZSTD_compressBlock_doubleFast_generic(ms, seqStore, rep, src, srcSize, 6, ZSTD_dictMatchState);
+    case 7 :
+        return ZSTD_compressBlock_doubleFast_generic(ms, seqStore, rep, src, srcSize, 7, ZSTD_dictMatchState);
+    }
+}
+
+
+static size_t ZSTD_compressBlock_doubleFast_extDict_generic(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize,
+        U32 const mls /* template */)
+{
+    ZSTD_compressionParameters const* cParams = &ms->cParams;
+    U32* const hashLong = ms->hashTable;
+    U32  const hBitsL = cParams->hashLog;
+    U32* const hashSmall = ms->chainTable;
+    U32  const hBitsS = cParams->chainLog;
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    const BYTE* const base = ms->window.base;
+    const U32   endIndex = (U32)((size_t)(istart - base) + srcSize);
+    const U32   lowLimit = ZSTD_getLowestMatchIndex(ms, endIndex, cParams->windowLog);
+    const U32   dictStartIndex = lowLimit;
+    const U32   dictLimit = ms->window.dictLimit;
+    const U32   prefixStartIndex = (dictLimit > lowLimit) ? dictLimit : lowLimit;
+    const BYTE* const prefixStart = base + prefixStartIndex;
+    const BYTE* const dictBase = ms->window.dictBase;
+    const BYTE* const dictStart = dictBase + dictStartIndex;
+    const BYTE* const dictEnd = dictBase + prefixStartIndex;
+    U32 offset_1=rep[0], offset_2=rep[1];
+
+    DEBUGLOG(5, "ZSTD_compressBlock_doubleFast_extDict_generic (srcSize=%zu)", srcSize);
+
+    /* if extDict is invalidated due to maxDistance, switch to "regular" variant */
+    if (prefixStartIndex == dictStartIndex)
+        return ZSTD_compressBlock_doubleFast_generic(ms, seqStore, rep, src, srcSize, mls, ZSTD_noDict);
+
+    /* Search Loop */
+    while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
+        const size_t hSmall = ZSTD_hashPtr(ip, hBitsS, mls);
+        const U32 matchIndex = hashSmall[hSmall];
+        const BYTE* const matchBase = matchIndex < prefixStartIndex ? dictBase : base;
+        const BYTE* match = matchBase + matchIndex;
+
+        const size_t hLong = ZSTD_hashPtr(ip, hBitsL, 8);
+        const U32 matchLongIndex = hashLong[hLong];
+        const BYTE* const matchLongBase = matchLongIndex < prefixStartIndex ? dictBase : base;
+        const BYTE* matchLong = matchLongBase + matchLongIndex;
+
+        const U32 current = (U32)(ip-base);
+        const U32 repIndex = current + 1 - offset_1;   /* offset_1 expected <= current +1 */
+        const BYTE* const repBase = repIndex < prefixStartIndex ? dictBase : base;
+        const BYTE* const repMatch = repBase + repIndex;
+        size_t mLength;
+        hashSmall[hSmall] = hashLong[hLong] = current;   /* update hash table */
+
+        if ((((U32)((prefixStartIndex-1) - repIndex) >= 3) /* intentional underflow : ensure repIndex doesn't overlap dict + prefix */
+            & (repIndex > dictStartIndex))
+          && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
+            const BYTE* repMatchEnd = repIndex < prefixStartIndex ? dictEnd : iend;
+            mLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, prefixStart) + 4;
+            ip++;
+            ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, 0, mLength-MINMATCH);
+        } else {
+            if ((matchLongIndex > dictStartIndex) && (MEM_read64(matchLong) == MEM_read64(ip))) {
+                const BYTE* const matchEnd = matchLongIndex < prefixStartIndex ? dictEnd : iend;
+                const BYTE* const lowMatchPtr = matchLongIndex < prefixStartIndex ? dictStart : prefixStart;
+                U32 offset;
+                mLength = ZSTD_count_2segments(ip+8, matchLong+8, iend, matchEnd, prefixStart) + 8;
+                offset = current - matchLongIndex;
+                while (((ip>anchor) & (matchLong>lowMatchPtr)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; }   /* catch up */
+                offset_2 = offset_1;
+                offset_1 = offset;
+                ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+
+            } else if ((matchIndex > dictStartIndex) && (MEM_read32(match) == MEM_read32(ip))) {
+                size_t const h3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
+                U32 const matchIndex3 = hashLong[h3];
+                const BYTE* const match3Base = matchIndex3 < prefixStartIndex ? dictBase : base;
+                const BYTE* match3 = match3Base + matchIndex3;
+                U32 offset;
+                hashLong[h3] = current + 1;
+                if ( (matchIndex3 > dictStartIndex) && (MEM_read64(match3) == MEM_read64(ip+1)) ) {
+                    const BYTE* const matchEnd = matchIndex3 < prefixStartIndex ? dictEnd : iend;
+                    const BYTE* const lowMatchPtr = matchIndex3 < prefixStartIndex ? dictStart : prefixStart;
+                    mLength = ZSTD_count_2segments(ip+9, match3+8, iend, matchEnd, prefixStart) + 8;
+                    ip++;
+                    offset = current+1 - matchIndex3;
+                    while (((ip>anchor) & (match3>lowMatchPtr)) && (ip[-1] == match3[-1])) { ip--; match3--; mLength++; } /* catch up */
+                } else {
+                    const BYTE* const matchEnd = matchIndex < prefixStartIndex ? dictEnd : iend;
+                    const BYTE* const lowMatchPtr = matchIndex < prefixStartIndex ? dictStart : prefixStart;
+                    mLength = ZSTD_count_2segments(ip+4, match+4, iend, matchEnd, prefixStart) + 4;
+                    offset = current - matchIndex;
+                    while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
+                }
+                offset_2 = offset_1;
+                offset_1 = offset;
+                ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+
+            } else {
+                ip += ((ip-anchor) >> kSearchStrength) + 1;
+                continue;
+        }   }
+
+        /* move to next sequence start */
+        ip += mLength;
+        anchor = ip;
+
+        if (ip <= ilimit) {
+            /* Complementary insertion */
+            /* done after iLimit test, as candidates could be > iend-8 */
+            {   U32 const indexToInsert = current+2;
+                hashLong[ZSTD_hashPtr(base+indexToInsert, hBitsL, 8)] = indexToInsert;
+                hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] = (U32)(ip-2-base);
+                hashSmall[ZSTD_hashPtr(base+indexToInsert, hBitsS, mls)] = indexToInsert;
+                hashSmall[ZSTD_hashPtr(ip-1, hBitsS, mls)] = (U32)(ip-1-base);
+            }
+
+            /* check immediate repcode */
+            while (ip <= ilimit) {
+                U32 const current2 = (U32)(ip-base);
+                U32 const repIndex2 = current2 - offset_2;
+                const BYTE* repMatch2 = repIndex2 < prefixStartIndex ? dictBase + repIndex2 : base + repIndex2;
+                if ( (((U32)((prefixStartIndex-1) - repIndex2) >= 3)   /* intentional overflow : ensure repIndex2 doesn't overlap dict + prefix */
+                    & (repIndex2 > dictStartIndex))
+                  && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
+                    const BYTE* const repEnd2 = repIndex2 < prefixStartIndex ? dictEnd : iend;
+                    size_t const repLength2 = ZSTD_count_2segments(ip+4, repMatch2+4, iend, repEnd2, prefixStart) + 4;
+                    U32 const tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
+                    ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, repLength2-MINMATCH);
+                    hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = current2;
+                    hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = current2;
+                    ip += repLength2;
+                    anchor = ip;
+                    continue;
+                }
+                break;
+    }   }   }
+
+    /* save reps for next block */
+    rep[0] = offset_1;
+    rep[1] = offset_2;
+
+    /* Return the last literals size */
+    return (size_t)(iend - anchor);
+}
+
+
+size_t ZSTD_compressBlock_doubleFast_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    U32 const mls = ms->cParams.minMatch;
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        return ZSTD_compressBlock_doubleFast_extDict_generic(ms, seqStore, rep, src, srcSize, 4);
+    case 5 :
+        return ZSTD_compressBlock_doubleFast_extDict_generic(ms, seqStore, rep, src, srcSize, 5);
+    case 6 :
+        return ZSTD_compressBlock_doubleFast_extDict_generic(ms, seqStore, rep, src, srcSize, 6);
+    case 7 :
+        return ZSTD_compressBlock_doubleFast_extDict_generic(ms, seqStore, rep, src, srcSize, 7);
+    }
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_fast.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_fast.cpp
new file mode 100644
index 0000000000..5b1169f3ee
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_fast.cpp
@@ -0,0 +1,499 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#include "zstd/compress/zstd_compress_internal.h"  /* ZSTD_hashPtr, ZSTD_count, ZSTD_storeSeq */
+#include "zstd/compress/zstd_fast.h"
+
+namespace lbug_zstd {
+
+void ZSTD_fillHashTable(ZSTD_matchState_t* ms,
+                        const void* const end,
+                        ZSTD_dictTableLoadMethod_e dtlm)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32* const hashTable = ms->hashTable;
+    U32  const hBits = cParams->hashLog;
+    U32  const mls = cParams->minMatch;
+    const BYTE* const base = ms->window.base;
+    const BYTE* ip = base + ms->nextToUpdate;
+    const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
+    const U32 fastHashFillStep = 3;
+
+    /* Always insert every fastHashFillStep position into the hash table.
+     * Insert the other positions if their hash entry is empty.
+     */
+    for ( ; ip + fastHashFillStep < iend + 2; ip += fastHashFillStep) {
+        U32 const current = (U32)(ip - base);
+        size_t const hash0 = ZSTD_hashPtr(ip, hBits, mls);
+        hashTable[hash0] = current;
+        if (dtlm == ZSTD_dtlm_fast) continue;
+        /* Only load extra positions for ZSTD_dtlm_full */
+        {   U32 p;
+            for (p = 1; p < fastHashFillStep; ++p) {
+                size_t const hash = ZSTD_hashPtr(ip + p, hBits, mls);
+                if (hashTable[hash] == 0) {  /* not yet filled */
+                    hashTable[hash] = current + p;
+    }   }   }   }
+}
+
+
+FORCE_INLINE_TEMPLATE size_t
+ZSTD_compressBlock_fast_generic(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize,
+        U32 const mls)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32* const hashTable = ms->hashTable;
+    U32 const hlog = cParams->hashLog;
+    /* support stepSize of 0 */
+    size_t const stepSize = cParams->targetLength + !(cParams->targetLength) + 1;
+    const BYTE* const base = ms->window.base;
+    const BYTE* const istart = (const BYTE*)src;
+    /* We check ip0 (ip + 0) and ip1 (ip + 1) each loop */
+    const BYTE* ip0 = istart;
+    const BYTE* ip1;
+    const BYTE* anchor = istart;
+    const U32   endIndex = (U32)((size_t)(istart - base) + srcSize);
+    const U32   prefixStartIndex = ZSTD_getLowestPrefixIndex(ms, endIndex, cParams->windowLog);
+    const BYTE* const prefixStart = base + prefixStartIndex;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - HASH_READ_SIZE;
+    U32 offset_1=rep[0], offset_2=rep[1];
+    U32 offsetSaved = 0;
+
+    /* init */
+    DEBUGLOG(5, "ZSTD_compressBlock_fast_generic");
+    ip0 += (ip0 == prefixStart);
+    ip1 = ip0 + 1;
+    {   U32 const current = (U32)(ip0 - base);
+        U32 const windowLow = ZSTD_getLowestPrefixIndex(ms, current, cParams->windowLog);
+        U32 const maxRep = current - windowLow;
+        if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
+        if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
+    }
+
+    /* Main Search Loop */
+#ifdef __INTEL_COMPILER
+    /* From intel 'The vector pragma indicates that the loop should be
+     * vectorized if it is legal to do so'. Can be used together with
+     * #pragma ivdep (but have opted to exclude that because intel
+     * warns against using it).*/
+    #pragma vector always
+#endif
+    while (ip1 < ilimit) {   /* < instead of <=, because check at ip0+2 */
+        size_t mLength;
+        BYTE const* ip2 = ip0 + 2;
+        size_t const h0 = ZSTD_hashPtr(ip0, hlog, mls);
+        U32 const val0 = MEM_read32(ip0);
+        size_t const h1 = ZSTD_hashPtr(ip1, hlog, mls);
+        U32 const val1 = MEM_read32(ip1);
+        U32 const current0 = (U32)(ip0-base);
+        U32 const current1 = (U32)(ip1-base);
+        U32 const matchIndex0 = hashTable[h0];
+        U32 const matchIndex1 = hashTable[h1];
+        BYTE const* repMatch = ip2 - offset_1;
+        const BYTE* match0 = base + matchIndex0;
+        const BYTE* match1 = base + matchIndex1;
+        U32 offcode;
+
+#if defined(__aarch64__)
+        PREFETCH_L1(ip0+256);
+#endif
+
+        hashTable[h0] = current0;   /* update hash table */
+        hashTable[h1] = current1;   /* update hash table */
+
+        assert(ip0 + 1 == ip1);
+
+        if ((offset_1 > 0) & (MEM_read32(repMatch) == MEM_read32(ip2))) {
+            mLength = (ip2[-1] == repMatch[-1]) ? 1 : 0;
+            ip0 = ip2 - mLength;
+            match0 = repMatch - mLength;
+            mLength += 4;
+            offcode = 0;
+            goto _match;
+        }
+        if ((matchIndex0 > prefixStartIndex) && MEM_read32(match0) == val0) {
+            /* found a regular match */
+            goto _offset;
+        }
+        if ((matchIndex1 > prefixStartIndex) && MEM_read32(match1) == val1) {
+            /* found a regular match after one literal */
+            ip0 = ip1;
+            match0 = match1;
+            goto _offset;
+        }
+        {   size_t const step = ((size_t)(ip0-anchor) >> (kSearchStrength - 1)) + stepSize;
+            assert(step >= 2);
+            ip0 += step;
+            ip1 += step;
+            continue;
+        }
+_offset: /* Requires: ip0, match0 */
+        /* Compute the offset code */
+        offset_2 = offset_1;
+        offset_1 = (U32)(ip0-match0);
+        offcode = offset_1 + ZSTD_REP_MOVE;
+        mLength = 4;
+        /* Count the backwards match length */
+        while (((ip0>anchor) & (match0>prefixStart))
+             && (ip0[-1] == match0[-1])) { ip0--; match0--; mLength++; } /* catch up */
+
+_match: /* Requires: ip0, match0, offcode */
+        /* Count the forward length */
+        mLength += ZSTD_count(ip0+mLength, match0+mLength, iend);
+        ZSTD_storeSeq(seqStore, (size_t)(ip0-anchor), anchor, iend, offcode, mLength-MINMATCH);
+        /* match found */
+        ip0 += mLength;
+        anchor = ip0;
+
+        if (ip0 <= ilimit) {
+            /* Fill Table */
+            assert(base+current0+2 > istart);  /* check base overflow */
+            hashTable[ZSTD_hashPtr(base+current0+2, hlog, mls)] = current0+2;  /* here because current+2 could be > iend-8 */
+            hashTable[ZSTD_hashPtr(ip0-2, hlog, mls)] = (U32)(ip0-2-base);
+
+            if (offset_2 > 0) { /* offset_2==0 means offset_2 is invalidated */
+                while ( (ip0 <= ilimit) && (MEM_read32(ip0) == MEM_read32(ip0 - offset_2)) ) {
+                    /* store sequence */
+                    size_t const rLength = ZSTD_count(ip0+4, ip0+4-offset_2, iend) + 4;
+                    { U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff; } /* swap offset_2 <=> offset_1 */
+                    hashTable[ZSTD_hashPtr(ip0, hlog, mls)] = (U32)(ip0-base);
+                    ip0 += rLength;
+                    ZSTD_storeSeq(seqStore, 0 /*litLen*/, anchor, iend, 0 /*offCode*/, rLength-MINMATCH);
+                    anchor = ip0;
+                    continue;   /* faster when present (confirmed on gcc-8) ... (?) */
+        }   }   }
+        ip1 = ip0 + 1;
+    }
+
+    /* save reps for next block */
+    rep[0] = offset_1 ? offset_1 : offsetSaved;
+    rep[1] = offset_2 ? offset_2 : offsetSaved;
+
+    /* Return the last literals size */
+    return (size_t)(iend - anchor);
+}
+
+
+size_t ZSTD_compressBlock_fast(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    U32 const mls = ms->cParams.minMatch;
+    assert(ms->dictMatchState == NULL);
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        return ZSTD_compressBlock_fast_generic(ms, seqStore, rep, src, srcSize, 4);
+    case 5 :
+        return ZSTD_compressBlock_fast_generic(ms, seqStore, rep, src, srcSize, 5);
+    case 6 :
+        return ZSTD_compressBlock_fast_generic(ms, seqStore, rep, src, srcSize, 6);
+    case 7 :
+        return ZSTD_compressBlock_fast_generic(ms, seqStore, rep, src, srcSize, 7);
+    }
+}
+
+FORCE_INLINE_TEMPLATE
+size_t ZSTD_compressBlock_fast_dictMatchState_generic(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize, U32 const mls)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32* const hashTable = ms->hashTable;
+    U32 const hlog = cParams->hashLog;
+    /* support stepSize of 0 */
+    U32 const stepSize = cParams->targetLength + !(cParams->targetLength);
+    const BYTE* const base = ms->window.base;
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const U32   prefixStartIndex = ms->window.dictLimit;
+    const BYTE* const prefixStart = base + prefixStartIndex;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - HASH_READ_SIZE;
+    U32 offset_1=rep[0], offset_2=rep[1];
+    U32 offsetSaved = 0;
+
+    const ZSTD_matchState_t* const dms = ms->dictMatchState;
+    const ZSTD_compressionParameters* const dictCParams = &dms->cParams ;
+    const U32* const dictHashTable = dms->hashTable;
+    const U32 dictStartIndex       = dms->window.dictLimit;
+    const BYTE* const dictBase     = dms->window.base;
+    const BYTE* const dictStart    = dictBase + dictStartIndex;
+    const BYTE* const dictEnd      = dms->window.nextSrc;
+    const U32 dictIndexDelta       = prefixStartIndex - (U32)(dictEnd - dictBase);
+    const U32 dictAndPrefixLength  = (U32)(ip - prefixStart + dictEnd - dictStart);
+    const U32 dictHLog             = dictCParams->hashLog;
+
+    /* if a dictionary is still attached, it necessarily means that
+     * it is within window size. So we just check it. */
+    const U32 maxDistance = 1U << cParams->windowLog;
+    const U32 endIndex = (U32)((size_t)(ip - base) + srcSize);
+    assert(endIndex - prefixStartIndex <= maxDistance);
+    (void)maxDistance; (void)endIndex;   /* these variables are not used when assert() is disabled */
+
+    /* ensure there will be no no underflow
+     * when translating a dict index into a local index */
+    assert(prefixStartIndex >= (U32)(dictEnd - dictBase));
+
+    /* init */
+    DEBUGLOG(5, "ZSTD_compressBlock_fast_dictMatchState_generic");
+    ip += (dictAndPrefixLength == 0);
+    /* dictMatchState repCode checks don't currently handle repCode == 0
+     * disabling. */
+    assert(offset_1 <= dictAndPrefixLength);
+    assert(offset_2 <= dictAndPrefixLength);
+
+    /* Main Search Loop */
+    while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
+        size_t mLength;
+        size_t const h = ZSTD_hashPtr(ip, hlog, mls);
+        U32 const current = (U32)(ip-base);
+        U32 const matchIndex = hashTable[h];
+        const BYTE* match = base + matchIndex;
+        const U32 repIndex = current + 1 - offset_1;
+        const BYTE* repMatch = (repIndex < prefixStartIndex) ?
+                               dictBase + (repIndex - dictIndexDelta) :
+                               base + repIndex;
+        hashTable[h] = current;   /* update hash table */
+
+        if ( ((U32)((prefixStartIndex-1) - repIndex) >= 3) /* intentional underflow : ensure repIndex isn't overlapping dict + prefix */
+          && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
+            const BYTE* const repMatchEnd = repIndex < prefixStartIndex ? dictEnd : iend;
+            mLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, prefixStart) + 4;
+            ip++;
+            ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, 0, mLength-MINMATCH);
+        } else if ( (matchIndex <= prefixStartIndex) ) {
+            size_t const dictHash = ZSTD_hashPtr(ip, dictHLog, mls);
+            U32 const dictMatchIndex = dictHashTable[dictHash];
+            const BYTE* dictMatch = dictBase + dictMatchIndex;
+            if (dictMatchIndex <= dictStartIndex ||
+                MEM_read32(dictMatch) != MEM_read32(ip)) {
+                assert(stepSize >= 1);
+                ip += ((ip-anchor) >> kSearchStrength) + stepSize;
+                continue;
+            } else {
+                /* found a dict match */
+                U32 const offset = (U32)(current-dictMatchIndex-dictIndexDelta);
+                mLength = ZSTD_count_2segments(ip+4, dictMatch+4, iend, dictEnd, prefixStart) + 4;
+                while (((ip>anchor) & (dictMatch>dictStart))
+                     && (ip[-1] == dictMatch[-1])) {
+                    ip--; dictMatch--; mLength++;
+                } /* catch up */
+                offset_2 = offset_1;
+                offset_1 = offset;
+                ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+            }
+        } else if (MEM_read32(match) != MEM_read32(ip)) {
+            /* it's not a match, and we're not going to check the dictionary */
+            assert(stepSize >= 1);
+            ip += ((ip-anchor) >> kSearchStrength) + stepSize;
+            continue;
+        } else {
+            /* found a regular match */
+            U32 const offset = (U32)(ip-match);
+            mLength = ZSTD_count(ip+4, match+4, iend) + 4;
+            while (((ip>anchor) & (match>prefixStart))
+                 && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
+            offset_2 = offset_1;
+            offset_1 = offset;
+            ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+        }
+
+        /* match found */
+        ip += mLength;
+        anchor = ip;
+
+        if (ip <= ilimit) {
+            /* Fill Table */
+            assert(base+current+2 > istart);  /* check base overflow */
+            hashTable[ZSTD_hashPtr(base+current+2, hlog, mls)] = current+2;  /* here because current+2 could be > iend-8 */
+            hashTable[ZSTD_hashPtr(ip-2, hlog, mls)] = (U32)(ip-2-base);
+
+            /* check immediate repcode */
+            while (ip <= ilimit) {
+                U32 const current2 = (U32)(ip-base);
+                U32 const repIndex2 = current2 - offset_2;
+                const BYTE* repMatch2 = repIndex2 < prefixStartIndex ?
+                        dictBase - dictIndexDelta + repIndex2 :
+                        base + repIndex2;
+                if ( ((U32)((prefixStartIndex-1) - (U32)repIndex2) >= 3 /* intentional overflow */)
+                   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
+                    const BYTE* const repEnd2 = repIndex2 < prefixStartIndex ? dictEnd : iend;
+                    size_t const repLength2 = ZSTD_count_2segments(ip+4, repMatch2+4, iend, repEnd2, prefixStart) + 4;
+                    U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
+                    ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, repLength2-MINMATCH);
+                    hashTable[ZSTD_hashPtr(ip, hlog, mls)] = current2;
+                    ip += repLength2;
+                    anchor = ip;
+                    continue;
+                }
+                break;
+            }
+        }
+    }
+
+    /* save reps for next block */
+    rep[0] = offset_1 ? offset_1 : offsetSaved;
+    rep[1] = offset_2 ? offset_2 : offsetSaved;
+
+    /* Return the last literals size */
+    return (size_t)(iend - anchor);
+}
+
+size_t ZSTD_compressBlock_fast_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    U32 const mls = ms->cParams.minMatch;
+    assert(ms->dictMatchState != NULL);
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        return ZSTD_compressBlock_fast_dictMatchState_generic(ms, seqStore, rep, src, srcSize, 4);
+    case 5 :
+        return ZSTD_compressBlock_fast_dictMatchState_generic(ms, seqStore, rep, src, srcSize, 5);
+    case 6 :
+        return ZSTD_compressBlock_fast_dictMatchState_generic(ms, seqStore, rep, src, srcSize, 6);
+    case 7 :
+        return ZSTD_compressBlock_fast_dictMatchState_generic(ms, seqStore, rep, src, srcSize, 7);
+    }
+}
+
+
+static size_t ZSTD_compressBlock_fast_extDict_generic(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize, U32 const mls)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32* const hashTable = ms->hashTable;
+    U32 const hlog = cParams->hashLog;
+    /* support stepSize of 0 */
+    U32 const stepSize = cParams->targetLength + !(cParams->targetLength);
+    const BYTE* const base = ms->window.base;
+    const BYTE* const dictBase = ms->window.dictBase;
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const U32   endIndex = (U32)((size_t)(istart - base) + srcSize);
+    const U32   lowLimit = ZSTD_getLowestMatchIndex(ms, endIndex, cParams->windowLog);
+    const U32   dictStartIndex = lowLimit;
+    const BYTE* const dictStart = dictBase + dictStartIndex;
+    const U32   dictLimit = ms->window.dictLimit;
+    const U32   prefixStartIndex = dictLimit < lowLimit ? lowLimit : dictLimit;
+    const BYTE* const prefixStart = base + prefixStartIndex;
+    const BYTE* const dictEnd = dictBase + prefixStartIndex;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    U32 offset_1=rep[0], offset_2=rep[1];
+
+    DEBUGLOG(5, "ZSTD_compressBlock_fast_extDict_generic (offset_1=%u)", offset_1);
+
+    /* switch to "regular" variant if extDict is invalidated due to maxDistance */
+    if (prefixStartIndex == dictStartIndex)
+        return ZSTD_compressBlock_fast_generic(ms, seqStore, rep, src, srcSize, mls);
+
+    /* Search Loop */
+    while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
+        const size_t h = ZSTD_hashPtr(ip, hlog, mls);
+        const U32    matchIndex = hashTable[h];
+        const BYTE* const matchBase = matchIndex < prefixStartIndex ? dictBase : base;
+        const BYTE*  match = matchBase + matchIndex;
+        const U32    current = (U32)(ip-base);
+        const U32    repIndex = current + 1 - offset_1;
+        const BYTE* const repBase = repIndex < prefixStartIndex ? dictBase : base;
+        const BYTE* const repMatch = repBase + repIndex;
+        hashTable[h] = current;   /* update hash table */
+        DEBUGLOG(7, "offset_1 = %u , current = %u", offset_1, current);
+        assert(offset_1 <= current +1);   /* check repIndex */
+
+        if ( (((U32)((prefixStartIndex-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > dictStartIndex))
+           && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
+            const BYTE* const repMatchEnd = repIndex < prefixStartIndex ? dictEnd : iend;
+            size_t const rLength = ZSTD_count_2segments(ip+1 +4, repMatch +4, iend, repMatchEnd, prefixStart) + 4;
+            ip++;
+            ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, 0, rLength-MINMATCH);
+            ip += rLength;
+            anchor = ip;
+        } else {
+            if ( (matchIndex < dictStartIndex) ||
+                 (MEM_read32(match) != MEM_read32(ip)) ) {
+                assert(stepSize >= 1);
+                ip += ((ip-anchor) >> kSearchStrength) + stepSize;
+                continue;
+            }
+            {   const BYTE* const matchEnd = matchIndex < prefixStartIndex ? dictEnd : iend;
+                const BYTE* const lowMatchPtr = matchIndex < prefixStartIndex ? dictStart : prefixStart;
+                U32 const offset = current - matchIndex;
+                size_t mLength = ZSTD_count_2segments(ip+4, match+4, iend, matchEnd, prefixStart) + 4;
+                while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
+                offset_2 = offset_1; offset_1 = offset;  /* update offset history */
+                ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, iend, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
+                ip += mLength;
+                anchor = ip;
+        }   }
+
+        if (ip <= ilimit) {
+            /* Fill Table */
+            hashTable[ZSTD_hashPtr(base+current+2, hlog, mls)] = current+2;
+            hashTable[ZSTD_hashPtr(ip-2, hlog, mls)] = (U32)(ip-2-base);
+            /* check immediate repcode */
+            while (ip <= ilimit) {
+                U32 const current2 = (U32)(ip-base);
+                U32 const repIndex2 = current2 - offset_2;
+                const BYTE* const repMatch2 = repIndex2 < prefixStartIndex ? dictBase + repIndex2 : base + repIndex2;
+                if ( (((U32)((prefixStartIndex-1) - repIndex2) >= 3) & (repIndex2 > dictStartIndex))  /* intentional overflow */
+                   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
+                    const BYTE* const repEnd2 = repIndex2 < prefixStartIndex ? dictEnd : iend;
+                    size_t const repLength2 = ZSTD_count_2segments(ip+4, repMatch2+4, iend, repEnd2, prefixStart) + 4;
+                    { U32 const tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset; }  /* swap offset_2 <=> offset_1 */
+                    ZSTD_storeSeq(seqStore, 0 /*litlen*/, anchor, iend, 0 /*offcode*/, repLength2-MINMATCH);
+                    hashTable[ZSTD_hashPtr(ip, hlog, mls)] = current2;
+                    ip += repLength2;
+                    anchor = ip;
+                    continue;
+                }
+                break;
+    }   }   }
+
+    /* save reps for next block */
+    rep[0] = offset_1;
+    rep[1] = offset_2;
+
+    /* Return the last literals size */
+    return (size_t)(iend - anchor);
+}
+
+
+size_t ZSTD_compressBlock_fast_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    U32 const mls = ms->cParams.minMatch;
+    switch(mls)
+    {
+    default: /* includes case 3 */
+    case 4 :
+        return ZSTD_compressBlock_fast_extDict_generic(ms, seqStore, rep, src, srcSize, 4);
+    case 5 :
+        return ZSTD_compressBlock_fast_extDict_generic(ms, seqStore, rep, src, srcSize, 5);
+    case 6 :
+        return ZSTD_compressBlock_fast_extDict_generic(ms, seqStore, rep, src, srcSize, 6);
+    case 7 :
+        return ZSTD_compressBlock_fast_extDict_generic(ms, seqStore, rep, src, srcSize, 7);
+    }
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_lazy.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_lazy.cpp
new file mode 100644
index 0000000000..57701838a7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_lazy.cpp
@@ -0,0 +1,1142 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#include "zstd/compress/zstd_compress_internal.h"
+#include "zstd/compress/zstd_lazy.h"
+
+
+/*-*************************************
+*  Binary Tree search
+***************************************/
+
+namespace lbug_zstd {
+
+static void
+ZSTD_updateDUBT(ZSTD_matchState_t* ms,
+                const BYTE* ip, const BYTE* iend,
+                U32 mls)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32* const hashTable = ms->hashTable;
+    U32  const hashLog = cParams->hashLog;
+
+    U32* const bt = ms->chainTable;
+    U32  const btLog  = cParams->chainLog - 1;
+    U32  const btMask = (1 << btLog) - 1;
+
+    const BYTE* const base = ms->window.base;
+    U32 const target = (U32)(ip - base);
+    U32 idx = ms->nextToUpdate;
+
+    if (idx != target)
+        DEBUGLOG(7, "ZSTD_updateDUBT, from %u to %u (dictLimit:%u)",
+                    idx, target, ms->window.dictLimit);
+    assert(ip + 8 <= iend);   /* condition for ZSTD_hashPtr */
+    (void)iend;
+
+    assert(idx >= ms->window.dictLimit);   /* condition for valid base+idx */
+    for ( ; idx < target ; idx++) {
+        size_t const h  = ZSTD_hashPtr(base + idx, hashLog, mls);   /* assumption : ip + 8 <= iend */
+        U32    const matchIndex = hashTable[h];
+
+        U32*   const nextCandidatePtr = bt + 2*(idx&btMask);
+        U32*   const sortMarkPtr  = nextCandidatePtr + 1;
+
+        DEBUGLOG(8, "ZSTD_updateDUBT: insert %u", idx);
+        hashTable[h] = idx;   /* Update Hash Table */
+        *nextCandidatePtr = matchIndex;   /* update BT like a chain */
+        *sortMarkPtr = ZSTD_DUBT_UNSORTED_MARK;
+    }
+    ms->nextToUpdate = target;
+}
+
+
+/** ZSTD_insertDUBT1() :
+ *  sort one already inserted but unsorted position
+ *  assumption : current >= btlow == (current - btmask)
+ *  doesn't fail */
+static void
+ZSTD_insertDUBT1(ZSTD_matchState_t* ms,
+                 U32 current, const BYTE* inputEnd,
+                 U32 nbCompares, U32 btLow,
+                 const ZSTD_dictMode_e dictMode)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32* const bt = ms->chainTable;
+    U32  const btLog  = cParams->chainLog - 1;
+    U32  const btMask = (1 << btLog) - 1;
+    size_t commonLengthSmaller=0, commonLengthLarger=0;
+    const BYTE* const base = ms->window.base;
+    const BYTE* const dictBase = ms->window.dictBase;
+    const U32 dictLimit = ms->window.dictLimit;
+    const BYTE* const ip = (current>=dictLimit) ? base + current : dictBase + current;
+    const BYTE* const iend = (current>=dictLimit) ? inputEnd : dictBase + dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const BYTE* match;
+    U32* smallerPtr = bt + 2*(current&btMask);
+    U32* largerPtr  = smallerPtr + 1;
+    U32 matchIndex = *smallerPtr;   /* this candidate is unsorted : next sorted candidate is reached through *smallerPtr, while *largerPtr contains previous unsorted candidate (which is already saved and can be overwritten) */
+    U32 dummy32;   /* to be nullified at the end */
+    U32 const windowValid = ms->window.lowLimit;
+    U32 const maxDistance = 1U << cParams->windowLog;
+    U32 const windowLow = (current - windowValid > maxDistance) ? current - maxDistance : windowValid;
+
+
+    DEBUGLOG(8, "ZSTD_insertDUBT1(%u) (dictLimit=%u, lowLimit=%u)",
+                current, dictLimit, windowLow);
+    assert(current >= btLow);
+    assert(ip < iend);   /* condition for ZSTD_count */
+
+    while (nbCompares-- && (matchIndex > windowLow)) {
+        U32* const nextPtr = bt + 2*(matchIndex & btMask);
+        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+        assert(matchIndex < current);
+        /* note : all candidates are now supposed sorted,
+         * but it's still possible to have nextPtr[1] == ZSTD_DUBT_UNSORTED_MARK
+         * when a real index has the same value as ZSTD_DUBT_UNSORTED_MARK */
+
+        if ( (dictMode != ZSTD_extDict)
+          || (matchIndex+matchLength >= dictLimit)  /* both in current segment*/
+          || (current < dictLimit) /* both in extDict */) {
+            const BYTE* const mBase = ( (dictMode != ZSTD_extDict)
+                                     || (matchIndex+matchLength >= dictLimit)) ?
+                                        base : dictBase;
+            assert( (matchIndex+matchLength >= dictLimit)   /* might be wrong if extDict is incorrectly set to 0 */
+                 || (current < dictLimit) );
+            match = mBase + matchIndex;
+            matchLength += ZSTD_count(ip+matchLength, match+matchLength, iend);
+        } else {
+            match = dictBase + matchIndex;
+            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
+            if (matchIndex+matchLength >= dictLimit)
+                match = base + matchIndex;   /* preparation for next read of match[matchLength] */
+        }
+
+        DEBUGLOG(8, "ZSTD_insertDUBT1: comparing %u with %u : found %u common bytes ",
+                    current, matchIndex, (U32)matchLength);
+
+        if (ip+matchLength == iend) {   /* equal : no way to know if inf or sup */
+            break;   /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt tree */
+        }
+
+        if (match[matchLength] < ip[matchLength]) {  /* necessarily within buffer */
+            /* match is smaller than current */
+            *smallerPtr = matchIndex;             /* update smaller idx */
+            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */
+            DEBUGLOG(8, "ZSTD_insertDUBT1: %u (>btLow=%u) is smaller : next => %u",
+                        matchIndex, btLow, nextPtr[1]);
+            smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller than target */
+            matchIndex = nextPtr[1];              /* new matchIndex, larger than previous and closer to current */
+        } else {
+            /* match is larger than current */
+            *largerPtr = matchIndex;
+            commonLengthLarger = matchLength;
+            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop searching */
+            DEBUGLOG(8, "ZSTD_insertDUBT1: %u (>btLow=%u) is larger => %u",
+                        matchIndex, btLow, nextPtr[0]);
+            largerPtr = nextPtr;
+            matchIndex = nextPtr[0];
+    }   }
+
+    *smallerPtr = *largerPtr = 0;
+}
+
+
+static size_t
+ZSTD_DUBT_findBetterDictMatch (
+        ZSTD_matchState_t* ms,
+        const BYTE* const ip, const BYTE* const iend,
+        size_t* offsetPtr,
+        size_t bestLength,
+        U32 nbCompares,
+        U32 const mls,
+        const ZSTD_dictMode_e dictMode)
+{
+    const ZSTD_matchState_t * const dms = ms->dictMatchState;
+    const ZSTD_compressionParameters* const dmsCParams = &dms->cParams;
+    const U32 * const dictHashTable = dms->hashTable;
+    U32         const hashLog = dmsCParams->hashLog;
+    size_t      const h  = ZSTD_hashPtr(ip, hashLog, mls);
+    U32               dictMatchIndex = dictHashTable[h];
+
+    const BYTE* const base = ms->window.base;
+    const BYTE* const prefixStart = base + ms->window.dictLimit;
+    U32         const current = (U32)(ip-base);
+    const BYTE* const dictBase = dms->window.base;
+    const BYTE* const dictEnd = dms->window.nextSrc;
+    U32         const dictHighLimit = (U32)(dms->window.nextSrc - dms->window.base);
+    U32         const dictLowLimit = dms->window.lowLimit;
+    U32         const dictIndexDelta = ms->window.lowLimit - dictHighLimit;
+
+    U32*        const dictBt = dms->chainTable;
+    U32         const btLog  = dmsCParams->chainLog - 1;
+    U32         const btMask = (1 << btLog) - 1;
+    U32         const btLow = (btMask >= dictHighLimit - dictLowLimit) ? dictLowLimit : dictHighLimit - btMask;
+
+    size_t commonLengthSmaller=0, commonLengthLarger=0;
+
+    (void)dictMode;
+    assert(dictMode == ZSTD_dictMatchState);
+
+    while (nbCompares-- && (dictMatchIndex > dictLowLimit)) {
+        U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask);
+        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+        const BYTE* match = dictBase + dictMatchIndex;
+        matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
+        if (dictMatchIndex+matchLength >= dictHighLimit)
+            match = base + dictMatchIndex + dictIndexDelta;   /* to prepare for next usage of match[matchLength] */
+
+        if (matchLength > bestLength) {
+            U32 matchIndex = dictMatchIndex + dictIndexDelta;
+            if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit32(current-matchIndex+1) - ZSTD_highbit32((U32)offsetPtr[0]+1)) ) {
+                DEBUGLOG(9, "ZSTD_DUBT_findBetterDictMatch(%u) : found better match length %u -> %u and offsetCode %u -> %u (dictMatchIndex %u, matchIndex %u)",
+                    current, (U32)bestLength, (U32)matchLength, (U32)*offsetPtr, ZSTD_REP_MOVE + current - matchIndex, dictMatchIndex, matchIndex);
+                bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + current - matchIndex;
+            }
+            if (ip+matchLength == iend) {   /* reached end of input : ip[matchLength] is not valid, no way to know if it's larger or smaller than match */
+                break;   /* drop, to guarantee consistency (miss a little bit of compression) */
+            }
+        }
+
+        if (match[matchLength] < ip[matchLength]) {
+            if (dictMatchIndex <= btLow) { break; }   /* beyond tree size, stop the search */
+            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+            dictMatchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+        } else {
+            /* match is larger than current */
+            if (dictMatchIndex <= btLow) { break; }   /* beyond tree size, stop the search */
+            commonLengthLarger = matchLength;
+            dictMatchIndex = nextPtr[0];
+        }
+    }
+
+    if (bestLength >= MINMATCH) {
+        U32 const mIndex = current - ((U32)*offsetPtr - ZSTD_REP_MOVE); (void)mIndex;
+        DEBUGLOG(8, "ZSTD_DUBT_findBetterDictMatch(%u) : found match of length %u and offsetCode %u (pos %u)",
+                    current, (U32)bestLength, (U32)*offsetPtr, mIndex);
+    }
+    return bestLength;
+
+}
+
+
+static size_t
+ZSTD_DUBT_findBestMatch(ZSTD_matchState_t* ms,
+                        const BYTE* const ip, const BYTE* const iend,
+                        size_t* offsetPtr,
+                        U32 const mls,
+                        const ZSTD_dictMode_e dictMode)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32*   const hashTable = ms->hashTable;
+    U32    const hashLog = cParams->hashLog;
+    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
+    U32          matchIndex  = hashTable[h];
+
+    const BYTE* const base = ms->window.base;
+    U32    const current = (U32)(ip-base);
+    U32    const windowLow = ZSTD_getLowestMatchIndex(ms, current, cParams->windowLog);
+
+    U32*   const bt = ms->chainTable;
+    U32    const btLog  = cParams->chainLog - 1;
+    U32    const btMask = (1 << btLog) - 1;
+    U32    const btLow = (btMask >= current) ? 0 : current - btMask;
+    U32    const unsortLimit = MAX(btLow, windowLow);
+
+    U32*         nextCandidate = bt + 2*(matchIndex&btMask);
+    U32*         unsortedMark = bt + 2*(matchIndex&btMask) + 1;
+    U32          nbCompares = 1U << cParams->searchLog;
+    U32          nbCandidates = nbCompares;
+    U32          previousCandidate = 0;
+
+    DEBUGLOG(7, "ZSTD_DUBT_findBestMatch (%u) ", current);
+    assert(ip <= iend-8);   /* required for h calculation */
+
+    /* reach end of unsorted candidates list */
+    while ( (matchIndex > unsortLimit)
+         && (*unsortedMark == ZSTD_DUBT_UNSORTED_MARK)
+         && (nbCandidates > 1) ) {
+        DEBUGLOG(8, "ZSTD_DUBT_findBestMatch: candidate %u is unsorted",
+                    matchIndex);
+        *unsortedMark = previousCandidate;  /* the unsortedMark becomes a reversed chain, to move up back to original position */
+        previousCandidate = matchIndex;
+        matchIndex = *nextCandidate;
+        nextCandidate = bt + 2*(matchIndex&btMask);
+        unsortedMark = bt + 2*(matchIndex&btMask) + 1;
+        nbCandidates --;
+    }
+
+    /* nullify last candidate if it's still unsorted
+     * simplification, detrimental to compression ratio, beneficial for speed */
+    if ( (matchIndex > unsortLimit)
+      && (*unsortedMark==ZSTD_DUBT_UNSORTED_MARK) ) {
+        DEBUGLOG(7, "ZSTD_DUBT_findBestMatch: nullify last unsorted candidate %u",
+                    matchIndex);
+        *nextCandidate = *unsortedMark = 0;
+    }
+
+    /* batch sort stacked candidates */
+    matchIndex = previousCandidate;
+    while (matchIndex) {  /* will end on matchIndex == 0 */
+        U32* const nextCandidateIdxPtr = bt + 2*(matchIndex&btMask) + 1;
+        U32 const nextCandidateIdx = *nextCandidateIdxPtr;
+        ZSTD_insertDUBT1(ms, matchIndex, iend,
+                         nbCandidates, unsortLimit, dictMode);
+        matchIndex = nextCandidateIdx;
+        nbCandidates++;
+    }
+
+    /* find longest match */
+    {   size_t commonLengthSmaller = 0, commonLengthLarger = 0;
+        const BYTE* const dictBase = ms->window.dictBase;
+        const U32 dictLimit = ms->window.dictLimit;
+        const BYTE* const dictEnd = dictBase + dictLimit;
+        const BYTE* const prefixStart = base + dictLimit;
+        U32* smallerPtr = bt + 2*(current&btMask);
+        U32* largerPtr  = bt + 2*(current&btMask) + 1;
+        U32 matchEndIdx = current + 8 + 1;
+        U32 dummy32;   /* to be nullified at the end */
+        size_t bestLength = 0;
+
+        matchIndex  = hashTable[h];
+        hashTable[h] = current;   /* Update Hash Table */
+
+        while (nbCompares-- && (matchIndex > windowLow)) {
+            U32* const nextPtr = bt + 2*(matchIndex & btMask);
+            size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+            const BYTE* match;
+
+            if ((dictMode != ZSTD_extDict) || (matchIndex+matchLength >= dictLimit)) {
+                match = base + matchIndex;
+                matchLength += ZSTD_count(ip+matchLength, match+matchLength, iend);
+            } else {
+                match = dictBase + matchIndex;
+                matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
+                if (matchIndex+matchLength >= dictLimit)
+                    match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+            }
+
+            if (matchLength > bestLength) {
+                if (matchLength > matchEndIdx - matchIndex)
+                    matchEndIdx = matchIndex + (U32)matchLength;
+                if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit32(current-matchIndex+1) - ZSTD_highbit32((U32)offsetPtr[0]+1)) )
+                    bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + current - matchIndex;
+                if (ip+matchLength == iend) {   /* equal : no way to know if inf or sup */
+                    if (dictMode == ZSTD_dictMatchState) {
+                        nbCompares = 0; /* in addition to avoiding checking any
+                                         * further in this loop, make sure we
+                                         * skip checking in the dictionary. */
+                    }
+                    break;   /* drop, to guarantee consistency (miss a little bit of compression) */
+                }
+            }
+
+            if (match[matchLength] < ip[matchLength]) {
+                /* match is smaller than current */
+                *smallerPtr = matchIndex;             /* update smaller idx */
+                commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+                if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+                smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+                matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+            } else {
+                /* match is larger than current */
+                *largerPtr = matchIndex;
+                commonLengthLarger = matchLength;
+                if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+                largerPtr = nextPtr;
+                matchIndex = nextPtr[0];
+        }   }
+
+        *smallerPtr = *largerPtr = 0;
+
+        if (dictMode == ZSTD_dictMatchState && nbCompares) {
+            bestLength = ZSTD_DUBT_findBetterDictMatch(
+                    ms, ip, iend,
+                    offsetPtr, bestLength, nbCompares,
+                    mls, dictMode);
+        }
+
+        assert(matchEndIdx > current+8); /* ensure nextToUpdate is increased */
+        ms->nextToUpdate = matchEndIdx - 8;   /* skip repetitive patterns */
+        if (bestLength >= MINMATCH) {
+            U32 const mIndex = current - ((U32)*offsetPtr - ZSTD_REP_MOVE); (void)mIndex;
+            DEBUGLOG(8, "ZSTD_DUBT_findBestMatch(%u) : found match of length %u and offsetCode %u (pos %u)",
+                        current, (U32)bestLength, (U32)*offsetPtr, mIndex);
+        }
+        return bestLength;
+    }
+}
+
+
+/** ZSTD_BtFindBestMatch() : Tree updater, providing best match */
+FORCE_INLINE_TEMPLATE size_t
+ZSTD_BtFindBestMatch( ZSTD_matchState_t* ms,
+                const BYTE* const ip, const BYTE* const iLimit,
+                      size_t* offsetPtr,
+                const U32 mls /* template */,
+                const ZSTD_dictMode_e dictMode)
+{
+    DEBUGLOG(7, "ZSTD_BtFindBestMatch");
+    if (ip < ms->window.base + ms->nextToUpdate) return 0;   /* skipped area */
+    ZSTD_updateDUBT(ms, ip, iLimit, mls);
+    return ZSTD_DUBT_findBestMatch(ms, ip, iLimit, offsetPtr, mls, dictMode);
+}
+
+
+static size_t
+ZSTD_BtFindBestMatch_selectMLS (  ZSTD_matchState_t* ms,
+                            const BYTE* ip, const BYTE* const iLimit,
+                                  size_t* offsetPtr)
+{
+    switch(ms->cParams.minMatch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 4, ZSTD_noDict);
+    case 5 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 5, ZSTD_noDict);
+    case 7 :
+    case 6 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 6, ZSTD_noDict);
+    }
+}
+
+
+static size_t ZSTD_BtFindBestMatch_dictMatchState_selectMLS (
+                        ZSTD_matchState_t* ms,
+                        const BYTE* ip, const BYTE* const iLimit,
+                        size_t* offsetPtr)
+{
+    switch(ms->cParams.minMatch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 4, ZSTD_dictMatchState);
+    case 5 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 5, ZSTD_dictMatchState);
+    case 7 :
+    case 6 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 6, ZSTD_dictMatchState);
+    }
+}
+
+
+static size_t ZSTD_BtFindBestMatch_extDict_selectMLS (
+                        ZSTD_matchState_t* ms,
+                        const BYTE* ip, const BYTE* const iLimit,
+                        size_t* offsetPtr)
+{
+    switch(ms->cParams.minMatch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 4, ZSTD_extDict);
+    case 5 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 5, ZSTD_extDict);
+    case 7 :
+    case 6 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 6, ZSTD_extDict);
+    }
+}
+
+
+
+/* *********************************
+*  Hash Chain
+***********************************/
+#define NEXT_IN_CHAIN(d, mask)   chainTable[(d) & (mask)]
+
+/* Update chains up to ip (excluded)
+   Assumption : always within prefix (i.e. not within extDict) */
+static U32 ZSTD_insertAndFindFirstIndex_internal(
+                        ZSTD_matchState_t* ms,
+                        const ZSTD_compressionParameters* const cParams,
+                        const BYTE* ip, U32 const mls)
+{
+    U32* const hashTable  = ms->hashTable;
+    const U32 hashLog = cParams->hashLog;
+    U32* const chainTable = ms->chainTable;
+    const U32 chainMask = (1 << cParams->chainLog) - 1;
+    const BYTE* const base = ms->window.base;
+    const U32 target = (U32)(ip - base);
+    U32 idx = ms->nextToUpdate;
+
+    while(idx < target) { /* catch up */
+        size_t const h = ZSTD_hashPtr(base+idx, hashLog, mls);
+        NEXT_IN_CHAIN(idx, chainMask) = hashTable[h];
+        hashTable[h] = idx;
+        idx++;
+    }
+
+    ms->nextToUpdate = target;
+    return hashTable[ZSTD_hashPtr(ip, hashLog, mls)];
+}
+
+U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip) {
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    return ZSTD_insertAndFindFirstIndex_internal(ms, cParams, ip, ms->cParams.minMatch);
+}
+
+
+/* inlining is important to hardwire a hot branch (template emulation) */
+FORCE_INLINE_TEMPLATE
+size_t ZSTD_HcFindBestMatch_generic (
+                        ZSTD_matchState_t* ms,
+                        const BYTE* const ip, const BYTE* const iLimit,
+                        size_t* offsetPtr,
+                        const U32 mls, const ZSTD_dictMode_e dictMode)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32* const chainTable = ms->chainTable;
+    const U32 chainSize = (1 << cParams->chainLog);
+    const U32 chainMask = chainSize-1;
+    const BYTE* const base = ms->window.base;
+    const BYTE* const dictBase = ms->window.dictBase;
+    const U32 dictLimit = ms->window.dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const U32 current = (U32)(ip-base);
+    const U32 maxDistance = 1U << cParams->windowLog;
+    const U32 lowestValid = ms->window.lowLimit;
+    const U32 withinMaxDistance = (current - lowestValid > maxDistance) ? current - maxDistance : lowestValid;
+    const U32 isDictionary = (ms->loadedDictEnd != 0);
+    const U32 lowLimit = isDictionary ? lowestValid : withinMaxDistance;
+    const U32 minChain = current > chainSize ? current - chainSize : 0;
+    U32 nbAttempts = 1U << cParams->searchLog;
+    size_t ml=4-1;
+
+    /* HC4 match finder */
+    U32 matchIndex = ZSTD_insertAndFindFirstIndex_internal(ms, cParams, ip, mls);
+
+    for ( ; (matchIndex>lowLimit) & (nbAttempts>0) ; nbAttempts--) {
+        size_t currentMl=0;
+        if ((dictMode != ZSTD_extDict) || matchIndex >= dictLimit) {
+            const BYTE* const match = base + matchIndex;
+            assert(matchIndex >= dictLimit);   /* ensures this is true if dictMode != ZSTD_extDict */
+            if (match[ml] == ip[ml])   /* potentially better */
+                currentMl = ZSTD_count(ip, match, iLimit);
+        } else {
+            const BYTE* const match = dictBase + matchIndex;
+            assert(match+4 <= dictEnd);
+            if (MEM_read32(match) == MEM_read32(ip))   /* assumption : matchIndex <= dictLimit-4 (by table construction) */
+                currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dictEnd, prefixStart) + 4;
+        }
+
+        /* save best solution */
+        if (currentMl > ml) {
+            ml = currentMl;
+            *offsetPtr = current - matchIndex + ZSTD_REP_MOVE;
+            if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */
+        }
+
+        if (matchIndex <= minChain) break;
+        matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask);
+    }
+
+    if (dictMode == ZSTD_dictMatchState) {
+        const ZSTD_matchState_t* const dms = ms->dictMatchState;
+        const U32* const dmsChainTable = dms->chainTable;
+        const U32 dmsChainSize         = (1 << dms->cParams.chainLog);
+        const U32 dmsChainMask         = dmsChainSize - 1;
+        const U32 dmsLowestIndex       = dms->window.dictLimit;
+        const BYTE* const dmsBase      = dms->window.base;
+        const BYTE* const dmsEnd       = dms->window.nextSrc;
+        const U32 dmsSize              = (U32)(dmsEnd - dmsBase);
+        const U32 dmsIndexDelta        = dictLimit - dmsSize;
+        const U32 dmsMinChain = dmsSize > dmsChainSize ? dmsSize - dmsChainSize : 0;
+
+        matchIndex = dms->hashTable[ZSTD_hashPtr(ip, dms->cParams.hashLog, mls)];
+
+        for ( ; (matchIndex>dmsLowestIndex) & (nbAttempts>0) ; nbAttempts--) {
+            size_t currentMl=0;
+            const BYTE* const match = dmsBase + matchIndex;
+            assert(match+4 <= dmsEnd);
+            if (MEM_read32(match) == MEM_read32(ip))   /* assumption : matchIndex <= dictLimit-4 (by table construction) */
+                currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dmsEnd, prefixStart) + 4;
+
+            /* save best solution */
+            if (currentMl > ml) {
+                ml = currentMl;
+                *offsetPtr = current - (matchIndex + dmsIndexDelta) + ZSTD_REP_MOVE;
+                if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */
+            }
+
+            if (matchIndex <= dmsMinChain) break;
+            matchIndex = dmsChainTable[matchIndex & dmsChainMask];
+        }
+    }
+
+    return ml;
+}
+
+
+FORCE_INLINE_TEMPLATE size_t ZSTD_HcFindBestMatch_selectMLS (
+                        ZSTD_matchState_t* ms,
+                        const BYTE* ip, const BYTE* const iLimit,
+                        size_t* offsetPtr)
+{
+    switch(ms->cParams.minMatch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 4, ZSTD_noDict);
+    case 5 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 5, ZSTD_noDict);
+    case 7 :
+    case 6 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 6, ZSTD_noDict);
+    }
+}
+
+
+static size_t ZSTD_HcFindBestMatch_dictMatchState_selectMLS (
+                        ZSTD_matchState_t* ms,
+                        const BYTE* ip, const BYTE* const iLimit,
+                        size_t* offsetPtr)
+{
+    switch(ms->cParams.minMatch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 4, ZSTD_dictMatchState);
+    case 5 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 5, ZSTD_dictMatchState);
+    case 7 :
+    case 6 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 6, ZSTD_dictMatchState);
+    }
+}
+
+
+FORCE_INLINE_TEMPLATE size_t ZSTD_HcFindBestMatch_extDict_selectMLS (
+                        ZSTD_matchState_t* ms,
+                        const BYTE* ip, const BYTE* const iLimit,
+                        size_t* offsetPtr)
+{
+    switch(ms->cParams.minMatch)
+    {
+    default : /* includes case 3 */
+    case 4 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 4, ZSTD_extDict);
+    case 5 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 5, ZSTD_extDict);
+    case 7 :
+    case 6 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 6, ZSTD_extDict);
+    }
+}
+
+
+/* *******************************
+*  Common parser - lazy strategy
+*********************************/
+typedef enum { search_hashChain, search_binaryTree } searchMethod_e;
+
+FORCE_INLINE_TEMPLATE size_t
+ZSTD_compressBlock_lazy_generic(
+                        ZSTD_matchState_t* ms, seqStore_t* seqStore,
+                        U32 rep[ZSTD_REP_NUM],
+                        const void* src, size_t srcSize,
+                        const searchMethod_e searchMethod, const U32 depth,
+                        ZSTD_dictMode_e const dictMode)
+{
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    const BYTE* const base = ms->window.base;
+    const U32 prefixLowestIndex = ms->window.dictLimit;
+    const BYTE* const prefixLowest = base + prefixLowestIndex;
+
+    typedef size_t (*searchMax_f)(
+                        ZSTD_matchState_t* ms,
+                        const BYTE* ip, const BYTE* iLimit, size_t* offsetPtr);
+    searchMax_f const searchMax = dictMode == ZSTD_dictMatchState ?
+        (searchMethod==search_binaryTree ? ZSTD_BtFindBestMatch_dictMatchState_selectMLS
+                                         : ZSTD_HcFindBestMatch_dictMatchState_selectMLS) :
+        (searchMethod==search_binaryTree ? ZSTD_BtFindBestMatch_selectMLS
+                                         : ZSTD_HcFindBestMatch_selectMLS);
+    U32 offset_1 = rep[0], offset_2 = rep[1], savedOffset=0;
+
+    const ZSTD_matchState_t* const dms = ms->dictMatchState;
+    const U32 dictLowestIndex      = dictMode == ZSTD_dictMatchState ?
+                                     dms->window.dictLimit : 0;
+    const BYTE* const dictBase     = dictMode == ZSTD_dictMatchState ?
+                                     dms->window.base : NULL;
+    const BYTE* const dictLowest   = dictMode == ZSTD_dictMatchState ?
+                                     dictBase + dictLowestIndex : NULL;
+    const BYTE* const dictEnd      = dictMode == ZSTD_dictMatchState ?
+                                     dms->window.nextSrc : NULL;
+    const U32 dictIndexDelta       = dictMode == ZSTD_dictMatchState ?
+                                     prefixLowestIndex - (U32)(dictEnd - dictBase) :
+                                     0;
+    const U32 dictAndPrefixLength = (U32)((ip - prefixLowest) + (dictEnd - dictLowest));
+
+    DEBUGLOG(5, "ZSTD_compressBlock_lazy_generic (dictMode=%u)", (U32)dictMode);
+
+    /* init */
+    ip += (dictAndPrefixLength == 0);
+    if (dictMode == ZSTD_noDict) {
+        U32 const current = (U32)(ip - base);
+        U32 const windowLow = ZSTD_getLowestPrefixIndex(ms, current, ms->cParams.windowLog);
+        U32 const maxRep = current - windowLow;
+        if (offset_2 > maxRep) savedOffset = offset_2, offset_2 = 0;
+        if (offset_1 > maxRep) savedOffset = offset_1, offset_1 = 0;
+    }
+    if (dictMode == ZSTD_dictMatchState) {
+        /* dictMatchState repCode checks don't currently handle repCode == 0
+         * disabling. */
+        assert(offset_1 <= dictAndPrefixLength);
+        assert(offset_2 <= dictAndPrefixLength);
+    }
+
+    /* Match Loop */
+#if defined(__GNUC__) && defined(__x86_64__)
+    /* I've measured random a 5% speed loss on levels 5 & 6 (greedy) when the
+     * code alignment is perturbed. To fix the instability align the loop on 32-bytes.
+     */
+    __asm__(".p2align 5");
+#endif
+    while (ip < ilimit) {
+        size_t matchLength=0;
+        size_t offset=0;
+        const BYTE* start=ip+1;
+
+        /* check repCode */
+        if (dictMode == ZSTD_dictMatchState) {
+            const U32 repIndex = (U32)(ip - base) + 1 - offset_1;
+            const BYTE* repMatch = (dictMode == ZSTD_dictMatchState
+                                && repIndex < prefixLowestIndex) ?
+                                   dictBase + (repIndex - dictIndexDelta) :
+                                   base + repIndex;
+            if (((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
+                && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
+                const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
+                matchLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, prefixLowest) + 4;
+                if (depth==0) goto _storeSequence;
+            }
+        }
+        if ( dictMode == ZSTD_noDict
+          && ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1)))) {
+            matchLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
+            if (depth==0) goto _storeSequence;
+        }
+
+        /* first search (depth 0) */
+        {   size_t offsetFound = 999999999;
+            size_t const ml2 = searchMax(ms, ip, iend, &offsetFound);
+            if (ml2 > matchLength)
+                matchLength = ml2, start = ip, offset=offsetFound;
+        }
+
+        if (matchLength < 4) {
+            ip += ((ip-anchor) >> kSearchStrength) + 1;   /* jump faster over incompressible sections */
+            continue;
+        }
+
+        /* let's try to find a better solution */
+        if (depth>=1)
+        while (ip<ilimit) {
+            ip ++;
+            if ( (dictMode == ZSTD_noDict)
+              && (offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
+                size_t const mlRep = ZSTD_count(ip+4, ip+4-offset_1, iend) + 4;
+                int const gain2 = (int)(mlRep * 3);
+                int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
+                if ((mlRep >= 4) && (gain2 > gain1))
+                    matchLength = mlRep, offset = 0, start = ip;
+            }
+            if (dictMode == ZSTD_dictMatchState) {
+                const U32 repIndex = (U32)(ip - base) - offset_1;
+                const BYTE* repMatch = repIndex < prefixLowestIndex ?
+                               dictBase + (repIndex - dictIndexDelta) :
+                               base + repIndex;
+                if (((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
+                    && (MEM_read32(repMatch) == MEM_read32(ip)) ) {
+                    const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
+                    size_t const mlRep = ZSTD_count_2segments(ip+4, repMatch+4, iend, repMatchEnd, prefixLowest) + 4;
+                    int const gain2 = (int)(mlRep * 3);
+                    int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
+                    if ((mlRep >= 4) && (gain2 > gain1))
+                        matchLength = mlRep, offset = 0, start = ip;
+                }
+            }
+            {   size_t offset2=999999999;
+                size_t const ml2 = searchMax(ms, ip, iend, &offset2);
+                int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+                int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
+                if ((ml2 >= 4) && (gain2 > gain1)) {
+                    matchLength = ml2, offset = offset2, start = ip;
+                    continue;   /* search a better one */
+            }   }
+
+            /* let's find an even better one */
+            if ((depth==2) && (ip<ilimit)) {
+                ip ++;
+                if ( (dictMode == ZSTD_noDict)
+                  && (offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
+                    size_t const mlRep = ZSTD_count(ip+4, ip+4-offset_1, iend) + 4;
+                    int const gain2 = (int)(mlRep * 4);
+                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
+                    if ((mlRep >= 4) && (gain2 > gain1))
+                        matchLength = mlRep, offset = 0, start = ip;
+                }
+                if (dictMode == ZSTD_dictMatchState) {
+                    const U32 repIndex = (U32)(ip - base) - offset_1;
+                    const BYTE* repMatch = repIndex < prefixLowestIndex ?
+                                   dictBase + (repIndex - dictIndexDelta) :
+                                   base + repIndex;
+                    if (((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
+                        && (MEM_read32(repMatch) == MEM_read32(ip)) ) {
+                        const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
+                        size_t const mlRep = ZSTD_count_2segments(ip+4, repMatch+4, iend, repMatchEnd, prefixLowest) + 4;
+                        int const gain2 = (int)(mlRep * 4);
+                        int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
+                        if ((mlRep >= 4) && (gain2 > gain1))
+                            matchLength = mlRep, offset = 0, start = ip;
+                    }
+                }
+                {   size_t offset2=999999999;
+                    size_t const ml2 = searchMax(ms, ip, iend, &offset2);
+                    int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
+                    if ((ml2 >= 4) && (gain2 > gain1)) {
+                        matchLength = ml2, offset = offset2, start = ip;
+                        continue;
+            }   }   }
+            break;  /* nothing found : store previous solution */
+        }
+
+        /* NOTE:
+         * start[-offset+ZSTD_REP_MOVE-1] is undefined behavior.
+         * (-offset+ZSTD_REP_MOVE-1) is unsigned, and is added to start, which
+         * overflows the pointer, which is undefined behavior.
+         */
+        /* catch up */
+        if (offset) {
+            if (dictMode == ZSTD_noDict) {
+                while ( ((start > anchor) & (start - (offset-ZSTD_REP_MOVE) > prefixLowest))
+                     && (start[-1] == (start-(offset-ZSTD_REP_MOVE))[-1]) )  /* only search for offset within prefix */
+                    { start--; matchLength++; }
+            }
+            if (dictMode == ZSTD_dictMatchState) {
+                U32 const matchIndex = (U32)((start-base) - (offset - ZSTD_REP_MOVE));
+                const BYTE* match = (matchIndex < prefixLowestIndex) ? dictBase + matchIndex - dictIndexDelta : base + matchIndex;
+                const BYTE* const mStart = (matchIndex < prefixLowestIndex) ? dictLowest : prefixLowest;
+                while ((start>anchor) && (match>mStart) && (start[-1] == match[-1])) { start--; match--; matchLength++; }  /* catch up */
+            }
+            offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
+        }
+        /* store sequence */
+_storeSequence:
+        {   size_t const litLength = start - anchor;
+            ZSTD_storeSeq(seqStore, litLength, anchor, iend, (U32)offset, matchLength-MINMATCH);
+            anchor = ip = start + matchLength;
+        }
+
+        /* check immediate repcode */
+        if (dictMode == ZSTD_dictMatchState) {
+            while (ip <= ilimit) {
+                U32 const current2 = (U32)(ip-base);
+                U32 const repIndex = current2 - offset_2;
+                const BYTE* repMatch = dictMode == ZSTD_dictMatchState
+                    && repIndex < prefixLowestIndex ?
+                        dictBase - dictIndexDelta + repIndex :
+                        base + repIndex;
+                if ( ((U32)((prefixLowestIndex-1) - (U32)repIndex) >= 3 /* intentional overflow */)
+                   && (MEM_read32(repMatch) == MEM_read32(ip)) ) {
+                    const BYTE* const repEnd2 = repIndex < prefixLowestIndex ? dictEnd : iend;
+                    matchLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd2, prefixLowest) + 4;
+                    offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset;   /* swap offset_2 <=> offset_1 */
+                    ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, matchLength-MINMATCH);
+                    ip += matchLength;
+                    anchor = ip;
+                    continue;
+                }
+                break;
+            }
+        }
+
+        if (dictMode == ZSTD_noDict) {
+            while ( ((ip <= ilimit) & (offset_2>0))
+                 && (MEM_read32(ip) == MEM_read32(ip - offset_2)) ) {
+                /* store sequence */
+                matchLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
+                offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset; /* swap repcodes */
+                ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, matchLength-MINMATCH);
+                ip += matchLength;
+                anchor = ip;
+                continue;   /* faster when present ... (?) */
+    }   }   }
+
+    /* Save reps for next block */
+    rep[0] = offset_1 ? offset_1 : savedOffset;
+    rep[1] = offset_2 ? offset_2 : savedOffset;
+
+    /* Return the last literals size */
+    return (size_t)(iend - anchor);
+}
+
+
+size_t ZSTD_compressBlock_btlazy2(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_binaryTree, 2, ZSTD_noDict);
+}
+
+size_t ZSTD_compressBlock_lazy2(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 2, ZSTD_noDict);
+}
+
+size_t ZSTD_compressBlock_lazy(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 1, ZSTD_noDict);
+}
+
+size_t ZSTD_compressBlock_greedy(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 0, ZSTD_noDict);
+}
+
+size_t ZSTD_compressBlock_btlazy2_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_binaryTree, 2, ZSTD_dictMatchState);
+}
+
+size_t ZSTD_compressBlock_lazy2_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 2, ZSTD_dictMatchState);
+}
+
+size_t ZSTD_compressBlock_lazy_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 1, ZSTD_dictMatchState);
+}
+
+size_t ZSTD_compressBlock_greedy_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 0, ZSTD_dictMatchState);
+}
+
+
+FORCE_INLINE_TEMPLATE
+size_t ZSTD_compressBlock_lazy_extDict_generic(
+                        ZSTD_matchState_t* ms, seqStore_t* seqStore,
+                        U32 rep[ZSTD_REP_NUM],
+                        const void* src, size_t srcSize,
+                        const searchMethod_e searchMethod, const U32 depth)
+{
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    const BYTE* const base = ms->window.base;
+    const U32 dictLimit = ms->window.dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const BYTE* const dictBase = ms->window.dictBase;
+    const BYTE* const dictEnd  = dictBase + dictLimit;
+    const BYTE* const dictStart  = dictBase + ms->window.lowLimit;
+    const U32 windowLog = ms->cParams.windowLog;
+
+    typedef size_t (*searchMax_f)(
+                        ZSTD_matchState_t* ms,
+                        const BYTE* ip, const BYTE* iLimit, size_t* offsetPtr);
+    searchMax_f searchMax = searchMethod==search_binaryTree ? ZSTD_BtFindBestMatch_extDict_selectMLS : ZSTD_HcFindBestMatch_extDict_selectMLS;
+
+    U32 offset_1 = rep[0], offset_2 = rep[1];
+
+    DEBUGLOG(5, "ZSTD_compressBlock_lazy_extDict_generic");
+
+    /* init */
+    ip += (ip == prefixStart);
+
+    /* Match Loop */
+#if defined(__GNUC__) && defined(__x86_64__)
+    /* I've measured random a 5% speed loss on levels 5 & 6 (greedy) when the
+     * code alignment is perturbed. To fix the instability align the loop on 32-bytes.
+     */
+    __asm__(".p2align 5");
+#endif
+    while (ip < ilimit) {
+        size_t matchLength=0;
+        size_t offset=0;
+        const BYTE* start=ip+1;
+        U32 current = (U32)(ip-base);
+
+        /* check repCode */
+        {   const U32 windowLow = ZSTD_getLowestMatchIndex(ms, current+1, windowLog);
+            const U32 repIndex = (U32)(current+1 - offset_1);
+            const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+            const BYTE* const repMatch = repBase + repIndex;
+            if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > windowLow))   /* intentional overflow */
+            if (MEM_read32(ip+1) == MEM_read32(repMatch)) {
+                /* repcode detected we should take it */
+                const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                matchLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repEnd, prefixStart) + 4;
+                if (depth==0) goto _storeSequence;
+        }   }
+
+        /* first search (depth 0) */
+        {   size_t offsetFound = 999999999;
+            size_t const ml2 = searchMax(ms, ip, iend, &offsetFound);
+            if (ml2 > matchLength)
+                matchLength = ml2, start = ip, offset=offsetFound;
+        }
+
+         if (matchLength < 4) {
+            ip += ((ip-anchor) >> kSearchStrength) + 1;   /* jump faster over incompressible sections */
+            continue;
+        }
+
+        /* let's try to find a better solution */
+        if (depth>=1)
+        while (ip<ilimit) {
+            ip ++;
+            current++;
+            /* check repCode */
+            if (offset) {
+                const U32 windowLow = ZSTD_getLowestMatchIndex(ms, current, windowLog);
+                const U32 repIndex = (U32)(current - offset_1);
+                const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+                const BYTE* const repMatch = repBase + repIndex;
+                if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > windowLow))  /* intentional overflow */
+                if (MEM_read32(ip) == MEM_read32(repMatch)) {
+                    /* repcode detected */
+                    const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                    size_t const repLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
+                    int const gain2 = (int)(repLength * 3);
+                    int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
+                    if ((repLength >= 4) && (gain2 > gain1))
+                        matchLength = repLength, offset = 0, start = ip;
+            }   }
+
+            /* search match, depth 1 */
+            {   size_t offset2=999999999;
+                size_t const ml2 = searchMax(ms, ip, iend, &offset2);
+                int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+                int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
+                if ((ml2 >= 4) && (gain2 > gain1)) {
+                    matchLength = ml2, offset = offset2, start = ip;
+                    continue;   /* search a better one */
+            }   }
+
+            /* let's find an even better one */
+            if ((depth==2) && (ip<ilimit)) {
+                ip ++;
+                current++;
+                /* check repCode */
+                if (offset) {
+                    const U32 windowLow = ZSTD_getLowestMatchIndex(ms, current, windowLog);
+                    const U32 repIndex = (U32)(current - offset_1);
+                    const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+                    const BYTE* const repMatch = repBase + repIndex;
+                    if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > windowLow))  /* intentional overflow */
+                    if (MEM_read32(ip) == MEM_read32(repMatch)) {
+                        /* repcode detected */
+                        const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                        size_t const repLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
+                        int const gain2 = (int)(repLength * 4);
+                        int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
+                        if ((repLength >= 4) && (gain2 > gain1))
+                            matchLength = repLength, offset = 0, start = ip;
+                }   }
+
+                /* search match, depth 2 */
+                {   size_t offset2=999999999;
+                    size_t const ml2 = searchMax(ms, ip, iend, &offset2);
+                    int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
+                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
+                    if ((ml2 >= 4) && (gain2 > gain1)) {
+                        matchLength = ml2, offset = offset2, start = ip;
+                        continue;
+            }   }   }
+            break;  /* nothing found : store previous solution */
+        }
+
+        /* catch up */
+        if (offset) {
+            U32 const matchIndex = (U32)((start-base) - (offset - ZSTD_REP_MOVE));
+            const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
+            const BYTE* const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
+            while ((start>anchor) && (match>mStart) && (start[-1] == match[-1])) { start--; match--; matchLength++; }  /* catch up */
+            offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
+        }
+
+        /* store sequence */
+_storeSequence:
+        {   size_t const litLength = start - anchor;
+            ZSTD_storeSeq(seqStore, litLength, anchor, iend, (U32)offset, matchLength-MINMATCH);
+            anchor = ip = start + matchLength;
+        }
+
+        /* check immediate repcode */
+        while (ip <= ilimit) {
+            const U32 repCurrent = (U32)(ip-base);
+            const U32 windowLow = ZSTD_getLowestMatchIndex(ms, repCurrent, windowLog);
+            const U32 repIndex = repCurrent - offset_2;
+            const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
+            const BYTE* const repMatch = repBase + repIndex;
+            if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > windowLow))  /* intentional overflow */
+            if (MEM_read32(ip) == MEM_read32(repMatch)) {
+                /* repcode detected we should take it */
+                const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
+                matchLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
+                offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset;   /* swap offset history */
+                ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, matchLength-MINMATCH);
+                ip += matchLength;
+                anchor = ip;
+                continue;   /* faster when present ... (?) */
+            }
+            break;
+    }   }
+
+    /* Save reps for next block */
+    rep[0] = offset_1;
+    rep[1] = offset_2;
+
+    /* Return the last literals size */
+    return (size_t)(iend - anchor);
+}
+
+
+size_t ZSTD_compressBlock_greedy_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_lazy_extDict_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 0);
+}
+
+size_t ZSTD_compressBlock_lazy_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+
+{
+    return ZSTD_compressBlock_lazy_extDict_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 1);
+}
+
+size_t ZSTD_compressBlock_lazy2_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+
+{
+    return ZSTD_compressBlock_lazy_extDict_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 2);
+}
+
+size_t ZSTD_compressBlock_btlazy2_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize)
+
+{
+    return ZSTD_compressBlock_lazy_extDict_generic(ms, seqStore, rep, src, srcSize, search_binaryTree, 2);
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_ldm.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_ldm.cpp
new file mode 100644
index 0000000000..2a251101fa
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_ldm.cpp
@@ -0,0 +1,623 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#include "zstd/compress/zstd_ldm.h"
+
+#include "zstd/common/debug.h"
+#include "zstd/compress/zstd_fast.h"          /* ZSTD_fillHashTable() */
+#include "zstd/compress/zstd_double_fast.h"   /* ZSTD_fillDoubleHashTable() */
+
+#define LDM_BUCKET_SIZE_LOG 3
+#define LDM_MIN_MATCH_LENGTH 64
+#define LDM_HASH_RLOG 7
+#define LDM_HASH_CHAR_OFFSET 10
+
+namespace lbug_zstd {
+
+void ZSTD_ldm_adjustParameters(ldmParams_t* params,
+                               ZSTD_compressionParameters const* cParams)
+{
+    params->windowLog = cParams->windowLog;
+    ZSTD_STATIC_ASSERT(LDM_BUCKET_SIZE_LOG <= ZSTD_LDM_BUCKETSIZELOG_MAX);
+    DEBUGLOG(4, "ZSTD_ldm_adjustParameters");
+    if (!params->bucketSizeLog) params->bucketSizeLog = LDM_BUCKET_SIZE_LOG;
+    if (!params->minMatchLength) params->minMatchLength = LDM_MIN_MATCH_LENGTH;
+    if (cParams->strategy >= ZSTD_btopt) {
+      /* Get out of the way of the optimal parser */
+      U32 const minMatch = MAX(cParams->targetLength, params->minMatchLength);
+      assert(minMatch >= ZSTD_LDM_MINMATCH_MIN);
+      assert(minMatch <= ZSTD_LDM_MINMATCH_MAX);
+      params->minMatchLength = minMatch;
+    }
+    if (params->hashLog == 0) {
+        params->hashLog = MAX(ZSTD_HASHLOG_MIN, params->windowLog - LDM_HASH_RLOG);
+        assert(params->hashLog <= ZSTD_HASHLOG_MAX);
+    }
+    if (params->hashRateLog == 0) {
+        params->hashRateLog = params->windowLog < params->hashLog
+                                   ? 0
+                                   : params->windowLog - params->hashLog;
+    }
+    params->bucketSizeLog = MIN(params->bucketSizeLog, params->hashLog);
+}
+
+size_t ZSTD_ldm_getTableSize(ldmParams_t params)
+{
+    size_t const ldmHSize = ((size_t)1) << params.hashLog;
+    size_t const ldmBucketSizeLog = MIN(params.bucketSizeLog, params.hashLog);
+    size_t const ldmBucketSize = ((size_t)1) << (params.hashLog - ldmBucketSizeLog);
+    size_t const totalSize = ZSTD_cwksp_alloc_size(ldmBucketSize)
+                           + ZSTD_cwksp_alloc_size(ldmHSize * sizeof(ldmEntry_t));
+    return params.enableLdm ? totalSize : 0;
+}
+
+size_t ZSTD_ldm_getMaxNbSeq(ldmParams_t params, size_t maxChunkSize)
+{
+    return params.enableLdm ? (maxChunkSize / params.minMatchLength) : 0;
+}
+
+/** ZSTD_ldm_getSmallHash() :
+ *  numBits should be <= 32
+ *  If numBits==0, returns 0.
+ *  @return : the most significant numBits of value. */
+static U32 ZSTD_ldm_getSmallHash(U64 value, U32 numBits)
+{
+    assert(numBits <= 32);
+    return numBits == 0 ? 0 : (U32)(value >> (64 - numBits));
+}
+
+/** ZSTD_ldm_getChecksum() :
+ *  numBitsToDiscard should be <= 32
+ *  @return : the next most significant 32 bits after numBitsToDiscard */
+static U32 ZSTD_ldm_getChecksum(U64 hash, U32 numBitsToDiscard)
+{
+    assert(numBitsToDiscard <= 32);
+    return (hash >> (64 - 32 - numBitsToDiscard)) & 0xFFFFFFFF;
+}
+
+/** ZSTD_ldm_getTag() ;
+ *  Given the hash, returns the most significant numTagBits bits
+ *  after (32 + hbits) bits.
+ *
+ *  If there are not enough bits remaining, return the last
+ *  numTagBits bits. */
+static U32 ZSTD_ldm_getTag(U64 hash, U32 hbits, U32 numTagBits)
+{
+    assert(numTagBits < 32 && hbits <= 32);
+    if (32 - hbits < numTagBits) {
+        return hash & (((U32)1 << numTagBits) - 1);
+    } else {
+        return (hash >> (32 - hbits - numTagBits)) & (((U32)1 << numTagBits) - 1);
+    }
+}
+
+/** ZSTD_ldm_getBucket() :
+ *  Returns a pointer to the start of the bucket associated with hash. */
+static ldmEntry_t* ZSTD_ldm_getBucket(
+        ldmState_t* ldmState, size_t hash, ldmParams_t const ldmParams)
+{
+    return ldmState->hashTable + (hash << ldmParams.bucketSizeLog);
+}
+
+/** ZSTD_ldm_insertEntry() :
+ *  Insert the entry with corresponding hash into the hash table */
+static void ZSTD_ldm_insertEntry(ldmState_t* ldmState,
+                                 size_t const hash, const ldmEntry_t entry,
+                                 ldmParams_t const ldmParams)
+{
+    BYTE* const bucketOffsets = ldmState->bucketOffsets;
+    *(ZSTD_ldm_getBucket(ldmState, hash, ldmParams) + bucketOffsets[hash]) = entry;
+    bucketOffsets[hash]++;
+    bucketOffsets[hash] &= ((U32)1 << ldmParams.bucketSizeLog) - 1;
+}
+
+/** ZSTD_ldm_makeEntryAndInsertByTag() :
+ *
+ *  Gets the small hash, checksum, and tag from the rollingHash.
+ *
+ *  If the tag matches (1 << ldmParams.hashRateLog)-1, then
+ *  creates an ldmEntry from the offset, and inserts it into the hash table.
+ *
+ *  hBits is the length of the small hash, which is the most significant hBits
+ *  of rollingHash. The checksum is the next 32 most significant bits, followed
+ *  by ldmParams.hashRateLog bits that make up the tag. */
+static void ZSTD_ldm_makeEntryAndInsertByTag(ldmState_t* ldmState,
+                                             U64 const rollingHash,
+                                             U32 const hBits,
+                                             U32 const offset,
+                                             ldmParams_t const ldmParams)
+{
+    U32 const tag = ZSTD_ldm_getTag(rollingHash, hBits, ldmParams.hashRateLog);
+    U32 const tagMask = ((U32)1 << ldmParams.hashRateLog) - 1;
+    if (tag == tagMask) {
+        U32 const hash = ZSTD_ldm_getSmallHash(rollingHash, hBits);
+        U32 const checksum = ZSTD_ldm_getChecksum(rollingHash, hBits);
+        ldmEntry_t entry;
+        entry.offset = offset;
+        entry.checksum = checksum;
+        ZSTD_ldm_insertEntry(ldmState, hash, entry, ldmParams);
+    }
+}
+
+/** ZSTD_ldm_countBackwardsMatch() :
+ *  Returns the number of bytes that match backwards before pIn and pMatch.
+ *
+ *  We count only bytes where pMatch >= pBase and pIn >= pAnchor. */
+static size_t ZSTD_ldm_countBackwardsMatch(
+            const BYTE* pIn, const BYTE* pAnchor,
+            const BYTE* pMatch, const BYTE* pBase)
+{
+    size_t matchLength = 0;
+    while (pIn > pAnchor && pMatch > pBase && pIn[-1] == pMatch[-1]) {
+        pIn--;
+        pMatch--;
+        matchLength++;
+    }
+    return matchLength;
+}
+
+/** ZSTD_ldm_fillFastTables() :
+ *
+ *  Fills the relevant tables for the ZSTD_fast and ZSTD_dfast strategies.
+ *  This is similar to ZSTD_loadDictionaryContent.
+ *
+ *  The tables for the other strategies are filled within their
+ *  block compressors. */
+static size_t ZSTD_ldm_fillFastTables(ZSTD_matchState_t* ms,
+                                      void const* end)
+{
+    const BYTE* const iend = (const BYTE*)end;
+
+    switch(ms->cParams.strategy)
+    {
+    case ZSTD_fast:
+        ZSTD_fillHashTable(ms, iend, ZSTD_dtlm_fast);
+        break;
+
+    case ZSTD_dfast:
+        ZSTD_fillDoubleHashTable(ms, iend, ZSTD_dtlm_fast);
+        break;
+
+    case ZSTD_greedy:
+    case ZSTD_lazy:
+    case ZSTD_lazy2:
+    case ZSTD_btlazy2:
+    case ZSTD_btopt:
+    case ZSTD_btultra:
+    case ZSTD_btultra2:
+        break;
+    default:
+        assert(0);  /* not possible : not a valid strategy id */
+    }
+
+    return 0;
+}
+
+/** ZSTD_ldm_fillLdmHashTable() :
+ *
+ *  Fills hashTable from (lastHashed + 1) to iend (non-inclusive).
+ *  lastHash is the rolling hash that corresponds to lastHashed.
+ *
+ *  Returns the rolling hash corresponding to position iend-1. */
+static U64 ZSTD_ldm_fillLdmHashTable(ldmState_t* state,
+                                     U64 lastHash, const BYTE* lastHashed,
+                                     const BYTE* iend, const BYTE* base,
+                                     U32 hBits, ldmParams_t const ldmParams)
+{
+    U64 rollingHash = lastHash;
+    const BYTE* cur = lastHashed + 1;
+
+    while (cur < iend) {
+        rollingHash = ZSTD_rollingHash_rotate(rollingHash, cur[-1],
+                                              cur[ldmParams.minMatchLength-1],
+                                              state->hashPower);
+        ZSTD_ldm_makeEntryAndInsertByTag(state,
+                                         rollingHash, hBits,
+                                         (U32)(cur - base), ldmParams);
+        ++cur;
+    }
+    return rollingHash;
+}
+
+void ZSTD_ldm_fillHashTable(
+            ldmState_t* state, const BYTE* ip,
+            const BYTE* iend, ldmParams_t const* params)
+{
+    DEBUGLOG(5, "ZSTD_ldm_fillHashTable");
+    if ((size_t)(iend - ip) >= params->minMatchLength) {
+        U64 startingHash = ZSTD_rollingHash_compute(ip, params->minMatchLength);
+        ZSTD_ldm_fillLdmHashTable(
+            state, startingHash, ip, iend - params->minMatchLength, state->window.base,
+            params->hashLog - params->bucketSizeLog,
+            *params);
+    }
+}
+
+
+/** ZSTD_ldm_limitTableUpdate() :
+ *
+ *  Sets cctx->nextToUpdate to a position corresponding closer to anchor
+ *  if it is far way
+ *  (after a long match, only update tables a limited amount). */
+static void ZSTD_ldm_limitTableUpdate(ZSTD_matchState_t* ms, const BYTE* anchor)
+{
+    U32 const current = (U32)(anchor - ms->window.base);
+    if (current > ms->nextToUpdate + 1024) {
+        ms->nextToUpdate =
+            current - MIN(512, current - ms->nextToUpdate - 1024);
+    }
+}
+
+static size_t ZSTD_ldm_generateSequences_internal(
+        ldmState_t* ldmState, rawSeqStore_t* rawSeqStore,
+        ldmParams_t const* params, void const* src, size_t srcSize)
+{
+    /* LDM parameters */
+    int const extDict = ZSTD_window_hasExtDict(ldmState->window);
+    U32 const minMatchLength = params->minMatchLength;
+    U64 const hashPower = ldmState->hashPower;
+    U32 const hBits = params->hashLog - params->bucketSizeLog;
+    U32 const ldmBucketSize = 1U << params->bucketSizeLog;
+    U32 const hashRateLog = params->hashRateLog;
+    U32 const ldmTagMask = (1U << params->hashRateLog) - 1;
+    /* Prefix and extDict parameters */
+    U32 const dictLimit = ldmState->window.dictLimit;
+    U32 const lowestIndex = extDict ? ldmState->window.lowLimit : dictLimit;
+    BYTE const* const base = ldmState->window.base;
+    BYTE const* const dictBase = extDict ? ldmState->window.dictBase : NULL;
+    BYTE const* const dictStart = extDict ? dictBase + lowestIndex : NULL;
+    BYTE const* const dictEnd = extDict ? dictBase + dictLimit : NULL;
+    BYTE const* const lowPrefixPtr = base + dictLimit;
+    /* Input bounds */
+    BYTE const* const istart = (BYTE const*)src;
+    BYTE const* const iend = istart + srcSize;
+    BYTE const* const ilimit = iend - MAX(minMatchLength, HASH_READ_SIZE);
+    /* Input positions */
+    BYTE const* anchor = istart;
+    BYTE const* ip = istart;
+    /* Rolling hash */
+    BYTE const* lastHashed = NULL;
+    U64 rollingHash = 0;
+
+    while (ip <= ilimit) {
+        size_t mLength;
+        U32 const current = (U32)(ip - base);
+        size_t forwardMatchLength = 0, backwardMatchLength = 0;
+        ldmEntry_t* bestEntry = NULL;
+        if (ip != istart) {
+            rollingHash = ZSTD_rollingHash_rotate(rollingHash, lastHashed[0],
+                                                  lastHashed[minMatchLength],
+                                                  hashPower);
+        } else {
+            rollingHash = ZSTD_rollingHash_compute(ip, minMatchLength);
+        }
+        lastHashed = ip;
+
+        /* Do not insert and do not look for a match */
+        if (ZSTD_ldm_getTag(rollingHash, hBits, hashRateLog) != ldmTagMask) {
+           ip++;
+           continue;
+        }
+
+        /* Get the best entry and compute the match lengths */
+        {
+            ldmEntry_t* const bucket =
+                ZSTD_ldm_getBucket(ldmState,
+                                   ZSTD_ldm_getSmallHash(rollingHash, hBits),
+                                   *params);
+            ldmEntry_t* cur;
+            size_t bestMatchLength = 0;
+            U32 const checksum = ZSTD_ldm_getChecksum(rollingHash, hBits);
+
+            for (cur = bucket; cur < bucket + ldmBucketSize; ++cur) {
+                size_t curForwardMatchLength, curBackwardMatchLength,
+                       curTotalMatchLength;
+                if (cur->checksum != checksum || cur->offset <= lowestIndex) {
+                    continue;
+                }
+                if (extDict) {
+                    BYTE const* const curMatchBase =
+                        cur->offset < dictLimit ? dictBase : base;
+                    BYTE const* const pMatch = curMatchBase + cur->offset;
+                    BYTE const* const matchEnd =
+                        cur->offset < dictLimit ? dictEnd : iend;
+                    BYTE const* const lowMatchPtr =
+                        cur->offset < dictLimit ? dictStart : lowPrefixPtr;
+
+                    curForwardMatchLength = ZSTD_count_2segments(
+                                                ip, pMatch, iend,
+                                                matchEnd, lowPrefixPtr);
+                    if (curForwardMatchLength < minMatchLength) {
+                        continue;
+                    }
+                    curBackwardMatchLength =
+                        ZSTD_ldm_countBackwardsMatch(ip, anchor, pMatch,
+                                                     lowMatchPtr);
+                    curTotalMatchLength = curForwardMatchLength +
+                                          curBackwardMatchLength;
+                } else { /* !extDict */
+                    BYTE const* const pMatch = base + cur->offset;
+                    curForwardMatchLength = ZSTD_count(ip, pMatch, iend);
+                    if (curForwardMatchLength < minMatchLength) {
+                        continue;
+                    }
+                    curBackwardMatchLength =
+                        ZSTD_ldm_countBackwardsMatch(ip, anchor, pMatch,
+                                                     lowPrefixPtr);
+                    curTotalMatchLength = curForwardMatchLength +
+                                          curBackwardMatchLength;
+                }
+
+                if (curTotalMatchLength > bestMatchLength) {
+                    bestMatchLength = curTotalMatchLength;
+                    forwardMatchLength = curForwardMatchLength;
+                    backwardMatchLength = curBackwardMatchLength;
+                    bestEntry = cur;
+                }
+            }
+        }
+
+        /* No match found -- continue searching */
+        if (bestEntry == NULL) {
+            ZSTD_ldm_makeEntryAndInsertByTag(ldmState, rollingHash,
+                                             hBits, current,
+                                             *params);
+            ip++;
+            continue;
+        }
+
+        /* Match found */
+        mLength = forwardMatchLength + backwardMatchLength;
+        ip -= backwardMatchLength;
+
+        {
+            /* Store the sequence:
+             * ip = current - backwardMatchLength
+             * The match is at (bestEntry->offset - backwardMatchLength)
+             */
+            U32 const matchIndex = bestEntry->offset;
+            U32 const offset = current - matchIndex;
+            rawSeq* const seq = rawSeqStore->seq + rawSeqStore->size;
+
+            /* Out of sequence storage */
+            if (rawSeqStore->size == rawSeqStore->capacity)
+                return ERROR(dstSize_tooSmall);
+            seq->litLength = (U32)(ip - anchor);
+            seq->matchLength = (U32)mLength;
+            seq->offset = offset;
+            rawSeqStore->size++;
+        }
+
+        /* Insert the current entry into the hash table */
+        ZSTD_ldm_makeEntryAndInsertByTag(ldmState, rollingHash, hBits,
+                                         (U32)(lastHashed - base),
+                                         *params);
+
+        assert(ip + backwardMatchLength == lastHashed);
+
+        /* Fill the hash table from lastHashed+1 to ip+mLength*/
+        /* Heuristic: don't need to fill the entire table at end of block */
+        if (ip + mLength <= ilimit) {
+            rollingHash = ZSTD_ldm_fillLdmHashTable(
+                              ldmState, rollingHash, lastHashed,
+                              ip + mLength, base, hBits, *params);
+            lastHashed = ip + mLength - 1;
+        }
+        ip += mLength;
+        anchor = ip;
+    }
+    return iend - anchor;
+}
+
+/*! ZSTD_ldm_reduceTable() :
+ *  reduce table indexes by `reducerValue` */
+static void ZSTD_ldm_reduceTable(ldmEntry_t* const table, U32 const size,
+                                 U32 const reducerValue)
+{
+    U32 u;
+    for (u = 0; u < size; u++) {
+        if (table[u].offset < reducerValue) table[u].offset = 0;
+        else table[u].offset -= reducerValue;
+    }
+}
+
+size_t ZSTD_ldm_generateSequences(
+        ldmState_t* ldmState, rawSeqStore_t* sequences,
+        ldmParams_t const* params, void const* src, size_t srcSize)
+{
+    U32 const maxDist = 1U << params->windowLog;
+    BYTE const* const istart = (BYTE const*)src;
+    BYTE const* const iend = istart + srcSize;
+    size_t const kMaxChunkSize = 1 << 20;
+    size_t const nbChunks = (srcSize / kMaxChunkSize) + ((srcSize % kMaxChunkSize) != 0);
+    size_t chunk;
+    size_t leftoverSize = 0;
+
+    assert(ZSTD_CHUNKSIZE_MAX >= kMaxChunkSize);
+    /* Check that ZSTD_window_update() has been called for this chunk prior
+     * to passing it to this function.
+     */
+    assert(ldmState->window.nextSrc >= (BYTE const*)src + srcSize);
+    /* The input could be very large (in zstdmt), so it must be broken up into
+     * chunks to enforce the maximum distance and handle overflow correction.
+     */
+    assert(sequences->pos <= sequences->size);
+    assert(sequences->size <= sequences->capacity);
+    for (chunk = 0; chunk < nbChunks && sequences->size < sequences->capacity; ++chunk) {
+        BYTE const* const chunkStart = istart + chunk * kMaxChunkSize;
+        size_t const remaining = (size_t)(iend - chunkStart);
+        BYTE const *const chunkEnd =
+            (remaining < kMaxChunkSize) ? iend : chunkStart + kMaxChunkSize;
+        size_t const chunkSize = chunkEnd - chunkStart;
+        size_t newLeftoverSize;
+        size_t const prevSize = sequences->size;
+
+        assert(chunkStart < iend);
+        /* 1. Perform overflow correction if necessary. */
+        if (ZSTD_window_needOverflowCorrection(ldmState->window, chunkEnd)) {
+            U32 const ldmHSize = 1U << params->hashLog;
+            U32 const correction = ZSTD_window_correctOverflow(
+                &ldmState->window, /* cycleLog */ 0, maxDist, chunkStart);
+            ZSTD_ldm_reduceTable(ldmState->hashTable, ldmHSize, correction);
+            /* invalidate dictionaries on overflow correction */
+            ldmState->loadedDictEnd = 0;
+        }
+        /* 2. We enforce the maximum offset allowed.
+         *
+         * kMaxChunkSize should be small enough that we don't lose too much of
+         * the window through early invalidation.
+         * TODO: * Test the chunk size.
+         *       * Try invalidation after the sequence generation and test the
+         *         the offset against maxDist directly.
+         *
+         * NOTE: Because of dictionaries + sequence splitting we MUST make sure
+         * that any offset used is valid at the END of the sequence, since it may
+         * be split into two sequences. This condition holds when using
+         * ZSTD_window_enforceMaxDist(), but if we move to checking offsets
+         * against maxDist directly, we'll have to carefully handle that case.
+         */
+        ZSTD_window_enforceMaxDist(&ldmState->window, chunkEnd, maxDist, &ldmState->loadedDictEnd, NULL);
+        /* 3. Generate the sequences for the chunk, and get newLeftoverSize. */
+        newLeftoverSize = ZSTD_ldm_generateSequences_internal(
+            ldmState, sequences, params, chunkStart, chunkSize);
+        if (ZSTD_isError(newLeftoverSize))
+            return newLeftoverSize;
+        /* 4. We add the leftover literals from previous iterations to the first
+         *    newly generated sequence, or add the `newLeftoverSize` if none are
+         *    generated.
+         */
+        /* Prepend the leftover literals from the last call */
+        if (prevSize < sequences->size) {
+            sequences->seq[prevSize].litLength += (U32)leftoverSize;
+            leftoverSize = newLeftoverSize;
+        } else {
+            assert(newLeftoverSize == chunkSize);
+            leftoverSize += chunkSize;
+        }
+    }
+    return 0;
+}
+
+void ZSTD_ldm_skipSequences(rawSeqStore_t* rawSeqStore, size_t srcSize, U32 const minMatch) {
+    while (srcSize > 0 && rawSeqStore->pos < rawSeqStore->size) {
+        rawSeq* seq = rawSeqStore->seq + rawSeqStore->pos;
+        if (srcSize <= seq->litLength) {
+            /* Skip past srcSize literals */
+            seq->litLength -= (U32)srcSize;
+            return;
+        }
+        srcSize -= seq->litLength;
+        seq->litLength = 0;
+        if (srcSize < seq->matchLength) {
+            /* Skip past the first srcSize of the match */
+            seq->matchLength -= (U32)srcSize;
+            if (seq->matchLength < minMatch) {
+                /* The match is too short, omit it */
+                if (rawSeqStore->pos + 1 < rawSeqStore->size) {
+                    seq[1].litLength += seq[0].matchLength;
+                }
+                rawSeqStore->pos++;
+            }
+            return;
+        }
+        srcSize -= seq->matchLength;
+        seq->matchLength = 0;
+        rawSeqStore->pos++;
+    }
+}
+
+/**
+ * If the sequence length is longer than remaining then the sequence is split
+ * between this block and the next.
+ *
+ * Returns the current sequence to handle, or if the rest of the block should
+ * be literals, it returns a sequence with offset == 0.
+ */
+static rawSeq maybeSplitSequence(rawSeqStore_t* rawSeqStore,
+                                 U32 const remaining, U32 const minMatch)
+{
+    rawSeq sequence = rawSeqStore->seq[rawSeqStore->pos];
+    assert(sequence.offset > 0);
+    /* Likely: No partial sequence */
+    if (remaining >= sequence.litLength + sequence.matchLength) {
+        rawSeqStore->pos++;
+        return sequence;
+    }
+    /* Cut the sequence short (offset == 0 ==> rest is literals). */
+    if (remaining <= sequence.litLength) {
+        sequence.offset = 0;
+    } else if (remaining < sequence.litLength + sequence.matchLength) {
+        sequence.matchLength = remaining - sequence.litLength;
+        if (sequence.matchLength < minMatch) {
+            sequence.offset = 0;
+        }
+    }
+    /* Skip past `remaining` bytes for the future sequences. */
+    ZSTD_ldm_skipSequences(rawSeqStore, remaining, minMatch);
+    return sequence;
+}
+
+size_t ZSTD_ldm_blockCompress(rawSeqStore_t* rawSeqStore,
+    ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+    void const* src, size_t srcSize)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    unsigned const minMatch = cParams->minMatch;
+    ZSTD_blockCompressor const blockCompressor =
+        ZSTD_selectBlockCompressor(cParams->strategy, ZSTD_matchState_dictMode(ms));
+    /* Input bounds */
+    BYTE const* const istart = (BYTE const*)src;
+    BYTE const* const iend = istart + srcSize;
+    /* Input positions */
+    BYTE const* ip = istart;
+
+    DEBUGLOG(5, "ZSTD_ldm_blockCompress: srcSize=%zu", srcSize);
+    assert(rawSeqStore->pos <= rawSeqStore->size);
+    assert(rawSeqStore->size <= rawSeqStore->capacity);
+    /* Loop through each sequence and apply the block compressor to the lits */
+    while (rawSeqStore->pos < rawSeqStore->size && ip < iend) {
+        /* maybeSplitSequence updates rawSeqStore->pos */
+        rawSeq const sequence = maybeSplitSequence(rawSeqStore,
+                                                   (U32)(iend - ip), minMatch);
+        int i;
+        /* End signal */
+        if (sequence.offset == 0)
+            break;
+
+        assert(ip + sequence.litLength + sequence.matchLength <= iend);
+
+        /* Fill tables for block compressor */
+        ZSTD_ldm_limitTableUpdate(ms, ip);
+        ZSTD_ldm_fillFastTables(ms, ip);
+        /* Run the block compressor */
+        DEBUGLOG(5, "pos %u : calling block compressor on segment of size %u", (unsigned)(ip-istart), sequence.litLength);
+        {
+            size_t const newLitLength =
+                blockCompressor(ms, seqStore, rep, ip, sequence.litLength);
+            ip += sequence.litLength;
+            /* Update the repcodes */
+            for (i = ZSTD_REP_NUM - 1; i > 0; i--)
+                rep[i] = rep[i-1];
+            rep[0] = sequence.offset;
+            /* Store the sequence */
+            ZSTD_storeSeq(seqStore, newLitLength, ip - newLitLength, iend,
+                          sequence.offset + ZSTD_REP_MOVE,
+                          sequence.matchLength - MINMATCH);
+            ip += sequence.matchLength;
+        }
+    }
+    /* Fill the tables for the block compressor */
+    ZSTD_ldm_limitTableUpdate(ms, ip);
+    ZSTD_ldm_fillFastTables(ms, ip);
+    /* Compress the last literals */
+    return blockCompressor(ms, seqStore, rep, ip, iend - ip);
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_opt.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_opt.cpp
new file mode 100644
index 0000000000..73ecbbe54f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/compress/zstd_opt.cpp
@@ -0,0 +1,1204 @@
+/*
+ * Copyright (c) 2016-2020, Przemyslaw Skibinski, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#include "zstd/compress/zstd_compress_internal.h"
+#include "zstd/compress/hist.h"
+#include "zstd/compress/zstd_opt.h"
+
+
+#define ZSTD_LITFREQ_ADD    2   /* scaling factor for litFreq, so that frequencies adapt faster to new stats */
+#define ZSTD_FREQ_DIV       4   /* log factor when using previous stats to init next stats */
+#define ZSTD_MAX_PRICE     (1<<30)
+
+#define ZSTD_PREDEF_THRESHOLD 1024   /* if srcSize < ZSTD_PREDEF_THRESHOLD, symbols' cost is assumed static, directly determined by pre-defined distributions */
+
+
+/*-*************************************
+*  Price functions for optimal parser
+***************************************/
+
+#if 0    /* approximation at bit level */
+#  define BITCOST_ACCURACY 0
+#  define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY)
+#  define WEIGHT(stat)  ((void)opt, ZSTD_bitWeight(stat))
+#elif 0  /* fractional bit accuracy */
+#  define BITCOST_ACCURACY 8
+#  define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY)
+#  define WEIGHT(stat,opt) ((void)opt, ZSTD_fracWeight(stat))
+#else    /* opt==approx, ultra==accurate */
+#  define BITCOST_ACCURACY 8
+#  define BITCOST_MULTIPLIER (1 << BITCOST_ACCURACY)
+#  define WEIGHT(stat,opt) (opt ? ZSTD_fracWeight(stat) : ZSTD_bitWeight(stat))
+#endif
+
+namespace lbug_zstd {
+
+MEM_STATIC U32 ZSTD_bitWeight(U32 stat)
+{
+    return (ZSTD_highbit32(stat+1) * BITCOST_MULTIPLIER);
+}
+
+MEM_STATIC U32 ZSTD_fracWeight(U32 rawStat)
+{
+    U32 const stat = rawStat + 1;
+    U32 const hb = ZSTD_highbit32(stat);
+    U32 const BWeight = hb * BITCOST_MULTIPLIER;
+    U32 const FWeight = (stat << BITCOST_ACCURACY) >> hb;
+    U32 const weight = BWeight + FWeight;
+    assert(hb + BITCOST_ACCURACY < 31);
+    return weight;
+}
+
+#if (DEBUGLEVEL>=2)
+/* debugging function,
+ * @return price in bytes as fractional value
+ * for debug messages only */
+MEM_STATIC double ZSTD_fCost(U32 price)
+{
+    return (double)price / (BITCOST_MULTIPLIER*8);
+}
+#endif
+
+static int ZSTD_compressedLiterals(optState_t const* const optPtr)
+{
+    return optPtr->literalCompressionMode != ZSTD_lcm_uncompressed;
+}
+
+static void ZSTD_setBasePrices(optState_t* optPtr, int optLevel)
+{
+    if (ZSTD_compressedLiterals(optPtr))
+        optPtr->litSumBasePrice = WEIGHT(optPtr->litSum, optLevel);
+    optPtr->litLengthSumBasePrice = WEIGHT(optPtr->litLengthSum, optLevel);
+    optPtr->matchLengthSumBasePrice = WEIGHT(optPtr->matchLengthSum, optLevel);
+    optPtr->offCodeSumBasePrice = WEIGHT(optPtr->offCodeSum, optLevel);
+}
+
+
+/* ZSTD_downscaleStat() :
+ * reduce all elements in table by a factor 2^(ZSTD_FREQ_DIV+malus)
+ * return the resulting sum of elements */
+static U32 ZSTD_downscaleStat(unsigned* table, U32 lastEltIndex, int malus)
+{
+    U32 s, sum=0;
+    DEBUGLOG(5, "ZSTD_downscaleStat (nbElts=%u)", (unsigned)lastEltIndex+1);
+    assert(ZSTD_FREQ_DIV+malus > 0 && ZSTD_FREQ_DIV+malus < 31);
+    for (s=0; s<lastEltIndex+1; s++) {
+        table[s] = 1 + (table[s] >> (ZSTD_FREQ_DIV+malus));
+        sum += table[s];
+    }
+    return sum;
+}
+
+/* ZSTD_rescaleFreqs() :
+ * if first block (detected by optPtr->litLengthSum == 0) : init statistics
+ *    take hints from dictionary if there is one
+ *    or init from zero, using src for literals stats, or flat 1 for match symbols
+ * otherwise downscale existing stats, to be used as seed for next block.
+ */
+static void
+ZSTD_rescaleFreqs(optState_t* const optPtr,
+            const BYTE* const src, size_t const srcSize,
+                  int const optLevel)
+{
+    int const compressedLiterals = ZSTD_compressedLiterals(optPtr);
+    DEBUGLOG(5, "ZSTD_rescaleFreqs (srcSize=%u)", (unsigned)srcSize);
+    optPtr->priceType = zop_dynamic;
+
+    if (optPtr->litLengthSum == 0) {  /* first block : init */
+        if (srcSize <= ZSTD_PREDEF_THRESHOLD) {  /* heuristic */
+            DEBUGLOG(5, "(srcSize <= ZSTD_PREDEF_THRESHOLD) => zop_predef");
+            optPtr->priceType = zop_predef;
+        }
+
+        assert(optPtr->symbolCosts != NULL);
+        if (optPtr->symbolCosts->huf.repeatMode == HUF_repeat_valid) {
+            /* huffman table presumed generated by dictionary */
+            optPtr->priceType = zop_dynamic;
+
+            if (compressedLiterals) {
+                unsigned lit;
+                assert(optPtr->litFreq != NULL);
+                optPtr->litSum = 0;
+                for (lit=0; lit<=MaxLit; lit++) {
+                    U32 const scaleLog = 11;   /* scale to 2K */
+                    U32 const bitCost = HUF_getNbBits(optPtr->symbolCosts->huf.CTable, lit);
+                    assert(bitCost <= scaleLog);
+                    optPtr->litFreq[lit] = bitCost ? 1 << (scaleLog-bitCost) : 1 /*minimum to calculate cost*/;
+                    optPtr->litSum += optPtr->litFreq[lit];
+            }   }
+
+            {   unsigned ll;
+                FSE_CState_t llstate;
+                FSE_initCState(&llstate, optPtr->symbolCosts->fse.litlengthCTable);
+                optPtr->litLengthSum = 0;
+                for (ll=0; ll<=MaxLL; ll++) {
+                    U32 const scaleLog = 10;   /* scale to 1K */
+                    U32 const bitCost = FSE_getMaxNbBits(llstate.symbolTT, ll);
+                    assert(bitCost < scaleLog);
+                    optPtr->litLengthFreq[ll] = bitCost ? 1 << (scaleLog-bitCost) : 1 /*minimum to calculate cost*/;
+                    optPtr->litLengthSum += optPtr->litLengthFreq[ll];
+            }   }
+
+            {   unsigned ml;
+                FSE_CState_t mlstate;
+                FSE_initCState(&mlstate, optPtr->symbolCosts->fse.matchlengthCTable);
+                optPtr->matchLengthSum = 0;
+                for (ml=0; ml<=MaxML; ml++) {
+                    U32 const scaleLog = 10;
+                    U32 const bitCost = FSE_getMaxNbBits(mlstate.symbolTT, ml);
+                    assert(bitCost < scaleLog);
+                    optPtr->matchLengthFreq[ml] = bitCost ? 1 << (scaleLog-bitCost) : 1 /*minimum to calculate cost*/;
+                    optPtr->matchLengthSum += optPtr->matchLengthFreq[ml];
+            }   }
+
+            {   unsigned of;
+                FSE_CState_t ofstate;
+                FSE_initCState(&ofstate, optPtr->symbolCosts->fse.offcodeCTable);
+                optPtr->offCodeSum = 0;
+                for (of=0; of<=MaxOff; of++) {
+                    U32 const scaleLog = 10;
+                    U32 const bitCost = FSE_getMaxNbBits(ofstate.symbolTT, of);
+                    assert(bitCost < scaleLog);
+                    optPtr->offCodeFreq[of] = bitCost ? 1 << (scaleLog-bitCost) : 1 /*minimum to calculate cost*/;
+                    optPtr->offCodeSum += optPtr->offCodeFreq[of];
+            }   }
+
+        } else {  /* not a dictionary */
+
+            assert(optPtr->litFreq != NULL);
+            if (compressedLiterals) {
+                unsigned lit = MaxLit;
+                HIST_count_simple(optPtr->litFreq, &lit, src, srcSize);   /* use raw first block to init statistics */
+                optPtr->litSum = ZSTD_downscaleStat(optPtr->litFreq, MaxLit, 1);
+            }
+
+            {   unsigned ll;
+                for (ll=0; ll<=MaxLL; ll++)
+                    optPtr->litLengthFreq[ll] = 1;
+            }
+            optPtr->litLengthSum = MaxLL+1;
+
+            {   unsigned ml;
+                for (ml=0; ml<=MaxML; ml++)
+                    optPtr->matchLengthFreq[ml] = 1;
+            }
+            optPtr->matchLengthSum = MaxML+1;
+
+            {   unsigned of;
+                for (of=0; of<=MaxOff; of++)
+                    optPtr->offCodeFreq[of] = 1;
+            }
+            optPtr->offCodeSum = MaxOff+1;
+
+        }
+
+    } else {   /* new block : re-use previous statistics, scaled down */
+
+        if (compressedLiterals)
+            optPtr->litSum = ZSTD_downscaleStat(optPtr->litFreq, MaxLit, 1);
+        optPtr->litLengthSum = ZSTD_downscaleStat(optPtr->litLengthFreq, MaxLL, 0);
+        optPtr->matchLengthSum = ZSTD_downscaleStat(optPtr->matchLengthFreq, MaxML, 0);
+        optPtr->offCodeSum = ZSTD_downscaleStat(optPtr->offCodeFreq, MaxOff, 0);
+    }
+
+    ZSTD_setBasePrices(optPtr, optLevel);
+}
+
+/* ZSTD_rawLiteralsCost() :
+ * price of literals (only) in specified segment (which length can be 0).
+ * does not include price of literalLength symbol */
+static U32 ZSTD_rawLiteralsCost(const BYTE* const literals, U32 const litLength,
+                                const optState_t* const optPtr,
+                                int optLevel)
+{
+    if (litLength == 0) return 0;
+
+    if (!ZSTD_compressedLiterals(optPtr))
+        return (litLength << 3) * BITCOST_MULTIPLIER;  /* Uncompressed - 8 bytes per literal. */
+
+    if (optPtr->priceType == zop_predef)
+        return (litLength*6) * BITCOST_MULTIPLIER;  /* 6 bit per literal - no statistic used */
+
+    /* dynamic statistics */
+    {   U32 price = litLength * optPtr->litSumBasePrice;
+        U32 u;
+        for (u=0; u < litLength; u++) {
+            assert(WEIGHT(optPtr->litFreq[literals[u]], optLevel) <= optPtr->litSumBasePrice);   /* literal cost should never be negative */
+            price -= WEIGHT(optPtr->litFreq[literals[u]], optLevel);
+        }
+        return price;
+    }
+}
+
+/* ZSTD_litLengthPrice() :
+ * cost of literalLength symbol */
+static U32 ZSTD_litLengthPrice(U32 const litLength, const optState_t* const optPtr, int optLevel)
+{
+    if (optPtr->priceType == zop_predef) return WEIGHT(litLength, optLevel);
+
+    /* dynamic statistics */
+    {   U32 const llCode = ZSTD_LLcode(litLength);
+        return (ZSTDInternalConstants::LL_bits[llCode] * BITCOST_MULTIPLIER)
+             + optPtr->litLengthSumBasePrice
+             - WEIGHT(optPtr->litLengthFreq[llCode], optLevel);
+    }
+}
+
+/* ZSTD_getMatchPrice() :
+ * Provides the cost of the match part (offset + matchLength) of a sequence
+ * Must be combined with ZSTD_fullLiteralsCost() to get the full cost of a sequence.
+ * optLevel: when <2, favors small offset for decompression speed (improved cache efficiency) */
+FORCE_INLINE_TEMPLATE U32
+ZSTD_getMatchPrice(U32 const offset,
+                   U32 const matchLength,
+             const optState_t* const optPtr,
+                   int const optLevel)
+{
+    U32 price;
+    U32 const offCode = ZSTD_highbit32(offset+1);
+    U32 const mlBase = matchLength - MINMATCH;
+    assert(matchLength >= MINMATCH);
+
+    if (optPtr->priceType == zop_predef)  /* fixed scheme, do not use statistics */
+        return WEIGHT(mlBase, optLevel) + ((16 + offCode) * BITCOST_MULTIPLIER);
+
+    /* dynamic statistics */
+    price = (offCode * BITCOST_MULTIPLIER) + (optPtr->offCodeSumBasePrice - WEIGHT(optPtr->offCodeFreq[offCode], optLevel));
+    if ((optLevel<2) /*static*/ && offCode >= 20)
+        price += (offCode-19)*2 * BITCOST_MULTIPLIER; /* handicap for long distance offsets, favor decompression speed */
+
+    /* match Length */
+    {   U32 const mlCode = ZSTD_MLcode(mlBase);
+        price += (ZSTDInternalConstants::ML_bits[mlCode] * BITCOST_MULTIPLIER) + (optPtr->matchLengthSumBasePrice - WEIGHT(optPtr->matchLengthFreq[mlCode], optLevel));
+    }
+
+    price += BITCOST_MULTIPLIER / 5;   /* heuristic : make matches a bit more costly to favor less sequences -> faster decompression speed */
+
+    DEBUGLOG(8, "ZSTD_getMatchPrice(ml:%u) = %u", matchLength, price);
+    return price;
+}
+
+/* ZSTD_updateStats() :
+ * assumption : literals + litLengtn <= iend */
+static void ZSTD_updateStats(optState_t* const optPtr,
+                             U32 litLength, const BYTE* literals,
+                             U32 offsetCode, U32 matchLength)
+{
+    /* literals */
+    if (ZSTD_compressedLiterals(optPtr)) {
+        U32 u;
+        for (u=0; u < litLength; u++)
+            optPtr->litFreq[literals[u]] += ZSTD_LITFREQ_ADD;
+        optPtr->litSum += litLength*ZSTD_LITFREQ_ADD;
+    }
+
+    /* literal Length */
+    {   U32 const llCode = ZSTD_LLcode(litLength);
+        optPtr->litLengthFreq[llCode]++;
+        optPtr->litLengthSum++;
+    }
+
+    /* match offset code (0-2=>repCode; 3+=>offset+2) */
+    {   U32 const offCode = ZSTD_highbit32(offsetCode+1);
+        assert(offCode <= MaxOff);
+        optPtr->offCodeFreq[offCode]++;
+        optPtr->offCodeSum++;
+    }
+
+    /* match Length */
+    {   U32 const mlBase = matchLength - MINMATCH;
+        U32 const mlCode = ZSTD_MLcode(mlBase);
+        optPtr->matchLengthFreq[mlCode]++;
+        optPtr->matchLengthSum++;
+    }
+}
+
+
+/* ZSTD_readMINMATCH() :
+ * function safe only for comparisons
+ * assumption : memPtr must be at least 4 bytes before end of buffer */
+MEM_STATIC U32 ZSTD_readMINMATCH(const void* memPtr, U32 length)
+{
+    switch (length)
+    {
+    default :
+    case 4 : return MEM_read32(memPtr);
+    case 3 : if (MEM_isLittleEndian())
+                return MEM_read32(memPtr)<<8;
+             else
+                return MEM_read32(memPtr)>>8;
+    }
+}
+
+
+/* Update hashTable3 up to ip (excluded)
+   Assumption : always within prefix (i.e. not within extDict) */
+static U32 ZSTD_insertAndFindFirstIndexHash3 (ZSTD_matchState_t* ms,
+                                              U32* nextToUpdate3,
+                                              const BYTE* const ip)
+{
+    U32* const hashTable3 = ms->hashTable3;
+    U32 const hashLog3 = ms->hashLog3;
+    const BYTE* const base = ms->window.base;
+    U32 idx = *nextToUpdate3;
+    U32 const target = (U32)(ip - base);
+    size_t const hash3 = ZSTD_hash3Ptr(ip, hashLog3);
+    assert(hashLog3 > 0);
+
+    while(idx < target) {
+        hashTable3[ZSTD_hash3Ptr(base+idx, hashLog3)] = idx;
+        idx++;
+    }
+
+    *nextToUpdate3 = target;
+    return hashTable3[hash3];
+}
+
+
+/*-*************************************
+*  Binary Tree search
+***************************************/
+/** ZSTD_insertBt1() : add one or multiple positions to tree.
+ *  ip : assumed <= iend-8 .
+ * @return : nb of positions added */
+static U32 ZSTD_insertBt1(
+                ZSTD_matchState_t* ms,
+                const BYTE* const ip, const BYTE* const iend,
+                U32 const mls, const int extDict)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32*   const hashTable = ms->hashTable;
+    U32    const hashLog = cParams->hashLog;
+    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
+    U32*   const bt = ms->chainTable;
+    U32    const btLog  = cParams->chainLog - 1;
+    U32    const btMask = (1 << btLog) - 1;
+    U32 matchIndex = hashTable[h];
+    size_t commonLengthSmaller=0, commonLengthLarger=0;
+    const BYTE* const base = ms->window.base;
+    const BYTE* const dictBase = ms->window.dictBase;
+    const U32 dictLimit = ms->window.dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    const BYTE* match;
+    const U32 current = (U32)(ip-base);
+    const U32 btLow = btMask >= current ? 0 : current - btMask;
+    U32* smallerPtr = bt + 2*(current&btMask);
+    U32* largerPtr  = smallerPtr + 1;
+    U32 dummy32;   /* to be nullified at the end */
+    U32 const windowLow = ms->window.lowLimit;
+    U32 matchEndIdx = current+8+1;
+    size_t bestLength = 8;
+    U32 nbCompares = 1U << cParams->searchLog;
+#ifdef ZSTD_C_PREDICT
+    U32 predictedSmall = *(bt + 2*((current-1)&btMask) + 0);
+    U32 predictedLarge = *(bt + 2*((current-1)&btMask) + 1);
+    predictedSmall += (predictedSmall>0);
+    predictedLarge += (predictedLarge>0);
+#endif /* ZSTD_C_PREDICT */
+
+    DEBUGLOG(8, "ZSTD_insertBt1 (%u)", current);
+
+    assert(ip <= iend-8);   /* required for h calculation */
+    hashTable[h] = current;   /* Update Hash Table */
+
+    assert(windowLow > 0);
+    while (nbCompares-- && (matchIndex >= windowLow)) {
+        U32* const nextPtr = bt + 2*(matchIndex & btMask);
+        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+        assert(matchIndex < current);
+
+#ifdef ZSTD_C_PREDICT   /* note : can create issues when hlog small <= 11 */
+        const U32* predictPtr = bt + 2*((matchIndex-1) & btMask);   /* written this way, as bt is a roll buffer */
+        if (matchIndex == predictedSmall) {
+            /* no need to check length, result known */
+            *smallerPtr = matchIndex;
+            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
+            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+            predictedSmall = predictPtr[1] + (predictPtr[1]>0);
+            continue;
+        }
+        if (matchIndex == predictedLarge) {
+            *largerPtr = matchIndex;
+            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            largerPtr = nextPtr;
+            matchIndex = nextPtr[0];
+            predictedLarge = predictPtr[0] + (predictPtr[0]>0);
+            continue;
+        }
+#endif
+
+        if (!extDict || (matchIndex+matchLength >= dictLimit)) {
+            assert(matchIndex+matchLength >= dictLimit);   /* might be wrong if actually extDict */
+            match = base + matchIndex;
+            matchLength += ZSTD_count(ip+matchLength, match+matchLength, iend);
+        } else {
+            match = dictBase + matchIndex;
+            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
+            if (matchIndex+matchLength >= dictLimit)
+                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
+        }
+
+        if (matchLength > bestLength) {
+            bestLength = matchLength;
+            if (matchLength > matchEndIdx - matchIndex)
+                matchEndIdx = matchIndex + (U32)matchLength;
+        }
+
+        if (ip+matchLength == iend) {   /* equal : no way to know if inf or sup */
+            break;   /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt tree */
+        }
+
+        if (match[matchLength] < ip[matchLength]) {  /* necessarily within buffer */
+            /* match is smaller than current */
+            *smallerPtr = matchIndex;             /* update smaller idx */
+            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */
+            smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller than target */
+            matchIndex = nextPtr[1];              /* new matchIndex, larger than previous and closer to current */
+        } else {
+            /* match is larger than current */
+            *largerPtr = matchIndex;
+            commonLengthLarger = matchLength;
+            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop searching */
+            largerPtr = nextPtr;
+            matchIndex = nextPtr[0];
+    }   }
+
+    *smallerPtr = *largerPtr = 0;
+    {   U32 positions = 0;
+        if (bestLength > 384) positions = MIN(192, (U32)(bestLength - 384));   /* speed optimization */
+        assert(matchEndIdx > current + 8);
+        return MAX(positions, matchEndIdx - (current + 8));
+    }
+}
+
+FORCE_INLINE_TEMPLATE
+void ZSTD_updateTree_internal(
+                ZSTD_matchState_t* ms,
+                const BYTE* const ip, const BYTE* const iend,
+                const U32 mls, const ZSTD_dictMode_e dictMode)
+{
+    const BYTE* const base = ms->window.base;
+    U32 const target = (U32)(ip - base);
+    U32 idx = ms->nextToUpdate;
+    DEBUGLOG(6, "ZSTD_updateTree_internal, from %u to %u  (dictMode:%u)",
+                idx, target, dictMode);
+
+    while(idx < target) {
+        U32 const forward = ZSTD_insertBt1(ms, base+idx, iend, mls, dictMode == ZSTD_extDict);
+        assert(idx < (U32)(idx + forward));
+        idx += forward;
+    }
+    assert((size_t)(ip - base) <= (size_t)(U32)(-1));
+    assert((size_t)(iend - base) <= (size_t)(U32)(-1));
+    ms->nextToUpdate = target;
+}
+
+void ZSTD_updateTree(ZSTD_matchState_t* ms, const BYTE* ip, const BYTE* iend) {
+    ZSTD_updateTree_internal(ms, ip, iend, ms->cParams.minMatch, ZSTD_noDict);
+}
+
+FORCE_INLINE_TEMPLATE
+U32 ZSTD_insertBtAndGetAllMatches (
+                    ZSTD_match_t* matches,   /* store result (found matches) in this table (presumed large enough) */
+                    ZSTD_matchState_t* ms,
+                    U32* nextToUpdate3,
+                    const BYTE* const ip, const BYTE* const iLimit, const ZSTD_dictMode_e dictMode,
+                    const U32 rep[ZSTD_REP_NUM],
+                    U32 const ll0,   /* tells if associated literal length is 0 or not. This value must be 0 or 1 */
+                    const U32 lengthToBeat,
+                    U32 const mls /* template */)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32 const sufficient_len = MIN(cParams->targetLength, ZSTD_OPT_NUM -1);
+    const BYTE* const base = ms->window.base;
+    U32 const current = (U32)(ip-base);
+    U32 const hashLog = cParams->hashLog;
+    U32 const minMatch = (mls==3) ? 3 : 4;
+    U32* const hashTable = ms->hashTable;
+    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
+    U32 matchIndex  = hashTable[h];
+    U32* const bt   = ms->chainTable;
+    U32 const btLog = cParams->chainLog - 1;
+    U32 const btMask= (1U << btLog) - 1;
+    size_t commonLengthSmaller=0, commonLengthLarger=0;
+    const BYTE* const dictBase = ms->window.dictBase;
+    U32 const dictLimit = ms->window.dictLimit;
+    const BYTE* const dictEnd = dictBase + dictLimit;
+    const BYTE* const prefixStart = base + dictLimit;
+    U32 const btLow = (btMask >= current) ? 0 : current - btMask;
+    U32 const windowLow = ZSTD_getLowestMatchIndex(ms, current, cParams->windowLog);
+    U32 const matchLow = windowLow ? windowLow : 1;
+    U32* smallerPtr = bt + 2*(current&btMask);
+    U32* largerPtr  = bt + 2*(current&btMask) + 1;
+    U32 matchEndIdx = current+8+1;   /* farthest referenced position of any match => detects repetitive patterns */
+    U32 dummy32;   /* to be nullified at the end */
+    U32 mnum = 0;
+    U32 nbCompares = 1U << cParams->searchLog;
+
+    const ZSTD_matchState_t* dms    = dictMode == ZSTD_dictMatchState ? ms->dictMatchState : NULL;
+    const ZSTD_compressionParameters* const dmsCParams =
+                                      dictMode == ZSTD_dictMatchState ? &dms->cParams : NULL;
+    const BYTE* const dmsBase       = dictMode == ZSTD_dictMatchState ? dms->window.base : NULL;
+    const BYTE* const dmsEnd        = dictMode == ZSTD_dictMatchState ? dms->window.nextSrc : NULL;
+    U32         const dmsHighLimit  = dictMode == ZSTD_dictMatchState ? (U32)(dmsEnd - dmsBase) : 0;
+    U32         const dmsLowLimit   = dictMode == ZSTD_dictMatchState ? dms->window.lowLimit : 0;
+    U32         const dmsIndexDelta = dictMode == ZSTD_dictMatchState ? windowLow - dmsHighLimit : 0;
+    U32         const dmsHashLog    = dictMode == ZSTD_dictMatchState ? dmsCParams->hashLog : hashLog;
+    U32         const dmsBtLog      = dictMode == ZSTD_dictMatchState ? dmsCParams->chainLog - 1 : btLog;
+    U32         const dmsBtMask     = dictMode == ZSTD_dictMatchState ? (1U << dmsBtLog) - 1 : 0;
+    U32         const dmsBtLow      = dictMode == ZSTD_dictMatchState && dmsBtMask < dmsHighLimit - dmsLowLimit ? dmsHighLimit - dmsBtMask : dmsLowLimit;
+
+    size_t bestLength = lengthToBeat-1;
+    DEBUGLOG(8, "ZSTD_insertBtAndGetAllMatches: current=%u", current);
+
+    /* check repCode */
+    assert(ll0 <= 1);   /* necessarily 1 or 0 */
+    {   U32 const lastR = ZSTD_REP_NUM + ll0;
+        U32 repCode;
+        for (repCode = ll0; repCode < lastR; repCode++) {
+            U32 const repOffset = (repCode==ZSTD_REP_NUM) ? (rep[0] - 1) : rep[repCode];
+            U32 const repIndex = current - repOffset;
+            U32 repLen = 0;
+            assert(current >= dictLimit);
+            if (repOffset-1 /* intentional overflow, discards 0 and -1 */ < current-dictLimit) {  /* equivalent to `current > repIndex >= dictLimit` */
+                /* We must validate the repcode offset because when we're using a dictionary the
+                 * valid offset range shrinks when the dictionary goes out of bounds.
+                 */
+                if ((repIndex >= windowLow) & (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(ip - repOffset, minMatch))) {
+                    repLen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repOffset, iLimit) + minMatch;
+                }
+            } else {  /* repIndex < dictLimit || repIndex >= current */
+                const BYTE* const repMatch = dictMode == ZSTD_dictMatchState ?
+                                             dmsBase + repIndex - dmsIndexDelta :
+                                             dictBase + repIndex;
+                assert(current >= windowLow);
+                if ( dictMode == ZSTD_extDict
+                  && ( ((repOffset-1) /*intentional overflow*/ < current - windowLow)  /* equivalent to `current > repIndex >= windowLow` */
+                     & (((U32)((dictLimit-1) - repIndex) >= 3) ) /* intentional overflow : do not test positions overlapping 2 memory segments */)
+                  && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch)) ) {
+                    repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iLimit, dictEnd, prefixStart) + minMatch;
+                }
+                if (dictMode == ZSTD_dictMatchState
+                  && ( ((repOffset-1) /*intentional overflow*/ < current - (dmsLowLimit + dmsIndexDelta))  /* equivalent to `current > repIndex >= dmsLowLimit` */
+                     & ((U32)((dictLimit-1) - repIndex) >= 3) ) /* intentional overflow : do not test positions overlapping 2 memory segments */
+                  && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch)) ) {
+                    repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iLimit, dmsEnd, prefixStart) + minMatch;
+            }   }
+            /* save longer solution */
+            if (repLen > bestLength) {
+                DEBUGLOG(8, "found repCode %u (ll0:%u, offset:%u) of length %u",
+                            repCode, ll0, repOffset, repLen);
+                bestLength = repLen;
+                matches[mnum].off = repCode - ll0;
+                matches[mnum].len = (U32)repLen;
+                mnum++;
+                if ( (repLen > sufficient_len)
+                   | (ip+repLen == iLimit) ) {  /* best possible */
+                    return mnum;
+    }   }   }   }
+
+    /* HC3 match finder */
+    if ((mls == 3) /*static*/ && (bestLength < mls)) {
+        U32 const matchIndex3 = ZSTD_insertAndFindFirstIndexHash3(ms, nextToUpdate3, ip);
+        if ((matchIndex3 >= matchLow)
+          & (current - matchIndex3 < (1<<18)) /*heuristic : longer distance likely too expensive*/ ) {
+            size_t mlen;
+            if ((dictMode == ZSTD_noDict) /*static*/ || (dictMode == ZSTD_dictMatchState) /*static*/ || (matchIndex3 >= dictLimit)) {
+                const BYTE* const match = base + matchIndex3;
+                mlen = ZSTD_count(ip, match, iLimit);
+            } else {
+                const BYTE* const match = dictBase + matchIndex3;
+                mlen = ZSTD_count_2segments(ip, match, iLimit, dictEnd, prefixStart);
+            }
+
+            /* save best solution */
+            if (mlen >= mls /* == 3 > bestLength */) {
+                DEBUGLOG(8, "found small match with hlog3, of length %u",
+                            (U32)mlen);
+                bestLength = mlen;
+                assert(current > matchIndex3);
+                assert(mnum==0);  /* no prior solution */
+                matches[0].off = (current - matchIndex3) + ZSTD_REP_MOVE;
+                matches[0].len = (U32)mlen;
+                mnum = 1;
+                if ( (mlen > sufficient_len) |
+                     (ip+mlen == iLimit) ) {  /* best possible length */
+                    ms->nextToUpdate = current+1;  /* skip insertion */
+                    return 1;
+        }   }   }
+        /* no dictMatchState lookup: dicts don't have a populated HC3 table */
+    }
+
+    hashTable[h] = current;   /* Update Hash Table */
+
+    while (nbCompares-- && (matchIndex >= matchLow)) {
+        U32* const nextPtr = bt + 2*(matchIndex & btMask);
+        const BYTE* match;
+        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+        assert(current > matchIndex);
+
+        if ((dictMode == ZSTD_noDict) || (dictMode == ZSTD_dictMatchState) || (matchIndex+matchLength >= dictLimit)) {
+            assert(matchIndex+matchLength >= dictLimit);  /* ensure the condition is correct when !extDict */
+            match = base + matchIndex;
+            if (matchIndex >= dictLimit) assert(memcmp(match, ip, matchLength) == 0);  /* ensure early section of match is equal as expected */
+            matchLength += ZSTD_count(ip+matchLength, match+matchLength, iLimit);
+        } else {
+            match = dictBase + matchIndex;
+            assert(memcmp(match, ip, matchLength) == 0);  /* ensure early section of match is equal as expected */
+            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iLimit, dictEnd, prefixStart);
+            if (matchIndex+matchLength >= dictLimit)
+                match = base + matchIndex;   /* prepare for match[matchLength] read */
+        }
+
+        if (matchLength > bestLength) {
+            DEBUGLOG(8, "found match of length %u at distance %u (offCode=%u)",
+                    (U32)matchLength, current - matchIndex, current - matchIndex + ZSTD_REP_MOVE);
+            assert(matchEndIdx > matchIndex);
+            if (matchLength > matchEndIdx - matchIndex)
+                matchEndIdx = matchIndex + (U32)matchLength;
+            bestLength = matchLength;
+            matches[mnum].off = (current - matchIndex) + ZSTD_REP_MOVE;
+            matches[mnum].len = (U32)matchLength;
+            mnum++;
+            if ( (matchLength > ZSTD_OPT_NUM)
+               | (ip+matchLength == iLimit) /* equal : no way to know if inf or sup */) {
+                if (dictMode == ZSTD_dictMatchState) nbCompares = 0; /* break should also skip searching dms */
+                break; /* drop, to preserve bt consistency (miss a little bit of compression) */
+            }
+        }
+
+        if (match[matchLength] < ip[matchLength]) {
+            /* match smaller than current */
+            *smallerPtr = matchIndex;             /* update smaller idx */
+            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            smallerPtr = nextPtr+1;               /* new candidate => larger than match, which was smaller than current */
+            matchIndex = nextPtr[1];              /* new matchIndex, larger than previous, closer to current */
+        } else {
+            *largerPtr = matchIndex;
+            commonLengthLarger = matchLength;
+            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
+            largerPtr = nextPtr;
+            matchIndex = nextPtr[0];
+    }   }
+
+    *smallerPtr = *largerPtr = 0;
+
+    if (dictMode == ZSTD_dictMatchState && nbCompares) {
+        size_t const dmsH = ZSTD_hashPtr(ip, dmsHashLog, mls);
+        U32 dictMatchIndex = dms->hashTable[dmsH];
+        const U32* const dmsBt = dms->chainTable;
+        commonLengthSmaller = commonLengthLarger = 0;
+        while (nbCompares-- && (dictMatchIndex > dmsLowLimit)) {
+            const U32* const nextPtr = dmsBt + 2*(dictMatchIndex & dmsBtMask);
+            size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
+            const BYTE* match = dmsBase + dictMatchIndex;
+            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iLimit, dmsEnd, prefixStart);
+            if (dictMatchIndex+matchLength >= dmsHighLimit)
+                match = base + dictMatchIndex + dmsIndexDelta;   /* to prepare for next usage of match[matchLength] */
+
+            if (matchLength > bestLength) {
+                matchIndex = dictMatchIndex + dmsIndexDelta;
+                DEBUGLOG(8, "found dms match of length %u at distance %u (offCode=%u)",
+                        (U32)matchLength, current - matchIndex, current - matchIndex + ZSTD_REP_MOVE);
+                if (matchLength > matchEndIdx - matchIndex)
+                    matchEndIdx = matchIndex + (U32)matchLength;
+                bestLength = matchLength;
+                matches[mnum].off = (current - matchIndex) + ZSTD_REP_MOVE;
+                matches[mnum].len = (U32)matchLength;
+                mnum++;
+                if ( (matchLength > ZSTD_OPT_NUM)
+                   | (ip+matchLength == iLimit) /* equal : no way to know if inf or sup */) {
+                    break;   /* drop, to guarantee consistency (miss a little bit of compression) */
+                }
+            }
+
+            if (dictMatchIndex <= dmsBtLow) { break; }   /* beyond tree size, stop the search */
+            if (match[matchLength] < ip[matchLength]) {
+                commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
+                dictMatchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
+            } else {
+                /* match is larger than current */
+                commonLengthLarger = matchLength;
+                dictMatchIndex = nextPtr[0];
+            }
+        }
+    }
+
+    assert(matchEndIdx > current+8);
+    ms->nextToUpdate = matchEndIdx - 8;  /* skip repetitive patterns */
+    return mnum;
+}
+
+
+FORCE_INLINE_TEMPLATE U32 ZSTD_BtGetAllMatches (
+                        ZSTD_match_t* matches,   /* store result (match found, increasing size) in this table */
+                        ZSTD_matchState_t* ms,
+                        U32* nextToUpdate3,
+                        const BYTE* ip, const BYTE* const iHighLimit, const ZSTD_dictMode_e dictMode,
+                        const U32 rep[ZSTD_REP_NUM],
+                        U32 const ll0,
+                        U32 const lengthToBeat)
+{
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+    U32 const matchLengthSearch = cParams->minMatch;
+    DEBUGLOG(8, "ZSTD_BtGetAllMatches");
+    if (ip < ms->window.base + ms->nextToUpdate) return 0;   /* skipped area */
+    ZSTD_updateTree_internal(ms, ip, iHighLimit, matchLengthSearch, dictMode);
+    switch(matchLengthSearch)
+    {
+    case 3 : return ZSTD_insertBtAndGetAllMatches(matches, ms, nextToUpdate3, ip, iHighLimit, dictMode, rep, ll0, lengthToBeat, 3);
+    default :
+    case 4 : return ZSTD_insertBtAndGetAllMatches(matches, ms, nextToUpdate3, ip, iHighLimit, dictMode, rep, ll0, lengthToBeat, 4);
+    case 5 : return ZSTD_insertBtAndGetAllMatches(matches, ms, nextToUpdate3, ip, iHighLimit, dictMode, rep, ll0, lengthToBeat, 5);
+    case 7 :
+    case 6 : return ZSTD_insertBtAndGetAllMatches(matches, ms, nextToUpdate3, ip, iHighLimit, dictMode, rep, ll0, lengthToBeat, 6);
+    }
+}
+
+
+/*-*******************************
+*  Optimal parser
+*********************************/
+
+
+static U32 ZSTD_totalLen(ZSTD_optimal_t sol)
+{
+    return sol.litlen + sol.mlen;
+}
+
+#if 0 /* debug */
+
+static void
+listStats(const U32* table, int lastEltID)
+{
+    int const nbElts = lastEltID + 1;
+    int enb;
+    for (enb=0; enb < nbElts; enb++) {
+        (void)table;
+        /* RAWLOG(2, "%3i:%3i,  ", enb, table[enb]); */
+        RAWLOG(2, "%4i,", table[enb]);
+    }
+    RAWLOG(2, " \n");
+}
+
+#endif
+
+FORCE_INLINE_TEMPLATE size_t
+ZSTD_compressBlock_opt_generic(ZSTD_matchState_t* ms,
+                               seqStore_t* seqStore,
+                               U32 rep[ZSTD_REP_NUM],
+                         const void* src, size_t srcSize,
+                         const int optLevel,
+                         const ZSTD_dictMode_e dictMode)
+{
+    optState_t* const optStatePtr = &ms->opt;
+    const BYTE* const istart = (const BYTE*)src;
+    const BYTE* ip = istart;
+    const BYTE* anchor = istart;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* const ilimit = iend - 8;
+    const BYTE* const base = ms->window.base;
+    const BYTE* const prefixStart = base + ms->window.dictLimit;
+    const ZSTD_compressionParameters* const cParams = &ms->cParams;
+
+    U32 const sufficient_len = MIN(cParams->targetLength, ZSTD_OPT_NUM -1);
+    U32 const minMatch = (cParams->minMatch == 3) ? 3 : 4;
+    U32 nextToUpdate3 = ms->nextToUpdate;
+
+    ZSTD_optimal_t* const opt = optStatePtr->priceTable;
+    ZSTD_match_t* const matches = optStatePtr->matchTable;
+    ZSTD_optimal_t lastSequence;
+
+    /* init */
+    DEBUGLOG(5, "ZSTD_compressBlock_opt_generic: current=%u, prefix=%u, nextToUpdate=%u",
+                (U32)(ip - base), ms->window.dictLimit, ms->nextToUpdate);
+    assert(optLevel <= 2);
+    ZSTD_rescaleFreqs(optStatePtr, (const BYTE*)src, srcSize, optLevel);
+    ip += (ip==prefixStart);
+
+    /* Match Loop */
+    while (ip < ilimit) {
+        U32 cur, last_pos = 0;
+
+        /* find first match */
+        {   U32 const litlen = (U32)(ip - anchor);
+            U32 const ll0 = !litlen;
+            U32 const nbMatches = ZSTD_BtGetAllMatches(matches, ms, &nextToUpdate3, ip, iend, dictMode, rep, ll0, minMatch);
+            if (!nbMatches) { ip++; continue; }
+
+            /* initialize opt[0] */
+            { U32 i ; for (i=0; i<ZSTD_REP_NUM; i++) opt[0].rep[i] = rep[i]; }
+            opt[0].mlen = 0;  /* means is_a_literal */
+            opt[0].litlen = litlen;
+            /* We don't need to include the actual price of the literals because
+             * it is static for the duration of the forward pass, and is included
+             * in every price. We include the literal length to avoid negative
+             * prices when we subtract the previous literal length.
+             */
+            opt[0].price = ZSTD_litLengthPrice(litlen, optStatePtr, optLevel);
+
+            /* large match -> immediate encoding */
+            {   U32 const maxML = matches[nbMatches-1].len;
+                U32 const maxOffset = matches[nbMatches-1].off;
+                DEBUGLOG(6, "found %u matches of maxLength=%u and maxOffCode=%u at cPos=%u => start new series",
+                            nbMatches, maxML, maxOffset, (U32)(ip-prefixStart));
+
+                if (maxML > sufficient_len) {
+                    lastSequence.litlen = litlen;
+                    lastSequence.mlen = maxML;
+                    lastSequence.off = maxOffset;
+                    DEBUGLOG(6, "large match (%u>%u), immediate encoding",
+                                maxML, sufficient_len);
+                    cur = 0;
+                    last_pos = ZSTD_totalLen(lastSequence);
+                    goto _shortestPath;
+            }   }
+
+            /* set prices for first matches starting position == 0 */
+            {   U32 const literalsPrice = opt[0].price + ZSTD_litLengthPrice(0, optStatePtr, optLevel);
+                U32 pos;
+                U32 matchNb;
+                for (pos = 1; pos < minMatch; pos++) {
+                    opt[pos].price = ZSTD_MAX_PRICE;   /* mlen, litlen and price will be fixed during forward scanning */
+                }
+                for (matchNb = 0; matchNb < nbMatches; matchNb++) {
+                    U32 const offset = matches[matchNb].off;
+                    U32 const end = matches[matchNb].len;
+                    for ( ; pos <= end ; pos++ ) {
+                        U32 const matchPrice = ZSTD_getMatchPrice(offset, pos, optStatePtr, optLevel);
+                        U32 const sequencePrice = literalsPrice + matchPrice;
+                        DEBUGLOG(7, "rPos:%u => set initial price : %.2f",
+                                    pos, ZSTD_fCost(sequencePrice));
+                        opt[pos].mlen = pos;
+                        opt[pos].off = offset;
+                        opt[pos].litlen = litlen;
+                        opt[pos].price = sequencePrice;
+                }   }
+                last_pos = pos-1;
+            }
+        }
+
+        /* check further positions */
+        for (cur = 1; cur <= last_pos; cur++) {
+            const BYTE* const inr = ip + cur;
+            assert(cur < ZSTD_OPT_NUM);
+            DEBUGLOG(7, "cPos:%zi==rPos:%u", inr-istart, cur)
+
+            /* Fix current position with one literal if cheaper */
+            {   U32 const litlen = (opt[cur-1].mlen == 0) ? opt[cur-1].litlen + 1 : 1;
+                int const price = opt[cur-1].price
+                                + ZSTD_rawLiteralsCost(ip+cur-1, 1, optStatePtr, optLevel)
+                                + ZSTD_litLengthPrice(litlen, optStatePtr, optLevel)
+                                - ZSTD_litLengthPrice(litlen-1, optStatePtr, optLevel);
+                assert(price < 1000000000); /* overflow check */
+                if (price <= opt[cur].price) {
+                    DEBUGLOG(7, "cPos:%zi==rPos:%u : better price (%.2f<=%.2f) using literal (ll==%u) (hist:%u,%u,%u)",
+                                inr-istart, cur, ZSTD_fCost(price), ZSTD_fCost(opt[cur].price), litlen,
+                                opt[cur-1].rep[0], opt[cur-1].rep[1], opt[cur-1].rep[2]);
+                    opt[cur].mlen = 0;
+                    opt[cur].off = 0;
+                    opt[cur].litlen = litlen;
+                    opt[cur].price = price;
+                } else {
+                    DEBUGLOG(7, "cPos:%zi==rPos:%u : literal would cost more (%.2f>%.2f) (hist:%u,%u,%u)",
+                                inr-istart, cur, ZSTD_fCost(price), ZSTD_fCost(opt[cur].price),
+                                opt[cur].rep[0], opt[cur].rep[1], opt[cur].rep[2]);
+                }
+            }
+
+            /* Set the repcodes of the current position. We must do it here
+             * because we rely on the repcodes of the 2nd to last sequence being
+             * correct to set the next chunks repcodes during the backward
+             * traversal.
+             */
+            ZSTD_STATIC_ASSERT(sizeof(opt[cur].rep) == sizeof(repcodes_t));
+            assert(cur >= opt[cur].mlen);
+            if (opt[cur].mlen != 0) {
+                U32 const prev = cur - opt[cur].mlen;
+                repcodes_t newReps = ZSTD_updateRep(opt[prev].rep, opt[cur].off, opt[cur].litlen==0);
+                memcpy(opt[cur].rep, &newReps, sizeof(repcodes_t));
+            } else {
+                memcpy(opt[cur].rep, opt[cur - 1].rep, sizeof(repcodes_t));
+            }
+
+            /* last match must start at a minimum distance of 8 from oend */
+            if (inr > ilimit) continue;
+
+            if (cur == last_pos) break;
+
+            if ( (optLevel==0) /*static_test*/
+              && (opt[cur+1].price <= opt[cur].price + (BITCOST_MULTIPLIER/2)) ) {
+                DEBUGLOG(7, "move to next rPos:%u : price is <=", cur+1);
+                continue;  /* skip unpromising positions; about ~+6% speed, -0.01 ratio */
+            }
+
+            {   U32 const ll0 = (opt[cur].mlen != 0);
+                U32 const litlen = (opt[cur].mlen == 0) ? opt[cur].litlen : 0;
+                U32 const previousPrice = opt[cur].price;
+                U32 const basePrice = previousPrice + ZSTD_litLengthPrice(0, optStatePtr, optLevel);
+                U32 const nbMatches = ZSTD_BtGetAllMatches(matches, ms, &nextToUpdate3, inr, iend, dictMode, opt[cur].rep, ll0, minMatch);
+                U32 matchNb;
+                if (!nbMatches) {
+                    DEBUGLOG(7, "rPos:%u : no match found", cur);
+                    continue;
+                }
+
+                {   U32 const maxML = matches[nbMatches-1].len;
+                    DEBUGLOG(7, "cPos:%zi==rPos:%u, found %u matches, of maxLength=%u",
+                                inr-istart, cur, nbMatches, maxML);
+
+                    if ( (maxML > sufficient_len)
+                      || (cur + maxML >= ZSTD_OPT_NUM) ) {
+                        lastSequence.mlen = maxML;
+                        lastSequence.off = matches[nbMatches-1].off;
+                        lastSequence.litlen = litlen;
+                        cur -= (opt[cur].mlen==0) ? opt[cur].litlen : 0;  /* last sequence is actually only literals, fix cur to last match - note : may underflow, in which case, it's first sequence, and it's okay */
+                        last_pos = cur + ZSTD_totalLen(lastSequence);
+                        if (cur > ZSTD_OPT_NUM) cur = 0;   /* underflow => first match */
+                        goto _shortestPath;
+                }   }
+
+                /* set prices using matches found at position == cur */
+                for (matchNb = 0; matchNb < nbMatches; matchNb++) {
+                    U32 const offset = matches[matchNb].off;
+                    U32 const lastML = matches[matchNb].len;
+                    U32 const startML = (matchNb>0) ? matches[matchNb-1].len+1 : minMatch;
+                    U32 mlen;
+
+                    DEBUGLOG(7, "testing match %u => offCode=%4u, mlen=%2u, llen=%2u",
+                                matchNb, matches[matchNb].off, lastML, litlen);
+
+                    for (mlen = lastML; mlen >= startML; mlen--) {  /* scan downward */
+                        U32 const pos = cur + mlen;
+                        int const price = basePrice + ZSTD_getMatchPrice(offset, mlen, optStatePtr, optLevel);
+
+                        if ((pos > last_pos) || (price < opt[pos].price)) {
+                            DEBUGLOG(7, "rPos:%u (ml=%2u) => new better price (%.2f<%.2f)",
+                                        pos, mlen, ZSTD_fCost(price), ZSTD_fCost(opt[pos].price));
+                            while (last_pos < pos) { opt[last_pos+1].price = ZSTD_MAX_PRICE; last_pos++; }   /* fill empty positions */
+                            opt[pos].mlen = mlen;
+                            opt[pos].off = offset;
+                            opt[pos].litlen = litlen;
+                            opt[pos].price = price;
+                        } else {
+                            DEBUGLOG(7, "rPos:%u (ml=%2u) => new price is worse (%.2f>=%.2f)",
+                                        pos, mlen, ZSTD_fCost(price), ZSTD_fCost(opt[pos].price));
+                            if (optLevel==0) break;  /* early update abort; gets ~+10% speed for about -0.01 ratio loss */
+                        }
+            }   }   }
+        }  /* for (cur = 1; cur <= last_pos; cur++) */
+
+        lastSequence = opt[last_pos];
+        cur = last_pos > ZSTD_totalLen(lastSequence) ? last_pos - ZSTD_totalLen(lastSequence) : 0;  /* single sequence, and it starts before `ip` */
+        assert(cur < ZSTD_OPT_NUM);  /* control overflow*/
+
+_shortestPath:   /* cur, last_pos, best_mlen, best_off have to be set */
+        assert(opt[0].mlen == 0);
+
+        /* Set the next chunk's repcodes based on the repcodes of the beginning
+         * of the last match, and the last sequence. This avoids us having to
+         * update them while traversing the sequences.
+         */
+        if (lastSequence.mlen != 0) {
+            repcodes_t reps = ZSTD_updateRep(opt[cur].rep, lastSequence.off, lastSequence.litlen==0);
+            memcpy(rep, &reps, sizeof(reps));
+        } else {
+            memcpy(rep, opt[cur].rep, sizeof(repcodes_t));
+        }
+
+        {   U32 const storeEnd = cur + 1;
+            U32 storeStart = storeEnd;
+            U32 seqPos = cur;
+
+            DEBUGLOG(6, "start reverse traversal (last_pos:%u, cur:%u)",
+                        last_pos, cur); (void)last_pos;
+            assert(storeEnd < ZSTD_OPT_NUM);
+            DEBUGLOG(6, "last sequence copied into pos=%u (llen=%u,mlen=%u,ofc=%u)",
+                        storeEnd, lastSequence.litlen, lastSequence.mlen, lastSequence.off);
+            opt[storeEnd] = lastSequence;
+            while (seqPos > 0) {
+                U32 const backDist = ZSTD_totalLen(opt[seqPos]);
+                storeStart--;
+                DEBUGLOG(6, "sequence from rPos=%u copied into pos=%u (llen=%u,mlen=%u,ofc=%u)",
+                            seqPos, storeStart, opt[seqPos].litlen, opt[seqPos].mlen, opt[seqPos].off);
+                opt[storeStart] = opt[seqPos];
+                seqPos = (seqPos > backDist) ? seqPos - backDist : 0;
+            }
+
+            /* save sequences */
+            DEBUGLOG(6, "sending selected sequences into seqStore")
+            {   U32 storePos;
+                for (storePos=storeStart; storePos <= storeEnd; storePos++) {
+                    U32 const llen = opt[storePos].litlen;
+                    U32 const mlen = opt[storePos].mlen;
+                    U32 const offCode = opt[storePos].off;
+                    U32 const advance = llen + mlen;
+                    DEBUGLOG(6, "considering seq starting at %zi, llen=%u, mlen=%u",
+                                anchor - istart, (unsigned)llen, (unsigned)mlen);
+
+                    if (mlen==0) {  /* only literals => must be last "sequence", actually starting a new stream of sequences */
+                        assert(storePos == storeEnd);   /* must be last sequence */
+                        ip = anchor + llen;     /* last "sequence" is a bunch of literals => don't progress anchor */
+                        continue;   /* will finish */
+                    }
+
+                    assert(anchor + llen <= iend);
+                    ZSTD_updateStats(optStatePtr, llen, anchor, offCode, mlen);
+                    ZSTD_storeSeq(seqStore, llen, anchor, iend, offCode, mlen-MINMATCH);
+                    anchor += advance;
+                    ip = anchor;
+            }   }
+            ZSTD_setBasePrices(optStatePtr, optLevel);
+        }
+    }   /* while (ip < ilimit) */
+
+    /* Return the last literals size */
+    return (size_t)(iend - anchor);
+}
+
+
+size_t ZSTD_compressBlock_btopt(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        const void* src, size_t srcSize)
+{
+    DEBUGLOG(5, "ZSTD_compressBlock_btopt");
+    return ZSTD_compressBlock_opt_generic(ms, seqStore, rep, src, srcSize, 0 /*optLevel*/, ZSTD_noDict);
+}
+
+
+/* used in 2-pass strategy */
+static U32 ZSTD_upscaleStat(unsigned* table, U32 lastEltIndex, int bonus)
+{
+    U32 s, sum=0;
+    assert(ZSTD_FREQ_DIV+bonus >= 0);
+    for (s=0; s<lastEltIndex+1; s++) {
+        table[s] <<= ZSTD_FREQ_DIV+bonus;
+        table[s]--;
+        sum += table[s];
+    }
+    return sum;
+}
+
+/* used in 2-pass strategy */
+MEM_STATIC void ZSTD_upscaleStats(optState_t* optPtr)
+{
+    if (ZSTD_compressedLiterals(optPtr))
+        optPtr->litSum = ZSTD_upscaleStat(optPtr->litFreq, MaxLit, 0);
+    optPtr->litLengthSum = ZSTD_upscaleStat(optPtr->litLengthFreq, MaxLL, 0);
+    optPtr->matchLengthSum = ZSTD_upscaleStat(optPtr->matchLengthFreq, MaxML, 0);
+    optPtr->offCodeSum = ZSTD_upscaleStat(optPtr->offCodeFreq, MaxOff, 0);
+}
+
+/* ZSTD_initStats_ultra():
+ * make a first compression pass, just to seed stats with more accurate starting values.
+ * only works on first block, with no dictionary and no ldm.
+ * this function cannot error, hence its contract must be respected.
+ */
+static void
+ZSTD_initStats_ultra(ZSTD_matchState_t* ms,
+                     seqStore_t* seqStore,
+                     U32 rep[ZSTD_REP_NUM],
+               const void* src, size_t srcSize)
+{
+    U32 tmpRep[ZSTD_REP_NUM];  /* updated rep codes will sink here */
+    memcpy(tmpRep, rep, sizeof(tmpRep));
+
+    DEBUGLOG(4, "ZSTD_initStats_ultra (srcSize=%zu)", srcSize);
+    assert(ms->opt.litLengthSum == 0);    /* first block */
+    assert(seqStore->sequences == seqStore->sequencesStart);   /* no ldm */
+    assert(ms->window.dictLimit == ms->window.lowLimit);   /* no dictionary */
+    assert(ms->window.dictLimit - ms->nextToUpdate <= 1);  /* no prefix (note: intentional overflow, defined as 2-complement) */
+
+    ZSTD_compressBlock_opt_generic(ms, seqStore, tmpRep, src, srcSize, 2 /*optLevel*/, ZSTD_noDict);   /* generate stats into ms->opt*/
+
+    /* invalidate first scan from history */
+    ZSTD_resetSeqStore(seqStore);
+    ms->window.base -= srcSize;
+    ms->window.dictLimit += (U32)srcSize;
+    ms->window.lowLimit = ms->window.dictLimit;
+    ms->nextToUpdate = ms->window.dictLimit;
+
+    /* re-inforce weight of collected statistics */
+    ZSTD_upscaleStats(&ms->opt);
+}
+
+size_t ZSTD_compressBlock_btultra(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        const void* src, size_t srcSize)
+{
+    DEBUGLOG(5, "ZSTD_compressBlock_btultra (srcSize=%zu)", srcSize);
+    return ZSTD_compressBlock_opt_generic(ms, seqStore, rep, src, srcSize, 2 /*optLevel*/, ZSTD_noDict);
+}
+
+size_t ZSTD_compressBlock_btultra2(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        const void* src, size_t srcSize)
+{
+    U32 const current = (U32)((const BYTE*)src - ms->window.base);
+    DEBUGLOG(5, "ZSTD_compressBlock_btultra2 (srcSize=%zu)", srcSize);
+
+    /* 2-pass strategy:
+     * this strategy makes a first pass over first block to collect statistics
+     * and seed next round's statistics with it.
+     * After 1st pass, function forgets everything, and starts a new block.
+     * Consequently, this can only work if no data has been previously loaded in tables,
+     * aka, no dictionary, no prefix, no ldm preprocessing.
+     * The compression ratio gain is generally small (~0.5% on first block),
+     * the cost is 2x cpu time on first block. */
+    assert(srcSize <= ZSTD_BLOCKSIZE_MAX);
+    if ( (ms->opt.litLengthSum==0)   /* first block */
+      && (seqStore->sequences == seqStore->sequencesStart)  /* no ldm */
+      && (ms->window.dictLimit == ms->window.lowLimit)   /* no dictionary */
+      && (current == ms->window.dictLimit)   /* start of frame, nothing already loaded nor skipped */
+      && (srcSize > ZSTD_PREDEF_THRESHOLD)
+      ) {
+        ZSTD_initStats_ultra(ms, seqStore, rep, src, srcSize);
+    }
+
+    return ZSTD_compressBlock_opt_generic(ms, seqStore, rep, src, srcSize, 2 /*optLevel*/, ZSTD_noDict);
+}
+
+size_t ZSTD_compressBlock_btopt_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        const void* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_opt_generic(ms, seqStore, rep, src, srcSize, 0 /*optLevel*/, ZSTD_dictMatchState);
+}
+
+size_t ZSTD_compressBlock_btultra_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        const void* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_opt_generic(ms, seqStore, rep, src, srcSize, 2 /*optLevel*/, ZSTD_dictMatchState);
+}
+
+size_t ZSTD_compressBlock_btopt_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        const void* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_opt_generic(ms, seqStore, rep, src, srcSize, 0 /*optLevel*/, ZSTD_extDict);
+}
+
+size_t ZSTD_compressBlock_btultra_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        const void* src, size_t srcSize)
+{
+    return ZSTD_compressBlock_opt_generic(ms, seqStore, rep, src, srcSize, 2 /*optLevel*/, ZSTD_extDict);
+}
+
+/* note : no btultra2 variant for extDict nor dictMatchState,
+ * because btultra2 is not meant to work with dictionaries
+ * and is only specific for the first block (no prefix) */
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/huf_decompress.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/huf_decompress.cpp
new file mode 100644
index 0000000000..d6e93ec4b0
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/huf_decompress.cpp
@@ -0,0 +1,1251 @@
+/* ******************************************************************
+ * huff0 huffman decoder,
+ * part of Finite State Entropy library
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ *  You can contact the author at :
+ *  - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+/* **************************************************************
+*  Dependencies
+****************************************************************/
+#include <string.h>     /* memcpy, memset */
+#include "zstd/common/compiler.h"
+#include "zstd/common/bitstream.h"  /* BIT_* */
+#include "zstd/common/fse.h"        /* to compress headers */
+#include "zstd/common/huf.h"
+#include "zstd/common/huf_static.h"
+#include "zstd/common/error_private.h"
+
+namespace lbug_zstd {
+/* **************************************************************
+*  Macros
+****************************************************************/
+
+/* These two optional macros force the use one way or another of the two
+ * Huffman decompression implementations. You can't force in both directions
+ * at the same time.
+ */
+#if defined(HUF_FORCE_DECOMPRESS_X1) && \
+    defined(HUF_FORCE_DECOMPRESS_X2)
+#error "Cannot force the use of the X1 and X2 decoders at the same time!"
+#endif
+
+
+/* **************************************************************
+*  Error Management
+****************************************************************/
+// #define HUF_isError ERR_isError
+
+
+/* **************************************************************
+*  Byte alignment for workSpace management
+****************************************************************/
+#define HUF_ALIGN(x, a)         HUF_ALIGN_MASK((x), (a) - 1)
+#define HUF_ALIGN_MASK(x, mask) (((x) + (mask)) & ~(mask))
+
+
+/* **************************************************************
+*  BMI2 Variant Wrappers
+****************************************************************/
+#if DYNAMIC_BMI2
+
+#define HUF_DGEN(fn)                                                        \
+                                                                            \
+    static size_t fn##_default(                                             \
+                  void* dst,  size_t dstSize,                               \
+            const void* cSrc, size_t cSrcSize,                              \
+            const HUF_DTable* DTable)                                       \
+    {                                                                       \
+        return fn##_body(dst, dstSize, cSrc, cSrcSize, DTable);             \
+    }                                                                       \
+                                                                            \
+    static TARGET_ATTRIBUTE("bmi2") size_t fn##_bmi2(                       \
+                  void* dst,  size_t dstSize,                               \
+            const void* cSrc, size_t cSrcSize,                              \
+            const HUF_DTable* DTable)                                       \
+    {                                                                       \
+        return fn##_body(dst, dstSize, cSrc, cSrcSize, DTable);             \
+    }                                                                       \
+                                                                            \
+    static size_t fn(void* dst, size_t dstSize, void const* cSrc,           \
+                     size_t cSrcSize, HUF_DTable const* DTable, int bmi2)   \
+    {                                                                       \
+        if (bmi2) {                                                         \
+            return fn##_bmi2(dst, dstSize, cSrc, cSrcSize, DTable);         \
+        }                                                                   \
+        return fn##_default(dst, dstSize, cSrc, cSrcSize, DTable);          \
+    }
+
+#else
+
+#define HUF_DGEN(fn)                                                        \
+    static size_t fn(void* dst, size_t dstSize, void const* cSrc,           \
+                     size_t cSrcSize, HUF_DTable const* DTable, int bmi2)   \
+    {                                                                       \
+        (void)bmi2;                                                         \
+        return fn##_body(dst, dstSize, cSrc, cSrcSize, DTable);             \
+    }
+
+#endif
+
+
+/*-***************************/
+/*  generic DTableDesc       */
+/*-***************************/
+typedef struct { BYTE maxTableLog; BYTE tableType; BYTE tableLog; BYTE reserved; } DTableDesc;
+
+static DTableDesc HUF_getDTableDesc(const HUF_DTable* table)
+{
+    DTableDesc dtd;
+    memcpy(&dtd, table, sizeof(dtd));
+    return dtd;
+}
+
+
+#ifndef HUF_FORCE_DECOMPRESS_X2
+
+/*-***************************/
+/*  single-symbol decoding   */
+/*-***************************/
+typedef struct { BYTE byte; BYTE nbBits; } HUF_DEltX1;   /* single-symbol decoding */
+
+size_t HUF_readDTableX1_wksp(HUF_DTable* DTable, const void* src, size_t srcSize, void* workSpace, size_t wkspSize)
+{
+    U32 tableLog = 0;
+    U32 nbSymbols = 0;
+    size_t iSize;
+    void* const dtPtr = DTable + 1;
+    HUF_DEltX1* const dt = (HUF_DEltX1*)dtPtr;
+
+    U32* rankVal;
+    BYTE* huffWeight;
+    size_t spaceUsed32 = 0;
+
+    rankVal = (U32 *)workSpace + spaceUsed32;
+    spaceUsed32 += HUF_TABLELOG_ABSOLUTEMAX + 1;
+    huffWeight = (BYTE *)((U32 *)workSpace + spaceUsed32);
+    spaceUsed32 += HUF_ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
+
+    if ((spaceUsed32 << 2) > wkspSize) return ERROR(tableLog_tooLarge);
+
+    DEBUG_STATIC_ASSERT(sizeof(DTableDesc) == sizeof(HUF_DTable));
+    /* memset(huffWeight, 0, sizeof(huffWeight)); */   /* is not necessary, even though some analyzer complain ... */
+
+    iSize = HUF_readStats(huffWeight, HUF_SYMBOLVALUE_MAX + 1, rankVal, &nbSymbols, &tableLog, src, srcSize);
+    if (HUF_isError(iSize)) return iSize;
+
+    /* Table header */
+    {   DTableDesc dtd = HUF_getDTableDesc(DTable);
+        if (tableLog > (U32)(dtd.maxTableLog+1)) return ERROR(tableLog_tooLarge);   /* DTable too small, Huffman tree cannot fit in */
+        dtd.tableType = 0;
+        dtd.tableLog = (BYTE)tableLog;
+        memcpy(DTable, &dtd, sizeof(dtd));
+    }
+
+    /* Calculate starting value for each rank */
+    {   U32 n, nextRankStart = 0;
+        for (n=1; n<tableLog+1; n++) {
+            U32 const current = nextRankStart;
+            nextRankStart += (rankVal[n] << (n-1));
+            rankVal[n] = current;
+    }   }
+
+    /* fill DTable */
+    {   U32 n;
+        size_t const nEnd = nbSymbols;
+        for (n=0; n<nEnd; n++) {
+            size_t const w = huffWeight[n];
+            size_t const length = (1 << w) >> 1;
+            size_t const uStart = rankVal[w];
+            size_t const uEnd = uStart + length;
+            size_t u;
+            HUF_DEltX1 D;
+            D.byte = (BYTE)n;
+            D.nbBits = (BYTE)(tableLog + 1 - w);
+            rankVal[w] = (U32)uEnd;
+            if (length < 4) {
+                /* Use length in the loop bound so the compiler knows it is short. */
+                for (u = 0; u < length; ++u)
+                    dt[uStart + u] = D;
+            } else {
+                /* Unroll the loop 4 times, we know it is a power of 2. */
+                for (u = uStart; u < uEnd; u += 4) {
+                    dt[u + 0] = D;
+                    dt[u + 1] = D;
+                    dt[u + 2] = D;
+                    dt[u + 3] = D;
+    }   }   }   }
+    return iSize;
+}
+
+size_t HUF_readDTableX1(HUF_DTable* DTable, const void* src, size_t srcSize)
+{
+    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
+    return HUF_readDTableX1_wksp(DTable, src, srcSize,
+                                 workSpace, sizeof(workSpace));
+}
+
+FORCE_INLINE_TEMPLATE BYTE
+HUF_decodeSymbolX1(BIT_DStream_t* Dstream, const HUF_DEltX1* dt, const U32 dtLog)
+{
+    size_t const val = BIT_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
+    BYTE const c = dt[val].byte;
+    BIT_skipBits(Dstream, dt[val].nbBits);
+    return c;
+}
+
+#define HUF_DECODE_SYMBOLX1_0(ptr, DStreamPtr) \
+    *ptr++ = HUF_decodeSymbolX1(DStreamPtr, dt, dtLog)
+
+#define HUF_DECODE_SYMBOLX1_1(ptr, DStreamPtr)  \
+    if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
+        HUF_DECODE_SYMBOLX1_0(ptr, DStreamPtr)
+
+#define HUF_DECODE_SYMBOLX1_2(ptr, DStreamPtr) \
+    if (MEM_64bits()) \
+        HUF_DECODE_SYMBOLX1_0(ptr, DStreamPtr)
+
+HINT_INLINE size_t
+HUF_decodeStreamX1(BYTE* p, BIT_DStream_t* const bitDPtr, BYTE* const pEnd, const HUF_DEltX1* const dt, const U32 dtLog)
+{
+    BYTE* const pStart = p;
+
+    /* up to 4 symbols at a time */
+    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p < pEnd-3)) {
+        HUF_DECODE_SYMBOLX1_2(p, bitDPtr);
+        HUF_DECODE_SYMBOLX1_1(p, bitDPtr);
+        HUF_DECODE_SYMBOLX1_2(p, bitDPtr);
+        HUF_DECODE_SYMBOLX1_0(p, bitDPtr);
+    }
+
+    /* [0-3] symbols remaining */
+    if (MEM_32bits())
+        while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p < pEnd))
+            HUF_DECODE_SYMBOLX1_0(p, bitDPtr);
+
+    /* no more data to retrieve from bitstream, no need to reload */
+    while (p < pEnd)
+        HUF_DECODE_SYMBOLX1_0(p, bitDPtr);
+
+    return pEnd-pStart;
+}
+
+FORCE_INLINE_TEMPLATE size_t
+HUF_decompress1X1_usingDTable_internal_body(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    BYTE* op = (BYTE*)dst;
+    BYTE* const oend = op + dstSize;
+    const void* dtPtr = DTable + 1;
+    const HUF_DEltX1* const dt = (const HUF_DEltX1*)dtPtr;
+    BIT_DStream_t bitD;
+    DTableDesc const dtd = HUF_getDTableDesc(DTable);
+    U32 const dtLog = dtd.tableLog;
+
+    CHECK_F( BIT_initDStream(&bitD, cSrc, cSrcSize) );
+
+    HUF_decodeStreamX1(op, &bitD, oend, dt, dtLog);
+
+    if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
+
+    return dstSize;
+}
+
+FORCE_INLINE_TEMPLATE size_t
+HUF_decompress4X1_usingDTable_internal_body(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    /* Check */
+    if (cSrcSize < 10) return ERROR(corruption_detected);  /* strict minimum : jump table + 1 byte per stream */
+
+    {   const BYTE* const istart = (const BYTE*) cSrc;
+        BYTE* const ostart = (BYTE*) dst;
+        BYTE* const oend = ostart + dstSize;
+        BYTE* const olimit = oend - 3;
+        const void* const dtPtr = DTable + 1;
+        const HUF_DEltX1* const dt = (const HUF_DEltX1*)dtPtr;
+
+        /* Init */
+        BIT_DStream_t bitD1;
+        BIT_DStream_t bitD2;
+        BIT_DStream_t bitD3;
+        BIT_DStream_t bitD4;
+        size_t const length1 = MEM_readLE16(istart);
+        size_t const length2 = MEM_readLE16(istart+2);
+        size_t const length3 = MEM_readLE16(istart+4);
+        size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
+        const BYTE* const istart1 = istart + 6;  /* jumpTable */
+        const BYTE* const istart2 = istart1 + length1;
+        const BYTE* const istart3 = istart2 + length2;
+        const BYTE* const istart4 = istart3 + length3;
+        const size_t segmentSize = (dstSize+3) / 4;
+        BYTE* const opStart2 = ostart + segmentSize;
+        BYTE* const opStart3 = opStart2 + segmentSize;
+        BYTE* const opStart4 = opStart3 + segmentSize;
+        BYTE* op1 = ostart;
+        BYTE* op2 = opStart2;
+        BYTE* op3 = opStart3;
+        BYTE* op4 = opStart4;
+        DTableDesc const dtd = HUF_getDTableDesc(DTable);
+        U32 const dtLog = dtd.tableLog;
+        U32 endSignal = 1;
+
+        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
+        CHECK_F( BIT_initDStream(&bitD1, istart1, length1) );
+        CHECK_F( BIT_initDStream(&bitD2, istart2, length2) );
+        CHECK_F( BIT_initDStream(&bitD3, istart3, length3) );
+        CHECK_F( BIT_initDStream(&bitD4, istart4, length4) );
+
+        /* up to 16 symbols per loop (4 symbols per stream) in 64-bit mode */
+        for ( ; (endSignal) & (op4 < olimit) ; ) {
+            HUF_DECODE_SYMBOLX1_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX1_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX1_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX1_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX1_1(op1, &bitD1);
+            HUF_DECODE_SYMBOLX1_1(op2, &bitD2);
+            HUF_DECODE_SYMBOLX1_1(op3, &bitD3);
+            HUF_DECODE_SYMBOLX1_1(op4, &bitD4);
+            HUF_DECODE_SYMBOLX1_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX1_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX1_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX1_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX1_0(op1, &bitD1);
+            HUF_DECODE_SYMBOLX1_0(op2, &bitD2);
+            HUF_DECODE_SYMBOLX1_0(op3, &bitD3);
+            HUF_DECODE_SYMBOLX1_0(op4, &bitD4);
+            endSignal &= BIT_reloadDStreamFast(&bitD1) == BIT_DStream_unfinished;
+            endSignal &= BIT_reloadDStreamFast(&bitD2) == BIT_DStream_unfinished;
+            endSignal &= BIT_reloadDStreamFast(&bitD3) == BIT_DStream_unfinished;
+            endSignal &= BIT_reloadDStreamFast(&bitD4) == BIT_DStream_unfinished;
+        }
+
+        /* check corruption */
+        /* note : should not be necessary : op# advance in lock step, and we control op4.
+         *        but curiously, binary generated by gcc 7.2 & 7.3 with -mbmi2 runs faster when >=1 test is present */
+        if (op1 > opStart2) return ERROR(corruption_detected);
+        if (op2 > opStart3) return ERROR(corruption_detected);
+        if (op3 > opStart4) return ERROR(corruption_detected);
+        /* note : op4 supposed already verified within main loop */
+
+        /* finish bitStreams one by one */
+        HUF_decodeStreamX1(op1, &bitD1, opStart2, dt, dtLog);
+        HUF_decodeStreamX1(op2, &bitD2, opStart3, dt, dtLog);
+        HUF_decodeStreamX1(op3, &bitD3, opStart4, dt, dtLog);
+        HUF_decodeStreamX1(op4, &bitD4, oend,     dt, dtLog);
+
+        /* check */
+        { U32 const endCheck = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
+          if (!endCheck) return ERROR(corruption_detected); }
+
+        /* decoded size */
+        return dstSize;
+    }
+}
+
+
+typedef size_t (*HUF_decompress_usingDTable_t)(void *dst, size_t dstSize,
+                                               const void *cSrc,
+                                               size_t cSrcSize,
+                                               const HUF_DTable *DTable);
+
+HUF_DGEN(HUF_decompress1X1_usingDTable_internal)
+HUF_DGEN(HUF_decompress4X1_usingDTable_internal)
+
+
+
+size_t HUF_decompress1X1_usingDTable(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    if (dtd.tableType != 0) return ERROR(GENERIC);
+    return HUF_decompress1X1_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+}
+
+size_t HUF_decompress1X1_DCtx_wksp(HUF_DTable* DCtx, void* dst, size_t dstSize,
+                                   const void* cSrc, size_t cSrcSize,
+                                   void* workSpace, size_t wkspSize)
+{
+    const BYTE* ip = (const BYTE*) cSrc;
+
+    size_t const hSize = HUF_readDTableX1_wksp(DCtx, cSrc, cSrcSize, workSpace, wkspSize);
+    if (HUF_isError(hSize)) return hSize;
+    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+    ip += hSize; cSrcSize -= hSize;
+
+    return HUF_decompress1X1_usingDTable_internal(dst, dstSize, ip, cSrcSize, DCtx, /* bmi2 */ 0);
+}
+
+
+size_t HUF_decompress1X1_DCtx(HUF_DTable* DCtx, void* dst, size_t dstSize,
+                              const void* cSrc, size_t cSrcSize)
+{
+    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
+    return HUF_decompress1X1_DCtx_wksp(DCtx, dst, dstSize, cSrc, cSrcSize,
+                                       workSpace, sizeof(workSpace));
+}
+
+size_t HUF_decompress1X1 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    HUF_CREATE_STATIC_DTABLEX1(DTable, HUF_TABLELOG_MAX);
+    return HUF_decompress1X1_DCtx (DTable, dst, dstSize, cSrc, cSrcSize);
+}
+
+size_t HUF_decompress4X1_usingDTable(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    if (dtd.tableType != 0) return ERROR(GENERIC);
+    return HUF_decompress4X1_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+}
+
+static size_t HUF_decompress4X1_DCtx_wksp_bmi2(HUF_DTable* dctx, void* dst, size_t dstSize,
+                                   const void* cSrc, size_t cSrcSize,
+                                   void* workSpace, size_t wkspSize, int bmi2)
+{
+    const BYTE* ip = (const BYTE*) cSrc;
+
+    size_t const hSize = HUF_readDTableX1_wksp (dctx, cSrc, cSrcSize,
+                                                workSpace, wkspSize);
+    if (HUF_isError(hSize)) return hSize;
+    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+    ip += hSize; cSrcSize -= hSize;
+
+    return HUF_decompress4X1_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx, bmi2);
+}
+
+size_t HUF_decompress4X1_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize,
+                                   const void* cSrc, size_t cSrcSize,
+                                   void* workSpace, size_t wkspSize)
+{
+    return HUF_decompress4X1_DCtx_wksp_bmi2(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize, 0);
+}
+
+
+size_t HUF_decompress4X1_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
+    return HUF_decompress4X1_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize,
+                                       workSpace, sizeof(workSpace));
+}
+size_t HUF_decompress4X1 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    HUF_CREATE_STATIC_DTABLEX1(DTable, HUF_TABLELOG_MAX);
+    return HUF_decompress4X1_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
+}
+
+#endif /* HUF_FORCE_DECOMPRESS_X2 */
+
+
+#ifndef HUF_FORCE_DECOMPRESS_X1
+
+/* *************************/
+/* double-symbols decoding */
+/* *************************/
+
+typedef struct { U16 sequence; BYTE nbBits; BYTE length; } HUF_DEltX2;  /* double-symbols decoding */
+typedef struct { BYTE symbol; BYTE weight; } sortedSymbol_t;
+typedef U32 rankValCol_t[HUF_TABLELOG_MAX + 1];
+typedef rankValCol_t rankVal_t[HUF_TABLELOG_MAX];
+
+
+/* HUF_fillDTableX2Level2() :
+ * `rankValOrigin` must be a table of at least (HUF_TABLELOG_MAX + 1) U32 */
+static void HUF_fillDTableX2Level2(HUF_DEltX2* DTable, U32 sizeLog, const U32 consumed,
+                           const U32* rankValOrigin, const int minWeight,
+                           const sortedSymbol_t* sortedSymbols, const U32 sortedListSize,
+                           U32 nbBitsBaseline, U16 baseSeq)
+{
+    HUF_DEltX2 DElt;
+    U32 rankVal[HUF_TABLELOG_MAX + 1];
+
+    /* get pre-calculated rankVal */
+    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
+
+    /* fill skipped values */
+    if (minWeight>1) {
+        U32 i, skipSize = rankVal[minWeight];
+        MEM_writeLE16(&(DElt.sequence), baseSeq);
+        DElt.nbBits   = (BYTE)(consumed);
+        DElt.length   = 1;
+        for (i = 0; i < skipSize; i++)
+            DTable[i] = DElt;
+    }
+
+    /* fill DTable */
+    {   U32 s; for (s=0; s<sortedListSize; s++) {   /* note : sortedSymbols already skipped */
+            const U32 symbol = sortedSymbols[s].symbol;
+            const U32 weight = sortedSymbols[s].weight;
+            const U32 nbBits = nbBitsBaseline - weight;
+            const U32 length = 1 << (sizeLog-nbBits);
+            const U32 start = rankVal[weight];
+            U32 i = start;
+            const U32 end = start + length;
+
+            MEM_writeLE16(&(DElt.sequence), (U16)(baseSeq + (symbol << 8)));
+            DElt.nbBits = (BYTE)(nbBits + consumed);
+            DElt.length = 2;
+            do { DTable[i++] = DElt; } while (i<end);   /* since length >= 1 */
+
+            rankVal[weight] += length;
+    }   }
+}
+
+
+static void HUF_fillDTableX2(HUF_DEltX2* DTable, const U32 targetLog,
+                           const sortedSymbol_t* sortedList, const U32 sortedListSize,
+                           const U32* rankStart, rankVal_t rankValOrigin, const U32 maxWeight,
+                           const U32 nbBitsBaseline)
+{
+    U32 rankVal[HUF_TABLELOG_MAX + 1];
+    const int scaleLog = nbBitsBaseline - targetLog;   /* note : targetLog >= srcLog, hence scaleLog <= 1 */
+    const U32 minBits  = nbBitsBaseline - maxWeight;
+    U32 s;
+
+    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
+
+    /* fill DTable */
+    for (s=0; s<sortedListSize; s++) {
+        const U16 symbol = sortedList[s].symbol;
+        const U32 weight = sortedList[s].weight;
+        const U32 nbBits = nbBitsBaseline - weight;
+        const U32 start = rankVal[weight];
+        const U32 length = 1 << (targetLog-nbBits);
+
+        if (targetLog-nbBits >= minBits) {   /* enough room for a second symbol */
+            U32 sortedRank;
+            int minWeight = nbBits + scaleLog;
+            if (minWeight < 1) minWeight = 1;
+            sortedRank = rankStart[minWeight];
+            HUF_fillDTableX2Level2(DTable+start, targetLog-nbBits, nbBits,
+                           rankValOrigin[nbBits], minWeight,
+                           sortedList+sortedRank, sortedListSize-sortedRank,
+                           nbBitsBaseline, symbol);
+        } else {
+            HUF_DEltX2 DElt;
+            MEM_writeLE16(&(DElt.sequence), symbol);
+            DElt.nbBits = (BYTE)(nbBits);
+            DElt.length = 1;
+            {   U32 const end = start + length;
+                U32 u;
+                for (u = start; u < end; u++) DTable[u] = DElt;
+        }   }
+        rankVal[weight] += length;
+    }
+}
+
+size_t HUF_readDTableX2_wksp(HUF_DTable* DTable,
+                       const void* src, size_t srcSize,
+                             void* workSpace, size_t wkspSize)
+{
+    U32 tableLog, maxW, sizeOfSort, nbSymbols;
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    U32 const maxTableLog = dtd.maxTableLog;
+    size_t iSize;
+    void* dtPtr = DTable+1;   /* force compiler to avoid strict-aliasing */
+    HUF_DEltX2* const dt = (HUF_DEltX2*)dtPtr;
+    U32 *rankStart;
+
+    rankValCol_t* rankVal;
+    U32* rankStats;
+    U32* rankStart0;
+    sortedSymbol_t* sortedSymbol;
+    BYTE* weightList;
+    size_t spaceUsed32 = 0;
+
+    rankVal = (rankValCol_t *)((U32 *)workSpace + spaceUsed32);
+    spaceUsed32 += (sizeof(rankValCol_t) * HUF_TABLELOG_MAX) >> 2;
+    rankStats = (U32 *)workSpace + spaceUsed32;
+    spaceUsed32 += HUF_TABLELOG_MAX + 1;
+    rankStart0 = (U32 *)workSpace + spaceUsed32;
+    spaceUsed32 += HUF_TABLELOG_MAX + 2;
+    sortedSymbol = (sortedSymbol_t *)workSpace + (spaceUsed32 * sizeof(U32)) / sizeof(sortedSymbol_t);
+    spaceUsed32 += HUF_ALIGN(sizeof(sortedSymbol_t) * (HUF_SYMBOLVALUE_MAX + 1), sizeof(U32)) >> 2;
+    weightList = (BYTE *)((U32 *)workSpace + spaceUsed32);
+    spaceUsed32 += HUF_ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
+
+    if ((spaceUsed32 << 2) > wkspSize) return ERROR(tableLog_tooLarge);
+
+    rankStart = rankStart0 + 1;
+    memset(rankStats, 0, sizeof(U32) * (2 * HUF_TABLELOG_MAX + 2 + 1));
+
+    DEBUG_STATIC_ASSERT(sizeof(HUF_DEltX2) == sizeof(HUF_DTable));   /* if compiler fails here, assertion is wrong */
+    if (maxTableLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
+    /* memset(weightList, 0, sizeof(weightList)); */  /* is not necessary, even though some analyzer complain ... */
+
+    iSize = HUF_readStats(weightList, HUF_SYMBOLVALUE_MAX + 1, rankStats, &nbSymbols, &tableLog, src, srcSize);
+    if (HUF_isError(iSize)) return iSize;
+
+    /* check result */
+    if (tableLog > maxTableLog) return ERROR(tableLog_tooLarge);   /* DTable can't fit code depth */
+
+    /* find maxWeight */
+    for (maxW = tableLog; rankStats[maxW]==0; maxW--) {}  /* necessarily finds a solution before 0 */
+
+    /* Get start index of each weight */
+    {   U32 w, nextRankStart = 0;
+        for (w=1; w<maxW+1; w++) {
+            U32 current = nextRankStart;
+            nextRankStart += rankStats[w];
+            rankStart[w] = current;
+        }
+        rankStart[0] = nextRankStart;   /* put all 0w symbols at the end of sorted list*/
+        sizeOfSort = nextRankStart;
+    }
+
+    /* sort symbols by weight */
+    {   U32 s;
+        for (s=0; s<nbSymbols; s++) {
+            U32 const w = weightList[s];
+            U32 const r = rankStart[w]++;
+            sortedSymbol[r].symbol = (BYTE)s;
+            sortedSymbol[r].weight = (BYTE)w;
+        }
+        rankStart[0] = 0;   /* forget 0w symbols; this is beginning of weight(1) */
+    }
+
+    /* Build rankVal */
+    {   U32* const rankVal0 = rankVal[0];
+        {   int const rescale = (maxTableLog-tableLog) - 1;   /* tableLog <= maxTableLog */
+            U32 nextRankVal = 0;
+            U32 w;
+            for (w=1; w<maxW+1; w++) {
+                U32 current = nextRankVal;
+                nextRankVal += rankStats[w] << (w+rescale);
+                rankVal0[w] = current;
+        }   }
+        {   U32 const minBits = tableLog+1 - maxW;
+            U32 consumed;
+            for (consumed = minBits; consumed < maxTableLog - minBits + 1; consumed++) {
+                U32* const rankValPtr = rankVal[consumed];
+                U32 w;
+                for (w = 1; w < maxW+1; w++) {
+                    rankValPtr[w] = rankVal0[w] >> consumed;
+    }   }   }   }
+
+    HUF_fillDTableX2(dt, maxTableLog,
+                   sortedSymbol, sizeOfSort,
+                   rankStart0, rankVal, maxW,
+                   tableLog+1);
+
+    dtd.tableLog = (BYTE)maxTableLog;
+    dtd.tableType = 1;
+    memcpy(DTable, &dtd, sizeof(dtd));
+    return iSize;
+}
+
+size_t HUF_readDTableX2(HUF_DTable* DTable, const void* src, size_t srcSize)
+{
+  U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
+  return HUF_readDTableX2_wksp(DTable, src, srcSize,
+                               workSpace, sizeof(workSpace));
+}
+
+
+FORCE_INLINE_TEMPLATE U32
+HUF_decodeSymbolX2(void* op, BIT_DStream_t* DStream, const HUF_DEltX2* dt, const U32 dtLog)
+{
+    size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
+    memcpy(op, dt+val, 2);
+    BIT_skipBits(DStream, dt[val].nbBits);
+    return dt[val].length;
+}
+
+FORCE_INLINE_TEMPLATE U32
+HUF_decodeLastSymbolX2(void* op, BIT_DStream_t* DStream, const HUF_DEltX2* dt, const U32 dtLog)
+{
+    size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
+    memcpy(op, dt+val, 1);
+    if (dt[val].length==1) BIT_skipBits(DStream, dt[val].nbBits);
+    else {
+        if (DStream->bitsConsumed < (sizeof(DStream->bitContainer)*8)) {
+            BIT_skipBits(DStream, dt[val].nbBits);
+            if (DStream->bitsConsumed > (sizeof(DStream->bitContainer)*8))
+                /* ugly hack; works only because it's the last symbol. Note : can't easily extract nbBits from just this symbol */
+                DStream->bitsConsumed = (sizeof(DStream->bitContainer)*8);
+    }   }
+    return 1;
+}
+
+#define HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr) \
+    ptr += HUF_decodeSymbolX2(ptr, DStreamPtr, dt, dtLog)
+
+#define HUF_DECODE_SYMBOLX2_1(ptr, DStreamPtr) \
+    if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
+        ptr += HUF_decodeSymbolX2(ptr, DStreamPtr, dt, dtLog)
+
+#define HUF_DECODE_SYMBOLX2_2(ptr, DStreamPtr) \
+    if (MEM_64bits()) \
+        ptr += HUF_decodeSymbolX2(ptr, DStreamPtr, dt, dtLog)
+
+HINT_INLINE size_t
+HUF_decodeStreamX2(BYTE* p, BIT_DStream_t* bitDPtr, BYTE* const pEnd,
+                const HUF_DEltX2* const dt, const U32 dtLog)
+{
+    BYTE* const pStart = p;
+
+    /* up to 8 symbols at a time */
+    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p < pEnd-(sizeof(bitDPtr->bitContainer)-1))) {
+        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
+        HUF_DECODE_SYMBOLX2_1(p, bitDPtr);
+        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
+        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
+    }
+
+    /* closer to end : up to 2 symbols at a time */
+    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p <= pEnd-2))
+        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
+
+    while (p <= pEnd-2)
+        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);   /* no need to reload : reached the end of DStream */
+
+    if (p < pEnd)
+        p += HUF_decodeLastSymbolX2(p, bitDPtr, dt, dtLog);
+
+    return p-pStart;
+}
+
+FORCE_INLINE_TEMPLATE size_t
+HUF_decompress1X2_usingDTable_internal_body(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    BIT_DStream_t bitD;
+
+    /* Init */
+    CHECK_F( BIT_initDStream(&bitD, cSrc, cSrcSize) );
+
+    /* decode */
+    {   BYTE* const ostart = (BYTE*) dst;
+        BYTE* const oend = ostart + dstSize;
+        const void* const dtPtr = DTable+1;   /* force compiler to not use strict-aliasing */
+        const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
+        DTableDesc const dtd = HUF_getDTableDesc(DTable);
+        HUF_decodeStreamX2(ostart, &bitD, oend, dt, dtd.tableLog);
+    }
+
+    /* check */
+    if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
+
+    /* decoded size */
+    return dstSize;
+}
+
+FORCE_INLINE_TEMPLATE size_t
+HUF_decompress4X2_usingDTable_internal_body(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    if (cSrcSize < 10) return ERROR(corruption_detected);   /* strict minimum : jump table + 1 byte per stream */
+
+    {   const BYTE* const istart = (const BYTE*) cSrc;
+        BYTE* const ostart = (BYTE*) dst;
+        BYTE* const oend = ostart + dstSize;
+        BYTE* const olimit = oend - (sizeof(size_t)-1);
+        const void* const dtPtr = DTable+1;
+        const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
+
+        /* Init */
+        BIT_DStream_t bitD1;
+        BIT_DStream_t bitD2;
+        BIT_DStream_t bitD3;
+        BIT_DStream_t bitD4;
+        size_t const length1 = MEM_readLE16(istart);
+        size_t const length2 = MEM_readLE16(istart+2);
+        size_t const length3 = MEM_readLE16(istart+4);
+        size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
+        const BYTE* const istart1 = istart + 6;  /* jumpTable */
+        const BYTE* const istart2 = istart1 + length1;
+        const BYTE* const istart3 = istart2 + length2;
+        const BYTE* const istart4 = istart3 + length3;
+        size_t const segmentSize = (dstSize+3) / 4;
+        BYTE* const opStart2 = ostart + segmentSize;
+        BYTE* const opStart3 = opStart2 + segmentSize;
+        BYTE* const opStart4 = opStart3 + segmentSize;
+        BYTE* op1 = ostart;
+        BYTE* op2 = opStart2;
+        BYTE* op3 = opStart3;
+        BYTE* op4 = opStart4;
+        U32 endSignal = 1;
+        DTableDesc const dtd = HUF_getDTableDesc(DTable);
+        U32 const dtLog = dtd.tableLog;
+
+        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
+        CHECK_F( BIT_initDStream(&bitD1, istart1, length1) );
+        CHECK_F( BIT_initDStream(&bitD2, istart2, length2) );
+        CHECK_F( BIT_initDStream(&bitD3, istart3, length3) );
+        CHECK_F( BIT_initDStream(&bitD4, istart4, length4) );
+
+        /* 16-32 symbols per loop (4-8 symbols per stream) */
+        for ( ; (endSignal) & (op4 < olimit); ) {
+#if defined(__clang__) && (defined(__x86_64__) || defined(__i386__))
+            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_1(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_0(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_1(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_0(op2, &bitD2);
+            endSignal &= BIT_reloadDStreamFast(&bitD1) == BIT_DStream_unfinished;
+            endSignal &= BIT_reloadDStreamFast(&bitD2) == BIT_DStream_unfinished;
+            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_1(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_0(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX2_1(op4, &bitD4);
+            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX2_0(op4, &bitD4);
+            endSignal &= BIT_reloadDStreamFast(&bitD3) == BIT_DStream_unfinished;
+            endSignal &= BIT_reloadDStreamFast(&bitD4) == BIT_DStream_unfinished;
+#else
+            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX2_1(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_1(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_1(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_1(op4, &bitD4);
+            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
+            HUF_DECODE_SYMBOLX2_0(op1, &bitD1);
+            HUF_DECODE_SYMBOLX2_0(op2, &bitD2);
+            HUF_DECODE_SYMBOLX2_0(op3, &bitD3);
+            HUF_DECODE_SYMBOLX2_0(op4, &bitD4);
+            endSignal = (U32)LIKELY(
+			    (U32)(BIT_reloadDStreamFast(&bitD1) == BIT_DStream_unfinished)
+                      & (U32)(BIT_reloadDStreamFast(&bitD2) == BIT_DStream_unfinished)
+                      & (U32)(BIT_reloadDStreamFast(&bitD3) == BIT_DStream_unfinished)
+                      & (U32)(BIT_reloadDStreamFast(&bitD4) == BIT_DStream_unfinished));
+#endif
+        }
+
+        /* check corruption */
+        if (op1 > opStart2) return ERROR(corruption_detected);
+        if (op2 > opStart3) return ERROR(corruption_detected);
+        if (op3 > opStart4) return ERROR(corruption_detected);
+        /* note : op4 already verified within main loop */
+
+        /* finish bitStreams one by one */
+        HUF_decodeStreamX2(op1, &bitD1, opStart2, dt, dtLog);
+        HUF_decodeStreamX2(op2, &bitD2, opStart3, dt, dtLog);
+        HUF_decodeStreamX2(op3, &bitD3, opStart4, dt, dtLog);
+        HUF_decodeStreamX2(op4, &bitD4, oend,     dt, dtLog);
+
+        /* check */
+        { U32 const endCheck = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
+          if (!endCheck) return ERROR(corruption_detected); }
+
+        /* decoded size */
+        return dstSize;
+    }
+}
+
+HUF_DGEN(HUF_decompress1X2_usingDTable_internal)
+HUF_DGEN(HUF_decompress4X2_usingDTable_internal)
+
+size_t HUF_decompress1X2_usingDTable(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    if (dtd.tableType != 1) return ERROR(GENERIC);
+    return HUF_decompress1X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+}
+
+size_t HUF_decompress1X2_DCtx_wksp(HUF_DTable* DCtx, void* dst, size_t dstSize,
+                                   const void* cSrc, size_t cSrcSize,
+                                   void* workSpace, size_t wkspSize)
+{
+    const BYTE* ip = (const BYTE*) cSrc;
+
+    size_t const hSize = HUF_readDTableX2_wksp(DCtx, cSrc, cSrcSize,
+                                               workSpace, wkspSize);
+    if (HUF_isError(hSize)) return hSize;
+    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+    ip += hSize; cSrcSize -= hSize;
+
+    return HUF_decompress1X2_usingDTable_internal(dst, dstSize, ip, cSrcSize, DCtx, /* bmi2 */ 0);
+}
+
+
+size_t HUF_decompress1X2_DCtx(HUF_DTable* DCtx, void* dst, size_t dstSize,
+                              const void* cSrc, size_t cSrcSize)
+{
+    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
+    return HUF_decompress1X2_DCtx_wksp(DCtx, dst, dstSize, cSrc, cSrcSize,
+                                       workSpace, sizeof(workSpace));
+}
+
+size_t HUF_decompress1X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
+    return HUF_decompress1X2_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
+}
+
+size_t HUF_decompress4X2_usingDTable(
+          void* dst,  size_t dstSize,
+    const void* cSrc, size_t cSrcSize,
+    const HUF_DTable* DTable)
+{
+    DTableDesc dtd = HUF_getDTableDesc(DTable);
+    if (dtd.tableType != 1) return ERROR(GENERIC);
+    return HUF_decompress4X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+}
+
+static size_t HUF_decompress4X2_DCtx_wksp_bmi2(HUF_DTable* dctx, void* dst, size_t dstSize,
+                                   const void* cSrc, size_t cSrcSize,
+                                   void* workSpace, size_t wkspSize, int bmi2)
+{
+    const BYTE* ip = (const BYTE*) cSrc;
+
+    size_t hSize = HUF_readDTableX2_wksp(dctx, cSrc, cSrcSize,
+                                         workSpace, wkspSize);
+    if (HUF_isError(hSize)) return hSize;
+    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+    ip += hSize; cSrcSize -= hSize;
+
+    return HUF_decompress4X2_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx, bmi2);
+}
+
+size_t HUF_decompress4X2_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize,
+                                   const void* cSrc, size_t cSrcSize,
+                                   void* workSpace, size_t wkspSize)
+{
+    return HUF_decompress4X2_DCtx_wksp_bmi2(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize, /* bmi2 */ 0);
+}
+
+
+size_t HUF_decompress4X2_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize,
+                              const void* cSrc, size_t cSrcSize)
+{
+    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
+    return HUF_decompress4X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize,
+                                       workSpace, sizeof(workSpace));
+}
+
+size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
+    return HUF_decompress4X2_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
+}
+
+#endif /* HUF_FORCE_DECOMPRESS_X1 */
+
+
+/* ***********************************/
+/* Universal decompression selectors */
+/* ***********************************/
+
+size_t HUF_decompress1X_usingDTable(void* dst, size_t maxDstSize,
+                                    const void* cSrc, size_t cSrcSize,
+                                    const HUF_DTable* DTable)
+{
+    DTableDesc const dtd = HUF_getDTableDesc(DTable);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+    (void)dtd;
+    assert(dtd.tableType == 0);
+    return HUF_decompress1X1_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+    (void)dtd;
+    assert(dtd.tableType == 1);
+    return HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+#else
+    return dtd.tableType ? HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0) :
+                           HUF_decompress1X1_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+#endif
+}
+
+size_t HUF_decompress4X_usingDTable(void* dst, size_t maxDstSize,
+                                    const void* cSrc, size_t cSrcSize,
+                                    const HUF_DTable* DTable)
+{
+    DTableDesc const dtd = HUF_getDTableDesc(DTable);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+    (void)dtd;
+    assert(dtd.tableType == 0);
+    return HUF_decompress4X1_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+    (void)dtd;
+    assert(dtd.tableType == 1);
+    return HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+#else
+    return dtd.tableType ? HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0) :
+                           HUF_decompress4X1_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, /* bmi2 */ 0);
+#endif
+}
+
+
+#if !defined(HUF_FORCE_DECOMPRESS_X1) && !defined(HUF_FORCE_DECOMPRESS_X2)
+typedef struct { U32 tableTime; U32 decode256Time; } algo_time_t;
+static const algo_time_t algoTime[16 /* Quantization */][3 /* single, double, quad */] =
+{
+    /* single, double, quad */
+    {{0,0}, {1,1}, {2,2}},  /* Q==0 : impossible */
+    {{0,0}, {1,1}, {2,2}},  /* Q==1 : impossible */
+    {{  38,130}, {1313, 74}, {2151, 38}},   /* Q == 2 : 12-18% */
+    {{ 448,128}, {1353, 74}, {2238, 41}},   /* Q == 3 : 18-25% */
+    {{ 556,128}, {1353, 74}, {2238, 47}},   /* Q == 4 : 25-32% */
+    {{ 714,128}, {1418, 74}, {2436, 53}},   /* Q == 5 : 32-38% */
+    {{ 883,128}, {1437, 74}, {2464, 61}},   /* Q == 6 : 38-44% */
+    {{ 897,128}, {1515, 75}, {2622, 68}},   /* Q == 7 : 44-50% */
+    {{ 926,128}, {1613, 75}, {2730, 75}},   /* Q == 8 : 50-56% */
+    {{ 947,128}, {1729, 77}, {3359, 77}},   /* Q == 9 : 56-62% */
+    {{1107,128}, {2083, 81}, {4006, 84}},   /* Q ==10 : 62-69% */
+    {{1177,128}, {2379, 87}, {4785, 88}},   /* Q ==11 : 69-75% */
+    {{1242,128}, {2415, 93}, {5155, 84}},   /* Q ==12 : 75-81% */
+    {{1349,128}, {2644,106}, {5260,106}},   /* Q ==13 : 81-87% */
+    {{1455,128}, {2422,124}, {4174,124}},   /* Q ==14 : 87-93% */
+    {{ 722,128}, {1891,145}, {1936,146}},   /* Q ==15 : 93-99% */
+};
+#endif
+
+/** HUF_selectDecoder() :
+ *  Tells which decoder is likely to decode faster,
+ *  based on a set of pre-computed metrics.
+ * @return : 0==HUF_decompress4X1, 1==HUF_decompress4X2 .
+ *  Assumption : 0 < dstSize <= 128 KB */
+U32 HUF_selectDecoder (size_t dstSize, size_t cSrcSize)
+{
+    assert(dstSize > 0);
+    assert(dstSize <= 128*1024);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+    (void)dstSize;
+    (void)cSrcSize;
+    return 0;
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+    (void)dstSize;
+    (void)cSrcSize;
+    return 1;
+#else
+    /* decoder timing evaluation */
+    {   U32 const Q = (cSrcSize >= dstSize) ? 15 : (U32)(cSrcSize * 16 / dstSize);   /* Q < 16 */
+        U32 const D256 = (U32)(dstSize >> 8);
+        U32 const DTime0 = algoTime[Q][0].tableTime + (algoTime[Q][0].decode256Time * D256);
+        U32 DTime1 = algoTime[Q][1].tableTime + (algoTime[Q][1].decode256Time * D256);
+        DTime1 += DTime1 >> 3;  /* advantage to algorithm using less memory, to reduce cache eviction */
+        return DTime1 < DTime0;
+    }
+#endif
+}
+
+
+typedef size_t (*decompressionAlgo)(void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);
+
+size_t HUF_decompress (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+#if !defined(HUF_FORCE_DECOMPRESS_X1) && !defined(HUF_FORCE_DECOMPRESS_X2)
+    static const decompressionAlgo decompress[2] = { HUF_decompress4X1, HUF_decompress4X2 };
+#endif
+
+    /* validation checks */
+    if (dstSize == 0) return ERROR(dstSize_tooSmall);
+    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
+    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
+    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
+
+    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+        (void)algoNb;
+        assert(algoNb == 0);
+        return HUF_decompress4X1(dst, dstSize, cSrc, cSrcSize);
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+        (void)algoNb;
+        assert(algoNb == 1);
+        return HUF_decompress4X2(dst, dstSize, cSrc, cSrcSize);
+#else
+        return decompress[algoNb](dst, dstSize, cSrc, cSrcSize);
+#endif
+    }
+}
+
+size_t HUF_decompress4X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    /* validation checks */
+    if (dstSize == 0) return ERROR(dstSize_tooSmall);
+    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
+    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
+    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
+
+    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+        (void)algoNb;
+        assert(algoNb == 0);
+        return HUF_decompress4X1_DCtx(dctx, dst, dstSize, cSrc, cSrcSize);
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+        (void)algoNb;
+        assert(algoNb == 1);
+        return HUF_decompress4X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize);
+#else
+        return algoNb ? HUF_decompress4X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
+                        HUF_decompress4X1_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
+#endif
+    }
+}
+
+size_t HUF_decompress4X_hufOnly(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
+{
+    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
+    return HUF_decompress4X_hufOnly_wksp(dctx, dst, dstSize, cSrc, cSrcSize,
+                                         workSpace, sizeof(workSpace));
+}
+
+
+size_t HUF_decompress4X_hufOnly_wksp(HUF_DTable* dctx, void* dst,
+                                     size_t dstSize, const void* cSrc,
+                                     size_t cSrcSize, void* workSpace,
+                                     size_t wkspSize)
+{
+    /* validation checks */
+    if (dstSize == 0) return ERROR(dstSize_tooSmall);
+    if (cSrcSize == 0) return ERROR(corruption_detected);
+
+    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+        (void)algoNb;
+        assert(algoNb == 0);
+        return HUF_decompress4X1_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize);
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+        (void)algoNb;
+        assert(algoNb == 1);
+        return HUF_decompress4X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize);
+#else
+        return algoNb ? HUF_decompress4X2_DCtx_wksp(dctx, dst, dstSize, cSrc,
+                            cSrcSize, workSpace, wkspSize):
+                        HUF_decompress4X1_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize);
+#endif
+    }
+}
+
+size_t HUF_decompress1X_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize,
+                                  const void* cSrc, size_t cSrcSize,
+                                  void* workSpace, size_t wkspSize)
+{
+    /* validation checks */
+    if (dstSize == 0) return ERROR(dstSize_tooSmall);
+    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
+    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
+    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
+
+    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+        (void)algoNb;
+        assert(algoNb == 0);
+        return HUF_decompress1X1_DCtx_wksp(dctx, dst, dstSize, cSrc,
+                                cSrcSize, workSpace, wkspSize);
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+        (void)algoNb;
+        assert(algoNb == 1);
+        return HUF_decompress1X2_DCtx_wksp(dctx, dst, dstSize, cSrc,
+                                cSrcSize, workSpace, wkspSize);
+#else
+        return algoNb ? HUF_decompress1X2_DCtx_wksp(dctx, dst, dstSize, cSrc,
+                                cSrcSize, workSpace, wkspSize):
+                        HUF_decompress1X1_DCtx_wksp(dctx, dst, dstSize, cSrc,
+                                cSrcSize, workSpace, wkspSize);
+#endif
+    }
+}
+
+size_t HUF_decompress1X_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize,
+                             const void* cSrc, size_t cSrcSize)
+{
+    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
+    return HUF_decompress1X_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize,
+                                      workSpace, sizeof(workSpace));
+}
+
+
+size_t HUF_decompress1X_usingDTable_bmi2(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable, int bmi2)
+{
+    DTableDesc const dtd = HUF_getDTableDesc(DTable);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+    (void)dtd;
+    assert(dtd.tableType == 0);
+    return HUF_decompress1X1_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, bmi2);
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+    (void)dtd;
+    assert(dtd.tableType == 1);
+    return HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, bmi2);
+#else
+    return dtd.tableType ? HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, bmi2) :
+                           HUF_decompress1X1_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, bmi2);
+#endif
+}
+
+#ifndef HUF_FORCE_DECOMPRESS_X2
+size_t HUF_decompress1X1_DCtx_wksp_bmi2(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize, int bmi2)
+{
+    const BYTE* ip = (const BYTE*) cSrc;
+
+    size_t const hSize = HUF_readDTableX1_wksp(dctx, cSrc, cSrcSize, workSpace, wkspSize);
+    if (HUF_isError(hSize)) return hSize;
+    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
+    ip += hSize; cSrcSize -= hSize;
+
+    return HUF_decompress1X1_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx, bmi2);
+}
+#endif
+
+size_t HUF_decompress4X_usingDTable_bmi2(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable, int bmi2)
+{
+    DTableDesc const dtd = HUF_getDTableDesc(DTable);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+    (void)dtd;
+    assert(dtd.tableType == 0);
+    return HUF_decompress4X1_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, bmi2);
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+    (void)dtd;
+    assert(dtd.tableType == 1);
+    return HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, bmi2);
+#else
+    return dtd.tableType ? HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, bmi2) :
+                           HUF_decompress4X1_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable, bmi2);
+#endif
+}
+
+size_t HUF_decompress4X_hufOnly_wksp_bmi2(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize, int bmi2)
+{
+    /* validation checks */
+    if (dstSize == 0) return ERROR(dstSize_tooSmall);
+    if (cSrcSize == 0) return ERROR(corruption_detected);
+
+    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
+#if defined(HUF_FORCE_DECOMPRESS_X1)
+        (void)algoNb;
+        assert(algoNb == 0);
+        return HUF_decompress4X1_DCtx_wksp_bmi2(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize, bmi2);
+#elif defined(HUF_FORCE_DECOMPRESS_X2)
+        (void)algoNb;
+        assert(algoNb == 1);
+        return HUF_decompress4X2_DCtx_wksp_bmi2(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize, bmi2);
+#else
+        return algoNb ? HUF_decompress4X2_DCtx_wksp_bmi2(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize, bmi2) :
+                        HUF_decompress4X1_DCtx_wksp_bmi2(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize, bmi2);
+#endif
+    }
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/zstd_ddict.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/zstd_ddict.cpp
new file mode 100644
index 0000000000..e1c4576b67
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/zstd_ddict.cpp
@@ -0,0 +1,245 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+/* zstd_ddict.c :
+ * concentrates all logic that needs to know the internals of ZSTD_DDict object */
+
+/*-*******************************************************
+*  Dependencies
+*********************************************************/
+#include <string.h>      /* memcpy, memmove, memset */
+#include "zstd/common/mem.h"         /* low level memory routines */
+#include "zstd/common/fse.h"
+#include "zstd/common/fse_static.h"
+#include "zstd/common/huf.h"
+#include "zstd/common/huf_static.h"
+#include "zstd/decompress/zstd_decompress_internal.h"
+#include "zstd/decompress/zstd_ddict.h"
+
+// #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
+// #  include "../legacy/zstd_legacy.h"
+// #endif
+
+namespace lbug_zstd {
+
+/*-*******************************************************
+*  Types
+*********************************************************/
+struct ZSTD_DDict_s {
+    void* dictBuffer;
+    const void* dictContent;
+    size_t dictSize;
+    ZSTD_entropyDTables_t entropy;
+    U32 dictID;
+    U32 entropyPresent;
+    ZSTD_customMem cMem;
+};  /* typedef'd to ZSTD_DDict within "zstd.h" */
+
+const void* ZSTD_DDict_dictContent(const ZSTD_DDict* ddict)
+{
+    assert(ddict != NULL);
+    return ddict->dictContent;
+}
+
+size_t ZSTD_DDict_dictSize(const ZSTD_DDict* ddict)
+{
+    assert(ddict != NULL);
+    return ddict->dictSize;
+}
+
+void ZSTD_copyDDictParameters(ZSTD_DCtx* dctx, const ZSTD_DDict* ddict)
+{
+    DEBUGLOG(4, "ZSTD_copyDDictParameters");
+    assert(dctx != NULL);
+    assert(ddict != NULL);
+    dctx->dictID = ddict->dictID;
+    dctx->prefixStart = ddict->dictContent;
+    dctx->virtualStart = ddict->dictContent;
+    dctx->dictEnd = (const BYTE*)ddict->dictContent + ddict->dictSize;
+    dctx->previousDstEnd = dctx->dictEnd;
+#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+    dctx->dictContentBeginForFuzzing = dctx->prefixStart;
+    dctx->dictContentEndForFuzzing = dctx->previousDstEnd;
+#endif
+    if (ddict->entropyPresent) {
+        dctx->litEntropy = 1;
+        dctx->fseEntropy = 1;
+        dctx->LLTptr = ddict->entropy.LLTable;
+        dctx->MLTptr = ddict->entropy.MLTable;
+        dctx->OFTptr = ddict->entropy.OFTable;
+        dctx->HUFptr = ddict->entropy.hufTable;
+        dctx->entropy.rep[0] = ddict->entropy.rep[0];
+        dctx->entropy.rep[1] = ddict->entropy.rep[1];
+        dctx->entropy.rep[2] = ddict->entropy.rep[2];
+    } else {
+        dctx->litEntropy = 0;
+        dctx->fseEntropy = 0;
+    }
+}
+
+
+static size_t
+ZSTD_loadEntropy_intoDDict(ZSTD_DDict* ddict,
+                           ZSTD_dictContentType_e dictContentType)
+{
+    ddict->dictID = 0;
+    ddict->entropyPresent = 0;
+    if (dictContentType == ZSTD_dct_rawContent) return 0;
+
+    if (ddict->dictSize < 8) {
+        if (dictContentType == ZSTD_dct_fullDict)
+            return ERROR(dictionary_corrupted);   /* only accept specified dictionaries */
+        return 0;   /* pure content mode */
+    }
+    {   U32 const magic = MEM_readLE32(ddict->dictContent);
+        if (magic != ZSTD_MAGIC_DICTIONARY) {
+            if (dictContentType == ZSTD_dct_fullDict)
+                return ERROR(dictionary_corrupted);   /* only accept specified dictionaries */
+            return 0;   /* pure content mode */
+        }
+    }
+    ddict->dictID = MEM_readLE32((const char*)ddict->dictContent + ZSTD_FRAMEIDSIZE);
+
+    /* load entropy tables */
+    RETURN_ERROR_IF(ZSTD_isError(ZSTD_loadDEntropy(
+            &ddict->entropy, ddict->dictContent, ddict->dictSize)),
+        dictionary_corrupted, "");
+    ddict->entropyPresent = 1;
+    return 0;
+}
+
+
+static size_t ZSTD_initDDict_internal(ZSTD_DDict* ddict,
+                                      const void* dict, size_t dictSize,
+                                      ZSTD_dictLoadMethod_e dictLoadMethod,
+                                      ZSTD_dictContentType_e dictContentType)
+{
+    if ((dictLoadMethod == ZSTD_dlm_byRef) || (!dict) || (!dictSize)) {
+        ddict->dictBuffer = NULL;
+        ddict->dictContent = dict;
+        if (!dict) dictSize = 0;
+    } else {
+        void* const internalBuffer = ZSTD_malloc(dictSize, ddict->cMem);
+        ddict->dictBuffer = internalBuffer;
+        ddict->dictContent = internalBuffer;
+        if (!internalBuffer) return ERROR(memory_allocation);
+        memcpy(internalBuffer, dict, dictSize);
+    }
+    ddict->dictSize = dictSize;
+    ddict->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
+
+    /* parse dictionary content */
+    FORWARD_IF_ERROR( ZSTD_loadEntropy_intoDDict(ddict, dictContentType) , "");
+
+    return 0;
+}
+
+ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize,
+                                      ZSTD_dictLoadMethod_e dictLoadMethod,
+                                      ZSTD_dictContentType_e dictContentType,
+                                      ZSTD_customMem customMem)
+{
+    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
+
+    {   ZSTD_DDict* const ddict = (ZSTD_DDict*) ZSTD_malloc(sizeof(ZSTD_DDict), customMem);
+        if (ddict == NULL) return NULL;
+        ddict->cMem = customMem;
+        {   size_t const initResult = ZSTD_initDDict_internal(ddict,
+                                            dict, dictSize,
+                                            dictLoadMethod, dictContentType);
+            if (ZSTD_isError(initResult)) {
+                ZSTD_freeDDict(ddict);
+                return NULL;
+        }   }
+        return ddict;
+    }
+}
+
+/*! ZSTD_createDDict() :
+*   Create a digested dictionary, to start decompression without startup delay.
+*   `dict` content is copied inside DDict.
+*   Consequently, `dict` can be released after `ZSTD_DDict` creation */
+ZSTD_DDict* ZSTD_createDDict(const void* dict, size_t dictSize)
+{
+    ZSTD_customMem const allocator = { NULL, NULL, NULL };
+    return ZSTD_createDDict_advanced(dict, dictSize, ZSTD_dlm_byCopy, ZSTD_dct_auto, allocator);
+}
+
+/*! ZSTD_createDDict_byReference() :
+ *  Create a digested dictionary, to start decompression without startup delay.
+ *  Dictionary content is simply referenced, it will be accessed during decompression.
+ *  Warning : dictBuffer must outlive DDict (DDict must be freed before dictBuffer) */
+ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize)
+{
+    ZSTD_customMem const allocator = { NULL, NULL, NULL };
+    return ZSTD_createDDict_advanced(dictBuffer, dictSize, ZSTD_dlm_byRef, ZSTD_dct_auto, allocator);
+}
+
+
+const ZSTD_DDict* ZSTD_initStaticDDict(
+                                void* sBuffer, size_t sBufferSize,
+                                const void* dict, size_t dictSize,
+                                ZSTD_dictLoadMethod_e dictLoadMethod,
+                                ZSTD_dictContentType_e dictContentType)
+{
+    size_t const neededSpace = sizeof(ZSTD_DDict)
+                             + (dictLoadMethod == ZSTD_dlm_byRef ? 0 : dictSize);
+    ZSTD_DDict* const ddict = (ZSTD_DDict*)sBuffer;
+    assert(sBuffer != NULL);
+    assert(dict != NULL);
+    if ((size_t)sBuffer & 7) return NULL;   /* 8-aligned */
+    if (sBufferSize < neededSpace) return NULL;
+    if (dictLoadMethod == ZSTD_dlm_byCopy) {
+        memcpy(ddict+1, dict, dictSize);  /* local copy */
+        dict = ddict+1;
+    }
+    if (ZSTD_isError( ZSTD_initDDict_internal(ddict,
+                                              dict, dictSize,
+                                              ZSTD_dlm_byRef, dictContentType) ))
+        return NULL;
+    return ddict;
+}
+
+
+size_t ZSTD_freeDDict(ZSTD_DDict* ddict)
+{
+    if (ddict==NULL) return 0;   /* support free on NULL */
+    {   ZSTD_customMem const cMem = ddict->cMem;
+        ZSTD_free(ddict->dictBuffer, cMem);
+        ZSTD_free(ddict, cMem);
+        return 0;
+    }
+}
+
+/*! ZSTD_estimateDDictSize() :
+ *  Estimate amount of memory that will be needed to create a dictionary for decompression.
+ *  Note : dictionary created by reference using ZSTD_dlm_byRef are smaller */
+size_t ZSTD_estimateDDictSize(size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod)
+{
+    return sizeof(ZSTD_DDict) + (dictLoadMethod == ZSTD_dlm_byRef ? 0 : dictSize);
+}
+
+size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict)
+{
+    if (ddict==NULL) return 0;   /* support sizeof on NULL */
+    return sizeof(*ddict) + (ddict->dictBuffer ? ddict->dictSize : 0) ;
+}
+
+/*! ZSTD_getDictID_fromDDict() :
+ *  Provides the dictID of the dictionary loaded into `ddict`.
+ *  If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.
+ *  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */
+unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict)
+{
+    if (ddict==NULL) return 0;
+    return ZSTD_getDictID_fromDict(ddict->dictContent, ddict->dictSize);
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/zstd_decompress.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/zstd_decompress.cpp
new file mode 100644
index 0000000000..214798502e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/zstd_decompress.cpp
@@ -0,0 +1,1957 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+
+/* ***************************************************************
+*  Tuning parameters
+*****************************************************************/
+/*!
+ * HEAPMODE :
+ * Select how default decompression function ZSTD_decompress() allocates its context,
+ * on stack (0), or into heap (1, default; requires malloc()).
+ * Note that functions with explicit context such as ZSTD_decompressDCtx() are unaffected.
+ */
+#ifndef ZSTD_HEAPMODE
+#  define ZSTD_HEAPMODE 1
+#endif
+
+/*!
+*  LEGACY_SUPPORT :
+*  if set to 1+, ZSTD_decompress() can decode older formats (v0.1+)
+*/
+#ifndef ZSTD_LEGACY_SUPPORT
+#  define ZSTD_LEGACY_SUPPORT 0
+#endif
+
+/*!
+ *  MAXWINDOWSIZE_DEFAULT :
+ *  maximum window size accepted by DStream __by default__.
+ *  Frames requiring more memory will be rejected.
+ *  It's possible to set a different limit using ZSTD_DCtx_setMaxWindowSize().
+ */
+#ifndef ZSTD_MAXWINDOWSIZE_DEFAULT
+#  define ZSTD_MAXWINDOWSIZE_DEFAULT (((U32)1 << ZSTD_WINDOWLOG_LIMIT_DEFAULT) + 1)
+#endif
+
+/*!
+ *  NO_FORWARD_PROGRESS_MAX :
+ *  maximum allowed nb of calls to ZSTD_decompressStream()
+ *  without any forward progress
+ *  (defined as: no byte read from input, and no byte flushed to output)
+ *  before triggering an error.
+ */
+#ifndef ZSTD_NO_FORWARD_PROGRESS_MAX
+#  define ZSTD_NO_FORWARD_PROGRESS_MAX 16
+#endif
+
+
+/*-*******************************************************
+*  Dependencies
+*********************************************************/
+#include <string.h>      /* memcpy, memmove, memset */
+#include "zstd/common/mem.h"         /* low level memory routines */
+#include "zstd/common/fse.h"
+#include "zstd/common/fse_static.h"
+#include "zstd/common/huf.h"
+#include "zstd/common/huf_static.h"
+#include "zstd/common/zstd_internal.h"  /* blockProperties_t */
+#include "zstd/decompress/zstd_decompress_internal.h"   /* ZSTD_DCtx */
+#include "zstd/decompress/zstd_ddict.h"  /* ZSTD_DDictDictContent */
+#include "zstd/decompress/zstd_decompress_block.h"   /* ZSTD_decompressBlock_internal */
+
+// #if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
+// #  include "../legacy/zstd_legacy.h"
+// #endif
+namespace lbug_zstd {
+const U32 ZSTDConstants::LL_base[MaxLL+1] = {
+                0,    1,    2,     3,     4,     5,     6,      7,
+                8,    9,   10,    11,    12,    13,    14,     15,
+                16,   18,   20,    22,    24,    28,    32,     40,
+                48,   64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
+                0x2000, 0x4000, 0x8000, 0x10000 };
+
+const U32 ZSTDConstants::OF_base[MaxOff+1] = {
+                0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
+                0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
+                0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
+                0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD, 0x1FFFFFFD, 0x3FFFFFFD, 0x7FFFFFFD };
+
+const U32 ZSTDConstants::OF_bits[MaxOff+1] = {
+                    0,  1,  2,  3,  4,  5,  6,  7,
+                    8,  9, 10, 11, 12, 13, 14, 15,
+                    16, 17, 18, 19, 20, 21, 22, 23,
+                    24, 25, 26, 27, 28, 29, 30, 31 };
+
+const U32 ZSTDConstants::ML_base[MaxML+1] = {
+                    3,  4,  5,    6,     7,     8,     9,    10,
+                    11, 12, 13,   14,    15,    16,    17,    18,
+                    19, 20, 21,   22,    23,    24,    25,    26,
+                    27, 28, 29,   30,    31,    32,    33,    34,
+                    35, 37, 39,   41,    43,    47,    51,    59,
+                    67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
+                    0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
+
+const size_t ZSTDInternalConstants::ZSTD_blockHeaderSize = ZSTD_BLOCKHEADERSIZE;
+const U32 ZSTDInternalConstants::LL_bits[MaxLL+1] = { 0, 0, 0, 0, 0, 0, 0, 0,
+                                    0, 0, 0, 0, 0, 0, 0, 0,
+                                    1, 1, 1, 1, 2, 2, 3, 3,
+                                    4, 6, 7, 8, 9,10,11,12,
+                                    13,14,15,16 };
+const S16 ZSTDInternalConstants::LL_defaultNorm[MaxLL+1] = { 4, 3, 2, 2, 2, 2, 2, 2,
+                                            2, 2, 2, 2, 2, 1, 1, 1,
+                                            2, 2, 2, 2, 2, 2, 2, 2,
+                                            2, 3, 2, 1, 1, 1, 1, 1,
+                                            -1,-1,-1,-1 };
+#define LL_DEFAULTNORMLOG 6  /* for static allocation */
+const U32 ZSTDInternalConstants::LL_defaultNormLog = LL_DEFAULTNORMLOG;
+const U32 ZSTDInternalConstants::ML_bits[MaxML+1] = { 0, 0, 0, 0, 0, 0, 0, 0,
+                                    0, 0, 0, 0, 0, 0, 0, 0,
+                                    0, 0, 0, 0, 0, 0, 0, 0,
+                                    0, 0, 0, 0, 0, 0, 0, 0,
+                                    1, 1, 1, 1, 2, 2, 3, 3,
+                                    4, 4, 5, 7, 8, 9,10,11,
+                                    12,13,14,15,16 };
+const S16 ZSTDInternalConstants::ML_defaultNorm[MaxML+1] = { 1, 4, 3, 2, 2, 2, 2, 2,
+                                             2, 1, 1, 1, 1, 1, 1, 1,
+                                             1, 1, 1, 1, 1, 1, 1, 1,
+                                             1, 1, 1, 1, 1, 1, 1, 1,
+                                             1, 1, 1, 1, 1, 1, 1, 1,
+                                             1, 1, 1, 1, 1, 1,-1,-1,
+                                            -1,-1,-1,-1,-1 };
+#define ML_DEFAULTNORMLOG 6  /* for static allocation */
+const U32 ZSTDInternalConstants::ML_defaultNormLog = ML_DEFAULTNORMLOG;
+
+const S16 ZSTDInternalConstants::OF_defaultNorm[DefaultMaxOff+1] = { 1, 1, 1, 1, 1, 1, 2, 2,
+                                                     2, 1, 1, 1, 1, 1, 1, 1,
+                                                     1, 1, 1, 1, 1, 1, 1, 1,
+                                                    -1,-1,-1,-1,-1 };
+#define OF_DEFAULTNORMLOG 5  /* for static allocation */
+const U32 ZSTDInternalConstants::OF_defaultNormLog = OF_DEFAULTNORMLOG;
+const U32 ZSTDInternalConstants::repStartValue[ZSTD_REP_NUM] = { 1, 4, 8 };
+
+const ZSTD_customMem ZSTDInternalConstants::ZSTD_defaultCMem = { NULL, NULL, NULL };  /**< this constant defers to stdlib's functions */
+
+/*-*************************************************************
+*   Context management
+***************************************************************/
+size_t ZSTD_sizeof_DCtx (const ZSTD_DCtx* dctx)
+{
+    if (dctx==NULL) return 0;   /* support sizeof NULL */
+    return sizeof(*dctx)
+           + ZSTD_sizeof_DDict(dctx->ddictLocal)
+           + dctx->inBuffSize + dctx->outBuffSize;
+}
+
+size_t ZSTD_estimateDCtxSize(void) { return sizeof(ZSTD_DCtx); }
+
+
+static size_t ZSTD_startingInputLength(ZSTD_format_e format)
+{
+    size_t const startingInputLength = ZSTD_FRAMEHEADERSIZE_PREFIX(format);
+    /* only supports formats ZSTD_f_zstd1 and ZSTD_f_zstd1_magicless */
+    assert( (format == ZSTD_f_zstd1) || (format == ZSTD_f_zstd1_magicless) );
+    return startingInputLength;
+}
+
+static void ZSTD_initDCtx_internal(ZSTD_DCtx* dctx)
+{
+    dctx->format = ZSTD_f_zstd1;  /* ZSTD_decompressBegin() invokes ZSTD_startingInputLength() with argument dctx->format */
+    dctx->staticSize  = 0;
+    dctx->maxWindowSize = ZSTD_MAXWINDOWSIZE_DEFAULT;
+    dctx->ddict       = NULL;
+    dctx->ddictLocal  = NULL;
+    dctx->dictEnd     = NULL;
+    dctx->ddictIsCold = 0;
+    dctx->dictUses = ZSTD_dont_use;
+    dctx->inBuff      = NULL;
+    dctx->inBuffSize  = 0;
+    dctx->outBuffSize = 0;
+    dctx->streamStage = zdss_init;
+    dctx->legacyContext = NULL;
+    dctx->previousLegacyVersion = 0;
+    dctx->noForwardProgress = 0;
+    dctx->oversizedDuration = 0;
+    dctx->bmi2 = 0;
+    dctx->outBufferMode = ZSTD_obm_buffered;
+#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+    dctx->dictContentEndForFuzzing = NULL;
+#endif
+}
+
+ZSTD_DCtx* ZSTD_initStaticDCtx(void *workspace, size_t workspaceSize)
+{
+    ZSTD_DCtx* const dctx = (ZSTD_DCtx*) workspace;
+
+    if ((size_t)workspace & 7) return NULL;  /* 8-aligned */
+    if (workspaceSize < sizeof(ZSTD_DCtx)) return NULL;  /* minimum size */
+
+    ZSTD_initDCtx_internal(dctx);
+    dctx->staticSize = workspaceSize;
+    dctx->inBuff = (char*)(dctx+1);
+    return dctx;
+}
+
+ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem)
+{
+    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
+
+    {   ZSTD_DCtx* const dctx = (ZSTD_DCtx*)ZSTD_malloc(sizeof(*dctx), customMem);
+        if (!dctx) return NULL;
+        dctx->customMem = customMem;
+        ZSTD_initDCtx_internal(dctx);
+        return dctx;
+    }
+}
+
+ZSTD_DCtx* ZSTD_createDCtx(void)
+{
+    DEBUGLOG(3, "ZSTD_createDCtx");
+    return ZSTD_createDCtx_advanced(ZSTDInternalConstants::ZSTD_defaultCMem);
+}
+
+static void ZSTD_clearDict(ZSTD_DCtx* dctx)
+{
+    ZSTD_freeDDict(dctx->ddictLocal);
+    dctx->ddictLocal = NULL;
+    dctx->ddict = NULL;
+    dctx->dictUses = ZSTD_dont_use;
+}
+
+size_t ZSTD_freeDCtx(ZSTD_DCtx* dctx)
+{
+    if (dctx==NULL) return 0;   /* support free on NULL */
+    RETURN_ERROR_IF(dctx->staticSize, memory_allocation, "not compatible with static DCtx");
+    {   ZSTD_customMem const cMem = dctx->customMem;
+        ZSTD_clearDict(dctx);
+        ZSTD_free(dctx->inBuff, cMem);
+        dctx->inBuff = NULL;
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+        if (dctx->legacyContext)
+            ZSTD_freeLegacyStreamContext(dctx->legacyContext, dctx->previousLegacyVersion);
+#endif
+        ZSTD_free(dctx, cMem);
+        return 0;
+    }
+}
+
+/* no longer useful */
+void ZSTD_copyDCtx(ZSTD_DCtx* dstDCtx, const ZSTD_DCtx* srcDCtx)
+{
+    size_t const toCopy = (size_t)((char*)(&dstDCtx->inBuff) - (char*)dstDCtx);
+    memcpy(dstDCtx, srcDCtx, toCopy);  /* no need to copy workspace */
+}
+
+
+/*-*************************************************************
+ *   Frame header decoding
+ ***************************************************************/
+
+/*! ZSTD_isFrame() :
+ *  Tells if the content of `buffer` starts with a valid Frame Identifier.
+ *  Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.
+ *  Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.
+ *  Note 3 : Skippable Frame Identifiers are considered valid. */
+unsigned ZSTD_isFrame(const void* buffer, size_t size)
+{
+    if (size < ZSTD_FRAMEIDSIZE) return 0;
+    {   U32 const magic = MEM_readLE32(buffer);
+        if (magic == ZSTD_MAGICNUMBER) return 1;
+        if ((magic & ZSTD_MAGIC_SKIPPABLE_MASK) == ZSTD_MAGIC_SKIPPABLE_START) return 1;
+    }
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+    if (ZSTD_isLegacy(buffer, size)) return 1;
+#endif
+    return 0;
+}
+
+static const size_t ZSTD_fcs_fieldSize[4] = { 0, 2, 4, 8 };
+static const size_t ZSTD_did_fieldSize[4] = { 0, 1, 2, 4 };
+/** ZSTD_frameHeaderSize_internal() :
+ *  srcSize must be large enough to reach header size fields.
+ *  note : only works for formats ZSTD_f_zstd1 and ZSTD_f_zstd1_magicless.
+ * @return : size of the Frame Header
+ *           or an error code, which can be tested with ZSTD_isError() */
+static size_t ZSTD_frameHeaderSize_internal(const void* src, size_t srcSize, ZSTD_format_e format)
+{
+    size_t const minInputSize = ZSTD_startingInputLength(format);
+    RETURN_ERROR_IF(srcSize < minInputSize, srcSize_wrong, "");
+
+    {   BYTE const fhd = ((const BYTE*)src)[minInputSize-1];
+        U32 const dictID= fhd & 3;
+        U32 const singleSegment = (fhd >> 5) & 1;
+        U32 const fcsId = fhd >> 6;
+        return minInputSize + !singleSegment
+             + ZSTD_did_fieldSize[dictID] + ZSTD_fcs_fieldSize[fcsId]
+             + (singleSegment && !fcsId);
+    }
+}
+
+/** ZSTD_frameHeaderSize() :
+ *  srcSize must be >= ZSTD_frameHeaderSize_prefix.
+ * @return : size of the Frame Header,
+ *           or an error code (if srcSize is too small) */
+size_t ZSTD_frameHeaderSize(const void* src, size_t srcSize)
+{
+    return ZSTD_frameHeaderSize_internal(src, srcSize, ZSTD_f_zstd1);
+}
+
+
+/** ZSTD_getFrameHeader_advanced() :
+ *  decode Frame Header, or require larger `srcSize`.
+ *  note : only works for formats ZSTD_f_zstd1 and ZSTD_f_zstd1_magicless
+ * @return : 0, `zfhPtr` is correctly filled,
+ *          >0, `srcSize` is too small, value is wanted `srcSize` amount,
+ *           or an error code, which can be tested using ZSTD_isError() */
+size_t ZSTD_getFrameHeader_advanced(ZSTD_frameHeader* zfhPtr, const void* src, size_t srcSize, ZSTD_format_e format)
+{
+    const BYTE* ip = (const BYTE*)src;
+    size_t const minInputSize = ZSTD_startingInputLength(format);
+
+    memset(zfhPtr, 0, sizeof(*zfhPtr));   /* not strictly necessary, but static analyzer do not understand that zfhPtr is only going to be read only if return value is zero, since they are 2 different signals */
+    if (srcSize < minInputSize) return minInputSize;
+    RETURN_ERROR_IF(src==NULL, GENERIC, "invalid parameter");
+
+    if ( (format != ZSTD_f_zstd1_magicless)
+      && (MEM_readLE32(src) != ZSTD_MAGICNUMBER) ) {
+        if ((MEM_readLE32(src) & ZSTD_MAGIC_SKIPPABLE_MASK) == ZSTD_MAGIC_SKIPPABLE_START) {
+            /* skippable frame */
+            if (srcSize < ZSTD_SKIPPABLEHEADERSIZE)
+                return ZSTD_SKIPPABLEHEADERSIZE; /* magic number + frame length */
+            memset(zfhPtr, 0, sizeof(*zfhPtr));
+            zfhPtr->frameContentSize = MEM_readLE32((const char *)src + ZSTD_FRAMEIDSIZE);
+            zfhPtr->frameType = ZSTD_skippableFrame;
+            return 0;
+        }
+        RETURN_ERROR(prefix_unknown, "");
+    }
+
+    /* ensure there is enough `srcSize` to fully read/decode frame header */
+    {   size_t const fhsize = ZSTD_frameHeaderSize_internal(src, srcSize, format);
+        if (srcSize < fhsize) return fhsize;
+        zfhPtr->headerSize = (U32)fhsize;
+    }
+
+    {   BYTE const fhdByte = ip[minInputSize-1];
+        size_t pos = minInputSize;
+        U32 const dictIDSizeCode = fhdByte&3;
+        U32 const checksumFlag = (fhdByte>>2)&1;
+        U32 const singleSegment = (fhdByte>>5)&1;
+        U32 const fcsID = fhdByte>>6;
+        U64 windowSize = 0;
+        U32 dictID = 0;
+        U64 frameContentSize = ZSTD_CONTENTSIZE_UNKNOWN;
+        RETURN_ERROR_IF((fhdByte & 0x08) != 0, frameParameter_unsupported,
+                        "reserved bits, must be zero");
+
+        if (!singleSegment) {
+            BYTE const wlByte = ip[pos++];
+            U32 const windowLog = (wlByte >> 3) + ZSTD_WINDOWLOG_ABSOLUTEMIN;
+            RETURN_ERROR_IF(windowLog > ZSTD_WINDOWLOG_MAX, frameParameter_windowTooLarge, "");
+            windowSize = (1ULL << windowLog);
+            windowSize += (windowSize >> 3) * (wlByte&7);
+        }
+        switch(dictIDSizeCode)
+        {
+            default: assert(0);  /* impossible */
+            case 0 : break;
+            case 1 : dictID = ip[pos]; pos++; break;
+            case 2 : dictID = MEM_readLE16(ip+pos); pos+=2; break;
+            case 3 : dictID = MEM_readLE32(ip+pos); pos+=4; break;
+        }
+        switch(fcsID)
+        {
+            default: assert(0);  /* impossible */
+            case 0 : if (singleSegment) frameContentSize = ip[pos]; break;
+            case 1 : frameContentSize = MEM_readLE16(ip+pos)+256; break;
+            case 2 : frameContentSize = MEM_readLE32(ip+pos); break;
+            case 3 : frameContentSize = MEM_readLE64(ip+pos); break;
+        }
+        if (singleSegment) windowSize = frameContentSize;
+
+        zfhPtr->frameType = ZSTD_frame;
+        zfhPtr->frameContentSize = frameContentSize;
+        zfhPtr->windowSize = windowSize;
+        zfhPtr->blockSizeMax = (unsigned) MIN(windowSize, ZSTD_BLOCKSIZE_MAX);
+        zfhPtr->dictID = dictID;
+        zfhPtr->checksumFlag = checksumFlag;
+    }
+    return 0;
+}
+
+/** ZSTD_getFrameHeader() :
+ *  decode Frame Header, or require larger `srcSize`.
+ *  note : this function does not consume input, it only reads it.
+ * @return : 0, `zfhPtr` is correctly filled,
+ *          >0, `srcSize` is too small, value is wanted `srcSize` amount,
+ *           or an error code, which can be tested using ZSTD_isError() */
+size_t ZSTD_getFrameHeader(ZSTD_frameHeader* zfhPtr, const void* src, size_t srcSize)
+{
+    return ZSTD_getFrameHeader_advanced(zfhPtr, src, srcSize, ZSTD_f_zstd1);
+}
+
+
+/** ZSTD_getFrameContentSize() :
+ *  compatible with legacy mode
+ * @return : decompressed size of the single frame pointed to be `src` if known, otherwise
+ *         - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined
+ *         - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small) */
+unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize)
+{
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+    if (ZSTD_isLegacy(src, srcSize)) {
+        unsigned long long const ret = ZSTD_getDecompressedSize_legacy(src, srcSize);
+        return ret == 0 ? ZSTD_CONTENTSIZE_UNKNOWN : ret;
+    }
+#endif
+    {   ZSTD_frameHeader zfh;
+        if (ZSTD_getFrameHeader(&zfh, src, srcSize) != 0)
+            return ZSTD_CONTENTSIZE_ERROR;
+        if (zfh.frameType == ZSTD_skippableFrame) {
+            return 0;
+        } else {
+            return zfh.frameContentSize;
+    }   }
+}
+
+static size_t readSkippableFrameSize(void const* src, size_t srcSize)
+{
+    size_t const skippableHeaderSize = ZSTD_SKIPPABLEHEADERSIZE;
+    U32 sizeU32;
+
+    RETURN_ERROR_IF(srcSize < ZSTD_SKIPPABLEHEADERSIZE, srcSize_wrong, "");
+
+    sizeU32 = MEM_readLE32((BYTE const*)src + ZSTD_FRAMEIDSIZE);
+    RETURN_ERROR_IF((U32)(sizeU32 + ZSTD_SKIPPABLEHEADERSIZE) < sizeU32,
+                    frameParameter_unsupported, "");
+    {
+        size_t const skippableSize = skippableHeaderSize + sizeU32;
+        RETURN_ERROR_IF(skippableSize > srcSize, srcSize_wrong, "");
+        return skippableSize;
+    }
+}
+
+/** ZSTD_findDecompressedSize() :
+ *  compatible with legacy mode
+ *  `srcSize` must be the exact length of some number of ZSTD compressed and/or
+ *      skippable frames
+ *  @return : decompressed size of the frames contained */
+unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize)
+{
+    unsigned long long totalDstSize = 0;
+
+    while (srcSize >= ZSTD_startingInputLength(ZSTD_f_zstd1)) {
+        U32 const magicNumber = MEM_readLE32(src);
+
+        if ((magicNumber & ZSTD_MAGIC_SKIPPABLE_MASK) == ZSTD_MAGIC_SKIPPABLE_START) {
+            size_t const skippableSize = readSkippableFrameSize(src, srcSize);
+            if (ZSTD_isError(skippableSize)) {
+                return ZSTD_CONTENTSIZE_ERROR;
+            }
+            assert(skippableSize <= srcSize);
+
+            src = (const BYTE *)src + skippableSize;
+            srcSize -= skippableSize;
+            continue;
+        }
+
+        {   unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
+            if (ret >= ZSTD_CONTENTSIZE_ERROR) return ret;
+
+            /* check for overflow */
+            if (totalDstSize + ret < totalDstSize) return ZSTD_CONTENTSIZE_ERROR;
+            totalDstSize += ret;
+        }
+        {   size_t const frameSrcSize = ZSTD_findFrameCompressedSize(src, srcSize);
+            if (ZSTD_isError(frameSrcSize)) {
+                return ZSTD_CONTENTSIZE_ERROR;
+            }
+
+            src = (const BYTE *)src + frameSrcSize;
+            srcSize -= frameSrcSize;
+        }
+    }  /* while (srcSize >= ZSTD_frameHeaderSize_prefix) */
+
+    if (srcSize) return ZSTD_CONTENTSIZE_ERROR;
+
+    return totalDstSize;
+}
+
+/** ZSTD_getDecompressedSize() :
+ *  compatible with legacy mode
+ * @return : decompressed size if known, 0 otherwise
+             note : 0 can mean any of the following :
+                   - frame content is empty
+                   - decompressed size field is not present in frame header
+                   - frame header unknown / not supported
+                   - frame header not complete (`srcSize` too small) */
+unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize)
+{
+    unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
+    ZSTD_STATIC_ASSERT(ZSTD_CONTENTSIZE_ERROR < ZSTD_CONTENTSIZE_UNKNOWN);
+    return (ret >= ZSTD_CONTENTSIZE_ERROR) ? 0 : ret;
+}
+
+
+/** ZSTD_decodeFrameHeader() :
+ * `headerSize` must be the size provided by ZSTD_frameHeaderSize().
+ * @return : 0 if success, or an error code, which can be tested using ZSTD_isError() */
+static size_t ZSTD_decodeFrameHeader(ZSTD_DCtx* dctx, const void* src, size_t headerSize)
+{
+    size_t const result = ZSTD_getFrameHeader_advanced(&(dctx->fParams), src, headerSize, dctx->format);
+    if (ZSTD_isError(result)) return result;    /* invalid header */
+    RETURN_ERROR_IF(result>0, srcSize_wrong, "headerSize too small");
+#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+    /* Skip the dictID check in fuzzing mode, because it makes the search
+     * harder.
+     */
+    RETURN_ERROR_IF(dctx->fParams.dictID && (dctx->dictID != dctx->fParams.dictID),
+                    dictionary_wrong, "");
+#endif
+    if (dctx->fParams.checksumFlag) XXH64_reset(&dctx->xxhState, 0);
+    return 0;
+}
+
+static ZSTD_frameSizeInfo ZSTD_errorFrameSizeInfo(size_t ret)
+{
+    ZSTD_frameSizeInfo frameSizeInfo;
+    frameSizeInfo.compressedSize = ret;
+    frameSizeInfo.decompressedBound = ZSTD_CONTENTSIZE_ERROR;
+    return frameSizeInfo;
+}
+
+static ZSTD_frameSizeInfo ZSTD_findFrameSizeInfo(const void* src, size_t srcSize)
+{
+    ZSTD_frameSizeInfo frameSizeInfo;
+    memset(&frameSizeInfo, 0, sizeof(ZSTD_frameSizeInfo));
+
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+    if (ZSTD_isLegacy(src, srcSize))
+        return ZSTD_findFrameSizeInfoLegacy(src, srcSize);
+#endif
+
+    if ((srcSize >= ZSTD_SKIPPABLEHEADERSIZE)
+        && (MEM_readLE32(src) & ZSTD_MAGIC_SKIPPABLE_MASK) == ZSTD_MAGIC_SKIPPABLE_START) {
+        frameSizeInfo.compressedSize = readSkippableFrameSize(src, srcSize);
+        assert(ZSTD_isError(frameSizeInfo.compressedSize) ||
+               frameSizeInfo.compressedSize <= srcSize);
+        return frameSizeInfo;
+    } else {
+        const BYTE* ip = (const BYTE*)src;
+        const BYTE* const ipstart = ip;
+        size_t remainingSize = srcSize;
+        size_t nbBlocks = 0;
+        ZSTD_frameHeader zfh;
+
+        /* Extract Frame Header */
+        {   size_t const ret = ZSTD_getFrameHeader(&zfh, src, srcSize);
+            if (ZSTD_isError(ret))
+                return ZSTD_errorFrameSizeInfo(ret);
+            if (ret > 0)
+                return ZSTD_errorFrameSizeInfo(ERROR(srcSize_wrong));
+        }
+
+        ip += zfh.headerSize;
+        remainingSize -= zfh.headerSize;
+
+        /* Iterate over each block */
+        while (1) {
+            blockProperties_t blockProperties;
+            size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
+            if (ZSTD_isError(cBlockSize))
+                return ZSTD_errorFrameSizeInfo(cBlockSize);
+
+            if (ZSTDInternalConstants::ZSTD_blockHeaderSize + cBlockSize > remainingSize)
+                return ZSTD_errorFrameSizeInfo(ERROR(srcSize_wrong));
+
+            ip += ZSTDInternalConstants::ZSTD_blockHeaderSize + cBlockSize;
+            remainingSize -= ZSTDInternalConstants::ZSTD_blockHeaderSize + cBlockSize;
+            nbBlocks++;
+
+            if (blockProperties.lastBlock) break;
+        }
+
+        /* Final frame content checksum */
+        if (zfh.checksumFlag) {
+            if (remainingSize < 4)
+                return ZSTD_errorFrameSizeInfo(ERROR(srcSize_wrong));
+            ip += 4;
+        }
+
+        frameSizeInfo.compressedSize = ip - ipstart;
+        frameSizeInfo.decompressedBound = (zfh.frameContentSize != ZSTD_CONTENTSIZE_UNKNOWN)
+                                        ? zfh.frameContentSize
+                                        : nbBlocks * zfh.blockSizeMax;
+        return frameSizeInfo;
+    }
+}
+
+/** ZSTD_findFrameCompressedSize() :
+ *  compatible with legacy mode
+ *  `src` must point to the start of a ZSTD frame, ZSTD legacy frame, or skippable frame
+ *  `srcSize` must be at least as large as the frame contained
+ *  @return : the compressed size of the frame starting at `src` */
+size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize)
+{
+    ZSTD_frameSizeInfo const frameSizeInfo = ZSTD_findFrameSizeInfo(src, srcSize);
+    return frameSizeInfo.compressedSize;
+}
+
+/** ZSTD_decompressBound() :
+ *  compatible with legacy mode
+ *  `src` must point to the start of a ZSTD frame or a skippeable frame
+ *  `srcSize` must be at least as large as the frame contained
+ *  @return : the maximum decompressed size of the compressed source
+ */
+unsigned long long ZSTD_decompressBound(const void* src, size_t srcSize)
+{
+    unsigned long long bound = 0;
+    /* Iterate over each frame */
+    while (srcSize > 0) {
+        ZSTD_frameSizeInfo const frameSizeInfo = ZSTD_findFrameSizeInfo(src, srcSize);
+        size_t const compressedSize = frameSizeInfo.compressedSize;
+        unsigned long long const decompressedBound = frameSizeInfo.decompressedBound;
+        if (ZSTD_isError(compressedSize) || decompressedBound == ZSTD_CONTENTSIZE_ERROR)
+            return ZSTD_CONTENTSIZE_ERROR;
+        assert(srcSize >= compressedSize);
+        src = (const BYTE*)src + compressedSize;
+        srcSize -= compressedSize;
+        bound += decompressedBound;
+    }
+    return bound;
+}
+
+
+/*-*************************************************************
+ *   Frame decoding
+ ***************************************************************/
+
+/** ZSTD_insertBlock() :
+ *  insert `src` block into `dctx` history. Useful to track uncompressed blocks. */
+size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize)
+{
+    DEBUGLOG(5, "ZSTD_insertBlock: %u bytes", (unsigned)blockSize);
+    ZSTD_checkContinuity(dctx, blockStart);
+    dctx->previousDstEnd = (const char*)blockStart + blockSize;
+    return blockSize;
+}
+
+
+static size_t ZSTD_copyRawBlock(void* dst, size_t dstCapacity,
+                          const void* src, size_t srcSize)
+{
+    DEBUGLOG(5, "ZSTD_copyRawBlock");
+    if (dst == NULL) {
+        if (srcSize == 0) return 0;
+        RETURN_ERROR(dstBuffer_null, "");
+    }
+    RETURN_ERROR_IF(srcSize > dstCapacity, dstSize_tooSmall, "");
+    memcpy(dst, src, srcSize);
+    return srcSize;
+}
+
+static size_t ZSTD_setRleBlock(void* dst, size_t dstCapacity,
+                               BYTE b,
+                               size_t regenSize)
+{
+    if (dst == NULL) {
+        if (regenSize == 0) return 0;
+        RETURN_ERROR(dstBuffer_null, "");
+    }
+    RETURN_ERROR_IF(regenSize > dstCapacity, dstSize_tooSmall, "");
+    memset(dst, b, regenSize);
+    return regenSize;
+}
+
+
+/*! ZSTD_decompressFrame() :
+ * @dctx must be properly initialized
+ *  will update *srcPtr and *srcSizePtr,
+ *  to make *srcPtr progress by one frame. */
+static size_t ZSTD_decompressFrame(ZSTD_DCtx* dctx,
+                                   void* dst, size_t dstCapacity,
+                             const void** srcPtr, size_t *srcSizePtr)
+{
+    const BYTE* ip = (const BYTE*)(*srcPtr);
+    BYTE* const ostart = (BYTE* const)dst;
+    BYTE* const oend = dstCapacity != 0 ? ostart + dstCapacity : ostart;
+    BYTE* op = ostart;
+    size_t remainingSrcSize = *srcSizePtr;
+
+    DEBUGLOG(4, "ZSTD_decompressFrame (srcSize:%i)", (int)*srcSizePtr);
+
+    /* check */
+    RETURN_ERROR_IF(
+        remainingSrcSize < ZSTD_FRAMEHEADERSIZE_MIN(dctx->format)+ZSTDInternalConstants::ZSTD_blockHeaderSize,
+        srcSize_wrong, "");
+
+    /* Frame Header */
+    {   size_t const frameHeaderSize = ZSTD_frameHeaderSize_internal(
+                ip, ZSTD_FRAMEHEADERSIZE_PREFIX(dctx->format), dctx->format);
+        if (ZSTD_isError(frameHeaderSize)) return frameHeaderSize;
+        RETURN_ERROR_IF(remainingSrcSize < frameHeaderSize+ZSTDInternalConstants::ZSTD_blockHeaderSize,
+                        srcSize_wrong, "");
+        FORWARD_IF_ERROR( ZSTD_decodeFrameHeader(dctx, ip, frameHeaderSize) , "");
+        ip += frameHeaderSize; remainingSrcSize -= frameHeaderSize;
+    }
+
+    /* Loop on each block */
+    while (1) {
+        size_t decodedSize;
+        blockProperties_t blockProperties;
+        size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSrcSize, &blockProperties);
+        if (ZSTD_isError(cBlockSize)) return cBlockSize;
+
+        ip += ZSTDInternalConstants::ZSTD_blockHeaderSize;
+        remainingSrcSize -= ZSTDInternalConstants::ZSTD_blockHeaderSize;
+        RETURN_ERROR_IF(cBlockSize > remainingSrcSize, srcSize_wrong, "");
+
+        switch(blockProperties.blockType)
+        {
+        case bt_compressed:
+            decodedSize = ZSTD_decompressBlock_internal(dctx, op, oend-op, ip, cBlockSize, /* frame */ 1);
+            break;
+        case bt_raw :
+            decodedSize = ZSTD_copyRawBlock(op, oend-op, ip, cBlockSize);
+            break;
+        case bt_rle :
+            decodedSize = ZSTD_setRleBlock(op, oend-op, *ip, blockProperties.origSize);
+            break;
+        case bt_reserved :
+        default:
+            RETURN_ERROR(corruption_detected, "invalid block type");
+        }
+
+        if (ZSTD_isError(decodedSize)) return decodedSize;
+        if (dctx->fParams.checksumFlag)
+            XXH64_update(&dctx->xxhState, op, decodedSize);
+        if (decodedSize != 0)
+            op += decodedSize;
+        assert(ip != NULL);
+        ip += cBlockSize;
+        remainingSrcSize -= cBlockSize;
+        if (blockProperties.lastBlock) break;
+    }
+
+    if (dctx->fParams.frameContentSize != ZSTD_CONTENTSIZE_UNKNOWN) {
+        RETURN_ERROR_IF((U64)(op-ostart) != dctx->fParams.frameContentSize,
+                        corruption_detected, "");
+    }
+    if (dctx->fParams.checksumFlag) { /* Frame content checksum verification */
+        U32 const checkCalc = (U32)XXH64_digest(&dctx->xxhState);
+        U32 checkRead;
+        RETURN_ERROR_IF(remainingSrcSize<4, checksum_wrong, "");
+        checkRead = MEM_readLE32(ip);
+        RETURN_ERROR_IF(checkRead != checkCalc, checksum_wrong, "");
+        ip += 4;
+        remainingSrcSize -= 4;
+    }
+
+    /* Allow caller to get size read */
+    *srcPtr = ip;
+    *srcSizePtr = remainingSrcSize;
+    return op-ostart;
+}
+
+static size_t ZSTD_decompressMultiFrame(ZSTD_DCtx* dctx,
+                                        void* dst, size_t dstCapacity,
+                                  const void* src, size_t srcSize,
+                                  const void* dict, size_t dictSize,
+                                  const ZSTD_DDict* ddict)
+{
+    void* const dststart = dst;
+    int moreThan1Frame = 0;
+
+    DEBUGLOG(5, "ZSTD_decompressMultiFrame");
+    assert(dict==NULL || ddict==NULL);  /* either dict or ddict set, not both */
+
+    if (ddict) {
+        dict = ZSTD_DDict_dictContent(ddict);
+        dictSize = ZSTD_DDict_dictSize(ddict);
+    }
+
+    while (srcSize >= ZSTD_startingInputLength(dctx->format)) {
+
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
+        if (ZSTD_isLegacy(src, srcSize)) {
+            size_t decodedSize;
+            size_t const frameSize = ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
+            if (ZSTD_isError(frameSize)) return frameSize;
+            RETURN_ERROR_IF(dctx->staticSize, memory_allocation,
+                "legacy support is not compatible with static dctx");
+
+            decodedSize = ZSTD_decompressLegacy(dst, dstCapacity, src, frameSize, dict, dictSize);
+            if (ZSTD_isError(decodedSize)) return decodedSize;
+
+            assert(decodedSize <=- dstCapacity);
+            dst = (BYTE*)dst + decodedSize;
+            dstCapacity -= decodedSize;
+
+            src = (const BYTE*)src + frameSize;
+            srcSize -= frameSize;
+
+            continue;
+        }
+#endif
+
+        {   U32 const magicNumber = MEM_readLE32(src);
+            DEBUGLOG(4, "reading magic number %08X (expecting %08X)",
+                        (unsigned)magicNumber, ZSTD_MAGICNUMBER);
+            if ((magicNumber & ZSTD_MAGIC_SKIPPABLE_MASK) == ZSTD_MAGIC_SKIPPABLE_START) {
+                size_t const skippableSize = readSkippableFrameSize(src, srcSize);
+                FORWARD_IF_ERROR(skippableSize, "readSkippableFrameSize failed");
+                assert(skippableSize <= srcSize);
+
+                src = (const BYTE *)src + skippableSize;
+                srcSize -= skippableSize;
+                continue;
+        }   }
+
+        if (ddict) {
+            /* we were called from ZSTD_decompress_usingDDict */
+            FORWARD_IF_ERROR(ZSTD_decompressBegin_usingDDict(dctx, ddict), "");
+        } else {
+            /* this will initialize correctly with no dict if dict == NULL, so
+             * use this in all cases but ddict */
+            FORWARD_IF_ERROR(ZSTD_decompressBegin_usingDict(dctx, dict, dictSize), "");
+        }
+        ZSTD_checkContinuity(dctx, dst);
+
+        {   const size_t res = ZSTD_decompressFrame(dctx, dst, dstCapacity,
+                                                    &src, &srcSize);
+            RETURN_ERROR_IF(
+                (ZSTD_getErrorCode(res) == ZSTD_error_prefix_unknown)
+             && (moreThan1Frame==1),
+                srcSize_wrong,
+                "at least one frame successfully completed, but following "
+                "bytes are garbage: it's more likely to be a srcSize error, "
+                "specifying more bytes than compressed size of frame(s). This "
+                "error message replaces ERROR(prefix_unknown), which would be "
+                "confusing, as the first header is actually correct. Note that "
+                "one could be unlucky, it might be a corruption error instead, "
+                "happening right at the place where we expect zstd magic "
+                "bytes. But this is _much_ less likely than a srcSize field "
+                "error.");
+            if (ZSTD_isError(res)) return res;
+            assert(res <= dstCapacity);
+            if (res != 0)
+                dst = (BYTE*)dst + res;
+            dstCapacity -= res;
+        }
+        moreThan1Frame = 1;
+    }  /* while (srcSize >= ZSTD_frameHeaderSize_prefix) */
+
+    RETURN_ERROR_IF(srcSize, srcSize_wrong, "input not entirely consumed");
+
+    return (BYTE*)dst - (BYTE*)dststart;
+}
+
+size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
+                                 void* dst, size_t dstCapacity,
+                           const void* src, size_t srcSize,
+                           const void* dict, size_t dictSize)
+{
+    return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, dict, dictSize, NULL);
+}
+
+
+static ZSTD_DDict const* ZSTD_getDDict(ZSTD_DCtx* dctx)
+{
+    switch (dctx->dictUses) {
+    default:
+        assert(0 /* Impossible */);
+        /* fall-through */
+    case ZSTD_dont_use:
+        ZSTD_clearDict(dctx);
+        return NULL;
+    case ZSTD_use_indefinitely:
+        return dctx->ddict;
+    case ZSTD_use_once:
+        dctx->dictUses = ZSTD_dont_use;
+        return dctx->ddict;
+    }
+}
+
+size_t ZSTD_decompressDCtx(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    return ZSTD_decompress_usingDDict(dctx, dst, dstCapacity, src, srcSize, ZSTD_getDDict(dctx));
+}
+
+
+size_t ZSTD_decompress(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+#if defined(ZSTD_HEAPMODE) && (ZSTD_HEAPMODE>=1)
+    size_t regenSize;
+    ZSTD_DCtx* const dctx = ZSTD_createDCtx();
+    RETURN_ERROR_IF(dctx==NULL, memory_allocation, "NULL pointer!");
+    regenSize = ZSTD_decompressDCtx(dctx, dst, dstCapacity, src, srcSize);
+    ZSTD_freeDCtx(dctx);
+    return regenSize;
+#else   /* stack mode */
+    ZSTD_DCtx dctx;
+    ZSTD_initDCtx_internal(&dctx);
+    return ZSTD_decompressDCtx(&dctx, dst, dstCapacity, src, srcSize);
+#endif
+}
+
+
+/*-**************************************
+*   Advanced Streaming Decompression API
+*   Bufferless and synchronous
+****************************************/
+size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx* dctx) { return dctx->expected; }
+
+/**
+ * Similar to ZSTD_nextSrcSizeToDecompress(), but when when a block input can be streamed,
+ * we allow taking a partial block as the input. Currently only raw uncompressed blocks can
+ * be streamed.
+ *
+ * For blocks that can be streamed, this allows us to reduce the latency until we produce
+ * output, and avoid copying the input.
+ *
+ * @param inputSize - The total amount of input that the caller currently has.
+ */
+static size_t ZSTD_nextSrcSizeToDecompressWithInputSize(ZSTD_DCtx* dctx, size_t inputSize) {
+    if (!(dctx->stage == ZSTDds_decompressBlock || dctx->stage == ZSTDds_decompressLastBlock))
+        return dctx->expected;
+    if (dctx->bType != bt_raw)
+        return dctx->expected;
+    return MIN(MAX(inputSize, 1), dctx->expected);
+}
+
+ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx) {
+    switch(dctx->stage)
+    {
+    default:   /* should not happen */
+        assert(0);
+    case ZSTDds_getFrameHeaderSize:
+    case ZSTDds_decodeFrameHeader:
+        return ZSTDnit_frameHeader;
+    case ZSTDds_decodeBlockHeader:
+        return ZSTDnit_blockHeader;
+    case ZSTDds_decompressBlock:
+        return ZSTDnit_block;
+    case ZSTDds_decompressLastBlock:
+        return ZSTDnit_lastBlock;
+    case ZSTDds_checkChecksum:
+        return ZSTDnit_checksum;
+    case ZSTDds_decodeSkippableHeader:
+    case ZSTDds_skipFrame:
+        return ZSTDnit_skippableFrame;
+    }
+}
+
+static int ZSTD_isSkipFrame(ZSTD_DCtx* dctx) { return dctx->stage == ZSTDds_skipFrame; }
+
+/** ZSTD_decompressContinue() :
+ *  srcSize : must be the exact nb of bytes expected (see ZSTD_nextSrcSizeToDecompress())
+ *  @return : nb of bytes generated into `dst` (necessarily <= `dstCapacity)
+ *            or an error code, which can be tested using ZSTD_isError() */
+size_t ZSTD_decompressContinue(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    DEBUGLOG(5, "ZSTD_decompressContinue (srcSize:%u)", (unsigned)srcSize);
+    /* Sanity check */
+    RETURN_ERROR_IF(srcSize != ZSTD_nextSrcSizeToDecompressWithInputSize(dctx, srcSize), srcSize_wrong, "not allowed");
+    if (dstCapacity) ZSTD_checkContinuity(dctx, dst);
+
+    switch (dctx->stage)
+    {
+    case ZSTDds_getFrameHeaderSize :
+        assert(src != NULL);
+        if (dctx->format == ZSTD_f_zstd1) {  /* allows header */
+            assert(srcSize >= ZSTD_FRAMEIDSIZE);  /* to read skippable magic number */
+            if ((MEM_readLE32(src) & ZSTD_MAGIC_SKIPPABLE_MASK) == ZSTD_MAGIC_SKIPPABLE_START) {        /* skippable frame */
+                memcpy(dctx->headerBuffer, src, srcSize);
+                dctx->expected = ZSTD_SKIPPABLEHEADERSIZE - srcSize;  /* remaining to load to get full skippable frame header */
+                dctx->stage = ZSTDds_decodeSkippableHeader;
+                return 0;
+        }   }
+        dctx->headerSize = ZSTD_frameHeaderSize_internal(src, srcSize, dctx->format);
+        if (ZSTD_isError(dctx->headerSize)) return dctx->headerSize;
+        memcpy(dctx->headerBuffer, src, srcSize);
+        dctx->expected = dctx->headerSize - srcSize;
+        dctx->stage = ZSTDds_decodeFrameHeader;
+        return 0;
+
+    case ZSTDds_decodeFrameHeader:
+        assert(src != NULL);
+        memcpy(dctx->headerBuffer + (dctx->headerSize - srcSize), src, srcSize);
+        FORWARD_IF_ERROR(ZSTD_decodeFrameHeader(dctx, dctx->headerBuffer, dctx->headerSize), "");
+        dctx->expected = ZSTDInternalConstants::ZSTD_blockHeaderSize;
+        dctx->stage = ZSTDds_decodeBlockHeader;
+        return 0;
+
+    case ZSTDds_decodeBlockHeader:
+        {   blockProperties_t bp;
+            size_t const cBlockSize = ZSTD_getcBlockSize(src, ZSTDInternalConstants::ZSTD_blockHeaderSize, &bp);
+            if (ZSTD_isError(cBlockSize)) return cBlockSize;
+            RETURN_ERROR_IF(cBlockSize > dctx->fParams.blockSizeMax, corruption_detected, "Block Size Exceeds Maximum");
+            dctx->expected = cBlockSize;
+            dctx->bType = bp.blockType;
+            dctx->rleSize = bp.origSize;
+            if (cBlockSize) {
+                dctx->stage = bp.lastBlock ? ZSTDds_decompressLastBlock : ZSTDds_decompressBlock;
+                return 0;
+            }
+            /* empty block */
+            if (bp.lastBlock) {
+                if (dctx->fParams.checksumFlag) {
+                    dctx->expected = 4;
+                    dctx->stage = ZSTDds_checkChecksum;
+                } else {
+                    dctx->expected = 0; /* end of frame */
+                    dctx->stage = ZSTDds_getFrameHeaderSize;
+                }
+            } else {
+                dctx->expected = ZSTDInternalConstants::ZSTD_blockHeaderSize;  /* jump to next header */
+                dctx->stage = ZSTDds_decodeBlockHeader;
+            }
+            return 0;
+        }
+
+    case ZSTDds_decompressLastBlock:
+    case ZSTDds_decompressBlock:
+        DEBUGLOG(5, "ZSTD_decompressContinue: case ZSTDds_decompressBlock");
+        {   size_t rSize;
+            switch(dctx->bType)
+            {
+            case bt_compressed:
+                DEBUGLOG(5, "ZSTD_decompressContinue: case bt_compressed");
+                rSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize, /* frame */ 1);
+                dctx->expected = 0;  /* Streaming not supported */
+                break;
+            case bt_raw :
+                assert(srcSize <= dctx->expected);
+                rSize = ZSTD_copyRawBlock(dst, dstCapacity, src, srcSize);
+                FORWARD_IF_ERROR(rSize, "ZSTD_copyRawBlock failed");
+                assert(rSize == srcSize);
+                dctx->expected -= rSize;
+                break;
+            case bt_rle :
+                rSize = ZSTD_setRleBlock(dst, dstCapacity, *(const BYTE*)src, dctx->rleSize);
+                dctx->expected = 0;  /* Streaming not supported */
+                break;
+            case bt_reserved :   /* should never happen */
+            default:
+                RETURN_ERROR(corruption_detected, "invalid block type");
+            }
+            FORWARD_IF_ERROR(rSize, "");
+            RETURN_ERROR_IF(rSize > dctx->fParams.blockSizeMax, corruption_detected, "Decompressed Block Size Exceeds Maximum");
+            DEBUGLOG(5, "ZSTD_decompressContinue: decoded size from block : %u", (unsigned)rSize);
+            dctx->decodedSize += rSize;
+            if (dctx->fParams.checksumFlag) XXH64_update(&dctx->xxhState, dst, rSize);
+            dctx->previousDstEnd = (char*)dst + rSize;
+
+            /* Stay on the same stage until we are finished streaming the block. */
+            if (dctx->expected > 0) {
+                return rSize;
+            }
+
+            if (dctx->stage == ZSTDds_decompressLastBlock) {   /* end of frame */
+                DEBUGLOG(4, "ZSTD_decompressContinue: decoded size from frame : %u", (unsigned)dctx->decodedSize);
+                RETURN_ERROR_IF(
+                    dctx->fParams.frameContentSize != ZSTD_CONTENTSIZE_UNKNOWN
+                 && dctx->decodedSize != dctx->fParams.frameContentSize,
+                    corruption_detected, "");
+                if (dctx->fParams.checksumFlag) {  /* another round for frame checksum */
+                    dctx->expected = 4;
+                    dctx->stage = ZSTDds_checkChecksum;
+                } else {
+                    dctx->expected = 0;   /* ends here */
+                    dctx->stage = ZSTDds_getFrameHeaderSize;
+                }
+            } else {
+                dctx->stage = ZSTDds_decodeBlockHeader;
+                dctx->expected = ZSTDInternalConstants::ZSTD_blockHeaderSize;
+            }
+            return rSize;
+        }
+
+    case ZSTDds_checkChecksum:
+        assert(srcSize == 4);  /* guaranteed by dctx->expected */
+        {   U32 const h32 = (U32)XXH64_digest(&dctx->xxhState);
+            U32 const check32 = MEM_readLE32(src);
+            DEBUGLOG(4, "ZSTD_decompressContinue: checksum : calculated %08X :: %08X read", (unsigned)h32, (unsigned)check32);
+            RETURN_ERROR_IF(check32 != h32, checksum_wrong, "");
+            dctx->expected = 0;
+            dctx->stage = ZSTDds_getFrameHeaderSize;
+            return 0;
+        }
+
+    case ZSTDds_decodeSkippableHeader:
+        assert(src != NULL);
+        assert(srcSize <= ZSTD_SKIPPABLEHEADERSIZE);
+        memcpy(dctx->headerBuffer + (ZSTD_SKIPPABLEHEADERSIZE - srcSize), src, srcSize);   /* complete skippable header */
+        dctx->expected = MEM_readLE32(dctx->headerBuffer + ZSTD_FRAMEIDSIZE);   /* note : dctx->expected can grow seriously large, beyond local buffer size */
+        dctx->stage = ZSTDds_skipFrame;
+        return 0;
+
+    case ZSTDds_skipFrame:
+        dctx->expected = 0;
+        dctx->stage = ZSTDds_getFrameHeaderSize;
+        return 0;
+
+    default:
+        assert(0);   /* impossible */
+        RETURN_ERROR(GENERIC, "impossible to reach");   /* some compiler require default to do something */
+    }
+}
+
+
+static size_t ZSTD_refDictContent(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
+{
+    dctx->dictEnd = dctx->previousDstEnd;
+    dctx->virtualStart = (const char*)dict - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->prefixStart));
+    dctx->prefixStart = dict;
+    dctx->previousDstEnd = (const char*)dict + dictSize;
+#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+    dctx->dictContentBeginForFuzzing = dctx->prefixStart;
+    dctx->dictContentEndForFuzzing = dctx->previousDstEnd;
+#endif
+    return 0;
+}
+
+/*! ZSTD_loadDEntropy() :
+ *  dict : must point at beginning of a valid zstd dictionary.
+ * @return : size of entropy tables read */
+size_t
+ZSTD_loadDEntropy(ZSTD_entropyDTables_t* entropy,
+                  const void* const dict, size_t const dictSize)
+{
+    const BYTE* dictPtr = (const BYTE*)dict;
+    const BYTE* const dictEnd = dictPtr + dictSize;
+
+    RETURN_ERROR_IF(dictSize <= 8, dictionary_corrupted, "dict is too small");
+    assert(MEM_readLE32(dict) == ZSTD_MAGIC_DICTIONARY);   /* dict must be valid */
+    dictPtr += 8;   /* skip header = magic + dictID */
+
+    ZSTD_STATIC_ASSERT(offsetof(ZSTD_entropyDTables_t, OFTable) == offsetof(ZSTD_entropyDTables_t, LLTable) + sizeof(entropy->LLTable));
+    ZSTD_STATIC_ASSERT(offsetof(ZSTD_entropyDTables_t, MLTable) == offsetof(ZSTD_entropyDTables_t, OFTable) + sizeof(entropy->OFTable));
+    ZSTD_STATIC_ASSERT(sizeof(entropy->LLTable) + sizeof(entropy->OFTable) + sizeof(entropy->MLTable) >= HUF_DECOMPRESS_WORKSPACE_SIZE);
+    {   void* const workspace = &entropy->LLTable;   /* use fse tables as temporary workspace; implies fse tables are grouped together */
+        size_t const workspaceSize = sizeof(entropy->LLTable) + sizeof(entropy->OFTable) + sizeof(entropy->MLTable);
+#ifdef HUF_FORCE_DECOMPRESS_X1
+        /* in minimal huffman, we always use X1 variants */
+        size_t const hSize = HUF_readDTableX1_wksp(entropy->hufTable,
+                                                dictPtr, dictEnd - dictPtr,
+                                                workspace, workspaceSize);
+#else
+        size_t const hSize = HUF_readDTableX2_wksp(entropy->hufTable,
+                                                dictPtr, dictEnd - dictPtr,
+                                                workspace, workspaceSize);
+#endif
+        RETURN_ERROR_IF(HUF_isError(hSize), dictionary_corrupted, "");
+        dictPtr += hSize;
+    }
+
+    {   short offcodeNCount[MaxOff+1];
+        unsigned offcodeMaxValue = MaxOff, offcodeLog;
+        size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
+        RETURN_ERROR_IF(FSE_isError(offcodeHeaderSize), dictionary_corrupted, "");
+        RETURN_ERROR_IF(offcodeMaxValue > MaxOff, dictionary_corrupted, "");
+        RETURN_ERROR_IF(offcodeLog > OffFSELog, dictionary_corrupted, "");
+        ZSTD_buildFSETable( entropy->OFTable,
+                            offcodeNCount, offcodeMaxValue,
+                            ZSTDConstants::OF_base, ZSTDConstants::OF_bits,
+                            offcodeLog);
+        dictPtr += offcodeHeaderSize;
+    }
+
+    {   short matchlengthNCount[MaxML+1];
+        unsigned matchlengthMaxValue = MaxML, matchlengthLog;
+        size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
+        RETURN_ERROR_IF(FSE_isError(matchlengthHeaderSize), dictionary_corrupted, "");
+        RETURN_ERROR_IF(matchlengthMaxValue > MaxML, dictionary_corrupted, "");
+        RETURN_ERROR_IF(matchlengthLog > MLFSELog, dictionary_corrupted, "");
+        ZSTD_buildFSETable( entropy->MLTable,
+                            matchlengthNCount, matchlengthMaxValue,
+                            ZSTDConstants::ML_base, ZSTDInternalConstants::ML_bits,
+                            matchlengthLog);
+        dictPtr += matchlengthHeaderSize;
+    }
+
+    {   short litlengthNCount[MaxLL+1];
+        unsigned litlengthMaxValue = MaxLL, litlengthLog;
+        size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
+        RETURN_ERROR_IF(FSE_isError(litlengthHeaderSize), dictionary_corrupted, "");
+        RETURN_ERROR_IF(litlengthMaxValue > MaxLL, dictionary_corrupted, "");
+        RETURN_ERROR_IF(litlengthLog > LLFSELog, dictionary_corrupted, "");
+        ZSTD_buildFSETable( entropy->LLTable,
+                            litlengthNCount, litlengthMaxValue,
+                            ZSTDConstants::LL_base, ZSTDInternalConstants::LL_bits,
+                            litlengthLog);
+        dictPtr += litlengthHeaderSize;
+    }
+
+    RETURN_ERROR_IF(dictPtr+12 > dictEnd, dictionary_corrupted, "");
+    {   int i;
+        size_t const dictContentSize = (size_t)(dictEnd - (dictPtr+12));
+        for (i=0; i<3; i++) {
+            U32 const rep = MEM_readLE32(dictPtr); dictPtr += 4;
+            RETURN_ERROR_IF(rep==0 || rep > dictContentSize,
+                            dictionary_corrupted, "");
+            entropy->rep[i] = rep;
+    }   }
+
+    return dictPtr - (const BYTE*)dict;
+}
+
+static size_t ZSTD_decompress_insertDictionary(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
+{
+    if (dictSize < 8) return ZSTD_refDictContent(dctx, dict, dictSize);
+    {   U32 const magic = MEM_readLE32(dict);
+        if (magic != ZSTD_MAGIC_DICTIONARY) {
+            return ZSTD_refDictContent(dctx, dict, dictSize);   /* pure content mode */
+    }   }
+    dctx->dictID = MEM_readLE32((const char*)dict + ZSTD_FRAMEIDSIZE);
+
+    /* load entropy tables */
+    {   size_t const eSize = ZSTD_loadDEntropy(&dctx->entropy, dict, dictSize);
+        RETURN_ERROR_IF(ZSTD_isError(eSize), dictionary_corrupted, "");
+        dict = (const char*)dict + eSize;
+        dictSize -= eSize;
+    }
+    dctx->litEntropy = dctx->fseEntropy = 1;
+
+    /* reference dictionary content */
+    return ZSTD_refDictContent(dctx, dict, dictSize);
+}
+
+static const U32 repStartValue[ZSTD_REP_NUM] = { 1, 4, 8 };
+
+size_t ZSTD_decompressBegin(ZSTD_DCtx* dctx)
+{
+    assert(dctx != NULL);
+    dctx->expected = ZSTD_startingInputLength(dctx->format);  /* dctx->format must be properly set */
+    dctx->stage = ZSTDds_getFrameHeaderSize;
+    dctx->decodedSize = 0;
+    dctx->previousDstEnd = NULL;
+    dctx->prefixStart = NULL;
+    dctx->virtualStart = NULL;
+    dctx->dictEnd = NULL;
+    dctx->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
+    dctx->litEntropy = dctx->fseEntropy = 0;
+    dctx->dictID = 0;
+    dctx->bType = bt_reserved;
+    ZSTD_STATIC_ASSERT(sizeof(dctx->entropy.rep) == sizeof(repStartValue));
+    memcpy(dctx->entropy.rep, repStartValue, sizeof(repStartValue));  /* initial repcodes */
+    dctx->LLTptr = dctx->entropy.LLTable;
+    dctx->MLTptr = dctx->entropy.MLTable;
+    dctx->OFTptr = dctx->entropy.OFTable;
+    dctx->HUFptr = dctx->entropy.hufTable;
+    return 0;
+}
+
+size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
+{
+    FORWARD_IF_ERROR( ZSTD_decompressBegin(dctx) , "");
+    if (dict && dictSize)
+        RETURN_ERROR_IF(
+            ZSTD_isError(ZSTD_decompress_insertDictionary(dctx, dict, dictSize)),
+            dictionary_corrupted, "");
+    return 0;
+}
+
+
+/* ======   ZSTD_DDict   ====== */
+
+size_t ZSTD_decompressBegin_usingDDict(ZSTD_DCtx* dctx, const ZSTD_DDict* ddict)
+{
+    DEBUGLOG(4, "ZSTD_decompressBegin_usingDDict");
+    assert(dctx != NULL);
+    if (ddict) {
+        const char* const dictStart = (const char*)ZSTD_DDict_dictContent(ddict);
+        size_t const dictSize = ZSTD_DDict_dictSize(ddict);
+        const void* const dictEnd = dictStart + dictSize;
+        dctx->ddictIsCold = (dctx->dictEnd != dictEnd);
+        DEBUGLOG(4, "DDict is %s",
+                    dctx->ddictIsCold ? "~cold~" : "hot!");
+    }
+    FORWARD_IF_ERROR( ZSTD_decompressBegin(dctx) , "");
+    if (ddict) {   /* NULL ddict is equivalent to no dictionary */
+        ZSTD_copyDDictParameters(dctx, ddict);
+    }
+    return 0;
+}
+
+/*! ZSTD_getDictID_fromDict() :
+ *  Provides the dictID stored within dictionary.
+ *  if @return == 0, the dictionary is not conformant with Zstandard specification.
+ *  It can still be loaded, but as a content-only dictionary. */
+unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize)
+{
+    if (dictSize < 8) return 0;
+    if (MEM_readLE32(dict) != ZSTD_MAGIC_DICTIONARY) return 0;
+    return MEM_readLE32((const char*)dict + ZSTD_FRAMEIDSIZE);
+}
+
+/*! ZSTD_getDictID_fromFrame() :
+ *  Provides the dictID required to decompress frame stored within `src`.
+ *  If @return == 0, the dictID could not be decoded.
+ *  This could for one of the following reasons :
+ *  - The frame does not require a dictionary (most common case).
+ *  - The frame was built with dictID intentionally removed.
+ *    Needed dictionary is a hidden information.
+ *    Note : this use case also happens when using a non-conformant dictionary.
+ *  - `srcSize` is too small, and as a result, frame header could not be decoded.
+ *    Note : possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`.
+ *  - This is not a Zstandard frame.
+ *  When identifying the exact failure cause, it's possible to use
+ *  ZSTD_getFrameHeader(), which will provide a more precise error code. */
+unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize)
+{
+    ZSTD_frameHeader zfp = { 0, 0, 0, ZSTD_frame, 0, 0, 0 };
+    size_t const hError = ZSTD_getFrameHeader(&zfp, src, srcSize);
+    if (ZSTD_isError(hError)) return 0;
+    return zfp.dictID;
+}
+
+
+/*! ZSTD_decompress_usingDDict() :
+*   Decompression using a pre-digested Dictionary
+*   Use dictionary without significant overhead. */
+size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
+                                  void* dst, size_t dstCapacity,
+                            const void* src, size_t srcSize,
+                            const ZSTD_DDict* ddict)
+{
+    /* pass content and size in case legacy frames are encountered */
+    return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize,
+                                     NULL, 0,
+                                     ddict);
+}
+
+
+/*=====================================
+*   Streaming decompression
+*====================================*/
+
+ZSTD_DStream* ZSTD_createDStream(void)
+{
+    DEBUGLOG(3, "ZSTD_createDStream");
+    return ZSTD_createDStream_advanced(ZSTDInternalConstants::ZSTD_defaultCMem);
+}
+
+ZSTD_DStream* ZSTD_initStaticDStream(void *workspace, size_t workspaceSize)
+{
+    return ZSTD_initStaticDCtx(workspace, workspaceSize);
+}
+
+ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem)
+{
+    return ZSTD_createDCtx_advanced(customMem);
+}
+
+size_t ZSTD_freeDStream(ZSTD_DStream* zds)
+{
+    return ZSTD_freeDCtx(zds);
+}
+
+
+/* ***  Initialization  *** */
+
+size_t ZSTD_DStreamInSize(void)  { return ZSTD_BLOCKSIZE_MAX + ZSTDInternalConstants::ZSTD_blockHeaderSize; }
+size_t ZSTD_DStreamOutSize(void) { return ZSTD_BLOCKSIZE_MAX; }
+
+size_t ZSTD_DCtx_loadDictionary_advanced(ZSTD_DCtx* dctx,
+                                   const void* dict, size_t dictSize,
+                                         ZSTD_dictLoadMethod_e dictLoadMethod,
+                                         ZSTD_dictContentType_e dictContentType)
+{
+    RETURN_ERROR_IF(dctx->streamStage != zdss_init, stage_wrong, "");
+    ZSTD_clearDict(dctx);
+    if (dict && dictSize != 0) {
+        dctx->ddictLocal = ZSTD_createDDict_advanced(dict, dictSize, dictLoadMethod, dictContentType, dctx->customMem);
+        RETURN_ERROR_IF(dctx->ddictLocal == NULL, memory_allocation, "NULL pointer!");
+        dctx->ddict = dctx->ddictLocal;
+        dctx->dictUses = ZSTD_use_indefinitely;
+    }
+    return 0;
+}
+
+size_t ZSTD_DCtx_loadDictionary_byReference(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
+{
+    return ZSTD_DCtx_loadDictionary_advanced(dctx, dict, dictSize, ZSTD_dlm_byRef, ZSTD_dct_auto);
+}
+
+size_t ZSTD_DCtx_loadDictionary(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
+{
+    return ZSTD_DCtx_loadDictionary_advanced(dctx, dict, dictSize, ZSTD_dlm_byCopy, ZSTD_dct_auto);
+}
+
+size_t ZSTD_DCtx_refPrefix_advanced(ZSTD_DCtx* dctx, const void* prefix, size_t prefixSize, ZSTD_dictContentType_e dictContentType)
+{
+    FORWARD_IF_ERROR(ZSTD_DCtx_loadDictionary_advanced(dctx, prefix, prefixSize, ZSTD_dlm_byRef, dictContentType), "");
+    dctx->dictUses = ZSTD_use_once;
+    return 0;
+}
+
+size_t ZSTD_DCtx_refPrefix(ZSTD_DCtx* dctx, const void* prefix, size_t prefixSize)
+{
+    return ZSTD_DCtx_refPrefix_advanced(dctx, prefix, prefixSize, ZSTD_dct_rawContent);
+}
+
+
+/* ZSTD_initDStream_usingDict() :
+ * return : expected size, aka ZSTD_startingInputLength().
+ * this function cannot fail */
+size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize)
+{
+    DEBUGLOG(4, "ZSTD_initDStream_usingDict");
+    FORWARD_IF_ERROR( ZSTD_DCtx_reset(zds, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_DCtx_loadDictionary(zds, dict, dictSize) , "");
+    return ZSTD_startingInputLength(zds->format);
+}
+
+/* note : this variant can't fail */
+size_t ZSTD_initDStream(ZSTD_DStream* zds)
+{
+    DEBUGLOG(4, "ZSTD_initDStream");
+    return ZSTD_initDStream_usingDDict(zds, NULL);
+}
+
+/* ZSTD_initDStream_usingDDict() :
+ * ddict will just be referenced, and must outlive decompression session
+ * this function cannot fail */
+size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* dctx, const ZSTD_DDict* ddict)
+{
+    FORWARD_IF_ERROR( ZSTD_DCtx_reset(dctx, ZSTD_reset_session_only) , "");
+    FORWARD_IF_ERROR( ZSTD_DCtx_refDDict(dctx, ddict) , "");
+    return ZSTD_startingInputLength(dctx->format);
+}
+
+/* ZSTD_resetDStream() :
+ * return : expected size, aka ZSTD_startingInputLength().
+ * this function cannot fail */
+size_t ZSTD_resetDStream(ZSTD_DStream* dctx)
+{
+    FORWARD_IF_ERROR(ZSTD_DCtx_reset(dctx, ZSTD_reset_session_only), "");
+    return ZSTD_startingInputLength(dctx->format);
+}
+
+
+size_t ZSTD_DCtx_refDDict(ZSTD_DCtx* dctx, const ZSTD_DDict* ddict)
+{
+    RETURN_ERROR_IF(dctx->streamStage != zdss_init, stage_wrong, "");
+    ZSTD_clearDict(dctx);
+    if (ddict) {
+        dctx->ddict = ddict;
+        dctx->dictUses = ZSTD_use_indefinitely;
+    }
+    return 0;
+}
+
+/* ZSTD_DCtx_setMaxWindowSize() :
+ * note : no direct equivalence in ZSTD_DCtx_setParameter,
+ * since this version sets windowSize, and the other sets windowLog */
+size_t ZSTD_DCtx_setMaxWindowSize(ZSTD_DCtx* dctx, size_t maxWindowSize)
+{
+    ZSTD_bounds const bounds = ZSTD_dParam_getBounds(ZSTD_d_windowLogMax);
+    size_t const min = (size_t)1 << bounds.lowerBound;
+    size_t const max = (size_t)1 << bounds.upperBound;
+    RETURN_ERROR_IF(dctx->streamStage != zdss_init, stage_wrong, "");
+    RETURN_ERROR_IF(maxWindowSize < min, parameter_outOfBound, "");
+    RETURN_ERROR_IF(maxWindowSize > max, parameter_outOfBound, "");
+    dctx->maxWindowSize = maxWindowSize;
+    return 0;
+}
+
+size_t ZSTD_DCtx_setFormat(ZSTD_DCtx* dctx, ZSTD_format_e format)
+{
+    return ZSTD_DCtx_setParameter(dctx, ZSTD_d_format, format);
+}
+
+ZSTD_bounds ZSTD_dParam_getBounds(ZSTD_dParameter dParam)
+{
+    ZSTD_bounds bounds = { 0, 0, 0 };
+    switch(dParam) {
+        case ZSTD_d_windowLogMax:
+            bounds.lowerBound = ZSTD_WINDOWLOG_ABSOLUTEMIN;
+            bounds.upperBound = ZSTD_WINDOWLOG_MAX;
+            return bounds;
+        case ZSTD_d_format:
+            bounds.lowerBound = (int)ZSTD_f_zstd1;
+            bounds.upperBound = (int)ZSTD_f_zstd1_magicless;
+            ZSTD_STATIC_ASSERT(ZSTD_f_zstd1 < ZSTD_f_zstd1_magicless);
+            return bounds;
+        case ZSTD_d_stableOutBuffer:
+            bounds.lowerBound = (int)ZSTD_obm_buffered;
+            bounds.upperBound = (int)ZSTD_obm_stable;
+            return bounds;
+        default:;
+    }
+    bounds.error = ERROR(parameter_unsupported);
+    return bounds;
+}
+
+/* ZSTD_dParam_withinBounds:
+ * @return 1 if value is within dParam bounds,
+ * 0 otherwise */
+static int ZSTD_dParam_withinBounds(ZSTD_dParameter dParam, int value)
+{
+    ZSTD_bounds const bounds = ZSTD_dParam_getBounds(dParam);
+    if (ZSTD_isError(bounds.error)) return 0;
+    if (value < bounds.lowerBound) return 0;
+    if (value > bounds.upperBound) return 0;
+    return 1;
+}
+
+#define CHECK_DBOUNDS(p,v) {                \
+    RETURN_ERROR_IF(!ZSTD_dParam_withinBounds(p, v), parameter_outOfBound, ""); \
+}
+
+size_t ZSTD_DCtx_setParameter(ZSTD_DCtx* dctx, ZSTD_dParameter dParam, int value)
+{
+    RETURN_ERROR_IF(dctx->streamStage != zdss_init, stage_wrong, "");
+    switch(dParam) {
+        case ZSTD_d_windowLogMax:
+            if (value == 0) value = ZSTD_WINDOWLOG_LIMIT_DEFAULT;
+            CHECK_DBOUNDS(ZSTD_d_windowLogMax, value);
+            dctx->maxWindowSize = ((size_t)1) << value;
+            return 0;
+        case ZSTD_d_format:
+            CHECK_DBOUNDS(ZSTD_d_format, value);
+            dctx->format = (ZSTD_format_e)value;
+            return 0;
+        case ZSTD_d_stableOutBuffer:
+            CHECK_DBOUNDS(ZSTD_d_stableOutBuffer, value);
+            dctx->outBufferMode = (ZSTD_outBufferMode_e)value;
+            return 0;
+        default:;
+    }
+    RETURN_ERROR(parameter_unsupported, "");
+}
+
+size_t ZSTD_DCtx_reset(ZSTD_DCtx* dctx, ZSTD_ResetDirective reset)
+{
+    if ( (reset == ZSTD_reset_session_only)
+      || (reset == ZSTD_reset_session_and_parameters) ) {
+        dctx->streamStage = zdss_init;
+        dctx->noForwardProgress = 0;
+    }
+    if ( (reset == ZSTD_reset_parameters)
+      || (reset == ZSTD_reset_session_and_parameters) ) {
+        RETURN_ERROR_IF(dctx->streamStage != zdss_init, stage_wrong, "");
+        ZSTD_clearDict(dctx);
+        dctx->format = ZSTD_f_zstd1;
+        dctx->maxWindowSize = ZSTD_MAXWINDOWSIZE_DEFAULT;
+    }
+    return 0;
+}
+
+
+size_t ZSTD_sizeof_DStream(const ZSTD_DStream* dctx)
+{
+    return ZSTD_sizeof_DCtx(dctx);
+}
+
+size_t ZSTD_decodingBufferSize_min(unsigned long long windowSize, unsigned long long frameContentSize)
+{
+    size_t const blockSize = (size_t) MIN(windowSize, ZSTD_BLOCKSIZE_MAX);
+    unsigned long long const neededRBSize = windowSize + blockSize + (WILDCOPY_OVERLENGTH * 2);
+    unsigned long long const neededSize = MIN(frameContentSize, neededRBSize);
+    size_t const minRBSize = (size_t) neededSize;
+    RETURN_ERROR_IF((unsigned long long)minRBSize != neededSize,
+                    frameParameter_windowTooLarge, "");
+    return minRBSize;
+}
+
+size_t ZSTD_estimateDStreamSize(size_t windowSize)
+{
+    size_t const blockSize = MIN(windowSize, ZSTD_BLOCKSIZE_MAX);
+    size_t const inBuffSize = blockSize;  /* no block can be larger */
+    size_t const outBuffSize = ZSTD_decodingBufferSize_min(windowSize, ZSTD_CONTENTSIZE_UNKNOWN);
+    return ZSTD_estimateDCtxSize() + inBuffSize + outBuffSize;
+}
+
+size_t ZSTD_estimateDStreamSize_fromFrame(const void* src, size_t srcSize)
+{
+    U32 const windowSizeMax = 1U << ZSTD_WINDOWLOG_MAX;   /* note : should be user-selectable, but requires an additional parameter (or a dctx) */
+    ZSTD_frameHeader zfh;
+    size_t const err = ZSTD_getFrameHeader(&zfh, src, srcSize);
+    if (ZSTD_isError(err)) return err;
+    RETURN_ERROR_IF(err>0, srcSize_wrong, "");
+    RETURN_ERROR_IF(zfh.windowSize > windowSizeMax,
+                    frameParameter_windowTooLarge, "");
+    return ZSTD_estimateDStreamSize((size_t)zfh.windowSize);
+}
+
+
+/* *****   Decompression   ***** */
+
+static int ZSTD_DCtx_isOverflow(ZSTD_DStream* zds, size_t const neededInBuffSize, size_t const neededOutBuffSize)
+{
+    return (zds->inBuffSize + zds->outBuffSize) >= (neededInBuffSize + neededOutBuffSize) * ZSTD_WORKSPACETOOLARGE_FACTOR;
+}
+
+static void ZSTD_DCtx_updateOversizedDuration(ZSTD_DStream* zds, size_t const neededInBuffSize, size_t const neededOutBuffSize)
+{
+    if (ZSTD_DCtx_isOverflow(zds, neededInBuffSize, neededOutBuffSize))
+        zds->oversizedDuration++;
+    else
+        zds->oversizedDuration = 0;
+}
+
+static int ZSTD_DCtx_isOversizedTooLong(ZSTD_DStream* zds)
+{
+    return zds->oversizedDuration >= ZSTD_WORKSPACETOOLARGE_MAXDURATION;
+}
+
+/* Checks that the output buffer hasn't changed if ZSTD_obm_stable is used. */
+static size_t ZSTD_checkOutBuffer(ZSTD_DStream const* zds, ZSTD_outBuffer const* output)
+{
+    ZSTD_outBuffer const expect = zds->expectedOutBuffer;
+    /* No requirement when ZSTD_obm_stable is not enabled. */
+    if (zds->outBufferMode != ZSTD_obm_stable)
+        return 0;
+    /* Any buffer is allowed in zdss_init, this must be the same for every other call until
+     * the context is reset.
+     */
+    if (zds->streamStage == zdss_init)
+        return 0;
+    /* The buffer must match our expectation exactly. */
+    if (expect.dst == output->dst && expect.pos == output->pos && expect.size == output->size)
+        return 0;
+    RETURN_ERROR(dstBuffer_wrong, "ZSTD_obm_stable enabled but output differs!");
+}
+
+/* Calls ZSTD_decompressContinue() with the right parameters for ZSTD_decompressStream()
+ * and updates the stage and the output buffer state. This call is extracted so it can be
+ * used both when reading directly from the ZSTD_inBuffer, and in buffered input mode.
+ * NOTE: You must break after calling this function since the streamStage is modified.
+ */
+static size_t ZSTD_decompressContinueStream(
+            ZSTD_DStream* zds, char** op, char* oend,
+            void const* src, size_t srcSize) {
+    int const isSkipFrame = ZSTD_isSkipFrame(zds);
+    if (zds->outBufferMode == ZSTD_obm_buffered) {
+        size_t const dstSize = isSkipFrame ? 0 : zds->outBuffSize - zds->outStart;
+        size_t const decodedSize = ZSTD_decompressContinue(zds,
+                zds->outBuff + zds->outStart, dstSize, src, srcSize);
+        FORWARD_IF_ERROR(decodedSize, "");
+        if (!decodedSize && !isSkipFrame) {
+            zds->streamStage = zdss_read;
+        } else {
+            zds->outEnd = zds->outStart + decodedSize;
+            zds->streamStage = zdss_flush;
+        }
+    } else {
+        /* Write directly into the output buffer */
+        size_t const dstSize = isSkipFrame ? 0 : oend - *op;
+        size_t const decodedSize = ZSTD_decompressContinue(zds, *op, dstSize, src, srcSize);
+        FORWARD_IF_ERROR(decodedSize, "");
+        *op += decodedSize;
+        /* Flushing is not needed. */
+        zds->streamStage = zdss_read;
+        assert(*op <= oend);
+        assert(zds->outBufferMode == ZSTD_obm_stable);
+    }
+    return 0;
+}
+
+size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
+{
+    const char* const src = (const char*)input->src;
+    const char* const istart = input->pos != 0 ? src + input->pos : src;
+    const char* const iend = input->size != 0 ? src + input->size : src;
+    const char* ip = istart;
+    char* const dst = (char*)output->dst;
+    char* const ostart = output->pos != 0 ? dst + output->pos : dst;
+    char* const oend = output->size != 0 ? dst + output->size : dst;
+    char* op = ostart;
+    U32 someMoreWork = 1;
+
+    DEBUGLOG(5, "ZSTD_decompressStream");
+    RETURN_ERROR_IF(
+        input->pos > input->size,
+        srcSize_wrong,
+        "forbidden. in: pos: %u   vs size: %u",
+        (U32)input->pos, (U32)input->size);
+    RETURN_ERROR_IF(
+        output->pos > output->size,
+        dstSize_tooSmall,
+        "forbidden. out: pos: %u   vs size: %u",
+        (U32)output->pos, (U32)output->size);
+    DEBUGLOG(5, "input size : %u", (U32)(input->size - input->pos));
+    FORWARD_IF_ERROR(ZSTD_checkOutBuffer(zds, output), "");
+
+    while (someMoreWork) {
+        switch(zds->streamStage)
+        {
+        case zdss_init :
+            DEBUGLOG(5, "stage zdss_init => transparent reset ");
+            zds->streamStage = zdss_loadHeader;
+            zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
+            zds->legacyVersion = 0;
+            zds->hostageByte = 0;
+            zds->expectedOutBuffer = *output;
+            /* fall-through */
+
+        case zdss_loadHeader :
+            DEBUGLOG(5, "stage zdss_loadHeader (srcSize : %u)", (U32)(iend - ip));
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
+            if (zds->legacyVersion) {
+                RETURN_ERROR_IF(zds->staticSize, memory_allocation,
+                    "legacy support is incompatible with static dctx");
+                {   size_t const hint = ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
+                    if (hint==0) zds->streamStage = zdss_init;
+                    return hint;
+            }   }
+#endif
+            {   size_t const hSize = ZSTD_getFrameHeader_advanced(&zds->fParams, zds->headerBuffer, zds->lhSize, zds->format);
+                DEBUGLOG(5, "header size : %u", (U32)hSize);
+                if (ZSTD_isError(hSize)) {
+#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
+                    U32 const legacyVersion = ZSTD_isLegacy(istart, iend-istart);
+                    if (legacyVersion) {
+                        ZSTD_DDict const* const ddict = ZSTD_getDDict(zds);
+                        const void* const dict = ddict ? ZSTD_DDict_dictContent(ddict) : NULL;
+                        size_t const dictSize = ddict ? ZSTD_DDict_dictSize(ddict) : 0;
+                        DEBUGLOG(5, "ZSTD_decompressStream: detected legacy version v0.%u", legacyVersion);
+                        RETURN_ERROR_IF(zds->staticSize, memory_allocation,
+                            "legacy support is incompatible with static dctx");
+                        FORWARD_IF_ERROR(ZSTD_initLegacyStream(&zds->legacyContext,
+                                    zds->previousLegacyVersion, legacyVersion,
+                                    dict, dictSize), "");
+                        zds->legacyVersion = zds->previousLegacyVersion = legacyVersion;
+                        {   size_t const hint = ZSTD_decompressLegacyStream(zds->legacyContext, legacyVersion, output, input);
+                            if (hint==0) zds->streamStage = zdss_init;   /* or stay in stage zdss_loadHeader */
+                            return hint;
+                    }   }
+#endif
+                    return hSize;   /* error */
+                }
+                if (hSize != 0) {   /* need more input */
+                    size_t const toLoad = hSize - zds->lhSize;   /* if hSize!=0, hSize > zds->lhSize */
+                    size_t const remainingInput = (size_t)(iend-ip);
+                    assert(iend >= ip);
+                    if (toLoad > remainingInput) {   /* not enough input to load full header */
+                        if (remainingInput > 0) {
+                            memcpy(zds->headerBuffer + zds->lhSize, ip, remainingInput);
+                            zds->lhSize += remainingInput;
+                        }
+                        input->pos = input->size;
+                        return (MAX((size_t)ZSTD_FRAMEHEADERSIZE_MIN(zds->format), hSize) - zds->lhSize) + ZSTDInternalConstants::ZSTD_blockHeaderSize;   /* remaining header bytes + next block header */
+                    }
+                    assert(ip != NULL);
+                    memcpy(zds->headerBuffer + zds->lhSize, ip, toLoad); zds->lhSize = hSize; ip += toLoad;
+                    break;
+            }   }
+
+            /* check for single-pass mode opportunity */
+            if (zds->fParams.frameContentSize != ZSTD_CONTENTSIZE_UNKNOWN
+                && zds->fParams.frameType != ZSTD_skippableFrame
+                && (U64)(size_t)(oend-op) >= zds->fParams.frameContentSize) {
+                size_t const cSize = ZSTD_findFrameCompressedSize(istart, iend-istart);
+                if (cSize <= (size_t)(iend-istart)) {
+                    /* shortcut : using single-pass mode */
+                    size_t const decompressedSize = ZSTD_decompress_usingDDict(zds, op, oend-op, istart, cSize, ZSTD_getDDict(zds));
+                    if (ZSTD_isError(decompressedSize)) return decompressedSize;
+                    DEBUGLOG(4, "shortcut to single-pass ZSTD_decompress_usingDDict()")
+                    ip = istart + cSize;
+                    op += decompressedSize;
+                    zds->expected = 0;
+                    zds->streamStage = zdss_init;
+                    someMoreWork = 0;
+                    break;
+            }   }
+
+            /* Check output buffer is large enough for ZSTD_odm_stable. */
+            if (zds->outBufferMode == ZSTD_obm_stable
+                && zds->fParams.frameType != ZSTD_skippableFrame
+                && zds->fParams.frameContentSize != ZSTD_CONTENTSIZE_UNKNOWN
+                && (U64)(size_t)(oend-op) < zds->fParams.frameContentSize) {
+                RETURN_ERROR(dstSize_tooSmall, "ZSTD_obm_stable passed but ZSTD_outBuffer is too small");
+            }
+
+            /* Consume header (see ZSTDds_decodeFrameHeader) */
+            DEBUGLOG(4, "Consume header");
+            FORWARD_IF_ERROR(ZSTD_decompressBegin_usingDDict(zds, ZSTD_getDDict(zds)), "");
+
+            if ((MEM_readLE32(zds->headerBuffer) & ZSTD_MAGIC_SKIPPABLE_MASK) == ZSTD_MAGIC_SKIPPABLE_START) {  /* skippable frame */
+                zds->expected = MEM_readLE32(zds->headerBuffer + ZSTD_FRAMEIDSIZE);
+                zds->stage = ZSTDds_skipFrame;
+            } else {
+                FORWARD_IF_ERROR(ZSTD_decodeFrameHeader(zds, zds->headerBuffer, zds->lhSize), "");
+                zds->expected = ZSTDInternalConstants::ZSTD_blockHeaderSize;
+                zds->stage = ZSTDds_decodeBlockHeader;
+            }
+
+            /* control buffer memory usage */
+            DEBUGLOG(4, "Control max memory usage (%u KB <= max %u KB)",
+                        (U32)(zds->fParams.windowSize >>10),
+                        (U32)(zds->maxWindowSize >> 10) );
+            zds->fParams.windowSize = MAX(zds->fParams.windowSize, 1U << ZSTD_WINDOWLOG_ABSOLUTEMIN);
+            RETURN_ERROR_IF(zds->fParams.windowSize > zds->maxWindowSize,
+                            frameParameter_windowTooLarge, "");
+
+            /* Adapt buffer sizes to frame header instructions */
+            {   size_t const neededInBuffSize = MAX(zds->fParams.blockSizeMax, 4 /* frame checksum */);
+                size_t const neededOutBuffSize = zds->outBufferMode == ZSTD_obm_buffered
+                        ? ZSTD_decodingBufferSize_min(zds->fParams.windowSize, zds->fParams.frameContentSize)
+                        : 0;
+
+                ZSTD_DCtx_updateOversizedDuration(zds, neededInBuffSize, neededOutBuffSize);
+
+                {   int const tooSmall = (zds->inBuffSize < neededInBuffSize) || (zds->outBuffSize < neededOutBuffSize);
+                    int const tooLarge = ZSTD_DCtx_isOversizedTooLong(zds);
+
+                    if (tooSmall || tooLarge) {
+                        size_t const bufferSize = neededInBuffSize + neededOutBuffSize;
+                        DEBUGLOG(4, "inBuff  : from %u to %u",
+                                    (U32)zds->inBuffSize, (U32)neededInBuffSize);
+                        DEBUGLOG(4, "outBuff : from %u to %u",
+                                    (U32)zds->outBuffSize, (U32)neededOutBuffSize);
+                        if (zds->staticSize) {  /* static DCtx */
+                            DEBUGLOG(4, "staticSize : %u", (U32)zds->staticSize);
+                            assert(zds->staticSize >= sizeof(ZSTD_DCtx));  /* controlled at init */
+                            RETURN_ERROR_IF(
+                                bufferSize > zds->staticSize - sizeof(ZSTD_DCtx),
+                                memory_allocation, "");
+                        } else {
+                            ZSTD_free(zds->inBuff, zds->customMem);
+                            zds->inBuffSize = 0;
+                            zds->outBuffSize = 0;
+                            zds->inBuff = (char*)ZSTD_malloc(bufferSize, zds->customMem);
+                            RETURN_ERROR_IF(zds->inBuff == NULL, memory_allocation, "");
+                        }
+                        zds->inBuffSize = neededInBuffSize;
+                        zds->outBuff = zds->inBuff + zds->inBuffSize;
+                        zds->outBuffSize = neededOutBuffSize;
+            }   }   }
+            zds->streamStage = zdss_read;
+            /* fall-through */
+
+        case zdss_read:
+            DEBUGLOG(5, "stage zdss_read");
+            {   size_t const neededInSize = ZSTD_nextSrcSizeToDecompressWithInputSize(zds, iend - ip);
+                DEBUGLOG(5, "neededInSize = %u", (U32)neededInSize);
+                if (neededInSize==0) {  /* end of frame */
+                    zds->streamStage = zdss_init;
+                    someMoreWork = 0;
+                    break;
+                }
+                if ((size_t)(iend-ip) >= neededInSize) {  /* decode directly from src */
+                    FORWARD_IF_ERROR(ZSTD_decompressContinueStream(zds, &op, oend, ip, neededInSize), "");
+                    ip += neededInSize;
+                    /* Function modifies the stage so we must break */
+                    break;
+            }   }
+            if (ip==iend) { someMoreWork = 0; break; }   /* no more input */
+            zds->streamStage = zdss_load;
+            /* fall-through */
+
+        case zdss_load:
+            {   size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds);
+                size_t const toLoad = neededInSize - zds->inPos;
+                int const isSkipFrame = ZSTD_isSkipFrame(zds);
+                size_t loadedSize;
+                /* At this point we shouldn't be decompressing a block that we can stream. */
+                assert(neededInSize == ZSTD_nextSrcSizeToDecompressWithInputSize(zds, iend - ip));
+                if (isSkipFrame) {
+                    loadedSize = MIN(toLoad, (size_t)(iend-ip));
+                } else {
+                    RETURN_ERROR_IF(toLoad > zds->inBuffSize - zds->inPos,
+                                    corruption_detected,
+                                    "should never happen");
+                    loadedSize = ZSTD_limitCopy(zds->inBuff + zds->inPos, toLoad, ip, iend-ip);
+                }
+                ip += loadedSize;
+                zds->inPos += loadedSize;
+                if (loadedSize < toLoad) { someMoreWork = 0; break; }   /* not enough input, wait for more */
+
+                /* decode loaded input */
+                zds->inPos = 0;   /* input is consumed */
+                FORWARD_IF_ERROR(ZSTD_decompressContinueStream(zds, &op, oend, zds->inBuff, neededInSize), "");
+                /* Function modifies the stage so we must break */
+                break;
+            }
+        case zdss_flush:
+            {   size_t const toFlushSize = zds->outEnd - zds->outStart;
+                size_t const flushedSize = ZSTD_limitCopy(op, oend-op, zds->outBuff + zds->outStart, toFlushSize);
+                op += flushedSize;
+                zds->outStart += flushedSize;
+                if (flushedSize == toFlushSize) {  /* flush completed */
+                    zds->streamStage = zdss_read;
+                    if ( (zds->outBuffSize < zds->fParams.frameContentSize)
+                      && (zds->outStart + zds->fParams.blockSizeMax > zds->outBuffSize) ) {
+                        DEBUGLOG(5, "restart filling outBuff from beginning (left:%i, needed:%u)",
+                                (int)(zds->outBuffSize - zds->outStart),
+                                (U32)zds->fParams.blockSizeMax);
+                        zds->outStart = zds->outEnd = 0;
+                    }
+                    break;
+            }   }
+            /* cannot complete flush */
+            someMoreWork = 0;
+            break;
+
+        default:
+            assert(0);    /* impossible */
+            RETURN_ERROR(GENERIC, "impossible to reach");   /* some compiler require default to do something */
+    }   }
+
+    /* result */
+    input->pos = (size_t)(ip - (const char*)(input->src));
+    output->pos = (size_t)(op - (char*)(output->dst));
+
+    /* Update the expected output buffer for ZSTD_obm_stable. */
+    zds->expectedOutBuffer = *output;
+
+    if ((ip==istart) && (op==ostart)) {  /* no forward progress */
+        zds->noForwardProgress ++;
+        if (zds->noForwardProgress >= ZSTD_NO_FORWARD_PROGRESS_MAX) {
+            RETURN_ERROR_IF(op==oend, dstSize_tooSmall, "");
+            RETURN_ERROR_IF(ip==iend, srcSize_wrong, "");
+            assert(0);
+        }
+    } else {
+        zds->noForwardProgress = 0;
+    }
+    {   size_t nextSrcSizeHint = ZSTD_nextSrcSizeToDecompress(zds);
+        if (!nextSrcSizeHint) {   /* frame fully decoded */
+            if (zds->outEnd == zds->outStart) {  /* output fully flushed */
+                if (zds->hostageByte) {
+                    if (input->pos >= input->size) {
+                        /* can't release hostage (not present) */
+                        zds->streamStage = zdss_read;
+                        return 1;
+                    }
+                    input->pos++;  /* release hostage */
+                }   /* zds->hostageByte */
+                return 0;
+            }  /* zds->outEnd == zds->outStart */
+            if (!zds->hostageByte) { /* output not fully flushed; keep last byte as hostage; will be released when all output is flushed */
+                input->pos--;   /* note : pos > 0, otherwise, impossible to finish reading last block */
+                zds->hostageByte=1;
+            }
+            return 1;
+        }  /* nextSrcSizeHint==0 */
+        nextSrcSizeHint += ZSTDInternalConstants::ZSTD_blockHeaderSize * (ZSTD_nextInputType(zds) == ZSTDnit_block);   /* preload header of next block */
+        assert(zds->inPos <= nextSrcSizeHint);
+        nextSrcSizeHint -= zds->inPos;   /* part already loaded*/
+        return nextSrcSizeHint;
+    }
+}
+
+size_t ZSTD_decompressStream_simpleArgs (
+                            ZSTD_DCtx* dctx,
+                            void* dst, size_t dstCapacity, size_t* dstPos,
+                      const void* src, size_t srcSize, size_t* srcPos)
+{
+    ZSTD_outBuffer output = { dst, dstCapacity, *dstPos };
+    ZSTD_inBuffer  input  = { src, srcSize, *srcPos };
+    /* ZSTD_compress_generic() will check validity of dstPos and srcPos */
+    size_t const cErr = ZSTD_decompressStream(dctx, &output, &input);
+    *dstPos = output.pos;
+    *srcPos = input.pos;
+    return cErr;
+}
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/zstd_decompress_block.cpp b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/zstd_decompress_block.cpp
new file mode 100644
index 0000000000..45c57b945b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/decompress/zstd_decompress_block.cpp
@@ -0,0 +1,1418 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+/* zstd_decompress_block :
+ * this module takes care of decompressing _compressed_ block */
+
+/*-*******************************************************
+*  Dependencies
+*********************************************************/
+#include <string.h>      /* memcpy, memmove, memset */
+#include "zstd/common/compiler.h"    /* prefetch */
+#include "zstd/common/mem.h"         /* low level memory routines */
+#include "zstd/common/fse.h"
+#include "zstd/common/fse_static.h"
+#include "zstd/common/huf.h"
+#include "zstd/common/huf_static.h"
+#include "zstd/common/zstd_internal.h"
+#include "zstd/decompress/zstd_decompress_internal.h"   /* ZSTD_DCtx */
+#include "zstd/decompress/zstd_ddict.h"  /* ZSTD_DDictDictContent */
+#include "zstd/decompress/zstd_decompress_block.h"
+namespace lbug_zstd {
+/*_*******************************************************
+*  Macros
+**********************************************************/
+
+/* These two optional macros force the use one way or another of the two
+ * ZSTD_decompressSequences implementations. You can't force in both directions
+ * at the same time.
+ */
+#if defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT) && \
+    defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG)
+#error "Cannot force the use of the short and the long ZSTD_decompressSequences variants!"
+#endif
+
+
+/*_*******************************************************
+*  Memory operations
+**********************************************************/
+static void ZSTD_copy4(void* dst, const void* src) { memcpy(dst, src, 4); }
+
+
+/*-*************************************************************
+ *   Block decoding
+ ***************************************************************/
+
+/*! ZSTD_getcBlockSize() :
+ *  Provides the size of compressed block from block header `src` */
+size_t ZSTD_getcBlockSize(const void* src, size_t srcSize,
+                          blockProperties_t* bpPtr)
+{
+    RETURN_ERROR_IF(srcSize < ZSTDInternalConstants::ZSTD_blockHeaderSize, srcSize_wrong, "");
+
+    {   U32 const cBlockHeader = MEM_readLE24(src);
+        U32 const cSize = cBlockHeader >> 3;
+        bpPtr->lastBlock = cBlockHeader & 1;
+        bpPtr->blockType = (blockType_e)((cBlockHeader >> 1) & 3);
+        bpPtr->origSize = cSize;   /* only useful for RLE */
+        if (bpPtr->blockType == bt_rle) return 1;
+        RETURN_ERROR_IF(bpPtr->blockType == bt_reserved, corruption_detected, "");
+        return cSize;
+    }
+}
+
+
+/* Hidden declaration for fullbench */
+size_t ZSTD_decodeLiteralsBlock(ZSTD_DCtx* dctx,
+                          const void* src, size_t srcSize);
+/*! ZSTD_decodeLiteralsBlock() :
+ * @return : nb of bytes read from src (< srcSize )
+ *  note : symbol not declared but exposed for fullbench */
+size_t ZSTD_decodeLiteralsBlock(ZSTD_DCtx* dctx,
+                          const void* src, size_t srcSize)   /* note : srcSize < BLOCKSIZE */
+{
+    DEBUGLOG(5, "ZSTD_decodeLiteralsBlock");
+    RETURN_ERROR_IF(srcSize < MIN_CBLOCK_SIZE, corruption_detected, "");
+
+    {   const BYTE* const istart = (const BYTE*) src;
+        symbolEncodingType_e const litEncType = (symbolEncodingType_e)(istart[0] & 3);
+
+        switch(litEncType)
+        {
+        case set_repeat:
+            DEBUGLOG(5, "set_repeat flag : re-using stats from previous compressed literals block");
+            RETURN_ERROR_IF(dctx->litEntropy==0, dictionary_corrupted, "");
+            /* fall-through */
+
+        case set_compressed:
+            RETURN_ERROR_IF(srcSize < 5, corruption_detected, "srcSize >= MIN_CBLOCK_SIZE == 3; here we need up to 5 for case 3");
+            {   size_t lhSize, litSize, litCSize;
+                U32 singleStream=0;
+                U32 const lhlCode = (istart[0] >> 2) & 3;
+                U32 const lhc = MEM_readLE32(istart);
+                size_t hufSuccess;
+                switch(lhlCode)
+                {
+                case 0: case 1: default:   /* note : default is impossible, since lhlCode into [0..3] */
+                    /* 2 - 2 - 10 - 10 */
+                    singleStream = !lhlCode;
+                    lhSize = 3;
+                    litSize  = (lhc >> 4) & 0x3FF;
+                    litCSize = (lhc >> 14) & 0x3FF;
+                    break;
+                case 2:
+                    /* 2 - 2 - 14 - 14 */
+                    lhSize = 4;
+                    litSize  = (lhc >> 4) & 0x3FFF;
+                    litCSize = lhc >> 18;
+                    break;
+                case 3:
+                    /* 2 - 2 - 18 - 18 */
+                    lhSize = 5;
+                    litSize  = (lhc >> 4) & 0x3FFFF;
+                    litCSize = (lhc >> 22) + ((size_t)istart[4] << 10);
+                    break;
+                }
+                RETURN_ERROR_IF(litSize > ZSTD_BLOCKSIZE_MAX, corruption_detected, "");
+                RETURN_ERROR_IF(litCSize + lhSize > srcSize, corruption_detected, "");
+
+                /* prefetch huffman table if cold */
+                if (dctx->ddictIsCold && (litSize > 768 /* heuristic */)) {
+                    PREFETCH_AREA(dctx->HUFptr, sizeof(dctx->entropy.hufTable));
+                }
+
+                if (litEncType==set_repeat) {
+                    if (singleStream) {
+                        hufSuccess = HUF_decompress1X_usingDTable_bmi2(
+                            dctx->litBuffer, litSize, istart+lhSize, litCSize,
+                            dctx->HUFptr, dctx->bmi2);
+                    } else {
+                        hufSuccess = HUF_decompress4X_usingDTable_bmi2(
+                            dctx->litBuffer, litSize, istart+lhSize, litCSize,
+                            dctx->HUFptr, dctx->bmi2);
+                    }
+                } else {
+                    if (singleStream) {
+#if defined(HUF_FORCE_DECOMPRESS_X2)
+                        hufSuccess = HUF_decompress1X_DCtx_wksp(
+                            dctx->entropy.hufTable, dctx->litBuffer, litSize,
+                            istart+lhSize, litCSize, dctx->workspace,
+                            sizeof(dctx->workspace));
+#else
+                        hufSuccess = HUF_decompress1X1_DCtx_wksp_bmi2(
+                            dctx->entropy.hufTable, dctx->litBuffer, litSize,
+                            istart+lhSize, litCSize, dctx->workspace,
+                            sizeof(dctx->workspace), dctx->bmi2);
+#endif
+                    } else {
+                        hufSuccess = HUF_decompress4X_hufOnly_wksp_bmi2(
+                            dctx->entropy.hufTable, dctx->litBuffer, litSize,
+                            istart+lhSize, litCSize, dctx->workspace,
+                            sizeof(dctx->workspace), dctx->bmi2);
+                    }
+                }
+
+                RETURN_ERROR_IF(HUF_isError(hufSuccess), corruption_detected, "");
+
+                dctx->litPtr = dctx->litBuffer;
+                dctx->litSize = litSize;
+                dctx->litEntropy = 1;
+                if (litEncType==set_compressed) dctx->HUFptr = dctx->entropy.hufTable;
+                memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
+                return litCSize + lhSize;
+            }
+
+        case set_basic:
+            {   size_t litSize, lhSize;
+                U32 const lhlCode = ((istart[0]) >> 2) & 3;
+                switch(lhlCode)
+                {
+                case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
+                    lhSize = 1;
+                    litSize = istart[0] >> 3;
+                    break;
+                case 1:
+                    lhSize = 2;
+                    litSize = MEM_readLE16(istart) >> 4;
+                    break;
+                case 3:
+                    lhSize = 3;
+                    litSize = MEM_readLE24(istart) >> 4;
+                    break;
+                }
+
+                if (lhSize+litSize+WILDCOPY_OVERLENGTH > srcSize) {  /* risk reading beyond src buffer with wildcopy */
+                    RETURN_ERROR_IF(litSize+lhSize > srcSize, corruption_detected, "");
+                    memcpy(dctx->litBuffer, istart+lhSize, litSize);
+                    dctx->litPtr = dctx->litBuffer;
+                    dctx->litSize = litSize;
+                    memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
+                    return lhSize+litSize;
+                }
+                /* direct reference into compressed stream */
+                dctx->litPtr = istart+lhSize;
+                dctx->litSize = litSize;
+                return lhSize+litSize;
+            }
+
+        case set_rle:
+            {   U32 const lhlCode = ((istart[0]) >> 2) & 3;
+                size_t litSize, lhSize;
+                switch(lhlCode)
+                {
+                case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
+                    lhSize = 1;
+                    litSize = istart[0] >> 3;
+                    break;
+                case 1:
+                    lhSize = 2;
+                    litSize = MEM_readLE16(istart) >> 4;
+                    break;
+                case 3:
+                    lhSize = 3;
+                    litSize = MEM_readLE24(istart) >> 4;
+                    RETURN_ERROR_IF(srcSize<4, corruption_detected, "srcSize >= MIN_CBLOCK_SIZE == 3; here we need lhSize+1 = 4");
+                    break;
+                }
+                RETURN_ERROR_IF(litSize > ZSTD_BLOCKSIZE_MAX, corruption_detected, "");
+                memset(dctx->litBuffer, istart[lhSize], litSize + WILDCOPY_OVERLENGTH);
+                dctx->litPtr = dctx->litBuffer;
+                dctx->litSize = litSize;
+                return lhSize+1;
+            }
+        default:
+            RETURN_ERROR(corruption_detected, "impossible");
+        }
+    }
+}
+
+/* Default FSE distribution tables.
+ * These are pre-calculated FSE decoding tables using default distributions as defined in specification :
+ * https://github.com/facebook/zstd/blob/master/doc/zstd_compression_format.md#default-distributions
+ * They were generated programmatically with following method :
+ * - start from default distributions, present in /lib/common/zstd_internal.h
+ * - generate tables normally, using ZSTD_buildFSETable()
+ * - printout the content of tables
+ * - pretify output, report below, test with fuzzer to ensure it's correct */
+
+/* Default FSE distribution table for Literal Lengths */
+static const ZSTD_seqSymbol LL_defaultDTable[(1<<LL_DEFAULTNORMLOG)+1] = {
+     {  1,  1,  1, LL_DEFAULTNORMLOG},  /* header : fastMode, tableLog */
+     /* nextState, nbAddBits, nbBits, baseVal */
+     {  0,  0,  4,    0},  { 16,  0,  4,    0},
+     { 32,  0,  5,    1},  {  0,  0,  5,    3},
+     {  0,  0,  5,    4},  {  0,  0,  5,    6},
+     {  0,  0,  5,    7},  {  0,  0,  5,    9},
+     {  0,  0,  5,   10},  {  0,  0,  5,   12},
+     {  0,  0,  6,   14},  {  0,  1,  5,   16},
+     {  0,  1,  5,   20},  {  0,  1,  5,   22},
+     {  0,  2,  5,   28},  {  0,  3,  5,   32},
+     {  0,  4,  5,   48},  { 32,  6,  5,   64},
+     {  0,  7,  5,  128},  {  0,  8,  6,  256},
+     {  0, 10,  6, 1024},  {  0, 12,  6, 4096},
+     { 32,  0,  4,    0},  {  0,  0,  4,    1},
+     {  0,  0,  5,    2},  { 32,  0,  5,    4},
+     {  0,  0,  5,    5},  { 32,  0,  5,    7},
+     {  0,  0,  5,    8},  { 32,  0,  5,   10},
+     {  0,  0,  5,   11},  {  0,  0,  6,   13},
+     { 32,  1,  5,   16},  {  0,  1,  5,   18},
+     { 32,  1,  5,   22},  {  0,  2,  5,   24},
+     { 32,  3,  5,   32},  {  0,  3,  5,   40},
+     {  0,  6,  4,   64},  { 16,  6,  4,   64},
+     { 32,  7,  5,  128},  {  0,  9,  6,  512},
+     {  0, 11,  6, 2048},  { 48,  0,  4,    0},
+     { 16,  0,  4,    1},  { 32,  0,  5,    2},
+     { 32,  0,  5,    3},  { 32,  0,  5,    5},
+     { 32,  0,  5,    6},  { 32,  0,  5,    8},
+     { 32,  0,  5,    9},  { 32,  0,  5,   11},
+     { 32,  0,  5,   12},  {  0,  0,  6,   15},
+     { 32,  1,  5,   18},  { 32,  1,  5,   20},
+     { 32,  2,  5,   24},  { 32,  2,  5,   28},
+     { 32,  3,  5,   40},  { 32,  4,  5,   48},
+     {  0, 16,  6,65536},  {  0, 15,  6,32768},
+     {  0, 14,  6,16384},  {  0, 13,  6, 8192},
+};   /* LL_defaultDTable */
+
+/* Default FSE distribution table for Offset Codes */
+static const ZSTD_seqSymbol OF_defaultDTable[(1<<OF_DEFAULTNORMLOG)+1] = {
+    {  1,  1,  1, OF_DEFAULTNORMLOG},  /* header : fastMode, tableLog */
+    /* nextState, nbAddBits, nbBits, baseVal */
+    {  0,  0,  5,    0},     {  0,  6,  4,   61},
+    {  0,  9,  5,  509},     {  0, 15,  5,32765},
+    {  0, 21,  5,2097149},   {  0,  3,  5,    5},
+    {  0,  7,  4,  125},     {  0, 12,  5, 4093},
+    {  0, 18,  5,262141},    {  0, 23,  5,8388605},
+    {  0,  5,  5,   29},     {  0,  8,  4,  253},
+    {  0, 14,  5,16381},     {  0, 20,  5,1048573},
+    {  0,  2,  5,    1},     { 16,  7,  4,  125},
+    {  0, 11,  5, 2045},     {  0, 17,  5,131069},
+    {  0, 22,  5,4194301},   {  0,  4,  5,   13},
+    { 16,  8,  4,  253},     {  0, 13,  5, 8189},
+    {  0, 19,  5,524285},    {  0,  1,  5,    1},
+    { 16,  6,  4,   61},     {  0, 10,  5, 1021},
+    {  0, 16,  5,65533},     {  0, 28,  5,268435453},
+    {  0, 27,  5,134217725}, {  0, 26,  5,67108861},
+    {  0, 25,  5,33554429},  {  0, 24,  5,16777213},
+};   /* OF_defaultDTable */
+
+
+/* Default FSE distribution table for Match Lengths */
+static const ZSTD_seqSymbol ML_defaultDTable[(1<<ML_DEFAULTNORMLOG)+1] = {
+    {  1,  1,  1, ML_DEFAULTNORMLOG},  /* header : fastMode, tableLog */
+    /* nextState, nbAddBits, nbBits, baseVal */
+    {  0,  0,  6,    3},  {  0,  0,  4,    4},
+    { 32,  0,  5,    5},  {  0,  0,  5,    6},
+    {  0,  0,  5,    8},  {  0,  0,  5,    9},
+    {  0,  0,  5,   11},  {  0,  0,  6,   13},
+    {  0,  0,  6,   16},  {  0,  0,  6,   19},
+    {  0,  0,  6,   22},  {  0,  0,  6,   25},
+    {  0,  0,  6,   28},  {  0,  0,  6,   31},
+    {  0,  0,  6,   34},  {  0,  1,  6,   37},
+    {  0,  1,  6,   41},  {  0,  2,  6,   47},
+    {  0,  3,  6,   59},  {  0,  4,  6,   83},
+    {  0,  7,  6,  131},  {  0,  9,  6,  515},
+    { 16,  0,  4,    4},  {  0,  0,  4,    5},
+    { 32,  0,  5,    6},  {  0,  0,  5,    7},
+    { 32,  0,  5,    9},  {  0,  0,  5,   10},
+    {  0,  0,  6,   12},  {  0,  0,  6,   15},
+    {  0,  0,  6,   18},  {  0,  0,  6,   21},
+    {  0,  0,  6,   24},  {  0,  0,  6,   27},
+    {  0,  0,  6,   30},  {  0,  0,  6,   33},
+    {  0,  1,  6,   35},  {  0,  1,  6,   39},
+    {  0,  2,  6,   43},  {  0,  3,  6,   51},
+    {  0,  4,  6,   67},  {  0,  5,  6,   99},
+    {  0,  8,  6,  259},  { 32,  0,  4,    4},
+    { 48,  0,  4,    4},  { 16,  0,  4,    5},
+    { 32,  0,  5,    7},  { 32,  0,  5,    8},
+    { 32,  0,  5,   10},  { 32,  0,  5,   11},
+    {  0,  0,  6,   14},  {  0,  0,  6,   17},
+    {  0,  0,  6,   20},  {  0,  0,  6,   23},
+    {  0,  0,  6,   26},  {  0,  0,  6,   29},
+    {  0,  0,  6,   32},  {  0, 16,  6,65539},
+    {  0, 15,  6,32771},  {  0, 14,  6,16387},
+    {  0, 13,  6, 8195},  {  0, 12,  6, 4099},
+    {  0, 11,  6, 2051},  {  0, 10,  6, 1027},
+};   /* ML_defaultDTable */
+
+
+static void ZSTD_buildSeqTable_rle(ZSTD_seqSymbol* dt, U32 baseValue, U32 nbAddBits)
+{
+    void* ptr = dt;
+    ZSTD_seqSymbol_header* const DTableH = (ZSTD_seqSymbol_header*)ptr;
+    ZSTD_seqSymbol* const cell = dt + 1;
+
+    DTableH->tableLog = 0;
+    DTableH->fastMode = 0;
+
+    cell->nbBits = 0;
+    cell->nextState = 0;
+    assert(nbAddBits < 255);
+    cell->nbAdditionalBits = (BYTE)nbAddBits;
+    cell->baseValue = baseValue;
+}
+
+
+/* ZSTD_buildFSETable() :
+ * generate FSE decoding table for one symbol (ll, ml or off)
+ * cannot fail if input is valid =>
+ * all inputs are presumed validated at this stage */
+void
+ZSTD_buildFSETable(ZSTD_seqSymbol* dt,
+            const short* normalizedCounter, unsigned maxSymbolValue,
+            const U32* baseValue, const U32* nbAdditionalBits,
+            unsigned tableLog)
+{
+    ZSTD_seqSymbol* const tableDecode = dt+1;
+    U16 symbolNext[MaxSeq+1];
+
+    U32 const maxSV1 = maxSymbolValue + 1;
+    U32 const tableSize = 1 << tableLog;
+    U32 highThreshold = tableSize-1;
+
+    /* Sanity Checks */
+    assert(maxSymbolValue <= MaxSeq);
+    assert(tableLog <= MaxFSELog);
+
+    /* Init, lay down lowprob symbols */
+    {   ZSTD_seqSymbol_header DTableH;
+        DTableH.tableLog = tableLog;
+        DTableH.fastMode = 1;
+        {   S16 const largeLimit= (S16)(1 << (tableLog-1));
+            U32 s;
+            for (s=0; s<maxSV1; s++) {
+                if (normalizedCounter[s]==-1) {
+                    tableDecode[highThreshold--].baseValue = s;
+                    symbolNext[s] = 1;
+                } else {
+                    if (normalizedCounter[s] >= largeLimit) DTableH.fastMode=0;
+                    assert(normalizedCounter[s]>=0);
+                    symbolNext[s] = (U16)normalizedCounter[s];
+        }   }   }
+        memcpy(dt, &DTableH, sizeof(DTableH));
+    }
+
+    /* Spread symbols */
+    {   U32 const tableMask = tableSize-1;
+        U32 const step = FSE_TABLESTEP(tableSize);
+        U32 s, position = 0;
+        for (s=0; s<maxSV1; s++) {
+            int i;
+            for (i=0; i<normalizedCounter[s]; i++) {
+                tableDecode[position].baseValue = s;
+                position = (position + step) & tableMask;
+                while (position > highThreshold) position = (position + step) & tableMask;   /* lowprob area */
+        }   }
+        assert(position == 0); /* position must reach all cells once, otherwise normalizedCounter is incorrect */
+    }
+
+    /* Build Decoding table */
+    {   U32 u;
+        for (u=0; u<tableSize; u++) {
+            U32 const symbol = tableDecode[u].baseValue;
+            U32 const nextState = symbolNext[symbol]++;
+            tableDecode[u].nbBits = (BYTE) (tableLog - BIT_highbit32(nextState) );
+            tableDecode[u].nextState = (U16) ( (nextState << tableDecode[u].nbBits) - tableSize);
+            assert(nbAdditionalBits[symbol] < 255);
+            tableDecode[u].nbAdditionalBits = (BYTE)nbAdditionalBits[symbol];
+            tableDecode[u].baseValue = baseValue[symbol];
+    }   }
+}
+
+
+/*! ZSTD_buildSeqTable() :
+ * @return : nb bytes read from src,
+ *           or an error code if it fails */
+static size_t ZSTD_buildSeqTable(ZSTD_seqSymbol* DTableSpace, const ZSTD_seqSymbol** DTablePtr,
+                                 symbolEncodingType_e type, unsigned max, U32 maxLog,
+                                 const void* src, size_t srcSize,
+                                 const U32* baseValue, const U32* nbAdditionalBits,
+                                 const ZSTD_seqSymbol* defaultTable, U32 flagRepeatTable,
+                                 int ddictIsCold, int nbSeq)
+{
+    switch(type)
+    {
+    case set_rle :
+        RETURN_ERROR_IF(!srcSize, srcSize_wrong, "");
+        RETURN_ERROR_IF((*(const BYTE*)src) > max, corruption_detected, "");
+        {   U32 const symbol = *(const BYTE*)src;
+            U32 const baseline = baseValue[symbol];
+            U32 const nbBits = nbAdditionalBits[symbol];
+            ZSTD_buildSeqTable_rle(DTableSpace, baseline, nbBits);
+        }
+        *DTablePtr = DTableSpace;
+        return 1;
+    case set_basic :
+        *DTablePtr = defaultTable;
+        return 0;
+    case set_repeat:
+        RETURN_ERROR_IF(!flagRepeatTable, corruption_detected, "");
+        /* prefetch FSE table if used */
+        if (ddictIsCold && (nbSeq > 24 /* heuristic */)) {
+            const void* const pStart = *DTablePtr;
+            size_t const pSize = sizeof(ZSTD_seqSymbol) * (SEQSYMBOL_TABLE_SIZE(maxLog));
+            PREFETCH_AREA(pStart, pSize);
+        }
+        return 0;
+    case set_compressed :
+        {   unsigned tableLog;
+            S16 norm[MaxSeq+1];
+            size_t const headerSize = FSE_readNCount(norm, &max, &tableLog, src, srcSize);
+            RETURN_ERROR_IF(FSE_isError(headerSize), corruption_detected, "");
+            RETURN_ERROR_IF(tableLog > maxLog, corruption_detected, "");
+            ZSTD_buildFSETable(DTableSpace, norm, max, baseValue, nbAdditionalBits, tableLog);
+            *DTablePtr = DTableSpace;
+            return headerSize;
+        }
+    default :
+        assert(0);
+        RETURN_ERROR(GENERIC, "impossible");
+    }
+}
+
+size_t ZSTD_decodeSeqHeaders(ZSTD_DCtx* dctx, int* nbSeqPtr,
+                             const void* src, size_t srcSize)
+{
+    const BYTE* const istart = (const BYTE* const)src;
+    const BYTE* const iend = istart + srcSize;
+    const BYTE* ip = istart;
+    int nbSeq;
+    DEBUGLOG(5, "ZSTD_decodeSeqHeaders");
+
+    /* check */
+    RETURN_ERROR_IF(srcSize < MIN_SEQUENCES_SIZE, srcSize_wrong, "");
+
+    /* SeqHead */
+    nbSeq = *ip++;
+    if (!nbSeq) {
+        *nbSeqPtr=0;
+        RETURN_ERROR_IF(srcSize != 1, srcSize_wrong, "");
+        return 1;
+    }
+    if (nbSeq > 0x7F) {
+        if (nbSeq == 0xFF) {
+            RETURN_ERROR_IF(ip+2 > iend, srcSize_wrong, "");
+            nbSeq = MEM_readLE16(ip) + LONGNBSEQ, ip+=2;
+        } else {
+            RETURN_ERROR_IF(ip >= iend, srcSize_wrong, "");
+            nbSeq = ((nbSeq-0x80)<<8) + *ip++;
+        }
+    }
+    *nbSeqPtr = nbSeq;
+
+    /* FSE table descriptors */
+    RETURN_ERROR_IF(ip+1 > iend, srcSize_wrong, ""); /* minimum possible size: 1 byte for symbol encoding types */
+    {   symbolEncodingType_e const LLtype = (symbolEncodingType_e)(*ip >> 6);
+        symbolEncodingType_e const OFtype = (symbolEncodingType_e)((*ip >> 4) & 3);
+        symbolEncodingType_e const MLtype = (symbolEncodingType_e)((*ip >> 2) & 3);
+        ip++;
+
+        /* Build DTables */
+        {   size_t const llhSize = ZSTD_buildSeqTable(dctx->entropy.LLTable, &dctx->LLTptr,
+                                                      LLtype, MaxLL, LLFSELog,
+                                                      ip, iend-ip,
+                                                      ZSTDConstants::LL_base, ZSTDInternalConstants::LL_bits,
+                                                      LL_defaultDTable, dctx->fseEntropy,
+                                                      dctx->ddictIsCold, nbSeq);
+            RETURN_ERROR_IF(ZSTD_isError(llhSize), corruption_detected, "ZSTD_buildSeqTable failed");
+            ip += llhSize;
+        }
+
+        {   size_t const ofhSize = ZSTD_buildSeqTable(dctx->entropy.OFTable, &dctx->OFTptr,
+                                                      OFtype, MaxOff, OffFSELog,
+                                                      ip, iend-ip,
+                                                      ZSTDConstants::OF_base, ZSTDConstants::OF_bits,
+                                                      OF_defaultDTable, dctx->fseEntropy,
+                                                      dctx->ddictIsCold, nbSeq);
+            RETURN_ERROR_IF(ZSTD_isError(ofhSize), corruption_detected, "ZSTD_buildSeqTable failed");
+            ip += ofhSize;
+        }
+
+        {   size_t const mlhSize = ZSTD_buildSeqTable(dctx->entropy.MLTable, &dctx->MLTptr,
+                                                      MLtype, MaxML, MLFSELog,
+                                                      ip, iend-ip,
+                                                      ZSTDConstants::ML_base, ZSTDInternalConstants::ML_bits,
+                                                      ML_defaultDTable, dctx->fseEntropy,
+                                                      dctx->ddictIsCold, nbSeq);
+            RETURN_ERROR_IF(ZSTD_isError(mlhSize), corruption_detected, "ZSTD_buildSeqTable failed");
+            ip += mlhSize;
+        }
+    }
+
+    return ip-istart;
+}
+
+
+typedef struct {
+    size_t litLength;
+    size_t matchLength;
+    size_t offset;
+    const BYTE* match;
+} seq_t;
+
+typedef struct {
+    size_t state;
+    const ZSTD_seqSymbol* table;
+} ZSTD_fseState;
+
+typedef struct {
+    BIT_DStream_t DStream;
+    ZSTD_fseState stateLL;
+    ZSTD_fseState stateOffb;
+    ZSTD_fseState stateML;
+    size_t prevOffset[ZSTD_REP_NUM];
+    const BYTE* prefixStart;
+    const BYTE* dictEnd;
+    size_t pos;
+} seqState_t;
+
+/*! ZSTD_overlapCopy8() :
+ *  Copies 8 bytes from ip to op and updates op and ip where ip <= op.
+ *  If the offset is < 8 then the offset is spread to at least 8 bytes.
+ *
+ *  Precondition: *ip <= *op
+ *  Postcondition: *op - *op >= 8
+ */
+HINT_INLINE void ZSTD_overlapCopy8(BYTE** op, BYTE const** ip, size_t offset) {
+    assert(*ip <= *op);
+    if (offset < 8) {
+        /* close range match, overlap */
+        static const U32 dec32table[] = { 0, 1, 2, 1, 4, 4, 4, 4 };   /* added */
+        static const int dec64table[] = { 8, 8, 8, 7, 8, 9,10,11 };   /* subtracted */
+        int const sub2 = dec64table[offset];
+        (*op)[0] = (*ip)[0];
+        (*op)[1] = (*ip)[1];
+        (*op)[2] = (*ip)[2];
+        (*op)[3] = (*ip)[3];
+        *ip += dec32table[offset];
+        ZSTD_copy4(*op+4, *ip);
+        *ip -= sub2;
+    } else {
+        ZSTD_copy8(*op, *ip);
+    }
+    *ip += 8;
+    *op += 8;
+    assert(*op - *ip >= 8);
+}
+
+/*! ZSTD_safecopy() :
+ *  Specialized version of memcpy() that is allowed to READ up to WILDCOPY_OVERLENGTH past the input buffer
+ *  and write up to 16 bytes past oend_w (op >= oend_w is allowed).
+ *  This function is only called in the uncommon case where the sequence is near the end of the block. It
+ *  should be fast for a single long sequence, but can be slow for several short sequences.
+ *
+ *  @param ovtype controls the overlap detection
+ *         - ZSTD_no_overlap: The source and destination are guaranteed to be at least WILDCOPY_VECLEN bytes apart.
+ *         - ZSTD_overlap_src_before_dst: The src and dst may overlap and may be any distance apart.
+ *           The src buffer must be before the dst buffer.
+ */
+static void ZSTD_safecopy(BYTE* op, BYTE* const oend_w, BYTE const* ip, ptrdiff_t length, ZSTD_overlap_e ovtype) {
+    ptrdiff_t const diff = op - ip;
+    BYTE* const oend = op + length;
+
+    assert((ovtype == ZSTD_no_overlap && (diff <= -8 || diff >= 8 || op >= oend_w)) ||
+           (ovtype == ZSTD_overlap_src_before_dst && diff >= 0));
+
+    if (length < 8) {
+        /* Handle short lengths. */
+        while (op < oend) *op++ = *ip++;
+        return;
+    }
+    if (ovtype == ZSTD_overlap_src_before_dst) {
+        /* Copy 8 bytes and ensure the offset >= 8 when there can be overlap. */
+        assert(length >= 8);
+        ZSTD_overlapCopy8(&op, &ip, diff);
+        assert(op - ip >= 8);
+        assert(op <= oend);
+    }
+
+    if (oend <= oend_w) {
+        /* No risk of overwrite. */
+        ZSTD_wildcopy(op, ip, length, ovtype);
+        return;
+    }
+    if (op <= oend_w) {
+        /* Wildcopy until we get close to the end. */
+        assert(oend > oend_w);
+        ZSTD_wildcopy(op, ip, oend_w - op, ovtype);
+        ip += oend_w - op;
+        op = oend_w;
+    }
+    /* Handle the leftovers. */
+    while (op < oend) *op++ = *ip++;
+}
+
+/* ZSTD_execSequenceEnd():
+ * This version handles cases that are near the end of the output buffer. It requires
+ * more careful checks to make sure there is no overflow. By separating out these hard
+ * and unlikely cases, we can speed up the common cases.
+ *
+ * NOTE: This function needs to be fast for a single long sequence, but doesn't need
+ * to be optimized for many small sequences, since those fall into ZSTD_execSequence().
+ */
+FORCE_NOINLINE
+size_t ZSTD_execSequenceEnd(BYTE* op,
+                            BYTE* const oend, seq_t sequence,
+                            const BYTE** litPtr, const BYTE* const litLimit,
+                            const BYTE* const prefixStart, const BYTE* const virtualStart, const BYTE* const dictEnd)
+{
+    BYTE* const oLitEnd = op + sequence.litLength;
+    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
+    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
+    const BYTE* match = oLitEnd - sequence.offset;
+    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
+
+    /* bounds checks : careful of address space overflow in 32-bit mode */
+    RETURN_ERROR_IF(sequenceLength > (size_t)(oend - op), dstSize_tooSmall, "last match must fit within dstBuffer");
+    RETURN_ERROR_IF(sequence.litLength > (size_t)(litLimit - *litPtr), corruption_detected, "try to read beyond literal buffer");
+    assert(op < op + sequenceLength);
+    assert(oLitEnd < op + sequenceLength);
+
+    /* copy literals */
+    ZSTD_safecopy(op, oend_w, *litPtr, sequence.litLength, ZSTD_no_overlap);
+    op = oLitEnd;
+    *litPtr = iLitEnd;
+
+    /* copy Match */
+    if (sequence.offset > (size_t)(oLitEnd - prefixStart)) {
+        /* offset beyond prefix */
+        RETURN_ERROR_IF(sequence.offset > (size_t)(oLitEnd - virtualStart), corruption_detected, "");
+        match = dictEnd - (prefixStart-match);
+        if (match + sequence.matchLength <= dictEnd) {
+            memmove(oLitEnd, match, sequence.matchLength);
+            return sequenceLength;
+        }
+        /* span extDict & currentPrefixSegment */
+        {   size_t const length1 = dictEnd - match;
+            memmove(oLitEnd, match, length1);
+            op = oLitEnd + length1;
+            sequence.matchLength -= length1;
+            match = prefixStart;
+    }   }
+    ZSTD_safecopy(op, oend_w, match, sequence.matchLength, ZSTD_overlap_src_before_dst);
+    return sequenceLength;
+}
+
+HINT_INLINE
+size_t ZSTD_execSequence(BYTE* op,
+                         BYTE* const oend, seq_t sequence,
+                         const BYTE** litPtr, const BYTE* const litLimit,
+                         const BYTE* const prefixStart, const BYTE* const virtualStart, const BYTE* const dictEnd)
+{
+    BYTE* const oLitEnd = op + sequence.litLength;
+    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
+    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
+    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;   /* risk : address space underflow on oend=NULL */
+    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
+    const BYTE* match = oLitEnd - sequence.offset;
+
+    assert(op != NULL /* Precondition */);
+    assert(oend_w < oend /* No underflow */);
+    /* Handle edge cases in a slow path:
+     *   - Read beyond end of literals
+     *   - Match end is within WILDCOPY_OVERLIMIT of oend
+     *   - 32-bit mode and the match length overflows
+     */
+    if (UNLIKELY(
+            iLitEnd > litLimit ||
+            oMatchEnd > oend_w ||
+            (MEM_32bits() && (size_t)(oend - op) < sequenceLength + WILDCOPY_OVERLENGTH)))
+        return ZSTD_execSequenceEnd(op, oend, sequence, litPtr, litLimit, prefixStart, virtualStart, dictEnd);
+
+    /* Assumptions (everything else goes into ZSTD_execSequenceEnd()) */
+    assert(op <= oLitEnd /* No overflow */);
+    assert(oLitEnd < oMatchEnd /* Non-zero match & no overflow */);
+    assert(oMatchEnd <= oend /* No underflow */);
+    assert(iLitEnd <= litLimit /* Literal length is in bounds */);
+    assert(oLitEnd <= oend_w /* Can wildcopy literals */);
+    assert(oMatchEnd <= oend_w /* Can wildcopy matches */);
+
+    /* Copy Literals:
+     * Split out litLength <= 16 since it is nearly always true. +1.6% on gcc-9.
+     * We likely don't need the full 32-byte wildcopy.
+     */
+    assert(WILDCOPY_OVERLENGTH >= 16);
+    ZSTD_copy16(op, (*litPtr));
+    if (UNLIKELY(sequence.litLength > 16)) {
+        ZSTD_wildcopy(op+16, (*litPtr)+16, sequence.litLength-16, ZSTD_no_overlap);
+    }
+    op = oLitEnd;
+    *litPtr = iLitEnd;   /* update for next sequence */
+
+    /* Copy Match */
+    if (sequence.offset > (size_t)(oLitEnd - prefixStart)) {
+        /* offset beyond prefix -> go into extDict */
+        RETURN_ERROR_IF(UNLIKELY(sequence.offset > (size_t)(oLitEnd - virtualStart)), corruption_detected, "");
+        match = dictEnd + (match - prefixStart);
+        if (match + sequence.matchLength <= dictEnd) {
+            memmove(oLitEnd, match, sequence.matchLength);
+            return sequenceLength;
+        }
+        /* span extDict & currentPrefixSegment */
+        {   size_t const length1 = dictEnd - match;
+            memmove(oLitEnd, match, length1);
+            op = oLitEnd + length1;
+            sequence.matchLength -= length1;
+            match = prefixStart;
+    }   }
+    /* Match within prefix of 1 or more bytes */
+    assert(op <= oMatchEnd);
+    assert(oMatchEnd <= oend_w);
+    assert(match >= prefixStart);
+    assert(sequence.matchLength >= 1);
+
+    /* Nearly all offsets are >= WILDCOPY_VECLEN bytes, which means we can use wildcopy
+     * without overlap checking.
+     */
+    if (LIKELY(sequence.offset >= WILDCOPY_VECLEN)) {
+        /* We bet on a full wildcopy for matches, since we expect matches to be
+         * longer than literals (in general). In silesia, ~10% of matches are longer
+         * than 16 bytes.
+         */
+        ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength, ZSTD_no_overlap);
+        return sequenceLength;
+    }
+    assert(sequence.offset < WILDCOPY_VECLEN);
+
+    /* Copy 8 bytes and spread the offset to be >= 8. */
+    ZSTD_overlapCopy8(&op, &match, sequence.offset);
+
+    /* If the match length is > 8 bytes, then continue with the wildcopy. */
+    if (sequence.matchLength > 8) {
+        assert(op < oMatchEnd);
+        ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8, ZSTD_overlap_src_before_dst);
+    }
+    return sequenceLength;
+}
+
+static void
+ZSTD_initFseState(ZSTD_fseState* DStatePtr, BIT_DStream_t* bitD, const ZSTD_seqSymbol* dt)
+{
+    const void* ptr = dt;
+    const ZSTD_seqSymbol_header* const DTableH = (const ZSTD_seqSymbol_header*)ptr;
+    DStatePtr->state = BIT_readBits(bitD, DTableH->tableLog);
+    DEBUGLOG(6, "ZSTD_initFseState : val=%u using %u bits",
+                (U32)DStatePtr->state, DTableH->tableLog);
+    BIT_reloadDStream(bitD);
+    DStatePtr->table = dt + 1;
+}
+
+FORCE_INLINE_TEMPLATE void
+ZSTD_updateFseState(ZSTD_fseState* DStatePtr, BIT_DStream_t* bitD)
+{
+    ZSTD_seqSymbol const DInfo = DStatePtr->table[DStatePtr->state];
+    U32 const nbBits = DInfo.nbBits;
+    size_t const lowBits = BIT_readBits(bitD, nbBits);
+    DStatePtr->state = DInfo.nextState + lowBits;
+}
+
+FORCE_INLINE_TEMPLATE void
+ZSTD_updateFseStateWithDInfo(ZSTD_fseState* DStatePtr, BIT_DStream_t* bitD, ZSTD_seqSymbol const DInfo)
+{
+    U32 const nbBits = DInfo.nbBits;
+    size_t const lowBits = BIT_readBits(bitD, nbBits);
+    DStatePtr->state = DInfo.nextState + lowBits;
+}
+
+/* We need to add at most (ZSTD_WINDOWLOG_MAX_32 - 1) bits to read the maximum
+ * offset bits. But we can only read at most (STREAM_ACCUMULATOR_MIN_32 - 1)
+ * bits before reloading. This value is the maximum number of bytes we read
+ * after reloading when we are decoding long offsets.
+ */
+#define LONG_OFFSETS_MAX_EXTRA_BITS_32                       \
+    (ZSTD_WINDOWLOG_MAX_32 > STREAM_ACCUMULATOR_MIN_32       \
+        ? ZSTD_WINDOWLOG_MAX_32 - STREAM_ACCUMULATOR_MIN_32  \
+        : 0)
+
+typedef enum { ZSTD_lo_isRegularOffset, ZSTD_lo_isLongOffset=1 } ZSTD_longOffset_e;
+typedef enum { ZSTD_p_noPrefetch=0, ZSTD_p_prefetch=1 } ZSTD_prefetch_e;
+
+FORCE_INLINE_TEMPLATE seq_t
+ZSTD_decodeSequence(seqState_t* seqState, const ZSTD_longOffset_e longOffsets, const ZSTD_prefetch_e prefetch)
+{
+    seq_t seq;
+    ZSTD_seqSymbol const llDInfo = seqState->stateLL.table[seqState->stateLL.state];
+    ZSTD_seqSymbol const mlDInfo = seqState->stateML.table[seqState->stateML.state];
+    ZSTD_seqSymbol const ofDInfo = seqState->stateOffb.table[seqState->stateOffb.state];
+    U32 const llBase = llDInfo.baseValue;
+    U32 const mlBase = mlDInfo.baseValue;
+    U32 const ofBase = ofDInfo.baseValue;
+    BYTE const llBits = llDInfo.nbAdditionalBits;
+    BYTE const mlBits = mlDInfo.nbAdditionalBits;
+    BYTE const ofBits = ofDInfo.nbAdditionalBits;
+    BYTE const totalBits = llBits+mlBits+ofBits;
+
+    /* sequence */
+    {   size_t offset;
+        if (ofBits > 1) {
+            ZSTD_STATIC_ASSERT(ZSTD_lo_isLongOffset == 1);
+            ZSTD_STATIC_ASSERT(LONG_OFFSETS_MAX_EXTRA_BITS_32 == 5);
+            assert(ofBits <= MaxOff);
+            if (MEM_32bits() && longOffsets && (ofBits >= STREAM_ACCUMULATOR_MIN_32)) {
+                U32 const extraBits = ofBits - MIN(ofBits, 32 - seqState->DStream.bitsConsumed);
+                offset = ofBase + (BIT_readBitsFast(&seqState->DStream, ofBits - extraBits) << extraBits);
+                BIT_reloadDStream(&seqState->DStream);
+                if (extraBits) offset += BIT_readBitsFast(&seqState->DStream, extraBits);
+                assert(extraBits <= LONG_OFFSETS_MAX_EXTRA_BITS_32);   /* to avoid another reload */
+            } else {
+                offset = ofBase + BIT_readBitsFast(&seqState->DStream, ofBits/*>0*/);   /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
+                if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);
+            }
+            seqState->prevOffset[2] = seqState->prevOffset[1];
+            seqState->prevOffset[1] = seqState->prevOffset[0];
+            seqState->prevOffset[0] = offset;
+        } else {
+            U32 const ll0 = (llBase == 0);
+            if (LIKELY((ofBits == 0))) {
+                if (LIKELY(!ll0))
+                    offset = seqState->prevOffset[0];
+                else {
+                    offset = seqState->prevOffset[1];
+                    seqState->prevOffset[1] = seqState->prevOffset[0];
+                    seqState->prevOffset[0] = offset;
+                }
+            } else {
+                offset = ofBase + ll0 + BIT_readBitsFast(&seqState->DStream, 1);
+                {   size_t temp = (offset==3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
+                    temp += !temp;   /* 0 is not valid; input is corrupted; force offset to 1 */
+                    if (offset != 1) seqState->prevOffset[2] = seqState->prevOffset[1];
+                    seqState->prevOffset[1] = seqState->prevOffset[0];
+                    seqState->prevOffset[0] = offset = temp;
+        }   }   }
+        seq.offset = offset;
+    }
+
+    seq.matchLength = mlBase;
+    if (mlBits > 0)
+        seq.matchLength += BIT_readBitsFast(&seqState->DStream, mlBits/*>0*/);
+
+    if (MEM_32bits() && (mlBits+llBits >= STREAM_ACCUMULATOR_MIN_32-LONG_OFFSETS_MAX_EXTRA_BITS_32))
+        BIT_reloadDStream(&seqState->DStream);
+    if (MEM_64bits() && UNLIKELY(totalBits >= STREAM_ACCUMULATOR_MIN_64-(LLFSELog+MLFSELog+OffFSELog)))
+        BIT_reloadDStream(&seqState->DStream);
+    /* Ensure there are enough bits to read the rest of data in 64-bit mode. */
+    ZSTD_STATIC_ASSERT(16+LLFSELog+MLFSELog+OffFSELog < STREAM_ACCUMULATOR_MIN_64);
+
+    seq.litLength = llBase;
+    if (llBits > 0)
+        seq.litLength += BIT_readBitsFast(&seqState->DStream, llBits/*>0*/);
+
+    if (MEM_32bits())
+        BIT_reloadDStream(&seqState->DStream);
+
+    DEBUGLOG(6, "seq: litL=%u, matchL=%u, offset=%u",
+                (U32)seq.litLength, (U32)seq.matchLength, (U32)seq.offset);
+
+    if (prefetch == ZSTD_p_prefetch) {
+        size_t const pos = seqState->pos + seq.litLength;
+        const BYTE* const matchBase = (seq.offset > pos) ? seqState->dictEnd : seqState->prefixStart;
+        seq.match = matchBase + pos - seq.offset;  /* note : this operation can overflow when seq.offset is really too large, which can only happen when input is corrupted.
+                                                    * No consequence though : no memory access will occur, offset is only used for prefetching */
+        seqState->pos = pos + seq.matchLength;
+    }
+
+    /* ANS state update
+     * gcc-9.0.0 does 2.5% worse with ZSTD_updateFseStateWithDInfo().
+     * clang-9.2.0 does 7% worse with ZSTD_updateFseState().
+     * Naturally it seems like ZSTD_updateFseStateWithDInfo() should be the
+     * better option, so it is the default for other compilers. But, if you
+     * measure that it is worse, please put up a pull request.
+     */
+    {
+#if defined(__GNUC__) && !defined(__clang__)
+        const int kUseUpdateFseState = 1;
+#else
+        const int kUseUpdateFseState = 0;
+#endif
+        if (kUseUpdateFseState) {
+            ZSTD_updateFseState(&seqState->stateLL, &seqState->DStream);    /* <=  9 bits */
+            ZSTD_updateFseState(&seqState->stateML, &seqState->DStream);    /* <=  9 bits */
+            if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
+            ZSTD_updateFseState(&seqState->stateOffb, &seqState->DStream);  /* <=  8 bits */
+        } else {
+            ZSTD_updateFseStateWithDInfo(&seqState->stateLL, &seqState->DStream, llDInfo);    /* <=  9 bits */
+            ZSTD_updateFseStateWithDInfo(&seqState->stateML, &seqState->DStream, mlDInfo);    /* <=  9 bits */
+            if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
+            ZSTD_updateFseStateWithDInfo(&seqState->stateOffb, &seqState->DStream, ofDInfo);  /* <=  8 bits */
+        }
+    }
+
+    return seq;
+}
+
+#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+static int ZSTD_dictionaryIsActive(ZSTD_DCtx const* dctx, BYTE const* prefixStart, BYTE const* oLitEnd)
+{
+    size_t const windowSize = dctx->fParams.windowSize;
+    /* No dictionary used. */
+    if (dctx->dictContentEndForFuzzing == NULL) return 0;
+    /* Dictionary is our prefix. */
+    if (prefixStart == dctx->dictContentBeginForFuzzing) return 1;
+    /* Dictionary is not our ext-dict. */
+    if (dctx->dictEnd != dctx->dictContentEndForFuzzing) return 0;
+    /* Dictionary is not within our window size. */
+    if ((size_t)(oLitEnd - prefixStart) >= windowSize) return 0;
+    /* Dictionary is active. */
+    return 1;
+}
+
+MEM_STATIC void ZSTD_assertValidSequence(
+        ZSTD_DCtx const* dctx,
+        BYTE const* op, BYTE const* oend,
+        seq_t const seq,
+        BYTE const* prefixStart, BYTE const* virtualStart)
+{
+    size_t const windowSize = dctx->fParams.windowSize;
+    size_t const sequenceSize = seq.litLength + seq.matchLength;
+    BYTE const* const oLitEnd = op + seq.litLength;
+    DEBUGLOG(6, "Checking sequence: litL=%u matchL=%u offset=%u",
+            (U32)seq.litLength, (U32)seq.matchLength, (U32)seq.offset);
+    assert(op <= oend);
+    assert((size_t)(oend - op) >= sequenceSize);
+    assert(sequenceSize <= ZSTD_BLOCKSIZE_MAX);
+    if (ZSTD_dictionaryIsActive(dctx, prefixStart, oLitEnd)) {
+        size_t const dictSize = (size_t)((char const*)dctx->dictContentEndForFuzzing - (char const*)dctx->dictContentBeginForFuzzing);
+        /* Offset must be within the dictionary. */
+        assert(seq.offset <= (size_t)(oLitEnd - virtualStart));
+        assert(seq.offset <= windowSize + dictSize);
+    } else {
+        /* Offset must be within our window. */
+        assert(seq.offset <= windowSize);
+    }
+}
+#endif
+
+#ifndef ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG
+FORCE_INLINE_TEMPLATE size_t
+DONT_VECTORIZE
+ZSTD_decompressSequences_body( ZSTD_DCtx* dctx,
+                               void* dst, size_t maxDstSize,
+                         const void* seqStart, size_t seqSize, int nbSeq,
+                         const ZSTD_longOffset_e isLongOffset,
+                         const int frame)
+{
+    const BYTE* ip = (const BYTE*)seqStart;
+    const BYTE* const iend = ip + seqSize;
+    BYTE* const ostart = (BYTE* const)dst;
+    BYTE* const oend = ostart + maxDstSize;
+    BYTE* op = ostart;
+    const BYTE* litPtr = dctx->litPtr;
+    const BYTE* const litEnd = litPtr + dctx->litSize;
+    const BYTE* const prefixStart = (const BYTE*) (dctx->prefixStart);
+    const BYTE* const vBase = (const BYTE*) (dctx->virtualStart);
+    const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
+    DEBUGLOG(5, "ZSTD_decompressSequences_body");
+    (void)frame;
+
+    /* Regen sequences */
+    if (nbSeq) {
+        seqState_t seqState;
+        size_t error = 0;
+        dctx->fseEntropy = 1;
+        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) seqState.prevOffset[i] = dctx->entropy.rep[i]; }
+        RETURN_ERROR_IF(
+            ERR_isError(BIT_initDStream(&seqState.DStream, ip, iend-ip)),
+            corruption_detected, "");
+        ZSTD_initFseState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
+        ZSTD_initFseState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
+        ZSTD_initFseState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
+        assert(dst != NULL);
+
+        ZSTD_STATIC_ASSERT(
+                BIT_DStream_unfinished < BIT_DStream_completed &&
+                BIT_DStream_endOfBuffer < BIT_DStream_completed &&
+                BIT_DStream_completed < BIT_DStream_overflow);
+
+#if defined(__GNUC__) && defined(__x86_64__)
+        /* Align the decompression loop to 32 + 16 bytes.
+         *
+         * zstd compiled with gcc-9 on an Intel i9-9900k shows 10% decompression
+         * speed swings based on the alignment of the decompression loop. This
+         * performance swing is caused by parts of the decompression loop falling
+         * out of the DSB. The entire decompression loop should fit in the DSB,
+         * when it can't we get much worse performance. You can measure if you've
+         * hit the good case or the bad case with this perf command for some
+         * compressed file test.zst:
+         *
+         *   perf stat -e cycles -e instructions -e idq.all_dsb_cycles_any_uops \
+         *             -e idq.all_mite_cycles_any_uops -- ./zstd -tq test.zst
+         *
+         * If you see most cycles served out of the MITE you've hit the bad case.
+         * If you see most cycles served out of the DSB you've hit the good case.
+         * If it is pretty even then you may be in an okay case.
+         *
+         * I've been able to reproduce this issue on the following CPUs:
+         *   - Kabylake: Macbook Pro (15-inch, 2019) 2.4 GHz Intel Core i9
+         *               Use Instruments->Counters to get DSB/MITE cycles.
+         *               I never got performance swings, but I was able to
+         *               go from the good case of mostly DSB to half of the
+         *               cycles served from MITE.
+         *   - Coffeelake: Intel i9-9900k
+         *
+         * I haven't been able to reproduce the instability or DSB misses on any
+         * of the following CPUS:
+         *   - Haswell
+         *   - Broadwell: Intel(R) Xeon(R) CPU E5-2680 v4 @ 2.40GH
+         *   - Skylake
+         *
+         * If you are seeing performance stability this script can help test.
+         * It tests on 4 commits in zstd where I saw performance change.
+         *
+         *   https://gist.github.com/terrelln/9889fc06a423fd5ca6e99351564473f4
+         */
+        __asm__(".p2align 5");
+        __asm__("nop");
+        __asm__(".p2align 4");
+#endif
+        for ( ; ; ) {
+            seq_t const sequence = ZSTD_decodeSequence(&seqState, isLongOffset, ZSTD_p_noPrefetch);
+            size_t const oneSeqSize = ZSTD_execSequence(op, oend, sequence, &litPtr, litEnd, prefixStart, vBase, dictEnd);
+#if defined(FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION) && defined(FUZZING_ASSERT_VALID_SEQUENCE)
+            assert(!ZSTD_isError(oneSeqSize));
+            if (frame) ZSTD_assertValidSequence(dctx, op, oend, sequence, prefixStart, vBase);
+#endif
+            DEBUGLOG(6, "regenerated sequence size : %u", (U32)oneSeqSize);
+            BIT_reloadDStream(&(seqState.DStream));
+            /* gcc and clang both don't like early returns in this loop.
+             * gcc doesn't like early breaks either.
+             * Instead save an error and report it at the end.
+             * When there is an error, don't increment op, so we don't
+             * overwrite.
+             */
+            if (UNLIKELY(ZSTD_isError(oneSeqSize))) error = oneSeqSize;
+            else op += oneSeqSize;
+            if (UNLIKELY(!--nbSeq)) break;
+        }
+
+        /* check if reached exact end */
+        DEBUGLOG(5, "ZSTD_decompressSequences_body: after decode loop, remaining nbSeq : %i", nbSeq);
+        if (ZSTD_isError(error)) return error;
+        RETURN_ERROR_IF(nbSeq, corruption_detected, "");
+        RETURN_ERROR_IF(BIT_reloadDStream(&seqState.DStream) < BIT_DStream_completed, corruption_detected, "");
+        /* save reps for next block */
+        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]); }
+    }
+
+    /* last literal segment */
+    {   size_t const lastLLSize = litEnd - litPtr;
+        RETURN_ERROR_IF(lastLLSize > (size_t)(oend-op), dstSize_tooSmall, "");
+        if (op != NULL) {
+            memcpy(op, litPtr, lastLLSize);
+            op += lastLLSize;
+        }
+    }
+
+    return op-ostart;
+}
+
+static size_t
+ZSTD_decompressSequences_default(ZSTD_DCtx* dctx,
+                                 void* dst, size_t maxDstSize,
+                           const void* seqStart, size_t seqSize, int nbSeq,
+                           const ZSTD_longOffset_e isLongOffset,
+                           const int frame)
+{
+    return ZSTD_decompressSequences_body(dctx, dst, maxDstSize, seqStart, seqSize, nbSeq, isLongOffset, frame);
+}
+#endif /* ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG */
+
+#ifndef ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT
+FORCE_INLINE_TEMPLATE size_t
+ZSTD_decompressSequencesLong_body(
+                               ZSTD_DCtx* dctx,
+                               void* dst, size_t maxDstSize,
+                         const void* seqStart, size_t seqSize, int nbSeq,
+                         const ZSTD_longOffset_e isLongOffset,
+                         const int frame)
+{
+    const BYTE* ip = (const BYTE*)seqStart;
+    const BYTE* const iend = ip + seqSize;
+    BYTE* const ostart = (BYTE* const)dst;
+    BYTE* const oend = ostart + maxDstSize;
+    BYTE* op = ostart;
+    const BYTE* litPtr = dctx->litPtr;
+    const BYTE* const litEnd = litPtr + dctx->litSize;
+    const BYTE* const prefixStart = (const BYTE*) (dctx->prefixStart);
+    const BYTE* const dictStart = (const BYTE*) (dctx->virtualStart);
+    const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
+    (void)frame;
+
+    /* Regen sequences */
+    if (nbSeq) {
+#define STORED_SEQS 4
+#define STORED_SEQS_MASK (STORED_SEQS-1)
+#define ADVANCED_SEQS 4
+        seq_t sequences[STORED_SEQS];
+        int const seqAdvance = MIN(nbSeq, ADVANCED_SEQS);
+        seqState_t seqState;
+        int seqNb;
+        dctx->fseEntropy = 1;
+        { int i; for (i=0; i<ZSTD_REP_NUM; i++) seqState.prevOffset[i] = dctx->entropy.rep[i]; }
+        seqState.prefixStart = prefixStart;
+        seqState.pos = (size_t)(op-prefixStart);
+        seqState.dictEnd = dictEnd;
+        assert(dst != NULL);
+        assert(iend >= ip);
+        RETURN_ERROR_IF(
+            ERR_isError(BIT_initDStream(&seqState.DStream, ip, iend-ip)),
+            corruption_detected, "");
+        ZSTD_initFseState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
+        ZSTD_initFseState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
+        ZSTD_initFseState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
+
+        /* prepare in advance */
+        for (seqNb=0; (BIT_reloadDStream(&seqState.DStream) <= BIT_DStream_completed) && (seqNb<seqAdvance); seqNb++) {
+            sequences[seqNb] = ZSTD_decodeSequence(&seqState, isLongOffset, ZSTD_p_prefetch);
+            PREFETCH_L1(sequences[seqNb].match); PREFETCH_L1(sequences[seqNb].match + sequences[seqNb].matchLength - 1); /* note : it's safe to invoke PREFETCH() on any memory address, including invalid ones */
+        }
+        RETURN_ERROR_IF(seqNb<seqAdvance, corruption_detected, "");
+
+        /* decode and decompress */
+        for ( ; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && (seqNb<nbSeq) ; seqNb++) {
+            seq_t const sequence = ZSTD_decodeSequence(&seqState, isLongOffset, ZSTD_p_prefetch);
+            size_t const oneSeqSize = ZSTD_execSequence(op, oend, sequences[(seqNb-ADVANCED_SEQS) & STORED_SEQS_MASK], &litPtr, litEnd, prefixStart, dictStart, dictEnd);
+#if defined(FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION) && defined(FUZZING_ASSERT_VALID_SEQUENCE)
+            assert(!ZSTD_isError(oneSeqSize));
+            if (frame) ZSTD_assertValidSequence(dctx, op, oend, sequences[(seqNb-ADVANCED_SEQS) & STORED_SEQS_MASK], prefixStart, dictStart);
+#endif
+            if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
+            PREFETCH_L1(sequence.match); PREFETCH_L1(sequence.match + sequence.matchLength - 1); /* note : it's safe to invoke PREFETCH() on any memory address, including invalid ones */
+            sequences[seqNb & STORED_SEQS_MASK] = sequence;
+            op += oneSeqSize;
+        }
+        RETURN_ERROR_IF(seqNb<nbSeq, corruption_detected, "");
+
+        /* finish queue */
+        seqNb -= seqAdvance;
+        for ( ; seqNb<nbSeq ; seqNb++) {
+            size_t const oneSeqSize = ZSTD_execSequence(op, oend, sequences[seqNb&STORED_SEQS_MASK], &litPtr, litEnd, prefixStart, dictStart, dictEnd);
+#if defined(FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION) && defined(FUZZING_ASSERT_VALID_SEQUENCE)
+            assert(!ZSTD_isError(oneSeqSize));
+            if (frame) ZSTD_assertValidSequence(dctx, op, oend, sequences[seqNb&STORED_SEQS_MASK], prefixStart, dictStart);
+#endif
+            if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
+            op += oneSeqSize;
+        }
+
+        /* save reps for next block */
+        { U32 i; for (i=0; i<ZSTD_REP_NUM; i++) dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]); }
+    }
+
+    /* last literal segment */
+    {   size_t const lastLLSize = litEnd - litPtr;
+        RETURN_ERROR_IF(lastLLSize > (size_t)(oend-op), dstSize_tooSmall, "");
+        if (op != NULL) {
+            memcpy(op, litPtr, lastLLSize);
+            op += lastLLSize;
+        }
+    }
+
+    return op-ostart;
+}
+
+static size_t
+ZSTD_decompressSequencesLong_default(ZSTD_DCtx* dctx,
+                                 void* dst, size_t maxDstSize,
+                           const void* seqStart, size_t seqSize, int nbSeq,
+                           const ZSTD_longOffset_e isLongOffset,
+                           const int frame)
+{
+    return ZSTD_decompressSequencesLong_body(dctx, dst, maxDstSize, seqStart, seqSize, nbSeq, isLongOffset, frame);
+}
+#endif /* ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT */
+
+
+
+#if DYNAMIC_BMI2
+
+#ifndef ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG
+#endif /* ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG */
+
+#ifndef ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT
+static TARGET_ATTRIBUTE("bmi2") size_t
+ZSTD_decompressSequencesLong_bmi2(ZSTD_DCtx* dctx,
+                                 void* dst, size_t maxDstSize,
+                           const void* seqStart, size_t seqSize, int nbSeq,
+                           const ZSTD_longOffset_e isLongOffset,
+                           const int frame)
+{
+    return ZSTD_decompressSequencesLong_body(dctx, dst, maxDstSize, seqStart, seqSize, nbSeq, isLongOffset, frame);
+}
+#endif /* ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT */
+
+#endif /* DYNAMIC_BMI2 */
+
+typedef size_t (*ZSTD_decompressSequences_t)(
+                            ZSTD_DCtx* dctx,
+                            void* dst, size_t maxDstSize,
+                            const void* seqStart, size_t seqSize, int nbSeq,
+                            const ZSTD_longOffset_e isLongOffset,
+                            const int frame);
+
+#ifndef ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG
+static size_t
+ZSTD_decompressSequences(ZSTD_DCtx* dctx, void* dst, size_t maxDstSize,
+                   const void* seqStart, size_t seqSize, int nbSeq,
+                   const ZSTD_longOffset_e isLongOffset,
+                   const int frame)
+{
+    DEBUGLOG(5, "ZSTD_decompressSequences");
+  return ZSTD_decompressSequences_default(dctx, dst, maxDstSize, seqStart, seqSize, nbSeq, isLongOffset, frame);
+}
+#endif /* ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG */
+
+
+#ifndef ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT
+/* ZSTD_decompressSequencesLong() :
+ * decompression function triggered when a minimum share of offsets is considered "long",
+ * aka out of cache.
+ * note : "long" definition seems overloaded here, sometimes meaning "wider than bitstream register", and sometimes meaning "farther than memory cache distance".
+ * This function will try to mitigate main memory latency through the use of prefetching */
+static size_t
+ZSTD_decompressSequencesLong(ZSTD_DCtx* dctx,
+                             void* dst, size_t maxDstSize,
+                             const void* seqStart, size_t seqSize, int nbSeq,
+                             const ZSTD_longOffset_e isLongOffset,
+                             const int frame)
+{
+    DEBUGLOG(5, "ZSTD_decompressSequencesLong");
+#if DYNAMIC_BMI2
+    if (dctx->bmi2) {
+        return ZSTD_decompressSequencesLong_bmi2(dctx, dst, maxDstSize, seqStart, seqSize, nbSeq, isLongOffset, frame);
+    }
+#endif
+  return ZSTD_decompressSequencesLong_default(dctx, dst, maxDstSize, seqStart, seqSize, nbSeq, isLongOffset, frame);
+}
+#endif /* ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT */
+
+
+
+#if !defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT) && \
+    !defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG)
+/* ZSTD_getLongOffsetsShare() :
+ * condition : offTable must be valid
+ * @return : "share" of long offsets (arbitrarily defined as > (1<<23))
+ *           compared to maximum possible of (1<<OffFSELog) */
+static unsigned
+ZSTD_getLongOffsetsShare(const ZSTD_seqSymbol* offTable)
+{
+    const void* ptr = offTable;
+    U32 const tableLog = ((const ZSTD_seqSymbol_header*)ptr)[0].tableLog;
+    const ZSTD_seqSymbol* table = offTable + 1;
+    U32 const max = 1 << tableLog;
+    U32 u, total = 0;
+    DEBUGLOG(5, "ZSTD_getLongOffsetsShare: (tableLog=%u)", tableLog);
+
+    assert(max <= (1 << OffFSELog));  /* max not too large */
+    for (u=0; u<max; u++) {
+        if (table[u].nbAdditionalBits > 22) total += 1;
+    }
+
+    assert(tableLog <= OffFSELog);
+    total <<= (OffFSELog - tableLog);  /* scale to OffFSELog */
+
+    return total;
+}
+#endif
+
+size_t
+ZSTD_decompressBlock_internal(ZSTD_DCtx* dctx,
+                              void* dst, size_t dstCapacity,
+                        const void* src, size_t srcSize, const int frame)
+{   /* blockType == blockCompressed */
+    const BYTE* ip = (const BYTE*)src;
+    /* isLongOffset must be true if there are long offsets.
+     * Offsets are long if they are larger than 2^STREAM_ACCUMULATOR_MIN.
+     * We don't expect that to be the case in 64-bit mode.
+     * In block mode, window size is not known, so we have to be conservative.
+     * (note: but it could be evaluated from current-lowLimit)
+     */
+    ZSTD_longOffset_e const isLongOffset = (ZSTD_longOffset_e)(MEM_32bits() && (!frame || (dctx->fParams.windowSize > (1ULL << STREAM_ACCUMULATOR_MIN))));
+    DEBUGLOG(5, "ZSTD_decompressBlock_internal (size : %u)", (U32)srcSize);
+
+    RETURN_ERROR_IF(srcSize >= ZSTD_BLOCKSIZE_MAX, srcSize_wrong, "");
+
+    /* Decode literals section */
+    {   size_t const litCSize = ZSTD_decodeLiteralsBlock(dctx, src, srcSize);
+        DEBUGLOG(5, "ZSTD_decodeLiteralsBlock : %u", (U32)litCSize);
+        if (ZSTD_isError(litCSize)) return litCSize;
+        ip += litCSize;
+        srcSize -= litCSize;
+    }
+
+    /* Build Decoding Tables */
+    {
+        /* These macros control at build-time which decompressor implementation
+         * we use. If neither is defined, we do some inspection and dispatch at
+         * runtime.
+         */
+#if !defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT) && \
+    !defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG)
+        int usePrefetchDecoder = dctx->ddictIsCold;
+#endif
+        int nbSeq;
+        size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, srcSize);
+        if (ZSTD_isError(seqHSize)) return seqHSize;
+        ip += seqHSize;
+        srcSize -= seqHSize;
+
+        RETURN_ERROR_IF(dst == NULL && nbSeq > 0, dstSize_tooSmall, "NULL not handled");
+
+#if !defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT) && \
+    !defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG)
+        if ( !usePrefetchDecoder
+          && (!frame || (dctx->fParams.windowSize > (1<<24)))
+          && (nbSeq>ADVANCED_SEQS) ) {  /* could probably use a larger nbSeq limit */
+            U32 const shareLongOffsets = ZSTD_getLongOffsetsShare(dctx->OFTptr);
+            U32 const minShare = MEM_64bits() ? 7 : 20; /* heuristic values, correspond to 2.73% and 7.81% */
+            usePrefetchDecoder = (shareLongOffsets >= minShare);
+        }
+#endif
+
+        dctx->ddictIsCold = 0;
+
+#if !defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT) && \
+    !defined(ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG)
+        if (usePrefetchDecoder)
+#endif
+#ifndef ZSTD_FORCE_DECOMPRESS_SEQUENCES_SHORT
+            return ZSTD_decompressSequencesLong(dctx, dst, dstCapacity, ip, srcSize, nbSeq, isLongOffset, frame);
+#endif
+
+#ifndef ZSTD_FORCE_DECOMPRESS_SEQUENCES_LONG
+        /* else */
+        return ZSTD_decompressSequences(dctx, dst, dstCapacity, ip, srcSize, nbSeq, isLongOffset, frame);
+#endif
+    }
+}
+
+
+void ZSTD_checkContinuity(ZSTD_DCtx* dctx, const void* dst)
+{
+    if (dst != dctx->previousDstEnd) {   /* not contiguous */
+        dctx->dictEnd = dctx->previousDstEnd;
+        dctx->virtualStart = (const char*)dst - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->prefixStart));
+        dctx->prefixStart = dst;
+        dctx->previousDstEnd = dst;
+    }
+}
+
+
+size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx,
+                            void* dst, size_t dstCapacity,
+                      const void* src, size_t srcSize)
+{
+    size_t dSize;
+    ZSTD_checkContinuity(dctx, dst);
+    dSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize, /* frame */ 0);
+    dctx->previousDstEnd = (char*)dst + dSize;
+    return dSize;
+}
+
+}
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd.h
new file mode 100644
index 0000000000..02ad3dd57f
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd.h
@@ -0,0 +1,1015 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+#ifndef ZSTD_H_235446
+#define ZSTD_H_235446
+
+/* ======   Dependency   ======*/
+#include <limits.h>   /* INT_MAX */
+#include <stddef.h>   /* size_t */
+
+
+/* =====   ZSTDLIB_API : control library symbols visibility   ===== */
+#ifndef ZSTDLIB_VISIBILITY
+#  if defined(__GNUC__) && (__GNUC__ >= 4)
+#    define ZSTDLIB_VISIBILITY __attribute__ ((visibility ("default")))
+#  else
+#    define ZSTDLIB_VISIBILITY
+#  endif
+#endif
+#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)
+#  define ZSTDLIB_API __declspec(dllexport) ZSTDLIB_VISIBILITY
+#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)
+#  define ZSTDLIB_API __declspec(dllimport) ZSTDLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
+#else
+#  define ZSTDLIB_API ZSTDLIB_VISIBILITY
+#endif
+
+namespace lbug_zstd {
+
+/*******************************************************************************
+  Introduction
+
+  zstd, short for Zstandard, is a fast lossless compression algorithm, targeting
+  real-time compression scenarios at zlib-level and better compression ratios.
+  The zstd compression library provides in-memory compression and decompression
+  functions.
+
+  The library supports regular compression levels from 1 up to ZSTD_maxCLevel(),
+  which is currently 22. Levels >= 20, labeled `--ultra`, should be used with
+  caution, as they require more memory. The library also offers negative
+  compression levels, which extend the range of speed vs. ratio preferences.
+  The lower the level, the faster the speed (at the cost of compression).
+
+  Compression can be done in:
+    - a single step (described as Simple API)
+    - a single step, reusing a context (described as Explicit context)
+    - unbounded multiple steps (described as Streaming compression)
+
+  The compression ratio achievable on small data can be highly improved using
+  a dictionary. Dictionary compression can be performed in:
+    - a single step (described as Simple dictionary API)
+    - a single step, reusing a dictionary (described as Bulk-processing
+      dictionary API)
+
+  Advanced experimental functions can be accessed using
+  `#define ZSTD_STATIC_LINKING_ONLY` before including zstd.h.
+
+  Advanced experimental APIs should never be used with a dynamically-linked
+  library. They are not "stable"; their definitions or signatures may change in
+  the future. Only static linking is allowed.
+*******************************************************************************/
+
+/*------   Version   ------*/
+#define ZSTD_VERSION_MAJOR    1
+#define ZSTD_VERSION_MINOR    4
+#define ZSTD_VERSION_RELEASE  5
+
+#define ZSTD_VERSION_NUMBER  (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)
+ZSTDLIB_API unsigned ZSTD_versionNumber(void);   /**< to check runtime library version */
+
+#define ZSTD_LIB_VERSION ZSTD_VERSION_MAJOR.ZSTD_VERSION_MINOR.ZSTD_VERSION_RELEASE
+#define ZSTD_QUOTE(str) #str
+#define ZSTD_EXPAND_AND_QUOTE(str) ZSTD_QUOTE(str)
+#define ZSTD_VERSION_STRING ZSTD_EXPAND_AND_QUOTE(ZSTD_LIB_VERSION)
+ZSTDLIB_API const char* ZSTD_versionString(void);   /* requires v1.3.0+ */
+
+/* *************************************
+ *  Default constant
+ ***************************************/
+#ifndef ZSTD_CLEVEL_DEFAULT
+#  define ZSTD_CLEVEL_DEFAULT 3
+#endif
+
+/* *************************************
+ *  Constants
+ ***************************************/
+
+/* All magic numbers are supposed read/written to/from files/memory using little-endian convention */
+#define ZSTD_MAGICNUMBER            0xFD2FB528    /* valid since v0.8.0 */
+#define ZSTD_MAGIC_DICTIONARY       0xEC30A437    /* valid since v0.7.0 */
+#define ZSTD_MAGIC_SKIPPABLE_START  0x184D2A50    /* all 16 values, from 0x184D2A50 to 0x184D2A5F, signal the beginning of a skippable frame */
+#define ZSTD_MAGIC_SKIPPABLE_MASK   0xFFFFFFF0
+
+#define ZSTD_BLOCKSIZELOG_MAX  17
+#define ZSTD_BLOCKSIZE_MAX     (1<<ZSTD_BLOCKSIZELOG_MAX)
+
+
+
+/***************************************
+*  Simple API
+***************************************/
+/*! ZSTD_compress() :
+ *  Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
+ *  Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
+ *  @return : compressed size written into `dst` (<= `dstCapacity),
+ *            or an error code if it fails (which can be tested using ZSTD_isError()). */
+ZSTDLIB_API size_t ZSTD_compress( void* dst, size_t dstCapacity,
+                            const void* src, size_t srcSize,
+                                  int compressionLevel);
+
+/*! ZSTD_decompress() :
+ *  `compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
+ *  `dstCapacity` is an upper bound of originalSize to regenerate.
+ *  If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
+ *  @return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
+ *            or an errorCode if it fails (which can be tested using ZSTD_isError()). */
+ZSTDLIB_API size_t ZSTD_decompress( void* dst, size_t dstCapacity,
+                              const void* src, size_t compressedSize);
+
+/*! ZSTD_getFrameContentSize() : requires v1.3.0+
+ *  `src` should point to the start of a ZSTD encoded frame.
+ *  `srcSize` must be at least as large as the frame header.
+ *            hint : any size >= `ZSTD_frameHeaderSize_max` is large enough.
+ *  @return : - decompressed size of `src` frame content, if known
+ *            - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined
+ *            - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small)
+ *   note 1 : a 0 return value means the frame is valid but "empty".
+ *   note 2 : decompressed size is an optional field, it may not be present, typically in streaming mode.
+ *            When `return==ZSTD_CONTENTSIZE_UNKNOWN`, data to decompress could be any size.
+ *            In which case, it's necessary to use streaming mode to decompress data.
+ *            Optionally, application can rely on some implicit limit,
+ *            as ZSTD_decompress() only needs an upper bound of decompressed size.
+ *            (For example, data could be necessarily cut into blocks <= 16 KB).
+ *   note 3 : decompressed size is always present when compression is completed using single-pass functions,
+ *            such as ZSTD_compress(), ZSTD_compressCCtx() ZSTD_compress_usingDict() or ZSTD_compress_usingCDict().
+ *   note 4 : decompressed size can be very large (64-bits value),
+ *            potentially larger than what local system can handle as a single memory segment.
+ *            In which case, it's necessary to use streaming mode to decompress data.
+ *   note 5 : If source is untrusted, decompressed size could be wrong or intentionally modified.
+ *            Always ensure return value fits within application's authorized limits.
+ *            Each application can set its own limits.
+ *   note 6 : This function replaces ZSTD_getDecompressedSize() */
+#define ZSTD_CONTENTSIZE_UNKNOWN (0ULL - 1)
+#define ZSTD_CONTENTSIZE_ERROR   (0ULL - 2)
+ZSTDLIB_API unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize);
+
+/*! ZSTD_getDecompressedSize() :
+ *  NOTE: This function is now obsolete, in favor of ZSTD_getFrameContentSize().
+ *  Both functions work the same way, but ZSTD_getDecompressedSize() blends
+ *  "empty", "unknown" and "error" results to the same return value (0),
+ *  while ZSTD_getFrameContentSize() gives them separate return values.
+ * @return : decompressed size of `src` frame content _if known and not empty_, 0 otherwise. */
+ZSTDLIB_API unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize);
+
+/*! ZSTD_findFrameCompressedSize() :
+ * `src` should point to the start of a ZSTD frame or skippable frame.
+ * `srcSize` must be >= first frame size
+ * @return : the compressed size of the first frame starting at `src`,
+ *           suitable to pass as `srcSize` to `ZSTD_decompress` or similar,
+ *        or an error code if input is invalid */
+ZSTDLIB_API size_t ZSTD_findFrameCompressedSize(const void* src, size_t srcSize);
+
+
+/*======  Helper functions  ======*/
+#define ZSTD_COMPRESSBOUND(srcSize)   ((srcSize) + ((srcSize)>>8) + (((srcSize) < (128<<10)) ? (((128<<10) - (srcSize)) >> 11) /* margin, from 64 to 0 */ : 0))  /* this formula ensures that bound(A) + bound(B) <= bound(A+B) as long as A and B >= 128 KB */
+ZSTDLIB_API size_t      ZSTD_compressBound(size_t srcSize); /*!< maximum compressed size in worst case single-pass scenario */
+ZSTDLIB_API unsigned    ZSTD_isError(size_t code);          /*!< tells if a `size_t` function result is an error code */
+ZSTDLIB_API const char* ZSTD_getErrorName(size_t code);     /*!< provides readable string from an error code */
+ZSTDLIB_API int         ZSTD_minCLevel(void);               /*!< minimum negative compression level allowed */
+ZSTDLIB_API int         ZSTD_maxCLevel(void);               /*!< maximum compression level available */
+
+
+/***************************************
+*  Explicit context
+***************************************/
+/*= Compression context
+ *  When compressing many times,
+ *  it is recommended to allocate a context just once,
+ *  and re-use it for each successive compression operation.
+ *  This will make workload friendlier for system's memory.
+ *  Note : re-using context is just a speed / resource optimization.
+ *         It doesn't change the compression ratio, which remains identical.
+ *  Note 2 : In multi-threaded environments,
+ *         use one different context per thread for parallel execution.
+ */
+typedef struct ZSTD_CCtx_s ZSTD_CCtx;
+ZSTDLIB_API ZSTD_CCtx* ZSTD_createCCtx(void);
+ZSTDLIB_API size_t     ZSTD_freeCCtx(ZSTD_CCtx* cctx);
+
+/*! ZSTD_compressCCtx() :
+ *  Same as ZSTD_compress(), using an explicit ZSTD_CCtx.
+ *  Important : in order to behave similarly to `ZSTD_compress()`,
+ *  this function compresses at requested compression level,
+ *  __ignoring any other parameter__ .
+ *  If any advanced parameter was set using the advanced API,
+ *  they will all be reset. Only `compressionLevel` remains.
+ */
+ZSTDLIB_API size_t ZSTD_compressCCtx(ZSTD_CCtx* cctx,
+                                     void* dst, size_t dstCapacity,
+                               const void* src, size_t srcSize,
+                                     int compressionLevel);
+
+/*= Decompression context
+ *  When decompressing many times,
+ *  it is recommended to allocate a context only once,
+ *  and re-use it for each successive compression operation.
+ *  This will make workload friendlier for system's memory.
+ *  Use one context per thread for parallel execution. */
+typedef struct ZSTD_DCtx_s ZSTD_DCtx;
+ZSTDLIB_API ZSTD_DCtx* ZSTD_createDCtx(void);
+ZSTDLIB_API size_t     ZSTD_freeDCtx(ZSTD_DCtx* dctx);
+
+/*! ZSTD_decompressDCtx() :
+ *  Same as ZSTD_decompress(),
+ *  requires an allocated ZSTD_DCtx.
+ *  Compatible with sticky parameters.
+ */
+ZSTDLIB_API size_t ZSTD_decompressDCtx(ZSTD_DCtx* dctx,
+                                       void* dst, size_t dstCapacity,
+                                 const void* src, size_t srcSize);
+
+
+/***************************************
+*  Advanced compression API
+***************************************/
+
+/* API design :
+ *   Parameters are pushed one by one into an existing context,
+ *   using ZSTD_CCtx_set*() functions.
+ *   Pushed parameters are sticky : they are valid for next compressed frame, and any subsequent frame.
+ *   "sticky" parameters are applicable to `ZSTD_compress2()` and `ZSTD_compressStream*()` !
+ *   __They do not apply to "simple" one-shot variants such as ZSTD_compressCCtx()__ .
+ *
+ *   It's possible to reset all parameters to "default" using ZSTD_CCtx_reset().
+ *
+ *   This API supercedes all other "advanced" API entry points in the experimental section.
+ *   In the future, we expect to remove from experimental API entry points which are redundant with this API.
+ */
+
+
+/* Compression strategies, listed from fastest to strongest */
+typedef enum { ZSTD_fast=1,
+               ZSTD_dfast=2,
+               ZSTD_greedy=3,
+               ZSTD_lazy=4,
+               ZSTD_lazy2=5,
+               ZSTD_btlazy2=6,
+               ZSTD_btopt=7,
+               ZSTD_btultra=8,
+               ZSTD_btultra2=9
+               /* note : new strategies _might_ be added in the future.
+                         Only the order (from fast to strong) is guaranteed */
+} ZSTD_strategy;
+
+
+typedef enum {
+
+    /* compression parameters
+     * Note: When compressing with a ZSTD_CDict these parameters are superseded
+     * by the parameters used to construct the ZSTD_CDict.
+     * See ZSTD_CCtx_refCDict() for more info (superseded-by-cdict). */
+    ZSTD_c_compressionLevel=100, /* Set compression parameters according to pre-defined cLevel table.
+                              * Note that exact compression parameters are dynamically determined,
+                              * depending on both compression level and srcSize (when known).
+                              * Default level is ZSTD_CLEVEL_DEFAULT==3.
+                              * Special: value 0 means default, which is controlled by ZSTD_CLEVEL_DEFAULT.
+                              * Note 1 : it's possible to pass a negative compression level.
+                              * Note 2 : setting a level does not automatically set all other compression parameters
+                              *   to default. Setting this will however eventually dynamically impact the compression
+                              *   parameters which have not been manually set. The manually set
+                              *   ones will 'stick'. */
+    /* Advanced compression parameters :
+     * It's possible to pin down compression parameters to some specific values.
+     * In which case, these values are no longer dynamically selected by the compressor */
+    ZSTD_c_windowLog=101,    /* Maximum allowed back-reference distance, expressed as power of 2.
+                              * This will set a memory budget for streaming decompression,
+                              * with larger values requiring more memory
+                              * and typically compressing more.
+                              * Must be clamped between ZSTD_WINDOWLOG_MIN and ZSTD_WINDOWLOG_MAX.
+                              * Special: value 0 means "use default windowLog".
+                              * Note: Using a windowLog greater than ZSTD_WINDOWLOG_LIMIT_DEFAULT
+                              *       requires explicitly allowing such size at streaming decompression stage. */
+    ZSTD_c_hashLog=102,      /* Size of the initial probe table, as a power of 2.
+                              * Resulting memory usage is (1 << (hashLog+2)).
+                              * Must be clamped between ZSTD_HASHLOG_MIN and ZSTD_HASHLOG_MAX.
+                              * Larger tables improve compression ratio of strategies <= dFast,
+                              * and improve speed of strategies > dFast.
+                              * Special: value 0 means "use default hashLog". */
+    ZSTD_c_chainLog=103,     /* Size of the multi-probe search table, as a power of 2.
+                              * Resulting memory usage is (1 << (chainLog+2)).
+                              * Must be clamped between ZSTD_CHAINLOG_MIN and ZSTD_CHAINLOG_MAX.
+                              * Larger tables result in better and slower compression.
+                              * This parameter is useless for "fast" strategy.
+                              * It's still useful when using "dfast" strategy,
+                              * in which case it defines a secondary probe table.
+                              * Special: value 0 means "use default chainLog". */
+    ZSTD_c_searchLog=104,    /* Number of search attempts, as a power of 2.
+                              * More attempts result in better and slower compression.
+                              * This parameter is useless for "fast" and "dFast" strategies.
+                              * Special: value 0 means "use default searchLog". */
+    ZSTD_c_minMatch=105,     /* Minimum size of searched matches.
+                              * Note that Zstandard can still find matches of smaller size,
+                              * it just tweaks its search algorithm to look for this size and larger.
+                              * Larger values increase compression and decompression speed, but decrease ratio.
+                              * Must be clamped between ZSTD_MINMATCH_MIN and ZSTD_MINMATCH_MAX.
+                              * Note that currently, for all strategies < btopt, effective minimum is 4.
+                              *                    , for all strategies > fast, effective maximum is 6.
+                              * Special: value 0 means "use default minMatchLength". */
+    ZSTD_c_targetLength=106, /* Impact of this field depends on strategy.
+                              * For strategies btopt, btultra & btultra2:
+                              *     Length of Match considered "good enough" to stop search.
+                              *     Larger values make compression stronger, and slower.
+                              * For strategy fast:
+                              *     Distance between match sampling.
+                              *     Larger values make compression faster, and weaker.
+                              * Special: value 0 means "use default targetLength". */
+    ZSTD_c_strategy=107,     /* See ZSTD_strategy enum definition.
+                              * The higher the value of selected strategy, the more complex it is,
+                              * resulting in stronger and slower compression.
+                              * Special: value 0 means "use default strategy". */
+
+    /* LDM mode parameters */
+    ZSTD_c_enableLongDistanceMatching=160, /* Enable long distance matching.
+                                     * This parameter is designed to improve compression ratio
+                                     * for large inputs, by finding large matches at long distance.
+                                     * It increases memory usage and window size.
+                                     * Note: enabling this parameter increases default ZSTD_c_windowLog to 128 MB
+                                     * except when expressly set to a different value. */
+    ZSTD_c_ldmHashLog=161,   /* Size of the table for long distance matching, as a power of 2.
+                              * Larger values increase memory usage and compression ratio,
+                              * but decrease compression speed.
+                              * Must be clamped between ZSTD_HASHLOG_MIN and ZSTD_HASHLOG_MAX
+                              * default: windowlog - 7.
+                              * Special: value 0 means "automatically determine hashlog". */
+    ZSTD_c_ldmMinMatch=162,  /* Minimum match size for long distance matcher.
+                              * Larger/too small values usually decrease compression ratio.
+                              * Must be clamped between ZSTD_LDM_MINMATCH_MIN and ZSTD_LDM_MINMATCH_MAX.
+                              * Special: value 0 means "use default value" (default: 64). */
+    ZSTD_c_ldmBucketSizeLog=163, /* Log size of each bucket in the LDM hash table for collision resolution.
+                              * Larger values improve collision resolution but decrease compression speed.
+                              * The maximum value is ZSTD_LDM_BUCKETSIZELOG_MAX.
+                              * Special: value 0 means "use default value" (default: 3). */
+    ZSTD_c_ldmHashRateLog=164, /* Frequency of inserting/looking up entries into the LDM hash table.
+                              * Must be clamped between 0 and (ZSTD_WINDOWLOG_MAX - ZSTD_HASHLOG_MIN).
+                              * Default is MAX(0, (windowLog - ldmHashLog)), optimizing hash table usage.
+                              * Larger values improve compression speed.
+                              * Deviating far from default value will likely result in a compression ratio decrease.
+                              * Special: value 0 means "automatically determine hashRateLog". */
+
+    /* frame parameters */
+    ZSTD_c_contentSizeFlag=200, /* Content size will be written into frame header _whenever known_ (default:1)
+                              * Content size must be known at the beginning of compression.
+                              * This is automatically the case when using ZSTD_compress2(),
+                              * For streaming scenarios, content size must be provided with ZSTD_CCtx_setPledgedSrcSize() */
+    ZSTD_c_checksumFlag=201, /* A 32-bits checksum of content is written at end of frame (default:0) */
+    ZSTD_c_dictIDFlag=202,   /* When applicable, dictionary's ID is written into frame header (default:1) */
+
+    /* multi-threading parameters */
+    /* These parameters are only useful if multi-threading is enabled (compiled with build macro ZSTD_MULTITHREAD).
+     * They return an error otherwise. */
+    ZSTD_c_nbWorkers=400,    /* Select how many threads will be spawned to compress in parallel.
+                              * When nbWorkers >= 1, triggers asynchronous mode when used with ZSTD_compressStream*() :
+                              * ZSTD_compressStream*() consumes input and flush output if possible, but immediately gives back control to caller,
+                              * while compression work is performed in parallel, within worker threads.
+                              * (note : a strong exception to this rule is when first invocation of ZSTD_compressStream2() sets ZSTD_e_end :
+                              *  in which case, ZSTD_compressStream2() delegates to ZSTD_compress2(), which is always a blocking call).
+                              * More workers improve speed, but also increase memory usage.
+                              * Default value is `0`, aka "single-threaded mode" : no worker is spawned, compression is performed inside Caller's thread, all invocations are blocking */
+    ZSTD_c_jobSize=401,      /* Size of a compression job. This value is enforced only when nbWorkers >= 1.
+                              * Each compression job is completed in parallel, so this value can indirectly impact the nb of active threads.
+                              * 0 means default, which is dynamically determined based on compression parameters.
+                              * Job size must be a minimum of overlap size, or 1 MB, whichever is largest.
+                              * The minimum size is automatically and transparently enforced. */
+    ZSTD_c_overlapLog=402,   /* Control the overlap size, as a fraction of window size.
+                              * The overlap size is an amount of data reloaded from previous job at the beginning of a new job.
+                              * It helps preserve compression ratio, while each job is compressed in parallel.
+                              * This value is enforced only when nbWorkers >= 1.
+                              * Larger values increase compression ratio, but decrease speed.
+                              * Possible values range from 0 to 9 :
+                              * - 0 means "default" : value will be determined by the library, depending on strategy
+                              * - 1 means "no overlap"
+                              * - 9 means "full overlap", using a full window size.
+                              * Each intermediate rank increases/decreases load size by a factor 2 :
+                              * 9: full window;  8: w/2;  7: w/4;  6: w/8;  5:w/16;  4: w/32;  3:w/64;  2:w/128;  1:no overlap;  0:default
+                              * default value varies between 6 and 9, depending on strategy */
+
+    /* note : additional experimental parameters are also available
+     * within the experimental section of the API.
+     * At the time of this writing, they include :
+     * ZSTD_c_rsyncable
+     * ZSTD_c_format
+     * ZSTD_c_forceMaxWindow
+     * ZSTD_c_forceAttachDict
+     * ZSTD_c_literalCompressionMode
+     * ZSTD_c_targetCBlockSize
+     * ZSTD_c_srcSizeHint
+     * Because they are not stable, it's necessary to define ZSTD_STATIC_LINKING_ONLY to access them.
+     * note : never ever use experimentalParam? names directly;
+     *        also, the enums values themselves are unstable and can still change.
+     */
+     ZSTD_c_experimentalParam1=500,
+     ZSTD_c_experimentalParam2=10,
+     ZSTD_c_experimentalParam3=1000,
+     ZSTD_c_experimentalParam4=1001,
+     ZSTD_c_experimentalParam5=1002,
+     ZSTD_c_experimentalParam6=1003,
+     ZSTD_c_experimentalParam7=1004
+} ZSTD_cParameter;
+
+typedef struct {
+    size_t error;
+    int lowerBound;
+    int upperBound;
+} ZSTD_bounds;
+
+/*! ZSTD_cParam_getBounds() :
+ *  All parameters must belong to an interval with lower and upper bounds,
+ *  otherwise they will either trigger an error or be automatically clamped.
+ * @return : a structure, ZSTD_bounds, which contains
+ *         - an error status field, which must be tested using ZSTD_isError()
+ *         - lower and upper bounds, both inclusive
+ */
+ZSTDLIB_API ZSTD_bounds ZSTD_cParam_getBounds(ZSTD_cParameter cParam);
+
+/*! ZSTD_CCtx_setParameter() :
+ *  Set one compression parameter, selected by enum ZSTD_cParameter.
+ *  All parameters have valid bounds. Bounds can be queried using ZSTD_cParam_getBounds().
+ *  Providing a value beyond bound will either clamp it, or trigger an error (depending on parameter).
+ *  Setting a parameter is generally only possible during frame initialization (before starting compression).
+ *  Exception : when using multi-threading mode (nbWorkers >= 1),
+ *              the following parameters can be updated _during_ compression (within same frame):
+ *              => compressionLevel, hashLog, chainLog, searchLog, minMatch, targetLength and strategy.
+ *              new parameters will be active for next job only (after a flush()).
+ * @return : an error code (which can be tested using ZSTD_isError()).
+ */
+ZSTDLIB_API size_t ZSTD_CCtx_setParameter(ZSTD_CCtx* cctx, ZSTD_cParameter param, int value);
+
+/*! ZSTD_CCtx_setPledgedSrcSize() :
+ *  Total input data size to be compressed as a single frame.
+ *  Value will be written in frame header, unless if explicitly forbidden using ZSTD_c_contentSizeFlag.
+ *  This value will also be controlled at end of frame, and trigger an error if not respected.
+ * @result : 0, or an error code (which can be tested with ZSTD_isError()).
+ *  Note 1 : pledgedSrcSize==0 actually means zero, aka an empty frame.
+ *           In order to mean "unknown content size", pass constant ZSTD_CONTENTSIZE_UNKNOWN.
+ *           ZSTD_CONTENTSIZE_UNKNOWN is default value for any new frame.
+ *  Note 2 : pledgedSrcSize is only valid once, for the next frame.
+ *           It's discarded at the end of the frame, and replaced by ZSTD_CONTENTSIZE_UNKNOWN.
+ *  Note 3 : Whenever all input data is provided and consumed in a single round,
+ *           for example with ZSTD_compress2(),
+ *           or invoking immediately ZSTD_compressStream2(,,,ZSTD_e_end),
+ *           this value is automatically overridden by srcSize instead.
+ */
+ZSTDLIB_API size_t ZSTD_CCtx_setPledgedSrcSize(ZSTD_CCtx* cctx, unsigned long long pledgedSrcSize);
+
+typedef enum {
+    ZSTD_reset_session_only = 1,
+    ZSTD_reset_parameters = 2,
+    ZSTD_reset_session_and_parameters = 3
+} ZSTD_ResetDirective;
+
+/*! ZSTD_CCtx_reset() :
+ *  There are 2 different things that can be reset, independently or jointly :
+ *  - The session : will stop compressing current frame, and make CCtx ready to start a new one.
+ *                  Useful after an error, or to interrupt any ongoing compression.
+ *                  Any internal data not yet flushed is cancelled.
+ *                  Compression parameters and dictionary remain unchanged.
+ *                  They will be used to compress next frame.
+ *                  Resetting session never fails.
+ *  - The parameters : changes all parameters back to "default".
+ *                  This removes any reference to any dictionary too.
+ *                  Parameters can only be changed between 2 sessions (i.e. no compression is currently ongoing)
+ *                  otherwise the reset fails, and function returns an error value (which can be tested using ZSTD_isError())
+ *  - Both : similar to resetting the session, followed by resetting parameters.
+ */
+ZSTDLIB_API size_t ZSTD_CCtx_reset(ZSTD_CCtx* cctx, ZSTD_ResetDirective reset);
+
+/*! ZSTD_compress2() :
+ *  Behave the same as ZSTD_compressCCtx(), but compression parameters are set using the advanced API.
+ *  ZSTD_compress2() always starts a new frame.
+ *  Should cctx hold data from a previously unfinished frame, everything about it is forgotten.
+ *  - Compression parameters are pushed into CCtx before starting compression, using ZSTD_CCtx_set*()
+ *  - The function is always blocking, returns when compression is completed.
+ *  Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
+ * @return : compressed size written into `dst` (<= `dstCapacity),
+ *           or an error code if it fails (which can be tested using ZSTD_isError()).
+ */
+ZSTDLIB_API size_t ZSTD_compress2( ZSTD_CCtx* cctx,
+                                   void* dst, size_t dstCapacity,
+                             const void* src, size_t srcSize);
+
+
+/***************************************
+*  Advanced decompression API
+***************************************/
+
+/* The advanced API pushes parameters one by one into an existing DCtx context.
+ * Parameters are sticky, and remain valid for all following frames
+ * using the same DCtx context.
+ * It's possible to reset parameters to default values using ZSTD_DCtx_reset().
+ * Note : This API is compatible with existing ZSTD_decompressDCtx() and ZSTD_decompressStream().
+ *        Therefore, no new decompression function is necessary.
+ */
+
+typedef enum {
+
+    ZSTD_d_windowLogMax=100, /* Select a size limit (in power of 2) beyond which
+                              * the streaming API will refuse to allocate memory buffer
+                              * in order to protect the host from unreasonable memory requirements.
+                              * This parameter is only useful in streaming mode, since no internal buffer is allocated in single-pass mode.
+                              * By default, a decompression context accepts window sizes <= (1 << ZSTD_WINDOWLOG_LIMIT_DEFAULT).
+                              * Special: value 0 means "use default maximum windowLog". */
+
+    /* note : additional experimental parameters are also available
+     * within the experimental section of the API.
+     * At the time of this writing, they include :
+     * ZSTD_d_format
+     * ZSTD_d_stableOutBuffer
+     * Because they are not stable, it's necessary to define ZSTD_STATIC_LINKING_ONLY to access them.
+     * note : never ever use experimentalParam? names directly
+     */
+     ZSTD_d_experimentalParam1=1000,
+     ZSTD_d_experimentalParam2=1001
+
+} ZSTD_dParameter;
+
+/*! ZSTD_dParam_getBounds() :
+ *  All parameters must belong to an interval with lower and upper bounds,
+ *  otherwise they will either trigger an error or be automatically clamped.
+ * @return : a structure, ZSTD_bounds, which contains
+ *         - an error status field, which must be tested using ZSTD_isError()
+ *         - both lower and upper bounds, inclusive
+ */
+ZSTDLIB_API ZSTD_bounds ZSTD_dParam_getBounds(ZSTD_dParameter dParam);
+
+/*! ZSTD_DCtx_setParameter() :
+ *  Set one compression parameter, selected by enum ZSTD_dParameter.
+ *  All parameters have valid bounds. Bounds can be queried using ZSTD_dParam_getBounds().
+ *  Providing a value beyond bound will either clamp it, or trigger an error (depending on parameter).
+ *  Setting a parameter is only possible during frame initialization (before starting decompression).
+ * @return : 0, or an error code (which can be tested using ZSTD_isError()).
+ */
+ZSTDLIB_API size_t ZSTD_DCtx_setParameter(ZSTD_DCtx* dctx, ZSTD_dParameter param, int value);
+
+/*! ZSTD_DCtx_reset() :
+ *  Return a DCtx to clean state.
+ *  Session and parameters can be reset jointly or separately.
+ *  Parameters can only be reset when no active frame is being decompressed.
+ * @return : 0, or an error code, which can be tested with ZSTD_isError()
+ */
+ZSTDLIB_API size_t ZSTD_DCtx_reset(ZSTD_DCtx* dctx, ZSTD_ResetDirective reset);
+
+
+/****************************
+*  Streaming
+****************************/
+
+typedef struct ZSTD_inBuffer_s {
+  const void* src;    /**< start of input buffer */
+  size_t size;        /**< size of input buffer */
+  size_t pos;         /**< position where reading stopped. Will be updated. Necessarily 0 <= pos <= size */
+} ZSTD_inBuffer;
+
+typedef struct ZSTD_outBuffer_s {
+  void*  dst;         /**< start of output buffer */
+  size_t size;        /**< size of output buffer */
+  size_t pos;         /**< position where writing stopped. Will be updated. Necessarily 0 <= pos <= size */
+} ZSTD_outBuffer;
+
+
+
+/*-***********************************************************************
+*  Streaming compression - HowTo
+*
+*  A ZSTD_CStream object is required to track streaming operation.
+*  Use ZSTD_createCStream() and ZSTD_freeCStream() to create/release resources.
+*  ZSTD_CStream objects can be reused multiple times on consecutive compression operations.
+*  It is recommended to re-use ZSTD_CStream since it will play nicer with system's memory, by re-using already allocated memory.
+*
+*  For parallel execution, use one separate ZSTD_CStream per thread.
+*
+*  note : since v1.3.0, ZSTD_CStream and ZSTD_CCtx are the same thing.
+*
+*  Parameters are sticky : when starting a new compression on the same context,
+*  it will re-use the same sticky parameters as previous compression session.
+*  When in doubt, it's recommended to fully initialize the context before usage.
+*  Use ZSTD_CCtx_reset() to reset the context and ZSTD_CCtx_setParameter(),
+*  ZSTD_CCtx_setPledgedSrcSize(), or ZSTD_CCtx_loadDictionary() and friends to
+*  set more specific parameters, the pledged source size, or load a dictionary.
+*
+*  Use ZSTD_compressStream2() with ZSTD_e_continue as many times as necessary to
+*  consume input stream. The function will automatically update both `pos`
+*  fields within `input` and `output`.
+*  Note that the function may not consume the entire input, for example, because
+*  the output buffer is already full, in which case `input.pos < input.size`.
+*  The caller must check if input has been entirely consumed.
+*  If not, the caller must make some room to receive more compressed data,
+*  and then present again remaining input data.
+*  note: ZSTD_e_continue is guaranteed to make some forward progress when called,
+*        but doesn't guarantee maximal forward progress. This is especially relevant
+*        when compressing with multiple threads. The call won't block if it can
+*        consume some input, but if it can't it will wait for some, but not all,
+*        output to be flushed.
+* @return : provides a minimum amount of data remaining to be flushed from internal buffers
+*           or an error code, which can be tested using ZSTD_isError().
+*
+*  At any moment, it's possible to flush whatever data might remain stuck within internal buffer,
+*  using ZSTD_compressStream2() with ZSTD_e_flush. `output->pos` will be updated.
+*  Note that, if `output->size` is too small, a single invocation with ZSTD_e_flush might not be enough (return code > 0).
+*  In which case, make some room to receive more compressed data, and call again ZSTD_compressStream2() with ZSTD_e_flush.
+*  You must continue calling ZSTD_compressStream2() with ZSTD_e_flush until it returns 0, at which point you can change the
+*  operation.
+*  note: ZSTD_e_flush will flush as much output as possible, meaning when compressing with multiple threads, it will
+*        block until the flush is complete or the output buffer is full.
+*  @return : 0 if internal buffers are entirely flushed,
+*            >0 if some data still present within internal buffer (the value is minimal estimation of remaining size),
+*            or an error code, which can be tested using ZSTD_isError().
+*
+*  Calling ZSTD_compressStream2() with ZSTD_e_end instructs to finish a frame.
+*  It will perform a flush and write frame epilogue.
+*  The epilogue is required for decoders to consider a frame completed.
+*  flush operation is the same, and follows same rules as calling ZSTD_compressStream2() with ZSTD_e_flush.
+*  You must continue calling ZSTD_compressStream2() with ZSTD_e_end until it returns 0, at which point you are free to
+*  start a new frame.
+*  note: ZSTD_e_end will flush as much output as possible, meaning when compressing with multiple threads, it will
+*        block until the flush is complete or the output buffer is full.
+*  @return : 0 if frame fully completed and fully flushed,
+*            >0 if some data still present within internal buffer (the value is minimal estimation of remaining size),
+*            or an error code, which can be tested using ZSTD_isError().
+*
+* *******************************************************************/
+
+typedef ZSTD_CCtx ZSTD_CStream;  /**< CCtx and CStream are now effectively same object (>= v1.3.0) */
+                                 /* Continue to distinguish them for compatibility with older versions <= v1.2.0 */
+/*===== ZSTD_CStream management functions =====*/
+ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream(void);
+ZSTDLIB_API size_t ZSTD_freeCStream(ZSTD_CStream* zcs);
+
+/*===== Streaming compression functions =====*/
+typedef enum {
+    ZSTD_e_continue=0, /* collect more data, encoder decides when to output compressed result, for optimal compression ratio */
+    ZSTD_e_flush=1,    /* flush any data provided so far,
+                        * it creates (at least) one new block, that can be decoded immediately on reception;
+                        * frame will continue: any future data can still reference previously compressed data, improving compression.
+                        * note : multithreaded compression will block to flush as much output as possible. */
+    ZSTD_e_end=2       /* flush any remaining data _and_ close current frame.
+                        * note that frame is only closed after compressed data is fully flushed (return value == 0).
+                        * After that point, any additional data starts a new frame.
+                        * note : each frame is independent (does not reference any content from previous frame).
+                        : note : multithreaded compression will block to flush as much output as possible. */
+} ZSTD_EndDirective;
+
+/*! ZSTD_compressStream2() :
+ *  Behaves about the same as ZSTD_compressStream, with additional control on end directive.
+ *  - Compression parameters are pushed into CCtx before starting compression, using ZSTD_CCtx_set*()
+ *  - Compression parameters cannot be changed once compression is started (save a list of exceptions in multi-threading mode)
+ *  - output->pos must be <= dstCapacity, input->pos must be <= srcSize
+ *  - output->pos and input->pos will be updated. They are guaranteed to remain below their respective limit.
+ *  - When nbWorkers==0 (default), function is blocking : it completes its job before returning to caller.
+ *  - When nbWorkers>=1, function is non-blocking : it just acquires a copy of input, and distributes jobs to internal worker threads, flush whatever is available,
+ *                                                  and then immediately returns, just indicating that there is some data remaining to be flushed.
+ *                                                  The function nonetheless guarantees forward progress : it will return only after it reads or write at least 1+ byte.
+ *  - Exception : if the first call requests a ZSTD_e_end directive and provides enough dstCapacity, the function delegates to ZSTD_compress2() which is always blocking.
+ *  - @return provides a minimum amount of data remaining to be flushed from internal buffers
+ *            or an error code, which can be tested using ZSTD_isError().
+ *            if @return != 0, flush is not fully completed, there is still some data left within internal buffers.
+ *            This is useful for ZSTD_e_flush, since in this case more flushes are necessary to empty all buffers.
+ *            For ZSTD_e_end, @return == 0 when internal buffers are fully flushed and frame is completed.
+ *  - after a ZSTD_e_end directive, if internal buffer is not fully flushed (@return != 0),
+ *            only ZSTD_e_end or ZSTD_e_flush operations are allowed.
+ *            Before starting a new compression job, or changing compression parameters,
+ *            it is required to fully flush internal buffers.
+ */
+ZSTDLIB_API size_t ZSTD_compressStream2( ZSTD_CCtx* cctx,
+                                         ZSTD_outBuffer* output,
+                                         ZSTD_inBuffer* input,
+                                         ZSTD_EndDirective endOp);
+
+
+/* These buffer sizes are softly recommended.
+ * They are not required : ZSTD_compressStream*() happily accepts any buffer size, for both input and output.
+ * Respecting the recommended size just makes it a bit easier for ZSTD_compressStream*(),
+ * reducing the amount of memory shuffling and buffering, resulting in minor performance savings.
+ *
+ * However, note that these recommendations are from the perspective of a C caller program.
+ * If the streaming interface is invoked from some other language,
+ * especially managed ones such as Java or Go, through a foreign function interface such as jni or cgo,
+ * a major performance rule is to reduce crossing such interface to an absolute minimum.
+ * It's not rare that performance ends being spent more into the interface, rather than compression itself.
+ * In which cases, prefer using large buffers, as large as practical,
+ * for both input and output, to reduce the nb of roundtrips.
+ */
+ZSTDLIB_API size_t ZSTD_CStreamInSize(void);    /**< recommended size for input buffer */
+ZSTDLIB_API size_t ZSTD_CStreamOutSize(void);   /**< recommended size for output buffer. Guarantee to successfully flush at least one complete compressed block. */
+
+
+/* *****************************************************************************
+ * This following is a legacy streaming API.
+ * It can be replaced by ZSTD_CCtx_reset() and ZSTD_compressStream2().
+ * It is redundant, but remains fully supported.
+ * Advanced parameters and dictionary compression can only be used through the
+ * new API.
+ ******************************************************************************/
+
+/*!
+ * Equivalent to:
+ *
+ *     ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+ *     ZSTD_CCtx_refCDict(zcs, NULL); // clear the dictionary (if any)
+ *     ZSTD_CCtx_setParameter(zcs, ZSTD_c_compressionLevel, compressionLevel);
+ */
+ZSTDLIB_API size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel);
+/*!
+ * Alternative for ZSTD_compressStream2(zcs, output, input, ZSTD_e_continue).
+ * NOTE: The return value is different. ZSTD_compressStream() returns a hint for
+ * the next read size (if non-zero and not an error). ZSTD_compressStream2()
+ * returns the minimum nb of bytes left to flush (if non-zero and not an error).
+ */
+ZSTDLIB_API size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
+/*! Equivalent to ZSTD_compressStream2(zcs, output, &emptyInput, ZSTD_e_flush). */
+ZSTDLIB_API size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
+/*! Equivalent to ZSTD_compressStream2(zcs, output, &emptyInput, ZSTD_e_end). */
+ZSTDLIB_API size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
+
+
+/*-***************************************************************************
+*  Streaming decompression - HowTo
+*
+*  A ZSTD_DStream object is required to track streaming operations.
+*  Use ZSTD_createDStream() and ZSTD_freeDStream() to create/release resources.
+*  ZSTD_DStream objects can be re-used multiple times.
+*
+*  Use ZSTD_initDStream() to start a new decompression operation.
+* @return : recommended first input size
+*  Alternatively, use advanced API to set specific properties.
+*
+*  Use ZSTD_decompressStream() repetitively to consume your input.
+*  The function will update both `pos` fields.
+*  If `input.pos < input.size`, some input has not been consumed.
+*  It's up to the caller to present again remaining data.
+*  The function tries to flush all data decoded immediately, respecting output buffer size.
+*  If `output.pos < output.size`, decoder has flushed everything it could.
+*  But if `output.pos == output.size`, there might be some data left within internal buffers.,
+*  In which case, call ZSTD_decompressStream() again to flush whatever remains in the buffer.
+*  Note : with no additional input provided, amount of data flushed is necessarily <= ZSTD_BLOCKSIZE_MAX.
+* @return : 0 when a frame is completely decoded and fully flushed,
+*        or an error code, which can be tested using ZSTD_isError(),
+*        or any other value > 0, which means there is still some decoding or flushing to do to complete current frame :
+*                                the return value is a suggested next input size (just a hint for better latency)
+*                                that will never request more than the remaining frame size.
+* *******************************************************************************/
+
+typedef ZSTD_DCtx ZSTD_DStream;  /**< DCtx and DStream are now effectively same object (>= v1.3.0) */
+                                 /* For compatibility with versions <= v1.2.0, prefer differentiating them. */
+/*===== ZSTD_DStream management functions =====*/
+ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream(void);
+ZSTDLIB_API size_t ZSTD_freeDStream(ZSTD_DStream* zds);
+
+/*===== Streaming decompression functions =====*/
+
+/* This function is redundant with the advanced API and equivalent to:
+ *
+ *     ZSTD_DCtx_reset(zds, ZSTD_reset_session_only);
+ *     ZSTD_DCtx_refDDict(zds, NULL);
+ */
+ZSTDLIB_API size_t ZSTD_initDStream(ZSTD_DStream* zds);
+
+ZSTDLIB_API size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
+
+ZSTDLIB_API size_t ZSTD_DStreamInSize(void);    /*!< recommended size for input buffer */
+ZSTDLIB_API size_t ZSTD_DStreamOutSize(void);   /*!< recommended size for output buffer. Guarantee to successfully flush at least one complete block in all circumstances. */
+
+
+/**************************
+*  Simple dictionary API
+***************************/
+/*! ZSTD_compress_usingDict() :
+ *  Compression at an explicit compression level using a Dictionary.
+ *  A dictionary can be any arbitrary data segment (also called a prefix),
+ *  or a buffer with specified information (see dict/zdict.h).
+ *  Note : This function loads the dictionary, resulting in significant startup delay.
+ *         It's intended for a dictionary used only once.
+ *  Note 2 : When `dict == NULL || dictSize < 8` no dictionary is used. */
+ZSTDLIB_API size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx,
+                                           void* dst, size_t dstCapacity,
+                                     const void* src, size_t srcSize,
+                                     const void* dict,size_t dictSize,
+                                           int compressionLevel);
+
+/*! ZSTD_decompress_usingDict() :
+ *  Decompression using a known Dictionary.
+ *  Dictionary must be identical to the one used during compression.
+ *  Note : This function loads the dictionary, resulting in significant startup delay.
+ *         It's intended for a dictionary used only once.
+ *  Note : When `dict == NULL || dictSize < 8` no dictionary is used. */
+ZSTDLIB_API size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
+                                             void* dst, size_t dstCapacity,
+                                       const void* src, size_t srcSize,
+                                       const void* dict,size_t dictSize);
+
+
+/***********************************
+ *  Bulk processing dictionary API
+ **********************************/
+typedef struct ZSTD_CDict_s ZSTD_CDict;
+
+/*! ZSTD_createCDict() :
+ *  When compressing multiple messages or blocks using the same dictionary,
+ *  it's recommended to digest the dictionary only once, since it's a costly operation.
+ *  ZSTD_createCDict() will create a state from digesting a dictionary.
+ *  The resulting state can be used for future compression operations with very limited startup cost.
+ *  ZSTD_CDict can be created once and shared by multiple threads concurrently, since its usage is read-only.
+ * @dictBuffer can be released after ZSTD_CDict creation, because its content is copied within CDict.
+ *  Note 1 : Consider experimental function `ZSTD_createCDict_byReference()` if you prefer to not duplicate @dictBuffer content.
+ *  Note 2 : A ZSTD_CDict can be created from an empty @dictBuffer,
+ *      in which case the only thing that it transports is the @compressionLevel.
+ *      This can be useful in a pipeline featuring ZSTD_compress_usingCDict() exclusively,
+ *      expecting a ZSTD_CDict parameter with any data, including those without a known dictionary. */
+ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict(const void* dictBuffer, size_t dictSize,
+                                         int compressionLevel);
+
+/*! ZSTD_freeCDict() :
+ *  Function frees memory allocated by ZSTD_createCDict(). */
+ZSTDLIB_API size_t      ZSTD_freeCDict(ZSTD_CDict* CDict);
+
+/*! ZSTD_compress_usingCDict() :
+ *  Compression using a digested Dictionary.
+ *  Recommended when same dictionary is used multiple times.
+ *  Note : compression level is _decided at dictionary creation time_,
+ *     and frame parameters are hardcoded (dictID=yes, contentSize=yes, checksum=no) */
+ZSTDLIB_API size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
+                                            void* dst, size_t dstCapacity,
+                                      const void* src, size_t srcSize,
+                                      const ZSTD_CDict* cdict);
+
+
+typedef struct ZSTD_DDict_s ZSTD_DDict;
+
+/*! ZSTD_createDDict() :
+ *  Create a digested dictionary, ready to start decompression operation without startup delay.
+ *  dictBuffer can be released after DDict creation, as its content is copied inside DDict. */
+ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict(const void* dictBuffer, size_t dictSize);
+
+/*! ZSTD_freeDDict() :
+ *  Function frees memory allocated with ZSTD_createDDict() */
+ZSTDLIB_API size_t      ZSTD_freeDDict(ZSTD_DDict* ddict);
+
+/*! ZSTD_decompress_usingDDict() :
+ *  Decompression using a digested Dictionary.
+ *  Recommended when same dictionary is used multiple times. */
+ZSTDLIB_API size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
+                                              void* dst, size_t dstCapacity,
+                                        const void* src, size_t srcSize,
+                                        const ZSTD_DDict* ddict);
+
+
+/********************************
+ *  Dictionary helper functions
+ *******************************/
+
+/*! ZSTD_getDictID_fromDict() :
+ *  Provides the dictID stored within dictionary.
+ *  if @return == 0, the dictionary is not conformant with Zstandard specification.
+ *  It can still be loaded, but as a content-only dictionary. */
+ZSTDLIB_API unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize);
+
+/*! ZSTD_getDictID_fromDDict() :
+ *  Provides the dictID of the dictionary loaded into `ddict`.
+ *  If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.
+ *  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */
+ZSTDLIB_API unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict);
+
+/*! ZSTD_getDictID_fromFrame() :
+ *  Provides the dictID required to decompressed the frame stored within `src`.
+ *  If @return == 0, the dictID could not be decoded.
+ *  This could for one of the following reasons :
+ *  - The frame does not require a dictionary to be decoded (most common case).
+ *  - The frame was built with dictID intentionally removed. Whatever dictionary is necessary is a hidden information.
+ *    Note : this use case also happens when using a non-conformant dictionary.
+ *  - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
+ *  - This is not a Zstandard frame.
+ *  When identifying the exact failure cause, it's possible to use ZSTD_getFrameHeader(), which will provide a more precise error code. */
+ZSTDLIB_API unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize);
+
+
+/*******************************************************************************
+ * Advanced dictionary and prefix API
+ *
+ * This API allows dictionaries to be used with ZSTD_compress2(),
+ * ZSTD_compressStream2(), and ZSTD_decompress(). Dictionaries are sticky, and
+ * only reset with the context is reset with ZSTD_reset_parameters or
+ * ZSTD_reset_session_and_parameters. Prefixes are single-use.
+ ******************************************************************************/
+
+
+/*! ZSTD_CCtx_loadDictionary() :
+ *  Create an internal CDict from `dict` buffer.
+ *  Decompression will have to use same dictionary.
+ * @result : 0, or an error code (which can be tested with ZSTD_isError()).
+ *  Special: Loading a NULL (or 0-size) dictionary invalidates previous dictionary,
+ *           meaning "return to no-dictionary mode".
+ *  Note 1 : Dictionary is sticky, it will be used for all future compressed frames.
+ *           To return to "no-dictionary" situation, load a NULL dictionary (or reset parameters).
+ *  Note 2 : Loading a dictionary involves building tables.
+ *           It's also a CPU consuming operation, with non-negligible impact on latency.
+ *           Tables are dependent on compression parameters, and for this reason,
+ *           compression parameters can no longer be changed after loading a dictionary.
+ *  Note 3 :`dict` content will be copied internally.
+ *           Use experimental ZSTD_CCtx_loadDictionary_byReference() to reference content instead.
+ *           In such a case, dictionary buffer must outlive its users.
+ *  Note 4 : Use ZSTD_CCtx_loadDictionary_advanced()
+ *           to precisely select how dictionary content must be interpreted. */
+ZSTDLIB_API size_t ZSTD_CCtx_loadDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize);
+
+/*! ZSTD_CCtx_refCDict() :
+ *  Reference a prepared dictionary, to be used for all next compressed frames.
+ *  Note that compression parameters are enforced from within CDict,
+ *  and supersede any compression parameter previously set within CCtx.
+ *  The parameters ignored are labled as "superseded-by-cdict" in the ZSTD_cParameter enum docs.
+ *  The ignored parameters will be used again if the CCtx is returned to no-dictionary mode.
+ *  The dictionary will remain valid for future compressed frames using same CCtx.
+ * @result : 0, or an error code (which can be tested with ZSTD_isError()).
+ *  Special : Referencing a NULL CDict means "return to no-dictionary mode".
+ *  Note 1 : Currently, only one dictionary can be managed.
+ *           Referencing a new dictionary effectively "discards" any previous one.
+ *  Note 2 : CDict is just referenced, its lifetime must outlive its usage within CCtx. */
+ZSTDLIB_API size_t ZSTD_CCtx_refCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict);
+
+/*! ZSTD_CCtx_refPrefix() :
+ *  Reference a prefix (single-usage dictionary) for next compressed frame.
+ *  A prefix is **only used once**. Tables are discarded at end of frame (ZSTD_e_end).
+ *  Decompression will need same prefix to properly regenerate data.
+ *  Compressing with a prefix is similar in outcome as performing a diff and compressing it,
+ *  but performs much faster, especially during decompression (compression speed is tunable with compression level).
+ * @result : 0, or an error code (which can be tested with ZSTD_isError()).
+ *  Special: Adding any prefix (including NULL) invalidates any previous prefix or dictionary
+ *  Note 1 : Prefix buffer is referenced. It **must** outlive compression.
+ *           Its content must remain unmodified during compression.
+ *  Note 2 : If the intention is to diff some large src data blob with some prior version of itself,
+ *           ensure that the window size is large enough to contain the entire source.
+ *           See ZSTD_c_windowLog.
+ *  Note 3 : Referencing a prefix involves building tables, which are dependent on compression parameters.
+ *           It's a CPU consuming operation, with non-negligible impact on latency.
+ *           If there is a need to use the same prefix multiple times, consider loadDictionary instead.
+ *  Note 4 : By default, the prefix is interpreted as raw content (ZSTD_dct_rawContent).
+ *           Use experimental ZSTD_CCtx_refPrefix_advanced() to alter dictionary interpretation. */
+ZSTDLIB_API size_t ZSTD_CCtx_refPrefix(ZSTD_CCtx* cctx,
+                                 const void* prefix, size_t prefixSize);
+
+/*! ZSTD_DCtx_loadDictionary() :
+ *  Create an internal DDict from dict buffer,
+ *  to be used to decompress next frames.
+ *  The dictionary remains valid for all future frames, until explicitly invalidated.
+ * @result : 0, or an error code (which can be tested with ZSTD_isError()).
+ *  Special : Adding a NULL (or 0-size) dictionary invalidates any previous dictionary,
+ *            meaning "return to no-dictionary mode".
+ *  Note 1 : Loading a dictionary involves building tables,
+ *           which has a non-negligible impact on CPU usage and latency.
+ *           It's recommended to "load once, use many times", to amortize the cost
+ *  Note 2 :`dict` content will be copied internally, so `dict` can be released after loading.
+ *           Use ZSTD_DCtx_loadDictionary_byReference() to reference dictionary content instead.
+ *  Note 3 : Use ZSTD_DCtx_loadDictionary_advanced() to take control of
+ *           how dictionary content is loaded and interpreted.
+ */
+ZSTDLIB_API size_t ZSTD_DCtx_loadDictionary(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);
+
+/*! ZSTD_DCtx_refDDict() :
+ *  Reference a prepared dictionary, to be used to decompress next frames.
+ *  The dictionary remains active for decompression of future frames using same DCtx.
+ * @result : 0, or an error code (which can be tested with ZSTD_isError()).
+ *  Note 1 : Currently, only one dictionary can be managed.
+ *           Referencing a new dictionary effectively "discards" any previous one.
+ *  Special: referencing a NULL DDict means "return to no-dictionary mode".
+ *  Note 2 : DDict is just referenced, its lifetime must outlive its usage from DCtx.
+ */
+ZSTDLIB_API size_t ZSTD_DCtx_refDDict(ZSTD_DCtx* dctx, const ZSTD_DDict* ddict);
+
+/*! ZSTD_DCtx_refPrefix() :
+ *  Reference a prefix (single-usage dictionary) to decompress next frame.
+ *  This is the reverse operation of ZSTD_CCtx_refPrefix(),
+ *  and must use the same prefix as the one used during compression.
+ *  Prefix is **only used once**. Reference is discarded at end of frame.
+ *  End of frame is reached when ZSTD_decompressStream() returns 0.
+ * @result : 0, or an error code (which can be tested with ZSTD_isError()).
+ *  Note 1 : Adding any prefix (including NULL) invalidates any previously set prefix or dictionary
+ *  Note 2 : Prefix buffer is referenced. It **must** outlive decompression.
+ *           Prefix buffer must remain unmodified up to the end of frame,
+ *           reached when ZSTD_decompressStream() returns 0.
+ *  Note 3 : By default, the prefix is treated as raw content (ZSTD_dct_rawContent).
+ *           Use ZSTD_CCtx_refPrefix_advanced() to alter dictMode (Experimental section)
+ *  Note 4 : Referencing a raw content prefix has almost no cpu nor memory cost.
+ *           A full dictionary is more costly, as it requires building tables.
+ */
+ZSTDLIB_API size_t ZSTD_DCtx_refPrefix(ZSTD_DCtx* dctx,
+                                 const void* prefix, size_t prefixSize);
+
+/* ===   Memory management   === */
+
+/*! ZSTD_sizeof_*() :
+ *  These functions give the _current_ memory usage of selected object.
+ *  Note that object memory usage can evolve (increase or decrease) over time. */
+ZSTDLIB_API size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx);
+ZSTDLIB_API size_t ZSTD_sizeof_DCtx(const ZSTD_DCtx* dctx);
+ZSTDLIB_API size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);
+ZSTDLIB_API size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
+ZSTDLIB_API size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict);
+ZSTDLIB_API size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict);
+
+}
+#endif  /* ZSTD_H_235446 */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/bitstream.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/bitstream.h
new file mode 100644
index 0000000000..d532bbc508
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/bitstream.h
@@ -0,0 +1,449 @@
+/* ******************************************************************
+ * bitstream
+ * Part of FSE library
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ * You can contact the author at :
+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+#ifndef BITSTREAM_H_MODULE
+#define BITSTREAM_H_MODULE
+
+/*
+*  This API consists of small unitary functions, which must be inlined for best performance.
+*  Since link-time-optimization is not available for all compilers,
+*  these functions are defined into a .h to be included.
+*/
+
+/*-****************************************
+*  Dependencies
+******************************************/
+#include "zstd/common/mem.h"            /* unaligned access routines */
+#include "zstd/common/compiler.h"       /* UNLIKELY() */
+#include "zstd/common/debug.h"          /* assert(), DEBUGLOG(), RAWLOG() */
+#include "zstd/common/error_private.h"  /* error codes and messages */
+
+
+/*=========================================
+*  Target specific
+=========================================*/
+#if defined(__BMI__) && defined(__GNUC__)
+#  include <immintrin.h>   /* support for bextr (experimental) */
+#elif defined(__ICCARM__)
+#  include <intrinsics.h>
+#endif
+
+#define STREAM_ACCUMULATOR_MIN_32  25
+#define STREAM_ACCUMULATOR_MIN_64  57
+#define STREAM_ACCUMULATOR_MIN    ((U32)(MEM_32bits() ? STREAM_ACCUMULATOR_MIN_32 : STREAM_ACCUMULATOR_MIN_64))
+
+namespace lbug_zstd {
+
+/*-******************************************
+*  bitStream encoding API (write forward)
+********************************************/
+/* bitStream can mix input from multiple sources.
+ * A critical property of these streams is that they encode and decode in **reverse** direction.
+ * So the first bit sequence you add will be the last to be read, like a LIFO stack.
+ */
+typedef struct {
+    size_t bitContainer;
+    unsigned bitPos;
+    char*  startPtr;
+    char*  ptr;
+    char*  endPtr;
+} BIT_CStream_t;
+
+MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC, void* dstBuffer, size_t dstCapacity);
+MEM_STATIC void   BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
+MEM_STATIC void   BIT_flushBits(BIT_CStream_t* bitC);
+MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC);
+
+/* Start with initCStream, providing the size of buffer to write into.
+*  bitStream will never write outside of this buffer.
+*  `dstCapacity` must be >= sizeof(bitD->bitContainer), otherwise @return will be an error code.
+*
+*  bits are first added to a local register.
+*  Local register is size_t, hence 64-bits on 64-bits systems, or 32-bits on 32-bits systems.
+*  Writing data into memory is an explicit operation, performed by the flushBits function.
+*  Hence keep track how many bits are potentially stored into local register to avoid register overflow.
+*  After a flushBits, a maximum of 7 bits might still be stored into local register.
+*
+*  Avoid storing elements of more than 24 bits if you want compatibility with 32-bits bitstream readers.
+*
+*  Last operation is to close the bitStream.
+*  The function returns the final size of CStream in bytes.
+*  If data couldn't fit into `dstBuffer`, it will return a 0 ( == not storable)
+*/
+
+
+/*-********************************************
+*  bitStream decoding API (read backward)
+**********************************************/
+typedef struct {
+    size_t   bitContainer;
+    unsigned bitsConsumed;
+    const char* ptr;
+    const char* start;
+    const char* limitPtr;
+} BIT_DStream_t;
+
+typedef enum { BIT_DStream_unfinished = 0,
+               BIT_DStream_endOfBuffer = 1,
+               BIT_DStream_completed = 2,
+               BIT_DStream_overflow = 3 } BIT_DStream_status;  /* result of BIT_reloadDStream() */
+               /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
+
+MEM_STATIC size_t   BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize);
+MEM_STATIC size_t   BIT_readBits(BIT_DStream_t* bitD, unsigned nbBits);
+MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD);
+MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* bitD);
+
+
+/* Start by invoking BIT_initDStream().
+*  A chunk of the bitStream is then stored into a local register.
+*  Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
+*  You can then retrieve bitFields stored into the local register, **in reverse order**.
+*  Local register is explicitly reloaded from memory by the BIT_reloadDStream() method.
+*  A reload guarantee a minimum of ((8*sizeof(bitD->bitContainer))-7) bits when its result is BIT_DStream_unfinished.
+*  Otherwise, it can be less than that, so proceed accordingly.
+*  Checking if DStream has reached its end can be performed with BIT_endOfDStream().
+*/
+
+
+/*-****************************************
+*  unsafe API
+******************************************/
+MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
+/* faster, but works only if value is "clean", meaning all high bits above nbBits are 0 */
+
+MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC);
+/* unsafe version; does not check buffer overflow */
+
+MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, unsigned nbBits);
+/* faster, but works only if nbBits >= 1 */
+
+
+
+/*-**************************************************************
+*  Internal functions
+****************************************************************/
+MEM_STATIC unsigned BIT_highbit32 (U32 val)
+{
+    assert(val != 0);
+    {
+#   if defined(_MSC_VER)   /* Visual */
+        unsigned long r=0;
+        return _BitScanReverse ( &r, val ) ? (unsigned)r : 0;
+#   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* Use GCC Intrinsic */
+        return __builtin_clz (val) ^ 31;
+#   elif defined(__ICCARM__)    /* IAR Intrinsic */
+        return 31 - __CLZ(val);
+#   else   /* Software version */
+        static const unsigned DeBruijnClz[32] = { 0,  9,  1, 10, 13, 21,  2, 29,
+                                                 11, 14, 16, 18, 22, 25,  3, 30,
+                                                  8, 12, 20, 28, 15, 17, 24,  7,
+                                                 19, 27, 23,  6, 26,  5,  4, 31 };
+        U32 v = val;
+        v |= v >> 1;
+        v |= v >> 2;
+        v |= v >> 4;
+        v |= v >> 8;
+        v |= v >> 16;
+        return DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
+#   endif
+    }
+}
+
+/*=====    Local Constants   =====*/
+static const unsigned BIT_mask[] = {
+    0,          1,         3,         7,         0xF,       0x1F,
+    0x3F,       0x7F,      0xFF,      0x1FF,     0x3FF,     0x7FF,
+    0xFFF,      0x1FFF,    0x3FFF,    0x7FFF,    0xFFFF,    0x1FFFF,
+    0x3FFFF,    0x7FFFF,   0xFFFFF,   0x1FFFFF,  0x3FFFFF,  0x7FFFFF,
+    0xFFFFFF,   0x1FFFFFF, 0x3FFFFFF, 0x7FFFFFF, 0xFFFFFFF, 0x1FFFFFFF,
+    0x3FFFFFFF, 0x7FFFFFFF}; /* up to 31 bits */
+#define BIT_MASK_SIZE (sizeof(BIT_mask) / sizeof(BIT_mask[0]))
+
+/*-**************************************************************
+*  bitStream encoding
+****************************************************************/
+/*! BIT_initCStream() :
+ *  `dstCapacity` must be > sizeof(size_t)
+ *  @return : 0 if success,
+ *            otherwise an error code (can be tested using ERR_isError()) */
+MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC,
+                                  void* startPtr, size_t dstCapacity)
+{
+    bitC->bitContainer = 0;
+    bitC->bitPos = 0;
+    bitC->startPtr = (char*)startPtr;
+    bitC->ptr = bitC->startPtr;
+    bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->bitContainer);
+    if (dstCapacity <= sizeof(bitC->bitContainer)) return ERROR(dstSize_tooSmall);
+    return 0;
+}
+
+/*! BIT_addBits() :
+ *  can add up to 31 bits into `bitC`.
+ *  Note : does not check for register overflow ! */
+MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC,
+                            size_t value, unsigned nbBits)
+{
+    MEM_STATIC_ASSERT(BIT_MASK_SIZE == 32);
+    assert(nbBits < BIT_MASK_SIZE);
+    assert(nbBits + bitC->bitPos < sizeof(bitC->bitContainer) * 8);
+    bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
+    bitC->bitPos += nbBits;
+}
+
+/*! BIT_addBitsFast() :
+ *  works only if `value` is _clean_,
+ *  meaning all high bits above nbBits are 0 */
+MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC,
+                                size_t value, unsigned nbBits)
+{
+    assert((value>>nbBits) == 0);
+    assert(nbBits + bitC->bitPos < sizeof(bitC->bitContainer) * 8);
+    bitC->bitContainer |= value << bitC->bitPos;
+    bitC->bitPos += nbBits;
+}
+
+/*! BIT_flushBitsFast() :
+ *  assumption : bitContainer has not overflowed
+ *  unsafe version; does not check buffer overflow */
+MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC)
+{
+    size_t const nbBytes = bitC->bitPos >> 3;
+    assert(bitC->bitPos < sizeof(bitC->bitContainer) * 8);
+    assert(bitC->ptr <= bitC->endPtr);
+    MEM_writeLEST(bitC->ptr, bitC->bitContainer);
+    bitC->ptr += nbBytes;
+    bitC->bitPos &= 7;
+    bitC->bitContainer >>= nbBytes*8;
+}
+
+/*! BIT_flushBits() :
+ *  assumption : bitContainer has not overflowed
+ *  safe version; check for buffer overflow, and prevents it.
+ *  note : does not signal buffer overflow.
+ *  overflow will be revealed later on using BIT_closeCStream() */
+MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC)
+{
+    size_t const nbBytes = bitC->bitPos >> 3;
+    assert(bitC->bitPos < sizeof(bitC->bitContainer) * 8);
+    assert(bitC->ptr <= bitC->endPtr);
+    MEM_writeLEST(bitC->ptr, bitC->bitContainer);
+    bitC->ptr += nbBytes;
+    if (bitC->ptr > bitC->endPtr) bitC->ptr = bitC->endPtr;
+    bitC->bitPos &= 7;
+    bitC->bitContainer >>= nbBytes*8;
+}
+
+/*! BIT_closeCStream() :
+ *  @return : size of CStream, in bytes,
+ *            or 0 if it could not fit into dstBuffer */
+MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC)
+{
+    BIT_addBitsFast(bitC, 1, 1);   /* endMark */
+    BIT_flushBits(bitC);
+    if (bitC->ptr >= bitC->endPtr) return 0; /* overflow detected */
+    return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
+}
+
+
+/*-********************************************************
+*  bitStream decoding
+**********************************************************/
+/*! BIT_initDStream() :
+ *  Initialize a BIT_DStream_t.
+ * `bitD` : a pointer to an already allocated BIT_DStream_t structure.
+ * `srcSize` must be the *exact* size of the bitStream, in bytes.
+ * @return : size of stream (== srcSize), or an errorCode if a problem is detected
+ */
+MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize)
+{
+    if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }
+
+    bitD->start = (const char*)srcBuffer;
+    bitD->limitPtr = bitD->start + sizeof(bitD->bitContainer);
+
+    if (srcSize >=  sizeof(bitD->bitContainer)) {  /* normal case */
+        bitD->ptr   = (const char*)srcBuffer + srcSize - sizeof(bitD->bitContainer);
+        bitD->bitContainer = MEM_readLEST(bitD->ptr);
+        { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
+          bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;  /* ensures bitsConsumed is always set */
+          if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
+    } else {
+        bitD->ptr   = bitD->start;
+        bitD->bitContainer = *(const BYTE*)(bitD->start);
+        switch(srcSize)
+        {
+        case 7: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[6]) << (sizeof(bitD->bitContainer)*8 - 16);
+                /* fall-through */
+
+        case 6: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[5]) << (sizeof(bitD->bitContainer)*8 - 24);
+                /* fall-through */
+
+        case 5: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[4]) << (sizeof(bitD->bitContainer)*8 - 32);
+                /* fall-through */
+
+        case 4: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[3]) << 24;
+                /* fall-through */
+
+        case 3: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[2]) << 16;
+                /* fall-through */
+
+        case 2: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[1]) <<  8;
+                /* fall-through */
+
+        default: break;
+        }
+        {   BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
+            bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;
+            if (lastByte == 0) return ERROR(corruption_detected);  /* endMark not present */
+        }
+        bitD->bitsConsumed += (U32)(sizeof(bitD->bitContainer) - srcSize)*8;
+    }
+
+    return srcSize;
+}
+
+MEM_STATIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start)
+{
+    return bitContainer >> start;
+}
+
+MEM_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits)
+{
+    U32 const regMask = sizeof(bitContainer)*8 - 1;
+    /* if start > regMask, bitstream is corrupted, and result is undefined */
+    assert(nbBits < BIT_MASK_SIZE);
+    return (bitContainer >> (start & regMask)) & BIT_mask[nbBits];
+}
+
+MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
+{
+    assert(nbBits < BIT_MASK_SIZE);
+    return bitContainer & BIT_mask[nbBits];
+}
+
+/*! BIT_lookBits() :
+ *  Provides next n bits from local register.
+ *  local register is not modified.
+ *  On 32-bits, maxNbBits==24.
+ *  On 64-bits, maxNbBits==56.
+ * @return : value extracted */
+MEM_STATIC size_t BIT_lookBits(const BIT_DStream_t* bitD, U32 nbBits)
+{
+    /* arbitrate between double-shift and shift+mask */
+#if 1
+    /* if bitD->bitsConsumed + nbBits > sizeof(bitD->bitContainer)*8,
+     * bitstream is likely corrupted, and result is undefined */
+    return BIT_getMiddleBits(bitD->bitContainer, (sizeof(bitD->bitContainer)*8) - bitD->bitsConsumed - nbBits, nbBits);
+#else
+    /* this code path is slower on my os-x laptop */
+    U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
+    return ((bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> 1) >> ((regMask-nbBits) & regMask);
+#endif
+}
+
+/*! BIT_lookBitsFast() :
+ *  unsafe version; only works if nbBits >= 1 */
+MEM_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t* bitD, U32 nbBits)
+{
+    U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
+    assert(nbBits >= 1);
+    return (bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> (((regMask+1)-nbBits) & regMask);
+}
+
+MEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)
+{
+    bitD->bitsConsumed += nbBits;
+}
+
+/*! BIT_readBits() :
+ *  Read (consume) next n bits from local register and update.
+ *  Pay attention to not read more than nbBits contained into local register.
+ * @return : extracted value. */
+MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, unsigned nbBits)
+{
+    size_t const value = BIT_lookBits(bitD, nbBits);
+    BIT_skipBits(bitD, nbBits);
+    return value;
+}
+
+/*! BIT_readBitsFast() :
+ *  unsafe version; only works only if nbBits >= 1 */
+MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, unsigned nbBits)
+{
+    size_t const value = BIT_lookBitsFast(bitD, nbBits);
+    assert(nbBits >= 1);
+    BIT_skipBits(bitD, nbBits);
+    return value;
+}
+
+/*! BIT_reloadDStreamFast() :
+ *  Similar to BIT_reloadDStream(), but with two differences:
+ *  1. bitsConsumed <= sizeof(bitD->bitContainer)*8 must hold!
+ *  2. Returns BIT_DStream_overflow when bitD->ptr < bitD->limitPtr, at this
+ *     point you must use BIT_reloadDStream() to reload.
+ */
+MEM_STATIC BIT_DStream_status BIT_reloadDStreamFast(BIT_DStream_t* bitD)
+{
+    if (UNLIKELY(bitD->ptr < bitD->limitPtr))
+        return BIT_DStream_overflow;
+    assert(bitD->bitsConsumed <= sizeof(bitD->bitContainer)*8);
+    bitD->ptr -= bitD->bitsConsumed >> 3;
+    bitD->bitsConsumed &= 7;
+    bitD->bitContainer = MEM_readLEST(bitD->ptr);
+    return BIT_DStream_unfinished;
+}
+
+/*! BIT_reloadDStream() :
+ *  Refill `bitD` from buffer previously set in BIT_initDStream() .
+ *  This function is safe, it guarantees it will not read beyond src buffer.
+ * @return : status of `BIT_DStream_t` internal register.
+ *           when status == BIT_DStream_unfinished, internal register is filled with at least 25 or 57 bits */
+MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
+{
+    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* overflow detected, like end of stream */
+        return BIT_DStream_overflow;
+
+    if (bitD->ptr >= bitD->limitPtr) {
+        return BIT_reloadDStreamFast(bitD);
+    }
+    if (bitD->ptr == bitD->start) {
+        if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;
+        return BIT_DStream_completed;
+    }
+    /* start < ptr < limitPtr */
+    {   U32 nbBytes = bitD->bitsConsumed >> 3;
+        BIT_DStream_status result = BIT_DStream_unfinished;
+        if (bitD->ptr - nbBytes < bitD->start) {
+            nbBytes = (U32)(bitD->ptr - bitD->start);  /* ptr > start */
+            result = BIT_DStream_endOfBuffer;
+        }
+        bitD->ptr -= nbBytes;
+        bitD->bitsConsumed -= nbBytes*8;
+        bitD->bitContainer = MEM_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD->bitContainer), otherwise bitD->ptr == bitD->start */
+        return result;
+    }
+}
+
+/*! BIT_endOfDStream() :
+ * @return : 1 if DStream has _exactly_ reached its end (all bits consumed).
+ */
+MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* DStream)
+{
+    return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));
+}
+
+}
+
+#endif /* BITSTREAM_H_MODULE */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/compiler.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/compiler.h
new file mode 100644
index 0000000000..b94dbad133
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/compiler.h
@@ -0,0 +1,173 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_COMPILER_H
+#define ZSTD_COMPILER_H
+
+/*-*******************************************************
+*  Compiler specifics
+*********************************************************/
+/* force inlining */
+
+#if !defined(ZSTD_NO_INLINE)
+#if (defined(__GNUC__) && !defined(__STRICT_ANSI__)) || defined(__cplusplus) || defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
+#  define INLINE_KEYWORD inline
+#else
+#  define INLINE_KEYWORD
+#endif
+
+#if defined(__GNUC__) || defined(__ICCARM__)
+#  define FORCE_INLINE_ATTR __attribute__((always_inline))
+#elif defined(_MSC_VER)
+#  define FORCE_INLINE_ATTR __forceinline
+#else
+#  define FORCE_INLINE_ATTR
+#endif
+
+#else
+
+#define INLINE_KEYWORD
+#define FORCE_INLINE_ATTR
+
+#endif
+
+/**
+ * FORCE_INLINE_TEMPLATE is used to define C "templates", which take constant
+ * parameters. They must be inlined for the compiler to eliminate the constant
+ * branches.
+ */
+#define FORCE_INLINE_TEMPLATE static INLINE_KEYWORD FORCE_INLINE_ATTR
+/**
+ * HINT_INLINE is used to help the compiler generate better code. It is *not*
+ * used for "templates", so it can be tweaked based on the compilers
+ * performance.
+ *
+ * gcc-4.8 and gcc-4.9 have been shown to benefit from leaving off the
+ * always_inline attribute.
+ *
+ * clang up to 5.0.0 (trunk) benefit tremendously from the always_inline
+ * attribute.
+ */
+#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ >= 4 && __GNUC_MINOR__ >= 8 && __GNUC__ < 5
+#  define HINT_INLINE static INLINE_KEYWORD
+#else
+#  define HINT_INLINE static INLINE_KEYWORD FORCE_INLINE_ATTR
+#endif
+
+/* UNUSED_ATTR tells the compiler it is okay if the function is unused. */
+#if defined(__GNUC__)
+#  define UNUSED_ATTR __attribute__((unused))
+#else
+#  define UNUSED_ATTR
+#endif
+
+/* force no inlining */
+#ifdef _MSC_VER
+#  define FORCE_NOINLINE static __declspec(noinline)
+#else
+#  if defined(__GNUC__) || defined(__ICCARM__)
+#    define FORCE_NOINLINE static __attribute__((__noinline__))
+#  else
+#    define FORCE_NOINLINE static
+#  endif
+#endif
+
+/* target attribute */
+#ifndef __has_attribute
+  #define __has_attribute(x) 0  /* Compatibility with non-clang compilers. */
+#endif
+#if defined(__GNUC__) || defined(__ICCARM__)
+#  define TARGET_ATTRIBUTE(target) __attribute__((__target__(target)))
+#else
+#  define TARGET_ATTRIBUTE(target)
+#endif
+
+/* Enable runtime BMI2 dispatch based on the CPU.
+ * Enabled for clang & gcc >=4.8 on x86 when BMI2 isn't enabled by default.
+ */
+#ifndef DYNAMIC_BMI2
+  #if ((defined(__clang__) && __has_attribute(__target__)) \
+      || (defined(__GNUC__) \
+          && (__GNUC__ >= 5 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 8)))) \
+      && (defined(__x86_64__) || defined(_M_X86)) \
+      && !defined(__BMI2__)
+  #  define DYNAMIC_BMI2 1
+  #else
+  #  define DYNAMIC_BMI2 0
+  #endif
+#endif
+
+/* prefetch
+ * can be disabled, by declaring NO_PREFETCH build macro */
+#if defined(NO_PREFETCH)
+#  define PREFETCH_L1(ptr)  (void)(ptr)  /* disabled */
+#  define PREFETCH_L2(ptr)  (void)(ptr)  /* disabled */
+#else
+#  if defined(_MSC_VER) && (defined(_M_X64) || defined(_M_I86))  /* _mm_prefetch() is not defined outside of x86/x64 */
+#    include <mmintrin.h>   /* https://msdn.microsoft.com/fr-fr/library/84szxsww(v=vs.90).aspx */
+#    define PREFETCH_L1(ptr)  _mm_prefetch((const char*)(ptr), _MM_HINT_T0)
+#    define PREFETCH_L2(ptr)  _mm_prefetch((const char*)(ptr), _MM_HINT_T1)
+#    elif defined(__aarch64__)
+#     define PREFETCH_L1(ptr)  __asm__ __volatile__("prfm pldl1keep, %0" ::"Q"(*(ptr)))
+#     define PREFETCH_L2(ptr)  __asm__ __volatile__("prfm pldl2keep, %0" ::"Q"(*(ptr)))
+#  elif defined(__GNUC__) && ( (__GNUC__ >= 4) || ( (__GNUC__ == 3) && (__GNUC_MINOR__ >= 1) ) )
+#    define PREFETCH_L1(ptr)  __builtin_prefetch((ptr), 0 /* rw==read */, 3 /* locality */)
+#    define PREFETCH_L2(ptr)  __builtin_prefetch((ptr), 0 /* rw==read */, 2 /* locality */)
+#  else
+#    define PREFETCH_L1(ptr) (void)(ptr)  /* disabled */
+#    define PREFETCH_L2(ptr) (void)(ptr)  /* disabled */
+#  endif
+#endif  /* NO_PREFETCH */
+
+#define CACHELINE_SIZE 64
+
+#define PREFETCH_AREA(p, s)  {            \
+    const char* const _ptr = (const char*)(p);  \
+    size_t const _size = (size_t)(s);     \
+    size_t _pos;                          \
+    for (_pos=0; _pos<_size; _pos+=CACHELINE_SIZE) {  \
+        PREFETCH_L2(_ptr + _pos);         \
+    }                                     \
+}
+
+/* vectorization
+ * older GCC (pre gcc-4.3 picked as the cutoff) uses a different syntax */
+#if !defined(__INTEL_COMPILER) && !defined(__clang__) && defined(__GNUC__)
+#  if (__GNUC__ == 4 && __GNUC_MINOR__ > 3) || (__GNUC__ >= 5)
+#    define DONT_VECTORIZE __attribute__((optimize("no-tree-vectorize")))
+#  else
+#    define DONT_VECTORIZE _Pragma("GCC optimize(\"no-tree-vectorize\")")
+#  endif
+#else
+#  define DONT_VECTORIZE
+#endif
+
+/* Tell the compiler that a branch is likely or unlikely.
+ * Only use these macros if it causes the compiler to generate better code.
+ * If you can remove a LIKELY/UNLIKELY annotation without speed changes in gcc
+ * and clang, please do.
+ */
+#if defined(__GNUC__)
+#ifndef LIKELY
+#define LIKELY(x) (__builtin_expect((x), 1))
+#endif
+#ifndef UNLIKELY
+#define UNLIKELY(x) (__builtin_expect((x), 0))
+#endif
+#else
+#ifndef LIKELY
+#define LIKELY(x) (x)
+#endif
+#ifndef UNLIKELY
+#define UNLIKELY(x) (x)
+#endif
+#endif
+
+#endif /* ZSTD_COMPILER_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/debug.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/debug.h
new file mode 100644
index 0000000000..ac6224888d
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/debug.h
@@ -0,0 +1,114 @@
+/* ******************************************************************
+ * debug
+ * Part of FSE library
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ * You can contact the author at :
+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+
+/*
+ * The purpose of this header is to enable debug functions.
+ * They regroup assert(), DEBUGLOG() and RAWLOG() for run-time,
+ * and DEBUG_STATIC_ASSERT() for compile-time.
+ *
+ * By default, DEBUGLEVEL==0, which means run-time debug is disabled.
+ *
+ * Level 1 enables assert() only.
+ * Starting level 2, traces can be generated and pushed to stderr.
+ * The higher the level, the more verbose the traces.
+ *
+ * It's possible to dynamically adjust level using variable g_debug_level,
+ * which is only declared if DEBUGLEVEL>=2,
+ * and is a global variable, not multi-thread protected (use with care)
+ */
+
+#ifndef DEBUG_H_12987983217
+#define DEBUG_H_12987983217
+
+#if defined (__cplusplus)
+extern "C" {
+#endif
+
+
+/* static assert is triggered at compile time, leaving no runtime artefact.
+ * static assert only works with compile-time constants.
+ * Also, this variant can only be used inside a function. */
+#define DEBUG_STATIC_ASSERT(c) (void)sizeof(char[(c) ? 1 : -1])
+
+
+/* DEBUGLEVEL is expected to be defined externally,
+ * typically through compiler command line.
+ * Value must be a number. */
+#ifndef DEBUGLEVEL
+#  define DEBUGLEVEL 0
+#endif
+
+
+/* DEBUGFILE can be defined externally,
+ * typically through compiler command line.
+ * note : currently useless.
+ * Value must be stderr or stdout */
+#ifndef DEBUGFILE
+#  define DEBUGFILE stderr
+#endif
+
+
+/* recommended values for DEBUGLEVEL :
+ * 0 : release mode, no debug, all run-time checks disabled
+ * 1 : enables assert() only, no display
+ * 2 : reserved, for currently active debug path
+ * 3 : events once per object lifetime (CCtx, CDict, etc.)
+ * 4 : events once per frame
+ * 5 : events once per block
+ * 6 : events once per sequence (verbose)
+ * 7+: events at every position (*very* verbose)
+ *
+ * It's generally inconvenient to output traces > 5.
+ * In which case, it's possible to selectively trigger high verbosity levels
+ * by modifying g_debug_level.
+ */
+
+#if (DEBUGLEVEL>=1)
+#  include <assert.h>
+#else
+#  ifndef assert   /* assert may be already defined, due to prior #include <assert.h> */
+#    define assert(condition) ((void)0)   /* disable assert (default) */
+#  endif
+#endif
+
+#if (DEBUGLEVEL>=2)
+#  include <stdio.h>
+extern int g_debuglevel; /* the variable is only declared,
+                            it actually lives in debug.c,
+                            and is shared by the whole process.
+                            It's not thread-safe.
+                            It's useful when enabling very verbose levels
+                            on selective conditions (such as position in src) */
+
+#  define RAWLOG(l, ...) {                                      \
+                if (l<=g_debuglevel) {                          \
+                    fprintf(stderr, __VA_ARGS__);               \
+            }   }
+#  define DEBUGLOG(l, ...) {                                    \
+                if (l<=g_debuglevel) {                          \
+                    fprintf(stderr, __FILE__ ": " __VA_ARGS__); \
+                    fprintf(stderr, " \n");                     \
+            }   }
+#else
+#  define RAWLOG(l, ...)      {}    /* disabled */
+#  define DEBUGLOG(l, ...)    {}    /* disabled */
+#endif
+
+
+#if defined (__cplusplus)
+}
+#endif
+
+#endif /* DEBUG_H_12987983217 */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/error_private.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/error_private.h
new file mode 100644
index 0000000000..5699607844
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/error_private.h
@@ -0,0 +1,73 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+/* Note : this module is expected to remain private, do not expose it */
+
+#ifndef ERROR_H_MODULE
+#define ERROR_H_MODULE
+
+/* ****************************************
+*  Dependencies
+******************************************/
+#include <stddef.h>        /* size_t */
+#include "zstd/common/zstd_errors.h"  /* enum list */
+
+namespace lbug_zstd {
+/* ****************************************
+*  Compiler-specific
+******************************************/
+#if defined(__GNUC__)
+#  define ERR_STATIC static __attribute__((unused))
+#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
+#  define ERR_STATIC static inline
+#elif defined(_MSC_VER)
+#  define ERR_STATIC static __inline
+#else
+#  define ERR_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
+#endif
+
+
+/*-****************************************
+*  Customization (error_public.h)
+******************************************/
+typedef ZSTD_ErrorCode ERR_enum;
+#define PREFIX(name) ZSTD_error_##name
+
+
+/*-****************************************
+*  Error codes handling
+******************************************/
+#undef ERROR   /* already defined on Visual Studio */
+#define ERROR(name) ZSTD_ERROR(name)
+#define ZSTD_ERROR(name) ((size_t)-PREFIX(name))
+
+ERR_STATIC unsigned ERR_isError(size_t code) { return (code > ERROR(maxCode)); }
+
+ERR_STATIC ERR_enum ERR_getErrorCode(size_t code) { if (!ERR_isError(code)) return (ERR_enum)0; return (ERR_enum) (0-code); }
+
+/* check and forward error code */
+#define CHECK_V_F(e, f) size_t const e = f; if (ERR_isError(e)) return e
+#define CHECK_F(f)   { CHECK_V_F(_var_err__, f); }
+
+
+/*-****************************************
+*  Error Strings
+******************************************/
+
+const char* ERR_getErrorString(ERR_enum code);   /* error_private.c */
+
+ERR_STATIC const char* ERR_getErrorName(size_t code)
+{
+    return ERR_getErrorString(ERR_getErrorCode(code));
+}
+
+}
+
+#endif /* ERROR_H_MODULE */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/fse.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/fse.h
new file mode 100644
index 0000000000..69820369f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/fse.h
@@ -0,0 +1,277 @@
+/* ******************************************************************
+ * FSE : Finite State Entropy codec
+ * Public Prototypes declaration
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ * You can contact the author at :
+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+#ifndef FSE_H
+#define FSE_H
+
+
+/*-*****************************************
+*  Dependencies
+******************************************/
+#include <stddef.h>    /* size_t, ptrdiff_t */
+
+
+namespace lbug_zstd {
+/*-*****************************************
+*  FSE_PUBLIC_API : control library symbols visibility
+******************************************/
+#if defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1) && defined(__GNUC__) && (__GNUC__ >= 4)
+#  define FSE_PUBLIC_API __attribute__ ((visibility ("default")))
+#elif defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1)   /* Visual expected */
+#  define FSE_PUBLIC_API __declspec(dllexport)
+#elif defined(FSE_DLL_IMPORT) && (FSE_DLL_IMPORT==1)
+#  define FSE_PUBLIC_API __declspec(dllimport) /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
+#else
+#  define FSE_PUBLIC_API
+#endif
+
+/*------   Version   ------*/
+#define FSE_VERSION_MAJOR    0
+#define FSE_VERSION_MINOR    9
+#define FSE_VERSION_RELEASE  0
+
+#define FSE_LIB_VERSION FSE_VERSION_MAJOR.FSE_VERSION_MINOR.FSE_VERSION_RELEASE
+#define FSE_QUOTE(str) #str
+#define FSE_EXPAND_AND_QUOTE(str) FSE_QUOTE(str)
+#define FSE_VERSION_STRING FSE_EXPAND_AND_QUOTE(FSE_LIB_VERSION)
+
+#define FSE_VERSION_NUMBER  (FSE_VERSION_MAJOR *100*100 + FSE_VERSION_MINOR *100 + FSE_VERSION_RELEASE)
+FSE_PUBLIC_API unsigned FSE_versionNumber(void);   /**< library version number; to be used when checking dll version */
+
+
+/*-****************************************
+*  FSE simple functions
+******************************************/
+/*! FSE_compress() :
+    Compress content of buffer 'src', of size 'srcSize', into destination buffer 'dst'.
+    'dst' buffer must be already allocated. Compression runs faster is dstCapacity >= FSE_compressBound(srcSize).
+    @return : size of compressed data (<= dstCapacity).
+    Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
+                     if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression instead.
+                     if FSE_isError(return), compression failed (more details using FSE_getErrorName())
+*/
+FSE_PUBLIC_API size_t FSE_compress(void* dst, size_t dstCapacity,
+                             const void* src, size_t srcSize);
+
+/*! FSE_decompress():
+    Decompress FSE data from buffer 'cSrc', of size 'cSrcSize',
+    into already allocated destination buffer 'dst', of size 'dstCapacity'.
+    @return : size of regenerated data (<= maxDstSize),
+              or an error code, which can be tested using FSE_isError() .
+
+    ** Important ** : FSE_decompress() does not decompress non-compressible nor RLE data !!!
+    Why ? : making this distinction requires a header.
+    Header management is intentionally delegated to the user layer, which can better manage special cases.
+*/
+FSE_PUBLIC_API size_t FSE_decompress(void* dst,  size_t dstCapacity,
+                               const void* cSrc, size_t cSrcSize);
+
+
+/*-*****************************************
+*  Tool functions
+******************************************/
+FSE_PUBLIC_API size_t FSE_compressBound(size_t size);       /* maximum compressed size */
+
+/* Error Management */
+FSE_PUBLIC_API unsigned    FSE_isError(size_t code);        /* tells if a return value is an error code */
+FSE_PUBLIC_API const char* FSE_getErrorName(size_t code);   /* provides error code string (useful for debugging) */
+
+
+/*-*****************************************
+*  FSE advanced functions
+******************************************/
+/*! FSE_compress2() :
+    Same as FSE_compress(), but allows the selection of 'maxSymbolValue' and 'tableLog'
+    Both parameters can be defined as '0' to mean : use default value
+    @return : size of compressed data
+    Special values : if return == 0, srcData is not compressible => Nothing is stored within cSrc !!!
+                     if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression.
+                     if FSE_isError(return), it's an error code.
+*/
+FSE_PUBLIC_API size_t FSE_compress2 (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
+
+
+/*-*****************************************
+*  FSE detailed API
+******************************************/
+/*!
+FSE_compress() does the following:
+1. count symbol occurrence from source[] into table count[] (see hist.h)
+2. normalize counters so that sum(count[]) == Power_of_2 (2^tableLog)
+3. save normalized counters to memory buffer using writeNCount()
+4. build encoding table 'CTable' from normalized counters
+5. encode the data stream using encoding table 'CTable'
+
+FSE_decompress() does the following:
+1. read normalized counters with readNCount()
+2. build decoding table 'DTable' from normalized counters
+3. decode the data stream using decoding table 'DTable'
+
+The following API allows targeting specific sub-functions for advanced tasks.
+For example, it's possible to compress several blocks using the same 'CTable',
+or to save and provide normalized distribution using external method.
+*/
+
+/* *** COMPRESSION *** */
+
+/*! FSE_optimalTableLog():
+    dynamically downsize 'tableLog' when conditions are met.
+    It saves CPU time, by using smaller tables, while preserving or even improving compression ratio.
+    @return : recommended tableLog (necessarily <= 'maxTableLog') */
+FSE_PUBLIC_API unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
+
+/*! FSE_normalizeCount():
+    normalize counts so that sum(count[]) == Power_of_2 (2^tableLog)
+    'normalizedCounter' is a table of short, of minimum size (maxSymbolValue+1).
+    @return : tableLog,
+              or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_normalizeCount(short* normalizedCounter, unsigned tableLog,
+                    const unsigned* count, size_t srcSize, unsigned maxSymbolValue);
+
+/*! FSE_NCountWriteBound():
+    Provides the maximum possible size of an FSE normalized table, given 'maxSymbolValue' and 'tableLog'.
+    Typically useful for allocation purpose. */
+FSE_PUBLIC_API size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog);
+
+/*! FSE_writeNCount():
+    Compactly save 'normalizedCounter' into 'buffer'.
+    @return : size of the compressed table,
+              or an errorCode, which can be tested using FSE_isError(). */
+FSE_PUBLIC_API size_t FSE_writeNCount (void* buffer, size_t bufferSize,
+                                 const short* normalizedCounter,
+                                 unsigned maxSymbolValue, unsigned tableLog);
+
+/*! Constructor and Destructor of FSE_CTable.
+    Note that FSE_CTable size depends on 'tableLog' and 'maxSymbolValue' */
+typedef unsigned FSE_CTable;   /* don't allocate that. It's only meant to be more restrictive than void* */
+FSE_PUBLIC_API FSE_CTable* FSE_createCTable (unsigned maxSymbolValue, unsigned tableLog);
+FSE_PUBLIC_API void        FSE_freeCTable (FSE_CTable* ct);
+
+/*! FSE_buildCTable():
+    Builds `ct`, which must be already allocated, using FSE_createCTable().
+    @return : 0, or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
+
+/*! FSE_compress_usingCTable():
+    Compress `src` using `ct` into `dst` which must be already allocated.
+    @return : size of compressed data (<= `dstCapacity`),
+              or 0 if compressed data could not fit into `dst`,
+              or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_compress_usingCTable (void* dst, size_t dstCapacity, const void* src, size_t srcSize, const FSE_CTable* ct);
+
+/*!
+Tutorial :
+----------
+The first step is to count all symbols. FSE_count() does this job very fast.
+Result will be saved into 'count', a table of unsigned int, which must be already allocated, and have 'maxSymbolValuePtr[0]+1' cells.
+'src' is a table of bytes of size 'srcSize'. All values within 'src' MUST be <= maxSymbolValuePtr[0]
+maxSymbolValuePtr[0] will be updated, with its real value (necessarily <= original value)
+FSE_count() will return the number of occurrence of the most frequent symbol.
+This can be used to know if there is a single symbol within 'src', and to quickly evaluate its compressibility.
+If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
+
+The next step is to normalize the frequencies.
+FSE_normalizeCount() will ensure that sum of frequencies is == 2 ^'tableLog'.
+It also guarantees a minimum of 1 to any Symbol with frequency >= 1.
+You can use 'tableLog'==0 to mean "use default tableLog value".
+If you are unsure of which tableLog value to use, you can ask FSE_optimalTableLog(),
+which will provide the optimal valid tableLog given sourceSize, maxSymbolValue, and a user-defined maximum (0 means "default").
+
+The result of FSE_normalizeCount() will be saved into a table,
+called 'normalizedCounter', which is a table of signed short.
+'normalizedCounter' must be already allocated, and have at least 'maxSymbolValue+1' cells.
+The return value is tableLog if everything proceeded as expected.
+It is 0 if there is a single symbol within distribution.
+If there is an error (ex: invalid tableLog value), the function will return an ErrorCode (which can be tested using FSE_isError()).
+
+'normalizedCounter' can be saved in a compact manner to a memory area using FSE_writeNCount().
+'buffer' must be already allocated.
+For guaranteed success, buffer size must be at least FSE_headerBound().
+The result of the function is the number of bytes written into 'buffer'.
+If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError(); ex : buffer size too small).
+
+'normalizedCounter' can then be used to create the compression table 'CTable'.
+The space required by 'CTable' must be already allocated, using FSE_createCTable().
+You can then use FSE_buildCTable() to fill 'CTable'.
+If there is an error, both functions will return an ErrorCode (which can be tested using FSE_isError()).
+
+'CTable' can then be used to compress 'src', with FSE_compress_usingCTable().
+Similar to FSE_count(), the convention is that 'src' is assumed to be a table of char of size 'srcSize'
+The function returns the size of compressed data (without header), necessarily <= `dstCapacity`.
+If it returns '0', compressed data could not fit into 'dst'.
+If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
+*/
+
+
+/* *** DECOMPRESSION *** */
+
+/*! FSE_readNCount():
+    Read compactly saved 'normalizedCounter' from 'rBuffer'.
+    @return : size read from 'rBuffer',
+              or an errorCode, which can be tested using FSE_isError().
+              maxSymbolValuePtr[0] and tableLogPtr[0] will also be updated with their respective values */
+FSE_PUBLIC_API size_t FSE_readNCount (short* normalizedCounter,
+                           unsigned* maxSymbolValuePtr, unsigned* tableLogPtr,
+                           const void* rBuffer, size_t rBuffSize);
+
+/*! Constructor and Destructor of FSE_DTable.
+    Note that its size depends on 'tableLog' */
+typedef unsigned FSE_DTable;   /* don't allocate that. It's just a way to be more restrictive than void* */
+FSE_PUBLIC_API FSE_DTable* FSE_createDTable(unsigned tableLog);
+FSE_PUBLIC_API void        FSE_freeDTable(FSE_DTable* dt);
+
+/*! FSE_buildDTable():
+    Builds 'dt', which must be already allocated, using FSE_createDTable().
+    return : 0, or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_buildDTable (FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
+
+/*! FSE_decompress_usingDTable():
+    Decompress compressed source `cSrc` of size `cSrcSize` using `dt`
+    into `dst` which must be already allocated.
+    @return : size of regenerated data (necessarily <= `dstCapacity`),
+              or an errorCode, which can be tested using FSE_isError() */
+FSE_PUBLIC_API size_t FSE_decompress_usingDTable(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, const FSE_DTable* dt);
+
+/*!
+Tutorial :
+----------
+(Note : these functions only decompress FSE-compressed blocks.
+ If block is uncompressed, use memcpy() instead
+ If block is a single repeated byte, use memset() instead )
+
+The first step is to obtain the normalized frequencies of symbols.
+This can be performed by FSE_readNCount() if it was saved using FSE_writeNCount().
+'normalizedCounter' must be already allocated, and have at least 'maxSymbolValuePtr[0]+1' cells of signed short.
+In practice, that means it's necessary to know 'maxSymbolValue' beforehand,
+or size the table to handle worst case situations (typically 256).
+FSE_readNCount() will provide 'tableLog' and 'maxSymbolValue'.
+The result of FSE_readNCount() is the number of bytes read from 'rBuffer'.
+Note that 'rBufferSize' must be at least 4 bytes, even if useful information is less than that.
+If there is an error, the function will return an error code, which can be tested using FSE_isError().
+
+The next step is to build the decompression tables 'FSE_DTable' from 'normalizedCounter'.
+This is performed by the function FSE_buildDTable().
+The space required by 'FSE_DTable' must be already allocated using FSE_createDTable().
+If there is an error, the function will return an error code, which can be tested using FSE_isError().
+
+`FSE_DTable` can then be used to decompress `cSrc`, with FSE_decompress_usingDTable().
+`cSrcSize` must be strictly correct, otherwise decompression will fail.
+FSE_decompress_usingDTable() result will tell how many bytes were regenerated (<=`dstCapacity`).
+If there is an error, the function will return an error code, which can be tested using FSE_isError(). (ex: dst buffer too small)
+*/
+
+}
+
+#endif  /* FSE_H */
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/fse_static.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/fse_static.h
new file mode 100644
index 0000000000..8a18e1df01
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/fse_static.h
@@ -0,0 +1,421 @@
+/* ******************************************************************
+ * FSE : Finite State Entropy codec
+ * Public Prototypes declaration
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ * You can contact the author at :
+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+#ifndef FSE_H_FSE_STATIC_LINKING_ONLY
+#define FSE_H_FSE_STATIC_LINKING_ONLY
+
+/* *** Dependency *** */
+#include "zstd/common/bitstream.h"
+
+namespace lbug_zstd {
+
+/* *****************************************
+*  Static allocation
+*******************************************/
+/* FSE buffer bounds */
+#define FSE_NCOUNTBOUND 512
+#define FSE_BLOCKBOUND(size) (size + (size>>7) + 4 /* fse states */ + sizeof(size_t) /* bitContainer */)
+#define FSE_COMPRESSBOUND(size) (FSE_NCOUNTBOUND + FSE_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
+
+/* It is possible to statically allocate FSE CTable/DTable as a table of FSE_CTable/FSE_DTable using below macros */
+#define FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue)   (1 + (1<<(maxTableLog-1)) + ((maxSymbolValue+1)*2))
+#define FSE_DTABLE_SIZE_U32(maxTableLog)                   (1 + (1<<maxTableLog))
+
+/* or use the size to malloc() space directly. Pay attention to alignment restrictions though */
+#define FSE_CTABLE_SIZE(maxTableLog, maxSymbolValue)   (FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) * sizeof(FSE_CTable))
+#define FSE_DTABLE_SIZE(maxTableLog)                   (FSE_DTABLE_SIZE_U32(maxTableLog) * sizeof(FSE_DTable))
+
+
+/* *****************************************
+ *  FSE advanced API
+ ***************************************** */
+
+unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus);
+/**< same as FSE_optimalTableLog(), which used `minus==2` */
+
+/* FSE_compress_wksp() :
+ * Same as FSE_compress2(), but using an externally allocated scratch buffer (`workSpace`).
+ * FSE_WKSP_SIZE_U32() provides the minimum size required for `workSpace` as a table of FSE_CTable.
+ */
+#define FSE_WKSP_SIZE_U32(maxTableLog, maxSymbolValue)   ( FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) + ((maxTableLog > 12) ? (1 << (maxTableLog - 2)) : 1024) )
+size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);
+
+size_t FSE_buildCTable_raw (FSE_CTable* ct, unsigned nbBits);
+/**< build a fake FSE_CTable, designed for a flat distribution, where each symbol uses nbBits */
+
+size_t FSE_buildCTable_rle (FSE_CTable* ct, unsigned char symbolValue);
+/**< build a fake FSE_CTable, designed to compress always the same symbolValue */
+
+/* FSE_buildCTable_wksp() :
+ * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
+ * `wkspSize` must be >= `(1<<tableLog)`.
+ */
+size_t FSE_buildCTable_wksp(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);
+
+size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits);
+/**< build a fake FSE_DTable, designed to read a flat distribution where each symbol uses nbBits */
+
+size_t FSE_buildDTable_rle (FSE_DTable* dt, unsigned char symbolValue);
+/**< build a fake FSE_DTable, designed to always generate the same symbolValue */
+
+size_t FSE_decompress_wksp(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, FSE_DTable* workSpace, unsigned maxLog);
+/**< same as FSE_decompress(), using an externally allocated `workSpace` produced with `FSE_DTABLE_SIZE_U32(maxLog)` */
+
+typedef enum {
+   FSE_repeat_none,  /**< Cannot use the previous table */
+   FSE_repeat_check, /**< Can use the previous table but it must be checked */
+   FSE_repeat_valid  /**< Can use the previous table and it is assumed to be valid */
+ } FSE_repeat;
+
+/* *****************************************
+*  FSE symbol compression API
+*******************************************/
+/*!
+   This API consists of small unitary functions, which highly benefit from being inlined.
+   Hence their body are included in next section.
+*/
+typedef struct {
+    ptrdiff_t   value;
+    const void* stateTable;
+    const void* symbolTT;
+    unsigned    stateLog;
+} FSE_CState_t;
+
+static void FSE_initCState(FSE_CState_t* CStatePtr, const FSE_CTable* ct);
+
+static void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* CStatePtr, unsigned symbol);
+
+static void FSE_flushCState(BIT_CStream_t* bitC, const FSE_CState_t* CStatePtr);
+
+/**<
+These functions are inner components of FSE_compress_usingCTable().
+They allow the creation of custom streams, mixing multiple tables and bit sources.
+
+A key property to keep in mind is that encoding and decoding are done **in reverse direction**.
+So the first symbol you will encode is the last you will decode, like a LIFO stack.
+
+You will need a few variables to track your CStream. They are :
+
+FSE_CTable    ct;         // Provided by FSE_buildCTable()
+BIT_CStream_t bitStream;  // bitStream tracking structure
+FSE_CState_t  state;      // State tracking structure (can have several)
+
+
+The first thing to do is to init bitStream and state.
+    size_t errorCode = BIT_initCStream(&bitStream, dstBuffer, maxDstSize);
+    FSE_initCState(&state, ct);
+
+Note that BIT_initCStream() can produce an error code, so its result should be tested, using FSE_isError();
+You can then encode your input data, byte after byte.
+FSE_encodeSymbol() outputs a maximum of 'tableLog' bits at a time.
+Remember decoding will be done in reverse direction.
+    FSE_encodeByte(&bitStream, &state, symbol);
+
+At any time, you can also add any bit sequence.
+Note : maximum allowed nbBits is 25, for compatibility with 32-bits decoders
+    BIT_addBits(&bitStream, bitField, nbBits);
+
+The above methods don't commit data to memory, they just store it into local register, for speed.
+Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
+Writing data to memory is a manual operation, performed by the flushBits function.
+    BIT_flushBits(&bitStream);
+
+Your last FSE encoding operation shall be to flush your last state value(s).
+    FSE_flushState(&bitStream, &state);
+
+Finally, you must close the bitStream.
+The function returns the size of CStream in bytes.
+If data couldn't fit into dstBuffer, it will return a 0 ( == not compressible)
+If there is an error, it returns an errorCode (which can be tested using FSE_isError()).
+    size_t size = BIT_closeCStream(&bitStream);
+*/
+
+
+/* *****************************************
+*  FSE symbol decompression API
+*******************************************/
+typedef struct {
+    size_t      state;
+    const void* table;   /* precise table may vary, depending on U16 */
+} FSE_DState_t;
+
+
+static void     FSE_initDState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD, const FSE_DTable* dt);
+
+static unsigned char FSE_decodeSymbol(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD);
+
+static unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr);
+
+/**<
+Let's now decompose FSE_decompress_usingDTable() into its unitary components.
+You will decode FSE-encoded symbols from the bitStream,
+and also any other bitFields you put in, **in reverse order**.
+
+You will need a few variables to track your bitStream. They are :
+
+BIT_DStream_t DStream;    // Stream context
+FSE_DState_t  DState;     // State context. Multiple ones are possible
+FSE_DTable*   DTablePtr;  // Decoding table, provided by FSE_buildDTable()
+
+The first thing to do is to init the bitStream.
+    errorCode = BIT_initDStream(&DStream, srcBuffer, srcSize);
+
+You should then retrieve your initial state(s)
+(in reverse flushing order if you have several ones) :
+    errorCode = FSE_initDState(&DState, &DStream, DTablePtr);
+
+You can then decode your data, symbol after symbol.
+For information the maximum number of bits read by FSE_decodeSymbol() is 'tableLog'.
+Keep in mind that symbols are decoded in reverse order, like a LIFO stack (last in, first out).
+    unsigned char symbol = FSE_decodeSymbol(&DState, &DStream);
+
+You can retrieve any bitfield you eventually stored into the bitStream (in reverse order)
+Note : maximum allowed nbBits is 25, for 32-bits compatibility
+    size_t bitField = BIT_readBits(&DStream, nbBits);
+
+All above operations only read from local register (which size depends on size_t).
+Refueling the register from memory is manually performed by the reload method.
+    endSignal = FSE_reloadDStream(&DStream);
+
+BIT_reloadDStream() result tells if there is still some more data to read from DStream.
+BIT_DStream_unfinished : there is still some data left into the DStream.
+BIT_DStream_endOfBuffer : Dstream reached end of buffer. Its container may no longer be completely filled.
+BIT_DStream_completed : Dstream reached its exact end, corresponding in general to decompression completed.
+BIT_DStream_tooFar : Dstream went too far. Decompression result is corrupted.
+
+When reaching end of buffer (BIT_DStream_endOfBuffer), progress slowly, notably if you decode multiple symbols per loop,
+to properly detect the exact end of stream.
+After each decoded symbol, check if DStream is fully consumed using this simple test :
+    BIT_reloadDStream(&DStream) >= BIT_DStream_completed
+
+When it's done, verify decompression is fully completed, by checking both DStream and the relevant states.
+Checking if DStream has reached its end is performed by :
+    BIT_endOfDStream(&DStream);
+Check also the states. There might be some symbols left there, if some high probability ones (>50%) are possible.
+    FSE_endOfDState(&DState);
+*/
+
+
+/* *****************************************
+*  FSE unsafe API
+*******************************************/
+static unsigned char FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD);
+/* faster, but works only if nbBits is always >= 1 (otherwise, result will be corrupted) */
+
+
+/* *****************************************
+*  Implementation of inlined functions
+*******************************************/
+typedef struct {
+    int deltaFindState;
+    U32 deltaNbBits;
+} FSE_symbolCompressionTransform; /* total 8 bytes */
+
+MEM_STATIC void FSE_initCState(FSE_CState_t* statePtr, const FSE_CTable* ct)
+{
+    const void* ptr = ct;
+    const U16* u16ptr = (const U16*) ptr;
+    const U32 tableLog = MEM_read16(ptr);
+    statePtr->value = (ptrdiff_t)1<<tableLog;
+    statePtr->stateTable = u16ptr+2;
+    statePtr->symbolTT = ct + 1 + (tableLog ? (1<<(tableLog-1)) : 1);
+    statePtr->stateLog = tableLog;
+}
+
+
+/*! FSE_initCState2() :
+*   Same as FSE_initCState(), but the first symbol to include (which will be the last to be read)
+*   uses the smallest state value possible, saving the cost of this symbol */
+MEM_STATIC void FSE_initCState2(FSE_CState_t* statePtr, const FSE_CTable* ct, U32 symbol)
+{
+    FSE_initCState(statePtr, ct);
+    {   const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
+        const U16* stateTable = (const U16*)(statePtr->stateTable);
+        U32 nbBitsOut  = (U32)((symbolTT.deltaNbBits + (1<<15)) >> 16);
+        statePtr->value = (nbBitsOut << 16) - symbolTT.deltaNbBits;
+        statePtr->value = stateTable[(statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
+    }
+}
+
+MEM_STATIC void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* statePtr, unsigned symbol)
+{
+    FSE_symbolCompressionTransform const symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
+    const U16* const stateTable = (const U16*)(statePtr->stateTable);
+    U32 const nbBitsOut  = (U32)((statePtr->value + symbolTT.deltaNbBits) >> 16);
+    BIT_addBits(bitC, statePtr->value, nbBitsOut);
+    statePtr->value = stateTable[ (statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
+}
+
+MEM_STATIC void FSE_flushCState(BIT_CStream_t* bitC, const FSE_CState_t* statePtr)
+{
+    BIT_addBits(bitC, statePtr->value, statePtr->stateLog);
+    BIT_flushBits(bitC);
+}
+
+
+/* FSE_getMaxNbBits() :
+ * Approximate maximum cost of a symbol, in bits.
+ * Fractional get rounded up (i.e : a symbol with a normalized frequency of 3 gives the same result as a frequency of 2)
+ * note 1 : assume symbolValue is valid (<= maxSymbolValue)
+ * note 2 : if freq[symbolValue]==0, @return a fake cost of tableLog+1 bits */
+MEM_STATIC U32 FSE_getMaxNbBits(const void* symbolTTPtr, U32 symbolValue)
+{
+    const FSE_symbolCompressionTransform* symbolTT = (const FSE_symbolCompressionTransform*) symbolTTPtr;
+    return (symbolTT[symbolValue].deltaNbBits + ((1<<16)-1)) >> 16;
+}
+
+/* FSE_bitCost() :
+ * Approximate symbol cost, as fractional value, using fixed-point format (accuracyLog fractional bits)
+ * note 1 : assume symbolValue is valid (<= maxSymbolValue)
+ * note 2 : if freq[symbolValue]==0, @return a fake cost of tableLog+1 bits */
+MEM_STATIC U32 FSE_bitCost(const void* symbolTTPtr, U32 tableLog, U32 symbolValue, U32 accuracyLog)
+{
+    const FSE_symbolCompressionTransform* symbolTT = (const FSE_symbolCompressionTransform*) symbolTTPtr;
+    U32 const minNbBits = symbolTT[symbolValue].deltaNbBits >> 16;
+    U32 const threshold = (minNbBits+1) << 16;
+    assert(tableLog < 16);
+    assert(accuracyLog < 31-tableLog);  /* ensure enough room for renormalization double shift */
+    {   U32 const tableSize = 1 << tableLog;
+        U32 const deltaFromThreshold = threshold - (symbolTT[symbolValue].deltaNbBits + tableSize);
+        U32 const normalizedDeltaFromThreshold = (deltaFromThreshold << accuracyLog) >> tableLog;   /* linear interpolation (very approximate) */
+        U32 const bitMultiplier = 1 << accuracyLog;
+        assert(symbolTT[symbolValue].deltaNbBits + tableSize <= threshold);
+        assert(normalizedDeltaFromThreshold <= bitMultiplier);
+        return (minNbBits+1)*bitMultiplier - normalizedDeltaFromThreshold;
+    }
+}
+
+
+/* ======    Decompression    ====== */
+
+typedef struct {
+    U16 tableLog;
+    U16 fastMode;
+} FSE_DTableHeader;   /* sizeof U32 */
+
+typedef struct
+{
+    unsigned short newState;
+    unsigned char  symbol;
+    unsigned char  nbBits;
+} FSE_decode_t;   /* size == U32 */
+
+MEM_STATIC void FSE_initDState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD, const FSE_DTable* dt)
+{
+    const void* ptr = dt;
+    const FSE_DTableHeader* const DTableH = (const FSE_DTableHeader*)ptr;
+    DStatePtr->state = BIT_readBits(bitD, DTableH->tableLog);
+    BIT_reloadDStream(bitD);
+    DStatePtr->table = dt + 1;
+}
+
+MEM_STATIC BYTE FSE_peekSymbol(const FSE_DState_t* DStatePtr)
+{
+    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+    return DInfo.symbol;
+}
+
+MEM_STATIC void FSE_updateState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
+{
+    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+    U32 const nbBits = DInfo.nbBits;
+    size_t const lowBits = BIT_readBits(bitD, nbBits);
+    DStatePtr->state = DInfo.newState + lowBits;
+}
+
+MEM_STATIC BYTE FSE_decodeSymbol(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
+{
+    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+    U32 const nbBits = DInfo.nbBits;
+    BYTE const symbol = DInfo.symbol;
+    size_t const lowBits = BIT_readBits(bitD, nbBits);
+
+    DStatePtr->state = DInfo.newState + lowBits;
+    return symbol;
+}
+
+/*! FSE_decodeSymbolFast() :
+    unsafe, only works if no symbol has a probability > 50% */
+MEM_STATIC BYTE FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
+{
+    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
+    U32 const nbBits = DInfo.nbBits;
+    BYTE const symbol = DInfo.symbol;
+    size_t const lowBits = BIT_readBitsFast(bitD, nbBits);
+
+    DStatePtr->state = DInfo.newState + lowBits;
+    return symbol;
+}
+
+MEM_STATIC unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)
+{
+    return DStatePtr->state == 0;
+}
+
+
+
+#ifndef FSE_COMMONDEFS_ONLY
+
+/* **************************************************************
+*  Tuning parameters
+****************************************************************/
+/*!MEMORY_USAGE :
+*  Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
+*  Increasing memory usage improves compression ratio
+*  Reduced memory usage can improve speed, due to cache effect
+*  Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */
+#ifndef FSE_MAX_MEMORY_USAGE
+#  define FSE_MAX_MEMORY_USAGE 14
+#endif
+#ifndef FSE_DEFAULT_MEMORY_USAGE
+#  define FSE_DEFAULT_MEMORY_USAGE 13
+#endif
+
+/*!FSE_MAX_SYMBOL_VALUE :
+*  Maximum symbol value authorized.
+*  Required for proper stack allocation */
+#ifndef FSE_MAX_SYMBOL_VALUE
+#  define FSE_MAX_SYMBOL_VALUE 255
+#endif
+
+/* **************************************************************
+*  template functions type & suffix
+****************************************************************/
+#define FSE_FUNCTION_TYPE BYTE
+#define FSE_FUNCTION_EXTENSION
+#define FSE_DECODE_TYPE FSE_decode_t
+
+
+#endif   /* !FSE_COMMONDEFS_ONLY */
+
+
+/* ***************************************************************
+*  Constants
+*****************************************************************/
+#define FSE_MAX_TABLELOG  (FSE_MAX_MEMORY_USAGE-2)
+#define FSE_MAX_TABLESIZE (1U<<FSE_MAX_TABLELOG)
+#define FSE_MAXTABLESIZE_MASK (FSE_MAX_TABLESIZE-1)
+#define FSE_DEFAULT_TABLELOG (FSE_DEFAULT_MEMORY_USAGE-2)
+#define FSE_MIN_TABLELOG 5
+
+#define FSE_TABLELOG_ABSOLUTE_MAX 15
+#if FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX
+#  error "FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported"
+#endif
+
+#define FSE_TABLESTEP(tableSize) ((tableSize>>1) + (tableSize>>3) + 3)
+
+}
+
+#endif /* FSE_H_FSE_STATIC_LINKING_ONLY */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/huf.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/huf.h
new file mode 100644
index 0000000000..353bf00816
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/huf.h
@@ -0,0 +1,97 @@
+/* ******************************************************************
+ * huff0 huffman codec,
+ * part of Finite State Entropy library
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ * You can contact the author at :
+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+#ifndef HUF_H_298734234
+#define HUF_H_298734234
+
+/* *** Dependencies *** */
+#include <stddef.h>    /* size_t */
+
+
+/* *** library symbols visibility *** */
+/* Note : when linking with -fvisibility=hidden on gcc, or by default on Visual,
+ *        HUF symbols remain "private" (internal symbols for library only).
+ *        Set macro FSE_DLL_EXPORT to 1 if you want HUF symbols visible on DLL interface */
+#if defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1) && defined(__GNUC__) && (__GNUC__ >= 4)
+#  define HUF_PUBLIC_API __attribute__ ((visibility ("default")))
+#elif defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1)   /* Visual expected */
+#  define HUF_PUBLIC_API __declspec(dllexport)
+#elif defined(FSE_DLL_IMPORT) && (FSE_DLL_IMPORT==1)
+#  define HUF_PUBLIC_API __declspec(dllimport)  /* not required, just to generate faster code (saves a function pointer load from IAT and an indirect jump) */
+#else
+#  define HUF_PUBLIC_API
+#endif
+
+namespace lbug_zstd {
+
+/* ========================== */
+/* ***  simple functions  *** */
+/* ========================== */
+
+/** HUF_compress() :
+ *  Compress content from buffer 'src', of size 'srcSize', into buffer 'dst'.
+ * 'dst' buffer must be already allocated.
+ *  Compression runs faster if `dstCapacity` >= HUF_compressBound(srcSize).
+ * `srcSize` must be <= `HUF_BLOCKSIZE_MAX` == 128 KB.
+ * @return : size of compressed data (<= `dstCapacity`).
+ *  Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
+ *                   if HUF_isError(return), compression failed (more details using HUF_getErrorName())
+ */
+HUF_PUBLIC_API size_t HUF_compress(void* dst, size_t dstCapacity,
+                             const void* src, size_t srcSize);
+
+/** HUF_decompress() :
+ *  Decompress HUF data from buffer 'cSrc', of size 'cSrcSize',
+ *  into already allocated buffer 'dst', of minimum size 'dstSize'.
+ * `originalSize` : **must** be the ***exact*** size of original (uncompressed) data.
+ *  Note : in contrast with FSE, HUF_decompress can regenerate
+ *         RLE (cSrcSize==1) and uncompressed (cSrcSize==dstSize) data,
+ *         because it knows size to regenerate (originalSize).
+ * @return : size of regenerated data (== originalSize),
+ *           or an error code, which can be tested using HUF_isError()
+ */
+HUF_PUBLIC_API size_t HUF_decompress(void* dst,  size_t originalSize,
+                               const void* cSrc, size_t cSrcSize);
+
+
+/* ***   Tool functions *** */
+#define HUF_BLOCKSIZE_MAX (128 * 1024)                  /**< maximum input size for a single block compressed with HUF_compress */
+HUF_PUBLIC_API size_t HUF_compressBound(size_t size);   /**< maximum compressed size (worst case) */
+
+/* Error Management */
+HUF_PUBLIC_API unsigned    HUF_isError(size_t code);       /**< tells if a return value is an error code */
+HUF_PUBLIC_API const char* HUF_getErrorName(size_t code);  /**< provides error code string (useful for debugging) */
+
+
+/* ***   Advanced function   *** */
+
+/** HUF_compress2() :
+ *  Same as HUF_compress(), but offers control over `maxSymbolValue` and `tableLog`.
+ * `maxSymbolValue` must be <= HUF_SYMBOLVALUE_MAX .
+ * `tableLog` must be `<= HUF_TABLELOG_MAX` . */
+HUF_PUBLIC_API size_t HUF_compress2 (void* dst, size_t dstCapacity,
+                               const void* src, size_t srcSize,
+                               unsigned maxSymbolValue, unsigned tableLog);
+
+/** HUF_compress4X_wksp() :
+ *  Same as HUF_compress2(), but uses externally allocated `workSpace`.
+ * `workspace` must have minimum alignment of 4, and be at least as large as HUF_WORKSPACE_SIZE */
+#define HUF_WORKSPACE_SIZE ((6 << 10) + 256)
+#define HUF_WORKSPACE_SIZE_U32 (HUF_WORKSPACE_SIZE / sizeof(U32))
+HUF_PUBLIC_API size_t HUF_compress4X_wksp (void* dst, size_t dstCapacity,
+                                     const void* src, size_t srcSize,
+                                     unsigned maxSymbolValue, unsigned tableLog,
+                                     void* workSpace, size_t wkspSize);
+
+#endif   /* HUF_H_298734234 */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/huf_static.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/huf_static.h
new file mode 100644
index 0000000000..7701972e65
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/huf_static.h
@@ -0,0 +1,238 @@
+/* ******************************************************************
+ *  WARNING !!
+ *  The following section contains advanced and experimental definitions
+ *  which shall never be used in the context of a dynamic library,
+ *  because they are not guaranteed to remain stable in the future.
+ *  Only consider them in association with static linking.
+ * **************************************************************** */
+#ifndef HUF_H_HUF_STATIC_LINKING_ONLY
+#define HUF_H_HUF_STATIC_LINKING_ONLY
+
+/* *** Dependencies *** */
+#include "zstd/common/mem.h"   /* U32 */
+
+
+/* *** Constants *** */
+#define HUF_TABLELOG_MAX      12      /* max runtime value of tableLog (due to static allocation); can be modified up to HUF_ABSOLUTEMAX_TABLELOG */
+#define HUF_TABLELOG_DEFAULT  11      /* default tableLog value when none specified */
+#define HUF_SYMBOLVALUE_MAX  255
+
+#define HUF_TABLELOG_ABSOLUTEMAX  15  /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */
+#if (HUF_TABLELOG_MAX > HUF_TABLELOG_ABSOLUTEMAX)
+#  error "HUF_TABLELOG_MAX is too large !"
+#endif
+
+
+/* ****************************************
+*  Static allocation
+******************************************/
+/* HUF buffer bounds */
+#define HUF_CTABLEBOUND 129
+#define HUF_BLOCKBOUND(size) (size + (size>>8) + 8)   /* only true when incompressible is pre-filtered with fast heuristic */
+#define HUF_COMPRESSBOUND(size) (HUF_CTABLEBOUND + HUF_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
+
+/* static allocation of HUF's Compression Table */
+#define HUF_CTABLE_SIZE_U32(maxSymbolValue)   ((maxSymbolValue)+1)   /* Use tables of U32, for proper alignment */
+#define HUF_CTABLE_SIZE(maxSymbolValue)       (HUF_CTABLE_SIZE_U32(maxSymbolValue) * sizeof(U32))
+#define HUF_CREATE_STATIC_CTABLE(name, maxSymbolValue) \
+    U32 name##hb[HUF_CTABLE_SIZE_U32(maxSymbolValue)]; \
+    void* name##hv = &(name##hb); \
+    HUF_CElt* name = (HUF_CElt*)(name##hv)   /* no final ; */
+
+/* static allocation of HUF's DTable */
+typedef U32 HUF_DTable;
+#define HUF_DTABLE_SIZE(maxTableLog)   (1 + (1<<(maxTableLog)))
+#define HUF_CREATE_STATIC_DTABLEX1(DTable, maxTableLog) \
+        HUF_DTable DTable[HUF_DTABLE_SIZE((maxTableLog)-1)] = { ((U32)((maxTableLog)-1) * 0x01000001) }
+#define HUF_CREATE_STATIC_DTABLEX2(DTable, maxTableLog) \
+        HUF_DTable DTable[HUF_DTABLE_SIZE(maxTableLog)] = { ((U32)(maxTableLog) * 0x01000001) }
+
+
+/* ****************************************
+*  Advanced decompression functions
+******************************************/
+size_t HUF_decompress4X1 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
+#ifndef HUF_FORCE_DECOMPRESS_X1
+size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
+#endif
+
+size_t HUF_decompress4X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< decodes RLE and uncompressed */
+size_t HUF_decompress4X_hufOnly(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize); /**< considers RLE and uncompressed as errors */
+size_t HUF_decompress4X_hufOnly_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize); /**< considers RLE and uncompressed as errors */
+size_t HUF_decompress4X1_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
+size_t HUF_decompress4X1_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);   /**< single-symbol decoder */
+#ifndef HUF_FORCE_DECOMPRESS_X1
+size_t HUF_decompress4X2_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
+size_t HUF_decompress4X2_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);   /**< double-symbols decoder */
+#endif
+
+
+/* ****************************************
+ *  HUF detailed API
+ * ****************************************/
+
+/*! HUF_compress() does the following:
+ *  1. count symbol occurrence from source[] into table count[] using FSE_count() (exposed within "zstd/common/fse.h")
+ *  2. (optional) refine tableLog using HUF_optimalTableLog()
+ *  3. build Huffman table from count using HUF_buildCTable()
+ *  4. save Huffman table to memory buffer using HUF_writeCTable()
+ *  5. encode the data stream using HUF_compress4X_usingCTable()
+ *
+ *  The following API allows targeting specific sub-functions for advanced tasks.
+ *  For example, it's possible to compress several blocks using the same 'CTable',
+ *  or to save and regenerate 'CTable' using external methods.
+ */
+unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
+typedef struct HUF_CElt_s HUF_CElt;   /* incomplete type */
+size_t HUF_buildCTable (HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue, unsigned maxNbBits);   /* @return : maxNbBits; CTable and count can overlap. In which case, CTable will overwrite count content */
+size_t HUF_writeCTable (void* dst, size_t maxDstSize, const HUF_CElt* CTable, unsigned maxSymbolValue, unsigned huffLog);
+size_t HUF_compress4X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable);
+size_t HUF_estimateCompressedSize(const HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue);
+int HUF_validateCTable(const HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue);
+
+typedef enum {
+   HUF_repeat_none,  /**< Cannot use the previous table */
+   HUF_repeat_check, /**< Can use the previous table but it must be checked. Note : The previous table must have been constructed by HUF_compress{1, 4}X_repeat */
+   HUF_repeat_valid  /**< Can use the previous table and it is assumed to be valid */
+ } HUF_repeat;
+/** HUF_compress4X_repeat() :
+ *  Same as HUF_compress4X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
+ *  If it uses hufTable it does not modify hufTable or repeat.
+ *  If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
+ *  If preferRepeat then the old table will always be used if valid. */
+size_t HUF_compress4X_repeat(void* dst, size_t dstSize,
+                       const void* src, size_t srcSize,
+                       unsigned maxSymbolValue, unsigned tableLog,
+                       void* workSpace, size_t wkspSize,    /**< `workSpace` must be aligned on 4-bytes boundaries, `wkspSize` must be >= HUF_WORKSPACE_SIZE */
+                       HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat, int bmi2);
+
+/** HUF_buildCTable_wksp() :
+ *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
+ * `workSpace` must be aligned on 4-bytes boundaries, and its size must be >= HUF_CTABLE_WORKSPACE_SIZE.
+ */
+#define HUF_CTABLE_WORKSPACE_SIZE_U32 (2*HUF_SYMBOLVALUE_MAX +1 +1)
+#define HUF_CTABLE_WORKSPACE_SIZE (HUF_CTABLE_WORKSPACE_SIZE_U32 * sizeof(unsigned))
+size_t HUF_buildCTable_wksp (HUF_CElt* tree,
+                       const unsigned* count, U32 maxSymbolValue, U32 maxNbBits,
+                             void* workSpace, size_t wkspSize);
+
+/*! HUF_readStats() :
+ *  Read compact Huffman tree, saved by HUF_writeCTable().
+ * `huffWeight` is destination buffer.
+ * @return : size read from `src` , or an error Code .
+ *  Note : Needed by HUF_readCTable() and HUF_readDTableXn() . */
+size_t HUF_readStats(BYTE* huffWeight, size_t hwSize,
+                     U32* rankStats, U32* nbSymbolsPtr, U32* tableLogPtr,
+                     const void* src, size_t srcSize);
+
+/** HUF_readCTable() :
+ *  Loading a CTable saved with HUF_writeCTable() */
+size_t HUF_readCTable (HUF_CElt* CTable, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize, unsigned *hasZeroWeights);
+
+/** HUF_getNbBits() :
+ *  Read nbBits from CTable symbolTable, for symbol `symbolValue` presumed <= HUF_SYMBOLVALUE_MAX
+ *  Note 1 : is not inlined, as HUF_CElt definition is private
+ *  Note 2 : const void* used, so that it can provide a statically allocated table as argument (which uses type U32) */
+U32 HUF_getNbBits(const void* symbolTable, U32 symbolValue);
+
+/*
+ * HUF_decompress() does the following:
+ * 1. select the decompression algorithm (X1, X2) based on pre-computed heuristics
+ * 2. build Huffman table from save, using HUF_readDTableX?()
+ * 3. decode 1 or 4 segments in parallel using HUF_decompress?X?_usingDTable()
+ */
+
+/** HUF_selectDecoder() :
+ *  Tells which decoder is likely to decode faster,
+ *  based on a set of pre-computed metrics.
+ * @return : 0==HUF_decompress4X1, 1==HUF_decompress4X2 .
+ *  Assumption : 0 < dstSize <= 128 KB */
+U32 HUF_selectDecoder (size_t dstSize, size_t cSrcSize);
+
+/**
+ *  The minimum workspace size for the `workSpace` used in
+ *  HUF_readDTableX1_wksp() and HUF_readDTableX2_wksp().
+ *
+ *  The space used depends on HUF_TABLELOG_MAX, ranging from ~1500 bytes when
+ *  HUF_TABLE_LOG_MAX=12 to ~1850 bytes when HUF_TABLE_LOG_MAX=15.
+ *  Buffer overflow errors may potentially occur if code modifications result in
+ *  a required workspace size greater than that specified in the following
+ *  macro.
+ */
+#define HUF_DECOMPRESS_WORKSPACE_SIZE (2 << 10)
+#define HUF_DECOMPRESS_WORKSPACE_SIZE_U32 (HUF_DECOMPRESS_WORKSPACE_SIZE / sizeof(U32))
+
+#ifndef HUF_FORCE_DECOMPRESS_X2
+size_t HUF_readDTableX1 (HUF_DTable* DTable, const void* src, size_t srcSize);
+size_t HUF_readDTableX1_wksp (HUF_DTable* DTable, const void* src, size_t srcSize, void* workSpace, size_t wkspSize);
+#endif
+#ifndef HUF_FORCE_DECOMPRESS_X1
+size_t HUF_readDTableX2 (HUF_DTable* DTable, const void* src, size_t srcSize);
+size_t HUF_readDTableX2_wksp (HUF_DTable* DTable, const void* src, size_t srcSize, void* workSpace, size_t wkspSize);
+#endif
+
+size_t HUF_decompress4X_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+#ifndef HUF_FORCE_DECOMPRESS_X2
+size_t HUF_decompress4X1_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+#endif
+#ifndef HUF_FORCE_DECOMPRESS_X1
+size_t HUF_decompress4X2_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+#endif
+
+
+/* ====================== */
+/* single stream variants */
+/* ====================== */
+
+size_t HUF_compress1X (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
+size_t HUF_compress1X_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
+size_t HUF_compress1X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable);
+/** HUF_compress1X_repeat() :
+ *  Same as HUF_compress1X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
+ *  If it uses hufTable it does not modify hufTable or repeat.
+ *  If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
+ *  If preferRepeat then the old table will always be used if valid. */
+size_t HUF_compress1X_repeat(void* dst, size_t dstSize,
+                       const void* src, size_t srcSize,
+                       unsigned maxSymbolValue, unsigned tableLog,
+                       void* workSpace, size_t wkspSize,   /**< `workSpace` must be aligned on 4-bytes boundaries, `wkspSize` must be >= HUF_WORKSPACE_SIZE */
+                       HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat, int bmi2);
+
+size_t HUF_decompress1X1 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /* single-symbol decoder */
+#ifndef HUF_FORCE_DECOMPRESS_X1
+size_t HUF_decompress1X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /* double-symbol decoder */
+#endif
+
+size_t HUF_decompress1X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);
+size_t HUF_decompress1X_DCtx_wksp (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);
+#ifndef HUF_FORCE_DECOMPRESS_X2
+size_t HUF_decompress1X1_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
+size_t HUF_decompress1X1_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);   /**< single-symbol decoder */
+#endif
+#ifndef HUF_FORCE_DECOMPRESS_X1
+size_t HUF_decompress1X2_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
+size_t HUF_decompress1X2_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);   /**< double-symbols decoder */
+#endif
+
+size_t HUF_decompress1X_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);   /**< automatic selection of sing or double symbol decoder, based on DTable */
+#ifndef HUF_FORCE_DECOMPRESS_X2
+size_t HUF_decompress1X1_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+#endif
+#ifndef HUF_FORCE_DECOMPRESS_X1
+size_t HUF_decompress1X2_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
+#endif
+
+/* BMI2 variants.
+ * If the CPU has BMI2 support, pass bmi2=1, otherwise pass bmi2=0.
+ */
+size_t HUF_decompress1X_usingDTable_bmi2(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable, int bmi2);
+#ifndef HUF_FORCE_DECOMPRESS_X2
+size_t HUF_decompress1X1_DCtx_wksp_bmi2(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize, int bmi2);
+#endif
+size_t HUF_decompress4X_usingDTable_bmi2(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable, int bmi2);
+size_t HUF_decompress4X_hufOnly_wksp_bmi2(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize, int bmi2);
+
+}
+
+#endif /* HUF_STATIC_LINKING_ONLY */
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/mem.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/mem.h
new file mode 100644
index 0000000000..5546335cce
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/mem.h
@@ -0,0 +1,380 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef MEM_H_MODULE
+#define MEM_H_MODULE
+
+/*-****************************************
+*  Dependencies
+******************************************/
+#include <stddef.h>     /* size_t, ptrdiff_t */
+#include <string.h>     /* memcpy */
+
+
+/*-****************************************
+*  Compiler specifics
+******************************************/
+#if defined(_MSC_VER)   /* Visual Studio */
+#   include <stdlib.h>  /* _byteswap_ulong */
+#   include <intrin.h>  /* _byteswap_* */
+#endif
+#if defined(__GNUC__)
+#  define MEM_STATIC static __inline __attribute__((unused))
+#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
+#  define MEM_STATIC static inline
+#elif defined(_MSC_VER)
+#  define MEM_STATIC static __inline
+#else
+#  define MEM_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
+#endif
+
+#ifndef __has_builtin
+#  define __has_builtin(x) 0  /* compat. with non-clang compilers */
+#endif
+
+/* code only tested on 32 and 64 bits systems */
+#define MEM_STATIC_ASSERT(c)   { enum { MEM_static_assert = 1/(int)(!!(c)) }; }
+MEM_STATIC void MEM_check(void) { MEM_STATIC_ASSERT((sizeof(size_t)==4) || (sizeof(size_t)==8)); }
+
+/* detects whether we are being compiled under msan */
+#if defined (__has_feature)
+#  if __has_feature(memory_sanitizer)
+#    define MEMORY_SANITIZER 1
+#  endif
+#endif
+
+/*-**************************************************************
+*  Basic Types
+*****************************************************************/
+#if  !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
+# include <stdint.h>
+  typedef   uint8_t BYTE;
+  typedef  uint16_t U16;
+  typedef   int16_t S16;
+  typedef  uint32_t U32;
+  typedef   int32_t S32;
+  typedef  uint64_t U64;
+  typedef   int64_t S64;
+#else
+# include <limits.h>
+#if CHAR_BIT != 8
+#  error "this implementation requires char to be exactly 8-bit type"
+#endif
+  typedef unsigned char      BYTE;
+#if USHRT_MAX != 65535
+#  error "this implementation requires short to be exactly 16-bit type"
+#endif
+  typedef unsigned short      U16;
+  typedef   signed short      S16;
+#if UINT_MAX != 4294967295
+#  error "this implementation requires int to be exactly 32-bit type"
+#endif
+  typedef unsigned int        U32;
+  typedef   signed int        S32;
+/* note : there are no limits defined for long long type in C90.
+ * limits exist in C99, however, in such case, <stdint.h> is preferred */
+  typedef unsigned long long  U64;
+  typedef   signed long long  S64;
+#endif
+
+namespace lbug_zstd {
+
+/*-**************************************************************
+*  Memory I/O
+*****************************************************************/
+/* MEM_FORCE_MEMORY_ACCESS :
+ * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
+ * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
+ * The below switch allow to select different access method for improved performance.
+ * Method 0 (default) : use `memcpy()`. Safe and portable.
+ * Method 1 : `__packed` statement. It depends on compiler extension (i.e., not portable).
+ *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
+ * Method 2 : direct access. This method is portable but violate C standard.
+ *            It can generate buggy code on targets depending on alignment.
+ *            In some circumstances, it's the only known way to get the most performance (i.e. GCC + ARMv6)
+ * See http://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.
+ * Prefer these methods in priority order (0 > 1 > 2)
+ */
+#ifndef MEM_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
+#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
+#    define MEM_FORCE_MEMORY_ACCESS 2
+#  elif defined(__INTEL_COMPILER) || defined(__GNUC__) || defined(__ICCARM__)
+#    define MEM_FORCE_MEMORY_ACCESS 1
+#  endif
+#endif
+
+MEM_STATIC unsigned MEM_32bits(void) { return sizeof(size_t)==4; }
+MEM_STATIC unsigned MEM_64bits(void) { return sizeof(size_t)==8; }
+
+MEM_STATIC unsigned MEM_isLittleEndian(void)
+{
+    const union { U32 u; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
+    return one.c[0];
+}
+
+#if defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==2)
+
+/* violates C standard, by lying on structure alignment.
+Only use if no other choice to achieve best performance on target platform */
+MEM_STATIC U16 MEM_read16(const void* memPtr) { return *(const U16*) memPtr; }
+MEM_STATIC U32 MEM_read32(const void* memPtr) { return *(const U32*) memPtr; }
+MEM_STATIC U64 MEM_read64(const void* memPtr) { return *(const U64*) memPtr; }
+MEM_STATIC size_t MEM_readST(const void* memPtr) { return *(const size_t*) memPtr; }
+
+MEM_STATIC void MEM_write16(void* memPtr, U16 value) { *(U16*)memPtr = value; }
+MEM_STATIC void MEM_write32(void* memPtr, U32 value) { *(U32*)memPtr = value; }
+MEM_STATIC void MEM_write64(void* memPtr, U64 value) { *(U64*)memPtr = value; }
+
+#elif defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==1)
+
+/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
+/* currently only defined for gcc and icc */
+#if defined(_MSC_VER) || (defined(__INTEL_COMPILER) && defined(WIN32))
+    __pragma( pack(push, 1) )
+    typedef struct { U16 v; } unalign16;
+    typedef struct { U32 v; } unalign32;
+    typedef struct { U64 v; } unalign64;
+    typedef struct { size_t v; } unalignArch;
+    __pragma( pack(pop) )
+#else
+    typedef struct { U16 v; } __attribute__((packed)) unalign16;
+    typedef struct { U32 v; } __attribute__((packed)) unalign32;
+    typedef struct { U64 v; } __attribute__((packed)) unalign64;
+    typedef struct { size_t v; } __attribute__((packed)) unalignArch;
+#endif
+
+MEM_STATIC U16 MEM_read16(const void* ptr) { return ((const unalign16*)ptr)->v; }
+MEM_STATIC U32 MEM_read32(const void* ptr) { return ((const unalign32*)ptr)->v; }
+MEM_STATIC U64 MEM_read64(const void* ptr) { return ((const unalign64*)ptr)->v; }
+MEM_STATIC size_t MEM_readST(const void* ptr) { return ((const unalignArch*)ptr)->v; }
+
+MEM_STATIC void MEM_write16(void* memPtr, U16 value) { ((unalign16*)memPtr)->v = value; }
+MEM_STATIC void MEM_write32(void* memPtr, U32 value) { ((unalign32*)memPtr)->v = value; }
+MEM_STATIC void MEM_write64(void* memPtr, U64 value) { ((unalign64*)memPtr)->v = value; }
+
+#else
+
+/* default method, safe and standard.
+   can sometimes prove slower */
+
+MEM_STATIC U16 MEM_read16(const void* memPtr)
+{
+    U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+MEM_STATIC U32 MEM_read32(const void* memPtr)
+{
+    U32 val; memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+MEM_STATIC U64 MEM_read64(const void* memPtr)
+{
+    U64 val; memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+MEM_STATIC size_t MEM_readST(const void* memPtr)
+{
+    size_t val; memcpy(&val, memPtr, sizeof(val)); return val;
+}
+
+MEM_STATIC void MEM_write16(void* memPtr, U16 value)
+{
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+MEM_STATIC void MEM_write32(void* memPtr, U32 value)
+{
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+MEM_STATIC void MEM_write64(void* memPtr, U64 value)
+{
+    memcpy(memPtr, &value, sizeof(value));
+}
+
+#endif /* MEM_FORCE_MEMORY_ACCESS */
+
+MEM_STATIC U32 MEM_swap32(U32 in)
+{
+#if defined(_MSC_VER)     /* Visual Studio */
+    return _byteswap_ulong(in);
+#elif (defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)) \
+  || (defined(__clang__) && __has_builtin(__builtin_bswap32))
+    return __builtin_bswap32(in);
+#else
+    return  ((in << 24) & 0xff000000 ) |
+            ((in <<  8) & 0x00ff0000 ) |
+            ((in >>  8) & 0x0000ff00 ) |
+            ((in >> 24) & 0x000000ff );
+#endif
+}
+
+MEM_STATIC U64 MEM_swap64(U64 in)
+{
+#if defined(_MSC_VER)     /* Visual Studio */
+    return _byteswap_uint64(in);
+#elif (defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)) \
+  || (defined(__clang__) && __has_builtin(__builtin_bswap64))
+    return __builtin_bswap64(in);
+#else
+    return  ((in << 56) & 0xff00000000000000ULL) |
+            ((in << 40) & 0x00ff000000000000ULL) |
+            ((in << 24) & 0x0000ff0000000000ULL) |
+            ((in << 8)  & 0x000000ff00000000ULL) |
+            ((in >> 8)  & 0x00000000ff000000ULL) |
+            ((in >> 24) & 0x0000000000ff0000ULL) |
+            ((in >> 40) & 0x000000000000ff00ULL) |
+            ((in >> 56) & 0x00000000000000ffULL);
+#endif
+}
+
+MEM_STATIC size_t MEM_swapST(size_t in)
+{
+    if (MEM_32bits())
+        return (size_t)MEM_swap32((U32)in);
+    else
+        return (size_t)MEM_swap64((U64)in);
+}
+
+/*=== Little endian r/w ===*/
+
+MEM_STATIC U16 MEM_readLE16(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_read16(memPtr);
+    else {
+        const BYTE* p = (const BYTE*)memPtr;
+        return (U16)(p[0] + (p[1]<<8));
+    }
+}
+
+MEM_STATIC void MEM_writeLE16(void* memPtr, U16 val)
+{
+    if (MEM_isLittleEndian()) {
+        MEM_write16(memPtr, val);
+    } else {
+        BYTE* p = (BYTE*)memPtr;
+        p[0] = (BYTE)val;
+        p[1] = (BYTE)(val>>8);
+    }
+}
+
+MEM_STATIC U32 MEM_readLE24(const void* memPtr)
+{
+    return MEM_readLE16(memPtr) + (((const BYTE*)memPtr)[2] << 16);
+}
+
+MEM_STATIC void MEM_writeLE24(void* memPtr, U32 val)
+{
+    MEM_writeLE16(memPtr, (U16)val);
+    ((BYTE*)memPtr)[2] = (BYTE)(val>>16);
+}
+
+MEM_STATIC U32 MEM_readLE32(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_read32(memPtr);
+    else
+        return MEM_swap32(MEM_read32(memPtr));
+}
+
+MEM_STATIC void MEM_writeLE32(void* memPtr, U32 val32)
+{
+    if (MEM_isLittleEndian())
+        MEM_write32(memPtr, val32);
+    else
+        MEM_write32(memPtr, MEM_swap32(val32));
+}
+
+MEM_STATIC U64 MEM_readLE64(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_read64(memPtr);
+    else
+        return MEM_swap64(MEM_read64(memPtr));
+}
+
+MEM_STATIC void MEM_writeLE64(void* memPtr, U64 val64)
+{
+    if (MEM_isLittleEndian())
+        MEM_write64(memPtr, val64);
+    else
+        MEM_write64(memPtr, MEM_swap64(val64));
+}
+
+MEM_STATIC size_t MEM_readLEST(const void* memPtr)
+{
+    if (MEM_32bits())
+        return (size_t)MEM_readLE32(memPtr);
+    else
+        return (size_t)MEM_readLE64(memPtr);
+}
+
+MEM_STATIC void MEM_writeLEST(void* memPtr, size_t val)
+{
+    if (MEM_32bits())
+        MEM_writeLE32(memPtr, (U32)val);
+    else
+        MEM_writeLE64(memPtr, (U64)val);
+}
+
+/*=== Big endian r/w ===*/
+
+MEM_STATIC U32 MEM_readBE32(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_swap32(MEM_read32(memPtr));
+    else
+        return MEM_read32(memPtr);
+}
+
+MEM_STATIC void MEM_writeBE32(void* memPtr, U32 val32)
+{
+    if (MEM_isLittleEndian())
+        MEM_write32(memPtr, MEM_swap32(val32));
+    else
+        MEM_write32(memPtr, val32);
+}
+
+MEM_STATIC U64 MEM_readBE64(const void* memPtr)
+{
+    if (MEM_isLittleEndian())
+        return MEM_swap64(MEM_read64(memPtr));
+    else
+        return MEM_read64(memPtr);
+}
+
+MEM_STATIC void MEM_writeBE64(void* memPtr, U64 val64)
+{
+    if (MEM_isLittleEndian())
+        MEM_write64(memPtr, MEM_swap64(val64));
+    else
+        MEM_write64(memPtr, val64);
+}
+
+MEM_STATIC size_t MEM_readBEST(const void* memPtr)
+{
+    if (MEM_32bits())
+        return (size_t)MEM_readBE32(memPtr);
+    else
+        return (size_t)MEM_readBE64(memPtr);
+}
+
+MEM_STATIC void MEM_writeBEST(void* memPtr, size_t val)
+{
+    if (MEM_32bits())
+        MEM_writeBE32(memPtr, (U32)val);
+    else
+        MEM_writeBE64(memPtr, (U64)val);
+}
+
+}
+
+#endif /* MEM_H_MODULE */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/xxhash.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/xxhash.h
new file mode 100644
index 0000000000..dc2132565b
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/xxhash.h
@@ -0,0 +1,235 @@
+/*
+ * xxHash - Extremely Fast Hash algorithm
+ * Header File
+ * Copyright (c) 2012-2020, Yann Collet, Facebook, Inc.
+ *
+ * You can contact the author at :
+ * - xxHash source repository : https://github.com/Cyan4973/xxHash
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+*/
+
+/* Notice extracted from xxHash homepage :
+
+xxHash is an extremely fast Hash algorithm, running at RAM speed limits.
+It also successfully passes all tests from the SMHasher suite.
+
+Comparison (single thread, Windows Seven 32 bits, using SMHasher on a Core 2 Duo @3GHz)
+
+Name            Speed       Q.Score   Author
+xxHash          5.4 GB/s     10
+CrapWow         3.2 GB/s      2       Andrew
+MumurHash 3a    2.7 GB/s     10       Austin Appleby
+SpookyHash      2.0 GB/s     10       Bob Jenkins
+SBox            1.4 GB/s      9       Bret Mulvey
+Lookup3         1.2 GB/s      9       Bob Jenkins
+SuperFastHash   1.2 GB/s      1       Paul Hsieh
+CityHash64      1.05 GB/s    10       Pike & Alakuijala
+FNV             0.55 GB/s     5       Fowler, Noll, Vo
+CRC32           0.43 GB/s     9
+MD5-32          0.33 GB/s    10       Ronald L. Rivest
+SHA1-32         0.28 GB/s    10
+
+Q.Score is a measure of quality of the hash function.
+It depends on successfully passing SMHasher test set.
+10 is a perfect score.
+
+A 64-bits version, named XXH64, is available since r35.
+It offers much better speed, but for 64-bits applications only.
+Name     Speed on 64 bits    Speed on 32 bits
+XXH64       13.8 GB/s            1.9 GB/s
+XXH32        6.8 GB/s            6.0 GB/s
+*/
+
+#ifndef XXHASH_H_5627135585666179
+#define XXHASH_H_5627135585666179 1
+
+
+/* ****************************
+*  Definitions
+******************************/
+#include <stddef.h>   /* size_t */
+namespace lbug_zstd {
+typedef enum { XXH_OK=0, XXH_ERROR } XXH_errorcode;
+
+
+/* ****************************
+*  API modifier
+******************************/
+/** XXH_PRIVATE_API
+*   This is useful if you want to include xxhash functions in `static` mode
+*   in order to inline them, and remove their symbol from the public list.
+*   Methodology :
+*     #define XXH_PRIVATE_API
+*     #include "zstd/common/xxhash.h"
+*   `xxhash.c` is automatically included.
+*   It's not useful to compile and link it as a separate module anymore.
+*/
+#ifdef XXH_PRIVATE_API
+#  ifndef XXH_STATIC_LINKING_ONLY
+#    define XXH_STATIC_LINKING_ONLY
+#  endif
+#  if defined(__GNUC__)
+#    define XXH_PUBLIC_API static __inline __attribute__((unused))
+#  elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
+#    define XXH_PUBLIC_API static inline
+#  elif defined(_MSC_VER)
+#    define XXH_PUBLIC_API static __inline
+#  else
+#    define XXH_PUBLIC_API static   /* this version may generate warnings for unused static functions; disable the relevant warning */
+#  endif
+#else
+#  define XXH_PUBLIC_API   /* do nothing */
+#endif /* XXH_PRIVATE_API */
+
+/*!XXH_NAMESPACE, aka Namespace Emulation :
+
+If you want to include _and expose_ xxHash functions from within your own library,
+but also want to avoid symbol collisions with another library which also includes xxHash,
+
+you can use XXH_NAMESPACE, to automatically prefix any public symbol from xxhash library
+with the value of XXH_NAMESPACE (so avoid to keep it NULL and avoid numeric values).
+
+Note that no change is required within the calling program as long as it includes `xxhash.h` :
+regular symbol name will be automatically translated by this header.
+*/
+#ifdef XXH_NAMESPACE
+#  define XXH_CAT(A,B) A##B
+#  define XXH_NAME2(A,B) XXH_CAT(A,B)
+#  define XXH32 XXH_NAME2(XXH_NAMESPACE, XXH32)
+#  define XXH64 XXH_NAME2(XXH_NAMESPACE, XXH64)
+#  define XXH_versionNumber XXH_NAME2(XXH_NAMESPACE, XXH_versionNumber)
+#  define XXH32_createState XXH_NAME2(XXH_NAMESPACE, XXH32_createState)
+#  define XXH64_createState XXH_NAME2(XXH_NAMESPACE, XXH64_createState)
+#  define XXH32_freeState XXH_NAME2(XXH_NAMESPACE, XXH32_freeState)
+#  define XXH64_freeState XXH_NAME2(XXH_NAMESPACE, XXH64_freeState)
+#  define XXH32_reset XXH_NAME2(XXH_NAMESPACE, XXH32_reset)
+#  define XXH64_reset XXH_NAME2(XXH_NAMESPACE, XXH64_reset)
+#  define XXH32_update XXH_NAME2(XXH_NAMESPACE, XXH32_update)
+#  define XXH64_update XXH_NAME2(XXH_NAMESPACE, XXH64_update)
+#  define XXH32_digest XXH_NAME2(XXH_NAMESPACE, XXH32_digest)
+#  define XXH64_digest XXH_NAME2(XXH_NAMESPACE, XXH64_digest)
+#  define XXH32_copyState XXH_NAME2(XXH_NAMESPACE, XXH32_copyState)
+#  define XXH64_copyState XXH_NAME2(XXH_NAMESPACE, XXH64_copyState)
+#  define XXH32_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH32_canonicalFromHash)
+#  define XXH64_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH64_canonicalFromHash)
+#  define XXH32_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH32_hashFromCanonical)
+#  define XXH64_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH64_hashFromCanonical)
+#endif
+
+
+/* *************************************
+*  Version
+***************************************/
+#define XXH_VERSION_MAJOR    0
+#define XXH_VERSION_MINOR    6
+#define XXH_VERSION_RELEASE  2
+#define XXH_VERSION_NUMBER  (XXH_VERSION_MAJOR *100*100 + XXH_VERSION_MINOR *100 + XXH_VERSION_RELEASE)
+XXH_PUBLIC_API unsigned XXH_versionNumber (void);
+
+
+/* ****************************
+*  Simple Hash Functions
+******************************/
+typedef unsigned int       XXH32_hash_t;
+typedef unsigned long long XXH64_hash_t;
+
+XXH_PUBLIC_API XXH32_hash_t XXH32 (const void* input, size_t length, unsigned int seed);
+XXH_PUBLIC_API XXH64_hash_t XXH64 (const void* input, size_t length, unsigned long long seed);
+
+/*!
+XXH32() :
+    Calculate the 32-bits hash of sequence "length" bytes stored at memory address "input".
+    The memory between input & input+length must be valid (allocated and read-accessible).
+    "seed" can be used to alter the result predictably.
+    Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s
+XXH64() :
+    Calculate the 64-bits hash of sequence of length "len" stored at memory address "input".
+    "seed" can be used to alter the result predictably.
+    This function runs 2x faster on 64-bits systems, but slower on 32-bits systems (see benchmark).
+*/
+
+
+/* ****************************
+*  Streaming Hash Functions
+******************************/
+typedef struct XXH32_state_s XXH32_state_t;   /* incomplete type */
+typedef struct XXH64_state_s XXH64_state_t;   /* incomplete type */
+
+/*! State allocation, compatible with dynamic libraries */
+
+XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void);
+XXH_PUBLIC_API XXH_errorcode  XXH32_freeState(XXH32_state_t* statePtr);
+
+XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void);
+XXH_PUBLIC_API XXH_errorcode  XXH64_freeState(XXH64_state_t* statePtr);
+
+
+/* hash streaming */
+
+XXH_PUBLIC_API XXH_errorcode XXH32_reset  (XXH32_state_t* statePtr, unsigned int seed);
+XXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* statePtr, const void* input, size_t length);
+XXH_PUBLIC_API XXH32_hash_t  XXH32_digest (const XXH32_state_t* statePtr);
+
+XXH_PUBLIC_API XXH_errorcode XXH64_reset  (XXH64_state_t* statePtr, unsigned long long seed);
+XXH_PUBLIC_API XXH_errorcode XXH64_update (XXH64_state_t* statePtr, const void* input, size_t length);
+XXH_PUBLIC_API XXH64_hash_t  XXH64_digest (const XXH64_state_t* statePtr);
+
+/*
+These functions generate the xxHash of an input provided in multiple segments.
+Note that, for small input, they are slower than single-call functions, due to state management.
+For small input, prefer `XXH32()` and `XXH64()` .
+
+XXH state must first be allocated, using XXH*_createState() .
+
+Start a new hash by initializing state with a seed, using XXH*_reset().
+
+Then, feed the hash state by calling XXH*_update() as many times as necessary.
+Obviously, input must be allocated and read accessible.
+The function returns an error code, with 0 meaning OK, and any other value meaning there is an error.
+
+Finally, a hash value can be produced anytime, by using XXH*_digest().
+This function returns the nn-bits hash as an int or long long.
+
+It's still possible to continue inserting input into the hash state after a digest,
+and generate some new hashes later on, by calling again XXH*_digest().
+
+When done, free XXH state space if it was allocated dynamically.
+*/
+
+
+/* **************************
+*  Utils
+****************************/
+#if !(defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L))   /* ! C99 */
+#  define __restrict   /* disable restrict */
+#endif
+
+XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* __restrict dst_state, const XXH32_state_t* __restrict src_state);
+XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* __restrict dst_state, const XXH64_state_t* __restrict src_state);
+
+
+/* **************************
+*  Canonical representation
+****************************/
+/* Default result type for XXH functions are primitive unsigned 32 and 64 bits.
+*  The canonical representation uses human-readable write convention, aka big-endian (large digits first).
+*  These functions allow transformation of hash result into and from its canonical format.
+*  This way, hash values can be written into a file / memory, and remain comparable on different systems and programs.
+*/
+typedef struct { unsigned char digest[4]; } XXH32_canonical_t;
+typedef struct { unsigned char digest[8]; } XXH64_canonical_t;
+
+XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash);
+XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash);
+
+XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src);
+XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src);
+
+}
+
+#endif /* XXHASH_H_5627135585666179 */
+
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/xxhash_static.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/xxhash_static.h
new file mode 100644
index 0000000000..daa4e95437
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/xxhash_static.h
@@ -0,0 +1,45 @@
+
+/* ================================================================================================
+   This section contains definitions which are not guaranteed to remain stable.
+   They may change in future versions, becoming incompatible with a different version of the library.
+   They shall only be used with static linking.
+   Never use these definitions in association with dynamic linking !
+=================================================================================================== */
+#ifndef XXH_STATIC_H_3543687687345
+#define XXH_STATIC_H_3543687687345
+
+namespace lbug_zstd {
+
+/* These definitions are only meant to allow allocation of XXH state
+   statically, on stack, or in a struct for example.
+   Do not use members directly. */
+
+   struct XXH32_state_s {
+       unsigned total_len_32;
+       unsigned large_len;
+       unsigned v1;
+       unsigned v2;
+       unsigned v3;
+       unsigned v4;
+       unsigned mem32[4];   /* buffer defined as U32 for alignment */
+       unsigned memsize;
+       unsigned reserved;   /* never read nor write, will be removed in a future version */
+   };   /* typedef'd to XXH32_state_t */
+
+   struct XXH64_state_s {
+       unsigned long long total_len;
+       unsigned long long v1;
+       unsigned long long v2;
+       unsigned long long v3;
+       unsigned long long v4;
+       unsigned long long mem64[4];   /* buffer defined as U64 for alignment */
+       unsigned memsize;
+       unsigned reserved[2];          /* never read nor write, will be removed in a future version */
+   };   /* typedef'd to XXH64_state_t */
+
+}
+// #  ifdef XXH_PRIVATE_API
+// #    include "xxhash.cpp"   /* include xxhash functions as `static`, for inlining */
+// #  endif
+
+#endif /* XXH_STATIC_LINKING_ONLY && XXH_STATIC_H_3543687687345 */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/zstd_errors.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/zstd_errors.h
new file mode 100644
index 0000000000..0c68e12f86
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/zstd_errors.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_ERRORS_H_398273423
+#define ZSTD_ERRORS_H_398273423
+
+/*===== dependency =====*/
+#include <stddef.h>   /* size_t */
+
+
+/* =====   ZSTDERRORLIB_API : control library symbols visibility   ===== */
+#ifndef ZSTDERRORLIB_VISIBILITY
+#  if defined(__GNUC__) && (__GNUC__ >= 4)
+#    define ZSTDERRORLIB_VISIBILITY __attribute__ ((visibility ("default")))
+#  else
+#    define ZSTDERRORLIB_VISIBILITY
+#  endif
+#endif
+#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)
+#  define ZSTDERRORLIB_API __declspec(dllexport) ZSTDERRORLIB_VISIBILITY
+#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)
+#  define ZSTDERRORLIB_API __declspec(dllimport) ZSTDERRORLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
+#else
+#  define ZSTDERRORLIB_API ZSTDERRORLIB_VISIBILITY
+#endif
+namespace lbug_zstd {
+/*-*********************************************
+ *  Error codes list
+ *-*********************************************
+ *  Error codes _values_ are pinned down since v1.3.1 only.
+ *  Therefore, don't rely on values if you may link to any version < v1.3.1.
+ *
+ *  Only values < 100 are considered stable.
+ *
+ *  note 1 : this API shall be used with static linking only.
+ *           dynamic linking is not yet officially supported.
+ *  note 2 : Prefer relying on the enum than on its value whenever possible
+ *           This is the only supported way to use the error list < v1.3.1
+ *  note 3 : ZSTD_isError() is always correct, whatever the library version.
+ **********************************************/
+typedef enum {
+  ZSTD_error_no_error = 0,
+  ZSTD_error_GENERIC  = 1,
+  ZSTD_error_prefix_unknown                = 10,
+  ZSTD_error_version_unsupported           = 12,
+  ZSTD_error_frameParameter_unsupported    = 14,
+  ZSTD_error_frameParameter_windowTooLarge = 16,
+  ZSTD_error_corruption_detected = 20,
+  ZSTD_error_checksum_wrong      = 22,
+  ZSTD_error_dictionary_corrupted      = 30,
+  ZSTD_error_dictionary_wrong          = 32,
+  ZSTD_error_dictionaryCreation_failed = 34,
+  ZSTD_error_parameter_unsupported   = 40,
+  ZSTD_error_parameter_outOfBound    = 42,
+  ZSTD_error_tableLog_tooLarge       = 44,
+  ZSTD_error_maxSymbolValue_tooLarge = 46,
+  ZSTD_error_maxSymbolValue_tooSmall = 48,
+  ZSTD_error_stage_wrong       = 60,
+  ZSTD_error_init_missing      = 62,
+  ZSTD_error_memory_allocation = 64,
+  ZSTD_error_workSpace_tooSmall= 66,
+  ZSTD_error_dstSize_tooSmall = 70,
+  ZSTD_error_srcSize_wrong    = 72,
+  ZSTD_error_dstBuffer_null   = 74,
+  /* following error codes are __NOT STABLE__, they can be removed or changed in future versions */
+  ZSTD_error_frameIndex_tooLarge = 100,
+  ZSTD_error_seekableIO          = 102,
+  ZSTD_error_dstBuffer_wrong     = 104,
+  ZSTD_error_maxCode = 120  /* never EVER use this value directly, it can change in future versions! Use ZSTD_isError() instead */
+} ZSTD_ErrorCode;
+
+/*! ZSTD_getErrorCode() :
+    convert a `size_t` function result into a `ZSTD_ErrorCode` enum type,
+    which can be used to compare with enum list published above */
+ZSTDERRORLIB_API ZSTD_ErrorCode ZSTD_getErrorCode(size_t functionResult);
+ZSTDERRORLIB_API const char* ZSTD_getErrorString(ZSTD_ErrorCode code);   /**< Same as ZSTD_getErrorName, but using a `ZSTD_ErrorCode` enum argument */
+
+}
+
+#endif /* ZSTD_ERRORS_H_398273423 */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/zstd_internal.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/zstd_internal.h
new file mode 100644
index 0000000000..f911f4b4c7
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/common/zstd_internal.h
@@ -0,0 +1,420 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_CCOMMON_H_MODULE
+#define ZSTD_CCOMMON_H_MODULE
+
+/* this module contains definitions which must be identical
+ * across compression, decompression and dictBuilder.
+ * It also contains a few functions useful to at least 2 of them
+ * and which benefit from being inlined */
+
+/*-*************************************
+*  Dependencies
+***************************************/
+#ifdef __aarch64__
+#include <arm_neon.h>
+#endif
+#include "zstd/common/compiler.h"
+#include "zstd/common/mem.h"
+#include "zstd/common/debug.h"                 /* assert, DEBUGLOG, RAWLOG, g_debuglevel */
+#include "zstd/common/error_private.h"
+#include "zstd.h"
+#include "zstd_static.h"
+#include "zstd/common/fse.h"
+#include "zstd/common/fse_static.h"
+#include "zstd/common/huf.h"
+#include "zstd/common/huf_static.h"
+#include "zstd/common/xxhash.h"                /* XXH_reset, update, digest */
+#include "zstd/common/xxhash_static.h"                /* XXH_reset, update, digest */
+
+namespace lbug_zstd {
+
+/* ---- static assert (debug) --- */
+#define ZSTD_STATIC_ASSERT(c) DEBUG_STATIC_ASSERT(c)
+#define ZSTD_isError ERR_isError   /* for inlining */
+// #define FSE_isError  ERR_isError
+// #define HUF_isError  ERR_isError
+
+
+/*-*************************************
+*  shared macros
+***************************************/
+#undef MIN
+#undef MAX
+#define MIN(a,b) ((a)<(b) ? (a) : (b))
+#define MAX(a,b) ((a)>(b) ? (a) : (b))
+
+/**
+ * Ignore: this is an internal helper.
+ *
+ * This is a helper function to help force C99-correctness during compilation.
+ * Under strict compilation modes, variadic macro arguments can't be empty.
+ * However, variadic function arguments can be. Using a function therefore lets
+ * us statically check that at least one (string) argument was passed,
+ * independent of the compilation flags.
+ */
+static INLINE_KEYWORD UNUSED_ATTR
+void _force_has_format_string(const char *format, ...) {
+  (void)format;
+}
+
+/**
+ * Ignore: this is an internal helper.
+ *
+ * We want to force this function invocation to be syntactically correct, but
+ * we don't want to force runtime evaluation of its arguments.
+ */
+#define _FORCE_HAS_FORMAT_STRING(...) \
+  if (0) { \
+    _force_has_format_string(__VA_ARGS__); \
+  }
+
+/**
+ * Return the specified error if the condition evaluates to true.
+ *
+ * In debug modes, prints additional information.
+ * In order to do that (particularly, printing the conditional that failed),
+ * this can't just wrap RETURN_ERROR().
+ */
+#define RETURN_ERROR_IF(cond, err, ...) \
+  if (cond) { \
+    RAWLOG(3, "%s:%d: ERROR!: check %s failed, returning %s", \
+           __FILE__, __LINE__, ZSTD_QUOTE(cond), ZSTD_QUOTE(ERROR(err))); \
+    _FORCE_HAS_FORMAT_STRING(__VA_ARGS__); \
+    RAWLOG(3, ": " __VA_ARGS__); \
+    RAWLOG(3, "\n"); \
+    return ERROR(err); \
+  }
+
+/**
+ * Unconditionally return the specified error.
+ *
+ * In debug modes, prints additional information.
+ */
+#define RETURN_ERROR(err, ...) \
+  do { \
+    RAWLOG(3, "%s:%d: ERROR!: unconditional check failed, returning %s", \
+           __FILE__, __LINE__, ZSTD_QUOTE(ERROR(err))); \
+    _FORCE_HAS_FORMAT_STRING(__VA_ARGS__); \
+    RAWLOG(3, ": " __VA_ARGS__); \
+    RAWLOG(3, "\n"); \
+    return ERROR(err); \
+  } while(0);
+
+/**
+ * If the provided expression evaluates to an error code, returns that error code.
+ *
+ * In debug modes, prints additional information.
+ */
+#define FORWARD_IF_ERROR(err, ...) \
+  do { \
+    size_t const err_code = (err); \
+    if (ERR_isError(err_code)) { \
+      RAWLOG(3, "%s:%d: ERROR!: forwarding error in %s: %s", \
+             __FILE__, __LINE__, ZSTD_QUOTE(err), ERR_getErrorName(err_code)); \
+      _FORCE_HAS_FORMAT_STRING(__VA_ARGS__); \
+      RAWLOG(3, ": " __VA_ARGS__); \
+      RAWLOG(3, "\n"); \
+      return err_code; \
+    } \
+  } while(0);
+
+
+/*-*************************************
+*  Common constants
+***************************************/
+#define ZSTD_OPT_NUM    (1<<12)
+
+#define ZSTD_REP_NUM      3                 /* number of repcodes */
+#define ZSTD_REP_MOVE     (ZSTD_REP_NUM-1)
+
+#define KB *(1 <<10)
+#define MB *(1 <<20)
+#define GB *(1U<<30)
+
+#define BIT7 128
+#define BIT6  64
+#define BIT5  32
+#define BIT4  16
+#define BIT1   2
+#define BIT0   1
+
+#define ZSTD_WINDOWLOG_ABSOLUTEMIN 10
+
+#define ZSTD_FRAMEIDSIZE 4   /* magic number size */
+
+#define ZSTD_BLOCKHEADERSIZE 3   /* C standard doesn't allow `static const` variable to be init using another `static const` variable */
+
+typedef enum { bt_raw, bt_rle, bt_compressed, bt_reserved } blockType_e;
+
+#define ZSTD_FRAMECHECKSUMSIZE 4
+
+#define MIN_SEQUENCES_SIZE 1 /* nbSeq==0 */
+#define MIN_CBLOCK_SIZE (1 /*litCSize*/ + 1 /* RLE or RAW */ + MIN_SEQUENCES_SIZE /* nbSeq==0 */)   /* for a non-null block */
+
+#define HufLog 12
+typedef enum { set_basic, set_rle, set_compressed, set_repeat } symbolEncodingType_e;
+
+#define LONGNBSEQ 0x7F00
+
+#define MINMATCH 3
+
+#define Litbits  8
+#define MaxLit ((1<<Litbits) - 1)
+#define MaxML   52
+#define MaxLL   35
+#define DefaultMaxOff 28
+#define MaxOff  31
+#define MaxSeq MAX(MaxLL, MaxML)   /* Assumption : MaxOff < MaxLL,MaxML */
+#define MLFSELog    9
+#define LLFSELog    9
+#define OffFSELog   8
+#define MaxFSELog  MAX(MAX(MLFSELog, LLFSELog), OffFSELog)
+
+struct ZSTDInternalConstants {
+    static const size_t ZSTD_blockHeaderSize;
+    static const U32 LL_bits[MaxLL+1];
+    static const S16 LL_defaultNorm[MaxLL+1];
+    static const U32 LL_defaultNormLog;
+    static const U32 ML_bits[MaxML+1];
+    static const S16 ML_defaultNorm[MaxML+1];
+    static const U32 ML_defaultNormLog;
+    static const S16 OF_defaultNorm[DefaultMaxOff+1];
+    static const U32 OF_defaultNormLog;
+    static const ZSTD_customMem ZSTD_defaultCMem;
+    static const U32 repStartValue[ZSTD_REP_NUM];
+};
+
+#define LL_DEFAULTNORMLOG 6  /* for static allocation */
+
+#define ML_DEFAULTNORMLOG 6  /* for static allocation */
+
+#define OF_DEFAULTNORMLOG 5  /* for static allocation */
+
+
+/*-*******************************************
+*  Shared functions to include for inlining
+*********************************************/
+static void ZSTD_copy8(void* dst, const void* src) {
+#ifdef __aarch64__
+    vst1_u8((uint8_t*)dst, vld1_u8((const uint8_t*)src));
+#else
+    memcpy(dst, src, 8);
+#endif
+}
+
+#define COPY8(d,s) { ZSTD_copy8(d,s); d+=8; s+=8; }
+static void ZSTD_copy16(void* dst, const void* src) {
+#ifdef __aarch64__
+    vst1q_u8((uint8_t*)dst, vld1q_u8((const uint8_t*)src));
+#else
+    memcpy(dst, src, 16);
+#endif
+}
+#define COPY16(d,s) { ZSTD_copy16(d,s); d+=16; s+=16; }
+
+#define WILDCOPY_OVERLENGTH 32
+#define WILDCOPY_VECLEN 16
+
+typedef enum {
+    ZSTD_no_overlap,
+    ZSTD_overlap_src_before_dst
+    /*  ZSTD_overlap_dst_before_src, */
+} ZSTD_overlap_e;
+
+/*! ZSTD_wildcopy() :
+ *  Custom version of memcpy(), can over read/write up to WILDCOPY_OVERLENGTH bytes (if length==0)
+ *  @param ovtype controls the overlap detection
+ *         - ZSTD_no_overlap: The source and destination are guaranteed to be at least WILDCOPY_VECLEN bytes apart.
+ *         - ZSTD_overlap_src_before_dst: The src and dst may overlap, but they MUST be at least 8 bytes apart.
+ *           The src buffer must be before the dst buffer.
+ */
+MEM_STATIC FORCE_INLINE_ATTR
+void ZSTD_wildcopy(void* dst, const void* src, ptrdiff_t length, ZSTD_overlap_e const ovtype)
+{
+    ptrdiff_t diff = (BYTE*)dst - (const BYTE*)src;
+    const BYTE* ip = (const BYTE*)src;
+    BYTE* op = (BYTE*)dst;
+    BYTE* const oend = op + length;
+
+    assert(diff >= 8 || (ovtype == ZSTD_no_overlap && diff <= -WILDCOPY_VECLEN));
+
+    if (ovtype == ZSTD_overlap_src_before_dst && diff < WILDCOPY_VECLEN) {
+        /* Handle short offset copies. */
+        do {
+            COPY8(op, ip)
+        } while (op < oend);
+    } else {
+        assert(diff >= WILDCOPY_VECLEN || diff <= -WILDCOPY_VECLEN);
+        /* Separate out the first COPY16() call because the copy length is
+         * almost certain to be short, so the branches have different
+         * probabilities. Since it is almost certain to be short, only do
+         * one COPY16() in the first call. Then, do two calls per loop since
+         * at that point it is more likely to have a high trip count.
+         */
+#ifndef __aarch64__
+        do {
+            COPY16(op, ip);
+        }
+        while (op < oend);
+#else
+        COPY16(op, ip);
+        if (op >= oend) return;
+        do {
+            COPY16(op, ip);
+            COPY16(op, ip);
+        }
+        while (op < oend);
+#endif
+    }
+}
+
+MEM_STATIC size_t ZSTD_limitCopy(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
+{
+    size_t const length = MIN(dstCapacity, srcSize);
+    if (length > 0) {
+        memcpy(dst, src, length);
+    }
+    return length;
+}
+
+/* define "workspace is too large" as this number of times larger than needed */
+#define ZSTD_WORKSPACETOOLARGE_FACTOR 3
+
+/* when workspace is continuously too large
+ * during at least this number of times,
+ * context's memory usage is considered wasteful,
+ * because it's sized to handle a worst case scenario which rarely happens.
+ * In which case, resize it down to free some memory */
+#define ZSTD_WORKSPACETOOLARGE_MAXDURATION 128
+
+
+/*-*******************************************
+*  Private declarations
+*********************************************/
+typedef struct seqDef_s {
+    U32 offset;
+    U16 litLength;
+    U16 matchLength;
+} seqDef;
+
+typedef struct {
+    seqDef* sequencesStart;
+    seqDef* sequences;
+    BYTE* litStart;
+    BYTE* lit;
+    BYTE* llCode;
+    BYTE* mlCode;
+    BYTE* ofCode;
+    size_t maxNbSeq;
+    size_t maxNbLit;
+    U32   longLengthID;   /* 0 == no longLength; 1 == Lit.longLength; 2 == Match.longLength; */
+    U32   longLengthPos;
+} seqStore_t;
+
+typedef struct {
+    U32 litLength;
+    U32 matchLength;
+} ZSTD_sequenceLength;
+
+/**
+ * Returns the ZSTD_sequenceLength for the given sequences. It handles the decoding of long sequences
+ * indicated by longLengthPos and longLengthID, and adds MINMATCH back to matchLength.
+ */
+MEM_STATIC ZSTD_sequenceLength ZSTD_getSequenceLength(seqStore_t const* seqStore, seqDef const* seq)
+{
+    ZSTD_sequenceLength seqLen;
+    seqLen.litLength = seq->litLength;
+    seqLen.matchLength = seq->matchLength + MINMATCH;
+    if (seqStore->longLengthPos == (U32)(seq - seqStore->sequencesStart)) {
+        if (seqStore->longLengthID == 1) {
+            seqLen.litLength += 0xFFFF;
+        }
+        if (seqStore->longLengthID == 2) {
+            seqLen.matchLength += 0xFFFF;
+        }
+    }
+    return seqLen;
+}
+
+/**
+ * Contains the compressed frame size and an upper-bound for the decompressed frame size.
+ * Note: before using `compressedSize`, check for errors using ZSTD_isError().
+ *       similarly, before using `decompressedBound`, check for errors using:
+ *          `decompressedBound != ZSTD_CONTENTSIZE_ERROR`
+ */
+typedef struct {
+    size_t compressedSize;
+    unsigned long long decompressedBound;
+} ZSTD_frameSizeInfo;   /* decompress & legacy */
+
+const seqStore_t* ZSTD_getSeqStore(const ZSTD_CCtx* ctx);   /* compress & dictBuilder */
+void ZSTD_seqToCodes(const seqStore_t* seqStorePtr);   /* compress, dictBuilder, decodeCorpus (shouldn't get its definition from here) */
+
+/* custom memory allocation functions */
+void* ZSTD_malloc(size_t size, ZSTD_customMem customMem);
+void* ZSTD_calloc(size_t size, ZSTD_customMem customMem);
+void ZSTD_free(void* ptr, ZSTD_customMem customMem);
+
+
+MEM_STATIC U32 ZSTD_highbit32(U32 val)   /* compress, dictBuilder, decodeCorpus */
+{
+    assert(val != 0);
+    {
+#   if defined(_MSC_VER)   /* Visual */
+        unsigned long r=0;
+        return _BitScanReverse(&r, val) ? (unsigned)r : 0;
+#   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* GCC Intrinsic */
+        return __builtin_clz (val) ^ 31;
+#   elif defined(__ICCARM__)    /* IAR Intrinsic */
+        return 31 - __CLZ(val);
+#   else   /* Software version */
+        static const U32 DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
+        U32 v = val;
+        v |= v >> 1;
+        v |= v >> 2;
+        v |= v >> 4;
+        v |= v >> 8;
+        v |= v >> 16;
+        return DeBruijnClz[(v * 0x07C4ACDDU) >> 27];
+#   endif
+    }
+}
+
+
+/* ZSTD_invalidateRepCodes() :
+ * ensures next compression will not use repcodes from previous block.
+ * Note : only works with regular variant;
+ *        do not use with extDict variant ! */
+void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx);   /* zstdmt, adaptive_compression (shouldn't get this definition from here) */
+
+
+typedef struct {
+    blockType_e blockType;
+    U32 lastBlock;
+    U32 origSize;
+} blockProperties_t;   /* declared here for decompress and fullbench */
+
+/*! ZSTD_getcBlockSize() :
+ *  Provides the size of compressed block from block header `src` */
+/* Used by: decompress, fullbench (does not get its definition from here) */
+size_t ZSTD_getcBlockSize(const void* src, size_t srcSize,
+                          blockProperties_t* bpPtr);
+
+/*! ZSTD_decodeSeqHeaders() :
+ *  decode sequence header from src */
+/* Used by: decompress, fullbench (does not get its definition from here) */
+size_t ZSTD_decodeSeqHeaders(ZSTD_DCtx* dctx, int* nbSeqPtr,
+                       const void* src, size_t srcSize);
+
+}
+
+#endif   /* ZSTD_CCOMMON_H_MODULE */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/hist.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/hist.h
new file mode 100644
index 0000000000..b706ed697a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/hist.h
@@ -0,0 +1,78 @@
+/* ******************************************************************
+ * hist : Histogram functions
+ * part of Finite State Entropy project
+ * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
+ *
+ *  You can contact the author at :
+ *  - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
+ *  - Public forum : https://groups.google.com/forum/#!forum/lz4c
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+****************************************************************** */
+
+/* --- dependencies --- */
+#include <stddef.h>   /* size_t */
+
+
+namespace lbug_zstd {
+/* --- simple histogram functions --- */
+
+/*! HIST_count():
+ *  Provides the precise count of each byte within a table 'count'.
+ * 'count' is a table of unsigned int, of minimum size (*maxSymbolValuePtr+1).
+ *  Updates *maxSymbolValuePtr with actual largest symbol value detected.
+ * @return : count of the most frequent symbol (which isn't identified).
+ *           or an error code, which can be tested using HIST_isError().
+ *           note : if return == srcSize, there is only one symbol.
+ */
+size_t HIST_count(unsigned* count, unsigned* maxSymbolValuePtr,
+                  const void* src, size_t srcSize);
+
+unsigned HIST_isError(size_t code);  /**< tells if a return value is an error code */
+
+
+/* --- advanced histogram functions --- */
+
+#define HIST_WKSP_SIZE_U32 1024
+#define HIST_WKSP_SIZE    (HIST_WKSP_SIZE_U32 * sizeof(unsigned))
+/** HIST_count_wksp() :
+ *  Same as HIST_count(), but using an externally provided scratch buffer.
+ *  Benefit is this function will use very little stack space.
+ * `workSpace` is a writable buffer which must be 4-bytes aligned,
+ * `workSpaceSize` must be >= HIST_WKSP_SIZE
+ */
+size_t HIST_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
+                       const void* src, size_t srcSize,
+                       void* workSpace, size_t workSpaceSize);
+
+/** HIST_countFast() :
+ *  same as HIST_count(), but blindly trusts that all byte values within src are <= *maxSymbolValuePtr.
+ *  This function is unsafe, and will segfault if any value within `src` is `> *maxSymbolValuePtr`
+ */
+size_t HIST_countFast(unsigned* count, unsigned* maxSymbolValuePtr,
+                      const void* src, size_t srcSize);
+
+/** HIST_countFast_wksp() :
+ *  Same as HIST_countFast(), but using an externally provided scratch buffer.
+ * `workSpace` is a writable buffer which must be 4-bytes aligned,
+ * `workSpaceSize` must be >= HIST_WKSP_SIZE
+ */
+size_t HIST_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
+                           const void* src, size_t srcSize,
+                           void* workSpace, size_t workSpaceSize);
+
+/*! HIST_count_simple() :
+ *  Same as HIST_countFast(), this function is unsafe,
+ *  and will segfault if any value within `src` is `> *maxSymbolValuePtr`.
+ *  It is also a bit slower for large inputs.
+ *  However, it does not need any additional memory (not even on stack).
+ * @return : count of the most frequent symbol.
+ *  Note this function doesn't produce any error (i.e. it must succeed).
+ */
+unsigned HIST_count_simple(unsigned* count, unsigned* maxSymbolValuePtr,
+                           const void* src, size_t srcSize);
+
+}
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_internal.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_internal.h
new file mode 100644
index 0000000000..4e024ac3fb
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_internal.h
@@ -0,0 +1,1118 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+/* This header contains definitions
+ * that shall **only** be used by modules within lib/compress.
+ */
+
+#ifndef ZSTD_COMPRESS_H
+#define ZSTD_COMPRESS_H
+
+/*-*************************************
+*  Dependencies
+***************************************/
+#include "zstd/common/zstd_internal.h"
+#include "zstd/compress/zstd_cwksp.h"
+// #ifdef ZSTD_MULTITHREAD
+// #  include "zstdmt_compress.h"
+// #endif
+
+/*-*************************************
+*  Constants
+***************************************/
+#define kSearchStrength      8
+#define HASH_READ_SIZE       8
+#define ZSTD_DUBT_UNSORTED_MARK 1   /* For btlazy2 strategy, index ZSTD_DUBT_UNSORTED_MARK==1 means "unsorted".
+                                       It could be confused for a real successor at index "1", if sorted as larger than its predecessor.
+                                       It's not a big deal though : candidate will just be sorted again.
+                                       Additionally, candidate position 1 will be lost.
+                                       But candidate 1 cannot hide a large tree of candidates, so it's a minimal loss.
+                                       The benefit is that ZSTD_DUBT_UNSORTED_MARK cannot be mishandled after table re-use with a different strategy.
+                                       This constant is required by ZSTD_compressBlock_btlazy2() and ZSTD_reduceTable_internal() */
+
+
+namespace lbug_zstd {
+/*-*************************************
+*  Context memory management
+***************************************/
+typedef enum { ZSTDcs_created=0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZSTD_compressionStage_e;
+typedef enum { zcss_init=0, zcss_load, zcss_flush } ZSTD_cStreamStage;
+
+typedef struct ZSTD_prefixDict_s {
+    const void* dict;
+    size_t dictSize;
+    ZSTD_dictContentType_e dictContentType;
+} ZSTD_prefixDict;
+
+typedef struct {
+    void* dictBuffer;
+    void const* dict;
+    size_t dictSize;
+    ZSTD_dictContentType_e dictContentType;
+    ZSTD_CDict* cdict;
+} ZSTD_localDict;
+
+typedef struct {
+    U32 CTable[HUF_CTABLE_SIZE_U32(255)];
+    HUF_repeat repeatMode;
+} ZSTD_hufCTables_t;
+
+typedef struct {
+    FSE_CTable offcodeCTable[FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff)];
+    FSE_CTable matchlengthCTable[FSE_CTABLE_SIZE_U32(MLFSELog, MaxML)];
+    FSE_CTable litlengthCTable[FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL)];
+    FSE_repeat offcode_repeatMode;
+    FSE_repeat matchlength_repeatMode;
+    FSE_repeat litlength_repeatMode;
+} ZSTD_fseCTables_t;
+
+typedef struct {
+    ZSTD_hufCTables_t huf;
+    ZSTD_fseCTables_t fse;
+} ZSTD_entropyCTables_t;
+
+typedef struct {
+    U32 off;
+    U32 len;
+} ZSTD_match_t;
+
+typedef struct {
+    int price;
+    U32 off;
+    U32 mlen;
+    U32 litlen;
+    U32 rep[ZSTD_REP_NUM];
+} ZSTD_optimal_t;
+
+typedef enum { zop_dynamic=0, zop_predef } ZSTD_OptPrice_e;
+
+typedef struct {
+    /* All tables are allocated inside cctx->workspace by ZSTD_resetCCtx_internal() */
+    unsigned* litFreq;           /* table of literals statistics, of size 256 */
+    unsigned* litLengthFreq;     /* table of litLength statistics, of size (MaxLL+1) */
+    unsigned* matchLengthFreq;   /* table of matchLength statistics, of size (MaxML+1) */
+    unsigned* offCodeFreq;       /* table of offCode statistics, of size (MaxOff+1) */
+    ZSTD_match_t* matchTable;    /* list of found matches, of size ZSTD_OPT_NUM+1 */
+    ZSTD_optimal_t* priceTable;  /* All positions tracked by optimal parser, of size ZSTD_OPT_NUM+1 */
+
+    U32  litSum;                 /* nb of literals */
+    U32  litLengthSum;           /* nb of litLength codes */
+    U32  matchLengthSum;         /* nb of matchLength codes */
+    U32  offCodeSum;             /* nb of offset codes */
+    U32  litSumBasePrice;        /* to compare to log2(litfreq) */
+    U32  litLengthSumBasePrice;  /* to compare to log2(llfreq)  */
+    U32  matchLengthSumBasePrice;/* to compare to log2(mlfreq)  */
+    U32  offCodeSumBasePrice;    /* to compare to log2(offreq)  */
+    ZSTD_OptPrice_e priceType;   /* prices can be determined dynamically, or follow a pre-defined cost structure */
+    const ZSTD_entropyCTables_t* symbolCosts;  /* pre-calculated dictionary statistics */
+    ZSTD_literalCompressionMode_e literalCompressionMode;
+} optState_t;
+
+typedef struct {
+  ZSTD_entropyCTables_t entropy;
+  U32 rep[ZSTD_REP_NUM];
+} ZSTD_compressedBlockState_t;
+
+typedef struct {
+    BYTE const* nextSrc;    /* next block here to continue on current prefix */
+    BYTE const* base;       /* All regular indexes relative to this position */
+    BYTE const* dictBase;   /* extDict indexes relative to this position */
+    U32 dictLimit;          /* below that point, need extDict */
+    U32 lowLimit;           /* below that point, no more valid data */
+} ZSTD_window_t;
+
+typedef struct ZSTD_matchState_t ZSTD_matchState_t;
+struct ZSTD_matchState_t {
+    ZSTD_window_t window;   /* State for window round buffer management */
+    U32 loadedDictEnd;      /* index of end of dictionary, within context's referential.
+                             * When loadedDictEnd != 0, a dictionary is in use, and still valid.
+                             * This relies on a mechanism to set loadedDictEnd=0 when dictionary is no longer within distance.
+                             * Such mechanism is provided within ZSTD_window_enforceMaxDist() and ZSTD_checkDictValidity().
+                             * When dict referential is copied into active context (i.e. not attached),
+                             * loadedDictEnd == dictSize, since referential starts from zero.
+                             */
+    U32 nextToUpdate;       /* index from which to continue table update */
+    U32 hashLog3;           /* dispatch table for matches of len==3 : larger == faster, more memory */
+    U32* hashTable;
+    U32* hashTable3;
+    U32* chainTable;
+    optState_t opt;         /* optimal parser state */
+    const ZSTD_matchState_t* dictMatchState;
+    ZSTD_compressionParameters cParams;
+};
+
+typedef struct {
+    ZSTD_compressedBlockState_t* prevCBlock;
+    ZSTD_compressedBlockState_t* nextCBlock;
+    ZSTD_matchState_t matchState;
+} ZSTD_blockState_t;
+
+typedef struct {
+    U32 offset;
+    U32 checksum;
+} ldmEntry_t;
+
+typedef struct {
+    ZSTD_window_t window;   /* State for the window round buffer management */
+    ldmEntry_t* hashTable;
+    U32 loadedDictEnd;
+    BYTE* bucketOffsets;    /* Next position in bucket to insert entry */
+    U64 hashPower;          /* Used to compute the rolling hash.
+                             * Depends on ldmParams.minMatchLength */
+} ldmState_t;
+
+typedef struct {
+    U32 enableLdm;          /* 1 if enable long distance matching */
+    U32 hashLog;            /* Log size of hashTable */
+    U32 bucketSizeLog;      /* Log bucket size for collision resolution, at most 8 */
+    U32 minMatchLength;     /* Minimum match length */
+    U32 hashRateLog;       /* Log number of entries to skip */
+    U32 windowLog;          /* Window log for the LDM */
+} ldmParams_t;
+
+typedef struct {
+    U32 offset;
+    U32 litLength;
+    U32 matchLength;
+} rawSeq;
+
+typedef struct {
+  rawSeq* seq;     /* The start of the sequences */
+  size_t pos;      /* The position where reading stopped. <= size. */
+  size_t size;     /* The number of sequences. <= capacity. */
+  size_t capacity; /* The capacity starting from `seq` pointer */
+} rawSeqStore_t;
+
+typedef struct {
+    int collectSequences;
+    ZSTD_Sequence* seqStart;
+    size_t seqIndex;
+    size_t maxSequences;
+} SeqCollector;
+
+struct ZSTD_CCtx_params_s {
+    ZSTD_format_e format;
+    ZSTD_compressionParameters cParams;
+    ZSTD_frameParameters fParams;
+
+    int compressionLevel;
+    int forceWindow;           /* force back-references to respect limit of
+                                * 1<<wLog, even for dictionary */
+    size_t targetCBlockSize;   /* Tries to fit compressed block size to be around targetCBlockSize.
+                                * No target when targetCBlockSize == 0.
+                                * There is no guarantee on compressed block size */
+    int srcSizeHint;           /* User's best guess of source size.
+                                * Hint is not valid when srcSizeHint == 0.
+                                * There is no guarantee that hint is close to actual source size */
+
+    ZSTD_dictAttachPref_e attachDictPref;
+    ZSTD_literalCompressionMode_e literalCompressionMode;
+
+    /* Multithreading: used to pass parameters to mtctx */
+    int nbWorkers;
+    size_t jobSize;
+    int overlapLog;
+    int rsyncable;
+
+    /* Long distance matching parameters */
+    ldmParams_t ldmParams;
+
+    /* Internal use, for createCCtxParams() and freeCCtxParams() only */
+    ZSTD_customMem customMem;
+};  /* typedef'd to ZSTD_CCtx_params within "zstd.h" */
+
+struct ZSTD_CCtx_s {
+    ZSTD_compressionStage_e stage;
+    int cParamsChanged;                  /* == 1 if cParams(except wlog) or compression level are changed in requestedParams. Triggers transmission of new params to ZSTDMT (if available) then reset to 0. */
+    int bmi2;                            /* == 1 if the CPU supports BMI2 and 0 otherwise. CPU support is determined dynamically once per context lifetime. */
+    ZSTD_CCtx_params requestedParams;
+    ZSTD_CCtx_params appliedParams;
+    U32   dictID;
+
+    ZSTD_cwksp workspace; /* manages buffer for dynamic allocations */
+    size_t blockSize;
+    unsigned long long pledgedSrcSizePlusOne;  /* this way, 0 (default) == unknown */
+    unsigned long long consumedSrcSize;
+    unsigned long long producedCSize;
+    XXH64_state_t xxhState;
+    ZSTD_customMem customMem;
+    size_t staticSize;
+    SeqCollector seqCollector;
+    int isFirstBlock;
+    int initialized;
+
+    seqStore_t seqStore;      /* sequences storage ptrs */
+    ldmState_t ldmState;      /* long distance matching state */
+    rawSeq* ldmSequences;     /* Storage for the ldm output sequences */
+    size_t maxNbLdmSequences;
+    rawSeqStore_t externSeqStore; /* Mutable reference to external sequences */
+    ZSTD_blockState_t blockState;
+    U32* entropyWorkspace;  /* entropy workspace of HUF_WORKSPACE_SIZE bytes */
+
+    /* streaming */
+    char*  inBuff;
+    size_t inBuffSize;
+    size_t inToCompress;
+    size_t inBuffPos;
+    size_t inBuffTarget;
+    char*  outBuff;
+    size_t outBuffSize;
+    size_t outBuffContentSize;
+    size_t outBuffFlushedSize;
+    ZSTD_cStreamStage streamStage;
+    U32    frameEnded;
+
+    /* Dictionary */
+    ZSTD_localDict localDict;
+    const ZSTD_CDict* cdict;
+    ZSTD_prefixDict prefixDict;   /* single-usage dictionary */
+
+    /* Multi-threading */
+#ifdef ZSTD_MULTITHREAD
+    ZSTDMT_CCtx* mtctx;
+#endif
+};
+
+typedef enum { ZSTD_dtlm_fast, ZSTD_dtlm_full } ZSTD_dictTableLoadMethod_e;
+
+typedef enum { ZSTD_noDict = 0, ZSTD_extDict = 1, ZSTD_dictMatchState = 2 } ZSTD_dictMode_e;
+
+
+typedef size_t (*ZSTD_blockCompressor) (
+        ZSTD_matchState_t* bs, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+ZSTD_blockCompressor ZSTD_selectBlockCompressor(ZSTD_strategy strat, ZSTD_dictMode_e dictMode);
+
+
+MEM_STATIC U32 ZSTD_LLcode(U32 litLength)
+{
+    static const BYTE LL_Code[64] = {  0,  1,  2,  3,  4,  5,  6,  7,
+                                       8,  9, 10, 11, 12, 13, 14, 15,
+                                      16, 16, 17, 17, 18, 18, 19, 19,
+                                      20, 20, 20, 20, 21, 21, 21, 21,
+                                      22, 22, 22, 22, 22, 22, 22, 22,
+                                      23, 23, 23, 23, 23, 23, 23, 23,
+                                      24, 24, 24, 24, 24, 24, 24, 24,
+                                      24, 24, 24, 24, 24, 24, 24, 24 };
+    static const U32 LL_deltaCode = 19;
+    return (litLength > 63) ? ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
+}
+
+/* ZSTD_MLcode() :
+ * note : mlBase = matchLength - MINMATCH;
+ *        because it's the format it's stored in seqStore->sequences */
+MEM_STATIC U32 ZSTD_MLcode(U32 mlBase)
+{
+    static const BYTE ML_Code[128] = { 0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
+                                      16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
+                                      32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 36, 36, 37, 37, 37, 37,
+                                      38, 38, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39,
+                                      40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
+                                      41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
+                                      42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
+                                      42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42 };
+    static const U32 ML_deltaCode = 36;
+    return (mlBase > 127) ? ZSTD_highbit32(mlBase) + ML_deltaCode : ML_Code[mlBase];
+}
+
+typedef struct repcodes_s {
+    U32 rep[3];
+} repcodes_t;
+
+MEM_STATIC repcodes_t ZSTD_updateRep(U32 const rep[3], U32 const offset, U32 const ll0)
+{
+    repcodes_t newReps;
+    if (offset >= ZSTD_REP_NUM) {  /* full offset */
+        newReps.rep[2] = rep[1];
+        newReps.rep[1] = rep[0];
+        newReps.rep[0] = offset - ZSTD_REP_MOVE;
+    } else {   /* repcode */
+        U32 const repCode = offset + ll0;
+        if (repCode > 0) {  /* note : if repCode==0, no change */
+            U32 const currentOffset = (repCode==ZSTD_REP_NUM) ? (rep[0] - 1) : rep[repCode];
+            newReps.rep[2] = (repCode >= 2) ? rep[1] : rep[2];
+            newReps.rep[1] = rep[0];
+            newReps.rep[0] = currentOffset;
+        } else {   /* repCode == 0 */
+            memcpy(&newReps, rep, sizeof(newReps));
+        }
+    }
+    return newReps;
+}
+
+/* ZSTD_cParam_withinBounds:
+ * @return 1 if value is within cParam bounds,
+ * 0 otherwise */
+MEM_STATIC int ZSTD_cParam_withinBounds(ZSTD_cParameter cParam, int value)
+{
+    ZSTD_bounds const bounds = ZSTD_cParam_getBounds(cParam);
+    if (ZSTD_isError(bounds.error)) return 0;
+    if (value < bounds.lowerBound) return 0;
+    if (value > bounds.upperBound) return 0;
+    return 1;
+}
+
+/* ZSTD_noCompressBlock() :
+ * Writes uncompressed block to dst buffer from given src.
+ * Returns the size of the block */
+MEM_STATIC size_t ZSTD_noCompressBlock (void* dst, size_t dstCapacity, const void* src, size_t srcSize, U32 lastBlock)
+{
+    U32 const cBlockHeader24 = lastBlock + (((U32)bt_raw)<<1) + (U32)(srcSize << 3);
+    RETURN_ERROR_IF(srcSize + ZSTDInternalConstants::ZSTD_blockHeaderSize > dstCapacity,
+                    dstSize_tooSmall, "dst buf too small for uncompressed block");
+    MEM_writeLE24(dst, cBlockHeader24);
+    memcpy((BYTE*)dst + ZSTDInternalConstants::ZSTD_blockHeaderSize, src, srcSize);
+    return ZSTDInternalConstants::ZSTD_blockHeaderSize + srcSize;
+}
+
+MEM_STATIC size_t ZSTD_rleCompressBlock (void* dst, size_t dstCapacity, BYTE src, size_t srcSize, U32 lastBlock)
+{
+    BYTE* const op = (BYTE*)dst;
+    U32 const cBlockHeader = lastBlock + (((U32)bt_rle)<<1) + (U32)(srcSize << 3);
+    RETURN_ERROR_IF(dstCapacity < 4, dstSize_tooSmall, "");
+    MEM_writeLE24(op, cBlockHeader);
+    op[3] = src;
+    return 4;
+}
+
+
+/* ZSTD_minGain() :
+ * minimum compression required
+ * to generate a compress block or a compressed literals section.
+ * note : use same formula for both situations */
+MEM_STATIC size_t ZSTD_minGain(size_t srcSize, ZSTD_strategy strat)
+{
+    U32 const minlog = (strat>=ZSTD_btultra) ? (U32)(strat) - 1 : 6;
+    ZSTD_STATIC_ASSERT(ZSTD_btultra == 8);
+    assert(ZSTD_cParam_withinBounds(ZSTD_c_strategy, strat));
+    return (srcSize >> minlog) + 2;
+}
+
+MEM_STATIC int ZSTD_disableLiteralsCompression(const ZSTD_CCtx_params* cctxParams)
+{
+    switch (cctxParams->literalCompressionMode) {
+    case ZSTD_lcm_huffman:
+        return 0;
+    case ZSTD_lcm_uncompressed:
+        return 1;
+    default:
+        assert(0 /* impossible: pre-validated */);
+        /* fall-through */
+    case ZSTD_lcm_auto:
+        return (cctxParams->cParams.strategy == ZSTD_fast) && (cctxParams->cParams.targetLength > 0);
+    }
+}
+
+/*! ZSTD_safecopyLiterals() :
+ *  memcpy() function that won't read beyond more than WILDCOPY_OVERLENGTH bytes past ilimit_w.
+ *  Only called when the sequence ends past ilimit_w, so it only needs to be optimized for single
+ *  large copies.
+ */
+static void ZSTD_safecopyLiterals(BYTE* op, BYTE const* ip, BYTE const* const iend, BYTE const* ilimit_w) {
+    assert(iend > ilimit_w);
+    if (ip <= ilimit_w) {
+        ZSTD_wildcopy(op, ip, ilimit_w - ip, ZSTD_no_overlap);
+        op += ilimit_w - ip;
+        ip = ilimit_w;
+    }
+    while (ip < iend) *op++ = *ip++;
+}
+
+/*! ZSTD_storeSeq() :
+ *  Store a sequence (litlen, litPtr, offCode and mlBase) into seqStore_t.
+ *  `offCode` : distance to match + ZSTD_REP_MOVE (values <= ZSTD_REP_MOVE are repCodes).
+ *  `mlBase` : matchLength - MINMATCH
+ *  Allowed to overread literals up to litLimit.
+*/
+HINT_INLINE UNUSED_ATTR
+void ZSTD_storeSeq(seqStore_t* seqStorePtr, size_t litLength, const BYTE* literals, const BYTE* litLimit, U32 offCode, size_t mlBase)
+{
+    BYTE const* const litLimit_w = litLimit - WILDCOPY_OVERLENGTH;
+    BYTE const* const litEnd = literals + litLength;
+#if defined(DEBUGLEVEL) && (DEBUGLEVEL >= 6)
+    static const BYTE* g_start = NULL;
+    if (g_start==NULL) g_start = (const BYTE*)literals;  /* note : index only works for compression within a single segment */
+    {   U32 const pos = (U32)((const BYTE*)literals - g_start);
+        DEBUGLOG(6, "Cpos%7u :%3u literals, match%4u bytes at offCode%7u",
+               pos, (U32)litLength, (U32)mlBase+MINMATCH, (U32)offCode);
+    }
+#endif
+    assert((size_t)(seqStorePtr->sequences - seqStorePtr->sequencesStart) < seqStorePtr->maxNbSeq);
+    /* copy Literals */
+    assert(seqStorePtr->maxNbLit <= 128 KB);
+    assert(seqStorePtr->lit + litLength <= seqStorePtr->litStart + seqStorePtr->maxNbLit);
+    assert(literals + litLength <= litLimit);
+    if (litEnd <= litLimit_w) {
+        /* Common case we can use wildcopy.
+	 * First copy 16 bytes, because literals are likely short.
+	 */
+        assert(WILDCOPY_OVERLENGTH >= 16);
+        ZSTD_copy16(seqStorePtr->lit, literals);
+        if (litLength > 16) {
+            ZSTD_wildcopy(seqStorePtr->lit+16, literals+16, (ptrdiff_t)litLength-16, ZSTD_no_overlap);
+        }
+    } else {
+        ZSTD_safecopyLiterals(seqStorePtr->lit, literals, litEnd, litLimit_w);
+    }
+    seqStorePtr->lit += litLength;
+
+    /* literal Length */
+    if (litLength>0xFFFF) {
+        assert(seqStorePtr->longLengthID == 0); /* there can only be a single long length */
+        seqStorePtr->longLengthID = 1;
+        seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
+    }
+    seqStorePtr->sequences[0].litLength = (U16)litLength;
+
+    /* match offset */
+    seqStorePtr->sequences[0].offset = offCode + 1;
+
+    /* match Length */
+    if (mlBase>0xFFFF) {
+        assert(seqStorePtr->longLengthID == 0); /* there can only be a single long length */
+        seqStorePtr->longLengthID = 2;
+        seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
+    }
+    seqStorePtr->sequences[0].matchLength = (U16)mlBase;
+
+    seqStorePtr->sequences++;
+}
+
+
+/*-*************************************
+*  Match length counter
+***************************************/
+static unsigned ZSTD_NbCommonBytes (size_t val)
+{
+    if (MEM_isLittleEndian()) {
+        if (MEM_64bits()) {
+#       if defined(_MSC_VER) && defined(_WIN64)
+            unsigned long r = 0;
+            return _BitScanForward64( &r, (U64)val ) ? (unsigned)(r >> 3) : 0;
+#       elif defined(__GNUC__) && (__GNUC__ >= 4)
+            return (__builtin_ctzll((U64)val) >> 3);
+#       else
+            static const int DeBruijnBytePos[64] = { 0, 0, 0, 0, 0, 1, 1, 2,
+                                                     0, 3, 1, 3, 1, 4, 2, 7,
+                                                     0, 2, 3, 6, 1, 5, 3, 5,
+                                                     1, 3, 4, 4, 2, 5, 6, 7,
+                                                     7, 0, 1, 2, 3, 3, 4, 6,
+                                                     2, 6, 5, 5, 3, 4, 5, 6,
+                                                     7, 1, 2, 4, 6, 4, 4, 5,
+                                                     7, 2, 6, 5, 7, 6, 7, 7 };
+            return DeBruijnBytePos[((U64)((val & -(long long)val) * 0x0218A392CDABBD3FULL)) >> 58];
+#       endif
+        } else { /* 32 bits */
+#       if defined(_MSC_VER)
+            unsigned long r=0;
+            return _BitScanForward( &r, (U32)val ) ? (unsigned)(r >> 3) : 0;
+#       elif defined(__GNUC__) && (__GNUC__ >= 3)
+            return (__builtin_ctz((U32)val) >> 3);
+#       else
+            static const int DeBruijnBytePos[32] = { 0, 0, 3, 0, 3, 1, 3, 0,
+                                                     3, 2, 2, 1, 3, 2, 0, 1,
+                                                     3, 3, 1, 2, 2, 2, 2, 0,
+                                                     3, 1, 2, 0, 1, 0, 1, 1 };
+            return DeBruijnBytePos[((U32)((val & -(S32)val) * 0x077CB531U)) >> 27];
+#       endif
+        }
+    } else {  /* Big Endian CPU */
+        if (MEM_64bits()) {
+#       if defined(_MSC_VER) && defined(_WIN64)
+            unsigned long r = 0;
+            return _BitScanReverse64( &r, val ) ? (unsigned)(r >> 3) : 0;
+#       elif defined(__GNUC__) && (__GNUC__ >= 4)
+            return (__builtin_clzll(val) >> 3);
+#       else
+            unsigned r;
+            const unsigned n32 = sizeof(size_t)*4;   /* calculate this way due to compiler complaining in 32-bits mode */
+            if (!(val>>n32)) { r=4; } else { r=0; val>>=n32; }
+            if (!(val>>16)) { r+=2; val>>=8; } else { val>>=24; }
+            r += (!val);
+            return r;
+#       endif
+        } else { /* 32 bits */
+#       if defined(_MSC_VER)
+            unsigned long r = 0;
+            return _BitScanReverse( &r, (unsigned long)val ) ? (unsigned)(r >> 3) : 0;
+#       elif defined(__GNUC__) && (__GNUC__ >= 3)
+            return (__builtin_clz((U32)val) >> 3);
+#       else
+            unsigned r;
+            if (!(val>>16)) { r=2; val>>=8; } else { r=0; val>>=24; }
+            r += (!val);
+            return r;
+#       endif
+    }   }
+}
+
+
+MEM_STATIC size_t ZSTD_count(const BYTE* pIn, const BYTE* pMatch, const BYTE* const pInLimit)
+{
+    const BYTE* const pStart = pIn;
+    const BYTE* const pInLoopLimit = pInLimit - (sizeof(size_t)-1);
+
+    if (pIn < pInLoopLimit) {
+        { size_t const diff = MEM_readST(pMatch) ^ MEM_readST(pIn);
+          if (diff) return ZSTD_NbCommonBytes(diff); }
+        pIn+=sizeof(size_t); pMatch+=sizeof(size_t);
+        while (pIn < pInLoopLimit) {
+            size_t const diff = MEM_readST(pMatch) ^ MEM_readST(pIn);
+            if (!diff) { pIn+=sizeof(size_t); pMatch+=sizeof(size_t); continue; }
+            pIn += ZSTD_NbCommonBytes(diff);
+            return (size_t)(pIn - pStart);
+    }   }
+    if (MEM_64bits() && (pIn<(pInLimit-3)) && (MEM_read32(pMatch) == MEM_read32(pIn))) { pIn+=4; pMatch+=4; }
+    if ((pIn<(pInLimit-1)) && (MEM_read16(pMatch) == MEM_read16(pIn))) { pIn+=2; pMatch+=2; }
+    if ((pIn<pInLimit) && (*pMatch == *pIn)) pIn++;
+    return (size_t)(pIn - pStart);
+}
+
+/** ZSTD_count_2segments() :
+ *  can count match length with `ip` & `match` in 2 different segments.
+ *  convention : on reaching mEnd, match count continue starting from iStart
+ */
+MEM_STATIC size_t
+ZSTD_count_2segments(const BYTE* ip, const BYTE* match,
+                     const BYTE* iEnd, const BYTE* mEnd, const BYTE* iStart)
+{
+    const BYTE* const vEnd = MIN( ip + (mEnd - match), iEnd);
+    size_t const matchLength = ZSTD_count(ip, match, vEnd);
+    if (match + matchLength != mEnd) return matchLength;
+    DEBUGLOG(7, "ZSTD_count_2segments: found a 2-parts match (current length==%zu)", matchLength);
+    DEBUGLOG(7, "distance from match beginning to end dictionary = %zi", mEnd - match);
+    DEBUGLOG(7, "distance from current pos to end buffer = %zi", iEnd - ip);
+    DEBUGLOG(7, "next byte : ip==%02X, istart==%02X", ip[matchLength], *iStart);
+    DEBUGLOG(7, "final match length = %zu", matchLength + ZSTD_count(ip+matchLength, iStart, iEnd));
+    return matchLength + ZSTD_count(ip+matchLength, iStart, iEnd);
+}
+
+
+/*-*************************************
+ *  Hashes
+ ***************************************/
+static const U32 prime3bytes = 506832829U;
+static U32    ZSTD_hash3(U32 u, U32 h) { return ((u << (32-24)) * prime3bytes)  >> (32-h) ; }
+MEM_STATIC size_t ZSTD_hash3Ptr(const void* ptr, U32 h) { return ZSTD_hash3(MEM_readLE32(ptr), h); } /* only in zstd_opt.h */
+
+static const U32 prime4bytes = 2654435761U;
+static U32    ZSTD_hash4(U32 u, U32 h) { return (u * prime4bytes) >> (32-h) ; }
+static size_t ZSTD_hash4Ptr(const void* ptr, U32 h) { return ZSTD_hash4(MEM_read32(ptr), h); }
+
+static const U64 prime5bytes = 889523592379ULL;
+static size_t ZSTD_hash5(U64 u, U32 h) { return (size_t)(((u  << (64-40)) * prime5bytes) >> (64-h)) ; }
+static size_t ZSTD_hash5Ptr(const void* p, U32 h) { return ZSTD_hash5(MEM_readLE64(p), h); }
+
+static const U64 prime6bytes = 227718039650203ULL;
+static size_t ZSTD_hash6(U64 u, U32 h) { return (size_t)(((u  << (64-48)) * prime6bytes) >> (64-h)) ; }
+static size_t ZSTD_hash6Ptr(const void* p, U32 h) { return ZSTD_hash6(MEM_readLE64(p), h); }
+
+static const U64 prime7bytes = 58295818150454627ULL;
+static size_t ZSTD_hash7(U64 u, U32 h) { return (size_t)(((u  << (64-56)) * prime7bytes) >> (64-h)) ; }
+static size_t ZSTD_hash7Ptr(const void* p, U32 h) { return ZSTD_hash7(MEM_readLE64(p), h); }
+
+static const U64 prime8bytes = 0xCF1BBCDCB7A56463ULL;
+static size_t ZSTD_hash8(U64 u, U32 h) { return (size_t)(((u) * prime8bytes) >> (64-h)) ; }
+static size_t ZSTD_hash8Ptr(const void* p, U32 h) { return ZSTD_hash8(MEM_readLE64(p), h); }
+
+MEM_STATIC size_t ZSTD_hashPtr(const void* p, U32 hBits, U32 mls)
+{
+    switch(mls)
+    {
+    default:
+    case 4: return ZSTD_hash4Ptr(p, hBits);
+    case 5: return ZSTD_hash5Ptr(p, hBits);
+    case 6: return ZSTD_hash6Ptr(p, hBits);
+    case 7: return ZSTD_hash7Ptr(p, hBits);
+    case 8: return ZSTD_hash8Ptr(p, hBits);
+    }
+}
+
+/** ZSTD_ipow() :
+ * Return base^exponent.
+ */
+static U64 ZSTD_ipow(U64 base, U64 exponent)
+{
+    U64 power = 1;
+    while (exponent) {
+      if (exponent & 1) power *= base;
+      exponent >>= 1;
+      base *= base;
+    }
+    return power;
+}
+
+#define ZSTD_ROLL_HASH_CHAR_OFFSET 10
+
+/** ZSTD_rollingHash_append() :
+ * Add the buffer to the hash value.
+ */
+static U64 ZSTD_rollingHash_append(U64 hash, void const* buf, size_t size)
+{
+    BYTE const* istart = (BYTE const*)buf;
+    size_t pos;
+    for (pos = 0; pos < size; ++pos) {
+        hash *= prime8bytes;
+        hash += istart[pos] + ZSTD_ROLL_HASH_CHAR_OFFSET;
+    }
+    return hash;
+}
+
+/** ZSTD_rollingHash_compute() :
+ * Compute the rolling hash value of the buffer.
+ */
+MEM_STATIC U64 ZSTD_rollingHash_compute(void const* buf, size_t size)
+{
+    return ZSTD_rollingHash_append(0, buf, size);
+}
+
+/** ZSTD_rollingHash_primePower() :
+ * Compute the primePower to be passed to ZSTD_rollingHash_rotate() for a hash
+ * over a window of length bytes.
+ */
+MEM_STATIC U64 ZSTD_rollingHash_primePower(U32 length)
+{
+    return ZSTD_ipow(prime8bytes, length - 1);
+}
+
+/** ZSTD_rollingHash_rotate() :
+ * Rotate the rolling hash by one byte.
+ */
+MEM_STATIC U64 ZSTD_rollingHash_rotate(U64 hash, BYTE toRemove, BYTE toAdd, U64 primePower)
+{
+    hash -= (toRemove + ZSTD_ROLL_HASH_CHAR_OFFSET) * primePower;
+    hash *= prime8bytes;
+    hash += toAdd + ZSTD_ROLL_HASH_CHAR_OFFSET;
+    return hash;
+}
+
+/*-*************************************
+*  Round buffer management
+***************************************/
+#if (ZSTD_WINDOWLOG_MAX_64 > 31)
+# error "ZSTD_WINDOWLOG_MAX is too large : would overflow ZSTD_CURRENT_MAX"
+#endif
+/* Max current allowed */
+#define ZSTD_CURRENT_MAX ((3U << 29) + (1U << ZSTD_WINDOWLOG_MAX))
+/* Maximum chunk size before overflow correction needs to be called again */
+#define ZSTD_CHUNKSIZE_MAX                                                     \
+    ( ((U32)-1)                  /* Maximum ending current index */            \
+    - ZSTD_CURRENT_MAX)          /* Maximum beginning lowLimit */
+
+/**
+ * ZSTD_window_clear():
+ * Clears the window containing the history by simply setting it to empty.
+ */
+MEM_STATIC void ZSTD_window_clear(ZSTD_window_t* window)
+{
+    size_t const endT = (size_t)(window->nextSrc - window->base);
+    U32 const end = (U32)endT;
+
+    window->lowLimit = end;
+    window->dictLimit = end;
+}
+
+/**
+ * ZSTD_window_hasExtDict():
+ * Returns non-zero if the window has a non-empty extDict.
+ */
+MEM_STATIC U32 ZSTD_window_hasExtDict(ZSTD_window_t const window)
+{
+    return window.lowLimit < window.dictLimit;
+}
+
+/**
+ * ZSTD_matchState_dictMode():
+ * Inspects the provided matchState and figures out what dictMode should be
+ * passed to the compressor.
+ */
+MEM_STATIC ZSTD_dictMode_e ZSTD_matchState_dictMode(const ZSTD_matchState_t *ms)
+{
+    return ZSTD_window_hasExtDict(ms->window) ?
+        ZSTD_extDict :
+        ms->dictMatchState != NULL ?
+            ZSTD_dictMatchState :
+            ZSTD_noDict;
+}
+
+/**
+ * ZSTD_window_needOverflowCorrection():
+ * Returns non-zero if the indices are getting too large and need overflow
+ * protection.
+ */
+MEM_STATIC U32 ZSTD_window_needOverflowCorrection(ZSTD_window_t const window,
+                                                  void const* srcEnd)
+{
+    U32 const current = (U32)((BYTE const*)srcEnd - window.base);
+    return current > ZSTD_CURRENT_MAX;
+}
+
+/**
+ * ZSTD_window_correctOverflow():
+ * Reduces the indices to protect from index overflow.
+ * Returns the correction made to the indices, which must be applied to every
+ * stored index.
+ *
+ * The least significant cycleLog bits of the indices must remain the same,
+ * which may be 0. Every index up to maxDist in the past must be valid.
+ * NOTE: (maxDist & cycleMask) must be zero.
+ */
+MEM_STATIC U32 ZSTD_window_correctOverflow(ZSTD_window_t* window, U32 cycleLog,
+                                           U32 maxDist, void const* src)
+{
+    /* preemptive overflow correction:
+     * 1. correction is large enough:
+     *    lowLimit > (3<<29) ==> current > 3<<29 + 1<<windowLog
+     *    1<<windowLog <= newCurrent < 1<<chainLog + 1<<windowLog
+     *
+     *    current - newCurrent
+     *    > (3<<29 + 1<<windowLog) - (1<<windowLog + 1<<chainLog)
+     *    > (3<<29) - (1<<chainLog)
+     *    > (3<<29) - (1<<30)             (NOTE: chainLog <= 30)
+     *    > 1<<29
+     *
+     * 2. (ip+ZSTD_CHUNKSIZE_MAX - cctx->base) doesn't overflow:
+     *    After correction, current is less than (1<<chainLog + 1<<windowLog).
+     *    In 64-bit mode we are safe, because we have 64-bit ptrdiff_t.
+     *    In 32-bit mode we are safe, because (chainLog <= 29), so
+     *    ip+ZSTD_CHUNKSIZE_MAX - cctx->base < 1<<32.
+     * 3. (cctx->lowLimit + 1<<windowLog) < 1<<32:
+     *    windowLog <= 31 ==> 3<<29 + 1<<windowLog < 7<<29 < 1<<32.
+     */
+    U32 const cycleMask = (1U << cycleLog) - 1;
+    U32 const current = (U32)((BYTE const*)src - window->base);
+    U32 const currentCycle0 = current & cycleMask;
+    /* Exclude zero so that newCurrent - maxDist >= 1. */
+    U32 const currentCycle1 = currentCycle0 == 0 ? (1U << cycleLog) : currentCycle0;
+    U32 const newCurrent = currentCycle1 + maxDist;
+    U32 const correction = current - newCurrent;
+    assert((maxDist & cycleMask) == 0);
+    assert(current > newCurrent);
+    /* Loose bound, should be around 1<<29 (see above) */
+    assert(correction > 1<<28);
+
+    window->base += correction;
+    window->dictBase += correction;
+    if (window->lowLimit <= correction) window->lowLimit = 1;
+    else window->lowLimit -= correction;
+    if (window->dictLimit <= correction) window->dictLimit = 1;
+    else window->dictLimit -= correction;
+
+    /* Ensure we can still reference the full window. */
+    assert(newCurrent >= maxDist);
+    assert(newCurrent - maxDist >= 1);
+    /* Ensure that lowLimit and dictLimit didn't underflow. */
+    assert(window->lowLimit <= newCurrent);
+    assert(window->dictLimit <= newCurrent);
+
+    DEBUGLOG(4, "Correction of 0x%x bytes to lowLimit=0x%x", correction,
+             window->lowLimit);
+    return correction;
+}
+
+/**
+ * ZSTD_window_enforceMaxDist():
+ * Updates lowLimit so that:
+ *    (srcEnd - base) - lowLimit == maxDist + loadedDictEnd
+ *
+ * It ensures index is valid as long as index >= lowLimit.
+ * This must be called before a block compression call.
+ *
+ * loadedDictEnd is only defined if a dictionary is in use for current compression.
+ * As the name implies, loadedDictEnd represents the index at end of dictionary.
+ * The value lies within context's referential, it can be directly compared to blockEndIdx.
+ *
+ * If loadedDictEndPtr is NULL, no dictionary is in use, and we use loadedDictEnd == 0.
+ * If loadedDictEndPtr is not NULL, we set it to zero after updating lowLimit.
+ * This is because dictionaries are allowed to be referenced fully
+ * as long as the last byte of the dictionary is in the window.
+ * Once input has progressed beyond window size, dictionary cannot be referenced anymore.
+ *
+ * In normal dict mode, the dictionary lies between lowLimit and dictLimit.
+ * In dictMatchState mode, lowLimit and dictLimit are the same,
+ * and the dictionary is below them.
+ * forceWindow and dictMatchState are therefore incompatible.
+ */
+MEM_STATIC void
+ZSTD_window_enforceMaxDist(ZSTD_window_t* window,
+                     const void* blockEnd,
+                           U32   maxDist,
+                           U32*  loadedDictEndPtr,
+                     const ZSTD_matchState_t** dictMatchStatePtr)
+{
+    U32 const blockEndIdx = (U32)((BYTE const*)blockEnd - window->base);
+    U32 const loadedDictEnd = (loadedDictEndPtr != NULL) ? *loadedDictEndPtr : 0;
+    DEBUGLOG(5, "ZSTD_window_enforceMaxDist: blockEndIdx=%u, maxDist=%u, loadedDictEnd=%u",
+                (unsigned)blockEndIdx, (unsigned)maxDist, (unsigned)loadedDictEnd);
+
+    /* - When there is no dictionary : loadedDictEnd == 0.
+         In which case, the test (blockEndIdx > maxDist) is merely to avoid
+         overflowing next operation `newLowLimit = blockEndIdx - maxDist`.
+       - When there is a standard dictionary :
+         Index referential is copied from the dictionary,
+         which means it starts from 0.
+         In which case, loadedDictEnd == dictSize,
+         and it makes sense to compare `blockEndIdx > maxDist + dictSize`
+         since `blockEndIdx` also starts from zero.
+       - When there is an attached dictionary :
+         loadedDictEnd is expressed within the referential of the context,
+         so it can be directly compared against blockEndIdx.
+    */
+    if (blockEndIdx > maxDist + loadedDictEnd) {
+        U32 const newLowLimit = blockEndIdx - maxDist;
+        if (window->lowLimit < newLowLimit) window->lowLimit = newLowLimit;
+        if (window->dictLimit < window->lowLimit) {
+            DEBUGLOG(5, "Update dictLimit to match lowLimit, from %u to %u",
+                        (unsigned)window->dictLimit, (unsigned)window->lowLimit);
+            window->dictLimit = window->lowLimit;
+        }
+        /* On reaching window size, dictionaries are invalidated */
+        if (loadedDictEndPtr) *loadedDictEndPtr = 0;
+        if (dictMatchStatePtr) *dictMatchStatePtr = NULL;
+    }
+}
+
+/* Similar to ZSTD_window_enforceMaxDist(),
+ * but only invalidates dictionary
+ * when input progresses beyond window size.
+ * assumption : loadedDictEndPtr and dictMatchStatePtr are valid (non NULL)
+ *              loadedDictEnd uses same referential as window->base
+ *              maxDist is the window size */
+MEM_STATIC void
+ZSTD_checkDictValidity(const ZSTD_window_t* window,
+                       const void* blockEnd,
+                             U32   maxDist,
+                             U32*  loadedDictEndPtr,
+                       const ZSTD_matchState_t** dictMatchStatePtr)
+{
+    assert(loadedDictEndPtr != NULL);
+    assert(dictMatchStatePtr != NULL);
+    {   U32 const blockEndIdx = (U32)((BYTE const*)blockEnd - window->base);
+        U32 const loadedDictEnd = *loadedDictEndPtr;
+        DEBUGLOG(5, "ZSTD_checkDictValidity: blockEndIdx=%u, maxDist=%u, loadedDictEnd=%u",
+                    (unsigned)blockEndIdx, (unsigned)maxDist, (unsigned)loadedDictEnd);
+        assert(blockEndIdx >= loadedDictEnd);
+
+        if (blockEndIdx > loadedDictEnd + maxDist) {
+            /* On reaching window size, dictionaries are invalidated.
+             * For simplification, if window size is reached anywhere within next block,
+             * the dictionary is invalidated for the full block.
+             */
+            DEBUGLOG(6, "invalidating dictionary for current block (distance > windowSize)");
+            *loadedDictEndPtr = 0;
+            *dictMatchStatePtr = NULL;
+        } else {
+            if (*loadedDictEndPtr != 0) {
+                DEBUGLOG(6, "dictionary considered valid for current block");
+    }   }   }
+}
+
+MEM_STATIC void ZSTD_window_init(ZSTD_window_t* window) {
+    memset(window, 0, sizeof(*window));
+    window->base = (BYTE const*)"";
+    window->dictBase = (BYTE const*)"";
+    window->dictLimit = 1;    /* start from 1, so that 1st position is valid */
+    window->lowLimit = 1;     /* it ensures first and later CCtx usages compress the same */
+    window->nextSrc = window->base + 1;   /* see issue #1241 */
+}
+
+/**
+ * ZSTD_window_update():
+ * Updates the window by appending [src, src + srcSize) to the window.
+ * If it is not contiguous, the current prefix becomes the extDict, and we
+ * forget about the extDict. Handles overlap of the prefix and extDict.
+ * Returns non-zero if the segment is contiguous.
+ */
+MEM_STATIC U32 ZSTD_window_update(ZSTD_window_t* window,
+                                  void const* src, size_t srcSize)
+{
+    BYTE const* const ip = (BYTE const*)src;
+    U32 contiguous = 1;
+    DEBUGLOG(5, "ZSTD_window_update");
+    if (srcSize == 0)
+        return contiguous;
+    assert(window->base != NULL);
+    assert(window->dictBase != NULL);
+    /* Check if blocks follow each other */
+    if (src != window->nextSrc) {
+        /* not contiguous */
+        size_t const distanceFromBase = (size_t)(window->nextSrc - window->base);
+        DEBUGLOG(5, "Non contiguous blocks, new segment starts at %u", window->dictLimit);
+        window->lowLimit = window->dictLimit;
+        assert(distanceFromBase == (size_t)(U32)distanceFromBase);  /* should never overflow */
+        window->dictLimit = (U32)distanceFromBase;
+        window->dictBase = window->base;
+        window->base = ip - distanceFromBase;
+        /* ms->nextToUpdate = window->dictLimit; */
+        if (window->dictLimit - window->lowLimit < HASH_READ_SIZE) window->lowLimit = window->dictLimit;   /* too small extDict */
+        contiguous = 0;
+    }
+    window->nextSrc = ip + srcSize;
+    /* if input and dictionary overlap : reduce dictionary (area presumed modified by input) */
+    if ( (ip+srcSize > window->dictBase + window->lowLimit)
+       & (ip < window->dictBase + window->dictLimit)) {
+        ptrdiff_t const highInputIdx = (ip + srcSize) - window->dictBase;
+        U32 const lowLimitMax = (highInputIdx > (ptrdiff_t)window->dictLimit) ? window->dictLimit : (U32)highInputIdx;
+        window->lowLimit = lowLimitMax;
+        DEBUGLOG(5, "Overlapping extDict and input : new lowLimit = %u", window->lowLimit);
+    }
+    return contiguous;
+}
+
+/**
+ * Returns the lowest allowed match index. It may either be in the ext-dict or the prefix.
+ */
+MEM_STATIC U32 ZSTD_getLowestMatchIndex(const ZSTD_matchState_t* ms, U32 current, unsigned windowLog)
+{
+    U32    const maxDistance = 1U << windowLog;
+    U32    const lowestValid = ms->window.lowLimit;
+    U32    const withinWindow = (current - lowestValid > maxDistance) ? current - maxDistance : lowestValid;
+    U32    const isDictionary = (ms->loadedDictEnd != 0);
+    U32    const matchLowest = isDictionary ? lowestValid : withinWindow;
+    return matchLowest;
+}
+
+/**
+ * Returns the lowest allowed match index in the prefix.
+ */
+MEM_STATIC U32 ZSTD_getLowestPrefixIndex(const ZSTD_matchState_t* ms, U32 current, unsigned windowLog)
+{
+    U32    const maxDistance = 1U << windowLog;
+    U32    const lowestValid = ms->window.dictLimit;
+    U32    const withinWindow = (current - lowestValid > maxDistance) ? current - maxDistance : lowestValid;
+    U32    const isDictionary = (ms->loadedDictEnd != 0);
+    U32    const matchLowest = isDictionary ? lowestValid : withinWindow;
+    return matchLowest;
+}
+
+
+
+/* debug functions */
+#if (DEBUGLEVEL>=2)
+
+MEM_STATIC double ZSTD_fWeight(U32 rawStat)
+{
+    U32 const fp_accuracy = 8;
+    U32 const fp_multiplier = (1 << fp_accuracy);
+    U32 const newStat = rawStat + 1;
+    U32 const hb = ZSTD_highbit32(newStat);
+    U32 const BWeight = hb * fp_multiplier;
+    U32 const FWeight = (newStat << fp_accuracy) >> hb;
+    U32 const weight = BWeight + FWeight;
+    assert(hb + fp_accuracy < 31);
+    return (double)weight / fp_multiplier;
+}
+
+/* display a table content,
+ * listing each element, its frequency, and its predicted bit cost */
+MEM_STATIC void ZSTD_debugTable(const U32* table, U32 max)
+{
+    unsigned u, sum;
+    for (u=0, sum=0; u<=max; u++) sum += table[u];
+    DEBUGLOG(2, "total nb elts: %u", sum);
+    for (u=0; u<=max; u++) {
+        DEBUGLOG(2, "%2u: %5u  (%.2f)",
+                u, table[u], ZSTD_fWeight(sum) - ZSTD_fWeight(table[u]) );
+    }
+}
+
+#endif
+
+/* ===============================================================
+ * Shared internal declarations
+ * These prototypes may be called from sources not in lib/compress
+ * =============================================================== */
+
+/* ZSTD_loadCEntropy() :
+ * dict : must point at beginning of a valid zstd dictionary.
+ * return : size of dictionary header (size of magic number + dict ID + entropy tables)
+ * assumptions : magic number supposed already checked
+ *               and dictSize >= 8 */
+size_t ZSTD_loadCEntropy(ZSTD_compressedBlockState_t* bs, void* workspace,
+                         short* offcodeNCount, unsigned* offcodeMaxValue,
+                         const void* const dict, size_t dictSize);
+
+void ZSTD_reset_compressedBlockState(ZSTD_compressedBlockState_t* bs);
+
+/* ==============================================================
+ * Private declarations
+ * These prototypes shall only be called from within lib/compress
+ * ============================================================== */
+
+/* ZSTD_getCParamsFromCCtxParams() :
+ * cParams are built depending on compressionLevel, src size hints,
+ * LDM and manually set compression parameters.
+ * Note: srcSizeHint == 0 means 0!
+ */
+ZSTD_compressionParameters ZSTD_getCParamsFromCCtxParams(
+        const ZSTD_CCtx_params* CCtxParams, U64 srcSizeHint, size_t dictSize);
+
+/*! ZSTD_initCStream_internal() :
+ *  Private use only. Init streaming operation.
+ *  expects params to be valid.
+ *  must receive dict, or cdict, or none, but not both.
+ *  @return : 0, or an error code */
+size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
+                     const void* dict, size_t dictSize,
+                     const ZSTD_CDict* cdict,
+                     const ZSTD_CCtx_params* params, unsigned long long pledgedSrcSize);
+
+void ZSTD_resetSeqStore(seqStore_t* ssPtr);
+
+/*! ZSTD_getCParamsFromCDict() :
+ *  as the name implies */
+ZSTD_compressionParameters ZSTD_getCParamsFromCDict(const ZSTD_CDict* cdict);
+
+/* ZSTD_compressBegin_advanced_internal() :
+ * Private use only. To be called from zstdmt_compress.c. */
+size_t ZSTD_compressBegin_advanced_internal(ZSTD_CCtx* cctx,
+                                    const void* dict, size_t dictSize,
+                                    ZSTD_dictContentType_e dictContentType,
+                                    ZSTD_dictTableLoadMethod_e dtlm,
+                                    const ZSTD_CDict* cdict,
+                                    const ZSTD_CCtx_params* params,
+                                    unsigned long long pledgedSrcSize);
+
+/* ZSTD_compress_advanced_internal() :
+ * Private use only. To be called from zstdmt_compress.c. */
+size_t ZSTD_compress_advanced_internal(ZSTD_CCtx* cctx,
+                                       void* dst, size_t dstCapacity,
+                                 const void* src, size_t srcSize,
+                                 const void* dict,size_t dictSize,
+                                 const ZSTD_CCtx_params* params);
+
+
+/* ZSTD_writeLastEmptyBlock() :
+ * output an empty Block with end-of-frame mark to complete a frame
+ * @return : size of data written into `dst` (== ZSTD_blockHeaderSize (defined in zstd_internal.h))
+ *           or an error code if `dstCapacity` is too small (<ZSTD_blockHeaderSize)
+ */
+size_t ZSTD_writeLastEmptyBlock(void* dst, size_t dstCapacity);
+
+
+/* ZSTD_referenceExternalSequences() :
+ * Must be called before starting a compression operation.
+ * seqs must parse a prefix of the source.
+ * This cannot be used when long range matching is enabled.
+ * Zstd will use these sequences, and pass the literals to a secondary block
+ * compressor.
+ * @return : An error code on failure.
+ * NOTE: seqs are not verified! Invalid sequences can cause out-of-bounds memory
+ * access and data corruption.
+ */
+size_t ZSTD_referenceExternalSequences(ZSTD_CCtx* cctx, rawSeq* seq, size_t nbSeq);
+
+/** ZSTD_cycleLog() :
+ *  condition for correct operation : hashLog > 1 */
+U32 ZSTD_cycleLog(U32 hashLog, ZSTD_strategy strat);
+
+}
+
+#endif /* ZSTD_COMPRESS_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_literals.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_literals.h
new file mode 100644
index 0000000000..13a320958e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_literals.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_COMPRESS_LITERALS_H
+#define ZSTD_COMPRESS_LITERALS_H
+
+#include "zstd/compress/zstd_compress_internal.h" /* ZSTD_hufCTables_t, ZSTD_minGain() */
+
+namespace lbug_zstd {
+
+size_t ZSTD_noCompressLiterals (void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+
+size_t ZSTD_compressRleLiteralsBlock (void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+
+size_t ZSTD_compressLiterals (ZSTD_hufCTables_t const* prevHuf,
+                              ZSTD_hufCTables_t* nextHuf,
+                              ZSTD_strategy strategy, int disableLiteralCompression,
+                              void* dst, size_t dstCapacity,
+                        const void* src, size_t srcSize,
+                              void* entropyWorkspace, size_t entropyWorkspaceSize,
+                        const int bmi2);
+
+}
+
+#endif /* ZSTD_COMPRESS_LITERALS_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_sequences.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_sequences.h
new file mode 100644
index 0000000000..8646f36948
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_sequences.h
@@ -0,0 +1,59 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_COMPRESS_SEQUENCES_H
+#define ZSTD_COMPRESS_SEQUENCES_H
+
+#include "zstd/common/fse.h" /* FSE_repeat, FSE_CTable */
+#include "zstd/common/zstd_internal.h" /* symbolEncodingType_e, ZSTD_strategy */
+
+namespace lbug_zstd {
+
+typedef enum {
+    ZSTD_defaultDisallowed = 0,
+    ZSTD_defaultAllowed = 1
+} ZSTD_defaultPolicy_e;
+
+symbolEncodingType_e
+ZSTD_selectEncodingType(
+        FSE_repeat* repeatMode, unsigned const* count, unsigned const max,
+        size_t const mostFrequent, size_t nbSeq, unsigned const FSELog,
+        FSE_CTable const* prevCTable,
+        short const* defaultNorm, U32 defaultNormLog,
+        ZSTD_defaultPolicy_e const isDefaultAllowed,
+        ZSTD_strategy const strategy);
+
+size_t
+ZSTD_buildCTable(void* dst, size_t dstCapacity,
+                FSE_CTable* nextCTable, U32 FSELog, symbolEncodingType_e type,
+                unsigned* count, U32 max,
+                const BYTE* codeTable, size_t nbSeq,
+                const S16* defaultNorm, U32 defaultNormLog, U32 defaultMax,
+                const FSE_CTable* prevCTable, size_t prevCTableSize,
+                void* entropyWorkspace, size_t entropyWorkspaceSize);
+
+size_t ZSTD_encodeSequences(
+            void* dst, size_t dstCapacity,
+            FSE_CTable const* CTable_MatchLength, BYTE const* mlCodeTable,
+            FSE_CTable const* CTable_OffsetBits, BYTE const* ofCodeTable,
+            FSE_CTable const* CTable_LitLength, BYTE const* llCodeTable,
+            seqDef const* sequences, size_t nbSeq, int longOffsets, int bmi2);
+
+size_t ZSTD_fseBitCost(
+    FSE_CTable const* ctable,
+    unsigned const* count,
+    unsigned const max);
+
+size_t ZSTD_crossEntropyCost(short const* norm, unsigned accuracyLog,
+                             unsigned const* count, unsigned const max);
+
+}
+
+#endif /* ZSTD_COMPRESS_SEQUENCES_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_superblock.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_superblock.h
new file mode 100644
index 0000000000..df6a5f4967
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_compress_superblock.h
@@ -0,0 +1,35 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_COMPRESS_ADVANCED_H
+#define ZSTD_COMPRESS_ADVANCED_H
+
+/*-*************************************
+*  Dependencies
+***************************************/
+
+#include "zstd.h" /* ZSTD_CCtx */
+
+namespace lbug_zstd {
+/*-*************************************
+*  Target Compressed Block Size
+***************************************/
+
+/* ZSTD_compressSuperBlock() :
+ * Used to compress a super block when targetCBlockSize is being used.
+ * The given block will be compressed into multiple sub blocks that are around targetCBlockSize. */
+size_t ZSTD_compressSuperBlock(ZSTD_CCtx* zc,
+                               void* dst, size_t dstCapacity,
+                               void const* src, size_t srcSize,
+                               unsigned lastBlock);
+}
+
+
+#endif /* ZSTD_COMPRESS_ADVANCED_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_cwksp.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_cwksp.h
new file mode 100644
index 0000000000..506517885e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_cwksp.h
@@ -0,0 +1,525 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_CWKSP_H
+#define ZSTD_CWKSP_H
+
+/*-*************************************
+*  Dependencies
+***************************************/
+#include "zstd/common/zstd_internal.h"
+
+/*-*************************************
+*  Constants
+***************************************/
+
+/* Since the workspace is effectively its own little malloc implementation /
+ * arena, when we run under ASAN, we should similarly insert redzones between
+ * each internal element of the workspace, so ASAN will catch overruns that
+ * reach outside an object but that stay inside the workspace.
+ *
+ * This defines the size of that redzone.
+ */
+#ifndef ZSTD_CWKSP_ASAN_REDZONE_SIZE
+#define ZSTD_CWKSP_ASAN_REDZONE_SIZE 128
+#endif
+
+#if defined (MEMORY_SANITIZER)
+#include <sanitizer/msan_interface.h>
+#endif
+
+namespace lbug_zstd {
+
+/*-*************************************
+*  Structures
+***************************************/
+typedef enum {
+    ZSTD_cwksp_alloc_objects,
+    ZSTD_cwksp_alloc_buffers,
+    ZSTD_cwksp_alloc_aligned
+} ZSTD_cwksp_alloc_phase_e;
+
+/**
+ * Zstd fits all its internal datastructures into a single continuous buffer,
+ * so that it only needs to perform a single OS allocation (or so that a buffer
+ * can be provided to it and it can perform no allocations at all). This buffer
+ * is called the workspace.
+ *
+ * Several optimizations complicate that process of allocating memory ranges
+ * from this workspace for each internal datastructure:
+ *
+ * - These different internal datastructures have different setup requirements:
+ *
+ *   - The static objects need to be cleared once and can then be trivially
+ *     reused for each compression.
+ *
+ *   - Various buffers don't need to be initialized at all--they are always
+ *     written into before they're read.
+ *
+ *   - The matchstate tables have a unique requirement that they don't need
+ *     their memory to be totally cleared, but they do need the memory to have
+ *     some bound, i.e., a guarantee that all values in the memory they've been
+ *     allocated is less than some maximum value (which is the starting value
+ *     for the indices that they will then use for compression). When this
+ *     guarantee is provided to them, they can use the memory without any setup
+ *     work. When it can't, they have to clear the area.
+ *
+ * - These buffers also have different alignment requirements.
+ *
+ * - We would like to reuse the objects in the workspace for multiple
+ *   compressions without having to perform any expensive reallocation or
+ *   reinitialization work.
+ *
+ * - We would like to be able to efficiently reuse the workspace across
+ *   multiple compressions **even when the compression parameters change** and
+ *   we need to resize some of the objects (where possible).
+ *
+ * To attempt to manage this buffer, given these constraints, the ZSTD_cwksp
+ * abstraction was created. It works as follows:
+ *
+ * Workspace Layout:
+ *
+ * [                        ... workspace ...                         ]
+ * [objects][tables ... ->] free space [<- ... aligned][<- ... buffers]
+ *
+ * The various objects that live in the workspace are divided into the
+ * following categories, and are allocated separately:
+ *
+ * - Static objects: this is optionally the enclosing ZSTD_CCtx or ZSTD_CDict,
+ *   so that literally everything fits in a single buffer. Note: if present,
+ *   this must be the first object in the workspace, since ZSTD_free{CCtx,
+ *   CDict}() rely on a pointer comparison to see whether one or two frees are
+ *   required.
+ *
+ * - Fixed size objects: these are fixed-size, fixed-count objects that are
+ *   nonetheless "dynamically" allocated in the workspace so that we can
+ *   control how they're initialized separately from the broader ZSTD_CCtx.
+ *   Examples:
+ *   - Entropy Workspace
+ *   - 2 x ZSTD_compressedBlockState_t
+ *   - CDict dictionary contents
+ *
+ * - Tables: these are any of several different datastructures (hash tables,
+ *   chain tables, binary trees) that all respect a common format: they are
+ *   uint32_t arrays, all of whose values are between 0 and (nextSrc - base).
+ *   Their sizes depend on the cparams.
+ *
+ * - Aligned: these buffers are used for various purposes that require 4 byte
+ *   alignment, but don't require any initialization before they're used.
+ *
+ * - Buffers: these buffers are used for various purposes that don't require
+ *   any alignment or initialization before they're used. This means they can
+ *   be moved around at no cost for a new compression.
+ *
+ * Allocating Memory:
+ *
+ * The various types of objects must be allocated in order, so they can be
+ * correctly packed into the workspace buffer. That order is:
+ *
+ * 1. Objects
+ * 2. Buffers
+ * 3. Aligned
+ * 4. Tables
+ *
+ * Attempts to reserve objects of different types out of order will fail.
+ */
+typedef struct {
+    void* workspace;
+    void* workspaceEnd;
+
+    void* objectEnd;
+    void* tableEnd;
+    void* tableValidEnd;
+    void* allocStart;
+
+    int allocFailed;
+    int workspaceOversizedDuration;
+    ZSTD_cwksp_alloc_phase_e phase;
+} ZSTD_cwksp;
+
+/*-*************************************
+*  Functions
+***************************************/
+
+MEM_STATIC size_t ZSTD_cwksp_available_space(ZSTD_cwksp* ws);
+
+MEM_STATIC void ZSTD_cwksp_assert_internal_consistency(ZSTD_cwksp* ws) {
+    (void)ws;
+    assert(ws->workspace <= ws->objectEnd);
+    assert(ws->objectEnd <= ws->tableEnd);
+    assert(ws->objectEnd <= ws->tableValidEnd);
+    assert(ws->tableEnd <= ws->allocStart);
+    assert(ws->tableValidEnd <= ws->allocStart);
+    assert(ws->allocStart <= ws->workspaceEnd);
+}
+
+/**
+ * Align must be a power of 2.
+ */
+MEM_STATIC size_t ZSTD_cwksp_align(size_t size, size_t const align) {
+    size_t const mask = align - 1;
+    assert((align & mask) == 0);
+    return (size + mask) & ~mask;
+}
+
+/**
+ * Use this to determine how much space in the workspace we will consume to
+ * allocate this object. (Normally it should be exactly the size of the object,
+ * but under special conditions, like ASAN, where we pad each object, it might
+ * be larger.)
+ *
+ * Since tables aren't currently redzoned, you don't need to call through this
+ * to figure out how much space you need for the matchState tables. Everything
+ * else is though.
+ */
+MEM_STATIC size_t ZSTD_cwksp_alloc_size(size_t size) {
+#if defined (ADDRESS_SANITIZER) && !defined (ZSTD_ASAN_DONT_POISON_WORKSPACE)
+    return size + 2 * ZSTD_CWKSP_ASAN_REDZONE_SIZE;
+#else
+    return size;
+#endif
+}
+
+MEM_STATIC void ZSTD_cwksp_internal_advance_phase(
+        ZSTD_cwksp* ws, ZSTD_cwksp_alloc_phase_e phase) {
+    assert(phase >= ws->phase);
+    if (phase > ws->phase) {
+        if (ws->phase < ZSTD_cwksp_alloc_buffers &&
+                phase >= ZSTD_cwksp_alloc_buffers) {
+            ws->tableValidEnd = ws->objectEnd;
+        }
+        if (ws->phase < ZSTD_cwksp_alloc_aligned &&
+                phase >= ZSTD_cwksp_alloc_aligned) {
+            /* If unaligned allocations down from a too-large top have left us
+             * unaligned, we need to realign our alloc ptr. Technically, this
+             * can consume space that is unaccounted for in the neededSpace
+             * calculation. However, I believe this can only happen when the
+             * workspace is too large, and specifically when it is too large
+             * by a larger margin than the space that will be consumed. */
+            /* TODO: cleaner, compiler warning friendly way to do this??? */
+            ws->allocStart = (BYTE*)ws->allocStart - ((size_t)ws->allocStart & (sizeof(U32)-1));
+            if (ws->allocStart < ws->tableValidEnd) {
+                ws->tableValidEnd = ws->allocStart;
+            }
+        }
+        ws->phase = phase;
+    }
+}
+
+/**
+ * Returns whether this object/buffer/etc was allocated in this workspace.
+ */
+MEM_STATIC int ZSTD_cwksp_owns_buffer(const ZSTD_cwksp* ws, const void* ptr) {
+    return (ptr != NULL) && (ws->workspace <= ptr) && (ptr <= ws->workspaceEnd);
+}
+
+/**
+ * Internal function. Do not use directly.
+ */
+MEM_STATIC void* ZSTD_cwksp_reserve_internal(
+        ZSTD_cwksp* ws, size_t bytes, ZSTD_cwksp_alloc_phase_e phase) {
+    void* alloc;
+    void* bottom = ws->tableEnd;
+    ZSTD_cwksp_internal_advance_phase(ws, phase);
+    alloc = (BYTE *)ws->allocStart - bytes;
+
+#if defined (ADDRESS_SANITIZER) && !defined (ZSTD_ASAN_DONT_POISON_WORKSPACE)
+    /* over-reserve space */
+    alloc = (BYTE *)alloc - 2 * ZSTD_CWKSP_ASAN_REDZONE_SIZE;
+#endif
+
+    DEBUGLOG(5, "cwksp: reserving %p %zd bytes, %zd bytes remaining",
+        alloc, bytes, ZSTD_cwksp_available_space(ws) - bytes);
+    ZSTD_cwksp_assert_internal_consistency(ws);
+    assert(alloc >= bottom);
+    if (alloc < bottom) {
+        DEBUGLOG(4, "cwksp: alloc failed!");
+        ws->allocFailed = 1;
+        return NULL;
+    }
+    if (alloc < ws->tableValidEnd) {
+        ws->tableValidEnd = alloc;
+    }
+    ws->allocStart = alloc;
+
+#if defined (ADDRESS_SANITIZER) && !defined (ZSTD_ASAN_DONT_POISON_WORKSPACE)
+    /* Move alloc so there's ZSTD_CWKSP_ASAN_REDZONE_SIZE unused space on
+     * either size. */
+    alloc = (BYTE *)alloc + ZSTD_CWKSP_ASAN_REDZONE_SIZE;
+    __asan_unpoison_memory_region(alloc, bytes);
+#endif
+
+    return alloc;
+}
+
+/**
+ * Reserves and returns unaligned memory.
+ */
+MEM_STATIC BYTE* ZSTD_cwksp_reserve_buffer(ZSTD_cwksp* ws, size_t bytes) {
+    return (BYTE*)ZSTD_cwksp_reserve_internal(ws, bytes, ZSTD_cwksp_alloc_buffers);
+}
+
+/**
+ * Reserves and returns memory sized on and aligned on sizeof(unsigned).
+ */
+MEM_STATIC void* ZSTD_cwksp_reserve_aligned(ZSTD_cwksp* ws, size_t bytes) {
+    assert((bytes & (sizeof(U32)-1)) == 0);
+    return ZSTD_cwksp_reserve_internal(ws, ZSTD_cwksp_align(bytes, sizeof(U32)), ZSTD_cwksp_alloc_aligned);
+}
+
+/**
+ * Aligned on sizeof(unsigned). These buffers have the special property that
+ * their values remain constrained, allowing us to re-use them without
+ * memset()-ing them.
+ */
+MEM_STATIC void* ZSTD_cwksp_reserve_table(ZSTD_cwksp* ws, size_t bytes) {
+    const ZSTD_cwksp_alloc_phase_e phase = ZSTD_cwksp_alloc_aligned;
+    void* alloc = ws->tableEnd;
+    void* end = (BYTE *)alloc + bytes;
+    void* top = ws->allocStart;
+
+    DEBUGLOG(5, "cwksp: reserving %p table %zd bytes, %zd bytes remaining",
+        alloc, bytes, ZSTD_cwksp_available_space(ws) - bytes);
+    assert((bytes & (sizeof(U32)-1)) == 0);
+    ZSTD_cwksp_internal_advance_phase(ws, phase);
+    ZSTD_cwksp_assert_internal_consistency(ws);
+    assert(end <= top);
+    if (end > top) {
+        DEBUGLOG(4, "cwksp: table alloc failed!");
+        ws->allocFailed = 1;
+        return NULL;
+    }
+    ws->tableEnd = end;
+
+#if defined (ADDRESS_SANITIZER) && !defined (ZSTD_ASAN_DONT_POISON_WORKSPACE)
+    __asan_unpoison_memory_region(alloc, bytes);
+#endif
+
+    return alloc;
+}
+
+/**
+ * Aligned on sizeof(void*).
+ */
+MEM_STATIC void* ZSTD_cwksp_reserve_object(ZSTD_cwksp* ws, size_t bytes) {
+    size_t roundedBytes = ZSTD_cwksp_align(bytes, sizeof(void*));
+    void* alloc = ws->objectEnd;
+    void* end = (BYTE*)alloc + roundedBytes;
+
+#if defined (ADDRESS_SANITIZER) && !defined (ZSTD_ASAN_DONT_POISON_WORKSPACE)
+    /* over-reserve space */
+    end = (BYTE *)end + 2 * ZSTD_CWKSP_ASAN_REDZONE_SIZE;
+#endif
+
+    DEBUGLOG(5,
+        "cwksp: reserving %p object %zd bytes (rounded to %zd), %zd bytes remaining",
+        alloc, bytes, roundedBytes, ZSTD_cwksp_available_space(ws) - roundedBytes);
+    assert(((size_t)alloc & (sizeof(void*)-1)) == 0);
+    assert((bytes & (sizeof(void*)-1)) == 0);
+    ZSTD_cwksp_assert_internal_consistency(ws);
+    /* we must be in the first phase, no advance is possible */
+    if (ws->phase != ZSTD_cwksp_alloc_objects || end > ws->workspaceEnd) {
+        DEBUGLOG(4, "cwksp: object alloc failed!");
+        ws->allocFailed = 1;
+        return NULL;
+    }
+    ws->objectEnd = end;
+    ws->tableEnd = end;
+    ws->tableValidEnd = end;
+
+#if defined (ADDRESS_SANITIZER) && !defined (ZSTD_ASAN_DONT_POISON_WORKSPACE)
+    /* Move alloc so there's ZSTD_CWKSP_ASAN_REDZONE_SIZE unused space on
+     * either size. */
+    alloc = (BYTE *)alloc + ZSTD_CWKSP_ASAN_REDZONE_SIZE;
+    __asan_unpoison_memory_region(alloc, bytes);
+#endif
+
+    return alloc;
+}
+
+MEM_STATIC void ZSTD_cwksp_mark_tables_dirty(ZSTD_cwksp* ws) {
+    DEBUGLOG(4, "cwksp: ZSTD_cwksp_mark_tables_dirty");
+
+#if defined (MEMORY_SANITIZER) && !defined (ZSTD_MSAN_DONT_POISON_WORKSPACE)
+    /* To validate that the table re-use logic is sound, and that we don't
+     * access table space that we haven't cleaned, we re-"poison" the table
+     * space every time we mark it dirty. */
+    {
+        size_t size = (BYTE*)ws->tableValidEnd - (BYTE*)ws->objectEnd;
+        assert(__msan_test_shadow(ws->objectEnd, size) == -1);
+        __msan_poison(ws->objectEnd, size);
+    }
+#endif
+
+    assert(ws->tableValidEnd >= ws->objectEnd);
+    assert(ws->tableValidEnd <= ws->allocStart);
+    ws->tableValidEnd = ws->objectEnd;
+    ZSTD_cwksp_assert_internal_consistency(ws);
+}
+
+MEM_STATIC void ZSTD_cwksp_mark_tables_clean(ZSTD_cwksp* ws) {
+    DEBUGLOG(4, "cwksp: ZSTD_cwksp_mark_tables_clean");
+    assert(ws->tableValidEnd >= ws->objectEnd);
+    assert(ws->tableValidEnd <= ws->allocStart);
+    if (ws->tableValidEnd < ws->tableEnd) {
+        ws->tableValidEnd = ws->tableEnd;
+    }
+    ZSTD_cwksp_assert_internal_consistency(ws);
+}
+
+/**
+ * Zero the part of the allocated tables not already marked clean.
+ */
+MEM_STATIC void ZSTD_cwksp_clean_tables(ZSTD_cwksp* ws) {
+    DEBUGLOG(4, "cwksp: ZSTD_cwksp_clean_tables");
+    assert(ws->tableValidEnd >= ws->objectEnd);
+    assert(ws->tableValidEnd <= ws->allocStart);
+    if (ws->tableValidEnd < ws->tableEnd) {
+        memset(ws->tableValidEnd, 0, (BYTE*)ws->tableEnd - (BYTE*)ws->tableValidEnd);
+    }
+    ZSTD_cwksp_mark_tables_clean(ws);
+}
+
+/**
+ * Invalidates table allocations.
+ * All other allocations remain valid.
+ */
+MEM_STATIC void ZSTD_cwksp_clear_tables(ZSTD_cwksp* ws) {
+    DEBUGLOG(4, "cwksp: clearing tables!");
+
+#if defined (ADDRESS_SANITIZER) && !defined (ZSTD_ASAN_DONT_POISON_WORKSPACE)
+    {
+        size_t size = (BYTE*)ws->tableValidEnd - (BYTE*)ws->objectEnd;
+        __asan_poison_memory_region(ws->objectEnd, size);
+    }
+#endif
+
+    ws->tableEnd = ws->objectEnd;
+    ZSTD_cwksp_assert_internal_consistency(ws);
+}
+
+/**
+ * Invalidates all buffer, aligned, and table allocations.
+ * Object allocations remain valid.
+ */
+MEM_STATIC void ZSTD_cwksp_clear(ZSTD_cwksp* ws) {
+    DEBUGLOG(4, "cwksp: clearing!");
+
+#if defined (MEMORY_SANITIZER) && !defined (ZSTD_MSAN_DONT_POISON_WORKSPACE)
+    /* To validate that the context re-use logic is sound, and that we don't
+     * access stuff that this compression hasn't initialized, we re-"poison"
+     * the workspace (or at least the non-static, non-table parts of it)
+     * every time we start a new compression. */
+    {
+        size_t size = (BYTE*)ws->workspaceEnd - (BYTE*)ws->tableValidEnd;
+        __msan_poison(ws->tableValidEnd, size);
+    }
+#endif
+
+#if defined (ADDRESS_SANITIZER) && !defined (ZSTD_ASAN_DONT_POISON_WORKSPACE)
+    {
+        size_t size = (BYTE*)ws->workspaceEnd - (BYTE*)ws->objectEnd;
+        __asan_poison_memory_region(ws->objectEnd, size);
+    }
+#endif
+
+    ws->tableEnd = ws->objectEnd;
+    ws->allocStart = ws->workspaceEnd;
+    ws->allocFailed = 0;
+    if (ws->phase > ZSTD_cwksp_alloc_buffers) {
+        ws->phase = ZSTD_cwksp_alloc_buffers;
+    }
+    ZSTD_cwksp_assert_internal_consistency(ws);
+}
+
+/**
+ * The provided workspace takes ownership of the buffer [start, start+size).
+ * Any existing values in the workspace are ignored (the previously managed
+ * buffer, if present, must be separately freed).
+ */
+MEM_STATIC void ZSTD_cwksp_init(ZSTD_cwksp* ws, void* start, size_t size) {
+    DEBUGLOG(4, "cwksp: init'ing workspace with %zd bytes", size);
+    assert(((size_t)start & (sizeof(void*)-1)) == 0); /* ensure correct alignment */
+    ws->workspace = start;
+    ws->workspaceEnd = (BYTE*)start + size;
+    ws->objectEnd = ws->workspace;
+    ws->tableValidEnd = ws->objectEnd;
+    ws->phase = ZSTD_cwksp_alloc_objects;
+    ZSTD_cwksp_clear(ws);
+    ws->workspaceOversizedDuration = 0;
+    ZSTD_cwksp_assert_internal_consistency(ws);
+}
+
+MEM_STATIC size_t ZSTD_cwksp_create(ZSTD_cwksp* ws, size_t size, ZSTD_customMem customMem) {
+    void* workspace = ZSTD_malloc(size, customMem);
+    DEBUGLOG(4, "cwksp: creating new workspace with %zd bytes", size);
+    RETURN_ERROR_IF(workspace == NULL, memory_allocation, "NULL pointer!");
+    ZSTD_cwksp_init(ws, workspace, size);
+    return 0;
+}
+
+MEM_STATIC void ZSTD_cwksp_free(ZSTD_cwksp* ws, ZSTD_customMem customMem) {
+    void *ptr = ws->workspace;
+    DEBUGLOG(4, "cwksp: freeing workspace");
+    memset(ws, 0, sizeof(ZSTD_cwksp));
+    ZSTD_free(ptr, customMem);
+}
+
+/**
+ * Moves the management of a workspace from one cwksp to another. The src cwksp
+ * is left in an invalid state (src must be re-init()'ed before its used again).
+ */
+MEM_STATIC void ZSTD_cwksp_move(ZSTD_cwksp* dst, ZSTD_cwksp* src) {
+    *dst = *src;
+    memset(src, 0, sizeof(ZSTD_cwksp));
+}
+
+MEM_STATIC size_t ZSTD_cwksp_sizeof(const ZSTD_cwksp* ws) {
+    return (size_t)((BYTE*)ws->workspaceEnd - (BYTE*)ws->workspace);
+}
+
+MEM_STATIC int ZSTD_cwksp_reserve_failed(const ZSTD_cwksp* ws) {
+    return ws->allocFailed;
+}
+
+/*-*************************************
+*  Functions Checking Free Space
+***************************************/
+
+MEM_STATIC size_t ZSTD_cwksp_available_space(ZSTD_cwksp* ws) {
+    return (size_t)((BYTE*)ws->allocStart - (BYTE*)ws->tableEnd);
+}
+
+MEM_STATIC int ZSTD_cwksp_check_available(ZSTD_cwksp* ws, size_t additionalNeededSpace) {
+    return ZSTD_cwksp_available_space(ws) >= additionalNeededSpace;
+}
+
+MEM_STATIC int ZSTD_cwksp_check_too_large(ZSTD_cwksp* ws, size_t additionalNeededSpace) {
+    return ZSTD_cwksp_check_available(
+        ws, additionalNeededSpace * ZSTD_WORKSPACETOOLARGE_FACTOR);
+}
+
+MEM_STATIC int ZSTD_cwksp_check_wasteful(ZSTD_cwksp* ws, size_t additionalNeededSpace) {
+    return ZSTD_cwksp_check_too_large(ws, additionalNeededSpace)
+        && ws->workspaceOversizedDuration > ZSTD_WORKSPACETOOLARGE_MAXDURATION;
+}
+
+MEM_STATIC void ZSTD_cwksp_bump_oversized_duration(
+        ZSTD_cwksp* ws, size_t additionalNeededSpace) {
+    if (ZSTD_cwksp_check_too_large(ws, additionalNeededSpace)) {
+        ws->workspaceOversizedDuration++;
+    } else {
+        ws->workspaceOversizedDuration = 0;
+    }
+}
+
+}
+
+#endif /* ZSTD_CWKSP_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_double_fast.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_double_fast.h
new file mode 100644
index 0000000000..3a5983a4bd
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_double_fast.h
@@ -0,0 +1,33 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_DOUBLE_FAST_H
+#define ZSTD_DOUBLE_FAST_H
+
+#include "zstd/common/mem.h"      /* U32 */
+#include "zstd/compress/zstd_compress_internal.h"     /* ZSTD_CCtx, size_t */
+
+namespace lbug_zstd {
+
+void ZSTD_fillDoubleHashTable(ZSTD_matchState_t* ms,
+                              void const* end, ZSTD_dictTableLoadMethod_e dtlm);
+size_t ZSTD_compressBlock_doubleFast(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_doubleFast_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_doubleFast_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+
+}
+
+#endif /* ZSTD_DOUBLE_FAST_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_fast.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_fast.h
new file mode 100644
index 0000000000..43e1ef8861
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_fast.h
@@ -0,0 +1,33 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_FAST_H
+#define ZSTD_FAST_H
+
+#include "zstd/common/mem.h"      /* U32 */
+#include "zstd/compress/zstd_compress_internal.h"
+
+namespace lbug_zstd {
+
+void ZSTD_fillHashTable(ZSTD_matchState_t* ms,
+                        void const* end, ZSTD_dictTableLoadMethod_e dtlm);
+size_t ZSTD_compressBlock_fast(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_fast_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_fast_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+
+}
+
+#endif /* ZSTD_FAST_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_lazy.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_lazy.h
new file mode 100644
index 0000000000..2e0fa32e6e
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_lazy.h
@@ -0,0 +1,63 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_LAZY_H
+#define ZSTD_LAZY_H
+
+#include "zstd/compress/zstd_compress_internal.h"
+
+namespace lbug_zstd {
+
+U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip);
+
+void ZSTD_preserveUnsortedMark (U32* const table, U32 const size, U32 const reducerValue);  /*! used in ZSTD_reduceIndex(). preemptively increase value of ZSTD_DUBT_UNSORTED_MARK */
+
+size_t ZSTD_compressBlock_btlazy2(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_lazy2(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_lazy(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_greedy(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+
+size_t ZSTD_compressBlock_btlazy2_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_lazy2_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_lazy_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_greedy_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+
+size_t ZSTD_compressBlock_greedy_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_lazy_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_lazy2_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_btlazy2_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+
+}
+
+#endif /* ZSTD_LAZY_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_ldm.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_ldm.h
new file mode 100644
index 0000000000..5381c57617
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_ldm.h
@@ -0,0 +1,106 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_LDM_H
+#define ZSTD_LDM_H
+
+#include "zstd/compress/zstd_compress_internal.h"   /* ldmParams_t, U32 */
+#include "zstd.h"   /* ZSTD_CCtx, size_t */
+
+/*-*************************************
+*  Long distance matching
+***************************************/
+
+#define ZSTD_LDM_DEFAULT_WINDOW_LOG ZSTD_WINDOWLOG_LIMIT_DEFAULT
+
+namespace lbug_zstd {
+
+void ZSTD_ldm_fillHashTable(
+            ldmState_t* state, const BYTE* ip,
+            const BYTE* iend, ldmParams_t const* params);
+
+/**
+ * ZSTD_ldm_generateSequences():
+ *
+ * Generates the sequences using the long distance match finder.
+ * Generates long range matching sequences in `sequences`, which parse a prefix
+ * of the source. `sequences` must be large enough to store every sequence,
+ * which can be checked with `ZSTD_ldm_getMaxNbSeq()`.
+ * @returns 0 or an error code.
+ *
+ * NOTE: The user must have called ZSTD_window_update() for all of the input
+ * they have, even if they pass it to ZSTD_ldm_generateSequences() in chunks.
+ * NOTE: This function returns an error if it runs out of space to store
+ *       sequences.
+ */
+size_t ZSTD_ldm_generateSequences(
+            ldmState_t* ldms, rawSeqStore_t* sequences,
+            ldmParams_t const* params, void const* src, size_t srcSize);
+
+/**
+ * ZSTD_ldm_blockCompress():
+ *
+ * Compresses a block using the predefined sequences, along with a secondary
+ * block compressor. The literals section of every sequence is passed to the
+ * secondary block compressor, and those sequences are interspersed with the
+ * predefined sequences. Returns the length of the last literals.
+ * Updates `rawSeqStore.pos` to indicate how many sequences have been consumed.
+ * `rawSeqStore.seq` may also be updated to split the last sequence between two
+ * blocks.
+ * @return The length of the last literals.
+ *
+ * NOTE: The source must be at most the maximum block size, but the predefined
+ * sequences can be any size, and may be longer than the block. In the case that
+ * they are longer than the block, the last sequences may need to be split into
+ * two. We handle that case correctly, and update `rawSeqStore` appropriately.
+ * NOTE: This function does not return any errors.
+ */
+size_t ZSTD_ldm_blockCompress(rawSeqStore_t* rawSeqStore,
+            ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+            void const* src, size_t srcSize);
+
+/**
+ * ZSTD_ldm_skipSequences():
+ *
+ * Skip past `srcSize` bytes worth of sequences in `rawSeqStore`.
+ * Avoids emitting matches less than `minMatch` bytes.
+ * Must be called for data with is not passed to ZSTD_ldm_blockCompress().
+ */
+void ZSTD_ldm_skipSequences(rawSeqStore_t* rawSeqStore, size_t srcSize,
+    U32 const minMatch);
+
+
+/** ZSTD_ldm_getTableSize() :
+ *  Estimate the space needed for long distance matching tables or 0 if LDM is
+ *  disabled.
+ */
+size_t ZSTD_ldm_getTableSize(ldmParams_t params);
+
+/** ZSTD_ldm_getSeqSpace() :
+ *  Return an upper bound on the number of sequences that can be produced by
+ *  the long distance matcher, or 0 if LDM is disabled.
+ */
+size_t ZSTD_ldm_getMaxNbSeq(ldmParams_t params, size_t maxChunkSize);
+
+/** ZSTD_ldm_adjustParameters() :
+ *  If the params->hashRateLog is not set, set it to its default value based on
+ *  windowLog and params->hashLog.
+ *
+ *  Ensures that params->bucketSizeLog is <= params->hashLog (setting it to
+ *  params->hashLog if it is not).
+ *
+ *  Ensures that the minMatchLength >= targetLength during optimal parsing.
+ */
+void ZSTD_ldm_adjustParameters(ldmParams_t* params,
+                               ZSTD_compressionParameters const* cParams);
+
+}
+
+#endif /* ZSTD_FAST_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_opt.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_opt.h
new file mode 100644
index 0000000000..8f685dbe41
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/compress/zstd_opt.h
@@ -0,0 +1,52 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+#ifndef ZSTD_OPT_H
+#define ZSTD_OPT_H
+
+#include "zstd/compress/zstd_compress_internal.h"
+
+namespace lbug_zstd {
+
+/* used in ZSTD_loadDictionaryContent() */
+void ZSTD_updateTree(ZSTD_matchState_t* ms, const BYTE* ip, const BYTE* iend);
+
+size_t ZSTD_compressBlock_btopt(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_btultra(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_btultra2(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+
+
+size_t ZSTD_compressBlock_btopt_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_btultra_dictMatchState(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+
+size_t ZSTD_compressBlock_btopt_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+size_t ZSTD_compressBlock_btultra_extDict(
+        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
+        void const* src, size_t srcSize);
+
+        /* note : no btultra2 variant for extDict nor dictMatchState,
+         * because btultra2 is not meant to work with dictionaries
+         * and is only specific for the first block (no prefix) */
+
+}
+
+#endif /* ZSTD_OPT_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/decompress/zstd_ddict.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/decompress/zstd_ddict.h
new file mode 100644
index 0000000000..3b3c634227
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/decompress/zstd_ddict.h
@@ -0,0 +1,44 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+
+#ifndef ZSTD_DDICT_H
+#define ZSTD_DDICT_H
+
+/*-*******************************************************
+ *  Dependencies
+ *********************************************************/
+#include <stddef.h>   /* size_t */
+#include "zstd.h"     /* ZSTD_DDict, and several public functions */
+
+namespace lbug_zstd {
+/*-*******************************************************
+ *  Interface
+ *********************************************************/
+
+/* note: several prototypes are already published in `zstd.h` :
+ * ZSTD_createDDict()
+ * ZSTD_createDDict_byReference()
+ * ZSTD_createDDict_advanced()
+ * ZSTD_freeDDict()
+ * ZSTD_initStaticDDict()
+ * ZSTD_sizeof_DDict()
+ * ZSTD_estimateDDictSize()
+ * ZSTD_getDictID_fromDict()
+ */
+
+const void* ZSTD_DDict_dictContent(const ZSTD_DDict* ddict);
+size_t ZSTD_DDict_dictSize(const ZSTD_DDict* ddict);
+
+void ZSTD_copyDDictParameters(ZSTD_DCtx* dctx, const ZSTD_DDict* ddict);
+
+}
+
+#endif /* ZSTD_DDICT_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/decompress/zstd_decompress_block.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/decompress/zstd_decompress_block.h
new file mode 100644
index 0000000000..ebacc42074
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/decompress/zstd_decompress_block.h
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+
+#ifndef ZSTD_DEC_BLOCK_H
+#define ZSTD_DEC_BLOCK_H
+
+/*-*******************************************************
+ *  Dependencies
+ *********************************************************/
+#include <stddef.h>   /* size_t */
+#include "zstd.h"    /* DCtx, and some public functions */
+#include "zstd/common/zstd_internal.h"  /* blockProperties_t, and some public functions */
+#include "zstd/decompress/zstd_decompress_internal.h"  /* ZSTD_seqSymbol */
+
+namespace lbug_zstd {
+
+/* ===   Prototypes   === */
+
+/* note: prototypes already published within `zstd.h` :
+ * ZSTD_decompressBlock()
+ */
+
+/* note: prototypes already published within `zstd_internal.h` :
+ * ZSTD_getcBlockSize()
+ * ZSTD_decodeSeqHeaders()
+ */
+
+
+/* ZSTD_decompressBlock_internal() :
+ * decompress block, starting at `src`,
+ * into destination buffer `dst`.
+ * @return : decompressed block size,
+ *           or an error code (which can be tested using ZSTD_isError())
+ */
+size_t ZSTD_decompressBlock_internal(ZSTD_DCtx* dctx,
+                               void* dst, size_t dstCapacity,
+                         const void* src, size_t srcSize, const int frame);
+
+/* ZSTD_buildFSETable() :
+ * generate FSE decoding table for one symbol (ll, ml or off)
+ * this function must be called with valid parameters only
+ * (dt is large enough, normalizedCounter distribution total is a power of 2, max is within range, etc.)
+ * in which case it cannot fail.
+ * Internal use only.
+ */
+void ZSTD_buildFSETable(ZSTD_seqSymbol* dt,
+             const short* normalizedCounter, unsigned maxSymbolValue,
+             const U32* baseValue, const U32* nbAdditionalBits,
+                   unsigned tableLog);
+
+}
+
+#endif /* ZSTD_DEC_BLOCK_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/decompress/zstd_decompress_internal.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/decompress/zstd_decompress_internal.h
new file mode 100644
index 0000000000..8caa92e956
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd/decompress/zstd_decompress_internal.h
@@ -0,0 +1,169 @@
+/*
+ * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under both the BSD-style license (found in the
+ * LICENSE file in the root directory of this source tree) and the GPLv2 (found
+ * in the COPYING file in the root directory of this source tree).
+ * You may select, at your option, one of the above-listed licenses.
+ */
+
+
+/* zstd_decompress_internal:
+ * objects and definitions shared within lib/decompress modules */
+
+ #ifndef ZSTD_DECOMPRESS_INTERNAL_H
+ #define ZSTD_DECOMPRESS_INTERNAL_H
+
+
+/*-*******************************************************
+ *  Dependencies
+ *********************************************************/
+#include "zstd/common/mem.h"             /* BYTE, U16, U32 */
+#include "zstd/common/zstd_internal.h"   /* ZSTD_seqSymbol */
+
+namespace lbug_zstd {
+
+/*-*******************************************************
+ *  Constants
+ *********************************************************/
+struct ZSTDConstants {
+    static const U32 LL_base[MaxLL+1];
+    static const U32 OF_base[MaxOff+1];
+    static const U32 OF_bits[MaxOff+1];
+    static const U32 ML_base[MaxML+1];
+};
+
+
+/*-*******************************************************
+ *  Decompression types
+ *********************************************************/
+ typedef struct {
+     U32 fastMode;
+     U32 tableLog;
+ } ZSTD_seqSymbol_header;
+
+ typedef struct {
+     U16  nextState;
+     BYTE nbAdditionalBits;
+     BYTE nbBits;
+     U32  baseValue;
+ } ZSTD_seqSymbol;
+
+ #define SEQSYMBOL_TABLE_SIZE(log)   (1 + (1 << (log)))
+
+typedef struct {
+    ZSTD_seqSymbol LLTable[SEQSYMBOL_TABLE_SIZE(LLFSELog)];    /* Note : Space reserved for FSE Tables */
+    ZSTD_seqSymbol OFTable[SEQSYMBOL_TABLE_SIZE(OffFSELog)];   /* is also used as temporary workspace while building hufTable during DDict creation */
+    ZSTD_seqSymbol MLTable[SEQSYMBOL_TABLE_SIZE(MLFSELog)];    /* and therefore must be at least HUF_DECOMPRESS_WORKSPACE_SIZE large */
+    HUF_DTable hufTable[HUF_DTABLE_SIZE(HufLog)];  /* can accommodate HUF_decompress4X */
+    U32 rep[ZSTD_REP_NUM];
+} ZSTD_entropyDTables_t;
+
+typedef enum { ZSTDds_getFrameHeaderSize, ZSTDds_decodeFrameHeader,
+               ZSTDds_decodeBlockHeader, ZSTDds_decompressBlock,
+               ZSTDds_decompressLastBlock, ZSTDds_checkChecksum,
+               ZSTDds_decodeSkippableHeader, ZSTDds_skipFrame } ZSTD_dStage;
+
+typedef enum { zdss_init=0, zdss_loadHeader,
+               zdss_read, zdss_load, zdss_flush } ZSTD_dStreamStage;
+
+typedef enum {
+    ZSTD_use_indefinitely = -1,  /* Use the dictionary indefinitely */
+    ZSTD_dont_use = 0,           /* Do not use the dictionary (if one exists free it) */
+    ZSTD_use_once = 1            /* Use the dictionary once and set to ZSTD_dont_use */
+} ZSTD_dictUses_e;
+
+typedef enum {
+    ZSTD_obm_buffered = 0,  /* Buffer the output */
+    ZSTD_obm_stable = 1     /* ZSTD_outBuffer is stable */
+} ZSTD_outBufferMode_e;
+
+struct ZSTD_DCtx_s
+{
+    const ZSTD_seqSymbol* LLTptr;
+    const ZSTD_seqSymbol* MLTptr;
+    const ZSTD_seqSymbol* OFTptr;
+    const HUF_DTable* HUFptr;
+    ZSTD_entropyDTables_t entropy;
+    U32 workspace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];   /* space needed when building huffman tables */
+    const void* previousDstEnd;   /* detect continuity */
+    const void* prefixStart;      /* start of current segment */
+    const void* virtualStart;     /* virtual start of previous segment if it was just before current one */
+    const void* dictEnd;          /* end of previous segment */
+    size_t expected;
+    ZSTD_frameHeader fParams;
+    U64 decodedSize;
+    blockType_e bType;            /* used in ZSTD_decompressContinue(), store blockType between block header decoding and block decompression stages */
+    ZSTD_dStage stage;
+    U32 litEntropy;
+    U32 fseEntropy;
+    XXH64_state_t xxhState;
+    size_t headerSize;
+    ZSTD_format_e format;
+    const BYTE* litPtr;
+    ZSTD_customMem customMem;
+    size_t litSize;
+    size_t rleSize;
+    size_t staticSize;
+    int bmi2;                     /* == 1 if the CPU supports BMI2 and 0 otherwise. CPU support is determined dynamically once per context lifetime. */
+
+    /* dictionary */
+    ZSTD_DDict* ddictLocal;
+    const ZSTD_DDict* ddict;     /* set by ZSTD_initDStream_usingDDict(), or ZSTD_DCtx_refDDict() */
+    U32 dictID;
+    int ddictIsCold;             /* if == 1 : dictionary is "new" for working context, and presumed "cold" (not in cpu cache) */
+    ZSTD_dictUses_e dictUses;
+
+    /* streaming */
+    ZSTD_dStreamStage streamStage;
+    char*  inBuff;
+    size_t inBuffSize;
+    size_t inPos;
+    size_t maxWindowSize;
+    char*  outBuff;
+    size_t outBuffSize;
+    size_t outStart;
+    size_t outEnd;
+    size_t lhSize;
+    void* legacyContext;
+    U32 previousLegacyVersion;
+    U32 legacyVersion;
+    U32 hostageByte;
+    int noForwardProgress;
+    ZSTD_outBufferMode_e outBufferMode;
+    ZSTD_outBuffer expectedOutBuffer;
+
+    /* workspace */
+    BYTE litBuffer[ZSTD_BLOCKSIZE_MAX + WILDCOPY_OVERLENGTH];
+    BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];
+
+    size_t oversizedDuration;
+
+#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
+    void const* dictContentBeginForFuzzing;
+    void const* dictContentEndForFuzzing;
+#endif
+};  /* typedef'd to ZSTD_DCtx within "zstd.h" */
+
+
+/*-*******************************************************
+ *  Shared internal functions
+ *********************************************************/
+
+/*! ZSTD_loadDEntropy() :
+ *  dict : must point at beginning of a valid zstd dictionary.
+ * @return : size of dictionary header (size of magic number + dict ID + entropy tables) */
+size_t ZSTD_loadDEntropy(ZSTD_entropyDTables_t* entropy,
+                   const void* const dict, size_t const dictSize);
+
+/*! ZSTD_checkContinuity() :
+ *  check if next `dst` follows previous position, where decompression ended.
+ *  If yes, do nothing (continue on current segment).
+ *  If not, classify previous segment as "external dictionary", and start a new segment.
+ *  This function cannot fail. */
+void ZSTD_checkContinuity(ZSTD_DCtx* dctx, const void* dst);
+
+}
+
+#endif /* ZSTD_DECOMPRESS_INTERNAL_H */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd_static.h b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd_static.h
new file mode 100644
index 0000000000..e7d64ff533
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/third_party/zstd/include/zstd_static.h
@@ -0,0 +1,1070 @@
+
+/* **************************************************************************************
+ *   ADVANCED AND EXPERIMENTAL FUNCTIONS
+ ****************************************************************************************
+ * The definitions in the following section are considered experimental.
+ * They are provided for advanced scenarios.
+ * They should never be used with a dynamic library, as prototypes may change in the future.
+ * Use them only in association with static linking.
+ * ***************************************************************************************/
+
+#ifndef ZSTD_H_ZSTD_STATIC_LINKING_ONLY
+#define ZSTD_H_ZSTD_STATIC_LINKING_ONLY
+
+namespace lbug_zstd {
+
+/****************************************************************************************
+ *   experimental API (static linking only)
+ ****************************************************************************************
+ * The following symbols and constants
+ * are not planned to join "stable API" status in the near future.
+ * They can still change in future versions.
+ * Some of them are planned to remain in the static_only section indefinitely.
+ * Some of them might be removed in the future (especially when redundant with existing stable functions)
+ * ***************************************************************************************/
+
+#define ZSTD_FRAMEHEADERSIZE_PREFIX(format) ((format) == ZSTD_f_zstd1 ? 5 : 1)   /* minimum input size required to query frame header size */
+#define ZSTD_FRAMEHEADERSIZE_MIN(format)    ((format) == ZSTD_f_zstd1 ? 6 : 2)
+#define ZSTD_FRAMEHEADERSIZE_MAX   18   /* can be useful for static allocation */
+#define ZSTD_SKIPPABLEHEADERSIZE    8
+
+/* compression parameter bounds */
+#define ZSTD_WINDOWLOG_MAX_32    30
+#define ZSTD_WINDOWLOG_MAX_64    31
+#define ZSTD_WINDOWLOG_MAX     ((int)(sizeof(size_t) == 4 ? ZSTD_WINDOWLOG_MAX_32 : ZSTD_WINDOWLOG_MAX_64))
+#define ZSTD_WINDOWLOG_MIN       10
+#define ZSTD_HASHLOG_MAX       ((ZSTD_WINDOWLOG_MAX < 30) ? ZSTD_WINDOWLOG_MAX : 30)
+#define ZSTD_HASHLOG_MIN          6
+#define ZSTD_CHAINLOG_MAX_32     29
+#define ZSTD_CHAINLOG_MAX_64     30
+#define ZSTD_CHAINLOG_MAX      ((int)(sizeof(size_t) == 4 ? ZSTD_CHAINLOG_MAX_32 : ZSTD_CHAINLOG_MAX_64))
+#define ZSTD_CHAINLOG_MIN        ZSTD_HASHLOG_MIN
+#define ZSTD_SEARCHLOG_MAX      (ZSTD_WINDOWLOG_MAX-1)
+#define ZSTD_SEARCHLOG_MIN        1
+#define ZSTD_MINMATCH_MAX         7   /* only for ZSTD_fast, other strategies are limited to 6 */
+#define ZSTD_MINMATCH_MIN         3   /* only for ZSTD_btopt+, faster strategies are limited to 4 */
+#define ZSTD_TARGETLENGTH_MAX    ZSTD_BLOCKSIZE_MAX
+#define ZSTD_TARGETLENGTH_MIN     0   /* note : comparing this constant to an unsigned results in a tautological test */
+#define ZSTD_STRATEGY_MIN        ZSTD_fast
+#define ZSTD_STRATEGY_MAX        ZSTD_btultra2
+
+
+#define ZSTD_OVERLAPLOG_MIN       0
+#define ZSTD_OVERLAPLOG_MAX       9
+
+#define ZSTD_WINDOWLOG_LIMIT_DEFAULT 27   /* by default, the streaming decoder will refuse any frame
+                                           * requiring larger than (1<<ZSTD_WINDOWLOG_LIMIT_DEFAULT) window size,
+                                           * to preserve host's memory from unreasonable requirements.
+                                           * This limit can be overridden using ZSTD_DCtx_setParameter(,ZSTD_d_windowLogMax,).
+                                           * The limit does not apply for one-pass decoders (such as ZSTD_decompress()), since no additional memory is allocated */
+
+
+/* LDM parameter bounds */
+#define ZSTD_LDM_HASHLOG_MIN      ZSTD_HASHLOG_MIN
+#define ZSTD_LDM_HASHLOG_MAX      ZSTD_HASHLOG_MAX
+#define ZSTD_LDM_MINMATCH_MIN        4
+#define ZSTD_LDM_MINMATCH_MAX     4096
+#define ZSTD_LDM_BUCKETSIZELOG_MIN   1
+#define ZSTD_LDM_BUCKETSIZELOG_MAX   8
+#define ZSTD_LDM_HASHRATELOG_MIN     0
+#define ZSTD_LDM_HASHRATELOG_MAX (ZSTD_WINDOWLOG_MAX - ZSTD_HASHLOG_MIN)
+
+/* Advanced parameter bounds */
+#define ZSTD_TARGETCBLOCKSIZE_MIN   64
+#define ZSTD_TARGETCBLOCKSIZE_MAX   ZSTD_BLOCKSIZE_MAX
+#define ZSTD_SRCSIZEHINT_MIN        0
+#define ZSTD_SRCSIZEHINT_MAX        INT_MAX
+
+/* internal */
+#define ZSTD_HASHLOG3_MAX           17
+
+
+/* ---  Advanced types  --- */
+
+typedef struct ZSTD_CCtx_params_s ZSTD_CCtx_params;
+
+typedef struct {
+    unsigned int matchPos; /* Match pos in dst */
+    /* If seqDef.offset > 3, then this is seqDef.offset - 3
+     * If seqDef.offset < 3, then this is the corresponding repeat offset
+     * But if seqDef.offset < 3 and litLength == 0, this is the
+     *   repeat offset before the corresponding repeat offset
+     * And if seqDef.offset == 3 and litLength == 0, this is the
+     *   most recent repeat offset - 1
+     */
+    unsigned int offset;
+    unsigned int litLength; /* Literal length */
+    unsigned int matchLength; /* Match length */
+    /* 0 when seq not rep and seqDef.offset otherwise
+     * when litLength == 0 this will be <= 4, otherwise <= 3 like normal
+     */
+    unsigned int rep;
+} ZSTD_Sequence;
+
+typedef struct {
+    unsigned windowLog;       /**< largest match distance : larger == more compression, more memory needed during decompression */
+    unsigned chainLog;        /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */
+    unsigned hashLog;         /**< dispatch table : larger == faster, more memory */
+    unsigned searchLog;       /**< nb of searches : larger == more compression, slower */
+    unsigned minMatch;        /**< match length searched : larger == faster decompression, sometimes less compression */
+    unsigned targetLength;    /**< acceptable match size for optimal parser (only) : larger == more compression, slower */
+    ZSTD_strategy strategy;   /**< see ZSTD_strategy definition above */
+} ZSTD_compressionParameters;
+
+typedef struct {
+    int contentSizeFlag; /**< 1: content size will be in frame header (when known) */
+    int checksumFlag;    /**< 1: generate a 32-bits checksum using XXH64 algorithm at end of frame, for error detection */
+    int noDictIDFlag;    /**< 1: no dictID will be saved into frame header (dictID is only useful for dictionary compression) */
+} ZSTD_frameParameters;
+
+typedef struct {
+    ZSTD_compressionParameters cParams;
+    ZSTD_frameParameters fParams;
+} ZSTD_parameters;
+
+typedef enum {
+    ZSTD_dct_auto = 0,       /* dictionary is "full" when starting with ZSTD_MAGIC_DICTIONARY, otherwise it is "rawContent" */
+    ZSTD_dct_rawContent = 1, /* ensures dictionary is always loaded as rawContent, even if it starts with ZSTD_MAGIC_DICTIONARY */
+    ZSTD_dct_fullDict = 2    /* refuses to load a dictionary if it does not respect Zstandard's specification, starting with ZSTD_MAGIC_DICTIONARY */
+} ZSTD_dictContentType_e;
+
+typedef enum {
+    ZSTD_dlm_byCopy = 0,  /**< Copy dictionary content internally */
+    ZSTD_dlm_byRef = 1    /**< Reference dictionary content -- the dictionary buffer must outlive its users. */
+} ZSTD_dictLoadMethod_e;
+
+typedef enum {
+    ZSTD_f_zstd1 = 0,           /* zstd frame format, specified in zstd_compression_format.md (default) */
+    ZSTD_f_zstd1_magicless = 1  /* Variant of zstd frame format, without initial 4-bytes magic number.
+                                 * Useful to save 4 bytes per generated frame.
+                                 * Decoder cannot recognise automatically this format, requiring this instruction. */
+} ZSTD_format_e;
+
+typedef enum {
+    /* Note: this enum and the behavior it controls are effectively internal
+     * implementation details of the compressor. They are expected to continue
+     * to evolve and should be considered only in the context of extremely
+     * advanced performance tuning.
+     *
+     * Zstd currently supports the use of a CDict in three ways:
+     *
+     * - The contents of the CDict can be copied into the working context. This
+     *   means that the compression can search both the dictionary and input
+     *   while operating on a single set of internal tables. This makes
+     *   the compression faster per-byte of input. However, the initial copy of
+     *   the CDict's tables incurs a fixed cost at the beginning of the
+     *   compression. For small compressions (< 8 KB), that copy can dominate
+     *   the cost of the compression.
+     *
+     * - The CDict's tables can be used in-place. In this model, compression is
+     *   slower per input byte, because the compressor has to search two sets of
+     *   tables. However, this model incurs no start-up cost (as long as the
+     *   working context's tables can be reused). For small inputs, this can be
+     *   faster than copying the CDict's tables.
+     *
+     * - The CDict's tables are not used at all, and instead we use the working
+     *   context alone to reload the dictionary and use params based on the source
+     *   size. See ZSTD_compress_insertDictionary() and ZSTD_compress_usingDict().
+     *   This method is effective when the dictionary sizes are very small relative
+     *   to the input size, and the input size is fairly large to begin with.
+     *
+     * Zstd has a simple internal heuristic that selects which strategy to use
+     * at the beginning of a compression. However, if experimentation shows that
+     * Zstd is making poor choices, it is possible to override that choice with
+     * this enum.
+     */
+    ZSTD_dictDefaultAttach = 0, /* Use the default heuristic. */
+    ZSTD_dictForceAttach   = 1, /* Never copy the dictionary. */
+    ZSTD_dictForceCopy     = 2, /* Always copy the dictionary. */
+    ZSTD_dictForceLoad     = 3  /* Always reload the dictionary */
+} ZSTD_dictAttachPref_e;
+
+typedef enum {
+  ZSTD_lcm_auto = 0,          /**< Automatically determine the compression mode based on the compression level.
+                               *   Negative compression levels will be uncompressed, and positive compression
+                               *   levels will be compressed. */
+  ZSTD_lcm_huffman = 1,       /**< Always attempt Huffman compression. Uncompressed literals will still be
+                               *   emitted if Huffman compression is not profitable. */
+  ZSTD_lcm_uncompressed = 2   /**< Always emit uncompressed literals. */
+} ZSTD_literalCompressionMode_e;
+
+
+/***************************************
+*  Frame size functions
+***************************************/
+
+/*! ZSTD_findDecompressedSize() :
+ *  `src` should point to the start of a series of ZSTD encoded and/or skippable frames
+ *  `srcSize` must be the _exact_ size of this series
+ *       (i.e. there should be a frame boundary at `src + srcSize`)
+ *  @return : - decompressed size of all data in all successive frames
+ *            - if the decompressed size cannot be determined: ZSTD_CONTENTSIZE_UNKNOWN
+ *            - if an error occurred: ZSTD_CONTENTSIZE_ERROR
+ *
+ *   note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
+ *            When `return==ZSTD_CONTENTSIZE_UNKNOWN`, data to decompress could be any size.
+ *            In which case, it's necessary to use streaming mode to decompress data.
+ *   note 2 : decompressed size is always present when compression is done with ZSTD_compress()
+ *   note 3 : decompressed size can be very large (64-bits value),
+ *            potentially larger than what local system can handle as a single memory segment.
+ *            In which case, it's necessary to use streaming mode to decompress data.
+ *   note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
+ *            Always ensure result fits within application's authorized limits.
+ *            Each application can set its own limits.
+ *   note 5 : ZSTD_findDecompressedSize handles multiple frames, and so it must traverse the input to
+ *            read each contained frame header.  This is fast as most of the data is skipped,
+ *            however it does mean that all frame data must be present and valid. */
+ZSTDLIB_API unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize);
+
+/*! ZSTD_decompressBound() :
+ *  `src` should point to the start of a series of ZSTD encoded and/or skippable frames
+ *  `srcSize` must be the _exact_ size of this series
+ *       (i.e. there should be a frame boundary at `src + srcSize`)
+ *  @return : - upper-bound for the decompressed size of all data in all successive frames
+ *            - if an error occured: ZSTD_CONTENTSIZE_ERROR
+ *
+ *  note 1  : an error can occur if `src` contains an invalid or incorrectly formatted frame.
+ *  note 2  : the upper-bound is exact when the decompressed size field is available in every ZSTD encoded frame of `src`.
+ *            in this case, `ZSTD_findDecompressedSize` and `ZSTD_decompressBound` return the same value.
+ *  note 3  : when the decompressed size field isn't available, the upper-bound for that frame is calculated by:
+ *              upper-bound = # blocks * min(128 KB, Window_Size)
+ */
+ZSTDLIB_API unsigned long long ZSTD_decompressBound(const void* src, size_t srcSize);
+
+/*! ZSTD_frameHeaderSize() :
+ *  srcSize must be >= ZSTD_FRAMEHEADERSIZE_PREFIX.
+ * @return : size of the Frame Header,
+ *           or an error code (if srcSize is too small) */
+ZSTDLIB_API size_t ZSTD_frameHeaderSize(const void* src, size_t srcSize);
+
+/*! ZSTD_getSequences() :
+ * Extract sequences from the sequence store
+ * zc can be used to insert custom compression params.
+ * This function invokes ZSTD_compress2
+ * @return : number of sequences extracted
+ */
+ZSTDLIB_API size_t ZSTD_getSequences(ZSTD_CCtx* zc, ZSTD_Sequence* outSeqs,
+    size_t outSeqsSize, const void* src, size_t srcSize);
+
+
+/***************************************
+*  Memory management
+***************************************/
+
+/*! ZSTD_estimate*() :
+ *  These functions make it possible to estimate memory usage
+ *  of a future {D,C}Ctx, before its creation.
+ *
+ *  ZSTD_estimateCCtxSize() will provide a memory budget large enough
+ *  for any compression level up to selected one.
+ *  Note : Unlike ZSTD_estimateCStreamSize*(), this estimate
+ *         does not include space for a window buffer.
+ *         Therefore, the estimation is only guaranteed for single-shot compressions, not streaming.
+ *  The estimate will assume the input may be arbitrarily large,
+ *  which is the worst case.
+ *
+ *  When srcSize can be bound by a known and rather "small" value,
+ *  this fact can be used to provide a tighter estimation
+ *  because the CCtx compression context will need less memory.
+ *  This tighter estimation can be provided by more advanced functions
+ *  ZSTD_estimateCCtxSize_usingCParams(), which can be used in tandem with ZSTD_getCParams(),
+ *  and ZSTD_estimateCCtxSize_usingCCtxParams(), which can be used in tandem with ZSTD_CCtxParams_setParameter().
+ *  Both can be used to estimate memory using custom compression parameters and arbitrary srcSize limits.
+ *
+ *  Note 2 : only single-threaded compression is supported.
+ *  ZSTD_estimateCCtxSize_usingCCtxParams() will return an error code if ZSTD_c_nbWorkers is >= 1.
+ */
+ZSTDLIB_API size_t ZSTD_estimateCCtxSize(int compressionLevel);
+ZSTDLIB_API size_t ZSTD_estimateCCtxSize_usingCParams(ZSTD_compressionParameters cParams);
+ZSTDLIB_API size_t ZSTD_estimateCCtxSize_usingCCtxParams(const ZSTD_CCtx_params* params);
+ZSTDLIB_API size_t ZSTD_estimateDCtxSize(void);
+
+/*! ZSTD_estimateCStreamSize() :
+ *  ZSTD_estimateCStreamSize() will provide a budget large enough for any compression level up to selected one.
+ *  It will also consider src size to be arbitrarily "large", which is worst case.
+ *  If srcSize is known to always be small, ZSTD_estimateCStreamSize_usingCParams() can provide a tighter estimation.
+ *  ZSTD_estimateCStreamSize_usingCParams() can be used in tandem with ZSTD_getCParams() to create cParams from compressionLevel.
+ *  ZSTD_estimateCStreamSize_usingCCtxParams() can be used in tandem with ZSTD_CCtxParams_setParameter(). Only single-threaded compression is supported. This function will return an error code if ZSTD_c_nbWorkers is >= 1.
+ *  Note : CStream size estimation is only correct for single-threaded compression.
+ *  ZSTD_DStream memory budget depends on window Size.
+ *  This information can be passed manually, using ZSTD_estimateDStreamSize,
+ *  or deducted from a valid frame Header, using ZSTD_estimateDStreamSize_fromFrame();
+ *  Note : if streaming is init with function ZSTD_init?Stream_usingDict(),
+ *         an internal ?Dict will be created, which additional size is not estimated here.
+ *         In this case, get total size by adding ZSTD_estimate?DictSize */
+ZSTDLIB_API size_t ZSTD_estimateCStreamSize(int compressionLevel);
+ZSTDLIB_API size_t ZSTD_estimateCStreamSize_usingCParams(ZSTD_compressionParameters cParams);
+ZSTDLIB_API size_t ZSTD_estimateCStreamSize_usingCCtxParams(const ZSTD_CCtx_params* params);
+ZSTDLIB_API size_t ZSTD_estimateDStreamSize(size_t windowSize);
+ZSTDLIB_API size_t ZSTD_estimateDStreamSize_fromFrame(const void* src, size_t srcSize);
+
+/*! ZSTD_estimate?DictSize() :
+ *  ZSTD_estimateCDictSize() will bet that src size is relatively "small", and content is copied, like ZSTD_createCDict().
+ *  ZSTD_estimateCDictSize_advanced() makes it possible to control compression parameters precisely, like ZSTD_createCDict_advanced().
+ *  Note : dictionaries created by reference (`ZSTD_dlm_byRef`) are logically smaller.
+ */
+ZSTDLIB_API size_t ZSTD_estimateCDictSize(size_t dictSize, int compressionLevel);
+ZSTDLIB_API size_t ZSTD_estimateCDictSize_advanced(size_t dictSize, ZSTD_compressionParameters cParams, ZSTD_dictLoadMethod_e dictLoadMethod);
+ZSTDLIB_API size_t ZSTD_estimateDDictSize(size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod);
+
+/*! ZSTD_initStatic*() :
+ *  Initialize an object using a pre-allocated fixed-size buffer.
+ *  workspace: The memory area to emplace the object into.
+ *             Provided pointer *must be 8-bytes aligned*.
+ *             Buffer must outlive object.
+ *  workspaceSize: Use ZSTD_estimate*Size() to determine
+ *                 how large workspace must be to support target scenario.
+ * @return : pointer to object (same address as workspace, just different type),
+ *           or NULL if error (size too small, incorrect alignment, etc.)
+ *  Note : zstd will never resize nor malloc() when using a static buffer.
+ *         If the object requires more memory than available,
+ *         zstd will just error out (typically ZSTD_error_memory_allocation).
+ *  Note 2 : there is no corresponding "free" function.
+ *           Since workspace is allocated externally, it must be freed externally too.
+ *  Note 3 : cParams : use ZSTD_getCParams() to convert a compression level
+ *           into its associated cParams.
+ *  Limitation 1 : currently not compatible with internal dictionary creation, triggered by
+ *                 ZSTD_CCtx_loadDictionary(), ZSTD_initCStream_usingDict() or ZSTD_initDStream_usingDict().
+ *  Limitation 2 : static cctx currently not compatible with multi-threading.
+ *  Limitation 3 : static dctx is incompatible with legacy support.
+ */
+ZSTDLIB_API ZSTD_CCtx*    ZSTD_initStaticCCtx(void* workspace, size_t workspaceSize);
+ZSTDLIB_API ZSTD_CStream* ZSTD_initStaticCStream(void* workspace, size_t workspaceSize);    /**< same as ZSTD_initStaticCCtx() */
+
+ZSTDLIB_API ZSTD_DCtx*    ZSTD_initStaticDCtx(void* workspace, size_t workspaceSize);
+ZSTDLIB_API ZSTD_DStream* ZSTD_initStaticDStream(void* workspace, size_t workspaceSize);    /**< same as ZSTD_initStaticDCtx() */
+
+ZSTDLIB_API const ZSTD_CDict* ZSTD_initStaticCDict(
+                                        void* workspace, size_t workspaceSize,
+                                        const void* dict, size_t dictSize,
+                                        ZSTD_dictLoadMethod_e dictLoadMethod,
+                                        ZSTD_dictContentType_e dictContentType,
+                                        ZSTD_compressionParameters cParams);
+
+ZSTDLIB_API const ZSTD_DDict* ZSTD_initStaticDDict(
+                                        void* workspace, size_t workspaceSize,
+                                        const void* dict, size_t dictSize,
+                                        ZSTD_dictLoadMethod_e dictLoadMethod,
+                                        ZSTD_dictContentType_e dictContentType);
+
+
+/*! Custom memory allocation :
+ *  These prototypes make it possible to pass your own allocation/free functions.
+ *  ZSTD_customMem is provided at creation time, using ZSTD_create*_advanced() variants listed below.
+ *  All allocation/free operations will be completed using these custom variants instead of regular <stdlib.h> ones.
+ */
+typedef void* (*ZSTD_allocFunction) (void* opaque, size_t size);
+typedef void  (*ZSTD_freeFunction) (void* opaque, void* address);
+typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; void* opaque; } ZSTD_customMem;
+
+ZSTDLIB_API ZSTD_CCtx*    ZSTD_createCCtx_advanced(ZSTD_customMem customMem);
+ZSTDLIB_API ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem);
+ZSTDLIB_API ZSTD_DCtx*    ZSTD_createDCtx_advanced(ZSTD_customMem customMem);
+ZSTDLIB_API ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem);
+
+ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_advanced(const void* dict, size_t dictSize,
+                                                  ZSTD_dictLoadMethod_e dictLoadMethod,
+                                                  ZSTD_dictContentType_e dictContentType,
+                                                  ZSTD_compressionParameters cParams,
+                                                  ZSTD_customMem customMem);
+
+ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize,
+                                                  ZSTD_dictLoadMethod_e dictLoadMethod,
+                                                  ZSTD_dictContentType_e dictContentType,
+                                                  ZSTD_customMem customMem);
+
+
+
+/***************************************
+*  Advanced compression functions
+***************************************/
+
+/*! ZSTD_createCDict_byReference() :
+ *  Create a digested dictionary for compression
+ *  Dictionary content is just referenced, not duplicated.
+ *  As a consequence, `dictBuffer` **must** outlive CDict,
+ *  and its content must remain unmodified throughout the lifetime of CDict.
+ *  note: equivalent to ZSTD_createCDict_advanced(), with dictLoadMethod==ZSTD_dlm_byRef */
+ZSTDLIB_API ZSTD_CDict* ZSTD_createCDict_byReference(const void* dictBuffer, size_t dictSize, int compressionLevel);
+
+/*! ZSTD_getCParams() :
+ * @return ZSTD_compressionParameters structure for a selected compression level and estimated srcSize.
+ * `estimatedSrcSize` value is optional, select 0 if not known */
+ZSTDLIB_API ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
+
+/*! ZSTD_getParams() :
+ *  same as ZSTD_getCParams(), but @return a full `ZSTD_parameters` object instead of sub-component `ZSTD_compressionParameters`.
+ *  All fields of `ZSTD_frameParameters` are set to default : contentSize=1, checksum=0, noDictID=0 */
+ZSTDLIB_API ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
+
+/*! ZSTD_checkCParams() :
+ *  Ensure param values remain within authorized range.
+ * @return 0 on success, or an error code (can be checked with ZSTD_isError()) */
+ZSTDLIB_API size_t ZSTD_checkCParams(ZSTD_compressionParameters params);
+
+/*! ZSTD_adjustCParams() :
+ *  optimize params for a given `srcSize` and `dictSize`.
+ * `srcSize` can be unknown, in which case use ZSTD_CONTENTSIZE_UNKNOWN.
+ * `dictSize` must be `0` when there is no dictionary.
+ *  cPar can be invalid : all parameters will be clamped within valid range in the @return struct.
+ *  This function never fails (wide contract) */
+ZSTDLIB_API ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize);
+
+/*! ZSTD_compress_advanced() :
+ *  Note : this function is now DEPRECATED.
+ *         It can be replaced by ZSTD_compress2(), in combination with ZSTD_CCtx_setParameter() and other parameter setters.
+ *  This prototype will be marked as deprecated and generate compilation warning on reaching v1.5.x */
+ZSTDLIB_API size_t ZSTD_compress_advanced(ZSTD_CCtx* cctx,
+                                          void* dst, size_t dstCapacity,
+                                    const void* src, size_t srcSize,
+                                    const void* dict,size_t dictSize,
+                                          ZSTD_parameters params);
+
+/*! ZSTD_compress_usingCDict_advanced() :
+ *  Note : this function is now REDUNDANT.
+ *         It can be replaced by ZSTD_compress2(), in combination with ZSTD_CCtx_loadDictionary() and other parameter setters.
+ *  This prototype will be marked as deprecated and generate compilation warning in some future version */
+ZSTDLIB_API size_t ZSTD_compress_usingCDict_advanced(ZSTD_CCtx* cctx,
+                                              void* dst, size_t dstCapacity,
+                                        const void* src, size_t srcSize,
+                                        const ZSTD_CDict* cdict,
+                                              ZSTD_frameParameters fParams);
+
+
+/*! ZSTD_CCtx_loadDictionary_byReference() :
+ *  Same as ZSTD_CCtx_loadDictionary(), but dictionary content is referenced, instead of being copied into CCtx.
+ *  It saves some memory, but also requires that `dict` outlives its usage within `cctx` */
+ZSTDLIB_API size_t ZSTD_CCtx_loadDictionary_byReference(ZSTD_CCtx* cctx, const void* dict, size_t dictSize);
+
+/*! ZSTD_CCtx_loadDictionary_advanced() :
+ *  Same as ZSTD_CCtx_loadDictionary(), but gives finer control over
+ *  how to load the dictionary (by copy ? by reference ?)
+ *  and how to interpret it (automatic ? force raw mode ? full mode only ?) */
+ZSTDLIB_API size_t ZSTD_CCtx_loadDictionary_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_dictContentType_e dictContentType);
+
+/*! ZSTD_CCtx_refPrefix_advanced() :
+ *  Same as ZSTD_CCtx_refPrefix(), but gives finer control over
+ *  how to interpret prefix content (automatic ? force raw mode (default) ? full mode only ?) */
+ZSTDLIB_API size_t ZSTD_CCtx_refPrefix_advanced(ZSTD_CCtx* cctx, const void* prefix, size_t prefixSize, ZSTD_dictContentType_e dictContentType);
+
+/* ===   experimental parameters   === */
+/* these parameters can be used with ZSTD_setParameter()
+ * they are not guaranteed to remain supported in the future */
+
+ /* Enables rsyncable mode,
+  * which makes compressed files more rsync friendly
+  * by adding periodic synchronization points to the compressed data.
+  * The target average block size is ZSTD_c_jobSize / 2.
+  * It's possible to modify the job size to increase or decrease
+  * the granularity of the synchronization point.
+  * Once the jobSize is smaller than the window size,
+  * it will result in compression ratio degradation.
+  * NOTE 1: rsyncable mode only works when multithreading is enabled.
+  * NOTE 2: rsyncable performs poorly in combination with long range mode,
+  * since it will decrease the effectiveness of synchronization points,
+  * though mileage may vary.
+  * NOTE 3: Rsyncable mode limits maximum compression speed to ~400 MB/s.
+  * If the selected compression level is already running significantly slower,
+  * the overall speed won't be significantly impacted.
+  */
+ #define ZSTD_c_rsyncable ZSTD_c_experimentalParam1
+
+/* Select a compression format.
+ * The value must be of type ZSTD_format_e.
+ * See ZSTD_format_e enum definition for details */
+#define ZSTD_c_format ZSTD_c_experimentalParam2
+
+/* Force back-reference distances to remain < windowSize,
+ * even when referencing into Dictionary content (default:0) */
+#define ZSTD_c_forceMaxWindow ZSTD_c_experimentalParam3
+
+/* Controls whether the contents of a CDict
+ * are used in place, or copied into the working context.
+ * Accepts values from the ZSTD_dictAttachPref_e enum.
+ * See the comments on that enum for an explanation of the feature. */
+#define ZSTD_c_forceAttachDict ZSTD_c_experimentalParam4
+
+/* Controls how the literals are compressed (default is auto).
+ * The value must be of type ZSTD_literalCompressionMode_e.
+ * See ZSTD_literalCompressionMode_t enum definition for details.
+ */
+#define ZSTD_c_literalCompressionMode ZSTD_c_experimentalParam5
+
+/* Tries to fit compressed block size to be around targetCBlockSize.
+ * No target when targetCBlockSize == 0.
+ * There is no guarantee on compressed block size (default:0) */
+#define ZSTD_c_targetCBlockSize ZSTD_c_experimentalParam6
+
+/* User's best guess of source size.
+ * Hint is not valid when srcSizeHint == 0.
+ * There is no guarantee that hint is close to actual source size,
+ * but compression ratio may regress significantly if guess considerably underestimates */
+#define ZSTD_c_srcSizeHint ZSTD_c_experimentalParam7
+
+/*! ZSTD_CCtx_getParameter() :
+ *  Get the requested compression parameter value, selected by enum ZSTD_cParameter,
+ *  and store it into int* value.
+ * @return : 0, or an error code (which can be tested with ZSTD_isError()).
+ */
+ZSTDLIB_API size_t ZSTD_CCtx_getParameter(ZSTD_CCtx* cctx, ZSTD_cParameter param, int* value);
+
+
+/*! ZSTD_CCtx_params :
+ *  Quick howto :
+ *  - ZSTD_createCCtxParams() : Create a ZSTD_CCtx_params structure
+ *  - ZSTD_CCtxParams_setParameter() : Push parameters one by one into
+ *                                     an existing ZSTD_CCtx_params structure.
+ *                                     This is similar to
+ *                                     ZSTD_CCtx_setParameter().
+ *  - ZSTD_CCtx_setParametersUsingCCtxParams() : Apply parameters to
+ *                                    an existing CCtx.
+ *                                    These parameters will be applied to
+ *                                    all subsequent frames.
+ *  - ZSTD_compressStream2() : Do compression using the CCtx.
+ *  - ZSTD_freeCCtxParams() : Free the memory.
+ *
+ *  This can be used with ZSTD_estimateCCtxSize_advanced_usingCCtxParams()
+ *  for static allocation of CCtx for single-threaded compression.
+ */
+ZSTDLIB_API ZSTD_CCtx_params* ZSTD_createCCtxParams(void);
+ZSTDLIB_API size_t ZSTD_freeCCtxParams(ZSTD_CCtx_params* params);
+
+/*! ZSTD_CCtxParams_reset() :
+ *  Reset params to default values.
+ */
+ZSTDLIB_API size_t ZSTD_CCtxParams_reset(ZSTD_CCtx_params* params);
+
+/*! ZSTD_CCtxParams_init() :
+ *  Initializes the compression parameters of cctxParams according to
+ *  compression level. All other parameters are reset to their default values.
+ */
+ZSTDLIB_API size_t ZSTD_CCtxParams_init(ZSTD_CCtx_params* cctxParams, int compressionLevel);
+
+/*! ZSTD_CCtxParams_init_advanced() :
+ *  Initializes the compression and frame parameters of cctxParams according to
+ *  params. All other parameters are reset to their default values.
+ */
+ZSTDLIB_API size_t ZSTD_CCtxParams_init_advanced(ZSTD_CCtx_params* cctxParams, ZSTD_parameters params);
+
+/*! ZSTD_CCtxParams_setParameter() :
+ *  Similar to ZSTD_CCtx_setParameter.
+ *  Set one compression parameter, selected by enum ZSTD_cParameter.
+ *  Parameters must be applied to a ZSTD_CCtx using ZSTD_CCtx_setParametersUsingCCtxParams().
+ * @result : 0, or an error code (which can be tested with ZSTD_isError()).
+ */
+ZSTDLIB_API size_t ZSTD_CCtxParams_setParameter(ZSTD_CCtx_params* params, ZSTD_cParameter param, int value);
+
+/*! ZSTD_CCtxParams_getParameter() :
+ * Similar to ZSTD_CCtx_getParameter.
+ * Get the requested value of one compression parameter, selected by enum ZSTD_cParameter.
+ * @result : 0, or an error code (which can be tested with ZSTD_isError()).
+ */
+ZSTDLIB_API size_t ZSTD_CCtxParams_getParameter(ZSTD_CCtx_params* params, ZSTD_cParameter param, int* value);
+
+/*! ZSTD_CCtx_setParametersUsingCCtxParams() :
+ *  Apply a set of ZSTD_CCtx_params to the compression context.
+ *  This can be done even after compression is started,
+ *    if nbWorkers==0, this will have no impact until a new compression is started.
+ *    if nbWorkers>=1, new parameters will be picked up at next job,
+ *       with a few restrictions (windowLog, pledgedSrcSize, nbWorkers, jobSize, and overlapLog are not updated).
+ */
+ZSTDLIB_API size_t ZSTD_CCtx_setParametersUsingCCtxParams(
+        ZSTD_CCtx* cctx, const ZSTD_CCtx_params* params);
+
+/*! ZSTD_compressStream2_simpleArgs() :
+ *  Same as ZSTD_compressStream2(),
+ *  but using only integral types as arguments.
+ *  This variant might be helpful for binders from dynamic languages
+ *  which have troubles handling structures containing memory pointers.
+ */
+ZSTDLIB_API size_t ZSTD_compressStream2_simpleArgs (
+                            ZSTD_CCtx* cctx,
+                            void* dst, size_t dstCapacity, size_t* dstPos,
+                      const void* src, size_t srcSize, size_t* srcPos,
+                            ZSTD_EndDirective endOp);
+
+
+/***************************************
+*  Advanced decompression functions
+***************************************/
+
+/*! ZSTD_isFrame() :
+ *  Tells if the content of `buffer` starts with a valid Frame Identifier.
+ *  Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.
+ *  Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.
+ *  Note 3 : Skippable Frame Identifiers are considered valid. */
+ZSTDLIB_API unsigned ZSTD_isFrame(const void* buffer, size_t size);
+
+/*! ZSTD_createDDict_byReference() :
+ *  Create a digested dictionary, ready to start decompression operation without startup delay.
+ *  Dictionary content is referenced, and therefore stays in dictBuffer.
+ *  It is important that dictBuffer outlives DDict,
+ *  it must remain read accessible throughout the lifetime of DDict */
+ZSTDLIB_API ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize);
+
+/*! ZSTD_DCtx_loadDictionary_byReference() :
+ *  Same as ZSTD_DCtx_loadDictionary(),
+ *  but references `dict` content instead of copying it into `dctx`.
+ *  This saves memory if `dict` remains around.,
+ *  However, it's imperative that `dict` remains accessible (and unmodified) while being used, so it must outlive decompression. */
+ZSTDLIB_API size_t ZSTD_DCtx_loadDictionary_byReference(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);
+
+/*! ZSTD_DCtx_loadDictionary_advanced() :
+ *  Same as ZSTD_DCtx_loadDictionary(),
+ *  but gives direct control over
+ *  how to load the dictionary (by copy ? by reference ?)
+ *  and how to interpret it (automatic ? force raw mode ? full mode only ?). */
+ZSTDLIB_API size_t ZSTD_DCtx_loadDictionary_advanced(ZSTD_DCtx* dctx, const void* dict, size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_dictContentType_e dictContentType);
+
+/*! ZSTD_DCtx_refPrefix_advanced() :
+ *  Same as ZSTD_DCtx_refPrefix(), but gives finer control over
+ *  how to interpret prefix content (automatic ? force raw mode (default) ? full mode only ?) */
+ZSTDLIB_API size_t ZSTD_DCtx_refPrefix_advanced(ZSTD_DCtx* dctx, const void* prefix, size_t prefixSize, ZSTD_dictContentType_e dictContentType);
+
+/*! ZSTD_DCtx_setMaxWindowSize() :
+ *  Refuses allocating internal buffers for frames requiring a window size larger than provided limit.
+ *  This protects a decoder context from reserving too much memory for itself (potential attack scenario).
+ *  This parameter is only useful in streaming mode, since no internal buffer is allocated in single-pass mode.
+ *  By default, a decompression context accepts all window sizes <= (1 << ZSTD_WINDOWLOG_LIMIT_DEFAULT)
+ * @return : 0, or an error code (which can be tested using ZSTD_isError()).
+ */
+ZSTDLIB_API size_t ZSTD_DCtx_setMaxWindowSize(ZSTD_DCtx* dctx, size_t maxWindowSize);
+
+/* ZSTD_d_format
+ * experimental parameter,
+ * allowing selection between ZSTD_format_e input compression formats
+ */
+#define ZSTD_d_format ZSTD_d_experimentalParam1
+/* ZSTD_d_stableOutBuffer
+ * Experimental parameter.
+ * Default is 0 == disabled. Set to 1 to enable.
+ *
+ * Tells the decompressor that the ZSTD_outBuffer will ALWAYS be the same
+ * between calls, except for the modifications that zstd makes to pos (the
+ * caller must not modify pos). This is checked by the decompressor, and
+ * decompression will fail if it ever changes. Therefore the ZSTD_outBuffer
+ * MUST be large enough to fit the entire decompressed frame. This will be
+ * checked when the frame content size is known. The data in the ZSTD_outBuffer
+ * in the range [dst, dst + pos) MUST not be modified during decompression
+ * or you will get data corruption.
+ *
+ * When this flags is enabled zstd won't allocate an output buffer, because
+ * it can write directly to the ZSTD_outBuffer, but it will still allocate
+ * an input buffer large enough to fit any compressed block. This will also
+ * avoid the memcpy() from the internal output buffer to the ZSTD_outBuffer.
+ * If you need to avoid the input buffer allocation use the buffer-less
+ * streaming API.
+ *
+ * NOTE: So long as the ZSTD_outBuffer always points to valid memory, using
+ * this flag is ALWAYS memory safe, and will never access out-of-bounds
+ * memory. However, decompression WILL fail if you violate the preconditions.
+ *
+ * WARNING: The data in the ZSTD_outBuffer in the range [dst, dst + pos) MUST
+ * not be modified during decompression or you will get data corruption. This
+ * is because zstd needs to reference data in the ZSTD_outBuffer to regenerate
+ * matches. Normally zstd maintains its own buffer for this purpose, but passing
+ * this flag tells zstd to use the user provided buffer.
+ */
+#define ZSTD_d_stableOutBuffer ZSTD_d_experimentalParam2
+
+/*! ZSTD_DCtx_setFormat() :
+ *  Instruct the decoder context about what kind of data to decode next.
+ *  This instruction is mandatory to decode data without a fully-formed header,
+ *  such ZSTD_f_zstd1_magicless for example.
+ * @return : 0, or an error code (which can be tested using ZSTD_isError()). */
+ZSTDLIB_API size_t ZSTD_DCtx_setFormat(ZSTD_DCtx* dctx, ZSTD_format_e format);
+
+/*! ZSTD_decompressStream_simpleArgs() :
+ *  Same as ZSTD_decompressStream(),
+ *  but using only integral types as arguments.
+ *  This can be helpful for binders from dynamic languages
+ *  which have troubles handling structures containing memory pointers.
+ */
+ZSTDLIB_API size_t ZSTD_decompressStream_simpleArgs (
+                            ZSTD_DCtx* dctx,
+                            void* dst, size_t dstCapacity, size_t* dstPos,
+                      const void* src, size_t srcSize, size_t* srcPos);
+
+
+/********************************************************************
+*  Advanced streaming functions
+*  Warning : most of these functions are now redundant with the Advanced API.
+*  Once Advanced API reaches "stable" status,
+*  redundant functions will be deprecated, and then at some point removed.
+********************************************************************/
+
+/*=====   Advanced Streaming compression functions  =====*/
+/**! ZSTD_initCStream_srcSize() :
+ * This function is deprecated, and equivalent to:
+ *     ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+ *     ZSTD_CCtx_refCDict(zcs, NULL); // clear the dictionary (if any)
+ *     ZSTD_CCtx_setParameter(zcs, ZSTD_c_compressionLevel, compressionLevel);
+ *     ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize);
+ *
+ * pledgedSrcSize must be correct. If it is not known at init time, use
+ * ZSTD_CONTENTSIZE_UNKNOWN. Note that, for compatibility with older programs,
+ * "0" also disables frame content size field. It may be enabled in the future.
+ * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x
+ */
+ZSTDLIB_API size_t
+ZSTD_initCStream_srcSize(ZSTD_CStream* zcs,
+                         int compressionLevel,
+                         unsigned long long pledgedSrcSize);
+
+/**! ZSTD_initCStream_usingDict() :
+ * This function is deprecated, and is equivalent to:
+ *     ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+ *     ZSTD_CCtx_setParameter(zcs, ZSTD_c_compressionLevel, compressionLevel);
+ *     ZSTD_CCtx_loadDictionary(zcs, dict, dictSize);
+ *
+ * Creates of an internal CDict (incompatible with static CCtx), except if
+ * dict == NULL or dictSize < 8, in which case no dict is used.
+ * Note: dict is loaded with ZSTD_dct_auto (treated as a full zstd dictionary if
+ * it begins with ZSTD_MAGIC_DICTIONARY, else as raw content) and ZSTD_dlm_byCopy.
+ * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x
+ */
+ZSTDLIB_API size_t
+ZSTD_initCStream_usingDict(ZSTD_CStream* zcs,
+                     const void* dict, size_t dictSize,
+                           int compressionLevel);
+
+/**! ZSTD_initCStream_advanced() :
+ * This function is deprecated, and is approximately equivalent to:
+ *     ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+ *     // Pseudocode: Set each zstd parameter and leave the rest as-is.
+ *     for ((param, value) : params) {
+ *         ZSTD_CCtx_setParameter(zcs, param, value);
+ *     }
+ *     ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize);
+ *     ZSTD_CCtx_loadDictionary(zcs, dict, dictSize);
+ *
+ * dict is loaded with ZSTD_dct_auto and ZSTD_dlm_byCopy.
+ * pledgedSrcSize must be correct.
+ * If srcSize is not known at init time, use value ZSTD_CONTENTSIZE_UNKNOWN.
+ * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x
+ */
+ZSTDLIB_API size_t
+ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
+                    const void* dict, size_t dictSize,
+                          ZSTD_parameters params,
+                          unsigned long long pledgedSrcSize);
+
+/**! ZSTD_initCStream_usingCDict() :
+ * This function is deprecated, and equivalent to:
+ *     ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+ *     ZSTD_CCtx_refCDict(zcs, cdict);
+ *
+ * note : cdict will just be referenced, and must outlive compression session
+ * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x
+ */
+ZSTDLIB_API size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);
+
+/**! ZSTD_initCStream_usingCDict_advanced() :
+ *   This function is DEPRECATED, and is approximately equivalent to:
+ *     ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+ *     // Pseudocode: Set each zstd frame parameter and leave the rest as-is.
+ *     for ((fParam, value) : fParams) {
+ *         ZSTD_CCtx_setParameter(zcs, fParam, value);
+ *     }
+ *     ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize);
+ *     ZSTD_CCtx_refCDict(zcs, cdict);
+ *
+ * same as ZSTD_initCStream_usingCDict(), with control over frame parameters.
+ * pledgedSrcSize must be correct. If srcSize is not known at init time, use
+ * value ZSTD_CONTENTSIZE_UNKNOWN.
+ * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x
+ */
+ZSTDLIB_API size_t
+ZSTD_initCStream_usingCDict_advanced(ZSTD_CStream* zcs,
+                               const ZSTD_CDict* cdict,
+                                     ZSTD_frameParameters fParams,
+                                     unsigned long long pledgedSrcSize);
+
+/*! ZSTD_resetCStream() :
+ * This function is deprecated, and is equivalent to:
+ *     ZSTD_CCtx_reset(zcs, ZSTD_reset_session_only);
+ *     ZSTD_CCtx_setPledgedSrcSize(zcs, pledgedSrcSize);
+ *
+ *  start a new frame, using same parameters from previous frame.
+ *  This is typically useful to skip dictionary loading stage, since it will re-use it in-place.
+ *  Note that zcs must be init at least once before using ZSTD_resetCStream().
+ *  If pledgedSrcSize is not known at reset time, use macro ZSTD_CONTENTSIZE_UNKNOWN.
+ *  If pledgedSrcSize > 0, its value must be correct, as it will be written in header, and controlled at the end.
+ *  For the time being, pledgedSrcSize==0 is interpreted as "srcSize unknown" for compatibility with older programs,
+ *  but it will change to mean "empty" in future version, so use macro ZSTD_CONTENTSIZE_UNKNOWN instead.
+ * @return : 0, or an error code (which can be tested using ZSTD_isError())
+ *  Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x
+ */
+ZSTDLIB_API size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);
+
+
+typedef struct {
+    unsigned long long ingested;   /* nb input bytes read and buffered */
+    unsigned long long consumed;   /* nb input bytes actually compressed */
+    unsigned long long produced;   /* nb of compressed bytes generated and buffered */
+    unsigned long long flushed;    /* nb of compressed bytes flushed : not provided; can be tracked from caller side */
+    unsigned currentJobID;         /* MT only : latest started job nb */
+    unsigned nbActiveWorkers;      /* MT only : nb of workers actively compressing at probe time */
+} ZSTD_frameProgression;
+
+/* ZSTD_getFrameProgression() :
+ * tells how much data has been ingested (read from input)
+ * consumed (input actually compressed) and produced (output) for current frame.
+ * Note : (ingested - consumed) is amount of input data buffered internally, not yet compressed.
+ * Aggregates progression inside active worker threads.
+ */
+ZSTDLIB_API ZSTD_frameProgression ZSTD_getFrameProgression(const ZSTD_CCtx* cctx);
+
+/*! ZSTD_toFlushNow() :
+ *  Tell how many bytes are ready to be flushed immediately.
+ *  Useful for multithreading scenarios (nbWorkers >= 1).
+ *  Probe the oldest active job, defined as oldest job not yet entirely flushed,
+ *  and check its output buffer.
+ * @return : amount of data stored in oldest job and ready to be flushed immediately.
+ *  if @return == 0, it means either :
+ *  + there is no active job (could be checked with ZSTD_frameProgression()), or
+ *  + oldest job is still actively compressing data,
+ *    but everything it has produced has also been flushed so far,
+ *    therefore flush speed is limited by production speed of oldest job
+ *    irrespective of the speed of concurrent (and newer) jobs.
+ */
+ZSTDLIB_API size_t ZSTD_toFlushNow(ZSTD_CCtx* cctx);
+
+
+/*=====   Advanced Streaming decompression functions  =====*/
+/**
+ * This function is deprecated, and is equivalent to:
+ *
+ *     ZSTD_DCtx_reset(zds, ZSTD_reset_session_only);
+ *     ZSTD_DCtx_loadDictionary(zds, dict, dictSize);
+ *
+ * note: no dictionary will be used if dict == NULL or dictSize < 8
+ * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x
+ */
+ZSTDLIB_API size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize);
+
+/**
+ * This function is deprecated, and is equivalent to:
+ *
+ *     ZSTD_DCtx_reset(zds, ZSTD_reset_session_only);
+ *     ZSTD_DCtx_refDDict(zds, ddict);
+ *
+ * note : ddict is referenced, it must outlive decompression session
+ * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x
+ */
+ZSTDLIB_API size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict);
+
+/**
+ * This function is deprecated, and is equivalent to:
+ *
+ *     ZSTD_DCtx_reset(zds, ZSTD_reset_session_only);
+ *
+ * re-use decompression parameters from previous init; saves dictionary loading
+ * Note : this prototype will be marked as deprecated and generate compilation warnings on reaching v1.5.x
+ */
+ZSTDLIB_API size_t ZSTD_resetDStream(ZSTD_DStream* zds);
+
+
+/*********************************************************************
+*  Buffer-less and synchronous inner streaming functions
+*
+*  This is an advanced API, giving full control over buffer management, for users which need direct control over memory.
+*  But it's also a complex one, with several restrictions, documented below.
+*  Prefer normal streaming API for an easier experience.
+********************************************************************* */
+
+/**
+  Buffer-less streaming compression (synchronous mode)
+
+  A ZSTD_CCtx object is required to track streaming operations.
+  Use ZSTD_createCCtx() / ZSTD_freeCCtx() to manage resource.
+  ZSTD_CCtx object can be re-used multiple times within successive compression operations.
+
+  Start by initializing a context.
+  Use ZSTD_compressBegin(), or ZSTD_compressBegin_usingDict() for dictionary compression,
+  or ZSTD_compressBegin_advanced(), for finer parameter control.
+  It's also possible to duplicate a reference context which has already been initialized, using ZSTD_copyCCtx()
+
+  Then, consume your input using ZSTD_compressContinue().
+  There are some important considerations to keep in mind when using this advanced function :
+  - ZSTD_compressContinue() has no internal buffer. It uses externally provided buffers only.
+  - Interface is synchronous : input is consumed entirely and produces 1+ compressed blocks.
+  - Caller must ensure there is enough space in `dst` to store compressed data under worst case scenario.
+    Worst case evaluation is provided by ZSTD_compressBound().
+    ZSTD_compressContinue() doesn't guarantee recover after a failed compression.
+  - ZSTD_compressContinue() presumes prior input ***is still accessible and unmodified*** (up to maximum distance size, see WindowLog).
+    It remembers all previous contiguous blocks, plus one separated memory segment (which can itself consists of multiple contiguous blocks)
+  - ZSTD_compressContinue() detects that prior input has been overwritten when `src` buffer overlaps.
+    In which case, it will "discard" the relevant memory section from its history.
+
+  Finish a frame with ZSTD_compressEnd(), which will write the last block(s) and optional checksum.
+  It's possible to use srcSize==0, in which case, it will write a final empty block to end the frame.
+  Without last block mark, frames are considered unfinished (hence corrupted) by compliant decoders.
+
+  `ZSTD_CCtx` object can be re-used (ZSTD_compressBegin()) to compress again.
+*/
+
+/*=====   Buffer-less streaming compression functions  =====*/
+ZSTDLIB_API size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);
+ZSTDLIB_API size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
+ZSTDLIB_API size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); /**< pledgedSrcSize : If srcSize is not known at init time, use ZSTD_CONTENTSIZE_UNKNOWN */
+ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict); /**< note: fails if cdict==NULL */
+ZSTDLIB_API size_t ZSTD_compressBegin_usingCDict_advanced(ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict, ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize);   /* compression parameters are already set within cdict. pledgedSrcSize must be correct. If srcSize is not known, use macro ZSTD_CONTENTSIZE_UNKNOWN */
+ZSTDLIB_API size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); /**<  note: if pledgedSrcSize is not known, use ZSTD_CONTENTSIZE_UNKNOWN */
+
+ZSTDLIB_API size_t ZSTD_compressContinue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+ZSTDLIB_API size_t ZSTD_compressEnd(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+
+
+/*-
+  Buffer-less streaming decompression (synchronous mode)
+
+  A ZSTD_DCtx object is required to track streaming operations.
+  Use ZSTD_createDCtx() / ZSTD_freeDCtx() to manage it.
+  A ZSTD_DCtx object can be re-used multiple times.
+
+  First typical operation is to retrieve frame parameters, using ZSTD_getFrameHeader().
+  Frame header is extracted from the beginning of compressed frame, so providing only the frame's beginning is enough.
+  Data fragment must be large enough to ensure successful decoding.
+ `ZSTD_frameHeaderSize_max` bytes is guaranteed to always be large enough.
+  @result : 0 : successful decoding, the `ZSTD_frameHeader` structure is correctly filled.
+           >0 : `srcSize` is too small, please provide at least @result bytes on next attempt.
+           errorCode, which can be tested using ZSTD_isError().
+
+  It fills a ZSTD_frameHeader structure with important information to correctly decode the frame,
+  such as the dictionary ID, content size, or maximum back-reference distance (`windowSize`).
+  Note that these values could be wrong, either because of data corruption, or because a 3rd party deliberately spoofs false information.
+  As a consequence, check that values remain within valid application range.
+  For example, do not allocate memory blindly, check that `windowSize` is within expectation.
+  Each application can set its own limits, depending on local restrictions.
+  For extended interoperability, it is recommended to support `windowSize` of at least 8 MB.
+
+  ZSTD_decompressContinue() needs previous data blocks during decompression, up to `windowSize` bytes.
+  ZSTD_decompressContinue() is very sensitive to contiguity,
+  if 2 blocks don't follow each other, make sure that either the compressor breaks contiguity at the same place,
+  or that previous contiguous segment is large enough to properly handle maximum back-reference distance.
+  There are multiple ways to guarantee this condition.
+
+  The most memory efficient way is to use a round buffer of sufficient size.
+  Sufficient size is determined by invoking ZSTD_decodingBufferSize_min(),
+  which can @return an error code if required value is too large for current system (in 32-bits mode).
+  In a round buffer methodology, ZSTD_decompressContinue() decompresses each block next to previous one,
+  up to the moment there is not enough room left in the buffer to guarantee decoding another full block,
+  which maximum size is provided in `ZSTD_frameHeader` structure, field `blockSizeMax`.
+  At which point, decoding can resume from the beginning of the buffer.
+  Note that already decoded data stored in the buffer should be flushed before being overwritten.
+
+  There are alternatives possible, for example using two or more buffers of size `windowSize` each, though they consume more memory.
+
+  Finally, if you control the compression process, you can also ignore all buffer size rules,
+  as long as the encoder and decoder progress in "lock-step",
+  aka use exactly the same buffer sizes, break contiguity at the same place, etc.
+
+  Once buffers are setup, start decompression, with ZSTD_decompressBegin().
+  If decompression requires a dictionary, use ZSTD_decompressBegin_usingDict() or ZSTD_decompressBegin_usingDDict().
+
+  Then use ZSTD_nextSrcSizeToDecompress() and ZSTD_decompressContinue() alternatively.
+  ZSTD_nextSrcSizeToDecompress() tells how many bytes to provide as 'srcSize' to ZSTD_decompressContinue().
+  ZSTD_decompressContinue() requires this _exact_ amount of bytes, or it will fail.
+
+ @result of ZSTD_decompressContinue() is the number of bytes regenerated within 'dst' (necessarily <= dstCapacity).
+  It can be zero : it just means ZSTD_decompressContinue() has decoded some metadata item.
+  It can also be an error code, which can be tested with ZSTD_isError().
+
+  A frame is fully decoded when ZSTD_nextSrcSizeToDecompress() returns zero.
+  Context can then be reset to start a new decompression.
+
+  Note : it's possible to know if next input to present is a header or a block, using ZSTD_nextInputType().
+  This information is not required to properly decode a frame.
+
+  == Special case : skippable frames ==
+
+  Skippable frames allow integration of user-defined data into a flow of concatenated frames.
+  Skippable frames will be ignored (skipped) by decompressor.
+  The format of skippable frames is as follows :
+  a) Skippable frame ID - 4 Bytes, Little endian format, any value from 0x184D2A50 to 0x184D2A5F
+  b) Frame Size - 4 Bytes, Little endian format, unsigned 32-bits
+  c) Frame Content - any content (User Data) of length equal to Frame Size
+  For skippable frames ZSTD_getFrameHeader() returns zfhPtr->frameType==ZSTD_skippableFrame.
+  For skippable frames ZSTD_decompressContinue() always returns 0 : it only skips the content.
+*/
+
+/*=====   Buffer-less streaming decompression functions  =====*/
+typedef enum { ZSTD_frame, ZSTD_skippableFrame } ZSTD_frameType_e;
+typedef struct {
+    unsigned long long frameContentSize; /* if == ZSTD_CONTENTSIZE_UNKNOWN, it means this field is not available. 0 means "empty" */
+    unsigned long long windowSize;       /* can be very large, up to <= frameContentSize */
+    unsigned blockSizeMax;
+    ZSTD_frameType_e frameType;          /* if == ZSTD_skippableFrame, frameContentSize is the size of skippable content */
+    unsigned headerSize;
+    unsigned dictID;
+    unsigned checksumFlag;
+} ZSTD_frameHeader;
+
+/*! ZSTD_getFrameHeader() :
+ *  decode Frame Header, or requires larger `srcSize`.
+ * @return : 0, `zfhPtr` is correctly filled,
+ *          >0, `srcSize` is too small, value is wanted `srcSize` amount,
+ *           or an error code, which can be tested using ZSTD_isError() */
+ZSTDLIB_API size_t ZSTD_getFrameHeader(ZSTD_frameHeader* zfhPtr, const void* src, size_t srcSize);   /**< doesn't consume input */
+/*! ZSTD_getFrameHeader_advanced() :
+ *  same as ZSTD_getFrameHeader(),
+ *  with added capability to select a format (like ZSTD_f_zstd1_magicless) */
+ZSTDLIB_API size_t ZSTD_getFrameHeader_advanced(ZSTD_frameHeader* zfhPtr, const void* src, size_t srcSize, ZSTD_format_e format);
+ZSTDLIB_API size_t ZSTD_decodingBufferSize_min(unsigned long long windowSize, unsigned long long frameContentSize);  /**< when frame content size is not known, pass in frameContentSize == ZSTD_CONTENTSIZE_UNKNOWN */
+
+ZSTDLIB_API size_t ZSTD_decompressBegin(ZSTD_DCtx* dctx);
+ZSTDLIB_API size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);
+ZSTDLIB_API size_t ZSTD_decompressBegin_usingDDict(ZSTD_DCtx* dctx, const ZSTD_DDict* ddict);
+
+ZSTDLIB_API size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx* dctx);
+ZSTDLIB_API size_t ZSTD_decompressContinue(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+
+/* misc */
+ZSTDLIB_API void   ZSTD_copyDCtx(ZSTD_DCtx* dctx, const ZSTD_DCtx* preparedDCtx);
+typedef enum { ZSTDnit_frameHeader, ZSTDnit_blockHeader, ZSTDnit_block, ZSTDnit_lastBlock, ZSTDnit_checksum, ZSTDnit_skippableFrame } ZSTD_nextInputType_e;
+ZSTDLIB_API ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx);
+
+
+
+
+/* ============================ */
+/**       Block level API       */
+/* ============================ */
+
+/*!
+    Block functions produce and decode raw zstd blocks, without frame metadata.
+    Frame metadata cost is typically ~12 bytes, which can be non-negligible for very small blocks (< 100 bytes).
+    But users will have to take in charge needed metadata to regenerate data, such as compressed and content sizes.
+
+    A few rules to respect :
+    - Compressing and decompressing require a context structure
+      + Use ZSTD_createCCtx() and ZSTD_createDCtx()
+    - It is necessary to init context before starting
+      + compression : any ZSTD_compressBegin*() variant, including with dictionary
+      + decompression : any ZSTD_decompressBegin*() variant, including with dictionary
+      + copyCCtx() and copyDCtx() can be used too
+    - Block size is limited, it must be <= ZSTD_getBlockSize() <= ZSTD_BLOCKSIZE_MAX == 128 KB
+      + If input is larger than a block size, it's necessary to split input data into multiple blocks
+      + For inputs larger than a single block, consider using regular ZSTD_compress() instead.
+        Frame metadata is not that costly, and quickly becomes negligible as source size grows larger than a block.
+    - When a block is considered not compressible enough, ZSTD_compressBlock() result will be 0 (zero) !
+      ===> In which case, nothing is produced into `dst` !
+      + User __must__ test for such outcome and deal directly with uncompressed data
+      + A block cannot be declared incompressible if ZSTD_compressBlock() return value was != 0.
+        Doing so would mess up with statistics history, leading to potential data corruption.
+      + ZSTD_decompressBlock() _doesn't accept uncompressed data as input_ !!
+      + In case of multiple successive blocks, should some of them be uncompressed,
+        decoder must be informed of their existence in order to follow proper history.
+        Use ZSTD_insertBlock() for such a case.
+*/
+
+/*=====   Raw zstd block functions  =====*/
+ZSTDLIB_API size_t ZSTD_getBlockSize   (const ZSTD_CCtx* cctx);
+ZSTDLIB_API size_t ZSTD_compressBlock  (ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+ZSTDLIB_API size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
+ZSTDLIB_API size_t ZSTD_insertBlock    (ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize);  /**< insert uncompressed block into `dctx` history. Useful for multi-blocks decompression. */
+
+}
+
+#endif   /* ZSTD_H_ZSTD_STATIC_LINKING_ONLY */
diff --git a/graph-wasm/lbug-0.12.2/lbug-src/tools/CMakeLists.txt b/graph-wasm/lbug-0.12.2/lbug-src/tools/CMakeLists.txt
new file mode 100644
index 0000000000..524e44ecc8
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/lbug-src/tools/CMakeLists.txt
@@ -0,0 +1,18 @@
+if(${BUILD_SHELL})
+    add_subdirectory(shell)
+endif()
+if(${BUILD_JAVA})
+    add_subdirectory(java_api)
+endif()
+if(${BUILD_NODEJS})
+    add_subdirectory(nodejs_api)
+endif()
+if(${BUILD_PYTHON})
+    add_subdirectory(python_api)
+endif()
+if(${BUILD_BENCHMARK})
+    add_subdirectory(benchmark)
+endif()
+if(${BUILD_WASM})
+    add_subdirectory(wasm)
+endif()
\ No newline at end of file
diff --git a/graph-wasm/lbug-0.12.2/src/CMakeLists.txt b/graph-wasm/lbug-0.12.2/src/CMakeLists.txt
new file mode 100644
index 0000000000..10872123e6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/CMakeLists.txt
@@ -0,0 +1,14 @@
+add_library(lbug_rs STATIC
+    ${CMAKE_CURRENT_SOURCE_DIR}/lbug_rs.cpp
+    ${LBUG_RS_BINDINGS_DIR}/sources/lbug/src/lib.rs.cc
+)
+
+target_include_directories(lbug_rs
+    PRIVATE
+        ${CMAKE_CURRENT_SOURCE_DIR}/../include
+        ${LBUG_RS_BINDINGS_DIR}/include
+        ${LBUG_RS_BINDINGS_DIR}/crate
+        ${LBUG_RS_BINDINGS_DIR}/sources
+)
+
+target_link_libraries(lbug_rs lbug)
diff --git a/graph-wasm/lbug-0.12.2/src/connection.rs b/graph-wasm/lbug-0.12.2/src/connection.rs
new file mode 100644
index 0000000000..f1e0c6456a
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/connection.rs
@@ -0,0 +1,390 @@
+use crate::database::Database;
+use crate::error::Error;
+use crate::ffi::ffi;
+use crate::query_result::QueryResult;
+use crate::value::Value;
+use cxx::UniquePtr;
+use std::cell::UnsafeCell;
+use std::convert::TryInto;
+
+/// A prepared stattement is a parameterized query which can avoid planning the same query for
+/// repeated execution
+pub struct PreparedStatement {
+    statement: UniquePtr<ffi::PreparedStatement>,
+}
+
+/// Connections are used to interact with a Database instance.
+///
+/// ## Concurrency
+///
+/// Each connection is thread-safe, and multiple connections can connect to the same Database
+/// instance in a multithreaded environment.
+///
+/// Note that since connections require a reference to the Database, creating or using connections
+/// in multiple threads cannot be done from a regular `std::thread` since the threads (and
+/// connections) could outlive the database. This can be worked around by using a
+/// [scoped thread](std::thread::scope) (Note: Introduced in rust 1.63. For compatibility with
+/// older versions of rust, [crosssbeam_utils::thread::scope](https://docs.rs/crossbeam-utils/latest/crossbeam_utils/thread/index.html) can be used instead).
+///
+/// Also note that write queries can only be done one at a time; the query command will return an
+/// [error](Error::FailedQuery) if another write query is in progress.
+///
+/// ```
+/// # use lbug::{Connection, Database, SystemConfig, Value, Error};
+/// # fn main() -> anyhow::Result<()> {
+/// # let temp_dir = tempfile::tempdir()?;
+/// # let db = Database::new(temp_dir.path().join("testdb"), SystemConfig::default())?;
+/// let conn = Connection::new(&db)?;
+/// conn.query("CREATE NODE TABLE Person(name STRING, age INT32, PRIMARY KEY(name));")?;
+/// // Write queries must be done sequentially
+/// conn.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+/// conn.query("CREATE (:Person {name: 'Bob', age: 30});")?;
+/// let (alice, bob) = std::thread::scope(|s| -> Result<(Vec<Value>, Vec<Value>), Error> {
+///     let alice_thread = s.spawn(|| -> Result<Vec<Value>, Error> {
+///         let conn = Connection::new(&db)?;
+///         let mut result = conn.query("MATCH (a:Person) WHERE a.name = \"Alice\" RETURN a.name AS NAME, a.age AS AGE;")?;
+///         Ok(result.next().unwrap())
+///     });
+///     let bob_thread = s.spawn(|| -> Result<Vec<Value>, Error> {
+///         let conn = Connection::new(&db)?;
+///         let mut result = conn.query(
+///             "MATCH (a:Person) WHERE a.name = \"Bob\" RETURN a.name AS NAME, a.age AS AGE;",
+///         )?;
+///         Ok(result.next().unwrap())
+///     });
+///     Ok((alice_thread.join().unwrap()?, bob_thread.join().unwrap()?))
+///  })?;
+///
+///  assert_eq!(alice, vec!["Alice".into(), 25.into()]);
+///  assert_eq!(bob, vec!["Bob".into(), 30.into()]);
+///  temp_dir.close()?;
+///  Ok(())
+/// # }
+/// ```
+///
+pub struct Connection<'a> {
+    // bmwinger: Access to the underlying value for synchronized functions can be done
+    // with (*self.conn.get()).pin_mut()
+    // Turning this into a function just causes lifetime issues.
+    conn: UnsafeCell<UniquePtr<ffi::Connection<'a>>>,
+}
+
+// Connections are synchronized on the C++ side and should be safe to move and access across
+// threads
+unsafe impl Send for Connection<'_> {}
+unsafe impl Sync for Connection<'_> {}
+
+impl<'a> Connection<'a> {
+    /// Creates a connection to the database.
+    ///
+    /// # Arguments
+    /// * `database`: A reference to the database instance to which this connection will be connected.
+    pub fn new(database: &'a Database) -> Result<Self, Error> {
+        let db = unsafe { (*database.db.get()).pin_mut() };
+        Ok(Connection {
+            conn: UnsafeCell::new(ffi::database_connect(db)?),
+        })
+    }
+
+    /// Sets the maximum number of threads to use for execution in the current connection
+    ///
+    /// # Arguments
+    /// * `num_threads`: The maximum number of threads to use for execution in the current connection
+    pub fn set_max_num_threads_for_exec(&mut self, num_threads: u64) {
+        self.conn
+            .get_mut()
+            .pin_mut()
+            .setMaxNumThreadForExec(num_threads);
+    }
+
+    /// Returns the maximum number of threads used for execution in the current connection
+    pub fn get_max_num_threads_for_exec(&self) -> u64 {
+        unsafe { (*self.conn.get()).pin_mut().getMaxNumThreadForExec() }
+    }
+
+    /// Prepares the given query and returns the prepared statement. [`PreparedStatement`]s can be run
+    /// using [`Connection::execute`]
+    ///
+    /// # Arguments
+    /// * `query`: The query to prepare. See <https://ladybugdb.com/docs/cypher> for details on the
+    ///   query format.
+    pub fn prepare(&self, query: &str) -> Result<PreparedStatement, Error> {
+        let statement =
+            unsafe { (*self.conn.get()).pin_mut() }.prepare(ffi::StringView::new(query))?;
+        if statement.isSuccess() {
+            Ok(PreparedStatement { statement })
+        } else {
+            Err(Error::FailedPreparedStatement(
+                ffi::prepared_statement_error_message(&statement),
+            ))
+        }
+    }
+
+    /// Executes the given query and returns the result.
+    ///
+    /// # Arguments
+    /// * `query`: The query to execute. See <https://ladybugdb.com/docs/cypher> for details on the
+    ///   query format.
+    // TODO(bmwinger): Instead of having a Value enum in the results, perhaps QueryResult, and thus query
+    // should be generic.
+    //
+    // E.g.
+    // let result: QueryResult<lbug::value::List<lbug::value::String>> = conn.query("...")?;
+    // let result: QueryResult<lbug::value::Int64> = conn.query("...")?;
+    //
+    // But this would really just be syntactic sugar wrapping the current system
+    pub fn query(&self, query: &str) -> Result<QueryResult<'a>, Error> {
+        let conn = unsafe { (*self.conn.get()).pin_mut() };
+        let result = ffi::connection_query(conn, ffi::StringView::new(query))?;
+        if result.isSuccess() {
+            Ok(QueryResult { result })
+        } else {
+            Err(Error::FailedQuery(ffi::query_result_get_error_message(
+                &result,
+            )))
+        }
+    }
+
+    /// Executes the given prepared statement with args and returns the result.
+    ///
+    /// # Arguments
+    /// * `prepared_statement`: The prepared statement to execute
+    ///```
+    /// # use lbug::{Database, SystemConfig, Connection, Value};
+    /// # use anyhow::Error;
+    /// #
+    /// # fn main() -> Result<(), Error> {
+    /// # let temp_dir = tempfile::tempdir()?;
+    /// # let path = temp_dir.path().join("testdb");
+    /// # let db = Database::new(path, SystemConfig::default())?;
+    /// let conn = Connection::new(&db)?;
+    /// conn.query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")?;
+    /// let mut prepared = conn.prepare("CREATE (:Person {name: $name, age: $age});")?;
+    /// conn.execute(&mut prepared,
+    ///     vec![("name", Value::String("Alice".to_string())), ("age", Value::Int64(25))])?;
+    /// conn.execute(&mut prepared,
+    ///     vec![("name", Value::String("Bob".to_string())), ("age", Value::Int64(30))])?;
+    /// # temp_dir.close()?;
+    /// # Ok(())
+    /// # }
+    /// ```
+    pub fn execute(
+        &self,
+        prepared_statement: &mut PreparedStatement,
+        params: Vec<(&str, Value)>,
+    ) -> Result<QueryResult<'a>, Error> {
+        // Passing and converting Values in a collection across the ffi boundary is difficult
+        // (std::vector cannot be constructed from rust, Vec cannot contain opaque C++ types)
+        // So we create an opaque parameter pack and copy the parameters into it one by one
+        let mut cxx_params = ffi::new_params();
+        for (key, value) in params {
+            let ffi_value: cxx::UniquePtr<ffi::Value> = value.try_into()?;
+            cxx_params.pin_mut().insert(key, ffi_value);
+        }
+        let conn = unsafe { (*self.conn.get()).pin_mut() };
+        let result =
+            ffi::connection_execute(conn, prepared_statement.statement.pin_mut(), cxx_params)?;
+        if result.isSuccess() {
+            Ok(QueryResult { result })
+        } else {
+            Err(Error::FailedQuery(ffi::query_result_get_error_message(
+                &result,
+            )))
+        }
+    }
+
+    /// Interrupts all queries currently executing within this connection
+    pub fn interrupt(&self) -> Result<(), Error> {
+        let conn = unsafe { (*self.conn.get()).pin_mut() };
+        Ok(conn.interrupt()?)
+    }
+
+    /// Sets the query timeout value of the current connection
+    ///
+    /// A value of zero (the default) disables the timeout.
+    pub fn set_query_timeout(&self, timeout_ms: u64) {
+        let conn = unsafe { (*self.conn.get()).pin_mut() };
+        conn.setQueryTimeOut(timeout_ms);
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use crate::database::SYSTEM_CONFIG_FOR_TESTS;
+    use crate::{Connection, Database, Value};
+    use anyhow::{Error, Result};
+
+    #[test]
+    fn test_connection_threads() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let mut conn = Connection::new(&db)?;
+        conn.set_max_num_threads_for_exec(5);
+        assert_eq!(conn.get_max_num_threads_for_exec(), 5);
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    fn test_invalid_query() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")?;
+        conn.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+        conn.query("CREATE (:Person {name: 'Bob', age: 30});")?;
+
+        let result: Error = conn
+            .query("MATCH (a:Person RETURN a.name AS NAME, a.age AS AGE;")
+            .expect_err("Invalid syntax in query should produce an error")
+            .into();
+        assert_eq!(
+            result.to_string(),
+            "Query execution failed: Parser exception: \
+Invalid input <MATCH (a:Person RETURN>: expected rule oC_SingleQuery (line: 1, offset: 16)
+\"MATCH (a:Person RETURN a.name AS NAME, a.age AS AGE;\"
+                 ^^^^^^"
+        );
+        Ok(())
+    }
+
+    #[test]
+    fn test_multiple_statement_query() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")?;
+        conn.query(
+            "CREATE (:Person {name: 'Alice', age: 25});
+            CREATE (:Person {name: 'Bob', age: 30});",
+        )?;
+        Ok(())
+    }
+
+    #[test]
+    fn test_query_result() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT16, PRIMARY KEY(name));")?;
+        conn.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+
+        for result in conn.query("MATCH (a:Person) RETURN a.name AS NAME, a.age AS AGE;")? {
+            assert_eq!(result.len(), 2);
+            assert_eq!(result[0], Value::String("Alice".to_string()));
+            assert_eq!(result[1], Value::Int16(25));
+        }
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    fn test_params() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT16, PRIMARY KEY(name));")?;
+        conn.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+        conn.query("CREATE (:Person {name: 'Bob', age: 30});")?;
+
+        let mut statement = conn.prepare("MATCH (a:Person) WHERE a.age = $age RETURN a.name;")?;
+        for result in conn.execute(&mut statement, vec![("age", Value::Int16(25))])? {
+            assert_eq!(result.len(), 1);
+            assert_eq!(result[0], Value::String("Alice".to_string()));
+        }
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    fn test_multithreaded_single_conn() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT32, PRIMARY KEY(name));")?;
+        // Write queries must be done sequentially
+        conn.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+        conn.query("CREATE (:Person {name: 'Bob', age: 30});")?;
+
+        let (alice, bob) = std::thread::scope(|s| -> Result<(Vec<Value>, Vec<Value>)> {
+            let alice_thread = s.spawn(|| -> Result<Vec<Value>> {
+                let mut result = conn.query("MATCH (a:Person) WHERE a.name = \"Alice\" RETURN a.name AS NAME, a.age AS AGE;")?;
+                Ok(result.next().unwrap())
+            });
+            let bob_thread = s.spawn(|| -> Result<Vec<Value>> {
+                let mut result = conn.query(
+                    "MATCH (a:Person) WHERE a.name = \"Bob\" RETURN a.name AS NAME, a.age AS AGE;",
+                )?;
+                Ok(result.next().unwrap())
+            });
+
+            Ok((alice_thread.join().unwrap()?, bob_thread.join().unwrap()?))
+        })?;
+
+        assert_eq!(alice, vec!["Alice".into(), 25.into()]);
+        assert_eq!(bob, vec!["Bob".into(), 30.into()]);
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    fn test_multithreaded_multiple_conn() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT32, PRIMARY KEY(name));")?;
+        // Write queries must be done sequentially
+        conn.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+        conn.query("CREATE (:Person {name: 'Bob', age: 30});")?;
+
+        let (alice, bob) = std::thread::scope(|s| -> Result<(Vec<Value>, Vec<Value>)> {
+            let alice_thread = s.spawn(|| -> Result<Vec<Value>> {
+                let conn = Connection::new(&db)?;
+                let mut result = conn.query("MATCH (a:Person) WHERE a.name = \"Alice\" RETURN a.name AS NAME, a.age AS AGE;")?;
+                Ok(result.next().unwrap())
+            });
+            let bob_thread = s.spawn(|| -> Result<Vec<Value>> {
+                let conn = Connection::new(&db)?;
+                let mut result = conn.query(
+                    "MATCH (a:Person) WHERE a.name = \"Bob\" RETURN a.name AS NAME, a.age AS AGE;",
+                )?;
+                Ok(result.next().unwrap())
+            });
+
+            Ok((alice_thread.join().unwrap()?, bob_thread.join().unwrap()?))
+        })?;
+
+        assert_eq!(alice, vec!["Alice".into(), 25.into()]);
+        assert_eq!(bob, vec!["Bob".into(), 30.into()]);
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    macro_rules! extension_tests {
+        ($($name:ident,)*) => {
+        $(
+            #[test]
+            #[cfg(feature = "extension_tests")]
+            fn $name() -> Result<()> {
+                let temp_dir = tempfile::tempdir()?;
+                let db = Database::new(temp_dir.path().join("testdb"), SYSTEM_CONFIG_FOR_TESTS)?;
+                let conn = Connection::new(&db)?;
+                let directory: String = if cfg!(windows) {
+                    std::env::var("LBUG_LOCAL_EXTENSIONS")?.replace("\\", "/")
+                } else {
+                    std::env::var("LBUG_LOCAL_EXTENSIONS")?
+                };
+                let name = stringify!($name);
+                conn.query(&format!("LOAD EXTENSION '{directory}/{name}/build/lib{name}.lbug_extension'"))?;
+                Ok(())
+            }
+        )*
+        }
+    }
+
+    extension_tests! {
+        fts, duckdb, httpfs, postgres, sqlite, json, delta, iceberg, vector,
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/src/database.rs b/graph-wasm/lbug-0.12.2/src/database.rs
new file mode 100644
index 0000000000..0f99fcd8c6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/database.rs
@@ -0,0 +1,346 @@
+use cxx::UniquePtr;
+use std::cell::UnsafeCell;
+use std::fmt;
+use std::path::Path;
+
+use crate::error::Error;
+use crate::ffi::ffi;
+
+/// The Database class is the main class of `LbugDB`. It manages all database components.
+pub struct Database {
+    pub(crate) db: UnsafeCell<UniquePtr<ffi::Database>>,
+}
+
+unsafe impl Send for Database {}
+unsafe impl Sync for Database {}
+
+#[derive(Clone, Debug)]
+/// Configuration options for the database.
+pub struct SystemConfig {
+    /// Max size of the buffer pool in bytes
+    ///
+    /// The larger the buffer pool, the more data from the database files is kept in memory,
+    /// reducing the amount of File I/O.
+    ///
+    /// Defaults to an auto-detected size
+    buffer_pool_size: u64,
+    /// The maximum number of threads to use when executing queries
+    /// Defaults to auto-detect from the number of processors
+    max_num_threads: u64,
+    /// When true, new columns will be compressed if possible
+    /// Defaults to true
+    enable_compression: bool,
+    /// Whether or not the database can be written to from this instance
+    /// Defaults to not read-only
+    read_only: bool,
+    /// The maximum size of the database. Defaults to 8TB
+    max_db_size: u64,
+    /// If true, the database will automatically checkpoint when the size of the WAL file exceeds the checkpoint threshold.
+    auto_checkpoint: bool,
+    /// The threshold of the WAL file size in bytes. When the size of the WAL file exceeds this threshold, the database will checkpoint if autoCheckpoint is true.
+    checkpoint_threshold: i64,
+    /// If true, any WAL replaying failure when loading the database will throw an error. Otherwise, Lbug will silently ignore the failure and replay up to where the error occured.
+    throw_on_wal_replay_failure: bool,
+    /// If true, the database will use checksums to detect corruption in the WAL file.
+    enable_checksums: bool,
+}
+
+#[cfg(test)]
+pub(crate) const SYSTEM_CONFIG_FOR_TESTS: SystemConfig = SystemConfig {
+    buffer_pool_size: 0,
+    max_num_threads: 0,
+    enable_compression: true,
+    read_only: false,
+    // Use a smaller max DB size since these tests don't need a large DB and it limits the number of
+    // databases which can be open in a single process
+    max_db_size: 16 * 1024 * 1024 * 1024,
+    auto_checkpoint: true,
+    checkpoint_threshold: -1_i64,
+    throw_on_wal_replay_failure: true,
+    enable_checksums: true,
+};
+
+impl Default for SystemConfig {
+    fn default() -> SystemConfig {
+        SystemConfig {
+            buffer_pool_size: 0,
+            max_num_threads: 0,
+            enable_compression: true,
+            read_only: false,
+            // This is a little weird, but it's a temporary interface
+            max_db_size: u64::from(u32::MAX),
+            auto_checkpoint: true,
+            checkpoint_threshold: -1_i64,
+            throw_on_wal_replay_failure: true,
+            enable_checksums: true,
+        }
+    }
+}
+
+impl SystemConfig {
+    pub fn buffer_pool_size(mut self, buffer_pool_size: u64) -> Self {
+        self.buffer_pool_size = buffer_pool_size;
+        self
+    }
+    pub fn max_num_threads(mut self, max_num_threads: u64) -> Self {
+        self.max_num_threads = max_num_threads;
+        self
+    }
+    pub fn enable_compression(mut self, enable_compression: bool) -> Self {
+        self.enable_compression = enable_compression;
+        self
+    }
+    pub fn read_only(mut self, read_only: bool) -> Self {
+        self.read_only = read_only;
+        self
+    }
+    pub fn max_db_size(mut self, max_db_size: u64) -> Self {
+        self.max_db_size = max_db_size;
+        self
+    }
+    pub fn auto_checkpoint(mut self, auto_checkpoint: bool) -> Self {
+        self.auto_checkpoint = auto_checkpoint;
+        self
+    }
+    pub fn checkpoint_threshold(mut self, checkpoint_threshold: i64) -> Self {
+        self.checkpoint_threshold = checkpoint_threshold;
+        self
+    }
+    pub fn throw_on_wal_replay_failure(mut self, throw_on_wal_replay_failure: bool) -> Self {
+        self.throw_on_wal_replay_failure = throw_on_wal_replay_failure;
+        self
+    }
+    pub fn enable_checksums(mut self, enable_checksums: bool) -> Self {
+        self.enable_checksums = enable_checksums;
+        self
+    }
+}
+
+pub(crate) const IN_MEMORY_DB_NAME: &str = ":memory:";
+
+impl Database {
+    /// Creates a database object
+    ///
+    /// # Arguments:
+    /// * `path`: Path of the database. If the database does not already exist, it will be created.
+    ///   If the path is empty, or equal to `:memory:`, the database will be created in-memory.
+    /// * `config`: Database configuration to use
+    pub fn new<P: AsRef<Path>>(path: P, config: SystemConfig) -> Result<Self, Error> {
+        Ok(Database {
+            db: UnsafeCell::new(ffi::new_database(
+                ffi::StringView::new(&path.as_ref().display().to_string()),
+                config.buffer_pool_size,
+                config.max_num_threads,
+                config.enable_compression,
+                config.read_only,
+                config.max_db_size,
+                config.auto_checkpoint,
+                config.checkpoint_threshold,
+                config.throw_on_wal_replay_failure,
+                config.enable_checksums,
+            )?),
+        })
+    }
+
+    /// Creates an in-memory database
+    ///
+    /// Alias for `Database::new(":memory:", config)`
+    pub fn in_memory(config: SystemConfig) -> Result<Self, Error> {
+        Self::new(IN_MEMORY_DB_NAME, config)
+    }
+}
+
+impl fmt::Debug for Database {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        f.debug_struct("Database")
+            .field("db", &"Opaque C++ data".to_string())
+            .finish()
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use anyhow::{Error, Result};
+
+    use crate::connection::Connection;
+    use crate::database::SYSTEM_CONFIG_FOR_TESTS;
+    use crate::database::{Database, SystemConfig};
+    use crate::value::Value;
+    use std::collections::HashSet;
+    use std::fs::File;
+    use std::io::Write;
+
+    #[test]
+    fn create_database() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let _db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    fn create_database_no_compression() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let _ = Database::new(
+            temp_dir.path().join("test"),
+            SYSTEM_CONFIG_FOR_TESTS.enable_compression(false),
+        )?;
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    fn test_database_read_only() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        // Create database first so that it can be opened read-only
+        {
+            Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        }
+        let db = Database::new(
+            temp_dir.path().join("test"),
+            SYSTEM_CONFIG_FOR_TESTS.read_only(true),
+        )?;
+        let conn = Connection::new(&db)?;
+        let result: Error = conn
+            .query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")
+            .expect_err("Write query should produce an error on a read-only DB")
+            .into();
+
+        assert_eq!(
+            result.to_string(),
+            "Query execution failed: Connection exception: Cannot execute write operations in a read-only database!"
+        );
+        Ok(())
+    }
+
+    #[test]
+    fn test_database_max_size() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        {
+            // Max DB size of 4GB should be fine
+            Database::new(
+                temp_dir.path().join("test"),
+                SystemConfig::default().max_db_size(1 << 32),
+            )?;
+        }
+        {
+            Database::new(
+                temp_dir.path().join("test"),
+                SystemConfig::default().max_db_size(0),
+            )
+            .expect_err("0 is not a valid max DB size");
+        }
+        Ok(())
+    }
+
+    #[test]
+    fn test_database_auto_checkpoint() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(
+            temp_dir.path().join("test"),
+            SYSTEM_CONFIG_FOR_TESTS.auto_checkpoint(false),
+        )?;
+        let conn = Connection::new(&db)?;
+        let result = conn.query("CALL current_setting('auto_checkpoint') RETURN *");
+        assert_eq!(
+            result?.next().unwrap()[0],
+            Value::String("False".to_string())
+        );
+        // check default checkpoint threshold
+        let result = conn.query("CALL current_setting('checkpoint_threshold') RETURN *");
+        assert_eq!(
+            result?.next().unwrap()[0],
+            Value::String("16777216".to_string())
+        );
+        Ok(())
+    }
+
+    #[test]
+    fn test_database_checkpoint_threshold() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(
+            temp_dir.path().join("test"),
+            SYSTEM_CONFIG_FOR_TESTS.checkpoint_threshold(1234),
+        )?;
+        let conn = Connection::new(&db)?;
+        let result = conn.query("CALL current_setting('checkpoint_threshold') RETURN *");
+        assert_eq!(
+            result?.next().unwrap()[0],
+            Value::String("1234".to_string())
+        );
+        Ok(())
+    }
+
+    #[test]
+    fn test_database_throw_on_wal_replay_failure() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db_path = temp_dir.path().join("test");
+        let wal_path = db_path.with_extension("wal");
+        let mut wal_file = File::create(wal_path)?;
+        wal_file.write_all(b"aaaaaaaaaaaaaaaaaaaaaaaa")?;
+        let db = Database::new(
+            db_path,
+            SYSTEM_CONFIG_FOR_TESTS.throw_on_wal_replay_failure(false),
+        )?;
+        let conn = Connection::new(&db)?;
+        let result = conn.query("return 1");
+        assert_eq!(result?.next().unwrap()[0], Value::Int64(1));
+        Ok(())
+    }
+
+    #[test]
+    fn test_database_enable_checksums() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db_path = temp_dir.path().join("test");
+        {
+            let db = Database::new(
+                db_path.clone(),
+                SYSTEM_CONFIG_FOR_TESTS
+                    .auto_checkpoint(false)
+                    .enable_checksums(true),
+            )?;
+            let conn = Connection::new(&db)?;
+            conn.query("call force_checkpoint_on_close=false")?;
+            conn.query("create node table testtest1(id int64 primary key)")?;
+        }
+        {
+            Database::new(
+                db_path.clone(),
+                SYSTEM_CONFIG_FOR_TESTS.enable_checksums(false),
+            )
+            .expect_err("An error should be thrown if the enable_checksums config doesn't match the one used to produce a WAL file");
+        }
+        Ok(())
+    }
+
+    #[test]
+    fn test_database_in_memory() -> Result<()> {
+        use crate::Value;
+        let db = Database::in_memory(SYSTEM_CONFIG_FOR_TESTS)?;
+        // If the special name is ever changed (or removed) lbug is likely to just create a db directory with that name
+        assert!(!std::path::Path::new(crate::database::IN_MEMORY_DB_NAME).exists());
+
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name))")?;
+        conn.query("BEGIN TRANSACTION")?;
+        conn.query("CREATE (:Person {name: 'Alice', age: 25})")?;
+        conn.query("CREATE (:Person {name: 'Bob', age: 30})")?;
+        conn.query("COMMIT")?;
+        let results: HashSet<String> = conn
+            .query("MATCH (p:Person) RETURN p.name")?
+            .map(|tuple| {
+                assert!(tuple.len() == 1);
+                if let Value::String(value) = &tuple[0] {
+                    value.clone()
+                } else {
+                    panic!(
+                        "Expected query values to be strings, but got {:?} instead",
+                        tuple[0]
+                    )
+                }
+            })
+            .collect();
+        assert!(results == HashSet::from(["Alice".to_string(), "Bob".to_string()]));
+        Ok(())
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/src/error.rs b/graph-wasm/lbug-0.12.2/src/error.rs
new file mode 100644
index 0000000000..5f9d326fb9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/error.rs
@@ -0,0 +1,60 @@
+use crate::logical_type::LogicalType;
+use std::fmt;
+
+pub enum Error {
+    /// Exception raised by C++ lbug library
+    CxxException(cxx::Exception),
+    /// Message produced by lbug when a query fails
+    FailedQuery(String),
+    /// Message produced by lbug when a query fails to prepare
+    FailedPreparedStatement(String),
+    /// Message produced when you attempt to pass read-only types over the FFI boundary
+    ReadOnlyType(LogicalType),
+    #[cfg(feature = "arrow")]
+    ArrowError(arrow::error::ArrowError),
+}
+
+impl std::fmt::Display for Error {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        match self {
+            Error::CxxException(cxx) => write!(f, "{cxx}"),
+            Error::FailedQuery(message) => write!(f, "Query execution failed: {message}"),
+            Error::FailedPreparedStatement(message) => {
+                write!(f, "Query execution failed: {message}")
+            }
+            Error::ReadOnlyType(typ) => {
+                write!(f, "Attempted to pass read only type {typ:?} over ffi!")
+            }
+            #[cfg(feature = "arrow")]
+            Error::ArrowError(err) => write!(f, "{err}"),
+        }
+    }
+}
+
+impl std::fmt::Debug for Error {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        write!(f, "{self}")
+    }
+}
+
+impl std::error::Error for Error {
+    fn source(&self) -> Option<&(dyn std::error::Error + 'static)> {
+        match self {
+            Error::CxxException(cxx) => Some(cxx),
+            _ => None,
+        }
+    }
+}
+
+impl From<cxx::Exception> for Error {
+    fn from(item: cxx::Exception) -> Self {
+        Error::CxxException(item)
+    }
+}
+
+#[cfg(feature = "arrow")]
+impl From<arrow::error::ArrowError> for Error {
+    fn from(item: arrow::error::ArrowError) -> Self {
+        Error::ArrowError(item)
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/src/ffi.rs b/graph-wasm/lbug-0.12.2/src/ffi.rs
new file mode 100644
index 0000000000..cf61ece39c
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/ffi.rs
@@ -0,0 +1,420 @@
+#[cfg(feature = "arrow")]
+pub(crate) mod arrow;
+
+use cxx::{type_id, ExternType};
+use std::marker::PhantomData;
+use std::mem::MaybeUninit;
+use std::os::raw::{c_char, c_void};
+
+// See https://github.com/dtolnay/cxx/issues/734
+#[derive(Copy, Clone)]
+#[repr(C)]
+pub struct StringView<'a> {
+    repr: MaybeUninit<[*const c_void; 2]>,
+    borrow: PhantomData<&'a [c_char]>,
+}
+
+unsafe impl ExternType for StringView<'_> {
+    type Id = type_id!("std::string_view");
+    type Kind = cxx::kind::Trivial;
+}
+
+impl<'a> StringView<'a> {
+    pub fn new(s: &'a str) -> Self {
+        ffi::string_view_from_str(s)
+    }
+}
+
+#[allow(clippy::module_inception)]
+#[allow(clippy::needless_lifetimes)]
+#[cxx::bridge]
+pub(crate) mod ffi {
+    unsafe extern "C++" {
+        include!("lbug/include/lbug_rs.h");
+        #[namespace = "std"]
+        #[cxx_name = "string_view"]
+        type StringView<'a> = crate::ffi::StringView<'a>;
+
+        #[namespace = "lbug_rs"]
+        fn string_view_from_str(s: &str) -> StringView<'_>;
+    }
+
+    // From types.h
+    // Note: cxx will check if values change, but not if they are added.
+    #[namespace = "lbug::common"]
+    #[repr(u8)]
+    #[derive(Debug, Clone, Copy, PartialEq, Eq)]
+    enum LogicalTypeID {
+        ANY = 0,
+        NODE = 10,
+        REL = 11,
+        RECURSIVE_REL = 12,
+        // SERIAL is a special data type that is used to represent a sequence of INT64 values that are
+        // incremented by 1 starting from 0.
+        SERIAL = 13,
+
+        // fixed size types
+        BOOL = 22,
+        INT64 = 23,
+        INT32 = 24,
+        INT16 = 25,
+        INT8 = 26,
+        UINT64 = 27,
+        UINT32 = 28,
+        UINT16 = 29,
+        UINT8 = 30,
+        INT128 = 31,
+        DOUBLE = 32,
+        FLOAT = 33,
+        DATE = 34,
+        TIMESTAMP = 35,
+        TIMESTAMP_SEC = 36,
+        TIMESTAMP_MS = 37,
+        TIMESTAMP_NS = 38,
+        TIMESTAMP_TZ = 39,
+        INTERVAL = 40,
+        DECIMAL = 41,
+        INTERNAL_ID = 42,
+
+        // variable size types
+        STRING = 50,
+        BLOB = 51,
+        LIST = 52,
+        ARRAY = 53,
+        STRUCT = 54,
+        MAP = 55,
+        UNION = 56,
+
+        UUID = 59,
+    }
+
+    // From types.h
+    // Note: cxx will check if values change, but not if they are added.
+    #[namespace = "lbug::common"]
+    #[repr(u8)]
+    #[derive(Debug, Clone, Copy, PartialEq, Eq)]
+    enum PhysicalTypeID {
+        // Fixed size types.
+        ANY = 0,
+        BOOL = 1,
+        INT64 = 2,
+        INT32 = 3,
+        INT16 = 4,
+        INT8 = 5,
+        UINT64 = 6,
+        UINT32 = 7,
+        UINT16 = 8,
+        UINT8 = 9,
+        INT128 = 10,
+        DOUBLE = 11,
+        FLOAT = 12,
+        INTERVAL = 13,
+        INTERNAL_ID = 14,
+
+        // Variable size types.
+        STRING = 20,
+        LIST = 22,
+        ARRAY = 23,
+        STRUCT = 24,
+        POINTER = 25,
+    }
+
+    #[namespace = "lbug::common"]
+    unsafe extern "C++" {
+        type LogicalTypeID;
+        type PhysicalTypeID;
+    }
+
+    #[namespace = "lbug::main"]
+    unsafe extern "C++" {
+        type PreparedStatement;
+        fn isSuccess(&self) -> bool;
+
+        #[namespace = "lbug_rs"]
+        fn prepared_statement_error_message(statement: &PreparedStatement) -> String;
+    }
+
+    #[namespace = "lbug_rs"]
+    unsafe extern "C++" {
+        type QueryParams;
+
+        // Simple types which cross the ffi without problems
+        // Non-copyable types are references so that they only need to be cloned on the
+        // C++ side of things
+        fn insert(self: Pin<&mut Self>, key: &str, value: UniquePtr<Value>);
+
+        fn new_params() -> UniquePtr<QueryParams>;
+    }
+
+    #[namespace = "lbug_rs"]
+    unsafe extern "C++" {
+        #[namespace = "lbug::main"]
+        type Database;
+
+        #[allow(clippy::fn_params_excessive_bools)]
+        fn new_database(
+            databasePath: StringView,
+            bufferPoolSize: u64,
+            maxNumThreads: u64,
+            enableCompression: bool,
+            readOnly: bool,
+            maxDBSize: u64,
+            auto_checkpoint: bool,
+            checkpoint_threshold: i64,
+            throw_on_wal_replay_failure: bool,
+            enable_checksums: bool,
+        ) -> Result<UniquePtr<Database>>;
+
+    }
+
+    #[namespace = "lbug::main"]
+    unsafe extern "C++" {
+        // The C++ Connection class includes a pointer to the database.
+        // We must not destroy a referenced database while a connection is open.
+        type Connection<'db>;
+
+        #[namespace = "lbug_rs"]
+        fn database_connect(database: Pin<&mut Database>) -> Result<UniquePtr<Connection<'_>>>;
+
+        fn prepare(
+            self: Pin<&mut Connection>,
+            query: StringView<'_>,
+        ) -> Result<UniquePtr<PreparedStatement>>;
+
+        #[namespace = "lbug_rs"]
+        fn connection_execute<'db>(
+            connection: Pin<&mut Connection<'db>>,
+            query: Pin<&mut PreparedStatement>,
+            params: UniquePtr<QueryParams>,
+        ) -> Result<UniquePtr<QueryResult<'db>>>;
+
+        #[namespace = "lbug_rs"]
+        fn connection_query<'a, 'db>(
+            connection: Pin<&mut Connection<'db>>,
+            query: StringView<'a>,
+        ) -> Result<UniquePtr<QueryResult<'db>>>;
+
+        fn getMaxNumThreadForExec(self: Pin<&mut Connection>) -> u64;
+        fn setMaxNumThreadForExec(self: Pin<&mut Connection>, num_threads: u64);
+        fn interrupt(self: Pin<&mut Connection>) -> Result<()>;
+        fn setQueryTimeOut(self: Pin<&mut Connection>, timeout_ms: u64);
+    }
+
+    #[namespace = "lbug::main"]
+    unsafe extern "C++" {
+        // The C++ QueryResult class includes a pointer to part of the Database
+        // (at minimum, the FactorizedTable references the MemoryManager)
+        type QueryResult<'db>;
+
+        #[namespace = "lbug_rs"]
+        fn query_result_to_string(query_result: &QueryResult) -> String;
+        fn isSuccess(&self) -> bool;
+        #[namespace = "lbug_rs"]
+        fn query_result_get_error_message(query_result: &QueryResult) -> String;
+        fn hasNext(&self) -> bool;
+        fn getNext(self: Pin<&mut QueryResult>) -> SharedPtr<FlatTuple>;
+
+        #[namespace = "lbug_rs"]
+        fn query_result_get_compiling_time(result: &QueryResult) -> f64;
+        #[namespace = "lbug_rs"]
+        fn query_result_get_execution_time(result: &QueryResult) -> f64;
+        fn getNumColumns(&self) -> usize;
+        fn getNumTuples(&self) -> u64;
+
+        #[namespace = "lbug_rs"]
+        fn query_result_column_data_types(
+            query_result: &QueryResult,
+        ) -> UniquePtr<CxxVector<LogicalType>>;
+        #[namespace = "lbug_rs"]
+        fn query_result_column_names(query_result: &QueryResult) -> Vec<String>;
+    }
+
+    #[namespace = "lbug::processor"]
+    unsafe extern "C++" {
+        type FlatTuple;
+
+        fn len(&self) -> u32;
+        #[namespace = "lbug_rs"]
+        fn flat_tuple_get_value(tuple: &FlatTuple, index: u32) -> &Value;
+    }
+
+    #[namespace = "lbug_rs"]
+    unsafe extern "C++" {
+        #[namespace = "lbug::common"]
+        type LogicalType;
+
+        #[namespace = "lbug::common"]
+        fn getLogicalTypeID(&self) -> LogicalTypeID;
+
+        fn create_logical_type(id: LogicalTypeID) -> UniquePtr<LogicalType>;
+        fn create_logical_type_list(child_type: UniquePtr<LogicalType>) -> UniquePtr<LogicalType>;
+        fn create_logical_type_decimal(precision: u32, scale: u32) -> UniquePtr<LogicalType>;
+        fn create_logical_type_array(
+            child_type: UniquePtr<LogicalType>,
+            num_elements: u64,
+        ) -> UniquePtr<LogicalType>;
+        fn create_logical_type_struct(
+            field_names: &Vec<String>,
+            types: UniquePtr<TypeListBuilder>,
+        ) -> UniquePtr<LogicalType>;
+        fn create_logical_type_union(
+            field_names: &Vec<String>,
+            types: UniquePtr<TypeListBuilder>,
+        ) -> UniquePtr<LogicalType>;
+        fn create_logical_type_map(
+            keyType: UniquePtr<LogicalType>,
+            valueType: UniquePtr<LogicalType>,
+        ) -> UniquePtr<LogicalType>;
+
+        fn logical_type_get_list_child_type(value: &LogicalType) -> UniquePtr<LogicalType>;
+        fn logical_type_get_array_child_type(value: &LogicalType) -> UniquePtr<LogicalType>;
+        fn logical_type_get_array_num_elements(value: &LogicalType) -> u64;
+        fn logical_type_get_struct_field_names(value: &LogicalType) -> Vec<String>;
+        fn logical_type_get_struct_field_types(
+            value: &LogicalType,
+        ) -> UniquePtr<CxxVector<LogicalType>>;
+
+        fn logical_type_get_decimal_precision(value: &LogicalType) -> u32;
+        fn logical_type_get_decimal_scale(value: &LogicalType) -> u32;
+    }
+
+    #[namespace = "lbug_rs"]
+    unsafe extern "C++" {
+        type ValueListBuilder;
+
+        fn insert(self: Pin<&mut ValueListBuilder>, value: UniquePtr<Value>);
+        fn get_list_value(
+            typ: UniquePtr<LogicalType>,
+            value: UniquePtr<ValueListBuilder>,
+        ) -> UniquePtr<Value>;
+        fn create_list() -> UniquePtr<ValueListBuilder>;
+    }
+
+    #[namespace = "lbug_rs"]
+    unsafe extern "C++" {
+        type TypeListBuilder;
+
+        fn insert(self: Pin<&mut TypeListBuilder>, typ: UniquePtr<LogicalType>);
+        fn create_type_list() -> UniquePtr<TypeListBuilder>;
+    }
+
+    #[namespace = "lbug_rs"]
+    unsafe extern "C++" {
+        #[namespace = "lbug::common"]
+        type Value;
+
+        // only used by tests
+        #[allow(dead_code)]
+        fn value_to_string(node_value: &Value) -> String;
+
+        #[rust_name = "get_value_bool"]
+        fn getValue(&self) -> bool;
+        #[rust_name = "get_value_i8"]
+        fn getValue(&self) -> i8;
+        #[rust_name = "get_value_i16"]
+        fn getValue(&self) -> i16;
+        #[rust_name = "get_value_i32"]
+        fn getValue(&self) -> i32;
+        #[rust_name = "get_value_i64"]
+        fn getValue(&self) -> i64;
+        #[rust_name = "get_value_u8"]
+        fn getValue(&self) -> u8;
+        #[rust_name = "get_value_u16"]
+        fn getValue(&self) -> u16;
+        #[rust_name = "get_value_u32"]
+        fn getValue(&self) -> u32;
+        #[rust_name = "get_value_u64"]
+        fn getValue(&self) -> u64;
+        #[rust_name = "get_value_float"]
+        fn getValue(&self) -> f32;
+        #[rust_name = "get_value_double"]
+        fn getValue(&self) -> f64;
+
+        fn value_get_string(value: &Value) -> &CxxString;
+        fn value_get_interval_secs(value: &Value) -> i64;
+        fn value_get_interval_micros(value: &Value) -> i32;
+        fn value_get_timestamp_micros(value: &Value) -> i64;
+        fn value_get_timestamp_ns(value: &Value) -> i64;
+        fn value_get_timestamp_ms(value: &Value) -> i64;
+        fn value_get_timestamp_sec(value: &Value) -> i64;
+        fn value_get_timestamp_tz(value: &Value) -> i64;
+        fn value_get_date_days(value: &Value) -> i32;
+        fn value_get_int128_t(value: &Value) -> [u64; 2];
+        fn value_get_internal_id(value: &Value) -> [u64; 2];
+
+        fn value_get_data_type_id(value: &Value) -> LogicalTypeID;
+        fn value_get_data_type(value: &Value) -> &LogicalType;
+        fn value_get_physical_type(value: &Value) -> PhysicalTypeID;
+
+        fn value_get_children_size(value: &Value) -> u32;
+        fn value_get_child(value: &Value, index: u32) -> &Value;
+
+        fn isNull(&self) -> bool;
+
+        #[rust_name = "create_value_bool"]
+        fn create_value(value: bool) -> UniquePtr<Value>;
+        #[rust_name = "create_value_i8"]
+        fn create_value(value: i8) -> UniquePtr<Value>;
+        #[rust_name = "create_value_i16"]
+        fn create_value(value: i16) -> UniquePtr<Value>;
+        #[rust_name = "create_value_i32"]
+        fn create_value(value: i32) -> UniquePtr<Value>;
+        #[rust_name = "create_value_i64"]
+        fn create_value(value: i64) -> UniquePtr<Value>;
+        #[rust_name = "create_value_u8"]
+        fn create_value(value: u8) -> UniquePtr<Value>;
+        #[rust_name = "create_value_u16"]
+        fn create_value(value: u16) -> UniquePtr<Value>;
+        #[rust_name = "create_value_u32"]
+        fn create_value(value: u32) -> UniquePtr<Value>;
+        #[rust_name = "create_value_u64"]
+        fn create_value(value: u64) -> UniquePtr<Value>;
+        #[rust_name = "create_value_float"]
+        fn create_value(value: f32) -> UniquePtr<Value>;
+        #[rust_name = "create_value_double"]
+        fn create_value(value: f64) -> UniquePtr<Value>;
+
+        fn create_value_null(typ: UniquePtr<LogicalType>) -> UniquePtr<Value>;
+        fn create_value_string(typ: LogicalTypeID, value: &[u8]) -> UniquePtr<Value>;
+        fn create_value_timestamp(value: i64) -> UniquePtr<Value>;
+        fn create_value_timestamp_tz(value: i64) -> UniquePtr<Value>;
+        fn create_value_timestamp_ns(value: i64) -> UniquePtr<Value>;
+        fn create_value_timestamp_ms(value: i64) -> UniquePtr<Value>;
+        fn create_value_timestamp_sec(value: i64) -> UniquePtr<Value>;
+        fn create_value_date(value: i32) -> UniquePtr<Value>;
+        fn create_value_interval(months: i32, days: i32, micros: i64) -> UniquePtr<Value>;
+        fn create_value_int128_t(high: i64, low: u64) -> UniquePtr<Value>;
+        fn create_value_uuid_t(high: i64, low: u64) -> UniquePtr<Value>;
+        fn create_value_internal_id(offset: u64, table: u64) -> UniquePtr<Value>;
+        fn create_value_decimal(
+            high: i64,
+            low: u64,
+            scale: u32,
+            precision: u32,
+        ) -> UniquePtr<Value>;
+
+        fn node_value_get_node_id(value: &Value) -> &Value;
+        fn node_value_get_label_name(value: &Value) -> String;
+
+        fn node_value_get_num_properties(value: &Value) -> usize;
+        fn node_value_get_property_name(value: &Value, index: usize) -> String;
+        fn node_value_get_property_value(value: &Value, index: usize) -> &Value;
+
+        fn rel_value_get_label_name(value: &Value) -> String;
+
+        fn rel_value_get_src_id(value: &Value) -> &Value;
+        fn rel_value_get_dst_id(value: &Value) -> [u64; 2];
+
+        fn rel_value_get_num_properties(value: &Value) -> usize;
+        fn rel_value_get_property_name(value: &Value, index: usize) -> String;
+        fn rel_value_get_property_value(value: &Value, index: usize) -> &Value;
+
+        fn recursive_rel_get_nodes(value: &Value) -> &Value;
+        fn recursive_rel_get_rels(value: &Value) -> &Value;
+    }
+
+    #[namespace = "lbug_rs"]
+    unsafe extern "C++" {
+        fn get_storage_version() -> u64;
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/src/ffi/arrow.rs b/graph-wasm/lbug-0.12.2/src/ffi/arrow.rs
new file mode 100644
index 0000000000..786af15e81
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/ffi/arrow.rs
@@ -0,0 +1,42 @@
+#[repr(transparent)]
+pub struct ArrowArray(pub arrow::ffi::FFI_ArrowArray);
+
+#[repr(transparent)]
+pub struct ArrowSchema(pub arrow::ffi::FFI_ArrowSchema);
+
+unsafe impl cxx::ExternType for ArrowArray {
+    type Id = cxx::type_id!("ArrowArray");
+    type Kind = cxx::kind::Trivial;
+}
+
+unsafe impl cxx::ExternType for ArrowSchema {
+    type Id = cxx::type_id!("ArrowSchema");
+    type Kind = cxx::kind::Trivial;
+}
+
+#[cxx::bridge]
+pub(crate) mod ffi_arrow {
+    unsafe extern "C++" {
+        include!("lbug/include/lbug_arrow.h");
+
+        #[namespace = "lbug::main"]
+        type QueryResult<'db> = crate::ffi::ffi::QueryResult<'db>;
+    }
+
+    unsafe extern "C++" {
+        type ArrowArray = crate::ffi::arrow::ArrowArray;
+
+        #[namespace = "lbug_arrow"]
+        fn query_result_get_next_arrow_chunk<'db>(
+            result: Pin<&mut QueryResult<'db>>,
+            chunk_size: u64,
+        ) -> Result<ArrowArray>;
+    }
+
+    unsafe extern "C++" {
+        type ArrowSchema = crate::ffi::arrow::ArrowSchema;
+
+        #[namespace = "lbug_arrow"]
+        fn query_result_get_arrow_schema<'db>(result: &QueryResult<'db>) -> Result<ArrowSchema>;
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/src/lbug_arrow.cpp b/graph-wasm/lbug-0.12.2/src/lbug_arrow.cpp
new file mode 100644
index 0000000000..7d8067e9fc
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/lbug_arrow.cpp
@@ -0,0 +1,15 @@
+#include "lbug_arrow.h"
+
+namespace lbug_arrow {
+
+ArrowSchema query_result_get_arrow_schema(const lbug::main::QueryResult& result) {
+    // Could use directly, except that we can't (yet) mark ArrowSchema as being safe to store in a
+    // cxx::UniquePtr
+    return *result.getArrowSchema();
+}
+
+ArrowArray query_result_get_next_arrow_chunk(lbug::main::QueryResult& result, uint64_t chunkSize) {
+    return *result.getNextArrowChunk(chunkSize);
+}
+
+} // namespace lbug_arrow
diff --git a/graph-wasm/lbug-0.12.2/src/lbug_rs.cpp b/graph-wasm/lbug-0.12.2/src/lbug_rs.cpp
new file mode 100644
index 0000000000..84e9e024b6
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/lbug_rs.cpp
@@ -0,0 +1,303 @@
+#include "lbug_rs.h"
+
+using lbug::common::ArrayTypeInfo;
+using lbug::common::Interval;
+using lbug::common::ListTypeInfo;
+using lbug::common::LogicalType;
+using lbug::common::LogicalTypeID;
+using lbug::common::NodeVal;
+using lbug::common::RelVal;
+using lbug::common::StructField;
+using lbug::common::Value;
+using lbug::main::Connection;
+using lbug::main::Database;
+using lbug::main::SystemConfig;
+
+namespace lbug_rs {
+
+std::unique_ptr<QueryParams> new_params() {
+    return std::make_unique<QueryParams>();
+}
+
+std::unique_ptr<LogicalType> create_logical_type(lbug::common::LogicalTypeID id) {
+    return std::make_unique<LogicalType>(id);
+}
+std::unique_ptr<LogicalType> create_logical_type_list(std::unique_ptr<LogicalType> childType) {
+    return std::make_unique<LogicalType>(LogicalType::LIST(std::move(*childType)));
+}
+
+std::unique_ptr<LogicalType> create_logical_type_array(std::unique_ptr<LogicalType> childType,
+    uint64_t numElements) {
+    return std::make_unique<LogicalType>(LogicalType::ARRAY(std::move(*childType), numElements));
+}
+
+std::unique_ptr<lbug::common::LogicalType> create_logical_type_map(
+    std::unique_ptr<LogicalType> keyType, std::unique_ptr<LogicalType> valueType) {
+    return std::make_unique<LogicalType>(
+        LogicalType::MAP(std::move(*keyType), std::move(*valueType)));
+}
+
+std::unique_ptr<LogicalType> logical_type_get_list_child_type(const LogicalType& logicalType) {
+    return std::make_unique<LogicalType>(lbug::common::ListType::getChildType(logicalType).copy());
+}
+std::unique_ptr<LogicalType> logical_type_get_array_child_type(const LogicalType& logicalType) {
+    return std::make_unique<LogicalType>(lbug::common::ArrayType::getChildType(logicalType).copy());
+}
+uint64_t logical_type_get_array_num_elements(const LogicalType& logicalType) {
+    return lbug::common::ArrayType::getNumElements(logicalType);
+}
+
+rust::Vec<rust::String> logical_type_get_struct_field_names(
+    const lbug::common::LogicalType& value) {
+    rust::Vec<rust::String> names;
+    for (auto name : lbug::common::StructType::getFieldNames(value)) {
+        names.push_back(name);
+    }
+    return names;
+}
+
+std::unique_ptr<std::vector<lbug::common::LogicalType>> logical_type_get_struct_field_types(
+    const lbug::common::LogicalType& value) {
+    std::vector<lbug::common::LogicalType> result;
+    for (const auto& type : lbug::common::StructType::getFieldTypes(value)) {
+        result.push_back(type->copy());
+    }
+    return std::make_unique<std::vector<LogicalType>>(std::move(result));
+}
+
+std::unique_ptr<Database> new_database(std::string_view databasePath, uint64_t bufferPoolSize,
+    uint64_t maxNumThreads, bool enableCompression, bool readOnly, uint64_t maxDBSize,
+    bool autoCheckpoint, int64_t checkpointThreshold, bool throwOnWalReplayFailure,
+    bool enableChecksums) {
+    auto systemConfig = SystemConfig();
+    if (bufferPoolSize > 0) {
+        systemConfig.bufferPoolSize = bufferPoolSize;
+    }
+    if (maxNumThreads > 0) {
+        systemConfig.maxNumThreads = maxNumThreads;
+    }
+    systemConfig.readOnly = readOnly;
+    systemConfig.enableCompression = enableCompression;
+    if (maxDBSize != -1u) {
+        systemConfig.maxDBSize = maxDBSize;
+    }
+    systemConfig.autoCheckpoint = autoCheckpoint;
+    if (checkpointThreshold >= 0) {
+        systemConfig.checkpointThreshold = checkpointThreshold;
+    }
+    systemConfig.throwOnWalReplayFailure = throwOnWalReplayFailure;
+    systemConfig.enableChecksums = enableChecksums;
+    return std::make_unique<Database>(databasePath, systemConfig);
+}
+
+std::unique_ptr<lbug::main::Connection> database_connect(lbug::main::Database& database) {
+    return std::make_unique<Connection>(&database);
+}
+
+std::unique_ptr<lbug::main::QueryResult> connection_execute(lbug::main::Connection& connection,
+    lbug::main::PreparedStatement& query, std::unique_ptr<QueryParams> params) {
+    return connection.executeWithParams(&query, std::move(params->inputParams));
+}
+
+rust::String prepared_statement_error_message(const lbug::main::PreparedStatement& statement) {
+    return rust::String(statement.getErrorMessage());
+}
+
+rust::String query_result_to_string(const lbug::main::QueryResult& result) {
+    return rust::String(result.toString());
+}
+
+rust::String query_result_get_error_message(const lbug::main::QueryResult& result) {
+    return rust::String(result.getErrorMessage());
+}
+
+double query_result_get_compiling_time(const lbug::main::QueryResult& result) {
+    return result.getQuerySummary()->getCompilingTime();
+}
+double query_result_get_execution_time(const lbug::main::QueryResult& result) {
+    return result.getQuerySummary()->getExecutionTime();
+}
+
+std::unique_ptr<std::vector<lbug::common::LogicalType>> query_result_column_data_types(
+    const lbug::main::QueryResult& query_result) {
+    return std::make_unique<std::vector<lbug::common::LogicalType>>(
+        query_result.getColumnDataTypes());
+}
+rust::Vec<rust::String> query_result_column_names(const lbug::main::QueryResult& query_result) {
+    rust::Vec<rust::String> names;
+    for (auto name : query_result.getColumnNames()) {
+        names.push_back(name);
+    }
+    return names;
+}
+
+rust::String node_value_get_label_name(const lbug::common::Value& val) {
+    return rust::String(lbug::common::NodeVal::getLabelVal(&val)->getValue<std::string>());
+}
+
+rust::String rel_value_get_label_name(const lbug::common::Value& val) {
+    return rust::String(lbug::common::RelVal::getLabelVal(&val)->getValue<std::string>());
+}
+
+size_t node_value_get_num_properties(const Value& value) {
+    return NodeVal::getNumProperties(&value);
+}
+size_t rel_value_get_num_properties(const Value& value) {
+    return RelVal::getNumProperties(&value);
+}
+
+rust::String node_value_get_property_name(const Value& value, size_t index) {
+    return rust::String(NodeVal::getPropertyName(&value, index));
+}
+rust::String rel_value_get_property_name(const Value& value, size_t index) {
+    return rust::String(RelVal::getPropertyName(&value, index));
+}
+
+const lbug::common::Value& node_value_get_property_value(const Value& value, size_t index) {
+    return *NodeVal::getPropertyVal(&value, index);
+}
+const lbug::common::Value& rel_value_get_property_value(const Value& value, size_t index) {
+    return *RelVal::getPropertyVal(&value, index);
+}
+
+const Value& node_value_get_node_id(const lbug::common::Value& val) {
+    return *lbug::common::NodeVal::getNodeIDVal(&val);
+}
+
+const Value& rel_value_get_src_id(const lbug::common::Value& val) {
+    return *lbug::common::RelVal::getSrcNodeIDVal(&val);
+}
+std::array<uint64_t, 2> rel_value_get_dst_id(const lbug::common::Value& val) {
+    auto internalID =
+        lbug::common::RelVal::getDstNodeIDVal(&val)->getValue<lbug::common::internalID_t>();
+    return std::array{internalID.offset, internalID.tableID};
+}
+
+rust::String value_to_string(const lbug::common::Value& val) {
+    return rust::String(val.toString());
+}
+
+uint32_t flat_tuple_len(const lbug::processor::FlatTuple& flatTuple) {
+    return flatTuple.len();
+}
+const lbug::common::Value& flat_tuple_get_value(const lbug::processor::FlatTuple& flatTuple,
+    uint32_t index) {
+    return flatTuple[index];
+}
+
+const std::string& value_get_string(const lbug::common::Value& value) {
+    return value.strVal;
+}
+int64_t value_get_interval_secs(const lbug::common::Value& value) {
+    auto interval = value.getValue<lbug::common::interval_t>();
+    return (interval.months * Interval::DAYS_PER_MONTH + interval.days) * Interval::HOURS_PER_DAY *
+               Interval::MINS_PER_HOUR * Interval::SECS_PER_MINUTE
+           // Include extra microseconds with the seconds
+           + interval.micros / Interval::MICROS_PER_SEC;
+}
+int32_t value_get_interval_micros(const lbug::common::Value& value) {
+    auto interval = value.getValue<lbug::common::interval_t>();
+    return interval.micros % Interval::MICROS_PER_SEC;
+}
+int32_t value_get_date_days(const lbug::common::Value& value) {
+    return value.getValue<lbug::common::date_t>().days;
+}
+int64_t value_get_timestamp_micros(const lbug::common::Value& value) {
+    return value.getValue<lbug::common::timestamp_t>().value;
+}
+int64_t value_get_timestamp_ns(const lbug::common::Value& value) {
+    return value.getValue<lbug::common::timestamp_ns_t>().value;
+}
+int64_t value_get_timestamp_ms(const lbug::common::Value& value) {
+    return value.getValue<lbug::common::timestamp_ms_t>().value;
+}
+int64_t value_get_timestamp_sec(const lbug::common::Value& value) {
+    return value.getValue<lbug::common::timestamp_sec_t>().value;
+}
+int64_t value_get_timestamp_tz(const lbug::common::Value& value) {
+    return value.getValue<lbug::common::timestamp_tz_t>().value;
+}
+std::array<uint64_t, 2> value_get_int128_t(const lbug::common::Value& value) {
+    auto int128 = value.getValue<lbug::common::int128_t>();
+    auto int128_high = static_cast<uint64_t>(int128.high);
+    return std::array{int128_high, int128.low};
+}
+
+std::array<uint64_t, 2> value_get_internal_id(const lbug::common::Value& value) {
+    auto internalID = value.getValue<lbug::common::internalID_t>();
+    return std::array{internalID.offset, internalID.tableID};
+}
+
+uint32_t value_get_children_size(const lbug::common::Value& value) {
+    return lbug::common::NestedVal::getChildrenSize(&value);
+}
+
+const Value& value_get_child(const lbug::common::Value& value, uint32_t index) {
+    return *lbug::common::NestedVal::getChildVal(&value, index);
+}
+
+lbug::common::LogicalTypeID value_get_data_type_id(const lbug::common::Value& value) {
+    return value.getDataType().getLogicalTypeID();
+}
+
+const LogicalType& value_get_data_type(const lbug::common::Value& value) {
+    return value.getDataType();
+}
+
+std::unique_ptr<lbug::common::Value> create_value_string(LogicalTypeID typ,
+    const rust::Slice<const unsigned char> value) {
+    return std::make_unique<lbug::common::Value>(LogicalType(typ),
+        std::string((const char*)value.data(), value.size()));
+}
+std::unique_ptr<lbug::common::Value> create_value_timestamp(const int64_t timestamp) {
+    return std::make_unique<lbug::common::Value>(lbug::common::timestamp_t(timestamp));
+}
+std::unique_ptr<lbug::common::Value> create_value_timestamp_tz(const int64_t timestamp) {
+    return std::make_unique<lbug::common::Value>(lbug::common::timestamp_tz_t(timestamp));
+}
+std::unique_ptr<lbug::common::Value> create_value_timestamp_ns(const int64_t timestamp) {
+    return std::make_unique<lbug::common::Value>(lbug::common::timestamp_ns_t(timestamp));
+}
+std::unique_ptr<lbug::common::Value> create_value_timestamp_ms(const int64_t timestamp) {
+    return std::make_unique<lbug::common::Value>(lbug::common::timestamp_ms_t(timestamp));
+}
+std::unique_ptr<lbug::common::Value> create_value_timestamp_sec(const int64_t timestamp) {
+    return std::make_unique<lbug::common::Value>(lbug::common::timestamp_sec_t(timestamp));
+}
+std::unique_ptr<lbug::common::Value> create_value_interval(const int32_t months, const int32_t days,
+    const int64_t micros) {
+    return std::make_unique<lbug::common::Value>(lbug::common::interval_t(months, days, micros));
+}
+std::unique_ptr<lbug::common::Value> create_value_null(
+    std::unique_ptr<lbug::common::LogicalType> typ) {
+    return std::make_unique<lbug::common::Value>(
+        lbug::common::Value::createNullValue(std::move(*typ)));
+}
+std::unique_ptr<lbug::common::Value> create_value_internal_id(uint64_t offset, uint64_t table) {
+    return std::make_unique<lbug::common::Value>(lbug::common::internalID_t(offset, table));
+}
+std::unique_ptr<lbug::common::Value> create_value_int128_t(int64_t high, uint64_t low) {
+    return std::make_unique<lbug::common::Value>(lbug::common::int128_t(low, high));
+}
+
+std::unique_ptr<lbug::common::Value> get_list_value(std::unique_ptr<lbug::common::LogicalType> typ,
+    std::unique_ptr<ValueListBuilder> value) {
+    return std::make_unique<lbug::common::Value>(std::move(*typ), std::move(value->values));
+}
+
+std::unique_ptr<ValueListBuilder> create_list() {
+    return std::make_unique<ValueListBuilder>();
+}
+
+std::unique_ptr<TypeListBuilder> create_type_list() {
+    return std::make_unique<TypeListBuilder>();
+}
+
+const lbug::common::Value& recursive_rel_get_nodes(const lbug::common::Value& val) {
+    return *lbug::common::RecursiveRelVal::getNodes(&val);
+}
+const lbug::common::Value& recursive_rel_get_rels(const lbug::common::Value& val) {
+    return *lbug::common::RecursiveRelVal::getRels(&val);
+}
+
+} // namespace lbug_rs
diff --git a/graph-wasm/lbug-0.12.2/src/lib.rs b/graph-wasm/lbug-0.12.2/src/lib.rs
new file mode 100644
index 0000000000..ec0f0f4402
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/lib.rs
@@ -0,0 +1,87 @@
+//! Bindings to Lbug: an in-process property graph database management system built for query speed and scalability.
+//!
+//! ## Example Usage
+//! ```
+//! use lbug::{Database, SystemConfig, Connection};
+//! # use anyhow::Error;
+//!
+//! # fn main() -> Result<(), Error> {
+//! # let temp_dir = tempfile::tempdir()?;
+//! # let path = temp_dir.path().join("testdb");
+//! let db = Database::new(path, SystemConfig::default())?;
+//! let conn = Connection::new(&db)?;
+//! conn.query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")?;
+//! conn.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+//! conn.query("CREATE (:Person {name: 'Bob', age: 30});")?;
+//!
+//! let mut result = conn.query("MATCH (a:Person) RETURN a.name AS NAME, a.age AS AGE;")?;
+//! println!("{}", result);
+//! # temp_dir.close()?;
+//! # Ok(())
+//! # }
+//! ```
+//! ## Building
+//!
+//! By default, the Lbug C++ library will be compiled from source and statically linked.
+//!
+//! If you want to instead link against a pre-built version of the library, the following environment
+//! variables can be used to configure the build process:
+//!
+//! - `LBUG_SHARED`: If set, link dynamically instead of statically
+//! - `LBUG_INCLUDE_DIR`: Directory of Lbug's headers
+//! - `LBUG_LIBRARY_DIR`: Directory containing Lbug's pre-built libraries.
+//!
+//! Example:
+//! ```bash
+//! lbug_prebuilt_dir=/tmp/lbug # pre-built Lbug from https://docs.ladybugdb.com/installation/#cc
+//! lbug_prebuilt_dir=/path_to_lbug_source/build/release/src # Lbug built from source
+//! export LBUG_LIBRARY_DIR="lbug_prebuilt_dir"
+//! export LBUG_INCLUDE_DIR="lbug_prebuilt_dir"
+//! export LBUG_SHARED=1
+//! ```
+//! On macOS:
+//! ```bash
+//! brew install lbug
+//! export LBUG_LIBRARY_DIR=/opt/homebrew/lib
+//! export LBUG_INCLUDE_DIR=/opt/homebrew/include
+//! export LBUG_SHARED=1
+//! ```
+//!
+//! ## Using Extensions
+//! By default, binaries created using this library will not work with Lbug's
+//! [extensions](https://docs.ladybugdb.com/extensions/) (except on Windows/MSVC, where the linker works differently).
+//!
+//! If you want to use extensions in binaries (binary crates or tests) using this
+//! library, you will need to add the following (or a similar command; see
+//! [build-scripts](https://doc.rust-lang.org/cargo/reference/build-scripts.html#rustc-link-arg))
+//! to your build.rs (or create one) so that the binary
+//! produced acts like a library that the extension can link with. Not doing this will produce
+//! undefined symbol errors when the extension is loaded:
+//!
+//! ```ignore
+//! println!("cargo:rustc-link-arg=-rdynamic");
+//! ```
+
+pub use connection::{Connection, PreparedStatement};
+pub use database::{Database, SystemConfig};
+pub use error::Error;
+pub use logical_type::LogicalType;
+#[cfg(feature = "arrow")]
+pub use query_result::ArrowIterator;
+pub use query_result::{CSVOptions, QueryResult};
+pub use value::{InternalID, NodeVal, RelVal, Value};
+
+mod connection;
+mod database;
+mod error;
+mod ffi;
+mod logical_type;
+mod query_result;
+mod value;
+
+/// The version of the Lbug crate as reported by Cargo's `CARGO_PKG_VERSION` environment variable
+pub const VERSION: &str = env!("CARGO_PKG_VERSION");
+/// Returns the storage version of the Lbug library
+pub fn get_storage_version() -> u64 {
+    crate::ffi::ffi::get_storage_version()
+}
diff --git a/graph-wasm/lbug-0.12.2/src/logical_type.rs b/graph-wasm/lbug-0.12.2/src/logical_type.rs
new file mode 100644
index 0000000000..9a09940359
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/logical_type.rs
@@ -0,0 +1,310 @@
+use crate::ffi::ffi;
+
+/// Type of [Value](crate::value::Value)s produced and consumed by queries.
+///
+/// Includes extra type information beyond what can be encoded in [Value](crate::value::Value) such as
+/// struct fields and types of lists
+#[derive(Clone, Debug, PartialEq, Eq)]
+pub enum LogicalType {
+    /// Special type for use with [`Value::Null`](crate::value::Value::Null)
+    Any,
+    /// Correponds to [`Value::Bool`](crate::value::Value::Bool)
+    Bool,
+    /// Has no corresponding Value. Lbug returns Serial values as [`Int64`](crate::Value::Int64).
+    Serial,
+    /// Correponds to [`Value::Int64`](crate::value::Value::Int64)
+    Int64,
+    /// Correponds to [`Value::Int32`](crate::value::Value::Int32)
+    Int32,
+    /// Correponds to [`Value::Int16`](crate::value::Value::Int16)
+    Int16,
+    /// Correponds to [`Value::Int8`](crate::value::Value::Int8)
+    Int8,
+    /// Correponds to [`Value::UInt64`](crate::value::Value::UInt64)
+    UInt64,
+    /// Correponds to [`Value::UInt32`](crate::value::Value::UInt32)
+    UInt32,
+    /// Correponds to [`Value::UInt16`](crate::value::Value::UInt16)
+    UInt16,
+    /// Correponds to [`Value::UInt8`](crate::value::Value::UInt8)
+    UInt8,
+    /// Correponds to [`Value::Int128`](crate::value::Value::Int128)
+    Int128,
+    /// Correponds to [`Value::Double`](crate::value::Value::Double)
+    Double,
+    /// Correponds to [`Value::Float`](crate::value::Value::Float)
+    Float,
+    /// Correponds to [`Value::Date`](crate::value::Value::Date)
+    Date,
+    /// Correponds to [`Value::Interval`](crate::value::Value::Interval)
+    Interval,
+    /// Correponds to [`Value::Timestamp`](crate::value::Value::Timestamp)
+    Timestamp,
+    /// Correponds to [`Value::TimestampTz`](crate::value::Value::TimestampTz)
+    TimestampTz,
+    /// Correponds to [`Value::TimestampNs`](crate::value::Value::TimestampNs)
+    TimestampNs,
+    /// Correponds to [`Value::TimestampMs`](crate::value::Value::TimestampMs)
+    TimestampMs,
+    /// Correponds to [`Value::TimestampSec`](crate::value::Value::TimestampSec)
+    TimestampSec,
+    /// Correponds to [`Value::InternalID`](crate::value::Value::InternalID)
+    InternalID,
+    /// Correponds to [`Value::String`](crate::value::Value::String)
+    String,
+    /// Correponds to [`Value::Blob`](crate::value::Value::Blob)
+    Blob,
+    /// Correponds to [`Value::List`](crate::value::Value::List)
+    List {
+        child_type: Box<LogicalType>,
+    },
+    /// Correponds to [`Value::Array`](crate::value::Value::Array)
+    Array {
+        child_type: Box<LogicalType>,
+        num_elements: u64,
+    },
+    /// Correponds to [`Value::Struct`](crate::value::Value::Struct)
+    Struct {
+        fields: Vec<(String, LogicalType)>,
+    },
+    /// Correponds to [`Value::Node`](crate::value::Value::Node)
+    Node,
+    /// Correponds to [`Value::Rel`](crate::value::Value::Rel)
+    Rel,
+    RecursiveRel,
+    /// Correponds to [`Value::Map`](crate::value::Value::Map)
+    Map {
+        key_type: Box<LogicalType>,
+        value_type: Box<LogicalType>,
+    },
+    /// Correponds to [`Value::Union`](crate::value::Value::Union)
+    Union {
+        types: Vec<(String, LogicalType)>,
+    },
+    /// Correponds to [`Value::UUID`](crate::value::Value::UUID)
+    UUID,
+    /// Correponds to [`Value::Decimal`](crate::value::Value::Decimal)
+    Decimal {
+        precision: u32,
+        scale: u32,
+    },
+}
+
+impl From<&ffi::Value> for LogicalType {
+    fn from(value: &ffi::Value) -> Self {
+        ffi::value_get_data_type(value).into()
+    }
+}
+
+impl From<&ffi::LogicalType> for LogicalType {
+    fn from(logical_type: &ffi::LogicalType) -> Self {
+        use ffi::LogicalTypeID;
+        match logical_type.getLogicalTypeID() {
+            LogicalTypeID::ANY => LogicalType::Any,
+            LogicalTypeID::BOOL => LogicalType::Bool,
+            LogicalTypeID::SERIAL => LogicalType::Serial,
+            LogicalTypeID::INT8 => LogicalType::Int8,
+            LogicalTypeID::INT16 => LogicalType::Int16,
+            LogicalTypeID::INT32 => LogicalType::Int32,
+            LogicalTypeID::INT64 => LogicalType::Int64,
+            LogicalTypeID::UINT8 => LogicalType::UInt8,
+            LogicalTypeID::UINT16 => LogicalType::UInt16,
+            LogicalTypeID::UINT32 => LogicalType::UInt32,
+            LogicalTypeID::UINT64 => LogicalType::UInt64,
+            LogicalTypeID::INT128 => LogicalType::Int128,
+            LogicalTypeID::FLOAT => LogicalType::Float,
+            LogicalTypeID::DOUBLE => LogicalType::Double,
+            LogicalTypeID::STRING => LogicalType::String,
+            LogicalTypeID::BLOB => LogicalType::Blob,
+            LogicalTypeID::INTERVAL => LogicalType::Interval,
+            LogicalTypeID::DATE => LogicalType::Date,
+            LogicalTypeID::TIMESTAMP => LogicalType::Timestamp,
+            LogicalTypeID::TIMESTAMP_TZ => LogicalType::TimestampTz,
+            LogicalTypeID::TIMESTAMP_NS => LogicalType::TimestampNs,
+            LogicalTypeID::TIMESTAMP_MS => LogicalType::TimestampMs,
+            LogicalTypeID::TIMESTAMP_SEC => LogicalType::TimestampSec,
+            LogicalTypeID::INTERNAL_ID => LogicalType::InternalID,
+            LogicalTypeID::LIST => LogicalType::List {
+                child_type: Box::new(
+                    ffi::logical_type_get_list_child_type(logical_type)
+                        .as_ref()
+                        .unwrap()
+                        .into(),
+                ),
+            },
+            LogicalTypeID::ARRAY => LogicalType::Array {
+                child_type: Box::new(
+                    ffi::logical_type_get_array_child_type(logical_type)
+                        .as_ref()
+                        .unwrap()
+                        .into(),
+                ),
+                num_elements: ffi::logical_type_get_array_num_elements(logical_type),
+            },
+            LogicalTypeID::STRUCT => {
+                let names = ffi::logical_type_get_struct_field_names(logical_type);
+                let types = ffi::logical_type_get_struct_field_types(logical_type);
+                LogicalType::Struct {
+                    fields: names
+                        .into_iter()
+                        .zip(types.into_iter().map(Into::<LogicalType>::into))
+                        .collect(),
+                }
+            }
+            LogicalTypeID::NODE => LogicalType::Node,
+            LogicalTypeID::REL => LogicalType::Rel,
+            LogicalTypeID::RECURSIVE_REL => LogicalType::RecursiveRel,
+            LogicalTypeID::MAP => {
+                let child_type_ptr = ffi::logical_type_get_list_child_type(logical_type);
+                let child_type = child_type_ptr.as_ref().unwrap();
+                let types = ffi::logical_type_get_struct_field_types(child_type);
+                let key_type = types
+                    .as_ref()
+                    .unwrap()
+                    .get(0)
+                    .expect(
+                        "First element of map type list should be the key type, but list was empty",
+                    )
+                    .into();
+                let value_type = types.as_ref().unwrap()
+                    .get(1)
+                    .expect("Second element of map type list should be the value type, but list did not have two elements")
+                    .into();
+                LogicalType::Map {
+                    key_type: Box::new(key_type),
+                    value_type: Box::new(value_type),
+                }
+            }
+            LogicalTypeID::UNION => {
+                let names = ffi::logical_type_get_struct_field_names(logical_type);
+                let types = ffi::logical_type_get_struct_field_types(logical_type);
+                LogicalType::Union {
+                    types: names
+                        .into_iter()
+                        // Skip the tag field
+                        .skip(1)
+                        .zip(types.into_iter().skip(1).map(Into::<LogicalType>::into))
+                        .collect(),
+                }
+            }
+            LogicalTypeID::UUID => LogicalType::UUID,
+            LogicalTypeID::DECIMAL => {
+                let precision = ffi::logical_type_get_decimal_precision(logical_type);
+                let scale = ffi::logical_type_get_decimal_scale(logical_type);
+                LogicalType::Decimal { precision, scale }
+            }
+            // Should be unreachable, as cxx will check that the LogicalTypeID enum matches the one
+            // on the C++ side.
+            x => panic!("Unsupported type {x:?}"),
+        }
+    }
+}
+
+impl From<&LogicalType> for cxx::UniquePtr<ffi::LogicalType> {
+    fn from(typ: &LogicalType) -> Self {
+        match typ {
+            LogicalType::Any
+            | LogicalType::Bool
+            | LogicalType::Serial
+            | LogicalType::Int64
+            | LogicalType::Int32
+            | LogicalType::Int16
+            | LogicalType::Int8
+            | LogicalType::UInt64
+            | LogicalType::UInt32
+            | LogicalType::UInt16
+            | LogicalType::UInt8
+            | LogicalType::Int128
+            | LogicalType::Float
+            | LogicalType::Double
+            | LogicalType::Date
+            | LogicalType::Timestamp
+            | LogicalType::TimestampTz
+            | LogicalType::TimestampNs
+            | LogicalType::TimestampMs
+            | LogicalType::TimestampSec
+            | LogicalType::Interval
+            | LogicalType::InternalID
+            | LogicalType::String
+            | LogicalType::Blob
+            | LogicalType::Node
+            | LogicalType::Rel
+            | LogicalType::RecursiveRel
+            | LogicalType::UUID => ffi::create_logical_type(typ.id()),
+            LogicalType::List { child_type } => {
+                ffi::create_logical_type_list(child_type.as_ref().into())
+            }
+            LogicalType::Array {
+                child_type,
+                num_elements,
+            } => ffi::create_logical_type_array(child_type.as_ref().into(), *num_elements),
+            LogicalType::Struct { fields } => {
+                let mut builder = ffi::create_type_list();
+                let mut names = vec![];
+                for (name, typ) in fields {
+                    names.push(name.clone());
+                    builder.pin_mut().insert(typ.into());
+                }
+                ffi::create_logical_type_struct(&names, builder)
+            }
+            LogicalType::Union { types } => {
+                let mut builder = ffi::create_type_list();
+                let mut names = vec![];
+                for (name, typ) in types {
+                    names.push(name.clone());
+                    builder.pin_mut().insert(typ.into());
+                }
+                ffi::create_logical_type_union(&names, builder)
+            }
+            LogicalType::Map {
+                key_type,
+                value_type,
+            } => ffi::create_logical_type_map(key_type.as_ref().into(), value_type.as_ref().into()),
+            LogicalType::Decimal { precision, scale } => {
+                ffi::create_logical_type_decimal(*precision, *scale)
+            }
+        }
+    }
+}
+
+impl LogicalType {
+    pub(crate) fn id(&self) -> ffi::LogicalTypeID {
+        use ffi::LogicalTypeID;
+        match self {
+            LogicalType::Any => LogicalTypeID::ANY,
+            LogicalType::Bool => LogicalTypeID::BOOL,
+            LogicalType::Serial => LogicalTypeID::SERIAL,
+            LogicalType::Int8 => LogicalTypeID::INT8,
+            LogicalType::Int16 => LogicalTypeID::INT16,
+            LogicalType::Int32 => LogicalTypeID::INT32,
+            LogicalType::Int64 => LogicalTypeID::INT64,
+            LogicalType::UInt8 => LogicalTypeID::UINT8,
+            LogicalType::UInt16 => LogicalTypeID::UINT16,
+            LogicalType::UInt32 => LogicalTypeID::UINT32,
+            LogicalType::UInt64 => LogicalTypeID::UINT64,
+            LogicalType::Int128 => LogicalTypeID::INT128,
+            LogicalType::Float => LogicalTypeID::FLOAT,
+            LogicalType::Double => LogicalTypeID::DOUBLE,
+            LogicalType::String => LogicalTypeID::STRING,
+            LogicalType::Blob => LogicalTypeID::BLOB,
+            LogicalType::Interval => LogicalTypeID::INTERVAL,
+            LogicalType::Date => LogicalTypeID::DATE,
+            LogicalType::Timestamp => LogicalTypeID::TIMESTAMP,
+            LogicalType::TimestampTz => LogicalTypeID::TIMESTAMP_TZ,
+            LogicalType::TimestampNs => LogicalTypeID::TIMESTAMP_NS,
+            LogicalType::TimestampMs => LogicalTypeID::TIMESTAMP_MS,
+            LogicalType::TimestampSec => LogicalTypeID::TIMESTAMP_SEC,
+            LogicalType::InternalID => LogicalTypeID::INTERNAL_ID,
+            LogicalType::List { .. } => LogicalTypeID::LIST,
+            LogicalType::Array { .. } => LogicalTypeID::ARRAY,
+            LogicalType::Struct { .. } => LogicalTypeID::STRUCT,
+            LogicalType::Node => LogicalTypeID::NODE,
+            LogicalType::Rel => LogicalTypeID::REL,
+            LogicalType::RecursiveRel => LogicalTypeID::RECURSIVE_REL,
+            LogicalType::Map { .. } => LogicalTypeID::MAP,
+            LogicalType::Union { .. } => LogicalTypeID::UNION,
+            LogicalType::UUID => LogicalTypeID::UUID,
+            LogicalType::Decimal { .. } => LogicalTypeID::DECIMAL,
+        }
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/src/query_result.rs b/graph-wasm/lbug-0.12.2/src/query_result.rs
new file mode 100644
index 0000000000..b5a183f5d1
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/query_result.rs
@@ -0,0 +1,290 @@
+use crate::ffi::ffi;
+use crate::logical_type::LogicalType;
+use crate::value::Value;
+use cxx::UniquePtr;
+use std::convert::TryInto;
+use std::fmt;
+
+/// Stores the result of a query execution
+pub struct QueryResult<'a> {
+    pub(crate) result: UniquePtr<ffi::QueryResult<'a>>,
+}
+
+// Should be safe to move across threads, however access is not synchronized
+unsafe impl Send for ffi::QueryResult<'_> {}
+
+/// Options for writing CSV files
+pub struct CSVOptions {
+    delimiter: char,
+    escape_character: char,
+    newline: char,
+}
+
+impl Default for CSVOptions {
+    /// Default CSV options with delimiter `,`, escape character `"` and newline `\n`.
+    fn default() -> Self {
+        CSVOptions {
+            delimiter: ',',
+            escape_character: '"',
+            newline: '\n',
+        }
+    }
+}
+
+impl CSVOptions {
+    /// Sets the field delimiter to use when writing the CSV file. If not specified the default is
+    /// `,`
+    pub fn delimiter(mut self, delimiter: char) -> Self {
+        self.delimiter = delimiter;
+        self
+    }
+
+    /// Sets the escape character to use for text containing special characters.
+    /// If not specified the default is `"`
+    pub fn escape_character(mut self, escape_character: char) -> Self {
+        self.escape_character = escape_character;
+        self
+    }
+
+    /// Sets the newline character
+    /// If not specified the default is `\n`
+    pub fn newline(mut self, newline: char) -> Self {
+        self.newline = newline;
+        self
+    }
+}
+
+#[allow(clippy::needless_lifetimes)]
+impl<'db> QueryResult<'db> {
+    /// Returns the time spent compiling the query in milliseconds
+    pub fn get_compiling_time(&self) -> f64 {
+        ffi::query_result_get_compiling_time(self.result.as_ref().unwrap())
+    }
+
+    /// Returns the time spent executing the query in milliseconds
+    pub fn get_execution_time(&self) -> f64 {
+        ffi::query_result_get_execution_time(self.result.as_ref().unwrap())
+    }
+
+    /// Returns the number of columns in the query result.
+    ///
+    /// This corresponds to the length of each result vector yielded by the iterator.
+    pub fn get_num_columns(&self) -> usize {
+        self.result.as_ref().unwrap().getNumColumns()
+    }
+    /// Returns the number of tuples in the query result.
+    ///
+    /// This corresponds to the total number of result
+    /// vectors that the query result iterator will yield.
+    pub fn get_num_tuples(&self) -> u64 {
+        self.result.as_ref().unwrap().getNumTuples()
+    }
+
+    /// Returns the name of each column in the query result
+    pub fn get_column_names(&self) -> Vec<String> {
+        ffi::query_result_column_names(self.result.as_ref().unwrap())
+    }
+    /// Returns the data type of each column in the query result
+    pub fn get_column_data_types(&self) -> Vec<LogicalType> {
+        ffi::query_result_column_data_types(self.result.as_ref().unwrap())
+            .as_ref()
+            .unwrap()
+            .iter()
+            .map(|x| x.into())
+            .collect()
+    }
+
+    #[cfg(feature = "arrow")]
+    /// Produces an iterator over the results as [`RecordBatch`](arrow::record_batch::RecordBatch)es,
+    /// split into chunks of the given size.
+    ///
+    /// *Requires the `arrow` feature*
+    pub fn iter_arrow<'qr>(
+        &'qr mut self,
+        chunk_size: usize,
+    ) -> Result<ArrowIterator<'qr, 'db>, crate::error::Error> {
+        let schema = crate::ffi::arrow::ffi_arrow::query_result_get_arrow_schema(
+            self.result.as_ref().unwrap(),
+        )?
+        .0;
+        Ok(ArrowIterator {
+            chunk_size,
+            result: &mut self.result,
+            schema,
+        })
+    }
+}
+
+// the underlying C++ type is both data and an iterator (sort-of)
+impl Iterator for QueryResult<'_> {
+    type Item = Vec<Value>;
+
+    fn next(&mut self) -> Option<Self::Item> {
+        if self.result.as_ref().unwrap().hasNext() {
+            let flat_tuple = self.result.pin_mut().getNext();
+            let mut result = vec![];
+            for i in 0..flat_tuple.as_ref().unwrap().len() {
+                let value = ffi::flat_tuple_get_value(flat_tuple.as_ref().unwrap(), i);
+                // TODO: Return result instead of unwrapping?
+                // Unfortunately, as an iterator, this would require producing
+                // Vec<Result<Value>>, though it would be possible to turn that into
+                // Result<Vec<Value>> instead, but it would lose information when multiple failures
+                // occur.
+                result.push(value.try_into().unwrap());
+            }
+            Some(result)
+        } else {
+            None
+        }
+    }
+}
+
+#[cfg(feature = "arrow")]
+/// Produces an iterator over a `QueryResult` as [`RecordBatch`](arrow::record_batch::RecordBatch)es
+///
+/// The result is split into chunks of a size specified in [`iter_arrow`](QueryResult::iter_arrow).
+///
+/// *Requires the `arrow` feature*
+pub struct ArrowIterator<'qr, 'db: 'qr> {
+    pub(crate) chunk_size: usize,
+    pub(crate) result: &'qr mut UniquePtr<ffi::QueryResult<'db>>,
+    pub(crate) schema: arrow::ffi::FFI_ArrowSchema,
+}
+
+#[cfg(feature = "arrow")]
+impl Iterator for ArrowIterator<'_, '_> {
+    type Item = arrow::record_batch::RecordBatch;
+
+    fn next(&mut self) -> Option<Self::Item> {
+        if self.result.as_ref().unwrap().hasNext() {
+            use crate::ffi::arrow::ffi_arrow;
+            // Generally this panic should be unreachable, since the only exceptions produced by
+            // arrow_converter are for unsupported types, but those would produce an error when we
+            // create the schema.
+            let array = ffi_arrow::query_result_get_next_arrow_chunk(
+                self.result.pin_mut(),
+                self.chunk_size as u64,
+            )
+            .expect("Failed to get next recordbatch");
+            let struct_array: arrow::array::StructArray =
+                unsafe { arrow::ffi::from_ffi(array.0, &self.schema) }
+                    .expect("Failed to convert ArrowArray from C data")
+                    .into();
+            Some(struct_array.into())
+        } else {
+            None
+        }
+    }
+}
+
+impl fmt::Debug for QueryResult<'_> {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        f.debug_struct("QueryResult")
+            .field(
+                "result",
+                &ffi::query_result_to_string(self.result.as_ref().unwrap()),
+            )
+            .finish()
+    }
+}
+
+impl std::fmt::Display for QueryResult<'_> {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        write!(
+            f,
+            "{}",
+            ffi::query_result_to_string(self.result.as_ref().unwrap())
+        )
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use crate::connection::Connection;
+    use crate::database::Database;
+    use crate::database::SYSTEM_CONFIG_FOR_TESTS;
+    use crate::logical_type::LogicalType;
+
+    #[test]
+    fn test_query_result_metadata() -> anyhow::Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let connection = Connection::new(&db)?;
+
+        // Create schema.
+        connection.query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")?;
+        // Create nodes.
+        connection.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+        connection.query("CREATE (:Person {name: 'Bob', age: 30});")?;
+
+        // Execute a simple query.
+        let result = connection.query("MATCH (a:Person) RETURN a.name AS NAME, a.age AS AGE;")?;
+
+        assert!(result.get_compiling_time() > 0.);
+        assert!(result.get_execution_time() > 0.);
+        assert_eq!(result.get_column_names(), vec!["NAME", "AGE"]);
+        assert_eq!(
+            result.get_column_data_types(),
+            vec![LogicalType::String, LogicalType::Int64]
+        );
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    fn test_query_result_move() -> anyhow::Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let result = {
+            let connection = Connection::new(&db)?;
+
+            // Create schema.
+            connection
+                .query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")?;
+            // Create nodes.
+            connection.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+            connection.query("CREATE (:Person {name: 'Bob', age: 30});")?;
+
+            // Execute a simple query.
+            connection.query("MATCH (a:Person) RETURN a.name AS NAME, a.age AS AGE;")?
+        };
+
+        assert_eq!(result.to_string(), "NAME|AGE\nAlice|25\nBob|30\n");
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    #[cfg(feature = "arrow")]
+    fn test_arrow() -> anyhow::Result<()> {
+        use arrow::array::{Int64Array, StringArray};
+        let temp_dir = tempfile::tempdir()?;
+        let path = temp_dir.path().join("test");
+        let db = Database::new(path, SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")?;
+        conn.query("CREATE (:Person {name: 'Alice', age: 25});")?;
+        conn.query("CREATE (:Person {name: 'Bob', age: 30});")?;
+        let mut result = conn.query("MATCH (a:Person) RETURN a.name AS NAME, a.age AS AGE;")?;
+        let mut result = result.iter_arrow(1)?;
+        let rb = result.next().unwrap();
+        assert_eq!(rb.num_rows(), 1);
+        let names: &StringArray = rb
+            .column(0)
+            .as_any()
+            .downcast_ref::<StringArray>()
+            .expect("Type of column 0 is not a StringArray!");
+        assert_eq!(names.value(0), "Alice");
+        let ages: &Int64Array = rb
+            .column(1)
+            .as_any()
+            .downcast_ref::<Int64Array>()
+            .expect("Type of column 1 is not a StringArray!");
+        assert_eq!(ages.value(0), 25);
+        let rb = result.next().unwrap();
+        assert_eq!(rb.num_rows(), 1);
+        assert_eq!(result.next(), None);
+        temp_dir.close()?;
+        Ok(())
+    }
+}
diff --git a/graph-wasm/lbug-0.12.2/src/value.rs b/graph-wasm/lbug-0.12.2/src/value.rs
new file mode 100644
index 0000000000..8aa2f835f9
--- /dev/null
+++ b/graph-wasm/lbug-0.12.2/src/value.rs
@@ -0,0 +1,1448 @@
+use crate::ffi::ffi;
+use crate::ffi::ffi::PhysicalTypeID;
+use crate::logical_type::LogicalType;
+use rust_decimal::prelude::ToPrimitive;
+use std::cmp::Ordering;
+use std::convert::{TryFrom, TryInto};
+use std::fmt;
+
+pub enum ConversionError {
+    /// Lbug's internal date as the number of days since 1970-01-01
+    Date(i32),
+    /// Lbug's internal timestamp as the number of microseconds since 1970-01-01
+    Timestamp(i64),
+    TimestampTz(i64),
+    TimestampNs(i64),
+    TimestampMs(i64),
+    TimestampSec(i64),
+}
+
+impl std::fmt::Display for ConversionError {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        write!(f, "{self:?}")
+    }
+}
+
+impl std::fmt::Debug for ConversionError {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        use ConversionError::{
+            Date, Timestamp, TimestampMs, TimestampNs, TimestampSec, TimestampTz,
+        };
+        match self {
+            Date(days) => write!(f, "Could not convert Lbug date offset of UNIX_EPOCH + {days} days to time::Date"),
+            Timestamp(us) => write!(f, "Could not convert Lbug timestamp offset of UNIX_EPOCH + {us} microseconds to time::OffsetDateTime"),
+            TimestampTz(us) => write!(f, "Could not convert Lbug timestamp_tz offset of UNIX_EPOCH + {us} microseconds to time::OffsetDateTime"),
+            TimestampNs(ns) => write!(f, "Could not convert Lbug timestamp_ns offset of UNIX_EPOCH + {ns} nanoseconds to time::OffsetDateTime"),
+            TimestampMs(ms) => write!(f, "Could not convert Lbug timestamp_ms offset of UNIX_EPOCH + {ms} milliseconds to time::OffsetDateTime"),
+            TimestampSec(sec) => write!(f, "Could not convert Lbug timestamp_sec offset of UNIX_EPOCH + {sec} seconds to time::OffsetDateTime"),
+        }
+    }
+}
+
+impl std::error::Error for ConversionError {
+    fn source(&self) -> Option<&(dyn std::error::Error + 'static)> {
+        None
+    }
+}
+
+/// `NodeVal` represents a node in the graph and stores the nodeID, label and properties of that
+/// node.
+#[derive(Clone, Debug, PartialEq)]
+pub struct NodeVal {
+    id: InternalID,
+    label: String,
+    properties: Vec<(String, Value)>,
+}
+
+impl NodeVal {
+    pub fn new<I: Into<InternalID>, S: Into<String>>(id: I, label: S) -> Self {
+        NodeVal {
+            id: id.into(),
+            label: label.into(),
+            properties: vec![],
+        }
+    }
+
+    pub fn get_node_id(&self) -> &InternalID {
+        &self.id
+    }
+
+    pub fn get_label_name(&self) -> &String {
+        &self.label
+    }
+
+    /// Adds a property with the given key/value pair to the `NodeVal`
+    /// # Arguments
+    /// * `key`: The name of the property
+    /// * `value`: The value of the property
+    pub fn add_property<S: Into<String>, V: Into<Value>>(&mut self, key: S, value: V) {
+        self.properties.push((key.into(), value.into()));
+    }
+
+    /// Returns all properties of the `NodeVal`
+    pub fn get_properties(&self) -> &Vec<(String, Value)> {
+        &self.properties
+    }
+}
+
+fn properties_display(f: &mut fmt::Formatter<'_>, properties: &[(String, Value)]) -> fmt::Result {
+    write!(f, "{{")?;
+    for (index, (name, value)) in properties.iter().enumerate() {
+        write!(f, "{name}:{value}")?;
+        if index < properties.len() - 1 {
+            write!(f, ",")?;
+        }
+    }
+    write!(f, "}}")
+}
+
+impl std::fmt::Display for NodeVal {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        write!(f, "(label:{}, {}, ", self.label, self.id)?;
+        properties_display(f, &self.properties)?;
+        write!(f, ")")
+    }
+}
+
+/// `RelVal` represents a relationship in the graph and stores the relID, src/dst nodes and properties of that
+/// rel
+#[derive(Clone, Debug, PartialEq)]
+pub struct RelVal {
+    src_node: InternalID,
+    dst_node: InternalID,
+    label: String,
+    properties: Vec<(String, Value)>,
+}
+
+impl RelVal {
+    pub fn new<I: Into<InternalID>, S: Into<String>>(src_node: I, dst_node: I, label: S) -> Self {
+        RelVal {
+            src_node: src_node.into(),
+            dst_node: dst_node.into(),
+            label: label.into(),
+            properties: vec![],
+        }
+    }
+
+    pub fn get_src_node(&self) -> &InternalID {
+        &self.src_node
+    }
+    pub fn get_dst_node(&self) -> &InternalID {
+        &self.dst_node
+    }
+
+    pub fn get_label_name(&self) -> &String {
+        &self.label
+    }
+
+    /// Adds a property with the given key/value pair to the `NodeVal`
+    /// # Arguments
+    /// * `key`: The name of the property
+    /// * `value`: The value of the property
+    pub fn add_property(&mut self, key: String, value: Value) {
+        self.properties.push((key, value));
+    }
+
+    /// Returns all properties of the `RelVal`
+    pub fn get_properties(&self) -> &Vec<(String, Value)> {
+        &self.properties
+    }
+}
+
+impl std::fmt::Display for RelVal {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        write!(f, "({})-[label:{}, ", self.src_node, self.label)?;
+        properties_display(f, &self.properties)?;
+        write!(f, "]->({})", self.dst_node)
+    }
+}
+
+/// Stores the `table_id` and `offset` of a node/rel.
+#[derive(Clone, Debug, PartialEq, Eq)]
+pub struct InternalID {
+    pub offset: u64,
+    pub table_id: u64,
+}
+
+impl std::fmt::Display for InternalID {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        write!(f, "{}:{}", self.table_id, self.offset)
+    }
+}
+
+impl PartialOrd for InternalID {
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        Some(self.cmp(other))
+    }
+}
+
+impl Ord for InternalID {
+    fn cmp(&self, other: &Self) -> Ordering {
+        if self.table_id == other.table_id {
+            self.offset.cmp(&other.offset)
+        } else {
+            self.table_id.cmp(&other.table_id)
+        }
+    }
+}
+
+impl From<(u64, u64)> for InternalID {
+    fn from(value: (u64, u64)) -> Self {
+        InternalID {
+            offset: value.0,
+            table_id: value.1,
+        }
+    }
+}
+
+/// Data types supported by Lbug
+///
+/// Also see <https://ladybugdb.com/docusaurus/cypher/data-types/overview.html>
+#[derive(Clone, Debug, PartialEq)]
+pub enum Value {
+    Null(LogicalType),
+    Bool(bool),
+    Int64(i64),
+    Int32(i32),
+    Int16(i16),
+    Int8(i8),
+    UInt64(u64),
+    UInt32(u32),
+    UInt16(u16),
+    UInt8(u8),
+    Int128(i128),
+    Double(f64),
+    Float(f32),
+    /// Stored internally as the number of days since 1970-01-01 as a 32-bit signed integer, which
+    /// allows for a wider range of dates to be stored than can be represented by `time::Date`
+    ///
+    /// <https://ladybugdb.com/docusaurus/cypher/data-types/date.html>
+    Date(time::Date),
+    /// May be signed or unsigned.
+    ///
+    /// Nanosecond precision of `time::Duration` (if available) will not be preserved when passed to
+    /// queries, and results will always have at most microsecond precision.
+    ///
+    /// <https://ladybugdb.com/docusaurus/cypher/data-types/interval.html>
+    Interval(time::Duration),
+    /// Stored internally as the number of microseconds since 1970-01-01
+    /// Nanosecond precision of `SystemTime` (if available) will not be preserved when used.
+    ///
+    /// <https://ladybugdb.com/docusaurus/cypher/data-types/timestamp.html>
+    Timestamp(time::OffsetDateTime),
+    TimestampTz(time::OffsetDateTime),
+    TimestampNs(time::OffsetDateTime),
+    TimestampMs(time::OffsetDateTime),
+    TimestampSec(time::OffsetDateTime),
+    InternalID(InternalID),
+    /// <https://ladybugdb.com/docusaurus/cypher/data-types/string.html>
+    String(String),
+    Blob(Vec<u8>),
+    // TODO: Enforce type of contents
+    // LogicalType is necessary so that we can pass the correct type to the C++ API if the list is empty.
+    /// These must contain elements which are all the given type.
+    /// <https://ladybugdb.com/docusaurus/cypher/data-types/list.html>
+    List(LogicalType, Vec<Value>),
+    /// These must contain elements which are all the same type.
+    /// <https://ladybugdb.com/docusaurus/cypher/data-types/list.html>
+    Array(LogicalType, Vec<Value>),
+    /// <https://ladybugdb.com/docusaurus/cypher/data-types/struct.html>
+    Struct(Vec<(String, Value)>),
+    Node(NodeVal),
+    Rel(RelVal),
+    RecursiveRel {
+        /// Interior nodes in the Sequence of Rels
+        ///
+        /// Does not include the starting or ending Node.
+        nodes: Vec<NodeVal>,
+        /// Sequence of Rels which make up the `RecursiveRel`
+        rels: Vec<RelVal>,
+    },
+    /// <https://ladybugdb.com/docusaurus/cypher/data-types/map>
+    Map((LogicalType, LogicalType), Vec<(Value, Value)>),
+    /// <https://ladybugdb.com/docusaurus/cypher/data-types/union>
+    Union {
+        types: Vec<(String, LogicalType)>,
+        value: Box<Value>,
+    },
+    UUID(uuid::Uuid),
+    Decimal(rust_decimal::Decimal),
+}
+
+fn display_list<T: std::fmt::Display>(f: &mut fmt::Formatter<'_>, list: &[T]) -> fmt::Result {
+    write!(f, "[")?;
+    for (i, value) in list.iter().enumerate() {
+        write!(f, "{value}")?;
+        if i != list.len() - 1 {
+            write!(f, ",")?;
+        }
+    }
+    write!(f, "]")
+}
+
+impl std::fmt::Display for Value {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        match self {
+            Value::Bool(true) => write!(f, "True"),
+            Value::Bool(false) => write!(f, "False"),
+            Value::Int8(x) => write!(f, "{x}"),
+            Value::Int16(x) => write!(f, "{x}"),
+            Value::Int32(x) => write!(f, "{x}"),
+            Value::Int64(x) => write!(f, "{x}"),
+            Value::UInt8(x) => write!(f, "{x}"),
+            Value::UInt16(x) => write!(f, "{x}"),
+            Value::UInt32(x) => write!(f, "{x}"),
+            Value::UInt64(x) => write!(f, "{x}"),
+            Value::Int128(x) => write!(f, "{x}"),
+            Value::Date(x) => write!(f, "{x}"),
+            Value::String(x) => write!(f, "{x}"),
+            Value::Blob(x) => write!(f, "{x:x?}"),
+            Value::Null(_) => write!(f, ""),
+            Value::List(_, x) | Value::Array(_, x) => display_list(f, x),
+            // Note: These don't match lbug's toString, but we probably don't want them to
+            Value::Interval(x) => write!(f, "{x}"),
+            Value::Timestamp(x)
+            | Value::TimestampTz(x)
+            | Value::TimestampNs(x)
+            | Value::TimestampMs(x)
+            | Value::TimestampSec(x) => write!(f, "{x}"),
+            Value::Float(x) => write!(f, "{x}"),
+            Value::Double(x) => write!(f, "{x}"),
+            Value::Struct(x) => {
+                write!(f, "{{")?;
+                for (i, (name, value)) in x.iter().enumerate() {
+                    write!(f, "{name}: {value}")?;
+                    if i != x.len() - 1 {
+                        write!(f, ", ")?;
+                    }
+                }
+                write!(f, "}}")
+            }
+            Value::Map(_, x) => {
+                write!(f, "{{")?;
+                for (i, (name, value)) in x.iter().enumerate() {
+                    write!(f, "{name}={value}")?;
+                    if i != x.len() - 1 {
+                        write!(f, ", ")?;
+                    }
+                }
+                write!(f, "}}")
+            }
+            Value::Node(x) => write!(f, "{x}"),
+            Value::Rel(x) => write!(f, "{x}"),
+            Value::InternalID(x) => write!(f, "{x}"),
+            Value::RecursiveRel { nodes, rels } => {
+                write!(f, "{{")?;
+                write!(f, "_NODES: ")?;
+                display_list(f, nodes)?;
+                write!(f, ", _RELS: ")?;
+                display_list(f, rels)?;
+                write!(f, "}}")
+            }
+            Value::Union { types: _, value } => write!(f, "{value}"),
+            Value::UUID(x) => write!(f, "{x}"),
+            Value::Decimal(value) => write!(f, "{value}"),
+        }
+    }
+}
+
+impl From<&Value> for LogicalType {
+    fn from(value: &Value) -> Self {
+        match value {
+            Value::Bool(_) => LogicalType::Bool,
+            Value::Int8(_) => LogicalType::Int8,
+            Value::Int16(_) => LogicalType::Int16,
+            Value::Int32(_) => LogicalType::Int32,
+            Value::Int64(_) => LogicalType::Int64,
+            Value::UInt8(_) => LogicalType::UInt8,
+            Value::UInt16(_) => LogicalType::UInt16,
+            Value::UInt32(_) => LogicalType::UInt32,
+            Value::UInt64(_) => LogicalType::UInt64,
+            Value::Int128(_) => LogicalType::Int128,
+            Value::Float(_) => LogicalType::Float,
+            Value::Double(_) => LogicalType::Double,
+            Value::Date(_) => LogicalType::Date,
+            Value::Interval(_) => LogicalType::Interval,
+            Value::Timestamp(_) => LogicalType::Timestamp,
+            Value::TimestampTz(_) => LogicalType::TimestampTz,
+            Value::TimestampNs(_) => LogicalType::TimestampNs,
+            Value::TimestampMs(_) => LogicalType::TimestampMs,
+            Value::TimestampSec(_) => LogicalType::TimestampSec,
+            Value::String(_) => LogicalType::String,
+            Value::Blob(_) => LogicalType::Blob,
+            Value::Null(x) => x.clone(),
+            Value::List(x, _) => LogicalType::List {
+                child_type: Box::new(x.clone()),
+            },
+            Value::Array(x, value) => LogicalType::Array {
+                child_type: Box::new(x.clone()),
+                num_elements: value.len() as u64,
+            },
+            Value::Struct(values) => LogicalType::Struct {
+                fields: values
+                    .iter()
+                    .map(|(name, x)| {
+                        let typ: LogicalType = x.into();
+                        (name.clone(), typ)
+                    })
+                    .collect(),
+            },
+            Value::InternalID(_) => LogicalType::InternalID,
+            Value::Node(_) => LogicalType::Node,
+            Value::Rel(_) => LogicalType::Rel,
+            Value::RecursiveRel { .. } => LogicalType::RecursiveRel,
+            Value::Map((key_type, value_type), _) => LogicalType::Map {
+                key_type: Box::new(key_type.clone()),
+                value_type: Box::new(value_type.clone()),
+            },
+            Value::Union { types, value: _ } => LogicalType::Union {
+                types: types.clone(),
+            },
+            Value::UUID(_) => LogicalType::UUID,
+            Value::Decimal(value) => LogicalType::Decimal {
+                scale: value.scale(),
+                precision: value.mantissa().checked_ilog10().unwrap_or(0) + 1,
+            },
+        }
+    }
+}
+
+fn get_date_from_unix_days(days: i32) -> Result<time::Date, ConversionError> {
+    time::Date::from_calendar_date(1970, time::Month::January, 1)
+        .unwrap()
+        .checked_add(time::Duration::days(i64::from(days)))
+        .ok_or(ConversionError::Date(days))
+}
+
+fn get_timestamp_from_unix_micros(us: i64) -> Result<time::OffsetDateTime, ConversionError> {
+    time::OffsetDateTime::UNIX_EPOCH
+        .checked_add(time::Duration::microseconds(us))
+        .ok_or(ConversionError::Timestamp(us))
+}
+
+impl TryFrom<&ffi::Value> for Value {
+    type Error = ConversionError;
+
+    fn try_from(value: &ffi::Value) -> Result<Self, Self::Error> {
+        use ffi::LogicalTypeID;
+        #[allow(clippy::cast_possible_wrap)]
+        fn get_i128(value: &ffi::Value) -> i128 {
+            let int128_val = ffi::value_get_int128_t(value);
+            let low = int128_val[1];
+            let high = int128_val[0] as i64;
+            (i128::from(low)) + ((i128::from(high)) << 64)
+        }
+
+        if value.isNull() {
+            return Ok(Value::Null(value.into()));
+        }
+
+        match ffi::value_get_data_type_id(value) {
+            LogicalTypeID::ANY => unimplemented!(),
+            LogicalTypeID::BOOL => Ok(Value::Bool(value.get_value_bool())),
+            LogicalTypeID::INT8 => Ok(Value::Int8(value.get_value_i8())),
+            LogicalTypeID::INT16 => Ok(Value::Int16(value.get_value_i16())),
+            LogicalTypeID::INT32 => Ok(Value::Int32(value.get_value_i32())),
+            LogicalTypeID::INT64 => Ok(Value::Int64(value.get_value_i64())),
+            LogicalTypeID::UINT8 => Ok(Value::UInt8(value.get_value_u8())),
+            LogicalTypeID::UINT16 => Ok(Value::UInt16(value.get_value_u16())),
+            LogicalTypeID::UINT32 => Ok(Value::UInt32(value.get_value_u32())),
+            LogicalTypeID::UINT64 => Ok(Value::UInt64(value.get_value_u64())),
+            LogicalTypeID::INT128 => Ok(Value::Int128(get_i128(value))),
+            #[allow(clippy::cast_sign_loss)]
+            LogicalTypeID::UUID => Ok(Value::UUID(uuid::Uuid::from_u128(
+                // values are stored as i128 and the first bit flipped so that they order as if
+                // they are u128
+                get_i128(value) as u128 ^ (1 << 127),
+            ))),
+            LogicalTypeID::FLOAT => Ok(Value::Float(value.get_value_float())),
+            LogicalTypeID::DOUBLE => Ok(Value::Double(value.get_value_double())),
+            LogicalTypeID::STRING => Ok(Value::String(ffi::value_get_string(value).to_string())),
+            LogicalTypeID::BLOB => Ok(Value::Blob(
+                ffi::value_get_string(value).as_bytes().to_vec(),
+            )),
+            LogicalTypeID::INTERVAL => Ok(Value::Interval(time::Duration::new(
+                ffi::value_get_interval_secs(value),
+                // Duration is constructed using nanoseconds, but lbug stores microseconds
+                ffi::value_get_interval_micros(value) * 1000,
+            ))),
+            LogicalTypeID::DATE => Ok(Value::Date(get_date_from_unix_days(
+                ffi::value_get_date_days(value),
+            )?)),
+            LogicalTypeID::TIMESTAMP => Ok(Value::Timestamp(get_timestamp_from_unix_micros(
+                ffi::value_get_timestamp_micros(value),
+            )?)),
+            LogicalTypeID::TIMESTAMP_TZ => {
+                let us = ffi::value_get_timestamp_tz(value);
+                time::OffsetDateTime::UNIX_EPOCH
+                    .checked_add(time::Duration::microseconds(us))
+                    .map(Value::TimestampTz)
+                    .ok_or(ConversionError::TimestampTz(us))
+            }
+            LogicalTypeID::TIMESTAMP_NS => {
+                let ns = ffi::value_get_timestamp_ns(value);
+                time::OffsetDateTime::UNIX_EPOCH
+                    .checked_add(time::Duration::nanoseconds(ns))
+                    .map(Value::TimestampNs)
+                    .ok_or(ConversionError::TimestampNs(ns))
+            }
+            LogicalTypeID::TIMESTAMP_MS => {
+                let ms = ffi::value_get_timestamp_ms(value);
+                time::OffsetDateTime::UNIX_EPOCH
+                    .checked_add(time::Duration::milliseconds(ms))
+                    .map(Value::TimestampMs)
+                    .ok_or(ConversionError::TimestampMs(ms))
+            }
+            LogicalTypeID::TIMESTAMP_SEC => {
+                let sec = ffi::value_get_timestamp_sec(value);
+                time::OffsetDateTime::UNIX_EPOCH
+                    .checked_add(time::Duration::seconds(sec))
+                    .map(Value::TimestampSec)
+                    .ok_or(ConversionError::TimestampSec(sec))
+            }
+            LogicalTypeID::LIST => {
+                let mut result = vec![];
+                for index in 0..ffi::value_get_children_size(value) {
+                    let value: Value = ffi::value_get_child(value, index).try_into()?;
+                    result.push(value);
+                }
+                if let LogicalType::List { child_type } = value.into() {
+                    Ok(Value::List(*child_type, result))
+                } else {
+                    unreachable!()
+                }
+            }
+            LogicalTypeID::ARRAY => {
+                let mut result = vec![];
+                for index in 0..ffi::value_get_children_size(value) {
+                    let value: Value = ffi::value_get_child(value, index).try_into()?;
+                    result.push(value);
+                }
+                if let LogicalType::Array { child_type, .. } = value.into() {
+                    Ok(Value::Array(*child_type, result))
+                } else {
+                    unreachable!()
+                }
+            }
+            LogicalTypeID::STRUCT => {
+                // Data is a list of field values in the value itself (same as list),
+                // with the field names stored in the DataType
+                let field_names =
+                    ffi::logical_type_get_struct_field_names(ffi::value_get_data_type(value));
+                let mut result = vec![];
+                for (name, index) in field_names
+                    .into_iter()
+                    .zip(0..ffi::value_get_children_size(value))
+                {
+                    let value: Value = ffi::value_get_child(value, index).try_into()?;
+                    result.push((name, value));
+                }
+                Ok(Value::Struct(result))
+            }
+            LogicalTypeID::MAP => {
+                let mut result = vec![];
+                for index in 0..ffi::value_get_children_size(value) {
+                    let pair = ffi::value_get_child(value, index);
+                    result.push((
+                        ffi::value_get_child(pair, 0).try_into()?,
+                        ffi::value_get_child(pair, 1).try_into()?,
+                    ));
+                }
+                if let LogicalType::Map {
+                    key_type,
+                    value_type,
+                } = value.into()
+                {
+                    Ok(Value::Map((*key_type, *value_type), result))
+                } else {
+                    unreachable!()
+                }
+            }
+            LogicalTypeID::NODE => {
+                let id = ffi::node_value_get_node_id(value);
+                if id.isNull() {
+                    return Ok(Value::Null(value.into()));
+                }
+                let id = ffi::value_get_internal_id(id);
+
+                let id = InternalID {
+                    offset: id[0],
+                    table_id: id[1],
+                };
+                let label = ffi::node_value_get_label_name(value);
+                let mut node_val = NodeVal::new(id, label);
+                for i in 0..ffi::node_value_get_num_properties(value) {
+                    node_val.add_property(
+                        ffi::node_value_get_property_name(value, i),
+                        TryInto::<Value>::try_into(ffi::node_value_get_property_value(value, i))?,
+                    );
+                }
+                Ok(Value::Node(node_val))
+            }
+            LogicalTypeID::REL => {
+                let src_node = ffi::rel_value_get_src_id(value);
+                if (src_node).isNull() {
+                    return Ok(Value::Null(value.into()));
+                }
+                let src_node = ffi::value_get_internal_id(src_node);
+
+                let dst_node = ffi::rel_value_get_dst_id(value);
+                let src_node = InternalID {
+                    offset: src_node[0],
+                    table_id: src_node[1],
+                };
+                let dst_node = InternalID {
+                    offset: dst_node[0],
+                    table_id: dst_node[1],
+                };
+                let label = ffi::rel_value_get_label_name(value);
+                let mut rel_val = RelVal::new(src_node, dst_node, label);
+                for i in 0..ffi::rel_value_get_num_properties(value) {
+                    rel_val.add_property(
+                        ffi::rel_value_get_property_name(value, i),
+                        ffi::rel_value_get_property_value(value, i).try_into()?,
+                    );
+                }
+                Ok(Value::Rel(rel_val))
+            }
+            LogicalTypeID::INTERNAL_ID => {
+                let internal_id = ffi::value_get_internal_id(value);
+                Ok(Value::InternalID(InternalID {
+                    offset: internal_id[0],
+                    table_id: internal_id[1],
+                }))
+            }
+            LogicalTypeID::RECURSIVE_REL => {
+                let nodes: Value = ffi::recursive_rel_get_nodes(value).try_into()?;
+                let rels: Value = ffi::recursive_rel_get_rels(value).try_into()?;
+                let nodes = if let Value::List(LogicalType::Node, nodes) = nodes {
+                    nodes.into_iter().map(|x| {
+                        if let Value::Node(x) = x {
+                            x
+                        } else {
+                            unreachable!()
+                        }
+                    })
+                } else {
+                    panic!("Unexpected value in RecursiveRel's rels: {rels}")
+                };
+                let rels = if let Value::List(LogicalType::Rel, rels) = rels {
+                    rels.into_iter().map(|x| {
+                        if let Value::Rel(x) = x {
+                            x
+                        } else {
+                            unreachable!()
+                        }
+                    })
+                } else {
+                    panic!("Unexpected value in RecursiveRel's rels: {rels}")
+                };
+
+                Ok(Value::RecursiveRel {
+                    nodes: nodes.collect(),
+                    rels: rels.collect(),
+                })
+            }
+            LogicalTypeID::UNION => {
+                let LogicalType::Union { types } = ffi::value_get_data_type(value).into() else {
+                    unreachable!()
+                };
+                debug_assert!(ffi::value_get_children_size(value) == 1);
+                let value: Value = ffi::value_get_child(value, 0).try_into()?;
+                Ok(Value::Union {
+                    types,
+                    value: Box::new(value),
+                })
+            }
+            LogicalTypeID::DECIMAL => {
+                let logical_type: LogicalType = ffi::value_get_data_type(value).into();
+                if let LogicalType::Decimal {
+                    scale,
+                    precision: _,
+                } = logical_type
+                {
+                    let decimal_value: i128 = match ffi::value_get_physical_type(value) {
+                        PhysicalTypeID::INT128 => get_i128(value),
+                        PhysicalTypeID::INT64 => i128::from(value.get_value_i64()),
+                        PhysicalTypeID::INT32 => i128::from(value.get_value_i32()),
+                        PhysicalTypeID::INT16 => i128::from(value.get_value_i16()),
+                        PhysicalTypeID::INT8 => i128::from(value.get_value_i8()),
+                        _ => unreachable!(),
+                    };
+                    Ok(Value::Decimal(rust_decimal::Decimal::from_i128_with_scale(
+                        decimal_value,
+                        scale,
+                    )))
+                } else {
+                    unreachable!()
+                }
+            }
+            // TODO(bmwinger): Better error message for types which are unsupported
+            x => panic!("Unsupported type {x:?}"),
+        }
+    }
+}
+
+impl TryInto<cxx::UniquePtr<ffi::Value>> for Value {
+    // Errors should occur if:
+    // - types are heterogeneous in lists
+    type Error = crate::error::Error;
+
+    fn try_into(self) -> Result<cxx::UniquePtr<ffi::Value>, Self::Error> {
+        #[allow(clippy::cast_sign_loss, clippy::cast_possible_truncation)]
+        fn get_high_low(value: i128) -> (i64, u64) {
+            ((value >> 64) as i64, value as u64)
+        }
+
+        fn date_to_lbug_date_t(value: time::Date) -> i32 {
+            // Convert to days since 1970-01-01
+            (value - time::Date::from_ordinal_date(1970, 1).unwrap())
+                .whole_days()
+                .to_i32()
+                .expect("lbug_date i64->i32 overflow")
+        }
+
+        fn datetime_to_timestamp_t(value: time::OffsetDateTime) -> i64 {
+            // Convert to microseconds since 1970-01-01
+            (value.unix_timestamp_nanos() / 1000)
+                .to_i64()
+                .expect("timestamp i128->i64 overflow")
+        }
+
+        fn get_interval_t(value: time::Duration) -> (i32, i32, i64) {
+            use time::Duration;
+            let mut interval = value;
+            let months = interval.whole_days() / 30;
+            interval -= Duration::days(months * 30);
+            let days = interval.whole_days();
+            interval -= Duration::days(days);
+            let months = months.to_i32().expect("months i64->i32 overflow");
+            let days = days.to_i32().expect("days i64->i32 overflow");
+            let micros = interval
+                .whole_microseconds()
+                .to_i64()
+                .expect("micros i128->i64 overflow");
+            (months, days, micros)
+        }
+
+        match self {
+            Value::Null(typ) => Ok(ffi::create_value_null((&typ).into())),
+            Value::Bool(value) => Ok(ffi::create_value_bool(value)),
+            Value::Int8(value) => Ok(ffi::create_value_i8(value)),
+            Value::Int16(value) => Ok(ffi::create_value_i16(value)),
+            Value::Int32(value) => Ok(ffi::create_value_i32(value)),
+            Value::Int64(value) => Ok(ffi::create_value_i64(value)),
+            Value::UInt8(value) => Ok(ffi::create_value_u8(value)),
+            Value::UInt16(value) => Ok(ffi::create_value_u16(value)),
+            Value::UInt32(value) => Ok(ffi::create_value_u32(value)),
+            Value::UInt64(value) => Ok(ffi::create_value_u64(value)),
+            Value::Int128(value) => {
+                let (high, low) = get_high_low(value);
+                Ok(ffi::create_value_int128_t(high, low))
+            }
+            #[allow(clippy::cast_possible_wrap)]
+            Value::UUID(value) => {
+                // values are stored as i128 and the first bit flipped so that they order as if
+                // they are u128
+                let value = value.as_u128() as i128;
+                let (high, low) = get_high_low(value ^ (1 << 127));
+                Ok(ffi::create_value_uuid_t(high, low))
+            }
+            Value::Float(value) => Ok(ffi::create_value_float(value)),
+            Value::Double(value) => Ok(ffi::create_value_double(value)),
+            Value::String(value) => Ok(ffi::create_value_string(
+                ffi::LogicalTypeID::STRING,
+                value.as_bytes(),
+            )),
+            Value::Blob(value) => Ok(ffi::create_value_string(ffi::LogicalTypeID::BLOB, &value)),
+            Value::Timestamp(value) => {
+                Ok(ffi::create_value_timestamp(datetime_to_timestamp_t(value)))
+            }
+            Value::TimestampTz(value) => Ok(ffi::create_value_timestamp_tz(
+                // Convert to microseconds since 1970-01-01
+                (value.unix_timestamp_nanos() / 1000)
+                    .to_i64()
+                    .expect("TimestampTz i128->i64 overflow"),
+            )),
+            Value::TimestampNs(value) => Ok(ffi::create_value_timestamp_ns(
+                value
+                    .unix_timestamp_nanos()
+                    .to_i64()
+                    .expect("TimestampMs i128->i64 overflow"),
+            )),
+            Value::TimestampMs(value) => Ok(ffi::create_value_timestamp_ms(
+                (value.unix_timestamp_nanos() / 1_000_000)
+                    .to_i64()
+                    .expect("TimestampMs i128->i64 overflow"),
+            )),
+            Value::TimestampSec(value) => Ok(ffi::create_value_timestamp_sec(
+                (value.unix_timestamp_nanos() / 1_000_000_000)
+                    .to_i64()
+                    .expect("TimestampSec i128->i64 overflow"),
+            )),
+            Value::Date(value) => Ok(ffi::create_value_date(date_to_lbug_date_t(value))),
+            Value::Interval(value) => {
+                let (months, days, micros) = get_interval_t(value);
+                Ok(ffi::create_value_interval(months, days, micros))
+            }
+            Value::List(typ, value) => {
+                let mut builder = ffi::create_list();
+                for elem in value {
+                    builder.pin_mut().insert(elem.try_into()?);
+                }
+                Ok(ffi::get_list_value(
+                    (&LogicalType::List {
+                        child_type: Box::new(typ),
+                    })
+                        .into(),
+                    builder,
+                ))
+            }
+            Value::Map((key_type, value_type), values) => {
+                let mut builder = ffi::create_list();
+                let list_type = LogicalType::Struct {
+                    fields: vec![
+                        ("KEY".to_string(), key_type.clone()),
+                        ("VALUE".to_string(), value_type.clone()),
+                    ],
+                };
+                for (key, value) in values {
+                    let mut pair = ffi::create_list();
+                    pair.pin_mut().insert(key.try_into()?);
+                    pair.pin_mut().insert(value.try_into()?);
+                    let pair_value = ffi::get_list_value((&list_type).into(), pair);
+                    builder.pin_mut().insert(pair_value);
+                }
+                Ok(ffi::get_list_value(
+                    (&LogicalType::Map {
+                        key_type: Box::new(key_type),
+                        value_type: Box::new(value_type),
+                    })
+                        .into(),
+                    builder,
+                ))
+            }
+            Value::Array(typ, value) => {
+                let mut builder = ffi::create_list();
+                let len = value.len();
+                for elem in value {
+                    builder.pin_mut().insert(elem.try_into()?);
+                }
+                Ok(ffi::get_list_value(
+                    (&LogicalType::Array {
+                        child_type: Box::new(typ),
+                        num_elements: len as u64,
+                    })
+                        .into(),
+                    builder,
+                ))
+            }
+            Value::Struct(value) => {
+                let typ: LogicalType = LogicalType::Struct {
+                    fields: value
+                        .iter()
+                        .map(|(name, value)| (name.clone(), Into::<LogicalType>::into(value)))
+                        .collect(),
+                };
+
+                let mut builder = ffi::create_list();
+                for (_, elem) in value {
+                    builder.pin_mut().insert(elem.try_into()?);
+                }
+
+                Ok(ffi::get_list_value((&typ).into(), builder))
+            }
+            Value::InternalID(value) => {
+                Ok(ffi::create_value_internal_id(value.offset, value.table_id))
+            }
+            Value::Node(_) => Err(crate::Error::ReadOnlyType(LogicalType::Node)),
+            Value::Rel(_) => Err(crate::Error::ReadOnlyType(LogicalType::Rel)),
+            Value::RecursiveRel { .. } => {
+                Err(crate::Error::ReadOnlyType(LogicalType::RecursiveRel))
+            }
+            Value::Union { types, value } => {
+                let mut builder = ffi::create_list();
+                builder.pin_mut().insert((*value).try_into()?);
+
+                Ok(ffi::get_list_value(
+                    (&LogicalType::Union { types }).into(),
+                    builder,
+                ))
+            }
+            Value::Decimal(decimal_value) => {
+                let (high, low) = get_high_low(decimal_value.mantissa());
+                if let LogicalType::Decimal { scale, precision } = (&self).into() {
+                    Ok(ffi::create_value_decimal(high, low, scale, precision))
+                } else {
+                    unreachable!()
+                }
+            }
+        }
+    }
+}
+
+impl From<i8> for Value {
+    fn from(item: i8) -> Self {
+        Value::Int8(item)
+    }
+}
+
+impl From<i16> for Value {
+    fn from(item: i16) -> Self {
+        Value::Int16(item)
+    }
+}
+
+impl From<i32> for Value {
+    fn from(item: i32) -> Self {
+        Value::Int32(item)
+    }
+}
+
+impl From<i64> for Value {
+    fn from(item: i64) -> Self {
+        Value::Int64(item)
+    }
+}
+
+impl From<u8> for Value {
+    fn from(item: u8) -> Self {
+        Value::UInt8(item)
+    }
+}
+
+impl From<u16> for Value {
+    fn from(item: u16) -> Self {
+        Value::UInt16(item)
+    }
+}
+
+impl From<u32> for Value {
+    fn from(item: u32) -> Self {
+        Value::UInt32(item)
+    }
+}
+
+impl From<u64> for Value {
+    fn from(item: u64) -> Self {
+        Value::UInt64(item)
+    }
+}
+
+impl From<i128> for Value {
+    fn from(item: i128) -> Self {
+        Value::Int128(item)
+    }
+}
+
+impl From<f32> for Value {
+    fn from(item: f32) -> Self {
+        Value::Float(item)
+    }
+}
+
+impl From<f64> for Value {
+    fn from(item: f64) -> Self {
+        Value::Double(item)
+    }
+}
+
+impl From<String> for Value {
+    fn from(item: String) -> Self {
+        Value::String(item)
+    }
+}
+
+impl From<&str> for Value {
+    fn from(item: &str) -> Self {
+        Value::String(item.to_string())
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use crate::database::SYSTEM_CONFIG_FOR_TESTS;
+    use crate::ffi::ffi;
+    use crate::{Connection, Database, InternalID, LogicalType, NodeVal, RelVal, Value};
+    use anyhow::Result;
+    use rust_decimal_macros::dec;
+    use std::collections::HashSet;
+    use std::convert::TryInto;
+    use std::iter::FromIterator;
+    use time::macros::{date, datetime};
+    use uuid::uuid;
+
+    macro_rules! type_tests {
+        ($($name:ident: $value:expr,)*) => {
+        $(
+            #[test]
+            /// Tests that the values are correctly converted into `lbug::common::Value` and back
+            fn $name() -> Result<()> {
+                let rust_type: LogicalType = $value;
+                let typ: cxx::UniquePtr<ffi::LogicalType> = (&rust_type).try_into()?;
+                let new_rust_type: LogicalType = typ.as_ref().unwrap().try_into()?;
+                assert_eq!(new_rust_type, rust_type);
+                Ok(())
+            }
+        )*
+        }
+    }
+
+    macro_rules! value_tests {
+        ($($name:ident: $value:expr,)*) => {
+        $(
+            #[test]
+            /// Tests that the values are correctly converted into `lbug::common::Value` and back
+            fn $name() -> Result<()> {
+                let rust_value: Value = $value;
+                let value: cxx::UniquePtr<ffi::Value> = rust_value.clone().try_into()?;
+                let new_rust_value: Value = value.as_ref().unwrap().try_into()?;
+                assert_eq!(new_rust_value, rust_value);
+                Ok(())
+            }
+        )*
+        }
+    }
+
+    macro_rules! display_tests {
+        ($($name:ident: $value:expr,)*) => {
+        $(
+            #[test]
+            /// Tests that the values display the same via the rust API as via the C++ API
+            fn $name() -> Result<()> {
+                let rust_value: Value = $value;
+                let value: cxx::UniquePtr<ffi::Value> = rust_value.clone().try_into()?;
+                assert_eq!(ffi::value_to_string(value.as_ref().unwrap()), format!("{rust_value}"));
+                Ok(())
+            }
+        )*
+        }
+    }
+
+    macro_rules! database_tests {
+        ($($name:ident: $value:expr, $decl:expr,)*) => {
+        $(
+            #[test]
+            /// Tests that passing the values through the database returns what we put in
+            fn $name() -> Result<()> {
+                let temp_dir = tempfile::tempdir()?;
+                let db = Database::new(temp_dir.path().join("testdb"), SYSTEM_CONFIG_FOR_TESTS)?;
+                let conn = Connection::new(&db)?;
+                conn.query(&format!(
+                    "CREATE NODE TABLE Person(name STRING, item {}, PRIMARY KEY(name));",
+                    $decl,
+                ))?;
+
+                let mut add_person =
+                    conn.prepare("CREATE (:Person {name: $name, item: $item});")?;
+                conn.execute(
+                    &mut add_person,
+                    vec![("name", "Bob".into()), ("item", $value)],
+                )?;
+                let result = conn
+                    .query("MATCH (a:Person) WHERE a.name = \"Bob\" RETURN a.item;")?
+                    .next()
+                    .unwrap();
+                // TODO: Test equivalence to value constructed inside a a query
+                assert_eq!(result[0], $value);
+                temp_dir.close()?;
+                Ok(())
+            }
+        )*
+        }
+    }
+
+    type_tests! {
+        convert_list_type: LogicalType::List { child_type: Box::new(LogicalType::String) },
+        convert_array_type: LogicalType::Array { child_type: Box::new(LogicalType::Int64), num_elements: 3 },
+        convert_int8_type: LogicalType::Int8,
+        convert_int16_type: LogicalType::Int16,
+        convert_int32_type: LogicalType::Int32,
+        convert_int64_type: LogicalType::Int64,
+        convert_uint8_type: LogicalType::UInt8,
+        convert_uint16_type: LogicalType::UInt16,
+        convert_uint32_type: LogicalType::UInt32,
+        convert_uint64_type: LogicalType::UInt64,
+        convert_int128_type: LogicalType::Int128,
+        convert_uuid_type: LogicalType::UUID,
+        convert_float_type: LogicalType::Float,
+        convert_double_type: LogicalType::Double,
+        convert_timestamp_type: LogicalType::Timestamp,
+        convert_timestamp_tz_type: LogicalType::TimestampTz,
+        convert_timestamp_ns_type: LogicalType::TimestampNs,
+        convert_timestamp_ms_type: LogicalType::TimestampMs,
+        convert_timestamp_sec_type: LogicalType::TimestampSec,
+        convert_date_type: LogicalType::Date,
+        convert_interval_type: LogicalType::Interval,
+        convert_string_type: LogicalType::String,
+        convert_blob_type: LogicalType::Blob,
+        convert_bool_type: LogicalType::Bool,
+        convert_struct_type: LogicalType::Struct { fields: vec![("NAME".to_string(), LogicalType::String)]},
+        convert_node_type: LogicalType::Node,
+        convert_internal_id_type: LogicalType::InternalID,
+        convert_rel_type: LogicalType::Rel,
+        convert_recursive_rel_type: LogicalType::RecursiveRel,
+        convert_map_type: LogicalType::Map { key_type: Box::new(LogicalType::Interval), value_type: Box::new(LogicalType::Rel) },
+        convert_union_type: LogicalType::Union { types: vec![("Num".to_string(), LogicalType::Int8), ("duration".to_string(), LogicalType::Interval), ("string".to_string(), LogicalType::String)] },
+        convert_decimal_type: LogicalType::Decimal { scale: 3, precision: 9 },
+    }
+
+    value_tests! {
+        convert_list: Value::List(LogicalType::String, vec!["Alice".into(), "Bob".into()]),
+        convert_list_empty: Value::List(LogicalType::String, vec![]),
+        convert_array: Value::Array(LogicalType::String, vec!["Alice".into(), "Bob".into()]),
+        convert_int8: Value::Int8(0),
+        convert_int16: Value::Int16(1),
+        convert_int32: Value::Int32(2),
+        convert_int64: Value::Int64(3),
+        convert_uint8: Value::UInt8(0),
+        convert_uint16: Value::UInt16(1),
+        convert_uint32: Value::UInt32(2),
+        convert_uint64: Value::UInt64(3),
+        convert_int128: Value::Int128(1),
+        convert_int128_negative: Value::Int128(-1),
+        convert_int128_large: Value::Int128(184467440737095516158),
+        convert_int128_large_negative: Value::Int128(-184467440737095516158),
+        convert_uuid: Value::UUID(uuid!("00000000-0000-0000-0000-ffff00000000")),
+        convert_uuid2: Value::UUID(uuid!("a0eebc99-9c0b-4ef8-bb6d-6bb9bd380a11")),
+        convert_float: Value::Float(4.),
+        convert_double: Value::Double(5.),
+        convert_timestamp: Value::Timestamp(datetime!(2023-06-13 11:25:30 UTC)),
+        convert_timestamp_tz: Value::TimestampTz(datetime!(2023-06-13 11:25:30 UTC)),
+        convert_timestamp_ns: Value::TimestampNs(datetime!(2023-06-13 11:25:30.12345 UTC)),
+        convert_timestamp_ms: Value::TimestampMs(datetime!(2023-06-13 11:25:30.123 UTC)),
+        convert_timestamp_sec: Value::TimestampSec(datetime!(2023-06-13 11:25:30 UTC)),
+        convert_date: Value::Date(date!(2023-06-13)),
+        convert_interval: Value::Interval(time::Duration::weeks(10)),
+        convert_string: Value::String("Hello World".to_string()),
+        convert_blob: Value::Blob("Hello World".into()),
+        convert_bool: Value::Bool(false),
+        convert_null: Value::Null(LogicalType::List {
+            child_type: Box::new(LogicalType::Array { child_type: Box::new(LogicalType::Int16), num_elements: 3 })
+        }),
+        convert_struct: Value::Struct(vec![("NAME".to_string(), "Alice".into()), ("AGE".to_string(), 25.into())]),
+        convert_internal_id: Value::InternalID(InternalID { table_id: 0, offset: 0 }),
+        convert_map: Value::Map((LogicalType::String, LogicalType::Int64), vec![(Value::String("key".to_string()), Value::Int64(24))]),
+        convert_union: Value::Union {
+            types: vec![("Num".to_string(), LogicalType::Int8), ("duration".to_string(), LogicalType::Interval)],
+            value: Box::new(Value::Int8(-127))
+        },
+        convert_decimal16: Value::Decimal(dec!(12.34)),
+        convert_decimal32: Value::Decimal(dec!(12.3456789)),
+        convert_decimal64: Value::Decimal(dec!(12.34567890)),
+        convert_decimal128: Value::Decimal(dec!(12.34567890)),
+    }
+
+    display_tests! {
+        display_list: Value::List(LogicalType::String, vec!["Alice".into(), "Bob".into()]),
+        display_list_empty: Value::List(LogicalType::String, vec![]),
+        display_array: Value::Array(LogicalType::String, vec!["Alice".into(), "Bob".into()]),
+        display_int8: Value::Int8(0),
+        display_int16: Value::Int16(1),
+        display_int32: Value::Int32(2),
+        display_int64: Value::Int64(3),
+        display_uint8: Value::UInt8(0),
+        display_uint16: Value::UInt16(1),
+        display_uint32: Value::UInt32(2),
+        display_uint64: Value::UInt64(3),
+        // Float, double, interval and timestamp have display differences which we probably don't want to
+        // reconcile
+        display_date: Value::Date(date!(2023-06-13)),
+        // blob may contain non-utf8 data, so we display it as an array rather than a string
+        // The C++ API escapes data in the blob as hex
+        display_string: Value::String("Hello World".to_string()),
+        display_bool: Value::Bool(false),
+        display_null: Value::Null(LogicalType::List {
+            child_type: Box::new(LogicalType::Array { child_type: Box::new(LogicalType::Int16), num_elements: 3 })
+        }),
+        display_struct: Value::Struct(vec![("NAME".to_string(), "Alice".into()), ("AGE".to_string(), 25.into())]),
+        display_internal_id: Value::InternalID(InternalID { table_id: 0, offset: 0 }),
+        // Node and Rel Cannot be easily created on the C++ side
+        display_map: Value::Map((LogicalType::String, LogicalType::Int64), vec![(Value::String("key".to_string()), Value::Int64(24))]),
+        display_union: Value::Union {
+            types: vec![("Num".to_string(), LogicalType::Int8), ("duration".to_string(), LogicalType::Interval)],
+            value: Box::new(Value::Int8(-127))
+        },
+        display_uuid: Value::UUID(uuid!("00000000-0000-0000-0000-ffff00000000")),
+        display_uuid2: Value::UUID(uuid!("a0eebc99-9c0b-4ef8-bb6d-6bb9bd380a11")),
+        display_uuid3: Value::UUID(uuid!("a1a2a3a4b1b2c1c2d1d2d3d4d5d6d7d8")),
+        display_decimal16: Value::Decimal(dec!(12.34)),
+        display_decimal32: Value::Decimal(dec!(12.3456789)),
+        display_decimal64: Value::Decimal(dec!(12.34567890)),
+        display_decimal128: Value::Decimal(dec!(12.34567890)),
+    }
+
+    database_tests! {
+        // Passing these values as arguments is not yet implemented in lbug:
+        // db_union: Value::Union {
+        //    types: vec![("Num".to_string(), LogicalType::Int8), ("duration".to_string(), LogicalType::Interval)],
+        //    value: Box::new(Value::Int8(-127))
+        // }, "UNION(Num INT8, duration INTERVAL)",
+        db_list_string: Value::List(LogicalType::String, vec!["Alice".into(), "Bob".into()]), "STRING[]",
+        db_list_int: Value::List(LogicalType::Int64, vec![0i64.into(), 1i64.into(), 2i64.into()]), "INT64[]",
+        db_map: Value::Map((LogicalType::String, LogicalType::Int64), vec![(Value::String("key".to_string()), Value::Int64(24))]), "MAP(STRING,INT64)",
+        db_array: Value::Array(LogicalType::Int64, vec![1i64.into(), 2i64.into(), 3i64.into()]), "INT64[3]",
+        db_struct:
+           Value::Struct(vec![("item".to_string(), "Knife".into()), ("count".to_string(), 1.into())]),
+           "STRUCT(item STRING, count INT32)",
+        db_null_string: Value::Null(LogicalType::String), "STRING",
+        db_null_int: Value::Null(LogicalType::Int64), "INT64",
+        db_null_list: Value::Null(LogicalType::List {
+           child_type: Box::new(LogicalType::Array { child_type: Box::new(LogicalType::Int16), num_elements: 3 })
+        }), "INT16[3][]",
+        db_int8: Value::Int8(0), "INT8",
+        db_int16: Value::Int16(1), "INT16",
+        db_int32: Value::Int32(2), "INT32",
+        db_int64: Value::Int64(3), "INT64",
+        db_uint8: Value::UInt8(0), "UINT8",
+        db_uint16: Value::UInt16(1), "UINT16",
+        db_uint32: Value::UInt32(2), "UINT32",
+        db_uint64: Value::UInt64(3), "UINT64",
+        db_int128: Value::Int128(4), "INT128",
+        db_float: Value::Float(4.), "FLOAT",
+        db_double: Value::Double(5.), "DOUBLE",
+        db_timestamp: Value::Timestamp(datetime!(2023-06-13 11:25:30 UTC)), "TIMESTAMP",
+        db_timestamp_tz: Value::TimestampTz(datetime!(2023-06-13 11:25:30.12345 UTC)), "TIMESTAMP_TZ",
+        db_timestamp_ns: Value::TimestampNs(datetime!(2023-06-13 11:25:30.12345 UTC)), "TIMESTAMP_NS",
+        db_timestamp_ms: Value::TimestampMs(datetime!(2023-06-13 11:25:30.123 UTC)), "TIMESTAMP_MS",
+        db_timestamp_sec: Value::TimestampSec(datetime!(2023-06-13 11:25:30 UTC)), "TIMESTAMP_SEC",
+        db_date: Value::Date(date!(2023-06-13)), "DATE",
+        db_interval: Value::Interval(time::Duration::weeks(200)), "INTERVAL",
+        db_string: Value::String("Hello World".to_string()), "STRING",
+        db_blob: Value::Blob("Hello World".into()), "BLOB",
+        db_bool: Value::Bool(true), "BOOLEAN",
+        db_uuid: Value::UUID(uuid!("00000000-0000-0000-0000-ffff00000000")), "UUID",
+        db_uuid2: Value::UUID(uuid!("8f914bce-df4e-4244-9cd4-ea96bf0c58d4")), "UUID",
+        db_decimal16: Value::Decimal(dec!(12.34)), "DECIMAL(4, 2)",
+        db_decimal32: Value::Decimal(dec!(12.3456789)), "DECIMAL(9, 7)",
+        db_decimal64: Value::Decimal(dec!(12.34567890)), "DECIMAL(18, 8)",
+        db_decimal128: Value::Decimal(dec!(12.34567890)), "DECIMAL(38, 8)",
+    }
+
+    #[test]
+    /// Tests that the list value is correctly constructed
+    fn test_list_get() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("testdb"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        for result in conn.query("RETURN [\"Alice\", \"Bob\"] AS l;")? {
+            assert_eq!(result.len(), 1);
+            assert_eq!(
+                result[0],
+                Value::List(LogicalType::String, vec!["Alice".into(), "Bob".into(),])
+            );
+        }
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    /// Test that the timestamp round-trips through lbug's internal timestamp
+    fn test_timestamp() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query(
+            "CREATE NODE TABLE Person(name STRING, registerTime TIMESTAMP, PRIMARY KEY(name));",
+        )?;
+        conn.query(
+            "CREATE (:Person {name: \"Alice\", registerTime: timestamp(\"2011-08-20 11:25:30\")});",
+        )?;
+        let mut add_person =
+            conn.prepare("CREATE (:Person {name: $name, registerTime: $time});")?;
+        let timestamp = datetime!(2011-08-20 11:25:30 UTC);
+        conn.execute(
+            &mut add_person,
+            vec![
+                ("name", "Bob".into()),
+                ("time", Value::Timestamp(timestamp)),
+            ],
+        )?;
+        let result: HashSet<String> = conn
+            .query(
+                "MATCH (a:Person) WHERE a.registerTime = timestamp(\"2011-08-20 11:25:30\") RETURN a.name;",
+            )?
+            .map(|x| match &x[0] {
+                Value::String(x) => x.clone(),
+                _ => unreachable!(),
+            })
+            .collect();
+        assert_eq!(
+            result,
+            HashSet::from_iter(vec!["Alice".to_string(), "Bob".to_string()])
+        );
+        let mut result =
+            conn.query("MATCH (a:Person) WHERE a.name = \"Bob\" RETURN a.registerTime;")?;
+        let result: time::OffsetDateTime =
+            if let Value::Timestamp(timestamp) = result.next().unwrap()[0] {
+                timestamp
+            } else {
+                panic!("Wrong type returned!")
+            };
+        assert_eq!(result, timestamp);
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    fn test_node() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")?;
+        conn.query("CREATE (:Person {name: \"Alice\", age: 25});")?;
+        let result = conn.query("MATCH (a:Person) RETURN a;")?.next().unwrap();
+        assert_eq!(
+            result[0],
+            Value::Node(NodeVal {
+                id: InternalID {
+                    table_id: 0,
+                    offset: 0
+                },
+                label: "Person".to_string(),
+                properties: vec![
+                    ("name".to_string(), Value::String("Alice".to_string())),
+                    ("age".to_string(), Value::Int64(25))
+                ]
+            })
+        );
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    fn test_recursive_rel() -> Result<()> {
+        let temp_dir = tempfile::TempDir::new()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(name STRING, age INT64, PRIMARY KEY(name));")?;
+        conn.query("CREATE REL TABLE knows(FROM Person TO Person);")?;
+        conn.query("CREATE (:Person {name: \"Alice\", age: 25});")?;
+        conn.query("CREATE (:Person {name: \"Bob\", age: 25});")?;
+        conn.query("CREATE (:Person {name: \"Eve\", age: 25});")?;
+        conn.query(
+            "MATCH (p1:Person), (p2:Person)
+                WHERE p1.name = \"Alice\" AND p2.name = \"Bob\"
+            CREATE (p1)-[:knows]->(p2);",
+        )?;
+        conn.query(
+            "MATCH (p1:Person), (p2:Person)
+                WHERE p1.name = \"Bob\" AND p2.name = \"Eve\"
+            CREATE (p1)-[:knows]->(p2);",
+        )?;
+        let result = conn
+            .query(
+                "MATCH (a:Person)-[e*2..2]->(b:Person)
+                 WHERE a.name = 'Alice'
+                 RETURN e, b.name;",
+            )?
+            .next()
+            .unwrap();
+        assert_eq!(result[1], Value::String("Eve".to_string()));
+        assert_eq!(
+            result[0],
+            Value::RecursiveRel {
+                nodes: vec![NodeVal {
+                    id: (1, 0).into(),
+                    label: "Person".into(),
+                    properties: vec![("name".into(), "Bob".into()), ("age".into(), 25i64.into())]
+                },],
+                rels: vec![
+                    RelVal::new((0, 0), (1, 0), "knows"),
+                    RelVal::new((1, 0), (2, 0), "knows"),
+                ],
+            }
+        );
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    /// Test that null values are read correctly by the API
+    fn test_null() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        let result = conn.query("RETURN null")?.next();
+        let result = &result.unwrap()[0];
+        assert_eq!(result, &Value::Null(LogicalType::String));
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    /// Tests that passing the values through the database returns what we put in
+    fn test_serial() -> Result<()> {
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query("CREATE NODE TABLE Person(id SERIAL, name STRING, PRIMARY KEY(id));")?;
+        conn.query("CREATE (:Person {name: \"Bob\"});")?;
+        conn.query("CREATE (:Person {name: \"Alice\"});")?;
+        let result = conn.query("MATCH (a:Person) RETURN a.name, a.id;")?;
+        assert_eq!(
+            result.get_column_data_types(),
+            vec![LogicalType::String, LogicalType::Serial]
+        );
+        let results: Vec<(Value, Value)> = result
+            .map(|mut x| (x.pop().unwrap(), x.pop().unwrap()))
+            .collect();
+        assert_eq!(
+            results,
+            vec![
+                (Value::Int64(0), "Bob".into()),
+                (Value::Int64(1), "Alice".into())
+            ]
+        );
+        temp_dir.close()?;
+        Ok(())
+    }
+
+    #[test]
+    /// Tests that passing the values through the database returns what we put in
+    fn test_union() -> Result<()> {
+        use std::fs::File;
+        use std::io::Write;
+        let temp_dir = tempfile::tempdir()?;
+        let db = Database::new(temp_dir.path().join("test"), SYSTEM_CONFIG_FOR_TESTS)?;
+        let conn = Connection::new(&db)?;
+        conn.query(
+            "CREATE NODE TABLE demo(a SERIAL, b UNION(num INT64, str STRING), PRIMARY KEY(a));",
+        )?;
+        let mut file = File::create(temp_dir.path().join("demo.csv"))?;
+        file.write_all(b"1\naa\n")?;
+        conn.query(&format!(
+            "COPY demo from '{}/demo.csv';",
+            // Use forward-slashes instead of backslashes on windows, as thmay not be supported by
+            // the query parser
+            temp_dir.path().display().to_string().replace('\\', "/")
+        ))?;
+        let result = conn.query("MATCH (d:demo) RETURN d.b;")?;
+        let types = vec![
+            ("num".to_string(), LogicalType::Int64),
+            ("str".to_string(), LogicalType::String),
+        ];
+        assert_eq!(
+            result.get_column_data_types(),
+            vec![LogicalType::Union {
+                types: types.clone()
+            }],
+        );
+        let results: Vec<Value> = result.map(|mut x| x.pop().unwrap()).collect();
+        assert_eq!(
+            results,
+            vec![
+                Value::Union {
+                    types: types.clone(),
+                    value: Box::new(Value::Int64(1))
+                },
+                Value::Union {
+                    types: types.clone(),
+                    value: Box::new(Value::String("aa".to_string()))
+                },
+            ]
+        );
+        temp_dir.close()?;
+        Ok(())
+    }
+}
diff --git a/graph-wasm/src/main.rs b/graph-wasm/src/main.rs
new file mode 100644
index 0000000000..5a2ce86267
--- /dev/null
+++ b/graph-wasm/src/main.rs
@@ -0,0 +1,497 @@
+use std::collections::HashMap;
+use std::rc::Rc;
+use std::sync::Mutex;
+
+use lbug::{get_storage_version, Connection, Database, SystemConfig, Value};
+use uuid::Uuid;
+
+pub(crate) static mut STATE: Option<Box<State>> = None;
+
+// Buffer for returning UUID vectors from WASM
+static SIMILAR_SHAPES_BUFFER: Mutex<Option<Vec<u8>>> = Mutex::new(None);
+
+fn write_uuid_vec(uuids: Vec<Uuid>) -> *mut u8 {
+    // Serialize UUIDs: first 4 bytes = count (u32), then 16 bytes per UUID
+    let count = uuids.len() as u32;
+    let mut buffer = Vec::with_capacity(4 + (uuids.len() * 16));
+
+    // Write count (4 bytes, little-endian)
+    buffer.extend_from_slice(&count.to_le_bytes());
+
+    // Write each UUID (16 bytes each)
+    for uuid in &uuids {
+        let bytes = uuid.as_bytes();
+        buffer.extend_from_slice(bytes);
+    }
+
+    // Store buffer in global Mutex and return pointer
+    // The buffer will remain valid until free_similar_shapes_buffer is called
+    let mut guard = SIMILAR_SHAPES_BUFFER.lock().unwrap();
+
+    // Clear any existing buffer first
+    *guard = Some(buffer);
+
+    // Get pointer after storing (matches render-wasm pattern)
+    let stored_buffer = guard.as_ref().unwrap();
+    let ptr = stored_buffer.as_ptr() as *mut u8;
+
+    ptr
+}
+
+pub(crate) struct State {
+    pub current_id: Option<Uuid>,
+    pub shapes: HashMap<Uuid, Shape>,
+    pub conn: Connection<'static>,
+    _db: Rc<Database>,
+}
+
+impl State {
+    pub fn new() -> Self {
+        // NOTE: Using the default SystemConfig tries to mmap a large
+        // buffer pool (e.g. 1GB) which easily fails in WASM/browser
+        // environments. We explicitly cap the buffer pool size to a
+        // small value so we can re‑initialize the database multiple
+        // times (e.g. when changing pages) without exhausting memory.
+        let config = SystemConfig::default().buffer_pool_size(64 * 1024 * 1024); // 64 MB buffer pool
+
+        let db = Database::in_memory(config).expect("Failed to create database");
+        let db_rc = Rc::new(db);
+        // SAFETY: We're extending the lifetime of the database reference to 'static.
+        // This is safe because:
+        // 1. The Database is owned by Rc in State and will live as long as State exists
+        // 2. State is stored in a Box in a static, so it lives for the program's lifetime
+        // 3. The Connection will not outlive the Database since both are in the same State struct
+        let db_ref: &'static Database = unsafe { &*(Rc::as_ptr(&db_rc) as *const Database) };
+        let conn = Connection::new(db_ref).expect("Failed to create connection");
+
+        let query = format!("CREATE NODE TABLE Node (id UUID, type INT32, left DOUBLE, top DOUBLE, right DOUBLE, bottom DOUBLE, canonical_form STRING, PRIMARY KEY (id));");
+        conn.query(&query).expect("Failed to create table");
+
+        let query = format!("CREATE REL TABLE PARENT_OF (FROM Node TO Node);");
+        conn.query(&query)
+            .expect("Failed to create parent of relation table");
+
+        State {
+            current_id: None,
+            shapes: HashMap::new(),
+            conn,
+            _db: db_rc,
+        }
+    }
+
+    pub fn current_shape_mut(&mut self) -> Option<&mut Shape> {
+        self.shapes.get_mut(&self.current_id?)
+    }
+
+    pub fn use_shape(&mut self, id: Uuid) {
+        if !self.shapes.contains_key(&id) {
+            self.shapes.insert(
+                id,
+                Shape {
+                    id,
+                    parent_id: None,
+                    shape_type: Type::Rect,
+                    children: Vec::new(),
+                    selrect: Selrect::new(0.0, 0.0, 0.0, 0.0),
+                    canonical_form: "".to_string(),
+                },
+            );
+            let query = format!(
+                "CREATE (:Node {{id: '{}', type: {}, left: {}, top: {}, right: {}, bottom: {}}});",
+                id,
+                Type::Rect as i32,
+                0.0,
+                0.0,
+                0.0,
+                0.0
+            );
+            self.conn.query(&query).expect("Failed to create node");
+        }
+        self.current_id = Some(id);
+    }
+
+    pub fn set_parent_for_current_shape(&mut self, id: Uuid) {
+        let Some(shape) = self.current_shape_mut() else {
+            panic!("Invalid current shape")
+        };
+
+        // If the shape already has the same parent, do nothing
+        if shape.parent_id == Some(id) {
+            return;
+        }
+
+        if !self.shapes.contains_key(&id) {
+            self.shapes.insert(
+                id,
+                Shape {
+                    id,
+                    parent_id: None,
+                    shape_type: Type::Rect,
+                    children: Vec::new(),
+                    selrect: Selrect::new(0.0, 0.0, 0.0, 0.0),
+                    canonical_form: "".to_string(),
+                },
+            );
+            let query = format!(
+                "CREATE (:Node {{id: '{}', type: {}, left: {}, top: {}, right: {}, bottom: {}}});",
+                id,
+                Type::Rect as i32,
+                0.0,
+                0.0,
+                0.0,
+                0.0
+            );
+            self.conn.query(&query).expect("Failed to create node");
+        }
+
+        // Safely get mutable reference to the parent shape and add the current shape as its child
+        if let Some(parent_shape) = self.shapes.get_mut(&id) {
+            if let Some(current_id) = self.current_id {
+                parent_shape.add_child(current_id);
+            }
+        }
+    }
+
+    pub fn canonicalize_shapes(&mut self, id: Uuid) -> String {
+        // --- Reading ---
+        let (shape_type_name, children) = {
+            let shape = self.shapes.get(&id).expect("Shape not found");
+            (shape.shape_type.name().to_string(), shape.children.clone())
+        };
+
+        // --- Recursion ---
+        let canonical = if children.is_empty() {
+            shape_type_name
+        } else {
+            let mut child_forms = Vec::new();
+
+            for child_id in children {
+                if self.shapes.contains_key(&child_id) {
+                    let canonical = self.canonicalize_shapes(child_id);
+                    child_forms.push(canonical);
+                }
+            }
+
+            child_forms.sort();
+            format!("{}[{}]", shape_type_name, child_forms.join(","))
+        };
+
+        // --- Writting ---
+        if let Some(shape) = self.shapes.get_mut(&id) {
+            shape.canonical_form = canonical.clone();
+        }
+
+        canonical
+    }
+
+    pub fn generate_db(&mut self) {
+        println!("Generating DB");
+        println!("Canonicalizing shapes");
+        self.canonicalize_shapes(Uuid::nil());
+        println!("Canonicalized shapes");
+        for (id, shape) in self.shapes.iter() {
+            let query = format!(
+                "MATCH (n:Node {{id: '{}'}}) SET n.type = {}, n.left = {}, n.top = {}, n.right = {}, n.bottom = {}, n.canonical_form = '{}';",
+                id,
+                shape.shape_type.clone() as i32,
+                shape.selrect.left,
+                shape.selrect.top,
+                shape.selrect.right,
+                shape.selrect.bottom,
+                shape.canonical_form.replace('\'', "\\'")
+            );
+            self.conn
+                .query(&query)
+                .expect("Failed to update shape attributes");
+        }
+        println!("Generated DB");
+    }
+
+    pub fn search_similar_shapes(&mut self, id: Uuid) -> Vec<Uuid> {
+        // Calculate canonical form for the given shape
+        let canonical = self
+            .shapes
+            .get(&id)
+            .expect("Shape not found")
+            .canonical_form
+            .clone();
+
+        // Query the database for all nodes with the same canonical_form
+        // Note: We'll filter out the original id in the code below
+        let query = format!(
+            "MATCH (n:Node {{canonical_form: '{}'}}) RETURN n.id AS id;",
+            canonical
+        );
+
+        let result = self
+            .conn
+            .query(&query)
+            .expect("Failed to query similar shapes");
+
+        // Parse results - QueryResult is iterable and returns Vec<Value> for each row
+        let mut similar_shapes = Vec::new();
+
+        for row in result {
+            if !row.is_empty() {
+                let id_value = &row[0];
+                match id_value {
+                    Value::UUID(uuid) => {
+                        // Exclude the original shape id
+                        if *uuid != id {
+                            similar_shapes.push(*uuid);
+                        }
+                    }
+                    Value::String(uuid_str) => {
+                        // If stored as string, parse it
+                        if let Ok(uuid) = Uuid::parse_str(uuid_str) {
+                            // Exclude the original shape id
+                            if uuid != id {
+                                similar_shapes.push(uuid);
+                            }
+                        }
+                    }
+                    _ => {
+                        // Skip if not a UUID or String
+                        eprintln!(
+                            "Warning: Expected UUID or String for id, got: {:?}",
+                            id_value
+                        );
+                    }
+                }
+            }
+        }
+
+        similar_shapes
+    }
+}
+
+#[derive(Debug, Clone)]
+pub struct Selrect {
+    pub left: f32,
+    pub top: f32,
+    pub right: f32,
+    pub bottom: f32,
+}
+
+impl Selrect {
+    pub fn new(left: f32, top: f32, right: f32, bottom: f32) -> Self {
+        Self {
+            left,
+            top,
+            right,
+            bottom,
+        }
+    }
+}
+
+#[derive(Debug, Clone)]
+pub enum Type {
+    Frame,
+    Group,
+    Bool,
+    Rect,
+    Path,
+    Text,
+    Circle,
+    SVGRaw,
+}
+
+impl Type {
+    pub fn name(&self) -> &'static str {
+        match self {
+            Type::Frame => "Frame",
+            Type::Group => "Group",
+            Type::Bool => "Bool",
+            Type::Rect => "Rect",
+            Type::Path => "Path",
+            Type::Text => "Text",
+            Type::Circle => "Circle",
+            Type::SVGRaw => "SVGRaw",
+        }
+    }
+}
+
+#[derive(Debug, Clone)]
+pub struct Shape {
+    pub id: Uuid,
+    pub parent_id: Option<Uuid>,
+    pub shape_type: Type,
+    pub children: Vec<Uuid>,
+    pub selrect: Selrect,
+    pub canonical_form: String,
+}
+
+impl Shape {
+    pub fn new(id: Uuid) -> Self {
+        Self {
+            id,
+            parent_id: None,
+            shape_type: Type::Rect,
+            children: Vec::new(),
+            selrect: Selrect::new(0.0, 0.0, 0.0, 0.0),
+            canonical_form: "".to_string(),
+        }
+    }
+
+    pub fn set_parent(&mut self, id: Uuid) {
+        self.parent_id = Some(id);
+    }
+
+    pub fn set_shape_type(&mut self, shape_type: Type) {
+        self.shape_type = shape_type;
+    }
+
+    pub fn set_selrect(&mut self, left: f32, top: f32, right: f32, bottom: f32) {
+        self.selrect = Selrect::new(left, top, right, bottom);
+    }
+
+    pub fn add_child(&mut self, id: Uuid) {
+        if !self.children.contains(&id) && id != self.id {
+            self.children.push(id);
+        }
+    }
+}
+
+#[macro_export]
+macro_rules! with_state {
+    ($state:ident, $block:block) => {{
+        let $state = unsafe {
+            #[allow(static_mut_refs)]
+            STATE.as_ref()
+        }
+        .expect("Got an invalid state pointer");
+        $block
+    }};
+}
+
+#[macro_export]
+macro_rules! with_state_mut {
+    ($state:ident, $block:block) => {{
+        let $state = unsafe {
+            #[allow(static_mut_refs)]
+            STATE.as_mut()
+        }
+        .expect("Got an invalid state pointer");
+        $block
+    }};
+}
+
+#[macro_export]
+macro_rules! with_current_shape_mut {
+    ($state:ident, |$shape:ident: &mut Shape| $block:block) => {
+        let $state = unsafe {
+            #[allow(static_mut_refs)]
+            STATE.as_mut()
+        }
+        .expect("Got an invalid state pointer");
+
+        if let Some($shape) = $state.current_shape_mut() {
+            $block
+        }
+    };
+}
+
+pub fn uuid_from_u32_quartet(a: u32, b: u32, c: u32, d: u32) -> Uuid {
+    let hi: u64 = ((a as u64) << 32) | b as u64;
+    let lo: u64 = ((c as u64) << 32) | d as u64;
+    Uuid::from_u64_pair(hi, lo)
+}
+
+#[no_mangle]
+pub extern "C" fn init() {
+    let state_box = Box::new(State::new());
+    unsafe {
+        STATE = Some(state_box);
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn hello() {
+    println!(
+        "Hello from graph-wasm!!!, storage version: {}",
+        get_storage_version()
+    );
+
+    with_state!(state, {
+        state
+            .conn
+            .query("CREATE (:Person {name: 'Alice', age: 25});")
+            .expect("Failed to create node");
+        state
+            .conn
+            .query("CREATE (:Person {name: 'Bob', age: 30});")
+            .expect("Failed to create node");
+        let result = state
+            .conn
+            .query("MATCH (a:Person) RETURN a.name AS NAME, a.age AS AGE;")
+            .expect("Failed to query");
+        println!("result: {:?}", result);
+    });
+}
+
+#[no_mangle]
+pub extern "C" fn use_shape(a: u32, b: u32, c: u32, d: u32) {
+    with_state_mut!(state, {
+        let id = uuid_from_u32_quartet(a, b, c, d);
+        state.use_shape(id);
+    });
+}
+
+#[no_mangle]
+pub extern "C" fn set_shape_parent(a: u32, b: u32, c: u32, d: u32) {
+    with_state_mut!(state, {
+        let id = uuid_from_u32_quartet(a, b, c, d);
+        state.set_parent_for_current_shape(id);
+    });
+}
+
+#[no_mangle]
+pub extern "C" fn set_shape_type(shape_type: u8) {
+    with_current_shape_mut!(state, |shape: &mut Shape| {
+        let shape_type: Type = match shape_type {
+            0 => Type::Frame,
+            1 => Type::Group,
+            2 => Type::Bool,
+            3 => Type::Rect,
+            4 => Type::Path,
+            5 => Type::Text,
+            6 => Type::Circle,
+            7 => Type::SVGRaw,
+            _ => panic!("Invalid shape type: {}", shape_type),
+        };
+        shape.set_shape_type(shape_type.clone());
+    });
+}
+
+#[no_mangle]
+pub extern "C" fn set_shape_selrect(left: f32, top: f32, right: f32, bottom: f32) {
+    with_current_shape_mut!(state, |shape: &mut Shape| {
+        shape.set_selrect(left, top, right, bottom);
+    });
+}
+
+#[no_mangle]
+pub extern "C" fn generate_db() {
+    with_state_mut!(state, {
+        state.generate_db();
+    });
+}
+
+#[no_mangle]
+pub extern "C" fn search_similar_shapes(a: u32, b: u32, c: u32, d: u32) -> *mut u8 {
+    let similar_shapes = with_state_mut!(state, {
+        let id = uuid_from_u32_quartet(a, b, c, d);
+        state.search_similar_shapes(id)
+    });
+    write_uuid_vec(similar_shapes)
+}
+
+#[no_mangle]
+pub extern "C" fn free_similar_shapes_buffer() {
+    let mut guard = SIMILAR_SHAPES_BUFFER.lock().unwrap();
+    *guard = None;
+}
+
+fn main() {
+    // Entry point for WASM module
+}
diff --git a/graph-wasm/watch b/graph-wasm/watch
new file mode 100755
index 0000000000..5823cf4e26
--- /dev/null
+++ b/graph-wasm/watch
@@ -0,0 +1,24 @@
+#!/usr/bin/env bash
+
+_SCRIPT_DIR=$(dirname $0);
+pushd $_SCRIPT_DIR;
+
+. ./_build_env
+
+set -x
+# Hacemos un build inicial y copiamos artefactos.
+build;
+copy_artifacts "../frontend/resources/public/js";
+copy_shared_artifact;
+
+# Ahora solo observamos cambios reales de código; evitamos llamar a ./build
+# desde cargo-watch porque tocaría artefactos y re-dispararía el watcher.
+cargo watch \
+      --watch src \
+      --watch exports.txt \
+      --ignore "../frontend/resources/public/js/$BUILD_NAME.*" \
+      --ignore build.log \
+      -x "build $CARGO_PARAMS" \
+      -s "bash -lc 'source ./_build_env; copy_artifacts \"../frontend/resources/public/js\"; copy_shared_artifact; echo \"DONE\"'";
+
+popd